{"meta":{"query_hash":"7d5e525c1154","filters":{"venue":"Lecture notes in computer science"},"cohort_total":11332,"direct_labels_cover":8,"predictions_cover":11332,"exported":11332,"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/7d5e525c1154","api":"https://metacan.xera.ac/api/v1/cohort?venue=Lecture+notes+in+computer+science"},"results":[{"id":"W100026819","doi":"10.1007/978-3-642-33179-4_65","title":"Sketch-Line Interactions for 3D Image Visualization and Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Sketch; Computer science; Computer vision; Line (geometry); Visualization; Line segment; Object (grammar); Computer graphics (images); Artificial intelligence; Volume (thermodynamics); Image (mathematics); Orientation (vector space); Surface (topology); Algorithm; Geometry; Mathematics","score_opus":0.02258247950018198,"score_gpt":0.3129505038725972,"score_spread":0.2903680243724152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100026819","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.0039572697,0.0009991366,0.97828466,0.00009058928,0.00011956667,0.00007215812,0.00023851622,0.0066043367,0.009633804],"genre_scores_gemma":[0.13777965,0.003029722,0.8024777,0.00020003965,0.00016619668,0.00035154237,0.0012426794,0.0032154697,0.051537022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995946,0.00007816005,0.000020853342,0.000055219065,0.00021679651,0.000034419438],"domain_scores_gemma":[0.9992188,0.0004134026,0.000029231815,0.00016092595,0.00012648835,0.000051144132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036381738,0.0018536478,0.0006205536,0.0008363019,0.00041606274,0.0019538892,0.0016791759,0.0012783324,0.07432442],"category_scores_gemma":[0.0020899246,0.0006632857,0.0006693358,0.0009905437,0.0004194363,0.002032651,0.0025497358,0.001066701,0.011524559],"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.00047837023,0.00013493703,0.00036285765,0.0011463172,0.0000731652,0.00044903404,0.0007397219,0.012881106,0.19509295,0.03281189,0.047162622,0.70866704],"study_design_scores_gemma":[0.00020293045,0.00037258363,0.0014466407,0.00036813898,0.000130495,0.002633324,0.000498839,0.31587723,0.22590455,0.043276284,0.40909994,0.00018903548],"about_ca_topic_score_codex":0.00041552327,"about_ca_topic_score_gemma":0.00078182446,"teacher_disagreement_score":0.07432442,"about_ca_system_score_codex":0.00020921178,"about_ca_system_score_gemma":0.00017800413,"threshold_uncertainty_score":0.24864},"labels":[],"label_agreement":null},{"id":"W100047375","doi":"10.1007/978-3-642-34413-8_5","title":"Parallel Algorithm Configuration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Solver; Variety (cybernetics); State space; Algorithm; Parallel algorithm; State (computer science); Scale (ratio); Parallel computing; Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.02042844678248977,"score_gpt":0.25912248163027274,"score_spread":0.23869403484778295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100047375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032895193,0.0008426215,0.68087065,0.00102485,0.0016037857,0.0008279759,0.004698578,0.049827356,0.22740899],"genre_scores_gemma":[0.32250324,0.00047755623,0.5603167,0.0005907724,0.00039692115,0.0011308003,0.011113393,0.011024196,0.092446476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991042,0.00014219862,0.000056424673,0.00029352304,0.00026324263,0.00014041789],"domain_scores_gemma":[0.9987465,0.00015595266,0.000029732935,0.00070444867,0.00028526675,0.00007808255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057896157,0.0015384796,0.0010788753,0.0013160075,0.0012617067,0.0023168062,0.0026251152,0.0011396289,0.106643744],"category_scores_gemma":[0.0032192036,0.00071569096,0.00077422516,0.0016334754,0.0004895425,0.002487391,0.0022700639,0.0015739354,0.03668621],"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.0019773825,0.00043397537,0.0016739086,0.00042456237,0.00015967133,0.0004588918,0.00011301259,0.05355963,0.023615608,0.05607785,0.16721565,0.69428986],"study_design_scores_gemma":[0.0007110449,0.00037777555,0.0016614698,0.00011256256,0.00019728627,0.0012959596,0.00017750135,0.43867686,0.09135804,0.16362698,0.30167654,0.00012793273],"about_ca_topic_score_codex":0.001572981,"about_ca_topic_score_gemma":0.00210507,"teacher_disagreement_score":0.106643744,"about_ca_system_score_codex":0.0008891874,"about_ca_system_score_gemma":0.0017646326,"threshold_uncertainty_score":0.35675883},"labels":[],"label_agreement":null},{"id":"W100161477","doi":"10.1007/978-3-642-39173-6_23","title":"Supporting a Participant-Centric Management of Obesity via a Self-improving Health Game","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Health and mHealth Applications","field":"Health Professions","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":"IGNIS Innovation (Canada); Simon Fraser University","funders":"","keywords":"Personalization; Computer science; Psychological intervention; Overweight; Recommender system; Weight management; Health management system; User engagement; Health care; Human–computer interaction; Obesity; Medicine; World Wide Web; Alternative medicine; Nursing","score_opus":0.046434727656033986,"score_gpt":0.38165908044402364,"score_spread":0.3352243527879897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100161477","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.56826866,0.00030458297,0.36286092,0.0026027209,0.00045615612,0.0016805814,0.00039194827,0.0053603896,0.058074057],"genre_scores_gemma":[0.7276783,0.00020037111,0.24779795,0.0007376344,0.000057537683,0.001100192,0.00037155126,0.000189136,0.021867372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995646,0.00017867523,0.000016625727,0.00009268152,0.00008227502,0.0000651534],"domain_scores_gemma":[0.9988544,0.0007028464,0.00005486936,0.00004607386,0.000057390233,0.00028443584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043639,0.0008070451,0.0002470922,0.00025325533,0.00033691459,0.000991683,0.0014825482,0.0008534571,0.009044172],"category_scores_gemma":[0.0023577453,0.00019475183,0.0003620761,0.000085793334,0.0003034747,0.00078143826,0.0020048756,0.0010341633,0.00115054],"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.005125742,0.03154898,0.026099924,0.0016481472,0.00045462514,0.0017354513,0.015253542,0.019056741,0.12938276,0.026622126,0.049797032,0.69327486],"study_design_scores_gemma":[0.005181734,0.019984335,0.053973813,0.0011294894,0.0008719336,0.0033789296,0.011234466,0.5289928,0.05686966,0.07286679,0.24502666,0.00048940995],"about_ca_topic_score_codex":0.00055992865,"about_ca_topic_score_gemma":0.0014522965,"teacher_disagreement_score":0.009044172,"about_ca_system_score_codex":0.00018856664,"about_ca_system_score_gemma":0.0005114478,"threshold_uncertainty_score":0.030255735},"labels":[],"label_agreement":null},{"id":"W1002013509","doi":"10.1007/978-3-319-18356-5_9","title":"An Improved Machine Learning Approach for Selecting a Polyhedral Model Transformation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Process (computing); Transformation (genetics); Feature selection; Classifier (UML); Selection (genetic algorithm); Machine learning; Key (lock); Pattern recognition (psychology); Algorithm","score_opus":0.029891830176709627,"score_gpt":0.27512301672772405,"score_spread":0.24523118655101442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1002013509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012320547,0.00005344102,0.99708635,0.000026324933,0.000027267033,0.00004233605,0.000048977,0.0006930582,0.00079026027],"genre_scores_gemma":[0.0646617,0.00012517374,0.9306446,0.00011215184,0.000059019778,0.0002375369,0.0006171758,0.00044255145,0.003100168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.00017168405,0.00006490535,0.00029513772,0.00045615368,0.00007140318],"domain_scores_gemma":[0.999006,0.00038812778,0.00006302851,0.00018684722,0.00032582786,0.00003019613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869594,0.0016121254,0.0020871765,0.0018305924,0.0007764051,0.0013540341,0.0022761011,0.0017118312,0.00901442],"category_scores_gemma":[0.0031022057,0.0008462814,0.0015700317,0.0017395945,0.00062552997,0.0012839485,0.0015866652,0.0025112843,0.0038196777],"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.00013441015,0.00015006123,0.0003880735,0.00018726893,0.000053626278,0.000093649054,0.000049796727,0.3644134,0.009616735,0.0098512145,0.0061855656,0.60887617],"study_design_scores_gemma":[0.0000075505004,0.000018313358,0.00005134291,0.000006801432,0.000007701808,0.000022371692,0.000006847798,0.99544144,0.0010539409,0.0021350458,0.00124323,0.0000054075463],"about_ca_topic_score_codex":0.00559417,"about_ca_topic_score_gemma":0.0065160384,"teacher_disagreement_score":0.00901442,"about_ca_system_score_codex":0.0005947092,"about_ca_system_score_gemma":0.0011291014,"threshold_uncertainty_score":0.030156255},"labels":[],"label_agreement":null},{"id":"W1002860787","doi":"10.1007/978-3-319-21070-4_35","title":"Analyzing Requirements Using Environment Modelling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"McMaster University","funders":"","keywords":"System requirements specification; Non-functional requirement; Computer science; Requirements elicitation; Correctness; Software requirements specification; Requirements management; Requirements analysis; Functional requirement; Requirements engineering; Systems engineering; System requirements; Requirement; Software engineering; Completeness (order theory); User requirements document; Process (computing); Formal specification; Software system; Engineering; Software; Programming language; Software construction","score_opus":0.13674639528465882,"score_gpt":0.3149992736032566,"score_spread":0.17825287831859776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1002860787","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.019276747,0.00017096063,0.9691813,0.0001540007,0.000018810808,0.00013899305,0.00014399664,0.0012663448,0.009648946],"genre_scores_gemma":[0.25195217,0.0006162524,0.7382758,0.000088173656,0.000021067117,0.00023591904,0.0010859699,0.00082680234,0.0068979324],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611676,0.001250629,0.00019674771,0.00034866517,0.0018229702,0.00026419756],"domain_scores_gemma":[0.9948525,0.0034802393,0.0003640615,0.000842414,0.0004028641,0.000057899426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139116,0.0013469766,0.00054933963,0.0020896848,0.0004149691,0.0024268425,0.0015419921,0.0009600825,0.004460941],"category_scores_gemma":[0.009756252,0.0010597071,0.0023103368,0.0016800386,0.0008069751,0.0033411568,0.0019520806,0.0014951263,0.0013475432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017347933,0.0002935209,0.0047629084,0.00077984185,0.00022135465,0.0014430434,0.0012096328,0.3988123,0.032425147,0.15695891,0.003921884,0.39899796],"study_design_scores_gemma":[0.000022470731,0.00010913009,0.0013671756,0.00018443499,0.00012939623,0.00059033104,0.00048133786,0.8687701,0.019241083,0.08473514,0.024314502,0.000054873897],"about_ca_topic_score_codex":0.0024114512,"about_ca_topic_score_gemma":0.0036664612,"teacher_disagreement_score":0.004460941,"about_ca_system_score_codex":0.00079186086,"about_ca_system_score_gemma":0.0010217207,"threshold_uncertainty_score":0.0149232745},"labels":[],"label_agreement":null},{"id":"W1007141672","doi":"10.1007/978-3-319-06089-7_17","title":"Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Set (abstract data type); Tree (set theory); Computer science; Cover (algebra); Set packing; Regular polygon; Algorithm; Combinatorics; Mathematics; Geometry; Programming language","score_opus":0.03398452180586774,"score_gpt":0.29139792932001957,"score_spread":0.2574134075141518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1007141672","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.18228528,0.010708865,0.6905525,0.0020892937,0.0005785608,0.00017854007,0.0010122838,0.0004371171,0.11215751],"genre_scores_gemma":[0.7802228,0.006610836,0.15677783,0.00032941584,0.0007954726,0.00036506852,0.0013993692,0.0003206787,0.053178586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990916,0.00016310878,0.000055221706,0.00015689594,0.00041391444,0.000119222364],"domain_scores_gemma":[0.9983039,0.0010950578,0.0001205179,0.00021574466,0.00013417844,0.0001306399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194536,0.0010615436,0.0016660977,0.0016349964,0.0017291124,0.004161639,0.0021022242,0.0018733026,0.007884674],"category_scores_gemma":[0.004402286,0.00078332686,0.0012091295,0.0043801526,0.0023835918,0.005439167,0.0027482111,0.003446759,0.0007654334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412419,0.000047003294,0.00037093926,0.00020898471,0.000028719223,0.00013067918,0.00030862194,0.04596391,0.001250171,0.90498644,0.006263625,0.040376805],"study_design_scores_gemma":[0.000009277278,0.000034052293,0.0003172345,0.000031692318,0.000012848107,0.00020300469,0.00008154182,0.12241526,0.00040015017,0.8722104,0.0042667645,0.000017810717],"about_ca_topic_score_codex":0.002398235,"about_ca_topic_score_gemma":0.0022488162,"teacher_disagreement_score":0.007884674,"about_ca_system_score_codex":0.0023170963,"about_ca_system_score_gemma":0.0008551128,"threshold_uncertainty_score":0.026376903},"labels":[],"label_agreement":null},{"id":"W1008706668","doi":"10.1007/978-3-642-22616-8_24","title":"Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Substring; Partition (number theory); Combinatorics; Partition problem; Time complexity; Constant (computer programming); Mathematics; String (physics); Permutation (music); Discrete mathematics; Alphabet; Exponential function; Algorithm; Computer science; Data structure; Physics","score_opus":0.018606079698248366,"score_gpt":0.23697858803514674,"score_spread":0.21837250833689836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1008706668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05544776,0.004152322,0.8786302,0.0062885513,0.00064187584,0.0005623337,0.002953848,0.0058298223,0.045493323],"genre_scores_gemma":[0.1773624,0.002173557,0.7905567,0.0009805266,0.00064912456,0.0009341147,0.0062896265,0.0019452681,0.019108651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962483,0.00076735346,0.00022410582,0.0011225934,0.0009899859,0.00064758724],"domain_scores_gemma":[0.98657066,0.009648491,0.0005680776,0.0019737412,0.0007642407,0.00047480146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117749,0.0030399053,0.0031415753,0.0022353705,0.0026135535,0.0077398284,0.0076185674,0.0040884465,0.021555413],"category_scores_gemma":[0.016811715,0.0017871215,0.0036800103,0.006440784,0.003251,0.015324936,0.0048555895,0.008740991,0.00497341],"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.0023800104,0.0011120979,0.0012408716,0.0013694864,0.00027281893,0.00016512348,0.000850567,0.13695064,0.0065531298,0.32439837,0.09214701,0.43255985],"study_design_scores_gemma":[0.0007351755,0.000111993904,0.00051329343,0.00009206193,0.00015554496,0.00021729518,0.00028731354,0.28810543,0.0029351013,0.6953311,0.011449991,0.000065726905],"about_ca_topic_score_codex":0.0059500365,"about_ca_topic_score_gemma":0.009248283,"teacher_disagreement_score":0.021555413,"about_ca_system_score_codex":0.0064146584,"about_ca_system_score_gemma":0.0057342877,"threshold_uncertainty_score":0.07211006},"labels":[],"label_agreement":null},{"id":"W100933795","doi":"10.1007/978-3-540-24582-7_24","title":"Counting Points on an Abelian Variety over a Finite Field","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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 Toronto","funders":"","keywords":"Computer science; Variety (cybernetics); Abelian group; Finite field; Field (mathematics); Theoretical computer science; Artificial intelligence; Discrete mathematics; Mathematics; Combinatorics; Pure mathematics","score_opus":0.011468665275932778,"score_gpt":0.23642422726870854,"score_spread":0.22495556199277578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100933795","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.575929,0.0014211301,0.31184575,0.0009579789,0.00041395833,0.0001679946,0.0004081864,0.0007447706,0.108111314],"genre_scores_gemma":[0.8515169,0.0011117979,0.10423107,0.0001182011,0.00043903087,0.0001617048,0.0006304687,0.00022552007,0.041565247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989467,0.00021538328,0.00008051125,0.0001932833,0.00042985816,0.00013429135],"domain_scores_gemma":[0.9977823,0.0012042513,0.00025174464,0.00025056838,0.00028478896,0.00022652085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371992,0.0014215404,0.001387481,0.0064563644,0.0019266062,0.0039042374,0.002371648,0.0015842114,0.005881704],"category_scores_gemma":[0.00385456,0.0006860067,0.00083059224,0.005684659,0.0032910956,0.009280254,0.0022425607,0.0021506618,0.0007906506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007497749,0.000031936255,0.0012434005,0.000110347966,0.000017417875,0.00017346369,0.0003108682,0.0019767545,0.0023580547,0.96771294,0.0017600105,0.02422988],"study_design_scores_gemma":[0.0000136708595,0.00003739468,0.0005887701,0.00003921493,0.00003010219,0.00033750877,0.00013055684,0.009329787,0.0026735757,0.9824808,0.0043161814,0.000022453703],"about_ca_topic_score_codex":0.0005015834,"about_ca_topic_score_gemma":0.0005096865,"teacher_disagreement_score":0.0064563644,"about_ca_system_score_codex":0.0011945656,"about_ca_system_score_gemma":0.00040205152,"threshold_uncertainty_score":0.019676208},"labels":[],"label_agreement":null},{"id":"W101003662","doi":"10.1007/978-3-642-38457-8_10","title":"Detecting Statistically Significant Temporal Associations from Multiple Event Sequences","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"Univariate; Multivariate statistics; Computer science; Event (particle physics); Data mining; Set (abstract data type); Constraint (computer-aided design); Artificial intelligence; Multivariate analysis; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.03246082356412998,"score_gpt":0.25720874411568134,"score_spread":0.22474792055155135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101003662","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.31815264,0.0013779398,0.67379296,0.00022797465,0.00019179934,0.00013884592,0.0012099972,0.0023112446,0.002596524],"genre_scores_gemma":[0.7453626,0.0010943947,0.24783416,0.000099216355,0.00034327258,0.0001347686,0.002341485,0.00024829592,0.002541877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995115,0.0000860501,0.000044244553,0.0001607448,0.00014252015,0.000055051056],"domain_scores_gemma":[0.99686396,0.0022168632,0.0003837976,0.00017285344,0.00018328661,0.00017930668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014528953,0.00082629855,0.0007055229,0.002440873,0.00039585168,0.00091940904,0.00065476337,0.00094538083,0.0031539297],"category_scores_gemma":[0.0050001326,0.0003610959,0.000775042,0.002327737,0.0003189955,0.0011836484,0.0010773019,0.0008682978,0.0015422191],"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.0019785243,0.00036609388,0.032447632,0.00039576125,0.00031265448,0.0012251732,0.00016755788,0.01452795,0.18907775,0.0033429097,0.0030492235,0.75310874],"study_design_scores_gemma":[0.00013641668,0.0009914744,0.10211653,0.000098009434,0.00051684567,0.0060419366,0.00032783402,0.78349185,0.07477576,0.025930177,0.0054702014,0.0001030232],"about_ca_topic_score_codex":0.0005781383,"about_ca_topic_score_gemma":0.0014146637,"teacher_disagreement_score":0.0031539297,"about_ca_system_score_codex":0.00014874144,"about_ca_system_score_gemma":0.00043774588,"threshold_uncertainty_score":0.010550916},"labels":[],"label_agreement":null},{"id":"W101006898","doi":"10.1007/978-3-540-78199-8_2","title":"A Review on Persian Script and Recognition Techniques","year":2008,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Collège de Maisonneuve","funders":"","keywords":"Persian; Arabic; Alphabet; Arabic script; Natural language processing; Computer science; Linguistics; Artificial intelligence","score_opus":0.045037744360922394,"score_gpt":0.31603420570617013,"score_spread":0.27099646134524774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101006898","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091353257,0.98291045,0.008600246,0.00036670783,0.001195004,0.0000430756,0.00016273904,0.00017736596,0.0056308764],"genre_scores_gemma":[0.0038305195,0.97507656,0.010011418,0.00070096785,0.0010512271,0.00005369376,0.00046123718,0.00007370018,0.00874072],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995372,0.000053421925,0.000092379494,0.00008759637,0.00019781926,0.000031687385],"domain_scores_gemma":[0.99879336,0.00044734083,0.00013324375,0.0000754176,0.0005088458,0.000041753316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071479194,0.0011488189,0.0014621094,0.003654193,0.00031664092,0.0008875694,0.0015013224,0.0007874505,0.007876826],"category_scores_gemma":[0.0022349705,0.00042044112,0.0005046531,0.003887029,0.0004340002,0.001907939,0.00053946907,0.0007114846,0.0073469006],"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.00003286447,0.000029986004,0.00013135688,0.0041239513,0.000027576152,0.00008001615,0.000019104813,0.00018207935,0.0015636736,0.00065362797,0.016411189,0.9767446],"study_design_scores_gemma":[0.0000132593805,0.00015518953,0.0012710972,0.0023850573,0.00017559886,0.002319347,0.000053558768,0.000495845,0.006739432,0.001320751,0.98503286,0.000037901602],"about_ca_topic_score_codex":0.0011882156,"about_ca_topic_score_gemma":0.0016346812,"teacher_disagreement_score":0.007876826,"about_ca_system_score_codex":0.00032671972,"about_ca_system_score_gemma":0.0012181696,"threshold_uncertainty_score":0.026350558},"labels":[],"label_agreement":null},{"id":"W101213734","doi":"10.1007/978-3-642-21219-2_7","title":"Using Artificial Intelligence Techniques for Strategy Generation in the Commons Game","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Resource (disambiguation); Artificial intelligence; Commons; Hill climbing; Particle swarm optimization; Operations research; Climbing; Machine learning; Engineering","score_opus":0.1742777273187105,"score_gpt":0.34486408099615923,"score_spread":0.17058635367744873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101213734","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.017554983,0.00014683041,0.9702327,0.00021226678,0.000044811248,0.00010506033,0.000024132118,0.00027031163,0.01140881],"genre_scores_gemma":[0.42957848,0.00020915238,0.5627962,0.000116310286,0.00004880889,0.00026320165,0.00011404171,0.00013313553,0.0067407093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993199,0.000326404,0.00004005042,0.00009228518,0.00016830143,0.000052999974],"domain_scores_gemma":[0.99782443,0.0018400642,0.00006263441,0.0001357868,0.000093986826,0.00004305149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123031,0.0006372535,0.0005865814,0.0006501352,0.00054546585,0.001116557,0.0015043103,0.00088846247,0.0046625133],"category_scores_gemma":[0.0052315826,0.00035917276,0.0009096473,0.0006105533,0.0011472163,0.0019827029,0.0013403274,0.0016925669,0.00044148075],"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.00018517648,0.00026660328,0.0007799709,0.00029282385,0.000109666355,0.00019300608,0.0007008905,0.25325435,0.0072737453,0.42990106,0.003998127,0.30304456],"study_design_scores_gemma":[0.000036176865,0.00004625534,0.00011152636,0.00002223866,0.000021281687,0.00006214953,0.000050399816,0.81314325,0.0018738462,0.1825156,0.0021047753,0.000012458422],"about_ca_topic_score_codex":0.0015111716,"about_ca_topic_score_gemma":0.0021340572,"teacher_disagreement_score":0.0046625133,"about_ca_system_score_codex":0.0007248741,"about_ca_system_score_gemma":0.0006498146,"threshold_uncertainty_score":0.0155976415},"labels":[],"label_agreement":null},{"id":"W101359946","doi":"10.1007/978-3-642-24755-2_7","title":"Enhancing Query Support in HBase via an Extended Coprocessors Framework","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Coprocessor; Scalability; Relational database management system; Database; Cloud computing; NoSQL; Relational database; Operating system; Parallel computing","score_opus":0.01504537765270671,"score_gpt":0.2463179571942196,"score_spread":0.23127257954151287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101359946","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.08276237,0.0018393339,0.8867028,0.0006802369,0.00033179997,0.00027476743,0.0002433,0.02075527,0.0064100837],"genre_scores_gemma":[0.37419564,0.0009932644,0.6123955,0.0006590049,0.00030932584,0.00017042387,0.00092855433,0.0028962307,0.007452052],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786747,0.00029632307,0.00021879686,0.00028263024,0.0009915967,0.00034321242],"domain_scores_gemma":[0.9968587,0.00088523066,0.00014987127,0.0013706583,0.0005349671,0.00020050516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001959548,0.00080306135,0.0010713643,0.000831779,0.0006724973,0.003813157,0.003331496,0.0011047475,0.0027852405],"category_scores_gemma":[0.0054171253,0.0009280483,0.0010433671,0.0014473185,0.0006757691,0.0040743575,0.0025835608,0.0027466477,0.0009718617],"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.0023497536,0.0015066703,0.006136317,0.0009380048,0.0005631285,0.00093710533,0.0013195858,0.036593463,0.13125907,0.08058401,0.03775259,0.70006037],"study_design_scores_gemma":[0.00043120875,0.00052491686,0.0021408533,0.00015093834,0.0004540982,0.00090324954,0.0002766603,0.7392156,0.121863216,0.047056083,0.08677154,0.00021157833],"about_ca_topic_score_codex":0.0032727506,"about_ca_topic_score_gemma":0.0034305186,"teacher_disagreement_score":0.003813157,"about_ca_system_score_codex":0.00046360388,"about_ca_system_score_gemma":0.0012019089,"threshold_uncertainty_score":0.010363221},"labels":[],"label_agreement":null},{"id":"W1013643069","doi":"10.1007/978-3-319-11508-5_25","title":"Population Size Extrapolation in Relational Probabilistic Modelling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Extrapolation; Computer science; Probabilistic logic; Markov chain; Population; Statistical relational learning; Set (abstract data type); Plot (graphics); Relational database; Statistical model; Markov process; Theoretical computer science; Data mining; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.03420592477542824,"score_gpt":0.2466200634226255,"score_spread":0.21241413864719724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1013643069","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.006239963,0.0015932671,0.97993875,0.0009342149,0.00009335527,0.000019674462,0.00008336101,0.00015266107,0.010944773],"genre_scores_gemma":[0.5481806,0.006619089,0.41654634,0.0008708759,0.0010391558,0.00035206674,0.0005497791,0.0006688524,0.025173288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998629,0.00080552755,0.00005960782,0.00017652052,0.00028154821,0.00004782735],"domain_scores_gemma":[0.9863905,0.012076227,0.00032017555,0.00075306266,0.00030362164,0.00015636958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047329646,0.00061095966,0.0012605386,0.0010958173,0.00059649535,0.0015699607,0.0030675072,0.0017151608,0.0049269455],"category_scores_gemma":[0.023804815,0.00087073655,0.0013488355,0.00133517,0.0022764672,0.0047665737,0.002964011,0.0036708154,0.0008163977],"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.000013119623,0.000012869868,0.00040033873,0.00010494383,0.00003148264,0.000078155004,0.0001942313,0.1988152,0.00017506602,0.7745561,0.002020107,0.023598446],"study_design_scores_gemma":[0.0000021595417,0.0000035625542,0.00007373162,0.000022247543,0.000007984634,0.000035070498,0.0000115919765,0.37653872,0.00006867131,0.62174654,0.0014824801,0.000007259568],"about_ca_topic_score_codex":0.0030030052,"about_ca_topic_score_gemma":0.0023447056,"teacher_disagreement_score":0.0049269455,"about_ca_system_score_codex":0.0015051715,"about_ca_system_score_gemma":0.0004556211,"threshold_uncertainty_score":0.025030613},"labels":[],"label_agreement":null},{"id":"W101375639","doi":"10.1007/978-3-642-23641-9_46","title":"Reducing Total Energy for Reliability-Aware DVS Algorithms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Dynamic voltage scaling; Computer science; Energy consumption; Reliability (semiconductor); Scheduling (production processes); Energy (signal processing); Reliability engineering; Real-time computing; Embedded system; Algorithm; Power (physics); Mathematical optimization; Engineering","score_opus":0.020043384253223776,"score_gpt":0.2419421689192747,"score_spread":0.22189878466605092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101375639","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.07710417,0.0020418898,0.89871705,0.00075414707,0.00027774984,0.00011764168,0.0002554231,0.0017435404,0.018988464],"genre_scores_gemma":[0.650646,0.0007681243,0.33632344,0.000231052,0.00016227513,0.000110952824,0.0003812649,0.00046021485,0.010916685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945706,0.00014246607,0.000020507588,0.000066967514,0.00020832675,0.000104635554],"domain_scores_gemma":[0.99870956,0.0007726932,0.00006325876,0.00022538395,0.00017436729,0.00005476919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006779191,0.00087276706,0.00071816903,0.00070592476,0.00047425422,0.0008317085,0.0015367959,0.0005738091,0.006952814],"category_scores_gemma":[0.0032524494,0.00033245687,0.0005386141,0.001074009,0.00041239872,0.0010732214,0.0008279024,0.0009980063,0.0006392987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086357107,0.00026450044,0.0009259884,0.00031229857,0.00005800344,0.000057815003,0.00008518963,0.47490892,0.020369181,0.03405331,0.0111964205,0.45690483],"study_design_scores_gemma":[0.000060296825,0.00017431699,0.00039934198,0.000021958229,0.000025157522,0.00010439393,0.000039471357,0.9694379,0.0056528393,0.020940518,0.0031348227,0.0000090703215],"about_ca_topic_score_codex":0.0012977213,"about_ca_topic_score_gemma":0.0037003537,"teacher_disagreement_score":0.006952814,"about_ca_system_score_codex":0.0010310379,"about_ca_system_score_gemma":0.0011910434,"threshold_uncertainty_score":0.02325952},"labels":[],"label_agreement":null},{"id":"W1014362250","doi":"10.1007/978-3-319-20889-3_12","title":"Heuristic Evaluation of University Institutional Repositories Based on DSpace","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Dalhousie University","funders":"","keywords":"DSPACE; Computer science; Heuristic; World Wide Web; Programming language; Software engineering; Operating system; Database; Artificial intelligence; Algorithm","score_opus":0.05686465305087272,"score_gpt":0.274668920648951,"score_spread":0.21780426759807828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1014362250","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.97047967,0.00061485707,0.015688138,0.00011437704,0.000028019676,0.0005028306,0.00112242,0.00067136757,0.010778294],"genre_scores_gemma":[0.9677876,0.00012469944,0.02901605,0.000016837364,0.0000096956255,0.00009635309,0.0018530473,0.000038739432,0.0010568682],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98781455,0.006146924,0.001042817,0.0007762407,0.0037322538,0.00048717164],"domain_scores_gemma":[0.9090377,0.06946518,0.0036103507,0.00621085,0.009446412,0.00222947],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00821581,0.0006506147,0.0011432066,0.01145522,0.0009656648,0.004688676,0.0019262672,0.0010080568,0.004906579],"category_scores_gemma":[0.061053894,0.0002651001,0.00062090677,0.008159231,0.0007694733,0.0038592168,0.0023209278,0.0005436007,0.00062996603],"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.01188252,0.0051978608,0.14110617,0.0029838018,0.00071668625,0.0005946197,0.0033663,0.10733663,0.0062107546,0.014826361,0.006689584,0.69908863],"study_design_scores_gemma":[0.0007992129,0.003963878,0.07070265,0.00048382924,0.00054277555,0.00033194778,0.006542346,0.8890127,0.012932097,0.008228058,0.006287732,0.0001728322],"about_ca_topic_score_codex":0.008187929,"about_ca_topic_score_gemma":0.0112571595,"teacher_disagreement_score":0.9953113,"about_ca_system_score_codex":0.002034483,"about_ca_system_score_gemma":0.0019758316,"threshold_uncertainty_score":0.04344988},"labels":[],"label_agreement":null},{"id":"W101497066","doi":"10.1007/978-3-540-73368-3_41","title":"Structural Abstraction of Software Verification Conditions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Abstraction; Software verification; Software; Programming language; Context (archaeology); Statement (logic); Verification and validation; Software framework; Theoretical computer science; Software construction; Software system; Mathematics","score_opus":0.043871529287082996,"score_gpt":0.3166956051957158,"score_spread":0.27282407590863283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101497066","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.008148692,0.000495405,0.95765746,0.00032778858,0.00019163897,0.00010219556,0.00010904649,0.0010647235,0.031903148],"genre_scores_gemma":[0.52466434,0.0011341738,0.4496519,0.0003358016,0.00044755082,0.00042634647,0.00058811804,0.00068661274,0.022065066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791604,0.00059376494,0.000150614,0.0002917079,0.000815409,0.00023252079],"domain_scores_gemma":[0.9966484,0.0018219362,0.00018860355,0.0007685289,0.00048578126,0.00008673823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020857558,0.00093829347,0.0006666925,0.0015465396,0.00070484146,0.0016922744,0.0011855807,0.00083349436,0.009093189],"category_scores_gemma":[0.0057468372,0.0008629301,0.0012405448,0.0010343657,0.0032098896,0.0049943165,0.00209978,0.0031132365,0.0024065524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039126924,0.00001614891,0.00007232596,0.000095625546,0.000007795575,0.0000662873,0.00018239884,0.0034679566,0.0023409978,0.9646292,0.0015896894,0.0274926],"study_design_scores_gemma":[0.000026935499,0.000040178962,0.00011699255,0.00006673604,0.000031699416,0.00012577385,0.000042181266,0.021885823,0.005637656,0.9499218,0.022088148,0.000015988475],"about_ca_topic_score_codex":0.00060475664,"about_ca_topic_score_gemma":0.00064107386,"teacher_disagreement_score":0.009093189,"about_ca_system_score_codex":0.0013520528,"about_ca_system_score_gemma":0.0012635792,"threshold_uncertainty_score":0.030419767},"labels":[],"label_agreement":null},{"id":"W1015545679","doi":"10.1007/978-3-319-17040-4_12","title":"HGABAC: Towards a Formal Model of Hierarchical Attribute-Based Access Control","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":65,"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":"Role-based access control; Computer science; Access control; Mandatory access control; Abstraction; Object (grammar); Control (management); Discretionary access control; Formal description; Software engineering; Distributed computing; Database; Computer security; Programming language; Artificial intelligence","score_opus":0.06104627247136883,"score_gpt":0.3260212957806216,"score_spread":0.26497502330925277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1015545679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014398288,0.00027588295,0.993971,0.00040877398,0.000087966415,0.0001272499,0.00022856695,0.000904767,0.0025559254],"genre_scores_gemma":[0.12325082,0.0009527838,0.86441284,0.00092991453,0.00025571603,0.0009027794,0.0009693329,0.0005625825,0.007763165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99041474,0.0031014958,0.0011063112,0.0013294219,0.0032409702,0.0008071604],"domain_scores_gemma":[0.9913325,0.0036276216,0.000595529,0.002453805,0.0015749834,0.00041565884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008166087,0.001157321,0.0014380633,0.002137429,0.0024370572,0.00982183,0.0060526635,0.0033031285,0.0058488348],"category_scores_gemma":[0.014199126,0.0018634088,0.0026429358,0.003587347,0.007479211,0.013159064,0.0055099614,0.009804288,0.0022818053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002954846,0.000032539316,0.00022708664,0.00012839785,0.00002378088,0.00007635434,0.0004739159,0.009422777,0.00088955427,0.97236055,0.0028687015,0.0134668145],"study_design_scores_gemma":[0.00003491191,0.000028923343,0.00012791016,0.00011921832,0.00006371294,0.00016012207,0.00013091686,0.10539984,0.0028654302,0.8493833,0.0416344,0.000051305],"about_ca_topic_score_codex":0.012495882,"about_ca_topic_score_gemma":0.0075255632,"teacher_disagreement_score":0.012495882,"about_ca_system_score_codex":0.0037668233,"about_ca_system_score_gemma":0.0055414992,"threshold_uncertainty_score":0.043186903},"labels":[],"label_agreement":null},{"id":"W1018939436","doi":"10.1007/978-3-319-17040-4_1","title":"On Acoustic Covert Channels Between Air-Gapped Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":53,"is_retracted":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":"Computer science; Ultrasonic sensor; Covert channel; Covert; Real-time computing; Malware; Word error rate; Acoustics; Speech recognition; Computer security; Operating system; Physics","score_opus":0.0262144958343961,"score_gpt":0.2517378049552877,"score_spread":0.22552330912089158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1018939436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15283193,0.0038520324,0.69904536,0.0011648127,0.0010145662,0.000075373755,0.0001557996,0.00038228938,0.14147776],"genre_scores_gemma":[0.9466652,0.002093718,0.019524725,0.00023621337,0.0004263494,0.00005924926,0.00008617987,0.00010900527,0.030799257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919087,0.00020202885,0.00002051003,0.000116372,0.0002854827,0.00018477222],"domain_scores_gemma":[0.9978677,0.0015207314,0.00012820939,0.00022615556,0.00017609353,0.00008103976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265717,0.00078669004,0.00070597825,0.0005803649,0.0008170891,0.0016955481,0.0007927619,0.0012586946,0.008834001],"category_scores_gemma":[0.0034889241,0.00044454072,0.00040307423,0.0006146784,0.0017179095,0.002666357,0.0022609064,0.0020717976,0.00108504],"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.00033610765,0.00005964882,0.00037669242,0.00022326759,0.00003409696,0.000438946,0.00036081328,0.09937016,0.012458694,0.8355395,0.0052228984,0.045579083],"study_design_scores_gemma":[0.000030880663,0.00018935197,0.0003765933,0.00009772098,0.0000344756,0.0006451793,0.00020826106,0.41926572,0.007677779,0.5581553,0.013268529,0.00005017615],"about_ca_topic_score_codex":0.00041921786,"about_ca_topic_score_gemma":0.00036399325,"teacher_disagreement_score":0.008834001,"about_ca_system_score_codex":0.0006452845,"about_ca_system_score_gemma":0.00027386888,"threshold_uncertainty_score":0.029552698},"labels":[],"label_agreement":null},{"id":"W102317283","doi":"10.1007/978-3-642-31491-9_6","title":"Model Interchange Testing: A Process and a Case Study","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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; IBM (Canada)","funders":"","keywords":"Computer science; Unified Modeling Language; Software engineering; Process (computing); Systems Modeling Language; Model-based testing; Test (biology); Test case; Programming language; Software; Machine learning","score_opus":0.058819604032983766,"score_gpt":0.28849743359744956,"score_spread":0.2296778295644658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102317283","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.68387777,0.00047085783,0.27708784,0.0021675245,0.000090825204,0.002375779,0.00028490718,0.0009235818,0.032720968],"genre_scores_gemma":[0.832945,0.00034359223,0.15643176,0.00033901617,0.000020771991,0.0009439055,0.0004306159,0.00038983347,0.008155472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9835646,0.011644054,0.0005363142,0.00052956573,0.0029810483,0.0007443912],"domain_scores_gemma":[0.9571013,0.03090857,0.0014792464,0.004805113,0.0048006885,0.0009051179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014033173,0.0013722674,0.00075518753,0.0025824585,0.002874427,0.0034921165,0.0038175213,0.0044686412,0.004729453],"category_scores_gemma":[0.038271923,0.0006222949,0.0010457573,0.003381981,0.0020795816,0.0041548447,0.0043182685,0.002406406,0.0013669814],"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.0014154237,0.016427618,0.028682861,0.0012071908,0.00010680216,0.0156091405,0.04519354,0.032000218,0.021138683,0.064444505,0.010520192,0.7632538],"study_design_scores_gemma":[0.0013248676,0.019488998,0.032410182,0.0019206741,0.0005959522,0.023771686,0.059407715,0.48037356,0.13844071,0.13872622,0.10273971,0.00079975405],"about_ca_topic_score_codex":0.002857811,"about_ca_topic_score_gemma":0.0044787284,"teacher_disagreement_score":0.014033173,"about_ca_system_score_codex":0.0024614856,"about_ca_system_score_gemma":0.0026515787,"threshold_uncertainty_score":0.07421535},"labels":[],"label_agreement":null},{"id":"W102364038","doi":"10.1007/978-3-642-21869-9_8","title":"Assessment of Learners’ Attention While Overcoming Errors and Obstacles: An Empirical Study","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Empirical research; Parametric statistics; Artificial intelligence; Statistical learning; Machine learning; Human–computer interaction; Statistics; Mathematics","score_opus":0.05652810526112563,"score_gpt":0.3152934143834545,"score_spread":0.25876530912232887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102364038","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.99920183,0.000040277177,0.00029976436,0.00000788335,0.0000031014679,0.000031786843,0.000018791101,0.000007633078,0.00038898675],"genre_scores_gemma":[0.99794847,0.000090198824,0.0005928822,0.00002227777,0.0000067605965,0.0000986557,0.00007840272,0.0000071632853,0.0011550966],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998434,0.00054212584,0.00014661085,0.00031422643,0.0004240429,0.00013886715],"domain_scores_gemma":[0.9869148,0.00768356,0.0013209987,0.0007360062,0.002050948,0.0012937259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020689573,0.0005325292,0.0006432395,0.00076512416,0.00046087755,0.00084156985,0.0007531396,0.0007834746,0.001874412],"category_scores_gemma":[0.014696396,0.00028992663,0.00033189222,0.00044553832,0.0005510954,0.00092247984,0.00097093475,0.0008712067,0.00084076315],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054968763,0.02976741,0.6405721,0.0007120467,0.00029194204,0.0014594521,0.05706754,0.0014639259,0.03751413,0.00029631416,0.0014303325,0.22392787],"study_design_scores_gemma":[0.00039777023,0.031395756,0.9154538,0.00012756408,0.00039654228,0.0022922338,0.020669049,0.004477584,0.021091372,0.00052988145,0.0030282647,0.00014017579],"about_ca_topic_score_codex":0.0013070736,"about_ca_topic_score_gemma":0.0010158186,"teacher_disagreement_score":0.0020689573,"about_ca_system_score_codex":0.0003030803,"about_ca_system_score_gemma":0.0004032883,"threshold_uncertainty_score":0.010941803},"labels":[],"label_agreement":null},{"id":"W1024876353","doi":"10.1007/978-3-319-21006-3_18","title":"Cloud Computing: A Multi-tenant Case Study","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Toronto Metropolitan University","funders":"","keywords":"Cloud computing; Software as a service; Vendor; Computer science; Scalability; Total cost of ownership; Service (business); Quality of service; Cost reduction; Software; Database; Operating system; Software development; Business; Telecommunications; Marketing","score_opus":0.04353166142864194,"score_gpt":0.2848299604376485,"score_spread":0.24129829900900657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1024876353","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.96262425,0.00046156894,0.010184971,0.001062588,0.0000619893,0.00030405688,0.00041318245,0.00005097166,0.024836436],"genre_scores_gemma":[0.9835818,0.00045451344,0.009948825,0.00012021948,0.000026083402,0.0000967559,0.0001811789,0.000027321983,0.0055633713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.9984641,0.0006794963,0.00005184104,0.00012884302,0.00028370743,0.0003919036],"domain_scores_gemma":[0.99713767,0.0016815242,0.00019582226,0.00014777297,0.00030712708,0.0005300873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015381133,0.00049651373,0.0003803036,0.0007521456,0.0028719914,0.0018802366,0.0013870813,0.0016542445,0.0037658091],"category_scores_gemma":[0.0024716894,0.00023194237,0.00053691235,0.0026769713,0.0008134204,0.0015640223,0.0011504507,0.0008691363,0.00036737134],"study_design_candidate":"case_report","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051380144,0.014698318,0.14044186,0.0022533492,0.0004689491,0.10177701,0.031650927,0.24627681,0.027226202,0.1605277,0.05660509,0.21293579],"study_design_scores_gemma":[0.00089199183,0.004560452,0.10340103,0.00053485704,0.000381263,0.02503424,0.11956073,0.5862012,0.020440713,0.034431726,0.10426331,0.00029863982],"about_ca_topic_score_codex":0.01955326,"about_ca_topic_score_gemma":0.028672157,"teacher_disagreement_score":0.01955326,"about_ca_system_score_codex":0.0015926227,"about_ca_system_score_gemma":0.0014942326,"threshold_uncertainty_score":0.038878918},"labels":[],"label_agreement":null},{"id":"W1028198225","doi":"10.1007/978-3-540-76650-6_22","title":"Erratum to: Challenges in Software Certification","year":2007,"lang":"en","type":"erratum","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Certification; Software engineering; Software; Programming language; Management","score_opus":0.026189590540517914,"score_gpt":0.24478719483811795,"score_spread":0.21859760429760003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1028198225","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024679574,0.0017526386,0.00086803857,0.15822901,0.8325304,0.000031785126,0.00025144382,0.00022270954,0.0058671227],"genre_scores_gemma":[0.0116893165,0.0125521,0.0051700836,0.3190215,0.44237557,0.00019386085,0.0010603301,0.00073442643,0.20720282],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961075,0.0006641079,0.00075604185,0.00036779133,0.0017788389,0.00032574811],"domain_scores_gemma":[0.9769305,0.007408897,0.0010531556,0.0010258534,0.012684845,0.00089675403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192653,0.0015857748,0.0016293622,0.0028057736,0.0037883935,0.0034163147,0.0026486523,0.014455716,0.020914786],"category_scores_gemma":[0.045724772,0.0009340175,0.0011470524,0.0019166843,0.0025780788,0.0025818716,0.0013626452,0.011805904,0.016170949],"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.0000128289585,0.000006462566,0.000033331336,0.000050296523,0.0000039231104,0.00017637489,0.000018057066,0.000033642704,0.000020446883,0.0010291517,0.9948443,0.0037711551],"study_design_scores_gemma":[0.00003655775,0.0000600932,0.00072059047,0.00047329484,0.000045926077,0.00079097046,0.00024351955,0.00046237264,0.00036634196,0.004660455,0.99208575,0.000054092936],"about_ca_topic_score_codex":0.010244579,"about_ca_topic_score_gemma":0.014278826,"teacher_disagreement_score":0.020914786,"about_ca_system_score_codex":0.0033904086,"about_ca_system_score_gemma":0.003632364,"threshold_uncertainty_score":0.06996697},"labels":[],"label_agreement":null},{"id":"W103049419","doi":"10.1007/978-3-642-38288-8_14","title":"Bio2RDF Release 2: Improved Coverage, Interoperability and Provenance of Life Science Linked Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":131,"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":"SPARQL; Computer science; RDF; Named graph; Scripting language; Interoperability; Information retrieval; Ontology; Data integration; Linked data; Database; World Wide Web; Semantic Web","score_opus":0.023735725000197997,"score_gpt":0.26728766036294604,"score_spread":0.24355193536274805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103049419","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.027502963,0.003692122,0.4837391,0.007249542,0.00345152,0.001349227,0.17649262,0.27855384,0.017969063],"genre_scores_gemma":[0.043263085,0.0017517802,0.36958802,0.0017364693,0.00060009974,0.001023449,0.4985991,0.064607896,0.018830057],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99055415,0.0015722228,0.00106257,0.0012230116,0.0050348756,0.00055328594],"domain_scores_gemma":[0.964906,0.0115797855,0.0010245858,0.01374642,0.0078988625,0.000844507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023043977,0.0016840092,0.0015162578,0.0064925184,0.0011937472,0.0064721275,0.0039558695,0.0031887526,0.01178236],"category_scores_gemma":[0.053519975,0.0017826977,0.0018860426,0.0055137775,0.00095480226,0.007344995,0.003975569,0.0032940235,0.010851089],"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.001142339,0.00036662165,0.004445524,0.0010922543,0.00021004726,0.0005694972,0.0009664432,0.005394494,0.01738689,0.013740141,0.6802571,0.27442864],"study_design_scores_gemma":[0.00056226394,0.00017808564,0.005112124,0.00060942787,0.00017860354,0.0011296598,0.00019522486,0.02485976,0.046619456,0.015689848,0.9045838,0.00028185206],"about_ca_topic_score_codex":0.017003624,"about_ca_topic_score_gemma":0.01332286,"teacher_disagreement_score":0.023043977,"about_ca_system_score_codex":0.0013938693,"about_ca_system_score_gemma":0.0040951967,"threshold_uncertainty_score":0.12186962},"labels":[],"label_agreement":null},{"id":"W1030771313","doi":"10.1007/978-3-319-11758-4_7","title":"Structural Similarity-Based Approximation over Orthogonal Bases: Investigating the Use of Individual Component Functions $$S_k(\\mathbf{x} ,\\mathbf{y})$$","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Similarity (geometry); Component (thermodynamics); Measure (data warehouse); Order (exchange); Computer science; Structural similarity; Similarity measure; Quality (philosophy); Image (mathematics); Algorithm; Mathematics; Combinatorics; Applied mathematics; Discrete mathematics; Artificial intelligence; Data mining; Physics; Quantum mechanics","score_opus":0.07605373769351212,"score_gpt":0.28620225745281425,"score_spread":0.21014851975930213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1030771313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049708802,0.0011132857,0.94515747,0.00013562685,0.000057699104,0.000023419509,0.000038799648,0.00020843065,0.0035565975],"genre_scores_gemma":[0.58190876,0.0020335638,0.41078165,0.00007194761,0.00008409706,0.00003584225,0.00023823489,0.0002179247,0.0046278783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994492,0.0001820598,0.000023661016,0.00009938544,0.00019800322,0.000047581725],"domain_scores_gemma":[0.9980221,0.0010475205,0.00014048509,0.0003260289,0.00039278297,0.00007119696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162075,0.0005152416,0.0009795607,0.0007193753,0.00031657782,0.0016721125,0.0012502082,0.0007939409,0.0019552435],"category_scores_gemma":[0.005237378,0.00040241654,0.00059923675,0.0016450587,0.000634435,0.0029657036,0.00094036845,0.0012722883,0.00050302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061476434,0.00022645204,0.0018361808,0.000310445,0.00012002361,0.00008746522,0.00032400072,0.18003787,0.039913263,0.18007745,0.0033427603,0.5931093],"study_design_scores_gemma":[0.000006714894,0.000057812216,0.0004433773,0.000015084569,0.000022550897,0.00007209119,0.00004074011,0.98045254,0.0055722,0.012494504,0.0008111815,0.000011100527],"about_ca_topic_score_codex":0.0024105178,"about_ca_topic_score_gemma":0.0016687139,"teacher_disagreement_score":0.0024105178,"about_ca_system_score_codex":0.0004490232,"about_ca_system_score_gemma":0.0005546007,"threshold_uncertainty_score":0.006540954},"labels":[],"label_agreement":null},{"id":"W103107239","doi":"10.1007/978-3-642-31298-4_3","title":"Multibiometric System Using Level Set Method and Particle Swarm Optimization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Particle swarm optimization; Computer science; Set (abstract data type); Multi-swarm optimization; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.0881056531450336,"score_gpt":0.31104825135603764,"score_spread":0.22294259821100404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103107239","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.003156047,0.00012525402,0.9952382,0.00006875166,0.000044077962,0.000031397954,0.000018549843,0.00036652692,0.00095126894],"genre_scores_gemma":[0.15260333,0.00028986938,0.842801,0.00011268073,0.000061528925,0.00026789313,0.00016038178,0.000133245,0.0035701187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999466,0.00011552198,0.000031503405,0.000108908134,0.0002538697,0.000024219018],"domain_scores_gemma":[0.9996592,0.000119791934,0.000044553097,0.000047865826,0.00011047586,0.000018122237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007918374,0.0006047451,0.0012753925,0.00071867806,0.00066432,0.0014406404,0.0012347149,0.0013170977,0.002229289],"category_scores_gemma":[0.0014143761,0.0005298233,0.0009940857,0.0011973816,0.00041360583,0.0012539595,0.0013034255,0.001105543,0.000872395],"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.00024580816,0.00016379038,0.0013368495,0.0003571021,0.00019871953,0.00015484412,0.0002240462,0.3539665,0.04812959,0.020164223,0.0039674984,0.57109106],"study_design_scores_gemma":[0.000007948321,0.00002866567,0.00024850326,0.000006023631,0.000013068497,0.00004005059,0.000008282075,0.9938251,0.0030668853,0.0017050111,0.0010353621,0.000015065306],"about_ca_topic_score_codex":0.002032798,"about_ca_topic_score_gemma":0.001492271,"teacher_disagreement_score":0.002229289,"about_ca_system_score_codex":0.0006330986,"about_ca_system_score_gemma":0.00090702105,"threshold_uncertainty_score":0.007457733},"labels":[],"label_agreement":null},{"id":"W1033844243","doi":"10.1007/978-3-319-12691-3_14","title":"Interference-Free k-barrier Coverage in Wireless Sensor Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Prince Edward Island","funders":"","keywords":"Interference (communication); Wireless sensor network; Computer network; Computer science; Telecommunications; Channel (broadcasting)","score_opus":0.010166978400796283,"score_gpt":0.21358120062149127,"score_spread":0.203414222220695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1033844243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04427379,0.010065934,0.9209094,0.0005216928,0.00021692106,0.000040096216,0.000111364265,0.00040551552,0.023455387],"genre_scores_gemma":[0.91836786,0.0074061425,0.05926084,0.0001619792,0.0001771443,0.000108407854,0.00013565838,0.00014386684,0.0142381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00010924224,0.000017054448,0.00005925497,0.00015868965,0.00006496847],"domain_scores_gemma":[0.99942565,0.00037784112,0.000046952508,0.00005353152,0.000071186,0.000024953035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035614177,0.000551159,0.0007836034,0.00042367587,0.0003789033,0.0007520732,0.0016861976,0.00083300687,0.0013057945],"category_scores_gemma":[0.001768068,0.0003496382,0.0003999351,0.0009962455,0.00073485955,0.0011918605,0.0012112436,0.00096806727,0.0005083891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004225978,0.000063777814,0.0005390777,0.0010070303,0.00010740764,0.00037734836,0.00031049064,0.6660278,0.025052417,0.15581097,0.008193672,0.14208746],"study_design_scores_gemma":[0.000017272825,0.000059909176,0.00027812878,0.0000465856,0.000021240143,0.00032885163,0.00005702618,0.9281068,0.0027044252,0.06399682,0.004360771,0.00002223788],"about_ca_topic_score_codex":0.0010186707,"about_ca_topic_score_gemma":0.0006559804,"teacher_disagreement_score":0.0016861976,"about_ca_system_score_codex":0.00055284874,"about_ca_system_score_gemma":0.00030385685,"threshold_uncertainty_score":0.004368305},"labels":[],"label_agreement":null},{"id":"W1035981622","doi":"10.1007/978-3-642-40846-5_43","title":"MLG: Enchancing Multi-label Classification with Modularity-Based Label Grouping","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Ducks Unlimited Canada","funders":"","keywords":"Computer science; Multi-label classification; Modularity (biology); Relevance (law); Binary number; Data mining; Graph; Artificial intelligence; Pattern recognition (psychology); Binary classification; Machine learning; Theoretical computer science; Support vector machine; Mathematics","score_opus":0.04651001208176469,"score_gpt":0.2663176553733737,"score_spread":0.219807643291609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1035981622","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.003476872,0.00020283404,0.98423356,0.00024940164,0.00015070787,0.00013747795,0.00024516787,0.01038477,0.00091921614],"genre_scores_gemma":[0.051828843,0.00013631774,0.93804896,0.00049537263,0.00019647434,0.00023001526,0.0014979308,0.0021099236,0.0054561617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542254,0.0013510245,0.00019548116,0.0012656691,0.0014286869,0.0003366128],"domain_scores_gemma":[0.9925997,0.0024374288,0.00032503126,0.0033167037,0.0010384308,0.0002826464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00493528,0.0021637268,0.0024114684,0.004051907,0.0018721662,0.0025765821,0.006344234,0.0033633919,0.010475855],"category_scores_gemma":[0.013197865,0.0013100142,0.002747302,0.0040471144,0.0025054596,0.005478817,0.009310673,0.00430633,0.008095055],"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.0005090526,0.00027609672,0.00095956103,0.00026956262,0.00017248698,0.00018578536,0.00042432945,0.024215225,0.015463522,0.022682,0.031997167,0.90284514],"study_design_scores_gemma":[0.00012842777,0.00017064843,0.0006221156,0.000080402846,0.00009153136,0.00021100645,0.00018411085,0.811727,0.017428834,0.14958382,0.019711748,0.000060406008],"about_ca_topic_score_codex":0.004755719,"about_ca_topic_score_gemma":0.008251977,"teacher_disagreement_score":0.010475855,"about_ca_system_score_codex":0.0014772164,"about_ca_system_score_gemma":0.0017072726,"threshold_uncertainty_score":0.035045207},"labels":[],"label_agreement":null},{"id":"W10363999","doi":"10.1007/978-3-319-11520-7_2","title":"Cellular Modeling with Cell-DEVS: A Discrete-Event Cellular Automata Formalism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"DEVS; Cellular automaton; Computer science; Formalism (music); Theoretical computer science; Stochastic cellular automaton; Automaton; Distributed computing; Popularity; Discrete event simulation; Visualization; Grid; Algorithm; Modeling and simulation; Artificial intelligence; Simulation; Mathematics","score_opus":0.043033459308587915,"score_gpt":0.3168416223808192,"score_spread":0.27380816307223127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10363999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016015948,0.00051706546,0.9892266,0.00017403802,0.000114510236,0.00003056646,0.00025043506,0.0003198614,0.0077653113],"genre_scores_gemma":[0.25994453,0.0029295853,0.7151559,0.0003506717,0.0002651164,0.00041214758,0.0010298012,0.00054536754,0.019366847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996313,0.00011336858,0.000033788954,0.00006958917,0.0001228278,0.000029072535],"domain_scores_gemma":[0.99950016,0.0002508763,0.000043361408,0.000095652955,0.000076212906,0.000033633463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063121907,0.0008599271,0.0012685655,0.0005550928,0.00059121003,0.002197479,0.0020782186,0.0014555432,0.0038883053],"category_scores_gemma":[0.0014917844,0.0006363923,0.0018813645,0.0011741493,0.0010221049,0.0014344383,0.0014699425,0.0019737876,0.0015229145],"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.000018752824,0.000028777551,0.00023547906,0.00012477936,0.000040328483,0.00015773738,0.00011914162,0.3885919,0.002841108,0.58175856,0.0037039737,0.022379432],"study_design_scores_gemma":[0.000008569832,0.0000080002055,0.000043165386,0.000020405641,0.000018916966,0.00006261354,0.000012768865,0.8330828,0.0009309387,0.15070806,0.01509102,0.000012717435],"about_ca_topic_score_codex":0.004036147,"about_ca_topic_score_gemma":0.0036547778,"teacher_disagreement_score":0.004036147,"about_ca_system_score_codex":0.0010786025,"about_ca_system_score_gemma":0.000981472,"threshold_uncertainty_score":0.0130077},"labels":[],"label_agreement":null},{"id":"W104024513","doi":"10.1007/978-3-642-40663-8_7","title":"The Algebraic Theory of Parikh Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Unary operation; Automaton; Regular language; Computer science; Automata theory; Algebraic theory; Discrete mathematics; Set (abstract data type); Deterministic finite automaton; Algebraic number; Mathematics; Theoretical computer science; Programming language","score_opus":0.011804015400249616,"score_gpt":0.2192549703204398,"score_spread":0.2074509549201902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104024513","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033319272,0.015814884,0.41646084,0.004938362,0.0017121707,0.00007902212,0.0005396951,0.00075041084,0.5263853],"genre_scores_gemma":[0.79052514,0.013765914,0.08394448,0.001269202,0.003638623,0.0002828829,0.000789936,0.00036470874,0.10541907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907756,0.00024885146,0.00006247948,0.00017847716,0.00033331173,0.000099259465],"domain_scores_gemma":[0.99902225,0.00050031295,0.00005994495,0.00020942847,0.00014911528,0.000059050042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007840284,0.0006124145,0.0008761445,0.0014025411,0.0018960806,0.0047618547,0.0012397694,0.0010247935,0.010472356],"category_scores_gemma":[0.0023551525,0.0006942033,0.0011404674,0.001895542,0.0055624396,0.009827995,0.0019922184,0.0036382347,0.003395457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048523743,0.0000030770382,0.000015111102,0.000025978226,0.000001758842,0.0000098375585,0.00007066107,0.00024589748,0.00012119397,0.9948384,0.00089796854,0.0037651511],"study_design_scores_gemma":[0.0000029580294,0.0000037435527,0.000014668683,0.0000081810385,0.0000016269371,0.000028917631,0.000016128906,0.0005954589,0.000098714125,0.98861396,0.010612531,0.000003040841],"about_ca_topic_score_codex":0.00066952687,"about_ca_topic_score_gemma":0.00043217518,"teacher_disagreement_score":0.010472356,"about_ca_system_score_codex":0.0019507015,"about_ca_system_score_gemma":0.0008980608,"threshold_uncertainty_score":0.035033524},"labels":[],"label_agreement":null},{"id":"W104029305","doi":"10.1007/978-3-642-39229-0_19","title":"Of Hoverboards and Hypertext","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"HTML5; Hypertext; Computer science; World Wide Web; Realization (probability); Software; Multimedia; Programming language","score_opus":0.016798662359568776,"score_gpt":0.2281809088994076,"score_spread":0.2113822465398388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104029305","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025624156,0.029107435,0.34643537,0.0066325683,0.00186231,0.00006796725,0.0005919614,0.0009935569,0.5886847],"genre_scores_gemma":[0.5900936,0.016213225,0.09884538,0.0010576607,0.0016421722,0.00022394252,0.0016089162,0.00056785846,0.28974718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994248,0.00023254876,0.000029206936,0.00014758344,0.00010365438,0.000062220424],"domain_scores_gemma":[0.9989242,0.00051563623,0.000065713386,0.00029912882,0.00011926311,0.000075937765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055157836,0.0008379003,0.00058313675,0.0014155976,0.0017900484,0.00587444,0.0010594699,0.0020452617,0.034967836],"category_scores_gemma":[0.002987316,0.00052165915,0.00056876236,0.002582901,0.004197043,0.014377788,0.0023861544,0.00195797,0.003379486],"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.000014620807,0.0000075254075,0.0000943422,0.00005825956,0.0000051006887,0.00005377856,0.00034401458,0.00062288536,0.00015772968,0.96126646,0.00664503,0.030730225],"study_design_scores_gemma":[0.000005454689,0.0000070782794,0.00012570768,0.000058044574,0.0000069169428,0.00011518073,0.0002354988,0.0022618785,0.00020726127,0.93269193,0.06427769,0.000007298812],"about_ca_topic_score_codex":0.0028922036,"about_ca_topic_score_gemma":0.0024103422,"teacher_disagreement_score":0.034967836,"about_ca_system_score_codex":0.00090797007,"about_ca_system_score_gemma":0.00053822075,"threshold_uncertainty_score":0.11697906},"labels":[],"label_agreement":null},{"id":"W1043292916","doi":"10.1007/978-3-319-18356-5_3","title":"Improvements to the Linear Optimization Models of Patrol Scheduling for Mobile Targets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Resilience and Vulnerability Analysis","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":"Université de Sherbrooke; Université du Québec à Montréal","funders":"","keywords":"Computer science; Column generation; Stackelberg competition; Scalability; Robustness (evolution); Scheduling (production processes); Linear programming; Mathematical optimization; Software; Distributed computing; Algorithm; Programming language; Operating system","score_opus":0.015146604641386082,"score_gpt":0.24775076444278135,"score_spread":0.23260415980139526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1043292916","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.0075614867,0.0007869998,0.97234964,0.00068992295,0.00030729547,0.00005297817,0.00040645717,0.00050674507,0.017338494],"genre_scores_gemma":[0.638404,0.0028277098,0.2992157,0.0010803366,0.0011603989,0.0004461066,0.0011039759,0.0017925109,0.05396915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918836,0.00030384533,0.00003130376,0.00015033947,0.00019151974,0.000134612],"domain_scores_gemma":[0.9978278,0.0013762827,0.00016518748,0.00019987418,0.00033265742,0.000098108256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012862528,0.0016337297,0.0011387912,0.0005417787,0.00050592603,0.0014813,0.0024667976,0.0010322856,0.013131426],"category_scores_gemma":[0.006215084,0.00087265734,0.0014029471,0.0012938966,0.000753709,0.0021218946,0.0013984152,0.0038125014,0.002202502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023974393,0.000030965635,0.00007775218,0.000050056737,0.000013413025,0.000013886381,0.000021778986,0.96990347,0.00029917437,0.015858239,0.0027045787,0.011002726],"study_design_scores_gemma":[0.000002665671,0.000007151061,0.00002067311,0.0000036044448,0.000003537882,0.0000024766161,0.0000034177692,0.99167085,0.000060616254,0.0076265982,0.00059568085,0.0000028193654],"about_ca_topic_score_codex":0.016003447,"about_ca_topic_score_gemma":0.013441465,"teacher_disagreement_score":0.016003447,"about_ca_system_score_codex":0.0017809566,"about_ca_system_score_gemma":0.0021727176,"threshold_uncertainty_score":0.04392904},"labels":[],"label_agreement":null},{"id":"W1044159086","doi":"10.1007/978-3-662-43936-4_11","title":"Design Patterns for Multiple Stakeholders in Social Computing","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stakeholder; Focus (optics); Control (management); Work (physics); Scheme (mathematics); Access control; Data science; Computer security; Artificial intelligence","score_opus":0.09177807539820083,"score_gpt":0.3079842239667986,"score_spread":0.21620614856859777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1044159086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010804995,0.00018746697,0.9737958,0.0027153094,0.00006968907,0.00046198725,0.000059921524,0.000635347,0.011269573],"genre_scores_gemma":[0.22031768,0.00033329224,0.7619924,0.0011379076,0.000052021864,0.0015856576,0.00023185315,0.00049449946,0.013854762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96224064,0.022776542,0.003779244,0.003990177,0.00538946,0.0018239291],"domain_scores_gemma":[0.97701573,0.010027143,0.001693321,0.007682163,0.0026349989,0.0009466828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025160788,0.0011023611,0.0007477254,0.00132872,0.0044731083,0.0071608657,0.0027002324,0.004639108,0.0051283347],"category_scores_gemma":[0.026899895,0.001715445,0.0021486334,0.0016452998,0.008934859,0.01764386,0.009114688,0.004873979,0.0016907703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006913185,0.00006873714,0.0015525707,0.00024767625,0.00003125946,0.00034264845,0.007829144,0.0016068388,0.002652489,0.9524915,0.0024081192,0.030699857],"study_design_scores_gemma":[0.000081838654,0.00013641291,0.0004605917,0.00024441155,0.00007164433,0.0013420809,0.0039098747,0.023100007,0.0057423115,0.812923,0.15191662,0.00007119968],"about_ca_topic_score_codex":0.0019491313,"about_ca_topic_score_gemma":0.0025670975,"teacher_disagreement_score":0.025160788,"about_ca_system_score_codex":0.002768354,"about_ca_system_score_gemma":0.0029941795,"threshold_uncertainty_score":0.13306457},"labels":[],"label_agreement":null},{"id":"W104448679","doi":"10.1007/978-3-319-07046-9_5","title":"A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Computer science; Constraint programming; Benchmark (surveying); Integer programming; Mathematical optimization; Scheduling (production processes); Job shop scheduling; Range (aeronautics); Constraint (computer-aided design); Job scheduler; Parallel computing; Algorithm; Mathematics; Programming language; Embedded system; Engineering","score_opus":0.013516101009695995,"score_gpt":0.23045582407191548,"score_spread":0.21693972306221948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104448679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005480528,0.0007030023,0.9854768,0.0004417082,0.0002854662,0.00012133817,0.0005526971,0.00036502667,0.006573473],"genre_scores_gemma":[0.2913773,0.0028194536,0.6667295,0.00069867406,0.0010064419,0.0011797893,0.0023022213,0.0007252047,0.033161387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908674,0.0002363112,0.0000535051,0.00017980146,0.0002930648,0.00015057198],"domain_scores_gemma":[0.99916303,0.00040710653,0.00009428127,0.00007328103,0.00017647201,0.00008578089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016560473,0.0017271076,0.0018663228,0.00070282543,0.00067540567,0.0024316425,0.004387141,0.0019369242,0.0058684475],"category_scores_gemma":[0.0026989318,0.0012794427,0.0017073341,0.001706235,0.00068828266,0.002902062,0.0014454584,0.0034676807,0.0012425624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051915737,0.00007125512,0.00009735213,0.0001292939,0.00003228379,0.00006527933,0.000020991783,0.9591316,0.0010938562,0.023644581,0.003677202,0.011984422],"study_design_scores_gemma":[0.000005600356,0.000008512122,0.000028289576,0.0000048347474,0.0000060105804,0.000009728095,0.0000029092305,0.99303365,0.00008684567,0.005984111,0.0008245544,0.000004875233],"about_ca_topic_score_codex":0.0055887587,"about_ca_topic_score_gemma":0.005369114,"teacher_disagreement_score":0.0058684475,"about_ca_system_score_codex":0.0019751997,"about_ca_system_score_gemma":0.0022628403,"threshold_uncertainty_score":0.019631863},"labels":[],"label_agreement":null},{"id":"W104645259","doi":"10.1007/978-3-642-23094-3_11","title":"Interactive Segmentation with Super-Labels","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Western University","funders":"National Institute of Biomedical Imaging and Bioengineering","keywords":"Computer science; Segmentation; Artificial intelligence; Pattern recognition (psychology); Pixel; Object (grammar); Histogram; Image segmentation; Coherence (philosophical gambling strategy); Computer vision; Image (mathematics); Mathematics","score_opus":0.020407307880424108,"score_gpt":0.2787925118847826,"score_spread":0.2583852040043585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104645259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010503455,0.00033638327,0.9779367,0.00020662835,0.00008695202,0.00007205214,0.00027401416,0.007956208,0.002627664],"genre_scores_gemma":[0.09195314,0.0002544716,0.9002573,0.00021923918,0.00010509906,0.00011221352,0.0007472692,0.0032028148,0.0031483958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866223,0.00025146475,0.0000721128,0.00033838232,0.0005020513,0.00017371324],"domain_scores_gemma":[0.9969627,0.0013521571,0.00015838083,0.001027873,0.00032719833,0.00017162999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016485418,0.0016097525,0.0017334109,0.0021315962,0.0009791408,0.0028811316,0.0022405388,0.0025361942,0.014479043],"category_scores_gemma":[0.0039529377,0.0018342503,0.0015924922,0.0022608484,0.0010957114,0.002583487,0.004533258,0.0023547155,0.004071365],"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.0020735746,0.00021288816,0.0013778356,0.0008724165,0.0003177374,0.0007210215,0.00075203244,0.05475203,0.21175759,0.017274652,0.019335048,0.6905532],"study_design_scores_gemma":[0.000117882606,0.000121421916,0.0011732525,0.0000976981,0.00011565636,0.00082052196,0.00016466294,0.817718,0.122602865,0.032323696,0.024653807,0.00009055784],"about_ca_topic_score_codex":0.0032924553,"about_ca_topic_score_gemma":0.008442852,"teacher_disagreement_score":0.014479043,"about_ca_system_score_codex":0.0009244177,"about_ca_system_score_gemma":0.0011589355,"threshold_uncertainty_score":0.048437238},"labels":[],"label_agreement":null},{"id":"W105746118","doi":"10.1007/978-3-642-45249-9_14","title":"A TimeStamp Based Multi-version STM Algorithm","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Transactional memory; Garbage collection; Software transactional memory; Correctness; Timestamp; Concurrency control; Concurrency; Atomicity; Database transaction; Serializability; Algorithm; Parallel computing; Programming language; Transaction processing; Garbage; Real-time computing; Distributed transaction","score_opus":0.01220957497665111,"score_gpt":0.23332118979528807,"score_spread":0.22111161481863695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105746118","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.029582264,0.000587351,0.9612148,0.00014208988,0.00035971458,0.00015356854,0.00019808894,0.0038959722,0.0038660944],"genre_scores_gemma":[0.27423465,0.0002231001,0.7170042,0.00011626587,0.00011379678,0.00012919088,0.00062845874,0.00023784627,0.0073124995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999328,0.00009136739,0.0000757661,0.00014383267,0.0002825668,0.000078425575],"domain_scores_gemma":[0.9986129,0.00029129084,0.00009246162,0.0005536725,0.00037054447,0.00007899676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875584,0.00052173226,0.0010840446,0.0010343726,0.0006221466,0.0010990844,0.0018194745,0.0008105963,0.008969999],"category_scores_gemma":[0.002569285,0.00038848197,0.00048496254,0.0014680716,0.00028085022,0.0018622262,0.0013481902,0.0010789433,0.0017584412],"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.0009335012,0.00022770559,0.001024032,0.00018304407,0.0000811434,0.00010132281,0.00006552944,0.043513194,0.03281181,0.015587768,0.008623571,0.89684737],"study_design_scores_gemma":[0.00025336852,0.00048050322,0.0008002077,0.000031696494,0.00008687991,0.00048676715,0.00005484979,0.94189435,0.028102415,0.018392373,0.009374163,0.000042389358],"about_ca_topic_score_codex":0.001138315,"about_ca_topic_score_gemma":0.0015306569,"teacher_disagreement_score":0.008969999,"about_ca_system_score_codex":0.00050838396,"about_ca_system_score_gemma":0.0012315654,"threshold_uncertainty_score":0.0300076},"labels":[],"label_agreement":null},{"id":"W106507404","doi":"10.1007/978-3-319-14612-6_35","title":"A Technique for Lung Nodule Candidate Detection in CT Using Global Minimization Methods","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Lung Cancer Diagnosis and Treatment","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Computer science; Nodule (geology); Segmentation; Artificial intelligence; Pattern recognition (psychology); Minification; Lung; Image segmentation; Range (aeronautics); Representation (politics); Curvature; Computer vision; Mathematics; Medicine","score_opus":0.03383160000375601,"score_gpt":0.37026997127460626,"score_spread":0.33643837127085024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106507404","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.0019338154,0.00019239006,0.99670935,0.000082911894,0.000041308995,0.000020886479,0.00002506851,0.00043748078,0.0005566895],"genre_scores_gemma":[0.017282695,0.00027678467,0.9784234,0.0000845583,0.00007363562,0.00004507067,0.00010518233,0.00033286616,0.0033758224],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997923,0.000033715143,0.000012356484,0.000042814663,0.00010446412,0.000014423714],"domain_scores_gemma":[0.99968374,0.00014002742,0.000020463785,0.00005213962,0.00008114064,0.00002248652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040138463,0.000982583,0.00072100596,0.0007441566,0.0003700739,0.0005476766,0.0009906093,0.001128668,0.003957044],"category_scores_gemma":[0.000937906,0.000617564,0.0009686411,0.0005279701,0.00044916,0.00064238696,0.0011046598,0.0013700306,0.0017299685],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018555642,0.000071956514,0.0007068346,0.0003220933,0.00011520868,0.0004067492,0.00013272924,0.03838338,0.19683263,0.011313939,0.00955052,0.7419785],"study_design_scores_gemma":[0.000032840126,0.00022595121,0.0020874208,0.000046823738,0.000101827296,0.0029169768,0.000049716426,0.8943584,0.06630221,0.012025704,0.021787843,0.000064296306],"about_ca_topic_score_codex":0.00060325756,"about_ca_topic_score_gemma":0.0011115893,"teacher_disagreement_score":0.003957044,"about_ca_system_score_codex":0.00014790925,"about_ca_system_score_gemma":0.00039162714,"threshold_uncertainty_score":0.013237596},"labels":[],"label_agreement":null},{"id":"W1068111385","doi":"10.1007/978-3-319-19662-6_7","title":"Localization of a Mobile Node in Shaded Areas","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"Carleton University","funders":"","keywords":"Computer science; Global Positioning System; Node (physics); Real-time computing; Probabilistic logic; Particle filter; Trajectory; Artificial intelligence; Telecommunications; Kalman filter","score_opus":0.015061487714176746,"score_gpt":0.22936498036517405,"score_spread":0.2143034926509973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1068111385","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.08928636,0.0013337767,0.7618917,0.0007069928,0.0008554662,0.00023002963,0.0008954964,0.0036262658,0.14117387],"genre_scores_gemma":[0.6517205,0.002021235,0.24702404,0.00028919269,0.00018413384,0.00016605499,0.0011092155,0.0004486346,0.09703697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986017,0.000017694281,0.000004531595,0.000046026795,0.00003728743,0.000034208122],"domain_scores_gemma":[0.999785,0.000046868714,0.00002592338,0.00004299012,0.00006740829,0.000031754236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013464413,0.0005772243,0.00036009142,0.0005404959,0.0005441557,0.00071421417,0.00068705645,0.00067588926,0.008053911],"category_scores_gemma":[0.00058388617,0.00029142536,0.00023002458,0.000736291,0.0005065384,0.00097350666,0.0016278806,0.0004690163,0.004508472],"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.0009626621,0.00012959001,0.005270674,0.0010222697,0.000060701143,0.0034660432,0.002049751,0.1203287,0.21313913,0.12275315,0.036272656,0.49454466],"study_design_scores_gemma":[0.00011864604,0.00076859654,0.009984406,0.00051506807,0.00013460241,0.0038020958,0.003174444,0.3404192,0.1718405,0.10632426,0.36277816,0.00013993813],"about_ca_topic_score_codex":0.0019146978,"about_ca_topic_score_gemma":0.0020263975,"teacher_disagreement_score":0.008053911,"about_ca_system_score_codex":0.00025809646,"about_ca_system_score_gemma":0.00046599307,"threshold_uncertainty_score":0.026942968},"labels":[],"label_agreement":null},{"id":"W106999168","doi":"10.1007/978-3-642-41299-8_9","title":"Optimal Approximations with Rough Sets","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"McMaster University","funders":"","keywords":"Jaccard index; Rough set; Consistency (knowledge bases); Approximations of π; Similarity (geometry); Metric (unit); Computer science; Class (philosophy); Set (abstract data type); Measure (data warehouse); Approximation algorithm; Index (typography); Algorithm; Similarity measure; Mathematics; Applied mathematics; Data mining; Artificial intelligence; Pattern recognition (psychology); Image (mathematics)","score_opus":0.017564392835176842,"score_gpt":0.22874012036231145,"score_spread":0.2111757275271346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106999168","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.004801332,0.0037404795,0.9754034,0.0006311551,0.00024496624,0.000030575713,0.000056351313,0.000080995516,0.0150106605],"genre_scores_gemma":[0.28090107,0.008429214,0.69329363,0.00024306563,0.0006236257,0.00020455514,0.00036080807,0.00018717747,0.015756883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969214,0.0012615967,0.00018086513,0.00028393333,0.0012165458,0.00013560675],"domain_scores_gemma":[0.9978265,0.0013963778,0.00012544535,0.00037139954,0.0002157742,0.000064402215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003227676,0.0010458272,0.00240628,0.0014181768,0.00065008993,0.003345302,0.0014550443,0.0012062616,0.004246595],"category_scores_gemma":[0.010812674,0.0011850557,0.0018270201,0.0020446777,0.0020749094,0.004059245,0.0029588551,0.0034596338,0.0007151033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006765068,0.000028457034,0.00008222012,0.00024311233,0.00006104145,0.000035865774,0.000115366565,0.094416425,0.00053438905,0.8279485,0.003096087,0.07337093],"study_design_scores_gemma":[0.000014796494,0.000020706979,0.000047997135,0.000046363322,0.000020402013,0.000031506093,0.000023509103,0.20022684,0.00038959784,0.7937223,0.005443433,0.000012568931],"about_ca_topic_score_codex":0.001212112,"about_ca_topic_score_gemma":0.00088254624,"teacher_disagreement_score":0.004246595,"about_ca_system_score_codex":0.0020369252,"about_ca_system_score_gemma":0.0008958943,"threshold_uncertainty_score":0.017069817},"labels":[],"label_agreement":null},{"id":"W107074470","doi":"10.1007/978-3-319-06483-3_21","title":"Ensemble of Multiple Kernel SVM Classifiers","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Dalhousie University; University of Ottawa","funders":"","keywords":"Multiple kernel learning; Generalization; Computer science; Support vector machine; Kernel (algebra); Artificial intelligence; Machine learning; Ensemble learning; Pattern recognition (psychology); Kernel method; Mathematics","score_opus":0.020985478821517,"score_gpt":0.2404894999563194,"score_spread":0.2195040211348024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107074470","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.038689848,0.0044913674,0.9466629,0.0002469754,0.0009268664,0.000080115744,0.00021645862,0.0015588589,0.007126607],"genre_scores_gemma":[0.54133934,0.002660331,0.43514723,0.00026734945,0.000756633,0.00015576949,0.0016891042,0.00027404437,0.017710235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988172,0.0002115276,0.00009843019,0.0002603286,0.00049987884,0.000112653666],"domain_scores_gemma":[0.9981628,0.000322327,0.00008435067,0.00038309325,0.0009628121,0.00008455201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018054922,0.00087634317,0.0024463558,0.0012913991,0.0005132405,0.0015054088,0.0013571022,0.0011442374,0.0025554749],"category_scores_gemma":[0.002874885,0.00055385317,0.0012797695,0.0017217302,0.00020655872,0.0025069665,0.0013264978,0.0015699952,0.002194313],"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.0002239543,0.00019325152,0.0021039895,0.00016672943,0.00048258863,0.00006518461,0.000051095623,0.06875927,0.009993591,0.003172916,0.00979728,0.90499026],"study_design_scores_gemma":[0.000009865792,0.000118972894,0.0013819872,0.000031175652,0.00015413603,0.00014275304,0.00003117625,0.9821545,0.0054957243,0.0042282944,0.0062280595,0.000023428403],"about_ca_topic_score_codex":0.000893318,"about_ca_topic_score_gemma":0.0018714855,"teacher_disagreement_score":0.0025554749,"about_ca_system_score_codex":0.0003428493,"about_ca_system_score_gemma":0.00059876574,"threshold_uncertainty_score":0.009548485},"labels":[],"label_agreement":null},{"id":"W10708998","doi":"10.1007/978-3-319-14803-8_23","title":"Evolving Point Packings in the Plane","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Guelph","funders":"","keywords":"Simple (philosophy); Representation (politics); Computer science; Point (geometry); Plane (geometry); Algorithm; Square (algebra); Mathematical optimization; Theoretical computer science; Mathematics; Geometry","score_opus":0.021004706060826515,"score_gpt":0.22670166798611055,"score_spread":0.20569696192528403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10708998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120481014,0.0031579782,0.8314982,0.0005071861,0.00036157298,0.000100630656,0.0002640621,0.0006227552,0.04300661],"genre_scores_gemma":[0.43046013,0.005010206,0.5328014,0.00024578563,0.00022665065,0.0002143895,0.00091486675,0.00076585036,0.029360734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997389,0.000057331155,0.000014093244,0.0000455519,0.00011460913,0.000029491179],"domain_scores_gemma":[0.99947757,0.00029553415,0.000036467307,0.000073419884,0.00007280213,0.00004419768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044011994,0.000663599,0.0010122104,0.0008071678,0.00053814566,0.0013343857,0.0013758445,0.0013882244,0.0058737523],"category_scores_gemma":[0.0026162958,0.0007316613,0.0007269574,0.0015232002,0.00086329604,0.0023129333,0.0020037403,0.00163891,0.0010456777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011871154,0.0000730056,0.00048847456,0.00019366064,0.00004167564,0.00014273112,0.0003595637,0.5720012,0.0073554413,0.19690016,0.007782788,0.21454263],"study_design_scores_gemma":[0.000017981802,0.00005264495,0.00020449002,0.00004657346,0.000009549707,0.00013051403,0.000063988206,0.8639831,0.001497405,0.124296844,0.009680258,0.000016679416],"about_ca_topic_score_codex":0.0011123763,"about_ca_topic_score_gemma":0.00074717624,"teacher_disagreement_score":0.0058737523,"about_ca_system_score_codex":0.0006676275,"about_ca_system_score_gemma":0.00021725298,"threshold_uncertainty_score":0.019649625},"labels":[],"label_agreement":null},{"id":"W107142879","doi":"10.1007/978-3-540-68825-9_12","title":"Recognizing Biomedical Named Entities in Chinese Research Abstracts","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conditional random field; Computer science; Natural language processing; CRFS; Artificial intelligence; Named-entity recognition; Task (project management); F1 score; Information retrieval","score_opus":0.03653476046084891,"score_gpt":0.32768426447626575,"score_spread":0.29114950401541684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107142879","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.4409599,0.050547883,0.25750902,0.0047618374,0.0033243916,0.001443316,0.17160402,0.009163323,0.060686376],"genre_scores_gemma":[0.5543133,0.016947156,0.22797458,0.0006512743,0.0013092582,0.00059354474,0.17109393,0.0005575741,0.026559474],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992305,0.00008176312,0.00018351476,0.0002513114,0.000179702,0.000073098556],"domain_scores_gemma":[0.9983644,0.00067572994,0.00019837203,0.00012705171,0.0005125945,0.000121871046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011831699,0.0010789668,0.0008155012,0.008063174,0.0012044711,0.0016128286,0.0009959167,0.00073853415,0.0067750276],"category_scores_gemma":[0.0032947154,0.0003460744,0.0013174139,0.008962601,0.00047472172,0.0025263978,0.001179683,0.0005396383,0.0037435277],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010779997,0.00016484887,0.045867812,0.0061220173,0.00043602876,0.0054849153,0.0025792727,0.005561247,0.11078072,0.022172991,0.116632424,0.6831198],"study_design_scores_gemma":[0.00024342841,0.0005673274,0.20606336,0.0011399135,0.003140982,0.007097121,0.00337919,0.09322657,0.10968446,0.033342626,0.5417663,0.0003488273],"about_ca_topic_score_codex":0.011607293,"about_ca_topic_score_gemma":0.013019456,"teacher_disagreement_score":0.011607293,"about_ca_system_score_codex":0.0012622187,"about_ca_system_score_gemma":0.0027827413,"threshold_uncertainty_score":0.023079455},"labels":[],"label_agreement":null},{"id":"W10727845","doi":"10.1007/978-3-319-05476-6_28","title":"A Framework to Provide Personalization in Learning Management Systems through a Recommender System Approach","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Personalization; Computer science; Recommender system; Human–computer interaction; World Wide Web; Multimedia","score_opus":0.027705069119565887,"score_gpt":0.2597101392888056,"score_spread":0.2320050701692397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10727845","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.0015741518,0.0004781069,0.99073774,0.000493317,0.00009234399,0.00011141966,0.000056198867,0.0009705957,0.0054860464],"genre_scores_gemma":[0.07239675,0.0008116151,0.91438556,0.00023804136,0.00015044557,0.0002505011,0.00019658757,0.0001258865,0.011444478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976319,0.001015777,0.00015359138,0.00039456948,0.00066359696,0.00014054004],"domain_scores_gemma":[0.9981067,0.00075648,0.00009573163,0.00047084555,0.0004212429,0.00014898118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037448977,0.0006426922,0.00093627523,0.0012398036,0.0012869996,0.0033571546,0.002516087,0.0025024596,0.006912546],"category_scores_gemma":[0.0055424217,0.000595046,0.0015145679,0.0015865277,0.0009309203,0.0043770946,0.0026859152,0.0029587382,0.0033495207],"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.000104543054,0.00029493927,0.0010319132,0.0003954905,0.00019821672,0.00033697885,0.0010086609,0.036205947,0.004873978,0.6227265,0.01772366,0.31509924],"study_design_scores_gemma":[0.00007836112,0.00022165514,0.0006461742,0.00020554035,0.00020666777,0.00066468294,0.00032969404,0.5619376,0.005865894,0.2621427,0.16755992,0.00014113465],"about_ca_topic_score_codex":0.004305962,"about_ca_topic_score_gemma":0.0051489286,"teacher_disagreement_score":0.006912546,"about_ca_system_score_codex":0.0008984858,"about_ca_system_score_gemma":0.0011589488,"threshold_uncertainty_score":0.023124814},"labels":[],"label_agreement":null},{"id":"W107350368","doi":"10.1007/978-3-642-02771-0_68","title":"The Use of Virtual Reality in the Treatment of Posttraumatic Stress Disorder (PTSD)","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Posttraumatic Stress Disorder Research","field":"Psychology","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":"Research and Productivity Council","funders":"","keywords":"Exposure therapy; Virtual Reality Exposure Therapy; Posttraumatic stress; Anxiety; Inclusion (mineral); Clinical psychology; Psychology; Psychiatry; Virtual reality; Psychotherapist; Medicine; Social psychology","score_opus":0.12261409566259113,"score_gpt":0.37291324377406176,"score_spread":0.25029914811147064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107350368","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04605373,0.69099104,0.031807657,0.0060488107,0.0027637347,0.00016104661,0.0002479343,0.00038756363,0.22153848],"genre_scores_gemma":[0.29740524,0.5890782,0.03979944,0.0026146553,0.0012919317,0.00019479041,0.00022924771,0.00008469758,0.06930179],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982446,0.000083090315,0.000007726128,0.000012330973,0.000059310547,0.0000130043445],"domain_scores_gemma":[0.9997985,0.00016409635,0.0000105274,0.0000063763005,0.000008403884,0.000012099815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048285825,0.00030903937,0.00021408424,0.00047165406,0.00015900846,0.0005581064,0.0005100038,0.00056407735,0.006168808],"category_scores_gemma":[0.0006655152,0.0001039755,0.00030638528,0.00032485215,0.00031422876,0.00040679524,0.00062931457,0.00071224984,0.00091837207],"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.00011545664,0.00014692411,0.00018743303,0.00049366796,0.00002255988,0.00031841258,0.0003024328,0.00059299194,0.002269067,0.0041071163,0.013152922,0.9782909],"study_design_scores_gemma":[0.00023000018,0.0027574843,0.018124904,0.003269442,0.00015504166,0.028091932,0.00094691897,0.0040393206,0.007221192,0.016123226,0.91891575,0.00012483052],"about_ca_topic_score_codex":0.000621495,"about_ca_topic_score_gemma":0.0013590112,"teacher_disagreement_score":0.006168808,"about_ca_system_score_codex":0.00012310335,"about_ca_system_score_gemma":0.000199148,"threshold_uncertainty_score":0.020636737},"labels":[],"label_agreement":null},{"id":"W107415006","doi":"10.1007/978-3-319-11758-4_15","title":"An Examination of Several Methods of Hyperspectral Image Denoising: Over Channels, Spectral Functions and Both Domains","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hyperspectral imaging; Image denoising; Noise reduction; Artificial intelligence; Image (mathematics); Pattern recognition (psychology); Computer science; Computer vision; Mathematics","score_opus":0.01884567537366678,"score_gpt":0.2942753125135663,"score_spread":0.27542963713989954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107415006","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.003927204,0.04014567,0.90817696,0.0014682707,0.000509339,0.0000529079,0.00005474085,0.00023849451,0.045426406],"genre_scores_gemma":[0.052658867,0.07530564,0.7906019,0.0012465515,0.0013532725,0.0001163895,0.000178376,0.0005279943,0.078010954],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994466,0.00010007664,0.000023243441,0.00008352089,0.00031960206,0.00002688868],"domain_scores_gemma":[0.9991159,0.0005047124,0.000045625213,0.00009863594,0.0002140528,0.000021069207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012061013,0.0007633697,0.0007753803,0.0014130957,0.0004748767,0.0015684374,0.0008837096,0.0012256299,0.0033442639],"category_scores_gemma":[0.0019600836,0.00046809556,0.0009980885,0.0015263691,0.0016138363,0.0019311826,0.00077959744,0.0021328898,0.0013911984],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000827772,0.000110523535,0.00054875243,0.0014564412,0.00010410428,0.00016087951,0.00041246318,0.014702358,0.023649186,0.44557714,0.017322732,0.4958727],"study_design_scores_gemma":[0.00002132618,0.00022577702,0.0038445175,0.00077699876,0.0001348333,0.0030586445,0.00041329837,0.20020075,0.046005007,0.45887944,0.28628746,0.00015192671],"about_ca_topic_score_codex":0.0010185131,"about_ca_topic_score_gemma":0.0022891064,"teacher_disagreement_score":0.0033442639,"about_ca_system_score_codex":0.00055540766,"about_ca_system_score_gemma":0.0004679434,"threshold_uncertainty_score":0.011187673},"labels":[],"label_agreement":null},{"id":"W107419099","doi":"10.1007/978-3-540-78761-7_53","title":"Virtual Constructive Swarm Compositions and Inspirations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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 Calgary","funders":"","keywords":"Constructive; Swarm behaviour; Computer science; Painting; Complement (music); Artificial intelligence; Visual arts; Art; Programming language","score_opus":0.01477922786602136,"score_gpt":0.22850639667974795,"score_spread":0.21372716881372658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107419099","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12021342,0.0025407008,0.13881575,0.0020073906,0.0020025882,0.00009272099,0.0000844624,0.0011335167,0.7331095],"genre_scores_gemma":[0.73925227,0.0010504862,0.05534948,0.00024652525,0.00040970903,0.00009743036,0.000101863865,0.00048712624,0.20300515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996258,0.00015676125,0.0000090771755,0.000043939275,0.00012599533,0.000038422262],"domain_scores_gemma":[0.99955386,0.00014335378,0.000022464525,0.00009692682,0.000059703438,0.0001236091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005746413,0.0005984349,0.00030068457,0.00057986064,0.001894082,0.003469988,0.0009230548,0.00067446975,0.020029206],"category_scores_gemma":[0.0014959066,0.00022424161,0.00023912467,0.00042891907,0.0020756144,0.0021598828,0.003116125,0.0011872934,0.00231972],"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.00031734136,0.0001139101,0.0006658313,0.00038695394,0.00003276815,0.0004694369,0.013645327,0.005487224,0.0161008,0.7222113,0.022269746,0.21829924],"study_design_scores_gemma":[0.00012690826,0.00039568366,0.0016695851,0.00039103805,0.000054297736,0.0017488521,0.013266723,0.02425603,0.0122758625,0.4052111,0.54052955,0.0000744958],"about_ca_topic_score_codex":0.00010313762,"about_ca_topic_score_gemma":0.00035905925,"teacher_disagreement_score":0.020029206,"about_ca_system_score_codex":0.00033342943,"about_ca_system_score_gemma":0.0002446073,"threshold_uncertainty_score":0.06700438},"labels":[],"label_agreement":null},{"id":"W10770133","doi":"10.1007/978-3-642-34002-4_31","title":"Deriving Variability Patterns in Software Product Lines by Ontological Considerations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Athabasca University; Simon Fraser University","funders":"","keywords":"Software product line; Reusability; Computer science; Modeling language; Software engineering; Product (mathematics); Ontology; Domain (mathematical analysis); Software; Data mining; Programming language; Software development; Mathematics","score_opus":0.04270901879381149,"score_gpt":0.2852619416467718,"score_spread":0.24255292285296032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10770133","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.067561865,0.00022402185,0.92207795,0.00041225052,0.000030765557,0.0001397368,0.0008854703,0.00068361947,0.007984253],"genre_scores_gemma":[0.45812237,0.0005611779,0.5351967,0.00016366164,0.000046178735,0.00028216428,0.0032894744,0.0004254548,0.0019127937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969023,0.0006511973,0.00044832262,0.00049101305,0.0012874557,0.00021971717],"domain_scores_gemma":[0.99160755,0.004728419,0.000802731,0.0017685769,0.0009793153,0.000113417394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022037232,0.0007365759,0.0004949201,0.0036802322,0.0009178971,0.0029603238,0.0015848677,0.0012460016,0.0017866334],"category_scores_gemma":[0.013606417,0.0010557657,0.0023774304,0.003336804,0.0013402323,0.0064395852,0.0021973702,0.0022246249,0.00067688996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022349691,0.00036626146,0.02914615,0.00091124885,0.0003054759,0.0028900881,0.004980398,0.04588808,0.021545164,0.48142174,0.0042373226,0.4080846],"study_design_scores_gemma":[0.00004724194,0.00008111505,0.009916753,0.0005671145,0.00042493874,0.0013753233,0.0019086215,0.23152132,0.01318686,0.7122962,0.028582709,0.000091802474],"about_ca_topic_score_codex":0.0027395606,"about_ca_topic_score_gemma":0.0042757555,"teacher_disagreement_score":0.0036802322,"about_ca_system_score_codex":0.00070494623,"about_ca_system_score_gemma":0.0012647852,"threshold_uncertainty_score":0.011654496},"labels":[],"label_agreement":null},{"id":"W107766491","doi":"10.1007/978-3-319-09912-5_1","title":"A Semi-supervised Learning Algorithm for Web Information Extraction with Tolerance Rough Sets","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Winnipeg","funders":"","keywords":"Computer science; Categorical variable; Noun phrase; Artificial intelligence; Phrase; Natural language processing; Vector space model; Document classification; Machine learning; Information extraction; Naive Bayes classifier; Representation (politics); Data mining; Algorithm; Noun; Support vector machine","score_opus":0.01209304195142298,"score_gpt":0.23274469537696585,"score_spread":0.22065165342554288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107766491","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.004295377,0.000116181465,0.9943673,0.000040972252,0.000027954804,0.00006236302,0.000058493522,0.0007273218,0.00030397615],"genre_scores_gemma":[0.053047497,0.00009761429,0.944985,0.00005493931,0.000039535542,0.0002301462,0.0003605373,0.00008529836,0.0010996001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.00032469016,0.000238404,0.00036896116,0.0006028358,0.00009520317],"domain_scores_gemma":[0.99807656,0.00093583186,0.00012557901,0.00025550582,0.0005572044,0.000049427872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020225921,0.0006826128,0.002512908,0.0020161162,0.0010526438,0.0017224787,0.002121201,0.0013303541,0.002489693],"category_scores_gemma":[0.0042215814,0.0007999974,0.0020990716,0.0020120037,0.00057309883,0.0021221815,0.0017626263,0.0014974994,0.0012919583],"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.00022443761,0.00020964263,0.00063782185,0.00018454622,0.00017340847,0.00009267116,0.00013174518,0.08316155,0.0071324124,0.0077121244,0.005073169,0.89526653],"study_design_scores_gemma":[0.000021026763,0.000060875165,0.00029770914,0.000015278762,0.000035549576,0.000090451744,0.000024723558,0.9872831,0.0036797936,0.0069655785,0.0015069249,0.000019023071],"about_ca_topic_score_codex":0.0024603247,"about_ca_topic_score_gemma":0.0025798168,"teacher_disagreement_score":0.002512908,"about_ca_system_score_codex":0.00066522195,"about_ca_system_score_gemma":0.0016678681,"threshold_uncertainty_score":0.01069665},"labels":[],"label_agreement":null},{"id":"W10789279","doi":"10.1007/978-3-319-11758-4_3","title":"Some “Weberized” $$L^2$$-Based Methods of Signal/Image Approximation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Image (mathematics); Function (biology); Metric (unit); Weighting; Measure (data warehouse); Mathematics; Grayscale; Combinatorics; Computer science; Discrete mathematics; Mathematical analysis; Artificial intelligence; Physics; Data mining","score_opus":0.024225324584463297,"score_gpt":0.3007137283478173,"score_spread":0.276488403763354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10789279","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.0019719286,0.005359222,0.97502047,0.00074019004,0.0008604257,0.000025132507,0.00007541418,0.00021553539,0.015731627],"genre_scores_gemma":[0.07395603,0.009767764,0.82655007,0.0012219478,0.0017429768,0.0001466317,0.00032379938,0.0007898786,0.085500866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961567,0.00013413199,0.000026992875,0.000077482895,0.000113320864,0.000032318716],"domain_scores_gemma":[0.9995976,0.0001650675,0.000029258295,0.00006801947,0.000107933505,0.000032031305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095878536,0.0010339322,0.00072419056,0.0013797429,0.00051722856,0.0013570096,0.0013088762,0.0013992245,0.008028063],"category_scores_gemma":[0.0021553843,0.00057265215,0.001193193,0.0012509825,0.0017871686,0.0016814619,0.0015614086,0.0034930548,0.002734386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071179165,0.0000355412,0.0001323567,0.00030488832,0.000055051278,0.00008082443,0.00013521507,0.016005615,0.008020562,0.7801045,0.015318077,0.17973626],"study_design_scores_gemma":[0.00002066982,0.00007274778,0.00033005138,0.0001291168,0.000051725412,0.00033085168,0.00004873019,0.33591127,0.010655336,0.52834827,0.124011405,0.0000898286],"about_ca_topic_score_codex":0.001508249,"about_ca_topic_score_gemma":0.0016916463,"teacher_disagreement_score":0.008028063,"about_ca_system_score_codex":0.0010258798,"about_ca_system_score_gemma":0.00049330114,"threshold_uncertainty_score":0.026856542},"labels":[],"label_agreement":null},{"id":"W108353034","doi":"10.1007/978-3-642-21916-0_48","title":"Towards Automatic Acquisition of a Fully Sense Tagged Corpus for Persian","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Natural language processing; Word-sense disambiguation; Persian; Artificial intelligence; Economic shortage; SemEval; Word (group theory); Natural language understanding; Natural language; Linguistics; WordNet","score_opus":0.016255368524319837,"score_gpt":0.25616247304639156,"score_spread":0.23990710452207173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108353034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15816101,0.0028487202,0.6571883,0.002047391,0.002673045,0.0010871371,0.09421061,0.047659986,0.034123857],"genre_scores_gemma":[0.24365497,0.0010703274,0.54884267,0.00064925355,0.0006210921,0.0010836156,0.18644895,0.00737848,0.010250639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778205,0.0005336964,0.00032271515,0.0007918509,0.00039313236,0.00017659266],"domain_scores_gemma":[0.9913051,0.0030349728,0.00052840135,0.0017000635,0.0030434928,0.0003880035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020708996,0.0020115739,0.001450436,0.0047463123,0.0018786445,0.0032213249,0.0018583216,0.0014820548,0.014149533],"category_scores_gemma":[0.0071944245,0.0014063905,0.00081304694,0.0031812857,0.0009765136,0.005175275,0.005017799,0.0025764632,0.016934002],"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.0011044304,0.00047713393,0.0050664837,0.0030165429,0.0001652241,0.0036606758,0.0047292677,0.003972398,0.27496332,0.018444408,0.14554343,0.5388566],"study_design_scores_gemma":[0.00044604435,0.00095952343,0.024202935,0.0009101777,0.0004995062,0.007873267,0.008093698,0.09623854,0.24019186,0.04063042,0.57949626,0.00045780733],"about_ca_topic_score_codex":0.0026608824,"about_ca_topic_score_gemma":0.005322967,"teacher_disagreement_score":0.014149533,"about_ca_system_score_codex":0.0007568186,"about_ca_system_score_gemma":0.0032006816,"threshold_uncertainty_score":0.04733497},"labels":[],"label_agreement":null},{"id":"W108365020","doi":"10.1007/978-3-642-25631-8_35","title":"An Aspect-Driven Random Walk Model for Topic-Focused Multi-document Summarization","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Automatic summarization; Computer science; Random walk; Multi-document summarization; Exploit; Task (project management); Information retrieval; Markov chain; Artificial intelligence; Natural language processing; Machine learning","score_opus":0.03908626929132147,"score_gpt":0.2656497139802484,"score_spread":0.22656344468892692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108365020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014261298,0.00095479115,0.98152816,0.00027286075,0.00011612595,0.00014197998,0.0005340617,0.0014248125,0.0007658621],"genre_scores_gemma":[0.4744334,0.0021358612,0.5023257,0.00041611725,0.00072749663,0.0008958783,0.0056863194,0.00079402403,0.012585184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987651,0.000478048,0.00010285388,0.0003423051,0.00021858473,0.00009312177],"domain_scores_gemma":[0.9966372,0.0022771037,0.00023917247,0.00024093616,0.0005097049,0.00009587298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680193,0.0010876423,0.0023745096,0.0016256457,0.0005464132,0.0014968216,0.0028475435,0.002161351,0.002780075],"category_scores_gemma":[0.008162238,0.0009102009,0.00172312,0.002695079,0.00047744953,0.0026652706,0.0010265274,0.0018478939,0.0018324964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067212584,0.00023940086,0.0024267407,0.0005462951,0.0003856243,0.0002768709,0.00046275818,0.6298631,0.008950181,0.03064087,0.013303388,0.3122327],"study_design_scores_gemma":[0.000014218066,0.00003572213,0.00016076237,0.000006378153,0.000030735984,0.000025802985,0.0000062925233,0.99371064,0.00026762715,0.0050279857,0.0007029491,0.000010969574],"about_ca_topic_score_codex":0.0065625086,"about_ca_topic_score_gemma":0.009906184,"teacher_disagreement_score":0.0065625086,"about_ca_system_score_codex":0.00076464494,"about_ca_system_score_gemma":0.00090385275,"threshold_uncertainty_score":0.014174402},"labels":[],"label_agreement":null},{"id":"W108438731","doi":"10.1007/978-3-642-33296-8_14","title":"Verification Rules for Exception Handling in Eiffel","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Eiffel; Correctness; Computer science; Programming language; Predicate (mathematical logic); Gas meter prover; Automated theorem proving; First-order logic; Theoretical computer science; Algorithm; Mathematical proof; Mathematics; Object-oriented programming","score_opus":0.034216737277494705,"score_gpt":0.261432686260511,"score_spread":0.22721594898301634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108438731","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.0069799824,0.00036558122,0.9726969,0.00048796675,0.0003248175,0.0002789233,0.00052039087,0.008131662,0.010213781],"genre_scores_gemma":[0.17753288,0.00070059544,0.8074967,0.0006415385,0.00022689214,0.00037834514,0.0021302789,0.0027314196,0.008161321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99454087,0.0013900753,0.00096668757,0.0006499988,0.0017459486,0.00070644496],"domain_scores_gemma":[0.98878,0.0070905234,0.00051119016,0.0016089687,0.0018368113,0.00017249989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007362277,0.0010445954,0.0011289519,0.0019605556,0.0015677977,0.0045841644,0.0030392392,0.0021472985,0.009958368],"category_scores_gemma":[0.020693487,0.001755698,0.0026305916,0.0010438806,0.0020944742,0.0072642635,0.00224619,0.004380716,0.004678537],"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.0006201842,0.00037268642,0.0018038935,0.0015074618,0.00022829212,0.0014760135,0.0016942732,0.035446476,0.0147629585,0.49159232,0.032535743,0.41795966],"study_design_scores_gemma":[0.0003406383,0.00011972409,0.00080539595,0.00095582317,0.0003637891,0.00088084926,0.0003334495,0.16224553,0.053209215,0.6863072,0.094207354,0.00023111288],"about_ca_topic_score_codex":0.00258605,"about_ca_topic_score_gemma":0.0027005866,"teacher_disagreement_score":0.009958368,"about_ca_system_score_codex":0.0010342889,"about_ca_system_score_gemma":0.0016076565,"threshold_uncertainty_score":0.0389359},"labels":[],"label_agreement":null},{"id":"W108517109","doi":"10.1007/978-3-642-22024-1_31","title":"Body Buddies: Social Signaling through Puppeteering","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":"Simon Fraser University","funders":"","keywords":"Avatar; Gesture; Computer science; Human–computer interaction; Metaverse; Interface (matter); Modalities; User interface; World Wide Web; Multimedia; Virtual reality; Artificial intelligence; Programming language","score_opus":0.025737375175491413,"score_gpt":0.23191274277892293,"score_spread":0.20617536760343153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108517109","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2949338,0.004528878,0.3915823,0.0016128664,0.0010274372,0.00024832832,0.0006515646,0.004645088,0.30076975],"genre_scores_gemma":[0.8340364,0.0013847031,0.071315624,0.00034218546,0.000118476244,0.00016109375,0.0005054791,0.00038705382,0.09174896],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99987006,0.000039228387,0.0000028721743,0.000027858481,0.000038227678,0.000021762851],"domain_scores_gemma":[0.9998258,0.0000805499,0.000012897439,0.00003500025,0.00001212845,0.000033707624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002002688,0.0003704085,0.00023745817,0.00026927164,0.0006495821,0.0008125691,0.00068815664,0.000651168,0.013054678],"category_scores_gemma":[0.0007725581,0.00024503938,0.00020875805,0.00019602706,0.00068020355,0.00094870495,0.0014297487,0.0006734536,0.0024443155],"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.0005402353,0.00029496045,0.003594999,0.000511747,0.00007489756,0.001447454,0.0040552868,0.0071900054,0.24789509,0.14617434,0.04221588,0.5460052],"study_design_scores_gemma":[0.00016436745,0.0009909351,0.029884059,0.0004456706,0.00016610477,0.007776404,0.0036913739,0.13046998,0.16519137,0.1602412,0.50077933,0.00019917276],"about_ca_topic_score_codex":0.00025899126,"about_ca_topic_score_gemma":0.00047511663,"teacher_disagreement_score":0.013054678,"about_ca_system_score_codex":0.00015663831,"about_ca_system_score_gemma":0.000118975695,"threshold_uncertainty_score":0.043672204},"labels":[],"label_agreement":null},{"id":"W108711140","doi":"10.1007/978-3-642-40763-5_35","title":"Ultrasound-Based Characterization of Prostate Cancer: An in vivo Clinical Feasibility Study","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Spectroscopy Techniques in Biomedical and Chemical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver General Hospital; Kingston General Hospital; Queen's University; London Health Sciences Centre; Western University; University of British Columbia","funders":"Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Prostate cancer; Ultrasound; Medicine; In vivo; Prostate; Wavelet; Clinical significance; Cancer; Radiology; Biomedical engineering; Pathology; Artificial intelligence; Internal medicine; Computer science; Biology","score_opus":0.020802683996549047,"score_gpt":0.371750640983988,"score_spread":0.35094795698743897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108711140","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.9748403,0.004232441,0.018178001,0.00026358914,0.000025935895,0.00021317333,0.00015755036,0.000098667544,0.0019904042],"genre_scores_gemma":[0.99323833,0.0013104194,0.0042353473,0.00012712313,0.000037639253,0.000065505694,0.00012800586,0.000053897285,0.00080362154],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994685,0.00035230003,0.000013502476,0.000055610857,0.00006345154,0.00004659605],"domain_scores_gemma":[0.9989506,0.00069356046,0.00009223798,0.000091663416,0.00009564541,0.00007618786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013183878,0.00052749424,0.0003515093,0.00048220786,0.00021684138,0.00044736578,0.0005344595,0.0006920063,0.0021406992],"category_scores_gemma":[0.0017311663,0.00048493178,0.00028101573,0.00037043376,0.0007279543,0.00083984155,0.0003847213,0.0005628966,0.00035430188],"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.010470476,0.0023343526,0.006279024,0.0004004848,0.0001018792,0.00082832307,0.0005194539,0.0028539319,0.93885624,0.00030121885,0.00040420363,0.0366505],"study_design_scores_gemma":[0.001821574,0.09762811,0.11181752,0.00009881834,0.0010099383,0.011673055,0.0013961113,0.043915547,0.72343266,0.0006086788,0.0064023724,0.00019559315],"about_ca_topic_score_codex":0.0012960822,"about_ca_topic_score_gemma":0.0008169377,"teacher_disagreement_score":0.0021406992,"about_ca_system_score_codex":0.00020689577,"about_ca_system_score_gemma":0.0004023153,"threshold_uncertainty_score":0.007161379},"labels":[],"label_agreement":null},{"id":"W109038666","doi":"10.1007/978-3-319-14905-9_4","title":"Is It Possible to Differentiate the Impact of Pediatric Monophasic Demyelinating Disorders and Multiple Sclerosis After a First Episode of Demyelination?","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multiple Sclerosis Research Studies","field":"Medicine","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":"SickKids Foundation; University of Toronto; Hospital for Sick Children; Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Multiple sclerosis; Thalamus; Medicine; Encephalomyelitis; Pediatrics; Population; Internal medicine; Radiology; Psychiatry","score_opus":0.07019523697645762,"score_gpt":0.33185039158914065,"score_spread":0.261655154612683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109038666","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08191363,0.63410544,0.0111411605,0.09470843,0.020354021,0.00006010784,0.0009774291,0.00028457548,0.15645525],"genre_scores_gemma":[0.37942007,0.45533553,0.021723885,0.027298298,0.021882527,0.0000862379,0.0012020111,0.00024871464,0.09280273],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99986255,0.000034277273,0.00001043966,0.000016517322,0.000052119165,0.000024028526],"domain_scores_gemma":[0.9987955,0.00084101665,0.00010486859,0.000031835065,0.0001316947,0.000094990115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054879795,0.00027540277,0.00046101862,0.00050641794,0.000142429,0.0009466579,0.00042976424,0.00068860245,0.006578027],"category_scores_gemma":[0.0030467093,0.00011757787,0.0004214849,0.0003763165,0.0005611085,0.0014386264,0.00037324228,0.0016265406,0.0018185265],"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.00043392213,0.000097295495,0.012091976,0.0013725557,0.000118517346,0.0028677646,0.0007611534,0.00031819392,0.003039693,0.021789387,0.08664085,0.87046874],"study_design_scores_gemma":[0.00017067861,0.0011155774,0.1148099,0.0068308734,0.00039186937,0.05858902,0.0028763695,0.0009842768,0.004298349,0.08246441,0.7273453,0.0001232726],"about_ca_topic_score_codex":0.0012568556,"about_ca_topic_score_gemma":0.0029487384,"teacher_disagreement_score":0.006578027,"about_ca_system_score_codex":0.00043089746,"about_ca_system_score_gemma":0.00062882446,"threshold_uncertainty_score":0.022005677},"labels":[],"label_agreement":null},{"id":"W109111233","doi":"10.1007/978-3-642-33558-7_65","title":"A Pseudo-Boolean Set Covering Machine","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Greedy algorithm; Conjunction (astronomy); Boolean function; Set (abstract data type); Constraint (computer-aided design); Minification; Theoretical computer science; Boolean data type; True quantified Boolean formula; Upper and lower bounds; Algorithm; Mathematical optimization; Mathematics; Programming language","score_opus":0.01579781902115244,"score_gpt":0.23804309873796603,"score_spread":0.2222452797168136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109111233","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.06878266,0.0010222183,0.8719894,0.0022638754,0.0005695321,0.00021187047,0.0017101378,0.0060240263,0.047426276],"genre_scores_gemma":[0.47200263,0.0005879302,0.5021251,0.0004508415,0.00021272474,0.00031596978,0.0019708069,0.0005177446,0.021816215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.00008655197,0.000018847217,0.00009103125,0.00011491439,0.000051536754],"domain_scores_gemma":[0.9995223,0.0002533103,0.000022327295,0.00010461545,0.000052600837,0.00004498759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000284633,0.00036211422,0.000646641,0.00044472129,0.00067021,0.0011185437,0.0010197952,0.0009919141,0.010693152],"category_scores_gemma":[0.0014949028,0.00027795252,0.00068084884,0.000951945,0.0006931951,0.0014954894,0.0010063618,0.00078121014,0.0016234113],"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.00033415726,0.0001635069,0.00064121705,0.000565605,0.00006770402,0.0003478286,0.00026629743,0.12051192,0.018957825,0.35161662,0.038798187,0.46772915],"study_design_scores_gemma":[0.00006445158,0.00014001831,0.00059110863,0.00006965277,0.000046543406,0.00038496504,0.00005159929,0.60567814,0.00831731,0.34863046,0.035988957,0.000036836635],"about_ca_topic_score_codex":0.00082700985,"about_ca_topic_score_gemma":0.001274407,"teacher_disagreement_score":0.010693152,"about_ca_system_score_codex":0.000784186,"about_ca_system_score_gemma":0.0007297603,"threshold_uncertainty_score":0.035772204},"labels":[],"label_agreement":null},{"id":"W109494006","doi":"10.1007/978-3-642-33687-4_21","title":"Developing Serious Games Specifically Adapted to People Suffering from Alzheimer","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Serious game; Set (abstract data type); Perception; Computer science; Cognition; Psychology; Multimedia; Psychiatry; Neuroscience","score_opus":0.03623503828401428,"score_gpt":0.2805746285321281,"score_spread":0.24433959024811383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109494006","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.8892169,0.002276575,0.05206614,0.001424388,0.0005647962,0.0022812532,0.0003035183,0.0012405324,0.050625946],"genre_scores_gemma":[0.71445113,0.003978592,0.21470033,0.0017949935,0.00009482546,0.00177297,0.0012977895,0.00026616914,0.061643183],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975806,0.00007267958,0.000026353466,0.00003562194,0.000041454998,0.000065826236],"domain_scores_gemma":[0.9996265,0.00011535326,0.000027729462,0.000017802013,0.000072459414,0.00014006802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062119507,0.0008755937,0.00031430967,0.0003486674,0.0003114773,0.0008155711,0.00084392115,0.00058345223,0.0029613164],"category_scores_gemma":[0.0017105499,0.00017945918,0.00050318614,0.00016561708,0.0002143706,0.00073313015,0.0015670133,0.0007374725,0.00091138756],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061042845,0.009429797,0.016921971,0.0013982723,0.00015106787,0.0018256262,0.015331251,0.0014515792,0.034581866,0.0020143131,0.024571843,0.8917121],"study_design_scores_gemma":[0.0022740385,0.024851097,0.27691835,0.003989618,0.0017163323,0.026013548,0.06607881,0.023898281,0.05545991,0.020287866,0.498083,0.00042920787],"about_ca_topic_score_codex":0.0011830289,"about_ca_topic_score_gemma":0.0049223867,"teacher_disagreement_score":0.0029613164,"about_ca_system_score_codex":0.00025040584,"about_ca_system_score_gemma":0.00064801925,"threshold_uncertainty_score":0.00990659},"labels":[],"label_agreement":null},{"id":"W109615606","doi":"10.1007/978-3-642-33078-0_37","title":"Multi-core Fixed Priority DVS Scheduling","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scheduling (production processes); Core (optical fiber); Parallel computing; Distributed computing; Real-time computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.03815319964917214,"score_gpt":0.27535170551314786,"score_spread":0.23719850586397573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109615606","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.07250278,0.0071746157,0.8640316,0.000404588,0.0012656036,0.00012554282,0.00033191274,0.0029689516,0.051194467],"genre_scores_gemma":[0.7869986,0.0014765963,0.18067306,0.00013929109,0.00029926395,0.000065093314,0.0004991271,0.00030601508,0.029543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997609,0.000036585512,0.000011824762,0.000048715527,0.000078681864,0.00006327013],"domain_scores_gemma":[0.9996948,0.00006730464,0.000020609414,0.000061363324,0.00010387678,0.000052007603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033965163,0.0005077101,0.0005346875,0.00048569718,0.0004719205,0.0007230737,0.0014858326,0.0002458566,0.006219288],"category_scores_gemma":[0.00069882284,0.0002184444,0.00027320284,0.00083425007,0.00018682904,0.0005014089,0.00050956407,0.00048004228,0.0007732946],"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.0009294817,0.00018174297,0.00064107456,0.00047237158,0.00007482683,0.00014058842,0.00007177117,0.16465567,0.043374497,0.037136536,0.02430353,0.72801787],"study_design_scores_gemma":[0.00011335496,0.00040325918,0.0011496817,0.000056330104,0.000057692116,0.0004210184,0.000057870715,0.88433135,0.025776181,0.032810617,0.054791015,0.000031628566],"about_ca_topic_score_codex":0.0011437328,"about_ca_topic_score_gemma":0.0026679223,"teacher_disagreement_score":0.006219288,"about_ca_system_score_codex":0.00090989645,"about_ca_system_score_gemma":0.0008294837,"threshold_uncertainty_score":0.020805597},"labels":[],"label_agreement":null},{"id":"W1097233047","doi":"10.1007/978-3-319-21542-6_15","title":"Using PSL to Extend and Evaluate Event Ontologies","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Toronto","funders":"","keywords":"Computer science; Ontology; Semantic Web; Web Ontology Language; OWL-S; Semantic Web Rule Language; Event (particle physics); Ontology language; Knowledge representation and reasoning; Semantic analytics; Semantic Web Stack; Description logic; Ontology components; Information retrieval; Event calculus; World Wide Web; Programming language; Artificial intelligence","score_opus":0.09721346066425304,"score_gpt":0.3411346015283093,"score_spread":0.24392114086405628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1097233047","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.03840082,0.00019957298,0.92471,0.0005251015,0.00022262723,0.0005501057,0.0025835019,0.019948836,0.012859451],"genre_scores_gemma":[0.2982129,0.00023887074,0.68711674,0.00023630708,0.0000822862,0.00025247806,0.0073020067,0.002393632,0.004164732],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933756,0.0017415239,0.00082469755,0.0007205914,0.0030667456,0.00027087805],"domain_scores_gemma":[0.98370993,0.008213898,0.0011631245,0.0030763308,0.0034434348,0.00039319898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008114206,0.00094276416,0.0006419078,0.004348629,0.00091246376,0.005851056,0.0016353739,0.0010361213,0.005494934],"category_scores_gemma":[0.03528629,0.0006742612,0.0014005443,0.0020035163,0.001626734,0.0089376,0.003269419,0.0016290862,0.0017592099],"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.00078353804,0.0006536483,0.018034104,0.0011639374,0.0003476007,0.0011168286,0.0025728121,0.137731,0.015095528,0.23535946,0.022107854,0.56503373],"study_design_scores_gemma":[0.00009167317,0.000119662676,0.0019510101,0.0002459955,0.00017382581,0.00020337458,0.0006675681,0.75411046,0.026221951,0.16610458,0.050031945,0.00007794787],"about_ca_topic_score_codex":0.011908315,"about_ca_topic_score_gemma":0.014321035,"teacher_disagreement_score":0.011908315,"about_ca_system_score_codex":0.0031828631,"about_ca_system_score_gemma":0.0027322748,"threshold_uncertainty_score":0.042912543},"labels":[],"label_agreement":null},{"id":"W109784087","doi":"10.1007/978-3-540-74970-7_50","title":"SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":108,"is_retracted":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":"Solver; Leverage (statistics); Portfolio; Computer science; Class (philosophy); Set (abstract data type); Algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Programming language","score_opus":0.04707438216720248,"score_gpt":0.3155200354914582,"score_spread":0.2684456533242557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109784087","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.010911665,0.00024457872,0.9625624,0.0004069098,0.00014190313,0.00040932055,0.0004194131,0.0128766615,0.012027198],"genre_scores_gemma":[0.17261267,0.00027222134,0.8120479,0.00046403313,0.00009742845,0.000798324,0.00147966,0.0036639823,0.008563857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954477,0.0018133072,0.00033777097,0.00064962736,0.0012968994,0.00045468914],"domain_scores_gemma":[0.99619776,0.0019601942,0.00022783973,0.0010582823,0.0004317777,0.00012402041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004569522,0.001184135,0.00094739516,0.001153859,0.00072317297,0.003983445,0.004349275,0.0017605829,0.019919295],"category_scores_gemma":[0.012436633,0.001358828,0.0021024314,0.0011531075,0.0015657276,0.0047657182,0.0030879094,0.0027234475,0.0053594997],"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.0009468522,0.00046182756,0.0028080735,0.0008158278,0.000272067,0.00016272718,0.00027144732,0.17611924,0.015170765,0.42465279,0.037780043,0.34053832],"study_design_scores_gemma":[0.00018040383,0.00024649486,0.0002812194,0.000102383034,0.00008557621,0.00015894716,0.000042936263,0.8189465,0.018484272,0.1315288,0.0299079,0.000034552446],"about_ca_topic_score_codex":0.0009942416,"about_ca_topic_score_gemma":0.0020130419,"teacher_disagreement_score":0.019919295,"about_ca_system_score_codex":0.0022796297,"about_ca_system_score_gemma":0.0033517964,"threshold_uncertainty_score":0.06663674},"labels":[],"label_agreement":null},{"id":"W109938289","doi":"10.1007/978-3-642-22300-6_4","title":"Multi-target Ray Searching Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Multiplicative function; Mathematical optimization; Metric (unit); Disjoint sets; Heuristic; Computer science; Context (archaeology); Measure (data warehouse); Asymptotically optimal algorithm; Mathematics; Algorithm; Search problem; Discrete mathematics; Data mining","score_opus":0.04204162678421279,"score_gpt":0.26768997297691954,"score_spread":0.22564834619270674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109938289","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.00809536,0.0025843868,0.9192465,0.0005277396,0.00017835406,0.000073352334,0.00024708488,0.0003716362,0.06867545],"genre_scores_gemma":[0.32338881,0.0061678994,0.5356307,0.00052339863,0.00050021795,0.00058563054,0.0014500053,0.001010827,0.13074258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931777,0.00019410039,0.000026822394,0.00014645053,0.0002550477,0.000059823604],"domain_scores_gemma":[0.99890983,0.0007737881,0.000073398194,0.00007963607,0.000097349264,0.00006600419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583602,0.0016869917,0.0018015355,0.0011902392,0.0007522251,0.0025759877,0.0018481498,0.003265082,0.013419855],"category_scores_gemma":[0.003486604,0.0008600837,0.0012523505,0.001998635,0.0010358006,0.0022785845,0.002663294,0.0023228552,0.0027241001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026998087,0.0001293828,0.0005186231,0.0007223299,0.0001494713,0.0002812345,0.00018578496,0.58398104,0.0037808705,0.2389748,0.02079002,0.15021645],"study_design_scores_gemma":[0.00005105531,0.000089057576,0.0003465294,0.00010946092,0.000043644854,0.00037028035,0.00008723799,0.8151384,0.0024247835,0.16195372,0.019349813,0.000036010046],"about_ca_topic_score_codex":0.0007147793,"about_ca_topic_score_gemma":0.00056146615,"teacher_disagreement_score":0.013419855,"about_ca_system_score_codex":0.000942805,"about_ca_system_score_gemma":0.000550899,"threshold_uncertainty_score":0.04489392},"labels":[],"label_agreement":null},{"id":"W110051878","doi":"10.1007/978-3-319-06734-6_7","title":"Preimage Attacks on Reduced-Round Stribog","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":28,"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":"Hash function; Computer science; Cryptographic hash function; GOST (hash function); Collision attack; Function (biology); SHA-2; Algorithm; Compression (physics); Theoretical computer science; Double hashing; Computer security","score_opus":0.024194305578451928,"score_gpt":0.2866755637425099,"score_spread":0.262481258164058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110051878","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.4863017,0.0017809595,0.36832908,0.002566015,0.00060011673,0.00031137344,0.00042322744,0.006137909,0.13354951],"genre_scores_gemma":[0.9559792,0.0003593823,0.023868728,0.00029609413,0.00010777142,0.00010476111,0.00020327247,0.0003591223,0.018721651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813795,0.00036623594,0.000068078116,0.0001961625,0.00068768265,0.0005439981],"domain_scores_gemma":[0.9977507,0.000727468,0.00013551493,0.0011328276,0.00015830992,0.00009518422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009799014,0.0009049696,0.0012243278,0.0008744536,0.0012406684,0.0019612396,0.0011581271,0.0016783936,0.008312877],"category_scores_gemma":[0.0028832722,0.00068953104,0.0009704641,0.0008077218,0.0021576919,0.0033189417,0.00383547,0.002543596,0.0031348804],"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.003342423,0.0003247379,0.0013038081,0.0003702377,0.00020220975,0.0008418619,0.0008376143,0.035189673,0.055575397,0.721802,0.018356396,0.16185366],"study_design_scores_gemma":[0.00024366564,0.0005847736,0.0012701938,0.0001274947,0.00013545426,0.0010201157,0.00019699385,0.15571156,0.064726375,0.7516051,0.024254968,0.00012324621],"about_ca_topic_score_codex":0.0003563841,"about_ca_topic_score_gemma":0.0004912616,"teacher_disagreement_score":0.008312877,"about_ca_system_score_codex":0.0009423156,"about_ca_system_score_gemma":0.00093002134,"threshold_uncertainty_score":0.027809381},"labels":[],"label_agreement":null},{"id":"W110252780","doi":"10.1007/978-3-642-21535-3_16","title":"Fall Detection from Depth Map Video Sequences","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":165,"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":"Computer science; Computer vision; Centroid; Artificial intelligence; Feature (linguistics); Occlusion","score_opus":0.027699350148387026,"score_gpt":0.23591345265455835,"score_spread":0.2082141025061713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110252780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08734184,0.0022307977,0.89462614,0.00019103363,0.00020464447,0.0002977466,0.0019456034,0.007494052,0.0056681284],"genre_scores_gemma":[0.4503314,0.00314627,0.5287934,0.0002198394,0.0001579185,0.00018967288,0.004310706,0.00042644178,0.012424227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.000013373096,0.000009235655,0.000054767243,0.00013672611,0.000054186257],"domain_scores_gemma":[0.99977595,0.000039800805,0.00002475159,0.00002055418,0.00011382973,0.000025143407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020555769,0.0013350975,0.0011308269,0.0023827052,0.00023808818,0.0005545848,0.0011068697,0.000787768,0.003178926],"category_scores_gemma":[0.00069625885,0.00044313417,0.00041000848,0.0014112828,0.00020855037,0.00055093603,0.00067861425,0.0004837105,0.0024176282],"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.00044619857,0.00009758527,0.0025988934,0.00023046996,0.000045725996,0.00022475465,0.000055684504,0.0075027836,0.090772405,0.0004066966,0.007514602,0.8901042],"study_design_scores_gemma":[0.000059094175,0.0004577497,0.030778032,0.00018411213,0.000104619096,0.0025434725,0.00028036945,0.77963275,0.16595404,0.004430971,0.015512252,0.000062637235],"about_ca_topic_score_codex":0.00416875,"about_ca_topic_score_gemma":0.009766585,"teacher_disagreement_score":0.00416875,"about_ca_system_score_codex":0.00029844177,"about_ca_system_score_gemma":0.0004639912,"threshold_uncertainty_score":0.0106345415},"labels":[],"label_agreement":null},{"id":"W1103151178","doi":"10.1007/978-3-319-21542-6_18","title":"Ontology-Based Multidimensional Contexts with Applications to Quality Data Specification and Extraction","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"Computer science; Datalog; Dimension (graph theory); Context (archaeology); Ontology; Data quality; Quality (philosophy); Information retrieval; Data mining; Database; Data extraction; Online analytical processing; Data warehouse","score_opus":0.3076732723549056,"score_gpt":0.4521949623316024,"score_spread":0.1445216899766968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1103151178","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.0030101798,0.00081234524,0.9902113,0.000547879,0.0001232281,0.00014671123,0.00042995194,0.0007728665,0.003945653],"genre_scores_gemma":[0.043250613,0.0010155287,0.95296305,0.00013593429,0.0000664463,0.00018462412,0.00076376786,0.0002082326,0.0014118049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554634,0.0011977646,0.0009627109,0.0007034456,0.0013727365,0.00021694414],"domain_scores_gemma":[0.995488,0.0017482198,0.0004260963,0.0010380287,0.001077278,0.00022225441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003966712,0.0009249741,0.0012485023,0.0043050745,0.0022306247,0.006310808,0.0022365863,0.0012878218,0.003058577],"category_scores_gemma":[0.010417145,0.0008432492,0.0029179452,0.008102942,0.0024569002,0.009191904,0.0064303987,0.0033771598,0.0008451878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052135303,0.00009852068,0.0011412038,0.00061766984,0.00007691898,0.00037711445,0.0018630486,0.012971219,0.003533338,0.81517315,0.0064864266,0.1576092],"study_design_scores_gemma":[0.000026850006,0.00004124383,0.00087864866,0.0006456739,0.00015366088,0.00059245585,0.0016932763,0.12800287,0.007167565,0.70217305,0.15849543,0.00012929835],"about_ca_topic_score_codex":0.007411253,"about_ca_topic_score_gemma":0.010892434,"teacher_disagreement_score":0.007411253,"about_ca_system_score_codex":0.002082711,"about_ca_system_score_gemma":0.0025203605,"threshold_uncertainty_score":0.020978272},"labels":[],"label_agreement":null},{"id":"W1104986043","doi":"10.1007/978-3-642-36071-8_7","title":"Trust Based Secure Gateway Discovery Mechanism for Integrated Internet and MANET","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Environmental Studies Association of Canada","funders":"","keywords":"Computer science; Computer network; The Internet; Mobile ad hoc network; Node (physics); Network packet; Computer security; Routing protocol; Distributed computing; World Wide Web","score_opus":0.010427792485565636,"score_gpt":0.21475266501823406,"score_spread":0.20432487253266843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1104986043","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.098788805,0.0017791705,0.8808357,0.0007431359,0.00052771735,0.0003349458,0.0001854993,0.0047894744,0.012015519],"genre_scores_gemma":[0.8899769,0.0005894745,0.09715805,0.00016008691,0.00014065136,0.00011952315,0.00032725994,0.00009225426,0.011435803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999134,0.00012401534,0.000095922056,0.00014753839,0.00034346848,0.0001550316],"domain_scores_gemma":[0.9986908,0.00025051064,0.00018346112,0.00046371753,0.00030126885,0.00011024345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010843839,0.00036016488,0.0007434063,0.00087164756,0.00091420073,0.0014493038,0.0016735626,0.0011442024,0.0019585544],"category_scores_gemma":[0.0018417132,0.00034743888,0.00044125083,0.0007719436,0.0005467036,0.002889386,0.0023505779,0.0014941877,0.0007524911],"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.0025568756,0.00083466363,0.0045136767,0.0006402967,0.0003293346,0.002611236,0.0012764137,0.057850514,0.12338917,0.2606745,0.028054122,0.5172692],"study_design_scores_gemma":[0.00024243047,0.00085653673,0.0023784,0.000097808035,0.00038897988,0.0036147672,0.00032777264,0.7670456,0.08746779,0.08794511,0.049438246,0.00019655662],"about_ca_topic_score_codex":0.0006799168,"about_ca_topic_score_gemma":0.0007111497,"teacher_disagreement_score":0.0019585544,"about_ca_system_score_codex":0.0007096958,"about_ca_system_score_gemma":0.0008695459,"threshold_uncertainty_score":0.006551981},"labels":[],"label_agreement":null},{"id":"W110537825","doi":"10.1007/978-3-319-09912-5_19","title":"An Intelligent Multi-Agent Based Detection Framework for Classification of Android Malware","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Android (operating system); Malware; Computer security; Software; Embedded system; Operating system","score_opus":0.03405996503419329,"score_gpt":0.3039229741928707,"score_spread":0.2698630091586774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110537825","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.021707345,0.00057255087,0.9584689,0.00023670688,0.00014189207,0.00028381514,0.00021297741,0.015445404,0.0029303827],"genre_scores_gemma":[0.28523597,0.00033810374,0.70425296,0.00027242964,0.00008996207,0.00029861505,0.0004899935,0.0002557439,0.008766291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995827,0.000056209414,0.000027203816,0.0001004163,0.0001766332,0.000056916593],"domain_scores_gemma":[0.9996105,0.00010755481,0.00004813811,0.000037850143,0.00015609396,0.00003990626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066390703,0.00087490823,0.00094657775,0.0011001214,0.0006118171,0.0012867134,0.001436449,0.0011091057,0.0021572413],"category_scores_gemma":[0.0010879537,0.00031138494,0.0006929249,0.0003219137,0.00032514648,0.0010279088,0.0009343459,0.0009552594,0.00096015894],"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.00061331474,0.00093558396,0.006124493,0.00033788092,0.00029781254,0.00067470287,0.00031803545,0.094995946,0.07891498,0.017446153,0.022621721,0.77671945],"study_design_scores_gemma":[0.000020866448,0.00008517355,0.0010652129,0.000019069075,0.000050346513,0.00020044182,0.000030656425,0.9729994,0.015421836,0.0041676415,0.005910164,0.00002934329],"about_ca_topic_score_codex":0.00422483,"about_ca_topic_score_gemma":0.0057663424,"teacher_disagreement_score":0.00422483,"about_ca_system_score_codex":0.0005659191,"about_ca_system_score_gemma":0.0008746018,"threshold_uncertainty_score":0.0084005},"labels":[],"label_agreement":null},{"id":"W110592617","doi":"10.1007/978-3-642-41299-8_30","title":"Multistage Email Spam Filtering Based on Three-Way Decisions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Process (computing); Spamming; Information retrieval; Electronic mail; Data mining; World Wide Web; The Internet","score_opus":0.03148747454763866,"score_gpt":0.2454306094741278,"score_spread":0.21394313492648914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110592617","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.08474584,0.00033924668,0.91108793,0.0003264204,0.00011214943,0.000111458176,0.000065404136,0.00038102214,0.0028305575],"genre_scores_gemma":[0.86001456,0.00020812321,0.1324225,0.00014847038,0.00014659518,0.00014888255,0.00013128118,0.000049340713,0.0067300955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502146,0.0014887691,0.0003730111,0.001285324,0.0010728453,0.00075855234],"domain_scores_gemma":[0.98637515,0.010475013,0.00066595804,0.0006548869,0.0014666889,0.00036226906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005350699,0.0011807532,0.003980723,0.0016037959,0.0020728942,0.0038113985,0.002513892,0.0027179397,0.003620787],"category_scores_gemma":[0.009286592,0.0015079704,0.0032037287,0.0013921314,0.0019787354,0.003417289,0.0020885833,0.0018560269,0.00073681533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026156243,0.00072496315,0.009782029,0.00056232477,0.0007536749,0.0011530395,0.0011103429,0.6606039,0.013901826,0.07513379,0.004070246,0.22958821],"study_design_scores_gemma":[0.00001517356,0.000084690495,0.0006203152,0.000009805497,0.00008453436,0.00006383563,0.000020710364,0.9885068,0.0013951987,0.00892917,0.00023726274,0.00003245477],"about_ca_topic_score_codex":0.0042282618,"about_ca_topic_score_gemma":0.0045653055,"teacher_disagreement_score":0.005350699,"about_ca_system_score_codex":0.001824685,"about_ca_system_score_gemma":0.0013988528,"threshold_uncertainty_score":0.028297484},"labels":[],"label_agreement":null},{"id":"W110772489","doi":"10.1007/978-3-540-39763-2_7","title":"Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Probabilistic logic; Dependency (UML); Context (archaeology); Tree (set theory); Algorithm; Generative model; Statistical model; Position (finance); Spanning tree; Theoretical computer science; Artificial intelligence; Mathematical optimization; Generative grammar; Mathematics; Combinatorics","score_opus":0.013391377084609277,"score_gpt":0.21689645103818164,"score_spread":0.20350507395357237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110772489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14149573,0.0007609845,0.8465091,0.000827221,0.0001170071,0.000045835804,0.00022020246,0.0005362739,0.009487663],"genre_scores_gemma":[0.9288341,0.0004625636,0.058405247,0.00016751504,0.000090445275,0.00012541476,0.00028528308,0.00014317762,0.011486217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952114,0.0001142361,0.000020623054,0.00014494841,0.00009035156,0.00010872495],"domain_scores_gemma":[0.99741864,0.0017891377,0.00017314337,0.00025245073,0.00026947306,0.00009720116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836621,0.000992199,0.0016690365,0.00061789044,0.00037982425,0.001362642,0.001771253,0.0021665154,0.0032215929],"category_scores_gemma":[0.003841095,0.00080615934,0.0010023826,0.00053636153,0.0011914099,0.0028560506,0.00085993117,0.0016351739,0.0008173044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014082444,0.000052436793,0.00013874564,0.00005063152,0.000021153026,0.00004071932,0.000029234943,0.9367736,0.002783316,0.04575263,0.00081950583,0.01339723],"study_design_scores_gemma":[0.0000046875925,0.000010750686,0.000021214315,0.0000017678636,0.0000047923068,0.0000048068305,0.000002109147,0.98924774,0.0002982637,0.010318647,0.000080470745,0.000004776251],"about_ca_topic_score_codex":0.0023689372,"about_ca_topic_score_gemma":0.0020366062,"teacher_disagreement_score":0.0032215929,"about_ca_system_score_codex":0.0010384776,"about_ca_system_score_gemma":0.00089521677,"threshold_uncertainty_score":0.010777354},"labels":[],"label_agreement":null},{"id":"W1108096679","doi":"10.1007/978-3-319-21542-6_12","title":"PSOA2Prolog: Object-Relational Rule Interoperation and Implementation by Translation from PSOA RuleML to ISO Prolog","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Prolog; Computer science; Programming language; Interoperation; Database; Operating system; Interoperability","score_opus":0.030539394963652787,"score_gpt":0.2834936114995408,"score_spread":0.252954216535888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1108096679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018886782,0.0001297272,0.9230744,0.00026255244,0.0002882304,0.000241013,0.0017832107,0.05794822,0.014384012],"genre_scores_gemma":[0.043295123,0.00036347445,0.89975864,0.0005528176,0.00011911702,0.00043853212,0.010893174,0.02295196,0.021627193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974962,0.0005168931,0.0003039194,0.00046466265,0.0010161018,0.00020223668],"domain_scores_gemma":[0.9977506,0.000820542,0.00010856599,0.0007253727,0.0005186052,0.00007632295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024112496,0.0010057497,0.00076865766,0.0014726403,0.00074560114,0.0060665524,0.0028386265,0.0012191562,0.021523396],"category_scores_gemma":[0.0068754503,0.0015172571,0.0018426786,0.0013927063,0.0013682768,0.004072779,0.0029239156,0.0035103739,0.018298583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003495807,0.0005013653,0.00096799433,0.0009435143,0.00013319033,0.0006037477,0.0016021075,0.009232232,0.017570335,0.17319755,0.1492926,0.64560574],"study_design_scores_gemma":[0.00016731837,0.00011635376,0.0007224996,0.00034882667,0.00012169025,0.0009880068,0.0003560642,0.14911047,0.08793634,0.13292521,0.6270492,0.00015799004],"about_ca_topic_score_codex":0.0028600052,"about_ca_topic_score_gemma":0.002279325,"teacher_disagreement_score":0.021523396,"about_ca_system_score_codex":0.00083819224,"about_ca_system_score_gemma":0.0024799493,"threshold_uncertainty_score":0.07200289},"labels":[],"label_agreement":null},{"id":"W111188507","doi":"10.1007/978-3-642-32946-3_26","title":"Oblivious Printing of Secret Messages in a Multi-party Setting","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Ciphertext; Legibility; Context (archaeology); Set (abstract data type); Computer security; Encryption; Programming language","score_opus":0.01931865633362679,"score_gpt":0.25294217323147145,"score_spread":0.23362351689784466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111188507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05545844,0.00042358108,0.9035747,0.0006131072,0.00013718444,0.00016885293,0.00016231043,0.0019259525,0.03753586],"genre_scores_gemma":[0.85035455,0.00052451575,0.10916232,0.00013988282,0.00017803916,0.00024059493,0.00016998792,0.0005612061,0.03866899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931631,0.0021656428,0.00042618785,0.0008298353,0.002236467,0.0011787012],"domain_scores_gemma":[0.9843014,0.0074712383,0.0009595611,0.0065345243,0.00050300354,0.00023025929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027023559,0.0010463973,0.0019790442,0.0012213244,0.0022129957,0.0051414254,0.0022537378,0.0025122378,0.0099003585],"category_scores_gemma":[0.011335146,0.0011793296,0.0016448331,0.0023821897,0.0033614777,0.009809493,0.0059814416,0.0032311173,0.0033376922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012246858,0.00024068613,0.0005740135,0.00033617142,0.00009616503,0.0005564992,0.0007137465,0.095629856,0.016715484,0.7842776,0.004495308,0.095139876],"study_design_scores_gemma":[0.00011086401,0.0001145308,0.00019014328,0.000047749545,0.00004531611,0.00036805283,0.00007055277,0.2730754,0.030466469,0.68991625,0.005531306,0.00006335646],"about_ca_topic_score_codex":0.00026789398,"about_ca_topic_score_gemma":0.00027786588,"teacher_disagreement_score":0.0099003585,"about_ca_system_score_codex":0.0011440046,"about_ca_system_score_gemma":0.000993688,"threshold_uncertainty_score":0.033120036},"labels":[],"label_agreement":null},{"id":"W111247914","doi":"10.1007/978-3-642-11615-5_16","title":"Haptic Simulator for Prostate Brachytherapy with Simulated Ultrasound","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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 British Columbia","funders":"","keywords":"Haptic technology; Computer science; Simulation; Brachytherapy; Ultrasound; Computer graphics (images); Radiology; Medicine; Radiation therapy","score_opus":0.018545450963407945,"score_gpt":0.28065713577722706,"score_spread":0.26211168481381913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111247914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033543237,0.0024891263,0.89210445,0.0006038355,0.0008115404,0.0003282862,0.0006531665,0.004912691,0.06455374],"genre_scores_gemma":[0.5034158,0.0038514426,0.27534857,0.0007516411,0.0002767596,0.0004938999,0.0011986949,0.0015672862,0.21309583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998254,0.00003490024,0.000006466506,0.000012978115,0.00010754891,0.000012814494],"domain_scores_gemma":[0.99969566,0.00019325802,0.000011593136,0.000033347293,0.000040387262,0.0000257597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030737917,0.0006601507,0.00032794583,0.00025073026,0.00016685679,0.0005739768,0.001097711,0.00084890146,0.02757202],"category_scores_gemma":[0.0010409565,0.00030243315,0.00046917796,0.0001732796,0.0002252829,0.00047247732,0.0009741956,0.0005679874,0.0026742278],"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.0011032472,0.00044844695,0.0007507112,0.0014172089,0.00010766278,0.0016678693,0.00092200685,0.22647956,0.2225513,0.029160416,0.046021275,0.46937028],"study_design_scores_gemma":[0.00033970698,0.0017779259,0.0024507467,0.00038421663,0.0001173707,0.00536371,0.00021382653,0.6349938,0.07746722,0.015422101,0.26123083,0.00023855825],"about_ca_topic_score_codex":0.00047787823,"about_ca_topic_score_gemma":0.00052800984,"teacher_disagreement_score":0.02757202,"about_ca_system_score_codex":0.00021442518,"about_ca_system_score_gemma":0.0003490088,"threshold_uncertainty_score":0.09223753},"labels":[],"label_agreement":null},{"id":"W111403613","doi":"10.1007/978-3-642-29344-3_43","title":"Independence of Tabulation-Based Hash Classes","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Hash function; Independence (probability theory); Discrete mathematics; Mathematics; Characterization (materials science); Combinatorics; Computer science; Statistics","score_opus":0.019587056982460393,"score_gpt":0.2527400644051529,"score_spread":0.23315300742269252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111403613","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.054409098,0.0016352737,0.8644966,0.0009789439,0.0006792781,0.00033219747,0.001581142,0.007470453,0.068416975],"genre_scores_gemma":[0.7319266,0.0018741167,0.211733,0.0012100375,0.0010621235,0.00068824424,0.003993149,0.005021096,0.04249166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99350595,0.0012669143,0.00048346745,0.0012006251,0.0025906547,0.0009524117],"domain_scores_gemma":[0.973389,0.010614075,0.00066824665,0.012432594,0.0023515676,0.00054445106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003505407,0.00087980274,0.0015027347,0.0017550588,0.0015887069,0.0065242546,0.0041368743,0.0016211346,0.019241784],"category_scores_gemma":[0.023333682,0.0017112072,0.0017495896,0.002471418,0.0034596205,0.016815538,0.0061022947,0.0047002276,0.010049745],"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.0013378409,0.00018311919,0.0015919028,0.00048579703,0.000067125104,0.00011244567,0.00039445815,0.0075642387,0.011986235,0.74525124,0.016346162,0.21467945],"study_design_scores_gemma":[0.00017375899,0.00018265791,0.0010596976,0.00014591479,0.00016140856,0.00053901586,0.00014871852,0.08319763,0.041914664,0.8372809,0.035081238,0.000114396214],"about_ca_topic_score_codex":0.000543494,"about_ca_topic_score_gemma":0.000626848,"teacher_disagreement_score":0.019241784,"about_ca_system_score_codex":0.001209691,"about_ca_system_score_gemma":0.0018361999,"threshold_uncertainty_score":0.064370155},"labels":[],"label_agreement":null},{"id":"W11142661","doi":"10.1007/978-3-319-14364-4_51","title":"Embedded Image Processing System for Automatic Page Segmentation of Open Book Images","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Victoria","funders":"","keywords":"Laptop; Image processing; Computer science; Computer vision; Artificial intelligence; Digital image processing; Computer graphics (images); Process (computing); Segmentation; Image segmentation; Image (mathematics); Operating system","score_opus":0.020238909366015162,"score_gpt":0.293227390962778,"score_spread":0.2729884815967628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11142661","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.19254924,0.0030844312,0.7120984,0.00039024066,0.0008661914,0.0005307976,0.003410158,0.07386756,0.013202883],"genre_scores_gemma":[0.39232647,0.0013613371,0.56082785,0.0006552974,0.00037741408,0.0005223784,0.005452946,0.001979276,0.036497056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997515,0.0000142721765,0.000015873022,0.000090568414,0.00009515379,0.000032729087],"domain_scores_gemma":[0.999622,0.00007010222,0.000032102238,0.000048327398,0.00019194486,0.000035492347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002678263,0.0007141954,0.00081053795,0.0018087261,0.0003619691,0.0008948279,0.0012142302,0.00077315647,0.017608842],"category_scores_gemma":[0.0005389685,0.00040807307,0.00037619023,0.0010573822,0.00013795607,0.0006954896,0.00048136746,0.00044516876,0.0068442835],"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.0012820348,0.00028496177,0.0020953007,0.0003664622,0.00008952794,0.00033663373,0.00011079203,0.0013858617,0.41938612,0.00063915097,0.023335211,0.55068797],"study_design_scores_gemma":[0.00027188612,0.00094802596,0.022545146,0.00011152567,0.00032249145,0.0018786003,0.00017659197,0.23518774,0.69562274,0.0011600605,0.041613642,0.00016150282],"about_ca_topic_score_codex":0.0014043086,"about_ca_topic_score_gemma":0.0023622336,"teacher_disagreement_score":0.017608842,"about_ca_system_score_codex":0.00037754196,"about_ca_system_score_gemma":0.00048530937,"threshold_uncertainty_score":0.05890745},"labels":[],"label_agreement":null},{"id":"W111607860","doi":"10.1007/11564126_51","title":"Rank Measures for Ordering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Western University","funders":"","keywords":"Rank (graph theory); Ranking (information retrieval); Computer science; Data mining; Preference; Information retrieval; Measure (data warehouse); Order (exchange); The Internet; Learning to rank; Data science; Operations research; Statistics; World Wide Web; Mathematics","score_opus":0.030336124075654808,"score_gpt":0.27242332548377635,"score_spread":0.24208720140812154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111607860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007927364,0.007289253,0.9258571,0.002524129,0.0009098158,0.00015003009,0.0027723522,0.0016934576,0.05087639],"genre_scores_gemma":[0.24001859,0.010478413,0.6381729,0.0016684607,0.004548436,0.0010401356,0.009983174,0.0021291932,0.09196074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436486,0.0015961154,0.00039341688,0.00083302404,0.002394952,0.000417604],"domain_scores_gemma":[0.9864428,0.006789132,0.00082491414,0.0035876953,0.0018542771,0.00050109305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439355,0.0021626893,0.0031034623,0.008755389,0.0021223642,0.0066669984,0.0024624004,0.0019952005,0.023014825],"category_scores_gemma":[0.021688215,0.00096355705,0.0015474926,0.012125805,0.0031741261,0.011347899,0.0028099339,0.0057021426,0.008006111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052692427,0.000053361822,0.00027231156,0.00021307691,0.000026378535,0.00003275631,0.00010933869,0.0047757044,0.0004246424,0.80466765,0.037599843,0.15177226],"study_design_scores_gemma":[0.000007803038,0.000027449754,0.00013729694,0.000044030214,0.000012233992,0.00006260265,0.000029677629,0.017359586,0.00036443947,0.96644443,0.01549373,0.00001684587],"about_ca_topic_score_codex":0.001987222,"about_ca_topic_score_gemma":0.0022125125,"teacher_disagreement_score":0.023014825,"about_ca_system_score_codex":0.0030196859,"about_ca_system_score_gemma":0.0020785122,"threshold_uncertainty_score":0.076992214},"labels":[],"label_agreement":null},{"id":"W111628921","doi":"10.1007/978-3-642-25853-4_20","title":"Direct Marketing with Fewer Mistakes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Computer science; Simple (philosophy); Business intelligence; Direct marketing; Data mining; Artificial intelligence; Machine learning; Marketing; Business","score_opus":0.058246575118476564,"score_gpt":0.3020111573716868,"score_spread":0.24376458225321027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111628921","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.1797672,0.0043906593,0.2826338,0.011568497,0.0018874503,0.00030319337,0.0005050879,0.0025926393,0.5163515],"genre_scores_gemma":[0.7141607,0.001120122,0.036835972,0.0013146884,0.00089973194,0.00014796437,0.0002451316,0.0003520564,0.24492364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689025,0.0010258413,0.00009905453,0.0006624722,0.00096080545,0.00036149358],"domain_scores_gemma":[0.98817796,0.0058881184,0.0008293827,0.0037317614,0.00079736585,0.000575369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030944233,0.0011180631,0.001952584,0.0009527426,0.0010825946,0.004410337,0.0013423446,0.002599307,0.055570994],"category_scores_gemma":[0.016018772,0.0006778487,0.000845336,0.0010671284,0.0017905019,0.005507208,0.0024443492,0.0030529452,0.011233682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001408915,0.0014188595,0.0034341884,0.0006684854,0.00024836202,0.00047937018,0.0005329945,0.020789774,0.004344685,0.41447183,0.06058391,0.4916186],"study_design_scores_gemma":[0.0003859747,0.00065429363,0.0022099738,0.00014368372,0.00015190433,0.0012107712,0.00032507302,0.07456224,0.002835896,0.87141293,0.04604119,0.00006603551],"about_ca_topic_score_codex":0.0004858875,"about_ca_topic_score_gemma":0.00096812355,"teacher_disagreement_score":0.055570994,"about_ca_system_score_codex":0.0011490182,"about_ca_system_score_gemma":0.0013723752,"threshold_uncertainty_score":0.18590349},"labels":[],"label_agreement":null},{"id":"W111876617","doi":"10.1007/978-3-319-08909-6_9","title":"Coverage Driven Test Generation and Consistency Algorithm","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Concordia University","funders":"","keywords":"Solver; Computer science; Local consistency; Consistency (knowledge bases); Algorithm; Constraint (computer-aided design); Process (computing); Constraint satisfaction problem; Domain (mathematical analysis); Mathematics; Artificial intelligence; Programming language","score_opus":0.012176953579279096,"score_gpt":0.2190911942703553,"score_spread":0.20691424069107622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111876617","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.012965496,0.00021299394,0.9783246,0.00032020317,0.00006844606,0.00027741207,0.00026645756,0.0030350287,0.0045293905],"genre_scores_gemma":[0.20316842,0.00014602754,0.78881437,0.00036783284,0.000062186824,0.00050064473,0.0013465703,0.00089545496,0.00469845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589646,0.0015114772,0.00016387108,0.0006033418,0.0015342738,0.00029072101],"domain_scores_gemma":[0.98897773,0.00697328,0.00040739498,0.0016763442,0.0017920635,0.00017319544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00257751,0.0012396135,0.0011387321,0.002543193,0.0005903513,0.0012937974,0.0035961955,0.0017509051,0.009865741],"category_scores_gemma":[0.014717449,0.0009300542,0.0015854231,0.0023499462,0.0012401928,0.0017526586,0.0024089795,0.0021222692,0.0016056295],"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.00051544263,0.00044830938,0.0024622628,0.0004924852,0.00015715482,0.0005773587,0.00015849211,0.25932217,0.022858191,0.053240657,0.017556848,0.64221066],"study_design_scores_gemma":[0.00012540429,0.00016095967,0.0005056401,0.000065983986,0.00007413297,0.00033870724,0.000041212097,0.9206057,0.017397359,0.05568619,0.0049727876,0.000026020318],"about_ca_topic_score_codex":0.0021865717,"about_ca_topic_score_gemma":0.0027508002,"teacher_disagreement_score":0.009865741,"about_ca_system_score_codex":0.0011961295,"about_ca_system_score_gemma":0.002146939,"threshold_uncertainty_score":0.033004165},"labels":[],"label_agreement":null},{"id":"W112136115","doi":"10.1007/978-3-642-12242-2_4","title":"WiMAX Network Planning Using Adaptive-Population-Size Genetic Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"WiMAX; Computer science; Wireless broadband; Genetic algorithm; Population; Software deployment; Population size; Wireless network; Wireless; Distributed computing; Computer network; Mathematical optimization; Telecommunications; Machine learning; Mathematics","score_opus":0.012525902762142905,"score_gpt":0.22716529680596725,"score_spread":0.21463939404382434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112136115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015507541,0.00029228508,0.976324,0.00012776055,0.00005284461,0.00008107583,0.000043241842,0.00032961773,0.007241559],"genre_scores_gemma":[0.5677365,0.00043822953,0.4248123,0.00012191462,0.000048098635,0.0005455992,0.00016953456,0.00011747761,0.0060102926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.00005739974,0.000007868179,0.000041963558,0.000059519964,0.000028026283],"domain_scores_gemma":[0.99963856,0.00021451265,0.00003074219,0.000018568107,0.000080816186,0.000016849492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005623689,0.0007720308,0.0008599484,0.00068162824,0.00054304063,0.00068108964,0.0013210054,0.0010193557,0.0022122124],"category_scores_gemma":[0.0015518721,0.0005246656,0.0005758873,0.0009152234,0.000497069,0.00082963984,0.0006183538,0.00071300194,0.00029602653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012959893,0.000016090993,0.00014717318,0.000013037696,0.000009032118,0.000019382658,0.00001455981,0.98027086,0.00045380325,0.0020357561,0.00050156366,0.01650584],"study_design_scores_gemma":[0.0000055781743,0.000008572533,0.000049794646,0.0000022488136,0.000003911933,0.000006192214,0.0000036561876,0.9988412,0.00012175566,0.0008085773,0.0001460285,0.0000024020183],"about_ca_topic_score_codex":0.008773857,"about_ca_topic_score_gemma":0.008516318,"teacher_disagreement_score":0.008773857,"about_ca_system_score_codex":0.001020023,"about_ca_system_score_gemma":0.001103804,"threshold_uncertainty_score":0.017445564},"labels":[],"label_agreement":null},{"id":"W112193273","doi":"10.1007/978-3-642-24431-5_18","title":"Modeling and Verifying Timed Compensable Workflows and an Application to Health Care","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Workflow; Software engineering; Programming language; Database","score_opus":0.025498761650640623,"score_gpt":0.25340919748673,"score_spread":0.2279104358360894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112193273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015397233,0.00017447442,0.98131496,0.00014963819,0.000055532288,0.00014659287,0.00018286226,0.0011967979,0.0013819633],"genre_scores_gemma":[0.3204093,0.00042730157,0.6741553,0.00008874373,0.000062892905,0.0002062055,0.0005542882,0.0004104627,0.0036855042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726045,0.0006554051,0.00034406444,0.00054569135,0.0009286667,0.00026566026],"domain_scores_gemma":[0.992898,0.004669349,0.0005756541,0.00081133266,0.0008830379,0.00016269171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005155244,0.0011990977,0.0011066203,0.0012163804,0.001102909,0.0026754772,0.0029318626,0.0018228873,0.0039599673],"category_scores_gemma":[0.011809587,0.001250032,0.0031433874,0.0014415927,0.0024081455,0.0029075092,0.0017619821,0.0019299926,0.0004173693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019143621,0.00009545351,0.0012764976,0.0002505499,0.00009062766,0.0006860856,0.0003755132,0.73543733,0.004938827,0.22184427,0.0012097248,0.03360371],"study_design_scores_gemma":[0.00004220889,0.00003626533,0.00015112673,0.000026825614,0.00004255475,0.000087971384,0.000045088582,0.92184806,0.0026924405,0.07262701,0.0023801154,0.000020348634],"about_ca_topic_score_codex":0.02821039,"about_ca_topic_score_gemma":0.019308351,"teacher_disagreement_score":0.02821039,"about_ca_system_score_codex":0.0018334097,"about_ca_system_score_gemma":0.004039802,"threshold_uncertainty_score":0.05609238},"labels":[],"label_agreement":null},{"id":"W112266661","doi":"10.1007/978-3-642-17569-5_4","title":"The Roadmap for Sharing Electronic Health Records: The Emerging Ubiquity and Cloud Computing Trends","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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":"Lakehead University","funders":"","keywords":"Cloud computing; Interoperability; Health care; Data sharing; Workflow; Software deployment; Specialty; Business; Health records; Medical record; Computer science; Data science; Internet privacy; World Wide Web; Medicine; Political science","score_opus":0.04262835298685666,"score_gpt":0.39553388709166115,"score_spread":0.3529055341048045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112266661","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010714618,0.22676976,0.07851513,0.5231901,0.01519988,0.00022733553,0.0010905126,0.0010176644,0.1432751],"genre_scores_gemma":[0.1762367,0.4147672,0.17271425,0.09972213,0.032946505,0.00039322296,0.0031658835,0.0010208609,0.09903319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968304,0.0011131591,0.00022124314,0.00040276942,0.0010976479,0.00033476658],"domain_scores_gemma":[0.9877713,0.0065449458,0.0005564562,0.0010844348,0.002182151,0.0018606918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007319601,0.0007196232,0.0006863971,0.0021958787,0.0015591846,0.009738518,0.0025914835,0.006417127,0.029576533],"category_scores_gemma":[0.011234906,0.00063671987,0.0010658782,0.0059357267,0.0029106943,0.03321161,0.0054645715,0.0069831824,0.0067430506],"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.000063923624,0.00010110449,0.0014118024,0.0009927332,0.000036851183,0.0001800989,0.0007271384,0.0011180398,0.0008847945,0.4174266,0.21663056,0.36042637],"study_design_scores_gemma":[0.000015151019,0.000057511366,0.0012011024,0.0008695497,0.000020594816,0.0005282301,0.001038288,0.0022317441,0.0003653472,0.18816693,0.8054706,0.00003505509],"about_ca_topic_score_codex":0.003310383,"about_ca_topic_score_gemma":0.003892668,"teacher_disagreement_score":0.029576533,"about_ca_system_score_codex":0.0022552568,"about_ca_system_score_gemma":0.0073847007,"threshold_uncertainty_score":0.09894341},"labels":[],"label_agreement":null},{"id":"W112565442","doi":"10.1007/978-3-642-25832-9_3","title":"Semi-Supervised Classification Using Tree-Based Self-Organizing Maps","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Carleton University","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Artificial neural network; Cardinality (data modeling); Pattern recognition (psychology); Tree (set theory); Training set; Machine learning; Data mining; Mathematics","score_opus":0.0442433781530636,"score_gpt":0.24654343320559793,"score_spread":0.20230005505253434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112565442","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.028411916,0.0005008892,0.9665917,0.00008786089,0.000113071,0.00013774821,0.0003089785,0.0021679208,0.0016799695],"genre_scores_gemma":[0.43102455,0.00039187734,0.5622651,0.000113079586,0.0001606989,0.00040208627,0.0020409042,0.00025395225,0.0033477547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.00031711836,0.00013119364,0.00036184883,0.00045727278,0.000111651905],"domain_scores_gemma":[0.9972516,0.0012220346,0.00018357518,0.00032319082,0.00093017676,0.00008956114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016706977,0.0007653918,0.001508723,0.0016408408,0.0006486146,0.0016261023,0.0015801821,0.00095328875,0.001384053],"category_scores_gemma":[0.0033114497,0.00043780243,0.001475709,0.0016272585,0.00045261433,0.0015896192,0.0011062467,0.0008529693,0.0013167133],"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.00031661498,0.00027344463,0.002288511,0.000292379,0.00023542071,0.00013524722,0.00025412938,0.07468925,0.012269761,0.004655808,0.008158354,0.89643115],"study_design_scores_gemma":[0.00001059368,0.00006104119,0.00072644296,0.000018843773,0.000032248976,0.00009000447,0.000044838733,0.9884135,0.0039284006,0.0056630396,0.0009944285,0.000016640533],"about_ca_topic_score_codex":0.0019791205,"about_ca_topic_score_gemma":0.0027993345,"teacher_disagreement_score":0.0019791205,"about_ca_system_score_codex":0.00041189505,"about_ca_system_score_gemma":0.00085374666,"threshold_uncertainty_score":0.008835614},"labels":[],"label_agreement":null},{"id":"W112570555","doi":"10.1007/978-3-642-30950-2_5","title":"Measuring Learners’ Co-Occurring Emotional Responses during Their Interaction with a Pedagogical Agent in MetaTutor","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"McGill University","funders":"","keywords":"Sadness; Facial expression; Computer science; Set (abstract data type); Task (project management); Embodied cognition; Session (web analytics); Human–computer interaction; Emotion classification; Anger; Cognitive psychology; Psychology; Social psychology; Artificial intelligence; World Wide Web","score_opus":0.11464592980015544,"score_gpt":0.3046143077099599,"score_spread":0.18996837790980448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112570555","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.99807787,0.000028372195,0.0012835551,0.000010368082,0.0000056338413,0.000024354853,0.00003917417,0.000034687466,0.0004960841],"genre_scores_gemma":[0.9954856,0.00005363367,0.003279685,0.00001766094,0.000005972183,0.00007075453,0.000109081266,0.000014848334,0.00096279633],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993993,0.00023879779,0.000041994394,0.0001259245,0.00013269567,0.00006131524],"domain_scores_gemma":[0.99732935,0.0016124869,0.00032532043,0.00012411676,0.00027900506,0.00032967073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007525943,0.00030246025,0.00026011476,0.0002721105,0.00022740407,0.00072225794,0.0003352961,0.00049926207,0.0016715506],"category_scores_gemma":[0.005038594,0.0001435755,0.0002210443,0.00018432546,0.00017464322,0.0004827885,0.0007652558,0.00048858614,0.0005390882],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004668038,0.0029068883,0.40737846,0.00070946285,0.0004508788,0.0006743076,0.030630132,0.002410803,0.36644328,0.00029774083,0.001568319,0.1818616],"study_design_scores_gemma":[0.00008547917,0.0054877824,0.8617015,0.00007288447,0.00047942813,0.0012087644,0.011192209,0.014360471,0.10248662,0.0002180224,0.0026022082,0.00010472078],"about_ca_topic_score_codex":0.00030807246,"about_ca_topic_score_gemma":0.0005259394,"teacher_disagreement_score":0.0016715506,"about_ca_system_score_codex":0.00011895879,"about_ca_system_score_gemma":0.00013115155,"threshold_uncertainty_score":0.005591929},"labels":[],"label_agreement":null},{"id":"W112603785","doi":"10.1007/978-3-642-15751-6_23","title":"An Integrated Approach for Medical Image Retrieval through Combining Textual and Visual Features","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"York University","funders":"","keywords":"Computer science; Image retrieval; Information retrieval; Artificial intelligence; Computer vision; Image (mathematics)","score_opus":0.01616550943508944,"score_gpt":0.29485070051683787,"score_spread":0.27868519108174844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112603785","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.014546815,0.0038960103,0.9716518,0.00048510544,0.00023203007,0.0002772456,0.0009118065,0.0042780344,0.0037211124],"genre_scores_gemma":[0.0880834,0.0022841408,0.89721006,0.0004833382,0.00037799208,0.0003164397,0.0022349365,0.00038611784,0.008623498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922264,0.00010820328,0.00007543182,0.00012596758,0.00041423965,0.000053474785],"domain_scores_gemma":[0.9992811,0.00021044507,0.00005961092,0.000080197366,0.00033107595,0.000037690657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096903753,0.00087558327,0.0010459437,0.003348628,0.00031195756,0.0016488683,0.0011581271,0.0011439518,0.0043380917],"category_scores_gemma":[0.0018052085,0.000360747,0.0011625644,0.00269233,0.00036111157,0.0023252224,0.001485015,0.0006416753,0.0032605212],"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.00029038277,0.00026072326,0.000581894,0.0006557308,0.00017048954,0.00019998278,0.000105079234,0.0028793472,0.1428127,0.0020508294,0.010479563,0.83951324],"study_design_scores_gemma":[0.0002538524,0.0014453338,0.011383772,0.00037484532,0.0019314161,0.0049192663,0.0006613268,0.5782042,0.29025608,0.023855573,0.08637045,0.00034394884],"about_ca_topic_score_codex":0.0011696991,"about_ca_topic_score_gemma":0.0027422286,"teacher_disagreement_score":0.0043380917,"about_ca_system_score_codex":0.0003026509,"about_ca_system_score_gemma":0.00048093402,"threshold_uncertainty_score":0.01451236},"labels":[],"label_agreement":null},{"id":"W112679440","doi":"10.1007/978-3-642-30982-3_7","title":"Software Performance Modeling","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Computer science; Software; Software engineering; Programming language","score_opus":0.019671694145660387,"score_gpt":0.23348765136815444,"score_spread":0.21381595722249405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112679440","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.0063696937,0.0037214595,0.70101535,0.0013952785,0.0004616554,0.00014739163,0.0014354463,0.0044765435,0.28097713],"genre_scores_gemma":[0.39735147,0.013021435,0.19767028,0.0008295193,0.00092322537,0.0007145637,0.006326541,0.0028409737,0.38032198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.00013287335,0.00003354378,0.0001405588,0.0003798392,0.00006918886],"domain_scores_gemma":[0.999288,0.00020053906,0.00005885697,0.00017388542,0.00024608502,0.00003262773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006354068,0.0015805073,0.0006223927,0.0012085732,0.0005103134,0.0017016806,0.0018477609,0.0008211131,0.01834415],"category_scores_gemma":[0.0026832179,0.0005002638,0.00086670945,0.001335771,0.00035252565,0.0022403512,0.0007591264,0.0014392054,0.012856132],"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.00004181417,0.00016453209,0.00065145537,0.00029103144,0.000042490476,0.00010846205,0.0001912615,0.2016144,0.0039251214,0.4975929,0.067180686,0.22819595],"study_design_scores_gemma":[0.000010339635,0.00007360761,0.0006040894,0.00013912856,0.000043511238,0.00014933578,0.00005894705,0.56248164,0.004445479,0.23011328,0.20184666,0.000033959215],"about_ca_topic_score_codex":0.0031309384,"about_ca_topic_score_gemma":0.0016951382,"teacher_disagreement_score":0.01834415,"about_ca_system_score_codex":0.0011239734,"about_ca_system_score_gemma":0.0010776181,"threshold_uncertainty_score":0.061367333},"labels":[],"label_agreement":null},{"id":"W112792529","doi":"10.1007/978-3-642-21593-3_39","title":"Maneuvering Head Motion Tracking by Coarse-to-Fine Particle Filter","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Particle filter; Tracking (education); Computer vision; Robustness (evolution); Weighting; Artificial intelligence; Tracking system; Filter (signal processing); Algorithm; Acoustics; Physics","score_opus":0.05050819503096862,"score_gpt":0.28693180873425234,"score_spread":0.2364236137032837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112792529","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.0058118864,0.00025823253,0.99179417,0.000042795105,0.00009405694,0.000022531614,0.00005047485,0.0007561072,0.0011697367],"genre_scores_gemma":[0.36092684,0.0007561616,0.62961847,0.000168858,0.00012758291,0.000093082264,0.0005381625,0.0001975485,0.0075734193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978524,0.000022751898,0.000011077102,0.000074133364,0.000075314165,0.000031425654],"domain_scores_gemma":[0.9997565,0.000069298134,0.000020726744,0.00005984741,0.00007779074,0.000015724601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035377606,0.0007280501,0.0010652833,0.00060169137,0.0003714982,0.000568477,0.00069099374,0.0008173294,0.0015722989],"category_scores_gemma":[0.0010118898,0.00048406888,0.00069821975,0.00092639984,0.00035301427,0.0006338333,0.00091656914,0.0008734884,0.0009565704],"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.00031255992,0.00008071223,0.0015228277,0.00015750238,0.00012940109,0.0001385869,0.00011946139,0.26031718,0.058896195,0.0040738313,0.0060636993,0.66818804],"study_design_scores_gemma":[0.000008772296,0.000031309813,0.0009609619,0.0000060762986,0.00002072261,0.00008049409,0.00000939885,0.98923546,0.0066497177,0.0016031588,0.0013809764,0.000012927574],"about_ca_topic_score_codex":0.0072962437,"about_ca_topic_score_gemma":0.0064333514,"teacher_disagreement_score":0.0072962437,"about_ca_system_score_codex":0.00031941547,"about_ca_system_score_gemma":0.00077128434,"threshold_uncertainty_score":0.014507532},"labels":[],"label_agreement":null},{"id":"W113154612","doi":"10.1007/978-3-642-33093-3_22","title":"Adaptation and Genomic Evolution in EcoSim","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; Adaptation (eye); Biology","score_opus":0.017583893813993903,"score_gpt":0.22883524677568073,"score_spread":0.21125135296168684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113154612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09898216,0.007469506,0.7887751,0.0014732595,0.0006353207,0.00004308886,0.00018390077,0.0008530956,0.101584606],"genre_scores_gemma":[0.75482154,0.004000638,0.20600726,0.0003970385,0.00024844136,0.00013039036,0.0002629356,0.00047703175,0.033654798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991643,0.000030916286,0.0000040401405,0.000018446877,0.000021896873,0.000008267636],"domain_scores_gemma":[0.9998772,0.000073647745,0.000009494017,0.000018264296,0.000012889631,0.000008485768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020927623,0.0003255584,0.0004393671,0.00025695353,0.00028891367,0.00069077354,0.00063154375,0.00062735425,0.0046854788],"category_scores_gemma":[0.0010997211,0.00019673262,0.00041422294,0.00044872222,0.00073003425,0.0010408349,0.0008215365,0.00079401163,0.00064741395],"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.000041398565,0.000023094197,0.0008069939,0.00016941666,0.000051685965,0.00018681565,0.0002104549,0.27284598,0.0042886953,0.59416205,0.0034793369,0.123734035],"study_design_scores_gemma":[0.000011255328,0.000036703786,0.0006033898,0.000034604338,0.000023389604,0.00020826024,0.000057174806,0.48615906,0.0016643056,0.4915362,0.019638453,0.000027185408],"about_ca_topic_score_codex":0.0007755964,"about_ca_topic_score_gemma":0.00076447555,"teacher_disagreement_score":0.0046854788,"about_ca_system_score_codex":0.0003207808,"about_ca_system_score_gemma":0.00019566219,"threshold_uncertainty_score":0.015674531},"labels":[],"label_agreement":null},{"id":"W113325530","doi":"10.1007/3-540-45995-2_22","title":"On the Power of BFS to Determine a Graphs Diameter","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Lexicographical order; Upper and lower bounds; Combinatorics; Computer science; Graph; Constant (computer programming); Expressive power; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Programming language","score_opus":0.027953404545050294,"score_gpt":0.271347188716214,"score_spread":0.2433937841711637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113325530","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.119089365,0.0034376113,0.8157728,0.0035898553,0.00043097898,0.00012372556,0.00096975086,0.0024035692,0.054182347],"genre_scores_gemma":[0.5598668,0.0021862516,0.4197095,0.0009183652,0.0011633851,0.00022895381,0.0014435091,0.0012248658,0.013258441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966384,0.0012051086,0.000144151,0.0006572536,0.0010216598,0.00033340038],"domain_scores_gemma":[0.96869993,0.025748339,0.00062857947,0.0025334326,0.0016355744,0.00075417163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004004416,0.0014986669,0.0023582648,0.0044483333,0.0018654605,0.0033648082,0.0033571145,0.0021612945,0.008291951],"category_scores_gemma":[0.030759273,0.0011548799,0.001511086,0.0041632187,0.0037924969,0.010834043,0.003257129,0.004482602,0.002759198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012073584,0.00030346357,0.009542647,0.00067644625,0.0001451619,0.0003063208,0.0010930332,0.0980484,0.01072344,0.5280531,0.030649753,0.31925085],"study_design_scores_gemma":[0.00006237261,0.00008183024,0.0013099447,0.000096033604,0.00005970761,0.0002225567,0.00016142685,0.24151869,0.0037453473,0.745663,0.00703269,0.00004627736],"about_ca_topic_score_codex":0.005265311,"about_ca_topic_score_gemma":0.004841146,"teacher_disagreement_score":0.008291951,"about_ca_system_score_codex":0.0021666083,"about_ca_system_score_gemma":0.0012999158,"threshold_uncertainty_score":0.027739346},"labels":[],"label_agreement":null},{"id":"W113712403","doi":"10.1007/978-3-319-11164-3_2","title":"Multiple Ways to Fail: Generalizing a Monitor’s Verdict for the Classification of Execution Traces","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"TRACE (psycholinguistics); Equivalence (formal languages); Computer science; Event (particle physics); Completeness (order theory); Logical equivalence; Theoretical computer science; Mathematics; Discrete mathematics; Linguistics","score_opus":0.060203100558849906,"score_gpt":0.2988143434886405,"score_spread":0.23861124292979058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113712403","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.023577105,0.00028425158,0.9699791,0.0007816118,0.00010124695,0.00016831492,0.00036782643,0.0016786382,0.0030618594],"genre_scores_gemma":[0.56844115,0.00041098188,0.4213359,0.00065462675,0.00039721045,0.00041945546,0.0016449541,0.0010677106,0.005628031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887298,0.002801276,0.0010777427,0.0029151384,0.0031645186,0.0013115463],"domain_scores_gemma":[0.96149826,0.02199599,0.0026029379,0.00994789,0.0028202345,0.0011347581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009203094,0.001967078,0.002444432,0.0041586384,0.0018985106,0.0052497173,0.005913547,0.0041972585,0.0033177936],"category_scores_gemma":[0.050077386,0.0011720089,0.0041462337,0.002452818,0.007913867,0.012293622,0.007415969,0.007968189,0.00090708974],"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.00065193826,0.00023123757,0.012720413,0.00047630235,0.00023796117,0.00076731766,0.0025647115,0.09511151,0.0054106945,0.6707953,0.009869082,0.20116346],"study_design_scores_gemma":[0.000029434543,0.00009520798,0.00089088,0.0001025003,0.000099934914,0.0002532877,0.00013990837,0.3216035,0.0032453244,0.67046124,0.0030268233,0.000051905357],"about_ca_topic_score_codex":0.004246143,"about_ca_topic_score_gemma":0.004368859,"teacher_disagreement_score":0.009203094,"about_ca_system_score_codex":0.0023482307,"about_ca_system_score_gemma":0.0027830456,"threshold_uncertainty_score":0.048671186},"labels":[],"label_agreement":null},{"id":"W113770795","doi":"10.1007/978-3-642-33509-9_38","title":"Payload Drop Application of Unmanned Quadrotor Helicopter Using Gain-Scheduled PID and Model Predictive Control Techniques","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Testbed; Payload (computing); PID controller; Model predictive control; Computer science; Control theory (sociology); Control engineering; Control (management); Engineering; Artificial intelligence; Temperature control","score_opus":0.00812870677486541,"score_gpt":0.22546068252257845,"score_spread":0.21733197574771304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113770795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3895089,0.0012025572,0.5778092,0.00026771336,0.00039740975,0.00014600299,0.00009960052,0.0015067884,0.029061867],"genre_scores_gemma":[0.9800357,0.00021170564,0.0128655415,0.000027678414,0.00002716259,0.000016959248,0.00005982501,0.000043016516,0.006712389],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999174,0.0000052634246,0.0000025191096,0.000011197019,0.00004963781,0.000014040151],"domain_scores_gemma":[0.99992096,0.000017053282,0.000011114374,0.000009904437,0.00003343953,0.0000075368175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009154173,0.00040907835,0.00036596486,0.00023877721,0.00030912276,0.0003094412,0.0004145182,0.0002862113,0.0016634254],"category_scores_gemma":[0.00017419351,0.000092242044,0.000224545,0.00013782222,0.00013041477,0.00022434063,0.0003979116,0.00028389826,0.00024839275],"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.00069284905,0.00022157218,0.0015431866,0.0004443797,0.000045688783,0.0010220085,0.00017182277,0.13587463,0.53950554,0.0022629928,0.003501943,0.3147133],"study_design_scores_gemma":[0.000034720753,0.00061663095,0.0026605881,0.000020337888,0.000025429636,0.000197411,0.00006527406,0.8619185,0.13059832,0.0005669437,0.0032839736,0.000011889442],"about_ca_topic_score_codex":0.0015902324,"about_ca_topic_score_gemma":0.0017758454,"teacher_disagreement_score":0.0016634254,"about_ca_system_score_codex":0.00019563701,"about_ca_system_score_gemma":0.00017016924,"threshold_uncertainty_score":0.0055646896},"labels":[],"label_agreement":null},{"id":"W113842324","doi":"10.1007/978-3-540-71677-8_9","title":"Optimistic Fair Exchange in a Multi-user Setting","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"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":"Iran Telecommunication Research Center; York University","keywords":"Computer science; Random oracle; Computer security; Encryption; Key exchange; Oracle; Computer security model; Key (lock); Signature (topology); Public-key cryptography; Scheme (mathematics); Mathematics","score_opus":0.018644610070629692,"score_gpt":0.27764272781927457,"score_spread":0.2589981177486449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113842324","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.14434528,0.0007371951,0.83702826,0.0029155798,0.000390722,0.00022202621,0.00020862068,0.0006111967,0.013541081],"genre_scores_gemma":[0.9587398,0.00017247688,0.03526766,0.0001467667,0.00021071633,0.0000804002,0.000048047717,0.000047992675,0.0052860305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98725164,0.0062224893,0.00057504704,0.0013673864,0.0026354664,0.0019480777],"domain_scores_gemma":[0.9571703,0.027262358,0.002159759,0.007844668,0.002634943,0.0029279238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01860304,0.0011743982,0.003099299,0.0013279717,0.004445646,0.007721043,0.00477389,0.0034347922,0.007889711],"category_scores_gemma":[0.035550103,0.0014112594,0.0007925048,0.001956394,0.00376553,0.0123480335,0.007041149,0.004139142,0.0008047436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003167253,0.0003325734,0.0019419799,0.00017020629,0.00023439975,0.00093952974,0.0007610568,0.2568,0.00306634,0.7020924,0.0048544076,0.025639782],"study_design_scores_gemma":[0.00013493831,0.00009739804,0.00016662372,0.00001442255,0.000056718607,0.00015495827,0.00010105334,0.64285755,0.00077796803,0.354502,0.0010826986,0.00005360538],"about_ca_topic_score_codex":0.001410388,"about_ca_topic_score_gemma":0.0017662797,"teacher_disagreement_score":0.01860304,"about_ca_system_score_codex":0.0024279014,"about_ca_system_score_gemma":0.0033946144,"threshold_uncertainty_score":0.098383486},"labels":[],"label_agreement":null},{"id":"W113865656","doi":"10.1007/978-3-319-03916-9_8","title":"An Ontology-Driven Personalization Framework for Designing Theory-Driven Self-management Interventions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diabetes Management and Education","field":"Medicine","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":"Dalhousie University","funders":"","keywords":"Personalization; Ontology; Computer science; Self-management; Psychosocial; Knowledge management; Psychology; World Wide Web; Artificial intelligence; Psychotherapist","score_opus":0.029198080465560664,"score_gpt":0.3110113082286162,"score_spread":0.28181322776305556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113865656","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.0023088397,0.00012839687,0.98541695,0.0010307824,0.000045018445,0.00041780877,0.00027586875,0.0005843607,0.00979203],"genre_scores_gemma":[0.04325943,0.00015802162,0.95299566,0.0002135206,0.000012190641,0.0007685643,0.00058762677,0.00014062376,0.0018643289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960355,0.002158575,0.00035289826,0.00045307656,0.0008091785,0.00019078965],"domain_scores_gemma":[0.9949344,0.0031866324,0.00026308143,0.00081627705,0.0005679898,0.00023164591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063611413,0.0009635721,0.00059462385,0.0018262803,0.0015785333,0.0043759146,0.0025756818,0.0013833941,0.008250748],"category_scores_gemma":[0.008766632,0.000808233,0.0023002767,0.0016820695,0.0027347798,0.0041432874,0.0042988183,0.002793723,0.0011866444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006407134,0.0002789769,0.0011581862,0.000781608,0.0001447634,0.00023156655,0.00685934,0.021414373,0.0030342846,0.7887964,0.0076107904,0.1696256],"study_design_scores_gemma":[0.00006971513,0.000071863404,0.00062915287,0.000494163,0.00012813334,0.00024166417,0.0022540686,0.09923139,0.0037015846,0.762164,0.13095905,0.00005516152],"about_ca_topic_score_codex":0.0057091084,"about_ca_topic_score_gemma":0.009010656,"teacher_disagreement_score":0.008250748,"about_ca_system_score_codex":0.0027316294,"about_ca_system_score_gemma":0.0048665097,"threshold_uncertainty_score":0.03364134},"labels":[],"label_agreement":null},{"id":"W113882479","doi":"10.1007/978-3-642-21043-3_16","title":"Consolidation Using Context-Sensitive Multiple Task Learning","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Acadia University","funders":"","keywords":"Computer science; Consolidation (business); Artificial intelligence; Transfer of learning; Task (project management); Knowledge transfer; Context (archaeology); Machine learning; Knowledge management; Engineering","score_opus":0.03743050568410767,"score_gpt":0.25366410986390914,"score_spread":0.21623360417980148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113882479","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.017378457,0.0007060019,0.97661906,0.00014889103,0.00027634433,0.00012617819,0.00011778183,0.003013754,0.0016134926],"genre_scores_gemma":[0.58727604,0.0007328697,0.40194756,0.00043393899,0.0003490078,0.00047545065,0.0012264594,0.00074504997,0.006813644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880385,0.000294371,0.000095455325,0.0004815058,0.0001889118,0.0001357698],"domain_scores_gemma":[0.9950788,0.002389035,0.00023668156,0.0012310342,0.00074522186,0.00031931768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024353839,0.0016061119,0.002541683,0.001031226,0.0007151963,0.0019680704,0.0041401563,0.0016438492,0.0057743937],"category_scores_gemma":[0.00755284,0.0010405697,0.001150077,0.0017327772,0.0008096444,0.0047641764,0.004091484,0.0039286823,0.0025255745],"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.0005255297,0.00058419904,0.00080671645,0.00020956414,0.00020996964,0.00011004649,0.00013771578,0.056929942,0.032014802,0.0060759545,0.0061200005,0.8962757],"study_design_scores_gemma":[0.000046417248,0.00016706297,0.000439051,0.00001954404,0.00005978292,0.00008125198,0.000029052077,0.9588152,0.015209482,0.023488035,0.0016089666,0.000036108308],"about_ca_topic_score_codex":0.0018863488,"about_ca_topic_score_gemma":0.0021040125,"teacher_disagreement_score":0.0057743937,"about_ca_system_score_codex":0.0005712003,"about_ca_system_score_gemma":0.0012635943,"threshold_uncertainty_score":0.019317329},"labels":[],"label_agreement":null},{"id":"W114022766","doi":"10.1007/978-3-642-31125-3_15","title":"Axis-Parallel Dimension Reduction for Biometric Research","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Dimensionality reduction; Biometrics; Fingerprint (computing); Chaotic; Reduction (mathematics); Artificial neural network; Curse of dimensionality; Dimension (graph theory); Pattern recognition (psychology); Artificial intelligence; Mathematics","score_opus":0.0882276989861538,"score_gpt":0.33905918759727266,"score_spread":0.25083148861111887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114022766","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.0044130036,0.002635331,0.98299915,0.0002453698,0.00038373927,0.000059249043,0.00031321798,0.0011307901,0.007820192],"genre_scores_gemma":[0.054248977,0.004349735,0.9182494,0.0002104208,0.00038225154,0.00022289435,0.001175831,0.0004020237,0.020758364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994037,0.00011170917,0.00003573011,0.00013236789,0.00027825008,0.00003811275],"domain_scores_gemma":[0.9996363,0.00008568372,0.00002265349,0.00013687913,0.00010450391,0.00001396505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039889335,0.001097355,0.0007609976,0.00097036845,0.0004972597,0.0011830723,0.0007373913,0.00043552346,0.009665678],"category_scores_gemma":[0.0007992701,0.00037813323,0.0008132019,0.0015467794,0.0006623631,0.0011493011,0.0012711085,0.0011991308,0.0050130016],"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.00016096416,0.00007118512,0.00037164634,0.00043321738,0.00006320621,0.00009200028,0.000112649635,0.013605808,0.062653005,0.10199754,0.029532481,0.7909063],"study_design_scores_gemma":[0.000045900815,0.00029771426,0.002303732,0.00012595541,0.00012886774,0.0015286262,0.00020557726,0.33967048,0.13419324,0.27999106,0.24137671,0.000132099],"about_ca_topic_score_codex":0.00047583162,"about_ca_topic_score_gemma":0.00055217807,"teacher_disagreement_score":0.009665678,"about_ca_system_score_codex":0.00032725715,"about_ca_system_score_gemma":0.0004503201,"threshold_uncertainty_score":0.032334864},"labels":[],"label_agreement":null},{"id":"W114064698","doi":"10.1007/978-3-642-25591-5_57","title":"Input-Thrifty Extrema Testing","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Maxima and minima; Mathematics; Mathematical analysis","score_opus":0.05714484744274282,"score_gpt":0.26104418046016725,"score_spread":0.20389933301742444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114064698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08841576,0.000913986,0.80653614,0.0027784007,0.0007661685,0.00023237285,0.0007296288,0.008494247,0.091133274],"genre_scores_gemma":[0.7937496,0.00034679304,0.17912981,0.0009372498,0.00025697474,0.00021653381,0.0011263409,0.0019021648,0.022334596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590874,0.0008749677,0.00020582048,0.00064952107,0.0016817149,0.00067916326],"domain_scores_gemma":[0.98827016,0.0063235043,0.00042107134,0.0033948352,0.0012693298,0.00032117323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023928382,0.0014508304,0.0017863605,0.0013431073,0.0010353151,0.0023913088,0.004100946,0.002821361,0.01706699],"category_scores_gemma":[0.018514758,0.0007397626,0.0015038314,0.0014155599,0.0031077021,0.0052699386,0.004814055,0.0038212202,0.0028477693],"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.0011890033,0.0003439831,0.0027797248,0.0006332126,0.00013011947,0.0008576481,0.00031850755,0.06505477,0.0143821305,0.42446375,0.031115947,0.45873123],"study_design_scores_gemma":[0.0000771498,0.00019066119,0.00049492245,0.00015582965,0.000060910388,0.00060727424,0.00008694874,0.22331065,0.020073889,0.7465333,0.008361644,0.000046769448],"about_ca_topic_score_codex":0.0005681826,"about_ca_topic_score_gemma":0.0008291565,"teacher_disagreement_score":0.01706699,"about_ca_system_score_codex":0.0011587064,"about_ca_system_score_gemma":0.0013580143,"threshold_uncertainty_score":0.057094753},"labels":[],"label_agreement":null},{"id":"W114672764","doi":"10.1007/978-3-642-31057-7_7","title":"McSAF: A Static Analysis Framework for MATLAB","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Computer science; MATLAB; Compiler; Programming language; Popularity; Variety (cybernetics); Key (lock); Software engineering; Artificial intelligence; Operating system","score_opus":0.021554044612445623,"score_gpt":0.2852327739081108,"score_spread":0.26367872929566516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114672764","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.0009624601,0.00028141335,0.8336195,0.00015830391,0.00012160952,0.000070967566,0.0018135315,0.15579237,0.007179826],"genre_scores_gemma":[0.0715157,0.0010930483,0.7800584,0.0009027053,0.00033474827,0.00097199454,0.007992749,0.108936444,0.028194211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982133,0.00034546427,0.00020040994,0.00029750564,0.00074740144,0.00019594564],"domain_scores_gemma":[0.99727005,0.0013486288,0.00019059394,0.0004770921,0.00063297874,0.000080732876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015315119,0.002657819,0.0012484435,0.002094849,0.000838706,0.0030173238,0.003416662,0.0010956998,0.08903304],"category_scores_gemma":[0.006997372,0.0016176698,0.002136888,0.001590813,0.0009243358,0.0032541195,0.0020593482,0.0027933617,0.033738647],"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.0007394204,0.00018819659,0.001727139,0.0016391224,0.00030028805,0.00049330905,0.00046183908,0.038574044,0.018844571,0.1258062,0.28270066,0.52852523],"study_design_scores_gemma":[0.00034735064,0.00014474732,0.00090688386,0.0006036953,0.00018273943,0.0008592159,0.00013216927,0.31860328,0.059251357,0.16141553,0.457328,0.00022510071],"about_ca_topic_score_codex":0.0030818118,"about_ca_topic_score_gemma":0.005070995,"teacher_disagreement_score":0.08903304,"about_ca_system_score_codex":0.0010541691,"about_ca_system_score_gemma":0.0018749981,"threshold_uncertainty_score":0.29784518},"labels":[],"label_agreement":null},{"id":"W114980831","doi":"10.1007/978-3-662-43984-5_2","title":"Online Data Clustering Using Variational Learning of a Hierarchical Dirichlet Process Mixture of Dirichlet Distributions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hierarchical Dirichlet process; Dirichlet process; Computer science; Dirichlet distribution; Cluster analysis; Generalized Dirichlet distribution; Hierarchical clustering; Latent Dirichlet allocation; Mixture model; Artificial intelligence; Data mining; Concentration parameter; Flexibility (engineering); Pattern recognition (psychology); Algorithm; Dirichlet's energy; Machine learning; Mathematics; Topic model; Statistics; Bayesian probability","score_opus":0.03894781772483317,"score_gpt":0.3141210490527649,"score_spread":0.2751732313279317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114980831","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.0011802105,0.00013529767,0.998108,0.00006795296,0.000018933273,0.00002693261,0.00004388972,0.00020952497,0.00020915821],"genre_scores_gemma":[0.08749901,0.00045303412,0.9075299,0.00020116923,0.0001454414,0.00035499016,0.001009584,0.00043000636,0.002376855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99301285,0.002825035,0.00044475353,0.0019893027,0.0013239537,0.00040413308],"domain_scores_gemma":[0.9876621,0.00861116,0.0004933748,0.0017381839,0.0011871218,0.00030808692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066534653,0.0013164281,0.0045543513,0.0030460285,0.0018028506,0.004423222,0.0071568564,0.0033718005,0.003589074],"category_scores_gemma":[0.024695335,0.0025095565,0.0046048486,0.005220123,0.0023583556,0.006272791,0.0055962447,0.0050215833,0.0019193206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028006756,0.0001920059,0.0015725651,0.0004022861,0.00036600453,0.00013392724,0.00079347525,0.5715543,0.0033662175,0.14021578,0.008068078,0.27305523],"study_design_scores_gemma":[0.000009469112,0.000010034948,0.000073889794,0.000014946341,0.000014744202,0.000033059336,0.00002417944,0.9560457,0.0004509601,0.04255454,0.00075360155,0.000014877126],"about_ca_topic_score_codex":0.011442321,"about_ca_topic_score_gemma":0.014164594,"teacher_disagreement_score":0.011442321,"about_ca_system_score_codex":0.0031195665,"about_ca_system_score_gemma":0.0027859213,"threshold_uncertainty_score":0.035187364},"labels":[],"label_agreement":null},{"id":"W115100454","doi":"10.1007/978-3-642-23774-4_25","title":"A Framework for Supporting Joint Interpersonal Attention in Distributed Groups","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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 Saskatchewan","funders":"U.S. Department of Agriculture; National Science Foundation","keywords":"Computer science; Human–computer interaction; Workgroup; Workspace; Joint attention; Interpersonal communication; Anticipation (artificial intelligence); Architecture; Implementation; Focus (optics); Key (lock); Negotiation; Artificial intelligence; Computer security; Software engineering; Psychology; Social psychology","score_opus":0.19536306089630306,"score_gpt":0.392118506419487,"score_spread":0.19675544552318391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115100454","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.006715815,0.00012593,0.98589516,0.00021616742,0.000060962182,0.00018555262,0.00006487534,0.0021457777,0.004589766],"genre_scores_gemma":[0.23187248,0.00015283124,0.7597749,0.00016855585,0.00008508132,0.00058920117,0.0002396587,0.0002906582,0.0068266126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729306,0.00096652505,0.00018650905,0.0004587125,0.0007394219,0.00035573903],"domain_scores_gemma":[0.99566466,0.002131806,0.00019886614,0.0010694626,0.00044325436,0.00049209426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00432283,0.00073367986,0.0009282084,0.0010931831,0.0025338528,0.0036853638,0.004872492,0.0023578967,0.0097019],"category_scores_gemma":[0.010129417,0.0008180322,0.0012092262,0.001093707,0.0022680925,0.005739861,0.0069388617,0.0027032427,0.0019832246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004596597,0.00072445563,0.0018355324,0.00029820396,0.00012517955,0.0003932765,0.00303717,0.062870294,0.008251441,0.68561614,0.010426357,0.22596227],"study_design_scores_gemma":[0.00015458954,0.00017903581,0.0003846513,0.00007997574,0.00010779653,0.00016497326,0.0005219584,0.5719536,0.0050947866,0.39174935,0.029530313,0.00007900602],"about_ca_topic_score_codex":0.007576818,"about_ca_topic_score_gemma":0.008275158,"teacher_disagreement_score":0.0097019,"about_ca_system_score_codex":0.0013457111,"about_ca_system_score_gemma":0.0021068137,"threshold_uncertainty_score":0.0324561},"labels":[],"label_agreement":null},{"id":"W115533587","doi":"10.1007/978-3-642-30353-1_30","title":"Mining the Hidden Structure of Inductive Learning Data Sets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Cluster analysis; Curse of dimensionality; Visualization; Machine learning; Domain (mathematical analysis); Variety (cybernetics); Process (computing); Class (philosophy); Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.04681161006848464,"score_gpt":0.2897300678363297,"score_spread":0.24291845776784507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115533587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062649086,0.0010039596,0.93228686,0.0007559113,0.000080253405,0.00013196038,0.0008868421,0.00058789813,0.0016172249],"genre_scores_gemma":[0.40739328,0.0015362408,0.58103365,0.00029952786,0.00034717258,0.00043943516,0.0058700447,0.00014499729,0.00293568],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971609,0.0008797232,0.0002601449,0.0005526165,0.00095733086,0.00018931123],"domain_scores_gemma":[0.98254573,0.012776054,0.001193904,0.0021597438,0.0011163368,0.00020826532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047906796,0.00089652534,0.0012229128,0.0030622957,0.00074938074,0.0021367723,0.0026605472,0.0009835309,0.001400181],"category_scores_gemma":[0.020295415,0.0008180057,0.0015879242,0.0024208769,0.001552969,0.00485366,0.0029281015,0.0027293388,0.0008065366],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002942688,0.0004893386,0.026735017,0.0011639927,0.00036386758,0.00046749157,0.0013187495,0.07563411,0.010416286,0.079563074,0.008423484,0.7951304],"study_design_scores_gemma":[0.000031274,0.000118329335,0.003623724,0.00029942617,0.00011116309,0.00022796463,0.0002829311,0.66612655,0.008665985,0.31592762,0.004546874,0.000038101327],"about_ca_topic_score_codex":0.000529818,"about_ca_topic_score_gemma":0.0010097885,"teacher_disagreement_score":0.0047906796,"about_ca_system_score_codex":0.000891359,"about_ca_system_score_gemma":0.0013090089,"threshold_uncertainty_score":0.025335848},"labels":[],"label_agreement":null},{"id":"W115868610","doi":"10.1007/978-3-319-04921-2_43","title":"Distinguishing Pattern Languages with Membership Examples","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical proof; Computer science; Dimension (graph theory); Formal language; Relevance (law); Theoretical computer science; Artificial intelligence; Natural language processing; Programming language; Mathematics; Pure mathematics","score_opus":0.014603815730506373,"score_gpt":0.24604043617381732,"score_spread":0.23143662044331095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115868610","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.053985965,0.0007034844,0.893029,0.0015474962,0.00023242335,0.00011649458,0.00036281324,0.0019928408,0.04802956],"genre_scores_gemma":[0.5070909,0.0008782579,0.45321712,0.0007353882,0.00036578305,0.00021402465,0.0018854955,0.0009643973,0.034648556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831283,0.00036695495,0.00016072408,0.00043630856,0.000564133,0.00015900149],"domain_scores_gemma":[0.9954196,0.0030801282,0.00018654433,0.000810161,0.00036197586,0.0001416445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750687,0.00056883495,0.000696775,0.0014019608,0.0008257952,0.0026749705,0.0015029237,0.0012066087,0.0084536085],"category_scores_gemma":[0.008351662,0.0007290276,0.0011566614,0.0014916387,0.0019698697,0.010221445,0.0040930347,0.0040778844,0.0031279738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019820163,0.00008240365,0.0012145224,0.00036798703,0.000025655667,0.00023896624,0.0008518423,0.0030384455,0.008136298,0.6416766,0.01005218,0.33411694],"study_design_scores_gemma":[0.000011396304,0.000031467225,0.0002606883,0.000055735276,0.000013476789,0.0004792172,0.00014508022,0.017922377,0.0065949867,0.957922,0.016542884,0.000020524032],"about_ca_topic_score_codex":0.00018465299,"about_ca_topic_score_gemma":0.00023518984,"teacher_disagreement_score":0.0084536085,"about_ca_system_score_codex":0.0005507098,"about_ca_system_score_gemma":0.00053546275,"threshold_uncertainty_score":0.028280139},"labels":[],"label_agreement":null},{"id":"W116052530","doi":"10.1007/978-3-642-31585-5_45","title":"Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Normalization property; Node (physics); Theoretical computer science; Computer network","score_opus":0.02377643852343522,"score_gpt":0.24624049077504437,"score_spread":0.22246405225160915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116052530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28670844,0.0005523754,0.698307,0.001035492,0.00012954962,0.00011833779,0.00019848737,0.00069175713,0.012258631],"genre_scores_gemma":[0.96360487,0.00017011173,0.02949543,0.00007504053,0.000066943416,0.00012329065,0.000072109004,0.0000810428,0.0063110846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883264,0.0004989416,0.0000494689,0.00022170297,0.00018480411,0.00021248824],"domain_scores_gemma":[0.9875387,0.00964258,0.0009229127,0.000855857,0.0004221906,0.00061778456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073938,0.00089770276,0.0016185712,0.0009037783,0.0009298929,0.0016877032,0.0025917976,0.0018970257,0.0025886416],"category_scores_gemma":[0.012324951,0.0010252661,0.0010598662,0.0010105766,0.001998948,0.0027434481,0.0030725643,0.001478385,0.00033017885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005441085,0.00007276898,0.00074196473,0.00010535096,0.00007856476,0.00018648358,0.000145437,0.9231397,0.001623351,0.06167901,0.0011942048,0.010489071],"study_design_scores_gemma":[0.000026783258,0.000029901632,0.00006248353,0.0000066133894,0.000013890043,0.000027098711,0.000017973045,0.9795837,0.0002900747,0.019748526,0.00018350872,0.000009526932],"about_ca_topic_score_codex":0.001559138,"about_ca_topic_score_gemma":0.0016363941,"teacher_disagreement_score":0.0025917976,"about_ca_system_score_codex":0.0009345965,"about_ca_system_score_gemma":0.0008939059,"threshold_uncertainty_score":0.010968208},"labels":[],"label_agreement":null},{"id":"W116068320","doi":"10.1007/978-3-642-24412-4_3","title":"On the Expressive Power of Deep Architectures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":180,"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":"Computer science; Deep learning; Artificial intelligence; Expressive power; Deep neural networks; Electronic circuit; Computer architecture; Theoretical computer science; Electrical engineering","score_opus":0.01627985766662682,"score_gpt":0.23056476091546363,"score_spread":0.2142849032488368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116068320","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.025547707,0.0139071,0.8664644,0.0066764774,0.0004931057,0.000031577893,0.000543342,0.0011475737,0.08518885],"genre_scores_gemma":[0.69629526,0.01591841,0.24403363,0.0028146768,0.0017097248,0.00020434456,0.0009205232,0.0009658996,0.037137512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00027678814,0.0000782376,0.00013369217,0.00034467576,0.000098054385],"domain_scores_gemma":[0.9947305,0.004116452,0.00013401115,0.00072776614,0.00020749938,0.00008374967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016792679,0.0009705936,0.0008543021,0.000728168,0.0006431527,0.0031249926,0.0016244728,0.0012808479,0.0069908476],"category_scores_gemma":[0.008553319,0.0010025067,0.00077167625,0.0010929169,0.0036721113,0.010052786,0.003223866,0.0058284136,0.0012282904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009626856,0.000021538348,0.00020902169,0.0001852308,0.00003551324,0.00008050707,0.00013213744,0.026407162,0.0027526289,0.8872958,0.004804249,0.07797991],"study_design_scores_gemma":[0.000006866838,0.000008121997,0.0000502156,0.000035314988,0.00000810639,0.000029964696,0.0000114197255,0.045369104,0.00067571644,0.9500756,0.0037229662,0.000006564235],"about_ca_topic_score_codex":0.0013924814,"about_ca_topic_score_gemma":0.0021348777,"teacher_disagreement_score":0.0069908476,"about_ca_system_score_codex":0.0009688215,"about_ca_system_score_gemma":0.00043742094,"threshold_uncertainty_score":0.023386717},"labels":[],"label_agreement":null},{"id":"W116094967","doi":"10.1007/978-3-319-08729-0_10","title":"A Definition of Structured Rough Set Approximations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Rough set; Approximations of π; Equivalence (formal languages); Computer science; Set (abstract data type); Equivalence relation; Equivalence class (music); Dominance-based rough set approach; Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence; Applied mathematics","score_opus":0.030653163837816615,"score_gpt":0.2413412161142809,"score_spread":0.21068805227646428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116094967","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.0028360912,0.0018786322,0.9806904,0.0007864238,0.0003325634,0.000069688205,0.00027977844,0.00014079713,0.0129856495],"genre_scores_gemma":[0.086892,0.0027405242,0.90176415,0.00052692136,0.0004922218,0.00028871917,0.00061210804,0.000100024954,0.0065833866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705803,0.00078587065,0.00032627233,0.00038124624,0.0013380419,0.000110613546],"domain_scores_gemma":[0.99750453,0.0011094194,0.00024475582,0.00041462126,0.0006269168,0.000099816665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029151028,0.0006599775,0.0010215592,0.0023500735,0.00072858273,0.003585958,0.0014747278,0.0010728667,0.0032129684],"category_scores_gemma":[0.0071719405,0.0006735117,0.0016612151,0.003023708,0.0019865609,0.004501665,0.002124196,0.0030710336,0.0010905488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012433094,0.0000117875015,0.00008254701,0.00011566001,0.000022913495,0.00006446345,0.00023029221,0.003737901,0.0007777389,0.96752477,0.0025279182,0.024891676],"study_design_scores_gemma":[0.000015758154,0.000063167485,0.00019250567,0.00014367812,0.00004035527,0.0003931211,0.0001295513,0.036370926,0.0011134794,0.89748037,0.06402608,0.000031143656],"about_ca_topic_score_codex":0.0005672222,"about_ca_topic_score_gemma":0.00058819377,"teacher_disagreement_score":0.003585958,"about_ca_system_score_codex":0.0009732952,"about_ca_system_score_gemma":0.00085773075,"threshold_uncertainty_score":0.015416682},"labels":[],"label_agreement":null},{"id":"W116099850","doi":"10.1007/978-3-642-39112-5_71","title":"Diagnosing Errors from Off-Path Steps in Model-Tracing Tutors","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Tracing; TUTOR; Computer science; Path (computing); Path tracing; Artificial intelligence; Programming language","score_opus":0.022745182458768075,"score_gpt":0.24112825718717767,"score_spread":0.2183830747284096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116099850","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.53812045,0.00028170546,0.4466324,0.00034216736,0.000119428885,0.00025030828,0.00038483666,0.010761815,0.0031068816],"genre_scores_gemma":[0.90575075,0.00005564512,0.09186112,0.000050510014,0.000009505696,0.00003832648,0.0003291762,0.00031586408,0.0015891553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960264,0.0012645711,0.000301118,0.0009153706,0.0012085855,0.00028390522],"domain_scores_gemma":[0.9691038,0.01977814,0.0025443877,0.0038231483,0.0038084884,0.00094215653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026068983,0.0011523722,0.0009592816,0.001384809,0.0005845318,0.0020303146,0.0023865462,0.0024165795,0.003162285],"category_scores_gemma":[0.043644764,0.00053904584,0.00046370286,0.00073416944,0.00072193146,0.0027717075,0.0030013437,0.0018048803,0.0010301278],"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.0045436667,0.0010621869,0.13841434,0.0005776302,0.00023028662,0.002278551,0.004306251,0.254698,0.030360457,0.008856776,0.0046438216,0.5500279],"study_design_scores_gemma":[0.000055669396,0.00048153847,0.0047815307,0.000073466086,0.000082595565,0.0005397775,0.00062211143,0.95052433,0.033020433,0.00812248,0.001650307,0.00004587435],"about_ca_topic_score_codex":0.004659084,"about_ca_topic_score_gemma":0.0040253946,"teacher_disagreement_score":0.004659084,"about_ca_system_score_codex":0.0009060256,"about_ca_system_score_gemma":0.001930224,"threshold_uncertainty_score":0.013786733},"labels":[],"label_agreement":null},{"id":"W1161795","doi":"10.1007/978-3-642-34487-9_31","title":"A Hybrid Approach for Adaptive Car Navigation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Automaton; Learning automata; Adaptive routing; Fuzzy logic; Routing (electronic design automation); Distributed computing; Real-time computing; Artificial intelligence; Embedded system; Static routing; Routing protocol","score_opus":0.03167977978734778,"score_gpt":0.253879394189371,"score_spread":0.2221996144020232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1161795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00392814,0.00032365305,0.9911424,0.000032747925,0.0001087711,0.000018161636,0.000026124164,0.00051394134,0.0039060516],"genre_scores_gemma":[0.32189316,0.00078322965,0.6502793,0.00013113969,0.00016539852,0.00019980328,0.00024808632,0.00022290602,0.026077054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998419,0.00001988676,0.000006885538,0.000038623803,0.00007326874,0.000019337249],"domain_scores_gemma":[0.9999014,0.000032391777,0.000005034313,0.000015876582,0.000036807152,0.000008456995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016265683,0.000702921,0.00068181864,0.00050719763,0.0004352001,0.00071871676,0.0013336404,0.0008398532,0.005021931],"category_scores_gemma":[0.00027604445,0.00036174865,0.0006632298,0.0005988169,0.0003009352,0.0006878564,0.0012934967,0.00065062114,0.0011965614],"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.00015640541,0.00008962211,0.0003287564,0.00019576892,0.00014665799,0.00020129909,0.00011253434,0.40027252,0.02771358,0.0307128,0.005374123,0.534696],"study_design_scores_gemma":[0.000011196546,0.000051073832,0.0001006891,0.000007239728,0.000021855789,0.000072169554,0.000014296844,0.98661417,0.0016114742,0.006847012,0.0046361685,0.00001259438],"about_ca_topic_score_codex":0.0037289946,"about_ca_topic_score_gemma":0.0042636525,"teacher_disagreement_score":0.005021931,"about_ca_system_score_codex":0.00026779823,"about_ca_system_score_gemma":0.0003093374,"threshold_uncertainty_score":0.016800046},"labels":[],"label_agreement":null},{"id":"W1164910490","doi":"10.1007/978-3-319-21837-3_9","title":"Minimum-Cost Information Dissemination in Social Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Prince Edward Island","funders":"","keywords":"Computer science; Business; Internet privacy","score_opus":0.014681728136535897,"score_gpt":0.28075043330614696,"score_spread":0.26606870516961106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1164910490","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.04836408,0.0022448786,0.92888933,0.0029243447,0.00019837686,0.00031483156,0.00050758256,0.0005207248,0.016035851],"genre_scores_gemma":[0.7642188,0.004185896,0.19846444,0.00045088862,0.00090694416,0.0010154882,0.0007728964,0.0004265981,0.029558158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658066,0.0016516402,0.00017425667,0.0005894144,0.0006629853,0.00034097958],"domain_scores_gemma":[0.9697827,0.026338141,0.0008161821,0.0015859281,0.0009849252,0.0004920797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988768,0.0014607544,0.003272609,0.001937093,0.0012231884,0.0030845192,0.0041645984,0.004978633,0.0064294636],"category_scores_gemma":[0.03243135,0.0011890914,0.0012315231,0.003690163,0.0020320022,0.007311875,0.0028606348,0.0027153804,0.0009831865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037879104,0.00015430005,0.0005030975,0.000890638,0.00012375016,0.00016848704,0.00032547966,0.45920816,0.0023809536,0.44108698,0.012337052,0.08244238],"study_design_scores_gemma":[0.00008148992,0.00006535284,0.00019339121,0.0000479587,0.000041028063,0.00009014169,0.00004300401,0.6273886,0.0007169441,0.36897892,0.0023322918,0.000020889835],"about_ca_topic_score_codex":0.0014773789,"about_ca_topic_score_gemma":0.0011619112,"teacher_disagreement_score":0.0064294636,"about_ca_system_score_codex":0.0024912308,"about_ca_system_score_gemma":0.0013827981,"threshold_uncertainty_score":0.021508694},"labels":[],"label_agreement":null},{"id":"W116541839","doi":"10.1007/978-3-642-39071-5_13","title":"Exploiting the Power of mip Solvers in maxsat","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":92,"is_retracted":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":"Maximum satisfiability problem; Solver; Boolean satisfiability problem; Computer science; Satisfiability; Range (aeronautics); Mathematical optimization; Algorithm; Mathematics; Boolean function","score_opus":0.03041052690250826,"score_gpt":0.2665463862713043,"score_spread":0.23613585936879603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116541839","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.008609922,0.0020774,0.9168664,0.0018178007,0.00028713275,0.000064276974,0.00025490907,0.0018585338,0.06816369],"genre_scores_gemma":[0.26347852,0.0038113284,0.7090305,0.001255471,0.00067960244,0.00020379617,0.0008611779,0.0016926253,0.018986901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849045,0.000595006,0.00007839019,0.00020226515,0.00047778164,0.0001560711],"domain_scores_gemma":[0.9958268,0.003141946,0.00012987903,0.00065660715,0.00017332826,0.000071489325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020056493,0.0014069866,0.00087698636,0.0009902192,0.00074812456,0.0029078186,0.0022660096,0.0008579571,0.013042724],"category_scores_gemma":[0.008636466,0.0011811913,0.0015053047,0.0018223476,0.0018514856,0.0070270044,0.0037098727,0.005107316,0.0038781255],"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.00023027322,0.0000979481,0.00034096514,0.00059938664,0.000106310195,0.00015504092,0.00019861454,0.064699285,0.0060268566,0.6846311,0.017492034,0.22542222],"study_design_scores_gemma":[0.0000448892,0.000034386343,0.000093353294,0.00012410805,0.000043083437,0.000112065514,0.000038043523,0.19611351,0.00482612,0.77378887,0.024758553,0.00002304705],"about_ca_topic_score_codex":0.00094806374,"about_ca_topic_score_gemma":0.0017658091,"teacher_disagreement_score":0.013042724,"about_ca_system_score_codex":0.0008132008,"about_ca_system_score_gemma":0.0011514385,"threshold_uncertainty_score":0.04363221},"labels":[],"label_agreement":null},{"id":"W116546113","doi":"10.1007/978-3-319-07536-5_5","title":"Verifiable Multi-server Private Information Retrieval","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Server; Computer science; Verifiable secret sharing; Private information retrieval; Scheme (mathematics); Database; Outsourcing; Sublinear function; Cloud computing; Computer network; Computer security; Operating system; Mathematics; Discrete mathematics","score_opus":0.014487175205021309,"score_gpt":0.23057500325852326,"score_spread":0.21608782805350196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116546113","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.030372236,0.00211635,0.93403715,0.0023647773,0.0005666617,0.00029530484,0.00077685167,0.0055730324,0.023897571],"genre_scores_gemma":[0.82273996,0.0011242009,0.1234855,0.00091703504,0.00076598424,0.0003481964,0.001415156,0.0005935378,0.048610456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99240375,0.0015414708,0.00040021067,0.00092348113,0.0035589144,0.0011721256],"domain_scores_gemma":[0.9854299,0.004950381,0.00062173035,0.007562303,0.0011772091,0.0002584167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003562142,0.0010363178,0.0021383944,0.001159714,0.0015219041,0.004038248,0.0035958674,0.003506916,0.01082898],"category_scores_gemma":[0.010466617,0.0010885746,0.00093671697,0.0019120432,0.0025732901,0.009968518,0.0063717226,0.0051826304,0.005798732],"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.0021231011,0.0004985359,0.00090568024,0.0006766432,0.00019917014,0.00061714544,0.00044990156,0.049173776,0.04382246,0.5141271,0.035108574,0.35229796],"study_design_scores_gemma":[0.00030004082,0.00026749398,0.00076431746,0.00014392394,0.00011950289,0.001191888,0.00007660974,0.49559486,0.073018074,0.4035841,0.0248024,0.00013678383],"about_ca_topic_score_codex":0.0005391848,"about_ca_topic_score_gemma":0.0005513193,"teacher_disagreement_score":0.01082898,"about_ca_system_score_codex":0.0026042478,"about_ca_system_score_gemma":0.0023089084,"threshold_uncertainty_score":0.03622651},"labels":[],"label_agreement":null},{"id":"W1168124290","doi":"10.1007/978-3-319-20028-6_4","title":"A New Approach to the Paperfolding Sequences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Environmental Studies Association of Canada; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Computation; Function (biology); Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.03616012033275176,"score_gpt":0.25462790725618134,"score_spread":0.21846778692342958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1168124290","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.008222691,0.0010434685,0.86865705,0.0012766987,0.0022757987,0.000070962444,0.0001556836,0.000493826,0.11780389],"genre_scores_gemma":[0.17401059,0.0029225817,0.53474087,0.0017445234,0.0031825763,0.00042652464,0.0005537476,0.0013295818,0.281089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990159,0.0002827834,0.00008329888,0.00025140124,0.00029633523,0.000070283306],"domain_scores_gemma":[0.9988632,0.00037116723,0.00006153089,0.00027721256,0.00027350205,0.00015335198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918134,0.0012429648,0.00075370935,0.002449063,0.0019301515,0.0025932847,0.0017798075,0.0014590292,0.020026634],"category_scores_gemma":[0.0029762264,0.0006042456,0.0011182848,0.0018120005,0.0029972428,0.00830747,0.0033282514,0.0034401384,0.005313662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000763544,0.000009259039,0.000025604844,0.000028198952,0.0000018604974,0.000029438606,0.00013621376,0.0003389596,0.0005720235,0.97672343,0.002193605,0.019933693],"study_design_scores_gemma":[0.0000045969628,0.000016333343,0.000027228922,0.000017289163,0.000002940474,0.00011856742,0.000051901014,0.0032225954,0.00055274565,0.9600473,0.0359306,0.000007895984],"about_ca_topic_score_codex":0.00043881728,"about_ca_topic_score_gemma":0.00046309308,"teacher_disagreement_score":0.020026634,"about_ca_system_score_codex":0.00080392003,"about_ca_system_score_gemma":0.0005939688,"threshold_uncertainty_score":0.06699574},"labels":[],"label_agreement":null},{"id":"W116922995","doi":"10.1007/978-3-319-10443-0_46","title":"3D Spine Reconstruction of Postoperative Patients from Multi-level Manifold Ensembles","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","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":"Polytechnique Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"","keywords":"Manifold (fluid mechanics); Nonlinear dimensionality reduction; Manifold alignment; Artificial intelligence; Computer science; 3D reconstruction; Medicine; Computer vision; Engineering","score_opus":0.012740361255898298,"score_gpt":0.22466165004199692,"score_spread":0.21192128878609862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116922995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22769168,0.00086338184,0.7681719,0.00040448972,0.00009238716,0.000047655678,0.0005105396,0.0010467315,0.0011712562],"genre_scores_gemma":[0.8785696,0.0007320808,0.118294455,0.00009617778,0.00008997764,0.00005056283,0.0009643779,0.00021363016,0.0009890734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997378,0.00006760339,0.00001680294,0.000054420558,0.00007754618,0.000045798304],"domain_scores_gemma":[0.9996063,0.00013487188,0.000056577206,0.00007253422,0.00009487992,0.000034877787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055654196,0.0007494564,0.00087547605,0.0010290904,0.00020562689,0.0009096256,0.00069184706,0.001170787,0.0014534565],"category_scores_gemma":[0.0016330314,0.0005277983,0.0013596908,0.00073909736,0.00024603572,0.00078509445,0.0009809509,0.000983165,0.00070249406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009014042,0.00022608304,0.021109568,0.00035763194,0.00040440648,0.0012411685,0.00037846566,0.5171615,0.04579449,0.004935645,0.0057644937,0.4017251],"study_design_scores_gemma":[0.000008431421,0.000059577615,0.0031806135,0.00001992124,0.00004470109,0.00042788836,0.00005161385,0.9892482,0.0039566243,0.002426064,0.0005507462,0.000025561629],"about_ca_topic_score_codex":0.0010782629,"about_ca_topic_score_gemma":0.0016892698,"teacher_disagreement_score":0.0014534565,"about_ca_system_score_codex":0.0001791446,"about_ca_system_score_gemma":0.00044895665,"threshold_uncertainty_score":0.0048623085},"labels":[],"label_agreement":null},{"id":"W116939436","doi":"10.1007/978-3-642-37198-1_19","title":"Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Carleton University; University of Toronto","funders":"","keywords":"Crossover; Computer science; Fitness function; Genetic algorithm; Representation (politics); Cluster analysis; Operator (biology); Fitness landscape; Smoothness; Predictability; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Algorithm; Data mining; Artificial intelligence; Machine learning; Mathematics","score_opus":0.020595764676756556,"score_gpt":0.23648365873075455,"score_spread":0.215887894053998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116939436","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.9488708,0.00064311805,0.04694053,0.00022290349,0.000032015723,0.0000309368,0.00017878153,0.00023592633,0.0028450768],"genre_scores_gemma":[0.97624993,0.00022036728,0.022621324,0.000023800414,0.000009662651,0.00002027051,0.00029556986,0.000043254066,0.0005158129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964094,0.0001466374,0.000016560263,0.000060883616,0.00008897062,0.00004589022],"domain_scores_gemma":[0.99555355,0.0036584272,0.00018784688,0.00020060812,0.0003299117,0.0000695743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015329615,0.0006557373,0.00054489553,0.0011079288,0.00024406823,0.000948812,0.00072701805,0.0016110105,0.00069832883],"category_scores_gemma":[0.007487441,0.00022290912,0.00052044337,0.0014575031,0.00041628905,0.00097073644,0.0002889751,0.0008033913,0.00022169143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088583314,0.00007896432,0.004590736,0.000033538206,0.00004175263,0.000022497385,0.000018800747,0.9691619,0.0011673432,0.0009124707,0.0004335908,0.023449825],"study_design_scores_gemma":[0.0000047655967,0.000051079704,0.0015923675,0.0000036329093,0.000005530182,0.000007958998,0.000009515758,0.9970306,0.00066449365,0.0005781488,0.000047887203,0.000004019822],"about_ca_topic_score_codex":0.0055324803,"about_ca_topic_score_gemma":0.0034281618,"teacher_disagreement_score":0.0055324803,"about_ca_system_score_codex":0.00082981883,"about_ca_system_score_gemma":0.00032796274,"threshold_uncertainty_score":0.011000514},"labels":[],"label_agreement":null},{"id":"W11695991","doi":"10.1007/978-3-642-21070-9_12","title":"An Algebraic Approach to Preference Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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":"Brock University","funders":"","keywords":"Preference; Algebraic structure; Class (philosophy); Duality (order theory); Algebraic number; Computer science; Algebra over a field; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence; Statistics","score_opus":0.04178812623367741,"score_gpt":0.24609227321308771,"score_spread":0.2043041469794103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11695991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070165596,0.0029849429,0.84047866,0.0028793104,0.0006814862,0.0000770654,0.00036567365,0.00019008097,0.14532623],"genre_scores_gemma":[0.42792696,0.00948285,0.47387767,0.0012711276,0.0025980356,0.0004932176,0.0008877832,0.0002655325,0.083196774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985453,0.0004573236,0.0001550177,0.00018891173,0.00056547316,0.00008814752],"domain_scores_gemma":[0.99883145,0.0005806917,0.000078789366,0.00015595759,0.000289071,0.0000639929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014885241,0.00077101984,0.0008518634,0.0018414047,0.0017601781,0.0041398476,0.001464246,0.00089961436,0.016100125],"category_scores_gemma":[0.0032261072,0.00079187966,0.001595505,0.0037791817,0.0033978086,0.011559489,0.0020878064,0.0046016676,0.002656649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035972237,0.0000053028625,0.000012079409,0.000028316816,0.0000033193646,0.000012189588,0.00005195817,0.00032080896,0.00010670869,0.9909648,0.0009956931,0.0074952603],"study_design_scores_gemma":[0.0000051952306,0.00000653346,0.000024034625,0.000011528442,0.000005284341,0.000055266013,0.000030438705,0.0017296361,0.00010146418,0.98440254,0.013621609,0.0000064152596],"about_ca_topic_score_codex":0.0011600975,"about_ca_topic_score_gemma":0.0014313665,"teacher_disagreement_score":0.016100125,"about_ca_system_score_codex":0.0020779832,"about_ca_system_score_gemma":0.0009503297,"threshold_uncertainty_score":0.053860307},"labels":[],"label_agreement":null},{"id":"W117387719","doi":"10.1007/978-3-642-38088-4_25","title":"Formal Stability Analysis of Optical Resonators","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Photonic and Optical Devices","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Resonator; Stability (learning theory); Optics; Physics","score_opus":0.012197667036527516,"score_gpt":0.2209700431840949,"score_spread":0.20877237614756738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117387719","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.026364442,0.0018203246,0.9171803,0.0008411603,0.00026783528,0.00003970241,0.000088965775,0.00026732413,0.053129926],"genre_scores_gemma":[0.8397846,0.001977122,0.11711949,0.00028120526,0.00068770733,0.00016338797,0.00020340808,0.0003803067,0.03940277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917895,0.00023759785,0.00003533979,0.00011835388,0.00036704767,0.00006261598],"domain_scores_gemma":[0.99885595,0.0006151609,0.00011372445,0.0001114608,0.0002716215,0.000032101812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104828,0.00064424844,0.00047643163,0.0010466549,0.00060934096,0.001588334,0.0008480743,0.0005896498,0.004585905],"category_scores_gemma":[0.002511479,0.00037631704,0.00076968747,0.0004005784,0.0020723182,0.0016572288,0.00094627606,0.0013996796,0.00082305586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022400442,0.000015156348,0.00006451386,0.000051430317,0.000009952468,0.000037040867,0.00012695242,0.010955668,0.0049523395,0.97038996,0.0010578363,0.012316797],"study_design_scores_gemma":[0.000009407637,0.000016799771,0.000076745666,0.000021024143,0.0000064163683,0.000047031637,0.000035713747,0.080658,0.0025234905,0.9115175,0.0050748386,0.000013009669],"about_ca_topic_score_codex":0.0006190968,"about_ca_topic_score_gemma":0.00044754596,"teacher_disagreement_score":0.004585905,"about_ca_system_score_codex":0.0012272508,"about_ca_system_score_gemma":0.0005121629,"threshold_uncertainty_score":0.0153413415},"labels":[],"label_agreement":null},{"id":"W1174219372","doi":"10.1007/978-3-319-21500-6_15","title":"Unary Patterns with Permutations","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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 Winnipeg","funders":"","keywords":"Unary operation; Combinatorics; Sigma; Mathematics; Alphabet; Integer (computer science); Pi; Word (group theory); Function (biology); Discrete mathematics; Physics; Computer science; Geometry; Genetics; Philosophy; Biology","score_opus":0.021343112257833988,"score_gpt":0.25421918387509906,"score_spread":0.2328760716172651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1174219372","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019608513,0.0032343818,0.47661576,0.001770506,0.0023438623,0.00018906499,0.0009335634,0.001247951,0.49405625],"genre_scores_gemma":[0.31372416,0.00476433,0.30346566,0.0013692016,0.0014584347,0.0006004011,0.0021236723,0.001527508,0.37096667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990934,0.00018219296,0.000089832894,0.00025210506,0.00026405192,0.00011848695],"domain_scores_gemma":[0.9994367,0.00015777689,0.00004346982,0.00024739263,0.00008279956,0.00003188997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932473,0.0009772344,0.00081710663,0.001124088,0.0013081952,0.0032702861,0.0011340193,0.0009550724,0.028902918],"category_scores_gemma":[0.0024501034,0.000606946,0.0009119831,0.0023228156,0.0020044767,0.006317315,0.002228641,0.0021930346,0.011327475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002606103,0.000013309136,0.000050328705,0.00009615416,0.0000062199924,0.0000707602,0.00013375118,0.0004690921,0.00089972484,0.89225227,0.009248413,0.096733905],"study_design_scores_gemma":[0.0000050965014,0.000013559444,0.000042242722,0.000032026972,0.0000059721183,0.00022423208,0.00003313924,0.0010723929,0.0010438983,0.9314949,0.06602311,0.000009475926],"about_ca_topic_score_codex":0.00032039543,"about_ca_topic_score_gemma":0.00038093803,"teacher_disagreement_score":0.028902918,"about_ca_system_score_codex":0.0006636822,"about_ca_system_score_gemma":0.00058022304,"threshold_uncertainty_score":0.09668988},"labels":[],"label_agreement":null},{"id":"W1175378140","doi":"10.1007/978-3-642-39088-3_13","title":"A Formal Diagrammatic Approach to Compensable Workflow Modelling","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Executable; Workflow; Diagrammatic reasoning; Software engineering; Programming language; Semantics (computer science); Model-driven architecture; Process (computing); Business process; Compensation (psychology); Formal specification; Software development; Software; Work in process; Database","score_opus":0.027919254174237518,"score_gpt":0.2096358924047797,"score_spread":0.18171663823054218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1175378140","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.00049662247,0.00011093298,0.9963421,0.00016168063,0.000035692476,0.00005144139,0.00007067447,0.00040679792,0.0023241204],"genre_scores_gemma":[0.048019182,0.0005195581,0.9453479,0.00016111422,0.00006840116,0.00029722994,0.00045398247,0.00029673174,0.0048358752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980653,0.00067669485,0.00027924505,0.0002908159,0.0005624532,0.00012556145],"domain_scores_gemma":[0.99727446,0.0013919187,0.00015900448,0.00060239196,0.0004877828,0.00008446855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029022458,0.00096311275,0.0007227293,0.0016172142,0.0011054598,0.0037998867,0.0032847747,0.001892877,0.008239121],"category_scores_gemma":[0.0060148146,0.0010800193,0.0020776826,0.002011521,0.002848593,0.0053888825,0.001975852,0.003756033,0.0018066845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020597778,0.000036513968,0.000079481244,0.00015579983,0.000012696883,0.00013260849,0.00036088878,0.0154452985,0.001521773,0.953606,0.0016753821,0.026952924],"study_design_scores_gemma":[0.000038070822,0.000030830284,0.000057194426,0.00011292122,0.000037917664,0.00014856427,0.000071930175,0.11563906,0.0029872889,0.821771,0.059073333,0.000031828724],"about_ca_topic_score_codex":0.0060191266,"about_ca_topic_score_gemma":0.004340327,"teacher_disagreement_score":0.008239121,"about_ca_system_score_codex":0.0025126226,"about_ca_system_score_gemma":0.002785414,"threshold_uncertainty_score":0.027562618},"labels":[],"label_agreement":null},{"id":"W1176608300","doi":"10.1007/978-3-319-21470-2_11","title":"GIS-Based Multi-criteria Decision Analysis for the “Highway in the Sky”","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Land Use and Ecosystem Services","field":"Environmental Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; National Physical Laboratory; Universitat Politècnica de València; Fundação para a Ciência e a Tecnologia; University of California, Davis; National Supercomputing Centre Singapore; Centro Svizzero di Calcolo Scientifico; Universidad Autónoma de Sinaloa; Lovely Professional University; Szegedi Tudományegyetem; Universitas Teknologi Yogyakarta; Universitat Autònoma de Barcelona; Università degli Studi di Perugia; Universidade Federal do Rio de Janeiro; Universidade Federal do Rio Grande do Norte; Nanjing University of Information Science and Technology; Universidad de Valladolid; Università di Pisa; Universidade do Porto; Università degli Studi di Milano-Bicocca; Yildiz Teknik Üniversitesi; University of Delhi; Universidad del Atlántico; University of Tsukuba; Universidad de Málaga; Universität Zürich; Universidad de Cantabria; Université Pierre et Marie Curie; Universidad de Alcalá; Università degli Studi dell'Aquila; Politechnika Wrocławska; Universidade Nova de Lisboa; University College Dublin; Institut National de Recherche en Sciences et Technologies pour l'Environnement et l'Agriculture; Universidade de Coimbra; Universidade de Lisboa; Universität Hamburg; Uniwersytet Łódzki; Universidade Tecnológica Federal do Paraná; Università degli Studi di Parma; Universidade de São Paulo; Indian Statistical Institute; Universiti Teknologi Malaysia; Jeju National University; International Islamic University Malaysia; Universitat de Barcelona; Centre National de la Recherche Scientifique; Nanjing University; Universidad Politécnica de Madrid; Kuwait University; Silesian University of Technology; Hannam University; Waseda University; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; American University in Cairo; Saint Petersburg State University; Università degli Studi della Basilicata; Monash University; Universitat Rovira i Virgili; KU Leuven; Akademie Věd České Republiky; Catholic University of Daegu; Qassim University; Universidade do Estado do Rio de Janeiro; Wonkwang University; Universitat de Girona; Korea Polytechnic University; Université du Luxembourg; Hong Kong Baptist University; Kunsan National University; University of Twente; Universiteit van Amsterdam; École Polytechnique Fédérale de Lausanne; Centro Universitario de la Defensa de Zaragoza; Università degli Studi Mediterranea di Reggio Calabria; Covenant University; Amirkabir University of Technology; University of Windsor; Universitat Politècnica de Catalunya; Indian Institute of Technology Kanpur; Università degli Studi di Salerno; London South Bank University; La Trobe University; Universita degli Studi di Bari Aldo Moro; European Commission; Wageningen University and Research; University of Leeds; Universidad de Oriente; Universidade Federal de Pernambuco; Liverpool John Moores University; Università degli Studi di Messina; Universität Siegen; Universidade Federal do ABC; Università degli Studi di Sassari; Universidad de Cuenca; Curtin University of Technology; Florida Atlantic University; Deakin University; Ege Üniversitesi; CERN; Universidade do Minho; Università degli Studi di Cagliari; Islamic Azad University; East China Normal University; Qazvin Islamic Azad University; Iran University of Science and Technology; Agenzia Nazionale per le Nuove Tecnologie, l'Energia e lo Sviluppo Economico Sostenibile; University of Bradford; University of Oklahoma; Yonsei University; University of Connecticut; Pennsylvania State University; Západočeská Univerzita v Plzni; Université Laval; University of Macedonia; Universidade de Aveiro; Sungkyunkwan University; Università degli Studi di Napoli Federico II; Universidade Estadual de Campinas; Universiti Tun Hussein Onn Malaysia; University of Canterbury","keywords":"Minor (academic); Computer science; TRIPS architecture; Geographic information system; Multiple-criteria decision analysis; Operations research; Transport engineering; Position (finance); Decision support system; Geography; Data mining; Remote sensing; Engineering; Business","score_opus":0.03392344395153645,"score_gpt":0.2780260269682646,"score_spread":0.24410258301672816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1176608300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039064404,0.0007182043,0.9524958,0.0003323495,0.00010187512,0.00020933861,0.0007162125,0.00068733096,0.0056743943],"genre_scores_gemma":[0.45215333,0.00055063755,0.5409391,0.0001206628,0.00006216985,0.0005100672,0.001066765,0.00016305526,0.0044341427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895847,0.0005307778,0.000056492787,0.00015109662,0.00021896341,0.000084253676],"domain_scores_gemma":[0.99796104,0.0015827575,0.000062815336,0.000045551624,0.00028234665,0.00006549545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022766364,0.0014805659,0.0018895116,0.0021175002,0.0007248413,0.002055116,0.0015697553,0.0014237217,0.007845749],"category_scores_gemma":[0.003222319,0.0007473304,0.0021750045,0.0018462085,0.0005428856,0.0013407354,0.0012633752,0.0012358327,0.0005852632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001420823,0.00011598244,0.0009407538,0.0002828828,0.00012933409,0.00013374219,0.00011479662,0.8955407,0.0012050763,0.0072710486,0.003289957,0.090833604],"study_design_scores_gemma":[0.0000065908707,0.000035712437,0.00023516547,0.000015425461,0.000013901552,0.000014354438,0.000041723968,0.9943699,0.00023439436,0.0044219713,0.00060085324,0.000009954926],"about_ca_topic_score_codex":0.021833705,"about_ca_topic_score_gemma":0.020136544,"teacher_disagreement_score":0.021833705,"about_ca_system_score_codex":0.0020557812,"about_ca_system_score_gemma":0.001894162,"threshold_uncertainty_score":0.04341328},"labels":[],"label_agreement":null},{"id":"W117857050","doi":"10.1007/978-3-319-07959-2_3","title":"Integral Simplex Using Decomposition with Primal Cuts","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Simplex; Decomposition; Simplex algorithm; Mathematical optimization; Algorithm; Mathematics; Combinatorics; Linear programming","score_opus":0.018203717994505042,"score_gpt":0.27100906210388837,"score_spread":0.2528053441093833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117857050","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.0013588949,0.00023835622,0.9896515,0.000041623316,0.0000871562,0.000025133466,0.000050199884,0.00023453176,0.00831251],"genre_scores_gemma":[0.048337396,0.00063822727,0.9376974,0.00006301504,0.00009440176,0.00015577555,0.00025212098,0.0009864968,0.011775202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991722,0.0002089099,0.00003545818,0.00011367337,0.000410786,0.000058955364],"domain_scores_gemma":[0.999342,0.00031946565,0.000030608055,0.00013235793,0.00012716194,0.000048455193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444826,0.001455672,0.0017915724,0.0016790177,0.00055349566,0.0028768335,0.0019130026,0.0012295077,0.0143467095],"category_scores_gemma":[0.0033201203,0.0012961476,0.0014266452,0.0017769389,0.0011581541,0.0020957761,0.0038279896,0.004974482,0.004222072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018856094,0.00011955137,0.00019463984,0.0005399405,0.00009373149,0.00008837319,0.00015583873,0.15654074,0.0062006908,0.4598737,0.014733783,0.3612705],"study_design_scores_gemma":[0.0000409593,0.00004323706,0.000075928576,0.00009651086,0.000035745925,0.00015844354,0.000041062514,0.69707364,0.003232464,0.2775074,0.021671355,0.00002329079],"about_ca_topic_score_codex":0.00074267626,"about_ca_topic_score_gemma":0.0008940119,"teacher_disagreement_score":0.0143467095,"about_ca_system_score_codex":0.0007601333,"about_ca_system_score_gemma":0.00068113935,"threshold_uncertainty_score":0.047994554},"labels":[],"label_agreement":null},{"id":"W117901136","doi":"10.1007/978-3-642-39212-2_49","title":"Learning a Ring Cheaply and Fast","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Ring (chemistry); Node (physics); Task (project management); Upper and lower bounds; Matching (statistics); Constant (computer programming); Computation; Class (philosophy); Time complexity; Construct (python library); Theoretical computer science; Algorithm; Discrete mathematics; Combinatorics; Mathematics; Computer network; Artificial intelligence","score_opus":0.01626947040187827,"score_gpt":0.2388798637032399,"score_spread":0.22261039330136165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117901136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041699436,0.0012835317,0.902879,0.0028330607,0.00059375004,0.0001804994,0.0005565346,0.005001699,0.04497245],"genre_scores_gemma":[0.35981378,0.0017936154,0.542238,0.000917677,0.00073979935,0.00038587552,0.0012320409,0.0015141477,0.09136511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898297,0.00021317301,0.000057923364,0.00029523636,0.00030388252,0.00014684403],"domain_scores_gemma":[0.9958234,0.0022808113,0.00021659533,0.0011985357,0.00027649885,0.00020414131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013266766,0.0011171934,0.001391631,0.0006451197,0.0009249908,0.0021266583,0.0017826918,0.0014690169,0.023145577],"category_scores_gemma":[0.008807762,0.00070831977,0.0009748297,0.0007215999,0.0013728988,0.0076724063,0.0031887796,0.0032821952,0.0069855503],"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.0005940907,0.00022040849,0.00096511364,0.00060464453,0.00010477628,0.00010807461,0.00017283915,0.0733639,0.00782263,0.32181814,0.059819993,0.53440547],"study_design_scores_gemma":[0.00014060155,0.00022827499,0.0003470658,0.00010323502,0.000082493636,0.00029105114,0.00013341372,0.2575371,0.0068061436,0.70200527,0.032279618,0.00004576284],"about_ca_topic_score_codex":0.0005065777,"about_ca_topic_score_gemma":0.0010622143,"teacher_disagreement_score":0.023145577,"about_ca_system_score_codex":0.00071678514,"about_ca_system_score_gemma":0.0012088277,"threshold_uncertainty_score":0.07742971},"labels":[],"label_agreement":null},{"id":"W118321044","doi":"10.1007/978-3-642-40477-1_22","title":"Video Navigation with a Personal Viewing History","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interface (matter); Popularity; Multimedia; Video processing; Turn-by-turn navigation; Video editing; Human–computer interaction; World Wide Web; Artificial intelligence; Psychology","score_opus":0.015885241012070582,"score_gpt":0.21004947457934886,"score_spread":0.19416423356727827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118321044","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.007112491,0.010569879,0.2617831,0.0014378537,0.0035649654,0.00032428518,0.0039835162,0.02124945,0.6899744],"genre_scores_gemma":[0.050990336,0.009303359,0.10501322,0.00086772675,0.0022244586,0.00021948002,0.0059170243,0.004247282,0.8212172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989676,0.000012567068,0.0000055835953,0.000029437666,0.000042906206,0.000012670985],"domain_scores_gemma":[0.9996238,0.00007348611,0.000013860561,0.00008083349,0.0001492637,0.000058786023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023060541,0.00082851684,0.00035508082,0.0015601729,0.000566839,0.0012965192,0.00070160755,0.00088619743,0.20223159],"category_scores_gemma":[0.0009089174,0.00028099134,0.00038550055,0.002026603,0.0002423465,0.0020615375,0.0010330151,0.0007063006,0.074884064],"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.00015434458,0.000040319137,0.00021693666,0.00034779534,0.000009645855,0.00019241603,0.00025578067,0.0004015172,0.010174491,0.008098141,0.26696953,0.713139],"study_design_scores_gemma":[0.000013880511,0.00008116063,0.0008250224,0.0002611528,0.000026771746,0.00077788247,0.00013436303,0.002349452,0.004349725,0.0028354195,0.98832,0.000025258902],"about_ca_topic_score_codex":0.0017759275,"about_ca_topic_score_gemma":0.0032373215,"teacher_disagreement_score":0.20223159,"about_ca_system_score_codex":0.00026268023,"about_ca_system_score_gemma":0.00033927092,"threshold_uncertainty_score":0.67653203},"labels":[],"label_agreement":null},{"id":"W11835814","doi":"10.1007/978-3-540-72606-7_46","title":"Impact of Technology Overlap in Next-Generation Wireless Heterogeneous Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IPv6, Mobility, Handover, Networks, Security","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":"Bell (Canada); University of Toronto","funders":"","keywords":"Computer science; Session (web analytics); Handover; Computer network; Underlay; Wireless; Distributed computing; Wireless network; Telecommunications","score_opus":0.023924990240618497,"score_gpt":0.2509683336722038,"score_spread":0.22704334343158528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11835814","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.9007017,0.0039541265,0.03618126,0.0013709085,0.00019225136,0.000032232037,0.00014445838,0.00017664369,0.057246312],"genre_scores_gemma":[0.99690056,0.0005237381,0.0011249151,0.00005024106,0.00006450882,0.000007566387,0.000043806533,0.00002080684,0.0012639066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982284,0.0005115316,0.000043163986,0.00014290506,0.0005223607,0.0005516503],"domain_scores_gemma":[0.9895085,0.007768599,0.00055058306,0.00058864616,0.0010834606,0.0005001457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016150476,0.0006364823,0.0007010795,0.0007760966,0.0015356775,0.0025178757,0.0008128839,0.0010557304,0.0052273837],"category_scores_gemma":[0.010833859,0.00041875817,0.00033955646,0.0014689015,0.0012867147,0.0062041664,0.004069867,0.0010077553,0.00064685335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033042969,0.0006519019,0.04507583,0.00039859768,0.00024271903,0.0046147234,0.002543834,0.5042692,0.031166516,0.15354152,0.006496289,0.24769455],"study_design_scores_gemma":[0.00024089654,0.001812642,0.05039783,0.00023785251,0.00076455926,0.0061462633,0.012794855,0.65172935,0.028491983,0.21172272,0.03544401,0.00021700267],"about_ca_topic_score_codex":0.0021560756,"about_ca_topic_score_gemma":0.001894073,"teacher_disagreement_score":0.0052273837,"about_ca_system_score_codex":0.0013438968,"about_ca_system_score_gemma":0.00072745746,"threshold_uncertainty_score":0.017487347},"labels":[],"label_agreement":null},{"id":"W118363595","doi":"10.1007/978-3-642-42001-6_5","title":"Shorter Compact Representations in Real Quadratic Fields","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Logarithm; Quadratic equation; Ideal class group; Computer science; Algebraic number; Representation (politics); Polynomial; Algebra over a field; Class (philosophy); Ideal (ethics); Group (periodic table); Unit (ring theory); Algebraic number field; Theoretical computer science; Discrete mathematics; Mathematics; Pure mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.02024526855554348,"score_gpt":0.2715899130760348,"score_spread":0.2513446445204913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118363595","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34529644,0.022698037,0.23884435,0.0054730396,0.0038851362,0.00011933731,0.00074008637,0.0011557488,0.38178787],"genre_scores_gemma":[0.7181466,0.008760888,0.051701963,0.0010933663,0.0031668406,0.00012653592,0.0008161258,0.0007961588,0.21539146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959904,0.00010415895,0.000022467382,0.000054995475,0.00016707739,0.000052226773],"domain_scores_gemma":[0.9993436,0.00022727699,0.00011664225,0.00013113316,0.000103778395,0.00007757699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068600435,0.00068462954,0.00053649826,0.0014273647,0.0006723647,0.0016780581,0.0006376067,0.00065573165,0.014656243],"category_scores_gemma":[0.0016951133,0.00030876315,0.00031937953,0.0015902816,0.0012731937,0.004115216,0.0010283211,0.0020046874,0.0028320139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066225366,0.000038922528,0.000055960365,0.00010055983,0.000005347131,0.00004384001,0.00028802123,0.00075067463,0.0027059761,0.94254947,0.006561406,0.046833742],"study_design_scores_gemma":[0.00003165995,0.00007904649,0.00020493621,0.00004337732,0.000008140785,0.00016689884,0.00009009289,0.0023392444,0.0010440813,0.9532193,0.04275478,0.000018472565],"about_ca_topic_score_codex":0.00021693422,"about_ca_topic_score_gemma":0.00027080273,"teacher_disagreement_score":0.014656243,"about_ca_system_score_codex":0.0007466521,"about_ca_system_score_gemma":0.00027079007,"threshold_uncertainty_score":0.049030006},"labels":[],"label_agreement":null},{"id":"W11851375","doi":"10.1007/978-3-319-10596-3_6","title":"WGB: Towards a Universal Graph Benchmark","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Graph; Theoretical computer science; Graph database; RDF; Benchmark (surveying); Database; Artificial intelligence; Semantic Web","score_opus":0.009328611411771322,"score_gpt":0.21340468001322607,"score_spread":0.20407606860145475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11851375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15185544,0.0073427847,0.47345695,0.012721834,0.0062456597,0.0010567328,0.036511913,0.06525137,0.24555734],"genre_scores_gemma":[0.43879902,0.0018664808,0.43239474,0.003981123,0.00070216804,0.0011603542,0.06887587,0.01655069,0.035669494],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580896,0.0013534302,0.00022834998,0.00085188955,0.0011904837,0.00056680525],"domain_scores_gemma":[0.9937202,0.0018641982,0.00021473032,0.0024463397,0.0011522523,0.00060230156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036169875,0.0019115136,0.0013715866,0.0027552184,0.0017666699,0.0034015763,0.005955392,0.0027343805,0.016972274],"category_scores_gemma":[0.015601923,0.00072485476,0.001044078,0.0038540105,0.0018061135,0.006228023,0.0051759034,0.0032631736,0.0055198153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001162249,0.00074385916,0.0021477567,0.0016826078,0.00018484406,0.00016727226,0.00019848089,0.07550251,0.0077209934,0.20991021,0.4741463,0.22643292],"study_design_scores_gemma":[0.0003371987,0.00041766386,0.0014919166,0.000434698,0.00012623306,0.0002467682,0.00034302022,0.25982046,0.015291265,0.5478974,0.17351893,0.00007441858],"about_ca_topic_score_codex":0.0049344744,"about_ca_topic_score_gemma":0.0075719105,"teacher_disagreement_score":0.016972274,"about_ca_system_score_codex":0.0019238978,"about_ca_system_score_gemma":0.0022916705,"threshold_uncertainty_score":0.056777894},"labels":[],"label_agreement":null},{"id":"W118656041","doi":"10.1007/978-3-540-89378-3_43","title":"An AI-Based Causal Strategy for Securing Statistical Databases Using Micro-aggregation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Artificial intelligence; Data mining; Data science","score_opus":0.06983215572881918,"score_gpt":0.3273877880077267,"score_spread":0.25755563227890754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118656041","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.004109217,0.00012240888,0.9940163,0.00025794617,0.000043590902,0.000045018394,0.00003795581,0.00025051626,0.0011170924],"genre_scores_gemma":[0.52071095,0.0003213247,0.47490054,0.00040203182,0.00025615317,0.00021557213,0.00018595498,0.000071074785,0.0029363236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951515,0.0018714636,0.00043655338,0.000795644,0.0014668086,0.00027798195],"domain_scores_gemma":[0.9810017,0.011854191,0.001119598,0.0038646492,0.0017040927,0.00045571994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005450086,0.00071204314,0.0013543396,0.0015922064,0.0012374158,0.0031184724,0.002403053,0.0013670503,0.0020093292],"category_scores_gemma":[0.018480873,0.0005752915,0.001269789,0.0017792688,0.00255104,0.0042257505,0.0032111302,0.002535731,0.0004675575],"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.00039565665,0.00017869718,0.0023006888,0.00020616935,0.00021988705,0.0003391638,0.0004914873,0.1164588,0.009978813,0.70913875,0.0040228595,0.15626898],"study_design_scores_gemma":[0.00002334673,0.00006396355,0.00021771852,0.000015454429,0.000039357936,0.00012463237,0.000044742847,0.7901489,0.0029714229,0.2047929,0.0015333117,0.000024229115],"about_ca_topic_score_codex":0.0018577573,"about_ca_topic_score_gemma":0.0020539986,"teacher_disagreement_score":0.005450086,"about_ca_system_score_codex":0.0014545296,"about_ca_system_score_gemma":0.002327178,"threshold_uncertainty_score":0.028823137},"labels":[],"label_agreement":null},{"id":"W118795310","doi":"10.1007/978-3-642-04135-8_1","title":"Not-So Hidden Information:","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adversary; Computer science; Voting; Set (abstract data type); Computer security; Payment; Coercion (linguistics); Population; World Wide Web","score_opus":0.010982661882364344,"score_gpt":0.22483924671097225,"score_spread":0.2138565848286079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118795310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0327673,0.0070282132,0.6513669,0.021685231,0.0030453256,0.000081601574,0.00045921624,0.0008944203,0.28267184],"genre_scores_gemma":[0.8253056,0.0051743467,0.058587156,0.0026307101,0.002428799,0.00012799329,0.0004333088,0.0005971028,0.104715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998126,0.0005389077,0.00007582572,0.00029636873,0.0007048565,0.00025804914],"domain_scores_gemma":[0.9928733,0.0037043754,0.00037318558,0.0021023997,0.000674213,0.00027259506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021514138,0.00059511483,0.0008272251,0.00093819643,0.0017256982,0.0039595966,0.0015330878,0.0020990088,0.010735693],"category_scores_gemma":[0.013007567,0.00058754097,0.00066437165,0.0014090677,0.005807436,0.013717714,0.0034976434,0.004664784,0.0025271284],"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.00006674851,0.000020552901,0.00017198002,0.00005433259,0.000010668624,0.00006361077,0.00020396896,0.0018669076,0.0003737003,0.95435655,0.008642341,0.034168627],"study_design_scores_gemma":[0.0000055924934,0.000008112623,0.000057703408,0.000026986661,0.00000967902,0.00009278962,0.000038108465,0.007321149,0.000501597,0.98154575,0.010382583,0.000009956918],"about_ca_topic_score_codex":0.00067104725,"about_ca_topic_score_gemma":0.00063090905,"teacher_disagreement_score":0.010735693,"about_ca_system_score_codex":0.0012438945,"about_ca_system_score_gemma":0.0011734471,"threshold_uncertainty_score":0.03591448},"labels":[],"label_agreement":null},{"id":"W118910867","doi":"10.1007/978-3-642-40811-3_58","title":"Segmentation of Cells with Partial Occlusion and Part Configuration Constraint Using Evolutionary Computation","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Computation; Evolutionary computation; Segmentation; Artificial intelligence; Algorithm; Geometry; Mathematics","score_opus":0.014253024818479565,"score_gpt":0.2681570906929637,"score_spread":0.2539040658744841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118910867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05027199,0.00013320654,0.94754446,0.00005930072,0.000031628828,0.00006569522,0.00005145944,0.00040720872,0.0014349736],"genre_scores_gemma":[0.33634368,0.00011944283,0.6601283,0.00006897227,0.000028914648,0.0001467584,0.00030010403,0.00033304133,0.0025307557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994962,0.00006343618,0.000029646822,0.00014850183,0.00017631213,0.000085796564],"domain_scores_gemma":[0.9992555,0.0003289638,0.000057780526,0.00012566334,0.00018114012,0.00005093194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071616616,0.0008960693,0.0018902734,0.0015845055,0.00081068656,0.0015862483,0.0016479519,0.0018438463,0.0022327937],"category_scores_gemma":[0.0018295296,0.0011321041,0.0015099512,0.0018727116,0.00091635424,0.00088337995,0.0011277067,0.00070737937,0.00043113742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034698826,0.00011226655,0.0020056064,0.00017434178,0.00011857145,0.00043917258,0.00042979114,0.65257084,0.06715689,0.009171528,0.0018306695,0.2656434],"study_design_scores_gemma":[0.000008786402,0.000021170212,0.0002645902,0.000007789631,0.000018608673,0.000037894664,0.000023044437,0.9922891,0.004482033,0.0022484353,0.0005906649,0.000007803088],"about_ca_topic_score_codex":0.0070350645,"about_ca_topic_score_gemma":0.008452374,"teacher_disagreement_score":0.0070350645,"about_ca_system_score_codex":0.00093217357,"about_ca_system_score_gemma":0.0015313354,"threshold_uncertainty_score":0.013988256},"labels":[],"label_agreement":null},{"id":"W118997998","doi":"10.1007/978-3-642-23629-7_68","title":"Random Walks for Deformable Image Registration","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Image registration; Random walk; Computer vision; Artificial intelligence; Computer graphics (images); Image (mathematics); Mathematics; Statistics","score_opus":0.02408593641414553,"score_gpt":0.2815436391959181,"score_spread":0.2574577027817726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118997998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040944857,0.00037593182,0.9943228,0.00013519998,0.000040472056,0.000025525871,0.00005761952,0.0004421473,0.00050581706],"genre_scores_gemma":[0.3423802,0.0019404026,0.6295239,0.00038776826,0.00030161356,0.0004095733,0.0012269652,0.0013665893,0.022462917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887913,0.00042305564,0.0000661859,0.00028181297,0.0002704489,0.000079418685],"domain_scores_gemma":[0.99597627,0.0026843452,0.00036805862,0.0005054256,0.00028435778,0.000181571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015102589,0.0009183909,0.0019206017,0.0027125143,0.00074820477,0.0013335706,0.0020667247,0.0029486022,0.004424295],"category_scores_gemma":[0.007604041,0.0013927937,0.0017026091,0.00219061,0.0016492804,0.0024104237,0.0025680023,0.0024829817,0.0016316616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021937262,0.0001167829,0.0006941673,0.00021386395,0.00017535522,0.00024695852,0.00012381263,0.5896733,0.007849303,0.2671636,0.004710247,0.12881331],"study_design_scores_gemma":[0.000010634461,0.000011856247,0.000098655786,0.000007774212,0.000007604036,0.000028916642,0.000004524816,0.9308655,0.000418772,0.06763444,0.0008984378,0.000012942131],"about_ca_topic_score_codex":0.0054117073,"about_ca_topic_score_gemma":0.006365148,"teacher_disagreement_score":0.0054117073,"about_ca_system_score_codex":0.0010719912,"about_ca_system_score_gemma":0.0006729651,"threshold_uncertainty_score":0.014800787},"labels":[],"label_agreement":null},{"id":"W119215678","doi":"10.1007/978-3-642-30353-1_17","title":"Image Morphing: Transfer Learning between Tasks That Have Multiple Outputs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Acadia University","funders":"","keywords":"Computer science; Transfer of learning; Morphing; Artificial intelligence; Task (project management); Artificial neural network; Machine learning; Context (archaeology); Multiplicative function; Multi-task learning; Transformation (genetics); Domain (mathematical analysis); Image (mathematics); Inductive transfer; Pattern recognition (psychology); Mathematics","score_opus":0.03987737130813371,"score_gpt":0.257223916041184,"score_spread":0.2173465447330503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119215678","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.010694815,0.00031464983,0.981047,0.00012852791,0.00009580239,0.00009208262,0.00012421586,0.0056434567,0.0018595357],"genre_scores_gemma":[0.24730383,0.00048304812,0.7363895,0.00036609458,0.00012670727,0.00030929968,0.0012678282,0.0011179884,0.012635649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.00008637521,0.000016494449,0.00016451474,0.0000685602,0.000040916835],"domain_scores_gemma":[0.9994153,0.00024525294,0.000026782882,0.00020552833,0.000068026784,0.000039079285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010691177,0.0010723844,0.0009105821,0.0004608595,0.00025483847,0.0006712881,0.0024651273,0.0017260851,0.0060814293],"category_scores_gemma":[0.001934471,0.00052900554,0.00094882696,0.00068867503,0.0007214335,0.0022641714,0.0024606897,0.0020043708,0.0023951796],"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.0002209397,0.00024886781,0.00036897618,0.00021190781,0.00011303033,0.0001150647,0.00009021065,0.06234504,0.032692432,0.0060837255,0.010315878,0.88719386],"study_design_scores_gemma":[0.000027705915,0.00012564508,0.00057655363,0.000017761186,0.00003449955,0.0001662287,0.000038065424,0.93816376,0.02604046,0.030720105,0.0040666945,0.000022579876],"about_ca_topic_score_codex":0.0011745755,"about_ca_topic_score_gemma":0.0013174703,"teacher_disagreement_score":0.0060814293,"about_ca_system_score_codex":0.00039646274,"about_ca_system_score_gemma":0.0004428259,"threshold_uncertainty_score":0.020344436},"labels":[],"label_agreement":null},{"id":"W119341417","doi":"10.1007/978-3-642-40811-3_90","title":"Higher-Order CRF Tumor Segmentation with Discriminant Manifold Potentials","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Pattern recognition (psychology); Segmentation; Artificial intelligence; Conditional random field; Computer science; Context (archaeology); Scale-space segmentation; Image segmentation; Subspace topology; Pairwise comparison; Manifold (fluid mechanics); Discriminant; Mathematics","score_opus":0.011988847784916474,"score_gpt":0.2617474468103238,"score_spread":0.24975859902540734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119341417","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.017299203,0.00040653246,0.9777735,0.00020281642,0.000055211276,0.00004041578,0.00019475428,0.0022259653,0.0018016439],"genre_scores_gemma":[0.39207733,0.0004328271,0.59666866,0.00018885099,0.00012897483,0.00009973058,0.0011711485,0.0011863959,0.008046086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995364,0.000098274744,0.000025239668,0.00015391468,0.00011970311,0.000066419525],"domain_scores_gemma":[0.9992016,0.00028011538,0.00007861625,0.00021948904,0.00016513716,0.000055144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078133406,0.0007470958,0.0013205758,0.0011886728,0.00071968214,0.0014232912,0.001530404,0.0019774504,0.005205408],"category_scores_gemma":[0.0023183136,0.0007425188,0.0011817106,0.0013561441,0.0005231921,0.0019705512,0.0012219487,0.0017363045,0.002453133],"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.00048626427,0.00017389082,0.0015411185,0.00028348953,0.00014332762,0.00029040832,0.0001526793,0.38456258,0.045138057,0.03042307,0.011214924,0.5255901],"study_design_scores_gemma":[0.000006500611,0.000018541845,0.00022022042,0.0000072874805,0.000009586724,0.00007481406,0.000007752653,0.9862657,0.0037400892,0.008413319,0.0012270551,0.000009049216],"about_ca_topic_score_codex":0.005402166,"about_ca_topic_score_gemma":0.009948049,"teacher_disagreement_score":0.005402166,"about_ca_system_score_codex":0.00089095184,"about_ca_system_score_gemma":0.0012710503,"threshold_uncertainty_score":0.017413855},"labels":[],"label_agreement":null},{"id":"W119341521","doi":"10.1007/978-3-642-40104-6_23","title":"Lift-and-Project Methods for Set Cover and Knapsack","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Knapsack problem; Cover (algebra); Set cover problem; Hierarchy; Rounding; Mathematics; Lift (data mining); Combinatorics; Approximation algorithm; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Mathematical optimization; Data mining","score_opus":0.048671866014856124,"score_gpt":0.33168279424756447,"score_spread":0.28301092823270835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119341521","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025661879,0.00039447832,0.9856559,0.00014250448,0.00017919755,0.000044253607,0.00008662073,0.0005574144,0.010373381],"genre_scores_gemma":[0.09190288,0.0011150701,0.86672103,0.00021126526,0.00047380532,0.00049120456,0.00073235,0.0020539204,0.03629846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867153,0.00034692328,0.00006311505,0.00018190876,0.00061332475,0.00012316032],"domain_scores_gemma":[0.99839896,0.00083459646,0.00006071763,0.00038450482,0.00022031937,0.00010092393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014447345,0.00195684,0.0018263847,0.002192613,0.0012128628,0.0020674525,0.0028611314,0.0016668623,0.020021023],"category_scores_gemma":[0.0062600113,0.0011256214,0.002766034,0.002407031,0.001879521,0.0038062532,0.0053656423,0.0058559286,0.0054275505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009214956,0.00012711497,0.00037543,0.00036807623,0.00008067561,0.000083939216,0.00025538495,0.05834672,0.0015567985,0.6505836,0.017748784,0.27038124],"study_design_scores_gemma":[0.000023445496,0.000036992384,0.00011205058,0.00006129182,0.000028498507,0.000067924724,0.000058109625,0.34051648,0.0009602689,0.6436427,0.014470753,0.000021441121],"about_ca_topic_score_codex":0.0023029135,"about_ca_topic_score_gemma":0.004274136,"teacher_disagreement_score":0.020021023,"about_ca_system_score_codex":0.0012466147,"about_ca_system_score_gemma":0.0012145351,"threshold_uncertainty_score":0.066976964},"labels":[],"label_agreement":null},{"id":"W119445844","doi":"10.1007/978-3-642-40273-9_17","title":"A Survey of Algorithms and Models for List Update","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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 Waterloo","funders":"","keywords":"Computer science; Locality; Locality of reference; Context (archaeology); Algorithm; Theoretical computer science; Linked list; Cache; Parallel computing","score_opus":0.04485214655756037,"score_gpt":0.27540241918750563,"score_spread":0.23055027262994526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119445844","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037867944,0.03578379,0.9380894,0.0023713182,0.0006841883,0.00021579374,0.0015808794,0.0029757675,0.014512044],"genre_scores_gemma":[0.10553217,0.055287536,0.8020252,0.0020286029,0.0033125367,0.0010580412,0.004112882,0.0017544304,0.024888562],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99620616,0.0009733187,0.0003858936,0.0008196642,0.0012923339,0.0003226338],"domain_scores_gemma":[0.99135625,0.005241713,0.00045729938,0.001896445,0.00087810226,0.00017009806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030736672,0.0018848779,0.0033823121,0.0027964104,0.0018330895,0.007003033,0.007249344,0.0028051229,0.015603784],"category_scores_gemma":[0.018493403,0.001433156,0.0024016064,0.009690911,0.0019693747,0.01219759,0.0029876886,0.004117112,0.008010315],"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.00029803382,0.00029215394,0.0011538268,0.0016000236,0.00012561707,0.00007391009,0.00023106254,0.08702898,0.0006741843,0.35893092,0.058910765,0.49068055],"study_design_scores_gemma":[0.00008459132,0.000086847285,0.00030444702,0.0003466452,0.00011954081,0.00025994558,0.00007488968,0.38590938,0.0009733449,0.55655414,0.05522116,0.00006508687],"about_ca_topic_score_codex":0.0076427455,"about_ca_topic_score_gemma":0.008140591,"teacher_disagreement_score":0.015603784,"about_ca_system_score_codex":0.0032330516,"about_ca_system_score_gemma":0.0043511284,"threshold_uncertainty_score":0.05219984},"labels":[],"label_agreement":null},{"id":"W1195044660","doi":"10.1007/978-3-319-16811-1_5","title":"A High Performance CRF Model for Clothes Parsing","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":92,"is_retracted":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":"Agence Nationale de la Recherche","keywords":"Conditional random field; Computer science; Parsing; Segmentation; Exploit; Artificial intelligence; Prior probability; Inference; Clothing; Frame (networking); Computer vision; Field (mathematics); Pattern recognition (psychology); Machine learning; Computer security; Bayesian probability; Mathematics","score_opus":0.047167342946089194,"score_gpt":0.2612575627514876,"score_spread":0.21409021980539839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1195044660","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.006431606,0.0013418322,0.8997488,0.0004412952,0.00063250156,0.00023949723,0.008281959,0.07554259,0.0073399357],"genre_scores_gemma":[0.10726,0.0011484849,0.8171461,0.000648277,0.0003438522,0.00047556683,0.036357116,0.008859232,0.02776125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.00013704921,0.000062099265,0.00044471878,0.00015949938,0.000107170374],"domain_scores_gemma":[0.9985102,0.0006048218,0.000050043884,0.00040050308,0.00034855862,0.0000860003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011384061,0.0020469811,0.0024837423,0.0015557151,0.0016364425,0.002203461,0.0044249715,0.0025179356,0.038731366],"category_scores_gemma":[0.0029401837,0.0022147463,0.0027722495,0.002842072,0.00054929405,0.0031097222,0.0021194043,0.004202643,0.028171476],"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.0006214435,0.00030984468,0.00094050803,0.00059982727,0.00027035983,0.00047849584,0.00013614006,0.10812283,0.021678178,0.011097706,0.15478031,0.70096433],"study_design_scores_gemma":[0.000057665733,0.000048230897,0.000565027,0.000060428094,0.00010410833,0.00017528524,0.00003656526,0.9488163,0.009834502,0.017004931,0.023232473,0.000064502536],"about_ca_topic_score_codex":0.02468651,"about_ca_topic_score_gemma":0.049370218,"teacher_disagreement_score":0.038731366,"about_ca_system_score_codex":0.001411709,"about_ca_system_score_gemma":0.0027991654,"threshold_uncertainty_score":0.12956935},"labels":[],"label_agreement":null},{"id":"W1195199320","doi":"10.1007/978-3-319-19488-2_4","title":"On Interval Process Semantics of Petri Nets with Inhibitor Arcs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"McMaster University","funders":"","keywords":"Petri net; Operational semantics; Semantics (computer science); Computer science; Programming language; Process architecture; Process (computing); Theoretical computer science","score_opus":0.02995477455747082,"score_gpt":0.26943024616757716,"score_spread":0.23947547161010635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1195199320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072430074,0.0010629613,0.967128,0.00027149907,0.0002223466,0.00007440657,0.00013823336,0.0003584528,0.023501128],"genre_scores_gemma":[0.3857508,0.0037069554,0.58223826,0.0006278719,0.00081049936,0.00057415705,0.0007681085,0.00075801165,0.024765259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840957,0.00041356837,0.00015534187,0.00027408422,0.00057828514,0.0001691164],"domain_scores_gemma":[0.99849916,0.0007973831,0.00013166631,0.00020361958,0.00027387938,0.000094279196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024465278,0.0013626497,0.0009130546,0.001393564,0.0010339342,0.0034046278,0.0025423851,0.0011968578,0.0050454237],"category_scores_gemma":[0.0037744576,0.00078856794,0.0019887763,0.0021634107,0.0027522682,0.0071213413,0.00193367,0.0042364406,0.001199345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031360007,0.000019608653,0.000041118456,0.00005798333,0.000007541936,0.000076855285,0.00020359801,0.007630922,0.001049545,0.9812897,0.0005329856,0.009058718],"study_design_scores_gemma":[0.000018681741,0.000026236137,0.00005135028,0.000052512347,0.000019114776,0.00006167236,0.000056404293,0.038168814,0.0008296637,0.9522608,0.008438505,0.00001631984],"about_ca_topic_score_codex":0.0027506917,"about_ca_topic_score_gemma":0.0020010704,"teacher_disagreement_score":0.0050454237,"about_ca_system_score_codex":0.0020840634,"about_ca_system_score_gemma":0.0011954159,"threshold_uncertainty_score":0.016878605},"labels":[],"label_agreement":null},{"id":"W11956422","doi":"10.1007/978-3-642-31298-4_15","title":"A Compound Eigenspace for Recognizing Directed Human Activities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Lakehead University; University of Windsor","funders":"","keywords":"Silhouette; Computer science; Artificial intelligence; Computer vision; Activity recognition; Eigenvalues and eigenvectors; Pattern recognition (psychology); Variation (astronomy); Dimensionality reduction; Displacement (psychology); Object (grammar); Process (computing); Reduction (mathematics); Mathematics","score_opus":0.039420464661296506,"score_gpt":0.27386794777971113,"score_spread":0.23444748311841462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11956422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010624725,0.0002319912,0.9864942,0.00002845403,0.000052169184,0.000044697925,0.00029855865,0.0013145078,0.00091065577],"genre_scores_gemma":[0.1178707,0.00063747045,0.87306243,0.0000858167,0.00008066194,0.00024581703,0.0018058305,0.00033040246,0.0058808667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996699,0.000049172697,0.000022599204,0.00010933541,0.00010975738,0.000039149607],"domain_scores_gemma":[0.99971503,0.00008885358,0.000017007513,0.000065991975,0.000081511906,0.000031556847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035941834,0.0008971064,0.0009069618,0.0009855884,0.00032378544,0.00072445144,0.00070008036,0.0006332597,0.0077265506],"category_scores_gemma":[0.000679519,0.00030383308,0.00067737594,0.0011328743,0.0003742904,0.001385373,0.0011536177,0.00058815314,0.003485794],"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.00040192602,0.00015259757,0.00071765814,0.00011065073,0.00006531607,0.00008312901,0.000072851515,0.012957033,0.123293065,0.0057765106,0.006145807,0.85022336],"study_design_scores_gemma":[0.000050206098,0.00038176271,0.0037856163,0.00003797744,0.00006931191,0.00084331917,0.00014926791,0.9076763,0.05492862,0.020554414,0.011451216,0.00007192124],"about_ca_topic_score_codex":0.001224206,"about_ca_topic_score_gemma":0.0017206267,"teacher_disagreement_score":0.0077265506,"about_ca_system_score_codex":0.0001724505,"about_ca_system_score_gemma":0.0004703415,"threshold_uncertainty_score":0.025847912},"labels":[],"label_agreement":null},{"id":"W119774723","doi":"10.1007/978-3-642-45043-3_8","title":"On the Parameterized Complexity of Computing Graph Bisections","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Disjoint sets; Vertex (graph theory); Combinatorics; Time complexity; Partition (number theory); Mathematics; Constant (computer programming); Graph partition; Feedback vertex set; Bisection method; Connected component; Graph; Vertex cover; Discrete mathematics; Computer science; Algorithm","score_opus":0.05961691458284554,"score_gpt":0.29979033801681515,"score_spread":0.2401734234339696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119774723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18075281,0.005889865,0.70966804,0.009740794,0.0010226154,0.00044022765,0.0034080083,0.0037336827,0.08534392],"genre_scores_gemma":[0.63138443,0.0053589595,0.31510386,0.0016210058,0.0019897413,0.0009668115,0.007393982,0.0034124032,0.032768816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939487,0.0014612374,0.0004149523,0.0013904902,0.0019881702,0.0007963559],"domain_scores_gemma":[0.96842235,0.023695707,0.0010425568,0.004783383,0.001236188,0.0008197791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028261112,0.0025279964,0.0028766694,0.0023667386,0.002473515,0.0102117285,0.006923442,0.0027868224,0.023837764],"category_scores_gemma":[0.028556364,0.0017806218,0.0036207098,0.0072152787,0.0044580936,0.028885856,0.0065459446,0.009962055,0.0034663295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001034182,0.00047388056,0.0029986412,0.0012635007,0.00024577073,0.00021730288,0.00093954516,0.115501605,0.0062684985,0.67068934,0.028697355,0.17167042],"study_design_scores_gemma":[0.000080803846,0.00005234711,0.00048376105,0.00007239971,0.00007609896,0.000117248,0.00013918805,0.108505964,0.001411944,0.8844734,0.004551077,0.000035927413],"about_ca_topic_score_codex":0.0049096155,"about_ca_topic_score_gemma":0.006309546,"teacher_disagreement_score":0.023837764,"about_ca_system_score_codex":0.0075465622,"about_ca_system_score_gemma":0.004054563,"threshold_uncertainty_score":0.07974529},"labels":[],"label_agreement":null},{"id":"W1199169209","doi":"10.1007/978-3-319-22174-8_7","title":"FHEW with Efficient Multibit Bootstrapping","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bootstrapping (finance); Computer science; Generalization; Homomorphic encryption; Scheme (mathematics); NAND gate; Theoretical computer science; Algorithm; Encryption; Parallel computing; Logic gate; Mathematics; Computer security","score_opus":0.024005236498710805,"score_gpt":0.24567374793724434,"score_spread":0.22166851143853353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1199169209","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.01249903,0.00031142423,0.9584519,0.0002741524,0.00032803626,0.00013763664,0.00024568604,0.0053253467,0.022426823],"genre_scores_gemma":[0.29043952,0.00024024435,0.6780687,0.00037455664,0.00022222858,0.00030844234,0.0007207911,0.00093547715,0.028690094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998408,0.00032039153,0.000090887515,0.00022943753,0.0006885618,0.00026275808],"domain_scores_gemma":[0.9983463,0.00036633338,0.00007448642,0.0009486689,0.00019599381,0.00006811616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008989786,0.0010164769,0.00093637296,0.0009840431,0.0008895009,0.0016815347,0.001629976,0.0012219254,0.022229712],"category_scores_gemma":[0.0041177124,0.00045361294,0.0006991816,0.0010700806,0.0008204757,0.003120253,0.004665692,0.0016389053,0.00771845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007704732,0.00019694482,0.0005845974,0.00026878325,0.000070220965,0.00031890336,0.00015406466,0.024146367,0.025486456,0.15184474,0.023328412,0.7728301],"study_design_scores_gemma":[0.00017932508,0.00031542862,0.000646378,0.00012787689,0.00008753525,0.0009916328,0.000137099,0.48958534,0.058222685,0.3703871,0.07920976,0.000109853914],"about_ca_topic_score_codex":0.00044843034,"about_ca_topic_score_gemma":0.00078219787,"teacher_disagreement_score":0.022229712,"about_ca_system_score_codex":0.00047908668,"about_ca_system_score_gemma":0.0008659319,"threshold_uncertainty_score":0.074365735},"labels":[],"label_agreement":null},{"id":"W119941826","doi":"10.1007/978-3-540-87563-5","title":"Transactions on Computational Science II","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Informatics; Software engineering; Programming language; Computational intelligence; Software development; Science and engineering; Software; Cognitive science; Theoretical computer science; Artificial intelligence; Engineering ethics","score_opus":0.019097058831980505,"score_gpt":0.2543614856299228,"score_spread":0.23526442679794227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119941826","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034996965,0.056619037,0.12097816,0.03321023,0.036718607,0.00015532778,0.0019249525,0.001094635,0.7457993],"genre_scores_gemma":[0.065441184,0.04352851,0.047779404,0.004391336,0.010032503,0.00041841334,0.0038465445,0.00097448286,0.8235876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986278,0.0003576905,0.000099975485,0.00025719908,0.0005749199,0.00008252467],"domain_scores_gemma":[0.9982565,0.0004782162,0.000044927358,0.00069270656,0.0004121874,0.00011539208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015744241,0.00096397573,0.0015957777,0.001304918,0.0010223726,0.0049764835,0.0012217078,0.0015085549,0.11673552],"category_scores_gemma":[0.004486088,0.0004684448,0.00090056553,0.002785732,0.0018809367,0.0038899088,0.0024799895,0.003033125,0.04745064],"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.000060645554,0.000054812106,0.00039435594,0.00037904954,0.000057435467,0.000058915106,0.00013516845,0.0012124259,0.00052188145,0.3182401,0.44476935,0.23411591],"study_design_scores_gemma":[0.000017398525,0.0000137228135,0.00028449539,0.00013695967,0.000027400947,0.00009021636,0.00007902495,0.0020487027,0.00022063115,0.17845432,0.81861967,0.0000073831125],"about_ca_topic_score_codex":0.0021151688,"about_ca_topic_score_gemma":0.0019065038,"teacher_disagreement_score":0.11673552,"about_ca_system_score_codex":0.0017536151,"about_ca_system_score_gemma":0.002021601,"threshold_uncertainty_score":0.3905192},"labels":[],"label_agreement":null},{"id":"W1201887517","doi":"10.1007/978-3-319-21912-7_4","title":"A Customizable Execution Engine for Models of Embedded Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Queen's University","funders":"","keywords":"Computer science; Operating system; Embedded system","score_opus":0.058477520604141305,"score_gpt":0.29561385362482534,"score_spread":0.23713633302068404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1201887517","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.0026166597,0.00009990108,0.9796296,0.000048019767,0.000049295424,0.000090102694,0.0001444425,0.015256031,0.0020660218],"genre_scores_gemma":[0.13620947,0.0006103278,0.8401022,0.00017048976,0.000053677788,0.00036838572,0.0014194533,0.0080851875,0.012980813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00018863041,0.000109064655,0.00020111723,0.00044847748,0.00009938532],"domain_scores_gemma":[0.9986771,0.00048003235,0.00007514592,0.000611398,0.00011894649,0.000037449456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015576666,0.0015591808,0.0009918067,0.0006925783,0.00040342368,0.0016199782,0.003425934,0.0013168688,0.01052407],"category_scores_gemma":[0.0032084316,0.0015258489,0.0022668734,0.0006222296,0.0010721873,0.0031414814,0.0025788087,0.0025401963,0.0029908034],"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.0006037265,0.00029819313,0.0012243069,0.001062996,0.00023862367,0.00094237586,0.0006864566,0.26500943,0.056077436,0.35391295,0.01665332,0.30329013],"study_design_scores_gemma":[0.00012024756,0.00008551105,0.00019889766,0.00017263777,0.00013252259,0.0003437299,0.000035065023,0.78418046,0.0356549,0.11655182,0.06246165,0.00006256456],"about_ca_topic_score_codex":0.0015442711,"about_ca_topic_score_gemma":0.002436801,"teacher_disagreement_score":0.01052407,"about_ca_system_score_codex":0.00064296485,"about_ca_system_score_gemma":0.0010353797,"threshold_uncertainty_score":0.035206497},"labels":[],"label_agreement":null},{"id":"W120489120","doi":"10.1007/11915034_9","title":"Scheduling of Composite Web Services","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Saskatchewan","funders":"","keywords":"Computer science; Web service; Workflow; Business Process Execution Language; Scheduling (production processes); Reuse; Software deployment; Service-oriented architecture; Distributed computing; Services computing; WS-Policy; World Wide Web; Web development; Database; Web application security; Software engineering; Engineering","score_opus":0.007371791397450066,"score_gpt":0.21946467204354522,"score_spread":0.21209288064609516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120489120","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.117830776,0.00077427016,0.85773283,0.00029333995,0.0004291012,0.00032951697,0.0003624573,0.0033027318,0.018944973],"genre_scores_gemma":[0.73825645,0.00044606702,0.24699767,0.00008668335,0.00017842537,0.00021677813,0.0009215412,0.00072713965,0.012169282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898046,0.00023317338,0.000062737425,0.00019240467,0.00032985644,0.00020129347],"domain_scores_gemma":[0.99835443,0.0006155045,0.00010025695,0.00035512258,0.0003085885,0.0002661996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016552245,0.00069557043,0.0011270001,0.00089160795,0.0012735255,0.0019771154,0.0016080468,0.00055565947,0.0056470954],"category_scores_gemma":[0.0035492696,0.0006463126,0.00061543286,0.0011558045,0.0005567083,0.0012455846,0.0010362013,0.0009108741,0.001058275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003013804,0.0006824946,0.0022734357,0.0005079498,0.000121577745,0.00041333828,0.0004411625,0.5133239,0.043801386,0.15691105,0.014964506,0.26354533],"study_design_scores_gemma":[0.0000801854,0.00012283323,0.0004964698,0.000014154658,0.000029639754,0.00006634107,0.00006465557,0.9345748,0.008200808,0.04691564,0.00941544,0.000019008357],"about_ca_topic_score_codex":0.0037343893,"about_ca_topic_score_gemma":0.0040232446,"teacher_disagreement_score":0.0056470954,"about_ca_system_score_codex":0.0014575078,"about_ca_system_score_gemma":0.0019069015,"threshold_uncertainty_score":0.018891394},"labels":[],"label_agreement":null},{"id":"W120803687","doi":"10.1007/978-3-540-93851-4","title":"Service-Oriented Computing - ICSOC 2007 Workshops","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mashup; Computer science; Service (business); Volume (thermodynamics); World Wide Web; Service-oriented architecture; Web service; Software engineering; Library science; Web 2.0","score_opus":0.009538256296586924,"score_gpt":0.24116519457582591,"score_spread":0.231626938279239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120803687","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029401425,0.024317907,0.44453445,0.0069041215,0.0306495,0.0008796884,0.0017611512,0.010138176,0.45141363],"genre_scores_gemma":[0.057283055,0.017094467,0.13770807,0.0014160117,0.0024862092,0.00041387332,0.006572076,0.0022489429,0.7747774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926883,0.0001342468,0.000031789277,0.00009573557,0.00035381704,0.00011560741],"domain_scores_gemma":[0.99915445,0.0001131428,0.000018212791,0.00015417252,0.00038656534,0.0001735216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016415133,0.0011798037,0.0011619361,0.00088890875,0.00081175065,0.002883537,0.0015117689,0.0012480529,0.039824862],"category_scores_gemma":[0.0009817156,0.0006037215,0.0009299545,0.001541526,0.00043503012,0.0016075553,0.0013065416,0.0018707882,0.027432155],"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.00037303744,0.0005530089,0.0003593756,0.00033111084,0.000042768766,0.00019073741,0.00021299106,0.0032932826,0.008720665,0.018202724,0.5283042,0.43941614],"study_design_scores_gemma":[0.000074172945,0.00026463895,0.001401948,0.0003221043,0.00006158221,0.0005176583,0.00027345694,0.024457874,0.01432155,0.016609423,0.9416523,0.000043314772],"about_ca_topic_score_codex":0.0033302184,"about_ca_topic_score_gemma":0.005571671,"teacher_disagreement_score":0.039824862,"about_ca_system_score_codex":0.0009631449,"about_ca_system_score_gemma":0.002476127,"threshold_uncertainty_score":0.13322747},"labels":[],"label_agreement":null},{"id":"W121096282","doi":"10.1007/978-3-642-21538-4_34","title":"Haptic Data Compression Based on Curve Reconstruction","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","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":"University of Ottawa","funders":"","keywords":"Haptic technology; Computer science; Quadratic equation; Curve fitting; Haptic perception; Compression (physics); Artificial intelligence; Computer vision; Mathematics; Machine learning; Geometry","score_opus":0.040520015102442596,"score_gpt":0.23721997586656265,"score_spread":0.19669996076412005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121096282","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.026591212,0.001253661,0.965417,0.00021454012,0.0002758004,0.00011507559,0.00016165392,0.0016895445,0.0042814305],"genre_scores_gemma":[0.28379625,0.0022942973,0.6991003,0.00018901068,0.00041628236,0.00014496541,0.00081373577,0.00034362872,0.012901541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999553,0.000047928617,0.000022654476,0.000046834648,0.00029415748,0.000035366444],"domain_scores_gemma":[0.9991555,0.00036938034,0.000041770327,0.00021243494,0.00019384154,0.000027093356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035771518,0.0007883711,0.00073884946,0.0012311044,0.0002993357,0.0007811863,0.0008037756,0.00068817375,0.00578925],"category_scores_gemma":[0.0016957507,0.00024794223,0.00043960256,0.0018597682,0.00047019628,0.0012309526,0.0009912295,0.0008197704,0.001252161],"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.00085333607,0.00011781644,0.00035371789,0.00028467673,0.000044967564,0.00030041355,0.00009949762,0.020093814,0.12279369,0.010690247,0.0051372233,0.8392305],"study_design_scores_gemma":[0.0001109302,0.0003292168,0.0012690703,0.00006697847,0.00006369967,0.0020215518,0.000068230234,0.75283104,0.21902524,0.008805251,0.015334162,0.00007452347],"about_ca_topic_score_codex":0.0007002765,"about_ca_topic_score_gemma":0.00050984876,"teacher_disagreement_score":0.00578925,"about_ca_system_score_codex":0.00022550447,"about_ca_system_score_gemma":0.000327431,"threshold_uncertainty_score":0.01936698},"labels":[],"label_agreement":null},{"id":"W121109830","doi":"10.1007/978-3-642-30950-2_17","title":"Exploring the Effects of Prior Video-Game Experience on Learner’s Motivation during Interactions with HeapMotiv","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Heap (data structure); Computer science; Video game; Multimedia; sort; Serious game; Human–computer interaction; Programming language; Database","score_opus":0.0565032857663976,"score_gpt":0.30611779626304114,"score_spread":0.24961451049664354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121109830","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.998486,0.000026029922,0.0003039017,0.000015173798,0.0000031376544,0.000013719985,0.00003398233,0.000015162485,0.0011028735],"genre_scores_gemma":[0.9972529,0.000039376013,0.0008866772,0.000013361645,0.0000025930042,0.00004307552,0.0000948729,0.000016345382,0.0016508268],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999537,0.00013073605,0.000025206271,0.00010153556,0.00011670878,0.00008885809],"domain_scores_gemma":[0.9953004,0.0035994723,0.00033397906,0.00010458836,0.0002416863,0.0004198054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095001236,0.0003019739,0.00027610816,0.00027119598,0.00031747067,0.0012206854,0.0005775864,0.0003457229,0.0055757225],"category_scores_gemma":[0.0067656967,0.00017303342,0.0002903136,0.00017557976,0.00021603715,0.0006785703,0.00078781,0.00058764376,0.0005356618],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013046994,0.024574142,0.41240942,0.001775316,0.0005747278,0.00079648825,0.08690091,0.0028624332,0.16445883,0.0018322087,0.0031119057,0.28765655],"study_design_scores_gemma":[0.00016410374,0.010621386,0.93394166,0.0001871266,0.00038471137,0.00030187733,0.013999534,0.007058348,0.027584534,0.0007856281,0.0048665735,0.000104519495],"about_ca_topic_score_codex":0.0012273116,"about_ca_topic_score_gemma":0.0020777667,"teacher_disagreement_score":0.0055757225,"about_ca_system_score_codex":0.00022958593,"about_ca_system_score_gemma":0.0002679867,"threshold_uncertainty_score":0.018652618},"labels":[],"label_agreement":null},{"id":"W121443288","doi":"10.1007/978-3-642-02611-9_28","title":"A New Large-Scale Multi-purpose Handwritten Farsi Database","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Spotting; Numeral system; Artificial intelligence; Speech recognition; Set (abstract data type); Natural language processing; Word (group theory); Pattern recognition (psychology); Mathematics","score_opus":0.01924858629089466,"score_gpt":0.26368769122345126,"score_spread":0.2444391049325566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121443288","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2467158,0.014944863,0.43589658,0.0009834411,0.0028066991,0.0018588797,0.15753613,0.09931832,0.039939284],"genre_scores_gemma":[0.17485934,0.0025438732,0.39586723,0.00054462784,0.0004351361,0.00070912455,0.38243103,0.0015618559,0.041047823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992879,0.00003897527,0.000083629326,0.00020579317,0.000327187,0.000056441073],"domain_scores_gemma":[0.998838,0.000072435345,0.00004463919,0.0004620881,0.00047771647,0.00010506635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000732488,0.001419883,0.0021262555,0.0033874356,0.00081266585,0.0012643334,0.0028569102,0.001090339,0.013667489],"category_scores_gemma":[0.0011529125,0.0006169609,0.00088581035,0.0026524554,0.00022142757,0.0021392615,0.0010748345,0.000830021,0.010966138],"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.0019800554,0.00080960686,0.001715289,0.000560042,0.00018938027,0.0005662349,0.0000589924,0.0048939358,0.082675345,0.00088856166,0.11773331,0.78792924],"study_design_scores_gemma":[0.0009243057,0.002623363,0.046607602,0.00029576287,0.0007162101,0.006669279,0.00040666657,0.31344876,0.28076366,0.0044288444,0.34245893,0.000656654],"about_ca_topic_score_codex":0.00692476,"about_ca_topic_score_gemma":0.010606161,"teacher_disagreement_score":0.013667489,"about_ca_system_score_codex":0.0003970208,"about_ca_system_score_gemma":0.00090468116,"threshold_uncertainty_score":0.045722306},"labels":[],"label_agreement":null},{"id":"W12156430","doi":"10.1007/978-3-642-02611-9_53","title":"Face Recognition Based on Wavelet-Curvelet-Fractal Technique","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Curvelet; Wavelet; Artificial intelligence; Pattern recognition (psychology); Computer science; Facial recognition system; Fractal; Classifier (UML); Face (sociological concept); Diagonal; Euclidean distance; Euclidean geometry; Computer vision; Wavelet transform; Mathematics; Geometry","score_opus":0.01882467052748733,"score_gpt":0.24301736739823226,"score_spread":0.22419269687074495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12156430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07913265,0.0015493723,0.91269124,0.00014018621,0.00019868992,0.000038327624,0.000088234825,0.00098447,0.005176897],"genre_scores_gemma":[0.41957042,0.002396674,0.56727004,0.0001228051,0.00019650014,0.00005867009,0.00030695493,0.00009755235,0.009980486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987125,0.000013105701,0.0000055654145,0.000024967878,0.000069644855,0.000015471684],"domain_scores_gemma":[0.9998354,0.000057120127,0.000012473844,0.000022355276,0.000063809064,0.000008818403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001867813,0.00023512013,0.0005440574,0.00058991654,0.0001491381,0.00031859704,0.00034249842,0.00047767465,0.0017599259],"category_scores_gemma":[0.00040403582,0.00016626218,0.00040774237,0.00050088606,0.00017175962,0.00057332095,0.00018125505,0.00035577544,0.0009492614],"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.00019341684,0.000052973824,0.0007877394,0.00012357703,0.000030651063,0.00016696422,0.000052001313,0.005624335,0.31311598,0.0034931917,0.002627955,0.6737312],"study_design_scores_gemma":[0.000039301536,0.00036821625,0.009266865,0.00004729232,0.00014375905,0.003379809,0.00008067444,0.6009046,0.3684815,0.0036057208,0.01360165,0.00008064313],"about_ca_topic_score_codex":0.00046232168,"about_ca_topic_score_gemma":0.0004496998,"teacher_disagreement_score":0.0017599259,"about_ca_system_score_codex":0.00011708346,"about_ca_system_score_gemma":0.00017089168,"threshold_uncertainty_score":0.0058875084},"labels":[],"label_agreement":null},{"id":"W121566830","doi":"10.1007/978-3-540-39899-8_68","title":"A High Resolution Dynamic Heart Model Based on Averaged MRI Data","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Image resolution; Magnetic resonance imaging; Resolution (logic); High resolution; Temporal resolution; Noise (video); Signal-to-noise ratio (imaging); Artificial intelligence; Partial volume; Volume (thermodynamics); Residual; Image (mathematics); Computer vision; Nuclear magnetic resonance; Algorithm; Physics; Optics; Telecommunications; Remote sensing; Geology","score_opus":0.02884037190049442,"score_gpt":0.3083523187041843,"score_spread":0.27951194680368985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121566830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029093693,0.000119735116,0.99582314,0.000039189807,0.000027509965,0.000014157459,0.000091125556,0.00064533175,0.00033046558],"genre_scores_gemma":[0.23575322,0.0011836874,0.7554415,0.00017166592,0.0001298712,0.00018399386,0.001109835,0.0006109352,0.0054153353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998938,0.000015694082,0.000007617602,0.000034880926,0.00004075385,0.000007262932],"domain_scores_gemma":[0.99982965,0.000070044465,0.000015881029,0.000031629803,0.0000400422,0.000012713344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033249997,0.0004830247,0.00078308536,0.0003529687,0.00020582894,0.00071173784,0.00086061447,0.0007464037,0.0017828668],"category_scores_gemma":[0.0009354255,0.00051441207,0.0007966909,0.00044505842,0.00017139185,0.00066242844,0.00042436732,0.0009204272,0.0012036654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015757908,0.000055171262,0.0005340872,0.00010884187,0.00014688153,0.00022314636,0.00004588993,0.70209837,0.03953571,0.003916081,0.0027365168,0.2504418],"study_design_scores_gemma":[0.000004314643,0.000017519593,0.00023237473,0.0000047998187,0.000022138815,0.00011092699,0.0000022264273,0.9953243,0.0021965671,0.0012440924,0.0008324616,0.00000819337],"about_ca_topic_score_codex":0.0026794716,"about_ca_topic_score_gemma":0.003620051,"teacher_disagreement_score":0.0026794716,"about_ca_system_score_codex":0.0002021115,"about_ca_system_score_gemma":0.00043980038,"threshold_uncertainty_score":0.005964279},"labels":[],"label_agreement":null},{"id":"W121905842","doi":"10.1007/978-3-642-34292-9_36","title":"Creative Design: Exploring Value Propositions with Urban Nepalese Children","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Persona Design and Applications","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":"Computer science; Process (computing); Action (physics); Action research; Value (mathematics); Knowledge management; Process management; Multimedia; Psychology; Mathematics education; Engineering","score_opus":0.042018566647728926,"score_gpt":0.24264431043194734,"score_spread":0.2006257437842184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121905842","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.8132463,0.00046500523,0.0058696656,0.0010232389,0.0000188824,0.00009393108,0.000044981156,0.000032236167,0.17920572],"genre_scores_gemma":[0.9829851,0.0002522039,0.0032303303,0.00008138008,0.0000020299117,0.00008611064,0.000025737703,0.000021938376,0.0133152045],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99854493,0.00096131413,0.000023769733,0.00014057853,0.00015219573,0.00017713703],"domain_scores_gemma":[0.9969361,0.00246974,0.00014867795,0.00013702066,0.00012938838,0.0001790657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023108579,0.0008750482,0.00043871798,0.0010706879,0.00829083,0.012154633,0.0015585352,0.001671261,0.007784889],"category_scores_gemma":[0.0038655496,0.00059433235,0.00036277037,0.0012161337,0.010738308,0.0052789245,0.0046447287,0.0035576138,0.0005895419],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035622295,0.00014975136,0.0034573413,0.00007911823,0.0000057900343,0.0009033398,0.9056379,0.00014098891,0.0005201734,0.07708091,0.0008029454,0.011185981],"study_design_scores_gemma":[0.000017201835,0.000060443497,0.0033375903,0.00016616567,0.000015999536,0.00058383646,0.9470509,0.00053863745,0.001058103,0.017604882,0.029546367,0.000019862813],"about_ca_topic_score_codex":0.009220175,"about_ca_topic_score_gemma":0.025840146,"teacher_disagreement_score":0.012154633,"about_ca_system_score_codex":0.00485745,"about_ca_system_score_gemma":0.0029654682,"threshold_uncertainty_score":0.03524345},"labels":[],"label_agreement":null},{"id":"W121999068","doi":"10.1007/11523468_95","title":"Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Upper and lower bounds; Tree (set theory); Omega; Combinatorics; Set (abstract data type); Mathematics; Function (biology); Polynomial; Discrete mathematics; Degree (music); Computer science; Physics","score_opus":0.03634676900953568,"score_gpt":0.2618878529731364,"score_spread":0.2255410839636007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121999068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055963296,0.014115675,0.55066454,0.030172579,0.0020477264,0.0004191734,0.0020465276,0.001169274,0.34340113],"genre_scores_gemma":[0.7925718,0.012100925,0.09729433,0.005823941,0.004713042,0.0016704826,0.0023899106,0.0020721846,0.08136352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393564,0.0014180251,0.00025825782,0.001115212,0.0019504207,0.0013224395],"domain_scores_gemma":[0.9600412,0.030759564,0.001469089,0.0041324906,0.002073061,0.0015244607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005412824,0.0032090568,0.0050470135,0.00541437,0.0065567507,0.013194611,0.00730086,0.0071311863,0.03195556],"category_scores_gemma":[0.032389764,0.002188843,0.0040668123,0.007703557,0.006677718,0.036632486,0.009538888,0.024617227,0.0059531657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003836139,0.000045917346,0.00009858979,0.00011198163,0.000019441959,0.000020694437,0.00012382936,0.0031192573,0.00027072214,0.9847584,0.005717679,0.005675159],"study_design_scores_gemma":[0.000005919936,0.000004475033,0.000041487925,0.000021847136,0.000008670968,0.000016467227,0.000019342278,0.008857563,0.00014020925,0.98946524,0.0014077479,0.000011020982],"about_ca_topic_score_codex":0.0014467129,"about_ca_topic_score_gemma":0.0018505845,"teacher_disagreement_score":0.03195556,"about_ca_system_score_codex":0.008373458,"about_ca_system_score_gemma":0.0027660092,"threshold_uncertainty_score":0.106902},"labels":[],"label_agreement":null},{"id":"W122288055","doi":"10.1007/978-3-642-03367-4_21","title":"Efficient Construction of Near-Optimal Binary and Multiway Search Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Binary search tree; Optimal binary search tree; Upper and lower bounds; Binary tree; Binary number; Weight-balanced tree; Random binary tree; Tree (set theory); Search tree; Ternary search tree; Node (physics); Self-balancing binary search tree; Mathematics; Computer science; Search algorithm; Combinatorics; Algorithm; Interval tree; Engineering","score_opus":0.013243371820295748,"score_gpt":0.24605463827257854,"score_spread":0.23281126645228278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122288055","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.10232851,0.0018744221,0.8739252,0.00053629675,0.00016469583,0.00019347241,0.0010422786,0.0034717114,0.016463365],"genre_scores_gemma":[0.256336,0.0005706045,0.7344253,0.00015210983,0.00006217579,0.00022363964,0.0015186466,0.00050490146,0.00620662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912614,0.00018097425,0.0000689436,0.00013917549,0.0003446457,0.00014010943],"domain_scores_gemma":[0.99835485,0.0007450997,0.0001060898,0.0004120317,0.0002814594,0.0001005126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058385276,0.00045247498,0.0013767718,0.0012769153,0.0007775227,0.0014977768,0.0015047687,0.0011835542,0.0053844196],"category_scores_gemma":[0.0046948506,0.00069209735,0.0007409888,0.0022373302,0.0006325687,0.0025796082,0.002407362,0.0012481582,0.0017432983],"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.00078662264,0.00029801723,0.0013823858,0.00064522645,0.000055718512,0.0001898737,0.0004369667,0.10890718,0.02935582,0.14924031,0.023788717,0.6849131],"study_design_scores_gemma":[0.00015170504,0.00020899187,0.0009654186,0.00011193839,0.00006225528,0.0004338473,0.0002183107,0.77763784,0.015562034,0.18505594,0.019541608,0.00005007675],"about_ca_topic_score_codex":0.000721874,"about_ca_topic_score_gemma":0.0020751522,"teacher_disagreement_score":0.0053844196,"about_ca_system_score_codex":0.00082895625,"about_ca_system_score_gemma":0.0012448373,"threshold_uncertainty_score":0.018012643},"labels":[],"label_agreement":null},{"id":"W12239746","doi":"10.1007/978-3-319-09333-8_43","title":"Images Denoising with Feature Extraction for Patch Matching in Block Matching and 3D Filtering","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Pattern recognition (psychology); Noise reduction; Matching (statistics); Image (mathematics); Computer science; Block (permutation group theory); Gaussian; Noise (video); Scale (ratio); Feature (linguistics); Image denoising; Computer vision; Mathematics; Geography; Statistics","score_opus":0.014499488284497085,"score_gpt":0.26914995424725285,"score_spread":0.25465046596275576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12239746","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.0023705384,0.0003379396,0.99571675,0.00003468907,0.000044422355,0.00002709444,0.000045307497,0.0004079114,0.0010153039],"genre_scores_gemma":[0.03508909,0.0006698074,0.9583928,0.000067264475,0.000059609334,0.000060627954,0.00027938347,0.00026299493,0.0051184464],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995383,0.00005447444,0.000028053157,0.00011517852,0.0002274154,0.00003664321],"domain_scores_gemma":[0.99962854,0.00011088656,0.000028938875,0.000106492924,0.000111269816,0.0000138589885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005733573,0.0006761547,0.0010406009,0.0011151928,0.00028954708,0.000860518,0.0011027472,0.0011924715,0.006557536],"category_scores_gemma":[0.0013548797,0.0005609842,0.0010826581,0.0013448693,0.00048453998,0.0011235473,0.00095843466,0.0009182548,0.0037072827],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014646098,0.00008095088,0.00041338964,0.00033881672,0.00008202392,0.00009163371,0.00009195323,0.01810394,0.1707988,0.019073479,0.005561694,0.7852168],"study_design_scores_gemma":[0.000025276435,0.00016254946,0.0017955841,0.000060807408,0.0001220791,0.0008254147,0.000052014308,0.7466968,0.1934061,0.023252016,0.033549555,0.000051829364],"about_ca_topic_score_codex":0.0010971423,"about_ca_topic_score_gemma":0.0018322068,"teacher_disagreement_score":0.006557536,"about_ca_system_score_codex":0.00041549833,"about_ca_system_score_gemma":0.0004314571,"threshold_uncertainty_score":0.021937132},"labels":[],"label_agreement":null},{"id":"W122475987","doi":"10.1007/978-3-642-39265-8_6","title":"From Living Space to Urban Quarter: Acceptance of ICT Monitoring Solutions in an Ageing Society","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":17,"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":"Information and Communications Technology; Internet privacy; Space (punctuation); Emerging technologies; Quarter (Canadian coin); Public space; Computer science; Computer security; Business; Public relations; Political science; Geography; Architectural engineering; Engineering; World Wide Web","score_opus":0.023060040637352112,"score_gpt":0.279387453603166,"score_spread":0.2563274129658139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122475987","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.9493013,0.002672773,0.0009527198,0.01000811,0.00029388306,0.000023604522,0.000107557804,0.00002767518,0.036612418],"genre_scores_gemma":[0.99239105,0.0013432548,0.00041337122,0.0009678433,0.00003710678,0.000012499991,0.00004887391,0.000015808764,0.0047702133],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843186,0.0005816427,0.000084262596,0.00010861464,0.00052114396,0.00027239602],"domain_scores_gemma":[0.99621755,0.0013185979,0.0005788539,0.000074340634,0.00088325515,0.0009274549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039409,0.00015973546,0.00017353322,0.00069811393,0.0011372594,0.0036156492,0.00044585185,0.0011063763,0.0052494113],"category_scores_gemma":[0.008353684,0.00015788861,0.00028606888,0.0008180595,0.00097287423,0.0035268387,0.0026796255,0.0016969774,0.00058867276],"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.00018180089,0.00025983094,0.19376747,0.00037794217,0.00004285075,0.0011133777,0.515409,0.00013545949,0.0018108385,0.009358206,0.01617926,0.26136398],"study_design_scores_gemma":[0.000010858037,0.0003108617,0.19895223,0.00062339235,0.0000436293,0.0011068361,0.7317008,0.00056167925,0.0005834369,0.0022774101,0.063765906,0.00006292147],"about_ca_topic_score_codex":0.00585284,"about_ca_topic_score_gemma":0.013497121,"teacher_disagreement_score":0.00585284,"about_ca_system_score_codex":0.00092341326,"about_ca_system_score_gemma":0.0015023656,"threshold_uncertainty_score":0.017561018},"labels":[],"label_agreement":null},{"id":"W122504873","doi":"10.1007/978-3-642-36594-2_30","title":"Computational Soundness of Coinductive Symbolic Security under Active Attacks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Computer science; Encryption; Theoretical computer science; TRACE (psycholinguistics); Symmetric-key algorithm; Ciphertext; Mathematics; Computer security; Public-key cryptography; Programming language","score_opus":0.01716209837868851,"score_gpt":0.2580138085464211,"score_spread":0.24085171016773257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122504873","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.12622716,0.0027298804,0.6497933,0.008147824,0.0009410542,0.00018282862,0.00080439064,0.0021851284,0.20898847],"genre_scores_gemma":[0.9508083,0.0008875265,0.0306874,0.000849746,0.0004940958,0.000183785,0.00046058674,0.00030176877,0.015326873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955285,0.0009334476,0.00028847417,0.00082606496,0.0017590865,0.00066433754],"domain_scores_gemma":[0.9894611,0.0066525377,0.0003100571,0.002154433,0.0011931972,0.00022861022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024212247,0.0009999383,0.0013809432,0.0017019291,0.0020716903,0.006294461,0.0020504089,0.002342505,0.006475357],"category_scores_gemma":[0.010451782,0.0009837183,0.0018096503,0.0017089613,0.013214083,0.013408447,0.0045799864,0.0080297645,0.0013591801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000370885,0.000014807858,0.00009202781,0.00005819413,0.000009671672,0.00003754591,0.00024059502,0.0014923151,0.0006266461,0.9909236,0.0007987962,0.005668672],"study_design_scores_gemma":[0.000011891869,0.000008819169,0.00003633745,0.000015225492,0.000010181883,0.0000267298,0.000030152452,0.0027739515,0.00059865374,0.9949292,0.0015508829,0.000008078104],"about_ca_topic_score_codex":0.0014552292,"about_ca_topic_score_gemma":0.0010380647,"teacher_disagreement_score":0.006475357,"about_ca_system_score_codex":0.003043814,"about_ca_system_score_gemma":0.0021542832,"threshold_uncertainty_score":0.022084534},"labels":[],"label_agreement":null},{"id":"W122586830","doi":"10.1007/978-3-319-11167-4_23","title":"tNote: A Social Network of Vehicles under Internet of Things","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":28,"is_retracted":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":"Computer science; Dedicated short-range communications; Internet of Things; Architecture; Leverage (statistics); The Internet; Vehicular ad hoc network; Computer security; Wireless ad hoc network; Computer network; Telecommunications; World Wide Web; Artificial intelligence; Wireless","score_opus":0.00917542143350703,"score_gpt":0.20728030864423042,"score_spread":0.1981048872107234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122586830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13319926,0.004679299,0.6241455,0.0053583593,0.0035033897,0.0011657629,0.014282151,0.004925747,0.20874055],"genre_scores_gemma":[0.5893313,0.009145874,0.2507489,0.001193916,0.0010749303,0.00093318865,0.02303333,0.0006572302,0.12388127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.00006136784,0.000012112336,0.00005503245,0.0000726098,0.000024703391],"domain_scores_gemma":[0.9997569,0.00007449895,0.000025230216,0.000033755226,0.0000402116,0.0000693926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030321005,0.00043932206,0.00035271593,0.0009478958,0.0014124062,0.0016159866,0.0008651612,0.000898291,0.006126284],"category_scores_gemma":[0.0008996706,0.00020396884,0.0004802219,0.0015451154,0.00050747814,0.0027198028,0.0015627273,0.00063945923,0.0014474557],"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.00025191356,0.00018640014,0.0066651925,0.0007683238,0.00014651402,0.002223511,0.0026934652,0.04674801,0.008344436,0.5138611,0.16322233,0.25488886],"study_design_scores_gemma":[0.000041130388,0.0001546485,0.0030879288,0.00018736934,0.00010007088,0.0016596023,0.0019545294,0.106756374,0.002446428,0.15116182,0.73236483,0.00008521471],"about_ca_topic_score_codex":0.004115046,"about_ca_topic_score_gemma":0.0077890703,"teacher_disagreement_score":0.006126284,"about_ca_system_score_codex":0.00047475038,"about_ca_system_score_gemma":0.000720232,"threshold_uncertainty_score":0.020494461},"labels":[],"label_agreement":null},{"id":"W12293515","doi":"10.1007/978-3-642-21593-3_5","title":"A Flexible Framework for Local Phase Coherence Computation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical Coherence Tomography Applications","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":"University of Waterloo","funders":"","keywords":"Computer science; Coherence (philosophical gambling strategy); Computation; Algorithm; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.030297846606502962,"score_gpt":0.287361529579222,"score_spread":0.25706368297271903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12293515","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.0011554671,0.000111258196,0.9941643,0.000052705727,0.000039396993,0.000021314076,0.0000482941,0.0005832198,0.0038241327],"genre_scores_gemma":[0.0995326,0.0005225788,0.8894009,0.00012381878,0.000109495224,0.00024303421,0.00032226386,0.00097477675,0.008770477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999506,0.000104707055,0.000023103425,0.000079902675,0.00022474882,0.00006160373],"domain_scores_gemma":[0.9995584,0.00012357242,0.000017335808,0.00020190186,0.00006380915,0.000035029818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007809745,0.000855751,0.0010927151,0.00075103936,0.0010730533,0.0018018133,0.0025212478,0.0011227995,0.010261331],"category_scores_gemma":[0.0015804373,0.0006199772,0.001054274,0.0011015141,0.0012005531,0.0025679742,0.0030482986,0.0022010845,0.0031901244],"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.000075318196,0.000059312864,0.000078824094,0.00011019306,0.000027627642,0.000103487575,0.000088592955,0.0501149,0.012074494,0.83633083,0.0061629885,0.09477352],"study_design_scores_gemma":[0.000030297659,0.000026154856,0.00004632804,0.00002639793,0.000014641716,0.00009646922,0.00001992244,0.48250172,0.004949419,0.49028116,0.021977698,0.000029754212],"about_ca_topic_score_codex":0.000996509,"about_ca_topic_score_gemma":0.0020309263,"teacher_disagreement_score":0.010261331,"about_ca_system_score_codex":0.00051099434,"about_ca_system_score_gemma":0.00057626533,"threshold_uncertainty_score":0.034327567},"labels":[],"label_agreement":null},{"id":"W123161345","doi":"10.1007/978-3-540-85760-0_37","title":"Bilingual Question Answering Using CINDI_QA at QA@CLEF 2007","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Clef; Question answering; Computer science; Information retrieval; Natural language processing; Artificial intelligence; Engineering","score_opus":0.018965334212091404,"score_gpt":0.29230686669175526,"score_spread":0.27334153247966386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123161345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06617764,0.002073642,0.42306623,0.005614067,0.0028551752,0.0021666544,0.09385871,0.23129384,0.17289402],"genre_scores_gemma":[0.24236093,0.00048614616,0.40291083,0.00141454,0.00066142995,0.0012980957,0.2799314,0.019553147,0.05138349],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949302,0.002200206,0.00033755865,0.0013530899,0.00076650485,0.00041242948],"domain_scores_gemma":[0.99104965,0.0035748759,0.00019044879,0.0018815757,0.0028648868,0.00043861804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005067366,0.002186734,0.0021476327,0.0039976267,0.0028662742,0.0033549152,0.002516798,0.0027175338,0.16732566],"category_scores_gemma":[0.016459627,0.0015700243,0.0012567012,0.0028356481,0.00084248616,0.006394774,0.0042945794,0.0034917668,0.0606297],"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.0018490403,0.00079103553,0.0013231222,0.0016072433,0.00014379404,0.0005799907,0.0008836943,0.0047033173,0.02454102,0.02404855,0.66648704,0.27304217],"study_design_scores_gemma":[0.0015039084,0.0005036879,0.0037213112,0.00030929717,0.0002373215,0.0013339561,0.0011325172,0.13492554,0.10011345,0.04165852,0.71421015,0.0003503072],"about_ca_topic_score_codex":0.009203124,"about_ca_topic_score_gemma":0.009314253,"teacher_disagreement_score":0.16732566,"about_ca_system_score_codex":0.0027644865,"about_ca_system_score_gemma":0.0040615895,"threshold_uncertainty_score":0.5597601},"labels":[],"label_agreement":null},{"id":"W123374098","doi":"10.1007/978-3-319-11212-1_4","title":"Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Attribute-based encryption; Traitor tracing; Traceability; Encryption; Ciphertext; Key (lock); Computer security; Overhead (engineering); Access control; Database; Public-key cryptography; Operating system; Software engineering","score_opus":0.011143646232620067,"score_gpt":0.22962481435137308,"score_spread":0.218481168118753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123374098","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.02893322,0.0004120664,0.95608485,0.000499069,0.00016126092,0.00015133033,0.00022441491,0.0018324554,0.011701327],"genre_scores_gemma":[0.784505,0.0004641386,0.20128927,0.00026906203,0.00014841103,0.00017455635,0.00045115824,0.00035486397,0.012343453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711895,0.000667933,0.00021364674,0.00039229952,0.0011552597,0.00045196508],"domain_scores_gemma":[0.9955258,0.0012943532,0.00018860899,0.0023836114,0.0004436831,0.00016393137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019408413,0.00053252844,0.001223485,0.0006145604,0.0010101387,0.0031738637,0.0015443945,0.0009866966,0.0046960823],"category_scores_gemma":[0.004845483,0.00038689421,0.00089516945,0.0014798103,0.0016763438,0.007006373,0.003938418,0.0032104175,0.0018178256],"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.00068706233,0.00023986217,0.0004067923,0.00021255473,0.00006247394,0.00027073335,0.0002939685,0.034184076,0.016940821,0.8280717,0.007684092,0.11094582],"study_design_scores_gemma":[0.00009881617,0.00012017826,0.0002365481,0.0000461622,0.000042675107,0.0003566671,0.000054775333,0.26009974,0.028260067,0.69984615,0.010779894,0.000058330126],"about_ca_topic_score_codex":0.0005551626,"about_ca_topic_score_gemma":0.00042979865,"teacher_disagreement_score":0.0046960823,"about_ca_system_score_codex":0.0015564582,"about_ca_system_score_gemma":0.0016980255,"threshold_uncertainty_score":0.015709937},"labels":[],"label_agreement":null},{"id":"W123387184","doi":"10.1007/978-3-642-31951-8_8","title":"Learning Directed Relational Models with Recursive Dependencies","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Simon Fraser University","funders":"","keywords":"Computer science; Statistical relational learning; Theoretical computer science; Relational database; Predicate (mathematical logic); Probabilistic logic; Artificial intelligence; Bayesian network; Inductive logic programming; Machine learning; Algorithm; Data mining; Programming language","score_opus":0.03059491554346118,"score_gpt":0.23272209375472208,"score_spread":0.20212717821126092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123387184","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.011833166,0.0005671024,0.9847328,0.000332055,0.000020897418,0.00002011165,0.00030386707,0.0005334605,0.0016564628],"genre_scores_gemma":[0.45245853,0.0024866522,0.53035414,0.00040601948,0.00018826548,0.00026026563,0.0033879918,0.00033388787,0.010124238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998774,0.0005316949,0.00007097796,0.0003376402,0.00021261298,0.00007301236],"domain_scores_gemma":[0.99089676,0.007871966,0.00027016914,0.0006376064,0.00021261058,0.00011085689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018804729,0.00089577906,0.0013056608,0.0008990005,0.00041218527,0.0019389957,0.002593122,0.0016394368,0.0055148494],"category_scores_gemma":[0.013413998,0.0015417719,0.001519407,0.0015980104,0.001016643,0.006013911,0.0023231525,0.0030634634,0.0012175025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014336035,0.00015356707,0.0018282419,0.0003260905,0.00019767469,0.0002093175,0.00038313222,0.48463812,0.0011550068,0.3114704,0.006337102,0.19315808],"study_design_scores_gemma":[0.000014571782,0.000016104284,0.00012907798,0.000026353471,0.000028256163,0.000042836364,0.000020820646,0.7176014,0.00033220902,0.28030357,0.001471618,0.000013171464],"about_ca_topic_score_codex":0.003067147,"about_ca_topic_score_gemma":0.0057316516,"teacher_disagreement_score":0.0055148494,"about_ca_system_score_codex":0.0010485532,"about_ca_system_score_gemma":0.0007416239,"threshold_uncertainty_score":0.018449068},"labels":[],"label_agreement":null},{"id":"W1235372244","doi":"10.1007/978-3-319-04268-8_14","title":"Detection of Algebraic Manipulation in the Presence of Leakage","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Randomness; Computer science; Upper and lower bounds; Algorithm; Adversary; Theoretical computer science; Information leakage; Entropy (arrow of time); Algebraic number; Mathematics; Computer security","score_opus":0.0168992483949532,"score_gpt":0.23570340119628003,"score_spread":0.2188041528013268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1235372244","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.21898814,0.0015637177,0.7559635,0.0016636429,0.00027951115,0.00017104286,0.00049923,0.0023228652,0.018548254],"genre_scores_gemma":[0.92809296,0.00044111864,0.06781428,0.00021288691,0.00017171961,0.00006305703,0.00028246135,0.000094529096,0.002826965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441046,0.0011884349,0.00032525422,0.0010796327,0.002348073,0.00064807036],"domain_scores_gemma":[0.98191607,0.009735074,0.0026250193,0.0039031014,0.0014426527,0.00037807308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018127917,0.00077067834,0.0014881415,0.0011746264,0.0008124758,0.002956459,0.0013178518,0.0020697776,0.002308246],"category_scores_gemma":[0.020309275,0.00062191125,0.0006134441,0.0011212864,0.0023791885,0.005574422,0.0052130884,0.002215895,0.0010744511],"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.0028278772,0.00043122258,0.019299846,0.0012189883,0.00037343055,0.0026617802,0.0014779342,0.03601913,0.17479298,0.36919075,0.009493869,0.3822121],"study_design_scores_gemma":[0.00012174695,0.00089259516,0.0038745306,0.00024399773,0.0001407696,0.006069841,0.0004379616,0.4237503,0.21657285,0.33715618,0.010554725,0.00018447886],"about_ca_topic_score_codex":0.0001105574,"about_ca_topic_score_gemma":0.0001271355,"teacher_disagreement_score":0.002956459,"about_ca_system_score_codex":0.0004765291,"about_ca_system_score_gemma":0.0007347745,"threshold_uncertainty_score":0.0095870495},"labels":[],"label_agreement":null},{"id":"W123741872","doi":"10.1007/978-3-642-13568-2_11","title":"Security Evaluation of Layered Intrusion Tolerant Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Layer (electronics); Web server; Vulnerability (computing); Intrusion; Intrusion tolerance; Intrusion detection system; Data integrity; Database; Host (biology); Set (abstract data type); Operating system; Computer security; The Internet","score_opus":0.020756310524605793,"score_gpt":0.25432298792713115,"score_spread":0.23356667740252535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123741872","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.6514276,0.001686712,0.33086544,0.00060815923,0.00015814879,0.00023189968,0.00019789104,0.0015684004,0.013255701],"genre_scores_gemma":[0.9790532,0.00016325511,0.019673973,0.000019026238,0.000020708798,0.000027471144,0.00011613255,0.000037440757,0.00088888267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501026,0.0021479533,0.00021387509,0.00019246747,0.0020728959,0.00036254147],"domain_scores_gemma":[0.9900989,0.0055494504,0.000610239,0.001033894,0.0023876198,0.0003199359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00394572,0.0008780584,0.000629266,0.0009966975,0.0003650394,0.0017372213,0.0009600743,0.0005974743,0.0018856917],"category_scores_gemma":[0.014557972,0.00023275848,0.00037569026,0.000531998,0.000741655,0.0017325248,0.0010726762,0.00073485746,0.00022540172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023993049,0.0002972429,0.007560073,0.00029974326,0.00019348919,0.00015779874,0.00019765703,0.74317265,0.03007514,0.023610657,0.001973366,0.19006288],"study_design_scores_gemma":[0.000020911553,0.00038125596,0.0009228001,0.000016870361,0.00003536896,0.000049260285,0.00004756074,0.9811539,0.011083438,0.00579277,0.00048201706,0.000013875803],"about_ca_topic_score_codex":0.0009484278,"about_ca_topic_score_gemma":0.0007598077,"teacher_disagreement_score":0.00394572,"about_ca_system_score_codex":0.0014235326,"about_ca_system_score_gemma":0.0006692905,"threshold_uncertainty_score":0.020867229},"labels":[],"label_agreement":null},{"id":"W124365840","doi":"10.1007/978-3-642-22600-7_13","title":"State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Intersection (aeronautics); Star (game theory); Computer science; State (computer science); Algorithm; Theoretical computer science; Mathematics; Aerospace engineering; Engineering","score_opus":0.029660957460839108,"score_gpt":0.23200068623280984,"score_spread":0.20233972877197073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124365840","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.90744865,0.00021881367,0.06773673,0.0011401667,0.000052045518,0.000085176194,0.0013981783,0.00065029704,0.02126995],"genre_scores_gemma":[0.98659384,0.00007721259,0.007716885,0.000037659098,0.000027825205,0.000047900347,0.00075190415,0.00010900733,0.0046376805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985359,0.00029879902,0.00008137446,0.00025062182,0.00042351303,0.00040971476],"domain_scores_gemma":[0.98035675,0.016256325,0.0006876668,0.001267592,0.00089126336,0.00054037705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659477,0.00047628704,0.000848795,0.00082723453,0.0011982688,0.0046784,0.0015442093,0.0014376664,0.015473749],"category_scores_gemma":[0.008936105,0.00046805182,0.0013278301,0.0011799228,0.0019577192,0.0071523725,0.0016716382,0.0018794377,0.00071796647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028020167,0.00059748057,0.008205535,0.00038490398,0.00016056973,0.0003267267,0.0012626584,0.3091769,0.011046488,0.5884125,0.0101153795,0.06750879],"study_design_scores_gemma":[0.0001136659,0.00010567874,0.0019224845,0.000015761325,0.000087955574,0.000067699366,0.00023925772,0.7249285,0.0061592883,0.26540118,0.0009076468,0.00005088158],"about_ca_topic_score_codex":0.010984757,"about_ca_topic_score_gemma":0.01179077,"teacher_disagreement_score":0.015473749,"about_ca_system_score_codex":0.0028937757,"about_ca_system_score_gemma":0.0025609427,"threshold_uncertainty_score":0.051764846},"labels":[],"label_agreement":null},{"id":"W124523214","doi":"10.1007/978-3-540-39920-9_3","title":"Predicated Instructions for Code Compaction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 British Columbia","funders":"","keywords":"Opcode; Computer science; Executable; Abstraction; Code (set theory); Programming language; Function (biology); Set (abstract data type)","score_opus":0.023189305684854236,"score_gpt":0.2703252090117288,"score_spread":0.24713590332687457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124523214","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.010858811,0.0010435643,0.954813,0.00034061543,0.0003926536,0.00015339437,0.00060029066,0.016137118,0.015660474],"genre_scores_gemma":[0.14486627,0.000923267,0.8279464,0.0005106122,0.0003293778,0.0005338511,0.0022945981,0.004315594,0.018280024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989492,0.000195748,0.00009562275,0.0001580215,0.00045599663,0.00014547477],"domain_scores_gemma":[0.99796754,0.00075111905,0.00011142838,0.0008759007,0.00025496582,0.000039021223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065896177,0.0011773042,0.0009687218,0.0011563804,0.0008512338,0.0014256748,0.0019778681,0.00095707556,0.018853644],"category_scores_gemma":[0.0032109334,0.0008990664,0.00091086765,0.0023629395,0.0014689876,0.003177467,0.0018709743,0.00232242,0.0045505394],"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.00039277988,0.0001384968,0.00044008775,0.0005105818,0.00003778619,0.00017731503,0.0002533267,0.01576008,0.018372206,0.29239252,0.046849716,0.62467515],"study_design_scores_gemma":[0.00017610792,0.00028463037,0.00054635014,0.00025070738,0.00012468226,0.00033853564,0.00012541785,0.18849988,0.07349985,0.5900374,0.1460328,0.00008356143],"about_ca_topic_score_codex":0.0008799931,"about_ca_topic_score_gemma":0.0013747867,"teacher_disagreement_score":0.018853644,"about_ca_system_score_codex":0.0007266018,"about_ca_system_score_gemma":0.0012558707,"threshold_uncertainty_score":0.06307167},"labels":[],"label_agreement":null},{"id":"W124529360","doi":"10.1007/978-3-319-08644-6_17","title":"Determining Three-Way Decision Regions with Gini Coefficients","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Gini coefficient; Rough set; Decision rule; Computer science; Set (abstract data type); Interpretation (philosophy); Decision system; Decision process; Decision model; Key (lock); Decision analysis; Function (biology); Decision boundary; Boundary (topology); Decision table; Decision problem; Mathematics; Artificial intelligence; Operations research; Statistics; Machine learning; Algorithm; Management science; Inequality; Economics","score_opus":0.020937461648833533,"score_gpt":0.24017113501912257,"score_spread":0.21923367337028904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124529360","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.052040715,0.00055394514,0.94340086,0.0001446307,0.00003891862,0.00012408564,0.00035311727,0.00043707897,0.0029066561],"genre_scores_gemma":[0.3424669,0.00025943716,0.65423226,0.000052264648,0.00003662473,0.0003307073,0.00077715446,0.0002646284,0.001580078],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969728,0.00145007,0.00015833727,0.0005557274,0.00062803517,0.00023508233],"domain_scores_gemma":[0.98960227,0.0077343867,0.00053166633,0.00059815455,0.0012599174,0.0002735899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007829979,0.0011742092,0.0020233488,0.0049285893,0.0010084838,0.002948298,0.0017838182,0.0011261576,0.002406952],"category_scores_gemma":[0.02257746,0.00079724484,0.0019930853,0.0029172155,0.0011403358,0.0024702933,0.0022220437,0.0019034295,0.0007225537],"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.00097026624,0.0002315784,0.017772403,0.00056900876,0.00055573357,0.00028831753,0.0011883564,0.41506425,0.0061918832,0.10433338,0.009250599,0.44358426],"study_design_scores_gemma":[0.000026465616,0.000078067096,0.0032240723,0.00008194417,0.00008032337,0.00011810735,0.00020377034,0.8987372,0.0030380737,0.09181135,0.002546039,0.000054642525],"about_ca_topic_score_codex":0.0034256754,"about_ca_topic_score_gemma":0.0033072191,"teacher_disagreement_score":0.007829979,"about_ca_system_score_codex":0.0015793375,"about_ca_system_score_gemma":0.0015784317,"threshold_uncertainty_score":0.041409373},"labels":[],"label_agreement":null},{"id":"W124600208","doi":"10.1007/978-3-642-39188-0_12","title":"The Evolving Global Public Inclusive Infrastructure (GPII)","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Approaches in Technology and Social Development","field":"Business, Management and Accounting","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":"Ontario College of Art and Design","funders":"","keywords":"Sustenance; Cloud computing; Computer science; Product (mathematics); Population; Independence (probability theory); Computer security; Telecommunications","score_opus":0.012529758738591206,"score_gpt":0.2247465946898387,"score_spread":0.2122168359512475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124600208","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034248352,0.0069830385,0.025328036,0.035007756,0.0017956663,0.00010542464,0.00029140338,0.0011783006,0.895062],"genre_scores_gemma":[0.67609036,0.013057596,0.029648658,0.0057756533,0.0006942178,0.000286631,0.0007176769,0.0009063508,0.2728228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.00012594368,0.000015751784,0.00009708489,0.00024077832,0.0002099391],"domain_scores_gemma":[0.9995437,0.000068507565,0.000032813157,0.00011968104,0.00007151458,0.0001638016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014008257,0.0004195119,0.00022894984,0.0010385311,0.0017348751,0.007404097,0.0011731689,0.0022031036,0.010871576],"category_scores_gemma":[0.0015234612,0.00025867342,0.00026195945,0.0022164993,0.004452151,0.010237541,0.0093388725,0.0029214977,0.0018918935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009660982,0.0000116668125,0.0002826362,0.000073378906,0.0000024793242,0.00008628512,0.001309308,0.0003762181,0.00024250803,0.8722751,0.028926902,0.096403755],"study_design_scores_gemma":[0.0000030248395,0.000034952303,0.0010565775,0.0001469407,0.000004452264,0.00024747284,0.0017596841,0.0004761905,0.00037825175,0.21559168,0.7802862,0.000014521487],"about_ca_topic_score_codex":0.0036711937,"about_ca_topic_score_gemma":0.0043179523,"teacher_disagreement_score":0.010871576,"about_ca_system_score_codex":0.0041418434,"about_ca_system_score_gemma":0.004418873,"threshold_uncertainty_score":0.036369085},"labels":[],"label_agreement":null},{"id":"W124609046","doi":"10.1007/978-3-642-22600-7_21","title":"State Trade-Offs in Unranked Tree Automata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Tree (set theory); Automaton; Upper and lower bounds; Computer science; Horizontal and vertical; State (computer science); ω-automaton; Finite-state machine; Quantum finite automata; Discrete mathematics; Mathematics; Combinatorics; Automata theory; Theoretical computer science; Algorithm; Geometry","score_opus":0.018659769607563,"score_gpt":0.22903347662304183,"score_spread":0.21037370701547883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124609046","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5367902,0.0020055876,0.42195714,0.0014354505,0.00018504923,0.00009650214,0.00035694742,0.0013284346,0.03584479],"genre_scores_gemma":[0.96467674,0.00031610683,0.02753228,0.0000728964,0.000064772605,0.00007101894,0.00012968866,0.00019141754,0.0069450852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782616,0.0008879229,0.0001788107,0.00029277182,0.00050038734,0.00031395067],"domain_scores_gemma":[0.9769786,0.018803641,0.0010039947,0.0015527605,0.0009860011,0.0006749221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027001477,0.00072424195,0.0016274196,0.0010579309,0.0013883117,0.0047150026,0.0017244887,0.002387517,0.008641996],"category_scores_gemma":[0.015751157,0.00090255204,0.0007646657,0.0013913129,0.0023748826,0.008940878,0.0017889012,0.0023058327,0.0008550101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005502828,0.00018070088,0.0010187352,0.0002465022,0.000046688645,0.00031171914,0.0005105241,0.23113474,0.006133705,0.70572907,0.0022208302,0.05191657],"study_design_scores_gemma":[0.000023873472,0.00006442224,0.000136764,0.0000156202,0.00001869206,0.000053031974,0.000050287825,0.35531008,0.001192418,0.64266264,0.00045288444,0.000019363273],"about_ca_topic_score_codex":0.0006378472,"about_ca_topic_score_gemma":0.0012836617,"teacher_disagreement_score":0.008641996,"about_ca_system_score_codex":0.0016790448,"about_ca_system_score_gemma":0.000785154,"threshold_uncertainty_score":0.028910339},"labels":[],"label_agreement":null},{"id":"W1247648998","doi":"10.1007/978-3-642-40084-1_3","title":"Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":65,"is_retracted":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":"Israel Science Foundation","keywords":"Computer science; Electronic circuit; Computation; Secure multi-party computation; Theoretical computer science; Algorithm; Electrical engineering","score_opus":0.01578873189766865,"score_gpt":0.24816522096256566,"score_spread":0.232376489064897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1247648998","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.023373226,0.0012588219,0.9527795,0.000979472,0.00084461295,0.0002555527,0.00027323747,0.0045077694,0.015727798],"genre_scores_gemma":[0.5380606,0.0011959905,0.43312997,0.001182456,0.00058900355,0.00030579316,0.0008442001,0.0015722401,0.023119757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941414,0.0013657773,0.00044167263,0.0011988413,0.0021069234,0.00074540364],"domain_scores_gemma":[0.99248016,0.002992118,0.0003091774,0.0034147426,0.00061490835,0.00018900823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026085926,0.0020555493,0.0026527087,0.0019936382,0.0011698467,0.0057849726,0.0035354309,0.0027788747,0.014811423],"category_scores_gemma":[0.009879188,0.0012268751,0.002945209,0.0031063817,0.0038624534,0.015719129,0.007526621,0.0072815698,0.003679276],"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.0012866047,0.00037090667,0.00050494727,0.000782034,0.00016793895,0.00040131927,0.0003280637,0.03652661,0.024231102,0.70918727,0.009661695,0.2165515],"study_design_scores_gemma":[0.0002500211,0.00018723735,0.00018331649,0.00013790831,0.00012909962,0.0004252459,0.00006186486,0.14224184,0.029263005,0.8115173,0.015495128,0.000108039734],"about_ca_topic_score_codex":0.0005964334,"about_ca_topic_score_gemma":0.0007939591,"teacher_disagreement_score":0.014811423,"about_ca_system_score_codex":0.0017394794,"about_ca_system_score_gemma":0.0018857718,"threshold_uncertainty_score":0.049549162},"labels":[],"label_agreement":null},{"id":"W124832896","doi":"10.1007/978-3-642-21470-7_23","title":"Table-Driven Detection and Resolution of Operation-Based Merge Conflicts with Mirador","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Merge (version control); Table (database); Computer graphics (images); Data mining; Information retrieval","score_opus":0.016007842068081812,"score_gpt":0.21648233303449835,"score_spread":0.20047449096641654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124832896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1398549,0.0009776478,0.83175397,0.00061223644,0.0004246864,0.00030240172,0.00032185827,0.016353808,0.009398487],"genre_scores_gemma":[0.6089119,0.00012433188,0.38580626,0.00019205967,0.0000685991,0.000088065855,0.00048129325,0.00047437815,0.0038531837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727124,0.00060594565,0.00024717062,0.00045582606,0.0010640876,0.00035573126],"domain_scores_gemma":[0.9942536,0.0025888067,0.00055443286,0.0013030341,0.0010906754,0.00020943422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025435765,0.00068786263,0.0012567418,0.0017377291,0.0008159773,0.0021504937,0.0027440954,0.001038683,0.0053404667],"category_scores_gemma":[0.009086965,0.00058761414,0.0005864216,0.001056871,0.0008697809,0.0028200615,0.0024550287,0.0011377665,0.0012813824],"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.0040008943,0.0004688235,0.009563653,0.00060439477,0.00025278953,0.0010001071,0.0011844499,0.038789522,0.105331495,0.0352529,0.013511952,0.79003906],"study_design_scores_gemma":[0.00016663049,0.0004933658,0.0018813567,0.00006291151,0.00014691155,0.0006451342,0.0005006658,0.7979648,0.16710669,0.018154886,0.012774456,0.00010224867],"about_ca_topic_score_codex":0.000935106,"about_ca_topic_score_gemma":0.0019147097,"teacher_disagreement_score":0.0053404667,"about_ca_system_score_codex":0.0005738884,"about_ca_system_score_gemma":0.0012721221,"threshold_uncertainty_score":0.017865598},"labels":[],"label_agreement":null},{"id":"W125031099","doi":"10.1007/978-3-642-38457-8_9","title":"Fast Grid-Based Path Finding for Video Games","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Grid; Path (computing); Computation; Algorithm; Computer network","score_opus":0.03367686381273285,"score_gpt":0.2764192464827732,"score_spread":0.24274238267004036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125031099","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.02198935,0.00045816952,0.9661872,0.000111811045,0.00012890389,0.0001645941,0.0003756168,0.00441923,0.0061651752],"genre_scores_gemma":[0.25790277,0.00031447425,0.7340704,0.00007097822,0.000030851785,0.00021278983,0.0009302453,0.00036272965,0.006104743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00005856301,0.000017728747,0.000080607206,0.00012484354,0.0000672326],"domain_scores_gemma":[0.99933225,0.00035771777,0.000034170374,0.00010282145,0.00011857926,0.000054501612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037114884,0.0011264853,0.0015761099,0.0011304375,0.0007779714,0.00081402215,0.0020920439,0.0009402453,0.011133913],"category_scores_gemma":[0.0018059923,0.00058068556,0.0006518904,0.0013616418,0.00041541716,0.0012049301,0.0020237707,0.0011604748,0.0019092407],"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.000663498,0.00023461043,0.0010117869,0.00026525863,0.00008038979,0.00014302439,0.00015401925,0.3154032,0.007398305,0.018496279,0.020952221,0.63519746],"study_design_scores_gemma":[0.000045774526,0.000041341973,0.00016389693,0.0000095065225,0.0000073875217,0.000041975356,0.000034805995,0.98686105,0.0010123643,0.0101518445,0.0016217541,0.000008225593],"about_ca_topic_score_codex":0.016527332,"about_ca_topic_score_gemma":0.019918919,"teacher_disagreement_score":0.016527332,"about_ca_system_score_codex":0.00070898666,"about_ca_system_score_gemma":0.0011952599,"threshold_uncertainty_score":0.037246644},"labels":[],"label_agreement":null},{"id":"W125137646","doi":"10.1007/978-3-642-23629-7_20","title":"Apparent Intravoxel Fibre Population Dispersion (FPD) Using Spherical Harmonics","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Population; Computer science; Autocorrelation; Spherical harmonics; Voxel; Orientation (vector space); Dispersion (optics); Anisotropy; Diffusion MRI; Kurtosis; Diffusion; Quaternion; SIGNAL (programming language); Artificial intelligence; Acoustics; Algorithm; Mathematics; Optics; Physics; Statistics; Geometry; Mathematical analysis","score_opus":0.09551955099753882,"score_gpt":0.34454474679262476,"score_spread":0.24902519579508592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125137646","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.042346004,0.0006315833,0.9495781,0.00019476327,0.00006461204,0.00008466487,0.00034911788,0.0007264039,0.0060247565],"genre_scores_gemma":[0.304796,0.0017360689,0.68679595,0.00008514022,0.00009024979,0.00012292962,0.00041559056,0.00038555544,0.00557253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979526,0.000053882562,0.000009827015,0.00004057065,0.00008065198,0.000019874076],"domain_scores_gemma":[0.9993519,0.00030350548,0.00009236676,0.000121418576,0.00009368534,0.000037227837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068830367,0.00074968755,0.00031884288,0.0013288789,0.00039545624,0.0011111589,0.0007537,0.0009018063,0.0034996916],"category_scores_gemma":[0.0017208748,0.00036384547,0.00057874224,0.0014943058,0.00075664406,0.0019643884,0.0009402928,0.0010204605,0.00063483755],"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.0006481229,0.00014663812,0.007945737,0.0010607387,0.00022942534,0.00080009986,0.0010665281,0.058978174,0.32883424,0.10214625,0.0040944936,0.49404952],"study_design_scores_gemma":[0.000073598894,0.0001658667,0.012169499,0.00015084556,0.00011411599,0.0020359221,0.00025365833,0.7814938,0.1309466,0.057126082,0.015280123,0.0001899621],"about_ca_topic_score_codex":0.0018783448,"about_ca_topic_score_gemma":0.0033988084,"teacher_disagreement_score":0.0034996916,"about_ca_system_score_codex":0.0006218612,"about_ca_system_score_gemma":0.00056931336,"threshold_uncertainty_score":0.011707604},"labels":[],"label_agreement":null},{"id":"W125447159","doi":"10.1007/978-3-319-07956-1_16","title":"New Lower Bounds on Broadcast Function","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Concordia University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Upper and lower bounds; Function (biology); Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.018034029748237645,"score_gpt":0.26643010582352544,"score_spread":0.2483960760752878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125447159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013484641,0.026823299,0.59062827,0.012246363,0.0043456843,0.00020631243,0.0018670058,0.0020661112,0.3483322],"genre_scores_gemma":[0.32685488,0.043671653,0.28448728,0.009350939,0.020005671,0.0027251753,0.005471956,0.007367572,0.30006486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993979,0.0011324438,0.000262379,0.0011396256,0.0023959766,0.0010905458],"domain_scores_gemma":[0.9777569,0.016491523,0.0006073531,0.0024684248,0.0018092289,0.0008664721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052783135,0.0055369423,0.0049232394,0.007857049,0.004017453,0.010508455,0.009406945,0.005149625,0.040936444],"category_scores_gemma":[0.02530142,0.0024773285,0.0040376172,0.009962934,0.005727251,0.023199206,0.0088760145,0.022589613,0.014720195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021921097,0.00014894528,0.00020569412,0.00052785524,0.000047449492,0.00006304479,0.0002464622,0.009653105,0.0015903907,0.87097883,0.0451255,0.07119351],"study_design_scores_gemma":[0.000034930374,0.000043748045,0.0002111036,0.00027804755,0.00010571122,0.0001610725,0.000082911036,0.037493177,0.0015856654,0.9201781,0.039769642,0.000055944034],"about_ca_topic_score_codex":0.0021651026,"about_ca_topic_score_gemma":0.0026893588,"teacher_disagreement_score":0.040936444,"about_ca_system_score_codex":0.010222959,"about_ca_system_score_gemma":0.0029044957,"threshold_uncertainty_score":0.13694602},"labels":[],"label_agreement":null},{"id":"W12547246","doi":"10.1007/978-3-319-07536-5_8","title":"Private Message Transmission Using Disjoint Paths","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Disjoint sets; Alice and Bob; Computer science; Transmission (telecommunications); Protocol (science); Alice (programming language); Information leakage; Algorithm; Information transmission; Multipath propagation; Discrete mathematics; Computer network; Theoretical computer science; Arithmetic; Mathematics; Telecommunications","score_opus":0.01702414394061469,"score_gpt":0.24238550559854916,"score_spread":0.22536136165793447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12547246","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.017632445,0.0008058616,0.95562476,0.00052900193,0.00022130371,0.00018084551,0.00017025715,0.0008855256,0.02394994],"genre_scores_gemma":[0.6297331,0.0020875002,0.32494566,0.000410725,0.00028475863,0.00052502425,0.00047798123,0.00039661615,0.041138623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978967,0.0005265603,0.000121577425,0.0003750517,0.0007947753,0.00028530278],"domain_scores_gemma":[0.9966372,0.0018253436,0.00019709095,0.0010256944,0.0002475684,0.00006697968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013675811,0.0010360779,0.0011887697,0.0012957032,0.0013540573,0.0020064702,0.0012612266,0.0012064949,0.008392889],"category_scores_gemma":[0.0048428075,0.0007001014,0.00066952204,0.0016831269,0.0013338628,0.0045588245,0.004883058,0.0018981274,0.0021459707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006453885,0.00014041,0.00026429162,0.0004378226,0.00012166489,0.00024624798,0.0004631659,0.04931641,0.017881276,0.63807434,0.008753234,0.28365576],"study_design_scores_gemma":[0.00017150858,0.00023070905,0.00021159386,0.0001432598,0.00011495045,0.0009309074,0.00010457238,0.25926748,0.026059788,0.68366134,0.029025145,0.0000787933],"about_ca_topic_score_codex":0.000280459,"about_ca_topic_score_gemma":0.00029074764,"teacher_disagreement_score":0.008392889,"about_ca_system_score_codex":0.0010012358,"about_ca_system_score_gemma":0.0010571938,"threshold_uncertainty_score":0.028077066},"labels":[],"label_agreement":null},{"id":"W125772778","doi":"10.1007/978-3-642-33515-0_21","title":"Influence of Human Driving Characteristics on Path Tracking Performance of Vehicle","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic control and management","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":"Concordia University","funders":"","keywords":"Computer science; Path (computing); Task (project management); Simulation; Tracking (education); Process (computing); Vehicle dynamics; Tracking error; Steering wheel; Control (management); Automotive engineering; Artificial intelligence; Engineering","score_opus":0.008579631147039662,"score_gpt":0.20035893412551417,"score_spread":0.1917793029784745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125772778","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.9951166,0.00020858862,0.0032619368,0.000013497961,0.000015426596,0.000003854057,0.000101374506,0.000058376707,0.0012203624],"genre_scores_gemma":[0.9993556,0.000057082594,0.00015947054,0.0000027382507,0.0000033542485,0.0000010380577,0.00007830174,0.0000081533235,0.000334273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988115,0.000019255012,0.0000045213305,0.000028143291,0.000024615183,0.000042183103],"domain_scores_gemma":[0.9984742,0.0011034106,0.00009670428,0.000048999635,0.00018898962,0.000087782704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016333819,0.00022484257,0.00018349303,0.00026908275,0.00015412467,0.0003431693,0.00013703635,0.0002436748,0.0012541476],"category_scores_gemma":[0.0014951534,0.00012172271,0.00016256038,0.0002913845,0.00012350865,0.00019440973,0.00015901224,0.00015967042,0.00029844718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073207524,0.0005961577,0.13582656,0.00046029818,0.0003753029,0.0012327262,0.00045554142,0.46534166,0.21412016,0.0005996099,0.001901005,0.1717702],"study_design_scores_gemma":[0.000038015896,0.0021804736,0.38303998,0.000037006113,0.00031737873,0.000922457,0.0004377016,0.5403608,0.07058261,0.0006520826,0.0013349475,0.00009654924],"about_ca_topic_score_codex":0.0030785673,"about_ca_topic_score_gemma":0.0027783914,"teacher_disagreement_score":0.0030785673,"about_ca_system_score_codex":0.00015096634,"about_ca_system_score_gemma":0.00017239968,"threshold_uncertainty_score":0.0061213374},"labels":[],"label_agreement":null},{"id":"W125829645","doi":"10.1007/978-3-319-10160-6_12","title":"Discovering Statistically Significant Co-location Rules in Datasets with Extended Spatial Objects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data mining; Association rule learning; A priori and a posteriori; Apriori algorithm; Database transaction; Exploit; Artificial intelligence; Database","score_opus":0.012379491443248267,"score_gpt":0.2552597956391003,"score_spread":0.24288030419585202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125829645","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.7921627,0.0068941936,0.15646091,0.0018191942,0.00032266858,0.00028646566,0.036313232,0.0019060563,0.0038345847],"genre_scores_gemma":[0.8189058,0.0013679597,0.12447099,0.00029720762,0.00025582954,0.00017649285,0.05333858,0.00011059564,0.0010766108],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959787,0.0006426925,0.0005097598,0.0015057267,0.0010534754,0.00030959095],"domain_scores_gemma":[0.9828703,0.011951431,0.00168715,0.0021355222,0.0009584292,0.00039730105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030006045,0.0010728913,0.0015031585,0.006411207,0.001238681,0.0032828879,0.0027982406,0.0016512775,0.0013329115],"category_scores_gemma":[0.014755216,0.0005148094,0.0027133862,0.009896624,0.0008733415,0.0030519858,0.0018611266,0.0019441118,0.0010799664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013484438,0.0010430268,0.6368661,0.0015102151,0.0025734548,0.003419281,0.0008156574,0.040998217,0.008921511,0.005299433,0.01863218,0.27857244],"study_design_scores_gemma":[0.00026549422,0.00058805535,0.23414096,0.0006506098,0.0026091004,0.0067852377,0.004418286,0.63964415,0.014319807,0.07171044,0.024658984,0.00020885655],"about_ca_topic_score_codex":0.00641883,"about_ca_topic_score_gemma":0.01462164,"teacher_disagreement_score":0.00641883,"about_ca_system_score_codex":0.0007693842,"about_ca_system_score_gemma":0.0018907918,"threshold_uncertainty_score":0.015868902},"labels":[],"label_agreement":null},{"id":"W125842425","doi":"10.1007/978-3-642-38844-6_28","title":"A Framework for Privacy-Aware User Data Trading","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Data sharing; Adaptation (eye); Negotiation; Information privacy; User information; User modeling; Privacy policy; User requirements document; World Wide Web; Internet privacy; Computer security; Information system; User interface; Engineering","score_opus":0.07247914117742023,"score_gpt":0.30783351288409194,"score_spread":0.23535437170667173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125842425","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.0019184892,0.0001943089,0.99146056,0.00045718133,0.00007670404,0.00011254493,0.00006964906,0.000856411,0.004854206],"genre_scores_gemma":[0.17773654,0.00052566396,0.8055494,0.00044810883,0.00018509079,0.00035915055,0.0003202422,0.0004209872,0.014454786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393976,0.0020380511,0.00042559145,0.00095008995,0.0020116447,0.0006348598],"domain_scores_gemma":[0.9958282,0.0014139412,0.00020128753,0.0017092902,0.0005123263,0.0003348567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068959994,0.00092735625,0.0014458424,0.0013843027,0.002399617,0.00755904,0.0057776496,0.0036967166,0.009958105],"category_scores_gemma":[0.009628031,0.0010982779,0.0023069517,0.0022341646,0.0032352111,0.010986492,0.008620865,0.005241444,0.002997682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010146871,0.00011557783,0.00025275908,0.00006753738,0.000039349827,0.00022573645,0.0002868047,0.01668674,0.0017027291,0.9399272,0.0045640264,0.036029946],"study_design_scores_gemma":[0.0000488111,0.000043033226,0.00006419188,0.00004052394,0.00003694895,0.0003126618,0.00009449184,0.3211286,0.002810112,0.6482271,0.027153326,0.00004022914],"about_ca_topic_score_codex":0.0026945549,"about_ca_topic_score_gemma":0.0026029798,"teacher_disagreement_score":0.009958105,"about_ca_system_score_codex":0.0018324396,"about_ca_system_score_gemma":0.0029470592,"threshold_uncertainty_score":0.036469996},"labels":[],"label_agreement":null},{"id":"W125847312","doi":"10.1007/978-3-642-39112-5_45","title":"A Matrix Factorization Method for Mapping Items to Skills and for Enhancing Expert-Based Q-Matrices","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Factorization; Task (project management); Matrix decomposition; Artificial intelligence; Matrix (chemical analysis); Non-negative matrix factorization; Machine learning; Natural language processing; Algorithm","score_opus":0.023828639192894897,"score_gpt":0.3022398418829131,"score_spread":0.2784112026900182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125847312","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.0010497019,0.00007724825,0.9981008,0.000037843834,0.000036543363,0.000046724257,0.00008060788,0.00026941652,0.0003011578],"genre_scores_gemma":[0.025081145,0.00012500776,0.97217,0.00007748625,0.00005518787,0.00020780347,0.0003310027,0.00007467346,0.0018776809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845326,0.0006357964,0.000091004564,0.00032150702,0.00041543852,0.00008294013],"domain_scores_gemma":[0.995194,0.0029925797,0.00014329315,0.0004395417,0.0011143757,0.00011622795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024064356,0.0011585128,0.00087632565,0.0010279054,0.0006003684,0.00080536696,0.0012494631,0.0009864141,0.008535416],"category_scores_gemma":[0.007747655,0.0004102556,0.0012505042,0.001399961,0.0005198276,0.0015747944,0.0013274482,0.0016667426,0.0029762734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024340366,0.00027799298,0.00078970264,0.00034084244,0.00016408673,0.00007417108,0.00033032274,0.051038045,0.013289353,0.020027317,0.012650609,0.90077424],"study_design_scores_gemma":[0.00010281656,0.00027664035,0.0013280637,0.00007241365,0.00008376979,0.00021572712,0.00012372606,0.9320027,0.0089833485,0.044929378,0.011811665,0.000069729045],"about_ca_topic_score_codex":0.006912301,"about_ca_topic_score_gemma":0.008276826,"teacher_disagreement_score":0.008535416,"about_ca_system_score_codex":0.00037757237,"about_ca_system_score_gemma":0.0011432606,"threshold_uncertainty_score":0.028553784},"labels":[],"label_agreement":null},{"id":"W125856876","doi":"10.1007/978-3-642-31866-5_29","title":"Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scripting language; Hidden Markov model; Trainer; Generalization; Set (abstract data type); Artificial intelligence; Variation (astronomy); Machine learning; Human–computer interaction; Programming language","score_opus":0.043096085588531695,"score_gpt":0.2715792087605958,"score_spread":0.22848312317206412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125856876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11018372,0.00014848776,0.8821454,0.00019740798,0.0000937657,0.00019498442,0.00031131538,0.0026321292,0.0040928237],"genre_scores_gemma":[0.78394085,0.00011022469,0.2077266,0.00010573176,0.000022228858,0.00027113862,0.0009707954,0.00034514748,0.006507246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996,0.000107207044,0.000015734246,0.00011555807,0.00011211526,0.00004940494],"domain_scores_gemma":[0.99856406,0.00096346874,0.00007946924,0.00017701933,0.00014227364,0.00007374712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004910343,0.0009693007,0.0008122722,0.0004972528,0.00041398744,0.0007372142,0.0017640708,0.0012493666,0.0048136846],"category_scores_gemma":[0.0028392854,0.00088456215,0.001080429,0.00034175024,0.00073531,0.0010368692,0.0017373337,0.0011896936,0.00082582433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041992392,0.0002836716,0.0024198205,0.00022780495,0.000105019324,0.00045773524,0.0003552555,0.83049893,0.010351137,0.016992694,0.003411563,0.13447648],"study_design_scores_gemma":[0.000014311941,0.000038846203,0.00015908848,0.00000700738,0.000008729579,0.000034715937,0.00002434051,0.9919917,0.0020658767,0.0053037917,0.00034505484,0.0000065216377],"about_ca_topic_score_codex":0.0031992926,"about_ca_topic_score_gemma":0.004360326,"teacher_disagreement_score":0.0048136846,"about_ca_system_score_codex":0.0006628768,"about_ca_system_score_gemma":0.0005557,"threshold_uncertainty_score":0.016103327},"labels":[],"label_agreement":null},{"id":"W125925145","doi":"10.1007/978-3-319-04921-2_15","title":"Solving Equations on Words with Morphisms and Antimorphisms","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Solver; Boolean satisfiability problem; Computer science; Range (aeronautics); Morphism; Theoretical computer science; Representation (politics); Graph; System of linear equations; Satisfiability; Boolean data type; Algorithm; Applied mathematics; Discrete mathematics; Mathematics; Programming language","score_opus":0.020719302508557077,"score_gpt":0.24294149421585456,"score_spread":0.22222219170729748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125925145","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.034004815,0.00045574328,0.94015056,0.0006841583,0.00021188232,0.00007378776,0.00017170308,0.0006456117,0.023601731],"genre_scores_gemma":[0.26301506,0.0010265375,0.7035009,0.00034748417,0.00023340523,0.00014561605,0.00061118614,0.00080513855,0.030314613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986237,0.0004213297,0.00017104151,0.00028741203,0.00035356803,0.00014296669],"domain_scores_gemma":[0.9984609,0.0010966358,0.00006753874,0.00016456151,0.0001724131,0.00003795415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011736143,0.0011037745,0.0010795848,0.00084357586,0.0008123577,0.0021641776,0.0015400551,0.0011980844,0.011202545],"category_scores_gemma":[0.0058593918,0.00092790165,0.0022517198,0.001416686,0.0018798296,0.006697804,0.0038724283,0.0029312451,0.0021956165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000390135,0.000036668393,0.00051110703,0.00039805664,0.000049306207,0.00017807112,0.0009587385,0.008435242,0.0026963057,0.88347876,0.0048924326,0.098326266],"study_design_scores_gemma":[0.000021770273,0.000013462691,0.00007306214,0.000045710873,0.000030125173,0.00009838789,0.00013508792,0.016860709,0.002237314,0.96968377,0.01078392,0.000016790804],"about_ca_topic_score_codex":0.0009837112,"about_ca_topic_score_gemma":0.0014209545,"teacher_disagreement_score":0.011202545,"about_ca_system_score_codex":0.0007396903,"about_ca_system_score_gemma":0.00070503895,"threshold_uncertainty_score":0.03747624},"labels":[],"label_agreement":null},{"id":"W126306277","doi":"10.1007/978-3-319-11764-5_16","title":"Incremental Verification of Computing Policies","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","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 Alberta","funders":"","keywords":"Predicate (mathematical logic); Property (philosophy); Computer science; Set (abstract data type); Mathematical economics; Sequence (biology); Action (physics); Algorithm; Mathematics; Programming language; Philosophy; Epistemology","score_opus":0.014725737125482573,"score_gpt":0.2461241649650206,"score_spread":0.231398427839538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126306277","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.021728497,0.0002422357,0.96143967,0.00045594719,0.00015864312,0.00024623857,0.00034865658,0.009383576,0.0059966003],"genre_scores_gemma":[0.49995923,0.00025208967,0.49171582,0.00030159907,0.00015409256,0.00029587848,0.0013972837,0.0013401265,0.004583947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901502,0.0028829,0.0006513139,0.0017534466,0.0033085174,0.0012535783],"domain_scores_gemma":[0.9624379,0.022842566,0.0009721398,0.010510852,0.002762147,0.00047433306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054783574,0.0013693385,0.0015767713,0.0015433824,0.0012704821,0.0040625622,0.004788679,0.0016574606,0.009539078],"category_scores_gemma":[0.03127443,0.0015334242,0.0030384995,0.0014161349,0.0032784878,0.007412281,0.0064722504,0.0042969636,0.0022245666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014968686,0.00048061018,0.0030450244,0.000969379,0.00027521348,0.0005294402,0.00067975884,0.18765837,0.024939056,0.33417824,0.012383296,0.43336472],"study_design_scores_gemma":[0.00013060476,0.00011389257,0.00042170408,0.00009100316,0.00010791517,0.00013194884,0.000103610015,0.6475964,0.029149318,0.3161599,0.005935725,0.000057893918],"about_ca_topic_score_codex":0.0055798776,"about_ca_topic_score_gemma":0.006415217,"teacher_disagreement_score":0.009539078,"about_ca_system_score_codex":0.0027593814,"about_ca_system_score_gemma":0.0043938756,"threshold_uncertainty_score":0.031911373},"labels":[],"label_agreement":null},{"id":"W1265318270","doi":"10.1007/978-3-319-21996-7_15","title":"A Framework for Exogenous and Endogenous Reflexive Behavior in Virtual Characters","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reflexivity; Endogeny; Psychology; Chemistry; Sociology; Biochemistry; Social science","score_opus":0.09201246402892432,"score_gpt":0.3253964619389664,"score_spread":0.23338399791004205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1265318270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016345065,0.00056410034,0.87641263,0.0023922294,0.00017442711,0.00007599249,0.00014476769,0.00016565851,0.103725046],"genre_scores_gemma":[0.81935585,0.00058358075,0.14115293,0.0003705694,0.00021415252,0.00036816034,0.00010916593,0.00014278237,0.037702713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753666,0.0014192739,0.000109468965,0.00044315806,0.00024634815,0.00024493624],"domain_scores_gemma":[0.9955141,0.0029628878,0.00040269567,0.00057123875,0.0003279904,0.00022113377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028568967,0.00084356096,0.000639932,0.00076772243,0.0011351412,0.0042519816,0.0024642586,0.0025675138,0.016061751],"category_scores_gemma":[0.006320345,0.00062565337,0.0012621153,0.00075797306,0.005422737,0.0052417377,0.0026233878,0.0028791025,0.0013682005],"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.0000040868795,0.000009838484,0.000052990767,0.00001177426,0.0000046496234,0.00002028702,0.0001224372,0.0029493636,0.00007781045,0.9953193,0.00012414785,0.0013033483],"study_design_scores_gemma":[0.000011375252,0.000020042979,0.00011626239,0.0000148841955,0.000007663518,0.000033929344,0.00018147714,0.029837767,0.000094648196,0.96687263,0.0027978648,0.000011472804],"about_ca_topic_score_codex":0.0021385043,"about_ca_topic_score_gemma":0.0018035688,"teacher_disagreement_score":0.016061751,"about_ca_system_score_codex":0.0020726642,"about_ca_system_score_gemma":0.001452681,"threshold_uncertainty_score":0.05373192},"labels":[],"label_agreement":null},{"id":"W126663349","doi":"10.1007/978-3-319-08326-1_8","title":"On Interpreting Three-Way Decisions through Two-Way Decisions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Simplicity; Class (philosophy); Object (grammar); Management science; Risk analysis (engineering); Operations research; Artificial intelligence; Mathematics; Epistemology","score_opus":0.03275066419514459,"score_gpt":0.27958494665432265,"score_spread":0.24683428245917807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126663349","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.008990801,0.000467829,0.9648502,0.0010603814,0.00023236668,0.00008786534,0.00025108445,0.00037012715,0.023689454],"genre_scores_gemma":[0.2583737,0.0009394201,0.7281527,0.0005079517,0.00015502871,0.00021888233,0.0005816247,0.00020869572,0.010861999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966271,0.0015510987,0.00028317244,0.0005797304,0.00072734867,0.00023164955],"domain_scores_gemma":[0.9916164,0.006032405,0.00047723073,0.0009635004,0.0007524965,0.00015793841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004762899,0.0012159906,0.0009024875,0.0018786328,0.0011100518,0.006261049,0.001714915,0.0017449867,0.009141717],"category_scores_gemma":[0.015942581,0.0006147988,0.0023748553,0.0028484166,0.004840193,0.0144427195,0.0028986533,0.0027396246,0.0011513645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107871994,0.000033129065,0.0006162699,0.00022045356,0.000058101523,0.0004068105,0.002142062,0.0145822335,0.0013196495,0.90817255,0.0023714365,0.06996943],"study_design_scores_gemma":[0.000010371196,0.000018299643,0.0001720138,0.000075990596,0.000036663932,0.00011258499,0.00041343572,0.039149813,0.001178616,0.9501662,0.008635871,0.000030027431],"about_ca_topic_score_codex":0.00447437,"about_ca_topic_score_gemma":0.0036156764,"teacher_disagreement_score":0.009141717,"about_ca_system_score_codex":0.0012609324,"about_ca_system_score_gemma":0.0011643491,"threshold_uncertainty_score":0.03058207},"labels":[],"label_agreement":null},{"id":"W126702457","doi":"10.1007/978-3-662-45355-1_11","title":"Reinforcement Learning Using Monte Carlo Policy Estimation for Disaster Mitigation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Resilience and Vulnerability Analysis","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":"University of British Columbia","funders":"","keywords":"Computer science; Reinforcement learning; Novelty; Exploit; Interdependence; Risk analysis (engineering); Monte Carlo method; Critical infrastructure; Operations research; Artificial intelligence; Computer security","score_opus":0.009906396779310466,"score_gpt":0.24861383529399542,"score_spread":0.23870743851468496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126702457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009358237,0.0021348214,0.98165375,0.00047539908,0.00010103564,0.00004440905,0.000036561225,0.0004172475,0.0057786307],"genre_scores_gemma":[0.70424974,0.0029880812,0.28283504,0.0003207191,0.0002403287,0.00040083425,0.0001884506,0.00017991861,0.008596913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934477,0.0003862914,0.000023829733,0.000084171224,0.00011928317,0.000041665236],"domain_scores_gemma":[0.9959117,0.0036000642,0.00016336616,0.00008828758,0.00017645286,0.000060147904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015686114,0.00094774767,0.0009730851,0.00046686496,0.00029609908,0.0009568485,0.0010929675,0.0012618179,0.002911626],"category_scores_gemma":[0.0072859516,0.0004939283,0.0005341333,0.00068004086,0.0010376149,0.00087232474,0.0008147621,0.0019452967,0.00044844404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029388153,0.000023723269,0.00023130963,0.00003386051,0.000022905135,0.00001645408,0.00001811631,0.9744154,0.00013668578,0.007084514,0.0005068197,0.017480845],"study_design_scores_gemma":[0.000003478375,0.000006870815,0.000029030405,0.0000049222776,0.0000022234653,0.0000030835276,0.0000014572138,0.9949049,0.000066644825,0.0047205067,0.0002543623,0.000002531564],"about_ca_topic_score_codex":0.0074244677,"about_ca_topic_score_gemma":0.005013261,"teacher_disagreement_score":0.0074244677,"about_ca_system_score_codex":0.0014176449,"about_ca_system_score_gemma":0.0011856395,"threshold_uncertainty_score":0.014762521},"labels":[],"label_agreement":null},{"id":"W127098593","doi":"10.1007/978-3-642-00255-7_23","title":"Automatic Generation of Error Messages for the Symbolic Execution of EB3 Process Expressions","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Expression (computer science); Process (computing); Event (particle physics); Context (archaeology); Algorithm; Programming language","score_opus":0.04664825549852951,"score_gpt":0.2820094914093016,"score_spread":0.23536123591077207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127098593","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.044033043,0.00009929333,0.90768915,0.0002298003,0.00011827415,0.00018547288,0.0005716637,0.04293878,0.0041345027],"genre_scores_gemma":[0.47220314,0.00013648858,0.5115307,0.00020980835,0.000058810594,0.0002811258,0.0018192073,0.007374971,0.006385802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969945,0.00087203924,0.00020350827,0.0004041797,0.001217386,0.0003083963],"domain_scores_gemma":[0.98929006,0.0073925103,0.0007158666,0.0011659546,0.001292462,0.00014324421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023413505,0.0017042599,0.0008966437,0.0013935268,0.00071400154,0.0017757304,0.0016864127,0.001611454,0.010751237],"category_scores_gemma":[0.014626332,0.0007302083,0.0008752375,0.00074191124,0.0012548019,0.0016742504,0.0024278979,0.0014032258,0.0027945107],"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.0040282034,0.00056059053,0.008514177,0.0014533098,0.00019055423,0.0022469002,0.0030717195,0.1642076,0.09326172,0.06698151,0.022445038,0.63303864],"study_design_scores_gemma":[0.00017520577,0.00015547083,0.0007957264,0.00012883356,0.000077596946,0.0002773963,0.00016852106,0.8221228,0.14309126,0.022150759,0.010786428,0.00007005301],"about_ca_topic_score_codex":0.003212156,"about_ca_topic_score_gemma":0.0025682843,"teacher_disagreement_score":0.010751237,"about_ca_system_score_codex":0.00096426875,"about_ca_system_score_gemma":0.0014313305,"threshold_uncertainty_score":0.035966516},"labels":[],"label_agreement":null},{"id":"W1272904658","doi":"10.1007/978-3-642-40415-3_9","title":"Gendering the Machine: Preferred Virtual Assistant Gender and Realism in Self-Service","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sexuality, Behavior, and Technology","field":"Psychology","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Centre","funders":"","keywords":"Preference; Realism; Context (archaeology); Metaverse; Service (business); Computer science; Similarity (geometry); Human–computer interaction; Psychology; Virtual reality; Artificial intelligence; Visual arts; Art","score_opus":0.047726939560566936,"score_gpt":0.3037694361329233,"score_spread":0.25604249657235634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1272904658","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.34569004,0.0029325224,0.020586062,0.002933742,0.00045482538,0.00006239769,0.000062140614,0.00013581758,0.6271425],"genre_scores_gemma":[0.9607355,0.00060461526,0.0023326327,0.00021124863,0.00004973194,0.000016573671,0.000019432231,0.000044024273,0.0359863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999481,0.00025242733,0.00001313955,0.000052982698,0.0001383973,0.000062066996],"domain_scores_gemma":[0.99942005,0.0003228543,0.00005501574,0.000039300467,0.00006312032,0.00009967252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000872553,0.00027681404,0.00014281782,0.00029014313,0.00082254043,0.0030555672,0.00041494082,0.00052259327,0.0146429725],"category_scores_gemma":[0.002642888,0.000095125564,0.0001783752,0.00020333426,0.001768159,0.0018706387,0.0012224725,0.00080080325,0.0011946178],"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.0008985696,0.000431328,0.01317358,0.0004671981,0.000027077478,0.001052552,0.06378957,0.0010484925,0.014202133,0.5358965,0.01858065,0.3504323],"study_design_scores_gemma":[0.00012264964,0.0020339591,0.053005327,0.0010762778,0.00012207468,0.009732327,0.15177296,0.014983057,0.017082306,0.2805872,0.46930698,0.00017486191],"about_ca_topic_score_codex":0.000637446,"about_ca_topic_score_gemma":0.00086437346,"teacher_disagreement_score":0.0146429725,"about_ca_system_score_codex":0.00060776045,"about_ca_system_score_gemma":0.00043903888,"threshold_uncertainty_score":0.04898566},"labels":[],"label_agreement":null},{"id":"W127454879","doi":"10.1007/978-3-662-44739-0_4","title":"How to Recognize a Creative SME?","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Creativity in Education and Neuroscience","field":"Psychology","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.03927500324228165,"score_gpt":0.3249604009301719,"score_spread":0.28568539768789025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127454879","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.052148763,0.032676097,0.15674672,0.12015305,0.010109591,0.00011902096,0.0002131139,0.0015420961,0.6262916],"genre_scores_gemma":[0.57802397,0.0204868,0.11630361,0.015374383,0.003654124,0.00014502417,0.00036348222,0.0007981093,0.26485053],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956006,0.000085150896,0.000032172826,0.00008759002,0.00015850387,0.000076546145],"domain_scores_gemma":[0.9986883,0.0005033144,0.000104377425,0.00014767142,0.00034045032,0.00021588909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011300284,0.0006029141,0.00037602658,0.0007860288,0.0009311896,0.0060268715,0.00096644997,0.002262768,0.010385339],"category_scores_gemma":[0.0044328035,0.00024164552,0.000484899,0.00047852937,0.0034753163,0.010092283,0.0024475523,0.003477216,0.005783563],"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.000111567395,0.00009322285,0.0022734269,0.0005443927,0.000035038644,0.0016180819,0.0062692664,0.0006280265,0.009382513,0.31451458,0.09889584,0.565634],"study_design_scores_gemma":[0.000021312277,0.000105901745,0.002096798,0.0010394752,0.00002866196,0.009660717,0.012565879,0.0052269413,0.0076268786,0.5222846,0.43924668,0.00009620796],"about_ca_topic_score_codex":0.0006406928,"about_ca_topic_score_gemma":0.0007745547,"teacher_disagreement_score":0.010385339,"about_ca_system_score_codex":0.0005849328,"about_ca_system_score_gemma":0.0007770927,"threshold_uncertainty_score":0.034742415},"labels":[],"label_agreement":null},{"id":"W127597465","doi":"10.1007/978-3-642-39955-8_7","title":"Automatically Repairing Concurrency Bugs with ARC","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Concurrency; Crossover; Correctness; Java; Synchronization (alternating current); Programming language; Genetic algorithm; Parallel computing; Distributed computing; Artificial intelligence","score_opus":0.01690706949741025,"score_gpt":0.2442023236193368,"score_spread":0.22729525412192655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127597465","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.037413035,0.0006083513,0.9180197,0.00026340946,0.00016577465,0.00009945241,0.00028741418,0.038244855,0.0048981146],"genre_scores_gemma":[0.26946038,0.00029687057,0.7202854,0.000112953174,0.000039201062,0.0000568039,0.0008045761,0.0027127333,0.0062310915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824166,0.00025635873,0.00013130448,0.0004198341,0.0007944188,0.00015640259],"domain_scores_gemma":[0.9933009,0.00325048,0.0005490869,0.0020063054,0.00077792205,0.000115238305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012346884,0.0014207541,0.0010475212,0.0019701885,0.0005811415,0.00095559214,0.002663564,0.0009975629,0.008657321],"category_scores_gemma":[0.00620644,0.0009516924,0.0011498005,0.0015168786,0.0012236492,0.0030550852,0.0022340552,0.0016462557,0.0019354664],"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.0005457709,0.00026628928,0.0033555657,0.0011093545,0.00011144014,0.0006525152,0.00038849088,0.06316775,0.026838077,0.019808112,0.012730523,0.87102616],"study_design_scores_gemma":[0.0002210534,0.0003751219,0.0014028528,0.00024042855,0.00035413753,0.002087845,0.00026665756,0.75633514,0.13245559,0.072130136,0.034015983,0.00011495397],"about_ca_topic_score_codex":0.0020851276,"about_ca_topic_score_gemma":0.0028479276,"teacher_disagreement_score":0.008657321,"about_ca_system_score_codex":0.00045937972,"about_ca_system_score_gemma":0.0010667004,"threshold_uncertainty_score":0.028961599},"labels":[],"label_agreement":null},{"id":"W127787461","doi":"10.1007/978-3-642-35999-6_8","title":"Cryptographically Strong de Bruijn Sequences with Large Periods","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Computer science; Combinatorics; Mathematics","score_opus":0.01049555853560011,"score_gpt":0.2268672857817493,"score_spread":0.2163717272461492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127787461","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.20411952,0.0034900305,0.5711205,0.005642627,0.0015515833,0.00029029898,0.00060155767,0.0012003259,0.21198347],"genre_scores_gemma":[0.8500692,0.0020724952,0.0874274,0.00067778875,0.0010653874,0.0003537549,0.00036313233,0.00036581958,0.057605013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821764,0.0005480236,0.00010928242,0.00020164931,0.0006722208,0.0002511688],"domain_scores_gemma":[0.9944734,0.003071725,0.00051022676,0.0013205033,0.0003641915,0.00025990265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016822915,0.0008950146,0.00066823635,0.001304457,0.0012738567,0.0030283516,0.00079304597,0.0012685021,0.006975122],"category_scores_gemma":[0.007551775,0.0009183169,0.00046075566,0.0015487942,0.0028052083,0.005595149,0.0030204814,0.0037263155,0.0030166956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120669014,0.000022454946,0.00009150707,0.000099408346,0.000007694347,0.00007560137,0.00009702317,0.0028806748,0.0037502067,0.97026896,0.0021699532,0.020415874],"study_design_scores_gemma":[0.000036670368,0.000063208325,0.00009782532,0.000040752526,0.0000108027325,0.00026535292,0.000034795143,0.008661875,0.0069697355,0.970674,0.013121161,0.00002394806],"about_ca_topic_score_codex":0.000072641364,"about_ca_topic_score_gemma":0.00010857869,"teacher_disagreement_score":0.006975122,"about_ca_system_score_codex":0.0009066638,"about_ca_system_score_gemma":0.0010928286,"threshold_uncertainty_score":0.023334086},"labels":[],"label_agreement":null},{"id":"W128448726","doi":"10.1007/978-3-662-45523-4_17","title":"On Evolving Multi-agent FX Traders","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Dalhousie University","funders":"","keywords":"Business; Computer science","score_opus":0.038052861172623055,"score_gpt":0.2206061480008224,"score_spread":0.18255328682819935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128448726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118547976,0.0033757368,0.8250417,0.002470724,0.000877087,0.000076961245,0.0001300411,0.00019392038,0.049285937],"genre_scores_gemma":[0.9093688,0.0025813563,0.047491543,0.00046100913,0.0005618643,0.00009115515,0.00016139778,0.0001272245,0.039155636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969983,0.00012154311,0.000016716602,0.00005634299,0.00006468787,0.00004085825],"domain_scores_gemma":[0.99774927,0.0016495998,0.00017090038,0.000108795015,0.0001525762,0.00016885457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013153515,0.0009717418,0.0011216294,0.0007148021,0.00062131346,0.0020590443,0.0014213814,0.0024226073,0.006191429],"category_scores_gemma":[0.008476069,0.0005222532,0.0006630146,0.00064307364,0.002103329,0.003018291,0.0028658463,0.0016538147,0.0004632412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001677968,0.000049512495,0.0013842187,0.00009644668,0.000067711066,0.00034611588,0.00025908646,0.5408137,0.0013519404,0.4267941,0.0030239378,0.025645379],"study_design_scores_gemma":[0.00001957395,0.00001870924,0.00010632216,0.000010926154,0.000008694516,0.000038233436,0.000020963307,0.89265144,0.0000949686,0.10605107,0.00097175204,0.0000073574297],"about_ca_topic_score_codex":0.0017665168,"about_ca_topic_score_gemma":0.0007744307,"teacher_disagreement_score":0.006191429,"about_ca_system_score_codex":0.0006525904,"about_ca_system_score_gemma":0.00042497757,"threshold_uncertainty_score":0.020712376},"labels":[],"label_agreement":null},{"id":"W128638405","doi":"10.1007/978-3-540-78791-4_11","title":"Compiler-Guaranteed Safety in Code-Copying Virtual Machines","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Copying; Compiler; Programming language; Dead code elimination; Just-in-time compilation; Code generation; Machine code; Programmer; Code (set theory); Source code; Virtual machine; Parallel computing; Operating system; Object code; Key (lock); Set (abstract data type)","score_opus":0.017167235097016377,"score_gpt":0.2536954088233018,"score_spread":0.23652817372628546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128638405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08404931,0.0012674605,0.88309735,0.00087174523,0.00027271023,0.00012327197,0.00010325752,0.009697483,0.020517373],"genre_scores_gemma":[0.7686847,0.00095691753,0.21158734,0.00029522835,0.00024637723,0.0002569074,0.00021447719,0.003479224,0.014278843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972402,0.00060802046,0.00015088894,0.00029440553,0.0013885128,0.00031800487],"domain_scores_gemma":[0.99164563,0.0037272805,0.00048043267,0.0032782978,0.00073931005,0.00012903962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018668283,0.0006522531,0.00073880656,0.00060243043,0.0009832062,0.0020131087,0.0023958394,0.0010925438,0.0026634182],"category_scores_gemma":[0.010354715,0.0008624783,0.000875295,0.0006305781,0.0036708133,0.002972352,0.0029426378,0.0027068546,0.0009869392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043807493,0.000076929544,0.001654833,0.0005873585,0.000051019273,0.00061782624,0.001318143,0.105283804,0.04392858,0.6576545,0.008821163,0.17956765],"study_design_scores_gemma":[0.000106989944,0.00018965849,0.0005910146,0.00015195928,0.00006625719,0.0006621263,0.0001121077,0.3198689,0.15053366,0.48979557,0.037845958,0.00007582571],"about_ca_topic_score_codex":0.000943009,"about_ca_topic_score_gemma":0.000513332,"teacher_disagreement_score":0.0026634182,"about_ca_system_score_codex":0.0009937785,"about_ca_system_score_gemma":0.0019122325,"threshold_uncertainty_score":0.009872854},"labels":[],"label_agreement":null},{"id":"W128989871","doi":"10.1007/978-3-319-13174-0_19","title":"ICPN: An Inter-Cloud Polymorphic Network Proposal","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Université du Québec à Montréal","funders":"","keywords":"Downtime; Cloud computing; Computer science; Computer network; Network packet; Bandwidth (computing); The Internet; Distributed computing; Operating system","score_opus":0.012034761059733801,"score_gpt":0.2257787669137146,"score_spread":0.2137440058539808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128989871","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.013328733,0.0006847624,0.8421915,0.005285631,0.0038199278,0.0010433306,0.00039414465,0.007069011,0.126183],"genre_scores_gemma":[0.29429528,0.0013516175,0.5652947,0.0024414123,0.0009562013,0.001177787,0.0011150073,0.0018902882,0.13147773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981857,0.00029978924,0.000061145016,0.00025124816,0.000862105,0.00034003734],"domain_scores_gemma":[0.99855405,0.00012849741,0.000045262957,0.000491896,0.0004920903,0.0002882514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027578596,0.00059492263,0.00037402983,0.0006259242,0.0017334512,0.0033768837,0.0030025383,0.0016548133,0.011926816],"category_scores_gemma":[0.0029778797,0.00050103385,0.00048414044,0.00084941846,0.0010770664,0.004371577,0.004329002,0.0032377064,0.003469642],"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.0003770486,0.00024190279,0.0007729352,0.00022054013,0.000027868224,0.00031047311,0.0002805062,0.011526893,0.007913743,0.63132,0.10642958,0.24057852],"study_design_scores_gemma":[0.00013354457,0.00027235245,0.0005075913,0.00013634484,0.00006732459,0.0009384182,0.0002651895,0.15341122,0.022026254,0.18199648,0.64015543,0.000089935565],"about_ca_topic_score_codex":0.002273639,"about_ca_topic_score_gemma":0.003821854,"teacher_disagreement_score":0.011926816,"about_ca_system_score_codex":0.0017601681,"about_ca_system_score_gemma":0.00256725,"threshold_uncertainty_score":0.03989923},"labels":[],"label_agreement":null},{"id":"W129093026","doi":"10.1007/978-3-319-07890-8_10","title":"Synchronized Dancing of Oblivious Chameleons","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; University of Ottawa","funders":"","keywords":"Dance; Choreography; Computer science; Asynchronous communication; Sequence (biology); Visual arts; Art; Biology","score_opus":0.014815554599129825,"score_gpt":0.24394471304628135,"score_spread":0.2291291584471515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129093026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2366334,0.0013570639,0.54821694,0.0010449161,0.00076326367,0.0002919735,0.00062255375,0.003961733,0.20710813],"genre_scores_gemma":[0.85630536,0.00048613932,0.05373803,0.00023064457,0.00011259494,0.00027701008,0.00045952466,0.0009494869,0.087441176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.00019160696,0.000042212712,0.0001795395,0.000245755,0.00024170878],"domain_scores_gemma":[0.99777585,0.00080767204,0.00009821623,0.0010048838,0.00016678903,0.00014656299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060283364,0.00073807605,0.001404764,0.0011002341,0.0024757148,0.002071709,0.0020669047,0.0014155464,0.041993245],"category_scores_gemma":[0.004507475,0.0005946205,0.00064954866,0.0015334323,0.001848104,0.004410622,0.00446704,0.0018425321,0.004646384],"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.00076890475,0.000089264075,0.0003488523,0.00018284087,0.000053917414,0.0001740311,0.00056555186,0.04804663,0.0071650296,0.84590065,0.010621339,0.086082995],"study_design_scores_gemma":[0.00010066933,0.00013238224,0.00021279305,0.000080382306,0.00002972016,0.00012941135,0.0002470795,0.19502693,0.0062571215,0.7783495,0.019389242,0.000044724045],"about_ca_topic_score_codex":0.0010860624,"about_ca_topic_score_gemma":0.0019823867,"teacher_disagreement_score":0.041993245,"about_ca_system_score_codex":0.00093491276,"about_ca_system_score_gemma":0.0008794625,"threshold_uncertainty_score":0.14048135},"labels":[],"label_agreement":null},{"id":"W129298735","doi":"10.1007/978-3-540-39611-6_4","title":"On-demand Routing in MANETs: The Impact of a Realistic Physical Layer Model","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Layer (electronics); Routing (electronic design automation); Physical layer; Computer network; Distributed computing; Telecommunications; Wireless","score_opus":0.020117833602280377,"score_gpt":0.2748774028256888,"score_spread":0.2547595692234084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129298735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29391444,0.008736606,0.61481637,0.0059741056,0.0015596955,0.00019439809,0.0008181134,0.00060602697,0.0733803],"genre_scores_gemma":[0.9621819,0.0036411833,0.022650618,0.00031260724,0.00030305353,0.00006270131,0.00018763727,0.00015340088,0.0105069885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988525,0.00052023755,0.000027533823,0.00012242256,0.0003230173,0.00015430493],"domain_scores_gemma":[0.99704844,0.00211692,0.00016805137,0.0002931413,0.00026964856,0.000103791564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013794255,0.0008148227,0.0012667364,0.00041853925,0.000682903,0.0020287992,0.0021819263,0.0019939807,0.0027978003],"category_scores_gemma":[0.006382905,0.00095761917,0.0005735469,0.00088423846,0.0010183665,0.0047954014,0.0010784761,0.0014199499,0.00039894378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006132148,0.000059303973,0.00015681914,0.000059676036,0.000014586008,0.000067348024,0.000027120748,0.97035944,0.0007108602,0.022995371,0.0013126945,0.00417543],"study_design_scores_gemma":[0.000007500938,0.000018823952,0.000052157233,0.0000071284667,0.000008037506,0.000028691771,0.0000118015205,0.99215204,0.000114118346,0.0072316597,0.0003618453,0.0000062571576],"about_ca_topic_score_codex":0.004559558,"about_ca_topic_score_gemma":0.00474429,"teacher_disagreement_score":0.004559558,"about_ca_system_score_codex":0.001761894,"about_ca_system_score_gemma":0.0007601184,"threshold_uncertainty_score":0.012783527},"labels":[],"label_agreement":null},{"id":"W129316467","doi":"10.1007/978-3-642-30353-1_37","title":"A Multiagent System to Solve JSSP Using a Multi-Population Cultural Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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 Windsor","funders":"","keywords":"Computer science; Population; Multi-agent system; Convergence (economics); Scheduling (production processes); Artificial intelligence; Distributed computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.05702662813677803,"score_gpt":0.32145490471459465,"score_spread":0.26442827657781665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129316467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029215666,0.00019406348,0.9624163,0.000165533,0.00014266651,0.00011743489,0.000022546765,0.00048169156,0.0072440677],"genre_scores_gemma":[0.3241229,0.00016323436,0.67004937,0.0001416761,0.00006508004,0.0004180659,0.00007066758,0.00008546505,0.004883525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.00008386971,0.00001689048,0.000042910953,0.00007170774,0.000025081159],"domain_scores_gemma":[0.99963987,0.00014959558,0.000026657703,0.000040426705,0.00010762385,0.000035761535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006381621,0.0005944791,0.0007095409,0.00044536742,0.0008835685,0.0008384914,0.0014747587,0.0013890278,0.0027324203],"category_scores_gemma":[0.0015017871,0.00029922384,0.0006995938,0.00046706284,0.00046733892,0.000636884,0.0011439812,0.0010871285,0.00043009254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007390623,0.0001939658,0.0006439196,0.00012623232,0.00010400019,0.00024001037,0.00024574518,0.8315067,0.010532964,0.018159684,0.0020928518,0.13608],"study_design_scores_gemma":[0.000019439656,0.00004439211,0.000071261886,0.000006731884,0.000014850376,0.000025135585,0.000017897808,0.99665415,0.00082516926,0.0014531728,0.0008617404,0.000006111939],"about_ca_topic_score_codex":0.0034783562,"about_ca_topic_score_gemma":0.0035279451,"teacher_disagreement_score":0.0034783562,"about_ca_system_score_codex":0.00041011642,"about_ca_system_score_gemma":0.0007882152,"threshold_uncertainty_score":0.009140849},"labels":[],"label_agreement":null},{"id":"W129331935","doi":"10.1007/978-3-642-34129-8_9","title":"Group Behavior Metrics for P2P Botnet Detection","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 New Brunswick","funders":"","keywords":"Botnet; Computer science; Group (periodic table); Computer security; The Internet; Protocol (science); Data mining; World Wide Web","score_opus":0.022546832165951155,"score_gpt":0.2482978854135038,"score_spread":0.22575105324755265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129331935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24378435,0.004852873,0.7319962,0.0003788831,0.0003220635,0.00044403184,0.003830896,0.0057905684,0.008600172],"genre_scores_gemma":[0.7698976,0.0006651438,0.22171418,0.00006379363,0.00013997608,0.00036237916,0.0041063013,0.00027388256,0.002776663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964897,0.0007589906,0.00028559365,0.00042111712,0.0018337994,0.00021084078],"domain_scores_gemma":[0.99072975,0.004134667,0.001113605,0.001204356,0.002315721,0.00050190854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024412712,0.0013260026,0.0014910947,0.004941177,0.00062383467,0.001194594,0.0012154382,0.00090291107,0.0017829066],"category_scores_gemma":[0.0117719835,0.00031702121,0.00046968315,0.0038779892,0.00047935615,0.0023630937,0.0011439807,0.0009202259,0.000777189],"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.0009851567,0.0005805777,0.078382514,0.00056941505,0.00025289072,0.00016492316,0.0004080735,0.06796544,0.024134984,0.011298271,0.016089195,0.7991686],"study_design_scores_gemma":[0.000033788,0.00088938524,0.03517552,0.00010444195,0.0000984295,0.0007243696,0.0002748466,0.91973996,0.01857721,0.017519902,0.006783609,0.00007852245],"about_ca_topic_score_codex":0.0017751235,"about_ca_topic_score_gemma":0.0021322505,"teacher_disagreement_score":0.004941177,"about_ca_system_score_codex":0.0011036805,"about_ca_system_score_gemma":0.0005591116,"threshold_uncertainty_score":0.012910843},"labels":[],"label_agreement":null},{"id":"W129386544","doi":"10.1007/978-3-642-39241-2_10","title":"Two Solitudes Revisited: A Cross-Cultural Exploration of Online Image Searcher’s Behaviors","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"McGill University","funders":"","keywords":"Computer science; Point (geometry); Context (archaeology); Image retrieval; Exploratory search; Information retrieval; Image (mathematics); Interface (matter); User interface; Exploratory research; World Wide Web; Human–computer interaction; Artificial intelligence; Sociology","score_opus":0.05250961328799707,"score_gpt":0.3545263119278233,"score_spread":0.3020166986398262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129386544","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.9959882,0.00012554714,0.00042664696,0.0002276793,0.000009287777,0.000010026109,0.000033315828,0.0000063094603,0.003172941],"genre_scores_gemma":[0.99832624,0.000093411916,0.0004005729,0.00011621088,0.0000044902376,0.000013222928,0.0000543881,0.000016064172,0.0009753803],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99836,0.0010246395,0.00006874116,0.00015370859,0.0002611285,0.000131785],"domain_scores_gemma":[0.98688114,0.009410698,0.0012833559,0.0007440008,0.0010321283,0.00064868457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004012231,0.00022084184,0.0002830194,0.0019196816,0.0020027347,0.00445125,0.0008447656,0.0009213156,0.0021643734],"category_scores_gemma":[0.016870297,0.00026853583,0.00023493235,0.0019329342,0.0029087756,0.004758297,0.0027942026,0.0016072079,0.00028359797],"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.00017525525,0.00013470928,0.05626861,0.000077904966,0.0000372908,0.00026705526,0.9168155,0.000093310664,0.0021689867,0.0035171513,0.0008478165,0.019596418],"study_design_scores_gemma":[0.000018344515,0.00013763754,0.1383824,0.000103522194,0.000034246124,0.00056368456,0.8444323,0.0014321557,0.0014487521,0.0023530668,0.011012548,0.00008134226],"about_ca_topic_score_codex":0.009636181,"about_ca_topic_score_gemma":0.016258117,"teacher_disagreement_score":0.009636181,"about_ca_system_score_codex":0.0011712841,"about_ca_system_score_gemma":0.00081528514,"threshold_uncertainty_score":0.021218956},"labels":[],"label_agreement":null},{"id":"W129750013","doi":"10.1007/978-3-319-10581-9_36","title":"Solutions for Missing Parameters in Computer-Aided Diagnosis with Multiparametric Imaging Data","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"MRI in cancer diagnosis","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Missing data; Computer science; Artificial intelligence; Classifier (UML); Dynamic contrast-enhanced MRI; Pattern recognition (psychology); Machine learning; Magnetic resonance imaging; Data mining; Radiology; Medicine","score_opus":0.0693963767667325,"score_gpt":0.31141310759079593,"score_spread":0.24201673082406344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129750013","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.0016222575,0.0004607559,0.99726945,0.00018441884,0.000032937456,0.000015517757,0.000048956616,0.00013611036,0.00022959482],"genre_scores_gemma":[0.0962699,0.0013502991,0.89800155,0.00017857032,0.00017635296,0.00017251782,0.0004615315,0.00021419246,0.003175082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984377,0.00054550514,0.00013892079,0.00035837968,0.0004126255,0.00010683431],"domain_scores_gemma":[0.99027467,0.007741598,0.0003574735,0.00064718456,0.000851722,0.00012736565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039546615,0.0015018729,0.0022099032,0.0009881284,0.0006472163,0.0019389328,0.0032976624,0.0037906417,0.00423037],"category_scores_gemma":[0.020583715,0.0017866481,0.0016653776,0.0011863778,0.0014147122,0.0029134802,0.003676096,0.0036035022,0.000988232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030200867,0.000110621884,0.0009452752,0.00122924,0.00019900303,0.00047849125,0.0004914253,0.53671396,0.006883437,0.044509094,0.006265627,0.4018718],"study_design_scores_gemma":[0.000024206647,0.00003906358,0.00018103638,0.000075234864,0.000037027286,0.00021020023,0.00007386657,0.9484024,0.0034507946,0.044768132,0.0027073799,0.000030726693],"about_ca_topic_score_codex":0.003186507,"about_ca_topic_score_gemma":0.0026172143,"teacher_disagreement_score":0.00423037,"about_ca_system_score_codex":0.00064957223,"about_ca_system_score_gemma":0.0015831761,"threshold_uncertainty_score":0.020914495},"labels":[],"label_agreement":null},{"id":"W1297928","doi":"10.1007/11755494_13","title":"Well-Being to “Well Done!”: The Development Cycle in Role-Playing Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Computer science; Video game development; Human–computer interaction; Game design","score_opus":0.009708187574522102,"score_gpt":0.24561754202317584,"score_spread":0.23590935444865374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1297928","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.27192533,0.0058251014,0.03605779,0.016968902,0.00022201469,0.00032489182,0.00015600407,0.00014244745,0.6683775],"genre_scores_gemma":[0.968684,0.0012907682,0.009249732,0.0002813953,0.00000945477,0.00014532766,0.00006476339,0.00008698177,0.020187508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984499,0.0009402589,0.000038797647,0.00013195597,0.00024753547,0.00019145485],"domain_scores_gemma":[0.99713767,0.0013981693,0.00018744834,0.00014094665,0.00036415085,0.0007717265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028329715,0.0004477386,0.00024938464,0.000706552,0.0025351185,0.0068890606,0.0012685257,0.0016049242,0.009684118],"category_scores_gemma":[0.007868922,0.0005530132,0.00024376521,0.0009055458,0.00566201,0.007062752,0.003760425,0.0021617922,0.0009860379],"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.000084896325,0.0002623859,0.005960013,0.00013570457,0.00000871603,0.00031768097,0.044103093,0.0008059607,0.00083705556,0.8422491,0.0052203396,0.10001511],"study_design_scores_gemma":[0.00004992507,0.00028619007,0.020564541,0.0006556343,0.00002259932,0.0007446072,0.07540579,0.007166703,0.0021162885,0.69691926,0.19599213,0.00007625918],"about_ca_topic_score_codex":0.0053825737,"about_ca_topic_score_gemma":0.006862384,"teacher_disagreement_score":0.009684118,"about_ca_system_score_codex":0.0035017028,"about_ca_system_score_gemma":0.004948223,"threshold_uncertainty_score":0.032396615},"labels":[],"label_agreement":null},{"id":"W129922042","doi":"10.1007/978-3-642-23629-7_75","title":"Point-to-Volume Registration of Prostate Implants to Ultrasound","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"Queen's University","funders":"National Cancer Institute","keywords":"Computer science; Imaging phantom; Image registration; Artificial intelligence; Segmentation; Computer vision; Fluoroscopy; Thresholding; Volume (thermodynamics); 3D ultrasound; Ultrasound; Ground truth; Prostate brachytherapy; Metric (unit); Brachytherapy; Medicine; Nuclear medicine; Image (mathematics); Radiology; Radiation therapy","score_opus":0.011596807075148053,"score_gpt":0.26564301847143956,"score_spread":0.2540462113962915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129922042","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.08697094,0.0026401037,0.90087456,0.00025952124,0.00021023926,0.00027872104,0.00061917165,0.003995664,0.0041510924],"genre_scores_gemma":[0.68584335,0.0021036707,0.2998628,0.00014793672,0.00015704587,0.00023154516,0.0012069505,0.0013478202,0.009098906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915326,0.00022682906,0.00005434954,0.00011577011,0.00037192955,0.00007787544],"domain_scores_gemma":[0.9991116,0.00033096073,0.00010379073,0.00024300379,0.00017402059,0.00003669326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009902215,0.00071607204,0.0008466404,0.0015642815,0.00038494566,0.0024149904,0.0011446903,0.0013548526,0.0047990414],"category_scores_gemma":[0.00488952,0.00082067354,0.0010536144,0.001897768,0.00048108646,0.00090166234,0.0016559496,0.0011886,0.002379331],"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.0020668975,0.00023481948,0.006450345,0.00068299397,0.00016948435,0.0005777041,0.00067014404,0.115587026,0.16430672,0.00677101,0.008064327,0.69441855],"study_design_scores_gemma":[0.00015773947,0.0013572412,0.023697827,0.00016738773,0.00023137628,0.0056445193,0.00044608515,0.68040997,0.24592315,0.012866576,0.028846877,0.00025118844],"about_ca_topic_score_codex":0.0021511847,"about_ca_topic_score_gemma":0.0019225441,"teacher_disagreement_score":0.0047990414,"about_ca_system_score_codex":0.00035952905,"about_ca_system_score_gemma":0.0011425894,"threshold_uncertainty_score":0.016054392},"labels":[],"label_agreement":null},{"id":"W129927049","doi":"10.1007/978-3-642-20841-6_17","title":"Spatial Entropy-Based Clustering for Mining Data with Spatial Correlation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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":"Spatial analysis; Cluster analysis; Spatial correlation; Computer science; Data mining; Entropy (arrow of time); Similarity (geometry); Spatial dependence; Pattern recognition (psychology); Spatial relation; Correlation; Spatial database; Artificial intelligence; Mathematics; Statistics","score_opus":0.045589914004622825,"score_gpt":0.2901130431364683,"score_spread":0.24452312913184548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129927049","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.02443705,0.00080072676,0.97241706,0.000099722914,0.000051818773,0.00006413335,0.00038052857,0.0005079478,0.0012409902],"genre_scores_gemma":[0.36051196,0.00089513336,0.63351375,0.00009663956,0.00018315649,0.00021583312,0.0022320116,0.00015373321,0.0021978319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986129,0.00024924244,0.0001352977,0.00023301312,0.0007007759,0.00006866906],"domain_scores_gemma":[0.9984034,0.0008230019,0.0001504212,0.00021784536,0.0003619739,0.000043372936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013716768,0.0006093633,0.0011737109,0.0030252882,0.00069445104,0.00117137,0.0012817913,0.0006616827,0.0010482151],"category_scores_gemma":[0.00426442,0.00040361428,0.0011310988,0.004393162,0.00070352684,0.0015286766,0.0013207934,0.00079613226,0.00056898413],"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.00051365595,0.00025110404,0.012454237,0.0006915059,0.00068091234,0.00030236808,0.0004714806,0.23062825,0.023350922,0.038528923,0.007301982,0.68482476],"study_design_scores_gemma":[0.000017892125,0.000075942575,0.0058080642,0.000037542704,0.000100568235,0.00028821762,0.000087125074,0.9535387,0.008151526,0.029421365,0.0024300222,0.000043095333],"about_ca_topic_score_codex":0.0019508861,"about_ca_topic_score_gemma":0.003035348,"teacher_disagreement_score":0.0030252882,"about_ca_system_score_codex":0.0007191467,"about_ca_system_score_gemma":0.00087149354,"threshold_uncertainty_score":0.007254243},"labels":[],"label_agreement":null},{"id":"W130096246","doi":"10.1007/978-3-642-39038-8_27","title":"Simple Profile Rectifications Go a Long Way","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Speedup; Simple (philosophy); Profiling (computer programming); Scripting language; Algorithm; Parallel computing; Programming language","score_opus":0.020890440091589992,"score_gpt":0.2620434682541749,"score_spread":0.2411530281625849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130096246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00784796,0.0018962184,0.9224214,0.002665112,0.0027866361,0.00013972193,0.0003049303,0.0076826443,0.054255344],"genre_scores_gemma":[0.11768053,0.0026306321,0.7323617,0.0022360776,0.0010532317,0.00015780586,0.0007774732,0.0057914075,0.13731125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.00009629603,0.000069812086,0.00020559519,0.00045987742,0.000095229894],"domain_scores_gemma":[0.9982718,0.00020592731,0.00008111039,0.0010863866,0.00028361139,0.00007113482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462238,0.0015559759,0.0012807869,0.0009247115,0.0011877278,0.002403692,0.002092417,0.00202211,0.03210112],"category_scores_gemma":[0.0039295517,0.00084391626,0.0011843471,0.0008483038,0.0020292182,0.0069172224,0.0031595163,0.0054969825,0.022047322],"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.00025369457,0.00006653342,0.0002606606,0.0003109914,0.000058657166,0.00021521785,0.00022019033,0.003994108,0.021189008,0.19138125,0.046685807,0.7353639],"study_design_scores_gemma":[0.000102953956,0.00020933658,0.00062393665,0.00023818575,0.0000884837,0.0018573479,0.00031996059,0.038335357,0.049114604,0.4433335,0.46557927,0.00019707669],"about_ca_topic_score_codex":0.00052537624,"about_ca_topic_score_gemma":0.00076920865,"teacher_disagreement_score":0.03210112,"about_ca_system_score_codex":0.00049434096,"about_ca_system_score_gemma":0.0005315322,"threshold_uncertainty_score":0.10738897},"labels":[],"label_agreement":null},{"id":"W130143918","doi":"10.1007/978-3-642-33509-9_45","title":"Fault-Tolerant Control of a Class of Switched Nonlinear Systems with Application to Flight Control","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Actuator; Control theory (sociology); Computer science; Nonlinear system; Fault tolerance; Controller (irrigation); Fault (geology); Class (philosophy); Control engineering; Control (management); Engineering; Artificial intelligence; Distributed computing","score_opus":0.0075787407364346,"score_gpt":0.2085811464125756,"score_spread":0.201002405676141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130143918","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.11706372,0.007488583,0.833886,0.0005826374,0.0006745428,0.00007062641,0.00013666697,0.000606258,0.039490983],"genre_scores_gemma":[0.95418525,0.002904699,0.029174821,0.000101464226,0.00023447388,0.00004807663,0.00011778568,0.00003186818,0.01320159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999523,0.0000058724836,0.0000029380108,0.000010244226,0.00002121979,0.0000073837496],"domain_scores_gemma":[0.99993134,0.000030637384,0.000008581472,0.0000065177896,0.000017894023,0.0000049957616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008597425,0.00039460778,0.00033706863,0.00026050862,0.00024750503,0.000562203,0.00040642062,0.00044729625,0.0019376904],"category_scores_gemma":[0.00028057722,0.0000858268,0.00030416754,0.00036912132,0.00030084173,0.000281027,0.00021792455,0.0004466195,0.00018333319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002547432,0.000121679564,0.00082818477,0.0005600709,0.000080190155,0.0005934474,0.00039892818,0.39041153,0.08278054,0.15098129,0.006902534,0.36608675],"study_design_scores_gemma":[0.000015474463,0.00020542734,0.00059429446,0.000025986097,0.000023815071,0.00026784575,0.000035916324,0.94652575,0.005361239,0.038535528,0.008395262,0.000013531089],"about_ca_topic_score_codex":0.0010020984,"about_ca_topic_score_gemma":0.0007914859,"teacher_disagreement_score":0.0019376904,"about_ca_system_score_codex":0.00017441141,"about_ca_system_score_gemma":0.00015359856,"threshold_uncertainty_score":0.006482184},"labels":[],"label_agreement":null},{"id":"W130649511","doi":"10.1007/978-3-642-30779-9_34","title":"Improving Telerehabilitation Technology to Challenge Chronic Disease Management","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Telemedicine and Telehealth Implementation","field":"Medicine","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":"Health and Social Services Centre University Institute of Geriatrics of Sherbrooke; Université de Sherbrooke","funders":"","keywords":"Telerehabilitation; Computer science; Telemedicine; Multimedia; Health care","score_opus":0.019490661788334838,"score_gpt":0.31929920256479616,"score_spread":0.2998085407764613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130649511","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051541157,0.08004714,0.10070461,0.180644,0.008474559,0.00043278502,0.00052377355,0.0010165586,0.5766155],"genre_scores_gemma":[0.34266543,0.10847531,0.15639271,0.050216302,0.006057801,0.0006488365,0.001013648,0.0002913132,0.33423862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965394,0.00012303269,0.000018391926,0.00003128408,0.00013308616,0.00004028026],"domain_scores_gemma":[0.99931777,0.00042300715,0.000041579086,0.000037874546,0.000100394274,0.000079371915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095246255,0.00031841395,0.00024027422,0.00033716843,0.00029589984,0.001334397,0.0004909987,0.0012244047,0.015511094],"category_scores_gemma":[0.0019029279,0.00008228856,0.0002847364,0.0003893987,0.00030592148,0.0014684205,0.00079933373,0.001194235,0.0026392054],"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.000018850715,0.0003501852,0.0015175549,0.00055732287,0.000022776503,0.00009952884,0.001061444,0.0006588435,0.0025878996,0.022464333,0.113722056,0.8569392],"study_design_scores_gemma":[0.00009053271,0.0006458411,0.015127826,0.0022083845,0.00007598518,0.00097550394,0.00322907,0.004174107,0.0036576046,0.053802956,0.91597277,0.00003941473],"about_ca_topic_score_codex":0.00083310326,"about_ca_topic_score_gemma":0.0025808318,"teacher_disagreement_score":0.015511094,"about_ca_system_score_codex":0.00042178854,"about_ca_system_score_gemma":0.00101803,"threshold_uncertainty_score":0.051889777},"labels":[],"label_agreement":null},{"id":"W130675096","doi":"10.1007/978-3-319-10428-7_61","title":"Scheduling Agents Using Forecast Call Arrivals at Hydro-Québec’s Call Centers","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Hydro-Québec; Computer Research Institute of Montréal; Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Workforce management; Call management; Scheduling (production processes); Operations research; Call control; Data center; Schedule; Workforce; Real-time computing; Operations management; Telecommunications; Operating system; Engineering; Economics","score_opus":0.10939208097300095,"score_gpt":0.34488866477738456,"score_spread":0.2354965838043836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130675096","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.4973587,0.0012017728,0.42520738,0.0021774122,0.00053443,0.0006519734,0.0017625085,0.0024898865,0.06861595],"genre_scores_gemma":[0.9009216,0.00029659935,0.07638754,0.00011548615,0.00006989575,0.00013259405,0.0006889039,0.0001434258,0.021243937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972373,0.000065525455,0.0000088905335,0.00004507895,0.00005730919,0.00009943228],"domain_scores_gemma":[0.99937207,0.0002634609,0.000049470375,0.0000318856,0.00016421998,0.000119048564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069122127,0.0006962758,0.0005721028,0.00047268928,0.0010725193,0.001538054,0.0011649999,0.00091987354,0.005126092],"category_scores_gemma":[0.0017820988,0.0005085582,0.00037217527,0.0006529304,0.00029604996,0.00062098016,0.00035693083,0.00070250203,0.0006110391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018949005,0.00007943737,0.0019674716,0.00003504371,0.000041899733,0.000057129793,0.0000928957,0.9282992,0.0018137422,0.004936953,0.010312142,0.052174613],"study_design_scores_gemma":[0.000014322044,0.00001550632,0.0005013227,0.000004194798,0.0000066525104,0.0000038257863,0.000038392827,0.99673504,0.00028276863,0.0008768549,0.0015146915,0.0000065192244],"about_ca_topic_score_codex":0.5923433,"about_ca_topic_score_gemma":0.68126947,"teacher_disagreement_score":0.40765673,"about_ca_system_score_codex":0.005374222,"about_ca_system_score_gemma":0.006769113,"threshold_uncertainty_score":0.820115},"labels":[],"label_agreement":null},{"id":"W131027357","doi":"10.1007/978-3-540-74456-6_11","title":"New Approximability Results for 2-Dimensional Packing Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"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":"Rectangle; Bin packing problem; Approximation algorithm; Combinatorics; Packing problems; Mathematics; Constant (computer programming); Square (algebra); Time complexity; Unit square; Bin; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Geometry","score_opus":0.030671216822183375,"score_gpt":0.24976073389741507,"score_spread":0.2190895170752317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131027357","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.030679846,0.012116,0.86136746,0.0023899765,0.0016666994,0.00017708374,0.0007140499,0.0014824616,0.08940644],"genre_scores_gemma":[0.29627714,0.013361241,0.59421355,0.0024335661,0.004945743,0.0013239773,0.003557384,0.0032825004,0.08060485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971576,0.00050119165,0.0001793701,0.0005128285,0.0012738442,0.00037517512],"domain_scores_gemma":[0.9884722,0.008547875,0.00046283356,0.0013436816,0.0007694206,0.00040392223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036561897,0.004991931,0.0034966215,0.00500534,0.0018155521,0.0053841462,0.0068573547,0.0032282744,0.017566545],"category_scores_gemma":[0.01737122,0.002011791,0.004979219,0.0069418787,0.0034233774,0.01434195,0.005837907,0.014797262,0.0037610573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006938631,0.00061240676,0.001401662,0.0015076321,0.00025031806,0.0003527392,0.0008533319,0.16126224,0.0060055032,0.58098835,0.03753625,0.20853572],"study_design_scores_gemma":[0.00006471588,0.00008879801,0.00080294226,0.00018177977,0.00014609314,0.000337698,0.00010534602,0.37186944,0.0021755642,0.603847,0.020316456,0.000064169166],"about_ca_topic_score_codex":0.0027255516,"about_ca_topic_score_gemma":0.0027586466,"teacher_disagreement_score":0.017566545,"about_ca_system_score_codex":0.0038738342,"about_ca_system_score_gemma":0.001163475,"threshold_uncertainty_score":0.05876589},"labels":[],"label_agreement":null},{"id":"W131232873","doi":"10.1007/978-3-319-11755-3_1","title":"Audio-Visual Emotion Analysis Using Semi-Supervised Temporal Clustering with Constraint Propagation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Constraint (computer-aided design); Artificial intelligence; Pairwise comparison; Constrained clustering; Pattern recognition (psychology); Correlation clustering; Machine learning; Data mining; Canopy clustering algorithm; Mathematics","score_opus":0.020550569437193425,"score_gpt":0.251994060646708,"score_spread":0.23144349120951457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131232873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052073635,0.0001482287,0.99223715,0.00007257381,0.000039184997,0.00009423186,0.0002614513,0.0009096421,0.0010301463],"genre_scores_gemma":[0.16077878,0.00030888288,0.8290946,0.00018602429,0.00015775276,0.00059217995,0.0026777207,0.00088010036,0.005323892],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987631,0.00027262702,0.000073162955,0.00041508977,0.0003382111,0.00013791658],"domain_scores_gemma":[0.9978004,0.000903659,0.0001997837,0.00021476281,0.000786883,0.00009443145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014403249,0.001650255,0.001275167,0.0014708415,0.0010480318,0.0017009856,0.0030529725,0.0012245405,0.0047753286],"category_scores_gemma":[0.0036127348,0.0006839438,0.002202543,0.0025169968,0.0007262169,0.0016205274,0.0018922042,0.002080544,0.0027213527],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061168434,0.0003314936,0.001090749,0.00033258196,0.00028941373,0.00017378856,0.00028592945,0.11661682,0.05529714,0.007382908,0.013219403,0.80436814],"study_design_scores_gemma":[0.000012858192,0.0000315454,0.00063787034,0.00001405473,0.0000338683,0.000048742917,0.000045325633,0.98853976,0.005654021,0.00355776,0.0014060972,0.000018128549],"about_ca_topic_score_codex":0.0102551,"about_ca_topic_score_gemma":0.017190922,"teacher_disagreement_score":0.0102551,"about_ca_system_score_codex":0.0007538307,"about_ca_system_score_gemma":0.0013002116,"threshold_uncertainty_score":0.020390809},"labels":[],"label_agreement":null},{"id":"W1315694","doi":"10.1007/978-3-319-14484-9_14","title":"Infinite States Verification in Game-Theoretic Logics: Case Studies and Implementation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Computer science; State (computer science); Exploit; Theoretical computer science; Prolog; Algorithm","score_opus":0.022704458121057623,"score_gpt":0.2949436477337804,"score_spread":0.27223918961272275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1315694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071351714,0.0005981921,0.8878683,0.0015366558,0.00009078543,0.00031262092,0.000116271025,0.00112054,0.037004862],"genre_scores_gemma":[0.7956852,0.00035564,0.19565426,0.00023164401,0.000037204267,0.00025179778,0.00015333209,0.00021897092,0.007412018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992762,0.0035651124,0.0005172237,0.00067709934,0.0016566446,0.00082198484],"domain_scores_gemma":[0.9638936,0.031073842,0.0005791352,0.0025478597,0.0014130997,0.00049247476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008632691,0.0007162645,0.0010026208,0.00084903766,0.0021928404,0.0061012595,0.004498128,0.002852076,0.007252594],"category_scores_gemma":[0.032323044,0.00093885104,0.0020767802,0.0011119653,0.007379969,0.011030885,0.0059017483,0.0050790827,0.00070326333],"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.00024038019,0.0002502602,0.00042776502,0.0001828554,0.00003180867,0.00019659792,0.0008800133,0.027523454,0.0015396515,0.93100405,0.0010097087,0.036713567],"study_design_scores_gemma":[0.0001354868,0.00007316964,0.00012883292,0.000088971254,0.000056546996,0.00012169723,0.00035336008,0.22720128,0.0059163133,0.76247764,0.0034098707,0.00003686404],"about_ca_topic_score_codex":0.0062540127,"about_ca_topic_score_gemma":0.0060723657,"teacher_disagreement_score":0.008632691,"about_ca_system_score_codex":0.004119261,"about_ca_system_score_gemma":0.003986488,"threshold_uncertainty_score":0.045654595},"labels":[],"label_agreement":null},{"id":"W131679044","doi":"10.1007/3-540-44988-4_11","title":"User Interface Prototyping Based on UML Scenarios and High-Level Petri Nets","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Petri net; Computer science; Unified Modeling Language; Programming language; Interface (matter); Sequence diagram; User interface; Process (computing); Process architecture; Operating system; Software","score_opus":0.02871211737986094,"score_gpt":0.2537835898130939,"score_spread":0.22507147243323297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131679044","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.019234335,0.0000828195,0.9707648,0.0000656814,0.000021575539,0.00023247181,0.00003929728,0.0020798098,0.007479208],"genre_scores_gemma":[0.3119695,0.00021073493,0.6821594,0.000031577263,0.000009363339,0.0003849254,0.00019315418,0.00046248437,0.0045789015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968285,0.0018428148,0.00014946281,0.00022374949,0.000796298,0.00015914194],"domain_scores_gemma":[0.9913873,0.006985838,0.00018516251,0.0006769618,0.0005857342,0.00017901714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029432701,0.0013219373,0.00066601264,0.0010546492,0.0006747198,0.0022904999,0.0019213988,0.0013638183,0.008984834],"category_scores_gemma":[0.011324992,0.0012721367,0.0010486107,0.00049868226,0.0011687123,0.0035233265,0.001771361,0.0011964047,0.0012321626],"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.0014107095,0.0004932973,0.0028256585,0.0013040442,0.00015101527,0.0027327568,0.006257556,0.24547301,0.10055196,0.22690459,0.0048812083,0.40701422],"study_design_scores_gemma":[0.00013983752,0.0002474415,0.00071887346,0.00021749116,0.000066328146,0.00076817174,0.00035918108,0.88833445,0.051251225,0.044377107,0.01343169,0.00008825988],"about_ca_topic_score_codex":0.0012764017,"about_ca_topic_score_gemma":0.0016711885,"teacher_disagreement_score":0.008984834,"about_ca_system_score_codex":0.00062211906,"about_ca_system_score_gemma":0.0005686843,"threshold_uncertainty_score":0.030057251},"labels":[],"label_agreement":null},{"id":"W132229765","doi":"10.1007/978-3-642-33564-8_48","title":"Learning-Based Object Segmentation Using Regional Spatial Templates and Visual Features","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"St. Francis Xavier University","funders":"","keywords":"Template; Computer science; Segmentation; Artificial intelligence; Spatial analysis; Image segmentation; Computer vision; Pattern recognition (psychology); Object (grammar); Pixel; Semantics (computer science); Geography; Remote sensing","score_opus":0.024218081233072713,"score_gpt":0.2850616018514962,"score_spread":0.2608435206184235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132229765","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01347021,0.0004303513,0.9817748,0.000045540044,0.000039961087,0.00008612412,0.00015342438,0.0026450052,0.001354559],"genre_scores_gemma":[0.14607078,0.0006943274,0.8477999,0.00009997261,0.000064637905,0.00010876645,0.0010184533,0.00062387343,0.0035193013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994597,0.000038976694,0.000036608333,0.00022573787,0.00015940137,0.00007964685],"domain_scores_gemma":[0.99948275,0.00012829987,0.000061901934,0.00013173732,0.0001630583,0.00003215187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066338084,0.0011365667,0.0019707268,0.0020064015,0.00041274066,0.0016333743,0.0021019762,0.0012252744,0.0027367428],"category_scores_gemma":[0.001066946,0.0007847463,0.0016334039,0.0028372947,0.000668985,0.00135533,0.0010358,0.0006900685,0.0027340776],"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.00023992125,0.00010772575,0.00094972533,0.00018722152,0.00010677698,0.000104883635,0.00008347853,0.0464462,0.11316901,0.0021944419,0.0030157035,0.833395],"study_design_scores_gemma":[0.000019946838,0.00012775896,0.0018970615,0.000026342912,0.00013913182,0.00040768477,0.000045241188,0.90931225,0.07955672,0.0048296726,0.0036013054,0.000036907808],"about_ca_topic_score_codex":0.0051235342,"about_ca_topic_score_gemma":0.00680729,"teacher_disagreement_score":0.0051235342,"about_ca_system_score_codex":0.0008004142,"about_ca_system_score_gemma":0.0011999867,"threshold_uncertainty_score":0.0101873875},"labels":[],"label_agreement":null},{"id":"W132285569","doi":"10.1007/978-3-642-40313-2_29","title":"Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cardinality (data modeling); Guard (computer science); Point (geometry); Line segment; Computer science; Time complexity; Vanishing point; Set (abstract data type); Polygon (computer graphics); Combinatorics; Mathematics; Computer vision; Algorithm; Image (mathematics); Geometry; Telecommunications","score_opus":0.025233999050963154,"score_gpt":0.2520918658525649,"score_spread":0.22685786680160172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132285569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08579202,0.00036709115,0.8907838,0.00021676006,0.00014190345,0.0001219779,0.00035290862,0.0007429036,0.02148063],"genre_scores_gemma":[0.52382123,0.00088869093,0.4389053,0.00018146636,0.00019663207,0.00020966878,0.0015800878,0.00073988613,0.03347702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999106,0.00010845604,0.000053869557,0.00028050318,0.00029097675,0.00016023063],"domain_scores_gemma":[0.9978198,0.0010493058,0.00020870635,0.0005967212,0.00014878872,0.00017663774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008432211,0.0014128139,0.001868753,0.0010720361,0.0008542341,0.0023147264,0.0025573643,0.001763489,0.012464793],"category_scores_gemma":[0.004492162,0.0012640848,0.002053948,0.000968182,0.0022267015,0.0044708666,0.0059262887,0.003230357,0.0015614205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075684045,0.00027206607,0.0017957869,0.0005898851,0.000118130134,0.00023767553,0.00069157395,0.31945854,0.01548148,0.3518144,0.014054339,0.29472938],"study_design_scores_gemma":[0.000057437803,0.00019576169,0.00069808535,0.00007285088,0.000044603617,0.00020795384,0.00021513242,0.71212935,0.0041992655,0.27651805,0.005620589,0.000040954008],"about_ca_topic_score_codex":0.0018723843,"about_ca_topic_score_gemma":0.0020630732,"teacher_disagreement_score":0.012464793,"about_ca_system_score_codex":0.00053576904,"about_ca_system_score_gemma":0.00067964755,"threshold_uncertainty_score":0.041698873},"labels":[],"label_agreement":null},{"id":"W132655277","doi":"10.1007/978-3-642-38868-2_5","title":"Gradient Competition Anisotropy for Centerline Extraction and Segmentation of Spinal Cords","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"London Health Sciences Centre; St Joseph's Health Care; Western University","funders":"","keywords":"Segmentation; Artificial intelligence; Curvilinear coordinates; Anisotropy; Computer vision; Orientation (vector space); Structure tensor; Computer science; Intensity (physics); Voxel; Pattern recognition (psychology); Mathematics; Physics; Geometry; Image (mathematics); Optics","score_opus":0.008719828063970958,"score_gpt":0.2560384069194547,"score_spread":0.24731857885548372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132655277","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.077680595,0.0015918947,0.9138272,0.00040865268,0.000055775417,0.0001306353,0.00058412546,0.0031923677,0.0025288088],"genre_scores_gemma":[0.37153283,0.0010866426,0.620536,0.00012859507,0.000108617016,0.0001528828,0.0013220467,0.0010698554,0.0040626074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995376,0.00008453172,0.000026900798,0.00009042072,0.00014888945,0.000111624344],"domain_scores_gemma":[0.99885416,0.00038726378,0.00016204467,0.00013626205,0.0003710366,0.00008919128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476565,0.0009982997,0.0013632085,0.0025503386,0.0009368994,0.0020210154,0.0013853216,0.0014537168,0.0023642674],"category_scores_gemma":[0.0028055015,0.00066677824,0.0011784862,0.001945403,0.00059563894,0.0010865213,0.0009368276,0.0012771897,0.001053913],"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.0013648003,0.00024064671,0.0050681895,0.0006479745,0.00026455414,0.00032953164,0.0003106268,0.09060811,0.20665725,0.012522772,0.009815052,0.6721706],"study_design_scores_gemma":[0.000042841188,0.00010097502,0.0037651542,0.0000399656,0.00010254158,0.0004715911,0.000077300494,0.90804726,0.07838345,0.0043952563,0.0045243986,0.000049191818],"about_ca_topic_score_codex":0.014843156,"about_ca_topic_score_gemma":0.018905813,"teacher_disagreement_score":0.014843156,"about_ca_system_score_codex":0.00089578546,"about_ca_system_score_gemma":0.0033651732,"threshold_uncertainty_score":0.029513538},"labels":[],"label_agreement":null},{"id":"W1327342","doi":"10.1007/978-3-642-34478-7_4","title":"Customer Relationship Management Using Partial Focus Feature Reduction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Customer churn and segmentation","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Computer science; Cardinality (data modeling); Data mining; Dimensionality reduction; Feature (linguistics); Preprocessor; Focus (optics); Customer relationship management; Data pre-processing; Data set; Set (abstract data type); Artificial intelligence; Database","score_opus":0.03611495021252843,"score_gpt":0.25715936866066835,"score_spread":0.22104441844813993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1327342","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.09526181,0.0007507016,0.88826644,0.00018883059,0.00006944873,0.0001810517,0.00043380135,0.004449179,0.010398626],"genre_scores_gemma":[0.69349515,0.00032827296,0.29676706,0.00014076238,0.00009275016,0.00016850988,0.0012631982,0.00025265253,0.007491686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.000051252693,0.000012101849,0.0000709637,0.00014854211,0.00006708899],"domain_scores_gemma":[0.99963117,0.00011855208,0.000024798399,0.000074186304,0.00013707057,0.000014292796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033972517,0.00053666864,0.0008557828,0.0010824089,0.00046576172,0.0006356264,0.0010804768,0.00043159776,0.0045444593],"category_scores_gemma":[0.0008061389,0.00029075678,0.00073343446,0.0012279933,0.00020013822,0.001122624,0.0008321143,0.000530372,0.0008898006],"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.00024085617,0.00029370355,0.001126984,0.000115176,0.00008092461,0.000073689225,0.00011659957,0.031857364,0.025495602,0.0046414714,0.008311361,0.92764616],"study_design_scores_gemma":[0.000055567747,0.00028792903,0.0034880075,0.000012664878,0.00012346703,0.0001601341,0.000102223734,0.9603345,0.021365985,0.008903224,0.0051321215,0.000034301192],"about_ca_topic_score_codex":0.0043223277,"about_ca_topic_score_gemma":0.0044897357,"teacher_disagreement_score":0.0045444593,"about_ca_system_score_codex":0.00034613974,"about_ca_system_score_gemma":0.0005563659,"threshold_uncertainty_score":0.015202761},"labels":[],"label_agreement":null},{"id":"W133090141","doi":"10.1007/978-3-642-40261-6_23","title":"A Novel Border Identification Algorithm Based on an “Anti-Bayesian” Paradigm","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Computer science; Cardinality (data modeling); Identification (biology); Set (abstract data type); Artificial intelligence; Algorithm; Bayesian probability; Position (finance); Field (mathematics); Discriminant; Pattern recognition (psychology); Machine learning; Data mining; Mathematics","score_opus":0.015918963066963825,"score_gpt":0.27286589164829916,"score_spread":0.25694692858133533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133090141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033459929,0.000083915606,0.99477273,0.00008034477,0.000061912615,0.000022780592,0.000019378753,0.0003609112,0.0012520805],"genre_scores_gemma":[0.08436302,0.00014780316,0.91024524,0.00021618143,0.00012070858,0.00010374487,0.0002237483,0.00023220501,0.0043473863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988728,0.00025562578,0.00006463966,0.00031216096,0.00038253763,0.00011207645],"domain_scores_gemma":[0.99838734,0.0005948895,0.00012316108,0.00024002562,0.0005518323,0.00010265724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017681842,0.00071361713,0.0016050664,0.0014268238,0.0011902048,0.0022035828,0.002792695,0.0024622458,0.005424437],"category_scores_gemma":[0.004745477,0.00059538806,0.0009413424,0.0011258658,0.00086305174,0.0036621473,0.002752424,0.0023154246,0.0022872384],"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.00053488085,0.000304229,0.0016230515,0.00015739123,0.00012470277,0.00019618632,0.00022822169,0.07894209,0.028356215,0.12806271,0.012400722,0.74906963],"study_design_scores_gemma":[0.000041646003,0.000064404114,0.00021123319,0.000016496348,0.000027221256,0.0001570523,0.000030231813,0.959282,0.005743266,0.030574957,0.0038287104,0.000022711698],"about_ca_topic_score_codex":0.0014280886,"about_ca_topic_score_gemma":0.0017137586,"teacher_disagreement_score":0.005424437,"about_ca_system_score_codex":0.0005220449,"about_ca_system_score_gemma":0.0013927639,"threshold_uncertainty_score":0.018146574},"labels":[],"label_agreement":null},{"id":"W133303900","doi":"10.1007/978-3-642-30217-6_20","title":"Active Learning with c-Certainty","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Active learning (machine learning); Artificial intelligence; Noise (video); Quality (philosophy); Certainty; Machine learning; Mathematics; Image (mathematics)","score_opus":0.009740076895240963,"score_gpt":0.23420238277689034,"score_spread":0.2244623058816494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133303900","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.0016643133,0.0011484089,0.98480624,0.0005135182,0.00024003255,0.000032041808,0.000078167424,0.00054876733,0.010968472],"genre_scores_gemma":[0.33355507,0.0026403083,0.6225148,0.00082838576,0.0017126306,0.0003537992,0.00069216033,0.0006683376,0.037034523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803525,0.0005464551,0.00012303959,0.00038482156,0.00081218756,0.00009825489],"domain_scores_gemma":[0.9928203,0.0045998455,0.00022630846,0.0012835022,0.0008856296,0.00018443106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030528218,0.00094272464,0.0011954865,0.001095163,0.0007100005,0.002760447,0.002807992,0.0021146666,0.010803487],"category_scores_gemma":[0.017267618,0.0005436772,0.00076741964,0.0013806847,0.0016798083,0.0043999017,0.0028011147,0.0045470395,0.0031089108],"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.00014737262,0.000070100825,0.00028009273,0.00027601683,0.00006052181,0.0000611211,0.00009210731,0.07764699,0.0013445644,0.48145932,0.015847124,0.42271474],"study_design_scores_gemma":[0.000035603916,0.00005054887,0.000087949695,0.00006145068,0.00001926826,0.00009579043,0.000011772634,0.54926205,0.0026460798,0.42948455,0.018219482,0.000025524008],"about_ca_topic_score_codex":0.0013496681,"about_ca_topic_score_gemma":0.0011795469,"teacher_disagreement_score":0.010803487,"about_ca_system_score_codex":0.0009729193,"about_ca_system_score_gemma":0.0009839878,"threshold_uncertainty_score":0.036141276},"labels":[],"label_agreement":null},{"id":"W133418326","doi":"10.1007/978-3-642-20712-9_3","title":"Learning Read-Constant Polynomials of Constant Degree Modulo Composites","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"McGill University; University of Toronto","funders":"","keywords":"Constant (computer programming); Modulo; Degree (music); Computer science; Mathematics; Discrete mathematics; Physics; Acoustics; Programming language","score_opus":0.022795506466090375,"score_gpt":0.24358928026509788,"score_spread":0.2207937737990075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133418326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19809376,0.0012985334,0.7406521,0.002043327,0.0004154477,0.00008915635,0.0006526199,0.0037563422,0.05299866],"genre_scores_gemma":[0.80537224,0.00076900056,0.15470323,0.00046107944,0.0004664562,0.000062836254,0.0014589365,0.0007487421,0.03595744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936634,0.00009247827,0.000023820752,0.00023891564,0.00017675501,0.00010167703],"domain_scores_gemma":[0.997531,0.0012379836,0.0001712751,0.0005890595,0.0003128334,0.00015792118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060882804,0.00060360495,0.00058319874,0.0006210337,0.0006619579,0.0017521674,0.000949664,0.0006153877,0.014304117],"category_scores_gemma":[0.006748645,0.0003602693,0.0006833536,0.00083025,0.0013169057,0.004553169,0.0017962628,0.0025182983,0.0035447145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045346105,0.0001396667,0.0036947483,0.00042218994,0.000050249335,0.00022808283,0.00084127975,0.027161673,0.012449695,0.49021092,0.019183524,0.44516444],"study_design_scores_gemma":[0.000048695667,0.00009520338,0.0009209929,0.00007604187,0.000033839537,0.00022830462,0.00028135156,0.08656565,0.008568333,0.884163,0.01898976,0.000028895756],"about_ca_topic_score_codex":0.0006401299,"about_ca_topic_score_gemma":0.0012895904,"teacher_disagreement_score":0.014304117,"about_ca_system_score_codex":0.00078799593,"about_ca_system_score_gemma":0.00065794203,"threshold_uncertainty_score":0.0478521},"labels":[],"label_agreement":null},{"id":"W133424112","doi":"10.1007/978-3-642-30353-1_29","title":"Text Similarity Using Google Tri-grams","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Similarity (geometry); Artificial intelligence; Set (abstract data type); Natural language processing; Word (group theory); n-gram; Data set; Information retrieval; Language model; Mathematics; Image (mathematics)","score_opus":0.049105195206289545,"score_gpt":0.27087556995842194,"score_spread":0.2217703747521324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133424112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.171812,0.011148781,0.66584,0.0009222667,0.0027613724,0.0015801417,0.036398064,0.06532615,0.044211324],"genre_scores_gemma":[0.4678721,0.0024752447,0.4484072,0.00018109268,0.0011886642,0.00076589826,0.049754936,0.0031069985,0.026247947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774927,0.0002799762,0.00030029126,0.00048127913,0.0010252801,0.00016388312],"domain_scores_gemma":[0.9974195,0.0006572529,0.0002639217,0.00039987257,0.00109739,0.00016203367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009729846,0.0012431382,0.0016873322,0.017130395,0.0011987443,0.0028294486,0.0010854101,0.0013202808,0.01576247],"category_scores_gemma":[0.0061780056,0.00038910614,0.0016765633,0.012994833,0.00034456662,0.004489659,0.0021380933,0.0008303757,0.015104949],"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.00080610695,0.00022332647,0.0049121473,0.0009114697,0.00029006763,0.00025742548,0.00036760856,0.0039869524,0.020299828,0.006310122,0.05811567,0.90351933],"study_design_scores_gemma":[0.00032454092,0.0011565057,0.039066244,0.00041537176,0.0007221529,0.0049062436,0.0025173384,0.6598907,0.06802795,0.07146294,0.15112695,0.00038297087],"about_ca_topic_score_codex":0.0032340672,"about_ca_topic_score_gemma":0.005365049,"teacher_disagreement_score":0.017130395,"about_ca_system_score_codex":0.0005947514,"about_ca_system_score_gemma":0.0009227031,"threshold_uncertainty_score":0.05273074},"labels":[],"label_agreement":null},{"id":"W133506345","doi":"10.1007/978-3-642-27901-0_11","title":"Secret Key Establishment over Noisy Channels","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Randomness; Key (lock); Computer science; Channel (broadcasting); Computer security; Key generation; Pre-shared key; Theoretical computer science; Computer network; Cryptography; Public-key cryptography; Key distribution; Mathematics; Statistics; Encryption","score_opus":0.015507405460218494,"score_gpt":0.23847914000878737,"score_spread":0.22297173454856886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133506345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024196126,0.0052696993,0.93267596,0.0005722569,0.0003416066,0.00011670149,0.00017728335,0.00076087326,0.035889473],"genre_scores_gemma":[0.70801926,0.012873044,0.17695776,0.0003366375,0.0005826548,0.00032107672,0.00052872224,0.00039764083,0.09998319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.00013045582,0.000056883007,0.000118205964,0.00046490028,0.00011094822],"domain_scores_gemma":[0.9989041,0.00056817126,0.00012249616,0.0002686754,0.00010822399,0.000028312992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396534,0.0006575026,0.0008479357,0.00060142076,0.0006106997,0.0012836783,0.0007101521,0.0008167708,0.0039899885],"category_scores_gemma":[0.0018120611,0.00052655337,0.00031566614,0.0011401452,0.001153664,0.0035977024,0.0025683932,0.001798227,0.0018960582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049299723,0.00012776245,0.00032960475,0.0017231788,0.00009261568,0.0008360377,0.00075454975,0.046734504,0.11872204,0.38100195,0.010685508,0.4384993],"study_design_scores_gemma":[0.00013624033,0.0004633278,0.00083276886,0.00051054306,0.00017842565,0.0031393573,0.00027444455,0.24177073,0.23559189,0.3985736,0.118344605,0.00018411179],"about_ca_topic_score_codex":0.00010409644,"about_ca_topic_score_gemma":0.00014289274,"teacher_disagreement_score":0.0039899885,"about_ca_system_score_codex":0.00046365446,"about_ca_system_score_gemma":0.0004566579,"threshold_uncertainty_score":0.013347864},"labels":[],"label_agreement":null},{"id":"W133787854","doi":"10.1007/978-3-642-22092-0_19","title":"Graph Cuts with Invariant Object-Interaction Priors: Application to Intervertebral Disc Segmentation","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":67,"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; CARE Canada","funders":"","keywords":"Prior probability; Computer science; Segmentation; Artificial intelligence; Invariant (physics); Pattern recognition (psychology); Algorithm; Computer vision; Mathematics; Bayesian probability","score_opus":0.01012386484847342,"score_gpt":0.23542757806952402,"score_spread":0.2253037132210506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133787854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005890441,0.00018614143,0.99264187,0.000105925144,0.000023514789,0.000032249813,0.000058789305,0.0006624826,0.00039863956],"genre_scores_gemma":[0.11934699,0.00049691054,0.8769179,0.00010570951,0.00007980004,0.000079040066,0.00035923393,0.00077595824,0.0018384535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920636,0.00029378582,0.000032437278,0.00015124775,0.00026017334,0.00005605969],"domain_scores_gemma":[0.99812835,0.0011607019,0.00016279014,0.00019980896,0.00026893133,0.00007941153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021842301,0.0012242578,0.0015097139,0.0020038416,0.0005345186,0.0016382165,0.002151462,0.0026387863,0.0019677372],"category_scores_gemma":[0.0062582046,0.0012199148,0.0012588935,0.0024896944,0.0011833231,0.0009779843,0.0015121634,0.0020289847,0.0006673183],"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.0005347527,0.000163838,0.00067504816,0.0002831169,0.00016230169,0.00016381004,0.00021151823,0.47374782,0.022042526,0.015139619,0.0046034968,0.4822722],"study_design_scores_gemma":[0.00002870756,0.000025779347,0.00036745434,0.000010180369,0.000024605488,0.00005368831,0.000018466519,0.982512,0.0037637064,0.012103701,0.0010778352,0.0000137862735],"about_ca_topic_score_codex":0.010028187,"about_ca_topic_score_gemma":0.012473748,"teacher_disagreement_score":0.010028187,"about_ca_system_score_codex":0.0009817043,"about_ca_system_score_gemma":0.0013893705,"threshold_uncertainty_score":0.019939601},"labels":[],"label_agreement":null},{"id":"W133838137","doi":"10.1007/978-3-642-39159-0_9","title":"Versatile Sparse Matrix Factorization and Its Applications in High-Dimensional Biological Data Analysis","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Matrix decomposition; Non-negative matrix factorization; Sparse matrix; Sparse approximation; Factorization; Biological data; Matrix (chemical analysis); Smoothness; Algorithm; Representation (politics); Theoretical computer science; Artificial intelligence; Pattern recognition (psychology); Mathematics; Bioinformatics","score_opus":0.03178863783406473,"score_gpt":0.28040620303322294,"score_spread":0.24861756519915823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133838137","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.0008273591,0.0013637119,0.99653107,0.000107724474,0.000055756664,0.00001200194,0.000100778154,0.00043940794,0.00056227046],"genre_scores_gemma":[0.027232295,0.004484688,0.9639471,0.00015320671,0.00030197826,0.00013720924,0.0007228981,0.0002777373,0.0027427722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991836,0.00027369882,0.000054475422,0.00015773016,0.0002913873,0.00003921346],"domain_scores_gemma":[0.99811053,0.0012570522,0.00008416369,0.00025935518,0.0002257858,0.00006306335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015292765,0.0013170727,0.0012918876,0.0013006756,0.00039323955,0.0011140519,0.0012795627,0.000889888,0.0048713363],"category_scores_gemma":[0.004152405,0.0007294442,0.0016367837,0.0033452814,0.0009164237,0.0014438413,0.0021274935,0.0020161662,0.0026640669],"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.0001209689,0.000104095605,0.0005473625,0.00071488175,0.00016052698,0.00036199123,0.0003400126,0.10704226,0.026139636,0.10388601,0.029968152,0.7306141],"study_design_scores_gemma":[0.000021042893,0.00006136087,0.0005033163,0.00006618698,0.000042537096,0.0006196174,0.000059343707,0.8020114,0.006530595,0.16330017,0.02672154,0.00006286239],"about_ca_topic_score_codex":0.0008345461,"about_ca_topic_score_gemma":0.0011375471,"teacher_disagreement_score":0.0048713363,"about_ca_system_score_codex":0.00026452699,"about_ca_system_score_gemma":0.00039555217,"threshold_uncertainty_score":0.016296268},"labels":[],"label_agreement":null},{"id":"W133997040","doi":"10.1007/978-3-642-40104-6_46","title":"The Greedy Gray Code Algorithm","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gray code; Computer science; Greedy algorithm; Algorithm; Binary tree; Gray (unit); Binary number; Object (grammar); Binary code; Theoretical computer science; Artificial intelligence; Mathematics; Arithmetic","score_opus":0.013970511928237074,"score_gpt":0.23753943651793286,"score_spread":0.2235689245896958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133997040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045235157,0.0013026706,0.96759987,0.000391922,0.00022293314,0.000061713305,0.00011203199,0.00090534176,0.024880007],"genre_scores_gemma":[0.12583789,0.0018312898,0.8240201,0.00057195453,0.0002574587,0.00020782345,0.00046722495,0.0005744642,0.04623184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995185,0.00009420496,0.000016163605,0.00008492013,0.00022444082,0.000061657156],"domain_scores_gemma":[0.9995455,0.00015954634,0.000020396197,0.00015551223,0.00009505981,0.000023924773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000424119,0.00065216667,0.00081319263,0.001063905,0.00053528004,0.0013181331,0.0011399504,0.0010857509,0.011013525],"category_scores_gemma":[0.002068791,0.00031924286,0.00047770652,0.0015817273,0.0009297352,0.0012340518,0.001407461,0.0013402585,0.004433119],"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.00018025038,0.000056752124,0.00021006868,0.00012320293,0.000032428787,0.00006657744,0.00004975485,0.060346562,0.005735138,0.212527,0.024886847,0.69578546],"study_design_scores_gemma":[0.00007608719,0.000071933966,0.00030244014,0.00007196567,0.0000360791,0.0003782994,0.000030190904,0.66036654,0.009033184,0.27850077,0.051093474,0.000038926966],"about_ca_topic_score_codex":0.0021317878,"about_ca_topic_score_gemma":0.0021770194,"teacher_disagreement_score":0.011013525,"about_ca_system_score_codex":0.0007150665,"about_ca_system_score_gemma":0.0015852939,"threshold_uncertainty_score":0.036843956},"labels":[],"label_agreement":null},{"id":"W134002848","doi":"10.1007/978-3-540-40899-4_34","title":"Local Integration of Commercially Available Intra-operative MR-scanner and Neurosurgical Guidance for Metalloporphyrin-Guided Tumor Resection and Photodynamic Therapy","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nanoplatforms for cancer theranostics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Photodynamic therapy; Medicine; Glioma; Gadolinium; Resection; Singlet oxygen; Radiology; Biomedical engineering; Surgery; Materials science; Chemistry; Cancer research","score_opus":0.016488389538997537,"score_gpt":0.24347054619253589,"score_spread":0.22698215665353835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134002848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.273274,0.036750685,0.63268936,0.0009340857,0.0006185357,0.00028139682,0.00038625335,0.0038356378,0.051229995],"genre_scores_gemma":[0.59818625,0.009953823,0.33697122,0.00046126943,0.00014858163,0.000223627,0.00045273267,0.0009994349,0.052603],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998741,0.000012230428,0.000008073125,0.000029264631,0.000062166284,0.000014065341],"domain_scores_gemma":[0.9998542,0.000058049343,0.000023417602,0.000028555003,0.000025218671,0.0000105053905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494161,0.0004232809,0.00031349118,0.0003815297,0.00013591355,0.00038821838,0.0006892896,0.00047722863,0.0031341563],"category_scores_gemma":[0.0003588312,0.0004071677,0.0002818986,0.0003391178,0.00023467712,0.00070373126,0.00056174985,0.0004148827,0.0012196556],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013739789,0.000052396226,0.00022718377,0.00023415785,0.000012437767,0.00025991313,0.00005223109,0.000672837,0.91009384,0.0009963374,0.0010488625,0.08621248],"study_design_scores_gemma":[0.000024609017,0.0007134076,0.0034541956,0.00008251856,0.00010670592,0.0065863957,0.000048736496,0.005794542,0.93524885,0.0007070074,0.047193505,0.00003951679],"about_ca_topic_score_codex":0.00022298904,"about_ca_topic_score_gemma":0.00092016015,"teacher_disagreement_score":0.0031341563,"about_ca_system_score_codex":0.00020880603,"about_ca_system_score_gemma":0.00023827665,"threshold_uncertainty_score":0.010484815},"labels":[],"label_agreement":null},{"id":"W134905603","doi":"10.1007/978-3-642-37207-0_9","title":"Robustness and Evolvability of Recombination in Linear Genetic Programming","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Robustness (evolution); Phenotype; Biology; Genetic programming; Recombination; Computer science; Genetics; Evolutionary biology; Computational biology; Artificial intelligence; Gene","score_opus":0.013951434353448783,"score_gpt":0.24116370624880631,"score_spread":0.22721227189535753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134905603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17650166,0.0030576284,0.79301214,0.00087847473,0.00012225451,0.00005202902,0.000059118647,0.000268763,0.026047966],"genre_scores_gemma":[0.9553181,0.0009060356,0.038667083,0.00009638009,0.00012052189,0.00009009291,0.000048531125,0.00014009666,0.004613256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985599,0.00080977805,0.00006752908,0.00017842992,0.00028266292,0.000101699196],"domain_scores_gemma":[0.98704034,0.010971941,0.00070597883,0.0006793435,0.00041473928,0.00018762054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024310516,0.0006000778,0.00072048535,0.00078120077,0.0004058801,0.0017853039,0.0013658323,0.0012315572,0.0018491811],"category_scores_gemma":[0.021047601,0.0004602254,0.0010053426,0.0006830436,0.0023673838,0.0018977562,0.0016868775,0.0020057906,0.00027555876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025834757,0.0000703718,0.0012699354,0.00022897913,0.00013355636,0.00022026671,0.0003559917,0.60358506,0.010366561,0.3117253,0.0007714463,0.07101422],"study_design_scores_gemma":[0.000028443681,0.00013299928,0.0005262356,0.000044143726,0.000034249642,0.0001615268,0.000040525214,0.72774816,0.002349445,0.268036,0.0008705183,0.00002784123],"about_ca_topic_score_codex":0.0004123266,"about_ca_topic_score_gemma":0.000193982,"teacher_disagreement_score":0.0024310516,"about_ca_system_score_codex":0.0007414458,"about_ca_system_score_gemma":0.00029171695,"threshold_uncertainty_score":0.0128567815},"labels":[],"label_agreement":null},{"id":"W135003788","doi":"10.1007/978-3-642-25832-9_76","title":"Robotic Communications and Surveillance - The DARPA LANdroids Program","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","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":"Blackberry (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction; Computer vision","score_opus":0.0353364389975511,"score_gpt":0.25959050025204156,"score_spread":0.22425406125449046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135003788","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.029620579,0.037191667,0.28925908,0.01999389,0.00496273,0.00075746677,0.0044370657,0.0031185907,0.61065894],"genre_scores_gemma":[0.20726967,0.05062219,0.26714775,0.0011380316,0.0032399923,0.0006311758,0.00945698,0.00086884527,0.45962533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971074,0.00006004418,0.000005755823,0.00004755307,0.00013727353,0.00003866815],"domain_scores_gemma":[0.9995802,0.00007218997,0.000020771564,0.0000514738,0.00013448767,0.00014090516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428953,0.0011444357,0.0004916373,0.0007749024,0.00048051385,0.001159513,0.0009764043,0.0006182551,0.00835692],"category_scores_gemma":[0.00069354865,0.0002865963,0.00030524473,0.0009159112,0.00054172985,0.0009555188,0.0010025321,0.0011090371,0.0029299955],"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.00021306782,0.00031945485,0.0007457245,0.00017473807,0.00004641757,0.00010489001,0.00013976979,0.031539112,0.004879997,0.11575702,0.35591668,0.4901631],"study_design_scores_gemma":[0.00008848645,0.0003228878,0.0012546147,0.00013671395,0.000021891949,0.00018734779,0.00009321286,0.077532165,0.008159225,0.04174918,0.8704319,0.000022416272],"about_ca_topic_score_codex":0.007866935,"about_ca_topic_score_gemma":0.010442785,"teacher_disagreement_score":0.00835692,"about_ca_system_score_codex":0.0012564253,"about_ca_system_score_gemma":0.001789268,"threshold_uncertainty_score":0.027956724},"labels":[],"label_agreement":null},{"id":"W135180951","doi":"10.1007/978-3-540-74472-6_11","title":"A Geometric Approach to Clearance Based Path Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Path (computing); Motion planning; Path length; Obstacle; Any-angle path planning; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Fast path; Algorithm; Mathematics; Computer science; Computer vision; Artificial intelligence; Geography","score_opus":0.029940794370653133,"score_gpt":0.25304031164828605,"score_spread":0.2230995172776329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135180951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003845631,0.00032441094,0.99545586,0.00006217651,0.000077620636,0.000017171029,0.000025446032,0.00017520144,0.0034775797],"genre_scores_gemma":[0.052903507,0.0016333546,0.93100107,0.00016443215,0.0002172596,0.00019258453,0.00026502478,0.00044151995,0.013181245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932015,0.000121874,0.000029532743,0.00012261487,0.0003577938,0.000048032747],"domain_scores_gemma":[0.99964106,0.00014693922,0.00003173471,0.00006105707,0.000098479446,0.000020811776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144552,0.0012776885,0.0014319331,0.001863251,0.00070254825,0.0014672651,0.003355022,0.0014573087,0.009913421],"category_scores_gemma":[0.0016902802,0.0010000474,0.0015017593,0.0027479816,0.0013224146,0.0018622412,0.002415328,0.0023062385,0.002343206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002593563,0.00005870268,0.00014348328,0.00019945469,0.000037464564,0.00008483795,0.000080342805,0.46675372,0.0030501538,0.32368344,0.011259686,0.19462278],"study_design_scores_gemma":[0.000008850579,0.000043307915,0.00008554425,0.000028930126,0.000013133157,0.00009807023,0.000016576962,0.81137645,0.0007684865,0.16522443,0.02231509,0.00002107224],"about_ca_topic_score_codex":0.0034802328,"about_ca_topic_score_gemma":0.0036911217,"teacher_disagreement_score":0.009913421,"about_ca_system_score_codex":0.0009498654,"about_ca_system_score_gemma":0.000981522,"threshold_uncertainty_score":0.033163667},"labels":[],"label_agreement":null},{"id":"W135359125","doi":"10.1007/978-3-642-21593-3_44","title":"Event Detection and Recognition using Histogram of Oriented Gradients and Hidden Markov Models","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Hidden Markov model; Histogram; Artificial intelligence; Event (particle physics); Histogram of oriented gradients; Computer vision; Set (abstract data type); Pattern recognition (psychology); Motion (physics); Markov chain; Object (grammar); Cognitive neuroscience of visual object recognition; Image (mathematics); Machine learning","score_opus":0.04596232009491684,"score_gpt":0.2693375622490113,"score_spread":0.22337524215409443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135359125","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.009513024,0.0005606425,0.9871875,0.00005970465,0.00005181979,0.000032718253,0.00015138712,0.0016553915,0.00078784215],"genre_scores_gemma":[0.28148085,0.0012777486,0.71004397,0.00013111369,0.000117628566,0.00010448112,0.0011912727,0.00026951317,0.0053833616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999666,0.00004567647,0.000020397954,0.00010386089,0.00011230576,0.000051902203],"domain_scores_gemma":[0.9995203,0.00023507581,0.000047409132,0.000063275525,0.00010641683,0.000027499362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060757104,0.0006991646,0.0012019428,0.001266173,0.00025125218,0.001072008,0.0010217923,0.00060882635,0.0017082259],"category_scores_gemma":[0.0013010597,0.0005538049,0.00090829976,0.0011798813,0.00033108666,0.0011251235,0.0006220393,0.0007504527,0.0014630508],"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.00022424091,0.00016055974,0.0023500102,0.0001231397,0.000093232426,0.00011198854,0.00005129361,0.04826437,0.025604442,0.005693203,0.0051665995,0.912157],"study_design_scores_gemma":[0.000015513886,0.000050098122,0.0023747354,0.000016948225,0.00004084614,0.0001474537,0.000022757466,0.96835685,0.01756542,0.0095101,0.001870629,0.000028667268],"about_ca_topic_score_codex":0.0042287596,"about_ca_topic_score_gemma":0.0058913594,"teacher_disagreement_score":0.0042287596,"about_ca_system_score_codex":0.00043168972,"about_ca_system_score_gemma":0.0005251609,"threshold_uncertainty_score":0.008408308},"labels":[],"label_agreement":null},{"id":"W135380274","doi":"10.1007/978-3-642-40273-9_21","title":"Array Range Queries","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Manitoba","funders":"","keywords":"Computer science; Range (aeronautics); Database; Information retrieval; Aerospace engineering; Engineering","score_opus":0.014912736884772312,"score_gpt":0.2317038123007456,"score_spread":0.21679107541597328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135380274","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.009121179,0.0066541415,0.64031756,0.0021318314,0.0010173139,0.00036628396,0.006309321,0.01828707,0.31579533],"genre_scores_gemma":[0.18486123,0.010560657,0.4832967,0.0029458955,0.0015268355,0.0007172172,0.022909878,0.0065235184,0.2866581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986965,0.00015341445,0.00009844871,0.000251892,0.0006708543,0.00012892134],"domain_scores_gemma":[0.99854654,0.00045335214,0.000055562316,0.00062709244,0.00026208925,0.000055236756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062224944,0.0011133013,0.0011966274,0.0017308226,0.00084454095,0.0032070195,0.0016917451,0.0010270199,0.075510524],"category_scores_gemma":[0.0037824125,0.00051517016,0.0007075186,0.0036466003,0.0007640193,0.0062539657,0.0033265373,0.0016592297,0.03966437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002540341,0.00010945101,0.00032626183,0.0005565563,0.00003366729,0.0001259747,0.00018936074,0.0033100506,0.01170153,0.1799631,0.19739664,0.6060333],"study_design_scores_gemma":[0.00008028625,0.00011605329,0.00036151265,0.00023846587,0.0000632489,0.001244857,0.0002599743,0.03254391,0.029548988,0.31201458,0.6234617,0.0000663016],"about_ca_topic_score_codex":0.00044552112,"about_ca_topic_score_gemma":0.00061312085,"teacher_disagreement_score":0.075510524,"about_ca_system_score_codex":0.00063939893,"about_ca_system_score_gemma":0.0005180486,"threshold_uncertainty_score":0.25260788},"labels":[],"label_agreement":null},{"id":"W135546504","doi":"10.1007/978-3-642-33454-2_47","title":"Efficient Global Optimization Based 3D Carotid AB-LIB MRI Segmentation by Simultaneously Evolving Coupled Surfaces","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Segmentation; Computer science; Magnetic resonance imaging; Consistency (knowledge bases); Relaxation (psychology); Image segmentation; Artificial intelligence; Lumen (anatomy); Repeatability; Carotid arteries; Computer vision; Radiology; Mathematics; Medicine","score_opus":0.00796063068306078,"score_gpt":0.2665269464248773,"score_spread":0.2585663157418165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135546504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033255175,0.00018547456,0.96339756,0.00013785088,0.0000310795,0.00003952666,0.000052369865,0.0009866887,0.0019142568],"genre_scores_gemma":[0.34228656,0.00024731972,0.65226203,0.00011994849,0.000046056244,0.00013931505,0.0002478211,0.0007330372,0.003917969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996635,0.00006416028,0.000019289891,0.000055460896,0.00015871615,0.000038829545],"domain_scores_gemma":[0.9995123,0.00022466644,0.000053891665,0.00005966322,0.00011635029,0.00003326175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006366625,0.0011080613,0.0012741691,0.0011868208,0.00048128894,0.0016012006,0.0012857866,0.0017621415,0.0016670974],"category_scores_gemma":[0.001558691,0.0010509393,0.0011461497,0.0010394482,0.00054631423,0.0009499698,0.0016149568,0.0008413305,0.0007622655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002531772,0.00009051017,0.0014525986,0.00011930424,0.00012597386,0.00019228405,0.00019797088,0.7238378,0.038715854,0.0039105616,0.0018247734,0.22927922],"study_design_scores_gemma":[0.0000040909354,0.000011187575,0.000109390254,0.0000025422235,0.000007051341,0.000032283962,0.0000072781722,0.99679947,0.0020559458,0.0006580146,0.00030752458,0.0000053031954],"about_ca_topic_score_codex":0.004283473,"about_ca_topic_score_gemma":0.0058106054,"teacher_disagreement_score":0.004283473,"about_ca_system_score_codex":0.00062138453,"about_ca_system_score_gemma":0.0011582645,"threshold_uncertainty_score":0.0085170865},"labels":[],"label_agreement":null},{"id":"W135937222","doi":"10.1007/978-3-642-21043-3_8","title":"Using a Heterogeneous Dataset for Emotion Analysis in Text","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disgust; Sadness; Surprise; Computer science; Support vector machine; Anger; Happiness; Emotion classification; Artificial intelligence; Sentiment analysis; Classifier (UML); Emotion detection; Machine learning; Natural language processing; Emotion recognition; Psychology; Social psychology","score_opus":0.0635249034249282,"score_gpt":0.3016810333679441,"score_spread":0.2381561299430159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135937222","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.5666075,0.002815135,0.16757946,0.0023004175,0.002745432,0.0019858005,0.23215854,0.008845051,0.014962701],"genre_scores_gemma":[0.44874987,0.00073358737,0.16112673,0.000579681,0.0009026116,0.0017295616,0.38022596,0.0004674965,0.005484497],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998161,0.00041621638,0.00022556844,0.00051861716,0.0005492226,0.00012925787],"domain_scores_gemma":[0.9969421,0.001109685,0.00022918917,0.00054281135,0.00093823293,0.00023797723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015239917,0.0011342986,0.0007991258,0.0040896637,0.0009870097,0.001784952,0.00086648035,0.0012493493,0.0029066755],"category_scores_gemma":[0.0049347975,0.0002384819,0.0009642733,0.0033027472,0.00024186222,0.0021049418,0.001633393,0.0011012092,0.0024531365],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025851766,0.0029733458,0.051672023,0.0017547727,0.0009924815,0.001794997,0.0010402744,0.009658718,0.13726792,0.0031119385,0.21176332,0.5753849],"study_design_scores_gemma":[0.0007415943,0.001703582,0.22880226,0.00047536773,0.0014294959,0.0028359273,0.004411711,0.42660755,0.09704387,0.0146860955,0.22080271,0.0004598546],"about_ca_topic_score_codex":0.002012625,"about_ca_topic_score_gemma":0.004369305,"teacher_disagreement_score":0.0040896637,"about_ca_system_score_codex":0.0006104454,"about_ca_system_score_gemma":0.00044633832,"threshold_uncertainty_score":0.009723842},"labels":[],"label_agreement":null},{"id":"W135963718","doi":"10.1007/978-3-642-38868-2_32","title":"Diffeomorphic Spectral Matching of Cortical Surfaces","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Villum Fonden","keywords":"Computer science; Polygon mesh; Diffeomorphism; Atlas (anatomy); Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Computer graphics (images); Mathematics; Pure mathematics","score_opus":0.009230270406521118,"score_gpt":0.22561396494366145,"score_spread":0.21638369453714035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135963718","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8260836,0.00032845748,0.13794765,0.0003412632,0.000108614986,0.000051367435,0.00011831473,0.00047147815,0.034549188],"genre_scores_gemma":[0.9820796,0.00013206176,0.01124924,0.000039754137,0.00003080628,0.000017863142,0.00009478945,0.00010331815,0.0062525105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997545,0.00003891093,0.000009926702,0.000059610837,0.00008881083,0.000048352333],"domain_scores_gemma":[0.99961674,0.00007372059,0.000067284614,0.000079977326,0.00008418177,0.00007801655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022002366,0.00030365933,0.0004148643,0.0018227857,0.00066779484,0.001425788,0.00069532555,0.00087803905,0.004512611],"category_scores_gemma":[0.0021498615,0.0003309964,0.00029758827,0.0006846374,0.000777536,0.0011067283,0.0013223138,0.0005147289,0.00091159344],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020215599,0.00009444143,0.0025208604,0.000114710136,0.000039959476,0.00061157934,0.00053330336,0.017510394,0.05078766,0.8385014,0.0024288942,0.08665458],"study_design_scores_gemma":[0.000033046763,0.00006931752,0.0041555506,0.000028601276,0.000022158105,0.0011958344,0.00065158535,0.10645489,0.0115193715,0.8687935,0.007047401,0.000028788732],"about_ca_topic_score_codex":0.0008588646,"about_ca_topic_score_gemma":0.000788699,"teacher_disagreement_score":0.004512611,"about_ca_system_score_codex":0.00055875443,"about_ca_system_score_gemma":0.00031851477,"threshold_uncertainty_score":0.015096188},"labels":[],"label_agreement":null},{"id":"W13618705","doi":"10.1007/978-3-642-38457-8_13","title":"Feature Combination for Sentence Similarity","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; SemEval; Sentence; Artificial intelligence; Task (project management); Similarity (geometry); Feature (linguistics); Feature vector; Ranking (information retrieval); Semantic similarity; Natural language processing; Pattern recognition (psychology); Support vector machine; Semantic feature","score_opus":0.024271195096126942,"score_gpt":0.25115860976537,"score_spread":0.2268874146692431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13618705","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.07616665,0.0038990257,0.89749765,0.00032785573,0.0007447952,0.00029714557,0.0035603968,0.009641966,0.007864437],"genre_scores_gemma":[0.5764087,0.0012578934,0.39369172,0.00021662508,0.0009008682,0.00057052594,0.0149179725,0.0008942524,0.011141348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983981,0.00034758358,0.00014970914,0.00044528287,0.0004930993,0.00016613968],"domain_scores_gemma":[0.99810225,0.00069692545,0.00010426476,0.0003451578,0.0006446078,0.00010684243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379226,0.0013112874,0.0019254284,0.003249906,0.0006620964,0.0012075561,0.0011870435,0.0011042925,0.008699953],"category_scores_gemma":[0.0038025933,0.0003400565,0.0015232618,0.0030996378,0.00026942085,0.0020783986,0.0016246607,0.0011515938,0.005576087],"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.00089373195,0.00023333963,0.0014696483,0.00023807873,0.00019021412,0.00012974508,0.0000592908,0.0059422194,0.033692636,0.0016851387,0.017729474,0.9377364],"study_design_scores_gemma":[0.00014990561,0.0009497169,0.012101785,0.00008960848,0.0006295897,0.00095050014,0.00016888823,0.8911175,0.05822602,0.01593244,0.019532768,0.0001511671],"about_ca_topic_score_codex":0.001404504,"about_ca_topic_score_gemma":0.0017282129,"teacher_disagreement_score":0.008699953,"about_ca_system_score_codex":0.0003969536,"about_ca_system_score_gemma":0.000595253,"threshold_uncertainty_score":0.029104233},"labels":[],"label_agreement":null},{"id":"W136426073","doi":"10.1007/978-3-642-35926-2_5","title":"Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Computer science; Digraph; Disjoint sets; Correctness; Representation (politics); Tree (set theory); Theoretical computer science; Set (abstract data type); Simple (philosophy); Algorithm; Discrete mathematics; Mathematics; Combinatorics; Programming language","score_opus":0.041692570855373,"score_gpt":0.31037064546756715,"score_spread":0.2686780746121942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136426073","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.013754173,0.00012349825,0.9655147,0.00019278724,0.000062804465,0.00025211426,0.0011678122,0.0019135877,0.017018503],"genre_scores_gemma":[0.18687968,0.00028716194,0.7962323,0.00010004223,0.000026835456,0.00034002907,0.0025504152,0.00035432045,0.013229141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975675,0.000044164593,0.000018011147,0.000052149797,0.0000919804,0.000036981506],"domain_scores_gemma":[0.99970967,0.00010915556,0.00001588794,0.000083271865,0.00006132317,0.00002067086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028927834,0.00037773603,0.0003773759,0.000892949,0.0006189661,0.0011863941,0.0008635391,0.000574107,0.010611381],"category_scores_gemma":[0.0010421531,0.00032987524,0.00061817584,0.0012882628,0.0003612827,0.0016356722,0.00092279894,0.0010241347,0.0019358994],"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.00019085324,0.00026518194,0.0005425355,0.0005001745,0.000039045626,0.00035374536,0.00047215685,0.038308024,0.028452162,0.5038464,0.019479148,0.40755054],"study_design_scores_gemma":[0.00010316859,0.00012002329,0.00054691796,0.00016513311,0.00011504634,0.00067875633,0.000241815,0.3544472,0.02740517,0.51011026,0.10600392,0.00006259729],"about_ca_topic_score_codex":0.0014160824,"about_ca_topic_score_gemma":0.004148329,"teacher_disagreement_score":0.010611381,"about_ca_system_score_codex":0.0006430844,"about_ca_system_score_gemma":0.0010387839,"threshold_uncertainty_score":0.03549862},"labels":[],"label_agreement":null},{"id":"W136542355","doi":"10.1007/978-3-642-40787-1_13","title":"Efficient Model to Query and Visualize the System States Extracted from Trace Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; TRACE (psycholinguistics); Database; Timestamp; State (computer science); USable; Data mining; Operating system; Real-time computing; Programming language; World Wide Web","score_opus":0.02656937907667731,"score_gpt":0.2655965745962824,"score_spread":0.23902719551960508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136542355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007070168,0.000110003166,0.9411414,0.00019668866,0.000033054435,0.000114094095,0.002125277,0.04833873,0.0008705545],"genre_scores_gemma":[0.30169034,0.00045094304,0.6770029,0.0003166271,0.00006356462,0.0007224666,0.011212215,0.0038733985,0.0046676695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.000090010646,0.00004930916,0.000121736906,0.00024340661,0.00005440083],"domain_scores_gemma":[0.99854565,0.0005649551,0.00011355865,0.0004732906,0.00024498298,0.00005761077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008231927,0.0014726305,0.0011357069,0.0015233598,0.00040076714,0.0024811127,0.002090016,0.0011654662,0.0045398213],"category_scores_gemma":[0.004171934,0.0006226292,0.00129751,0.0012134139,0.00043178807,0.0030232726,0.0014703282,0.0013257331,0.0020994523],"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.0010978151,0.00066297106,0.0069198506,0.0007131734,0.00034551468,0.0005456435,0.00065429433,0.3815525,0.05040226,0.041094728,0.08455566,0.43145564],"study_design_scores_gemma":[0.00003268067,0.00003280801,0.00031950773,0.000012619722,0.000029947623,0.000058329304,0.000038253653,0.97531307,0.008587019,0.011080844,0.0044749808,0.000019879699],"about_ca_topic_score_codex":0.014545705,"about_ca_topic_score_gemma":0.016835393,"teacher_disagreement_score":0.014545705,"about_ca_system_score_codex":0.0011521429,"about_ca_system_score_gemma":0.0016203413,"threshold_uncertainty_score":0.028922081},"labels":[],"label_agreement":null},{"id":"W136578677","doi":"10.1007/978-3-642-25126-9_41","title":"Modeling Slowly Changing Dimensions in ORM","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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 Winnipeg","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.029832396267620284,"score_gpt":0.2430094971162429,"score_spread":0.21317710084862262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136578677","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.054588277,0.0015289903,0.934972,0.000684818,0.00020681607,0.000035899197,0.00035593295,0.0005302687,0.0070970897],"genre_scores_gemma":[0.73215914,0.0012019654,0.25029722,0.0003341346,0.00019306512,0.00013831377,0.0006308506,0.00023593733,0.014809313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996594,0.00013081942,0.000014766379,0.000078588615,0.000059447415,0.000056950284],"domain_scores_gemma":[0.99881005,0.00079675514,0.00010545852,0.00012056406,0.00011489501,0.000052220897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008771327,0.00050881907,0.0007109356,0.00045064473,0.0003827417,0.0011041531,0.0010972363,0.0011773239,0.003683941],"category_scores_gemma":[0.00430096,0.0004477988,0.0006949781,0.00081419945,0.00057976367,0.001845172,0.0012145605,0.0016534942,0.000577333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067015106,0.000037186295,0.001816017,0.000091321424,0.000050798757,0.00007575355,0.00012016001,0.8189406,0.0010535765,0.12645786,0.003003976,0.048285704],"study_design_scores_gemma":[0.000001957105,0.0000049387536,0.00009321136,0.0000047183566,0.0000029508708,0.0000072135426,0.000006734709,0.9826089,0.00007880227,0.016618308,0.0005691222,0.0000031813363],"about_ca_topic_score_codex":0.006769646,"about_ca_topic_score_gemma":0.008167745,"teacher_disagreement_score":0.006769646,"about_ca_system_score_codex":0.00085291645,"about_ca_system_score_gemma":0.00045360017,"threshold_uncertainty_score":0.013460517},"labels":[],"label_agreement":null},{"id":"W13685733","doi":"10.1007/978-3-642-38868-2_26","title":"Efficient 3D Multi-region Prostate MRI Segmentation Using Dual Optimization","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Consistency (knowledge bases); Segmentation; Relaxation (psychology); Image segmentation; Artificial intelligence; Prostate; Algorithm; Pattern recognition (psychology); Mathematical optimization; Mathematics","score_opus":0.019938405559570486,"score_gpt":0.2860397709251951,"score_spread":0.2661013653656246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13685733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066565285,0.00014229502,0.99139774,0.000087320645,0.00001788752,0.000025080588,0.000058404108,0.0006835087,0.00093117106],"genre_scores_gemma":[0.12549692,0.00015484904,0.8702862,0.00010721742,0.00004102058,0.00012209108,0.00033118352,0.00071042194,0.002750089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937123,0.00011752682,0.000038004986,0.00011900805,0.00028134344,0.00007287156],"domain_scores_gemma":[0.9993345,0.00030316724,0.00008105291,0.00009671462,0.00013434656,0.000050250117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079025066,0.0012500356,0.0020578825,0.0015543144,0.00060491724,0.0019775077,0.0016927619,0.0018139067,0.0033834972],"category_scores_gemma":[0.0017344904,0.001615239,0.0018641461,0.0013499974,0.0005451049,0.0012551897,0.0025946777,0.0016122382,0.0013969903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000660049,0.00022713713,0.00117779,0.00035590978,0.00020990802,0.00023378561,0.00017784335,0.6071939,0.05232614,0.010814684,0.0044532856,0.3221696],"study_design_scores_gemma":[0.000013331117,0.000020029329,0.00012299737,0.000006337787,0.0000118255575,0.00006786862,0.000008254672,0.9936174,0.0034312175,0.0019334884,0.000757577,0.00000966505],"about_ca_topic_score_codex":0.003140866,"about_ca_topic_score_gemma":0.0043667667,"teacher_disagreement_score":0.0033834972,"about_ca_system_score_codex":0.0007181023,"about_ca_system_score_gemma":0.0014954119,"threshold_uncertainty_score":0.011318922},"labels":[],"label_agreement":null},{"id":"W137126500","doi":"10.1007/978-3-642-37422-7_9","title":"Maps of Lessons Learnt in Requirements Engineering: A Research Preview","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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":"Western University","funders":"","keywords":"Computer science; Context (archaeology); Product (mathematics); Process (computing); Quality (philosophy); Productivity; Principal (computer security); Work (physics); Data science; Operations research; Epistemology; Engineering; History; Computer security; Archaeology; Mathematics","score_opus":0.0929981301718193,"score_gpt":0.3535384633351364,"score_spread":0.2605403331633171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137126500","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02922783,0.12565126,0.11807118,0.038494565,0.0041218083,0.00029661215,0.0029264577,0.0025607503,0.6786495],"genre_scores_gemma":[0.4799086,0.21267127,0.09171615,0.003932912,0.0026956485,0.00038732932,0.003854298,0.0018412333,0.20299262],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9992804,0.00023847762,0.000038091082,0.00008761571,0.00029968272,0.000055701017],"domain_scores_gemma":[0.99606305,0.0023814263,0.00015894815,0.0002891018,0.0009581222,0.00014928894],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001162431,0.00076693896,0.0003463051,0.0065189623,0.0010052397,0.005819797,0.0012078247,0.00080374384,0.026229031],"category_scores_gemma":[0.007305945,0.00033429227,0.00051324244,0.008996802,0.0024186475,0.006674288,0.0017966315,0.0015314092,0.004933608],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006973228,0.000060011145,0.0012985142,0.0028019634,0.000023688226,0.00037546654,0.011909338,0.0027778076,0.0014156303,0.21699859,0.098052576,0.6642167],"study_design_scores_gemma":[0.000009195551,0.000051122726,0.0028653496,0.0020641733,0.000016611211,0.00038273877,0.009034845,0.0011446843,0.0010367503,0.08795913,0.8954027,0.000032637083],"about_ca_topic_score_codex":0.006240224,"about_ca_topic_score_gemma":0.0085496,"teacher_disagreement_score":0.9988376,"about_ca_system_score_codex":0.003388136,"about_ca_system_score_gemma":0.0019075313,"threshold_uncertainty_score":0.08774483},"labels":[],"label_agreement":null},{"id":"W13716421","doi":"10.1007/978-3-642-33868-7_36","title":"Robust Luminance and Chromaticity for Matte Regression in Polynomial Texture Mapping","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Simon Fraser University","funders":"","keywords":"Standard illuminant; Chromaticity; Artificial intelligence; Luminance; Computer science; Computer vision; Specularity; Color constancy; Pixel; Polynomial; Polynomial regression; Pattern recognition (psychology); Algorithm; Mathematics; Linear regression; Specular reflection; Image (mathematics); Optics","score_opus":0.029071497454110775,"score_gpt":0.26414022442836393,"score_spread":0.23506872697425316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13716421","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.0138626145,0.00018931003,0.98445237,0.00009004458,0.000027979288,0.000016006896,0.00008235005,0.00057189533,0.0007074296],"genre_scores_gemma":[0.31328344,0.0008054392,0.67581505,0.00009437152,0.00013040396,0.00008935027,0.0005829904,0.00076786784,0.008431179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996562,0.0000992115,0.000012628372,0.00008003404,0.00010403832,0.00004791647],"domain_scores_gemma":[0.9991948,0.0004121906,0.000077138764,0.00014050404,0.00013098177,0.00004433324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006230931,0.00073638855,0.00089180795,0.0005014505,0.00026744814,0.00075144414,0.00093927205,0.0008498807,0.0035723855],"category_scores_gemma":[0.0037688103,0.00044110994,0.0007413106,0.0006681198,0.00062786386,0.0008835366,0.00095860864,0.0015000562,0.0012536168],"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.0005686175,0.00014162554,0.0011430427,0.00029835076,0.000121893405,0.00012507664,0.00015939097,0.3028264,0.10965969,0.038024753,0.006042676,0.5408885],"study_design_scores_gemma":[0.000009392205,0.000023457898,0.00032000538,0.000007778293,0.00000925862,0.000041035364,0.000009928333,0.98627055,0.0072621796,0.0049507827,0.0010846311,0.000010876079],"about_ca_topic_score_codex":0.0042939046,"about_ca_topic_score_gemma":0.005554364,"teacher_disagreement_score":0.0042939046,"about_ca_system_score_codex":0.00047938974,"about_ca_system_score_gemma":0.0006388162,"threshold_uncertainty_score":0.011950791},"labels":[],"label_agreement":null},{"id":"W137370745","doi":"10.1007/978-3-642-37057-1_3","title":"Change Propagation due to Uncertainty Change","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.07286803351559905,"score_gpt":0.29038263864691055,"score_spread":0.2175146051313115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137370745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088136,0.0012869219,0.8716828,0.002202219,0.00044355087,0.00011445198,0.00045177367,0.0006861489,0.03499608],"genre_scores_gemma":[0.9320961,0.0012330414,0.047129627,0.00030943216,0.00028653955,0.00010666484,0.00032765314,0.00029070844,0.018220237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794465,0.00042072567,0.00009498907,0.00048318462,0.00082571665,0.00023076322],"domain_scores_gemma":[0.98286897,0.012155366,0.0015391349,0.001390799,0.0016763841,0.0003693531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035385722,0.0007722648,0.00086513936,0.002431742,0.00085541303,0.0029010992,0.0015891879,0.0021219149,0.00960379],"category_scores_gemma":[0.03707858,0.00077673804,0.0012612172,0.0027199544,0.001615572,0.0053928504,0.0024740323,0.002421659,0.0009339721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036344366,0.00007971986,0.006767053,0.00027922736,0.0002087335,0.0010760677,0.00066621485,0.46201727,0.004465352,0.37344098,0.0060840403,0.14455192],"study_design_scores_gemma":[0.000020974006,0.000061166764,0.0028575046,0.000043078326,0.00007183156,0.00039796226,0.00013795348,0.71344185,0.0015916168,0.27681813,0.0045053037,0.000052578507],"about_ca_topic_score_codex":0.0034273444,"about_ca_topic_score_gemma":0.0011452438,"teacher_disagreement_score":0.00960379,"about_ca_system_score_codex":0.001622386,"about_ca_system_score_gemma":0.00062098016,"threshold_uncertainty_score":0.032127917},"labels":[],"label_agreement":null},{"id":"W137786571","doi":"10.1007/978-3-319-07983-7_16","title":"A Joint Topic Viewpoint Model for Contention Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Computer science; Viewpoints; Joint (building); Cluster analysis; Artificial intelligence; Topic model; Task (project management); Machine learning; Natural language processing; Data mining","score_opus":0.04561638270394379,"score_gpt":0.27152724685294616,"score_spread":0.22591086414900236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137786571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013019092,0.0008001111,0.9803257,0.0006691101,0.00017549611,0.0001566989,0.000774645,0.0009830368,0.0030960015],"genre_scores_gemma":[0.48704895,0.0012355845,0.49142656,0.00034199803,0.0007159817,0.000755137,0.0040050754,0.00066220574,0.0138084395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980566,0.0007375061,0.000100282494,0.00045656803,0.00041247878,0.0002365144],"domain_scores_gemma":[0.99385047,0.0042445445,0.00021887645,0.0006050188,0.00081264245,0.00026847498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037890326,0.0010989546,0.0016890874,0.0025385765,0.0009629462,0.0029263047,0.0041468837,0.0020487488,0.009480114],"category_scores_gemma":[0.013502113,0.0007294272,0.00217469,0.0035236194,0.00080769096,0.0048655192,0.0022167293,0.00310307,0.002735736],"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.00095190026,0.0005215695,0.006181108,0.00035201042,0.00047973503,0.00034077468,0.0008696329,0.27913618,0.004870463,0.1877351,0.03384424,0.48471725],"study_design_scores_gemma":[0.000021050473,0.00001982135,0.0002082356,0.000010893225,0.000041328534,0.000022417666,0.0000263714,0.9637432,0.00019210309,0.034354504,0.0013491422,0.000010961536],"about_ca_topic_score_codex":0.012077487,"about_ca_topic_score_gemma":0.017338749,"teacher_disagreement_score":0.012077487,"about_ca_system_score_codex":0.0018439078,"about_ca_system_score_gemma":0.002442521,"threshold_uncertainty_score":0.03171414},"labels":[],"label_agreement":null},{"id":"W138029093","doi":"10.1007/978-3-319-10428-7_32","title":"CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Heuristic; Constraint programming; Workload; Constraint (computer-aided design); Integer programming; Quadratic programming; Quadratic equation; Integer (computer science); Constraint satisfaction; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.05879193697667804,"score_gpt":0.3180408946918351,"score_spread":0.25924895771515705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138029093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012249964,0.0026707281,0.9149951,0.0025230437,0.00047415402,0.0001626597,0.0013311555,0.00030311293,0.06529012],"genre_scores_gemma":[0.5790366,0.0064993678,0.2782067,0.0012328469,0.0013174373,0.0013231576,0.002780483,0.0005257353,0.1290777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939096,0.00022219571,0.000020656858,0.00009191887,0.00016922793,0.00010508442],"domain_scores_gemma":[0.999119,0.00048893836,0.000083647574,0.0000426793,0.0001794263,0.00008637899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806418,0.0011196822,0.0009991314,0.0005406376,0.0004740861,0.0016001009,0.0027739622,0.0014158802,0.017506422],"category_scores_gemma":[0.0035602178,0.0005013577,0.0010197972,0.0014661534,0.0005951614,0.0014686197,0.00092168996,0.0030215038,0.00143866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006841038,0.00007411726,0.00020280696,0.00020194077,0.000027602307,0.00004885331,0.00005529869,0.8231825,0.00043623778,0.12544714,0.01753679,0.032718275],"study_design_scores_gemma":[0.000012092612,0.000024690038,0.00013294347,0.000017390988,0.0000096401145,0.00002034516,0.000015981028,0.9566251,0.00005878243,0.03869603,0.0043780007,0.000009042182],"about_ca_topic_score_codex":0.013663402,"about_ca_topic_score_gemma":0.014435547,"teacher_disagreement_score":0.017506422,"about_ca_system_score_codex":0.0022645225,"about_ca_system_score_gemma":0.0022421905,"threshold_uncertainty_score":0.058564782},"labels":[],"label_agreement":null},{"id":"W138337706","doi":"10.1007/978-3-642-33860-1_10","title":"Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","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":"Queen's University","funders":"","keywords":"Computer science; Randomized algorithm; Wireless sensor network; Probabilistic logic; Locality; Cellular automaton; Set (abstract data type); Algorithm; Automaton; Theoretical computer science; Distributed computing; Artificial intelligence; Computer network","score_opus":0.03956445200174695,"score_gpt":0.2819148690352345,"score_spread":0.24235041703348753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138337706","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.011682042,0.00048707076,0.984209,0.0001297296,0.00007044658,0.000031576707,0.000069745336,0.00046887837,0.002851562],"genre_scores_gemma":[0.6469309,0.000924354,0.345193,0.00011039645,0.000046922516,0.00027905742,0.00030626197,0.0001452222,0.006063958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998036,0.00005687447,0.000012576148,0.00003934541,0.000059871807,0.000027774291],"domain_scores_gemma":[0.99940705,0.00036690428,0.00003722513,0.000052108888,0.00011346763,0.000023304938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034648163,0.00061974506,0.0008601869,0.0005631005,0.00049452943,0.00064803596,0.0013089373,0.0008327473,0.0020907342],"category_scores_gemma":[0.001675538,0.00051111536,0.00052630797,0.00094208174,0.0006028762,0.00063381426,0.0008801801,0.0008906488,0.00043643257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029634297,0.0000115082585,0.00015197777,0.00002816684,0.000013994354,0.000018193512,0.000034335495,0.9555257,0.00085647934,0.009574995,0.00074682623,0.033008154],"study_design_scores_gemma":[0.000003361799,0.000005770823,0.000018827352,0.0000026615278,0.000002394618,0.0000040249315,0.000003834827,0.9950216,0.00015613524,0.004505327,0.00027391824,0.000002252412],"about_ca_topic_score_codex":0.0128505295,"about_ca_topic_score_gemma":0.011291848,"teacher_disagreement_score":0.0128505295,"about_ca_system_score_codex":0.0008754214,"about_ca_system_score_gemma":0.0008442863,"threshold_uncertainty_score":0.025551438},"labels":[],"label_agreement":null},{"id":"W138627","doi":"10.1007/978-3-642-24583-1_31","title":"COCA Filters: Co-occurrence Aware Bloom Filters","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; Computer science; Search engine indexing; Signature (topology); Exploit; Index (typography); Bloom; Data mining; Algorithm; Artificial intelligence; Mathematics; Computer security; World Wide Web","score_opus":0.031003897410714805,"score_gpt":0.2438658754085357,"score_spread":0.2128619779978209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138627","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.011888377,0.0018659714,0.9440214,0.00039721056,0.00034876948,0.000333769,0.0020597652,0.03100847,0.00807627],"genre_scores_gemma":[0.19277106,0.0016554291,0.7731907,0.0005249884,0.00034725884,0.00045275,0.004727965,0.0022592836,0.024070611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829453,0.0002365349,0.00015121265,0.00030341084,0.00082426943,0.00018998157],"domain_scores_gemma":[0.99447834,0.0019043534,0.00027352545,0.002142317,0.0009337844,0.0002676373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015413308,0.0011988676,0.0018217805,0.0029087232,0.0014045172,0.0043012276,0.0027353768,0.001765947,0.010110792],"category_scores_gemma":[0.007108591,0.0010969349,0.0008023037,0.004702872,0.00078522955,0.0047602956,0.0026284931,0.0014787455,0.0049726297],"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.0020409536,0.00038136708,0.0030570019,0.0005446772,0.00019140547,0.00020954407,0.00025098448,0.017469494,0.027491445,0.077456415,0.088790245,0.78211653],"study_design_scores_gemma":[0.0002891386,0.0002250653,0.0008476907,0.00015450497,0.0002221261,0.0008234585,0.00016780412,0.62780535,0.10019215,0.11901576,0.15011139,0.00014551127],"about_ca_topic_score_codex":0.006605836,"about_ca_topic_score_gemma":0.010955511,"teacher_disagreement_score":0.010110792,"about_ca_system_score_codex":0.001894228,"about_ca_system_score_gemma":0.0025992251,"threshold_uncertainty_score":0.033823967},"labels":[],"label_agreement":null},{"id":"W138750640","doi":"10.1007/978-3-642-03668-2_26","title":"Holonic Modelling of Large Scale Geographic Environments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Situated; Computer science; Geographic information system; Representation (politics); Scale (ratio); Data science; Artificial intelligence; Geography; Cartography","score_opus":0.01631348630134387,"score_gpt":0.22174833510947373,"score_spread":0.20543484880812984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138750640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013386683,0.0002755482,0.9737265,0.00015375491,0.0000744488,0.000024938223,0.00028859914,0.00038571793,0.011683864],"genre_scores_gemma":[0.7484709,0.0018166364,0.21820253,0.00014482415,0.00015349232,0.00018276664,0.0012123053,0.0005536252,0.02926293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997881,0.000059358073,0.000015325051,0.000040212657,0.00006838884,0.000028586928],"domain_scores_gemma":[0.99952483,0.00019204154,0.000059016398,0.00009283282,0.000079293175,0.00005208328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025769812,0.00070604624,0.0007325006,0.0008407712,0.00054632616,0.0021141497,0.0018858245,0.0009571083,0.005190496],"category_scores_gemma":[0.001366274,0.00060569803,0.00078660005,0.0014590793,0.0011197244,0.0019628783,0.0016993654,0.000968011,0.0008613622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016964856,0.000010772542,0.00036826005,0.00005914522,0.00002284866,0.00008565034,0.00012041644,0.9151407,0.0008167409,0.06963813,0.0011208287,0.012599538],"study_design_scores_gemma":[0.0000034948562,0.000004585262,0.000109412234,0.000005597572,0.000004708147,0.000022529708,0.00002407012,0.9712451,0.00015452511,0.025986193,0.0024336788,0.000006092656],"about_ca_topic_score_codex":0.014441851,"about_ca_topic_score_gemma":0.014723889,"teacher_disagreement_score":0.014441851,"about_ca_system_score_codex":0.0008798531,"about_ca_system_score_gemma":0.0006357178,"threshold_uncertainty_score":0.02871555},"labels":[],"label_agreement":null},{"id":"W138908886","doi":"10.1007/978-3-642-32894-7_20","title":"Reliable Node Placement in Wireless Sensor Networks Using Cellular Automata","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Cellular automaton; Node (physics); Key distribution in wireless sensor networks; Task (project management); Automaton; Sensor node; Computer network; Wireless; Distributed computing; Wireless network; Theoretical computer science; Algorithm; Telecommunications; Engineering","score_opus":0.020152159494385608,"score_gpt":0.22512867947250456,"score_spread":0.20497651997811894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138908886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026135597,0.0011093558,0.96844596,0.00016050113,0.00013685123,0.00003257751,0.00003415618,0.00029538674,0.0036496255],"genre_scores_gemma":[0.8363005,0.0015767254,0.1547736,0.000060171402,0.000099285746,0.00017927613,0.00008279077,0.000091841386,0.0068357587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967575,0.00010634835,0.000021250125,0.000059637023,0.000111174624,0.000025908586],"domain_scores_gemma":[0.99935955,0.0003709984,0.000056216162,0.00008253419,0.00010607277,0.000024697645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165628,0.00061715033,0.00075877307,0.00047854515,0.0004899178,0.0009001546,0.0012526541,0.0009918545,0.00080887985],"category_scores_gemma":[0.0018637459,0.0005873493,0.00048609645,0.000884169,0.0008652457,0.00085500075,0.000833411,0.00069495954,0.0002848116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034449273,0.000014179987,0.00022710559,0.00006471768,0.000017694854,0.000059055175,0.000056156583,0.9462442,0.0048081395,0.022378314,0.00064850296,0.025447553],"study_design_scores_gemma":[0.0000035625985,0.000011662944,0.00003453702,0.000004340868,0.0000032636638,0.000010779868,0.000006308323,0.9899239,0.0005688287,0.0090785,0.00035006573,0.000004260852],"about_ca_topic_score_codex":0.0019728146,"about_ca_topic_score_gemma":0.002111991,"teacher_disagreement_score":0.0019728146,"about_ca_system_score_codex":0.00067815784,"about_ca_system_score_gemma":0.00047660514,"threshold_uncertainty_score":0.0049203634},"labels":[],"label_agreement":null},{"id":"W139194355","doi":"10.1007/978-3-642-23786-7_19","title":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":139,"is_retracted":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":"Maximum satisfiability problem; Sequence (biology); Computer science; Conjunctive normal form; Boolean satisfiability problem; Generalization; Satisfiability; Algorithm; Set (abstract data type); Mathematical optimization; Theoretical computer science; Mathematics; Boolean function; Programming language","score_opus":0.02642937924592157,"score_gpt":0.24493007144181175,"score_spread":0.2185006921958902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139194355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03944299,0.0007653118,0.89218795,0.0015545948,0.0008695398,0.001517475,0.0014403714,0.004453307,0.057768527],"genre_scores_gemma":[0.059983846,0.0004044994,0.9194731,0.0005174899,0.00025550465,0.0005228644,0.0022585029,0.0006937313,0.015890447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873096,0.00030784262,0.000098745484,0.0003448889,0.00037471106,0.00014293639],"domain_scores_gemma":[0.99767286,0.001311358,0.00011823636,0.0005181599,0.00030007132,0.00007928284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002456,0.0016364884,0.0019594317,0.0010392056,0.0010253633,0.0020414304,0.0030859374,0.0014426406,0.03946724],"category_scores_gemma":[0.0048179855,0.0014368698,0.0030256493,0.0019291696,0.0007601271,0.003864408,0.002047134,0.0049162544,0.008091441],"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.0010910318,0.0014684092,0.0013106649,0.002536638,0.0003619074,0.00078647287,0.00043256048,0.20617414,0.036492143,0.123170435,0.059854545,0.566321],"study_design_scores_gemma":[0.0005020213,0.00063895824,0.001277537,0.00016836773,0.00033218975,0.0008299965,0.00033386168,0.6274474,0.01816413,0.27961072,0.070567384,0.0001274263],"about_ca_topic_score_codex":0.0027360495,"about_ca_topic_score_gemma":0.006646894,"teacher_disagreement_score":0.03946724,"about_ca_system_score_codex":0.0011331053,"about_ca_system_score_gemma":0.002028082,"threshold_uncertainty_score":0.13203108},"labels":[],"label_agreement":null},{"id":"W139446895","doi":"10.1007/978-3-319-10160-6_13","title":"Discovering Community Preference Influence Network by Social Network Opinion Posts Mining","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Windsor","funders":"","keywords":"Computer science; Popularity; Friendship; Similarity (geometry); Preference; Social network (sociolinguistics); Sentiment analysis; Service (business); Product (mathematics); Information retrieval; World Wide Web; Maximization; Social network service; Data science; Data mining; Social media; Artificial intelligence; Psychology","score_opus":0.027814156645366118,"score_gpt":0.25953015294893816,"score_spread":0.23171599630357204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139446895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4397316,0.0018187481,0.5368179,0.0006280766,0.00018755339,0.00041810403,0.0036505822,0.0012789189,0.015468539],"genre_scores_gemma":[0.8586048,0.0007500415,0.13101049,0.00009150552,0.00023343478,0.00019834189,0.0041479813,0.000086667496,0.0048767906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994473,0.000101337726,0.00002685715,0.00014699204,0.0002170761,0.000060434584],"domain_scores_gemma":[0.99908185,0.00036547243,0.00013605987,0.00005795844,0.00029247903,0.00006620287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043458393,0.00066001265,0.00054066256,0.0033671549,0.0006386452,0.000931017,0.0005857389,0.00050357555,0.0014982048],"category_scores_gemma":[0.0024729148,0.00026516835,0.00073936686,0.0025980289,0.00022371927,0.0015080724,0.00052189914,0.0005607041,0.0010111762],"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.0005764283,0.00068794825,0.076410234,0.00060106604,0.0005378783,0.0011705654,0.0007672627,0.021878721,0.050667237,0.013302076,0.022781024,0.8106195],"study_design_scores_gemma":[0.000038973805,0.0002009868,0.0272285,0.000060476406,0.00031615954,0.0006781545,0.000581008,0.9266354,0.015732013,0.01682208,0.011646481,0.00005968582],"about_ca_topic_score_codex":0.002694446,"about_ca_topic_score_gemma":0.0056702956,"teacher_disagreement_score":0.0033671549,"about_ca_system_score_codex":0.0004305729,"about_ca_system_score_gemma":0.00041698254,"threshold_uncertainty_score":0.005357504},"labels":[],"label_agreement":null},{"id":"W139806551","doi":"10.1007/978-3-319-12691-3_12","title":"Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Regret; Sink (geography); Minimax; Computer science; Vertex (graph theory); Algorithm; Path (computing); Graph; Mathematical optimization; Mathematics; Theoretical computer science; Computer network; Machine learning; Geography","score_opus":0.0237952527342592,"score_gpt":0.23719541046453593,"score_spread":0.21340015773027673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139806551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016619533,0.00067908416,0.974192,0.00061874173,0.0002881696,0.00022700419,0.0005014913,0.0019347982,0.0049391305],"genre_scores_gemma":[0.16505343,0.00038008363,0.8218002,0.0003874116,0.00031964906,0.0006395575,0.0015952863,0.00089394563,0.008930412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971275,0.0009586961,0.00013380806,0.000673769,0.000622892,0.00048339128],"domain_scores_gemma":[0.9896966,0.00740711,0.00038035976,0.001112133,0.0010167115,0.0003869814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050373846,0.0032771886,0.003402362,0.0020895496,0.0015751573,0.0032206175,0.0069378237,0.003781457,0.014937387],"category_scores_gemma":[0.018066438,0.0014432356,0.00244109,0.003252377,0.0020432721,0.0056708143,0.0038498004,0.0055439514,0.0022015853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033830665,0.00016952338,0.00055465754,0.00016616858,0.00006774268,0.00004292023,0.00008335736,0.9109728,0.00050448714,0.020901274,0.007581158,0.058617577],"study_design_scores_gemma":[0.000026237047,0.000022432556,0.00007835192,0.000008766981,0.0000104870205,0.000009994357,0.000011936393,0.98416406,0.00017201401,0.01511422,0.00037457852,0.000006796289],"about_ca_topic_score_codex":0.011922861,"about_ca_topic_score_gemma":0.017576355,"teacher_disagreement_score":0.014937387,"about_ca_system_score_codex":0.0051683835,"about_ca_system_score_gemma":0.0046449667,"threshold_uncertainty_score":0.049970567},"labels":[],"label_agreement":null},{"id":"W139961733","doi":"10.1007/978-3-642-39357-0_17","title":"Evaluation of n-Gram-Based Classification Approaches on Classical Music Corpora","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"Dalhousie University","funders":"","keywords":"Computer science; n-gram; Scope (computer science); Range (aeronautics); Similarity (geometry); Artificial intelligence; Gram; Natural language processing; Pattern recognition (psychology); Feature extraction; Feature (linguistics); Speech recognition; Language model; Image (mathematics); Linguistics; Programming language","score_opus":0.1550515016788449,"score_gpt":0.28070027820927745,"score_spread":0.12564877653043255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139961733","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.76780564,0.021731058,0.12607062,0.001975479,0.0028329212,0.0011097349,0.01794007,0.032989725,0.027544845],"genre_scores_gemma":[0.6595842,0.0054469225,0.22233623,0.0007178338,0.0008872886,0.00068385544,0.089193985,0.0018335205,0.019316109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932894,0.002493104,0.00069157744,0.001421749,0.001526582,0.00057765417],"domain_scores_gemma":[0.9841989,0.009525573,0.0004426933,0.0013679743,0.003710141,0.0007546801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006831997,0.0036200495,0.0022365395,0.0058565396,0.0020435718,0.0032400815,0.0025403048,0.0030490204,0.006665795],"category_scores_gemma":[0.013944816,0.00051012007,0.0015852132,0.004936912,0.0008917604,0.004662515,0.0031666998,0.0018590488,0.008150792],"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.00666872,0.0017371221,0.006903544,0.0020744165,0.0010336456,0.00064723747,0.0008531761,0.017112393,0.026223518,0.0013746434,0.05069044,0.88468117],"study_design_scores_gemma":[0.0013343208,0.0029848954,0.029833857,0.0004399252,0.0012066913,0.001456762,0.004655838,0.88357055,0.044242937,0.004588959,0.02537852,0.00030679646],"about_ca_topic_score_codex":0.018721828,"about_ca_topic_score_gemma":0.027884323,"teacher_disagreement_score":0.018721828,"about_ca_system_score_codex":0.0013601299,"about_ca_system_score_gemma":0.001707092,"threshold_uncertainty_score":0.037225664},"labels":[],"label_agreement":null},{"id":"W140131361","doi":"10.1007/978-3-642-31298-4_14","title":"Heuristic and Voxel-Based Signature for Hand Posture Recognition Using a Range Camera","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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 Calgary","funders":"","keywords":"Gesture; Computer science; Signature (topology); Artificial intelligence; Voxel; Computer vision; Heuristic; Range (aeronautics); Gesture recognition; Pattern recognition (psychology); Speech recognition; Mathematics","score_opus":0.03591211699898068,"score_gpt":0.2601487970287477,"score_spread":0.22423668002976704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140131361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010015677,0.00020487822,0.9868302,0.0000325007,0.000032130083,0.000050575294,0.000090152986,0.0016353979,0.001108489],"genre_scores_gemma":[0.14543091,0.000334235,0.8513209,0.00006661891,0.00003859046,0.000070379225,0.00026886776,0.00027559785,0.002193897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922824,0.00010567911,0.00004611137,0.0001572843,0.00038462458,0.00007803258],"domain_scores_gemma":[0.9992418,0.00016743246,0.00006266311,0.00019460682,0.00027295598,0.00006057783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004786405,0.00064609275,0.0011922284,0.0014566587,0.00031569263,0.0012037444,0.0013974413,0.00089016993,0.005093967],"category_scores_gemma":[0.001540699,0.0005417629,0.00058018987,0.0013809464,0.00056324434,0.0012015136,0.0009859313,0.00078525953,0.0032139535],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003630128,0.00008877684,0.0010872899,0.00018033641,0.000043466418,0.00013860394,0.00006940928,0.013167128,0.18113244,0.0040735067,0.0019415162,0.79771453],"study_design_scores_gemma":[0.000050810868,0.00044503133,0.004592786,0.000057448346,0.000082757426,0.0026670767,0.0001360017,0.81120324,0.16642506,0.008188272,0.00602889,0.00012257893],"about_ca_topic_score_codex":0.0016102033,"about_ca_topic_score_gemma":0.0027405315,"teacher_disagreement_score":0.005093967,"about_ca_system_score_codex":0.0003634345,"about_ca_system_score_gemma":0.0010747997,"threshold_uncertainty_score":0.017041028},"labels":[],"label_agreement":null},{"id":"W14029668","doi":"10.1007/978-3-642-31623-4_12","title":"State Complexity of Star and Square of Union of k Regular Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"State (computer science); Star (game theory); Component (thermodynamics); Discrete mathematics; Mathematics; Combinatorics; Computer science; Algorithm; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.019033828007513583,"score_gpt":0.24505816518295828,"score_spread":0.2260243371754447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14029668","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.902847,0.00048130183,0.06898187,0.0015083308,0.000052821128,0.00006146455,0.0011008402,0.0003556432,0.02461073],"genre_scores_gemma":[0.98725325,0.00016059089,0.0070882016,0.00005505581,0.00005952629,0.000049135775,0.00059922284,0.00010225804,0.0046327394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980603,0.0003915798,0.0001467774,0.00039856895,0.00055668544,0.00044598925],"domain_scores_gemma":[0.9814401,0.014415781,0.0010047319,0.0011902102,0.0009731668,0.00097593095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011951124,0.0003902116,0.0011649833,0.00093439396,0.0016340829,0.0063080485,0.0018558211,0.0014683722,0.012417438],"category_scores_gemma":[0.012053575,0.0008087461,0.0015908115,0.0013541913,0.0025645664,0.009795279,0.0025290283,0.002695848,0.00067958276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010298726,0.00015033303,0.005254126,0.00026795286,0.00006878016,0.0002898917,0.0016963325,0.05959398,0.0052999095,0.9044554,0.004017578,0.01787578],"study_design_scores_gemma":[0.000056942976,0.00006784392,0.0017839827,0.000018424671,0.000043762615,0.00014301353,0.0003170279,0.22784056,0.0026601085,0.7659879,0.0010369676,0.00004346137],"about_ca_topic_score_codex":0.004057239,"about_ca_topic_score_gemma":0.0039199665,"teacher_disagreement_score":0.012417438,"about_ca_system_score_codex":0.002768325,"about_ca_system_score_gemma":0.0021495149,"threshold_uncertainty_score":0.041540444},"labels":[],"label_agreement":null},{"id":"W140524791","doi":"10.1007/978-3-642-40763-5_5","title":"Atlas Construction for Dynamic (4D) PET Using Diffeomorphic Transformations","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Computer science; Atlas (anatomy); Artificial intelligence; Computer vision; Image registration; Scanner; Positron emission tomography; Raclopride; Dimension (graph theory); Nuclear medicine; Image (mathematics); Mathematics","score_opus":0.017294921980758514,"score_gpt":0.3014927551300216,"score_spread":0.2841978331492631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140524791","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.0061192224,0.00008392525,0.99101406,0.00008705042,0.000039562543,0.000038885275,0.00018204136,0.0005817839,0.0018534478],"genre_scores_gemma":[0.18630333,0.0005006539,0.8047539,0.00013472822,0.000058991023,0.0001933592,0.0010871104,0.001333304,0.005634629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997631,0.000047173464,0.000016367534,0.00005216704,0.000089833964,0.00003136864],"domain_scores_gemma":[0.9996768,0.0000829267,0.00003559266,0.00010390304,0.0000762559,0.000024457091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049818266,0.00054751267,0.0005692966,0.0013307793,0.0005246966,0.0016880118,0.00083710236,0.00081748515,0.005060469],"category_scores_gemma":[0.0016181798,0.0006956987,0.0009978717,0.0010978392,0.00052460463,0.00088742864,0.0015486999,0.0011879135,0.0022076776],"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.00035975227,0.00009565635,0.0030328855,0.000510812,0.00016851925,0.0015341059,0.00064124155,0.12713712,0.12481808,0.21080841,0.015561851,0.5153315],"study_design_scores_gemma":[0.000057174453,0.00023920926,0.0026987994,0.00008472035,0.00012932374,0.003755852,0.00032596415,0.62214595,0.10666852,0.1610219,0.10274149,0.0001309965],"about_ca_topic_score_codex":0.0015192762,"about_ca_topic_score_gemma":0.0017875718,"teacher_disagreement_score":0.005060469,"about_ca_system_score_codex":0.0004831934,"about_ca_system_score_gemma":0.0009049299,"threshold_uncertainty_score":0.016928911},"labels":[],"label_agreement":null},{"id":"W140815605","doi":"10.1007/978-3-642-31295-3_15","title":"A Mixture of Experts Approach to Multi-strategy Image Quality Assessment","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","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":"Simon Fraser University","funders":"","keywords":"Computer science; Quality (philosophy); Image (mathematics); Artificial intelligence; Machine learning; Image quality; Data mining; Bayesian probability; Pattern recognition (psychology)","score_opus":0.08204959123979945,"score_gpt":0.3631172269044968,"score_spread":0.2810676356646974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140815605","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.0013705945,0.00014806239,0.9976682,0.00004482943,0.000014349706,0.000022004866,0.000011149482,0.00009634649,0.0006243735],"genre_scores_gemma":[0.14702949,0.0004045595,0.84638226,0.00011784609,0.00013129767,0.00021373386,0.00012386942,0.0001451089,0.0054517887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968953,0.0013791892,0.00016978243,0.00044579507,0.00091539713,0.00019444316],"domain_scores_gemma":[0.9932221,0.004562901,0.00025278583,0.0003309237,0.0014494046,0.00018194011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005310049,0.001388602,0.00183362,0.001717866,0.00054072007,0.0019100286,0.0035740614,0.0026444874,0.0037761615],"category_scores_gemma":[0.01240329,0.0011382212,0.0015630784,0.0014463182,0.00072225835,0.0024351673,0.002620303,0.0018498051,0.001032382],"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.0004004567,0.00023819579,0.0012305601,0.00041514795,0.0005558311,0.00032454706,0.00046400636,0.41517574,0.011584535,0.054482643,0.0038406171,0.5112877],"study_design_scores_gemma":[0.000009843476,0.000044609584,0.00019687628,0.000014205608,0.000041370633,0.00005729279,0.000021190672,0.98234516,0.0012695418,0.015122925,0.0008550827,0.000022006043],"about_ca_topic_score_codex":0.0043400177,"about_ca_topic_score_gemma":0.0045182714,"teacher_disagreement_score":0.005310049,"about_ca_system_score_codex":0.00086705026,"about_ca_system_score_gemma":0.0008931043,"threshold_uncertainty_score":0.02808255},"labels":[],"label_agreement":null},{"id":"W1409270883","doi":"10.1007/978-3-319-15585-2_1","title":"A Note on Local Refinement for Direction Splitting Methods","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Methods in Computational Mathematics","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 Alberta","funders":"","keywords":"Schur complement; Domain decomposition methods; Tridiagonal matrix; Solver; Discretization; Linear system; Complement (music); Grid; Computation; Computer science; Preconditioner; Matrix (chemical analysis); Applied mathematics; Diagonal; Mathematics; Algorithm; Mathematical optimization; Eigenvalues and eigenvectors; Mathematical analysis; Geometry; Finite element method","score_opus":0.05694922416239673,"score_gpt":0.3740036500074527,"score_spread":0.317054425845056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409270883","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.0025209908,0.03018406,0.9045869,0.003928474,0.00681509,0.000081781705,0.00021350711,0.0009089365,0.050760243],"genre_scores_gemma":[0.0774243,0.028562201,0.7823418,0.0040324647,0.0065247887,0.00037910123,0.0005175386,0.0028143665,0.09740344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998934,0.0003798106,0.000054958728,0.00013868477,0.00043770415,0.000054796437],"domain_scores_gemma":[0.9982054,0.0010268627,0.000048891518,0.0003161628,0.0003312056,0.00007146994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021428189,0.0011552674,0.0012587736,0.0014283328,0.00074965076,0.0013297708,0.0018889469,0.0013748313,0.008641106],"category_scores_gemma":[0.004135181,0.00066787883,0.0016792837,0.0012309696,0.0023908971,0.0028345936,0.0029288393,0.0067097563,0.0036435365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019712397,0.00007918368,0.00026257656,0.0014275776,0.00008138829,0.00030361128,0.00044241245,0.018797133,0.015634038,0.63834906,0.08132798,0.24309789],"study_design_scores_gemma":[0.00004849158,0.00012883746,0.0005055011,0.0004485337,0.000077372504,0.00037460972,0.00007752155,0.064449,0.00785367,0.56739146,0.35855532,0.000089690526],"about_ca_topic_score_codex":0.0020879095,"about_ca_topic_score_gemma":0.0030575756,"teacher_disagreement_score":0.008641106,"about_ca_system_score_codex":0.00078613136,"about_ca_system_score_gemma":0.00066909794,"threshold_uncertainty_score":0.028907359},"labels":[],"label_agreement":null},{"id":"W1409844201","doi":"10.1007/978-3-319-16363-5_8","title":"Differential Sieving for 2-Step Matching Meet-in-the-Middle Attack with Application to LBlock","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Matching (statistics); Algorithm; Differential (mechanical device); Plaintext; Cipher; Theoretical computer science; Cryptography; Mathematics; Computer security; Encryption","score_opus":0.04213478822813087,"score_gpt":0.2959762802090728,"score_spread":0.2538414919809419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409844201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038473196,0.0004987429,0.93592787,0.0004193881,0.0001839419,0.000104137005,0.00008136429,0.00079849607,0.023512995],"genre_scores_gemma":[0.76768124,0.00083782297,0.19368327,0.00046558015,0.00028029343,0.00025969546,0.0002996629,0.00036589734,0.036126457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987538,0.00026129006,0.00006822935,0.00021962156,0.00042004648,0.00027701436],"domain_scores_gemma":[0.9989618,0.00046467528,0.000083391256,0.00028773095,0.00012160835,0.00008080631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011230246,0.0009912957,0.0013507663,0.0012874551,0.00094445125,0.0022553252,0.001302287,0.0018021916,0.0075238077],"category_scores_gemma":[0.0039833575,0.0004747945,0.0011105086,0.0015324726,0.0019334318,0.0036013438,0.0050649797,0.0032201644,0.002395517],"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.00041386776,0.00020914935,0.000737119,0.0001781859,0.00005182114,0.00025057502,0.0003684827,0.029919615,0.013329792,0.79721457,0.006394448,0.15093234],"study_design_scores_gemma":[0.00006123876,0.00015836026,0.00026464392,0.000042662017,0.00003963317,0.0003502637,0.00007534809,0.29352182,0.0095310025,0.6878172,0.008087187,0.00005059365],"about_ca_topic_score_codex":0.00030804102,"about_ca_topic_score_gemma":0.00032822517,"teacher_disagreement_score":0.0075238077,"about_ca_system_score_codex":0.000943555,"about_ca_system_score_gemma":0.0008670172,"threshold_uncertainty_score":0.025169611},"labels":[],"label_agreement":null},{"id":"W1410101980","doi":"10.1007/978-3-642-38079-2_6","title":"A Prospective Evaluation of Computer-Assisted Deep Brain Stimulation Trajectory Planning","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Deep brain stimulation; Trajectory; Stimulation; Computer science; Neuroscience; Physical medicine and rehabilitation; Psychology; Medicine; Physics; Internal medicine","score_opus":0.0454303421742552,"score_gpt":0.31087864137281934,"score_spread":0.26544829919856416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1410101980","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.9701882,0.0011112981,0.020775424,0.00014887945,0.00014436195,0.0014831672,0.003068369,0.00034287677,0.0027374886],"genre_scores_gemma":[0.9844274,0.0004084203,0.010033499,0.00011429797,0.000080847516,0.00093349983,0.0023530778,0.00011286104,0.0015360076],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99912804,0.00048519147,0.00007892543,0.00013770211,0.000120711295,0.000049477778],"domain_scores_gemma":[0.99420714,0.0035945175,0.00032758413,0.00062332914,0.0008292983,0.00041810918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022109172,0.0008876366,0.00063348695,0.00057010073,0.00018962336,0.0008145925,0.0009939981,0.0008293319,0.007354792],"category_scores_gemma":[0.009680528,0.00032437278,0.00039449215,0.00039791805,0.0008319835,0.00071933656,0.00062852487,0.0005993231,0.0015635974],"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.27844003,0.023297317,0.095380954,0.00252922,0.0026508034,0.0014475151,0.0015150909,0.06637178,0.06746028,0.0024326148,0.006487025,0.45198742],"study_design_scores_gemma":[0.033875763,0.30751967,0.29047164,0.00055608427,0.0035596385,0.006838001,0.0018643124,0.30010659,0.039394904,0.0048117465,0.010353998,0.00064759783],"about_ca_topic_score_codex":0.0031654947,"about_ca_topic_score_gemma":0.0017558476,"teacher_disagreement_score":0.007354792,"about_ca_system_score_codex":0.00029068196,"about_ca_system_score_gemma":0.00067088165,"threshold_uncertainty_score":0.02460426},"labels":[],"label_agreement":null},{"id":"W141061235","doi":"10.1007/978-3-319-03859-9_20","title":"Memory Efficient Multi-Swarm PSO Algorithm in OpenCL on an APU","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Manitoba","funders":"","keywords":"Computer science; Parallel computing; Very long instruction word; Asynchronous communication; Particle swarm optimization; Feature (linguistics); Vectorization (mathematics); Algorithm","score_opus":0.02204053626496093,"score_gpt":0.2737207215293828,"score_spread":0.2516801852644219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141061235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080340214,0.0005268621,0.8642616,0.00030437412,0.00035930416,0.0001302103,0.00018496945,0.009579261,0.044313256],"genre_scores_gemma":[0.414549,0.0001786129,0.56076753,0.0001799597,0.00007926171,0.00027361818,0.00038337507,0.0009270523,0.022661647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000044570315,0.000014809843,0.00003528123,0.000080528895,0.0000423864],"domain_scores_gemma":[0.99960905,0.000102474165,0.00001662829,0.00008246777,0.0001526897,0.0000367542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022207902,0.00051217416,0.00075387204,0.0004461278,0.0008136833,0.00087898,0.0016384231,0.0005699513,0.011066341],"category_scores_gemma":[0.0009925682,0.00026507408,0.00043197436,0.0008335619,0.00023387567,0.00077436276,0.00094802096,0.0007022069,0.0021118843],"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.0011915416,0.00036764573,0.0019627502,0.000466873,0.00013737827,0.00047200933,0.0003339561,0.24052587,0.030291757,0.022187367,0.024485912,0.6775769],"study_design_scores_gemma":[0.00011005192,0.00013850203,0.00043905302,0.000017638677,0.000030227387,0.000079395286,0.000050560073,0.9796179,0.006409179,0.00459251,0.008496849,0.000018158402],"about_ca_topic_score_codex":0.005121114,"about_ca_topic_score_gemma":0.008025481,"teacher_disagreement_score":0.011066341,"about_ca_system_score_codex":0.00042374237,"about_ca_system_score_gemma":0.00071407703,"threshold_uncertainty_score":0.037020624},"labels":[],"label_agreement":null},{"id":"W1410829195","doi":"10.1007/978-3-642-55224-3_49","title":"Adaptive Fork-Heuristics for Software Thread-Level Speculation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Computer science; Fork (system call); Heuristics; Thread (computing); Parallel computing; Software; Benchmark (surveying); Programming language; Operating system","score_opus":0.038596472022990096,"score_gpt":0.2688901419481105,"score_spread":0.2302936699251204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1410829195","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.028180271,0.0009958763,0.9614675,0.00024775072,0.00019459255,0.00008837084,0.00010765767,0.004637692,0.0040802993],"genre_scores_gemma":[0.4271857,0.00036887295,0.56661487,0.00021380381,0.00012343389,0.00014016441,0.00029533062,0.0009941289,0.004063661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998906,0.00032404883,0.0000808647,0.00017798423,0.00029495812,0.0002160818],"domain_scores_gemma":[0.99601763,0.0021829654,0.00017191921,0.0010187806,0.00044688623,0.0001618229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019643276,0.0008666451,0.0012313941,0.0009117354,0.000888631,0.0012013962,0.0025328526,0.001034209,0.007061846],"category_scores_gemma":[0.007092502,0.00080517086,0.00092672074,0.0012681313,0.00095684436,0.0022861266,0.0020505043,0.0023330462,0.001054455],"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.0013672569,0.0002784984,0.0018168746,0.00032545393,0.00015224506,0.00011146276,0.00030191048,0.33839205,0.012188871,0.07911903,0.017009834,0.54893655],"study_design_scores_gemma":[0.00006365575,0.0000546741,0.0001218669,0.000017386754,0.000027796701,0.000021181795,0.00002634265,0.9507194,0.0028139022,0.044410586,0.0017072976,0.000015959287],"about_ca_topic_score_codex":0.0036468494,"about_ca_topic_score_gemma":0.0074920324,"teacher_disagreement_score":0.007061846,"about_ca_system_score_codex":0.0012783617,"about_ca_system_score_gemma":0.002454557,"threshold_uncertainty_score":0.023624182},"labels":[],"label_agreement":null},{"id":"W14115579","doi":"10.1007/3-540-44732-6_18","title":"Feature Based Decision Fusion","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Voting; Classifier (UML); Majority rule; Artificial intelligence; Machine learning; Random subspace method; Data mining","score_opus":0.015027019635253385,"score_gpt":0.2493096760238658,"score_spread":0.23428265638861243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14115579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010457753,0.0012043959,0.9808859,0.00021977785,0.00024460655,0.000050188115,0.00019082926,0.0007562286,0.005990333],"genre_scores_gemma":[0.5394612,0.0010585823,0.44073364,0.0003382253,0.00030886917,0.00013948002,0.0011617984,0.00015753378,0.016640645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928385,0.00015601364,0.00004860084,0.00016007342,0.00026447026,0.00008697539],"domain_scores_gemma":[0.99927384,0.000273295,0.000042276777,0.00013279876,0.00025096186,0.000026787624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011584609,0.00069211615,0.0014168439,0.00084568246,0.0005123375,0.0013607176,0.0010292351,0.0010319897,0.0067245117],"category_scores_gemma":[0.002037919,0.00035823832,0.0006941563,0.0012182832,0.00043033162,0.001419059,0.0012151449,0.0009930979,0.0023253572],"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.00054667366,0.00012294781,0.0004981424,0.00011419335,0.00014392861,0.00008810858,0.00004107371,0.07052143,0.018795056,0.024009103,0.008207981,0.8769114],"study_design_scores_gemma":[0.000022421453,0.00014094537,0.000795558,0.000023087077,0.00007651317,0.00015524394,0.000018702729,0.9409838,0.019889908,0.031731173,0.006126281,0.000036334655],"about_ca_topic_score_codex":0.0008514747,"about_ca_topic_score_gemma":0.0011655015,"teacher_disagreement_score":0.0067245117,"about_ca_system_score_codex":0.00046101332,"about_ca_system_score_gemma":0.00044378478,"threshold_uncertainty_score":0.022495687},"labels":[],"label_agreement":null},{"id":"W1411846290","doi":"10.1007/978-3-319-23528-8_19","title":"Generalization in Unsupervised Learning","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Alberta","funders":"","keywords":"Generalization; Unsupervised learning; Cluster analysis; Computer science; Artificial intelligence; Set (abstract data type); Extension (predicate logic); Dimensionality reduction; Reduction (mathematics); Generalization error; Supervised learning; Machine learning; Curse of dimensionality; Task (project management); Algorithm; Mathematics; Artificial neural network","score_opus":0.030384918548997504,"score_gpt":0.2566342340745744,"score_spread":0.22624931552557692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1411846290","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.0076575666,0.0031951305,0.9758186,0.0008967898,0.00016181404,0.000029586741,0.00017110603,0.00048393523,0.011585385],"genre_scores_gemma":[0.48141813,0.007532257,0.44248828,0.0010992243,0.0017284577,0.0004370565,0.0019071284,0.001152836,0.062236633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990011,0.0003858125,0.00006313793,0.00029415239,0.00020716942,0.000048603815],"domain_scores_gemma":[0.996183,0.0024730694,0.00016779744,0.0008142755,0.00028780018,0.000074070485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001926266,0.0006966315,0.0014727988,0.0008506946,0.0006432143,0.0011392528,0.0014789158,0.0011411422,0.004162155],"category_scores_gemma":[0.0064772256,0.00066883076,0.0013565083,0.0014328226,0.0023545776,0.0031245959,0.0024409392,0.0029178662,0.0011023349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045927478,0.000042904427,0.0009880515,0.00030953827,0.00017205247,0.0000780191,0.00021600847,0.15019429,0.0010963331,0.61381155,0.014938573,0.21810675],"study_design_scores_gemma":[0.0000053123786,0.00001468284,0.00037138656,0.000026596774,0.000017523238,0.000063633175,0.000017140344,0.28038213,0.0004586607,0.7130413,0.0055899867,0.000011614517],"about_ca_topic_score_codex":0.0025572001,"about_ca_topic_score_gemma":0.00235681,"teacher_disagreement_score":0.004162155,"about_ca_system_score_codex":0.0011706505,"about_ca_system_score_gemma":0.000570807,"threshold_uncertainty_score":0.013923824},"labels":[],"label_agreement":null},{"id":"W1412765289","doi":"10.1007/978-3-642-36089-3_16","title":"TouchRAM: A Multitouch-Enabled Tool for Aspect-Oriented Software Design","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Agile software development; Reuse; Weaving; Software engineering; Software; Software design pattern; Human–computer interaction; Software design; User interface; User story; Software development; Programming language","score_opus":0.038418397091817005,"score_gpt":0.2765153836879569,"score_spread":0.23809698659613993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1412765289","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.003613663,0.0004535476,0.95754564,0.000094026145,0.000091313006,0.00007931203,0.00018869282,0.030828873,0.0071049733],"genre_scores_gemma":[0.10117164,0.0017024151,0.8391361,0.00056087563,0.00010713221,0.00043597058,0.0019590997,0.025272055,0.029654665],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924743,0.00011636461,0.000061902465,0.00010272451,0.00040557026,0.0000659718],"domain_scores_gemma":[0.9991671,0.00047409668,0.000054165048,0.00017491079,0.00007417661,0.00005553389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082351954,0.0012060388,0.0006895909,0.0010366046,0.00039742637,0.0019614338,0.0016025108,0.001290056,0.014688905],"category_scores_gemma":[0.0023204584,0.0011211685,0.0013412557,0.00076772424,0.0005122142,0.0023996397,0.003088247,0.0020768326,0.0039227135],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039509314,0.00018963295,0.0011252082,0.0015231292,0.00015582917,0.00074781955,0.0013454374,0.009876826,0.09132729,0.050149355,0.048070848,0.79509354],"study_design_scores_gemma":[0.00042709784,0.00044300107,0.0023779932,0.0009723442,0.00034129008,0.003588128,0.0002870699,0.15559521,0.1026886,0.079126604,0.65390617,0.00024638532],"about_ca_topic_score_codex":0.00028824236,"about_ca_topic_score_gemma":0.0005880988,"teacher_disagreement_score":0.014688905,"about_ca_system_score_codex":0.00021760147,"about_ca_system_score_gemma":0.0004390489,"threshold_uncertainty_score":0.04913932},"labels":[],"label_agreement":null},{"id":"W1413060739","doi":"10.1007/978-3-642-53956-5_7","title":"Insulin Pump Software Certification","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","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":"McMaster University","funders":"","keywords":"Computer science; Certification; Software engineering; Software; Programming language; Management","score_opus":0.013016548629935478,"score_gpt":0.20254599469818976,"score_spread":0.18952944606825428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1413060739","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016777733,0.006932914,0.5660777,0.001946369,0.0021656072,0.0003007406,0.0004061143,0.014481653,0.39091116],"genre_scores_gemma":[0.32066977,0.008827959,0.16106346,0.0011325744,0.0006658239,0.00024810125,0.0024771092,0.002565689,0.50234956],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992131,0.00007976667,0.000026730417,0.00010136113,0.00052573055,0.000053298365],"domain_scores_gemma":[0.99920267,0.00020507113,0.000051013925,0.00016298541,0.00033978277,0.000038511374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063211913,0.0005517606,0.00027930198,0.00088583655,0.00031127245,0.0012260666,0.0007631207,0.0008383492,0.021077864],"category_scores_gemma":[0.001987954,0.00034771292,0.00034146835,0.0005474863,0.00043222937,0.0012564361,0.0010447243,0.0012100327,0.010597538],"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.00012767634,0.00010766878,0.0004557403,0.00028992718,0.000010846507,0.00019384356,0.00011392672,0.0037396103,0.01220338,0.05384531,0.052712295,0.8761998],"study_design_scores_gemma":[0.000060901995,0.00024791076,0.0017563058,0.00052420126,0.000038236765,0.0014677998,0.00009841516,0.048885524,0.06664977,0.031335864,0.84887105,0.00006397765],"about_ca_topic_score_codex":0.0006520806,"about_ca_topic_score_gemma":0.0006051303,"teacher_disagreement_score":0.021077864,"about_ca_system_score_codex":0.0004963893,"about_ca_system_score_gemma":0.0009439007,"threshold_uncertainty_score":0.07051253},"labels":[],"label_agreement":null},{"id":"W1416149289","doi":"10.1007/978-3-642-29860-8_16","title":"Efficient Techniques for Near-Optimal Instrumentation in Time-Triggered Runtime Verification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Overhead (engineering); Runtime verification; Instrumentation (computer programming); Set (abstract data type); Execution time; State (computer science); Completeness (order theory); Parallel computing; Real-time computing; Distributed computing; Formal verification; Algorithm; Programming language; Operating system","score_opus":0.016948309923076294,"score_gpt":0.26222442469566104,"score_spread":0.24527611477258474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1416149289","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.0030506053,0.00026352427,0.99311674,0.00007765115,0.000050415983,0.000039296858,0.000033607575,0.0019372785,0.0014309145],"genre_scores_gemma":[0.24182749,0.0005105751,0.7523214,0.00020046273,0.00010158502,0.00019111623,0.00025420947,0.0010385241,0.0035546294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952453,0.0011288003,0.00037948904,0.00071416545,0.0018897505,0.0006424174],"domain_scores_gemma":[0.99193734,0.004694059,0.00041112243,0.0022212418,0.0006029203,0.0001332269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020965522,0.0018895305,0.0017398926,0.0014348058,0.0010013536,0.0018089234,0.0031230873,0.0014119605,0.0068722996],"category_scores_gemma":[0.010214452,0.0015086052,0.0020419087,0.0016138193,0.002125389,0.0041832547,0.00419677,0.004123205,0.0021560376],"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.0011191854,0.00024643078,0.000839664,0.0008703299,0.00017307728,0.00032686742,0.00053566473,0.12457846,0.06970077,0.19851771,0.007423186,0.5956686],"study_design_scores_gemma":[0.00013916058,0.00020191804,0.0003983128,0.0001341375,0.00016844439,0.00038185698,0.00010950667,0.6464673,0.051429212,0.29101142,0.009476949,0.000081817656],"about_ca_topic_score_codex":0.0011506836,"about_ca_topic_score_gemma":0.0026389596,"teacher_disagreement_score":0.0068722996,"about_ca_system_score_codex":0.0012247214,"about_ca_system_score_gemma":0.0019103551,"threshold_uncertainty_score":0.022990108},"labels":[],"label_agreement":null},{"id":"W1416820025","doi":"10.1007/978-3-642-21314-4_1","title":"Investigations of Wilson’s and Traulsen’s Group Selection Models in Evolutionary Computation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Selection (genetic algorithm); Evolutionary computation; Group (periodic table); Computation; Group selection; Artificial intelligence; Theoretical computer science; Algorithm; Physics","score_opus":0.02935544756331838,"score_gpt":0.25970654169816393,"score_spread":0.23035109413484556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1416820025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2855714,0.008741417,0.41909987,0.0144486325,0.00051445124,0.00013494818,0.00015115092,0.00018332886,0.2711549],"genre_scores_gemma":[0.94697356,0.0018035648,0.033249017,0.00034963698,0.00020026178,0.00007397718,0.00003643485,0.00005387958,0.017259695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992348,0.00044824075,0.000019943223,0.00007062979,0.00015063063,0.00007582358],"domain_scores_gemma":[0.9952619,0.00360506,0.00020727156,0.0003723651,0.00033067647,0.00022266086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023707647,0.0005354801,0.0006890735,0.0011021243,0.0010183685,0.0021038624,0.00215312,0.0017489777,0.0048168357],"category_scores_gemma":[0.01467773,0.0004114143,0.0009328489,0.0016145156,0.0028515593,0.0044176066,0.0011563225,0.002072178,0.00035560215],"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.000009433195,0.000018125827,0.00022379175,0.000022715027,0.000011383816,0.000028605757,0.0002175235,0.010456205,0.0001175472,0.9837833,0.0008788057,0.0042325784],"study_design_scores_gemma":[0.000010887774,0.000015250666,0.00030039152,0.000017445234,0.000010949271,0.000047506794,0.00009212586,0.1019629,0.00010259384,0.8938365,0.0035899207,0.000013514306],"about_ca_topic_score_codex":0.0032217721,"about_ca_topic_score_gemma":0.0032622728,"teacher_disagreement_score":0.0048168357,"about_ca_system_score_codex":0.0018581685,"about_ca_system_score_gemma":0.0010131627,"threshold_uncertainty_score":0.016113877},"labels":[],"label_agreement":null},{"id":"W1417172323","doi":"10.1007/978-3-642-40672-0_11","title":"On the Formal Analysis of Geometrical Optics in HOL","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Photonic and Optical Devices","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":"Concordia University","funders":"","keywords":"HOL; Computer science; Programming language","score_opus":0.013094944772871831,"score_gpt":0.2190029400401938,"score_spread":0.20590799526732198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1417172323","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.032546032,0.014845046,0.6297566,0.008147565,0.0016273432,0.00008482175,0.00040614462,0.00048602704,0.31210038],"genre_scores_gemma":[0.7106298,0.013239848,0.18117087,0.0029933683,0.0033357516,0.00023260398,0.00063933013,0.0006960822,0.087062255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999286,0.0002655221,0.000046244964,0.0000778232,0.0002458462,0.00007863616],"domain_scores_gemma":[0.99904436,0.0005895007,0.000060164148,0.00013163887,0.0001263751,0.00004794856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014572588,0.0007709331,0.00073049817,0.0017018773,0.0012493518,0.0030442248,0.0011022425,0.0008717523,0.0063604596],"category_scores_gemma":[0.0022101009,0.00047034127,0.0011638054,0.0013902348,0.007159883,0.0061379783,0.0020598716,0.0034776821,0.0010567568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032640637,0.0000042077813,0.000019157458,0.00001994269,0.0000015916744,0.000011844456,0.000081293074,0.00033290513,0.00010808765,0.9961482,0.0007417895,0.0025277177],"study_design_scores_gemma":[0.000001754147,0.0000033558156,0.00003464334,0.000012165295,0.0000012128913,0.000016604914,0.000023417284,0.0008600975,0.000065101325,0.9942297,0.00474895,0.0000030872886],"about_ca_topic_score_codex":0.0013003103,"about_ca_topic_score_gemma":0.0014437533,"teacher_disagreement_score":0.0063604596,"about_ca_system_score_codex":0.0020959256,"about_ca_system_score_gemma":0.0006989177,"threshold_uncertainty_score":0.021277905},"labels":[],"label_agreement":null},{"id":"W141746439","doi":"10.1007/bfb0036484","title":"Coroutines and processes in block structured languages","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Acadia University","funders":"","keywords":"Computer science; Programming language; Simula; Block (permutation group theory); Semantics (computer science); Theoretical computer science; Mathematics","score_opus":0.01242670753423316,"score_gpt":0.23954877522911278,"score_spread":0.2271220676948796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141746439","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.013939566,0.0076458175,0.8699511,0.0019579208,0.00082059525,0.00017216556,0.00022799641,0.001524882,0.10375998],"genre_scores_gemma":[0.40896997,0.010364766,0.4409087,0.0011808816,0.0010804848,0.0008103153,0.0008890334,0.0015417765,0.1342542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877506,0.00046465176,0.00009710647,0.00019877334,0.00033200547,0.00013234836],"domain_scores_gemma":[0.9985049,0.0008529853,0.00010956059,0.00031049608,0.00014369529,0.000078533114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015453987,0.0011707648,0.00095958647,0.0010536585,0.001627804,0.004783594,0.0012030997,0.0019308461,0.010115714],"category_scores_gemma":[0.003704735,0.000986121,0.00082344335,0.002561235,0.0049535716,0.009620004,0.0022067511,0.0038519003,0.0021522513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009062733,0.000003393877,0.000017904707,0.000034312106,0.0000016146603,0.000021880933,0.00024456118,0.00047418033,0.00019603648,0.99238527,0.00096833997,0.0056434716],"study_design_scores_gemma":[0.000014443229,0.000012726416,0.00002272798,0.00004298624,0.000004788522,0.000062076644,0.00006952733,0.0027110656,0.00058355025,0.9550951,0.041373413,0.0000075590797],"about_ca_topic_score_codex":0.0018505562,"about_ca_topic_score_gemma":0.0017213442,"teacher_disagreement_score":0.010115714,"about_ca_system_score_codex":0.0015497834,"about_ca_system_score_gemma":0.0014092623,"threshold_uncertainty_score":0.033840418},"labels":[],"label_agreement":null},{"id":"W1417471449","doi":"10.1007/978-3-642-27576-0_14","title":"Optimal One Round Almost Perfectly Secure Message Transmission (Short Paper)","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Protocol (science); Transmission (telecommunications); Modular design; Modular construction; Computer science; Transmission rate; Discrete mathematics; Computer network; Mathematics; Combinatorics; Telecommunications; Operating system","score_opus":0.017114601076291848,"score_gpt":0.23978471017740682,"score_spread":0.22267010910111498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1417471449","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.055473495,0.0041303695,0.8361476,0.0039626863,0.0013552076,0.00019585901,0.0011600502,0.0015519138,0.09602282],"genre_scores_gemma":[0.7789514,0.0032590483,0.15287957,0.0009891711,0.0013287471,0.00022034353,0.00087181764,0.0005358166,0.060964078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776673,0.000489359,0.000102709826,0.0005368718,0.00068155193,0.00042268506],"domain_scores_gemma":[0.9973847,0.0014928614,0.00021141107,0.00060490187,0.00019294022,0.00011318372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012406152,0.0012647543,0.0015487286,0.0007111223,0.00091943535,0.0020385755,0.0013326958,0.001768504,0.014663187],"category_scores_gemma":[0.0040903087,0.00089544285,0.00085066253,0.0012261512,0.0017858137,0.0035050954,0.0030357721,0.0020978893,0.00351617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015943428,0.00026899567,0.0006260591,0.00087956985,0.0002282608,0.00027932393,0.00023088165,0.21023144,0.018048234,0.5254407,0.03729339,0.20487888],"study_design_scores_gemma":[0.000117800526,0.00022888118,0.0007564769,0.00016273007,0.00010859488,0.00041967456,0.00005208611,0.40296984,0.0140566435,0.5671111,0.013912688,0.00010352318],"about_ca_topic_score_codex":0.0006453995,"about_ca_topic_score_gemma":0.00081999105,"teacher_disagreement_score":0.014663187,"about_ca_system_score_codex":0.0018940585,"about_ca_system_score_gemma":0.0019526902,"threshold_uncertainty_score":0.04905325},"labels":[],"label_agreement":null},{"id":"W141947981","doi":"10.1007/978-3-642-04128-0_7","title":"Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics and Applications","field":"Mathematics","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":"Polyhedron; Dihedral angle; Regular polygon; Dihedral group; Cauchy distribution; Genus; Face (sociological concept); Mathematics; Computer science; Combinatorics; Geometry; Mathematical analysis; Group (periodic table); Physics","score_opus":0.03798553686979813,"score_gpt":0.30265300385391825,"score_spread":0.26466746698412014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141947981","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1218367,0.0052023367,0.30031046,0.0034787105,0.0022091276,0.00007959404,0.00032212137,0.0002503476,0.5663107],"genre_scores_gemma":[0.73640394,0.0069863517,0.09219025,0.0011388586,0.0023821844,0.00020721473,0.0006378209,0.0004529678,0.15960035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959344,0.000069927286,0.000020302758,0.0000805792,0.00018145976,0.000054282915],"domain_scores_gemma":[0.9993812,0.00027546808,0.00003353073,0.00006420704,0.00018205591,0.00006362808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065416243,0.0008457832,0.00074401795,0.002220614,0.0017343988,0.0018691052,0.00076053763,0.000945116,0.0055323807],"category_scores_gemma":[0.0026228426,0.00048448134,0.0009408246,0.0013409684,0.0033159745,0.0040338337,0.0022890293,0.0038398907,0.0008449511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011341004,0.000006170238,0.00005933071,0.000031741845,0.0000044316857,0.000029862105,0.00010142881,0.00037213095,0.00054809364,0.98697853,0.0018315599,0.010025335],"study_design_scores_gemma":[0.00000539064,0.000010812155,0.00018063928,0.00001549164,0.000004568921,0.00010602822,0.000038668335,0.0018542288,0.00044386476,0.98555297,0.0117788855,0.00000860348],"about_ca_topic_score_codex":0.0012177924,"about_ca_topic_score_gemma":0.00086802605,"teacher_disagreement_score":0.0055323807,"about_ca_system_score_codex":0.0011476234,"about_ca_system_score_gemma":0.0006604959,"threshold_uncertainty_score":0.01850766},"labels":[],"label_agreement":null},{"id":"W142022900","doi":"10.1007/978-3-319-07437-5_19","title":"Personalizing Interfaces Using an Inclusive Design Approach","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Human–computer interaction; Programming language; Software engineering; Theoretical computer science","score_opus":0.06743754461408208,"score_gpt":0.2877806497507996,"score_spread":0.2203431051367175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142022900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011884006,0.000456617,0.95447534,0.00032786987,0.00009670884,0.00021467746,0.000018400524,0.000939083,0.03158719],"genre_scores_gemma":[0.19073156,0.0007681522,0.76830804,0.00030354466,0.000075825395,0.00087377353,0.00010320675,0.00073852047,0.038097274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948324,0.0023727047,0.0003207287,0.00049663096,0.001767728,0.00020983852],"domain_scores_gemma":[0.99478865,0.0024388689,0.00014268506,0.0017913769,0.0006794321,0.00015909945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043678824,0.0012932325,0.00076954195,0.0015882386,0.0014309481,0.00653898,0.0019463263,0.002038039,0.0088250665],"category_scores_gemma":[0.010331028,0.0010188721,0.0010936882,0.001073678,0.0019722963,0.008069202,0.007129913,0.002574015,0.0017295823],"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.00011952088,0.0002722168,0.0012853439,0.0010767739,0.00011055108,0.00036881794,0.027920688,0.0036546455,0.02959453,0.26385596,0.007322261,0.6644187],"study_design_scores_gemma":[0.00011304871,0.00067451666,0.0027446328,0.0014841413,0.0005640196,0.0036719714,0.009943321,0.059282515,0.054416362,0.43254274,0.43436906,0.00019367624],"about_ca_topic_score_codex":0.00030783346,"about_ca_topic_score_gemma":0.00047428993,"teacher_disagreement_score":0.0088250665,"about_ca_system_score_codex":0.00056422653,"about_ca_system_score_gemma":0.00074863737,"threshold_uncertainty_score":0.029522777},"labels":[],"label_agreement":null},{"id":"W1421506500","doi":"10.1007/978-3-642-55224-3_14","title":"Numerical Treatment of a Cross-Diffusion Model of Biofilm Exposure to Antimicrobials","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Mathematical Modeling in Engineering","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 Guelph","funders":"","keywords":"Discretization; Nonlinear system; Diffusion; Computer science; Singularity; Applied mathematics; Finite volume method; Numerical analysis; Degeneracy (biology); Mathematics; Mechanics; Physics; Mathematical analysis; Bioinformatics; Thermodynamics","score_opus":0.024372973282567763,"score_gpt":0.2744465280972145,"score_spread":0.2500735548146467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1421506500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32052693,0.004179299,0.58297056,0.0036369918,0.0011798152,0.00025176312,0.0007798444,0.00055882894,0.085916035],"genre_scores_gemma":[0.92760384,0.0012333231,0.038049143,0.0004866288,0.00022104106,0.0002836727,0.000379575,0.00013667229,0.031606108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977046,0.00006691744,0.000017958087,0.00004156604,0.000062953055,0.000040131],"domain_scores_gemma":[0.99910897,0.00054942234,0.00008375849,0.000039314167,0.00015988843,0.000058765054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005908371,0.00078915496,0.0013238853,0.0006324538,0.0008381607,0.0014155061,0.0019302204,0.0042092535,0.004066983],"category_scores_gemma":[0.0019336296,0.0005920494,0.001456927,0.0006084693,0.0011426427,0.0007678725,0.0013091674,0.0014011227,0.00042486598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003235708,0.00004982156,0.0002955817,0.000048199912,0.00001976231,0.00011035995,0.000036545076,0.98438174,0.0024235274,0.010011553,0.00040755942,0.0021830765],"study_design_scores_gemma":[0.000004974897,0.000008734739,0.00005152393,0.0000027994126,0.000002900443,0.00000942898,0.0000057800094,0.998911,0.00014636957,0.0006997254,0.00015292599,0.0000037359991],"about_ca_topic_score_codex":0.020906664,"about_ca_topic_score_gemma":0.0071937195,"teacher_disagreement_score":0.020906664,"about_ca_system_score_codex":0.0012654383,"about_ca_system_score_gemma":0.0013965061,"threshold_uncertainty_score":0.04156995},"labels":[],"label_agreement":null},{"id":"W142225618","doi":"10.1007/978-3-642-23447-7_7","title":"Furthering the Growth of Cloud Computing by Providing Privacy as a Service","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Western University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Service (business); Distributed computing; Operating system","score_opus":0.02830263576323075,"score_gpt":0.24959770873264386,"score_spread":0.22129507296941311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142225618","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.013148668,0.083820134,0.49927405,0.11326083,0.007252045,0.00030619797,0.0005489461,0.00170994,0.28067917],"genre_scores_gemma":[0.3489451,0.17321564,0.3376476,0.019189555,0.011315836,0.00023341471,0.0008395833,0.0013475617,0.10726561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974813,0.0004579486,0.0000971638,0.00020995729,0.0013055574,0.00044812504],"domain_scores_gemma":[0.99576133,0.0018501481,0.00018451331,0.0010305665,0.00071199785,0.0004614998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003413624,0.0008904282,0.00082432467,0.0011301279,0.0016549998,0.007712919,0.0021256125,0.0032357464,0.009340797],"category_scores_gemma":[0.0063809487,0.00047906954,0.0012861534,0.0037741582,0.0034633924,0.02374922,0.0054845703,0.00999737,0.0044751284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043276985,0.0000529901,0.00020203985,0.0003246675,0.000015438009,0.0001046445,0.00023347621,0.0021837323,0.0017417831,0.8345376,0.03243988,0.1281204],"study_design_scores_gemma":[0.000017399638,0.000044527234,0.00026424305,0.00036452207,0.000025602218,0.0005102361,0.00024291541,0.016814662,0.003356201,0.46944705,0.5088814,0.000031263393],"about_ca_topic_score_codex":0.0025448943,"about_ca_topic_score_gemma":0.001757116,"teacher_disagreement_score":0.009340797,"about_ca_system_score_codex":0.0022404704,"about_ca_system_score_gemma":0.0047546765,"threshold_uncertainty_score":0.031248093},"labels":[],"label_agreement":null},{"id":"W1422654747","doi":"10.1007/978-3-642-54943-4_12","title":"Measuring Conceptual Entanglement in Collections of Documents","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Quantum entanglement; Computer science; Context (archaeology); Phenomenon; Conceptual model; Natural language; Natural language processing; Artificial intelligence; Quantum; Quantum mechanics; Physics","score_opus":0.03580766092353518,"score_gpt":0.24960816396945096,"score_spread":0.21380050304591577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1422654747","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.585288,0.0061100665,0.39098454,0.0006493583,0.00014089876,0.00022113277,0.0025295967,0.0013011874,0.012775183],"genre_scores_gemma":[0.9185558,0.0017064679,0.07219745,0.00008629599,0.0001544434,0.00021422986,0.004167764,0.00032635545,0.0025912707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994179,0.0019815373,0.00045367138,0.0011226017,0.0018249032,0.00043824958],"domain_scores_gemma":[0.974678,0.017204037,0.0021490366,0.0031993585,0.0017002411,0.0010693619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004064492,0.00074508437,0.0013966085,0.00761355,0.0021876092,0.006738798,0.0015236521,0.0014428048,0.0037138718],"category_scores_gemma":[0.035442885,0.0010274603,0.0011660035,0.011154229,0.0023742397,0.012864668,0.006656917,0.0022367046,0.0008573021],"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.002871947,0.0010686418,0.10557759,0.0022861676,0.0015673212,0.00079577824,0.01069716,0.052704524,0.049526274,0.2753447,0.011380022,0.4861799],"study_design_scores_gemma":[0.000097852724,0.00044441962,0.059027355,0.00033843823,0.0007242249,0.0010501414,0.0057979696,0.29701802,0.02705778,0.588873,0.019293927,0.00027685714],"about_ca_topic_score_codex":0.0019758022,"about_ca_topic_score_gemma":0.0021128312,"teacher_disagreement_score":0.00761355,"about_ca_system_score_codex":0.0016227391,"about_ca_system_score_gemma":0.0009785817,"threshold_uncertainty_score":0.021495283},"labels":[],"label_agreement":null},{"id":"W142369216","doi":"10.1007/978-3-642-31770-5_15","title":"Algorithms for Forest Local Similarity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Similarity (geometry); Tree (set theory); Computer science; Order (exchange); Combinatorics; Structural similarity; Tree structure; Mathematics; Algorithm; Artificial intelligence; Binary tree; Image (mathematics)","score_opus":0.021072894801163634,"score_gpt":0.25647337587959346,"score_spread":0.2354004810784298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142369216","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.018342122,0.0011017882,0.97238004,0.0002753097,0.00015963834,0.00020806215,0.0004933737,0.0035369673,0.0035026816],"genre_scores_gemma":[0.1555053,0.000404024,0.8329672,0.0002463266,0.00023503465,0.0004207105,0.002757064,0.00089025643,0.0065739816],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974572,0.0005006356,0.0001724477,0.00094466517,0.0006872366,0.00023786597],"domain_scores_gemma":[0.9952744,0.0021653944,0.0002573848,0.001345012,0.00073406415,0.00022373348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547616,0.0014551939,0.0036249962,0.0054066693,0.0020001726,0.002695566,0.00575744,0.0033824665,0.014023986],"category_scores_gemma":[0.010468177,0.0011624581,0.0024693378,0.0064153937,0.001867566,0.0063440413,0.004577222,0.0030481045,0.004384565],"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.00047741435,0.00032737022,0.0013161257,0.00027212474,0.00018862638,0.00006583867,0.00014726006,0.16533537,0.0033486905,0.053179257,0.021556633,0.7537854],"study_design_scores_gemma":[0.00007934564,0.000070545975,0.00024756257,0.000024067545,0.00004160054,0.000107741325,0.00004632536,0.8824079,0.0016965196,0.1120307,0.0032274825,0.00002020251],"about_ca_topic_score_codex":0.004101327,"about_ca_topic_score_gemma":0.0058015864,"teacher_disagreement_score":0.014023986,"about_ca_system_score_codex":0.0017681202,"about_ca_system_score_gemma":0.0013657673,"threshold_uncertainty_score":0.046914935},"labels":[],"label_agreement":null},{"id":"W1423731970","doi":"10.1007/978-3-642-31951-8_5","title":"Learning Compact Markov Logic Networks with Decision Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Markov chain; Graphical model; Bayesian network; Inference; Artificial intelligence; Theoretical computer science; Bayes' theorem; Set (abstract data type); Component (thermodynamics); Class (philosophy); Decision tree; Machine learning; Algorithm; Bayesian probability; Programming language","score_opus":0.02168774370246067,"score_gpt":0.25074394782031023,"score_spread":0.22905620411784955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1423731970","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.010618629,0.0006711922,0.9859761,0.00032809775,0.000025795813,0.000023618328,0.00018492992,0.00032537253,0.0018463202],"genre_scores_gemma":[0.52875847,0.0018277096,0.45955983,0.00039165476,0.00024608843,0.0002816466,0.0017002642,0.00020154708,0.0070327627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987313,0.0005748183,0.000075449745,0.0002996092,0.0002443905,0.00007435626],"domain_scores_gemma":[0.9885556,0.010110863,0.0004770739,0.00047194317,0.00024673512,0.00013784127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021001287,0.0008224538,0.0012694128,0.0009620526,0.00043301127,0.0017759028,0.0015936657,0.0013231277,0.0049034413],"category_scores_gemma":[0.013000945,0.0010162465,0.000989272,0.0011957564,0.0012272537,0.0059694266,0.0021219612,0.0025321757,0.0008065423],"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.0002428221,0.0001252626,0.0009302714,0.00028007806,0.000106220104,0.00014234766,0.00019089559,0.5427859,0.0010721638,0.2710513,0.003710752,0.17936201],"study_design_scores_gemma":[0.000013394509,0.000018021788,0.00006488484,0.000019342875,0.000009189272,0.000019508288,0.000009028463,0.7300337,0.00019333405,0.26897883,0.0006337626,0.000006913384],"about_ca_topic_score_codex":0.0017602963,"about_ca_topic_score_gemma":0.0031245558,"teacher_disagreement_score":0.0049034413,"about_ca_system_score_codex":0.0012820337,"about_ca_system_score_gemma":0.00070602464,"threshold_uncertainty_score":0.016403615},"labels":[],"label_agreement":null},{"id":"W1424990225","doi":"10.1007/3-540-36552-4_12","title":"Hardware Design and Analysis of Block Cipher Components","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Parameterized complexity; Block cipher; Advanced Encryption Standard; Block (permutation group theory); Encryption; Permutation (music); S-box; Arithmetic; Theoretical computer science; Cryptography; Parallel computing; Algorithm; Mathematics; Computer network","score_opus":0.031141528668451362,"score_gpt":0.2683331192917851,"score_spread":0.23719159062333375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1424990225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037037507,0.002093259,0.9477697,0.00016726182,0.00008598413,0.00013638122,0.00014655199,0.0011807383,0.01138267],"genre_scores_gemma":[0.66693777,0.002590914,0.31167468,0.00009477559,0.00007433645,0.0001944231,0.00038817077,0.00034543758,0.017699497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997031,0.00005166368,0.000017769724,0.000034615623,0.00015677621,0.00003595963],"domain_scores_gemma":[0.99956137,0.00018550295,0.000043795713,0.00008841916,0.00011241884,0.000008469548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029887285,0.0008008929,0.0004252525,0.000687457,0.0002615978,0.0008895044,0.00085675984,0.00045789583,0.0052799215],"category_scores_gemma":[0.0011569478,0.00048924884,0.0004591969,0.00044219953,0.00036887123,0.0010549538,0.00031060222,0.00067936006,0.0013408726],"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.00043085532,0.00011060974,0.0015009078,0.00082863105,0.000116894764,0.00025020688,0.00020264272,0.25022313,0.16933519,0.2503827,0.0053166933,0.3213016],"study_design_scores_gemma":[0.000043304382,0.00025001887,0.0011151893,0.00010124766,0.00007339473,0.00034878362,0.00003333976,0.80288666,0.1170583,0.06034947,0.017707678,0.000032643035],"about_ca_topic_score_codex":0.0007750135,"about_ca_topic_score_gemma":0.000966305,"teacher_disagreement_score":0.0052799215,"about_ca_system_score_codex":0.00077152153,"about_ca_system_score_gemma":0.0007208102,"threshold_uncertainty_score":0.017663121},"labels":[],"label_agreement":null},{"id":"W142552274","doi":"10.1007/978-3-642-41062-8_19","title":"Text Categorization via Similarity Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Similarity (geometry); Cluster analysis; Categorization; Centroid; Outlier; Preprocessor; Metric (unit); Similarity measure; Point (geometry); Text categorization; Class (philosophy); Pattern recognition (psychology); Mathematics","score_opus":0.024038456127953765,"score_gpt":0.25591752152998387,"score_spread":0.2318790654020301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142552274","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.02117245,0.0028442205,0.95520616,0.000437694,0.00034544282,0.0006317257,0.001244916,0.0076185153,0.010498837],"genre_scores_gemma":[0.14671099,0.0014047495,0.8161401,0.0002923211,0.0003192058,0.0004672147,0.0067758374,0.00045028076,0.02743921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982926,0.00026068217,0.00017379457,0.00049710734,0.00066731515,0.000108548964],"domain_scores_gemma":[0.99880266,0.0003624507,0.00008769726,0.00030843043,0.00038139286,0.000057355577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009776372,0.00088938186,0.0019861108,0.0071495385,0.0011950089,0.0023018594,0.0017839455,0.001275834,0.011891456],"category_scores_gemma":[0.0029605872,0.00038755668,0.0016764267,0.0074633127,0.00053343474,0.0033415346,0.0022738965,0.00092076795,0.011045397],"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.00014847859,0.00021633154,0.00045201823,0.00024035566,0.000088755536,0.00005823773,0.00006922018,0.0022393144,0.016050758,0.007908832,0.017310899,0.9552168],"study_design_scores_gemma":[0.00017487546,0.000813357,0.0049007637,0.00017574418,0.0004031308,0.0024180629,0.0006336159,0.67306995,0.07635,0.1510828,0.08982685,0.00015079563],"about_ca_topic_score_codex":0.0017398486,"about_ca_topic_score_gemma":0.0026348336,"teacher_disagreement_score":0.011891456,"about_ca_system_score_codex":0.0006385113,"about_ca_system_score_gemma":0.0011737999,"threshold_uncertainty_score":0.039780855},"labels":[],"label_agreement":null},{"id":"W142773386","doi":"10.1007/978-3-642-13059-5_56","title":"Predicting Optimal Constraint Satisfaction Methods","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Saskatchewan","funders":"","keywords":"Constraint satisfaction problem; Computer science; Constraint satisfaction dual problem; Constraint satisfaction; A priori and a posteriori; Variety (cybernetics); Constraint (computer-aided design); Constraint learning; Local consistency; Mathematical optimization; Backtracking; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.01719898647720418,"score_gpt":0.2846491178294287,"score_spread":0.2674501313522245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142773386","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.04930802,0.003401232,0.9308017,0.0010544623,0.00026116826,0.00025085258,0.0020356989,0.0018953044,0.010991664],"genre_scores_gemma":[0.35153258,0.0017953571,0.630353,0.00032310066,0.00031042594,0.00041393636,0.0064179525,0.0005474222,0.008306237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780387,0.0006983139,0.00009722293,0.0005383525,0.000696297,0.00016601624],"domain_scores_gemma":[0.99117106,0.0066700364,0.00032974183,0.00066714484,0.000952238,0.00020976603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021710817,0.0011670013,0.0013204563,0.0025012325,0.0005609775,0.0015798287,0.0020278476,0.0015708451,0.009154524],"category_scores_gemma":[0.016929684,0.0008698442,0.0011777041,0.002991799,0.000773696,0.0021213708,0.0009966756,0.002188362,0.0018095124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018646113,0.0002516677,0.0049167755,0.00027597303,0.00010241176,0.00007395404,0.00004868919,0.6003112,0.0016799532,0.020955944,0.026784364,0.3444125],"study_design_scores_gemma":[0.00000671112,0.000016191092,0.00031637846,0.000015218509,0.000005637581,0.000012767268,0.000009314092,0.98848397,0.00047910007,0.009825926,0.0008236073,0.0000051557126],"about_ca_topic_score_codex":0.0069870353,"about_ca_topic_score_gemma":0.011410155,"teacher_disagreement_score":0.009154524,"about_ca_system_score_codex":0.0011725299,"about_ca_system_score_gemma":0.0015576138,"threshold_uncertainty_score":0.030624926},"labels":[],"label_agreement":null},{"id":"W143017274","doi":"10.1007/978-3-540-89550-3_11","title":"Fast Skew Partition Recognition","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"McGill University","funders":"","keywords":"Skew; Partition (number theory); Combinatorics; Graph partition; Vertex (graph theory); Graph; Time complexity; Induced subgraph; Computer science; Mathematics; Discrete mathematics","score_opus":0.02626673958242408,"score_gpt":0.2395240015017815,"score_spread":0.2132572619193574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143017274","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.02842337,0.001124995,0.93152976,0.00016923346,0.00045777738,0.00016908537,0.0010378519,0.016298905,0.020789092],"genre_scores_gemma":[0.1946738,0.0007754772,0.760127,0.00021933625,0.00014243301,0.00017140638,0.005081988,0.0016497768,0.03715875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956983,0.000034876946,0.000024018582,0.00011622722,0.00018313363,0.00007184204],"domain_scores_gemma":[0.99954385,0.000068137924,0.000025767014,0.00019693945,0.00013364368,0.000031645766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025188565,0.0010734724,0.00096380303,0.0013350436,0.00069153094,0.0014656787,0.0011273115,0.000639079,0.029124089],"category_scores_gemma":[0.0008593697,0.00052384136,0.0006402456,0.0016277746,0.00037556014,0.0016030113,0.0018245468,0.0008205124,0.013368418],"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.00021697918,0.000042837484,0.0003727915,0.00009508218,0.000018225386,0.00008214094,0.000038215952,0.004399722,0.03814137,0.006264434,0.019357616,0.93097067],"study_design_scores_gemma":[0.00009057268,0.00039443417,0.00418405,0.00010964355,0.000092360206,0.0022234942,0.00033588923,0.51708055,0.2786097,0.057036325,0.13973364,0.000109413326],"about_ca_topic_score_codex":0.0010718226,"about_ca_topic_score_gemma":0.0026977872,"teacher_disagreement_score":0.029124089,"about_ca_system_score_codex":0.00037190944,"about_ca_system_score_gemma":0.0006771313,"threshold_uncertainty_score":0.09742975},"labels":[],"label_agreement":null},{"id":"W14303514","doi":"10.1007/978-3-642-33185-5_9","title":"Ensuring Relevant and Serendipitous Information Flow in Decentralized Online Social Network","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Serendipity; Social network (sociolinguistics); Peer-to-peer; Distributed computing; Filter (signal processing); Node (physics); Context (archaeology); Architecture; World Wide Web; Computer network; Social media","score_opus":0.014410095017042174,"score_gpt":0.22192341889287845,"score_spread":0.20751332387583626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14303514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11716504,0.00044011913,0.87277055,0.0022282975,0.00009872642,0.00026797445,0.00026184047,0.00094184483,0.0058255373],"genre_scores_gemma":[0.9412056,0.0002908169,0.05491341,0.00021536704,0.0001424899,0.00016682557,0.00015778362,0.00015873127,0.002748855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919367,0.0037442145,0.00043358532,0.0012770346,0.0016992495,0.00090923137],"domain_scores_gemma":[0.8170493,0.15218978,0.0057041673,0.014764954,0.006810503,0.0034813385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013529609,0.0011504628,0.002980071,0.0017872151,0.003089423,0.00463917,0.0042237444,0.0041607893,0.0026445503],"category_scores_gemma":[0.10176796,0.0017019883,0.0008591294,0.0022541743,0.0034083512,0.00886021,0.0061610974,0.0033109873,0.00059140084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018147342,0.0005417317,0.0055993698,0.0006508156,0.00020429041,0.0005119547,0.0018311593,0.5066439,0.010760224,0.36114573,0.011090492,0.09920554],"study_design_scores_gemma":[0.000067289926,0.00007959001,0.0003950423,0.000026972257,0.000041789233,0.00010401751,0.00014161943,0.8223342,0.0025722557,0.17325899,0.0009552628,0.00002300354],"about_ca_topic_score_codex":0.0031706865,"about_ca_topic_score_gemma":0.0028508597,"teacher_disagreement_score":0.013529609,"about_ca_system_score_codex":0.0028973403,"about_ca_system_score_gemma":0.005187107,"threshold_uncertainty_score":0.07155228},"labels":[],"label_agreement":null},{"id":"W143274136","doi":"10.1007/978-3-642-36362-7_28","title":"Rate-Limited Secure Function Evaluation: Definitions and Constructions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Protocol (science); Random oracle; Mathematical proof; Compiler; Stateless protocol; Overhead (engineering); Correctness; Theoretical computer science; State (computer science); Programming language; Computer network; Mathematics; Public-key cryptography","score_opus":0.03294323945451356,"score_gpt":0.241773257592287,"score_spread":0.20883001813777344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143274136","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.012676244,0.0050658523,0.91258436,0.0016074346,0.00035895852,0.00018273167,0.00030812822,0.0005919498,0.06662431],"genre_scores_gemma":[0.57014465,0.0127815865,0.35151163,0.0013509898,0.0017309003,0.0010850147,0.0007191514,0.0009520328,0.059723936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941613,0.0017015052,0.0004744049,0.00080545753,0.0023180712,0.0005391345],"domain_scores_gemma":[0.99415416,0.0031954516,0.00032488647,0.0015392862,0.00058331015,0.00020291998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057328963,0.0018574825,0.0019524011,0.0028219807,0.0018423935,0.006733164,0.00293203,0.002428843,0.0055443486],"category_scores_gemma":[0.0109893475,0.0011780267,0.00195209,0.0044179335,0.007530341,0.013220757,0.006091667,0.0073476974,0.0028958707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025419158,0.000011907758,0.00003826111,0.00005921912,0.0000057953243,0.000025182913,0.00007766788,0.0009968646,0.00048760057,0.9872449,0.0010039518,0.010023212],"study_design_scores_gemma":[0.000013300152,0.00004323657,0.000049353705,0.00007899172,0.000022642085,0.00027044487,0.000027152058,0.008687036,0.0029179468,0.97639126,0.011466969,0.000031656662],"about_ca_topic_score_codex":0.00033025976,"about_ca_topic_score_gemma":0.00019732043,"teacher_disagreement_score":0.006733164,"about_ca_system_score_codex":0.0033601313,"about_ca_system_score_gemma":0.0014115262,"threshold_uncertainty_score":0.030318797},"labels":[],"label_agreement":null},{"id":"W1433129784","doi":"10.1007/978-3-642-29946-9_16","title":"Automatic Construction of Temporally Extended Actions for MDPs Using Bisimulation Metrics","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Markov decision process; Reinforcement learning; Computer science; Bisimulation; Metric (unit); Set (abstract data type); Markov process; Process (computing); Q-learning; Performance metric; Artificial intelligence; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.056064834870291215,"score_gpt":0.3043537203516835,"score_spread":0.2482888854813923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1433129784","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.010048212,0.000070582355,0.98787737,0.000047494428,0.000023743285,0.00008316277,0.000078078156,0.0007393487,0.0010319728],"genre_scores_gemma":[0.17039445,0.00015493133,0.8264566,0.000050152554,0.000022262195,0.0004828405,0.000495542,0.00054013106,0.001403096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.0004201998,0.00015018765,0.0003252842,0.0005383584,0.00013436849],"domain_scores_gemma":[0.9955051,0.0028551344,0.00029432357,0.0005073367,0.00060211285,0.00023599909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020003545,0.0016755785,0.0018623229,0.0016474553,0.00087604555,0.0013292846,0.0019148672,0.0015113263,0.0054206513],"category_scores_gemma":[0.009132884,0.0014916827,0.0022563438,0.0010074525,0.0016423583,0.00275642,0.005075929,0.0030222766,0.00095721363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023675774,0.00014208912,0.00067588117,0.0004970961,0.00008049885,0.00021956609,0.0003024094,0.6377551,0.014907143,0.14948012,0.0020262795,0.19367704],"study_design_scores_gemma":[0.000018611177,0.00005250212,0.00006720537,0.000034762597,0.000011871484,0.000027725946,0.000025348016,0.9311885,0.0031924727,0.06412603,0.001243031,0.000011892561],"about_ca_topic_score_codex":0.0018355646,"about_ca_topic_score_gemma":0.0033356498,"teacher_disagreement_score":0.0054206513,"about_ca_system_score_codex":0.001691978,"about_ca_system_score_gemma":0.0022009108,"threshold_uncertainty_score":0.018133879},"labels":[],"label_agreement":null},{"id":"W1433257690","doi":"10.1007/978-3-642-41578-4_1","title":"The Role of Universal Constraints in Language Acquisition","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Parsing; Rule-based machine translation; Grammar; Constraint (computer-aided design); Artificial intelligence; Natural language processing; Language acquisition; Second-language acquisition; Programming language; Linguistics","score_opus":0.005341153284112133,"score_gpt":0.22875116573588175,"score_spread":0.2234100124517696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1433257690","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.0949522,0.016110519,0.33994317,0.00576183,0.0003158987,0.000099624056,0.0004289097,0.0008330696,0.5415548],"genre_scores_gemma":[0.9002856,0.0068373745,0.06861292,0.0005320975,0.00028128625,0.00013730332,0.00045924337,0.00061416003,0.022240037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985989,0.0005087295,0.0000929729,0.00032035774,0.00031419442,0.00016488622],"domain_scores_gemma":[0.9940275,0.0046092235,0.00019579317,0.00063997123,0.00039950147,0.00012814227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018385856,0.0005145062,0.00067201874,0.0009568987,0.0012158933,0.003619229,0.0017216728,0.001060061,0.011661433],"category_scores_gemma":[0.008762084,0.0013729354,0.0005573898,0.0011898391,0.0069953045,0.014174185,0.0027308292,0.0038293079,0.0015044586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003226185,0.000016837674,0.0005836084,0.00018985588,0.000015367954,0.00017386487,0.0015117647,0.0008140618,0.0016374962,0.90537673,0.0020688623,0.08757928],"study_design_scores_gemma":[0.000008253095,0.000016885839,0.0010358307,0.00009358928,0.000011918348,0.00023790842,0.00032514197,0.0023654536,0.001869864,0.975654,0.018358288,0.0000228768],"about_ca_topic_score_codex":0.0032148764,"about_ca_topic_score_gemma":0.00371284,"teacher_disagreement_score":0.011661433,"about_ca_system_score_codex":0.0016181113,"about_ca_system_score_gemma":0.0015677357,"threshold_uncertainty_score":0.03901142},"labels":[],"label_agreement":null},{"id":"W1433356898","doi":"10.1007/978-3-319-21151-0_8","title":"Reusable Model Interfaces with Instantiation Cardinalities","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"McGill University","funders":"","keywords":"Computer science; Theoretical computer science; Programming language","score_opus":0.06434536249418821,"score_gpt":0.28699983627882825,"score_spread":0.22265447378464004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1433356898","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.0035489905,0.00026522143,0.9739206,0.00029249268,0.00011182005,0.00008322156,0.00010418173,0.0038109515,0.017862609],"genre_scores_gemma":[0.119905636,0.001024341,0.83132625,0.0004245403,0.00018333364,0.0005165445,0.00095293735,0.004533064,0.041133314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947088,0.0012258507,0.00078278105,0.0007667107,0.0021596875,0.00035627914],"domain_scores_gemma":[0.99308527,0.0023901302,0.00036073837,0.0034692602,0.0005274056,0.00016727854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005278704,0.0018356888,0.0010500462,0.0021225016,0.0010429969,0.0077033234,0.0028148727,0.002493373,0.016873114],"category_scores_gemma":[0.018021433,0.002153911,0.0023387335,0.0026748308,0.0025055646,0.01745851,0.008104924,0.006062364,0.0051223948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004244136,0.00004232382,0.00024683867,0.00015471375,0.000018073686,0.00013246827,0.0005662875,0.0015472592,0.0022640477,0.900091,0.004316993,0.090577476],"study_design_scores_gemma":[0.000038362006,0.000041096766,0.00015656302,0.00036156623,0.00009682692,0.00057942775,0.00015538449,0.031553265,0.0077100773,0.8492588,0.11000222,0.000046533045],"about_ca_topic_score_codex":0.0005617014,"about_ca_topic_score_gemma":0.0008713673,"teacher_disagreement_score":0.016873114,"about_ca_system_score_codex":0.0011688025,"about_ca_system_score_gemma":0.0011275504,"threshold_uncertainty_score":0.056446195},"labels":[],"label_agreement":null},{"id":"W1433844459","doi":"10.1007/978-3-319-21401-6_18","title":"Inductive Beluga: Programming Proofs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; Computer science; Programming language; Theoretical computer science; Mathematics","score_opus":0.039888268537126126,"score_gpt":0.2680270909619125,"score_spread":0.2281388224247864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1433844459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035999317,0.022748971,0.63140905,0.0050251647,0.001937415,0.00008210892,0.00047321813,0.002792344,0.33193177],"genre_scores_gemma":[0.3715955,0.032462437,0.31837517,0.0041812584,0.004136551,0.0003984552,0.002261226,0.0029093563,0.2636801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905366,0.00031764907,0.000040440078,0.0001300253,0.00038541504,0.00007277791],"domain_scores_gemma":[0.99880683,0.00071601436,0.00004465321,0.00016550384,0.00019904868,0.00006789802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014151138,0.0009810264,0.000687379,0.0016317446,0.0014479933,0.0043179095,0.0024036316,0.0007783778,0.021203171],"category_scores_gemma":[0.004532961,0.00095036544,0.00085152464,0.0018639314,0.0038897346,0.007580763,0.0026192116,0.00462744,0.0076687085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017466715,0.000015696352,0.000057482037,0.00021340209,0.0000084780995,0.00002620702,0.0003320086,0.00044926052,0.00031015344,0.91954225,0.023856932,0.055170674],"study_design_scores_gemma":[0.000010473602,0.000009080802,0.00007077821,0.00013631138,0.000009984844,0.00009047889,0.00006120841,0.0012530169,0.0007083321,0.8075953,0.19004108,0.000013900405],"about_ca_topic_score_codex":0.0013938295,"about_ca_topic_score_gemma":0.0020587142,"teacher_disagreement_score":0.021203171,"about_ca_system_score_codex":0.001643702,"about_ca_system_score_gemma":0.0012324484,"threshold_uncertainty_score":0.07093161},"labels":[],"label_agreement":null},{"id":"W143402542","doi":"10.1007/978-3-642-40104-6_44","title":"Parameterized Enumeration of (Locally-) Optimal Aggregations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Waterloo","funders":"","keywords":"Parameterized complexity; Enumeration; Combinatorics; Upper and lower bounds; Swap (finance); Set (abstract data type); Mathematics; Discrete mathematics; Rank (graph theory); Computer science","score_opus":0.02725714467181971,"score_gpt":0.22007242875851382,"score_spread":0.1928152840866941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143402542","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.12918685,0.00038001238,0.845696,0.0008815273,0.000053487427,0.00010460163,0.0013700221,0.0010704752,0.021257147],"genre_scores_gemma":[0.5888539,0.0004929829,0.385955,0.0002392528,0.00010908298,0.00054498,0.004202415,0.0008866587,0.01871576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976042,0.0009977567,0.00018124118,0.0004447065,0.0004495055,0.00032264224],"domain_scores_gemma":[0.99066895,0.0060886336,0.0006092339,0.0016653218,0.00052552915,0.00044234202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016292724,0.0010477399,0.0018723345,0.0014631636,0.0012523666,0.0042239595,0.0028679399,0.002250802,0.017217312],"category_scores_gemma":[0.0145246135,0.0011417158,0.0014342094,0.0033621055,0.0014358056,0.0051103584,0.004170096,0.0029782194,0.0020828717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026441607,0.00018563075,0.0020352309,0.00032053582,0.00008838782,0.00015718049,0.00042133217,0.20240757,0.003382485,0.6976267,0.012311182,0.0807994],"study_design_scores_gemma":[0.00003622389,0.000019266878,0.00018202455,0.00002832677,0.000017894594,0.00005263744,0.00006474386,0.3405798,0.0006017011,0.6567682,0.0016351314,0.000014013062],"about_ca_topic_score_codex":0.000909289,"about_ca_topic_score_gemma":0.0024609833,"teacher_disagreement_score":0.017217312,"about_ca_system_score_codex":0.00173158,"about_ca_system_score_gemma":0.0013006069,"threshold_uncertainty_score":0.057597637},"labels":[],"label_agreement":null},{"id":"W1434226134","doi":"10.1007/978-3-642-38085-3_13","title":"Generation of Synthetic 4D Cardiac CT Images by Deformation from Cardiac Ultrasound","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Western University","funders":"","keywords":"Computer science; Deformation (meteorology); Cardiac Ultrasound; Computer vision; Artificial intelligence; Ultrasound; Synthetic data; Cardiac imaging; Radiology; Medicine; Geology","score_opus":0.015456944228606813,"score_gpt":0.24726208220634832,"score_spread":0.23180513797774152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1434226134","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.06568008,0.00023466951,0.9223799,0.00026395204,0.00028655984,0.0003536352,0.0009252748,0.0044825585,0.0053933063],"genre_scores_gemma":[0.44308218,0.00040942838,0.5457594,0.00021100526,0.0000751168,0.00032340118,0.002987185,0.0012924209,0.0058598346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979013,0.000027387581,0.0000117732325,0.000034706238,0.00011578239,0.000020275502],"domain_scores_gemma":[0.9996055,0.00014637805,0.000036060785,0.00006935311,0.00011114698,0.000031543914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041154356,0.000781435,0.0004818435,0.0006570632,0.00020437942,0.00089541933,0.0007757971,0.0010046024,0.0050576204],"category_scores_gemma":[0.0012788031,0.0006892479,0.0009391216,0.00045435727,0.0003524428,0.00026972464,0.00070730015,0.00059948413,0.0015160973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005124524,0.00019111783,0.002452807,0.00046388138,0.00014869585,0.00096497696,0.00029025358,0.5931197,0.1779453,0.0068423557,0.010648698,0.20641978],"study_design_scores_gemma":[0.000038941173,0.0001498953,0.0010762142,0.0000260829,0.00003493508,0.00072209316,0.0000411307,0.9378834,0.05280636,0.002095911,0.0050817397,0.000043336],"about_ca_topic_score_codex":0.0009608503,"about_ca_topic_score_gemma":0.0009701461,"teacher_disagreement_score":0.0050576204,"about_ca_system_score_codex":0.00030517316,"about_ca_system_score_gemma":0.0005555223,"threshold_uncertainty_score":0.016919494},"labels":[],"label_agreement":null},{"id":"W143476799","doi":"10.1007/978-3-642-30353-1_22","title":"A Study of Recommending Locations on Location-Based Social Network by Collaborative Filtering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Probabilistic latent semantic analysis; Collaborative filtering; Recommender system; Information retrieval; Web crawler; Set (abstract data type); Data mining; Probabilistic logic; Topic model; World Wide Web; Artificial intelligence","score_opus":0.029946102915028947,"score_gpt":0.28394811290900973,"score_spread":0.25400200999398076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143476799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.392474,0.009906352,0.58340424,0.0020726903,0.00025865907,0.0002387039,0.0003684563,0.00019466305,0.011082192],"genre_scores_gemma":[0.8932944,0.0044750394,0.09273872,0.0001579415,0.00057414,0.00010479525,0.00043119077,0.00007729069,0.008146455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724674,0.0012153956,0.00012887077,0.00072854536,0.00048723153,0.00019328367],"domain_scores_gemma":[0.96181303,0.033113267,0.0013554082,0.0014322259,0.0017396585,0.0005464551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003958465,0.0009741093,0.00212494,0.0029774918,0.0018038318,0.0031166319,0.0036497477,0.0032144852,0.0028163842],"category_scores_gemma":[0.023871396,0.0013019119,0.002273771,0.006682458,0.0019406206,0.008327513,0.0012629024,0.0018545777,0.0004799368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006726768,0.0011449401,0.051747214,0.0017292137,0.0015246569,0.0020085494,0.004088708,0.44641715,0.006290779,0.35215062,0.008293254,0.12393222],"study_design_scores_gemma":[0.000030692907,0.00018436673,0.0037512372,0.00005069379,0.00016425979,0.00032267414,0.00024429374,0.96886593,0.000495245,0.024107222,0.0017350656,0.00004832735],"about_ca_topic_score_codex":0.02489909,"about_ca_topic_score_gemma":0.012579083,"teacher_disagreement_score":0.02489909,"about_ca_system_score_codex":0.0020815341,"about_ca_system_score_gemma":0.0010026719,"threshold_uncertainty_score":0.049508333},"labels":[],"label_agreement":null},{"id":"W143535644","doi":"10.1007/978-3-540-69052-8_39","title":"Efficient Handling of Relational Database Combinatorial Queries Using CSPs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Tuple; Constraint (computer-aided design); Relational database; SQL; Database; Constraint satisfaction problem; Combinatorial explosion; Backtracking; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.025734946551540388,"score_gpt":0.24542847801456427,"score_spread":0.2196935314630239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143535644","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.021224193,0.0006016603,0.9617321,0.0006216278,0.00011154541,0.00036318201,0.0009906649,0.006237077,0.008117935],"genre_scores_gemma":[0.21856526,0.0007606241,0.76887465,0.0003650935,0.00017161333,0.000378249,0.002834214,0.0019811916,0.0060690087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99319446,0.00168846,0.0006874255,0.00076207984,0.002880888,0.0007866849],"domain_scores_gemma":[0.9874751,0.0079103345,0.00054875546,0.0025534825,0.0011893054,0.00032303325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033891038,0.001491849,0.0032002828,0.0016273445,0.0018589151,0.0063736397,0.005559795,0.0014460145,0.0089300675],"category_scores_gemma":[0.013770243,0.0014918318,0.0029408925,0.0057553905,0.0018106393,0.009414021,0.006088942,0.003909331,0.0022153312],"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.0012761947,0.0006066797,0.0016586215,0.0018620616,0.00031154844,0.0012839473,0.0009298014,0.14750785,0.021762878,0.3561747,0.048260577,0.41836524],"study_design_scores_gemma":[0.0002206482,0.00012737469,0.00027922753,0.00009134844,0.000114342576,0.00058305566,0.00043852287,0.7051918,0.015231697,0.25883415,0.01880911,0.000078839104],"about_ca_topic_score_codex":0.0039308565,"about_ca_topic_score_gemma":0.0064722374,"teacher_disagreement_score":0.0089300675,"about_ca_system_score_codex":0.0013914845,"about_ca_system_score_gemma":0.002641805,"threshold_uncertainty_score":0.029874027},"labels":[],"label_agreement":null},{"id":"W143725752","doi":"10.1007/978-3-642-30353-1_34","title":"Anomaly Detection via Coupled Gaussian Kernels","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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 Ottawa","funders":"","keywords":"Anomaly detection; Computer science; Artificial intelligence; Margin (machine learning); Support vector machine; Kernel (algebra); Pattern recognition (psychology); Classifier (UML); Multiple kernel learning; Machine learning; Gaussian; Feature vector; Kernel method; Ensemble learning; Anomaly (physics); Mathematics","score_opus":0.012976191230729045,"score_gpt":0.2388189143152819,"score_spread":0.22584272308455286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143725752","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.01384521,0.00014712317,0.9850348,0.000057870042,0.000026449068,0.000008133033,0.000018819195,0.0003697551,0.0004918545],"genre_scores_gemma":[0.6081933,0.000497853,0.385698,0.00009910189,0.00009518192,0.000040005823,0.00024640257,0.00024185482,0.004888312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895597,0.00021828503,0.000045187906,0.00027986392,0.00038334884,0.000117377764],"domain_scores_gemma":[0.99818295,0.00075647025,0.00019278881,0.00032010704,0.0004617076,0.00008594227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010783471,0.00080206414,0.0012418086,0.0011067304,0.00034250383,0.0013040972,0.0016783943,0.0012268984,0.00089529477],"category_scores_gemma":[0.0050209686,0.0005867805,0.0010271946,0.0014311943,0.00091663335,0.0024807635,0.0026323549,0.001650571,0.00050181337],"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.00049368956,0.00015769278,0.003433956,0.00017354016,0.00033005173,0.00021671057,0.00018507658,0.31983006,0.043127786,0.06516588,0.003407834,0.56347775],"study_design_scores_gemma":[0.0000036003262,0.000018192422,0.00031175945,0.0000027030235,0.00001234562,0.00008160202,0.000006137084,0.9831498,0.0028876087,0.013128699,0.0003862008,0.000011292518],"about_ca_topic_score_codex":0.001910945,"about_ca_topic_score_gemma":0.0016791663,"teacher_disagreement_score":0.001910945,"about_ca_system_score_codex":0.0006549119,"about_ca_system_score_gemma":0.00053110934,"threshold_uncertainty_score":0.005702913},"labels":[],"label_agreement":null},{"id":"W143795810","doi":"10.1007/978-3-642-02611-9_24","title":"An Interactive Image Feature Visualization System for Supporting CBIR Study","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Visualization; Feature (linguistics); Information retrieval; Image retrieval; Semantic gap; Semantics (computer science); Flexibility (engineering); Content-based image retrieval; Coding (social sciences); Relevance feedback; Artificial intelligence; Image (mathematics)","score_opus":0.016275782817381543,"score_gpt":0.31930997073163725,"score_spread":0.3030341879142557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143795810","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.025655823,0.00078806805,0.68755376,0.00038461393,0.00019719105,0.0006295895,0.007966643,0.26714897,0.009675402],"genre_scores_gemma":[0.13003889,0.0007344484,0.8239883,0.00047301888,0.00015960833,0.0015648266,0.008457637,0.013507528,0.021075688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980015,0.000032534925,0.000015754966,0.00004574703,0.000082572864,0.00002320862],"domain_scores_gemma":[0.99872833,0.0007600782,0.000031611657,0.00014949139,0.00021434718,0.00011612295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007418275,0.001441605,0.0009194074,0.0016422123,0.0005666072,0.0012873276,0.0016229786,0.0010493116,0.07173439],"category_scores_gemma":[0.0019220948,0.00067716517,0.0005654309,0.0011312438,0.00016739413,0.0012757102,0.0017464884,0.00068456435,0.009697768],"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.0019794183,0.0002788849,0.0014267383,0.0009138491,0.00012609373,0.00068894395,0.0007276816,0.0015961836,0.17517805,0.0018584145,0.16222484,0.65300083],"study_design_scores_gemma":[0.0014637443,0.0009298678,0.026457854,0.0005468473,0.0006546041,0.004255512,0.000807634,0.28248686,0.2979888,0.01430522,0.36950362,0.0005994921],"about_ca_topic_score_codex":0.002167301,"about_ca_topic_score_gemma":0.0045588803,"teacher_disagreement_score":0.07173439,"about_ca_system_score_codex":0.00030143544,"about_ca_system_score_gemma":0.00047239623,"threshold_uncertainty_score":0.23997545},"labels":[],"label_agreement":null},{"id":"W1438552389","doi":"10.1007/978-3-642-34191-5_19","title":"Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar; Computer science; Planar graph; Enhanced Data Rates for GSM Evolution; Bounded function; Constant (computer programming); Book embedding; Outerplanar graph; Geometry; Algorithm; 1-planar graph; Combinatorics; Computer graphics (images); Pathwidth; Theoretical computer science; Graph; Mathematics; Chordal graph; Artificial intelligence; Mathematical analysis; Programming language; Line graph","score_opus":0.01865126701825929,"score_gpt":0.2478325409799121,"score_spread":0.22918127396165283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1438552389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23046055,0.0027543763,0.5886043,0.0008034565,0.00033718836,0.00019164706,0.0011371743,0.0021058342,0.17360553],"genre_scores_gemma":[0.6129799,0.003539588,0.31335452,0.00027460218,0.00022827975,0.0001826994,0.0020704817,0.0014930977,0.0658768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.00010685899,0.000021188866,0.000087255874,0.0001843323,0.00006116998],"domain_scores_gemma":[0.9989048,0.0005038244,0.000118227115,0.00022622875,0.00013991378,0.00010697832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035096434,0.0008993239,0.00073611696,0.001267047,0.00067488896,0.0022403435,0.0012769982,0.0008699959,0.015597077],"category_scores_gemma":[0.002133844,0.0009575343,0.0005092732,0.002688172,0.0006112046,0.0024932506,0.0012930626,0.0026327681,0.0027265174],"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.0002459097,0.00011208371,0.0008790424,0.00049779913,0.000035958008,0.00047972274,0.000663905,0.064415485,0.019752879,0.67497647,0.02540342,0.21253741],"study_design_scores_gemma":[0.000085632906,0.000096164964,0.0013741623,0.00009975029,0.00004851747,0.0008773937,0.0002922705,0.15449123,0.006650869,0.78276473,0.053176425,0.00004273676],"about_ca_topic_score_codex":0.000942775,"about_ca_topic_score_gemma":0.0019622694,"teacher_disagreement_score":0.015597077,"about_ca_system_score_codex":0.0006924394,"about_ca_system_score_gemma":0.0002447228,"threshold_uncertainty_score":0.05217743},"labels":[],"label_agreement":null},{"id":"W1440639274","doi":"10.1007/978-3-319-22360-5_20","title":"State Complexity of Prefix Distance","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Substring; Suffix; Prefix; Generalized suffix tree; Combinatorics; Deterministic finite automaton; Nondeterministic algorithm; Regular language; State (computer science); Nondeterministic finite automaton; Discrete mathematics; Mathematics; Computer science; Suffix tree; Finite-state machine; Set (abstract data type); Automaton; Algorithm; Theoretical computer science; Automata theory","score_opus":0.039669410557302325,"score_gpt":0.26118050086586275,"score_spread":0.22151109030856042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1440639274","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.4329573,0.003062881,0.38528904,0.0072665946,0.00036629074,0.0001461837,0.002459364,0.00070397946,0.16774836],"genre_scores_gemma":[0.9562389,0.0012590222,0.02097146,0.00026181448,0.00042376708,0.00020144277,0.0010220122,0.00023687162,0.01938467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721164,0.00058733585,0.00018082153,0.00056801573,0.0010576906,0.0003945846],"domain_scores_gemma":[0.98556465,0.011006815,0.00063052634,0.0014443673,0.0008440892,0.0005095911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014554184,0.00059479254,0.0015237507,0.0015467184,0.0016604403,0.006682009,0.0023256703,0.0021186087,0.01730441],"category_scores_gemma":[0.01300275,0.00076352723,0.0014359341,0.0031313165,0.0034598361,0.014237784,0.0040199533,0.0047066943,0.0014632543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000705288,0.000024296214,0.00027370808,0.000071698654,0.000011291637,0.000034408476,0.00016759736,0.008231761,0.0005182058,0.98088545,0.0014434486,0.008267597],"study_design_scores_gemma":[0.000008701989,0.000009802831,0.00012211886,0.000009156426,0.000008365126,0.000028967652,0.00002574803,0.02307171,0.00034777116,0.97549224,0.00086615275,0.000009375701],"about_ca_topic_score_codex":0.0014417974,"about_ca_topic_score_gemma":0.0010573091,"teacher_disagreement_score":0.01730441,"about_ca_system_score_codex":0.0034832323,"about_ca_system_score_gemma":0.001644531,"threshold_uncertainty_score":0.057889044},"labels":[],"label_agreement":null},{"id":"W1441645061","doi":"10.1007/978-3-642-32355-3_7","title":"Model Checking Workflow Monitors and Its Application to a Pain Management Process","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Correctness; Workflow; Model checking; Workflow management system; Process (computing); Workflow technology; Programming language; Reliability (semiconductor); Software engineering; Distributed computing; Database","score_opus":0.020555461501223938,"score_gpt":0.2414477486627316,"score_spread":0.22089228716150766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1441645061","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.04659406,0.00010873817,0.947981,0.00016404872,0.000034135737,0.00011108679,0.00008941522,0.0038269577,0.001090608],"genre_scores_gemma":[0.53132886,0.00014764017,0.46575516,0.00006177656,0.000027933102,0.00014656025,0.00017081962,0.00042981724,0.0019314256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841774,0.00052576436,0.000094278796,0.00028596236,0.0005741963,0.00010213538],"domain_scores_gemma":[0.99082947,0.0072177886,0.00046943044,0.0007902914,0.0005797344,0.00011337423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030375968,0.00070928026,0.00080110977,0.0008783165,0.0007703732,0.0019393077,0.0017744816,0.0014799922,0.0026077826],"category_scores_gemma":[0.012699144,0.00063276495,0.0012940691,0.00089253904,0.001185705,0.0014478182,0.0013728255,0.0017469607,0.00031280276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017054869,0.00046707172,0.0065364745,0.00034455248,0.00016088529,0.0008847223,0.00093989336,0.587215,0.050224748,0.120245025,0.003045885,0.22823015],"study_design_scores_gemma":[0.000032583088,0.000058990725,0.0002679058,0.000011710373,0.000031761017,0.000058139056,0.000018219884,0.9764796,0.009355876,0.012906048,0.0007651282,0.000014045721],"about_ca_topic_score_codex":0.008199031,"about_ca_topic_score_gemma":0.0048171165,"teacher_disagreement_score":0.008199031,"about_ca_system_score_codex":0.0009486272,"about_ca_system_score_gemma":0.001723877,"threshold_uncertainty_score":0.016302645},"labels":[],"label_agreement":null},{"id":"W14417179","doi":"10.1007/978-3-642-40498-6_12","title":"Dynamic Tangible User Interface Palettes","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bundesministerium für Bildung und Forschung","keywords":"Computer science; Affordance; Mobile device; Human–computer interaction; Computer graphics (images); Palette (painting); Graphics; Context (archaeology); Interface (matter); User interface; Spatial contextual awareness; Stylus; Multimedia; World Wide Web; Artificial intelligence; Computer vision","score_opus":0.009557112163916864,"score_gpt":0.24788427715095687,"score_spread":0.23832716498704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14417179","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.019104622,0.005804187,0.7111779,0.0004406546,0.00089859887,0.00022734542,0.00115127,0.012687494,0.2485078],"genre_scores_gemma":[0.20743637,0.009682083,0.2574943,0.0007347148,0.0002662212,0.0007062002,0.0023271004,0.0044434145,0.51690966],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973196,0.000032961932,0.000013866941,0.000044410324,0.00014567724,0.000031162108],"domain_scores_gemma":[0.99973506,0.00010687646,0.000011623894,0.00006660705,0.00005002616,0.000029656057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027816594,0.001243169,0.00056268764,0.00094535685,0.0005243839,0.0016840694,0.0016210582,0.0010318703,0.14295499],"category_scores_gemma":[0.0011066056,0.0007904292,0.0007179268,0.0008843645,0.00043286599,0.002547709,0.003177973,0.0014897479,0.021301892],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004216783,0.00012636837,0.00024944625,0.0014767904,0.00004248587,0.00051556353,0.0007741016,0.0043259836,0.14693567,0.054553423,0.050048873,0.7405296],"study_design_scores_gemma":[0.00018253861,0.0006636476,0.0035235893,0.0014499255,0.00010825261,0.004720762,0.00051233784,0.036807094,0.068883836,0.03552285,0.8473379,0.00028724337],"about_ca_topic_score_codex":0.0003427145,"about_ca_topic_score_gemma":0.00049363583,"teacher_disagreement_score":0.14295499,"about_ca_system_score_codex":0.00018541446,"about_ca_system_score_gemma":0.00017196742,"threshold_uncertainty_score":0.4782321},"labels":[],"label_agreement":null},{"id":"W1442252536","doi":"10.1007/978-3-319-11964-9_25","title":"A Cross-Platform Benchmark Framework for Mobile Semantic Web Reasoning Engines","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Dalhousie University","funders":"Bayer HealthCare","keywords":"Computer science; Semantic Web; Benchmark (surveying); Semantic reasoner; Robustness (evolution); Mobile Web; Mobile device; Reasoning system; Social Semantic Web; Mobile technology; World Wide Web; Data science; Artificial intelligence","score_opus":0.01641933500629372,"score_gpt":0.2754278437981124,"score_spread":0.2590085087918187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442252536","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.14420293,0.003867097,0.5544216,0.0023360779,0.0013451183,0.004325173,0.027809948,0.19910546,0.06258662],"genre_scores_gemma":[0.29447034,0.0017530771,0.5301075,0.0008262282,0.00016551242,0.0019651647,0.13010773,0.018724956,0.021879438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99023914,0.0021079998,0.0018081915,0.0011341204,0.0037022543,0.0010082483],"domain_scores_gemma":[0.990397,0.002070571,0.00042292263,0.003302014,0.0030862568,0.0007212949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01110028,0.002829431,0.0017216621,0.005175248,0.0021668433,0.007154025,0.008658433,0.003189436,0.0068754083],"category_scores_gemma":[0.019936813,0.0016184973,0.002282422,0.0044979975,0.0011186625,0.012330954,0.006041964,0.0033583941,0.0057110605],"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.0047805198,0.005554614,0.011469335,0.0032771912,0.001023782,0.0016507661,0.0012471229,0.10294511,0.030771993,0.16103432,0.27119505,0.4050502],"study_design_scores_gemma":[0.00084398326,0.0011559515,0.0055768588,0.000647171,0.0005578532,0.0010724978,0.0012116845,0.6254376,0.07107147,0.053592406,0.23846082,0.000371689],"about_ca_topic_score_codex":0.022204356,"about_ca_topic_score_gemma":0.019513363,"teacher_disagreement_score":0.022204356,"about_ca_system_score_codex":0.0029629304,"about_ca_system_score_gemma":0.005035079,"threshold_uncertainty_score":0.058704555},"labels":[],"label_agreement":null},{"id":"W1442386651","doi":"10.1007/978-3-319-23660-5_15","title":"Mechanical Proofs of Properties of the Tribonacci Word","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematical proof; Class (philosophy); Word (group theory); Point (geometry); Mathematics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.0298734212841338,"score_gpt":0.25029416221898626,"score_spread":0.22042074093485245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442386651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21539974,0.0035451862,0.422303,0.009177308,0.002203682,0.00017481472,0.0006816105,0.0012297917,0.34528485],"genre_scores_gemma":[0.94649744,0.00056697516,0.032410935,0.00087649666,0.0007962469,0.00015056551,0.00039864282,0.000374932,0.0179278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979418,0.0006781299,0.00014693166,0.00036094015,0.00061401917,0.00025821172],"domain_scores_gemma":[0.98963016,0.0069911825,0.0004427915,0.0016623671,0.0009293367,0.00034410605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017007038,0.00067042845,0.0009682558,0.0015549583,0.003713163,0.0036930512,0.0020215493,0.0022281385,0.015326678],"category_scores_gemma":[0.014265946,0.0008367877,0.0015409095,0.0011933522,0.0058095315,0.007600667,0.0034128649,0.0035905477,0.0018841128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028098242,0.000010415872,0.00010839819,0.00005091502,0.0000072799776,0.00010574264,0.00020674696,0.00034000777,0.00086371286,0.994514,0.0012183423,0.002546278],"study_design_scores_gemma":[0.000014905018,0.000010149926,0.000099580764,0.000015763404,0.0000063123375,0.0000838303,0.0000541341,0.0017751743,0.0011158347,0.9925217,0.0042909677,0.000011556634],"about_ca_topic_score_codex":0.0009730286,"about_ca_topic_score_gemma":0.00096518785,"teacher_disagreement_score":0.015326678,"about_ca_system_score_codex":0.0015433877,"about_ca_system_score_gemma":0.00091990246,"threshold_uncertainty_score":0.05127287},"labels":[],"label_agreement":null},{"id":"W1442388864","doi":"10.1007/978-3-642-36315-3_10","title":"Properties of Quantum Templates","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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 New Brunswick","funders":"","keywords":"Template; Rewriting; Computer science; Electronic circuit; Quantum; Set (abstract data type); Identity (music); Process (computing); Template matching; Theoretical computer science; Algorithm; Programming language; Image (mathematics); Artificial intelligence; Electrical engineering; Physics","score_opus":0.01877705793520472,"score_gpt":0.22070524635497776,"score_spread":0.20192818841977306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442388864","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.15670279,0.0024978977,0.20078975,0.0024413853,0.0006604038,0.00018143449,0.0010119372,0.00053949293,0.6351749],"genre_scores_gemma":[0.90468943,0.0017171497,0.0341292,0.0005693484,0.00090687256,0.00026719482,0.0010360347,0.00046584182,0.056218952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990151,0.00020542683,0.000072959956,0.0001923961,0.00037137594,0.0001427318],"domain_scores_gemma":[0.9986576,0.00053960347,0.00013418375,0.0003985056,0.00015219024,0.000117918185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482646,0.00047869157,0.000837538,0.0011255586,0.0016028015,0.0047818027,0.0010048355,0.0012898091,0.011546769],"category_scores_gemma":[0.0036915867,0.00057039806,0.00084058335,0.0011605534,0.003465483,0.004991964,0.0016951518,0.0024304201,0.0022399046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006206499,0.0000034606494,0.00002969113,0.000009408877,0.0000012930935,0.000009504917,0.000042114338,0.0001757343,0.0003559548,0.9964059,0.0005511378,0.0024096114],"study_design_scores_gemma":[0.000003815355,0.000004848684,0.000050576222,0.0000057387015,0.000001798371,0.00004428256,0.000018572058,0.0011544373,0.0005327201,0.995074,0.0031048097,0.0000044900557],"about_ca_topic_score_codex":0.0004091731,"about_ca_topic_score_gemma":0.00027491298,"teacher_disagreement_score":0.011546769,"about_ca_system_score_codex":0.0010586305,"about_ca_system_score_gemma":0.00065803016,"threshold_uncertainty_score":0.038627744},"labels":[],"label_agreement":null},{"id":"W1442440875","doi":"10.1007/978-3-319-16811-1_45","title":"Hand Segmentation with Structured Convolutional Learning","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Artificial intelligence; Pose; Inference; Segmentation; Key (lock); Convolutional neural network; Deep learning; Labeled data; Machine learning; Gesture; Pixel; Computer vision; Pattern recognition (psychology)","score_opus":0.023332256996718866,"score_gpt":0.24935614784748517,"score_spread":0.2260238908507663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442440875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055979276,0.0007145568,0.97942436,0.000110414694,0.00009309775,0.000059517868,0.00046380973,0.007869061,0.00566731],"genre_scores_gemma":[0.14364132,0.0013282491,0.8144747,0.00040085902,0.00013345304,0.00014257769,0.0037352932,0.0017613256,0.03438221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.000021421896,0.000016231292,0.00016367657,0.00009280264,0.00006933688],"domain_scores_gemma":[0.99965787,0.00008164152,0.000033863147,0.0001213475,0.00007616404,0.000029108625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046754212,0.0014922424,0.0013856455,0.0013544384,0.0003736312,0.0013675042,0.0020360607,0.0016407422,0.012316136],"category_scores_gemma":[0.00068068405,0.0012262833,0.0013599492,0.0014428927,0.0006429998,0.0013881437,0.0016078898,0.0014581041,0.00839283],"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.00013999044,0.00007120563,0.00030795214,0.00020513839,0.00009810204,0.00008756061,0.000043879638,0.08789055,0.0385983,0.007395399,0.013359723,0.85180223],"study_design_scores_gemma":[0.000009728565,0.00004670695,0.00041752428,0.000051034353,0.000032805892,0.0001555996,0.000013620319,0.95073795,0.025462938,0.015847178,0.007202693,0.000022182723],"about_ca_topic_score_codex":0.0094589405,"about_ca_topic_score_gemma":0.018785745,"teacher_disagreement_score":0.012316136,"about_ca_system_score_codex":0.001011644,"about_ca_system_score_gemma":0.0014640953,"threshold_uncertainty_score":0.04120159},"labels":[],"label_agreement":null},{"id":"W1443472105","doi":"10.1007/978-3-642-37658-0_13","title":"A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Executor; Computer science; Parallel computing; Metis; Computation; Graph partition; Graph; Multi-core processor; Scheduling (production processes); Cluster analysis; Locality; Shared memory; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.018734449565246756,"score_gpt":0.2530993612407089,"score_spread":0.23436491167546217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1443472105","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.010087165,0.0004100259,0.9452775,0.00015114999,0.000120129196,0.00017212915,0.0005207876,0.036293093,0.006967971],"genre_scores_gemma":[0.06562087,0.00020268651,0.9159091,0.00017256431,0.00007052471,0.00027458393,0.0011477744,0.0047063893,0.011895604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.0000803553,0.000041210118,0.00013907369,0.00019848639,0.000078635625],"domain_scores_gemma":[0.9992176,0.0003244227,0.00003912999,0.00020662665,0.00016292428,0.000049124537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006936398,0.0015561366,0.0012500559,0.0010005921,0.0009224719,0.0013169396,0.0025187226,0.00094645866,0.02560993],"category_scores_gemma":[0.0017950585,0.00095778296,0.0010545232,0.0013920624,0.00044568846,0.002175314,0.0014440006,0.0015189456,0.0071803173],"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.0012664573,0.00026726618,0.0005098858,0.00042398638,0.00012405892,0.00016114069,0.00021438688,0.04908172,0.044499177,0.02344683,0.052837487,0.82716763],"study_design_scores_gemma":[0.00059718266,0.00021191103,0.0005627046,0.000063024694,0.0001126196,0.00021109612,0.00008428008,0.8499079,0.05240746,0.05444412,0.04131204,0.000085567226],"about_ca_topic_score_codex":0.003477616,"about_ca_topic_score_gemma":0.007724284,"teacher_disagreement_score":0.02560993,"about_ca_system_score_codex":0.0009931428,"about_ca_system_score_gemma":0.0015291548,"threshold_uncertainty_score":0.08567381},"labels":[],"label_agreement":null},{"id":"W1444918406","doi":"10.1007/978-3-319-21966-0_6","title":"Privacy-Preserving Distance-Bounding Proof-of-Knowledge","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Gas meter prover; Anonymity; Computer science; Protocol (science); Bounding overwatch; Discrete mathematics; Public-key cryptography; Computer security; Combinatorics; Mathematics; Mathematical proof; Encryption","score_opus":0.03646465178910363,"score_gpt":0.28133050551089944,"score_spread":0.2448658537217958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1444918406","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.0068065273,0.0014971419,0.9575315,0.0019500515,0.0002712339,0.00014611614,0.00038212448,0.0010429387,0.030372245],"genre_scores_gemma":[0.6014685,0.004352589,0.357178,0.001399335,0.0009216308,0.0005241972,0.0014729416,0.00068039144,0.032002382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876951,0.002793873,0.0006517357,0.0018683274,0.0055188686,0.0014721482],"domain_scores_gemma":[0.97531223,0.013731504,0.00097601966,0.007960174,0.0014973008,0.00052277755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044526346,0.0016892714,0.0026491496,0.0021673443,0.002260244,0.006669045,0.0062542143,0.0037220216,0.008443898],"category_scores_gemma":[0.027334368,0.0016717218,0.0026302577,0.0042491322,0.0055196895,0.018578485,0.01485394,0.009321031,0.003918669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019127384,0.00008877635,0.00018947068,0.0003473778,0.00005860986,0.00012372495,0.0002939335,0.018931743,0.0015364515,0.89730805,0.00878212,0.072148375],"study_design_scores_gemma":[0.000031307285,0.000029846507,0.000066725326,0.00006673188,0.000034963523,0.0002938209,0.00003277723,0.04821376,0.0028579591,0.9395139,0.008825137,0.000033097687],"about_ca_topic_score_codex":0.0007143639,"about_ca_topic_score_gemma":0.00041028805,"teacher_disagreement_score":0.008443898,"about_ca_system_score_codex":0.0029163642,"about_ca_system_score_gemma":0.0032412538,"threshold_uncertainty_score":0.028247654},"labels":[],"label_agreement":null},{"id":"W1446494181","doi":"10.1007/978-3-642-40447-4_1","title":"Some History of Functional Programming Languages","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Wollongong; Rijksuniversiteit Groningen; Université de Montréal; University of Warwick; University of St Andrews; Clemson University; Ulster University; University of Oregon; Iowa State University; University of Denver; University College London; California Institute of Technology; University of Essex; University of Wisconsin-Milwaukee","keywords":"Computer science; Programming language; Functional programming","score_opus":0.02326391706059837,"score_gpt":0.22939733033111304,"score_spread":0.20613341327051465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1446494181","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055724513,0.1946935,0.12165668,0.029596664,0.0043648127,0.000052693136,0.00034883284,0.0005048076,0.6432095],"genre_scores_gemma":[0.29129177,0.1863695,0.076346956,0.0177774,0.012241864,0.0003742307,0.00069568976,0.0010479537,0.41385466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992224,0.00028135924,0.000045225097,0.00013537356,0.00022985913,0.00008572056],"domain_scores_gemma":[0.9983096,0.0012200176,0.00004168023,0.00013347395,0.00024058006,0.000054648615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016392362,0.00071696006,0.00042836115,0.002419325,0.0018107143,0.0036382403,0.0012508568,0.0016190753,0.0144326305],"category_scores_gemma":[0.0034281164,0.00068433105,0.00054111035,0.0026443352,0.0069638486,0.008297953,0.0011972185,0.003930601,0.002597321],"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.00001575795,0.000012531936,0.000055412376,0.00012506428,0.000003552151,0.000036168276,0.00053073704,0.00026816982,0.00014949689,0.9244037,0.017816192,0.05658318],"study_design_scores_gemma":[0.0000076119186,0.000015607684,0.00013032684,0.00031723123,0.00000364294,0.00015416989,0.00011918416,0.00052701234,0.00023978169,0.52114165,0.47732836,0.000015314827],"about_ca_topic_score_codex":0.003057741,"about_ca_topic_score_gemma":0.0023885553,"teacher_disagreement_score":0.0144326305,"about_ca_system_score_codex":0.0032177854,"about_ca_system_score_gemma":0.0012854842,"threshold_uncertainty_score":0.048281968},"labels":[],"label_agreement":null},{"id":"W144890170","doi":"10.1007/978-3-662-43454-3_16","title":"A Framework for Integrating Motivational Techniques in Technology Enhanced Learning","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Motivation and Self-Concept in Sports","field":"Psychology","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":"Athabasca University","funders":"","keywords":"Personalization; Set (abstract data type); Computer science; Key (lock); Knowledge management; Human–computer interaction; World Wide Web","score_opus":0.018956683506198196,"score_gpt":0.3078073422422498,"score_spread":0.28885065873605165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144890170","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.0043389183,0.0014225184,0.91445684,0.0021390282,0.00014969801,0.0002226713,0.00005020519,0.00042702298,0.076793104],"genre_scores_gemma":[0.16445151,0.0013912873,0.8096412,0.00030147666,0.00007477715,0.0007904333,0.00008708002,0.00010572103,0.023156516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.0004238623,0.000056839985,0.00011267108,0.00023318199,0.0000904359],"domain_scores_gemma":[0.99949324,0.00027732603,0.00003838754,0.000058096328,0.00007252968,0.000060415467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016788698,0.00081644196,0.00038175363,0.0012818249,0.0011801112,0.004525172,0.0020436575,0.0018256917,0.00871692],"category_scores_gemma":[0.0017692981,0.00041761843,0.00095875113,0.0012438555,0.0027761105,0.0044189133,0.0030010869,0.0024107597,0.0013650345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059309114,0.00006100524,0.00012401846,0.000077693054,0.000011096791,0.000046473677,0.00070241024,0.002211791,0.00063138077,0.9539474,0.0009646486,0.04121609],"study_design_scores_gemma":[0.000019899393,0.00007525417,0.00043298435,0.0002708033,0.00003208607,0.00018917976,0.000824413,0.032013845,0.0013101937,0.8770862,0.08771014,0.000035016335],"about_ca_topic_score_codex":0.0025573582,"about_ca_topic_score_gemma":0.0033961025,"teacher_disagreement_score":0.00871692,"about_ca_system_score_codex":0.0017721284,"about_ca_system_score_gemma":0.0020485441,"threshold_uncertainty_score":0.029160976},"labels":[],"label_agreement":null},{"id":"W144999544","doi":"10.1007/978-3-642-35527-1_17","title":"Variational Learning of Dirichlet Process Mixtures of Generalized Dirichlet Distributions and Its Applications","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Overfitting; Dirichlet process; Cluster analysis; Computer science; Dirichlet distribution; Hierarchical Dirichlet process; Artificial intelligence; Inference; Nonparametric statistics; Algorithm; Latent Dirichlet allocation; Applied mathematics; Pattern recognition (psychology); Mathematics; Topic model; Artificial neural network; Statistics","score_opus":0.017421766839658275,"score_gpt":0.2790416501951262,"score_spread":0.26161988335546793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144999544","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.0024715136,0.0023657582,0.99276924,0.00041849806,0.00010075435,0.000024377949,0.00007762702,0.00009025439,0.0016820072],"genre_scores_gemma":[0.22018938,0.010176063,0.74688476,0.0007347455,0.0014336902,0.0006572011,0.001559779,0.0006889544,0.017675329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575305,0.0026086362,0.00018788468,0.00065521186,0.00057482295,0.00022028711],"domain_scores_gemma":[0.9862482,0.011737837,0.000433928,0.0005872939,0.00070046895,0.00029225324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007001352,0.0015469842,0.0033456772,0.0024186429,0.0011385786,0.004025211,0.004584044,0.0033417349,0.004420957],"category_scores_gemma":[0.029008511,0.0026250302,0.0035162338,0.004269454,0.0034501874,0.0053461078,0.0043278164,0.005652839,0.0009599888],"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.00007928358,0.00006468617,0.000596349,0.0002636274,0.00017724746,0.000059688497,0.00035857424,0.18696576,0.00055161846,0.75223005,0.0037801093,0.054872878],"study_design_scores_gemma":[0.000010664857,0.00000899831,0.00013840331,0.00003202646,0.000020649655,0.000036148213,0.00002370201,0.54503274,0.00012379682,0.45239237,0.0021534176,0.000027058943],"about_ca_topic_score_codex":0.0076375245,"about_ca_topic_score_gemma":0.0062646875,"teacher_disagreement_score":0.0076375245,"about_ca_system_score_codex":0.0026330112,"about_ca_system_score_gemma":0.0018932286,"threshold_uncertainty_score":0.03702712},"labels":[],"label_agreement":null},{"id":"W1450019710","doi":"10.1007/978-3-319-20916-6_71","title":"An Exploration of Shape in Crowd Computer Interactions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","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":"Carleton University","funders":"","keywords":"Computer science; Crowd simulation; Human–computer interaction; Computer graphics (images); Artificial intelligence; Computer vision; Multimedia; Crowds; Computer security","score_opus":0.044358396982993986,"score_gpt":0.28869308021741263,"score_spread":0.24433468323441865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1450019710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2125619,0.009848946,0.5737134,0.002450102,0.00038201534,0.00007685066,0.00056466984,0.0008689683,0.19953309],"genre_scores_gemma":[0.8709841,0.0046458594,0.0942704,0.00019969711,0.00015069717,0.000062870815,0.00028215948,0.00034889797,0.02905536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999912,0.000027610358,0.0000021647006,0.000016825947,0.000028633667,0.0000127631565],"domain_scores_gemma":[0.9996742,0.00022160131,0.000016796153,0.00002365989,0.000031266398,0.000032477205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017605502,0.00037323887,0.0003630361,0.000530462,0.0005796971,0.001798578,0.00060078746,0.0007581457,0.007846581],"category_scores_gemma":[0.0015112853,0.0003562263,0.0005010852,0.00093718333,0.0011274731,0.0020239449,0.0016910979,0.0006266357,0.0006163665],"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.00023873057,0.000061414365,0.0029775356,0.0005605973,0.000050377548,0.0006607079,0.005005621,0.24387412,0.014089485,0.50867087,0.013281812,0.2105287],"study_design_scores_gemma":[0.000017272754,0.000054083535,0.002529556,0.00014591626,0.000016412043,0.00039256603,0.001532304,0.49610168,0.0019882661,0.45836055,0.038809408,0.000051995958],"about_ca_topic_score_codex":0.0018874247,"about_ca_topic_score_gemma":0.002014485,"teacher_disagreement_score":0.007846581,"about_ca_system_score_codex":0.00042747147,"about_ca_system_score_gemma":0.00029767054,"threshold_uncertainty_score":0.026249468},"labels":[],"label_agreement":null},{"id":"W1450652887","doi":"10.1007/978-3-642-38085-3_7","title":"Use of a Mixed-Reality System to Improve the Planning of Brain Tumour Resections: Preliminary Results","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Western University","funders":"","keywords":"Computer science; Visualization; Context (archaeology); Augmented reality; Human–computer interaction; Surgical planning; Artificial intelligence; Medical physics; Machine learning; Medicine; Radiology","score_opus":0.04022304538469672,"score_gpt":0.28008467486053956,"score_spread":0.23986162947584283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1450652887","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.7432959,0.004677877,0.24198881,0.00021426904,0.0002457783,0.0006099444,0.0010705745,0.0025038228,0.0053929836],"genre_scores_gemma":[0.8504013,0.002642701,0.13989483,0.00019680912,0.000111083114,0.0003785092,0.0010571515,0.00046614424,0.0048514414],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992889,0.00024815917,0.00004951293,0.00010695355,0.00023141503,0.00007498615],"domain_scores_gemma":[0.9987546,0.0007939746,0.000067953806,0.0001853679,0.0001384115,0.00005955815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089742703,0.0013844057,0.00095247483,0.0007512093,0.000271121,0.0008314969,0.0013554979,0.001202524,0.005458604],"category_scores_gemma":[0.002325166,0.000868261,0.0010873481,0.0005334154,0.0005436992,0.00080321054,0.0010157126,0.00062220026,0.0011764057],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077060964,0.0028236452,0.007604549,0.0015712738,0.00065315893,0.0013554797,0.001269192,0.04097468,0.48991463,0.0003931852,0.001987338,0.44374675],"study_design_scores_gemma":[0.0013698537,0.035579074,0.07318945,0.00025802615,0.0028645634,0.012428331,0.0009166746,0.2890915,0.5675608,0.0010368357,0.014955008,0.0007498517],"about_ca_topic_score_codex":0.0027061843,"about_ca_topic_score_gemma":0.001556119,"teacher_disagreement_score":0.005458604,"about_ca_system_score_codex":0.0002634261,"about_ca_system_score_gemma":0.00042395972,"threshold_uncertainty_score":0.018260837},"labels":[],"label_agreement":null},{"id":"W145092378","doi":"10.1007/978-3-642-21070-9_8","title":"A First-Order Calculus for Allegories","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Brock University; University of Toronto","funders":"","keywords":"Soundness; Calculus (dental); Computer science; Completeness (order theory); Natural deduction; Pi calculus; Relational calculus; Situation calculus; Programming language; Mathematics; Relational model; Relational database; Information retrieval","score_opus":0.02890156536945149,"score_gpt":0.2500076781511855,"score_spread":0.22110611278173403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145092378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007235794,0.0018234587,0.9053512,0.0022877287,0.0009908297,0.00012880513,0.0010821512,0.002201151,0.078898795],"genre_scores_gemma":[0.28926155,0.003012248,0.62957704,0.0014401973,0.0013578328,0.00044263055,0.0023306527,0.0017570874,0.07082078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976532,0.00043953702,0.00026237124,0.00046367594,0.0008301871,0.00035118154],"domain_scores_gemma":[0.99801457,0.0008268462,0.00006914903,0.0004710491,0.00047790064,0.00014051057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029546602,0.0015933083,0.0017596815,0.0030223157,0.0057514487,0.009541664,0.0038150484,0.0033850393,0.015500242],"category_scores_gemma":[0.004315831,0.0024201043,0.004201354,0.0040765502,0.0078072953,0.021047298,0.005043662,0.008508876,0.005356138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005032326,0.000010873017,0.000030630305,0.000026991658,0.000004124044,0.00003372529,0.0001792255,0.00031160485,0.00019380469,0.991879,0.0018103087,0.0055146595],"study_design_scores_gemma":[0.000007941136,0.000003626831,0.000027204032,0.000017210581,0.00001224603,0.000056770306,0.00003743706,0.001483321,0.00030019006,0.9782687,0.0197709,0.000014480507],"about_ca_topic_score_codex":0.0065115117,"about_ca_topic_score_gemma":0.007855982,"teacher_disagreement_score":0.015500242,"about_ca_system_score_codex":0.0044283634,"about_ca_system_score_gemma":0.0029943874,"threshold_uncertainty_score":0.051853478},"labels":[],"label_agreement":null},{"id":"W145098650","doi":"10.1007/978-3-642-34481-7_2","title":"Time Series Prediction Method Based on LS-SVR with Modified Gaussian RBF","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Gaussian function; Kernel (algebra); Gaussian; Series (stratigraphy); Radial basis function kernel; Radial basis function; Mathematics; Support vector machine; Algorithm; Function (biology); Applied mathematics; Computer science; Kernel method; Mathematical optimization; Artificial intelligence; Artificial neural network; Physics","score_opus":0.015378322034223586,"score_gpt":0.24211858492055036,"score_spread":0.22674026288632676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145098650","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.020447195,0.00039795684,0.9769091,0.00009571535,0.00014404605,0.000025244886,0.000045615947,0.0007993642,0.0011356852],"genre_scores_gemma":[0.6654473,0.00067514466,0.32519087,0.00011831819,0.00017733772,0.00014606626,0.00035691608,0.00017404357,0.00771398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966526,0.00006768001,0.000025149593,0.00010295719,0.00010854718,0.000030444016],"domain_scores_gemma":[0.99960965,0.000118635035,0.00003138345,0.00003509595,0.00018620494,0.00001905984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007486067,0.000585456,0.0012412268,0.00039375102,0.00035993234,0.0005787539,0.0010591863,0.0008869899,0.0015068464],"category_scores_gemma":[0.0012700296,0.00033275905,0.00081138295,0.0006542781,0.0002130638,0.0009970954,0.00046762437,0.0010524783,0.00053726515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003530631,0.00016387938,0.001908087,0.00019970367,0.00017523572,0.00012835127,0.00008989909,0.5822885,0.020014137,0.006428047,0.003973654,0.3842775],"study_design_scores_gemma":[0.0000023203518,0.000011420355,0.00009893731,0.0000014367081,0.00000596851,0.000008561621,0.0000016278375,0.9989091,0.0005856285,0.00020841199,0.0001629616,0.0000035586788],"about_ca_topic_score_codex":0.0055464176,"about_ca_topic_score_gemma":0.0036591075,"teacher_disagreement_score":0.0055464176,"about_ca_system_score_codex":0.00031447873,"about_ca_system_score_gemma":0.00066096004,"threshold_uncertainty_score":0.01102829},"labels":[],"label_agreement":null},{"id":"W145128891","doi":"10.1007/3-540-45470-5_10","title":"The Wright ω Function","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Dynamics and Biomechanics","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":"Western University","funders":"","keywords":"Wright; Computer science; Classification of discontinuities; Function (biology); Computation; Context (archaeology); Algorithm; Point (geometry); Theoretical computer science; Mathematics; Programming language; Mathematical analysis","score_opus":0.007090419409387252,"score_gpt":0.1761479210541029,"score_spread":0.16905750164471564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145128891","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028903797,0.012682642,0.39112973,0.0045743156,0.002661125,0.000035309025,0.0004098957,0.00032458088,0.55927855],"genre_scores_gemma":[0.49047032,0.012499335,0.075870946,0.0017395106,0.00331024,0.00014741292,0.00073493924,0.0006921777,0.41453505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973327,0.00007606533,0.000015172799,0.000078093384,0.00006812927,0.000029273153],"domain_scores_gemma":[0.99962854,0.00013862723,0.000032583088,0.00007464961,0.00008026175,0.00004527378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045418236,0.0007048492,0.0005274382,0.0014785511,0.00095940864,0.002008116,0.00056643796,0.0009817979,0.017202599],"category_scores_gemma":[0.0026617872,0.00030779178,0.00057257793,0.0012015788,0.0019171203,0.0026648955,0.001572701,0.0023008708,0.0051464983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056915123,0.00000360827,0.0000633843,0.000015693053,0.0000041111884,0.000017744138,0.000046405235,0.00044751438,0.00021898313,0.9646886,0.0065214536,0.02796682],"study_design_scores_gemma":[0.0000031724787,0.000005687076,0.000128327,0.00001639917,0.0000035665294,0.000066157765,0.000027430928,0.001863846,0.00015370805,0.9494521,0.04827342,0.0000060159105],"about_ca_topic_score_codex":0.0006792607,"about_ca_topic_score_gemma":0.00042471875,"teacher_disagreement_score":0.017202599,"about_ca_system_score_codex":0.00073371094,"about_ca_system_score_gemma":0.00040868233,"threshold_uncertainty_score":0.057548404},"labels":[],"label_agreement":null},{"id":"W145340245","doi":"10.1007/978-3-642-39065-4_78","title":"Invariant Object Recognition Using Radon and Fourier Transforms","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Invariant (physics); Fourier transform; Zernike polynomials; Artificial intelligence; Computer science; Wavelet; Radon transform; Pattern recognition (psychology); Wavelet transform; Velocity Moments; Centroid; Normalization (sociology); Complex wavelet transform; Cognitive neuroscience of visual object recognition; Algorithm; Harmonic wavelet transform; Scaling; Computer vision; Mathematics; Discrete wavelet transform; Feature extraction; Physics; Geometry; Optics; Mathematical analysis","score_opus":0.033196870657470026,"score_gpt":0.2487355301618033,"score_spread":0.21553865950433326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145340245","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.0073885494,0.0020228124,0.984269,0.00008321687,0.00009816675,0.000015167381,0.000060921797,0.00089216157,0.005170035],"genre_scores_gemma":[0.15752523,0.0049785213,0.81647676,0.00014115094,0.00017286408,0.000056054,0.0007473111,0.00038562788,0.019516503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.000043205146,0.000022739583,0.00008203322,0.00020864379,0.000039974846],"domain_scores_gemma":[0.9997458,0.00007145418,0.000029686258,0.00008155034,0.00006105403,0.000010474001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554247,0.0005786623,0.00088647235,0.0011502891,0.00016599715,0.0013371349,0.0008289033,0.0007430394,0.0032638377],"category_scores_gemma":[0.000899794,0.00042469386,0.00089183304,0.0012275039,0.0006580731,0.0021197884,0.000700083,0.0007536985,0.003013588],"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.00008232247,0.00004873813,0.00040594916,0.00022620239,0.000045795456,0.0001550788,0.000075242,0.010378403,0.11354204,0.05344777,0.0051657725,0.8164267],"study_design_scores_gemma":[0.000037361802,0.00026096986,0.0042172843,0.000122444,0.0001703235,0.0042412276,0.0002567752,0.5046806,0.2754567,0.11943166,0.0909365,0.00018824634],"about_ca_topic_score_codex":0.0004149875,"about_ca_topic_score_gemma":0.0004864499,"teacher_disagreement_score":0.0032638377,"about_ca_system_score_codex":0.0002373271,"about_ca_system_score_gemma":0.00025791442,"threshold_uncertainty_score":0.010918617},"labels":[],"label_agreement":null},{"id":"W1454351128","doi":"10.1007/978-3-319-21067-4_40","title":"The Virtual Meditative Walk: An Immersive Virtual Environment for Pain Self-modulation Through Mindfulness-Based Stress Reduction Meditation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mindfulness and Compassion Interventions","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"Meditation; Stress reduction; Computer science; Mindfulness-based stress reduction; Mindfulness meditation; Mindfulness; Virtual reality; Stress (linguistics); Modulation (music); Human–computer interaction; Psychotherapist; Psychology; Aesthetics","score_opus":0.03500545654964803,"score_gpt":0.32033318470640404,"score_spread":0.285327728156756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1454351128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28544506,0.04236716,0.48639137,0.0032613964,0.0037690396,0.00075297046,0.0015379704,0.006024724,0.17045034],"genre_scores_gemma":[0.5508262,0.027436968,0.22598471,0.002556997,0.00093990477,0.00092501746,0.00121301,0.0011991496,0.1889181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999453,0.000011625563,0.000001936478,0.000009838205,0.000021494847,0.000009910196],"domain_scores_gemma":[0.9999585,0.000020385913,0.000002120389,0.000004579996,0.0000030162882,0.000011337448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011942159,0.0004343139,0.00016352207,0.00018665561,0.00018608199,0.00054809067,0.00059998716,0.00041016508,0.011126304],"category_scores_gemma":[0.00018347589,0.00016172859,0.00038196074,0.00011574262,0.00026655514,0.00055293355,0.0011022341,0.00083518896,0.0012073899],"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.0005748118,0.000593351,0.0005878995,0.0010518447,0.000104066705,0.00044913602,0.0015834771,0.0011635018,0.12529646,0.008282557,0.032283746,0.82802916],"study_design_scores_gemma":[0.00052645605,0.005842955,0.034166723,0.0015025103,0.00044025155,0.013392073,0.002262018,0.01503907,0.10291327,0.02055922,0.8030403,0.00031509498],"about_ca_topic_score_codex":0.00011824258,"about_ca_topic_score_gemma":0.00046561036,"teacher_disagreement_score":0.011126304,"about_ca_system_score_codex":0.000044922595,"about_ca_system_score_gemma":0.00014338436,"threshold_uncertainty_score":0.037221193},"labels":[],"label_agreement":null},{"id":"W145440896","doi":"10.1007/978-3-642-21043-3_24","title":"Simulating the Effect of Emotional Stress on Task Performance Using OCC","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Decision Making","field":"Decision Sciences","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 Windsor","funders":"","keywords":"Computer science; Task (project management); Emotional stress; Stress (linguistics); Human–computer interaction; Artificial intelligence; Cognitive psychology; Psychology","score_opus":0.1029975470091443,"score_gpt":0.35390812396652094,"score_spread":0.2509105769573766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145440896","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.98443526,0.000046812616,0.012203444,0.00009588229,0.00005906788,0.000047424182,0.00023134965,0.00015368352,0.002727073],"genre_scores_gemma":[0.99551904,0.000028222456,0.003543564,0.00002666809,0.0000054075654,0.000039354814,0.00008860765,0.000023482608,0.00072555366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999806,0.000058448386,0.000010436163,0.000031221178,0.000034192766,0.00005964911],"domain_scores_gemma":[0.9971614,0.0022176176,0.00013767242,0.00018017604,0.0001533011,0.00014983531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040036257,0.00050647755,0.00030898605,0.00026248346,0.00019527676,0.00072525383,0.0007753718,0.000601311,0.004409483],"category_scores_gemma":[0.00390805,0.00024294222,0.00028602252,0.0003782809,0.00035381652,0.00030436568,0.00046644776,0.00069185434,0.00034873487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036275527,0.0014372014,0.014093754,0.00026654452,0.00010963143,0.00025737786,0.0005353509,0.91269934,0.03736533,0.002929237,0.001472429,0.025206232],"study_design_scores_gemma":[0.0001423868,0.0006278058,0.0067928713,0.000013988769,0.000051023624,0.000027063836,0.000077831726,0.9834632,0.006956136,0.0014901665,0.00033177793,0.000025755724],"about_ca_topic_score_codex":0.011106009,"about_ca_topic_score_gemma":0.0059015416,"teacher_disagreement_score":0.011106009,"about_ca_system_score_codex":0.0005273588,"about_ca_system_score_gemma":0.0005618337,"threshold_uncertainty_score":0.022082746},"labels":[],"label_agreement":null},{"id":"W145643130","doi":"10.1007/978-3-642-39454-6_12","title":"Improving Tool Support for Software Reverse Engineering in a Security Context","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Defence Research and Development Canada; University of Victoria","funders":"","keywords":"Computer science; Reverse engineering; Software engineering; Context (archaeology); Software; Operating system","score_opus":0.014965923407083642,"score_gpt":0.22937143873307758,"score_spread":0.21440551532599395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145643130","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.030978605,0.00057617034,0.92946374,0.00037042695,0.00010460909,0.00018805606,0.00015871137,0.033526275,0.0046335487],"genre_scores_gemma":[0.194572,0.00046533355,0.79429924,0.0002840366,0.00004700101,0.00011293337,0.0008656469,0.005108331,0.004245453],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925403,0.0019327725,0.0008305461,0.0009978279,0.0029356503,0.0007629752],"domain_scores_gemma":[0.97114146,0.011840997,0.0012400663,0.012041812,0.003352625,0.00038297806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046808473,0.0021296407,0.0010611877,0.0016982759,0.0006775609,0.0034996702,0.004183827,0.0022414897,0.007059205],"category_scores_gemma":[0.0285262,0.0014565055,0.0018006653,0.0014603601,0.0007994442,0.00797409,0.004554498,0.0048447866,0.0042047626],"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.000557711,0.00091686065,0.005233971,0.0010387198,0.00018403558,0.00088825444,0.0012375393,0.024722215,0.09130659,0.029653369,0.012451408,0.8318093],"study_design_scores_gemma":[0.00030078486,0.0007635821,0.002655606,0.000853828,0.0006096761,0.0020461741,0.0007239841,0.5302035,0.26989192,0.07701969,0.1146441,0.000287101],"about_ca_topic_score_codex":0.0011907121,"about_ca_topic_score_gemma":0.0019628513,"teacher_disagreement_score":0.007059205,"about_ca_system_score_codex":0.00049398857,"about_ca_system_score_gemma":0.0018860499,"threshold_uncertainty_score":0.024754941},"labels":[],"label_agreement":null},{"id":"W1456495627","doi":"10.1007/978-3-642-39088-3_7","title":"O wl O nt DB: A Scalable Reasoning System for OWL 2 RL Ontologies with Large ABoxes","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Web Ontology Language; Description logic; Programming language; Artificial intelligence; Semantic Web; Operating system","score_opus":0.01550865213918312,"score_gpt":0.2349184214109875,"score_spread":0.2194097692718044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1456495627","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.005539305,0.0004963734,0.7681757,0.00037836644,0.00027881385,0.0004251525,0.00962166,0.20137064,0.0137139205],"genre_scores_gemma":[0.064843126,0.00090252416,0.85153747,0.00083007955,0.000104947154,0.00047407325,0.041608647,0.0198876,0.019811485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987619,0.0001267601,0.00015686944,0.00033903873,0.00051730126,0.00009810574],"domain_scores_gemma":[0.9986349,0.00036013388,0.00008492406,0.0005083654,0.0002707037,0.00014100934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844732,0.0017098353,0.0014009138,0.002594759,0.0013112762,0.0049663107,0.0037038624,0.0012592317,0.022368431],"category_scores_gemma":[0.0049339593,0.0018087133,0.0021346218,0.0021513219,0.0008660318,0.008039418,0.0043357154,0.0025127635,0.010838046],"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.0011602595,0.0006723067,0.0026858973,0.0017620962,0.00050921587,0.0009061372,0.0008593326,0.012108843,0.030879669,0.060033437,0.32278535,0.56563747],"study_design_scores_gemma":[0.00048636823,0.000112716254,0.0018654519,0.00039732995,0.0004899651,0.00072777754,0.000589772,0.3691656,0.048895314,0.12885821,0.44812012,0.00029146712],"about_ca_topic_score_codex":0.022493003,"about_ca_topic_score_gemma":0.030413888,"teacher_disagreement_score":0.022493003,"about_ca_system_score_codex":0.0012559635,"about_ca_system_score_gemma":0.0034216307,"threshold_uncertainty_score":0.07482988},"labels":[],"label_agreement":null},{"id":"W1457497571","doi":"10.1007/978-3-642-29860-8_3","title":"Runtime Monitoring of Time-Sensitive Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Focus (optics); Schedule; Real-time computing; System monitoring; Distributed computing; Operating system","score_opus":0.01675899281114851,"score_gpt":0.23733792132133572,"score_spread":0.2205789285101872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1457497571","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.12798022,0.007305643,0.8322558,0.00043365336,0.00035937998,0.000091679525,0.00024005712,0.010706755,0.020626822],"genre_scores_gemma":[0.8632237,0.0023158512,0.121664256,0.000108200846,0.00030127983,0.000068308094,0.00035475966,0.0007367048,0.0112269595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.00017505306,0.000042906988,0.00015786728,0.00039801086,0.00009100864],"domain_scores_gemma":[0.99860317,0.00065442163,0.00014871352,0.0003765444,0.00013824645,0.00007899448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973356,0.0006286423,0.0005300779,0.0006936319,0.00030288994,0.001164469,0.0012841821,0.0003846364,0.0018580873],"category_scores_gemma":[0.0024292816,0.00036724418,0.00021370818,0.0006373798,0.0004665791,0.0012163185,0.00068499474,0.0010639537,0.0004175621],"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.00093237177,0.00021383673,0.0021451209,0.0004927275,0.00006476487,0.000379945,0.0008406361,0.08025731,0.12219463,0.08345645,0.012553766,0.6964684],"study_design_scores_gemma":[0.00006197768,0.00028037094,0.0032240045,0.00015443134,0.000093773786,0.00063251663,0.00009480346,0.77965146,0.11256973,0.063978024,0.039206594,0.00005223978],"about_ca_topic_score_codex":0.0005049796,"about_ca_topic_score_gemma":0.0005791103,"teacher_disagreement_score":0.0018580873,"about_ca_system_score_codex":0.00049071986,"about_ca_system_score_gemma":0.000389753,"threshold_uncertainty_score":0.00621593},"labels":[],"label_agreement":null},{"id":"W145753722","doi":"10.1007/978-3-642-33509-9_44","title":"Robust Attitude Control Design for Spacecraft under Assigned Velocity and Control Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Spacecraft; Lyapunov function; Computer science; Robust control; Angular velocity; Residual; Controller (irrigation); Attitude control; Torque; Nonlinear system; Control (management); Control system; Control engineering; Engineering; Algorithm; Physics; Artificial intelligence","score_opus":0.03648923017268195,"score_gpt":0.2336138086011111,"score_spread":0.19712457842842918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145753722","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.0066934675,0.00021821228,0.98906076,0.00006251076,0.000060345308,0.000022016055,0.000024414005,0.00020584521,0.0036523857],"genre_scores_gemma":[0.8242654,0.0006761937,0.16239995,0.00014509523,0.00019873765,0.0003474893,0.00023959743,0.00017950735,0.011547896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996686,0.000069123875,0.00001757947,0.0000744017,0.0001291314,0.000041009604],"domain_scores_gemma":[0.9997106,0.00009562576,0.000060493185,0.000033158944,0.00008680186,0.000013227178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060651894,0.0010304992,0.00097534806,0.00034094104,0.00027547497,0.0009307239,0.0011506436,0.0010966496,0.002470151],"category_scores_gemma":[0.0013349417,0.00051244174,0.0006149673,0.00039678242,0.00056022493,0.00068529806,0.0010225597,0.0009129446,0.00062912056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013027666,0.000035906054,0.00010396749,0.00026617912,0.000070653165,0.00011124508,0.00011817812,0.8844164,0.015372677,0.0289189,0.0018291124,0.06862656],"study_design_scores_gemma":[0.000018182716,0.0001178335,0.0000847837,0.000010260252,0.000009638081,0.000020219759,0.000010768209,0.99081004,0.0013265653,0.0063908747,0.0011927957,0.000008080058],"about_ca_topic_score_codex":0.0017010212,"about_ca_topic_score_gemma":0.0011674444,"teacher_disagreement_score":0.002470151,"about_ca_system_score_codex":0.00035260615,"about_ca_system_score_gemma":0.00055088906,"threshold_uncertainty_score":0.008263528},"labels":[],"label_agreement":null},{"id":"W1458239765","doi":"10.1007/978-3-642-38812-5_8","title":"Fast Parameter Learning for Markov Logic Networks Using Bayes Nets","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Statistical relational learning; Computer science; Bayesian network; Bayes' theorem; Markov chain; Artificial intelligence; Propositional calculus; Bayesian programming; Theoretical computer science; Relational database; Machine learning; Algorithm; Data mining; Bayes factor; Bayesian probability; Programming language","score_opus":0.03598688078910719,"score_gpt":0.26549368813356716,"score_spread":0.22950680734445997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1458239765","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.0025309008,0.00052407506,0.9951219,0.0001336689,0.000034130666,0.000036491016,0.00012480587,0.0007138533,0.000780149],"genre_scores_gemma":[0.18491724,0.0014616799,0.80519664,0.00027976482,0.00020532805,0.00041885037,0.0014828605,0.0005657595,0.005471828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978515,0.0009745999,0.00015248128,0.00038097022,0.00048341026,0.00015702356],"domain_scores_gemma":[0.9828114,0.0150962025,0.00046273455,0.00070321735,0.0007217311,0.00020461794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004507064,0.0017083812,0.0028502187,0.0023077258,0.0010469811,0.0029015848,0.0029605464,0.0022003707,0.009839941],"category_scores_gemma":[0.021653835,0.0020713608,0.0018722605,0.002026957,0.0012673234,0.006021783,0.0027308306,0.0049079945,0.002411317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003514049,0.0000989785,0.00089721417,0.00032058588,0.00015490247,0.00009632516,0.00012091887,0.60330576,0.001100568,0.096059024,0.0051472746,0.29234707],"study_design_scores_gemma":[0.000015339256,0.0000094817915,0.000053762393,0.000024170524,0.000013344985,0.000014136091,0.000007878341,0.9006428,0.00024641756,0.09844495,0.00051762833,0.000010010824],"about_ca_topic_score_codex":0.0100815315,"about_ca_topic_score_gemma":0.0137595935,"teacher_disagreement_score":0.0100815315,"about_ca_system_score_codex":0.002571335,"about_ca_system_score_gemma":0.002208036,"threshold_uncertainty_score":0.032917917},"labels":[],"label_agreement":null},{"id":"W1460233930","doi":"10.1007/978-3-642-28509-7_15","title":"Understanding Student Attention to Adaptive Hints with Eye-Tracking","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 British Columbia","funders":"","keywords":"Computer science; Eye tracking; Prime (order theory); Tracking (education); Climb; Process (computing); Human–computer interaction; Term (time); Prime time; Artificial intelligence; Multimedia; Programming language; Psychology; Pedagogy","score_opus":0.07278063889062557,"score_gpt":0.29268798472907925,"score_spread":0.21990734583845367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1460233930","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.8878303,0.0010638757,0.101310164,0.00018325962,0.00007298579,0.00012131335,0.00030537476,0.0010311753,0.008081451],"genre_scores_gemma":[0.9812096,0.0003459207,0.016364066,0.00006278219,0.000018174105,0.00004646571,0.00015194283,0.000055067525,0.001746029],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99979216,0.00005058829,0.00001133979,0.00006116667,0.000052465723,0.000032344225],"domain_scores_gemma":[0.9986895,0.0008671303,0.00014575034,0.000077283345,0.00017254685,0.000047864105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037375768,0.00033525072,0.0002829692,0.0003789441,0.00012159568,0.0008416188,0.00035504493,0.00051154697,0.0016162982],"category_scores_gemma":[0.0044349525,0.0002205826,0.00018022637,0.00030238298,0.00012897354,0.0009150294,0.0005298379,0.00055722904,0.00049531757],"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.0012088093,0.00034432934,0.054958668,0.0003623735,0.00015246756,0.0001692078,0.0027209315,0.0047069537,0.2481351,0.0010151413,0.003672109,0.6825539],"study_design_scores_gemma":[0.00025081637,0.001260751,0.5859388,0.00019736319,0.00055631984,0.00066354085,0.0021193363,0.26604962,0.12960248,0.006104885,0.0071052983,0.00015078785],"about_ca_topic_score_codex":0.0034303195,"about_ca_topic_score_gemma":0.0039696293,"teacher_disagreement_score":0.0034303195,"about_ca_system_score_codex":0.00025356727,"about_ca_system_score_gemma":0.0002641736,"threshold_uncertainty_score":0.0068206787},"labels":[],"label_agreement":null},{"id":"W1460549585","doi":"10.1007/978-3-642-29946-9_13","title":"Regularized Least Squares Temporal Difference Learning with Nested ℓ2 and ℓ1 Penalization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Overfitting; Computer science; Regularization (linguistics); Reinforcement learning; Solver; Mathematical optimization; Algorithm; Artificial intelligence; Applied mathematics; Mathematics; Artificial neural network","score_opus":0.012328453084216541,"score_gpt":0.2322221378745569,"score_spread":0.21989368479034035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1460549585","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.0015510428,0.00007700965,0.9976215,0.00007102722,0.00006216658,0.000016104614,0.000026507996,0.00020555758,0.00036900604],"genre_scores_gemma":[0.107844554,0.00017282362,0.8830202,0.000249422,0.00017575057,0.00028494804,0.0004689333,0.0003701117,0.0074132374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988738,0.00036934382,0.000085207095,0.00027418134,0.0002951644,0.00010222881],"domain_scores_gemma":[0.9973922,0.0012940655,0.00016195385,0.0004200571,0.00060152035,0.00013019836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028256585,0.00093661295,0.0015063974,0.00033088535,0.00043400907,0.0010620529,0.0027958571,0.0024233793,0.0041769887],"category_scores_gemma":[0.007773041,0.00092782377,0.0011421563,0.0006101886,0.0012076688,0.001978695,0.0024849796,0.0032931971,0.0016134738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043112348,0.00017775536,0.0006994676,0.00023835598,0.00015914784,0.00011127393,0.00013603733,0.6529124,0.009341283,0.0607908,0.008280999,0.26672134],"study_design_scores_gemma":[0.000007629552,0.00002090229,0.000034933284,0.0000046630557,0.0000054819916,0.000014882055,0.0000029419423,0.9944766,0.0007863543,0.0039458787,0.0006931516,0.0000066447205],"about_ca_topic_score_codex":0.0029446264,"about_ca_topic_score_gemma":0.003995334,"teacher_disagreement_score":0.0041769887,"about_ca_system_score_codex":0.0007009823,"about_ca_system_score_gemma":0.0018940154,"threshold_uncertainty_score":0.014943719},"labels":[],"label_agreement":null},{"id":"W1463054322","doi":"10.1007/3-540-45579-5_8","title":"Learning from Perfection","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Computer science; Perfection; Field (mathematics); Function (biology); Feature (linguistics); Evaluation function; Artificial intelligence; Data science; Human–computer interaction","score_opus":0.02886589212512101,"score_gpt":0.2626190026771727,"score_spread":0.2337531105520517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1463054322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080884665,0.0021285033,0.70023686,0.009826925,0.00053820526,0.00008443817,0.0007874336,0.001664164,0.20384884],"genre_scores_gemma":[0.89284545,0.0011557401,0.062269807,0.0006928643,0.00023218196,0.00009120863,0.00092798687,0.0002572595,0.041527588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994086,0.00021660264,0.000033851218,0.00017385914,0.00012205891,0.000044983586],"domain_scores_gemma":[0.99710625,0.0019339528,0.00014232221,0.0005353141,0.000192611,0.000089600704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008597194,0.00053689705,0.0006093645,0.00051178696,0.0006018021,0.0015542493,0.00069607573,0.0005991634,0.014982315],"category_scores_gemma":[0.010531784,0.00035715173,0.0006086827,0.0005153148,0.0020312374,0.005563861,0.002009929,0.0022781726,0.0016297392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055577802,0.000029112563,0.00093695335,0.0001059179,0.000038813032,0.000057603036,0.0002497456,0.0085926885,0.00028873188,0.8722214,0.011628314,0.10579517],"study_design_scores_gemma":[0.0000048293728,0.000008245612,0.000102953,0.000014623134,0.0000053666886,0.000021634398,0.000029889741,0.009276146,0.00013678447,0.98708016,0.003316033,0.0000032770388],"about_ca_topic_score_codex":0.00061426056,"about_ca_topic_score_gemma":0.00096380437,"teacher_disagreement_score":0.014982315,"about_ca_system_score_codex":0.00053478946,"about_ca_system_score_gemma":0.0005359698,"threshold_uncertainty_score":0.05012083},"labels":[],"label_agreement":null},{"id":"W146411806","doi":"10.1007/978-3-642-30057-8_27","title":"Efficient Password Authenticated Key Exchange via Oblivious Transfer","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Authenticated Key Exchange; Password; Oblivious transfer; Key exchange; Key (lock); Computer security; Transfer (computing); Theoretical computer science; Public-key cryptography; Cryptography; Encryption; Parallel computing","score_opus":0.018553381033603697,"score_gpt":0.25606563304386504,"score_spread":0.23751225201026133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146411806","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.013489867,0.00023477165,0.9669494,0.00027359228,0.00012185475,0.0002083577,0.00016227455,0.0023891325,0.016170738],"genre_scores_gemma":[0.6327867,0.0004395594,0.31185257,0.00027551557,0.00015089147,0.0005566056,0.0006392259,0.0006062921,0.052692566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997436,0.0006627117,0.00018288809,0.0002658809,0.0010183997,0.00043421608],"domain_scores_gemma":[0.9975204,0.00065961777,0.00013699969,0.0014035054,0.00021165084,0.00006784006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011534189,0.0007617863,0.0011853487,0.0009223418,0.001037859,0.0023336012,0.0018230355,0.0014422135,0.014118902],"category_scores_gemma":[0.0040872507,0.00074265397,0.00064866623,0.001267286,0.0013915382,0.0059476034,0.0055796634,0.0018694709,0.008413431],"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.0013722118,0.00033060956,0.0003554323,0.00047269306,0.00009956749,0.00057331054,0.0005788889,0.021510057,0.05277876,0.51672685,0.018759305,0.38644227],"study_design_scores_gemma":[0.0003714976,0.00043069577,0.0005522059,0.0001362182,0.00014108488,0.0015246797,0.00015364007,0.28506857,0.13156778,0.5253288,0.054562863,0.0001618997],"about_ca_topic_score_codex":0.00016595902,"about_ca_topic_score_gemma":0.00022741883,"teacher_disagreement_score":0.014118902,"about_ca_system_score_codex":0.0006000664,"about_ca_system_score_gemma":0.0010678637,"threshold_uncertainty_score":0.04723245},"labels":[],"label_agreement":null},{"id":"W146436045","doi":"10.1007/978-3-642-45046-4_2","title":"Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":33,"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":"Engineering and Physical Sciences Research Council","keywords":"Nash equilibrium; Conjecture; Combinatorics; Mathematics; Stochastic game; Cardinality (data modeling); Best response; Mathematical economics; Bipartite graph; Epsilon-equilibrium; Correctness; Discrete mathematics; Risk dominance; Graph; Computer science; Algorithm","score_opus":0.05271743398532542,"score_gpt":0.3217263007987142,"score_spread":0.2690088668133888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146436045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27989244,0.0013766623,0.56621855,0.007021908,0.0007905431,0.00029029488,0.0024154645,0.0022362107,0.13975787],"genre_scores_gemma":[0.9083808,0.0007750683,0.06897492,0.001381654,0.00056091277,0.0005948548,0.0010388354,0.00082118856,0.017471738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967489,0.0005308563,0.00024541904,0.0006195556,0.0012089271,0.00064646656],"domain_scores_gemma":[0.9551484,0.032918315,0.0020832494,0.005342704,0.0027303568,0.0017769923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00345662,0.0015287355,0.002428838,0.0017156957,0.0024949873,0.005985426,0.0033721863,0.0032939482,0.024954356],"category_scores_gemma":[0.052982934,0.0013100293,0.0020435262,0.0019229183,0.0039315624,0.012979761,0.005813141,0.009671093,0.006455609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010700468,0.00020679855,0.0018813013,0.00044004197,0.000079577156,0.00071368256,0.0006570199,0.017824301,0.007665556,0.933397,0.0076286686,0.028435983],"study_design_scores_gemma":[0.000066145934,0.0000636425,0.00040159785,0.000055475306,0.000027310292,0.00038770953,0.0001792019,0.041803513,0.0033578817,0.95082617,0.0027955913,0.000035728237],"about_ca_topic_score_codex":0.00084339175,"about_ca_topic_score_gemma":0.0009205614,"teacher_disagreement_score":0.024954356,"about_ca_system_score_codex":0.0014631567,"about_ca_system_score_gemma":0.0016138202,"threshold_uncertainty_score":0.0834806},"labels":[],"label_agreement":null},{"id":"W146486917","doi":"10.1007/978-3-642-31537-4_2","title":"Transductive Relational Classification in the Co-training Paradigm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Schema (genetic algorithms); Relational database; Artificial intelligence; Machine learning; Construct (python library); Training set; Statistical relational learning; Independence (probability theory); Labeled data; Data mining","score_opus":0.28507347646492137,"score_gpt":0.3941394393181918,"score_spread":0.10906596285327042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146486917","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.005532611,0.0015012727,0.9855598,0.0008838228,0.00009706928,0.000044629192,0.00013318809,0.0003665198,0.0058810683],"genre_scores_gemma":[0.3987727,0.002933049,0.5757971,0.00090335734,0.00081466086,0.0003298708,0.0013515225,0.00035546784,0.018742334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966934,0.0017763241,0.00016047621,0.00056348357,0.0006734429,0.00013280114],"domain_scores_gemma":[0.9929516,0.0051430315,0.00015930104,0.0011649618,0.00047352133,0.00010763573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874291,0.00077325746,0.0012821608,0.0010639947,0.0005220519,0.0027522945,0.0024405804,0.0016198063,0.0044501475],"category_scores_gemma":[0.009012274,0.0005138431,0.0010122957,0.002446863,0.0017043808,0.0056488225,0.0026784407,0.0043824594,0.001945277],"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.00016056934,0.00024517512,0.0011650778,0.0004181906,0.00016910452,0.00018303507,0.000383849,0.08750002,0.0031045103,0.36353597,0.015683223,0.52745134],"study_design_scores_gemma":[0.000009630446,0.00005943535,0.0003025474,0.00005734591,0.000037004123,0.00019491483,0.000060038652,0.6025422,0.0021839296,0.3863875,0.008140881,0.000024572182],"about_ca_topic_score_codex":0.0010637722,"about_ca_topic_score_gemma":0.0013781938,"teacher_disagreement_score":0.004874291,"about_ca_system_score_codex":0.0007149728,"about_ca_system_score_gemma":0.0007087867,"threshold_uncertainty_score":0.025777996},"labels":[],"label_agreement":null},{"id":"W1464907011","doi":"10.1007/978-3-642-24396-7_21","title":"Refactoring ActionScript for Improving Application Execution Time","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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":"ActionScript; Code refactoring; Computer science; Flash (photography); Programming language; Key (lock); Code (set theory); Software engineering; Rewriting; Software; Operating system","score_opus":0.08779548234686724,"score_gpt":0.32820341271704523,"score_spread":0.240407930370178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1464907011","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.034908973,0.0005784496,0.8727057,0.00031045347,0.0004918479,0.00017012404,0.00066499977,0.08548084,0.004688618],"genre_scores_gemma":[0.16252637,0.00036741784,0.8096943,0.00045151208,0.00012418075,0.0001712459,0.0019449403,0.011002928,0.013717093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984957,0.00028378866,0.00014290272,0.00026917196,0.00066665944,0.00014167007],"domain_scores_gemma":[0.9953021,0.0019397952,0.000253778,0.0012804511,0.0011039932,0.00011985647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013837861,0.0017049165,0.00066381023,0.00089947815,0.0003725031,0.000880462,0.0019301783,0.000986339,0.009852103],"category_scores_gemma":[0.006080072,0.00055593357,0.0008970743,0.0009928354,0.0004193186,0.0015886403,0.0009027352,0.0018158548,0.0034330396],"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.0006307477,0.00027128277,0.0013178441,0.00048492147,0.00005405049,0.0003304538,0.0002708428,0.0106869135,0.111520536,0.0068497453,0.022007188,0.8455755],"study_design_scores_gemma":[0.00030431905,0.00062263675,0.0020129979,0.0002395684,0.00043468855,0.0007524614,0.00015435809,0.44036448,0.46353257,0.019603856,0.07182483,0.00015332126],"about_ca_topic_score_codex":0.0023532575,"about_ca_topic_score_gemma":0.0038480142,"teacher_disagreement_score":0.009852103,"about_ca_system_score_codex":0.00040244532,"about_ca_system_score_gemma":0.0013062068,"threshold_uncertainty_score":0.032958567},"labels":[],"label_agreement":null},{"id":"W146656220","doi":"10.1007/978-3-642-41299-8_14","title":"Formulating Game Strategies in Game-Theoretic Rough Sets","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Rough set; Probabilistic logic; Computer science; Realization (probability); Game theory; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Mathematical economics","score_opus":0.018238061722048303,"score_gpt":0.24958459731558766,"score_spread":0.23134653559353935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146656220","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.011801624,0.00037899986,0.971455,0.0004924279,0.00009123545,0.00008826961,0.0000903296,0.0001321104,0.015469957],"genre_scores_gemma":[0.49484503,0.0010973031,0.49362907,0.00027556287,0.00024443615,0.000523091,0.00036269962,0.000121406345,0.00890129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965982,0.0015760307,0.0002570999,0.00032127684,0.0009240625,0.00032339082],"domain_scores_gemma":[0.99549425,0.0034145247,0.00020224525,0.0003544718,0.0003893508,0.00014518041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031253996,0.0015416272,0.001815427,0.0013925391,0.0009159994,0.0053269505,0.0027055587,0.0015325928,0.0043301038],"category_scores_gemma":[0.01109646,0.00094388134,0.0028960262,0.0021064037,0.0036777381,0.006379579,0.002518647,0.0049365168,0.00075644185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013758499,0.000029605177,0.00008497105,0.000069357644,0.000026697502,0.000041569463,0.00023790348,0.034043133,0.00030396297,0.94977945,0.00069377915,0.014675914],"study_design_scores_gemma":[0.000009875775,0.000015174173,0.000026498297,0.000024263989,0.00001613732,0.000013623748,0.000041563893,0.087092385,0.00015362805,0.91135234,0.0012428489,0.000011679911],"about_ca_topic_score_codex":0.0031699892,"about_ca_topic_score_gemma":0.003474699,"teacher_disagreement_score":0.0053269505,"about_ca_system_score_codex":0.0027240096,"about_ca_system_score_gemma":0.0017309719,"threshold_uncertainty_score":0.019764125},"labels":[],"label_agreement":null},{"id":"W1467237292","doi":"10.1007/978-3-662-47989-6_11","title":"Reproducible Circularly-Secure Bit Encryption: Applications and Realizations","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Probabilistic encryption; Computer science; 40-bit encryption; 56-bit encryption; Theoretical computer science; Deterministic encryption; Multiple encryption; Plaintext-aware encryption; Cryptographic primitive; Cryptography; Algorithm; Computer security; Cryptographic protocol","score_opus":0.027452252509168322,"score_gpt":0.26233597664488306,"score_spread":0.23488372413571473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1467237292","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.06312935,0.0038919135,0.81425947,0.001503969,0.0006615962,0.00017495606,0.00043309142,0.00056940364,0.1153761],"genre_scores_gemma":[0.78039056,0.0052149296,0.16908613,0.0005102854,0.0009014002,0.00031787727,0.00045762584,0.00047959734,0.042641584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988243,0.0002212179,0.0000919765,0.00018370888,0.0005216174,0.00015725281],"domain_scores_gemma":[0.99848527,0.0004944715,0.0001466879,0.00057525194,0.00023306913,0.00006529056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012559216,0.0010767262,0.0010574093,0.00094594073,0.001271407,0.0034071107,0.0012356514,0.0020669114,0.005256495],"category_scores_gemma":[0.0032236576,0.0006985888,0.0010882128,0.0016475439,0.0027932993,0.0039361906,0.00226104,0.0030340566,0.002484748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045548837,0.0000195588,0.000039284503,0.000057650283,0.0000050567364,0.000048577665,0.000052731357,0.002710521,0.0030241075,0.985631,0.0008320727,0.00753407],"study_design_scores_gemma":[0.000028730363,0.000048659876,0.00007014852,0.000034356177,0.000011101468,0.00021024606,0.000022105147,0.033160124,0.008787217,0.95178896,0.005803876,0.000034530007],"about_ca_topic_score_codex":0.00019842281,"about_ca_topic_score_gemma":0.00017051976,"teacher_disagreement_score":0.005256495,"about_ca_system_score_codex":0.0012648224,"about_ca_system_score_gemma":0.00087886106,"threshold_uncertainty_score":0.017584741},"labels":[],"label_agreement":null},{"id":"W146732357","doi":"10.1007/978-3-319-16706-0_20","title":"Deep Feature Selection: Theory and Application to Identify Enhancers and Promoters","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Chromatin Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Feature selection; Linear model; Artificial neural network; Regularization (linguistics); Feature (linguistics); Pattern recognition (psychology); Machine learning","score_opus":0.00514727866085998,"score_gpt":0.24665864015087652,"score_spread":0.24151136149001654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146732357","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.008218443,0.0009889868,0.9889465,0.00025948638,0.000055762135,0.000012874713,0.00010164142,0.0004438649,0.00097254466],"genre_scores_gemma":[0.37477025,0.0018489561,0.6119356,0.000435073,0.00027951892,0.00015542436,0.00080496684,0.00029549995,0.0094746435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997451,0.00006459937,0.000015965908,0.00007034419,0.00007215837,0.00003187299],"domain_scores_gemma":[0.99892634,0.0007831353,0.00004051031,0.00007924381,0.0001387676,0.000032066957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254944,0.0007620339,0.0009105326,0.0007775871,0.00029222216,0.0008978281,0.0011886741,0.00087457476,0.0017572949],"category_scores_gemma":[0.0025441765,0.0004533071,0.0007163761,0.0011819736,0.00060312194,0.0010273904,0.0010184505,0.0013249555,0.0004583476],"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.00009982561,0.00008172961,0.0019127058,0.00016161165,0.00010712503,0.000097420765,0.00007933436,0.17344685,0.009112699,0.037759006,0.00973473,0.76740694],"study_design_scores_gemma":[0.000012563112,0.000027641654,0.00060106465,0.000016505996,0.00002827358,0.000055384655,0.000010994357,0.93405,0.0035747567,0.059776727,0.0018342838,0.0000118052385],"about_ca_topic_score_codex":0.0019968553,"about_ca_topic_score_gemma":0.0028105406,"teacher_disagreement_score":0.0019968553,"about_ca_system_score_codex":0.0005820345,"about_ca_system_score_gemma":0.00053723436,"threshold_uncertainty_score":0.006636858},"labels":[],"label_agreement":null},{"id":"W1467915258","doi":"10.1007/978-3-642-27890-7_21","title":"Exploiting Routing Tree Construction in CTP","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Routing protocol; Routing (electronic design automation); Wireless sensor network; Node (physics); Exploit; Tree (set theory); Distributed computing; Real-time computing; Computer security","score_opus":0.01696403828797219,"score_gpt":0.2234322881767132,"score_spread":0.20646824988874102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1467915258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014892937,0.00052342576,0.96595466,0.00033561062,0.0001549251,0.00013130052,0.0002114901,0.0011600561,0.01663554],"genre_scores_gemma":[0.25684655,0.0011247544,0.7314623,0.00015448694,0.00013472394,0.00024399029,0.00085830706,0.00042895527,0.00874592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994147,0.000159688,0.000037925503,0.00008641989,0.00022939131,0.00007193626],"domain_scores_gemma":[0.99840933,0.00071896357,0.00008610577,0.00052844256,0.00019633675,0.000060912615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007314351,0.0005733324,0.0005736858,0.00091714255,0.0006268274,0.0012734157,0.0014240844,0.00082074787,0.0048799147],"category_scores_gemma":[0.0036031562,0.0004530987,0.0006756223,0.0019761766,0.0006553284,0.0018829608,0.0018860373,0.0014782689,0.0010166019],"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.0001762673,0.0001349308,0.00086602423,0.0005348717,0.000057695557,0.00029933738,0.00018361877,0.22216368,0.021528287,0.30626222,0.017440414,0.43035272],"study_design_scores_gemma":[0.000032151176,0.000068362766,0.00031666245,0.00008529819,0.000045435827,0.0003794116,0.00006322571,0.79574186,0.009973958,0.1694289,0.02383955,0.000025186362],"about_ca_topic_score_codex":0.0016941436,"about_ca_topic_score_gemma":0.0022803599,"teacher_disagreement_score":0.0048799147,"about_ca_system_score_codex":0.00077785837,"about_ca_system_score_gemma":0.0010113881,"threshold_uncertainty_score":0.016324937},"labels":[],"label_agreement":null},{"id":"W147064299","doi":"10.1007/978-3-642-37804-1_43","title":"Detection of SOA Antipatterns","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Service-oriented architecture; OASIS SOA Reference Model; Quality of service; Architecture; Software engineering; Distributed computing; Service oriented; Computer architecture; Web service; Computer network; Programming language","score_opus":0.010583471933619188,"score_gpt":0.22189051635484658,"score_spread":0.21130704442122739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147064299","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.72164494,0.0007947338,0.25913212,0.00036994452,0.00023021718,0.0002482466,0.0014937156,0.0060744896,0.010011644],"genre_scores_gemma":[0.91802543,0.00034651576,0.07640047,0.000104033425,0.0000547926,0.00008807119,0.0019302404,0.00025345653,0.0027968993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986185,0.00012575103,0.000104549144,0.00029592062,0.00064956455,0.00020579892],"domain_scores_gemma":[0.99331117,0.0022547462,0.0010961369,0.00083937397,0.0022313218,0.00026718478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000749639,0.000611033,0.00067929405,0.0029801542,0.00056172925,0.0009865932,0.0006416594,0.0006495007,0.0017777602],"category_scores_gemma":[0.0051949145,0.0003512398,0.0005377229,0.0018144716,0.00033483133,0.0009187554,0.0008648171,0.0006222649,0.000788252],"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.0013903091,0.00057018216,0.18338344,0.00085564086,0.00024238753,0.003182481,0.00078624085,0.010997063,0.26121306,0.0125326915,0.007467706,0.5173788],"study_design_scores_gemma":[0.00009363967,0.000590718,0.091674,0.0001594392,0.000317394,0.005161612,0.0009652569,0.65893996,0.19886598,0.019017588,0.02412145,0.00009303066],"about_ca_topic_score_codex":0.0024829877,"about_ca_topic_score_gemma":0.0042135725,"teacher_disagreement_score":0.0029801542,"about_ca_system_score_codex":0.0003844269,"about_ca_system_score_gemma":0.0011430782,"threshold_uncertainty_score":0.0059472322},"labels":[],"label_agreement":null},{"id":"W1470776573","doi":"10.1007/978-3-642-35632-2_20","title":"MapReduce for Parallel Trace Validation of LTL Properties","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":40,"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":"Computer science; TRACE (psycholinguistics); Cloud computing; Process (computing); Linear temporal logic; Algorithm; Temporal logic; Event (particle physics); Parallel computing; Theoretical computer science; Programming language; Operating system","score_opus":0.05237449054811347,"score_gpt":0.2795174679480441,"score_spread":0.22714297739993064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1470776573","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.00796463,0.00017861232,0.97660214,0.0001719822,0.000079838326,0.00015246852,0.00019525361,0.011128888,0.0035262],"genre_scores_gemma":[0.47490147,0.000399007,0.50837076,0.00031491273,0.00010628325,0.0006502796,0.0014532001,0.0038527146,0.009951374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746037,0.00066298735,0.00015836034,0.00038680062,0.0010501805,0.000281267],"domain_scores_gemma":[0.99496305,0.0022303096,0.00020942723,0.0018614582,0.0006536074,0.00008206523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514433,0.0012986424,0.000995074,0.0009968845,0.0009780113,0.0015163501,0.0024396079,0.0008872688,0.009231595],"category_scores_gemma":[0.0073272204,0.00074124377,0.0016891998,0.00072353485,0.0016067254,0.002657751,0.002909993,0.0024339731,0.0017567539],"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.00089057046,0.0003878774,0.0020946236,0.001236841,0.00028408153,0.00073490146,0.0007795148,0.17810982,0.04066939,0.23736292,0.02459992,0.51284957],"study_design_scores_gemma":[0.00009217063,0.000111563284,0.0003699782,0.00010332432,0.0000773496,0.00020482209,0.00013600467,0.704725,0.056037996,0.22419153,0.013899469,0.00005064295],"about_ca_topic_score_codex":0.003980423,"about_ca_topic_score_gemma":0.005252659,"teacher_disagreement_score":0.009231595,"about_ca_system_score_codex":0.0013875148,"about_ca_system_score_gemma":0.0022960957,"threshold_uncertainty_score":0.030882776},"labels":[],"label_agreement":null},{"id":"W147081156","doi":"10.1007/978-3-540-31849-1_88","title":"Address Extraction: Extraction of Location-Based Information from the Web","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Information retrieval; Information extraction; Precision and recall; Graph; Data mining; Matching (statistics); Ontology; Theoretical computer science","score_opus":0.011513802797180669,"score_gpt":0.24363347650193143,"score_spread":0.23211967370475076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147081156","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.057375506,0.005896495,0.8473393,0.001013973,0.00047344688,0.00043337385,0.031517677,0.037310936,0.018639253],"genre_scores_gemma":[0.20830059,0.005111575,0.6909257,0.0005042925,0.00040427595,0.00039618384,0.06794666,0.0015859646,0.024824724],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965036,0.000041282867,0.000052050695,0.00009253738,0.000121035446,0.000042676882],"domain_scores_gemma":[0.9994382,0.00019200786,0.000073923264,0.000112318194,0.00015258863,0.00003098336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002745939,0.0011614109,0.0010372412,0.006268358,0.00057005597,0.0018842788,0.0011559129,0.0011618659,0.0058033024],"category_scores_gemma":[0.0017544132,0.00051613105,0.0010509348,0.006949588,0.00025429044,0.0017660478,0.0013803534,0.00054851634,0.0126173],"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.00028091803,0.00017250223,0.0052306047,0.0010970155,0.00012457154,0.0012806064,0.0003607061,0.0029504213,0.03906194,0.004081594,0.041770015,0.9035891],"study_design_scores_gemma":[0.00023366678,0.00040918496,0.028844012,0.00079103507,0.0009864297,0.005963924,0.0016233965,0.20648971,0.29656392,0.056341045,0.40146077,0.00029291058],"about_ca_topic_score_codex":0.0018394127,"about_ca_topic_score_gemma":0.002273255,"teacher_disagreement_score":0.006268358,"about_ca_system_score_codex":0.00029313937,"about_ca_system_score_gemma":0.0007678311,"threshold_uncertainty_score":0.019414008},"labels":[],"label_agreement":null},{"id":"W147135042","doi":"10.1007/978-3-642-33509-9_41","title":"Trajectory Tracking with Model Predictive Control for an Unmanned Quad-rotor Helicopter: Theory and Flight Test Results","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"Concordia University","funders":"","keywords":"Trajectory; Flight test; Tracking (education); Model predictive control; Control theory (sociology); Computer science; Rotor (electric); Aeronautics; Control (management); Engineering; Control engineering; Aerospace engineering; Artificial intelligence; Simulation; Psychology; Physics","score_opus":0.010589724140985076,"score_gpt":0.22069672017238168,"score_spread":0.2101069960313966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147135042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42349416,0.0013670869,0.5529627,0.00024407734,0.00007924042,0.00016182353,0.00022738427,0.0013462222,0.020117292],"genre_scores_gemma":[0.9761193,0.00020237794,0.02093131,0.000015771335,0.0000071597597,0.0000379873,0.000119669516,0.000033663648,0.0025327213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999818,0.000038948223,0.000009210204,0.00003156088,0.00007765765,0.00002460429],"domain_scores_gemma":[0.99908674,0.00049652957,0.0001028105,0.0000866113,0.00020703173,0.000020335301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004391567,0.00051067903,0.0004795049,0.00038056,0.0004574408,0.0005593227,0.00044713105,0.00082770165,0.0017307674],"category_scores_gemma":[0.0012085992,0.00019130066,0.00031939082,0.00060222985,0.00040110422,0.00061940047,0.00038776378,0.0005111987,0.00021165941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000316989,0.00011590812,0.0009073463,0.00018092158,0.00004089695,0.00009190177,0.00011218804,0.89126694,0.013999569,0.003921755,0.0007785857,0.08826704],"study_design_scores_gemma":[0.000011816889,0.00014008576,0.00038627902,0.0000060861676,0.000008413878,0.000014305258,0.000011219366,0.9953199,0.0031738542,0.00076388917,0.00015890002,0.000005254566],"about_ca_topic_score_codex":0.011826894,"about_ca_topic_score_gemma":0.004786044,"teacher_disagreement_score":0.011826894,"about_ca_system_score_codex":0.00039048324,"about_ca_system_score_gemma":0.0005235516,"threshold_uncertainty_score":0.023516119},"labels":[],"label_agreement":null},{"id":"W1471943874","doi":"10.1007/978-3-642-38230-7_7","title":"SiteHopper: Abstracting Navigation State Machines for the Efficient Verification of Web Applications","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Web crawler; Abstraction; State (computer science); Model checking; Finite-state machine; On the fly; Data mining; Programming language; Information retrieval; World Wide Web; Operating system","score_opus":0.01938348445182148,"score_gpt":0.2701109497937844,"score_spread":0.25072746534196294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1471943874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005437366,0.00010572811,0.98041934,0.00005013646,0.000045498247,0.000057041478,0.00020815595,0.012450334,0.0012264869],"genre_scores_gemma":[0.24552114,0.00037585478,0.73998916,0.00015295293,0.00006338885,0.00030817208,0.0014906684,0.0038230922,0.008275585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988657,0.00031120342,0.00007619897,0.00021483983,0.00043087557,0.000101083264],"domain_scores_gemma":[0.9985917,0.00075826497,0.000079099795,0.0003835641,0.00016144963,0.000025936679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010276042,0.0015190598,0.00096325733,0.0009332876,0.00055696623,0.0012553446,0.0021841251,0.0011910615,0.01135878],"category_scores_gemma":[0.0036528006,0.0012545175,0.0016119797,0.0006843748,0.0013264328,0.0034875881,0.0020470512,0.0021545845,0.0025774427],"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.0005976338,0.00019782648,0.0018183459,0.0012536969,0.00018648524,0.000445079,0.000470003,0.25148562,0.047276907,0.16606708,0.024785198,0.5054161],"study_design_scores_gemma":[0.00006860809,0.000087323664,0.00039920077,0.00009099225,0.00006197994,0.0001601327,0.00003103352,0.80089164,0.04230149,0.13845253,0.017408263,0.000046801557],"about_ca_topic_score_codex":0.0032521945,"about_ca_topic_score_gemma":0.005145703,"teacher_disagreement_score":0.01135878,"about_ca_system_score_codex":0.00064364297,"about_ca_system_score_gemma":0.0012645057,"threshold_uncertainty_score":0.037998855},"labels":[],"label_agreement":null},{"id":"W147474551","doi":"10.1007/978-3-319-12823-8_1","title":"Content Profiling for Preservation: Improving Scale, Depth and Quality","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Traditional Archives Management","field":"Arts and Humanities","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 Toronto","funders":"","keywords":"Profiling (computer programming); Computer science; Heuristics; Data mining; Metadata; World Wide Web","score_opus":0.09244986003165974,"score_gpt":0.25075388165070744,"score_spread":0.15830402161904772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147474551","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.19049066,0.003463712,0.77452964,0.00096747745,0.0003046307,0.00043422522,0.00087532686,0.010782282,0.018152116],"genre_scores_gemma":[0.621321,0.0017700773,0.36572805,0.00022470714,0.00021621655,0.00012639216,0.0010723302,0.0018522373,0.007688891],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701023,0.0005751465,0.0001979481,0.0004891585,0.0014857157,0.00024183841],"domain_scores_gemma":[0.98530906,0.0048750867,0.0013993323,0.0041453787,0.003811058,0.00046015263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034580496,0.00063110184,0.00077473844,0.0028494638,0.0008983492,0.005236655,0.0012717352,0.0007945259,0.0033382522],"category_scores_gemma":[0.01654468,0.0005504311,0.0005312253,0.0035099254,0.000995931,0.0061490834,0.0032752298,0.0010974569,0.0018139889],"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.00038781337,0.00014792947,0.009283604,0.00035611336,0.000036676975,0.00007595711,0.0011012057,0.0025564472,0.04775671,0.004769624,0.005878533,0.9276494],"study_design_scores_gemma":[0.00012262832,0.0008920034,0.054216612,0.00076935114,0.00065612333,0.0019018032,0.0048633628,0.1864102,0.61126786,0.043176986,0.095436715,0.00028635326],"about_ca_topic_score_codex":0.0011701271,"about_ca_topic_score_gemma":0.001660068,"teacher_disagreement_score":0.005236655,"about_ca_system_score_codex":0.0006931571,"about_ca_system_score_gemma":0.0010479306,"threshold_uncertainty_score":0.018288136},"labels":[],"label_agreement":null},{"id":"W1479683460","doi":"10.1007/978-3-540-69052-8_87","title":"A Formal Framework of Conversational Goals Based on Strategic Reasoning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Concordia University; Université Laval","funders":"","keywords":"Argumentation theory; Computer science; Set (abstract data type); Management science; Strategic interaction; Artificial intelligence; Human–computer interaction; Knowledge management; Programming language; Epistemology","score_opus":0.02774510416831875,"score_gpt":0.2525641717957516,"score_spread":0.22481906762743284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479683460","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.001988265,0.00072475406,0.96900415,0.0010632065,0.00015690268,0.00011273063,0.0001254416,0.00041981527,0.02640481],"genre_scores_gemma":[0.21604884,0.0012716319,0.7669479,0.000566538,0.0004094562,0.00081426516,0.00052302744,0.00030616665,0.0131121185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576795,0.0019425262,0.00039424075,0.00056312676,0.0008674757,0.0004647068],"domain_scores_gemma":[0.99689555,0.0019134112,0.00021283231,0.00039903467,0.00036453095,0.00021470152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048567466,0.0016558999,0.0013325404,0.0020859274,0.0030276882,0.008364131,0.005200847,0.0037029898,0.009803205],"category_scores_gemma":[0.006969248,0.0019084739,0.0032228776,0.0027020022,0.008904391,0.011447253,0.004722879,0.006314945,0.0027528703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004608477,0.0000062546364,0.00001333891,0.000026844718,0.000004326147,0.000031045118,0.00020002996,0.001557018,0.00013744227,0.99563676,0.00039758973,0.0019845923],"study_design_scores_gemma":[0.000013711469,0.000008033114,0.000017153872,0.000032211894,0.000012633995,0.00004472451,0.000066184206,0.017787222,0.00025682652,0.97252685,0.009220861,0.000013593132],"about_ca_topic_score_codex":0.005984989,"about_ca_topic_score_gemma":0.0035362863,"teacher_disagreement_score":0.009803205,"about_ca_system_score_codex":0.003164867,"about_ca_system_score_gemma":0.002926654,"threshold_uncertainty_score":0.032795012},"labels":[],"label_agreement":null},{"id":"W1479736339","doi":"10.1007/11813040_27","title":"Towards Automatic Exception Safety Verification","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Programming language; Exception handling; Java; Static analysis; Raising (metalworking); Software engineering; Software","score_opus":0.018498283578180015,"score_gpt":0.2547942841712107,"score_spread":0.2362960005930307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479736339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037422339,0.00027641925,0.9846348,0.00017614417,0.00013815658,0.00005552325,0.000043271786,0.0047133146,0.006220104],"genre_scores_gemma":[0.17882755,0.0006557046,0.8016768,0.0004573201,0.00018881897,0.00012437873,0.00053166196,0.001439927,0.016097877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996786,0.0005725443,0.00019198091,0.00047419057,0.0017302389,0.00024507707],"domain_scores_gemma":[0.99500895,0.0020505544,0.00018441664,0.0018621149,0.0008275691,0.000066352324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018706449,0.0011795335,0.0010640251,0.0018609398,0.0009467446,0.00211886,0.0021264965,0.0013115722,0.008948051],"category_scores_gemma":[0.006084174,0.0014787898,0.0016634151,0.00097207143,0.0017743068,0.0036339127,0.0037087696,0.00334069,0.0042362213],"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.00025904534,0.00016570666,0.0006874133,0.00055606215,0.000087702436,0.00035575387,0.00038244773,0.021168174,0.04736801,0.21429487,0.016357513,0.6983172],"study_design_scores_gemma":[0.00008741558,0.00013055936,0.00048153597,0.00028344264,0.00014827818,0.0006673604,0.00008850287,0.2682489,0.07959521,0.58416396,0.06603503,0.00006986367],"about_ca_topic_score_codex":0.000593371,"about_ca_topic_score_gemma":0.0008870714,"teacher_disagreement_score":0.008948051,"about_ca_system_score_codex":0.00055150193,"about_ca_system_score_gemma":0.001092291,"threshold_uncertainty_score":0.029934227},"labels":[],"label_agreement":null},{"id":"W1479785971","doi":"10.1007/978-3-540-39903-2_116","title":"Percutaneous Pedicle Cannulation: An in-vitro Study Assessing Clinical Expertise versus Technology","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spinal Fractures and Fixation Techniques","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Western Hospital; University of Toronto; University Health Network","funders":"","keywords":"Fluoroscopy; Percutaneous; Medicine; Medical physics; Radiology; Imaging technology; Surgery; Computer science","score_opus":0.053723977249060494,"score_gpt":0.3864235667034044,"score_spread":0.3326995894543439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479785971","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.98882025,0.0018897959,0.0066379346,0.000038142553,0.000052801835,0.0001592189,0.0002796042,0.000033082964,0.0020890932],"genre_scores_gemma":[0.98435366,0.0018769854,0.010357917,0.00008340169,0.000054649026,0.00016378947,0.000874844,0.00005114879,0.002183593],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947818,0.0026528458,0.0004220528,0.0006688866,0.0010551797,0.00041917735],"domain_scores_gemma":[0.9705081,0.022541758,0.0014228512,0.0011663841,0.003773013,0.0005879746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031377638,0.00073572143,0.0009829781,0.00088991295,0.0005496473,0.0012514503,0.0011822472,0.0011447759,0.004166907],"category_scores_gemma":[0.007570059,0.000655806,0.00083778106,0.0013067798,0.0010817322,0.001659199,0.0008945211,0.0011977165,0.0007819657],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034765273,0.003455149,0.009923834,0.00081432756,0.00013421364,0.0004884612,0.0015959125,0.0024821134,0.9597116,0.0004775969,0.00026037154,0.017179985],"study_design_scores_gemma":[0.00038224692,0.04226712,0.049801536,0.00018262441,0.00048440686,0.0014942063,0.0028551756,0.014961898,0.88384384,0.00048745194,0.003137409,0.00010197203],"about_ca_topic_score_codex":0.0027838172,"about_ca_topic_score_gemma":0.0020436915,"teacher_disagreement_score":0.004166907,"about_ca_system_score_codex":0.00059310865,"about_ca_system_score_gemma":0.00054412434,"threshold_uncertainty_score":0.01659429},"labels":[],"label_agreement":null},{"id":"W1479791303","doi":"10.1007/3-540-45441-1_26","title":"Extending UML to Support Ontology Engineering for the Semantic Web","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; OWL-S; Ontology; Web Ontology Language; Description logic; Unified Modeling Language; Knowledge representation and reasoning; Semantic Web; Applications of UML; Programming language; Ontology language; Software engineering; World Wide Web; Artificial intelligence; Semantic Web Stack; Software","score_opus":0.025705997504424927,"score_gpt":0.26546287857573847,"score_spread":0.23975688107131354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479791303","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.0023512598,0.00032590522,0.98869765,0.00064370694,0.0001402946,0.00007791855,0.00011470742,0.0024919508,0.005156609],"genre_scores_gemma":[0.04174476,0.00073432777,0.9517407,0.0003853167,0.000117546784,0.00014394856,0.0006628976,0.0007540021,0.0037165207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968817,0.0011514074,0.00044565892,0.00025275027,0.001072402,0.00019607524],"domain_scores_gemma":[0.9958807,0.0020858364,0.00023031388,0.0010951897,0.00056472316,0.00014317557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048885224,0.0006825576,0.00067486387,0.0019336132,0.0009763927,0.0045349775,0.002120546,0.002028218,0.0025258004],"category_scores_gemma":[0.010284893,0.0013025755,0.0020110924,0.0014521511,0.0015160973,0.009620817,0.0044858223,0.0032570378,0.001711248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009812824,0.000231837,0.0008484715,0.0005029314,0.00011965296,0.00072744867,0.003032222,0.01757127,0.015953014,0.6382844,0.016053544,0.30657712],"study_design_scores_gemma":[0.00008121471,0.0000493719,0.00024758474,0.00042578718,0.00015214304,0.00051908236,0.00030883288,0.1625263,0.016180892,0.48375434,0.33566156,0.00009299226],"about_ca_topic_score_codex":0.003746045,"about_ca_topic_score_gemma":0.005789958,"teacher_disagreement_score":0.0048885224,"about_ca_system_score_codex":0.0010140303,"about_ca_system_score_gemma":0.0018808435,"threshold_uncertainty_score":0.025853276},"labels":[],"label_agreement":null},{"id":"W1479896847","doi":"10.1007/978-3-540-24670-1_22","title":"Hand Gesture Recognition within a Linguistics-Based Framework","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Gesture; Gesture recognition; Speech recognition; Natural language processing; Artificial intelligence","score_opus":0.02539077613193447,"score_gpt":0.2575266673691594,"score_spread":0.23213589123722495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479896847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059747575,0.00072973815,0.9715064,0.00071495934,0.00012772303,0.00014089022,0.0002922575,0.003200712,0.017312566],"genre_scores_gemma":[0.14361717,0.0010236503,0.8301784,0.0003772465,0.0003170555,0.00032821333,0.0011529538,0.0011172739,0.021888027],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988695,0.00029318308,0.00012375404,0.00035159057,0.00028597747,0.00007603759],"domain_scores_gemma":[0.99915206,0.00031876648,0.00006701403,0.0001225877,0.00027996744,0.0000595522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013158921,0.001029263,0.0010048231,0.0023064076,0.0010076675,0.004163782,0.002052204,0.0010277898,0.009092676],"category_scores_gemma":[0.0022489072,0.0008076702,0.0014048738,0.0012137757,0.002246062,0.00418226,0.0021342938,0.001339306,0.0055964277],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018747551,0.00015496532,0.0018384039,0.0007973102,0.00017173034,0.0007726454,0.0024971594,0.01622289,0.08641284,0.2902088,0.013681807,0.5870541],"study_design_scores_gemma":[0.000061662526,0.00026282648,0.0045212395,0.0004857211,0.00028549743,0.001614983,0.002359927,0.42957005,0.06481221,0.33980846,0.15597413,0.0002432967],"about_ca_topic_score_codex":0.0040727016,"about_ca_topic_score_gemma":0.006180849,"teacher_disagreement_score":0.009092676,"about_ca_system_score_codex":0.0011082223,"about_ca_system_score_gemma":0.0023079277,"threshold_uncertainty_score":0.030418098},"labels":[],"label_agreement":null},{"id":"W1479912924","doi":"10.1007/3-540-44520-x_148","title":"Compiling Multithreaded Java Bytecode for Distributed Execution","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Java concurrency; strictfp; Java; Operating system; Real time Java; Java annotation; Java bytecode; Java applet; Generics in Java; Embedded Java; Parallel computing; Software portability; Programming language","score_opus":0.022182369773421418,"score_gpt":0.26656178455270807,"score_spread":0.24437941477928665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479912924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019445572,0.00022236635,0.93338174,0.00009568347,0.0001893801,0.00008582287,0.00013521677,0.040316693,0.006127568],"genre_scores_gemma":[0.19414933,0.00040179424,0.7706832,0.00016589843,0.00009203483,0.0002252207,0.0012545657,0.0159312,0.017096734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995977,0.000042818498,0.000038590693,0.00009940002,0.00015699217,0.00006448583],"domain_scores_gemma":[0.99904984,0.00028165476,0.0000627416,0.00033104132,0.00022775409,0.000046986846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039371985,0.00069506984,0.00069395057,0.000550614,0.0006145507,0.0008476541,0.0012763949,0.00051812315,0.005829464],"category_scores_gemma":[0.0017188633,0.00082646,0.00069815223,0.0006965874,0.00046160852,0.0011506276,0.0010323235,0.001557783,0.0031482845],"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.0003707115,0.00031124704,0.0018448202,0.00046181725,0.00008459285,0.00047129983,0.0005949788,0.049954347,0.10417506,0.02292418,0.030330537,0.78847647],"study_design_scores_gemma":[0.00023755261,0.00023338932,0.002606225,0.00020578278,0.00018135949,0.00063384225,0.00013133735,0.5774132,0.27247137,0.052596394,0.09317207,0.00011735575],"about_ca_topic_score_codex":0.0018148671,"about_ca_topic_score_gemma":0.002328375,"teacher_disagreement_score":0.005829464,"about_ca_system_score_codex":0.00044792882,"about_ca_system_score_gemma":0.00086452963,"threshold_uncertainty_score":0.019501448},"labels":[],"label_agreement":null},{"id":"W1479915272","doi":"10.1007/3-540-44989-2_119","title":"Recommendation Models for User Accesses to Web Pages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Data mining; Web page; Association rule learning; Markov chain; Information retrieval; Hidden Markov model; Collaborative filtering; Markov model; World Wide Web; Machine learning; Artificial intelligence; Recommender system","score_opus":0.04968703429057332,"score_gpt":0.2892383645166036,"score_spread":0.2395513302260303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479915272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1284851,0.00481885,0.8446642,0.0038268745,0.0004078933,0.00047982528,0.00654594,0.003591894,0.0071793087],"genre_scores_gemma":[0.733188,0.0051838662,0.2022439,0.0006680544,0.0009719346,0.0014088044,0.010198896,0.0005604745,0.045576125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974511,0.0011152095,0.00016168407,0.00059981673,0.00038737257,0.00028469195],"domain_scores_gemma":[0.98346114,0.012893645,0.00067504577,0.001224269,0.0014911556,0.0002546679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005961563,0.0019253569,0.003015924,0.00459779,0.0009948119,0.0030973945,0.0054432596,0.005130104,0.00934789],"category_scores_gemma":[0.021655228,0.0019245755,0.0037893471,0.005063204,0.001135741,0.006175374,0.0009138053,0.004419744,0.0053910273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087289163,0.00073248724,0.011892191,0.00054389774,0.0009549381,0.00027687298,0.0005875662,0.7095203,0.0013823312,0.06501185,0.026024817,0.18219993],"study_design_scores_gemma":[0.000031064,0.00004032447,0.0005895428,0.000021173544,0.00007862351,0.000046856367,0.000017048993,0.98726094,0.00010309743,0.011274475,0.00051930954,0.000017568625],"about_ca_topic_score_codex":0.04519174,"about_ca_topic_score_gemma":0.06780733,"teacher_disagreement_score":0.04519174,"about_ca_system_score_codex":0.0027895335,"about_ca_system_score_gemma":0.0014132666,"threshold_uncertainty_score":0.0898574},"labels":[],"label_agreement":null},{"id":"W1479917419","doi":"10.1007/11792086_16","title":"Doubly-Focused Enumeration of Pseudosquares and Pseudocubes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Enumeration; Computer science; Theoretical computer science; Programming language; Discrete mathematics; Mathematics","score_opus":0.023634638628328132,"score_gpt":0.2701689228462606,"score_spread":0.24653428421793247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479917419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10264,0.0012199336,0.7413382,0.00064253685,0.0003046029,0.00010717999,0.00042430512,0.0004888927,0.1528343],"genre_scores_gemma":[0.3966316,0.001952918,0.4966287,0.00048764783,0.00023765172,0.0003435104,0.0014690188,0.0006890381,0.10156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993581,0.00019838643,0.000038316735,0.00009734021,0.00024208496,0.00006566687],"domain_scores_gemma":[0.99886215,0.0004931029,0.000072844436,0.00020773448,0.00028786558,0.00007619826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043592902,0.00061214814,0.00072095584,0.0012383107,0.0011179604,0.001902016,0.0011213169,0.00076198817,0.010726446],"category_scores_gemma":[0.0025908328,0.00056184625,0.00063183,0.0020839593,0.0010706323,0.0030930277,0.002038365,0.0015963947,0.0023592422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047110578,0.000022254968,0.00023895175,0.000104481216,0.000007930472,0.000099651996,0.00017656085,0.0045962967,0.0034243162,0.9337919,0.0046823737,0.052808218],"study_design_scores_gemma":[0.000011956544,0.000023343518,0.0001834986,0.000049532882,0.000010998026,0.000362738,0.00013803362,0.02337473,0.0043353196,0.9447197,0.026773429,0.000016759308],"about_ca_topic_score_codex":0.00047825553,"about_ca_topic_score_gemma":0.001066161,"teacher_disagreement_score":0.010726446,"about_ca_system_score_codex":0.0005683508,"about_ca_system_score_gemma":0.0004627394,"threshold_uncertainty_score":0.035883546},"labels":[],"label_agreement":null},{"id":"W1479933963","doi":"10.1007/978-3-642-20389-3_4","title":"Applying Linear Models to Learn Regulation Programs in a Transcription Regulatory Module Network","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.03003878729256653,"score_gpt":0.22820197286470192,"score_spread":0.1981631855721354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479933963","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.12467044,0.00059452833,0.8706663,0.0005398027,0.00003666905,0.000049003003,0.0002770203,0.0015965624,0.0015696903],"genre_scores_gemma":[0.8663657,0.00035867034,0.12399688,0.00022846706,0.00011478463,0.00030474027,0.000811233,0.0002680252,0.0075515676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974936,0.00009774546,0.000010690669,0.00008102085,0.000029052824,0.000032053278],"domain_scores_gemma":[0.9962658,0.0033403102,0.00013115512,0.000080753794,0.00012759285,0.00005441174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541264,0.00082193664,0.00081452343,0.0004784749,0.00034908133,0.00075797044,0.0013179429,0.0011027177,0.0023838063],"category_scores_gemma":[0.0039059045,0.0008923384,0.00096809026,0.000551303,0.00062689045,0.0010441979,0.00083729776,0.0020834673,0.00040826102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047945618,0.00003777883,0.00036269668,0.000027837297,0.000023718894,0.000015891737,0.000024224033,0.97720784,0.00047713038,0.002212038,0.0003717102,0.019191261],"study_design_scores_gemma":[0.0000022780941,0.0000037387852,0.000017411963,7.9717734e-7,0.000001876352,9.4345216e-7,0.0000010115018,0.99842584,0.00007581857,0.0014490472,0.000020438698,8.906948e-7],"about_ca_topic_score_codex":0.012504023,"about_ca_topic_score_gemma":0.016392274,"teacher_disagreement_score":0.012504023,"about_ca_system_score_codex":0.0012741407,"about_ca_system_score_gemma":0.0007699479,"threshold_uncertainty_score":0.024862468},"labels":[],"label_agreement":null},{"id":"W1480020698","doi":"10.1007/bfb0018392","title":"Representing and using protosemantic information in generating bus route descriptions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Context (archaeology); Set (abstract data type); Representation (politics); Granularity; Domain (mathematical analysis); Simple (philosophy); Information retrieval; Theoretical computer science; Programming language; Geography","score_opus":0.03213965301034971,"score_gpt":0.26143970527248694,"score_spread":0.22930005226213723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480020698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062838,0.00040181604,0.9085804,0.00029465748,0.00013442348,0.00027706896,0.0045546424,0.009583858,0.013335156],"genre_scores_gemma":[0.20470461,0.0003833766,0.7823551,0.00008422776,0.000025914533,0.0001182095,0.0076312334,0.0010811655,0.0036161484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959,0.00012441128,0.00003837954,0.000085067164,0.00012843755,0.000033744604],"domain_scores_gemma":[0.99874485,0.0007360507,0.000058348334,0.00018068413,0.00024416926,0.00003580715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009559943,0.00059591944,0.00040861784,0.0028214077,0.00077450706,0.0018438138,0.00086957373,0.0007519607,0.005268204],"category_scores_gemma":[0.0040748683,0.0006302534,0.0008641857,0.0024409855,0.00045739263,0.0026430653,0.0008599394,0.000587169,0.0018177874],"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.00054240506,0.00035668336,0.008198993,0.0008382519,0.0001275783,0.00163592,0.0028474657,0.13849664,0.017737705,0.09221251,0.02532354,0.7116823],"study_design_scores_gemma":[0.00005262956,0.0000812851,0.0013872981,0.00018739406,0.00019887854,0.00056872895,0.00094554236,0.8131164,0.045671627,0.06575406,0.07196277,0.0000734522],"about_ca_topic_score_codex":0.007399143,"about_ca_topic_score_gemma":0.01460048,"teacher_disagreement_score":0.007399143,"about_ca_system_score_codex":0.00091048365,"about_ca_system_score_gemma":0.0011308431,"threshold_uncertainty_score":0.017623961},"labels":[],"label_agreement":null},{"id":"W1480048967","doi":"10.1007/978-3-540-28626-4_40","title":"3D Automatic Fiducial Marker Localization Approach for Frameless Stereotactic Neuro-surgery Navigation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Robarts Clinical Trials","funders":"","keywords":"Fiducial marker; Artificial intelligence; Computer science; Medicine","score_opus":0.02076482293416335,"score_gpt":0.2696439825261536,"score_spread":0.24887915959199028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480048967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032089392,0.0002376873,0.99394387,0.000033963737,0.000058289676,0.000022111251,0.00007393621,0.0016011023,0.00082009],"genre_scores_gemma":[0.07596807,0.0004362474,0.9187882,0.000089607434,0.000029683048,0.000096289805,0.00036420196,0.00029171578,0.0039359387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995639,0.000053143005,0.000021740754,0.000067427005,0.0002653562,0.000028526192],"domain_scores_gemma":[0.9997713,0.00004835988,0.000024352381,0.00005318091,0.000090501395,0.000012414019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031080245,0.00090407074,0.0007158052,0.0012368972,0.00033901824,0.0010288781,0.0013699046,0.001203357,0.0036196315],"category_scores_gemma":[0.00063519005,0.0008497904,0.0010098726,0.00087755476,0.00026128945,0.00054897065,0.0012010095,0.0007047921,0.002085078],"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.00019321144,0.00006610547,0.00068224804,0.00023023949,0.00010743247,0.00037417634,0.00029552175,0.051971532,0.17240325,0.008418406,0.011011891,0.754246],"study_design_scores_gemma":[0.000045013,0.00022696891,0.0029454993,0.00007766017,0.00014362077,0.0033985893,0.00008296389,0.8207448,0.123383075,0.006970062,0.04181972,0.00016198229],"about_ca_topic_score_codex":0.0028323557,"about_ca_topic_score_gemma":0.005343862,"teacher_disagreement_score":0.0036196315,"about_ca_system_score_codex":0.0004328815,"about_ca_system_score_gemma":0.0008919405,"threshold_uncertainty_score":0.012108922},"labels":[],"label_agreement":null},{"id":"W1480097244","doi":"10.1007/978-3-642-01970-8_7","title":"A Parallel High-Order Discontinuous Galerkin Shallow Water Model","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","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":"Perimeter Institute","funders":"","keywords":"Discontinuous Galerkin method; Shallow water equations; Discretization; Flume; Waves and shallow water; Solver; Exponential function; Scaling; Convergence (economics); Image stitching; Flooding (psychology); Mathematics; Geology; Mathematical analysis; Geometry; Computer science; Physics; Mathematical optimization; Finite element method; Flow (mathematics)","score_opus":0.007053023978452006,"score_gpt":0.198232722977797,"score_spread":0.191179698999345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480097244","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.03969962,0.00021471226,0.9461574,0.00025493797,0.00009037323,0.000057213016,0.00022207538,0.00038610338,0.012917558],"genre_scores_gemma":[0.8217474,0.0004711916,0.15627193,0.00010825672,0.00008338095,0.00020277007,0.0003738023,0.0002032727,0.020537987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998952,0.000022422359,0.000004283727,0.000017044533,0.000047638332,0.000013283338],"domain_scores_gemma":[0.999859,0.000044171215,0.000014707999,0.00002223811,0.000041216495,0.000018733903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018011384,0.00045556074,0.00079812814,0.00021841089,0.0004478086,0.00083439227,0.001293368,0.0010320393,0.002067312],"category_scores_gemma":[0.00043880224,0.00038885284,0.00048461987,0.00041148136,0.00058977626,0.0007558276,0.0009280187,0.0009842025,0.0004919354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031811072,0.00003366825,0.00016731786,0.00002113504,0.000008670635,0.00003762529,0.000019769303,0.98070943,0.002444412,0.008693256,0.00039207275,0.0074406946],"study_design_scores_gemma":[0.000005148773,0.0000060294196,0.000019447489,7.6046234e-7,0.0000016434134,0.000004639496,0.0000019291297,0.99834585,0.0002454517,0.0010819617,0.00028534763,0.0000017222151],"about_ca_topic_score_codex":0.00479582,"about_ca_topic_score_gemma":0.0035676025,"teacher_disagreement_score":0.00479582,"about_ca_system_score_codex":0.00043339614,"about_ca_system_score_gemma":0.0009353506,"threshold_uncertainty_score":0.0095357895},"labels":[],"label_agreement":null},{"id":"W1480097620","doi":"10.1007/978-3-540-39929-2_9","title":"Architectures for Widget-Level Plasticity","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Programming language","score_opus":0.03654779486286341,"score_gpt":0.26912467825436814,"score_spread":0.23257688339150473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480097620","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.0577813,0.0012034388,0.860977,0.00041711834,0.0005932876,0.00006853153,0.00012224304,0.0063982336,0.07243885],"genre_scores_gemma":[0.6778992,0.0010814603,0.25523835,0.00030977943,0.00012227858,0.00019225823,0.00027825948,0.0006259943,0.06425246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999068,0.000008223074,0.0000054532707,0.000015894937,0.00004315059,0.000020482918],"domain_scores_gemma":[0.99985516,0.000023061912,0.000010165961,0.00005794431,0.000039772392,0.000013863175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012513628,0.00038081224,0.00040172893,0.00030923772,0.0004720546,0.001044689,0.0015144504,0.0006346454,0.0153233465],"category_scores_gemma":[0.000530116,0.00032235903,0.00031853752,0.00034404473,0.00038435913,0.001410198,0.0011133983,0.00088108797,0.0026850621],"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.00021405109,0.00013917795,0.0004419701,0.00037231177,0.00005450765,0.00020939451,0.00018336106,0.060028534,0.1538762,0.42516243,0.013495387,0.34582266],"study_design_scores_gemma":[0.00007201887,0.00035268223,0.000671655,0.00009789551,0.00007485372,0.0005502142,0.000094299925,0.50946015,0.08699638,0.2895438,0.112010114,0.00007595219],"about_ca_topic_score_codex":0.00027744577,"about_ca_topic_score_gemma":0.0007340932,"teacher_disagreement_score":0.0153233465,"about_ca_system_score_codex":0.00030695807,"about_ca_system_score_gemma":0.00023365747,"threshold_uncertainty_score":0.051261663},"labels":[],"label_agreement":null},{"id":"W1480099808","doi":"10.1007/978-3-540-85035-9_19","title":"Placement of Sound Sources in the Stereo Field Using Measured Room Impulse Responses","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Panning (audio); Reverberation; Impulse response; Impulse (physics); Computer science; Acoustics; Stereophonic sound; Computer vision; Artificial intelligence; Loudspeaker; Mathematics; Optics; Physics","score_opus":0.041817659351747055,"score_gpt":0.2766281531415309,"score_spread":0.23481049378978383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480099808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09948837,0.0003178551,0.8855528,0.00006841402,0.00014457773,0.00023995033,0.00066261296,0.004305648,0.009219757],"genre_scores_gemma":[0.46011937,0.00028368353,0.5352596,0.000031164916,0.000025606387,0.0000957757,0.0005449269,0.0004489052,0.0031909468],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993455,0.00014884536,0.000030946467,0.00014748449,0.00025990428,0.00006722186],"domain_scores_gemma":[0.9986119,0.00036519268,0.00008447349,0.0001814196,0.0006442518,0.00011267757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007005829,0.0010655152,0.00063789,0.0018652455,0.0006097401,0.0015841532,0.00097383646,0.0009571612,0.012197556],"category_scores_gemma":[0.0035056367,0.00065980986,0.00059630664,0.0012986461,0.00041796075,0.0010000137,0.00088307366,0.0006969692,0.004456077],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018798799,0.00028084527,0.0057083196,0.00057965505,0.00009649914,0.0003723659,0.0009195403,0.029328201,0.536377,0.0037188132,0.0031406735,0.41759816],"study_design_scores_gemma":[0.0003583338,0.0008387396,0.021355867,0.00019428595,0.0002234216,0.001230016,0.0008377068,0.30853266,0.65512365,0.0038910462,0.007177679,0.00023660874],"about_ca_topic_score_codex":0.0020741127,"about_ca_topic_score_gemma":0.004037623,"teacher_disagreement_score":0.012197556,"about_ca_system_score_codex":0.00066268665,"about_ca_system_score_gemma":0.0012191671,"threshold_uncertainty_score":0.040804863},"labels":[],"label_agreement":null},{"id":"W1480118777","doi":"10.1007/978-3-642-03658-3_96","title":"Evaluating Human Computer Interaction through Self-rated Emotion","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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 Toronto","funders":"","keywords":"Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.08433509415418465,"score_gpt":0.38831342423804255,"score_spread":0.3039783300838579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480118777","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.9716143,0.0004798758,0.018001363,0.000054072072,0.000057367673,0.0001221409,0.00035328625,0.00019842829,0.0091191875],"genre_scores_gemma":[0.98816574,0.0002844697,0.0069494247,0.000030129586,0.000023122315,0.00010242559,0.00043832086,0.000029129304,0.0039773313],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99956065,0.00015279798,0.000027503096,0.000058877242,0.00016894475,0.000031117037],"domain_scores_gemma":[0.9986895,0.0008013444,0.00013387436,0.000054282365,0.00023307279,0.000088023146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060120097,0.00032896572,0.000272475,0.00035147945,0.00011462364,0.0006256078,0.00020207877,0.00037940135,0.0032387269],"category_scores_gemma":[0.0028765886,0.0000850988,0.00021251237,0.0002048078,0.00011244041,0.0004739887,0.00031322739,0.00020239076,0.0010553297],"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.0039661387,0.0012802584,0.29564288,0.0005447632,0.0005164423,0.0001832264,0.0016526224,0.005948071,0.14156419,0.0007040123,0.004593532,0.54340386],"study_design_scores_gemma":[0.00006225629,0.0030503275,0.9083395,0.000056039666,0.00025104557,0.0005039171,0.0012993765,0.053469364,0.02994088,0.0007066915,0.0022407277,0.000079997684],"about_ca_topic_score_codex":0.0005457816,"about_ca_topic_score_gemma":0.0010705583,"teacher_disagreement_score":0.0032387269,"about_ca_system_score_codex":0.00011850468,"about_ca_system_score_gemma":0.00007248761,"threshold_uncertainty_score":0.010834634},"labels":[],"label_agreement":null},{"id":"W1480122107","doi":"10.1007/11774129_4","title":"Comparative Analysis of Job Satisfaction in Agile and Non-agile Software Development Teams","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":98,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Agile software development; Job satisfaction; Computer science; Software development; Knowledge management; Extreme programming; Job design; Affect (linguistics); Software; Job performance; Software development process; Psychology; Software engineering; Social psychology","score_opus":0.013809750621480347,"score_gpt":0.26204095526622506,"score_spread":0.2482312046447447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480122107","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.99865794,0.00006328548,0.00016933166,0.000032887478,0.000006924466,0.0000054447823,0.00008366209,0.000003705601,0.0009767881],"genre_scores_gemma":[0.9994723,0.000015269743,0.00005023644,0.0000073315628,0.000003543578,0.000006549721,0.00011562985,0.0000021187618,0.00032707205],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99825567,0.0007997815,0.0001179688,0.00009263222,0.0003954685,0.0003385639],"domain_scores_gemma":[0.9831746,0.009367583,0.0017116698,0.00024681079,0.0025301725,0.00296922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073044,0.00016423792,0.0003549774,0.0015363423,0.0006238537,0.00085062976,0.0004924531,0.00035396864,0.0038917714],"category_scores_gemma":[0.008309372,0.00012706775,0.00064879237,0.0017668246,0.00038302733,0.0005410353,0.00070166605,0.00040366082,0.0005245766],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003786025,0.0008549744,0.951094,0.00015171008,0.00017183022,0.00027157678,0.0043631704,0.0011770661,0.0018144941,0.00048410837,0.000978068,0.03485289],"study_design_scores_gemma":[0.000029610099,0.0013986696,0.99206173,0.000013064532,0.000033762528,0.000090928916,0.004609517,0.001117919,0.00026110729,0.0000981441,0.00027714635,0.000008390792],"about_ca_topic_score_codex":0.0026559304,"about_ca_topic_score_gemma":0.0031265793,"teacher_disagreement_score":0.0038917714,"about_ca_system_score_codex":0.00055051764,"about_ca_system_score_gemma":0.000604914,"threshold_uncertainty_score":0.013019264},"labels":[],"label_agreement":null},{"id":"W1480157726","doi":"10.1007/11732990_12","title":"RNA Secondary Structure Prediction Via Energy Density Minimization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University; Simon Fraser University","funders":"","keywords":"Computer science; Energy minimization; Minification; Energy (signal processing); Algorithm; Artificial intelligence; Statistics; Mathematics; World Wide Web; Chemistry; Computational chemistry","score_opus":0.00513584822479759,"score_gpt":0.1912887734071931,"score_spread":0.1861529251823955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480157726","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.038999584,0.00038530465,0.9518044,0.000179363,0.00006821896,0.00018666656,0.00049941277,0.0047822446,0.0030948485],"genre_scores_gemma":[0.27625275,0.00035447296,0.71527576,0.00019779062,0.00005848581,0.0006034549,0.0023228654,0.0013278262,0.0036065876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999637,0.00012922069,0.000016945622,0.00008112718,0.00010361027,0.000032167445],"domain_scores_gemma":[0.99927586,0.00043659596,0.000042672327,0.00009031458,0.00012523592,0.00002943527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086608867,0.0010853006,0.001991752,0.00095537683,0.00090356386,0.00084331026,0.0017136429,0.0014580181,0.004939912],"category_scores_gemma":[0.0021722317,0.0010971539,0.0016011266,0.0008750053,0.00052988564,0.00091158604,0.0009684321,0.0015251602,0.0026863778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039793772,0.00019653616,0.00090672314,0.00035047485,0.00018155001,0.00024417415,0.00007729213,0.773808,0.015961725,0.014820184,0.008527015,0.18452837],"study_design_scores_gemma":[0.00001776771,0.00001586148,0.00006503895,0.000006645769,0.000009116955,0.00001972702,0.0000055583273,0.993658,0.0017320935,0.0041402015,0.00032470978,0.0000052004043],"about_ca_topic_score_codex":0.0029089404,"about_ca_topic_score_gemma":0.0040114457,"teacher_disagreement_score":0.004939912,"about_ca_system_score_codex":0.0005076818,"about_ca_system_score_gemma":0.001216428,"threshold_uncertainty_score":0.016525686},"labels":[],"label_agreement":null},{"id":"W1480201994","doi":"10.1007/978-3-642-17517-6_12","title":"Should Static Search Trees Ever Be Unbalanced?","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University","funders":"","keywords":"Tree (set theory); Computer science; Search tree; R-tree; Binary logarithm; Optimal binary search tree; K-ary tree; Running time; Combinatorics; Tree structure; Algorithm; Mathematics; Search algorithm; Interval tree; Binary tree; Statistics","score_opus":0.03550106160354684,"score_gpt":0.288388382224733,"score_spread":0.2528873206211862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480201994","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.12067375,0.012129117,0.6011597,0.06490701,0.008242345,0.00019743283,0.003046501,0.009022164,0.180622],"genre_scores_gemma":[0.6619639,0.007271592,0.23515975,0.013223048,0.003916855,0.0002789979,0.0037361064,0.004742709,0.06970706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998467,0.00028616062,0.00008399358,0.00026295663,0.0006441968,0.00025562872],"domain_scores_gemma":[0.988079,0.0058172112,0.0006327695,0.003077023,0.001999246,0.0003947582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022908617,0.0005365044,0.00078518246,0.0008358426,0.0011957227,0.002022132,0.0014274436,0.002025239,0.01575293],"category_scores_gemma":[0.039256897,0.0006678817,0.00027337088,0.002155261,0.0018968316,0.013520633,0.0016392721,0.0018250445,0.0075591253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005792763,0.00008346468,0.0032370444,0.00042392482,0.000039157032,0.00036111267,0.00045685287,0.008654671,0.0071814023,0.36550796,0.15216674,0.46130833],"study_design_scores_gemma":[0.000064822256,0.00008271765,0.0009496907,0.00023097609,0.000049432925,0.0008165235,0.00037979096,0.02679918,0.0073830667,0.76863474,0.19457082,0.00003820594],"about_ca_topic_score_codex":0.0009888159,"about_ca_topic_score_gemma":0.0019594128,"teacher_disagreement_score":0.01575293,"about_ca_system_score_codex":0.0008605759,"about_ca_system_score_gemma":0.0009709061,"threshold_uncertainty_score":0.05269885},"labels":[],"label_agreement":null},{"id":"W1480301700","doi":"10.1007/11564751_43","title":"Using SAT in QBF","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.02741750222392105,"score_gpt":0.2642990166218196,"score_spread":0.23688151439789853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480301700","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.0038607155,0.0014018869,0.9495897,0.0018554535,0.00037007566,0.000072465766,0.00032729455,0.0015878576,0.040934578],"genre_scores_gemma":[0.23880744,0.0037021295,0.7022977,0.00092224596,0.00059632247,0.00032198403,0.0014313548,0.0014225364,0.05049837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980469,0.0008964791,0.00014014736,0.00031726086,0.00047280744,0.00012642243],"domain_scores_gemma":[0.9973726,0.0017975618,0.00007587602,0.00053403137,0.00017962379,0.000040282812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019144051,0.0010503078,0.0011670775,0.0012167437,0.001027568,0.0035457436,0.0016799202,0.0010851527,0.026136452],"category_scores_gemma":[0.008060745,0.0010892003,0.0017113758,0.0031956893,0.0019778034,0.010655074,0.002433348,0.0029471759,0.00532005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000755017,0.000044197866,0.00014372756,0.00032455818,0.00004317123,0.000062556705,0.00018718562,0.015099001,0.0011283442,0.8219648,0.010611278,0.15031566],"study_design_scores_gemma":[0.000015875225,0.000011509405,0.00004110332,0.00006254736,0.00002233528,0.000044526736,0.000023963126,0.03176087,0.00089911703,0.94554836,0.021558203,0.00001152409],"about_ca_topic_score_codex":0.00259729,"about_ca_topic_score_gemma":0.0033075367,"teacher_disagreement_score":0.026136452,"about_ca_system_score_codex":0.002017028,"about_ca_system_score_gemma":0.001026796,"threshold_uncertainty_score":0.087435186},"labels":[],"label_agreement":null},{"id":"W1480305897","doi":"10.1007/3-540-45719-4_13","title":"Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations*","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Causality (physics); Axiom; Commutative property; Computer science; Set (abstract data type); Relation (database); Event (particle physics); Theoretical computer science; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics; Data mining; Programming language; Physics; Quantum mechanics","score_opus":0.05062367435628427,"score_gpt":0.2947156633790935,"score_spread":0.2440919890228092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480305897","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.0067005325,0.00020300354,0.9852063,0.00013261772,0.000075030766,0.000046943118,0.000040888946,0.0005781973,0.0070165987],"genre_scores_gemma":[0.4173835,0.0010468769,0.55962265,0.00022168165,0.00016164532,0.00045912573,0.00027981235,0.0006794108,0.020145373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986243,0.0004736033,0.00015735754,0.00025795057,0.00033042318,0.0001562566],"domain_scores_gemma":[0.9963211,0.0025092405,0.00023137688,0.00054518465,0.0002902105,0.000103017526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230035,0.0012577729,0.00066751515,0.0010310182,0.0011853916,0.0021730163,0.0016936718,0.0013166369,0.0062074345],"category_scores_gemma":[0.0052573895,0.0012861253,0.0015911305,0.0010408608,0.0037180786,0.0066284165,0.0023953028,0.0024485434,0.0012447069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008924719,0.00004943753,0.00045805032,0.00024380183,0.000025166124,0.00031139905,0.0008394859,0.043759905,0.00623442,0.9095869,0.001234617,0.037167568],"study_design_scores_gemma":[0.000033388587,0.000044157583,0.00010066771,0.0000615778,0.000057064484,0.00021602538,0.000104675055,0.1572379,0.008514176,0.81158316,0.022009214,0.00003799741],"about_ca_topic_score_codex":0.0025597725,"about_ca_topic_score_gemma":0.002796941,"teacher_disagreement_score":0.0062074345,"about_ca_system_score_codex":0.00082614506,"about_ca_system_score_gemma":0.0011431478,"threshold_uncertainty_score":0.02076596},"labels":[],"label_agreement":null},{"id":"W1480384904","doi":"10.1007/978-3-642-02568-6_53","title":"A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Computer science; Hierarchy; Automaton; Resource allocation; Theoretical computer science; Sampling (signal processing); Resource (disambiguation); Operations research; Mathematics; Telecommunications","score_opus":0.02930678080531624,"score_gpt":0.2897804976196341,"score_spread":0.26047371681431786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480384904","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.056498803,0.0005220259,0.9222434,0.00047217414,0.00015517363,0.00016029923,0.00047002366,0.003486777,0.015991384],"genre_scores_gemma":[0.44431144,0.00030445616,0.54553515,0.00034416243,0.000102165184,0.0005052551,0.0007047149,0.0004403372,0.0077523007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781525,0.00057289563,0.00030132008,0.00048177384,0.0004862663,0.0003425542],"domain_scores_gemma":[0.9915245,0.0039338632,0.0003439321,0.0025962905,0.0009943296,0.00060709444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016129299,0.0007604514,0.0019094605,0.0011630434,0.001758591,0.0041559557,0.003027534,0.0020016027,0.012626399],"category_scores_gemma":[0.009875965,0.0011101041,0.0012354396,0.0015214665,0.0017609409,0.0038536498,0.0036869997,0.0031024034,0.0020431012],"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.00053686294,0.0002450682,0.0011987095,0.00031497897,0.00006464736,0.000235969,0.000443864,0.07053644,0.016082352,0.78421944,0.0059337397,0.12018803],"study_design_scores_gemma":[0.00007089253,0.00007367264,0.00018658253,0.000043654676,0.00004746359,0.00013631949,0.00006859034,0.5697501,0.0047290092,0.421023,0.0038226114,0.000048079804],"about_ca_topic_score_codex":0.0019275685,"about_ca_topic_score_gemma":0.0035897715,"teacher_disagreement_score":0.012626399,"about_ca_system_score_codex":0.001761941,"about_ca_system_score_gemma":0.0020299377,"threshold_uncertainty_score":0.042239547},"labels":[],"label_agreement":null},{"id":"W1480437861","doi":"10.1007/3-540-44706-7_8","title":"On the Interpolation Attacks on Block Ciphers","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lagrange polynomial; Polynomial interpolation; Interpolation (computer graphics); Polynomial; Discrete mathematics; Algebraic function; Matrix polynomial; Algebra over a field; Algebraic number; Linear interpolation; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.018221020170992308,"score_gpt":0.24229249926363322,"score_spread":0.2240714790926409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480437861","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19745572,0.010431253,0.4685958,0.007046366,0.0012164623,0.00025568224,0.0005760199,0.00068892346,0.31373373],"genre_scores_gemma":[0.8891115,0.009202448,0.03899891,0.00063817966,0.0014035838,0.00019237598,0.000405767,0.00021952791,0.05982761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872524,0.0004049773,0.000048978312,0.00010548156,0.0004512221,0.00026410545],"domain_scores_gemma":[0.9970324,0.0019112774,0.0001906305,0.00060789724,0.00017738291,0.00008043287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015787128,0.0011296392,0.000987117,0.0016061501,0.0010692318,0.002089852,0.0008063894,0.001455765,0.007258217],"category_scores_gemma":[0.004719995,0.00062990864,0.00091005914,0.0015961697,0.0034304322,0.005778474,0.0025651143,0.0035670719,0.0014908066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026923761,0.000037001308,0.00018799613,0.000072798604,0.000017781616,0.000082382736,0.00012489394,0.014498732,0.0023763604,0.94557285,0.0044298135,0.032330148],"study_design_scores_gemma":[0.000040764462,0.000054649372,0.00017410005,0.0000554578,0.00001537573,0.00017155377,0.00003052957,0.03525443,0.002782164,0.9519494,0.0094510885,0.000020343654],"about_ca_topic_score_codex":0.00036462708,"about_ca_topic_score_gemma":0.00025508908,"teacher_disagreement_score":0.007258217,"about_ca_system_score_codex":0.0011539062,"about_ca_system_score_gemma":0.000673999,"threshold_uncertainty_score":0.024281144},"labels":[],"label_agreement":null},{"id":"W1480463768","doi":"10.1007/978-3-642-37401-2_31","title":"Finding Diverse Friends in Social Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Manitoba","funders":"","keywords":"Friendship; Centrality; Social network (sociolinguistics); Computer science; Social network analysis; Data science; Range (aeronautics); Tree (set theory); World Wide Web; Internet privacy; Social media; Psychology; Social psychology; Mathematics; Engineering","score_opus":0.01818432171563378,"score_gpt":0.262725370854987,"score_spread":0.2445410491393532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480463768","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.477669,0.010302313,0.47227296,0.0029058654,0.00031256236,0.00024830922,0.0022720336,0.00065902,0.03335804],"genre_scores_gemma":[0.8519749,0.004131673,0.121701136,0.00024853737,0.0006172838,0.00014931404,0.0026754837,0.00015030784,0.018351238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919885,0.0002392121,0.00003538069,0.00028003126,0.0001819413,0.000064678025],"domain_scores_gemma":[0.9963883,0.002764214,0.00023495615,0.00027770756,0.0001566089,0.000178316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007280414,0.00076069706,0.00092172204,0.0027992162,0.0017273697,0.00206147,0.0013270943,0.0016287008,0.0041267187],"category_scores_gemma":[0.0064255176,0.0006881485,0.00085210736,0.0031749893,0.0007589336,0.0056516593,0.0019903195,0.0011056303,0.0012292132],"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.0007049206,0.00046573443,0.059342135,0.0015751625,0.00096090947,0.0017780531,0.004989844,0.096033335,0.014976798,0.14786287,0.043138605,0.6281716],"study_design_scores_gemma":[0.00008084371,0.00022367161,0.016988944,0.00024098514,0.00041795807,0.0025807929,0.0031835595,0.55820143,0.00633538,0.3800255,0.03162792,0.00009306812],"about_ca_topic_score_codex":0.00074390136,"about_ca_topic_score_gemma":0.0024774086,"teacher_disagreement_score":0.0041267187,"about_ca_system_score_codex":0.00039177426,"about_ca_system_score_gemma":0.00017623373,"threshold_uncertainty_score":0.01380527},"labels":[],"label_agreement":null},{"id":"W1480499607","doi":"10.1007/978-3-642-25011-8_18","title":"Enumerating Tatami Mat Arrangements of Square Grids","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","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":"University of Victoria","funders":"","keywords":"Square tiling; Combinatorics; Square (algebra); Grid; Dimer; Parity (physics); Monomer; Point (geometry); Mathematics; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.046175806039117744,"score_gpt":0.2939968108633968,"score_spread":0.24782100482427905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480499607","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.45526752,0.0020896227,0.29537502,0.0010959198,0.00063574186,0.00019679102,0.002051031,0.0012231653,0.24206512],"genre_scores_gemma":[0.72199893,0.002070387,0.17154579,0.0004365353,0.0003292041,0.00029106712,0.004393333,0.0006801902,0.09825457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996352,0.00006856514,0.00003234149,0.000068365145,0.000110863184,0.00008468118],"domain_scores_gemma":[0.99933463,0.0003270644,0.000052516883,0.00014221827,0.00007766008,0.00006586113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002833723,0.0007222167,0.00085173076,0.0013083422,0.0013623663,0.0022679835,0.0011777079,0.00071336864,0.018586123],"category_scores_gemma":[0.0016928577,0.000816428,0.00087266846,0.0021393744,0.0011218741,0.0035504976,0.0022180227,0.002566099,0.0036571575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012497653,0.000051723804,0.0010405811,0.00028140325,0.000025536445,0.00015037844,0.0007085074,0.004699593,0.005166174,0.9043603,0.011885907,0.07150491],"study_design_scores_gemma":[0.00002527427,0.000046652414,0.0006026253,0.00005672433,0.000031337175,0.0002644565,0.0003261658,0.009856624,0.0030155615,0.9612892,0.024463873,0.00002139169],"about_ca_topic_score_codex":0.0005957391,"about_ca_topic_score_gemma":0.0013135737,"teacher_disagreement_score":0.018586123,"about_ca_system_score_codex":0.00072965387,"about_ca_system_score_gemma":0.00043006428,"threshold_uncertainty_score":0.062176824},"labels":[],"label_agreement":null},{"id":"W1480664545","doi":"10.1007/978-3-642-15979-4_31","title":"Network Decontamination with Temporal Immunity by Cellular Automata","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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 Ottawa","funders":"","keywords":"Computer science; Human decontamination; Automaton; Set (abstract data type); Distributed computing; Process (computing); Cellular automaton; Grid; Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.008417724696126465,"score_gpt":0.21334596251043272,"score_spread":0.20492823781430625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480664545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15578058,0.0006420223,0.82093793,0.0006129223,0.00036667878,0.00008327387,0.000058429727,0.0017523245,0.019765884],"genre_scores_gemma":[0.93362296,0.0002987217,0.057445046,0.00019000874,0.000061114304,0.000075273245,0.000072019524,0.00016091819,0.0080740545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956876,0.000100727084,0.0000240387,0.000099171135,0.00010672385,0.00010054886],"domain_scores_gemma":[0.9986706,0.000509934,0.00008416034,0.0005030649,0.00016934366,0.00006302969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042238948,0.00046056812,0.0007810943,0.00044160368,0.0005435331,0.00091534376,0.001262562,0.0007231747,0.0034598524],"category_scores_gemma":[0.002609269,0.00026008874,0.0007997231,0.00028955287,0.0011437698,0.0013876258,0.0017833606,0.001235002,0.0005192705],"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.0005488424,0.00019397409,0.0010865992,0.00029489867,0.000101218015,0.000451904,0.00039749502,0.3948569,0.075455785,0.40531313,0.005106347,0.11619294],"study_design_scores_gemma":[0.00003071534,0.00009774374,0.000121800076,0.000017602442,0.000033912547,0.00012879603,0.0000543328,0.84662974,0.019188462,0.12883955,0.0048403926,0.00001692171],"about_ca_topic_score_codex":0.0007979129,"about_ca_topic_score_gemma":0.0007248538,"teacher_disagreement_score":0.0034598524,"about_ca_system_score_codex":0.0005209764,"about_ca_system_score_gemma":0.00041862484,"threshold_uncertainty_score":0.011574328},"labels":[],"label_agreement":null},{"id":"W1480670195","doi":"10.1007/11666806_62","title":"A Fictitious Domain Method for Particle Sedimentation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cyclone Separators and Fluid Dynamics","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":"University of Alberta","funders":"","keywords":"Lagrange multiplier; Fictitious domain method; Domain (mathematical analysis); Multiplier (economics); Mathematics; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.007817462913240794,"score_gpt":0.24433694300108505,"score_spread":0.23651948008784426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480670195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011692522,0.00016891325,0.995141,0.00004660005,0.00016424507,0.000030164596,0.000027443499,0.00021100126,0.0030413086],"genre_scores_gemma":[0.030818945,0.00039598884,0.95048165,0.00014801812,0.00010329173,0.00018539057,0.00015527428,0.0003662263,0.017345255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997211,0.00007689052,0.000011969766,0.000039211438,0.00013249899,0.000018352319],"domain_scores_gemma":[0.99955016,0.0001862031,0.000014128098,0.0000987626,0.000120322125,0.000030337857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802164,0.0006063906,0.000727324,0.0007664936,0.00079605106,0.00081274944,0.0021863335,0.001253587,0.008270843],"category_scores_gemma":[0.0018993284,0.000381053,0.00069019536,0.0006198203,0.00091747474,0.0010789196,0.001603148,0.0017596981,0.0033595501],"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.00021919695,0.0001913569,0.00035473827,0.00057422864,0.00008527792,0.00024828664,0.00026718047,0.13374828,0.041468743,0.41686624,0.017130086,0.38884637],"study_design_scores_gemma":[0.000028702474,0.00003732895,0.00010081624,0.000027390783,0.000014354789,0.00013382886,0.000016372262,0.92086935,0.0065524853,0.041052345,0.031140141,0.000026793146],"about_ca_topic_score_codex":0.0012514925,"about_ca_topic_score_gemma":0.0013608614,"teacher_disagreement_score":0.008270843,"about_ca_system_score_codex":0.0004206843,"about_ca_system_score_gemma":0.0007578925,"threshold_uncertainty_score":0.027668655},"labels":[],"label_agreement":null},{"id":"W1480718878","doi":"10.1007/11841036_49","title":"I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.008285170191687717,"score_gpt":0.22636593809615943,"score_spread":0.2180807679044717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480718878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16389321,0.00092235685,0.774741,0.0010542802,0.0002633458,0.00041177144,0.002066433,0.007097966,0.049549654],"genre_scores_gemma":[0.49994755,0.00045541162,0.4803363,0.0002312652,0.00008730896,0.00033033118,0.0023589365,0.0012405461,0.015012327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990845,0.00013654093,0.000057476358,0.00022449146,0.00025184685,0.00024508854],"domain_scores_gemma":[0.9971073,0.0014110986,0.00027013113,0.0007545673,0.00024486354,0.00021192223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458858,0.0016086907,0.0011099143,0.0010523681,0.0009375218,0.0014366495,0.0028835614,0.0011113791,0.011096046],"category_scores_gemma":[0.0050534518,0.0005821463,0.0007160908,0.0021878746,0.0006875648,0.0029376377,0.003359288,0.0014244716,0.0023378024],"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.002473726,0.0006506498,0.0014875479,0.00092889636,0.00008149617,0.00036844722,0.00042508228,0.37713966,0.040014148,0.043704644,0.03680397,0.49592176],"study_design_scores_gemma":[0.00029071147,0.00028968832,0.0004921039,0.00005979003,0.00006285632,0.00017433452,0.00027984046,0.8757886,0.021416899,0.09374043,0.0073689027,0.00003580284],"about_ca_topic_score_codex":0.002335886,"about_ca_topic_score_gemma":0.0057143294,"teacher_disagreement_score":0.011096046,"about_ca_system_score_codex":0.001047923,"about_ca_system_score_gemma":0.0016430622,"threshold_uncertainty_score":0.037120044},"labels":[],"label_agreement":null},{"id":"W1480727843","doi":"10.1007/11569596_97","title":"Recovering the Lattice of Repetitive Sub-functions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Lattice (music); Algorithm; Physics","score_opus":0.014731412835415196,"score_gpt":0.2342191281384933,"score_spread":0.2194877153030781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480727843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09891814,0.0003562244,0.8901035,0.0002995458,0.00012509864,0.000031773623,0.00031752855,0.0010749416,0.008773271],"genre_scores_gemma":[0.5415592,0.00056851795,0.43770236,0.00021340142,0.00023335757,0.000069383284,0.0014072203,0.00059641514,0.017650085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993519,0.00013535639,0.00003034243,0.00009729283,0.00030035138,0.00008477053],"domain_scores_gemma":[0.9983791,0.00054563,0.00010243879,0.000644636,0.00021718892,0.00011090745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500569,0.000716695,0.0008873072,0.0011533217,0.00051350525,0.0012998193,0.0011115819,0.0010328164,0.0047534667],"category_scores_gemma":[0.0036101784,0.00046465066,0.0005481769,0.0011116215,0.0010534498,0.0020110703,0.0014439959,0.0020107755,0.0024768831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008492675,0.00019896375,0.0020927882,0.00032844598,0.000076748525,0.00082457135,0.00031819692,0.095521994,0.08017903,0.24947476,0.013825589,0.5563096],"study_design_scores_gemma":[0.000043544955,0.00012104776,0.0006415673,0.000034251887,0.00001858517,0.00082904036,0.00018381445,0.70539916,0.027004745,0.25684366,0.008839194,0.000041464868],"about_ca_topic_score_codex":0.0004551226,"about_ca_topic_score_gemma":0.0007060203,"teacher_disagreement_score":0.0047534667,"about_ca_system_score_codex":0.0002939678,"about_ca_system_score_gemma":0.00044097626,"threshold_uncertainty_score":0.015901923},"labels":[],"label_agreement":null},{"id":"W1480732106","doi":"10.1007/3-540-44469-6_9","title":"Dynamic Reconfiguration Algorithm: Dynamically Tuning Multiple Buffer Pools","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":30,"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); Queen's University","funders":"","keywords":"Computer science; Buffer (optical fiber); Control reconfiguration; Database transaction; Database; Write buffer; Distributed computing; Workload; Set (abstract data type); Parallel computing; Operating system; Embedded system; Cache algorithms","score_opus":0.010511875499685025,"score_gpt":0.23549483995184675,"score_spread":0.22498296445216173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480732106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10349041,0.0012997948,0.86981905,0.0003114335,0.00028048092,0.0002032054,0.00018947729,0.017525246,0.0068809227],"genre_scores_gemma":[0.6220597,0.00021284177,0.37203303,0.00024316301,0.000071861716,0.00018107964,0.0002879558,0.00066825177,0.0042421287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992512,0.00016024918,0.000051510666,0.00022990478,0.00018415146,0.00012305434],"domain_scores_gemma":[0.9988201,0.00046015525,0.00010622166,0.0002737538,0.00022526513,0.00011446854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010843225,0.0011229856,0.001079194,0.001263602,0.0007856113,0.0015714063,0.0036232653,0.0009179753,0.0048806416],"category_scores_gemma":[0.003355379,0.00059071014,0.0003227976,0.0010760316,0.00043967212,0.001998969,0.0012326697,0.0007881168,0.0008255989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014386867,0.00047133936,0.002013902,0.00016011515,0.00011468106,0.000109185385,0.00015907302,0.16560662,0.051271237,0.0052697975,0.012496339,0.76088905],"study_design_scores_gemma":[0.0001874376,0.00017663282,0.00053564116,0.000015070366,0.000070196795,0.00011863079,0.000048493304,0.96402776,0.02672732,0.0035986598,0.004457591,0.00003660558],"about_ca_topic_score_codex":0.0031037854,"about_ca_topic_score_gemma":0.0037292643,"teacher_disagreement_score":0.0048806416,"about_ca_system_score_codex":0.00096115284,"about_ca_system_score_gemma":0.001420468,"threshold_uncertainty_score":0.016327381},"labels":[],"label_agreement":null},{"id":"W1480764567","doi":"10.1007/978-3-540-68825-9_14","title":"Comparison of Pleomorphic and Structural Features Used for Breast Cancer Malignancy Classification","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Malignancy; Grading (engineering); Support vector machine; Breast cancer; Computer science; Artificial intelligence; Cancer; Pattern recognition (psychology); Medicine; Pathology; Biology; Internal medicine","score_opus":0.03646471651196816,"score_gpt":0.3026271346907655,"score_spread":0.2661624181787974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480764567","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.9536018,0.0045850445,0.03520161,0.00013573564,0.00013246671,0.000076358076,0.0014717064,0.0007864483,0.0040089665],"genre_scores_gemma":[0.9809693,0.0008229658,0.014826523,0.00001927745,0.00004697405,0.00002187396,0.0018992659,0.000068591835,0.0013252015],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965227,0.000061081526,0.000039063027,0.0000580286,0.00014908756,0.000040414176],"domain_scores_gemma":[0.9980742,0.0011480884,0.00012791115,0.00010046691,0.00047241608,0.00007690301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089855905,0.00039583247,0.00040139264,0.0026559832,0.00016333305,0.0007408949,0.0003552166,0.00046005961,0.0020581705],"category_scores_gemma":[0.0029855827,0.00014188395,0.0005486222,0.0012472633,0.00013981007,0.0006584194,0.00028505066,0.00021224223,0.0006688206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005918763,0.00024908799,0.087065965,0.00051881856,0.00041037012,0.00044206105,0.00017216543,0.010674459,0.12471614,0.00050880044,0.003344843,0.7659786],"study_design_scores_gemma":[0.00024542448,0.0033015842,0.5646175,0.00016590771,0.0017055337,0.004762336,0.0006293847,0.28775752,0.12761293,0.0014418483,0.0076152077,0.00014484397],"about_ca_topic_score_codex":0.0010584752,"about_ca_topic_score_gemma":0.001318813,"teacher_disagreement_score":0.0026559832,"about_ca_system_score_codex":0.000207103,"about_ca_system_score_gemma":0.00016675261,"threshold_uncertainty_score":0.00688529},"labels":[],"label_agreement":null},{"id":"W1480798218","doi":"10.1007/978-3-642-10772-6_23","title":"Method-Specific Java Access Control via RMI Proxy Objects Using Annotations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Java; Programming language; Proxy (statistics); Operating system; Machine learning","score_opus":0.04444871022767824,"score_gpt":0.3214490313710631,"score_spread":0.2770003211433849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480798218","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.0072100274,0.0001833069,0.92348844,0.00013060846,0.00013923619,0.00013622316,0.00018590843,0.050046306,0.018479854],"genre_scores_gemma":[0.37154955,0.0006673041,0.52792865,0.0005071586,0.0002681839,0.0005571163,0.0017868768,0.0248404,0.071894795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996543,0.0006059554,0.00031956952,0.000568427,0.0015163478,0.00044673152],"domain_scores_gemma":[0.9933009,0.0018417743,0.00035416588,0.003755772,0.0005584118,0.00018889629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037567322,0.0011303885,0.0010885476,0.0011363345,0.0009952921,0.0039758296,0.002657684,0.0013773424,0.011188692],"category_scores_gemma":[0.007214572,0.0013142294,0.0011753539,0.0010294052,0.0019314289,0.0059222314,0.0031910464,0.0036028584,0.0067672413],"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.0008250498,0.0003268514,0.0019746074,0.0007414056,0.000084754996,0.00058408314,0.002242983,0.0070864633,0.05855854,0.44117507,0.030514807,0.45588535],"study_design_scores_gemma":[0.00024114262,0.00022757103,0.0018682807,0.00043169374,0.000271178,0.0010820618,0.00022233221,0.14245884,0.2750117,0.23653877,0.3413558,0.00029059543],"about_ca_topic_score_codex":0.0014552625,"about_ca_topic_score_gemma":0.0017592794,"teacher_disagreement_score":0.011188692,"about_ca_system_score_codex":0.0011856164,"about_ca_system_score_gemma":0.001430171,"threshold_uncertainty_score":0.03742987},"labels":[],"label_agreement":null},{"id":"W1480815731","doi":"10.1007/978-3-540-30494-4_8","title":"Combining Equivalence Verification and Completion Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Modular design; Sobel operator; Formal equivalence checking; Computer engineering; Equivalence (formal languages); Functional verification; Implementation; Formal verification; Algorithm; Programming language; Theoretical computer science; Artificial intelligence; Edge detection","score_opus":0.03864510337095927,"score_gpt":0.28010561299832787,"score_spread":0.2414605096273686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480815731","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.0038748279,0.00023661027,0.9818507,0.00019716902,0.00008060092,0.00012092422,0.000043724198,0.0018151698,0.011780347],"genre_scores_gemma":[0.31159177,0.00078850315,0.66627306,0.0003419266,0.00023091912,0.00036220296,0.0007474156,0.0021264069,0.017537724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99261934,0.0025447195,0.00035667693,0.0011136305,0.0027967899,0.0005688232],"domain_scores_gemma":[0.99170214,0.0045750365,0.00018777067,0.0024490755,0.00093068933,0.00015522499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00631821,0.0013757272,0.0017048257,0.0021044603,0.0010486975,0.0035030958,0.0029833196,0.0013241658,0.008997709],"category_scores_gemma":[0.013490494,0.0013097972,0.0020812626,0.0016104133,0.004417514,0.011190709,0.005692532,0.0042666476,0.0028104673],"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.00021138428,0.0002113746,0.0002541006,0.00040300618,0.000054238706,0.0001148928,0.00030510934,0.015375555,0.0060732374,0.65121853,0.0064235907,0.31935492],"study_design_scores_gemma":[0.00006449109,0.00007798149,0.00016395948,0.00010693851,0.000060419854,0.0001425381,0.00006277886,0.103352465,0.01898535,0.85662836,0.020311626,0.000043018055],"about_ca_topic_score_codex":0.0013627463,"about_ca_topic_score_gemma":0.0012989356,"teacher_disagreement_score":0.008997709,"about_ca_system_score_codex":0.0013558278,"about_ca_system_score_gemma":0.002215422,"threshold_uncertainty_score":0.033414304},"labels":[],"label_agreement":null},{"id":"W1480821888","doi":"10.1007/978-3-540-69057-3_108","title":"HAMLAT: A HAML-Based Authoring Tool for Haptic Application Development","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Haptic technology; Programmer; Graphics; Rendering (computer graphics); Human–computer interaction; Visual programming language; Multimedia; Virtual machine; Computer graphics (images); Simulation; Embedded system; Programming language","score_opus":0.01812986554937465,"score_gpt":0.22572667363999108,"score_spread":0.20759680809061642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480821888","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.003650523,0.00035979477,0.9110052,0.0001054323,0.00015453712,0.00010290691,0.0009075264,0.06732477,0.016389288],"genre_scores_gemma":[0.069595225,0.0010916822,0.8267873,0.0004381402,0.00014594405,0.0004888488,0.0044051935,0.029056601,0.067991085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993631,0.000090426576,0.00004628273,0.0000796874,0.00037881164,0.000041715346],"domain_scores_gemma":[0.99838126,0.0010229469,0.00006981405,0.00022527893,0.00021758847,0.00008307259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071386504,0.0012143048,0.00061892753,0.0009858871,0.00035965414,0.0013977948,0.0014663704,0.0012019938,0.043341022],"category_scores_gemma":[0.002691668,0.0009794916,0.00070388254,0.00066090835,0.00048027682,0.001771629,0.0017694252,0.0016119005,0.015192123],"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.00027081594,0.000101622056,0.00048084324,0.0015348183,0.000053884,0.0007758856,0.0009973409,0.0076974193,0.12843145,0.020526303,0.116195954,0.72293365],"study_design_scores_gemma":[0.00018453725,0.00020828073,0.0012831473,0.00036286996,0.00009052803,0.0030197361,0.00013243094,0.13738076,0.18663235,0.021487659,0.64900863,0.00020901815],"about_ca_topic_score_codex":0.00036619033,"about_ca_topic_score_gemma":0.000889807,"teacher_disagreement_score":0.043341022,"about_ca_system_score_codex":0.0003465046,"about_ca_system_score_gemma":0.0004250209,"threshold_uncertainty_score":0.14499015},"labels":[],"label_agreement":null},{"id":"W1480870385","doi":"10.1007/11801412_8","title":"Detecting Impersonation Attacks in Future Wireless and Mobile Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer security; Intrusion detection system; Wireless; Wireless network; Simple (philosophy); Wireless sensor network; Intrusion; Computer network; Telecommunications","score_opus":0.007022978214900874,"score_gpt":0.21878951156249193,"score_spread":0.21176653334759105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480870385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46325865,0.006133888,0.4829131,0.0011429989,0.00043392615,0.00021954214,0.0004372029,0.0050573824,0.04040335],"genre_scores_gemma":[0.9222271,0.001871084,0.061001565,0.00014151032,0.00014397365,0.000032839012,0.00042600578,0.00016030495,0.013995701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992557,0.0000898294,0.000035436464,0.00009684396,0.00040810488,0.000114129114],"domain_scores_gemma":[0.9975311,0.0012080921,0.00031548465,0.00040053585,0.0004762695,0.00006851635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227749,0.0005987116,0.0004880483,0.0010670237,0.00038184188,0.0011471852,0.00078394025,0.0012193954,0.0022128462],"category_scores_gemma":[0.0040974906,0.00035678523,0.00027125754,0.0004894249,0.00037957955,0.003461951,0.00067303237,0.000869369,0.0010393314],"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.00046638824,0.00027157346,0.025490763,0.00031779966,0.00009093102,0.001540148,0.0006098056,0.058164105,0.053050578,0.015204783,0.013657292,0.8311358],"study_design_scores_gemma":[0.00003154143,0.00063107617,0.016437205,0.00013634522,0.00015297314,0.008472087,0.00060688355,0.8047531,0.101395525,0.030130984,0.03717656,0.00007573824],"about_ca_topic_score_codex":0.0006440182,"about_ca_topic_score_gemma":0.00089565234,"teacher_disagreement_score":0.0022128462,"about_ca_system_score_codex":0.00038004972,"about_ca_system_score_gemma":0.00022031355,"threshold_uncertainty_score":0.007402718},"labels":[],"label_agreement":null},{"id":"W1480892648","doi":"10.1007/978-3-540-73460-4_7","title":"Utilization of a Set of Software Engineering Roles for a Multinational Organization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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":"Bombardier (Canada); École de Technologie Supérieure","funders":"","keywords":"Computer science; Software engineering; Software development; Set (abstract data type); Session (web analytics); Software; Social software engineering; Software project management; Engineering management; Software construction; Systems engineering; World Wide Web; Programming language; Engineering","score_opus":0.02939136066884548,"score_gpt":0.2790978088005775,"score_spread":0.249706448131732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480892648","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.3802917,0.0002862354,0.23290722,0.0048735114,0.00015314686,0.0004414362,0.00014267466,0.0013221122,0.37958196],"genre_scores_gemma":[0.7959593,0.00015803728,0.1718213,0.00026520915,0.000015489717,0.00017628132,0.00012087557,0.00013796423,0.031345557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976299,0.0011749336,0.00013456003,0.0002300928,0.0004417249,0.00038889106],"domain_scores_gemma":[0.9964372,0.000784195,0.00033399687,0.000694924,0.00068823237,0.0010614793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035141555,0.0004465577,0.00015611062,0.0010266438,0.0033441272,0.0041219164,0.00093838695,0.00072698237,0.0045049954],"category_scores_gemma":[0.004547657,0.0003260327,0.00041584525,0.00072352693,0.002018229,0.003259773,0.0026367665,0.0012886531,0.0012983826],"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.00022885267,0.0007450183,0.025294226,0.00023846723,0.000032509575,0.0010991426,0.03542942,0.0048773666,0.018250408,0.5796797,0.016744083,0.31738073],"study_design_scores_gemma":[0.00010625447,0.001766785,0.042036925,0.0010604725,0.00010047919,0.0039245533,0.057694804,0.088199385,0.024687443,0.21543513,0.5647435,0.0002442209],"about_ca_topic_score_codex":0.004391369,"about_ca_topic_score_gemma":0.009701378,"teacher_disagreement_score":0.0045049954,"about_ca_system_score_codex":0.0018278421,"about_ca_system_score_gemma":0.005957874,"threshold_uncertainty_score":0.018584847},"labels":[],"label_agreement":null},{"id":"W1481022196","doi":"10.1007/978-3-540-45193-8_11","title":"hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":69,"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":"Constraint programming; Computer science; Constraint satisfaction; Scheduling (production processes); Constraint satisfaction problem; Mathematical optimization; Modular design; Heuristic; Benchmark (surveying); Nurse scheduling problem; Constraint logic programming; Job shop scheduling; Operations research; Artificial intelligence; Flow shop scheduling; Programming language; Schedule; Mathematics; Stochastic programming","score_opus":0.011529929320663341,"score_gpt":0.26068342799336625,"score_spread":0.2491534986727029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481022196","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.0028652677,0.00043090258,0.96761525,0.0008318988,0.00021611,0.00023430772,0.0019004737,0.006778736,0.019127082],"genre_scores_gemma":[0.031444423,0.00086433085,0.9504527,0.00036223192,0.000118311225,0.000433502,0.0012093873,0.0017722979,0.013342759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.00015443312,0.000034923414,0.000069929105,0.00019159817,0.000046039062],"domain_scores_gemma":[0.9989574,0.0007231379,0.00005142024,0.00005695742,0.00013958766,0.00007150195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012343086,0.0011964001,0.00086822547,0.0007061528,0.0009249503,0.0017839185,0.0021154578,0.0011354734,0.03189925],"category_scores_gemma":[0.003446813,0.0009221384,0.0009637517,0.0019219512,0.0006073554,0.0014451157,0.0017374147,0.0017550071,0.0034686446],"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.00031264973,0.00021377686,0.0010322491,0.0014393433,0.00012954275,0.00087649707,0.00092031836,0.27453554,0.0050680595,0.17797084,0.17143692,0.3660643],"study_design_scores_gemma":[0.00020458431,0.00005230951,0.0004897764,0.00020989378,0.000072750525,0.0003478046,0.00024811664,0.7232875,0.0050274157,0.08396538,0.18602198,0.00007236351],"about_ca_topic_score_codex":0.020113468,"about_ca_topic_score_gemma":0.036953103,"teacher_disagreement_score":0.03189925,"about_ca_system_score_codex":0.0007515663,"about_ca_system_score_gemma":0.0015712715,"threshold_uncertainty_score":0.10671359},"labels":[],"label_agreement":null},{"id":"W1481028594","doi":"10.1007/3-540-44585-4_1","title":"Software Documentation and the Verification Process","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"McMaster University","funders":"","keywords":"Documentation; Computer science; Software engineering; Notation; Software documentation; Programming language; Software verification; Software; Process (computing); Verification and validation; Formal specification; Software development process; Software development; Software construction; Engineering","score_opus":0.015785737219104094,"score_gpt":0.269389319836322,"score_spread":0.25360358261721794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481028594","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.00973724,0.02958347,0.8217342,0.007761028,0.00076696987,0.00012583367,0.00012510437,0.0015116828,0.12865448],"genre_scores_gemma":[0.43442103,0.02781386,0.4421893,0.0011515862,0.0008295011,0.00034250598,0.00048654785,0.0009894562,0.091776274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943,0.002796422,0.00033879082,0.0004529428,0.0018920868,0.00021970905],"domain_scores_gemma":[0.97963434,0.014316657,0.00086062285,0.003134197,0.0018680303,0.000186086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006050372,0.00073798286,0.000765896,0.0023732032,0.0014560928,0.0057567004,0.0013342078,0.002442031,0.007337806],"category_scores_gemma":[0.029075589,0.0010579192,0.0008270729,0.0017764972,0.0058851433,0.008457927,0.002274682,0.0038632057,0.0026990937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034544228,0.000032366148,0.00021865506,0.0002401788,0.000012186727,0.00012778873,0.00066194363,0.003497143,0.00069453847,0.82438195,0.007366797,0.16273198],"study_design_scores_gemma":[0.000023665374,0.00003064084,0.00017594018,0.00046790592,0.000016536573,0.00024593325,0.00011748354,0.010003812,0.0017639945,0.9157748,0.071356006,0.000023212291],"about_ca_topic_score_codex":0.0021721842,"about_ca_topic_score_gemma":0.0016949397,"teacher_disagreement_score":0.007337806,"about_ca_system_score_codex":0.001598133,"about_ca_system_score_gemma":0.0030131983,"threshold_uncertainty_score":0.03199786},"labels":[],"label_agreement":null},{"id":"W1481102435","doi":"10.1007/11566465_40","title":"Automatic 3D Segmentation of Intravascular Ultrasound Images Using Region and Contour Information","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Coronary Interventions and Diagnostics","field":"Medicine","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":"Computer Research Institute of Montréal; Université de Montréal; Montreal Clinical Research Institute","funders":"","keywords":"Fast marching method; Intravascular ultrasound; Artificial intelligence; Computer science; Computer vision; Segmentation; Active contour model; Image segmentation; Point (geometry); Hausdorff distance; Pattern recognition (psychology); Mathematics; Geometry; Radiology","score_opus":0.01221016878876252,"score_gpt":0.2767408771977472,"score_spread":0.2645307084089847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481102435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03397485,0.00076334825,0.96006334,0.00013702874,0.000057061643,0.00017625792,0.00031599813,0.0033795172,0.0011325948],"genre_scores_gemma":[0.10640315,0.00060287275,0.8903381,0.000108914755,0.0000372422,0.00013835903,0.0005882858,0.0006693691,0.0011136758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917537,0.00013817828,0.000077370954,0.0001560799,0.00035126603,0.0001016578],"domain_scores_gemma":[0.9984548,0.00063065044,0.00016340654,0.00024855149,0.0004421007,0.000060469996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010388928,0.0010337244,0.0013841637,0.00482952,0.00066091184,0.0023676744,0.0012374151,0.0018084326,0.0020297407],"category_scores_gemma":[0.002449813,0.00124382,0.0015473409,0.002447513,0.00062186975,0.0010778321,0.0012351661,0.00094170263,0.0012665741],"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.0005747188,0.00014413754,0.0022664743,0.00035684693,0.000109396584,0.0002555122,0.00033912144,0.030418923,0.25773802,0.004471648,0.004294537,0.69903076],"study_design_scores_gemma":[0.00008496435,0.0001889826,0.007945349,0.00011009441,0.00016145926,0.001155945,0.000097886674,0.8308217,0.14340562,0.0063781603,0.009519912,0.00012995325],"about_ca_topic_score_codex":0.004484666,"about_ca_topic_score_gemma":0.005859736,"teacher_disagreement_score":0.00482952,"about_ca_system_score_codex":0.0007721746,"about_ca_system_score_gemma":0.0017550655,"threshold_uncertainty_score":0.008917093},"labels":[],"label_agreement":null},{"id":"W1481148333","doi":"10.1007/978-3-642-02611-9_12","title":"Nonextensive Entropic Image Registration","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","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":"Concordia University","funders":"","keywords":"Degenerate energy levels; Divergence (linguistics); Image registration; Image (mathematics); Computer science; Artificial intelligence; Tsallis entropy; Kullback–Leibler divergence; Mathematics; Statistical physics; Algorithm; Pattern recognition (psychology); Physics","score_opus":0.010261329795905157,"score_gpt":0.24299581013448437,"score_spread":0.2327344803385792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481148333","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.026765196,0.00087916234,0.9539729,0.00036941556,0.0001184977,0.000021913997,0.000050567694,0.00024023664,0.017582167],"genre_scores_gemma":[0.7421674,0.0016308664,0.18044683,0.00024294657,0.00037209573,0.00006574547,0.0001651105,0.00042600936,0.07448287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967504,0.00006955347,0.000020925625,0.000086638494,0.00012284795,0.000024950314],"domain_scores_gemma":[0.99954337,0.00019947605,0.00006964499,0.00011277245,0.000047797057,0.000026980319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059891416,0.0004234599,0.00075388857,0.0005230615,0.00020379681,0.0008992639,0.00080957235,0.0007735279,0.002985093],"category_scores_gemma":[0.0013569109,0.0003783065,0.0004662975,0.0004536895,0.0013902911,0.0017347406,0.0019423981,0.001144112,0.00075489434],"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.00008814825,0.00005430693,0.0002556399,0.00022598966,0.000080383914,0.00025713485,0.00013797921,0.088891655,0.029755332,0.76388985,0.0027279726,0.11363567],"study_design_scores_gemma":[0.0000105093495,0.00007619964,0.00055236276,0.000024073628,0.000026734077,0.00059779815,0.000024695617,0.53308016,0.012569801,0.4471224,0.005880129,0.0000351321],"about_ca_topic_score_codex":0.00021541104,"about_ca_topic_score_gemma":0.00028486756,"teacher_disagreement_score":0.002985093,"about_ca_system_score_codex":0.00031274222,"about_ca_system_score_gemma":0.00026727453,"threshold_uncertainty_score":0.009986103},"labels":[],"label_agreement":null},{"id":"W1481182985","doi":"10.1007/978-3-540-89454-4_12","title":"Exploring Non-verbal Behavior Models for Believable Characters","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Character (mathematics); Animation; Gesture; Character animation; Variety (cybernetics); Component (thermodynamics); Narrative; Human–computer interaction; Representation (politics); Synchronizing; Multimedia; Computer animation; Artificial intelligence; Computer graphics (images)","score_opus":0.058240679786882625,"score_gpt":0.2328386892653507,"score_spread":0.17459800947846807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481182985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19734403,0.00017392809,0.7922107,0.00037835145,0.000024041421,0.00006664869,0.00027005078,0.00072897685,0.008803217],"genre_scores_gemma":[0.89731926,0.00013307047,0.09719434,0.000055253025,0.0000093540875,0.00009592434,0.0004711798,0.00017517827,0.0045465357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.00015198434,0.000010634656,0.000066389824,0.000051812596,0.00003504385],"domain_scores_gemma":[0.99797803,0.0016340673,0.00010437355,0.00012702458,0.00010921034,0.00004738141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049781596,0.0006264986,0.0003537659,0.000352741,0.00037583912,0.0014127021,0.0013678962,0.0010190561,0.005102413],"category_scores_gemma":[0.004331286,0.0006127184,0.0010082335,0.00027997437,0.0006890719,0.0019842961,0.00090295414,0.001085297,0.0005438239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029563776,0.00027987163,0.004703175,0.0002673896,0.000109050896,0.00036235893,0.002628464,0.74514073,0.009207368,0.16670947,0.0015417043,0.06875485],"study_design_scores_gemma":[0.000006988201,0.000027398062,0.00020179564,0.000008382259,0.000007945819,0.000026971054,0.00015574059,0.96631217,0.00066840573,0.032156464,0.00042322735,0.0000045159513],"about_ca_topic_score_codex":0.004608008,"about_ca_topic_score_gemma":0.005491284,"teacher_disagreement_score":0.005102413,"about_ca_system_score_codex":0.00061141455,"about_ca_system_score_gemma":0.00040887465,"threshold_uncertainty_score":0.01706934},"labels":[],"label_agreement":null},{"id":"W1481227501","doi":"10.1007/978-3-642-15470-6_43","title":"Assessing End-User Programming for a Graphics Development Environment","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Graphics; Human–computer interaction; Set (abstract data type); Visual programming language; Variety (cybernetics); Programming language; Computer graphics (images); Artificial intelligence","score_opus":0.02557930879403684,"score_gpt":0.26926115700004083,"score_spread":0.243681848206004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481227501","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.98432124,0.000056501303,0.0099955015,0.00003902661,0.000008282188,0.00010866324,0.00005798197,0.00041848567,0.004994268],"genre_scores_gemma":[0.9679567,0.000109204564,0.026540153,0.000039958377,0.0000049093314,0.00012730053,0.00032730482,0.00015202629,0.004742427],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972416,0.0011706792,0.00017604615,0.0002899954,0.00097379944,0.00014793531],"domain_scores_gemma":[0.972902,0.018477907,0.00155858,0.001388596,0.0035859835,0.0020869952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002573316,0.0006494345,0.00022479391,0.00081267126,0.00034172286,0.00113937,0.0009766374,0.00066617416,0.0025242632],"category_scores_gemma":[0.026832543,0.00031754302,0.00027803626,0.00037900262,0.00024078127,0.0012328182,0.0009395799,0.0006893171,0.00094931247],"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.0020982702,0.005070045,0.33375886,0.00036871174,0.00011925662,0.00031314275,0.014609636,0.0066030454,0.044059735,0.000988731,0.004692134,0.5873184],"study_design_scores_gemma":[0.00018115649,0.011857962,0.8687013,0.0002296042,0.00020980017,0.0010202208,0.006087089,0.052073404,0.04563689,0.001368899,0.012478626,0.00015497736],"about_ca_topic_score_codex":0.0015067733,"about_ca_topic_score_gemma":0.003167013,"teacher_disagreement_score":0.002573316,"about_ca_system_score_codex":0.00050071324,"about_ca_system_score_gemma":0.0005574434,"threshold_uncertainty_score":0.013609111},"labels":[],"label_agreement":null},{"id":"W1481252923","doi":"10.1007/978-3-642-15618-2_2","title":"BPM in Cloud Architectures: Business Process Management with SLAs and Events","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Business process; Computer science; Process management; Business process management; Process (computing); Business; Work in process; Operating system","score_opus":0.009334095743636693,"score_gpt":0.21521663876846261,"score_spread":0.20588254302482592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481252923","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.00523771,0.0062913755,0.94801193,0.0026238929,0.0008062374,0.00009672657,0.00011916263,0.0017816165,0.03503128],"genre_scores_gemma":[0.19964308,0.014669842,0.74877554,0.0009900976,0.001254193,0.00020149547,0.00084843766,0.0009352746,0.032682087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894935,0.0003597431,0.000073934614,0.0001431906,0.00035076027,0.00012309334],"domain_scores_gemma":[0.9994849,0.00017500448,0.00004682418,0.00014749382,0.00009158353,0.00005409048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001829293,0.00074645743,0.0005859237,0.00071086036,0.0007822247,0.0042326422,0.0015687682,0.0014136737,0.0027749992],"category_scores_gemma":[0.0017657444,0.0006658296,0.00064804644,0.0029500104,0.00092248636,0.0050207376,0.0016193759,0.002923903,0.0016993274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005535689,0.000100524034,0.00039638503,0.00038211883,0.000045572608,0.00015515351,0.0006169494,0.020657606,0.0037340166,0.53898376,0.024641866,0.4102307],"study_design_scores_gemma":[0.000031171166,0.000059283848,0.0005419804,0.00037062867,0.00006352929,0.00041963777,0.00022080094,0.18186332,0.0076887463,0.5389472,0.26974043,0.00005319575],"about_ca_topic_score_codex":0.00278836,"about_ca_topic_score_gemma":0.0022041071,"teacher_disagreement_score":0.0042326422,"about_ca_system_score_codex":0.0010864079,"about_ca_system_score_gemma":0.002043382,"threshold_uncertainty_score":0.00967437},"labels":[],"label_agreement":null},{"id":"W1481269160","doi":"10.1007/978-3-642-02930-1_5","title":"Faithful Loops for Aperiodic E-Ordered Monoids","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Aperiodic graph; Computer science; Algebra over a field; Combinatorics; Mathematics; Pure mathematics","score_opus":0.01230811188658492,"score_gpt":0.23358944386566746,"score_spread":0.22128133197908254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481269160","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.39550376,0.0022953989,0.47206008,0.0006791518,0.00057241984,0.00017117347,0.00035671156,0.0018045853,0.1265566],"genre_scores_gemma":[0.95469815,0.0005732609,0.023703484,0.00014093814,0.00019431941,0.00008787082,0.00016509426,0.0001632521,0.02027366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.00016606732,0.00006812705,0.00014439672,0.00022824787,0.00015482806],"domain_scores_gemma":[0.99770397,0.0013567995,0.00016455802,0.00036147138,0.00024974192,0.00016346079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010545739,0.0005802322,0.000496328,0.0014878659,0.0013460142,0.0029465412,0.00072517636,0.000964639,0.0051523685],"category_scores_gemma":[0.003234364,0.00059457484,0.00081847,0.0009201107,0.0030232365,0.0046866136,0.0018870152,0.0019335431,0.0006952533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039252063,0.000020575762,0.000113705435,0.000042630716,0.0000054449415,0.00010962865,0.0006193606,0.00073863065,0.0019191921,0.98701626,0.0003147323,0.00906054],"study_design_scores_gemma":[0.00001535425,0.000028906803,0.00009515472,0.000012689885,0.000008311102,0.00008034624,0.00007534145,0.0019907316,0.0016475683,0.9913777,0.0046565454,0.000011219148],"about_ca_topic_score_codex":0.0005415412,"about_ca_topic_score_gemma":0.00041880982,"teacher_disagreement_score":0.0051523685,"about_ca_system_score_codex":0.001085449,"about_ca_system_score_gemma":0.0004121776,"threshold_uncertainty_score":0.017236412},"labels":[],"label_agreement":null},{"id":"W1481420439","doi":"10.1007/978-3-642-25535-9_11","title":"Profiling-as-a-Service: Adaptive Scalable Resource Profiling for the Cloud in the Cloud","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Profiling (computer programming); Cloud computing; Computer science; Scalability; Provisioning; Web service; Database; Web application; Distributed computing; Operating system; World Wide Web","score_opus":0.03033025041213408,"score_gpt":0.24798543413847704,"score_spread":0.21765518372634296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481420439","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.016238311,0.007163849,0.9362456,0.0021322344,0.000979203,0.00022652614,0.00037564922,0.012896237,0.023742432],"genre_scores_gemma":[0.513016,0.007379961,0.44980046,0.0011783128,0.0006683272,0.00017610242,0.0009110316,0.0011759963,0.02569377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940884,0.00008980736,0.000028997927,0.00010237511,0.00026304356,0.00010700107],"domain_scores_gemma":[0.9995433,0.00012310217,0.00003216541,0.00012798233,0.00010005302,0.00007333766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067147746,0.0008212572,0.0008012887,0.00057960645,0.00066571566,0.0021266856,0.0014769378,0.00092200044,0.0031247328],"category_scores_gemma":[0.0014420789,0.0004901287,0.00038979965,0.0016513035,0.00044857978,0.0027124716,0.0014226144,0.0017036581,0.0016328278],"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.0004980438,0.00018933207,0.0017939599,0.0002997796,0.000087326414,0.00029215487,0.0003399557,0.037156392,0.039188255,0.07103899,0.086829305,0.76228654],"study_design_scores_gemma":[0.000038743154,0.00014314457,0.0020239062,0.00008545825,0.000054589626,0.0008564717,0.00018589373,0.7187583,0.035997495,0.07147471,0.17028333,0.00009798659],"about_ca_topic_score_codex":0.0027054315,"about_ca_topic_score_gemma":0.002942176,"teacher_disagreement_score":0.0031247328,"about_ca_system_score_codex":0.0007917111,"about_ca_system_score_gemma":0.0010308606,"threshold_uncertainty_score":0.010453284},"labels":[],"label_agreement":null},{"id":"W1481436478","doi":"10.1007/978-3-642-13059-5_10","title":"MeSH Represented MEDLINE Query Results","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Information retrieval; Terminology; Usability; Unified Medical Language System; Controlled vocabulary; MEDLINE; Domain (mathematical analysis); World Wide Web; Human–computer interaction","score_opus":0.01643965484155776,"score_gpt":0.2721156647028805,"score_spread":0.2556760098613228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481436478","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01974099,0.0050368803,0.018992882,0.0015110668,0.0017375993,0.0008429891,0.9058339,0.010686327,0.035617404],"genre_scores_gemma":[0.111421235,0.0053014234,0.06900504,0.00090666907,0.00035941848,0.0012319097,0.7838375,0.002034749,0.02590199],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861395,0.00019213204,0.00039884748,0.0003228321,0.00033639118,0.00013581237],"domain_scores_gemma":[0.998133,0.000948701,0.00014842451,0.00011627719,0.0005707556,0.00008294215],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00069804373,0.0019654462,0.0011738462,0.01792766,0.00091897085,0.0030154078,0.0011621342,0.0017130752,0.067919075],"category_scores_gemma":[0.007987692,0.0003888736,0.0012850343,0.01282661,0.0005580548,0.0023111799,0.001747805,0.00077510695,0.023310628],"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.004261466,0.0003516424,0.006254172,0.024387693,0.0006245509,0.0047820536,0.0016537252,0.008085584,0.03758559,0.045626428,0.61448807,0.251899],"study_design_scores_gemma":[0.00032644437,0.0002146775,0.0046489206,0.001599634,0.00053791,0.0021174424,0.00063205295,0.009579548,0.022934256,0.018645795,0.9386477,0.00011558428],"about_ca_topic_score_codex":0.0070211743,"about_ca_topic_score_gemma":0.010083773,"teacher_disagreement_score":0.99930197,"about_ca_system_score_codex":0.001780331,"about_ca_system_score_gemma":0.0024516212,"threshold_uncertainty_score":0.22721195},"labels":[],"label_agreement":null},{"id":"W1481475975","doi":"10.1007/978-3-642-05258-3_6","title":"Compiling Multiply Sectioned Bayesian Networks: A Comparative Study","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Triangulation; Computer science; Set (abstract data type); Inference; Algorithm; Quality (philosophy); Artificial intelligence; SAFER; Process (computing); Theoretical computer science; Programming language; Mathematics","score_opus":0.03539746894820029,"score_gpt":0.2832772840255723,"score_spread":0.247879815077372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481475975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1844285,0.0013750365,0.7884689,0.00062173675,0.0001027663,0.00015989479,0.00044677168,0.0017695761,0.022626847],"genre_scores_gemma":[0.47809055,0.0014283988,0.5122316,0.000103383056,0.0000974957,0.0001228667,0.0011306059,0.0009043191,0.005890792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977447,0.0013100097,0.000101465586,0.00029940202,0.00045783023,0.00008667686],"domain_scores_gemma":[0.9000019,0.08329597,0.002343111,0.008178167,0.0056434274,0.0005374763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071770754,0.00051975943,0.0007958156,0.0018263342,0.0007447177,0.0029102971,0.0015471418,0.00092151127,0.009192157],"category_scores_gemma":[0.084784195,0.0007307721,0.00078881445,0.0026597134,0.0010607014,0.008261645,0.0014691135,0.0013106975,0.001534891],"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.00069167477,0.00018789398,0.010802004,0.0005250329,0.00019074309,0.0004928612,0.0028527572,0.1931633,0.002645025,0.25899813,0.005070344,0.52438027],"study_design_scores_gemma":[0.0000546776,0.00024975534,0.0038189124,0.00021879864,0.00023926943,0.00059887796,0.0011630113,0.5775525,0.0046159024,0.3983937,0.013042994,0.00005159727],"about_ca_topic_score_codex":0.002232507,"about_ca_topic_score_gemma":0.0030821064,"teacher_disagreement_score":0.009192157,"about_ca_system_score_codex":0.0011151513,"about_ca_system_score_gemma":0.0013096168,"threshold_uncertainty_score":0.037956417},"labels":[],"label_agreement":null},{"id":"W148149816","doi":"10.1007/978-3-319-03515-4_12","title":"On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Secret sharing; Computer science; Cheating; Scheme (mathematics); RSS; Computer security; Access structure; Theoretical computer science; Shamir's Secret Sharing; Homomorphic secret sharing; Algorithm; Mathematics; Cryptography; World Wide Web","score_opus":0.017609588989595006,"score_gpt":0.21191658323344859,"score_spread":0.1943069942438536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148149816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04480378,0.0033014505,0.92035484,0.0013392862,0.00017717948,0.00015185215,0.00018947625,0.0002311912,0.029450975],"genre_scores_gemma":[0.86026126,0.0036992137,0.11860322,0.0006666648,0.0006516629,0.00035462584,0.00024359432,0.000518604,0.015001124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99182194,0.0034585148,0.000272255,0.0011053523,0.0022696801,0.0010722125],"domain_scores_gemma":[0.95729023,0.03435463,0.0014708771,0.004872225,0.001615847,0.00039627365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009294343,0.0026641847,0.0037446981,0.0023224643,0.0015037239,0.0048457244,0.005001976,0.0032941876,0.007858016],"category_scores_gemma":[0.03538765,0.0012583361,0.0025008176,0.0044769426,0.008247147,0.013987901,0.006503961,0.004968281,0.0011969239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089846103,0.00015169918,0.0004947008,0.00043946021,0.00018809,0.00014315412,0.0003248553,0.13413253,0.0074234456,0.7924005,0.004173624,0.05922953],"study_design_scores_gemma":[0.000045293673,0.000113090384,0.00023568103,0.00006282799,0.00007896652,0.00016765973,0.000054272015,0.3868597,0.0036540087,0.6070312,0.0016518073,0.000045495235],"about_ca_topic_score_codex":0.00091070187,"about_ca_topic_score_gemma":0.0005084409,"teacher_disagreement_score":0.009294343,"about_ca_system_score_codex":0.00412865,"about_ca_system_score_gemma":0.0019770844,"threshold_uncertainty_score":0.049153805},"labels":[],"label_agreement":null},{"id":"W1481682349","doi":"10.1007/11425274_58","title":"A Distance-Based Algorithm for Clustering Database User Sessions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"York University","funders":"","keywords":"Computer science; Cluster analysis; Benchmark (surveying); Computation; Workload; Data mining; Online transaction processing; Database; Algorithm; Database transaction; Artificial intelligence; Transaction processing","score_opus":0.0233684434842335,"score_gpt":0.2653069685680108,"score_spread":0.24193852508377728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481682349","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.0106780045,0.00029640438,0.9839841,0.000100525605,0.000111961686,0.00028734223,0.00040041297,0.002773315,0.0013679314],"genre_scores_gemma":[0.057824764,0.0001851138,0.93518496,0.000054810305,0.000081477294,0.00026378816,0.0013398734,0.00018802068,0.0048771924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996323,0.00051215413,0.00030913026,0.00083105324,0.0017921218,0.00023253071],"domain_scores_gemma":[0.99678516,0.000858783,0.00016671592,0.0005262151,0.0014439864,0.00021909922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021022994,0.0010540165,0.002019211,0.004859963,0.0018996665,0.00222348,0.004105472,0.001616556,0.005528992],"category_scores_gemma":[0.006524449,0.00061836385,0.0010523068,0.0062384475,0.0006947784,0.0023368406,0.0020697303,0.001297822,0.004352605],"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.0005049717,0.00037780558,0.0019534582,0.00013742421,0.00009703817,0.00003489555,0.00024298966,0.025503134,0.011938149,0.00632979,0.0093353335,0.94354504],"study_design_scores_gemma":[0.00016258954,0.00032282656,0.0035496245,0.00003166065,0.00009376011,0.00040234657,0.00028293583,0.948221,0.017811311,0.011556873,0.01744999,0.000115040195],"about_ca_topic_score_codex":0.011427995,"about_ca_topic_score_gemma":0.015400522,"teacher_disagreement_score":0.011427995,"about_ca_system_score_codex":0.0015896403,"about_ca_system_score_gemma":0.0027660974,"threshold_uncertainty_score":0.02272296},"labels":[],"label_agreement":null},{"id":"W1481719636","doi":"10.1007/11566465_83","title":"Toward Automatic Computer Aided Dental X-ray Analysis Using Level Set Method","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Support vector machine; Segmentation; Artificial intelligence; Pattern recognition (psychology); Scheme (mathematics); Classifier (UML); Computer vision; Image segmentation; Mathematics","score_opus":0.05790426927556042,"score_gpt":0.36032894302337387,"score_spread":0.30242467374781346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481719636","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.0025328735,0.000045080767,0.9960078,0.000033422137,0.0000088219795,0.000036602094,0.000025109559,0.0008354426,0.00047488054],"genre_scores_gemma":[0.031101549,0.00011396326,0.96712923,0.000047598744,0.000010017167,0.000076069824,0.00012946775,0.00020131168,0.0011908638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988537,0.0001752195,0.00005998722,0.00015715249,0.0006728217,0.00008109794],"domain_scores_gemma":[0.9990393,0.00030788657,0.00006743199,0.00015492157,0.0004014095,0.000029080766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159163,0.0010606055,0.0013925266,0.0024029685,0.00073112635,0.002189497,0.0019294075,0.0013684096,0.0053992025],"category_scores_gemma":[0.0021737474,0.0013155293,0.001642707,0.0011901327,0.00067874853,0.0011583345,0.0016524484,0.0017609382,0.00350572],"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.00019408789,0.0001959664,0.0011611328,0.0002858587,0.00011176343,0.00008763633,0.0002057225,0.07275141,0.17585273,0.017417202,0.003634506,0.7281019],"study_design_scores_gemma":[0.000016394146,0.00006355488,0.00083536305,0.000027871058,0.000047808862,0.00014267278,0.000046880134,0.94881296,0.038280614,0.006990605,0.0047052475,0.000029998597],"about_ca_topic_score_codex":0.002571932,"about_ca_topic_score_gemma":0.0038945116,"teacher_disagreement_score":0.0053992025,"about_ca_system_score_codex":0.00063846936,"about_ca_system_score_gemma":0.0021903391,"threshold_uncertainty_score":0.018062115},"labels":[],"label_agreement":null},{"id":"W1481730931","doi":"10.1007/3-540-45028-9_20","title":"A New Median Graph Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Graph; Cluster analysis; Algorithm; Simplex graph; Strength of a graph; Graph bandwidth; Theoretical computer science; Line graph; Voltage graph; Artificial intelligence","score_opus":0.01051008868913729,"score_gpt":0.2209969182802593,"score_spread":0.21048682959112203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481730931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005285523,0.00063879695,0.97467506,0.0005546501,0.00067867036,0.00013322594,0.00034097562,0.0023029777,0.015390098],"genre_scores_gemma":[0.03192486,0.00051816803,0.9478501,0.00042063012,0.00039781036,0.00023672023,0.00092766114,0.0008046327,0.016919384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987091,0.00019436362,0.00006912176,0.00040828422,0.0004931487,0.0001259593],"domain_scores_gemma":[0.9988927,0.00027038244,0.000060520408,0.00038966845,0.00026374523,0.0001229878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008899719,0.0012451487,0.002051908,0.002059847,0.0014138732,0.0025260204,0.0035297275,0.0020383457,0.020786906],"category_scores_gemma":[0.003119823,0.0007552598,0.0015795376,0.0031629405,0.00090145227,0.004404215,0.0041423254,0.0031758843,0.0067438493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003321625,0.00025075,0.0003437897,0.00024439374,0.000100791076,0.000082987346,0.00008693235,0.034384444,0.0070116776,0.118851095,0.050023567,0.78828746],"study_design_scores_gemma":[0.00026881517,0.00018063074,0.0004167849,0.00008842908,0.00012167167,0.00038714882,0.00010952272,0.4823026,0.007813372,0.4100854,0.09815857,0.00006703755],"about_ca_topic_score_codex":0.0014645702,"about_ca_topic_score_gemma":0.002500268,"teacher_disagreement_score":0.020786906,"about_ca_system_score_codex":0.0012536532,"about_ca_system_score_gemma":0.0018120514,"threshold_uncertainty_score":0.06953913},"labels":[],"label_agreement":null},{"id":"W1481733340","doi":"10.1007/11494676_12","title":"Emergent Team Formation: Applying Division of Labour Principles to Robot Soccer","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Insect behavior and control techniques","field":"Agricultural and Biological Sciences","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":"Carleton University","funders":"","keywords":"Division of labour; Agency (philosophy); Flexibility (engineering); Computer science; Division (mathematics); Robot; Human–computer interaction; Work (physics); Knowledge management; Process management; Artificial intelligence; Operations research; Management; Engineering; Sociology","score_opus":0.029690995297597545,"score_gpt":0.2521808020050056,"score_spread":0.22248980670740803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481733340","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.038536057,0.0004525897,0.94681066,0.0004072121,0.00013536256,0.000042646476,0.00002475737,0.000103563405,0.013487194],"genre_scores_gemma":[0.80599725,0.00071057974,0.183579,0.00011535909,0.00013473372,0.00020826257,0.00005433558,0.00015357725,0.009046953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996911,0.00012153116,0.000011845482,0.00003816071,0.00008389837,0.000053455737],"domain_scores_gemma":[0.9991829,0.00046799475,0.000087325476,0.000079016834,0.00009481713,0.000087957094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076270406,0.00039856418,0.0006152223,0.00043527916,0.00069164205,0.0008418602,0.0014030775,0.00070746266,0.0024332106],"category_scores_gemma":[0.0031338807,0.00034900944,0.0006591725,0.00045530594,0.0014621177,0.0011282611,0.0017520572,0.0012067655,0.00026495784],"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.00006556268,0.00007022575,0.00072704867,0.00010792978,0.000054776694,0.00015072164,0.0006123415,0.4243388,0.0022175584,0.5076517,0.0036891517,0.06031412],"study_design_scores_gemma":[0.000021623562,0.000023508714,0.00017025873,0.0000099155595,0.0000064309716,0.000027631753,0.00008152915,0.7214616,0.00027191316,0.27642244,0.0014942557,0.000008923634],"about_ca_topic_score_codex":0.0019813473,"about_ca_topic_score_gemma":0.0020209835,"teacher_disagreement_score":0.0024332106,"about_ca_system_score_codex":0.0006395735,"about_ca_system_score_gemma":0.0007378465,"threshold_uncertainty_score":0.008139908},"labels":[],"label_agreement":null},{"id":"W1481771468","doi":"10.1007/978-3-540-40899-4_117","title":"Fixation-Based Surgery: A New Technique for Distal Radius Osteotomy","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Orthopedic Surgery and Rehabilitation","field":"Medicine","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fixation (population genetics); Osteotomy; RADIUS; Wedge (geometry); Orthopedic surgery; Orthodontics; Materials science; Surgery; Medicine; Mathematics; Computer science; Geometry","score_opus":0.016227986943466426,"score_gpt":0.26041556751501443,"score_spread":0.24418758057154802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481771468","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.071099855,0.07449566,0.76285744,0.0028752796,0.0054995962,0.00022157909,0.00037618724,0.0035368872,0.07903746],"genre_scores_gemma":[0.25450987,0.05445294,0.5550721,0.0023298517,0.0037249858,0.00037451787,0.0005305606,0.0010777657,0.12792742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997675,0.000017046777,0.00001674093,0.00005410887,0.00012361075,0.000021079652],"domain_scores_gemma":[0.99990416,0.000035563768,0.0000130700855,0.000016400034,0.000015397181,0.000015347718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027057304,0.00076187775,0.0003624178,0.0014021624,0.0004560189,0.00046062237,0.0011203709,0.0009241773,0.0076167],"category_scores_gemma":[0.00035285347,0.00033689322,0.00072364486,0.00079273473,0.00059108407,0.0007787384,0.0007321889,0.00095996447,0.0022619523],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015504916,0.00009840535,0.0005695734,0.0004956593,0.00006151334,0.0021426973,0.00019725047,0.0013155213,0.12746522,0.0060558342,0.0142872995,0.84715605],"study_design_scores_gemma":[0.0002796657,0.0029471952,0.026640652,0.0006261025,0.0005385957,0.25093374,0.00017166027,0.010051148,0.059658833,0.0140362885,0.63372374,0.00039240325],"about_ca_topic_score_codex":0.0006841495,"about_ca_topic_score_gemma":0.0027050944,"teacher_disagreement_score":0.0076167,"about_ca_system_score_codex":0.0002359785,"about_ca_system_score_gemma":0.00043496356,"threshold_uncertainty_score":0.02548039},"labels":[],"label_agreement":null},{"id":"W1481784341","doi":"10.1007/978-3-642-03237-0_12","title":"Increasing the Scope and Resolution of Interprocedural Static Single Assignment","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scope (computer science); Heap (data structure); Compiler; Liveness; Programming language; Parallel computing","score_opus":0.015856516252184052,"score_gpt":0.247463998360478,"score_spread":0.23160748210829396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481784341","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.1570106,0.00471182,0.79489416,0.0014873615,0.00037713055,0.00011998135,0.00024324635,0.011446856,0.029708879],"genre_scores_gemma":[0.61514217,0.0016158837,0.3707816,0.00047351565,0.00033369457,0.00008574874,0.0003849936,0.001588357,0.009594067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743783,0.00074437197,0.0001555954,0.00036424922,0.0009101147,0.00038772996],"domain_scores_gemma":[0.9871023,0.006799252,0.0009598912,0.0036415905,0.0011807607,0.00031621687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019943747,0.0011112378,0.0009525143,0.0024173246,0.00083875307,0.0012140186,0.0023815008,0.0008594962,0.008083698],"category_scores_gemma":[0.0122743035,0.0007876997,0.0009687528,0.0021592202,0.0012270316,0.00421744,0.0032757714,0.0022292484,0.001680893],"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.00069227384,0.000436733,0.0035507074,0.00058773474,0.00009535856,0.00021072976,0.0006773184,0.07969416,0.050611384,0.045444418,0.010515364,0.80748373],"study_design_scores_gemma":[0.00019245481,0.0007895223,0.0037789214,0.00037888577,0.00038628734,0.00081353093,0.0006880119,0.6943866,0.12285755,0.13337924,0.042199787,0.0001492616],"about_ca_topic_score_codex":0.0010065099,"about_ca_topic_score_gemma":0.002283621,"teacher_disagreement_score":0.008083698,"about_ca_system_score_codex":0.0005693986,"about_ca_system_score_gemma":0.0018516354,"threshold_uncertainty_score":0.027042687},"labels":[],"label_agreement":null},{"id":"W1481798977","doi":"10.1007/11424857_20","title":"A New and Efficient K-Medoid Algorithm for Spatial Clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Medoid; k-medoids; Cluster analysis; Computer science; Algorithm; Canopy clustering algorithm; Computation; CURE data clustering algorithm; Correlation clustering; Data mining; Artificial intelligence","score_opus":0.013327264064766016,"score_gpt":0.23704973927285192,"score_spread":0.2237224752080859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481798977","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.00078084134,0.00018613602,0.99802256,0.000038226248,0.00006578375,0.000034584635,0.000060468898,0.00048978574,0.00032169276],"genre_scores_gemma":[0.009586876,0.00019351963,0.9882962,0.000053152926,0.00004346042,0.00010638897,0.00030269613,0.00015855553,0.0012590684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704677,0.00063550746,0.00023527966,0.00058008154,0.0013594747,0.0001428052],"domain_scores_gemma":[0.9974037,0.00084938883,0.00012536733,0.00052241393,0.0009854286,0.000113766895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019201373,0.001650956,0.0030645542,0.0025875533,0.0017350387,0.0020115909,0.0046841647,0.002775328,0.0052889897],"category_scores_gemma":[0.0067621786,0.0013363454,0.0023814486,0.0051438236,0.0010323515,0.0032140345,0.0039098416,0.0024393003,0.0054953117],"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.0003617152,0.0001203137,0.0005265024,0.0003097944,0.00022023785,0.000107954904,0.0002855497,0.15651347,0.011432739,0.011766694,0.014677779,0.8036772],"study_design_scores_gemma":[0.000050012142,0.00005980135,0.00025642518,0.000030751115,0.000047072204,0.00031965505,0.00010048288,0.9616148,0.006183655,0.016944923,0.014319615,0.000072706396],"about_ca_topic_score_codex":0.008633177,"about_ca_topic_score_gemma":0.010368362,"teacher_disagreement_score":0.008633177,"about_ca_system_score_codex":0.0010412852,"about_ca_system_score_gemma":0.00223774,"threshold_uncertainty_score":0.0176934},"labels":[],"label_agreement":null},{"id":"W1481888229","doi":"10.1007/978-3-540-74466-5_64","title":"Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"","keywords":"Ring (chemistry); Black hole (networking); Computer science; Security token; Ring network; Constant (computer programming); Token ring; Physics; Computer network; Network topology","score_opus":0.06385829267549921,"score_gpt":0.3188294906459288,"score_spread":0.2549711979704296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481888229","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.50565934,0.0006534681,0.47160453,0.0012138074,0.00018011619,0.00015076283,0.00007487084,0.00039754974,0.020065539],"genre_scores_gemma":[0.8640104,0.00030919505,0.12528099,0.000058552025,0.000033222903,0.00006517625,0.000032364314,0.0001074001,0.010102676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988954,0.00033640518,0.00006353919,0.00023197915,0.00016669041,0.00030587625],"domain_scores_gemma":[0.9936719,0.0037010456,0.0006878308,0.00066526857,0.00029963677,0.00097418146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027498729,0.00069747586,0.0017179684,0.00088355294,0.003017159,0.0034610494,0.0032780154,0.0047132554,0.004768022],"category_scores_gemma":[0.009456305,0.0012439585,0.0010147227,0.0011714173,0.004492923,0.008014856,0.005780918,0.0015569986,0.0008702795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019620187,0.00033608847,0.002429541,0.0003762785,0.00010794448,0.00907815,0.0022903327,0.38181108,0.013091487,0.5601059,0.002485931,0.025925256],"study_design_scores_gemma":[0.00025847967,0.00031758114,0.00032710432,0.000060596107,0.00008239475,0.0011871455,0.0015489579,0.7752136,0.005792036,0.21182525,0.0033074687,0.00007939438],"about_ca_topic_score_codex":0.0014413189,"about_ca_topic_score_gemma":0.0012439301,"teacher_disagreement_score":0.004768022,"about_ca_system_score_codex":0.00076070323,"about_ca_system_score_gemma":0.0009445804,"threshold_uncertainty_score":0.01595062},"labels":[],"label_agreement":null},{"id":"W1481995509","doi":"10.1007/3-540-45446-2_7","title":"Job Shop Scheduling Problems with Controllable Processing Times","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Flow shop scheduling; Job scheduler; Mathematical optimization; Distributed computing; Rate-monotonic scheduling; Fair-share scheduling; Mathematics; Operating system; Schedule","score_opus":0.010343054450460935,"score_gpt":0.21011225303891842,"score_spread":0.19976919858845749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481995509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045758117,0.0026114327,0.90978193,0.00080346747,0.0006042885,0.0002681063,0.00056557904,0.00061074557,0.038996365],"genre_scores_gemma":[0.7208576,0.004716623,0.23521625,0.00038448942,0.0011606832,0.00066255225,0.0007896203,0.00041824265,0.035793863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991788,0.0002956473,0.000041296385,0.000122872,0.00024702423,0.00011422617],"domain_scores_gemma":[0.9983115,0.0012177979,0.00014767853,0.00011619466,0.00009668419,0.00011014264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428205,0.0016509646,0.0013736169,0.0004820585,0.0007118637,0.0016140875,0.0018962151,0.001420562,0.006321711],"category_scores_gemma":[0.0032859114,0.00083555514,0.0011464336,0.001388097,0.001039774,0.0014632995,0.0011162913,0.0016037547,0.0009909713],"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.0006313335,0.00035049606,0.00033459257,0.0016872021,0.00014026756,0.0007881579,0.00026469247,0.54142326,0.011418398,0.3347532,0.018120723,0.090087764],"study_design_scores_gemma":[0.00029314923,0.0003166143,0.0004066106,0.000065918175,0.000068795205,0.0002577891,0.000094899086,0.6863742,0.0037345388,0.29460412,0.013729482,0.00005387684],"about_ca_topic_score_codex":0.0004676538,"about_ca_topic_score_gemma":0.0006124846,"teacher_disagreement_score":0.006321711,"about_ca_system_score_codex":0.0005157192,"about_ca_system_score_gemma":0.0007893792,"threshold_uncertainty_score":0.021148205},"labels":[],"label_agreement":null},{"id":"W1482000113","doi":"10.1007/978-3-540-89097-3_26","title":"On the Structure of Small Motif Recognition Instances","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamming distance; Sequence (biology); Cardinality (data modeling); Degeneracy (biology); Combinatorics; Pairwise comparison; Consensus sequence; Computer science; Algorithm; Mathematics; Artificial intelligence; Data mining; Genetics; Base sequence; DNA","score_opus":0.02696922047178994,"score_gpt":0.22526910068021222,"score_spread":0.1982998802084223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482000113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30077153,0.002224039,0.6643714,0.0014644157,0.000183673,0.00015661826,0.0031162726,0.0019824505,0.025729587],"genre_scores_gemma":[0.7648369,0.0010208255,0.20774423,0.00035633484,0.00028353382,0.00022465014,0.008495694,0.00074535015,0.016292414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995208,0.000088142464,0.00003790855,0.00018058221,0.00011237644,0.00006019909],"domain_scores_gemma":[0.99488586,0.0030847983,0.0005394523,0.00082144904,0.00040668537,0.00026165566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003506112,0.00049332017,0.0010872275,0.0014448803,0.00083913526,0.0018401843,0.0018456717,0.0011382928,0.008395767],"category_scores_gemma":[0.0071969316,0.0005554132,0.00052198296,0.0025434315,0.0010928815,0.0039033901,0.0013457246,0.0018988983,0.0014607892],"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.00053515687,0.00020598486,0.007687328,0.00057676743,0.00008494486,0.0007386193,0.00079652254,0.06906575,0.012044898,0.5275977,0.02832731,0.35233894],"study_design_scores_gemma":[0.00002919389,0.0000865545,0.0014619507,0.000060517286,0.000026259157,0.0004769739,0.00013028683,0.27811578,0.002420352,0.7095203,0.0076485337,0.000023368768],"about_ca_topic_score_codex":0.0009303719,"about_ca_topic_score_gemma":0.0016614516,"teacher_disagreement_score":0.008395767,"about_ca_system_score_codex":0.00056721433,"about_ca_system_score_gemma":0.00042058885,"threshold_uncertainty_score":0.028086603},"labels":[],"label_agreement":null},{"id":"W1482003340","doi":"10.1007/978-3-540-30075-5_48","title":"On Efficient and Effective Association Rule Mining from XML Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XML; Association rule learning; Generalization; Data mining; Automatic summarization; Tree (set theory); Constraint (computer-aided design); Metric (unit); XML Schema (W3C); Document Structure Description; Task (project management); Theoretical computer science; Information retrieval; XML Encryption; World Wide Web","score_opus":0.015164265382221164,"score_gpt":0.25250655097178665,"score_spread":0.2373422855895655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482003340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077433432,0.0019456944,0.986246,0.00056578754,0.00014628518,0.00019667072,0.00043950224,0.0015542312,0.0011625803],"genre_scores_gemma":[0.041398164,0.001906471,0.95037454,0.00045137358,0.0002993723,0.0002675167,0.002138223,0.00021751464,0.0029469316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930716,0.0022475435,0.0008490307,0.0006741837,0.002843787,0.00031380987],"domain_scores_gemma":[0.9762115,0.01785321,0.00048981095,0.003789654,0.0014671945,0.000188544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005853381,0.0013819279,0.0024367291,0.0045991326,0.0011747949,0.003136216,0.00353263,0.0018388726,0.002909268],"category_scores_gemma":[0.024376266,0.0014001916,0.0015968545,0.007855949,0.00182069,0.008598085,0.0038994297,0.0026568095,0.0020800203],"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.00030878646,0.00030275912,0.0016715226,0.0003141853,0.00015372128,0.00027881315,0.00020453866,0.03576321,0.005452188,0.020574518,0.016026774,0.91894895],"study_design_scores_gemma":[0.00019723487,0.00022770825,0.0019673994,0.00015908838,0.00019518778,0.0010095299,0.0002191631,0.7932418,0.014430018,0.1658876,0.02236931,0.0000960708],"about_ca_topic_score_codex":0.0044033206,"about_ca_topic_score_gemma":0.005640483,"teacher_disagreement_score":0.005853381,"about_ca_system_score_codex":0.0007388118,"about_ca_system_score_gemma":0.001857219,"threshold_uncertainty_score":0.03095603},"labels":[],"label_agreement":null},{"id":"W1482008436","doi":"10.1007/978-3-540-79126-3_27","title":"On Minimal Moment of Inertia Polyominoes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Moment of inertia; Mathematics; Regular polygon; Combinatorics; Roundness (object); Moment (physics); Polyomino; RADIUS; Plane (geometry); Geometry; Physics; Computer science; Classical mechanics","score_opus":0.017560843350735832,"score_gpt":0.2494118414217571,"score_spread":0.23185099807102127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482008436","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.2815342,0.0037710462,0.27037776,0.0025525095,0.0039058996,0.00016358719,0.00084835675,0.0005414291,0.4363052],"genre_scores_gemma":[0.8324879,0.0022553427,0.049382325,0.00093939726,0.0030391414,0.00025804728,0.0009045566,0.0007600811,0.10997331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995493,0.00007443434,0.000026927912,0.000098129916,0.00015330082,0.000097753495],"domain_scores_gemma":[0.99935,0.00022421282,0.000096721655,0.000067053836,0.00008590288,0.00017614146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052866427,0.001151953,0.0012711581,0.0025434834,0.0019262744,0.0021949816,0.0012337716,0.0010667249,0.0167924],"category_scores_gemma":[0.0016528402,0.0005515453,0.0010932877,0.0012817609,0.0030013022,0.003391114,0.00228796,0.0031149564,0.0018505853],"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.000042142805,0.000018544173,0.000066401124,0.000053628333,0.0000068134236,0.000042382624,0.00012841112,0.0005231861,0.0009883917,0.98590416,0.0026847704,0.009541134],"study_design_scores_gemma":[0.0000118939815,0.000027161124,0.00023441958,0.000019738009,0.0000058041815,0.00008967922,0.000045145003,0.0018351753,0.00031049357,0.99157906,0.005824707,0.000016679585],"about_ca_topic_score_codex":0.0004469964,"about_ca_topic_score_gemma":0.00073642045,"teacher_disagreement_score":0.0167924,"about_ca_system_score_codex":0.0009939224,"about_ca_system_score_gemma":0.000442762,"threshold_uncertainty_score":0.056176126},"labels":[],"label_agreement":null},{"id":"W1482020040","doi":"10.1007/978-3-642-18073-6_2","title":"On Quantum Estimation, Quantum Cloning and Finite Quantum de Finetti Theorems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum cloning; Quantum channel; Quantum; Quantum information; Quantum state; Channel (broadcasting); State (computer science); Norm (philosophy); Quantum capacity","score_opus":0.01546205746826491,"score_gpt":0.23392099533689703,"score_spread":0.21845893786863213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482020040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03688221,0.023293925,0.52250344,0.011448504,0.002704272,0.000076608354,0.00035902672,0.00029605668,0.40243605],"genre_scores_gemma":[0.80986506,0.014300883,0.08973346,0.0028440838,0.004110957,0.00021005816,0.00040247306,0.0003400843,0.07819296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986481,0.00048238845,0.000064689244,0.00021134179,0.0004156722,0.00017787346],"domain_scores_gemma":[0.9971595,0.0018830507,0.0001438069,0.00050739513,0.00023382716,0.000072381445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466244,0.000908885,0.0012840758,0.0015496159,0.001871865,0.002707362,0.0018612515,0.0023903602,0.0052549415],"category_scores_gemma":[0.006197458,0.00064933515,0.0013827296,0.0018113841,0.008288591,0.009111498,0.00273942,0.0060552545,0.0009490403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044486956,0.000003684084,0.000017445278,0.000016168748,0.0000018012881,0.000009016212,0.000031184063,0.00038286886,0.00007222603,0.9967546,0.0006395205,0.0020670057],"study_design_scores_gemma":[0.0000016822861,0.0000028232162,0.000026560958,0.000010052755,0.0000014285166,0.000025674966,0.0000061946457,0.0012084895,0.00009429493,0.9970688,0.0015485988,0.000005410759],"about_ca_topic_score_codex":0.0011165715,"about_ca_topic_score_gemma":0.0007332947,"teacher_disagreement_score":0.0052549415,"about_ca_system_score_codex":0.0024016178,"about_ca_system_score_gemma":0.0010171473,"threshold_uncertainty_score":0.017579556},"labels":[],"label_agreement":null},{"id":"W1482074272","doi":"10.1007/11558484_59","title":"A Bayesian Approach for Weighting Boundary and Region Information for Segmentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Boundary (topology); Segmentation; Weighting; Computer science; Image segmentation; Artificial intelligence; Scale-space segmentation; Bayesian probability; Pattern recognition (psychology); Decision boundary; Pixel; Computer vision; Mathematics","score_opus":0.016789385779584484,"score_gpt":0.2643120375307236,"score_spread":0.24752265175113908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482074272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038490017,0.00016263027,0.9989862,0.000035831385,0.000011436354,0.000015777234,0.000020873229,0.00013089874,0.0002515636],"genre_scores_gemma":[0.02173329,0.00048922875,0.9751813,0.00011439304,0.00009687546,0.00011366108,0.00019443905,0.00033177694,0.0017449794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642426,0.0010379719,0.00022790195,0.00059956795,0.0015145716,0.00019562767],"domain_scores_gemma":[0.99483055,0.002961476,0.0002755691,0.00053577655,0.0012293428,0.00016730328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061626984,0.0017825145,0.003227182,0.003443313,0.001288437,0.0031039198,0.0053986567,0.0040066135,0.004452542],"category_scores_gemma":[0.015304774,0.003303435,0.0026321835,0.0039305654,0.0018308677,0.0049541807,0.0035184145,0.003976022,0.0018053657],"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.00027068786,0.00016169445,0.00063738116,0.00045020753,0.0003363601,0.00013202932,0.00027198234,0.32649457,0.019724363,0.116362825,0.007532586,0.5276253],"study_design_scores_gemma":[0.000025136735,0.000038269078,0.00029785733,0.000057226796,0.000104902436,0.00013165057,0.000017754597,0.9136449,0.003663668,0.07782347,0.0041334336,0.0000617225],"about_ca_topic_score_codex":0.011030865,"about_ca_topic_score_gemma":0.017960312,"teacher_disagreement_score":0.011030865,"about_ca_system_score_codex":0.0020930683,"about_ca_system_score_gemma":0.0022264535,"threshold_uncertainty_score":0.03259188},"labels":[],"label_agreement":null},{"id":"W1482192814","doi":"10.1007/978-3-642-15711-0_73","title":"Improved Method for Point-Based Tracking","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Northern Digital (Canada); Western University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute on Deafness and Other Communication Disorders; National Institutes of Health","keywords":"Computer science; Tracking (education); Weighting; Computer vision; Artificial intelligence; Range (aeronautics); Point (geometry); Tracking system; Point target; Kalman filter; Mathematics","score_opus":0.010589799210155987,"score_gpt":0.2575004539428917,"score_spread":0.24691065473273574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482192814","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.0010374929,0.0001781109,0.99764365,0.000025661313,0.00010167818,0.000018889266,0.000028953391,0.00046319814,0.00050236547],"genre_scores_gemma":[0.041869625,0.00037942248,0.94931835,0.00008041782,0.00010308781,0.00012661674,0.00022681839,0.00015278868,0.007742876],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887174,0.00013304417,0.000051843806,0.00024428157,0.00064028543,0.000058884263],"domain_scores_gemma":[0.99919754,0.00014500364,0.000031371175,0.00017522716,0.00041721223,0.000033668493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070095557,0.0010563678,0.001417784,0.0014894635,0.00067484815,0.0008565252,0.0019898582,0.0016861567,0.0066657607],"category_scores_gemma":[0.0014261038,0.0006529466,0.0010409927,0.0016959816,0.00041789142,0.0012470994,0.0016466131,0.0012849224,0.004126094],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022574447,0.00009668503,0.0006680881,0.0003240809,0.0001515042,0.00016175951,0.00013077717,0.034684885,0.0881959,0.009911756,0.0066508665,0.8587979],"study_design_scores_gemma":[0.00006408809,0.00009105697,0.0010077643,0.000025782823,0.000102801154,0.0005590308,0.000020395968,0.9529123,0.022589168,0.0040710093,0.01847671,0.00007994733],"about_ca_topic_score_codex":0.005107387,"about_ca_topic_score_gemma":0.0045005432,"teacher_disagreement_score":0.0066657607,"about_ca_system_score_codex":0.00045334944,"about_ca_system_score_gemma":0.0010343445,"threshold_uncertainty_score":0.02229923},"labels":[],"label_agreement":null},{"id":"W1482388963","doi":"10.1007/11506881_10","title":"A Prevention Model for Algorithmic Complexity Attacks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 Victoria","funders":"","keywords":"Computer science; Denial-of-service attack; Exploit; Computer security; Flooding (psychology); Resource (disambiguation); Resource consumption; Computational complexity theory; Theoretical computer science; Distributed computing; Algorithm; Computer network; The Internet; World Wide Web","score_opus":0.04371515899908759,"score_gpt":0.2840845948006455,"score_spread":0.24036943580155792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482388963","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.021782976,0.00040680257,0.9127698,0.0033019995,0.00024278669,0.00015925104,0.00024292541,0.0009971585,0.06009628],"genre_scores_gemma":[0.7950861,0.00092058425,0.13573278,0.0011361184,0.0005848479,0.00052282005,0.00045572917,0.00039990435,0.06516112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986119,0.00034873458,0.00006922058,0.00020598098,0.0005005092,0.00026366906],"domain_scores_gemma":[0.99579346,0.0021651823,0.0003312992,0.0008960148,0.0004910983,0.00032292883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016032691,0.001201315,0.0010183031,0.0017360788,0.0012761604,0.0033786974,0.0032370293,0.0030933055,0.01133037],"category_scores_gemma":[0.0072094123,0.00072527456,0.001786898,0.0011722936,0.002515716,0.006686387,0.002850476,0.004884981,0.0017041821],"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.00003678677,0.00005767244,0.00020733617,0.00004266099,0.000013354565,0.00005837431,0.00008825116,0.041296877,0.0004483301,0.9419121,0.003733304,0.012104878],"study_design_scores_gemma":[0.000022991533,0.000024870113,0.00007221879,0.000013549011,0.000016732934,0.00006871516,0.000024345025,0.22785579,0.00024288126,0.7681195,0.0035257302,0.00001264447],"about_ca_topic_score_codex":0.0021804452,"about_ca_topic_score_gemma":0.002021882,"teacher_disagreement_score":0.01133037,"about_ca_system_score_codex":0.0024624518,"about_ca_system_score_gemma":0.0018554043,"threshold_uncertainty_score":0.037903845},"labels":[],"label_agreement":null},{"id":"W148244761","doi":"10.1007/978-3-642-21043-3_12","title":"Characterizing a Brain-Based Value-Function Approximator","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"","keywords":"Computer science; Robustness (evolution); Reinforcement learning; Artificial intelligence; Machine learning; Function (biology); Value (mathematics); Classical conditioning; Bellman equation; Conditioning; Mathematics; Mathematical optimization; Statistics","score_opus":0.028009202545075045,"score_gpt":0.2305258664563677,"score_spread":0.20251666391129264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148244761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03617753,0.0003383996,0.9580422,0.00025072627,0.000044782697,0.000024490031,0.000042572985,0.00014436027,0.0049349014],"genre_scores_gemma":[0.8153993,0.0006491085,0.17363243,0.00011250662,0.000075411306,0.000088266286,0.00011939398,0.00013390633,0.009789582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997819,0.00005165415,0.000008806637,0.000051115694,0.00007254073,0.0000339604],"domain_scores_gemma":[0.99916494,0.0005612,0.000048524336,0.00005606442,0.00013563159,0.000033652916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074790075,0.0005165632,0.0005823022,0.00037399042,0.00029116927,0.001396923,0.000932333,0.0015738514,0.0023063812],"category_scores_gemma":[0.0039381557,0.00031816785,0.00046944906,0.00036257677,0.0007050756,0.0013170921,0.000785697,0.0011494609,0.0005180434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018484436,0.0000942583,0.0017307376,0.00026322666,0.000097456126,0.00042168493,0.00034857306,0.48432374,0.05748374,0.3516431,0.0025002954,0.10090842],"study_design_scores_gemma":[0.0000033396311,0.000025588959,0.00018627012,0.00001079855,0.000010730314,0.00011133436,0.000016718455,0.96222407,0.0023556734,0.034498524,0.00054962025,0.0000072874022],"about_ca_topic_score_codex":0.00090835034,"about_ca_topic_score_gemma":0.00056944636,"teacher_disagreement_score":0.0023063812,"about_ca_system_score_codex":0.00040405698,"about_ca_system_score_gemma":0.00045945615,"threshold_uncertainty_score":0.007715583},"labels":[],"label_agreement":null},{"id":"W1482472825","doi":"10.1007/978-3-642-03367-4_10","title":"A Distribution-Sensitive Dictionary with Low Space Overhead","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Computer science; Overhead (engineering); Sequence (biology); Data structure; Space (punctuation); Algorithm; Theoretical computer science; Programming language","score_opus":0.00661822233043657,"score_gpt":0.21343378547618191,"score_spread":0.20681556314574534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482472825","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.021108808,0.00046560293,0.96498424,0.00032077174,0.00049645465,0.00013290554,0.00041813092,0.006090369,0.005982698],"genre_scores_gemma":[0.23761544,0.0005360749,0.73306215,0.0006276895,0.00048546217,0.0002148868,0.0016330997,0.0012556567,0.024569618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897027,0.00013005415,0.00008599628,0.00019170852,0.0004913381,0.00013063166],"domain_scores_gemma":[0.9978555,0.00036901183,0.000114852875,0.0010815065,0.00043261066,0.00014646794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042089686,0.0006555223,0.0011327913,0.0008815747,0.00089231244,0.0013205117,0.0018057672,0.0007845534,0.009433936],"category_scores_gemma":[0.00284083,0.00042906837,0.00042173106,0.0018385138,0.0006701618,0.0025273485,0.0032997944,0.0011005695,0.004576025],"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.0013320108,0.00027204226,0.00060701376,0.0002630036,0.000059936516,0.00023735256,0.00016315507,0.014578637,0.06895385,0.046836015,0.034665495,0.8320315],"study_design_scores_gemma":[0.0009064751,0.0012061883,0.0010204545,0.00010546715,0.00020122874,0.0024423045,0.00038605736,0.54762423,0.18716876,0.15118587,0.107550316,0.00020258722],"about_ca_topic_score_codex":0.0008582899,"about_ca_topic_score_gemma":0.0020465525,"teacher_disagreement_score":0.009433936,"about_ca_system_score_codex":0.0004069403,"about_ca_system_score_gemma":0.0012479406,"threshold_uncertainty_score":0.031559646},"labels":[],"label_agreement":null},{"id":"W1482515287","doi":"10.1007/978-3-642-17187-1_51","title":"Modeling Variable Dependencies between Characters in Chinese Information Retrieval","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Variable (mathematics); Information retrieval; Artificial intelligence; Data mining; Mathematics","score_opus":0.013165052766024829,"score_gpt":0.23203952137144762,"score_spread":0.21887446860542278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482515287","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.83779365,0.001089445,0.1551646,0.0005403697,0.00006836078,0.00010394469,0.0008218473,0.00049601734,0.0039219474],"genre_scores_gemma":[0.9794658,0.00031871654,0.015055427,0.00005084299,0.000048466998,0.000066165834,0.0007371917,0.000092339644,0.0041651153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992279,0.0002713081,0.00003644968,0.0002130964,0.000100942045,0.00015034198],"domain_scores_gemma":[0.9930623,0.0059098317,0.00032918694,0.00025752027,0.00029814703,0.00014290304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001880218,0.0006485865,0.0007811401,0.0020121434,0.0007777702,0.0012147889,0.0013445998,0.0008192019,0.002299049],"category_scores_gemma":[0.008202976,0.0005559187,0.0008207071,0.0023479974,0.00078891363,0.002926942,0.0008273563,0.0012502641,0.00045540728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014074796,0.00045437852,0.050214555,0.00031949056,0.00023880386,0.0008336051,0.0011368828,0.7793986,0.0056498894,0.04873267,0.0041530114,0.10746059],"study_design_scores_gemma":[0.000011711235,0.000024914467,0.0028158838,0.000006165022,0.00005042445,0.000027124779,0.00002847645,0.9906404,0.00048466233,0.0056392467,0.00026122056,0.000009755194],"about_ca_topic_score_codex":0.03783584,"about_ca_topic_score_gemma":0.023560803,"teacher_disagreement_score":0.03783584,"about_ca_system_score_codex":0.0015034283,"about_ca_system_score_gemma":0.0013819634,"threshold_uncertainty_score":0.075231194},"labels":[],"label_agreement":null},{"id":"W1482525343","doi":"10.1007/11496656_25","title":"A Simple Fast Hybrid Pattern-Matching Algorithm","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Simon Fraser University; McMaster University","funders":"","keywords":"Computer science; Alphabet; Algorithm; Simple (philosophy); Pattern matching; Matching (statistics); SIMPLE algorithm; Independence (probability theory); String searching algorithm; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.011466572529676733,"score_gpt":0.24155032637219173,"score_spread":0.230083753842515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482525343","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.0069330367,0.00031831273,0.98376036,0.00008486368,0.00019300768,0.00015270582,0.00023727678,0.004429873,0.0038906725],"genre_scores_gemma":[0.036747217,0.00017549923,0.9496357,0.0001337942,0.00006339391,0.00019586345,0.0008531422,0.00035158894,0.011843843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992161,0.0000750163,0.000055210683,0.00020039557,0.00038237544,0.00007090477],"domain_scores_gemma":[0.9993699,0.00012774408,0.000028557646,0.00021886689,0.00022080721,0.000034156932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005313306,0.0010414881,0.001333276,0.0017181687,0.00079056213,0.0011514396,0.0027039999,0.0012640096,0.022353893],"category_scores_gemma":[0.0014514261,0.0005814346,0.00080932735,0.0029238139,0.0003498031,0.002115506,0.00203343,0.00079453614,0.012011124],"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.00031006025,0.00011618359,0.0003480746,0.00017322467,0.00007581878,0.00009492345,0.000025345977,0.006459826,0.036739998,0.0074836663,0.011525883,0.9366471],"study_design_scores_gemma":[0.00046073002,0.00061568344,0.0022377667,0.000067389934,0.00029088388,0.0022038247,0.00011431774,0.72018915,0.12047685,0.064218864,0.08899068,0.00013374918],"about_ca_topic_score_codex":0.0012866956,"about_ca_topic_score_gemma":0.0020125457,"teacher_disagreement_score":0.022353893,"about_ca_system_score_codex":0.00037677848,"about_ca_system_score_gemma":0.0009256675,"threshold_uncertainty_score":0.07478118},"labels":[],"label_agreement":null},{"id":"W1482535585","doi":"10.1007/978-3-642-41575-3_15","title":"Controller Compilation and Compression for Resource Constrained Applications","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Benchmark (surveying); Lookup table; Controller (irrigation); Compiler; Set (abstract data type); Markov decision process; Computation; Table (database); Decision table; Point (geometry); Resource (disambiguation); Distributed computing; Computer engineering; Algorithm; Artificial intelligence; Data mining; Markov process; Programming language","score_opus":0.016047394966606572,"score_gpt":0.24618815952536066,"score_spread":0.2301407645587541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482535585","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.034835268,0.0024957021,0.9271072,0.0003336136,0.0003297171,0.0001706771,0.00028315655,0.009856343,0.024588289],"genre_scores_gemma":[0.61838704,0.0015566779,0.35893258,0.0002742821,0.00023174974,0.00031955793,0.00081139547,0.0013590443,0.018127622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962914,0.000047945756,0.00002832795,0.00006437792,0.00017677789,0.000053415122],"domain_scores_gemma":[0.9993686,0.00027611715,0.000025305322,0.00020266577,0.00010784603,0.000019533318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029737724,0.0008748935,0.00055907643,0.0005565879,0.00045580682,0.00085912365,0.0012927861,0.0005056946,0.00848347],"category_scores_gemma":[0.0015679932,0.00039742974,0.00037143024,0.00078448205,0.0005094276,0.0012785126,0.00096200494,0.0012114577,0.0010925713],"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.0004200823,0.00016292762,0.00031477746,0.00041796797,0.00004435504,0.0003064401,0.00012573956,0.158427,0.03293854,0.045197733,0.017176189,0.7444682],"study_design_scores_gemma":[0.00005480904,0.00010166369,0.00039180624,0.00008067094,0.000030559346,0.00022307807,0.00005199306,0.88229895,0.036488112,0.06309006,0.01715612,0.0000321662],"about_ca_topic_score_codex":0.0017455419,"about_ca_topic_score_gemma":0.0026991987,"teacher_disagreement_score":0.00848347,"about_ca_system_score_codex":0.00041820068,"about_ca_system_score_gemma":0.0007032597,"threshold_uncertainty_score":0.028380036},"labels":[],"label_agreement":null},{"id":"W1482602274","doi":"10.1007/11574620_78","title":"The FungalWeb Ontology: Semantic Web Challenges in Bioinformatics and Genomics","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"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; Semantic Web; Ontology; World Wide Web; Genomics; Information retrieval; Genome; Biology; Genetics; Gene","score_opus":0.02338673493883864,"score_gpt":0.25031716855397973,"score_spread":0.2269304336151411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482602274","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.008114845,0.05665299,0.8132246,0.070968,0.004009301,0.00011526932,0.0024713853,0.0035551316,0.040888473],"genre_scores_gemma":[0.06103488,0.0947736,0.79783714,0.009778017,0.0027473674,0.00025179566,0.007126818,0.0013087234,0.025141643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990551,0.00019914203,0.0001051686,0.00010784479,0.00045192265,0.00008075384],"domain_scores_gemma":[0.9974348,0.0014612874,0.000105108935,0.00035388608,0.00035089615,0.00029406088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040108473,0.00079252664,0.0010519555,0.0027734425,0.0014604499,0.007957511,0.001948816,0.0021726824,0.0036849526],"category_scores_gemma":[0.004111997,0.00060912356,0.0011643348,0.005764385,0.003648376,0.021074718,0.0028664893,0.00394715,0.002027673],"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.000031090192,0.000072607305,0.00041259188,0.0006424285,0.000027414348,0.0002312701,0.0006513224,0.001440539,0.0014904214,0.6478271,0.095686026,0.25148723],"study_design_scores_gemma":[0.000007984071,0.000009659465,0.00026682534,0.00034788804,0.000020934984,0.0005364963,0.00044680297,0.0068343813,0.00078648725,0.56603116,0.42468733,0.000024042305],"about_ca_topic_score_codex":0.0055796765,"about_ca_topic_score_gemma":0.007699971,"teacher_disagreement_score":0.007957511,"about_ca_system_score_codex":0.0021380058,"about_ca_system_score_gemma":0.0043550357,"threshold_uncertainty_score":0.021211624},"labels":[],"label_agreement":null},{"id":"W1482635442","doi":"10.1007/978-3-540-74260-9_83","title":"Fuzzy C-Means Clustering for Segmenting Carotid Artery Ultrasound Images","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Artificial intelligence; Carotid arteries; Ultrasound; Fuzzy logic; Cluster analysis; Market segmentation; Computer science; Radiology; Medicine; Internal medicine; Business","score_opus":0.025033052005786573,"score_gpt":0.2881967337312117,"score_spread":0.2631636817254251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482635442","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.010861615,0.0012592444,0.98324984,0.0000773465,0.0000955182,0.00008363207,0.0001260167,0.0011085331,0.0031382625],"genre_scores_gemma":[0.07285196,0.000828851,0.91987926,0.00006785856,0.000054522137,0.00011027227,0.0003698278,0.00019839659,0.005639004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993356,0.000069056834,0.000051452073,0.00013747482,0.00035386157,0.00005257948],"domain_scores_gemma":[0.99943334,0.0001348241,0.000027502896,0.00006326888,0.0003243328,0.000016675845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006446922,0.00079943275,0.00087572966,0.0023596426,0.00089857745,0.0008805844,0.0014209212,0.001343236,0.0029970934],"category_scores_gemma":[0.0014655718,0.00049178395,0.0008917608,0.0027005996,0.0004466265,0.0007213582,0.0004443444,0.0007303815,0.0020327216],"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.00013815018,0.000052501044,0.0004748811,0.00028497877,0.0000637878,0.00007332708,0.00016453608,0.036941037,0.049831778,0.003937637,0.008085295,0.8999522],"study_design_scores_gemma":[0.000019458746,0.0001267451,0.0045097317,0.00011300692,0.0001171682,0.00048645755,0.00014985442,0.8801527,0.0829069,0.01011215,0.021174807,0.00013088583],"about_ca_topic_score_codex":0.015225355,"about_ca_topic_score_gemma":0.018094083,"teacher_disagreement_score":0.015225355,"about_ca_system_score_codex":0.0007285821,"about_ca_system_score_gemma":0.0011089356,"threshold_uncertainty_score":0.030273438},"labels":[],"label_agreement":null},{"id":"W1482661747","doi":"10.1007/978-3-540-77224-8_2","title":"A Survey of Recent Attacks on the Filter Generator","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shift register; Generator (circuit theory); Self-shrinking generator; Stream cipher; Computer science; Boolean function; Linear feedback shift register; Filter (signal processing); Key (lock); Arithmetic; Computer hardware; Algorithm; Function (biology); Mathematics; Electrical engineering; Chip; Telecommunications; Engineering; Cryptography; Computer security; Voltage; Power (physics); Physics","score_opus":0.06693660021298899,"score_gpt":0.28198977806372466,"score_spread":0.2150531778507357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482661747","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041222267,0.24778615,0.5546862,0.012961646,0.0027835325,0.00032355863,0.00068322,0.0021756173,0.13737781],"genre_scores_gemma":[0.49330494,0.2744896,0.16816245,0.0058034128,0.0096150255,0.0005036287,0.0019021935,0.0006990752,0.045519676],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743634,0.00069507567,0.00017335924,0.00031491992,0.0011273943,0.00025289957],"domain_scores_gemma":[0.9962612,0.002202326,0.00024849336,0.00090306334,0.0003008112,0.000084067375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018604447,0.0016476451,0.0015419032,0.0027485918,0.0015033537,0.0031939978,0.0013776027,0.0026355945,0.005809369],"category_scores_gemma":[0.0048018093,0.0008496795,0.0010392888,0.0037406124,0.0019066518,0.0077749053,0.0022694159,0.0027811723,0.0033317173],"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.00039121218,0.00020410321,0.0019587527,0.0019502132,0.00021515306,0.00047905493,0.00022227595,0.016979802,0.0074435086,0.3032935,0.046210714,0.62065166],"study_design_scores_gemma":[0.00014549505,0.0004554413,0.00183591,0.0010495094,0.00030292541,0.006805262,0.000204884,0.082258254,0.021137474,0.55525565,0.33036336,0.00018578957],"about_ca_topic_score_codex":0.00026580266,"about_ca_topic_score_gemma":0.00028591047,"teacher_disagreement_score":0.005809369,"about_ca_system_score_codex":0.001037386,"about_ca_system_score_gemma":0.00056298805,"threshold_uncertainty_score":0.019434273},"labels":[],"label_agreement":null},{"id":"W1482802643","doi":"10.1007/978-3-540-88875-8_115","title":"Reliable Peer-to-Peer Semantic Knowledge Sharing System","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Computer science; Flooding (psychology); Reliability (semiconductor); Disconnection; Peer-to-peer; Fault tolerance; Routing (electronic design automation); Distributed computing; Computer network","score_opus":0.03312409922432337,"score_gpt":0.2676943175720008,"score_spread":0.23457021834767744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482802643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06273349,0.0006992033,0.9189168,0.0006777809,0.00018408653,0.00033086393,0.000667341,0.0059934035,0.0097970115],"genre_scores_gemma":[0.81566644,0.0005315184,0.17291787,0.00016138445,0.00012995584,0.00023216012,0.0014272197,0.00016615028,0.008767328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782395,0.0003677104,0.00019061797,0.000435218,0.0010000202,0.00018250178],"domain_scores_gemma":[0.9964735,0.000712695,0.00027279722,0.0016861818,0.0006489567,0.00020597216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019006216,0.0005319293,0.0014186612,0.0013251542,0.0021552017,0.0023216985,0.0036253799,0.0019479286,0.0024915908],"category_scores_gemma":[0.0046355403,0.00044658856,0.00047177324,0.0019735123,0.0010052598,0.0049268752,0.0043686037,0.0011005822,0.0016783687],"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.0021712838,0.00091367704,0.0030788968,0.0007577445,0.00043528588,0.003018433,0.001735416,0.14082865,0.071123816,0.15963621,0.034873445,0.5814272],"study_design_scores_gemma":[0.00016956145,0.00022567963,0.00081192196,0.00003780286,0.00018347992,0.0011989706,0.00044834142,0.7942353,0.03235838,0.14235342,0.027850868,0.00012634069],"about_ca_topic_score_codex":0.001674479,"about_ca_topic_score_gemma":0.0013796792,"teacher_disagreement_score":0.0036253799,"about_ca_system_score_codex":0.0006467378,"about_ca_system_score_gemma":0.0020037205,"threshold_uncertainty_score":0.010051608},"labels":[],"label_agreement":null},{"id":"W1482810056","doi":"10.1007/3-540-47887-6_34","title":"Top Down FP-Growth for Association Rule Mining","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":136,"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":"Association rule learning; Pruning; Computer science; Tree (set theory); Data mining; Space (punctuation); Depth-first search; Order (exchange); Algorithm; Search algorithm; Mathematics; Combinatorics","score_opus":0.017554770548165666,"score_gpt":0.24475105189772578,"score_spread":0.2271962813495601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482810056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009144033,0.002634874,0.9775622,0.0006316657,0.00041765015,0.00014939783,0.0010001904,0.005625545,0.002834463],"genre_scores_gemma":[0.11654727,0.00141813,0.8705649,0.00040700007,0.0005327894,0.00031958506,0.003562004,0.00066636794,0.0059819603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958016,0.0013060267,0.00035354175,0.0005799768,0.001699818,0.00025903594],"domain_scores_gemma":[0.9865588,0.008206884,0.00029272638,0.0025328286,0.0022084538,0.00020035404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041601136,0.0016493127,0.002419774,0.0032508823,0.0010697335,0.0021067306,0.002650356,0.0016504861,0.0047024526],"category_scores_gemma":[0.02013781,0.0007508035,0.0013941228,0.0042709387,0.00077826064,0.0028045827,0.0016653126,0.0035665908,0.004979011],"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.0005163811,0.00021105105,0.0017832342,0.00039326967,0.000109142806,0.00035282248,0.000071216455,0.04496499,0.0048096287,0.012733842,0.031799864,0.9022546],"study_design_scores_gemma":[0.000043060678,0.00015006194,0.0005488888,0.00006109945,0.000076956516,0.00051589747,0.000033376702,0.9175825,0.007190314,0.064616576,0.009148632,0.00003268123],"about_ca_topic_score_codex":0.002589772,"about_ca_topic_score_gemma":0.0027728768,"teacher_disagreement_score":0.0047024526,"about_ca_system_score_codex":0.00057360897,"about_ca_system_score_gemma":0.0012424233,"threshold_uncertainty_score":0.022001088},"labels":[],"label_agreement":null},{"id":"W1482977697","doi":"10.1007/978-3-642-15705-9_67","title":"Inference of a HARDI Fiber Bundle Atlas Using a Two-Level Clustering Strategy","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Fiber bundle; Cluster analysis; Computer science; Tractography; Artificial intelligence; Bundle; Pattern recognition (psychology); Atlas (anatomy); Segmentation; Pairwise comparison; Diffusion MRI; Inference; Normalization (sociology); Fiber tract; Population; Spatial normalization; Voxel; Anatomy; Medicine; Magnetic resonance imaging","score_opus":0.10183918342541161,"score_gpt":0.3880531155902251,"score_spread":0.2862139321648135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482977697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004539232,0.000059357306,0.99357694,0.00013659532,0.000025849286,0.00004541773,0.00015951954,0.0010907836,0.00036629254],"genre_scores_gemma":[0.13401146,0.000111489695,0.8606044,0.000178843,0.00008366254,0.00016216519,0.0013669119,0.0008866111,0.0025943944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978123,0.00055928243,0.00012029737,0.00091878936,0.00036759456,0.00022178824],"domain_scores_gemma":[0.9931924,0.0033180276,0.00047918106,0.0013471772,0.0012829674,0.00038030633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041094786,0.0015938568,0.0025350475,0.0038935388,0.0022498725,0.0038881262,0.0046955743,0.0037957337,0.006884179],"category_scores_gemma":[0.01457581,0.0027285225,0.0032877473,0.0024740973,0.001598012,0.0028657166,0.003578624,0.004745033,0.003358597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006937951,0.00025001419,0.005172933,0.00044530994,0.0005535185,0.0003727432,0.00046680192,0.4861888,0.01692403,0.055662636,0.014910679,0.41835877],"study_design_scores_gemma":[0.000024894476,0.000024364155,0.00060772296,0.000019937073,0.00003094701,0.00007276811,0.000022676473,0.9697398,0.0016502781,0.026835324,0.0009425698,0.000028694685],"about_ca_topic_score_codex":0.01638773,"about_ca_topic_score_gemma":0.020958057,"teacher_disagreement_score":0.01638773,"about_ca_system_score_codex":0.0018211138,"about_ca_system_score_gemma":0.0035430437,"threshold_uncertainty_score":0.032584667},"labels":[],"label_agreement":null},{"id":"W1483058305","doi":"10.1007/11426714_9","title":"AgentZ: Extending Object-Z for Multi-agent Systems Specification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Notation; Software engineering; Formal methods; Formal specification; Component (thermodynamics); Agent-oriented software engineering; Software development; Programming language; Key (lock); Software","score_opus":0.06483474578138411,"score_gpt":0.2923588802008343,"score_spread":0.22752413441945019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483058305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012120315,0.000115203235,0.97964096,0.00011846895,0.000100222394,0.00010975737,0.00048953557,0.013191084,0.00502273],"genre_scores_gemma":[0.059294976,0.0010895722,0.88751704,0.00045613578,0.00012243236,0.0009357883,0.005814367,0.017860772,0.026908973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809724,0.00040518917,0.00036490735,0.00020162633,0.0007370593,0.00019391472],"domain_scores_gemma":[0.99870634,0.00048381631,0.00010024562,0.00039784683,0.00024275515,0.00006895275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027440118,0.0022557492,0.0012188485,0.0014097979,0.0009703832,0.0045425114,0.002969321,0.001869614,0.016298724],"category_scores_gemma":[0.00370847,0.002115799,0.002724581,0.0013700044,0.0014074924,0.0063192854,0.0044593127,0.003348418,0.010694429],"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.0003843649,0.000146233,0.0010885074,0.0015269256,0.0001558606,0.00096232316,0.0015710174,0.015708737,0.011795112,0.66641533,0.053496122,0.24674945],"study_design_scores_gemma":[0.00020069937,0.000099196695,0.00029881168,0.00036216783,0.00017630596,0.0009542333,0.00017714055,0.07339888,0.026013521,0.213047,0.6851271,0.00014500762],"about_ca_topic_score_codex":0.0025833654,"about_ca_topic_score_gemma":0.0025766874,"teacher_disagreement_score":0.016298724,"about_ca_system_score_codex":0.0008816448,"about_ca_system_score_gemma":0.0015637275,"threshold_uncertainty_score":0.0545246},"labels":[],"label_agreement":null},{"id":"W1483072402","doi":"10.1007/978-3-642-03138-0_12","title":"Towards Automated FSMD Partitioning for Low Power Using Simulated Annealing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Low-power high-performance VLSI design","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":"University of Victoria","funders":"","keywords":"Datapath; Computer science; Partition (number theory); Simulated annealing; Dynamic demand; Power (physics); Parallel computing; Finite-state machine; Algorithm; Real-time computing; Mathematics","score_opus":0.015287908509994326,"score_gpt":0.24730588725694003,"score_spread":0.2320179787469457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483072402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016852401,0.00016014458,0.9756805,0.00009898803,0.000043350414,0.000072768045,0.00006698651,0.0020435392,0.0049814316],"genre_scores_gemma":[0.21697786,0.00010493503,0.77733266,0.000105706014,0.000019944368,0.0002043061,0.00023721538,0.0006273333,0.0043900195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.000109113134,0.000016260701,0.000054063625,0.00012794058,0.00004259445],"domain_scores_gemma":[0.9992866,0.00042257583,0.000034839508,0.00012914128,0.00011168872,0.000015229648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040788445,0.0010215115,0.0008910686,0.0007604792,0.0007358445,0.00081864354,0.0015111861,0.0009928613,0.0076573915],"category_scores_gemma":[0.0016366442,0.0006469187,0.0010409505,0.0005908498,0.00064224185,0.00093422615,0.0009808013,0.000994865,0.0011592844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012882547,0.000097047465,0.00043011375,0.00013528633,0.000051517338,0.00007479704,0.00014556426,0.8009568,0.019478962,0.016006168,0.0031744877,0.15932044],"study_design_scores_gemma":[0.000013077225,0.000028445362,0.00006762364,0.0000066221482,0.000008695713,0.000015748981,0.000016646523,0.9887382,0.0034309695,0.0060578664,0.0016112975,0.0000047842414],"about_ca_topic_score_codex":0.0046379324,"about_ca_topic_score_gemma":0.00954668,"teacher_disagreement_score":0.0076573915,"about_ca_system_score_codex":0.00091562513,"about_ca_system_score_gemma":0.0011438875,"threshold_uncertainty_score":0.025616467},"labels":[],"label_agreement":null},{"id":"W1483143768","doi":"10.1007/3-540-45441-1_15","title":"A UML-Based Approach to System Testing","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Testability; Unified Modeling Language; Sequence diagram; Software engineering; Class diagram; Test case; Model-based testing; Programming language; Reliability engineering; Software; Engineering","score_opus":0.039470597645967595,"score_gpt":0.25275002028524485,"score_spread":0.21327942263927724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483143768","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.0006674562,0.00033737088,0.98898125,0.00036603905,0.00006207315,0.000067654204,0.00002672617,0.00085117837,0.008640277],"genre_scores_gemma":[0.03844132,0.0008184659,0.9508404,0.00033995218,0.00011345834,0.0002266311,0.00016365478,0.00045770724,0.008598453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947648,0.0020929896,0.00035183816,0.00034428327,0.0022736753,0.00017240737],"domain_scores_gemma":[0.9940951,0.0035541558,0.00020561364,0.0011475035,0.00086837535,0.0001292056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004117427,0.0013486518,0.00088369695,0.0028097748,0.00095126586,0.003478307,0.0033164236,0.0018893902,0.008027661],"category_scores_gemma":[0.012639021,0.0012576076,0.0014583638,0.0017577902,0.002666986,0.0055361073,0.002569625,0.00387436,0.0024939242],"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.00004489854,0.0001731334,0.00039374948,0.00035459205,0.000056159595,0.00023616184,0.000710111,0.020494029,0.0055387504,0.6351124,0.010137612,0.3267484],"study_design_scores_gemma":[0.00006136856,0.00008805853,0.00035649832,0.00043123675,0.00010454647,0.0007450612,0.00013918028,0.18503872,0.008613855,0.7003487,0.104018465,0.000054304448],"about_ca_topic_score_codex":0.0021022123,"about_ca_topic_score_gemma":0.0032308977,"teacher_disagreement_score":0.008027661,"about_ca_system_score_codex":0.0012156635,"about_ca_system_score_gemma":0.0012510171,"threshold_uncertainty_score":0.02685523},"labels":[],"label_agreement":null},{"id":"W1483181615","doi":"10.1007/978-3-540-68825-9_22","title":"Predicting User Preferences Via Similarity-Based Clustering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Cluster analysis; Similarity (geometry); Data mining; Artificial intelligence; Information retrieval","score_opus":0.026412242445519492,"score_gpt":0.23842959414335174,"score_spread":0.21201735169783226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483181615","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.75375766,0.0013757546,0.23631577,0.00029423513,0.000080007994,0.00021281996,0.0022511596,0.0011541368,0.004558555],"genre_scores_gemma":[0.92037946,0.00038034882,0.07442295,0.00006508956,0.0000656713,0.00007156883,0.0021533715,0.00005765224,0.0024037708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917275,0.0002456063,0.000050679995,0.00015898402,0.00028375746,0.00008833566],"domain_scores_gemma":[0.9978485,0.0013462702,0.00012317128,0.00016927398,0.00040067895,0.00011218768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006933827,0.00059454713,0.0009518865,0.0024930942,0.00038433587,0.00081338873,0.0006653005,0.00081362785,0.0018431338],"category_scores_gemma":[0.0040553585,0.00023754669,0.0008057883,0.002786687,0.0001852789,0.001229455,0.0004061642,0.0007401599,0.0015897236],"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.0034714756,0.001994231,0.16093522,0.00036366648,0.0008591283,0.00032470928,0.00046604878,0.08143805,0.023854263,0.0031217607,0.013432602,0.70973885],"study_design_scores_gemma":[0.00003747385,0.00038864522,0.036103074,0.000018439407,0.000107810854,0.00035711497,0.00022350009,0.9535305,0.004796911,0.0034225758,0.00095563463,0.000058333186],"about_ca_topic_score_codex":0.0076365704,"about_ca_topic_score_gemma":0.012577514,"teacher_disagreement_score":0.0076365704,"about_ca_system_score_codex":0.00046285038,"about_ca_system_score_gemma":0.00029838772,"threshold_uncertainty_score":0.015184283},"labels":[],"label_agreement":null},{"id":"W1483241412","doi":"10.1007/978-3-642-01818-3_7","title":"Financial Forecasting Using Character N-Gram Analysis and Readability Scores of Annual Reports","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Readability; Computer science; Support vector machine; Artificial intelligence; Benchmark (surveying); n-gram; Natural language processing; Character (mathematics); Portfolio; Task (project management); Machine learning; Finance; Language model; Management; Mathematics","score_opus":0.08693918484533111,"score_gpt":0.3612053647158101,"score_spread":0.27426617987047897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483241412","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.75196797,0.0029500665,0.13963887,0.0014256974,0.0009729934,0.00019168247,0.047588903,0.013980612,0.041283213],"genre_scores_gemma":[0.89716065,0.0007916934,0.055494647,0.00006447827,0.00036696225,0.00016289334,0.032100957,0.00084749237,0.0130102895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929905,0.00017683298,0.00009622782,0.00012739243,0.0002456446,0.00005487489],"domain_scores_gemma":[0.9898839,0.004925174,0.0010185936,0.00074490206,0.0031698383,0.0002576189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011119462,0.0007585518,0.0003205711,0.005485023,0.00033457446,0.0018106377,0.0003970363,0.00052810146,0.008670816],"category_scores_gemma":[0.015736217,0.00017964732,0.00046256566,0.003252247,0.00015097714,0.0022783158,0.0005567582,0.00057923817,0.008084934],"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.0012711488,0.00022011239,0.08694762,0.00039752127,0.0001445665,0.00042362034,0.0007742527,0.00897817,0.025640143,0.0019950527,0.047809057,0.8253988],"study_design_scores_gemma":[0.00005997602,0.0006052691,0.41590598,0.00032426624,0.00035549374,0.0010292185,0.0020807306,0.46448714,0.042800207,0.0131547665,0.058926385,0.0002705535],"about_ca_topic_score_codex":0.0037995381,"about_ca_topic_score_gemma":0.004142176,"teacher_disagreement_score":0.008670816,"about_ca_system_score_codex":0.00041222165,"about_ca_system_score_gemma":0.0002599494,"threshold_uncertainty_score":0.02900672},"labels":[],"label_agreement":null},{"id":"W1483283902","doi":"10.1007/11422778_128","title":"A Node Cooperative ARQ Scheme for Wireless Ad-Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","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":"Retransmission; Computer network; Computer science; Wireless ad hoc network; Automatic repeat request; Node (physics); Fading; Cooperative diversity; Throughput; Hybrid automatic repeat request; Channel (broadcasting); Scheme (mathematics); Selective Repeat ARQ; Wireless; Mobile ad hoc network; Telecommunications; Engineering; Network packet; Telecommunications link; Mathematics","score_opus":0.03154592047554502,"score_gpt":0.2777628156912662,"score_spread":0.24621689521572118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483283902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017454965,0.0008941093,0.9753525,0.00017739894,0.0002798697,0.00013081713,0.000061698476,0.0007171275,0.0049315123],"genre_scores_gemma":[0.45528474,0.0011543393,0.5215943,0.0003275199,0.00027906802,0.00034459477,0.00022288444,0.00011077874,0.020681698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935836,0.00019294977,0.000028354867,0.000085060834,0.00027375665,0.00006153239],"domain_scores_gemma":[0.9991473,0.00029852698,0.000036127814,0.00023660176,0.00024237852,0.0000391294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010251602,0.0006267298,0.00073044834,0.00044505397,0.0008276248,0.0006056995,0.0017914651,0.000720136,0.0022023],"category_scores_gemma":[0.001318921,0.00025204226,0.00039488173,0.0007004778,0.0006441591,0.0009469142,0.001356374,0.00089227245,0.0010292189],"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.0007383716,0.00021602551,0.000457268,0.00031409023,0.00013421109,0.00042535126,0.0008505172,0.100419246,0.19594009,0.14302026,0.011562985,0.5459216],"study_design_scores_gemma":[0.00019174321,0.001147097,0.00064382714,0.000044762586,0.00016092177,0.0010559045,0.00013464868,0.8853144,0.030019896,0.04577155,0.035393476,0.00012177112],"about_ca_topic_score_codex":0.00081118307,"about_ca_topic_score_gemma":0.0012784025,"teacher_disagreement_score":0.0022023,"about_ca_system_score_codex":0.00042165452,"about_ca_system_score_gemma":0.0006256352,"threshold_uncertainty_score":0.007367432},"labels":[],"label_agreement":null},{"id":"W1483335260","doi":"10.1007/3-540-36228-2_64","title":"Inter-subband Redundancy Prediction Using Neural Network for Video Coding","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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":"Computer science; Codec; Redundancy (engineering); Wavelet; Coding (social sciences); Multiview Video Coding; Artificial neural network; Video compression picture types; Quality of service; Artificial intelligence; Real-time computing; Video quality; Video processing; Video tracking; Computer vision; Speech recognition; Computer network; Telecommunications","score_opus":0.036130753935369665,"score_gpt":0.2831169653874189,"score_spread":0.24698621145204921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483335260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060711868,0.0035735264,0.9277912,0.00022417893,0.00024720715,0.000046071425,0.00014299477,0.0010679496,0.006195011],"genre_scores_gemma":[0.6712145,0.00225405,0.3124465,0.000120824465,0.0001250052,0.00007027072,0.00029271314,0.000083983614,0.013392208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999434,0.0000094075585,0.000003525568,0.000012930289,0.000022444405,0.000008278329],"domain_scores_gemma":[0.99988616,0.000043291657,0.0000087811195,0.0000116705305,0.00004772161,0.0000023932344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017884916,0.00030294913,0.00023700511,0.0002401123,0.0001345643,0.00022674288,0.00038428933,0.00041208687,0.0016175314],"category_scores_gemma":[0.00041756488,0.00013520842,0.00018622843,0.00036684563,0.0001224168,0.00041226094,0.00016434382,0.00046270434,0.0003096661],"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.00019702809,0.00009559091,0.00046932514,0.00013275599,0.000045625515,0.00009443643,0.000030149464,0.21431822,0.06520127,0.005440006,0.0035302225,0.71044534],"study_design_scores_gemma":[0.0000035131538,0.000030170217,0.0002644617,0.000008081637,0.000013545675,0.00002604715,0.0000036441872,0.9852064,0.01299861,0.00076303066,0.00067713595,0.000005253509],"about_ca_topic_score_codex":0.0042265593,"about_ca_topic_score_gemma":0.0064695035,"teacher_disagreement_score":0.0042265593,"about_ca_system_score_codex":0.00030091114,"about_ca_system_score_gemma":0.00019597007,"threshold_uncertainty_score":0.008403957},"labels":[],"label_agreement":null},{"id":"W1483357561","doi":"10.1007/11760023_194","title":"Generalized Minimum Variance Neuro Controller for Power System Stabilization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power System Optimization and Stability","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 British Columbia","funders":"","keywords":"Control theory (sociology); Inverse; Computer science; Inverse dynamics; Controller (irrigation); Electric power system; Artificial neural network; Minimum-variance unbiased estimator; Inverse system; Minimum phase; Power (physics); Mathematics; Control (management); Transfer function; Artificial intelligence; Engineering; Mean squared error; Statistics","score_opus":0.010036656634559282,"score_gpt":0.20938214899318425,"score_spread":0.19934549235862498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483357561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011079542,0.0017832506,0.97681147,0.00018019743,0.0002824142,0.000024420397,0.00003391633,0.0006188064,0.009186003],"genre_scores_gemma":[0.86821866,0.0010568083,0.1148829,0.00028457583,0.00026620872,0.00011795918,0.00009164716,0.00011633547,0.014964876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998671,0.00003002746,0.000007546077,0.000032629086,0.00004892295,0.000013905831],"domain_scores_gemma":[0.99990547,0.00003612324,0.000010583906,0.000011402011,0.000033238262,0.0000030842073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002489879,0.0005699133,0.00063766056,0.00017779667,0.00027032706,0.0006404604,0.00058570795,0.0006150347,0.0020623794],"category_scores_gemma":[0.00043340115,0.00016262643,0.00029764586,0.00031514082,0.0002668941,0.00030620833,0.00041640198,0.0008428921,0.0004047708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016556428,0.00007214484,0.00018124573,0.00022869014,0.00013563484,0.000142106,0.00006331297,0.632694,0.018730184,0.023578638,0.007025452,0.31698307],"study_design_scores_gemma":[0.000014148137,0.00005800216,0.00016520315,0.0000108501235,0.000016659247,0.000033721324,0.000005116284,0.9902587,0.0014923972,0.006346775,0.0015904367,0.000008029685],"about_ca_topic_score_codex":0.0013308617,"about_ca_topic_score_gemma":0.0028485737,"teacher_disagreement_score":0.0020623794,"about_ca_system_score_codex":0.00025053814,"about_ca_system_score_gemma":0.00023636218,"threshold_uncertainty_score":0.006899357},"labels":[],"label_agreement":null},{"id":"W1483455599","doi":"10.1007/978-3-540-39899-8_32","title":"Modelling and Optimization of Bone-Cutting Forces in Orthopaedic Surgery","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced machining processes and optimization","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Machining; Computer science; Orientation (vector space); Mechanical engineering; Process (computing); Energy (signal processing); Geometry; Engineering; Mathematics; Artificial intelligence","score_opus":0.01252020869808821,"score_gpt":0.21423515530045684,"score_spread":0.20171494660236863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483455599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01826225,0.0045378073,0.959498,0.00027982387,0.00013069782,0.00004580545,0.00017093026,0.00039569533,0.016679084],"genre_scores_gemma":[0.582067,0.0071624136,0.36953795,0.00012377276,0.00014752922,0.00025232285,0.00041377018,0.0004982779,0.03979687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997451,0.000042620035,0.000016282576,0.000033475953,0.00014055152,0.000022031189],"domain_scores_gemma":[0.9997837,0.00012137886,0.000028811204,0.00001692275,0.00003909619,0.000010068751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043102115,0.00074115413,0.0012445416,0.0005372111,0.0002880679,0.0011676206,0.0016748003,0.0017944974,0.0036173312],"category_scores_gemma":[0.00087735796,0.00095744076,0.00087478524,0.0009839779,0.0006715539,0.0008203298,0.00059236545,0.00076667045,0.0009398808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011078403,0.0000114564245,0.0000756432,0.000060560986,0.000008242936,0.000018848019,0.000016093974,0.9803665,0.0011343381,0.004443965,0.00033352504,0.013519756],"study_design_scores_gemma":[0.000004061385,0.000009735845,0.00009455759,0.000011372764,0.0000049182704,0.000023502678,0.000004770808,0.994093,0.00056299724,0.003750907,0.0014343648,0.000005841036],"about_ca_topic_score_codex":0.005482625,"about_ca_topic_score_gemma":0.0067716525,"teacher_disagreement_score":0.005482625,"about_ca_system_score_codex":0.0005888481,"about_ca_system_score_gemma":0.00081183924,"threshold_uncertainty_score":0.012101114},"labels":[],"label_agreement":null},{"id":"W1483502941","doi":"10.1007/978-3-642-02809-0_69","title":"Within and Between-Subject Reliability Using Classic Jack for Ergonomic Assessments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ergonomics and Musculoskeletal Disorders","field":"Psychology","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":"McMaster University; Ford Motor Company (Canada)","funders":"","keywords":"Computer science; Reliability (semiconductor); Task (project management); Human–computer interaction; Subject (documents); Position (finance); Reliability engineering; Simulation; Systems engineering; World Wide Web; Engineering","score_opus":0.03565992983612737,"score_gpt":0.33389285895853793,"score_spread":0.29823292912241056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483502941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22300208,0.0014555737,0.7463598,0.000087521476,0.0010190788,0.0015094439,0.002032448,0.005518566,0.019015545],"genre_scores_gemma":[0.54064786,0.0004453726,0.43561932,0.00008232227,0.00012899819,0.0024421392,0.002195764,0.003207192,0.01523101],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9802797,0.008139469,0.0020576299,0.0038266233,0.005165656,0.0005310172],"domain_scores_gemma":[0.93210465,0.04374085,0.0021822117,0.009491897,0.012124631,0.0003558358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023232033,0.0015527037,0.0017512527,0.002856545,0.0013395565,0.0014405429,0.0017447169,0.0011273613,0.007298797],"category_scores_gemma":[0.052242216,0.0014634918,0.0021498166,0.0027370215,0.0010305081,0.0020516943,0.0018382128,0.0013832717,0.0036933776],"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.0044694566,0.00082456635,0.10541867,0.0019906315,0.0022878356,0.00047493182,0.009298359,0.011593275,0.07406472,0.008695633,0.020747317,0.7601346],"study_design_scores_gemma":[0.0003213081,0.0070830677,0.7190958,0.000745058,0.0024443215,0.0037298014,0.003563396,0.10585401,0.07073557,0.016780498,0.06881893,0.000828153],"about_ca_topic_score_codex":0.0010810632,"about_ca_topic_score_gemma":0.0053229975,"teacher_disagreement_score":0.023232033,"about_ca_system_score_codex":0.00057892903,"about_ca_system_score_gemma":0.0006486594,"threshold_uncertainty_score":0.12286419},"labels":[],"label_agreement":null},{"id":"W1483514369","doi":"10.1007/978-3-642-23629-7_8","title":"Sparse Multi-Shell Diffusion Imaging","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Center for Research Resources; National Institute of Mental Health","keywords":"Computer science; Spherical harmonics; Diffusion MRI; Shell (structure); Artificial intelligence; Representation (politics); Compressed sensing; Generalization; Pattern recognition (psychology); Artificial neural network; Computer vision; Algorithm; Magnetic resonance imaging; Physics; Mathematics; Materials science","score_opus":0.083009533607663,"score_gpt":0.33806608395518184,"score_spread":0.25505655034751884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483514369","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.0067149713,0.000597869,0.9885018,0.00043339338,0.000061583436,0.0000176847,0.00011635493,0.00048558868,0.003070911],"genre_scores_gemma":[0.13322158,0.0019462052,0.85388714,0.0002125972,0.00017275002,0.000044157223,0.00053482654,0.0003560663,0.009624688],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986994,0.00003509585,0.000012028562,0.000029148612,0.000043931148,0.000009801448],"domain_scores_gemma":[0.999212,0.00025691892,0.00011789874,0.00021334496,0.00014351388,0.000056206038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004125784,0.0007254823,0.00050131284,0.0006518175,0.0002762066,0.001084296,0.00056987966,0.0010248072,0.0048729773],"category_scores_gemma":[0.0022737149,0.0005123702,0.00046558926,0.0010043756,0.0004425702,0.0015795609,0.0010468031,0.0009702099,0.0022249413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031125892,0.00011064472,0.001989144,0.00070752105,0.00023785229,0.000712839,0.00025285583,0.083009616,0.2019155,0.07383131,0.018617928,0.61830354],"study_design_scores_gemma":[0.000032348744,0.00008734127,0.0013205752,0.00007316277,0.000114319446,0.003251175,0.00008042235,0.8216481,0.0837229,0.056516323,0.033097204,0.0000561986],"about_ca_topic_score_codex":0.00047854515,"about_ca_topic_score_gemma":0.0010535141,"teacher_disagreement_score":0.0048729773,"about_ca_system_score_codex":0.00015540693,"about_ca_system_score_gemma":0.00045121214,"threshold_uncertainty_score":0.016301751},"labels":[],"label_agreement":null},{"id":"W1483563006","doi":"10.1007/11766247_12","title":"Intelligent Information Personalization Leveraging Constraint Satisfaction and Association Rule Methods","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Personalization; Computer science; Consistency (knowledge bases); Information filtering system; Constraint (computer-aided design); Information retrieval; Constraint satisfaction problem; Relevance (law); Set (abstract data type); Constraint satisfaction; Association rule learning; Recommender system; Data mining; World Wide Web; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.017660564034717406,"score_gpt":0.26557442543268184,"score_spread":0.24791386139796442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483563006","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.0066372966,0.0002928257,0.98997784,0.00017705509,0.000033689037,0.000111636364,0.00015595728,0.0011168243,0.0014967817],"genre_scores_gemma":[0.10501493,0.0005021846,0.8900732,0.00015554698,0.0000860707,0.00014531851,0.0008514262,0.0002238211,0.0029474986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957289,0.001030479,0.00045030916,0.0007231146,0.0018628023,0.00020437379],"domain_scores_gemma":[0.99161506,0.004490881,0.00044758734,0.0017746371,0.001501981,0.0001699615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034721524,0.0009885277,0.002208392,0.0026682687,0.00091557193,0.0027191758,0.0028548192,0.00091569225,0.0040564835],"category_scores_gemma":[0.011881778,0.00077362446,0.0016179149,0.004424919,0.00077895256,0.0046749413,0.002210913,0.0019657332,0.0012537123],"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.00028642325,0.00041175957,0.0024480105,0.00042840253,0.00028005656,0.00028179312,0.00037750692,0.07903643,0.0078277,0.027246444,0.010986151,0.8703893],"study_design_scores_gemma":[0.000041882067,0.0000665905,0.0005165399,0.000048808633,0.00013509038,0.0002738623,0.000101073485,0.936635,0.011081844,0.042113926,0.008945115,0.00004032506],"about_ca_topic_score_codex":0.0055521755,"about_ca_topic_score_gemma":0.009067275,"teacher_disagreement_score":0.0055521755,"about_ca_system_score_codex":0.0005924216,"about_ca_system_score_gemma":0.0015781628,"threshold_uncertainty_score":0.018362701},"labels":[],"label_agreement":null},{"id":"W148359012","doi":"10.1007/978-3-642-35236-2_53","title":"An Innovative Way for Mining Clinical and Administrative Healthcare Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Athabasca University","funders":"","keywords":"Cosine similarity; Computer science; Sequence (biology); Similarity (geometry); Benchmark (surveying); Data mining; Set (abstract data type); String (physics); Value (mathematics); Vector space model; Rough set; Resource (disambiguation); Similarity measure; Term (time); Space (punctuation); Artificial intelligence; Information retrieval; Algorithm; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.1612009757850798,"score_gpt":0.41129959153838225,"score_spread":0.25009861575330244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148359012","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.00979081,0.0005054758,0.979083,0.0011920357,0.00032030718,0.00020003616,0.0030891043,0.0026349546,0.0031841628],"genre_scores_gemma":[0.050516687,0.00041251225,0.9394218,0.00054802897,0.00019546728,0.0002456905,0.0044535543,0.00015785718,0.004048369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973736,0.00049148226,0.00029162076,0.0006391273,0.0011173881,0.00008678728],"domain_scores_gemma":[0.9963553,0.0019025621,0.00020549238,0.0008503122,0.0005769027,0.00010945137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629441,0.00073018845,0.00094661023,0.003499301,0.0006259725,0.0030810635,0.0013776597,0.0011549691,0.0042159883],"category_scores_gemma":[0.00860568,0.0006271916,0.0020815192,0.0054327087,0.00046164967,0.0031506887,0.002500513,0.0014298537,0.002866334],"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.00025615052,0.00034778778,0.010789999,0.00038313726,0.0006129734,0.00052863685,0.00055208243,0.0061530066,0.0119841555,0.04315542,0.038625024,0.88661164],"study_design_scores_gemma":[0.00019570194,0.00035084467,0.015471772,0.0002946465,0.00064389093,0.004290515,0.00061903463,0.42145616,0.02778588,0.30887866,0.21980855,0.00020437088],"about_ca_topic_score_codex":0.001237044,"about_ca_topic_score_gemma":0.0023415466,"teacher_disagreement_score":0.0042159883,"about_ca_system_score_codex":0.00034182955,"about_ca_system_score_gemma":0.0012545759,"threshold_uncertainty_score":0.014103889},"labels":[],"label_agreement":null},{"id":"W1483653773","doi":"10.1007/3-540-44566-8_12","title":"User Modelling in I-Help: What, Why, When and How","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":73,"is_retracted":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":"Viewpoints; Computer science; Variety (cybernetics); Architecture; Human–computer interaction; World Wide Web; Knowledge management; Artificial intelligence","score_opus":0.03073654202155834,"score_gpt":0.23200079957932412,"score_spread":0.20126425755776578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483653773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1092784,0.017764295,0.5428202,0.037132543,0.0007102807,0.00026385486,0.0003479906,0.0030225574,0.28865987],"genre_scores_gemma":[0.88522536,0.0057375943,0.06466559,0.0016668967,0.00012651071,0.00014084985,0.0002897041,0.00044434302,0.041703172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681723,0.0018730637,0.000106795276,0.00027908958,0.0006608113,0.00026298923],"domain_scores_gemma":[0.99630296,0.0025094016,0.00014008512,0.00035478477,0.0003934138,0.0002994179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025640214,0.0006785829,0.0006079974,0.00048267626,0.0012526457,0.0059814784,0.0019912792,0.0031190387,0.0067692],"category_scores_gemma":[0.008444157,0.00069185795,0.00081979966,0.00065113575,0.0029255745,0.010886342,0.0026122748,0.0029289855,0.0031873856],"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.0006029472,0.0005921711,0.01529465,0.0017870478,0.00009909158,0.00089485967,0.1082737,0.014592792,0.006158348,0.38409606,0.07260897,0.3949994],"study_design_scores_gemma":[0.00009274045,0.0004292395,0.0060560335,0.0018424083,0.0002291844,0.00349646,0.038575977,0.13432893,0.01226162,0.4782715,0.32405746,0.00035837103],"about_ca_topic_score_codex":0.0067763072,"about_ca_topic_score_gemma":0.00596422,"teacher_disagreement_score":0.0067763072,"about_ca_system_score_codex":0.001660736,"about_ca_system_score_gemma":0.0013581837,"threshold_uncertainty_score":0.022645235},"labels":[],"label_agreement":null},{"id":"W1483690870","doi":"10.1007/11758525_26","title":"Computational Science: An Intermingling of Science, Mathematics, and Computer Science","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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 Waterloo","funders":"","keywords":"Computer science; Mathematics education; Plan (archaeology); Computational science; Mathematics","score_opus":0.05890597415692499,"score_gpt":0.3455370411105669,"score_spread":0.2866310669536419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483690870","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032362584,0.2523341,0.13280325,0.063683756,0.006592221,0.00008437202,0.00030268772,0.00048574372,0.54047763],"genre_scores_gemma":[0.12403624,0.31000122,0.16382042,0.026913252,0.019328006,0.00039403094,0.00079143426,0.0013134559,0.35340205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922705,0.00024028684,0.00003826118,0.00010155472,0.00035860724,0.000034260684],"domain_scores_gemma":[0.9963223,0.002786404,0.0000858708,0.00024146489,0.0003042225,0.00025979278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012890268,0.0007429205,0.0008742935,0.0024736265,0.0010004329,0.007685505,0.000991983,0.0014811772,0.010250721],"category_scores_gemma":[0.0030196558,0.0005663659,0.0004257413,0.004324563,0.008267613,0.009505729,0.0019474224,0.0053710165,0.0030746565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049323116,0.000012514998,0.00010737245,0.00021895416,0.0000063379384,0.00002714635,0.00054666604,0.00035389347,0.00027504523,0.8679911,0.067020394,0.06343571],"study_design_scores_gemma":[0.0000036395443,0.000008846847,0.00021280012,0.00021256767,0.0000038026708,0.0001744846,0.00021250908,0.00078798435,0.0001375859,0.512337,0.48589808,0.000010581284],"about_ca_topic_score_codex":0.0016132449,"about_ca_topic_score_gemma":0.0048561497,"teacher_disagreement_score":0.010250721,"about_ca_system_score_codex":0.002140787,"about_ca_system_score_gemma":0.0029415232,"threshold_uncertainty_score":0.034292042},"labels":[],"label_agreement":null},{"id":"W1483764956","doi":"10.1007/978-3-540-88682-2_11","title":"Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":33,"is_retracted":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":"Heuristics; Semidefinite programming; Photometric stereo; Surface (topology); Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Algorithm; Image (mathematics); Geometry","score_opus":0.03045247955788542,"score_gpt":0.2749274101821678,"score_spread":0.2444749306242824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483764956","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.0077434443,0.00012647234,0.98586243,0.0002310141,0.000047994603,0.000065511194,0.00013388623,0.0011039728,0.004685258],"genre_scores_gemma":[0.1601478,0.00015430851,0.83180517,0.00030709192,0.000082627295,0.00019708935,0.0008873712,0.0014865815,0.0049319067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763,0.0011025228,0.00013389849,0.00039879777,0.00047711004,0.00025759274],"domain_scores_gemma":[0.985671,0.01140293,0.0003933223,0.0011375179,0.0011280722,0.00026712636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032341427,0.0015410255,0.0018375884,0.0014823504,0.0012213815,0.0029793512,0.0030314296,0.0019449391,0.018800784],"category_scores_gemma":[0.013642854,0.0018291998,0.0018169112,0.0017073862,0.0018753428,0.005142479,0.0027735783,0.0048956443,0.0023177369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000652657,0.0004810076,0.00056422246,0.00047225793,0.00008618068,0.00024881368,0.0005040006,0.40988895,0.004274565,0.28426504,0.02788777,0.2706746],"study_design_scores_gemma":[0.000066942586,0.000053364565,0.00004095011,0.000039239927,0.000015190852,0.000049671515,0.00008474838,0.85914946,0.0014329086,0.13697219,0.002077321,0.00001797042],"about_ca_topic_score_codex":0.0025277357,"about_ca_topic_score_gemma":0.004182196,"teacher_disagreement_score":0.018800784,"about_ca_system_score_codex":0.0012394766,"about_ca_system_score_gemma":0.0015194359,"threshold_uncertainty_score":0.06289494},"labels":[],"label_agreement":null},{"id":"W1483785569","doi":"10.1007/11812128_10","title":"Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Concatenation (mathematics); Deterministic context-free grammar; Embedded pushdown automaton; Time complexity; Theoretical computer science; Simple (philosophy); Reduction (mathematics); Context-free grammar; Stateless protocol; Pushdown automaton; Algorithm; Rule-based machine translation; Automaton; Artificial intelligence; State (computer science); Tree-adjoining grammar; Mathematics; Arithmetic","score_opus":0.008559549543281935,"score_gpt":0.2297447781685894,"score_spread":0.22118522862530746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483785569","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.09129129,0.002097927,0.82079077,0.0130177755,0.0007244447,0.0004351801,0.0011341606,0.013702805,0.05680573],"genre_scores_gemma":[0.5194571,0.0015468219,0.44078526,0.002383038,0.0007525011,0.00055429514,0.0020760386,0.0058267154,0.02661825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863019,0.0040030587,0.00083183707,0.0023750465,0.004930874,0.0015572563],"domain_scores_gemma":[0.9417112,0.03326213,0.0010611202,0.020432571,0.0026666562,0.00086640223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058991807,0.0017523266,0.0021122321,0.0013729536,0.0022853,0.0059218355,0.005146433,0.0029132848,0.01823991],"category_scores_gemma":[0.04273243,0.0015209009,0.0028838124,0.0035791884,0.0051315394,0.018571708,0.010454598,0.0093146805,0.006758852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016403791,0.0007880554,0.0020175893,0.0011847637,0.0002058082,0.0003577557,0.0020432007,0.044504337,0.012677948,0.559404,0.051325332,0.3238508],"study_design_scores_gemma":[0.00014809922,0.000069363996,0.00019631938,0.000052375173,0.000082305356,0.00018190076,0.0002870603,0.058809176,0.00541374,0.92378294,0.0109476065,0.000029078426],"about_ca_topic_score_codex":0.0027826868,"about_ca_topic_score_gemma":0.0048028235,"teacher_disagreement_score":0.01823991,"about_ca_system_score_codex":0.0033529704,"about_ca_system_score_gemma":0.0052139885,"threshold_uncertainty_score":0.061018586},"labels":[],"label_agreement":null},{"id":"W1483831133","doi":"10.1007/11828563_8","title":"Demonic Algebra with Domain","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Université Laval","funders":"","keywords":"Domain (mathematical analysis); Algebra over a field; Operator (biology); Mathematics; Weyl algebra; Pure mathematics","score_opus":0.011636022332658022,"score_gpt":0.21664956786595088,"score_spread":0.20501354553329287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483831133","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012564955,0.0033129149,0.18919812,0.0036060084,0.0010699152,0.000052891777,0.0006366756,0.0005812531,0.78897727],"genre_scores_gemma":[0.60511816,0.0036838746,0.07525776,0.0030576603,0.001699072,0.00016492857,0.0016988599,0.0004604235,0.30885926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939334,0.000196993,0.000039280385,0.0001348416,0.0001696245,0.00006583373],"domain_scores_gemma":[0.9996594,0.0000790258,0.000021232923,0.000102286394,0.000086392014,0.000051607203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077226624,0.0006792283,0.00062316883,0.0014740153,0.0017234966,0.0029553627,0.00069852755,0.0007049415,0.020888336],"category_scores_gemma":[0.001101714,0.00030802222,0.000755627,0.0012721567,0.0034248335,0.0058542914,0.0023656995,0.0030970369,0.004672415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003131453,0.0000024980386,0.000014319694,0.000007408223,0.0000012348534,0.0000058236437,0.00003947736,0.000050431772,0.00007445667,0.99575067,0.001510246,0.0025403323],"study_design_scores_gemma":[0.0000026792384,0.0000028868094,0.000026495312,0.0000045612032,0.000001728527,0.000028677236,0.0000208349,0.0002761183,0.00013959898,0.98183835,0.017655365,0.0000027077585],"about_ca_topic_score_codex":0.0012793648,"about_ca_topic_score_gemma":0.0011450463,"teacher_disagreement_score":0.020888336,"about_ca_system_score_codex":0.0014666741,"about_ca_system_score_gemma":0.0007066783,"threshold_uncertainty_score":0.0698784},"labels":[],"label_agreement":null},{"id":"W1483840684","doi":"10.1007/11876663_40","title":"Electronic Portfolios as a Means for Initializing Learner Models for Adaptive Tutorials","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reflective Practices in Education","field":"Social 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":"University of Saskatchewan","funders":"","keywords":"Initialization; Computer science; Multimedia; Programming language","score_opus":0.05281673066213206,"score_gpt":0.367398489852632,"score_spread":0.31458175919049997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483840684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09509269,0.0002980351,0.87615496,0.00040947602,0.00011052715,0.00034448763,0.00016004527,0.003584044,0.023845801],"genre_scores_gemma":[0.49242073,0.000310151,0.487552,0.0000881684,0.000032676206,0.0003044894,0.00049046625,0.00039931724,0.018401945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867755,0.0006861306,0.00009051185,0.00013624523,0.0003541787,0.000055434153],"domain_scores_gemma":[0.9940838,0.0035673133,0.0002545378,0.00095977326,0.0009736843,0.00016091221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003031388,0.000551159,0.00030112034,0.00064819155,0.00037576354,0.003105561,0.0011432279,0.0009606682,0.0080583235],"category_scores_gemma":[0.019026907,0.0003917119,0.0002820709,0.00052413327,0.00030575268,0.004559376,0.002511079,0.001502254,0.0020304653],"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.0003588988,0.0007754906,0.00491731,0.00016222133,0.000042392974,0.00020444856,0.0032167847,0.028615301,0.011740897,0.028047847,0.005364047,0.9165543],"study_design_scores_gemma":[0.00016453365,0.0012565661,0.0071212575,0.00047343705,0.00019876435,0.000641,0.003238618,0.7546253,0.07707975,0.08434796,0.070722304,0.00013052401],"about_ca_topic_score_codex":0.0005188843,"about_ca_topic_score_gemma":0.00090820406,"teacher_disagreement_score":0.0080583235,"about_ca_system_score_codex":0.0004174769,"about_ca_system_score_gemma":0.00054871954,"threshold_uncertainty_score":0.02695775},"labels":[],"label_agreement":null},{"id":"W1483879247","doi":"10.1007/11734727_9","title":"Efficient Authenticators with Application to Key Exchange","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key exchange; Protocol (science); Discrete logarithm; Cryptographic protocol; Theoretical computer science; Cryptography; Key (lock); Construct (python library); Emulation; Computer security; Modular design; Computer network; Public-key cryptography; Encryption; Operating system","score_opus":0.009072022521687793,"score_gpt":0.2494246322031506,"score_spread":0.2403526096814628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483879247","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.0029281706,0.0004004043,0.98683286,0.0002447849,0.00012677781,0.000109463916,0.00005012924,0.0006580506,0.008649352],"genre_scores_gemma":[0.2576465,0.0018825207,0.68907547,0.00027003462,0.0005749824,0.0008529044,0.00037631585,0.0006682573,0.04865297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996666,0.0011289757,0.00019674472,0.00046644456,0.0012574123,0.00028442586],"domain_scores_gemma":[0.9934726,0.003277326,0.0002506198,0.0022786355,0.0006181198,0.00010278189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026708979,0.0014036141,0.0016645216,0.0013474103,0.0018146762,0.003371874,0.0027037773,0.0024452505,0.010463318],"category_scores_gemma":[0.011788615,0.0009920473,0.0008663809,0.002375731,0.003352491,0.008038733,0.0059807524,0.0040130657,0.0056504724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018795778,0.00005323414,0.00007180932,0.0001284356,0.000018439066,0.000088608525,0.00028623923,0.009025756,0.00446098,0.87745845,0.006342333,0.10187778],"study_design_scores_gemma":[0.00009064811,0.000075739335,0.000049735863,0.000046682744,0.000039087932,0.00026932402,0.00006247724,0.115413144,0.010686103,0.84309024,0.030135691,0.00004112421],"about_ca_topic_score_codex":0.0002260172,"about_ca_topic_score_gemma":0.00022297309,"teacher_disagreement_score":0.010463318,"about_ca_system_score_codex":0.00088031054,"about_ca_system_score_gemma":0.0011707825,"threshold_uncertainty_score":0.035003304},"labels":[],"label_agreement":null},{"id":"W1483906260","doi":"10.1007/978-3-540-45232-4_18","title":"Performance Analysis of a Software Design Using the UML Profile for Schedulability, Performance, and Time","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Scalability; Queueing theory; Applications of UML; Software design; Software; Distributed computing; Software engineering; Computer architecture; Programming language; Software development; Operating system; Computer network","score_opus":0.023889229420657878,"score_gpt":0.2509928288620507,"score_spread":0.22710359944139283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483906260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16399999,0.0005329278,0.81932074,0.00032307248,0.000068336514,0.00027694166,0.0006517029,0.0072462386,0.007580133],"genre_scores_gemma":[0.68337405,0.00040334466,0.30892858,0.00008951532,0.00004646585,0.00033410874,0.0013704809,0.0012609577,0.0041925153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974738,0.00070453394,0.0001723631,0.00019545571,0.0012233393,0.00023048019],"domain_scores_gemma":[0.99315464,0.004288335,0.00055670366,0.00071078376,0.0011734086,0.000116185955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002973066,0.0012523129,0.000587841,0.0022147,0.00053678034,0.0015055585,0.0008874151,0.00066510146,0.0031092225],"category_scores_gemma":[0.009762141,0.0006146008,0.0012736905,0.00082402816,0.00040112526,0.0014621783,0.0004909837,0.0010497005,0.0009224759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016799611,0.00051774405,0.010392755,0.0012399501,0.00025329477,0.00064543454,0.0013245112,0.42050275,0.14886929,0.062232915,0.007097184,0.34524417],"study_design_scores_gemma":[0.000048439088,0.00046866134,0.0023683007,0.00011450458,0.0001469654,0.00026870126,0.0000964205,0.9161198,0.06050377,0.012815958,0.0069962717,0.00005216817],"about_ca_topic_score_codex":0.0029084259,"about_ca_topic_score_gemma":0.001962927,"teacher_disagreement_score":0.0031092225,"about_ca_system_score_codex":0.0014930655,"about_ca_system_score_gemma":0.0015717482,"threshold_uncertainty_score":0.015723228},"labels":[],"label_agreement":null},{"id":"W1483915004","doi":"10.1007/978-3-540-77442-6_4","title":"Comprehension and Dependency Analysis of Aspect-Oriented Programs through Declarative Reasoning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"AspectJ; Computer science; Programming language; Dependency (UML); Program comprehension; Syntax; Prolog; Aspect-oriented programming; Comprehension; Set (abstract data type); Source code; Software engineering; Natural language processing; Software system; Software","score_opus":0.05275128160178383,"score_gpt":0.3170946908675187,"score_spread":0.26434340926573485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483915004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030330565,0.00007438586,0.9648618,0.00014452965,0.000011561804,0.00007432728,0.00012513559,0.0023861786,0.0019914987],"genre_scores_gemma":[0.36752716,0.0002960749,0.6272891,0.00009698488,0.000053325286,0.0001348401,0.0012130328,0.0011763817,0.0022130832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980716,0.00063618895,0.00014259212,0.00027301593,0.00071506575,0.00016163275],"domain_scores_gemma":[0.99095386,0.0064924587,0.00049135287,0.0010925609,0.00088568276,0.00008415747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150422,0.0006355161,0.00059112237,0.0011443764,0.0005801002,0.001613012,0.0017531494,0.0006810702,0.0030753273],"category_scores_gemma":[0.01255499,0.0008337366,0.0014559301,0.0008870182,0.0009825652,0.0038846645,0.0012830164,0.0019217619,0.0005132388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051207514,0.0006711628,0.00990155,0.0008180921,0.00020985703,0.001040787,0.004562025,0.09213546,0.046003867,0.272341,0.010235182,0.56156886],"study_design_scores_gemma":[0.000065875975,0.000097719574,0.002634814,0.000087951434,0.00017650993,0.00036764698,0.00037016388,0.6785779,0.055544324,0.25169253,0.010325759,0.00005881917],"about_ca_topic_score_codex":0.0016651533,"about_ca_topic_score_gemma":0.0021419474,"teacher_disagreement_score":0.0030753273,"about_ca_system_score_codex":0.0004633607,"about_ca_system_score_gemma":0.0009822592,"threshold_uncertainty_score":0.011372626},"labels":[],"label_agreement":null},{"id":"W1483916154","doi":"10.1007/978-3-540-85176-9_7","title":"Information Sharing Agents in a Peer Data Exchange System","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Carleton University","funders":"","keywords":"Computer science; Data exchange; Peer-to-peer; Data sharing; Set (abstract data type); Information retrieval; Process (computing); Information exchange; Order (exchange); Theoretical computer science; World Wide Web; Programming language","score_opus":0.05851569643856192,"score_gpt":0.27054393559011153,"score_spread":0.2120282391515496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483916154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17352307,0.0005802058,0.7924226,0.0016881217,0.00023788265,0.0006635033,0.00020116534,0.0026806323,0.028002745],"genre_scores_gemma":[0.6903342,0.00035746323,0.28562,0.00019591079,0.00013462325,0.00034643372,0.0003165474,0.00021147967,0.022483278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808395,0.0007883766,0.0001888295,0.00027591846,0.00047198345,0.00019097683],"domain_scores_gemma":[0.99717975,0.0010679419,0.00014216774,0.0008309929,0.00038882907,0.00039034677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029851638,0.00040773785,0.0011483846,0.00082918146,0.0036660938,0.0040854923,0.0023665854,0.0023148607,0.0059002773],"category_scores_gemma":[0.0045260573,0.00065375236,0.0005682205,0.0014697313,0.0014091932,0.006179338,0.004471478,0.0014361044,0.0014486057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020274187,0.0009357985,0.005515888,0.00034146616,0.0002425185,0.001981484,0.0049928245,0.12921882,0.018914366,0.6527743,0.016462501,0.16659264],"study_design_scores_gemma":[0.00037157588,0.00034194323,0.00073389616,0.000055360553,0.00022621175,0.00059426524,0.0012131348,0.6821946,0.013116099,0.24055828,0.06048661,0.00010801839],"about_ca_topic_score_codex":0.0031283097,"about_ca_topic_score_gemma":0.0025941767,"teacher_disagreement_score":0.0059002773,"about_ca_system_score_codex":0.000833656,"about_ca_system_score_gemma":0.0017298738,"threshold_uncertainty_score":0.019738376},"labels":[],"label_agreement":null},{"id":"W1483934113","doi":"10.1007/978-3-642-12659-8_10","title":"Modeling the Interactions between Poly(N-Vinylpyrrolidone) and Gas Hydrates: Factors Involved in Suppressing and Accelerating Hydrate Growth","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Methane Hydrates and Related Phenomena","field":"Environmental Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Clathrate hydrate; Hydrate; Crystal growth; Crystal (programming language); Materials science; Crystal structure; Monte Carlo method; Chemical physics; Chemical engineering; Nanotechnology; Chemistry; Crystallography; Computer science; Organic chemistry; Mathematics","score_opus":0.027908489365209007,"score_gpt":0.24048579581982854,"score_spread":0.21257730645461953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483934113","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.9273364,0.00079249026,0.055862967,0.00030381835,0.00006120095,0.000049603226,0.00035803005,0.00019667388,0.015038795],"genre_scores_gemma":[0.9829906,0.0004979458,0.0106262695,0.000034401,0.000016247712,0.00005581645,0.00015012462,0.000047618883,0.005580868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999455,0.000011104221,0.0000017767093,0.000014187705,0.000012472554,0.000014843312],"domain_scores_gemma":[0.99970645,0.00022459845,0.00003102719,0.0000068230333,0.000016032212,0.000014979579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013916646,0.00057189865,0.00041882304,0.00013559796,0.0002896266,0.00052555074,0.0005295267,0.000816872,0.0016644329],"category_scores_gemma":[0.0005480687,0.00033718577,0.0004396962,0.00018889594,0.00025153955,0.00063979236,0.00024772837,0.00036186213,0.00025533998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043932996,0.000047103567,0.000577563,0.00006010733,0.000010535897,0.00004783539,0.000015785425,0.97988015,0.01532826,0.0018992217,0.00013661804,0.0019529156],"study_design_scores_gemma":[0.0000051599854,0.000020588473,0.00013211422,9.219039e-7,0.0000041985327,0.0000050172425,0.000006832755,0.9962012,0.0031465811,0.00030513998,0.00016939503,0.0000028537431],"about_ca_topic_score_codex":0.0070477934,"about_ca_topic_score_gemma":0.006320336,"teacher_disagreement_score":0.0070477934,"about_ca_system_score_codex":0.00050439173,"about_ca_system_score_gemma":0.0005800577,"threshold_uncertainty_score":0.014013588},"labels":[],"label_agreement":null},{"id":"W1483987650","doi":"10.1007/978-3-540-85990-1_124","title":"A Theoretical Comparison of Different Target Registration Error Estimators","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":30,"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":"Estimator; Computer science; Noise (video); Fiducial marker; Algorithm; Mean squared error; Measure (data warehouse); Artificial intelligence; Maximum likelihood; Statistics; Mathematics; Data mining; Image (mathematics)","score_opus":0.015472526662508038,"score_gpt":0.25348154651995686,"score_spread":0.23800901985744882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483987650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075427447,0.0013855163,0.98748744,0.00035883617,0.000096175354,0.000028617209,0.000057858597,0.00022710116,0.0028157628],"genre_scores_gemma":[0.41370752,0.0043100463,0.57377726,0.00054366654,0.00060183473,0.00029630325,0.00071041094,0.0008700626,0.0051829675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99165136,0.003055108,0.00035056312,0.0009675274,0.0034802265,0.00049524877],"domain_scores_gemma":[0.95656455,0.034786437,0.001386714,0.003841026,0.0031397832,0.0002815234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014251269,0.0014281947,0.0015367204,0.0037149186,0.00088101206,0.0037964531,0.0034162076,0.0041980715,0.0046739588],"category_scores_gemma":[0.07468864,0.0011167225,0.0015082145,0.0033219685,0.0025706957,0.007205502,0.0043648286,0.0018702861,0.0013746991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008192435,0.00014117896,0.0025586581,0.00093351817,0.0002597415,0.00017190563,0.0002832048,0.273408,0.008519533,0.4898433,0.0029033797,0.2201583],"study_design_scores_gemma":[0.00007563741,0.00037482445,0.0017683348,0.00017421866,0.0001930863,0.0007579414,0.00014089186,0.8769929,0.008496835,0.10736241,0.0035780736,0.000084800246],"about_ca_topic_score_codex":0.00062554074,"about_ca_topic_score_gemma":0.0006980544,"teacher_disagreement_score":0.014251269,"about_ca_system_score_codex":0.0015985774,"about_ca_system_score_gemma":0.0010287375,"threshold_uncertainty_score":0.07536888},"labels":[],"label_agreement":null},{"id":"W1483992070","doi":"10.1007/3-540-44983-3_10","title":"Dynamic Multi-threshold Metering Schemes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Metering mode; Computer science; Server; Frame (networking); Audit; Construct (python library); Scheme (mathematics); Focus (optics); Real-time computing; Protocol (science); Computer network; Distributed computing; Mathematics; Engineering; Accounting; Business","score_opus":0.021845255038977194,"score_gpt":0.261660223650158,"score_spread":0.23981496861118082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483992070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03406328,0.0021441525,0.9060258,0.001340695,0.00044413915,0.00020959141,0.00028179758,0.0014618539,0.054028705],"genre_scores_gemma":[0.778079,0.0018403695,0.16595754,0.0005525148,0.00026622514,0.0002265975,0.00044233148,0.00021328419,0.052422147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986745,0.00024415393,0.00008990131,0.00025200343,0.00050814415,0.0002313837],"domain_scores_gemma":[0.99755716,0.0004470527,0.00019912656,0.0014709112,0.00021856868,0.00010722431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011282407,0.00073104067,0.0008370932,0.00094997254,0.0011154765,0.0020043545,0.0020882008,0.0011890392,0.007848252],"category_scores_gemma":[0.0032871515,0.0005021991,0.0005283915,0.002061829,0.0012841405,0.005418372,0.003790116,0.002879472,0.002447976],"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.00045400005,0.00014165966,0.00049636274,0.0002935514,0.000040729483,0.00014956678,0.00030928143,0.018267127,0.025929943,0.7019729,0.008306917,0.24363792],"study_design_scores_gemma":[0.00018836657,0.00028529434,0.00070978183,0.00018151282,0.00009855072,0.0020395077,0.00016392594,0.19073282,0.05704116,0.6406089,0.10783799,0.000112217596],"about_ca_topic_score_codex":0.0001098221,"about_ca_topic_score_gemma":0.00011862124,"teacher_disagreement_score":0.007848252,"about_ca_system_score_codex":0.001472965,"about_ca_system_score_gemma":0.0006684771,"threshold_uncertainty_score":0.026255071},"labels":[],"label_agreement":null},{"id":"W1483994939","doi":"10.1007/978-3-540-74958-5_15","title":"Decision Tree Instability and Active Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":61,"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":"Decision tree; Computer science; Stability (learning theory); Tree (set theory); Machine learning; Context (archaeology); Incremental decision tree; Active learning (machine learning); Artificial intelligence; Domain (mathematical analysis); ID3 algorithm; Instability; Decision tree learning; Mathematics","score_opus":0.01589490901043121,"score_gpt":0.27164184557573773,"score_spread":0.2557469365653065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483994939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03400282,0.005345859,0.933785,0.0023708718,0.0004978336,0.00005260681,0.000089527064,0.00035739466,0.023498166],"genre_scores_gemma":[0.8460893,0.0033900402,0.113723285,0.0006015704,0.0014088152,0.00015549987,0.00026785157,0.00029069383,0.03407295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892634,0.00034943808,0.00005959129,0.00016644744,0.0004172617,0.00008093563],"domain_scores_gemma":[0.98915046,0.008215084,0.00072259543,0.0007665676,0.0008335866,0.00031181102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023435694,0.00049964816,0.00090934965,0.0011565363,0.00065127254,0.0020646201,0.0014703905,0.0017217671,0.004154178],"category_scores_gemma":[0.020336524,0.00039121686,0.00049882795,0.0013100217,0.0019378563,0.0047358433,0.0015174551,0.003731073,0.00079311436],"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.00010143133,0.00008374597,0.0007938294,0.0001434675,0.000040995805,0.00011970891,0.0001870946,0.08259212,0.002518195,0.78398323,0.0075106025,0.12192555],"study_design_scores_gemma":[0.0000117537265,0.00002494218,0.00016476415,0.000018090615,0.000009249507,0.00008265187,0.000014615298,0.30566186,0.0013456619,0.6895683,0.003087705,0.000010399491],"about_ca_topic_score_codex":0.0004585445,"about_ca_topic_score_gemma":0.00034114622,"teacher_disagreement_score":0.004154178,"about_ca_system_score_codex":0.0007933869,"about_ca_system_score_gemma":0.00040130923,"threshold_uncertainty_score":0.013897121},"labels":[],"label_agreement":null},{"id":"W1484014009","doi":"10.1007/bfb0026093","title":"On the maximum path length of AVL trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Path length; Path (computing); Tree (set theory); Bounded function; Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.021525221077780408,"score_gpt":0.26746629434775215,"score_spread":0.24594107326997175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484014009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36249915,0.015286105,0.43588805,0.0047060526,0.00053524104,0.00017083257,0.0040763067,0.0015509978,0.1752873],"genre_scores_gemma":[0.80786276,0.007144858,0.15812624,0.0006307657,0.00093453366,0.00030115317,0.0030904769,0.001218172,0.020691013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987431,0.00032388695,0.00007408563,0.0002497556,0.0004250695,0.00018420059],"domain_scores_gemma":[0.98415816,0.012517721,0.0009835466,0.0008564252,0.0008949715,0.0005893111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016038318,0.0007258336,0.0010414872,0.0032337217,0.001398934,0.0028286723,0.0024461965,0.001215902,0.009115627],"category_scores_gemma":[0.016003972,0.0010119645,0.00067368435,0.0046354984,0.0019248383,0.0073937136,0.0022434122,0.0030253862,0.0015802694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000625496,0.00011438504,0.0041671665,0.0011925346,0.000094731,0.0001882462,0.00096934167,0.083344564,0.011373984,0.6647772,0.022977225,0.21017523],"study_design_scores_gemma":[0.000034287576,0.000072422845,0.001588756,0.00018138315,0.00005337702,0.0002157078,0.00019925983,0.093108095,0.002477204,0.8896745,0.012356813,0.000038230457],"about_ca_topic_score_codex":0.0015177066,"about_ca_topic_score_gemma":0.0027092397,"teacher_disagreement_score":0.009115627,"about_ca_system_score_codex":0.0024236504,"about_ca_system_score_gemma":0.0007828294,"threshold_uncertainty_score":0.030494869},"labels":[],"label_agreement":null},{"id":"W1484029852","doi":"10.1007/11424918_43","title":"English to Chinese Translation of Prepositions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"Computer science; Machine translation; Natural language processing; WordNet; Artificial intelligence; Focus (optics); Task (project management); Set (abstract data type); Process (computing); Semantic interpretation; Example-based machine translation; Translation (biology); Programming language","score_opus":0.00973105556912057,"score_gpt":0.26345571797641587,"score_spread":0.2537246624072953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484029852","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13319959,0.0066774543,0.2588696,0.0042487048,0.007437122,0.0006639611,0.021267524,0.012827229,0.5548088],"genre_scores_gemma":[0.5201037,0.006868937,0.24754612,0.0011765113,0.00095617224,0.00034590013,0.02602884,0.0051392857,0.19183452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996593,0.00007155267,0.000051992167,0.000082156505,0.000092764945,0.000042299333],"domain_scores_gemma":[0.999395,0.00012652788,0.000027161252,0.00012713255,0.0002995725,0.000024481134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004049576,0.00096302613,0.0004773278,0.000666358,0.00063500146,0.001294516,0.0005005174,0.00037882783,0.03340487],"category_scores_gemma":[0.0012430447,0.00035068425,0.00039623925,0.0013159749,0.00060388434,0.0012613018,0.0008132569,0.0008144819,0.017126061],"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.00086865673,0.00017854378,0.001249376,0.002504375,0.000054297103,0.00350912,0.0042761895,0.002293769,0.08162609,0.1792282,0.18845683,0.53575456],"study_design_scores_gemma":[0.000108697874,0.00020949786,0.0023256617,0.00025354876,0.0001188476,0.0019740232,0.0011123011,0.008367653,0.08175719,0.02151418,0.88220716,0.000051308332],"about_ca_topic_score_codex":0.0034771452,"about_ca_topic_score_gemma":0.0033769798,"teacher_disagreement_score":0.03340487,"about_ca_system_score_codex":0.0006967706,"about_ca_system_score_gemma":0.0015481338,"threshold_uncertainty_score":0.111750364},"labels":[],"label_agreement":null},{"id":"W1484043954","doi":"10.1007/3-540-45417-9_49","title":"Towards a Portable, Fast Parallel AP3M-SPH Code: HYDRA_MPI","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Particle accelerators and beam dynamics","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":"McMaster University","funders":"","keywords":"Computer science; Parallel computing; Solver; Message Passing Interface; Message passing; Code (set theory); Domain decomposition methods; Domain (mathematical analysis); Task (project management); Smoothed-particle hydrodynamics; Computational science; Programming language; Physics; Astrophysics","score_opus":0.014568745458528947,"score_gpt":0.22698846975781806,"score_spread":0.2124197242992891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484043954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017923849,0.00033860627,0.8828038,0.0007792888,0.0005919568,0.00023105017,0.0020019365,0.07351935,0.0218102],"genre_scores_gemma":[0.10171832,0.0002217416,0.8579391,0.00043976202,0.000241591,0.0005630798,0.0037893828,0.016418586,0.018668432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939895,0.00009808559,0.00003024929,0.00007337365,0.0003346215,0.00006465033],"domain_scores_gemma":[0.99849725,0.00034651277,0.00004389427,0.00044247633,0.0005059625,0.00016386372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011418381,0.00096189626,0.0012851323,0.0008252528,0.0012263539,0.0015362375,0.004560168,0.0013765083,0.020405035],"category_scores_gemma":[0.003941013,0.0010502551,0.00095972087,0.0014237745,0.0008140989,0.0016858043,0.002919419,0.0030491524,0.013637393],"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.001088435,0.0004531015,0.0034257032,0.00071735075,0.00031066724,0.0004404781,0.0006526989,0.13707136,0.032889415,0.1022815,0.22861187,0.49205738],"study_design_scores_gemma":[0.00039036985,0.000075336626,0.00091609586,0.000046884223,0.00004841495,0.00010974667,0.00006160917,0.8711261,0.01914686,0.04113054,0.06687481,0.000073211624],"about_ca_topic_score_codex":0.0043627135,"about_ca_topic_score_gemma":0.003337004,"teacher_disagreement_score":0.020405035,"about_ca_system_score_codex":0.00054500904,"about_ca_system_score_gemma":0.0016233169,"threshold_uncertainty_score":0.06826162},"labels":[],"label_agreement":null},{"id":"W1484050045","doi":"10.1007/11424918_34","title":"A Supervised Learning Approach to Acronym Identification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Acronym; Computer science; Identification (biology); Task (project management); Supervised learning; Artificial intelligence; Space (punctuation); Machine learning; Artificial neural network","score_opus":0.019655489861354552,"score_gpt":0.2625764853685928,"score_spread":0.24292099550723825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484050045","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.005308127,0.00046292014,0.98775196,0.00027389315,0.0001695697,0.00015620404,0.00066796015,0.0034177778,0.0017915339],"genre_scores_gemma":[0.05487598,0.00027424048,0.93588585,0.00022198356,0.00022819766,0.00026907263,0.0025683343,0.00027540413,0.005400913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995726,0.0013667728,0.00039486302,0.0011334771,0.0012068667,0.00017205338],"domain_scores_gemma":[0.9926086,0.0037344652,0.00036296094,0.0013806267,0.0017320275,0.00018144769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826645,0.0011458091,0.0017699333,0.0043155323,0.0021700417,0.0023428237,0.0047909906,0.0018875197,0.005164893],"category_scores_gemma":[0.008179484,0.00076602114,0.0022476825,0.0047426983,0.0011620307,0.0037676394,0.002968189,0.0025304793,0.0033844765],"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.0001923947,0.00056589703,0.0015366877,0.00025742358,0.0001707262,0.00016490466,0.0002180941,0.028598914,0.0051282872,0.018040506,0.031972162,0.913154],"study_design_scores_gemma":[0.000055655193,0.000087741886,0.00069828826,0.00005550985,0.00008719559,0.0003201248,0.00017186302,0.8979626,0.0051924107,0.081861675,0.013453082,0.000053872838],"about_ca_topic_score_codex":0.005748968,"about_ca_topic_score_gemma":0.012913997,"teacher_disagreement_score":0.005748968,"about_ca_system_score_codex":0.0010393882,"about_ca_system_score_gemma":0.0028659906,"threshold_uncertainty_score":0.017278254},"labels":[],"label_agreement":null},{"id":"W1484056815","doi":"10.1007/978-3-642-30057-8_5","title":"Waters Signatures with Optimal Security Reduction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":70,"is_retracted":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":"Reduction (mathematics); Cryptosystem; Computer science; Signature (topology); Concrete security; Pairing; Theoretical computer science; Adversarial system; Cryptography; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.009463093335293276,"score_gpt":0.21925516858228092,"score_spread":0.20979207524698765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484056815","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.04891486,0.001823173,0.70567226,0.004929699,0.0015771689,0.00032619352,0.0007943522,0.0032671755,0.23269507],"genre_scores_gemma":[0.61424255,0.0020534694,0.24085708,0.0014314392,0.0010313112,0.00046430476,0.0013483043,0.0016149931,0.13695666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968939,0.0005611697,0.00016944023,0.00044179044,0.0014419324,0.0004917479],"domain_scores_gemma":[0.9987797,0.0003594912,0.00006400259,0.00055922125,0.0001743202,0.00006315802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428186,0.001255518,0.0013959835,0.0012552207,0.001687206,0.0033768162,0.0015332907,0.0015137893,0.016755706],"category_scores_gemma":[0.0036992477,0.0008478877,0.00152741,0.001920554,0.003048626,0.007448196,0.005453272,0.0051717185,0.007083582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019271119,0.000064297405,0.00006237281,0.000118295764,0.000021996022,0.00004577008,0.000105335406,0.0058921054,0.0030145189,0.9070044,0.009993064,0.073485166],"study_design_scores_gemma":[0.000024432627,0.00001944244,0.000026268317,0.000016355756,0.000013178768,0.0000640669,0.00002891268,0.007962515,0.004238839,0.9749279,0.012660484,0.00001767282],"about_ca_topic_score_codex":0.00048643042,"about_ca_topic_score_gemma":0.0004920102,"teacher_disagreement_score":0.016755706,"about_ca_system_score_codex":0.0015312749,"about_ca_system_score_gemma":0.0019823688,"threshold_uncertainty_score":0.0560534},"labels":[],"label_agreement":null},{"id":"W1484103301","doi":"10.1007/978-3-642-20728-0_8","title":"Common Randomness and Secret Key Capacities of Two-Way Channels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","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":"University of Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Computer science; Channel (broadcasting); Key (lock); Channel capacity; Binary number; Theoretical computer science; Coding (social sciences); Information theory; Cryptography; Key generation; Binary erasure channel; Binary symmetric channel; Channel code; Adversary; Information-theoretic security; Algorithm; Discrete mathematics; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","score_opus":0.02068454533193444,"score_gpt":0.23451758106103648,"score_spread":0.21383303572910203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484103301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18208374,0.006896448,0.625646,0.0044104694,0.00032020098,0.00021129246,0.0013541436,0.00041343973,0.17866428],"genre_scores_gemma":[0.95484364,0.003275428,0.02491793,0.00025858288,0.00039815015,0.0004831275,0.00042801522,0.00020351468,0.015191565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956713,0.0014781995,0.00018492872,0.0004869376,0.0014537965,0.000724949],"domain_scores_gemma":[0.9715954,0.023575297,0.00092970044,0.002309203,0.001087954,0.0005025007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00342639,0.0013396459,0.0014140111,0.0023802526,0.0013177269,0.005186196,0.0023510351,0.0024203612,0.008661152],"category_scores_gemma":[0.019385345,0.0010881439,0.0011640681,0.0031582278,0.0064475774,0.009445891,0.0035211458,0.0052703335,0.0010030488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006453319,0.000011922536,0.000054190816,0.000059630478,0.000010995818,0.000036135236,0.00012518834,0.0117083145,0.0005826123,0.98291093,0.0009350996,0.0035005142],"study_design_scores_gemma":[0.000017482702,0.000009545849,0.00006186487,0.000028005137,0.0000071147065,0.000056480723,0.000027199274,0.021782905,0.00052770006,0.976447,0.0010165187,0.000018252302],"about_ca_topic_score_codex":0.0008878109,"about_ca_topic_score_gemma":0.00043455654,"teacher_disagreement_score":0.008661152,"about_ca_system_score_codex":0.0030315467,"about_ca_system_score_gemma":0.0017566995,"threshold_uncertainty_score":0.028974414},"labels":[],"label_agreement":null},{"id":"W1484149962","doi":"10.1007/978-3-540-24608-4_3","title":"An Exploration in Using Cognitive Coherence Theory to Automate BDI Agents’ Communicational Behavior","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Computer science; Coherence (philosophical gambling strategy); Cognition; Cognitive science; Artificial intelligence; Human–computer interaction; Psychology; Mathematics","score_opus":0.08299652385912311,"score_gpt":0.3315125137219529,"score_spread":0.2485159898628298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484149962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005135211,0.00013150604,0.99004,0.00028627267,0.000024779432,0.000070854956,0.000035977984,0.0015751547,0.0027003144],"genre_scores_gemma":[0.16393153,0.00017962008,0.83343405,0.000117893695,0.000018545912,0.00013765278,0.00011988647,0.00037649664,0.0016843054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865425,0.0005953839,0.000084656764,0.00024202431,0.00033566836,0.00008797983],"domain_scores_gemma":[0.9936079,0.0039359103,0.00022030048,0.0013844226,0.0007486156,0.00010289396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032770904,0.00078914297,0.00078073266,0.00094448816,0.00092830876,0.0029883985,0.0024123702,0.0009449481,0.006677124],"category_scores_gemma":[0.012711464,0.00077120535,0.0010671085,0.00085868454,0.0017834379,0.005015964,0.0017910721,0.0022745642,0.0013431656],"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.000294561,0.0002647907,0.0018781478,0.0005109002,0.00012079263,0.0001623071,0.0018994497,0.070453994,0.008909957,0.34202796,0.0047960184,0.5686811],"study_design_scores_gemma":[0.000047304602,0.00009251454,0.00044773283,0.00009092029,0.000036391863,0.00011204566,0.00030394335,0.6901605,0.009620991,0.28946814,0.009581225,0.00003827812],"about_ca_topic_score_codex":0.0043299105,"about_ca_topic_score_gemma":0.005237286,"teacher_disagreement_score":0.006677124,"about_ca_system_score_codex":0.0011521829,"about_ca_system_score_gemma":0.001634594,"threshold_uncertainty_score":0.022337198},"labels":[],"label_agreement":null},{"id":"W148418788","doi":"10.1007/978-3-642-21596-4_12","title":"Fingerprint Verification Using Rotation Invariant Feature Codes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Thresholding; Pattern recognition (psychology); Fingerprint (computing); Principal component analysis; Curse of dimensionality; Dimensionality reduction; Rotation (mathematics); Invariant (physics); Gabor filter; Discriminant; Computer vision; Feature extraction; Image (mathematics); Mathematics","score_opus":0.04325197266084318,"score_gpt":0.2612803189287392,"score_spread":0.21802834626789602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148418788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053321607,0.0024022118,0.9325414,0.00011002522,0.00018658553,0.00009147126,0.00024493856,0.0023133217,0.008788455],"genre_scores_gemma":[0.54371554,0.0021215717,0.43293798,0.00007813092,0.00007153666,0.000050908926,0.00050781324,0.00018441342,0.020332117],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932456,0.00007703453,0.00003505139,0.0001300695,0.00036544667,0.00006781683],"domain_scores_gemma":[0.9992416,0.00023372153,0.000073187264,0.0002600612,0.00017644817,0.000015149697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049164734,0.0004711847,0.0007545875,0.0010802452,0.00031984728,0.000762088,0.00072561647,0.00066361384,0.0066071884],"category_scores_gemma":[0.0017833164,0.0002630737,0.00043563492,0.001097308,0.00036606606,0.0013136731,0.0008222829,0.00036970378,0.0027101443],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026379808,0.000034937122,0.00096889475,0.00016528794,0.00003354408,0.0001771702,0.00003257458,0.0053631035,0.1407309,0.004199856,0.0017992265,0.8462308],"study_design_scores_gemma":[0.000056161105,0.00056640117,0.010920459,0.0001450592,0.0002272502,0.0056323097,0.00012561024,0.39727503,0.555822,0.0065716654,0.022519851,0.00013815808],"about_ca_topic_score_codex":0.0010567337,"about_ca_topic_score_gemma":0.001141644,"teacher_disagreement_score":0.0066071884,"about_ca_system_score_codex":0.00028496695,"about_ca_system_score_gemma":0.00044456933,"threshold_uncertainty_score":0.02210319},"labels":[],"label_agreement":null},{"id":"W1484372654","doi":"10.1007/978-3-540-87608-3_10","title":"An Improved Safety Solver in Go Using Partial Regions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Computer science; Margin (machine learning); Problem solver; Algorithm; Computer graphics (images); Computational science; Programming language; Machine learning","score_opus":0.04546164751459495,"score_gpt":0.2925259192794561,"score_spread":0.24706427176486115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484372654","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.013477779,0.00016097234,0.96233445,0.0002929234,0.00015698033,0.000174339,0.00026132577,0.005201335,0.017939871],"genre_scores_gemma":[0.19111207,0.00015929023,0.7917541,0.00042479098,0.00008391764,0.00027486423,0.00067907275,0.0015842513,0.013927617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990415,0.00019912317,0.000052282034,0.00020169876,0.00032654527,0.00017884164],"domain_scores_gemma":[0.9990246,0.00052949466,0.000047512458,0.00019371303,0.0001559998,0.000048638718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000939417,0.001336203,0.0012823921,0.00083767046,0.00086184946,0.0013372035,0.0026234514,0.0013431604,0.015570829],"category_scores_gemma":[0.002762497,0.00066324713,0.0016527788,0.0008657665,0.0012214449,0.0024209656,0.0036628018,0.0028498918,0.0027243893],"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.0009495596,0.0003614141,0.0007984461,0.0012272579,0.00016776762,0.00055941264,0.00063066016,0.24922878,0.021991171,0.28556535,0.027040297,0.41147986],"study_design_scores_gemma":[0.00042231314,0.00021596905,0.00019346882,0.00012288072,0.00016232651,0.00018275662,0.0001728382,0.6818003,0.017510729,0.2699869,0.029184889,0.000044604174],"about_ca_topic_score_codex":0.0027611903,"about_ca_topic_score_gemma":0.0060715424,"teacher_disagreement_score":0.015570829,"about_ca_system_score_codex":0.0006635215,"about_ca_system_score_gemma":0.0015570045,"threshold_uncertainty_score":0.052089572},"labels":[],"label_agreement":null},{"id":"W1484390872","doi":"10.1007/978-3-642-15585-7_12","title":"TeCReVis: A Tool for Test Coverage and Test Redundancy Visualization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Calgary","funders":"","keywords":"Redundancy (engineering); Computer science; Visualization; Eclipse; Code coverage; Graphical user interface testing; Graphical user interface; Set (abstract data type); Test (biology); Plug-in; Programming language; Software engineering; Data mining; Software; User interface; Operating system; User interface design","score_opus":0.015134570891314921,"score_gpt":0.2711252888983332,"score_spread":0.2559907180070183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484390872","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.005949933,0.00042734956,0.6309614,0.00018428676,0.000102117854,0.00013388965,0.0063156695,0.34718433,0.008740895],"genre_scores_gemma":[0.14108635,0.00086828205,0.75897807,0.00036381153,0.00013249529,0.0007671856,0.019972658,0.06365315,0.014177948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.00016303302,0.000084826475,0.00012559528,0.00041544167,0.00007012545],"domain_scores_gemma":[0.99635386,0.0023179709,0.00023509059,0.000526522,0.0004635466,0.00010301119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013961936,0.0026468278,0.0010817766,0.004664452,0.0005482069,0.002324517,0.0022177938,0.0013304491,0.042435013],"category_scores_gemma":[0.006697437,0.0014546592,0.0013045892,0.0022859168,0.0004004089,0.0025006938,0.0018851488,0.0015364725,0.0064861584],"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.000596667,0.00016886897,0.004126942,0.0016064772,0.00023005217,0.00082211243,0.00082588283,0.03295304,0.019576887,0.02162552,0.24294014,0.6745274],"study_design_scores_gemma":[0.00048723567,0.00021406275,0.0038819634,0.00071375887,0.00029195705,0.0019339473,0.0002476476,0.60351,0.07913247,0.04932836,0.26000318,0.00025546932],"about_ca_topic_score_codex":0.002847336,"about_ca_topic_score_gemma":0.0035175337,"teacher_disagreement_score":0.042435013,"about_ca_system_score_codex":0.0006042329,"about_ca_system_score_gemma":0.0009461692,"threshold_uncertainty_score":0.14195931},"labels":[],"label_agreement":null},{"id":"W1484408475","doi":"10.1007/978-3-642-23041-7_12","title":"When Both Transmitting and Receiving Energies Matter: An Application of Network Coding in Wireless Body Area Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":17,"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":"FP7 Information and Communication Technologies; Natural Sciences and Engineering Research Council of Canada; European Commission; Georgia Institute of Technology","keywords":"Computer science; Network packet; Linear network coding; Computer network; Wireless sensor network; Wireless network; Redundancy (engineering); Star network; Wireless; Telecommunications; Network topology; Ring network","score_opus":0.009324725296259077,"score_gpt":0.196322995735115,"score_spread":0.18699827043885592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484408475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0490047,0.007865894,0.8443667,0.0056401966,0.00091258495,0.000050204526,0.00013061079,0.0002055874,0.091823444],"genre_scores_gemma":[0.88560855,0.010164285,0.07403062,0.00081485644,0.0013650286,0.000078320154,0.00007559025,0.00027978575,0.027582996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992261,0.0003052707,0.000022756312,0.000095027084,0.00025536842,0.00009542158],"domain_scores_gemma":[0.99558544,0.0036158606,0.0002115197,0.0001847228,0.0003467168,0.00005578265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013368261,0.0005386914,0.00074487494,0.00046784058,0.00068935397,0.0022737407,0.0011539673,0.0018195517,0.0025772979],"category_scores_gemma":[0.008505209,0.0005758363,0.00047685645,0.0011713225,0.0033844698,0.003798589,0.0016843757,0.0023286429,0.00029743026],"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.0000681111,0.000031267275,0.0005572657,0.00010204123,0.00002329033,0.00027401853,0.00046519106,0.11883876,0.0033141985,0.8462277,0.0035646528,0.026533559],"study_design_scores_gemma":[0.000010211013,0.000014350757,0.00037093883,0.00005215328,0.000020566042,0.00020079545,0.00019912809,0.45561996,0.0010881795,0.53835297,0.004032292,0.00003852182],"about_ca_topic_score_codex":0.00328678,"about_ca_topic_score_gemma":0.002675075,"teacher_disagreement_score":0.00328678,"about_ca_system_score_codex":0.0012749285,"about_ca_system_score_gemma":0.0007137355,"threshold_uncertainty_score":0.009250283},"labels":[],"label_agreement":null},{"id":"W1484428591","doi":"10.1007/11425274_22","title":"Subsystem Based Generalizations of Rough Set Approximations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":33,"is_retracted":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":"Equivalence relation; Binary relation; Rough set; Binary number; Computer science; Approximations of π; Relation (database); Equivalence (formal languages); Set (abstract data type); Construct (python library); Binary operation; Theoretical computer science; Equivalence class (music); Algorithm; Algebra over a field; Applied mathematics; Discrete mathematics; Mathematics; Data mining; Pure mathematics; Arithmetic; Programming language","score_opus":0.028922312207066297,"score_gpt":0.24708280198849275,"score_spread":0.21816048978142646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484428591","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.026591765,0.0010391263,0.9637493,0.00015555746,0.00008022394,0.00003995122,0.0002108453,0.00023970801,0.00789356],"genre_scores_gemma":[0.56114066,0.0030485254,0.42302337,0.00011908929,0.00029782986,0.00019910559,0.0012295991,0.00018043512,0.010761391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987992,0.00042603008,0.00007579558,0.00016058692,0.00046369268,0.000074725875],"domain_scores_gemma":[0.9979493,0.00080172444,0.00021233819,0.000600363,0.0003436431,0.000092644594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001865181,0.00059705303,0.0016251466,0.001689138,0.00051110785,0.0017069506,0.0013867974,0.00052928115,0.003187487],"category_scores_gemma":[0.004613275,0.00055931945,0.002116102,0.002375,0.0007555723,0.00281375,0.0015111163,0.0015722974,0.0005805926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105350715,0.000035725763,0.000971435,0.00026064107,0.00018707111,0.0001731609,0.0004233662,0.11309032,0.002812305,0.80718684,0.0028552904,0.07189852],"study_design_scores_gemma":[0.000012525706,0.00008984797,0.0007363241,0.000032993725,0.000079030935,0.00013754953,0.00008203994,0.48496908,0.0007961395,0.5073875,0.0056514344,0.000025500782],"about_ca_topic_score_codex":0.0020162526,"about_ca_topic_score_gemma":0.001988905,"teacher_disagreement_score":0.003187487,"about_ca_system_score_codex":0.00090711605,"about_ca_system_score_gemma":0.0006164778,"threshold_uncertainty_score":0.010663152},"labels":[],"label_agreement":null},{"id":"W1484429910","doi":"10.1007/3-540-45526-4_8","title":"Computing Entropy Maps of Finite-Automaton-Encoded Binary Images","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hausdorff dimension; Automaton; Computer science; ENCODE; Entropy (arrow of time); Algorithm; Theoretical computer science; Finite-state machine; Hausdorff distance; Image (mathematics); Nondeterministic finite automaton; Artificial intelligence; Mathematics; Pattern recognition (psychology); Automata theory; Combinatorics","score_opus":0.015561732029839721,"score_gpt":0.24614620578490468,"score_spread":0.23058447375506497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484429910","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.7167396,0.00022412372,0.27568197,0.00022061849,0.00008552386,0.000037600745,0.00035240952,0.0008687742,0.0057894094],"genre_scores_gemma":[0.96573514,0.00006352318,0.032655247,0.000028441498,0.000029682617,0.000019487248,0.0002524948,0.000083780724,0.001132145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999684,0.00006773048,0.000019572082,0.000070409085,0.000102493475,0.000055892335],"domain_scores_gemma":[0.9981627,0.001236949,0.00013489112,0.00019342726,0.00016998693,0.00010199872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044328903,0.00030391885,0.00055977545,0.0008855547,0.000374219,0.0015450176,0.0007297119,0.0006456185,0.0027277377],"category_scores_gemma":[0.0039210613,0.00029770035,0.00039341464,0.00058519124,0.00079421635,0.0029626004,0.0011788124,0.00065667817,0.00024374128],"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.0022451796,0.00029241334,0.007982941,0.00042676172,0.00013372583,0.0007058657,0.00087850465,0.16566728,0.10257622,0.5311101,0.003103295,0.18487766],"study_design_scores_gemma":[0.000037368827,0.00010890065,0.0026167133,0.000026860725,0.000029178796,0.00015990362,0.00015654722,0.6056289,0.039795484,0.35051262,0.0008873005,0.000040311734],"about_ca_topic_score_codex":0.00052855216,"about_ca_topic_score_gemma":0.00082843547,"teacher_disagreement_score":0.0027277377,"about_ca_system_score_codex":0.00065497996,"about_ca_system_score_gemma":0.0002671874,"threshold_uncertainty_score":0.009125233},"labels":[],"label_agreement":null},{"id":"W1484451046","doi":"10.1007/978-3-540-89641-8_27","title":"A New Message Recognition Protocol for Ad Hoc Pervasive Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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 Waterloo","funders":"","keywords":"Computer science; Protocol (science); Hash function; Wireless ad hoc network; Computer network; Mobile ad hoc network; Flexibility (engineering); Ad hoc wireless distribution service; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Computer security; Routing protocol; Wireless; Network packet","score_opus":0.03001622151295368,"score_gpt":0.2684930525539955,"score_spread":0.23847683104104184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484451046","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.0035498908,0.0012916039,0.9771502,0.00042058152,0.0013677971,0.00041420755,0.0001592218,0.008050748,0.0075957575],"genre_scores_gemma":[0.09713225,0.0026416718,0.8310318,0.0012139197,0.0011975253,0.0017308992,0.0015130359,0.0019007815,0.06163803],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776435,0.00043172916,0.00025902377,0.00028036328,0.0010251874,0.00023935802],"domain_scores_gemma":[0.99701166,0.00083476,0.00018768886,0.001030391,0.0007602994,0.00017524046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019061238,0.0012515552,0.0014948373,0.0015256724,0.0013209066,0.002549132,0.003228041,0.00213901,0.008590154],"category_scores_gemma":[0.004351624,0.00081789267,0.000705002,0.0013707033,0.0010083853,0.006131495,0.002956698,0.00434191,0.0059771165],"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.0009345954,0.00036720757,0.00033674552,0.0008013116,0.00010820822,0.000534329,0.00038219776,0.011275417,0.06933214,0.1470794,0.07209787,0.69675064],"study_design_scores_gemma":[0.00042988616,0.00080551405,0.00065045967,0.0002410114,0.00036195453,0.0022863634,0.0001888027,0.3227209,0.10145892,0.09205607,0.4784168,0.00038330173],"about_ca_topic_score_codex":0.0008768423,"about_ca_topic_score_gemma":0.0011553884,"teacher_disagreement_score":0.008590154,"about_ca_system_score_codex":0.0006778551,"about_ca_system_score_gemma":0.001083979,"threshold_uncertainty_score":0.028736949},"labels":[],"label_agreement":null},{"id":"W1484460783","doi":"10.1007/3-540-45547-7_11","title":"Modelling Trust for System Design Using the i * Strategic Actors Framework","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Trustworthiness; Stakeholder; Dependency (UML); Domain (mathematical analysis); Knowledge management; Quality (philosophy); A priori and a posteriori; Process management; Management science; Software engineering; Computer security; Business; Management","score_opus":0.1477246358586159,"score_gpt":0.3124766023657497,"score_spread":0.1647519665071338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484460783","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.012844892,0.00032948153,0.9735584,0.00070702174,0.00003244849,0.00006751523,0.000040394356,0.00011715992,0.012302664],"genre_scores_gemma":[0.750033,0.00062687584,0.24316049,0.00008403559,0.000047790432,0.0002517836,0.00010191481,0.00010922785,0.005584775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968316,0.0019671698,0.00021196791,0.00022821136,0.00043281843,0.0003282726],"domain_scores_gemma":[0.9942174,0.004024428,0.0005577731,0.0005389865,0.00041668126,0.00024465192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003767269,0.00087523414,0.0008646753,0.0010078455,0.0009913641,0.0036981322,0.0014674684,0.00198193,0.0040276013],"category_scores_gemma":[0.010426354,0.0009773839,0.0018179553,0.0011776255,0.0028667836,0.005183031,0.0024892467,0.0028527228,0.00063961436],"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.000028147135,0.000032032724,0.00050787884,0.0000881613,0.000050941777,0.00012307876,0.00048238158,0.17155991,0.00046742614,0.81666714,0.00044885295,0.009544035],"study_design_scores_gemma":[0.000023653225,0.000036448462,0.00013287284,0.000048897877,0.000049980892,0.0000480426,0.00018327877,0.47844854,0.0005402602,0.5154706,0.004996755,0.000020638028],"about_ca_topic_score_codex":0.008436351,"about_ca_topic_score_gemma":0.0071691833,"teacher_disagreement_score":0.008436351,"about_ca_system_score_codex":0.0031166493,"about_ca_system_score_gemma":0.0025061164,"threshold_uncertainty_score":0.022612989},"labels":[],"label_agreement":null},{"id":"W1484484836","doi":"10.1007/978-3-642-11928-6_3","title":"The Role of Concept, Context, and Component for Dependable Software Development","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Dependability; Computer science; Component (thermodynamics); Domain (mathematical analysis); Context (archaeology); Software system; Software engineering; Component-based software engineering; Process (computing); Function (biology); Software; Domain analysis; Reliability engineering; Systems engineering; Software construction; Operating system; Engineering","score_opus":0.020314777015448503,"score_gpt":0.2534460591692572,"score_spread":0.2331312821538087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484484836","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.029265186,0.027409295,0.84618205,0.0037818865,0.0010774856,0.00011149932,0.000053683587,0.0008472935,0.09127163],"genre_scores_gemma":[0.5982496,0.012596571,0.37541336,0.0006722051,0.0005568078,0.00024810637,0.00009438256,0.00033314896,0.011835845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815637,0.0008573473,0.00012454377,0.00025086346,0.00048058163,0.00013029129],"domain_scores_gemma":[0.9963282,0.0025475498,0.00019583541,0.00044450315,0.000292927,0.00019100102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024586397,0.000890805,0.00065972464,0.0015792382,0.0011607789,0.0039850133,0.0015027834,0.0012349719,0.0027996076],"category_scores_gemma":[0.005581833,0.0006104975,0.000740367,0.001746544,0.0055540083,0.0097142495,0.002773332,0.0032440494,0.000615537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041348147,0.000022858823,0.00043794425,0.00027706078,0.000015639556,0.00016992624,0.0015973973,0.0015429185,0.001330493,0.9086758,0.0014949664,0.08439367],"study_design_scores_gemma":[0.000022425766,0.0001355467,0.00047774406,0.00047178366,0.00009465816,0.0006593899,0.000722975,0.012760483,0.0022478073,0.89002544,0.0923274,0.000054332264],"about_ca_topic_score_codex":0.001159312,"about_ca_topic_score_gemma":0.0013100086,"teacher_disagreement_score":0.0039850133,"about_ca_system_score_codex":0.0011264172,"about_ca_system_score_gemma":0.0016082588,"threshold_uncertainty_score":0.013002694},"labels":[],"label_agreement":null},{"id":"W1484543036","doi":"10.1007/3-540-44466-1_35","title":"AIM: Approximate Intelligent Matching for Time Series Data","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Subsequence; Tree traversal; Graph traversal; Series (stratigraphy); Bottleneck; Matching (statistics); Data mining; Overhead (engineering); Sequence (biology); Curse of dimensionality; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.028415137914828248,"score_gpt":0.2503428419226876,"score_spread":0.22192770400785933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484543036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026046368,0.0002271683,0.99395,0.00009343297,0.00008359008,0.00003702809,0.00010454462,0.0020410616,0.00085858675],"genre_scores_gemma":[0.092746004,0.000408046,0.89898866,0.00023245603,0.00023048105,0.00023412779,0.0011426354,0.0006091089,0.0054085087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981001,0.0005018063,0.00015262375,0.00039237543,0.0007092125,0.00014378205],"domain_scores_gemma":[0.99822456,0.0007112023,0.00012229475,0.0005792564,0.00029940007,0.000063209176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032849074,0.001095427,0.0023163457,0.0021147693,0.0006605837,0.0020768594,0.0028411045,0.0020192657,0.008428187],"category_scores_gemma":[0.010888745,0.0008676164,0.0018406083,0.0032408119,0.0007578813,0.0042650374,0.0034767718,0.0018887259,0.004152472],"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.00058531313,0.00020347994,0.0017034257,0.0003226388,0.00021408321,0.00012881764,0.00013034456,0.09302042,0.0061781276,0.036731843,0.019597076,0.8411844],"study_design_scores_gemma":[0.000047983456,0.0001012056,0.00073849916,0.000025483552,0.000056905676,0.00018192771,0.000032715758,0.9338431,0.0054238173,0.050864134,0.008665127,0.000019161604],"about_ca_topic_score_codex":0.0011894747,"about_ca_topic_score_gemma":0.00092941907,"teacher_disagreement_score":0.008428187,"about_ca_system_score_codex":0.00058531115,"about_ca_system_score_gemma":0.0009542497,"threshold_uncertainty_score":0.028195083},"labels":[],"label_agreement":null},{"id":"W1484564260","doi":"10.1007/3-540-44886-1_31","title":"Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Local search (optimization); Computation; Neighbourhood (mathematics); Code (set theory); Set (abstract data type); Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.015515026281520683,"score_gpt":0.2714626513291585,"score_spread":0.2559476250476378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484564260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028439285,0.00052782317,0.9674416,0.00012860679,0.000114931005,0.00008091637,0.000042184736,0.00072669046,0.002497914],"genre_scores_gemma":[0.50678504,0.00026743335,0.48598182,0.00020463127,0.000095210766,0.0004982566,0.0001679651,0.00034240412,0.0056573004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985152,0.0006496845,0.00006530497,0.00019334706,0.00045280386,0.0001236527],"domain_scores_gemma":[0.9936745,0.004949502,0.0002568875,0.00041858037,0.00053200766,0.00016850725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002383906,0.0008332894,0.0017822532,0.0015298941,0.0006858063,0.0007198005,0.0021793025,0.0024375732,0.0043090214],"category_scores_gemma":[0.008272838,0.00085848785,0.0010473806,0.0013250584,0.0015803884,0.0014013528,0.002091536,0.001335979,0.00078779575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022100731,0.00007294827,0.0002502271,0.000077713106,0.000042430445,0.000030284918,0.000050133123,0.9243945,0.0026912456,0.016242528,0.0009849862,0.054942038],"study_design_scores_gemma":[0.000025546042,0.000044191074,0.000023714876,0.000004524458,0.0000045882102,0.000006784674,0.000003017125,0.9944976,0.00032489118,0.0048774295,0.00018279557,0.0000049782802],"about_ca_topic_score_codex":0.0028186888,"about_ca_topic_score_gemma":0.0032749837,"teacher_disagreement_score":0.0043090214,"about_ca_system_score_codex":0.0011605484,"about_ca_system_score_gemma":0.001072198,"threshold_uncertainty_score":0.014415145},"labels":[],"label_agreement":null},{"id":"W1484641899","doi":"10.1007/11766247_32","title":"Trace Equivalence Characterization Through Reinforcement Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Markov decision process; Reinforcement learning; Computer science; TRACE (psycholinguistics); Equivalence (formal languages); Divergence (linguistics); Probabilistic logic; Markov process; Markov chain; Context (archaeology); Artificial intelligence; Machine learning; Theoretical computer science; Mathematics; Discrete mathematics; Statistics","score_opus":0.029688212892966487,"score_gpt":0.2788552782419944,"score_spread":0.2491670653490279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484641899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012691795,0.00006231652,0.9826559,0.00016430981,0.0000385799,0.00005776575,0.000049995717,0.0009453573,0.0033339567],"genre_scores_gemma":[0.7310223,0.00016878148,0.2603151,0.0001767459,0.00011956478,0.00019657834,0.0004068984,0.0006824424,0.006911628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967873,0.00067842694,0.00021380822,0.0008078659,0.0011411138,0.00037153432],"domain_scores_gemma":[0.9877615,0.007996131,0.00064260146,0.0020075857,0.0012698289,0.00032242783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020126337,0.00087820133,0.0014303944,0.001577839,0.0007189716,0.0017783999,0.0023872512,0.0011815446,0.007590017],"category_scores_gemma":[0.017808376,0.0005707826,0.001262033,0.0012060399,0.0025452662,0.005510429,0.003506716,0.003610412,0.00072336046],"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.000459117,0.00032192998,0.0015816223,0.0002446867,0.000080036116,0.00017869203,0.00029512474,0.30122268,0.00838086,0.37630707,0.0042776517,0.30665046],"study_design_scores_gemma":[0.00002232582,0.000048515994,0.00014572681,0.0000189811,0.000014435542,0.00004315349,0.000025575157,0.7454635,0.0036119074,0.24947427,0.0011188687,0.000012829824],"about_ca_topic_score_codex":0.002065711,"about_ca_topic_score_gemma":0.0021694524,"teacher_disagreement_score":0.007590017,"about_ca_system_score_codex":0.0016550819,"about_ca_system_score_gemma":0.0015756884,"threshold_uncertainty_score":0.025391161},"labels":[],"label_agreement":null},{"id":"W1484683231","doi":"10.1007/978-3-540-27769-9_23","title":"Improving Generalization Level in UML Models Iterative Cross Generalization in Practice","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Generalization; Unified Modeling Language; Programming language; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Software","score_opus":0.03566211871474381,"score_gpt":0.3016579245141278,"score_spread":0.265995805799384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484683231","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.12526019,0.00028564568,0.86249447,0.00041571233,0.000032290034,0.00021048117,0.0000931013,0.006507221,0.004700846],"genre_scores_gemma":[0.5571678,0.00016747702,0.43775344,0.00022933523,0.000028705354,0.00019029086,0.00048722143,0.0013878872,0.0025877862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9765158,0.010341246,0.0018256123,0.0031888792,0.007234891,0.0008934988],"domain_scores_gemma":[0.91069376,0.043926734,0.0035915233,0.03140169,0.009679383,0.0007069694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016064165,0.0013596656,0.0014507482,0.0024865698,0.0010914021,0.0036751672,0.0029844332,0.0022017392,0.004063083],"category_scores_gemma":[0.07620418,0.0016690412,0.0021328998,0.0015647173,0.0015244328,0.01138602,0.00889555,0.0036894074,0.0013065179],"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.0006633575,0.0010604493,0.022347534,0.00068180956,0.00037981782,0.0004602928,0.0071842573,0.10892205,0.035280317,0.061327253,0.0044359276,0.7572568],"study_design_scores_gemma":[0.00006429963,0.0003854069,0.0032182068,0.00021415373,0.0003538899,0.00039049753,0.0007469693,0.87935144,0.046817325,0.058035832,0.010345398,0.00007659561],"about_ca_topic_score_codex":0.0032703078,"about_ca_topic_score_gemma":0.00463256,"teacher_disagreement_score":0.016064165,"about_ca_system_score_codex":0.001936975,"about_ca_system_score_gemma":0.0024660174,"threshold_uncertainty_score":0.08495647},"labels":[],"label_agreement":null},{"id":"W1484703625","doi":"10.1007/978-3-642-02868-7_15","title":"Interactive Calendar to Help Maintain Social Interactions for Elderly People and People with Mild Cognitive Impairments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Elderly people; Cognition; Psychology; Older people; Gerontology; Cognitive psychology; Medicine; Psychiatry","score_opus":0.01744248053746745,"score_gpt":0.279452680447254,"score_spread":0.2620101999097866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484703625","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.528457,0.040641088,0.20466453,0.0040883133,0.006358342,0.002309352,0.018615037,0.03319838,0.16166802],"genre_scores_gemma":[0.65146655,0.015896957,0.1947627,0.0019372768,0.0011767308,0.0014516524,0.009667659,0.0008692153,0.12277129],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999262,0.000015705944,0.000007964016,0.000012781536,0.000021422404,0.000015911777],"domain_scores_gemma":[0.9997445,0.00007640534,0.00002432274,0.000021900896,0.000035518508,0.00009741769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024914154,0.0006303537,0.00033655585,0.0004801512,0.0002458057,0.0005446144,0.0007438425,0.00035572387,0.019547205],"category_scores_gemma":[0.0010320497,0.00012573709,0.00030118207,0.00045926563,0.00007258029,0.0005238583,0.0006693741,0.00044661798,0.0056907427],"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.0014315812,0.0008354342,0.006189169,0.0010428412,0.00008131929,0.0007567354,0.00088001095,0.00036562633,0.01230862,0.00077483634,0.1109318,0.86440206],"study_design_scores_gemma":[0.0015478923,0.0031890878,0.16034323,0.0016257354,0.0010624637,0.008044042,0.003473316,0.009172716,0.019011931,0.0067454716,0.78553796,0.000246196],"about_ca_topic_score_codex":0.0009243657,"about_ca_topic_score_gemma":0.0028555484,"teacher_disagreement_score":0.019547205,"about_ca_system_score_codex":0.00009791902,"about_ca_system_score_gemma":0.00026826482,"threshold_uncertainty_score":0.0653919},"labels":[],"label_agreement":null},{"id":"W1484713053","doi":"10.1007/978-3-540-92248-3_33","title":"Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Spanner; Unit disk graph; Vertex (graph theory); Bipartite graph; Computer science; Combinatorics; Locality; Graph; Mathematics; Database","score_opus":0.01680644095101965,"score_gpt":0.23324718124199018,"score_spread":0.21644074029097052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484713053","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.26833278,0.0004351413,0.69866693,0.00026989373,0.00009975381,0.00016359067,0.0003945023,0.0009561002,0.030681271],"genre_scores_gemma":[0.65458214,0.00048646796,0.32558867,0.00011918715,0.00006847646,0.00021886069,0.00090368936,0.00045077343,0.017581733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995646,0.00011845931,0.000020638472,0.00011526396,0.00009573442,0.000085330845],"domain_scores_gemma":[0.99882966,0.0003457984,0.000111312664,0.00039196335,0.00013830604,0.00018287904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031190432,0.00050314685,0.000703738,0.0007051999,0.00092737086,0.0011933328,0.0017462325,0.00052085676,0.0058160597],"category_scores_gemma":[0.0014775848,0.0006158735,0.00049985654,0.0012770869,0.0007885698,0.0016443541,0.0022184174,0.0012916304,0.0010007098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042358585,0.00029083368,0.0020226806,0.00053701526,0.00006281507,0.00041191868,0.0010530526,0.1286339,0.04451008,0.6600037,0.011539365,0.1505111],"study_design_scores_gemma":[0.000077641766,0.00020262982,0.001552862,0.0000921603,0.000070304486,0.00049301895,0.00066258886,0.3942737,0.024097461,0.56179917,0.016631374,0.000047047495],"about_ca_topic_score_codex":0.0008896921,"about_ca_topic_score_gemma":0.0019535488,"teacher_disagreement_score":0.0058160597,"about_ca_system_score_codex":0.0007057633,"about_ca_system_score_gemma":0.0005019,"threshold_uncertainty_score":0.019456685},"labels":[],"label_agreement":null},{"id":"W1484790104","doi":"10.1007/978-3-540-75703-0_2","title":"Boosted Multiple Deformable Trees for Parsing Human Poses","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Discriminative model; Tree (set theory); Computer science; Artificial intelligence; Machine learning; Inference; Boosting (machine learning); Structured prediction; Tree structure; Tree traversal; Pattern recognition (psychology); Data mining; Binary tree; Algorithm; Mathematics","score_opus":0.04732595627724044,"score_gpt":0.2871541435455675,"score_spread":0.23982818726832705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484790104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008475485,0.0012114098,0.97774863,0.00013676594,0.0001511253,0.00009453086,0.0010839918,0.009702807,0.0013952886],"genre_scores_gemma":[0.13936634,0.0015629756,0.8417847,0.00031800324,0.00017138013,0.00024237673,0.0062093963,0.0020421012,0.008302686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.00012260582,0.00004780333,0.00037632982,0.00028128095,0.00009794341],"domain_scores_gemma":[0.9991529,0.00032530696,0.00005789809,0.000273361,0.00014227732,0.000048199337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099525,0.002203912,0.0026873795,0.0018706733,0.0005540763,0.0010165506,0.0029369716,0.00236181,0.008283489],"category_scores_gemma":[0.002160915,0.001782943,0.0020771064,0.0026208262,0.00058493635,0.0018642517,0.0018101016,0.002973008,0.006100175],"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.00026113086,0.00012993014,0.00036719657,0.0001843187,0.00014263422,0.00014697202,0.000065885586,0.13333954,0.023563419,0.003685355,0.016343884,0.82176954],"study_design_scores_gemma":[0.000019673675,0.00005292167,0.0005582353,0.000032073494,0.000042230393,0.0001561526,0.000020989784,0.9723962,0.008503601,0.014358425,0.00383282,0.000026689248],"about_ca_topic_score_codex":0.01009831,"about_ca_topic_score_gemma":0.017056696,"teacher_disagreement_score":0.01009831,"about_ca_system_score_codex":0.0007771271,"about_ca_system_score_gemma":0.0009144904,"threshold_uncertainty_score":0.027711034},"labels":[],"label_agreement":null},{"id":"W1484791463","doi":"10.1007/3-540-45415-2_4","title":"Building Trust for E-Commerce: Collaborating Label Bureaus","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Dalhousie University","funders":"","keywords":"Computer science; Merge (version control); Architecture; Trusted third party; Third party; Dimension (graph theory); Computer security; Information retrieval; Internet privacy","score_opus":0.03158993435485406,"score_gpt":0.32806087274158513,"score_spread":0.29647093838673105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484791463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12096056,0.003675535,0.41714865,0.04400029,0.00074089476,0.00029333096,0.0001685698,0.001735872,0.4112763],"genre_scores_gemma":[0.87732893,0.0010739077,0.07617558,0.00094218337,0.0002279847,0.00012498024,0.0001623549,0.0003037072,0.043660264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99288505,0.0039110477,0.00031867722,0.0006250752,0.0015286065,0.00073156826],"domain_scores_gemma":[0.9809167,0.009740463,0.0020876313,0.002914727,0.0022395414,0.0021009864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009993943,0.00042468458,0.00048215405,0.0012542312,0.0033736276,0.010169116,0.0018963297,0.0036631047,0.011770597],"category_scores_gemma":[0.024112413,0.00089070527,0.0006078036,0.0019346597,0.003458087,0.017878639,0.005686794,0.0038262173,0.0034517797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019854131,0.0005309384,0.013569904,0.00017422168,0.000084737585,0.0005904327,0.02113073,0.005065757,0.002273736,0.49544135,0.048068956,0.41287065],"study_design_scores_gemma":[0.000114185124,0.00022516529,0.0064717713,0.0003705265,0.00015242735,0.0007340541,0.013145909,0.045354437,0.004058731,0.5876851,0.34153694,0.00015071633],"about_ca_topic_score_codex":0.007570557,"about_ca_topic_score_gemma":0.007459154,"teacher_disagreement_score":0.011770597,"about_ca_system_score_codex":0.0024318993,"about_ca_system_score_gemma":0.004695158,"threshold_uncertainty_score":0.052853644},"labels":[],"label_agreement":null},{"id":"W1484834310","doi":"10.1007/978-3-540-68083-3_24","title":"Protein Sequence Motif Discovery on Distributed Supercomputer","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Manitoba","funders":"","keywords":"Computer science; De Bruijn graph; De Bruijn sequence; Motif (music); Probabilistic logic; Supercomputer; Parallel computing; Massively parallel; Multi-core processor; Theoretical computer science; Graph; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.023561479120725953,"score_gpt":0.2429333179217539,"score_spread":0.21937183880102795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484834310","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.68471754,0.0024446608,0.29392603,0.00063285016,0.00016176848,0.00014117289,0.0016297902,0.0070340796,0.009312032],"genre_scores_gemma":[0.6060336,0.0009882607,0.3786158,0.00011480912,0.00010848989,0.00013584705,0.004342198,0.00043230358,0.009228662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966276,0.0000514915,0.000019346326,0.0000984813,0.00013084857,0.000037091013],"domain_scores_gemma":[0.99937856,0.00020701815,0.000044333698,0.00015769956,0.00014956247,0.0000628955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046995006,0.00039269956,0.0007502028,0.001034937,0.0005497765,0.0006999476,0.0011389289,0.00052366685,0.00226851],"category_scores_gemma":[0.0013457207,0.0003327765,0.000402675,0.0028184808,0.00022510813,0.00091658096,0.00058756286,0.0006241133,0.0008947405],"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.0013136914,0.0004156994,0.016126582,0.00038882188,0.00021077796,0.0006999228,0.00027957023,0.058164008,0.1913574,0.0071813376,0.01850319,0.705359],"study_design_scores_gemma":[0.00012873352,0.00024299603,0.006959474,0.000023364677,0.00007857076,0.0007374208,0.0002502996,0.8535189,0.10377817,0.021400932,0.012853325,0.000027834973],"about_ca_topic_score_codex":0.0011354862,"about_ca_topic_score_gemma":0.0028532315,"teacher_disagreement_score":0.00226851,"about_ca_system_score_codex":0.0003399103,"about_ca_system_score_gemma":0.00048246142,"threshold_uncertainty_score":0.0075889826},"labels":[],"label_agreement":null},{"id":"W1484847858","doi":"10.1007/978-3-540-85990-1_23","title":"Toward a Flexible and Portable CT Scanner","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scanner; Computer science; Detector; Tomographic reconstruction; Software; Computer hardware; Computer graphics (images); Computer vision; Artificial intelligence; Iterative reconstruction; Telecommunications; Operating system","score_opus":0.035221253118083544,"score_gpt":0.30791028706591833,"score_spread":0.2726890339478348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484847858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064544776,0.00076711597,0.9857093,0.0012705014,0.00016105699,0.00011165991,0.000115692994,0.0014529036,0.003957219],"genre_scores_gemma":[0.031801797,0.0009312422,0.96016055,0.0005575219,0.00014794359,0.00009783511,0.00026099465,0.0003726324,0.0056694592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990872,0.0001119093,0.00005878642,0.00015871636,0.0005117689,0.000071546776],"domain_scores_gemma":[0.99670035,0.0009269642,0.00017079563,0.0006294042,0.001178845,0.00039367267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022369546,0.0009923418,0.0007057072,0.0011595312,0.0006274676,0.0019453706,0.004582167,0.0026281732,0.012058526],"category_scores_gemma":[0.0046326546,0.0015945527,0.00077359274,0.0009506376,0.001298295,0.004329857,0.0039313813,0.003210126,0.0052346485],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005670822,0.00024538077,0.0052559366,0.0007017415,0.00012940538,0.0021829123,0.00040054193,0.010575156,0.4348288,0.042196445,0.022470443,0.48044625],"study_design_scores_gemma":[0.00028712192,0.001687049,0.01086592,0.0007115159,0.00050513924,0.026315274,0.00061154616,0.19468075,0.35929993,0.051808175,0.35268864,0.00053890893],"about_ca_topic_score_codex":0.0014273265,"about_ca_topic_score_gemma":0.0018323027,"teacher_disagreement_score":0.012058526,"about_ca_system_score_codex":0.00048988045,"about_ca_system_score_gemma":0.0015266701,"threshold_uncertainty_score":0.040339768},"labels":[],"label_agreement":null},{"id":"W1484913574","doi":"10.1007/11422778_46","title":"A Multizone Pipelined Cache for IP Routing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","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":"Computer science; Cache; Cache algorithms; Smart Cache; Parallel computing; Computer network; Cache invalidation; Pipeline (software); IP forwarding; Routing table; CPU cache; Routing (electronic design automation); Operating system; Routing protocol","score_opus":0.019440455725693154,"score_gpt":0.2555890350503842,"score_spread":0.23614857932469108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484913574","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.082865834,0.0069924043,0.87927437,0.00045902265,0.00073874905,0.00021716034,0.0007028373,0.013247163,0.015502473],"genre_scores_gemma":[0.5112069,0.0014985215,0.46793056,0.0002844102,0.00017067647,0.00021435962,0.0009620519,0.00047995278,0.01725246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997402,0.000035637717,0.00002290953,0.00004049636,0.00012160668,0.00003923627],"domain_scores_gemma":[0.99925333,0.00012821489,0.000042974512,0.0003160429,0.00021441569,0.000044943066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043609322,0.00046178853,0.0006029607,0.00094195525,0.0007320327,0.0012170167,0.0028312558,0.0006832416,0.006896842],"category_scores_gemma":[0.0011402251,0.00041575744,0.00037273965,0.0015341019,0.00035637405,0.0018299312,0.0008399008,0.001090993,0.0009673969],"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.00249098,0.00045911246,0.0021932356,0.00082912314,0.00016826781,0.00032401143,0.00023223239,0.08815193,0.12475517,0.081437826,0.042538125,0.65641993],"study_design_scores_gemma":[0.0004082915,0.0010362489,0.00083037507,0.0001389929,0.00028284197,0.000595653,0.00009989509,0.8092917,0.08965736,0.032144804,0.065410495,0.00010336515],"about_ca_topic_score_codex":0.0020208594,"about_ca_topic_score_gemma":0.0050648116,"teacher_disagreement_score":0.006896842,"about_ca_system_score_codex":0.0009828241,"about_ca_system_score_gemma":0.001127979,"threshold_uncertainty_score":0.023072302},"labels":[],"label_agreement":null},{"id":"W1484932675","doi":"10.1007/978-3-642-02777-2_26","title":"A Theoretical Analysis of Search in GSAT","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Heuristic; Algorithm; Distribution (mathematics); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.018391801256455245,"score_gpt":0.27934312240710363,"score_spread":0.2609513211506484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484932675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03218964,0.005789133,0.7551519,0.007711632,0.00049844483,0.00012304452,0.0005707926,0.0007040947,0.1972612],"genre_scores_gemma":[0.7560895,0.00674323,0.15681046,0.0026371921,0.0013996467,0.00046021375,0.00079650816,0.0009218343,0.07414138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852824,0.0005360778,0.00005310258,0.00019403915,0.00041828008,0.0002702121],"domain_scores_gemma":[0.9942913,0.004351137,0.0002699574,0.0005059902,0.00035939354,0.00022218082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018458333,0.0010960877,0.0017255577,0.0023917968,0.0022744169,0.0040506427,0.0036331306,0.0031043638,0.022855183],"category_scores_gemma":[0.01178997,0.0008989427,0.0025455954,0.004826196,0.006733209,0.008615719,0.0032108189,0.0057360907,0.002271545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001023333,0.000007973603,0.00006616041,0.00004089832,0.000005921693,0.000012259086,0.00004716166,0.009685264,0.00006477528,0.98458856,0.0019424728,0.0035282995],"study_design_scores_gemma":[0.0000073940287,0.000008131438,0.00005469547,0.000022025262,0.000008345485,0.000024674582,0.000025172429,0.050601736,0.00006983205,0.9466353,0.0025363185,0.000006258991],"about_ca_topic_score_codex":0.0052320445,"about_ca_topic_score_gemma":0.0038237388,"teacher_disagreement_score":0.022855183,"about_ca_system_score_codex":0.004307397,"about_ca_system_score_gemma":0.0021368251,"threshold_uncertainty_score":0.076458216},"labels":[],"label_agreement":null},{"id":"W1484935596","doi":"10.1007/978-3-540-27868-9_60","title":"Matching Concavity Trees","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Tree (set theory); Representation (politics); Context (archaeology); Pattern matching; Tree structure; Node (physics); Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Binary tree","score_opus":0.018512730902286653,"score_gpt":0.25804267052478874,"score_spread":0.23952993962250207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484935596","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.08516106,0.0006345421,0.87075996,0.00043459007,0.00019371154,0.00017689791,0.00085804384,0.002658739,0.039122444],"genre_scores_gemma":[0.4842465,0.0005399967,0.47628525,0.00033010155,0.00018589245,0.00015149197,0.003541657,0.0016839105,0.03303514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988206,0.00017100885,0.00006072312,0.00032390063,0.00046739832,0.00015634636],"domain_scores_gemma":[0.9979518,0.0005046376,0.00014907018,0.00083022297,0.00045749007,0.00010676297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392536,0.0004835646,0.00096648437,0.0022957025,0.001143723,0.0018222296,0.0016153097,0.001385214,0.011258438],"category_scores_gemma":[0.00503869,0.00080437213,0.00076770375,0.002283518,0.0010249272,0.0028871999,0.0029104578,0.0017119478,0.004322588],"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.00049076567,0.00017008107,0.003097959,0.00021779773,0.00008036459,0.0003667674,0.00035803588,0.031684685,0.021452805,0.26260346,0.027946353,0.651531],"study_design_scores_gemma":[0.000043468885,0.00014385373,0.00218406,0.00008253304,0.000074694624,0.0010329888,0.00021929457,0.43097645,0.025055766,0.48562846,0.05450732,0.000051165945],"about_ca_topic_score_codex":0.0014743207,"about_ca_topic_score_gemma":0.0023042217,"teacher_disagreement_score":0.011258438,"about_ca_system_score_codex":0.0006749809,"about_ca_system_score_gemma":0.00068937964,"threshold_uncertainty_score":0.03766328},"labels":[],"label_agreement":null},{"id":"W1485070158","doi":"10.1007/978-3-642-16493-4_10","title":"Diversity Analysis of Opposition-Based Differential Evolution—An Experimental Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"Ontario Tech University","funders":"","keywords":"Ode; Differential evolution; Opposition (politics); Computer science; Diversification (marketing strategy); Convergence (economics); Mathematical optimization; Diversity (politics); Applied mathematics; Mathematics; Algorithm; Sociology; Political science","score_opus":0.02656602512742368,"score_gpt":0.2934900456550681,"score_spread":0.2669240205276444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485070158","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.93468136,0.00048092235,0.055030618,0.00007691777,0.000048581715,0.00008249115,0.00014494639,0.00013256578,0.009321581],"genre_scores_gemma":[0.9798997,0.00010190227,0.018608013,0.000011661029,0.000008014889,0.000029898814,0.0001379023,0.000033113596,0.0011696883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929225,0.00026822413,0.00003077841,0.000070207934,0.0002764731,0.00006210417],"domain_scores_gemma":[0.99533683,0.0033804302,0.00020469584,0.00035482174,0.0006272363,0.00009602881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141412,0.00034811688,0.0006137201,0.0010379886,0.0004622677,0.00063072477,0.0006887833,0.0005187822,0.0015251508],"category_scores_gemma":[0.004280086,0.000120823475,0.00035561607,0.0011166423,0.00047123455,0.0006208837,0.00050847384,0.0004490675,0.00015942019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036626635,0.0026903446,0.009276314,0.00077882566,0.00023756069,0.00034598183,0.00058125885,0.49155003,0.197286,0.015590308,0.0019689824,0.2760318],"study_design_scores_gemma":[0.000101051686,0.0018194761,0.004360924,0.000020674483,0.00005756011,0.00023834466,0.00014494367,0.9513022,0.038216013,0.0027742386,0.0009343718,0.000030195419],"about_ca_topic_score_codex":0.00071238016,"about_ca_topic_score_gemma":0.0004608141,"teacher_disagreement_score":0.0015251508,"about_ca_system_score_codex":0.00038812347,"about_ca_system_score_gemma":0.0002018704,"threshold_uncertainty_score":0.006949961},"labels":[],"label_agreement":null},{"id":"W1485139153","doi":"10.1007/978-3-540-87987-9_28","title":"Active Learning of Group-Structured Environments","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Group (periodic table); Point (geometry); Representation (politics); Artificial intelligence; Abelian group; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.008662601399326899,"score_gpt":0.22151907109138627,"score_spread":0.21285646969205937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485139153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018267764,0.00039642095,0.9768282,0.00017852013,0.000042706375,0.000027618153,0.000046418645,0.00023407022,0.0039781746],"genre_scores_gemma":[0.70889837,0.000982523,0.2694029,0.00016968325,0.0002702709,0.00031159443,0.00053328346,0.00022481478,0.019206552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991691,0.00039949073,0.000025837731,0.0001575386,0.00016202142,0.00008599281],"domain_scores_gemma":[0.9930621,0.0054260828,0.00028313044,0.0006204329,0.00029945804,0.00030872645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015891524,0.00062328944,0.0009998131,0.0007784242,0.00062836526,0.0016237019,0.0025902584,0.0013994464,0.0042944304],"category_scores_gemma":[0.008335708,0.0006062661,0.0006356921,0.0009091114,0.0018203208,0.004365523,0.0029284733,0.0023065512,0.00066002965],"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.00023908872,0.00014868636,0.0009493579,0.00020315604,0.00008705,0.00007924458,0.00046186364,0.4262685,0.0018680582,0.43396336,0.0049985773,0.13073304],"study_design_scores_gemma":[0.000021521368,0.000034814064,0.00009059443,0.000013341707,0.0000077221475,0.00001866591,0.000030914434,0.6965654,0.0004721062,0.30135778,0.001380144,0.000007021848],"about_ca_topic_score_codex":0.0008575954,"about_ca_topic_score_gemma":0.001272001,"teacher_disagreement_score":0.0042944304,"about_ca_system_score_codex":0.00052088604,"about_ca_system_score_gemma":0.0004353122,"threshold_uncertainty_score":0.014366269},"labels":[],"label_agreement":null},{"id":"W1485144092","doi":"10.1007/978-3-642-13059-5_39","title":"A Semantic Model for Social Recommender Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Recommender system; Computer science; Information overload; Semantics (computer science); Information retrieval; World Wide Web","score_opus":0.04398901412991223,"score_gpt":0.2810613700753398,"score_spread":0.23707235594542758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485144092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034198395,0.0006569555,0.9888032,0.0008221669,0.000118281714,0.00009346588,0.00062480295,0.00051901554,0.0049422192],"genre_scores_gemma":[0.20687613,0.0017173315,0.7728236,0.0005442013,0.00034619556,0.0005901905,0.002789303,0.0002953454,0.014017766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973151,0.0011503424,0.00027175812,0.0004199161,0.00070948986,0.00013327716],"domain_scores_gemma":[0.9975937,0.0012196798,0.00011371523,0.000510472,0.0004616135,0.00010073852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024902816,0.0008922431,0.0013203191,0.0018731332,0.0011863494,0.0031730959,0.0023891632,0.0022237243,0.006319261],"category_scores_gemma":[0.007458539,0.00079636177,0.0022877958,0.0031349803,0.0013689935,0.008882976,0.0021250916,0.0025676908,0.002486454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007265968,0.00011678961,0.00044193765,0.0002450934,0.00008883715,0.00010824681,0.0003160658,0.03633542,0.0007998876,0.8752471,0.008711877,0.0775162],"study_design_scores_gemma":[0.000025819132,0.000031371535,0.00015392047,0.000054635337,0.00005763481,0.00012754239,0.000075277,0.32821092,0.0004526296,0.6503013,0.020480208,0.000028712957],"about_ca_topic_score_codex":0.0054390198,"about_ca_topic_score_gemma":0.0071761687,"teacher_disagreement_score":0.006319261,"about_ca_system_score_codex":0.0015241113,"about_ca_system_score_gemma":0.0013686938,"threshold_uncertainty_score":0.021140039},"labels":[],"label_agreement":null},{"id":"W1485178713","doi":"10.1007/bfb0018374","title":"Mental models of recursion and their use in the SCENT programming advisor","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Recursion (computer science); Mental representation; Mental model; Computer science; Representation (politics); Cognitive science; Cognitive model; Cognition; Psychology; Programming language","score_opus":0.04427398253911642,"score_gpt":0.3040633230196839,"score_spread":0.2597893404805675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485178713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09872488,0.0003326229,0.75477266,0.0032537957,0.000096823525,0.0000815171,0.00021859008,0.00083071156,0.1416885],"genre_scores_gemma":[0.82699114,0.0001688428,0.16215797,0.0001853076,0.000027523822,0.00014108568,0.00017040464,0.00017376109,0.009983943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818075,0.001286586,0.000063950596,0.0001893253,0.00018691341,0.000092487564],"domain_scores_gemma":[0.99181753,0.0065810885,0.00029290133,0.00067144004,0.00038672675,0.00025030252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019671314,0.00045346745,0.00023692944,0.00056407973,0.0009695432,0.005041935,0.0011889169,0.001452517,0.011011261],"category_scores_gemma":[0.01625428,0.0005412643,0.00092787103,0.00052070187,0.0031441837,0.009414146,0.001701235,0.002412897,0.0010038189],"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.000046668993,0.000035701574,0.0009612464,0.000029753293,0.000010110237,0.000053531887,0.0035878906,0.0030965323,0.00042206555,0.9697239,0.0013491743,0.020683445],"study_design_scores_gemma":[0.000023279224,0.000031480726,0.00054149394,0.000050942603,0.000021345171,0.00015624172,0.0010434613,0.06999012,0.00078542664,0.91686565,0.01046137,0.00002924269],"about_ca_topic_score_codex":0.0029148671,"about_ca_topic_score_gemma":0.0030314573,"teacher_disagreement_score":0.011011261,"about_ca_system_score_codex":0.0012332546,"about_ca_system_score_gemma":0.0009721191,"threshold_uncertainty_score":0.036836386},"labels":[],"label_agreement":null},{"id":"W1485214605","doi":"10.1007/11428862_84","title":"Computing Valuation Popov Forms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Brandon University; University of Waterloo","funders":"","keywords":"Valuation (finance); Noncommutative geometry; Mathematics; Pure mathematics; Mathematical economics; Algebra over a field; Economics; Finance","score_opus":0.020939754484880613,"score_gpt":0.2613913306737741,"score_spread":0.2404515761888935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485214605","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2589361,0.0027257928,0.27476606,0.0026683542,0.0007605469,0.000107672386,0.00089871086,0.0007252782,0.45841143],"genre_scores_gemma":[0.88916147,0.0018315533,0.029501505,0.00028320996,0.0005618424,0.000084113795,0.00089044654,0.00031839783,0.07736743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945813,0.00011941679,0.000025848758,0.00009606937,0.00020040743,0.000100138896],"domain_scores_gemma":[0.9993687,0.0002380826,0.0000556016,0.00013461626,0.00011372305,0.000089228124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071973633,0.0008634305,0.0010088244,0.002504347,0.0014400731,0.004706353,0.0008181624,0.000485562,0.016444458],"category_scores_gemma":[0.0027184323,0.0005153735,0.0006803303,0.0027681591,0.0024941487,0.006876893,0.002742406,0.002608837,0.003027023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015461263,0.0000071652044,0.00014178753,0.00002209715,0.000004688022,0.00001885795,0.0001074814,0.00038598716,0.00020241289,0.9856468,0.0015976204,0.011849685],"study_design_scores_gemma":[0.000003784857,0.00000614282,0.00007557006,0.000012442967,0.0000047549547,0.000038644954,0.00004737987,0.0010456298,0.00026324746,0.99097013,0.007527465,0.00000477709],"about_ca_topic_score_codex":0.00034303762,"about_ca_topic_score_gemma":0.00035063643,"teacher_disagreement_score":0.016444458,"about_ca_system_score_codex":0.001206715,"about_ca_system_score_gemma":0.00048463888,"threshold_uncertainty_score":0.055012167},"labels":[],"label_agreement":null},{"id":"W1485268250","doi":"10.1007/978-3-540-75444-2_9","title":"Coarse-Grain Time Slicing with Resource-Share Control in Parallel-Job Scheduling","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Slicing; Computer science; Job scheduler; Scheduling (production processes); Distributed computing; Execution time; Parallel computing; Mathematical optimization; Operating system; World Wide Web; Mathematics","score_opus":0.01708483623628953,"score_gpt":0.23874155702423572,"score_spread":0.22165672078794618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485268250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021148061,0.0011726278,0.9735469,0.00009703507,0.00014757314,0.000046701127,0.000031703945,0.0013869647,0.0024224343],"genre_scores_gemma":[0.55741054,0.0006501378,0.43820104,0.00009964444,0.00013294222,0.00010030374,0.00009949717,0.00043151274,0.0028743013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948186,0.000115275754,0.000036732425,0.000082620056,0.00019793608,0.00008571306],"domain_scores_gemma":[0.99911183,0.0003601573,0.00006262539,0.00027868396,0.00012082382,0.00006591304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011698316,0.00063347246,0.001062616,0.00043562104,0.00063578604,0.00084354175,0.0013419617,0.00033393237,0.0020680125],"category_scores_gemma":[0.0017928844,0.0005152087,0.0004125792,0.0010384198,0.0011014993,0.0011324141,0.0008247831,0.001329534,0.0002810886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066082407,0.0001526886,0.0005614816,0.0001985219,0.000056649256,0.00008579755,0.00022194079,0.68360996,0.034305535,0.068632536,0.0032239056,0.20829016],"study_design_scores_gemma":[0.000023736533,0.00003753898,0.00012299957,0.000006937586,0.000015234107,0.0000131390225,0.000011623756,0.97088516,0.0067478116,0.020472357,0.0016494659,0.000014024456],"about_ca_topic_score_codex":0.006836256,"about_ca_topic_score_gemma":0.0073126606,"teacher_disagreement_score":0.006836256,"about_ca_system_score_codex":0.0010715796,"about_ca_system_score_gemma":0.0013746533,"threshold_uncertainty_score":0.013592958},"labels":[],"label_agreement":null},{"id":"W1485273397","doi":"10.1007/978-3-642-03658-3_7","title":"PressureMove: Pressure Input with Mouse Movement","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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 Manitoba","funders":"","keywords":"Computer science; Orientation (vector space); Rotation (mathematics); Zoom; Object (grammar); Movement (music); Translation (biology); Computer vision; Artificial intelligence; Task (project management); Mathematics; Acoustics; Geometry","score_opus":0.009923730101719626,"score_gpt":0.23150689976864317,"score_spread":0.22158316966692354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485273397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003951047,0.0011421879,0.8195459,0.0002202863,0.0007484949,0.00021884836,0.0023977617,0.13233641,0.03943903],"genre_scores_gemma":[0.10783563,0.0027575435,0.5190255,0.001382579,0.0006456847,0.0012259033,0.011329975,0.041423265,0.31437394],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995072,0.000042351017,0.000024830724,0.000091956565,0.0002843575,0.00004927317],"domain_scores_gemma":[0.9997179,0.00010190193,0.000013032182,0.00006062744,0.000072674775,0.00003385152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734605,0.0019857613,0.00074785546,0.0005636697,0.00039236294,0.0011886497,0.0024156442,0.0013549036,0.09547133],"category_scores_gemma":[0.0013002892,0.0006944468,0.00061236636,0.00060659234,0.0004034908,0.0016333938,0.0020915829,0.0010158448,0.037133683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007768989,0.000113226975,0.0002832654,0.00087362,0.000052914686,0.00043372434,0.00030489033,0.0013632438,0.09405836,0.011110498,0.23613423,0.65449506],"study_design_scores_gemma":[0.00033599066,0.0004091799,0.0018797518,0.00034880053,0.00015053095,0.0021869864,0.00009142196,0.04244525,0.20846209,0.010040695,0.7334769,0.00017237107],"about_ca_topic_score_codex":0.0007231837,"about_ca_topic_score_gemma":0.0010326672,"teacher_disagreement_score":0.09547133,"about_ca_system_score_codex":0.00018891036,"about_ca_system_score_gemma":0.00026368545,"threshold_uncertainty_score":0.31938338},"labels":[],"label_agreement":null},{"id":"W1485356454","doi":"10.1007/978-3-540-30479-1_83","title":"Improved Cell-DEVS Model Definition in CD++","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Formalism (music); Cover (algebra); Theoretical computer science; Programming language; Modeling and simulation; Distributed computing; Simulation","score_opus":0.019426267320199555,"score_gpt":0.2270055634178707,"score_spread":0.20757929609767115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485356454","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.0057518873,0.00017596847,0.9748452,0.00031100132,0.00017097808,0.0000678142,0.0007192747,0.0008439223,0.017114015],"genre_scores_gemma":[0.271337,0.0005785239,0.6739038,0.0006049121,0.00015284847,0.0006659118,0.0024597042,0.0015754986,0.048721787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943084,0.0001359337,0.000036600122,0.00009730646,0.00022940268,0.00007003216],"domain_scores_gemma":[0.9994319,0.00015082538,0.000021407077,0.000149797,0.00020617331,0.00003993872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060409814,0.0006156332,0.0009387629,0.0005610487,0.0006053059,0.001596802,0.0022792045,0.0009309168,0.01081652],"category_scores_gemma":[0.0017046958,0.00034834814,0.00091493054,0.0008234352,0.0005913588,0.0018324353,0.0014059285,0.0019862074,0.0032837335],"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.00007954278,0.000045976856,0.00030630387,0.000112130394,0.000015771106,0.00014627671,0.00012337815,0.11909255,0.005105106,0.81805974,0.010673524,0.04623976],"study_design_scores_gemma":[0.000027418813,0.000021196935,0.000075167576,0.000017486362,0.000018612645,0.00011285647,0.000031806983,0.6631448,0.0048726806,0.28428763,0.047371294,0.000019146382],"about_ca_topic_score_codex":0.0048432257,"about_ca_topic_score_gemma":0.0052335365,"teacher_disagreement_score":0.01081652,"about_ca_system_score_codex":0.001060705,"about_ca_system_score_gemma":0.001216779,"threshold_uncertainty_score":0.036184847},"labels":[],"label_agreement":null},{"id":"W1485398918","doi":"10.1007/978-3-540-76928-6_9","title":"Local Learning Algorithm for Markov Blanket Discovery","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Markov blanket; Markov chain; Computer science; Bayesian network; Boundary (topology); Algorithm; Machine learning; Markov model; Scalability; Bayesian probability; Artificial intelligence; Data mining; Mathematics; Variable-order Markov model","score_opus":0.023875250979716798,"score_gpt":0.26728953486891255,"score_spread":0.24341428388919575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485398918","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.0010894368,0.0001225983,0.99760735,0.00009304025,0.000018101366,0.00003409003,0.000061003386,0.00049288396,0.00048147462],"genre_scores_gemma":[0.06918428,0.00024713756,0.9226724,0.00022400662,0.00011832734,0.00063712633,0.00085746625,0.00047847658,0.0055808155],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678206,0.0015119674,0.0001609804,0.00065159705,0.00067769655,0.00021569165],"domain_scores_gemma":[0.98042554,0.01508617,0.00050838897,0.0020354202,0.0015319096,0.00041258518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006380792,0.0010541175,0.003767049,0.0025251086,0.0016428174,0.0023882291,0.0077211526,0.002928898,0.013150973],"category_scores_gemma":[0.02517766,0.0014379183,0.0018302891,0.0034579558,0.0022934286,0.0055282945,0.0050412724,0.004954505,0.0035298013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007828199,0.00031845568,0.0011125238,0.00044636265,0.00023153424,0.00014227822,0.000244416,0.313514,0.001761198,0.24591748,0.01552881,0.42000017],"study_design_scores_gemma":[0.000060184895,0.00003154617,0.00006705913,0.000017080234,0.000023673021,0.00002991246,0.000012325895,0.89985377,0.00056795205,0.09800122,0.0013203247,0.000014917706],"about_ca_topic_score_codex":0.0050648376,"about_ca_topic_score_gemma":0.005141618,"teacher_disagreement_score":0.013150973,"about_ca_system_score_codex":0.0020319016,"about_ca_system_score_gemma":0.003638921,"threshold_uncertainty_score":0.043994367},"labels":[],"label_agreement":null},{"id":"W1485470282","doi":"10.1007/3-540-45706-2_74","title":"CODACS Project: A Demand-Data Driven Reconfigurable Architecture","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; National Research Council Canada; Regione Campania","keywords":"Dataflow; Dataflow architecture; Computer science; Computer architecture; Field-programmable gate array; Scalability; Parallel computing; Graph; Data flow diagram; Asynchronous communication; Computation; Data-flow analysis; Architecture; Embedded system; Operating system; Programming language; Theoretical computer science; Database","score_opus":0.04655560963749491,"score_gpt":0.27458807653917555,"score_spread":0.22803246690168064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485470282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15672286,0.0034146905,0.635074,0.0009964029,0.0013395626,0.00075240707,0.0025873529,0.07922247,0.11989031],"genre_scores_gemma":[0.4654859,0.0012313145,0.38899904,0.0010589651,0.00020318927,0.00051070965,0.0072470377,0.004049313,0.13121463],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997631,0.000022577184,0.000009756105,0.000056092846,0.00010266506,0.000045913035],"domain_scores_gemma":[0.99975914,0.000028357637,0.000014620611,0.00007077375,0.00007823779,0.000048834147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036801453,0.00068387116,0.00042259748,0.0005221091,0.00027694704,0.00093493715,0.0019971356,0.000545876,0.013377592],"category_scores_gemma":[0.00039491637,0.0003697937,0.00039347485,0.0003853745,0.00028120764,0.0007506358,0.0007821729,0.0008643397,0.003308744],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001647995,0.00046733394,0.0014094402,0.00053597655,0.00013630869,0.00035531554,0.0001824078,0.022415798,0.22522226,0.037019588,0.13546215,0.5751454],"study_design_scores_gemma":[0.0012205966,0.002504281,0.0023190891,0.00010314929,0.0002666047,0.0012449722,0.00013075217,0.27826414,0.26538387,0.015153884,0.43325657,0.00015203454],"about_ca_topic_score_codex":0.0012936889,"about_ca_topic_score_gemma":0.0016092086,"teacher_disagreement_score":0.013377592,"about_ca_system_score_codex":0.0004090483,"about_ca_system_score_gemma":0.00074623985,"threshold_uncertainty_score":0.04475248},"labels":[],"label_agreement":null},{"id":"W1485542865","doi":"10.1007/978-3-642-16184-1_17","title":"Discovery of Conservation Laws via Matrix Search","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Conservation law; Scalability; Matrix (chemical analysis); Scientific discovery; Theoretical computer science; Database; Mathematics","score_opus":0.01764097983309214,"score_gpt":0.26231545895136765,"score_spread":0.2446744791182755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485542865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037252463,0.0018590202,0.90180624,0.003110006,0.0003860202,0.000119391865,0.00031076337,0.0008920076,0.054264016],"genre_scores_gemma":[0.5566866,0.003061932,0.40630198,0.0012763338,0.0009619125,0.0004985724,0.00064106093,0.0008063332,0.029765232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937195,0.00020771586,0.000025962787,0.00008969149,0.00024460186,0.0000601175],"domain_scores_gemma":[0.99466175,0.0040354775,0.00028028828,0.0005794016,0.00026215866,0.00018086281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013877037,0.00092033466,0.0020611598,0.0019428115,0.0010823358,0.0027445755,0.002805403,0.0020862273,0.007592719],"category_scores_gemma":[0.011891535,0.0011253399,0.0013216289,0.0016755244,0.003777706,0.006633536,0.0026229224,0.0046228277,0.00133758],"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.000031501055,0.000032591044,0.00012814104,0.00011132184,0.000026359627,0.00003274704,0.000051654704,0.012146609,0.0005250221,0.9721015,0.0032019636,0.011610544],"study_design_scores_gemma":[0.000022621894,0.000007666975,0.000045279896,0.000011984906,0.0000047376525,0.000022965585,0.000009681831,0.108290166,0.00019721281,0.8903206,0.0010589609,0.000008215994],"about_ca_topic_score_codex":0.0013222131,"about_ca_topic_score_gemma":0.001436592,"teacher_disagreement_score":0.007592719,"about_ca_system_score_codex":0.0012104714,"about_ca_system_score_gemma":0.0009877749,"threshold_uncertainty_score":0.025400162},"labels":[],"label_agreement":null},{"id":"W1485562483","doi":"10.1007/978-3-540-87879-7_3","title":"A Tool to Visualize Architectural Design Decisions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; Decision analysis; Software engineering; Decision support system; Architecture; Software architecture; Business decision mapping; Key (lock); Data science; Software; Management science; Artificial intelligence; Engineering; Programming language","score_opus":0.0410595540471483,"score_gpt":0.29701895047819976,"score_spread":0.2559593964310515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485562483","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.010140162,0.0005908102,0.8700344,0.00050090055,0.00024030298,0.000193886,0.0065850113,0.08756202,0.024152417],"genre_scores_gemma":[0.05282057,0.0013128138,0.90307117,0.00023881889,0.0000736864,0.00048891775,0.011452423,0.010801024,0.019740654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996388,0.00008076088,0.00004133376,0.000051845534,0.00014933942,0.000037954593],"domain_scores_gemma":[0.99796486,0.0012035357,0.00014907669,0.00030625446,0.0002523405,0.00012397647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008841374,0.0024750328,0.00079376955,0.004104827,0.0008890688,0.003819747,0.0013334126,0.0016098643,0.034875773],"category_scores_gemma":[0.0034441852,0.0013062367,0.0012880057,0.0026388967,0.00046199342,0.00332747,0.002006815,0.0023692506,0.008096318],"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.00035559724,0.00037831042,0.003662134,0.0015823301,0.00011922562,0.001107332,0.0028464727,0.03449981,0.020104572,0.06888282,0.21661304,0.64984834],"study_design_scores_gemma":[0.00024421557,0.00016295894,0.002498014,0.0009352552,0.00017990565,0.0012764832,0.00072880444,0.35172802,0.02048135,0.08059317,0.5409388,0.00023300044],"about_ca_topic_score_codex":0.0037474763,"about_ca_topic_score_gemma":0.008680814,"teacher_disagreement_score":0.034875773,"about_ca_system_score_codex":0.0005500058,"about_ca_system_score_gemma":0.0010165912,"threshold_uncertainty_score":0.116671085},"labels":[],"label_agreement":null},{"id":"W1485566346","doi":"10.1007/11753810_31","title":"Delay Performance Analysis for an Agile All-Photonic Star Network","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Queuing delay; Agile software development; Queueing theory; Scheduling (production processes); Computer network; Wavelength-division multiplexing; Star network; Bandwidth (computing); Propagation delay; Statistical time division multiplexing; Multiplexing; Distributed computing; Network topology; Telecommunications; Wavelength; Mathematical optimization; Optics","score_opus":0.013934289052057066,"score_gpt":0.23030328061177846,"score_spread":0.2163689915597214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485566346","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.47588584,0.0026520856,0.4804099,0.0005985457,0.00012918387,0.00006644301,0.00019665323,0.00054832065,0.039512895],"genre_scores_gemma":[0.9753464,0.00081969664,0.016826864,0.00006645475,0.000074342155,0.000021753951,0.000056888453,0.000092446135,0.0066951476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997347,0.00004711579,0.000004525853,0.000029656103,0.0001249077,0.000059139686],"domain_scores_gemma":[0.9989512,0.00065857806,0.000080216996,0.000053488253,0.00021978107,0.00003660776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049874047,0.00065616047,0.00036313388,0.0006410005,0.00044520103,0.00081915344,0.00066493,0.00048352493,0.0021465395],"category_scores_gemma":[0.0014134693,0.00021877605,0.00027964998,0.000666192,0.0005033579,0.00078668585,0.0004109349,0.000619696,0.00044082495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005895581,0.0000881642,0.0015748768,0.00016929503,0.000073139774,0.00028940875,0.00019822251,0.7929715,0.0919196,0.07828966,0.0016417209,0.03219491],"study_design_scores_gemma":[0.0000064935743,0.00008315929,0.0002373196,0.0000068839936,0.000013232926,0.000096944656,0.000026624539,0.98873144,0.005763617,0.0044587124,0.0005654001,0.0000102583335],"about_ca_topic_score_codex":0.0026459303,"about_ca_topic_score_gemma":0.0023602578,"teacher_disagreement_score":0.0026459303,"about_ca_system_score_codex":0.0015503014,"about_ca_system_score_gemma":0.00052063685,"threshold_uncertainty_score":0.011248291},"labels":[],"label_agreement":null},{"id":"W148558015","doi":"10.1007/978-3-642-31095-9_33","title":"Business Intelligence Modeling in Action: A Hospital Case Study","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Business intelligence; Knowledge management; Business process modeling; Process management; Business model; Management science; Engineering management; Business process; Engineering; Business; Operations management; Work in process","score_opus":0.10831552424577362,"score_gpt":0.3044579043272151,"score_spread":0.19614238008144147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148558015","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.93071824,0.00037052258,0.014269609,0.0042618937,0.000039584495,0.00035841577,0.00037485216,0.00013096032,0.049475953],"genre_scores_gemma":[0.9766768,0.00047646218,0.009286306,0.00033174225,0.000016801214,0.000114052506,0.00024665715,0.000044009164,0.0128071485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767214,0.0014288096,0.00007813346,0.00013517437,0.00034189384,0.0003437892],"domain_scores_gemma":[0.9945785,0.0038072,0.00030280682,0.00032179162,0.0003514031,0.0006383124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027854366,0.0005539963,0.0002688917,0.0007842529,0.002706484,0.0029428967,0.0016051695,0.0027367496,0.0059806216],"category_scores_gemma":[0.005205551,0.00030608574,0.0004073094,0.0016254854,0.0015757784,0.0017667582,0.0018618088,0.0015046742,0.00085373566],"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.0026194097,0.022834744,0.14540397,0.0011649278,0.00028613338,0.07629397,0.1332528,0.09156483,0.006678659,0.13521214,0.045650948,0.33903748],"study_design_scores_gemma":[0.0010960565,0.0051568514,0.06703648,0.0010392927,0.0004037719,0.022492541,0.33347252,0.26639116,0.014388601,0.05083183,0.23733443,0.0003564366],"about_ca_topic_score_codex":0.026207743,"about_ca_topic_score_gemma":0.038159814,"teacher_disagreement_score":0.026207743,"about_ca_system_score_codex":0.0036848648,"about_ca_system_score_gemma":0.002710611,"threshold_uncertainty_score":0.052110374},"labels":[],"label_agreement":null},{"id":"W1485596561","doi":"10.1007/11561354_19","title":"Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Scheduling (production processes); Wireless; Hermitian matrix; Computer network; Code (set theory); Telecommunications; Programming language; Mathematical optimization; Mathematics","score_opus":0.020788367603709813,"score_gpt":0.2660016171101031,"score_spread":0.2452132495063933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485596561","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.038090806,0.010872101,0.92341864,0.0013355325,0.0009949094,0.00021619083,0.00014355492,0.00069333636,0.024234977],"genre_scores_gemma":[0.6171174,0.009086717,0.33588433,0.0005416757,0.0011730926,0.00049997156,0.00030661386,0.00025000307,0.03514022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.00027723165,0.000045713936,0.00007205178,0.00030411695,0.000084875],"domain_scores_gemma":[0.9980458,0.0010288514,0.0001371495,0.00038404873,0.00033772303,0.00006638172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015099655,0.00066409877,0.000630622,0.0007097746,0.0005915975,0.0011755745,0.0012826236,0.00085206394,0.0020938544],"category_scores_gemma":[0.0030882764,0.00035356937,0.00030830278,0.0012882481,0.0013559181,0.001809477,0.0010527746,0.0013491208,0.00045624087],"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.00031992176,0.00009554146,0.0002656758,0.00027057072,0.000045733836,0.00017350471,0.00032801655,0.07449612,0.015393135,0.7190245,0.010207952,0.17937931],"study_design_scores_gemma":[0.00009748703,0.00027407665,0.0003053277,0.0000836929,0.000048211597,0.00040135338,0.00012851215,0.4670078,0.011997644,0.47584033,0.04373459,0.000081105725],"about_ca_topic_score_codex":0.0007052903,"about_ca_topic_score_gemma":0.0011157144,"teacher_disagreement_score":0.0020938544,"about_ca_system_score_codex":0.0010559965,"about_ca_system_score_gemma":0.0011826415,"threshold_uncertainty_score":0.007985532},"labels":[],"label_agreement":null},{"id":"W1485659468","doi":"10.1007/3-540-44963-9_36","title":"Modelling Reputation in Agent-Based Marketplaces to Improve the Performance of Buying Agents","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Computer science; Purchasing; Quality (philosophy); Order (exchange); Focus (optics); Reinforcement learning; Business; Marketing; Artificial intelligence","score_opus":0.06030244777151366,"score_gpt":0.3228385792349159,"score_spread":0.2625361314634022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485659468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39550325,0.0011579152,0.59047574,0.0014333829,0.0003377727,0.00015735223,0.00013693742,0.0012206344,0.009577019],"genre_scores_gemma":[0.97446436,0.00011537139,0.02351191,0.00003132973,0.000040454157,0.000026452368,0.00003876077,0.00004609008,0.0017253594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982821,0.0009589316,0.00010111335,0.00020151968,0.00026258716,0.0001936418],"domain_scores_gemma":[0.9878875,0.008543311,0.0010181207,0.0007758466,0.0012336733,0.00054158375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042718532,0.0007333743,0.0015911789,0.0005792215,0.00071904936,0.002828932,0.0023714246,0.002074619,0.0044537066],"category_scores_gemma":[0.022968696,0.00068765355,0.00065841596,0.000855156,0.00092306576,0.0047170166,0.0013727008,0.0017266909,0.0006434614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073331734,0.0003656554,0.0031341873,0.00013004571,0.000118725955,0.00017342265,0.00021923179,0.92871636,0.0035808682,0.033598218,0.0018246827,0.027405355],"study_design_scores_gemma":[0.000036317437,0.000051976705,0.0001590023,0.0000028703867,0.000015428788,0.00001351343,0.000013182426,0.99146104,0.0004073589,0.0077015455,0.00012923642,0.000008473392],"about_ca_topic_score_codex":0.0030244715,"about_ca_topic_score_gemma":0.0033001772,"teacher_disagreement_score":0.0044537066,"about_ca_system_score_codex":0.0010996452,"about_ca_system_score_gemma":0.0010009945,"threshold_uncertainty_score":0.022591949},"labels":[],"label_agreement":null},{"id":"W1485665058","doi":"10.1007/978-3-540-71289-3_22","title":"A Prioritization Approach for Software Test Cases Based on Bayesian Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":68,"is_retracted":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":"Regression testing; Bayesian network; Computer science; Data mining; Software; Bayesian probability; Reliability engineering; Fault (geology); Fault detection and isolation; Test case; Code coverage; Machine learning; Regression analysis; Artificial intelligence; Software system; Software construction; Engineering; Programming language","score_opus":0.029998499637316784,"score_gpt":0.27108712254050804,"score_spread":0.24108862290319125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485665058","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.0036006363,0.00018585472,0.9939421,0.00020645867,0.000023725102,0.00013320443,0.00006136751,0.0005486551,0.0012979193],"genre_scores_gemma":[0.12445968,0.00027901973,0.8724867,0.00015979982,0.00008711562,0.00027963537,0.00028590387,0.00020945238,0.0017526833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882321,0.0036018717,0.000806381,0.0012873698,0.005377745,0.0006945431],"domain_scores_gemma":[0.97545755,0.018805701,0.0010627556,0.0010274719,0.0031214203,0.00052512466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009606144,0.0020096526,0.0027312096,0.0069081616,0.0012774628,0.0038135082,0.004282527,0.002330272,0.0057909954],"category_scores_gemma":[0.035721485,0.001999003,0.002350077,0.0033259839,0.0016623583,0.005390833,0.002861402,0.0034414367,0.0009867196],"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.0005374022,0.00045681448,0.0030344392,0.00045706067,0.00033022446,0.00047872192,0.0006075964,0.35891697,0.00679134,0.0982679,0.0061649526,0.52395654],"study_design_scores_gemma":[0.0000581443,0.000043869484,0.0003782183,0.00005970155,0.0001133148,0.00011023698,0.000043597553,0.93512154,0.0016711686,0.06059294,0.0017732476,0.000033976776],"about_ca_topic_score_codex":0.011987115,"about_ca_topic_score_gemma":0.01756675,"teacher_disagreement_score":0.011987115,"about_ca_system_score_codex":0.0030013022,"about_ca_system_score_gemma":0.003720132,"threshold_uncertainty_score":0.050802708},"labels":[],"label_agreement":null},{"id":"W1485791179","doi":"10.1007/10722280_37","title":"From PROLOG++ to PROLOG+CG: A CG Object-Oriented Logic Programming Language","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"York University","funders":"","keywords":"Prolog; Programming language; Computer science; Logic programming; Object (grammar); Constraint programming; Java; Horn clause; Artificial intelligence; Mathematics","score_opus":0.0153579781809225,"score_gpt":0.25046394000411626,"score_spread":0.23510596182319377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485791179","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.0020000625,0.004482898,0.9260928,0.0025569773,0.001143123,0.00013227235,0.00092423894,0.013392271,0.049275354],"genre_scores_gemma":[0.029980103,0.009307505,0.89424735,0.0033702722,0.0009387552,0.00026002456,0.0028113443,0.010656763,0.048427936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992773,0.0001326615,0.00008575029,0.00014456631,0.00027336556,0.000086310494],"domain_scores_gemma":[0.9994855,0.00020929611,0.000037023834,0.00009673034,0.00010651058,0.00006482535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088239275,0.00085375726,0.0007549357,0.0010985998,0.0008555056,0.0043577785,0.0016404353,0.00084767037,0.01588816],"category_scores_gemma":[0.0024499984,0.0010036014,0.00094375544,0.0019025339,0.0019113054,0.006967245,0.0030214235,0.004619393,0.010464404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094927,0.00006933711,0.00018599546,0.0008374279,0.00002486637,0.0001956981,0.00048088294,0.002525379,0.003456282,0.41924167,0.13380606,0.4390815],"study_design_scores_gemma":[0.00004732173,0.00003156458,0.000178432,0.0002573303,0.000027563376,0.00045592547,0.00007416068,0.00531537,0.004740482,0.2907303,0.69809455,0.000046956917],"about_ca_topic_score_codex":0.0020482382,"about_ca_topic_score_gemma":0.0021107802,"teacher_disagreement_score":0.01588816,"about_ca_system_score_codex":0.00092991284,"about_ca_system_score_gemma":0.0019034705,"threshold_uncertainty_score":0.05315119},"labels":[],"label_agreement":null},{"id":"W1485834477","doi":"10.1007/11766247_20","title":"Learning Bayesian Networks in Semi-deterministic Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Simon Fraser University","funders":"","keywords":"Computer science; Bayesian network; Artificial intelligence; Bayesian probability; Machine learning","score_opus":0.014348516788888129,"score_gpt":0.23375145799720756,"score_spread":0.21940294120831944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485834477","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.005111437,0.001178857,0.99096066,0.0004119209,0.000037315356,0.000015913809,0.00008146739,0.00010529712,0.0020970574],"genre_scores_gemma":[0.50757766,0.0069585363,0.47094348,0.00039773103,0.00058319257,0.000445574,0.0008320763,0.00019771868,0.012063969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980596,0.0010505032,0.00011986768,0.0003499419,0.00033264142,0.00008747905],"domain_scores_gemma":[0.9755913,0.022420205,0.00074048643,0.00050903996,0.00051571376,0.00022337424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041576847,0.00096294575,0.0019297602,0.0013108323,0.0006217127,0.0025947578,0.002115355,0.00242385,0.0043797367],"category_scores_gemma":[0.02376228,0.0017572759,0.0012162147,0.0018999594,0.0024514906,0.0046413527,0.0020281726,0.002966124,0.00059542205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043091808,0.00003054184,0.0006206307,0.00017432058,0.00007126598,0.000059469705,0.00013345205,0.67478824,0.00019985439,0.29337192,0.0012269208,0.029280275],"study_design_scores_gemma":[0.0000091421225,0.0000063263947,0.00009223975,0.000020528407,0.000010793616,0.000017193184,0.00000983159,0.68960124,0.00007571086,0.3093326,0.0008141726,0.0000101791275],"about_ca_topic_score_codex":0.004814025,"about_ca_topic_score_gemma":0.0049970923,"teacher_disagreement_score":0.004814025,"about_ca_system_score_codex":0.0018849703,"about_ca_system_score_gemma":0.0009830353,"threshold_uncertainty_score":0.021988153},"labels":[],"label_agreement":null},{"id":"W1485855914","doi":"10.1007/978-3-540-74126-8_26","title":"Algorithms for the Extraction of Synteny Blocks from Comparative Maps","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Synteny; Computer science; Extraction (chemistry); Computational biology; Biology; Chemistry; Chromatography; Genetics","score_opus":0.040882404148095255,"score_gpt":0.3036998917927222,"score_spread":0.262817487644627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485855914","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.0057245656,0.0009165837,0.9726609,0.00015964545,0.00006246478,0.0003885144,0.0020736395,0.016633427,0.0013802303],"genre_scores_gemma":[0.00946773,0.00033709093,0.98225164,0.000047178404,0.000020880378,0.00038946228,0.005530447,0.0007292532,0.0012262749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984756,0.0002623572,0.00020779295,0.00039539515,0.0005371884,0.00012164889],"domain_scores_gemma":[0.9938945,0.003871179,0.00034272694,0.0007541169,0.000976315,0.00016113339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003249852,0.0028751392,0.0024549938,0.006477661,0.0017609935,0.0042524585,0.004919573,0.00222929,0.015637504],"category_scores_gemma":[0.01157337,0.0020524296,0.0027810188,0.0073703416,0.001074248,0.00420128,0.0033588714,0.0030575534,0.011978664],"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.0005375574,0.00017512037,0.0012514453,0.0010202351,0.00022668853,0.00021023225,0.00045344493,0.01211212,0.022784201,0.017250404,0.027671114,0.9163074],"study_design_scores_gemma":[0.00093025994,0.00041188192,0.0068721003,0.00048964063,0.00068319455,0.0018590513,0.0009338728,0.5730445,0.07119621,0.23487796,0.108429834,0.0002714373],"about_ca_topic_score_codex":0.0039442205,"about_ca_topic_score_gemma":0.0073253023,"teacher_disagreement_score":0.015637504,"about_ca_system_score_codex":0.0012142105,"about_ca_system_score_gemma":0.002297139,"threshold_uncertainty_score":0.05231273},"labels":[],"label_agreement":null},{"id":"W1485865028","doi":"10.1007/978-3-642-19400-9_26","title":"Comparing Approaches to Tag Discourse Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Lexicography and Language Studies","field":"Arts and Humanities","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":"Computer science; Automatic summarization; Natural language processing; Attributive; Artificial intelligence; Relation (database); Linguistics; Parsing; Isolation (microbiology); Authorship attribution; Data mining","score_opus":0.13638282000896992,"score_gpt":0.24654705051626696,"score_spread":0.11016423050729704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485865028","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.31659982,0.019396361,0.58636034,0.0030857683,0.0013043836,0.001018076,0.0075580208,0.005816349,0.058860876],"genre_scores_gemma":[0.58894104,0.0052034804,0.3718607,0.0008371237,0.00033469318,0.00078936014,0.017952489,0.0016337604,0.012447409],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98389304,0.009263322,0.0013051621,0.0016707382,0.0032175495,0.0006500973],"domain_scores_gemma":[0.9258225,0.060287632,0.0011249165,0.005685188,0.0062064044,0.00087335886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015017984,0.0012431614,0.0009938442,0.015504099,0.0022453237,0.00868234,0.0025432573,0.0032740564,0.008499863],"category_scores_gemma":[0.050261736,0.0009602742,0.0017116374,0.009597538,0.0023060543,0.017045876,0.0057615275,0.0027071226,0.004169898],"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.0037612598,0.0006961481,0.020376725,0.002874262,0.0010396533,0.00019121611,0.013227615,0.009119771,0.013253518,0.09547672,0.024301132,0.81568205],"study_design_scores_gemma":[0.0009814323,0.0021294798,0.032531336,0.002759948,0.0033566146,0.001173314,0.048143025,0.27753678,0.045779746,0.41072726,0.17418678,0.00069430156],"about_ca_topic_score_codex":0.005443897,"about_ca_topic_score_gemma":0.0113864755,"teacher_disagreement_score":0.015504099,"about_ca_system_score_codex":0.0023460647,"about_ca_system_score_gemma":0.0021687401,"threshold_uncertainty_score":0.079423666},"labels":[],"label_agreement":null},{"id":"W1485873716","doi":"10.1007/978-3-642-14533-9_31","title":"Using Graph Edit Distance to Diagnose Student’s Science Process Skill in Physics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Athabasca University","funders":"","keywords":"Computer science; Graph; Process (computing); Mathematics education; Artificial intelligence; Theoretical computer science; Programming language; Mathematics","score_opus":0.02082009890967323,"score_gpt":0.3120290502150291,"score_spread":0.29120895130535585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485873716","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.94778603,0.00011283587,0.048221547,0.00007016523,0.00003857507,0.000047081867,0.0006256795,0.0005526185,0.0025455763],"genre_scores_gemma":[0.9832628,0.000032599364,0.015471386,0.000010496328,0.000007729291,0.000016529995,0.00047278276,0.000026681279,0.0006990872],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.00008852966,0.000038565395,0.00013865462,0.00015075927,0.000045407614],"domain_scores_gemma":[0.9967474,0.0018393782,0.00037819,0.00019210715,0.0006045453,0.0002383909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044846197,0.00029373975,0.00026491287,0.0020858184,0.00023332442,0.000534475,0.00042359188,0.00056758366,0.0014411659],"category_scores_gemma":[0.0043596346,0.00008928359,0.00028157973,0.0009973424,0.0001711384,0.00079274114,0.00057960977,0.0003828233,0.00040751018],"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.0016101616,0.0008747566,0.4747625,0.00026806752,0.0003738008,0.0006715472,0.0010743991,0.02790246,0.04973539,0.0017777989,0.0034467704,0.43750226],"study_design_scores_gemma":[0.000053237283,0.001157169,0.37934363,0.000028450326,0.0002261384,0.0011046903,0.0010756648,0.57143664,0.03799039,0.0046511125,0.0028375434,0.000095329066],"about_ca_topic_score_codex":0.0032201523,"about_ca_topic_score_gemma":0.0038456826,"teacher_disagreement_score":0.0032201523,"about_ca_system_score_codex":0.00024710372,"about_ca_system_score_gemma":0.0002863333,"threshold_uncertainty_score":0.0064027905},"labels":[],"label_agreement":null},{"id":"W1485899467","doi":"10.1007/978-3-540-30117-2_107","title":"FPGA Implementation of Adaptive Multiuser Detector for DS-CDMA Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Field-programmable gate array; Virtex; Modular design; Multiuser detection; Wireless; Code division multiple access; Detector; Embedded system; Computer hardware; Design flow; Real-time computing; Computer architecture; Computer network; Telecommunications","score_opus":0.04218096839969814,"score_gpt":0.3192200766319305,"score_spread":0.2770391082322324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485899467","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.24587238,0.004836437,0.67836374,0.00047559338,0.0010165692,0.0001968444,0.00059199333,0.0126748895,0.05597157],"genre_scores_gemma":[0.7929884,0.00086559186,0.18381815,0.00026485807,0.000072199095,0.00006249193,0.00037082192,0.0001253279,0.021432085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998871,0.000021514023,0.0000073585106,0.000019940568,0.000039598053,0.000024461535],"domain_scores_gemma":[0.9998932,0.00003349637,0.0000076221027,0.00001761667,0.00004030105,0.000007808871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102706974,0.0003446031,0.0002080572,0.0003835665,0.00018697376,0.0006054031,0.0005356199,0.00031335434,0.008428338],"category_scores_gemma":[0.00026326368,0.00017087685,0.00013311097,0.0002316396,0.00007109353,0.00029745974,0.00012476764,0.00027694626,0.0013815818],"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.0012908252,0.0002045259,0.0027667093,0.00062672846,0.00019665652,0.0007748483,0.0001979252,0.03999068,0.2738168,0.018485855,0.01956631,0.6420822],"study_design_scores_gemma":[0.000378576,0.0018298143,0.0055504628,0.00019400279,0.00021819456,0.0024939904,0.00012841543,0.44037926,0.45098534,0.004673098,0.09307507,0.00009375579],"about_ca_topic_score_codex":0.0013292239,"about_ca_topic_score_gemma":0.0024024062,"teacher_disagreement_score":0.008428338,"about_ca_system_score_codex":0.00031283047,"about_ca_system_score_gemma":0.00031071686,"threshold_uncertainty_score":0.02819562},"labels":[],"label_agreement":null},{"id":"W1485929046","doi":"10.1007/3-540-44460-2_5","title":"Scalable Visualization of Event Data","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intranet; Scalability; Event (particle physics); Exploratory data analysis; Visualization; Process (computing); Architecture; Data mining; Distributed computing; Data science; Database; World Wide Web; Operating system","score_opus":0.028437879110967165,"score_gpt":0.2818067928081368,"score_spread":0.25336891369716963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485929046","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025947606,0.001138586,0.9345038,0.0007406218,0.00023594254,0.00008939771,0.0023922597,0.028317193,0.006634515],"genre_scores_gemma":[0.33271086,0.0022978412,0.6437429,0.0001917544,0.00030008564,0.00026124372,0.00813221,0.0029660286,0.009397087],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996698,0.000056736415,0.00002004513,0.00005655868,0.00015659511,0.00004035061],"domain_scores_gemma":[0.9988463,0.00045184157,0.000059027487,0.0003382159,0.00018769632,0.00011691802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894536,0.0012290991,0.00128906,0.0013428197,0.0005863366,0.002635276,0.0016315278,0.0005419535,0.01260485],"category_scores_gemma":[0.00197163,0.0006696424,0.0006359115,0.0020059024,0.00038016005,0.0018593655,0.002323303,0.0014735592,0.0017646017],"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.0010560296,0.00025083974,0.002026296,0.0007154389,0.00024350207,0.0004642736,0.00051308767,0.13112964,0.09622547,0.037617926,0.13138808,0.5983694],"study_design_scores_gemma":[0.00009762896,0.0000485171,0.0010081663,0.000032184358,0.000030597395,0.00014117632,0.00010601799,0.9242471,0.022049544,0.035125416,0.017074788,0.000038830487],"about_ca_topic_score_codex":0.0034706823,"about_ca_topic_score_gemma":0.0053701582,"teacher_disagreement_score":0.01260485,"about_ca_system_score_codex":0.00055979606,"about_ca_system_score_gemma":0.0006279094,"threshold_uncertainty_score":0.042167485},"labels":[],"label_agreement":null},{"id":"W1485978144","doi":"10.1007/978-3-540-88313-5_9","title":"CROO: A Universal Infrastructure and Protocol to Detect Identity Fraud","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer security; Password; Credential; Database transaction; Scalability; Hash function; Authentication (law); Direct Anonymous Attestation; Encryption; Protocol (science); Identity theft; Identity (music); Trusted Computing; Operating system; Database","score_opus":0.01289485330213814,"score_gpt":0.2566250971968241,"score_spread":0.24373024389468595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485978144","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.016134841,0.00090675644,0.9210267,0.0015624969,0.0012483548,0.0016940634,0.0008143769,0.022604303,0.034008194],"genre_scores_gemma":[0.44456515,0.0013643506,0.43976095,0.0024435834,0.00061910955,0.0017665171,0.0024102128,0.002920109,0.104150034],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968135,0.00071644253,0.00015160195,0.00030005112,0.0013049042,0.00071352615],"domain_scores_gemma":[0.99684215,0.00058387656,0.00033592826,0.001277602,0.00061181776,0.00034858662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00377447,0.0011660752,0.0012624298,0.002718983,0.0023487527,0.003369462,0.002951298,0.0027967507,0.008158976],"category_scores_gemma":[0.0065930756,0.00078073714,0.0006140054,0.0012432052,0.0031734777,0.005863846,0.006034649,0.0031692765,0.0048172083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018444778,0.00046045944,0.0022654082,0.0005033825,0.000108191765,0.000809877,0.0006695349,0.0056598466,0.028337136,0.36901116,0.13468893,0.4556415],"study_design_scores_gemma":[0.0005781819,0.0008660439,0.0026178288,0.0005226777,0.00023996546,0.0034235327,0.0005338341,0.18518934,0.12215408,0.23785383,0.44549718,0.00052343216],"about_ca_topic_score_codex":0.0019635537,"about_ca_topic_score_gemma":0.0021882174,"teacher_disagreement_score":0.008158976,"about_ca_system_score_codex":0.0012961186,"about_ca_system_score_gemma":0.0031384781,"threshold_uncertainty_score":0.027294517},"labels":[],"label_agreement":null},{"id":"W1485993952","doi":"10.1007/978-3-642-03685-9_10","title":"Optimal Sherali-Adams Gaps from Pairwise Independence","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":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":"Pairwise independence; Pairwise comparison; Constraint satisfaction problem; Hierarchy; Generalization; Conjecture; Independence (probability theory); Mathematics; Partition (number theory); Combinatorics; Domain (mathematical analysis); Discrete mathematics; Computer science; Random variable; Statistics; Independent and identically distributed random variables; Sum of normally distributed random variables","score_opus":0.012719353563984577,"score_gpt":0.2300012135828534,"score_spread":0.21728186001886882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485993952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17516871,0.0013240863,0.65063214,0.0021938519,0.00084112206,0.00016005385,0.00093157456,0.0015363039,0.16721213],"genre_scores_gemma":[0.7851416,0.00082650135,0.18089777,0.00052823295,0.00035258543,0.00028062027,0.0008946869,0.00093583146,0.030142164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991792,0.00016496818,0.000034632212,0.0001523845,0.00028591993,0.00018296886],"domain_scores_gemma":[0.997672,0.0013556139,0.00011400617,0.00042166057,0.0002109559,0.00022564892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014927684,0.0010024781,0.0021121658,0.0011606052,0.0014458225,0.0019594093,0.0024928688,0.0015927182,0.017600507],"category_scores_gemma":[0.00890986,0.0007675165,0.00082829344,0.0014560339,0.0018113737,0.0050243526,0.0042207856,0.004138061,0.0017575676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024953124,0.000083168314,0.00014388599,0.0001381134,0.000011231309,0.000039529834,0.00014858146,0.017176056,0.0012184021,0.9213167,0.009040035,0.050434817],"study_design_scores_gemma":[0.000045903078,0.000042000367,0.000105794024,0.000035118366,0.000011031478,0.000047578942,0.00007540682,0.058689356,0.0013110804,0.93392396,0.0057004094,0.000012342092],"about_ca_topic_score_codex":0.00072477054,"about_ca_topic_score_gemma":0.0011400388,"teacher_disagreement_score":0.017600507,"about_ca_system_score_codex":0.0012808632,"about_ca_system_score_gemma":0.0012672034,"threshold_uncertainty_score":0.058879554},"labels":[],"label_agreement":null},{"id":"W1486141598","doi":"10.1007/978-3-642-13681-8_37","title":"High Dimensional versus Low Dimensional Chaos in MPEG-7 Feature Binding for Object Classification","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Chaotic; Pattern recognition (psychology); Feature vector; Feature (linguistics); Classifier (UML); Binary number; CHAOS (operating system); Computer vision; Feature extraction; Mathematics","score_opus":0.01331058126773727,"score_gpt":0.23899808280190796,"score_spread":0.2256875015341707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486141598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06161272,0.00093797414,0.9225324,0.00030494112,0.0001954946,0.00013115429,0.00063651137,0.0038763736,0.009772512],"genre_scores_gemma":[0.40591624,0.00079729815,0.57365966,0.00018880995,0.00010984467,0.00023929737,0.0019539713,0.00056220917,0.016572718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973553,0.000037853722,0.00002012341,0.000027547654,0.00013779332,0.000041181076],"domain_scores_gemma":[0.99961805,0.0001347958,0.000018755969,0.00010501682,0.0000992734,0.000024103567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004767433,0.00030749643,0.00029173336,0.0006781992,0.00031857457,0.00077051524,0.00077432697,0.00051896495,0.004779716],"category_scores_gemma":[0.0012129331,0.00017743577,0.00028067193,0.00086028606,0.00039601378,0.0009712031,0.0007401832,0.00054412766,0.0016437225],"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.00055259804,0.00010160388,0.0010415838,0.00011928214,0.000024105642,0.00013068125,0.00018683715,0.017357372,0.10448422,0.060379267,0.016010258,0.7996123],"study_design_scores_gemma":[0.00004162097,0.0001935916,0.0033453724,0.00008890265,0.000046361984,0.00034997053,0.00015151981,0.71115416,0.17412084,0.07446691,0.035968702,0.000072062045],"about_ca_topic_score_codex":0.0023769045,"about_ca_topic_score_gemma":0.003681612,"teacher_disagreement_score":0.004779716,"about_ca_system_score_codex":0.00048193603,"about_ca_system_score_gemma":0.00040661843,"threshold_uncertainty_score":0.01598978},"labels":[],"label_agreement":null},{"id":"W1486218346","doi":"10.1007/978-3-642-15323-5_7","title":"A New Method to Find Developmental Descriptions for Digital Circuits","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Electronic circuit; Field-programmable gate array; Modular design; Digital electronics; Function (biology); Scalability; Theoretical computer science; Computer engineering; Parallel computing; Computer architecture; Algorithm; Arithmetic; Computer hardware; Mathematics; Programming language; Electrical engineering","score_opus":0.02700422935292478,"score_gpt":0.27897254594089527,"score_spread":0.2519683165879705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486218346","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.0014998442,0.0001108053,0.9915461,0.00006000166,0.000064439584,0.000072575145,0.00023001141,0.00093213096,0.0054841256],"genre_scores_gemma":[0.020880714,0.00022603122,0.96546656,0.00005460397,0.000035946956,0.00023411048,0.0007150672,0.0005923182,0.011794588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995272,0.00006156427,0.0000438682,0.00014073883,0.00019417236,0.00003244574],"domain_scores_gemma":[0.99914765,0.00036108107,0.000034895907,0.00018394965,0.0002349922,0.00003746346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062564237,0.0010724039,0.00071049563,0.0033851408,0.0012392417,0.0019557052,0.0020879365,0.0011113018,0.01913233],"category_scores_gemma":[0.0028824375,0.0007552864,0.0017612686,0.0019852587,0.0010828056,0.003427538,0.0018645455,0.0018134596,0.0049096276],"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.00007146014,0.000058616817,0.0005550795,0.00045496033,0.00005498061,0.0002605439,0.00045355456,0.0086309025,0.013339219,0.44985855,0.014681119,0.5115811],"study_design_scores_gemma":[0.00006796044,0.00009132108,0.0005203753,0.00020898631,0.00015140088,0.0013588251,0.00037052648,0.25219283,0.024684774,0.4965601,0.2236945,0.000098380224],"about_ca_topic_score_codex":0.0015428998,"about_ca_topic_score_gemma":0.0026157135,"teacher_disagreement_score":0.01913233,"about_ca_system_score_codex":0.00071480963,"about_ca_system_score_gemma":0.00086480303,"threshold_uncertainty_score":0.064003944},"labels":[],"label_agreement":null},{"id":"W1486238827","doi":"10.1007/978-3-540-85988-8_56","title":"Shape Analysis with Overcomplete Spherical Wavelets","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","field":"Mathematics","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":"Artificial Intelligence in Medicine (Canada)","funders":"Ellison Medical Foundation; National Institute of Biomedical Imaging and Bioengineering; National Center for Research Resources; National Institute of Neurological Disorders and Stroke; National Institutes of Health; National Science Foundation","keywords":"Wavelet; Computer science; Shape analysis (program analysis); Artificial intelligence; Multiresolution analysis; Gabor wavelet; Development (topology); Algorithm; Pattern recognition (psychology); Wavelet transform; Mathematics; Discrete wavelet transform; Mathematical analysis; Static analysis","score_opus":0.041505016224921934,"score_gpt":0.27901102230337654,"score_spread":0.23750600607845462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486238827","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.010434441,0.00011082105,0.9885295,0.000056997877,0.000017907063,0.0000054670986,0.00003677386,0.00009098997,0.0007170877],"genre_scores_gemma":[0.42492962,0.0015228789,0.56596637,0.0001307112,0.00019928397,0.000043608703,0.00051779434,0.00027519683,0.006414553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997739,0.000055541448,0.000014005815,0.000037526715,0.0000995275,0.00001944908],"domain_scores_gemma":[0.9996246,0.00010407979,0.000048173555,0.00011344558,0.00008388943,0.000025817582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049360615,0.0005533625,0.0005703633,0.0007687074,0.00015714185,0.00085560745,0.00040218089,0.00047568878,0.0014045722],"category_scores_gemma":[0.0013660742,0.00033040336,0.000559183,0.00086663885,0.000439484,0.0011332068,0.0009975401,0.00081907935,0.00072260044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029934166,0.00003439802,0.0008354384,0.0001569829,0.000081934006,0.00018737272,0.00014390031,0.21106784,0.12557198,0.15526639,0.0031346993,0.5032197],"study_design_scores_gemma":[0.00000869472,0.000039722898,0.00045007156,0.0000072243906,0.000013189565,0.0001268742,0.000030206045,0.93819493,0.008500605,0.049634703,0.0029796595,0.000014103319],"about_ca_topic_score_codex":0.00045661093,"about_ca_topic_score_gemma":0.00044646897,"teacher_disagreement_score":0.0014045722,"about_ca_system_score_codex":0.00019070257,"about_ca_system_score_gemma":0.00023071736,"threshold_uncertainty_score":0.004698813},"labels":[],"label_agreement":null},{"id":"W1486258796","doi":"10.1007/3-540-46029-2_10","title":"Applying the UML Performance Profile: Graph Grammar-Based Derivation of LQN Models from UML Specifications","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; UML tool; Unified Modeling Language; Applications of UML; Programming language; XML; Object Constraint Language; Graph rewriting; Graph; Software engineering; Software; Theoretical computer science; Operating system","score_opus":0.040602868688332315,"score_gpt":0.22641384665732975,"score_spread":0.18581097796899743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486258796","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.0056565637,0.000024988494,0.9859984,0.00012924561,0.000026553982,0.0001365133,0.00044053062,0.0039361245,0.0036511102],"genre_scores_gemma":[0.15028797,0.0002116563,0.83768207,0.00012613938,0.000019567438,0.00026632723,0.0031614418,0.004166389,0.0040784106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840206,0.00047920135,0.0001405568,0.00018507463,0.0007130967,0.00008004959],"domain_scores_gemma":[0.9968849,0.001664906,0.00019136562,0.0005416188,0.0006541799,0.000063066036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020835726,0.0006906728,0.00042816784,0.0013713901,0.0005214998,0.0022307085,0.001528117,0.000951955,0.0042788973],"category_scores_gemma":[0.009381474,0.0008844997,0.001222985,0.00083425955,0.000810947,0.0022650568,0.0020064865,0.0013766559,0.0027064325],"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.00017556876,0.00020932993,0.0030707493,0.0009896508,0.0000928624,0.00150377,0.0041593225,0.19678357,0.034676425,0.30586508,0.015304371,0.43716928],"study_design_scores_gemma":[0.000052399453,0.000052719846,0.0005478859,0.0002780117,0.00008187665,0.00037063187,0.00033643874,0.7690882,0.04482551,0.12633036,0.057961226,0.00007471566],"about_ca_topic_score_codex":0.008392754,"about_ca_topic_score_gemma":0.0080446405,"teacher_disagreement_score":0.008392754,"about_ca_system_score_codex":0.001234087,"about_ca_system_score_gemma":0.0027382986,"threshold_uncertainty_score":0.01668781},"labels":[],"label_agreement":null},{"id":"W1486295934","doi":"10.1007/11512622_24","title":"Ultra Fast Cycle-Accurate Compiled Emulation of Inorder Pipelined Architectures","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Emulation; Architecture; Porting; Hardware emulation; Software; Computer architecture; Process (computing); Embedded system; Software architecture; Operating system","score_opus":0.014311283434656975,"score_gpt":0.2610552479532722,"score_spread":0.2467439645186152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486295934","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.42491573,0.00082671683,0.52290994,0.00038890002,0.00035268907,0.000082620405,0.0006562701,0.018254668,0.03161244],"genre_scores_gemma":[0.8679585,0.00014942011,0.12406979,0.00010617079,0.00003918699,0.00006744167,0.00045944823,0.0010352216,0.0061147725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970144,0.00006803594,0.000012767906,0.000026727366,0.00013356484,0.000057367623],"domain_scores_gemma":[0.9993426,0.00026052122,0.00004336404,0.00014354948,0.0001820383,0.000027910966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036031945,0.00071275875,0.000480406,0.00046657288,0.00039080068,0.00066391524,0.001531469,0.00043662984,0.0063610924],"category_scores_gemma":[0.0011792425,0.00033995666,0.0003578533,0.00051402044,0.00031255532,0.0008552269,0.000506132,0.00067135366,0.00055106287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007565035,0.00015238153,0.0024592662,0.00028028508,0.00011444097,0.0003200971,0.0003243202,0.79602164,0.03197245,0.02303367,0.013120715,0.13144422],"study_design_scores_gemma":[0.00002215309,0.000050317336,0.00030747475,0.000008344394,0.000012843217,0.000025219597,0.000020040465,0.98247206,0.012428459,0.0024453155,0.002199146,0.000008568744],"about_ca_topic_score_codex":0.0037946862,"about_ca_topic_score_gemma":0.0068662814,"teacher_disagreement_score":0.0063610924,"about_ca_system_score_codex":0.0006860515,"about_ca_system_score_gemma":0.00086908956,"threshold_uncertainty_score":0.02127999},"labels":[],"label_agreement":null},{"id":"W1486309898","doi":"10.1007/3-540-47884-1_12","title":"Formally Linking MDG and HOL Based on a Verified MDG System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"HOL; Correctness; Computer science; Programming language; Automated theorem proving; Formal verification; Theoretical computer science; Semantics (computer science); Algorithm","score_opus":0.02742242845472755,"score_gpt":0.2499317911700515,"score_spread":0.22250936271532393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486309898","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.016047226,0.000047395577,0.97673166,0.00018357938,0.000062756786,0.00016230655,0.000093593255,0.0021673972,0.0045041363],"genre_scores_gemma":[0.343503,0.00012542338,0.649211,0.00013856053,0.000034254426,0.0002584813,0.00027119924,0.00042301376,0.006035015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.00043924773,0.00014296098,0.00020535986,0.00042704694,0.00015881864],"domain_scores_gemma":[0.99662673,0.002186379,0.00020646268,0.0005420552,0.0003326511,0.000105669984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002086856,0.00054193026,0.00048369757,0.0008136519,0.0006905105,0.0022214002,0.0012964582,0.0012237787,0.0062040137],"category_scores_gemma":[0.006505508,0.0005922514,0.0008620683,0.00045281113,0.0024311556,0.002512319,0.0024192801,0.0016981483,0.0006604538],"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.00040944747,0.00023543958,0.0014608866,0.00034561628,0.00007383762,0.0011902057,0.0008978654,0.18772046,0.015376253,0.68832386,0.0024680623,0.101498],"study_design_scores_gemma":[0.00017891846,0.00013564322,0.00031119297,0.000100976395,0.00009169025,0.00029271998,0.000100827834,0.655059,0.026875628,0.3006106,0.016193315,0.000049561062],"about_ca_topic_score_codex":0.0031002525,"about_ca_topic_score_gemma":0.0037187433,"teacher_disagreement_score":0.0062040137,"about_ca_system_score_codex":0.0009425679,"about_ca_system_score_gemma":0.0022910708,"threshold_uncertainty_score":0.020754457},"labels":[],"label_agreement":null},{"id":"W1486350349","doi":"10.1007/978-3-540-39429-7_12","title":"Finding ID Attributes in XML Documents","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XML; Information retrieval; Streaming XML; Programming language; World Wide Web; Database","score_opus":0.021930871252392757,"score_gpt":0.26553715294751906,"score_spread":0.2436062816951263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486350349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11213338,0.0044168932,0.8342791,0.0012422052,0.0005296063,0.000360242,0.0067311055,0.01850791,0.02179944],"genre_scores_gemma":[0.14082143,0.0029526257,0.80902773,0.0002902394,0.00014869386,0.00009074541,0.016255245,0.0014119969,0.02900124],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927264,0.000068838526,0.00010083342,0.00018217455,0.00031028624,0.00006531152],"domain_scores_gemma":[0.99856085,0.0008120622,0.000097782264,0.00025037938,0.00020894481,0.00007007169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112778,0.0007943242,0.0011784716,0.005668142,0.0009593428,0.0034605267,0.0015982105,0.001310889,0.0055499193],"category_scores_gemma":[0.003435597,0.00088667334,0.0011195457,0.0042185537,0.00062882324,0.005585066,0.0016650653,0.001060655,0.0044563673],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027821522,0.00022416451,0.012215814,0.000932151,0.00009322208,0.0013455733,0.0012584776,0.003890947,0.03264541,0.04445305,0.02510906,0.8775539],"study_design_scores_gemma":[0.000126197,0.00040737787,0.011435179,0.0011552663,0.0006319087,0.009097165,0.0033038934,0.13960901,0.26196933,0.20081043,0.37120402,0.00025022848],"about_ca_topic_score_codex":0.0021801216,"about_ca_topic_score_gemma":0.0028153786,"teacher_disagreement_score":0.005668142,"about_ca_system_score_codex":0.00084527355,"about_ca_system_score_gemma":0.0010280821,"threshold_uncertainty_score":0.01856631},"labels":[],"label_agreement":null},{"id":"W1486394166","doi":"10.1007/11427469_41","title":"A Neuro-fuzzy Controller for Reactive Navigation of a Behaviour-Based Mobile Robot","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Mobile robot; Neuro-fuzzy; Artificial intelligence; Fuzzy logic; Mobile robot navigation; Controller (irrigation); Robot; Control engineering; Fuzzy control system; Human–computer interaction; Robot control; Engineering","score_opus":0.018527942000960407,"score_gpt":0.2668278709782857,"score_spread":0.24829992897732528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486394166","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.025264885,0.00043791573,0.96184313,0.0001542039,0.00027819216,0.000095491494,0.00005570342,0.0016281045,0.010242428],"genre_scores_gemma":[0.8046124,0.00025116777,0.18508573,0.0001848547,0.000069883994,0.00022332079,0.00008959216,0.00005768485,0.009425374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986386,0.00001180591,0.000008481221,0.000037792463,0.000059994425,0.00001809679],"domain_scores_gemma":[0.9998447,0.00003241355,0.000015206303,0.000014453855,0.000079727026,0.000013389908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003026547,0.0004839141,0.00043156734,0.00030894481,0.0006547328,0.00057043805,0.0012709373,0.0008255973,0.002130702],"category_scores_gemma":[0.000502799,0.00025554627,0.0004187889,0.00021567759,0.0004285576,0.00028081486,0.0004858581,0.00058689486,0.0005620921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058507,0.00019096171,0.0006321709,0.00027706192,0.00015843297,0.0005045319,0.00030243114,0.4822478,0.121849574,0.01152417,0.004878555,0.37702844],"study_design_scores_gemma":[0.000038880593,0.00013487325,0.00039237575,0.000018945779,0.000054662258,0.00009513694,0.000015554233,0.98531806,0.0091558695,0.0015030609,0.0032542853,0.000018304969],"about_ca_topic_score_codex":0.009124697,"about_ca_topic_score_gemma":0.0117563335,"teacher_disagreement_score":0.009124697,"about_ca_system_score_codex":0.0005108448,"about_ca_system_score_gemma":0.0006490175,"threshold_uncertainty_score":0.018143177},"labels":[],"label_agreement":null},{"id":"W1486513335","doi":"10.1007/978-3-540-73951-7_29","title":"On Generalized Diamond Spanners","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Combinatorics; Delaunay triangulation; Polygon (computer graphics); Mathematics; Geometric graph theory; Diamond; Vertex (graph theory); Graph; Computer science; Line graph; Graph power","score_opus":0.025256371175187715,"score_gpt":0.26893403505441,"score_spread":0.24367766387922227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486513335","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.122407734,0.0034806042,0.3019778,0.0010722692,0.0018410672,0.00012389697,0.0004636273,0.00056767056,0.5680652],"genre_scores_gemma":[0.59598583,0.003952524,0.11773532,0.0008303212,0.00055604795,0.00014748973,0.0008836587,0.0006850709,0.27922377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998306,0.00003328069,0.000007096972,0.00003638898,0.00006497904,0.000027554373],"domain_scores_gemma":[0.99985445,0.00004025662,0.000012311577,0.000032144817,0.000032819666,0.000028037739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017489352,0.0006133813,0.0005786959,0.0010917739,0.0007505346,0.0008951618,0.0006908031,0.00050152384,0.020308232],"category_scores_gemma":[0.00062876905,0.00029597292,0.00038720344,0.001092663,0.0009533878,0.0016239346,0.0019269409,0.001482179,0.0026788088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020720032,0.000012394049,0.0000619852,0.0000564492,0.0000043812274,0.000057383717,0.00009679463,0.0024480578,0.0016645323,0.95396376,0.005020529,0.036592882],"study_design_scores_gemma":[0.0000061379283,0.000014404867,0.00007397456,0.000025831196,0.0000030152546,0.00011187532,0.00006290191,0.0049275425,0.0005270388,0.97255456,0.0216864,0.0000062796394],"about_ca_topic_score_codex":0.00062042405,"about_ca_topic_score_gemma":0.0011538728,"teacher_disagreement_score":0.020308232,"about_ca_system_score_codex":0.0004541516,"about_ca_system_score_gemma":0.0002096291,"threshold_uncertainty_score":0.06793779},"labels":[],"label_agreement":null},{"id":"W1486573515","doi":"10.1007/978-3-642-33704-8_11","title":"Enforcing Information Flow Policies by a Three-Valued Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Computer science; Information flow; Flow (mathematics); Theoretical computer science; Operations research; Mathematics; Geometry","score_opus":0.016550364262869086,"score_gpt":0.24745130130732781,"score_spread":0.23090093704445874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486573515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067527555,0.000042207237,0.9904218,0.00015380114,0.000021527414,0.000035684192,0.00003682845,0.00031774837,0.0022176176],"genre_scores_gemma":[0.3789269,0.00020381415,0.6166591,0.00015609994,0.000058712976,0.00012351571,0.00016897803,0.00025495994,0.0034478223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970643,0.0009143709,0.00024539884,0.00042799336,0.0010146303,0.00033327608],"domain_scores_gemma":[0.9956116,0.0028123825,0.00026963282,0.00075595814,0.00040618714,0.00014426117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037660005,0.0007446606,0.00085383735,0.0014922766,0.00093542057,0.0040183845,0.0017786404,0.001048271,0.003003983],"category_scores_gemma":[0.00803359,0.00068994187,0.0029297823,0.0012805174,0.0030449964,0.0048890044,0.002932844,0.003709795,0.0005597635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000128837,0.000060126495,0.00043439752,0.000095923475,0.00005996261,0.00011036303,0.00026283396,0.077117145,0.0056417133,0.8640202,0.000922389,0.05114615],"study_design_scores_gemma":[0.000018340046,0.00001864827,0.00006361734,0.000033149663,0.00003088071,0.0000280369,0.000033989294,0.4219676,0.0036346796,0.5724506,0.0016994113,0.000021099038],"about_ca_topic_score_codex":0.0020782582,"about_ca_topic_score_gemma":0.0014771101,"teacher_disagreement_score":0.0040183845,"about_ca_system_score_codex":0.0023320275,"about_ca_system_score_gemma":0.0020255782,"threshold_uncertainty_score":0.019916773},"labels":[],"label_agreement":null},{"id":"W1486612343","doi":"10.1007/978-3-540-24840-8_31","title":"Multi-agent Trail Making for Stigmergic Navigation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Manitoba","funders":"","keywords":"Computer science; Maxima and minima; Construct (python library); Artificial intelligence; Terrain; Human–computer interaction; Cartography; Mathematics","score_opus":0.041857277822939014,"score_gpt":0.29290166582083305,"score_spread":0.251044387997894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486612343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014110664,0.0005301005,0.97480565,0.0001238508,0.00009010027,0.000037933212,0.000047160454,0.00031121715,0.00994339],"genre_scores_gemma":[0.62986225,0.0006918629,0.3505909,0.00005314801,0.000055979493,0.0001419082,0.00012999124,0.00013901341,0.018334903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983823,0.00004118876,0.000011582975,0.000031965,0.00005619709,0.000020939484],"domain_scores_gemma":[0.99974185,0.00010927594,0.00002492078,0.000060468195,0.000038309998,0.000025257137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035251136,0.00053211796,0.00074789865,0.00058003643,0.0008776372,0.0012283542,0.0012186599,0.00090675487,0.0043627527],"category_scores_gemma":[0.0011791212,0.0004227869,0.0005324396,0.0007240729,0.0007674123,0.0016155774,0.0012436942,0.0011935823,0.0007438939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011048879,0.00006512588,0.00017062711,0.00013630175,0.000042913758,0.00006781844,0.00012209728,0.69388855,0.0050816606,0.17173557,0.0028805302,0.12569837],"study_design_scores_gemma":[0.00001291733,0.000023522673,0.000059759273,0.000011644223,0.000010745284,0.000024579831,0.00001810382,0.8663414,0.00096348027,0.12980838,0.0027148223,0.000010642645],"about_ca_topic_score_codex":0.0018186321,"about_ca_topic_score_gemma":0.0029463,"teacher_disagreement_score":0.0043627527,"about_ca_system_score_codex":0.000569783,"about_ca_system_score_gemma":0.00054689747,"threshold_uncertainty_score":0.0145949125},"labels":[],"label_agreement":null},{"id":"W1486622889","doi":"10.1007/978-3-540-25944-2_4","title":"Bayer Pattern Demosaicking Using Local-Correlation Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Toronto","funders":"","keywords":"Demosaicing; Color filter array; Artificial intelligence; Interpolation (computer graphics); Bayer filter; Computer vision; Pixel; Image sensor; Digital camera; Computer science; Enhanced Data Rates for GSM Evolution; Color gel; Mathematics; Image (mathematics); Color image; Image processing; Materials science","score_opus":0.031293465401614706,"score_gpt":0.26892440270206225,"score_spread":0.23763093730044754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486622889","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.0022966154,0.00009974235,0.9959286,0.000027524346,0.000020866717,0.000011652552,0.000020241232,0.0003651452,0.001229635],"genre_scores_gemma":[0.042218674,0.00043697865,0.95060813,0.00006831788,0.00003094849,0.000030045836,0.00015017432,0.0001944989,0.006262297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.000030922,0.000014873983,0.00004872714,0.00014492954,0.00001863311],"domain_scores_gemma":[0.9996474,0.00007613638,0.000029380351,0.00011575746,0.00011300404,0.000018268303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004271057,0.00075730594,0.00064673316,0.0010684986,0.00025195384,0.0007054563,0.00063933857,0.00077112456,0.0044367234],"category_scores_gemma":[0.0010094388,0.00050341646,0.00065277546,0.0014461247,0.00035570216,0.00090720947,0.00080281077,0.00081792224,0.003169537],"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.00014164134,0.000060704482,0.0005720274,0.0002388645,0.00007403227,0.00021502264,0.0001210549,0.041522007,0.24594778,0.019623894,0.0045306175,0.68695235],"study_design_scores_gemma":[0.000028232787,0.000092267845,0.0018797014,0.00003539888,0.00011661702,0.0015755524,0.00005260754,0.7540601,0.21016711,0.01550203,0.016423788,0.00006654771],"about_ca_topic_score_codex":0.0007491319,"about_ca_topic_score_gemma":0.0018903348,"teacher_disagreement_score":0.0044367234,"about_ca_system_score_codex":0.00025725208,"about_ca_system_score_gemma":0.0003451109,"threshold_uncertainty_score":0.014842331},"labels":[],"label_agreement":null},{"id":"W1486636865","doi":"10.1007/3-540-45749-6_28","title":"Geometric Algorithms for Density-Based Data Clustering","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Approximation algorithm; Cluster analysis; Algorithm; Computer science; Quadratic equation; Function (biology); Mathematics; Artificial intelligence","score_opus":0.06445117085016047,"score_gpt":0.2762087730906237,"score_spread":0.21175760224046322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486636865","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.00044826046,0.0006257218,0.99753535,0.00007315963,0.00004267025,0.000028525019,0.000042751308,0.0005270221,0.0006764417],"genre_scores_gemma":[0.025224216,0.0015624961,0.9692193,0.00008686301,0.00013439858,0.00020933636,0.00056603673,0.000324323,0.0026729652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976362,0.000653279,0.00013425978,0.0003946792,0.0010658412,0.00011572371],"domain_scores_gemma":[0.9970794,0.0011681403,0.00017390944,0.0008082413,0.00068925996,0.00008113698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018576777,0.0019273482,0.0024431543,0.0035255973,0.0014177766,0.0025129488,0.005074268,0.0020819886,0.006466329],"category_scores_gemma":[0.010500143,0.0015203868,0.0017747697,0.0072398717,0.002009137,0.003765362,0.0045657107,0.0033397437,0.00484372],"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.00010230659,0.00007704403,0.00063270674,0.00044710407,0.00013196937,0.00006207333,0.00022319978,0.22144896,0.0027538675,0.17263255,0.020602059,0.58088607],"study_design_scores_gemma":[0.00003236083,0.000046512836,0.00037519014,0.0000562108,0.00004069356,0.00026366021,0.00007668348,0.74223614,0.0030174903,0.2288593,0.024945756,0.00004997981],"about_ca_topic_score_codex":0.0039590816,"about_ca_topic_score_gemma":0.0037752017,"teacher_disagreement_score":0.006466329,"about_ca_system_score_codex":0.0017023878,"about_ca_system_score_gemma":0.0013720035,"threshold_uncertainty_score":0.021632016},"labels":[],"label_agreement":null},{"id":"W1486651402","doi":"10.1007/978-3-540-45227-0_78","title":"Integrating Quality of Service into Database Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Computer science; Quality of service; Software deployment; Database; Service (business); Mobile QoS; Web service; Distributed computing; Computer network; World Wide Web; Software engineering; Service provider","score_opus":0.03191293253067976,"score_gpt":0.29230321173534446,"score_spread":0.2603902792046647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486651402","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.011261999,0.0057786885,0.9492174,0.004123977,0.00046664264,0.00014742847,0.00015359782,0.0027665978,0.026083728],"genre_scores_gemma":[0.408679,0.008079933,0.5625511,0.0009897536,0.0009436984,0.0001529274,0.00067331304,0.0012298386,0.016700448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942715,0.0013343354,0.00042148103,0.00033012757,0.0032422605,0.00040028882],"domain_scores_gemma":[0.9934481,0.002546611,0.00049864576,0.0014315073,0.0016987189,0.00037635697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006930022,0.0005781298,0.00094052794,0.0022231457,0.0007447458,0.0060689533,0.0024268737,0.001494071,0.005267724],"category_scores_gemma":[0.017159693,0.0009596893,0.00085775356,0.004037502,0.0017562029,0.0115869595,0.0030445447,0.0027283838,0.0017214869],"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.00019041587,0.00015614634,0.0030609756,0.00054669933,0.00009300985,0.00011282025,0.00073997764,0.023298725,0.004846981,0.55513155,0.013968814,0.39785382],"study_design_scores_gemma":[0.00006208341,0.0002069451,0.0018782981,0.0004125399,0.00018580006,0.00040995533,0.0004671209,0.2616178,0.008472874,0.5196538,0.20652895,0.00010384033],"about_ca_topic_score_codex":0.0050390484,"about_ca_topic_score_gemma":0.003063602,"teacher_disagreement_score":0.006930022,"about_ca_system_score_codex":0.002685411,"about_ca_system_score_gemma":0.0021716128,"threshold_uncertainty_score":0.036649883},"labels":[],"label_agreement":null},{"id":"W1486708912","doi":"10.1007/11575863_25","title":"A Multiagent-Based Approach for Progressive Web Map Generation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Interoperability; Geospatial analysis; Context (archaeology); The Internet; World Wide Web; Web service; Dissemination; On the fly; Telecommunications; Cartography","score_opus":0.03707416692655118,"score_gpt":0.2900745519074717,"score_spread":0.25300038498092053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486708912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005289821,0.000042859745,0.9892075,0.00006303719,0.000036437435,0.00013375808,0.000058760597,0.0028002118,0.0023677133],"genre_scores_gemma":[0.13226017,0.000057603622,0.8623398,0.00005914436,0.000026204234,0.00021091037,0.0002594306,0.00036798575,0.0044186497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994,0.00016201545,0.00004109469,0.0001319399,0.00022327,0.000041713218],"domain_scores_gemma":[0.9988715,0.000459364,0.000051929248,0.00023745069,0.0003051484,0.00007452027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220337,0.0007248092,0.00073959935,0.001149282,0.0009787071,0.0013857062,0.0028090135,0.0012928544,0.007888771],"category_scores_gemma":[0.0029038163,0.0005965556,0.0006389874,0.0009199414,0.0004906522,0.0014429312,0.0021273203,0.0010495781,0.0015573418],"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.00035608734,0.0005459475,0.0009678567,0.00021334944,0.00014571955,0.00043219235,0.00044214536,0.2435372,0.032156117,0.022848481,0.012007169,0.68634766],"study_design_scores_gemma":[0.000031703985,0.000025585525,0.00011959436,0.0000058131286,0.00001862539,0.00005545892,0.00003341013,0.98645383,0.005668126,0.004583856,0.0029914465,0.00001261048],"about_ca_topic_score_codex":0.006571486,"about_ca_topic_score_gemma":0.010459636,"teacher_disagreement_score":0.007888771,"about_ca_system_score_codex":0.0005713195,"about_ca_system_score_gemma":0.00067021284,"threshold_uncertainty_score":0.026390553},"labels":[],"label_agreement":null},{"id":"W1486733425","doi":"10.1007/978-3-540-30077-9_31","title":"Combining Usage, Content, and Structure Data to Improve Web Site Recommendation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Recommender system; Computer science; World Wide Web; Web mining; Web navigation; Quality (philosophy); Information retrieval; Web page; Web modeling","score_opus":0.05587993088912222,"score_gpt":0.2819280223276768,"score_spread":0.22604809143855456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486733425","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.7300388,0.004887686,0.2359051,0.0007743121,0.00031858115,0.00027524214,0.009313254,0.009371036,0.009115955],"genre_scores_gemma":[0.86918753,0.00080884807,0.112913296,0.00015308446,0.00030705682,0.000129608,0.012616486,0.0002862409,0.003597962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863523,0.00037348893,0.000084795254,0.00027426516,0.00055235217,0.00007980696],"domain_scores_gemma":[0.99341667,0.0037419028,0.00036448814,0.0009480851,0.00130453,0.00022426709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014422094,0.00079131924,0.0016305603,0.0046802275,0.00036945628,0.0011324168,0.0009799228,0.0014226118,0.0016037478],"category_scores_gemma":[0.008181725,0.000520898,0.00091179844,0.0050808396,0.0002524564,0.002457998,0.0006233776,0.0012575082,0.0017953251],"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.0009514024,0.0025776948,0.17842549,0.00048416594,0.0011643327,0.000114461705,0.0002424079,0.0268767,0.023652846,0.00073618797,0.01968404,0.74509025],"study_design_scores_gemma":[0.00017917698,0.00077613606,0.17340559,0.000088762325,0.0009926799,0.0005369036,0.00018838068,0.7947884,0.017741475,0.0042182556,0.006920601,0.000163616],"about_ca_topic_score_codex":0.009328243,"about_ca_topic_score_gemma":0.04058535,"teacher_disagreement_score":0.009328243,"about_ca_system_score_codex":0.00042175842,"about_ca_system_score_gemma":0.00046808037,"threshold_uncertainty_score":0.018547893},"labels":[],"label_agreement":null},{"id":"W1486749294","doi":"10.1007/11766247_18","title":"Exploiting Dynamic Independence in a Static Conditioning Graph","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Overhead (engineering); Conditioning; Theoretical computer science; Graph; Inference; Node (physics); Computational complexity theory; Factor graph; Exponential function; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.01722423899701606,"score_gpt":0.25281643885762217,"score_spread":0.23559219986060612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486749294","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.009964466,0.00007196879,0.9859735,0.00017932539,0.00002338127,0.000025245523,0.00014120586,0.00047319225,0.0031477227],"genre_scores_gemma":[0.523046,0.0006253828,0.46317294,0.0004056616,0.00024154119,0.00017390691,0.0013223374,0.00085126597,0.010160845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986223,0.0004916853,0.000049588507,0.00034460396,0.00034105207,0.00015068178],"domain_scores_gemma":[0.9848786,0.011749192,0.0005851671,0.0018214876,0.00063612004,0.00032949474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022638352,0.0010891571,0.0014909124,0.0021589396,0.0010962063,0.0016340526,0.0026823706,0.0015069161,0.009510917],"category_scores_gemma":[0.015295181,0.0016469904,0.0014536731,0.0027369773,0.0021581398,0.0053653517,0.0026099775,0.0030269742,0.0010983204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028914097,0.00018685409,0.0014727083,0.00017247688,0.00011890428,0.0003095227,0.000244591,0.29358816,0.0029900786,0.59024465,0.0056832056,0.1046997],"study_design_scores_gemma":[0.000019665236,0.00001584359,0.00022576416,0.000013978453,0.000033387216,0.000069751106,0.000012332483,0.58896863,0.00076735695,0.40885058,0.0010038533,0.000018945593],"about_ca_topic_score_codex":0.0071606664,"about_ca_topic_score_gemma":0.008934842,"teacher_disagreement_score":0.009510917,"about_ca_system_score_codex":0.0012998955,"about_ca_system_score_gemma":0.001488654,"threshold_uncertainty_score":0.03181714},"labels":[],"label_agreement":null},{"id":"W1486808366","doi":"10.1007/978-3-642-45030-3_57","title":"The Distance 4-Sector of Two Points Is Unique","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Point processes and geometric inequalities","field":"Mathematics","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; Dalhousie University; University of Manitoba","funders":"","keywords":"Uniqueness; Generalization; Euclidean geometry; Simplicity; Plane (geometry); Euclidean distance; Line (geometry); Computer science; Mathematics; Geometry; Mathematical analysis; Artificial intelligence; Epistemology; Philosophy","score_opus":0.04000731839339008,"score_gpt":0.295922000394719,"score_spread":0.25591468200132894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486808366","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.35412192,0.0054961056,0.27313766,0.0047922754,0.0022632345,0.0001339536,0.00057734497,0.0002925422,0.35918495],"genre_scores_gemma":[0.88240594,0.0029676477,0.05276992,0.00095727394,0.00082400156,0.00018224405,0.00032770095,0.00018102354,0.059384275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988537,0.00021352588,0.0001007136,0.0003525547,0.00023610875,0.00024341671],"domain_scores_gemma":[0.9987734,0.000535686,0.00017066515,0.00018841145,0.0001680375,0.00016381637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011316113,0.0008607674,0.0017414627,0.0024537107,0.0019692595,0.0039777425,0.0013675262,0.0020797115,0.0095066],"category_scores_gemma":[0.0026957083,0.00085230224,0.0014092213,0.0017668239,0.005974505,0.007858959,0.0048609106,0.0047045886,0.0019999964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003503333,0.0000065652207,0.00008067935,0.000043035427,0.000006408772,0.000059999275,0.0001406123,0.00018975975,0.0007574109,0.9922814,0.0007031736,0.005695861],"study_design_scores_gemma":[0.000012371915,0.000021032194,0.00014888543,0.000026719592,0.000009026436,0.00030744573,0.00011926099,0.0008688972,0.00079275155,0.9909203,0.006760002,0.000013229074],"about_ca_topic_score_codex":0.0002949571,"about_ca_topic_score_gemma":0.00019804196,"teacher_disagreement_score":0.0095066,"about_ca_system_score_codex":0.001099175,"about_ca_system_score_gemma":0.0006935869,"threshold_uncertainty_score":0.031802773},"labels":[],"label_agreement":null},{"id":"W1486809640","doi":"10.1007/11589990_8","title":"Conditioning Graphs: Practical Structures for Inference in Bayesian Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Inference; Computer science; Bayesian network; Inference engine; Variable elimination; Frequentist inference; Bayesian inference; Theoretical computer science; Space (punctuation); Search engine indexing; Data mining; Machine learning; Bayesian probability; Artificial intelligence","score_opus":0.02941422679411561,"score_gpt":0.3016894240782781,"score_spread":0.2722751972841625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486809640","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.0005304401,0.00030979287,0.9963954,0.000392928,0.000042145388,0.000024388717,0.00016307012,0.00027792438,0.001863985],"genre_scores_gemma":[0.06639712,0.002230743,0.9225141,0.00065881613,0.00042897137,0.0004638809,0.0012110239,0.0007506354,0.005344766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579525,0.0026434287,0.00023591798,0.0005087971,0.00067340484,0.00014325793],"domain_scores_gemma":[0.97523445,0.02042223,0.0006976072,0.0023095882,0.0010127218,0.0003234015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061704856,0.0016875057,0.0017103977,0.002210895,0.0012879996,0.003861408,0.003195138,0.0028667059,0.015797457],"category_scores_gemma":[0.03997225,0.00218227,0.0018289741,0.0037430548,0.0031622716,0.008705658,0.0025880286,0.007158531,0.0035121592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033291417,0.00003185967,0.00024254541,0.00017836265,0.000035366113,0.000039118237,0.00018732417,0.024132203,0.0002736706,0.9008216,0.009531036,0.0644935],"study_design_scores_gemma":[0.000010033455,0.0000047514072,0.000040140825,0.000031650216,0.000013025059,0.000019264024,0.000012119567,0.044784583,0.00012421045,0.950685,0.0042666816,0.000008495215],"about_ca_topic_score_codex":0.0038811713,"about_ca_topic_score_gemma":0.0040834695,"teacher_disagreement_score":0.015797457,"about_ca_system_score_codex":0.0017009589,"about_ca_system_score_gemma":0.0018070018,"threshold_uncertainty_score":0.052847803},"labels":[],"label_agreement":null},{"id":"W1486877437","doi":"10.1007/3-540-44674-5_26","title":"The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parameterized complexity; Intersection (aeronautics); Finite-state machine; Transducer; Automaton; Composition (language); Computational complexity theory; Computer science; State (computer science); Finite state; Representation (politics); Algorithm; Time complexity; Theoretical computer science; Acoustics","score_opus":0.028241553057275538,"score_gpt":0.2603732987965553,"score_spread":0.23213174573927975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486877437","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.4965936,0.0023899097,0.4522214,0.00462143,0.00025061675,0.00022655202,0.0026325863,0.0010976365,0.039966296],"genre_scores_gemma":[0.92982876,0.0010509177,0.05754484,0.00020893189,0.00039455597,0.00033727955,0.0019198532,0.0004809938,0.008233867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991932,0.0020506226,0.00079375925,0.001612476,0.0027138204,0.0008974095],"domain_scores_gemma":[0.9359453,0.0514948,0.0026374809,0.0066086696,0.001993858,0.0013199601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035446014,0.0012308641,0.0026179971,0.0020139108,0.0029414557,0.013470145,0.0056395177,0.0030113626,0.01208192],"category_scores_gemma":[0.038147014,0.0022801515,0.0035625717,0.005403967,0.0060099876,0.05324748,0.004419322,0.0074869776,0.00096428714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054357026,0.00019109847,0.0029671744,0.00026688888,0.00013292146,0.00020192993,0.0010164696,0.06502543,0.0026515753,0.88793325,0.0035204545,0.03554928],"study_design_scores_gemma":[0.00003493922,0.000028034108,0.00059899216,0.000021153444,0.000045493172,0.00011370848,0.0001384016,0.081586316,0.001462751,0.91474235,0.0011897827,0.000038057395],"about_ca_topic_score_codex":0.0036314132,"about_ca_topic_score_gemma":0.0026399086,"teacher_disagreement_score":0.013470145,"about_ca_system_score_codex":0.0065706708,"about_ca_system_score_gemma":0.003342675,"threshold_uncertainty_score":0.04767376},"labels":[],"label_agreement":null},{"id":"W1486885927","doi":"10.1007/978-3-540-79499-8_16","title":"Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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 Alberta","funders":"","keywords":"Grayscale; Computer science; Pixel; Probabilistic logic; Visual cryptography; Shadow (psychology); Secret sharing; Artificial intelligence; Computer vision; Binary number; Scheme (mathematics); Image sharing; Image (mathematics); Algorithm; Mathematics; Cryptography; Arithmetic","score_opus":0.019074707458853493,"score_gpt":0.26806306377490957,"score_spread":0.2489883563160561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486885927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04474154,0.00044886282,0.94678414,0.000397094,0.00006541952,0.0001366407,0.00022449101,0.0003211055,0.0068807025],"genre_scores_gemma":[0.78662205,0.0004662781,0.20116854,0.00024241632,0.00009661553,0.0002382655,0.00024759935,0.000037857993,0.010880459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985501,0.00033859335,0.00007442677,0.0002509806,0.0006309441,0.00015498178],"domain_scores_gemma":[0.998281,0.00053135934,0.00022812617,0.0007067117,0.00017810457,0.00007472002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010168479,0.00044174914,0.00078863633,0.00047819328,0.0008782211,0.0009183725,0.0013666359,0.001121592,0.0031066623],"category_scores_gemma":[0.0032061825,0.00033200995,0.000562449,0.00086149113,0.00080400816,0.0022305981,0.0023564862,0.0008124448,0.00059431506],"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.0018649165,0.0002966823,0.0015356824,0.0007453497,0.00020558835,0.00052766514,0.0004272775,0.13668258,0.17116033,0.3382621,0.0068675675,0.34142426],"study_design_scores_gemma":[0.00017683585,0.000472898,0.0018262748,0.000070331116,0.00011550577,0.0015528748,0.00006133646,0.7487867,0.046971064,0.1895664,0.0102737965,0.00012602539],"about_ca_topic_score_codex":0.00050422974,"about_ca_topic_score_gemma":0.00093373546,"teacher_disagreement_score":0.0031066623,"about_ca_system_score_codex":0.0008460746,"about_ca_system_score_gemma":0.0012242228,"threshold_uncertainty_score":0.010392785},"labels":[],"label_agreement":null},{"id":"W1486953413","doi":"10.1007/978-3-642-10677-4_80","title":"A Mutual Information Based Face Recognition Method","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Computer science; Facial recognition system; Face (sociological concept); Mutual information; Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.021447901540436052,"score_gpt":0.26113659225987657,"score_spread":0.23968869071944052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486953413","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.0033757943,0.00033920657,0.9925297,0.000067241606,0.00007809266,0.000049309612,0.000065807275,0.0009765176,0.0025183929],"genre_scores_gemma":[0.08120939,0.0005235845,0.90047723,0.00019884741,0.00016383531,0.00018716791,0.0004839126,0.00028463887,0.016471429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988932,0.0001905927,0.000040763458,0.00022010852,0.0005816013,0.00007380091],"domain_scores_gemma":[0.9995105,0.00016641953,0.000028492916,0.00009892685,0.00017623547,0.000019371846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094667333,0.00075497275,0.0012086125,0.0013834356,0.00061462127,0.000774541,0.0017389364,0.0011510771,0.0062443297],"category_scores_gemma":[0.0012199478,0.0005394038,0.0011902977,0.0010111998,0.00044634216,0.0013353525,0.0013792542,0.0010876133,0.0040859194],"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.0001615916,0.00011852164,0.0004083348,0.0001175567,0.000115759416,0.00007338201,0.000059552276,0.015352769,0.047407918,0.010856225,0.0070350356,0.91829324],"study_design_scores_gemma":[0.000027282857,0.00014370127,0.0015442935,0.000022859662,0.00010745354,0.0008273843,0.000036922575,0.91729695,0.059098918,0.0067548784,0.014065385,0.00007402188],"about_ca_topic_score_codex":0.0015624304,"about_ca_topic_score_gemma":0.002006013,"teacher_disagreement_score":0.0062443297,"about_ca_system_score_codex":0.0004204195,"about_ca_system_score_gemma":0.000595278,"threshold_uncertainty_score":0.020889342},"labels":[],"label_agreement":null},{"id":"W1487163320","doi":"10.1007/978-3-540-72606-7_24","title":"Minimum Cost Configuration of Relay and Channel Infrastructure in Heterogeneous Wireless Mesh Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless mesh network; Relay; Computer network; Mesh networking; Wireless; Channel (broadcasting); Wireless network; Relay channel; Distributed computing; Telecommunications","score_opus":0.012702498888647143,"score_gpt":0.2352727536306178,"score_spread":0.22257025474197067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487163320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0828981,0.00059185055,0.90866685,0.00021668407,0.000060479353,0.000076873024,0.00012310263,0.00031506456,0.007051091],"genre_scores_gemma":[0.8517669,0.0003389886,0.14502694,0.000026905724,0.000040041534,0.00009940513,0.00014384103,0.00008580707,0.0024712365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.00020545106,0.000021273716,0.00007894953,0.00009767411,0.00006628794],"domain_scores_gemma":[0.99922407,0.00047936244,0.00007947756,0.00009177101,0.00007846978,0.000046884783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002414,0.00072853663,0.0010295248,0.00054237543,0.0004584313,0.000804092,0.0019561492,0.0008631969,0.0016766966],"category_scores_gemma":[0.002555233,0.00058202096,0.00031836386,0.0008509414,0.00047801354,0.0014949357,0.00089491747,0.00055407255,0.00023841324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020300977,0.00004664293,0.0003440732,0.00009441579,0.000027717637,0.00011511794,0.00005159501,0.9193562,0.006432267,0.01892498,0.0014817631,0.052922156],"study_design_scores_gemma":[0.000021940388,0.00007401097,0.00020453607,0.000009648547,0.000017091887,0.00007575352,0.000029547848,0.98172414,0.0017145793,0.01554962,0.00056808884,0.0000109957455],"about_ca_topic_score_codex":0.00084803347,"about_ca_topic_score_gemma":0.0012966229,"teacher_disagreement_score":0.0019561492,"about_ca_system_score_codex":0.0007867526,"about_ca_system_score_gemma":0.00045508269,"threshold_uncertainty_score":0.005708337},"labels":[],"label_agreement":null},{"id":"W1487177647","doi":"10.1007/978-3-642-13529-3_23","title":"Experienced Physicians and Automatic Generation of Decision Rules from Clinical Data","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"","keywords":"Computer science; Certainty; Clinical decision support system; Data quality; Decision support system; Data mining; Quality (philosophy); Artificial intelligence; Clinical decision making; Decision rule; Machine learning; Data science; Family medicine; Medicine; Operations management","score_opus":0.07289657544182045,"score_gpt":0.3425378673874523,"score_spread":0.26964129194563186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487177647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062466588,0.0013691382,0.9249815,0.0016036329,0.00019311682,0.00020179474,0.0007062545,0.002622748,0.005855154],"genre_scores_gemma":[0.3794857,0.00077383255,0.6117794,0.0005265391,0.00023928734,0.00012648068,0.0014134295,0.00019655487,0.005458708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986191,0.000534551,0.000115057126,0.00031578325,0.0003374993,0.00007793586],"domain_scores_gemma":[0.9914488,0.0070592295,0.00021833066,0.0004798502,0.00061692356,0.00017685948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033976827,0.00045437593,0.0004768655,0.0010497596,0.00029304603,0.0014463988,0.0010260572,0.0009286348,0.004245147],"category_scores_gemma":[0.014237816,0.00044175543,0.000490768,0.0008373345,0.0003250808,0.0012005857,0.0006719163,0.0008941239,0.001669595],"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.0006331509,0.00022553957,0.011214892,0.00020090997,0.000096575524,0.00091450394,0.00038579054,0.03471323,0.012499489,0.008431641,0.02058214,0.9101021],"study_design_scores_gemma":[0.0001566111,0.00020843529,0.0072257607,0.00008497997,0.00009234972,0.0014404024,0.00034033493,0.88561696,0.03068558,0.060446642,0.013659368,0.000042510514],"about_ca_topic_score_codex":0.0013798164,"about_ca_topic_score_gemma":0.0021135078,"teacher_disagreement_score":0.004245147,"about_ca_system_score_codex":0.00037318838,"about_ca_system_score_gemma":0.0007929398,"threshold_uncertainty_score":0.017968893},"labels":[],"label_agreement":null},{"id":"W1487232124","doi":"10.1007/978-3-540-73354-6_29","title":"Webcasting Made Interactive: Persistent Chat for Text Dialogue During and About Learning Events","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Toronto","funders":"","keywords":"Webcast; Asynchronous communication; Computer science; Event (particle physics); Class (philosophy); Multimedia; Field (mathematics); World Wide Web; Artificial intelligence; Telecommunications","score_opus":0.0499795761634817,"score_gpt":0.35984921600122677,"score_spread":0.30986963983774507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487232124","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.04350235,0.0018331931,0.850722,0.00053005625,0.0012795456,0.00059352134,0.0010495094,0.040627405,0.059862394],"genre_scores_gemma":[0.505675,0.0014598827,0.34605208,0.00046692262,0.0008517821,0.0017876761,0.0030379365,0.0063236677,0.13434511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994685,0.00017516674,0.000034172946,0.000119630735,0.00013813553,0.000064468884],"domain_scores_gemma":[0.9974648,0.0015374428,0.000084697735,0.0005113395,0.00017345978,0.00022828663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008732042,0.0009585986,0.00061043026,0.0006766784,0.0009045562,0.002433509,0.0018100473,0.0013389252,0.020420816],"category_scores_gemma":[0.0034143669,0.0003769191,0.00035429717,0.00057107204,0.00068264926,0.0028109364,0.0027802864,0.001313493,0.0057572704],"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.0018050212,0.0004113839,0.00076009816,0.001555126,0.00006850888,0.0006174396,0.008499834,0.0025368072,0.1062197,0.02900226,0.05284508,0.79567873],"study_design_scores_gemma":[0.0007676634,0.0014101096,0.007921167,0.0014180163,0.00046865724,0.002639192,0.0042035473,0.09493549,0.1543617,0.07600568,0.65553784,0.0003310318],"about_ca_topic_score_codex":0.0004577787,"about_ca_topic_score_gemma":0.0007391361,"teacher_disagreement_score":0.020420816,"about_ca_system_score_codex":0.00024167827,"about_ca_system_score_gemma":0.0004435437,"threshold_uncertainty_score":0.06831443},"labels":[],"label_agreement":null},{"id":"W1487276429","doi":"10.1007/978-3-540-74976-9_43","title":"A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Joins; Computer science; Inductive logic programming; Relational database; Artificial intelligence; Representation (politics); Feature (linguistics); Process (computing); Data mining; Statistical relational learning; Theoretical computer science; Machine learning; Pattern recognition (psychology); Programming language","score_opus":0.1350912368396089,"score_gpt":0.3465016342739291,"score_spread":0.2114103974343202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487276429","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.0014638423,0.00015242383,0.9965827,0.000059409427,0.00008157578,0.000052445284,0.000082563034,0.0012535531,0.0002714868],"genre_scores_gemma":[0.016465472,0.00010645566,0.98014075,0.000069530484,0.000085255706,0.00012953338,0.00039836543,0.00022600955,0.00237871],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99756384,0.00036104457,0.00018806808,0.00061531534,0.0011232538,0.00014844544],"domain_scores_gemma":[0.9974847,0.00080413243,0.000099782315,0.0006434887,0.00086719217,0.00010072483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025923513,0.0010858176,0.0019132849,0.003005343,0.0014721798,0.0025037646,0.0030928012,0.0015989832,0.0055261455],"category_scores_gemma":[0.0042825146,0.000807207,0.0023023973,0.0037716955,0.0007723284,0.0028122063,0.002390292,0.0027052243,0.0037880964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018833722,0.00017354773,0.0011634517,0.00015055916,0.00021197832,0.00012583326,0.00016082228,0.008176772,0.0111644715,0.014934935,0.012781839,0.95076746],"study_design_scores_gemma":[0.00009672773,0.00014439218,0.0024234017,0.000057476387,0.00022223215,0.000786352,0.00014228704,0.88540196,0.020331513,0.057582386,0.032677326,0.00013397413],"about_ca_topic_score_codex":0.00306433,"about_ca_topic_score_gemma":0.004180034,"teacher_disagreement_score":0.0055261455,"about_ca_system_score_codex":0.00067345425,"about_ca_system_score_gemma":0.0012798432,"threshold_uncertainty_score":0.018486857},"labels":[],"label_agreement":null},{"id":"W1487285776","doi":"10.1007/3-540-44983-3_16","title":"On Welch-Gong Transformation Sequence Generators","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Transformation (genetics); Linear span; Golomb coding; Boolean function; Sequence (biology); Mathematics; Randomness; Discrete mathematics; Correlation attack; Pseudorandom number generator; Pseudorandom binary sequence; Combinatorics; Algorithm; Computer science; Binary number; Arithmetic; Cryptography; Statistics","score_opus":0.020299438594315204,"score_gpt":0.23967961475022667,"score_spread":0.21938017615591146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487285776","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.062471043,0.0017346365,0.7194067,0.0012777545,0.0013571722,0.00020538969,0.00036799224,0.0011630139,0.21201631],"genre_scores_gemma":[0.5871859,0.0025774885,0.16751805,0.0011005278,0.0010050274,0.00047598325,0.0010309034,0.001643033,0.2374631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994653,0.00017244522,0.000027230779,0.00008306934,0.00017173328,0.00008024849],"domain_scores_gemma":[0.9995047,0.00022557672,0.000036245423,0.00010522004,0.000083520645,0.000044743083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201641,0.0012140053,0.0008311452,0.0019754865,0.0012206255,0.0013643722,0.000879833,0.0011743925,0.017160535],"category_scores_gemma":[0.001871792,0.00047118982,0.0008187597,0.0022178192,0.0017859559,0.0031041426,0.001980515,0.0023626261,0.005283912],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034037002,0.00001444177,0.00006159234,0.000023743267,0.000004098431,0.00006879271,0.00011802929,0.0012718999,0.001238005,0.9632758,0.002556737,0.031332776],"study_design_scores_gemma":[0.000009376748,0.000017341543,0.000046366753,0.0000113785145,0.0000038039932,0.00007660399,0.000021795979,0.004011281,0.0012860439,0.987058,0.007448451,0.000009630866],"about_ca_topic_score_codex":0.00042919477,"about_ca_topic_score_gemma":0.0005023264,"teacher_disagreement_score":0.017160535,"about_ca_system_score_codex":0.0006855005,"about_ca_system_score_gemma":0.00041026282,"threshold_uncertainty_score":0.057407737},"labels":[],"label_agreement":null},{"id":"W1487403982","doi":"10.1007/978-3-540-45078-8_1","title":"Multi-party Pseudo-Telepathy","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Computer science; Quantum nonlocality; Protocol (science); Quantum; Telepathy; Theoretical computer science; Simple (philosophy); Variety (cybernetics); Fraction (chemistry); Artificial intelligence; Quantum mechanics; Physics","score_opus":0.017187968307606147,"score_gpt":0.23882502327596913,"score_spread":0.221637054968363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487403982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07608764,0.0011729414,0.6011248,0.0020962125,0.0010767505,0.00023238354,0.00036504955,0.0009076371,0.3169366],"genre_scores_gemma":[0.7998282,0.0010078134,0.07401837,0.00066886924,0.00037061665,0.0002969778,0.00018835804,0.00019459886,0.12342624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994272,0.00013749214,0.000026961956,0.00010964704,0.00020785398,0.00009089634],"domain_scores_gemma":[0.9988833,0.00041033194,0.00007428578,0.0005129881,0.00007460854,0.00004442898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054463436,0.00045750645,0.000481081,0.00054003246,0.0011704882,0.0011185916,0.00077696604,0.0013361215,0.016599147],"category_scores_gemma":[0.0014928714,0.00028823523,0.0005293657,0.0007283606,0.0015405472,0.0028284034,0.0018063817,0.0018081667,0.002527733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008984191,0.000032740696,0.000112292764,0.00006982497,0.000011159845,0.0001314068,0.00007439141,0.0028388754,0.0046775984,0.9585831,0.0030381884,0.03034043],"study_design_scores_gemma":[0.000039594117,0.000087334345,0.00037522492,0.000043753025,0.000018222941,0.0007512683,0.000029918347,0.030967744,0.0113984635,0.92698693,0.029266005,0.000035559628],"about_ca_topic_score_codex":0.0000540489,"about_ca_topic_score_gemma":0.00008949976,"teacher_disagreement_score":0.016599147,"about_ca_system_score_codex":0.0005437777,"about_ca_system_score_gemma":0.00043518268,"threshold_uncertainty_score":0.055529654},"labels":[],"label_agreement":null},{"id":"W1487416157","doi":"10.1007/978-3-642-30950-2_58","title":"Item to Skills Mapping: Deriving a Conjunctive Q-matrix from Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":40,"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":"Computer science; Task (project management); Set (abstract data type); Test (biology); Artificial intelligence; Construct (python library)","score_opus":0.03737950644000729,"score_gpt":0.2740839948039204,"score_spread":0.23670448836391314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487416157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02299639,0.0001823168,0.9660121,0.00033356267,0.000073704876,0.00065559166,0.0033367148,0.0039028605,0.0025067497],"genre_scores_gemma":[0.15802605,0.000117533375,0.8341801,0.00012545858,0.00004776051,0.00063013256,0.005188732,0.0002543146,0.0014298771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967332,0.0011500436,0.0003452897,0.00071740896,0.0008839517,0.0001701735],"domain_scores_gemma":[0.97676086,0.0176369,0.00042065157,0.0015140453,0.0034214521,0.00024600668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021621,0.00088119594,0.00088306057,0.0030548149,0.0006843977,0.0019249538,0.0023670606,0.0011347503,0.010250004],"category_scores_gemma":[0.033298682,0.0006106281,0.0013852423,0.0034083638,0.00092016323,0.0030192568,0.0025899063,0.0013714031,0.0054169176],"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.0007008127,0.00046248018,0.0132791605,0.0012307732,0.00023979637,0.0008066398,0.0017760543,0.01723605,0.02043974,0.017830804,0.018474031,0.9075236],"study_design_scores_gemma":[0.00026748917,0.0006459299,0.01596662,0.00033764404,0.00035417572,0.001298923,0.0024292036,0.7601424,0.03256181,0.16012703,0.025689756,0.00017914089],"about_ca_topic_score_codex":0.007394245,"about_ca_topic_score_gemma":0.008843166,"teacher_disagreement_score":0.010250004,"about_ca_system_score_codex":0.0007779904,"about_ca_system_score_gemma":0.002199236,"threshold_uncertainty_score":0.034289658},"labels":[],"label_agreement":null},{"id":"W1487422852","doi":"10.1007/978-3-540-68891-4_10","title":"Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Cover (algebra); Vertex cover; Vertex (graph theory); Mathematics; Hierarchy; Relaxation (psychology); Graph; Semidefinite programming; Edge cover; Discrete mathematics; Mathematical optimization; Biology","score_opus":0.022295581302762667,"score_gpt":0.23279295565428937,"score_spread":0.2104973743515267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487422852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35258785,0.002130087,0.5423063,0.0063384008,0.000747208,0.000324361,0.0018613834,0.0021376591,0.091566764],"genre_scores_gemma":[0.935119,0.0008260548,0.044917487,0.0008499463,0.00045553825,0.00027663566,0.0008697446,0.0005772267,0.016108595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601495,0.0007691682,0.00018621389,0.0008230722,0.0011722404,0.0010343974],"domain_scores_gemma":[0.97933257,0.013340219,0.0012811337,0.003139372,0.0012606138,0.0016461476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00301964,0.0014615629,0.0033727763,0.0019596526,0.002290988,0.004852363,0.003412437,0.0028839891,0.013000376],"category_scores_gemma":[0.02537111,0.0012070357,0.0017320911,0.0022865357,0.003090748,0.0070674983,0.0082370285,0.0070327763,0.0015934494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009396071,0.00016236813,0.0012372494,0.00045924805,0.00012163316,0.00036532726,0.00043075203,0.115746826,0.0075995727,0.8234808,0.014730455,0.03472607],"study_design_scores_gemma":[0.00008594964,0.00009294338,0.0002944855,0.000064879125,0.000045862456,0.00018650516,0.00016283225,0.30965328,0.00200821,0.6834016,0.0039753253,0.000028176815],"about_ca_topic_score_codex":0.0019325174,"about_ca_topic_score_gemma":0.0017503526,"teacher_disagreement_score":0.013000376,"about_ca_system_score_codex":0.0025025608,"about_ca_system_score_gemma":0.00163892,"threshold_uncertainty_score":0.04349059},"labels":[],"label_agreement":null},{"id":"W1487460562","doi":"10.1007/978-3-642-15396-9_10","title":"Checking-Up on Branch-and-Check","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":45,"is_retracted":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":"Benders' decomposition; Computer science; Key (lock); Extension (predicate logic); Decomposition; Variation (astronomy); Generalization; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.027137863253000407,"score_gpt":0.2808368903337209,"score_spread":0.2536990270807205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487460562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03334329,0.0005570105,0.91374004,0.0014616296,0.0007084938,0.00044136445,0.0009956276,0.01840341,0.030349107],"genre_scores_gemma":[0.39972025,0.0005220492,0.54868543,0.002129523,0.0005050197,0.0005351369,0.0028415187,0.005381639,0.039679393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900918,0.0024183008,0.00062333536,0.0020182426,0.0029929674,0.0018553945],"domain_scores_gemma":[0.9693019,0.01473134,0.0006184365,0.012052754,0.0027592173,0.0005363251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061475765,0.0029717698,0.002737822,0.002561837,0.002764894,0.003996983,0.0047927895,0.0028125248,0.029091297],"category_scores_gemma":[0.025986802,0.0021961294,0.0048656925,0.0025949478,0.005473081,0.014932195,0.009753557,0.0063495445,0.008907485],"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.0020849262,0.00055163336,0.0041606985,0.0010517815,0.0003091638,0.00097610336,0.0007407258,0.049901262,0.017903766,0.4099636,0.042010497,0.47034577],"study_design_scores_gemma":[0.00022379997,0.00020758527,0.00059789116,0.00019446213,0.00033514755,0.00027611098,0.00013858193,0.14618401,0.024094982,0.80920535,0.018442146,0.000099933604],"about_ca_topic_score_codex":0.0043812385,"about_ca_topic_score_gemma":0.0072525293,"teacher_disagreement_score":0.029091297,"about_ca_system_score_codex":0.0017722144,"about_ca_system_score_gemma":0.0051666554,"threshold_uncertainty_score":0.09732008},"labels":[],"label_agreement":null},{"id":"W1487475979","doi":"10.1007/11908883_20","title":"Preface for CoSS 2006","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Manitoba","funders":"","keywords":"Computer science; Interoperability; Software engineering; Conceptual model; Service (business); Conceptual framework; Systems engineering; Knowledge management; Data science; World Wide Web; Engineering; Database; Sociology","score_opus":0.010867529215488544,"score_gpt":0.2341520591321961,"score_spread":0.22328452991670755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487475979","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010287083,0.0116936425,0.008482649,0.017752735,0.21086948,0.0004981347,0.007571221,0.0036655006,0.7384379],"genre_scores_gemma":[0.0020102211,0.0027109417,0.0013595592,0.001601882,0.014106461,0.00009806627,0.0035831935,0.0011865527,0.97334313],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939156,0.00007139835,0.00004276731,0.000109066,0.0003244445,0.000060740505],"domain_scores_gemma":[0.9965586,0.00026792797,0.0001271432,0.00023927177,0.0020254464,0.00078170915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013217353,0.0012911488,0.0010978819,0.0029760369,0.001359801,0.0042675943,0.0010410701,0.0011268577,0.5018071],"category_scores_gemma":[0.0038863628,0.00035102892,0.00061305484,0.0029672072,0.00032760802,0.0022919811,0.0014410987,0.0017598422,0.382281],"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.000022337197,0.00001785475,0.000027418502,0.000054505846,0.0000012822128,0.000010284086,0.0000061242986,0.000054646534,0.00007626296,0.0009998597,0.9709726,0.02775685],"study_design_scores_gemma":[0.0000064433093,0.000013959407,0.00014032265,0.0000579049,0.0000019651468,0.000014947962,0.000011470896,0.000070968286,0.00005817346,0.00066051225,0.9989598,0.0000036023935],"about_ca_topic_score_codex":0.0043473532,"about_ca_topic_score_gemma":0.008061252,"teacher_disagreement_score":0.5018071,"about_ca_system_score_codex":0.0020301975,"about_ca_system_score_gemma":0.0017880447,"threshold_uncertainty_score":0.7106117},"labels":[],"label_agreement":null},{"id":"W1487489356","doi":"10.1007/978-3-540-39653-6_24","title":"The Design of a Context-Aware Home Media Space for Balancing Privacy and Awareness","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Space (punctuation); Context (archaeology); Multimedia; Internet privacy; Function (biology); Control (management); Human–computer interaction; Computer security; Artificial intelligence","score_opus":0.0368126949614235,"score_gpt":0.2590835686184936,"score_spread":0.22227087365707007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487489356","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.034649383,0.0006518171,0.95709693,0.00031332113,0.00011398477,0.0002161418,0.00007097659,0.0019222731,0.004965187],"genre_scores_gemma":[0.54523504,0.00037656675,0.4480572,0.00019373794,0.000068504036,0.0003356562,0.00011284942,0.00013789255,0.0054825866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00012733047,0.00004225736,0.00012319586,0.00013580627,0.00009414808],"domain_scores_gemma":[0.99947804,0.00011891787,0.000046614543,0.00009440151,0.0001667765,0.00009522197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063255365,0.00058425247,0.0005859774,0.00040325432,0.0009321376,0.0020910567,0.0022832048,0.0010632864,0.0020288804],"category_scores_gemma":[0.0013426425,0.0005099047,0.0004233051,0.00038271234,0.00062868424,0.0022569043,0.0018937439,0.0007949568,0.0006382059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013525018,0.0007465407,0.004051696,0.0008080286,0.00026010067,0.0011663822,0.0034966227,0.07385238,0.25645646,0.11355503,0.017179888,0.52707434],"study_design_scores_gemma":[0.00015349033,0.0007638435,0.0021108475,0.00011137698,0.00035908536,0.002080149,0.0015009717,0.71866864,0.16423377,0.033063434,0.076774925,0.00017952044],"about_ca_topic_score_codex":0.0013148423,"about_ca_topic_score_gemma":0.0019610492,"teacher_disagreement_score":0.0022832048,"about_ca_system_score_codex":0.00042168802,"about_ca_system_score_gemma":0.0006531607,"threshold_uncertainty_score":0.0067873},"labels":[],"label_agreement":null},{"id":"W1487518246","doi":"10.1007/978-3-540-89765-1_2","title":"Semantic Science: Ontologies, Data and Probabilistic Theories","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Data science; Domain (mathematical analysis); Artificial intelligence; Mathematics","score_opus":0.0349937337360162,"score_gpt":0.2701180306959181,"score_spread":0.23512429695990192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487518246","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.0036082147,0.27184355,0.5085483,0.020254876,0.0047638835,0.000103543476,0.001086929,0.00094126747,0.18884942],"genre_scores_gemma":[0.22469191,0.27730143,0.32746077,0.011699836,0.015254734,0.0007999158,0.004985227,0.0011575108,0.13664883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875903,0.0003826232,0.00010780985,0.00016744417,0.00053696823,0.000046195157],"domain_scores_gemma":[0.99858546,0.00098428,0.00006594243,0.00015758417,0.00015732681,0.00004934764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016937281,0.001200161,0.0017213853,0.0035207223,0.0010428608,0.007166964,0.0015483806,0.0027204095,0.008618408],"category_scores_gemma":[0.0046277978,0.0009515954,0.0007203614,0.0077635655,0.0055463733,0.0156128835,0.002324539,0.003898206,0.0034684895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008815166,0.000015032431,0.00008650971,0.00037851528,0.000017462171,0.00004335056,0.00026914806,0.0007961106,0.00018142734,0.9222588,0.029327745,0.046617128],"study_design_scores_gemma":[0.0000029110536,0.0000027168858,0.0000529685,0.00012204156,0.000005983762,0.00009163576,0.000064161846,0.0010585651,0.00008407728,0.9084414,0.09006654,0.000007020884],"about_ca_topic_score_codex":0.0013633182,"about_ca_topic_score_gemma":0.0012426646,"teacher_disagreement_score":0.008618408,"about_ca_system_score_codex":0.0019102669,"about_ca_system_score_gemma":0.0018258404,"threshold_uncertainty_score":0.028831482},"labels":[],"label_agreement":null},{"id":"W1487521718","doi":"10.1007/978-3-642-19173-2_7","title":"A Folksonomy-Based Recommendation System for the Sensor Web","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Folksonomy; Computer science; Terabyte; Tag system; Geospatial analysis; Key (lock); Information retrieval; World Wide Web; Sensor web; Web resource; Data mining","score_opus":0.03169044304548255,"score_gpt":0.24056679311994608,"score_spread":0.20887635007446353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487521718","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.075131156,0.0040001804,0.5997271,0.0013847207,0.0006650586,0.0011911355,0.03953624,0.26023003,0.018134393],"genre_scores_gemma":[0.1805713,0.0024476266,0.7029472,0.0010459442,0.00026353376,0.000638069,0.06462841,0.0035699855,0.04388789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995042,0.000043296295,0.00006669139,0.00014065628,0.00020802586,0.00003703823],"domain_scores_gemma":[0.9987704,0.00025174706,0.00006727909,0.00033022894,0.0004090317,0.00017138736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087977434,0.0008095117,0.0015675885,0.003670775,0.0010286082,0.0016247613,0.0017809294,0.0012426901,0.010739093],"category_scores_gemma":[0.0023308664,0.00058860687,0.000781918,0.0037177538,0.0001457626,0.0030516637,0.0010256628,0.0008225529,0.010194364],"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.0014555266,0.0006876135,0.006758919,0.0006976836,0.00042965743,0.0006256489,0.00022533671,0.0039838376,0.04493252,0.0023307565,0.1840622,0.75381035],"study_design_scores_gemma":[0.00050254434,0.00059871754,0.026296515,0.00026514294,0.00077865366,0.0030793543,0.000535045,0.66216063,0.095054425,0.015521479,0.19469504,0.0005124476],"about_ca_topic_score_codex":0.010560085,"about_ca_topic_score_gemma":0.024364095,"teacher_disagreement_score":0.010739093,"about_ca_system_score_codex":0.0005183993,"about_ca_system_score_gemma":0.00071474933,"threshold_uncertainty_score":0.035925806},"labels":[],"label_agreement":null},{"id":"W1487530975","doi":"10.1007/3-540-48196-6_9","title":"Change Propagation in an Axiomatic Model of Schema Evolution for Objectbase Management Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Calgary; University of Manitoba","funders":"","keywords":"Computer science; Schema (genetic algorithms); Axiom; Schema evolution; Database schema; Semi-structured model; Conceptual schema; Theoretical computer science; Axiomatic system; Information retrieval; Mathematics; Database design","score_opus":0.041651206676096626,"score_gpt":0.2685586333325518,"score_spread":0.2269074266564552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487530975","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.016441332,0.00030053704,0.9668893,0.0018688972,0.00010305544,0.00009593409,0.00022594245,0.00074355403,0.013331482],"genre_scores_gemma":[0.35509452,0.0005312112,0.6303076,0.0010435429,0.00024393408,0.00032133833,0.00083562045,0.0004312446,0.011190938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950094,0.0019532503,0.0004866482,0.00067648076,0.0015064083,0.00036771694],"domain_scores_gemma":[0.992393,0.00374077,0.00034938456,0.0021648377,0.0011409852,0.00021095325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056533217,0.00058955146,0.00066536583,0.0015937482,0.0021188224,0.0048377295,0.003976628,0.0031819693,0.0044883657],"category_scores_gemma":[0.013186437,0.0015150424,0.002001059,0.0022665672,0.005002965,0.013294965,0.0043028044,0.005526245,0.0009746082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037329617,0.000036586094,0.00038022286,0.000053669508,0.000018915562,0.00016729238,0.00052386324,0.013563742,0.0006371938,0.9722837,0.0014177848,0.010879775],"study_design_scores_gemma":[0.000035361685,0.000024624313,0.00013260222,0.000026658361,0.00004589043,0.00021591593,0.0000943195,0.10642518,0.0010656432,0.883398,0.008507388,0.000028453174],"about_ca_topic_score_codex":0.0067482237,"about_ca_topic_score_gemma":0.0061189584,"teacher_disagreement_score":0.0067482237,"about_ca_system_score_codex":0.002251138,"about_ca_system_score_gemma":0.0018710071,"threshold_uncertainty_score":0.029897988},"labels":[],"label_agreement":null},{"id":"W1487545695","doi":"10.1007/978-3-642-20728-0_10","title":"Unconditionally Secure Signature Schemes Revisited","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Computer science; Digital signature; Signature (topology); Scheme (mathematics); Computer security; Context (archaeology); Theoretical computer science; Resolution (logic); Sign (mathematics); Formal description; Algorithm; Programming language; Mathematics","score_opus":0.014172668106645593,"score_gpt":0.23066639085473495,"score_spread":0.21649372274808937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487545695","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.037330847,0.011252798,0.62209,0.022651138,0.0033759538,0.00016493938,0.00037919037,0.001044885,0.3017103],"genre_scores_gemma":[0.7144545,0.0070975893,0.097437344,0.002332606,0.0028937552,0.00025963734,0.00034774045,0.0003883667,0.17478849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594754,0.0011197764,0.00023456482,0.00056278025,0.0016843004,0.0004510881],"domain_scores_gemma":[0.9955382,0.0018439281,0.0002209536,0.0017912276,0.00045982376,0.00014575341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030147976,0.0010303756,0.0010370733,0.0011854628,0.0024644695,0.005652139,0.0023859867,0.0028726372,0.009509442],"category_scores_gemma":[0.006442667,0.0009977939,0.00083178544,0.002644734,0.006863713,0.017045317,0.0057923384,0.012594932,0.0050223363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012531658,0.000007227827,0.000011997795,0.00002085267,0.0000022094287,0.000018275969,0.00009655722,0.00028889772,0.00034856822,0.9898986,0.00138683,0.007907407],"study_design_scores_gemma":[0.00000924266,0.000014131232,0.000023573906,0.000018841742,0.0000062196427,0.00010202782,0.00003173305,0.0016149282,0.0010205464,0.97696984,0.020177206,0.000011706737],"about_ca_topic_score_codex":0.00036089012,"about_ca_topic_score_gemma":0.000261278,"teacher_disagreement_score":0.009509442,"about_ca_system_score_codex":0.003045658,"about_ca_system_score_gemma":0.0021166801,"threshold_uncertainty_score":0.03181225},"labels":[],"label_agreement":null},{"id":"W1487605616","doi":"10.1007/978-3-540-75538-8_4","title":"An Open Boundary Safety-of-Territory Solver for the Game of Go","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Boundary (topology); Problem solver; Computer science; Open source; Boundary value problem; Work (physics); Computational science; Mathematics; Engineering; Mechanical engineering; Operating system; Mathematical analysis; Programming language; Software","score_opus":0.05311775392573026,"score_gpt":0.32901471366295393,"score_spread":0.27589695973722367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487605616","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.024077546,0.00015707989,0.9053919,0.001028914,0.0002507746,0.000421449,0.00045921566,0.0016257552,0.066587344],"genre_scores_gemma":[0.32699257,0.00019199251,0.64500165,0.0005555289,0.00010199068,0.0005582483,0.00082697696,0.00069359975,0.025077458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.0001784834,0.000038236107,0.00014169404,0.00018359405,0.00015787242],"domain_scores_gemma":[0.9986437,0.0010450653,0.00003838609,0.00009162923,0.00008752775,0.00009375734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010096946,0.0011952667,0.0014490831,0.00058518763,0.0012547115,0.0021162904,0.0029055537,0.0026710783,0.024337493],"category_scores_gemma":[0.004771625,0.00052188744,0.001501193,0.0005920951,0.0017827029,0.002501473,0.004732235,0.00311857,0.0020048565],"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.0004335369,0.0003756014,0.0007628022,0.00047334348,0.00010075315,0.00042620316,0.00065713277,0.2515399,0.0026215592,0.62140816,0.019443525,0.10175756],"study_design_scores_gemma":[0.0002136598,0.00006147988,0.00006284762,0.000046480174,0.000032690725,0.000052778247,0.00014734773,0.6529426,0.0008312949,0.3390949,0.006497218,0.00001668108],"about_ca_topic_score_codex":0.0052398206,"about_ca_topic_score_gemma":0.011847827,"teacher_disagreement_score":0.024337493,"about_ca_system_score_codex":0.00091386633,"about_ca_system_score_gemma":0.0020500526,"threshold_uncertainty_score":0.081417024},"labels":[],"label_agreement":null},{"id":"W1487696592","doi":"10.1007/978-3-540-25982-4_10","title":"Reusability Constructs in the Web Service Offerings Language (WSOL)","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Reusability; Computer science; Web service; World Wide Web; Software engineering; Service (business); Constraint (computer-aided design); WS-Policy; Service-oriented architecture; Adaptation (eye); Web development; Programming language; Web application security; Engineering; Business","score_opus":0.00964476251855999,"score_gpt":0.22954032411560715,"score_spread":0.21989556159704715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487696592","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.014709271,0.0005472294,0.96796745,0.0008140071,0.00012018881,0.00008458266,0.00016885722,0.004558306,0.011030187],"genre_scores_gemma":[0.22640201,0.0016869227,0.7352383,0.00073833443,0.00019450171,0.00044055452,0.0014617209,0.0057907873,0.02804693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985328,0.00033452918,0.00023562784,0.00012954052,0.0005997747,0.00016776935],"domain_scores_gemma":[0.9980191,0.0010197238,0.00021035175,0.00036006904,0.0003172121,0.000073618496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025835875,0.0010420857,0.00051777513,0.0015643471,0.0009175241,0.0037766637,0.0015866983,0.0013187006,0.0030803648],"category_scores_gemma":[0.0040071444,0.001450787,0.0012833391,0.002044238,0.0031181579,0.0065654065,0.002294187,0.0032103963,0.0016932527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006824255,0.000093022805,0.000627669,0.0002828033,0.000024512112,0.00034350427,0.0020757173,0.0049432716,0.009371149,0.88336366,0.0052566007,0.09354982],"study_design_scores_gemma":[0.00008201751,0.0000900958,0.0005225419,0.00048678467,0.00015114,0.00087094173,0.0004769264,0.057757147,0.032100864,0.656221,0.25111672,0.00012382196],"about_ca_topic_score_codex":0.0029713432,"about_ca_topic_score_gemma":0.0027907635,"teacher_disagreement_score":0.0037766637,"about_ca_system_score_codex":0.001028012,"about_ca_system_score_gemma":0.0016520362,"threshold_uncertainty_score":0.01366353},"labels":[],"label_agreement":null},{"id":"W1487729220","doi":"10.1007/978-3-642-02498-6_32","title":"Persistence Diagrams of Cortical Surface Data","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":125,"is_retracted":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":"Persistent homology; Computer science; SIGNAL (programming language); Parametric statistics; Algorithm; Noise (video); Noise reduction; Multivariate statistics; Topological data analysis; Theoretical computer science; Pattern recognition (psychology); Artificial intelligence; Image (mathematics); Mathematics; Machine learning; Statistics","score_opus":0.04356025399614919,"score_gpt":0.28110907417702113,"score_spread":0.23754882018087195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487729220","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.69949394,0.0007026064,0.26611638,0.0013233764,0.00010981161,0.000068901376,0.0010250036,0.0016637394,0.029496176],"genre_scores_gemma":[0.97972083,0.0003372423,0.013086216,0.00007051456,0.00006876728,0.00004402029,0.00043370796,0.00040380232,0.0058348286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996685,0.00004408436,0.000019225046,0.00006362749,0.00012775592,0.00007688853],"domain_scores_gemma":[0.9967135,0.0012064092,0.00049707456,0.000382604,0.0006611453,0.00053922314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051915116,0.00030390435,0.00047559355,0.0040419647,0.00085781765,0.0035966241,0.0007240867,0.0009640832,0.01065876],"category_scores_gemma":[0.00535579,0.00036963122,0.0003007333,0.0016690951,0.0010631274,0.0041741095,0.001314928,0.00095199404,0.0009938495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000915099,0.000027892605,0.0017437094,0.000063411484,0.000008676456,0.0002464987,0.00036179373,0.004142167,0.0053573647,0.9621891,0.0023773026,0.02339054],"study_design_scores_gemma":[0.000021934242,0.000025833764,0.0013207652,0.00002266403,0.000011156089,0.00037704033,0.0002326696,0.05672427,0.0022807634,0.9337746,0.005187487,0.000020835265],"about_ca_topic_score_codex":0.0013999075,"about_ca_topic_score_gemma":0.0011352239,"teacher_disagreement_score":0.01065876,"about_ca_system_score_codex":0.0008065727,"about_ca_system_score_gemma":0.0004883973,"threshold_uncertainty_score":0.035657167},"labels":[],"label_agreement":null},{"id":"W1487758308","doi":"10.1007/978-3-540-87442-3_113","title":"Application of Fuzzy Classification in Bankruptcy Prediction","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Financial Distress and Bankruptcy Prediction","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":"York University","funders":"","keywords":"Computer science; Data mining; Bankruptcy; Class (philosophy); Artificial intelligence; Cluster analysis; Subspace topology; Pattern recognition (psychology); Fuzzy classification; Feature (linguistics); Fuzzy logic; Fuzzy set; Feature selection; Machine learning; Finance","score_opus":0.01701052189843106,"score_gpt":0.2158239816813673,"score_spread":0.19881345978293624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487758308","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.16045499,0.0041564987,0.82002544,0.0005585896,0.0007590253,0.00013052693,0.00053395214,0.0012312838,0.012149641],"genre_scores_gemma":[0.76933795,0.00090741576,0.22510643,0.00011169262,0.00018832777,0.000057478206,0.0003029208,0.000038635513,0.0039491993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952996,0.000104155915,0.000046909696,0.000085151325,0.00019508424,0.000038703103],"domain_scores_gemma":[0.9984958,0.0008423462,0.000052498883,0.00010328985,0.00047528243,0.000030819647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012549859,0.0004277668,0.0007303224,0.0014747222,0.0004922532,0.0010203647,0.00075235096,0.0008451894,0.0021901983],"category_scores_gemma":[0.003473066,0.00021401301,0.00062475394,0.0013569231,0.00023408113,0.000684383,0.00030151618,0.00049694435,0.00055996625],"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.00039883069,0.0002056677,0.0067917802,0.00016707658,0.00011606724,0.00015517772,0.00011087092,0.09450928,0.009821616,0.0046157707,0.0041658194,0.87894195],"study_design_scores_gemma":[0.000013555683,0.000067779714,0.0026622838,0.000027384383,0.000058114114,0.00009491597,0.00003801068,0.9856044,0.004774421,0.004945705,0.0016955106,0.00001799344],"about_ca_topic_score_codex":0.0070971907,"about_ca_topic_score_gemma":0.00486518,"teacher_disagreement_score":0.0070971907,"about_ca_system_score_codex":0.00047048522,"about_ca_system_score_gemma":0.00046343554,"threshold_uncertainty_score":0.014111757},"labels":[],"label_agreement":null},{"id":"W1487846941","doi":"10.1007/11560548_37","title":"FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Victoria","funders":"","keywords":"Computer science; Field-programmable gate array; Equivalence (formal languages); Binary decision diagram; Binary number; Programming language; Parallel computing; Theoretical computer science; Arithmetic; Embedded system; Discrete mathematics; Mathematics","score_opus":0.044088136335701904,"score_gpt":0.3049015647059294,"score_spread":0.2608134283702275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487846941","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.11463347,0.0039786315,0.79756916,0.00048726084,0.00076034956,0.0002433433,0.00083927735,0.014006427,0.06748213],"genre_scores_gemma":[0.59960306,0.00084138993,0.37431467,0.00033860077,0.00008993675,0.00019519638,0.0011129504,0.0003093403,0.02319488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.00006236659,0.00001757638,0.000038268034,0.00009825312,0.000042079908],"domain_scores_gemma":[0.9994867,0.00026276518,0.00003442662,0.00009175652,0.00009866163,0.000025661202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995652,0.0005051401,0.00039451188,0.00070159347,0.00031532295,0.00082809455,0.0012504094,0.00048083617,0.027209489],"category_scores_gemma":[0.00089727266,0.0003737582,0.00030900107,0.00088905654,0.00015132796,0.0008373588,0.00044394808,0.00073789497,0.0035090533],"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.0026984157,0.0003766345,0.0027874054,0.0008442974,0.0002190884,0.0006028641,0.00017871158,0.06853591,0.11947063,0.057471026,0.039077125,0.70773786],"study_design_scores_gemma":[0.00038266418,0.0011557337,0.0026144132,0.00018455922,0.0001764097,0.0008618255,0.00011830774,0.7569372,0.14708172,0.024881648,0.065533035,0.00007252299],"about_ca_topic_score_codex":0.000790917,"about_ca_topic_score_gemma":0.002218202,"teacher_disagreement_score":0.027209489,"about_ca_system_score_codex":0.0005139256,"about_ca_system_score_gemma":0.00054208934,"threshold_uncertainty_score":0.091024816},"labels":[],"label_agreement":null},{"id":"W1487896116","doi":"10.1007/978-3-540-24606-0_2","title":"Matrix Pencil for Positioning in Wireless ad hoc Sensor Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"University of Toronto","funders":"","keywords":"Matrix pencil; Multipath propagation; Computer science; Pencil (optics); Wireless ad hoc network; Wireless sensor network; Triangulation; Wireless; Algorithm; Matrix (chemical analysis); Real-time computing; Engineering; Computer network; Mathematics; Telecommunications","score_opus":0.009817287662731804,"score_gpt":0.22320485790104852,"score_spread":0.21338757023831673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487896116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011828083,0.0058941063,0.9678068,0.0004435493,0.0030369167,0.00006053654,0.0003134124,0.0017560885,0.019505732],"genre_scores_gemma":[0.079575464,0.015531778,0.7283224,0.0009783409,0.002805058,0.00052549614,0.001328957,0.0010250197,0.16990753],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995022,0.00016265658,0.0000312085,0.00008179525,0.00020115098,0.000021014192],"domain_scores_gemma":[0.999589,0.00016135952,0.000026504811,0.00009048136,0.00011498637,0.000017700537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003013369,0.0016988484,0.0007828328,0.0006070553,0.00030826783,0.0011281531,0.0011021203,0.0009206649,0.023639046],"category_scores_gemma":[0.0016351069,0.00027178097,0.00034601055,0.0016852451,0.00055556913,0.0012026357,0.0005557095,0.0010641002,0.012757884],"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.00014469508,0.00004175692,0.00015308359,0.00090118847,0.000039130893,0.00036927694,0.00015333842,0.040479846,0.014393609,0.16541286,0.10625457,0.6716567],"study_design_scores_gemma":[0.000040499966,0.0003549146,0.00033250518,0.00026122524,0.000044632467,0.0015352218,0.00014097575,0.26979923,0.016367232,0.08971189,0.6213322,0.000079550795],"about_ca_topic_score_codex":0.0006727127,"about_ca_topic_score_gemma":0.0009548768,"teacher_disagreement_score":0.023639046,"about_ca_system_score_codex":0.00038693866,"about_ca_system_score_gemma":0.00026175895,"threshold_uncertainty_score":0.07908052},"labels":[],"label_agreement":null},{"id":"W1487916660","doi":"10.1007/978-3-540-74796-3_43","title":"DeskJockey: Exploiting Passive Surfaces to Display Peripheral Information","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Dalhousie University","funders":"","keywords":"Affordance; Desk; Information display; Computer science; Human–computer interaction; Physical space; Metaphor; Space (punctuation); Information space; Computer graphics (images); Geography; World Wide Web; Cartography","score_opus":0.017950819511701886,"score_gpt":0.2650084856133897,"score_spread":0.2470576661016878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487916660","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.050011568,0.004124143,0.83007395,0.0005588043,0.00088313466,0.00006492517,0.0004793534,0.015011292,0.09879289],"genre_scores_gemma":[0.36626056,0.0039918823,0.26622826,0.00036462402,0.00012370739,0.000103737824,0.00091297267,0.0025921306,0.35942212],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998666,0.000008925942,0.0000046156297,0.000023906887,0.000077145065,0.000018778765],"domain_scores_gemma":[0.9999012,0.0000333476,0.000006031163,0.000019709958,0.000027361799,0.000012246877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010871513,0.00071584585,0.00033159336,0.00038183626,0.0003700663,0.0010685831,0.0010086587,0.0006979154,0.019461647],"category_scores_gemma":[0.00037278087,0.00038166193,0.00027350098,0.00035944046,0.00039705413,0.001636116,0.0012627442,0.0007360623,0.0044321846],"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.00049903576,0.000069989735,0.00024998042,0.00045725127,0.000021784943,0.00037863615,0.0006206548,0.0026433065,0.4149927,0.03650313,0.029858314,0.51370525],"study_design_scores_gemma":[0.000087658394,0.00031056034,0.0016107187,0.00009703418,0.00007454727,0.0022547112,0.00032339268,0.05784953,0.46845815,0.023074904,0.44575992,0.00009877275],"about_ca_topic_score_codex":0.0006617006,"about_ca_topic_score_gemma":0.0009102212,"teacher_disagreement_score":0.019461647,"about_ca_system_score_codex":0.00018192669,"about_ca_system_score_gemma":0.00014879704,"threshold_uncertainty_score":0.065105736},"labels":[],"label_agreement":null},{"id":"W1487924811","doi":"10.1007/978-3-642-17796-5_2","title":"Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Université Laval","funders":"","keywords":"Computer science; Programming language; Compiler; Kleene algebra; Recursion (computer science); Interprocedural optimization; Optimizing compiler; Compiler correctness; Loop optimization; Discrete mathematics; Mathematics","score_opus":0.030731747286968376,"score_gpt":0.25763600422045385,"score_spread":0.22690425693348548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487924811","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.113333546,0.00027226546,0.86214733,0.00041675149,0.00021320932,0.00017699931,0.00040742333,0.010783512,0.012248991],"genre_scores_gemma":[0.8799948,0.0001717319,0.11439389,0.00013738881,0.00006763297,0.00009957049,0.0004951861,0.0010862997,0.0035534473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9946806,0.001180196,0.00034817145,0.0007360846,0.0021344426,0.0009205244],"domain_scores_gemma":[0.9900057,0.00486455,0.000683734,0.0031148533,0.0011857536,0.00014551639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030785159,0.0011050592,0.0013841235,0.0012153317,0.0014743247,0.00308378,0.0027739333,0.0016144663,0.007303732],"category_scores_gemma":[0.009563422,0.0011669775,0.003358945,0.00093777326,0.0034339484,0.0066127297,0.0028677816,0.0026780383,0.0014144784],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015814503,0.00040398716,0.0033184697,0.00077249244,0.0003235027,0.00089773245,0.0005310253,0.22031897,0.09520302,0.5539327,0.005303734,0.11741282],"study_design_scores_gemma":[0.00013764267,0.00018988928,0.00069875317,0.00006997617,0.00012377206,0.000163477,0.00013582595,0.6011054,0.12917432,0.26413152,0.0039750645,0.00009433618],"about_ca_topic_score_codex":0.003033728,"about_ca_topic_score_gemma":0.003808597,"teacher_disagreement_score":0.007303732,"about_ca_system_score_codex":0.0016438398,"about_ca_system_score_gemma":0.0032473167,"threshold_uncertainty_score":0.024433434},"labels":[],"label_agreement":null},{"id":"W1487986263","doi":"10.1007/978-3-540-74742-0_34","title":"Parallel Computation of Closed Itemsets and Implication Rule Bases","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scalability; Computation; Redundancy (engineering); Partition (number theory); Basis (linear algebra); Divide and conquer algorithms; Theoretical computer science; Parallel computing; Algorithm; Mathematics","score_opus":0.0281965311141697,"score_gpt":0.27509593305118607,"score_spread":0.24689940193701637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487986263","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.039258447,0.0005941157,0.9472533,0.0002435511,0.00016596707,0.0002130342,0.000524689,0.0032202213,0.008526767],"genre_scores_gemma":[0.18378884,0.000369307,0.80787295,0.00012586974,0.00008179619,0.00023205939,0.0015399031,0.00026847573,0.005720713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984963,0.0002627808,0.00017701696,0.00036646507,0.0005656299,0.00013181104],"domain_scores_gemma":[0.99710006,0.0015802024,0.00009181615,0.00069441734,0.00045794388,0.00007555587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015231523,0.0008117054,0.0017347835,0.0016412906,0.0009870793,0.0033114136,0.0020153585,0.0007663662,0.012585969],"category_scores_gemma":[0.0069681136,0.0009756809,0.0020570161,0.0029939446,0.0008053132,0.0040310454,0.002132912,0.0013083334,0.0022941718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070491846,0.0002710943,0.0014627,0.0005434297,0.00031049087,0.0003721061,0.00035659352,0.09567564,0.006498403,0.06339735,0.008489004,0.82191837],"study_design_scores_gemma":[0.000111411086,0.000106954954,0.00069922075,0.000066243796,0.00021069047,0.00020521675,0.00020134407,0.654336,0.009215448,0.3261303,0.008686066,0.00003106843],"about_ca_topic_score_codex":0.0034012948,"about_ca_topic_score_gemma":0.006601278,"teacher_disagreement_score":0.012585969,"about_ca_system_score_codex":0.0010208446,"about_ca_system_score_gemma":0.0015736747,"threshold_uncertainty_score":0.042104244},"labels":[],"label_agreement":null},{"id":"W1488026446","doi":"10.1007/11814948_31","title":"Characterizing Propagation Methods for Boolean Satisfiability","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Belief propagation; Satisfiability; Equivalence (formal languages); Local consistency; Convergence (economics); Theoretical computer science; Algorithm; Mathematical optimization; Maximization; Boolean satisfiability problem; Constraint satisfaction problem; Mathematics; Discrete mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.026466820804997796,"score_gpt":0.3191663136039671,"score_spread":0.2926994927989693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488026446","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.010319746,0.0006499799,0.9806294,0.000535401,0.00008569236,0.00017221906,0.00021525208,0.00093290146,0.006459407],"genre_scores_gemma":[0.2026831,0.0016022589,0.7798618,0.00044770128,0.00041219342,0.00061326305,0.0014453533,0.0015235748,0.011410701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99082446,0.0022201615,0.0007743558,0.0011734151,0.004428879,0.0005787427],"domain_scores_gemma":[0.9511798,0.038238917,0.0017113978,0.0045879707,0.0038735578,0.00040832628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071695973,0.0014980629,0.0010139279,0.003730276,0.0013978187,0.00493911,0.004357338,0.0026636906,0.0067854705],"category_scores_gemma":[0.0428046,0.001788702,0.0024518732,0.004864746,0.0030690576,0.011793449,0.0034006273,0.005698148,0.0016911976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019151549,0.0002586849,0.0020616204,0.00088542607,0.00013027804,0.00012509458,0.00095122895,0.032716855,0.008745896,0.6330213,0.010284227,0.31062794],"study_design_scores_gemma":[0.000033412474,0.00004761877,0.0002574659,0.00013906977,0.00007111007,0.0002031489,0.00013156868,0.16513415,0.007453224,0.8193866,0.007100425,0.000042159576],"about_ca_topic_score_codex":0.0016571364,"about_ca_topic_score_gemma":0.002432206,"teacher_disagreement_score":0.0071695973,"about_ca_system_score_codex":0.0022315958,"about_ca_system_score_gemma":0.0024803423,"threshold_uncertainty_score":0.03791696},"labels":[],"label_agreement":null},{"id":"W148802851","doi":"10.1007/978-3-642-33515-0_41","title":"A Mobile Robotic Platform for Generating Radiation Maps","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; University Network of Excellence in Nuclear Engineering","keywords":"Computer science; Mobile robot; Artificial intelligence; Computer vision; Simultaneous localization and mapping; Range (aeronautics); Robot; Human–computer interaction; Engineering","score_opus":0.015827838740658358,"score_gpt":0.22072896130065844,"score_spread":0.2049011225600001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148802851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008551919,0.000214846,0.97324955,0.00005642009,0.0001364578,0.00010473035,0.0002884179,0.007995149,0.009402578],"genre_scores_gemma":[0.16407089,0.00033325146,0.8081229,0.00008748579,0.000064815446,0.00026771956,0.0012284518,0.0010344513,0.024790088],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988294,0.000009638414,0.000002938883,0.000024923109,0.000069272,0.000010243105],"domain_scores_gemma":[0.999915,0.000020827825,0.0000060630978,0.00002465102,0.000023302644,0.0000101289415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012624636,0.00071863394,0.00040664928,0.00041980835,0.00030396954,0.0005046011,0.0012192363,0.00068046415,0.013429569],"category_scores_gemma":[0.00029328783,0.0004718488,0.0004292492,0.00036294264,0.00019714443,0.0005196299,0.0009870911,0.00049471075,0.0041383775],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003620541,0.000113517475,0.0005658879,0.0003361382,0.000085894324,0.00068244693,0.00023116833,0.06080739,0.28502977,0.012431868,0.025619343,0.6137345],"study_design_scores_gemma":[0.00015568589,0.0004915633,0.0019238004,0.00009945517,0.000097106735,0.0014682137,0.00011583293,0.57906955,0.1931874,0.013990484,0.20927918,0.00012177637],"about_ca_topic_score_codex":0.0005655702,"about_ca_topic_score_gemma":0.0009845912,"teacher_disagreement_score":0.013429569,"about_ca_system_score_codex":0.00017651138,"about_ca_system_score_gemma":0.00026457742,"threshold_uncertainty_score":0.044926405},"labels":[],"label_agreement":null},{"id":"W1488040414","doi":"10.1007/978-3-642-13059-5_20","title":"The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Ant colony optimization algorithms; Visibility; Computer science; Path (computing); Solver; Mathematical optimization; Algorithm; Integer programming; Search algorithm; Object (grammar); Motion planning; Artificial intelligence; Mathematics; Robot","score_opus":0.02427545259411336,"score_gpt":0.29298416388863086,"score_spread":0.2687087112945175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488040414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043392167,0.001142317,0.97807366,0.0002535783,0.00020930757,0.000059556587,0.000100248115,0.0007352893,0.015086876],"genre_scores_gemma":[0.11083743,0.0018830036,0.85980105,0.00012787242,0.00015955209,0.00015497285,0.00033247357,0.0006402707,0.026063278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.0000562381,0.000010902586,0.000051204886,0.00018157119,0.000030672676],"domain_scores_gemma":[0.99974483,0.00011363996,0.000022709271,0.000030419042,0.00006520786,0.00002319165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339805,0.0008932269,0.0010547824,0.0006265545,0.0005179205,0.0012670634,0.0014766298,0.0013949203,0.005887785],"category_scores_gemma":[0.0014941442,0.00037417677,0.00062523165,0.0013223252,0.000644506,0.0018230737,0.0011296468,0.0015260682,0.0015857181],"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.00015824451,0.000097277734,0.00028867446,0.0002994177,0.00006509701,0.00012235374,0.000095119496,0.39917988,0.0064738216,0.08917618,0.025727423,0.47831652],"study_design_scores_gemma":[0.000047446272,0.000058021393,0.00013451156,0.000028748185,0.000021238942,0.00015803061,0.000022254402,0.9243533,0.0023803883,0.042322382,0.030450843,0.000022828823],"about_ca_topic_score_codex":0.0026034527,"about_ca_topic_score_gemma":0.003266111,"teacher_disagreement_score":0.005887785,"about_ca_system_score_codex":0.00044792367,"about_ca_system_score_gemma":0.0012287345,"threshold_uncertainty_score":0.019696593},"labels":[],"label_agreement":null},{"id":"W1488042380","doi":"10.1007/978-3-642-13437-1_2","title":"Subliminally Enhancing Self-esteem: Impact on Learner Performance and Affective State","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Computer science; Subliminal stimuli; Priming (agriculture); Pulse (music); Skin conductance; Self-esteem; Artificial intelligence; Cognitive psychology; Psychology; Developmental psychology; Engineering","score_opus":0.013586213089363617,"score_gpt":0.2803402992622288,"score_spread":0.26675408617286517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488042380","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.99772865,0.0002550738,0.00026869492,0.000051670228,0.000033571287,0.000011934841,0.000028795424,0.000038162583,0.0015835942],"genre_scores_gemma":[0.99385166,0.00053645024,0.000921312,0.00004944371,0.000038190818,0.00003419924,0.00006742574,0.00002439969,0.0044770106],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998859,0.000028519904,0.000007524926,0.000023732997,0.000029402108,0.000024926037],"domain_scores_gemma":[0.9995858,0.00014731413,0.00004335735,0.000023582359,0.000026875889,0.00017305238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032815256,0.00023905878,0.0004135447,0.00011734691,0.00013165853,0.0005378008,0.00024932236,0.00026422046,0.0071138027],"category_scores_gemma":[0.00089050294,0.000064520915,0.00025269072,0.00011831544,0.00019206664,0.00029739313,0.0004295523,0.0005542627,0.00096949283],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.042671558,0.05658087,0.020157477,0.0007097426,0.0003954293,0.00024811024,0.000852199,0.00092207704,0.3100044,0.0007170098,0.0022665698,0.5644746],"study_design_scores_gemma":[0.0052718986,0.20188466,0.40336338,0.0001944289,0.0014094649,0.0009209958,0.0013747901,0.0048012123,0.36887366,0.0022726264,0.009524683,0.00010819327],"about_ca_topic_score_codex":0.00013523008,"about_ca_topic_score_gemma":0.00016316603,"teacher_disagreement_score":0.0071138027,"about_ca_system_score_codex":0.000070151305,"about_ca_system_score_gemma":0.0002066066,"threshold_uncertainty_score":0.023798108},"labels":[],"label_agreement":null},{"id":"W1488068123","doi":"10.1007/3-540-36577-x_21","title":"A New Knowledge Representation Strategy for Cryptographic Protocol Analysis","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Computer science; Cryptographic protocol; Representation (politics); Protocol (science); Cryptography; Theoretical computer science; Atomicity; Knowledge representation and reasoning; Task (project management); Term (time); Cryptographic primitive; Programming language; Artificial intelligence; Computer security","score_opus":0.040610501123979424,"score_gpt":0.35329239073117125,"score_spread":0.31268188960719184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488068123","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.0013747774,0.000117080905,0.9923735,0.000349065,0.00006395047,0.00006400092,0.000087691136,0.00061863987,0.0049512666],"genre_scores_gemma":[0.1583259,0.0006328893,0.81575,0.00088016497,0.0004165781,0.00041088188,0.0010156466,0.00062259904,0.021945281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504626,0.0013742687,0.00041910465,0.00094727817,0.0018217234,0.00039137603],"domain_scores_gemma":[0.99551976,0.0017817016,0.00018367912,0.0016993319,0.0006738159,0.00014158689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032661015,0.0013413401,0.0014411275,0.003280868,0.0017049058,0.0060629332,0.00410571,0.0023378858,0.009518744],"category_scores_gemma":[0.008901038,0.0009592121,0.0027591505,0.0031399154,0.0034366406,0.016429733,0.005820098,0.0047450466,0.0041596675],"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.00006600421,0.00008573612,0.00014868025,0.00011056124,0.00005238071,0.00012709717,0.00030814184,0.004613637,0.0028619594,0.8399355,0.006538847,0.14515156],"study_design_scores_gemma":[0.000016181642,0.000030733612,0.00006775102,0.000047103145,0.000066110035,0.0001900309,0.000092288596,0.09359227,0.0036678878,0.8902181,0.011978198,0.0000332135],"about_ca_topic_score_codex":0.0015055047,"about_ca_topic_score_gemma":0.0014023754,"teacher_disagreement_score":0.009518744,"about_ca_system_score_codex":0.0017802921,"about_ca_system_score_gemma":0.0016434947,"threshold_uncertainty_score":0.031843364},"labels":[],"label_agreement":null},{"id":"W148815022","doi":"10.1007/978-3-319-51966-1_8","title":"Towards Metric-Driven, Application-Specific Visualization of Attack Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Concordia University","funders":"","keywords":"Computer science; Visualization; Scalability; Situation awareness; Information visualization; Graph drawing; Graph; Metric (unit); Theoretical computer science; Vulnerability (computing); Network security; Data mining; Computer security","score_opus":0.02985442333875248,"score_gpt":0.3053683455029229,"score_spread":0.2755139221641704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148815022","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.0046268115,0.00025759733,0.9733949,0.00021738114,0.000056993962,0.00006457043,0.00094380917,0.018407034,0.0020307756],"genre_scores_gemma":[0.09360549,0.0008156251,0.8951286,0.000170696,0.00006179818,0.0001842732,0.003505547,0.0037577448,0.0027702563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993376,0.0001979917,0.00004297359,0.00009258575,0.0002809969,0.000047727466],"domain_scores_gemma":[0.9974015,0.00089270965,0.00020117128,0.00054723414,0.0007938872,0.00016354126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927634,0.002123458,0.00094374106,0.0031406302,0.00046883212,0.004537624,0.0020725194,0.0013133829,0.006529131],"category_scores_gemma":[0.0061417087,0.00086754526,0.0009168704,0.0027386658,0.0004684618,0.0024502745,0.002999883,0.002550427,0.0028281317],"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.00035770066,0.0002676503,0.004089642,0.0014419227,0.00023232315,0.0005389233,0.0018403152,0.18020655,0.08148338,0.063742734,0.089665726,0.57613313],"study_design_scores_gemma":[0.000019000106,0.000031621745,0.000829944,0.000085211956,0.000019264508,0.00024532585,0.0001602143,0.912275,0.019544642,0.037716378,0.029023683,0.000049639933],"about_ca_topic_score_codex":0.0022450811,"about_ca_topic_score_gemma":0.0038149632,"teacher_disagreement_score":0.006529131,"about_ca_system_score_codex":0.0005214817,"about_ca_system_score_gemma":0.0007417801,"threshold_uncertainty_score":0.021842062},"labels":[],"label_agreement":null},{"id":"W1488184357","doi":"10.1007/10719871_8","title":"Dynamical Recurrent Networks for Sequential Data Processing","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Symbol (formal); Preprocessor; Computer science; Construct (python library); Recurrent neural network; Identification (biology); Sequence (biology); Task (project management); Algorithm; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Engineering; Programming language","score_opus":0.04048973937762545,"score_gpt":0.29651291048291256,"score_spread":0.2560231711052871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488184357","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.0015235156,0.0015533249,0.99441445,0.0001301755,0.00018002326,0.000017569535,0.000108736764,0.00064633886,0.0014259324],"genre_scores_gemma":[0.19653983,0.0044435454,0.7731208,0.00026611492,0.0006578461,0.00032805197,0.0012384745,0.0006589147,0.022746447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997036,0.00007582993,0.000032659733,0.00008342198,0.000087453256,0.000017039092],"domain_scores_gemma":[0.99929667,0.00045147422,0.00004099208,0.00011121538,0.00008628352,0.000013379941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005618599,0.0007771864,0.000980535,0.00039028842,0.00017561608,0.0007952834,0.0009273267,0.0008867342,0.0070546274],"category_scores_gemma":[0.002540855,0.0004307936,0.00053460925,0.0007537758,0.00039508997,0.0013797632,0.0006730491,0.0012186911,0.0018141692],"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.00013758095,0.00006665542,0.00042552178,0.00056329486,0.0001496611,0.00018373487,0.00010844097,0.22303002,0.009233041,0.2198325,0.01812005,0.5281495],"study_design_scores_gemma":[0.000009630849,0.000018353096,0.00010463469,0.000015261288,0.000018230894,0.00003893748,0.000005256831,0.9329686,0.0011672437,0.05998784,0.005656231,0.000009745248],"about_ca_topic_score_codex":0.00143836,"about_ca_topic_score_gemma":0.0019477125,"teacher_disagreement_score":0.0070546274,"about_ca_system_score_codex":0.00037131394,"about_ca_system_score_gemma":0.00031467667,"threshold_uncertainty_score":0.023600101},"labels":[],"label_agreement":null},{"id":"W1488195763","doi":"10.1007/978-3-540-75703-0_17","title":"Semi-Latent Dirichlet Allocation: A Hierarchical Model for Human Action Recognition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":89,"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":"Latent Dirichlet allocation; Computer science; Artificial intelligence; Action recognition; Action (physics); Decoupling (probability); Frame (networking); Word (group theory); Dirichlet distribution; Set (abstract data type); Hidden Markov model; Representation (politics); Machine learning; Topic model; Pattern recognition (psychology); Class (philosophy); Mathematics","score_opus":0.09342114317276388,"score_gpt":0.3155883181162131,"score_spread":0.22216717494344917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488195763","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.002875115,0.00046755682,0.9947155,0.00018860148,0.000070273876,0.00006629652,0.00042308713,0.0008934152,0.000300112],"genre_scores_gemma":[0.2083182,0.0013667276,0.76965964,0.000681123,0.0005116665,0.0017504762,0.006631739,0.0012224133,0.009858056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940988,0.0035174869,0.00027686785,0.0012609207,0.0004575992,0.0003884683],"domain_scores_gemma":[0.9936307,0.0048208307,0.00020251164,0.0007438248,0.0004284388,0.00017368121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073021767,0.0018816154,0.0039163837,0.0019891388,0.001261768,0.002734274,0.006224861,0.0031123029,0.005156511],"category_scores_gemma":[0.01244071,0.0020233123,0.004240232,0.0033902358,0.001937896,0.0037517494,0.0038659517,0.0057630274,0.0036943427],"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.0015532138,0.000549164,0.0018927485,0.0004892179,0.0006467069,0.00017276454,0.0008740707,0.3865283,0.003966467,0.08375526,0.02605906,0.49351296],"study_design_scores_gemma":[0.000028905775,0.000022386812,0.00023893685,0.000021132273,0.000028088565,0.00002723185,0.00002227186,0.94870293,0.00057485234,0.04898676,0.0013208366,0.000025630747],"about_ca_topic_score_codex":0.013542516,"about_ca_topic_score_gemma":0.018637532,"teacher_disagreement_score":0.013542516,"about_ca_system_score_codex":0.0022310312,"about_ca_system_score_gemma":0.0023639323,"threshold_uncertainty_score":0.038618088},"labels":[],"label_agreement":null},{"id":"W1488218625","doi":"10.1007/978-3-642-40624-9_20","title":"Reconfiguration of Large-Scale Surveillance Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Control reconfiguration; Computer science; Scalability; Metis; Argumentation theory; Software deployment; Hazard; Information system; Distributed computing; Computer security; Software engineering; Database; Embedded system","score_opus":0.013508632732212447,"score_gpt":0.2302827232910457,"score_spread":0.21677409055883326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488218625","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27352118,0.0025802597,0.6814898,0.00084854953,0.0003045441,0.00012480206,0.0003170438,0.0047093495,0.0361044],"genre_scores_gemma":[0.979006,0.000507603,0.016126024,0.000054192515,0.00005919391,0.00004128517,0.00020271566,0.000108635504,0.0038943663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996921,0.00006820577,0.000019346266,0.00010076594,0.000056281977,0.00006336932],"domain_scores_gemma":[0.9994962,0.0001705652,0.000056370638,0.00014980235,0.000059224843,0.00006778968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031776982,0.00052141433,0.0005728621,0.0004432119,0.0004615506,0.0013604156,0.0009206583,0.00056301034,0.004394789],"category_scores_gemma":[0.0013330277,0.00032403524,0.0003397349,0.00047917478,0.0006127161,0.001637627,0.0010717446,0.000587096,0.0006258195],"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.00041172814,0.00011872017,0.0020648355,0.0002327277,0.000095503834,0.0005701979,0.00036530916,0.6898633,0.04152303,0.039848212,0.0065532625,0.21835315],"study_design_scores_gemma":[0.000029131726,0.00009810257,0.0016193696,0.00001983446,0.000026222218,0.00020372098,0.00013538814,0.9512184,0.005454664,0.033638585,0.0075350646,0.00002145805],"about_ca_topic_score_codex":0.001359882,"about_ca_topic_score_gemma":0.0011099047,"teacher_disagreement_score":0.004394789,"about_ca_system_score_codex":0.00060562557,"about_ca_system_score_gemma":0.0002595024,"threshold_uncertainty_score":0.014702082},"labels":[],"label_agreement":null},{"id":"W1488305958","doi":"10.1007/978-3-642-03770-2_31","title":"Process Arrival Pattern and Shared Memory Aware Alltoall on InfiniBand","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"","keywords":"InfiniBand; Computer science; Remote direct memory access; Process (computing); Benchmark (surveying); Parallel computing; Distributed computing; Operating system","score_opus":0.01668044754364808,"score_gpt":0.2597993563467144,"score_spread":0.24311890880306633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488305958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45503557,0.0016140786,0.51267344,0.00092566875,0.00060524914,0.00011721474,0.00026044017,0.0068675806,0.021900864],"genre_scores_gemma":[0.9475469,0.00024805975,0.042847805,0.00013075408,0.000057033936,0.000028640254,0.000118504904,0.00026909407,0.008753259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00006703741,0.000024160201,0.00009117164,0.00019384471,0.00015365252],"domain_scores_gemma":[0.9992685,0.00019746699,0.00005183572,0.00022823404,0.00019546894,0.00005858456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044871747,0.00089826284,0.00092485995,0.00034678282,0.0010248569,0.001366537,0.002247474,0.0004267679,0.0029313485],"category_scores_gemma":[0.0011391416,0.00044052774,0.0004947103,0.0006431739,0.00056257285,0.0012106708,0.0009604435,0.0011001738,0.0003403299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063919784,0.00070454803,0.008767306,0.00044100758,0.00026533077,0.0013594675,0.000597925,0.5097457,0.08032713,0.09161465,0.022884596,0.27690035],"study_design_scores_gemma":[0.0000820121,0.00017274493,0.0006749596,0.000011426364,0.00008255544,0.00022490342,0.000114635346,0.9543987,0.020905374,0.020906366,0.0023973493,0.000028921673],"about_ca_topic_score_codex":0.006229269,"about_ca_topic_score_gemma":0.010068358,"teacher_disagreement_score":0.006229269,"about_ca_system_score_codex":0.0011268433,"about_ca_system_score_gemma":0.0018093919,"threshold_uncertainty_score":0.012386024},"labels":[],"label_agreement":null},{"id":"W1488405589","doi":"10.1007/3-540-45105-6_80","title":"A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"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","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Genetic algorithm; Mathematical optimization; Diversification (marketing strategy); Key (lock); Routing (electronic design automation); Mathematics; Machine learning; Computer network","score_opus":0.01650154669074892,"score_gpt":0.23885929483689414,"score_spread":0.22235774814614523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488405589","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.01793873,0.00036999318,0.97334856,0.00017421418,0.00010621769,0.00005936288,0.000045148885,0.0005043834,0.0074533867],"genre_scores_gemma":[0.29052097,0.0003877998,0.69971436,0.00022770304,0.000098273755,0.00030165148,0.00019962774,0.0001680845,0.008381546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997098,0.00008407615,0.000008469724,0.000042092975,0.00012009552,0.000035455578],"domain_scores_gemma":[0.9996741,0.00018446743,0.00001798484,0.000024969571,0.00007987223,0.000018667168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005632811,0.0007150079,0.0008861016,0.0007314807,0.00041384067,0.0008636111,0.0016206523,0.0018103136,0.0036135763],"category_scores_gemma":[0.0011884136,0.00041280733,0.0005586439,0.0011223621,0.0005248287,0.000742929,0.0008718004,0.0009135285,0.00062920817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007271447,0.000078342266,0.00025753374,0.00004266111,0.0000408106,0.00005134833,0.00003859863,0.8618046,0.0020523102,0.011697883,0.0019984737,0.12186466],"study_design_scores_gemma":[0.000021811778,0.000022273924,0.00004024814,0.0000043161444,0.0000068140357,0.000012640229,0.00000423738,0.996806,0.00020043149,0.002122043,0.00075564394,0.0000035608516],"about_ca_topic_score_codex":0.004927002,"about_ca_topic_score_gemma":0.0043844655,"teacher_disagreement_score":0.004927002,"about_ca_system_score_codex":0.00063860323,"about_ca_system_score_gemma":0.0008473509,"threshold_uncertainty_score":0.012088597},"labels":[],"label_agreement":null},{"id":"W1488466953","doi":"10.1007/978-3-540-68125-0_51","title":"Tradeoff Analysis of Different Markov Blanket Local Learning Approaches","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Polytechnique Montréal","funders":"","keywords":"Markov blanket; Computer science; Markov chain; Bayesian network; Blanket; Feature selection; Markov model; Machine learning; Feature (linguistics); Artificial intelligence; Variable (mathematics); Data mining; Variable-order Markov model; Mathematics","score_opus":0.03773230528700003,"score_gpt":0.23427390653050628,"score_spread":0.19654160124350625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488466953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06871989,0.0041394075,0.91210103,0.0017703843,0.00011902392,0.00021795087,0.00029601288,0.0007514717,0.011884914],"genre_scores_gemma":[0.6828093,0.0018639115,0.29889563,0.0005759305,0.00029230386,0.0006520088,0.00068102556,0.0007831818,0.013446701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907652,0.006333583,0.00024571744,0.0006959448,0.001247812,0.00071171863],"domain_scores_gemma":[0.87394917,0.11677797,0.0012092503,0.0039781025,0.0027582683,0.0013273342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02544291,0.0013605795,0.0033179359,0.0024392293,0.0011674778,0.004146368,0.0066197845,0.004043295,0.013205158],"category_scores_gemma":[0.071899764,0.0015417653,0.0019396105,0.0031536224,0.0025886502,0.010713844,0.0048106886,0.0035268755,0.0012240006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031537653,0.0005240416,0.0012870589,0.00046389695,0.00026629644,0.0000737077,0.00033590567,0.7024337,0.00078375614,0.15161265,0.004895987,0.13416928],"study_design_scores_gemma":[0.0001149259,0.00018310803,0.0002817502,0.000039467628,0.000091640984,0.000030212093,0.000051692095,0.95032734,0.00043858006,0.047909167,0.00050330994,0.000028780836],"about_ca_topic_score_codex":0.0034969887,"about_ca_topic_score_gemma":0.003856611,"teacher_disagreement_score":0.02544291,"about_ca_system_score_codex":0.0046484377,"about_ca_system_score_gemma":0.002486996,"threshold_uncertainty_score":0.13455659},"labels":[],"label_agreement":null},{"id":"W1488504497","doi":"10.1007/978-3-642-13556-9_2","title":"Architectural Design Decisions for Achieving Reliable Software Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","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":"Queen's University","funders":"","keywords":"Computer science; Architectural pattern; Software system; Software construction; Software engineering; Software architecture; Software development; Software sizing; Reliability engineering; Software quality; Resource-oriented architecture; Verification and validation; Software; Engineering; Operating system","score_opus":0.04001206392220912,"score_gpt":0.2873187684320934,"score_spread":0.2473067045098843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488504497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05252391,0.0030738434,0.90321517,0.0026963823,0.00017971022,0.00011949826,0.00009247267,0.0011601895,0.03693886],"genre_scores_gemma":[0.42047048,0.0026592421,0.56870806,0.00022902653,0.00010851223,0.00013651379,0.00012853829,0.00034621276,0.0072133993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982951,0.0005686716,0.000114092174,0.00010269652,0.0007822584,0.00013715407],"domain_scores_gemma":[0.9979657,0.00085649133,0.00024039102,0.00031451124,0.00054565223,0.00007720112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021311713,0.0009420095,0.00025747268,0.0011182267,0.0006858625,0.0018824483,0.0010752344,0.0008529262,0.0035848233],"category_scores_gemma":[0.0064836238,0.0010065042,0.00037661023,0.00079485617,0.0007947512,0.0019140545,0.00088033866,0.0014889437,0.0009811401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014240055,0.000115240095,0.0022230244,0.00090742216,0.000098668555,0.00040119994,0.0013282377,0.14952786,0.05010497,0.37428913,0.012423488,0.40843838],"study_design_scores_gemma":[0.00008895783,0.00035530026,0.002105176,0.00060680835,0.00030190658,0.0005279992,0.0012255375,0.37100026,0.035821848,0.495167,0.09270307,0.00009611032],"about_ca_topic_score_codex":0.00072448875,"about_ca_topic_score_gemma":0.0036376521,"teacher_disagreement_score":0.0035848233,"about_ca_system_score_codex":0.0008921042,"about_ca_system_score_gemma":0.0015250238,"threshold_uncertainty_score":0.0119924545},"labels":[],"label_agreement":null},{"id":"W1488549087","doi":"10.1007/11738817_13","title":"Patterns for Modelling Agent Systems with Tropos","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Computer science; Software engineering","score_opus":0.028260547219991997,"score_gpt":0.2345145621232969,"score_spread":0.20625401490330492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488549087","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.0050861035,0.00019231602,0.9839954,0.00032583377,0.00012620995,0.00018817463,0.0004439981,0.0014844444,0.008157545],"genre_scores_gemma":[0.13706455,0.0007031985,0.8465608,0.00018789794,0.00008748922,0.001300794,0.0010919161,0.0008984109,0.012104994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988533,0.00039188552,0.000206776,0.00016146728,0.0002795223,0.00010700638],"domain_scores_gemma":[0.99843484,0.00064899185,0.00020620387,0.00044063633,0.00017338985,0.000095993615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014269088,0.0010702519,0.0008290021,0.0009519854,0.000931652,0.0024511127,0.0021927822,0.0014592849,0.009947016],"category_scores_gemma":[0.0045437817,0.001167614,0.0018079162,0.001487917,0.0016116435,0.0053190473,0.0027311407,0.0026954596,0.002520068],"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.00009105045,0.000032075,0.0006135801,0.00030224447,0.00004518928,0.00046847624,0.00090868375,0.042418424,0.0012923218,0.9068374,0.0049773557,0.042013057],"study_design_scores_gemma":[0.0000706937,0.00003820381,0.00011326671,0.00012295782,0.000053898715,0.0003956584,0.00027643883,0.19790936,0.0018240111,0.72754234,0.07161935,0.000033977518],"about_ca_topic_score_codex":0.003030381,"about_ca_topic_score_gemma":0.0032180592,"teacher_disagreement_score":0.009947016,"about_ca_system_score_codex":0.00069029676,"about_ca_system_score_gemma":0.0008954625,"threshold_uncertainty_score":0.03327602},"labels":[],"label_agreement":null},{"id":"W1488668295","doi":"10.1007/3-540-35828-5_3","title":"Requirements Engineering for Large-Scale Multi-agent Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Executable; Exploit; Software development; Software engineering; Domain (mathematical analysis); Requirements analysis; Requirements engineering; Knowledge management; Software; Systems engineering; Management science; Engineering; Computer security","score_opus":0.05563417189925629,"score_gpt":0.29676341834521425,"score_spread":0.24112924644595796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488668295","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.010264209,0.0008331598,0.9750734,0.001071801,0.000046833982,0.0004261669,0.0001226272,0.0006095289,0.011552235],"genre_scores_gemma":[0.21519573,0.0014862644,0.772969,0.00032895518,0.00008139487,0.0008926848,0.00068027584,0.00038302634,0.0079826955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955646,0.0021267133,0.00033268597,0.00029327505,0.001453879,0.00022893843],"domain_scores_gemma":[0.9929597,0.0052098157,0.00034491756,0.00063923927,0.00070619205,0.00014005657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036490038,0.0010916736,0.00089629134,0.000849903,0.0011557825,0.0026397954,0.0018926077,0.0015200959,0.0041608075],"category_scores_gemma":[0.011401504,0.0011910327,0.0013001888,0.0008058452,0.0016524404,0.002722809,0.0025804082,0.0022006377,0.0011955309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014517363,0.0002870477,0.0009314947,0.0018749963,0.00016029582,0.001594295,0.0024149523,0.3468182,0.022004023,0.34232742,0.009923862,0.2715183],"study_design_scores_gemma":[0.00010709671,0.00012615131,0.0005184574,0.00035869266,0.00007915697,0.0007997552,0.00073916116,0.5778769,0.010551666,0.34301165,0.06576225,0.000069044305],"about_ca_topic_score_codex":0.002957301,"about_ca_topic_score_gemma":0.003775559,"teacher_disagreement_score":0.0041608075,"about_ca_system_score_codex":0.001328815,"about_ca_system_score_gemma":0.0017968084,"threshold_uncertainty_score":0.019298017},"labels":[],"label_agreement":null},{"id":"W1488693076","doi":"10.1007/3-540-45581-7_14","title":"Modelling Strategic Actor Relationships to Support Intellectual Property Management","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Property (philosophy); Intellectual property; Knowledge management; Operations research; Epistemology; Engineering","score_opus":0.14619610848480036,"score_gpt":0.29398379696557386,"score_spread":0.1477876884807735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488693076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045634568,0.0002161017,0.9218046,0.00062707334,0.00006526655,0.00012985128,0.00026433007,0.00057314656,0.030685198],"genre_scores_gemma":[0.7093249,0.0004698874,0.27797368,0.00006669319,0.000031081217,0.00024366687,0.00055348576,0.00016671048,0.01116986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.00029409345,0.000032473505,0.000079904814,0.00008948369,0.000073256284],"domain_scores_gemma":[0.9970151,0.0023478996,0.00019102119,0.00020752444,0.00014857519,0.00008993888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335294,0.00050630764,0.0003431009,0.0008884049,0.0007403398,0.0024328656,0.0014908158,0.0013043514,0.01076137],"category_scores_gemma":[0.0063907914,0.0005478494,0.0008508405,0.0013200928,0.00097451033,0.003991025,0.001213307,0.0013916735,0.0011269109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006886319,0.00008437488,0.0011586399,0.000083124614,0.0000305864,0.00019337542,0.00041568454,0.56888837,0.00086191157,0.40211433,0.001531118,0.024569659],"study_design_scores_gemma":[0.00001706944,0.000013072924,0.00008094387,0.000015080071,0.00001787157,0.00002197442,0.00009122975,0.89575267,0.00039732727,0.098981656,0.0046055773,0.000005528292],"about_ca_topic_score_codex":0.0067559527,"about_ca_topic_score_gemma":0.009984211,"teacher_disagreement_score":0.01076137,"about_ca_system_score_codex":0.0011833193,"about_ca_system_score_gemma":0.0015531782,"threshold_uncertainty_score":0.03600043},"labels":[],"label_agreement":null},{"id":"W1488807031","doi":"10.1007/11941378_11","title":"On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Public-key cryptography; Ephemeral key; Key (lock); Key-agreement protocol; Discrete logarithm; Protocol (science); Computer security; Diffie–Hellman key exchange; Mathematical proof; Cryptographic protocol; Key exchange; Key management; Representation (politics); Theoretical computer science; Cryptography; Key distribution; Encryption; Mathematics; Law; Political science","score_opus":0.032046700323440654,"score_gpt":0.2681816712348219,"score_spread":0.23613497091138125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488807031","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.020345597,0.0152007295,0.8557558,0.0131423315,0.0022557976,0.00033957866,0.00015653874,0.00048059836,0.09232302],"genre_scores_gemma":[0.69511104,0.021701926,0.24260052,0.0035649242,0.004405981,0.0007012194,0.00033789544,0.000910587,0.030665996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9793011,0.009352824,0.0012013353,0.0018163917,0.0067857844,0.0015425435],"domain_scores_gemma":[0.86757225,0.10555259,0.0024711706,0.017832952,0.00580116,0.0007698881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026775625,0.001595821,0.00268689,0.0021639678,0.003962848,0.009592408,0.0050277817,0.0070503294,0.0072386074],"category_scores_gemma":[0.09322132,0.002233426,0.0016572129,0.003228824,0.016198145,0.053193476,0.009417717,0.018581636,0.0024367499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028503896,0.000049248036,0.00029283884,0.00018562809,0.000018792236,0.00020121818,0.00038521714,0.005626164,0.0011703355,0.9488465,0.0034992266,0.039439805],"study_design_scores_gemma":[0.00005143059,0.00006404927,0.00018271728,0.0002509257,0.000045909997,0.0003615681,0.00015440946,0.04842001,0.0025892071,0.9367035,0.011102972,0.00007315291],"about_ca_topic_score_codex":0.0019093562,"about_ca_topic_score_gemma":0.0013109142,"teacher_disagreement_score":0.026775625,"about_ca_system_score_codex":0.0037532237,"about_ca_system_score_gemma":0.0028470343,"threshold_uncertainty_score":0.14160472},"labels":[],"label_agreement":null},{"id":"W1488910567","doi":"10.1007/11833529_36","title":"A Self-tuning Reliable Dynamic Scheme for Multicast Flow Control","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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":"St. Francis Xavier University","funders":"","keywords":"Multicast; Computer science; Scalability; Distributed computing; Controller (irrigation); Network packet; Computer network; Source-specific multicast; Flow control (data); Pragmatic General Multicast; Scheme (mathematics); Mathematics; Operating system","score_opus":0.007307238211008931,"score_gpt":0.21806304263794699,"score_spread":0.21075580442693806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488910567","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.022529736,0.00038239177,0.97286665,0.00009993263,0.00012638018,0.00006782207,0.000036577352,0.0019527886,0.0019376852],"genre_scores_gemma":[0.70771766,0.00022376199,0.28691196,0.00012298129,0.00015356558,0.0001504993,0.00010045905,0.00019383019,0.004425334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994796,0.00009134831,0.000031022395,0.00009067011,0.0002477508,0.000059691716],"domain_scores_gemma":[0.9990914,0.00024290479,0.00006757147,0.00034366615,0.0002019342,0.000052686224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007785099,0.00039322436,0.00069455925,0.00070404826,0.000639914,0.00071425945,0.0017813627,0.00061626284,0.0018779356],"category_scores_gemma":[0.0018782152,0.00030134665,0.00023885987,0.0005229027,0.0005566242,0.0009282301,0.001275656,0.0011341842,0.00038732894],"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.0010077978,0.0002819973,0.00046227727,0.00016201942,0.00006676117,0.00017771224,0.00026714808,0.15696846,0.15587011,0.063555114,0.006127851,0.61505276],"study_design_scores_gemma":[0.00007541333,0.00016423225,0.00022175086,0.000012279698,0.00002683481,0.00015392684,0.000013317516,0.96592486,0.017082112,0.012304205,0.0039880225,0.000033130338],"about_ca_topic_score_codex":0.0005771434,"about_ca_topic_score_gemma":0.000743009,"teacher_disagreement_score":0.0018779356,"about_ca_system_score_codex":0.00059385644,"about_ca_system_score_gemma":0.0003779383,"threshold_uncertainty_score":0.0062823296},"labels":[],"label_agreement":null},{"id":"W1488912548","doi":"10.1007/978-3-642-16181-0_13","title":"A Simple Measure of the Dynamics of Segmented Genomes: An Application to Influenza","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Influenza Virus Research Studies","field":"Medicine","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 Ottawa; Ontario Genomics","funders":"","keywords":"Reassortment; Measure (data warehouse); Genome; Pandemic influenza; Pandemic; Simple (philosophy); Computer science; Population; Viral phylodynamics; Influenza pandemic; H1n1 pandemic; Biology; Data mining; Gene; Coronavirus disease 2019 (COVID-19); Genetics; Medicine; Phylogenetics; Disease","score_opus":0.03977822176277545,"score_gpt":0.33891431074305683,"score_spread":0.2991360889802814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488912548","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.035362028,0.0045467005,0.9488134,0.0009060475,0.00058668165,0.00008419433,0.000488583,0.00043178594,0.008780626],"genre_scores_gemma":[0.5447793,0.004969144,0.43143883,0.0007222561,0.0017216069,0.00032753966,0.0005835507,0.00034591026,0.015111838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.00015291499,0.0000348,0.0001264269,0.00016292502,0.000030176896],"domain_scores_gemma":[0.99716324,0.0019009315,0.00028626106,0.00018464045,0.00029097678,0.00017390185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017162478,0.0009786558,0.0013210527,0.002655655,0.000641801,0.0020865442,0.0013891927,0.0019701677,0.003558929],"category_scores_gemma":[0.00842449,0.00040774216,0.0010004968,0.0028333797,0.0015941239,0.002803072,0.001427512,0.0013335884,0.00060217845],"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.00018431216,0.00016322643,0.005666788,0.00067335047,0.00020750113,0.00031752198,0.00043770147,0.12535727,0.027475065,0.59182936,0.012389704,0.23529817],"study_design_scores_gemma":[0.000021173184,0.0001649593,0.0050406833,0.000051692252,0.000052542557,0.00047903846,0.00011365113,0.6951737,0.0025096396,0.28957915,0.006724751,0.000089003974],"about_ca_topic_score_codex":0.0016863068,"about_ca_topic_score_gemma":0.0013402904,"teacher_disagreement_score":0.003558929,"about_ca_system_score_codex":0.0010796331,"about_ca_system_score_gemma":0.0004598121,"threshold_uncertainty_score":0.011905849},"labels":[],"label_agreement":null},{"id":"W1489022499","doi":"10.1007/978-3-540-73545-8_6","title":"Seed-Based Exclusion Method for Non-coding RNA Gene Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"RNA; Preprocessor; Computer science; Nucleic acid secondary structure; Heuristics; Computational biology; Coding (social sciences); Search algorithm; Algorithm; Gene; Theoretical computer science; Genetics; Biology; Mathematics; Artificial intelligence","score_opus":0.029991241584807,"score_gpt":0.30636137907315264,"score_spread":0.27637013748834566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489022499","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.019049564,0.00023783778,0.9768248,0.0000929638,0.000066475746,0.00007827583,0.00021671533,0.0021593426,0.0012739563],"genre_scores_gemma":[0.21535398,0.00014111392,0.774485,0.00018652815,0.000098446435,0.000301632,0.0016988871,0.0007612761,0.006973166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905974,0.00026065393,0.0000623338,0.00015864543,0.00033350263,0.00012527082],"domain_scores_gemma":[0.9971027,0.0018247286,0.00008198976,0.00032260895,0.0005335013,0.0001345138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014765932,0.00060453877,0.0016233008,0.00154002,0.00084386126,0.00084977905,0.0023079892,0.0010283304,0.005282925],"category_scores_gemma":[0.0034860787,0.0003293002,0.00097164785,0.0013103436,0.00058234774,0.0010759255,0.0013333833,0.0010976399,0.0014727294],"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.002478392,0.00046762737,0.0035162691,0.00036474675,0.00019700514,0.0004898902,0.00018570425,0.09734751,0.050739873,0.038848955,0.018007733,0.78735626],"study_design_scores_gemma":[0.00011351371,0.00009180478,0.0005262373,0.000011139276,0.000035233083,0.00014503182,0.000023763516,0.9680415,0.009258957,0.01838494,0.003347748,0.000020167583],"about_ca_topic_score_codex":0.0025072263,"about_ca_topic_score_gemma":0.0042190985,"teacher_disagreement_score":0.005282925,"about_ca_system_score_codex":0.0004684734,"about_ca_system_score_gemma":0.0016565961,"threshold_uncertainty_score":0.017673194},"labels":[],"label_agreement":null},{"id":"W1489045083","doi":"10.1007/978-3-540-87875-9_47","title":"Towards a Formal Account of a Foundational Subset for Executable UML Models","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Queen's University","funders":"National Institute of Standards and Technology","keywords":"Computer science; Executable; Programming language; Unified Modeling Language; Applications of UML; UML tool; Semantics (computer science); Object Constraint Language; Software engineering; Software","score_opus":0.028042360551386352,"score_gpt":0.2516558444544903,"score_spread":0.22361348390310395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489045083","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.0048455736,0.00018373912,0.9858474,0.00060860976,0.000053839343,0.00010899531,0.00012812948,0.00072697987,0.0074968375],"genre_scores_gemma":[0.1648471,0.000445182,0.82641745,0.00037150443,0.00018874064,0.0005597152,0.0008998527,0.0006917755,0.005578684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958411,0.0012230709,0.000694923,0.0005157501,0.0013929177,0.0003322827],"domain_scores_gemma":[0.9940673,0.002750687,0.00043215486,0.0014946194,0.0010389388,0.00021624596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005987296,0.0009785971,0.0008690117,0.0021650873,0.0022027346,0.006454548,0.0031260964,0.002483213,0.0051820325],"category_scores_gemma":[0.009596989,0.0022584263,0.0021201265,0.0020614287,0.0054252064,0.010790144,0.0042861705,0.0062746997,0.0015610816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001643346,0.000033199758,0.0002011183,0.00009646827,0.000012675696,0.000161586,0.000654516,0.0029176758,0.0016199349,0.97650206,0.001436909,0.016347466],"study_design_scores_gemma":[0.00002229386,0.000035921203,0.00023659796,0.00016957469,0.000058812395,0.00031623914,0.00022814874,0.046921108,0.003701241,0.9122762,0.03600115,0.000032691813],"about_ca_topic_score_codex":0.0027430505,"about_ca_topic_score_gemma":0.0037100648,"teacher_disagreement_score":0.006454548,"about_ca_system_score_codex":0.0019908794,"about_ca_system_score_gemma":0.002725681,"threshold_uncertainty_score":0.031664252},"labels":[],"label_agreement":null},{"id":"W1489057821","doi":"10.1007/3-540-47922-8_5","title":"Transposition Table Driven Work Scheduling in Distributed Game-Tree Search","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Engineering; Operations management","score_opus":0.01700337401409503,"score_gpt":0.23242405791828966,"score_spread":0.21542068390419464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489057821","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.101908624,0.00033541396,0.88358533,0.0002813437,0.00012891558,0.00028534012,0.00024572207,0.0018884932,0.01134085],"genre_scores_gemma":[0.6523142,0.00013171954,0.34014314,0.00008284014,0.000032047006,0.00020696362,0.000290353,0.00023604902,0.006562601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993291,0.00023073082,0.000036138867,0.000091504386,0.00017955458,0.00013308974],"domain_scores_gemma":[0.9988489,0.0006921483,0.000051062052,0.00017757835,0.00012709253,0.00010323046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015019,0.00036191422,0.0011067879,0.00063565245,0.0008006937,0.0010655614,0.0022155643,0.0008181655,0.005625875],"category_scores_gemma":[0.0025487721,0.0004264749,0.00043019073,0.0015113436,0.00063521485,0.0013816087,0.0012133059,0.00075726554,0.000637749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007795632,0.00032037194,0.0008275182,0.00016344382,0.000048456488,0.00008921425,0.00019288975,0.75198627,0.0065799723,0.04588576,0.006407002,0.18671955],"study_design_scores_gemma":[0.000054904074,0.000063472944,0.00011612668,0.0000042983365,0.000009248387,0.000020646226,0.000037198348,0.9824249,0.0009326117,0.01553917,0.00079082645,0.000006625023],"about_ca_topic_score_codex":0.006572386,"about_ca_topic_score_gemma":0.009435135,"teacher_disagreement_score":0.006572386,"about_ca_system_score_codex":0.0009103466,"about_ca_system_score_gemma":0.0018268913,"threshold_uncertainty_score":0.018820405},"labels":[],"label_agreement":null},{"id":"W1489121383","doi":"10.1007/11840930_52","title":"Feature Conjunctions in Visual Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"Computer science; Visual search; Conjunction (astronomy); Feature (linguistics); Task (project management); Artificial intelligence; Object (grammar); Motion (physics); Pattern recognition (psychology); Information retrieval","score_opus":0.01842780742137592,"score_gpt":0.283624217303832,"score_spread":0.26519640988245613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489121383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22610864,0.047616713,0.6294927,0.0018421811,0.0007448698,0.00008087155,0.0005849668,0.0013187875,0.09221025],"genre_scores_gemma":[0.9238881,0.003302421,0.06253819,0.00009014289,0.00032858134,0.000052022002,0.000261291,0.00012741618,0.009411904],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997577,0.000052422103,0.000015821628,0.0000670276,0.00007530634,0.000031624324],"domain_scores_gemma":[0.9990607,0.0006806737,0.000070739756,0.000067580346,0.000078438694,0.00004184506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046558437,0.0003744549,0.00081536826,0.0013086188,0.0004831446,0.0016180504,0.0008072474,0.0009276497,0.0074127153],"category_scores_gemma":[0.0032239673,0.0005359039,0.00041363933,0.0022307117,0.00072663126,0.0047047404,0.0006770068,0.0007335865,0.0007322772],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006464361,0.00010344373,0.002670471,0.00054541905,0.00011258789,0.0005099016,0.00047017323,0.017781598,0.02369697,0.45497423,0.0141539425,0.4843348],"study_design_scores_gemma":[0.00006254086,0.00010283424,0.0059844865,0.00007044598,0.00006759778,0.0007374292,0.00014678227,0.18321459,0.0042014862,0.7968248,0.00853883,0.000048098438],"about_ca_topic_score_codex":0.0016502135,"about_ca_topic_score_gemma":0.0017884142,"teacher_disagreement_score":0.0074127153,"about_ca_system_score_codex":0.00064966694,"about_ca_system_score_gemma":0.00024601741,"threshold_uncertainty_score":0.024797976},"labels":[],"label_agreement":null},{"id":"W1489129300","doi":"10.1007/978-3-642-20520-0_29","title":"A Sonic Eco-System of Self-Organising Musical Agents","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"Simon Fraser University","funders":"","keywords":"Computer science; Gesture; Shoal; Population; Multi-agent system; Granulation; Musical; Artificial intelligence; Engineering","score_opus":0.020773580024259948,"score_gpt":0.22839110568666457,"score_spread":0.20761752566240463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489129300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044665005,0.0003648006,0.92448026,0.00028022856,0.00028859865,0.00027970524,0.00014628745,0.009332275,0.02016285],"genre_scores_gemma":[0.5172587,0.00034476852,0.43532184,0.00030036722,0.00016909157,0.00068864203,0.0005330992,0.0011645397,0.04421897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954957,0.00011410194,0.000044160242,0.00010997456,0.00012317729,0.000058957445],"domain_scores_gemma":[0.9994172,0.00014765777,0.00003011404,0.00014700303,0.000105505125,0.00015247257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007347546,0.00055824575,0.00067558367,0.00074857706,0.0011208085,0.0025784774,0.0018897221,0.0012523958,0.011006526],"category_scores_gemma":[0.0016627825,0.00054668565,0.0005566067,0.00055234757,0.0010170272,0.0017346347,0.003814737,0.0007852052,0.0033626293],"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.0019231236,0.0007512159,0.005666537,0.0008072101,0.00031166075,0.0016389095,0.004350423,0.057990056,0.3101572,0.16817722,0.016742535,0.43148398],"study_design_scores_gemma":[0.0005019959,0.0008524081,0.0030683838,0.0001512306,0.00030965795,0.00082306325,0.0010610352,0.6277605,0.06526466,0.11313905,0.18689784,0.00017007774],"about_ca_topic_score_codex":0.0010757139,"about_ca_topic_score_gemma":0.0012999976,"teacher_disagreement_score":0.011006526,"about_ca_system_score_codex":0.00036074064,"about_ca_system_score_gemma":0.00070198637,"threshold_uncertainty_score":0.03682053},"labels":[],"label_agreement":null},{"id":"W1489167807","doi":"10.1007/978-3-642-10841-9_28","title":"Computational Aspects of Multimarket Price Wars","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","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":"Stackelberg competition; Cournot competition; Multiplicative function; Oligopoly; Mathematical economics; Computer science; Mathematical optimization; Bertrand competition; Economics; Microeconomics; Mathematics","score_opus":0.01755232469663902,"score_gpt":0.21930021638291408,"score_spread":0.20174789168627505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489167807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2580119,0.0014771791,0.7019325,0.005098156,0.0002508917,0.00010938612,0.00070675695,0.0004930092,0.031920195],"genre_scores_gemma":[0.931187,0.0006249964,0.058911797,0.0002624616,0.00033731028,0.00010735776,0.00045313808,0.00010981934,0.008006113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825186,0.0008586027,0.00009296391,0.00032176758,0.00030318063,0.0001716223],"domain_scores_gemma":[0.9540748,0.040097237,0.002121686,0.0022315474,0.0006802811,0.00079451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036810806,0.00059444766,0.0017130304,0.0013895367,0.0012117358,0.0044996142,0.0032621813,0.0029223992,0.015183815],"category_scores_gemma":[0.039041746,0.0011499664,0.0012473506,0.002173761,0.002914619,0.010129724,0.0032784534,0.0035027578,0.0007387355],"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.0002080801,0.00012999892,0.002240077,0.000105691695,0.00007404566,0.0001548838,0.00019214409,0.22775578,0.00024757418,0.74410236,0.003227135,0.021562248],"study_design_scores_gemma":[0.000017562134,0.000009927396,0.00017599498,0.000007291081,0.000008559362,0.000039076196,0.000029904411,0.50473356,0.00009375591,0.49451345,0.0003626805,0.00000825738],"about_ca_topic_score_codex":0.0016995942,"about_ca_topic_score_gemma":0.0017234391,"teacher_disagreement_score":0.015183815,"about_ca_system_score_codex":0.0010457818,"about_ca_system_score_gemma":0.0010067353,"threshold_uncertainty_score":0.0507949},"labels":[],"label_agreement":null},{"id":"W1489199265","doi":"10.1007/11758532_30","title":"An Adaptive Fuzzy kNN Text Classifier","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Nipissing University","funders":"Beijing Jiaotong University","keywords":"Computer science; Categorization; Artificial intelligence; Text categorization; Feature selection; Classifier (UML); Selection (genetic algorithm); Machine learning; Dimension (graph theory); Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.023312524362474062,"score_gpt":0.2540993049945257,"score_spread":0.23078678063205166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489199265","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.028898334,0.0010841434,0.95944107,0.00023879149,0.0004947544,0.00020823792,0.0004770397,0.0039605596,0.0051971804],"genre_scores_gemma":[0.2173148,0.00064660487,0.7558836,0.00044026066,0.0003535152,0.00023363411,0.001280994,0.00019262366,0.023654006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993262,0.000055169185,0.000050041814,0.00017660689,0.0003411221,0.00005091505],"domain_scores_gemma":[0.99899,0.00022021992,0.00003296267,0.000113386,0.0006070687,0.00003625541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008151124,0.00051306223,0.0010963092,0.0015243625,0.00079506973,0.000999665,0.0020762794,0.0011302405,0.006027477],"category_scores_gemma":[0.0022146683,0.0003136984,0.0006267817,0.0014929575,0.0003218849,0.0015897191,0.00087708497,0.00083292986,0.0032895443],"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.0002491596,0.00011518734,0.00062808313,0.00008699956,0.000044767563,0.00007658612,0.000031775697,0.01674794,0.022188554,0.002299631,0.0072595673,0.9502718],"study_design_scores_gemma":[0.00003236382,0.000105726955,0.0010716204,0.00002594506,0.00007606045,0.00026505184,0.000030475481,0.9664505,0.017789543,0.0040589957,0.010062786,0.000030823452],"about_ca_topic_score_codex":0.007055005,"about_ca_topic_score_gemma":0.008867113,"teacher_disagreement_score":0.007055005,"about_ca_system_score_codex":0.0007150423,"about_ca_system_score_gemma":0.0008436016,"threshold_uncertainty_score":0.020163953},"labels":[],"label_agreement":null},{"id":"W1489221476","doi":"10.1007/978-3-540-74260-9_25","title":"Variable Homography Compensation of Parallax Along Mosaic Seams","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Queen's University","funders":"","keywords":"Parallax; Homography; Computer vision; Artificial intelligence; Computer science; Mathematics","score_opus":0.022059741978941897,"score_gpt":0.2759346869384272,"score_spread":0.2538749449594853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489221476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24242562,0.0006948725,0.747859,0.00010544348,0.00010743215,0.00004224234,0.00020194538,0.001431827,0.007131683],"genre_scores_gemma":[0.75413144,0.00034497105,0.23777866,0.000029165103,0.000030026693,0.000018904035,0.00035225606,0.00040525946,0.0069093183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997613,0.00002402836,0.0000074200025,0.000058232516,0.00011302608,0.00003605354],"domain_scores_gemma":[0.99971455,0.00004595356,0.000038422557,0.0001017113,0.00007886211,0.0000204602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022205464,0.00044376912,0.00039462658,0.0005240429,0.00028772373,0.00051541254,0.00056552736,0.00038334148,0.0036802657],"category_scores_gemma":[0.00077395444,0.0002851504,0.00027699088,0.00086182443,0.00029721824,0.0006583707,0.00047419933,0.00059914944,0.00062221574],"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.00081517943,0.00008144214,0.0026115733,0.00019780155,0.00006672945,0.0001566312,0.0003819157,0.060546722,0.3862874,0.012685096,0.002969312,0.5332002],"study_design_scores_gemma":[0.000075315285,0.0004332905,0.013505206,0.000057573845,0.000087227476,0.0008943984,0.00023497027,0.6868866,0.27383298,0.0072972854,0.016620569,0.000074580304],"about_ca_topic_score_codex":0.0017104408,"about_ca_topic_score_gemma":0.0026060455,"teacher_disagreement_score":0.0036802657,"about_ca_system_score_codex":0.00027835747,"about_ca_system_score_gemma":0.00042553255,"threshold_uncertainty_score":0.012311697},"labels":[],"label_agreement":null},{"id":"W1489237398","doi":"10.1007/978-3-540-30144-8_21","title":"Using Mediated Identity-Based Cryptography to Support Role-Based Access Control","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Revocation; Access control; Role-based access control; Computer security; Delegation; Cryptography; Identity (music); Scheme (mathematics); Authorization; Possession (linguistics); Identity management; Computer network; Distributed computing","score_opus":0.033086216297239145,"score_gpt":0.32707341139304097,"score_spread":0.29398719509580185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489237398","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.02268336,0.0006344719,0.94234645,0.0008380934,0.00045397316,0.00016773556,0.00004945871,0.0018787552,0.030947749],"genre_scores_gemma":[0.72198397,0.00062075024,0.24555522,0.00031570674,0.00032658235,0.00027218918,0.00015859147,0.00023842005,0.030528534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969537,0.0010687822,0.0001826134,0.00033192162,0.0010959719,0.0003669354],"domain_scores_gemma":[0.99312687,0.0024067315,0.00036461244,0.0031410477,0.0007072917,0.00025344276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026211503,0.0006415396,0.0006977179,0.0009213397,0.0014416518,0.005449699,0.0029323408,0.001782282,0.007999251],"category_scores_gemma":[0.011134874,0.0006045486,0.0007496379,0.0007784987,0.002375791,0.007995147,0.0043662777,0.0038112318,0.003006209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026478927,0.00023832248,0.0005232049,0.0001529141,0.000058271195,0.00037472014,0.0012066033,0.0075680222,0.019385051,0.8454148,0.0066190087,0.11819434],"study_design_scores_gemma":[0.00017010837,0.00032916167,0.0004485731,0.00015781276,0.00013443199,0.0010694171,0.00031044113,0.25460783,0.05902245,0.59979403,0.083802514,0.00015322454],"about_ca_topic_score_codex":0.00054758496,"about_ca_topic_score_gemma":0.000600139,"teacher_disagreement_score":0.007999251,"about_ca_system_score_codex":0.0010020039,"about_ca_system_score_gemma":0.0009546061,"threshold_uncertainty_score":0.026760101},"labels":[],"label_agreement":null},{"id":"W1489240819","doi":"10.1007/bfb0012855","title":"Canonical conditional rewrite systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":61,"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":"Decidability; Confluence; Rewriting; Expressive power; Lemma (botany); Computer science; Programming language; Function (biology); Property (philosophy); Theoretical computer science; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.021982804175104512,"score_gpt":0.2505037992026657,"score_spread":0.22852099502756118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489240819","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.023136465,0.0029913068,0.59870696,0.0016237457,0.0010104672,0.00014085782,0.0012984645,0.005512081,0.36557963],"genre_scores_gemma":[0.56491,0.0032318507,0.17706001,0.0010336858,0.00086850417,0.00022029177,0.0040408284,0.0020995594,0.24653532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986934,0.00027177317,0.000093160204,0.0003672521,0.0003955314,0.00017883287],"domain_scores_gemma":[0.9988053,0.00031580328,0.00004398648,0.0003818983,0.00038286104,0.000070204784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021711,0.000579377,0.0005420723,0.0010059586,0.0011089963,0.0033709446,0.0011014631,0.00076391915,0.025511172],"category_scores_gemma":[0.0029219296,0.000708393,0.0007135879,0.0010015215,0.0019907535,0.0049612187,0.0019155025,0.0026907723,0.009628763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019351764,0.000016990733,0.00009911774,0.000046947152,0.0000070881965,0.000033500364,0.00017406906,0.00041227948,0.0008210182,0.9610699,0.010051189,0.027248701],"study_design_scores_gemma":[0.000014772669,0.000011831418,0.00012062649,0.00003200689,0.000021077709,0.00012995653,0.00006282364,0.0042576194,0.0026456048,0.92668474,0.0660001,0.000018849374],"about_ca_topic_score_codex":0.0010007432,"about_ca_topic_score_gemma":0.0015385118,"teacher_disagreement_score":0.025511172,"about_ca_system_score_codex":0.0010280943,"about_ca_system_score_gemma":0.0009949403,"threshold_uncertainty_score":0.08534336},"labels":[],"label_agreement":null},{"id":"W1489254256","doi":"10.1007/978-3-540-74827-4_127","title":"Shadow Removal Method for Real-Time Extraction of Moving Objects","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer vision; Background subtraction; Artificial intelligence; RGB color model; Color space; Shadow (psychology); Computer graphics (images); Color image; Image processing; Image (mathematics); Pixel","score_opus":0.03639312889578386,"score_gpt":0.340562559295409,"score_spread":0.3041694303996252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489254256","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.017633656,0.0013006496,0.97675294,0.000061276776,0.00017487921,0.000044204502,0.00012934282,0.0017078847,0.0021951979],"genre_scores_gemma":[0.14743754,0.0023717822,0.82981825,0.00014902903,0.00014807998,0.00008397526,0.00096972316,0.00046231435,0.01855933],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997652,0.000012509039,0.000012053,0.000060233975,0.00011673977,0.000033152723],"domain_scores_gemma":[0.9997811,0.00004873811,0.000018185237,0.000040917133,0.00009659391,0.00001455739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026521183,0.00073928264,0.0007234142,0.001107128,0.0004001603,0.0005587251,0.00077804446,0.0006194323,0.0042168614],"category_scores_gemma":[0.00042066444,0.00046361558,0.00072493806,0.0010291713,0.00024944887,0.0006917294,0.0004971078,0.0006047431,0.0025748953],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001990228,0.000056595323,0.00039549885,0.00021220364,0.000048257778,0.0001514909,0.00009864585,0.002456711,0.31336713,0.001110767,0.0042948606,0.67760885],"study_design_scores_gemma":[0.000055639724,0.00021470437,0.009343016,0.00005540727,0.00024799036,0.0021308756,0.00011613856,0.27593815,0.667566,0.0021725204,0.042068228,0.000091375354],"about_ca_topic_score_codex":0.0016258988,"about_ca_topic_score_gemma":0.0031147418,"teacher_disagreement_score":0.0042168614,"about_ca_system_score_codex":0.0002190434,"about_ca_system_score_gemma":0.0006191016,"threshold_uncertainty_score":0.0141067505},"labels":[],"label_agreement":null},{"id":"W1489268948","doi":"10.1007/978-3-642-02868-7_30","title":"SOPRANO – An Ambient Assisted Living System for Supporting Older People at Home","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":61,"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":"Assisted living; Computer science; Home automation; Ambient intelligence; Independent living; Service (business); Process (computing); Human–computer interaction; Ubiquitous computing; Living lab; Multimedia; Telecommunications; Gerontology; Operating system; Business","score_opus":0.01681319868680302,"score_gpt":0.2785130163182038,"score_spread":0.26169981763140077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489268948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20480977,0.00907103,0.37255824,0.0016948963,0.0028367068,0.0011292048,0.0034632778,0.043062363,0.3613744],"genre_scores_gemma":[0.2842663,0.0062310146,0.15620154,0.0016146316,0.00048575044,0.00094588473,0.005031757,0.0020634443,0.54315966],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998884,0.000013251881,0.0000071582754,0.000022366252,0.000055705947,0.000013110301],"domain_scores_gemma":[0.9999207,0.000017138074,0.0000040357672,0.000009810213,0.000029300709,0.000018970371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018814871,0.0004879015,0.00038907272,0.00038609837,0.0004118893,0.0005575125,0.00081618957,0.0006803741,0.015951844],"category_scores_gemma":[0.00029297537,0.00016367728,0.00034252083,0.00029413882,0.00013350553,0.0008164533,0.0009774463,0.0005685477,0.0054688104],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039204335,0.00034383358,0.0009813481,0.0005404902,0.00003133995,0.0005847947,0.0008658562,0.0006232226,0.074823834,0.0032506231,0.06834732,0.84921527],"study_design_scores_gemma":[0.00019102056,0.0021020058,0.017978733,0.0003064964,0.00021708454,0.006114856,0.00074398523,0.01654041,0.043385785,0.005921778,0.906319,0.00017872681],"about_ca_topic_score_codex":0.0005248609,"about_ca_topic_score_gemma":0.0012214716,"teacher_disagreement_score":0.015951844,"about_ca_system_score_codex":0.000108982094,"about_ca_system_score_gemma":0.00025461576,"threshold_uncertainty_score":0.053364217},"labels":[],"label_agreement":null},{"id":"W1489319061","doi":"10.1007/3-540-39200-9_35","title":"New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":111,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Secrecy; Upper and lower bounds; Shared secret; Key (lock); Theoretical computer science; Context (archaeology); Fraction (chemistry); Information theory; Mutual information; Adversary; Pre-shared key; Key distribution; Public-key cryptography; Algorithm; Cryptography; Mathematics; Computer security; Encryption; Statistics; Artificial intelligence","score_opus":0.023777761368714196,"score_gpt":0.25714382903355515,"score_spread":0.23336606766484094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489319061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064123026,0.010912517,0.9113547,0.0071632126,0.001399821,0.000069912974,0.00023621046,0.00039201413,0.06205931],"genre_scores_gemma":[0.6494655,0.023091594,0.27828777,0.0033975285,0.0074474504,0.0008907868,0.0006032834,0.0015622842,0.0352538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98991406,0.0036960759,0.00047364552,0.0015643463,0.0033455745,0.0010061804],"domain_scores_gemma":[0.9318614,0.05546353,0.0017473256,0.0072221304,0.0027032413,0.0010023956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010851703,0.0024633668,0.0038110546,0.0024031573,0.003667965,0.011755636,0.005404988,0.004763193,0.010724579],"category_scores_gemma":[0.051496275,0.0018154891,0.0017534179,0.0048050005,0.015093582,0.039800126,0.0107911425,0.020238025,0.0035575952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007979968,0.00002167436,0.00004755441,0.000095634765,0.000011561554,0.000023692719,0.00012019185,0.006932555,0.00032671783,0.97808444,0.0032172601,0.011038926],"study_design_scores_gemma":[0.000010619322,0.00001325203,0.000020287549,0.000046556037,0.0000084887515,0.000023803683,0.000022849115,0.022159195,0.00037403245,0.97380066,0.0035053273,0.000014956089],"about_ca_topic_score_codex":0.00095929246,"about_ca_topic_score_gemma":0.00063305243,"teacher_disagreement_score":0.011755636,"about_ca_system_score_codex":0.0048004515,"about_ca_system_score_gemma":0.002338156,"threshold_uncertainty_score":0.057389915},"labels":[],"label_agreement":null},{"id":"W1489325207","doi":"10.1007/bfb0018388","title":"On the completeness of narrowing for E-unification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Unification; Completeness (order theory); Rewriting; Set (abstract data type); Term (time); Mathematics; Computer science; Calculus (dental); Algorithm; Algebra over a field; Theoretical computer science; Programming language; Pure mathematics; Physics","score_opus":0.038935494537518864,"score_gpt":0.25885552696919073,"score_spread":0.21992003243167185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489325207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06451622,0.011785492,0.7076221,0.012474884,0.00097467756,0.0003182731,0.0016908653,0.0022981472,0.19831935],"genre_scores_gemma":[0.6055546,0.0099595655,0.3289062,0.0056638923,0.0032845119,0.0008779936,0.0038805339,0.0018050263,0.04006775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877363,0.004758612,0.0011871539,0.0021507344,0.0027385354,0.0014286457],"domain_scores_gemma":[0.94646484,0.040692832,0.0010265965,0.0077078426,0.003196107,0.0009118217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01963659,0.0016908146,0.0044108545,0.004219421,0.0064937556,0.008192531,0.0059846486,0.0060564256,0.012217646],"category_scores_gemma":[0.03814778,0.0030659095,0.0059687616,0.0055304053,0.013249702,0.04698525,0.013073719,0.017373059,0.002515283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016104017,0.00008339704,0.0005379624,0.00027974887,0.00006907676,0.00009443961,0.00068978773,0.0027000746,0.0005659145,0.9622498,0.005221527,0.027347343],"study_design_scores_gemma":[0.000031904827,0.000014114502,0.0001812133,0.000051037085,0.00003074464,0.000051642244,0.00007151909,0.0037571287,0.00046724966,0.99182206,0.0035024579,0.000019005041],"about_ca_topic_score_codex":0.0055015595,"about_ca_topic_score_gemma":0.004569444,"teacher_disagreement_score":0.01963659,"about_ca_system_score_codex":0.002977632,"about_ca_system_score_gemma":0.0034164658,"threshold_uncertainty_score":0.10384941},"labels":[],"label_agreement":null},{"id":"W1489327653","doi":"10.1007/11566489_2","title":"A Method to Evaluate Human Spatial Coordination Interfaces for Computer-Assisted Surgery","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Health Sciences Centre; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Margin (machine learning); Stereographic projection; Context (archaeology); Computer vision; Human–computer interaction; Spatial contextual awareness; Artificial intelligence; Presentation (obstetrics); Machine learning; Surgery","score_opus":0.052888656443451025,"score_gpt":0.3666813185096439,"score_spread":0.3137926620661929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489327653","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.22088267,0.00065547274,0.7636884,0.00013228916,0.00037778693,0.0024659506,0.0008377426,0.0020825218,0.00887721],"genre_scores_gemma":[0.5662589,0.00031078368,0.42420104,0.00007813067,0.000061132305,0.002979578,0.0006727036,0.00023013,0.0052075344],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996912,0.0010774696,0.00023190898,0.00028898116,0.0013821142,0.00010752656],"domain_scores_gemma":[0.99344146,0.0025156871,0.00033596146,0.0004885871,0.002952535,0.00026572787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731406,0.0010641275,0.00055259425,0.0033177556,0.0005901055,0.0011288438,0.0007185271,0.0010520437,0.0067194435],"category_scores_gemma":[0.009601732,0.00035085226,0.0004960362,0.0013230187,0.00053205254,0.0009884961,0.0011430357,0.00032657833,0.0010958575],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006220744,0.0010385012,0.020658007,0.0011154164,0.0003022793,0.00016931302,0.001654779,0.008211136,0.19640721,0.0048648673,0.0046971133,0.7546606],"study_design_scores_gemma":[0.0026386406,0.018579185,0.123874344,0.00045982556,0.0012377035,0.0037780816,0.0039158375,0.58947223,0.21963875,0.008041753,0.02766212,0.00070151547],"about_ca_topic_score_codex":0.0018646013,"about_ca_topic_score_gemma":0.0024091983,"teacher_disagreement_score":0.0067194435,"about_ca_system_score_codex":0.0005166792,"about_ca_system_score_gemma":0.0008103128,"threshold_uncertainty_score":0.02247876},"labels":[],"label_agreement":null},{"id":"W1489388295","doi":"10.1007/978-3-642-33418-4_36","title":"Sparse DSI: Learning DSI Structure for Denoising and Fast Imaging","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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 Sherbrooke","funders":"","keywords":"Computer science; Diffusion MRI; Noise reduction; Artificial intelligence; SIGNAL (programming language); Diffusion; Pattern recognition (psychology); Dictionary learning; Computer vision; Algorithm; Image (mathematics); Magnetic resonance imaging; Physics","score_opus":0.035530827183147325,"score_gpt":0.3374550121171708,"score_spread":0.3019241849340235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489388295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075149996,0.00011764841,0.9969079,0.000089672285,0.000041571962,0.000022556826,0.00017350138,0.0016042169,0.00029151293],"genre_scores_gemma":[0.016969189,0.000550389,0.97757643,0.000119820616,0.00009236107,0.00013689739,0.0010059192,0.00081992435,0.002728962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999602,0.00007904749,0.000024761282,0.000073693576,0.0001927836,0.000027689091],"domain_scores_gemma":[0.9990778,0.00040060692,0.000068324814,0.00019583126,0.00019052198,0.00006682844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011398899,0.001455108,0.0009921602,0.0010871736,0.0003660296,0.0013862356,0.0017703343,0.0017620374,0.008628285],"category_scores_gemma":[0.0048179263,0.0008498483,0.0009144838,0.0014512263,0.0006156065,0.0014525793,0.0018091885,0.0024396589,0.0044838083],"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.00035208795,0.000109519904,0.00060169376,0.00045655886,0.00014414873,0.0001743852,0.00012213866,0.07294827,0.0465141,0.03150677,0.045675553,0.8013948],"study_design_scores_gemma":[0.000056493875,0.00007543835,0.00034083493,0.00002898539,0.000030254367,0.0003002352,0.00003080219,0.91804594,0.028485445,0.030344548,0.022221578,0.000039367085],"about_ca_topic_score_codex":0.0020241202,"about_ca_topic_score_gemma":0.0033570493,"teacher_disagreement_score":0.008628285,"about_ca_system_score_codex":0.00037483545,"about_ca_system_score_gemma":0.0009974426,"threshold_uncertainty_score":0.028864443},"labels":[],"label_agreement":null},{"id":"W1489478894","doi":"10.1007/978-3-540-72586-2_37","title":"Formal Verification of Analog and Mixed Signal Designs in Mathematica","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","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":"Concordia University","funders":"","keywords":"Correctness; Computer science; Formal verification; Stability (learning theory); SIGNAL (programming language); Theoretical computer science; Algorithm; Programming language","score_opus":0.029025233853063846,"score_gpt":0.24249520464161056,"score_spread":0.2134699707885467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489478894","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.0057045044,0.00051738176,0.9786347,0.00059083133,0.00015067455,0.000053995253,0.0001725207,0.00073631434,0.013439015],"genre_scores_gemma":[0.37743124,0.0009116589,0.60866165,0.0004373324,0.0002669851,0.00027894022,0.0004514963,0.00044831506,0.011112382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752647,0.0009693085,0.00020348874,0.00027006873,0.00089914375,0.00013161018],"domain_scores_gemma":[0.99563,0.0029927676,0.00018711908,0.0006076095,0.00052492606,0.000057537516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033176579,0.0007793197,0.0007225888,0.0009918564,0.0008630444,0.0024343738,0.0019038289,0.00084400404,0.007972736],"category_scores_gemma":[0.009085093,0.0007981753,0.0019340373,0.0007403102,0.002933031,0.004168916,0.0016530164,0.0027636609,0.0016681149],"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.000050888324,0.000032166317,0.00014377748,0.00019088664,0.000025020403,0.00006993575,0.00016909103,0.01891627,0.0018759862,0.95039284,0.0019310368,0.026202137],"study_design_scores_gemma":[0.000043515745,0.000022651757,0.00008475025,0.000064799446,0.00002347606,0.00005791494,0.000028034692,0.083596304,0.0028338768,0.89856595,0.014660202,0.000018605482],"about_ca_topic_score_codex":0.001674141,"about_ca_topic_score_gemma":0.0017083812,"teacher_disagreement_score":0.007972736,"about_ca_system_score_codex":0.001552875,"about_ca_system_score_gemma":0.0012160966,"threshold_uncertainty_score":0.02667147},"labels":[],"label_agreement":null},{"id":"W1489507727","doi":"10.1007/978-3-540-75975-1_20","title":"The Use of Ontologies and Rules to Assist in Academic Advising","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Ontology; Interoperability; Computer science; Grading (engineering); Upper ontology; Knowledge management; World Wide Web; Engineering management; Engineering ethics; Software engineering; Data science; Mathematics education; Semantic Web; Engineering; Psychology; Epistemology","score_opus":0.0861654985409858,"score_gpt":0.31202468294865304,"score_spread":0.22585918440766722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489507727","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.023825796,0.0041567315,0.85017943,0.006394852,0.00085489935,0.00039689953,0.0019575616,0.006542385,0.10569151],"genre_scores_gemma":[0.13335179,0.0027923496,0.84800774,0.00074297126,0.00012830384,0.00015032977,0.001995117,0.00031350963,0.012517869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964972,0.0012819343,0.0005093394,0.00040707688,0.0011757617,0.00012857757],"domain_scores_gemma":[0.9885667,0.0076359436,0.0005981429,0.0015671107,0.0013951163,0.00023707649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005620519,0.0005125944,0.0004952165,0.0032938982,0.000944436,0.005089633,0.0020454242,0.0015882719,0.004100122],"category_scores_gemma":[0.02151033,0.00061304664,0.000706979,0.0033095179,0.0015408377,0.008631324,0.0022663623,0.0015441056,0.0022188565],"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.00011489217,0.00023482568,0.0030650494,0.0005324262,0.00009644187,0.00062029675,0.0018399621,0.01170671,0.0023644594,0.20296746,0.04157568,0.7348817],"study_design_scores_gemma":[0.000075606586,0.00005998338,0.0023530212,0.0008283973,0.0002128095,0.0011037558,0.0012978035,0.11139686,0.01145856,0.4069361,0.4641368,0.00014022547],"about_ca_topic_score_codex":0.006830312,"about_ca_topic_score_gemma":0.0085031865,"teacher_disagreement_score":0.006830312,"about_ca_system_score_codex":0.0006795148,"about_ca_system_score_gemma":0.0020352914,"threshold_uncertainty_score":0.029724538},"labels":[],"label_agreement":null},{"id":"W1489544554","doi":"10.1007/11527954_19","title":"Algorithmic Foundations of the Internet: Roundup","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Field (mathematics); World Wide Web; Mathematics","score_opus":0.02369745416734363,"score_gpt":0.266378627808066,"score_spread":0.24268117364072236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489544554","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007967847,0.121959485,0.2945273,0.0878652,0.021976855,0.00012696104,0.0011055289,0.0009774012,0.46349347],"genre_scores_gemma":[0.28068408,0.17005229,0.1556963,0.017207764,0.042024355,0.000646214,0.0017095482,0.0011325878,0.33084694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993474,0.00019487254,0.000031567542,0.00013859273,0.0002065851,0.00008101948],"domain_scores_gemma":[0.99804425,0.0010458515,0.00006499848,0.00037938857,0.00030476894,0.00016069984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011433074,0.00097420625,0.0006236985,0.0016533888,0.0015701969,0.0063454006,0.0019401754,0.0031344395,0.032043554],"category_scores_gemma":[0.0046129427,0.00094398926,0.0009975372,0.002353991,0.0034624413,0.016420752,0.0030997852,0.0060853674,0.009222873],"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.000021178452,0.000027785294,0.00011759587,0.00012900447,0.0000127724425,0.0000522061,0.00006915452,0.0013740322,0.00012542824,0.8616744,0.08831437,0.048082188],"study_design_scores_gemma":[0.000005719927,0.000006554934,0.000093541115,0.0001222621,0.0000065702548,0.00009242691,0.00005053234,0.001535636,0.00014104608,0.85986716,0.13806497,0.000013532089],"about_ca_topic_score_codex":0.0015787693,"about_ca_topic_score_gemma":0.0021423143,"teacher_disagreement_score":0.032043554,"about_ca_system_score_codex":0.0024993678,"about_ca_system_score_gemma":0.0011609348,"threshold_uncertainty_score":0.10719633},"labels":[],"label_agreement":null},{"id":"W1489552184","doi":"10.1007/978-3-540-73451-2_8","title":"Toward Approximate Adaptive Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Computer science; Adaptive learning; Artificial intelligence; Context (archaeology); Reinforcement learning; Adaptive behavior; Machine learning","score_opus":0.04626081213245993,"score_gpt":0.2573760019637496,"score_spread":0.21111518983128968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489552184","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.0036577901,0.00096829265,0.9864965,0.00031230497,0.0001234941,0.000012191243,0.00001634204,0.00018054032,0.00823261],"genre_scores_gemma":[0.39765796,0.0032818897,0.5620824,0.0007546046,0.0005822361,0.00015469953,0.00020485245,0.00020461627,0.03507671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995431,0.000096673386,0.000020658823,0.00008731922,0.00022253387,0.0000297615],"domain_scores_gemma":[0.99935967,0.00027720648,0.000032721222,0.00017363226,0.00013241156,0.00002442309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097472384,0.00055767805,0.0010186804,0.00054573704,0.00032903222,0.0013275108,0.0012178661,0.00083888974,0.003908076],"category_scores_gemma":[0.004105593,0.00037067398,0.00050068746,0.0009024668,0.0009695427,0.0017687945,0.0020409701,0.0019980757,0.0010253135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009683728,0.000050078655,0.0005521257,0.00014673777,0.00008100593,0.000059896414,0.00013900075,0.16000886,0.004160874,0.4236714,0.0065317936,0.40450144],"study_design_scores_gemma":[0.0000074062,0.000027978229,0.00017843787,0.000021284899,0.000019046971,0.00006070452,0.00002045686,0.7716027,0.0015884705,0.21644764,0.010017365,0.000008511764],"about_ca_topic_score_codex":0.0008249076,"about_ca_topic_score_gemma":0.00073956203,"teacher_disagreement_score":0.003908076,"about_ca_system_score_codex":0.0006006045,"about_ca_system_score_gemma":0.00029756356,"threshold_uncertainty_score":0.013073802},"labels":[],"label_agreement":null},{"id":"W1489599888","doi":"10.1007/978-3-540-89454-4_32","title":"Improvisation and Performance as Models for Interacting with Stories","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Simon Fraser University","funders":"","keywords":"Improvisation; Narrative; Computer science; Metaphor; Storytelling; Interactive storytelling; Performing arts; Cognitive science; Human–computer interaction; Agency (philosophy); Computational creativity; Epistemology; Visual arts; Art; Psychology; Creativity; Linguistics; Literature; Social psychology","score_opus":0.027125936543626484,"score_gpt":0.26654602980446,"score_spread":0.23942009326083352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489599888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22369638,0.00049239164,0.70757353,0.0013779739,0.00008766778,0.00015920993,0.00039130155,0.00078789203,0.06543378],"genre_scores_gemma":[0.9555627,0.00017206048,0.032189704,0.000042908225,0.000020653804,0.00019488957,0.00027638412,0.00011239966,0.011428306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.00048365057,0.000049957347,0.00016024725,0.00017007517,0.000110476634],"domain_scores_gemma":[0.99570686,0.0031959906,0.00031538948,0.0003631818,0.0002230176,0.00019554015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711806,0.00095395744,0.00053421425,0.0007405868,0.00070365856,0.0035529803,0.0019641651,0.0018697013,0.009178196],"category_scores_gemma":[0.008711755,0.0006105702,0.0011096178,0.0005596981,0.002308682,0.004900041,0.0016773369,0.0017181957,0.0011283153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037423483,0.00020457347,0.0030308121,0.00020756075,0.00010956788,0.00033821716,0.005390479,0.30090502,0.003141901,0.65614814,0.0012738918,0.028875573],"study_design_scores_gemma":[0.000027896338,0.000076024815,0.0005879714,0.000024615332,0.000029741608,0.00011025432,0.00053007633,0.7909087,0.0009393413,0.20456743,0.0021717756,0.000026164927],"about_ca_topic_score_codex":0.0033806812,"about_ca_topic_score_gemma":0.00184993,"teacher_disagreement_score":0.009178196,"about_ca_system_score_codex":0.0010384303,"about_ca_system_score_gemma":0.00048162285,"threshold_uncertainty_score":0.030704081},"labels":[],"label_agreement":null},{"id":"W1489603167","doi":"10.1007/11802914_37","title":"Robust Three-Dimensional Registration of Range Images Using a New Genetic Algorithm","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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 Alberta","funders":"","keywords":"Computer science; Image registration; Artificial intelligence; Computer vision; Viewpoints; Range (aeronautics); Process (computing); Genetic algorithm; Object (grammar); Task (project management); Algorithm; Pattern recognition (psychology); Image (mathematics); Machine learning","score_opus":0.02159706075986693,"score_gpt":0.21086195740592784,"score_spread":0.18926489664606092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489603167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00825465,0.000075331336,0.99033386,0.00003388097,0.000027382439,0.000022870421,0.000006781651,0.0004183578,0.00082697783],"genre_scores_gemma":[0.120185465,0.000081376915,0.87777907,0.000051548443,0.000021115287,0.00011151659,0.000052197283,0.00013179964,0.0015858109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951684,0.00009816052,0.000023942184,0.00013225038,0.00018677206,0.000041972424],"domain_scores_gemma":[0.99947447,0.00021740646,0.00005479185,0.000090844915,0.00014146206,0.000021017919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077350356,0.0006979945,0.0010766012,0.0010718885,0.0005906122,0.0008283597,0.0017828234,0.0014064312,0.0011522772],"category_scores_gemma":[0.0018177485,0.00054873206,0.0010915737,0.0010737639,0.00086575246,0.0010998662,0.0010323741,0.0008766109,0.00047347482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016910756,0.000155067,0.0006672616,0.00006831455,0.00013264596,0.000088801724,0.00017974284,0.5956025,0.046019167,0.01532247,0.0011521366,0.34044287],"study_design_scores_gemma":[0.000018582117,0.000038790185,0.0001770525,0.0000053858307,0.00001845827,0.000040239014,0.000008929362,0.9934789,0.0034792149,0.001948489,0.00077041384,0.000015451256],"about_ca_topic_score_codex":0.005112206,"about_ca_topic_score_gemma":0.0038213402,"teacher_disagreement_score":0.005112206,"about_ca_system_score_codex":0.000765126,"about_ca_system_score_gemma":0.0008516114,"threshold_uncertainty_score":0.0101649165},"labels":[],"label_agreement":null},{"id":"W1489618473","doi":"10.1007/11940128_39","title":"Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Facility location problem; Tree (set theory); Path (computing); Algorithm; Mathematical optimization; Mathematics; Combinatorics; Computer network","score_opus":0.031648603071163774,"score_gpt":0.2388581242240683,"score_spread":0.20720952115290453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489618473","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.01291001,0.0013622021,0.9747303,0.0004773892,0.00011914704,0.000161555,0.00042102038,0.00064724806,0.009171163],"genre_scores_gemma":[0.08925025,0.0010913033,0.90247285,0.00019599794,0.00011915673,0.00033544743,0.0009820273,0.000325908,0.0052270903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896073,0.00032098708,0.000058582886,0.0002530029,0.00021088903,0.00019579413],"domain_scores_gemma":[0.99608815,0.0029798206,0.00022819496,0.00024743035,0.00028431488,0.0001721299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700699,0.001634745,0.0021964023,0.0014492708,0.00093772594,0.002590244,0.003648815,0.002938206,0.012142381],"category_scores_gemma":[0.008594241,0.0013662388,0.0016767451,0.003548381,0.0013361253,0.004497338,0.002310517,0.003285627,0.0020648441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027861295,0.00024439828,0.000446987,0.0005400765,0.0000762474,0.000051337192,0.00022459889,0.7120847,0.0010770275,0.09474501,0.020553956,0.16967703],"study_design_scores_gemma":[0.00010902074,0.000058415455,0.000110100475,0.000052598207,0.000023627359,0.000037671132,0.000068692905,0.89416796,0.00040482212,0.101829655,0.003122606,0.000014847159],"about_ca_topic_score_codex":0.0073830336,"about_ca_topic_score_gemma":0.009141566,"teacher_disagreement_score":0.012142381,"about_ca_system_score_codex":0.0023351093,"about_ca_system_score_gemma":0.002404767,"threshold_uncertainty_score":0.040620327},"labels":[],"label_agreement":null},{"id":"W1489788933","doi":"10.1007/978-3-642-16001-1_13","title":"Discovery of Non-induced Patterns from Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Seriousness; Sequence (biology); Set (abstract data type); Data mining; Redundancy (engineering); Genomics; Computational biology; Artificial intelligence; Biology; Genetics; Genome; Gene","score_opus":0.014549882176598194,"score_gpt":0.25801117116427164,"score_spread":0.24346128898767344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489788933","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.38326886,0.0019259991,0.59769326,0.00054933963,0.00015507964,0.00020709065,0.0058422247,0.0036248656,0.00673326],"genre_scores_gemma":[0.5940502,0.0019774393,0.37536284,0.00030348086,0.00023526482,0.0003243583,0.019347588,0.0006157796,0.0077830106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953854,0.000062093175,0.000040425766,0.00017377964,0.00013800115,0.000047202015],"domain_scores_gemma":[0.9983918,0.00074876804,0.00020620774,0.0003893184,0.00016426304,0.000099536934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034802797,0.00055700896,0.0008231633,0.001758027,0.00035857645,0.0008258322,0.0011489542,0.00048324664,0.0027234203],"category_scores_gemma":[0.0021936796,0.00045916013,0.0009361418,0.0020596245,0.0004562776,0.001352472,0.00089448056,0.001078845,0.0013449417],"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.0010716753,0.0004658625,0.012760545,0.0018547269,0.00021641882,0.0018624747,0.00033691418,0.012367919,0.29995763,0.041580416,0.007113575,0.6204119],"study_design_scores_gemma":[0.0002260052,0.00094063376,0.024291323,0.00022651487,0.00034423708,0.0053796666,0.00033703272,0.3878478,0.25818837,0.29238456,0.029724386,0.00010951475],"about_ca_topic_score_codex":0.00029822817,"about_ca_topic_score_gemma":0.00069134514,"teacher_disagreement_score":0.0027234203,"about_ca_system_score_codex":0.0002589288,"about_ca_system_score_gemma":0.00046932467,"threshold_uncertainty_score":0.009110749},"labels":[],"label_agreement":null},{"id":"W1489809596","doi":"10.1007/978-3-319-15579-1_54","title":"Order Structures for Subclasses of Generalised Traces","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; TRACE (psycholinguistics); Equivalence (formal languages); Causality (physics); Simultaneity; Order (exchange); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics","score_opus":0.03179765081236744,"score_gpt":0.2717965071202799,"score_spread":0.23999885630791248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489809596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26152417,0.0028933014,0.525468,0.0027505637,0.0008271187,0.00030458524,0.0014782281,0.0016154023,0.20313856],"genre_scores_gemma":[0.8557067,0.0015898246,0.07418816,0.0005128113,0.00056116545,0.0003054803,0.0013510629,0.000799769,0.06498511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836224,0.00027061228,0.00020438654,0.0004109685,0.0004992638,0.00025257727],"domain_scores_gemma":[0.9964959,0.0017928637,0.00019946808,0.0008209342,0.0004179647,0.00027296317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287869,0.0008041587,0.0010923435,0.0025192196,0.0023508563,0.0051624435,0.0012530861,0.0016731222,0.007243626],"category_scores_gemma":[0.0049550105,0.0011913066,0.0020525546,0.002018112,0.0044362224,0.011253302,0.0036659648,0.004778493,0.0016952029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014613609,0.000008869775,0.00012993271,0.000027462756,0.0000049633604,0.000084562205,0.0005362664,0.00022242023,0.000456081,0.99349916,0.0005264629,0.004489303],"study_design_scores_gemma":[0.000007400829,0.0000065978315,0.000075350355,0.000019617193,0.000006438635,0.00010695452,0.00011662314,0.00090275815,0.00032259634,0.9937309,0.004695885,0.00000882799],"about_ca_topic_score_codex":0.0016929406,"about_ca_topic_score_gemma":0.0015058488,"teacher_disagreement_score":0.007243626,"about_ca_system_score_codex":0.0020142088,"about_ca_system_score_gemma":0.00083840435,"threshold_uncertainty_score":0.024232388},"labels":[],"label_agreement":null},{"id":"W1489964139","doi":"10.1007/978-3-540-24677-0_47","title":"Word Separation in Handwritten Legal Amounts on Bank Cheques Based on Spatial Gap Distances","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Cheque; Computer science; Cluster analysis; Word (group theory); Measure (data warehouse); Artificial intelligence; Class (philosophy); Order (exchange); Data mining; Pattern recognition (psychology); Computer security; Finance; Mathematics","score_opus":0.014536166032834957,"score_gpt":0.2742027539875437,"score_spread":0.2596665879547087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489964139","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.7002813,0.0019916953,0.28057465,0.00029842823,0.000382468,0.00011854184,0.000887384,0.003964477,0.011501084],"genre_scores_gemma":[0.8523093,0.0007195039,0.13626434,0.00006640626,0.00013446326,0.000049471037,0.0019481466,0.0003748717,0.008133555],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996271,0.000053732856,0.00003216642,0.000082420505,0.00013216006,0.000072408075],"domain_scores_gemma":[0.9986553,0.00054287753,0.00011001352,0.00012316629,0.0004805397,0.00008810596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027927617,0.0006374679,0.000882862,0.0022549068,0.00053029566,0.0010478317,0.00055855635,0.00044683026,0.0054236194],"category_scores_gemma":[0.001487841,0.00025333313,0.0004626697,0.001855142,0.00038767178,0.0012969903,0.0007436565,0.0005165674,0.00304326],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041877087,0.00021713965,0.0052071786,0.00039768982,0.000070285285,0.0006091099,0.00025824094,0.021205211,0.13157746,0.003621829,0.0059093847,0.82673883],"study_design_scores_gemma":[0.000077627476,0.00036760376,0.022223743,0.00008113177,0.00016553122,0.000808802,0.00062656036,0.8339468,0.12728773,0.0071297167,0.0072108465,0.00007388181],"about_ca_topic_score_codex":0.0035374458,"about_ca_topic_score_gemma":0.0053134602,"teacher_disagreement_score":0.0054236194,"about_ca_system_score_codex":0.0003108866,"about_ca_system_score_gemma":0.0007165338,"threshold_uncertainty_score":0.018143773},"labels":[],"label_agreement":null},{"id":"W1490020014","doi":"10.1007/3-540-45545-0_78","title":"On Dynamic Generalized Voronoi Diagrams in the Euclidean Metric","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Calgary","funders":"","keywords":"Voronoi diagram; SPHERES; Weighted Voronoi diagram; Euclidean geometry; Metric (unit); Euclidean space; Euclidean distance; Polynomial; Mathematics; Tangent; Tangent space; Power diagram; Set (abstract data type); Topology (electrical circuits); Computer science; Mathematical analysis; Geometry; Combinatorics; Physics","score_opus":0.01571594469342446,"score_gpt":0.25711842749028335,"score_spread":0.24140248279685889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490020014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04486014,0.002684915,0.90950614,0.0005785322,0.00032174625,0.000073339535,0.00043439268,0.00022772381,0.04131307],"genre_scores_gemma":[0.70728356,0.005211328,0.24005808,0.00027736355,0.00044282895,0.0001684639,0.0011511759,0.0005363374,0.04487077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993012,0.0002007168,0.000030563726,0.000106263404,0.00028943928,0.00007173156],"domain_scores_gemma":[0.99881977,0.000503284,0.00013789402,0.00015237239,0.00026614772,0.00012056224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065263145,0.0005971666,0.0009853255,0.002055211,0.0009433127,0.002270675,0.001469944,0.0009192235,0.006065816],"category_scores_gemma":[0.0040927804,0.00048028646,0.0005508282,0.0021255224,0.0018265139,0.0037315274,0.0022586037,0.0011059443,0.001008922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015127479,0.000005439902,0.00013424149,0.00003407512,0.0000056728427,0.000034586454,0.000095817275,0.024054244,0.00038898463,0.9586784,0.0018283081,0.014724911],"study_design_scores_gemma":[0.000007633698,0.000009798226,0.00013161857,0.000023655164,0.0000045197035,0.00008676299,0.000074467614,0.083558306,0.00021922344,0.90243435,0.013436923,0.000012741098],"about_ca_topic_score_codex":0.0040986543,"about_ca_topic_score_gemma":0.004650861,"teacher_disagreement_score":0.006065816,"about_ca_system_score_codex":0.0013138396,"about_ca_system_score_gemma":0.0006099589,"threshold_uncertainty_score":0.020292163},"labels":[],"label_agreement":null},{"id":"W1490048430","doi":"10.1007/978-3-540-69057-3_92","title":"Does Judgement of Haptic Virtual Texture Roughness Scale Monotonically with Lateral Force Modulation?","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Haptic technology; Surface finish; Grating; Judgement; Computer science; Texture (cosmology); Modulation (music); Scale (ratio); Materials science; Optics; Artificial intelligence; Physics; Acoustics; Composite material; Image (mathematics)","score_opus":0.016890483807523355,"score_gpt":0.24823410449925642,"score_spread":0.23134362069173306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490048430","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.96343696,0.0010778692,0.013969219,0.00036494288,0.00018860659,0.00006160334,0.00038417167,0.00014618541,0.020370454],"genre_scores_gemma":[0.9966605,0.00019786318,0.0012121964,0.00009874962,0.000032510798,0.000015815467,0.00010714469,0.00005357794,0.0016215878],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99967885,0.00006191591,0.000016505941,0.00010914345,0.000094563766,0.000038918228],"domain_scores_gemma":[0.99651504,0.0020425192,0.00071839447,0.00033460674,0.00023070531,0.00015874875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057792093,0.00027533266,0.00038555363,0.0002579095,0.00009386371,0.0010978046,0.00043038247,0.00082958885,0.007194622],"category_scores_gemma":[0.014840506,0.0004164012,0.0002614001,0.0002239963,0.00047114497,0.0013161277,0.00040318107,0.00044023703,0.0013404392],"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.004005898,0.00025178734,0.06207646,0.00056882825,0.00015815854,0.00035606348,0.0008103167,0.0014215055,0.7582708,0.002452313,0.0023835052,0.1672444],"study_design_scores_gemma":[0.00006216788,0.00044112987,0.9581687,0.000054508644,0.00006061251,0.0006068241,0.00042275066,0.0076770177,0.027527045,0.003905586,0.0010155095,0.00005804263],"about_ca_topic_score_codex":0.0005815177,"about_ca_topic_score_gemma":0.00043832295,"teacher_disagreement_score":0.007194622,"about_ca_system_score_codex":0.000107546904,"about_ca_system_score_gemma":0.00015361482,"threshold_uncertainty_score":0.024068356},"labels":[],"label_agreement":null},{"id":"W1490069855","doi":"10.1007/978-3-642-13772-3_9","title":"Segmentation of Very High Resolution Remote Sensing Imagery of Urban Areas Using Particle Swarm Optimization Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","field":"Engineering","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":"Particle swarm optimization; Computer science; Segmentation; Remote sensing; Resolution (logic); Swarm behaviour; High resolution; Computer vision; Image segmentation; Artificial intelligence; Algorithm; Geography","score_opus":0.016127664362913276,"score_gpt":0.22939516611351354,"score_spread":0.21326750175060027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490069855","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.032619134,0.00034490824,0.96452945,0.00007393751,0.000039765135,0.00007491794,0.0001310513,0.00071260467,0.0014741797],"genre_scores_gemma":[0.21938758,0.00045944742,0.77573335,0.000074372794,0.000054814172,0.0001468107,0.0008383357,0.00027271948,0.003032573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981374,0.000024440527,0.00001328408,0.000057543166,0.0000608654,0.000030114932],"domain_scores_gemma":[0.99980134,0.00009253944,0.000021976923,0.000026983085,0.00004630855,0.000010916791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032473973,0.00079142937,0.000935413,0.0014249581,0.0003460533,0.0010104731,0.00071219617,0.0008615846,0.0010406872],"category_scores_gemma":[0.0005672316,0.0006113849,0.0010802868,0.0014068681,0.0003523227,0.00063897274,0.0004538041,0.00048068698,0.00048548845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002773703,0.00016579826,0.0012833792,0.00029215703,0.00011420595,0.00031036048,0.0002688719,0.55170757,0.0776285,0.0035707306,0.004114346,0.36026663],"study_design_scores_gemma":[0.000008950184,0.000022932012,0.0013285277,0.0000096000485,0.000022865908,0.00006259845,0.000028859824,0.9890192,0.0064921295,0.0018190272,0.0011730222,0.000012258724],"about_ca_topic_score_codex":0.004554401,"about_ca_topic_score_gemma":0.0041076858,"teacher_disagreement_score":0.004554401,"about_ca_system_score_codex":0.0003617804,"about_ca_system_score_gemma":0.0006437092,"threshold_uncertainty_score":0.009055734},"labels":[],"label_agreement":null},{"id":"W1490096632","doi":"10.1007/978-3-642-03564-7_13","title":"On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Singleton; Hierarchy; Characterization (materials science); Code (set theory); Element (criminal law); Mathematics; Discrete mathematics; Sigma; Property (philosophy); Combinatorics; Computer science; Relation (database); Set (abstract data type); Programming language; Physics","score_opus":0.020867858230932457,"score_gpt":0.24892793219308845,"score_spread":0.228060073962156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490096632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14416246,0.01291905,0.44915137,0.0073348586,0.00285005,0.00012803747,0.0007765276,0.0010197908,0.38165787],"genre_scores_gemma":[0.8453508,0.008055104,0.07780854,0.001651237,0.003415584,0.00023121721,0.0005599512,0.000743416,0.06218411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862456,0.00023338325,0.0001343131,0.00040884365,0.00038064906,0.0002182711],"domain_scores_gemma":[0.9901991,0.0066873212,0.00066431053,0.0015887211,0.00064653804,0.00021399578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015422837,0.000695966,0.00096004416,0.0019324688,0.0028925887,0.0037816686,0.00189161,0.0021442254,0.0069507463],"category_scores_gemma":[0.011616689,0.00084674725,0.0013766952,0.0031457236,0.009184916,0.012873172,0.0025162867,0.0060977847,0.0012657745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019508798,0.0000060767234,0.000059187187,0.000018227138,0.0000019308811,0.000042028394,0.00009689342,0.00061712647,0.0002923345,0.9927884,0.0006202832,0.005438127],"study_design_scores_gemma":[0.000006276369,0.0000068823715,0.00004736281,0.000009417032,0.0000040411674,0.00010141291,0.000024386214,0.0014922043,0.0003837595,0.9946726,0.003241373,0.000010331496],"about_ca_topic_score_codex":0.00234676,"about_ca_topic_score_gemma":0.0013110752,"teacher_disagreement_score":0.0069507463,"about_ca_system_score_codex":0.0015149747,"about_ca_system_score_gemma":0.0014442235,"threshold_uncertainty_score":0.023252547},"labels":[],"label_agreement":null},{"id":"W1490136960","doi":"10.1007/978-3-540-78761-7_60","title":"Cumulative Step Length Adaptation for Evolution Strategies Using Negative Recombination Weights","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Dalhousie University","funders":"","keywords":"Computer science; Adaptation (eye); Recombination; Algorithm; Biology; Genetics; Neuroscience","score_opus":0.05761800603408946,"score_gpt":0.30842489990165806,"score_spread":0.2508068938675686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490136960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015808925,0.00041229784,0.979214,0.00007864986,0.00009822581,0.0000533989,0.000012202579,0.00026584254,0.00405642],"genre_scores_gemma":[0.5152355,0.00041242718,0.47316614,0.000193667,0.00011864791,0.00034030274,0.000086113876,0.00033459402,0.0101125045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961,0.00011815622,0.000023813815,0.0000722863,0.00013993033,0.000035856254],"domain_scores_gemma":[0.9981705,0.001130778,0.000121771176,0.00016527036,0.00034453184,0.00006728153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014359041,0.0006584395,0.00076937873,0.00074614555,0.00037545775,0.0007480016,0.001806424,0.0012627045,0.0030328424],"category_scores_gemma":[0.005607196,0.00035550402,0.00046809085,0.0007559914,0.00055304926,0.0010794186,0.00097145716,0.0013345095,0.0005784985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013493752,0.00018022193,0.0005483859,0.00012988539,0.00006460637,0.00006539973,0.0001369471,0.67550313,0.011660376,0.025352655,0.0018375776,0.28438595],"study_design_scores_gemma":[0.000011894417,0.000034065455,0.00010049807,0.00000953692,0.000011357311,0.000022729846,0.000005291214,0.99551445,0.0009324202,0.0026674382,0.00068340317,0.000006952046],"about_ca_topic_score_codex":0.0013631216,"about_ca_topic_score_gemma":0.0017558167,"teacher_disagreement_score":0.0030328424,"about_ca_system_score_codex":0.00067532033,"about_ca_system_score_gemma":0.00056079414,"threshold_uncertainty_score":0.010145843},"labels":[],"label_agreement":null},{"id":"W1490211612","doi":"10.1007/11494683_22","title":"Design of Multiple Classifier Systems for Time Series Data","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Maximization; Subspace topology; Classifier (UML); Minification; Artificial intelligence; Machine learning; Series (stratigraphy); Data mining; Pattern recognition (psychology); Algorithm; Mathematics; Mathematical optimization","score_opus":0.05264759905902756,"score_gpt":0.2488150174755107,"score_spread":0.19616741841648316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490211612","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.0034376655,0.00017688068,0.99538404,0.00006563744,0.000051490337,0.00010392391,0.000024689976,0.0004379551,0.0003176534],"genre_scores_gemma":[0.17195657,0.00038760828,0.82397926,0.00014769194,0.0001859006,0.0007682051,0.00025310222,0.0001370873,0.0021845456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997886,0.00052305876,0.00019279138,0.00069270906,0.0005103178,0.00019503327],"domain_scores_gemma":[0.99658763,0.0012691133,0.00025900762,0.0003018093,0.0014574329,0.00012503631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031930157,0.00096669164,0.0019568568,0.0009416501,0.0011677486,0.0020261682,0.0028493905,0.0023215937,0.0035724079],"category_scores_gemma":[0.008673152,0.0012381438,0.0010661163,0.00084231724,0.0005341702,0.0021732282,0.0013237742,0.0018455489,0.0018794817],"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.0004862579,0.00022238922,0.0018343859,0.00035368712,0.00028475636,0.00026001918,0.00020248113,0.25166753,0.027806293,0.012002367,0.0042341324,0.7006457],"study_design_scores_gemma":[0.000029999042,0.00013840049,0.00030082773,0.000018242756,0.000056929213,0.0001158165,0.000022813256,0.9835006,0.0080612125,0.005429173,0.0023076637,0.000018255914],"about_ca_topic_score_codex":0.0019765839,"about_ca_topic_score_gemma":0.0030001882,"teacher_disagreement_score":0.0035724079,"about_ca_system_score_codex":0.00091729773,"about_ca_system_score_gemma":0.001562377,"threshold_uncertainty_score":0.016886532},"labels":[],"label_agreement":null},{"id":"W1490245427","doi":"10.1007/978-3-540-69812-8_42","title":"Efficient Bisecting k-Medoids and Its Application in Gene Expression Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Waterloo","funders":"","keywords":"Medoid; Centroid; Computer science; k-medoids; Cluster analysis; Computation; Outlier; Partition (number theory); Algorithm; Pattern recognition (psychology); Robustness (evolution); Data mining; Artificial intelligence; Mathematics; Fuzzy clustering; CURE data clustering algorithm; Gene; Combinatorics; Genetics; Biology","score_opus":0.012294184722553383,"score_gpt":0.25137829323033645,"score_spread":0.23908410850778306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490245427","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.0014166246,0.000114404036,0.9976587,0.000026151718,0.000015797477,0.000018945046,0.00005115909,0.00046801005,0.00023018067],"genre_scores_gemma":[0.025169274,0.00019573176,0.9728157,0.000042108393,0.00002172778,0.00015345706,0.00028037306,0.00024912602,0.0010725026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997962,0.0007228563,0.00016904881,0.00044909524,0.00062412955,0.000072871095],"domain_scores_gemma":[0.9945056,0.004017299,0.00022632322,0.00050614314,0.00063668593,0.00010796983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026511461,0.0011129259,0.0021238422,0.002208,0.00079527014,0.0012262657,0.0021029687,0.0014019841,0.0036486886],"category_scores_gemma":[0.008689053,0.0011062088,0.002077745,0.002820052,0.0012662507,0.0014512014,0.0029291764,0.0020465546,0.0020058316],"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.00043398826,0.00008134591,0.00076541764,0.00048272143,0.00013223628,0.00012225287,0.00045546723,0.2626788,0.022403551,0.04171167,0.004597497,0.6661351],"study_design_scores_gemma":[0.00002565209,0.000068918955,0.0002777794,0.00003813936,0.000034039615,0.00017533233,0.0000715169,0.943127,0.009789544,0.04058895,0.005766269,0.000037010876],"about_ca_topic_score_codex":0.002579991,"about_ca_topic_score_gemma":0.0021026996,"teacher_disagreement_score":0.0036486886,"about_ca_system_score_codex":0.0008295702,"about_ca_system_score_gemma":0.001063102,"threshold_uncertainty_score":0.014020741},"labels":[],"label_agreement":null},{"id":"W1490287316","doi":"10.1007/978-3-642-17274-8_52","title":"RibbonView: Interactive Context-Preserving Cutaways of Anatomical Surface Meshes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Polygon mesh; Surface (topology); Computer graphics (images); Context (archaeology); Visualization; Object (grammar); Action (physics); Computer vision; Artificial intelligence; Human–computer interaction; Geometry; Mathematics; Geology","score_opus":0.017254971624794987,"score_gpt":0.28481353075283783,"score_spread":0.2675585591280428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490287316","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.009855073,0.0003375586,0.9594867,0.00014358258,0.00010980003,0.000145045,0.00084583473,0.024945263,0.004131195],"genre_scores_gemma":[0.110883854,0.0005124481,0.8715254,0.00015791459,0.000062172396,0.0002507515,0.0017814934,0.009873015,0.0049529583],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994678,0.000069277856,0.000024297393,0.00007773565,0.00030054696,0.000060317612],"domain_scores_gemma":[0.99892104,0.000579626,0.000055881967,0.00024249747,0.00011499866,0.000085936306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006614326,0.0018618831,0.0016704338,0.0015173503,0.00063011044,0.0020940248,0.0029698436,0.0015461213,0.03010058],"category_scores_gemma":[0.0028188038,0.0015070087,0.0016310331,0.0011572979,0.0006729375,0.0014130198,0.004229382,0.0024183954,0.0034204521],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008601756,0.00018188107,0.00095736113,0.001233916,0.0002814038,0.0010205819,0.0012771274,0.099954285,0.07979486,0.03532409,0.059513282,0.7196011],"study_design_scores_gemma":[0.000338357,0.00017111324,0.0010244651,0.00025564872,0.00010185871,0.0011783567,0.0002565876,0.8151334,0.053121362,0.05379717,0.07447495,0.00014668326],"about_ca_topic_score_codex":0.0023302163,"about_ca_topic_score_gemma":0.005655187,"teacher_disagreement_score":0.03010058,"about_ca_system_score_codex":0.0004249654,"about_ca_system_score_gemma":0.0007162075,"threshold_uncertainty_score":0.100696504},"labels":[],"label_agreement":null},{"id":"W1490288468","doi":"10.1007/978-3-540-87654-0_12","title":"Simulation of Negotiation Policies in Distributed Multiagent Resource Allocation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Negotiation; Computer science; Resource allocation; Resource (disambiguation); Multi-agent system; Distributed computing; Management science; Operations research; Knowledge management; Artificial intelligence; Political science; Computer network; Economics; Engineering; Law","score_opus":0.062474710644744455,"score_gpt":0.34180670467614616,"score_spread":0.2793319940314017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490288468","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.6812358,0.00043074435,0.29741022,0.00090634567,0.00020571142,0.0001691673,0.00029282528,0.00092674635,0.018422436],"genre_scores_gemma":[0.9792869,0.00005898264,0.019026136,0.00004545688,0.000010773135,0.000079812264,0.00008725619,0.000032454984,0.0013722543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993967,0.00029739254,0.000030404386,0.00006955825,0.000117083226,0.000088830115],"domain_scores_gemma":[0.99285865,0.0060831527,0.00021659484,0.00026564367,0.00033614278,0.00023978339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338938,0.00048331343,0.00097290624,0.0005184984,0.00056084496,0.0011639184,0.001281726,0.0016100537,0.0035525057],"category_scores_gemma":[0.0066573205,0.00053200056,0.000506549,0.00050935044,0.001011061,0.00091665686,0.00086246233,0.0011414456,0.000263862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008032691,0.000053000873,0.0003218667,0.000011321963,0.000007123587,0.000019113768,0.000024291037,0.99409264,0.00027390712,0.0034840994,0.00012865198,0.0015036768],"study_design_scores_gemma":[0.000010583332,0.0000071080244,0.000025404903,9.238207e-7,9.124277e-7,0.0000016428132,0.0000032205542,0.99907637,0.00012454744,0.0007112439,0.000036956517,0.0000011347876],"about_ca_topic_score_codex":0.0080329105,"about_ca_topic_score_gemma":0.0035951515,"teacher_disagreement_score":0.0080329105,"about_ca_system_score_codex":0.0013543417,"about_ca_system_score_gemma":0.001049863,"threshold_uncertainty_score":0.015972316},"labels":[],"label_agreement":null},{"id":"W1490354401","doi":"10.1007/978-3-540-30125-7_20","title":"Nonparametric Impulsive Noise Removal","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nonparametric statistics; Computer science; Noise (video); Value noise; Gradient noise; Filter (signal processing); Probability density function; Algorithm; Noise measurement; Median filter; Impulse noise; Artificial intelligence; Computer vision; Noise floor; Mathematics; Statistics; Noise reduction; Image processing; Image (mathematics)","score_opus":0.01724891647606345,"score_gpt":0.26970472078847946,"score_spread":0.252455804312416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490354401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004406723,0.0006196137,0.98662555,0.0001077439,0.00009670607,0.000010823458,0.00006717724,0.00045072738,0.007615029],"genre_scores_gemma":[0.24111329,0.0026344014,0.6529361,0.00028496832,0.00034232283,0.00009511294,0.0013425688,0.00079340773,0.100457855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972457,0.00004356166,0.000011070662,0.000063829626,0.0001346963,0.00002229421],"domain_scores_gemma":[0.9996524,0.00010379087,0.000031744094,0.00011367562,0.00008218187,0.000016222079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039727747,0.0008476102,0.0007833992,0.00059948873,0.0003007164,0.0008242763,0.0007677949,0.00080493186,0.005004687],"category_scores_gemma":[0.0010972186,0.00050201145,0.0006480026,0.0006487193,0.0006412544,0.0007714009,0.0012269522,0.0011332802,0.0035804813],"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.00028595226,0.00011413197,0.00051898655,0.00024967355,0.00011249687,0.00020003543,0.00008079665,0.0860943,0.100810915,0.047654834,0.010124159,0.7537537],"study_design_scores_gemma":[0.000022248556,0.0001194161,0.0021663993,0.00006474739,0.00012718495,0.001171451,0.00005050998,0.7941549,0.10128569,0.059557863,0.041212782,0.000066876564],"about_ca_topic_score_codex":0.0003871632,"about_ca_topic_score_gemma":0.0008565281,"teacher_disagreement_score":0.005004687,"about_ca_system_score_codex":0.00022603272,"about_ca_system_score_gemma":0.00032903693,"threshold_uncertainty_score":0.016742289},"labels":[],"label_agreement":null},{"id":"W1490382653","doi":"10.1007/11760146_37","title":"Computational Modeling and Experimental Validation of Aviation Security Procedures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Aviation; Computer security; Aerospace engineering; Engineering","score_opus":0.00845856490638126,"score_gpt":0.2154727887010644,"score_spread":0.20701422379468315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490382653","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.7825857,0.00019841272,0.1952984,0.00045975944,0.00011874097,0.00016762114,0.00088885194,0.0010358981,0.019246474],"genre_scores_gemma":[0.9752024,0.00006990998,0.022451432,0.000020306465,0.0000069681223,0.000095330775,0.0003806856,0.00005670495,0.0017162838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946505,0.00015464566,0.000026239424,0.000069152455,0.00023068672,0.00005428185],"domain_scores_gemma":[0.99776554,0.0013628064,0.00011676021,0.0004928597,0.00023036431,0.000031549454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006815013,0.00039541698,0.0003424831,0.00030480386,0.00042354668,0.00095993164,0.0016740685,0.00081273395,0.0039672526],"category_scores_gemma":[0.0035175723,0.00035385363,0.00032834723,0.00026737546,0.0009902847,0.00081302837,0.00048486295,0.0008520299,0.00046302404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000781002,0.0011756077,0.0018688127,0.00016571421,0.000039218117,0.0000895673,0.00024707644,0.82220596,0.08217202,0.06073234,0.0025497896,0.027972905],"study_design_scores_gemma":[0.000027961067,0.000076181816,0.00045608552,0.0000051135103,0.0000061194282,0.000010151503,0.00002109803,0.97196376,0.02276513,0.0040272768,0.0006328202,0.000008370506],"about_ca_topic_score_codex":0.0053950995,"about_ca_topic_score_gemma":0.0034291625,"teacher_disagreement_score":0.0053950995,"about_ca_system_score_codex":0.0011470338,"about_ca_system_score_gemma":0.0010349167,"threshold_uncertainty_score":0.013271809},"labels":[],"label_agreement":null},{"id":"W1490413238","doi":"10.1007/978-3-642-12098-5_5","title":"Dynamic Skyline Queries in Large Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"","keywords":"Skyline; Computer science; Pruning; Euclidean space; Graph; Set (abstract data type); Query optimization; Data mining; Spatial query; Metric space; Theoretical computer science; Algorithm; Web search query; Sargable; Information retrieval; Search engine; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.008112831594243572,"score_gpt":0.23515278624070535,"score_spread":0.22703995464646176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490413238","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.13354102,0.007364078,0.7960331,0.0045208167,0.0004499034,0.00028927665,0.005721937,0.010367559,0.04171227],"genre_scores_gemma":[0.5841846,0.005251787,0.3626633,0.00065264874,0.000722696,0.0002858971,0.011847261,0.0026617975,0.031730015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998857,0.00024163013,0.00006723361,0.00026171035,0.00042199277,0.00015033405],"domain_scores_gemma":[0.99609536,0.0022985262,0.00016888072,0.0009214127,0.00030361157,0.000212202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587373,0.0007671582,0.0013201797,0.0012325434,0.0011198332,0.002445367,0.0019477514,0.0012557893,0.0086489115],"category_scores_gemma":[0.0053383214,0.00074043893,0.00060114654,0.0043503987,0.0008023515,0.00865107,0.0021250208,0.0018305863,0.0019628007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010202031,0.00035228155,0.0031835702,0.0014883211,0.00014708728,0.0005606394,0.0009033557,0.12180924,0.020616032,0.26499897,0.19404723,0.39087304],"study_design_scores_gemma":[0.00019651663,0.00013242867,0.0012028109,0.00008665269,0.000083799525,0.0011080664,0.00046019338,0.4920593,0.011817679,0.41558713,0.0772175,0.000047928286],"about_ca_topic_score_codex":0.0015635935,"about_ca_topic_score_gemma":0.0023444647,"teacher_disagreement_score":0.0086489115,"about_ca_system_score_codex":0.0012227835,"about_ca_system_score_gemma":0.00067535124,"threshold_uncertainty_score":0.028933465},"labels":[],"label_agreement":null},{"id":"W1490460472","doi":"10.1007/978-3-540-69499-1_9","title":"Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"Western University","funders":"","keywords":"Polynomial basis; Finite field; Multiplication (music); Multiplier (economics); Basis (linear algebra); Computer science; Arithmetic; Polynomial; Normal basis; Binary number; Numerical digit; Finite field arithmetic; Computation; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Galois theory","score_opus":0.016925235766146494,"score_gpt":0.2441798441510097,"score_spread":0.22725460838486322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490460472","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.12100116,0.0047991807,0.6520826,0.001443842,0.0021956016,0.00030327038,0.0007575555,0.0018931123,0.21552376],"genre_scores_gemma":[0.5979105,0.004156653,0.2614201,0.00082038384,0.0014341341,0.00029547143,0.0011980605,0.00044956346,0.13231511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996935,0.000059449892,0.00003470196,0.000047920177,0.00012708276,0.000037390488],"domain_scores_gemma":[0.99964476,0.00009110169,0.000046738238,0.000116427975,0.00007973252,0.000021303644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038059082,0.00087912986,0.00045134634,0.0010515727,0.00073112984,0.0020806626,0.0006312146,0.00060436537,0.014619606],"category_scores_gemma":[0.0012279296,0.00036854096,0.00048157608,0.00151182,0.0008923524,0.0019489328,0.000798696,0.001445746,0.0059159463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009774709,0.000058336347,0.00012533297,0.000115119205,0.000008028277,0.00020255175,0.00016557194,0.0024577507,0.0053419275,0.86760914,0.0057467674,0.11807179],"study_design_scores_gemma":[0.000038117865,0.00014412792,0.0002516799,0.00008671636,0.000019823496,0.00078642066,0.00005743262,0.009622453,0.009482639,0.9293148,0.050159786,0.000035976078],"about_ca_topic_score_codex":0.00018730921,"about_ca_topic_score_gemma":0.00035105168,"teacher_disagreement_score":0.014619606,"about_ca_system_score_codex":0.0005871136,"about_ca_system_score_gemma":0.0005791318,"threshold_uncertainty_score":0.04890752},"labels":[],"label_agreement":null},{"id":"W1490473477","doi":"10.1007/3-540-44808-x_7","title":"Experiments on Adaptive Set Intersections for Text Retrieval Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Set (abstract data type); Factor (programming language); Algorithm; Measure (data warehouse); Theoretical computer science; Data mining","score_opus":0.043217197523913974,"score_gpt":0.2900568023509737,"score_spread":0.24683960482705972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490473477","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.959784,0.0025227244,0.027315294,0.00027065066,0.00027534176,0.0005778678,0.0014120252,0.0028634798,0.0049785855],"genre_scores_gemma":[0.919875,0.00088547735,0.06724279,0.000113118476,0.00017703578,0.0004634462,0.0052059344,0.00054366613,0.005493484],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9931298,0.0028383282,0.0010148168,0.0007659954,0.0017580012,0.0004930826],"domain_scores_gemma":[0.9465094,0.04186928,0.0011426976,0.0040924177,0.0055216504,0.00086453656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004561859,0.001265812,0.0026195229,0.0020942308,0.0018740678,0.0017790393,0.0025439675,0.0016927763,0.009762547],"category_scores_gemma":[0.032764133,0.00084754033,0.00096379296,0.0033761968,0.00090538786,0.0042460645,0.0020023335,0.0013972424,0.0026761924],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04886555,0.012780968,0.009982395,0.00494097,0.001219194,0.00070712395,0.002297622,0.22039334,0.112304054,0.007156982,0.018400805,0.560951],"study_design_scores_gemma":[0.0035757555,0.016309178,0.0083718235,0.00013090327,0.00096646225,0.0006834763,0.0015343418,0.799854,0.1497308,0.0076043634,0.0109937815,0.0002450846],"about_ca_topic_score_codex":0.005319709,"about_ca_topic_score_gemma":0.0028728081,"teacher_disagreement_score":0.009762547,"about_ca_system_score_codex":0.0012258033,"about_ca_system_score_gemma":0.0011762505,"threshold_uncertainty_score":0.032658994},"labels":[],"label_agreement":null},{"id":"W1490487555","doi":"10.1007/978-3-642-10331-5_30","title":"Automated Segmentation of Brain Tumors in MRI Using Force Data Clustering Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster analysis; Segmentation; Artificial intelligence; Boundary (topology); Pattern recognition (psychology); Image segmentation; Cluster (spacecraft); Magnetic resonance imaging; Algorithm; Computer vision; Mathematics","score_opus":0.033398451891719534,"score_gpt":0.3209498056747834,"score_spread":0.28755135378306385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490487555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039023414,0.00060242915,0.95461524,0.00017548817,0.0000786648,0.00014348971,0.00029003527,0.0019225702,0.0031486424],"genre_scores_gemma":[0.12179921,0.0004330951,0.8715565,0.00007848605,0.000056191468,0.000112363705,0.0006812012,0.00039947667,0.004883501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960667,0.00003302236,0.000022254728,0.00010796599,0.00016828472,0.00006182942],"domain_scores_gemma":[0.9995072,0.0001296098,0.000050167382,0.00008768684,0.00020620102,0.000019042425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004518993,0.0008345668,0.00080380205,0.0027774149,0.0010257537,0.0010558456,0.0012816375,0.0014092623,0.00309617],"category_scores_gemma":[0.0008431203,0.0005820123,0.0011115787,0.0018923222,0.00043611942,0.0009111171,0.00072943623,0.00053948193,0.0017961294],"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.0002769657,0.00012875022,0.0023753997,0.00025305283,0.00009680079,0.00027696267,0.0003307078,0.05620037,0.20246753,0.006459762,0.00895284,0.7221808],"study_design_scores_gemma":[0.00003182644,0.00014201103,0.008633874,0.00007808332,0.00009808715,0.0016579601,0.00020486246,0.7913519,0.16383502,0.010301923,0.023556164,0.000108358654],"about_ca_topic_score_codex":0.009679363,"about_ca_topic_score_gemma":0.014317939,"teacher_disagreement_score":0.009679363,"about_ca_system_score_codex":0.00075898244,"about_ca_system_score_gemma":0.0011965779,"threshold_uncertainty_score":0.019246101},"labels":[],"label_agreement":null},{"id":"W1490501152","doi":"10.1007/978-3-642-03348-3_32","title":"Crawling Deep Web Using a New Set Covering Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Windsor","funders":"","keywords":"Crawling; Computer science; Set (abstract data type); Algorithm; Set cover problem; Greedy algorithm; Web crawler; Domain (mathematical analysis); Data mining; Artificial intelligence; World Wide Web; Mathematics","score_opus":0.025397222463813478,"score_gpt":0.26016370992732113,"score_spread":0.23476648746350764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490501152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02815794,0.0005461796,0.96415275,0.00018440287,0.00019346701,0.00016693526,0.00044440205,0.004352668,0.0018012818],"genre_scores_gemma":[0.10761345,0.00023598896,0.88532346,0.00013372088,0.00017144463,0.0002615066,0.0017123251,0.0005185639,0.0040295445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724543,0.00047472937,0.00025430697,0.0005508966,0.0012711845,0.0002034454],"domain_scores_gemma":[0.9951533,0.0020738794,0.0002438501,0.0015478716,0.00077421893,0.00020679426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409609,0.0011843188,0.002894194,0.006474771,0.0016228365,0.002251062,0.0025896858,0.0022447438,0.0036373655],"category_scores_gemma":[0.006709521,0.0010452555,0.0022581299,0.005241362,0.00073994795,0.0035609724,0.0029410727,0.0014209293,0.0013647836],"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.0002545464,0.00047985683,0.0047023934,0.00028288693,0.00040375986,0.00030290568,0.00022698716,0.07680118,0.01689374,0.013431147,0.015485833,0.8707348],"study_design_scores_gemma":[0.000032460888,0.00009199203,0.0008000909,0.000017419758,0.00009552101,0.0003106585,0.000030959745,0.9746514,0.0047313985,0.014551908,0.0046618893,0.000024261912],"about_ca_topic_score_codex":0.0043255277,"about_ca_topic_score_gemma":0.008517152,"teacher_disagreement_score":0.006474771,"about_ca_system_score_codex":0.0008944329,"about_ca_system_score_gemma":0.0016366917,"threshold_uncertainty_score":0.012168229},"labels":[],"label_agreement":null},{"id":"W1490513798","doi":"10.1007/978-3-642-37087-8_3","title":"The Impact of Spatial Resolution and Representation on Human Mobility Predictability","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Predictability; Computer science; Global Positioning System; Credence; Discretization; Mobility model; Entropy (arrow of time); Data mining; Artificial intelligence; Machine learning; Telecommunications; Statistics; Mathematics","score_opus":0.03153008889618058,"score_gpt":0.33929434730941826,"score_spread":0.3077642584132377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490513798","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.8389991,0.0025530716,0.13538678,0.002124872,0.00020435338,0.000028643946,0.00069899275,0.00029610517,0.019708186],"genre_scores_gemma":[0.9939812,0.0003979008,0.0047436557,0.00003144544,0.000054357886,0.0000056780614,0.00012870015,0.000042699085,0.0006142034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.00030829827,0.000028344659,0.0001357705,0.00015148894,0.000103984654],"domain_scores_gemma":[0.9836295,0.014124309,0.0005394197,0.0009090801,0.00059863855,0.00019912313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015210225,0.00032719853,0.00041345364,0.00061415083,0.00043778532,0.0024565777,0.00052265107,0.00069876126,0.0022968177],"category_scores_gemma":[0.025790961,0.00047456694,0.00036709927,0.0012094728,0.0010496881,0.0038773187,0.0013792004,0.0008714707,0.00029534262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011775502,0.00018952099,0.067511655,0.0003483199,0.00023230033,0.00050024217,0.0010807713,0.6087094,0.014072491,0.092263274,0.00408504,0.20982946],"study_design_scores_gemma":[0.00003135198,0.00012850646,0.04125181,0.000059525002,0.000104841616,0.0003842492,0.0005716962,0.87824905,0.003996489,0.07357716,0.0015818562,0.00006348949],"about_ca_topic_score_codex":0.0047663064,"about_ca_topic_score_gemma":0.0028831486,"teacher_disagreement_score":0.0047663064,"about_ca_system_score_codex":0.0007003272,"about_ca_system_score_gemma":0.00045172637,"threshold_uncertainty_score":0.0094771385},"labels":[],"label_agreement":null},{"id":"W1490637409","doi":"10.1007/978-3-540-24581-0_3","title":"On How to Learn from a Stochastic Teacher or a Stochastic Compulsive Liar of Unknown Identity","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Computer science; Learning automata; Interval (graph theory); Point (geometry); Identity (music); Automaton; Artificial intelligence; Mechanism (biology); Space (punctuation); Stochastic process; Algorithm; Mathematics; Statistics","score_opus":0.024634053035175987,"score_gpt":0.2719790049346291,"score_spread":0.24734495189945313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490637409","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.06397267,0.0008859746,0.8638733,0.010929491,0.00025096437,0.00008623881,0.00022612863,0.0003869503,0.05938824],"genre_scores_gemma":[0.7587314,0.0014696576,0.14747128,0.0010679722,0.00021372475,0.00024286604,0.0003676945,0.0001243397,0.09031108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998147,0.00008759787,0.0000121242565,0.0000383436,0.000028340964,0.000018921817],"domain_scores_gemma":[0.9973152,0.0022813978,0.0000764619,0.00012622545,0.0001227486,0.00007797586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082082296,0.00029672473,0.00038931204,0.00015482624,0.00037574992,0.00083560095,0.00061917916,0.0010353175,0.007869973],"category_scores_gemma":[0.0070795817,0.00015273863,0.00033274668,0.00022695721,0.0015067899,0.002795966,0.0012240851,0.0013877493,0.0007090444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012233865,0.000060357397,0.0012535091,0.00016085009,0.000031467745,0.000063448126,0.00041097292,0.079107374,0.00050009345,0.7709405,0.0147002805,0.1326488],"study_design_scores_gemma":[0.000027798324,0.000038859063,0.00022152622,0.000033464603,0.000010904267,0.000032102715,0.00015122286,0.17889702,0.00050029473,0.81454873,0.0055280016,0.000010009897],"about_ca_topic_score_codex":0.0026470756,"about_ca_topic_score_gemma":0.0024382307,"teacher_disagreement_score":0.007869973,"about_ca_system_score_codex":0.0006031213,"about_ca_system_score_gemma":0.0007389111,"threshold_uncertainty_score":0.02632761},"labels":[],"label_agreement":null},{"id":"W1490682138","doi":"10.1007/978-3-642-02611-9_51","title":"A Novel Technique for Human Face Recognition Using Nonlinear Curvelet Feature Subspace","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Curvelet; Artificial intelligence; Pattern recognition (psychology); Kernel principal component analysis; Computer science; Principal component analysis; Facial recognition system; Kernel (algebra); Wavelet; Wavelet transform; Feature extraction; Subspace topology; Face (sociological concept); Kernel method; Support vector machine; Mathematics","score_opus":0.04356246535080898,"score_gpt":0.2926561831340138,"score_spread":0.24909371778320483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490682138","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.0059464457,0.00025902977,0.99151635,0.00007043936,0.00010632182,0.000041440842,0.000053960826,0.0008195204,0.0011865565],"genre_scores_gemma":[0.06617115,0.00078790664,0.9243151,0.00012607769,0.00013048573,0.00009924597,0.00032172506,0.00012803868,0.007920163],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964917,0.0000335027,0.000012007868,0.000060592814,0.00021792007,0.000026777938],"domain_scores_gemma":[0.99966836,0.000056991106,0.000018327075,0.00008687537,0.00014920588,0.000020270867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034352049,0.0005421498,0.0006783766,0.00069720304,0.00033947633,0.00048041376,0.0008077191,0.0006710636,0.003065685],"category_scores_gemma":[0.0005351696,0.00026958247,0.00045731154,0.001086511,0.00032688858,0.0010417427,0.000720241,0.00096439145,0.0027517253],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011942125,0.000092635164,0.0002982781,0.000093180264,0.000031335097,0.00008187032,0.00005261402,0.0037826358,0.27548948,0.0031549963,0.004301386,0.7125022],"study_design_scores_gemma":[0.00003563579,0.0003172599,0.0026365544,0.00002531587,0.00006810312,0.0018863741,0.00007215976,0.60929537,0.347862,0.003649959,0.034073386,0.00007788903],"about_ca_topic_score_codex":0.0008491627,"about_ca_topic_score_gemma":0.0015316411,"teacher_disagreement_score":0.003065685,"about_ca_system_score_codex":0.0002049291,"about_ca_system_score_gemma":0.0004039557,"threshold_uncertainty_score":0.010255694},"labels":[],"label_agreement":null},{"id":"W1490698933","doi":"10.1007/978-3-642-01671-4_2","title":"A Financial Option Based Grid Resources Pricing Model: Towards an Equilibrium between Service Quality for User and Profitability for Service Providers","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Manitoba","funders":"","keywords":"Profitability index; Computer science; Grid; Service provider; Grid computing; Service quality; Service (business); Quality of service; Database; Operations research; Finance; Business; Telecommunications; Marketing","score_opus":0.045443559703042355,"score_gpt":0.2982566306924363,"score_spread":0.25281307098939393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490698933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06185674,0.0007098765,0.87131274,0.0052925553,0.00031725032,0.00018823582,0.00064700824,0.00059969164,0.059075866],"genre_scores_gemma":[0.88858455,0.0006532709,0.06893287,0.0006003579,0.00021437084,0.0002639214,0.00032729088,0.00017849727,0.04024486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992797,0.00032440448,0.000020893765,0.00010791842,0.00016381235,0.00010341689],"domain_scores_gemma":[0.9992042,0.00039238323,0.00007925089,0.000044104083,0.000156498,0.00012356574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016662405,0.0010360611,0.001537797,0.0006579091,0.000875993,0.0036429083,0.004092341,0.0044806614,0.010118198],"category_scores_gemma":[0.003952763,0.0008829996,0.0009294288,0.00166375,0.0018121827,0.0037610661,0.0017414687,0.0027963223,0.0011748748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067417306,0.000079232734,0.00025792388,0.00004861707,0.000028441182,0.00013031639,0.000055376695,0.7729877,0.0005377285,0.21520762,0.0034459312,0.007153649],"study_design_scores_gemma":[0.000019702446,0.0000097002285,0.000046887497,0.000004870934,0.0000064122055,0.000017641296,0.000008946657,0.95921814,0.000043622673,0.04003746,0.0005773036,0.000009333175],"about_ca_topic_score_codex":0.007246891,"about_ca_topic_score_gemma":0.0050006257,"teacher_disagreement_score":0.010118198,"about_ca_system_score_codex":0.0027331884,"about_ca_system_score_gemma":0.0023370797,"threshold_uncertainty_score":0.033848703},"labels":[],"label_agreement":null},{"id":"W1490722843","doi":"10.1007/11812128_31","title":"Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parsing; Regular expression; Automaton; Programming language; Expression (computer science); Natural language processing; Artificial intelligence","score_opus":0.010131355331903085,"score_gpt":0.24302249351589006,"score_spread":0.23289113818398696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490722843","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.06346225,0.00013226517,0.8866833,0.00023280169,0.00019788244,0.00017693802,0.0006918141,0.043483414,0.0049394458],"genre_scores_gemma":[0.36175475,0.00019108907,0.6231351,0.00018072514,0.0000802575,0.0001901416,0.0019004951,0.006151286,0.0064162575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924767,0.00015215446,0.000085040214,0.000286776,0.00014205801,0.00008627469],"domain_scores_gemma":[0.9982169,0.0009375139,0.00009313813,0.0005287929,0.00018700185,0.000036589154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308516,0.00066867075,0.0009336598,0.0008712631,0.0008137721,0.0014990945,0.0011580036,0.000896991,0.0037684592],"category_scores_gemma":[0.0028366242,0.0011378326,0.0017552217,0.00097026065,0.0011418913,0.0024129567,0.0013587453,0.0015424276,0.0022130474],"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.0014136571,0.00053951715,0.007893508,0.0017886532,0.00040539572,0.0025162941,0.003859289,0.08824848,0.16880484,0.20307876,0.02478346,0.49666816],"study_design_scores_gemma":[0.0001422281,0.0004368251,0.001929625,0.0002626593,0.00063988456,0.0009772001,0.00059328665,0.46824273,0.2480192,0.23042504,0.048123028,0.00020829329],"about_ca_topic_score_codex":0.0014453558,"about_ca_topic_score_gemma":0.0021021322,"teacher_disagreement_score":0.0037684592,"about_ca_system_score_codex":0.0005513794,"about_ca_system_score_gemma":0.0011168038,"threshold_uncertainty_score":0.0126068},"labels":[],"label_agreement":null},{"id":"W1490766191","doi":"10.1007/978-3-540-85990-1_61","title":"MRI Compatibility of Robot Actuation Techniques – A Comparative Study","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":97,"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":"DOD Prostate Cancer Research Program; National Institute of Biomedical Imaging and Bioengineering; Congressionally Directed Medical Research Programs; National Cancer Institute; National Institutes of Health; National Science Foundation","keywords":"Scanner; Ultrasonic motor; Computer science; Actuator; Pneumatic actuator; Motion controller; Ultrasonic sensor; Acoustics; Motion control; Robot; Computer vision; Artificial intelligence; Vibration; Physics","score_opus":0.05267282105431732,"score_gpt":0.3747910832567023,"score_spread":0.322118262202385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490766191","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.9464065,0.009202308,0.030913902,0.00012968412,0.0001265193,0.00013288452,0.00016028658,0.00009570683,0.012832328],"genre_scores_gemma":[0.98958194,0.0026439365,0.0054829423,0.000058233512,0.00008365665,0.0000362862,0.00012598872,0.00006198618,0.0019251454],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811894,0.0009144838,0.00012348697,0.00010809119,0.0006062207,0.00012872752],"domain_scores_gemma":[0.98726857,0.009570613,0.0008545322,0.00054145796,0.0015802516,0.00018452624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031993885,0.00047249105,0.00051597686,0.001970694,0.00038389955,0.0007372852,0.00064233126,0.00088406575,0.0057989405],"category_scores_gemma":[0.011019666,0.00033914912,0.00059462583,0.0011479543,0.00048993254,0.0012617753,0.0005351979,0.0003100729,0.0010234251],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.024366,0.0018046324,0.05275492,0.0024616886,0.0003653396,0.0019934068,0.0016389079,0.0055502206,0.492773,0.0018740725,0.0007410647,0.41367674],"study_design_scores_gemma":[0.0006145622,0.054179918,0.41129622,0.0006693492,0.0019132751,0.025992049,0.0040031173,0.0282057,0.4508512,0.0022337416,0.019780437,0.00026038612],"about_ca_topic_score_codex":0.0003164523,"about_ca_topic_score_gemma":0.00032273267,"teacher_disagreement_score":0.0057989405,"about_ca_system_score_codex":0.00022446559,"about_ca_system_score_gemma":0.00028828304,"threshold_uncertainty_score":0.019399345},"labels":[],"label_agreement":null},{"id":"W1490817772","doi":"10.1007/978-3-642-13681-8_69","title":"Classification of High-Resolution NMR Spectra Based on Complex Wavelet Domain Feature Selection and Kernel-Induced Random Forest","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random forest; Pattern recognition (psychology); Artificial intelligence; Feature extraction; Wavelet; Feature selection; Kernel (algebra); Wavelet transform; Discrete wavelet transform; Computer science; Mathematics; Nuclear magnetic resonance; Physics","score_opus":0.018991798550626476,"score_gpt":0.2548564452438629,"score_spread":0.23586464669323645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490817772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050332684,0.0005997904,0.94687116,0.00011254198,0.000060434217,0.000048693117,0.00017653729,0.0011568886,0.00064128067],"genre_scores_gemma":[0.37141672,0.00074508163,0.6237898,0.00008051364,0.00011855818,0.000090988004,0.0012848246,0.00021233993,0.0022610994],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962616,0.00006927733,0.000027522006,0.00008638526,0.00013381551,0.00005676901],"domain_scores_gemma":[0.9991209,0.00041595404,0.00008087145,0.00008819076,0.00026359045,0.000030533887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661162,0.0006703496,0.0010825518,0.0012576986,0.00032688328,0.00078672153,0.0008508867,0.00075088296,0.001164454],"category_scores_gemma":[0.0017440536,0.0002359704,0.0013002797,0.0013180538,0.00028769355,0.0009773625,0.00033667136,0.0007368627,0.00077691866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027758276,0.00025022807,0.0020453173,0.00015790177,0.0000880348,0.000108732616,0.000043682125,0.06331413,0.04990383,0.0022068098,0.0030142234,0.8785894],"study_design_scores_gemma":[0.000008198535,0.000047814592,0.0017321659,0.000007957729,0.000035151454,0.000095286574,0.000011252611,0.98478436,0.010264838,0.0023664807,0.000633358,0.0000132210125],"about_ca_topic_score_codex":0.0011276864,"about_ca_topic_score_gemma":0.0014755642,"teacher_disagreement_score":0.0012576986,"about_ca_system_score_codex":0.00025983318,"about_ca_system_score_gemma":0.00035502005,"threshold_uncertainty_score":0.006167114},"labels":[],"label_agreement":null},{"id":"W1490843286","doi":"10.1007/978-3-642-14031-0_17","title":"Finding Maximum Edge Bicliques in Convex Bipartite Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Hospital for Sick Children; Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Complete bipartite graph; Vertex (graph theory); Cardinality (data modeling); Mathematics; Edge-transitive graph; Discrete mathematics; Graph; Computer science; Graph power; Line graph","score_opus":0.01211060963806525,"score_gpt":0.21813808290157072,"score_spread":0.20602747326350546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490843286","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.17130348,0.0017071628,0.7828745,0.0014814516,0.00016557399,0.00055766903,0.0022695703,0.0015908396,0.038049676],"genre_scores_gemma":[0.3091081,0.0009612602,0.6691044,0.00046786616,0.00011867765,0.0005687012,0.0033996517,0.0010041432,0.015267173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990313,0.00034472867,0.000041299852,0.00023449116,0.00017707938,0.00017112831],"domain_scores_gemma":[0.99602354,0.0027687864,0.00028447434,0.0002550778,0.00037511066,0.00029304414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097128557,0.0021217493,0.0035028828,0.0031088032,0.0021284998,0.002971568,0.0033787927,0.0034584454,0.01322401],"category_scores_gemma":[0.007865085,0.0030795375,0.0014755405,0.0042825458,0.0015842076,0.0047013075,0.0033763333,0.0036044796,0.0027456305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014066849,0.0006980201,0.0043804105,0.003023648,0.00026229455,0.00037456327,0.0009185777,0.41924292,0.014069154,0.17809513,0.04918366,0.32834488],"study_design_scores_gemma":[0.00017816115,0.00023869079,0.0013256882,0.00026800152,0.00006106904,0.00029473702,0.0006418963,0.703504,0.005482077,0.28081802,0.0071303924,0.000057191024],"about_ca_topic_score_codex":0.0028517817,"about_ca_topic_score_gemma":0.0051306197,"teacher_disagreement_score":0.01322401,"about_ca_system_score_codex":0.0013841452,"about_ca_system_score_gemma":0.0010245513,"threshold_uncertainty_score":0.044238687},"labels":[],"label_agreement":null},{"id":"W1490955312","doi":"10.1007/3-540-45876-x_7","title":"Profit Mining: From Patterns to Actions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Statistic; Data mining; Profit (economics); Obstacle; Artificial intelligence; Operations research; Statistics; Mathematics","score_opus":0.03961843418157557,"score_gpt":0.2697600465324612,"score_spread":0.23014161235088565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490955312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040095117,0.0035306977,0.93271613,0.0025403257,0.00026102446,0.0002608744,0.0043333066,0.007029614,0.009232929],"genre_scores_gemma":[0.3196667,0.0029281487,0.6611234,0.00052746176,0.00027252073,0.00033394125,0.0067223706,0.0004915741,0.007933915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.0001707672,0.00008498987,0.00030756486,0.0003558697,0.000060768612],"domain_scores_gemma":[0.99797183,0.0012864431,0.0001626318,0.00028574333,0.00020942706,0.000083914456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008721041,0.00082250906,0.0008713515,0.001916908,0.0004830585,0.001911632,0.0015701536,0.0007152481,0.0033431835],"category_scores_gemma":[0.005505607,0.00054726587,0.00096962304,0.0025037692,0.0007534928,0.0037020221,0.0013458072,0.001315674,0.0018655059],"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.00022441914,0.0002046513,0.0070292763,0.00046018886,0.00010949098,0.00028467507,0.00024813353,0.016897185,0.0019174262,0.034658194,0.028905237,0.90906113],"study_design_scores_gemma":[0.00007085352,0.00011554199,0.0041754013,0.0002474163,0.00013859064,0.00085443864,0.00037230583,0.45384732,0.0074438876,0.5012791,0.031408228,0.000046831232],"about_ca_topic_score_codex":0.0016937082,"about_ca_topic_score_gemma":0.0023140681,"teacher_disagreement_score":0.0033431835,"about_ca_system_score_codex":0.00051995023,"about_ca_system_score_gemma":0.000978868,"threshold_uncertainty_score":0.011184096},"labels":[],"label_agreement":null},{"id":"W1491116678","doi":"10.1007/978-3-540-74000-1_22","title":"Bayesian Belief Network Approach for Analysis of Intercultural Collaboration in Virtual Communities Using Social Capital Theory","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Capital and Networks","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Bayesian network; Social capital; Bayesian probability; Knowledge management; Work (physics); Computer science; Social network (sociolinguistics); Data science; Artificial intelligence; Sociology; Engineering; World Wide Web; Social science","score_opus":0.04169989322824994,"score_gpt":0.32094958027644843,"score_spread":0.27924968704819847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491116678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04347507,0.0005888412,0.9527419,0.00043601458,0.000034219538,0.00008016924,0.00019151163,0.00009387843,0.0023583844],"genre_scores_gemma":[0.7754038,0.0011930559,0.21613342,0.00009048759,0.00011926175,0.0005059916,0.00060545723,0.00010423792,0.0058443244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976573,0.0014744409,0.000068056106,0.00032492657,0.00031168002,0.00016351926],"domain_scores_gemma":[0.98183376,0.016417071,0.00056314305,0.00033378854,0.00058672926,0.00026555735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005914295,0.0009122764,0.0016074835,0.002344166,0.0010647445,0.0023948858,0.002777201,0.001931493,0.0043765814],"category_scores_gemma":[0.021743404,0.0008903239,0.0015013096,0.0025952603,0.0015326192,0.0059434264,0.0020976637,0.0028838755,0.00044334945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014867296,0.00021515196,0.0048484043,0.00012511831,0.00035432054,0.00011801075,0.0005897478,0.70621926,0.0004993239,0.23889162,0.0015627454,0.046427608],"study_design_scores_gemma":[0.0000045308075,0.0000104013025,0.00047490696,0.000010458785,0.0000163123,0.0000095820005,0.00004390951,0.9516856,0.000049585506,0.04747895,0.00020541766,0.000010354449],"about_ca_topic_score_codex":0.020378718,"about_ca_topic_score_gemma":0.013819915,"teacher_disagreement_score":0.020378718,"about_ca_system_score_codex":0.0026926359,"about_ca_system_score_gemma":0.0016371047,"threshold_uncertainty_score":0.04052019},"labels":[],"label_agreement":null},{"id":"W1491129446","doi":"10.1007/978-3-540-39857-8_29","title":"Using MDP Characteristics to Guide Exploration in Reinforcement Learning","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Markov decision process; Artificial intelligence; Bellman equation; Machine learning; State space; Computation; Focus (optics); Variance (accounting); Markov process; Mathematical optimization; Algorithm","score_opus":0.044656664918599175,"score_gpt":0.28567957287483425,"score_spread":0.24102290795623507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491129446","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.021869354,0.00012819156,0.97554183,0.00013390998,0.000027564478,0.000044829976,0.000045377372,0.00031118467,0.0018977593],"genre_scores_gemma":[0.687607,0.00023066466,0.3093768,0.00009960523,0.000034756078,0.00028818927,0.00014014395,0.0002587412,0.001964065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954695,0.00015324929,0.00003746092,0.000059975868,0.00016519958,0.000037207767],"domain_scores_gemma":[0.9938207,0.0047074547,0.00045013017,0.00024599687,0.0005851838,0.00019061156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168813,0.00081232673,0.000898946,0.0009391892,0.00035366561,0.0007876667,0.0008219551,0.00084032863,0.0021822492],"category_scores_gemma":[0.012363517,0.0007095213,0.00041917912,0.0005901018,0.00077751494,0.0019736728,0.0011867265,0.0016895834,0.00026842474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107328495,0.00003898388,0.0009800561,0.00007888596,0.00001843329,0.000052101568,0.0000611246,0.9256065,0.001664543,0.022986755,0.00066835165,0.047737062],"study_design_scores_gemma":[0.0000071892705,0.000018091552,0.000061281375,0.0000058575306,0.0000025099805,0.000012272298,0.000003868627,0.99336123,0.00037299332,0.005947025,0.00020459175,0.0000030062545],"about_ca_topic_score_codex":0.00193916,"about_ca_topic_score_gemma":0.0024612024,"teacher_disagreement_score":0.0021822492,"about_ca_system_score_codex":0.00083336217,"about_ca_system_score_gemma":0.0009269786,"threshold_uncertainty_score":0.0089277625},"labels":[],"label_agreement":null},{"id":"W1491181407","doi":"10.1007/11853862_28","title":"Social Visualization Encouraging Participation in Online Communities","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Telus (Canada)","funders":"","keywords":"Computer science; Visualization; World Wide Web; Human–computer interaction; Data science; Artificial intelligence","score_opus":0.05362069239084244,"score_gpt":0.3750332031351623,"score_spread":0.32141251074431987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491181407","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.8701506,0.0005998778,0.0363332,0.0018524019,0.00038242392,0.00030976825,0.000153436,0.0023766288,0.08784158],"genre_scores_gemma":[0.9745079,0.00008889916,0.013318799,0.00007470477,0.000054770808,0.00012252814,0.00007250468,0.00010653219,0.011653447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986172,0.000841835,0.000025155352,0.00010573502,0.00029806173,0.00011204904],"domain_scores_gemma":[0.9902728,0.0073909843,0.00044796342,0.0006155646,0.0004895571,0.00078305975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001810798,0.00036539193,0.00027124744,0.0006041929,0.0013198875,0.0018050737,0.0006541144,0.0009837671,0.013325417],"category_scores_gemma":[0.009868965,0.0001828932,0.00023752291,0.0005014184,0.0005017701,0.0016936274,0.0023410688,0.000936211,0.0010308179],"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.0032738345,0.0082202805,0.021007212,0.0013900149,0.00012400415,0.0008682089,0.043765757,0.0056041377,0.09281012,0.043953992,0.048072,0.7309105],"study_design_scores_gemma":[0.002645712,0.0088734655,0.13464923,0.0011138715,0.00050058437,0.0014247652,0.056424588,0.14827551,0.12548101,0.18698451,0.33326483,0.00036191609],"about_ca_topic_score_codex":0.0010111448,"about_ca_topic_score_gemma":0.0028074153,"teacher_disagreement_score":0.013325417,"about_ca_system_score_codex":0.00030344113,"about_ca_system_score_gemma":0.0005154666,"threshold_uncertainty_score":0.044577956},"labels":[],"label_agreement":null},{"id":"W1491247056","doi":"10.1007/3-540-45486-1_28","title":"Towards an Automated Citation Classifier","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":98,"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":"Classifier (UML); Computer science; Citation; Artificial intelligence; Classification scheme; Pattern recognition (psychology); Data mining; Machine learning; World Wide Web","score_opus":0.023392352280063335,"score_gpt":0.29233770733267594,"score_spread":0.26894535505261263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491247056","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.026722357,0.0032866325,0.9341973,0.0028058677,0.0012558085,0.00039309775,0.0044879923,0.01909815,0.007752751],"genre_scores_gemma":[0.101557866,0.0013965981,0.8677128,0.0007714134,0.0014033323,0.00045859118,0.009400361,0.0005338285,0.016765267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969472,0.0005373363,0.00030988376,0.00071201555,0.0012842922,0.00020931402],"domain_scores_gemma":[0.9909524,0.0037403102,0.00035393232,0.0008743309,0.0037903416,0.00028872656],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0034672455,0.0010163201,0.002958194,0.010959267,0.0023861092,0.0051415404,0.0029762916,0.0036905115,0.0053455727],"category_scores_gemma":[0.014686856,0.00065967813,0.0017996142,0.00677029,0.0006949731,0.0055820635,0.0024956223,0.0025519598,0.008366441],"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.00017476574,0.00044449195,0.004579974,0.00028571175,0.00014555051,0.0001693621,0.00008360104,0.008004805,0.0121158045,0.015989048,0.05045343,0.90755355],"study_design_scores_gemma":[0.0000795458,0.0001722092,0.0028616437,0.00020044114,0.00034791825,0.00061778974,0.00020093052,0.83154553,0.026366796,0.080797456,0.056733776,0.00007590205],"about_ca_topic_score_codex":0.0030942236,"about_ca_topic_score_gemma":0.0055457153,"teacher_disagreement_score":0.98904073,"about_ca_system_score_codex":0.0009807962,"about_ca_system_score_gemma":0.0028893268,"threshold_uncertainty_score":0.018336773},"labels":[],"label_agreement":null},{"id":"W1491260230","doi":"10.1007/978-3-642-14977-1_7","title":"Speculative Abductive Reasoning for Hierarchical Agent Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Soundness; Computer science; Abductive reasoning; Completeness (order theory); Non-monotonic logic; Key (lock); Context (archaeology); Reasoning system; Artificial intelligence; Negation; Multi-agent system; Theoretical computer science; Programming language; Computer security","score_opus":0.020333590905234244,"score_gpt":0.25884820157656646,"score_spread":0.23851461067133223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491260230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019186867,0.0009960952,0.9653415,0.0007562775,0.00005358043,0.00009815958,0.00014684237,0.00066127523,0.012759385],"genre_scores_gemma":[0.468949,0.0008605481,0.5227599,0.00011118217,0.00007701922,0.00011494844,0.00049098436,0.00008755715,0.0065486846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988249,0.00042959675,0.00012006603,0.00010692417,0.00043041937,0.00008811126],"domain_scores_gemma":[0.9973788,0.0019282835,0.00010242168,0.00035902497,0.00017439823,0.000057137808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020835765,0.00072591554,0.0006421381,0.0008647842,0.0008591273,0.0021752403,0.0022521045,0.001109398,0.0045047775],"category_scores_gemma":[0.006038308,0.00083463284,0.0009592336,0.0008476409,0.002507392,0.0035449753,0.0023027752,0.0024787514,0.00047418888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014998349,0.000058565576,0.00073369866,0.00026280573,0.000082694656,0.00031304112,0.00065749063,0.22054066,0.0025574563,0.6892853,0.0038311428,0.08152714],"study_design_scores_gemma":[0.000022855396,0.000009812711,0.000080549566,0.000024356512,0.000019120087,0.00003307914,0.00006428657,0.49190205,0.0010037905,0.50370985,0.0031223688,0.000007869155],"about_ca_topic_score_codex":0.0061030434,"about_ca_topic_score_gemma":0.008208544,"teacher_disagreement_score":0.0061030434,"about_ca_system_score_codex":0.0014150254,"about_ca_system_score_gemma":0.0009991751,"threshold_uncertainty_score":0.015069962},"labels":[],"label_agreement":null},{"id":"W1491285536","doi":"10.1007/978-3-540-27824-5_77","title":"Detection of Equalization Errors in Time-Varying Channels","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Robustness (evolution); Equalization (audio); Channel (broadcasting); Algorithm; Computational complexity theory; Adaptive equalizer; Blind equalization; Telecommunications","score_opus":0.020511913197482703,"score_gpt":0.26584284384311957,"score_spread":0.24533093064563688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491285536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060612578,0.00071202836,0.93544626,0.00016724832,0.00012272719,0.000018845913,0.00006635976,0.0006662968,0.0021876304],"genre_scores_gemma":[0.60081303,0.0014751018,0.38207018,0.00020979112,0.00019205434,0.00004996109,0.0003418427,0.00014124849,0.014706785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995407,0.000087495486,0.000027062682,0.00009069935,0.00018551646,0.000068624926],"domain_scores_gemma":[0.9983582,0.0012285537,0.00009880074,0.000117091025,0.00017010682,0.000027236696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059257186,0.00066536583,0.00074392796,0.000499293,0.0002376269,0.0006881046,0.00063808216,0.0014134519,0.0017270928],"category_scores_gemma":[0.003270516,0.00035636115,0.00024479255,0.00046862705,0.0005002798,0.0010760992,0.00086411403,0.0006919008,0.0005921289],"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.0014230323,0.00015850029,0.0017673008,0.00029907777,0.0001447771,0.00029688477,0.00018139854,0.07612347,0.18026222,0.018504817,0.002240474,0.71859807],"study_design_scores_gemma":[0.00008963353,0.0002705448,0.0041131396,0.000066673674,0.000086873806,0.0010504618,0.000048667334,0.70588064,0.26812565,0.017155485,0.00305268,0.000059568836],"about_ca_topic_score_codex":0.00041818552,"about_ca_topic_score_gemma":0.0007010588,"teacher_disagreement_score":0.0017270928,"about_ca_system_score_codex":0.00018621422,"about_ca_system_score_gemma":0.00028749448,"threshold_uncertainty_score":0.0057777166},"labels":[],"label_agreement":null},{"id":"W1491296979","doi":"10.1007/11935148_17","title":"Integrating Data from Maps on the World-Wide Web","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Completeness (order theory); Data mining; Precision and recall; Process (computing); Information retrieval; Data integration; Mathematics","score_opus":0.033943154934804716,"score_gpt":0.25342368495600515,"score_spread":0.21948053002120044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491296979","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.12812412,0.007870822,0.6886536,0.004159135,0.0010800249,0.00047036962,0.030378299,0.035685144,0.103578575],"genre_scores_gemma":[0.4559531,0.008958347,0.46932212,0.00039153927,0.00031543637,0.00016657883,0.04341837,0.0031353624,0.01833914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988059,0.00022220334,0.000074926895,0.00016039406,0.0006732202,0.00006340185],"domain_scores_gemma":[0.99788195,0.00090140314,0.00009303844,0.00052413024,0.0004972814,0.00010223332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006749,0.0007337001,0.0006759604,0.00806325,0.00078876107,0.006632113,0.0009999326,0.0007282103,0.0054642917],"category_scores_gemma":[0.0075976746,0.0006031374,0.00089680473,0.014652092,0.0005241762,0.0073744003,0.0034210782,0.0009259899,0.002797292],"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.00022646699,0.0002151898,0.017996239,0.0013385717,0.0005729017,0.00107055,0.002339244,0.017924828,0.0084942095,0.03450368,0.05769822,0.8576199],"study_design_scores_gemma":[0.000050669893,0.000090877955,0.023264268,0.0006998306,0.00095486885,0.001090666,0.005565538,0.13455753,0.038383033,0.2247621,0.5703423,0.00023837721],"about_ca_topic_score_codex":0.012036109,"about_ca_topic_score_gemma":0.02204082,"teacher_disagreement_score":0.012036109,"about_ca_system_score_codex":0.00055398466,"about_ca_system_score_gemma":0.0009834503,"threshold_uncertainty_score":0.0239321},"labels":[],"label_agreement":null},{"id":"W1491300721","doi":"10.1007/11821069_25","title":"The Lempel-Ziv Complexity of Fixed Points of Morphisms","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Morphism; Combinatorics on words; Measure (data warehouse); Word (group theory); Complexity class; Mathematics; Fixed point; Discrete mathematics; Time complexity; Computational complexity theory; Function (biology); Combinatorics; Computer science; Algorithm; Data mining","score_opus":0.025591890400312532,"score_gpt":0.2466015201112427,"score_spread":0.22100962971093016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491300721","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.55161256,0.0097228475,0.17685746,0.00877289,0.00048292073,0.00009820201,0.0015298498,0.0005602336,0.250363],"genre_scores_gemma":[0.959754,0.003056799,0.015287545,0.0003947699,0.0005997872,0.00015757841,0.00081655587,0.00017351571,0.019759493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820876,0.00036020996,0.000091726826,0.0003171686,0.00074744225,0.00027466647],"domain_scores_gemma":[0.9943962,0.0039761406,0.00035794912,0.0005607089,0.00037913636,0.0003298681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001538823,0.0009053887,0.00183325,0.0043407576,0.0025220672,0.006656431,0.002244843,0.0021441723,0.010432142],"category_scores_gemma":[0.011002612,0.0009488455,0.0011984702,0.005162128,0.005827983,0.015409873,0.003880707,0.0056211906,0.0013361711],"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.00005428115,0.0000145767135,0.00029678064,0.000051581937,0.000011666389,0.000039890692,0.00019727382,0.0024281475,0.00031366586,0.9883406,0.0012572316,0.006994188],"study_design_scores_gemma":[0.000010541767,0.0000068134004,0.00022398638,0.000014978043,0.000008060869,0.000033403216,0.000039291433,0.003710996,0.00022087245,0.9942713,0.0014475847,0.000012235943],"about_ca_topic_score_codex":0.0018409649,"about_ca_topic_score_gemma":0.0012150013,"teacher_disagreement_score":0.010432142,"about_ca_system_score_codex":0.004460225,"about_ca_system_score_gemma":0.0010485442,"threshold_uncertainty_score":0.034899056},"labels":[],"label_agreement":null},{"id":"W1491353118","doi":"10.1007/978-3-642-31900-6_49","title":"Multiple Criteria Decision Analysis with Game-Theoretic Rough Sets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Computer science; Context (archaeology); Extension (predicate logic); Decision rule; Game theory; Feature (linguistics); Dominance-based rough set approach; Artificial intelligence; Operations research; Data mining; Mathematical economics; Mathematics","score_opus":0.01646101339085808,"score_gpt":0.25592940809557047,"score_spread":0.23946839470471237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491353118","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.0028829721,0.00088841014,0.9920512,0.0001862872,0.00006625359,0.00007165729,0.000041526513,0.000037804446,0.0037739717],"genre_scores_gemma":[0.29918092,0.0018790431,0.6943082,0.0001104061,0.00020270685,0.00048536362,0.00012936951,0.0000458081,0.0036582546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9845435,0.010538575,0.0006520374,0.00068394083,0.0031551074,0.00042687988],"domain_scores_gemma":[0.9929889,0.005768946,0.00033939022,0.00031118482,0.00044051863,0.00015114377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009563865,0.0021896523,0.0035768342,0.0023422807,0.00081906177,0.005480577,0.002690217,0.0014401905,0.0029972715],"category_scores_gemma":[0.014573565,0.0012756415,0.003783687,0.0030736597,0.0022647122,0.004343846,0.0027418414,0.003514334,0.00049562874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013676369,0.000106788924,0.00023603032,0.00045726227,0.00043371195,0.00014382962,0.00025569406,0.39647418,0.00072986376,0.54210466,0.0017953365,0.057125855],"study_design_scores_gemma":[0.00003459631,0.000095972275,0.00012830758,0.000075255324,0.00008662538,0.000057582183,0.000051879175,0.5527074,0.00034102995,0.44452277,0.0018492244,0.000049420436],"about_ca_topic_score_codex":0.0019024188,"about_ca_topic_score_gemma":0.0015030317,"teacher_disagreement_score":0.009563865,"about_ca_system_score_codex":0.0029157156,"about_ca_system_score_gemma":0.0017250716,"threshold_uncertainty_score":0.05057913},"labels":[],"label_agreement":null},{"id":"W1491355838","doi":"10.1007/978-3-540-27796-5_18","title":"Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Computer science; Fault tolerance; Relaxation (psychology); Order (exchange); Power (physics); Theoretical computer science; Algorithm; Distributed computing","score_opus":0.014928249820409958,"score_gpt":0.21750464064583877,"score_spread":0.2025763908254288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491355838","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.006401256,0.00061465945,0.9779951,0.0005123699,0.00010877491,0.00004613249,0.00003056421,0.00015235814,0.01413884],"genre_scores_gemma":[0.507927,0.0034036462,0.45075,0.0006683788,0.00055048673,0.00036835813,0.0001398115,0.00019773375,0.035994716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993376,0.00015668946,0.000036453337,0.000064658445,0.00033217377,0.00007244014],"domain_scores_gemma":[0.9988979,0.0006054803,0.000089721136,0.00018298226,0.00019980612,0.000024129884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743651,0.0006742522,0.0006775874,0.0011972374,0.0008413141,0.0026588673,0.0014251372,0.0012693711,0.0039314204],"category_scores_gemma":[0.002444976,0.00051040796,0.00053841935,0.0014878128,0.0015840778,0.0034283183,0.00078387035,0.0011493494,0.0005496033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022501024,0.000030091785,0.00010179376,0.00006794702,0.0000101420455,0.00003843692,0.00008750843,0.027147515,0.0022212367,0.9329887,0.0016810867,0.03560294],"study_design_scores_gemma":[0.000017977038,0.00007327336,0.0000794944,0.00003530511,0.00004312599,0.00019882938,0.00006461906,0.28971183,0.0054063024,0.6853658,0.018980496,0.000022804805],"about_ca_topic_score_codex":0.0006846677,"about_ca_topic_score_gemma":0.00095753936,"teacher_disagreement_score":0.0039314204,"about_ca_system_score_codex":0.0017606674,"about_ca_system_score_gemma":0.00075959996,"threshold_uncertainty_score":0.013151944},"labels":[],"label_agreement":null},{"id":"W1491384312","doi":"10.1007/11599555_65","title":"Integer Factorization by a Parallel GNFS Algorithm for Public Key Cryptosystems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"St. Francis Xavier University","funders":"","keywords":"Cryptosystem; Computer science; Integer factorization; Public-key cryptography; Speedup; Algorithm; Integer (computer science); Factorization; Encryption; Factoring; Factor (programming language); Key (lock); Theoretical computer science; Cryptography; Parallel computing; Computer network","score_opus":0.01616948550478784,"score_gpt":0.23353859449138292,"score_spread":0.2173691089865951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491384312","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.04569111,0.0014523477,0.90413773,0.00080896524,0.00052961835,0.00018301235,0.00020305203,0.0037479836,0.043246213],"genre_scores_gemma":[0.32437402,0.0010429022,0.6321172,0.00029746644,0.00045791827,0.00019707682,0.0006033642,0.000507151,0.040402915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993338,0.000121416946,0.000040087507,0.00012398987,0.00028426424,0.00009632445],"domain_scores_gemma":[0.9995852,0.00010905478,0.000025670683,0.00017846741,0.000078124125,0.000023514343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507801,0.00088882237,0.00075085653,0.00089341373,0.0009373048,0.0014188692,0.000742637,0.0006054418,0.01150521],"category_scores_gemma":[0.0012772116,0.0003492246,0.0006793697,0.0009883633,0.0010323928,0.0023741245,0.0011258932,0.0012646501,0.004061119],"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.0010271437,0.00021514378,0.0004568031,0.00026649944,0.00005744857,0.00015149835,0.00016624991,0.032830775,0.030259691,0.23087725,0.021740723,0.6819508],"study_design_scores_gemma":[0.00038384215,0.0002986133,0.0005173485,0.000113351314,0.00006695744,0.00078584446,0.00012394098,0.2583339,0.054857247,0.6102205,0.07422358,0.00007489057],"about_ca_topic_score_codex":0.0010800605,"about_ca_topic_score_gemma":0.0017351105,"teacher_disagreement_score":0.01150521,"about_ca_system_score_codex":0.0011398483,"about_ca_system_score_gemma":0.0010333001,"threshold_uncertainty_score":0.038488805},"labels":[],"label_agreement":null},{"id":"W149151211","doi":"10.1007/978-3-319-10840-7_12","title":"Fast Frequent Pattern Detection Using Prime Numbers","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scalability; Prime (order theory); Representation (politics); Data mining; Space (punctuation); Process (computing); Database; Mathematics; Combinatorics; Programming language","score_opus":0.018600121928188044,"score_gpt":0.2501351124034765,"score_spread":0.23153499047528847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149151211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018812628,0.0019955905,0.97058624,0.00031954574,0.00029428475,0.00016448995,0.00061713654,0.004230638,0.0029793791],"genre_scores_gemma":[0.11973987,0.0009646419,0.8721678,0.0001468545,0.0002058779,0.00022575348,0.0017180373,0.00023698232,0.0045942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.00030163492,0.00016239398,0.00042116648,0.0006539505,0.000103817416],"domain_scores_gemma":[0.9948021,0.0030564906,0.00030813192,0.0009028607,0.00078054273,0.00014995283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015381405,0.0012244147,0.0016328567,0.003752735,0.000784571,0.0023934848,0.0015054696,0.0008652643,0.008244383],"category_scores_gemma":[0.009540375,0.00089166395,0.0011802679,0.003638195,0.0006452451,0.0044287373,0.0017285255,0.0017015346,0.00543207],"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.0010059836,0.00014569699,0.0029453868,0.00072646746,0.00012010441,0.00043464926,0.00015651858,0.010222299,0.02180845,0.03601666,0.014752496,0.9116652],"study_design_scores_gemma":[0.000335688,0.0006429533,0.002673509,0.00024099268,0.0001754091,0.004220232,0.00020830943,0.6034971,0.040047184,0.30373982,0.04407542,0.00014349457],"about_ca_topic_score_codex":0.0005566436,"about_ca_topic_score_gemma":0.00056902564,"teacher_disagreement_score":0.008244383,"about_ca_system_score_codex":0.00052496674,"about_ca_system_score_gemma":0.000924682,"threshold_uncertainty_score":0.027580261},"labels":[],"label_agreement":null},{"id":"W1491529421","doi":"10.1007/3-540-36379-3_25","title":"New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex cover; Planar graph; Disjoint sets; Treewidth; Mathematics; Vertex (graph theory); Feedback vertex set; Bounded function; Time complexity; Constant (computer programming); Binary logarithm; Kernelization; Cover (algebra); Discrete mathematics; Parameterized complexity; Graph; Pathwidth; Computer science; Mathematical analysis; Line graph","score_opus":0.03020348838626619,"score_gpt":0.276874548479269,"score_spread":0.24667106009300283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491529421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032589518,0.0010887763,0.9468972,0.0008545137,0.00024360817,0.00034705206,0.0005464719,0.0036577296,0.0137751885],"genre_scores_gemma":[0.0967692,0.0006705239,0.890606,0.00025063413,0.00021475158,0.00057860825,0.0013480934,0.0006311963,0.008930885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817646,0.00025897438,0.0001607006,0.00045432957,0.0006884756,0.00026095775],"domain_scores_gemma":[0.99491644,0.0024927964,0.0003611472,0.0013299098,0.0006604601,0.00023926646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012752443,0.002114398,0.002264987,0.0024800603,0.0018841237,0.0041066087,0.0061687897,0.0027237944,0.012305798],"category_scores_gemma":[0.008683979,0.0014087497,0.0021646721,0.0044136443,0.0017224073,0.01028617,0.0054929256,0.0038480544,0.0025942088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080673787,0.00046295347,0.0009566845,0.00062395836,0.00013167836,0.00013863936,0.00054726674,0.106120296,0.00816286,0.19197619,0.035247896,0.6548249],"study_design_scores_gemma":[0.0002871689,0.00011523786,0.00047003577,0.00009055145,0.00011022869,0.00029845737,0.00021934285,0.64958453,0.006180004,0.32742128,0.015146663,0.00007650165],"about_ca_topic_score_codex":0.0054767313,"about_ca_topic_score_gemma":0.009684941,"teacher_disagreement_score":0.012305798,"about_ca_system_score_codex":0.004085941,"about_ca_system_score_gemma":0.0023502558,"threshold_uncertainty_score":0.04116696},"labels":[],"label_agreement":null},{"id":"W1491629109","doi":"10.1007/978-3-540-24677-0_14","title":"Cell Modeling Using Agent-Based Formalisms","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Reusability; Unified Modeling Language; Ode; Ordinary differential equation; Modeling language; Programming language; SBML; Simple (philosophy); Theoretical computer science; Differential equation; Applied mathematics","score_opus":0.013935745496955467,"score_gpt":0.23700987095728707,"score_spread":0.2230741254603316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491629109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002891359,0.0029857918,0.95357054,0.0010156137,0.00040560204,0.00007364461,0.0005073798,0.00097544235,0.03757475],"genre_scores_gemma":[0.160214,0.01221473,0.75705296,0.00063714717,0.00038992972,0.0005499625,0.0016076291,0.00056733494,0.066766195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997776,0.000048382237,0.000020028296,0.000038229216,0.00010129023,0.000014502702],"domain_scores_gemma":[0.9997296,0.00012818514,0.000019892319,0.000044536097,0.00005298829,0.000024714896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057979627,0.0008923719,0.0007473429,0.0009577414,0.0006600501,0.0022768604,0.0018478911,0.0011915046,0.005469918],"category_scores_gemma":[0.00096628786,0.0005290744,0.0015732425,0.00087445276,0.0010651138,0.002128659,0.0013058088,0.0015657792,0.0024070034],"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.000011867235,0.000018025685,0.0001650223,0.00013232224,0.00003382012,0.0001650549,0.0002659841,0.1666304,0.002793114,0.7999221,0.0063922456,0.023469968],"study_design_scores_gemma":[0.000023763008,0.000017007973,0.00008943621,0.00008474921,0.000035221547,0.00015402006,0.00004930501,0.36776277,0.0013281279,0.45993328,0.17049553,0.000026829328],"about_ca_topic_score_codex":0.0046035154,"about_ca_topic_score_gemma":0.003599322,"teacher_disagreement_score":0.005469918,"about_ca_system_score_codex":0.0011405586,"about_ca_system_score_gemma":0.0008088902,"threshold_uncertainty_score":0.018298686},"labels":[],"label_agreement":null},{"id":"W1491688952","doi":"10.1007/11851561_16","title":"A Unifying View of Genome Rearrangements","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":299,"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 à Montréal","funders":"","keywords":"Computer science; Concatenation (mathematics); Genome; Computation; Algorithm; Theoretical computer science; Variety (cybernetics); Combinatorics; Mathematics; Genetics; Artificial intelligence; Biology; Gene","score_opus":0.014550144280510205,"score_gpt":0.24045251684787694,"score_spread":0.22590237256736673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491688952","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.0064729685,0.004801626,0.93210983,0.003154769,0.00037998694,0.000039701154,0.000282178,0.0005391497,0.05221984],"genre_scores_gemma":[0.30318668,0.0152183,0.61969924,0.0025065944,0.0024407166,0.00043077674,0.0015110795,0.00096107187,0.054045532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992834,0.00018040542,0.000040988838,0.00019727004,0.00022324032,0.000074762735],"domain_scores_gemma":[0.99921024,0.000391398,0.00005156911,0.00021850536,0.00007313571,0.00005505777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942262,0.000894101,0.0010440248,0.002321258,0.0015985805,0.004496584,0.0033723596,0.0023205578,0.011716181],"category_scores_gemma":[0.0022847871,0.00065136224,0.0015459226,0.0030315265,0.0040891995,0.012058482,0.0026925707,0.0033752937,0.0023378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005409169,0.0000027873957,0.00004820882,0.000021415273,0.00000257957,0.00002158437,0.00008617116,0.002406912,0.00024349226,0.9834208,0.001292483,0.012448187],"study_design_scores_gemma":[0.0000029169619,0.0000029511602,0.000031964064,0.000008244686,0.0000036096562,0.000047293102,0.000026086069,0.006757229,0.00010101037,0.9828965,0.010118354,0.0000037748757],"about_ca_topic_score_codex":0.0019416912,"about_ca_topic_score_gemma":0.001715017,"teacher_disagreement_score":0.011716181,"about_ca_system_score_codex":0.0010521584,"about_ca_system_score_gemma":0.00062283454,"threshold_uncertainty_score":0.039194524},"labels":[],"label_agreement":null},{"id":"W1491708267","doi":"10.1007/3-540-45034-3_70","title":"Using Local Information to Guide Ant Based Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Carleton University","funders":"","keywords":"Travelling salesman problem; Computer science; Ant colony optimization algorithms; Ant colony; Mathematical optimization; Artificial intelligence; ANT; Local search (optimization); Local optimum; Theoretical computer science; Mathematics; Algorithm; Computer network","score_opus":0.061170187621450635,"score_gpt":0.3404723376348202,"score_spread":0.27930215001336955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491708267","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.014574176,0.00039868912,0.9683723,0.00013621169,0.00013676514,0.000081463644,0.000040212446,0.0016638526,0.014596402],"genre_scores_gemma":[0.33763444,0.00040890748,0.6476932,0.00023819378,0.000097187236,0.00021546903,0.00018116008,0.00079897436,0.012732354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.000117117364,0.000021557693,0.00006143108,0.00018728622,0.000035938552],"domain_scores_gemma":[0.99875295,0.00062728906,0.000105898755,0.00017500126,0.0002841066,0.000054824923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008983903,0.00090575585,0.0010974386,0.0011059801,0.0006852585,0.0012079299,0.0015271548,0.0013154666,0.004501708],"category_scores_gemma":[0.0041902945,0.0006718647,0.00045872963,0.0010565846,0.0006529497,0.0015122758,0.0012788915,0.0011867998,0.001669181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025765365,0.00014501646,0.0007915885,0.00017563567,0.000075111595,0.00014148149,0.00023845524,0.6059524,0.009825966,0.024375996,0.0077254786,0.3502952],"study_design_scores_gemma":[0.000024658433,0.000046019497,0.00009293614,0.000017540411,0.000015918784,0.000036201156,0.000014551973,0.99012053,0.0018349171,0.005738794,0.0020470303,0.000010925575],"about_ca_topic_score_codex":0.0029256395,"about_ca_topic_score_gemma":0.0059189447,"teacher_disagreement_score":0.004501708,"about_ca_system_score_codex":0.0004705382,"about_ca_system_score_gemma":0.0006676049,"threshold_uncertainty_score":0.01505971},"labels":[],"label_agreement":null},{"id":"W1491731914","doi":"10.1007/3-540-37724-7_8","title":"Reasoning about Robot Actions: A Model Checking Approach","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robot; Mobile robot; Process (computing); Context (archaeology); Human–computer interaction; Model checking; State (computer science); Control (management); Artificial intelligence; Programming language","score_opus":0.043740931585913155,"score_gpt":0.2556137651049041,"score_spread":0.21187283351899092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491731914","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.0047514136,0.00009941971,0.9899154,0.00020075521,0.000033705935,0.000100337464,0.00017889953,0.0027420982,0.0019780262],"genre_scores_gemma":[0.29783344,0.00045705988,0.69421583,0.00049046945,0.00009375823,0.0004271096,0.0010505603,0.001280113,0.0041515846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933072,0.0018766894,0.00053057115,0.001074713,0.0022891446,0.0009217113],"domain_scores_gemma":[0.975048,0.019876577,0.0009366303,0.0027472079,0.0011732469,0.00021828551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062498595,0.0031566445,0.002933342,0.0030795713,0.0020015666,0.006080184,0.00963955,0.0034580429,0.008621431],"category_scores_gemma":[0.021640608,0.004065042,0.009286363,0.0022337397,0.0060445387,0.011324276,0.0050724195,0.0065132855,0.0013974879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065022096,0.00043358025,0.0017935756,0.00089956477,0.0005908938,0.0006928705,0.0006642524,0.60939366,0.008236823,0.28067428,0.004279398,0.09169082],"study_design_scores_gemma":[0.00010445514,0.00005993459,0.000119967364,0.000083115294,0.00028795644,0.00010694528,0.00006612653,0.7951518,0.01008443,0.19210082,0.001781808,0.000052584594],"about_ca_topic_score_codex":0.01683345,"about_ca_topic_score_gemma":0.019558623,"teacher_disagreement_score":0.01683345,"about_ca_system_score_codex":0.0023063822,"about_ca_system_score_gemma":0.0047199233,"threshold_uncertainty_score":0.03347093},"labels":[],"label_agreement":null},{"id":"W1491765854","doi":"10.1007/3-540-45499-3_1","title":"Invited Talk: A Software Engineering Program of Lasting Value (Abstract)","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Experimental Learning in Engineering","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":"McMaster University","funders":"","keywords":"Obligation; Computer science; Value (mathematics); Focus (optics); Software; Software engineering; Engineering ethics; Mathematics education; Programming language; Engineering; Mathematics; Law; Optics; Political science","score_opus":0.007375522372714574,"score_gpt":0.21423502171717834,"score_spread":0.20685949934446377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491765854","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042533386,0.010595069,0.09849546,0.14337842,0.19884028,0.0009806998,0.0009006486,0.0029559562,0.50132],"genre_scores_gemma":[0.05392008,0.0020994667,0.00869967,0.0075420053,0.016735453,0.00023003694,0.00054849434,0.000924075,0.9093008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992933,0.00017150406,0.000021203035,0.00018870973,0.00019054546,0.00013468546],"domain_scores_gemma":[0.9983582,0.00024447098,0.000025806423,0.00004875344,0.0003581366,0.00096461043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022413703,0.0013180809,0.0006424231,0.00086402684,0.002978627,0.003920538,0.0010878816,0.0025465968,0.080387324],"category_scores_gemma":[0.002917507,0.00044736126,0.0012687994,0.0005730412,0.00078796246,0.002850666,0.0034838796,0.0034266,0.024524024],"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.000467727,0.00049475173,0.00075468485,0.0002042808,0.000030837822,0.00042689763,0.001585887,0.00081269426,0.006310841,0.03216962,0.82682437,0.12991738],"study_design_scores_gemma":[0.00008713623,0.00042086327,0.0013806848,0.0001176361,0.00003089847,0.0002274315,0.0009604814,0.0013807607,0.0026003604,0.0151185235,0.9776458,0.000029381974],"about_ca_topic_score_codex":0.00075429067,"about_ca_topic_score_gemma":0.0017257549,"teacher_disagreement_score":0.080387324,"about_ca_system_score_codex":0.0013485753,"about_ca_system_score_gemma":0.0012662273,"threshold_uncertainty_score":0.2689224},"labels":[],"label_agreement":null},{"id":"W1491774527","doi":"10.1007/978-3-540-70545-1_29","title":"CSIsat: Interpolation for LA+EUF","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Programming language; Satisfiability modulo theories; Software; Solver; Interpolation (computer graphics); Quantifier (linguistics); Quantifier elimination; Theoretical computer science; Arithmetic; Algorithm; Mathematics; Computer graphics (images); Artificial intelligence","score_opus":0.03414785980137259,"score_gpt":0.2935137204647448,"score_spread":0.2593658606633722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491774527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080536185,0.0004009305,0.9257005,0.0005156096,0.00053370546,0.00009027847,0.0013770123,0.016891545,0.046436865],"genre_scores_gemma":[0.26604754,0.0005672929,0.6626729,0.0007143831,0.0004713427,0.00044463933,0.005648687,0.010149549,0.053283717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.0002663943,0.00006771428,0.00023848025,0.00032960463,0.00016841094],"domain_scores_gemma":[0.998953,0.0004242293,0.00004434936,0.00035533734,0.00017932086,0.000043786175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014633177,0.0009521142,0.0010147319,0.0010005187,0.0010307629,0.0016047225,0.0019081498,0.0008538589,0.040954646],"category_scores_gemma":[0.0038908806,0.00054306287,0.0015532922,0.0012916261,0.0012007464,0.0030140707,0.0025661953,0.0030013036,0.012658916],"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.00060092524,0.000120767436,0.00047345535,0.0005083937,0.00004619251,0.000110768226,0.00020146534,0.027343413,0.0049750814,0.5283311,0.05653084,0.3807576],"study_design_scores_gemma":[0.00011894408,0.00011093173,0.00023095687,0.00015556045,0.000040425904,0.000163535,0.0000798405,0.15541154,0.014921086,0.6879782,0.14072545,0.00006348356],"about_ca_topic_score_codex":0.0015370635,"about_ca_topic_score_gemma":0.002165557,"teacher_disagreement_score":0.040954646,"about_ca_system_score_codex":0.00095191284,"about_ca_system_score_gemma":0.0013348153,"threshold_uncertainty_score":0.13700694},"labels":[],"label_agreement":null},{"id":"W1491808832","doi":"10.1007/3-540-46117-5_16","title":"On Optimum Designs of Universal Switch Blocks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","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":"University of Lethbridge; University of Victoria","funders":"","keywords":"USB; Routing (electronic design automation); Computer science; Field-programmable gate array; Crossbar switch; Topology (electrical circuits); Router; Disjoint sets; Block (permutation group theory); Parallel computing; Embedded system; Discrete mathematics; Mathematics; Combinatorics; Computer network; Telecommunications; Software; Operating system","score_opus":0.0181107179656469,"score_gpt":0.21278239772383703,"score_spread":0.19467167975819014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491808832","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.034872904,0.0037494928,0.9367348,0.0001741224,0.000119804914,0.00007573547,0.00013684815,0.0007760176,0.023360323],"genre_scores_gemma":[0.3665711,0.0034310985,0.6185509,0.00019676858,0.00017337497,0.00018619622,0.00027647003,0.00029929308,0.010314869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993648,0.00018485374,0.0000452899,0.00009546377,0.00020938004,0.0001001815],"domain_scores_gemma":[0.99947566,0.0003092658,0.00004957473,0.00008149316,0.00006991064,0.000014123435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006853199,0.0007292836,0.0007316484,0.000732084,0.0003614243,0.0009019128,0.0010040404,0.0005047238,0.008046593],"category_scores_gemma":[0.0018784041,0.00070622383,0.0005076569,0.00080414914,0.0004121794,0.0012758437,0.00063442957,0.0007454899,0.0012016332],"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.0007406611,0.00007665156,0.0005076208,0.0007709205,0.00009688501,0.00009677752,0.00021249308,0.13925435,0.050452396,0.25184253,0.00782377,0.54812497],"study_design_scores_gemma":[0.00032771286,0.0007807356,0.0010011764,0.00034041065,0.00025373875,0.00068464654,0.00011607177,0.5903847,0.052642345,0.28682667,0.066573046,0.00006860851],"about_ca_topic_score_codex":0.0004783253,"about_ca_topic_score_gemma":0.0015055736,"teacher_disagreement_score":0.008046593,"about_ca_system_score_codex":0.00074591633,"about_ca_system_score_gemma":0.00056364684,"threshold_uncertainty_score":0.02691853},"labels":[],"label_agreement":null},{"id":"W1491850810","doi":"10.1007/978-3-642-11322-2_38","title":"Path Protection in Translucent WDM Optical Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","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 Windsor","funders":"","keywords":"Computer science; Wavelength-division multiplexing; Path (computing); Path protection; Computer network; Optical path; Telecommunications; Distributed computing; Optics; Physics; Wavelength","score_opus":0.0097124410160386,"score_gpt":0.2068525500255612,"score_spread":0.19714010900952258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491850810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389714,0.012726854,0.78032845,0.0007592379,0.0004931553,0.00013080359,0.00014617502,0.0017229787,0.06472102],"genre_scores_gemma":[0.82970977,0.007543437,0.11386672,0.00021120619,0.00028362568,0.00007988864,0.00015781818,0.00020612581,0.047941413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997739,0.000051022704,0.000010035523,0.00004818737,0.00008526192,0.00003167011],"domain_scores_gemma":[0.99956304,0.0001812721,0.00008694885,0.000111024885,0.000045398614,0.000012247243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031406764,0.0006593739,0.00032653974,0.00038575917,0.0005270844,0.00094669807,0.0008619908,0.00057391194,0.0039351494],"category_scores_gemma":[0.0006470001,0.000272152,0.0002253031,0.0003263023,0.00085448474,0.0016859495,0.0006747549,0.00093784434,0.0007649951],"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.0006350502,0.00011227017,0.0004424237,0.0010887854,0.000044144406,0.00077781925,0.00056276657,0.061689507,0.22354956,0.21908991,0.006826944,0.48518074],"study_design_scores_gemma":[0.00008445961,0.0010335353,0.001485717,0.0004708659,0.00010572127,0.0036655918,0.0002692805,0.29324904,0.28729385,0.31023175,0.10200311,0.00010705315],"about_ca_topic_score_codex":0.00024471112,"about_ca_topic_score_gemma":0.00029229294,"teacher_disagreement_score":0.0039351494,"about_ca_system_score_codex":0.0005381118,"about_ca_system_score_gemma":0.00029342124,"threshold_uncertainty_score":0.013164401},"labels":[],"label_agreement":null},{"id":"W1491859631","doi":"10.1007/978-3-540-30178-3_23","title":"APHIDS: A Mobile Agent-Based Programmable Hybrid Intrusion Detection System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Intrusion detection system; Scripting language; Mobile agent; Host-based intrusion detection system; Architecture; Embedded system; Distributed computing; Systems architecture; Computer architecture; Operating system; Computer security; Intrusion prevention system","score_opus":0.009391038597483508,"score_gpt":0.21370933289539562,"score_spread":0.20431829429791212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491859631","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.11581171,0.0027278045,0.7391685,0.0006255924,0.0009735519,0.00066602597,0.0009562954,0.117528394,0.021541981],"genre_scores_gemma":[0.559154,0.0009175109,0.39536646,0.0011512369,0.00018607186,0.00048147794,0.0013991251,0.00082657096,0.040517464],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997086,0.00004131509,0.000023900098,0.000074522424,0.00012805649,0.000023510831],"domain_scores_gemma":[0.99976224,0.00006752739,0.000029250868,0.000045957284,0.00006006916,0.000035069017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032713206,0.00065575785,0.0008040525,0.000560652,0.0002865247,0.00089715124,0.0013408426,0.00064523984,0.003920914],"category_scores_gemma":[0.00055972935,0.00032760273,0.00026567953,0.00019943474,0.00028801986,0.0011570812,0.0010603125,0.0008259711,0.0014751337],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030220523,0.00053749385,0.003712281,0.00068509905,0.0003534529,0.00080200296,0.00030047764,0.02527299,0.20155121,0.008339635,0.05190605,0.7035173],"study_design_scores_gemma":[0.0007153596,0.0015572213,0.0034518938,0.00008770415,0.0004191244,0.002134887,0.00010485757,0.67947334,0.18666217,0.007360908,0.11785769,0.00017491379],"about_ca_topic_score_codex":0.0007178492,"about_ca_topic_score_gemma":0.00084011327,"teacher_disagreement_score":0.003920914,"about_ca_system_score_codex":0.00027327682,"about_ca_system_score_gemma":0.00033451227,"threshold_uncertainty_score":0.013116777},"labels":[],"label_agreement":null},{"id":"W1491915485","doi":"10.1007/978-3-642-13437-1_3","title":"Detecting Learner Frustration: Towards Mainstream Use Cases","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Frustration; Helpfulness; Computer science; Tilt (camera); Human–computer interaction; Psychology; Social psychology; Engineering","score_opus":0.03883414073928856,"score_gpt":0.2604476675302935,"score_spread":0.22161352679100496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491915485","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.8659599,0.0009359797,0.119038016,0.00054263056,0.00006556223,0.00033216528,0.0013788729,0.0041183955,0.007628531],"genre_scores_gemma":[0.9367191,0.00024988916,0.057007458,0.00012198373,0.000041672345,0.00021438887,0.0017424142,0.00044489946,0.0034583162],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928383,0.002762314,0.00064135285,0.0010762042,0.0022639814,0.00041783863],"domain_scores_gemma":[0.97611576,0.015426499,0.0012643886,0.0021289217,0.0043376917,0.0007266944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003790624,0.0012342241,0.0007605626,0.0028554967,0.000804453,0.0025041276,0.002194993,0.002101443,0.0017483258],"category_scores_gemma":[0.035181206,0.000415699,0.00041512182,0.0012074617,0.00062325405,0.0035450158,0.0025174494,0.0010021509,0.001660189],"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.0029662198,0.002140998,0.18188411,0.0013920317,0.0002527874,0.0037740415,0.020849047,0.005277539,0.069418035,0.0036348745,0.016781233,0.69162905],"study_design_scores_gemma":[0.0003255162,0.002729133,0.16852029,0.00055170606,0.0005604949,0.0123354895,0.013550637,0.57787216,0.16987672,0.0131479455,0.04023138,0.0002985477],"about_ca_topic_score_codex":0.001683623,"about_ca_topic_score_gemma":0.0026926936,"teacher_disagreement_score":0.003790624,"about_ca_system_score_codex":0.0005811387,"about_ca_system_score_gemma":0.00034084,"threshold_uncertainty_score":0.02004695},"labels":[],"label_agreement":null},{"id":"W1492028561","doi":"10.1007/3-540-45049-1_54","title":"The Formal Specification and Implementation of a Modest First Order Temporal Logic","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Acadia University; Nortel (Canada)","funders":"","keywords":"Computer science; Programming language; Temporal logic; Logic programming; Description logic; First-order logic; Syntax; Semantics (computer science); Interval temporal logic; Theoretical computer science; Artificial intelligence","score_opus":0.01619250709659672,"score_gpt":0.25426003266062475,"score_spread":0.23806752556402802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492028561","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.011590988,0.00006798406,0.97739035,0.0004267876,0.00006525891,0.00016476236,0.00025126926,0.0022193633,0.007823101],"genre_scores_gemma":[0.222871,0.00021447631,0.7649155,0.00017386653,0.00006620378,0.000396126,0.00056804204,0.0003661565,0.010428561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899906,0.0001999127,0.0001240356,0.00012184181,0.00043132616,0.0001237144],"domain_scores_gemma":[0.9982326,0.0009698073,0.00013325036,0.00036817143,0.0002001634,0.00009590501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019676378,0.00043525096,0.00048543685,0.00057907746,0.0009924249,0.0027957084,0.0025378983,0.0011113193,0.00805811],"category_scores_gemma":[0.0045770546,0.0010213285,0.0011841006,0.0006743897,0.002246359,0.003108596,0.001860188,0.0017279801,0.0018103919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016350433,0.00006469791,0.0002953287,0.0002323586,0.000016790413,0.00017845191,0.00037160428,0.014098001,0.017490173,0.94085735,0.0023483124,0.02388341],"study_design_scores_gemma":[0.00017582806,0.00019817184,0.0003521392,0.000102511585,0.00011381028,0.0003699729,0.00015215692,0.39084578,0.044488132,0.49688992,0.06624034,0.00007116918],"about_ca_topic_score_codex":0.001831422,"about_ca_topic_score_gemma":0.00337344,"teacher_disagreement_score":0.00805811,"about_ca_system_score_codex":0.0010552604,"about_ca_system_score_gemma":0.0023318422,"threshold_uncertainty_score":0.026957035},"labels":[],"label_agreement":null},{"id":"W1492058106","doi":"10.1007/3-540-44634-6_2","title":"Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Christian ministry; Quadratic equation; Algorithm; Planar; Computer science; Planar graph; Graph; Combinatorics; Mathematics; Theoretical computer science; Geometry","score_opus":0.0318007421251974,"score_gpt":0.25987321454555606,"score_spread":0.22807247242035866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492058106","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.00608573,0.00048957375,0.99044585,0.00022424539,0.00005479816,0.000036270736,0.00007012321,0.00044356874,0.002149782],"genre_scores_gemma":[0.1482346,0.00072271185,0.84516275,0.00014685694,0.00014901574,0.00019420238,0.00035672373,0.00044502187,0.004588085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966272,0.0011208933,0.0001820206,0.0008384901,0.00095941353,0.00027200923],"domain_scores_gemma":[0.9903819,0.0059392736,0.0007070643,0.0018795603,0.00079775637,0.0002944948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031036278,0.0015790587,0.0023945314,0.0017894692,0.0012871755,0.0025837475,0.0033846356,0.0030810444,0.00538142],"category_scores_gemma":[0.024276119,0.0014372263,0.0013328297,0.0028538757,0.0027541195,0.005504038,0.0044525014,0.0030380243,0.0013483346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034131279,0.00012596327,0.00043958978,0.00028369535,0.000061501865,0.00007074671,0.00019231408,0.62061733,0.002715428,0.16036744,0.0107757095,0.204009],"study_design_scores_gemma":[0.00003366469,0.000057094403,0.00010335324,0.000024688336,0.000018966808,0.00006921434,0.000043517968,0.8303235,0.0013772938,0.16560745,0.0023231474,0.000018211973],"about_ca_topic_score_codex":0.0030169894,"about_ca_topic_score_gemma":0.0030650846,"teacher_disagreement_score":0.00538142,"about_ca_system_score_codex":0.0019674243,"about_ca_system_score_gemma":0.0022987232,"threshold_uncertainty_score":0.01800257},"labels":[],"label_agreement":null},{"id":"W1492062384","doi":"10.1007/978-3-540-69812-8_101","title":"Cell Phones Personal Authentication Systems Using Multimodal Biometrics","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Concordia University","funders":"","keywords":"Computer science; Biometrics; Authentication (law); Computer security; Human–computer interaction","score_opus":0.032866326214759975,"score_gpt":0.2536356833411086,"score_spread":0.2207693571263486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492062384","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.18827693,0.011931756,0.6750975,0.00075476454,0.0013635046,0.0004654624,0.0017696511,0.014292602,0.10604785],"genre_scores_gemma":[0.7645684,0.0036842437,0.07482291,0.00052098837,0.00023693137,0.00018507626,0.0010583578,0.00022281197,0.15470025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961627,0.00004583136,0.000027384047,0.000067363944,0.0001937821,0.000049374183],"domain_scores_gemma":[0.9996662,0.00006872668,0.0000296801,0.00007163216,0.00014952078,0.000014215552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020476134,0.00049483124,0.0003948294,0.0006277553,0.00043543417,0.0009786115,0.0006399638,0.0012041883,0.016784608],"category_scores_gemma":[0.0005931349,0.00026980383,0.00021263701,0.0005996444,0.00019031912,0.0014542942,0.000757416,0.00039672927,0.014009362],"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.0005335084,0.00006215046,0.0013066264,0.0003339427,0.000049267193,0.0005335141,0.00031787565,0.0016374802,0.35320392,0.006563881,0.020412985,0.6150448],"study_design_scores_gemma":[0.00005706265,0.0010351456,0.012196916,0.00033469722,0.00032234943,0.006688348,0.00040998883,0.08808986,0.6469779,0.0052532204,0.23839304,0.00024138413],"about_ca_topic_score_codex":0.0006256227,"about_ca_topic_score_gemma":0.0011109123,"teacher_disagreement_score":0.016784608,"about_ca_system_score_codex":0.0002503433,"about_ca_system_score_gemma":0.00016312262,"threshold_uncertainty_score":0.05615014},"labels":[],"label_agreement":null},{"id":"W149211460","doi":"10.1007/978-3-642-04271-3_64","title":"Predicting MGMT Methylation Status of Glioblastomas from MRI Texture","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Glioma Diagnosis and Treatment","field":"Medicine","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Occupational Cancer Research Centre; Hotchkiss Brain Institute; Alberta Glycomics Centre; Ontario Brain Institute; Alberta Cancer Foundation; University of Calgary","funders":"","keywords":"Methylation; Magnetic resonance imaging; Fluid-attenuated inversion recovery; Glioblastoma; DNA methylation; Cancer research; Oncology; Medicine; Biology; Gene; Radiology; Genetics; Gene expression","score_opus":0.01101385016489473,"score_gpt":0.2731720445479618,"score_spread":0.26215819438306703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149211460","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.99689627,0.00029722732,0.0017360246,0.000050173807,0.000008728243,0.00001173046,0.00046816442,0.000063372005,0.00046838546],"genre_scores_gemma":[0.9981713,0.0001936833,0.0009090684,0.000009864531,0.000014538262,0.000004796854,0.00048176266,0.000008719992,0.00020620174],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99992335,0.000010140799,0.000008470862,0.000012490345,0.000020890144,0.000024693862],"domain_scores_gemma":[0.9996451,0.0001097579,0.00008197455,0.00002092047,0.000081192615,0.00006107019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022413196,0.0003004708,0.00035244247,0.0017066575,0.00011648389,0.0004679271,0.00019272466,0.00033129126,0.0009130768],"category_scores_gemma":[0.0013389916,0.00015145123,0.00032600967,0.0004689604,0.00012154327,0.00024869322,0.00025472697,0.00018588072,0.00039927685],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021768624,0.00007421511,0.7948252,0.000097774384,0.00015616526,0.00070383085,0.000093410476,0.0026189012,0.104620464,0.00007975966,0.00090736337,0.0936461],"study_design_scores_gemma":[0.000040846408,0.0003222377,0.9068242,0.00002812472,0.00038858407,0.0024342912,0.0003842449,0.05611608,0.031957544,0.0005455776,0.00092821236,0.000030184672],"about_ca_topic_score_codex":0.004008481,"about_ca_topic_score_gemma":0.0039462293,"teacher_disagreement_score":0.004008481,"about_ca_system_score_codex":0.00015534768,"about_ca_system_score_gemma":0.00015505066,"threshold_uncertainty_score":0.0079702735},"labels":[],"label_agreement":null},{"id":"W1492179299","doi":"10.1007/978-3-642-10331-5_42","title":"Maximum Likelihood Estimation Sample Consensus with Validation of Individual Correspondences","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","field":"Engineering","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":"Communications Research Centre Canada","funders":"","keywords":"RANSAC; Estimator; Computer science; Sample (material); Statistics; Estimation; Sequence (biology); Algorithm; Maximum likelihood; Artificial intelligence; Mathematics; Pattern recognition (psychology); Image (mathematics)","score_opus":0.018317673876315492,"score_gpt":0.23498420242081386,"score_spread":0.21666652854449836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492179299","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.009860599,0.00006367908,0.98892957,0.000045991943,0.000019523604,0.000033975066,0.000031299118,0.0005496672,0.00046576685],"genre_scores_gemma":[0.40169662,0.00007488765,0.5926775,0.00010472861,0.00005251892,0.00024105883,0.00077425386,0.00046798534,0.003910483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387133,0.0026585541,0.00031865443,0.0015220882,0.001283318,0.00034596605],"domain_scores_gemma":[0.97640353,0.012875479,0.0011906582,0.005408079,0.0038288904,0.00029338888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0088118585,0.0017166801,0.0031331554,0.0014348597,0.0013745774,0.0019412764,0.004467994,0.004399102,0.0031348865],"category_scores_gemma":[0.032581087,0.0016550354,0.0018892266,0.0017411785,0.002367537,0.0034462465,0.004749284,0.00286716,0.0025508457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006807541,0.000192625,0.002141229,0.00026934748,0.0002974847,0.00015876103,0.00029874346,0.6191665,0.012700538,0.012167502,0.0025330645,0.34939343],"study_design_scores_gemma":[0.000022307127,0.000052387746,0.0003253293,0.000008737671,0.00001665261,0.00003987518,0.000022178898,0.987407,0.004139977,0.007674335,0.0002771457,0.000014121192],"about_ca_topic_score_codex":0.0028173365,"about_ca_topic_score_gemma":0.003307466,"teacher_disagreement_score":0.0088118585,"about_ca_system_score_codex":0.0009367137,"about_ca_system_score_gemma":0.0020436826,"threshold_uncertainty_score":0.04660213},"labels":[],"label_agreement":null},{"id":"W1492180884","doi":"10.1007/11864127_3","title":"Inferring Positional Homologs with Common Intervals of Sequences","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université du Québec à Montréal","funders":"","keywords":"Genome; Context (archaeology); Biology; Heuristic; Gene; Computational biology; Matching (statistics); Genetics; Computer science; Mathematics; Artificial intelligence","score_opus":0.010092628239256487,"score_gpt":0.236301468981617,"score_spread":0.2262088407423605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492180884","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.44439784,0.0015540426,0.53985536,0.00023614315,0.000113928356,0.00020799869,0.0040535624,0.004796419,0.004784639],"genre_scores_gemma":[0.56266564,0.00066319166,0.4197433,0.000121398596,0.00014365387,0.00014352569,0.013824118,0.0005380928,0.0021571128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884796,0.00013746868,0.00007844174,0.000554197,0.00027609387,0.000105767926],"domain_scores_gemma":[0.9968088,0.0019942648,0.00031216932,0.00049510726,0.0002534153,0.0001361268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011166981,0.0007813073,0.0014331609,0.005736961,0.0008732862,0.0015347112,0.00255657,0.0014869672,0.0049193026],"category_scores_gemma":[0.0076013035,0.00087328407,0.0013809031,0.0061337883,0.00064514944,0.0028651187,0.0020841616,0.00095027493,0.0016485042],"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.0033459924,0.0006031124,0.049147513,0.0012453687,0.00040568665,0.0036034526,0.001407431,0.04955104,0.087272495,0.042201355,0.011267359,0.74994916],"study_design_scores_gemma":[0.00051894045,0.0006921526,0.016368829,0.00019005394,0.0007674419,0.0036041625,0.001563145,0.7234358,0.059921883,0.17849474,0.014330186,0.000112671114],"about_ca_topic_score_codex":0.002054503,"about_ca_topic_score_gemma":0.0036393171,"teacher_disagreement_score":0.005736961,"about_ca_system_score_codex":0.0004216048,"about_ca_system_score_gemma":0.0006585556,"threshold_uncertainty_score":0.016456664},"labels":[],"label_agreement":null},{"id":"W1492208811","doi":"10.1007/3-540-44886-1_44","title":"A Genetic K-means Clustering Algorithm Applied to Gene Expression Data","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Cluster analysis; Computer science; Computational biology; Algorithm; Data mining; Biology; Artificial intelligence","score_opus":0.02248543993476052,"score_gpt":0.26160323785415746,"score_spread":0.23911779791939694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492208811","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.0034269013,0.00015668367,0.99206614,0.00007178368,0.00010055978,0.00011141096,0.00014224206,0.0033438113,0.000580401],"genre_scores_gemma":[0.011272288,0.000105069375,0.98651993,0.000040767976,0.000023195687,0.000168903,0.0003266523,0.00026844838,0.0012746878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989864,0.00019623697,0.00006911855,0.0002920489,0.00039990369,0.000056311477],"domain_scores_gemma":[0.999188,0.0002550902,0.00003834253,0.00010645482,0.0003797761,0.000032336455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013846317,0.0011795267,0.0019219788,0.0016752748,0.0019473722,0.0013377604,0.0026804374,0.0014837211,0.003065956],"category_scores_gemma":[0.0026039553,0.0009306206,0.00207253,0.0032801009,0.0007482251,0.00077208964,0.0012221757,0.0015225962,0.0026771699],"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.0001952556,0.00013972346,0.0010263389,0.000292996,0.0003623546,0.00017190212,0.00031542376,0.15059294,0.021747265,0.0056235115,0.010768344,0.8087639],"study_design_scores_gemma":[0.00006913958,0.000069089285,0.0017766627,0.000040928157,0.00012476176,0.00027331494,0.00008392396,0.96147126,0.011934942,0.012495545,0.011575113,0.00008530559],"about_ca_topic_score_codex":0.022383168,"about_ca_topic_score_gemma":0.023144905,"teacher_disagreement_score":0.022383168,"about_ca_system_score_codex":0.0011550857,"about_ca_system_score_gemma":0.0025139733,"threshold_uncertainty_score":0.044505715},"labels":[],"label_agreement":null},{"id":"W1492235610","doi":"10.1007/978-3-642-13094-6_33","title":"Situational Evaluation of Method Fragments: An Evidence-Based Goal-Oriented Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Situational ethics; Scrum; Method engineering; Software engineering; Software; Knowledge management; Software development; Situation awareness; Process management; Empirical research; Engineering","score_opus":0.05347045719485181,"score_gpt":0.33697295304342334,"score_spread":0.2835024958485715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492235610","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.06760104,0.0015168971,0.906444,0.0019363617,0.00010627602,0.0028107113,0.00046358764,0.0019329345,0.017188184],"genre_scores_gemma":[0.34199515,0.0004184919,0.6551462,0.00016959391,0.000026201455,0.00062639406,0.0004645125,0.00011406646,0.0010393875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.94561654,0.029312177,0.003230059,0.0029910367,0.018031973,0.00081822264],"domain_scores_gemma":[0.8450991,0.10521954,0.010545106,0.012491743,0.024310408,0.0023340383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.040302575,0.0022810316,0.0019751065,0.010974773,0.0018908485,0.0063746087,0.0056403037,0.0034058061,0.0042694523],"category_scores_gemma":[0.12980083,0.0010760608,0.0017921006,0.0037851213,0.0028869044,0.006786084,0.0055672764,0.0024417555,0.0008244609],"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.003461346,0.003227342,0.035829753,0.0050975364,0.0011896093,0.0006470569,0.0068285214,0.031906325,0.017117761,0.06403446,0.005258016,0.82540226],"study_design_scores_gemma":[0.0015251433,0.00617056,0.04086349,0.004409484,0.0039188555,0.0013681006,0.01264616,0.5858143,0.06564668,0.24506167,0.031829678,0.00074590475],"about_ca_topic_score_codex":0.0036641248,"about_ca_topic_score_gemma":0.0074051693,"teacher_disagreement_score":0.040302575,"about_ca_system_score_codex":0.002713039,"about_ca_system_score_gemma":0.00675915,"threshold_uncertainty_score":0.21314293},"labels":[],"label_agreement":null},{"id":"W1492293326","doi":"10.1007/11599371_9","title":"A New Unsupervised Anomaly Detection Framework for Detecting Network Attacks in Real-Time","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 Victoria","funders":"","keywords":"Anomaly detection; Computer science; Intrusion detection system; Outlier; Network packet; Data mining; Anomaly-based intrusion detection system; Artificial intelligence; Anomaly (physics); Network security; Pattern recognition (psychology); Machine learning; Computer security","score_opus":0.016785955504852488,"score_gpt":0.25239349163150293,"score_spread":0.23560753612665045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492293326","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.0031884706,0.00008138151,0.99487805,0.00003216027,0.000037010952,0.000019861023,0.000055186825,0.0014844262,0.00022345528],"genre_scores_gemma":[0.10549183,0.0001766677,0.889657,0.00011716533,0.00016777046,0.0001301948,0.0005823458,0.00036067958,0.0033163095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840754,0.00022363808,0.000081133876,0.00043040738,0.0007228067,0.00013450116],"domain_scores_gemma":[0.9983198,0.0004621222,0.00018129632,0.00031001994,0.0006367769,0.00008993831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013646738,0.0012054358,0.0018985196,0.002049216,0.00065967656,0.0012668492,0.003414432,0.0011077151,0.0012793716],"category_scores_gemma":[0.0027070749,0.0005127366,0.00130844,0.0017303976,0.000894498,0.0023344718,0.0015056037,0.0019217894,0.00081369333],"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.00032811466,0.0005201403,0.0038092746,0.00014657315,0.00036918992,0.0002631537,0.00015531533,0.16735129,0.0429761,0.021085398,0.011040001,0.75195545],"study_design_scores_gemma":[0.000009764171,0.000046222616,0.00051770906,0.000003834221,0.00003083286,0.00014120709,0.000009935535,0.9847003,0.0046158102,0.007751337,0.0021506045,0.000022324019],"about_ca_topic_score_codex":0.004280671,"about_ca_topic_score_gemma":0.0066594207,"teacher_disagreement_score":0.004280671,"about_ca_system_score_codex":0.0007028396,"about_ca_system_score_gemma":0.0012270445,"threshold_uncertainty_score":0.008511484},"labels":[],"label_agreement":null},{"id":"W1492385901","doi":"10.1007/11566465_42","title":"Automatic Segmentation of the Left Ventricle in 3D SPECT Data by Registration with a Dynamic Anatomic Model","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 British Columbia","funders":"","keywords":"Segmentation; Artificial intelligence; Computer science; Computer vision; Matching (statistics); Ventricle; 3d model; Pattern recognition (psychology); Medicine; Cardiology","score_opus":0.012288245488034711,"score_gpt":0.2856267100590427,"score_spread":0.273338464571008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492385901","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.034427524,0.00037381126,0.96207356,0.00010671914,0.00003657439,0.00007638855,0.00021148252,0.0019941963,0.00069971505],"genre_scores_gemma":[0.29702112,0.00084426976,0.6979986,0.0000917073,0.000058343536,0.00018173273,0.0008934883,0.00090517383,0.0020055308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995394,0.000097432356,0.000033276137,0.0001150862,0.00016325255,0.00005169947],"domain_scores_gemma":[0.99965775,0.00012717652,0.000048789483,0.00008392278,0.00006205629,0.000020363112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066744327,0.000662069,0.001218057,0.002072065,0.00051422307,0.0014855129,0.0009928392,0.0013134874,0.0012050105],"category_scores_gemma":[0.0013922388,0.0009561749,0.0012765275,0.001613854,0.00053776236,0.00081820757,0.0011312277,0.00083566416,0.0011099207],"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.000523945,0.00014924759,0.0027911495,0.00035217026,0.00023014162,0.0006157421,0.00039091852,0.12877144,0.3738761,0.0062429295,0.0039855,0.48207065],"study_design_scores_gemma":[0.000053437634,0.00015138142,0.005785441,0.00004866545,0.00016625792,0.001625492,0.00009128689,0.87754023,0.10115721,0.0063465177,0.0069506946,0.00008350531],"about_ca_topic_score_codex":0.0043776245,"about_ca_topic_score_gemma":0.0067483,"teacher_disagreement_score":0.0043776245,"about_ca_system_score_codex":0.00054720044,"about_ca_system_score_gemma":0.001621851,"threshold_uncertainty_score":0.008704305},"labels":[],"label_agreement":null},{"id":"W1492410853","doi":"10.1007/bfb0038200","title":"Hypermedia — from the past to the future","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Acadia University","funders":"","keywords":"Hypermedia; Terminology; Computer science; Interface (matter); Point (geometry); Human–computer interaction; Control (management); World Wide Web; HyperCard; Multimedia; Artificial intelligence; Linguistics; Operating system","score_opus":0.015943531650793277,"score_gpt":0.2255431778797141,"score_spread":0.2095996462289208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492410853","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049850447,0.8237854,0.002957431,0.06584564,0.004583523,0.000007126245,0.00008422847,0.00014414513,0.097607374],"genre_scores_gemma":[0.15770759,0.7465236,0.0058247913,0.013143859,0.0076088225,0.000032634816,0.0001718094,0.0001444004,0.06884245],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991202,0.0003031109,0.0000508217,0.00011931722,0.00029183074,0.00011475457],"domain_scores_gemma":[0.9979826,0.0008044817,0.00015124211,0.00016404186,0.0003243776,0.0005732218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002569801,0.00041256545,0.00048242256,0.0015026497,0.0013625849,0.012790403,0.00099881,0.003243072,0.01102921],"category_scores_gemma":[0.002199457,0.0003228656,0.00027072505,0.0025697472,0.0051515964,0.017630195,0.0023285488,0.0032464077,0.0022649104],"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.000095954085,0.000101007965,0.00095463434,0.0014289559,0.000023781331,0.00016404268,0.00237018,0.00035228024,0.0012280513,0.3530773,0.112390935,0.5278128],"study_design_scores_gemma":[0.0000073568867,0.000037036996,0.00078061695,0.0012110072,0.000008802739,0.0003877831,0.0028020588,0.00027751297,0.0002535931,0.061434995,0.9327775,0.000021796654],"about_ca_topic_score_codex":0.0024161579,"about_ca_topic_score_gemma":0.0042187297,"teacher_disagreement_score":0.012790403,"about_ca_system_score_codex":0.0022226865,"about_ca_system_score_gemma":0.0022262183,"threshold_uncertainty_score":0.036896408},"labels":[],"label_agreement":null},{"id":"W1492416327","doi":"10.1007/978-3-642-04076-4_3","title":"Evaluating Factors that Influence Path Tracing with Passive Haptic Guidance","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Manitoba","funders":"","keywords":"Computer science; Tracing; Haptic technology; Path (computing); Computer vision; Computer graphics (images); Artificial intelligence; Simulation; Human–computer interaction; Operating system","score_opus":0.02455076998215847,"score_gpt":0.25562423570098763,"score_spread":0.23107346571882917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492416327","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.9797275,0.00029340695,0.01917378,0.000010848931,0.000012327638,0.00003178271,0.000049631843,0.00013681618,0.00056386506],"genre_scores_gemma":[0.9936999,0.000092582995,0.005733637,0.0000042742345,0.0000051164525,0.00001026671,0.00008893952,0.000059043385,0.0003061619],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99916184,0.00023916467,0.000049958722,0.00015378158,0.00029282537,0.0001025415],"domain_scores_gemma":[0.9720247,0.024723195,0.0011893144,0.0005431627,0.0011697217,0.00034981887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001175121,0.0006238183,0.00043854362,0.0007209713,0.00028439425,0.0009990161,0.00032274713,0.0006289662,0.0011342225],"category_scores_gemma":[0.024385374,0.00022039571,0.0003501509,0.00066779135,0.0004227641,0.00088043173,0.00036601143,0.0003189289,0.00017800361],"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.020060614,0.0010760514,0.099096715,0.00092037144,0.0003320391,0.0006094308,0.0008854397,0.12203895,0.5341225,0.0006159146,0.0005475426,0.21969445],"study_design_scores_gemma":[0.00029863068,0.010146802,0.23517294,0.0000853338,0.0011028118,0.0012674247,0.00089336786,0.45959747,0.28835773,0.0018413365,0.0010501149,0.00018603065],"about_ca_topic_score_codex":0.0018988892,"about_ca_topic_score_gemma":0.0015358033,"teacher_disagreement_score":0.0018988892,"about_ca_system_score_codex":0.00026191698,"about_ca_system_score_gemma":0.00042313949,"threshold_uncertainty_score":0.0062146783},"labels":[],"label_agreement":null},{"id":"W149246287","doi":"10.1007/978-3-642-22300-6_42","title":"Space Efficient Data Structures for Dynamic Orthogonal Range Counting","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Computer science; Sequence (biology); Range (aeronautics); Space (punctuation); Data structure; Set (abstract data type); Grid; Plane (geometry); Algorithm; Linear space; Combinatorics; Discrete mathematics; Mathematics; Geometry","score_opus":0.0301063962871892,"score_gpt":0.2689048071365918,"score_spread":0.23879841084940262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149246287","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.02110922,0.002141143,0.95085764,0.0004509342,0.00027331637,0.00018636105,0.0011871032,0.004874255,0.018919999],"genre_scores_gemma":[0.22805004,0.0015948204,0.7456658,0.0004502419,0.00035847153,0.00076089776,0.003673879,0.0014478001,0.017998131],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741745,0.00034035774,0.00030966292,0.00033647523,0.001269923,0.0003262555],"domain_scores_gemma":[0.9965249,0.0010026749,0.00022447201,0.0015788549,0.00057629205,0.000092750524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010122147,0.0009937609,0.0014698957,0.002489063,0.0013201224,0.0036389853,0.0024980914,0.00088257686,0.011050576],"category_scores_gemma":[0.00570896,0.0007417794,0.0009674638,0.006783822,0.001346983,0.0070325597,0.004531976,0.0023694816,0.003784632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037992757,0.00018929369,0.00052061945,0.00035038576,0.00003806916,0.00008732903,0.0002696275,0.014177061,0.0125576975,0.4520379,0.02528641,0.49410555],"study_design_scores_gemma":[0.00011290827,0.00021020383,0.00034966526,0.0001751356,0.00006260096,0.0004328262,0.00022224573,0.14002798,0.02948373,0.76101756,0.06780238,0.00010284141],"about_ca_topic_score_codex":0.000899572,"about_ca_topic_score_gemma":0.001628914,"teacher_disagreement_score":0.011050576,"about_ca_system_score_codex":0.0012750324,"about_ca_system_score_gemma":0.0014716141,"threshold_uncertainty_score":0.036967874},"labels":[],"label_agreement":null},{"id":"W1492466763","doi":"10.1007/978-3-642-41181-6_20","title":"Evaluation of Interactive Segmentation Algorithms Using Densely Sampled Correct Interactions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Saskatchewan","funders":"","keywords":"Segmentation; Artificial intelligence; Computer science; Scale-space segmentation; Observer (physics); Segmentation-based object categorization; Image segmentation; Computer vision; Range (aeronautics); Set (abstract data type); Pattern recognition (psychology); Engineering","score_opus":0.06434496983224125,"score_gpt":0.3576914320468806,"score_spread":0.29334646221463934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492466763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2845151,0.0015855303,0.694004,0.00037016525,0.00025568047,0.00033309165,0.00054164324,0.012496533,0.0058983155],"genre_scores_gemma":[0.64820904,0.00031201445,0.34466797,0.00014711193,0.000079004574,0.00016536753,0.001291185,0.002352469,0.0027757995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967918,0.0008040805,0.00017704877,0.0005425978,0.0013486004,0.00033588597],"domain_scores_gemma":[0.985165,0.010860185,0.00048066402,0.0012001666,0.0018766094,0.0004173394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031451702,0.002508733,0.002141124,0.0018069105,0.0011325221,0.0030210756,0.0033959346,0.0037496006,0.0068419343],"category_scores_gemma":[0.014549451,0.0011404862,0.0011174232,0.0013425804,0.0011541371,0.0020211942,0.002698941,0.001283704,0.0012221955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006728752,0.0009991387,0.0036541645,0.00065535237,0.0006076521,0.00046751494,0.0005091255,0.5314756,0.053822983,0.0046483567,0.0052401503,0.39119118],"study_design_scores_gemma":[0.000066805376,0.00018102075,0.00051757705,0.000008663701,0.00003677691,0.000118385724,0.00004948931,0.9820909,0.015564895,0.00093958963,0.00040604558,0.000019908626],"about_ca_topic_score_codex":0.009301207,"about_ca_topic_score_gemma":0.009735299,"teacher_disagreement_score":0.009301207,"about_ca_system_score_codex":0.0016624985,"about_ca_system_score_gemma":0.0015402738,"threshold_uncertainty_score":0.022888541},"labels":[],"label_agreement":null},{"id":"W1492501824","doi":"10.1007/978-3-642-02617-1_44","title":"Performance Evaluation of DSR in Multi-services Ad Hoc Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc 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":"Université Laval","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Network packet; Wireless ad hoc network; DSRFLOW; Vehicular ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Routing (electronic design automation); Ad hoc wireless distribution service; Protocol (science); Telecommunications; Wireless","score_opus":0.025339338492567923,"score_gpt":0.2675672387366046,"score_spread":0.24222790024403668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492501824","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.88314337,0.010180419,0.08618407,0.0005689342,0.00032738218,0.0002533035,0.00057087047,0.0030174043,0.015754161],"genre_scores_gemma":[0.9871837,0.00081945787,0.009938833,0.000040681494,0.000056745,0.0000203664,0.0002967195,0.000075017786,0.0015685102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955914,0.002023468,0.0002557808,0.0003798001,0.0012367661,0.0005128465],"domain_scores_gemma":[0.98764044,0.008409001,0.0004670484,0.0006790412,0.0024688465,0.00033566653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044115917,0.0011646525,0.0012593624,0.0020697895,0.00073505676,0.0013880666,0.0013049068,0.0009363024,0.0029171673],"category_scores_gemma":[0.009297583,0.00022390408,0.00033012187,0.001542731,0.0006579511,0.0018426601,0.0007031189,0.0004467174,0.00063127774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009693069,0.0009154242,0.010251854,0.0011881306,0.0003908992,0.0004583457,0.00027267152,0.59994674,0.049186062,0.0063425153,0.0048562973,0.31649795],"study_design_scores_gemma":[0.00017741232,0.0032781477,0.0032541153,0.000031501564,0.00018865138,0.00053535757,0.00024889328,0.96028244,0.029260295,0.001036016,0.0016556071,0.000051598083],"about_ca_topic_score_codex":0.0047712126,"about_ca_topic_score_gemma":0.002747289,"teacher_disagreement_score":0.0047712126,"about_ca_system_score_codex":0.0022728755,"about_ca_system_score_gemma":0.0006560398,"threshold_uncertainty_score":0.023330986},"labels":[],"label_agreement":null},{"id":"W1492644044","doi":"10.1007/3-540-45486-1_27","title":"A Comparison of Association Rule Discovery and Bayesian Network Causal Inference Algorithms to Discover Relationships in Discrete Data","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Saskatchewan","funders":"","keywords":"Computer science; Bayesian network; Association rule learning; Inference; Causal inference; Bayesian probability; Data mining; Algorithm; Artificial intelligence; Bayesian inference; Association (psychology); Machine learning; Econometrics; Mathematics","score_opus":0.05066742567157008,"score_gpt":0.31339687381499537,"score_spread":0.2627294481434253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492644044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011766373,0.0040690787,0.97919685,0.0012583709,0.0001912076,0.00020699072,0.0002817929,0.0010072008,0.0020221036],"genre_scores_gemma":[0.06509212,0.0036739009,0.92746496,0.0005009664,0.00027405,0.00032839002,0.00073222275,0.00034085292,0.0015925902],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9823156,0.010901093,0.001095502,0.0014956853,0.0038860203,0.00030610256],"domain_scores_gemma":[0.72580016,0.25623772,0.0015780053,0.0070555233,0.00844823,0.0008804214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.044517048,0.0018868857,0.0038439948,0.006372462,0.001123246,0.005517994,0.0050600586,0.003278525,0.00425199],"category_scores_gemma":[0.11790581,0.0010545212,0.002364371,0.007607076,0.0018890451,0.010808609,0.0027263502,0.004400395,0.0014430858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015023361,0.00066549075,0.0056032296,0.0007672783,0.001219229,0.00009488041,0.00035988478,0.115781456,0.00056011777,0.06700141,0.009374042,0.7970707],"study_design_scores_gemma":[0.00027329658,0.00019376616,0.0013512998,0.000121756464,0.00034255246,0.00021521845,0.00012641751,0.91636014,0.00066735304,0.07738027,0.002915953,0.000051925694],"about_ca_topic_score_codex":0.007119018,"about_ca_topic_score_gemma":0.006864272,"teacher_disagreement_score":0.044517048,"about_ca_system_score_codex":0.0017584473,"about_ca_system_score_gemma":0.0041240132,"threshold_uncertainty_score":0.23543149},"labels":[],"label_agreement":null},{"id":"W1492727213","doi":"10.1007/978-3-642-30347-0_4","title":"The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Polyhedron; Combinatorics; Regular polygon; Graph; Planar graph; Computer science; Planar; Mathematics; Computer graphics (images); Geometry","score_opus":0.04097300087380767,"score_gpt":0.3051633410611392,"score_spread":0.2641903401873315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492727213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20852987,0.0021282253,0.3923355,0.008089958,0.00088675634,0.0005265876,0.0011027645,0.001045917,0.3853544],"genre_scores_gemma":[0.6554322,0.0018835579,0.23435695,0.0010899091,0.00022667582,0.0003976396,0.0012398278,0.0005379981,0.1048352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993462,0.00017104385,0.00002478126,0.00015310953,0.00014659234,0.00015822155],"domain_scores_gemma":[0.99911183,0.00050407206,0.000048078593,0.00014845109,0.000061305145,0.00012619962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476818,0.00087470014,0.0010858203,0.00066213997,0.0018117824,0.003162506,0.0023081978,0.0021812734,0.016251048],"category_scores_gemma":[0.0027945163,0.00051011326,0.001118159,0.0011812825,0.0032654917,0.0057599815,0.0029881601,0.0030896978,0.0014256767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024007761,0.000088207424,0.00027855762,0.00030619578,0.000044356435,0.000114315684,0.00037874636,0.028405689,0.002819256,0.9049388,0.016046992,0.046338808],"study_design_scores_gemma":[0.000047504374,0.00005880464,0.00016705443,0.00006364893,0.00003156047,0.00008828918,0.0003377317,0.056161694,0.002200347,0.9230569,0.017757978,0.000028603636],"about_ca_topic_score_codex":0.0030115643,"about_ca_topic_score_gemma":0.004775823,"teacher_disagreement_score":0.016251048,"about_ca_system_score_codex":0.001412333,"about_ca_system_score_gemma":0.0013156333,"threshold_uncertainty_score":0.054365218},"labels":[],"label_agreement":null},{"id":"W1492729957","doi":"10.1007/978-3-540-24773-9_7","title":"Specification and Validation of the Business Process Execution Language for Web Services","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Simon Fraser University","funders":"Microsoft Research","keywords":"Business Process Execution Language; Computer science; Software engineering; Web service; Business process; Process (computing); Programming language; Process management; Business; Service-oriented architecture; Work in process","score_opus":0.008925268853532295,"score_gpt":0.23547483148006387,"score_spread":0.2265495626265316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492729957","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.022694943,0.00014257875,0.96787775,0.00039086642,0.00008258035,0.0006680323,0.00036048127,0.0054506934,0.0023321935],"genre_scores_gemma":[0.24822514,0.0003727218,0.73723143,0.00049294013,0.0000743616,0.0011566486,0.002978907,0.003226145,0.0062416275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98287773,0.0050392984,0.0022066731,0.0012069481,0.007293229,0.0013760703],"domain_scores_gemma":[0.97300446,0.013276126,0.0019049017,0.0046868804,0.0067512486,0.00037631777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0172724,0.001270447,0.001388278,0.0016002777,0.0017155396,0.006750829,0.004961939,0.0029459835,0.002880692],"category_scores_gemma":[0.028364442,0.0025739681,0.0031761623,0.00088556064,0.0035336523,0.0052570957,0.0033828958,0.0051104478,0.0012335805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013004632,0.0012538091,0.004964552,0.0018406948,0.00031273658,0.0018434722,0.003667366,0.2550039,0.09114353,0.45674098,0.012671679,0.1692568],"study_design_scores_gemma":[0.0003244907,0.00033141655,0.00058818504,0.0003714811,0.00019626196,0.00042566744,0.00026100146,0.764061,0.14915545,0.054496937,0.029628266,0.0001597878],"about_ca_topic_score_codex":0.010292939,"about_ca_topic_score_gemma":0.0064704567,"teacher_disagreement_score":0.0172724,"about_ca_system_score_codex":0.0022398373,"about_ca_system_score_gemma":0.012379627,"threshold_uncertainty_score":0.091346264},"labels":[],"label_agreement":null},{"id":"W1492736196","doi":"10.1007/3-540-45402-0_33","title":"plp: A Generic Compiler for Ordered Logic Programs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Programming language; Computer science; Logic programming; Compiler; Answer set programming; Logic program; Stable model semantics; Set (abstract data type); Theoretical computer science; Semantics (computer science); Higher-order logic; Multimodal logic; Description logic","score_opus":0.03952314625983704,"score_gpt":0.26084834389164624,"score_spread":0.2213251976318092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492736196","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.002911028,0.00021872137,0.8780792,0.00019424729,0.0001505392,0.00018871836,0.0019944715,0.109234974,0.0070282305],"genre_scores_gemma":[0.056536302,0.0006162799,0.8824983,0.00071495003,0.000150281,0.00061673025,0.008931372,0.03665384,0.013282055],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.0001714016,0.00015540706,0.00018346493,0.00035696733,0.00016203373],"domain_scores_gemma":[0.9987047,0.00054017577,0.00007297458,0.00038303024,0.00022093208,0.00007820552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013841247,0.0015960914,0.0011067811,0.001374243,0.0007702844,0.0028306383,0.0029632992,0.001385284,0.02386798],"category_scores_gemma":[0.0036318002,0.002086257,0.0020076882,0.0015011737,0.0011847318,0.006367301,0.0040118457,0.0026392143,0.012841321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000780321,0.00034913275,0.0013428336,0.0019338038,0.00011411232,0.0004914057,0.0006964944,0.013577468,0.021445833,0.17914174,0.19309413,0.5870327],"study_design_scores_gemma":[0.00077343686,0.00019656269,0.00089054304,0.00046516827,0.00020294785,0.001050184,0.00030521714,0.15602286,0.097748585,0.33470652,0.40740573,0.00023231345],"about_ca_topic_score_codex":0.0012027932,"about_ca_topic_score_gemma":0.0019493159,"teacher_disagreement_score":0.02386798,"about_ca_system_score_codex":0.00096243306,"about_ca_system_score_gemma":0.0018062724,"threshold_uncertainty_score":0.07984638},"labels":[],"label_agreement":null},{"id":"W1492811553","doi":"10.1007/978-3-540-24677-0_13","title":"Gene Discovery in Leukemia Revisited: A Computational Intelligence Perspective","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","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":"National Research Council Canada","funders":"","keywords":"Computer science; Cluster analysis; Preprocessor; Perspective (graphical); Artificial neural network; Artificial intelligence; Knowledge extraction; Pattern recognition (psychology); Cluster (spacecraft); Gene; Computational biology; Data mining; Biology; Genetics","score_opus":0.011354714172665467,"score_gpt":0.2734514938106782,"score_spread":0.2620967796380127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492811553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022071797,0.24309848,0.35926855,0.3205889,0.0024454184,0.000054979893,0.0006629284,0.0003407882,0.051468197],"genre_scores_gemma":[0.6070342,0.17801067,0.16339625,0.02180204,0.013581419,0.00015982926,0.000561309,0.00023451184,0.015219769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824417,0.0009316631,0.00009628974,0.000219105,0.0004100856,0.000098727665],"domain_scores_gemma":[0.9836622,0.014889955,0.00035270426,0.00034918205,0.00054295134,0.00020303825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061909417,0.0008288331,0.0019760225,0.0042562475,0.00065509294,0.0055409106,0.0033999342,0.0024836536,0.0034324492],"category_scores_gemma":[0.016068814,0.0005567547,0.00110601,0.0045933644,0.007732281,0.009715456,0.002087856,0.0048653553,0.0005832354],"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.000061430714,0.00005111226,0.001418143,0.00044583308,0.000096146934,0.00022700068,0.00017201056,0.011139246,0.00023277424,0.9027692,0.01145253,0.07193458],"study_design_scores_gemma":[0.000014541555,0.000015526688,0.00020699229,0.000084902895,0.000027288987,0.00016829238,0.00008737865,0.018646047,0.00015793752,0.97207344,0.008506853,0.000010861022],"about_ca_topic_score_codex":0.0032143968,"about_ca_topic_score_gemma":0.0028101213,"teacher_disagreement_score":0.0061909417,"about_ca_system_score_codex":0.002125392,"about_ca_system_score_gemma":0.0013430498,"threshold_uncertainty_score":0.03274119},"labels":[],"label_agreement":null},{"id":"W1492850407","doi":"10.1007/11866763_10","title":"Data Weighting for Principal Component Noise Reduction in Contrast Enhanced Ultrasound","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound and Hyperthermia Applications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Health Sciences Centre; Sunnybrook Health Science Centre","funders":"","keywords":"Weighting; Principal component analysis; Imaging phantom; Ultrasound; Computer science; Noise (video); Artificial intelligence; Contrast (vision); Noise reduction; Pattern recognition (psychology); Acoustics; Optics; Physics; Image (mathematics)","score_opus":0.014196016470602339,"score_gpt":0.24347356973848924,"score_spread":0.2292775532678869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492850407","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.011371252,0.00055007637,0.9870777,0.000098158125,0.00006268014,0.000043755535,0.00007851901,0.0004333018,0.00028462813],"genre_scores_gemma":[0.10089824,0.0008533284,0.89536995,0.00009214321,0.000056351048,0.0001590747,0.0004993093,0.00037233197,0.0016992162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923325,0.0002264778,0.00006985677,0.00009590268,0.00031765556,0.000056881177],"domain_scores_gemma":[0.99838185,0.00067079713,0.000102697995,0.00017854501,0.00061797997,0.00004818769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012202483,0.0012458344,0.00075138407,0.00095305307,0.00043996624,0.0008541771,0.0007404834,0.0007717505,0.002220412],"category_scores_gemma":[0.0049282126,0.0005467998,0.0007716829,0.0012602558,0.00040039993,0.0010255249,0.0013194751,0.001033244,0.0011109732],"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.0006810959,0.00015754963,0.0007820947,0.00040998688,0.00008810804,0.000045437817,0.00012881619,0.024696175,0.14148645,0.0039916853,0.0022261855,0.82530636],"study_design_scores_gemma":[0.00006540202,0.0001995729,0.0032651809,0.000054844193,0.00016664622,0.00019108414,0.00009033177,0.8084604,0.17343308,0.0043444764,0.009667696,0.0000612679],"about_ca_topic_score_codex":0.0016020433,"about_ca_topic_score_gemma":0.0019424009,"teacher_disagreement_score":0.002220412,"about_ca_system_score_codex":0.0003114574,"about_ca_system_score_gemma":0.00080888247,"threshold_uncertainty_score":0.00742805},"labels":[],"label_agreement":null},{"id":"W1493005880","doi":"10.1007/978-3-642-04268-3_45","title":"Targeting Accuracy under Model-to-Subject Misalignments in Model-Guided Cardiac Surgery","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; Heart and Stroke Foundation of Canada","keywords":"Computer science; Subject (documents); Artificial intelligence; World Wide Web","score_opus":0.031275864293418415,"score_gpt":0.34381949695655484,"score_spread":0.31254363266313645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493005880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25177538,0.0011799523,0.74308187,0.0003746585,0.000108127235,0.000047190108,0.00013764342,0.0015647907,0.0017304185],"genre_scores_gemma":[0.96083736,0.00024352745,0.037311137,0.000099838486,0.00002512781,0.000024345092,0.00018100461,0.00019893427,0.0010787843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833614,0.0006037339,0.000112255126,0.00035144406,0.00043604482,0.00016046195],"domain_scores_gemma":[0.9920501,0.0061025727,0.000530139,0.000545655,0.0006300933,0.0001414271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029990715,0.0007606318,0.0013672189,0.00043062767,0.0003316705,0.0010712296,0.00070171116,0.0015519696,0.0006855384],"category_scores_gemma":[0.02007735,0.00058667595,0.0004416849,0.00047320095,0.0006727612,0.000890853,0.0011839669,0.00071927346,0.00040024405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020857824,0.000089036024,0.005986019,0.00019517897,0.00011624765,0.00014419429,0.0002765178,0.7682007,0.022040555,0.0013211779,0.0014180567,0.1981265],"study_design_scores_gemma":[0.00001884919,0.00017382808,0.004381858,0.000010229653,0.000036223748,0.00015817433,0.00003274494,0.9843164,0.009221082,0.0013496281,0.00028355294,0.000017495026],"about_ca_topic_score_codex":0.0059680887,"about_ca_topic_score_gemma":0.0031415666,"teacher_disagreement_score":0.0059680887,"about_ca_system_score_codex":0.0006116463,"about_ca_system_score_gemma":0.0012452139,"threshold_uncertainty_score":0.015860796},"labels":[],"label_agreement":null},{"id":"W1493085632","doi":"10.1007/978-3-540-92182-0_34","title":"Evaluation of General Set Expressions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"","keywords":"Computer science; Set (abstract data type); Algorithm; Programming language","score_opus":0.049047617759110235,"score_gpt":0.29884758397342837,"score_spread":0.24979996621431813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493085632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090045415,0.002025009,0.8029104,0.00087110914,0.00042705727,0.00031771118,0.00087928376,0.006170833,0.096353136],"genre_scores_gemma":[0.637583,0.0011204713,0.31377813,0.00042016633,0.00028526643,0.00024501423,0.0023526426,0.0027260801,0.04148928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596393,0.00087625335,0.0002111236,0.00049088435,0.0020650697,0.00039280838],"domain_scores_gemma":[0.9961647,0.0017675204,0.00015198418,0.00083976786,0.00094819465,0.00012775706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026891131,0.00083080307,0.0010745663,0.0012378508,0.0008061167,0.0027630816,0.001892651,0.00087250804,0.013273789],"category_scores_gemma":[0.008771821,0.00047309586,0.0011575829,0.0016970905,0.0018765829,0.0051378,0.002886965,0.0014218031,0.0024713485],"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.00074156787,0.00011805096,0.0011047722,0.00065983937,0.00008487587,0.00025638484,0.0005086015,0.024441388,0.018545337,0.6359809,0.016552025,0.3010062],"study_design_scores_gemma":[0.000080154496,0.00023329482,0.00078912615,0.00016906002,0.00013296682,0.00038230236,0.00024155376,0.16690657,0.03996165,0.7378844,0.053157445,0.000061482264],"about_ca_topic_score_codex":0.0010830351,"about_ca_topic_score_gemma":0.0016229731,"teacher_disagreement_score":0.013273789,"about_ca_system_score_codex":0.001983164,"about_ca_system_score_gemma":0.0011075083,"threshold_uncertainty_score":0.044405222},"labels":[],"label_agreement":null},{"id":"W1493135336","doi":"10.1007/978-3-540-92957-4_49","title":"Automatic Segmentation of Non-rigid Objects in Image Sequences Using Spatiotemporal Information","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Patient Safety Institute","keywords":"Segmentation; Artificial intelligence; Scale-space segmentation; Computer science; Computer vision; Segmentation-based object categorization; Image segmentation; Minimum spanning tree-based segmentation; Pattern recognition (psychology); Spatial analysis; Mathematics","score_opus":0.01604958594055905,"score_gpt":0.2927901648292021,"score_spread":0.27674057888864306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493135336","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.07289778,0.0020423075,0.92093366,0.00010112961,0.00009559586,0.00012703682,0.0004255976,0.0016949071,0.0016819144],"genre_scores_gemma":[0.22984062,0.0025422445,0.762114,0.00008345131,0.00010100952,0.00010606777,0.001746626,0.00035264832,0.0031133024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973077,0.000023727393,0.00002435121,0.00008320059,0.00008795465,0.000050041355],"domain_scores_gemma":[0.99962413,0.00010136465,0.00007781457,0.00005797038,0.00010507327,0.000033599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033564484,0.00090480404,0.00092991156,0.0025348414,0.0004243849,0.0009055277,0.0008247654,0.0007706019,0.0012133874],"category_scores_gemma":[0.0008768038,0.0006810922,0.0009156635,0.0023918708,0.00047359488,0.0009901985,0.0006127032,0.00046899976,0.0009221736],"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.00046642817,0.000096802556,0.0015139334,0.00042397526,0.000112561625,0.00046123512,0.00020605452,0.020876667,0.46487194,0.00251468,0.002210731,0.5062449],"study_design_scores_gemma":[0.0000308652,0.00025982247,0.014710319,0.0000951793,0.00025122412,0.0017601869,0.0002035185,0.73751724,0.22804566,0.007305362,0.009755385,0.00006524524],"about_ca_topic_score_codex":0.0049276142,"about_ca_topic_score_gemma":0.008944487,"teacher_disagreement_score":0.0049276142,"about_ca_system_score_codex":0.00038562,"about_ca_system_score_gemma":0.00078431424,"threshold_uncertainty_score":0.009797871},"labels":[],"label_agreement":null},{"id":"W1493148642","doi":"10.1007/3-540-44555-2_11","title":"Objects and Classification","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Université du Québec à Montréal","funders":"","keywords":"Viewpoints; Computer science; Object-oriented programming; Object (grammar); Representation (politics); Knowledge representation and reasoning; Information retrieval; Artificial intelligence; Programming language","score_opus":0.019233320596600267,"score_gpt":0.2455053830318103,"score_spread":0.22627206243521003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493148642","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.015506423,0.18622383,0.28441718,0.018004702,0.007925302,0.0001633405,0.0030244812,0.0017782245,0.48295647],"genre_scores_gemma":[0.21160792,0.062861785,0.118945725,0.003317561,0.007803964,0.0003180407,0.0073588914,0.0008884592,0.5868977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991703,0.00013597423,0.000056972054,0.0002843679,0.00029602737,0.00005647513],"domain_scores_gemma":[0.99930835,0.00021215036,0.000051147254,0.00023587137,0.00014144638,0.000051114486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007841363,0.0007688818,0.0012283939,0.0025921182,0.001325526,0.0057040597,0.001270156,0.0012043288,0.021765642],"category_scores_gemma":[0.0023122455,0.000518284,0.00067412114,0.0048011052,0.0031146826,0.0077502183,0.0019091988,0.001952861,0.0100120725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018488017,0.000012664794,0.00038634907,0.0001826173,0.000018741679,0.00003412295,0.00024520748,0.0005216252,0.0002847274,0.76751107,0.060307965,0.17047648],"study_design_scores_gemma":[0.0000043567425,0.000009240304,0.0004436334,0.00006808726,0.000017285056,0.000167273,0.000105872394,0.001516667,0.00032056545,0.71741873,0.27991942,0.0000088843735],"about_ca_topic_score_codex":0.0028092726,"about_ca_topic_score_gemma":0.0021264742,"teacher_disagreement_score":0.021765642,"about_ca_system_score_codex":0.0015353361,"about_ca_system_score_gemma":0.00086451555,"threshold_uncertainty_score":0.07281333},"labels":[],"label_agreement":null},{"id":"W1493150479","doi":"10.1007/3-540-44842-x_4","title":"Testing Differences between Case and Control Point Patterns Using Nearest Neighbour Distances and Bootstrapping","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data-Driven Disease Surveillance","field":"Medicine","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":"McGill University Health Centre; McGill University","funders":"","keywords":"Bootstrapping (finance); Nearest neighbour; Computer science; Wilcoxon signed-rank test; Statistics; Null hypothesis; Point pattern analysis; Point (geometry); Control point; Artificial intelligence; Pattern recognition (psychology); Data mining; Mathematics; Common spatial pattern; Econometrics; Mann–Whitney U test","score_opus":0.039131520312830535,"score_gpt":0.27310831292405513,"score_spread":0.2339767926112246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493150479","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.76334393,0.00068257545,0.23056139,0.0003138748,0.00026977155,0.00044419206,0.0018817264,0.00041967697,0.0020827423],"genre_scores_gemma":[0.9231236,0.00011723183,0.07291042,0.0000834247,0.00005411073,0.0003909677,0.0025774369,0.00008791083,0.00065486005],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9235201,0.04990875,0.005651176,0.011598894,0.008274069,0.0010470776],"domain_scores_gemma":[0.74362314,0.22789307,0.0052867373,0.016996881,0.0050645825,0.0011356456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.044809956,0.0011190312,0.002186006,0.003186775,0.0011624541,0.0018189715,0.004805776,0.0026949535,0.003964693],"category_scores_gemma":[0.16408683,0.00072220055,0.0035243393,0.0033550013,0.0019270923,0.0023701007,0.0014287988,0.0023011512,0.00095210056],"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.006740104,0.0015096323,0.72387904,0.00081032404,0.010528218,0.0014652901,0.0016424422,0.013308041,0.010213032,0.0046364004,0.0029407837,0.2223267],"study_design_scores_gemma":[0.0010018816,0.0062162844,0.52059066,0.00027329748,0.00408684,0.005181653,0.0036481947,0.4112683,0.012191046,0.029655024,0.0056417543,0.00024510405],"about_ca_topic_score_codex":0.0020021154,"about_ca_topic_score_gemma":0.0018475113,"teacher_disagreement_score":0.044809956,"about_ca_system_score_codex":0.00047996955,"about_ca_system_score_gemma":0.0006745067,"threshold_uncertainty_score":0.2369805},"labels":[],"label_agreement":null},{"id":"W1493172839","doi":"10.1007/978-3-642-02574-7_91","title":"Rapid Development of Scoped User Interfaces","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Formalism (music); Abstraction; Visual modeling; Programming language; Human–computer interaction; User interface; Software engineering; Theoretical computer science; Unified Modeling Language; Distributed computing; Software","score_opus":0.0191665010000816,"score_gpt":0.24134177233680504,"score_spread":0.22217527133672343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493172839","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.02604157,0.0010426849,0.95215064,0.000105254825,0.00010087836,0.00022201547,0.00028269785,0.011505507,0.008548773],"genre_scores_gemma":[0.06534837,0.0011699918,0.9205947,0.000092788905,0.000028330991,0.00025775068,0.0009766291,0.0018207845,0.0097106835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892235,0.00018757337,0.00007068788,0.00012452896,0.00064071186,0.00005416459],"domain_scores_gemma":[0.9976847,0.0010698395,0.00007242717,0.0004893837,0.00058083783,0.000102709906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825022,0.00063897704,0.0005172954,0.00076161826,0.00019848622,0.0009936539,0.0014559487,0.0006715287,0.010175496],"category_scores_gemma":[0.0058381893,0.00070609496,0.0006376286,0.0004500995,0.00029342962,0.0020696702,0.0020460677,0.0010242151,0.003427341],"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.00014035052,0.00008955267,0.00079147733,0.00043176409,0.00004363591,0.00026168494,0.00058853516,0.0063760746,0.11914077,0.014059187,0.009730307,0.84834665],"study_design_scores_gemma":[0.0002878117,0.001556089,0.0060787164,0.00079324166,0.00023159051,0.0022732557,0.0005578407,0.27886266,0.31397957,0.039406285,0.35582823,0.00014474441],"about_ca_topic_score_codex":0.00027318852,"about_ca_topic_score_gemma":0.00044126261,"teacher_disagreement_score":0.010175496,"about_ca_system_score_codex":0.00019474275,"about_ca_system_score_gemma":0.00040724708,"threshold_uncertainty_score":0.03404045},"labels":[],"label_agreement":null},{"id":"W1493197938","doi":"10.1007/3-540-45876-x_11","title":"On Efficient Matching of Streaming XML Documents and Queries","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; XML; Matching (statistics); Database; Index (typography); Set (abstract data type); Requirements analysis; Service (business); Information retrieval; Data mining; World Wide Web; Software; Programming language","score_opus":0.010800471698987754,"score_gpt":0.23817247239127143,"score_spread":0.22737200069228367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493197938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0310399,0.0015210785,0.95338166,0.0006307347,0.00023008342,0.0003598822,0.00085995614,0.0070362603,0.0049404213],"genre_scores_gemma":[0.15229714,0.001397126,0.8270897,0.00045898792,0.00030923783,0.0003058545,0.005527303,0.0013165476,0.01129806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938234,0.0014631755,0.0007316021,0.00096110115,0.0024327862,0.00058795133],"domain_scores_gemma":[0.98642075,0.007863961,0.0005278859,0.0038611975,0.0010533972,0.00027287734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004677263,0.0014223163,0.003149022,0.0032316719,0.0016450947,0.0035964155,0.0044788243,0.0023993305,0.009427236],"category_scores_gemma":[0.01976173,0.001339778,0.0015945884,0.008964405,0.0017505252,0.011842643,0.005519485,0.0017875205,0.0030884747],"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.0024655496,0.00046252212,0.0022068422,0.0005539409,0.00019337884,0.00027582093,0.0005679662,0.08257471,0.019754024,0.092579,0.03313116,0.76523507],"study_design_scores_gemma":[0.00035493835,0.00036690672,0.0011886831,0.000090951944,0.00016501955,0.0004926259,0.0003560009,0.69515836,0.02185688,0.26081663,0.019066283,0.00008671158],"about_ca_topic_score_codex":0.009369181,"about_ca_topic_score_gemma":0.008314972,"teacher_disagreement_score":0.009427236,"about_ca_system_score_codex":0.0023051482,"about_ca_system_score_gemma":0.0029100303,"threshold_uncertainty_score":0.031537294},"labels":[],"label_agreement":null},{"id":"W1493210595","doi":"10.1007/3-540-45067-x_8","title":"Generic GF(2m) Arithmetic in Software and Its Application to ECC","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Elliptic curve cryptography; Arithmetic; Operand; Context (archaeology); Multiplication (music); Elliptic curve; Cryptosystem; Field (mathematics); Public-key cryptography; Binary number; Elliptic curve point multiplication; Cryptography; Theoretical computer science; Algorithm; Computer hardware; Operating system; Encryption; Mathematics","score_opus":0.011341873299499731,"score_gpt":0.226159055574021,"score_spread":0.21481718227452126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493210595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08931756,0.012220522,0.6742439,0.0015416582,0.0008026075,0.0000900778,0.00016437139,0.0018248021,0.2197945],"genre_scores_gemma":[0.7395085,0.007250397,0.21676952,0.0003135272,0.0007070689,0.00008112583,0.00016902752,0.0003656496,0.034835204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.00008027199,0.000020728574,0.000050844785,0.00017270641,0.000042383588],"domain_scores_gemma":[0.9993987,0.0002504268,0.000047490015,0.00021859973,0.0000713715,0.000013367966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039245776,0.0005245234,0.0005231817,0.0014768759,0.0005943782,0.0012305446,0.0005304645,0.0010476311,0.0040276297],"category_scores_gemma":[0.0026890852,0.0003115798,0.00050708576,0.0027098453,0.0014796575,0.0015333154,0.0012051011,0.0009262966,0.0010040293],"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.00006120367,0.000028698501,0.00038587573,0.00019936521,0.000011344747,0.00044270162,0.00036355178,0.020177145,0.008973924,0.77165186,0.006324392,0.19137998],"study_design_scores_gemma":[0.000021668262,0.00010247048,0.00076323625,0.00016376642,0.000026622138,0.0019750271,0.00010476273,0.117029056,0.009049123,0.813525,0.05718601,0.000053279346],"about_ca_topic_score_codex":0.0004342988,"about_ca_topic_score_gemma":0.00052168773,"teacher_disagreement_score":0.0040276297,"about_ca_system_score_codex":0.00056313485,"about_ca_system_score_gemma":0.00030985067,"threshold_uncertainty_score":0.013473809},"labels":[],"label_agreement":null},{"id":"W1493246429","doi":"10.1007/978-3-540-30074-8_9","title":"Neuroanatomy Registration: An Algebraic-Topology Based Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"","keywords":"Computer science; ENCODE; Topology (electrical circuits); Algebraic number; Decomposition; Image (mathematics); Algebraic topology; Physical law; Differential (mechanical device); Scheme (mathematics); Deformation (meteorology); Applied mathematics; Theoretical computer science; Algebra over a field; Artificial intelligence; Mathematics; Mathematical analysis; Pure mathematics","score_opus":0.02057634803163264,"score_gpt":0.2769336381050219,"score_spread":0.25635729007338925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493246429","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.0025661704,0.0001275316,0.99537647,0.00011102256,0.00002595391,0.000032165335,0.0000374181,0.00033956315,0.0013836938],"genre_scores_gemma":[0.08771586,0.00074927777,0.9070643,0.00006422179,0.000112369955,0.0001169379,0.00022784938,0.00047068347,0.0034784656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989304,0.0002415965,0.000073934054,0.00022989014,0.0004669551,0.00005721578],"domain_scores_gemma":[0.99875104,0.00039207138,0.00019785285,0.0002848266,0.00030355304,0.00007061661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013363697,0.00087705033,0.0015440932,0.0032571754,0.0011302577,0.003809328,0.0027491278,0.0014536163,0.0035666856],"category_scores_gemma":[0.0032368645,0.0010172462,0.0016203792,0.0030390555,0.0016980714,0.0030915237,0.0026227804,0.0018652173,0.0021168978],"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.00018808573,0.00010769084,0.0011808189,0.0006630765,0.00020661649,0.000553024,0.00042497323,0.12345537,0.05701011,0.20762195,0.0057611647,0.60282713],"study_design_scores_gemma":[0.000030688294,0.00021010479,0.0012392448,0.0000559697,0.00012926613,0.0026033865,0.00022612995,0.78319895,0.02105865,0.16820815,0.022939539,0.00009999235],"about_ca_topic_score_codex":0.0013290959,"about_ca_topic_score_gemma":0.0020105955,"teacher_disagreement_score":0.003809328,"about_ca_system_score_codex":0.00052878674,"about_ca_system_score_gemma":0.0013174365,"threshold_uncertainty_score":0.011931717},"labels":[],"label_agreement":null},{"id":"W1493248875","doi":"10.1007/978-3-642-15294-8_29","title":"Pair HMM Based Gap Statistics for Re-evaluation of Indels in Alignments with Affine Gap Penalties","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Simon Fraser University","funders":"","keywords":"Hidden Markov model; Computer science; Complement (music); Affine transformation; Focus (optics); Exploit; Indel; Markov chain; Reliability (semiconductor); Data mining; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.03687969108914903,"score_gpt":0.28085967254911304,"score_spread":0.24397998145996402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493248875","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.028233081,0.0005650169,0.9511085,0.00006150675,0.00014457335,0.00015774976,0.0012473834,0.017573278,0.0009088561],"genre_scores_gemma":[0.09931428,0.00013956567,0.8936439,0.000049388702,0.0000369477,0.00024559774,0.002750386,0.0026746185,0.00114523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956897,0.0016562943,0.00046341566,0.00078252016,0.0011648325,0.00024320005],"domain_scores_gemma":[0.98677653,0.008527154,0.00066546985,0.0018632371,0.0018295443,0.00033806066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056458553,0.0014693023,0.0023223383,0.0030077898,0.0010803569,0.002055527,0.003220411,0.0022539836,0.009024845],"category_scores_gemma":[0.018722758,0.0011356663,0.0013511202,0.0038713655,0.00069306995,0.0028555968,0.0021601357,0.0027619188,0.0052250284],"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.003437354,0.0005956607,0.007156171,0.0011763017,0.0006481684,0.00043103468,0.00045643674,0.054918647,0.075783186,0.01197087,0.017574644,0.8258515],"study_design_scores_gemma":[0.00017646492,0.0004862238,0.005502145,0.00009778545,0.00019998632,0.00056017254,0.0002109599,0.88552094,0.08370212,0.016593829,0.0068123797,0.00013695763],"about_ca_topic_score_codex":0.0016669005,"about_ca_topic_score_gemma":0.0046455422,"teacher_disagreement_score":0.009024845,"about_ca_system_score_codex":0.0007913452,"about_ca_system_score_gemma":0.0015358273,"threshold_uncertainty_score":0.030191183},"labels":[],"label_agreement":null},{"id":"W1493285459","doi":"10.1007/11663430_22","title":"Workshop on Models for Non-functional Properties of Component-Based Software – NfC","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Session (web analytics); Software engineering; Context (archaeology); Component (thermodynamics); Software development; Software; Process (computing); Abstraction; Automation; Component-based software engineering; Programming language; World Wide Web","score_opus":0.06298537623259153,"score_gpt":0.26164875925137365,"score_spread":0.1986633830187821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493285459","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138469385,0.004053818,0.9349788,0.0027368742,0.0018349261,0.0001833024,0.0002596425,0.00095767365,0.041148018],"genre_scores_gemma":[0.262153,0.0076369927,0.6082196,0.0011502249,0.0014960915,0.0006403985,0.002081175,0.001304315,0.115318045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985228,0.00041060383,0.000120595956,0.00029534334,0.0005368655,0.000113800415],"domain_scores_gemma":[0.9976674,0.0009407004,0.000052506923,0.0006525049,0.00056326954,0.0001237083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030286107,0.0014945876,0.0012004261,0.0009241786,0.0007754885,0.0028482028,0.0036311115,0.0021364712,0.007942592],"category_scores_gemma":[0.0040511065,0.00094315497,0.0026699114,0.0009723693,0.0013038191,0.005219759,0.0018523125,0.003671035,0.0021325632],"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.00028528157,0.00039259862,0.00061047304,0.00060953,0.0001560146,0.0006144744,0.0011397374,0.07794135,0.013827383,0.6497396,0.041080743,0.21360278],"study_design_scores_gemma":[0.000078383506,0.00019729644,0.00049697974,0.0005247703,0.00012457972,0.000616832,0.00016460149,0.31048727,0.014428322,0.40011716,0.2726697,0.000094174204],"about_ca_topic_score_codex":0.005082848,"about_ca_topic_score_gemma":0.003784589,"teacher_disagreement_score":0.007942592,"about_ca_system_score_codex":0.002558151,"about_ca_system_score_gemma":0.0018984627,"threshold_uncertainty_score":0.026570618},"labels":[],"label_agreement":null},{"id":"W1493300643","doi":"10.1007/11581772_51","title":"Radial Projection: A Feature Extraction Method for Topographical Shapes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Similarity (geometry); Feature extraction; Computer vision; Curvature; Projection (relational algebra); Image retrieval; Segmentation; Image (mathematics); Scale space; Set (abstract data type); Image processing; Mathematics; Algorithm","score_opus":0.024098229478396214,"score_gpt":0.31214333517969545,"score_spread":0.2880451057012992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493300643","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.0020743124,0.00029152917,0.99328494,0.000038262304,0.000040305236,0.000049812446,0.00021515232,0.0031660877,0.0008396401],"genre_scores_gemma":[0.024317663,0.0008652146,0.9688278,0.00005038843,0.0000697314,0.00013285286,0.0009874137,0.0009079338,0.0038410053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937135,0.000073632524,0.000029087769,0.00011265309,0.0003645655,0.000048707458],"domain_scores_gemma":[0.9995147,0.00010557077,0.00003225151,0.00008909489,0.00023143398,0.000026924154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053014205,0.0015827593,0.0011527654,0.0019413402,0.0004569972,0.0011351645,0.001511936,0.0007515369,0.0069095884],"category_scores_gemma":[0.0012725808,0.0007456079,0.0010523875,0.0029672706,0.00048347565,0.0013864507,0.0011420823,0.0010816539,0.006963611],"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.00013555384,0.000040395353,0.00031703245,0.00031064174,0.000050618342,0.00012889128,0.0000987797,0.0074658114,0.07260194,0.0040300507,0.014269624,0.9005506],"study_design_scores_gemma":[0.00008023321,0.00022252723,0.0037123265,0.000103882776,0.0001955394,0.0023485583,0.00017069717,0.6471407,0.23398273,0.013634116,0.09819964,0.00020918521],"about_ca_topic_score_codex":0.0025221317,"about_ca_topic_score_gemma":0.002852141,"teacher_disagreement_score":0.0069095884,"about_ca_system_score_codex":0.00022940345,"about_ca_system_score_gemma":0.0007503044,"threshold_uncertainty_score":0.02311486},"labels":[],"label_agreement":null},{"id":"W1493303707","doi":"10.1007/978-3-540-85097-7_22","title":"Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","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 Windsor","funders":"","keywords":"Ant colony optimization algorithms; Traffic grooming; Computer science; Metaheuristic; Wavelength-division multiplexing; Routing (electronic design automation); Node (physics); Computer network; Ant colony; Mathematical optimization; Parallel metaheuristic; Distributed computing; Algorithm; Mathematics; Engineering","score_opus":0.012770809918331913,"score_gpt":0.21653277357417483,"score_spread":0.20376196365584293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493303707","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.041710332,0.0031193458,0.9349622,0.0004996179,0.00024405032,0.000088955065,0.00007591024,0.0003862002,0.01891337],"genre_scores_gemma":[0.50956345,0.0017558521,0.47140318,0.00029086578,0.00015863658,0.0002884663,0.00012783486,0.00021372367,0.016197916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998197,0.00007398858,0.00000570862,0.000017633225,0.00005897608,0.000024030178],"domain_scores_gemma":[0.99966764,0.00021562733,0.000027587637,0.000018174556,0.00005283948,0.000018287465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043784853,0.00059774256,0.0007179114,0.0004434372,0.00037190446,0.0006505982,0.0009364059,0.0011474103,0.0015779412],"category_scores_gemma":[0.0010504829,0.00033929676,0.00041610716,0.0008110536,0.00042468216,0.0005172367,0.0004900801,0.0009770483,0.00024825518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036178193,0.0000425825,0.00009359126,0.00004937984,0.000022750552,0.00002523478,0.00002007013,0.94862175,0.0010848859,0.008746824,0.0015695755,0.039687235],"study_design_scores_gemma":[0.0000062037125,0.000011037449,0.000020295654,0.0000042391102,0.0000028519023,0.0000053356216,0.0000039253846,0.99763536,0.00016282273,0.0016815487,0.00046485357,0.0000014551042],"about_ca_topic_score_codex":0.0037858407,"about_ca_topic_score_gemma":0.003902593,"teacher_disagreement_score":0.0037858407,"about_ca_system_score_codex":0.00055794546,"about_ca_system_score_gemma":0.00073701056,"threshold_uncertainty_score":0.0075276494},"labels":[],"label_agreement":null},{"id":"W1493313087","doi":"10.1007/978-3-642-15711-0_70","title":"Probabilistic Multi-Shape Representation Using an Isometric Log-Ratio Mapping","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Simon Fraser University","funders":"","keywords":"Simplex; Probabilistic logic; Computer science; Euclidean space; Shape analysis (program analysis); Principal component analysis; Statistical model; Algorithm; Artificial intelligence; Mathematics; Pattern recognition (psychology); Combinatorics","score_opus":0.06032258157147319,"score_gpt":0.3429956427986851,"score_spread":0.2826730612272119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493313087","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.0052081756,0.000069911235,0.9934383,0.00008661848,0.000021492535,0.00001783761,0.00004543999,0.00024859046,0.00086362695],"genre_scores_gemma":[0.28942958,0.0005402515,0.7033208,0.00018363803,0.00014963561,0.00014541157,0.0003826909,0.0005124157,0.005335593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944943,0.0001202749,0.000029075092,0.00012568367,0.00024045976,0.000035125682],"domain_scores_gemma":[0.999376,0.00018753277,0.000081944825,0.00019616733,0.000115650124,0.00004272091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641252,0.0005510364,0.0006841284,0.0014720114,0.00032327094,0.0012158158,0.0013024767,0.001106906,0.0033238984],"category_scores_gemma":[0.002360708,0.0005567481,0.0010670379,0.0012642912,0.0006927499,0.0018714936,0.0018702069,0.0011462626,0.0013586093],"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.00032242146,0.0001339943,0.00086856016,0.0002802689,0.000085020205,0.00035378596,0.00018757113,0.18028924,0.07320987,0.1643725,0.0041255304,0.5757712],"study_design_scores_gemma":[0.00000975064,0.0000558312,0.00043803276,0.0000112422,0.000018281686,0.0005527184,0.000027279144,0.9561852,0.0057897274,0.034014434,0.002869294,0.00002819018],"about_ca_topic_score_codex":0.00076411397,"about_ca_topic_score_gemma":0.0006108205,"teacher_disagreement_score":0.0033238984,"about_ca_system_score_codex":0.00031981952,"about_ca_system_score_gemma":0.00039631294,"threshold_uncertainty_score":0.011119604},"labels":[],"label_agreement":null},{"id":"W1493340370","doi":"10.1007/978-3-642-04205-8_21","title":"Privacy FP-Tree","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Calgary","funders":"","keywords":"Computer science; Tree (set theory); Computer security; Mathematics","score_opus":0.026980325375364725,"score_gpt":0.2630954752614305,"score_spread":0.2361151498860658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493340370","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.01691705,0.0026061556,0.7864373,0.00781047,0.00097020325,0.0002487984,0.006137795,0.0052579385,0.17361434],"genre_scores_gemma":[0.3922493,0.004130973,0.43942374,0.004233318,0.0009217665,0.0004318898,0.013333863,0.0025821596,0.14269297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981579,0.00024821845,0.0001006639,0.00041844486,0.00081762363,0.00025715577],"domain_scores_gemma":[0.9971589,0.000887451,0.000089167195,0.0013170608,0.00043870215,0.000108760614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015732072,0.0005663249,0.0008758081,0.00092260906,0.0014534399,0.0027652464,0.0013378654,0.0013721727,0.018551668],"category_scores_gemma":[0.005735454,0.00043777633,0.00091700756,0.0018619912,0.0010964725,0.005353113,0.0024843095,0.0041654925,0.008237512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025033095,0.000082562394,0.00035918475,0.00026377218,0.00004318625,0.000102669845,0.00011338145,0.010214039,0.0022003269,0.6520806,0.09498653,0.23930344],"study_design_scores_gemma":[0.000026354417,0.000033737208,0.0001728219,0.00006311241,0.000041088948,0.000415567,0.00003095629,0.02609964,0.0034379936,0.8763395,0.09332164,0.00001759911],"about_ca_topic_score_codex":0.0011156704,"about_ca_topic_score_gemma":0.0011308388,"teacher_disagreement_score":0.018551668,"about_ca_system_score_codex":0.0017578481,"about_ca_system_score_gemma":0.0020585712,"threshold_uncertainty_score":0.06206155},"labels":[],"label_agreement":null},{"id":"W1493350325","doi":"10.1007/3-540-45071-8_55","title":"Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parameterized complexity; Bounded function; Variable (mathematics); Computer science; Computational complexity theory; Time complexity; Satisfiability; Tree (set theory); Discrete mathematics; Combinatorics; Algorithm; Mathematics","score_opus":0.019886599099719942,"score_gpt":0.25577968761385705,"score_spread":0.23589308851413712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493350325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17818724,0.0022015756,0.7147774,0.0065083196,0.00020769994,0.00035915116,0.0025539782,0.003941424,0.091263264],"genre_scores_gemma":[0.8165449,0.0011323203,0.15596889,0.0008864933,0.00024308574,0.00043981217,0.0035390614,0.0011623966,0.020083116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975381,0.00045401952,0.00014568577,0.0005629643,0.00089322793,0.00040607134],"domain_scores_gemma":[0.9905743,0.0072426107,0.00050562393,0.0010267716,0.00048806568,0.00016266179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015662466,0.0012530085,0.0022268773,0.0013157537,0.0014654198,0.00551333,0.0051232795,0.0021517845,0.01005872],"category_scores_gemma":[0.013302566,0.0017753205,0.002518695,0.0035082628,0.0030882384,0.0122942,0.0029728876,0.010011123,0.0011123572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061661017,0.00027715336,0.0010844093,0.0006210419,0.00016111758,0.0004257469,0.0006940653,0.050899763,0.0064726523,0.8462518,0.012836725,0.07965905],"study_design_scores_gemma":[0.000121820005,0.000019088631,0.00021829538,0.000040179868,0.00009618787,0.0001300819,0.000096527976,0.05324422,0.002870973,0.9400981,0.003043371,0.000021151911],"about_ca_topic_score_codex":0.0036344684,"about_ca_topic_score_gemma":0.0057399482,"teacher_disagreement_score":0.01005872,"about_ca_system_score_codex":0.0042237747,"about_ca_system_score_gemma":0.0022220248,"threshold_uncertainty_score":0.033649802},"labels":[],"label_agreement":null},{"id":"W1493404814","doi":"10.1007/11600930_69","title":"Packing Trees in Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University; University of Toronto","funders":"","keywords":"Linear programming relaxation; Integer programming; Steiner tree problem; Approximation algorithm; Solver; Relaxation (psychology); Spanning tree; Combinatorics; Linear programming; Time complexity; Block (permutation group theory); Set packing; Tree (set theory); Computer science; Multicast; Mathematics; Independent set; Graph; Set (abstract data type); Mathematical optimization","score_opus":0.02363825283242386,"score_gpt":0.2889289885727813,"score_spread":0.26529073574035744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493404814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032096714,0.03868223,0.53285277,0.0030914706,0.0029467037,0.00015238489,0.00042904838,0.0011791856,0.3885695],"genre_scores_gemma":[0.3972135,0.059442174,0.28655925,0.0015374656,0.004673164,0.0004538109,0.0015600084,0.0010516956,0.24750888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997004,0.00007447273,0.000013727047,0.00004747233,0.00012347392,0.000040465722],"domain_scores_gemma":[0.99955505,0.00023322675,0.000033585336,0.00008737866,0.00005208232,0.00003867743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480711,0.0007263837,0.0010366001,0.0012896985,0.0008696573,0.0021185575,0.00080215314,0.0011737468,0.01069846],"category_scores_gemma":[0.0015848314,0.0007918465,0.00045264495,0.0046806163,0.0010157663,0.0033572167,0.0011312503,0.0022344335,0.0033287862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022567263,0.000027890299,0.000076962795,0.00020195016,0.000010165917,0.00007471622,0.00018663288,0.009109941,0.00082190085,0.8554356,0.026022447,0.10800918],"study_design_scores_gemma":[0.00000608575,0.00001771055,0.00010226769,0.000055506825,0.000009621918,0.00017673138,0.00004846112,0.017113296,0.00033129173,0.9322688,0.049863335,0.0000069079915],"about_ca_topic_score_codex":0.00057658594,"about_ca_topic_score_gemma":0.0006860649,"teacher_disagreement_score":0.01069846,"about_ca_system_score_codex":0.00078992127,"about_ca_system_score_gemma":0.00036820298,"threshold_uncertainty_score":0.035789967},"labels":[],"label_agreement":null},{"id":"W1493450895","doi":"10.1007/3-540-47922-8_15","title":"Genetic Algorithms for Continuous Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crossover; Computer science; Encoding (memory); Algorithm; Bit array; String (physics); Decoding methods; Floating point; Range (aeronautics); Genetic algorithm; Chromosome; Point (geometry); Theoretical computer science; Mathematics; Artificial intelligence; Type (biology); Machine learning","score_opus":0.03575385609887436,"score_gpt":0.2751730455615375,"score_spread":0.23941918946266313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493450895","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.0024800587,0.019695966,0.91320235,0.0008834239,0.0012194203,0.000055342574,0.00010009574,0.000658606,0.061704792],"genre_scores_gemma":[0.118739545,0.022715375,0.7530944,0.00075828785,0.0013342258,0.00045617006,0.0005595691,0.0006742779,0.10166817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961793,0.00010842049,0.000012822126,0.00004978961,0.00018859575,0.000022367112],"domain_scores_gemma":[0.9996921,0.00018134619,0.000013602273,0.000055058168,0.000046075926,0.000011779355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043937084,0.0011316156,0.0010747096,0.00070069375,0.00036842682,0.0013807584,0.0011957063,0.0016468775,0.010635147],"category_scores_gemma":[0.0015903399,0.00045864173,0.0007073285,0.002108314,0.0010728325,0.0010704043,0.00094912713,0.002446117,0.0038844526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037581987,0.00006545913,0.00012144927,0.00045264597,0.00008346847,0.00010686975,0.00012621164,0.2210509,0.0020538452,0.33962685,0.03349755,0.40277705],"study_design_scores_gemma":[0.000056715915,0.000061220104,0.00023757316,0.00019228632,0.00003986914,0.00017984567,0.00004542681,0.39485556,0.0012264679,0.47268233,0.13039413,0.00002858063],"about_ca_topic_score_codex":0.0013813028,"about_ca_topic_score_gemma":0.00121996,"teacher_disagreement_score":0.010635147,"about_ca_system_score_codex":0.0006482148,"about_ca_system_score_gemma":0.0005870966,"threshold_uncertainty_score":0.035578072},"labels":[],"label_agreement":null},{"id":"W1493469155","doi":"10.1007/11788034_23","title":"Finding Faces in Gray Scale Images Using Locally Linear Embeddings","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"McGill University","funders":"","keywords":"Computer science; Grayscale; Artificial intelligence; Computer vision; Scale (ratio); Computer graphics (images); Pattern recognition (psychology); Image (mathematics); Cartography; Geography","score_opus":0.018329547117629675,"score_gpt":0.26402468462012246,"score_spread":0.24569513750249278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493469155","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.08021849,0.0005633688,0.9136722,0.00020106354,0.000053739674,0.000114050425,0.00032781414,0.0023575532,0.002491669],"genre_scores_gemma":[0.37190947,0.0009149274,0.61903346,0.00011664844,0.00008126694,0.00013084679,0.0010599202,0.00047080437,0.0062826653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997137,0.000035929672,0.00001492056,0.000097120086,0.00009008459,0.000048269736],"domain_scores_gemma":[0.9996282,0.00013520065,0.000043434884,0.00009006133,0.0000727532,0.000030368681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026567042,0.00094388763,0.0011996751,0.0014371406,0.0003001204,0.0011552442,0.00096213736,0.00078795117,0.005663664],"category_scores_gemma":[0.0012629421,0.0006165078,0.0008433038,0.0013427231,0.0005347339,0.0022219708,0.0014177002,0.0008803835,0.002521791],"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.0003431678,0.00014273991,0.0020931344,0.0002703308,0.00007025914,0.00017726327,0.00017717556,0.030397369,0.093870185,0.005785164,0.00545083,0.86122245],"study_design_scores_gemma":[0.00005303881,0.0003499587,0.0042499085,0.000061471255,0.00009095578,0.00091565534,0.00061826425,0.9008116,0.053604748,0.034129832,0.005061207,0.000053379248],"about_ca_topic_score_codex":0.001547301,"about_ca_topic_score_gemma":0.0023885714,"teacher_disagreement_score":0.005663664,"about_ca_system_score_codex":0.00030361302,"about_ca_system_score_gemma":0.00030238443,"threshold_uncertainty_score":0.018946826},"labels":[],"label_agreement":null},{"id":"W1493489306","doi":"10.1007/11548669_60","title":"On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Windsor","funders":"","keywords":"Inference; Bayesian network; Computational complexity theory; Computer science; Bayesian inference; Probabilistic logic; Bayesian probability; Point (geometry); Artificial intelligence; Theoretical computer science; Machine learning; Algorithm; Mathematics","score_opus":0.04601811159683019,"score_gpt":0.26185585656075494,"score_spread":0.21583774496392474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493489306","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.044742543,0.0034437543,0.924901,0.007805206,0.00017838458,0.000120802615,0.00074070046,0.00034654568,0.017720973],"genre_scores_gemma":[0.6160636,0.007963331,0.3561256,0.0020164875,0.0024562213,0.0007455211,0.0022690126,0.00060802174,0.011752234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896679,0.005058663,0.00070703245,0.0015013209,0.0025531608,0.00051194086],"domain_scores_gemma":[0.72529554,0.25937542,0.0042141294,0.006402901,0.0030675156,0.0016444732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012020271,0.0017628999,0.004577176,0.0034497774,0.0027878627,0.008653168,0.0053960974,0.0045879954,0.009538961],"category_scores_gemma":[0.1070974,0.0027784386,0.0042023417,0.0050512343,0.008298224,0.02859981,0.0070699183,0.01162446,0.0008700254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013687965,0.00006972844,0.001027553,0.00034348213,0.00013983624,0.00017016048,0.00040817045,0.09359924,0.00028904254,0.8807898,0.0031358805,0.019890148],"study_design_scores_gemma":[0.000008750762,0.000005599851,0.00009439959,0.000015588214,0.000013804705,0.000027782586,0.000016357732,0.081546634,0.000043086726,0.91788197,0.0003356638,0.000010343782],"about_ca_topic_score_codex":0.0043103145,"about_ca_topic_score_gemma":0.0036937427,"teacher_disagreement_score":0.012020271,"about_ca_system_score_codex":0.0047080214,"about_ca_system_score_gemma":0.002315894,"threshold_uncertainty_score":0.06357002},"labels":[],"label_agreement":null},{"id":"W1493499543","doi":"10.1007/978-3-540-30555-2_14","title":"A Nested Transaction Model for LDAP Transactions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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","funders":"","keywords":"Lightweight Directory Access Protocol; Computer science; Directory service; Database; Server; Nested transaction; Database transaction; Transaction processing; Distributed transaction; Relational database; Directory; Computer network; Operating system; Distributed computing","score_opus":0.022404242735198622,"score_gpt":0.24891958793680424,"score_spread":0.22651534520160563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493499543","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.0065112454,0.0004310156,0.98386717,0.0003743523,0.0001228543,0.00019872554,0.0004151738,0.0019019748,0.0061774147],"genre_scores_gemma":[0.30967903,0.00088138354,0.66319925,0.00045624303,0.0003048203,0.0010148016,0.0015429631,0.0009220578,0.021999536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959785,0.0009923098,0.00048292457,0.00042851878,0.0017605328,0.00035726352],"domain_scores_gemma":[0.99584645,0.0010232623,0.00018891733,0.0018711843,0.00080841716,0.00026176398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002947788,0.0008035145,0.0012392098,0.0010294836,0.001598279,0.0052511566,0.0034808693,0.00206054,0.006238763],"category_scores_gemma":[0.008518799,0.0013234288,0.0012749571,0.0019776141,0.001761214,0.008377347,0.0028498364,0.0029844958,0.0034197925],"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.00029126933,0.00021358774,0.0011039707,0.00022861142,0.000049725488,0.00036333228,0.0009855676,0.06507972,0.0052897264,0.8191776,0.015352399,0.091864474],"study_design_scores_gemma":[0.00008250556,0.00009395727,0.00012391011,0.00006612498,0.000057511497,0.00031774907,0.000106069245,0.5186321,0.002847292,0.4363719,0.041246224,0.0000547324],"about_ca_topic_score_codex":0.0044134897,"about_ca_topic_score_gemma":0.004769191,"teacher_disagreement_score":0.006238763,"about_ca_system_score_codex":0.001498924,"about_ca_system_score_gemma":0.002164877,"threshold_uncertainty_score":0.020870745},"labels":[],"label_agreement":null},{"id":"W1493636406","doi":"10.1007/978-3-642-15763-9_28","title":"Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Computer science; Traverse; Visibility; Euclidean space; Grid; Position (finance); Upper and lower bounds; Dimension (graph theory); Trajectory; RADIUS; Euclidean distance; Algorithm; Topology (electrical circuits); Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Geometry; Artificial intelligence; Spacecraft; Mathematical analysis","score_opus":0.015741446759445415,"score_gpt":0.25260131241725203,"score_spread":0.23685986565780662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493636406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23582867,0.00097436924,0.7235356,0.0005743661,0.00025344576,0.000059577276,0.00021665228,0.00070715335,0.037850175],"genre_scores_gemma":[0.93686986,0.00038625853,0.05210736,0.00007117615,0.00006308528,0.00007614633,0.0001354512,0.00018363618,0.010107005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960655,0.00013069692,0.000020753936,0.00006544435,0.000105291794,0.0000713102],"domain_scores_gemma":[0.9985979,0.0008648768,0.000094588984,0.00025019108,0.00008193757,0.00011052689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045470567,0.0005172217,0.0011426732,0.00044082134,0.00070421235,0.0010932372,0.0010891826,0.00065545546,0.0048092008],"category_scores_gemma":[0.003296241,0.00044993218,0.0003769326,0.00060422084,0.0011705607,0.0018798528,0.0022588766,0.0010657025,0.00047744042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000519903,0.00005366731,0.00032825334,0.00014804218,0.00003421082,0.000118131764,0.00016540124,0.54298896,0.008283047,0.41663206,0.003028979,0.02769926],"study_design_scores_gemma":[0.000039633673,0.000024651461,0.00007575817,0.000009555287,0.0000050935732,0.00002976757,0.000047591086,0.8430073,0.0011746392,0.15467969,0.00089593726,0.000010451363],"about_ca_topic_score_codex":0.0012036895,"about_ca_topic_score_gemma":0.0010556208,"teacher_disagreement_score":0.0048092008,"about_ca_system_score_codex":0.00058632344,"about_ca_system_score_gemma":0.00035418454,"threshold_uncertainty_score":0.016088367},"labels":[],"label_agreement":null},{"id":"W1493669992","doi":"10.1007/11663430_16","title":"Essentials of the 4th UML/MoDELS Workshop in Software Model Engineering (WiSME’2005)","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unified Modeling Language; Computer science; Model-driven architecture; Software engineering; Bridging (networking); Software; Programming language","score_opus":0.01494236985260911,"score_gpt":0.2230436961996205,"score_spread":0.2081013263470114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493669992","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013962668,0.13945767,0.47884965,0.09171885,0.033532333,0.0003686167,0.0009638155,0.0021355741,0.23901075],"genre_scores_gemma":[0.119112164,0.116720684,0.37203336,0.008326966,0.014139206,0.0005697904,0.004435102,0.0034761915,0.3611866],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971232,0.0011745816,0.00020222932,0.0003315648,0.0009810904,0.00018731304],"domain_scores_gemma":[0.99515593,0.0023097773,0.00014864773,0.00072907587,0.0011661625,0.0004903937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00775598,0.001326436,0.0010526382,0.0019178989,0.0012870731,0.008227071,0.0015466529,0.0026079735,0.015270747],"category_scores_gemma":[0.009958924,0.0018113909,0.0013158452,0.0018252748,0.0023814295,0.00915202,0.0029870635,0.005574525,0.0072866175],"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.00028952034,0.000353273,0.0008474805,0.0006726974,0.00004327993,0.00040308776,0.0024959322,0.0039051678,0.0032999495,0.2986623,0.260333,0.42869437],"study_design_scores_gemma":[0.00003255492,0.000105922285,0.0009161829,0.0013602728,0.000051866617,0.0004846861,0.0004004782,0.00848758,0.00432281,0.1624005,0.82136923,0.00006785863],"about_ca_topic_score_codex":0.00424699,"about_ca_topic_score_gemma":0.0077293618,"teacher_disagreement_score":0.015270747,"about_ca_system_score_codex":0.0025509805,"about_ca_system_score_gemma":0.0026002328,"threshold_uncertainty_score":0.05108571},"labels":[],"label_agreement":null},{"id":"W1493688591","doi":"10.1007/978-3-642-14100-3_9","title":"MarkerMouse: Mouse Cursor Control Using a Head-Mounted Marker","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Cursor (databases); Computer science; Head (geology); Computer graphics (images); Artificial intelligence; Computer vision; Biology","score_opus":0.01402946202687089,"score_gpt":0.2807298044583469,"score_spread":0.266700342431476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493688591","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.009575755,0.0017670081,0.9221707,0.00011534444,0.00032946875,0.00014372327,0.00069805625,0.05087611,0.014323807],"genre_scores_gemma":[0.24017715,0.004263353,0.59286225,0.00058785646,0.0003052867,0.0007431361,0.0031416034,0.01088106,0.14703828],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997435,0.000024967116,0.000015309002,0.00006208814,0.00012238976,0.000031793825],"domain_scores_gemma":[0.999718,0.000069312984,0.000022009044,0.00006727617,0.0000821238,0.000041224837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035905893,0.00097119616,0.00060161314,0.00056126283,0.00023735744,0.0007436203,0.0019504897,0.00095429696,0.02269745],"category_scores_gemma":[0.0006898396,0.00045272734,0.0003901846,0.0005266397,0.00026313643,0.001104576,0.0009840361,0.00071267417,0.010312976],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074541685,0.0001048359,0.0005321001,0.0005069922,0.000057441935,0.00036566556,0.00040145227,0.0011155088,0.38396198,0.007369686,0.069607556,0.5352315],"study_design_scores_gemma":[0.00023369418,0.0006917282,0.004428809,0.00021908841,0.00019872692,0.003800152,0.0000845209,0.03368,0.43209895,0.0037648585,0.52060604,0.00019344738],"about_ca_topic_score_codex":0.0006887662,"about_ca_topic_score_gemma":0.0010280698,"teacher_disagreement_score":0.02269745,"about_ca_system_score_codex":0.00012437103,"about_ca_system_score_gemma":0.000265753,"threshold_uncertainty_score":0.075930536},"labels":[],"label_agreement":null},{"id":"W1493741628","doi":"10.1007/11767886_16","title":"Toward Self-Managed Networks?","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science","score_opus":0.013066108637359188,"score_gpt":0.20467693839448575,"score_spread":0.19161082975712657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493741628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041646864,0.01260389,0.7034289,0.032474097,0.0035234874,0.00010304974,0.0001535479,0.0011171598,0.204949],"genre_scores_gemma":[0.7585004,0.012253921,0.1374093,0.003299836,0.0018771073,0.0002827261,0.000182435,0.00021855903,0.0859757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998266,0.000052727413,0.000004922538,0.000034963177,0.00005474961,0.000026183112],"domain_scores_gemma":[0.9994937,0.00019090965,0.00004744695,0.000107177955,0.00008535842,0.0000754856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007481452,0.00032405593,0.00030912837,0.00024747886,0.00040373259,0.0016475352,0.0009542306,0.0013437804,0.0068369554],"category_scores_gemma":[0.0023884224,0.00022897951,0.00017378226,0.00029084604,0.001172923,0.005266837,0.0013186102,0.00139126,0.0015414644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003049946,0.000033607885,0.00016679266,0.000087822664,0.000015547548,0.000056992405,0.00013617192,0.009774881,0.0014916168,0.9026892,0.015813297,0.0697036],"study_design_scores_gemma":[0.000018246863,0.000025031053,0.00007863143,0.000048345802,0.000006621193,0.00008964366,0.000100138626,0.04242454,0.0010316353,0.9020067,0.054161713,0.000008656706],"about_ca_topic_score_codex":0.00024699466,"about_ca_topic_score_gemma":0.00038752877,"teacher_disagreement_score":0.0068369554,"about_ca_system_score_codex":0.00044802955,"about_ca_system_score_gemma":0.00031306618,"threshold_uncertainty_score":0.022871852},"labels":[],"label_agreement":null},{"id":"W1493864766","doi":"10.1007/978-3-642-15711-0_6","title":"Detection of Gad-Enhancing Lesions in Multiple Sclerosis Using Conditional Random Fields","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital; NeuroRx Research (Canada); McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conditional random field; Pattern recognition (psychology); Artificial intelligence; Markov random field; Segmentation; Linear discriminant analysis; Classifier (UML); Multiple sclerosis; Magnetic resonance imaging; Computer science; Medicine; Image segmentation; Radiology; Immunology","score_opus":0.05526559040721297,"score_gpt":0.27154919832115015,"score_spread":0.2162836079139372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493864766","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.5132446,0.0010446945,0.48306125,0.0005087,0.000041657142,0.00006458664,0.00037540193,0.00081104686,0.0008480768],"genre_scores_gemma":[0.95233816,0.0002826163,0.046342716,0.00006734044,0.00004381128,0.00001989891,0.00036033487,0.000035932684,0.00050919736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998493,0.000044133736,0.000008218312,0.00003215943,0.000036317204,0.000029841996],"domain_scores_gemma":[0.9983669,0.001196967,0.00014306644,0.00006854668,0.00014921642,0.00007535794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012979981,0.00042070114,0.00046984816,0.0012014576,0.00019256338,0.00043058235,0.0004300546,0.00070210616,0.00060885533],"category_scores_gemma":[0.0023468952,0.00022674959,0.00054957217,0.00033297832,0.0002666822,0.00042058184,0.00036254997,0.00048849464,0.00017263048],"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.0030053055,0.00062091125,0.08707254,0.00041332428,0.00032989893,0.0012206319,0.00017173954,0.19261381,0.19190341,0.0051749228,0.0054947594,0.5119787],"study_design_scores_gemma":[0.00003202024,0.00015643588,0.03080485,0.000020429205,0.00011344089,0.000991574,0.000027023703,0.9371339,0.026476398,0.003723585,0.00048516097,0.00003522432],"about_ca_topic_score_codex":0.0022023711,"about_ca_topic_score_gemma":0.002570659,"teacher_disagreement_score":0.0022023711,"about_ca_system_score_codex":0.00023521429,"about_ca_system_score_gemma":0.00042591768,"threshold_uncertainty_score":0.0068645477},"labels":[],"label_agreement":null},{"id":"W1493872864","doi":"10.1007/11817963_27","title":"EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Abstraction; Verilog; Heuristics; Programming language; Abstraction layer; Model checking; Computer architecture; Embedded system; Software engineering; Software; Operating system; Field-programmable gate array","score_opus":0.18465310650881606,"score_gpt":0.40421918813249536,"score_spread":0.2195660816236793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493872864","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.00998559,0.00010554079,0.9273864,0.000077618846,0.00009489042,0.00009604267,0.0004188429,0.052350562,0.009484478],"genre_scores_gemma":[0.35481226,0.00047951748,0.60077703,0.0003379744,0.000065961416,0.0006077361,0.003722233,0.017075086,0.02212219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999571,0.00007658291,0.000034313554,0.00006285257,0.00020378781,0.000051441035],"domain_scores_gemma":[0.99937516,0.0002309931,0.000041790106,0.00019952256,0.000090951005,0.0000616402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065772823,0.0010762218,0.00068634085,0.0005132278,0.00041007303,0.0010594431,0.0028253102,0.0009830737,0.01665247],"category_scores_gemma":[0.0016391253,0.0007563243,0.00086320844,0.00036529632,0.0005165189,0.0013508096,0.0019895544,0.0017725283,0.0037130534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011964573,0.00042263197,0.0027297323,0.0006565377,0.00030528402,0.00051039614,0.0005400965,0.5373866,0.06725235,0.057087842,0.049458306,0.2824538],"study_design_scores_gemma":[0.00014355496,0.000103361,0.00031267377,0.000032298864,0.000044495646,0.0001197531,0.000021237414,0.90525186,0.028639559,0.015620164,0.04966027,0.000050825172],"about_ca_topic_score_codex":0.0014653549,"about_ca_topic_score_gemma":0.0020536762,"teacher_disagreement_score":0.01665247,"about_ca_system_score_codex":0.0003584151,"about_ca_system_score_gemma":0.00070042966,"threshold_uncertainty_score":0.05570805},"labels":[],"label_agreement":null},{"id":"W1493878798","doi":"10.1007/978-3-540-28634-9_27","title":"Routing Table Dynamics in Mobile Ad-Hoc Networks: A Continuum Model","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Link-state routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Enhanced Interior Gateway Routing Protocol; Routing protocol; Distributed computing; Optimized Link State Routing Protocol; Static routing; Routing table; Routing (electronic design automation)","score_opus":0.009147438660698618,"score_gpt":0.22306165842870848,"score_spread":0.21391421976800987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493878798","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.090700805,0.0049632406,0.8156605,0.0072931326,0.0007033192,0.0001744525,0.00050094887,0.00049997045,0.07950368],"genre_scores_gemma":[0.89294297,0.0051306714,0.051699877,0.00077316497,0.00066729594,0.00030075535,0.00023610597,0.00023475771,0.048014455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00039275232,0.000041700354,0.00019660196,0.00032338596,0.0001481641],"domain_scores_gemma":[0.9960531,0.0024080598,0.00039293477,0.0002884473,0.0004632063,0.00039425775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563869,0.0007262549,0.00164456,0.0013033795,0.0013439059,0.0037573103,0.0040736455,0.0037850314,0.008095625],"category_scores_gemma":[0.00878838,0.0011446931,0.0010346939,0.0022835734,0.003196452,0.006971559,0.0024677997,0.002205069,0.0016847902],"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.00008768276,0.00012669912,0.00060712773,0.00015376687,0.000031713073,0.00024132708,0.00040342862,0.40527892,0.0011599242,0.5726244,0.005935454,0.01334959],"study_design_scores_gemma":[0.00003535653,0.000038707098,0.00010582927,0.000023497561,0.000015732729,0.00009647211,0.000089272246,0.876623,0.000087283544,0.12059544,0.002269786,0.000019666059],"about_ca_topic_score_codex":0.0033361842,"about_ca_topic_score_gemma":0.0018968281,"teacher_disagreement_score":0.008095625,"about_ca_system_score_codex":0.0020451292,"about_ca_system_score_gemma":0.0010906652,"threshold_uncertainty_score":0.027082562},"labels":[],"label_agreement":null},{"id":"W1493883950","doi":"10.1007/978-3-540-78135-6_28","title":"Mixing Statistical and Symbolic Approaches for Chemical Names Recognition","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Matching (statistics); Classifier (UML); Pattern recognition (psychology); Artificial intelligence; Bayes' theorem; Data mining; Machine learning; Algorithm; Mathematics; Bayesian probability; Statistics","score_opus":0.043268031851047294,"score_gpt":0.26146878430102055,"score_spread":0.21820075244997325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493883950","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.011578921,0.0006297494,0.98410046,0.00032967835,0.00007265815,0.000043049185,0.00022453228,0.0015625835,0.0014584117],"genre_scores_gemma":[0.2725716,0.0009974771,0.71983206,0.00020946916,0.00027282903,0.00021932363,0.0015965122,0.00037848332,0.003922234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778455,0.0006962633,0.00022324524,0.0004189035,0.00072884443,0.00014809195],"domain_scores_gemma":[0.9921794,0.005675225,0.0003280535,0.00094916904,0.0007439017,0.00012429486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021465814,0.0009841505,0.0012208807,0.00343022,0.0007820286,0.002493213,0.002147881,0.0014806088,0.0041862694],"category_scores_gemma":[0.01077572,0.0006296185,0.0013202374,0.004041145,0.0013437689,0.0047484008,0.0026543606,0.0018047523,0.0018765338],"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.00023117935,0.00016694282,0.0016892334,0.00018823394,0.0001251962,0.00009326141,0.00018865248,0.08645566,0.009265808,0.032227688,0.0029248414,0.86644334],"study_design_scores_gemma":[0.000012037652,0.000036823163,0.0005201699,0.00001690334,0.00003214044,0.00006325096,0.00007096856,0.89817125,0.0042135087,0.09501461,0.0018231858,0.000025150403],"about_ca_topic_score_codex":0.0038187765,"about_ca_topic_score_gemma":0.0080278395,"teacher_disagreement_score":0.0041862694,"about_ca_system_score_codex":0.00092206814,"about_ca_system_score_gemma":0.0017372047,"threshold_uncertainty_score":0.014004469},"labels":[],"label_agreement":null},{"id":"W1493897129","doi":"10.1007/11766247_47","title":"MITS: A Mixed-Initiative Intelligent Tutoring System for Sudoku","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.04549147380800346,"score_gpt":0.3095918798242047,"score_spread":0.2641004060162013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493897129","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.5411646,0.0018634927,0.3256046,0.0005696172,0.0005823534,0.0008536546,0.003269211,0.09132961,0.034762885],"genre_scores_gemma":[0.619437,0.0007152222,0.32744664,0.0003513575,0.000097881966,0.0008946911,0.005060303,0.0015829789,0.0444139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999846,0.00004392733,0.000014972485,0.000039330567,0.000029688781,0.000026026926],"domain_scores_gemma":[0.9998153,0.000051307336,0.000012677179,0.000021035574,0.00004301611,0.00005672368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030028206,0.00052150904,0.00070079055,0.000351957,0.0007980829,0.0006983282,0.00054733764,0.00052868016,0.007163036],"category_scores_gemma":[0.0008313939,0.00023199832,0.00019496924,0.00032515952,0.00013020515,0.0011724305,0.0017407947,0.0004120857,0.0021796247],"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.002659247,0.0009081675,0.0054466594,0.00069196895,0.00011143608,0.0009994284,0.0031010476,0.0045398828,0.16115789,0.0032406875,0.062989,0.7541547],"study_design_scores_gemma":[0.0013683052,0.004084782,0.029188896,0.00030476123,0.0009728341,0.0035147972,0.0044259285,0.22449161,0.24698591,0.00753222,0.47663817,0.0004917818],"about_ca_topic_score_codex":0.0013489923,"about_ca_topic_score_gemma":0.0031238846,"teacher_disagreement_score":0.007163036,"about_ca_system_score_codex":0.00020677055,"about_ca_system_score_gemma":0.0006670932,"threshold_uncertainty_score":0.023962796},"labels":[],"label_agreement":null},{"id":"W1493905115","doi":"10.1007/978-3-642-12159-3_16","title":"Content-Based Retrieval and Classification of Ultrasound Medical Images of Ovarian Cysts","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Royal Victoria Hospital; Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Similarity (geometry); Ultrasound; Histogram; Image retrieval; Contextual image classification; Content-based image retrieval; Computer vision; Image (mathematics); Radiology; Medicine","score_opus":0.02482224216273054,"score_gpt":0.26329821410631377,"score_spread":0.23847597194358322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493905115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3929279,0.036568433,0.5445473,0.0013977237,0.0013210988,0.0010830053,0.0037683046,0.0040233405,0.014362837],"genre_scores_gemma":[0.55382836,0.012772281,0.40367612,0.00042556305,0.0013685926,0.000328902,0.00745844,0.0004120354,0.01972967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996877,0.000043253724,0.000028635326,0.000040736282,0.00015254742,0.0000472245],"domain_scores_gemma":[0.9994117,0.00025031398,0.00004318211,0.000055013967,0.00020995634,0.000029911316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004472549,0.00045596933,0.0007546519,0.004354054,0.00026301353,0.0008588384,0.0007848686,0.00082762947,0.0031998234],"category_scores_gemma":[0.0018448856,0.00019804669,0.0006007179,0.002277698,0.00028967162,0.0007578701,0.00036626172,0.0003108013,0.0019865383],"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.00038375123,0.00016132735,0.002446196,0.0004992094,0.0000603488,0.0003953457,0.00014969755,0.0025143763,0.17320977,0.0010120965,0.01225051,0.80691737],"study_design_scores_gemma":[0.00014028867,0.0012334277,0.09148986,0.0004011283,0.00086138916,0.01666925,0.0007757753,0.4023678,0.4247904,0.006582677,0.05449976,0.00018824752],"about_ca_topic_score_codex":0.0021646123,"about_ca_topic_score_gemma":0.0024865924,"teacher_disagreement_score":0.004354054,"about_ca_system_score_codex":0.00042825134,"about_ca_system_score_gemma":0.000420469,"threshold_uncertainty_score":0.010704458},"labels":[],"label_agreement":null},{"id":"W1493931908","doi":"10.1007/978-3-642-15754-7_74","title":"Unsupervised Morphological Analysis by Formal Analogy","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Analogy; Morpheme; Lexicon; Artificial intelligence; Natural language processing; Relation (database); Formal grammar; Formal description; Reading (process); Formal language; Linguistics; Rule-based machine translation; Algorithm; Programming language; Data mining","score_opus":0.010955837824513343,"score_gpt":0.2534533791715864,"score_spread":0.24249754134707305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493931908","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.004791414,0.00015988197,0.98785573,0.00008987778,0.00006407314,0.000042885098,0.00009784719,0.0024251272,0.004473082],"genre_scores_gemma":[0.12596065,0.0004516583,0.86016643,0.0001233768,0.00013748485,0.00011446171,0.0011978035,0.0013954735,0.01045275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914825,0.00018969504,0.00006925274,0.00027633389,0.00024407273,0.000072407005],"domain_scores_gemma":[0.9989059,0.00039198148,0.000076857286,0.00039051566,0.00020557486,0.000029281497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006484604,0.0007196115,0.00086947967,0.0027067119,0.0010166623,0.002007992,0.0015396073,0.00088357145,0.014769703],"category_scores_gemma":[0.0021752547,0.00065274094,0.0017574547,0.0024705764,0.0013850479,0.003075282,0.0023586035,0.0013775148,0.009686171],"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.000116412746,0.00006539648,0.0005348247,0.0003390576,0.00007301985,0.0003034764,0.00024002118,0.009191265,0.048753873,0.10350998,0.006639128,0.8302335],"study_design_scores_gemma":[0.000052112588,0.00012912673,0.0019774693,0.00011268789,0.00010766514,0.0018221104,0.00040235918,0.39968014,0.04937289,0.4856062,0.060641985,0.00009521771],"about_ca_topic_score_codex":0.00042965324,"about_ca_topic_score_gemma":0.0007861021,"teacher_disagreement_score":0.014769703,"about_ca_system_score_codex":0.00034966203,"about_ca_system_score_gemma":0.0007461829,"threshold_uncertainty_score":0.04940957},"labels":[],"label_agreement":null},{"id":"W1493952344","doi":"10.1007/978-3-540-24677-0_102","title":"Multiple Reinforcement Learning Agents in a Static Environment","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Acadia University","funders":"","keywords":"Reinforcement learning; Computer science; Testbed; Reinforcement; Artificial intelligence; Error-driven learning; State (computer science); Learning classifier system; Human–computer interaction; Machine learning; Computer network","score_opus":0.020084878225391827,"score_gpt":0.24644086449333158,"score_spread":0.22635598626793976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493952344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12501036,0.00045719402,0.85135514,0.00047911218,0.00018099732,0.000100910365,0.000051570652,0.0009358241,0.021428877],"genre_scores_gemma":[0.7827398,0.00043716608,0.18650074,0.00011206006,0.000095206866,0.00017921995,0.00008983402,0.000105751475,0.02974022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997037,0.000058154856,0.0000145459535,0.00007971046,0.0000963104,0.00004754906],"domain_scores_gemma":[0.9994381,0.00022379037,0.00006781613,0.00006331475,0.00008619572,0.00012088368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046297678,0.00073319895,0.0008213432,0.0003808941,0.00073051243,0.00075282465,0.0015933379,0.0012069627,0.004282507],"category_scores_gemma":[0.0014916721,0.0004943327,0.00046358004,0.00040748884,0.00079070154,0.0013669227,0.0019587434,0.00087286934,0.0006756422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023936965,0.0001536018,0.0006061669,0.000090428395,0.00008139181,0.00043254765,0.0001000661,0.8695744,0.009533966,0.02485191,0.0016845784,0.09265153],"study_design_scores_gemma":[0.000031347274,0.00008607509,0.00017242384,0.0000067956744,0.000018039824,0.00006533956,0.000022005916,0.984597,0.0015825392,0.0118711265,0.0015363193,0.000011034583],"about_ca_topic_score_codex":0.0017051842,"about_ca_topic_score_gemma":0.0019630007,"teacher_disagreement_score":0.004282507,"about_ca_system_score_codex":0.0005731808,"about_ca_system_score_gemma":0.0006647637,"threshold_uncertainty_score":0.014326394},"labels":[],"label_agreement":null},{"id":"W1493960996","doi":"10.1007/978-3-540-73101-6_13","title":"FitClipse: A Fit-Based Eclipse Plug-In for Executable Acceptance Test Driven Development","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Executable; Test (biology); Test-driven development; Eclipse; Acceptance testing; Computer science; Software engineering; Programming language; Software development; Software","score_opus":0.0377258602893186,"score_gpt":0.2914785406156923,"score_spread":0.25375268032637366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493960996","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.029743677,0.00036850173,0.8017168,0.00022002417,0.00014830189,0.00025482682,0.00075195066,0.15474343,0.012052485],"genre_scores_gemma":[0.3467286,0.00067663455,0.5435759,0.0008327138,0.000080178004,0.0005731399,0.004142309,0.05471298,0.04867759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993369,0.00009954425,0.000042621898,0.00008192864,0.00036708452,0.00007196531],"domain_scores_gemma":[0.99843377,0.00080039655,0.00011925685,0.00031198087,0.00022727504,0.000107206215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084104645,0.0012589367,0.0005625536,0.00093342905,0.0002676282,0.00090635713,0.001533568,0.001268843,0.010145413],"category_scores_gemma":[0.004170084,0.00097304204,0.000717909,0.00035085744,0.00033065103,0.001651515,0.0013408682,0.0016405617,0.004153525],"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.0010710942,0.0007043898,0.0066897096,0.0008702799,0.00022431622,0.0015964204,0.0011015967,0.021990865,0.11116483,0.011439636,0.06713098,0.7760159],"study_design_scores_gemma":[0.0006833953,0.0013065878,0.021400092,0.0006301829,0.00033491975,0.0060534817,0.00024269805,0.42034748,0.24484186,0.022574179,0.28106704,0.0005181391],"about_ca_topic_score_codex":0.0011902218,"about_ca_topic_score_gemma":0.0024312749,"teacher_disagreement_score":0.010145413,"about_ca_system_score_codex":0.00027704504,"about_ca_system_score_gemma":0.00054773607,"threshold_uncertainty_score":0.03393984},"labels":[],"label_agreement":null},{"id":"W1494010234","doi":"10.1007/978-3-642-02927-1_37","title":"Dynamic Succinct Ordered Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Programming language","score_opus":0.0100627812561948,"score_gpt":0.24065924692145846,"score_spread":0.23059646566526365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494010234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03928866,0.0028557058,0.7770325,0.001710688,0.00069003046,0.00019695576,0.004148273,0.0037172362,0.17035988],"genre_scores_gemma":[0.39755446,0.004882364,0.43498987,0.00070843706,0.00042315558,0.00027182145,0.010888156,0.0021646852,0.14811705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995078,0.00005860295,0.000030215908,0.000075067124,0.0002718221,0.00005643498],"domain_scores_gemma":[0.9989856,0.00034082978,0.00005101136,0.00038200954,0.00017714186,0.00006349549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045270624,0.00048838963,0.00050018565,0.0010565902,0.0006214251,0.0016433399,0.0010510124,0.00056225393,0.020449433],"category_scores_gemma":[0.002333517,0.0004922225,0.00035128635,0.002239635,0.00081533805,0.0049614967,0.0018791651,0.0017674682,0.004755322],"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.00020800253,0.000090044785,0.00026099986,0.00028207657,0.000016430087,0.00019887794,0.00030267966,0.014607838,0.008242133,0.6141301,0.037389282,0.32427156],"study_design_scores_gemma":[0.000040844585,0.00005713359,0.0002671524,0.0001597385,0.000024669453,0.0005105573,0.00015836713,0.056397174,0.011471694,0.76427555,0.16660528,0.00003183708],"about_ca_topic_score_codex":0.00067224714,"about_ca_topic_score_gemma":0.0014951804,"teacher_disagreement_score":0.020449433,"about_ca_system_score_codex":0.0008948722,"about_ca_system_score_gemma":0.0007027076,"threshold_uncertainty_score":0.06841016},"labels":[],"label_agreement":null},{"id":"W1494026234","doi":"10.1007/3-540-47873-6_26","title":"Quantitative Analysis of Non-obvious Performer Gestures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gesture; Movement (music); Consistency (knowledge bases); Computer science; Performing arts; Human–computer interaction; Artificial intelligence; Visual arts; Aesthetics; Art","score_opus":0.021095809176140998,"score_gpt":0.2625027131520634,"score_spread":0.2414069039759224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494026234","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.868828,0.0013814325,0.1126411,0.000058352707,0.00006184694,0.00012264278,0.003991706,0.0012006742,0.011714202],"genre_scores_gemma":[0.9666394,0.00032380567,0.02460548,0.000015407677,0.000038687715,0.00009990209,0.002362754,0.00021522619,0.005699368],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.000086290645,0.00003797435,0.0001553836,0.00032958016,0.00008782917],"domain_scores_gemma":[0.9973104,0.0015177124,0.00018490382,0.00017663765,0.00067085895,0.00013949157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049717556,0.00037070594,0.00047064133,0.0023803625,0.0004045802,0.00080926873,0.00033363135,0.00044378306,0.008982245],"category_scores_gemma":[0.0026395244,0.00020020388,0.00030114874,0.0015302125,0.0004639916,0.0006104259,0.0005311916,0.00032964384,0.0022371993],"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.0017620552,0.00015537608,0.01965032,0.0011945453,0.000101330734,0.00031853994,0.0009671043,0.0042803637,0.6209046,0.0013057266,0.0016871425,0.34767285],"study_design_scores_gemma":[0.000057001253,0.0011439568,0.74107665,0.00015070944,0.00020070566,0.0027928222,0.0017387809,0.09211382,0.15183896,0.0018683888,0.006880295,0.0001380176],"about_ca_topic_score_codex":0.001044596,"about_ca_topic_score_gemma":0.0018912868,"teacher_disagreement_score":0.008982245,"about_ca_system_score_codex":0.00019915294,"about_ca_system_score_gemma":0.00023794135,"threshold_uncertainty_score":0.030048609},"labels":[],"label_agreement":null},{"id":"W1494042884","doi":"10.1007/3-540-45961-8_13","title":"An Interactive Data Exchange Protocol Based on Discrete Exponentiation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"Computer science; Protocol (science); Key exchange; Exponentiation; Data exchange; Cryptographic protocol; Oakley protocol; Public-key cryptography; Computer network; Otway–Rees protocol; Authentication protocol; Cryptography; Wide Mouth Frog protocol; Authentication (law); Universal composability; Computer security; Encryption; Challenge-Handshake Authentication Protocol; Database; Mathematics; Medicine","score_opus":0.04424939035978744,"score_gpt":0.3295069657627377,"score_spread":0.28525757540295027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494042884","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.026788412,0.00048634422,0.9528958,0.00044234702,0.00035681808,0.00038770118,0.00030257498,0.003338428,0.0150014],"genre_scores_gemma":[0.6137671,0.0006549458,0.35603023,0.00036657686,0.00027418183,0.0007595008,0.0007926647,0.00045807648,0.026896859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819916,0.00037585583,0.00019236971,0.00029853173,0.0006577184,0.00027637012],"domain_scores_gemma":[0.9972312,0.0010757248,0.00014399951,0.001088126,0.00027729064,0.0001836949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774834,0.0008500702,0.0011793548,0.0008087657,0.0011224347,0.0026407486,0.0016514977,0.0012442357,0.0067564873],"category_scores_gemma":[0.00325206,0.0004410431,0.00070087035,0.001111205,0.0014480388,0.004193595,0.0040023346,0.002180688,0.001954142],"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.0018165143,0.00040120396,0.00072941935,0.00047285666,0.000109837194,0.00074332923,0.00085692265,0.0154062025,0.06742583,0.7467659,0.009881937,0.1553901],"study_design_scores_gemma":[0.0007718484,0.0009841276,0.0009066314,0.00015360823,0.00027396088,0.0020566434,0.00018852629,0.31982294,0.14789687,0.40767518,0.1189822,0.00028748935],"about_ca_topic_score_codex":0.00022092146,"about_ca_topic_score_gemma":0.00022724998,"teacher_disagreement_score":0.0067564873,"about_ca_system_score_codex":0.0007053699,"about_ca_system_score_gemma":0.0009337959,"threshold_uncertainty_score":0.022602677},"labels":[],"label_agreement":null},{"id":"W1494086013","doi":"10.1007/978-3-540-30114-1_4","title":"On Achievable Regions of Public Multiple-Access Gaussian Watermarking Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digital watermarking; Gaussian; Distortion (music); Computer science; Algorithm; Uncorrelated; Measure (data warehouse); Theoretical computer science; Image (mathematics); Mathematics; Telecommunications; Artificial intelligence; Statistics; Data mining; Bandwidth (computing); Physics","score_opus":0.03330689904758006,"score_gpt":0.2677889090606047,"score_spread":0.23448201001302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494086013","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.0845599,0.007792248,0.7802396,0.0029699497,0.00017705667,0.00019915789,0.0009182212,0.00061463774,0.12252932],"genre_scores_gemma":[0.911283,0.0080966465,0.06473356,0.00058541517,0.00064445834,0.00049373356,0.0005580139,0.00032781085,0.013277417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584216,0.0020574736,0.00011114453,0.00037240243,0.00092662236,0.00069012697],"domain_scores_gemma":[0.975498,0.021213738,0.0009479791,0.0007995745,0.0012122398,0.00032843868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057626776,0.0032949585,0.0026110003,0.002463989,0.0013057771,0.006034314,0.0022941565,0.0018682603,0.010593839],"category_scores_gemma":[0.021343147,0.0010840204,0.001205329,0.0027728188,0.0034889255,0.004909918,0.003824186,0.0030852067,0.0015216027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069364224,0.000093721406,0.00027554185,0.0004365797,0.00009848294,0.00022371122,0.0005264208,0.1928185,0.005286757,0.76827157,0.004359739,0.02691539],"study_design_scores_gemma":[0.000083723346,0.00013204457,0.00022918855,0.00016501825,0.000060978204,0.00021481632,0.00015206111,0.40195316,0.002332055,0.5922184,0.0024005114,0.00005808446],"about_ca_topic_score_codex":0.0017584497,"about_ca_topic_score_gemma":0.0009366929,"teacher_disagreement_score":0.010593839,"about_ca_system_score_codex":0.004074396,"about_ca_system_score_gemma":0.0017221686,"threshold_uncertainty_score":0.03543991},"labels":[],"label_agreement":null},{"id":"W1494093226","doi":"10.1007/978-3-642-17688-3_5","title":"Neural Image Thresholding Using SIFT: A Comparative Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Thresholding; Artificial intelligence; Computer science; Pattern recognition (psychology); Scale-invariant feature transform; Artificial neural network; Image segmentation; Computer vision; Segmentation; Image processing; Image (mathematics)","score_opus":0.05166302053514781,"score_gpt":0.3427319140114214,"score_spread":0.29106889347627357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494093226","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.87337095,0.016263548,0.08883273,0.00015953032,0.00013483588,0.0001394167,0.000506783,0.00061893475,0.019973353],"genre_scores_gemma":[0.96612984,0.0057269847,0.022433992,0.00003132304,0.000049472816,0.0000193057,0.00057062134,0.00020593102,0.004832533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995491,0.00008022001,0.000041482792,0.00007179049,0.00020912806,0.000048231603],"domain_scores_gemma":[0.9980539,0.0011176659,0.00010944607,0.00015794193,0.0005251367,0.000035829435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010045096,0.00038164627,0.0007911665,0.002075724,0.00025683866,0.0009382612,0.00062817783,0.0005566011,0.004219621],"category_scores_gemma":[0.0033334482,0.00019572263,0.00051893893,0.002021178,0.00036330163,0.0009817034,0.00025706747,0.0001712027,0.0006640586],"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.0043210248,0.0004237093,0.015878709,0.0012767992,0.0003706913,0.0006310737,0.00034406513,0.013379555,0.07379197,0.0020595111,0.0020206033,0.88550234],"study_design_scores_gemma":[0.00021989089,0.0072920714,0.23141773,0.00049082615,0.002874598,0.012053485,0.0025322435,0.49145553,0.22617769,0.007100169,0.018170467,0.00021535977],"about_ca_topic_score_codex":0.0028691292,"about_ca_topic_score_gemma":0.002713652,"teacher_disagreement_score":0.004219621,"about_ca_system_score_codex":0.00044436575,"about_ca_system_score_gemma":0.00024204676,"threshold_uncertainty_score":0.014116049},"labels":[],"label_agreement":null},{"id":"W1494209541","doi":"10.1007/978-3-540-77024-4_37","title":"A Study on the Binary Exponential Backoff in Noisy and Heterogeneous Environment","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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":"Concordia University","funders":"","keywords":"Exponential backoff; Computer science; Transmission (telecommunications); Binary number; Throughput; Network packet; Computer network; Collision; Exponential function; Channel (broadcasting); Packet loss; Real-time computing; Algorithm; Computer security; Wireless; Telecommunications; Mathematics; Arithmetic","score_opus":0.03408448399659316,"score_gpt":0.26155341752861755,"score_spread":0.22746893353202438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494209541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17549033,0.02268083,0.6719379,0.00393777,0.0016828894,0.00011798972,0.00021941219,0.00013541541,0.12379745],"genre_scores_gemma":[0.93615973,0.010559695,0.02317468,0.0006227226,0.001306475,0.00006515619,0.00012588684,0.00014424096,0.027841501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998516,0.0005478462,0.000056753142,0.0002056093,0.00039303,0.00028071288],"domain_scores_gemma":[0.99488515,0.003800564,0.00031927714,0.00025166737,0.00053696666,0.00020635955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019597756,0.0009868235,0.001262636,0.0012418139,0.001319695,0.0027101971,0.0020463306,0.001518555,0.0042329077],"category_scores_gemma":[0.010327119,0.00057460787,0.00110796,0.0018618256,0.002559569,0.005071638,0.002075485,0.0025591187,0.00044097833],"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.00011993219,0.00007873803,0.0007894055,0.00030284087,0.000043246506,0.00031541666,0.00041383528,0.048892464,0.0020485895,0.9345962,0.002566737,0.009832578],"study_design_scores_gemma":[0.000040523348,0.000115819385,0.0012179471,0.00016313646,0.000113936156,0.0008997685,0.00047861738,0.4797475,0.00094340666,0.5086132,0.0075959903,0.00007008667],"about_ca_topic_score_codex":0.0022895595,"about_ca_topic_score_gemma":0.0011128151,"teacher_disagreement_score":0.0042329077,"about_ca_system_score_codex":0.001272347,"about_ca_system_score_gemma":0.0010441566,"threshold_uncertainty_score":0.014160514},"labels":[],"label_agreement":null},{"id":"W1494273468","doi":"10.1007/978-3-540-24840-8_5","title":"Term-Based Clustering and Summarization of Web Page Collections","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Dalhousie University","funders":"","keywords":"Automatic summarization; Computer science; Cluster analysis; Information retrieval; Web page; World Wide Web; Web intelligence; Task (project management); Web modeling; Artificial intelligence","score_opus":0.013844641570018714,"score_gpt":0.2280352087547077,"score_spread":0.21419056718468898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494273468","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.16744098,0.0074729803,0.8023871,0.00044884387,0.00038337646,0.0005657463,0.007392457,0.009327629,0.0045808842],"genre_scores_gemma":[0.26886111,0.0025473107,0.68405,0.000088832494,0.0005112191,0.0003397551,0.031307954,0.0009695583,0.01132428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.0001586692,0.00013118274,0.00025259546,0.00042458475,0.00012928262],"domain_scores_gemma":[0.99755543,0.0006629623,0.00021308816,0.00037353332,0.0010681053,0.00012689708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095186,0.00074340455,0.001548607,0.0099788355,0.0011110456,0.0020543858,0.0018686568,0.0008529449,0.002599862],"category_scores_gemma":[0.0044165477,0.00045198697,0.0013365631,0.009254218,0.00038939278,0.0016616976,0.00086466916,0.0008126217,0.002780601],"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.0005100537,0.00024215755,0.0046239197,0.0005371593,0.00026806493,0.00016310863,0.0004377119,0.013686725,0.04556272,0.0016465198,0.015887542,0.9164343],"study_design_scores_gemma":[0.00013285338,0.00078512414,0.06141137,0.00020577777,0.001440115,0.0016643038,0.0012688407,0.7871545,0.079716146,0.024741415,0.04118778,0.00029180944],"about_ca_topic_score_codex":0.008637242,"about_ca_topic_score_gemma":0.01746238,"teacher_disagreement_score":0.0099788355,"about_ca_system_score_codex":0.0007424315,"about_ca_system_score_gemma":0.0012531655,"threshold_uncertainty_score":0.017173946},"labels":[],"label_agreement":null},{"id":"W1494356338","doi":"10.1007/978-3-642-23795-9_7","title":"Throughput-Optimal Distributed Probabilistic Medium-Access in MPR-Capable Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Throughput; Distributed computing; Computer network; Artificial intelligence; Telecommunications","score_opus":0.023081149234762524,"score_gpt":0.24794094840908548,"score_spread":0.22485979917432297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494356338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034036014,0.0018758783,0.94881994,0.00075810374,0.00014905578,0.00009665513,0.00017578044,0.0005204255,0.013568202],"genre_scores_gemma":[0.9249118,0.001760996,0.06492161,0.00016857078,0.0003147455,0.0001766903,0.0001392492,0.00019275416,0.0074135466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980963,0.0006660338,0.000071029644,0.000268612,0.000580218,0.00031774017],"domain_scores_gemma":[0.9953875,0.0035612634,0.00021036167,0.00027626767,0.00043437688,0.00013017158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026385277,0.0011091289,0.002106117,0.0008198509,0.0009875585,0.0021908456,0.0028736908,0.0012682558,0.003074025],"category_scores_gemma":[0.00755161,0.0010714751,0.00061107555,0.001592487,0.0017555844,0.002451669,0.0023278522,0.0017293823,0.00056320516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026960252,0.000067704445,0.00014945456,0.00018115764,0.00003537586,0.00007047014,0.0000834524,0.8726302,0.0041555446,0.09268269,0.0027994232,0.026874937],"study_design_scores_gemma":[0.000012897149,0.000028413979,0.000047711015,0.000007968134,0.000008788794,0.000028235645,0.000010080132,0.9603449,0.0005193778,0.038626786,0.00035450034,0.000010240296],"about_ca_topic_score_codex":0.0015772397,"about_ca_topic_score_gemma":0.0019346505,"teacher_disagreement_score":0.003074025,"about_ca_system_score_codex":0.0029596107,"about_ca_system_score_gemma":0.0013987196,"threshold_uncertainty_score":0.021473587},"labels":[],"label_agreement":null},{"id":"W1494357444","doi":"10.1007/3-540-36560-5_6","title":"NSPF: Designing a Notification Service Provider Framework for Web Services","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Web service; Service provider; Service (business); Service delivery framework; Delegation; World Wide Web; Computer network; Database","score_opus":0.017811706080682135,"score_gpt":0.2509445973273306,"score_spread":0.23313289124664846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494357444","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.0037756632,0.00013879943,0.97728705,0.00022484019,0.00011412333,0.00037996806,0.00014521535,0.015045057,0.0028893105],"genre_scores_gemma":[0.05008492,0.00036972624,0.93265873,0.00026939026,0.00007178861,0.00049782003,0.0008894556,0.0040420624,0.011116074],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982778,0.00031979324,0.00016238452,0.00019255705,0.00078438735,0.0002630314],"domain_scores_gemma":[0.99882764,0.00041732236,0.000074933814,0.00021841296,0.00031471596,0.00014707781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047575743,0.000745274,0.0008178304,0.0011663212,0.0013468355,0.0028701401,0.0032946467,0.0017489217,0.0065649394],"category_scores_gemma":[0.0068621854,0.0016664594,0.0013219469,0.00078938477,0.0010054125,0.0044544274,0.0021091327,0.0026613974,0.0027406525],"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.00059484533,0.00056780357,0.0033473838,0.0009665708,0.00016141015,0.0007285904,0.002068453,0.03665866,0.038563766,0.24962744,0.093697764,0.5730174],"study_design_scores_gemma":[0.00028914376,0.00023106951,0.0012966547,0.0002945236,0.00018078278,0.0010017059,0.0003604233,0.4917815,0.05097234,0.054863714,0.39849964,0.00022850688],"about_ca_topic_score_codex":0.013566009,"about_ca_topic_score_gemma":0.014859069,"teacher_disagreement_score":0.013566009,"about_ca_system_score_codex":0.0018025897,"about_ca_system_score_gemma":0.0038276569,"threshold_uncertainty_score":0.026974082},"labels":[],"label_agreement":null},{"id":"W1494392129","doi":"10.1007/978-3-642-02921-9_48","title":"Stereo-Vision Based Control of a Car Using Fast Line-Segment Extraction","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Manitoba","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Stereopsis; Noise (video); Line segment; Distortion (music); Haar-like features; Line (geometry); Perspective (graphical); Point (geometry); Feature extraction; Image (mathematics); Facial recognition system; Mathematics; Face detection","score_opus":0.019676289080673492,"score_gpt":0.2962855509356697,"score_spread":0.27660926185499624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494392129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036518324,0.00013606263,0.95136905,0.0000515988,0.00007844846,0.00009645176,0.0000898461,0.0029487384,0.008711609],"genre_scores_gemma":[0.8926097,0.000091401766,0.101197295,0.000053923704,0.000034394918,0.00013185336,0.00013260292,0.00009275096,0.0056559327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981135,0.000012587236,0.0000075143826,0.00004954647,0.0000780598,0.0000410033],"domain_scores_gemma":[0.9997881,0.00003687606,0.000032042357,0.000028298648,0.0000947768,0.000019903864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022912737,0.00068094034,0.0006764495,0.00042309368,0.0005552624,0.00066266616,0.0008046324,0.0005976816,0.004298092],"category_scores_gemma":[0.00029555417,0.00039747334,0.0003545766,0.0003136314,0.00027481522,0.000395057,0.0005139876,0.00043318135,0.00096453883],"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.00077932206,0.00023809314,0.000633208,0.00029226262,0.000069397836,0.0002227478,0.0002541161,0.18610385,0.37481388,0.0046690963,0.0052157077,0.42670825],"study_design_scores_gemma":[0.00006518108,0.0004983959,0.0022290936,0.000020724689,0.0000404379,0.00010072554,0.000043432425,0.9258007,0.06405121,0.0012331259,0.005880701,0.00003618951],"about_ca_topic_score_codex":0.0065792636,"about_ca_topic_score_gemma":0.00900411,"teacher_disagreement_score":0.0065792636,"about_ca_system_score_codex":0.00039637508,"about_ca_system_score_gemma":0.0006962814,"threshold_uncertainty_score":0.014378548},"labels":[],"label_agreement":null},{"id":"W1494425773","doi":"10.1007/978-3-642-02611-9_68","title":"Structured Light Stereoscopic Imaging with Dynamic Pseudo-random Patterns","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":44,"is_retracted":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":"Stereoscopy; Computer science; Structured light; Computer vision; Artificial intelligence; Robustness (evolution); Surface reconstruction; 3D reconstruction; Iterative reconstruction; Computer graphics (images); Surface (topology); Mathematics; Geometry","score_opus":0.011453445190829668,"score_gpt":0.24017330371451728,"score_spread":0.22871985852368762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494425773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07674884,0.0010408651,0.89024115,0.00017246269,0.000096902186,0.000118312,0.00023490295,0.0006454563,0.030701147],"genre_scores_gemma":[0.40197834,0.0017324552,0.57801795,0.00015678983,0.00006493439,0.00011135233,0.00035689777,0.00015794754,0.01742329],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997706,0.000025745127,0.00000908516,0.000026250049,0.00015303819,0.000015349826],"domain_scores_gemma":[0.9997272,0.000103950006,0.000036406596,0.000060333783,0.000055484215,0.000016652679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018398568,0.00041295064,0.00028133715,0.00040279402,0.000097055134,0.0005486029,0.0005143787,0.0003685468,0.0031987303],"category_scores_gemma":[0.0004231056,0.00043228743,0.00027328593,0.00058137695,0.0003871606,0.00071648223,0.00054725964,0.00047502836,0.00077788136],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002312603,0.00005299882,0.00032729367,0.00033717562,0.00002917857,0.00022388497,0.00011458352,0.015522668,0.78298223,0.031402487,0.0022990047,0.16647714],"study_design_scores_gemma":[0.00009022853,0.00028389384,0.0018040055,0.00009788145,0.00003639275,0.0020107208,0.0000846507,0.31288218,0.64711255,0.015064598,0.020452457,0.000080412654],"about_ca_topic_score_codex":0.00029021563,"about_ca_topic_score_gemma":0.0006810098,"teacher_disagreement_score":0.0031987303,"about_ca_system_score_codex":0.00034033266,"about_ca_system_score_gemma":0.00026880685,"threshold_uncertainty_score":0.0107008815},"labels":[],"label_agreement":null},{"id":"W1494439078","doi":"10.1007/11511854_8","title":"Exploitation of Referential Integrity Constraints for Efficient Update of Data Warehouse Views","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Manitoba","funders":"Korea Science and Engineering Foundation","keywords":"Computer science; Joins; Star schema; Tuple; Schema (genetic algorithms); Data warehouse; Exploit; Data integrity; Materialized view; Data source; Information retrieval; Database; Theoretical computer science; Data mining; Programming language; Database schema; Database design; View","score_opus":0.08156817350424389,"score_gpt":0.3206919336221838,"score_spread":0.2391237601179399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494439078","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.0275536,0.0010297762,0.9598017,0.0005055467,0.000087688284,0.00013936397,0.00042425413,0.0070293243,0.0034287197],"genre_scores_gemma":[0.32868138,0.00092481147,0.6641425,0.0002656724,0.00013072146,0.00012019356,0.0014884201,0.001640244,0.002606059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950388,0.0013325854,0.0006409163,0.0004777798,0.0021526641,0.0003573106],"domain_scores_gemma":[0.97912073,0.0076136817,0.0014504376,0.009437103,0.0021100685,0.00026796566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005743146,0.00091068365,0.0013494381,0.0017731172,0.00077252934,0.0048813415,0.003349723,0.0010405713,0.003137853],"category_scores_gemma":[0.025050953,0.0013391114,0.0009663528,0.0034654865,0.0009982084,0.009170536,0.003996044,0.0022991758,0.0010235343],"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.0009402604,0.00041438293,0.0046519707,0.0007055512,0.00028973786,0.0005854206,0.0016288682,0.032930598,0.056301776,0.06628543,0.019744135,0.81552196],"study_design_scores_gemma":[0.00026501447,0.00032348384,0.0016703156,0.00020637538,0.0003815943,0.00091924454,0.000503631,0.7188651,0.14437735,0.0954881,0.036825523,0.00017429721],"about_ca_topic_score_codex":0.0021730524,"about_ca_topic_score_gemma":0.004782262,"teacher_disagreement_score":0.005743146,"about_ca_system_score_codex":0.0007045976,"about_ca_system_score_gemma":0.002197737,"threshold_uncertainty_score":0.030373037},"labels":[],"label_agreement":null},{"id":"W1494502516","doi":"10.1007/978-3-540-69407-6_15","title":"Computable Categoricity of Graphs with Finite Components","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Categorical variable; Graph; Discrete mathematics; Finite graph; Combinatorics","score_opus":0.022347056287216168,"score_gpt":0.22304239964019493,"score_spread":0.20069534335297876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494502516","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.46053883,0.002130382,0.36871257,0.0029823082,0.00038792033,0.00021897985,0.0010617239,0.0017533414,0.16221389],"genre_scores_gemma":[0.93859476,0.0004900664,0.03944442,0.00028874376,0.00012764642,0.00016267136,0.00097275816,0.0002656108,0.019653294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.00026729694,0.000062066094,0.0002564228,0.00026551972,0.00014138327],"domain_scores_gemma":[0.9954568,0.003240926,0.00019307241,0.00057202246,0.0002948535,0.00024222687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086401164,0.00066050724,0.0011748166,0.0023051053,0.0015867793,0.0046165106,0.0016722422,0.0014309067,0.0074900854],"category_scores_gemma":[0.004282088,0.0007877996,0.001344797,0.0024929494,0.0041610817,0.007596485,0.002827364,0.0037243618,0.0006935909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020184363,0.000009066848,0.00017128115,0.000040545143,0.0000049493256,0.000039050905,0.00026349621,0.0012048894,0.00046095828,0.9936941,0.0006230163,0.0034683773],"study_design_scores_gemma":[0.000008167583,0.0000041303556,0.000082892555,0.000011575487,0.0000055300898,0.000030098925,0.000063412255,0.0019309404,0.0003349868,0.9960788,0.0014441092,0.0000054230454],"about_ca_topic_score_codex":0.0016085084,"about_ca_topic_score_gemma":0.0021102931,"teacher_disagreement_score":0.0074900854,"about_ca_system_score_codex":0.0026999807,"about_ca_system_score_gemma":0.0009719687,"threshold_uncertainty_score":0.025056899},"labels":[],"label_agreement":null},{"id":"W1494584744","doi":"10.1007/978-3-540-73101-6_46","title":"Multiple Perspectives on Executable Acceptance Test-Driven Development","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Executable; Test (biology); Test-driven development; Context (archaeology); Software engineering; Computer science; Process management; Engineering management; Knowledge management; Software; Software development; Engineering; Programming language","score_opus":0.025701765101763183,"score_gpt":0.2702732010187613,"score_spread":0.2445714359169981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494584744","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.024476256,0.016446529,0.79463696,0.016441392,0.0007148459,0.000081777864,0.00009242781,0.00044393615,0.14666584],"genre_scores_gemma":[0.77288055,0.011816333,0.18844607,0.0020192983,0.001188252,0.0002961697,0.00021858477,0.00048212774,0.022652628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98721397,0.0059225913,0.0005566683,0.0008510497,0.0047142226,0.0007414925],"domain_scores_gemma":[0.9471168,0.04302143,0.0011671981,0.003573859,0.0041735717,0.0009471776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009171382,0.0017374859,0.0010790655,0.0037180083,0.0016226441,0.010969417,0.0034768758,0.005737687,0.007397931],"category_scores_gemma":[0.0196116,0.0015305891,0.0009689241,0.003681607,0.008503608,0.014238848,0.0043153376,0.007077477,0.0010150156],"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.0000803998,0.000086265034,0.0006008307,0.00030317143,0.000026730593,0.00052552245,0.004605437,0.0048606503,0.00090049166,0.91341037,0.0019288943,0.07267129],"study_design_scores_gemma":[0.00005492563,0.00016211442,0.0009259434,0.00094525743,0.000081762504,0.0009374595,0.003099442,0.04564909,0.0035532396,0.8882876,0.056227896,0.00007526255],"about_ca_topic_score_codex":0.001947375,"about_ca_topic_score_gemma":0.0021893033,"teacher_disagreement_score":0.010969417,"about_ca_system_score_codex":0.0025649897,"about_ca_system_score_gemma":0.0020240345,"threshold_uncertainty_score":0.04850346},"labels":[],"label_agreement":null},{"id":"W1494600236","doi":"10.1007/978-3-642-14623-7_3","title":"Protecting Cryptographic Keys against Continual Leakage","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Adversary; Cryptography; Information leakage; Computation; Homomorphic encryption; Computer security; Side channel attack; Encryption; Leakage (economics); Memory leak; Theoretical computer science; Distributed computing; Algorithm; Computer hardware; Memory management","score_opus":0.015135840580243216,"score_gpt":0.2556747906477822,"score_spread":0.24053895006753898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494600236","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.06862468,0.004283928,0.8602839,0.0016554286,0.00062183035,0.00014031718,0.00018425533,0.0029726727,0.061232977],"genre_scores_gemma":[0.82361174,0.0033720138,0.10754103,0.0004326635,0.000420776,0.000129849,0.00025107872,0.00058000314,0.063660845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982438,0.00024863338,0.00012468683,0.00024415195,0.0008711445,0.00026751249],"domain_scores_gemma":[0.9958287,0.00096398965,0.0003240237,0.0023989968,0.00041163398,0.00007269105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013630067,0.0010676318,0.00086097367,0.00092852773,0.0008867224,0.003417565,0.0015005642,0.0020953682,0.0047269086],"category_scores_gemma":[0.0046383776,0.00081425026,0.0006337998,0.0012614321,0.0022197415,0.009217971,0.0047348407,0.0033446245,0.005739586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000325623,0.000101474936,0.000497673,0.000558013,0.00008808236,0.0005864988,0.0011205403,0.014079819,0.070675604,0.5755446,0.009164665,0.32725736],"study_design_scores_gemma":[0.00007031353,0.00029234897,0.00031392145,0.0002781641,0.00012599748,0.003698109,0.00029959783,0.047307476,0.20575264,0.6382041,0.10353785,0.00011942269],"about_ca_topic_score_codex":0.000053693664,"about_ca_topic_score_gemma":0.000046242832,"teacher_disagreement_score":0.0047269086,"about_ca_system_score_codex":0.00061597826,"about_ca_system_score_gemma":0.00057635544,"threshold_uncertainty_score":0.015813112},"labels":[],"label_agreement":null},{"id":"W1494687202","doi":"10.1007/978-3-642-28652-0_3","title":"Programming Paradigm Driven Heap Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heap (data structure); Bytecode; Programming language; Heuristics; Lazy evaluation; Static analysis; Program analysis; Theoretical computer science; Functional programming; Java; Operating system","score_opus":0.023533778825862963,"score_gpt":0.254565142688936,"score_spread":0.23103136386307302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494687202","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.006231162,0.0004985628,0.969492,0.0007555283,0.00022319918,0.00009438661,0.00026621684,0.003677259,0.018761713],"genre_scores_gemma":[0.15768625,0.0006358378,0.8138868,0.0008311755,0.00020685385,0.00018834311,0.0010458214,0.002564705,0.022954091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981834,0.00046145535,0.0000995715,0.00034467125,0.0006997941,0.00021099199],"domain_scores_gemma":[0.9978029,0.0007669474,0.00008333353,0.0008424764,0.00043049,0.00007385906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018053966,0.00069365767,0.00060907303,0.0013392824,0.00093746773,0.0027215546,0.0030701258,0.0009263725,0.012664317],"category_scores_gemma":[0.0045808274,0.0007301112,0.0014337179,0.0014591125,0.0011931803,0.0048621264,0.0036132208,0.0034433047,0.0030866782],"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.00019520166,0.00010752061,0.00079925585,0.00029238116,0.000070021866,0.00010914612,0.00032265534,0.0067601,0.0069581787,0.7097969,0.020681249,0.25390726],"study_design_scores_gemma":[0.000035836663,0.000034928304,0.0002366217,0.00009253293,0.00006441734,0.00024749638,0.00014844707,0.07672807,0.014555578,0.8424498,0.06537173,0.00003453086],"about_ca_topic_score_codex":0.00089289196,"about_ca_topic_score_gemma":0.0020111764,"teacher_disagreement_score":0.012664317,"about_ca_system_score_codex":0.0010546071,"about_ca_system_score_gemma":0.0016828736,"threshold_uncertainty_score":0.042366385},"labels":[],"label_agreement":null},{"id":"W1494689342","doi":"10.1007/978-3-540-27868-9_67","title":"Bounds for the Average Generalization Error of the Mixture of Experts Neural Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Artificial neural network; Generalization error; Upper and lower bounds; Approximation error; Modular design; Computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.018631484583932854,"score_gpt":0.24961199831087835,"score_spread":0.2309805137269455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494689342","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.009797187,0.012786686,0.95965576,0.003366858,0.000848431,0.000102027836,0.00045229463,0.0011014469,0.011889343],"genre_scores_gemma":[0.33453453,0.016719623,0.6074283,0.003989189,0.0053844214,0.0015542533,0.0020197204,0.0024659375,0.025904136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894281,0.0039612143,0.00070874096,0.0021225086,0.002860247,0.00091915176],"domain_scores_gemma":[0.89856917,0.08151453,0.0026475207,0.006563544,0.008829987,0.001875303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028927345,0.0053762696,0.004932632,0.0049212566,0.0018892131,0.0046984656,0.009336464,0.008452953,0.009633361],"category_scores_gemma":[0.115204886,0.0020426053,0.003952322,0.0036474438,0.005433879,0.013775255,0.009483621,0.014417858,0.0032602747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086703454,0.00019280697,0.0020817693,0.0014361719,0.00093580934,0.00029314213,0.00049713027,0.45859134,0.004448865,0.37266135,0.020074563,0.13792002],"study_design_scores_gemma":[0.000023617671,0.00008733312,0.0008741958,0.00028955252,0.00015585049,0.00016366514,0.00004553759,0.8081834,0.0014539947,0.18589234,0.0027575805,0.00007288888],"about_ca_topic_score_codex":0.004523312,"about_ca_topic_score_gemma":0.004098841,"teacher_disagreement_score":0.028927345,"about_ca_system_score_codex":0.006249587,"about_ca_system_score_gemma":0.0028647862,"threshold_uncertainty_score":0.1529842},"labels":[],"label_agreement":null},{"id":"W1494877715","doi":"10.1007/978-3-642-02011-7_14","title":"An Application of Self-organizing Data Structures to Compression","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Waterloo","funders":"","keywords":"Computer science; Locality of reference; Data compression; Locality; Compression (physics); Algorithm; Subroutine; Construct (python library); Lossless compression; Theoretical computer science; Cache; Parallel computing; Programming language","score_opus":0.01986597128195474,"score_gpt":0.2784942480151792,"score_spread":0.25862827673322447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494877715","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.012079518,0.001847345,0.9739102,0.00025413634,0.00026859785,0.0000671293,0.00006805605,0.0012173853,0.010287679],"genre_scores_gemma":[0.19155896,0.002690765,0.79205173,0.00018610417,0.00047592394,0.00015529816,0.00020646703,0.00025204231,0.012422686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996557,0.00006450034,0.000026928365,0.000051391893,0.00018016585,0.000021231468],"domain_scores_gemma":[0.99916315,0.00043481472,0.000036646616,0.00020528902,0.0001369459,0.00002313443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822901,0.00040642582,0.00048269486,0.0012902779,0.0005409056,0.0010769407,0.0008589055,0.00066889,0.0038828496],"category_scores_gemma":[0.0019540202,0.00032944183,0.00046428276,0.0023211397,0.0010135893,0.0014415481,0.0008480671,0.00070239964,0.0008287702],"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.00012774656,0.0000934719,0.00030717163,0.00027383096,0.00003904616,0.00022201553,0.0002778995,0.043375175,0.023549557,0.32102242,0.007946767,0.60276496],"study_design_scores_gemma":[0.00005455936,0.0001855663,0.0005286325,0.00007440409,0.000045724202,0.0011393883,0.000120714256,0.59881014,0.034560617,0.3115,0.05293134,0.0000489471],"about_ca_topic_score_codex":0.00058098696,"about_ca_topic_score_gemma":0.00050300395,"teacher_disagreement_score":0.0038828496,"about_ca_system_score_codex":0.00038585975,"about_ca_system_score_gemma":0.00029405413,"threshold_uncertainty_score":0.012989461},"labels":[],"label_agreement":null},{"id":"W1495015330","doi":"10.1007/978-3-540-27809-2_5","title":"Addressing Online Dictionary Attacks with Login Histories and Humans-in-the-Loop","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Carleton University","funders":"","keywords":"Login; Computer science; Protocol (science); Computer security; Android malware; Operating system; Malware","score_opus":0.04629810382412054,"score_gpt":0.278464538618773,"score_spread":0.2321664347946525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495015330","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.09435541,0.00111018,0.86542475,0.0016766185,0.00018129467,0.00015223317,0.0000705192,0.0023111675,0.03471784],"genre_scores_gemma":[0.9333119,0.0005864759,0.05259237,0.0002274247,0.00016043345,0.000061416,0.00007913318,0.00016242046,0.012818384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975442,0.0009705847,0.00009924654,0.00027407892,0.00075919734,0.0003525888],"domain_scores_gemma":[0.9933242,0.0033383972,0.0005472549,0.002321553,0.00031886745,0.00014969007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159767,0.0008010704,0.001007955,0.000817625,0.0011983054,0.0025293555,0.001289822,0.0021489246,0.004411041],"category_scores_gemma":[0.007919391,0.00048931834,0.00043109036,0.00090359914,0.0021742843,0.008435713,0.004439814,0.00259781,0.00107241],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012238829,0.00059986475,0.004079316,0.00038200244,0.00010286433,0.0011272399,0.0014329109,0.08232592,0.026984116,0.44946682,0.015605899,0.4166691],"study_design_scores_gemma":[0.000076148615,0.00024302365,0.0006177422,0.00007214462,0.00006814093,0.0017680575,0.0004867679,0.6130174,0.029082434,0.33321553,0.021295924,0.000056844958],"about_ca_topic_score_codex":0.0003887198,"about_ca_topic_score_gemma":0.00043409405,"teacher_disagreement_score":0.004411041,"about_ca_system_score_codex":0.00055232464,"about_ca_system_score_gemma":0.00061364763,"threshold_uncertainty_score":0.0147563815},"labels":[],"label_agreement":null},{"id":"W1495062402","doi":"10.1007/978-3-540-72590-9_166","title":"Optimization of IG-Based Fuzzy System with the Aid of GAs and Its Application to Software Process","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Ministry of Education and Human Resources Development","keywords":"Computer science; Fuzzy logic; Data mining; Genetic algorithm; Defuzzification; Membership function; Software; Neuro-fuzzy; Fuzzy set operations; Fuzzy classification; Fuzzy control system; Fuzzy set; Mathematical optimization; Artificial intelligence; Fuzzy number; Machine learning; Mathematics","score_opus":0.013089443749119611,"score_gpt":0.23346063478161536,"score_spread":0.22037119103249575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495062402","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.06435215,0.0011806139,0.92191947,0.00022330595,0.00007148172,0.000056626726,0.000058076108,0.00045417465,0.011684122],"genre_scores_gemma":[0.88961947,0.000460817,0.1075597,0.00004392978,0.000022857033,0.0000837436,0.00005306716,0.000047166108,0.0021090922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985826,0.000050667248,0.000006333427,0.000023702984,0.000044701323,0.000016305074],"domain_scores_gemma":[0.99981123,0.00011691584,0.000018642242,0.000008685568,0.000038401988,0.0000062205877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468,0.00057688355,0.0009917826,0.0003482045,0.00046614083,0.00077882153,0.0007152079,0.00084992487,0.001223672],"category_scores_gemma":[0.00069586356,0.0002749253,0.00063753413,0.0005926111,0.000497005,0.0004380625,0.00038494144,0.0005749774,0.00013849765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056948007,0.000018179158,0.0002442745,0.000060110146,0.000019043238,0.000045745484,0.00003329674,0.9770558,0.0020858448,0.0030619055,0.00029034496,0.01702848],"study_design_scores_gemma":[0.0000026906844,0.000015485328,0.00005834495,0.0000028786008,0.0000037700142,0.0000057255565,0.0000032829225,0.9988689,0.0002501015,0.0006658384,0.00012116202,0.0000018215148],"about_ca_topic_score_codex":0.0063095256,"about_ca_topic_score_gemma":0.003954451,"teacher_disagreement_score":0.0063095256,"about_ca_system_score_codex":0.00056681194,"about_ca_system_score_gemma":0.0005607468,"threshold_uncertainty_score":0.012545645},"labels":[],"label_agreement":null},{"id":"W1495121142","doi":"10.1007/3-540-47721-7_32","title":"Two Observations on Probabilistic Primality Testing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","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":"Université de Montréal","funders":"","keywords":"Primality test; Probabilistic logic; Computer science; Mathematics; Artificial intelligence; Prime (order theory); Combinatorics","score_opus":0.16437186075419746,"score_gpt":0.3301653151367604,"score_spread":0.16579345438256293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495121142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036371507,0.0032622647,0.8370435,0.04608751,0.001956254,0.00013757187,0.0011848443,0.00056831783,0.07338824],"genre_scores_gemma":[0.8017062,0.003597717,0.14785255,0.007379784,0.009383228,0.00045504022,0.0013721278,0.00077969424,0.027473692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9884043,0.004760749,0.00048732027,0.0022179268,0.0030551937,0.0010745721],"domain_scores_gemma":[0.8325111,0.13963915,0.0031220175,0.016706152,0.005523608,0.002497988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013121371,0.0017386632,0.0032250937,0.003856074,0.0027636085,0.0055994964,0.0045022205,0.006161185,0.014834818],"category_scores_gemma":[0.10569521,0.0019502689,0.002675056,0.004903872,0.017838234,0.026030924,0.010289112,0.016312437,0.001748643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015341128,0.000059553906,0.00064449996,0.00010143966,0.00001792835,0.00010375832,0.00019741993,0.0024090956,0.00019382815,0.9681225,0.008751533,0.01924501],"study_design_scores_gemma":[0.000027910904,0.000018831346,0.00021216403,0.00003540872,0.000012284728,0.00013816301,0.000019433159,0.00926497,0.00026216556,0.9873511,0.002638628,0.00001889065],"about_ca_topic_score_codex":0.00080550584,"about_ca_topic_score_gemma":0.0003789981,"teacher_disagreement_score":0.014834818,"about_ca_system_score_codex":0.0024641554,"about_ca_system_score_gemma":0.001560456,"threshold_uncertainty_score":0.06939328},"labels":[],"label_agreement":null},{"id":"W1495160560","doi":"10.1007/978-3-540-30466-1_3","title":"Modeling Geospatial Databases with Plug-Ins for Visual Languages: A Pragmatic Approach and the Impacts of 16 Years of Research and Experimentations on Perceptory","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Geospatial analysis; Rotation formalisms in three dimensions; Computer science; Unified Modeling Language; Database; Geospatial PDF; Plug-in; Data science; Software engineering; Programming language; Geography; Software; Cartography","score_opus":0.04313467398315612,"score_gpt":0.3443264711299999,"score_spread":0.3011917971468438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495160560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135097625,0.00017780327,0.97606736,0.0010057308,0.000048379323,0.00010114244,0.00027291174,0.004415747,0.0044012545],"genre_scores_gemma":[0.18072452,0.0005340533,0.81056863,0.00038783293,0.00004602844,0.00018220267,0.0005746199,0.0019740178,0.00500814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969584,0.0013599442,0.00028186184,0.00040796303,0.000783947,0.00020795222],"domain_scores_gemma":[0.99295104,0.004095934,0.00032669483,0.00178162,0.0005668081,0.0002779326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075970097,0.0009966063,0.0009047799,0.0009677274,0.0011778522,0.012209748,0.0041397004,0.0019510578,0.0037869937],"category_scores_gemma":[0.014391268,0.0017478267,0.0021072868,0.0013542274,0.0035858678,0.0153678525,0.004801561,0.0032285366,0.00087251054],"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.00049839565,0.00026118086,0.0036040605,0.0007211056,0.0002055388,0.00045627792,0.0041492805,0.080990575,0.009270056,0.80341387,0.0075270743,0.088902645],"study_design_scores_gemma":[0.0001325587,0.00014671525,0.0005385756,0.0003527103,0.00023834595,0.0004286434,0.0016949255,0.47325757,0.019568412,0.41665515,0.08685169,0.00013470836],"about_ca_topic_score_codex":0.006152718,"about_ca_topic_score_gemma":0.009814621,"teacher_disagreement_score":0.012209748,"about_ca_system_score_codex":0.0015053385,"about_ca_system_score_gemma":0.0019941593,"threshold_uncertainty_score":0.040177345},"labels":[],"label_agreement":null},{"id":"W1495172023","doi":"10.1007/11790273_4","title":"A 3-D Computational Model for Multicellular Tissue Growth","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Slime Mold and Myxomycetes Research","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":"Simon Fraser University","funders":"","keywords":"Multicellular organism; Cellular automaton; Markov chain; Computer science; Population; Dynamics (music); Stochastic cellular automaton; Biological system; Artificial intelligence; Cell; Biology; Machine learning","score_opus":0.018750296195870396,"score_gpt":0.2527770021598702,"score_spread":0.2340267059639998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495172023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066332154,0.0010417901,0.89617026,0.0012400682,0.00026032215,0.00012862399,0.0013888171,0.0008564439,0.032581568],"genre_scores_gemma":[0.71445733,0.0016696847,0.25517675,0.00052179734,0.00016667167,0.0006717061,0.0010425642,0.00046469315,0.025828848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998802,0.00002673314,0.000009005943,0.000026285095,0.000043356722,0.000014343716],"domain_scores_gemma":[0.9997068,0.0001467051,0.000036988087,0.000032383155,0.00004092604,0.000036234815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017549623,0.0006954604,0.00085863675,0.00045365552,0.00071177416,0.0013940624,0.0021579014,0.0026435542,0.005366438],"category_scores_gemma":[0.0007906913,0.0008017237,0.0012257624,0.0006519634,0.0009335792,0.0008160189,0.0014720459,0.00093259645,0.0008573442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013305282,0.000013624978,0.00012471383,0.000026680176,0.000009390118,0.00007351669,0.000028887765,0.9871579,0.0014905701,0.008392397,0.00039991748,0.0022691218],"study_design_scores_gemma":[0.0000061228857,0.0000053116055,0.000038365863,0.0000031599536,0.000002925614,0.000021818762,0.0000041443823,0.9966736,0.00016185245,0.0023298918,0.00074778777,0.0000050054437],"about_ca_topic_score_codex":0.008634388,"about_ca_topic_score_gemma":0.0055543454,"teacher_disagreement_score":0.008634388,"about_ca_system_score_codex":0.00067287433,"about_ca_system_score_gemma":0.00087026256,"threshold_uncertainty_score":0.017952561},"labels":[],"label_agreement":null},{"id":"W14951761","doi":"10.1007/978-3-642-27576-0_4","title":"Selections: Internet Voting with Over-the-Shoulder Coercion-Resistance","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":63,"is_retracted":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":"Coercion (linguistics); Voting; Computer science; Bullet voting; Computer security; Verifiable secret sharing; Cardinal voting systems; The Internet; Internet privacy; Ballot; Adversary; Password; World Wide Web; Law; Political science; Programming language","score_opus":0.014616094634979546,"score_gpt":0.240159609132977,"score_spread":0.22554351449799745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14951761","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.050500657,0.0018351796,0.2751949,0.0063716657,0.0033557958,0.0003054579,0.00065658265,0.0024354602,0.65934426],"genre_scores_gemma":[0.62307054,0.0008710469,0.027716488,0.00065366906,0.001255527,0.00016318739,0.00049622596,0.0010379611,0.34473538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987619,0.00047259108,0.000042654814,0.00015848533,0.00040284966,0.00016152766],"domain_scores_gemma":[0.998409,0.00078324723,0.00006267098,0.0003967794,0.00022799426,0.00012029116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092237524,0.0005977773,0.0005382187,0.00053038466,0.001439533,0.0024360488,0.0010641164,0.0010761674,0.032920726],"category_scores_gemma":[0.0041786986,0.0003013872,0.0004418435,0.00089424243,0.0016110237,0.0028459327,0.0013364091,0.0021009643,0.006166642],"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.0003333468,0.000091708534,0.00041512988,0.00015241647,0.000027225893,0.00029047893,0.0005247801,0.0062175095,0.0030179156,0.7787986,0.09123182,0.118899025],"study_design_scores_gemma":[0.00008634686,0.00012614454,0.0006291176,0.00007533678,0.00003426442,0.0004111462,0.00024755936,0.034923844,0.008379627,0.7760188,0.17902158,0.000046245656],"about_ca_topic_score_codex":0.0004943435,"about_ca_topic_score_gemma":0.0007779344,"teacher_disagreement_score":0.032920726,"about_ca_system_score_codex":0.00059594586,"about_ca_system_score_gemma":0.00055991847,"threshold_uncertainty_score":0.11013079},"labels":[],"label_agreement":null},{"id":"W1495255916","doi":"10.1007/11790853_32","title":"A Generative Graphical Model for Collaborative Filtering of Visual Content","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Generative grammar; Content (measure theory); Computer science; Generative model; Graphical model; Artificial intelligence; Mathematics","score_opus":0.04482640906205822,"score_gpt":0.28512984219235193,"score_spread":0.24030343313029373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495255916","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.0027085128,0.00013326267,0.9956559,0.00012663926,0.000020239839,0.00003075333,0.00015565817,0.0006395623,0.00052960985],"genre_scores_gemma":[0.41017866,0.0009534951,0.5711513,0.0004972044,0.0002732175,0.00061581406,0.001713738,0.0010006151,0.013615825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706286,0.0011816616,0.0001334347,0.00074392464,0.00061622844,0.00026175423],"domain_scores_gemma":[0.98889416,0.008140936,0.0004908861,0.0013689889,0.00082365994,0.0002814481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033889152,0.0013504358,0.00257515,0.003229719,0.0011256058,0.0031044083,0.004797705,0.004090769,0.0067916233],"category_scores_gemma":[0.015858365,0.0021366724,0.0039437637,0.0039746477,0.0021453663,0.0040938766,0.0029736978,0.0029592025,0.003037168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034734537,0.00022173018,0.002136576,0.00037511543,0.00037249047,0.0005646352,0.0009314052,0.58698785,0.008737171,0.24812506,0.00872695,0.14247374],"study_design_scores_gemma":[0.00001890094,0.0000180718,0.00014986814,0.000011799154,0.000036095014,0.00008073893,0.000013257319,0.9505356,0.0004454148,0.047801055,0.00086724124,0.00002193066],"about_ca_topic_score_codex":0.018317351,"about_ca_topic_score_gemma":0.020218456,"teacher_disagreement_score":0.018317351,"about_ca_system_score_codex":0.0019236121,"about_ca_system_score_gemma":0.0013582361,"threshold_uncertainty_score":0.03642142},"labels":[],"label_agreement":null},{"id":"W1495262204","doi":"10.1007/978-3-642-34862-4_18","title":"FIFO Queueing Policies for Packets with Heterogeneous Processing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"FIFO (computing and electronics); Network packet; Computer science; Queueing theory; Queue; FIFO and LIFO accounting; Bounded function; Throughput; Computer network; Distributed computing; Real-time computing; Telecommunications; Mathematics; Operating system; Wireless","score_opus":0.027340042047799384,"score_gpt":0.27158548266187577,"score_spread":0.24424544061407638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495262204","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.02448745,0.0024240273,0.9624729,0.0006809961,0.00053208607,0.00013771777,0.00010450791,0.00060933526,0.008550998],"genre_scores_gemma":[0.78840995,0.0032109926,0.18539388,0.000585487,0.000780528,0.00030486146,0.00022020107,0.00037023472,0.020723736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827635,0.0003848615,0.00011900505,0.00020394899,0.0006047352,0.00041102915],"domain_scores_gemma":[0.9961578,0.0023552577,0.0002539967,0.00047909777,0.0005009662,0.0002527629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040720883,0.0013115946,0.0012520046,0.00086965243,0.001259642,0.002824354,0.0034347335,0.0011838919,0.0037203722],"category_scores_gemma":[0.009740133,0.0006899294,0.00058175303,0.0011783207,0.0010919684,0.0027801804,0.0016532667,0.0019573616,0.00061853003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094707595,0.00035370735,0.0010289437,0.00037809645,0.00008627046,0.00023385296,0.0003719266,0.45473793,0.006566182,0.3597686,0.01247187,0.16305548],"study_design_scores_gemma":[0.00006063837,0.000073465904,0.0001722544,0.000039040602,0.0000395741,0.0000765059,0.00004054597,0.9077318,0.0015309677,0.08676702,0.003440019,0.00002820199],"about_ca_topic_score_codex":0.0032189114,"about_ca_topic_score_gemma":0.0025681842,"teacher_disagreement_score":0.0040720883,"about_ca_system_score_codex":0.0032160394,"about_ca_system_score_gemma":0.0028179395,"threshold_uncertainty_score":0.023334146},"labels":[],"label_agreement":null},{"id":"W1495279197","doi":"10.1007/978-3-540-39893-6_32","title":"Compositional Verification of a Switch Fabric from Nortel Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Model checking; Formal verification; Functional verification; Reduction (mathematics); Verilog; State (computer science); Intelligent verification; Programming language; Finite-state machine; Runtime verification; High-level verification; Embedded system; Theoretical computer science; Field-programmable gate array; Software development; Software","score_opus":0.019911845125787867,"score_gpt":0.2546541314687369,"score_spread":0.23474228634294902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495279197","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.10149475,0.00014587851,0.876518,0.00030160474,0.0001547923,0.00023896678,0.00019377089,0.0041409894,0.016811341],"genre_scores_gemma":[0.82401305,0.00017997564,0.16452461,0.00014013403,0.000033687284,0.0001611002,0.0002982337,0.00064672675,0.010002323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989304,0.00025699523,0.00004363645,0.00013308637,0.0004892877,0.0001466541],"domain_scores_gemma":[0.9988651,0.00063222955,0.00006830883,0.00026841546,0.0001370264,0.000028794866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010692654,0.00066193275,0.00052855216,0.0004997072,0.00077521964,0.0015728164,0.0009827268,0.0008480274,0.005200026],"category_scores_gemma":[0.0032441851,0.000534711,0.0011225989,0.00022833659,0.0014847734,0.0014549951,0.0017081529,0.00097454974,0.0006533521],"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.0007061872,0.00018525428,0.0011559373,0.00058852386,0.00010170138,0.0015347233,0.0010329915,0.30365047,0.1196007,0.47852683,0.00262763,0.09028897],"study_design_scores_gemma":[0.00014806005,0.00017165553,0.00045874232,0.00009808866,0.00010242028,0.00027318328,0.00013170189,0.6676729,0.10727087,0.20831834,0.015299504,0.000054566663],"about_ca_topic_score_codex":0.0031292005,"about_ca_topic_score_gemma":0.00385527,"teacher_disagreement_score":0.005200026,"about_ca_system_score_codex":0.0009253007,"about_ca_system_score_gemma":0.0012716377,"threshold_uncertainty_score":0.017395854},"labels":[],"label_agreement":null},{"id":"W1495386528","doi":"10.1007/11559573_20","title":"Type-2 Fuzzy Image Enhancement","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fuzzy logic; Image (mathematics); Artificial intelligence; Image processing; Computer vision; Contrast (vision); Image enhancement","score_opus":0.013053205138489267,"score_gpt":0.25944042010565366,"score_spread":0.2463872149671644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495386528","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.028064027,0.0028859056,0.88992554,0.00024015844,0.0005398795,0.00009284026,0.00009847842,0.0007461191,0.07740711],"genre_scores_gemma":[0.37312278,0.0039782417,0.47251356,0.00027194308,0.00030063782,0.000085811924,0.00019741617,0.00016424792,0.14936535],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988127,0.000008692118,0.00000493807,0.000023497902,0.000067488625,0.000014176027],"domain_scores_gemma":[0.99987876,0.000030635947,0.000009322964,0.000019181543,0.000056133587,0.0000059422105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018053115,0.00043532692,0.00037428417,0.00043248635,0.00026424995,0.0005220297,0.00048777252,0.00046642838,0.008246859],"category_scores_gemma":[0.00026923596,0.00018801528,0.0003817336,0.00035122843,0.0002409195,0.0005837924,0.00029331242,0.00059737975,0.0015231154],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030498777,0.000079589394,0.00031437428,0.0006319527,0.000036174253,0.00035577934,0.00012671182,0.011443566,0.3270424,0.047854163,0.010319001,0.6014913],"study_design_scores_gemma":[0.000048102575,0.0005736725,0.0035908362,0.00019020964,0.000120498145,0.004724073,0.00012768511,0.35596693,0.45344424,0.047329545,0.13377127,0.000112895454],"about_ca_topic_score_codex":0.00030635027,"about_ca_topic_score_gemma":0.0004497971,"teacher_disagreement_score":0.008246859,"about_ca_system_score_codex":0.00021074859,"about_ca_system_score_gemma":0.00014757115,"threshold_uncertainty_score":0.027588546},"labels":[],"label_agreement":null},{"id":"W1495473427","doi":"10.1007/978-3-540-27801-6_29","title":"Reversal Distance without Hurdles and Fortresses","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"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 à Montréal","funders":"","keywords":"Permutation (music); Fortress (chess); Simple (philosophy); Computer science; Algorithm; Tree (set theory); Value (mathematics); Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence; Physics","score_opus":0.008796151040115455,"score_gpt":0.2313689773336902,"score_spread":0.22257282629357472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495473427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11120433,0.0029664328,0.48186442,0.002921819,0.0019365083,0.000121665624,0.00051563286,0.0018123199,0.3966569],"genre_scores_gemma":[0.65944326,0.0017082483,0.106655546,0.0010489962,0.00082557014,0.00017665631,0.0006437738,0.0013943347,0.22810362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992207,0.00014130643,0.00004647857,0.0002417029,0.00021935262,0.00013048807],"domain_scores_gemma":[0.9978243,0.00093196245,0.000102238344,0.00075951044,0.00024136306,0.00014064384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176361,0.00059490756,0.0009829135,0.0010094523,0.0015630532,0.0018626056,0.0014271159,0.0012397063,0.024015814],"category_scores_gemma":[0.0070870607,0.0005842444,0.0007118634,0.0010369952,0.0022107488,0.004472255,0.003008741,0.003066364,0.006889328],"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.00009066753,0.000018794766,0.00019808802,0.00007394163,0.0000068351414,0.00012283248,0.000108050845,0.0017926466,0.0015896576,0.93061495,0.006228957,0.059154563],"study_design_scores_gemma":[0.000017923121,0.000049375598,0.00015883283,0.000020501473,0.000011536181,0.00031912787,0.000062037274,0.0063006687,0.0023781003,0.9669543,0.02370742,0.000020173253],"about_ca_topic_score_codex":0.00033263504,"about_ca_topic_score_gemma":0.00052418525,"teacher_disagreement_score":0.024015814,"about_ca_system_score_codex":0.00048886635,"about_ca_system_score_gemma":0.00053353695,"threshold_uncertainty_score":0.08034092},"labels":[],"label_agreement":null},{"id":"W1495542305","doi":"10.1007/11618058_2","title":"Morphing Planar Graphs While Preserving Edge Directions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphing; Computer science; Simple (philosophy); Planar graph; Transformation (genetics); Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Planar; Mathematics; Computer graphics (images); Artificial intelligence","score_opus":0.019555418173186498,"score_gpt":0.2353126155325862,"score_spread":0.2157571973593997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495542305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10509874,0.00017955812,0.8810874,0.00015982984,0.00012224766,0.000075157244,0.00014625397,0.0014326179,0.011698236],"genre_scores_gemma":[0.46690688,0.0005197525,0.51296514,0.00010175526,0.0000435469,0.00007598351,0.00034507737,0.0012138663,0.017828051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998504,0.000014544675,0.000008142406,0.000045546294,0.00006361359,0.000017735634],"domain_scores_gemma":[0.9997278,0.00008009415,0.00003202674,0.00010291749,0.0000353734,0.000021679201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016906332,0.0008511008,0.00048705447,0.0008795258,0.00032180603,0.0006252138,0.00092470704,0.0005517348,0.0035738202],"category_scores_gemma":[0.0008130574,0.0006541275,0.0004181837,0.0007193386,0.00073215447,0.0011739256,0.0014968279,0.0010994618,0.0008674452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016466872,0.00010244443,0.00088843924,0.00032497695,0.000053696727,0.00027562334,0.00048245318,0.16474149,0.16810478,0.09476973,0.005620772,0.56447095],"study_design_scores_gemma":[0.00006336057,0.0003094073,0.0011133184,0.00006946676,0.00009557147,0.0012645916,0.00049492705,0.6544584,0.11825363,0.18786818,0.03593999,0.000069161826],"about_ca_topic_score_codex":0.0007566895,"about_ca_topic_score_gemma":0.0018031836,"teacher_disagreement_score":0.0035738202,"about_ca_system_score_codex":0.0001852874,"about_ca_system_score_gemma":0.00020879986,"threshold_uncertainty_score":0.011955678},"labels":[],"label_agreement":null},{"id":"W1495728280","doi":"10.1007/11867586_32","title":"Posterior Sampling of Scientific Images","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sample (material); Image resolution; Resolution (logic); Sampling (signal processing); Artificial intelligence; Superresolution; Computer vision; Image (mathematics); Image processing; Porous medium; Pattern recognition (psychology); Geology; Porosity; Physics","score_opus":0.02292459763073616,"score_gpt":0.2858964746626657,"score_spread":0.26297187703192954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495728280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00436675,0.00049688166,0.9919314,0.00021183671,0.00005834027,0.000026299305,0.00014995551,0.000315291,0.0024433257],"genre_scores_gemma":[0.28726256,0.0038765764,0.671395,0.00041305396,0.0008825206,0.00032730176,0.004459626,0.0008209672,0.030562354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900264,0.00032176735,0.0000395902,0.00024206971,0.00031966218,0.00007435193],"domain_scores_gemma":[0.99667716,0.0020977724,0.00017986594,0.0005569551,0.00036097164,0.00012723063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028136093,0.00078109954,0.0010822486,0.0014919434,0.00038790598,0.001748276,0.0017016473,0.0012150382,0.005888302],"category_scores_gemma":[0.009512421,0.0010222651,0.0011330659,0.0014646315,0.0012453069,0.0020145397,0.0016845696,0.001883159,0.001743993],"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.0003438165,0.00009536902,0.0013675822,0.000427643,0.00016583677,0.00013454685,0.00017862015,0.3081092,0.010490375,0.3671933,0.012668231,0.29882553],"study_design_scores_gemma":[0.000019200748,0.00002445448,0.0005931586,0.00002889188,0.000019416988,0.000090129135,0.00001354666,0.859847,0.0029300791,0.13154666,0.004869448,0.00001803728],"about_ca_topic_score_codex":0.0023981174,"about_ca_topic_score_gemma":0.0026386683,"teacher_disagreement_score":0.005888302,"about_ca_system_score_codex":0.00097216916,"about_ca_system_score_gemma":0.00077902933,"threshold_uncertainty_score":0.019698381},"labels":[],"label_agreement":null},{"id":"W1495731517","doi":"10.1007/978-3-642-03367-4_9","title":"Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Search engine indexing; Substring; Range (aeronautics); Computer science; Grid; Combinatorics; Set (abstract data type); Key (lock); Data structure; Space (punctuation); Representation (politics); Mathematics; Information retrieval","score_opus":0.018884239051182312,"score_gpt":0.2678463420359224,"score_spread":0.24896210298474009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495731517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0342129,0.0010022849,0.94322103,0.0005492092,0.00020349356,0.00024957175,0.0017951558,0.007813679,0.010952719],"genre_scores_gemma":[0.19340934,0.0006652301,0.79268026,0.00014906615,0.00013268844,0.00037219585,0.0029774334,0.0008018484,0.008811897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876344,0.00025323554,0.000202048,0.00016086671,0.00047887402,0.00014161161],"domain_scores_gemma":[0.9954194,0.0015570464,0.00030511545,0.001922339,0.00064785365,0.00014827008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010201859,0.0005260582,0.0016787337,0.0018985603,0.0010050528,0.002257263,0.0020422505,0.00080422044,0.009973122],"category_scores_gemma":[0.0062709334,0.000573892,0.0006186598,0.007627224,0.0010309588,0.0051625487,0.0037929902,0.0013035913,0.00275432],"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.0009567902,0.00036858785,0.0012857792,0.00046219016,0.000038732305,0.00025242346,0.0003883389,0.08060538,0.010117383,0.26805788,0.037795242,0.5996713],"study_design_scores_gemma":[0.00026850562,0.00027383014,0.00043104062,0.000090167676,0.000044244887,0.00036355355,0.00022626552,0.57203007,0.010807816,0.3824392,0.03295009,0.00007523438],"about_ca_topic_score_codex":0.0026967637,"about_ca_topic_score_gemma":0.004182125,"teacher_disagreement_score":0.009973122,"about_ca_system_score_codex":0.000851098,"about_ca_system_score_gemma":0.0014051895,"threshold_uncertainty_score":0.033363402},"labels":[],"label_agreement":null},{"id":"W1495880578","doi":"10.1007/978-3-540-75757-3_59","title":"Automatic Target and Trajectory Identification for Deep Brain Stimulation (DBS) Procedures","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"London Health Sciences Centre; Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research","keywords":"Deep brain stimulation; Subthalamic nucleus; Trajectory; Probabilistic logic; Computer science; Surgical planning; Neurosurgery; Visualization; Artificial intelligence; Medicine; Surgery; Parkinson's disease; Pathology; Physics","score_opus":0.014972463907058534,"score_gpt":0.2966107171359505,"score_spread":0.28163825322889197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495880578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025399351,0.00023935075,0.97227097,0.00009228585,0.00002606147,0.00004156342,0.000105649255,0.00080452673,0.0010202534],"genre_scores_gemma":[0.55763537,0.00031817795,0.4391541,0.00007718805,0.000025194922,0.0000952195,0.00028827463,0.00016232452,0.0022441207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00008536276,0.000020760328,0.00004079447,0.00011535853,0.000027393677],"domain_scores_gemma":[0.99954164,0.00023857933,0.000048938287,0.000043191845,0.00010406857,0.000023614286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032930804,0.00047544035,0.00033616688,0.0004314787,0.00034764595,0.00050733954,0.00035120282,0.0006557041,0.0026155952],"category_scores_gemma":[0.0013908056,0.00027257216,0.00027104578,0.0003644971,0.00021797173,0.00042300476,0.0004640456,0.0005449779,0.0008017374],"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.0010832633,0.0000640735,0.0015898283,0.0001819632,0.000036822254,0.00015214212,0.00011198823,0.034671284,0.20335476,0.0040425532,0.0022035646,0.7525078],"study_design_scores_gemma":[0.00007219626,0.00030146507,0.007882188,0.000032480388,0.00003879616,0.0010701217,0.000079493555,0.8506638,0.12647915,0.0094734635,0.0038588967,0.000048073405],"about_ca_topic_score_codex":0.001794575,"about_ca_topic_score_gemma":0.003243652,"teacher_disagreement_score":0.0026155952,"about_ca_system_score_codex":0.00024306987,"about_ca_system_score_gemma":0.0008250047,"threshold_uncertainty_score":0.008750081},"labels":[],"label_agreement":null},{"id":"W1495922501","doi":"10.1007/978-3-642-01399-7_47","title":"Video Broadcasting to Heterogeneous Mobile Devices","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science; Testbed; Broadcasting (networking); Scalability; Mobile device; Scheme (mathematics); Computer network; Energy (signal processing); Correctness; Mobile computing; Efficient energy use; Multimedia Broadcast Multicast Service; Real-time computing; Multicast; Electrical engineering; Operating system; Algorithm","score_opus":0.02757239522275568,"score_gpt":0.3134662895154221,"score_spread":0.28589389429266643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495922501","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05282876,0.018235937,0.7186983,0.0008833161,0.0009665508,0.00012192517,0.00021467172,0.001109165,0.2069413],"genre_scores_gemma":[0.6440295,0.028978195,0.08894955,0.0005099565,0.002064096,0.00014268236,0.0005721581,0.0005196957,0.23423418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998306,0.000032711458,0.000006022542,0.00003554366,0.00005893781,0.000036129837],"domain_scores_gemma":[0.9996878,0.00015532151,0.00001240232,0.00004973766,0.00007669982,0.000017999706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023107114,0.00063679146,0.00053251954,0.0007643776,0.00051023386,0.0013284779,0.0009384664,0.0006075163,0.009532961],"category_scores_gemma":[0.0007079068,0.0003163615,0.00028825967,0.0014105284,0.00041446742,0.0012363307,0.0009735726,0.00072139263,0.0016637739],"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.00026422067,0.00006285093,0.00050785573,0.00047062867,0.00008212611,0.0008233727,0.0007034926,0.020549562,0.08882507,0.06341225,0.02071179,0.8035868],"study_design_scores_gemma":[0.000119125114,0.0005667199,0.0034983298,0.00057976466,0.0005748871,0.0036066293,0.0015777774,0.36538786,0.13691269,0.08060501,0.40646875,0.000102371734],"about_ca_topic_score_codex":0.002251499,"about_ca_topic_score_gemma":0.0024683492,"teacher_disagreement_score":0.009532961,"about_ca_system_score_codex":0.00065454625,"about_ca_system_score_gemma":0.00017609195,"threshold_uncertainty_score":0.03189093},"labels":[],"label_agreement":null},{"id":"W1495927311","doi":"10.1007/978-3-642-02777-2_35","title":"VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Toronto","funders":"","keywords":"Computer science; Heuristics; Backtracking; DPLL algorithm; Probabilistic logic; Inference; Local consistency; Constraint satisfaction problem; Solver; Heuristic; Random variable; Theoretical computer science; Variable (mathematics); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.020088596819840737,"score_gpt":0.26177628607030023,"score_spread":0.2416876892504595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495927311","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.0009114226,0.0002840175,0.99079645,0.00020523687,0.00008581858,0.000040347455,0.00027791833,0.0029017841,0.0044969865],"genre_scores_gemma":[0.04975379,0.00052932283,0.9412734,0.00032099034,0.000171228,0.00014965926,0.0010104587,0.0012088821,0.0055822683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978174,0.0006527904,0.00012764418,0.00045595499,0.0008126076,0.00013352421],"domain_scores_gemma":[0.99747354,0.0015791422,0.0001179011,0.00053889176,0.0002400116,0.000050476654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021572176,0.0013612892,0.0015762931,0.001381558,0.00080354547,0.0023600524,0.0050677317,0.0015645437,0.016447019],"category_scores_gemma":[0.0072844415,0.0014328334,0.0016985517,0.003093329,0.0011869175,0.0049978034,0.003455091,0.004136737,0.0045714052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018800749,0.00019820484,0.00034318518,0.00071497774,0.00017160234,0.0001338004,0.00012594978,0.17028753,0.004882865,0.19225657,0.03883615,0.5918611],"study_design_scores_gemma":[0.0000694637,0.00003520192,0.00010500896,0.000068635374,0.00006250341,0.00012528042,0.000023415165,0.7253989,0.003996236,0.24844542,0.021638906,0.0000310186],"about_ca_topic_score_codex":0.0031015952,"about_ca_topic_score_gemma":0.0083459895,"teacher_disagreement_score":0.016447019,"about_ca_system_score_codex":0.0011422841,"about_ca_system_score_gemma":0.001628748,"threshold_uncertainty_score":0.05502075},"labels":[],"label_agreement":null},{"id":"W1495928713","doi":"10.1007/3-540-47967-8_28","title":"Tracking and Rendering Using Dynamic Textures on Geometric Structure from Motion","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Alberta","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Rendering (computer graphics); Extrapolation; Computer graphics (images); Animation; Geometric transformation; Mathematics; Image (mathematics)","score_opus":0.02417253429137449,"score_gpt":0.268068045952292,"score_spread":0.2438955116609175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495928713","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.008381666,0.00018095333,0.98639023,0.000075432574,0.000105527906,0.000025824522,0.000054752694,0.0018995901,0.0028859384],"genre_scores_gemma":[0.21658166,0.0010290183,0.7723161,0.00011404058,0.0001293667,0.00008275814,0.00028412888,0.0013060628,0.008156855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997502,0.000028162905,0.00000849776,0.00003300739,0.00014861622,0.00003151198],"domain_scores_gemma":[0.9996259,0.00016491323,0.000021396821,0.00008546861,0.00006131113,0.000040898107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032563665,0.00085102336,0.0010524968,0.0010271403,0.00042682732,0.0019041898,0.001091148,0.0007588729,0.006933206],"category_scores_gemma":[0.0013776644,0.00071323983,0.0008045162,0.0010146792,0.0006559251,0.0011028586,0.0015246433,0.0012761287,0.0011377864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004424108,0.00007867447,0.00048429184,0.00023239314,0.000094950134,0.00038092647,0.00037856848,0.22535539,0.13776912,0.08382301,0.009719907,0.54124033],"study_design_scores_gemma":[0.000054167685,0.000054382646,0.00020186054,0.000025369149,0.000028016702,0.00018225262,0.000045373792,0.94296056,0.022472816,0.022508781,0.011437024,0.000029411694],"about_ca_topic_score_codex":0.0039025892,"about_ca_topic_score_gemma":0.004163938,"teacher_disagreement_score":0.006933206,"about_ca_system_score_codex":0.00054741715,"about_ca_system_score_gemma":0.0004129845,"threshold_uncertainty_score":0.023193896},"labels":[],"label_agreement":null},{"id":"W1495993730","doi":"10.1007/3-540-36086-7_16","title":"Anonymous Communications for Mobile Agents","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Key (lock); Agile software development; The Internet; Computer security; Communications system; World Wide Web; Computer network; Telecommunications; Software engineering","score_opus":0.031851977542773705,"score_gpt":0.27252362637486577,"score_spread":0.24067164883209208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495993730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03007555,0.0028200613,0.79197615,0.0046924325,0.0013547962,0.00015489702,0.0001858562,0.0016630145,0.1670772],"genre_scores_gemma":[0.63832027,0.0024834021,0.13291568,0.00051294477,0.0011452737,0.00033723976,0.000298237,0.00034399604,0.22364286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987704,0.0005062219,0.000052269243,0.00015004017,0.0003534497,0.00016758889],"domain_scores_gemma":[0.99736637,0.0012128805,0.00017669662,0.0007125153,0.000401714,0.00012983604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011838981,0.0005328011,0.00048803876,0.00058849406,0.001690619,0.0023764626,0.0009909902,0.0016656695,0.011961864],"category_scores_gemma":[0.005665587,0.00036194889,0.00046471044,0.0007694744,0.0012319864,0.0042072814,0.00206457,0.001604384,0.002868075],"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.00007615441,0.00003981028,0.00013072498,0.00006337008,0.00001021776,0.000101839505,0.00024060406,0.009125787,0.0009766867,0.9076308,0.01531873,0.06628525],"study_design_scores_gemma":[0.0000227532,0.000049933766,0.0001330393,0.000033213037,0.000019333256,0.00018940479,0.000102266495,0.079229236,0.001606519,0.84670895,0.07188366,0.000021721733],"about_ca_topic_score_codex":0.0008354059,"about_ca_topic_score_gemma":0.0010445457,"teacher_disagreement_score":0.011961864,"about_ca_system_score_codex":0.00084454706,"about_ca_system_score_gemma":0.00082368904,"threshold_uncertainty_score":0.040016472},"labels":[],"label_agreement":null},{"id":"W1496157640","doi":"10.1007/978-3-642-03417-6_35","title":"Relative Span Weighted Localization of Uncooperative Nodes in Wireless Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"Carleton University","funders":"","keywords":"Computer science; Span (engineering); Computer network; Wireless; Wireless network; Telecommunications; Structural engineering; Engineering","score_opus":0.007664853559296427,"score_gpt":0.20725111668557653,"score_spread":0.1995862631262801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496157640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03719558,0.0007228842,0.9592323,0.000058497324,0.00004834941,0.000016557986,0.00003179101,0.00014832527,0.002545778],"genre_scores_gemma":[0.7284525,0.0018775383,0.26002064,0.00007332225,0.00015061328,0.00009653803,0.00023979224,0.00013763848,0.008951444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935406,0.00018345694,0.000028110111,0.00015036871,0.00022519434,0.000058881582],"domain_scores_gemma":[0.9992859,0.00032128175,0.00008771944,0.00011845576,0.00015711752,0.000029588646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081285875,0.00085868535,0.0008223789,0.0009963656,0.00040137695,0.0007882212,0.0016274994,0.0007259522,0.0012080198],"category_scores_gemma":[0.0032752904,0.0004339315,0.00036603864,0.0019496499,0.0006619753,0.0022863213,0.002171251,0.00063835405,0.0004299265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026519175,0.00004873895,0.0011184576,0.00025680356,0.00007935853,0.00015838326,0.00033955547,0.7052132,0.016170233,0.050642647,0.0019033918,0.22380412],"study_design_scores_gemma":[0.000005435087,0.00009569239,0.0003690757,0.00001735864,0.00002045617,0.00014767457,0.00007428306,0.962632,0.003913487,0.031370506,0.0013402862,0.0000137725765],"about_ca_topic_score_codex":0.0006656665,"about_ca_topic_score_gemma":0.00086394575,"teacher_disagreement_score":0.0016274994,"about_ca_system_score_codex":0.00049757026,"about_ca_system_score_gemma":0.00028324965,"threshold_uncertainty_score":0.004298866},"labels":[],"label_agreement":null},{"id":"W1496191571","doi":"10.1007/978-3-540-74260-9_69","title":"MPEG Video Watermarking Using Tensor Singular Value Decomposition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":44,"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":"Digital watermarking; Computer science; Robustness (evolution); Singular value decomposition; Computer vision; Algorithm; Histogram; Tensor (intrinsic definition); Artificial intelligence; Histogram equalization; Tensor decomposition; Mathematics; Image (mathematics)","score_opus":0.02346053079733649,"score_gpt":0.28710469228678603,"score_spread":0.2636441614894495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496191571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023791391,0.00085652765,0.9700665,0.000108695225,0.00014554062,0.0000547938,0.00011179863,0.0010931516,0.0037715225],"genre_scores_gemma":[0.23071249,0.0018364047,0.75534254,0.000060961993,0.00014662453,0.00006410801,0.0004537073,0.0003066467,0.011076444],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979454,0.00003120611,0.000015072727,0.000022104487,0.000120364624,0.00001677853],"domain_scores_gemma":[0.9997212,0.000055966055,0.000031125626,0.00006351893,0.00011564475,0.00001255256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002610133,0.0006467378,0.00040498364,0.0009481026,0.00022176649,0.0006071071,0.00026509454,0.00038387816,0.002413193],"category_scores_gemma":[0.0007466521,0.00025307626,0.00038830534,0.00086236943,0.0002509991,0.0009211957,0.00038994796,0.0004899935,0.0008029018],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027583982,0.00007025397,0.00038694707,0.00020784838,0.0000545897,0.00017067899,0.00008328747,0.025548631,0.34381735,0.03030178,0.0036893303,0.5953935],"study_design_scores_gemma":[0.000029421262,0.0001896447,0.0011028735,0.00004833411,0.00008342876,0.000501588,0.000042253152,0.69176954,0.2759334,0.012904907,0.0173442,0.000050388815],"about_ca_topic_score_codex":0.000588604,"about_ca_topic_score_gemma":0.00089328515,"teacher_disagreement_score":0.002413193,"about_ca_system_score_codex":0.00022770718,"about_ca_system_score_gemma":0.0002465486,"threshold_uncertainty_score":0.008072913},"labels":[],"label_agreement":null},{"id":"W1496266809","doi":"10.1007/978-3-642-15705-9_69","title":"Probabilistic Anatomical Connectivity Using Completion Fields","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Probabilistic logic; Computer science; Diffusion; Diffusion MRI; SIGNAL (programming language); Imaging phantom; Artificial intelligence; Field (mathematics); Algorithm; Probabilistic analysis of algorithms; Machine learning; Data mining; Magnetic resonance imaging; Mathematics; Physics","score_opus":0.05624690948395681,"score_gpt":0.3600744338762137,"score_spread":0.30382752439225685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496266809","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.005151657,0.00009213089,0.9935029,0.00012424198,0.000022074795,0.000021834288,0.00009105424,0.0004948763,0.00049922976],"genre_scores_gemma":[0.3719701,0.0005831645,0.619894,0.00012059734,0.00021038608,0.0002465421,0.0009408882,0.0006180902,0.005416232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992292,0.000307256,0.000036623143,0.00018528574,0.00019060119,0.00005114876],"domain_scores_gemma":[0.99531555,0.002956666,0.00043854793,0.0006530448,0.00041591085,0.00022029116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257206,0.0009638205,0.0015674521,0.0025182853,0.00063778664,0.0014648534,0.002355491,0.0017411778,0.004271551],"category_scores_gemma":[0.0088459,0.0013375476,0.0019409022,0.0020541844,0.00132178,0.003082867,0.001916616,0.0022838393,0.0009786591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026032448,0.00011911876,0.0009841957,0.00019073975,0.00015112331,0.00017034766,0.00015756776,0.6160871,0.0042074407,0.16060628,0.0059814993,0.21108444],"study_design_scores_gemma":[0.0000142468125,0.000019576724,0.000115856106,0.000007746367,0.000011413689,0.00005957326,0.000004852757,0.9291597,0.00052466954,0.06947002,0.0005987896,0.000013580641],"about_ca_topic_score_codex":0.006774819,"about_ca_topic_score_gemma":0.006102841,"teacher_disagreement_score":0.006774819,"about_ca_system_score_codex":0.0008175448,"about_ca_system_score_gemma":0.0011787018,"threshold_uncertainty_score":0.014289737},"labels":[],"label_agreement":null},{"id":"W1496305014","doi":"10.1007/3-540-45486-1_18","title":"CViz: An Interactive Visualization System for Rule Induction","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Visualization; Computer graphics (images); Artificial intelligence","score_opus":0.02490884525193125,"score_gpt":0.30734135595722434,"score_spread":0.28243251070529307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496305014","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.004262917,0.0004756095,0.52928174,0.00035146283,0.00022209098,0.00026514544,0.02009294,0.43383408,0.011214126],"genre_scores_gemma":[0.05189138,0.0011398655,0.8542008,0.00055899506,0.00017359428,0.0012751352,0.031091293,0.037766773,0.021902228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995074,0.00007911188,0.00005345152,0.000106632455,0.00021718754,0.00003615335],"domain_scores_gemma":[0.99825484,0.0011587623,0.000061013525,0.0002059843,0.0002217893,0.00009750789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090269645,0.0023057417,0.0010889693,0.00298325,0.00058938604,0.0023328897,0.0024466387,0.0012124527,0.084939696],"category_scores_gemma":[0.0034813161,0.0011699949,0.0011400627,0.0018642615,0.00033947572,0.0020255107,0.0019058797,0.0019233961,0.017017601],"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.00074515387,0.00018767006,0.0014733954,0.0014207808,0.00017534278,0.00052247586,0.0006011043,0.008061981,0.022345021,0.01183477,0.39757362,0.5550587],"study_design_scores_gemma":[0.0008300302,0.00020460122,0.0030896326,0.00063877704,0.00031286257,0.0010899164,0.00024662455,0.30086708,0.09000205,0.053167805,0.5492513,0.00029933138],"about_ca_topic_score_codex":0.0037162069,"about_ca_topic_score_gemma":0.007195055,"teacher_disagreement_score":0.084939696,"about_ca_system_score_codex":0.00052533415,"about_ca_system_score_gemma":0.00095896685,"threshold_uncertainty_score":0.28415155},"labels":[],"label_agreement":null},{"id":"W1496312080","doi":"10.1007/978-3-540-74873-1_41","title":"Game Design Guided by Visual Attention","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"McGill University","funders":"","keywords":"Fixation (population genetics); Eye movement; Computer science; Visual attention; Cognitive psychology; Human–computer interaction; Psychology; Artificial intelligence; Cognition; Neuroscience","score_opus":0.04250869968859724,"score_gpt":0.3099240877672267,"score_spread":0.26741538807862947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496312080","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.3090389,0.00040773329,0.58994716,0.0004089592,0.00020306167,0.00053837424,0.0001399465,0.0022621886,0.097053654],"genre_scores_gemma":[0.90162337,0.00008181517,0.0855604,0.000101719495,0.000011333931,0.00024819706,0.0000875605,0.00011688453,0.012168873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998172,0.00006786852,0.0000057762936,0.000035810335,0.000039827853,0.000033589404],"domain_scores_gemma":[0.99958473,0.0002367907,0.000037132326,0.00002489772,0.00005368187,0.00006263179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027151575,0.0006262957,0.00022823755,0.00024763888,0.00015756993,0.0006664091,0.00066879985,0.0003452606,0.00819073],"category_scores_gemma":[0.0017576815,0.00019876119,0.00019308168,0.000094928204,0.0002053152,0.0005821985,0.0006342802,0.00048295746,0.0006843357],"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.002965017,0.0030800996,0.0070823887,0.00084714533,0.00025219782,0.00056984375,0.0022088424,0.06287086,0.19803427,0.11220141,0.028008416,0.5818796],"study_design_scores_gemma":[0.0007207212,0.0024069494,0.015341903,0.00017075014,0.00021938178,0.0005637929,0.00100246,0.8064452,0.03436441,0.09812026,0.040556833,0.000087335895],"about_ca_topic_score_codex":0.00067067484,"about_ca_topic_score_gemma":0.0014865976,"teacher_disagreement_score":0.00819073,"about_ca_system_score_codex":0.00024824074,"about_ca_system_score_gemma":0.00024352755,"threshold_uncertainty_score":0.027400672},"labels":[],"label_agreement":null},{"id":"W1496427819","doi":"10.1007/978-3-540-87481-2_43","title":"A Visualization-Based Exploratory Technique for Classifier Comparison with Respect to Multiple Metrics and Multiple Domains","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Classifier (UML); Multitude; Machine learning; Artificial intelligence; Visualization; Data mining; Pattern recognition (psychology)","score_opus":0.03964815951718529,"score_gpt":0.2956787907324393,"score_spread":0.256030631215254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496427819","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.0042982884,0.00012807516,0.9851504,0.00012512274,0.00006660115,0.00016788697,0.00051886,0.008917703,0.00062712794],"genre_scores_gemma":[0.030128406,0.00007216356,0.9671705,0.00003542919,0.000043832235,0.00032133047,0.00083333,0.00078579265,0.00060916063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486095,0.0018405628,0.0005683513,0.0007073149,0.0018239593,0.00019877993],"domain_scores_gemma":[0.9706514,0.016803361,0.0014635535,0.0043238825,0.006061634,0.0006962615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00808571,0.002093171,0.0018026179,0.0076798527,0.0012205581,0.0038330737,0.0021956791,0.0016194761,0.007301848],"category_scores_gemma":[0.029756045,0.0008291076,0.0017160795,0.00619071,0.000731579,0.0035734843,0.0030793766,0.0027182952,0.0019868787],"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.0007565347,0.00030271994,0.0031933235,0.0007123298,0.0003510511,0.00037882745,0.0013920908,0.005794783,0.050371606,0.019028718,0.028468564,0.8892494],"study_design_scores_gemma":[0.0003959976,0.0010355806,0.010129063,0.00044059675,0.0004905027,0.0034906147,0.0013475993,0.7233778,0.09490934,0.09954125,0.064373106,0.000468574],"about_ca_topic_score_codex":0.0011222652,"about_ca_topic_score_gemma":0.0017238936,"teacher_disagreement_score":0.00808571,"about_ca_system_score_codex":0.000439258,"about_ca_system_score_gemma":0.001284417,"threshold_uncertainty_score":0.042761862},"labels":[],"label_agreement":null},{"id":"W1496432666","doi":"10.1007/978-3-642-17653-1_31","title":"On the Message Complexity of Global Computations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Mathematical proof; Upper and lower bounds; Computer science; Node (physics); Class (philosophy); Tree traversal; Identifier; Discrete mathematics; Combinatorics; Communication complexity; Degree (music); Theoretical computer science; Mathematics; Algorithm; Computer network; Physics; Artificial intelligence","score_opus":0.0265782751493129,"score_gpt":0.26425465287326083,"score_spread":0.23767637772394792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496432666","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.16044824,0.013198708,0.601114,0.018335158,0.0015604121,0.00023642041,0.0010974914,0.0013004259,0.20270917],"genre_scores_gemma":[0.84425735,0.007970415,0.09643675,0.0016300984,0.004041375,0.00067849585,0.001137888,0.0015668619,0.04228074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938226,0.0017578087,0.00021775768,0.00064976286,0.002548633,0.0010034771],"domain_scores_gemma":[0.9366119,0.05432708,0.0012471041,0.005024421,0.0017400519,0.0010496022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048702382,0.0017579768,0.0029217766,0.0028156117,0.0021514734,0.005828795,0.0039796247,0.0027407163,0.015894968],"category_scores_gemma":[0.040259715,0.0013408152,0.0016725472,0.004100307,0.0056931125,0.020451091,0.0047021555,0.009349493,0.0019326333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045871027,0.000106016334,0.0007816924,0.00027444863,0.000056575973,0.000100906065,0.00030495704,0.0447683,0.0019781336,0.90622073,0.011204261,0.03374529],"study_design_scores_gemma":[0.000046033576,0.000026751415,0.00036844253,0.000041167146,0.0000283337,0.000056613033,0.000045620924,0.11753204,0.00064667774,0.87863386,0.0025561312,0.000018447256],"about_ca_topic_score_codex":0.0023378457,"about_ca_topic_score_gemma":0.0017789004,"teacher_disagreement_score":0.015894968,"about_ca_system_score_codex":0.0045411293,"about_ca_system_score_gemma":0.0022060354,"threshold_uncertainty_score":0.05317402},"labels":[],"label_agreement":null},{"id":"W1496567137","doi":"10.1007/978-3-540-70500-0_4","title":"A Critical Analysis and Improvement of AACS Drive-Host Authentication","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheme (mathematics); Computer science; Host (biology); Authentication (law); Computer security; Key (lock); Security analysis; Mathematics","score_opus":0.01289871628158267,"score_gpt":0.28055992015393566,"score_spread":0.267661203872353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496567137","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.06129249,0.0023010115,0.87209266,0.0034932988,0.000842984,0.00059577264,0.0002821169,0.0044210274,0.054678597],"genre_scores_gemma":[0.751742,0.0011234432,0.22748616,0.00043509575,0.00038966577,0.00017178094,0.0002222313,0.00040720057,0.018022446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925397,0.0019400789,0.00032565664,0.00069447217,0.0038319016,0.0006682834],"domain_scores_gemma":[0.9848705,0.004419558,0.00061365427,0.004047601,0.0058508245,0.00019785015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004282456,0.0010421338,0.0005910849,0.002495703,0.0017173968,0.0036600882,0.0016791663,0.0013401672,0.009269774],"category_scores_gemma":[0.021614213,0.0005293407,0.0007620048,0.0013493276,0.0030975405,0.0062024356,0.00209815,0.0025795444,0.0021306705],"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.0010359266,0.00017372072,0.0030836524,0.0004888352,0.00005963239,0.0004226137,0.0009485603,0.031643063,0.031776138,0.5566457,0.013368416,0.36035368],"study_design_scores_gemma":[0.00007216901,0.0005509129,0.002577104,0.0003017362,0.00020451142,0.0011951108,0.00088821223,0.5441425,0.14334852,0.20899503,0.09759037,0.0001337922],"about_ca_topic_score_codex":0.0028274353,"about_ca_topic_score_gemma":0.001668563,"teacher_disagreement_score":0.009269774,"about_ca_system_score_codex":0.003311063,"about_ca_system_score_gemma":0.0038598932,"threshold_uncertainty_score":0.031010509},"labels":[],"label_agreement":null},{"id":"W1496655772","doi":"10.1007/978-3-540-39666-6_5","title":"Associative Classifiers for Medical Images","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Association rule learning; Associative property; Data mining; Artificial intelligence; Architecture; Association (psychology); Pattern recognition (psychology)","score_opus":0.019384155260222174,"score_gpt":0.2787657067286354,"score_spread":0.2593815514684132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496655772","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.023016468,0.009089109,0.9501797,0.00078477856,0.00074226543,0.00018573244,0.0014638449,0.004810245,0.009727866],"genre_scores_gemma":[0.24213856,0.008687603,0.7170676,0.00042640895,0.0010070355,0.00037305758,0.004074156,0.0003746377,0.025850978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959034,0.0000510436,0.000036858324,0.000077170036,0.00020854776,0.000036062887],"domain_scores_gemma":[0.9993749,0.0002149967,0.00006220546,0.00013362289,0.00018589031,0.000028446724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080995227,0.00062550313,0.0009876747,0.0024396426,0.00044379046,0.0013676996,0.0010313159,0.0009902385,0.008489068],"category_scores_gemma":[0.0022204323,0.00037382822,0.00071553414,0.0019439557,0.00035887447,0.0019131529,0.0011686622,0.0009294801,0.0051506218],"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.00012826713,0.00008129567,0.0007608223,0.00036074544,0.00006191648,0.00017652177,0.00004366817,0.008043469,0.016854594,0.015357137,0.02120409,0.9369274],"study_design_scores_gemma":[0.0000549189,0.0002531346,0.004713663,0.00027794557,0.00026971928,0.0027707142,0.00015415378,0.71523124,0.07547889,0.11517405,0.0855492,0.00007243732],"about_ca_topic_score_codex":0.00057498453,"about_ca_topic_score_gemma":0.0013037521,"teacher_disagreement_score":0.008489068,"about_ca_system_score_codex":0.00031935427,"about_ca_system_score_gemma":0.00054327806,"threshold_uncertainty_score":0.028398752},"labels":[],"label_agreement":null},{"id":"W1496663493","doi":"10.1007/11785231_6","title":"Nonlinear Function Learning by the Normalized Radial Basis Function Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Radial basis function; Computer science; Empirical risk minimization; Nonlinear system; Convergence (economics); Regularization (linguistics); Radial basis function network; Basis (linear algebra); Covariance; Function (biology); Minification; Consistency (knowledge bases); Basis function; Applied mathematics; Algorithm; Artificial neural network; Mathematical optimization; Artificial intelligence; Mathematics; Statistics; Mathematical analysis","score_opus":0.009200502120929585,"score_gpt":0.21148984377833502,"score_spread":0.20228934165740542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496663493","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.0044687446,0.0013738387,0.9910766,0.00011231555,0.00009222734,0.000013044553,0.00003312151,0.00032827407,0.0025018482],"genre_scores_gemma":[0.24536467,0.0030243713,0.7348281,0.00013257579,0.00022871417,0.00011923261,0.0002570696,0.00033216045,0.015713098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996044,0.00014475382,0.000019066103,0.00007815573,0.00013207302,0.000021576372],"domain_scores_gemma":[0.9995486,0.00016183352,0.00004188019,0.00006374492,0.00016848143,0.000015445847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011039653,0.00057463255,0.0007538649,0.00041203893,0.00021283397,0.0007709676,0.00096743106,0.00073235435,0.0020961233],"category_scores_gemma":[0.0029723647,0.0003824778,0.0005685057,0.0008156504,0.0006685733,0.0016384833,0.0008418855,0.0010040265,0.0014159139],"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.00016115834,0.000032446507,0.00037389732,0.00021286572,0.000073662464,0.00004469184,0.00004733264,0.4362683,0.010780841,0.0638435,0.0063661854,0.48179516],"study_design_scores_gemma":[0.0000030730855,0.000011968067,0.00010595262,0.000009494701,0.00000611142,0.000028893466,0.0000026630667,0.9864746,0.0016990073,0.0095802,0.0020696884,0.000008427545],"about_ca_topic_score_codex":0.0021741115,"about_ca_topic_score_gemma":0.0018841083,"teacher_disagreement_score":0.0021741115,"about_ca_system_score_codex":0.0005452688,"about_ca_system_score_gemma":0.00052779476,"threshold_uncertainty_score":0.0070121884},"labels":[],"label_agreement":null},{"id":"W1496739046","doi":"10.1007/978-3-540-24677-0_56","title":"Systematic versus Non-systematic Methods for Solving Incremental Satisfiability","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Satisfiability; Computer science; Propositional calculus; Boolean satisfiability problem; Conjunctive normal form; Propositional formula; Completeness (order theory); Set (abstract data type); Approximation algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Propositional variable","score_opus":0.03358788017929245,"score_gpt":0.3477794127939009,"score_spread":0.31419153261460847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496739046","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.009350109,0.00043148908,0.9854188,0.00012772359,0.000037571725,0.00010130358,0.000037670965,0.00090879726,0.0035865437],"genre_scores_gemma":[0.12539643,0.0005467503,0.8695605,0.00008621542,0.000031786254,0.00021598743,0.00015067631,0.00029135248,0.0037203778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868137,0.00042081068,0.00012119567,0.00013993894,0.000527364,0.00010927313],"domain_scores_gemma":[0.99402845,0.0041334466,0.0002291319,0.001207852,0.0003350034,0.00006610273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019188677,0.00057239353,0.0005222069,0.0008025366,0.00036411456,0.00064539706,0.0012841901,0.000631927,0.0043138643],"category_scores_gemma":[0.0077519333,0.00071213103,0.0011266485,0.0009690607,0.0012457453,0.0021442468,0.0016999478,0.0011632766,0.0006407388],"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.00029729123,0.00016256105,0.0012675386,0.0012520154,0.000115218194,0.0001268035,0.00058029103,0.031922016,0.016729098,0.18684202,0.005033851,0.75567144],"study_design_scores_gemma":[0.0003531215,0.0004366023,0.0012784781,0.00040760718,0.0004345994,0.0006291068,0.0003949647,0.4001953,0.041295063,0.52064425,0.033845592,0.00008524906],"about_ca_topic_score_codex":0.0006484409,"about_ca_topic_score_gemma":0.0032262835,"teacher_disagreement_score":0.0043138643,"about_ca_system_score_codex":0.00037454773,"about_ca_system_score_gemma":0.001615106,"threshold_uncertainty_score":0.014431298},"labels":[],"label_agreement":null},{"id":"W1496740266","doi":"10.1007/978-3-540-75759-7_113","title":"Proof of Concept of a Simple Computer–Assisted Technique for Correcting Bone Deformities","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Bone fractures and treatments","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Kingston General Hospital","funders":"","keywords":"Computer science; Rotation (mathematics); Software; Tracking (education); Simple (philosophy); Schedule; Computer vision; Computer-assisted surgery; Medical physics; Artificial intelligence; Medicine","score_opus":0.019678507628563685,"score_gpt":0.3005338890925104,"score_spread":0.28085538146394673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496740266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01404203,0.00050893275,0.9641675,0.0008152664,0.0006106107,0.00029037992,0.00019152058,0.000864117,0.01850964],"genre_scores_gemma":[0.3624834,0.0006756601,0.6184885,0.0005411455,0.0002814887,0.0005956857,0.00025901638,0.00016900478,0.016506158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986909,0.00011396554,0.0000527954,0.00026433528,0.0007789246,0.00009907138],"domain_scores_gemma":[0.9982992,0.0007787309,0.000156431,0.00028629592,0.0003825822,0.00009679067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007686445,0.0008309837,0.00063232967,0.0005479026,0.00056766375,0.0013417081,0.001812444,0.0017658259,0.013976277],"category_scores_gemma":[0.003007727,0.0005586945,0.0012014307,0.00027836676,0.0021848278,0.001278422,0.0026335907,0.0015447151,0.0017279341],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053828466,0.0005510802,0.00087743223,0.0017563889,0.00016644776,0.0018897491,0.0002956992,0.035264198,0.28081602,0.46796414,0.0148917185,0.19498895],"study_design_scores_gemma":[0.0008464476,0.0033314535,0.0048165764,0.00047512524,0.00024021616,0.010110763,0.00019860717,0.3443346,0.20201154,0.32145903,0.11183012,0.00034549783],"about_ca_topic_score_codex":0.0006086476,"about_ca_topic_score_gemma":0.00044938613,"teacher_disagreement_score":0.013976277,"about_ca_system_score_codex":0.00034142635,"about_ca_system_score_gemma":0.0011281694,"threshold_uncertainty_score":0.046755314},"labels":[],"label_agreement":null},{"id":"W1496788081","doi":"10.1007/978-3-642-04840-1_28","title":"Conceptual Modeling in Disaster Planning Using Agent Constructs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 British Columbia","funders":"","keywords":"Plan (archaeology); Computer science; Conceptual model; Focus (optics); Conceptual framework; Management science; Emergency management; The Conceptual Framework; Process management; Knowledge management; Operations research; Data science; Artificial intelligence; Engineering; Political science","score_opus":0.0733413579824214,"score_gpt":0.2830541083684765,"score_spread":0.20971275038605508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496788081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004468952,0.00090803043,0.97725326,0.0009007167,0.00006813821,0.0000739189,0.00014477133,0.00029626297,0.015885863],"genre_scores_gemma":[0.20115986,0.002369305,0.7852016,0.00021548802,0.00006319002,0.00032520285,0.0005740188,0.00022741802,0.009863968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931204,0.00035975207,0.000061003455,0.00008752412,0.00013082848,0.000048896167],"domain_scores_gemma":[0.9991203,0.0005583491,0.000050747127,0.00014551953,0.00007919701,0.000045871748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015434803,0.0009530418,0.0006458607,0.001328238,0.0011463823,0.0038759117,0.0023976385,0.0013553139,0.0076816403],"category_scores_gemma":[0.0028289494,0.0010121597,0.0013578862,0.0024979417,0.0032446263,0.0076131034,0.0018716636,0.0028083872,0.0010497721],"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.0000068499203,0.000012652707,0.00007308742,0.00008013735,0.000010721666,0.000060225884,0.0005641403,0.01584169,0.00021141086,0.9715645,0.0008072296,0.010767372],"study_design_scores_gemma":[0.000011735246,0.000017646891,0.000082471954,0.00013902492,0.000038243634,0.000114269926,0.0004532289,0.110161826,0.00074518507,0.8335282,0.05468926,0.000018879522],"about_ca_topic_score_codex":0.0063575823,"about_ca_topic_score_gemma":0.0051715025,"teacher_disagreement_score":0.0076816403,"about_ca_system_score_codex":0.0017695995,"about_ca_system_score_gemma":0.001255668,"threshold_uncertainty_score":0.025697649},"labels":[],"label_agreement":null},{"id":"W1496791178","doi":"10.1007/978-3-540-25966-4_24","title":"Sharing Training Patterns among Multiple Classifiers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Classifier (UML); Machine learning; Artificial intelligence; Training set; Information sharing; Data mining; Perspective (graphical); World Wide Web","score_opus":0.031691702199515226,"score_gpt":0.24650804907558369,"score_spread":0.21481634687606846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496791178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056983955,0.00050737907,0.9326894,0.0005985232,0.00019477938,0.00020530018,0.00008743707,0.0012990953,0.007434147],"genre_scores_gemma":[0.5897118,0.00067164516,0.39122388,0.00047433292,0.00027884648,0.0003486392,0.00060770597,0.0004576037,0.016225612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976496,0.00060318375,0.00019387157,0.00062810286,0.0007081012,0.00021711717],"domain_scores_gemma":[0.9889107,0.0031673182,0.00039417463,0.005973884,0.0012576322,0.00029624326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036170718,0.000832227,0.0018450534,0.0009759733,0.00078915915,0.002349706,0.0031180468,0.0017704017,0.0052850125],"category_scores_gemma":[0.014160046,0.0008623535,0.0011518816,0.001993715,0.0008022968,0.005779778,0.0035883936,0.0019088427,0.0024379],"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.00042160955,0.00036068435,0.0037444644,0.00016948037,0.0003196306,0.00020134392,0.00026948674,0.049740322,0.03743394,0.010584368,0.004115532,0.8926391],"study_design_scores_gemma":[0.000056920595,0.00037703084,0.004158173,0.00008089979,0.00043593053,0.00074706454,0.00029685654,0.82573014,0.043741647,0.11004702,0.014270002,0.00005828087],"about_ca_topic_score_codex":0.0007973284,"about_ca_topic_score_gemma":0.0010212351,"teacher_disagreement_score":0.0052850125,"about_ca_system_score_codex":0.00044392716,"about_ca_system_score_gemma":0.0008650804,"threshold_uncertainty_score":0.019129157},"labels":[],"label_agreement":null},{"id":"W1496800439","doi":"10.1007/978-3-642-16926-7_24","title":"From Path Graphs to Directed Path Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Toronto","funders":"","keywords":"Longest path problem; Induced path; Path (computing); Computer science; Block graph; Cograph; Combinatorics; Directed graph; Fast path; Induced subgraph isomorphism problem; Indifference graph; Pathwidth; Discrete mathematics; Mathematics; Algorithm; Graph; Chordal graph; Shortest path problem; Line graph; Voltage graph; Computer network","score_opus":0.015379193430134084,"score_gpt":0.26715536841971177,"score_spread":0.25177617498957766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496800439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064713946,0.009769414,0.8389265,0.0020924143,0.0012487009,0.00010014096,0.0012434146,0.0019081623,0.13823998],"genre_scores_gemma":[0.15869486,0.029653698,0.70189995,0.0027007642,0.0018245431,0.00048334143,0.0040704943,0.0029092645,0.09776307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956626,0.00010605658,0.000025276844,0.000133281,0.00013450992,0.00003461267],"domain_scores_gemma":[0.9989931,0.0006126496,0.000048941947,0.0001556047,0.00014204335,0.00004763972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038099306,0.001089086,0.00052703614,0.0021556593,0.0007611543,0.0022346484,0.0014924557,0.0009733193,0.017878136],"category_scores_gemma":[0.0031343186,0.0008116413,0.0008270544,0.0036402938,0.0016592069,0.007116562,0.0018757479,0.002829751,0.004274144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001211222,0.000014324945,0.00008066689,0.00029608852,0.0000109722505,0.00009127655,0.00024365497,0.0031163085,0.0007070375,0.86651236,0.02457874,0.10433641],"study_design_scores_gemma":[0.000002598155,0.0000039838737,0.000039357994,0.00004088725,0.0000054085476,0.00008015029,0.00003453796,0.0022341807,0.0001885661,0.95107716,0.04628826,0.000004893015],"about_ca_topic_score_codex":0.0016255768,"about_ca_topic_score_gemma":0.0017514027,"teacher_disagreement_score":0.017878136,"about_ca_system_score_codex":0.0011261362,"about_ca_system_score_gemma":0.00050483085,"threshold_uncertainty_score":0.059808373},"labels":[],"label_agreement":null},{"id":"W1496822384","doi":"10.1007/978-3-540-27810-8_15","title":"Connectivity of Graphs Under Edge Flips","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and 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":"Dalhousie University","funders":"","keywords":"Combinatorics; Disjoint sets; Vertex (graph theory); Planar graph; Mathematics; Graph; Discrete mathematics","score_opus":0.02026367846141447,"score_gpt":0.2386009472908872,"score_spread":0.21833726882947274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496822384","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.75902754,0.0013736944,0.12354773,0.0018397821,0.000280316,0.0001224246,0.0008509321,0.0004906724,0.11246687],"genre_scores_gemma":[0.9712804,0.0014339752,0.012686767,0.00019593623,0.0002638205,0.00011725108,0.00062695076,0.000117615506,0.013277276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996984,0.00007556294,0.000012989963,0.00007090307,0.00007809372,0.00006416094],"domain_scores_gemma":[0.99842644,0.00082409376,0.0002596197,0.00018141996,0.0001736651,0.00013487338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033461978,0.00033974313,0.0004906146,0.001357097,0.0008324466,0.0013871018,0.00061769114,0.0008102943,0.0051788576],"category_scores_gemma":[0.0030218645,0.00033026512,0.00043491359,0.001186045,0.0013255494,0.00212843,0.000878959,0.001074006,0.00038104155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002516554,0.00004167745,0.0011302866,0.00018876702,0.000026165288,0.00046592255,0.0005703294,0.02294447,0.0070160613,0.9185745,0.007575074,0.04121498],"study_design_scores_gemma":[0.000041947904,0.00005515831,0.001068443,0.00003725953,0.00002304471,0.00040714943,0.00017425735,0.025469065,0.0016974587,0.9667136,0.004297424,0.000015093801],"about_ca_topic_score_codex":0.00055924273,"about_ca_topic_score_gemma":0.00046779602,"teacher_disagreement_score":0.0051788576,"about_ca_system_score_codex":0.0004123187,"about_ca_system_score_gemma":0.00026789756,"threshold_uncertainty_score":0.017325044},"labels":[],"label_agreement":null},{"id":"W1496899170","doi":"10.1007/978-3-642-37157-8_20","title":"Modeling Gender Differences in Healthy Eating Determinants for Persuasive Intervention Design","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Psychological intervention; Intervention (counseling); Healthy eating; Eating behavior; Psychology; Demographics; Obesity; Developmental psychology; Clinical psychology; Medicine; Demography; Physical activity; Psychiatry; Physical therapy","score_opus":0.09148643287473794,"score_gpt":0.3232826096918575,"score_spread":0.23179617681711956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496899170","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.9784127,0.00026322406,0.018584484,0.00028606097,0.00004966313,0.000100975754,0.00017738638,0.00003916915,0.0020863994],"genre_scores_gemma":[0.99120635,0.00007412747,0.00720154,0.00003289907,0.000009921353,0.000090715024,0.00008654461,0.000015083756,0.0012829264],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989792,0.000653543,0.000019334018,0.00016082662,0.00006585402,0.00012128431],"domain_scores_gemma":[0.98866814,0.010407405,0.00029006848,0.00025578975,0.00020130852,0.00017730717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030973903,0.00060292304,0.00047214256,0.00051390775,0.000442862,0.0011030555,0.0008172511,0.0010362333,0.006811337],"category_scores_gemma":[0.015897438,0.00046726989,0.0013791353,0.00044183357,0.00037066263,0.00074887386,0.00050987216,0.0013111114,0.00044530438],"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.0064260513,0.004427352,0.6633408,0.00044393615,0.0018439684,0.00055114494,0.005381419,0.078106165,0.010626896,0.023966653,0.004060772,0.20082486],"study_design_scores_gemma":[0.00039744962,0.0026457945,0.28119278,0.00026159914,0.0018844687,0.00013873736,0.0044592954,0.6745934,0.004700744,0.027049612,0.0025799368,0.00009620713],"about_ca_topic_score_codex":0.013725386,"about_ca_topic_score_gemma":0.01766604,"teacher_disagreement_score":0.013725386,"about_ca_system_score_codex":0.00085802044,"about_ca_system_score_gemma":0.0010001437,"threshold_uncertainty_score":0.027291},"labels":[],"label_agreement":null},{"id":"W1496915765","doi":"10.1007/11759744_9","title":"Conformance Tests as Checking Experiments for Partial Nondeterministic FSM","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Nondeterministic algorithm; Computer science; Conformance testing; Equivalence (formal languages); Sequence (biology); Automaton; Algorithm; Programming language; Finite-state machine; Model checking; Theoretical computer science; Discrete mathematics; Mathematics; Operating system","score_opus":0.032897483581329594,"score_gpt":0.30610764226534015,"score_spread":0.27321015868401055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496915765","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.110896744,0.00026228826,0.8756165,0.00029440937,0.0001452059,0.00026658262,0.00028399963,0.0038887528,0.008345594],"genre_scores_gemma":[0.7420076,0.00012435937,0.25263858,0.0001930472,0.00006720185,0.00040190906,0.00039347593,0.00064041984,0.0035334574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99148566,0.004415453,0.00046315754,0.0009809184,0.0022027602,0.00045194768],"domain_scores_gemma":[0.95674485,0.036617033,0.0010618246,0.0037571788,0.001371568,0.0004475205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005047162,0.0011257163,0.0010120744,0.0020645375,0.0006306301,0.002131146,0.0022509978,0.0019651598,0.0066721323],"category_scores_gemma":[0.032180645,0.00081774034,0.0013322383,0.0012307762,0.003909164,0.0064018066,0.0023117904,0.0023615675,0.00063551887],"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.0010768252,0.00030863166,0.0031981298,0.0004100707,0.00011349805,0.00045263776,0.000798319,0.08002793,0.036191285,0.7704216,0.0022741223,0.10472704],"study_design_scores_gemma":[0.00013534146,0.0003229124,0.00068145763,0.000076937395,0.00007488442,0.0001863515,0.000110392655,0.4158618,0.045351464,0.53379256,0.0033466665,0.000059249356],"about_ca_topic_score_codex":0.00067844935,"about_ca_topic_score_gemma":0.0009016795,"teacher_disagreement_score":0.0066721323,"about_ca_system_score_codex":0.0011106759,"about_ca_system_score_gemma":0.0007017393,"threshold_uncertainty_score":0.026692212},"labels":[],"label_agreement":null},{"id":"W1496955394","doi":"10.1007/978-3-642-15399-0_4","title":"Everyone Can Do Magic: An Interactive Game with Speech and Gesture Recognition","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Gesture; Oracle; Speech recognition; Gesture recognition; MAGIC (telescope); Human–computer interaction; Game design; Multimedia; Artificial intelligence; Programming language","score_opus":0.02687290725597044,"score_gpt":0.2640829473894273,"score_spread":0.23721004013345684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496955394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12619282,0.0016551331,0.6126661,0.0011936271,0.000927618,0.00052915915,0.0013668861,0.017945657,0.23752306],"genre_scores_gemma":[0.3916829,0.00094107486,0.3958829,0.0007711854,0.00013261104,0.00091566466,0.0013125576,0.0023268457,0.20603429],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998802,0.000018763178,0.0000058233973,0.00002909209,0.00003979046,0.000026262744],"domain_scores_gemma":[0.99984455,0.000057334157,0.000006846491,0.000013692231,0.000022502882,0.000055047087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020770854,0.0018556885,0.00049834535,0.00030191027,0.0004941068,0.0010025167,0.0014122402,0.00094102585,0.03200096],"category_scores_gemma":[0.0006823679,0.00041391427,0.00044024648,0.00013019038,0.00039340623,0.0016280744,0.0020620623,0.0008611,0.006658786],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034507485,0.0006014617,0.0021190795,0.0010230087,0.0001612864,0.0014415692,0.003364379,0.007589059,0.17109205,0.06778358,0.14189081,0.599483],"study_design_scores_gemma":[0.000487635,0.0016338625,0.0069466354,0.00040580792,0.00029355517,0.0067369617,0.0017965112,0.091066994,0.059454553,0.060728364,0.770049,0.00040019388],"about_ca_topic_score_codex":0.0007248845,"about_ca_topic_score_gemma":0.0019366753,"teacher_disagreement_score":0.03200096,"about_ca_system_score_codex":0.00017750548,"about_ca_system_score_gemma":0.00026841552,"threshold_uncertainty_score":0.107053876},"labels":[],"label_agreement":null},{"id":"W1496974946","doi":"10.1007/bfb0024355","title":"Reflection in a uniform behavioral object model","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reflection (computer programming); Computer science; Encapsulation (networking); Object (grammar); Architecture; Semantics (computer science); Object model; Programming language; Common Object Request Broker Architecture; Artificial intelligence","score_opus":0.032665096886315435,"score_gpt":0.2958074335323978,"score_spread":0.2631423366460824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496974946","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.01936753,0.000068547444,0.9625933,0.0003544529,0.000046701054,0.00005830988,0.000065745015,0.0011945594,0.01625074],"genre_scores_gemma":[0.44265187,0.00024531328,0.5208346,0.00047977155,0.00011284658,0.00042169596,0.00042797677,0.0012268302,0.033598997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968876,0.0010709147,0.00029498458,0.0006668327,0.0007016558,0.00037805474],"domain_scores_gemma":[0.99323684,0.0016409808,0.00032165405,0.0038879355,0.00071222073,0.00020042741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035976546,0.00064599176,0.0008577961,0.00073301524,0.0011959985,0.0037597422,0.002383177,0.0015901051,0.0061825216],"category_scores_gemma":[0.009167803,0.0010144685,0.0016080507,0.0011446942,0.0034113328,0.010525401,0.0038411587,0.0030940778,0.0016710096],"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.000025920684,0.000021210331,0.00014090796,0.00001935131,0.0000054614743,0.000028516859,0.00021655364,0.002576768,0.0006656935,0.98841417,0.0003876603,0.007497782],"study_design_scores_gemma":[0.000038458627,0.000036946138,0.00009578064,0.000024688467,0.000039477087,0.00007263378,0.00010576259,0.041157555,0.0022533657,0.9474498,0.008708323,0.000017197515],"about_ca_topic_score_codex":0.0018076685,"about_ca_topic_score_gemma":0.0013482164,"teacher_disagreement_score":0.0061825216,"about_ca_system_score_codex":0.0011236201,"about_ca_system_score_gemma":0.0014948437,"threshold_uncertainty_score":0.020682573},"labels":[],"label_agreement":null},{"id":"W1497024685","doi":"10.1007/978-3-642-17572-5_39","title":"Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subadditivity; Submodular set function; Profit maximization; Approximation algorithm; Valuation (finance); Combinatorial auction; Mathematical optimization; Maximization; Mathematical economics; Mathematics; Combinatorics; Matroid; Profit (economics); Common value auction; Discrete mathematics; Computer science; Economics; Microeconomics; Statistics","score_opus":0.0586492496879416,"score_gpt":0.30566825171419787,"score_spread":0.24701900202625626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497024685","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.012251967,0.0018613328,0.97730595,0.0008887067,0.00016704979,0.00017889006,0.00016295367,0.00046898058,0.0067140553],"genre_scores_gemma":[0.28490704,0.0020185667,0.69850516,0.00060680485,0.0005123878,0.0010531909,0.00083750405,0.0005215598,0.011037761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974388,0.0011783197,0.00013418419,0.00042939352,0.00045635633,0.000362862],"domain_scores_gemma":[0.9849082,0.01283374,0.00056254497,0.0006899304,0.00059537066,0.00041025685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060570193,0.0026416592,0.004469269,0.0016250281,0.0013248383,0.004571407,0.0068924963,0.0052468497,0.0093740495],"category_scores_gemma":[0.024507008,0.0023632913,0.0023022473,0.004142243,0.0021860516,0.0077808383,0.003971689,0.005754919,0.001923516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048355167,0.0004491079,0.00077291235,0.00050560647,0.00016859891,0.00010598148,0.00020911157,0.81857115,0.0003797095,0.074723884,0.010158283,0.09347207],"study_design_scores_gemma":[0.00007472185,0.000026167247,0.00004721721,0.000028083374,0.000018546176,0.000025183163,0.000022439954,0.946879,0.00008176092,0.052305512,0.00048450913,0.0000067987826],"about_ca_topic_score_codex":0.0040971735,"about_ca_topic_score_gemma":0.0044776658,"teacher_disagreement_score":0.0093740495,"about_ca_system_score_codex":0.0031841465,"about_ca_system_score_gemma":0.0027871854,"threshold_uncertainty_score":0.032032967},"labels":[],"label_agreement":null},{"id":"W1497027223","doi":"10.1007/3-540-36573-7_2","title":"URN: Towards a New Standard for the Visual Description of Requirements","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":57,"is_retracted":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":"Computer science; Notation; Standardization; Unified Modeling Language; Programming language; Software engineering; Linguistics; Software; Operating system","score_opus":0.08166512243767958,"score_gpt":0.3303473013276184,"score_spread":0.24868217888993882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497027223","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.0006803907,0.0005390755,0.96725255,0.00070803193,0.00031857824,0.00024286917,0.0014951446,0.018805064,0.009958295],"genre_scores_gemma":[0.011969025,0.0018365328,0.94265825,0.0013860557,0.00017924198,0.0010547824,0.011889004,0.0097921705,0.019235035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98918915,0.003573048,0.0021520758,0.0007836993,0.0038680346,0.00043397112],"domain_scores_gemma":[0.989527,0.0037765282,0.00063847017,0.0031055587,0.0024605799,0.0004919137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012573926,0.0025309608,0.001993978,0.0038530456,0.0010028764,0.011024847,0.0049071237,0.0032401215,0.013679888],"category_scores_gemma":[0.022218056,0.0018773216,0.0022138224,0.00247162,0.0020379315,0.009523147,0.0052783713,0.006990937,0.015208762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021701831,0.00018833097,0.00039816412,0.0017971693,0.00007161157,0.00042607493,0.0020282469,0.00764847,0.01694812,0.4515698,0.13977717,0.37892988],"study_design_scores_gemma":[0.000073313,0.000058717833,0.00026935295,0.0010375547,0.000055193133,0.0006266097,0.00025736768,0.034109764,0.008880192,0.1204516,0.83407146,0.000108935805],"about_ca_topic_score_codex":0.0064107273,"about_ca_topic_score_gemma":0.0062859124,"teacher_disagreement_score":0.013679888,"about_ca_system_score_codex":0.0025055492,"about_ca_system_score_gemma":0.0040760604,"threshold_uncertainty_score":0.0664981},"labels":[],"label_agreement":null},{"id":"W1497071043","doi":"10.1007/11496915_5","title":"Disjoint Cycles: Integrality Gap, Hardness, and Approximation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Omega; Packing problems; Mathematics; Approximation algorithm; Vertex (graph theory); Conjecture; Upper and lower bounds; Binary logarithm; Undirected graph; Discrete mathematics; Graph; Physics","score_opus":0.030069022523276742,"score_gpt":0.2571625246057706,"score_spread":0.22709350208249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497071043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19266266,0.027590912,0.5028627,0.032229513,0.0012930335,0.0003054752,0.002226964,0.0011218082,0.2397069],"genre_scores_gemma":[0.84500396,0.01663111,0.09988015,0.0024067098,0.0030530347,0.00053112255,0.0027042325,0.00063372625,0.029155947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971517,0.0005049635,0.00012473788,0.0007889705,0.0010221109,0.00040752976],"domain_scores_gemma":[0.9859812,0.010807997,0.00065261044,0.0015851343,0.00045983001,0.00051325397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023267271,0.0016293739,0.0026086534,0.0021994077,0.0023365903,0.006385851,0.0046999687,0.0034218372,0.009929501],"category_scores_gemma":[0.017339585,0.0015812087,0.0020956595,0.0065391753,0.0060329675,0.020230092,0.005482017,0.010820448,0.0010082748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032531496,0.00017816729,0.0009915307,0.00056422653,0.00006028675,0.00010434812,0.00043737103,0.01724126,0.00074419327,0.9000229,0.018010966,0.06131934],"study_design_scores_gemma":[0.00002960055,0.0000142136905,0.00015589032,0.00005019966,0.00002674819,0.00011493216,0.00007662656,0.011801721,0.00042163947,0.983355,0.0039446587,0.000008858721],"about_ca_topic_score_codex":0.0014417074,"about_ca_topic_score_gemma":0.0011279989,"teacher_disagreement_score":0.009929501,"about_ca_system_score_codex":0.00423217,"about_ca_system_score_gemma":0.0017410393,"threshold_uncertainty_score":0.03321749},"labels":[],"label_agreement":null},{"id":"W1497142724","doi":"10.1007/11554578_5","title":"Formal Methods for Smartcard Security","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Ottawa","funders":"","keywords":"Smart card; Computer security; Flexibility (engineering); Computer science; Java Card; Interoperability; Confidentiality; Reliability (semiconductor); Operating system; Embedded system; Java; Java applet","score_opus":0.03230149285297806,"score_gpt":0.32626442338569583,"score_spread":0.29396293053271777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497142724","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.0013259419,0.0048134862,0.9598413,0.0010731628,0.00036554853,0.00006372134,0.000093514886,0.0010390395,0.031384356],"genre_scores_gemma":[0.16384637,0.009983233,0.7297074,0.00085236,0.000915357,0.00051664707,0.0005784002,0.0010001409,0.09260003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821943,0.0005754685,0.00013725083,0.00022839312,0.00072059705,0.000118810945],"domain_scores_gemma":[0.9983204,0.001015666,0.000064297994,0.00038974968,0.00017354533,0.000036334226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019108824,0.0013458957,0.00077784684,0.0012041889,0.00090948876,0.0027867681,0.0018815134,0.0016276985,0.016119406],"category_scores_gemma":[0.0035615258,0.0010725412,0.0012863151,0.00091581745,0.003887099,0.0057313116,0.0015832757,0.0040069995,0.004718918],"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.000015367645,0.000026886411,0.000046748697,0.00020923659,0.000012061271,0.000039535054,0.0002754983,0.0031021908,0.0009542079,0.9159336,0.00690987,0.07247484],"study_design_scores_gemma":[0.000019892277,0.000012645011,0.000034507793,0.00014302497,0.000010584434,0.00008191378,0.000044600267,0.00940888,0.0011712421,0.9101997,0.07885947,0.000013457952],"about_ca_topic_score_codex":0.0010581979,"about_ca_topic_score_gemma":0.0011511637,"teacher_disagreement_score":0.016119406,"about_ca_system_score_codex":0.0019449781,"about_ca_system_score_gemma":0.0010396463,"threshold_uncertainty_score":0.05392474},"labels":[],"label_agreement":null},{"id":"W1497193031","doi":"10.1007/11538363_34","title":"Feasible Proofs of Matrix Properties with Csanky’s Algorithm","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Mathematical proof; Algorithm; Matrix (chemical analysis); Mathematics","score_opus":0.014853706494562842,"score_gpt":0.23270092467214054,"score_spread":0.2178472181775777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497193031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023027804,0.00074093894,0.91068643,0.002102754,0.00028322605,0.0001816977,0.00043829987,0.0011352805,0.061403565],"genre_scores_gemma":[0.5049774,0.0014487338,0.46554714,0.0008596317,0.00062552,0.0008868677,0.001044855,0.0011683222,0.023441521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495345,0.0017203182,0.00027107244,0.0006542338,0.0019427235,0.00045831574],"domain_scores_gemma":[0.98371625,0.011774989,0.0005865184,0.0021331888,0.0013759143,0.00041305114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032460745,0.0018388202,0.0013673316,0.0018212821,0.0026582617,0.005491105,0.0035238941,0.0019386858,0.0148902815],"category_scores_gemma":[0.015301324,0.0018061376,0.0024461162,0.003524336,0.004160436,0.011506908,0.0051112385,0.0069913142,0.0035837914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002716305,0.000082134306,0.00012451447,0.00025424728,0.000047052592,0.00008065314,0.0002408754,0.0066434103,0.0024718104,0.9555794,0.007189699,0.02701458],"study_design_scores_gemma":[0.00012002004,0.00003071738,0.00006307559,0.00004211497,0.000028205572,0.000052758205,0.000030690437,0.019263485,0.003004888,0.96959966,0.007736926,0.000027390703],"about_ca_topic_score_codex":0.0011766539,"about_ca_topic_score_gemma":0.0013838889,"teacher_disagreement_score":0.0148902815,"about_ca_system_score_codex":0.0023424793,"about_ca_system_score_gemma":0.002579714,"threshold_uncertainty_score":0.049812973},"labels":[],"label_agreement":null},{"id":"W1497375868","doi":"10.1007/3-540-45526-4_3","title":"Analysis of Reactive Systems with n Timers","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Automaton; Representation (politics); Simple (philosophy); ENCODE; Theoretical computer science; Parametric statistics; Process (computing); Algorithm; Cellular automaton; Programming language; Mathematics","score_opus":0.022080915954793487,"score_gpt":0.26910444129056793,"score_spread":0.24702352533577443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497375868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08922973,0.00023971009,0.90048844,0.00013689515,0.000042396736,0.00007121689,0.000059486178,0.00049455726,0.009237582],"genre_scores_gemma":[0.9056376,0.00018369714,0.08636743,0.000047495265,0.000043826432,0.000104857994,0.000095453164,0.00018386416,0.00733574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887294,0.00030856894,0.000058953898,0.00020853228,0.00041229112,0.00013881008],"domain_scores_gemma":[0.9971111,0.0020365433,0.00029224384,0.0002509619,0.00022827665,0.0000808509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018518877,0.00073099916,0.0006295441,0.0008465225,0.0005836947,0.0012107106,0.0015564486,0.00053918146,0.0031513642],"category_scores_gemma":[0.0046452377,0.0004979952,0.0010983109,0.00055308116,0.0017769269,0.0015655153,0.0010366895,0.00088205107,0.00029286646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003986314,0.0000709772,0.0019042293,0.00019630129,0.00008082261,0.00034564274,0.00029918505,0.705351,0.020955162,0.23148061,0.0006485467,0.038268868],"study_design_scores_gemma":[0.000024541605,0.000043910608,0.0003802777,0.000011998758,0.000024987057,0.000041139843,0.00003186763,0.93372375,0.0038808337,0.06095171,0.0008717112,0.000013281909],"about_ca_topic_score_codex":0.0028350549,"about_ca_topic_score_gemma":0.0026848195,"teacher_disagreement_score":0.0031513642,"about_ca_system_score_codex":0.0011310289,"about_ca_system_score_gemma":0.0010724554,"threshold_uncertainty_score":0.010542333},"labels":[],"label_agreement":null},{"id":"W1497378850","doi":"10.1007/11730637_12","title":"Optimality Zone Algorithms for Hybrid Systems: Efficient Algorithms for Optimal Location and Control Computation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Control Systems Optimization","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":"McGill University","funders":"","keywords":"Algorithm; Computation; Optimal control; Computer science; Schedule; State (computer science); Sequence (biology); Computational complexity theory; Mathematical optimization; Mathematics","score_opus":0.010781263502634966,"score_gpt":0.23592463029878533,"score_spread":0.22514336679615035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497378850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001489565,0.00031855988,0.9965533,0.000051529292,0.00003179336,0.000011071893,0.000028297562,0.00018471203,0.0013312506],"genre_scores_gemma":[0.19029954,0.0010945303,0.8001043,0.000083784806,0.00011944277,0.00027189986,0.00023507938,0.00040470427,0.0073866253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963236,0.00012082856,0.000018365536,0.000056249264,0.00013656473,0.00003563],"domain_scores_gemma":[0.9993605,0.0004075689,0.00003755461,0.000078331694,0.000098161356,0.000017967815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960614,0.0011749252,0.0012701373,0.00070981274,0.00046298053,0.0013971486,0.0014414755,0.001029592,0.0059559513],"category_scores_gemma":[0.0030168635,0.0008124413,0.0006117988,0.0012726882,0.0010355962,0.0022785931,0.0020109909,0.0021930637,0.0015588491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021473262,0.000047665937,0.0002267105,0.00018934262,0.00004625937,0.000019522531,0.00013443302,0.59706837,0.0023432702,0.20444725,0.008557516,0.18670502],"study_design_scores_gemma":[0.000025439627,0.000014647266,0.000050420593,0.000010821992,0.000007725658,0.000009752272,0.000012010975,0.93312114,0.00070255436,0.0634685,0.002568754,0.00000815373],"about_ca_topic_score_codex":0.0026945202,"about_ca_topic_score_gemma":0.0023807224,"teacher_disagreement_score":0.0059559513,"about_ca_system_score_codex":0.00078898843,"about_ca_system_score_gemma":0.000752873,"threshold_uncertainty_score":0.0199247},"labels":[],"label_agreement":null},{"id":"W1497380692","doi":"10.1007/3-540-44886-1_13","title":"Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Probabilistic logic; Computer science; Boolean satisfiability problem; Smoothing; Scheduling (production processes); Local search (optimization); Mathematical optimization; Job shop scheduling; Extension (predicate logic); Scaling; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Schedule","score_opus":0.015047019503925578,"score_gpt":0.24949310952874643,"score_spread":0.23444609002482084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497380692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013574601,0.00053851627,0.9799595,0.00022476848,0.00006608225,0.000067193476,0.000070217706,0.0013140363,0.004185123],"genre_scores_gemma":[0.31711993,0.000517822,0.67322886,0.00026810862,0.00015653425,0.000402837,0.00041768033,0.00091710326,0.0069711576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998505,0.00067385996,0.00007888434,0.0003005405,0.00032648293,0.00011523295],"domain_scores_gemma":[0.9957041,0.0030370383,0.00018687743,0.00073361595,0.00021957974,0.00011884284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029618219,0.00095811376,0.002400575,0.00155739,0.0010142854,0.0013176756,0.0034658834,0.0014849522,0.0068838233],"category_scores_gemma":[0.012383749,0.0011661007,0.0014511807,0.0032774657,0.0016241217,0.0042644567,0.0034610874,0.0028406964,0.0010122808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002617897,0.00015800116,0.00045907267,0.0002838151,0.000097671335,0.000051901607,0.00023157522,0.61589515,0.0020871847,0.14009114,0.008605467,0.23177719],"study_design_scores_gemma":[0.000024238729,0.00002105835,0.000044506403,0.00000884402,0.00001250612,0.000011438323,0.000011059085,0.92600846,0.00038017714,0.07251589,0.0009547225,0.000007101865],"about_ca_topic_score_codex":0.002977087,"about_ca_topic_score_gemma":0.004927748,"teacher_disagreement_score":0.0068838233,"about_ca_system_score_codex":0.0013063506,"about_ca_system_score_gemma":0.0010894233,"threshold_uncertainty_score":0.023028731},"labels":[],"label_agreement":null},{"id":"W1497384273","doi":"10.1007/11943952_71","title":"An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Carleton University","funders":"","keywords":"Computer science; Software deployment; Wireless sensor network; Redundancy (engineering); Scheme (mathematics); Distributed computing; Real-time computing; Computer network","score_opus":0.007142600731081409,"score_gpt":0.21966780724506943,"score_spread":0.212525206513988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497384273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06326447,0.00090317946,0.9313801,0.00012900186,0.00015660623,0.00007264033,0.000057240242,0.0015690558,0.0024676311],"genre_scores_gemma":[0.81395316,0.00037192664,0.1807636,0.00009090743,0.00010542479,0.00009519778,0.00014953391,0.000081105194,0.004389124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982256,0.0000298061,0.00001213128,0.000033515254,0.00007669845,0.000025245836],"domain_scores_gemma":[0.99965024,0.00008455302,0.000031327134,0.00010929437,0.00009911634,0.000025474948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026399636,0.00039058097,0.00052177155,0.00044346714,0.0003389557,0.00028157546,0.0011823119,0.00041662395,0.00096577976],"category_scores_gemma":[0.0005855003,0.00021898371,0.00023745839,0.00045464607,0.00020292387,0.0008488711,0.00074311165,0.00039837274,0.00024659865],"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.0005460772,0.00026258567,0.0008899524,0.00016328045,0.00009281762,0.00014633,0.000154982,0.12252415,0.13780111,0.007246749,0.0055218656,0.72465014],"study_design_scores_gemma":[0.000041204246,0.00034041778,0.0012219219,0.000009375091,0.000055100318,0.0003595395,0.000024819628,0.97030556,0.021738442,0.002279797,0.0036051255,0.000018734427],"about_ca_topic_score_codex":0.00082931935,"about_ca_topic_score_gemma":0.0015486395,"teacher_disagreement_score":0.0011823119,"about_ca_system_score_codex":0.00030002653,"about_ca_system_score_gemma":0.00021565972,"threshold_uncertainty_score":0.0032308102},"labels":[],"label_agreement":null},{"id":"W1497436182","doi":"10.1007/978-3-642-02809-0_3","title":"3D Body Scanning’s Contribution to the Use of Apparel as an Identity Construction Tool","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Clothing; Identity (music); Human–computer interaction; Engineering drawing; Aesthetics; Art; History; Engineering; Archaeology","score_opus":0.022845154853746656,"score_gpt":0.27305479232251406,"score_spread":0.2502096374687674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497436182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06712269,0.0025220474,0.72924125,0.0011559902,0.0004414308,0.00007598268,0.000094735464,0.0010960095,0.19824983],"genre_scores_gemma":[0.4921852,0.0021708005,0.4572419,0.0002637138,0.00014732576,0.000057193924,0.00011170104,0.00054307265,0.0472791],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9993918,0.00022666155,0.000015123534,0.000084022635,0.00022347736,0.00005887746],"domain_scores_gemma":[0.99889296,0.0006374409,0.000031554362,0.00029538156,0.00011214189,0.000030477062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698086,0.00049074483,0.00034193404,0.0012497421,0.0007751738,0.0027234035,0.001308817,0.0011913929,0.008432328],"category_scores_gemma":[0.0021475398,0.00068566087,0.0004551883,0.0011457392,0.003743821,0.0021719176,0.0027599116,0.0010264721,0.0015278588],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014479301,0.00006716601,0.0023375074,0.00034154634,0.00002717256,0.0013010046,0.009041262,0.005815249,0.043316606,0.2518192,0.0066735195,0.679115],"study_design_scores_gemma":[0.000028175502,0.0002492485,0.009077746,0.00058594096,0.00008612951,0.0119058965,0.0055743577,0.14220446,0.110238135,0.200631,0.51914996,0.00026892807],"about_ca_topic_score_codex":0.0015500601,"about_ca_topic_score_gemma":0.0024710994,"teacher_disagreement_score":0.008432328,"about_ca_system_score_codex":0.00032859712,"about_ca_system_score_gemma":0.00051991036,"threshold_uncertainty_score":0.028208971},"labels":[],"label_agreement":null},{"id":"W1497440123","doi":"10.1007/978-3-540-39890-5_24","title":"On the Recognition of General Partition Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Frequency partition of a graph; Discrete mathematics; Partition (number theory); Vertex (graph theory); Planar graph; Outerplanar graph; Pathwidth; Graph; Line graph; Graph power","score_opus":0.035032273226030246,"score_gpt":0.2766525167281121,"score_spread":0.24162024350208183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497440123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07881501,0.0042022625,0.8217508,0.0016054587,0.00051349035,0.00017188294,0.0011028775,0.0027947677,0.08904347],"genre_scores_gemma":[0.42955536,0.0058790934,0.47643855,0.0010121937,0.0006324845,0.00027563586,0.008402675,0.001494865,0.076308995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942577,0.00010722087,0.000036822883,0.00019017963,0.0001395719,0.00010058684],"domain_scores_gemma":[0.99875534,0.0005091218,0.00008275763,0.00039861567,0.00015982421,0.000094447576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616998,0.0008866987,0.0011925204,0.0012281068,0.00092135725,0.0032472026,0.0017706385,0.001268904,0.011056992],"category_scores_gemma":[0.0026430124,0.00064320175,0.0008823949,0.002508535,0.0016368056,0.0065142447,0.0026244586,0.0021293296,0.0036233927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021612407,0.00008573062,0.0010492738,0.00035305775,0.000033117667,0.00022922584,0.0007702501,0.018635059,0.008390569,0.534015,0.04118969,0.3950329],"study_design_scores_gemma":[0.000013155769,0.00003260568,0.0007087921,0.000071541246,0.000019279687,0.0003616664,0.0002546464,0.04891134,0.0029298307,0.91264224,0.034031373,0.00002344185],"about_ca_topic_score_codex":0.001882606,"about_ca_topic_score_gemma":0.0024896304,"teacher_disagreement_score":0.011056992,"about_ca_system_score_codex":0.0008147458,"about_ca_system_score_gemma":0.00045389085,"threshold_uncertainty_score":0.03698933},"labels":[],"label_agreement":null},{"id":"W1497522640","doi":"10.1007/3-540-44679-6_16","title":"Packing Two Disks into a Polygonal Environment","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"McGill University; Carleton University","funders":"","keywords":"Polygon (computer graphics); Computation; Computer science; Simple polygon; RADIUS; Combinatorics; Algebraic number; Randomized algorithm; Binary logarithm; Tree (set theory); Running time; Simple (philosophy); Time complexity; Algorithm; Mathematics; Regular polygon; Geometry","score_opus":0.016160683674990847,"score_gpt":0.2500689776211862,"score_spread":0.23390829394619533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497522640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736084,0.0008143275,0.7146469,0.00039113447,0.00037447416,0.00023269933,0.0003581835,0.0018341311,0.063987285],"genre_scores_gemma":[0.606982,0.0012278935,0.36423737,0.00009122807,0.00010111981,0.00021023005,0.0006643363,0.0005674295,0.025918381],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995598,0.000069195754,0.000032770968,0.00009503616,0.0001489885,0.00009416044],"domain_scores_gemma":[0.99956924,0.00014207499,0.000046794292,0.00015157086,0.000031579522,0.000058653797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018031283,0.0009897354,0.0011593242,0.0009790661,0.0012118673,0.0015681335,0.0015043226,0.00093064894,0.008798691],"category_scores_gemma":[0.0010294714,0.0009222425,0.00059382105,0.002407931,0.000923276,0.0019909022,0.00391229,0.0011143527,0.0025108866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016807447,0.00053201173,0.0013732695,0.00092366105,0.00011125993,0.0030810349,0.0015353671,0.3225907,0.06829731,0.22354983,0.013315413,0.36300942],"study_design_scores_gemma":[0.0004011103,0.00094847387,0.0009649172,0.00017087409,0.000098518736,0.0016979959,0.0009584235,0.5818891,0.045841567,0.28376126,0.08317238,0.00009533095],"about_ca_topic_score_codex":0.00062733603,"about_ca_topic_score_gemma":0.00059088867,"teacher_disagreement_score":0.008798691,"about_ca_system_score_codex":0.0003130444,"about_ca_system_score_gemma":0.00028194184,"threshold_uncertainty_score":0.029434562},"labels":[],"label_agreement":null},{"id":"W1497551976","doi":"10.1007/978-3-540-70521-5_11","title":"Effect of Friction and Material Compressibility on Deformable Modeling of Human Lung","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Elasticity and Material Modeling","field":"Engineering","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":"Princess Margaret Cancer Centre","funders":"","keywords":"Hyperelastic material; Compressibility; Poisson distribution; Poisson's ratio; Materials science; Mechanics; Human lung; Finite element method; Friction coefficient; Mathematics; Physics; Composite material; Thermodynamics; Lung; Statistics; Medicine","score_opus":0.010671650819246568,"score_gpt":0.22396340383714633,"score_spread":0.21329175301789977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497551976","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.8137058,0.0063110013,0.16581441,0.00083493436,0.00034270657,0.000071186056,0.0003967979,0.00053923484,0.011983894],"genre_scores_gemma":[0.99180216,0.0008025468,0.004456963,0.00004595912,0.000036518173,0.000009821518,0.00005988406,0.00008781617,0.0026984254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980134,0.000065645385,0.000013954215,0.000032458232,0.0000602157,0.000026426762],"domain_scores_gemma":[0.99926263,0.0005840021,0.00004357942,0.000048153815,0.00003232728,0.000029380783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042973846,0.00052425143,0.0006084238,0.00036708266,0.00027454417,0.00068828365,0.00054135127,0.0012009513,0.001864974],"category_scores_gemma":[0.0028499488,0.0003685155,0.0005701347,0.00027553827,0.000513263,0.0006651242,0.00047612295,0.0004591614,0.00024855693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050522137,0.000059769474,0.0018647519,0.000121426805,0.00003976,0.0006135589,0.00012068666,0.9268269,0.04093671,0.0023119648,0.0005245195,0.026074693],"study_design_scores_gemma":[0.000016529562,0.00008564664,0.0019261476,0.000015861844,0.000034369186,0.00027717033,0.000017852499,0.9862027,0.010200428,0.0006065608,0.00059735944,0.000019365347],"about_ca_topic_score_codex":0.0032401478,"about_ca_topic_score_gemma":0.00215951,"teacher_disagreement_score":0.0032401478,"about_ca_system_score_codex":0.00035071818,"about_ca_system_score_gemma":0.00026708707,"threshold_uncertainty_score":0.006442547},"labels":[],"label_agreement":null},{"id":"W1497599822","doi":"10.1007/11560548_22","title":"Identification and Counter Abstraction for Full Virtual Symmetry","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Abstraction; Reduction (mathematics); Symmetry (geometry); Class (philosophy); Abstraction model checking; Point (geometry); Computer science; Identification (biology); Exponential function; State (computer science); Model checking; Theoretical computer science; Theoretical physics; Algebra over a field; Mathematics; Pure mathematics; Algorithm; Artificial intelligence; Physics; Geometry; Mathematical analysis","score_opus":0.020831365677488632,"score_gpt":0.2859631250300992,"score_spread":0.2651317593526106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497599822","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.024052752,0.000254613,0.92000407,0.00070762535,0.00059208047,0.00017839878,0.00015874274,0.0025656016,0.051486097],"genre_scores_gemma":[0.7830432,0.00028402067,0.18849732,0.0005519706,0.00021392277,0.00037590115,0.00029915056,0.0010410517,0.025693458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963276,0.0009766971,0.00025634564,0.00060387823,0.0011945397,0.0006410405],"domain_scores_gemma":[0.9953981,0.0015703678,0.0001923155,0.0022687607,0.00042003085,0.00015039078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031021792,0.0011119896,0.0014190503,0.0014501846,0.0019525236,0.0036523044,0.0024957268,0.0019172173,0.013799245],"category_scores_gemma":[0.009734211,0.00089035736,0.0021178296,0.001116772,0.004895602,0.010193811,0.0069322838,0.0041319192,0.0025765905],"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.000091043046,0.000022496772,0.000072040144,0.000049832837,0.00000879903,0.000056455243,0.0001245869,0.0025923857,0.0013240144,0.9792716,0.001753692,0.01463297],"study_design_scores_gemma":[0.000030259549,0.000027467708,0.000039900842,0.000026861348,0.000025182215,0.00009752963,0.000042530526,0.030743826,0.0053640455,0.9570685,0.006506473,0.000027359238],"about_ca_topic_score_codex":0.00055015204,"about_ca_topic_score_gemma":0.0004123895,"teacher_disagreement_score":0.013799245,"about_ca_system_score_codex":0.001336037,"about_ca_system_score_gemma":0.002087433,"threshold_uncertainty_score":0.046163082},"labels":[],"label_agreement":null},{"id":"W1497622413","doi":"10.1007/11774303_106","title":"On the Definition and Management of Cultural Groups of e-Learners","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"International Student and Expatriate Challenges","field":"Social Sciences","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":"Université de Montréal","funders":"","keywords":"Computer science; Session (web analytics); E learning; Knowledge management; Group (periodic table); Cultural issues; Multimedia; Mathematics education; Cultural diversity; Human–computer interaction; World Wide Web; Psychology; The Internet; Sociology; Anthropology","score_opus":0.03711334921996683,"score_gpt":0.2877015294165297,"score_spread":0.25058818019656287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497622413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06505002,0.009061449,0.43928963,0.049577475,0.0010543441,0.0006107077,0.00026904896,0.00019897752,0.43488833],"genre_scores_gemma":[0.66767853,0.0049863607,0.25851715,0.002284891,0.00030066926,0.00070850435,0.0003437217,0.00010168508,0.06507848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626285,0.002231693,0.0002363103,0.00036928273,0.00060873025,0.00029107273],"domain_scores_gemma":[0.99551857,0.0024716475,0.00037950545,0.0005518916,0.0006036762,0.0004746631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049611456,0.00053723005,0.00046471466,0.0013904169,0.0033657888,0.007005862,0.0026314561,0.002628618,0.0044826567],"category_scores_gemma":[0.008212614,0.00041551617,0.00048675574,0.0022976461,0.012474147,0.0117428405,0.005845035,0.0030826486,0.0006831107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013340682,0.000040793962,0.0010749884,0.00005790454,0.0000046578148,0.00010157312,0.0131482,0.0005864994,0.00024694946,0.93626046,0.0041935495,0.044271044],"study_design_scores_gemma":[0.000012976931,0.000048194186,0.0022176316,0.00037251582,0.000012388592,0.00034746673,0.026062008,0.004033057,0.0006713603,0.827493,0.13870338,0.000025912921],"about_ca_topic_score_codex":0.007699734,"about_ca_topic_score_gemma":0.008568836,"teacher_disagreement_score":0.007699734,"about_ca_system_score_codex":0.003406646,"about_ca_system_score_gemma":0.0040826686,"threshold_uncertainty_score":0.026237369},"labels":[],"label_agreement":null},{"id":"W1497672938","doi":"10.1007/978-3-642-34123-6_8","title":"Improving the Portability and Performance of jViz.RNA – A Dynamic RNA Visualization Software","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Multithreading; Computer science; Software portability; Visualization; Code (set theory); Software; Algorithm; Parallel computing; Theoretical computer science; Artificial intelligence; Programming language; Thread (computing); Set (abstract data type)","score_opus":0.00786406908206231,"score_gpt":0.22891783038605387,"score_spread":0.22105376130399157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497672938","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054747712,0.0009385914,0.6368128,0.0005874552,0.00050201867,0.00016033319,0.0010793518,0.2921352,0.013036523],"genre_scores_gemma":[0.2901504,0.0007344624,0.6044743,0.0004242519,0.00020913093,0.00025830232,0.0065329364,0.07688631,0.020329984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811894,0.00031657377,0.0001505501,0.00033992753,0.0008475352,0.00022651127],"domain_scores_gemma":[0.995146,0.0021176736,0.00019230915,0.0013269939,0.0010271743,0.00018980422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023992439,0.0016609337,0.0007618676,0.0013140485,0.00055673375,0.002139013,0.003365915,0.0010918962,0.0141731715],"category_scores_gemma":[0.009396033,0.0012282828,0.0010888336,0.0009906552,0.0005114165,0.0037267474,0.0020188515,0.002778049,0.0060831043],"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.0017768153,0.00044926727,0.0029919362,0.00047651547,0.00023809304,0.00028017507,0.00042077355,0.027691916,0.17624947,0.0153004695,0.08378215,0.6903425],"study_design_scores_gemma":[0.0005163344,0.00029640622,0.0030748476,0.00012679707,0.00023228413,0.00040681165,0.00006113469,0.48495007,0.39658567,0.012448974,0.10101278,0.00028793272],"about_ca_topic_score_codex":0.0030203278,"about_ca_topic_score_gemma":0.0023478733,"teacher_disagreement_score":0.0141731715,"about_ca_system_score_codex":0.0005947109,"about_ca_system_score_gemma":0.000763289,"threshold_uncertainty_score":0.047414005},"labels":[],"label_agreement":null},{"id":"W1497689567","doi":"10.1007/978-3-540-45231-7_29","title":"Refined Shared Nearest Neighbors Graph for Combining Multiple Data Clusterings","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Graph; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.0592828658569979,"score_gpt":0.30986915558395806,"score_spread":0.2505862897269602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497689567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00455432,0.0001721416,0.9940122,0.000053053314,0.00003227164,0.000049909468,0.00012845412,0.00052692735,0.00047073804],"genre_scores_gemma":[0.11971974,0.0002814393,0.87577516,0.000095468225,0.00006170974,0.00020376248,0.0012091711,0.00029310418,0.0023604715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961541,0.0013121892,0.00017234893,0.0007838504,0.0014303137,0.00014712207],"domain_scores_gemma":[0.9943453,0.0018170405,0.00029749825,0.0021959327,0.0011814781,0.00016280089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023970169,0.0012964063,0.002492103,0.0040811235,0.0013178977,0.0018427961,0.004517547,0.002029028,0.0026716855],"category_scores_gemma":[0.010299712,0.0011724164,0.001838948,0.0060525397,0.0011374973,0.004142532,0.0040934,0.0015231234,0.0011532789],"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.00047870332,0.00017174076,0.0014666975,0.0003617087,0.00039190063,0.00030930646,0.00047793242,0.40619913,0.009096521,0.057398513,0.0083748745,0.515273],"study_design_scores_gemma":[0.000027903368,0.000052191095,0.0003185902,0.000017029193,0.00006142012,0.00009400482,0.00008347784,0.9345092,0.0022499806,0.059597306,0.0029608945,0.000028019793],"about_ca_topic_score_codex":0.008318147,"about_ca_topic_score_gemma":0.013786707,"teacher_disagreement_score":0.008318147,"about_ca_system_score_codex":0.0012370304,"about_ca_system_score_gemma":0.0013472218,"threshold_uncertainty_score":0.016539454},"labels":[],"label_agreement":null},{"id":"W1497695402","doi":"10.1007/11551188_34","title":"Similarity Searching in Image Retrieval with Statistical Distance Measures and Supervised Learning","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Bhattacharyya distance; Mahalanobis distance; Pattern recognition (psychology); Computer science; Artificial intelligence; Image retrieval; Feature vector; Curse of dimensionality; Principal component analysis; Classifier (UML); Distance measures; Euclidean distance; Data mining; Image (mathematics)","score_opus":0.018551748846163577,"score_gpt":0.2619269106427647,"score_spread":0.24337516179660112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497695402","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.006364692,0.0015936681,0.99076205,0.00009133229,0.000034113156,0.000021593605,0.000020160707,0.000182847,0.0009294064],"genre_scores_gemma":[0.25164083,0.0026452914,0.73893356,0.00008364497,0.00030925422,0.00017614197,0.00024924238,0.00017516184,0.0057868944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824524,0.00062840624,0.00013572494,0.00025063253,0.00068270747,0.000057305366],"domain_scores_gemma":[0.9976761,0.0015017156,0.00016814897,0.0003269388,0.0002922851,0.000034818142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016624343,0.00039541512,0.0017936844,0.0014911742,0.00047511372,0.0013624304,0.001805811,0.0011895887,0.001757219],"category_scores_gemma":[0.007062922,0.00048260676,0.0008857513,0.003335022,0.0012575693,0.0040826746,0.0013148567,0.0009987234,0.0007293987],"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.00016785401,0.00019038752,0.0008787057,0.0006724981,0.0001161444,0.00011627085,0.0002000543,0.15472636,0.008959269,0.2176232,0.0059043015,0.61044496],"study_design_scores_gemma":[0.00001082569,0.000075212214,0.00039809276,0.00001756335,0.000020185973,0.00018182663,0.00003109545,0.88793993,0.0032655732,0.10585642,0.0021833621,0.00002005549],"about_ca_topic_score_codex":0.0011118954,"about_ca_topic_score_gemma":0.001088781,"teacher_disagreement_score":0.001805811,"about_ca_system_score_codex":0.0006934379,"about_ca_system_score_gemma":0.000591263,"threshold_uncertainty_score":0.008791864},"labels":[],"label_agreement":null},{"id":"W1497702967","doi":"10.1007/978-3-642-01818-3_12","title":"Context Dependent Movie Recommendations Using a Hierarchical Bayesian Model","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Context (archaeology); Set (abstract data type); Collaborative filtering; Recommender system; Preference; Context model; Bayesian probability; Maximization; Machine learning; Information retrieval; Artificial intelligence; Data mining; Mathematics; Mathematical optimization; Statistics","score_opus":0.037864008386288166,"score_gpt":0.2856890370723043,"score_spread":0.24782502868601614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497702967","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.019802175,0.0014941393,0.9734396,0.0007264347,0.00011938459,0.00012945487,0.00057678914,0.0008530994,0.0028589128],"genre_scores_gemma":[0.55592436,0.0022812877,0.42111242,0.00053432665,0.0005436056,0.0004703736,0.0017349429,0.00027659815,0.01712209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974349,0.0010616721,0.00015443416,0.00059079373,0.00057123613,0.00018702722],"domain_scores_gemma":[0.99272525,0.005790525,0.00021421337,0.0004899539,0.0006292708,0.00015078322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037966825,0.0009215052,0.0032327087,0.002001757,0.0012343463,0.0023315628,0.0049025714,0.0033358603,0.0062022177],"category_scores_gemma":[0.012977464,0.0024675885,0.0023395636,0.0031183537,0.0009473107,0.0043830066,0.001415355,0.0037200947,0.0023427566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057725736,0.00035731294,0.0024126389,0.0002870348,0.000553661,0.00024291544,0.00028294703,0.7785637,0.0015499371,0.05082776,0.008775399,0.15556942],"study_design_scores_gemma":[0.000027671766,0.000020399695,0.00022709431,0.000012807129,0.00004810744,0.00003412939,0.0000072410744,0.9894957,0.00012483096,0.009557933,0.00042343573,0.000020648195],"about_ca_topic_score_codex":0.03777109,"about_ca_topic_score_gemma":0.058499433,"teacher_disagreement_score":0.03777109,"about_ca_system_score_codex":0.0017725697,"about_ca_system_score_gemma":0.0017211739,"threshold_uncertainty_score":0.07510251},"labels":[],"label_agreement":null},{"id":"W1497703314","doi":"10.1007/978-3-642-14075-4_21","title":"On Multi-resolution Point-Based Haptic Rendering of Suture","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Haptic technology; Computer science; Rendering (computer graphics); Computer vision; Simulation; Artificial intelligence; Computer graphics (images)","score_opus":0.011807084890789268,"score_gpt":0.2390516728721768,"score_spread":0.22724458798138752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497703314","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.009826169,0.00093243207,0.97942674,0.00010537246,0.00017474042,0.000056185294,0.00007478585,0.0015354581,0.007868015],"genre_scores_gemma":[0.2533246,0.0031588562,0.7211097,0.00018174219,0.00022447044,0.00010132411,0.00024701134,0.0007067915,0.020945523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959964,0.00007085194,0.000017588469,0.000031286498,0.0002552586,0.000025392577],"domain_scores_gemma":[0.9993279,0.0004337664,0.000030013041,0.00011002506,0.00007724607,0.000021158905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004893274,0.0008700267,0.0007839294,0.0005558774,0.00026705343,0.0016497798,0.0013200602,0.0011901746,0.013903439],"category_scores_gemma":[0.0015560782,0.00059701834,0.0008134623,0.0006980158,0.0005298192,0.0014412303,0.0013019801,0.0012589571,0.002059355],"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.0006378365,0.000111720525,0.00027469106,0.0009817291,0.0000744415,0.0010327892,0.00077224575,0.14815907,0.34256804,0.05821886,0.008963541,0.43820503],"study_design_scores_gemma":[0.00005286289,0.00012584694,0.00034240115,0.00009033677,0.00002401025,0.0010942984,0.00007118176,0.9159257,0.050468825,0.012217379,0.019522458,0.00006474333],"about_ca_topic_score_codex":0.0006800315,"about_ca_topic_score_gemma":0.00062717585,"teacher_disagreement_score":0.013903439,"about_ca_system_score_codex":0.00026406432,"about_ca_system_score_gemma":0.00018042065,"threshold_uncertainty_score":0.04651165},"labels":[],"label_agreement":null},{"id":"W1497747243","doi":"10.1007/3-540-45397-0_6","title":"Object Orientation in Hierarchical Predicate Transition Nets","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Great Plains College","funders":"","keywords":"Computer science; Object-orientation; Encapsulation (networking); Predicate (mathematical logic); Object-oriented programming; Programming language; Object model; Theoretical computer science; Artificial intelligence; Computer security","score_opus":0.02199916380918082,"score_gpt":0.28025992642407915,"score_spread":0.25826076261489833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497747243","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.031165868,0.0006055147,0.94355386,0.0001564893,0.00008754319,0.00006656512,0.000113499525,0.0009314771,0.023319118],"genre_scores_gemma":[0.56239295,0.0018073323,0.40614846,0.00015530756,0.000107999964,0.00023026021,0.00068297476,0.00043988426,0.028034901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962246,0.000078687845,0.000031187654,0.00007324854,0.00011848967,0.00007589633],"domain_scores_gemma":[0.99939036,0.0003318962,0.000060326347,0.000100126286,0.000068950714,0.00004836986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068350666,0.0003388775,0.00041694538,0.000584128,0.0006682691,0.0016934976,0.0006182772,0.0005299248,0.0035588886],"category_scores_gemma":[0.0013305056,0.0005542421,0.00062053825,0.0010100073,0.0014558323,0.0032287303,0.00091491215,0.0011566922,0.0007756175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055424443,0.000033463413,0.0004427121,0.00008181724,0.000007130678,0.0001293513,0.00027767883,0.01987291,0.002909823,0.9158153,0.0012603914,0.059113834],"study_design_scores_gemma":[0.000020697436,0.000035899466,0.00030171324,0.000040583014,0.000025298448,0.00009064925,0.00009552744,0.073214106,0.005326904,0.9055457,0.015286825,0.000016012174],"about_ca_topic_score_codex":0.0029612065,"about_ca_topic_score_gemma":0.0031029668,"teacher_disagreement_score":0.0035588886,"about_ca_system_score_codex":0.0010713689,"about_ca_system_score_gemma":0.0009885832,"threshold_uncertainty_score":0.011905611},"labels":[],"label_agreement":null},{"id":"W1497767639","doi":"10.1007/bfb0027513","title":"Database issues for a veterinary medical expert system","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Knowledge base; Expert system; Database; Computer science; Relational database management system; Relational database; Fuzzy logic; Base (topology); Veterinary medicine; Medicine; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.03937850339527329,"score_gpt":0.30223100240054335,"score_spread":0.2628524990052701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497767639","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.123035416,0.016308814,0.6812763,0.055906694,0.0022652547,0.00063794496,0.0019610361,0.0029037418,0.11570476],"genre_scores_gemma":[0.47164223,0.0071808454,0.44438303,0.0037476073,0.001568669,0.00022699095,0.002234086,0.0006421822,0.06837439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811375,0.000519226,0.00025358738,0.00025157098,0.0007578031,0.00010410639],"domain_scores_gemma":[0.9924508,0.005090412,0.000168846,0.0007259646,0.0012965561,0.00026743292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038091305,0.00025901597,0.0005991291,0.0009126329,0.0018939449,0.007863504,0.0017466946,0.0032623443,0.014628573],"category_scores_gemma":[0.012322141,0.0007287331,0.0006476105,0.0014960897,0.00069818244,0.00624538,0.0013963492,0.0019262552,0.001881782],"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.0008500153,0.00035836588,0.0060375016,0.0009936236,0.00009226622,0.0045753634,0.0025640156,0.026621781,0.011909315,0.35267448,0.10525936,0.48806396],"study_design_scores_gemma":[0.00024554582,0.00038647852,0.004977864,0.0005190081,0.000247812,0.006819641,0.002381233,0.20637798,0.012260203,0.22796415,0.5376896,0.00013034909],"about_ca_topic_score_codex":0.0055316933,"about_ca_topic_score_gemma":0.0057273703,"teacher_disagreement_score":0.014628573,"about_ca_system_score_codex":0.0012433728,"about_ca_system_score_gemma":0.0013046651,"threshold_uncertainty_score":0.04893738},"labels":[],"label_agreement":null},{"id":"W1497909917","doi":"10.1007/978-3-540-45227-0_59","title":"Efficient Indexing of High Dimensional Normalized Histograms","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Search engine indexing; Histogram; Computer science; Nearest neighbor search; R-tree; Similarity (geometry); Tree (set theory); k-nearest neighbors algorithm; Indexation; Feature (linguistics); Constraint (computer-aided design); Data structure; Feature vector; Data mining; Pattern recognition (psychology); Information retrieval; Artificial intelligence; Spatial analysis; Image (mathematics); Mathematics; Spatial database; Combinatorics","score_opus":0.012396481116063937,"score_gpt":0.22114698413863004,"score_spread":0.2087505030225661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497909917","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.033526134,0.0030414811,0.93442863,0.0002894129,0.00045511773,0.00019601699,0.0037895818,0.013775474,0.01049809],"genre_scores_gemma":[0.20142703,0.002095305,0.7651944,0.0001985895,0.00035129683,0.00032398186,0.014275039,0.0016277382,0.014506669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988856,0.00014321246,0.000102775295,0.00015554552,0.00055263715,0.00016026877],"domain_scores_gemma":[0.9976707,0.00046586886,0.00012699795,0.0009821109,0.00061347894,0.0001408321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063380104,0.0007858374,0.0019179563,0.003753336,0.0010881792,0.004062666,0.0027262517,0.00073808734,0.01818921],"category_scores_gemma":[0.00472733,0.0006276742,0.0007290106,0.010308125,0.0006878882,0.00541219,0.0033101267,0.0010385875,0.00666806],"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.00046753566,0.0001937877,0.0011762446,0.000384224,0.000043821565,0.00010272923,0.00016777069,0.008973086,0.026497794,0.047641706,0.041567646,0.8727836],"study_design_scores_gemma":[0.00024593744,0.0003819182,0.0041498574,0.00018520564,0.00011420379,0.0013853925,0.0006141919,0.51463026,0.09079118,0.2773703,0.109929,0.00020252769],"about_ca_topic_score_codex":0.0024890539,"about_ca_topic_score_gemma":0.004213337,"teacher_disagreement_score":0.01818921,"about_ca_system_score_codex":0.001100817,"about_ca_system_score_gemma":0.0013968959,"threshold_uncertainty_score":0.06084901},"labels":[],"label_agreement":null},{"id":"W1498077172","doi":"10.1007/3-540-39799-x_34","title":"How to Construct Pseudo-random Permutations from Pseudo-random Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":130,"is_retracted":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":"Random permutation; Pseudorandom number generator; Permutation (music); Mathematics; Combinatorics; Pseudorandom permutation; Generator (circuit theory); Random function; Pseudorandom function family; Discrete mathematics; Invertible matrix; Pseudorandom generator; Algorithm; Random variable; Symmetric group; Pure mathematics; Physics","score_opus":0.018154682644453475,"score_gpt":0.24135369018950092,"score_spread":0.22319900754504746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498077172","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.0055506164,0.00026623896,0.977768,0.0005935268,0.00030096923,0.00012953553,0.00015109529,0.00106458,0.014175503],"genre_scores_gemma":[0.12551086,0.0011351067,0.84390235,0.0006259852,0.00021625703,0.00041627034,0.0006369735,0.0013560454,0.026200067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868625,0.00035697193,0.00007446901,0.00017566611,0.00061038585,0.00009622422],"domain_scores_gemma":[0.998604,0.00060695567,0.000060071594,0.0004901342,0.00018232266,0.000056431498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010515322,0.0010849873,0.0008485456,0.0011755734,0.00094091776,0.0021123094,0.00091876456,0.0013893811,0.008572905],"category_scores_gemma":[0.005243573,0.0007914621,0.0014428454,0.001093769,0.0015157091,0.0043870537,0.0026678082,0.0027567674,0.0053802636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059740003,0.00004058519,0.00023200148,0.00024218779,0.000044244065,0.00017587723,0.00018068655,0.007648441,0.0065065552,0.83058417,0.007970756,0.1463147],"study_design_scores_gemma":[0.000027502145,0.000029524972,0.0001209265,0.000070577655,0.00002936273,0.0005235229,0.00004196209,0.028832272,0.0129442625,0.91681623,0.040520735,0.000043178447],"about_ca_topic_score_codex":0.00023738075,"about_ca_topic_score_gemma":0.00033021852,"teacher_disagreement_score":0.008572905,"about_ca_system_score_codex":0.00052932557,"about_ca_system_score_gemma":0.0006628771,"threshold_uncertainty_score":0.028679252},"labels":[],"label_agreement":null},{"id":"W1498126275","doi":"10.1007/3-540-44745-8_21","title":"Highlight and Shading Invariant Color Image Segmentation Using Simulated Annealing","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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 Waterloo","funders":"","keywords":"Artificial intelligence; Color space; Computer vision; RGB color model; Standard illuminant; Computer science; Image segmentation; Segmentation; Hue; Shading; Markov random field; Color image; RGB color space; Color constancy; Scale-space segmentation; Pixel; Color model; Color histogram; Image processing; Image (mathematics); Computer graphics (images)","score_opus":0.018823215973769753,"score_gpt":0.2743067707969589,"score_spread":0.2554835548231892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498126275","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.025881529,0.0001223028,0.9694428,0.000080744365,0.000032738866,0.000056310942,0.00003835882,0.0014638574,0.002881331],"genre_scores_gemma":[0.29949135,0.000091922964,0.69516265,0.000094679686,0.000025251178,0.00011320421,0.00011781527,0.00090346666,0.003999608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.0000546638,0.000008109581,0.00007884209,0.000088883266,0.00004080934],"domain_scores_gemma":[0.999408,0.00028768688,0.000052160398,0.00012029709,0.00009311153,0.00003870602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053238636,0.0006496911,0.0010701969,0.00062475604,0.00058898056,0.0010937793,0.0014524187,0.0011403939,0.0035975827],"category_scores_gemma":[0.001409722,0.00087291846,0.0010698482,0.00081213017,0.0009106476,0.0008109292,0.0010877267,0.0009204039,0.0006247099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030104685,0.00008489221,0.00054095435,0.00008897188,0.00008574706,0.0000773417,0.00016807459,0.83873934,0.048676454,0.016363475,0.0015709728,0.09330272],"study_design_scores_gemma":[0.000011022557,0.000013614456,0.00008647675,0.0000017815091,0.0000067115634,0.000012858379,0.000005477124,0.992585,0.00432202,0.00255928,0.00038869662,0.0000069396056],"about_ca_topic_score_codex":0.004723966,"about_ca_topic_score_gemma":0.0066197845,"teacher_disagreement_score":0.004723966,"about_ca_system_score_codex":0.0016078777,"about_ca_system_score_gemma":0.0009390116,"threshold_uncertainty_score":0.012035131},"labels":[],"label_agreement":null},{"id":"W1498129884","doi":"10.1007/3-540-47719-5_33","title":"Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":110,"is_retracted":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":"Schnorr signature; Computer science; Merkle signature scheme; Scheme (mathematics); Digital signature; Signature (topology); Ring signature; Certificate; ElGamal signature scheme; Theoretical computer science; Random oracle; Blind signature; Public-key cryptography; Algorithm; Mathematics; Computer network; Computer security","score_opus":0.01745578900752887,"score_gpt":0.2470108243823711,"score_spread":0.22955503537484223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498129884","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.10145502,0.0013865811,0.8182555,0.0030030508,0.00046076585,0.00028322896,0.00056301453,0.002640999,0.071951844],"genre_scores_gemma":[0.81923985,0.0006568976,0.13014457,0.0003296612,0.00027789446,0.0002369597,0.0004048523,0.0003265014,0.04838283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962244,0.0005991336,0.0003084248,0.00070618454,0.0016581394,0.0005037444],"domain_scores_gemma":[0.9951742,0.0015527093,0.00039307945,0.0022892714,0.00036529405,0.00022553372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023586247,0.00074742944,0.0012909736,0.00076431973,0.0020906786,0.0057030376,0.0024426302,0.002415342,0.00690578],"category_scores_gemma":[0.0071896613,0.0009213217,0.0010665571,0.002199705,0.003835175,0.015290113,0.00592069,0.004965121,0.0021645897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005264707,0.000085547224,0.00023743615,0.00018745898,0.000025879837,0.000107551874,0.00038787452,0.007079491,0.009035329,0.94780886,0.0028920637,0.031626],"study_design_scores_gemma":[0.00014826292,0.00011088929,0.00021253101,0.000048240447,0.00004106161,0.00025709806,0.000086813016,0.034830704,0.016752066,0.9334932,0.0139531,0.000066125285],"about_ca_topic_score_codex":0.0006805936,"about_ca_topic_score_gemma":0.00080560095,"teacher_disagreement_score":0.00690578,"about_ca_system_score_codex":0.003402048,"about_ca_system_score_gemma":0.003018031,"threshold_uncertainty_score":0.024683774},"labels":[],"label_agreement":null},{"id":"W1498202041","doi":"10.1007/978-3-642-24100-0_42","title":"Synchronous Rendezvous for Location-Aware Agents","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Simple (philosophy); Euclidean distance; Euclidean space; Euclidean geometry; Point (geometry); Combinatorics; Discrete mathematics; Mathematics; Topology (electrical circuits); Artificial intelligence; Computer network; Geometry; Physics; Spacecraft","score_opus":0.03711144743406031,"score_gpt":0.2726075377252521,"score_spread":0.23549609029119178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498202041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053854067,0.0005259796,0.9200452,0.00020958057,0.00020836966,0.000077735924,0.00014142413,0.0028926684,0.022044932],"genre_scores_gemma":[0.86328745,0.00036720565,0.11680369,0.00005893478,0.00007532713,0.00011959626,0.00024321298,0.0002728968,0.01877165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996276,0.00005944291,0.000019760682,0.000107852684,0.00009979509,0.00008553023],"domain_scores_gemma":[0.9993622,0.00021713982,0.00004916375,0.00021827761,0.000079093435,0.00007413748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038810124,0.0007089495,0.00080076547,0.00036604807,0.0010135976,0.0011244045,0.001718653,0.0006971792,0.006371194],"category_scores_gemma":[0.0016682373,0.0004206536,0.00039804325,0.00047025876,0.00066359015,0.0018061092,0.0023236454,0.0009800405,0.0014231502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001301243,0.00023515044,0.0010950576,0.0004884965,0.000108475346,0.00080991886,0.0011254738,0.3256903,0.05146672,0.30792427,0.016486116,0.29326874],"study_design_scores_gemma":[0.00011156863,0.00013290257,0.00028674255,0.000020208587,0.00004439409,0.00024043545,0.00023345734,0.8841645,0.01272108,0.08591425,0.01609875,0.000031762323],"about_ca_topic_score_codex":0.0028910006,"about_ca_topic_score_gemma":0.004416472,"teacher_disagreement_score":0.006371194,"about_ca_system_score_codex":0.00054100255,"about_ca_system_score_gemma":0.0006120889,"threshold_uncertainty_score":0.021313787},"labels":[],"label_agreement":null},{"id":"W1498270306","doi":"10.1007/11779568_7","title":"Introducing Social Investors into Multi-Agent Models of Financial Markets","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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":"York University","funders":"","keywords":"Popularity; Financial market; Equity (law); Maximization; Investment decisions; Financial modeling; Finance; Investment (military); Utility maximization; Computer science; Financial economics; Microeconomics; Behavioral economics; Economics; Mathematical economics","score_opus":0.028575797809908134,"score_gpt":0.21490569234446996,"score_spread":0.18632989453456184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498270306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024715384,0.0020750596,0.941986,0.0046761986,0.0005065329,0.00007408808,0.00012046113,0.00018088447,0.025665373],"genre_scores_gemma":[0.714527,0.004260638,0.24656633,0.0009756212,0.0015468417,0.00041107243,0.00014009529,0.00018817038,0.031384192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913126,0.000587868,0.000031068626,0.00007302789,0.00011258747,0.00006420873],"domain_scores_gemma":[0.99694353,0.0022440224,0.00026864026,0.00015115469,0.00018446127,0.00020823153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022306184,0.0011199543,0.001275848,0.00073548034,0.00082031026,0.0025970172,0.002337868,0.00367483,0.0051520388],"category_scores_gemma":[0.0076673618,0.00096943096,0.0012522223,0.0009823238,0.0023049682,0.0048587797,0.0030443247,0.0033538868,0.0005396],"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.000018538873,0.000048860617,0.0005022282,0.000043021668,0.00005126979,0.00014111925,0.00018798727,0.16999675,0.00034000806,0.82161766,0.0016583761,0.0053941584],"study_design_scores_gemma":[0.000027013393,0.000017472456,0.000064820735,0.000010895896,0.00001496722,0.00003519332,0.00002984381,0.6272597,0.000050370632,0.36990428,0.0025742375,0.00001127385],"about_ca_topic_score_codex":0.0028276693,"about_ca_topic_score_gemma":0.0034586806,"teacher_disagreement_score":0.0051520388,"about_ca_system_score_codex":0.0009138928,"about_ca_system_score_gemma":0.0010595218,"threshold_uncertainty_score":0.017235339},"labels":[],"label_agreement":null},{"id":"W1498330459","doi":"10.1007/978-3-642-03359-9_17","title":"Formal Analysis of Optical Waveguides in HOL","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Photonic and Optical Devices","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; HOL; Piecewise; Automated theorem proving; Planar; Waveguide; Theoretical computer science; Electronic engineering; Mathematics; Programming language; Optics; Physics","score_opus":0.010870863138774934,"score_gpt":0.2296731061151651,"score_spread":0.21880224297639014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498330459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03687166,0.0023262238,0.8199687,0.001831556,0.00041781383,0.00007150992,0.00028405254,0.00045046542,0.13777803],"genre_scores_gemma":[0.74877775,0.0028740696,0.17983814,0.0006522741,0.0008101333,0.00020440137,0.00049131963,0.00056671316,0.06578518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994351,0.00014325202,0.000033688222,0.00006802294,0.00023396999,0.00008585205],"domain_scores_gemma":[0.999413,0.00030198338,0.000055429657,0.00009832767,0.000101278216,0.000030057307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235083,0.00056794385,0.00043604206,0.0010901194,0.001051492,0.0026082152,0.0009314402,0.00056959945,0.0055191587],"category_scores_gemma":[0.0013437842,0.00042935618,0.000944484,0.0007445719,0.0031647019,0.003808038,0.0013107955,0.0023199806,0.00066559826],"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.0000068045374,0.000008051641,0.0000326615,0.000020357515,0.0000024302826,0.00001986442,0.00008777927,0.0014054806,0.00045097142,0.99413574,0.00049756217,0.003332269],"study_design_scores_gemma":[0.000004029716,0.0000051613356,0.00006494336,0.000019473477,0.000003414445,0.000024750369,0.000049910082,0.00780762,0.00063924765,0.98480946,0.0065663005,0.0000055906207],"about_ca_topic_score_codex":0.0010136763,"about_ca_topic_score_gemma":0.0013339764,"teacher_disagreement_score":0.0055191587,"about_ca_system_score_codex":0.0015520606,"about_ca_system_score_gemma":0.0007391403,"threshold_uncertainty_score":0.018463373},"labels":[],"label_agreement":null},{"id":"W1498361645","doi":"10.1007/11754008_18","title":"Reducing the Lengths of Checking Sequences by Overlapping","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Ottawa","funders":"","keywords":"Computer science; A priori and a posteriori; Model checking; Set (abstract data type); Selection (genetic algorithm); State (computer science); Algorithm; Reduction (mathematics); Sequence (biology); Theoretical computer science; Artificial intelligence; Mathematics; Programming language","score_opus":0.01894883717841254,"score_gpt":0.25226917097699325,"score_spread":0.23332033379858072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498361645","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.08911497,0.0005818814,0.8935539,0.00042724708,0.0002349486,0.0003146287,0.0002915206,0.007978796,0.0075020147],"genre_scores_gemma":[0.33907098,0.00041239307,0.6511136,0.00034978273,0.0001472085,0.0003935482,0.00088526146,0.0021103492,0.005516914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99198043,0.002001268,0.00084191764,0.0015536438,0.0025700126,0.001052681],"domain_scores_gemma":[0.9457991,0.0305469,0.0033564838,0.014694743,0.0044092173,0.0011934949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033057248,0.0017333868,0.0017230699,0.0022798197,0.0012848758,0.0016107477,0.0043348162,0.001396026,0.010608913],"category_scores_gemma":[0.02466521,0.001760567,0.0018209448,0.0025496557,0.0021324737,0.006158905,0.004059542,0.0033361062,0.0025612204],"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.0029243801,0.0009010117,0.004889167,0.00085701235,0.00017248504,0.0005689084,0.00076394953,0.10625547,0.055549163,0.05787874,0.008761798,0.7604779],"study_design_scores_gemma":[0.0005092205,0.0009486783,0.002358157,0.00034890787,0.00044547717,0.0009190841,0.00044694208,0.6247562,0.111475594,0.23654698,0.021067582,0.00017722476],"about_ca_topic_score_codex":0.0020916655,"about_ca_topic_score_gemma":0.004052151,"teacher_disagreement_score":0.010608913,"about_ca_system_score_codex":0.0012067012,"about_ca_system_score_gemma":0.003322837,"threshold_uncertainty_score":0.035490334},"labels":[],"label_agreement":null},{"id":"W1498362350","doi":"10.1007/11766247_29","title":"Sentiment Tagging of Adjectives at the Meaning Level","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Concordia University","funders":"","keywords":"Computer science; Meaning (existential); Natural language processing; Artificial intelligence; Linguistics; Information retrieval; Philosophy; Epistemology","score_opus":0.029198624072144092,"score_gpt":0.2574771449464802,"score_spread":0.22827852087433612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498362350","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.1744831,0.0028962847,0.71234,0.002082767,0.0035385669,0.00049342366,0.006364459,0.003687579,0.09411379],"genre_scores_gemma":[0.59208584,0.001974535,0.36014318,0.0006276121,0.0010420023,0.00031550182,0.010648111,0.0013365693,0.03182666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999204,0.00020449255,0.00008175557,0.00015980103,0.00026135374,0.000088647044],"domain_scores_gemma":[0.9981359,0.00056420924,0.00014987879,0.00021397012,0.00085087656,0.00008512223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094976305,0.00063005066,0.0005366668,0.0019401725,0.00096877955,0.0021396454,0.00048098352,0.00059389236,0.0059541333],"category_scores_gemma":[0.0040270616,0.00037200376,0.00073103054,0.0023416448,0.00048808576,0.0024313407,0.00096405926,0.0012696752,0.0046899687],"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.00049895333,0.00023121777,0.0074536116,0.0009105692,0.000120819845,0.00057501026,0.0017133498,0.0013922544,0.20598593,0.033168256,0.054332424,0.6936177],"study_design_scores_gemma":[0.00011694068,0.00056645734,0.061409608,0.0010661883,0.00081816915,0.00393741,0.003800171,0.17286283,0.1989913,0.19623943,0.35983795,0.0003535623],"about_ca_topic_score_codex":0.0008078168,"about_ca_topic_score_gemma":0.0013869639,"teacher_disagreement_score":0.0059541333,"about_ca_system_score_codex":0.0003919317,"about_ca_system_score_gemma":0.00055725616,"threshold_uncertainty_score":0.01991862},"labels":[],"label_agreement":null},{"id":"W1498375319","doi":"10.1007/978-3-540-28647-9_24","title":"Synchronization in Two Uncoupled Chaotic Neurons","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"stochastic dynamics and bifurcation","field":"Physics and Astronomy","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":"McMaster University","funders":"","keywords":"Synchronization (alternating current); Lyapunov exponent; Chaotic; SIGNAL (programming language); Control theory (sociology); Phase synchronization; Synchronization of chaos; Interval (graph theory); Computer science; Neuron; Phase (matter); Physics; Topology (electrical circuits); Neuroscience; Mathematics; Artificial intelligence; Telecommunications; Quantum mechanics","score_opus":0.007584563114515719,"score_gpt":0.23733110213157896,"score_spread":0.22974653901706324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498375319","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.9174641,0.00029649673,0.06260476,0.00040467532,0.00018640432,0.000029570532,0.00005100265,0.00015164973,0.018811354],"genre_scores_gemma":[0.9925337,0.000074476615,0.0031933766,0.000026570351,0.000013730357,0.000010828273,0.000017153423,0.000014493699,0.0041156947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991,0.000020108197,0.000006673262,0.000019784198,0.000026915004,0.00001643862],"domain_scores_gemma":[0.9997683,0.000090255555,0.000036597263,0.00002588271,0.000031586507,0.000047343754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021150529,0.00022372203,0.00036732855,0.00027338992,0.00036796855,0.000656947,0.0006962316,0.0007534569,0.0016869555],"category_scores_gemma":[0.00088550197,0.00021752743,0.00030279264,0.00023356992,0.00058203173,0.00062347745,0.0009200313,0.0004645499,0.00020507844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009878139,0.00020005033,0.003754038,0.00035818238,0.00018671129,0.0032580297,0.0016943574,0.3929305,0.2316922,0.3175014,0.0024778706,0.044958923],"study_design_scores_gemma":[0.00008268087,0.0001617174,0.0018329992,0.000021721075,0.000043746662,0.00023694577,0.00014457927,0.93799675,0.00851221,0.049792547,0.00113514,0.00003886358],"about_ca_topic_score_codex":0.0007580904,"about_ca_topic_score_gemma":0.00077339966,"teacher_disagreement_score":0.0016869555,"about_ca_system_score_codex":0.0003871527,"about_ca_system_score_gemma":0.0002241354,"threshold_uncertainty_score":0.0056434274},"labels":[],"label_agreement":null},{"id":"W1498387692","doi":"10.1007/978-3-540-89646-3_29","title":"Frontal Face Recognition from Video","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Facial recognition system; Pattern recognition (psychology); Feature extraction; Three-dimensional face recognition; Computer vision; Classifier (UML); Curse of dimensionality; Support vector machine; Face (sociological concept); Face detection","score_opus":0.02337926010392559,"score_gpt":0.229833696552865,"score_spread":0.2064544364489394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498387692","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.04538837,0.0037520886,0.9084734,0.00025308295,0.0004962525,0.00017886245,0.0025181288,0.0062007643,0.032739017],"genre_scores_gemma":[0.323623,0.007742128,0.58054954,0.00044560176,0.00050556613,0.0001677682,0.01055701,0.0005859965,0.07582343],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998394,0.000008653799,0.0000052643345,0.00004807008,0.0000617682,0.000036840658],"domain_scores_gemma":[0.9999126,0.000014477242,0.0000065544937,0.000021911306,0.00003739879,0.000007031315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017238292,0.0007002592,0.0006356751,0.0008992318,0.00019461448,0.0007519618,0.00055694924,0.000603098,0.010906447],"category_scores_gemma":[0.00033692888,0.00024637373,0.00042922687,0.0006964537,0.00015149225,0.00062167656,0.00045282554,0.00035387333,0.009142577],"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.00014853477,0.000053416,0.0003322197,0.000087431334,0.000022874745,0.00012158844,0.000014277837,0.0023202486,0.18455452,0.0011264686,0.011437994,0.7997804],"study_design_scores_gemma":[0.000025033969,0.0002850169,0.010738469,0.00009270916,0.00010812379,0.0027905249,0.00012338531,0.33801705,0.5965626,0.0048820158,0.04631616,0.000058826718],"about_ca_topic_score_codex":0.0021351106,"about_ca_topic_score_gemma":0.0032315229,"teacher_disagreement_score":0.010906447,"about_ca_system_score_codex":0.00023131912,"about_ca_system_score_gemma":0.00022027911,"threshold_uncertainty_score":0.03648573},"labels":[],"label_agreement":null},{"id":"W1498429882","doi":"10.1007/11551188_19","title":"On Fitting Finite Dirichlet Mixture Using ECM and MML","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Automatic summarization; Computer science; Mixture model; Dirichlet distribution; Latent Dirichlet allocation; Set (abstract data type); Pattern recognition (psychology); Gaussian; Algorithm; Artificial intelligence; Image (mathematics); Topic model; Mathematics","score_opus":0.022262595841461074,"score_gpt":0.261703608159238,"score_spread":0.23944101231777692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498429882","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.0020395436,0.00026337404,0.9960544,0.0001455983,0.00006287165,0.000025964157,0.00007265914,0.00055788626,0.0007777293],"genre_scores_gemma":[0.07907988,0.0004878337,0.91094816,0.00061344646,0.00032222565,0.000303795,0.0011723813,0.0010613432,0.006010967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580705,0.0026196102,0.0002263179,0.0005326067,0.000626906,0.00018760713],"domain_scores_gemma":[0.9786652,0.017828977,0.00040816888,0.0015423176,0.0012486948,0.00030669488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081991665,0.0016426273,0.002914044,0.002253533,0.0011708434,0.002659367,0.004684143,0.0040623806,0.010137578],"category_scores_gemma":[0.038456,0.0020236764,0.0025367842,0.0028094116,0.0017326527,0.0050055133,0.004720002,0.004147764,0.003969673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003634353,0.00013842997,0.0013374469,0.00023560625,0.00019274274,0.00015562351,0.00022356202,0.6263412,0.0017580844,0.060386527,0.0081516225,0.30071566],"study_design_scores_gemma":[0.000009855431,0.0000079393885,0.000067521876,0.0000133648,0.000010632346,0.000024217657,0.000016611615,0.97540796,0.0003014228,0.023118632,0.0010090965,0.000012741937],"about_ca_topic_score_codex":0.011806259,"about_ca_topic_score_gemma":0.014513704,"teacher_disagreement_score":0.011806259,"about_ca_system_score_codex":0.0014322823,"about_ca_system_score_gemma":0.0014438363,"threshold_uncertainty_score":0.043361902},"labels":[],"label_agreement":null},{"id":"W1498435869","doi":"10.1007/11551263_10","title":"On Utilizing Stochastic Learning Weak Estimators for Training and Classification of Patterns with Non-stationary Distributions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"Estimator; Computer science; Multinomial distribution; Convergence (economics); Variance (accounting); Artificial intelligence; Distribution (mathematics); Pattern recognition (psychology); Mathematics; Applied mathematics; Statistics","score_opus":0.021720192421590442,"score_gpt":0.2710095178746387,"score_spread":0.24928932545304822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498435869","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.003934304,0.00018542787,0.9953915,0.0000826414,0.000024446208,0.000022428227,0.000019181572,0.00016993503,0.00017011793],"genre_scores_gemma":[0.12237713,0.0007359903,0.8729065,0.0004081493,0.00026051124,0.00022563501,0.0005180551,0.00020593636,0.0023620925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976554,0.001004884,0.00026230625,0.00037532768,0.00057462166,0.00012731797],"domain_scores_gemma":[0.981753,0.013640138,0.0006647083,0.0017400507,0.0019326034,0.00026946535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008417541,0.0013313789,0.0021698072,0.0016841055,0.0006650422,0.0020813944,0.0027607596,0.002520007,0.0017297576],"category_scores_gemma":[0.028034845,0.00094915874,0.0013275525,0.0020739755,0.0019707454,0.0042395713,0.0038756798,0.0025271033,0.00091985683],"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.00038512613,0.00017968727,0.0038108006,0.00023930956,0.00021009213,0.000109768574,0.00020958942,0.2473475,0.011788799,0.056281753,0.0035835914,0.675854],"study_design_scores_gemma":[0.000013135844,0.0000514244,0.00034211655,0.00001730634,0.00002212527,0.00003987843,0.000015276826,0.9698111,0.0019036577,0.027048726,0.00072307495,0.0000121827925],"about_ca_topic_score_codex":0.0020701687,"about_ca_topic_score_gemma":0.0026305616,"teacher_disagreement_score":0.008417541,"about_ca_system_score_codex":0.0005828831,"about_ca_system_score_gemma":0.0010866636,"threshold_uncertainty_score":0.0445168},"labels":[],"label_agreement":null},{"id":"W1498449133","doi":"10.1007/978-3-642-13059-5_38","title":"A Novel Approach for Recommending Ranked User-Generated Reviews","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Helpfulness; Computer science; Benchmark (surveying); Quality (philosophy); Fraction (chemistry); Population; Baseline (sea); Information retrieval; Data mining","score_opus":0.06033900035495961,"score_gpt":0.29081915128815794,"score_spread":0.23048015093319835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498449133","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.05538324,0.004446487,0.9207504,0.0009958989,0.00087163615,0.0009470097,0.003072528,0.0071014822,0.0064312574],"genre_scores_gemma":[0.32305434,0.001474404,0.6524034,0.0006115695,0.0011567478,0.0006108444,0.0039888755,0.00022404027,0.016475841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980702,0.00027635865,0.00014674429,0.00044324182,0.00094783824,0.00011574756],"domain_scores_gemma":[0.9968496,0.0010655422,0.0001768422,0.00023760865,0.0015581768,0.00011225079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014531147,0.0012579784,0.001863596,0.0050222436,0.00076808984,0.0017574398,0.001832792,0.0017506351,0.0029048587],"category_scores_gemma":[0.0054336702,0.0005699087,0.0011382592,0.0044530174,0.0003000597,0.0016256657,0.00073485746,0.001088387,0.002682123],"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.0005497996,0.0007054727,0.0069394517,0.0004234799,0.0005853239,0.00027231517,0.00021354212,0.010639174,0.019167203,0.0024181702,0.033631377,0.9244547],"study_design_scores_gemma":[0.00014188417,0.0005327717,0.0056348243,0.00007211773,0.00042306428,0.0008037205,0.000117111,0.95786726,0.012760506,0.004696507,0.016842304,0.00010788812],"about_ca_topic_score_codex":0.008253444,"about_ca_topic_score_gemma":0.024296124,"teacher_disagreement_score":0.008253444,"about_ca_system_score_codex":0.0006713748,"about_ca_system_score_gemma":0.0012260374,"threshold_uncertainty_score":0.016410828},"labels":[],"label_agreement":null},{"id":"W1498479610","doi":"10.1007/978-3-540-73107-8_80","title":"Visual and Auditory Information Specifying an Impending Collision of an Approaching Object","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Collision; Computer science; Object (grammar); Computer vision; Stimulus (psychology); Artificial intelligence; Communication; Psychology; Cognitive psychology; Computer security","score_opus":0.023170123083387267,"score_gpt":0.2812152811868147,"score_spread":0.25804515810342743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498479610","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.6726048,0.0012330087,0.24847515,0.000720492,0.0009420573,0.00038635475,0.002209395,0.005829797,0.06759903],"genre_scores_gemma":[0.9565175,0.00035229287,0.035300966,0.00013980299,0.000077077944,0.000041502073,0.0007101857,0.0002554839,0.006605171],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996947,0.000034715773,0.000019629886,0.00004615314,0.00014619817,0.000058505007],"domain_scores_gemma":[0.99845374,0.00085298764,0.00014563036,0.00014237585,0.00022274569,0.00018251163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037478542,0.00056607556,0.00036719238,0.0006445002,0.00063513103,0.0012700272,0.0008195196,0.0014270493,0.011779953],"category_scores_gemma":[0.004355985,0.00036655235,0.00043493081,0.0003676032,0.00037018504,0.0010793153,0.0012120398,0.00069087156,0.0014587875],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0132420305,0.00032079223,0.029158482,0.0010508697,0.00013419855,0.03017162,0.0041663586,0.02217593,0.62370235,0.020088974,0.012543902,0.24324454],"study_design_scores_gemma":[0.0004505364,0.0045530107,0.16454929,0.0012629824,0.000783554,0.02573677,0.006392032,0.40813652,0.27093902,0.045667026,0.070964016,0.00056525884],"about_ca_topic_score_codex":0.0032766853,"about_ca_topic_score_gemma":0.004840664,"teacher_disagreement_score":0.011779953,"about_ca_system_score_codex":0.00040369027,"about_ca_system_score_gemma":0.000451113,"threshold_uncertainty_score":0.03940791},"labels":[],"label_agreement":null},{"id":"W1498483645","doi":"10.1007/978-3-319-02937-5_18","title":"Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Computer science; Correctness; Outsourcing; Matrix multiplication; Verifiable secret sharing; Multiplication (music); Polynomial; Theoretical computer science; Function (biology); Computation; Algorithm; Programming language; Mathematics","score_opus":0.026410232219953297,"score_gpt":0.28909247038452657,"score_spread":0.26268223816457326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498483645","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.07707285,0.0014333694,0.86817706,0.0014732716,0.00027694786,0.00016805845,0.00037001522,0.0016005242,0.0494279],"genre_scores_gemma":[0.80720556,0.0013328184,0.14311911,0.00016947566,0.00030200378,0.00019971437,0.0005360425,0.00049480394,0.04664043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767095,0.0005325477,0.00009932903,0.00021296169,0.0009901961,0.000494006],"domain_scores_gemma":[0.998089,0.0004644571,0.000088745786,0.0011048537,0.00017656277,0.00007626631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011403288,0.00071076176,0.0011907683,0.0005402124,0.0011335657,0.002619199,0.0011151014,0.0006233479,0.009779285],"category_scores_gemma":[0.003718948,0.0005090859,0.00091117056,0.0018738946,0.0014490107,0.005644076,0.0044220965,0.0023331062,0.0027317957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045405835,0.00018030286,0.0004570569,0.00025378965,0.000058824302,0.00019417898,0.00044256955,0.036226783,0.0058382754,0.73102415,0.014143657,0.2107264],"study_design_scores_gemma":[0.00007789488,0.00011673897,0.0004919883,0.00005262881,0.00004126646,0.0004174583,0.00017166784,0.18966092,0.013982056,0.7699011,0.025041224,0.000045113968],"about_ca_topic_score_codex":0.0008655005,"about_ca_topic_score_gemma":0.0011097239,"teacher_disagreement_score":0.009779285,"about_ca_system_score_codex":0.0015781989,"about_ca_system_score_gemma":0.0017039186,"threshold_uncertainty_score":0.032714903},"labels":[],"label_agreement":null},{"id":"W1498575378","doi":"10.1007/3-540-45619-8_28","title":"A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Computer science; Stable model semantics; Programming language; Theoretical computer science; Mathematics; Algorithm; Algebra over a field; Multimodal logic; Description logic; Pure mathematics","score_opus":0.030304064705304896,"score_gpt":0.2536489175324722,"score_spread":0.22334485282716732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498575378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045625452,0.0004385389,0.9272239,0.00076800486,0.00024216062,0.00028356677,0.0005802449,0.0053291908,0.01950894],"genre_scores_gemma":[0.25625777,0.00072872953,0.71537423,0.00035296637,0.00025699052,0.00023235,0.0024916464,0.0019194374,0.022385903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983681,0.00022933824,0.000134936,0.00053727295,0.00047307106,0.00025722387],"domain_scores_gemma":[0.99658513,0.0019048003,0.0001575282,0.0006986463,0.0005237157,0.0001302313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011004433,0.00067871,0.0007765608,0.00057755667,0.0007155614,0.0019075957,0.0017715455,0.0006210743,0.02011148],"category_scores_gemma":[0.0049954965,0.00078870886,0.0017090759,0.0013681998,0.0011760192,0.005338398,0.002071771,0.0029493286,0.0060415063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009220004,0.0012727338,0.0014573383,0.0011038847,0.000080478225,0.00036518218,0.0013643883,0.029532185,0.049920805,0.34213117,0.031080576,0.5407693],"study_design_scores_gemma":[0.0005947867,0.0005943459,0.0022264465,0.0002073567,0.00034140502,0.00076619,0.0005955885,0.35955283,0.10863998,0.4354121,0.09087265,0.00019629918],"about_ca_topic_score_codex":0.004054055,"about_ca_topic_score_gemma":0.004618255,"teacher_disagreement_score":0.02011148,"about_ca_system_score_codex":0.0015150273,"about_ca_system_score_gemma":0.0019237137,"threshold_uncertainty_score":0.06727958},"labels":[],"label_agreement":null},{"id":"W1498577966","doi":"10.1007/978-3-540-74260-9_107","title":"Suppression of Noise in Historical Photographs Using a Fuzzy Truncated-Median Filter","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Guelph","funders":"","keywords":"Median filter; Noise (video); Computer science; Chaotic; Gaussian noise; Salt-and-pepper noise; Value noise; Gradient noise; Filter (signal processing); Computer vision; Algorithm; Artificial intelligence; Fuzzy logic; Nonlinear filter; Colors of noise; Pattern recognition (psychology); Filter design; Image processing; Image (mathematics)","score_opus":0.03959410874054776,"score_gpt":0.29108308676191924,"score_spread":0.2514889780213715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498577966","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.0655531,0.0007475017,0.92934066,0.00012301467,0.00015489222,0.000047798945,0.00010627723,0.0005852433,0.0033415027],"genre_scores_gemma":[0.3439354,0.0014209632,0.6473651,0.00007795096,0.00021112012,0.00005411986,0.0004035215,0.00013216487,0.0063996455],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997464,0.000022401582,0.000017989982,0.00006424306,0.000119715245,0.00002933874],"domain_scores_gemma":[0.9997123,0.00006203755,0.000027414377,0.00003845411,0.00014246331,0.000017315524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005153067,0.00051347807,0.00069018913,0.0011664274,0.0004777181,0.00076749455,0.00063579995,0.0008005259,0.0018583498],"category_scores_gemma":[0.00079378166,0.00030766797,0.0011723544,0.0011125088,0.00048468504,0.0011064791,0.000537627,0.0005478423,0.0006421831],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068916334,0.0001152962,0.0014235041,0.00058877934,0.00010424024,0.0004675039,0.0003250781,0.034787655,0.3503512,0.005800377,0.0021337012,0.6032135],"study_design_scores_gemma":[0.000060406008,0.0004090127,0.009976924,0.00009454249,0.00043665065,0.0015627932,0.00031488,0.66147375,0.30026868,0.0069833538,0.018303834,0.00011514212],"about_ca_topic_score_codex":0.0012002428,"about_ca_topic_score_gemma":0.001541515,"teacher_disagreement_score":0.0018583498,"about_ca_system_score_codex":0.000328552,"about_ca_system_score_gemma":0.00039268998,"threshold_uncertainty_score":0.006216824},"labels":[],"label_agreement":null},{"id":"W1498579448","doi":"10.1007/978-3-319-09970-5_6","title":"Specification and Detection of SOA Antipatterns in Web Services","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":45,"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é du Québec à Montréal","funders":"","keywords":"Web service; Computer science; Software engineering; Software; Web application; Service-oriented architecture; Quality of service; Service (business); World Wide Web; Operating system; Computer network","score_opus":0.00872946613717315,"score_gpt":0.21674655787008557,"score_spread":0.2080170917329124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498579448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18428342,0.00023133123,0.80549157,0.00047071892,0.0001064181,0.00035559712,0.0005082002,0.0051306267,0.0034221634],"genre_scores_gemma":[0.59559727,0.00024805238,0.39896232,0.00020732809,0.000052527088,0.00021038445,0.0013839776,0.00041606417,0.0029221124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965083,0.00055405323,0.00037489526,0.0005147034,0.0016859947,0.0003619704],"domain_scores_gemma":[0.9852031,0.007877419,0.0018177138,0.0016070837,0.0032292919,0.00026549437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022682273,0.0006710328,0.00093076733,0.0018233723,0.00061835,0.001826069,0.0011421818,0.0012568784,0.0012776003],"category_scores_gemma":[0.010442267,0.0007538232,0.0010255524,0.0011339367,0.0009792644,0.0016930697,0.0011623683,0.0013039277,0.00052217155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001322738,0.0012105723,0.07637248,0.001260485,0.0002277993,0.0024189095,0.0013189589,0.07668387,0.28370818,0.06959586,0.006680664,0.47919953],"study_design_scores_gemma":[0.000080134116,0.00027553685,0.006258225,0.0000841396,0.000087327295,0.0009133072,0.00027810328,0.8233543,0.13354625,0.029815782,0.0052535273,0.000053325166],"about_ca_topic_score_codex":0.0037487186,"about_ca_topic_score_gemma":0.005193119,"teacher_disagreement_score":0.0037487186,"about_ca_system_score_codex":0.0006546111,"about_ca_system_score_gemma":0.0022550551,"threshold_uncertainty_score":0.011995673},"labels":[],"label_agreement":null},{"id":"W1498594556","doi":"10.1007/978-3-642-04417-5_17","title":"An Effectiveness Measure for Ambiguous and Underspecified Queries","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Novelty; Simplicity; Measure (data warehouse); Simple (philosophy); Information retrieval; Data mining","score_opus":0.029466645203154826,"score_gpt":0.2797366614465977,"score_spread":0.25027001624344286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498594556","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.4029488,0.019888975,0.5261522,0.0015365445,0.00062664977,0.0010399983,0.004143836,0.002606682,0.04105633],"genre_scores_gemma":[0.9152746,0.0010113465,0.07867659,0.00019214739,0.00052800565,0.0003454356,0.0019070228,0.00019306452,0.0018718095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9849627,0.0049758106,0.0013964012,0.0013669551,0.0065203924,0.00077770517],"domain_scores_gemma":[0.92922455,0.058307502,0.0031718416,0.003214359,0.0049363165,0.0011453726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011946427,0.0013489679,0.0022978145,0.015305077,0.00086176116,0.003258857,0.001661568,0.0022840546,0.003474425],"category_scores_gemma":[0.04885605,0.00034164972,0.0016604554,0.0042711375,0.0021778285,0.0065226876,0.0013056184,0.0011503481,0.00069958216],"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.0050411304,0.0015933142,0.071212135,0.0022935567,0.0016550714,0.00044685625,0.0009342498,0.0556711,0.03050585,0.044815376,0.014023206,0.7718081],"study_design_scores_gemma":[0.0003889641,0.008168902,0.1345209,0.0004972227,0.003296922,0.0052493177,0.0018443576,0.70384264,0.05348054,0.072955124,0.015230277,0.0005247994],"about_ca_topic_score_codex":0.0009479097,"about_ca_topic_score_gemma":0.00088892016,"teacher_disagreement_score":0.015305077,"about_ca_system_score_codex":0.0019454539,"about_ca_system_score_gemma":0.0009899394,"threshold_uncertainty_score":0.06317949},"labels":[],"label_agreement":null},{"id":"W1498688273","doi":"10.1007/11548669_3","title":"Granular Computing with Shadowed Sets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interpretation (philosophy); Computer science; Fuzzy set; Cluster analysis; Fuzzy logic; Core (optical fiber); Theoretical computer science; Algorithm; Granular computing; Data mining; Rough set; Artificial intelligence","score_opus":0.014916382853774482,"score_gpt":0.23257866192958618,"score_spread":0.2176622790758117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498688273","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.015301452,0.0013907842,0.96751004,0.0004552827,0.00030961673,0.00004536608,0.00011675762,0.0005309012,0.014339927],"genre_scores_gemma":[0.51352787,0.0017520626,0.472547,0.0001924333,0.00038371564,0.00011181255,0.00028818153,0.00016211139,0.011034841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991825,0.0001719631,0.00007182907,0.00013290775,0.00034998235,0.000090865426],"domain_scores_gemma":[0.9989851,0.00044455234,0.000059918948,0.0003158936,0.00011538405,0.00007909014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097105553,0.00048757633,0.0010860758,0.0009448302,0.0005940812,0.0030862116,0.0009627829,0.0005379135,0.0050893966],"category_scores_gemma":[0.0039922344,0.0005562673,0.00076230045,0.0019792458,0.0014507385,0.003981387,0.0023952937,0.0014819341,0.0006338261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015111832,0.000027935528,0.00024283254,0.00014482172,0.000046593486,0.00014272243,0.00015761486,0.056504812,0.0023786088,0.82895625,0.0038185494,0.1074281],"study_design_scores_gemma":[0.00001732486,0.000022540822,0.00012762893,0.000024738856,0.000019602641,0.000074700816,0.000031400243,0.28459284,0.0013067282,0.70652723,0.007238422,0.000016780834],"about_ca_topic_score_codex":0.0011575856,"about_ca_topic_score_gemma":0.00094657677,"teacher_disagreement_score":0.0050893966,"about_ca_system_score_codex":0.000893038,"about_ca_system_score_gemma":0.00053471985,"threshold_uncertainty_score":0.017025769},"labels":[],"label_agreement":null},{"id":"W1498711978","doi":"10.1007/978-3-540-39592-8_73","title":"RNA Structure as Permutation: A GA Approach Comparing Different Genetic Sequencing Operators","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"Simon Fraser University","funders":"","keywords":"RNA; Permutation (music); Computer science; Crossover; Computational biology; Algorithm; Base pair; Domain (mathematical analysis); Nucleic acid secondary structure; Theoretical computer science; Genetics; Biology; Mathematics; DNA; Gene; Artificial intelligence; Physics","score_opus":0.016720968283327052,"score_gpt":0.23075963539519653,"score_spread":0.21403866711186947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498711978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25903624,0.0005748411,0.72708017,0.0002723869,0.00017100116,0.00023147269,0.00036333763,0.0017883386,0.010482246],"genre_scores_gemma":[0.5089959,0.0003358062,0.48639157,0.0001379707,0.000039152506,0.00025987517,0.00057309505,0.000596397,0.0026702825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00044024788,0.00003090695,0.00012597312,0.00021064423,0.00008183051],"domain_scores_gemma":[0.9967231,0.0023363659,0.000111569345,0.0003677746,0.00038275745,0.000078462836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021939706,0.0009793343,0.0011967077,0.002136704,0.0007051602,0.0014468686,0.0019093443,0.0015594609,0.0025637394],"category_scores_gemma":[0.0058315867,0.000390979,0.0016007142,0.002209138,0.0009990722,0.0015437161,0.0005755929,0.0011471431,0.00024164094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058946334,0.00019494252,0.002065339,0.00019241871,0.00024713224,0.00017469803,0.00012362735,0.81178325,0.019091988,0.039967313,0.0015318603,0.12403794],"study_design_scores_gemma":[0.000031243002,0.00011655215,0.0003590261,0.000009019788,0.00008896933,0.000028759077,0.000029461413,0.9789756,0.002749565,0.017081385,0.00051481853,0.00001564193],"about_ca_topic_score_codex":0.0042348197,"about_ca_topic_score_gemma":0.004335837,"teacher_disagreement_score":0.0042348197,"about_ca_system_score_codex":0.0011952786,"about_ca_system_score_gemma":0.0013673479,"threshold_uncertainty_score":0.011602998},"labels":[],"label_agreement":null},{"id":"W1498715702","doi":"10.1007/11751540_46","title":"3D Building Reconstruction from LIDAR Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Lidar; Delaunay triangulation; Computer science; Ranging; Polygon mesh; Visualization; Triangulation; Computer vision; Roof; Range (aeronautics); Point cloud; Data set; Artificial intelligence; Set (abstract data type); Remote sensing; Computer graphics (images); Algorithm; Geography; Cartography","score_opus":0.017445737106892425,"score_gpt":0.2364681112730796,"score_spread":0.21902237416618717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498715702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007846571,0.0002274915,0.9865167,0.000056203047,0.000037840764,0.000038218015,0.0004103218,0.002779932,0.0020867055],"genre_scores_gemma":[0.14669703,0.0010635289,0.8433294,0.000073341864,0.000036684592,0.00007876797,0.0028324157,0.0008357683,0.0050530727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963343,0.000026898682,0.000016286847,0.00006572607,0.00022585249,0.000031736374],"domain_scores_gemma":[0.9997284,0.00006428272,0.000019196465,0.00009793048,0.000077777055,0.000012393766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002958155,0.0011611455,0.00093330845,0.0015097362,0.00025351264,0.0015099798,0.0012429488,0.0011221872,0.0059953323],"category_scores_gemma":[0.0010027881,0.0015795007,0.00124741,0.0017919624,0.0004451588,0.0010163791,0.001439668,0.0011483385,0.0047523775],"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.00013412684,0.0000818917,0.0013029231,0.0003901968,0.000121808305,0.00036672363,0.00019445506,0.25392887,0.07334886,0.008101749,0.0071726334,0.6548558],"study_design_scores_gemma":[0.00001603853,0.000033230226,0.0013177613,0.000048779355,0.000038572707,0.0006764468,0.00006321603,0.93729424,0.043123145,0.0066516767,0.010690621,0.00004630049],"about_ca_topic_score_codex":0.002969564,"about_ca_topic_score_gemma":0.0056153964,"teacher_disagreement_score":0.0059953323,"about_ca_system_score_codex":0.00026167862,"about_ca_system_score_gemma":0.00065900636,"threshold_uncertainty_score":0.020056367},"labels":[],"label_agreement":null},{"id":"W1498753860","doi":"10.1007/11686699_57","title":"Collaborative Virtual Learning Model for Web Intelligence","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Lakehead University","funders":"","keywords":"Computer science; Visualization; Human–computer interaction; Collaborative learning; Process (computing); World Wide Web; Information visualization; Multimedia; Knowledge management; Artificial intelligence","score_opus":0.020795546257136494,"score_gpt":0.263190072634453,"score_spread":0.24239452637731648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498753860","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.012994436,0.00047091124,0.93098855,0.0011506148,0.00017858592,0.00014716032,0.00027221988,0.00084818684,0.052949358],"genre_scores_gemma":[0.5206572,0.00074811094,0.40206406,0.00033410627,0.00016807241,0.0006753278,0.0009988144,0.0002109695,0.07414329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00039968186,0.00006214009,0.00018537845,0.0002985197,0.00010082264],"domain_scores_gemma":[0.9990183,0.00035203891,0.000048947477,0.0002710901,0.0001774246,0.0001322134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170475,0.00045986162,0.00057518354,0.00085099495,0.0012564169,0.0031365487,0.0029107996,0.0016512099,0.012083508],"category_scores_gemma":[0.0029077565,0.00024609486,0.0008708817,0.0012129038,0.0011470006,0.0064904517,0.002484137,0.0014803009,0.002571038],"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.00010003103,0.00021484445,0.00029519782,0.00007406417,0.00003320597,0.0001451343,0.0003301862,0.05767618,0.00052456174,0.8508281,0.009713781,0.08006465],"study_design_scores_gemma":[0.000043278043,0.000052310832,0.00013892654,0.00003071306,0.000030750136,0.00012239302,0.00011729274,0.44686392,0.0007556248,0.519407,0.032415632,0.000022105105],"about_ca_topic_score_codex":0.0044884146,"about_ca_topic_score_gemma":0.0045053675,"teacher_disagreement_score":0.012083508,"about_ca_system_score_codex":0.001359463,"about_ca_system_score_gemma":0.0015375371,"threshold_uncertainty_score":0.040423334},"labels":[],"label_agreement":null},{"id":"W1498755261","doi":"10.1007/11766247_15","title":"Modeling Causal Reinforcement and Undermining with Noisy-AND Trees","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.02282980293130301,"score_gpt":0.23652824616683724,"score_spread":0.21369844323553422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498755261","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.03498099,0.0005794206,0.9603578,0.0009467305,0.00007296253,0.00003295061,0.00017184822,0.00028368752,0.002573581],"genre_scores_gemma":[0.8171432,0.0010430354,0.17081092,0.00028441753,0.00029978287,0.00018773643,0.0003544748,0.00025605038,0.009620405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978163,0.0010831371,0.000092867354,0.00052339,0.0002651771,0.00021910574],"domain_scores_gemma":[0.9558631,0.038924906,0.0020541516,0.0014614065,0.0009773597,0.0007190784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055977497,0.0010932315,0.0023524573,0.0012614843,0.00079913647,0.0022851024,0.0035279552,0.0033113977,0.006134649],"category_scores_gemma":[0.051615164,0.0018313593,0.0013386168,0.0015590703,0.0032762012,0.006514884,0.0022848893,0.0040088384,0.00038987046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000162766,0.000055862627,0.0011471191,0.00011323803,0.000064896965,0.00012470089,0.00016513301,0.6811816,0.00034117882,0.29653615,0.0012173288,0.018890025],"study_design_scores_gemma":[0.000015030623,0.000012745527,0.00013508792,0.000011076949,0.000015704005,0.000026156436,0.000011314504,0.7696719,0.00012117404,0.22967419,0.0002946181,0.000011074065],"about_ca_topic_score_codex":0.0057527935,"about_ca_topic_score_gemma":0.00729917,"teacher_disagreement_score":0.006134649,"about_ca_system_score_codex":0.0019073399,"about_ca_system_score_gemma":0.0013450474,"threshold_uncertainty_score":0.029604137},"labels":[],"label_agreement":null},{"id":"W1498837330","doi":"10.1007/978-3-642-17511-4_2","title":"Speed-Up Techniques for Negation in Grounding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Rewriting; Ground; Computer science; Negation; Extension (predicate logic); Algebra over a field; Task (project management); Algebraic number; Relational algebra; Theoretical computer science; Algorithm; Programming language; Relational database; Mathematics; Database; Pure mathematics; Electrical engineering","score_opus":0.021375777864465578,"score_gpt":0.2674784011797515,"score_spread":0.24610262331528596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498837330","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.013568136,0.0010541858,0.96979505,0.00076800137,0.00039166276,0.00022911924,0.00020042386,0.0042358516,0.00975754],"genre_scores_gemma":[0.15380771,0.00091478665,0.8315423,0.0005218853,0.00042373128,0.0002693169,0.00076759263,0.0015673194,0.010185464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435025,0.001322677,0.00057588285,0.0010139396,0.0020327237,0.0007044942],"domain_scores_gemma":[0.9823783,0.011077301,0.00045657408,0.004489911,0.0013676775,0.00023009846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004108618,0.0022883704,0.0020400973,0.0034750553,0.0021580872,0.0033912447,0.005109529,0.0020848082,0.02034088],"category_scores_gemma":[0.018022213,0.0020775916,0.00450345,0.0038265022,0.0037733372,0.018189453,0.009050127,0.0071858712,0.004043434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006747284,0.0003105299,0.0011447542,0.0009901021,0.0001921085,0.00030142115,0.0008268834,0.018737314,0.011496887,0.39745566,0.02114045,0.54672927],"study_design_scores_gemma":[0.00016986553,0.00012275591,0.0003016389,0.00018336337,0.00030063518,0.00035321977,0.00022641446,0.12398382,0.01467131,0.83673173,0.022879716,0.00007545368],"about_ca_topic_score_codex":0.002244354,"about_ca_topic_score_gemma":0.0053118197,"teacher_disagreement_score":0.02034088,"about_ca_system_score_codex":0.001849644,"about_ca_system_score_gemma":0.0013365034,"threshold_uncertainty_score":0.06804705},"labels":[],"label_agreement":null},{"id":"W1498847583","doi":"10.1007/978-3-540-24677-0_7","title":"Fuzzy OLAP Association Rules Mining Based Novel Approach for Multiagent Cooperative Learning","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Online analytical processing; Computer science; Association rule learning; Fuzzy logic; Robustness (evolution); Data mining; Artificial intelligence; Data cube; Machine learning; Cube (algebra); Data warehouse","score_opus":0.022428665202239687,"score_gpt":0.2613589941269323,"score_spread":0.23893032892469263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498847583","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.021265583,0.00020598338,0.97549427,0.0002404064,0.0000678549,0.00012244753,0.00013154114,0.00053212984,0.0019397371],"genre_scores_gemma":[0.23365097,0.00017983165,0.76247334,0.0001371957,0.00006241895,0.00026762378,0.0003343084,0.00003491499,0.002859508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983834,0.00036885563,0.0001642402,0.00031024998,0.00069120014,0.000082038496],"domain_scores_gemma":[0.9971681,0.001047106,0.0002491001,0.0003539884,0.001076662,0.00010497116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045359,0.0006739024,0.0011413548,0.001589452,0.0009660269,0.0017850004,0.0022282794,0.0008696678,0.0019044245],"category_scores_gemma":[0.004349893,0.00040885067,0.0008105831,0.001804097,0.00040390948,0.0016672394,0.0016578947,0.0012190394,0.00065986393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040688255,0.00090671435,0.00763844,0.00031279708,0.00056132925,0.0006395413,0.000598715,0.072963566,0.011481253,0.015753381,0.006651072,0.8820863],"study_design_scores_gemma":[0.0000340091,0.00011127698,0.0014532845,0.000027112917,0.000105340056,0.0004765848,0.00020365315,0.96650743,0.007522107,0.019668847,0.003853422,0.00003697311],"about_ca_topic_score_codex":0.0018756523,"about_ca_topic_score_gemma":0.002882195,"teacher_disagreement_score":0.0022282794,"about_ca_system_score_codex":0.0004244658,"about_ca_system_score_gemma":0.00085578684,"threshold_uncertainty_score":0.010817051},"labels":[],"label_agreement":null},{"id":"W1498847683","doi":"10.1007/978-3-642-04081-8_20","title":"A Demonic Approach to Information in Probabilistic Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Probabilistic logic; Information system; Theoretical computer science; Artificial intelligence; Electrical engineering","score_opus":0.01772023911460869,"score_gpt":0.2282436103661312,"score_spread":0.2105233712515225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498847683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065673697,0.0024588448,0.826089,0.00618287,0.0006437588,0.000050601877,0.0002763092,0.00019347652,0.1575377],"genre_scores_gemma":[0.70321023,0.004559799,0.21776342,0.0022022342,0.0024282343,0.0003188758,0.00044403996,0.00023652405,0.06883665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.00055489736,0.000104617895,0.00014963829,0.00041638062,0.00010905298],"domain_scores_gemma":[0.9970663,0.0016605825,0.00016094293,0.0006000358,0.00035545096,0.00015660223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895607,0.0007854021,0.0006655837,0.0023553898,0.0015212833,0.0034245441,0.0020890206,0.0016962029,0.012318207],"category_scores_gemma":[0.0060892277,0.0005954241,0.000989059,0.0023167448,0.0062461197,0.01056008,0.0034683954,0.0035820603,0.0012767524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.374052e-7,8.347168e-7,0.0000077441555,0.0000071698405,8.544106e-7,0.0000069598923,0.000035458896,0.0005307866,0.000022585004,0.99782676,0.00034629068,0.0012135578],"study_design_scores_gemma":[9.744832e-7,0.0000020699417,0.000010277151,0.000004905057,0.0000013654002,0.000018726645,0.000013401338,0.0036295694,0.000042474738,0.9923483,0.003925464,0.000002579959],"about_ca_topic_score_codex":0.0015411056,"about_ca_topic_score_gemma":0.0012822212,"teacher_disagreement_score":0.012318207,"about_ca_system_score_codex":0.002410145,"about_ca_system_score_gemma":0.0007897305,"threshold_uncertainty_score":0.041208446},"labels":[],"label_agreement":null},{"id":"W1498892184","doi":"10.1007/978-3-540-78839-3_5","title":"Ab Initio Whole Genome Shotgun Assembly with Mated Short Reads","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hybrid genome assembly; Contig; Shotgun sequencing; Computer science; Sequence assembly; Genome; Shotgun; DNA sequencing; Computational biology; Algorithm; Genetics; Biology; DNA; Gene","score_opus":0.015603545160163488,"score_gpt":0.22779470678458255,"score_spread":0.21219116162441906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498892184","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.014846485,0.0014383773,0.96098137,0.00018660205,0.00045184966,0.00021369233,0.0029700731,0.012370255,0.0065413024],"genre_scores_gemma":[0.042950217,0.001400831,0.92288506,0.00029545583,0.0001074952,0.0004163628,0.016516233,0.0025422794,0.012886047],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994777,0.00007805466,0.00003270228,0.00016250281,0.00020513951,0.000043980217],"domain_scores_gemma":[0.9995733,0.00016410883,0.000020323463,0.00012782648,0.00009191556,0.000022583017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646083,0.0010652584,0.0016234083,0.000793613,0.0007479132,0.0013946109,0.0014664646,0.00083192566,0.006464286],"category_scores_gemma":[0.0012351102,0.0014278358,0.0015401967,0.00092410774,0.00043037406,0.000994629,0.0011670681,0.0029185906,0.011652857],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000277637,0.00012550464,0.00055166136,0.0012299619,0.00015001066,0.00024919782,0.0002835834,0.004582499,0.7743976,0.00941458,0.018206423,0.1905313],"study_design_scores_gemma":[0.000054595203,0.00026556608,0.0020703077,0.00012543652,0.00016137425,0.0008814093,0.00011513996,0.061505243,0.8112428,0.022089219,0.10136294,0.0001258582],"about_ca_topic_score_codex":0.0004185259,"about_ca_topic_score_gemma":0.0011744798,"teacher_disagreement_score":0.006464286,"about_ca_system_score_codex":0.00029631736,"about_ca_system_score_gemma":0.00062951766,"threshold_uncertainty_score":0.021625161},"labels":[],"label_agreement":null},{"id":"W1498914194","doi":"10.1007/978-3-540-45099-3_11","title":"Efficient Inference of Static Types for Java Bytecode","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":52,"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":"Bytecode; Java bytecode; Computer science; Type inference; Programming language; Java; Static analysis; Inference; Representation (politics); Program analysis; Theoretical computer science; Algorithm; Java applet; Artificial intelligence; Java annotation","score_opus":0.01949647408175968,"score_gpt":0.276019564644905,"score_spread":0.2565230905631453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498914194","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.009956432,0.000354088,0.9641845,0.00024015384,0.00013523427,0.00008763531,0.00059694366,0.019719236,0.0047256257],"genre_scores_gemma":[0.18431868,0.0006235086,0.7910711,0.00039023045,0.00028130977,0.00018133405,0.0036886495,0.0076026213,0.011842494],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957775,0.0008465321,0.00033969412,0.00067273487,0.0018745376,0.00048903615],"domain_scores_gemma":[0.9891861,0.0065047625,0.00038600483,0.002501507,0.0012602508,0.00016146807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025199482,0.0014100792,0.0020686847,0.0028489195,0.0014311321,0.0036700235,0.0055115055,0.0018097104,0.012142959],"category_scores_gemma":[0.014354229,0.0026677244,0.003755544,0.0027149068,0.0018358782,0.0074188407,0.0040164595,0.003350121,0.006460281],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006168266,0.0002706895,0.0031826652,0.0008064112,0.00020364462,0.0003450636,0.00054388883,0.027196985,0.021956317,0.111064754,0.03036984,0.8034429],"study_design_scores_gemma":[0.0001704223,0.00009970703,0.0019323258,0.00020070162,0.00029214835,0.00041259153,0.0002116018,0.4701194,0.056748305,0.44191265,0.02776211,0.0001380689],"about_ca_topic_score_codex":0.005021555,"about_ca_topic_score_gemma":0.009361416,"teacher_disagreement_score":0.012142959,"about_ca_system_score_codex":0.0019320971,"about_ca_system_score_gemma":0.002513079,"threshold_uncertainty_score":0.040622234},"labels":[],"label_agreement":null},{"id":"W1498978191","doi":"10.1007/978-3-540-68125-0_60","title":"FIsViz: A Frequent Itemset Visualizer","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":57,"is_retracted":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":"Computer science; Visualization; Representation (politics); Raw data; Information retrieval; Data mining; Information visualization; Programming language","score_opus":0.024085340206847175,"score_gpt":0.2721176414016298,"score_spread":0.24803230119478265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498978191","genre_codex":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022255268,0.0015883051,0.41068888,0.0007415144,0.00032487113,0.00041809308,0.11412287,0.44198433,0.007875923],"genre_scores_gemma":[0.090239905,0.0013997027,0.7670182,0.0004693564,0.00017621295,0.0010473356,0.11157234,0.017183643,0.01089331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951255,0.000064984204,0.00007399704,0.00010349971,0.00020989747,0.00003499402],"domain_scores_gemma":[0.99836606,0.00091682456,0.00015635094,0.00023367735,0.00022664604,0.00010041562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084810826,0.0019811532,0.0011580195,0.0067637903,0.0005087257,0.0019514877,0.001806682,0.001194763,0.027543947],"category_scores_gemma":[0.005063363,0.0009564229,0.0014192389,0.003891511,0.00017797324,0.00222086,0.0016328082,0.0011860525,0.0082737105],"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.0018707928,0.00028477283,0.008137575,0.0024447087,0.00057273335,0.0014467565,0.00065596605,0.010094417,0.023805475,0.009454934,0.34684926,0.5943826],"study_design_scores_gemma":[0.00110564,0.00059112336,0.011369717,0.000664706,0.00054333266,0.004058702,0.00044712616,0.3706598,0.059834607,0.0533676,0.49701664,0.0003409993],"about_ca_topic_score_codex":0.0017051608,"about_ca_topic_score_gemma":0.0024859218,"teacher_disagreement_score":0.027543947,"about_ca_system_score_codex":0.00030416815,"about_ca_system_score_gemma":0.00059576554,"threshold_uncertainty_score":0.092143655},"labels":[],"label_agreement":null},{"id":"W1499038423","doi":"10.1007/11866565_99","title":"Spinal Crawlers: Deformable Organisms for Spinal Cord Segmentation and Analysis","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":44,"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":"Segmentation; Computer science; Spinal cord; Artificial intelligence; Computer vision; Polygon mesh; Magnetic resonance imaging; Image segmentation; Anatomy; Pattern recognition (psychology); Medicine; Neuroscience; Biology; Radiology","score_opus":0.016860543094133,"score_gpt":0.2951380919553125,"score_spread":0.2782775488611795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499038423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008457367,0.00040434508,0.9773235,0.00018089433,0.00010912898,0.000101024874,0.0007227645,0.011645061,0.0010559108],"genre_scores_gemma":[0.08342344,0.0005401203,0.90640235,0.00018061322,0.00004558772,0.00026444797,0.0016958686,0.0018088581,0.0056387726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998265,0.000025893423,0.000008983791,0.00005638109,0.00006419829,0.000018121278],"domain_scores_gemma":[0.9997577,0.00011240576,0.000027793469,0.00004296862,0.000033237982,0.000025870884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040005564,0.00113126,0.0007760385,0.0010449373,0.00049631594,0.0009923148,0.0017142019,0.002150406,0.0047899154],"category_scores_gemma":[0.0010695593,0.0009581265,0.0011936937,0.0007807591,0.0005245381,0.0007131987,0.0014489023,0.0015378235,0.0023242813],"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.00024804485,0.00007811973,0.0014187456,0.00046512487,0.0002138219,0.0003625016,0.00027531682,0.37708202,0.05608667,0.015658425,0.02687909,0.52123207],"study_design_scores_gemma":[0.00002039776,0.00002389024,0.00037213034,0.00002155584,0.000017224207,0.0000956899,0.000020903995,0.97832644,0.0073349355,0.0062264353,0.007523361,0.000017005172],"about_ca_topic_score_codex":0.0050954507,"about_ca_topic_score_gemma":0.010303568,"teacher_disagreement_score":0.0050954507,"about_ca_system_score_codex":0.0005321887,"about_ca_system_score_gemma":0.00060320954,"threshold_uncertainty_score":0.016023874},"labels":[],"label_agreement":null},{"id":"W1499087426","doi":"10.1007/978-3-540-39903-2_26","title":"Visualization of Neural DTI Vector Fields Using Line Integral Convolution","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"London Health Sciences Centre; Western University","funders":"","keywords":"Diffusion MRI; Voxel; Tractography; Tensor field; Fractional anisotropy; Visualization; Fiber bundle; Artificial intelligence; Vector field; Anisotropy; Line integral; Tensor (intrinsic definition); Computer science; Bundle; Computer vision; Convolution (computer science); Line (geometry); Physics; Mathematics; Mathematical analysis; Artificial neural network; Geometry; Optics; Integral equation; Materials science","score_opus":0.07878309860122387,"score_gpt":0.36631929826678017,"score_spread":0.2875361996655563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499087426","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.013005892,0.00057570037,0.9750728,0.00044968253,0.00007274623,0.00004578475,0.00058685633,0.0065358547,0.0036546015],"genre_scores_gemma":[0.17365614,0.0018314304,0.81549406,0.00011253493,0.000083858315,0.00013368737,0.00081570476,0.0020893344,0.005783267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999429,0.000013342476,0.0000051374627,0.000009147694,0.000021923384,0.0000075424337],"domain_scores_gemma":[0.99961287,0.00019815353,0.000044920194,0.00004117696,0.00006681559,0.00003601857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033460668,0.00065950275,0.0003361513,0.0010714903,0.00025880983,0.001905528,0.00057763123,0.0005526707,0.012663071],"category_scores_gemma":[0.0012796791,0.00037892623,0.00036097268,0.0011310908,0.00019587835,0.001097987,0.00056799065,0.0009636231,0.0016052909],"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.0003857988,0.00009101193,0.0010878869,0.0008508755,0.0001043633,0.0005996279,0.00063019013,0.08842046,0.16262616,0.056779698,0.040611345,0.6478126],"study_design_scores_gemma":[0.000049178103,0.000057508354,0.001359118,0.00011286143,0.0000371059,0.00085033634,0.00010873773,0.85187584,0.0705761,0.04377022,0.031133762,0.00006926335],"about_ca_topic_score_codex":0.0014955947,"about_ca_topic_score_gemma":0.0016639228,"teacher_disagreement_score":0.012663071,"about_ca_system_score_codex":0.00037052168,"about_ca_system_score_gemma":0.00055428833,"threshold_uncertainty_score":0.042362154},"labels":[],"label_agreement":null},{"id":"W1499173616","doi":"10.1007/978-3-540-71661-7_23","title":"Querying Communities of Interest in Peer Database Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Exploit; Peer-to-peer; Information retrieval; Data mining; Database; World Wide Web","score_opus":0.08624009537401506,"score_gpt":0.29228843549128736,"score_spread":0.2060483401172723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499173616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30426612,0.0059150457,0.6747392,0.0016097778,0.00020374985,0.0005272887,0.0020630874,0.0038763378,0.0067994357],"genre_scores_gemma":[0.6794465,0.0017581732,0.3101838,0.00017965674,0.00016890779,0.00029971774,0.0033161293,0.0004364995,0.004210681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960598,0.0009818921,0.00035922063,0.00068099546,0.0016987901,0.00021935109],"domain_scores_gemma":[0.991134,0.0058800825,0.0005313909,0.0009367973,0.0009708829,0.0005468555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028941445,0.000658759,0.0019561667,0.0038811236,0.0021543119,0.0039749495,0.002986196,0.0020216943,0.0014815659],"category_scores_gemma":[0.01785562,0.000792367,0.00088913704,0.00585935,0.00089614274,0.008087917,0.0043944432,0.0012605428,0.00050598296],"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.002306027,0.0010164073,0.024441803,0.0020857472,0.0005487333,0.0023730327,0.0051222574,0.21230555,0.030446548,0.12857325,0.025197214,0.5655835],"study_design_scores_gemma":[0.0001690374,0.00014593644,0.0019723738,0.00012055354,0.00013298896,0.0013444033,0.0020513781,0.8213931,0.013710336,0.14004953,0.018832881,0.000077614546],"about_ca_topic_score_codex":0.0040136087,"about_ca_topic_score_gemma":0.005199251,"teacher_disagreement_score":0.0040136087,"about_ca_system_score_codex":0.001067533,"about_ca_system_score_gemma":0.00063384266,"threshold_uncertainty_score":0.015305877},"labels":[],"label_agreement":null},{"id":"W1499181218","doi":"10.1007/978-3-540-39611-6_24","title":"Mobile Agents for Clustering and Routing in Mobile Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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 Guelph","funders":"","keywords":"Computer network; Computer science; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Distributed computing; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Dynamic Source Routing; Link-state routing protocol; Mobile ad hoc network; Static routing; Hybrid routing; Policy-based routing; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Routing (electronic design automation); Wireless; Network packet; Telecommunications","score_opus":0.01609495910882278,"score_gpt":0.2502134767817561,"score_spread":0.23411851767293332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499181218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027627193,0.023548143,0.9354917,0.00078853965,0.0019605919,0.00015064534,0.00013223606,0.0019014175,0.033264022],"genre_scores_gemma":[0.06652876,0.023078557,0.78306246,0.0005171009,0.0015340032,0.0004332421,0.0005845197,0.0007191673,0.12354224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965215,0.00009344682,0.00001838265,0.000045932862,0.00017032016,0.000019833082],"domain_scores_gemma":[0.99967206,0.00014396755,0.000021761778,0.0000672537,0.00007642691,0.000018544522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035835142,0.00106677,0.0010038997,0.0006841228,0.0004259928,0.0014121991,0.0015777955,0.0014013542,0.008117415],"category_scores_gemma":[0.001001564,0.0004382557,0.0003665953,0.0013816277,0.00057593256,0.0019791196,0.0007231619,0.0012942788,0.0045361426],"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.00009954348,0.00008523464,0.0001904148,0.000945641,0.00007846734,0.0002644747,0.00027698555,0.041585427,0.008644024,0.228133,0.07529615,0.64440066],"study_design_scores_gemma":[0.00007004958,0.00015743129,0.00032726873,0.00029754025,0.000094994255,0.0009202818,0.00012509167,0.20387585,0.0066947676,0.15346004,0.63392174,0.00005493176],"about_ca_topic_score_codex":0.0005335245,"about_ca_topic_score_gemma":0.0009771228,"teacher_disagreement_score":0.008117415,"about_ca_system_score_codex":0.00037916817,"about_ca_system_score_gemma":0.00034596492,"threshold_uncertainty_score":0.027155459},"labels":[],"label_agreement":null},{"id":"W1499244104","doi":"10.1007/978-3-642-24469-8_27","title":"Making Sense in the Margins: A Field Study of Annotation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Nipissing University; Dalhousie University","funders":"","keywords":"Annotation; Computer science; Hypertext; Field (mathematics); Style (visual arts); Information retrieval; World Wide Web; Artificial intelligence","score_opus":0.040288491415573,"score_gpt":0.3078085936347314,"score_spread":0.2675201022191584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499244104","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.8345612,0.0011765668,0.03251556,0.0034302538,0.00016430246,0.00040821216,0.00030857802,0.00019263187,0.12724271],"genre_scores_gemma":[0.98365027,0.0002684175,0.006212628,0.00025709585,0.000050536953,0.00014277207,0.00016300558,0.00017488847,0.009080327],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9879253,0.008716979,0.0004250259,0.0012539413,0.001297502,0.00038125718],"domain_scores_gemma":[0.8874903,0.0952747,0.003543862,0.0060750735,0.006402519,0.0012134745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015019883,0.0004400952,0.00041220535,0.0031934043,0.007081574,0.005639825,0.0019046492,0.0017754339,0.0078829955],"category_scores_gemma":[0.07626405,0.00052735774,0.00024298183,0.0035827172,0.010291638,0.013719694,0.005095149,0.003039216,0.0010790644],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002350333,0.00015862251,0.009791281,0.00031563023,0.000007254207,0.00027789647,0.879454,0.00010625906,0.004494444,0.047200058,0.002768111,0.05519137],"study_design_scores_gemma":[0.000053583855,0.0002530643,0.027328549,0.00083165895,0.00003585257,0.0009200649,0.7751671,0.0025157265,0.0076288567,0.07931697,0.10584974,0.00009884929],"about_ca_topic_score_codex":0.005483998,"about_ca_topic_score_gemma":0.005241859,"teacher_disagreement_score":0.015019883,"about_ca_system_score_codex":0.002540555,"about_ca_system_score_gemma":0.002609322,"threshold_uncertainty_score":0.07943368},"labels":[],"label_agreement":null},{"id":"W1499269597","doi":"10.1007/11566465_10","title":"Unified Point Selection and Surface-Based Registration Using a Particle Filter","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Particle filter; Artificial intelligence; Point (geometry); Computer vision; Selection (genetic algorithm); Image registration; Representation (politics); Surface (topology); Filter (signal processing); Point distribution model; Algorithm; Mathematics","score_opus":0.01702010289108529,"score_gpt":0.22915664982596537,"score_spread":0.21213654693488007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499269597","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.0023959873,0.00004921027,0.9969326,0.000019228612,0.000026145872,0.00001376371,0.000011192122,0.00033870657,0.00021306727],"genre_scores_gemma":[0.104566306,0.0001909774,0.89235383,0.000044477973,0.000051957384,0.00011307948,0.00017604268,0.00020305856,0.0023002378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986559,0.00018744342,0.000065817156,0.00033994924,0.00064339454,0.00010748419],"domain_scores_gemma":[0.99925524,0.00017665414,0.000067535126,0.00022702252,0.00023388458,0.00003967975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010956054,0.0011564355,0.0024934795,0.0017460745,0.0007418292,0.0015266998,0.0014880628,0.0019152107,0.0021389073],"category_scores_gemma":[0.0026913828,0.0011800661,0.0016889876,0.0033573713,0.0007675012,0.0021116443,0.0021978167,0.0012339308,0.0019793625],"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.00053235283,0.00016210407,0.00149584,0.00020625473,0.00024621835,0.00024473135,0.00022718484,0.13899149,0.10586802,0.015265381,0.0035801795,0.7331803],"study_design_scores_gemma":[0.00003065546,0.00007555413,0.0011925729,0.000006371467,0.000054972672,0.00014795517,0.00002825905,0.97252256,0.019507391,0.0035122703,0.002885786,0.00003574306],"about_ca_topic_score_codex":0.0038816638,"about_ca_topic_score_gemma":0.0044530747,"teacher_disagreement_score":0.0038816638,"about_ca_system_score_codex":0.0004819386,"about_ca_system_score_gemma":0.0012757028,"threshold_uncertainty_score":0.007718146},"labels":[],"label_agreement":null},{"id":"W1499326532","doi":"10.1007/0-387-34805-0_56","title":"Good S-Boxes Are Easy To Find","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":91,"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":"Bijection; Computer science; Cryptosystem; Independence (probability theory); Nonlinear system; Arithmetic; Algorithm; Theoretical computer science; Cryptography; Discrete mathematics; Mathematics; Statistics","score_opus":0.02246416249936636,"score_gpt":0.25627651318834527,"score_spread":0.2338123506889789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499326532","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03301976,0.008491172,0.30690894,0.0040296847,0.0020708884,0.00025330213,0.0014330064,0.0036833093,0.64010996],"genre_scores_gemma":[0.22928028,0.010216093,0.28665787,0.0016513666,0.0009616842,0.0004436001,0.0012911905,0.0037428348,0.465755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994294,0.00013170141,0.000032876625,0.00012531073,0.0002020956,0.0000786302],"domain_scores_gemma":[0.9989742,0.00043289023,0.00009215609,0.00026705442,0.00016026711,0.00007342295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007602162,0.0016165946,0.0014373872,0.0020065992,0.0014172365,0.0030823087,0.000694598,0.0015998031,0.049095735],"category_scores_gemma":[0.0030910508,0.0009196913,0.00073297124,0.001964164,0.0029041297,0.00758217,0.0026460926,0.0020538492,0.029615354],"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.000081914724,0.000021791773,0.00008758197,0.00032831982,0.000018087287,0.00007018656,0.00016607526,0.0008734505,0.0020269353,0.8892236,0.03230693,0.0747952],"study_design_scores_gemma":[0.00002772578,0.000037579506,0.00008221351,0.0001606059,0.000017403247,0.00032113996,0.00008606359,0.0008967737,0.0027328832,0.811836,0.18377227,0.000029394612],"about_ca_topic_score_codex":0.00014266714,"about_ca_topic_score_gemma":0.00022945354,"teacher_disagreement_score":0.049095735,"about_ca_system_score_codex":0.00059198594,"about_ca_system_score_gemma":0.00049547973,"threshold_uncertainty_score":0.16424161},"labels":[],"label_agreement":null},{"id":"W1499347819","doi":"10.1007/978-3-540-69828-9_15","title":"Bio2RDF : A Semantic Web Atlas of Post Genomic Knowledge about Human and Mouse","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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é Laval","funders":"","keywords":"UniProt; Computer science; Information retrieval; Graph; World Wide Web; Atlas (anatomy); Semantic Web; Theoretical computer science; Biology","score_opus":0.014688225399841433,"score_gpt":0.2570209195131966,"score_spread":0.24233269411335517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499347819","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.017954318,0.005546575,0.44146177,0.0013760838,0.00049881364,0.00022792598,0.3566283,0.109118275,0.0671879],"genre_scores_gemma":[0.06661067,0.0070984755,0.3300077,0.0011332134,0.00023712093,0.00051017926,0.54298913,0.010615134,0.04079836],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997441,0.000029411567,0.000030246263,0.00006420819,0.00010644908,0.000025550582],"domain_scores_gemma":[0.99946934,0.00015291403,0.000071348986,0.00015731071,0.00008948296,0.000059628575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066213205,0.00093111466,0.0005762895,0.0067383097,0.000641875,0.0017577334,0.0012210435,0.001387374,0.01796452],"category_scores_gemma":[0.001466837,0.00041093727,0.0007633021,0.0048440397,0.00040413885,0.0027710828,0.0013784136,0.0009552867,0.009087115],"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.0006442082,0.0001947151,0.005734608,0.0031830687,0.00023018436,0.0019900082,0.0012554463,0.0072231037,0.054218657,0.12536933,0.4089649,0.39099184],"study_design_scores_gemma":[0.000029009041,0.000022051056,0.0045125624,0.0002464875,0.00009229964,0.0015638137,0.00010395069,0.0048559885,0.0109605035,0.041675787,0.9358915,0.000046043584],"about_ca_topic_score_codex":0.0048905895,"about_ca_topic_score_gemma":0.008478117,"teacher_disagreement_score":0.01796452,"about_ca_system_score_codex":0.0007445169,"about_ca_system_score_gemma":0.0014466103,"threshold_uncertainty_score":0.060097277},"labels":[],"label_agreement":null},{"id":"W1499353052","doi":"10.1007/978-3-642-12156-2_31","title":"Ordered Polyline Trees for Efficient Search of Objects Moving on a Graph","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rectangle; Computer science; Graph; Combinatorics; Object (grammar); Data structure; Line segment; Interval (graph theory); Bounding overwatch; Mathematics; Algorithm; Artificial intelligence; Geometry","score_opus":0.019174590125179785,"score_gpt":0.25854840263300716,"score_spread":0.23937381250782738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499353052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01653576,0.0006472792,0.9740918,0.0001500435,0.000065818,0.00016575595,0.0008629748,0.002814036,0.0046665524],"genre_scores_gemma":[0.10062431,0.00056966353,0.8899335,0.000080594924,0.000050177143,0.00027146158,0.0027213735,0.0006184441,0.0051304004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995627,0.000087506174,0.000035675013,0.00008274645,0.00016375659,0.00006770515],"domain_scores_gemma":[0.9990121,0.0005150721,0.00006790304,0.00020097164,0.00015238358,0.000051527673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036996332,0.0007658945,0.0011565803,0.0017179039,0.000767182,0.0013732217,0.0017095227,0.0010461292,0.008141576],"category_scores_gemma":[0.002335037,0.00059380237,0.0007021858,0.0038022522,0.0006312161,0.0027322033,0.001352624,0.0015266285,0.002020947],"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.0006234891,0.0003116512,0.000901273,0.0010644849,0.00007565997,0.00025012976,0.00052098144,0.15724392,0.02019163,0.17439532,0.04558713,0.5988343],"study_design_scores_gemma":[0.00011735774,0.00016443332,0.00040165597,0.000068620844,0.000044049797,0.00020335465,0.00014655049,0.8539368,0.007348043,0.11503543,0.022498159,0.000035469347],"about_ca_topic_score_codex":0.0036684233,"about_ca_topic_score_gemma":0.006616549,"teacher_disagreement_score":0.008141576,"about_ca_system_score_codex":0.0007963747,"about_ca_system_score_gemma":0.00084738934,"threshold_uncertainty_score":0.027236283},"labels":[],"label_agreement":null},{"id":"W1499357662","doi":"10.1007/978-3-540-69057-3_77","title":"On Suturing Simulation with Haptic Feedback","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","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":"Simon Fraser University","funders":"","keywords":"Haptic technology; Computer science; Desk; Wound closure; Fibrous joint; Simulation; Computation; Algorithm; Surgery; Wound healing","score_opus":0.014381471888158625,"score_gpt":0.21138785678241032,"score_spread":0.19700638489425168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499357662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026778424,0.002024875,0.877968,0.00029975254,0.00032255045,0.00008147831,0.00017509532,0.0011108438,0.0912389],"genre_scores_gemma":[0.5859457,0.0056866696,0.32304806,0.00026151547,0.00022007363,0.00019582231,0.00075314014,0.0009758633,0.08291305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999858,0.000034530112,0.0000073913807,0.000021051104,0.000065789005,0.00001317028],"domain_scores_gemma":[0.9997328,0.00017905365,0.000010862955,0.0000392956,0.000027494456,0.000010422202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015961184,0.00073877245,0.00064231444,0.0003692202,0.0003386942,0.00062412664,0.0009824609,0.0007201099,0.012716731],"category_scores_gemma":[0.00067603996,0.00031160202,0.0005721625,0.00040011512,0.0006112156,0.00074446155,0.0011270049,0.00069779565,0.0013162399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017967464,0.00009669934,0.0003522035,0.00035955207,0.0000369444,0.00032938784,0.00019025682,0.7241446,0.022411097,0.08590875,0.00504596,0.16094491],"study_design_scores_gemma":[0.000022105045,0.000075126736,0.00027932486,0.00006416034,0.000014663407,0.00019740268,0.000028269953,0.92101485,0.0071089063,0.053948574,0.01722679,0.000019814175],"about_ca_topic_score_codex":0.0012581844,"about_ca_topic_score_gemma":0.00080739387,"teacher_disagreement_score":0.012716731,"about_ca_system_score_codex":0.00024079709,"about_ca_system_score_gemma":0.00019482113,"threshold_uncertainty_score":0.042541742},"labels":[],"label_agreement":null},{"id":"W1499381808","doi":"10.1007/978-3-540-69311-6_20","title":"Searching Trees with Sources and Targets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Monotonic function; Clearance; Set (abstract data type); Search problem; Computer science; Tree (set theory); Time complexity; Search algorithm; Search tree; Combinatorics; Mathematics; Theoretical computer science; Algorithm","score_opus":0.017028414232843833,"score_gpt":0.2362092110254312,"score_spread":0.21918079679258734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499381808","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.022350727,0.0019823313,0.9381065,0.00072972436,0.00015735455,0.000063190666,0.00081332447,0.0018561385,0.03394071],"genre_scores_gemma":[0.15054993,0.00210093,0.8180696,0.00024495725,0.00010917672,0.00013498364,0.0020307621,0.0011304187,0.02562921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960726,0.000079395744,0.00002647796,0.00009545806,0.00014685525,0.000044631284],"domain_scores_gemma":[0.9986268,0.00095847226,0.000056247205,0.00018255354,0.00012337769,0.000052591717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005521044,0.0005972625,0.00092731783,0.0010285048,0.0006939026,0.0016792056,0.0013652075,0.0016049884,0.01002832],"category_scores_gemma":[0.004755793,0.0007736466,0.0008047409,0.00216739,0.0006724602,0.0038931447,0.0019625812,0.0018888931,0.0048563113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028982072,0.00012780887,0.0009623413,0.0009271244,0.00007823671,0.00027488708,0.0005726167,0.07685913,0.009172923,0.31125695,0.043285914,0.5561922],"study_design_scores_gemma":[0.00006400644,0.00009837836,0.00028600465,0.00018415466,0.00008098583,0.00062129175,0.00020742576,0.2731194,0.008311583,0.6726261,0.044364195,0.000036492453],"about_ca_topic_score_codex":0.0005351227,"about_ca_topic_score_gemma":0.0012908396,"teacher_disagreement_score":0.01002832,"about_ca_system_score_codex":0.00043253312,"about_ca_system_score_gemma":0.00055491587,"threshold_uncertainty_score":0.033548117},"labels":[],"label_agreement":null},{"id":"W1499397298","doi":"10.1007/11861201_55","title":"Improved Cell-DEVS Models for Fire Spreading Analysis","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"DEVS; Computer science; Distributed computing; Real-time computing; Modeling and simulation; Simulation","score_opus":0.06251531018319277,"score_gpt":0.34717437211217667,"score_spread":0.2846590619289839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499397298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028846735,0.0010902529,0.94828993,0.0006003787,0.00028289622,0.00006448348,0.00061994174,0.0005788512,0.019626603],"genre_scores_gemma":[0.77838206,0.0018663778,0.17295565,0.00046511434,0.00041088887,0.00049559603,0.00105324,0.0009206459,0.043450445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996315,0.000112616995,0.000019759913,0.000042307034,0.00012584018,0.0000678875],"domain_scores_gemma":[0.9978795,0.001243457,0.00014024752,0.00017008529,0.00045116857,0.00011549425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010597864,0.0010560423,0.0020705163,0.0010299064,0.00082987617,0.0015103804,0.003900912,0.0026693628,0.0073884414],"category_scores_gemma":[0.0045726225,0.00084891194,0.0018033553,0.0013274482,0.00087640254,0.0017433654,0.0012304948,0.0025920146,0.0015834656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019266552,0.000017150873,0.00014814002,0.000023462973,0.000018176936,0.00003640437,0.000028641285,0.96768874,0.00059586245,0.027332304,0.0006506212,0.003441266],"study_design_scores_gemma":[0.0000023703883,0.0000016291953,0.00001476118,0.0000015307676,0.0000033156564,0.000004654101,0.0000017998325,0.9966342,0.00006012097,0.003041248,0.00023199544,0.000002406486],"about_ca_topic_score_codex":0.017271616,"about_ca_topic_score_gemma":0.01152552,"teacher_disagreement_score":0.017271616,"about_ca_system_score_codex":0.001769075,"about_ca_system_score_gemma":0.0011912391,"threshold_uncertainty_score":0.03434217},"labels":[],"label_agreement":null},{"id":"W1499400216","doi":"10.1007/978-3-540-74260-9_17","title":"Automatic Closed Edge Detection Using Level Lines Selection","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Enhanced Data Rates for GSM Evolution; Pattern recognition (psychology); Edge detection; Probabilistic logic; Selection (genetic algorithm); Line (geometry); Set (abstract data type); Reduction (mathematics); Curvature; Flexibility (engineering); Algorithm; Image (mathematics); Image processing; Mathematics; Statistics","score_opus":0.06129480763329023,"score_gpt":0.32126037504094146,"score_spread":0.2599655674076512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499400216","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.0229601,0.00030850523,0.9690327,0.000055540077,0.00005914342,0.00008563891,0.00014756688,0.0055546835,0.0017961047],"genre_scores_gemma":[0.109747514,0.00032244276,0.8829955,0.00011598721,0.00005929665,0.00010027179,0.0007796528,0.0011326359,0.0047466923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936837,0.000058121987,0.000030314237,0.00016487861,0.00030134706,0.00007713524],"domain_scores_gemma":[0.99898833,0.00030504764,0.00008835364,0.00015786696,0.0003848709,0.000075510194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005475737,0.0011620396,0.0014188692,0.0026850596,0.0005662625,0.0016404798,0.0017432517,0.001199705,0.007861135],"category_scores_gemma":[0.0010793149,0.0008618458,0.00086068944,0.0015485274,0.00047366574,0.0014103934,0.0011589719,0.000959431,0.004183962],"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.0004786949,0.00016320203,0.0008783204,0.00021865772,0.00004711254,0.00021431524,0.00008213611,0.003900976,0.25177747,0.002106788,0.005720163,0.73441213],"study_design_scores_gemma":[0.00011119915,0.00043448087,0.005101126,0.00007568428,0.00016195528,0.0013337759,0.00010851211,0.5532536,0.4169552,0.006320107,0.016045608,0.00009877513],"about_ca_topic_score_codex":0.00072480715,"about_ca_topic_score_gemma":0.0013751502,"teacher_disagreement_score":0.007861135,"about_ca_system_score_codex":0.00027207314,"about_ca_system_score_gemma":0.00051584333,"threshold_uncertainty_score":0.026298106},"labels":[],"label_agreement":null},{"id":"W1499475083","doi":"10.1007/3-540-44849-7_26","title":"Nearly Bounded Error Probabilistic Sets","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Connection (principal bundle); Time complexity; Probabilistic logic; Bounded function; Complexity class; Discrete mathematics; Class (philosophy); Combinatorics; Randomized algorithm; Cryptography; Polynomial; Probabilistic analysis of algorithms; Computer science; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.02953993998092934,"score_gpt":0.2593161153289079,"score_spread":0.22977617534797856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499475083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022669349,0.0014469526,0.90371364,0.0022112494,0.0003960146,0.00008058755,0.00060509384,0.0009703182,0.06790672],"genre_scores_gemma":[0.6266916,0.002460273,0.28304696,0.0018177968,0.0010408683,0.00056256546,0.00216522,0.0013241494,0.08089063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949443,0.0010892992,0.00020244373,0.000842452,0.0025869338,0.00033454606],"domain_scores_gemma":[0.98044854,0.011899176,0.000814621,0.00487711,0.0013794198,0.0005811566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034539783,0.0014804967,0.0021333394,0.0016763278,0.0017212033,0.0038830948,0.0035654658,0.0025377136,0.01260034],"category_scores_gemma":[0.029786775,0.0013385734,0.0013399088,0.00228727,0.0038895297,0.0072230496,0.00896081,0.006371656,0.0028510697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012225292,0.000023157296,0.0002460268,0.00010295003,0.000026455467,0.000036427267,0.00008202672,0.03314635,0.00097245467,0.9320892,0.004623964,0.0285288],"study_design_scores_gemma":[0.000010681863,0.000018712582,0.00013807949,0.000025957906,0.000010483992,0.00007231341,0.000016785996,0.07682985,0.0011011718,0.9172256,0.004537552,0.000012814813],"about_ca_topic_score_codex":0.0007777487,"about_ca_topic_score_gemma":0.0006868136,"teacher_disagreement_score":0.01260034,"about_ca_system_score_codex":0.0026398846,"about_ca_system_score_gemma":0.0011157426,"threshold_uncertainty_score":0.042152286},"labels":[],"label_agreement":null},{"id":"W1499620523","doi":"10.1007/3-540-36574-5_7","title":"Full-Text Indexes in External Memory","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Memory Processes and Influences","field":"Neuroscience","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.028363827441965406,"score_gpt":0.2642956418422866,"score_spread":0.23593181440032118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499620523","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134460265,0.01983552,0.34881958,0.0019388329,0.0039966893,0.00016473338,0.001681207,0.005041719,0.6050756],"genre_scores_gemma":[0.11217983,0.014341638,0.13437153,0.0005539631,0.0025482206,0.00018645302,0.0035709308,0.0033014026,0.728946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995946,0.00007324343,0.000048817543,0.000052089348,0.00019149604,0.000039744667],"domain_scores_gemma":[0.9983354,0.00072300236,0.00008024053,0.00042416644,0.0003579024,0.0000793085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005519844,0.0009413639,0.0008298521,0.0021666393,0.00087446516,0.004992305,0.0014118301,0.00065698556,0.06376465],"category_scores_gemma":[0.0042870925,0.0003581726,0.00032364312,0.004802591,0.0011831496,0.010945506,0.0016586384,0.0009840656,0.026070014],"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.00010400816,0.000051237523,0.00013696097,0.0004992059,0.000013254201,0.00013794372,0.00038504336,0.0012006784,0.0028524464,0.3861757,0.078416444,0.5300271],"study_design_scores_gemma":[0.000017687795,0.000040221297,0.00025705286,0.00023327093,0.000024543633,0.0003480596,0.0001658745,0.003403376,0.007150893,0.41316518,0.5751686,0.000025229589],"about_ca_topic_score_codex":0.00048104432,"about_ca_topic_score_gemma":0.0006336132,"teacher_disagreement_score":0.06376465,"about_ca_system_score_codex":0.0007521818,"about_ca_system_score_gemma":0.0005895574,"threshold_uncertainty_score":0.213314},"labels":[],"label_agreement":null},{"id":"W1499800862","doi":"10.1007/3-540-45637-6_4","title":"Extracting Keyphrases from Spoken Audio Documents","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"National Research Council Canada","funders":"","keywords":"Computer science; Utterance; Natural language processing; Speech recognition; Artificial intelligence; Robustness (evolution); Transcription (linguistics); Word error rate; Linguistics","score_opus":0.01822006719168502,"score_gpt":0.2707262638742662,"score_spread":0.2525061966825812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499800862","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.21449472,0.007495635,0.7286061,0.00048471856,0.0010015371,0.00085453654,0.01101413,0.021672582,0.014376085],"genre_scores_gemma":[0.34968835,0.0051382403,0.60003996,0.00013287908,0.0005587082,0.00037017427,0.017469347,0.0013253101,0.025276998],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995442,0.000033932836,0.000047013775,0.00014167797,0.00014978468,0.00008327913],"domain_scores_gemma":[0.9988242,0.00044939556,0.00012178957,0.00014183756,0.00038159793,0.000081173464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026797754,0.0015556063,0.0010313679,0.0032894053,0.00060357014,0.0016832215,0.0007393682,0.0010193484,0.01163925],"category_scores_gemma":[0.0019239454,0.00047806112,0.0008215393,0.0027271565,0.00040099834,0.0018460749,0.00097448146,0.0008286238,0.019242298],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007339625,0.00005613338,0.000771887,0.00077563117,0.00003523712,0.00083773036,0.00024557143,0.0005795102,0.36766124,0.00092485955,0.0050455984,0.6223327],"study_design_scores_gemma":[0.00035396437,0.0016093048,0.026200203,0.0003570278,0.0007418382,0.007942563,0.003343604,0.09566601,0.7446875,0.0081321485,0.11074643,0.000219393],"about_ca_topic_score_codex":0.0020677655,"about_ca_topic_score_gemma":0.0030409822,"teacher_disagreement_score":0.01163925,"about_ca_system_score_codex":0.00037590344,"about_ca_system_score_gemma":0.0007085017,"threshold_uncertainty_score":0.03893715},"labels":[],"label_agreement":null},{"id":"W1499827776","doi":"10.1007/978-3-540-45216-4_37","title":"Narrative Thought in Childhood and Adolescence Hierarchical Models of Story Composition and Interpretation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Identity, Memory, and Therapy","field":"Psychology","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":"Royal College of Physicians and Surgeons of Canada; Holland College; University of Calgary","funders":"","keywords":"Narrative; Interpretation (philosophy); Composition (language); Psychology; History; Developmental psychology; Literature; Art; Linguistics; Philosophy","score_opus":0.012493988036672768,"score_gpt":0.2700086667847159,"score_spread":0.2575146787480431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499827776","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.6080757,0.0038667675,0.18181823,0.0017592926,0.000027408556,0.0001586899,0.00035778552,0.0002941363,0.20364207],"genre_scores_gemma":[0.97692955,0.00039040743,0.018319603,0.000013470655,0.000004870747,0.00006076221,0.00012887659,0.00003159917,0.0041207606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00044382978,0.000036859914,0.00011417225,0.00009720569,0.00007677476],"domain_scores_gemma":[0.9968811,0.0018309044,0.00039784587,0.00034585412,0.00030085232,0.00024337799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014205424,0.00037872724,0.00025494274,0.001129288,0.00095979444,0.004896952,0.001070825,0.00068225246,0.0041261506],"category_scores_gemma":[0.0058007827,0.0006898876,0.0005240149,0.0009887391,0.003568667,0.0050612707,0.0012114114,0.0016833375,0.0004276995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010114155,0.000084400526,0.009030971,0.000054620552,0.000019525658,0.00024303331,0.046532437,0.0044458103,0.0007357632,0.91531914,0.0005748066,0.022858275],"study_design_scores_gemma":[0.00003715983,0.00010579492,0.025066735,0.00022887014,0.000053117084,0.0006189638,0.026400246,0.06766963,0.0013898546,0.864002,0.014382615,0.00004504666],"about_ca_topic_score_codex":0.006462837,"about_ca_topic_score_gemma":0.0065009,"teacher_disagreement_score":0.006462837,"about_ca_system_score_codex":0.0018317698,"about_ca_system_score_gemma":0.0015602435,"threshold_uncertainty_score":0.013803363},"labels":[],"label_agreement":null},{"id":"W1499845837","doi":"10.1007/978-3-642-25011-8_26","title":"Hamilton Cycles in Restricted Rotator Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Combinatorics; Notation; Graph; Computer science; Cayley graph; Discrete mathematics; Hamiltonian path; Mathematics; Arithmetic","score_opus":0.02086592338687279,"score_gpt":0.23152830313070044,"score_spread":0.21066237974382765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499845837","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.3659005,0.007376483,0.23922238,0.0010237884,0.00072655577,0.00031973806,0.0008589468,0.00096722844,0.38360432],"genre_scores_gemma":[0.79988885,0.006695352,0.058121692,0.00045642856,0.00038177698,0.0004374084,0.0010278461,0.00047595816,0.13251464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980265,0.00006180752,0.000011080496,0.000041953608,0.000049125087,0.000033471115],"domain_scores_gemma":[0.9996025,0.00018908684,0.000056856632,0.00005491323,0.00005401462,0.000042732056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018602062,0.000488656,0.0005437904,0.0010306804,0.00067597395,0.0009516834,0.0006965602,0.00052571815,0.009579412],"category_scores_gemma":[0.0010772962,0.00048382604,0.0004251054,0.001224519,0.000761624,0.0012667859,0.0006911423,0.0008204041,0.0013075449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087480796,0.00003128423,0.00018016623,0.0002690438,0.000023570883,0.00016518074,0.00027029423,0.008830029,0.0048447736,0.93079156,0.007943919,0.046562646],"study_design_scores_gemma":[0.000040427374,0.000040983105,0.00024584308,0.000040979117,0.000019703102,0.00017106695,0.00009129932,0.012078459,0.0011396493,0.9696305,0.016481418,0.000019627225],"about_ca_topic_score_codex":0.0010313729,"about_ca_topic_score_gemma":0.0016979252,"teacher_disagreement_score":0.009579412,"about_ca_system_score_codex":0.00047268294,"about_ca_system_score_gemma":0.0003360507,"threshold_uncertainty_score":0.032046378},"labels":[],"label_agreement":null},{"id":"W1499937701","doi":"10.1007/11817963_18","title":"Yasm: A Software Model-Checker for Verification and Refutation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Model checking; Programming language; Spurious relationship; Abstraction; Property (philosophy); Software; Counterexample; Software verification; Witness; Formal verification; Theoretical computer science; Software engineering; Software development; Software construction; Machine learning; Discrete mathematics","score_opus":0.03178816741151441,"score_gpt":0.28496566486327407,"score_spread":0.25317749745175966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499937701","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044089914,0.00021253375,0.9602387,0.00020429464,0.00017442097,0.00011527016,0.00060205976,0.03002555,0.0040181247],"genre_scores_gemma":[0.11209478,0.00044286912,0.8632348,0.00051695976,0.00009253537,0.00035789807,0.0023426234,0.0074320873,0.013485341],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967135,0.00083828886,0.00025222558,0.00041357122,0.001500812,0.00028157528],"domain_scores_gemma":[0.99687517,0.0013049117,0.00022129719,0.0009948023,0.0005411871,0.00006258575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445204,0.001582281,0.0012170196,0.0016278017,0.0007224993,0.0017930936,0.0033984613,0.0016487766,0.009813528],"category_scores_gemma":[0.0071699983,0.0015562855,0.00201057,0.0010415327,0.0012426623,0.0039227232,0.0027490782,0.0026989896,0.004459927],"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.00093752175,0.0004692721,0.0025529924,0.0019457013,0.0004018731,0.0005836175,0.00042159157,0.105193205,0.06783504,0.2073427,0.09264856,0.51966786],"study_design_scores_gemma":[0.00039171975,0.00019643911,0.00066197524,0.00021551932,0.0003799373,0.00046822662,0.00006162737,0.63919127,0.13093214,0.12874308,0.09862808,0.00013000597],"about_ca_topic_score_codex":0.0022177051,"about_ca_topic_score_gemma":0.0041883034,"teacher_disagreement_score":0.009813528,"about_ca_system_score_codex":0.00082996837,"about_ca_system_score_gemma":0.002533578,"threshold_uncertainty_score":0.032829463},"labels":[],"label_agreement":null},{"id":"W1499966647","doi":"10.1007/978-3-642-16558-0_26","title":"Semantically-Guided Workflow Construction in Taverna: The SADI and BioMoby Plug-Ins","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Paul's Hospital; University of British Columbia","funders":"","keywords":"Workflow; Computer science; Workflow management system; Workflow technology; Web service; Workflow engine; World Wide Web; Windows Workflow Foundation; Plug-in; Software engineering; Service (business); Semantics (computer science); Database; Programming language","score_opus":0.054526094859027055,"score_gpt":0.32392747221295076,"score_spread":0.2694013773539237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499966647","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.0047620074,0.00021610629,0.8956244,0.00031055493,0.00008910866,0.00018170505,0.0009311419,0.09439338,0.0034916692],"genre_scores_gemma":[0.042252015,0.00038482802,0.9272434,0.00033955628,0.000022500488,0.0003339287,0.0052373363,0.01900709,0.0051793978],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833363,0.00040417738,0.00019958016,0.00039536756,0.00047633727,0.00019095065],"domain_scores_gemma":[0.99735224,0.0010840324,0.00011444494,0.0010253033,0.0002501754,0.0001738045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003734354,0.0014823088,0.00133926,0.001531135,0.0014503511,0.00546503,0.0026928177,0.0016676601,0.008620086],"category_scores_gemma":[0.0057142996,0.0024041405,0.0035972565,0.0012617434,0.0016348073,0.004824769,0.005987943,0.004249903,0.006024207],"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.0015306405,0.00072750886,0.004491483,0.002361166,0.00054421264,0.0010845191,0.004530854,0.036253016,0.05606347,0.21201636,0.104169056,0.5762278],"study_design_scores_gemma":[0.00031591108,0.00014034641,0.0016850745,0.00073509204,0.00026931136,0.00091960054,0.0007070524,0.32365012,0.10261353,0.17306565,0.3955872,0.0003110516],"about_ca_topic_score_codex":0.005265815,"about_ca_topic_score_gemma":0.0076733613,"teacher_disagreement_score":0.008620086,"about_ca_system_score_codex":0.0012836325,"about_ca_system_score_gemma":0.0038332683,"threshold_uncertainty_score":0.028837025},"labels":[],"label_agreement":null},{"id":"W1499990806","doi":"10.1007/978-3-642-13059-5_13","title":"A Dynamic Pricing Approach in E-Commerce Based on Multiple Purchase Attributes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"Computer science; Revenue; Dynamic pricing; Reputation; Product (mathematics); Quality (philosophy); Order (exchange); Set (abstract data type); Value (mathematics); Service (business); Contrast (vision); Operations research; Microeconomics; Business; Marketing; Artificial intelligence; Machine learning; Economics","score_opus":0.021052067484887475,"score_gpt":0.22452842542780743,"score_spread":0.20347635794291996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499990806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024926828,0.0006774341,0.96366453,0.0005805646,0.00024350788,0.00008399573,0.00006353452,0.00017707606,0.009582579],"genre_scores_gemma":[0.68999684,0.0011236507,0.29539904,0.00017925508,0.00043826932,0.00012523287,0.00015881256,0.00013127107,0.012447772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981831,0.00068961276,0.00010065933,0.00028530546,0.0005955544,0.00014571588],"domain_scores_gemma":[0.9982027,0.0012716107,0.000054578803,0.00015922368,0.00023805803,0.00007372915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017965809,0.0006609802,0.0018082346,0.0010504884,0.0009349429,0.003172829,0.003000515,0.0013828916,0.0055918656],"category_scores_gemma":[0.0042918012,0.00093178643,0.0013478224,0.0028328975,0.0011244634,0.0061502894,0.0015573343,0.0021759889,0.00069134973],"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.00020090729,0.000527572,0.0013176401,0.0001843354,0.00014122369,0.00053868105,0.0003226378,0.27437207,0.0027980178,0.50770235,0.0037159226,0.20817861],"study_design_scores_gemma":[0.00001781784,0.000032863536,0.00022372729,0.000010636241,0.00003541588,0.00010583712,0.000030570285,0.92302406,0.00026041278,0.07480848,0.0014267641,0.000023490835],"about_ca_topic_score_codex":0.0025855764,"about_ca_topic_score_gemma":0.0027297295,"teacher_disagreement_score":0.0055918656,"about_ca_system_score_codex":0.0011822353,"about_ca_system_score_gemma":0.0008524298,"threshold_uncertainty_score":0.01870668},"labels":[],"label_agreement":null},{"id":"W1500035374","doi":"10.1007/3-540-45153-6_3","title":"A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Association rule learning; Apriori algorithm; Property (philosophy); Data mining; A priori and a posteriori; Computer science; Association (psychology); Psychology; Philosophy","score_opus":0.018131908722941844,"score_gpt":0.2554127638247678,"score_spread":0.23728085510182595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500035374","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.0095915515,0.0004629764,0.9827077,0.00014772065,0.00011075758,0.00012373825,0.00032728032,0.0056396746,0.000888604],"genre_scores_gemma":[0.044226877,0.00015344293,0.9527708,0.000104142004,0.00009641101,0.0001380538,0.0008356036,0.00021826719,0.0014564119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875224,0.00018132711,0.00015379714,0.00030529592,0.0005636906,0.000043708624],"domain_scores_gemma":[0.9931899,0.0033283713,0.00041236152,0.0013768554,0.0015027162,0.00018979714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022140383,0.00073753536,0.0015713495,0.0034723568,0.0007357313,0.0015603475,0.0031615938,0.0008566484,0.003747907],"category_scores_gemma":[0.007419437,0.0007905843,0.00082644704,0.0030206938,0.00046208833,0.0024285065,0.0011325798,0.0014599791,0.0021039927],"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.00036462815,0.00021973302,0.0017637565,0.00014389485,0.00013615028,0.00022063636,0.000099223886,0.003699523,0.01280295,0.0023776311,0.006672933,0.97149897],"study_design_scores_gemma":[0.0006339941,0.0008503997,0.003958384,0.00009220386,0.0006865484,0.004574312,0.00015894385,0.8660646,0.065051034,0.031595152,0.026145246,0.00018919761],"about_ca_topic_score_codex":0.0011631564,"about_ca_topic_score_gemma":0.0021731819,"teacher_disagreement_score":0.003747907,"about_ca_system_score_codex":0.00021554623,"about_ca_system_score_gemma":0.0008758106,"threshold_uncertainty_score":0.012538016},"labels":[],"label_agreement":null},{"id":"W1500074102","doi":"10.1007/978-3-642-16599-3_11","title":"Smart Media: Bridging Interactions and Services for the Smart Internet","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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 Victoria","funders":"","keywords":"Computer science; Bridging (networking); Smart objects; Multimedia; The Internet; Hypermedia; Smart environment; Key (lock); Smart device; Bridge (graph theory); World Wide Web; Perspective (graphical); Internet of Things; Human–computer interaction; Computer security; Artificial intelligence","score_opus":0.025900528423154528,"score_gpt":0.30383176518251276,"score_spread":0.2779312367593582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500074102","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013856899,0.06133292,0.2263575,0.013244723,0.0032996982,0.00012966477,0.00044983136,0.003705896,0.6776229],"genre_scores_gemma":[0.17907868,0.06828007,0.16319908,0.0044906912,0.003601307,0.00030207267,0.0011443379,0.0013961273,0.5785077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996793,0.000067319255,0.000014409409,0.000051448176,0.00013810249,0.00004938775],"domain_scores_gemma":[0.99966204,0.00016175883,0.000018413593,0.000044000415,0.000036871377,0.000076914504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045487558,0.000898642,0.000385907,0.0012917959,0.0008750282,0.0059854514,0.0010419938,0.0021006675,0.025609126],"category_scores_gemma":[0.0008024169,0.00040384365,0.0003432771,0.0015588647,0.0017967229,0.0121981995,0.003379695,0.0017085709,0.00693627],"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.000070320115,0.00005547648,0.0003549985,0.00054283417,0.000021719681,0.00022709485,0.00219051,0.0008340024,0.0063171936,0.4843381,0.102578625,0.40246916],"study_design_scores_gemma":[0.000009735658,0.000036487505,0.0003459729,0.00030272218,0.000019375224,0.00057803676,0.0009994917,0.002903965,0.0021607084,0.11966814,0.8729524,0.000022936922],"about_ca_topic_score_codex":0.0008701423,"about_ca_topic_score_gemma":0.0015944313,"teacher_disagreement_score":0.025609126,"about_ca_system_score_codex":0.0006117582,"about_ca_system_score_gemma":0.0008011814,"threshold_uncertainty_score":0.08567107},"labels":[],"label_agreement":null},{"id":"W1500159001","doi":"10.1007/978-3-642-04146-4_109","title":"Simultaneous Document Margin Removal and Skew Correction Based on Corner Detection in Projection Profiles","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Margin (machine learning); Computer science; Skew; Document image processing; Segmentation; Projection (relational algebra); Artificial intelligence; Computer vision; Arabic; Image segmentation; Document processing; Noise (video); Image (mathematics); Pattern recognition (psychology); Computer graphics (images); Algorithm; Machine learning","score_opus":0.00945532706917567,"score_gpt":0.2380917494291764,"score_spread":0.22863642236000073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500159001","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.050957453,0.00089179346,0.9425791,0.000087384804,0.00019249598,0.000072247836,0.00017857824,0.003239363,0.0018016837],"genre_scores_gemma":[0.22658704,0.00092870183,0.76326853,0.00007182918,0.0001319738,0.00008099837,0.0007195859,0.0005859959,0.007625282],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909925,0.00007382424,0.000042435557,0.00021625948,0.00047054669,0.000097727374],"domain_scores_gemma":[0.99891603,0.00022066064,0.00008460961,0.00028239132,0.00042879884,0.00006746805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238684,0.0012695374,0.0015569606,0.0010601969,0.0005102428,0.0012957206,0.0010580941,0.0009011539,0.0035283659],"category_scores_gemma":[0.0013862672,0.0006962333,0.0008507477,0.0013536176,0.00034421976,0.0018130833,0.0014590904,0.001163597,0.0035036718],"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.0005305973,0.00007213077,0.00073114823,0.00019974893,0.000037028112,0.00013370218,0.0000785175,0.0025287203,0.36442545,0.00059749716,0.0020884227,0.628577],"study_design_scores_gemma":[0.000059038455,0.00048264218,0.008506538,0.00005645482,0.0001837178,0.0019759552,0.00014030762,0.244444,0.7291821,0.0019729706,0.012916774,0.00007942629],"about_ca_topic_score_codex":0.00062602735,"about_ca_topic_score_gemma":0.0012767968,"teacher_disagreement_score":0.0035283659,"about_ca_system_score_codex":0.00020649176,"about_ca_system_score_gemma":0.00076673215,"threshold_uncertainty_score":0.011803508},"labels":[],"label_agreement":null},{"id":"W1500163133","doi":"10.1007/978-3-642-20465-4_16","title":"Secret Keys from Channel Noise","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Alice and Bob; Initialization; Randomness; Channel (broadcasting); Key (lock); Upper and lower bounds; Protocol (science); Verifiable secret sharing; Binary number; Simple (philosophy); Binary symmetric channel; Adversary; Theoretical computer science; Computer network; Computer security; Alice (programming language); Channel capacity; Mathematics; Arithmetic; Set (abstract data type)","score_opus":0.02080767559792113,"score_gpt":0.22384836468297692,"score_spread":0.2030406890850558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500163133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01921934,0.0062472024,0.85279363,0.0020129832,0.0010918317,0.00011818859,0.00029617143,0.0010530378,0.11716766],"genre_scores_gemma":[0.6403404,0.013559496,0.11187206,0.0010657762,0.0013208046,0.0003148317,0.0006712923,0.00080804835,0.23004733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905235,0.00015906025,0.00004019219,0.00012898473,0.0005084359,0.000111085166],"domain_scores_gemma":[0.99874973,0.0006276649,0.00008608478,0.0003754532,0.00012544342,0.000035521763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060769153,0.0010064878,0.00084635644,0.0006645315,0.00065167865,0.0020606853,0.00069428363,0.0012497421,0.008145732],"category_scores_gemma":[0.002808605,0.00057918706,0.0004983216,0.0007983361,0.0021377117,0.004425173,0.0031148337,0.0028441765,0.004361264],"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.00023645279,0.00003411806,0.00012737254,0.0005300604,0.00005243966,0.00039102676,0.0004478411,0.017839747,0.028924866,0.80543524,0.010797274,0.13518354],"study_design_scores_gemma":[0.00004702432,0.00012420643,0.00021033193,0.0002706149,0.00007267976,0.0018382439,0.00012930104,0.04496212,0.05644057,0.79245603,0.103364654,0.00008424506],"about_ca_topic_score_codex":0.00008194394,"about_ca_topic_score_gemma":0.00008605406,"teacher_disagreement_score":0.008145732,"about_ca_system_score_codex":0.00059750216,"about_ca_system_score_gemma":0.0005125793,"threshold_uncertainty_score":0.02725017},"labels":[],"label_agreement":null},{"id":"W1500176645","doi":"10.1007/978-3-642-03798-6_22","title":"Multi-view Object Detection Based on Spatial Consistency in a Low Dimensional Space","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"McGill University","funders":"","keywords":"Pascal (unit); Computer science; Embedding; Artificial intelligence; Object (grammar); Scale-invariant feature transform; Computer vision; Object detection; Pattern recognition (psychology); Consistency (knowledge bases); Set (abstract data type); Cognitive neuroscience of visual object recognition; Space (punctuation); Image (mathematics)","score_opus":0.01563023367646159,"score_gpt":0.2661721916426518,"score_spread":0.2505419579661902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500176645","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028770592,0.00043894217,0.96945065,0.00006087448,0.00004803789,0.000044026252,0.000077758734,0.00045611954,0.000652945],"genre_scores_gemma":[0.33096397,0.00061165367,0.665875,0.00014082731,0.00010432792,0.00007844135,0.00042217766,0.00016848843,0.00163511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876165,0.00015892393,0.00006101092,0.0002873484,0.0005752476,0.00015578911],"domain_scores_gemma":[0.99840766,0.0005103105,0.00019305448,0.00029823944,0.00048170626,0.00010913322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011561183,0.00090017094,0.0018654987,0.0022441978,0.0004294006,0.001852824,0.0016733499,0.0012202023,0.0015361857],"category_scores_gemma":[0.003135681,0.0007684661,0.0009659856,0.0022732022,0.0006841521,0.0020363834,0.00223772,0.0010637033,0.001038967],"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.0012333866,0.00023449253,0.0062576924,0.00036528095,0.0004219948,0.0003685966,0.00016418593,0.027642401,0.3435463,0.0051584723,0.0026540728,0.6119532],"study_design_scores_gemma":[0.000048602164,0.00030189933,0.008931496,0.000032016163,0.00020292969,0.0012511858,0.00009499629,0.882265,0.09933377,0.005203844,0.002261846,0.00007237186],"about_ca_topic_score_codex":0.0015881192,"about_ca_topic_score_gemma":0.0021775332,"teacher_disagreement_score":0.0022441978,"about_ca_system_score_codex":0.0003369178,"about_ca_system_score_gemma":0.0007056204,"threshold_uncertainty_score":0.0061142445},"labels":[],"label_agreement":null},{"id":"W1500221189","doi":"10.1007/3-540-45537-x_4","title":"Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monomial; Boolean function; Bijection; Mathematics; Discrete mathematics; Simple (philosophy); Function (biology); Cryptography; Combinatorics; Algorithm","score_opus":0.021156289696462535,"score_gpt":0.2745474964824746,"score_spread":0.25339120678601207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500221189","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.6060858,0.0030169464,0.16413064,0.004822809,0.0006087771,0.00007007836,0.00037090847,0.00024210778,0.22065192],"genre_scores_gemma":[0.9469199,0.0011820947,0.02133964,0.00043173562,0.0002671553,0.00008370112,0.00016517928,0.00009578634,0.029514726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903464,0.00025521166,0.00004865275,0.00018504978,0.00025147936,0.00022490155],"domain_scores_gemma":[0.9980039,0.0012129631,0.00016314888,0.0002843251,0.000101037665,0.00023468964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012655823,0.0007958251,0.0008856247,0.0013603456,0.0017041529,0.002545833,0.0011027682,0.0012668902,0.0034257388],"category_scores_gemma":[0.0042162263,0.00044958876,0.0005794985,0.0015808473,0.0029385623,0.00467802,0.0029365972,0.0032487062,0.000600961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024275537,0.00006332248,0.00043862636,0.00007900958,0.000013351265,0.00030868166,0.00020723432,0.0035448896,0.0017382837,0.96776885,0.0033669306,0.022228004],"study_design_scores_gemma":[0.000039436214,0.00003936497,0.00035995574,0.000017177663,0.000014069034,0.00037259894,0.00009727513,0.0082517015,0.0014155438,0.983897,0.0054772235,0.000018592302],"about_ca_topic_score_codex":0.0005542596,"about_ca_topic_score_gemma":0.00068207434,"teacher_disagreement_score":0.0034257388,"about_ca_system_score_codex":0.0009751126,"about_ca_system_score_gemma":0.0005775416,"threshold_uncertainty_score":0.011460245},"labels":[],"label_agreement":null},{"id":"W1500240268","doi":"10.1007/11902140_18","title":"Asymptotical Lower Limits on Required Number of Examples for Learning Boolean Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","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 Calgary","funders":"","keywords":"Boolean model; Computer science; Series (stratigraphy); Boolean function; Boolean network; Algorithm; Discrete mathematics; Mathematics","score_opus":0.013347892793487413,"score_gpt":0.24847293969165798,"score_spread":0.23512504689817057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500240268","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.04565854,0.006427755,0.8990244,0.01086209,0.0008099839,0.0002535997,0.0014379655,0.0026942191,0.032831475],"genre_scores_gemma":[0.5259065,0.0067053195,0.41887134,0.006004972,0.003846511,0.00275749,0.004403022,0.0042398283,0.027265016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9832934,0.0053484747,0.0011252471,0.0027779082,0.005953221,0.0015016464],"domain_scores_gemma":[0.6284878,0.33251247,0.005253215,0.019669473,0.009087672,0.0049893786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018852638,0.0035727727,0.0048804265,0.0038130556,0.002476346,0.010003157,0.012099011,0.007831532,0.024766847],"category_scores_gemma":[0.22136787,0.0029518944,0.0037894119,0.0041249986,0.0077158427,0.028601939,0.015296073,0.018216118,0.004208364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029954978,0.00095753325,0.0049039377,0.0025861796,0.0004790891,0.00036432894,0.0008041839,0.20532463,0.011611623,0.5363848,0.032430645,0.20115757],"study_design_scores_gemma":[0.000105886626,0.00012981966,0.0005298554,0.00017117559,0.000089501234,0.00026611265,0.000076858625,0.5358,0.0024758412,0.45820767,0.0020938518,0.000053444033],"about_ca_topic_score_codex":0.0016316109,"about_ca_topic_score_gemma":0.0032060838,"teacher_disagreement_score":0.024766847,"about_ca_system_score_codex":0.0071851495,"about_ca_system_score_gemma":0.0038781383,"threshold_uncertainty_score":0.09970349},"labels":[],"label_agreement":null},{"id":"W1500269013","doi":"10.1007/11907350_34","title":"An Optimal Algorithm for Detecting Pseudo-squares","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Computer science; Algorithm; Quadratic equation; Square (algebra); Plane (geometry); Boundary (topology); Word (group theory); Translation (biology); Time complexity; Mathematics; Geometry","score_opus":0.012223271622770836,"score_gpt":0.2472001122946769,"score_spread":0.23497684067190605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500269013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014055489,0.00017875606,0.9800016,0.00017912297,0.00010953986,0.00013606738,0.00015480364,0.0030313332,0.0021532346],"genre_scores_gemma":[0.05956051,0.00007816561,0.93610203,0.00011970984,0.00004400335,0.00017951733,0.00056927855,0.00026714735,0.0030796896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981797,0.00027899994,0.00014679776,0.00058982696,0.0005909375,0.00021378369],"domain_scores_gemma":[0.99711585,0.0012205299,0.0001455376,0.0006924464,0.00069040887,0.0001352684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922576,0.0016251991,0.0017311367,0.0020074234,0.001319636,0.0021363492,0.0028901196,0.0022819007,0.009930894],"category_scores_gemma":[0.0049555115,0.0009799644,0.0013162794,0.0020595705,0.0010102277,0.0030972885,0.0029748871,0.0013555354,0.003890213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066316954,0.00023917881,0.0013991229,0.0002853658,0.0000846888,0.00013674045,0.00015751868,0.018395927,0.04294338,0.017941065,0.01012816,0.9076258],"study_design_scores_gemma":[0.00039009098,0.00041876963,0.002147265,0.000067290144,0.0001778237,0.0011339706,0.00038348453,0.7966312,0.07214159,0.11043199,0.015960936,0.00011559309],"about_ca_topic_score_codex":0.0015643442,"about_ca_topic_score_gemma":0.0029714182,"teacher_disagreement_score":0.009930894,"about_ca_system_score_codex":0.00085859705,"about_ca_system_score_gemma":0.002158154,"threshold_uncertainty_score":0.03322208},"labels":[],"label_agreement":null},{"id":"W1500269355","doi":"10.1007/978-3-642-54423-1_47","title":"Complexity of Coloring Graphs without Paths and Cycles","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; NP-complete; Discrete mathematics; Brooks' theorem; Time complexity; Chordal graph; Path (computing); Graph; 1-planar graph; Computer science; Graph power; Line graph","score_opus":0.03918416248615249,"score_gpt":0.2926025502794808,"score_spread":0.2534183877933283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500269355","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.540752,0.0027092793,0.29707447,0.01056584,0.0007026012,0.00044566276,0.008020125,0.002039321,0.13769078],"genre_scores_gemma":[0.8494136,0.002770483,0.094371155,0.0011406384,0.0009770029,0.00047671475,0.007907658,0.0014630788,0.04147972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979894,0.0004667867,0.00008277615,0.00047632612,0.0005850642,0.00039956952],"domain_scores_gemma":[0.9852959,0.011405697,0.00064106926,0.0013320522,0.0006023713,0.00072304613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092015404,0.0016764667,0.001569026,0.0011135272,0.0015693838,0.005815216,0.003945287,0.002233764,0.020657798],"category_scores_gemma":[0.0095457025,0.0013152794,0.0020380623,0.002816423,0.002073642,0.009097885,0.0024237495,0.004047597,0.0016509923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010461778,0.00048340802,0.0041191103,0.0013036729,0.00022834787,0.0004152775,0.0009771435,0.18522312,0.009381889,0.6458936,0.055979542,0.09494886],"study_design_scores_gemma":[0.00014534278,0.000041007777,0.0008599214,0.00004604512,0.00007869758,0.00024168103,0.00019041102,0.11403314,0.0018013782,0.87785393,0.0046764426,0.000032005708],"about_ca_topic_score_codex":0.0052902843,"about_ca_topic_score_gemma":0.005538599,"teacher_disagreement_score":0.020657798,"about_ca_system_score_codex":0.0039614947,"about_ca_system_score_gemma":0.002710919,"threshold_uncertainty_score":0.069107234},"labels":[],"label_agreement":null},{"id":"W1500313896","doi":"10.1007/978-3-540-31869-9_14","title":"Fault Tolerance – Concepts and Implementation Issues","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Computer science; Atomicity; Fault tolerance; Software fault tolerance; Redundancy (engineering); Distributed computing; Concurrency; Concurrency control; Software engineering; Consistency (knowledge bases); Programming language; Database transaction; Operating system","score_opus":0.011877467100717786,"score_gpt":0.3002903462113174,"score_spread":0.2884128791105996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500313896","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.0117032835,0.06962581,0.7691168,0.01123871,0.001359921,0.000090093345,0.000096444455,0.00090500107,0.13586389],"genre_scores_gemma":[0.47120684,0.05959986,0.37453106,0.0022563848,0.0029511673,0.0004272048,0.0002688023,0.00056598143,0.08819263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875546,0.00032058707,0.000087972396,0.00016927974,0.00051375956,0.0001529064],"domain_scores_gemma":[0.9985335,0.00070027326,0.00011111942,0.00036140377,0.00024754295,0.000046038196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017688441,0.001006719,0.0008498888,0.0011437279,0.0011904825,0.0055700545,0.004512799,0.0031226836,0.010502626],"category_scores_gemma":[0.0035585673,0.001087247,0.00061602,0.0026531706,0.004332263,0.01058555,0.0012033983,0.004467769,0.0026876172],"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.000015015704,0.000042109652,0.00007700753,0.00024396181,0.000008909109,0.000060587772,0.00030726258,0.0038703985,0.0011614929,0.91116434,0.004931639,0.07811729],"study_design_scores_gemma":[0.000010343861,0.000045524015,0.0001445112,0.00020052871,0.000011314049,0.00042184922,0.00015050122,0.0107552735,0.0018194027,0.9130617,0.07335778,0.000021282496],"about_ca_topic_score_codex":0.0008065707,"about_ca_topic_score_gemma":0.0007278434,"teacher_disagreement_score":0.010502626,"about_ca_system_score_codex":0.0016236239,"about_ca_system_score_gemma":0.000823301,"threshold_uncertainty_score":0.035134792},"labels":[],"label_agreement":null},{"id":"W1500382400","doi":"10.1007/3-540-48071-4_36","title":"DES is not a Group","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Encryption; Plaintext; Set (abstract data type); Exploit; Group (periodic table); Key (lock); Computer science; Mathematics; Plaintext-aware encryption; Theoretical computer science; Combinatorics; Multiple encryption; Deterministic encryption; Computer security; Physics","score_opus":0.04105082075794935,"score_gpt":0.2975688237329249,"score_spread":0.25651800297497557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500382400","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015514014,0.0033514807,0.06016162,0.009339415,0.004597411,0.00008264318,0.0006744815,0.0013694771,0.9049095],"genre_scores_gemma":[0.22222419,0.003664688,0.041044604,0.0034301532,0.001692673,0.00018256008,0.0010103312,0.0007119002,0.72603893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991788,0.000119965705,0.000042593867,0.00023090214,0.00032784996,0.0000998868],"domain_scores_gemma":[0.99904555,0.0002410255,0.00005962137,0.00039317267,0.00019643958,0.00006420458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906105,0.00077533076,0.00066524406,0.00062905793,0.00154972,0.0032431814,0.00057051826,0.0010768863,0.030070497],"category_scores_gemma":[0.0014744203,0.00042679207,0.00046678333,0.0008347204,0.002611543,0.007276019,0.0017147232,0.0025157232,0.020844266],"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.000055242734,0.000015210743,0.00008877677,0.00008612231,0.0000077273535,0.000044386543,0.00016062445,0.00019760312,0.001133001,0.90236324,0.0370421,0.058805913],"study_design_scores_gemma":[0.000011091436,0.000029356057,0.00006482333,0.00002844337,0.000008279057,0.00018961552,0.00005153731,0.0002741192,0.002007331,0.38236332,0.6149614,0.000010656158],"about_ca_topic_score_codex":0.0002983442,"about_ca_topic_score_gemma":0.00041957072,"teacher_disagreement_score":0.030070497,"about_ca_system_score_codex":0.0008376182,"about_ca_system_score_gemma":0.0007887686,"threshold_uncertainty_score":0.10059577},"labels":[],"label_agreement":null},{"id":"W1500411600","doi":"10.1007/978-3-642-15705-9_35","title":"Prostate Brachytherapy Seed Reconstruction Using C-Arm Rotation Measurement and Motion Compensation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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 British Columbia; Queen's University","funders":"National Cancer Institute; Ontario Ministry of Research and Innovation; National Institutes of Health","keywords":"Computer science; Rotation (mathematics); Computer vision; Brachytherapy; Artificial intelligence; Motion compensation; Prostate brachytherapy; Projection (relational algebra); Dosimetry; Computation; Compensation (psychology); Algorithm; Nuclear medicine; Radiation therapy; Medicine; Surgery","score_opus":0.014372701687477125,"score_gpt":0.2671718436203315,"score_spread":0.25279914193285435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500411600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046249114,0.0009569838,0.94544286,0.00020338513,0.00009361512,0.00011791273,0.00026080172,0.0033477515,0.0033275965],"genre_scores_gemma":[0.37221125,0.0005297764,0.6224527,0.00011590149,0.000030497893,0.000075503965,0.000470071,0.0009544655,0.0031599265],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954635,0.00010943237,0.000039159742,0.000086493616,0.00017756071,0.000040961324],"domain_scores_gemma":[0.99936277,0.00018298817,0.000118448384,0.000152953,0.00015116627,0.000031703763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078939117,0.0007605017,0.00061963045,0.0006965695,0.0003083275,0.0010316151,0.0006109227,0.00075854134,0.0028867126],"category_scores_gemma":[0.0026069505,0.00076786807,0.000619088,0.00090376753,0.00018854147,0.0005368694,0.000604633,0.00079589145,0.0011886532],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021242744,0.00017412478,0.006954468,0.00059520267,0.00022255602,0.00026923846,0.00019647628,0.061175924,0.38386205,0.0025431728,0.005673057,0.53620946],"study_design_scores_gemma":[0.00018769594,0.00042537923,0.01831658,0.000093412185,0.00035621694,0.0024251922,0.000052002324,0.6282473,0.33816907,0.0010799349,0.010459852,0.00018735221],"about_ca_topic_score_codex":0.0034469443,"about_ca_topic_score_gemma":0.005137705,"teacher_disagreement_score":0.0034469443,"about_ca_system_score_codex":0.00037093394,"about_ca_system_score_gemma":0.0015020488,"threshold_uncertainty_score":0.009657025},"labels":[],"label_agreement":null},{"id":"W1500494440","doi":"10.1007/11958239_9","title":"Scalar Multiplication on Koblitz Curves Using Double Bases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"Mount Allison University","funders":"","keywords":"Scalar multiplication; Mathematics; Scalar (mathematics); Arithmetic; Pure mathematics; Geometry","score_opus":0.023985346609428474,"score_gpt":0.2582738852571701,"score_spread":0.23428853864774163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500494440","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30599028,0.0055819456,0.25674525,0.0014448325,0.0016090705,0.0001508536,0.0003480823,0.0013138725,0.42681572],"genre_scores_gemma":[0.84461,0.004376698,0.055060327,0.00018935464,0.00070089195,0.00009551252,0.00024892998,0.0004383105,0.09427998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.000073271374,0.00002989643,0.00007413127,0.0001857646,0.00008411852],"domain_scores_gemma":[0.9996879,0.00006925717,0.000042155087,0.0000849747,0.00006167502,0.000054014654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004537933,0.0016435424,0.00086540484,0.0024856557,0.0015124269,0.0025748499,0.0007273316,0.0006984696,0.008588229],"category_scores_gemma":[0.0011370085,0.0006005538,0.0006408692,0.0024430603,0.001832205,0.005346826,0.0022664238,0.0023044432,0.003832893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008784902,0.000038385024,0.00016846636,0.00012354564,0.000014242186,0.00015973943,0.00037602603,0.0016842332,0.005711459,0.9337197,0.0027592878,0.055157024],"study_design_scores_gemma":[0.000028654298,0.00010987846,0.0002778678,0.00006727576,0.000020535606,0.00048716814,0.00011894434,0.0035921715,0.0071466286,0.95860296,0.029501284,0.000046596026],"about_ca_topic_score_codex":0.0002116826,"about_ca_topic_score_gemma":0.0002685827,"teacher_disagreement_score":0.008588229,"about_ca_system_score_codex":0.0007943545,"about_ca_system_score_gemma":0.00039047672,"threshold_uncertainty_score":0.028730452},"labels":[],"label_agreement":null},{"id":"W1500526171","doi":"10.1007/3-540-45153-6_24","title":"User Interface Aspects of a Translation Typing System","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Translation (biology); User interface; Interface (matter); Translation system; Human–computer interaction; User interface design; Natural language processing; Programming language; Operating system","score_opus":0.017240486991445394,"score_gpt":0.26492466269055936,"score_spread":0.24768417569911397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500526171","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.05135551,0.0003736706,0.8681514,0.0008491084,0.0003863863,0.00022177094,0.0004356187,0.044780612,0.033445895],"genre_scores_gemma":[0.59293634,0.0005688994,0.3259173,0.00077151257,0.00036890354,0.00024910015,0.0009658961,0.013949343,0.06427276],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847466,0.00058761553,0.00015834549,0.00013879086,0.00052097696,0.00011961941],"domain_scores_gemma":[0.9964269,0.0020043878,0.000091402115,0.0008362542,0.00049880525,0.0001423957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015231726,0.000779424,0.0008061262,0.00052547513,0.0009830114,0.0046890983,0.0013762678,0.0020467902,0.037665613],"category_scores_gemma":[0.0062884535,0.00082196057,0.0008002064,0.0008087792,0.0007419017,0.0036522457,0.0015806494,0.0012187092,0.008778225],"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.0043745423,0.00041358703,0.0052445475,0.0010106049,0.00015317657,0.005294252,0.009660882,0.007176504,0.18270789,0.12030079,0.058150712,0.60551244],"study_design_scores_gemma":[0.0005351308,0.001126407,0.0051239077,0.00042792707,0.00092599005,0.0075022057,0.0018430233,0.3996489,0.2126434,0.082778156,0.28709948,0.00034545962],"about_ca_topic_score_codex":0.0012989406,"about_ca_topic_score_gemma":0.0011479739,"teacher_disagreement_score":0.037665613,"about_ca_system_score_codex":0.0003189268,"about_ca_system_score_gemma":0.0004196265,"threshold_uncertainty_score":0.12600398},"labels":[],"label_agreement":null},{"id":"W1500529006","doi":"10.1007/978-3-540-25983-1_12","title":"Impreciseness and Its Value from the Perspective of Software Organizations and Learning","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Calgary","funders":"","keywords":"Computer science; Perspective (graphical); Abstraction; Task (project management); Relation (database); Implementation; Software; Artificial intelligence; Value (mathematics); Dependency (UML); Software engineering; Human–computer interaction; Machine learning; Programming language; Data mining; Epistemology; Systems engineering","score_opus":0.011757888619634583,"score_gpt":0.23472208960009924,"score_spread":0.22296420098046466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500529006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07701122,0.04672194,0.40614095,0.082524545,0.0010432624,0.00008822202,0.0004731994,0.00019927777,0.38579738],"genre_scores_gemma":[0.9394227,0.010081211,0.038504276,0.0016157749,0.0009899978,0.00010884966,0.00012102961,0.00007920733,0.00907691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943329,0.0027977494,0.0003238905,0.00071163784,0.0015120682,0.00032190795],"domain_scores_gemma":[0.9771574,0.016441245,0.0013989478,0.0032403904,0.001196741,0.0005651319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006562213,0.0006849614,0.0012642491,0.003478611,0.003207957,0.013324414,0.0026873273,0.0051377756,0.0043451167],"category_scores_gemma":[0.020165123,0.00088291254,0.000990658,0.0045526223,0.040943004,0.038313124,0.00564021,0.007462988,0.0004756178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077318045,0.0000064508376,0.0000951113,0.000026218044,0.000008462824,0.00004142401,0.0005814622,0.00087646925,0.000022563161,0.99496883,0.00028925142,0.0030761156],"study_design_scores_gemma":[0.0000020356676,0.0000020500024,0.000033466746,0.000020659007,0.0000037610075,0.000021838767,0.00018734377,0.00042177606,0.00002154364,0.9968656,0.0024163586,0.0000034998786],"about_ca_topic_score_codex":0.0034425538,"about_ca_topic_score_gemma":0.002820296,"teacher_disagreement_score":0.013324414,"about_ca_system_score_codex":0.0047960905,"about_ca_system_score_gemma":0.0025157891,"threshold_uncertainty_score":0.034798205},"labels":[],"label_agreement":null},{"id":"W1500550604","doi":"10.1007/3-540-45068-8_83","title":"A Component-Oriented Framework for the Implementation of Navigational Design Patterns","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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 Victoria","funders":"","keywords":"Computer science; Java; Parameterized complexity; Component (thermodynamics); Software design pattern; Programming language; Design pattern; Web application; Software engineering; Operating system; Algorithm; Software","score_opus":0.02791733450115401,"score_gpt":0.29794043217294985,"score_spread":0.27002309767179583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500550604","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.000589167,0.00010079314,0.99179804,0.00007758148,0.000030823045,0.00012675661,0.00006563778,0.005846342,0.0013649177],"genre_scores_gemma":[0.008508692,0.00027298531,0.9869767,0.000075562406,0.00002033211,0.000287724,0.0004707093,0.0010770966,0.0023102004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997549,0.00054526865,0.0004117162,0.00033846832,0.0009282225,0.00022733431],"domain_scores_gemma":[0.9977914,0.0008167363,0.00014953614,0.00059392746,0.00048873265,0.00015961361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004055865,0.0021374056,0.0012434858,0.0025924079,0.0019002942,0.0065351706,0.0057076467,0.00290131,0.008278387],"category_scores_gemma":[0.0062907366,0.0023622585,0.0027481774,0.002700727,0.0021740184,0.004904,0.002968707,0.004066679,0.0043418747],"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.00024364381,0.00046841864,0.0011167243,0.0012134466,0.00023108555,0.0007252001,0.0022840705,0.02837507,0.020632124,0.4997367,0.027907008,0.41706657],"study_design_scores_gemma":[0.0003015722,0.00023393966,0.00061908434,0.00083919667,0.0005634782,0.001449019,0.00038139502,0.2462636,0.031985722,0.26405233,0.4530295,0.00028119006],"about_ca_topic_score_codex":0.008632394,"about_ca_topic_score_gemma":0.009801113,"teacher_disagreement_score":0.008632394,"about_ca_system_score_codex":0.0013877368,"about_ca_system_score_gemma":0.0033825822,"threshold_uncertainty_score":0.027693987},"labels":[],"label_agreement":null},{"id":"W1500581971","doi":"10.1007/3-540-36180-4_11","title":"Practical Heterogeneous Placeholder Scheduling in Overlay Metacomputers: Early Experiences","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Overlay; Computer science; Scheduling (production processes); Engineering; Operations management; Operating system","score_opus":0.038817340719013764,"score_gpt":0.2770834585089481,"score_spread":0.23826611778993434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500581971","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.6577342,0.001613908,0.3074674,0.0006760171,0.00018913255,0.00020105156,0.00012985631,0.0012186496,0.030769708],"genre_scores_gemma":[0.8927622,0.00051621697,0.10119185,0.000042489686,0.000060711947,0.000034135854,0.00011824311,0.00013341257,0.0051407423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920076,0.00033276743,0.000027709642,0.00010239588,0.0001712027,0.00016517246],"domain_scores_gemma":[0.9978243,0.0010192594,0.000055299442,0.00060774334,0.00024575714,0.0002476896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016532841,0.00044871966,0.0005775537,0.00030438512,0.0011399509,0.0015502956,0.001845432,0.0007247532,0.0047418727],"category_scores_gemma":[0.004072373,0.00030405767,0.0002517147,0.0013491169,0.000673255,0.0018524915,0.0010074044,0.0008056935,0.00056335656],"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.0028442699,0.001667113,0.0061497344,0.00046216024,0.000092070455,0.0009332671,0.0022522097,0.31663376,0.04997289,0.10352144,0.00855027,0.5069208],"study_design_scores_gemma":[0.00042322383,0.0015283799,0.002955741,0.000047699577,0.0001013471,0.00042698276,0.002102589,0.79030377,0.08796704,0.06059575,0.053476114,0.00007135516],"about_ca_topic_score_codex":0.0054107634,"about_ca_topic_score_gemma":0.0049102306,"teacher_disagreement_score":0.0054107634,"about_ca_system_score_codex":0.0010151283,"about_ca_system_score_gemma":0.0009112105,"threshold_uncertainty_score":0.01586318},"labels":[],"label_agreement":null},{"id":"W1500622093","doi":"10.1007/978-3-642-11164-8_100","title":"Evolutionary and Iterative Crisp and Rough Clustering I: Theory","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Saint Mary's University","funders":"","keywords":"Cluster analysis; Rough set; Computer science; Data mining; Medoid; Canopy clustering algorithm; CURE data clustering algorithm; Correlation clustering; Single-linkage clustering; Algorithm; Artificial intelligence","score_opus":0.013991867339433119,"score_gpt":0.24997972367051774,"score_spread":0.23598785633108463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500622093","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.0053777234,0.001350487,0.98791564,0.0003098381,0.00008315965,0.000025843674,0.00003009543,0.00006255461,0.0048445594],"genre_scores_gemma":[0.22890534,0.0030642299,0.75269896,0.00029113106,0.00044195534,0.00027965487,0.00018172654,0.00017032046,0.013966748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805176,0.00067180593,0.00011539724,0.00031202694,0.00073785346,0.00011108594],"domain_scores_gemma":[0.9933343,0.004604564,0.00040888612,0.00073182245,0.0007834278,0.0001369365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00336477,0.00074480753,0.0015532558,0.001834831,0.0011950635,0.00253373,0.003058964,0.0018211337,0.0030591139],"category_scores_gemma":[0.015138384,0.0010491812,0.0018234391,0.0036050002,0.0036055811,0.0035641787,0.0026116623,0.002490969,0.0005443437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024689023,0.000025290708,0.00044693577,0.00014169961,0.000054325723,0.000044792592,0.00024554512,0.11701981,0.0005729453,0.8129912,0.0023446665,0.06608815],"study_design_scores_gemma":[0.0000074741433,0.000028574723,0.0003382775,0.000036201534,0.00002056008,0.00011368197,0.00005093592,0.39709517,0.00045643278,0.59773177,0.004094419,0.00002645905],"about_ca_topic_score_codex":0.0022353258,"about_ca_topic_score_gemma":0.0017944964,"teacher_disagreement_score":0.00336477,"about_ca_system_score_codex":0.0020485616,"about_ca_system_score_gemma":0.001226299,"threshold_uncertainty_score":0.017794847},"labels":[],"label_agreement":null},{"id":"W1500681480","doi":"10.1007/978-3-642-15711-0_2","title":"Fast Random Walker with Priors Using Precomputation for Interactive Medical Image Segmentation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":61,"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":"Precomputation; Computer science; Random walker algorithm; Segmentation; Speedup; Artificial intelligence; Image segmentation; Prior probability; Session (web analytics); Image (mathematics); Computer vision; Algorithm; Bayesian probability; Parallel computing","score_opus":0.009279635495244364,"score_gpt":0.31166758753036866,"score_spread":0.3023879520351243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500681480","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.0022509098,0.0000451484,0.99655414,0.000042074025,0.000015259522,0.000018020573,0.000024076482,0.0006677495,0.00038255207],"genre_scores_gemma":[0.07661999,0.00010667868,0.9198963,0.00006817799,0.000028801718,0.0001477667,0.00021627118,0.0005373509,0.0023786654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939656,0.00021933766,0.000030872023,0.00009182126,0.0002201283,0.000041307743],"domain_scores_gemma":[0.998204,0.001154579,0.00009136521,0.0002825191,0.00020435959,0.000063205334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010215192,0.000770106,0.0011663879,0.00083966635,0.0005221009,0.0010222524,0.0014300123,0.0014589764,0.0067225755],"category_scores_gemma":[0.0044613094,0.0011402962,0.0007051223,0.0012118449,0.0006649652,0.0014250652,0.0016537965,0.0017802089,0.0020297368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061357074,0.0001699866,0.0005414141,0.000227421,0.000086721106,0.00022609191,0.00022661549,0.52421296,0.028693981,0.05221829,0.0062244344,0.38655856],"study_design_scores_gemma":[0.000017359405,0.000017799295,0.000055625325,0.0000054596712,0.0000049967675,0.000036855046,0.0000060372276,0.98483187,0.004051787,0.009616071,0.0013456183,0.00001056071],"about_ca_topic_score_codex":0.0032541566,"about_ca_topic_score_gemma":0.00491117,"teacher_disagreement_score":0.0067225755,"about_ca_system_score_codex":0.00055081473,"about_ca_system_score_gemma":0.0011640792,"threshold_uncertainty_score":0.02248925},"labels":[],"label_agreement":null},{"id":"W1500705686","doi":"10.1007/978-3-540-24840-8_10","title":"The Reconstruction of the Interleaved Sessions from a Server Log","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Computer science; Session (web analytics); Web server; Web mining; Web log analysis software; Markov chain; Data mining; Web service; World Wide Web; The Internet; Machine learning; Static web page","score_opus":0.015170789224130945,"score_gpt":0.2295073547762586,"score_spread":0.21433656555212766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500705686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07650988,0.00023530457,0.9174475,0.0002287719,0.000055425244,0.000056388766,0.0009091065,0.0036342666,0.0009234088],"genre_scores_gemma":[0.57512194,0.0004559987,0.41595265,0.000046005134,0.00009764128,0.00008586371,0.0027936955,0.00055807375,0.004888172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993443,0.00014475439,0.00003421931,0.00012773422,0.00025422615,0.00009473644],"domain_scores_gemma":[0.99678874,0.0014947816,0.00016930979,0.0009354104,0.00043783095,0.00017387318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007537654,0.0006250395,0.0006012279,0.0014647718,0.0003322566,0.0014679051,0.0013101496,0.0011371808,0.0022491063],"category_scores_gemma":[0.0065308507,0.000610263,0.0006535455,0.0016794925,0.0005341155,0.0019738514,0.0008887754,0.0016429301,0.0019698883],"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.0019648946,0.0004868996,0.023028795,0.00036900758,0.00015551134,0.0008005602,0.0011417393,0.14047241,0.052140553,0.020606622,0.008129025,0.75070405],"study_design_scores_gemma":[0.000014688353,0.00005232803,0.003785394,0.000016321148,0.000022763723,0.00020924387,0.00011922948,0.96993744,0.010989037,0.01287097,0.001960702,0.000021842732],"about_ca_topic_score_codex":0.0039487327,"about_ca_topic_score_gemma":0.0044398396,"teacher_disagreement_score":0.0039487327,"about_ca_system_score_codex":0.00030247527,"about_ca_system_score_gemma":0.000993866,"threshold_uncertainty_score":0.007851481},"labels":[],"label_agreement":null},{"id":"W1500724058","doi":"10.1007/11609773_17","title":"Piecewise FIFO Channels Are Analyzable","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"FIFO (computing and electronics); Piecewise; Computer science; Mathematics; Programming language; Mathematical analysis","score_opus":0.029488643427163966,"score_gpt":0.2767743904493601,"score_spread":0.24728574702219613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500724058","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.09283078,0.00074473803,0.83222306,0.00038610495,0.00024797698,0.00008651966,0.00029377083,0.0019344976,0.071252584],"genre_scores_gemma":[0.87725985,0.0012254554,0.08451578,0.0001431988,0.00014431532,0.00015791909,0.00028143774,0.0005338688,0.035738118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946326,0.000065517765,0.000027883925,0.00011237608,0.00020050746,0.00013050681],"domain_scores_gemma":[0.998429,0.0009322991,0.00015657417,0.0002731882,0.00014494518,0.00006388311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189111,0.0008724183,0.0004426917,0.0011797386,0.0008351814,0.0027605586,0.0006879843,0.00074783654,0.0080759525],"category_scores_gemma":[0.0029488588,0.0007662939,0.00063681696,0.00097325206,0.0016161151,0.004250829,0.0011945053,0.0025820092,0.0011091501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016097423,0.000028558872,0.0002580949,0.00011323565,0.00001294862,0.00015772888,0.00023054185,0.009692895,0.009644956,0.9502673,0.0014121033,0.028020734],"study_design_scores_gemma":[0.000027508902,0.000043503016,0.000195164,0.00005273749,0.00005507101,0.00032014374,0.00012202677,0.047378466,0.016530855,0.9223637,0.012874004,0.000036713514],"about_ca_topic_score_codex":0.00060369325,"about_ca_topic_score_gemma":0.00045827864,"teacher_disagreement_score":0.0080759525,"about_ca_system_score_codex":0.00076426537,"about_ca_system_score_gemma":0.00065812044,"threshold_uncertainty_score":0.027016759},"labels":[],"label_agreement":null},{"id":"W1500756752","doi":"10.1007/978-3-540-45160-0_9","title":"Logical Foundation for Updating XML","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Efficient XML Interchange; XML Schema Editor; XML validation; Streaming XML; XML database; Programming language; Document Structure Description; XML; XML framework; XML Encryption; XML Signature; XML Schema (W3C); Information retrieval; World Wide Web","score_opus":0.027729798359938773,"score_gpt":0.2743152278401508,"score_spread":0.246585429480212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500756752","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.0032484492,0.00067303487,0.96253985,0.0021476834,0.00057283667,0.00012059213,0.000590083,0.0042265584,0.025880791],"genre_scores_gemma":[0.12922482,0.0018306854,0.81378436,0.0020511446,0.0014434158,0.00068035536,0.0034630431,0.0027846736,0.04473749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953342,0.001167824,0.00071835966,0.00093821593,0.0014903884,0.0003510787],"domain_scores_gemma":[0.9932075,0.0025339047,0.00033430976,0.0024006823,0.0013103212,0.00021324465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060145864,0.00091007905,0.001080412,0.0034459825,0.0030632813,0.008247319,0.0036520283,0.0023115901,0.016362315],"category_scores_gemma":[0.012645412,0.0021048237,0.0023361503,0.0037488402,0.004701696,0.02089829,0.0054722372,0.0060552885,0.0060507874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000309201,0.000025230282,0.00014161285,0.00009618819,0.00001568692,0.0000678712,0.00030188475,0.00073421927,0.0005927243,0.9555615,0.007866956,0.034565218],"study_design_scores_gemma":[0.00003623038,0.00002811091,0.00010873224,0.0001077781,0.00010761326,0.00017922506,0.00011677767,0.014543623,0.003372275,0.8752904,0.10606592,0.000043403707],"about_ca_topic_score_codex":0.0033027644,"about_ca_topic_score_gemma":0.0029302489,"teacher_disagreement_score":0.016362315,"about_ca_system_score_codex":0.002522751,"about_ca_system_score_gemma":0.0028468093,"threshold_uncertainty_score":0.05473739},"labels":[],"label_agreement":null},{"id":"W1500760075","doi":"10.1007/11926078_43","title":"Web Service Composition Via Generic Procedures and Customizing User Preferences","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Web service; Component (thermodynamics); Exploit; Web modeling; World Wide Web; Service (business); Database; Human–computer interaction","score_opus":0.010716136439927346,"score_gpt":0.21695265667339192,"score_spread":0.20623652023346456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500760075","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.012315847,0.000065632295,0.9801462,0.00006077397,0.000020866206,0.00011626076,0.000022967015,0.0024030535,0.004848412],"genre_scores_gemma":[0.2674735,0.0003549881,0.7181145,0.00020335446,0.000061955056,0.00026736062,0.000278627,0.0018899497,0.011355715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756193,0.00079841365,0.0002164665,0.00038990434,0.0007801282,0.000253243],"domain_scores_gemma":[0.9975921,0.0007747608,0.00013552855,0.0011750364,0.00024017823,0.00008237448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003431508,0.00093347434,0.0011578833,0.0009899739,0.0009444837,0.0019827236,0.0015919572,0.0014981313,0.0025608756],"category_scores_gemma":[0.004913622,0.0008456285,0.0014992208,0.0014495801,0.0017640768,0.0034301255,0.0023680392,0.0020620183,0.0015175475],"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.0006880793,0.0004825147,0.0014299997,0.0004172186,0.00014528868,0.00086502323,0.0017428506,0.0539348,0.104235835,0.37353626,0.0057401275,0.456782],"study_design_scores_gemma":[0.00011260059,0.00018312455,0.0009612111,0.000119477416,0.00027878827,0.0015884491,0.0002616517,0.51405036,0.16015285,0.2619836,0.06014065,0.00016722073],"about_ca_topic_score_codex":0.00093030056,"about_ca_topic_score_gemma":0.0012405124,"teacher_disagreement_score":0.003431508,"about_ca_system_score_codex":0.00067507615,"about_ca_system_score_gemma":0.00095600466,"threshold_uncertainty_score":0.018147826},"labels":[],"label_agreement":null},{"id":"W1500791855","doi":"10.1007/11564751_90","title":"Mechanism Design for Preference Aggregation over Coalitions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Computer science; Mechanism (biology); Preference; Mechanism design; Outcome (game theory); Rationality; Context (archaeology); Mathematical economics; Theoretical computer science; Artificial intelligence; Microeconomics; Mathematics; Economics; Epistemology","score_opus":0.04829329954142331,"score_gpt":0.2607175010341069,"score_spread":0.2124242014926836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500791855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055233245,0.00018463479,0.98990995,0.0002652817,0.000039635474,0.00014070875,0.00006596623,0.00014213596,0.003728383],"genre_scores_gemma":[0.25275397,0.0005619455,0.7383501,0.00019167693,0.00013197039,0.0009113515,0.00036554303,0.00010177653,0.0066316617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908103,0.0048968224,0.0009053676,0.0011548618,0.0016262631,0.000606431],"domain_scores_gemma":[0.9920913,0.004619488,0.00054636144,0.0014984267,0.00081733405,0.00042710977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013044545,0.0011513365,0.0021861691,0.0013288119,0.0015925043,0.005335132,0.0044035586,0.0021277799,0.0060733645],"category_scores_gemma":[0.017776793,0.0015385798,0.0028718603,0.0030954324,0.002187964,0.009748032,0.0047596814,0.0034849108,0.0009356474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014284237,0.00009706915,0.00022628112,0.00028141512,0.00014513997,0.00009789561,0.00040137407,0.045327835,0.0013516321,0.9003203,0.0023375489,0.049270764],"study_design_scores_gemma":[0.00011491339,0.00008874713,0.0000609012,0.000054762568,0.000090068475,0.00015081272,0.00009414381,0.18230599,0.0012664938,0.80986965,0.005871363,0.0000322044],"about_ca_topic_score_codex":0.0008493719,"about_ca_topic_score_gemma":0.0010646898,"teacher_disagreement_score":0.013044545,"about_ca_system_score_codex":0.0021525535,"about_ca_system_score_gemma":0.0020123818,"threshold_uncertainty_score":0.06898701},"labels":[],"label_agreement":null},{"id":"W1500796099","doi":"10.1007/3-540-36151-0_12","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Constant (computer programming); Algorithm; Combinatorics; Approx; Running time; Computer science; Mathematics; Discrete mathematics; Mathematical optimization","score_opus":0.024134354590971633,"score_gpt":0.2595262473964646,"score_spread":0.235391892805493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500796099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010551915,0.0002649267,0.9660384,0.00045901167,0.00012725077,0.00022236632,0.00043175646,0.004079108,0.017825307],"genre_scores_gemma":[0.09157305,0.00017027075,0.89230865,0.00030764905,0.00008673346,0.0005065263,0.0014311937,0.0012322884,0.012383568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864024,0.00030476807,0.00006531888,0.00034140507,0.0004209571,0.00022731879],"domain_scores_gemma":[0.9984995,0.0008039823,0.000077244404,0.00037298794,0.00016991461,0.000076436925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013276044,0.0022937874,0.0022810434,0.0012246385,0.0011448222,0.0025085672,0.0038295137,0.0025718086,0.025243916],"category_scores_gemma":[0.0051205265,0.0010276821,0.0016601533,0.0024808224,0.0011401598,0.003395223,0.003479472,0.003676657,0.007352989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054104865,0.0005187987,0.00057241356,0.00037676896,0.000101866695,0.00018118341,0.0002082437,0.18396568,0.008458475,0.09338838,0.05295555,0.65873164],"study_design_scores_gemma":[0.00025913378,0.00014478837,0.0003431194,0.000045648663,0.000055217508,0.00019312564,0.00008988983,0.8156357,0.0031059333,0.17165574,0.008434324,0.000037414233],"about_ca_topic_score_codex":0.0033300126,"about_ca_topic_score_gemma":0.0060134293,"teacher_disagreement_score":0.025243916,"about_ca_system_score_codex":0.0017635202,"about_ca_system_score_gemma":0.0026009688,"threshold_uncertainty_score":0.08444929},"labels":[],"label_agreement":null},{"id":"W1500810532","doi":"10.1007/978-3-540-73408-6_13","title":"Anonymous k-Show Credentials","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Identity (music); Computer science; Predicate (mathematical logic); Cryptography; Computer security; Internet privacy; Theoretical computer science; Programming language; Physics","score_opus":0.025046910903816996,"score_gpt":0.2666376149516097,"score_spread":0.2415907040477927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500810532","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033646517,0.0008235258,0.39364856,0.004915198,0.0013351053,0.00025968548,0.0014976081,0.0059748283,0.557899],"genre_scores_gemma":[0.656812,0.00095195806,0.04104468,0.00085528137,0.00040995658,0.00017298649,0.000787901,0.0008401653,0.2981251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979652,0.00049825787,0.00009986886,0.00024200336,0.00071348867,0.00048130084],"domain_scores_gemma":[0.9957866,0.001411976,0.00018096824,0.0016900308,0.000592629,0.00033787405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016397131,0.00061254203,0.0006133342,0.00091018097,0.0023620932,0.004244202,0.0012249267,0.0018345226,0.052387886],"category_scores_gemma":[0.0076308707,0.0005580846,0.0005479162,0.0017457878,0.0022451174,0.010410633,0.0040678037,0.0030941572,0.019519992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019717518,0.000060362225,0.0002051205,0.00010067477,0.000008401017,0.00010124032,0.00028594257,0.0012362777,0.0013657712,0.91649187,0.030125882,0.049821246],"study_design_scores_gemma":[0.000040163548,0.000042937336,0.00025079199,0.00007700109,0.000021717125,0.0007074291,0.00013015757,0.007880744,0.007624291,0.7903851,0.19278108,0.000058537684],"about_ca_topic_score_codex":0.00044979024,"about_ca_topic_score_gemma":0.00050467305,"teacher_disagreement_score":0.052387886,"about_ca_system_score_codex":0.0012485726,"about_ca_system_score_gemma":0.001481307,"threshold_uncertainty_score":0.17525494},"labels":[],"label_agreement":null},{"id":"W1500871275","doi":"10.1007/3-540-39963-1_59","title":"Parametric Algorithms for Mining Share Frequent Itemsets","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Association rule learning; Data mining; Classifier (UML); Algorithm; Parametric statistics; Factor (programming language); Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.03667179637015774,"score_gpt":0.2820428196481652,"score_spread":0.24537102327800744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500871275","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.009894482,0.00056464766,0.98759216,0.00015022502,0.000027845634,0.00008666997,0.00023278646,0.0006518412,0.00079937186],"genre_scores_gemma":[0.27147046,0.001384412,0.7197973,0.00013985299,0.0002495629,0.0009658442,0.002720388,0.00027894505,0.002993193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99505746,0.0017080625,0.0005406425,0.0007857619,0.0016327343,0.00027533245],"domain_scores_gemma":[0.9692322,0.021176826,0.0014516208,0.0058664186,0.001952913,0.00031995442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050593764,0.0011762623,0.0029099886,0.0036817188,0.0012239342,0.0030634778,0.005770573,0.0019210358,0.004968332],"category_scores_gemma":[0.04681001,0.0014259905,0.001953796,0.007852887,0.0017075936,0.009655542,0.00500867,0.0030774684,0.0019077238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007579372,0.00042755794,0.004917857,0.00063410786,0.00023292212,0.0002408415,0.00036737166,0.17325857,0.0020724437,0.09126683,0.0064273113,0.71939623],"study_design_scores_gemma":[0.000062964915,0.00020098721,0.0009553045,0.000058202048,0.000067456094,0.00048369027,0.0001784582,0.77323467,0.0014085999,0.21982652,0.0034847793,0.000038295188],"about_ca_topic_score_codex":0.0006846749,"about_ca_topic_score_gemma":0.0008268417,"teacher_disagreement_score":0.005770573,"about_ca_system_score_codex":0.0007762852,"about_ca_system_score_gemma":0.0012674237,"threshold_uncertainty_score":0.026756883},"labels":[],"label_agreement":null},{"id":"W1500940260","doi":"10.1007/978-3-642-04383-3_33","title":"A Localized Algorithm for Target Monitoring in Wireless Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Queen's University","funders":"","keywords":"Wireless sensor network; Computer science; Set (abstract data type); Constant (computer programming); Algorithm; Node (physics); Simple (philosophy); Wireless; Computer network; Telecommunications; Physics","score_opus":0.012718940038278208,"score_gpt":0.23889767872977086,"score_spread":0.22617873869149266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500940260","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.002026112,0.00014877843,0.99711156,0.0000319591,0.000021362814,0.00001649923,0.000008135954,0.000374424,0.000261183],"genre_scores_gemma":[0.114277944,0.0004194314,0.88156855,0.00010714407,0.00007688106,0.0003053925,0.00009677851,0.00013849085,0.0030094208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956423,0.00012105619,0.00002250301,0.000097174765,0.00015651649,0.000038407696],"domain_scores_gemma":[0.99917126,0.00043817572,0.000070246046,0.00012113433,0.00016649476,0.000032618973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074447895,0.00096313935,0.0012250136,0.00072291977,0.0006076785,0.0007971954,0.0017765699,0.0013036937,0.0019361583],"category_scores_gemma":[0.0026517918,0.00047729054,0.0005226603,0.0009462026,0.0007428196,0.0016024688,0.0015456959,0.0011866931,0.00091230037],"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.00032254605,0.00012817881,0.0004552458,0.00018524495,0.000060657254,0.00011075953,0.00015584692,0.35908145,0.026512766,0.017163528,0.0052267737,0.5905971],"study_design_scores_gemma":[0.000026116142,0.000078354744,0.00012701128,0.000009609957,0.000016222935,0.000061182225,0.000014234677,0.988422,0.003700269,0.0061988467,0.0013339197,0.0000121322155],"about_ca_topic_score_codex":0.0010129166,"about_ca_topic_score_gemma":0.0012506519,"teacher_disagreement_score":0.0019361583,"about_ca_system_score_codex":0.0005449124,"about_ca_system_score_gemma":0.0007472678,"threshold_uncertainty_score":0.0064771175},"labels":[],"label_agreement":null},{"id":"W1500951600","doi":"10.1007/11948148_46","title":"Examining Usage Protocols for Service Discovery","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Alberta","funders":"","keywords":"Computer science; Web service; Identifier; Service discovery; Business Process Execution Language; Context (archaeology); WS-I Basic Profile; Matching (statistics); Service (business); World Wide Web; Interface (matter); Information retrieval; Database; Service-oriented architecture; Programming language; Web modeling; Operating system","score_opus":0.029116729293598327,"score_gpt":0.2665581296492417,"score_spread":0.23744140035564337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500951600","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.1853923,0.0016313249,0.73183507,0.0042538084,0.00018901839,0.000317148,0.00031955878,0.0012960671,0.074765734],"genre_scores_gemma":[0.8143946,0.0011958535,0.16856565,0.00019944742,0.00011145877,0.00028116186,0.00046800936,0.0005374124,0.014246403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99299836,0.0035994395,0.0004094382,0.00045845917,0.0019657814,0.00056857034],"domain_scores_gemma":[0.93970454,0.04443424,0.0014198303,0.009414715,0.0044318805,0.0005947877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008835484,0.0005537212,0.0006944276,0.0026198842,0.0022048696,0.005223333,0.0023308217,0.002233916,0.007666586],"category_scores_gemma":[0.05218568,0.0010176474,0.0011770496,0.0040541203,0.0035327275,0.017590458,0.003241645,0.003740618,0.0011395296],"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.0001444999,0.00010798603,0.0032505954,0.00009641893,0.000023574165,0.00018807019,0.0010964044,0.016148718,0.0010571089,0.90796983,0.0021505705,0.06776618],"study_design_scores_gemma":[0.000021545207,0.00006948143,0.0012086648,0.000081739,0.000067641726,0.00036078392,0.0016188839,0.27694023,0.003395693,0.69816077,0.01803857,0.000036020992],"about_ca_topic_score_codex":0.0054441523,"about_ca_topic_score_gemma":0.0038416402,"teacher_disagreement_score":0.008835484,"about_ca_system_score_codex":0.0029057153,"about_ca_system_score_gemma":0.0027839828,"threshold_uncertainty_score":0.04672706},"labels":[],"label_agreement":null},{"id":"W1501132557","doi":"10.1007/978-3-540-87361-7_4","title":"Read Mapping Algorithms for Single Molecule Sequencing Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm; DNA sequencing; Hybrid genome assembly; Reference genome; Sequence assembly; Process (computing); DNA; Biology","score_opus":0.06782760158135125,"score_gpt":0.2683426038553119,"score_spread":0.20051500227396063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501132557","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.00093744847,0.00026452402,0.9895446,0.000039482187,0.0000540596,0.000042909283,0.00046405537,0.008218223,0.00043468366],"genre_scores_gemma":[0.0059194905,0.00024070994,0.98878795,0.000054913427,0.000031006362,0.0001840818,0.002168408,0.0009239665,0.0016895625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989544,0.0002384619,0.0000971871,0.00028759908,0.00036146806,0.000060947208],"domain_scores_gemma":[0.9968394,0.0017104287,0.00014622058,0.0007529796,0.00047917964,0.00007190105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001944868,0.0016748753,0.0012281202,0.0019078836,0.0009204842,0.0018929112,0.0033383856,0.0014498596,0.011240945],"category_scores_gemma":[0.007107087,0.0010398979,0.0013180765,0.0027585418,0.0005102591,0.0024936774,0.0014120714,0.0024405248,0.012277009],"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.00023362225,0.00009236005,0.0006300391,0.00051923457,0.00012031142,0.0001037733,0.00015969425,0.025503036,0.031099042,0.024301955,0.029049316,0.88818765],"study_design_scores_gemma":[0.00010642301,0.0001277355,0.0013035521,0.00014816814,0.0000905049,0.00054848497,0.000114540795,0.65523136,0.076046675,0.2114889,0.054697253,0.00009638029],"about_ca_topic_score_codex":0.00097489526,"about_ca_topic_score_gemma":0.0020534494,"teacher_disagreement_score":0.011240945,"about_ca_system_score_codex":0.00049885036,"about_ca_system_score_gemma":0.0009515284,"threshold_uncertainty_score":0.03760475},"labels":[],"label_agreement":null},{"id":"W1501170577","doi":"10.1007/978-3-540-79456-1_24","title":"Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 Calgary","funders":"","keywords":"Hessian matrix; Generalization; Degree (music); Function (biology); Cubic function; Square (algebra); Cubic form; Discriminant; Mathematics; Mathematical analysis; Combinatorics; Physics; Geometry; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.017077153152911955,"score_gpt":0.24597481594256818,"score_spread":0.22889766278965623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501170577","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.34386536,0.0014772067,0.3354316,0.0013563997,0.0011962226,0.00020408777,0.001824233,0.00407887,0.31056604],"genre_scores_gemma":[0.8445378,0.00055883813,0.092990786,0.000513553,0.0003374863,0.000116817144,0.0015938736,0.0022181903,0.057132646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997557,0.000058738355,0.000012990508,0.000031203886,0.00009139149,0.000049920956],"domain_scores_gemma":[0.999395,0.00019267201,0.0000449783,0.00019617424,0.00012354374,0.000047603105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045311573,0.0004946758,0.0007494761,0.0012906983,0.0011377794,0.0016713899,0.0010634642,0.0005969677,0.02712668],"category_scores_gemma":[0.0024844124,0.00023284573,0.0005466562,0.00127507,0.0011981997,0.0022498663,0.0009073651,0.0012078845,0.003506553],"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.00017798,0.000051588675,0.0004224576,0.00021552674,0.000010029708,0.00018744387,0.00027043192,0.005745588,0.003755714,0.9011988,0.018830301,0.069134064],"study_design_scores_gemma":[0.000045625347,0.000050657447,0.00040114252,0.00005513743,0.00001426192,0.0002985506,0.00016183706,0.034300897,0.0038315891,0.93396443,0.02684046,0.000035449146],"about_ca_topic_score_codex":0.0008520721,"about_ca_topic_score_gemma":0.0011482866,"teacher_disagreement_score":0.02712668,"about_ca_system_score_codex":0.00061750365,"about_ca_system_score_gemma":0.00063038105,"threshold_uncertainty_score":0.09074777},"labels":[],"label_agreement":null},{"id":"W1501199179","doi":"10.1007/978-3-540-31989-4_21","title":"Context-Based Repeated Sequences in Linear Genetic Programming","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Crossover; Computer science; Sequence (biology); Context (archaeology); Representation (politics); Code (set theory); Genetic programming; Phenomenon; Theoretical computer science; Programming language; Artificial intelligence; Genetics; Biology","score_opus":0.017625324479103234,"score_gpt":0.2550294407413274,"score_spread":0.23740411626222416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501199179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02449922,0.00088794157,0.9675364,0.00015849949,0.000074340234,0.000034801982,0.000020987389,0.00013935564,0.006648448],"genre_scores_gemma":[0.44347194,0.00096467434,0.5460132,0.00019339114,0.00014096904,0.0002538698,0.000087261295,0.00016283848,0.00871184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00027396766,0.000017271006,0.000073776646,0.00011014714,0.000031214993],"domain_scores_gemma":[0.99902153,0.0007641383,0.000055282646,0.00005398946,0.0000759485,0.000029120045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077414734,0.00043741654,0.0005956156,0.0005036677,0.0003556686,0.00069737685,0.0013539747,0.0013350747,0.0024520666],"category_scores_gemma":[0.003768617,0.00044068627,0.0004932699,0.0011085849,0.0010060726,0.0010404825,0.00089849054,0.0013532032,0.00039463752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054155036,0.000051948395,0.00031582557,0.00010125583,0.000031923908,0.00010685551,0.00014818223,0.6567063,0.0027534887,0.26369172,0.0009439156,0.07509443],"study_design_scores_gemma":[0.000013830455,0.000036811878,0.00008203738,0.000026450956,0.000009982435,0.00003610721,0.00001685226,0.8620771,0.00053353806,0.13586615,0.0012887266,0.000012372251],"about_ca_topic_score_codex":0.001981352,"about_ca_topic_score_gemma":0.0028623967,"teacher_disagreement_score":0.0024520666,"about_ca_system_score_codex":0.0007025395,"about_ca_system_score_gemma":0.0004107027,"threshold_uncertainty_score":0.00820303},"labels":[],"label_agreement":null},{"id":"W1501200175","doi":"10.1007/978-3-540-30136-3_12","title":"A Tactile Magnification Instrument for Minimally Invasive Surgery","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"Queen's University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Haptic technology; Magnification; Computer science; Surgical instrument; Auditory feedback; Invasive surgery; Computer vision; Artificial intelligence; Tactile sensor; Acoustics; Biomedical engineering; Surgery; Robot; Medicine; Audiology; Physics","score_opus":0.05174908036587226,"score_gpt":0.27147342638173094,"score_spread":0.2197243460158587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501200175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062254824,0.054582153,0.6534646,0.0027727888,0.0037359805,0.00036643053,0.00029756717,0.00344644,0.21907924],"genre_scores_gemma":[0.28401324,0.02981475,0.39248598,0.0019954606,0.0013602312,0.00031646615,0.00030904016,0.0005638255,0.28914118],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983037,0.000010828567,0.000007473453,0.00002054217,0.00011678078,0.000013884305],"domain_scores_gemma":[0.9998617,0.00007164282,0.000010935644,0.000018245577,0.000018703251,0.000018739618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023237821,0.00066262885,0.0003003823,0.00052503607,0.00030628222,0.00042601512,0.00070190313,0.000837785,0.012004658],"category_scores_gemma":[0.00036376552,0.00023577292,0.0004021416,0.00030931676,0.00050076336,0.001033655,0.0008197755,0.0009230513,0.001469191],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001736643,0.00006210217,0.00043612218,0.0005070742,0.000020367363,0.0011836763,0.00019874741,0.00062659575,0.30856267,0.014223225,0.013428072,0.6605777],"study_design_scores_gemma":[0.00012284536,0.0022212572,0.01361402,0.00047075053,0.00013649947,0.06007226,0.00025380123,0.0075307447,0.13329218,0.021019662,0.7610699,0.00019612987],"about_ca_topic_score_codex":0.00010409991,"about_ca_topic_score_gemma":0.00031879274,"teacher_disagreement_score":0.012004658,"about_ca_system_score_codex":0.00014898473,"about_ca_system_score_gemma":0.00028025586,"threshold_uncertainty_score":0.040159523},"labels":[],"label_agreement":null},{"id":"W1501230309","doi":"10.1007/978-3-642-10868-6_14","title":"A New Protocol for the Nearby Friend Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Computer network; Medicine","score_opus":0.022239907320381353,"score_gpt":0.2794544085331996,"score_spread":0.25721450121281825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501230309","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.01609413,0.0009262641,0.90046495,0.0059706084,0.0020395988,0.0009234021,0.0005874739,0.0024979596,0.0704956],"genre_scores_gemma":[0.393151,0.0018145473,0.48599613,0.0036371697,0.0019243849,0.0035000208,0.0016568276,0.0017467731,0.10657314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921256,0.0022034398,0.0005993187,0.0013845138,0.002754376,0.0009328692],"domain_scores_gemma":[0.9841839,0.006545051,0.0008458793,0.005910813,0.0016896062,0.00082474586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005411857,0.0015188328,0.0026486432,0.0022272028,0.0069235866,0.0050894255,0.006434663,0.0066202707,0.017791027],"category_scores_gemma":[0.016384695,0.001407689,0.0023318045,0.002903394,0.0063302265,0.02444679,0.018700961,0.0116608,0.0068347026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004621865,0.00015452928,0.0001816554,0.00026505167,0.00004627137,0.0002585488,0.00087935675,0.0019269141,0.0045001544,0.9023187,0.025705608,0.063300855],"study_design_scores_gemma":[0.00035955483,0.00017390552,0.00014395552,0.00012051057,0.00015269789,0.0008538946,0.00039393964,0.038724404,0.009058439,0.8664521,0.08339396,0.00017264302],"about_ca_topic_score_codex":0.00088624144,"about_ca_topic_score_gemma":0.0008508514,"teacher_disagreement_score":0.017791027,"about_ca_system_score_codex":0.0023258962,"about_ca_system_score_gemma":0.0026469484,"threshold_uncertainty_score":0.059516907},"labels":[],"label_agreement":null},{"id":"W1501230691","doi":"10.1007/978-3-540-24730-2_34","title":"How Vacuous Is Vacuous?","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Property (philosophy); Popularity; Model checking; Theoretical computer science; Variety (cybernetics); Computation; Computer security; Algorithm; Artificial intelligence; Law; Epistemology","score_opus":0.026391721533618972,"score_gpt":0.26721220012821745,"score_spread":0.24082047859459849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501230691","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052793246,0.0052214134,0.108574376,0.041854788,0.0021719798,0.00007415999,0.0009746167,0.0012951561,0.7870402],"genre_scores_gemma":[0.9027296,0.0039338516,0.022077497,0.005079989,0.0011722189,0.00013142993,0.0009256175,0.0015062058,0.06244359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720085,0.0008860456,0.00017888809,0.0005756549,0.0007316157,0.00042699027],"domain_scores_gemma":[0.9948088,0.0027150763,0.0002910773,0.0011029358,0.00082341244,0.00025875325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002620557,0.0005141816,0.001437706,0.0018333966,0.004209767,0.0073943366,0.002328088,0.0032019597,0.021547435],"category_scores_gemma":[0.014251195,0.0009010204,0.00087602093,0.0022577785,0.014369511,0.022202482,0.0040689916,0.005635773,0.004354887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010627848,0.000004841902,0.000077592136,0.000025049545,0.000003394403,0.00004290111,0.00043360167,0.00006256498,0.00007787147,0.99163544,0.003584905,0.0040411404],"study_design_scores_gemma":[0.0000030251078,0.0000017492893,0.000032074164,0.00002334284,0.000003694057,0.00007608157,0.00036330114,0.00014314518,0.000120381104,0.9890003,0.010226644,0.000006281263],"about_ca_topic_score_codex":0.0021833437,"about_ca_topic_score_gemma":0.0018667794,"teacher_disagreement_score":0.021547435,"about_ca_system_score_codex":0.002133308,"about_ca_system_score_gemma":0.0015574545,"threshold_uncertainty_score":0.072083354},"labels":[],"label_agreement":null},{"id":"W1501234213","doi":"10.1007/11821069_2","title":"Tree Exploration with an Oracle","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Oracle; Traverse; Tree (set theory); Tree traversal; Competitive analysis; Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Combinatorics; Artificial intelligence; Upper and lower bounds; Geography","score_opus":0.02826344014817172,"score_gpt":0.25439264767817255,"score_spread":0.22612920753000082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501234213","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.019352902,0.0018480744,0.9175825,0.0008839055,0.00027617227,0.00017055061,0.00077571376,0.0060470696,0.053063042],"genre_scores_gemma":[0.23452304,0.0011756277,0.72511375,0.00036869585,0.00015756734,0.00022771528,0.0016751186,0.0015267968,0.03523171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994916,0.0001392373,0.000031779688,0.00010646828,0.0001656236,0.00006531816],"domain_scores_gemma":[0.9988211,0.0006237495,0.00003129673,0.00036715408,0.000092983566,0.00006368478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530234,0.00061069534,0.0009013192,0.0007058904,0.000438562,0.0012279856,0.0012290792,0.0010772096,0.014601996],"category_scores_gemma":[0.003950267,0.00036809524,0.0008339043,0.0012219376,0.00060448813,0.0030742718,0.002172611,0.0019267886,0.0039254646],"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.00058782817,0.00017574112,0.00066476647,0.0005173586,0.000058357913,0.00019930738,0.00020339817,0.054441165,0.009893319,0.15243712,0.03938929,0.7414324],"study_design_scores_gemma":[0.00012239163,0.00023092901,0.00044895167,0.00019386815,0.00008224269,0.00065175706,0.000086929234,0.5227126,0.011508175,0.40761873,0.056304086,0.000039274553],"about_ca_topic_score_codex":0.00047623593,"about_ca_topic_score_gemma":0.0010588922,"teacher_disagreement_score":0.014601996,"about_ca_system_score_codex":0.0003505268,"about_ca_system_score_gemma":0.00068047846,"threshold_uncertainty_score":0.04884857},"labels":[],"label_agreement":null},{"id":"W1501239440","doi":"10.1007/978-3-642-12239-2_6","title":"Symbiogenesis as a Mechanism for Building Complex Adaptive Systems: A Review","year":2010,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Symbiosis; Mechanism (biology); Mendelian inheritance; Complex adaptive system; Computer science; Operator (biology); Biology; Cognitive science; Evolutionary biology; Computational biology; Artificial intelligence; Epistemology; Genetics; Psychology; Philosophy; Gene","score_opus":0.054019153438797346,"score_gpt":0.3356723315665985,"score_spread":0.2816531781278011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501239440","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022530943,0.9987602,0.00038875235,0.00018685861,0.0000732496,0.000004142987,0.000009047597,0.0000060570374,0.00034635028],"genre_scores_gemma":[0.0017106046,0.9975967,0.00031297698,0.00010402716,0.000108110486,0.0000072015287,0.000017684033,0.0000015991977,0.00014108457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997409,0.00003208102,0.000041537784,0.00007820921,0.00008008069,0.000027098893],"domain_scores_gemma":[0.9991534,0.00040640845,0.00014628269,0.000027546319,0.00019785762,0.00006854863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092063856,0.001070822,0.002262188,0.0022920095,0.00037341684,0.001573931,0.00162043,0.0015638161,0.0014487795],"category_scores_gemma":[0.0013324103,0.00047348588,0.00045273817,0.0030775415,0.0011583263,0.002098884,0.00096866785,0.0013383408,0.0013705656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010084136,0.00008496093,0.0006707148,0.024765117,0.00015619048,0.0002585693,0.000119038836,0.0006997969,0.0034317125,0.007942873,0.010200161,0.9515701],"study_design_scores_gemma":[0.000071221264,0.00030239593,0.0029034617,0.005618993,0.0004548644,0.0031211195,0.00027817982,0.00040500294,0.003407929,0.010672075,0.9726795,0.00008529713],"about_ca_topic_score_codex":0.0011307541,"about_ca_topic_score_gemma":0.0013475715,"teacher_disagreement_score":0.0022920095,"about_ca_system_score_codex":0.0007359939,"about_ca_system_score_gemma":0.0013839831,"threshold_uncertainty_score":0.0053400397},"labels":[],"label_agreement":null},{"id":"W1501261365","doi":"10.1007/3-540-44469-6_71","title":"Design and Implementation of the OLOG Deductive Object-Oriented Database Management System","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; SQL; Data definition language; Deductive database; Relational database; Programming language; Database design; Relational database management system; Query language; Object (grammar); Database; Query by Example; Information retrieval; Artificial intelligence; Web search query","score_opus":0.013128312577857957,"score_gpt":0.25447665151037846,"score_spread":0.2413483389325205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501261365","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.03894901,0.0003623352,0.92695624,0.00046809198,0.00012540327,0.0007116093,0.00036873014,0.022141907,0.009916721],"genre_scores_gemma":[0.15561585,0.0003270644,0.8310635,0.00059804553,0.00005964374,0.00037148403,0.00091525103,0.0009739238,0.01007533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936515,0.00010734594,0.000058510268,0.000106419284,0.00027603563,0.0000866052],"domain_scores_gemma":[0.99933606,0.00020392051,0.000060234885,0.00014059067,0.00018840453,0.00007062502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138918,0.00027094712,0.00040504927,0.00060017704,0.00047119232,0.0024694824,0.002550404,0.00084375555,0.005664338],"category_scores_gemma":[0.0019309986,0.0005411642,0.00033662163,0.00044677276,0.0006093744,0.0012720398,0.00087270513,0.00094821013,0.0017194623],"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.00094587397,0.0011058176,0.0058895242,0.0007858445,0.00014996546,0.0008546718,0.0014338014,0.02707254,0.14541912,0.11215371,0.024431529,0.6797576],"study_design_scores_gemma":[0.0007492533,0.001071674,0.004672934,0.00022030748,0.0003543337,0.0011374061,0.0004985872,0.4568743,0.26034623,0.030536564,0.24338269,0.00015572531],"about_ca_topic_score_codex":0.0020247984,"about_ca_topic_score_gemma":0.0019736728,"teacher_disagreement_score":0.005664338,"about_ca_system_score_codex":0.00071219826,"about_ca_system_score_gemma":0.0016131351,"threshold_uncertainty_score":0.018949151},"labels":[],"label_agreement":null},{"id":"W1501262406","doi":"10.1007/bfb0013455","title":"Local variables and non-interference in algol-like languages","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Queen's University","funders":"","keywords":"Interference (communication); Computer science; Linguistics; Programming language; Telecommunications; Philosophy","score_opus":0.012707897251022868,"score_gpt":0.23855224370296887,"score_spread":0.225844346451946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501262406","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.11748561,0.004430821,0.6992486,0.002813388,0.00071392074,0.000090888876,0.00020300494,0.0024601272,0.17255372],"genre_scores_gemma":[0.8578829,0.001622139,0.09973174,0.0011479044,0.0005074851,0.0002870199,0.00028071622,0.0018381479,0.036701925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695456,0.0012692175,0.00022291238,0.00036839064,0.00071245484,0.00047243145],"domain_scores_gemma":[0.9936777,0.004154193,0.00038282454,0.001011719,0.00052468426,0.0002489116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025352815,0.00083995325,0.0012593475,0.0009975643,0.0031213716,0.006243102,0.0024858355,0.0015953074,0.006528466],"category_scores_gemma":[0.008249039,0.001456477,0.0013322282,0.0019980806,0.0068821874,0.011357618,0.004685541,0.0063890712,0.001443483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040535397,0.000015768665,0.000148552,0.0000608513,0.00000972267,0.00006294744,0.00069151114,0.0006339687,0.0005964861,0.9892358,0.0010035489,0.0075002187],"study_design_scores_gemma":[0.00001704412,0.000013640017,0.000056383164,0.000024001016,0.000014903394,0.00010443947,0.0001319764,0.0025190238,0.001171584,0.98973113,0.0062005403,0.00001527988],"about_ca_topic_score_codex":0.0007709364,"about_ca_topic_score_gemma":0.0009062095,"teacher_disagreement_score":0.006528466,"about_ca_system_score_codex":0.0014248339,"about_ca_system_score_gemma":0.0011094686,"threshold_uncertainty_score":0.021839917},"labels":[],"label_agreement":null},{"id":"W1501287991","doi":"10.1007/978-3-642-27901-0_18","title":"Specification and Verification of Access Control Policies in EB3SEC: Work in Progress","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Access control; Deadlock; Security policy; Control (management); Work (physics); Role-based access control; Data access; Computer security; Mandatory access control; Distributed computing; Database","score_opus":0.034605210951232084,"score_gpt":0.30871447108635647,"score_spread":0.2741092601351244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501287991","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.021204192,0.0017853524,0.960893,0.00091712165,0.000155496,0.0007164299,0.000459175,0.0065178988,0.0073513803],"genre_scores_gemma":[0.21560274,0.0030513932,0.76694757,0.0007129288,0.00019319728,0.000429582,0.003488303,0.0020559917,0.0075182253],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9818357,0.006998394,0.0016699499,0.0014562041,0.0064541246,0.0015855349],"domain_scores_gemma":[0.9706176,0.014059576,0.0012028987,0.008955025,0.0047292886,0.00043570844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016964965,0.001270179,0.0017044725,0.0012856642,0.0010874579,0.008108988,0.0044603567,0.0023409107,0.0072655017],"category_scores_gemma":[0.0221964,0.0014664145,0.0026697041,0.0015559086,0.00301936,0.009038644,0.0041834633,0.004605981,0.0028670293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008286347,0.0010027684,0.006185335,0.0024705173,0.00032057834,0.0007362151,0.0019096322,0.083838396,0.03503475,0.18415411,0.017912218,0.6656068],"study_design_scores_gemma":[0.00021949655,0.0004383386,0.0021108587,0.0009511545,0.0001975713,0.0008635207,0.0009357004,0.6334241,0.11257126,0.15555903,0.092571974,0.00015705139],"about_ca_topic_score_codex":0.010402441,"about_ca_topic_score_gemma":0.004983362,"teacher_disagreement_score":0.016964965,"about_ca_system_score_codex":0.0022559317,"about_ca_system_score_gemma":0.007671045,"threshold_uncertainty_score":0.08972037},"labels":[],"label_agreement":null},{"id":"W1501306102","doi":"10.1007/3-540-40026-5_3","title":"Bounds for Mutual Exclusion with only Processor Consistency","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Consistency (knowledge bases); Sequential consistency; Computer science; Consistency model; Upper and lower bounds; Weak consistency; Type (biology); Corollary; Algorithm; Strong consistency; Data consistency; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Distributed computing; Statistics","score_opus":0.0128336601059376,"score_gpt":0.23772800462850088,"score_spread":0.2248943445225633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501306102","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.017804883,0.0064576846,0.85717934,0.0043836916,0.0017347231,0.00014653793,0.00050724496,0.0023252286,0.10946074],"genre_scores_gemma":[0.7006796,0.004873562,0.23964877,0.0031348832,0.005084656,0.0013643148,0.0008916057,0.0027528869,0.04156984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98810357,0.0028751746,0.00051641057,0.0016340404,0.0046873423,0.002183391],"domain_scores_gemma":[0.93426734,0.04744494,0.0018396986,0.010774445,0.0040123397,0.0016612995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008977445,0.002564097,0.0037533932,0.0032415374,0.0037020752,0.007695425,0.007518426,0.003745008,0.016577344],"category_scores_gemma":[0.049164325,0.00199069,0.002263986,0.003881151,0.005839529,0.0282225,0.0097363945,0.014856215,0.0036588225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040663278,0.00009937131,0.00021584267,0.0002610745,0.000057025085,0.00005188921,0.00027513548,0.019541275,0.0010854938,0.9352931,0.010084949,0.032628328],"study_design_scores_gemma":[0.000036961694,0.00003764788,0.00011335806,0.000076632954,0.000055745226,0.00004600234,0.000028798318,0.05320522,0.0010790394,0.93945163,0.00583907,0.000029891133],"about_ca_topic_score_codex":0.0015428336,"about_ca_topic_score_gemma":0.0015713224,"teacher_disagreement_score":0.016577344,"about_ca_system_score_codex":0.0046691652,"about_ca_system_score_gemma":0.002642628,"threshold_uncertainty_score":0.055456698},"labels":[],"label_agreement":null},{"id":"W1501319685","doi":"10.1007/11550822_83","title":"Image Segmentation Using Watershed Transform and Feed-Back Pulse Coupled Neural Network","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","field":"Engineering","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 Guelph","funders":"","keywords":"Computer science; Artificial intelligence; Watershed; Image segmentation; Artificial neural network; Segmentation; Computer vision; Image (mathematics); Pattern recognition (psychology); Scale-space segmentation; Image fusion","score_opus":0.01085777516486672,"score_gpt":0.2391399182168302,"score_spread":0.22828214305196348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501319685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014230203,0.00015286343,0.9830361,0.000074162825,0.00003980379,0.000049950755,0.00004371378,0.0010946218,0.001278599],"genre_scores_gemma":[0.17765348,0.00028926777,0.8179243,0.000058734197,0.00002641393,0.00007586076,0.00016809495,0.00021327479,0.0035905906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981385,0.000015818836,0.000010943665,0.00005890126,0.00008012549,0.000020335357],"domain_scores_gemma":[0.9997279,0.000087487504,0.000025670135,0.000034856523,0.00010813717,0.000016014217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043148096,0.00060787104,0.0007802931,0.00086830073,0.0004909821,0.0009311084,0.0010096154,0.0011477995,0.001985902],"category_scores_gemma":[0.0008418999,0.00070994603,0.000656594,0.0013800313,0.00052059017,0.0014167501,0.00074060017,0.0008256182,0.0006823995],"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.0002815679,0.00013976159,0.0010626079,0.00028104798,0.00012347227,0.00017514838,0.0001770454,0.18604991,0.15679604,0.008501847,0.002024885,0.64438665],"study_design_scores_gemma":[0.000008972426,0.000026803533,0.00043019644,0.000007633267,0.0000241329,0.000065056636,0.000015748452,0.96136856,0.033992603,0.0030033211,0.0010417533,0.000015161237],"about_ca_topic_score_codex":0.0044769705,"about_ca_topic_score_gemma":0.007824994,"teacher_disagreement_score":0.0044769705,"about_ca_system_score_codex":0.0008024922,"about_ca_system_score_gemma":0.00097048306,"threshold_uncertainty_score":0.0089018345},"labels":[],"label_agreement":null},{"id":"W1501431142","doi":"10.1007/978-3-642-15898-8_7","title":"An Automated Translator for Model Checking Time Constrained Workflow Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Workflow; Model checking; Programming language; Software engineering; Automation; Workflow management system; Modeling language; Formal verification; Database; Software","score_opus":0.019023365164493187,"score_gpt":0.24738895919935824,"score_spread":0.22836559403486506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501431142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049290536,0.00005750995,0.96187145,0.00012416072,0.000110199915,0.0001929314,0.00047062483,0.030779222,0.001464871],"genre_scores_gemma":[0.07231547,0.000120108394,0.9113417,0.00022789047,0.000060510927,0.00041177514,0.0017669041,0.0084928395,0.0052627763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682885,0.0009897475,0.00032337126,0.0006549643,0.00091488316,0.00028823208],"domain_scores_gemma":[0.9927273,0.00425472,0.00036526084,0.0014348954,0.0011018278,0.000116026364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026597993,0.0019302295,0.0017555929,0.0016605962,0.0011975585,0.0027723457,0.0028203267,0.0020434288,0.018056454],"category_scores_gemma":[0.009273663,0.0018838663,0.0032110615,0.0012985559,0.0014747222,0.0035931638,0.003911803,0.0030390944,0.0053899637],"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.0013235606,0.00059148035,0.001555178,0.0019031119,0.0003470157,0.0022724003,0.001542119,0.13241273,0.07160887,0.08553931,0.05259682,0.6483074],"study_design_scores_gemma":[0.00034077064,0.00031655811,0.00030938006,0.00024614055,0.00022085749,0.00058689644,0.00027320915,0.80025923,0.068127975,0.08984867,0.039325595,0.0001446656],"about_ca_topic_score_codex":0.0029463924,"about_ca_topic_score_gemma":0.0034626022,"teacher_disagreement_score":0.018056454,"about_ca_system_score_codex":0.000999776,"about_ca_system_score_gemma":0.0025311294,"threshold_uncertainty_score":0.060404837},"labels":[],"label_agreement":null},{"id":"W1501435398","doi":"10.1007/978-3-642-14785-2_13","title":"iCCA-MAP Versus MCL and Dual MCL: Comparison of Mobile Node Localization Algorithms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Carleton University","funders":"","keywords":"Computer science; Node (physics); Probabilistic logic; Wireless sensor network; Algorithm; Real-time computing; Dual (grammatical number); Computer network; Artificial intelligence; Engineering","score_opus":0.013610512968757652,"score_gpt":0.25004378138182554,"score_spread":0.2364332684130679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501435398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15225907,0.014480462,0.79962885,0.0012616407,0.0011228138,0.00030669157,0.0016780145,0.009124429,0.020138014],"genre_scores_gemma":[0.575835,0.002961745,0.40953612,0.0002616514,0.00022107788,0.00020180797,0.002482696,0.0007411791,0.007758633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971464,0.00089173263,0.00013167279,0.0003983453,0.0011322463,0.00029955883],"domain_scores_gemma":[0.9894493,0.0058324835,0.00047465347,0.001093852,0.002763393,0.00038629002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030435363,0.0012216892,0.0018831051,0.002603438,0.0006374187,0.0026678413,0.0027488403,0.0018492619,0.0057144053],"category_scores_gemma":[0.015697798,0.00044327465,0.0006127044,0.0038278585,0.00059699017,0.0027393587,0.0026657027,0.0011224567,0.0016851536],"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.0065430473,0.00036208905,0.0046026227,0.0009819416,0.00047051455,0.00008138632,0.0001658314,0.17827979,0.0045218575,0.0072126137,0.015861137,0.78091705],"study_design_scores_gemma":[0.00023213461,0.0008548274,0.002632012,0.00008422108,0.00020544324,0.00037239835,0.00028591248,0.98121727,0.0049234373,0.0041260463,0.005006023,0.00006021685],"about_ca_topic_score_codex":0.006929005,"about_ca_topic_score_gemma":0.009589256,"teacher_disagreement_score":0.006929005,"about_ca_system_score_codex":0.00133333,"about_ca_system_score_gemma":0.0020656502,"threshold_uncertainty_score":0.01911664},"labels":[],"label_agreement":null},{"id":"W1501437548","doi":"10.1007/978-3-540-85035-9_12","title":"A Meta-analysis of Timbre Perception Using Nonlinear Extensions to CLASCAL","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Isomap; Timbre; Multidimensional scaling; Computer science; Dimensionality reduction; Nonlinear dimensionality reduction; Curse of dimensionality; Artificial intelligence; Perception; Nonlinear system; Pattern recognition (psychology); Speech recognition; Machine learning; Psychology","score_opus":0.10109946204257476,"score_gpt":0.30456245152388445,"score_spread":0.2034629894813097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501437548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11659075,0.04497938,0.8060302,0.0012283091,0.0006955113,0.0005452819,0.0146683045,0.0062348526,0.00902732],"genre_scores_gemma":[0.5672702,0.005853992,0.40850183,0.00034894064,0.000388989,0.0006877837,0.012225925,0.001475281,0.0032471241],"study_design_codex":"design_other","study_design_gemma":"meta_analysis","domain_scores_codex":[0.99635065,0.0018997194,0.00031108333,0.0008509069,0.000491738,0.0000959031],"domain_scores_gemma":[0.9738348,0.019974427,0.0010704894,0.002940775,0.0019693004,0.00021014396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009921452,0.0013448303,0.0018042593,0.0045154244,0.0005851472,0.0037912538,0.0021811426,0.0005728056,0.0074880975],"category_scores_gemma":[0.039862532,0.0008250527,0.005035409,0.0056180623,0.00043908344,0.0031002392,0.001992706,0.0011455803,0.0012559892],"study_design_candidate":"meta_analysis","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005946689,0.00037463344,0.036328085,0.013615911,0.06169665,0.00022282748,0.0013161411,0.041331954,0.009147918,0.023193445,0.012917972,0.79390776],"study_design_scores_gemma":[0.002407028,0.0023178216,0.06911355,0.006205821,0.09337673,0.00061369844,0.0016394316,0.49686408,0.019344168,0.22178379,0.08562287,0.00071095384],"about_ca_topic_score_codex":0.0067800735,"about_ca_topic_score_gemma":0.010234893,"teacher_disagreement_score":0.009921452,"about_ca_system_score_codex":0.0008363836,"about_ca_system_score_gemma":0.0012485314,"threshold_uncertainty_score":0.052470267},"labels":[],"label_agreement":null},{"id":"W1501561451","doi":"10.1007/3-540-36181-2_23","title":"Ecological Statistics of Contour Grouping","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","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":"York University","funders":"","keywords":"Computer science; Gestalt psychology; Artificial intelligence; Inference; Independence (probability theory); Similarity (geometry); Object (grammar); Perception; Psychophysics; Bayesian inference; Bayesian probability; Pattern recognition (psychology); Machine learning; Mathematics; Image (mathematics); Statistics; Psychology","score_opus":0.07109185353789116,"score_gpt":0.30865034981679246,"score_spread":0.2375584962789013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501561451","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.75995725,0.0037555578,0.16777745,0.0021604232,0.00012993952,0.00003257224,0.0014093164,0.0006108323,0.06416673],"genre_scores_gemma":[0.98669946,0.0006550722,0.009071403,0.000042017702,0.00007795584,0.000019591433,0.0006617412,0.000101929116,0.0026707659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996307,0.00011643811,0.000021436135,0.000086067754,0.000100883975,0.000044444805],"domain_scores_gemma":[0.9930702,0.0042188293,0.00050592667,0.0010294187,0.00080363563,0.00037198295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014892316,0.00016524276,0.0004256502,0.0026864647,0.00060128723,0.0017158256,0.00069946446,0.00045984564,0.0057193306],"category_scores_gemma":[0.012880616,0.0003590466,0.00034416956,0.0026127307,0.0017863605,0.002498032,0.0008247851,0.00090677396,0.0004421489],"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.00011063133,0.000042411,0.027191233,0.0001072607,0.000074885465,0.00010019005,0.0004175364,0.052759558,0.0020977398,0.85230905,0.0064193984,0.058370177],"study_design_scores_gemma":[0.000007113244,0.000015869877,0.04323148,0.000016648373,0.000014480035,0.00019040302,0.00015933487,0.050507486,0.00032204232,0.90175885,0.0037546775,0.000021652282],"about_ca_topic_score_codex":0.0030189524,"about_ca_topic_score_gemma":0.0042395997,"teacher_disagreement_score":0.0057193306,"about_ca_system_score_codex":0.0011068643,"about_ca_system_score_gemma":0.00039480836,"threshold_uncertainty_score":0.019133091},"labels":[],"label_agreement":null},{"id":"W1501710627","doi":"10.1007/978-3-540-45072-6_22","title":"Logical Data Expiration for Fixpoint Extensions of Temporal Logics","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fixed point; Mathematics; Mathematical analysis","score_opus":0.07657877478952711,"score_gpt":0.2933293041430649,"score_spread":0.21675052935353778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501710627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020835651,0.0013612496,0.9614015,0.0013823796,0.00032748285,0.00016671706,0.0002773314,0.0023445426,0.011903097],"genre_scores_gemma":[0.46587512,0.0019540887,0.5113351,0.001032515,0.0007766023,0.00046275847,0.0012722103,0.0013219827,0.015969636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921583,0.0021746529,0.0012839865,0.0013841614,0.0022214705,0.0007774811],"domain_scores_gemma":[0.978642,0.013489579,0.0010841449,0.004659249,0.0015361306,0.00058894354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016411567,0.0012079385,0.0016893623,0.0024391855,0.0025187393,0.00745621,0.004617747,0.003113019,0.007951866],"category_scores_gemma":[0.029267883,0.002214605,0.0039672717,0.0025158932,0.0066334233,0.023572065,0.008987012,0.009849177,0.0014089457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003447687,0.00007313905,0.0005693066,0.00027190967,0.000052080388,0.00029777462,0.0007273998,0.0047228695,0.0017472885,0.93949497,0.0026363928,0.049061984],"study_design_scores_gemma":[0.000061634244,0.000036870904,0.00007823867,0.00006975242,0.00006595272,0.00016946162,0.00011416917,0.016216539,0.0021609345,0.9739163,0.0070682014,0.00004188597],"about_ca_topic_score_codex":0.0014131226,"about_ca_topic_score_gemma":0.0013021351,"teacher_disagreement_score":0.016411567,"about_ca_system_score_codex":0.0029692634,"about_ca_system_score_gemma":0.0022347549,"threshold_uncertainty_score":0.08679372},"labels":[],"label_agreement":null},{"id":"W1501725644","doi":"10.1007/11492542_40","title":"A Roof Edge Detection Model","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Concordia University","funders":"","keywords":"Piecewise; Computer science; Roof; Projection (relational algebra); Enhanced Data Rates for GSM Evolution; Planar; Bounded function; Planar projection; Scale (ratio); Energy (signal processing); Algorithm; Scale model; Artificial intelligence; Mathematics; Mathematical analysis; Computer graphics (images); Orthographic projection; Physics; Structural engineering; Statistics; Aerospace engineering","score_opus":0.012176786444711695,"score_gpt":0.22356413118408153,"score_spread":0.21138734473936982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501725644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00813813,0.00016825194,0.9764357,0.00010719792,0.00004795468,0.000041276016,0.0005947809,0.0013235454,0.013143067],"genre_scores_gemma":[0.5184906,0.00085654826,0.41237414,0.00015932356,0.00008079579,0.000182556,0.0041352315,0.0009580049,0.0627628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998361,0.00001441373,0.0000057425573,0.000063001266,0.000059764967,0.00002104984],"domain_scores_gemma":[0.9999033,0.00001834051,0.000007304673,0.000023915745,0.000038934762,0.000008158758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014977655,0.00069030497,0.0005906955,0.0005547231,0.0003707206,0.0010883922,0.0017243574,0.0011603942,0.008908293],"category_scores_gemma":[0.00038701782,0.00063507806,0.0010318427,0.00069749047,0.00029757945,0.0011666201,0.0007320386,0.00077073084,0.0047556967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080426995,0.00006639079,0.00059368706,0.00009387681,0.000038270595,0.00016520768,0.000045770015,0.82266474,0.008992077,0.03310252,0.005823735,0.12833323],"study_design_scores_gemma":[0.0000033142187,0.0000074712643,0.00012701277,0.000005763856,0.000007877348,0.000030410558,0.0000048806914,0.9924574,0.0011148445,0.0037575783,0.0024777392,0.0000056753343],"about_ca_topic_score_codex":0.008286961,"about_ca_topic_score_gemma":0.006566619,"teacher_disagreement_score":0.008908293,"about_ca_system_score_codex":0.00049025536,"about_ca_system_score_gemma":0.0005410466,"threshold_uncertainty_score":0.02980125},"labels":[],"label_agreement":null},{"id":"W1501739553","doi":"10.1007/3-540-39205-x_26","title":"Upper and Lower Recursion Schemes in Abstract Approximation Spaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Scheme (mathematics); Mathematics; Space (punctuation); Order (exchange); Type (biology); Calculus (dental); Discrete mathematics; Pure mathematics; Algebra over a field; Computer science; Algorithm; Mathematical analysis","score_opus":0.022857239024415315,"score_gpt":0.2577222957993439,"score_spread":0.2348650567749286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501739553","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.02215847,0.002438977,0.946652,0.0010578748,0.0002516257,0.00005178959,0.0001267635,0.00031715684,0.026945371],"genre_scores_gemma":[0.44726694,0.0038638974,0.50237507,0.0006015253,0.0006430004,0.00024192706,0.00044121497,0.0004162891,0.04415014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956534,0.0014258993,0.0003789216,0.00052702357,0.0015690175,0.0004456875],"domain_scores_gemma":[0.9929167,0.0041440097,0.00033366188,0.0015090572,0.0007300603,0.00036650116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065100556,0.0008107148,0.0015194172,0.0025314316,0.001799501,0.006243273,0.0028332693,0.0019990753,0.007731627],"category_scores_gemma":[0.0152535485,0.0009109483,0.0022043274,0.004321431,0.0050755055,0.013190607,0.005421647,0.00799725,0.0013540527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015694512,0.000007757264,0.000046617148,0.00002212329,0.0000033333995,0.0000075637768,0.00011226726,0.0015861948,0.00018535604,0.98706216,0.0003982158,0.010552676],"study_design_scores_gemma":[0.000007776288,0.00001816044,0.0000633191,0.000022458365,0.000010848148,0.00002848441,0.00002992289,0.022419859,0.0003648027,0.973043,0.003978975,0.00001224813],"about_ca_topic_score_codex":0.0017664336,"about_ca_topic_score_gemma":0.0013858171,"teacher_disagreement_score":0.007731627,"about_ca_system_score_codex":0.0038545155,"about_ca_system_score_gemma":0.0015382738,"threshold_uncertainty_score":0.034428835},"labels":[],"label_agreement":null},{"id":"W1501807268","doi":"10.1007/978-3-540-75538-8_23","title":"Optimization of a Billiard Player – Tactical Play","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Université de Sherbrooke","funders":"","keywords":"Dynamical billiards; Computer science; Heuristics; Ball (mathematics); Selection (genetic algorithm); Greedy algorithm; Artificial intelligence; Mathematical optimization; Human–computer interaction; Algorithm; Mathematics","score_opus":0.04171191487718149,"score_gpt":0.29837236375686177,"score_spread":0.25666044887968026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501807268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548057,0.00044614938,0.7267052,0.0009795047,0.00025364003,0.00026916259,0.00021133976,0.0005104305,0.105144],"genre_scores_gemma":[0.8949298,0.00014643367,0.06475274,0.00010903405,0.000046945883,0.00023742158,0.00014093754,0.00017293161,0.039463624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.00012528723,0.000013421497,0.000056568082,0.00007453625,0.00009633702],"domain_scores_gemma":[0.99950314,0.00028174656,0.00003207553,0.000034299344,0.000051572177,0.00009711491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008041522,0.0011538013,0.0016275962,0.0005980745,0.00077221583,0.0016848112,0.0015767689,0.0024680863,0.015323296],"category_scores_gemma":[0.0020355452,0.0008907851,0.0006926724,0.00039993547,0.0011525562,0.00090360694,0.0020964085,0.0012658733,0.0011038418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000500276,0.00015329268,0.0003467532,0.00009803268,0.00005740488,0.00013050988,0.00007883881,0.9347604,0.0027060853,0.039299797,0.0025300835,0.01933854],"study_design_scores_gemma":[0.00003635931,0.000083189516,0.00010379637,0.00001058729,0.000010804139,0.00001940164,0.000022359725,0.99279344,0.00036016322,0.0056915986,0.0008609183,0.000007436043],"about_ca_topic_score_codex":0.0045160097,"about_ca_topic_score_gemma":0.0025845068,"teacher_disagreement_score":0.015323296,"about_ca_system_score_codex":0.0009641025,"about_ca_system_score_gemma":0.001348989,"threshold_uncertainty_score":0.051261604},"labels":[],"label_agreement":null},{"id":"W1501816783","doi":"10.1007/978-3-642-13388-6_17","title":"Discovering and Recognizing Student Interaction Patterns in Exploratory Learning Environments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Association rule learning; Class (philosophy); Classifier (UML); Artificial intelligence; Machine learning; Exploratory analysis; Learning environment; Exploratory research; Human–computer interaction; Data science; Mathematics education","score_opus":0.01574873754056265,"score_gpt":0.2642184239812123,"score_spread":0.24846968644064965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501816783","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.83641315,0.00054989796,0.1573824,0.00014841328,0.000034827,0.00011113245,0.0009528944,0.0014080947,0.0029993348],"genre_scores_gemma":[0.8991827,0.00032611002,0.0963428,0.00003653978,0.000031561023,0.0001137608,0.0014801809,0.00009595858,0.0023904906],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994809,0.00010606411,0.00003856352,0.00017137325,0.00012859155,0.000074579955],"domain_scores_gemma":[0.99806315,0.0013052206,0.00022561429,0.00012641569,0.00014637774,0.00013325468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004534188,0.00048686666,0.0003970537,0.0020182626,0.00039145246,0.0012862453,0.0006591392,0.0008123202,0.0009945882],"category_scores_gemma":[0.0027028928,0.00032882649,0.00052842323,0.0013465291,0.00023448745,0.0014672135,0.0011336127,0.00056166475,0.0007761269],"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.0008515623,0.0008741062,0.18143311,0.00037123272,0.00020790909,0.00067451264,0.0037759517,0.008476747,0.06562733,0.0012446857,0.004964223,0.7314986],"study_design_scores_gemma":[0.00008143488,0.0010745699,0.33229703,0.00017825815,0.0003063124,0.0025785093,0.0067208614,0.5870124,0.046227556,0.012755401,0.010637421,0.00013026939],"about_ca_topic_score_codex":0.0013305056,"about_ca_topic_score_gemma":0.003675946,"teacher_disagreement_score":0.0020182626,"about_ca_system_score_codex":0.00019293003,"about_ca_system_score_gemma":0.00027616502,"threshold_uncertainty_score":0.0033272505},"labels":[],"label_agreement":null},{"id":"W1501863976","doi":"10.1007/11559573_128","title":"Face Recognition – Combine Generic and Specific Solutions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Facial recognition system; A priori and a posteriori; Face (sociological concept); Artificial intelligence; Set (abstract data type); Task (project management); Identification (biology); Scheme (mathematics); Sample (material); Pattern recognition (psychology); Machine learning; Image (mathematics)","score_opus":0.03877427809063533,"score_gpt":0.23507754084759344,"score_spread":0.1963032627569581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501863976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062062074,0.008028071,0.9618792,0.00043045654,0.00023686005,0.00008419362,0.00010727353,0.0021834068,0.020844268],"genre_scores_gemma":[0.114559904,0.018468672,0.83325654,0.0010004948,0.0007622288,0.00014923979,0.0011849146,0.0008757446,0.029742239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992162,0.00008268448,0.000059208814,0.00025785962,0.00029897923,0.00008511389],"domain_scores_gemma":[0.9995369,0.000054147953,0.00002005275,0.0002270354,0.00013417438,0.000027759412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923186,0.0014756782,0.0012778316,0.0016484705,0.0003064902,0.0018387379,0.0019499785,0.0015887308,0.0042016674],"category_scores_gemma":[0.0010320044,0.0006619908,0.0011308905,0.0012260095,0.00085530756,0.0045372597,0.0024287016,0.001576531,0.005012286],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047400645,0.00006871996,0.0008007783,0.00036409684,0.00011052758,0.000073056355,0.000068080626,0.004618612,0.028626997,0.022768417,0.007871587,0.9345817],"study_design_scores_gemma":[0.000039791386,0.0005259845,0.006997848,0.00072873425,0.00061179406,0.0064583193,0.00036707937,0.27161932,0.18445194,0.2049218,0.32301837,0.00025898468],"about_ca_topic_score_codex":0.00028552095,"about_ca_topic_score_gemma":0.0006394939,"teacher_disagreement_score":0.0042016674,"about_ca_system_score_codex":0.00046484623,"about_ca_system_score_gemma":0.00037342362,"threshold_uncertainty_score":0.014056027},"labels":[],"label_agreement":null},{"id":"W1501940922","doi":"10.1007/978-3-642-03262-2_7","title":"Modeling the Form and Function of Clinical Practice Guidelines: An Ontological Model to Computerize Clinical Practice Guidelines","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Dalhousie University","funders":"","keywords":"Executable; Computer science; Ontology; CpG site; Information retrieval; Formalism (music); Programming language; Function (biology); Human–computer interaction; Software engineering; Theoretical computer science; DNA methylation; Gene; Chemistry","score_opus":0.1747238835813525,"score_gpt":0.4480311735038706,"score_spread":0.2733072899225181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501940922","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.011302699,0.00054106495,0.9721067,0.004030636,0.00010315032,0.0004923348,0.0043135546,0.0011829779,0.00592694],"genre_scores_gemma":[0.08480897,0.00070025376,0.9073049,0.00044460205,0.00003766436,0.0004110136,0.004872601,0.00012944118,0.0012906172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733657,0.0010065287,0.0006002393,0.00032254707,0.0006013159,0.00013270396],"domain_scores_gemma":[0.99273175,0.00469211,0.00062379276,0.00069704157,0.0010018492,0.00025348744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043914733,0.0008158922,0.00061016274,0.003680327,0.001125728,0.00476157,0.002164393,0.0017541527,0.0022788413],"category_scores_gemma":[0.016384624,0.0008356917,0.0025997793,0.0041996907,0.0013224593,0.005435446,0.0022880374,0.0021467358,0.0007437104],"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.00016564474,0.0003267796,0.00959782,0.0010572625,0.0003357148,0.00090194395,0.004163286,0.09710222,0.0031407739,0.64635676,0.017682597,0.21916926],"study_design_scores_gemma":[0.00008116767,0.00005433828,0.0016972246,0.00068582216,0.0004806808,0.00072101405,0.0008032451,0.4091649,0.0030492498,0.4888229,0.09435539,0.00008409715],"about_ca_topic_score_codex":0.024378026,"about_ca_topic_score_gemma":0.037192617,"teacher_disagreement_score":0.024378026,"about_ca_system_score_codex":0.0025523785,"about_ca_system_score_gemma":0.0050339755,"threshold_uncertainty_score":0.048472285},"labels":[],"label_agreement":null},{"id":"W1502023439","doi":"10.1007/978-3-540-32256-6_37","title":"Interpolation Methods for Global Vision Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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 Manitoba","funders":"","keywords":"Computer science; Interpolation (computer graphics); Computer vision; Field (mathematics); Artificial intelligence; Software; Construct (python library); Camera resectioning; Computer graphics (images); Calibration; Image (mathematics); Mathematics","score_opus":0.016153311377247924,"score_gpt":0.33376654051589655,"score_spread":0.31761322913864865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502023439","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.00082761445,0.0019311729,0.99426717,0.00006211499,0.00010760457,0.00001154397,0.000055415236,0.00045401524,0.0022833033],"genre_scores_gemma":[0.061864328,0.004385633,0.90845144,0.0000901901,0.00025296488,0.00010680168,0.00050194067,0.0005178038,0.023828918],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974114,0.000069115034,0.000013504136,0.000043907647,0.00011468275,0.000017737588],"domain_scores_gemma":[0.9996952,0.00012665585,0.000016475447,0.00007404304,0.000078433215,0.000009295899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004639288,0.00067628094,0.00095790974,0.0006705201,0.000325131,0.0006438338,0.0010107962,0.00073860836,0.010481957],"category_scores_gemma":[0.0012692689,0.0004237137,0.0007133459,0.0013985172,0.0004589597,0.0009878334,0.00083203474,0.0013065856,0.0032319282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008655834,0.00003624429,0.00018205015,0.00044559158,0.000057905672,0.00005199767,0.00007319307,0.07972842,0.009692087,0.12649006,0.01599157,0.76716447],"study_design_scores_gemma":[0.000022140364,0.000051916184,0.00031847163,0.00006156199,0.000032269632,0.00013960416,0.000028500863,0.81057656,0.0051853396,0.123682424,0.05987554,0.000025648613],"about_ca_topic_score_codex":0.0019574584,"about_ca_topic_score_gemma":0.002380255,"teacher_disagreement_score":0.010481957,"about_ca_system_score_codex":0.00035173225,"about_ca_system_score_gemma":0.00041429244,"threshold_uncertainty_score":0.03506565},"labels":[],"label_agreement":null},{"id":"W1502107550","doi":"10.1007/978-3-540-31988-7_24","title":"Asymmetric Inexact Matching of Spatially-Attributed Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Vertex (graph theory); Matching (statistics); Graph; Algorithm; Theoretical computer science; Mathematics","score_opus":0.012461472487726164,"score_gpt":0.23159854235415794,"score_spread":0.21913706986643178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502107550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20066097,0.00053919107,0.7730432,0.00063994474,0.00016028748,0.00010850416,0.0005246496,0.000982191,0.023341063],"genre_scores_gemma":[0.7972604,0.0006597781,0.17656343,0.00018112457,0.00015805833,0.00010738872,0.0013818567,0.00048358194,0.023204412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971284,0.00061099103,0.00019297621,0.00067165477,0.0010533647,0.00034262543],"domain_scores_gemma":[0.99003184,0.0038516135,0.0010842176,0.0034460803,0.0010114053,0.00057474774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018923762,0.0007534656,0.0016519452,0.002122948,0.0017833216,0.0033493314,0.0045172423,0.0020282827,0.0077230935],"category_scores_gemma":[0.01508801,0.0011255356,0.0010087476,0.0046556843,0.0017590625,0.010770384,0.0053549516,0.0032977753,0.0012171442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003979986,0.00019498335,0.0017892432,0.00029339528,0.00008463736,0.0005849532,0.00059396256,0.0945418,0.006274629,0.7890087,0.004291275,0.101944484],"study_design_scores_gemma":[0.000019601384,0.000023485794,0.00037365398,0.000029203691,0.00003531521,0.00025620684,0.00017506281,0.17617323,0.0051243813,0.81371886,0.0040517077,0.000019303676],"about_ca_topic_score_codex":0.0015848661,"about_ca_topic_score_gemma":0.0020488112,"teacher_disagreement_score":0.0077230935,"about_ca_system_score_codex":0.0018825963,"about_ca_system_score_gemma":0.0012704785,"threshold_uncertainty_score":0.025836349},"labels":[],"label_agreement":null},{"id":"W1502156619","doi":"10.1007/978-3-319-15612-5_11","title":"Folding a Paper Strip to Minimize Thickness","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Materials and Mechanics","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 Waterloo","funders":"","keywords":"Computer science; Folding (DSP implementation); Fold (higher-order function); Graph; Algorithm; Plane (geometry); State (computer science); Geometry; Mathematical optimization; Theoretical computer science; Topology (electrical circuits); Combinatorics; Mathematics; Structural engineering","score_opus":0.022043444853789656,"score_gpt":0.24170856036840488,"score_spread":0.21966511551461523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502156619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038979992,0.0010204904,0.89528334,0.0005947412,0.0016069923,0.00014503581,0.00025461472,0.003117273,0.05899749],"genre_scores_gemma":[0.23538405,0.0012925518,0.66013193,0.00046977366,0.00032509174,0.00016481298,0.00057465123,0.002439506,0.09921766],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966097,0.000029556059,0.000025677915,0.000111254645,0.00012821841,0.000044342632],"domain_scores_gemma":[0.9993297,0.00013155997,0.000051701933,0.00025164505,0.00019129252,0.000044147077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048473082,0.0012559395,0.0007041841,0.00062078104,0.0005749138,0.0012929376,0.0011162806,0.0008711228,0.020171296],"category_scores_gemma":[0.0015314872,0.0005505688,0.0006955966,0.000704693,0.00051799876,0.0015572683,0.00097130996,0.001457254,0.008852554],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047223692,0.00017530553,0.00082661276,0.00089781074,0.000067762616,0.00068920036,0.00043467138,0.036839247,0.29720715,0.06996298,0.029768774,0.56265825],"study_design_scores_gemma":[0.0001681717,0.0017758643,0.0020700628,0.00035182727,0.00019169449,0.0031639913,0.0008181071,0.14425641,0.4041793,0.10947187,0.33343577,0.000116873074],"about_ca_topic_score_codex":0.00020381293,"about_ca_topic_score_gemma":0.00033834082,"teacher_disagreement_score":0.020171296,"about_ca_system_score_codex":0.00025124618,"about_ca_system_score_gemma":0.00049815944,"threshold_uncertainty_score":0.06747967},"labels":[],"label_agreement":null},{"id":"W1502190774","doi":"10.1007/3-540-40996-3_32","title":"Deterministic Broadcasting Time with Partial Knowledge of the Network","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Node (physics); RADIUS; Computer network; Point-to-point; Network topology; Graph; Point (geometry); Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics; Physics","score_opus":0.012879428475081847,"score_gpt":0.22157744543605767,"score_spread":0.20869801696097584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502190774","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.18701075,0.003175217,0.79124486,0.0028947871,0.00013886765,0.00028132176,0.0010511581,0.002142733,0.012060347],"genre_scores_gemma":[0.8458474,0.0016230559,0.14700371,0.00025895837,0.00016944078,0.000332685,0.0007474018,0.00044109454,0.0035761998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961777,0.00071745407,0.00024370148,0.0010087293,0.00092235574,0.00093005894],"domain_scores_gemma":[0.9590452,0.033943236,0.0022144304,0.0024284695,0.0013346494,0.0010340739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043591154,0.0013014346,0.0021260737,0.0013442873,0.0016131104,0.004056004,0.003682499,0.0021926465,0.003437279],"category_scores_gemma":[0.033497304,0.0010807938,0.001130578,0.0024561665,0.002538206,0.007539031,0.002355055,0.0019675957,0.0005414635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011878395,0.00012327694,0.0023522219,0.0005562301,0.00011186364,0.00022072332,0.0004881797,0.88466465,0.0061977403,0.06353281,0.0026448898,0.03791959],"study_design_scores_gemma":[0.00006983175,0.00008951102,0.00036436238,0.000030744424,0.00005778924,0.00011596364,0.0000817725,0.9588198,0.0021077844,0.037105102,0.0011345708,0.000022709937],"about_ca_topic_score_codex":0.008448982,"about_ca_topic_score_gemma":0.00498802,"teacher_disagreement_score":0.008448982,"about_ca_system_score_codex":0.005487156,"about_ca_system_score_gemma":0.0050624474,"threshold_uncertainty_score":0.039812326},"labels":[],"label_agreement":null},{"id":"W1502241097","doi":"10.1007/3-540-45571-x_33","title":"AViz: A Visualization System for Discovering Numeric Association Rules","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Association rule learning; Visualization; Discretization; Data mining; Set (abstract data type); Data visualization; Raw data; Process (computing); Association (psychology); Information visualization; Bin; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.012524215775382722,"score_gpt":0.2550527273849601,"score_spread":0.2425285116095774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502241097","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026582366,0.0019509674,0.41757944,0.00090444443,0.00035126504,0.00036575634,0.065444045,0.47756907,0.009252522],"genre_scores_gemma":[0.10492762,0.0024729467,0.8039283,0.000637656,0.00020225135,0.001048588,0.060703874,0.012565092,0.013513593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00007750432,0.00005991435,0.00009439866,0.00025255408,0.000027634807],"domain_scores_gemma":[0.99769956,0.0015247036,0.00017333422,0.00023408547,0.00027775788,0.000090696994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010826689,0.0022024151,0.0011099417,0.005403811,0.0005048792,0.0022565008,0.0014577016,0.0009525506,0.028532676],"category_scores_gemma":[0.004678999,0.00079300255,0.0010152662,0.003300817,0.00019946917,0.0016777073,0.0014464429,0.001080275,0.0059015136],"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.0014541931,0.00020591414,0.007930215,0.0022370827,0.000518839,0.0008438194,0.00076994597,0.007950473,0.028071549,0.007082966,0.32148102,0.621454],"study_design_scores_gemma":[0.0014546339,0.0005836993,0.019770239,0.0008196585,0.0010398983,0.0029995332,0.00055891223,0.36751345,0.08609691,0.05872492,0.4599489,0.0004892151],"about_ca_topic_score_codex":0.0034563143,"about_ca_topic_score_gemma":0.0051806,"teacher_disagreement_score":0.028532676,"about_ca_system_score_codex":0.000309223,"about_ca_system_score_gemma":0.0007550878,"threshold_uncertainty_score":0.095451355},"labels":[],"label_agreement":null},{"id":"W1502251137","doi":"10.1007/978-3-540-24677-0_23","title":"Multi-agent Development Toolkits: An Evaluation","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"JADE (particle detector); Computer science; Java; Focus (optics); Software engineering; Multi-agent system; Intelligent agent; Software agent; World Wide Web; Programming language; Operating system; Artificial intelligence","score_opus":0.03483657124509039,"score_gpt":0.27918042936733317,"score_spread":0.2443438581222428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502251137","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.81871855,0.0047337445,0.115170896,0.0014858826,0.00038133407,0.003299144,0.0021029355,0.021516569,0.032591015],"genre_scores_gemma":[0.81046957,0.0040924796,0.16450043,0.00030761713,0.000054748805,0.0016535403,0.005043261,0.0032223754,0.010655945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98188055,0.009972195,0.0011571205,0.0006913212,0.0057753297,0.0005235252],"domain_scores_gemma":[0.89175785,0.082694575,0.0023841162,0.007901308,0.011662424,0.003599774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020126786,0.0012064845,0.0008187988,0.0025422052,0.0009235149,0.002502974,0.0027293647,0.0011308634,0.0039576134],"category_scores_gemma":[0.060099684,0.00075662497,0.0007843198,0.0016618504,0.0009905051,0.0034443033,0.004249245,0.0012422387,0.0016298394],"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.013944922,0.008024906,0.029024472,0.0044622985,0.00061766163,0.00054769195,0.0067606233,0.023866223,0.0095017515,0.0073793055,0.016322736,0.8795474],"study_design_scores_gemma":[0.014332298,0.03617869,0.1353431,0.005033042,0.004203193,0.003526858,0.013884287,0.4551372,0.10741878,0.0137046175,0.21031508,0.0009227917],"about_ca_topic_score_codex":0.0036642358,"about_ca_topic_score_gemma":0.0036198052,"teacher_disagreement_score":0.020126786,"about_ca_system_score_codex":0.0013066074,"about_ca_system_score_gemma":0.0030521583,"threshold_uncertainty_score":0.106441915},"labels":[],"label_agreement":null},{"id":"W1502337223","doi":"10.1007/978-3-540-24732-6_17","title":"Translation from Adapted UML to Promela for CORBA-Based Applications","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Windsor","funders":"","keywords":"Promela; Computer science; Common Object Request Broker Architecture; Correctness; Unified Modeling Language; Middleware (distributed applications); Distributed object; Programming language; UML tool; Distributed computing; Applications of UML; Interoperable Object Reference; Model checking; Software design pattern; Software","score_opus":0.04304845649919971,"score_gpt":0.2961245316517238,"score_spread":0.2530760751525241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502337223","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.014328027,0.00043411745,0.91068035,0.0009038815,0.0007044634,0.00059036195,0.0032029252,0.02820874,0.04094716],"genre_scores_gemma":[0.16556834,0.0013442684,0.75251824,0.00089127256,0.00017190045,0.0007474802,0.0102170585,0.016746836,0.05179473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921334,0.00014576115,0.00007329303,0.00013164204,0.00034179297,0.00009421914],"domain_scores_gemma":[0.99885666,0.00028196097,0.000044061675,0.0003464047,0.00042772724,0.000043224612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451967,0.0008335313,0.00046577107,0.0010385489,0.00048261532,0.0018244315,0.0010028492,0.0006591593,0.0148422085],"category_scores_gemma":[0.003385186,0.0008251588,0.00076634716,0.0010013575,0.00054885185,0.0012095395,0.0016832302,0.0019886768,0.0104355095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036834567,0.00051702844,0.0008990996,0.0019102261,0.0000974962,0.0015472964,0.00342099,0.017582864,0.104135565,0.20476437,0.101005115,0.5637517],"study_design_scores_gemma":[0.00014014625,0.00011534802,0.00096316554,0.00051335036,0.000110038454,0.00090424786,0.00060798717,0.045064207,0.13439631,0.07576087,0.74131185,0.00011238204],"about_ca_topic_score_codex":0.0021851656,"about_ca_topic_score_gemma":0.0022826076,"teacher_disagreement_score":0.0148422085,"about_ca_system_score_codex":0.0007166728,"about_ca_system_score_gemma":0.0015088028,"threshold_uncertainty_score":0.04965216},"labels":[],"label_agreement":null},{"id":"W1502353290","doi":"10.1007/978-3-540-69311-6_7","title":"A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Euclidean distance; Fragment (logic); Euclidean space; Sequence (biology); Simple (philosophy); Euclidean geometry; Space (punctuation); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.023892291777611215,"score_gpt":0.2551792729855504,"score_spread":0.23128698120793917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502353290","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.013743587,0.00040706262,0.9704513,0.0017946679,0.0003032832,0.0002358926,0.00030881725,0.0005730876,0.012182358],"genre_scores_gemma":[0.44475335,0.0013914753,0.51241124,0.0011626343,0.0009080877,0.001261734,0.0012665442,0.0006464318,0.036198527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963521,0.0011444564,0.00023033565,0.0010429387,0.00092170644,0.00030847898],"domain_scores_gemma":[0.9919453,0.004579894,0.00064841396,0.0013181982,0.00095093914,0.00055726053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003260963,0.001420815,0.0027928622,0.00092123257,0.0016112062,0.003053038,0.004866981,0.0044155684,0.014551167],"category_scores_gemma":[0.020400185,0.00071971235,0.0017551868,0.0027121324,0.0022892775,0.010178498,0.0054197675,0.006316962,0.0028656365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009102816,0.00030017513,0.00045305322,0.0005973024,0.0001253105,0.00020683433,0.00040119255,0.26656312,0.004463949,0.5514818,0.029416116,0.14508092],"study_design_scores_gemma":[0.000103074766,0.00018535365,0.00012725765,0.000042060758,0.000030106403,0.00014663547,0.00008814568,0.6210632,0.0008723852,0.37281916,0.0044887597,0.000033902394],"about_ca_topic_score_codex":0.0018041331,"about_ca_topic_score_gemma":0.0013144308,"teacher_disagreement_score":0.014551167,"about_ca_system_score_codex":0.0022317765,"about_ca_system_score_gemma":0.0029088766,"threshold_uncertainty_score":0.048678517},"labels":[],"label_agreement":null},{"id":"W1502380032","doi":"10.1007/978-3-642-20798-3_7","title":"Strategyproof Mechanisms for Content Delivery via Layered Multicast","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Multicast; Computer science; Revenue; Maximization; Mathematical optimization; Mechanism design; Approximation algorithm; Computer network; Algorithm; Mathematical economics; Mathematics","score_opus":0.16740239865782403,"score_gpt":0.33504475824139623,"score_spread":0.1676423595835722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502380032","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.011490699,0.0009972447,0.9731118,0.0009109081,0.00015148336,0.00013669702,0.00009581509,0.0008079248,0.012297425],"genre_scores_gemma":[0.64453757,0.0020272976,0.33559284,0.00034549076,0.00064115267,0.0008189562,0.00021292537,0.00032617516,0.015497682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938692,0.002414846,0.0004137221,0.00042873088,0.002166267,0.00070724514],"domain_scores_gemma":[0.98641497,0.008716403,0.0010104239,0.002658894,0.0008160445,0.00038321828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006217694,0.0014396262,0.001230292,0.0013033579,0.0014068976,0.0050760354,0.005025988,0.002881292,0.0057767374],"category_scores_gemma":[0.018811483,0.0011324686,0.0012632061,0.0021617583,0.0026125296,0.0075601097,0.004936748,0.004310552,0.0013666878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014114106,0.00009699735,0.00014980664,0.00021408017,0.000056400164,0.00007904335,0.00017763261,0.023627453,0.0033586104,0.9189378,0.0044647977,0.04869631],"study_design_scores_gemma":[0.000111876616,0.000051174902,0.00008427038,0.000047595786,0.000045148776,0.0001145877,0.00002498272,0.15020886,0.001818977,0.8421368,0.0053174677,0.000038286256],"about_ca_topic_score_codex":0.0005310142,"about_ca_topic_score_gemma":0.00049113727,"teacher_disagreement_score":0.006217694,"about_ca_system_score_codex":0.0023796922,"about_ca_system_score_gemma":0.0015713426,"threshold_uncertainty_score":0.03288269},"labels":[],"label_agreement":null},{"id":"W1502382854","doi":"10.1007/978-3-540-73545-8_45","title":"On the Complexity of Finding an Unknown Cut Via Vertex Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Computer science; Matching (statistics); Time complexity; Binary logarithm; Combinatorics; Computational complexity theory; Graph; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics","score_opus":0.0698119103731919,"score_gpt":0.284960043533053,"score_spread":0.2151481331598611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502382854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32301816,0.0089996215,0.55052483,0.02845828,0.0012041429,0.0011096502,0.007912337,0.0064131347,0.07235985],"genre_scores_gemma":[0.7012814,0.0042285337,0.25894693,0.0025210353,0.0018946436,0.0007946869,0.006474464,0.0025997073,0.021258641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989488,0.002941322,0.0006200516,0.0019954026,0.0030644457,0.0018907377],"domain_scores_gemma":[0.8776904,0.1100176,0.0024234692,0.0059864605,0.0022033367,0.0016787202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062780064,0.0028738342,0.0052975914,0.0031716998,0.0033259096,0.011210682,0.009122796,0.005989243,0.025320517],"category_scores_gemma":[0.05726943,0.0021035902,0.0037479997,0.007971979,0.0058632568,0.02983082,0.0089387195,0.008432069,0.0029888705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077711614,0.0011305566,0.008348284,0.0021985935,0.00066459423,0.0006450373,0.0016777714,0.44506347,0.007175921,0.2241224,0.07360276,0.22759946],"study_design_scores_gemma":[0.0004713456,0.00015486364,0.0008636615,0.00010270975,0.00024357694,0.00030768,0.00037759502,0.65755695,0.0016085873,0.33578026,0.0024767043,0.00005605383],"about_ca_topic_score_codex":0.013850688,"about_ca_topic_score_gemma":0.012063442,"teacher_disagreement_score":0.025320517,"about_ca_system_score_codex":0.00682358,"about_ca_system_score_gemma":0.0057875183,"threshold_uncertainty_score":0.08470559},"labels":[],"label_agreement":null},{"id":"W1502442151","doi":"10.1007/11602613_74","title":"5-th Phylogenetic Root Construction for Strictly Chordal Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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 Alberta","funders":"","keywords":"Chordal graph; Pairwise comparison; Phylogenetic tree; Computer science; Closeness; Time complexity; Theoretical computer science; Combinatorics; Graph; Block graph; Split graph; Discrete mathematics; Mathematics; Artificial intelligence; 1-planar graph; Biology","score_opus":0.00968951747809062,"score_gpt":0.23126863811776857,"score_spread":0.22157912063967794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502442151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078403234,0.00050566683,0.8616874,0.0005628292,0.00029928173,0.00019875882,0.00081294344,0.0019830018,0.055546857],"genre_scores_gemma":[0.2680612,0.00045938048,0.70588785,0.0002573335,0.000059462964,0.0001434613,0.0022382943,0.000663969,0.022229088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994993,0.00007684759,0.00003801856,0.00013696677,0.00013697043,0.000111784335],"domain_scores_gemma":[0.99904877,0.0002687699,0.000047979604,0.0003602567,0.00016962523,0.00010457815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005367957,0.000438404,0.0006695419,0.00084811356,0.0012309983,0.001309209,0.0016347776,0.00094715826,0.01023703],"category_scores_gemma":[0.0017262601,0.00055448647,0.0010162765,0.00082450337,0.001083468,0.0020183339,0.002680291,0.0021261375,0.0029203142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003081791,0.00011622402,0.0014439251,0.0009161775,0.00006676514,0.00030674879,0.0010311427,0.011905194,0.0515519,0.5845662,0.017148659,0.33063892],"study_design_scores_gemma":[0.00007562506,0.00026066933,0.0022492178,0.00025969392,0.00015339107,0.0006839551,0.00047032975,0.051943842,0.05249252,0.795473,0.09585443,0.00008330094],"about_ca_topic_score_codex":0.0008898884,"about_ca_topic_score_gemma":0.0019047462,"teacher_disagreement_score":0.01023703,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.00084047596,"threshold_uncertainty_score":0.034246325},"labels":[],"label_agreement":null},{"id":"W1502476217","doi":"10.1007/11861201_69","title":"Modeling Robot Path Planning with CD++","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Carleton University","funders":"","keywords":"Voronoi diagram; Computer science; Motion planning; DEVS; Robot; Formalism (music); Path (computing); Route planning; Routing (electronic design automation); Distributed computing; Simulation; Artificial intelligence; Mathematical optimization; Modeling and simulation; Computer network; Mathematics","score_opus":0.01795951545977173,"score_gpt":0.21769557406070186,"score_spread":0.19973605860093013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502476217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013131668,0.00016119542,0.9656681,0.00012149231,0.00012258659,0.000073370386,0.00080620614,0.004450411,0.015465074],"genre_scores_gemma":[0.23601237,0.00030674852,0.73598313,0.00013341465,0.000043592827,0.00036339636,0.00087440124,0.00078830903,0.025494598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998449,0.000026963016,0.000008007125,0.000036730493,0.00006304534,0.000020389547],"domain_scores_gemma":[0.9997197,0.00012184646,0.000023008177,0.000046177454,0.00006946669,0.000019742723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025663033,0.00059493084,0.0005615935,0.0002871132,0.00045092255,0.0009455191,0.0019451587,0.00081991527,0.016584653],"category_scores_gemma":[0.00086345273,0.0005173511,0.0005083685,0.0005539984,0.0003420778,0.00070992677,0.000697023,0.0007660759,0.0028650612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006116316,0.00003734361,0.00030091326,0.00009476371,0.000012881651,0.00006094761,0.000032047006,0.92441493,0.0015616141,0.015083701,0.005708735,0.052630924],"study_design_scores_gemma":[0.000009392664,0.0000064914375,0.00003143091,0.0000035527087,0.0000040969885,0.000018316185,0.0000034032314,0.99135053,0.0008745629,0.0041851145,0.0035102123,0.0000028141599],"about_ca_topic_score_codex":0.011302047,"about_ca_topic_score_gemma":0.013593354,"teacher_disagreement_score":0.016584653,"about_ca_system_score_codex":0.0005607014,"about_ca_system_score_gemma":0.000622208,"threshold_uncertainty_score":0.055481255},"labels":[],"label_agreement":null},{"id":"W1502487903","doi":"10.1007/978-3-642-17572-5_48","title":"Threshold Models for Competitive Influence in Social Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":316,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Maximization; Competitor analysis; Greedy algorithm; Mathematical optimization; Cascade; Set (abstract data type); Square root; Extension (predicate logic); Conjecture; Product (mathematics); Mathematical economics; Algorithm; Mathematics; Discrete mathematics","score_opus":0.015306428776491559,"score_gpt":0.26501313154914535,"score_spread":0.2497067027726538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502487903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05955545,0.003655235,0.88943017,0.0061387327,0.0004853556,0.00024247664,0.000996398,0.00089149486,0.038604766],"genre_scores_gemma":[0.88012505,0.0049915877,0.051157806,0.0011063116,0.0016605954,0.0009613969,0.0009806324,0.00061882223,0.058397934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962525,0.0017597983,0.00015901524,0.00054412463,0.0006689029,0.00061576633],"domain_scores_gemma":[0.9689435,0.024989711,0.0014694869,0.0014496827,0.0017235673,0.0014239936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060111037,0.0020258056,0.0047780173,0.003503743,0.0020254278,0.0062975213,0.008323451,0.0065037976,0.018303461],"category_scores_gemma":[0.036889408,0.0017862049,0.0024357326,0.003935351,0.005215693,0.012653833,0.0032529025,0.0062669413,0.0026458837],"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.000065188346,0.00005932297,0.00044536166,0.00013491722,0.000054831933,0.00007442641,0.00026633355,0.095637105,0.0002720949,0.8913303,0.0061537595,0.005506455],"study_design_scores_gemma":[0.000026619895,0.000012492507,0.00012144078,0.000020680172,0.000021734379,0.000031459127,0.00005133047,0.46898878,0.00004427513,0.52972364,0.000938083,0.000019466674],"about_ca_topic_score_codex":0.010654225,"about_ca_topic_score_gemma":0.008505534,"teacher_disagreement_score":0.018303461,"about_ca_system_score_codex":0.005282579,"about_ca_system_score_gemma":0.0017476287,"threshold_uncertainty_score":0.061231136},"labels":[],"label_agreement":null},{"id":"W1502557952","doi":"10.1007/bfb0018391","title":"Novel terms and cooperation in a natural language interface","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lexicon; Term (time); Interface (matter); Computer science; Heuristics; Set (abstract data type); Natural language user interface; Conjunction (astronomy); Natural language processing; Personalization; Value (mathematics); Natural language; Natural (archaeology); Artificial intelligence; Information retrieval; Programming language; Machine learning; World Wide Web","score_opus":0.009698452942246477,"score_gpt":0.25272567296172127,"score_spread":0.2430272200194748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502557952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012829947,0.00020076706,0.969427,0.00085880846,0.00012619326,0.00007099279,0.00010082078,0.0023014895,0.014084068],"genre_scores_gemma":[0.27405015,0.00037738026,0.693835,0.00043871018,0.00020596248,0.00029965976,0.0004631271,0.0017381294,0.028591953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970391,0.0014300247,0.00022657563,0.00044445987,0.0006718159,0.00018813739],"domain_scores_gemma":[0.9968004,0.0020806994,0.000104373845,0.0006025497,0.00026864832,0.00014329018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027656844,0.0006200558,0.000857024,0.0007798364,0.0016135804,0.003703885,0.0022028186,0.0024390868,0.015846016],"category_scores_gemma":[0.007723616,0.0009290569,0.0010211987,0.0010192571,0.0029831948,0.014182788,0.0057749986,0.0030721466,0.0045636804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025114545,0.000051876385,0.000334145,0.00016558937,0.000015926753,0.0005189274,0.0034575257,0.0019974476,0.012439153,0.9112366,0.009211991,0.06031963],"study_design_scores_gemma":[0.000095934265,0.00009177389,0.00018129758,0.000069873975,0.00007551303,0.0011683614,0.0008405066,0.07760203,0.010693244,0.8258175,0.08329211,0.00007188222],"about_ca_topic_score_codex":0.000831247,"about_ca_topic_score_gemma":0.0011134503,"teacher_disagreement_score":0.015846016,"about_ca_system_score_codex":0.0006706307,"about_ca_system_score_gemma":0.0005833727,"threshold_uncertainty_score":0.053010225},"labels":[],"label_agreement":null},{"id":"W1502560560","doi":"10.1007/978-3-642-15751-6_17","title":"Clustering for Text and Image-Based Photo Retrieval at CLEF 2009","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Clef; Computer science; Image retrieval; Cluster analysis; Visual Word; Information retrieval; Artificial intelligence; Document clustering; Automatic image annotation; Content-based image retrieval; Image (mathematics); Pattern recognition (psychology); Task (project management)","score_opus":0.016306891443497395,"score_gpt":0.2559355800360479,"score_spread":0.2396286885925505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502560560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026679229,0.006486783,0.6927083,0.00538849,0.0038078122,0.0017915375,0.05746647,0.17475596,0.030915413],"genre_scores_gemma":[0.060684588,0.0009134658,0.7657301,0.0008413761,0.00065014337,0.00083813904,0.10185766,0.010537934,0.057946615],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954289,0.0011090088,0.00019499104,0.0010033087,0.0019090553,0.00035472447],"domain_scores_gemma":[0.9970208,0.0007149409,0.00007522261,0.00080405356,0.0011665543,0.00021844512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037053882,0.0026508283,0.0022686773,0.0040260446,0.0018885012,0.0026276507,0.0033843496,0.0032745665,0.05101882],"category_scores_gemma":[0.007240177,0.00089428585,0.0014079596,0.0023445708,0.0005520907,0.003467247,0.0016269145,0.00212795,0.040329713],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003484076,0.00017574808,0.00023893043,0.00031032343,0.00007243596,0.000073027346,0.000047946243,0.0062512346,0.013696944,0.0035601074,0.68652725,0.28869763],"study_design_scores_gemma":[0.0004876212,0.00032940306,0.0031410812,0.00013432841,0.000086496824,0.0005205007,0.00020158006,0.43931854,0.14988238,0.022588424,0.3830405,0.00026927897],"about_ca_topic_score_codex":0.012681864,"about_ca_topic_score_gemma":0.0208553,"teacher_disagreement_score":0.05101882,"about_ca_system_score_codex":0.0034938215,"about_ca_system_score_gemma":0.001950447,"threshold_uncertainty_score":0.17067498},"labels":[],"label_agreement":null},{"id":"W1502595148","doi":"10.1007/11951148_13","title":"Towards Integrated Tool Support for the User Requirements Notation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Notation; Eclipse; Exploit; Programming language; Extensibility; Software engineering; Isolation (microbiology)","score_opus":0.048873266190342886,"score_gpt":0.3073935538931446,"score_spread":0.2585202877028017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502595148","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.0011286291,0.000087483255,0.99196225,0.000111232825,0.000037551305,0.00006783296,0.0000883277,0.0041367975,0.002379928],"genre_scores_gemma":[0.02227816,0.00024633695,0.97027,0.00016006871,0.000036505724,0.00019703552,0.0009367961,0.0015567623,0.004318358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936893,0.002072151,0.000965928,0.00068475446,0.0022362133,0.00035169668],"domain_scores_gemma":[0.9915754,0.0035218487,0.00042770858,0.002737827,0.0014259245,0.00031128945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010079067,0.0017148147,0.0012639482,0.0016049678,0.0007191995,0.0069597573,0.0051522464,0.0024098859,0.006854663],"category_scores_gemma":[0.013343763,0.0021378612,0.0022910438,0.0017215656,0.0013486756,0.007342013,0.0057237926,0.0072056525,0.005645952],"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.00029372083,0.00039086663,0.00072903326,0.0008580752,0.00015621213,0.0006976249,0.00251064,0.0148305455,0.024232036,0.57650036,0.018484859,0.36031598],"study_design_scores_gemma":[0.00022314643,0.00025471053,0.0003986992,0.0009221797,0.00027261843,0.0012877523,0.0004371379,0.28612486,0.046522964,0.28443375,0.3789565,0.00016572447],"about_ca_topic_score_codex":0.0011951796,"about_ca_topic_score_gemma":0.0018350013,"teacher_disagreement_score":0.010079067,"about_ca_system_score_codex":0.0008776388,"about_ca_system_score_gemma":0.0022812278,"threshold_uncertainty_score":0.053303838},"labels":[],"label_agreement":null},{"id":"W1502615931","doi":"10.1007/978-3-540-72606-7_115","title":"Outburst: Efficient Overlay Content Distribution with Rateless Codes","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Overlay; Upload; Overlay network; Computer network; Online codes; Content distribution; Node (physics); Resilience (materials science); Bandwidth (computing); Content (measure theory); Distributed computing; Decoding methods; Algorithm; Hamming code; The Internet; Operating system; Block code","score_opus":0.029314219322207753,"score_gpt":0.23697192569208894,"score_spread":0.20765770636988118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502615931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108288035,0.0010079563,0.86342496,0.00031603238,0.00028721956,0.0002352033,0.00051558507,0.017071562,0.008853467],"genre_scores_gemma":[0.7967705,0.0005039866,0.19211298,0.00015070493,0.000114758346,0.00012427817,0.0005693129,0.00074715604,0.008906359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993087,0.0001193072,0.000031294752,0.0000778283,0.0003211819,0.00014160569],"domain_scores_gemma":[0.99785477,0.00067958306,0.00011487306,0.00075970165,0.00041975922,0.00017123742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283345,0.0008306844,0.0013818744,0.0010342046,0.00092459336,0.0017727241,0.001947238,0.00063024554,0.002936367],"category_scores_gemma":[0.0038670334,0.00040119066,0.00024607207,0.0015795706,0.00073860376,0.0018614429,0.0027229774,0.0010066269,0.0007296837],"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.0026797084,0.00051135645,0.0015784346,0.0003295749,0.00009893604,0.0004894031,0.0005023778,0.24052268,0.057377536,0.07086368,0.041829318,0.58321697],"study_design_scores_gemma":[0.00010434805,0.00011349094,0.00020528988,0.000018642533,0.000021862155,0.0002109451,0.0000684467,0.9465674,0.02093736,0.025205392,0.006514667,0.00003217248],"about_ca_topic_score_codex":0.0039893785,"about_ca_topic_score_gemma":0.0051614055,"teacher_disagreement_score":0.0039893785,"about_ca_system_score_codex":0.0013034994,"about_ca_system_score_gemma":0.0013190887,"threshold_uncertainty_score":0.009823084},"labels":[],"label_agreement":null},{"id":"W1502653702","doi":"10.1007/978-3-642-13772-3_14","title":"A New SVM + NDA Model for Improved Classification and Recognition","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Support vector machine; Computer science; Decision boundary; Artificial intelligence; Linear discriminant analysis; Pattern recognition (psychology); Extension (predicate logic); Boundary (topology); Machine learning; Data mining; Mathematics","score_opus":0.0378367155671324,"score_gpt":0.2588933518337797,"score_spread":0.22105663626664732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502653702","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.0068812114,0.0008720025,0.98723674,0.00023780481,0.000523643,0.000049147326,0.00028402344,0.0023910191,0.0015244201],"genre_scores_gemma":[0.18346812,0.0008530549,0.7831333,0.000503402,0.00050812546,0.00033811308,0.002292447,0.0004723348,0.028431024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.000109556946,0.00005074166,0.00017375647,0.0002758946,0.00004954761],"domain_scores_gemma":[0.99913627,0.00014139236,0.000028869177,0.00014368622,0.0005029368,0.00004683482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008047834,0.000684292,0.0012904598,0.00059456663,0.0005253895,0.0011302808,0.0022008114,0.0012722325,0.004774817],"category_scores_gemma":[0.0013249007,0.00045090492,0.0010615891,0.0006461725,0.00023887263,0.0018004924,0.0010999071,0.0016548424,0.006344153],"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.00024022671,0.00021400834,0.0010581297,0.00014705057,0.00011888536,0.000066548935,0.00003082918,0.051048473,0.036775436,0.0047848704,0.01497536,0.8905403],"study_design_scores_gemma":[0.0000062400977,0.00003810149,0.0003417541,0.00000705992,0.000023776702,0.000065428445,0.000004285645,0.98736006,0.005233939,0.0010488848,0.00585859,0.000011940761],"about_ca_topic_score_codex":0.004018438,"about_ca_topic_score_gemma":0.0063236672,"teacher_disagreement_score":0.004774817,"about_ca_system_score_codex":0.00056059053,"about_ca_system_score_gemma":0.0007692805,"threshold_uncertainty_score":0.01597333},"labels":[],"label_agreement":null},{"id":"W1502683779","doi":"10.1007/3-540-45486-1_32","title":"Relational Learning with Transfer of Knowledge Between Domains","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Ottawa","funders":"","keywords":"Computer science; Knowledge transfer; Transfer of learning; Artificial intelligence; Knowledge management","score_opus":0.04950786020783364,"score_gpt":0.3313260317453667,"score_spread":0.281818171537533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502683779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022445388,0.00076174125,0.91796535,0.0006866307,0.00009337914,0.00007851847,0.000072937815,0.0006021567,0.057293765],"genre_scores_gemma":[0.44361964,0.0017390685,0.5157961,0.00025426134,0.00013095411,0.00024906694,0.0005235243,0.00017714451,0.037510272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991628,0.00028464143,0.0000415007,0.0002824638,0.00018691861,0.000041746895],"domain_scores_gemma":[0.99805224,0.0011148467,0.000091567716,0.0006116752,0.00006870378,0.000061029827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011493783,0.0005366689,0.00042395625,0.00042501645,0.00043721,0.0020354998,0.0017569378,0.0009939976,0.011877373],"category_scores_gemma":[0.0057749515,0.00042595156,0.00093273557,0.0008511725,0.0017327764,0.00854339,0.003485257,0.0021011143,0.0024422517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007710889,0.00016695072,0.0006629539,0.0003869503,0.000079563346,0.00019036591,0.0017161721,0.012742913,0.005721002,0.5785488,0.0045699608,0.3951373],"study_design_scores_gemma":[0.000025306568,0.00008295505,0.00045261244,0.000070155584,0.00004464207,0.00027232227,0.0002821253,0.037259787,0.0045317244,0.9369128,0.020047603,0.000017984055],"about_ca_topic_score_codex":0.0004852266,"about_ca_topic_score_gemma":0.00051190716,"teacher_disagreement_score":0.011877373,"about_ca_system_score_codex":0.00049922924,"about_ca_system_score_gemma":0.00045281608,"threshold_uncertainty_score":0.039733827},"labels":[],"label_agreement":null},{"id":"W1502751310","doi":"10.1007/11766247_10","title":"Bayesian Learning for Feed-Forward Neural Network with Application to Proteomic Data: The Glycosylation Sites Detection of the Epidermal Growth Factor-Like Proteins Associated with Cancer as a Case Study","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","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":"Concordia University","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Machine learning; Bayesian probability; Probabilistic neural network; Dynamic Bayesian network; Pruning; Time delay neural network; Data mining; Biology","score_opus":0.010090816942031452,"score_gpt":0.25425527956138533,"score_spread":0.24416446261935387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502751310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008710985,0.0014394915,0.9877658,0.00041006727,0.00007033867,0.000026261792,0.00010665452,0.0005211778,0.00094917504],"genre_scores_gemma":[0.29264244,0.0027881637,0.6939191,0.00025577942,0.00022233272,0.00025624383,0.0004941311,0.0002632688,0.009158543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995704,0.00016944518,0.00003587471,0.00007830139,0.000116844996,0.000029028406],"domain_scores_gemma":[0.99712306,0.0022573285,0.000092998634,0.00006476371,0.00042800631,0.000033884848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022270554,0.00091445993,0.0008768648,0.0005608182,0.00032488868,0.0008393528,0.001260993,0.0018953903,0.0022495836],"category_scores_gemma":[0.0071483566,0.00076698355,0.0006059735,0.0010522471,0.0004547518,0.0011195457,0.00087731564,0.0017017283,0.0005456294],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011123726,0.000091801594,0.0008076842,0.00017730407,0.00008841229,0.0001501496,0.00009155348,0.6866685,0.002332901,0.010138207,0.0039229803,0.29541928],"study_design_scores_gemma":[0.0000030242084,0.000008989561,0.000101497506,0.0000052146406,0.0000060544107,0.000012282621,0.0000032427079,0.99565244,0.0002939901,0.0036467079,0.00026103746,0.0000054475117],"about_ca_topic_score_codex":0.010325458,"about_ca_topic_score_gemma":0.013016386,"teacher_disagreement_score":0.010325458,"about_ca_system_score_codex":0.0008117279,"about_ca_system_score_gemma":0.00081925385,"threshold_uncertainty_score":0.0205307},"labels":[],"label_agreement":null},{"id":"W1502857873","doi":"10.1007/978-3-540-27777-4_4","title":"The Role of Process Measurement in Test-Driven Development","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"National Research Council Canada","funders":"","keywords":"Process (computing); Test (biology); Computer science; Geology; Paleontology; Programming language","score_opus":0.01934607856686939,"score_gpt":0.24640339706423026,"score_spread":0.22705731849736085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502857873","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.009755517,0.00508679,0.9679642,0.0012196593,0.00017455567,0.00008436872,0.000054043838,0.0020129909,0.013647955],"genre_scores_gemma":[0.5095053,0.003874906,0.48044285,0.000471563,0.00030106725,0.00035022805,0.00018796032,0.00086033216,0.0040057916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97874063,0.0107350135,0.0011690157,0.0013776001,0.0074683735,0.00050937117],"domain_scores_gemma":[0.8742857,0.10465837,0.0040315767,0.0111423265,0.005064061,0.000817926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015520367,0.0015809361,0.0013982767,0.00289746,0.0006568622,0.0058227004,0.0029427148,0.0022906906,0.002522475],"category_scores_gemma":[0.07436179,0.0013166324,0.00078917533,0.0032825323,0.00475499,0.011604798,0.0025521624,0.003965418,0.0010291163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026714097,0.00022163562,0.0039630807,0.00087424956,0.00009437551,0.00011505181,0.0010385753,0.027562043,0.004808386,0.23186775,0.0023264447,0.72686124],"study_design_scores_gemma":[0.00008154062,0.00065721275,0.003092794,0.00088168576,0.00016300404,0.00045221462,0.00031965922,0.34727046,0.02173675,0.60059994,0.02457146,0.00017339247],"about_ca_topic_score_codex":0.0017392584,"about_ca_topic_score_gemma":0.0011926601,"teacher_disagreement_score":0.015520367,"about_ca_system_score_codex":0.0016650979,"about_ca_system_score_gemma":0.0018837568,"threshold_uncertainty_score":0.08208048},"labels":[],"label_agreement":null},{"id":"W1503007957","doi":"10.1007/11788713_5","title":"Expressing Emotions Using Animated Text Captions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Information retrieval; Computer graphics (images)","score_opus":0.05864793147640571,"score_gpt":0.26693308789402137,"score_spread":0.20828515641761566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503007957","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13774085,0.0024176554,0.63706774,0.0020606404,0.0029927036,0.0007786278,0.003248298,0.016160827,0.19753267],"genre_scores_gemma":[0.65377384,0.0020972348,0.22867694,0.002021845,0.001092229,0.0013053594,0.004327045,0.0026702753,0.10403523],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998097,0.00008860558,0.0000091501215,0.000032724092,0.00003990226,0.000019859546],"domain_scores_gemma":[0.9992343,0.0005360413,0.000041565425,0.000050689257,0.00010240273,0.0000349546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002802636,0.00090540334,0.00026850996,0.00016325506,0.00022684905,0.00094719656,0.00062139553,0.0009345693,0.031029407],"category_scores_gemma":[0.001981207,0.00018507392,0.00030372996,0.00016970857,0.00033822263,0.0014909089,0.0008102379,0.0006735493,0.0057422207],"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.0020837262,0.0002866776,0.0005095677,0.0021553778,0.00009697355,0.0018362245,0.0041332277,0.018462716,0.42016333,0.023255687,0.1620332,0.3649833],"study_design_scores_gemma":[0.00046315306,0.0014305683,0.005423247,0.0010739125,0.00026674956,0.002175708,0.0025411374,0.25862765,0.236537,0.047771923,0.44341612,0.00027289073],"about_ca_topic_score_codex":0.00012209028,"about_ca_topic_score_gemma":0.00019294879,"teacher_disagreement_score":0.031029407,"about_ca_system_score_codex":0.00016900111,"about_ca_system_score_gemma":0.000052685227,"threshold_uncertainty_score":0.103803694},"labels":[],"label_agreement":null},{"id":"W1503056535","doi":"10.1007/3-540-46513-8_15","title":"Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":64,"is_retracted":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":"Verifiable secret sharing; Secret sharing; Scheme (mathematics); Cheating; Computer science; Access structure; Construct (python library); Computer security; Homomorphic secret sharing; Adversary; Theoretical computer science; Secure multi-party computation; Cryptography; Computer network; Mathematics; Set (abstract data type)","score_opus":0.010263107160238224,"score_gpt":0.22471778286306976,"score_spread":0.21445467570283153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503056535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10740641,0.000560595,0.84384614,0.0011706478,0.00023884822,0.00032632612,0.00062550994,0.002057075,0.04376847],"genre_scores_gemma":[0.89253104,0.0002955311,0.09110162,0.00025310702,0.00012642668,0.00031252654,0.00050304167,0.000109672044,0.014767081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975006,0.00057748624,0.00017060673,0.00036051628,0.00096966705,0.00042099392],"domain_scores_gemma":[0.9961547,0.0012075705,0.00038041477,0.0017254319,0.00029995895,0.0002319849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013986662,0.000713235,0.0010256662,0.0008647532,0.0016437044,0.0037371952,0.002314395,0.00153649,0.004033326],"category_scores_gemma":[0.0028980675,0.00059763633,0.0008864474,0.0016711178,0.0017737657,0.0051282956,0.0038759562,0.0027551714,0.0017118019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004959838,0.00016537975,0.00024549913,0.00016354704,0.000043103188,0.00015993301,0.00021358787,0.019408999,0.022607123,0.91139793,0.0037817967,0.04131711],"study_design_scores_gemma":[0.00025165227,0.00042974768,0.00034971425,0.00005532476,0.00012018162,0.00076701347,0.00008847906,0.19981843,0.031052882,0.7547935,0.012140882,0.00013221301],"about_ca_topic_score_codex":0.00023480403,"about_ca_topic_score_gemma":0.00027322705,"teacher_disagreement_score":0.004033326,"about_ca_system_score_codex":0.0015646524,"about_ca_system_score_gemma":0.0026607532,"threshold_uncertainty_score":0.013492823},"labels":[],"label_agreement":null},{"id":"W1503091585","doi":"10.1007/978-3-642-03555-5_8","title":"Optimizing XML Compression","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Lossless compression; Data compression; XML; Encoding (memory); Compression (physics); Data compression ratio; Set (abstract data type)","score_opus":0.017331452299173072,"score_gpt":0.2503684150358275,"score_spread":0.23303696273665445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503091585","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.07861253,0.0046084463,0.8172388,0.0009079554,0.0006487597,0.0002668758,0.0013001136,0.023921665,0.07249487],"genre_scores_gemma":[0.39801463,0.0020179902,0.5413882,0.00041538992,0.00033441256,0.00018579466,0.004177226,0.0023460123,0.05112031],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992768,0.00008972231,0.00004931154,0.000102050944,0.00040394434,0.00007820064],"domain_scores_gemma":[0.99927586,0.00022163727,0.00003532812,0.00026214265,0.00018764887,0.000017316634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038416628,0.00095358933,0.0006548398,0.0011020362,0.0004667542,0.0013314037,0.0011419778,0.00065243465,0.014389306],"category_scores_gemma":[0.00184068,0.0004064291,0.00041345423,0.0020925067,0.00035469935,0.0017953251,0.0009413913,0.00072022073,0.004085378],"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.00035656054,0.00012473151,0.0007322171,0.00021762669,0.000040625982,0.00017055019,0.000065083295,0.028867591,0.043158587,0.024631275,0.029884977,0.8717502],"study_design_scores_gemma":[0.000096543496,0.0002299281,0.0013432191,0.000086827895,0.00011604682,0.00100642,0.00012251447,0.6346701,0.25170046,0.050593577,0.05998107,0.000053256517],"about_ca_topic_score_codex":0.0011514028,"about_ca_topic_score_gemma":0.0017359961,"teacher_disagreement_score":0.014389306,"about_ca_system_score_codex":0.0005549081,"about_ca_system_score_gemma":0.00052395667,"threshold_uncertainty_score":0.04813701},"labels":[],"label_agreement":null},{"id":"W1503119185","doi":"10.1007/3-540-36136-7_56","title":"Expected Acceptance Counts for Finite Automata with Almost Uniform Input","year":2002,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reciprocal; Sequence (biology); Mathematics; Prefix; Automaton; Entropy (arrow of time); Discrete mathematics; Constant (computer programming); Random sequence; Finite-state machine; Algorithm; Computer science; Distribution (mathematics); Theoretical computer science","score_opus":0.016065270335361096,"score_gpt":0.2365474981994039,"score_spread":0.2204822278640428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503119185","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.51863897,0.00033067184,0.466444,0.0017310127,0.00012241326,0.00021578804,0.0008298008,0.0019053093,0.009782055],"genre_scores_gemma":[0.97072583,0.00011362101,0.024617778,0.00020700558,0.00016858848,0.00034643282,0.0006002377,0.00044983882,0.0027705575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886669,0.0038494223,0.0008934487,0.002010089,0.0025874132,0.0019927165],"domain_scores_gemma":[0.7945479,0.17079721,0.0059470497,0.011557857,0.0098053785,0.0073446142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0091418335,0.0014035319,0.003199115,0.0020855535,0.0018873536,0.00787014,0.0055573564,0.0031267833,0.010447088],"category_scores_gemma":[0.076122954,0.0017478099,0.0020720067,0.0014600147,0.0034923095,0.01230063,0.003575682,0.0050993734,0.0010204755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040175295,0.0009723172,0.0133473305,0.000820323,0.00035034528,0.00065505074,0.0017737763,0.11675571,0.014732782,0.8057194,0.0048577073,0.03599775],"study_design_scores_gemma":[0.00019014369,0.00025022414,0.0017129383,0.00004782941,0.000106661755,0.00030833535,0.00017501778,0.4417446,0.0065292963,0.5482289,0.0006163764,0.000089609865],"about_ca_topic_score_codex":0.00067317387,"about_ca_topic_score_gemma":0.0009071243,"teacher_disagreement_score":0.010447088,"about_ca_system_score_codex":0.0033514986,"about_ca_system_score_gemma":0.0023856482,"threshold_uncertainty_score":0.048347235},"labels":[],"label_agreement":null},{"id":"W1503144293","doi":"10.1007/3-540-44612-5_24","title":"Optical Routing of Uniform Instances in Tori","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.009814740188694736,"score_gpt":0.21902476374282198,"score_spread":0.20921002355412724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503144293","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.4647198,0.0011838119,0.41283798,0.0014288223,0.00037152943,0.00033960846,0.0017249158,0.002075687,0.11531787],"genre_scores_gemma":[0.8315414,0.00080111553,0.13422172,0.00018885016,0.00009665883,0.00016854447,0.0016897718,0.00043342452,0.03085853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957186,0.000092096794,0.000026374602,0.00008782869,0.00006677215,0.00015517647],"domain_scores_gemma":[0.9992556,0.0002745057,0.00009875364,0.00018805676,0.00009029518,0.00009283472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004706945,0.0005683031,0.00092460227,0.00077100843,0.0016109139,0.0022695388,0.0018595841,0.0006750112,0.007366669],"category_scores_gemma":[0.001997707,0.00050822966,0.0004972495,0.0017374909,0.00078823284,0.0026028361,0.0015458255,0.001120492,0.0006451498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008156823,0.00016793687,0.0013558432,0.0003065449,0.00008261458,0.00035771396,0.00040465876,0.30408666,0.005721178,0.5402539,0.031470284,0.114976995],"study_design_scores_gemma":[0.00006717759,0.00008969197,0.00061845157,0.000051718056,0.0000375022,0.00016849786,0.0003609919,0.69913507,0.004356468,0.282716,0.012370329,0.000028133829],"about_ca_topic_score_codex":0.0040337592,"about_ca_topic_score_gemma":0.0079521,"teacher_disagreement_score":0.007366669,"about_ca_system_score_codex":0.002038044,"about_ca_system_score_gemma":0.0007614837,"threshold_uncertainty_score":0.024643898},"labels":[],"label_agreement":null},{"id":"W1503147567","doi":"10.1007/11415770_5","title":"Finding Novel Transcripts in High-Resolution Genome-Wide Microarray Data Using the GenRate Model","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Computer science; Tiling array; Genome; Generative model; DNA microarray; Hierarchical clustering; Computational biology; Noise (video); Data mining; Generative grammar; Algorithm; Pattern recognition (psychology); Gene; Genetics; Artificial intelligence; Biology; Image (mathematics); Gene expression","score_opus":0.057436204707222036,"score_gpt":0.2800983128183708,"score_spread":0.22266210811114873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503147567","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.025926523,0.0005657224,0.9690184,0.0003381653,0.000053933778,0.00006626247,0.0011198687,0.0021627513,0.00074849895],"genre_scores_gemma":[0.3090608,0.0020578196,0.6734667,0.0005226254,0.00022663728,0.00070679927,0.0063971723,0.0012128185,0.0063486877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989825,0.00034519672,0.00004910441,0.0003121184,0.00022941963,0.0000817447],"domain_scores_gemma":[0.9975713,0.0018293157,0.00015275308,0.00025412746,0.00013476891,0.000057664878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033112848,0.0013197962,0.0021334684,0.0016641675,0.0005946511,0.0017710886,0.002359985,0.0018147089,0.0028405953],"category_scores_gemma":[0.0049960203,0.0009117133,0.004554771,0.0018857672,0.0010852303,0.0018433268,0.0010838707,0.0016017419,0.0015350984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008432677,0.00015454645,0.006421324,0.00041738903,0.0004850697,0.0004098813,0.0001383121,0.78747404,0.030464983,0.026463835,0.004045601,0.14268173],"study_design_scores_gemma":[0.000026725338,0.000029763249,0.00052175514,0.0000091782895,0.000039064853,0.0000935806,0.0000088977695,0.9790223,0.001590871,0.017942708,0.0006985844,0.000016640732],"about_ca_topic_score_codex":0.0038125084,"about_ca_topic_score_gemma":0.009571063,"teacher_disagreement_score":0.0038125084,"about_ca_system_score_codex":0.001313149,"about_ca_system_score_gemma":0.0010118796,"threshold_uncertainty_score":0.017511964},"labels":[],"label_agreement":null},{"id":"W1503183250","doi":"10.1007/978-3-540-88030-1_16","title":"An Iterative Framework for Software Architecture Recovery: An Experience Report","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software architecture; Reference architecture; Architecture; Software engineering; Process (computing); Architecture tradeoff analysis method; Iterative and incremental development; Software; Software architecture description; View model; Programming language","score_opus":0.041699761791025074,"score_gpt":0.3225183141990595,"score_spread":0.28081855240803444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503183250","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.016812947,0.00037750317,0.9713641,0.00014931202,0.000023790995,0.0002284028,0.000052346608,0.0052654203,0.0057261796],"genre_scores_gemma":[0.098785795,0.00044684586,0.8930499,0.000053434258,0.000014614676,0.00018547087,0.00040907235,0.0007013158,0.006353538],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714154,0.0010196927,0.00014028754,0.00032576174,0.0011472194,0.00022546788],"domain_scores_gemma":[0.9962669,0.0012510465,0.00015382112,0.0013361241,0.0008341094,0.00015811627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035508366,0.0009439496,0.0005147402,0.0011291901,0.001101989,0.0020591863,0.002600453,0.0011464669,0.0054336595],"category_scores_gemma":[0.005694556,0.0006668882,0.0011024001,0.0011079335,0.001093595,0.003077243,0.0022275734,0.0021024444,0.0020383417],"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.00023867797,0.0005997887,0.0015676228,0.0002887541,0.00004870328,0.00021389019,0.002255971,0.020693706,0.017478766,0.035537053,0.007285668,0.9137914],"study_design_scores_gemma":[0.00029513842,0.0013266905,0.0037371512,0.00035006434,0.00023332014,0.0023751187,0.0021715239,0.7208682,0.08324364,0.0707376,0.114481054,0.00018047559],"about_ca_topic_score_codex":0.0063130185,"about_ca_topic_score_gemma":0.0058797025,"teacher_disagreement_score":0.0063130185,"about_ca_system_score_codex":0.00074774824,"about_ca_system_score_gemma":0.002744419,"threshold_uncertainty_score":0.01877886},"labels":[],"label_agreement":null},{"id":"W1503237970","doi":"10.1007/978-3-540-70540-6_13","title":"Investigating Usability Metrics for the Design and Development of Applications for the Elderly","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":108,"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":"Usability; Computer science; Usability lab; Usability engineering; Human–computer interaction; Set (abstract data type); Cognitive walkthrough; Web usability; Usability inspection; Heuristic evaluation; Usability goals; Pluralistic walkthrough","score_opus":0.0641012427381613,"score_gpt":0.30314751940028145,"score_spread":0.23904627666212014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503237970","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.9173259,0.0068029286,0.065593496,0.00060044054,0.00011218365,0.0016573431,0.00053055846,0.0005065695,0.0068706064],"genre_scores_gemma":[0.9002736,0.0013805311,0.09516813,0.00008689792,0.000028984745,0.0011282379,0.0007406228,0.00012956349,0.001063488],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.967817,0.017377794,0.0046290937,0.00096437975,0.0085242,0.00068747613],"domain_scores_gemma":[0.781039,0.15982057,0.015322972,0.00551289,0.03644983,0.0018546896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.034621578,0.001083182,0.0008874383,0.005424705,0.0008254396,0.0040920475,0.0009821333,0.0009730226,0.0007876265],"category_scores_gemma":[0.17231146,0.00048262655,0.0009438993,0.0038813686,0.0007775731,0.0036186806,0.0016421528,0.0010865155,0.00021030295],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014488447,0.0017929,0.23245776,0.004680062,0.00067200034,0.00024256652,0.022757515,0.0050085466,0.015952757,0.0052025886,0.005382626,0.7044019],"study_design_scores_gemma":[0.0005673074,0.02170893,0.7824593,0.0052652825,0.0024330984,0.0014011192,0.03288515,0.07625297,0.036591455,0.013934637,0.025950875,0.0005498844],"about_ca_topic_score_codex":0.003936815,"about_ca_topic_score_gemma":0.0064013186,"teacher_disagreement_score":0.034621578,"about_ca_system_score_codex":0.0018841845,"about_ca_system_score_gemma":0.0019973048,"threshold_uncertainty_score":0.18309861},"labels":[],"label_agreement":null},{"id":"W1503257002","doi":"10.1007/978-3-642-04843-2_17","title":"A Point Symmetry-Based Automatic Clustering Approach Using Differential Evolution","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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":"Western University","funders":"","keywords":"Cluster analysis; Computer science; Point (geometry); Cluster (spacecraft); Symmetry (geometry); Measure (data warehouse); Differential evolution; Representation (politics); Data mining; Algorithm; Artificial intelligence; Pattern recognition (psychology); Mathematics; Geometry","score_opus":0.026122202958597254,"score_gpt":0.27955413089078135,"score_spread":0.2534319279321841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503257002","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.005505902,0.00004395448,0.9928269,0.000029649445,0.000026309244,0.000037571597,0.000020537356,0.00035157226,0.0011575301],"genre_scores_gemma":[0.102523744,0.00008224874,0.89316636,0.000050853523,0.000028367915,0.00010752424,0.00014533704,0.0002579488,0.0036375122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945325,0.00007974294,0.00002524431,0.000121468875,0.00027379152,0.000046439185],"domain_scores_gemma":[0.9993401,0.00016549873,0.000052143627,0.00014815699,0.00025118658,0.000042883872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071326905,0.0005458546,0.0014746661,0.0017326833,0.00085734786,0.0010904726,0.0025070307,0.001154053,0.0027489632],"category_scores_gemma":[0.0013420116,0.0005494593,0.0015132827,0.0014387908,0.00072012015,0.0010308169,0.0017160478,0.00090601697,0.0012593234],"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.0001631865,0.00015802405,0.0008627849,0.00024662478,0.00016733396,0.00020265974,0.00036498276,0.24618185,0.07794875,0.0705992,0.0050948,0.59800977],"study_design_scores_gemma":[0.00000904793,0.000022629438,0.00018284582,0.000004486438,0.000012978298,0.00007962607,0.000019551639,0.98663914,0.003992744,0.0076181665,0.0014021777,0.000016573586],"about_ca_topic_score_codex":0.0025791533,"about_ca_topic_score_gemma":0.002666631,"teacher_disagreement_score":0.0027489632,"about_ca_system_score_codex":0.0007978114,"about_ca_system_score_gemma":0.00076860416,"threshold_uncertainty_score":0.009196222},"labels":[],"label_agreement":null},{"id":"W1503304438","doi":"10.1007/11566465_30","title":"Semi-automated Basal Ganglia Segmentation Using Large Deformation Diffeomorphic Metric Mapping","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genetic Neurodegenerative Diseases","field":"Neuroscience","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Computer vision; Computer science; Segmentation; Landmark; Image segmentation; Image registration; Matching (statistics); Scale-space segmentation; Metric (unit); Pattern recognition (psychology); Diffeomorphism; Template matching; Image (mathematics); Segmentation-based object categorization; Mathematics","score_opus":0.028965356999534498,"score_gpt":0.2831808620902943,"score_spread":0.2542155050907598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503304438","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.02790383,0.000307916,0.9685185,0.00015194966,0.000037455047,0.00009383612,0.00018772621,0.0019318176,0.00086692447],"genre_scores_gemma":[0.30916572,0.00040376914,0.6864806,0.00009729258,0.000051842973,0.00016079262,0.00057795405,0.00084220315,0.0022198781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960154,0.00010128834,0.000028320846,0.00009445767,0.00012747779,0.00004683594],"domain_scores_gemma":[0.99927133,0.00032790157,0.00007304663,0.00017012787,0.0001247068,0.000032840555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007875305,0.0009027649,0.0011832645,0.0016688776,0.0004948765,0.0017436999,0.0010333507,0.001345246,0.0019612797],"category_scores_gemma":[0.0022048864,0.0008414649,0.0011352208,0.0013682331,0.00049110077,0.0008974616,0.0010844475,0.0009959191,0.0009675743],"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.0005923621,0.00012495172,0.0020821418,0.00045715558,0.0002784204,0.0006530976,0.0004051016,0.13388015,0.15284957,0.0071005966,0.0048359307,0.6967405],"study_design_scores_gemma":[0.00004072119,0.0000966522,0.0030105275,0.000034588178,0.000058742284,0.0009407168,0.00008423372,0.9386294,0.041786805,0.011749074,0.0035035298,0.00006494271],"about_ca_topic_score_codex":0.0041410173,"about_ca_topic_score_gemma":0.005827621,"teacher_disagreement_score":0.0041410173,"about_ca_system_score_codex":0.0004699306,"about_ca_system_score_gemma":0.0011554952,"threshold_uncertainty_score":0.008233786},"labels":[],"label_agreement":null},{"id":"W1503321858","doi":"10.1007/978-3-642-17650-0_19","title":"Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Negotiation; Vickrey–Clarke–Groves auction; Common value auction; Commitment scheme; Generalized second-price auction; Construct (python library); Reverse auction; Auction theory; Vickrey auction; Computer security; Protocol (science); Revenue equivalence; Auction algorithm; Double auction; Distributed computing; Theoretical computer science; Cryptography; Computer network; Microeconomics; Mathematics; Law","score_opus":0.026775647695604053,"score_gpt":0.2772296855446453,"score_spread":0.25045403784904124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503321858","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.050220948,0.00044070822,0.91793305,0.0010423145,0.00030700152,0.00036647837,0.0002075112,0.0016749115,0.027807157],"genre_scores_gemma":[0.73538095,0.0005688837,0.22382765,0.00025597302,0.000223724,0.00047766673,0.00032122718,0.00036303414,0.03858097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597824,0.00077033235,0.00034764624,0.00055381184,0.0017696765,0.0005803394],"domain_scores_gemma":[0.9944851,0.0015738218,0.00035599794,0.0028802855,0.0004727007,0.00023216328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002914177,0.00092278,0.0015463377,0.0007902767,0.002270661,0.0054424875,0.0038475005,0.0024890644,0.0065474855],"category_scores_gemma":[0.0052603334,0.0011429932,0.0011873959,0.0016061914,0.0024100433,0.011184099,0.006136661,0.0060657416,0.0028930632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042371612,0.00021721757,0.0001715233,0.00018487233,0.00005904487,0.00018537886,0.00030184776,0.015137276,0.014918094,0.91629726,0.003056088,0.04904762],"study_design_scores_gemma":[0.00018953148,0.00022859419,0.00025554013,0.00006073055,0.00008070666,0.0005853311,0.000081621096,0.14753173,0.029068056,0.80690515,0.014874749,0.00013833925],"about_ca_topic_score_codex":0.00026857373,"about_ca_topic_score_gemma":0.0003091278,"teacher_disagreement_score":0.0065474855,"about_ca_system_score_codex":0.0015053191,"about_ca_system_score_gemma":0.0019511693,"threshold_uncertainty_score":0.021903515},"labels":[],"label_agreement":null},{"id":"W1503346029","doi":"10.1007/11575801_11","title":"JXTA Messaging: Analysis of Feature-Performance Tradeoffs and Implications for System Design","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"Computer science; Workload; Peer-to-peer; Grid system; Distributed computing; Feature (linguistics); Limiting; Grid; Computer network; Systems design; Operating system; Software engineering","score_opus":0.02757912104875988,"score_gpt":0.25624463892237553,"score_spread":0.22866551787361566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503346029","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.72423494,0.0032986687,0.23890516,0.001888205,0.00022467918,0.0001880049,0.00035540533,0.003646258,0.027258793],"genre_scores_gemma":[0.9512533,0.00038069795,0.042796485,0.00010155562,0.00013670546,0.000073168354,0.000191167,0.00055437995,0.004512507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642146,0.0008541908,0.00015002055,0.0003766872,0.0016009413,0.00059668394],"domain_scores_gemma":[0.9720168,0.021971537,0.0013247412,0.0021880837,0.0020890404,0.000409732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051867743,0.0008120137,0.0010260933,0.0012988559,0.0011825952,0.004576776,0.0022459188,0.0013196932,0.0073728506],"category_scores_gemma":[0.027923325,0.0007308209,0.0006410369,0.0020240713,0.0007930388,0.0069325166,0.0010168818,0.0018613479,0.00090175215],"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.006341564,0.0014292467,0.022454506,0.0012978174,0.00022233833,0.000608271,0.0016027426,0.19442478,0.14987692,0.16723862,0.01894353,0.43555975],"study_design_scores_gemma":[0.00015228856,0.00068201026,0.0056814034,0.000053107487,0.00024879267,0.00034511942,0.00036724214,0.9143919,0.033510994,0.0415369,0.0029725714,0.000057793066],"about_ca_topic_score_codex":0.0011508375,"about_ca_topic_score_gemma":0.0017793432,"teacher_disagreement_score":0.0073728506,"about_ca_system_score_codex":0.0016991259,"about_ca_system_score_gemma":0.0012102535,"threshold_uncertainty_score":0.027430654},"labels":[],"label_agreement":null},{"id":"W1503365423","doi":"10.1007/978-3-540-45193-8_35","title":"Discrepancy-Based Additive Bounding for the AllDifferent Constraint","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université de Montréal","funders":"","keywords":"Bounding overwatch; Computer science; Constraint programming; Constraint (computer-aided design); Mathematical optimization; Relaxation (psychology); Constraint satisfaction; Upper and lower bounds; Branch and bound; Heuristic; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.018828133467984006,"score_gpt":0.2502116011789794,"score_spread":0.23138346771099538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503365423","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.003039585,0.0009472443,0.98908293,0.00038303182,0.00014193813,0.000023847533,0.00006663503,0.00022458786,0.0060902624],"genre_scores_gemma":[0.19148065,0.0017967579,0.7871507,0.000585097,0.0006686397,0.00024881188,0.00058183965,0.0007731273,0.016714327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99313337,0.0022501852,0.00032999853,0.0008792553,0.0028980817,0.0005091421],"domain_scores_gemma":[0.98643756,0.0092774965,0.000453544,0.0022112622,0.0011879595,0.00043218286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057044546,0.0024338944,0.002727171,0.0021428752,0.0010831542,0.0032180776,0.006342617,0.002098105,0.0070344745],"category_scores_gemma":[0.019599786,0.0013399574,0.0025719285,0.0030473252,0.0032061555,0.007856573,0.010414932,0.010220808,0.0012823029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002121761,0.00008446006,0.00036128392,0.0003642568,0.00007932057,0.00009714908,0.00018984855,0.13145618,0.0034011693,0.73285705,0.009292238,0.1216049],"study_design_scores_gemma":[0.000022144735,0.000044784694,0.00016310491,0.000058887963,0.000035078698,0.00010698578,0.00002069529,0.65310854,0.0020773583,0.3375594,0.006769391,0.00003367067],"about_ca_topic_score_codex":0.001953704,"about_ca_topic_score_gemma":0.002077474,"teacher_disagreement_score":0.0070344745,"about_ca_system_score_codex":0.0025383907,"about_ca_system_score_gemma":0.0015966265,"threshold_uncertainty_score":0.030168355},"labels":[],"label_agreement":null},{"id":"W1503366497","doi":"10.1007/11589990_120","title":"Machine Learning for Time Interval Petri Nets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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 Alberta","funders":"","keywords":"Petri net; Computer science; Domain (mathematical analysis); Automation; Interval (graph theory); Task (project management); Artificial intelligence; Process architecture; Machine learning; Programming language; Systems engineering","score_opus":0.020968842479851497,"score_gpt":0.25492688581016293,"score_spread":0.23395804333031142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503366497","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.0044883224,0.0012128274,0.9918783,0.00017137233,0.00007687069,0.000027899616,0.000096098534,0.00037823297,0.0016700823],"genre_scores_gemma":[0.4430084,0.0032214134,0.54073125,0.00019532104,0.00039016272,0.00036786168,0.0012225589,0.00021546525,0.010647614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992588,0.00025579776,0.0000514597,0.00019512695,0.00016383627,0.00007499133],"domain_scores_gemma":[0.99555355,0.0036626842,0.00017301519,0.00021906613,0.00032212952,0.000069585054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016816388,0.0007828208,0.0011839567,0.000858267,0.0004020151,0.0010510514,0.0018017251,0.0008407748,0.0033170495],"category_scores_gemma":[0.006911627,0.0004613085,0.0008938097,0.001279196,0.0006021851,0.0017757625,0.0008641499,0.002046431,0.0006281877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008048542,0.0000744796,0.00061725115,0.00018236933,0.00007032835,0.00005790152,0.000047483907,0.7345061,0.0006428247,0.062907375,0.0031617472,0.19765171],"study_design_scores_gemma":[0.000003476643,0.0000068542813,0.00005745942,0.0000091501215,0.000004581818,0.00000802291,0.0000031862025,0.96062493,0.00014397832,0.038663443,0.0004721696,0.0000029216415],"about_ca_topic_score_codex":0.004902948,"about_ca_topic_score_gemma":0.0036697027,"teacher_disagreement_score":0.004902948,"about_ca_system_score_codex":0.0010968361,"about_ca_system_score_gemma":0.0009259683,"threshold_uncertainty_score":0.011096656},"labels":[],"label_agreement":null},{"id":"W1503390214","doi":"10.1007/bfb0032065","title":"Provable computable functions on abstract data types","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Assertion; Primitive recursive function; Corollary; Computable function; Computability; Scheme (mathematics); Computer science; Context (archaeology); Theoretical computer science; Data type; Mathematics; Type (biology); Natural number; Function (biology); Algebra over a field; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.04394122110418095,"score_gpt":0.2713834169118484,"score_spread":0.22744219580766747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503390214","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.012065096,0.001301092,0.928419,0.0028250227,0.0004699381,0.00010893588,0.0008136297,0.0028755313,0.051121816],"genre_scores_gemma":[0.36266518,0.0036783277,0.54239595,0.0021140766,0.0011324603,0.0007526468,0.0033076156,0.0030100273,0.0809438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645776,0.0007762614,0.0003493963,0.0007317722,0.0013523006,0.00033251286],"domain_scores_gemma":[0.9914083,0.005937915,0.00024289604,0.0016259464,0.00060999976,0.00017499033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025243065,0.0016522212,0.0013718794,0.0014949818,0.0015983279,0.007250394,0.0029776334,0.0021418168,0.011054871],"category_scores_gemma":[0.011706071,0.0022035555,0.0023419433,0.0025880102,0.004683549,0.023207061,0.005422274,0.010998022,0.003190229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046500845,0.000025824836,0.00013129025,0.00025167406,0.000012811267,0.00004432333,0.0003091502,0.0014223865,0.0012404572,0.960357,0.0043666638,0.03179189],"study_design_scores_gemma":[0.000019792808,0.000010572859,0.0000717958,0.000060969225,0.000015818534,0.00008040273,0.000043619304,0.003148606,0.002085218,0.9754087,0.019041626,0.0000128907195],"about_ca_topic_score_codex":0.0006912298,"about_ca_topic_score_gemma":0.0007551584,"teacher_disagreement_score":0.011054871,"about_ca_system_score_codex":0.00259708,"about_ca_system_score_gemma":0.0018450998,"threshold_uncertainty_score":0.03698224},"labels":[],"label_agreement":null},{"id":"W1503393710","doi":"10.1007/978-3-642-17517-6_25","title":"Computing Sparse Multiples of Polynomials","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Degree (music); Multiple; Combinatorics; Finite field; Polynomial; Extension (predicate logic); Computational complexity theory; Constant (computer programming); Discrete mathematics; Mathematics; Time complexity; Field (mathematics); Order (exchange); Algorithm; Computer science; Arithmetic; Pure mathematics; Physics; Mathematical analysis","score_opus":0.018457738780916284,"score_gpt":0.24135644795938668,"score_spread":0.2228987091784704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503393710","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.16529812,0.0016583089,0.7715764,0.0021240863,0.00060497783,0.0000914336,0.000922921,0.0023355011,0.05538823],"genre_scores_gemma":[0.62284476,0.0013578702,0.33996302,0.00046909865,0.0007198497,0.00009001472,0.001978093,0.0005400214,0.03203736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994173,0.00010634946,0.000026358655,0.00013681741,0.00022884522,0.00008429752],"domain_scores_gemma":[0.99844307,0.00079390267,0.00011418386,0.00034000826,0.00020210612,0.00010680025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709382,0.0007687767,0.0010321903,0.0010423894,0.000673272,0.0016165029,0.0007674394,0.00060775405,0.012054432],"category_scores_gemma":[0.005115738,0.0005295769,0.0004369825,0.0019795322,0.0008026073,0.0033706774,0.002150194,0.0015499382,0.0028740335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058840815,0.000106197316,0.00160509,0.00044313836,0.00009510863,0.00032048544,0.00036225925,0.04445547,0.020507693,0.40345168,0.035271753,0.4927927],"study_design_scores_gemma":[0.00007415047,0.00014485967,0.0005600465,0.00008622663,0.000043732427,0.0005193401,0.00018223877,0.21469338,0.012212591,0.74523807,0.026210764,0.000034573197],"about_ca_topic_score_codex":0.00043532584,"about_ca_topic_score_gemma":0.0013628218,"teacher_disagreement_score":0.012054432,"about_ca_system_score_codex":0.0005464171,"about_ca_system_score_gemma":0.0004660848,"threshold_uncertainty_score":0.04032612},"labels":[],"label_agreement":null},{"id":"W1503428979","doi":"10.1007/3-540-48080-3_9","title":"Characterizing the Citation Graph as a Self-Organizing Networked Information Space","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Citation; Graph; The Internet; Digital library; Information retrieval; Information space; Space (punctuation); Theoretical computer science; World Wide Web; Data science","score_opus":0.01271505120369952,"score_gpt":0.21073858859869204,"score_spread":0.1980235373949925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503428979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42497948,0.0035011887,0.5427291,0.0023824663,0.00017214597,0.00014604963,0.0021205286,0.0009540286,0.023015054],"genre_scores_gemma":[0.9027438,0.0023335468,0.08698797,0.00016590525,0.0003746896,0.00015869927,0.0016702511,0.00018279208,0.0053822915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911505,0.00026339214,0.00006365617,0.00020279974,0.0002913993,0.00006370912],"domain_scores_gemma":[0.9907308,0.006013405,0.0010484064,0.00085897034,0.000947037,0.00040135309],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00088450057,0.0003147703,0.00067632966,0.00816528,0.0012350413,0.0040111067,0.0011134667,0.001524099,0.0025573326],"category_scores_gemma":[0.013076291,0.00039611387,0.00061177195,0.009022317,0.0016584401,0.0068142987,0.0012593026,0.0007723101,0.0004971469],"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.00010632614,0.00016077352,0.016552918,0.00044227543,0.00014898162,0.00038810764,0.001113453,0.081391335,0.0060815923,0.77899164,0.008808286,0.10581439],"study_design_scores_gemma":[0.000012697527,0.000028617214,0.0038811148,0.000046014757,0.000060283015,0.00030695775,0.00031723775,0.20404586,0.0012574277,0.7818296,0.008183171,0.000031007665],"about_ca_topic_score_codex":0.0015511799,"about_ca_topic_score_gemma":0.0018446827,"teacher_disagreement_score":0.9918347,"about_ca_system_score_codex":0.00068287406,"about_ca_system_score_gemma":0.00055,"threshold_uncertainty_score":0.008555174},"labels":[],"label_agreement":null},{"id":"W1503432885","doi":"10.1007/978-3-642-05039-8_4","title":"Open Policies for Decentralized User Modeling in Online Communities","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Interoperability; Computer science; Focus (optics); World Wide Web; Authentication (law); User modeling; User agent; Online community; Computer security; User interface","score_opus":0.08152974497258464,"score_gpt":0.35286066841935143,"score_spread":0.2713309234467668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503432885","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.009984494,0.0000878176,0.9874598,0.0004556458,0.000037457798,0.00006104024,0.00006518075,0.00020015547,0.0016483625],"genre_scores_gemma":[0.71560025,0.00034549588,0.27373195,0.0002319042,0.00018381032,0.0005338664,0.00025533192,0.0002563887,0.008860976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9911903,0.0046495465,0.00040713212,0.0011869052,0.0017734456,0.0007926583],"domain_scores_gemma":[0.96768874,0.0232207,0.0012526411,0.004557548,0.0018811579,0.0013991989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011605854,0.00081519585,0.0023704728,0.0010526236,0.0025747751,0.00443638,0.0045782146,0.0029027893,0.0039378772],"category_scores_gemma":[0.04209717,0.0014051059,0.0021006465,0.0015087137,0.0039763036,0.010145724,0.0070353635,0.005996901,0.000708208],"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.00012911673,0.00010873538,0.000799761,0.000061290535,0.00004684556,0.000094304225,0.0006227656,0.3399584,0.00056809955,0.63648266,0.001988057,0.019139932],"study_design_scores_gemma":[0.000010736756,0.0000083436,0.000038820755,0.0000092877945,0.000008008359,0.000016053702,0.00004404421,0.7823231,0.00018925908,0.21668461,0.00065808406,0.000009763014],"about_ca_topic_score_codex":0.006509245,"about_ca_topic_score_gemma":0.0067058,"teacher_disagreement_score":0.011605854,"about_ca_system_score_codex":0.0038466419,"about_ca_system_score_gemma":0.0041499073,"threshold_uncertainty_score":0.06137836},"labels":[],"label_agreement":null},{"id":"W1503453917","doi":"10.1007/11428862_91","title":"Stokes-Flow Problem Solved Using Maple","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chemical and Environmental Engineering 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":"Western University","funders":"","keywords":"Maple; Computer science; Boundary value problem; Domain (mathematical analysis); Applied mathematics; Computation; Differential equation; Partial differential equation; Flow (mathematics); Symbolic computation; Algorithm; Mathematics; Mathematical analysis; Geometry","score_opus":0.0181105650430554,"score_gpt":0.23132505406830006,"score_spread":0.21321448902524465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503453917","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.04053945,0.00031019005,0.92732173,0.00052882684,0.00022336656,0.000069301925,0.00040767726,0.0008963603,0.029703084],"genre_scores_gemma":[0.44643694,0.00040939328,0.516101,0.00025128186,0.0002830737,0.00034116436,0.0006905512,0.00073446,0.034752198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998882,0.000038794624,0.000004017381,0.000017351585,0.000035363526,0.00001623998],"domain_scores_gemma":[0.9996213,0.0002606838,0.000017102724,0.000019119958,0.0000568795,0.000024957208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030095645,0.0005352132,0.0011493448,0.0005411147,0.0006074865,0.00084589486,0.0006992978,0.0012500642,0.0088915285],"category_scores_gemma":[0.0015757792,0.00032828367,0.0005739177,0.00046063992,0.00042060108,0.00069794594,0.0012142719,0.0011784688,0.0011148831],"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.00024111221,0.00017643344,0.000806471,0.00048441364,0.000084605505,0.00033057272,0.0002385549,0.7050931,0.007516854,0.12323798,0.020503027,0.14128685],"study_design_scores_gemma":[0.000021546763,0.000015949345,0.00006353011,0.000006992095,0.000005690587,0.000019441964,0.000015735066,0.97984606,0.00093181274,0.016982352,0.002085174,0.0000057463976],"about_ca_topic_score_codex":0.0030158195,"about_ca_topic_score_gemma":0.0025473384,"teacher_disagreement_score":0.0088915285,"about_ca_system_score_codex":0.0002868407,"about_ca_system_score_gemma":0.0006303305,"threshold_uncertainty_score":0.029745102},"labels":[],"label_agreement":null},{"id":"W1503498577","doi":"10.1007/978-3-540-36668-3_116","title":"Weightily Averaged One-Dependence Estimators","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":73,"is_retracted":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":"Estimator; Independence (probability theory); Computer science; Naive Bayes classifier; Class (philosophy); Probabilistic logic; Artificial intelligence; Algorithm; Machine learning; Bayes' theorem; Data mining; Bayesian probability; Mathematics; Statistics; Support vector machine","score_opus":0.020623760463191622,"score_gpt":0.24032894213934677,"score_spread":0.21970518167615516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503498577","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.0057173446,0.0002997769,0.991458,0.000120991506,0.0000622133,0.00001775165,0.000059982773,0.00022889383,0.0020350467],"genre_scores_gemma":[0.22345237,0.001001493,0.7642314,0.0003317974,0.00045424243,0.00019426456,0.00072043535,0.00052593386,0.00908806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963856,0.0016257311,0.0002087039,0.0007869067,0.00076981704,0.00022333101],"domain_scores_gemma":[0.98147374,0.010962127,0.00080996286,0.0045800623,0.0018662692,0.00030777513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007626838,0.0012316123,0.0015921101,0.0018649022,0.0005589866,0.0018564449,0.002998433,0.0021116803,0.0054541742],"category_scores_gemma":[0.043454748,0.0009098298,0.0011305738,0.0017964339,0.0015303232,0.0057816086,0.0026655102,0.002801361,0.0012769927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027548958,0.00011705216,0.0025146499,0.00027359714,0.00033549868,0.00012675971,0.00015378762,0.076887295,0.0049799164,0.64292645,0.005192325,0.2662172],"study_design_scores_gemma":[0.000028177075,0.00004920242,0.0012209255,0.000054969994,0.000088487024,0.00028954863,0.000015075315,0.5028035,0.0033830071,0.48787513,0.004142659,0.000049289396],"about_ca_topic_score_codex":0.0005714409,"about_ca_topic_score_gemma":0.0009208758,"teacher_disagreement_score":0.007626838,"about_ca_system_score_codex":0.00080675445,"about_ca_system_score_gemma":0.0007259553,"threshold_uncertainty_score":0.040335},"labels":[],"label_agreement":null},{"id":"W1503512665","doi":"10.1007/11506843_11","title":"ASM and SDL Models of Geographic Routing in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc 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":"Simon Fraser University","funders":"","keywords":"Computer science; Complement (music); Mobile ad hoc network; Protocol (science); Distributed computing; Wireless ad hoc network; Routing (electronic design automation); Theoretical computer science; Computer network; Telecommunications","score_opus":0.011259965527801357,"score_gpt":0.22259776997021438,"score_spread":0.211337804442413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503512665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012043348,0.00068311754,0.9683035,0.0012377332,0.00019322132,0.00005698146,0.0003179932,0.0006912132,0.01647295],"genre_scores_gemma":[0.63753057,0.001971195,0.32838413,0.00046969223,0.00041899818,0.0004046981,0.0009603815,0.00035604098,0.029504325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863404,0.0005370925,0.00010790744,0.0001499822,0.00042788908,0.00014319428],"domain_scores_gemma":[0.997242,0.0014964099,0.00018176588,0.00045421429,0.0005057485,0.00011995798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016691629,0.0007253554,0.0008186646,0.00097643735,0.00075748743,0.003531229,0.0024386493,0.0015623085,0.0049685542],"category_scores_gemma":[0.00617334,0.0006640551,0.0009035342,0.0014542125,0.0018920773,0.0046623405,0.0014674189,0.0021612975,0.0010990498],"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.000045944143,0.00004548334,0.00037331317,0.00007624366,0.000014744608,0.00008283531,0.00015974265,0.298175,0.0005624108,0.67666274,0.0031956667,0.020605825],"study_design_scores_gemma":[0.000013742382,0.000014260629,0.000040801686,0.000012408414,0.000010989849,0.000030147543,0.000027847615,0.7609098,0.00025734198,0.23334876,0.005325701,0.000008246779],"about_ca_topic_score_codex":0.0076532904,"about_ca_topic_score_gemma":0.0057743797,"teacher_disagreement_score":0.0076532904,"about_ca_system_score_codex":0.0016122098,"about_ca_system_score_gemma":0.0015485237,"threshold_uncertainty_score":0.01662147},"labels":[],"label_agreement":null},{"id":"W1503537619","doi":"10.1007/978-3-540-92273-5_6","title":"Clustering Time-Series Gene Expression Data with Unequal Time Intervals","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Windsor","funders":"","keywords":"Cluster analysis; Computer science; Hierarchical clustering; Data mining; Context (archaeology); Expression (computer science); Correlation clustering; Series (stratigraphy); Set (abstract data type); Single-linkage clustering; CURE data clustering algorithm; Pattern recognition (psychology); Artificial intelligence; Biology","score_opus":0.022620444743978535,"score_gpt":0.2555697346819786,"score_spread":0.23294928993800004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503537619","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.024589654,0.00056206086,0.9733935,0.000081963786,0.00010503303,0.000058012876,0.00022713546,0.0004089854,0.0005737002],"genre_scores_gemma":[0.26039606,0.00089305156,0.7314575,0.00009786786,0.0002927522,0.00029494983,0.003182593,0.00031895968,0.0030662706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980288,0.00040460267,0.00020994716,0.00054003956,0.00067345286,0.0001431004],"domain_scores_gemma":[0.99668723,0.002110699,0.00022179038,0.00050644815,0.0004183303,0.000055458382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026098285,0.0006200735,0.0012615822,0.0026754974,0.000500812,0.001184135,0.0015904686,0.0008690382,0.001397599],"category_scores_gemma":[0.0074335183,0.00041703956,0.0018779293,0.003909255,0.00075495976,0.0011325609,0.00096961384,0.0008947051,0.0006893425],"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.00045196537,0.00013595086,0.005530146,0.00042754383,0.00040379603,0.00022663632,0.0004339931,0.18364455,0.034000028,0.018440656,0.003533767,0.7527709],"study_design_scores_gemma":[0.000022324777,0.0001002747,0.007272589,0.000035405,0.00010587777,0.0002435452,0.00011896191,0.9359736,0.0128976675,0.038518675,0.0046523246,0.00005877719],"about_ca_topic_score_codex":0.0011989487,"about_ca_topic_score_gemma":0.0012902883,"teacher_disagreement_score":0.0026754974,"about_ca_system_score_codex":0.00073519757,"about_ca_system_score_gemma":0.00049017405,"threshold_uncertainty_score":0.01380229},"labels":[],"label_agreement":null},{"id":"W1503539558","doi":"10.1007/978-3-540-74456-6_45","title":"State Complexity of Basic Operations on Suffix-Free Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Computer science; Suffix; State (computer science); Programming language; Theoretical computer science; Linguistics","score_opus":0.02995933655791481,"score_gpt":0.2700726167175028,"score_spread":0.24011328015958802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503539558","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.8425209,0.00041989982,0.124736674,0.0011999619,0.0000659414,0.000100179175,0.0013304445,0.00072975486,0.028896276],"genre_scores_gemma":[0.98069876,0.00023552719,0.0119587425,0.00006709881,0.000097687334,0.00010228693,0.00091431424,0.00017861559,0.0057469774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788207,0.00035602823,0.00015691012,0.0003552475,0.0007859567,0.0004637438],"domain_scores_gemma":[0.97925127,0.016359266,0.0009308977,0.0017204143,0.0010289683,0.0007091561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013310855,0.00057066017,0.0013567107,0.0012294773,0.0013731407,0.006357405,0.0020187986,0.0015057471,0.011410359],"category_scores_gemma":[0.010843727,0.0008230974,0.0015378401,0.002077382,0.0026788765,0.012081999,0.0023402148,0.0032146336,0.0008698849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008236479,0.0002154059,0.002335499,0.00021083202,0.000051162362,0.00016237378,0.0010605012,0.043844223,0.008501541,0.9148259,0.0032538848,0.024714934],"study_design_scores_gemma":[0.00005103065,0.000063717845,0.00088204007,0.000013595272,0.00003216223,0.00007625177,0.00013218341,0.12129009,0.0038621183,0.87283397,0.0007286518,0.000034214972],"about_ca_topic_score_codex":0.0019147607,"about_ca_topic_score_gemma":0.002103498,"teacher_disagreement_score":0.011410359,"about_ca_system_score_codex":0.0024490675,"about_ca_system_score_gemma":0.0018261386,"threshold_uncertainty_score":0.03817147},"labels":[],"label_agreement":null},{"id":"W1503584249","doi":"10.1007/3-540-45054-8_25","title":"Colour by Correlation in a Three-Dimensional Colour Space","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mondrian; Brightness; Chromaticity; Computer science; Algorithm; Set (abstract data type); Artificial intelligence; Pixel; Space (punctuation); Computer vision; Mathematics; Optics","score_opus":0.00834537624281467,"score_gpt":0.23052686573683634,"score_spread":0.22218148949402167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503584249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05745538,0.0036908495,0.86697066,0.0012907909,0.000995727,0.00007874818,0.0003104243,0.0012011317,0.06800622],"genre_scores_gemma":[0.69194335,0.0040674256,0.25067592,0.0012067537,0.0010455226,0.00017431885,0.00036258792,0.0010131805,0.049510848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992428,0.00025349125,0.00003397185,0.0001208823,0.0002449484,0.000104005114],"domain_scores_gemma":[0.99814034,0.0007593689,0.00021579306,0.00033873986,0.00036935098,0.00017636991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009011388,0.0008308142,0.0010620281,0.001893122,0.0010188338,0.0041833622,0.001186041,0.0011324622,0.0066650063],"category_scores_gemma":[0.0027571032,0.00050105393,0.0010725923,0.002808856,0.003530638,0.0038939386,0.0019980425,0.0022366862,0.0016529504],"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.000032711047,0.000009638424,0.0001396018,0.000052000825,0.000012655545,0.00006337858,0.00012726865,0.0033471396,0.0023752549,0.9761657,0.0026859443,0.014988626],"study_design_scores_gemma":[0.000011946319,0.000023760222,0.000536883,0.00002042431,0.000015647918,0.00021259654,0.00004431262,0.04329043,0.0018245849,0.94466287,0.009304757,0.000051717205],"about_ca_topic_score_codex":0.0018719638,"about_ca_topic_score_gemma":0.0012727707,"teacher_disagreement_score":0.0066650063,"about_ca_system_score_codex":0.0009260349,"about_ca_system_score_gemma":0.0008175124,"threshold_uncertainty_score":0.022296727},"labels":[],"label_agreement":null},{"id":"W1503619557","doi":"10.1007/978-3-540-28646-2_1","title":"A Comparison Between ACO Algorithms for the Set Covering Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Benchmark (surveying); Computer science; Ant colony optimization algorithms; Set (abstract data type); Heuristic; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.04490335325099004,"score_gpt":0.3128812745333813,"score_spread":0.2679779212823913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503619557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21909827,0.039683275,0.59107673,0.0025410666,0.0021480322,0.00057811575,0.00080890546,0.0023805094,0.14168514],"genre_scores_gemma":[0.52576894,0.015636355,0.44108692,0.00050745416,0.0005146919,0.00028537682,0.0010717631,0.00087751914,0.014251015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767834,0.00077840796,0.00010180097,0.00020363505,0.0010445616,0.00019324123],"domain_scores_gemma":[0.9923314,0.0057373317,0.0002577446,0.0005849243,0.00090954895,0.00017897788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002048858,0.00090929726,0.0015047509,0.0021059217,0.0008034513,0.0020608893,0.0021459667,0.0018821213,0.0052605327],"category_scores_gemma":[0.010546617,0.0004094841,0.001176185,0.004625464,0.00052117556,0.0024718046,0.0009288861,0.0012909527,0.0007119539],"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.0010265089,0.00051664293,0.0014034458,0.0005907035,0.0002721528,0.00005064748,0.00008755875,0.41110116,0.0018637775,0.02744416,0.0071163243,0.5485269],"study_design_scores_gemma":[0.00017221458,0.00047095012,0.0022507494,0.00009408122,0.0001297578,0.00019829812,0.00012676405,0.97326964,0.0017479975,0.012386934,0.009121326,0.00003131001],"about_ca_topic_score_codex":0.004261206,"about_ca_topic_score_gemma":0.006104406,"teacher_disagreement_score":0.0052605327,"about_ca_system_score_codex":0.0017754516,"about_ca_system_score_gemma":0.0016365375,"threshold_uncertainty_score":0.017598212},"labels":[],"label_agreement":null},{"id":"W1503648253","doi":"10.1007/978-3-540-31965-8_38","title":"Arbitrary 3D Resolution Discrete Ray Tracing of Implicit Surfaces","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Octree; Computer science; Rendering (computer graphics); Ray tracing (physics); Tree traversal; Ray casting; Algorithm; Subdivision; Floating point; Rounding; Distributed ray tracing; Computer graphics (images); Computational science; Physics","score_opus":0.016546084916399837,"score_gpt":0.27565842220845777,"score_spread":0.2591123372920579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503648253","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.022410767,0.00026539594,0.97012615,0.00006738161,0.00003801699,0.000016835269,0.00003275763,0.0006517402,0.0063909967],"genre_scores_gemma":[0.37702513,0.000548584,0.6131289,0.0000405969,0.000025946556,0.000046365985,0.00012282911,0.00046249246,0.008599234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964035,0.000069722395,0.000012562383,0.000025449977,0.00021962772,0.000032314525],"domain_scores_gemma":[0.9993253,0.00033485348,0.00003727395,0.00018888988,0.00008351361,0.000030166371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039897359,0.00044608678,0.000756846,0.00051030196,0.00032767895,0.0013067431,0.0011014484,0.0006544321,0.0030219709],"category_scores_gemma":[0.0021470063,0.000569356,0.00048569858,0.0007988863,0.0008488399,0.0010255616,0.0016051679,0.0018589506,0.0006839865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037754443,0.00008560317,0.0007336271,0.00032054706,0.00003724197,0.00020050144,0.00088685675,0.33819267,0.06685684,0.29628003,0.003231297,0.29279724],"study_design_scores_gemma":[0.000021375106,0.00002335807,0.000094203344,0.000019186358,0.0000051841594,0.000103654624,0.00003227514,0.96204287,0.013323265,0.019169083,0.005152153,0.00001342982],"about_ca_topic_score_codex":0.0012136527,"about_ca_topic_score_gemma":0.001561941,"teacher_disagreement_score":0.0030219709,"about_ca_system_score_codex":0.00056532904,"about_ca_system_score_gemma":0.00037723043,"threshold_uncertainty_score":0.010109544},"labels":[],"label_agreement":null},{"id":"W1503701362","doi":"10.1007/3-540-45005-x_35","title":"Automaton Representation of Linear Conjunctive Languages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"Queen's University","funders":"","keywords":"Equivalence (formal languages); Computer science; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Theoretical computer science; Automaton; Deterministic context-free grammar; Intersection (aeronautics); Discrete mathematics; Algorithm; Algebra over a field; Context-free grammar; Mathematics; Tree-adjoining grammar; Artificial intelligence; Pure mathematics","score_opus":0.015731086478756092,"score_gpt":0.27623560685484627,"score_spread":0.2605045203760902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503701362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05145444,0.0006405246,0.8969414,0.00051109144,0.00022851399,0.00016265843,0.0020132074,0.004667942,0.043380313],"genre_scores_gemma":[0.7077475,0.00056827546,0.25929508,0.00022738638,0.000107437685,0.00040910195,0.0032678302,0.000553266,0.027824102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00007638463,0.000035476347,0.00008476282,0.00008124219,0.000060758353],"domain_scores_gemma":[0.99944204,0.00025621726,0.00004503527,0.00008335945,0.00014764314,0.000025701689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002350029,0.00041563282,0.00048933184,0.0006439731,0.0006378274,0.0023529138,0.0011434805,0.000643712,0.014852571],"category_scores_gemma":[0.00095792115,0.00036243023,0.0009474412,0.0009225541,0.00075957755,0.0018572729,0.00068340206,0.0010057843,0.0025645702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019099888,0.00009910081,0.00038569697,0.00028087737,0.000034337838,0.00034349906,0.00081989967,0.036049113,0.010781526,0.8696597,0.0074016685,0.07395359],"study_design_scores_gemma":[0.00006283248,0.000073438714,0.00017074769,0.000072318224,0.00005134756,0.00022644893,0.00026107585,0.35845697,0.008064166,0.6097175,0.022791598,0.000051578918],"about_ca_topic_score_codex":0.0037206162,"about_ca_topic_score_gemma":0.0049420735,"teacher_disagreement_score":0.014852571,"about_ca_system_score_codex":0.0009038076,"about_ca_system_score_gemma":0.00078100874,"threshold_uncertainty_score":0.04968685},"labels":[],"label_agreement":null},{"id":"W1503780205","doi":"10.1007/978-3-540-45069-6_21","title":"TLQSolver: A Temporal Logic Query Checker","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Temporal logic; Computer science; Model checking; A priori and a posteriori; Query optimization; Theoretical computer science; Symbol (formal); Mathematics; Programming language; Algorithm; Information retrieval; Philosophy; Epistemology","score_opus":0.03690787378251955,"score_gpt":0.28391339258666953,"score_spread":0.24700551880414998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503780205","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.004730343,0.00016064585,0.8777662,0.00044125592,0.00025968708,0.00026858074,0.001343046,0.11048492,0.004545345],"genre_scores_gemma":[0.20371898,0.0005017026,0.7344719,0.0020678828,0.00023666749,0.0005503954,0.0066268714,0.028629696,0.023195883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937138,0.0014958729,0.00072563934,0.0010331119,0.0024653368,0.0005661672],"domain_scores_gemma":[0.99042964,0.005684879,0.00043877403,0.0020192093,0.0012106721,0.00021684876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062080193,0.0015624252,0.0015129923,0.0022045758,0.00097054365,0.0037429978,0.0054127136,0.002134045,0.028087983],"category_scores_gemma":[0.014497897,0.001937044,0.0021924993,0.0014100221,0.0020249304,0.008245318,0.0049060713,0.0031204028,0.00752411],"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.002565343,0.0007383609,0.0033531534,0.0018967335,0.00045266576,0.0009982728,0.0006967658,0.040395893,0.047931343,0.18616779,0.18532763,0.52947617],"study_design_scores_gemma":[0.0009980289,0.00030323816,0.0005408992,0.0002609461,0.00047046065,0.0006808573,0.00022638659,0.61575514,0.1481961,0.12153952,0.11083449,0.00019400746],"about_ca_topic_score_codex":0.0036510173,"about_ca_topic_score_gemma":0.0039522676,"teacher_disagreement_score":0.028087983,"about_ca_system_score_codex":0.001313757,"about_ca_system_score_gemma":0.0035751604,"threshold_uncertainty_score":0.09396362},"labels":[],"label_agreement":null},{"id":"W1503791597","doi":"10.1007/11407522_7","title":"Inferring the Topology and Traffic Load of Parallel Programs Running in a Virtual Machine Environment","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science; Distributed computing; Virtual machine; Network topology; Host (biology); Overhead (engineering); Benchmark (surveying); Traffic generation model; Virtual network; Exploit; Overlay network; Computer network; The Internet; Operating system","score_opus":0.012022014931126555,"score_gpt":0.21840372557874133,"score_spread":0.20638171064761476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503791597","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.9320235,0.0001565737,0.06494297,0.00009762817,0.000017817789,0.00002664817,0.0006135044,0.0012528314,0.00086852047],"genre_scores_gemma":[0.9754667,0.00011461612,0.023093747,0.00001129459,0.000026003696,0.0000152294515,0.00090207777,0.00007997489,0.00029034808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999772,0.000051113824,0.000012167279,0.00007752029,0.000046403427,0.0000408925],"domain_scores_gemma":[0.998195,0.0010516702,0.00020554144,0.00018039791,0.00021078727,0.00015666023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034589053,0.0005814864,0.00063092256,0.0016622562,0.0003729963,0.00085190806,0.0007368224,0.00071329996,0.0007101629],"category_scores_gemma":[0.0033438762,0.0007003543,0.0004525311,0.0014140623,0.00025937875,0.0015589114,0.000374898,0.00070259813,0.0003581359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013315906,0.0007231828,0.23986137,0.00020259245,0.00026531363,0.0004975923,0.00033630544,0.52189726,0.049398053,0.0025459966,0.0028927946,0.180048],"study_design_scores_gemma":[0.0000070101014,0.000030461064,0.013609541,0.0000031189718,0.000019132056,0.000050321865,0.000052944273,0.9810961,0.0023738865,0.002633787,0.000116372095,0.000007403211],"about_ca_topic_score_codex":0.0067598224,"about_ca_topic_score_gemma":0.01002319,"teacher_disagreement_score":0.0067598224,"about_ca_system_score_codex":0.0004536166,"about_ca_system_score_gemma":0.00044189297,"threshold_uncertainty_score":0.013440967},"labels":[],"label_agreement":null},{"id":"W1503846774","doi":"10.1007/11540007_31","title":"Dynamic Modeling, Prediction and Analysis of Cytotoxicity on Microelectronic Sensors","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Toxicant; Computer science; Impulse response; Microelectronics; Cytotoxicity; Biological system; System dynamics; Dynamic data; Artificial intelligence; Chemistry; Nanotechnology; Mathematics; Materials science; Biology","score_opus":0.005923594525652127,"score_gpt":0.2211117635306458,"score_spread":0.21518816900499366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503846774","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.4758538,0.0013826891,0.5137478,0.00069661066,0.00009941949,0.00006899847,0.00035018666,0.00062275067,0.0071778134],"genre_scores_gemma":[0.99051625,0.00028755548,0.005988575,0.000026559595,0.000014132383,0.00003826501,0.00007977212,0.000022385993,0.0030264803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998661,0.000021882097,0.0000055947826,0.00003959828,0.00003952874,0.00002716996],"domain_scores_gemma":[0.9992987,0.0005023693,0.00005956378,0.000038870865,0.00008520238,0.000015264033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037050227,0.0005732381,0.00083906815,0.0003136936,0.00024877788,0.00058936107,0.0010813582,0.0009902187,0.0010462811],"category_scores_gemma":[0.0015834499,0.0004438178,0.0006533574,0.00036115563,0.0004927121,0.0006396622,0.0003746679,0.0005692553,0.00014474957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014740383,0.00001309712,0.00032311596,0.000011457935,0.0000060401017,0.000017719256,0.0000072013113,0.99356467,0.0016795121,0.0012360075,0.00008423945,0.0030420981],"study_design_scores_gemma":[6.9656073e-7,0.0000036464398,0.00011647789,4.1774416e-7,0.0000015939233,0.0000030815554,0.0000010484495,0.9989133,0.00046219985,0.00047192292,0.000024546698,0.0000010610611],"about_ca_topic_score_codex":0.009864265,"about_ca_topic_score_gemma":0.00542194,"teacher_disagreement_score":0.009864265,"about_ca_system_score_codex":0.0010628272,"about_ca_system_score_gemma":0.00048648208,"threshold_uncertainty_score":0.019613683},"labels":[],"label_agreement":null},{"id":"W1503918544","doi":"10.1007/3-540-45153-6_37","title":"Planning Animations Using Cinematography Knowledge","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","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":"Computer science; Cinematography; Animation; Framing (construction); Knowledge base; Expressive power; Human–computer interaction; Multimedia; Computer animation; Presentation (obstetrics); Computer graphics (images); Artificial intelligence; Programming language; Visual arts","score_opus":0.03222961764635086,"score_gpt":0.2693238443252629,"score_spread":0.23709422667891206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503918544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011174858,0.00031336147,0.96969026,0.00009478299,0.00003116132,0.000111870875,0.00021128272,0.0012259189,0.017146468],"genre_scores_gemma":[0.2721639,0.0009545877,0.7129264,0.0000520204,0.00003853236,0.00021876418,0.0010985326,0.00047576556,0.012071448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.000032154614,0.0000097955635,0.00006290166,0.000049125083,0.000018828021],"domain_scores_gemma":[0.9996196,0.00023625736,0.000021482334,0.00005669733,0.000043876775,0.000022150374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003020784,0.00084902876,0.0006471423,0.0012224487,0.00060408266,0.0008966723,0.0009805158,0.00095481763,0.014616948],"category_scores_gemma":[0.0015645206,0.0011433575,0.0010520578,0.00087286223,0.0006114679,0.0021911531,0.0010865565,0.0009856204,0.0012350549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021352286,0.00015079766,0.00069511944,0.00044550354,0.000072010065,0.0003210675,0.00067036005,0.4483018,0.014685272,0.12403381,0.00952909,0.40088162],"study_design_scores_gemma":[0.00003478517,0.00005518743,0.00022944115,0.00006340008,0.00004791375,0.000116082454,0.00013657431,0.91998935,0.007297914,0.058317885,0.013690861,0.000020765092],"about_ca_topic_score_codex":0.005695858,"about_ca_topic_score_gemma":0.009951225,"teacher_disagreement_score":0.014616948,"about_ca_system_score_codex":0.00063997833,"about_ca_system_score_gemma":0.0005355459,"threshold_uncertainty_score":0.048898518},"labels":[],"label_agreement":null},{"id":"W1504003456","doi":"10.1007/978-3-540-30194-3_22","title":"The Contribution of End-Users to the TransType2 Project","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; End user; World Wide Web; Human–computer interaction","score_opus":0.01125939724898427,"score_gpt":0.2647825362597617,"score_spread":0.25352313901077744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504003456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026613107,0.0030244275,0.6935897,0.009131839,0.0022646915,0.0002430971,0.0024785758,0.035554823,0.2270998],"genre_scores_gemma":[0.14551711,0.0046400935,0.480741,0.0029489787,0.0012897782,0.00040721527,0.012028286,0.03826225,0.31416535],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99520373,0.0020222005,0.00016964441,0.00061389885,0.0015356052,0.00045487584],"domain_scores_gemma":[0.98548466,0.004085349,0.00026594635,0.00478943,0.0033419633,0.002032683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006308796,0.00097219466,0.00070795766,0.0011041799,0.0016294173,0.0062879617,0.0022453514,0.0016120586,0.03630606],"category_scores_gemma":[0.012634772,0.00065073866,0.00080222887,0.0018613657,0.0011062314,0.008781408,0.005409545,0.0030601348,0.02315062],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009012353,0.00044057998,0.0024720277,0.000398245,0.00004212453,0.0004561495,0.0033300999,0.00096685713,0.017814072,0.1371471,0.20937106,0.6266604],"study_design_scores_gemma":[0.000050190534,0.000115798284,0.0009938243,0.00014503016,0.00003098218,0.00096740504,0.0010035357,0.007291661,0.016687077,0.054054078,0.9185928,0.00006759074],"about_ca_topic_score_codex":0.0027500833,"about_ca_topic_score_gemma":0.0020631596,"teacher_disagreement_score":0.03630606,"about_ca_system_score_codex":0.0008896544,"about_ca_system_score_gemma":0.0027570047,"threshold_uncertainty_score":0.12145585},"labels":[],"label_agreement":null},{"id":"W1504040240","doi":"10.1007/978-3-642-02882-3_19","title":"Three New Algorithms for Regular Language Enumeration","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Waterloo","funders":"","keywords":"Lexicographical order; Enumeration; Computer science; Word (group theory); Section (typography); Algorithm; Order (exchange); Word problem (mathematics education); Arithmetic; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.019740628694283606,"score_gpt":0.2635594364890722,"score_spread":0.2438188077947886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504040240","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.005548441,0.0005675337,0.96125454,0.00089872006,0.0005689551,0.000205775,0.0003665517,0.004508921,0.026080558],"genre_scores_gemma":[0.046549853,0.00058278796,0.9149122,0.0006000944,0.00042946852,0.00054506504,0.0015183915,0.0017307269,0.03313129],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596524,0.00060577574,0.00038772746,0.00086611893,0.0016343221,0.0005408086],"domain_scores_gemma":[0.99453706,0.0020506056,0.00022158053,0.0020436205,0.0008634611,0.00028362565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020110551,0.0017480796,0.0018225957,0.0032831545,0.0026430024,0.0061196308,0.0060920506,0.002462446,0.02793161],"category_scores_gemma":[0.011561043,0.0013108498,0.0028995324,0.0054567847,0.0033283245,0.011874284,0.007368842,0.0051360843,0.010345885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030016317,0.00020769774,0.00028448759,0.0002699533,0.000034605633,0.00007564059,0.0003438458,0.004807479,0.0037279467,0.45183298,0.03226166,0.5058535],"study_design_scores_gemma":[0.00017711749,0.0001028637,0.0003382623,0.00010619799,0.000083309984,0.00053231634,0.00024921008,0.068591975,0.009306678,0.84516776,0.075229645,0.00011463178],"about_ca_topic_score_codex":0.0015734634,"about_ca_topic_score_gemma":0.0027658686,"teacher_disagreement_score":0.02793161,"about_ca_system_score_codex":0.002527489,"about_ca_system_score_gemma":0.0020746635,"threshold_uncertainty_score":0.09344053},"labels":[],"label_agreement":null},{"id":"W1504062128","doi":"10.1007/978-3-540-73451-2_12","title":"The Art of Granular Computing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":136,"is_retracted":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":"Granular computing; Computer science; CLARITY; Heuristics; Context (archaeology); Fuzzy set; Set (abstract data type); Range (aeronautics); Rough set; Theoretical computer science; Fuzzy logic; Artificial intelligence; Data science; Programming language","score_opus":0.022433766973417864,"score_gpt":0.2530389920688473,"score_spread":0.2306052250954294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504062128","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.0074502337,0.09996276,0.5711013,0.034262873,0.005986953,0.00011796657,0.00061524805,0.00077257946,0.27973014],"genre_scores_gemma":[0.44863737,0.059443433,0.3988035,0.007327509,0.00875311,0.0005714765,0.00064222876,0.000496257,0.07532512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790776,0.00067974365,0.00015379774,0.0003574401,0.00076057715,0.00014059979],"domain_scores_gemma":[0.99729496,0.0015099592,0.0001084471,0.00072219956,0.00024554058,0.00011894489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002986936,0.0008237502,0.0015515058,0.0022615143,0.0016379943,0.008536611,0.0016161621,0.0024927135,0.008098332],"category_scores_gemma":[0.008149347,0.00089182286,0.0012432063,0.0033252193,0.01235271,0.01225145,0.00323578,0.0057742265,0.0016539973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007871526,0.0000039831193,0.00003278717,0.000052114192,0.00000840705,0.000012250106,0.00008047031,0.0007368174,0.00007911832,0.9858359,0.0036145882,0.009535722],"study_design_scores_gemma":[0.0000037268944,0.0000030201206,0.000035590114,0.00003881099,0.0000044390654,0.000018791803,0.000029400302,0.0017720349,0.000058347272,0.9731529,0.024876487,0.0000064725587],"about_ca_topic_score_codex":0.0021489984,"about_ca_topic_score_gemma":0.0014472717,"teacher_disagreement_score":0.008536611,"about_ca_system_score_codex":0.0022754993,"about_ca_system_score_gemma":0.0014789785,"threshold_uncertainty_score":0.027091622},"labels":[],"label_agreement":null},{"id":"W1504176635","doi":"10.1007/3-540-45241-9_23","title":"State Generation in the PARMC Model Checker","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Generality; Compiler; Programming language; Relation (database); State (computer science); Representation (politics); Model checking; Code generation; Code (set theory); Transition system; Abstract state machines; Parallel computing; Theoretical computer science; Finite-state machine; Operating system; Database","score_opus":0.05977082222996047,"score_gpt":0.2969365977878846,"score_spread":0.23716577555792415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504176635","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.01178004,0.000116351286,0.96408594,0.00023499616,0.00009795285,0.00017636172,0.0003664656,0.013245149,0.009896762],"genre_scores_gemma":[0.30905765,0.00025737984,0.67662734,0.00032796577,0.000049929058,0.00045251593,0.0010645825,0.0025563568,0.009606326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759525,0.00084063754,0.00011457833,0.00036021866,0.00084909674,0.00024021449],"domain_scores_gemma":[0.99650574,0.0018979117,0.00012693375,0.0010418305,0.0003846705,0.000042853855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022287702,0.000677868,0.0008398432,0.00088434,0.0006775784,0.0019728756,0.0024208885,0.0010746635,0.009876479],"category_scores_gemma":[0.007422152,0.0008597256,0.0011910286,0.00078207446,0.001112796,0.003337164,0.0016680738,0.0018963441,0.0020185383],"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.0006273693,0.00034353646,0.001558965,0.0007206941,0.00011537958,0.00046997194,0.00048198408,0.24190496,0.019077979,0.44044885,0.019344369,0.2749059],"study_design_scores_gemma":[0.00012619147,0.00006903521,0.00009483881,0.000058140402,0.00005986996,0.00009172101,0.00002743311,0.8546275,0.031761106,0.09917123,0.013883844,0.000029176732],"about_ca_topic_score_codex":0.0033613932,"about_ca_topic_score_gemma":0.005834676,"teacher_disagreement_score":0.009876479,"about_ca_system_score_codex":0.0008942543,"about_ca_system_score_gemma":0.002182761,"threshold_uncertainty_score":0.033040166},"labels":[],"label_agreement":null},{"id":"W1504183634","doi":"10.1007/978-3-540-73595-3_8","title":"An Incremental Technique for Automata-Based Decision Procedures","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Automaton; Satisfiability; Boolean satisfiability problem; Simple (philosophy); Theoretical computer science; Computation; Decision problem; Algorithm","score_opus":0.03574229404385039,"score_gpt":0.33916311075414746,"score_spread":0.3034208167102971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504183634","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.0027468372,0.000056041943,0.9895356,0.00008830587,0.000084368265,0.0001600195,0.00007107936,0.0028106135,0.004447049],"genre_scores_gemma":[0.08597414,0.00012504047,0.9079269,0.00014407834,0.00008364739,0.00029377465,0.00026900598,0.0006211951,0.004562296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704593,0.00056103535,0.00024906077,0.00052076415,0.0013802187,0.00024309554],"domain_scores_gemma":[0.99301445,0.004579053,0.00015412671,0.0014123442,0.00070954167,0.00013043331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018645009,0.00077198225,0.00067281246,0.0012877199,0.0009766049,0.0016883799,0.0031665298,0.0009769208,0.010995604],"category_scores_gemma":[0.009488357,0.0009008126,0.0020740703,0.0010061096,0.001807992,0.0038896424,0.0029858653,0.003320199,0.0027259118],"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.00036563596,0.0003306968,0.0004780275,0.00046862653,0.000074125,0.00037044444,0.000590622,0.015245446,0.028229708,0.41887784,0.008828663,0.52614015],"study_design_scores_gemma":[0.00020479686,0.00031922653,0.00052052876,0.00019792232,0.0003602301,0.0008288995,0.00015689064,0.32443315,0.08076256,0.5213309,0.07074775,0.00013709979],"about_ca_topic_score_codex":0.0011147148,"about_ca_topic_score_gemma":0.002035519,"teacher_disagreement_score":0.010995604,"about_ca_system_score_codex":0.00068251626,"about_ca_system_score_gemma":0.00147387,"threshold_uncertainty_score":0.036783934},"labels":[],"label_agreement":null},{"id":"W150418520","doi":"10.1007/3-540-47922-8_30","title":"Retrieval of Short Documents from Discussion Forums","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Saskatchewan","funders":"","keywords":"Computer science; Recall; Information retrieval; Precision and recall; Document retrieval; World Wide Web","score_opus":0.021740752960943487,"score_gpt":0.25364779628556444,"score_spread":0.23190704332462095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150418520","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.4529953,0.040584493,0.3905641,0.004214181,0.004087874,0.0021587608,0.042928215,0.016325427,0.04614151],"genre_scores_gemma":[0.506551,0.01602828,0.2863444,0.0005300284,0.0045362134,0.001403887,0.09653787,0.0016861442,0.086382195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989121,0.0003049551,0.00009979558,0.00014951361,0.00042580525,0.00010780078],"domain_scores_gemma":[0.9951084,0.0030711433,0.0002759151,0.0002941934,0.0009526559,0.0002976275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014934259,0.0015782635,0.0017521849,0.011690983,0.0016157636,0.0030083077,0.0010494532,0.0013002186,0.014673841],"category_scores_gemma":[0.0075184866,0.0004928755,0.0009458835,0.007967322,0.0003097098,0.004065681,0.0015977923,0.00068682793,0.010279949],"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.0015918257,0.0005366738,0.00315571,0.0027629475,0.00019072974,0.00069304364,0.0016305605,0.002771655,0.054836534,0.0043126615,0.1014162,0.8261014],"study_design_scores_gemma":[0.0012939858,0.0034150751,0.040049404,0.002135714,0.0017357355,0.005655777,0.0073055243,0.20005107,0.18386674,0.056224536,0.4976655,0.00060106296],"about_ca_topic_score_codex":0.0009600931,"about_ca_topic_score_gemma":0.0014787208,"teacher_disagreement_score":0.014673841,"about_ca_system_score_codex":0.0006337306,"about_ca_system_score_gemma":0.00091454183,"threshold_uncertainty_score":0.049088836},"labels":[],"label_agreement":null},{"id":"W1504219518","doi":"10.1007/978-3-642-01818-3_17","title":"Enumerating Unlabeled and Root Labeled Trees for Causal Model Acquisition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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","funders":"","keywords":"Computer science; Tree diagram; Tree (set theory); Root (linguistics); Machine learning; Tree structure; Artificial intelligence; Bayesian network; Node (physics); Table (database); Bayes' theorem; Conditional probability; Theoretical computer science; Algorithm; Data mining; Posterior probability; Mathematics; Statistics; Bayesian probability","score_opus":0.02261398317156462,"score_gpt":0.26144596402781906,"score_spread":0.23883198085625443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504219518","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.0016431339,0.000109863344,0.9963044,0.00010439057,0.000010623495,0.000027464474,0.00011844139,0.0006285805,0.0010530971],"genre_scores_gemma":[0.044036392,0.00021695407,0.9528723,0.00010349949,0.00003464039,0.00012426123,0.00081250124,0.00033098427,0.0014684845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971636,0.00118449,0.00021261034,0.0005433847,0.00075510377,0.00014072857],"domain_scores_gemma":[0.97613484,0.018969784,0.00044247299,0.002968676,0.0012671014,0.000217196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035143944,0.0009120913,0.0014040418,0.002170372,0.0012129748,0.001910977,0.003312399,0.0023723328,0.009974168],"category_scores_gemma":[0.028151194,0.0014515207,0.0017589034,0.002363153,0.0017043574,0.007926459,0.0039086035,0.0049993373,0.0024498086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001739026,0.00014532114,0.0008633703,0.00040452232,0.00006316723,0.00014696237,0.0005180548,0.07388561,0.0039568422,0.41191012,0.009195016,0.49873713],"study_design_scores_gemma":[0.000011270949,0.000013574915,0.00010446948,0.000055915178,0.000019722249,0.00006186579,0.000046515397,0.41978183,0.0018210481,0.575184,0.0028848017,0.000014988407],"about_ca_topic_score_codex":0.0026088867,"about_ca_topic_score_gemma":0.0067333877,"teacher_disagreement_score":0.009974168,"about_ca_system_score_codex":0.0013216899,"about_ca_system_score_gemma":0.0018953949,"threshold_uncertainty_score":0.03336698},"labels":[],"label_agreement":null},{"id":"W1504253604","doi":"10.1007/978-3-540-69839-5_27","title":"Alternative Distance Metrics for Enhanced Reliability of Spatial Regression Analysis of Health Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial and Panel Data Analysis","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Euclidean distance; Metric (unit); Regression analysis; Reliability (semiconductor); Autoregressive model; Distance measures; Neighbourhood (mathematics); Ordinal regression; Operations research; Data mining; Econometrics; Machine learning; Artificial intelligence; Mathematics; Operations management","score_opus":0.07347688322001203,"score_gpt":0.29290551522014124,"score_spread":0.21942863200012921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504253604","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.015971528,0.00086956547,0.98172784,0.00021266661,0.00006755241,0.000048492235,0.00025599773,0.0003491977,0.0004971319],"genre_scores_gemma":[0.21703601,0.0007840531,0.7791118,0.00010649052,0.00028801674,0.00020227284,0.001161539,0.00040620432,0.0009036095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98249316,0.011134261,0.001480677,0.001487601,0.0029959744,0.00040837404],"domain_scores_gemma":[0.84430087,0.11617572,0.0062120357,0.017418882,0.01474676,0.0011457893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021222092,0.0014464662,0.002124954,0.005418806,0.00071425433,0.0032536355,0.0037559168,0.00231521,0.0022295234],"category_scores_gemma":[0.1429559,0.0009072194,0.0016750538,0.006393417,0.0014664088,0.0051855394,0.0040411106,0.0030335807,0.0006204111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079124287,0.00024664964,0.015660394,0.00080146315,0.0006838535,0.00036427952,0.000753161,0.35798818,0.007403103,0.19538513,0.006363605,0.4135589],"study_design_scores_gemma":[0.000031148218,0.000101613354,0.0023325705,0.00006373865,0.00006319976,0.00013738601,0.000054614826,0.92566544,0.001796915,0.06752482,0.0021812997,0.000047262445],"about_ca_topic_score_codex":0.002759498,"about_ca_topic_score_gemma":0.00289513,"teacher_disagreement_score":0.021222092,"about_ca_system_score_codex":0.001368624,"about_ca_system_score_gemma":0.0013520045,"threshold_uncertainty_score":0.11223453},"labels":[],"label_agreement":null},{"id":"W1504295561","doi":"10.1007/3-540-45104-8_38","title":"L-Studio/cpfg: A Software System for Modeling Plants","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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 Calgary","funders":"","keywords":"Computer science; Studio; Software; Computer graphics (images); Software system; Software engineering; Programming language; Engineering drawing; Telecommunications; Engineering","score_opus":0.023126964215902407,"score_gpt":0.21338957034544997,"score_spread":0.19026260612954757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504295561","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.0027070558,0.00009145694,0.70430976,0.000053258973,0.00005725658,0.000095184456,0.005772811,0.28225487,0.0046583777],"genre_scores_gemma":[0.06397177,0.0005070056,0.80459535,0.00027762147,0.00007142057,0.001233475,0.02386443,0.09271618,0.012762813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960274,0.00006511346,0.000054152395,0.00010700886,0.0001248017,0.000046328543],"domain_scores_gemma":[0.9988839,0.0006161305,0.00006624367,0.00017905659,0.0001876082,0.0000670356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000877396,0.0020968185,0.0013464174,0.0013640326,0.00069988286,0.0015333031,0.004190792,0.0015413425,0.036205716],"category_scores_gemma":[0.0021406473,0.0019105115,0.0022410215,0.00100632,0.0005807727,0.0019260158,0.0012371464,0.0025106668,0.0149783455],"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.0009504787,0.0004507789,0.003841774,0.0030636655,0.00043692405,0.0005432803,0.0008865554,0.2871296,0.039938252,0.037529368,0.2582644,0.3669649],"study_design_scores_gemma":[0.00031877952,0.00009152071,0.00079340016,0.00013713399,0.00016271528,0.00024996104,0.00004465786,0.81176186,0.028446767,0.016436443,0.14142781,0.00012897386],"about_ca_topic_score_codex":0.009650956,"about_ca_topic_score_gemma":0.008414589,"teacher_disagreement_score":0.036205716,"about_ca_system_score_codex":0.000876971,"about_ca_system_score_gemma":0.0016166783,"threshold_uncertainty_score":0.121120155},"labels":[],"label_agreement":null},{"id":"W1504311437","doi":"10.1007/978-3-642-01929-6_18","title":"Determining the Number of Games Needed to Guarantee an NHL Playoff Spot","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.027855112122254586,"score_gpt":0.24589730007058602,"score_spread":0.21804218794833144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504311437","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.78241247,0.00037740104,0.19062191,0.0016084424,0.00018662662,0.0002544462,0.00097091316,0.0011797765,0.022387983],"genre_scores_gemma":[0.959671,0.000092187365,0.036106087,0.00009211987,0.00005176848,0.00009159217,0.00057267223,0.00016525802,0.0031572098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984224,0.00030946394,0.0001258331,0.0003701388,0.00027400802,0.0004982442],"domain_scores_gemma":[0.97332925,0.019344984,0.0013672581,0.001181788,0.0017573597,0.0030192356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022957844,0.0007734343,0.0013888916,0.00083157537,0.0008268507,0.0016792056,0.002262203,0.0015813742,0.014320491],"category_scores_gemma":[0.036069583,0.0007342975,0.0005244296,0.00041176702,0.001021857,0.0040658293,0.0017027517,0.0018341114,0.0016466673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0079747215,0.0019376975,0.051822316,0.0008505768,0.000320926,0.00053157,0.0005763832,0.55945146,0.060849488,0.08804213,0.020087019,0.20755565],"study_design_scores_gemma":[0.0002199937,0.0006797714,0.008330052,0.000048842732,0.0000588483,0.00021441055,0.00046734087,0.93844575,0.0071934424,0.04316298,0.0011421959,0.00003624004],"about_ca_topic_score_codex":0.00193258,"about_ca_topic_score_gemma":0.0038417024,"teacher_disagreement_score":0.014320491,"about_ca_system_score_codex":0.0009800027,"about_ca_system_score_gemma":0.0023138917,"threshold_uncertainty_score":0.047906816},"labels":[],"label_agreement":null},{"id":"W1504363080","doi":"10.1007/978-3-540-24847-7_21","title":"Imaginary Cyclic Quartic Fields with Large Minus Class Numbers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 Calgary","funders":"","keywords":"Quartic function; Prime (order theory); Mathematics; Riemann hypothesis; Class number; Combinatorics; Character (mathematics); Class (philosophy); Field (mathematics); Physics; Arithmetic; Discrete mathematics; Pure mathematics; Quadratic equation; Computer science; Geometry","score_opus":0.014242080228281492,"score_gpt":0.2575532595733524,"score_spread":0.2433111793450709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504363080","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.22091489,0.0041797543,0.07662233,0.0043359483,0.0025694568,0.00008336075,0.000183275,0.0006287663,0.6904822],"genre_scores_gemma":[0.820894,0.0021767223,0.014727259,0.0006115907,0.0017189936,0.00007611702,0.0001631033,0.0002880107,0.15934424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996753,0.00007469383,0.000013787499,0.000055103363,0.00012382175,0.00005733068],"domain_scores_gemma":[0.99937916,0.00024513633,0.00008163137,0.00012297965,0.00007398625,0.00009709185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005777841,0.0008593684,0.0005938525,0.0015001585,0.0012967879,0.0030065046,0.00076102046,0.000911181,0.011962975],"category_scores_gemma":[0.0020119816,0.00045104936,0.0003913282,0.0012847394,0.0030760118,0.004295711,0.0014913952,0.0027833274,0.001779672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019578234,0.000013375334,0.00006476323,0.00003565524,0.0000021564902,0.00007072387,0.0001224556,0.00020827481,0.00070369587,0.98917294,0.0025291555,0.0070571844],"study_design_scores_gemma":[0.000017740638,0.00002698384,0.00019901466,0.000023192104,0.0000075415187,0.00051745615,0.00007186556,0.0012101643,0.000670371,0.96868336,0.028561538,0.000010759338],"about_ca_topic_score_codex":0.00020743857,"about_ca_topic_score_gemma":0.00030606912,"teacher_disagreement_score":0.011962975,"about_ca_system_score_codex":0.00090215384,"about_ca_system_score_gemma":0.0004191907,"threshold_uncertainty_score":0.040020168},"labels":[],"label_agreement":null},{"id":"W1504382467","doi":"10.1007/978-3-540-74309-5_18","title":"Exploiting Task Temperature Profiling in Temperature-Aware Task Scheduling for Computational Clusters","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Computer science; Queue; Scheduling (production processes); Scaling; Spec#; Profiling (computer programming); Cluster (spacecraft); Exploit; Multi-core processor; Parallel computing; Distributed computing; Operating system; Computer network; Mathematics","score_opus":0.02350019597188969,"score_gpt":0.28094817701877556,"score_spread":0.2574479810468859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504382467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14615744,0.0020881158,0.8414395,0.0002088802,0.00019564255,0.00004759181,0.00014441676,0.0037592703,0.0059590614],"genre_scores_gemma":[0.8825778,0.00056327594,0.114460886,0.000056526456,0.00006654286,0.000031894775,0.00016331003,0.0003480759,0.0017317142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974746,0.000062569685,0.000011778188,0.00005180896,0.00008347204,0.00004291551],"domain_scores_gemma":[0.9995115,0.00020000665,0.000063156745,0.00011433843,0.00008274308,0.000028317161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264853,0.00060974556,0.0005543034,0.00041719785,0.00039253128,0.00055238075,0.0006809014,0.00026377293,0.00067553663],"category_scores_gemma":[0.0013668421,0.0004819395,0.00030137337,0.0008247764,0.00020417356,0.00082512276,0.00048430724,0.0005427434,0.0002451789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009916719,0.0001715815,0.003908788,0.0002280666,0.00010580563,0.00012968523,0.00019170274,0.3856627,0.26065508,0.0052313437,0.005110601,0.337613],"study_design_scores_gemma":[0.000012707041,0.00010804766,0.0019654462,0.0000115415805,0.000035993755,0.000104187246,0.000036064263,0.93447477,0.05525751,0.00505913,0.0029024985,0.000032097087],"about_ca_topic_score_codex":0.0013435506,"about_ca_topic_score_gemma":0.0032254737,"teacher_disagreement_score":0.0013435506,"about_ca_system_score_codex":0.00031707744,"about_ca_system_score_gemma":0.00043488477,"threshold_uncertainty_score":0.0026714802},"labels":[],"label_agreement":null},{"id":"W1504387104","doi":"10.1007/978-3-540-74742-0_71","title":"Strategies for Traffic Grooming over Logical Topologies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Traffic grooming; Computer science; Network topology; Computer network; Throughput; Bandwidth (computing); Integer programming; Distributed computing; Logical topology; Wavelength-division multiplexing; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics","score_opus":0.027568133727184915,"score_gpt":0.2683708419892715,"score_spread":0.2408027082620866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504387104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016234135,0.0009122901,0.9589032,0.00031682375,0.00013266865,0.0001278994,0.000058426358,0.00041565788,0.022898862],"genre_scores_gemma":[0.49694785,0.0022778544,0.48005056,0.00032805608,0.00017335828,0.00042499547,0.00018580032,0.0001978386,0.019413654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998087,0.00004796562,0.000011451633,0.000027514749,0.000064306645,0.000040035822],"domain_scores_gemma":[0.99952066,0.00023652794,0.000044194523,0.00007272089,0.00008408222,0.000041819992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004412689,0.0007474743,0.0004099661,0.00076649146,0.00062412163,0.0013534429,0.0014901771,0.00057439593,0.005999238],"category_scores_gemma":[0.0014173182,0.00031764686,0.00034952088,0.0007192731,0.000530328,0.0015737638,0.0011675317,0.0006435648,0.0009469949],"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.00016236963,0.00019364577,0.0004450855,0.0005158259,0.00006021021,0.00018216796,0.000217139,0.15202563,0.027774593,0.44350448,0.0096397735,0.36527905],"study_design_scores_gemma":[0.000032763484,0.00012867905,0.00015668104,0.000056689645,0.00005369362,0.00026110807,0.00012571906,0.6779256,0.0062384186,0.30216378,0.012831397,0.000025509438],"about_ca_topic_score_codex":0.00042796036,"about_ca_topic_score_gemma":0.0012061122,"teacher_disagreement_score":0.005999238,"about_ca_system_score_codex":0.00048315892,"about_ca_system_score_gemma":0.00041309494,"threshold_uncertainty_score":0.02006942},"labels":[],"label_agreement":null},{"id":"W1504406874","doi":"10.1007/978-3-642-25578-6_21","title":"Publicly Verifiable Secret Sharing for Cloud-Based Key Management","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Random oracle; Computer science; Computer security; Key management; Encryption; Public-key cryptography; Key (lock); Scheme (mathematics); Cryptography; Theoretical computer science; Mathematics","score_opus":0.025773715802764864,"score_gpt":0.2366170650551623,"score_spread":0.21084334925239745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504406874","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.010936702,0.0042106635,0.9513933,0.002061763,0.0006743689,0.00023820638,0.000247293,0.0010123254,0.02922541],"genre_scores_gemma":[0.73742425,0.0054622185,0.2045847,0.00062701735,0.0010771714,0.0004748489,0.0007094769,0.0004382052,0.049202073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967175,0.00074506126,0.00018215778,0.00036888904,0.0014367452,0.00054960896],"domain_scores_gemma":[0.99624604,0.0013989568,0.00028658967,0.0016705447,0.00029656754,0.00010129328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024735807,0.00088472397,0.0010904331,0.0006629725,0.0013916761,0.004523742,0.0023992357,0.0024194885,0.008079582],"category_scores_gemma":[0.0057106377,0.0008431351,0.0008680724,0.001750865,0.0030016804,0.009136561,0.0042307377,0.0060629933,0.002801465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021454615,0.00010554085,0.000114078575,0.0002898074,0.000045117893,0.00015329181,0.00023887653,0.019170955,0.008116893,0.86220986,0.01103106,0.09831002],"study_design_scores_gemma":[0.00006817411,0.000095179996,0.00014641043,0.00015518627,0.00004451872,0.00036994266,0.000068724206,0.14521265,0.016224192,0.7997606,0.037790846,0.000063638654],"about_ca_topic_score_codex":0.0005746268,"about_ca_topic_score_gemma":0.0005435375,"teacher_disagreement_score":0.008079582,"about_ca_system_score_codex":0.0029396804,"about_ca_system_score_gemma":0.0023060213,"threshold_uncertainty_score":0.027028918},"labels":[],"label_agreement":null},{"id":"W1504430306","doi":"10.1007/3-540-44886-1_22","title":"Summarizing Web Sites Automatically","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Dalhousie University","funders":"","keywords":"Automatic summarization; Computer science; Directory; Information retrieval; Task (project management); Process (computing); Web site; World Wide Web; Natural language processing; Artificial intelligence; Programming language; The Internet; Engineering","score_opus":0.014036065489801235,"score_gpt":0.25737254834573176,"score_spread":0.2433364828559305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504430306","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.096123256,0.00412062,0.77075225,0.0011896251,0.0006245138,0.0010212263,0.040635902,0.06288926,0.022643302],"genre_scores_gemma":[0.2264911,0.0021981057,0.61709523,0.00022604853,0.00044954842,0.00041548052,0.12732272,0.0031036655,0.022698188],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989492,0.0001479408,0.00009317216,0.0003263716,0.0003896158,0.000093723],"domain_scores_gemma":[0.99812716,0.0006253173,0.00014932534,0.0004953909,0.0005224268,0.000080280115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054920925,0.0014582847,0.0014411344,0.009552336,0.00081223925,0.0026538824,0.0012552518,0.0009380977,0.012025817],"category_scores_gemma":[0.0038461047,0.00084547943,0.0013013093,0.00806092,0.00033894763,0.0033460474,0.001124547,0.0012059117,0.008539812],"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.0003643359,0.00041852897,0.0081834,0.0010142114,0.00031478694,0.0004135694,0.00030286508,0.01073703,0.03078254,0.010566371,0.10305259,0.83384967],"study_design_scores_gemma":[0.00021899004,0.0004415767,0.023313375,0.0004705246,0.0013773325,0.0020570024,0.00108502,0.59593594,0.07828256,0.10090727,0.1957413,0.00016910028],"about_ca_topic_score_codex":0.0038824547,"about_ca_topic_score_gemma":0.0141850235,"teacher_disagreement_score":0.012025817,"about_ca_system_score_codex":0.00060236733,"about_ca_system_score_gemma":0.0011015832,"threshold_uncertainty_score":0.040230334},"labels":[],"label_agreement":null},{"id":"W1504456930","doi":"10.1007/978-3-642-03655-2_97","title":"Augmented Interactions: A Framework for Adding Expressive Power to GUI Widgets","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Generative grammar; Post-WIMP; Expressive power; Human–computer interaction; WIMP; User interface; Programming language; Software engineering; Artificial intelligence; User interface design; Graphical user interface testing","score_opus":0.018414895485341868,"score_gpt":0.3000081295379485,"score_spread":0.2815932340526066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504456930","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.0023426071,0.00033438095,0.982756,0.00007767257,0.00007917976,0.0000653606,0.000088870824,0.0051239515,0.009131952],"genre_scores_gemma":[0.0998902,0.0009042923,0.8643615,0.00023974825,0.00011419411,0.00052660855,0.00047769677,0.00194975,0.031536005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.0002135962,0.00006834814,0.00016342603,0.0004165319,0.000121295925],"domain_scores_gemma":[0.9992619,0.0003044716,0.00003387373,0.00025459775,0.000084523,0.00006064668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008802032,0.0019082034,0.0008531742,0.00084880955,0.0011452138,0.004402777,0.0037884044,0.0017977238,0.016612666],"category_scores_gemma":[0.0019611146,0.0013203331,0.0019472574,0.0006875205,0.0025178923,0.0044054342,0.0058477507,0.0034414402,0.0036144038],"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.00038545835,0.00017620681,0.00038533486,0.00072943454,0.00013010231,0.0007230033,0.0025262795,0.01844074,0.055607297,0.62914103,0.014520066,0.27723512],"study_design_scores_gemma":[0.00017498143,0.00025216793,0.00053864665,0.00038325778,0.000281637,0.0012010303,0.00045172716,0.21066026,0.0457183,0.33414933,0.40594664,0.00024190998],"about_ca_topic_score_codex":0.001757361,"about_ca_topic_score_gemma":0.0028789379,"teacher_disagreement_score":0.016612666,"about_ca_system_score_codex":0.00048622597,"about_ca_system_score_gemma":0.00058232894,"threshold_uncertainty_score":0.055574954},"labels":[],"label_agreement":null},{"id":"W1504509715","doi":"10.1007/11527770_63","title":"On Understanding and Assessing Feature Selection Bias","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; National Research Council Institute for Biodiagnostics","funders":"","keywords":"Feature selection; Selection (genetic algorithm); Computer science; Feature (linguistics); Artificial intelligence; Linguistics; Philosophy","score_opus":0.054350748821586546,"score_gpt":0.2900000794928637,"score_spread":0.23564933067127716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504509715","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.059480503,0.003463587,0.9303464,0.0018408599,0.00016365781,0.00011757392,0.0002240526,0.00054523366,0.0038180626],"genre_scores_gemma":[0.6338278,0.0018701521,0.3585978,0.0013091429,0.0005547443,0.00020777098,0.0006387663,0.00029000887,0.0027037666],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896114,0.005518458,0.0006488983,0.0013789193,0.002458751,0.00038365845],"domain_scores_gemma":[0.8269898,0.15444316,0.005155539,0.0076499647,0.005261361,0.00050010934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024941208,0.0009099178,0.0016713025,0.003014081,0.00064650207,0.0029796683,0.0019883986,0.0022661209,0.0025773617],"category_scores_gemma":[0.18813188,0.0004390418,0.0008927117,0.0030822032,0.0022374208,0.007377954,0.0024169625,0.0018732009,0.00044550523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006879781,0.00021174482,0.050793752,0.0005112551,0.00059201405,0.00024947137,0.00067565526,0.048906144,0.007059941,0.12170461,0.008555285,0.7600522],"study_design_scores_gemma":[0.00013562407,0.000259441,0.025761811,0.00021352967,0.00025649133,0.00061672647,0.00028982692,0.31103167,0.008203535,0.6480283,0.0051002996,0.00010276382],"about_ca_topic_score_codex":0.0022209487,"about_ca_topic_score_gemma":0.0017548633,"teacher_disagreement_score":0.024941208,"about_ca_system_score_codex":0.0010197744,"about_ca_system_score_gemma":0.0011016169,"threshold_uncertainty_score":0.13190329},"labels":[],"label_agreement":null},{"id":"W1504520402","doi":"10.1007/978-3-642-02611-9_45","title":"Automated Multimodal Biometrics Using Face and Ear","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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":"Concordia University","funders":"","keywords":"Biometrics; Computer science; Face (sociological concept); Artificial intelligence; Facial recognition system; Speech recognition; Computer vision; Three-dimensional face recognition; Pattern recognition (psychology); Face detection","score_opus":0.031123738744381794,"score_gpt":0.2803288383741673,"score_spread":0.2492050996297855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504520402","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.051420115,0.0034562796,0.9126847,0.0001773794,0.00029593124,0.000115382056,0.0006507828,0.0039225146,0.027277067],"genre_scores_gemma":[0.41072077,0.0038007316,0.4866951,0.000285324,0.00016302156,0.00016800476,0.0013027883,0.00044273998,0.09642147],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996581,0.00004233928,0.000012839822,0.0000861146,0.00016487624,0.0000356369],"domain_scores_gemma":[0.9997923,0.000050134335,0.000016590038,0.00005837745,0.00007601948,0.000006594494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033633353,0.00049390644,0.0006293266,0.0007027294,0.00030466035,0.000759469,0.0005801456,0.0007882513,0.009805603],"category_scores_gemma":[0.00067550805,0.0002693497,0.0004746167,0.00066646317,0.00026173374,0.0012376551,0.00089491147,0.00032370794,0.0071315197],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015372715,0.00004078658,0.00095845,0.00016994507,0.000031050226,0.00016581795,0.00008069177,0.001893129,0.2693673,0.003248932,0.006175202,0.71771497],"study_design_scores_gemma":[0.00003686635,0.00064933865,0.027714957,0.00027604317,0.00024004554,0.007881805,0.00027388855,0.177996,0.65571636,0.012429541,0.11658057,0.00020460095],"about_ca_topic_score_codex":0.0005230473,"about_ca_topic_score_gemma":0.0010271872,"teacher_disagreement_score":0.009805603,"about_ca_system_score_codex":0.00019026776,"about_ca_system_score_gemma":0.00021271408,"threshold_uncertainty_score":0.03280294},"labels":[],"label_agreement":null},{"id":"W1504556233","doi":"10.1007/11424918_41","title":"A Novel Use of VXML to Construct a Speech Browser for a Public-Domain SpeechWeb","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","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 Windsor","funders":"","keywords":"Computer science; Markup language; Software deployment; Architecture; Public domain; Domain (mathematical analysis); Interpreter; Construct (python library); World Wide Web; Speech synthesis; Speech recognition; XML; Software engineering; Programming language","score_opus":0.04282828798878529,"score_gpt":0.25430026013985463,"score_spread":0.21147197215106933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504556233","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.007667521,0.00007742271,0.91675067,0.00020294164,0.00014140841,0.00015294547,0.00026866433,0.068720356,0.006018094],"genre_scores_gemma":[0.21165638,0.00026406336,0.72931874,0.00048597943,0.00012239451,0.00033280117,0.0018669959,0.024918891,0.031033836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998808,0.00023684531,0.00011474585,0.0002519518,0.0004746061,0.00011375034],"domain_scores_gemma":[0.9974794,0.0009306732,0.00011032477,0.00090508815,0.000337759,0.00023684966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015299458,0.0009135515,0.0006155886,0.00095346273,0.00077513984,0.004725435,0.0026613607,0.0017603826,0.012872542],"category_scores_gemma":[0.0054933657,0.0012194825,0.00097112264,0.00059617276,0.0013053586,0.0050473893,0.004535445,0.002838068,0.0051169107],"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.00171845,0.0009415964,0.0063863564,0.0009551246,0.00033723644,0.0036030186,0.009189822,0.010629042,0.26143646,0.17738907,0.07905956,0.4483542],"study_design_scores_gemma":[0.00038105025,0.00041417207,0.0016031512,0.000238761,0.0002929336,0.0029665485,0.0007556511,0.2070265,0.335865,0.036963467,0.41317657,0.00031621673],"about_ca_topic_score_codex":0.0025143272,"about_ca_topic_score_gemma":0.0029610756,"teacher_disagreement_score":0.012872542,"about_ca_system_score_codex":0.0005765886,"about_ca_system_score_gemma":0.0009829538,"threshold_uncertainty_score":0.043062985},"labels":[],"label_agreement":null},{"id":"W1504587477","doi":"10.1007/978-3-540-88690-7_42","title":"Unsupervised Learning of Skeletons from Motion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Motion (physics); Artificial intelligence; Feature (linguistics); Sequence (biology); Probabilistic logic; Algorithm; Structure from motion; Motion capture; Series (stratigraphy); Parsing; Computer vision; Pattern recognition (psychology)","score_opus":0.016406701772872328,"score_gpt":0.24889337700683975,"score_spread":0.23248667523396743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504587477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01541661,0.00057192915,0.97965264,0.0001258573,0.000052032326,0.0000420178,0.00029674295,0.0025341087,0.0013080477],"genre_scores_gemma":[0.2836724,0.001492967,0.694856,0.00016596315,0.0002882983,0.0002098331,0.005172533,0.00102528,0.013116768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942905,0.000110693385,0.000027117914,0.00024249055,0.00012371961,0.00006689613],"domain_scores_gemma":[0.99876654,0.0004984708,0.00017228587,0.00028732297,0.0001990788,0.0000763657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007129958,0.001101215,0.0015142759,0.0019602776,0.00043338892,0.0009677403,0.0020444228,0.0017627641,0.0045941947],"category_scores_gemma":[0.0035814904,0.0010336466,0.0016391822,0.0019126938,0.0010794973,0.0015924945,0.0016324028,0.0018268514,0.0031696274],"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.00022140471,0.00011193996,0.0013177021,0.00021063979,0.00011433233,0.000099343124,0.00007247583,0.12108217,0.020368177,0.009216012,0.007869293,0.83931655],"study_design_scores_gemma":[0.000020817943,0.00005555328,0.0010933448,0.000032581003,0.000026769696,0.0001372837,0.000017501665,0.97667503,0.0039591636,0.015378431,0.0025897305,0.000013745837],"about_ca_topic_score_codex":0.0024225046,"about_ca_topic_score_gemma":0.0052334913,"teacher_disagreement_score":0.0045941947,"about_ca_system_score_codex":0.0004049458,"about_ca_system_score_gemma":0.0007931265,"threshold_uncertainty_score":0.015369177},"labels":[],"label_agreement":null},{"id":"W1504662635","doi":"10.1007/978-3-642-36089-3_12","title":"Grammatical Inference in Software Engineering: An Overview of the State of the Art","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Queen's University","funders":"","keywords":"Grammar induction; Computer science; Inference; Rule-based machine translation; Grammar; Artificial intelligence; Natural language processing; Software; Variety (cybernetics); Programming language; Class (philosophy); Process (computing); Linguistics","score_opus":0.03433466987507978,"score_gpt":0.2773666441244039,"score_spread":0.24303197424932416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504662635","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026095547,0.5976459,0.30725917,0.009442481,0.0017035112,0.000090431866,0.00042934576,0.0016016443,0.07921801],"genre_scores_gemma":[0.06251202,0.5700957,0.3207753,0.0038896743,0.006181714,0.00020622807,0.001867667,0.0018681871,0.032603476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982406,0.00070476363,0.00015120102,0.00027746943,0.00054441945,0.00008149623],"domain_scores_gemma":[0.99542326,0.0037643209,0.000096205265,0.00030176013,0.00035669032,0.000057685764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032205626,0.0010028301,0.0016192464,0.0032086512,0.00066681515,0.004760289,0.0023298718,0.002516768,0.009545666],"category_scores_gemma":[0.0055102566,0.00077802263,0.0010695746,0.004797475,0.0033902314,0.0075670574,0.0019405892,0.00349973,0.0052330745],"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.0000314671,0.00007610338,0.00026929684,0.0030378106,0.000057746965,0.000100997684,0.00069956284,0.0023074436,0.0015529844,0.27169088,0.036625575,0.6835502],"study_design_scores_gemma":[0.000011463326,0.000029707953,0.0005569527,0.0016937562,0.00004483043,0.00044801048,0.00021219699,0.006911257,0.0015594019,0.4902358,0.49825162,0.000045027013],"about_ca_topic_score_codex":0.0016015384,"about_ca_topic_score_gemma":0.0023270028,"teacher_disagreement_score":0.009545666,"about_ca_system_score_codex":0.0014531479,"about_ca_system_score_gemma":0.0023089016,"threshold_uncertainty_score":0.031933367},"labels":[],"label_agreement":null},{"id":"W1504675538","doi":"10.1007/978-3-642-12107-4","title":"Software Language Engineering","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Athabasca University","funders":"","keywords":"Computer science; Software engineering; Programming language; Software","score_opus":0.005964543767027082,"score_gpt":0.21951044921986387,"score_spread":0.2135459054528368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504675538","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.0025387085,0.010580262,0.69400305,0.001985733,0.0012277814,0.00011454631,0.00044119757,0.005036667,0.28407198],"genre_scores_gemma":[0.032351624,0.014066746,0.23883477,0.0010265872,0.0005580598,0.00022552504,0.0022107854,0.0032900292,0.7074359],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993924,0.00007446199,0.000036948608,0.000098602,0.00036678507,0.000030760948],"domain_scores_gemma":[0.9995192,0.0001646012,0.000016835129,0.000121230616,0.00015319213,0.000024865194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050438737,0.0010602479,0.0006602653,0.0014921366,0.0005723491,0.002034845,0.0009112283,0.0007097323,0.036100928],"category_scores_gemma":[0.0016078568,0.0006609496,0.00077111315,0.0015558744,0.0006860407,0.002410372,0.0014037425,0.0021005804,0.02939505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016005806,0.000058255744,0.00012241179,0.00033050997,0.000018262373,0.00008797958,0.00024194787,0.0023487736,0.0051263324,0.13071842,0.11643375,0.7444973],"study_design_scores_gemma":[0.000009198811,0.000033040185,0.00023234294,0.00021847301,0.000018166324,0.00050750136,0.00006221797,0.0067177597,0.0056391642,0.15191142,0.83463156,0.000019290575],"about_ca_topic_score_codex":0.0005140677,"about_ca_topic_score_gemma":0.0009100019,"teacher_disagreement_score":0.036100928,"about_ca_system_score_codex":0.0006024882,"about_ca_system_score_gemma":0.00078804244,"threshold_uncertainty_score":0.12076962},"labels":[],"label_agreement":null},{"id":"W1504698366","doi":"10.1007/978-3-642-19571-6_28","title":"Tight Bounds for Classical and Quantum Coin Flipping","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Bristol; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Coin flipping; Computer science; Quantum; Correctness; Cryptography; Range (aeronautics); Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Quantum mechanics; Physics","score_opus":0.02601304566012222,"score_gpt":0.24715929867673572,"score_spread":0.2211462530166135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504698366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047273085,0.017574575,0.639571,0.01343847,0.0020211881,0.00032561936,0.0018343036,0.0018272753,0.2761344],"genre_scores_gemma":[0.7245027,0.015991418,0.14973108,0.0039965315,0.0049885022,0.0016094461,0.0025436217,0.0025114045,0.09412535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877627,0.002567261,0.00047924428,0.001844851,0.0045112493,0.0028347168],"domain_scores_gemma":[0.9454223,0.04029266,0.0012740166,0.0077194762,0.0032272807,0.0020643587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009834587,0.0048106015,0.005908761,0.0059109204,0.0059807273,0.013788964,0.010301652,0.006628815,0.038954236],"category_scores_gemma":[0.053946093,0.0035592047,0.0039003487,0.009457918,0.011540236,0.033377584,0.014285714,0.01893664,0.007712276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023373679,0.00010240323,0.0001773789,0.00025823448,0.000040568048,0.00005220583,0.00019915459,0.013477435,0.00061932753,0.955312,0.010132199,0.019395497],"study_design_scores_gemma":[0.000019515564,0.000015808348,0.000085253494,0.00006003764,0.000028137545,0.000034285364,0.000032241373,0.021877674,0.0003459862,0.9746532,0.0028230543,0.00002475143],"about_ca_topic_score_codex":0.0036943303,"about_ca_topic_score_gemma":0.004223167,"teacher_disagreement_score":0.038954236,"about_ca_system_score_codex":0.009739718,"about_ca_system_score_gemma":0.0049869427,"threshold_uncertainty_score":0.13031489},"labels":[],"label_agreement":null},{"id":"W1504713652","doi":"10.1007/bfb0038204","title":"Evaluating programs formed by example: An informational heuristic","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristic; Computer science; Artificial intelligence","score_opus":0.03192598122241707,"score_gpt":0.2999805624111859,"score_spread":0.26805458118876885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504713652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11605278,0.00037950615,0.84961194,0.0014722435,0.000082360624,0.00040848608,0.0002975564,0.0027810752,0.028914046],"genre_scores_gemma":[0.51797384,0.00019004002,0.47529373,0.00034767418,0.00010482143,0.00019196575,0.00069652713,0.00054347183,0.004657824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930952,0.0033215447,0.00041913104,0.0010012381,0.0016744103,0.00048840285],"domain_scores_gemma":[0.96771103,0.025531206,0.00072431314,0.0038136658,0.0017365329,0.0004832619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005967172,0.0010294149,0.0013674794,0.0024643734,0.0013854022,0.0034535679,0.0031812477,0.0028638723,0.012539156],"category_scores_gemma":[0.047208276,0.0009348084,0.001919368,0.0020243071,0.002590813,0.010923976,0.0041129496,0.0020905132,0.0011046308],"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.0017275977,0.00084669096,0.005702144,0.0006569781,0.00025105532,0.00048487802,0.0011339532,0.086799994,0.005509426,0.28324038,0.014698479,0.5989484],"study_design_scores_gemma":[0.00018989321,0.00034855102,0.0012201237,0.00017054593,0.00036928465,0.00035530693,0.00052118767,0.59842324,0.014142239,0.37665597,0.007538811,0.000064811065],"about_ca_topic_score_codex":0.0018608229,"about_ca_topic_score_gemma":0.0043052933,"teacher_disagreement_score":0.012539156,"about_ca_system_score_codex":0.0017403482,"about_ca_system_score_gemma":0.0024112219,"threshold_uncertainty_score":0.041947603},"labels":[],"label_agreement":null},{"id":"W1504725342","doi":"10.1007/11424550_7","title":"MultiText Experiments for INEX 2004","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Information retrieval; Advice (programming); World Wide Web; Programming language; Engineering","score_opus":0.020118180309467035,"score_gpt":0.29629477259204245,"score_spread":0.2761765922825754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504725342","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.7488821,0.0030718555,0.05324939,0.0040165256,0.0025672922,0.0011868344,0.060006984,0.022743018,0.10427593],"genre_scores_gemma":[0.66992277,0.00070808193,0.12587154,0.00098382,0.0006868563,0.0021403665,0.111941926,0.005077631,0.082667],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936784,0.0040703346,0.00039775303,0.0005156725,0.0009915563,0.00034630985],"domain_scores_gemma":[0.9778276,0.014504352,0.00048081583,0.0046451697,0.0018754065,0.0006666274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058881342,0.0012254991,0.0013045432,0.001249566,0.002275549,0.0014986743,0.0020376309,0.0027457348,0.026830794],"category_scores_gemma":[0.021460025,0.0006124945,0.0009128381,0.0018626862,0.00089732476,0.0031811723,0.0021584323,0.0018567867,0.00949496],"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.023391008,0.010077503,0.0088752555,0.00217388,0.00069236744,0.0017150457,0.0018361778,0.07605557,0.012756113,0.011941217,0.52425855,0.3262273],"study_design_scores_gemma":[0.01117796,0.012024154,0.049564272,0.0005101164,0.0009531793,0.002549651,0.0030229497,0.41299644,0.09776624,0.048385374,0.3602977,0.00075192214],"about_ca_topic_score_codex":0.005894331,"about_ca_topic_score_gemma":0.008542376,"teacher_disagreement_score":0.026830794,"about_ca_system_score_codex":0.0009356952,"about_ca_system_score_gemma":0.0010640798,"threshold_uncertainty_score":0.08975792},"labels":[],"label_agreement":null},{"id":"W1504754385","doi":"10.1007/978-3-642-13824-9_8","title":"Formal Lifetime Reliability Analysis Using Continuous Random Variables","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","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":"Concordia University","funders":"","keywords":"Computer science; Reliability (semiconductor); Random variable; Reliability engineering; Reliability theory; Failure rate; Process (computing); Hazard; Mathematics; Statistics","score_opus":0.013473977106000052,"score_gpt":0.2652839295469684,"score_spread":0.2518099524409683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504754385","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.0023257716,0.00027825029,0.9959202,0.000058983747,0.00003709094,0.000016593522,0.000029189021,0.00015142119,0.0011824457],"genre_scores_gemma":[0.5946005,0.0016329811,0.39220032,0.00027345383,0.0005982241,0.0004869649,0.0003280967,0.0006771305,0.0092022875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503607,0.0024214587,0.00018940211,0.0006786419,0.0013342884,0.0003400594],"domain_scores_gemma":[0.97408015,0.019522587,0.0015548039,0.002980588,0.0016266832,0.00023509123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007782796,0.0014663237,0.0013383273,0.0025416103,0.00046364212,0.0019559676,0.002103323,0.0010617397,0.0051069483],"category_scores_gemma":[0.020450307,0.0007584275,0.0015387381,0.001717222,0.0033287357,0.004957061,0.0014452945,0.0035591486,0.0008604737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050206465,0.000060094084,0.00046988015,0.0002579398,0.00006418449,0.000117744705,0.00016123196,0.17014362,0.003355038,0.78437746,0.0019260878,0.03901654],"study_design_scores_gemma":[0.0000123521995,0.00006379508,0.00026543156,0.000052087995,0.0000354458,0.00012467502,0.000030117997,0.5242359,0.0017031915,0.47075003,0.0026917376,0.000035137706],"about_ca_topic_score_codex":0.00047002194,"about_ca_topic_score_gemma":0.00039233355,"teacher_disagreement_score":0.007782796,"about_ca_system_score_codex":0.0016366419,"about_ca_system_score_gemma":0.0010868479,"threshold_uncertainty_score":0.04115987},"labels":[],"label_agreement":null},{"id":"W1504767436","doi":"10.1007/978-3-642-02976-9_10","title":"Towards the Merging of Multiple Clinical Protocols and Guidelines via Ontology-Driven Modeling","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Ontology; CpG site; Clinical Practice; Information retrieval; Software engineering; Data mining; Medicine","score_opus":0.08441899203843836,"score_gpt":0.3695302620340862,"score_spread":0.28511126999564784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504767436","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.002885707,0.00022651124,0.99103254,0.0005947567,0.000036085803,0.00038194278,0.000829835,0.002697921,0.0013147639],"genre_scores_gemma":[0.02746127,0.00028395088,0.9681484,0.00022014126,0.000016303631,0.0002777159,0.0026801284,0.00031977377,0.0005923635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906376,0.0032627496,0.001535802,0.001230347,0.0029842725,0.00034925717],"domain_scores_gemma":[0.9850721,0.0082663605,0.0012240078,0.002460431,0.0025411032,0.0004361332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015567986,0.0012721041,0.0017774885,0.0048675835,0.0013937405,0.007433395,0.0048327046,0.0026046727,0.002724204],"category_scores_gemma":[0.028639017,0.0019598708,0.0056594172,0.0054551056,0.0014687099,0.00663606,0.006601494,0.0037162001,0.0014217204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000464593,0.0005837052,0.0053341114,0.0019781871,0.0012814753,0.0018691315,0.0048206984,0.23165299,0.009768702,0.2193633,0.019848088,0.503035],"study_design_scores_gemma":[0.00010066474,0.00008490268,0.0007189894,0.000600974,0.0006211138,0.00041923847,0.0005237079,0.76189214,0.010750385,0.17026289,0.05390835,0.000116617],"about_ca_topic_score_codex":0.020076618,"about_ca_topic_score_gemma":0.030730885,"teacher_disagreement_score":0.020076618,"about_ca_system_score_codex":0.0027351321,"about_ca_system_score_gemma":0.008792003,"threshold_uncertainty_score":0.08233237},"labels":[],"label_agreement":null},{"id":"W1504883860","doi":"10.1007/978-3-540-89646-3_20","title":"Combining Line and Point Correspondences for Homography Estimation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":44,"is_retracted":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":"U.S. Consumer Product Safety Commission","keywords":"Normalization (sociology); Computer science; Homography; Artificial intelligence; Line (geometry); Computer vision; Point (geometry); Algorithm; Line segment; Mathematics; Geometry; Statistics","score_opus":0.01880233710480925,"score_gpt":0.27664159263851656,"score_spread":0.2578392555337073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504883860","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.0058253338,0.00028675565,0.9912243,0.000034235407,0.00004044533,0.000021939975,0.00011217985,0.0015596024,0.00089531275],"genre_scores_gemma":[0.13839318,0.0007904115,0.85444033,0.00011603332,0.0000969026,0.000083060215,0.0010079568,0.00047623226,0.004595906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990269,0.00016712655,0.000031427677,0.00025337725,0.00041982788,0.000101389815],"domain_scores_gemma":[0.9992797,0.00020374921,0.00005666681,0.00023691989,0.00019795548,0.000024975127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006915323,0.0011330864,0.0017693546,0.0022536758,0.00043704288,0.0011846912,0.0013585176,0.001922341,0.008289399],"category_scores_gemma":[0.0019585078,0.0010180698,0.0010259921,0.0045486954,0.00036941,0.0030848782,0.0015537944,0.0012867618,0.007777908],"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.00020655022,0.000099929945,0.00069243053,0.00019937682,0.00014952014,0.000115068804,0.000061563296,0.032746855,0.08825946,0.0027033307,0.004428704,0.8703371],"study_design_scores_gemma":[0.00006886859,0.00018688636,0.0030887672,0.000055537792,0.00015303533,0.00060996535,0.00009525035,0.8769387,0.09528613,0.0122887865,0.011154729,0.00007338872],"about_ca_topic_score_codex":0.0013891966,"about_ca_topic_score_gemma":0.002748465,"teacher_disagreement_score":0.008289399,"about_ca_system_score_codex":0.00024383051,"about_ca_system_score_gemma":0.0005674947,"threshold_uncertainty_score":0.027730823},"labels":[],"label_agreement":null},{"id":"W1504888431","doi":"10.1007/11876663_14","title":"Ontological Support for a Theory-Eclectic Approach to Instructional and Learning Design","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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é TÉLUQ","funders":"","keywords":"Computer science; Instructional design; Cognitive science; Artificial intelligence; Human–computer interaction; Theoretical computer science; Multimedia; Psychology","score_opus":0.03200555851341629,"score_gpt":0.26474645509276235,"score_spread":0.23274089657934605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504888431","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.0044047963,0.00022207834,0.9454583,0.0068039787,0.00012526024,0.00016639897,0.00011409188,0.00026856695,0.04243657],"genre_scores_gemma":[0.28779885,0.00033241583,0.700269,0.0010339611,0.00011602923,0.0009795487,0.00035127325,0.00029582178,0.008823147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99071234,0.005770592,0.0008325461,0.0007480524,0.0015437494,0.0003928606],"domain_scores_gemma":[0.9876594,0.007578108,0.00047659955,0.0024133562,0.0013484287,0.0005240396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008611109,0.0009821834,0.00084003,0.0034638613,0.0042061587,0.010047895,0.003263276,0.0040092096,0.012180533],"category_scores_gemma":[0.013736054,0.0013893454,0.0022996692,0.0021199104,0.015254967,0.0150485225,0.008028189,0.0063157286,0.0019129226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003252766,0.00001406488,0.000050734612,0.00003172288,0.0000050758977,0.000016314534,0.00079287885,0.00031358696,0.0000905547,0.9947008,0.00032638843,0.0036545387],"study_design_scores_gemma":[0.000015018843,0.0000070194883,0.000035305682,0.00005464362,0.00001716019,0.00004253337,0.000575517,0.0039435234,0.0003844382,0.97790897,0.017008642,0.0000072436574],"about_ca_topic_score_codex":0.002766017,"about_ca_topic_score_gemma":0.0034922694,"teacher_disagreement_score":0.012180533,"about_ca_system_score_codex":0.0053392383,"about_ca_system_score_gemma":0.004970143,"threshold_uncertainty_score":0.045540452},"labels":[],"label_agreement":null},{"id":"W1504889675","doi":"10.1007/bfb0020347","title":"EUROPORT — ESPRIT European porting projects","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Smiths Detection (Canada)","funders":"","keywords":"Porting; Frame (networking); Computer science; Engineering management; Systems engineering; Software engineering; Engineering; Operating system; Manufacturing engineering; Telecommunications; Software","score_opus":0.02319826329436913,"score_gpt":0.2454194371589045,"score_spread":0.22222117386453535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504889675","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026133785,0.005239763,0.19865194,0.0026499033,0.0036730613,0.0005349749,0.017459143,0.08830022,0.65735716],"genre_scores_gemma":[0.06645242,0.0045204153,0.16096403,0.0010406264,0.0005955487,0.00035340406,0.054392446,0.028873496,0.68280756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985991,0.00023435263,0.000066938876,0.00029214929,0.0005727219,0.00023471564],"domain_scores_gemma":[0.99834573,0.00019411863,0.00007799608,0.00061657897,0.00050107634,0.00026461534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026688918,0.002440491,0.0013376392,0.002527567,0.0012522426,0.005868712,0.0029367413,0.0020147897,0.14085959],"category_scores_gemma":[0.002241191,0.0007361882,0.0015452794,0.002526405,0.0005895773,0.004891606,0.0031890948,0.0019680378,0.07138208],"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.0011876101,0.0005129345,0.0010359285,0.0006577504,0.00014687623,0.00058243726,0.00034273794,0.003900154,0.019270187,0.110174485,0.28426737,0.5779216],"study_design_scores_gemma":[0.00018166972,0.00018896066,0.0011702947,0.00023627587,0.00011209106,0.0006806273,0.00011499451,0.008906568,0.018538158,0.017978359,0.95184284,0.00004923912],"about_ca_topic_score_codex":0.0048637646,"about_ca_topic_score_gemma":0.0017983939,"teacher_disagreement_score":0.14085959,"about_ca_system_score_codex":0.0014284239,"about_ca_system_score_gemma":0.0023977847,"threshold_uncertainty_score":0.47122228},"labels":[],"label_agreement":null},{"id":"W1504893535","doi":"10.1007/978-3-540-68880-8_20","title":"Shortest Path Queries in Polygonal Domains","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Voronoi diagram; Shortest path problem; Computer science; Graph; Path (computing); Combinatorics; Distance; Domain (mathematical analysis); Time complexity; Algorithm; Theoretical computer science; Mathematics; Geometry","score_opus":0.014786638362403326,"score_gpt":0.2347587505430358,"score_spread":0.21997211218063248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504893535","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.07431361,0.0037798563,0.8629953,0.0016256223,0.0002984533,0.00029167449,0.002521361,0.003990645,0.05018351],"genre_scores_gemma":[0.44303066,0.004438303,0.51309985,0.00029661643,0.00025940797,0.00039537207,0.007597412,0.0012279687,0.029654434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985796,0.00026753102,0.00011848849,0.00023404184,0.00063708116,0.00016322992],"domain_scores_gemma":[0.99766773,0.0016515616,0.000086846245,0.00032470477,0.00018576844,0.000083420586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007330026,0.0006429073,0.0017254971,0.0010848794,0.0010364564,0.002406598,0.0019131274,0.0015847824,0.0073952465],"category_scores_gemma":[0.005607169,0.00064896554,0.0006574666,0.003797833,0.0011085712,0.0059704906,0.0031298122,0.0017181631,0.0017759561],"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.00053366425,0.00017485932,0.00091204554,0.0014201349,0.000063911124,0.000521519,0.0008102754,0.21595387,0.007763479,0.4059914,0.05575104,0.31010383],"study_design_scores_gemma":[0.00009888174,0.000056126282,0.0002775771,0.00010602636,0.000026395473,0.0004270284,0.00049357483,0.512366,0.0061068335,0.4249154,0.055091176,0.000034918932],"about_ca_topic_score_codex":0.0023178416,"about_ca_topic_score_gemma":0.0020554566,"teacher_disagreement_score":0.0073952465,"about_ca_system_score_codex":0.0010653702,"about_ca_system_score_gemma":0.0006306622,"threshold_uncertainty_score":0.024739563},"labels":[],"label_agreement":null},{"id":"W1504994924","doi":"10.1007/978-3-540-25948-0_103","title":"Feature-Level Fusion for Effective Palmprint Authentication","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hamming distance; Fusion; Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Biometrics; Code (set theory); Authentication (law); Gabor filter; Feature extraction; Computer vision; Algorithm","score_opus":0.025385588412356736,"score_gpt":0.2673124641116527,"score_spread":0.24192687569929597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504994924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02019923,0.0008005027,0.9760066,0.00008037894,0.00006463657,0.000033064618,0.000080720325,0.0010275287,0.001707257],"genre_scores_gemma":[0.43224126,0.0011606904,0.55922884,0.00013800264,0.00007947075,0.00008358605,0.0003140151,0.000149996,0.0066041755],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956375,0.000058279118,0.00002418335,0.00006881853,0.0002298024,0.000055069897],"domain_scores_gemma":[0.9997497,0.000086876804,0.000019567005,0.000068988935,0.000065522545,0.000009353302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040793285,0.00047378454,0.00068341155,0.0005445939,0.0003000354,0.0006187582,0.00060213025,0.00076938316,0.004292113],"category_scores_gemma":[0.0009212273,0.00030594744,0.00053039676,0.0007911499,0.00033408232,0.001464262,0.000994332,0.000642039,0.0018559941],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036565488,0.0001077496,0.0002713745,0.00013300756,0.000048206522,0.00007596728,0.00004747083,0.018881144,0.31510702,0.00498121,0.0023064644,0.65767473],"study_design_scores_gemma":[0.000026896749,0.00023726169,0.0021873733,0.000031054187,0.00009843791,0.00059281156,0.000035021876,0.6066158,0.3744311,0.0074497894,0.008236825,0.000057687153],"about_ca_topic_score_codex":0.00041090927,"about_ca_topic_score_gemma":0.0006679778,"teacher_disagreement_score":0.004292113,"about_ca_system_score_codex":0.00024453734,"about_ca_system_score_gemma":0.0002373907,"threshold_uncertainty_score":0.0143585205},"labels":[],"label_agreement":null},{"id":"W1505067391","doi":"10.1007/978-3-642-02620-1_25","title":"A Highly Scalable RFID Authentication Protocol","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RFID technology advancements","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Authentication protocol; Protocol (science); Authentication (law); Computer network; Embedded system; Computer security; Operating system","score_opus":0.009216592881915,"score_gpt":0.24172215647997686,"score_spread":0.23250556359806185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505067391","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.01508237,0.0010640152,0.9476369,0.0006445226,0.0007831779,0.000459124,0.0003803378,0.011909311,0.022040192],"genre_scores_gemma":[0.36845377,0.0013196751,0.57035506,0.00065277366,0.0006982995,0.0010297955,0.0017957647,0.0013457296,0.05434908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987092,0.00018779965,0.000107831096,0.00016871073,0.00065505964,0.00017141576],"domain_scores_gemma":[0.9983986,0.00031672954,0.00007628983,0.0008359188,0.00029104066,0.000081422586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030904,0.001069243,0.0010836181,0.00086002913,0.0012254443,0.0016913611,0.0017519555,0.0008928614,0.010936405],"category_scores_gemma":[0.0019285115,0.0007939901,0.0006073878,0.0012527806,0.00077621604,0.0044200085,0.0042427755,0.002214308,0.006005625],"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.0013894006,0.00034027544,0.000538009,0.0005489128,0.00011360972,0.00055396557,0.00024472288,0.02780983,0.15478018,0.20132852,0.06247794,0.5498746],"study_design_scores_gemma":[0.00040074164,0.00066838093,0.0009135257,0.000115863535,0.00026815684,0.0015514542,0.0001574221,0.5292962,0.11299773,0.2002725,0.15314509,0.00021296264],"about_ca_topic_score_codex":0.00053436117,"about_ca_topic_score_gemma":0.00059497054,"teacher_disagreement_score":0.010936405,"about_ca_system_score_codex":0.00068693404,"about_ca_system_score_gemma":0.0012453004,"threshold_uncertainty_score":0.036585927},"labels":[],"label_agreement":null},{"id":"W1505077723","doi":"10.1007/11559573_106","title":"Carotid Artery Ultrasound Image Segmentation Using Fuzzy Region Growing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Image segmentation; Segmentation; Ultrasound; Carotid arteries; Region growing; Radiology; Medicine; Scale-space segmentation; Internal medicine","score_opus":0.0229647488472599,"score_gpt":0.2781774407225861,"score_spread":0.2552126918753262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505077723","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.016597083,0.0015091018,0.97805256,0.00008688183,0.000063797066,0.0000789901,0.00006803882,0.0008123997,0.0027310492],"genre_scores_gemma":[0.097824626,0.0010265724,0.89705366,0.000056641882,0.0000674942,0.00006692031,0.0001328949,0.0002558545,0.0035153283],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995573,0.000049441758,0.000034863177,0.00010995705,0.00021383695,0.00003446289],"domain_scores_gemma":[0.9993635,0.0002965167,0.000041511175,0.00009085848,0.0001902378,0.000017449318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007595424,0.00055574183,0.000900804,0.0016538815,0.00037836313,0.0007803761,0.0011012879,0.001151717,0.0018500903],"category_scores_gemma":[0.001549832,0.00072962046,0.00087201933,0.001182745,0.00044626073,0.0010148276,0.0004494975,0.00066415226,0.0010738902],"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.00024524287,0.00004774335,0.0006749887,0.00042200054,0.00009752943,0.00026617805,0.00021372712,0.02664962,0.2755356,0.0052893995,0.0026298806,0.6879281],"study_design_scores_gemma":[0.000042970252,0.0002192429,0.0042624907,0.00010804421,0.0002791648,0.0037342252,0.00007848608,0.7145634,0.25098553,0.008844282,0.01675298,0.0001291604],"about_ca_topic_score_codex":0.001929617,"about_ca_topic_score_gemma":0.00221751,"teacher_disagreement_score":0.001929617,"about_ca_system_score_codex":0.0003573416,"about_ca_system_score_gemma":0.0004804456,"threshold_uncertainty_score":0.0061891675},"labels":[],"label_agreement":null},{"id":"W1505242526","doi":"10.1007/3-540-45311-3_12","title":"Frameproof and IPP Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Hash function; Computer science; Property (philosophy); Generalization; Class (philosophy); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Computer security; Artificial intelligence","score_opus":0.013638423814225266,"score_gpt":0.2320977954967139,"score_spread":0.21845937168248863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505242526","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022619834,0.008928151,0.4134243,0.006058409,0.0016618312,0.00011651295,0.0007428442,0.0010018048,0.5454462],"genre_scores_gemma":[0.56385684,0.015226938,0.13128942,0.0020876324,0.0029530644,0.0006000355,0.0013894017,0.0011232109,0.28147355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992562,0.00018423442,0.00003184137,0.00008943444,0.00032988234,0.00010845342],"domain_scores_gemma":[0.9989724,0.00052421656,0.00006519197,0.0002494994,0.00015177361,0.00003702897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006451482,0.000969104,0.0006610712,0.0014631246,0.0014923376,0.002661581,0.0007430653,0.0012544009,0.012487294],"category_scores_gemma":[0.0035266057,0.00048244535,0.0005412024,0.0021994957,0.0023294452,0.004607494,0.0014984737,0.0034348657,0.0042964555],"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.00001556817,0.000007066004,0.000017940312,0.000041423446,0.0000018512595,0.000022724837,0.00006208221,0.0006176721,0.00025563955,0.96528596,0.0074736476,0.026198624],"study_design_scores_gemma":[0.000006761972,0.0000070617134,0.000023350874,0.000025017736,0.0000038569437,0.000062836974,0.000012741779,0.0010554888,0.0005976894,0.9663277,0.031870913,0.0000066249386],"about_ca_topic_score_codex":0.00089679146,"about_ca_topic_score_gemma":0.00049004296,"teacher_disagreement_score":0.012487294,"about_ca_system_score_codex":0.0016875836,"about_ca_system_score_gemma":0.0011319639,"threshold_uncertainty_score":0.041774154},"labels":[],"label_agreement":null},{"id":"W1505266085","doi":"10.1007/978-3-540-46515-7_9","title":"Folding and Cutting Paper","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Folding (DSP implementation); Computer science; Graph; Plane (geometry); Algorithm; Skeleton (computer programming); Fold (higher-order function); Geometry; Topology (electrical circuits); Combinatorics; Theoretical computer science; Mathematics; Structural engineering; Engineering","score_opus":0.013211215895128331,"score_gpt":0.23520144078749639,"score_spread":0.22199022489236805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505266085","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010881417,0.0048223017,0.26905498,0.0009995663,0.004889132,0.00013514758,0.0007489687,0.002730512,0.7057379],"genre_scores_gemma":[0.08665518,0.0036779656,0.102065414,0.00045667766,0.00058565754,0.00010885195,0.001870704,0.0019982723,0.8025813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995975,0.00003135809,0.000021573567,0.0001335135,0.00017314173,0.00004290142],"domain_scores_gemma":[0.99964416,0.000050436967,0.000012766383,0.00018569267,0.00007850172,0.000028391014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029454657,0.0009966756,0.00094650686,0.0018243532,0.0012917946,0.0022407754,0.0010043636,0.00083444244,0.11193487],"category_scores_gemma":[0.0010308768,0.00056969665,0.0008820918,0.0017688873,0.00069746654,0.0022735621,0.0015699376,0.0015720639,0.043466765],"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.00008235221,0.000053414697,0.00022240031,0.00023714441,0.000025529831,0.00030213097,0.00016128164,0.0026725198,0.01446386,0.26276496,0.08511215,0.6339023],"study_design_scores_gemma":[0.0000155343,0.00006147973,0.00062182755,0.00012418513,0.000028169063,0.0010425557,0.00014799676,0.0069023855,0.020258605,0.3075553,0.6632095,0.000032473203],"about_ca_topic_score_codex":0.00039781732,"about_ca_topic_score_gemma":0.0005930357,"teacher_disagreement_score":0.11193487,"about_ca_system_score_codex":0.00050326023,"about_ca_system_score_gemma":0.00041647343,"threshold_uncertainty_score":0.37445945},"labels":[],"label_agreement":null},{"id":"W1505315642","doi":"10.1007/978-3-540-75759-7_76","title":"On Fiducial Target Registration Error in the Presence of Anisotropic Noise","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Queen's University; Kingston General Hospital","funders":"","keywords":"Fiducial marker; Kalman filter; Noise (video); Computer vision; Stylus; Artificial intelligence; Computer science; Simple (philosophy); Algorithm; Image (mathematics)","score_opus":0.011990087265788657,"score_gpt":0.2414615642679458,"score_spread":0.22947147700215714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505315642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10304346,0.0017270144,0.89181745,0.0003506119,0.00017629832,0.000033706026,0.000082291204,0.00028835254,0.0024808166],"genre_scores_gemma":[0.83695763,0.0015348429,0.15756899,0.000107805994,0.00015429985,0.00003247058,0.00031167272,0.00025511268,0.0030770923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697804,0.0007358447,0.00016027348,0.0004702252,0.0014956894,0.00015990903],"domain_scores_gemma":[0.9897305,0.006912377,0.00080241315,0.0009425218,0.0014961301,0.00011609607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037959286,0.0007919348,0.0011430607,0.0011271149,0.0004341692,0.00091599685,0.0012527377,0.0015076107,0.00078825804],"category_scores_gemma":[0.028935825,0.00042336827,0.00046126277,0.0015182962,0.001470894,0.0019590708,0.0015194685,0.0009668349,0.0003167004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017576386,0.000098143966,0.006652356,0.00048466527,0.00016543365,0.0005906025,0.00044834596,0.6400283,0.031654995,0.038544457,0.002377509,0.27719763],"study_design_scores_gemma":[0.00001223801,0.000085312015,0.0022000538,0.000026509888,0.00004358733,0.0003478462,0.000036765377,0.9817707,0.009428544,0.005115066,0.00089507666,0.000038342987],"about_ca_topic_score_codex":0.0034280708,"about_ca_topic_score_gemma":0.002535103,"teacher_disagreement_score":0.0037959286,"about_ca_system_score_codex":0.0005727616,"about_ca_system_score_gemma":0.0005928823,"threshold_uncertainty_score":0.020074964},"labels":[],"label_agreement":null},{"id":"W1505366399","doi":"10.1007/978-3-540-85988-8_115","title":"Dynamic Cardiac Mapping on Patient-Specific Cardiac Models","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"ECG Monitoring and Analysis","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Cardiac Ablation; Cardiac electrophysiology; Virtual reality; Computer vision; Artificial intelligence; Catheter ablation; Ablation; Medicine; Electrophysiology; Cardiology","score_opus":0.021142977870383498,"score_gpt":0.24820270223045324,"score_spread":0.22705972436006974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505366399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04967588,0.00016766088,0.9484793,0.0001196194,0.00002088643,0.00003016775,0.0001238777,0.00042461127,0.00095791806],"genre_scores_gemma":[0.8764227,0.0004592931,0.12105108,0.00007355976,0.0000420687,0.00006475191,0.00029695994,0.0001266913,0.0014627953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999795,0.000083782994,0.000010774639,0.000039177998,0.00005196339,0.00001929819],"domain_scores_gemma":[0.9990809,0.00062224205,0.00006304561,0.00012277282,0.000070112736,0.000040962168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050102,0.00039096075,0.0005156715,0.00037932326,0.00016708588,0.0007692647,0.00050098344,0.0006004588,0.0010903479],"category_scores_gemma":[0.0036068233,0.00034631352,0.0005217059,0.00038663263,0.00026966934,0.00062153884,0.0008242304,0.0005911441,0.0002945429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021883077,0.000049226197,0.0017471662,0.00008642961,0.000051931234,0.0004040043,0.0001029298,0.8727364,0.013921702,0.0069644097,0.00097222277,0.10274478],"study_design_scores_gemma":[0.000002813169,0.000017255214,0.00025349992,0.0000037372147,0.0000043641326,0.00011314481,0.00000650497,0.99584454,0.0012428619,0.0022095332,0.00029814977,0.0000035169073],"about_ca_topic_score_codex":0.001502757,"about_ca_topic_score_gemma":0.0016120371,"teacher_disagreement_score":0.001502757,"about_ca_system_score_codex":0.00022548364,"about_ca_system_score_gemma":0.00031309575,"threshold_uncertainty_score":0.0036475658},"labels":[],"label_agreement":null},{"id":"W1505387147","doi":"10.1007/978-3-642-15745-5_41","title":"Detecting Brain Activation in fMRI Using Group Random Walker","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Voxel; Probabilistic logic; Computer science; Segmentation; Artificial intelligence; Pattern recognition (psychology); Functional magnetic resonance imaging; Graph; Group (periodic table); Group analysis; Subject (documents); Theoretical computer science; Psychology; Neuroscience","score_opus":0.02735875624747559,"score_gpt":0.27481323628580007,"score_spread":0.2474544800383245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505387147","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.22745644,0.00022031336,0.76986635,0.00016735432,0.00006941702,0.00015711636,0.00012108438,0.00062580785,0.001316107],"genre_scores_gemma":[0.6526666,0.0002139709,0.3446735,0.00011675742,0.00007536816,0.00024638153,0.0001606801,0.00014218291,0.0017044173],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997873,0.00011035701,0.000007610038,0.00004359839,0.000034869998,0.000016180478],"domain_scores_gemma":[0.99953103,0.00035622192,0.000030671472,0.000029390216,0.000025864769,0.000026864114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008854644,0.00037389365,0.0005661014,0.00060270674,0.0002359596,0.0003968036,0.00034143517,0.00079691864,0.0016764858],"category_scores_gemma":[0.0022098992,0.0003083022,0.00027832534,0.00058297947,0.00032822014,0.0005322932,0.00039864247,0.00044457932,0.00033188745],"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.0013778816,0.0004034157,0.005566797,0.0003743699,0.00022596458,0.00076490664,0.00031363053,0.0665664,0.64986825,0.008166493,0.0023444905,0.26402736],"study_design_scores_gemma":[0.00016403692,0.0008359849,0.0110260025,0.000024381608,0.00011859456,0.001083655,0.00007337024,0.87318164,0.09443806,0.017181056,0.0018208185,0.000052470965],"about_ca_topic_score_codex":0.00031589885,"about_ca_topic_score_gemma":0.0008502456,"teacher_disagreement_score":0.0016764858,"about_ca_system_score_codex":0.00008375154,"about_ca_system_score_gemma":0.00017917894,"threshold_uncertainty_score":0.0056084394},"labels":[],"label_agreement":null},{"id":"W1505403295","doi":"10.1007/978-3-642-04380-2_18","title":"Evaluating Adaptive Feedback in an Educational Computer Game","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer game; Educational game; Human–computer interaction; Multimedia; Artificial intelligence","score_opus":0.05554463983765501,"score_gpt":0.3203511902769898,"score_spread":0.26480655043933476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505403295","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.95592934,0.00018768931,0.038891707,0.00006639125,0.00006136821,0.0003183123,0.000077063465,0.00052198407,0.0039461087],"genre_scores_gemma":[0.975601,0.00009440476,0.02139531,0.000037493144,0.000011760268,0.00012690653,0.00012849236,0.0000500288,0.0025546292],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99848574,0.00064902124,0.00012000959,0.0001852779,0.00047122384,0.000088825946],"domain_scores_gemma":[0.9841547,0.0131992735,0.0005763155,0.00029035023,0.0012689248,0.0005104933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019389734,0.0010842248,0.00067848916,0.0005192217,0.00022129041,0.0012580138,0.0011446598,0.0010208077,0.0031890238],"category_scores_gemma":[0.024593828,0.0002851064,0.00019373746,0.0002449331,0.00027894857,0.00079150207,0.0006272771,0.00059472077,0.00042622007],"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.020475166,0.008320807,0.04608494,0.0010057235,0.00033403933,0.000756495,0.0020706456,0.116794124,0.10503919,0.003012806,0.0047971806,0.69130886],"study_design_scores_gemma":[0.00076703617,0.010882866,0.047261905,0.00013846373,0.00031951506,0.00039465193,0.0005180821,0.8983077,0.03623664,0.002805188,0.0022550768,0.00011285021],"about_ca_topic_score_codex":0.004196999,"about_ca_topic_score_gemma":0.0053715874,"teacher_disagreement_score":0.004196999,"about_ca_system_score_codex":0.00055898825,"about_ca_system_score_gemma":0.00046490895,"threshold_uncertainty_score":0.010668337},"labels":[],"label_agreement":null},{"id":"W1505471309","doi":"10.1007/3-540-36265-7_25","title":"Performance Comparison of Pipelined Hash Joins on Workstation Clusters","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Hash join; Hash function; Joins; Hash tree; Join (topology); Double hashing; Hash table; Parallel computing; Rolling hash; Theoretical computer science; Programming language; Mathematics","score_opus":0.03145929352713821,"score_gpt":0.24967147517444715,"score_spread":0.21821218164730893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505471309","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.97674495,0.0024074,0.0069493945,0.00027008425,0.00020938394,0.00008726191,0.0013494943,0.0060436088,0.005938367],"genre_scores_gemma":[0.9817255,0.00052593724,0.011323085,0.000042059266,0.00009065942,0.00004390748,0.0024320676,0.00026922795,0.0035475022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969584,0.00058255217,0.00024953246,0.00046386322,0.001123909,0.00062166725],"domain_scores_gemma":[0.9905405,0.0048513273,0.00039806438,0.0013502841,0.0017709703,0.0010888398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028065222,0.0010426273,0.0016676022,0.0016109846,0.0011803731,0.0021418831,0.002529163,0.0011081251,0.008979711],"category_scores_gemma":[0.0058283755,0.00095621776,0.00048315406,0.004193207,0.00071197597,0.002499399,0.0013171936,0.0007994861,0.0011055376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0806028,0.0026342345,0.031815536,0.002479968,0.0009238306,0.00074622437,0.0013479005,0.34446713,0.13873607,0.0112795355,0.05619166,0.32877517],"study_design_scores_gemma":[0.0030504237,0.008927301,0.03113985,0.000070851565,0.0005274899,0.00046903754,0.0011183538,0.85222244,0.08704717,0.0050184587,0.010189567,0.00021897367],"about_ca_topic_score_codex":0.006680651,"about_ca_topic_score_gemma":0.0058330297,"teacher_disagreement_score":0.008979711,"about_ca_system_score_codex":0.0018648498,"about_ca_system_score_gemma":0.0016513594,"threshold_uncertainty_score":0.030040145},"labels":[],"label_agreement":null},{"id":"W1505520643","doi":"10.1007/3-540-45429-2_20","title":"Data Abstraction in AspectJ","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"AspectJ; Computer science; Programming language; Aspect-oriented programming; Modularity (biology); Abstraction; Software engineering; Modular design; Software; Epistemology","score_opus":0.07861698685596824,"score_gpt":0.3188596120223591,"score_spread":0.24024262516639083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505520643","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.013201562,0.0008920267,0.95044506,0.00048681037,0.0002894413,0.00012547261,0.00023907081,0.012413452,0.021907112],"genre_scores_gemma":[0.22521508,0.001966289,0.72506064,0.0011232083,0.00038452938,0.0002866579,0.0017696561,0.014604175,0.02958971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729365,0.00042451132,0.0003642226,0.0003628895,0.0013143194,0.00024036341],"domain_scores_gemma":[0.9975343,0.0007646131,0.00017133873,0.0011606279,0.00027342536,0.00009577559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027354967,0.00079118845,0.00088766374,0.0011990679,0.000912966,0.003966452,0.001940479,0.000987312,0.0056433505],"category_scores_gemma":[0.005295504,0.001617061,0.0016605962,0.002015675,0.0013445248,0.005972622,0.0031711918,0.0037970773,0.0022202558],"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.0002719157,0.00013239891,0.0018457329,0.00080610346,0.00015895478,0.00047978078,0.0023350928,0.0042528543,0.018175518,0.49057317,0.022276554,0.4586919],"study_design_scores_gemma":[0.00009908315,0.00009333832,0.00124663,0.00032780692,0.00042605866,0.0014189939,0.00029102553,0.038191617,0.033274457,0.37618575,0.5483306,0.00011465698],"about_ca_topic_score_codex":0.0012636827,"about_ca_topic_score_gemma":0.002451901,"teacher_disagreement_score":0.0056433505,"about_ca_system_score_codex":0.00061357656,"about_ca_system_score_gemma":0.0009737766,"threshold_uncertainty_score":0.018878818},"labels":[],"label_agreement":null},{"id":"W1505714538","doi":"10.1007/978-3-540-31810-1_10","title":"Applying Reduction Techniques to Software Functional Requirement Specifications","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Concordia University","funders":"","keywords":"Program slicing; Computer science; Slicing; Reuse; Functional requirement; Programming language; Non-functional requirement; Software requirements specification; Software engineering; Program comprehension; Software maintenance; Notation; Functional specification; Formal specification; Software development; Reliability engineering; Software; Software system; Software construction","score_opus":0.060229339611306124,"score_gpt":0.2776802005003229,"score_spread":0.21745086088901677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505714538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057116887,0.00017501017,0.9835175,0.00016200666,0.00004155342,0.000086917025,0.00007416562,0.0013088327,0.008922212],"genre_scores_gemma":[0.15562843,0.00071995606,0.8290214,0.00023296931,0.00008353146,0.00027241156,0.00094081933,0.0012940579,0.011806451],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984017,0.00047123633,0.0001132827,0.00013119687,0.0007836726,0.00009893309],"domain_scores_gemma":[0.9971251,0.0019566347,0.00007224323,0.00046158192,0.0003649384,0.000019505105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010967709,0.0008166575,0.000631979,0.0016328138,0.00056075567,0.000897788,0.0013516736,0.00060958293,0.0056188456],"category_scores_gemma":[0.004839743,0.00083949877,0.0020388423,0.0011216865,0.0012968206,0.0015877994,0.0012712816,0.0022533648,0.0015691529],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011770131,0.00015267443,0.0004361687,0.0008108621,0.00009276525,0.00043441373,0.0007221758,0.054986443,0.024353946,0.2797035,0.01227585,0.6259136],"study_design_scores_gemma":[0.00008083422,0.00013737965,0.0006664164,0.0001964224,0.000139818,0.00063017884,0.00023611712,0.3487842,0.036326144,0.558327,0.054398134,0.00007740262],"about_ca_topic_score_codex":0.002947237,"about_ca_topic_score_gemma":0.0038158929,"teacher_disagreement_score":0.0056188456,"about_ca_system_score_codex":0.00064323423,"about_ca_system_score_gemma":0.0007240563,"threshold_uncertainty_score":0.01879692},"labels":[],"label_agreement":null},{"id":"W1505791277","doi":"10.1007/978-3-540-24593-3_14","title":"Semantic Structure Matching for Assessing Web-Service Similarity","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":126,"is_retracted":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":"Computer science; Web service; Information retrieval; World Wide Web; Semantic Web Stack; Semantic similarity; Identifier; WS-Policy; WS-I Basic Profile; Database; Web modeling; Web development; Web intelligence; Web application security; Programming language","score_opus":0.01632344330586022,"score_gpt":0.25894652973637694,"score_spread":0.24262308643051672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505791277","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.17879213,0.00086575316,0.81038696,0.00011255871,0.000089210414,0.000442572,0.0011037142,0.0027779292,0.005429186],"genre_scores_gemma":[0.51775396,0.0003376511,0.4772174,0.00005749472,0.00005614492,0.00027832118,0.002355134,0.00019866887,0.0017452219],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958645,0.00073873607,0.00039359188,0.0004541537,0.0023230691,0.00022605786],"domain_scores_gemma":[0.99614775,0.0017733254,0.0003092413,0.0006074917,0.0010074405,0.00015468473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498361,0.00060485,0.0015627786,0.009103412,0.0009313014,0.0016337896,0.0016575797,0.0018365232,0.0036292989],"category_scores_gemma":[0.009285999,0.00036229723,0.001140652,0.006859791,0.0008017176,0.004066762,0.001572632,0.00072463515,0.0013636831],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018479396,0.0006985357,0.018320087,0.0005996024,0.00040691713,0.0002957256,0.00030943903,0.041718833,0.06822836,0.034196027,0.0044497666,0.8289288],"study_design_scores_gemma":[0.00010645162,0.000410121,0.0085088685,0.00006282815,0.00021705136,0.0008635638,0.0002947192,0.8959589,0.04477618,0.044937283,0.003793019,0.00007097202],"about_ca_topic_score_codex":0.0027654436,"about_ca_topic_score_gemma":0.0025569592,"teacher_disagreement_score":0.009103412,"about_ca_system_score_codex":0.0010252988,"about_ca_system_score_gemma":0.0012225412,"threshold_uncertainty_score":0.01321274},"labels":[],"label_agreement":null},{"id":"W1505826051","doi":"10.1007/11559573_107","title":"Vector Median Root Signals Determination for cDNA Microarray Image Segmentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Computer science; Complementary DNA; Image segmentation; Segmentation; Microarray; Image (mathematics); Computer vision; Noise (video); Biology; Gene expression; Gene; Genetics","score_opus":0.013074498204823275,"score_gpt":0.2746860339033005,"score_spread":0.2616115356984772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505826051","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.009760483,0.00027846423,0.98537594,0.000077680255,0.00003285709,0.00004597064,0.00024015651,0.0026928235,0.0014956257],"genre_scores_gemma":[0.04662179,0.00039992842,0.9474124,0.000037823425,0.000020960873,0.00011630731,0.00064273307,0.0004217726,0.0043263715],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.000060982627,0.00002958262,0.00016777798,0.00024517195,0.000056822006],"domain_scores_gemma":[0.9995419,0.00016481747,0.000045722216,0.000063616404,0.00016590592,0.000018083858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755095,0.00067129766,0.00072877615,0.0014429436,0.00045799496,0.0012212064,0.00093300303,0.00080194796,0.006249214],"category_scores_gemma":[0.0008837125,0.00066009694,0.0005850858,0.0015156586,0.00048195466,0.0008791085,0.0006091578,0.00085365755,0.003645123],"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.00015785023,0.000045790683,0.00035029885,0.00014853114,0.000016611875,0.000030905674,0.00006616529,0.004677661,0.5854943,0.0049619856,0.0021393134,0.4019105],"study_design_scores_gemma":[0.000014617859,0.00011285853,0.00255225,0.00002109926,0.00003475752,0.00021980084,0.00006374488,0.21367696,0.76247406,0.0053413697,0.0154469535,0.000041572097],"about_ca_topic_score_codex":0.0011286492,"about_ca_topic_score_gemma":0.0028059618,"teacher_disagreement_score":0.006249214,"about_ca_system_score_codex":0.00083808124,"about_ca_system_score_gemma":0.0009888272,"threshold_uncertainty_score":0.020905733},"labels":[],"label_agreement":null},{"id":"W1505846363","doi":"10.1007/978-3-540-88961-8_15","title":"Authorship Proof for Textual Document","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Digital watermarking; Scheme (mathematics); Watermark; Natural language; Natural (archaeology); Information retrieval; Theoretical computer science; Natural language processing; Computer security; Artificial intelligence; Image (mathematics); Mathematics","score_opus":0.02296612070772163,"score_gpt":0.26911968995733093,"score_spread":0.2461535692496093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505846363","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008727214,0.002230593,0.46164507,0.026066938,0.02163575,0.000732853,0.00634717,0.0052180756,0.4673964],"genre_scores_gemma":[0.35241953,0.004199235,0.13162713,0.004159134,0.008770547,0.0012512561,0.008819976,0.0040523573,0.48470086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99389243,0.001217496,0.00063722365,0.00133514,0.0023031628,0.0006146053],"domain_scores_gemma":[0.96884537,0.012660641,0.0017040524,0.009096859,0.007112146,0.0005810901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002987707,0.0017315651,0.0015874449,0.0032155148,0.0027598408,0.0065873093,0.0021529263,0.0042477422,0.20939222],"category_scores_gemma":[0.033240687,0.0010633087,0.0014026499,0.0031463276,0.0027233323,0.00943244,0.0053084325,0.004480151,0.08472296],"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.00025929927,0.0001245275,0.00024148532,0.0011740889,0.000051517825,0.0011812684,0.00053211575,0.0012392054,0.0038604594,0.621131,0.24312161,0.12708347],"study_design_scores_gemma":[0.00011944245,0.000060720064,0.00021670929,0.0004989695,0.00006168338,0.0014024348,0.00015248697,0.0052498644,0.008001599,0.60965985,0.37451333,0.000062948406],"about_ca_topic_score_codex":0.00048838335,"about_ca_topic_score_gemma":0.00036711973,"teacher_disagreement_score":0.20939222,"about_ca_system_score_codex":0.0017618245,"about_ca_system_score_gemma":0.0024969452,"threshold_uncertainty_score":0.7004868},"labels":[],"label_agreement":null},{"id":"W1505883827","doi":"10.1007/978-3-642-19861-8_3","title":"Staged Static Techniques to Efficiently Implement Array Copy Semantics in a MATLAB JIT Compiler","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Compiler; MATLAB; Benchmark (surveying); Programming language; Semantics (computer science); Parallel computing; Set (abstract data type); Static analysis","score_opus":0.022546181754094972,"score_gpt":0.27645237116506705,"score_spread":0.2539061894109721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505883827","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.014106629,0.00017048499,0.9419541,0.00015646654,0.00012932488,0.000053689135,0.00021480612,0.034902472,0.008312009],"genre_scores_gemma":[0.21783124,0.00019485185,0.7501758,0.00028455714,0.00008451521,0.00018636229,0.0006804982,0.012961967,0.017600274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994217,0.00007880135,0.000057379966,0.00008401843,0.00027820945,0.00007981384],"domain_scores_gemma":[0.9986939,0.00047627292,0.000088751476,0.00039619184,0.00030598138,0.000038972838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046243693,0.0009927691,0.0005402265,0.00067300326,0.00067463046,0.0011574108,0.0018063423,0.0005936439,0.017316412],"category_scores_gemma":[0.0025990608,0.0009486877,0.000843019,0.0010146145,0.0007041862,0.0020297281,0.0013771141,0.0015160735,0.004389368],"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.0008533683,0.00018516708,0.0022155123,0.00060648646,0.00010520783,0.00048508483,0.0007713015,0.05960046,0.10503898,0.10198611,0.04641321,0.68173903],"study_design_scores_gemma":[0.00025609595,0.0003082268,0.0013381459,0.00014680682,0.00013846075,0.0006304648,0.000127277,0.5915247,0.23215492,0.07825594,0.09498469,0.00013425144],"about_ca_topic_score_codex":0.0021172764,"about_ca_topic_score_gemma":0.005515046,"teacher_disagreement_score":0.017316412,"about_ca_system_score_codex":0.00085563323,"about_ca_system_score_gemma":0.0015113306,"threshold_uncertainty_score":0.05792916},"labels":[],"label_agreement":null},{"id":"W1505895689","doi":"10.1007/978-3-642-14165-2_9","title":"On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Mechanism (biology); Combinatorial auction; Mechanism design; Common value auction; Computer science; Greedy algorithm; Mathematical optimization; Mathematical economics; Business; Microeconomics; Economics; Mathematics; Algorithm; Philosophy; Epistemology","score_opus":0.15223316617206356,"score_gpt":0.33366864243695465,"score_spread":0.1814354762648911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505895689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023247315,0.011825339,0.90566146,0.01593316,0.0007209404,0.00025261164,0.00025293106,0.000621097,0.04148507],"genre_scores_gemma":[0.7307406,0.008782343,0.24331167,0.003804991,0.0015943337,0.0006999895,0.00024356412,0.00039643963,0.0104260985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9718037,0.01925905,0.0009504453,0.001561281,0.005128141,0.0012973577],"domain_scores_gemma":[0.85722977,0.12673782,0.0022769542,0.009433034,0.0033760974,0.00094619556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03765305,0.001726819,0.0033415111,0.0017395208,0.0015506927,0.009567489,0.006121078,0.0066423398,0.008750752],"category_scores_gemma":[0.111223854,0.002059499,0.0018651063,0.0031295947,0.0072943484,0.021415744,0.004418586,0.010330731,0.0015007992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004929179,0.00015162423,0.00047684865,0.00046217977,0.000119680226,0.0000840617,0.0002018698,0.06697227,0.0006582639,0.8446673,0.008783249,0.07692979],"study_design_scores_gemma":[0.00009788539,0.00005858431,0.00007023664,0.00008132284,0.00003393204,0.000066328845,0.00003122456,0.08517666,0.0002592408,0.9118992,0.0022036245,0.000021758524],"about_ca_topic_score_codex":0.00085371174,"about_ca_topic_score_gemma":0.0006596379,"teacher_disagreement_score":0.03765305,"about_ca_system_score_codex":0.0035169406,"about_ca_system_score_gemma":0.0034717626,"threshold_uncertainty_score":0.19913071},"labels":[],"label_agreement":null},{"id":"W1505922856","doi":"10.1007/978-3-540-31988-7_19","title":"Coarse-to-Fine Object Recognition Using Shock Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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 Toronto","funders":"","keywords":"Computer science; Traverse; Artificial intelligence; Adjacency list; Segmentation; Graph; Pattern recognition (psychology); Theoretical computer science; Computer vision; Algorithm","score_opus":0.03624572823462184,"score_gpt":0.27707363563325077,"score_spread":0.24082790739862892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505922856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038922668,0.00021521177,0.9534096,0.00009892828,0.00007827483,0.00006458287,0.00025227072,0.004223136,0.0027352185],"genre_scores_gemma":[0.6306862,0.00061287114,0.35758987,0.00025717038,0.00007550556,0.000071661285,0.0009442233,0.0005707686,0.009191839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986124,0.000013922019,0.0000070802344,0.000041120475,0.000044764038,0.000031893476],"domain_scores_gemma":[0.99966025,0.000093840885,0.000031734715,0.00011066009,0.000064380365,0.000039152324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017338982,0.00093220465,0.00096220063,0.0012700913,0.0003562122,0.00085310993,0.0008578006,0.00092486304,0.0066422326],"category_scores_gemma":[0.00063762744,0.0004990463,0.00076885684,0.0014845295,0.00042419258,0.0014057845,0.001331396,0.00092591316,0.0019355163],"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.00046184097,0.000113511174,0.0013346724,0.00016360532,0.000071671275,0.00024219988,0.000065377964,0.11555151,0.119429804,0.0053907726,0.004369698,0.75280535],"study_design_scores_gemma":[0.000015811338,0.00012642288,0.002130295,0.000012702879,0.000028102024,0.00016484674,0.00006094643,0.9518071,0.029621206,0.013758968,0.0022485203,0.000025043537],"about_ca_topic_score_codex":0.0029963125,"about_ca_topic_score_gemma":0.004707103,"teacher_disagreement_score":0.0066422326,"about_ca_system_score_codex":0.0003461665,"about_ca_system_score_gemma":0.0003842547,"threshold_uncertainty_score":0.022220433},"labels":[],"label_agreement":null},{"id":"W1505953715","doi":"10.1007/978-3-540-74484-9_94","title":"Identification of Fuzzy Set-Based Fuzzy Systems by Means of Data Granulation and Genetic Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Fuzzy set operations; Fuzzy classification; Fuzzy set; Defuzzification; Fuzzy number; Fuzzy logic; Mathematics; Fuzzy clustering; Genetic algorithm; Neuro-fuzzy; Data mining; Mathematical optimization; Membership function; Algorithm; Computer science; Fuzzy control system; Artificial intelligence","score_opus":0.02919831820857533,"score_gpt":0.25365021955669864,"score_spread":0.22445190134812332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505953715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013645056,0.00015366821,0.9852998,0.0000362137,0.000014327762,0.000032152784,0.00001653282,0.00018254975,0.00061959424],"genre_scores_gemma":[0.4994492,0.00021865215,0.49934512,0.000033793192,0.000018569768,0.00017068806,0.000088057044,0.00005511105,0.0006208493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.0000969625,0.000047782978,0.00006890244,0.00016825495,0.00003567286],"domain_scores_gemma":[0.9991334,0.0005066754,0.00010893202,0.00011406063,0.00012352437,0.000013327125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009172798,0.00050931255,0.0015238886,0.00079757045,0.0005184722,0.0012221553,0.0007291058,0.0009555194,0.00066338363],"category_scores_gemma":[0.0026962417,0.00041070703,0.0009743236,0.0009075886,0.000697656,0.0011211748,0.0008634857,0.00069162523,0.00015800144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014013198,0.00005949506,0.00067419023,0.0002328344,0.000084501575,0.00012857969,0.00029105815,0.8084187,0.01665481,0.016635953,0.00050849357,0.15617128],"study_design_scores_gemma":[0.0000066343673,0.000014069556,0.00014277913,0.000009110449,0.000009279324,0.000030290674,0.0000102496315,0.9906098,0.0022108783,0.006692287,0.00025799722,0.0000065703202],"about_ca_topic_score_codex":0.0021979003,"about_ca_topic_score_gemma":0.0015970569,"teacher_disagreement_score":0.0021979003,"about_ca_system_score_codex":0.00048719582,"about_ca_system_score_gemma":0.0006933665,"threshold_uncertainty_score":0.004851103},"labels":[],"label_agreement":null},{"id":"W1505973206","doi":"10.1007/3-540-36492-7_17","title":"White-Box Cryptography and an AES Implementation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crosslight Software (Canada)","funders":"","keywords":"Computer science; AES implementations; Cryptography; White box; Implementation; Encryption; Key (lock); Software implementation; Table (database); Software; Advanced Encryption Standard; Theoretical computer science; Computer security; Programming language; Database; Software engineering","score_opus":0.0171529933463793,"score_gpt":0.2942482527862945,"score_spread":0.2770952594399152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505973206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019812308,0.0023702832,0.81742233,0.0013742477,0.0011413706,0.00014183679,0.000100765035,0.0015738647,0.15606299],"genre_scores_gemma":[0.30380213,0.0041795396,0.38968784,0.0006643194,0.0006066328,0.000235733,0.0003104719,0.000663421,0.29985002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994824,0.00012484631,0.000035023877,0.00006672747,0.00023667591,0.000054388707],"domain_scores_gemma":[0.9996264,0.00012949368,0.000023021306,0.00013936461,0.000070714574,0.000011066894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005277955,0.0010667004,0.00039530394,0.00065354886,0.0006582189,0.0019097932,0.000675509,0.0013307533,0.012427693],"category_scores_gemma":[0.0013645977,0.0005485237,0.00062692305,0.00096325134,0.0009548914,0.0038698434,0.0010468543,0.0017011565,0.0074025095],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014972826,0.000056136378,0.0001002576,0.00011180566,0.000025011988,0.00024983034,0.00013726164,0.0038569476,0.013519008,0.8634443,0.008365816,0.1099838],"study_design_scores_gemma":[0.00008049727,0.00022672786,0.00025815787,0.00014135784,0.00006373137,0.002049445,0.00008208956,0.051481135,0.05268566,0.67720705,0.21566266,0.000061427614],"about_ca_topic_score_codex":0.00010997552,"about_ca_topic_score_gemma":0.00014921818,"teacher_disagreement_score":0.012427693,"about_ca_system_score_codex":0.00032034164,"about_ca_system_score_gemma":0.00038352315,"threshold_uncertainty_score":0.041574776},"labels":[],"label_agreement":null},{"id":"W1505980332","doi":"10.1007/978-3-642-15031-9_6","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":53,"is_retracted":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":"Speedup; Scalar multiplication; Elliptic curve point multiplication; Curve25519; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic Curve Digital Signature Algorithm; Computer science; Elliptic curve; x86; Parallel computing; Tripling-oriented Doche–Icart–Kohel curve; Jacobian matrix and determinant; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Pure mathematics; Operating system","score_opus":0.009903618559944876,"score_gpt":0.23463295834876519,"score_spread":0.22472933978882031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505980332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007143899,0.010965899,0.94039583,0.00065537344,0.0005409498,0.00014240845,0.00014432668,0.0018744544,0.038136955],"genre_scores_gemma":[0.14952974,0.016841775,0.77142376,0.00039767977,0.0012197887,0.00029054668,0.00066871295,0.00084371906,0.058784228],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877006,0.00017436905,0.00006359748,0.00011712324,0.00076037965,0.000114559996],"domain_scores_gemma":[0.9991084,0.0002799851,0.000056030192,0.00035926842,0.0001696043,0.000026767817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006776252,0.0019756868,0.0008773303,0.0022780197,0.0010056237,0.00219198,0.0018295862,0.0010273918,0.018722858],"category_scores_gemma":[0.0022778192,0.0009956942,0.00086784165,0.002936296,0.0009606828,0.006450388,0.00229742,0.0030641828,0.009783252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002753303,0.00014243514,0.00020409604,0.00082754344,0.00008850385,0.00013397039,0.00019674127,0.012317688,0.036064997,0.30476165,0.02565078,0.6193362],"study_design_scores_gemma":[0.00023617849,0.00028548343,0.0005557218,0.00038846154,0.00014612192,0.0015591751,0.0001322863,0.10314746,0.0855607,0.54316866,0.2647031,0.000116687705],"about_ca_topic_score_codex":0.00018615137,"about_ca_topic_score_gemma":0.00038776378,"teacher_disagreement_score":0.018722858,"about_ca_system_score_codex":0.00078606093,"about_ca_system_score_gemma":0.00058633013,"threshold_uncertainty_score":0.06263423},"labels":[],"label_agreement":null},{"id":"W1505990740","doi":"10.1007/978-3-540-30124-0_27","title":"A Third-Order Bounded Arithmetic Theory for PSPACE","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; Mathematical proof; Bounded function; Symbol (formal); Mathematics; Discrete mathematics; Translation (biology); Computer science; Computational complexity theory; Algorithm","score_opus":0.015632170293998476,"score_gpt":0.24897506359028976,"score_spread":0.2333428932962913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505990740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01633469,0.0037401195,0.76412225,0.0043299654,0.00054682855,0.00008375417,0.00058217335,0.0015184481,0.2087418],"genre_scores_gemma":[0.6395244,0.004509956,0.27064663,0.002822124,0.0013868537,0.00047560138,0.001762368,0.00090005825,0.07797204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989858,0.00016942619,0.00006737561,0.00017765266,0.00043679573,0.00016280713],"domain_scores_gemma":[0.9984439,0.00085930695,0.00006530554,0.00034129564,0.00020080217,0.000089375215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294055,0.0011573491,0.0013446106,0.0022448152,0.0023046962,0.0052926936,0.0026943064,0.0016983383,0.011086747],"category_scores_gemma":[0.002595417,0.00091527443,0.0026683332,0.002932476,0.005696606,0.011351516,0.0032017315,0.008969215,0.002812815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099824665,0.000008130888,0.000032030042,0.000030799023,0.0000037484124,0.000015886973,0.000083812854,0.00083381316,0.0001590745,0.99141085,0.0016800374,0.00573175],"study_design_scores_gemma":[0.000006501641,0.0000043777814,0.000035330057,0.000012622153,0.0000055362248,0.000022324928,0.000015654714,0.0021913443,0.00018866296,0.99195766,0.005554651,0.0000053531307],"about_ca_topic_score_codex":0.0036120757,"about_ca_topic_score_gemma":0.0030952427,"teacher_disagreement_score":0.011086747,"about_ca_system_score_codex":0.004392843,"about_ca_system_score_gemma":0.0016283466,"threshold_uncertainty_score":0.03708881},"labels":[],"label_agreement":null},{"id":"W1506001325","doi":"10.1007/978-3-540-45122-8_16","title":"Issues in Scaling Agile Using an Architecture-Centric Approach: A Tool-Based Solution","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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":"Agile software development; Agile Unified Process; Agile usability engineering; Computer science; Architecture; Extreme programming practices; Software engineering; Systems engineering; Lean software development; Software; Process management; Software development; Software development process; Engineering; Operating system","score_opus":0.0340957148777472,"score_gpt":0.27372966789806813,"score_spread":0.23963395302032092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506001325","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.057251845,0.0018945213,0.8768997,0.014737637,0.00033451992,0.000251836,0.000034144923,0.0008775969,0.0477181],"genre_scores_gemma":[0.5447541,0.0017763395,0.44323692,0.0007226288,0.00015979556,0.00030461926,0.00007555871,0.00022808858,0.008741979],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99373734,0.0025849023,0.00035726445,0.00045713302,0.0023248806,0.00053853006],"domain_scores_gemma":[0.98931575,0.005411709,0.0010386049,0.001631917,0.0020407673,0.0005612246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007463013,0.00095062394,0.00060456875,0.0017098768,0.0022059062,0.008276254,0.003136444,0.0042924797,0.0026032424],"category_scores_gemma":[0.012415626,0.00080745434,0.0008202571,0.002797815,0.0025041124,0.00883456,0.0030263024,0.003805705,0.0005160504],"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.000093102135,0.000346674,0.0035675562,0.0006835237,0.00011097287,0.0010558154,0.0051075406,0.035234485,0.00930365,0.38985208,0.0096695535,0.54497504],"study_design_scores_gemma":[0.0001606712,0.0006264233,0.003300501,0.0013451371,0.00030471606,0.0027735971,0.012890157,0.29876387,0.014155581,0.5459967,0.11952415,0.00015853708],"about_ca_topic_score_codex":0.0020134049,"about_ca_topic_score_gemma":0.0034279453,"teacher_disagreement_score":0.008276254,"about_ca_system_score_codex":0.0020639228,"about_ca_system_score_gemma":0.0050390316,"threshold_uncertainty_score":0.039468646},"labels":[],"label_agreement":null},{"id":"W1506020096","doi":"10.1007/978-3-642-15819-3_72","title":"A Neural Approach to Image Thresholding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Thresholding; Computer science; Artificial intelligence; Pattern recognition (psychology); Image segmentation; Artificial neural network; Segmentation; Image (mathematics); Set (abstract data type); Computer vision; Balanced histogram thresholding; Otsu's method; Sample (material); Image processing","score_opus":0.021830107660583433,"score_gpt":0.27921527672487584,"score_spread":0.25738516906429243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506020096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029992175,0.0015051148,0.98766243,0.000153263,0.00013005214,0.00001669093,0.00004471238,0.00040982343,0.00707865],"genre_scores_gemma":[0.16489287,0.0037320165,0.7888213,0.00030978047,0.00041425228,0.0001155626,0.00023044368,0.0003081734,0.041175596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984276,0.000020286046,0.000010671304,0.000041621843,0.00006636648,0.0000181771],"domain_scores_gemma":[0.9997545,0.00010107849,0.000017901064,0.0000324469,0.000083900646,0.000010236907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475818,0.00040609547,0.00063941383,0.000582564,0.00033818829,0.0010794849,0.001617734,0.0012354637,0.004937753],"category_scores_gemma":[0.0010374137,0.00041975334,0.0004832367,0.0011498398,0.00065313233,0.0010333379,0.00074663956,0.0009903956,0.0010182584],"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.000057217192,0.00006104043,0.00029800992,0.00023703929,0.00006479966,0.00011801024,0.00007783415,0.18836747,0.026264155,0.12012596,0.007043771,0.65728474],"study_design_scores_gemma":[0.0000047080625,0.000019570476,0.00030286767,0.000026627447,0.000027194194,0.00012103697,0.000012716583,0.92056996,0.0057110987,0.06653363,0.006654996,0.000015573001],"about_ca_topic_score_codex":0.0034575202,"about_ca_topic_score_gemma":0.0047820867,"teacher_disagreement_score":0.004937753,"about_ca_system_score_codex":0.0004852862,"about_ca_system_score_gemma":0.00042234542,"threshold_uncertainty_score":0.016518354},"labels":[],"label_agreement":null},{"id":"W1506034437","doi":"10.1007/11799313_24","title":"Upper Bounds on Algebraic Immunity of Boolean Power Functions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Combinatorics; Mathematics; Degree (music); Algebraic number; Upper and lower bounds; Inverse; Discrete mathematics; Cipher; Stream cipher; Function (biology); Algorithm; Cryptography; Computer science; Physics","score_opus":0.009893089772609848,"score_gpt":0.21856680517346075,"score_spread":0.2086737154008509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506034437","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.22200534,0.008982959,0.37316763,0.010880541,0.0013701781,0.0002248444,0.001423236,0.001962972,0.37998235],"genre_scores_gemma":[0.92989975,0.005025161,0.036030635,0.0015101759,0.0039201514,0.0003906516,0.0011942054,0.0005265507,0.021502681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949587,0.00090559653,0.00020189138,0.00094796065,0.0017685057,0.0012174471],"domain_scores_gemma":[0.94831055,0.04209805,0.0013517501,0.0035404693,0.0021945506,0.0025046272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052301013,0.0022702343,0.0030340897,0.0059828875,0.0026949188,0.007269013,0.004882956,0.0026284256,0.017788528],"category_scores_gemma":[0.032762982,0.0013470857,0.0022947306,0.0035653284,0.008265678,0.017079113,0.0082715,0.010846611,0.0030595383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033844315,0.00017526346,0.0009052432,0.00026287412,0.000049916172,0.00011378146,0.00036008706,0.0075707096,0.0029822432,0.95732695,0.0064982874,0.023416223],"study_design_scores_gemma":[0.000029911562,0.000054686392,0.00045405433,0.00006489007,0.00005052048,0.00017322508,0.000055415723,0.018860515,0.0014900595,0.9751658,0.0035718973,0.000029077257],"about_ca_topic_score_codex":0.00040324315,"about_ca_topic_score_gemma":0.00050091377,"teacher_disagreement_score":0.017788528,"about_ca_system_score_codex":0.003373956,"about_ca_system_score_gemma":0.0012112252,"threshold_uncertainty_score":0.059508562},"labels":[],"label_agreement":null},{"id":"W1506077366","doi":"10.1007/978-3-540-73451-2_39","title":"Interpreting Low and High Order Rules: A Granular Computing Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Granular computing; Rough set; Decision table; Computer science; Dominance-based rough set approach; Set (abstract data type); Construct (python library); Theoretical computer science; Interpretation (philosophy); Formal concept analysis; Data mining; Artificial intelligence; Algorithm; Programming language","score_opus":0.01563643174786337,"score_gpt":0.23762919991485396,"score_spread":0.2219927681669906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506077366","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.01177899,0.0008301227,0.97980654,0.00050548743,0.000134121,0.00015241778,0.00021474027,0.0004950109,0.0060825692],"genre_scores_gemma":[0.1947548,0.0009445963,0.80073607,0.0002452206,0.00016110051,0.00014579836,0.0005297182,0.00014219823,0.0023405473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937477,0.0014618988,0.0010882725,0.0008388461,0.002411005,0.0004522314],"domain_scores_gemma":[0.99026626,0.0059942594,0.0007707233,0.0017834652,0.00086650084,0.00031878805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006696641,0.0014819108,0.0028312115,0.0044061434,0.0013289093,0.011405299,0.0034189324,0.0020893686,0.0042132307],"category_scores_gemma":[0.021018112,0.0013643457,0.0030427766,0.0053191385,0.0033707987,0.010076398,0.0034121447,0.003573586,0.0007227957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045844505,0.00024272206,0.0025334442,0.0009591132,0.00045409024,0.0016327859,0.0022546654,0.06568257,0.007587778,0.6590384,0.0040296754,0.2551263],"study_design_scores_gemma":[0.0000432332,0.000045576955,0.00056574686,0.00018638906,0.00025260224,0.00023329604,0.00042664105,0.1754706,0.0035850047,0.8129763,0.006150162,0.000064504144],"about_ca_topic_score_codex":0.0036980847,"about_ca_topic_score_gemma":0.0035273668,"teacher_disagreement_score":0.011405299,"about_ca_system_score_codex":0.0012830568,"about_ca_system_score_gemma":0.0016604023,"threshold_uncertainty_score":0.03541565},"labels":[],"label_agreement":null},{"id":"W1506148641","doi":"10.1007/978-3-642-04383-3_4","title":"Challenges for Routing and Search in Dynamic and Self-organizing Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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":"Carleton University","funders":"","keywords":"Computer science; Flooding (psychology); Shortest path problem; Exploit; Routing (electronic design automation); Network topology; Geographic routing; Distributed computing; Routing protocol; Static routing; Computer network; Theoretical computer science","score_opus":0.023172024196758928,"score_gpt":0.269305049185894,"score_spread":0.24613302498913506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506148641","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.032467864,0.15641123,0.5390708,0.16628072,0.004899474,0.00016614873,0.0005200171,0.0006824771,0.09950122],"genre_scores_gemma":[0.6303292,0.12640452,0.18493457,0.006753067,0.011592498,0.0007247682,0.00048923487,0.00033767428,0.03843452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979505,0.00078219647,0.00012292687,0.0002847161,0.00064037665,0.00021936938],"domain_scores_gemma":[0.9896243,0.008037983,0.00034577513,0.0008014805,0.0006841547,0.0005063351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005270526,0.0006517364,0.0017765852,0.0008455962,0.0018618592,0.007841994,0.003233156,0.006004714,0.0056869504],"category_scores_gemma":[0.017508196,0.0008446645,0.0006759308,0.001671818,0.0071274163,0.021033855,0.0032355832,0.0053236512,0.0015757213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039515595,0.000040403906,0.0002373284,0.00038269724,0.000029295456,0.00007524467,0.00032933417,0.024482822,0.00045287554,0.9060242,0.015958993,0.05194734],"study_design_scores_gemma":[0.000012278378,0.000014374316,0.00006763375,0.00006142832,0.00000640805,0.00008742939,0.00026577667,0.029233454,0.000112047,0.9455339,0.024586624,0.000018653995],"about_ca_topic_score_codex":0.0013585298,"about_ca_topic_score_gemma":0.0012435764,"teacher_disagreement_score":0.007841994,"about_ca_system_score_codex":0.0015510641,"about_ca_system_score_gemma":0.0015478699,"threshold_uncertainty_score":0.027873516},"labels":[],"label_agreement":null},{"id":"W1506170695","doi":"10.1007/3-540-45450-0_22","title":"Resolving Conflicts in Authorization Delegations","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Kingswood University","funders":"","keywords":"Authorization; Computer security; Computer science; Business","score_opus":0.03040614192352393,"score_gpt":0.2864339679050676,"score_spread":0.25602782598154367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506170695","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.0677951,0.00096075755,0.891762,0.0015555072,0.00040530183,0.00035541473,0.00014690851,0.0018612928,0.035157673],"genre_scores_gemma":[0.7211449,0.0005172108,0.25530836,0.0003050594,0.00023207285,0.0002083824,0.0003615787,0.0004054042,0.021516865],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99153554,0.0034480146,0.00070801954,0.00066310243,0.0026814742,0.00096376037],"domain_scores_gemma":[0.9752872,0.01733364,0.00096720515,0.004191914,0.0016036157,0.0006164662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008148124,0.0006661634,0.0011738904,0.0010971564,0.0026038736,0.0047263275,0.0020697748,0.001892388,0.0063003115],"category_scores_gemma":[0.03205079,0.001072148,0.0007630108,0.0013666461,0.002387124,0.010232146,0.0048618745,0.004362322,0.0012112592],"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.0011702986,0.00055007,0.0032175463,0.00036014075,0.00012136594,0.0009190624,0.004843156,0.038371474,0.008305767,0.45973054,0.017816238,0.46459442],"study_design_scores_gemma":[0.00011708175,0.00015134332,0.00071786746,0.00010185003,0.000097457174,0.00087671366,0.001277055,0.28399605,0.019037481,0.658884,0.034669504,0.000073619],"about_ca_topic_score_codex":0.001125267,"about_ca_topic_score_gemma":0.0011120299,"teacher_disagreement_score":0.008148124,"about_ca_system_score_codex":0.0010618819,"about_ca_system_score_gemma":0.0012767153,"threshold_uncertainty_score":0.043091893},"labels":[],"label_agreement":null},{"id":"W1506225278","doi":"10.1007/11531371_20","title":"A System of Patterns for Web Navigation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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","funders":"","keywords":"Computer science; Notation; Web application; World Wide Web; Navigation system; Information retrieval; Artificial intelligence","score_opus":0.015662872162584558,"score_gpt":0.24711398488307956,"score_spread":0.231451112720495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506225278","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.00907116,0.0002452167,0.93802255,0.0004649075,0.00016577705,0.00035228918,0.002120687,0.044344284,0.0052131424],"genre_scores_gemma":[0.044928253,0.00030834635,0.94029135,0.00020572035,0.000051476356,0.00042713448,0.0039212964,0.0023693345,0.007497138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977983,0.0004299926,0.00042082992,0.00058685086,0.0006353218,0.00012877099],"domain_scores_gemma":[0.9956285,0.0012137751,0.0002650157,0.0018202722,0.00083838106,0.00023403706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024929931,0.0011082486,0.0011360894,0.0036936898,0.0015982549,0.0034682967,0.0022466956,0.0015806811,0.00988706],"category_scores_gemma":[0.0113615375,0.0011325404,0.0014444359,0.0040281424,0.0011539595,0.008241303,0.004130687,0.0018187974,0.0048011965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048149348,0.00025733415,0.0066938796,0.0004247476,0.00009516943,0.00038402656,0.0013068307,0.004070461,0.006763762,0.122690834,0.053868335,0.8029632],"study_design_scores_gemma":[0.00027097916,0.0003718853,0.0024315782,0.00045955612,0.00032038987,0.0016151658,0.0007957619,0.20869699,0.030741194,0.33861908,0.41547805,0.00019942809],"about_ca_topic_score_codex":0.004896016,"about_ca_topic_score_gemma":0.0059995535,"teacher_disagreement_score":0.00988706,"about_ca_system_score_codex":0.0007528738,"about_ca_system_score_gemma":0.0018627183,"threshold_uncertainty_score":0.03307557},"labels":[],"label_agreement":null},{"id":"W1506281947","doi":"10.1007/3-540-44886-1_66","title":"A Neural Network Based Approach to the Artificial Aging of Facial Images","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Law enforcement; Artificial neural network; Process (computing); Artificial intelligence; Software; Face (sociological concept); Order (exchange); Computer vision; Data science; Law; Social science","score_opus":0.024118134957581867,"score_gpt":0.23932081360888738,"score_spread":0.21520267865130552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506281947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013083692,0.0010420068,0.9816248,0.00017503688,0.00015898398,0.000054777545,0.0000807661,0.0004793512,0.0033006682],"genre_scores_gemma":[0.33206806,0.0018777645,0.64648,0.00019406434,0.0002283847,0.00014240602,0.00024408136,0.00012407306,0.018641168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998872,0.000021537098,0.0000074589675,0.000030996332,0.00003888015,0.0000138927235],"domain_scores_gemma":[0.9998417,0.00006188366,0.0000148228155,0.000016302052,0.00005779827,0.0000075065095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044296545,0.00039566003,0.00043076894,0.000488449,0.000247235,0.00048695417,0.0009025967,0.0006776513,0.0024863167],"category_scores_gemma":[0.000855193,0.00022808918,0.00047836587,0.00054454326,0.0002810235,0.00065941253,0.00053599634,0.0007478519,0.0005174576],"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.00016267678,0.00012546002,0.00093390734,0.00018426364,0.00010838841,0.00017966813,0.00010062632,0.28106293,0.048180167,0.02163971,0.0036023215,0.6437199],"study_design_scores_gemma":[0.000003489438,0.00003298383,0.00040249672,0.000007982347,0.000019177767,0.0000610771,0.000008980273,0.98846126,0.0043835933,0.0053110244,0.0013006695,0.0000073122055],"about_ca_topic_score_codex":0.0044476637,"about_ca_topic_score_gemma":0.00585008,"teacher_disagreement_score":0.0044476637,"about_ca_system_score_codex":0.00045185623,"about_ca_system_score_gemma":0.0003333528,"threshold_uncertainty_score":0.008843541},"labels":[],"label_agreement":null},{"id":"W1506291714","doi":"10.1007/3-540-48035-8_15","title":"Distributed Deadlock Detection in Mobile Agent Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Carleton University","funders":"","keywords":"Computer science; Deadlock; Distributed computing; Deadlock prevention algorithms; Mobile agent; Asynchronous communication; Locality; Fault tolerance; Multi-agent system; Computer network; Artificial intelligence","score_opus":0.014690913300679464,"score_gpt":0.22763569678847612,"score_spread":0.21294478348779666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506291714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028881136,0.0019251015,0.96246374,0.00026647636,0.00015899698,0.00006819774,0.000021736008,0.0015451779,0.0046694726],"genre_scores_gemma":[0.7546381,0.0007617336,0.2374867,0.00011405554,0.00010098922,0.00016084807,0.00008644082,0.00024665028,0.0064045326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850583,0.0005096968,0.00009299147,0.00024259904,0.00046174042,0.00018726302],"domain_scores_gemma":[0.9958982,0.0028869542,0.00018790275,0.00045201654,0.00044017457,0.00013460961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024958076,0.00059380545,0.0012164477,0.0009942274,0.0008173146,0.0017807218,0.0021046414,0.0011046638,0.0016834979],"category_scores_gemma":[0.006584667,0.00075939804,0.00053195923,0.00065114064,0.0012408072,0.002192179,0.0019902096,0.0017310032,0.0003023628],"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.0011218709,0.00026434346,0.0025571263,0.0006201299,0.00017333639,0.00047782864,0.0008953223,0.30450273,0.026659431,0.16817681,0.006645395,0.48790568],"study_design_scores_gemma":[0.00009628202,0.000111521986,0.00032755514,0.000050371804,0.00005772535,0.00018050744,0.00007988761,0.8720934,0.011409892,0.11035913,0.005204528,0.000029203942],"about_ca_topic_score_codex":0.0010640759,"about_ca_topic_score_gemma":0.0010142723,"teacher_disagreement_score":0.0024958076,"about_ca_system_score_codex":0.00084611,"about_ca_system_score_gemma":0.0007782302,"threshold_uncertainty_score":0.01319927},"labels":[],"label_agreement":null},{"id":"W1506362155","doi":"10.1007/978-3-540-77966-7_1","title":"Simulation vs. Formal: Absorb What Is Useful; Reject What Is Useless","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Emulation; Complement (music); Computer science; Formal verification; Formal methods; Software engineering; Programming language; Psychology; Social psychology","score_opus":0.04014947275697075,"score_gpt":0.29640254783774705,"score_spread":0.2562530750807763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506362155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02164476,0.006084934,0.66499275,0.03798565,0.0017682592,0.00009909769,0.00018444801,0.0015333795,0.26570672],"genre_scores_gemma":[0.7967963,0.004159952,0.13669822,0.0051329765,0.0013238442,0.00028321252,0.00023098184,0.0018729516,0.053501535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570966,0.002498435,0.00017111783,0.00039770702,0.0009719118,0.0002511118],"domain_scores_gemma":[0.98384297,0.010944606,0.0007267465,0.0032474494,0.00082581287,0.0004123964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061832014,0.00091422553,0.00094475946,0.0009765984,0.0013275873,0.004902225,0.0012684755,0.0023908175,0.011416241],"category_scores_gemma":[0.018172072,0.00071719,0.0008065366,0.0008817338,0.01623612,0.019986328,0.003903392,0.0041293614,0.0028882653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002591912,0.00001833739,0.00010285279,0.000093250965,0.000009778784,0.0000126425275,0.000589151,0.00068809267,0.00029396932,0.9822234,0.0024270322,0.013515594],"study_design_scores_gemma":[0.000013625396,0.000023466606,0.0000650865,0.00006609299,0.000011305323,0.000049168582,0.00019287711,0.0015626391,0.000541924,0.97696084,0.020502519,0.000010461618],"about_ca_topic_score_codex":0.000646037,"about_ca_topic_score_gemma":0.0009976127,"teacher_disagreement_score":0.011416241,"about_ca_system_score_codex":0.0018480662,"about_ca_system_score_gemma":0.0020125408,"threshold_uncertainty_score":0.03819108},"labels":[],"label_agreement":null},{"id":"W1506478314","doi":"10.1007/978-3-540-85451-7_17","title":"Performance Implications of Cache Affinity on Multicore Processors","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cache; Multi-core processor; Parallel computing; Cache algorithms; Cache pollution; Multiprocessing; Scheduling (production processes); CPU cache; Smart Cache; Cache invalidation; Cache coloring; Process (computing); Operating system","score_opus":0.029688930364759815,"score_gpt":0.26600431462501506,"score_spread":0.23631538426025525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506478314","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.9061267,0.019941755,0.026113965,0.0032066924,0.0008502977,0.000023362447,0.00020057334,0.0010576047,0.04247903],"genre_scores_gemma":[0.9875344,0.0011197065,0.004162407,0.00016683363,0.00014872833,0.000009922917,0.00010069597,0.00012535234,0.006631914],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994234,0.00013328799,0.00002041472,0.000060397306,0.0002042624,0.00015843143],"domain_scores_gemma":[0.9957202,0.0026421952,0.00019956198,0.00040212792,0.00083355344,0.00020244071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006266339,0.0003357508,0.00048666855,0.0004576458,0.000956058,0.0013368852,0.0009358101,0.00082369335,0.008236004],"category_scores_gemma":[0.0052014496,0.00035581648,0.00017211965,0.0015126826,0.00048442226,0.0021892334,0.0006969616,0.0009714452,0.0009386306],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00574986,0.0007900002,0.02242007,0.001646885,0.00025348447,0.0013129793,0.0010048157,0.25049207,0.19276811,0.15212561,0.049240317,0.3221958],"study_design_scores_gemma":[0.00025512135,0.0015231945,0.024229024,0.00015896697,0.00038264212,0.00110908,0.00097009377,0.7105072,0.11639529,0.11983053,0.024512114,0.00012675123],"about_ca_topic_score_codex":0.0016646303,"about_ca_topic_score_gemma":0.0034145245,"teacher_disagreement_score":0.008236004,"about_ca_system_score_codex":0.0008165731,"about_ca_system_score_gemma":0.0006277714,"threshold_uncertainty_score":0.027552128},"labels":[],"label_agreement":null},{"id":"W1506488712","doi":"10.1007/978-3-642-23599-3_2","title":"Intentional Modeling of Social Media Design Knowledge for Government-Citizen Communication","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","field":"Social Sciences","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 Toronto","funders":"","keywords":"Social media; Computer science; Government (linguistics); e-participation; Knowledge management; Data science; Politics; Management science; Political science; World Wide Web; Engineering","score_opus":0.07404708903168651,"score_gpt":0.2964963089098034,"score_spread":0.2224492198781169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506488712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030643644,0.00022763031,0.9340078,0.0013106704,0.000051356386,0.00014071979,0.00037573674,0.00037893746,0.03286345],"genre_scores_gemma":[0.73060465,0.00033520613,0.25980222,0.00015897384,0.000047172765,0.00034363722,0.0009694462,0.00017031153,0.007568351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781597,0.0012208269,0.00014745776,0.00028597977,0.00036354866,0.0001662033],"domain_scores_gemma":[0.99359655,0.0046299924,0.00029829604,0.0008659531,0.0004383029,0.00017095347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023291227,0.0006345662,0.00042950278,0.002143497,0.0013419043,0.004573762,0.0014767422,0.0014162706,0.00710223],"category_scores_gemma":[0.011115642,0.00070563046,0.0017002044,0.0014931501,0.0021694708,0.006756033,0.0031439343,0.0017128771,0.0006779546],"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.0000512134,0.0001034696,0.0015176866,0.00014628671,0.00005382696,0.00017344365,0.00220434,0.046866916,0.0009015924,0.9133775,0.0019466837,0.032657154],"study_design_scores_gemma":[0.000017841172,0.000022408445,0.00041923262,0.00009029682,0.00006221939,0.00007960842,0.00073340087,0.37064496,0.001245005,0.61283237,0.013832443,0.000020234094],"about_ca_topic_score_codex":0.007977143,"about_ca_topic_score_gemma":0.012255796,"teacher_disagreement_score":0.007977143,"about_ca_system_score_codex":0.0021039175,"about_ca_system_score_gemma":0.0018491201,"threshold_uncertainty_score":0.023759305},"labels":[],"label_agreement":null},{"id":"W1506516332","doi":"10.1007/978-3-540-73351-5_22","title":"Combining Vector Space Model and Multi Word Term Extraction for Semantic Query Expansion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Ranking (information retrieval); Computer science; Vector space model; Margin (machine learning); Artificial intelligence; Semantic similarity; Term (time); Word (group theory); Natural language processing; Cluster analysis; Similarity (geometry); Space (punctuation); Vector space; Information retrieval; Machine learning; Mathematics","score_opus":0.03547433304624778,"score_gpt":0.3152286062239996,"score_spread":0.2797542731777518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506516332","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.0141663775,0.002089459,0.97533196,0.0002752573,0.00015525053,0.00015568701,0.0008989827,0.005822051,0.0011048801],"genre_scores_gemma":[0.191905,0.0022545394,0.7927894,0.00031889515,0.00032030072,0.0004146193,0.0064294157,0.0008066501,0.0047611697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979977,0.0005608291,0.00023292821,0.0004274407,0.0006356506,0.00014542454],"domain_scores_gemma":[0.998092,0.0009552284,0.000080656995,0.00025213644,0.0005762929,0.00004363785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017942156,0.0014813042,0.0024631443,0.005132548,0.00063675473,0.0017418425,0.0014083278,0.0011510716,0.0039755465],"category_scores_gemma":[0.004086909,0.00056439626,0.0018866712,0.0069050775,0.00052935863,0.0057447394,0.0015044312,0.001476123,0.0032603475],"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.0005787929,0.00035859665,0.0011501124,0.0006112618,0.00027514333,0.00018125714,0.00019677641,0.033131152,0.036612265,0.01155797,0.017147569,0.8981991],"study_design_scores_gemma":[0.00007253924,0.00013520062,0.00069649226,0.000031971413,0.00016899013,0.00024718474,0.000104774655,0.9563053,0.014714266,0.020594772,0.006861108,0.00006745756],"about_ca_topic_score_codex":0.007398649,"about_ca_topic_score_gemma":0.0077905073,"teacher_disagreement_score":0.007398649,"about_ca_system_score_codex":0.0007374036,"about_ca_system_score_gemma":0.0014008338,"threshold_uncertainty_score":0.014711142},"labels":[],"label_agreement":null},{"id":"W1506566150","doi":"10.1007/3-540-45517-5_95","title":"GAs and Financial Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Technical analysis; Computer science; Stock (firearms); Genetic algorithm; Operations research; Finance; Machine learning; Business; History; Mathematics","score_opus":0.06707584802368283,"score_gpt":0.3550073341217867,"score_spread":0.2879314860981039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506566150","genre_codex":"review","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.010103238,0.40307665,0.23029211,0.014912108,0.0065608546,0.00007688528,0.0006043428,0.0014245912,0.33294922],"genre_scores_gemma":[0.28780246,0.19811092,0.08827634,0.0030696562,0.008357315,0.0002491198,0.0008165859,0.0006783966,0.41263926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998704,0.000035559584,0.0000046371388,0.000023668144,0.00005511559,0.000010647934],"domain_scores_gemma":[0.99985385,0.000077448014,0.000009865989,0.00002343949,0.000025850386,0.000009533707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028366476,0.0009189087,0.00094594207,0.0012128287,0.00031829314,0.0012060078,0.00053671544,0.0011568873,0.009077155],"category_scores_gemma":[0.0006361936,0.0003057766,0.00038104627,0.0014455905,0.0012780013,0.0017838147,0.00082531373,0.0016690689,0.0031366216],"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.000023577802,0.00003109908,0.00034729135,0.00043282364,0.00004062666,0.00014200844,0.00010964419,0.018588921,0.0018867925,0.72111076,0.07830108,0.17898536],"study_design_scores_gemma":[0.000008463784,0.00002479,0.00035281698,0.00018413489,0.000016752669,0.00017330697,0.00004504169,0.028409451,0.00093761977,0.7066045,0.26322556,0.000017572374],"about_ca_topic_score_codex":0.0010633209,"about_ca_topic_score_gemma":0.001058159,"teacher_disagreement_score":0.009077155,"about_ca_system_score_codex":0.00058836903,"about_ca_system_score_gemma":0.00036737166,"threshold_uncertainty_score":0.030366123},"labels":[],"label_agreement":null},{"id":"W1506617345","doi":"10.1007/11908029_49","title":"Methodological Identification of Information Granules-Based Fuzzy Systems by Means of Genetic Optimization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Computer science; Genetic algorithm; Identification (biology); Fuzzy logic; Neuro-fuzzy; Cluster analysis; Data mining; Fuzzy classification; Fuzzy set operations; Defuzzification; Fuzzy clustering; Fuzzy control system; Fuzzy set; Mathematical optimization; Artificial intelligence; Fuzzy number; Machine learning; Mathematics","score_opus":0.026565154847194163,"score_gpt":0.2470715824336338,"score_spread":0.22050642758643965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506617345","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.0062445495,0.00019539917,0.9921302,0.000061074825,0.000014500524,0.000033451848,0.000016991611,0.000030753985,0.0012730646],"genre_scores_gemma":[0.5168704,0.000568183,0.4810549,0.000035760208,0.00003735869,0.00025129755,0.00009279448,0.000040305677,0.0010490998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949753,0.00021305373,0.000045160563,0.00008280878,0.00012590409,0.000035480345],"domain_scores_gemma":[0.999278,0.00042548194,0.00008076716,0.000076339835,0.00012206787,0.000017289658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016485694,0.00061851024,0.0009869311,0.000925325,0.00048335904,0.0018322339,0.0012821864,0.00089356565,0.0010925021],"category_scores_gemma":[0.0033698126,0.00040242213,0.0011030083,0.0009010951,0.0012994664,0.0014185342,0.0012305012,0.0009090967,0.00014034087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072111936,0.000039381095,0.00067426724,0.00030315516,0.00014598959,0.00014743138,0.00034203587,0.6536947,0.004471782,0.3003818,0.00043624092,0.0392912],"study_design_scores_gemma":[0.000011512773,0.00002264099,0.00019690249,0.00002922586,0.000023030476,0.00003232861,0.00004446155,0.8957873,0.000983295,0.102181345,0.0006764852,0.0000114692675],"about_ca_topic_score_codex":0.0017436094,"about_ca_topic_score_gemma":0.001171684,"teacher_disagreement_score":0.0018322339,"about_ca_system_score_codex":0.0007585435,"about_ca_system_score_gemma":0.0009441889,"threshold_uncertainty_score":0.00871861},"labels":[],"label_agreement":null},{"id":"W1506644491","doi":"10.1007/978-3-540-30136-3_96","title":"Simulation of the Electromechanical Activity of the Heart Using XMR Interventional Imaging","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"St. Thomas Hospital","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence; Medical physics; Medicine","score_opus":0.02802857391664791,"score_gpt":0.3366380414572777,"score_spread":0.3086094675406298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506644491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13816717,0.00063470454,0.8216865,0.00050931796,0.00017117201,0.000137125,0.00060728006,0.0029074373,0.035179306],"genre_scores_gemma":[0.8493047,0.0005285636,0.13521548,0.00015858262,0.00005834073,0.00017884554,0.0003560225,0.00030380467,0.013895722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991167,0.000029031144,0.000005112464,0.0000133577205,0.000030594732,0.000010144994],"domain_scores_gemma":[0.9997025,0.0001998014,0.00003186191,0.000022954437,0.000027327524,0.000015626048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022108773,0.00043792324,0.00044328754,0.0002206558,0.00020160552,0.0006186942,0.0008277123,0.0011358589,0.004991076],"category_scores_gemma":[0.0007245178,0.00030611875,0.00046280734,0.00017947525,0.00031053944,0.000378502,0.0004421245,0.00033214258,0.0006028739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000621522,0.000029122513,0.00055974605,0.000067413355,0.000018044286,0.00022899575,0.00006924916,0.97881603,0.006659335,0.003212338,0.00063643546,0.00964117],"study_design_scores_gemma":[0.000011826423,0.000027139919,0.0002252427,0.0000063025427,0.0000051939705,0.00008930454,0.000009015742,0.99659795,0.0013620278,0.00075909874,0.0009005344,0.0000063399066],"about_ca_topic_score_codex":0.0014670513,"about_ca_topic_score_gemma":0.00097059633,"teacher_disagreement_score":0.004991076,"about_ca_system_score_codex":0.00021522996,"about_ca_system_score_gemma":0.0002938798,"threshold_uncertainty_score":0.01669681},"labels":[],"label_agreement":null},{"id":"W1506687179","doi":"10.1007/3-540-45005-x_28","title":"Circular Words Avoiding Patterns","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg","funders":"","keywords":"Computer science; Cube (algebra); Binary number; Algorithm; Arithmetic; Combinatorics; Mathematics","score_opus":0.014616099937376179,"score_gpt":0.22725970504435922,"score_spread":0.21264360510698305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506687179","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12278992,0.0013831555,0.17465042,0.0013560678,0.000916352,0.00014586208,0.0005087855,0.0010294651,0.69722],"genre_scores_gemma":[0.5761907,0.0013659908,0.05747222,0.0005785721,0.00040758672,0.00022955131,0.0010237827,0.0007236067,0.36200795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999624,0.000049828202,0.00002938146,0.000108752414,0.00011737675,0.000070604896],"domain_scores_gemma":[0.99937683,0.00016845891,0.00005635525,0.000192799,0.00014040654,0.000065128486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268244,0.00044355847,0.00049418525,0.0010015717,0.0015538225,0.0021320519,0.00061513524,0.0007754652,0.01790317],"category_scores_gemma":[0.0015018772,0.0004312371,0.00047132955,0.0013734401,0.0015164554,0.0034616152,0.0019573877,0.0012633326,0.0055424743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004032214,0.00001259901,0.000117933945,0.000051037816,0.0000043649275,0.00010087695,0.00036604787,0.00022582298,0.0021006395,0.96275926,0.005386079,0.028834948],"study_design_scores_gemma":[0.00000937947,0.000020012205,0.00012148758,0.000017709604,0.000008507321,0.00034626946,0.00016169953,0.0010506758,0.0020578348,0.945461,0.050736878,0.000008486577],"about_ca_topic_score_codex":0.00036339933,"about_ca_topic_score_gemma":0.00040910387,"teacher_disagreement_score":0.01790317,"about_ca_system_score_codex":0.00054925063,"about_ca_system_score_gemma":0.00046153393,"threshold_uncertainty_score":0.059892118},"labels":[],"label_agreement":null},{"id":"W150669400","doi":"10.1007/978-3-642-39094-4_67","title":"Reconstruction of HARDI Data Using a Split Bregman Optimization Approach","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Diffusion MRI; Noise (video); Artificial intelligence; SIGNAL (programming language); Noise reduction; Diffusion imaging; Algorithm; Signal reconstruction; Exploit; Signal-to-noise ratio (imaging); Pattern recognition (psychology); Computer vision; Signal processing; Image (mathematics); Magnetic resonance imaging","score_opus":0.11902295309021613,"score_gpt":0.3356993330657442,"score_spread":0.21667637997552805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150669400","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.0016902385,0.00007993397,0.99651694,0.00017619896,0.000021754751,0.000023115777,0.00008038576,0.00025748526,0.0011539683],"genre_scores_gemma":[0.03297995,0.00022987643,0.96242017,0.00018147577,0.000036567824,0.00011931803,0.00045756032,0.00044098424,0.0031341973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946445,0.00017076076,0.00003680177,0.0000690107,0.00021569803,0.00004333634],"domain_scores_gemma":[0.99899405,0.00042632394,0.000097637625,0.00021754166,0.00018779715,0.000076601216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017447461,0.0012006407,0.0014912417,0.0012742766,0.0006464553,0.0024528948,0.00172604,0.0022359386,0.004702988],"category_scores_gemma":[0.004581808,0.0012372985,0.0012736134,0.0018678362,0.0011499039,0.00201493,0.0031319582,0.0031681287,0.002296252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002593186,0.00010279839,0.0006683407,0.00048135148,0.00016943691,0.00031522615,0.00027988147,0.6340158,0.020521665,0.121185444,0.009979672,0.21202107],"study_design_scores_gemma":[0.000007996565,0.000014577231,0.00007669535,0.000016869872,0.0000065143745,0.00010412796,0.000018190996,0.9778151,0.0025874428,0.017245762,0.0020881179,0.000018576231],"about_ca_topic_score_codex":0.0017150898,"about_ca_topic_score_gemma":0.0019936326,"teacher_disagreement_score":0.004702988,"about_ca_system_score_codex":0.0006170683,"about_ca_system_score_gemma":0.0015329213,"threshold_uncertainty_score":0.015733063},"labels":[],"label_agreement":null},{"id":"W1506695012","doi":"10.1007/3-540-45415-2_10","title":"CBR-Responder, an Automated Customer Service for E-Commerce","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Service (business); Customer service; Case-based reasoning; The Internet; Product (mathematics); Artificial intelligence; World Wide Web; Marketing; Business","score_opus":0.051691792729219734,"score_gpt":0.3291205663136178,"score_spread":0.27742877358439805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506695012","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.080899574,0.002728134,0.5383791,0.003449265,0.0014446058,0.0019803469,0.005132224,0.2504961,0.115490705],"genre_scores_gemma":[0.259492,0.0019965814,0.5137558,0.002710065,0.0004191023,0.00035876653,0.009036889,0.0052892636,0.20694163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994148,0.00012892083,0.000032893895,0.00009581039,0.000271711,0.00005588496],"domain_scores_gemma":[0.9995214,0.00015506537,0.000022785016,0.00010190415,0.00013557807,0.00006333308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081774074,0.0009535385,0.0009574608,0.0013609093,0.0007413663,0.0017835466,0.0021866632,0.0017024988,0.02785756],"category_scores_gemma":[0.0023129573,0.0005783513,0.0004950334,0.0012807613,0.00038227518,0.0016812714,0.00084564625,0.0011701721,0.01185854],"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.0015623452,0.00090767234,0.0013608154,0.0005104355,0.000115399685,0.00071686273,0.00030291485,0.008951623,0.03270074,0.01118474,0.21674241,0.72494406],"study_design_scores_gemma":[0.0016959698,0.0013894342,0.005519756,0.00017408954,0.00047202597,0.0036496567,0.00049341813,0.5085082,0.09176378,0.019051423,0.3669988,0.0002834554],"about_ca_topic_score_codex":0.007385222,"about_ca_topic_score_gemma":0.009355147,"teacher_disagreement_score":0.02785756,"about_ca_system_score_codex":0.0006842806,"about_ca_system_score_gemma":0.0012671123,"threshold_uncertainty_score":0.093192875},"labels":[],"label_agreement":null},{"id":"W1506724813","doi":"10.1007/978-3-540-24685-5_73","title":"Towards a Grid-Aware Computer Algebra System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Western University","funders":"","keywords":"Computer science; Grid; Maple; Symbolic computation; Grid computing; Software; Connection (principal bundle); Computational science; Theoretical computer science; Programming language; Mathematics","score_opus":0.01495121624099022,"score_gpt":0.23149916745302568,"score_spread":0.21654795121203546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506724813","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.0135419145,0.00019196658,0.9492783,0.0006143422,0.00019520803,0.00017508985,0.0003578816,0.025585819,0.0100593995],"genre_scores_gemma":[0.1330108,0.00029514232,0.8498762,0.00045435116,0.00015375346,0.00022279275,0.0014243616,0.0016703228,0.012892263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992449,0.00019115486,0.00007204315,0.00013918422,0.00027498906,0.00007762335],"domain_scores_gemma":[0.99858224,0.00019404411,0.00004274193,0.00078517373,0.00026328836,0.0001325452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011169295,0.00033925782,0.0007833406,0.00069547136,0.0012305775,0.0027302385,0.003105025,0.0007606884,0.009791154],"category_scores_gemma":[0.0025678913,0.0006285063,0.00091941794,0.0013552068,0.0008759167,0.0037864286,0.0040447623,0.0018515765,0.0044686133],"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.0009393756,0.00061392854,0.0037800418,0.00048741951,0.0002088481,0.00036197872,0.0008038669,0.059070256,0.025072765,0.4166704,0.08091498,0.4110761],"study_design_scores_gemma":[0.00020449719,0.00012763152,0.00062523404,0.000051425326,0.00012199224,0.00025185943,0.0001949001,0.5228909,0.024720145,0.29118675,0.1595676,0.000056969675],"about_ca_topic_score_codex":0.0026151189,"about_ca_topic_score_gemma":0.0039709,"teacher_disagreement_score":0.009791154,"about_ca_system_score_codex":0.00072987186,"about_ca_system_score_gemma":0.0016373432,"threshold_uncertainty_score":0.03275472},"labels":[],"label_agreement":null},{"id":"W1506756806","doi":"10.1007/978-3-540-74260-9_13","title":"New Computational Methods for the Construction of “Darcyan” Biological Coordinate Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematical Biology Tumor Growth","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Curvilinear coordinates; Coordinate system; Computer science; Boundary (topology); Grid; Set (abstract data type); Poisson's equation; Coordinate descent; Coordinate space; Algorithm; Spherical coordinate system; Geometry; Computer vision; Mathematics; Mathematical analysis","score_opus":0.09440395648852863,"score_gpt":0.3802328805115687,"score_spread":0.2858289240230401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506756806","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.00088728516,0.00013028785,0.9971547,0.00007727033,0.00007544496,0.000020477411,0.000041480584,0.0001426448,0.001470402],"genre_scores_gemma":[0.020158218,0.00029624582,0.9758873,0.000074204625,0.000088812834,0.00021473684,0.00020544435,0.00025882624,0.0028162738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990262,0.00040523265,0.00006373468,0.00015464469,0.00030938777,0.000040776897],"domain_scores_gemma":[0.9983552,0.0007651792,0.000115505456,0.0002699404,0.0004000056,0.00009412745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187619,0.0012396106,0.0013501014,0.0020895149,0.0010986453,0.0026147955,0.0029099334,0.0011453863,0.0075422423],"category_scores_gemma":[0.005785115,0.0009590216,0.0015241287,0.0019396971,0.0020306488,0.0025372356,0.0034867728,0.0035427844,0.0021556662],"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.000027505412,0.000023804403,0.00022330871,0.0001553067,0.000029157369,0.00005116487,0.00016844449,0.05623393,0.0018481342,0.8547122,0.0063513443,0.08017566],"study_design_scores_gemma":[0.000030592826,0.000022803188,0.00007909638,0.000033510907,0.000012147371,0.00008142774,0.000040160317,0.6005378,0.0012470022,0.37484264,0.02304269,0.000030228077],"about_ca_topic_score_codex":0.002306986,"about_ca_topic_score_gemma":0.0031630802,"teacher_disagreement_score":0.0075422423,"about_ca_system_score_codex":0.001340787,"about_ca_system_score_gemma":0.0012702516,"threshold_uncertainty_score":0.025231361},"labels":[],"label_agreement":null},{"id":"W150676218","doi":"10.1007/978-3-642-35722-0_4","title":"Assignment Calculus: A Pure Imperative Language","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"McMaster University","funders":"","keywords":"Computer science; Programming language; Semantics (computer science); Operational semantics; Functional programming; Rewriting","score_opus":0.014358794848787566,"score_gpt":0.24554600311511765,"score_spread":0.23118720826633007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150676218","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.0035209847,0.0033127211,0.91986835,0.0014255889,0.0011979627,0.00008018551,0.00037385835,0.004032035,0.066188395],"genre_scores_gemma":[0.19154194,0.009595436,0.54012984,0.0024274508,0.0030822926,0.0004922515,0.0010385792,0.0037612102,0.247931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999405,0.00011734365,0.000039274248,0.000118941054,0.00024580865,0.00007355058],"domain_scores_gemma":[0.9995522,0.00016524317,0.000031519496,0.000073342715,0.000121199926,0.000056464243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097545225,0.0008899447,0.0005617997,0.0009626238,0.0014490872,0.003953041,0.0019803434,0.00087407243,0.010923342],"category_scores_gemma":[0.0019333757,0.00074459106,0.0006318453,0.0012734055,0.0026097815,0.005307249,0.0021123616,0.003023583,0.0054135094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003004035,0.000035533838,0.00006366605,0.00019011958,0.0000089160085,0.00006040118,0.0003446563,0.0008952749,0.002403251,0.90008676,0.02512006,0.07076131],"study_design_scores_gemma":[0.00002622152,0.000028962442,0.0001353574,0.00008861577,0.00003338224,0.0002501186,0.00006998622,0.005812371,0.0029794083,0.6885496,0.30198923,0.000036670946],"about_ca_topic_score_codex":0.0009357071,"about_ca_topic_score_gemma":0.001029666,"teacher_disagreement_score":0.010923342,"about_ca_system_score_codex":0.0005377682,"about_ca_system_score_gemma":0.0020426898,"threshold_uncertainty_score":0.036542237},"labels":[],"label_agreement":null},{"id":"W1506780882","doi":"10.1007/3-540-39205-x_115","title":"Critical Remarks on the Maximal Prime Decomposition of Bayesian Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Bayesian network; Prime (order theory); Decomposition; Bayesian probability; Computer science; Markov chain; Mathematics; Artificial intelligence; Machine learning; Combinatorics; Biology; Ecology","score_opus":0.02388843557096108,"score_gpt":0.28758087545356403,"score_spread":0.26369243988260294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506780882","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.022597563,0.0066286665,0.6541222,0.09318106,0.002888775,0.00009150421,0.00088591885,0.0004432442,0.21916111],"genre_scores_gemma":[0.7054837,0.00887992,0.17734168,0.02691906,0.016959636,0.0006099681,0.00090210565,0.00074479275,0.062159188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651766,0.0019158835,0.00013007056,0.00061073876,0.00061026803,0.0002153342],"domain_scores_gemma":[0.9750758,0.020049691,0.000792588,0.0016876549,0.0017504231,0.0006438734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008557934,0.0011598014,0.0014330285,0.001908275,0.0028935669,0.0045528645,0.0021068368,0.0032511994,0.02091521],"category_scores_gemma":[0.03435758,0.0009854697,0.0015983286,0.0025146692,0.008822798,0.0126010645,0.003071837,0.009507207,0.0022134979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010003568,0.000002684056,0.000024986164,0.000016424783,0.0000035087571,0.000013099752,0.00004115066,0.00045504535,0.000021852238,0.99395186,0.003929017,0.0015302612],"study_design_scores_gemma":[0.000004288228,0.0000012132473,0.000016802132,0.0000053298486,0.0000016084491,0.00000950122,0.0000073215638,0.0005076837,0.000013979854,0.9975078,0.0019225619,0.0000019326367],"about_ca_topic_score_codex":0.0015943318,"about_ca_topic_score_gemma":0.0010632591,"teacher_disagreement_score":0.02091521,"about_ca_system_score_codex":0.002918288,"about_ca_system_score_gemma":0.001196917,"threshold_uncertainty_score":0.06996834},"labels":[],"label_agreement":null},{"id":"W1506893951","doi":"10.1007/978-3-642-13437-1_57","title":"ITS in Ill-Defined Domains: Toward Hybrid Approaches","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke; Université du Québec à Montréal","funders":"","keywords":"Computer science; Tracing; Domain (mathematical analysis); Artificial intelligence; Face (sociological concept); Hybrid system; Human–computer interaction; Software engineering; Machine learning; Data science; Programming language","score_opus":0.04362667273237257,"score_gpt":0.23868960892961885,"score_spread":0.1950629361972463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506893951","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.0061936853,0.00093045284,0.9842911,0.00022284425,0.00007234459,0.000018397543,0.000037898175,0.00013367576,0.008099564],"genre_scores_gemma":[0.44014147,0.0026113377,0.54167974,0.00024626392,0.00047131,0.00013236146,0.00028639403,0.00022056815,0.014210579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987219,0.0005244033,0.00011349554,0.00021166523,0.00031928843,0.00010922402],"domain_scores_gemma":[0.9962406,0.0020900345,0.00019555038,0.00068160676,0.0005744729,0.00021769854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019688595,0.00075390004,0.0013074141,0.0013530087,0.0006256227,0.003971549,0.0021754536,0.0015558995,0.0038891437],"category_scores_gemma":[0.004699177,0.00041550508,0.0010524077,0.001826708,0.001984145,0.0062635327,0.004454256,0.0020476952,0.00071511895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011705426,0.00008696147,0.0011136068,0.00034763393,0.000102659804,0.00012950499,0.00039291044,0.12446426,0.0021534574,0.7406851,0.002240331,0.12816644],"study_design_scores_gemma":[0.000012366849,0.00004760201,0.00019969403,0.00006870626,0.000039739414,0.000085890766,0.00023315303,0.5298981,0.0013811719,0.4573471,0.010666396,0.000020024467],"about_ca_topic_score_codex":0.0013227118,"about_ca_topic_score_gemma":0.0018224899,"teacher_disagreement_score":0.003971549,"about_ca_system_score_codex":0.000718811,"about_ca_system_score_gemma":0.00080280425,"threshold_uncertainty_score":0.013010502},"labels":[],"label_agreement":null},{"id":"W1506904746","doi":"10.1007/978-3-540-27868-9_77","title":"Control of Sparseness for Feature Selection","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"National Research Council Canada; National Research Council Institute for Biodiagnostics","funders":"","keywords":"Curse of dimensionality; Feature selection; Pattern recognition (psychology); Linear discriminant analysis; Decision boundary; Mathematics; Linear programming; Artificial intelligence; Feature vector; Norm (philosophy); Function (biology); Feature (linguistics); Minification; Boundary (topology); Mathematical optimization; Computer science; Support vector machine","score_opus":0.014520397970377111,"score_gpt":0.23944741615161155,"score_spread":0.22492701818123445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506904746","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.004784955,0.00013429557,0.99392164,0.00004892899,0.000021827893,0.000011564417,0.000021455286,0.0001481385,0.0009072843],"genre_scores_gemma":[0.48174745,0.0005597571,0.5093443,0.00016521018,0.00019736878,0.0001684775,0.00025389617,0.0002733455,0.007290201],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996543,0.000080790254,0.000017007422,0.0000876454,0.00012066585,0.00003948326],"domain_scores_gemma":[0.9987513,0.0007510784,0.00009696008,0.0001518861,0.0002053996,0.00004341901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062617305,0.00053760293,0.00058588467,0.00037689254,0.00023963225,0.0005993405,0.00071119476,0.00045540405,0.0028463872],"category_scores_gemma":[0.0037252852,0.00026227834,0.0002653497,0.0006042997,0.0005800212,0.0008073397,0.0007915323,0.00086784083,0.00044176637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035109324,0.00017082473,0.00044994178,0.00020758176,0.000056978326,0.000060004884,0.00009277417,0.26072884,0.11961603,0.06761315,0.0065290728,0.5441237],"study_design_scores_gemma":[0.000018901132,0.00005643794,0.00017925493,0.00000719013,0.0000075511393,0.000038071565,0.0000057347897,0.9761355,0.010685233,0.011427289,0.0014306627,0.000008122759],"about_ca_topic_score_codex":0.0011956465,"about_ca_topic_score_gemma":0.002034147,"teacher_disagreement_score":0.0028463872,"about_ca_system_score_codex":0.00032068847,"about_ca_system_score_gemma":0.00033489708,"threshold_uncertainty_score":0.00952214},"labels":[],"label_agreement":null},{"id":"W1506928870","doi":"10.1007/978-3-642-31638-8_36","title":"Enhancing TCP Congestion Control for Improved Performance in Wireless Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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":"Norleaf Networks (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"TCP Westwood plus; TCP Friendly Rate Control; Computer science; Computer network; TCP tuning; TCP global synchronization; TCP acceleration; Network congestion; CUBIC TCP; Transmission Control Protocol; H-TCP; Zeta-TCP; HSTCP; Packet loss; Compound TCP; Network packet; Real-time computing","score_opus":0.008678545351211731,"score_gpt":0.21177070811321128,"score_spread":0.20309216276199954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506928870","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.06759035,0.017532952,0.86673117,0.00089009793,0.00112196,0.00008416378,0.00009015456,0.0030543152,0.042904783],"genre_scores_gemma":[0.8866216,0.007447015,0.08733699,0.00025681948,0.000974419,0.000059574864,0.00007921464,0.00037610342,0.016848322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977,0.00004122855,0.000011148064,0.000033091885,0.00010302681,0.00004158148],"domain_scores_gemma":[0.9995173,0.00023094623,0.000033998003,0.00006642731,0.00012860775,0.000022773105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004822219,0.00081977155,0.00042648995,0.0004771552,0.00027326873,0.0010669739,0.000913525,0.00054234365,0.003963789],"category_scores_gemma":[0.0015242645,0.00029089127,0.0002461357,0.0006052981,0.00037712185,0.001350625,0.00061257737,0.0010144148,0.00063080597],"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.00025777388,0.00027330927,0.0006531884,0.00047445027,0.00008186308,0.00017538699,0.00015402146,0.16811663,0.16300689,0.057067517,0.009297369,0.60044163],"study_design_scores_gemma":[0.000046184916,0.00029651332,0.0008167632,0.00008747998,0.00018674093,0.0003034616,0.00003243211,0.8494708,0.08206697,0.03251072,0.034134507,0.00004750515],"about_ca_topic_score_codex":0.0005888206,"about_ca_topic_score_gemma":0.0007338564,"teacher_disagreement_score":0.003963789,"about_ca_system_score_codex":0.0005048453,"about_ca_system_score_gemma":0.000280474,"threshold_uncertainty_score":0.013260245},"labels":[],"label_agreement":null},{"id":"W1506977119","doi":"10.1007/978-3-642-02611-9_6","title":"Multifocus Image Fusion Using Local Phase Coherence Measurement","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Image fusion; Phase congruency; Coherence (philosophical gambling strategy); Computer vision; Contrast (vision); Fusion; Image (mathematics); Wavelet; Wavelet transform; Pattern recognition (psychology); Energy (signal processing); Mathematics","score_opus":0.02474515005688925,"score_gpt":0.27239849627769697,"score_spread":0.2476533462208077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506977119","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.006724145,0.0010895976,0.9877894,0.00010374573,0.000058988084,0.000029811345,0.00006799959,0.00050571933,0.0036306034],"genre_scores_gemma":[0.14332452,0.0019157247,0.84708285,0.0001524461,0.0001109125,0.000075949814,0.0003590458,0.0001948241,0.006783726],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968076,0.000035693352,0.00001532744,0.000054661603,0.00019367045,0.000019857744],"domain_scores_gemma":[0.9997305,0.00009286051,0.0000350668,0.00005900164,0.00007258732,0.0000099679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039261644,0.00059665483,0.00069539977,0.0008690821,0.00024319993,0.0008271009,0.0005050282,0.00077143585,0.003150684],"category_scores_gemma":[0.00077044766,0.000321849,0.0004902231,0.0012566018,0.00036972322,0.0021697402,0.0012566282,0.00066350924,0.0013911878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001709794,0.00005687946,0.0002472552,0.00030040203,0.00006466898,0.00008716324,0.00009064658,0.012661546,0.4000422,0.019599834,0.0029954023,0.56368303],"study_design_scores_gemma":[0.0000360551,0.0002567296,0.0017530627,0.000078616955,0.00013758052,0.0013607993,0.00007099443,0.40355134,0.5387402,0.026495816,0.027407167,0.00011164488],"about_ca_topic_score_codex":0.00027259323,"about_ca_topic_score_gemma":0.0005754401,"teacher_disagreement_score":0.003150684,"about_ca_system_score_codex":0.00032545632,"about_ca_system_score_gemma":0.00026433234,"threshold_uncertainty_score":0.010540068},"labels":[],"label_agreement":null},{"id":"W1507011461","doi":"10.1007/11553939_136","title":"On Pruning and Tuning Rules for Associative Classifiers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Associative property; Association rule learning; Artificial intelligence; Machine learning; Data mining; Mathematics","score_opus":0.02461707479536234,"score_gpt":0.2688313340784305,"score_spread":0.24421425928306817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507011461","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.030396117,0.0015768385,0.96212286,0.0003876138,0.00019759822,0.00022747819,0.0002941084,0.0016201413,0.0031771932],"genre_scores_gemma":[0.21439195,0.000794531,0.77603114,0.00046780086,0.0003605458,0.00032490477,0.0017721799,0.00037673407,0.005480163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99224526,0.0020630767,0.0011386072,0.0011421274,0.0029096475,0.00050126936],"domain_scores_gemma":[0.9517221,0.03692093,0.0010526724,0.005337271,0.00457429,0.0003928368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010479717,0.001451057,0.003415917,0.0031082046,0.0017228543,0.0029920037,0.0054746103,0.0030071365,0.0035199127],"category_scores_gemma":[0.05399074,0.0014995242,0.0017151525,0.0034363363,0.0017434285,0.0065644826,0.0026487957,0.0042357002,0.0014742273],"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.00042982714,0.00038214578,0.0042274944,0.00021863215,0.00018619379,0.00019502803,0.00031070708,0.117100455,0.0032970135,0.025645819,0.010570627,0.8374361],"study_design_scores_gemma":[0.00007178373,0.00008993313,0.0012321209,0.00013478538,0.00014653742,0.00022121282,0.00008273342,0.89986855,0.0036534974,0.09091723,0.0035508678,0.000030734376],"about_ca_topic_score_codex":0.006538289,"about_ca_topic_score_gemma":0.009097632,"teacher_disagreement_score":0.010479717,"about_ca_system_score_codex":0.0010824471,"about_ca_system_score_gemma":0.0014140818,"threshold_uncertainty_score":0.055422723},"labels":[],"label_agreement":null},{"id":"W1507019315","doi":"10.1007/978-3-540-30135-6_82","title":"Mapping Template Heart Models to Patient Data Using Image Registration","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","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":"Canadian Institute for Advanced Research; Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Image registration; Gold standard (test); Artificial intelligence; Segmentation; Computer vision; Process (computing); Image segmentation; Surgical planning; Patient registration; Image (mathematics); Radiology; Medicine","score_opus":0.06418768406551136,"score_gpt":0.2656062363404823,"score_spread":0.20141855227497096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507019315","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.005594497,0.00021139786,0.99120176,0.00006729376,0.00006268947,0.000057430065,0.0001433492,0.0017854241,0.0008760844],"genre_scores_gemma":[0.16624333,0.0015331447,0.82265466,0.00017782493,0.00010371337,0.00024635557,0.0013040775,0.00191742,0.0058193863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995952,0.000073800045,0.000029029623,0.000117406285,0.00015532816,0.000029128294],"domain_scores_gemma":[0.9994537,0.000206382,0.000051346877,0.00020268478,0.00006829878,0.000017595028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280338,0.00069952285,0.0008014651,0.0011165146,0.0002073397,0.0015123183,0.0011172257,0.0009677122,0.0038734733],"category_scores_gemma":[0.0030893628,0.00079605414,0.0011930317,0.0011149925,0.00034845324,0.0009870972,0.0011016127,0.0010614055,0.0036186823],"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.0003348843,0.00010532458,0.0018645279,0.00030033395,0.00017598945,0.00054328376,0.00026248596,0.059074868,0.07507072,0.0062822644,0.008946832,0.8470385],"study_design_scores_gemma":[0.00008773536,0.00040962605,0.005865738,0.00011357027,0.00030003217,0.008733141,0.00023689879,0.7278903,0.19043805,0.029326033,0.03645398,0.00014489498],"about_ca_topic_score_codex":0.0011437007,"about_ca_topic_score_gemma":0.0015259389,"teacher_disagreement_score":0.0038734733,"about_ca_system_score_codex":0.00025386116,"about_ca_system_score_gemma":0.0006914654,"threshold_uncertainty_score":0.01295805},"labels":[],"label_agreement":null},{"id":"W1507048228","doi":"10.1007/978-3-540-25969-5_61","title":"Overlay Wireless Sensor Networks for Application-Adaptive Scheduling in WLAN","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Computer network; Scheduling (production processes); Overlay; Adaptability; Wireless sensor network; Wireless; Wireless network; Distributed computing; Architecture; Telecommunications","score_opus":0.012523500914930288,"score_gpt":0.23266489242092814,"score_spread":0.22014139150599785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507048228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112394905,0.005757297,0.97208023,0.00036584734,0.00039639405,0.000050219627,0.00004704834,0.00088929787,0.009174188],"genre_scores_gemma":[0.54571927,0.008810414,0.42775393,0.00015155251,0.00050439447,0.00016857864,0.00021872214,0.00025585527,0.016417362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997905,0.00006479061,0.000012030291,0.0000283141,0.000081239516,0.000023146571],"domain_scores_gemma":[0.9996685,0.00017186093,0.000015768326,0.000065005996,0.00005976948,0.000019143652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005295658,0.00039183386,0.00054517196,0.0003499757,0.00033502004,0.000691079,0.0010174386,0.00041819486,0.0033365455],"category_scores_gemma":[0.0013753545,0.00023065404,0.00022810984,0.00085360673,0.00032221893,0.0011545137,0.0007322409,0.0009880281,0.00063440774],"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.00024057241,0.00013023769,0.0006076979,0.00037621788,0.00007326807,0.0001932051,0.00020132518,0.23793821,0.030896643,0.19973746,0.01897807,0.5106271],"study_design_scores_gemma":[0.000014679007,0.00006924742,0.00028446026,0.000029454442,0.000028065744,0.0001680029,0.00006147333,0.924029,0.005422241,0.041296013,0.028582776,0.000014642363],"about_ca_topic_score_codex":0.0008506666,"about_ca_topic_score_gemma":0.0020096898,"teacher_disagreement_score":0.0033365455,"about_ca_system_score_codex":0.00062776724,"about_ca_system_score_gemma":0.00040780497,"threshold_uncertainty_score":0.011161864},"labels":[],"label_agreement":null},{"id":"W1507093685","doi":"10.1007/978-3-642-02614-0_36","title":"Confidence Measures in Recognizing Handwritten Mathematical Symbols","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Pattern recognition (psychology); Support vector machine; Artificial intelligence; Computer science; Convex hull; Binary number; Binary classification; Value (mathematics); Regular polygon; Machine learning; Mathematics; Arithmetic","score_opus":0.021565232613731167,"score_gpt":0.26016761515751885,"score_spread":0.23860238254378768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507093685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09615205,0.0051672277,0.89391136,0.00033654008,0.00016014425,0.00004123684,0.0002841917,0.0007659219,0.003181368],"genre_scores_gemma":[0.8036343,0.0018320769,0.19023521,0.00010783193,0.00036580066,0.00009330849,0.0007587764,0.00019179595,0.0027809588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803823,0.00042132268,0.00022163716,0.0003396238,0.0008558416,0.00012344733],"domain_scores_gemma":[0.97525513,0.020235041,0.0014531388,0.0010747368,0.00172686,0.00025517016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029686226,0.0005938075,0.00089641387,0.0019922801,0.00028465607,0.0022506744,0.0015648544,0.0012194982,0.0022834712],"category_scores_gemma":[0.03287552,0.00042914975,0.0004927518,0.0019041861,0.0010557008,0.004334567,0.0012370569,0.0019395524,0.00057927397],"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.00056528085,0.00012541118,0.0089485515,0.00041563902,0.000108100365,0.00013967778,0.00023496417,0.1156895,0.007525102,0.04702081,0.0037955197,0.8154315],"study_design_scores_gemma":[0.000018467383,0.00012283283,0.0045291353,0.000110979214,0.000039497525,0.00023168005,0.00007000112,0.9221118,0.007650941,0.06353749,0.0015276418,0.000049546477],"about_ca_topic_score_codex":0.0016795787,"about_ca_topic_score_gemma":0.0011286906,"teacher_disagreement_score":0.0029686226,"about_ca_system_score_codex":0.0006082489,"about_ca_system_score_gemma":0.00043465933,"threshold_uncertainty_score":0.015699744},"labels":[],"label_agreement":null},{"id":"W1507174820","doi":"10.1007/978-3-540-89722-4_13","title":"Policy Iteration for Learning an Exercise Policy for American Options","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Machine learning; Computational finance; Finance; Economics","score_opus":0.028631058431168026,"score_gpt":0.2704698405771932,"score_spread":0.24183878214602517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507174820","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.01814143,0.00021289477,0.9754641,0.0004718529,0.0000711847,0.000111494366,0.000055416498,0.0003185981,0.005152931],"genre_scores_gemma":[0.5481918,0.00044655887,0.43611372,0.00038024798,0.00018860784,0.0009389471,0.000385173,0.00037675083,0.012978222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984486,0.00089532824,0.00007687304,0.00021767143,0.00021464651,0.00014691435],"domain_scores_gemma":[0.98784584,0.010698066,0.00021700928,0.00031893642,0.00051340257,0.00040667242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053244894,0.0014838455,0.002550152,0.0011719603,0.0011149782,0.0018783907,0.0019511805,0.0041167894,0.009500501],"category_scores_gemma":[0.0190989,0.0012776544,0.0015142297,0.0008604361,0.002805827,0.0028806946,0.0037646592,0.0049606776,0.0008816868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608467,0.00014115212,0.0007976119,0.000102933416,0.000054716027,0.00009778002,0.00022437208,0.8151469,0.00043245757,0.12918484,0.001971726,0.051584605],"study_design_scores_gemma":[0.000020517698,0.000019496905,0.000023055516,0.000012417785,0.000004843602,0.000007767665,0.00001080411,0.9605698,0.00012122559,0.038973793,0.00023050558,0.0000057521443],"about_ca_topic_score_codex":0.005377396,"about_ca_topic_score_gemma":0.00459266,"teacher_disagreement_score":0.009500501,"about_ca_system_score_codex":0.0018316216,"about_ca_system_score_gemma":0.0027789855,"threshold_uncertainty_score":0.03178233},"labels":[],"label_agreement":null},{"id":"W1507282807","doi":"10.1007/978-3-540-71774-4_5","title":"AOSD and Reflection: Benefits and Drawbacks to Software Evolution","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Session (web analytics); Presentation (obstetrics); Computer science; Reflection (computer programming); Software; Software review; Field (mathematics); Software evolution; Software engineering; Event (particle physics); Software development; Data science; World Wide Web; Software construction; Programming language","score_opus":0.03826607538320131,"score_gpt":0.30565039750453815,"score_spread":0.26738432212133684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507282807","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.049699653,0.014714898,0.87119853,0.011490561,0.0005566268,0.00006751085,0.000038068767,0.0022590866,0.04997493],"genre_scores_gemma":[0.49325413,0.0103219235,0.4704406,0.0020626937,0.0007521588,0.00013988378,0.000098942175,0.0010791984,0.021850502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946569,0.0019562794,0.00028755938,0.00052837335,0.0023419696,0.00022902153],"domain_scores_gemma":[0.97618175,0.015068094,0.001094338,0.005222518,0.001977557,0.00045575117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060171727,0.00042588398,0.0006342397,0.0009595046,0.00062681665,0.0033819037,0.0017584689,0.0019699568,0.002652358],"category_scores_gemma":[0.02314705,0.0006361933,0.0006644571,0.0018293539,0.0032239656,0.008044728,0.0026674962,0.0035053769,0.000684233],"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.000116176234,0.00012272237,0.0018889809,0.00032478737,0.000035238223,0.00007533154,0.0010938074,0.004108206,0.0030934836,0.18518461,0.0030620904,0.8008945],"study_design_scores_gemma":[0.00017656777,0.0006097915,0.003206133,0.0007053819,0.00021945524,0.0022472795,0.0013935323,0.08847128,0.012687362,0.75176984,0.13840032,0.000113082286],"about_ca_topic_score_codex":0.0007326985,"about_ca_topic_score_gemma":0.0010097591,"teacher_disagreement_score":0.0060171727,"about_ca_system_score_codex":0.00047331353,"about_ca_system_score_gemma":0.0011708713,"threshold_uncertainty_score":0.031822264},"labels":[],"label_agreement":null},{"id":"W1507564261","doi":"10.1007/978-3-540-39890-5_11","title":"A Simple Linear Time LexBFS Cograph Recognition Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"University of Toronto","funders":"","keywords":"Computer science; Lexicographical order; Simple (philosophy); Algorithm; Complement (music); Cograph; Time complexity; Graph; Theoretical computer science; Combinatorics; Mathematics; Pathwidth; Line graph","score_opus":0.023456181181346864,"score_gpt":0.27916664467076174,"score_spread":0.2557104634894149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507564261","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.06439797,0.00062585133,0.8350625,0.0011655414,0.0005567802,0.0005699594,0.00434048,0.051692694,0.041588247],"genre_scores_gemma":[0.14704183,0.00019716755,0.8060641,0.0003871294,0.00010750548,0.00025831832,0.009041213,0.0014976761,0.035404976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994548,0.000048988946,0.00004377363,0.00019752416,0.00016182064,0.00009314546],"domain_scores_gemma":[0.9995086,0.00009308441,0.00002646926,0.00018376586,0.00014162822,0.00004640855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002471782,0.00104511,0.0010275387,0.0011869498,0.0010383175,0.0017457281,0.0020849977,0.0011222262,0.031070722],"category_scores_gemma":[0.0009565399,0.00054015033,0.0009975039,0.0021108817,0.0005493218,0.0031577593,0.0016849458,0.0010945909,0.013461207],"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.0004789237,0.0002761251,0.0005936904,0.0002839344,0.000036579284,0.00013572915,0.00009983083,0.007339915,0.025565414,0.017359635,0.054274008,0.8935562],"study_design_scores_gemma":[0.0006969895,0.00061912363,0.0030052229,0.00015435534,0.00022113438,0.0012034547,0.0007136801,0.5252719,0.10330668,0.1898161,0.1748224,0.00016903055],"about_ca_topic_score_codex":0.0059779496,"about_ca_topic_score_gemma":0.011639696,"teacher_disagreement_score":0.031070722,"about_ca_system_score_codex":0.0012494749,"about_ca_system_score_gemma":0.002157384,"threshold_uncertainty_score":0.10394186},"labels":[],"label_agreement":null},{"id":"W1507587294","doi":"10.1007/978-3-642-02011-7_12","title":"A Heuristic Strong Connectivity Algorithm for Large Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Hopcroft–Karp algorithm; Heuristic; Undirected graph; Graph; Theoretical computer science; Pathwidth; Line graph; Artificial intelligence","score_opus":0.01628712586283387,"score_gpt":0.26597556620708024,"score_spread":0.24968844034424637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507587294","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.035438593,0.0005473198,0.9501195,0.00063969137,0.00016568541,0.000424695,0.00036904123,0.0025416787,0.009753836],"genre_scores_gemma":[0.1463612,0.00026995485,0.8438617,0.00027332146,0.00016627708,0.0006165406,0.0011398977,0.00050558493,0.006805638],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992293,0.00021967334,0.00003723122,0.00015855103,0.0002441803,0.00011099978],"domain_scores_gemma":[0.99659204,0.0019330579,0.00020876009,0.0006234166,0.00041461666,0.00022819002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076768,0.0016504436,0.00139833,0.0023445417,0.0014898124,0.0014469429,0.0035690304,0.0017234269,0.014039429],"category_scores_gemma":[0.0055776024,0.0011428267,0.0010985788,0.002839384,0.0012159784,0.0032085765,0.0030264752,0.0018447452,0.0017966802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074832304,0.0004305825,0.0012004317,0.0005739562,0.00013427855,0.00020274661,0.00022015632,0.30507562,0.008806925,0.061438743,0.024432713,0.5967356],"study_design_scores_gemma":[0.00029789386,0.0001713549,0.00042385233,0.00004010426,0.00007107,0.00012725299,0.000070810805,0.92728573,0.002892141,0.06303388,0.005560133,0.00002576932],"about_ca_topic_score_codex":0.0032774266,"about_ca_topic_score_gemma":0.0066782883,"teacher_disagreement_score":0.014039429,"about_ca_system_score_codex":0.0012146553,"about_ca_system_score_gemma":0.0022634852,"threshold_uncertainty_score":0.046966553},"labels":[],"label_agreement":null},{"id":"W1507638461","doi":"10.1007/978-3-540-31856-9_42","title":"Fast Pruning of Geometric Spanners","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Bounded function; Pruning; Binary logarithm; Sequence (biology); Graph; Order (exchange); Constant (computer programming); Mathematics; Set (abstract data type); Computer science; Discrete mathematics; Database","score_opus":0.01626230688773359,"score_gpt":0.24236896892779175,"score_spread":0.22610666204005817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507638461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061499752,0.0016331284,0.9069749,0.00022589148,0.00023630344,0.0001930511,0.0006255044,0.004001354,0.024610132],"genre_scores_gemma":[0.1985017,0.00087243953,0.7782164,0.00013415706,0.00011751355,0.00017221345,0.0027146982,0.0012039596,0.018066863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00012894545,0.00005908307,0.00015305687,0.0005025333,0.00012817525],"domain_scores_gemma":[0.99825364,0.0007043791,0.000098981545,0.00048179226,0.00037055285,0.00009055476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005898626,0.0010811357,0.001636197,0.0019686522,0.00072095206,0.0013247366,0.0020268557,0.00093198713,0.0139693],"category_scores_gemma":[0.0035390917,0.000693387,0.0008298561,0.002144755,0.00068953366,0.0023298585,0.002853953,0.0012947379,0.003740641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053401914,0.00016920992,0.0011861824,0.0005632913,0.000091392714,0.00032034208,0.00023523431,0.06773608,0.025599748,0.059496112,0.029080937,0.8149875],"study_design_scores_gemma":[0.00013408295,0.00027995434,0.0011417415,0.00016143656,0.00009974068,0.00074769557,0.00021919115,0.7543268,0.0331237,0.16958882,0.040142372,0.00003450787],"about_ca_topic_score_codex":0.0009267287,"about_ca_topic_score_gemma":0.0028723371,"teacher_disagreement_score":0.0139693,"about_ca_system_score_codex":0.0004511242,"about_ca_system_score_gemma":0.0005601526,"threshold_uncertainty_score":0.04673195},"labels":[],"label_agreement":null},{"id":"W1507654104","doi":"10.1007/11596448_113","title":"Grid-ODF: Detecting Outliers Effectively and Efficiently in Large Multi-dimensional Databases","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Outlier; Computer science; Grid; Anomaly detection; Data mining; Local outlier factor; Rank (graph theory); Database; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01891582833929225,"score_gpt":0.2710187547318289,"score_spread":0.2521029263925367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507654104","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.018477514,0.0003901824,0.96564406,0.00014276369,0.000101736434,0.000086436274,0.0006518404,0.014150343,0.00035507508],"genre_scores_gemma":[0.07856859,0.0002059341,0.9186646,0.00006299128,0.000035582914,0.00009115709,0.0011772291,0.0004454937,0.0007484421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903286,0.00011796902,0.00007451688,0.0001687414,0.0005152341,0.00009073621],"domain_scores_gemma":[0.998432,0.0005913933,0.00012671412,0.00041665888,0.00035316608,0.00008010262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011827406,0.0012477605,0.002215639,0.0024278888,0.0007350056,0.0012630648,0.0025603191,0.0011401344,0.0021824173],"category_scores_gemma":[0.004776061,0.0007011854,0.00080094254,0.0037926356,0.0005891386,0.0021134415,0.0024057534,0.0010708418,0.0009145849],"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.00045428984,0.00011096928,0.004602284,0.00023444902,0.00010790216,0.00021088535,0.00013719914,0.059668276,0.009223968,0.0024509495,0.024071833,0.89872706],"study_design_scores_gemma":[0.00007674547,0.00007042211,0.0011502268,0.000013733171,0.000025837931,0.0003034934,0.00008122799,0.97315896,0.010308487,0.009089966,0.00569453,0.000026419802],"about_ca_topic_score_codex":0.00829636,"about_ca_topic_score_gemma":0.008666915,"teacher_disagreement_score":0.00829636,"about_ca_system_score_codex":0.0004337506,"about_ca_system_score_gemma":0.0009267269,"threshold_uncertainty_score":0.016496181},"labels":[],"label_agreement":null},{"id":"W1507674787","doi":"10.1007/978-3-642-02282-1_10","title":"Uninorm Based Fuzzy Network for Tree Data Structures","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","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 Alberta","funders":"","keywords":"Connectionism; Computer science; Generalization; Fuzzy logic; Artificial intelligence; Process (computing); Simple (philosophy); Tree (set theory); Neuro-fuzzy; Theoretical computer science; Artificial neural network; Tree structure; Algorithm; Data mining; Fuzzy control system; Mathematics; Binary tree; Programming language","score_opus":0.03068712663069595,"score_gpt":0.24940261914919873,"score_spread":0.21871549251850278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507674787","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.024155606,0.00027922928,0.9689691,0.00021217315,0.00007277535,0.00008783977,0.00043671997,0.0013658522,0.004420616],"genre_scores_gemma":[0.35386232,0.00046776488,0.6286493,0.00020364912,0.00006867513,0.00020480702,0.0013648275,0.00013101574,0.015047759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.00010672998,0.000071952185,0.00015142663,0.00024216447,0.00007306275],"domain_scores_gemma":[0.9987091,0.00038410924,0.000103806415,0.00031363778,0.0004173484,0.00007200596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011809168,0.00031179102,0.0005827659,0.0012404184,0.0007985735,0.0012450692,0.0013072902,0.0007377821,0.0050977333],"category_scores_gemma":[0.0029969423,0.00024256148,0.00050254195,0.0011152305,0.0005911134,0.0028488608,0.00088062976,0.00086849934,0.00076426147],"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.0007078872,0.00018530156,0.0015881882,0.0002759569,0.000071609626,0.00023051414,0.0002292332,0.17561333,0.01789497,0.25907388,0.011564734,0.53256434],"study_design_scores_gemma":[0.000014520771,0.00010505498,0.00040738302,0.00004722319,0.000040093135,0.000141501,0.00004059159,0.8656213,0.011019227,0.113773614,0.008767015,0.00002242446],"about_ca_topic_score_codex":0.0054949,"about_ca_topic_score_gemma":0.010629905,"teacher_disagreement_score":0.0054949,"about_ca_system_score_codex":0.0014809086,"about_ca_system_score_gemma":0.0011315941,"threshold_uncertainty_score":0.017053664},"labels":[],"label_agreement":null},{"id":"W1507702167","doi":"10.1007/11821045_5","title":"Iterative Division and Correlograms for Detection and Tracking of Moving Objects","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Polytechnique Montréal","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Histogram; Tracking (education); Division (mathematics); Object detection; Video tracking; Object (grammar); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.019879927569185607,"score_gpt":0.27209534646472183,"score_spread":0.2522154188955362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507702167","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.0030904564,0.00046121894,0.9954301,0.00002333701,0.00002858751,0.000015301574,0.000020736285,0.00047916203,0.00045112858],"genre_scores_gemma":[0.037129655,0.00053910696,0.9599964,0.000034514444,0.000046657264,0.000100523015,0.00010413051,0.00017404386,0.0018749024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990932,0.00023535416,0.00006595929,0.00014912176,0.0003839782,0.00007243402],"domain_scores_gemma":[0.99714017,0.0016803815,0.00016299386,0.00041910616,0.00053581264,0.00006157407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013077186,0.0009741005,0.0012119776,0.0022621707,0.00058192416,0.0010686483,0.0015948208,0.0011762853,0.002867025],"category_scores_gemma":[0.006450724,0.00091434317,0.0007086165,0.0036311704,0.0009387208,0.0015643225,0.0011574698,0.0011081405,0.0014048236],"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.00031454017,0.00006311644,0.0005538677,0.00015106764,0.000070579415,0.00009770325,0.00018012259,0.06493921,0.02256127,0.029155001,0.0045422255,0.8773714],"study_design_scores_gemma":[0.000030949876,0.00005089781,0.00063709967,0.000021788297,0.0000436085,0.0002296463,0.000030504903,0.9571359,0.020156812,0.017695205,0.0039327736,0.000034768524],"about_ca_topic_score_codex":0.005091437,"about_ca_topic_score_gemma":0.0063736974,"teacher_disagreement_score":0.005091437,"about_ca_system_score_codex":0.00071437005,"about_ca_system_score_gemma":0.0012770072,"threshold_uncertainty_score":0.0101236105},"labels":[],"label_agreement":null},{"id":"W1507733695","doi":"10.1007/11686699_21","title":"Using Web Services to Control Remote Instruments for Online Experiment Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Université TÉLUQ; University of New Brunswick; National Research Council Canada","funders":"","keywords":"Computer science; Web service; Interoperability; Stateless protocol; World Wide Web; WS-Policy; Web modeling; Web standards; Service-oriented architecture; Web development; Service (business); WS-Addressing; WS-I Basic Profile; Data Web; Web application security; Computer network","score_opus":0.027073945175583685,"score_gpt":0.2801066563748202,"score_spread":0.2530327111992365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507733695","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.029040536,0.00045493257,0.91426927,0.0002743774,0.0003112062,0.00021345864,0.000094988914,0.03781275,0.017528404],"genre_scores_gemma":[0.6390213,0.00077526947,0.3046101,0.0006813255,0.00030470063,0.00045617094,0.00063615054,0.006170027,0.047344938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987011,0.00021404105,0.0000811753,0.00014402154,0.00071076525,0.00014892356],"domain_scores_gemma":[0.9983564,0.00046709154,0.000125372,0.00057417306,0.00033122257,0.00014574036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012560824,0.000925507,0.0007110599,0.000834611,0.0006638245,0.0024193504,0.0018478472,0.001162101,0.0048539634],"category_scores_gemma":[0.0023701906,0.00064447406,0.00060165924,0.000790003,0.0009829603,0.0021413248,0.0016920923,0.0016810346,0.00252173],"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.001479172,0.00095685816,0.0035100528,0.0005944691,0.00021981486,0.0013212735,0.001505253,0.031929664,0.2966553,0.07052705,0.03632362,0.5549775],"study_design_scores_gemma":[0.00029861002,0.0003034487,0.0028191141,0.00012701882,0.00021924064,0.00084817957,0.00018269164,0.53768194,0.24703504,0.062537335,0.14778717,0.00016023719],"about_ca_topic_score_codex":0.0021202888,"about_ca_topic_score_gemma":0.0018390057,"teacher_disagreement_score":0.0048539634,"about_ca_system_score_codex":0.0004901093,"about_ca_system_score_gemma":0.00058879785,"threshold_uncertainty_score":0.016238153},"labels":[],"label_agreement":null},{"id":"W1507852567","doi":"10.1007/11425274_17","title":"Evaluation of Two Systems on Multi-class Multi-label Document Classification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Document classification; Classifier (UML); Search engine indexing; Artificial intelligence; Class (philosophy); Multi-label classification; Pattern recognition (psychology); Data mining; Information retrieval; Natural language processing; Machine learning","score_opus":0.09346704776640828,"score_gpt":0.3400993522796007,"score_spread":0.2466323045131924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507852567","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.74204487,0.011707406,0.19492197,0.0024287046,0.0034254408,0.0031169718,0.005228391,0.022883452,0.014242708],"genre_scores_gemma":[0.7330969,0.0017672199,0.22932236,0.0008671067,0.0007351464,0.0010829964,0.016420634,0.00081461255,0.01589291],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99174833,0.002373959,0.0007552522,0.00195937,0.002524631,0.00063855504],"domain_scores_gemma":[0.9754066,0.01329193,0.0006326172,0.0022816407,0.007264553,0.0011226436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0094597405,0.0024690256,0.002711565,0.0038274003,0.0017664941,0.003998599,0.0038641929,0.005224612,0.0054241186],"category_scores_gemma":[0.020410752,0.0007269921,0.0015248873,0.002612311,0.00087460974,0.00419083,0.0026864903,0.0017178891,0.0036803707],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01623368,0.004835855,0.013400987,0.001821449,0.00204644,0.00047928892,0.0005113481,0.035433054,0.029829301,0.0011519737,0.025700258,0.8685564],"study_design_scores_gemma":[0.0023258664,0.005412925,0.027327918,0.00017536839,0.0020149976,0.00076986715,0.00086948293,0.8907587,0.05857226,0.0018025325,0.009689447,0.00028055048],"about_ca_topic_score_codex":0.02392591,"about_ca_topic_score_gemma":0.020838078,"teacher_disagreement_score":0.02392591,"about_ca_system_score_codex":0.0026576258,"about_ca_system_score_gemma":0.002294772,"threshold_uncertainty_score":0.050028443},"labels":[],"label_agreement":null},{"id":"W1507874144","doi":"10.1007/3-540-70657-7_4","title":"Bringing Coherence to Agent Conversations","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Calgary","funders":"","keywords":"Conversation; Computer science; Coherence (philosophical gambling strategy); Cornerstone; Negotiation; Action (physics); Software agent; Identity (music); Human–computer interaction; Artificial intelligence; Cognitive science; Communication; Sociology; Psychology","score_opus":0.03232246663242414,"score_gpt":0.24806927744918336,"score_spread":0.21574681081675923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507874144","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.016869824,0.0020501884,0.8471413,0.010284921,0.0006935644,0.00009770138,0.0001502375,0.0016668318,0.12104538],"genre_scores_gemma":[0.76655686,0.0012160714,0.18350516,0.0014658007,0.0006501217,0.00043189744,0.0003773243,0.001118967,0.044677887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958586,0.0023795732,0.00018732631,0.0005525536,0.0006828517,0.00033912747],"domain_scores_gemma":[0.9885533,0.0062390384,0.0003858438,0.0033574698,0.0009089971,0.000555369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039235074,0.0006675282,0.0008483976,0.0013799887,0.0043624775,0.006547947,0.0017185262,0.0023697657,0.018022098],"category_scores_gemma":[0.021967096,0.001206642,0.00077878806,0.0014342968,0.0078072445,0.017519765,0.00929166,0.0055999747,0.0031235043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033331304,0.000015761223,0.00011743241,0.000038457427,0.0000081758635,0.00003882672,0.0023455394,0.0008183118,0.00037362892,0.9740785,0.003398376,0.018733677],"study_design_scores_gemma":[0.00001567636,0.000010054402,0.00004098909,0.000026962358,0.000010466038,0.000026010606,0.000422846,0.004275879,0.00046398095,0.9697138,0.02498348,0.000009977576],"about_ca_topic_score_codex":0.002247489,"about_ca_topic_score_gemma":0.0018618522,"teacher_disagreement_score":0.018022098,"about_ca_system_score_codex":0.0015176769,"about_ca_system_score_gemma":0.0013910732,"threshold_uncertainty_score":0.06028992},"labels":[],"label_agreement":null},{"id":"W1507965739","doi":"10.1007/11546207_18","title":"Platypus: A Platform for Distributed Answer Set Solving","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Western University","funders":"","keywords":"Computer science; Computation; Variety (cybernetics); Set (abstract data type); Distributed computing; Theoretical computer science; Software; Scheme (mathematics); State (computer science); Distributed algorithm; Model of computation; Programming language; Artificial intelligence","score_opus":0.02499926661315623,"score_gpt":0.25511258022844263,"score_spread":0.2301133136152864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507965739","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.008512443,0.0004610729,0.8497934,0.000501604,0.00027071018,0.0004146547,0.0017655889,0.117243245,0.021037279],"genre_scores_gemma":[0.150243,0.0009967075,0.7805165,0.00080733723,0.00026042928,0.0011265249,0.011654696,0.019493269,0.03490162],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988306,0.0002525498,0.00012072543,0.00020104324,0.0004674039,0.00012771618],"domain_scores_gemma":[0.99851817,0.0006659269,0.00007443816,0.00045493306,0.00013857392,0.0001480467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927919,0.001036689,0.0010874936,0.0009937945,0.0012947416,0.002201685,0.0042263786,0.0012079242,0.031384755],"category_scores_gemma":[0.0038958923,0.0011575382,0.0011109774,0.0014165363,0.0015254536,0.005668056,0.0047160652,0.0031835078,0.010248577],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018439477,0.00042366327,0.001371804,0.0011087309,0.00016862513,0.00037327266,0.0013197028,0.017318118,0.01934017,0.29523396,0.1935673,0.46793067],"study_design_scores_gemma":[0.0007147766,0.00018299717,0.00067739224,0.00021082279,0.0001217221,0.00040917206,0.00020563252,0.24311988,0.0307262,0.47545895,0.24804913,0.00012323317],"about_ca_topic_score_codex":0.0024054744,"about_ca_topic_score_gemma":0.003183939,"teacher_disagreement_score":0.031384755,"about_ca_system_score_codex":0.00077339483,"about_ca_system_score_gemma":0.0013774439,"threshold_uncertainty_score":0.10499251},"labels":[],"label_agreement":null},{"id":"W1507969153","doi":"10.1007/3-540-45061-0_2","title":"Problems on RNA Secondary Structure Prediction and Design","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia","funders":"","keywords":"Computer science; RNA; Theoretical computer science; Biology; Genetics","score_opus":0.012578608713199092,"score_gpt":0.21034698705627347,"score_spread":0.19776837834307437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507969153","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.017831832,0.0065944702,0.95669395,0.005318348,0.0005745204,0.00013478157,0.00069521775,0.0005645489,0.011592351],"genre_scores_gemma":[0.1931913,0.008107974,0.76890063,0.0013670162,0.0030682972,0.0006018492,0.0032609967,0.00059969723,0.020902278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99767345,0.00079280057,0.0001613921,0.00070585735,0.0005349075,0.0001315307],"domain_scores_gemma":[0.9826299,0.0154776545,0.0003769255,0.0006738895,0.0006454345,0.000196194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00405948,0.0018435629,0.003282373,0.0017911011,0.0016644187,0.003352204,0.0032772755,0.0048597115,0.010171276],"category_scores_gemma":[0.022953074,0.0017671023,0.0021530841,0.0030763613,0.0027458223,0.0074404944,0.0023449133,0.0034637197,0.002074311],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003787452,0.00033361698,0.0014709865,0.0013636746,0.00020123881,0.00025931778,0.0003143081,0.3616728,0.0018581753,0.23330148,0.05894913,0.33989665],"study_design_scores_gemma":[0.00008893365,0.000058781443,0.0002258297,0.00007300673,0.000030087918,0.00009282734,0.000065203654,0.33702055,0.0009819624,0.6549446,0.006395476,0.000022758604],"about_ca_topic_score_codex":0.0017793094,"about_ca_topic_score_gemma":0.001155094,"teacher_disagreement_score":0.010171276,"about_ca_system_score_codex":0.0014655901,"about_ca_system_score_gemma":0.0013316594,"threshold_uncertainty_score":0.034026265},"labels":[],"label_agreement":null},{"id":"W1508012366","doi":"10.1007/11414353_17","title":"Visual Capabilities in an Interactive Autonomous Robot","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Robot; Human–computer interaction; Variety (cybernetics); Mobile robot; Embodied cognition; Gesture; Social robot; Context (archaeology); Artificial intelligence; Robot control","score_opus":0.011979985489256283,"score_gpt":0.28657387203121354,"score_spread":0.27459388654195727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508012366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15615796,0.0024801218,0.44937056,0.0014633556,0.00018228809,0.000055652923,0.00014832204,0.0015353417,0.3886064],"genre_scores_gemma":[0.829723,0.0012538787,0.08753626,0.00013909707,0.000050733866,0.00011098673,0.000115088435,0.00015533301,0.08091555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999422,0.000009419614,0.000001847798,0.000013287979,0.000023382148,0.000009789349],"domain_scores_gemma":[0.9999256,0.000033662225,0.000006293253,0.0000068635345,0.000011076618,0.000016396163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066497385,0.00029115402,0.00014818198,0.00019418352,0.0004651754,0.0009847113,0.0006317614,0.0007301971,0.0061149746],"category_scores_gemma":[0.00027745156,0.0002698262,0.00025602742,0.00016300757,0.0010857288,0.001493729,0.0011661957,0.0005477411,0.0008011425],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019381163,0.00006218149,0.00035410066,0.00023967531,0.00002211163,0.0013135974,0.0021993855,0.04492591,0.10091118,0.7356921,0.0063876742,0.10769841],"study_design_scores_gemma":[0.000057856196,0.00029303753,0.0018393,0.00017523856,0.000043800108,0.0012606195,0.001564684,0.16906343,0.03371093,0.66310203,0.12878628,0.00010277642],"about_ca_topic_score_codex":0.0015641832,"about_ca_topic_score_gemma":0.001209081,"teacher_disagreement_score":0.0061149746,"about_ca_system_score_codex":0.00028870467,"about_ca_system_score_gemma":0.0002054703,"threshold_uncertainty_score":0.020456672},"labels":[],"label_agreement":null},{"id":"W1508045687","doi":"10.1007/978-3-642-13059-5_25","title":"A Survey on Statistical Relational Learning","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Statistical relational learning; Computer science; Statistical inference; Relational database; Representation (politics); Inference; Independent and identically distributed random variables; Artificial intelligence; Machine learning; Data science; Data mining; Statistics; Mathematics; Random variable","score_opus":0.03925676124569258,"score_gpt":0.27488971064158624,"score_spread":0.23563294939589366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508045687","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034981694,0.24464194,0.72312117,0.0041502328,0.00080126326,0.0000759776,0.0009249723,0.000695047,0.022091305],"genre_scores_gemma":[0.08880206,0.4716784,0.41296098,0.0024280488,0.0044377996,0.0003274187,0.0034508493,0.00052843377,0.015385973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973278,0.00086378865,0.00025771887,0.00042443193,0.001052057,0.00007413418],"domain_scores_gemma":[0.9918439,0.0060401447,0.0002229721,0.0010508792,0.0007351682,0.00010694381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035254785,0.0008905717,0.0019242265,0.0033835424,0.0007182909,0.0028784068,0.0019737065,0.0011188729,0.010051164],"category_scores_gemma":[0.011916319,0.00093086,0.0010090148,0.01338963,0.0014835205,0.008186025,0.0020031272,0.0023984646,0.0036478457],"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.000025762745,0.000081655184,0.0009920173,0.0013393174,0.000068349524,0.000042919262,0.00012797203,0.007639509,0.00034565336,0.2872033,0.023977844,0.67815566],"study_design_scores_gemma":[0.000011560152,0.000063428524,0.0010480825,0.00050122215,0.000067675704,0.00040230458,0.00009564687,0.050022144,0.0007092086,0.7312391,0.21579303,0.000046616256],"about_ca_topic_score_codex":0.0014727273,"about_ca_topic_score_gemma":0.0015206345,"teacher_disagreement_score":0.010051164,"about_ca_system_score_codex":0.0011656188,"about_ca_system_score_gemma":0.0016679912,"threshold_uncertainty_score":0.03362447},"labels":[],"label_agreement":null},{"id":"W1508051368","doi":"10.1007/3-540-45508-6_11","title":"Distributed Resource Management to Support Distributed Application-Specific Quality of Service","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Western University","funders":"","keywords":"Quality of service; Computer science; Mobile QoS; Resource allocation; Resource (disambiguation); Key (lock); Distributed computing; Service (business); Resource management (computing); Quality (philosophy); Architecture; Computer network; Computer security; Service provider","score_opus":0.024575646089857482,"score_gpt":0.27073809193308324,"score_spread":0.24616244584322575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508051368","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.0069793696,0.0008818812,0.96344113,0.00041891154,0.0005126841,0.00013414734,0.000092933034,0.00641474,0.021124145],"genre_scores_gemma":[0.31341845,0.0014841121,0.6170297,0.0008408228,0.0004598881,0.00046845365,0.0010186675,0.0013773885,0.06390255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996282,0.000056486148,0.000023802168,0.00005672778,0.00018960364,0.000045106462],"domain_scores_gemma":[0.99951804,0.00011144814,0.000022822149,0.00018880563,0.000119780394,0.00003910713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077259965,0.0004439701,0.00043799757,0.00044739328,0.0005302055,0.0011467213,0.0016640519,0.00062713603,0.0052302084],"category_scores_gemma":[0.0013045328,0.00031742858,0.00034710814,0.00068756146,0.0004088386,0.0011895705,0.0009851317,0.0017864039,0.0017994137],"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.00020467673,0.00031356886,0.00063670793,0.00031900586,0.000103665,0.00029483406,0.0005050052,0.043216273,0.07184484,0.21956764,0.07528374,0.58770996],"study_design_scores_gemma":[0.0001425988,0.00018065087,0.0010522346,0.000109055305,0.00012498806,0.000631251,0.00007613723,0.46344668,0.058225267,0.1222446,0.35369036,0.000076214455],"about_ca_topic_score_codex":0.0010619779,"about_ca_topic_score_gemma":0.0017575426,"teacher_disagreement_score":0.0052302084,"about_ca_system_score_codex":0.00070546,"about_ca_system_score_gemma":0.000543356,"threshold_uncertainty_score":0.017496824},"labels":[],"label_agreement":null},{"id":"W1508115086","doi":"10.1007/3-540-45054-8_39","title":"Divergence-Based Medial Surfaces","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":85,"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":"Medial axis; Computer science; Voronoi diagram; Computation; Surface (topology); Topology (electrical circuits); Algorithm; Heuristic; Artificial intelligence; Mathematics; Geometry","score_opus":0.01786626978284251,"score_gpt":0.247951898910027,"score_spread":0.2300856291271845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508115086","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.031177625,0.00089253735,0.9300942,0.00024217999,0.0002327934,0.00004822283,0.00011118909,0.0011436659,0.03605753],"genre_scores_gemma":[0.5073044,0.0013476002,0.42552122,0.00015002902,0.00018374877,0.000061873754,0.0005380755,0.0010889262,0.0638042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.000048940125,0.000019866291,0.0000563986,0.00022610226,0.00002194879],"domain_scores_gemma":[0.99949896,0.00013143978,0.00004065234,0.00010466589,0.00015348414,0.00007083467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004740416,0.00063294685,0.00074347504,0.0017270156,0.00057773787,0.0017475629,0.0010073386,0.0008743673,0.010259162],"category_scores_gemma":[0.0019476783,0.00047186005,0.00047594818,0.0009168128,0.0011207691,0.0021297308,0.0022481917,0.0016785748,0.0035001307],"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.00014696663,0.00004166751,0.00033008982,0.00016926066,0.0000195231,0.00014912919,0.00031465627,0.016336791,0.02356896,0.66296214,0.00600056,0.28996018],"study_design_scores_gemma":[0.000037376944,0.00011106968,0.00037465896,0.000057186968,0.00001807941,0.0012245305,0.00016120952,0.20006658,0.010825754,0.74440634,0.042664163,0.000052997857],"about_ca_topic_score_codex":0.0004395537,"about_ca_topic_score_gemma":0.00068407226,"teacher_disagreement_score":0.010259162,"about_ca_system_score_codex":0.00044805775,"about_ca_system_score_gemma":0.0002752088,"threshold_uncertainty_score":0.034320295},"labels":[],"label_agreement":null},{"id":"W1508123575","doi":"10.1007/978-3-642-13529-3_38","title":"Rough Set-Based Incremental Learning Approach to Face Recognition","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Facial recognition system; Face (sociological concept); Artificial intelligence; Set (abstract data type); Pattern recognition (psychology); Computer vision; Programming language","score_opus":0.03385099958687945,"score_gpt":0.24509971415590143,"score_spread":0.21124871456902197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508123575","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.007391897,0.00050729135,0.99072284,0.000059785183,0.00004862026,0.000036804948,0.000038451595,0.00031367555,0.00088057097],"genre_scores_gemma":[0.30124974,0.0008410288,0.69447917,0.000086950815,0.00010897967,0.00016846294,0.00024328398,0.000070063514,0.0027523835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.00010934806,0.00004002249,0.00010357469,0.00022868169,0.00004550093],"domain_scores_gemma":[0.99923325,0.00036384532,0.00004079356,0.000097886004,0.00024279451,0.00002154445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008754135,0.00043871923,0.0015771564,0.0011006199,0.00034627077,0.00089986826,0.0025104268,0.0006902003,0.0018469873],"category_scores_gemma":[0.002031827,0.00039038423,0.0012015576,0.0010799206,0.0004344586,0.0013389271,0.00076423405,0.00114591,0.00043068844],"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.00013462546,0.000151201,0.00052026013,0.00020561513,0.00012486789,0.00011464961,0.00011996101,0.2431375,0.007681628,0.019625405,0.0035297815,0.7246546],"study_design_scores_gemma":[0.000005452558,0.000049119382,0.00024055487,0.000006493198,0.00002781798,0.00005400829,0.000010769822,0.9879126,0.0022039565,0.008546995,0.0009281432,0.000014107741],"about_ca_topic_score_codex":0.0033486406,"about_ca_topic_score_gemma":0.0031924255,"teacher_disagreement_score":0.0033486406,"about_ca_system_score_codex":0.0006521496,"about_ca_system_score_gemma":0.0005977784,"threshold_uncertainty_score":0.0066583157},"labels":[],"label_agreement":null},{"id":"W1508155876","doi":"10.1007/978-3-540-68825-9_33","title":"A Novel Approach for Social Behavior Analysis of the Blogosphere","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Blogosphere; Computer science; Cyberspace; The Internet; World Wide Web; Social media; Information retrieval; Style (visual arts); Data science","score_opus":0.026822859954667603,"score_gpt":0.27011765620860545,"score_spread":0.24329479625393785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508155876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008145013,0.0002674048,0.9877773,0.00017787857,0.00009961976,0.00010054013,0.00041753516,0.00036152164,0.002653075],"genre_scores_gemma":[0.28465688,0.0011260203,0.6992731,0.00029537882,0.000885782,0.0008010708,0.0012223768,0.00030141426,0.011438007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989913,0.0003281134,0.000047442412,0.00027887468,0.00027177908,0.000082550534],"domain_scores_gemma":[0.9978046,0.0012957926,0.00019569139,0.0003154225,0.00026855426,0.000119978395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010565313,0.0009075458,0.0011526544,0.0040334202,0.0009013299,0.0021724973,0.0013899555,0.0012601201,0.0029011997],"category_scores_gemma":[0.0052061146,0.00041446148,0.0012433685,0.0036629029,0.00090559456,0.0027873802,0.0017706571,0.0013177312,0.001211007],"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.00019641528,0.0007072225,0.01206186,0.0005991179,0.00056722213,0.0006162045,0.0018945009,0.09301592,0.029587457,0.43216667,0.013897959,0.4146894],"study_design_scores_gemma":[0.00001735181,0.00006560769,0.0032787696,0.000029862129,0.00006201916,0.00026551483,0.00025752772,0.82865703,0.0015160817,0.15834439,0.0074570407,0.000048725098],"about_ca_topic_score_codex":0.0030794248,"about_ca_topic_score_gemma":0.0037647071,"teacher_disagreement_score":0.0040334202,"about_ca_system_score_codex":0.00063957256,"about_ca_system_score_gemma":0.00079183665,"threshold_uncertainty_score":0.009705484},"labels":[],"label_agreement":null},{"id":"W1508182360","doi":"10.1007/978-3-642-15576-5_25","title":"Exploiting Conflict Structures in Inconsistent Databases","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Database; Information retrieval","score_opus":0.03678842332174959,"score_gpt":0.27661527829436355,"score_spread":0.23982685497261397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508182360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04134719,0.0015196203,0.9493898,0.0008569789,0.00015732675,0.00013420063,0.00027336853,0.001856346,0.004465242],"genre_scores_gemma":[0.40126455,0.0010806104,0.5916068,0.00033590302,0.00016079145,0.00013352191,0.0010263831,0.00061662117,0.0037748371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938455,0.0020195043,0.00057409727,0.0004550444,0.002715047,0.00039070696],"domain_scores_gemma":[0.97145534,0.020364793,0.0012527144,0.004698836,0.0019032027,0.0003251958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00634384,0.0009152601,0.0014427217,0.0021846262,0.0012870915,0.0037906815,0.003918842,0.0013847076,0.004022679],"category_scores_gemma":[0.030140286,0.0017217835,0.0013686559,0.003544172,0.001820722,0.011179602,0.0060804696,0.0030768232,0.0005407703],"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.0011763124,0.00043156563,0.0062392727,0.0010574205,0.000442155,0.0013787984,0.0015051094,0.0812142,0.012878025,0.31955197,0.014659418,0.5594657],"study_design_scores_gemma":[0.000112806876,0.00012045242,0.00046849772,0.00013191317,0.0002715661,0.0008911372,0.00045807203,0.4298597,0.017072052,0.5383002,0.012241467,0.000072200324],"about_ca_topic_score_codex":0.0009954614,"about_ca_topic_score_gemma":0.0013761183,"teacher_disagreement_score":0.00634384,"about_ca_system_score_codex":0.0007452722,"about_ca_system_score_gemma":0.0011730108,"threshold_uncertainty_score":0.033549845},"labels":[],"label_agreement":null},{"id":"W1508197973","doi":"10.1007/978-3-540-25959-6_23","title":"Local Specification of Surface Subdivision Algorithms","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Computer science; Subdivision; Polygon mesh; Polygon (computer graphics); Algorithm; Executable; Search engine indexing; Theoretical computer science; Graph; Programming language; Computer graphics (images); Artificial intelligence","score_opus":0.011448164076852394,"score_gpt":0.23916935260410815,"score_spread":0.22772118852725576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508197973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060188994,0.0004513957,0.97898316,0.000053277265,0.000033711196,0.000020850826,0.000053679047,0.00073574146,0.013649325],"genre_scores_gemma":[0.28747258,0.0014178451,0.65704435,0.00014542865,0.000088811474,0.00027262582,0.0007560983,0.0015227877,0.05127944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995596,0.000076997916,0.000023711771,0.000048445552,0.00025319392,0.00003798048],"domain_scores_gemma":[0.9995408,0.00012206492,0.000026876267,0.00017738795,0.00010844635,0.000024386783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046716255,0.0005049771,0.00073660817,0.0006625619,0.00036132472,0.0012775084,0.0013758602,0.00053756655,0.0063746334],"category_scores_gemma":[0.0010481246,0.0004394228,0.0005406255,0.0010040781,0.0007835739,0.0015066621,0.0013433044,0.0016378632,0.00245878],"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.00006196968,0.00004732622,0.00026069419,0.00030726864,0.000014006798,0.00007865593,0.00026904722,0.042509936,0.049407236,0.63380486,0.008572655,0.26466644],"study_design_scores_gemma":[0.00003254517,0.00010893612,0.00042276803,0.00014009555,0.000037519036,0.00050753646,0.00012683027,0.51692605,0.061194234,0.30167824,0.11878276,0.00004244905],"about_ca_topic_score_codex":0.00054427213,"about_ca_topic_score_gemma":0.0010897149,"teacher_disagreement_score":0.0063746334,"about_ca_system_score_codex":0.0006134093,"about_ca_system_score_gemma":0.0004541416,"threshold_uncertainty_score":0.02132523},"labels":[],"label_agreement":null},{"id":"W1508209142","doi":"10.1007/11682462_19","title":"An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Center (category theory); Algorithm","score_opus":0.014278715443344983,"score_gpt":0.23335263578960325,"score_spread":0.21907392034625828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508209142","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.01291823,0.00032489296,0.9782429,0.0003592174,0.00013486431,0.0002058992,0.00019512503,0.0009980473,0.0066208476],"genre_scores_gemma":[0.05731536,0.00015667932,0.937948,0.00012618217,0.000092602015,0.00023942247,0.00041752853,0.00031746924,0.0033869036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898726,0.00022211656,0.000060706032,0.00028441913,0.00024263987,0.00020284246],"domain_scores_gemma":[0.9982956,0.0010242609,0.00009986077,0.00020838472,0.00021992126,0.00015197514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014597825,0.0014435394,0.002399454,0.0014781852,0.0012434296,0.0026422057,0.0036022384,0.0027946916,0.015334056],"category_scores_gemma":[0.0045597893,0.001076533,0.0015440468,0.0027682446,0.0011197291,0.0042861197,0.0031257563,0.0028845295,0.0021774399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067819766,0.0006852216,0.00064119225,0.00050865236,0.000093800765,0.00010651221,0.00033753563,0.3527397,0.0056044282,0.111602694,0.026815219,0.50018686],"study_design_scores_gemma":[0.00020575125,0.000091263784,0.00016763006,0.000033132987,0.000028013925,0.00007190487,0.00007551111,0.9078592,0.0011777753,0.086108185,0.004160539,0.000021070211],"about_ca_topic_score_codex":0.0052189818,"about_ca_topic_score_gemma":0.0076361946,"teacher_disagreement_score":0.015334056,"about_ca_system_score_codex":0.0021323813,"about_ca_system_score_gemma":0.002349156,"threshold_uncertainty_score":0.051297545},"labels":[],"label_agreement":null},{"id":"W1508212832","doi":"10.1007/978-3-540-24840-8_12","title":"Towards Efficient Training on Large Datasets for Genetic Programming","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Machine learning; Artificial intelligence; Selection (genetic algorithm); Matching (statistics); Hierarchy; Focus (optics); Overhead (engineering); Set (abstract data type); Process (computing); Training set; Data mining","score_opus":0.0262054816399336,"score_gpt":0.27646971505370405,"score_spread":0.25026423341377046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508212832","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.034571167,0.0005952115,0.95410484,0.00082962733,0.00013491935,0.00023431754,0.00057729386,0.005752465,0.0032001294],"genre_scores_gemma":[0.0984716,0.0002305156,0.89554715,0.00045126647,0.000092677044,0.00045123702,0.00191763,0.0006363871,0.0022016393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841905,0.0007113846,0.00009803241,0.00030345246,0.00034263532,0.00012539433],"domain_scores_gemma":[0.99118865,0.0061976374,0.00024169372,0.0014058659,0.0007760701,0.00019008009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032958838,0.0017804606,0.0019535637,0.0015215143,0.0009331937,0.0020035878,0.004022696,0.0034285139,0.005338129],"category_scores_gemma":[0.017429203,0.0016212628,0.0018125759,0.0024952237,0.0011761234,0.0032602204,0.0031842086,0.0057646064,0.0022162127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027362525,0.0002830581,0.001994651,0.00022756678,0.00017023252,0.00013116331,0.00017118687,0.6465417,0.0034370085,0.010029147,0.016912375,0.31982827],"study_design_scores_gemma":[0.000034357956,0.00001833732,0.00013822799,0.000013075404,0.000009477587,0.000012566952,0.000021601245,0.98803407,0.0005455396,0.010389463,0.0007798494,0.0000034604334],"about_ca_topic_score_codex":0.0060735284,"about_ca_topic_score_gemma":0.010799936,"teacher_disagreement_score":0.0060735284,"about_ca_system_score_codex":0.0013254761,"about_ca_system_score_gemma":0.0016887882,"threshold_uncertainty_score":0.01785785},"labels":[],"label_agreement":null},{"id":"W1508354613","doi":"10.1007/11764298_10","title":"Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Locality; Computer science; Locality of reference; Information retrieval; Operating system","score_opus":0.02173025080978708,"score_gpt":0.25813699526109396,"score_spread":0.23640674445130688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508354613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039918153,0.0005678946,0.984106,0.00046056442,0.00012072405,0.00011164319,0.00029722383,0.00220569,0.00813834],"genre_scores_gemma":[0.13860486,0.0013455742,0.83085334,0.00036020728,0.00036855807,0.0006908155,0.00117104,0.0010367209,0.025568845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983486,0.00049913855,0.00014370403,0.00027935387,0.0005098615,0.00021941107],"domain_scores_gemma":[0.99708587,0.000981017,0.0002411527,0.00087744335,0.00045231788,0.00036222613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017529716,0.0007329523,0.0011694117,0.0025785791,0.003499244,0.0066715665,0.0044777486,0.0024066668,0.013402833],"category_scores_gemma":[0.0061932104,0.00084847596,0.0013453477,0.0048400573,0.0026259217,0.0119462805,0.0062283985,0.0021630155,0.0051013916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011033072,0.000056462777,0.0003903142,0.0002400081,0.000028611377,0.0001690808,0.0009205672,0.018682815,0.0019888245,0.8856925,0.013489106,0.07823136],"study_design_scores_gemma":[0.000051325693,0.00008376856,0.0001676425,0.00008551512,0.00006682185,0.0002416056,0.00056015374,0.14937864,0.0032412673,0.7460442,0.100001045,0.000077924065],"about_ca_topic_score_codex":0.0042716507,"about_ca_topic_score_gemma":0.0063876,"teacher_disagreement_score":0.013402833,"about_ca_system_score_codex":0.0013414219,"about_ca_system_score_gemma":0.0020094833,"threshold_uncertainty_score":0.04483688},"labels":[],"label_agreement":null},{"id":"W1508400884","doi":"10.1007/11428862_80","title":"An Algebraic Method for Analyzing Open-Loop Dynamic Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modeling and Simulation Systems","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":"Western University","funders":"","keywords":"Computer science; Trigonometry; Dynamical systems theory; Differential equation; Set (abstract data type); Differential algebraic equation; Computation; Symbolic computation; Polynomial; Applied mathematics; Algebraic equation; Maple; Trigonometric functions; Algebraic number; Algebra over a field; Algorithm; Ordinary differential equation; Mathematics; Mathematical analysis; Nonlinear system; Pure mathematics; Programming language","score_opus":0.03557486228146416,"score_gpt":0.33260024334388283,"score_spread":0.29702538106241866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508400884","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.0010688845,0.000089644505,0.99632335,0.00001859158,0.000026558064,0.000018075825,0.000017239967,0.00008781786,0.0023498454],"genre_scores_gemma":[0.23159799,0.0011415738,0.7501995,0.000118365024,0.00031508217,0.00036413665,0.00018685828,0.00020419271,0.01587236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.00009447271,0.000025596317,0.000065677916,0.00019530296,0.000022274931],"domain_scores_gemma":[0.99942017,0.0003267672,0.00004809329,0.000055926368,0.00012718195,0.000021922438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005989208,0.0008824441,0.0008473037,0.0009740085,0.0006556754,0.0010274976,0.0010795107,0.00049630716,0.0046930076],"category_scores_gemma":[0.0015405692,0.00036024078,0.0009850472,0.0007654856,0.000985996,0.0014347784,0.0011172646,0.0015779487,0.0010962277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007328646,0.000102579834,0.00044813962,0.00046889982,0.00008690955,0.00022342498,0.0003704707,0.16698407,0.018120842,0.61706805,0.0027777804,0.19327557],"study_design_scores_gemma":[0.000020716458,0.000103888866,0.00017805227,0.000033067634,0.000045283647,0.00014505535,0.000050168142,0.7393275,0.0022087577,0.24514188,0.012718757,0.000026903877],"about_ca_topic_score_codex":0.001244669,"about_ca_topic_score_gemma":0.0016813227,"teacher_disagreement_score":0.0046930076,"about_ca_system_score_codex":0.0003817511,"about_ca_system_score_gemma":0.00056598114,"threshold_uncertainty_score":0.015699625},"labels":[],"label_agreement":null},{"id":"W1508458705","doi":"10.1007/11766247_13","title":"On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality (philosophy); Artificial intelligence; Theoretical computer science","score_opus":0.05624935494597458,"score_gpt":0.3175180439768304,"score_spread":0.26126868903085587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508458705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13426879,0.007268319,0.8311091,0.0069802287,0.00039732925,0.00018225874,0.0005987786,0.00071121205,0.018483927],"genre_scores_gemma":[0.9153781,0.0022400212,0.0732747,0.000871091,0.00071385223,0.00030848844,0.0004891446,0.0007088866,0.006015706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9873198,0.008711986,0.0005290901,0.0009213874,0.0018520455,0.0006656154],"domain_scores_gemma":[0.70388067,0.27632537,0.0064597563,0.006145169,0.004182638,0.0030063584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026727939,0.0014226916,0.0046529453,0.0032658968,0.0014160116,0.0052380986,0.004147514,0.004352287,0.0071913498],"category_scores_gemma":[0.1556743,0.0024024895,0.002172518,0.0043256,0.008433404,0.0105230175,0.004303274,0.005836659,0.00035965504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056697364,0.00009198789,0.002359378,0.00037554093,0.0002001865,0.00007803293,0.00028716074,0.49114048,0.00067829195,0.4858411,0.0030819695,0.015298883],"study_design_scores_gemma":[0.00006403945,0.00007042774,0.0005715411,0.00006408918,0.000036633348,0.00003113916,0.0000330063,0.6231365,0.0001741696,0.37545153,0.00034027948,0.000026579039],"about_ca_topic_score_codex":0.0038910913,"about_ca_topic_score_gemma":0.004362502,"teacher_disagreement_score":0.026727939,"about_ca_system_score_codex":0.0051088505,"about_ca_system_score_gemma":0.002371884,"threshold_uncertainty_score":0.1413526},"labels":[],"label_agreement":null},{"id":"W1508484846","doi":"10.1007/11863939_22","title":"The Spatial Dimensions of Multi-Criteria Evaluation – Case Study of a Home Buyer’s Spatial Decision Support System","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision support system; Outcome (game theory); Spatial relationship; Spatial decision support system; Operations research; Decision model; Decision analysis; Data mining; Artificial intelligence; Machine learning; Statistics; Mathematics","score_opus":0.0375738332022336,"score_gpt":0.3265594311125151,"score_spread":0.2889855979102815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508484846","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.9234697,0.0006604647,0.04441966,0.00077021174,0.000024422041,0.00021200387,0.00009423032,0.000023285545,0.030326001],"genre_scores_gemma":[0.98366356,0.00014893412,0.014203088,0.000016669817,0.0000054590273,0.000037610538,0.000024092284,0.000005360572,0.0018951452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645543,0.0026431251,0.0000944979,0.000115383446,0.00049393595,0.00019767726],"domain_scores_gemma":[0.99237716,0.006475577,0.00021466026,0.00017179751,0.0005350535,0.00022564379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004276559,0.0004880634,0.0006227084,0.0014712099,0.0015812936,0.002750489,0.0009421002,0.0015308682,0.003057244],"category_scores_gemma":[0.005569685,0.00033970506,0.00094313297,0.0025054263,0.0016243351,0.0018883789,0.001374377,0.00097363,0.00015317807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027152407,0.002522841,0.03967419,0.0012450635,0.00041130435,0.012476108,0.013218106,0.49837303,0.014970771,0.19336542,0.004711144,0.21631676],"study_design_scores_gemma":[0.00022885442,0.0019581222,0.025563719,0.00025737545,0.00031670372,0.0020899398,0.023773555,0.86200297,0.012941485,0.05779001,0.012884849,0.00019244076],"about_ca_topic_score_codex":0.011362962,"about_ca_topic_score_gemma":0.01193599,"teacher_disagreement_score":0.011362962,"about_ca_system_score_codex":0.0032234339,"about_ca_system_score_gemma":0.0014002469,"threshold_uncertainty_score":0.02338779},"labels":[],"label_agreement":null},{"id":"W1508512701","doi":"10.1007/978-3-642-12659-8_25","title":"Hybrid MPI-Cell Parallelism for Hyperbolic PDE Simulation on a Cell Processor Cluster","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parallel computing; Computer science; Xeon; Xeon Phi; Message Passing Interface; x86; Multi-core processor; Cluster (spacecraft); Computational science; Message passing; Software","score_opus":0.021844110716396307,"score_gpt":0.28597173015391675,"score_spread":0.26412761943752044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508512701","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.3527018,0.0007170544,0.57829857,0.0007196632,0.00032912972,0.00015424895,0.00068373344,0.0052176844,0.06117809],"genre_scores_gemma":[0.8227728,0.00020654283,0.16331671,0.000109168715,0.000062346,0.00019266143,0.0006590997,0.000509701,0.012170884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980336,0.000037370497,0.000007326148,0.00001901908,0.00010204174,0.00003094311],"domain_scores_gemma":[0.9996486,0.00010177522,0.000013066645,0.00009257111,0.000100732344,0.000043275508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020848613,0.00041153963,0.000674416,0.000263395,0.00086202606,0.0007944552,0.0019167991,0.0006268385,0.004513009],"category_scores_gemma":[0.0006572514,0.00034284196,0.00044531754,0.00083762256,0.00041590867,0.0006172165,0.0010965008,0.00086573185,0.0010000122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006115325,0.00023475512,0.0020788286,0.0001521782,0.000117852964,0.0003254466,0.00029196026,0.85184443,0.02742143,0.036725942,0.009389171,0.070806436],"study_design_scores_gemma":[0.000041528885,0.000037448408,0.00024649664,0.0000027552471,0.000006796922,0.000019727677,0.00001825316,0.9893895,0.003384941,0.0052497084,0.001594259,0.000008545788],"about_ca_topic_score_codex":0.004349083,"about_ca_topic_score_gemma":0.004671929,"teacher_disagreement_score":0.004513009,"about_ca_system_score_codex":0.00043771477,"about_ca_system_score_gemma":0.00077207375,"threshold_uncertainty_score":0.015097499},"labels":[],"label_agreement":null},{"id":"W1508543649","doi":"10.1007/978-3-540-30470-8_12","title":"Knowledge Signatures for Information Integration","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Guelph","funders":"","keywords":"Computer science; Information integration; Data science; Data integration; Sorting; Information retrieval; Semantics (computer science); World Wide Web; Data mining","score_opus":0.019243485725599103,"score_gpt":0.2621367415426968,"score_spread":0.24289325581709767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508543649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034328953,0.0022441386,0.96962386,0.0011452514,0.00045871703,0.00017354851,0.00051516434,0.003613326,0.018792992],"genre_scores_gemma":[0.11476879,0.0024900388,0.8554039,0.00066586805,0.0004740106,0.0004081553,0.002770319,0.00085929123,0.022159657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958112,0.0011277428,0.00055949745,0.00070706673,0.0015551049,0.0002393725],"domain_scores_gemma":[0.9959306,0.0012352753,0.00017704703,0.0019101277,0.00063221477,0.00011475317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003269857,0.0009584045,0.0020183367,0.0035449886,0.0018479985,0.0064461874,0.00276875,0.0022064974,0.009890841],"category_scores_gemma":[0.007662031,0.0009641438,0.0015729151,0.005777085,0.0029449277,0.018535323,0.0053735008,0.0035341613,0.0056824307],"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.000070838825,0.000060728536,0.00013667608,0.00019292644,0.000036134003,0.00009496856,0.00020993936,0.0027627714,0.00089211256,0.72412866,0.012254346,0.25915977],"study_design_scores_gemma":[0.000011410612,0.000012855728,0.000048978596,0.00007641595,0.000027971324,0.00011404885,0.00007200095,0.02096689,0.002011634,0.9329398,0.043699082,0.00001882252],"about_ca_topic_score_codex":0.0012155719,"about_ca_topic_score_gemma":0.0010455372,"teacher_disagreement_score":0.009890841,"about_ca_system_score_codex":0.0018502938,"about_ca_system_score_gemma":0.0018245226,"threshold_uncertainty_score":0.033088207},"labels":[],"label_agreement":null},{"id":"W1508622259","doi":"10.1007/978-3-540-30570-5_18","title":"Authorization Views and Conditional Query Containment","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Materialized view; Containment (computer programming); Conjunctive query; Set (abstract data type); Rewriting; Query optimization; Authorization; Sargable; Information retrieval; Query language; Database; Theoretical computer science; View; Web search query; Programming language; Relational database; Database design; Computer security; Search engine","score_opus":0.019063616121367036,"score_gpt":0.24916421490669946,"score_spread":0.23010059878533243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508622259","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.0072395387,0.0019609837,0.9563076,0.003175296,0.00023193513,0.00014851635,0.00040077398,0.0018998584,0.028635463],"genre_scores_gemma":[0.44413576,0.003499449,0.5217761,0.0021350023,0.0012589224,0.00063234416,0.0029781007,0.0012432757,0.022341061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98609924,0.005448941,0.0009238135,0.0016030684,0.004821821,0.0011030886],"domain_scores_gemma":[0.97896576,0.014334069,0.0008064475,0.0039329412,0.0015398889,0.00042096252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008891036,0.0013287384,0.0018125656,0.0024901337,0.0027292324,0.009063076,0.0037147244,0.0026603078,0.010459216],"category_scores_gemma":[0.024094004,0.0018800918,0.0021253242,0.00369669,0.008022886,0.02484279,0.0071854116,0.0077341665,0.0021287978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068174275,0.000025540938,0.00013225789,0.000066512766,0.000021558493,0.00010472892,0.00044344782,0.0024165032,0.0005526427,0.97046596,0.005170171,0.020532578],"study_design_scores_gemma":[0.00002437,0.000010722865,0.00006540173,0.000035065197,0.000032078515,0.00016048836,0.00010599109,0.019473018,0.0014715622,0.96680194,0.011795868,0.00002343814],"about_ca_topic_score_codex":0.0053315302,"about_ca_topic_score_gemma":0.0032483758,"teacher_disagreement_score":0.010459216,"about_ca_system_score_codex":0.002881033,"about_ca_system_score_gemma":0.002159962,"threshold_uncertainty_score":0.047020853},"labels":[],"label_agreement":null},{"id":"W1508786042","doi":"10.1007/978-3-642-19440-5_17","title":"Debugging in Domain-Specific Modelling","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Debugging; Computer science; Domain (mathematical analysis); Scope (computer science); Algorithmic program debugging; Software engineering; Context (archaeology); Programming language; Obstacle; Software; Background debug mode interface","score_opus":0.027728326485949684,"score_gpt":0.22126255697681527,"score_spread":0.19353423049086557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508786042","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.0051143314,0.00057807594,0.98898333,0.0002670555,0.000039895323,0.000034671637,0.000028065366,0.0017921916,0.0031624408],"genre_scores_gemma":[0.24614231,0.0014293522,0.74568796,0.00022847834,0.00006442125,0.00011091131,0.00033195596,0.0010328301,0.0049718046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99500555,0.0026794462,0.00039328536,0.0005758133,0.0011187268,0.00022717848],"domain_scores_gemma":[0.98079747,0.012548004,0.0005870263,0.0051150494,0.0007796005,0.00017279384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006855293,0.001157869,0.0012070404,0.001142382,0.0006737309,0.002893176,0.002737627,0.0018794413,0.003463267],"category_scores_gemma":[0.025642766,0.0016107998,0.0012156848,0.0013834593,0.0024729585,0.0070975646,0.0028786696,0.0036390855,0.0007923409],"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.00015221737,0.00012777004,0.0019532677,0.00096309633,0.00011179642,0.00050500646,0.0014510173,0.10820682,0.0038053836,0.52376956,0.0051358696,0.3538182],"study_design_scores_gemma":[0.0000434155,0.000044790155,0.00034898927,0.00041954228,0.00010558639,0.00056188897,0.00015608019,0.44237065,0.0116244545,0.5150913,0.029193504,0.000039799786],"about_ca_topic_score_codex":0.001342931,"about_ca_topic_score_gemma":0.0018695678,"teacher_disagreement_score":0.006855293,"about_ca_system_score_codex":0.0010639264,"about_ca_system_score_gemma":0.0013496502,"threshold_uncertainty_score":0.036254704},"labels":[],"label_agreement":null},{"id":"W1508788505","doi":"10.1007/978-3-642-17358-5_58","title":"Exploring Simulation-Based Configuration Decisions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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 Alberta","funders":"","keywords":"Computer science; Adaptation (eye); Distributed computing; Cloud computing; Set (abstract data type); Service (business); Component (thermodynamics); Server; Operating system","score_opus":0.06373092709520724,"score_gpt":0.27810059036032136,"score_spread":0.21436966326511414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508788505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45854956,0.00084684265,0.48402196,0.0017771935,0.00010240002,0.00013285485,0.00032211858,0.00093473686,0.053312298],"genre_scores_gemma":[0.955583,0.00018730505,0.04214789,0.00005188605,0.000012270692,0.00004026875,0.00016061237,0.000090791356,0.0017260073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991229,0.0005555967,0.000023017985,0.000104780076,0.00010834437,0.000085358246],"domain_scores_gemma":[0.98896724,0.010188798,0.00018995872,0.00031869888,0.00020176909,0.0001335813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017046559,0.0007468594,0.0007536027,0.00084493624,0.00058900943,0.0021993301,0.0013052312,0.0015081535,0.010942204],"category_scores_gemma":[0.014274887,0.0009038136,0.00077431253,0.0009828003,0.0010601262,0.003297095,0.0012560298,0.0012592425,0.00045247303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019219014,0.00010905849,0.0011397009,0.00006302979,0.00003357606,0.000103693135,0.00017072223,0.9428215,0.00062456506,0.033939604,0.00074883894,0.020053525],"study_design_scores_gemma":[0.000011808965,0.000017336266,0.00010458976,0.00001010795,0.000007570498,0.000011280396,0.000048781734,0.9752373,0.00017413359,0.024084562,0.00028697043,0.0000055511796],"about_ca_topic_score_codex":0.0055121016,"about_ca_topic_score_gemma":0.0059153433,"teacher_disagreement_score":0.010942204,"about_ca_system_score_codex":0.001110779,"about_ca_system_score_gemma":0.0011153537,"threshold_uncertainty_score":0.0366053},"labels":[],"label_agreement":null},{"id":"W1508839005","doi":"10.1007/978-3-540-85230-8_4","title":"An Efficient Deniable Key Exchange Protocol (Extended Abstract)","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Computer science; Key (lock); Key exchange; Protocol (science); Computer security; Oakley protocol; Secure channel; Property (philosophy); Cryptographic protocol; Computer network; Public-key cryptography; Cryptography; Encryption","score_opus":0.01851223929371503,"score_gpt":0.2670871109191254,"score_spread":0.24857487162541037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508839005","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.011249686,0.000815326,0.9638638,0.001077769,0.00060923345,0.00027696905,0.0003607257,0.0014729304,0.020273643],"genre_scores_gemma":[0.34752518,0.0020979152,0.5651885,0.0011660765,0.0004861994,0.00081867084,0.001694033,0.00061400345,0.08040938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891925,0.0002605713,0.000073171745,0.00018267127,0.0004358333,0.00012860916],"domain_scores_gemma":[0.99912256,0.0002655235,0.00005260739,0.0003794804,0.00014561036,0.000034096804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999208,0.00066616596,0.000736664,0.0004807131,0.00072402495,0.0022057751,0.0015174955,0.0012433793,0.009336478],"category_scores_gemma":[0.00243919,0.00046897185,0.0005644748,0.00097022834,0.0011551941,0.0044069677,0.0029852435,0.0019661384,0.0039745118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048846373,0.00017261604,0.00015162163,0.00039452882,0.00004124942,0.0003241345,0.00019934737,0.015493129,0.020676704,0.80849385,0.020742383,0.132822],"study_design_scores_gemma":[0.00028477376,0.00023435587,0.00026878645,0.000101666286,0.00008395284,0.00079178123,0.000062490275,0.14396398,0.023624307,0.71607625,0.11442748,0.00008022104],"about_ca_topic_score_codex":0.00038661622,"about_ca_topic_score_gemma":0.0004964364,"teacher_disagreement_score":0.009336478,"about_ca_system_score_codex":0.0006711486,"about_ca_system_score_gemma":0.0009730987,"threshold_uncertainty_score":0.031233609},"labels":[],"label_agreement":null},{"id":"W1508989754","doi":"10.1007/978-3-642-12519-5_5","title":"WiFi Miner: An Online Apriori-Infrequent Based Wireless Intrusion System","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 Windsor","funders":"","keywords":"Computer science; Network packet; Apriori algorithm; Association rule learning; Intrusion detection system; Wireless; Wireless network; Computer network; Data mining; A priori and a posteriori; Wireless sensor network; Anomaly detection; Telecommunications","score_opus":0.017405219724057064,"score_gpt":0.23118823006452044,"score_spread":0.21378301034046338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508989754","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.04748742,0.0022505973,0.85999405,0.0005460043,0.0003479609,0.0004734037,0.003579228,0.08115739,0.0041639786],"genre_scores_gemma":[0.24644753,0.0008043154,0.73603356,0.00051521027,0.00024187061,0.0004013099,0.0051916423,0.0010121497,0.009352441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.00010664604,0.000085472624,0.00021123349,0.00035953417,0.000052152787],"domain_scores_gemma":[0.99863845,0.0006205883,0.00014227255,0.0003131915,0.00020629351,0.00007914191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012268131,0.0012006419,0.001698395,0.0020985752,0.00060233776,0.0009906264,0.0032281133,0.00091882155,0.0042320415],"category_scores_gemma":[0.0036132452,0.0007614655,0.00067531265,0.0014533887,0.0002988122,0.002512116,0.0019569714,0.0010559421,0.0020675038],"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.0016395213,0.0005766535,0.008765873,0.0004231705,0.0004672613,0.00050438166,0.000110581976,0.021962881,0.021830082,0.0029048948,0.041626543,0.89918816],"study_design_scores_gemma":[0.00027722828,0.0006775218,0.002575123,0.00003521179,0.00018875925,0.0016515085,0.00006321425,0.9369051,0.027086105,0.0084690545,0.021985754,0.000085407264],"about_ca_topic_score_codex":0.0014053495,"about_ca_topic_score_gemma":0.0030719084,"teacher_disagreement_score":0.0042320415,"about_ca_system_score_codex":0.00030810476,"about_ca_system_score_gemma":0.000712739,"threshold_uncertainty_score":0.014157593},"labels":[],"label_agreement":null},{"id":"W1509016053","doi":"10.1007/11512622_17","title":"CORDIC-Augmented Sandbridge Processor for Channel Equalization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Channel (broadcasting); Set (abstract data type); Equalization (audio); Orthogonal frequency-division multiplexing; Scheme (mathematics); Multiplexing; Parallel computing; Computer hardware; Instruction set; Rotation (mathematics); Arithmetic; Field-programmable gate array; Telecommunications; Mathematics; Programming language; Artificial intelligence","score_opus":0.032232120048418786,"score_gpt":0.3016480154376967,"score_spread":0.2694158953892779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509016053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021235177,0.00066141796,0.94624346,0.00023883708,0.00044614004,0.00007865067,0.00015143697,0.004688946,0.02625594],"genre_scores_gemma":[0.32468185,0.0007899567,0.5895576,0.00067072874,0.00035205024,0.00012882942,0.000676906,0.00029396333,0.082848206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998852,0.000021574757,0.0000065193412,0.000017133087,0.000051533076,0.000018069377],"domain_scores_gemma":[0.9998423,0.000026694805,0.000008123757,0.000044699504,0.00006752932,0.000010565177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015172803,0.00047928604,0.0003856886,0.00029977036,0.00040217035,0.00062142126,0.0006247507,0.000556521,0.02223087],"category_scores_gemma":[0.0004679588,0.00014981127,0.0001963505,0.00042820827,0.00020133753,0.0005896897,0.0005623555,0.0005798485,0.004979507],"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.00076372386,0.00013067744,0.0004609458,0.00019349283,0.00006132121,0.00029757607,0.00010053087,0.023716934,0.108440086,0.039990567,0.027463648,0.79838043],"study_design_scores_gemma":[0.00015347908,0.00064157124,0.0009361293,0.00011161762,0.00014165662,0.001368693,0.00007913803,0.685765,0.17642291,0.021383537,0.11293243,0.00006390483],"about_ca_topic_score_codex":0.0009827745,"about_ca_topic_score_gemma":0.004023592,"teacher_disagreement_score":0.02223087,"about_ca_system_score_codex":0.0002735964,"about_ca_system_score_gemma":0.0006559748,"threshold_uncertainty_score":0.07436967},"labels":[],"label_agreement":null},{"id":"W1509040261","doi":"10.1007/3-540-36110-3_14","title":"Performance Study of COPS over TLS and IPsec Secure Session","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IPv6, Mobility, Handover, Networks, Security","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":"Université du Québec à Montréal","funders":"","keywords":"IPsec; Computer science; Encryption; Computer network; Session (web analytics); Session key; Authentication (law); Computer security; Throughput; Access control; Operating system; World Wide Web; Wireless; The Internet","score_opus":0.010195535392104235,"score_gpt":0.2128890544377811,"score_spread":0.20269351904567687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509040261","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.98503786,0.00088427437,0.00601201,0.00021231815,0.00008057473,0.000054912674,0.00036568183,0.0012638121,0.0060884957],"genre_scores_gemma":[0.9978067,0.000100045734,0.00076922553,0.000016669805,0.000016832895,0.0000095654905,0.00019535265,0.000050406426,0.0010352492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973883,0.0005491702,0.00011320679,0.00032100762,0.0008140953,0.0008142149],"domain_scores_gemma":[0.9802665,0.012250233,0.0010545834,0.0015281886,0.0039968668,0.0009036447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021049909,0.00061577844,0.00081149966,0.0011584802,0.0009627811,0.001421818,0.00089418143,0.00060970144,0.0056381593],"category_scores_gemma":[0.009587562,0.0001992403,0.0002611719,0.001284017,0.00071298936,0.0012667062,0.00062650285,0.0005812933,0.0007051431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.039845698,0.0022195878,0.050570656,0.0011050324,0.0006643179,0.0013390136,0.0012646782,0.44924998,0.15908054,0.015846727,0.025567029,0.25324678],"study_design_scores_gemma":[0.00021510264,0.0034327116,0.016472341,0.00003486421,0.00026006234,0.00047848065,0.00062970206,0.9106301,0.06403712,0.0012435808,0.0025085136,0.000057434794],"about_ca_topic_score_codex":0.0074738925,"about_ca_topic_score_gemma":0.0034971002,"teacher_disagreement_score":0.0074738925,"about_ca_system_score_codex":0.002200091,"about_ca_system_score_gemma":0.0012552141,"threshold_uncertainty_score":0.018861473},"labels":[],"label_agreement":null},{"id":"W1509041598","doi":"10.1007/978-3-540-39899-8_46","title":"Temporal Lobe Epilepsy Lateralization Based on MR Image Intensity and Registration Features","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Epilepsy research and treatment","field":"Medicine","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"Canadian Institutes of Health Research","keywords":"Lateralization of brain function; Temporal lobe; Linear discriminant analysis; Artificial intelligence; Pattern recognition (psychology); Computer science; Focus (optics); Segmentation; Context (archaeology); Lobe; Epilepsy; Neuroscience; Psychology; Medicine; Anatomy; Physics","score_opus":0.01827916902087217,"score_gpt":0.2788091463589658,"score_spread":0.26052997733809363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509041598","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.59120876,0.0031851642,0.36232722,0.0005528101,0.00013123444,0.00022071638,0.0008327397,0.0015502183,0.03999126],"genre_scores_gemma":[0.9233804,0.0016388743,0.065167695,0.00008624926,0.00011956369,0.00010023579,0.0006472373,0.00024372948,0.008616007],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9999125,0.000017388038,0.000006884842,0.000017423927,0.000033757453,0.000012013884],"domain_scores_gemma":[0.9998323,0.000076980665,0.000033171455,0.000013542525,0.000032405915,0.000011586818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035496624,0.00033439588,0.00023715633,0.00097359205,0.00009065194,0.0005122782,0.00019884347,0.00022509032,0.002830876],"category_scores_gemma":[0.0007027535,0.00012819814,0.0003190077,0.00039686923,0.00022966212,0.0005408592,0.00026989312,0.00015653498,0.001247037],"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.0011304421,0.000057146277,0.026283411,0.00022629657,0.00016748814,0.0010378596,0.00019383141,0.0070933425,0.34262848,0.003380572,0.004686357,0.6131148],"study_design_scores_gemma":[0.00020015168,0.0012898527,0.3617765,0.0002488008,0.00076791435,0.029228311,0.0007994482,0.29472238,0.2637153,0.018705847,0.028241022,0.0003045494],"about_ca_topic_score_codex":0.0003269126,"about_ca_topic_score_gemma":0.0010221837,"teacher_disagreement_score":0.002830876,"about_ca_system_score_codex":0.00008691637,"about_ca_system_score_gemma":0.00013568759,"threshold_uncertainty_score":0.009470165},"labels":[],"label_agreement":null},{"id":"W1509042120","doi":"10.1007/978-3-540-74800-7_39","title":"Towards a Physiological Model of User Interruptability","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Variety (cybernetics); Human–computer interaction; Reading (process); Variance (accounting); Word (group theory); Speech recognition; Artificial intelligence","score_opus":0.3415904467854146,"score_gpt":0.428969382341892,"score_spread":0.08737893555647741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509042120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031033875,0.000789951,0.9338806,0.0019531348,0.00022236217,0.00009860057,0.0002744113,0.0005727254,0.031174343],"genre_scores_gemma":[0.85606647,0.0015723179,0.1238263,0.0006606244,0.00042477789,0.00049682276,0.00031820798,0.00023376795,0.016400699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996587,0.00009867579,0.000023837038,0.000102169724,0.0000789901,0.000037605787],"domain_scores_gemma":[0.99894017,0.00062195864,0.00006793234,0.0001101083,0.00017916472,0.00008071091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008190006,0.0007465773,0.0005582657,0.0006290223,0.00043029943,0.0022946084,0.0019766674,0.001438301,0.004794728],"category_scores_gemma":[0.002873942,0.0004727679,0.00085566053,0.00038983105,0.000989601,0.0028274811,0.0011444554,0.0017432433,0.0015162951],"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.00014413105,0.00047844928,0.0057843276,0.00034673544,0.00016720546,0.0004634,0.001991173,0.20184784,0.026980301,0.67721105,0.0052760732,0.07930929],"study_design_scores_gemma":[0.000024847817,0.00012988878,0.00402136,0.00006283941,0.000058554622,0.00027979774,0.00024665572,0.6645343,0.0017077941,0.32336405,0.005522709,0.000047249607],"about_ca_topic_score_codex":0.0016586011,"about_ca_topic_score_gemma":0.0008511568,"teacher_disagreement_score":0.004794728,"about_ca_system_score_codex":0.0007452484,"about_ca_system_score_gemma":0.0007468616,"threshold_uncertainty_score":0.016039908},"labels":[],"label_agreement":null},{"id":"W1509148430","doi":"10.1007/978-3-642-00672-2_2","title":"Towards Multi-modal Extraction and Summarization of Conversations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Automatic summarization; Computer science; Modal; Extraction (chemistry); Artificial intelligence; Natural language processing; Information retrieval","score_opus":0.016167516616110152,"score_gpt":0.27943726872154373,"score_spread":0.2632697521054336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509148430","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.009323706,0.0010660004,0.97001845,0.0005110019,0.00018251647,0.0002556957,0.005496458,0.009765598,0.0033804711],"genre_scores_gemma":[0.0706796,0.00093811046,0.8912251,0.00017172896,0.0002896317,0.00036715763,0.028132645,0.0011821685,0.0070138727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779546,0.0006655671,0.00024717205,0.0006376946,0.00045881994,0.00019531579],"domain_scores_gemma":[0.9951302,0.0021330423,0.00039034383,0.0007497797,0.0014331498,0.00016350906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017269982,0.0017862618,0.0014585054,0.004743241,0.0015551997,0.003828366,0.0021851792,0.0014432913,0.00842386],"category_scores_gemma":[0.005876476,0.00090261956,0.0022204015,0.0034842105,0.00054155535,0.004014844,0.00308378,0.002539242,0.008942336],"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.0004957831,0.00016909861,0.00096787635,0.0014511473,0.00018332634,0.00034807032,0.0019261335,0.005534572,0.06282947,0.016395206,0.037731804,0.8719674],"study_design_scores_gemma":[0.00011695816,0.0003517709,0.0062669055,0.00061931845,0.0007307909,0.0010832237,0.0038469802,0.53423715,0.1454222,0.12635425,0.18073025,0.00024019137],"about_ca_topic_score_codex":0.0024010136,"about_ca_topic_score_gemma":0.004505905,"teacher_disagreement_score":0.00842386,"about_ca_system_score_codex":0.0008742969,"about_ca_system_score_gemma":0.0015668028,"threshold_uncertainty_score":0.028180659},"labels":[],"label_agreement":null},{"id":"W1509190515","doi":"10.1007/978-3-540-24677-0_87","title":"Integrating Web Services and Agent Technology for E-learning Course Content Maintenance","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Athabasca University","funders":"","keywords":"Hyperlink; Computer science; World Wide Web; Web service; Web page; Web modeling; Web development; User agent; Multimedia; Multi-agent system; The Internet; Artificial intelligence","score_opus":0.018109565143448605,"score_gpt":0.25036107163631266,"score_spread":0.23225150649286405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509190515","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.03246047,0.0036712473,0.9146572,0.0018604816,0.00042077992,0.00020253363,0.00008001797,0.0060295328,0.04061785],"genre_scores_gemma":[0.35123792,0.0035139828,0.6036446,0.000343912,0.00026452166,0.00013388428,0.00042197376,0.0009209989,0.03951819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913067,0.00018201966,0.000063479776,0.00006592334,0.00047899433,0.000078864396],"domain_scores_gemma":[0.9990632,0.0003386391,0.00005776522,0.00021218976,0.00023813991,0.00009005559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010847579,0.00040862002,0.00040625597,0.0011859315,0.00051534525,0.00239977,0.0012573897,0.0011817074,0.003425249],"category_scores_gemma":[0.002537669,0.00045314492,0.00050569244,0.0014989361,0.00041975852,0.002762857,0.0012051672,0.0010293777,0.0023076585],"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.00018442418,0.0003625906,0.0012193095,0.00024827925,0.00007407313,0.0002834943,0.00026477344,0.01088508,0.025978561,0.040096235,0.0116501395,0.9087531],"study_design_scores_gemma":[0.00015528312,0.00040111397,0.003133524,0.00031297083,0.00036080487,0.0018740601,0.0005072747,0.45754284,0.07994581,0.14757922,0.308082,0.00010503525],"about_ca_topic_score_codex":0.003076449,"about_ca_topic_score_gemma":0.0031306883,"teacher_disagreement_score":0.003425249,"about_ca_system_score_codex":0.0005692442,"about_ca_system_score_gemma":0.0009546012,"threshold_uncertainty_score":0.011458576},"labels":[],"label_agreement":null},{"id":"W1509214810","doi":"10.1007/978-3-642-04417-5_12","title":"Time-Sensitive Language Modelling for Online Term Recurrence Prediction","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Université de Montréal","funders":"","keywords":"Term (time); Computer science; Point (geometry); Language model; Machine learning; Artificial intelligence; Data mining; Information retrieval","score_opus":0.02000752572108192,"score_gpt":0.2541830932252973,"score_spread":0.2341755675042154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509214810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024384065,0.00086948415,0.97158563,0.0004222754,0.000101996804,0.00004506926,0.00045255193,0.001359886,0.0007791791],"genre_scores_gemma":[0.7797697,0.0014667164,0.20140816,0.00036145726,0.00038328965,0.00035787292,0.002198573,0.00046068334,0.013593569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890137,0.0004741686,0.00007951056,0.0002151965,0.00019138641,0.00013832521],"domain_scores_gemma":[0.9918611,0.0067482986,0.00037716996,0.0004542268,0.0004359028,0.00012321891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003243892,0.0008873643,0.001638009,0.0011341706,0.00057632657,0.0013643119,0.0022174898,0.0013947901,0.0032334693],"category_scores_gemma":[0.010328704,0.0006651569,0.0014165525,0.0014657695,0.00053795666,0.0021051632,0.001261049,0.0028015955,0.0019209471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036379302,0.00020894402,0.0016911841,0.00016731056,0.00015523996,0.00018105167,0.0001718412,0.81196517,0.0039659855,0.03158219,0.0040786117,0.14546876],"study_design_scores_gemma":[0.0000026184418,0.0000068417266,0.000061482475,0.000003499114,0.0000073558886,0.000009568266,0.0000026913922,0.9947201,0.00021171468,0.0048480094,0.00012187574,0.000004249984],"about_ca_topic_score_codex":0.0074961493,"about_ca_topic_score_gemma":0.008731807,"teacher_disagreement_score":0.0074961493,"about_ca_system_score_codex":0.00079896016,"about_ca_system_score_gemma":0.0010203292,"threshold_uncertainty_score":0.017155528},"labels":[],"label_agreement":null},{"id":"W1509362770","doi":"10.1007/978-3-642-15470-6_35","title":"Robust and Efficient Change Detection Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","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 Windsor","funders":"","keywords":"Change detection; Computer science; Pixel; Fault detection and isolation; Artificial intelligence; Image (mathematics); Algorithm; Noise (video); Vulnerability (computing); Range (aeronautics); Ranging; Pattern recognition (psychology); Data mining; Engineering; Computer security; Telecommunications","score_opus":0.025052075932205223,"score_gpt":0.21195256873821108,"score_spread":0.18690049280600585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509362770","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.005674442,0.00046196635,0.99020445,0.000084446474,0.000115216775,0.000055339373,0.00011176004,0.0017206285,0.0015717539],"genre_scores_gemma":[0.06463055,0.00040157625,0.9247334,0.00012225026,0.00010904648,0.00009932299,0.00069381786,0.00026009363,0.008949942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992077,0.00006460209,0.000041700303,0.00022491992,0.00039501488,0.0000661013],"domain_scores_gemma":[0.9993783,0.00012792229,0.00005011874,0.00016481768,0.0002567978,0.00002193095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005989972,0.00091515115,0.0015045116,0.0017458999,0.00051381125,0.0010476605,0.0016503172,0.0012095154,0.004531651],"category_scores_gemma":[0.001255375,0.0005759488,0.0010355045,0.0016095572,0.0004093163,0.0012351573,0.001070463,0.0009763672,0.0034603588],"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.00014699253,0.000088516186,0.00047592397,0.00009863766,0.00007130221,0.00007874655,0.00002811645,0.01923499,0.059073713,0.0044298847,0.007963073,0.90831],"study_design_scores_gemma":[0.000038126873,0.00013765295,0.0026747908,0.00001800797,0.0001126368,0.0006782401,0.0000259158,0.89051324,0.07543327,0.0050763893,0.02523008,0.0000616196],"about_ca_topic_score_codex":0.0016748363,"about_ca_topic_score_gemma":0.0026086743,"teacher_disagreement_score":0.004531651,"about_ca_system_score_codex":0.00039901107,"about_ca_system_score_gemma":0.0007975002,"threshold_uncertainty_score":0.015159905},"labels":[],"label_agreement":null},{"id":"W1509407365","doi":"10.1007/978-3-642-11503-5_15","title":"Lazy Combinators for Executable Specifications of General Attribute Grammars","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Programming language; Executable; Combinatory logic; L-attributed grammar; Rule-based machine translation; Parsing; Context-free grammar; Parsing expression grammar; S-attributed grammar; Definite clause grammar; Theoretical computer science; Natural language processing","score_opus":0.045408896168309364,"score_gpt":0.28497265485952317,"score_spread":0.2395637586912138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509407365","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.014881098,0.00031167213,0.9712468,0.00021610073,0.00009008127,0.00014636353,0.00031563666,0.0030322901,0.009759988],"genre_scores_gemma":[0.36379233,0.0010515812,0.60609746,0.0002543114,0.00018221849,0.00077331223,0.0016111342,0.004018782,0.022218896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965928,0.00074531976,0.0005223453,0.00045566913,0.0013238407,0.00035995347],"domain_scores_gemma":[0.9944352,0.0033161636,0.00033565832,0.0012235814,0.0005085991,0.00018085905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033923313,0.001321819,0.0017085895,0.0018003793,0.0015307099,0.0050690495,0.002345318,0.0016058626,0.008993177],"category_scores_gemma":[0.007644177,0.0021476215,0.003083789,0.0020744987,0.0046997326,0.0072327023,0.0034556398,0.0046938276,0.0029017339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083512365,0.00003834981,0.00028612246,0.00017874376,0.000025474325,0.00020288926,0.0006626048,0.007791486,0.0028391655,0.9580651,0.0014492039,0.028377445],"study_design_scores_gemma":[0.00004454106,0.000021696856,0.00007470927,0.000054415217,0.000036163132,0.00010815527,0.00008678717,0.019506378,0.004619312,0.965393,0.010007842,0.000046839294],"about_ca_topic_score_codex":0.0016404086,"about_ca_topic_score_gemma":0.0027851295,"teacher_disagreement_score":0.008993177,"about_ca_system_score_codex":0.0025288332,"about_ca_system_score_gemma":0.0020928623,"threshold_uncertainty_score":0.030085206},"labels":[],"label_agreement":null},{"id":"W1509417623","doi":"10.1007/11844662_10","title":"Hybrid Authorizations and Conflict Resolution","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authorization; Resolution (logic); Conflict resolution; Artificial intelligence; Computer security; Law; Political science","score_opus":0.02010642636598903,"score_gpt":0.27594696403446173,"score_spread":0.2558405376684727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509417623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016980723,0.0017922628,0.90421706,0.0020927265,0.00040098123,0.0001282497,0.00011618326,0.000502303,0.07376942],"genre_scores_gemma":[0.6727468,0.0015579636,0.2731144,0.0004810561,0.00040497087,0.00035602556,0.0003422676,0.00019778081,0.050798755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969298,0.0014976958,0.00023587479,0.00039817634,0.000681877,0.00025649375],"domain_scores_gemma":[0.9935823,0.004186831,0.00030626936,0.0012891919,0.00044414704,0.00019117563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003869202,0.0007132983,0.00085857284,0.0010788101,0.001688662,0.004438297,0.0018567955,0.0014333724,0.012844803],"category_scores_gemma":[0.008648691,0.00069223385,0.0009532529,0.001766865,0.004315452,0.0097917225,0.0033657104,0.0032099949,0.0015362026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050392344,0.00003159481,0.00010747598,0.0000685162,0.000024939287,0.00007554585,0.00034497035,0.0056969966,0.000600732,0.94543445,0.0028625284,0.044701926],"study_design_scores_gemma":[0.000013009185,0.000009360456,0.000036212696,0.000015025948,0.000011189545,0.00007893198,0.00007752276,0.024403282,0.00055405585,0.96733487,0.007455782,0.000010881684],"about_ca_topic_score_codex":0.00088034326,"about_ca_topic_score_gemma":0.00065097597,"teacher_disagreement_score":0.012844803,"about_ca_system_score_codex":0.0012456321,"about_ca_system_score_gemma":0.0009551503,"threshold_uncertainty_score":0.04297012},"labels":[],"label_agreement":null},{"id":"W1509427512","doi":"10.1007/978-3-540-30494-4_4","title":"A Methodology for the Formal Verification of FFT Algorithms in HOL","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fast Fourier transform; Mathematical proof; Computer science; Algorithm; Automated theorem proving; Split-radix FFT algorithm; Fixed point; Proof assistant; Formal verification; Arithmetic; Mathematics; Theoretical computer science; Programming language; Fourier transform; Fourier analysis","score_opus":0.0689537982563607,"score_gpt":0.3314530027488482,"score_spread":0.26249920449248754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509427512","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.001649202,0.00009163002,0.9934269,0.00014832578,0.0000790221,0.000069726324,0.0000671135,0.0015377259,0.0029303422],"genre_scores_gemma":[0.17577696,0.0004510742,0.8138077,0.0004085271,0.00025233423,0.00044730297,0.00048203886,0.0016917685,0.0066822576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950912,0.0015882322,0.0005957189,0.0006156506,0.0016281481,0.00048104822],"domain_scores_gemma":[0.98776346,0.0073016877,0.00041429294,0.0030273343,0.0013060054,0.0001872723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005324659,0.0012104784,0.0011488484,0.0016855603,0.001852555,0.0040985686,0.0039247544,0.0016195617,0.01244674],"category_scores_gemma":[0.017896833,0.0012916063,0.0031513253,0.0010920491,0.005515294,0.007975622,0.0050054016,0.004460242,0.002647024],"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.000088338646,0.000086874585,0.0004358354,0.00036643157,0.000057280085,0.00021922006,0.0006008125,0.012738417,0.0043306155,0.9104606,0.0036576628,0.0669579],"study_design_scores_gemma":[0.000082124774,0.000069282476,0.00020198867,0.00016459585,0.00008019206,0.00023462872,0.00014553014,0.07381945,0.01365356,0.8828569,0.028628709,0.000063047526],"about_ca_topic_score_codex":0.0026304764,"about_ca_topic_score_gemma":0.002499582,"teacher_disagreement_score":0.01244674,"about_ca_system_score_codex":0.0016904789,"about_ca_system_score_gemma":0.0022965174,"threshold_uncertainty_score":0.041638494},"labels":[],"label_agreement":null},{"id":"W1509506019","doi":"10.1007/978-3-642-10604-0_12","title":"The Effect of Malformed Tiles on Tile Assemblies within kTAM","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","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":"Queen's University","funders":"","keywords":"Tile; Proofreading; Computer science; Process (computing); Set (abstract data type); Algorithm; Physics; Materials science; Programming language; Composite material","score_opus":0.006523897551624642,"score_gpt":0.2580347333005606,"score_spread":0.25151083574893596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509506019","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.9706345,0.0013803622,0.017878257,0.00022198471,0.0005211507,0.000027782682,0.00014748427,0.0009855516,0.00820281],"genre_scores_gemma":[0.9908824,0.00020835023,0.0037982117,0.00007935173,0.000020893747,0.000012308517,0.00013302431,0.0003040607,0.0045613996],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991013,0.00008397659,0.000050786348,0.00016315424,0.00036311516,0.00023770265],"domain_scores_gemma":[0.9974929,0.0008781461,0.00041683702,0.000577288,0.00030937078,0.00032552305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056050636,0.00043488145,0.0006283548,0.00028858113,0.0010453535,0.0015814677,0.0007946849,0.0008284087,0.0066703153],"category_scores_gemma":[0.0027342518,0.0007599971,0.00045541316,0.00037466435,0.0008850544,0.0012461785,0.0012511732,0.001233665,0.0017632272],"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.00076512963,0.00008597311,0.0017485503,0.00023927787,0.000049920585,0.0008001325,0.0004111667,0.022817926,0.9556063,0.0026407698,0.0008694589,0.013965436],"study_design_scores_gemma":[0.00002903573,0.0003750337,0.004344176,0.000023946175,0.00006720663,0.00043125666,0.00035354646,0.028211173,0.9607042,0.001255314,0.0041656527,0.000039300965],"about_ca_topic_score_codex":0.0008518529,"about_ca_topic_score_gemma":0.0011754435,"teacher_disagreement_score":0.0066703153,"about_ca_system_score_codex":0.00044932766,"about_ca_system_score_gemma":0.00031089224,"threshold_uncertainty_score":0.022314489},"labels":[],"label_agreement":null},{"id":"W1509525110","doi":"10.1007/978-3-540-70569-7_28","title":"Task Model Refinement with Meta Operators","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Concordia University","funders":"","keywords":"Computer science; Equivalence (formal languages); Task (project management); Model transformation; Transformation (genetics); Software engineering; Programming language; User interface; Relation (database); Data mining; Systems engineering; Artificial intelligence","score_opus":0.04236297868629113,"score_gpt":0.24600493875946972,"score_spread":0.20364196007317859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509525110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00236734,0.000050124443,0.99230814,0.00007891054,0.000035661098,0.00011030802,0.00015784704,0.0017600178,0.0031316283],"genre_scores_gemma":[0.10384661,0.00014481963,0.88406163,0.0001238925,0.000026934362,0.00033819495,0.0010521698,0.0014179626,0.00898781],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963773,0.0010402383,0.00033610765,0.0007787382,0.0012072887,0.00026036694],"domain_scores_gemma":[0.9938455,0.0021045315,0.000234097,0.002645937,0.0010449082,0.00012493128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041232305,0.0013794255,0.00087799266,0.0014659768,0.00071152387,0.0018025305,0.0025943753,0.0010281776,0.010790134],"category_scores_gemma":[0.015026444,0.0011095046,0.0025379092,0.0011937005,0.0010674649,0.004632435,0.0038529614,0.0028112438,0.0034208293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009098351,0.0003726965,0.001870883,0.00093207497,0.00021006186,0.00032656593,0.0021329203,0.060718745,0.032774158,0.2158056,0.019199127,0.6647473],"study_design_scores_gemma":[0.00014889843,0.0002309935,0.0006911856,0.00032339437,0.00027055075,0.00034477262,0.00055054325,0.6006973,0.046535406,0.27800813,0.0721139,0.000085001026],"about_ca_topic_score_codex":0.0051948163,"about_ca_topic_score_gemma":0.0065923166,"teacher_disagreement_score":0.010790134,"about_ca_system_score_codex":0.00076450076,"about_ca_system_score_gemma":0.0023484195,"threshold_uncertainty_score":0.036096632},"labels":[],"label_agreement":null},{"id":"W1509526046","doi":"10.1007/10722280_10","title":"The Engineering of a CG-Based System: Fundamental Issues","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Université Laval","funders":"","keywords":"Computer science; Interpretability; Software portability; Scope (computer science); Conceptual graph; Knowledge base; Knowledge representation and reasoning; Simplicity; Software engineering; Scalability; Context (archaeology); Knowledge management; Data science; Systems engineering; Artificial intelligence; Programming language; Engineering","score_opus":0.011079958799707537,"score_gpt":0.21759418769295688,"score_spread":0.20651422889324933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509526046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008464786,0.0007329624,0.9637657,0.0014835554,0.0001716113,0.00007001534,0.000057717418,0.00032818422,0.02492551],"genre_scores_gemma":[0.6185644,0.0018455889,0.35392004,0.00061511237,0.0003891228,0.0002249582,0.0001481219,0.00023442111,0.024058176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992055,0.00014000102,0.000036490463,0.00017688372,0.00037186497,0.00006931333],"domain_scores_gemma":[0.9990024,0.00042216168,0.00005109747,0.00023081823,0.00023033423,0.00006318782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064865325,0.0004095739,0.00082248007,0.0003986894,0.0007556868,0.0030110332,0.0018169942,0.0022919844,0.0077435323],"category_scores_gemma":[0.00295361,0.00040950908,0.0004520581,0.0007794711,0.0020824187,0.0031447292,0.0015141035,0.0017727695,0.0016074813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053813077,0.000084873434,0.00046525593,0.0002737909,0.000024562372,0.0001715763,0.00023380798,0.098177515,0.0121701965,0.7685951,0.0034926075,0.11625701],"study_design_scores_gemma":[0.000023616138,0.00013737775,0.00049645506,0.00007644502,0.00002550522,0.00033988676,0.00011113958,0.37223387,0.0075304373,0.58516437,0.03381708,0.00004391225],"about_ca_topic_score_codex":0.002050725,"about_ca_topic_score_gemma":0.0013084343,"teacher_disagreement_score":0.0077435323,"about_ca_system_score_codex":0.0011505367,"about_ca_system_score_gemma":0.0012192864,"threshold_uncertainty_score":0.025904715},"labels":[],"label_agreement":null},{"id":"W1509528270","doi":"10.1007/3-540-45084-x_13","title":"Accurate Numerical Fourier Transform in d-Dimensions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Filter Design and Implementation","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":"Western University","funders":"","keywords":"Computer science; Fourier transform; Discrete Fourier transform (general); Algorithm; Fractional Fourier transform; Fourier analysis; Mathematical analysis; Mathematics","score_opus":0.030574989884896334,"score_gpt":0.27505480608183724,"score_spread":0.24447981619694092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509528270","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.0031526124,0.00072687597,0.9793905,0.00023228828,0.00034338137,0.000014577203,0.00007496967,0.000590844,0.015474003],"genre_scores_gemma":[0.13098687,0.0019070171,0.83164287,0.00032295176,0.00020677084,0.000107768086,0.0003342595,0.00084396935,0.03364745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995327,0.00008958939,0.000031003463,0.000026503974,0.00029381874,0.000026452866],"domain_scores_gemma":[0.9991359,0.00034744875,0.00003305696,0.000258812,0.00020466553,0.00002015583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071716163,0.0006793827,0.00078003365,0.0008138873,0.00039694208,0.001475518,0.0008086983,0.0010964929,0.009696815],"category_scores_gemma":[0.0027255022,0.00038247745,0.00041778447,0.0011468584,0.00065514137,0.0021478802,0.0011015508,0.0014078725,0.0037124893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014292156,0.000046411435,0.00028404326,0.00041986036,0.000042931177,0.00019679399,0.00023620605,0.14546135,0.019139703,0.59161866,0.019452354,0.22295871],"study_design_scores_gemma":[0.000024628873,0.000018995454,0.0001346583,0.00006999292,0.000012712896,0.00022527248,0.000047847378,0.8494601,0.010642181,0.10062716,0.038710456,0.000026038417],"about_ca_topic_score_codex":0.0009893347,"about_ca_topic_score_gemma":0.0011746298,"teacher_disagreement_score":0.009696815,"about_ca_system_score_codex":0.0004817002,"about_ca_system_score_gemma":0.00043654887,"threshold_uncertainty_score":0.032439053},"labels":[],"label_agreement":null},{"id":"W1509531246","doi":"10.1007/978-3-540-78913-0_19","title":"Determinisation of Relational Substitutions in Ordered Categories with Domain","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Morphism; Unification; Domain (mathematical analysis); Determinacy; Mathematics; Pure mathematics; Computer science; Algebra over a field; Programming language","score_opus":0.024075083541933023,"score_gpt":0.23212488030982273,"score_spread":0.2080497967678897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509531246","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.10298404,0.0022222945,0.82400715,0.001541639,0.00058192725,0.00014207262,0.00032507165,0.0017959654,0.06639981],"genre_scores_gemma":[0.8100556,0.0009779856,0.15817524,0.0005018726,0.0003902256,0.00017423232,0.00048706567,0.00070100615,0.028536739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960769,0.0010221812,0.00035739623,0.00084199815,0.0011472357,0.0005541848],"domain_scores_gemma":[0.99515617,0.0029830248,0.0002055573,0.0009427039,0.0005317608,0.00018081488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032737043,0.0004868683,0.0011271391,0.0015770654,0.0022425395,0.004359802,0.0019189854,0.0015908238,0.0051464275],"category_scores_gemma":[0.006780212,0.0015299437,0.0024428836,0.0014956198,0.005281777,0.009422065,0.004411353,0.0050859405,0.0011776014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004931744,0.000016105687,0.00015963499,0.00005084138,0.000012019529,0.000059043043,0.00043538827,0.0011515729,0.0011511177,0.9848006,0.0006835142,0.011430925],"study_design_scores_gemma":[0.000012991406,0.00001192991,0.00009671871,0.000018940025,0.00001325871,0.0000775133,0.00009259167,0.0039948593,0.002348861,0.98861,0.0047017243,0.000020617754],"about_ca_topic_score_codex":0.0012557158,"about_ca_topic_score_gemma":0.0016476804,"teacher_disagreement_score":0.0051464275,"about_ca_system_score_codex":0.002357751,"about_ca_system_score_gemma":0.0019882775,"threshold_uncertainty_score":0.017313242},"labels":[],"label_agreement":null},{"id":"W1509582226","doi":"10.1007/978-3-540-24596-4_47","title":"Crafting Data Structures: A Study of Reference Locality in Refinement-Based Pathfinding","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Locality; Computer science; Locality of reference; Compiler; Pathfinding; CAS latency; Exploit; Data structure; Parallel computing; Transformation (genetics); Theoretical computer science; Algorithm; Programming language; Memory controller; Computer hardware; Cache","score_opus":0.06679665395620887,"score_gpt":0.3025072823659228,"score_spread":0.2357106284097139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509582226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06843002,0.0011945681,0.92426544,0.0004895657,0.000029022674,0.00009518364,0.0000786794,0.00066656695,0.004750995],"genre_scores_gemma":[0.46816838,0.0013650204,0.52292466,0.00013063647,0.000067306406,0.00014045462,0.0003512623,0.00062345294,0.0062288544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974062,0.0008941674,0.0001751402,0.00047723958,0.0007814664,0.000265874],"domain_scores_gemma":[0.9628322,0.02559512,0.0018919659,0.0071070385,0.0022122485,0.0003613681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044385563,0.0005170918,0.0018104764,0.0028140522,0.0021899357,0.002517866,0.004733376,0.0019632287,0.0042002313],"category_scores_gemma":[0.038222406,0.0011175494,0.0012110503,0.0068324567,0.0049553043,0.010786348,0.0033600114,0.0026057444,0.00055707194],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027040078,0.00012007192,0.0036127868,0.00053585175,0.000063169995,0.00020366588,0.0028519498,0.12100144,0.0055604815,0.6555537,0.0031067056,0.2071198],"study_design_scores_gemma":[0.00003933165,0.00018104348,0.0007553773,0.00010256503,0.00009806574,0.000258876,0.00080825813,0.48104516,0.007328965,0.50304997,0.0062702606,0.00006214189],"about_ca_topic_score_codex":0.011715083,"about_ca_topic_score_gemma":0.011178058,"teacher_disagreement_score":0.011715083,"about_ca_system_score_codex":0.0016669662,"about_ca_system_score_gemma":0.0023003707,"threshold_uncertainty_score":0.02347356},"labels":[],"label_agreement":null},{"id":"W1509639927","doi":"10.1007/978-3-642-15711-0_74","title":"A Texton-Based Approach for the Classification of Lung Parenchyma in CT Images","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Chronic Obstructive Pulmonary Disease (COPD) Research","field":"Medicine","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Technische Universiteit Delft; Strategiske Forskningsråd; AstraZeneca","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Histogram; Support vector machine; Kernel (algebra); Representation (politics); Gaussian function; Gaussian; Binary classification; Computer vision; Mathematics; Image (mathematics)","score_opus":0.023909673836053358,"score_gpt":0.3200178051395072,"score_spread":0.29610813130345387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509639927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061603975,0.0020598096,0.9209309,0.00060150237,0.00057558366,0.0005364996,0.0020903703,0.0067447326,0.00485652],"genre_scores_gemma":[0.24390458,0.0014727579,0.7340575,0.00047184728,0.000573268,0.00045210356,0.004709291,0.0005340623,0.013824622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989698,0.00011731247,0.0001278928,0.00020467717,0.0004627361,0.00011750785],"domain_scores_gemma":[0.99848455,0.00048497657,0.00010755166,0.00014715016,0.0006609525,0.00011473692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011207365,0.0012432063,0.0013313505,0.006077378,0.000826534,0.0021816345,0.0017340726,0.0018576434,0.0059753037],"category_scores_gemma":[0.0018604447,0.0002985428,0.001405563,0.0036253694,0.00059832854,0.001946306,0.0011504195,0.0008192917,0.0032091297],"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.000722855,0.00023673386,0.002258081,0.00029190528,0.00012216141,0.00025417318,0.00011522841,0.0046198107,0.07126939,0.0016924788,0.007788941,0.9106283],"study_design_scores_gemma":[0.00011539237,0.00055077637,0.012908005,0.00015923797,0.00039786362,0.0016085465,0.0003920767,0.87949145,0.07402574,0.009288185,0.020909278,0.0001533876],"about_ca_topic_score_codex":0.0046869917,"about_ca_topic_score_gemma":0.006427847,"teacher_disagreement_score":0.006077378,"about_ca_system_score_codex":0.0007545311,"about_ca_system_score_gemma":0.00076654623,"threshold_uncertainty_score":0.019989371},"labels":[],"label_agreement":null},{"id":"W1509683276","doi":"10.1007/11823728_3","title":"Bulk Loading a Linear Hash File","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Hash function; Sorting; Random access; Torrent file; File size; Parallel computing; Hash table; Function (biology); Algorithm; Operating system; Computer file; Stub file","score_opus":0.01642191192339765,"score_gpt":0.22295529304888698,"score_spread":0.20653338112548933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509683276","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.11267882,0.0010256311,0.5960032,0.0012354453,0.0011804434,0.0012758678,0.014135913,0.14248879,0.12997584],"genre_scores_gemma":[0.46095467,0.0006482026,0.2937516,0.00061071827,0.0005512746,0.0006456927,0.018861653,0.010398743,0.21357751],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925107,0.000052517298,0.000047331585,0.00014003838,0.00035458006,0.00015449109],"domain_scores_gemma":[0.996326,0.0006626648,0.000093573384,0.0021409492,0.0005980276,0.00017871599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171692,0.0010229977,0.0011298438,0.0011703706,0.0011843967,0.0021183053,0.0018211572,0.00090511056,0.07992626],"category_scores_gemma":[0.0025611753,0.000705045,0.00053242414,0.0025555014,0.0006664254,0.0044815824,0.0029268486,0.00088126055,0.035074383],"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.0032656032,0.0004914264,0.0024705983,0.0008654835,0.000089188674,0.0004454154,0.0005374606,0.008442603,0.11236544,0.035392076,0.17346492,0.6621698],"study_design_scores_gemma":[0.00086003455,0.001284754,0.004875877,0.00020440102,0.00029785035,0.0016612465,0.0008808194,0.1855222,0.4386526,0.098133,0.26730797,0.00031922085],"about_ca_topic_score_codex":0.0019609074,"about_ca_topic_score_gemma":0.002177787,"teacher_disagreement_score":0.07992626,"about_ca_system_score_codex":0.0011766449,"about_ca_system_score_gemma":0.0013660437,"threshold_uncertainty_score":0.26737994},"labels":[],"label_agreement":null},{"id":"W1509686622","doi":"10.1007/11581741_22","title":"Horizontal Transformation of PSMs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Metamodeling; Transformation (genetics); Component (thermodynamics); Model transformation; JavaBeans; Software engineering; Programming language; Program transformation; Net (polyhedron); Artificial intelligence; Java","score_opus":0.00897929902079007,"score_gpt":0.22289478488863293,"score_spread":0.21391548586784287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509686622","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.09941324,0.00020987733,0.65136945,0.00049460673,0.00037679693,0.00025121856,0.00083319226,0.0063334964,0.2407182],"genre_scores_gemma":[0.7727358,0.0003033029,0.108951166,0.00017014417,0.00011846324,0.00020194735,0.0015090645,0.0013925799,0.11461754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993795,0.000083552404,0.000034464843,0.00013580441,0.00021179188,0.00015486382],"domain_scores_gemma":[0.9993406,0.00010877966,0.000043405824,0.00028796692,0.00017540342,0.000043909313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538543,0.00036577074,0.0002512088,0.0008222488,0.00085817504,0.0017910558,0.00047281815,0.00041097097,0.029522045],"category_scores_gemma":[0.0013170682,0.00029682604,0.0005954709,0.0008789674,0.001023057,0.0024964486,0.0020250056,0.0010407314,0.0067072297],"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.000085070365,0.00005635079,0.0005718017,0.00007075202,0.0000135585415,0.0002333351,0.0006432137,0.0033318468,0.013095769,0.88909143,0.004620364,0.088186346],"study_design_scores_gemma":[0.000044705455,0.0000980896,0.0011856296,0.0000628062,0.000043585394,0.0002724417,0.0007154668,0.037184402,0.049168788,0.7733272,0.1378691,0.000027775199],"about_ca_topic_score_codex":0.0019779915,"about_ca_topic_score_gemma":0.001456461,"teacher_disagreement_score":0.029522045,"about_ca_system_score_codex":0.00079698546,"about_ca_system_score_gemma":0.000890662,"threshold_uncertainty_score":0.09876102},"labels":[],"label_agreement":null},{"id":"W1509725411","doi":"10.1007/978-3-642-01247-1_16","title":"The Reverse C10K Problem for Server-Side Mashups","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Saskatchewan","funders":"","keywords":"Computer science; Mashup; Operating system; The Internet","score_opus":0.011337728427489485,"score_gpt":0.23104865666793867,"score_spread":0.2197109282404492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509725411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17019577,0.0021683846,0.67437506,0.023809245,0.0010239946,0.0005060794,0.0016411882,0.0078007006,0.11847951],"genre_scores_gemma":[0.6917747,0.0011197096,0.24925497,0.0025223268,0.0005781578,0.00038129225,0.0025067395,0.0038029193,0.048059035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9862281,0.0024088202,0.00091440714,0.0022013613,0.0058973003,0.0023499702],"domain_scores_gemma":[0.9451514,0.026128307,0.0019231291,0.020040236,0.005467602,0.0012893153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007213615,0.0010259731,0.002127043,0.0010601293,0.0050026216,0.0063104704,0.004574077,0.008270964,0.015730767],"category_scores_gemma":[0.052821703,0.0015266496,0.0014781212,0.003232947,0.005136077,0.02284032,0.006447494,0.007176522,0.0049913907],"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.0010568339,0.00036937767,0.0015793967,0.0006818426,0.000073605974,0.0012158905,0.0012326211,0.027266275,0.008243109,0.63790405,0.082479574,0.23789749],"study_design_scores_gemma":[0.00017068954,0.000054701526,0.00051998347,0.00012561372,0.000046239536,0.0015350622,0.00097327225,0.14320426,0.013911273,0.80293643,0.036400903,0.000121667275],"about_ca_topic_score_codex":0.008135098,"about_ca_topic_score_gemma":0.0052536083,"teacher_disagreement_score":0.015730767,"about_ca_system_score_codex":0.0032848527,"about_ca_system_score_gemma":0.004233422,"threshold_uncertainty_score":0.052624643},"labels":[],"label_agreement":null},{"id":"W1509810984","doi":"10.1007/978-3-540-85988-8_122","title":"Left Ventricle Tracking Using Overlap Priors","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"London Health Sciences Centre; CARE Canada","funders":"","keywords":"Prior probability; Computer science; Bhattacharyya distance; Segmentation; Tracking (education); Artificial intelligence; Pattern recognition (psychology); Mathematics; Algorithm","score_opus":0.03638782582823399,"score_gpt":0.33152151935652524,"score_spread":0.2951336935282913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509810984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056637493,0.00021027031,0.9931218,0.00005256131,0.000017528835,0.000010293296,0.00003135103,0.00028615608,0.0006063025],"genre_scores_gemma":[0.21500081,0.00053098815,0.7786064,0.00014037598,0.00013584302,0.00009013207,0.00042690948,0.00058189663,0.0044866456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.00021890164,0.000032822394,0.00015417628,0.00020509343,0.00006530439],"domain_scores_gemma":[0.9980819,0.0011956199,0.00015389883,0.0002647324,0.00020266889,0.000101238475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018771967,0.0009569073,0.0014471931,0.0011061877,0.00061519974,0.00180163,0.0009902847,0.0019359952,0.00218567],"category_scores_gemma":[0.0046211584,0.001333448,0.00097200664,0.0010995609,0.0005893414,0.0018576682,0.0027086625,0.0014701022,0.0013740198],"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.0014147565,0.00015713289,0.002197935,0.00033207916,0.00045890902,0.00039825984,0.00029955793,0.28854036,0.078189835,0.025501275,0.0043131225,0.5981968],"study_design_scores_gemma":[0.000041523308,0.000052956282,0.0007699757,0.000024747358,0.00008028076,0.00027328523,0.000017306436,0.97077143,0.013559006,0.011672587,0.0027135203,0.000023397059],"about_ca_topic_score_codex":0.0019261661,"about_ca_topic_score_gemma":0.003290775,"teacher_disagreement_score":0.00218567,"about_ca_system_score_codex":0.00034791933,"about_ca_system_score_gemma":0.0010136178,"threshold_uncertainty_score":0.00992775},"labels":[],"label_agreement":null},{"id":"W1509846055","doi":"10.1007/978-3-642-30347-0_9","title":"Conflict-Free Graph Orientations with Parity Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Calgary","funders":"","keywords":"Multigraph; Combinatorics; Disjoint sets; Vertex (graph theory); Parity (physics); Mixed graph; Computer science; Graph; Discrete mathematics; Mathematics; Line graph; Voltage graph; Physics","score_opus":0.028985400351798023,"score_gpt":0.28937606847839104,"score_spread":0.260390668126593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509846055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10810256,0.0010818873,0.61337507,0.0020307424,0.0008331098,0.00032682926,0.0013935515,0.0009625859,0.27189374],"genre_scores_gemma":[0.659346,0.0017169387,0.26366535,0.0006407244,0.0003594282,0.00054351235,0.0020185318,0.00087345095,0.07083605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992624,0.00015892733,0.000037920192,0.00013110737,0.00024489386,0.00016472157],"domain_scores_gemma":[0.99813986,0.0008129214,0.00015721672,0.00036650882,0.00031474137,0.00020875517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781623,0.0009144694,0.0005461281,0.0009677159,0.0012987228,0.0022832148,0.0015731128,0.00094579475,0.014033833],"category_scores_gemma":[0.0036483728,0.0007548447,0.0007012662,0.0017018935,0.0017780369,0.0044321995,0.002117483,0.0029779293,0.0030410097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098055374,0.000056786204,0.00021585118,0.000117670264,0.000010211097,0.00015192923,0.00024469104,0.0053190463,0.0022644978,0.9426757,0.007912159,0.040933453],"study_design_scores_gemma":[0.000022697595,0.000011607733,0.000067356275,0.00002373168,0.000010074552,0.00011164905,0.00008741565,0.0069019906,0.0013768148,0.9800086,0.011365468,0.000012634511],"about_ca_topic_score_codex":0.0013011366,"about_ca_topic_score_gemma":0.0014959851,"teacher_disagreement_score":0.014033833,"about_ca_system_score_codex":0.00074854144,"about_ca_system_score_gemma":0.0011897474,"threshold_uncertainty_score":0.046947837},"labels":[],"label_agreement":null},{"id":"W1509859370","doi":"10.1007/978-3-540-74260-9_50","title":"A Simple Oriented Mean-Shift Algorithm for Tracking","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Robustness (evolution); Orientation (vector space); Mean-shift; Computer vision; Artificial intelligence; Algorithm; Representation (politics); Video tracking; Simple (philosophy); Tracking (education); Object (grammar); Pattern recognition (psychology); Mathematics","score_opus":0.03148190159444989,"score_gpt":0.314485504420953,"score_spread":0.2830036028265031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509859370","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.0017908431,0.000306333,0.99516875,0.000040630566,0.00017757707,0.000037850987,0.00005759264,0.0011853785,0.0012350432],"genre_scores_gemma":[0.01695766,0.0003569644,0.9760108,0.00008399859,0.00009161901,0.00007170385,0.00023346876,0.00022484826,0.005968891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996007,0.000036271278,0.000018142377,0.00010555177,0.00020677468,0.000032679553],"domain_scores_gemma":[0.99972373,0.00004774841,0.000014941243,0.00008199992,0.00010890069,0.00002272476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046351244,0.0009843998,0.0011183795,0.0010205003,0.00060429226,0.00093145005,0.0014393891,0.0012536967,0.00829383],"category_scores_gemma":[0.0009978267,0.00060659,0.0007089333,0.0018191861,0.00030656092,0.0011012161,0.0011103457,0.00096405053,0.008012422],"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.00014368739,0.00005754058,0.00021889307,0.00012668535,0.000057657526,0.00004535671,0.000028605464,0.0072303773,0.07425346,0.0063962643,0.0076380027,0.9038034],"study_design_scores_gemma":[0.00014497546,0.000334493,0.0023895612,0.00005835559,0.00021775645,0.0012821058,0.000043834883,0.7439548,0.12793745,0.022058826,0.10140814,0.00016969875],"about_ca_topic_score_codex":0.0022800441,"about_ca_topic_score_gemma":0.0043634158,"teacher_disagreement_score":0.00829383,"about_ca_system_score_codex":0.00039328905,"about_ca_system_score_gemma":0.00094612734,"threshold_uncertainty_score":0.027745664},"labels":[],"label_agreement":null},{"id":"W1509974289","doi":"10.1007/978-3-540-85035-9_17","title":"Between Mapping, Sonification and Composition: Responsive Audio Environments in Live Performance","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"Concordia University","funders":"","keywords":"Sonification; Computer science; Presentation (obstetrics); Human–computer interaction; Key (lock); Composition (language); Set (abstract data type); Domain (mathematical analysis); Relation (database); Data science; Multimedia; Data mining","score_opus":0.019138366145948674,"score_gpt":0.2269761552203613,"score_spread":0.20783778907441264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509974289","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.5089612,0.0017642902,0.3817241,0.0011648313,0.0003785484,0.00012748678,0.00009694891,0.0015783488,0.10420418],"genre_scores_gemma":[0.9608095,0.00030562282,0.02996343,0.00007958935,0.0000660974,0.00003709963,0.000044685574,0.00015134693,0.008542625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994438,0.00025550378,0.000011532354,0.000097496195,0.00012011385,0.00007151678],"domain_scores_gemma":[0.9991025,0.000559402,0.000053197913,0.000077794204,0.000085357395,0.00012177937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352282,0.0004987821,0.00025948338,0.00023087536,0.0007029411,0.0027125657,0.000683575,0.0009247199,0.00781438],"category_scores_gemma":[0.00325575,0.00030803925,0.00015463975,0.00023855967,0.0011996763,0.0025195875,0.0022313816,0.0007049415,0.0009606247],"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.0037777845,0.0005030207,0.00785765,0.0005882406,0.00009638721,0.0014468696,0.021925451,0.017687205,0.2586733,0.120162524,0.005359392,0.5619221],"study_design_scores_gemma":[0.00030861484,0.0027081098,0.03225922,0.0005024902,0.00034089017,0.00505446,0.04329508,0.282067,0.1683869,0.35251936,0.11217867,0.00037920798],"about_ca_topic_score_codex":0.00072067935,"about_ca_topic_score_gemma":0.0007449307,"teacher_disagreement_score":0.00781438,"about_ca_system_score_codex":0.00022898693,"about_ca_system_score_gemma":0.00034150857,"threshold_uncertainty_score":0.026141703},"labels":[],"label_agreement":null},{"id":"W1510033441","doi":"10.1007/978-3-540-68073-4_35","title":"Lightweight, Semi-automated Enactment of Pragmatic-Reuse Plans","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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 Calgary","funders":"","keywords":"Reuse; Computer science; Task (project management); Plan (archaeology); Software engineering; Process (computing); Code reuse; Code (set theory); Focus (optics); Source code; Human–computer interaction; Programming language; Software; Systems engineering","score_opus":0.013655363210843057,"score_gpt":0.24980066308453872,"score_spread":0.23614529987369565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510033441","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.014889665,0.00010333056,0.9685981,0.00019909718,0.00004760675,0.0002941952,0.00019665307,0.012241418,0.003429854],"genre_scores_gemma":[0.25566447,0.00014278048,0.73591936,0.00013109123,0.00004128432,0.00027966007,0.0009857219,0.0019748188,0.0048608226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98985296,0.0032999704,0.00067084376,0.0009298953,0.004498342,0.00074789906],"domain_scores_gemma":[0.9757858,0.011412622,0.0011803454,0.008742859,0.002426023,0.00045237254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006205031,0.0013850755,0.0012969286,0.0016052687,0.0012297865,0.0039433553,0.003061457,0.0017265109,0.006960156],"category_scores_gemma":[0.030460551,0.0015389161,0.0020540925,0.0010208698,0.0023892578,0.004427207,0.0074989283,0.0027229346,0.002925085],"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.0010162286,0.0005213613,0.003970472,0.0009094255,0.00026878336,0.0008311846,0.002977532,0.07903781,0.045358226,0.14809617,0.012786795,0.70422596],"study_design_scores_gemma":[0.000153588,0.0001964068,0.0013514254,0.00019118545,0.00016518398,0.00046750894,0.00075158774,0.6921553,0.074911945,0.2030247,0.026485037,0.00014610129],"about_ca_topic_score_codex":0.0054891314,"about_ca_topic_score_gemma":0.008169525,"teacher_disagreement_score":0.006960156,"about_ca_system_score_codex":0.0011480477,"about_ca_system_score_gemma":0.004321527,"threshold_uncertainty_score":0.032815754},"labels":[],"label_agreement":null},{"id":"W1510046324","doi":"10.1007/3-540-45068-8_82","title":"Partitioning the Navigational Model: A Component-Driven Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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","funders":"","keywords":"Computer science; Component (thermodynamics); Hypermedia; Abstraction; Hypertext; Perspective (graphical); Architecture; Basis (linear algebra); Human–computer interaction; Artificial intelligence; World Wide Web","score_opus":0.02587995343447813,"score_gpt":0.24374146492516885,"score_spread":0.21786151149069072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510046324","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.0056890724,0.00011740843,0.98961407,0.000087582834,0.000025843356,0.0001825989,0.00014097613,0.0016305451,0.0025119302],"genre_scores_gemma":[0.09695889,0.0003374754,0.8953567,0.0000837594,0.00002065033,0.00032921133,0.0009502169,0.0012161755,0.0047468636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982021,0.00046956315,0.000114198774,0.0002747241,0.00076767796,0.00017177322],"domain_scores_gemma":[0.9977458,0.0007550621,0.00008819529,0.00057429547,0.0007251776,0.000111369205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014280853,0.0014989019,0.0013331738,0.0018153664,0.0013071321,0.00369162,0.0035916702,0.0012773375,0.0052413195],"category_scores_gemma":[0.0052155517,0.0014649036,0.0020664905,0.0017732717,0.001093807,0.003969075,0.002139226,0.0017555401,0.0017419776],"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.00040577035,0.00047760236,0.003660265,0.0009113718,0.00029774077,0.0004337202,0.001520435,0.37777892,0.032456577,0.14078228,0.012843024,0.4284323],"study_design_scores_gemma":[0.00004567557,0.000095814954,0.00053109624,0.00011605049,0.00027703357,0.00021703885,0.00026122894,0.88036275,0.014861766,0.071749106,0.03139104,0.00009143678],"about_ca_topic_score_codex":0.0139373755,"about_ca_topic_score_gemma":0.021833276,"teacher_disagreement_score":0.0139373755,"about_ca_system_score_codex":0.0014059666,"about_ca_system_score_gemma":0.003330864,"threshold_uncertainty_score":0.027712524},"labels":[],"label_agreement":null},{"id":"W1510083871","doi":"10.1007/978-3-642-12200-2_4","title":"Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Kernelization; Dominating set; Connected dominating set; Combinatorics; Planar graph; Planar; Mathematics; Limit (mathematics); Graph; Set (abstract data type); Reduction (mathematics); Computer science; Kernel (algebra); Discrete mathematics; Vertex (graph theory)","score_opus":0.03497057844501919,"score_gpt":0.30016189911650626,"score_spread":0.2651913206714871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510083871","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.4971311,0.0033176932,0.35894483,0.0071851285,0.00043518373,0.000146233,0.0005527905,0.0008592624,0.13142784],"genre_scores_gemma":[0.9566785,0.000935331,0.0246703,0.00046881847,0.00023287814,0.00014954017,0.00032384897,0.0002546174,0.016286207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930954,0.00010623734,0.000038003294,0.00024780649,0.0001686998,0.00012968037],"domain_scores_gemma":[0.9946378,0.0030420166,0.00042733733,0.0006290546,0.0005644025,0.00069944205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087538763,0.0005010778,0.0015833963,0.0011008369,0.001700117,0.0028990004,0.0017242497,0.001419902,0.004063739],"category_scores_gemma":[0.0071292985,0.00066651334,0.0010203258,0.0011928088,0.0030614152,0.008450707,0.0026931316,0.0037392408,0.00048677923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013877283,0.0000586713,0.0007036907,0.00025549287,0.000037238482,0.0002121007,0.00041092528,0.0072883065,0.0031181527,0.96780807,0.004907576,0.015060983],"study_design_scores_gemma":[0.000022507973,0.000052045532,0.0004811903,0.000024856103,0.00003322319,0.00054417533,0.00020544085,0.033108067,0.0017135327,0.95982724,0.0039619915,0.000025712761],"about_ca_topic_score_codex":0.000762662,"about_ca_topic_score_gemma":0.0006300951,"teacher_disagreement_score":0.004063739,"about_ca_system_score_codex":0.0014479128,"about_ca_system_score_gemma":0.000494768,"threshold_uncertainty_score":0.013594508},"labels":[],"label_agreement":null},{"id":"W1510143805","doi":"10.1007/11618027_24","title":"Determining Empirical Characteristics of Mathematical Expression Use","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics Education and Pedagogy","field":"Mathematics","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":"Western University","funders":"","keywords":"Computer science; Expression (computer science); Programming language","score_opus":0.11286334084410579,"score_gpt":0.37081232375836565,"score_spread":0.25794898291425983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510143805","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.9920304,0.00010139307,0.0025461302,0.00004969438,0.0000026454616,0.000026840982,0.0004222343,0.000023357576,0.004797458],"genre_scores_gemma":[0.99828726,0.0000377042,0.00068547175,0.0000055195856,0.0000031291984,0.00003236392,0.000401803,0.000026258891,0.0005205288],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9961772,0.0017439729,0.00044690646,0.00050362374,0.0009036377,0.00022475114],"domain_scores_gemma":[0.76069295,0.20218953,0.017819144,0.010703137,0.006522477,0.0020727518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005065143,0.0002362572,0.0003313576,0.0030723829,0.00050138903,0.002507132,0.0008137407,0.0006994688,0.00900428],"category_scores_gemma":[0.10150396,0.00033586012,0.00049724616,0.0027805918,0.001258785,0.002798902,0.0014311342,0.0010858792,0.0013187546],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003376074,0.00013668323,0.9821031,0.000028337561,0.00007285337,0.000056751356,0.0015881598,0.00032139968,0.0011029398,0.0020826294,0.00016314173,0.012006407],"study_design_scores_gemma":[0.0000122974325,0.00014332944,0.9906295,0.000025944935,0.000047791542,0.00045968412,0.0018420019,0.0024177644,0.0011248062,0.0023521902,0.0009308138,0.000013853883],"about_ca_topic_score_codex":0.001186875,"about_ca_topic_score_gemma":0.00089869683,"teacher_disagreement_score":0.00900428,"about_ca_system_score_codex":0.00048305898,"about_ca_system_score_gemma":0.00049583643,"threshold_uncertainty_score":0.03012228},"labels":[],"label_agreement":null},{"id":"W1510216528","doi":"10.1007/11546245_4","title":"A Taxonomy of Cooperative Search Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":88,"is_retracted":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":"Heuristics; Computer science; Implementation; Search algorithm; Incremental heuristic search; Heuristic; Taxonomy (biology); Best-first search; Meta heuristic; Theoretical computer science; Algorithm; Beam search; Artificial intelligence","score_opus":0.04515293231171504,"score_gpt":0.29364136654187756,"score_spread":0.2484884342301625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510216528","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.0036687641,0.047279336,0.847934,0.0015660821,0.00036857722,0.00044216067,0.00027818486,0.000668253,0.09779463],"genre_scores_gemma":[0.075624555,0.056050237,0.8388968,0.0009578623,0.00060337083,0.0014089926,0.00086045556,0.00024945283,0.02534832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977476,0.00065692945,0.00021815472,0.00032669204,0.00088247063,0.00016818203],"domain_scores_gemma":[0.99809164,0.000985906,0.000127444,0.00033881248,0.00034814246,0.00010800899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019690627,0.0015101554,0.0014848616,0.0035347994,0.0015545868,0.0059176036,0.0040996973,0.0028129353,0.007745393],"category_scores_gemma":[0.005187114,0.0010479045,0.0012984384,0.009422967,0.0021637958,0.005746374,0.0027522906,0.0032594102,0.0033742497],"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.000023155231,0.000106021114,0.00040160568,0.00068293314,0.000040403123,0.00009784455,0.00039556436,0.014272344,0.0005301751,0.7572265,0.010184796,0.21603857],"study_design_scores_gemma":[0.000034105422,0.00011730546,0.0003350443,0.0005299846,0.000038567385,0.0006943305,0.00023802534,0.06799917,0.00056787755,0.7406002,0.18880302,0.000042239226],"about_ca_topic_score_codex":0.0016864818,"about_ca_topic_score_gemma":0.0013160319,"teacher_disagreement_score":0.007745393,"about_ca_system_score_codex":0.001455178,"about_ca_system_score_gemma":0.0016344463,"threshold_uncertainty_score":0.025910914},"labels":[],"label_agreement":null},{"id":"W1510237560","doi":"10.1007/11740674_4","title":"An Architecture for Developing Context-Aware Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"Concordia University","funders":"","keywords":"Computer science; Context (archaeology); Architecture; Process (computing); Adapter (computing); Context model; Component (thermodynamics); Software engineering; Human–computer interaction; Programming language; Artificial intelligence; Operating system","score_opus":0.03102993613819677,"score_gpt":0.26603294134542577,"score_spread":0.235003005207229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510237560","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.0038617481,0.00023122501,0.9860475,0.0001565672,0.00003063547,0.00011190687,0.000040714353,0.006746779,0.0027728893],"genre_scores_gemma":[0.06780244,0.0005361209,0.92608005,0.00014082997,0.000023732446,0.00028032452,0.00028932723,0.00043576842,0.004411457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991849,0.00015478318,0.00010155828,0.00017977179,0.00028322477,0.000095632364],"domain_scores_gemma":[0.99913627,0.00021778561,0.00004659691,0.0002801243,0.00021944664,0.00009982712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015756447,0.00080562173,0.00068422285,0.0007438233,0.0009934963,0.0029817712,0.0027977352,0.0016234538,0.0035732957],"category_scores_gemma":[0.0028235833,0.001326141,0.00091808994,0.0007212077,0.0012023007,0.0040376713,0.0030394313,0.0020999669,0.0019945342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027007554,0.0003401231,0.003085289,0.0008770017,0.0002515246,0.00067721016,0.0031997613,0.086266145,0.05846613,0.29392996,0.018284788,0.534352],"study_design_scores_gemma":[0.00007893898,0.00023762471,0.00090551167,0.000313429,0.0004163108,0.00068265136,0.000459402,0.6167283,0.059794236,0.16861095,0.1516538,0.00011882227],"about_ca_topic_score_codex":0.005029349,"about_ca_topic_score_gemma":0.0064497553,"teacher_disagreement_score":0.005029349,"about_ca_system_score_codex":0.0006947522,"about_ca_system_score_gemma":0.0016617522,"threshold_uncertainty_score":0.01195389},"labels":[],"label_agreement":null},{"id":"W1510343741","doi":"10.1007/978-3-540-39923-0_12","title":"“Simplest” Paths: Automated Route Selection for Navigation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Shortest path problem; Dijkstra's algorithm; K shortest path routing; Path (computing); Computation; Path length; Algorithm; The Internet; Graph; Theoretical computer science; Computer network; World Wide Web","score_opus":0.01429994429066915,"score_gpt":0.2459593359121606,"score_spread":0.23165939162149146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510343741","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.017409297,0.0006031115,0.9670648,0.00014088134,0.000082757506,0.000034439978,0.000547654,0.007960336,0.006156665],"genre_scores_gemma":[0.16640452,0.0005259561,0.82662773,0.00004802695,0.00004811341,0.0000562233,0.0011080436,0.0007209923,0.0044605187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969554,0.000044109696,0.0000150278065,0.00011392451,0.00009983776,0.000031591673],"domain_scores_gemma":[0.9995912,0.00015452436,0.000027389575,0.00011037872,0.00009436333,0.00002219707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027988604,0.0010182651,0.0007463116,0.0007381017,0.0005157642,0.0012292408,0.0024346877,0.0007943984,0.00795084],"category_scores_gemma":[0.0014379306,0.00054683833,0.00050654926,0.0009626779,0.0005116303,0.0021603268,0.0010940441,0.00076106976,0.0026434588],"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.00035836373,0.00005253205,0.0010906679,0.0003172912,0.00006760608,0.00013436141,0.00028563864,0.048347007,0.015814902,0.027296066,0.025960315,0.8802752],"study_design_scores_gemma":[0.00009030878,0.000103082166,0.0015286083,0.00006627414,0.00008750147,0.00045522477,0.00017712756,0.83953375,0.020966051,0.10182412,0.035113167,0.000054706547],"about_ca_topic_score_codex":0.005010603,"about_ca_topic_score_gemma":0.008898469,"teacher_disagreement_score":0.00795084,"about_ca_system_score_codex":0.00032615144,"about_ca_system_score_gemma":0.00083877746,"threshold_uncertainty_score":0.026598215},"labels":[],"label_agreement":null},{"id":"W1510392739","doi":"10.1007/978-3-540-85502-6_13","title":"Considerations for Real-Time Spatially-Aware Case-Based Reasoning: A Case Study in Robotic Soccer Imitation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Context (archaeology); Imitation; Cluster analysis; Focus (optics); Case-based reasoning; Preprocessor; Frame (networking); Representation (politics); Feature (linguistics); Constraint (computer-aided design); Selection (genetic algorithm); Human–computer interaction; Machine learning; Engineering","score_opus":0.042425529710907496,"score_gpt":0.28063370738072174,"score_spread":0.23820817766981425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510392739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08510539,0.0022667872,0.7746378,0.01348443,0.00019539686,0.0006635037,0.0002618714,0.0008647252,0.1225201],"genre_scores_gemma":[0.5646958,0.00069276267,0.42555204,0.00026953113,0.000029395713,0.00021886399,0.0001814834,0.00011431189,0.008245801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500054,0.0028789216,0.00029329033,0.00032324737,0.0012259184,0.0002781002],"domain_scores_gemma":[0.9799943,0.016480763,0.0005984714,0.0015036345,0.0009610096,0.00046179097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073607825,0.0005540792,0.0004715466,0.0007427014,0.0020147602,0.008090209,0.0044163945,0.004156457,0.01116212],"category_scores_gemma":[0.023500921,0.000659663,0.00095197675,0.0010439657,0.003636629,0.0072547505,0.0026623416,0.0025613045,0.0013345483],"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.00037542934,0.00058046414,0.0029502895,0.0007713981,0.0000659307,0.0064123706,0.010254598,0.069076695,0.006222003,0.6766216,0.008560625,0.21810861],"study_design_scores_gemma":[0.00012061946,0.00025825808,0.0013804969,0.00056546443,0.000081997496,0.006337859,0.011076125,0.1877053,0.008330975,0.677995,0.10603153,0.00011637656],"about_ca_topic_score_codex":0.0040912605,"about_ca_topic_score_gemma":0.006324324,"teacher_disagreement_score":0.01116212,"about_ca_system_score_codex":0.0020723743,"about_ca_system_score_gemma":0.0029489205,"threshold_uncertainty_score":0.038928032},"labels":[],"label_agreement":null},{"id":"W1510433709","doi":"10.1007/978-3-540-85988-8_92","title":"Nonrigid Registration of Dynamic Renal MR Images Using a Saliency Based MRF Model","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":32,"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":"York University","keywords":"Artificial intelligence; Computer science; Computer vision; Markov random field; Contrast (vision); Image registration; Pattern recognition (psychology); Histogram; Pixel; Orientation (vector space); Mutual information; Similarity (geometry); Invariant (physics); Image (mathematics); Mathematics; Image segmentation","score_opus":0.02464400333445046,"score_gpt":0.30114708970803994,"score_spread":0.2765030863735895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510433709","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.025709096,0.00021986777,0.9729648,0.0000955755,0.0000258213,0.000039813272,0.000036400466,0.00030907278,0.000599509],"genre_scores_gemma":[0.6615692,0.0005721961,0.33461705,0.00008812693,0.00009133528,0.000091052454,0.00019595906,0.0003063166,0.002468828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999851,0.000030197847,0.000008534931,0.000032472384,0.00006183151,0.000015927753],"domain_scores_gemma":[0.9997764,0.000078742836,0.000042684704,0.000035167945,0.000048638103,0.000018364539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045826597,0.00042737715,0.000670711,0.0008672964,0.00029319696,0.00065170345,0.0007033139,0.0008105665,0.00096949143],"category_scores_gemma":[0.0012101054,0.0004015193,0.0009840605,0.00062600145,0.00031256216,0.00074746006,0.0004804252,0.00042736944,0.00031048644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003921417,0.00011979416,0.0013042662,0.0002659574,0.00014472124,0.00043387088,0.0002828357,0.55986214,0.14830212,0.01029255,0.0017077987,0.27689186],"study_design_scores_gemma":[0.0000063403104,0.00005317017,0.0006271305,0.0000052427854,0.000017153092,0.00017136865,0.000008334134,0.9914834,0.005483977,0.0015007874,0.00063147675,0.000011649633],"about_ca_topic_score_codex":0.0033028258,"about_ca_topic_score_gemma":0.004616353,"teacher_disagreement_score":0.0033028258,"about_ca_system_score_codex":0.00044139806,"about_ca_system_score_gemma":0.00067498646,"threshold_uncertainty_score":0.00656718},"labels":[],"label_agreement":null},{"id":"W1510500344","doi":"10.1007/3-540-45254-0_22","title":"Migrating and Specifying Services for Web Integration","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Business Process Execution Language; Web service; Service-oriented architecture; WS-Policy; Services computing; World Wide Web; The Internet; XML; Service (business); Server; Web modeling; Web development; Web application security","score_opus":0.01480097845029939,"score_gpt":0.24208032279480424,"score_spread":0.22727934434450484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510500344","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.008283317,0.0003119783,0.9796007,0.00032503848,0.000050862796,0.00016936281,0.00009758298,0.0045469003,0.0066142087],"genre_scores_gemma":[0.120248124,0.0006839048,0.86706054,0.00017630938,0.00005338931,0.00021898869,0.0005986911,0.0018341311,0.009125851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973883,0.00073411607,0.00042114148,0.0003188265,0.0008952538,0.00024228409],"domain_scores_gemma":[0.99794775,0.0008990231,0.00012796631,0.0006979538,0.00022377375,0.00010350168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003119943,0.00092130323,0.00090873736,0.0011310332,0.001626048,0.0053883125,0.0024874131,0.0020952178,0.004229575],"category_scores_gemma":[0.0065275347,0.0018894047,0.0016313212,0.0013950267,0.002545121,0.0059887827,0.0031797015,0.0034154772,0.0016329124],"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.0001980991,0.00020224393,0.0016083984,0.00050323555,0.00007741161,0.0011934554,0.004976728,0.047297135,0.024491759,0.67074287,0.012417835,0.23629083],"study_design_scores_gemma":[0.000073672156,0.00007491472,0.00044223366,0.00030423896,0.00016329902,0.0010274604,0.00087388454,0.37179637,0.05146514,0.4149268,0.15869778,0.00015423214],"about_ca_topic_score_codex":0.005595589,"about_ca_topic_score_gemma":0.008966109,"teacher_disagreement_score":0.005595589,"about_ca_system_score_codex":0.0013715416,"about_ca_system_score_gemma":0.0017909501,"threshold_uncertainty_score":0.016500056},"labels":[],"label_agreement":null},{"id":"W1510506159","doi":"10.1007/978-3-642-12304-7_29","title":"Detecting Spatiotemporal Structure Boundaries: Beyond Motion Discontinuities","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"York University","funders":"","keywords":"Computer science; Classification of discontinuities; Spacetime; Motion (physics); Boundary (topology); Representation (politics); Structure from motion; Computer vision; Focus (optics); Artificial intelligence; Mathematics; Optics; Physics; Mathematical analysis","score_opus":0.009775278751308843,"score_gpt":0.2471282881927894,"score_spread":0.23735300944148055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510506159","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.09647179,0.002416323,0.8930402,0.00041139216,0.00010053558,0.000069959,0.0003311651,0.0011386108,0.006019949],"genre_scores_gemma":[0.5376938,0.0020697948,0.453033,0.00023345348,0.00017881396,0.00006372885,0.00090957957,0.0005467863,0.005271037],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999749,0.0000262605,0.000011608681,0.00008395493,0.00008258951,0.00004663994],"domain_scores_gemma":[0.9990994,0.00042051292,0.00012818731,0.00016101233,0.00011184025,0.000079107034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047764936,0.00053925905,0.00080128224,0.001232459,0.00042744292,0.001786364,0.001066259,0.001329964,0.0029130178],"category_scores_gemma":[0.003067583,0.00057771447,0.00042792567,0.0009782219,0.0006781284,0.0030741566,0.0016144218,0.0010490332,0.0009981385],"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.00083855353,0.0001428635,0.0047745933,0.00038743383,0.0000842861,0.00052606943,0.00043938175,0.035110284,0.18420672,0.031061443,0.0061049457,0.7363234],"study_design_scores_gemma":[0.00006532174,0.00031668023,0.011313863,0.00017727174,0.00013792566,0.0011537543,0.00042456188,0.79303527,0.075218804,0.104025066,0.014076497,0.000054869422],"about_ca_topic_score_codex":0.0015763178,"about_ca_topic_score_gemma":0.0017872177,"teacher_disagreement_score":0.0029130178,"about_ca_system_score_codex":0.00029684667,"about_ca_system_score_gemma":0.00040039633,"threshold_uncertainty_score":0.009745061},"labels":[],"label_agreement":null},{"id":"W1510525298","doi":"10.1007/978-3-540-75542-5_3","title":"Testable Requirements for Offshore Outsourcing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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":"Carleton University","funders":"","keywords":"Outsourcing; Computer science; Testability; Key (lock); Software engineering; Order (exchange); Process management; Engineering; Business; Reliability engineering; Computer security; Marketing","score_opus":0.048686650590358996,"score_gpt":0.3039086016869497,"score_spread":0.25522195109659074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510525298","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.05860939,0.0007220496,0.8058101,0.0035791036,0.00014329964,0.00042274728,0.00045571942,0.00104755,0.12921008],"genre_scores_gemma":[0.7057919,0.0008471581,0.26242793,0.00041637025,0.000077060104,0.0005017097,0.0009597051,0.00043550777,0.028542701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966036,0.0013482592,0.00028623577,0.00016903781,0.001350025,0.00024287347],"domain_scores_gemma":[0.99046046,0.0062706415,0.00042742997,0.0016084264,0.0010799562,0.0001530733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026782153,0.00061647664,0.00041649787,0.0007343797,0.0006696507,0.0017588774,0.0016479525,0.0018089595,0.008610243],"category_scores_gemma":[0.014634773,0.0006172877,0.00080202206,0.0007483071,0.0017443183,0.003281345,0.0018764784,0.0021558919,0.0012938929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018475109,0.00015686081,0.00092749036,0.00043205626,0.00002636078,0.0013706306,0.0013998637,0.0573852,0.00973044,0.76886123,0.011093833,0.14843133],"study_design_scores_gemma":[0.00006694299,0.00013015175,0.0008285428,0.00035755194,0.000028509841,0.0008026653,0.0008452485,0.14176317,0.01016605,0.8004513,0.044509616,0.000050197308],"about_ca_topic_score_codex":0.002701248,"about_ca_topic_score_gemma":0.0032436347,"teacher_disagreement_score":0.008610243,"about_ca_system_score_codex":0.0010580054,"about_ca_system_score_gemma":0.0012746013,"threshold_uncertainty_score":0.028804123},"labels":[],"label_agreement":null},{"id":"W1510560636","doi":"10.1007/978-3-642-13772-3_16","title":"Nonlinear Scale Space Theory in Texture Classification Using Multiple Classifier Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Classifier (UML); Pattern recognition (psychology); Nonlinear system; Linear classifier; Artificial intelligence; Scale space; Scale (ratio); Texel; Contextual image classification; Mathematics; Computer science; Image processing; Image (mathematics); Geography; Cartography; Physics","score_opus":0.02748670244924835,"score_gpt":0.26653553290094156,"score_spread":0.23904883045169323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510560636","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.004424422,0.0039193686,0.9893523,0.00025332606,0.0001288987,0.00001570505,0.000030055668,0.00012098949,0.0017549752],"genre_scores_gemma":[0.40467474,0.012098638,0.564511,0.00031148017,0.0011246941,0.00021129394,0.00025349445,0.00019379568,0.016620848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938214,0.00021212819,0.00003992919,0.00010927101,0.00021527319,0.00004124098],"domain_scores_gemma":[0.99898976,0.00060625013,0.00007235245,0.00011617417,0.0001974895,0.000017900871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289272,0.0005187757,0.0012543555,0.0009814954,0.0003973568,0.0016805106,0.0011281493,0.0010436017,0.0022423249],"category_scores_gemma":[0.0033032638,0.00044383595,0.0006859982,0.0020006686,0.0011509028,0.0022942503,0.0008541104,0.0014284118,0.000874649],"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.00013229133,0.00007805055,0.0009609967,0.00050326827,0.00015635953,0.0002021967,0.00018226246,0.25877526,0.010140464,0.23654841,0.0056310534,0.48668942],"study_design_scores_gemma":[0.000004705105,0.000018709698,0.0003528376,0.000015682544,0.00001832652,0.00006192195,0.000016877095,0.93013865,0.0009963965,0.06615762,0.002202695,0.000015427415],"about_ca_topic_score_codex":0.0029243464,"about_ca_topic_score_gemma":0.0018801893,"teacher_disagreement_score":0.0029243464,"about_ca_system_score_codex":0.0008419758,"about_ca_system_score_gemma":0.00040428853,"threshold_uncertainty_score":0.007501304},"labels":[],"label_agreement":null},{"id":"W1510560692","doi":"10.1007/11499169_34","title":"Distributed Online LSP Merging Algorithms for MPLS-TE","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Multiprotocol Label Switching; Algorithm; Computer network; Quality of service","score_opus":0.01614886562288911,"score_gpt":0.25127824877123284,"score_spread":0.23512938314834372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510560692","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.011252045,0.00021454116,0.9805387,0.0001290511,0.0000795154,0.000105134044,0.00013393901,0.0030560058,0.004490993],"genre_scores_gemma":[0.14511888,0.00013279724,0.8479772,0.00008966234,0.000075809825,0.00015672758,0.00049927266,0.0005048006,0.0054448503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.00017951989,0.00006693483,0.00017982746,0.00038691188,0.00014899878],"domain_scores_gemma":[0.99787426,0.00067500543,0.00013208493,0.0008287397,0.00039958398,0.00009034405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011976674,0.0009897113,0.0012457347,0.0009969667,0.0015177454,0.0019410639,0.002780609,0.0011961033,0.0134243835],"category_scores_gemma":[0.0034469014,0.00076989364,0.0007530844,0.0019544947,0.0006023361,0.003704459,0.0029285455,0.0020303773,0.0023608573],"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.00095398334,0.00038257914,0.00061569095,0.00018942021,0.00013074913,0.00013335641,0.00024646104,0.18769257,0.025232684,0.03405484,0.014815253,0.73555243],"study_design_scores_gemma":[0.00010070463,0.00008953619,0.00026460373,0.000013361892,0.000034555935,0.00013232035,0.00008827584,0.9437726,0.017873894,0.031330865,0.0062681832,0.00003093677],"about_ca_topic_score_codex":0.002989736,"about_ca_topic_score_gemma":0.007412554,"teacher_disagreement_score":0.0134243835,"about_ca_system_score_codex":0.0012727106,"about_ca_system_score_gemma":0.0018909122,"threshold_uncertainty_score":0.04490906},"labels":[],"label_agreement":null},{"id":"W1510578025","doi":"10.1007/3-540-45153-6_32","title":"The Design and Implementation of an Electronic Lexical Knowledge Base","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Knowledge base; Base (topology); Natural language processing; Artificial intelligence; Programming language; Software engineering","score_opus":0.015804501335173363,"score_gpt":0.3045251686871657,"score_spread":0.28872066735199237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510578025","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.012364979,0.00028334506,0.9698038,0.00037351358,0.00013196084,0.00043661892,0.0003875101,0.009866408,0.0063517927],"genre_scores_gemma":[0.079189695,0.00030009384,0.9117735,0.00028604994,0.000042452783,0.00039266245,0.0011846529,0.0006060057,0.006224889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879587,0.00023609892,0.00021502773,0.00024302083,0.00039178136,0.00011827737],"domain_scores_gemma":[0.99745804,0.0011116241,0.00011626561,0.0006079054,0.0005718762,0.00013430457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025273303,0.00035657288,0.0007841886,0.0017654444,0.0012223485,0.0053431676,0.0045827935,0.0017254838,0.008313683],"category_scores_gemma":[0.008375715,0.0012305949,0.00060582854,0.0017514344,0.001196994,0.0055108,0.0027433399,0.0013666787,0.0036295594],"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.00071194314,0.00053227274,0.0018766974,0.00083896285,0.00015673359,0.0009337099,0.0012217867,0.019973163,0.03902261,0.17392355,0.01815612,0.7426526],"study_design_scores_gemma":[0.0005502239,0.0004676615,0.0015410027,0.00049210025,0.00075052964,0.0013039887,0.001000982,0.43649822,0.1600093,0.16593122,0.23124625,0.00020857312],"about_ca_topic_score_codex":0.0036519624,"about_ca_topic_score_gemma":0.00524901,"teacher_disagreement_score":0.008313683,"about_ca_system_score_codex":0.0008356188,"about_ca_system_score_gemma":0.002144551,"threshold_uncertainty_score":0.027812064},"labels":[],"label_agreement":null},{"id":"W1510636674","doi":"10.1007/11564751_17","title":"Tractable Clones of Polynomials over Semigroups","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"McGill University; Université Laval","funders":"","keywords":"Mathematics; Constraint satisfaction problem; Combinatorics; Semigroup; Conjecture; Class (philosophy); Discrete mathematics; Set (abstract data type); Exponent; Polynomial; Computer science","score_opus":0.008777145447686784,"score_gpt":0.24534849607655632,"score_spread":0.23657135062886953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510636674","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.5721114,0.00065370416,0.40166005,0.0013542558,0.000067702655,0.00012488649,0.0008601141,0.0010014056,0.022166394],"genre_scores_gemma":[0.9441526,0.0003852364,0.04253831,0.0001499685,0.00012611476,0.00015380759,0.00090670574,0.000257359,0.011329904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976503,0.0005092484,0.00012979364,0.0005749287,0.0007070032,0.00042872343],"domain_scores_gemma":[0.98456925,0.011300145,0.001085266,0.0015558576,0.0008882794,0.0006011027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244052,0.0005336102,0.001302042,0.0009341656,0.0015082159,0.004268054,0.0014832591,0.0011717248,0.005766714],"category_scores_gemma":[0.012707013,0.00093205454,0.00136652,0.0019076357,0.0021454245,0.0058682254,0.0024570744,0.002287393,0.0006703994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017525787,0.000048198854,0.0011683545,0.00009820439,0.00002826259,0.0005326543,0.0013109276,0.010787484,0.004458669,0.96631384,0.0018520316,0.013226168],"study_design_scores_gemma":[0.0000652257,0.000032011674,0.00046896358,0.000018609544,0.00003507526,0.00032816612,0.00022839269,0.033149064,0.002374864,0.958276,0.005004697,0.000018942446],"about_ca_topic_score_codex":0.0030707973,"about_ca_topic_score_gemma":0.0028249342,"teacher_disagreement_score":0.005766714,"about_ca_system_score_codex":0.0026758066,"about_ca_system_score_gemma":0.0013431053,"threshold_uncertainty_score":0.019414365},"labels":[],"label_agreement":null},{"id":"W1510663655","doi":"10.1007/978-3-642-17619-7_3","title":"An Algorithm Based Concurrent Error Detection Scheme for AES","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Algorithm; Scheme (mathematics); Mathematics","score_opus":0.024430379844197873,"score_gpt":0.3032993712653675,"score_spread":0.2788689914211696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510663655","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.038892075,0.00059124036,0.9501963,0.00031716246,0.0003670146,0.00031843144,0.000093386734,0.0020686819,0.0071556973],"genre_scores_gemma":[0.5524969,0.00039626742,0.4320288,0.0002489892,0.00014684741,0.00027513743,0.00019640826,0.00019105319,0.014019519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981988,0.00036004907,0.00020382213,0.00027141898,0.0007698206,0.00019619486],"domain_scores_gemma":[0.9977107,0.000518375,0.00019325524,0.00093015376,0.0005587921,0.00008866664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017952269,0.0007093462,0.0007102296,0.0006089053,0.0009411079,0.0018869332,0.0015562307,0.00096009846,0.0031110735],"category_scores_gemma":[0.0032326826,0.00040451947,0.00048927637,0.0006941593,0.00077345566,0.0026110886,0.0024331906,0.0016357175,0.0011461366],"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.0027879134,0.00038524528,0.0010598198,0.0005753724,0.0001419305,0.0005141929,0.0006048974,0.027452229,0.1963844,0.37064612,0.007008118,0.3924398],"study_design_scores_gemma":[0.0006549256,0.0017287331,0.00084430893,0.00019274223,0.00029377543,0.0024105457,0.00011583015,0.4692015,0.27502215,0.18010403,0.06923504,0.0001963547],"about_ca_topic_score_codex":0.00035561164,"about_ca_topic_score_gemma":0.0005106756,"teacher_disagreement_score":0.0031110735,"about_ca_system_score_codex":0.00071639486,"about_ca_system_score_gemma":0.0014772838,"threshold_uncertainty_score":0.010407567},"labels":[],"label_agreement":null},{"id":"W1510763201","doi":"10.1007/11526841_12","title":"Timing Tolerances in Safety-Critical Software","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"Computer science; Static timing analysis; Reliability engineering; Software; Software engineering; Real-time computing; Embedded system; Operating system","score_opus":0.019941310020266657,"score_gpt":0.2680273754170427,"score_spread":0.24808606539677602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510763201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051574484,0.010993491,0.87330043,0.0010862376,0.0010550696,0.00008113548,0.000077108685,0.0017545898,0.06007738],"genre_scores_gemma":[0.8042936,0.0071372883,0.15055686,0.00038424888,0.0009253808,0.00016712681,0.00017390044,0.0006217069,0.03573995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991918,0.0001259404,0.0000539706,0.00010166606,0.00040647775,0.000120027355],"domain_scores_gemma":[0.9980446,0.001044402,0.00022857188,0.00032746748,0.00025175107,0.000103221326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010263313,0.00066947774,0.000588341,0.0009795718,0.00065353955,0.0012377287,0.0014734188,0.0006820035,0.004415122],"category_scores_gemma":[0.0044253496,0.0006377696,0.00047449095,0.0012888109,0.0013434573,0.0019096306,0.0009865327,0.001885515,0.000649276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002893201,0.000088464934,0.00043569948,0.00040341608,0.000028827959,0.00019837431,0.00046667145,0.10907225,0.010945035,0.59412843,0.0063281073,0.27761546],"study_design_scores_gemma":[0.00006636043,0.0002604457,0.00039015547,0.00015245406,0.000050414692,0.0002525954,0.00014708897,0.15994097,0.009973374,0.7873512,0.041373204,0.000041724197],"about_ca_topic_score_codex":0.000774517,"about_ca_topic_score_gemma":0.00080566085,"teacher_disagreement_score":0.004415122,"about_ca_system_score_codex":0.0009584182,"about_ca_system_score_gemma":0.0009221766,"threshold_uncertainty_score":0.014770091},"labels":[],"label_agreement":null},{"id":"W1510767022","doi":"10.1007/11733836_42","title":"Query Optimization for a Graph Database with Visual Queries","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Concordia University","funders":"","keywords":"Computer science; Graph database; Query optimization; Graph; Information retrieval; View; Database; Theoretical computer science; Database design","score_opus":0.012275470845136827,"score_gpt":0.2388625836253793,"score_spread":0.22658711278024246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510767022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038560543,0.00073206035,0.9439599,0.00076448126,0.00008556592,0.00026246146,0.0018164959,0.008399332,0.0054192157],"genre_scores_gemma":[0.36568037,0.0004593629,0.62060124,0.00034351987,0.00014404907,0.00026512195,0.0040103123,0.0013694707,0.0071265306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997414,0.00043054327,0.00022173376,0.0005110856,0.0011225154,0.0003000713],"domain_scores_gemma":[0.9977029,0.0008838338,0.00012004319,0.0007516357,0.0003900342,0.00015160171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015729945,0.0009658539,0.0023059314,0.0017490225,0.00087399036,0.003975295,0.003895189,0.0013568016,0.007177283],"category_scores_gemma":[0.0071118297,0.0006740505,0.0014370059,0.0035529968,0.0008656419,0.004496053,0.0028064211,0.0011230411,0.0015685555],"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.0029062198,0.0008010884,0.0033583387,0.000867447,0.0002432762,0.00044428447,0.0003926627,0.26643214,0.028144116,0.08987127,0.061802164,0.54473704],"study_design_scores_gemma":[0.00022864058,0.00017451915,0.00040220504,0.000019713481,0.00008325736,0.00023129162,0.00016559171,0.908426,0.007998162,0.07632017,0.0059117023,0.000038734073],"about_ca_topic_score_codex":0.0075613693,"about_ca_topic_score_gemma":0.009151584,"teacher_disagreement_score":0.0075613693,"about_ca_system_score_codex":0.0013660535,"about_ca_system_score_gemma":0.0012416561,"threshold_uncertainty_score":0.02401042},"labels":[],"label_agreement":null},{"id":"W1510791121","doi":"10.1007/11890881_41","title":"On the Use of 3D Scanner for Chinese Opera Documentation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Concordia University","funders":"","keywords":"Documentation; Computer science; Opera; Popularity; Cultural heritage; Government (linguistics); Multimedia; 3D computer graphics; Graphics; World Wide Web; Visual arts; Computer graphics (images); Art; History","score_opus":0.028849716652395135,"score_gpt":0.2667965581092612,"score_spread":0.23794684145686604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510791121","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.2203607,0.008751214,0.50102615,0.002517191,0.0005299109,0.000447045,0.0013454015,0.010960919,0.25406152],"genre_scores_gemma":[0.51361233,0.006938446,0.39826566,0.00046677617,0.0001191345,0.00013945246,0.001498582,0.0011533325,0.077806294],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959654,0.00007143139,0.000016446824,0.00006165045,0.00021346228,0.00004059544],"domain_scores_gemma":[0.9993162,0.00023346272,0.000021519627,0.00017501332,0.00023082887,0.000022849312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814869,0.00044138127,0.0002226487,0.0015497361,0.0007202173,0.00086524605,0.00085775804,0.00065222854,0.013360547],"category_scores_gemma":[0.0013521416,0.000520682,0.00038477432,0.0014602065,0.00051530544,0.0020417967,0.0008964766,0.00049094955,0.0029193524],"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.00012956366,0.000052785195,0.0030068057,0.00014957738,0.000016134403,0.0006040393,0.00082223676,0.0016526836,0.05478869,0.015595726,0.019867523,0.9033142],"study_design_scores_gemma":[0.00004940078,0.00047272508,0.022799717,0.00037688387,0.00014773814,0.0061141313,0.002339178,0.076156,0.33633748,0.018785875,0.53620213,0.00021884897],"about_ca_topic_score_codex":0.008886302,"about_ca_topic_score_gemma":0.015452718,"teacher_disagreement_score":0.013360547,"about_ca_system_score_codex":0.00044042448,"about_ca_system_score_gemma":0.0008567203,"threshold_uncertainty_score":0.044695497},"labels":[],"label_agreement":null},{"id":"W1510821055","doi":"10.1007/978-3-540-31957-3_103","title":"Efficient Radio Resource Management in Integrated WLAN/CDMA Mobile Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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 British Columbia","funders":"","keywords":"Computer network; Computer science; Quality of service; Code division multiple access; Cellular network; Radio resource management; Call Admission Control; Wireless network; Radio access network; Wi-Fi; Admission control; Wireless; Telecommunications; Base station; Mobile station","score_opus":0.015261087370451355,"score_gpt":0.261456913368883,"score_spread":0.24619582599843165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510821055","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.04288261,0.005218671,0.93866825,0.00021277803,0.00013787464,0.000041470892,0.00003386053,0.0008433009,0.011961178],"genre_scores_gemma":[0.8295708,0.0019606913,0.1541047,0.000111893016,0.00020598556,0.00005989539,0.00007649698,0.000110860376,0.013798687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.0000789797,0.000012420422,0.000046799814,0.0001548889,0.00006830164],"domain_scores_gemma":[0.9997372,0.00013521565,0.000020686713,0.00003710775,0.000055955526,0.00001371431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041580226,0.00043669203,0.0005612013,0.0003947867,0.00030168126,0.0010961985,0.0010290586,0.00039337136,0.0020063424],"category_scores_gemma":[0.0008558967,0.0003290548,0.00014450919,0.00060158357,0.00034033085,0.00094936596,0.0006273151,0.00064975116,0.00048054405],"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.00034574763,0.00022746382,0.00073289074,0.00015984487,0.00007753809,0.00013654612,0.00009960875,0.3329486,0.071519084,0.04980979,0.0041510556,0.53979176],"study_design_scores_gemma":[0.000017609369,0.00009561024,0.0004295098,0.000015111458,0.00003871596,0.00015389847,0.00003254774,0.9653122,0.013046846,0.014862918,0.005980096,0.0000149575835],"about_ca_topic_score_codex":0.00072193245,"about_ca_topic_score_gemma":0.001568386,"teacher_disagreement_score":0.0020063424,"about_ca_system_score_codex":0.0005786543,"about_ca_system_score_gemma":0.00032767706,"threshold_uncertainty_score":0.0067119002},"labels":[],"label_agreement":null},{"id":"W1510826524","doi":"10.1007/978-3-642-00887-0_55","title":"Materialized View Selection in XML Databases","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Materialized view; Computer science; XML; Selection (genetic algorithm); XML database; Information retrieval; Data warehouse; Database; Relational database management system; Context (archaeology); Graph; Streaming XML; XML validation; Efficient XML Interchange; Relational database; Theoretical computer science; View; World Wide Web; Database design; Artificial intelligence","score_opus":0.02280143752678639,"score_gpt":0.2710076934982822,"score_spread":0.2482062559714958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510826524","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.023543997,0.0027784074,0.9480128,0.00040262475,0.00014558286,0.00016013793,0.00072129286,0.00810106,0.016134132],"genre_scores_gemma":[0.23005722,0.0023591917,0.73253155,0.00032128207,0.00019205883,0.0001954686,0.003925699,0.0020076607,0.028409781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784994,0.000582424,0.00021806643,0.00025039283,0.000957107,0.00014209692],"domain_scores_gemma":[0.9981914,0.00089420815,0.00006307339,0.0005559441,0.00022381196,0.00007152095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022744916,0.0005858819,0.0010104862,0.001410517,0.00072589377,0.0035894269,0.002323041,0.00089485175,0.011065448],"category_scores_gemma":[0.0040575527,0.0008405878,0.0008806759,0.0025478192,0.0009797311,0.0052007437,0.0021573512,0.0013751514,0.0028267025],"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.00071282947,0.00025312486,0.0016188115,0.0007233523,0.000090296024,0.00065528735,0.00073008565,0.01707896,0.015676823,0.217502,0.030925665,0.7140329],"study_design_scores_gemma":[0.0002053203,0.00032667466,0.0015400947,0.00045001722,0.00019534523,0.0015036748,0.00071638403,0.322703,0.07337967,0.4173998,0.18142046,0.00015959068],"about_ca_topic_score_codex":0.0010131404,"about_ca_topic_score_gemma":0.0014128851,"teacher_disagreement_score":0.011065448,"about_ca_system_score_codex":0.0008376469,"about_ca_system_score_gemma":0.0006281404,"threshold_uncertainty_score":0.037017643},"labels":[],"label_agreement":null},{"id":"W1510882935","doi":"10.1007/978-3-540-24840-8_54","title":"Time-Sensitive Sampling for Spam Filtering","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Acadia University","funders":"","keywords":"Computer science; Filter (signal processing); Set (abstract data type); Test set; Data mining; Training set; Data set; Artificial intelligence; Sampling (signal processing); Machine learning; Computer vision","score_opus":0.025787257491919607,"score_gpt":0.2512502793276299,"score_spread":0.2254630218357103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510882935","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.007695893,0.0006754451,0.98983043,0.00010182225,0.00013648705,0.000041601237,0.000054664863,0.0007937305,0.0006700459],"genre_scores_gemma":[0.42715785,0.0012855626,0.55857086,0.00045597172,0.0011442348,0.00024498507,0.00067979156,0.00045835698,0.010002381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971607,0.0010436781,0.0001350891,0.0004624371,0.00092434604,0.00027385468],"domain_scores_gemma":[0.98864937,0.0074249567,0.00037482454,0.0021961655,0.0010513347,0.0003034828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042825495,0.0011110574,0.002279244,0.0019089753,0.0011785339,0.0015582925,0.002143078,0.0016597726,0.0031181774],"category_scores_gemma":[0.016364334,0.00075988454,0.00090614817,0.0020204873,0.0010634313,0.0023379293,0.0014433002,0.0018460354,0.001369902],"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.0013648754,0.00038198647,0.002627352,0.00034635648,0.00018651488,0.00023551082,0.00024989055,0.24509914,0.027121024,0.10333168,0.012444873,0.6066108],"study_design_scores_gemma":[0.000013938721,0.000050306684,0.00029885067,0.0000074717896,0.000019934885,0.000098364195,0.000010294877,0.9710084,0.0042321333,0.022782627,0.001463461,0.000014121586],"about_ca_topic_score_codex":0.0023240235,"about_ca_topic_score_gemma":0.0022986138,"teacher_disagreement_score":0.0042825495,"about_ca_system_score_codex":0.0012345373,"about_ca_system_score_gemma":0.00109787,"threshold_uncertainty_score":0.022648573},"labels":[],"label_agreement":null},{"id":"W1510913583","doi":"10.1007/3-540-45491-8_61","title":"Emotive Captioning in a Digital World","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Toronto Metropolitan University","funders":"","keywords":"Emotive; Closed captioning; Computer science; Multimedia; Paralanguage; Bandwidth (computing); Speech recognition; Artificial intelligence; Communication; Telecommunications; Psychology; Sociology","score_opus":0.03572148098710414,"score_gpt":0.2302148508992993,"score_spread":0.19449336991219515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510913583","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042374406,0.01025383,0.3665278,0.0031584543,0.003929993,0.00016407462,0.0005074632,0.0047350163,0.56834894],"genre_scores_gemma":[0.48912135,0.007890492,0.15557148,0.002049582,0.0030687475,0.00028687465,0.0012977145,0.0017563519,0.33895743],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997696,0.000101073565,0.000011398289,0.000032185093,0.00006283148,0.000022928281],"domain_scores_gemma":[0.99949,0.00027757703,0.000018241508,0.000069090696,0.00010983447,0.00003524546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858478,0.00056356087,0.00023721241,0.00040272702,0.0005335024,0.0023273383,0.0004992409,0.0007662099,0.024014767],"category_scores_gemma":[0.0015732035,0.0001572829,0.0002364706,0.00047177836,0.0006355067,0.0030071137,0.0011024248,0.00081512315,0.004493439],"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.00035867997,0.000120782744,0.00023995114,0.0009482856,0.00002841,0.00070410577,0.003280064,0.0043997276,0.056034252,0.1270355,0.12174816,0.6851021],"study_design_scores_gemma":[0.000041959967,0.00025452886,0.002043446,0.0005604077,0.000087542285,0.0022665,0.0019545755,0.049774867,0.041123483,0.08356488,0.81822205,0.00010578737],"about_ca_topic_score_codex":0.00026750652,"about_ca_topic_score_gemma":0.0003708705,"teacher_disagreement_score":0.024014767,"about_ca_system_score_codex":0.00023631759,"about_ca_system_score_gemma":0.000112648726,"threshold_uncertainty_score":0.080337405},"labels":[],"label_agreement":null},{"id":"W1510921367","doi":"10.1007/978-3-540-79490-5_21","title":"Gender Effect on Functional Networks in Resting Brain","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Parahippocampal gyrus; Cingulum (brain); Functional magnetic resonance imaging; Hippocampus; Resting state fMRI; Psychology; Amygdala; Middle temporal gyrus; Neuroscience; Functional connectivity; Medicine; Magnetic resonance imaging; Temporal lobe; White matter; Radiology","score_opus":0.047967733873756066,"score_gpt":0.257801268882894,"score_spread":0.20983353500913793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510921367","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.9200079,0.0104189105,0.015706122,0.0008429171,0.00038421678,0.000029993213,0.0043238592,0.00022005904,0.048066035],"genre_scores_gemma":[0.9829717,0.002396709,0.0025514704,0.00008946422,0.00017527574,0.00001850286,0.0009171053,0.00015436744,0.010725316],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99993896,0.0000131713705,0.000002618674,0.00002284045,0.000013124437,0.000009254657],"domain_scores_gemma":[0.9995403,0.00033104466,0.00003989577,0.00003414947,0.000025271995,0.000029305013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024463527,0.00027024845,0.00026032614,0.00021856838,0.00014248824,0.0003724745,0.00024027466,0.00024713884,0.012455488],"category_scores_gemma":[0.0018842313,0.00015267354,0.00021718918,0.00031020094,0.0001943054,0.0004993677,0.00024399866,0.00027325703,0.0008313876],"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.004189461,0.00023724456,0.10426346,0.0010198839,0.00081543834,0.0034886813,0.0023606534,0.0053018997,0.49724713,0.033981163,0.014505357,0.3325896],"study_design_scores_gemma":[0.00005552727,0.00052186655,0.92711586,0.00010773125,0.0004332941,0.0033973062,0.00040695773,0.0049174787,0.01927045,0.0342352,0.009487111,0.000051344337],"about_ca_topic_score_codex":0.0009092167,"about_ca_topic_score_gemma":0.0023927449,"teacher_disagreement_score":0.012455488,"about_ca_system_score_codex":0.00014262783,"about_ca_system_score_gemma":0.00008282539,"threshold_uncertainty_score":0.04166776},"labels":[],"label_agreement":null},{"id":"W1510987657","doi":"10.1007/978-3-540-24851-4_11","title":"Use Case Level Pointcuts","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 British Columbia","funders":"","keywords":"AspectJ; Computer science; Programming language; Modular programming; Aspect-oriented programming; Software engineering; Source code; Sequence diagram; Abstraction; Software development; Software; Unified Modeling Language","score_opus":0.09131753367461971,"score_gpt":0.29774766484590576,"score_spread":0.20643013117128606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510987657","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.010764817,0.0008221015,0.8946312,0.0006357565,0.00014769593,0.00041754197,0.0005215488,0.008998464,0.08306095],"genre_scores_gemma":[0.16933155,0.0023844792,0.6410433,0.00055222,0.00015781011,0.00049668143,0.0028196517,0.005302932,0.1779114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971934,0.00029213252,0.00017115999,0.00031505106,0.0018253828,0.00020282688],"domain_scores_gemma":[0.99738735,0.0010444162,0.0001546449,0.0008386776,0.0004665118,0.00010827671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014850136,0.0011887663,0.00068644056,0.0021160014,0.0005832084,0.0030364043,0.0019711684,0.0019887432,0.034868978],"category_scores_gemma":[0.0053046867,0.0010225022,0.0012673101,0.0021046626,0.00076364184,0.0032865,0.002427766,0.0022649749,0.008297148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008294385,0.00016290152,0.0011386159,0.00044809523,0.00005810239,0.0012800655,0.0007303191,0.0036192609,0.0223986,0.19120012,0.02731131,0.75156975],"study_design_scores_gemma":[0.000059702543,0.00016592519,0.0023024078,0.00050869264,0.00017714247,0.007020528,0.000321357,0.044058196,0.04434935,0.22157204,0.6793627,0.000101816375],"about_ca_topic_score_codex":0.0008076444,"about_ca_topic_score_gemma":0.0017821989,"teacher_disagreement_score":0.034868978,"about_ca_system_score_codex":0.00058259343,"about_ca_system_score_gemma":0.00073238474,"threshold_uncertainty_score":0.116648376},"labels":[],"label_agreement":null},{"id":"W1511086915","doi":"10.1007/978-3-642-15399-0_3","title":"DreamThrower: Creating, Throwing and Catching Dreams for Collaborative Dream Sharing","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sleep and Wakefulness Research","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dream; Computer science; Throwing; Stimulus (psychology); Mental state; Eye movement; Artificial intelligence; Human–computer interaction; Cognitive psychology; Psychology; Neuroscience","score_opus":0.036114119750006855,"score_gpt":0.3061049087256063,"score_spread":0.26999078897559947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511086915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039049096,0.0043827943,0.7975743,0.00197933,0.0008281469,0.00053788145,0.0010817653,0.023238795,0.13132794],"genre_scores_gemma":[0.21232672,0.003617886,0.53917766,0.0005134861,0.00015466836,0.0011011381,0.0026157654,0.0038164782,0.23667625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996946,0.000105801555,0.000017470573,0.000043175718,0.00009394403,0.000045048542],"domain_scores_gemma":[0.9995639,0.00019985832,0.000015873446,0.00008302811,0.000032945834,0.00010448498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364026,0.0010167811,0.00036985116,0.00050718506,0.0009900423,0.0022794358,0.0019688678,0.0009927711,0.029621685],"category_scores_gemma":[0.0014667775,0.0004937424,0.000659421,0.00039681364,0.0010531679,0.0028412219,0.0048903367,0.0014406822,0.007756406],"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.00051517243,0.00031579993,0.0012460992,0.0016059668,0.00010260886,0.0007841964,0.025496794,0.0030516977,0.025516674,0.106357954,0.14589365,0.68911344],"study_design_scores_gemma":[0.00017855888,0.0003049364,0.002545344,0.0005729198,0.00014594999,0.003464511,0.008072902,0.01935461,0.023562111,0.09216303,0.84939533,0.00023968791],"about_ca_topic_score_codex":0.00064017205,"about_ca_topic_score_gemma":0.0018485219,"teacher_disagreement_score":0.029621685,"about_ca_system_score_codex":0.0003279943,"about_ca_system_score_gemma":0.0007145702,"threshold_uncertainty_score":0.09909445},"labels":[],"label_agreement":null},{"id":"W1511092649","doi":"10.1007/978-3-642-01399-7_45","title":"Practical Random Linear Network Coding on GPUs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":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":"Hong Kong Baptist University","keywords":"Computer science; Linear network coding; Hash function; Homomorphic encryption; Speedup; Distributed computing; Computational complexity theory; Tuple; Parallel computing; Theoretical computer science; Computer network; Algorithm; Network packet; Encryption; Computer security","score_opus":0.04893286052545473,"score_gpt":0.31123538963723524,"score_spread":0.26230252911178054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511092649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044164617,0.00054642436,0.8877108,0.0010383512,0.0003101199,0.00009144103,0.00034378486,0.0023953186,0.06339906],"genre_scores_gemma":[0.53993624,0.0005902544,0.4170597,0.00036446194,0.00013761283,0.00029736647,0.00052483444,0.00066715287,0.040422462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00017303937,0.000019901112,0.000052655832,0.00017451434,0.00007299093],"domain_scores_gemma":[0.99899405,0.0004424614,0.0000417096,0.00028927554,0.00018333386,0.000049212988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004928791,0.0005313379,0.0005738496,0.00038203778,0.00036585674,0.0008933512,0.00088427856,0.0006217091,0.012888863],"category_scores_gemma":[0.002851681,0.00029340864,0.0003141401,0.0008730877,0.0005930682,0.0013091255,0.0011447322,0.0011987934,0.0018912075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002855384,0.0000746893,0.00036854,0.00017433791,0.00003683248,0.00013503272,0.00011550577,0.44559744,0.008818801,0.3928988,0.023710765,0.12778373],"study_design_scores_gemma":[0.00003450493,0.000023159,0.00006355738,0.000014972722,0.00000558739,0.000038879574,0.00001609034,0.91635835,0.0022765724,0.07349859,0.0076609296,0.000008791557],"about_ca_topic_score_codex":0.0024576809,"about_ca_topic_score_gemma":0.004275382,"teacher_disagreement_score":0.012888863,"about_ca_system_score_codex":0.0008872603,"about_ca_system_score_gemma":0.0008556014,"threshold_uncertainty_score":0.043117523},"labels":[],"label_agreement":null},{"id":"W1511105359","doi":"10.1007/10719619_13","title":"Reactivity in a Logic-Based Robot Programming Framework","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Nondeterministic algorithm; Computer science; Logic programming; Robot; Programming language; Plan (archaeology); Domain (mathematical analysis); Event (particle physics); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02164202486557408,"score_gpt":0.25898707278403615,"score_spread":0.23734504791846206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511105359","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.008021295,0.00017272594,0.97964567,0.0003879644,0.0000540961,0.000056612593,0.000046181798,0.0011626802,0.010452797],"genre_scores_gemma":[0.33203167,0.00045432133,0.65000415,0.0003231954,0.00015622644,0.000280933,0.00018655749,0.00054951734,0.016013363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.0003023247,0.00006675113,0.00021320266,0.0002923641,0.00016154628],"domain_scores_gemma":[0.99926597,0.00037820972,0.000060086593,0.0001340664,0.00008042607,0.00008134656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015362332,0.0007442945,0.0006355806,0.00056708726,0.0011908114,0.0027692572,0.0030407652,0.0012648333,0.004881003],"category_scores_gemma":[0.0018577785,0.0007576134,0.0017781791,0.000499802,0.002687698,0.003939707,0.002636714,0.002578725,0.0009172187],"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.000058769132,0.000041637642,0.00014441172,0.0000799961,0.000020701606,0.0001439132,0.00026991655,0.04426779,0.0031277116,0.934438,0.0012050641,0.016202075],"study_design_scores_gemma":[0.00003875285,0.000049424045,0.00008998295,0.000027890228,0.000047579306,0.000105179555,0.00006495789,0.24793325,0.0033976086,0.7343474,0.013863069,0.00003492085],"about_ca_topic_score_codex":0.002189195,"about_ca_topic_score_gemma":0.002617671,"teacher_disagreement_score":0.004881003,"about_ca_system_score_codex":0.0011276777,"about_ca_system_score_gemma":0.001011076,"threshold_uncertainty_score":0.016328573},"labels":[],"label_agreement":null},{"id":"W1511131817","doi":"10.1007/978-3-642-14097-6_40","title":"Using Placement and Name for Speaker Identification in Captioning","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Toronto Metropolitan University","funders":"","keywords":"Closed captioning; Computer science; Identification (biology); Speaker identification; Avatar; Speech recognition; Character (mathematics); Distraction; Natural language processing; Artificial intelligence; Speaker recognition; Human–computer interaction; Image (mathematics); Psychology","score_opus":0.06410445325901451,"score_gpt":0.28521219656277386,"score_spread":0.22110774330375935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511131817","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.022412157,0.0012933342,0.9138631,0.00051788474,0.002641347,0.00035763215,0.001805728,0.02226591,0.034842853],"genre_scores_gemma":[0.2054089,0.0010607428,0.7589935,0.00028564088,0.00084422,0.00039653998,0.004241828,0.004059845,0.02470875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976689,0.0008318007,0.00014483927,0.00059637614,0.000543957,0.00021400732],"domain_scores_gemma":[0.99536717,0.0013202092,0.00023529225,0.0007620474,0.00212467,0.00019067708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016922969,0.0016928077,0.0011935646,0.002174927,0.0016628744,0.0035778554,0.00155571,0.0019565374,0.031955846],"category_scores_gemma":[0.008230876,0.000690973,0.00083883066,0.001564744,0.0009497034,0.0047740596,0.0020520107,0.0019524475,0.029170776],"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.00091348833,0.00007952341,0.0008635984,0.0005761129,0.00004569864,0.00040813192,0.00071928493,0.0025508683,0.13999817,0.005729342,0.032329734,0.8157861],"study_design_scores_gemma":[0.00010953262,0.0007135831,0.007823063,0.00038953385,0.0003540379,0.003092959,0.002218668,0.2724873,0.5509964,0.01674748,0.14472704,0.00034024508],"about_ca_topic_score_codex":0.0011445954,"about_ca_topic_score_gemma":0.001694388,"teacher_disagreement_score":0.031955846,"about_ca_system_score_codex":0.00055790565,"about_ca_system_score_gemma":0.00066258287,"threshold_uncertainty_score":0.10690296},"labels":[],"label_agreement":null},{"id":"W1511351994","doi":"10.1007/978-3-642-32355-3_10","title":"An Event-B Approach to Timing Issues Applied to the Generic Insulin Infusion Pump","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Computer science; Event (particle physics); Insulin pump; Programming language; Real-time computing; Medicine; Endocrinology; Diabetes mellitus; Physics","score_opus":0.04612411775244778,"score_gpt":0.3004595466442302,"score_spread":0.2543354288917824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511351994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017346744,0.0003640815,0.9861842,0.00035370403,0.00017782657,0.000042971616,0.000026013517,0.00029120492,0.0108253965],"genre_scores_gemma":[0.24673572,0.0016787772,0.7176762,0.0007124528,0.0005494053,0.00020092321,0.00012602216,0.0005971211,0.0317234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985002,0.00054367894,0.00012188728,0.00023909476,0.0004686443,0.00012653897],"domain_scores_gemma":[0.99826354,0.001010869,0.00010789025,0.0002985791,0.00023641279,0.000082646155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023987577,0.0010997395,0.0008087804,0.00095037086,0.0010790938,0.0032968975,0.002309206,0.0028037454,0.010728784],"category_scores_gemma":[0.005386491,0.0008426693,0.0015617015,0.00091270934,0.0021388677,0.0029874796,0.0024181146,0.0037194516,0.001783842],"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.00014032483,0.000051537663,0.00019226188,0.00019609822,0.00003418867,0.0007122382,0.00028928806,0.040760808,0.005717611,0.8881919,0.0033678408,0.06034585],"study_design_scores_gemma":[0.00008365118,0.00010543647,0.00021026697,0.00011571353,0.00008411484,0.0005799111,0.00011752443,0.35529354,0.00652583,0.58113056,0.055697393,0.000056087847],"about_ca_topic_score_codex":0.0020374039,"about_ca_topic_score_gemma":0.0013336093,"teacher_disagreement_score":0.010728784,"about_ca_system_score_codex":0.0009947194,"about_ca_system_score_gemma":0.0008927389,"threshold_uncertainty_score":0.035891354},"labels":[],"label_agreement":null},{"id":"W1511405701","doi":"10.1007/978-3-540-31984-9_8","title":"Improving the Build Architecture of Legacy C/C++ Software Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; IBM (Canada)","funders":"","keywords":"Computer science; Legacy system; Header; Directory; Architecture; Software system; Software engineering; Software architecture; Software; Resource-oriented architecture; Reference architecture; Component-based software engineering; Operating system; Programming language","score_opus":0.021425296693959133,"score_gpt":0.254878106943952,"score_spread":0.2334528102499929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511405701","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.27811423,0.0007427831,0.65842384,0.00077026326,0.00016865376,0.00028253507,0.00022895559,0.036099304,0.025169509],"genre_scores_gemma":[0.37214106,0.0006714656,0.60444885,0.000313907,0.0000633979,0.00008154437,0.0010161479,0.0060756207,0.0151879545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896574,0.0001514454,0.00005513766,0.00012912073,0.000565446,0.00013311813],"domain_scores_gemma":[0.9966899,0.00074577914,0.00014990308,0.0012460927,0.0010379314,0.00013029556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010842464,0.00069381204,0.00027811818,0.0007127105,0.00056600996,0.0015069039,0.0018339324,0.00075693976,0.0040310225],"category_scores_gemma":[0.005817764,0.0009849196,0.00043818715,0.00066753017,0.0005298543,0.0026857022,0.0014585395,0.002020448,0.0018356319],"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.0003852034,0.0004876421,0.009942592,0.0004068673,0.000073934505,0.00031739162,0.0011940455,0.06404146,0.09572984,0.015417623,0.01767295,0.7943303],"study_design_scores_gemma":[0.00022109151,0.0006954436,0.011941818,0.0001776678,0.00034939565,0.00059228606,0.0005384344,0.6583767,0.23052257,0.02315504,0.07330492,0.00012465144],"about_ca_topic_score_codex":0.00623926,"about_ca_topic_score_gemma":0.010434022,"teacher_disagreement_score":0.00623926,"about_ca_system_score_codex":0.0007054083,"about_ca_system_score_gemma":0.0014610285,"threshold_uncertainty_score":0.013485134},"labels":[],"label_agreement":null},{"id":"W1511438171","doi":"10.1007/978-3-540-39903-2_40","title":"Projection-Based Needle Segmentation in 3D Ultrasound Images","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Robarts Clinical Trials","funders":"","keywords":"Computer science; Computer vision; Segmentation; Artificial intelligence; Projection (relational algebra); Image segmentation; Computer graphics (images); Algorithm","score_opus":0.013045012408162084,"score_gpt":0.24715458103886487,"score_spread":0.23410956863070279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511438171","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.014721255,0.0006858383,0.97968435,0.00008587339,0.000029737168,0.00007520143,0.00013774005,0.0026517105,0.0019283583],"genre_scores_gemma":[0.10642913,0.0013845424,0.8883834,0.00007980719,0.000035838584,0.000065729735,0.0004237221,0.00055090495,0.0026468756],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994474,0.00007854198,0.000034759618,0.00010068182,0.00029267423,0.000045984456],"domain_scores_gemma":[0.9994816,0.0002070087,0.000039980798,0.00009460554,0.00015608694,0.00002069103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005887271,0.00084318843,0.00074361963,0.0012132567,0.0003488473,0.0015541486,0.0009520176,0.0014461267,0.00310078],"category_scores_gemma":[0.0013065123,0.001316692,0.0009224284,0.0016565645,0.00048213595,0.00082781643,0.00093476125,0.0006722362,0.00238158],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002986975,0.000070411945,0.0013751377,0.0004704444,0.000109505236,0.00023568913,0.0002808884,0.054301243,0.22925839,0.0038631682,0.004301535,0.705435],"study_design_scores_gemma":[0.000027705524,0.00014997419,0.0049404763,0.000080993785,0.000095291216,0.0022313572,0.00007983906,0.7712196,0.20735967,0.005388233,0.008345243,0.000081680184],"about_ca_topic_score_codex":0.0030161764,"about_ca_topic_score_gemma":0.005291301,"teacher_disagreement_score":0.00310078,"about_ca_system_score_codex":0.00040153522,"about_ca_system_score_gemma":0.0007428915,"threshold_uncertainty_score":0.010373175},"labels":[],"label_agreement":null},{"id":"W1511441781","doi":"10.1007/11780519_41","title":"A Region-Based Approach to Stereo Matching for USAR","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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 Manitoba","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Stereopsis; Urban search and rescue; Machine vision; Frame (networking); Mobile robot; Computer stereo vision; Stereo camera; Matching (statistics); Robot","score_opus":0.018853067066193108,"score_gpt":0.21539403783638755,"score_spread":0.19654097077019445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511441781","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.0014900493,0.00020430064,0.99531746,0.000024392553,0.000033685294,0.00003208252,0.000053050895,0.0015391882,0.0013058207],"genre_scores_gemma":[0.047836628,0.00036564353,0.94711703,0.00008794185,0.000051461742,0.0000620795,0.00030163792,0.00047081843,0.0037067563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989796,0.00013082736,0.000043208664,0.00021978102,0.0005240751,0.00010234676],"domain_scores_gemma":[0.999542,0.000092021444,0.000030411768,0.0001227338,0.00019472711,0.000018171164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062613806,0.0008967864,0.0014060952,0.0022236682,0.0008140699,0.0014005724,0.0030681854,0.0016786923,0.007827075],"category_scores_gemma":[0.0013880064,0.0009675559,0.0013496238,0.0024894667,0.00050592795,0.0020190736,0.0017516228,0.001225425,0.004163019],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016252833,0.00014724635,0.0002554195,0.00012891869,0.00008267258,0.00010730978,0.00009445972,0.053657837,0.07631655,0.016135776,0.005808015,0.8471032],"study_design_scores_gemma":[0.000026863647,0.00009552507,0.00047256757,0.000025329855,0.000055113476,0.00036825228,0.00007269014,0.91022897,0.05535707,0.017814696,0.015427282,0.00005569936],"about_ca_topic_score_codex":0.0055573727,"about_ca_topic_score_gemma":0.0065757926,"teacher_disagreement_score":0.007827075,"about_ca_system_score_codex":0.0006434813,"about_ca_system_score_gemma":0.0008122026,"threshold_uncertainty_score":0.026184142},"labels":[],"label_agreement":null},{"id":"W1511447460","doi":"10.1007/978-3-540-85557-6_14","title":"Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Adjacency list; Genome; Adjacency matrix; Combinatorics; Cluster (spacecraft); Null (SQL); Function (biology); Chromosome; Gene; Mathematics; Biology; Genetics; Computer science; Graph; Data mining","score_opus":0.023707234926744526,"score_gpt":0.26401631227597455,"score_spread":0.24030907734923002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511447460","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.7768802,0.00047167813,0.20783453,0.001073942,0.00013939689,0.0002822974,0.0028832199,0.0019839446,0.00845083],"genre_scores_gemma":[0.9391905,0.00007299655,0.05261514,0.0002854183,0.00015727278,0.00015552176,0.0055483067,0.00026707805,0.0017077718],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99142164,0.0035007922,0.0005212771,0.0020793309,0.0016519894,0.00082493946],"domain_scores_gemma":[0.881454,0.10119206,0.0040135668,0.0059484295,0.004584999,0.0028070377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050237756,0.0011369176,0.0019607935,0.0039436324,0.0015959115,0.0023276494,0.0037809897,0.0030079558,0.0077565564],"category_scores_gemma":[0.06596929,0.0005582176,0.0014006096,0.0030640794,0.002490078,0.003054864,0.0028613217,0.0014784975,0.0011910581],"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.013139284,0.0012083501,0.3478239,0.0014247508,0.0021127085,0.0030426236,0.000919594,0.18554233,0.049027987,0.11068976,0.019391306,0.26567745],"study_design_scores_gemma":[0.00097119255,0.0016434161,0.04761937,0.0001018216,0.0005348267,0.0023773003,0.0010680195,0.6311369,0.020704709,0.28979063,0.0038843,0.00016750189],"about_ca_topic_score_codex":0.0011984115,"about_ca_topic_score_gemma":0.001783606,"teacher_disagreement_score":0.0077565564,"about_ca_system_score_codex":0.0005806128,"about_ca_system_score_gemma":0.0015069734,"threshold_uncertainty_score":0.026568592},"labels":[],"label_agreement":null},{"id":"W1511466228","doi":"10.1007/978-3-540-85988-8_30","title":"Kinetic Modeling Based Probabilistic Segmentation for Molecular Images","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Partial volume; Artificial intelligence; Noise (video); Probabilistic logic; Pattern recognition (psychology); Positron emission tomography; Image segmentation; Algorithm; Computer vision; Image (mathematics); Nuclear medicine","score_opus":0.028231202684899953,"score_gpt":0.3162865907662547,"score_spread":0.2880553880813548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511466228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010766557,0.0003836381,0.9863635,0.00016279511,0.000031173993,0.000040429186,0.000100341946,0.0010324077,0.0011192544],"genre_scores_gemma":[0.4913653,0.0018122591,0.496989,0.00019103357,0.00007698587,0.0002978094,0.0008530011,0.0011093913,0.007305177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968374,0.000060124275,0.000019972478,0.00007446637,0.00012321414,0.00003841709],"domain_scores_gemma":[0.99936074,0.00033778042,0.000103680766,0.000079527854,0.00008444684,0.000033880344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006484635,0.0009165402,0.0013423216,0.0012546112,0.0005768833,0.0016404245,0.0019872938,0.0018616208,0.0021961797],"category_scores_gemma":[0.0019918252,0.0014518186,0.0016850412,0.0013177089,0.00085161877,0.0018463508,0.0008806549,0.0011760757,0.00097232807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014774025,0.00005008134,0.0003428773,0.00020031582,0.00006869092,0.00012031672,0.00007767128,0.90000576,0.027619071,0.02189447,0.0011310674,0.048341975],"study_design_scores_gemma":[0.000004322558,0.0000071738536,0.00006299409,0.000004291501,0.0000071748937,0.00002955147,0.000003480123,0.9913823,0.003465146,0.0045930776,0.00043143565,0.000009065895],"about_ca_topic_score_codex":0.005823092,"about_ca_topic_score_gemma":0.0049734856,"teacher_disagreement_score":0.005823092,"about_ca_system_score_codex":0.0016941387,"about_ca_system_score_gemma":0.0012595076,"threshold_uncertainty_score":0.012291908},"labels":[],"label_agreement":null},{"id":"W1511484581","doi":"10.1007/978-3-642-12029-9_12","title":"Prescriptive Semantics for Big-Step Modelling Languages","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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 Waterloo","funders":"","keywords":"Computer science; Semantic compression; Semantics (computer science); Semantic computing; Natural language processing; Programming language; Semantic equivalence; Formal semantics (linguistics); Artificial intelligence; Semantic technology; Semantic Web","score_opus":0.021843932082373497,"score_gpt":0.248130030303062,"score_spread":0.2262860982206885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511484581","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.0026037055,0.00014598864,0.99049157,0.0002174515,0.000047724952,0.000049289614,0.00011744319,0.00076002436,0.0055668196],"genre_scores_gemma":[0.24959396,0.0006026459,0.7350555,0.00043305138,0.00010634781,0.00042317086,0.0007106056,0.0009738695,0.012100767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973199,0.00095826224,0.00032509773,0.00026963503,0.0009755235,0.00015171761],"domain_scores_gemma":[0.9952701,0.0025895524,0.00021515509,0.001137228,0.0006316238,0.00015642434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035389487,0.0009851317,0.0007534174,0.0010257917,0.00094084797,0.0037664566,0.0023940874,0.0013855525,0.00433628],"category_scores_gemma":[0.0062033585,0.0011710933,0.0015262862,0.001031715,0.0032533712,0.005829746,0.0028167272,0.004572145,0.0011404527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025819147,0.000016199932,0.000063102874,0.00009209863,0.000009489134,0.000045223736,0.00033521245,0.0068926183,0.0010636644,0.9777976,0.00067368615,0.012985264],"study_design_scores_gemma":[0.00001990077,0.0000163186,0.000030833853,0.00006160508,0.000015805417,0.00006760783,0.00006890275,0.041642614,0.0026769089,0.9381461,0.017234964,0.000018349647],"about_ca_topic_score_codex":0.0011103839,"about_ca_topic_score_gemma":0.0021215626,"teacher_disagreement_score":0.00433628,"about_ca_system_score_codex":0.0014524133,"about_ca_system_score_gemma":0.0014379703,"threshold_uncertainty_score":0.018715978},"labels":[],"label_agreement":null},{"id":"W1511510665","doi":"10.1007/978-3-540-32243-6_14","title":"Agent-Based Modelling of Forces in Crowds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Crowds; Computer science; Crowd simulation; Space (punctuation); Work (physics); Crowd psychology; Human–computer interaction; Data science; Artificial intelligence; Computer security; Engineering","score_opus":0.020651533113602516,"score_gpt":0.2280711796715103,"score_spread":0.2074196465579078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511510665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023222962,0.0011565277,0.95488113,0.00067395554,0.00030225638,0.00006418169,0.00019818243,0.00029507646,0.019205654],"genre_scores_gemma":[0.8244052,0.0024825695,0.13815922,0.00016458776,0.00034242083,0.0002915006,0.00040420433,0.00024798812,0.033502348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977535,0.00007170888,0.000016054062,0.000033976987,0.0000761014,0.000026762886],"domain_scores_gemma":[0.9995246,0.0002873486,0.00003629786,0.000030262818,0.000074389565,0.000047170895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004563255,0.0008002723,0.00128297,0.0006849461,0.0009277376,0.0016800491,0.0022136138,0.0021039424,0.003889942],"category_scores_gemma":[0.0018399853,0.0011121522,0.0010514886,0.00081159826,0.0011870442,0.0015843305,0.0016862577,0.0012233212,0.00070514984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009055794,0.000007098951,0.00007219679,0.000019875959,0.000009187479,0.00003099488,0.000038846494,0.9827617,0.00024780503,0.0143886125,0.00030962695,0.0021049662],"study_design_scores_gemma":[0.0000033132224,0.000002258904,0.000020834794,0.0000034470693,0.0000018246399,0.000006710168,0.000005158193,0.9917418,0.00005609141,0.007588299,0.0005671743,0.0000031233253],"about_ca_topic_score_codex":0.013641885,"about_ca_topic_score_gemma":0.008216218,"teacher_disagreement_score":0.013641885,"about_ca_system_score_codex":0.00087370526,"about_ca_system_score_gemma":0.00091519253,"threshold_uncertainty_score":0.027125001},"labels":[],"label_agreement":null},{"id":"W1511589452","doi":"10.1007/3-540-39965-8_3","title":"Mixed-Initiative Translation of Web Pages","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Interactivity; World Wide Web; Task (project management); Web page; Human–computer interaction; Engineering","score_opus":0.036355393811706105,"score_gpt":0.23884201340687405,"score_spread":0.20248661959516795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511589452","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09131678,0.0027209576,0.7822646,0.0011859778,0.0018903307,0.0005891879,0.004403231,0.019738108,0.095890835],"genre_scores_gemma":[0.4949056,0.0014372022,0.43162766,0.00031110193,0.00027525562,0.0003610329,0.010087954,0.004657381,0.056336667],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985592,0.000605728,0.00010937309,0.00022574514,0.00039828513,0.00010164337],"domain_scores_gemma":[0.99643916,0.0016397001,0.00011866003,0.00070758816,0.0009963074,0.000098633674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012096248,0.0008436864,0.00074803474,0.0010016441,0.0007071044,0.0031329677,0.0013474424,0.0010617812,0.017133575],"category_scores_gemma":[0.0065428037,0.0007537499,0.00061913574,0.0014801361,0.0005164465,0.0029094466,0.0021611494,0.0011561255,0.010656316],"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.0013925077,0.0004422676,0.0009968722,0.0022875478,0.00014585348,0.0017445834,0.0040688985,0.008618465,0.07180585,0.073401004,0.052418478,0.7826776],"study_design_scores_gemma":[0.00023138615,0.0006990356,0.0020895158,0.0006205652,0.0003321453,0.002626759,0.002998141,0.18947457,0.36447683,0.081507735,0.354739,0.0002043092],"about_ca_topic_score_codex":0.0010152918,"about_ca_topic_score_gemma":0.0016706446,"teacher_disagreement_score":0.017133575,"about_ca_system_score_codex":0.0004541754,"about_ca_system_score_gemma":0.00073750236,"threshold_uncertainty_score":0.057317495},"labels":[],"label_agreement":null},{"id":"W1511592741","doi":"10.1007/3-540-45349-0_43","title":"An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Heuristic; Local consistency; Probabilistic logic; Consistency (knowledge bases); Constructive; Constraint satisfaction; Consistent heuristic; Constraint (computer-aided design); Mathematical optimization; Null-move heuristic; Variable (mathematics); Algorithm; Incremental heuristic search; Artificial intelligence; Search algorithm; Mathematics; Beam search; Process (computing)","score_opus":0.018998376886875216,"score_gpt":0.27207606733040585,"score_spread":0.2530776904435306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511592741","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.96465653,0.0013443135,0.026610617,0.00068917376,0.000052783646,0.00014877859,0.00081491604,0.00018230714,0.005500652],"genre_scores_gemma":[0.98762244,0.00015732148,0.01050654,0.000047222824,0.00002670689,0.000059125552,0.00085029786,0.00008136364,0.0006489527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98321116,0.012586096,0.0006478285,0.001227378,0.001969309,0.00035828253],"domain_scores_gemma":[0.29507065,0.6605351,0.011817633,0.02483137,0.006313523,0.0014318486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024127332,0.00054939254,0.000719293,0.001945015,0.0010864208,0.0018778902,0.0034043978,0.0015982105,0.006206472],"category_scores_gemma":[0.269405,0.0005488273,0.00066868926,0.004240214,0.0027405797,0.004537148,0.0010136077,0.0030666776,0.00045409272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011647036,0.0053448523,0.33321077,0.0013187535,0.0013132915,0.00042588828,0.0028187197,0.34093836,0.0027001374,0.0839737,0.016158277,0.20015027],"study_design_scores_gemma":[0.0006559195,0.0026831625,0.07992106,0.0001755222,0.0006315248,0.0009184299,0.002467841,0.8449524,0.0028995848,0.059368305,0.005202476,0.0001238177],"about_ca_topic_score_codex":0.0041876966,"about_ca_topic_score_gemma":0.0041396297,"teacher_disagreement_score":0.024127332,"about_ca_system_score_codex":0.0019133231,"about_ca_system_score_gemma":0.0013796109,"threshold_uncertainty_score":0.12759906},"labels":[],"label_agreement":null},{"id":"W1511620306","doi":"10.1007/3-540-45005-x_10","title":"Some Properties of Ciliate Bio-operations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Western University","funders":"","keywords":"Computer science; Ciliate; Biology; Ecology","score_opus":0.023395934119556438,"score_gpt":0.21286515341079545,"score_spread":0.18946921929123903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511620306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31343538,0.0076740882,0.4344103,0.0019100559,0.00050804287,0.00013960298,0.0009782638,0.00047959734,0.24046469],"genre_scores_gemma":[0.9164643,0.0033450515,0.053247754,0.00031948538,0.00065509486,0.00028170616,0.0006315418,0.00019985276,0.024855161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996315,0.00005560911,0.000039862367,0.00007481304,0.00015934276,0.00003875845],"domain_scores_gemma":[0.99875367,0.00070263515,0.00014860138,0.0001560719,0.00015805899,0.00008089479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005454786,0.00044251344,0.0005220521,0.001358381,0.001063361,0.002453413,0.00071754307,0.0008965476,0.004299739],"category_scores_gemma":[0.0030223096,0.00035660484,0.0006464216,0.0015171284,0.0020225074,0.003046628,0.0010118696,0.0012004302,0.00060206826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003068114,0.000015902297,0.0004181576,0.00009183768,0.000010182975,0.00011778716,0.0002598084,0.003981545,0.003222423,0.9710324,0.0015095618,0.019309707],"study_design_scores_gemma":[0.000011658294,0.000033636603,0.00081435527,0.000031262593,0.000013652119,0.0003359126,0.00012566858,0.025328748,0.0014146003,0.9657038,0.006171197,0.000015550433],"about_ca_topic_score_codex":0.000610022,"about_ca_topic_score_gemma":0.00045978776,"teacher_disagreement_score":0.004299739,"about_ca_system_score_codex":0.00070409424,"about_ca_system_score_gemma":0.00032847808,"threshold_uncertainty_score":0.014384031},"labels":[],"label_agreement":null},{"id":"W1511622987","doi":"10.1007/11795131_78","title":"An Enhanced Support Vector Machine Model for Intrusion Detection","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":61,"is_retracted":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":"Intrusion detection system; Computer science; Support vector machine; Data mining; Feature selection; Artificial intelligence; Ranking (information retrieval); Machine learning; Anomaly-based intrusion detection system; Kernel (algebra); Pattern recognition (psychology); Ranking SVM; Network security; Rough set","score_opus":0.012054441556225495,"score_gpt":0.23976371087138218,"score_spread":0.22770926931515667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511622987","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.010849353,0.00046316822,0.9859232,0.00013015833,0.00012114332,0.000043784043,0.0001680004,0.0015612509,0.000740056],"genre_scores_gemma":[0.46043992,0.00084433943,0.5283916,0.0002362001,0.00031026488,0.00029975182,0.0011082672,0.00021464936,0.008154952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937505,0.00017664432,0.000045506145,0.00012205016,0.00023428837,0.00004644392],"domain_scores_gemma":[0.99864644,0.00062204886,0.000061462764,0.0001553768,0.00048059522,0.00003408628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010017267,0.0007513418,0.0012000719,0.0005808779,0.00025211988,0.0010672635,0.0018332187,0.0010114884,0.0028373701],"category_scores_gemma":[0.0033090587,0.00034628448,0.0006875228,0.00088423426,0.00021746439,0.002134942,0.00069932814,0.0014265031,0.0016811362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049242703,0.0002796591,0.0011759202,0.00017969956,0.00017353817,0.0001593796,0.000045572226,0.49512467,0.008176486,0.008444921,0.005594041,0.48015368],"study_design_scores_gemma":[0.000005777165,0.00003074854,0.000055339664,0.000002270898,0.000010884531,0.000016823567,0.0000011255062,0.9977228,0.0005273472,0.0011578272,0.0004654384,0.0000035992848],"about_ca_topic_score_codex":0.0025536802,"about_ca_topic_score_gemma":0.0024684747,"teacher_disagreement_score":0.0028373701,"about_ca_system_score_codex":0.00034770777,"about_ca_system_score_gemma":0.00065107807,"threshold_uncertainty_score":0.0094919205},"labels":[],"label_agreement":null},{"id":"W1511679240","doi":"10.1007/11531371_80","title":"Evaluating Current Testing Processes of Web-Portal Applications","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Calgary","funders":"","keywords":"Computer science; Test strategy; Software engineering; Web application; World Wide Web; Software; Programming language","score_opus":0.10804146896206496,"score_gpt":0.36890845754048596,"score_spread":0.260866988578421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511679240","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.97101825,0.0003668712,0.025290623,0.00010268512,0.000021191747,0.00011099849,0.000113948045,0.0011735976,0.0018017977],"genre_scores_gemma":[0.9842473,0.000087700435,0.014581314,0.000021038752,0.000013190901,0.000030159594,0.00029110402,0.00007234096,0.00065589603],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99195695,0.0034799445,0.0007157376,0.0007317245,0.0026236728,0.00049201114],"domain_scores_gemma":[0.84880126,0.1249892,0.0063573513,0.0056533907,0.011714545,0.0024841349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009416107,0.0010150428,0.000529972,0.0023450325,0.00040014254,0.0018375927,0.0020336679,0.0013731113,0.0023345973],"category_scores_gemma":[0.06432407,0.0004107755,0.00047561078,0.001021745,0.000633859,0.0027439166,0.00088079297,0.00080336985,0.0006142011],"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.006968382,0.0061212676,0.2045178,0.0008297447,0.00046472825,0.00047570132,0.00227773,0.1428444,0.049744107,0.0030859525,0.0020563833,0.58061385],"study_design_scores_gemma":[0.00029810978,0.0066737393,0.06669513,0.00016591414,0.00047501552,0.00037567684,0.00076483644,0.8406582,0.07750906,0.004637893,0.0016600951,0.00008636678],"about_ca_topic_score_codex":0.0041581667,"about_ca_topic_score_gemma":0.004659274,"teacher_disagreement_score":0.009416107,"about_ca_system_score_codex":0.0009984162,"about_ca_system_score_gemma":0.0011340398,"threshold_uncertainty_score":0.049797714},"labels":[],"label_agreement":null},{"id":"W1511694431","doi":"10.1007/3-540-45554-x_80","title":"On Trace Assertion Method of Module Interface Specification with Concurrency","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Assertion; Computer science; Concurrency; TRACE (psycholinguistics); Programming language; Interface (matter); Simple (philosophy); Algebraic number; Theoretical computer science; Algorithm; Parallel computing; Mathematics","score_opus":0.03175061963957337,"score_gpt":0.28620791663772877,"score_spread":0.2544572969981554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511694431","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.00220058,0.00007917847,0.99322295,0.000060232815,0.00005034858,0.00005218381,0.00004274528,0.0027865067,0.0015052117],"genre_scores_gemma":[0.2077436,0.0005328619,0.77296716,0.00033177054,0.00014677152,0.00039624647,0.0007420766,0.0037045246,0.013435016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966445,0.00084150076,0.00029161831,0.0007184724,0.0012224303,0.00028146637],"domain_scores_gemma":[0.9981055,0.00084570196,0.000084174666,0.0005221356,0.00036899044,0.000073548654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031327978,0.00097504345,0.0010341814,0.0015096572,0.0009013901,0.0021360647,0.0025656694,0.0010892447,0.00907054],"category_scores_gemma":[0.004937413,0.0008472924,0.0017542762,0.0011461655,0.0016008646,0.0046406435,0.0022202588,0.0023513094,0.001669534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005051159,0.00019862976,0.0023228885,0.00063026836,0.0001287594,0.00063481706,0.0016049488,0.01202179,0.023281047,0.5600044,0.008787142,0.38988018],"study_design_scores_gemma":[0.00035148556,0.00023864642,0.00091912295,0.0002863481,0.0004019611,0.0010880237,0.00028029192,0.35272342,0.07705966,0.485553,0.08089096,0.000207115],"about_ca_topic_score_codex":0.004355712,"about_ca_topic_score_gemma":0.0025172338,"teacher_disagreement_score":0.00907054,"about_ca_system_score_codex":0.00083649036,"about_ca_system_score_gemma":0.0019360284,"threshold_uncertainty_score":0.03034401},"labels":[],"label_agreement":null},{"id":"W1511791001","doi":"10.1007/11549468_7","title":"Fast Convex Closure for Efficient Predicate Detection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Predicate (mathematical logic); Algorithm; Closure (psychology); Regular polygon; Event (particle physics); Debugging; Theoretical computer science; Mathematics; Programming language","score_opus":0.011646446237777603,"score_gpt":0.2326366543931749,"score_spread":0.2209902081553973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511791001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028121,0.00018832817,0.99302775,0.00012555989,0.00008205125,0.00006171248,0.00016495284,0.0017953039,0.001742231],"genre_scores_gemma":[0.12935472,0.0003767573,0.8599411,0.00019475559,0.00020964982,0.0003143659,0.0012363584,0.0010833348,0.007288942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968087,0.0006599533,0.00019309195,0.00058395864,0.0013726198,0.00038166507],"domain_scores_gemma":[0.9941115,0.0035747567,0.00024375235,0.0011211935,0.00077579526,0.00017301863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022069982,0.001982183,0.002900862,0.0015994925,0.0009774333,0.0029333155,0.0022803294,0.0012591921,0.01086566],"category_scores_gemma":[0.009098187,0.0013101196,0.0017146841,0.0017184312,0.0016563998,0.004647688,0.0045205047,0.0045999666,0.0033578246],"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.00087830384,0.0002508795,0.00048705048,0.0004251354,0.00008038777,0.00021336148,0.00021267931,0.11825991,0.018752385,0.1856182,0.03499899,0.6398228],"study_design_scores_gemma":[0.00003772232,0.000056603876,0.00010194977,0.00002454315,0.00001071436,0.00009970272,0.000039776154,0.8796621,0.00804623,0.10739763,0.004500683,0.000022373937],"about_ca_topic_score_codex":0.0027675168,"about_ca_topic_score_gemma":0.0030224791,"teacher_disagreement_score":0.01086566,"about_ca_system_score_codex":0.001439707,"about_ca_system_score_gemma":0.0017974842,"threshold_uncertainty_score":0.036349237},"labels":[],"label_agreement":null},{"id":"W1511812674","doi":"10.1007/978-3-642-13437-1_64","title":"Cultural Adaptation of Pedagogical Resources within Intelligent Tutorial Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"International Student and Expatriate Challenges","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":"Université de Montréal","funders":"","keywords":"Computer science; Adaptation (eye); Personalization; Multimedia; Resource (disambiguation); Human–computer interaction; World Wide Web; Intelligent tutoring system","score_opus":0.0922292403986229,"score_gpt":0.3514148360269644,"score_spread":0.2591855956283415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511812674","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.7298159,0.0010076178,0.15565921,0.00087805616,0.0000869295,0.00017183226,0.00013300157,0.0008098051,0.11143771],"genre_scores_gemma":[0.9712711,0.00020806958,0.021518817,0.00006285737,0.000012872766,0.000041967265,0.00010443973,0.00013155917,0.0066482904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987866,0.0008001154,0.00005316335,0.00014849806,0.00012859072,0.00008298547],"domain_scores_gemma":[0.99676716,0.0016381786,0.00021907961,0.0006827538,0.00046793954,0.00022481113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012870738,0.0002667061,0.00017527565,0.000553789,0.00070895825,0.0031310308,0.00091369916,0.00068150775,0.0036755723],"category_scores_gemma":[0.0113956155,0.00025179776,0.00023510982,0.0006055364,0.0008443,0.0031183374,0.002161794,0.0006880193,0.00061115937],"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.0004390604,0.0006254833,0.028112995,0.00033764308,0.0001485017,0.0009808594,0.048709795,0.036472272,0.03653206,0.07626398,0.006364464,0.76501286],"study_design_scores_gemma":[0.00016798532,0.0009774665,0.116047114,0.0007349665,0.0006240715,0.002583761,0.05882357,0.35835215,0.071518674,0.16752996,0.22224297,0.00039732916],"about_ca_topic_score_codex":0.0033171803,"about_ca_topic_score_gemma":0.0042072632,"teacher_disagreement_score":0.0036755723,"about_ca_system_score_codex":0.00086393463,"about_ca_system_score_gemma":0.0008165595,"threshold_uncertainty_score":0.012296021},"labels":[],"label_agreement":null},{"id":"W1511842811","doi":"10.1007/11766247_31","title":"Partial Local FriendQ Multiagent Learning: Application to Team Automobile Coordination Problem","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Université Laval","funders":"","keywords":"Observability; Reinforcement learning; Computer science; Multi-agent system; Degree (music); Observable; Mathematical optimization; Computation; Artificial intelligence; Mathematics; Algorithm; Applied mathematics","score_opus":0.006367876696141645,"score_gpt":0.24259299922135455,"score_spread":0.2362251225252129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511842811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08679021,0.0002445054,0.90871096,0.00037571415,0.000044757515,0.00006437373,0.00005878963,0.0005398497,0.003170787],"genre_scores_gemma":[0.88147205,0.00010438628,0.11544194,0.00008656733,0.000041392155,0.00015046453,0.00010698674,0.00008983689,0.0025063807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960107,0.00018368404,0.000017223843,0.00007488321,0.000075221906,0.00004788505],"domain_scores_gemma":[0.9973908,0.0017807061,0.00016287676,0.00018266871,0.00031410952,0.00016887474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021253787,0.00066359836,0.0012445474,0.00048958964,0.0009265093,0.00063299085,0.00157574,0.001314314,0.0030854738],"category_scores_gemma":[0.006171744,0.00037835896,0.00043356928,0.00068242155,0.00077442365,0.0012661266,0.0019119785,0.00088449806,0.00025199275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012102444,0.00009524153,0.0006864483,0.00008525859,0.000032433916,0.00006649305,0.00010213785,0.9299537,0.000531355,0.012039475,0.0017510969,0.054535467],"study_design_scores_gemma":[0.000012554848,0.000024099249,0.000044823257,0.0000014428542,0.0000025539728,0.000005210005,0.00000766372,0.9957496,0.0000825869,0.0039587254,0.00010912445,0.0000015766353],"about_ca_topic_score_codex":0.0050243908,"about_ca_topic_score_gemma":0.0039124126,"teacher_disagreement_score":0.0050243908,"about_ca_system_score_codex":0.0006982553,"about_ca_system_score_gemma":0.00078466185,"threshold_uncertainty_score":0.011240244},"labels":[],"label_agreement":null},{"id":"W1511951313","doi":"10.1007/978-3-642-11829-6_18","title":"Evolving Schemas for Streaming XML","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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","funders":"","keywords":"Computer science; XML; Streaming XML; Document Structure Description; XML Schema (W3C); Efficient XML Interchange; XML Schema Editor; Information retrieval; Programming language; World Wide Web; XML Encryption","score_opus":0.016097597737693148,"score_gpt":0.25388809504499166,"score_spread":0.2377904973072985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511951313","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.010413224,0.00074834906,0.97157043,0.00050999643,0.00017967403,0.00016943403,0.00090929016,0.007918265,0.007581339],"genre_scores_gemma":[0.090628736,0.0012020746,0.8863912,0.00023451405,0.000086916545,0.00024985016,0.0048113973,0.0024938013,0.013901515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881566,0.00024559483,0.00017732571,0.0002085601,0.00049314526,0.00005978009],"domain_scores_gemma":[0.9968549,0.0012173019,0.0001124776,0.0012219364,0.00047151354,0.00012180428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025302821,0.0005235049,0.0006133184,0.0010997426,0.0007651286,0.0026722106,0.0025724813,0.0012318557,0.008154413],"category_scores_gemma":[0.008850157,0.000836602,0.00090242556,0.0018897948,0.0009390528,0.006215302,0.0025358736,0.0021417271,0.0022240311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023956875,0.00013067092,0.0011111314,0.00032856152,0.000049419894,0.00032173123,0.0009502647,0.02317099,0.009874001,0.45661226,0.028395798,0.47881556],"study_design_scores_gemma":[0.00007749919,0.00010144487,0.00042949853,0.00019234953,0.00008012454,0.00076493266,0.00035572637,0.32290643,0.028898599,0.4354602,0.21065678,0.00007646893],"about_ca_topic_score_codex":0.002067055,"about_ca_topic_score_gemma":0.002219809,"teacher_disagreement_score":0.008154413,"about_ca_system_score_codex":0.0011239487,"about_ca_system_score_gemma":0.0008476986,"threshold_uncertainty_score":0.027279258},"labels":[],"label_agreement":null},{"id":"W1512004232","doi":"10.1007/978-3-540-25978-7_32","title":"Distributed Collision-Free/Collision-Controlled MAC Protocols for Mobile Ad Hoc Networks with Hidden Terminals","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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":"Computer science; Collision; Network packet; Computer network; Multiple Access with Collision Avoidance for Wireless; Collision problem; Wireless ad hoc network; Collision avoidance; Wireless; Real-time computing; Computer security; Telecommunications; Optimized Link State Routing Protocol; Routing protocol","score_opus":0.013332166374513434,"score_gpt":0.26825272900115343,"score_spread":0.25492056262664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512004232","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.004292962,0.0031441846,0.9866816,0.0002125747,0.0005116208,0.000117658514,0.000043398682,0.0008370523,0.0041589537],"genre_scores_gemma":[0.28902787,0.0048053083,0.6524984,0.00043651904,0.0008381349,0.00078644906,0.00046124638,0.00040890032,0.050737083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899465,0.00019503351,0.000054031578,0.00012238033,0.0005582712,0.00007555995],"domain_scores_gemma":[0.99835014,0.00062460755,0.00008344947,0.00046574217,0.00041673638,0.000059284346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017497678,0.0009957022,0.0009448315,0.00076180405,0.0007869809,0.0013132473,0.0031882266,0.0010368159,0.0034817196],"category_scores_gemma":[0.0028453264,0.00076751213,0.0004103706,0.00096408126,0.0008928431,0.002270944,0.0013088918,0.0022154956,0.0010833049],"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.00089657085,0.0003872272,0.00039457466,0.0006941118,0.00019389566,0.0003271008,0.0006763216,0.122756384,0.054072876,0.1710444,0.030531406,0.6180251],"study_design_scores_gemma":[0.00036284936,0.00044813138,0.0004341815,0.0001144427,0.00017482895,0.0005748998,0.00013737525,0.7805924,0.042725086,0.09433409,0.080012836,0.00008887225],"about_ca_topic_score_codex":0.00052320736,"about_ca_topic_score_gemma":0.0007507682,"teacher_disagreement_score":0.0034817196,"about_ca_system_score_codex":0.00074569776,"about_ca_system_score_gemma":0.00095549016,"threshold_uncertainty_score":0.011647522},"labels":[],"label_agreement":null},{"id":"W1512034865","doi":"10.1007/3-540-44801-2_18","title":"Towards a Novel OLAP Interface for Distributed Data Warehouses","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Online analytical processing; Computer science; Data warehouse; Interface (matter); Database; Operating system","score_opus":0.05422229387345219,"score_gpt":0.30263209788310247,"score_spread":0.2484098040096503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512034865","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.002714709,0.00012234542,0.98235345,0.00018146311,0.000084078834,0.00007018888,0.00013025377,0.013383162,0.00096046826],"genre_scores_gemma":[0.024491558,0.00024372079,0.9651097,0.0004843672,0.000104198574,0.00018121743,0.0008946769,0.002345903,0.0061446894],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726355,0.00038707838,0.00039619606,0.00040520844,0.001361674,0.0001862071],"domain_scores_gemma":[0.99667907,0.0008169785,0.0001315586,0.0011068297,0.0009559465,0.00030963824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038117226,0.0009867572,0.0013326019,0.0011218169,0.00095733727,0.007507983,0.005346597,0.0025655741,0.007969938],"category_scores_gemma":[0.007050767,0.0016941702,0.0012244816,0.0018757802,0.00090308185,0.008764398,0.0065921163,0.0034255337,0.0043720314],"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.0017669352,0.0006159322,0.0031882366,0.001067617,0.00035078663,0.0009009325,0.0027489888,0.010891655,0.09685545,0.11797881,0.078706875,0.6849278],"study_design_scores_gemma":[0.00040393157,0.00042649923,0.000994493,0.0002933003,0.00035688127,0.0015378232,0.00068670063,0.5237226,0.10683218,0.099098116,0.26542303,0.0002244338],"about_ca_topic_score_codex":0.0015511534,"about_ca_topic_score_gemma":0.00215151,"teacher_disagreement_score":0.007969938,"about_ca_system_score_codex":0.000700415,"about_ca_system_score_gemma":0.0010236289,"threshold_uncertainty_score":0.026662111},"labels":[],"label_agreement":null},{"id":"W1512073893","doi":"10.1007/978-3-540-30597-2_3","title":"Consistent Query Answers in Virtual Data Integration Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Consistency (knowledge bases); Monotone polygon; Semantics (computer science); Data integration; Data integrity; Theoretical computer science; Programming language; Data mining; Database; Mathematics; Artificial intelligence","score_opus":0.042520138598597275,"score_gpt":0.2679454521177179,"score_spread":0.22542531351912065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512073893","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.024167486,0.0017086279,0.9665306,0.0014329706,0.0001294286,0.00024933624,0.00028981856,0.001889002,0.0036027695],"genre_scores_gemma":[0.3256846,0.0011727639,0.66266954,0.0008344502,0.00023036318,0.00056115596,0.0019453779,0.0008680982,0.006033593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96364224,0.015323483,0.003985717,0.003221099,0.012435148,0.0013923564],"domain_scores_gemma":[0.95329857,0.031072956,0.0017641842,0.008692099,0.0044811266,0.0006910586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027006375,0.0009466192,0.0034980127,0.003479616,0.0035639042,0.011315776,0.006559307,0.0043953005,0.0049081976],"category_scores_gemma":[0.07021103,0.0030679272,0.0014764371,0.0064180973,0.0063159894,0.021211606,0.010027065,0.00439596,0.0010901584],"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.0013069742,0.00036367643,0.0026757114,0.00071231386,0.00018949927,0.0005689353,0.002983128,0.0597521,0.003918016,0.6373631,0.013084569,0.277082],"study_design_scores_gemma":[0.00017460833,0.00011474106,0.00028755094,0.00013001615,0.00015011367,0.0002533012,0.00085779256,0.20675902,0.0064599514,0.77153134,0.013209694,0.00007189226],"about_ca_topic_score_codex":0.0040883417,"about_ca_topic_score_gemma":0.0031281256,"teacher_disagreement_score":0.027006375,"about_ca_system_score_codex":0.002409974,"about_ca_system_score_gemma":0.0038134123,"threshold_uncertainty_score":0.14282507},"labels":[],"label_agreement":null},{"id":"W1512098262","doi":"10.1007/978-3-540-69057-3_14","title":"A Fuzzy Logic System for Evaluating Quality of Experience of Haptic-Based Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Haptic technology; Computer science; Usability; Human–computer interaction; Fuzzy inference system; Fuzzy logic; Quality of experience; Virtual reality; Inference; Modality (human–computer interaction); User interface; Quality (philosophy); Multimedia; Artificial intelligence; Fuzzy control system; Adaptive neuro fuzzy inference system; Quality of service; Programming language","score_opus":0.14247045504228595,"score_gpt":0.3776253828119956,"score_spread":0.23515492776970964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512098262","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.095453374,0.0003672365,0.89561915,0.00014111068,0.000101131285,0.00035462453,0.00044807183,0.001612215,0.0059031174],"genre_scores_gemma":[0.67216355,0.00018356563,0.32430753,0.000083002844,0.000043109794,0.00030491463,0.00033078808,0.00003576,0.0025477835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923384,0.0001415473,0.00007552256,0.000129835,0.00035678362,0.000062498366],"domain_scores_gemma":[0.9990233,0.00037164666,0.00007091651,0.00004796429,0.00042882442,0.00005736021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013581734,0.0005290981,0.00058901287,0.0014004037,0.00054655457,0.0012146871,0.0009096763,0.0006938266,0.0038365307],"category_scores_gemma":[0.00273613,0.00019545802,0.0005439091,0.0006295578,0.00039177295,0.0007783634,0.0004714462,0.00039793475,0.00059219607],"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.0027007987,0.0004991934,0.007173596,0.0005622563,0.00021003933,0.00034308305,0.0005780898,0.06624525,0.11976127,0.013169215,0.004363697,0.7843936],"study_design_scores_gemma":[0.00014246111,0.00082298316,0.0057516503,0.00011288167,0.0002592971,0.00028246065,0.0002280416,0.9508239,0.030098513,0.008286809,0.0030906405,0.00010034945],"about_ca_topic_score_codex":0.0051800376,"about_ca_topic_score_gemma":0.0056079696,"teacher_disagreement_score":0.0051800376,"about_ca_system_score_codex":0.0008641964,"about_ca_system_score_gemma":0.0007146135,"threshold_uncertainty_score":0.012834489},"labels":[],"label_agreement":null},{"id":"W1512110678","doi":"10.1007/bfb0023887","title":"Kleene automata and recursion theory","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Recursion (computer science); Kleene's recursion theorem; Primitive recursive function; Negation; Automaton; Class (philosophy); Finite-state machine; Mathematics; Turing machine; Discrete mathematics; Computer science; Algebra over a field; Algorithm; Theoretical computer science; Pure mathematics; Programming language; Artificial intelligence","score_opus":0.010200385523994044,"score_gpt":0.22829224856054825,"score_spread":0.2180918630365542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512110678","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01785852,0.04450935,0.25250027,0.0059281164,0.0015334431,0.000077168035,0.00053556095,0.00087763875,0.6761799],"genre_scores_gemma":[0.5157922,0.034736264,0.0806253,0.0016402308,0.002784308,0.00032556904,0.0012710806,0.0006451291,0.36217988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943465,0.00013996956,0.000040100003,0.00010001991,0.00021714978,0.00006801739],"domain_scores_gemma":[0.9993389,0.00041959572,0.00003037203,0.00009215721,0.000092691,0.000026202408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057404133,0.0008298165,0.0010314712,0.0017308203,0.001828096,0.0045017484,0.0010926978,0.0016915591,0.014271359],"category_scores_gemma":[0.0017423749,0.0007183392,0.0007954358,0.0029392568,0.004224601,0.009984664,0.0013312877,0.00368206,0.0045572557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033055776,0.0000054932866,0.000020181007,0.000040728628,0.00000249016,0.000020127189,0.0001841051,0.0002983127,0.00017544477,0.98934597,0.0024362742,0.007467518],"study_design_scores_gemma":[0.000002368354,0.0000025224513,0.000027479795,0.00001768971,0.0000029831351,0.000037440725,0.000034867157,0.00037295988,0.000131081,0.9726616,0.026703775,0.0000051928355],"about_ca_topic_score_codex":0.0015456576,"about_ca_topic_score_gemma":0.0020542312,"teacher_disagreement_score":0.014271359,"about_ca_system_score_codex":0.002346327,"about_ca_system_score_gemma":0.0010524888,"threshold_uncertainty_score":0.047742426},"labels":[],"label_agreement":null},{"id":"W1512206724","doi":"10.1007/978-3-662-45391-9_16","title":"Detection of REST Patterns and Antipatterns: A Heuristics-Based Approach","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Rest (music); Heuristics; Computer science; Representational state transfer; Software design pattern; Software engineering; Software; Web service; Artificial intelligence; World Wide Web; Operating system","score_opus":0.011310213024914164,"score_gpt":0.2200166335316755,"score_spread":0.20870642050676133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512206724","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.15673874,0.0013152718,0.82206935,0.00053857267,0.00015128186,0.0012528108,0.0028909778,0.008263326,0.0067796437],"genre_scores_gemma":[0.37070888,0.00047443117,0.6179126,0.00038721057,0.000070362454,0.0004060243,0.005595787,0.0005018845,0.0039428095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980275,0.0002942589,0.00019656157,0.0004924473,0.000665164,0.0003240734],"domain_scores_gemma":[0.9936965,0.0033873247,0.00079352513,0.0005293008,0.001318045,0.0002752857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011866349,0.0019923097,0.001865031,0.007477087,0.0009505796,0.0022129894,0.0021823675,0.0013893547,0.0024464442],"category_scores_gemma":[0.0054747034,0.00073059805,0.0021360668,0.0037920356,0.00079982745,0.001564712,0.0010278387,0.0011229395,0.0010947093],"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.0013647863,0.0014993434,0.06459004,0.0015967492,0.00067133293,0.0022354643,0.0008263997,0.0379815,0.07742935,0.0107197445,0.017569225,0.7835161],"study_design_scores_gemma":[0.00021055242,0.0006464729,0.026991807,0.00026078997,0.0007255996,0.002682506,0.001285639,0.8810544,0.051294394,0.022775734,0.011908154,0.00016393882],"about_ca_topic_score_codex":0.0085455915,"about_ca_topic_score_gemma":0.012319351,"teacher_disagreement_score":0.0085455915,"about_ca_system_score_codex":0.00080754247,"about_ca_system_score_gemma":0.002455629,"threshold_uncertainty_score":0.016991675},"labels":[],"label_agreement":null},{"id":"W1512254831","doi":"10.1007/3-540-45687-2_27","title":"Algorithms for Computing Small NFAs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.03125291508506543,"score_gpt":0.248655068798754,"score_spread":0.21740215371368854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512254831","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.016119668,0.00059571344,0.9703616,0.00034790367,0.00010015536,0.00013743312,0.000300045,0.003402844,0.008634735],"genre_scores_gemma":[0.1456701,0.00071587856,0.8403818,0.0002175338,0.00016309721,0.0004914438,0.0013919341,0.0008698327,0.01009839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.0003666922,0.00015203412,0.00043345283,0.0005219419,0.00019799208],"domain_scores_gemma":[0.99053264,0.0062614805,0.00028702928,0.00207105,0.0006119018,0.00023582074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018173929,0.0016558109,0.0016523493,0.0024890194,0.0015416581,0.0038992371,0.0033937455,0.0016248425,0.018688088],"category_scores_gemma":[0.010762238,0.0010295586,0.0023425962,0.0035792498,0.0022872547,0.012272032,0.0040504215,0.0032700016,0.004109787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042391077,0.000185711,0.0010807426,0.000677907,0.00008717703,0.00007988082,0.00052399136,0.032598272,0.0057928115,0.4800432,0.012553978,0.46595252],"study_design_scores_gemma":[0.0000673363,0.000044443335,0.00016931847,0.000071251656,0.00006175161,0.000095593256,0.00011003777,0.10970365,0.0035486312,0.8763294,0.009773848,0.000024814437],"about_ca_topic_score_codex":0.001556579,"about_ca_topic_score_gemma":0.0034076388,"teacher_disagreement_score":0.018688088,"about_ca_system_score_codex":0.002065587,"about_ca_system_score_gemma":0.0013819858,"threshold_uncertainty_score":0.06251788},"labels":[],"label_agreement":null},{"id":"W1512293023","doi":"10.1007/11919476_26","title":"Shape Tracking and Registration for 4D Visualization of MRI and Structure","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Visualization; Fluoroscopy; Matching (statistics); Real-time MRI; Chin; Face (sociological concept); Pattern recognition (psychology); Magnetic resonance imaging; Radiology; Medicine; Anatomy","score_opus":0.017864903433592167,"score_gpt":0.29184546350112733,"score_spread":0.2739805600675352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512293023","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.0016869131,0.00036064055,0.99288416,0.00010725064,0.000050706618,0.000040621737,0.00011064649,0.0035491786,0.0012099829],"genre_scores_gemma":[0.022679245,0.0009752145,0.9694234,0.00009211724,0.000045110148,0.000099739176,0.00038750865,0.0014682292,0.004829428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996315,0.00006330636,0.000026120397,0.00005833423,0.00018761473,0.000033213095],"domain_scores_gemma":[0.99937314,0.00026639324,0.000049602277,0.00016812654,0.00011029794,0.000032537475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080058386,0.0010628195,0.0007499919,0.0015565271,0.00040021812,0.0017254674,0.0017358466,0.0015641132,0.01456459],"category_scores_gemma":[0.0019411646,0.0011788635,0.0009809092,0.0015609754,0.00050227565,0.001331417,0.0012731429,0.0013849022,0.0065365364],"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.00019613277,0.000053887772,0.00032514727,0.00041852027,0.000078030724,0.0001986581,0.00029782098,0.023185764,0.19676945,0.0151925925,0.016473578,0.74681044],"study_design_scores_gemma":[0.00005894878,0.00015576549,0.002103871,0.000121401245,0.000098872326,0.0018543071,0.00012249175,0.5769742,0.29510793,0.036330804,0.086922504,0.0001488292],"about_ca_topic_score_codex":0.0017853284,"about_ca_topic_score_gemma":0.0038140449,"teacher_disagreement_score":0.01456459,"about_ca_system_score_codex":0.0004976113,"about_ca_system_score_gemma":0.00075400574,"threshold_uncertainty_score":0.04872346},"labels":[],"label_agreement":null},{"id":"W1512324470","doi":"10.1007/11768012_30","title":"Adaptive Patient Education Framework Featuring Personalized Cardiovascular Risk Management Interventions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diabetes Management and Education","field":"Medicine","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":"Dalhousie University","funders":"","keywords":"Personalization; Computer science; Psychological intervention; Adaptive hypermedia; Ontology; Hypermedia; Risk management; Web application; Psychosocial; Multimedia; Knowledge management; Medicine; World Wide Web; Nursing","score_opus":0.01601325341507784,"score_gpt":0.25806526187377715,"score_spread":0.2420520084586993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512324470","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.05599953,0.00035162433,0.8850102,0.001323783,0.00024488303,0.00049260596,0.0009813845,0.028543882,0.027052118],"genre_scores_gemma":[0.41831616,0.00040685985,0.5475726,0.0011776135,0.00010061262,0.0005010464,0.0017181694,0.0004096565,0.029797291],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980015,0.000045667697,0.000013052608,0.00004551248,0.000065563414,0.000030074427],"domain_scores_gemma":[0.99963546,0.00017671831,0.000018397006,0.000026276306,0.000057179113,0.000085962754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043134505,0.00051034597,0.00030751433,0.00036089902,0.0002270397,0.0007328535,0.001256159,0.0008620441,0.010720932],"category_scores_gemma":[0.0008632574,0.00022211013,0.00029673747,0.00017791486,0.00014063828,0.0005169503,0.0008558497,0.0007936247,0.0014281865],"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.0011443652,0.0028312532,0.00615786,0.0003003399,0.00013004117,0.0011530204,0.00053574727,0.08233603,0.031689182,0.015834335,0.061318193,0.79656965],"study_design_scores_gemma":[0.00041922348,0.00063087477,0.0057744714,0.000118443044,0.00019824377,0.0011635687,0.00018222762,0.8533836,0.030285483,0.020648377,0.08707963,0.000115814124],"about_ca_topic_score_codex":0.0024844336,"about_ca_topic_score_gemma":0.0037297583,"teacher_disagreement_score":0.010720932,"about_ca_system_score_codex":0.0003890499,"about_ca_system_score_gemma":0.0008182083,"threshold_uncertainty_score":0.035865128},"labels":[],"label_agreement":null},{"id":"W1512546332","doi":"10.1007/978-3-540-75520-3_5","title":"Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Evolutionarily stable strategy; Bayesian game; Mathematical economics; Stability (learning theory); Best response; Set (abstract data type); Computer science; Bayesian probability; Strategy; Routing (electronic design automation); Evolutionary dynamics; Mathematical optimization; Game theory; Correlated equilibrium; Equilibrium selection; Mathematics; Repeated game; Artificial intelligence; Machine learning","score_opus":0.06399736059940628,"score_gpt":0.3374010393084751,"score_spread":0.2734036787090688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512546332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17654872,0.0010032082,0.73810613,0.0041034212,0.0001150282,0.0001245539,0.00017387219,0.00014651507,0.07967859],"genre_scores_gemma":[0.9132231,0.0010919507,0.060570225,0.00037539995,0.00020100382,0.00020885887,0.00011415863,0.00007545187,0.024140025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875116,0.00065508246,0.00004293211,0.00016832183,0.00017802691,0.000204388],"domain_scores_gemma":[0.99649197,0.002464682,0.00032604852,0.000173245,0.00021394882,0.0003300782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022081966,0.0006518591,0.0015440389,0.0007691144,0.0009079151,0.0025760368,0.0018945344,0.00354283,0.0058874115],"category_scores_gemma":[0.010073759,0.0006641912,0.0010995829,0.0011156884,0.002437433,0.0043643955,0.0019075912,0.0020389247,0.00058551505],"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.000050820952,0.00004824653,0.00051225844,0.00009122133,0.000038232956,0.00014144152,0.00027706326,0.061461996,0.0010530477,0.92244804,0.0024829893,0.011394585],"study_design_scores_gemma":[0.000034811696,0.000024766468,0.00038253592,0.000018154753,0.00001519591,0.00015497567,0.00009868785,0.18831155,0.00014217122,0.80933845,0.001457973,0.000020739191],"about_ca_topic_score_codex":0.0023699393,"about_ca_topic_score_gemma":0.0027222396,"teacher_disagreement_score":0.0058874115,"about_ca_system_score_codex":0.0017663715,"about_ca_system_score_gemma":0.0012075912,"threshold_uncertainty_score":0.019695401},"labels":[],"label_agreement":null},{"id":"W1512553031","doi":"10.1007/978-3-540-77684-0_16","title":"Visibly Pushdown Transducers for Approximate Validation of Streaming XML","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Well-formed document; XML validation; Document Structure Description; XML; Pushdown automaton; Streaming XML; Programming language; XML Schema (W3C); XML Encryption; Theoretical computer science; Automaton; World Wide Web","score_opus":0.01680012912695094,"score_gpt":0.23939827623336368,"score_spread":0.22259814710641274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512553031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014907173,0.00019045091,0.97694904,0.00026044066,0.000115777904,0.00008380707,0.00023480863,0.00510512,0.0021533426],"genre_scores_gemma":[0.55083567,0.00030149077,0.43874332,0.00031831992,0.00015111956,0.00031772334,0.0013023464,0.0018048341,0.006225131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99350834,0.002051421,0.00063194684,0.0011058325,0.0021789,0.00052358024],"domain_scores_gemma":[0.9681773,0.020078557,0.00090752024,0.008292479,0.0022211645,0.00032297202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050437534,0.0010217538,0.0016294958,0.0012919914,0.0012440598,0.0036510224,0.0033716096,0.0024178617,0.006924341],"category_scores_gemma":[0.026615564,0.0014628398,0.0023367906,0.00135894,0.0036784231,0.009154844,0.0059240703,0.004456278,0.0017913781],"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.0011741052,0.0001853441,0.0021168962,0.0007660929,0.00020143834,0.0007528511,0.0012599698,0.176989,0.0352432,0.57972217,0.0064010224,0.19518787],"study_design_scores_gemma":[0.00004784091,0.00009270072,0.00020451393,0.00008011371,0.000079261794,0.0001868537,0.00015226183,0.4605346,0.031624313,0.50237936,0.0045563406,0.00006184075],"about_ca_topic_score_codex":0.0017448132,"about_ca_topic_score_gemma":0.0026965404,"teacher_disagreement_score":0.006924341,"about_ca_system_score_codex":0.001984845,"about_ca_system_score_gemma":0.0020584585,"threshold_uncertainty_score":0.02667427},"labels":[],"label_agreement":null},{"id":"W1512617802","doi":"10.1007/3-540-44399-1_34","title":"Summary Generation and Evaluation in SumUM","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Automatic summarization; Computer science; Natural language processing; Task (project management); Categorization; Information retrieval; Text generation; Artificial intelligence; Quality (philosophy); Text categorization; Systems engineering","score_opus":0.022935132657252628,"score_gpt":0.28130164934070984,"score_spread":0.2583665166834572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512617802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05565504,0.0046458184,0.784592,0.0018041129,0.0012781724,0.0011823884,0.011776547,0.09117818,0.04788776],"genre_scores_gemma":[0.35152826,0.000959369,0.58329165,0.0005170684,0.00039357503,0.00078524265,0.019115046,0.00599453,0.037415307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945868,0.002472018,0.000624055,0.00065273285,0.0014359596,0.00022841756],"domain_scores_gemma":[0.99118644,0.004518779,0.00037427247,0.0016943053,0.0019474871,0.00027866242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047905724,0.0012330689,0.0016880906,0.0031819225,0.0008728012,0.003789738,0.0021058808,0.001092551,0.035030603],"category_scores_gemma":[0.020830054,0.00067557977,0.0009799261,0.0020769285,0.00056249136,0.0044836313,0.0032085108,0.0008351014,0.011293722],"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.0014749027,0.00019010007,0.0017624486,0.00083334785,0.00011311722,0.00020891812,0.00044195948,0.008258572,0.0057647107,0.020690626,0.08443163,0.87582964],"study_design_scores_gemma":[0.00089970994,0.00095855317,0.005380002,0.00053187454,0.00059064856,0.00080124,0.001025702,0.5261112,0.09617414,0.12561254,0.24171932,0.00019511451],"about_ca_topic_score_codex":0.0025625632,"about_ca_topic_score_gemma":0.0043370086,"teacher_disagreement_score":0.035030603,"about_ca_system_score_codex":0.0011456868,"about_ca_system_score_gemma":0.0013118553,"threshold_uncertainty_score":0.11718905},"labels":[],"label_agreement":null},{"id":"W151262848","doi":"10.1007/978-3-319-08416-9_15","title":"Extended Abstract: Combining Statistical Analysis and Markov Models with Public Health Data to Infer Age-Specific Background Mortality Rates for Hepatitis C Infection in the U.S.","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hepatitis C virus research","field":"Medicine","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":"Ivey Foundation","funders":"","keywords":"Medicine; Public health; Mortality rate; Hepatitis C; Markov model; Demography; Population; Environmental health; Markov chain; Immunology; Internal medicine; Statistics; Pathology; Mathematics","score_opus":0.18205762712071472,"score_gpt":0.40032020191719664,"score_spread":0.21826257479648192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151262848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011063534,0.0093766665,0.82892954,0.013762181,0.0073677446,0.00033165902,0.061143253,0.0061887037,0.061836775],"genre_scores_gemma":[0.24310783,0.01697069,0.48881808,0.00414525,0.009237425,0.0010893936,0.08662967,0.0031888664,0.1468128],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964523,0.00013282544,0.000023166285,0.00008210294,0.00009847497,0.000018238461],"domain_scores_gemma":[0.9964708,0.0027455078,0.0000960703,0.000266148,0.00036237953,0.000059036676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012923958,0.0006353947,0.00045904852,0.0011447694,0.00025516062,0.0012350872,0.0012673374,0.000597427,0.058609586],"category_scores_gemma":[0.008675256,0.00030015243,0.0012895843,0.0017135891,0.00028242235,0.0014861546,0.00066848984,0.0009318534,0.014948469],"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.00010564041,0.00012635015,0.0064478596,0.00088519556,0.00024446056,0.00024784112,0.00015008975,0.04581511,0.0008804463,0.037116222,0.62422615,0.28375462],"study_design_scores_gemma":[0.000088825116,0.00014551233,0.012507019,0.0008299583,0.00020817874,0.00070170127,0.00014596878,0.3409547,0.0025129009,0.33224282,0.30949816,0.0001642256],"about_ca_topic_score_codex":0.0063215676,"about_ca_topic_score_gemma":0.009413288,"teacher_disagreement_score":0.058609586,"about_ca_system_score_codex":0.0004492236,"about_ca_system_score_gemma":0.00092548586,"threshold_uncertainty_score":0.19606858},"labels":[],"label_agreement":null},{"id":"W1512660772","doi":"10.1007/978-3-642-13136-3_33","title":"A Novel Algorithm for Faults Acquiring and Locating on Fiber Optic Cable Line","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Blocking (statistics); Fault (geology); Optical fiber; Line (geometry); Point (geometry); Optical fiber cable; Telecommunications network; Real-time computing; Computer network; Telecommunications; Geology; Seismology","score_opus":0.013301439462936182,"score_gpt":0.23693678548135175,"score_spread":0.22363534601841556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512660772","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.009304835,0.00013365671,0.98843247,0.00004164506,0.00004998184,0.0000608332,0.000043895143,0.001205886,0.0007267195],"genre_scores_gemma":[0.0930641,0.00018542295,0.9017906,0.00005672019,0.000052518815,0.00012403108,0.0002857522,0.00008146904,0.0043593496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.000038538972,0.00003217657,0.00016116434,0.0001892995,0.00006436434],"domain_scores_gemma":[0.9996257,0.00008235118,0.000041373285,0.000055147626,0.00017511328,0.000020273057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002960683,0.0010673053,0.0010435281,0.0011942203,0.0008427676,0.0010064025,0.0016397756,0.001155056,0.0036360025],"category_scores_gemma":[0.0007671447,0.00045361684,0.0005066637,0.0011413161,0.00036048092,0.0012856887,0.0009652348,0.0006900132,0.0011100898],"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.0003291929,0.00010259502,0.0010686672,0.00016231596,0.000048744925,0.00015167911,0.0001011118,0.066502705,0.041527607,0.0039055175,0.004891511,0.8812084],"study_design_scores_gemma":[0.00007077652,0.00017212797,0.0008721425,0.000014616372,0.000051552823,0.00041048945,0.000075248296,0.96309793,0.026757035,0.002909685,0.005537044,0.000031265623],"about_ca_topic_score_codex":0.0059399935,"about_ca_topic_score_gemma":0.0062492997,"teacher_disagreement_score":0.0059399935,"about_ca_system_score_codex":0.0006377918,"about_ca_system_score_gemma":0.0014074931,"threshold_uncertainty_score":0.012163639},"labels":[],"label_agreement":null},{"id":"W1512661636","doi":"10.1007/978-3-642-20095-3_23","title":"Unsupervised and Open Ontology-Based Semantic Analysis","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Simon Fraser University","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Parsing; Grammar; Ontology; Grammar induction; Inference; Rule-based machine translation; Linguistics","score_opus":0.023439337734706356,"score_gpt":0.2741637432299051,"score_spread":0.25072440549519875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512661636","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.00780361,0.00025970142,0.9837473,0.00022761915,0.00005978792,0.00009583969,0.0012554557,0.0016504236,0.004900251],"genre_scores_gemma":[0.13933101,0.00067221565,0.84314865,0.00015769042,0.00007124168,0.00028252538,0.009115839,0.0007168211,0.006504107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689543,0.00060726854,0.000284813,0.0007166107,0.0012971436,0.00019871058],"domain_scores_gemma":[0.9970471,0.0011465257,0.00017731955,0.0007721747,0.0007616284,0.00009522948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018475782,0.0007035761,0.00085108745,0.0047730203,0.0016511935,0.0039581438,0.0019864275,0.0008601877,0.0035412752],"category_scores_gemma":[0.0061054737,0.00048157532,0.002413556,0.005229164,0.0015828371,0.007001455,0.0042113145,0.0021938519,0.0018434454],"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.00021595381,0.0004407687,0.003498964,0.0005544942,0.00029383475,0.00031444296,0.0013258025,0.017016035,0.017446421,0.26560286,0.017821023,0.67546946],"study_design_scores_gemma":[0.00002602135,0.000046689966,0.0032522073,0.00020117706,0.00017896421,0.000493106,0.0010549282,0.30035138,0.021903275,0.6099902,0.06242461,0.000077474324],"about_ca_topic_score_codex":0.0054391613,"about_ca_topic_score_gemma":0.010463312,"teacher_disagreement_score":0.0054391613,"about_ca_system_score_codex":0.001584286,"about_ca_system_score_gemma":0.0034236282,"threshold_uncertainty_score":0.011846721},"labels":[],"label_agreement":null},{"id":"W1512669332","doi":"10.1007/11587514_15","title":"Induction Variable Analysis with Delayed Abstractions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Compiler; Scalar (mathematics); Representation (politics); Abstraction; Variable (mathematics); Benchmark (surveying); Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.013560627076295967,"score_gpt":0.24620673216598962,"score_spread":0.23264610508969366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512669332","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.004630622,0.0003616049,0.98225594,0.00021120507,0.00015353324,0.0000353309,0.00012379665,0.0010743364,0.011153602],"genre_scores_gemma":[0.30213967,0.0013199825,0.6341618,0.0004509134,0.00045683375,0.00028179467,0.0009520847,0.0017755142,0.058461465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.00027648764,0.000060113063,0.00026914332,0.00049918034,0.00020760726],"domain_scores_gemma":[0.99852294,0.0007214254,0.0000669452,0.00044462687,0.0001906642,0.00005340947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016884907,0.0010668692,0.0010152071,0.0013006099,0.00095804944,0.0017852249,0.0029463994,0.0006831666,0.010026446],"category_scores_gemma":[0.0033674622,0.00083770556,0.0016875748,0.0017459024,0.002027553,0.0046527423,0.003290154,0.0047070766,0.003054388],"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.00013245949,0.000036508405,0.00031081846,0.00012969117,0.000035991827,0.00007502306,0.00013787461,0.010403387,0.0039203563,0.89226025,0.0060455557,0.086512126],"study_design_scores_gemma":[0.000020354983,0.000022393042,0.0001570891,0.000032400632,0.000043991968,0.00005937604,0.000023575401,0.041964803,0.007854317,0.9310828,0.018720351,0.000018555193],"about_ca_topic_score_codex":0.00077163766,"about_ca_topic_score_gemma":0.00095475675,"teacher_disagreement_score":0.010026446,"about_ca_system_score_codex":0.0015362609,"about_ca_system_score_gemma":0.0011346693,"threshold_uncertainty_score":0.03354186},"labels":[],"label_agreement":null},{"id":"W1512710096","doi":"10.1007/3-540-36189-8_5","title":"WSOL — Web Service Offerings Language","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":138,"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":"WS-Policy; Computer science; Web service; World Wide Web; WS-I Basic Profile; Devices Profile for Web Services; Service design; Service (business); Web modeling; WS-Addressing; Web standards; Web Coverage Service; Differentiated service; Web development; Database; Service delivery framework; Web application security; Business","score_opus":0.01056785347709832,"score_gpt":0.21979082931239186,"score_spread":0.20922297583529353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512710096","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.0041067014,0.0010883715,0.81245226,0.0015895697,0.0011154552,0.000462699,0.006852281,0.09073042,0.081602216],"genre_scores_gemma":[0.08510889,0.0060174214,0.57626337,0.0039024567,0.0010184037,0.0017003568,0.05150971,0.04247294,0.23200646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993129,0.00011480035,0.00009875178,0.000077042074,0.00030785284,0.00008864622],"domain_scores_gemma":[0.999458,0.00016652793,0.000045287215,0.00010414266,0.00015730667,0.00006879512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008917451,0.0013847656,0.0007098445,0.0018059957,0.00073897373,0.003721286,0.002039243,0.0010906382,0.027699782],"category_scores_gemma":[0.0019299282,0.0007335166,0.00083476887,0.0023800014,0.00091401476,0.004922279,0.0015191959,0.0025603715,0.031019412],"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.00026651588,0.00020950157,0.00031692162,0.0010370106,0.000041578605,0.00038299093,0.00044562813,0.0031041666,0.015003621,0.4234962,0.29276413,0.26293173],"study_design_scores_gemma":[0.000048997557,0.000030108258,0.00008970365,0.00012102923,0.000021022503,0.0003216998,0.00005432931,0.008480929,0.00795362,0.052323226,0.93051213,0.00004322572],"about_ca_topic_score_codex":0.0023666169,"about_ca_topic_score_gemma":0.0015407028,"teacher_disagreement_score":0.027699782,"about_ca_system_score_codex":0.00089410477,"about_ca_system_score_gemma":0.001488155,"threshold_uncertainty_score":0.09266496},"labels":[],"label_agreement":null},{"id":"W1512719693","doi":"10.1007/978-3-642-12297-2_18","title":"Object Detection with Multiple Motion Models","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer vision; Artificial intelligence; Motion (physics); Computer science; Tracking (education); Joint (building); Object (grammar); Object detection; Match moving; Motion detection; Video tracking; Motion estimation; Algorithm; Pattern recognition (psychology); Engineering","score_opus":0.02230703107053695,"score_gpt":0.2511055281632856,"score_spread":0.22879849709274863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512719693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028234154,0.0005522065,0.9949368,0.000058602538,0.000054466007,0.00001721553,0.000040734994,0.0008265453,0.00068998756],"genre_scores_gemma":[0.13036044,0.0014558545,0.85540694,0.00018685404,0.0001296284,0.00009691679,0.00067110406,0.0002987936,0.011393514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990903,0.00012354412,0.00004033826,0.0003132083,0.0003478823,0.000084716674],"domain_scores_gemma":[0.99947315,0.00020127428,0.000044702094,0.0001583366,0.00010042674,0.000022123571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096901634,0.0012356556,0.0017141226,0.0013334741,0.00031212505,0.0011945929,0.0018418614,0.0017384936,0.0027603302],"category_scores_gemma":[0.0020234913,0.0013094777,0.0012654503,0.0013165848,0.00047479136,0.001945614,0.001908808,0.0011950259,0.0026678944],"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.00017454877,0.00005474552,0.0004471083,0.00014806517,0.00015036244,0.00012417974,0.000042302927,0.05579933,0.03071652,0.0040695835,0.0037745708,0.90449864],"study_design_scores_gemma":[0.00001206003,0.00005866594,0.0006230177,0.000019364801,0.000047811925,0.00036222558,0.000012142823,0.96885175,0.016231006,0.008775935,0.004985402,0.000020582489],"about_ca_topic_score_codex":0.0019590969,"about_ca_topic_score_gemma":0.0023706339,"teacher_disagreement_score":0.0027603302,"about_ca_system_score_codex":0.00044605826,"about_ca_system_score_gemma":0.00039438665,"threshold_uncertainty_score":0.00923419},"labels":[],"label_agreement":null},{"id":"W1512720412","doi":"10.1007/978-3-642-13437-1_34","title":"Integrating Sophisticated Domain-Independent Pedagogical Behaviors in an ITS Framework","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Sophistication; Computer science; Domain (mathematical analysis); Task (project management); Domain model; Human–computer interaction; Domain knowledge; Artificial intelligence; Software engineering; Systems engineering","score_opus":0.05062723699820909,"score_gpt":0.3179018875932214,"score_spread":0.2672746505950123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512720412","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.013173575,0.00013615747,0.96891975,0.00026748085,0.000041572122,0.000106061496,0.00007375399,0.0024916364,0.014789873],"genre_scores_gemma":[0.32311612,0.00030887628,0.66707075,0.00011737459,0.000056077755,0.00017550534,0.00029944038,0.00041821017,0.008437651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881774,0.00039329354,0.00014897887,0.00020732547,0.00029822538,0.0001343993],"domain_scores_gemma":[0.9984451,0.00050119427,0.0001157471,0.0004683642,0.00024661463,0.00022307262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001848851,0.00046515896,0.00048440788,0.00064953044,0.00055830297,0.0026900314,0.001574014,0.0008647709,0.0038004138],"category_scores_gemma":[0.002550579,0.00039488435,0.0009985527,0.0005592945,0.0017214442,0.0027495043,0.002760127,0.0017848535,0.0014570076],"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.00016749343,0.000270793,0.0032923154,0.00043313557,0.00012847422,0.00019917158,0.0016115117,0.081361055,0.018309567,0.6604067,0.0032697362,0.23055007],"study_design_scores_gemma":[0.00004111716,0.000150424,0.0009810734,0.00019788406,0.0002245999,0.00024645336,0.00041934225,0.6014721,0.019193467,0.27373788,0.10327189,0.00006393118],"about_ca_topic_score_codex":0.0028969215,"about_ca_topic_score_gemma":0.004035388,"teacher_disagreement_score":0.0038004138,"about_ca_system_score_codex":0.0009508753,"about_ca_system_score_gemma":0.0019550445,"threshold_uncertainty_score":0.012713671},"labels":[],"label_agreement":null},{"id":"W1512756088","doi":"10.1007/978-3-642-16020-2_23","title":"Leveraging Semantic Technologies for Harmonization of Individual and Organizational Learning","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Knowledge Management and Sharing","field":"Social Sciences","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":"Athabasca University; Simon Fraser University","funders":"","keywords":"Computer science; Knowledge management; Knowledge sharing; Structuring; Organizational learning; Context (archaeology); Set (abstract data type); Representation (politics); Business","score_opus":0.02299830016039123,"score_gpt":0.2609533383318342,"score_spread":0.23795503817144298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512756088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014780633,0.00042109174,0.96711284,0.000841087,0.00012135309,0.000093405244,0.00018391013,0.0015410146,0.014904666],"genre_scores_gemma":[0.35688868,0.0007122623,0.6351541,0.00032494852,0.0000976038,0.00019057482,0.0012020293,0.00045063224,0.004979228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964581,0.0013224606,0.0004183634,0.0005368374,0.001068629,0.00019563842],"domain_scores_gemma":[0.9934962,0.0026102965,0.0002922276,0.0028643506,0.0005614583,0.00017542478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004629175,0.00043758776,0.0007262629,0.0020566266,0.00086710264,0.005194666,0.0016764357,0.0012196394,0.0034987757],"category_scores_gemma":[0.008876691,0.00044050027,0.0012847211,0.002844938,0.0024422898,0.015753122,0.00693583,0.0018544577,0.0009432484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015946497,0.00024066688,0.0015690617,0.00031826328,0.00012419866,0.00018530339,0.002998805,0.011855789,0.0064107734,0.5730926,0.00437927,0.39866576],"study_design_scores_gemma":[0.00003644127,0.00007732597,0.0010146849,0.00014436366,0.00011479254,0.0001922375,0.0015625937,0.08217274,0.01084551,0.83129895,0.07250154,0.000038732123],"about_ca_topic_score_codex":0.0011076132,"about_ca_topic_score_gemma":0.0020070425,"teacher_disagreement_score":0.005194666,"about_ca_system_score_codex":0.00090452604,"about_ca_system_score_gemma":0.001819207,"threshold_uncertainty_score":0.024481714},"labels":[],"label_agreement":null},{"id":"W1512825437","doi":"10.1007/978-3-540-77366-5_22","title":"Usable SPACE: Security, Privacy, and Context for the Mobile User","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":"Saint Mary's University","funders":"","keywords":"Computer science; Computer security; USable; Context (archaeology); Security through obscurity; Presentation (obstetrics); Logical security; Security information and event management; Information security; Key (lock); Security service; Security policy; Access control; IBM; Cloud computing security; Internet privacy; World Wide Web; Network security policy","score_opus":0.03230241922431587,"score_gpt":0.3078936372504733,"score_spread":0.27559121802615744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512825437","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.045605857,0.09171313,0.34278214,0.0205783,0.0020619063,0.000110947134,0.000413125,0.0011583079,0.49557635],"genre_scores_gemma":[0.74322826,0.04078739,0.059379227,0.002587456,0.0012526208,0.00028011043,0.00038029498,0.00042412427,0.15168053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.0002628781,0.000034921224,0.00009657925,0.00021320031,0.00009480097],"domain_scores_gemma":[0.99935466,0.00028034084,0.0000503306,0.00014217853,0.00008499776,0.00008763083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005633058,0.0007960098,0.00045110635,0.00060367543,0.0013812733,0.008097077,0.0010806862,0.0022285369,0.006911293],"category_scores_gemma":[0.0016805752,0.00033823762,0.00046157767,0.0010402625,0.004198582,0.010412573,0.0037074499,0.002415072,0.0016578853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074926036,0.000021282314,0.000628111,0.00029101505,0.00001800612,0.00023197428,0.009628327,0.0010152048,0.0026068615,0.8336665,0.018790634,0.1330272],"study_design_scores_gemma":[0.000010347024,0.00009748198,0.0008475659,0.0006437435,0.000036016703,0.0015144949,0.0049950746,0.0028920553,0.0026302608,0.37620118,0.6100785,0.000053211374],"about_ca_topic_score_codex":0.0015425268,"about_ca_topic_score_gemma":0.0016642656,"teacher_disagreement_score":0.008097077,"about_ca_system_score_codex":0.00072259706,"about_ca_system_score_gemma":0.001157923,"threshold_uncertainty_score":0.023120642},"labels":[],"label_agreement":null},{"id":"W1512835670","doi":"10.1007/3-540-45672-4_27","title":"Perceptions of Agile Practices: A Student Survey","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":61,"is_retracted":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; SAIT Polytechnic","funders":"","keywords":"Agile software development; Extreme programming; Bachelor; Perception; Pair programming; Coding (social sciences); Computer science; Preference; Extreme programming practices; Psychology; Software engineering; Software development; Sociology; Programming language; Software development process; Political science; Software","score_opus":0.042863992612493,"score_gpt":0.31284702899208267,"score_spread":0.26998303637958965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512835670","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.998539,0.000045649776,0.00012496875,0.00029263526,0.000010230889,0.000029519988,0.00012177861,0.000007803993,0.0008285297],"genre_scores_gemma":[0.99737895,0.000115017305,0.00019266641,0.0003493839,0.000015116482,0.00006553258,0.00017259146,0.000008059241,0.0017026792],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99713445,0.0007466841,0.0002685877,0.00024648613,0.00082615955,0.00077760685],"domain_scores_gemma":[0.98016775,0.0033769503,0.004585291,0.0007050089,0.0034244144,0.0077406126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036636442,0.00032706192,0.00066928734,0.0021315739,0.0016680697,0.0021124864,0.00044970732,0.0014337574,0.003764484],"category_scores_gemma":[0.0093420455,0.0006272879,0.0006170271,0.0014370299,0.0006996091,0.0017815975,0.00205013,0.0021507402,0.0019832181],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014717989,0.0022540675,0.96498466,0.000039120747,0.000035263427,0.00023290228,0.018961811,0.0000760367,0.00071508484,0.000111175,0.0009894567,0.011453279],"study_design_scores_gemma":[0.00003898049,0.0021558106,0.9481611,0.000040379815,0.00003370258,0.0005958478,0.043964736,0.00050466467,0.00056812103,0.000097675795,0.0037952363,0.000043719992],"about_ca_topic_score_codex":0.002234421,"about_ca_topic_score_gemma":0.003143383,"teacher_disagreement_score":0.003764484,"about_ca_system_score_codex":0.00061180076,"about_ca_system_score_gemma":0.0010498922,"threshold_uncertainty_score":0.019375443},"labels":[],"label_agreement":null},{"id":"W1512907145","doi":"10.1007/978-3-642-14785-2_10","title":"An Efficient Clusterhead Placement for Hybrid Sensor Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Software deployment; Computer science; Wireless sensor network; Cover (algebra); Distributed computing; Grid; Computer network; Task (project management); Position (finance); Real-time computing; Engineering","score_opus":0.011173248743602907,"score_gpt":0.23942633553036255,"score_spread":0.22825308678675965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512907145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010038083,0.0003437796,0.98398954,0.00010074969,0.00012812056,0.00008662088,0.000072285744,0.0008821736,0.0043586423],"genre_scores_gemma":[0.28153884,0.0005931529,0.70297366,0.00008543915,0.00011831795,0.00025421754,0.00023253934,0.00025855625,0.013945212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975294,0.000053364554,0.000010071715,0.000043933887,0.00011091294,0.000028660883],"domain_scores_gemma":[0.99979633,0.000060238664,0.000014395601,0.000050531315,0.00006271493,0.000015832504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029642956,0.0006941093,0.0006219177,0.00048484126,0.0006470158,0.0005404596,0.0015638042,0.00054363906,0.0042686234],"category_scores_gemma":[0.00063262234,0.00042095286,0.0003089737,0.0009183358,0.00030305862,0.0007367798,0.0011372111,0.00057524105,0.0008022418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038075264,0.00012542779,0.00036041532,0.00030315816,0.00006838355,0.000095221985,0.00009787023,0.53828096,0.036203735,0.02557698,0.01557039,0.38293663],"study_design_scores_gemma":[0.000024828707,0.000078928264,0.00020024166,0.000009872891,0.000017619108,0.00006195376,0.00002688828,0.98116803,0.0068607563,0.0065886574,0.004950691,0.000011509362],"about_ca_topic_score_codex":0.0019686935,"about_ca_topic_score_gemma":0.004137344,"teacher_disagreement_score":0.0042686234,"about_ca_system_score_codex":0.0006468216,"about_ca_system_score_gemma":0.0006346082,"threshold_uncertainty_score":0.014279962},"labels":[],"label_agreement":null},{"id":"W1512940807","doi":"10.1007/978-3-540-85958-1_7","title":"An Application of Constraint Programming to Superblock Instruction Scheduling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Waterloo","funders":"","keywords":"Computer science; Compiler; Parallel computing; Heuristics; Scheduling (production processes); Instruction scheduling; Suite; Optimizing compiler; Programming language; Mathematical optimization; Two-level scheduling; Schedule; Dynamic priority scheduling; Operating system; Mathematics","score_opus":0.012909769986630262,"score_gpt":0.24648779912681806,"score_spread":0.2335780291401878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512940807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002631395,0.0011792374,0.96597975,0.0004349728,0.0002440508,0.00009159275,0.0001767545,0.000708175,0.028554004],"genre_scores_gemma":[0.043170653,0.002277496,0.9444184,0.00021029144,0.00016417609,0.00015621095,0.00024933033,0.0004029404,0.008950462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940896,0.0001447813,0.000027155464,0.00007617384,0.0002946117,0.000048249134],"domain_scores_gemma":[0.9991165,0.0005816276,0.000031252737,0.00011094651,0.00013124396,0.000028492846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062837993,0.00089101295,0.0009225299,0.0008808736,0.0008244566,0.001542169,0.0018776988,0.0009722947,0.011767913],"category_scores_gemma":[0.0027477867,0.0007068571,0.0010288493,0.0034214924,0.0008760702,0.0013217026,0.0010992708,0.002490387,0.0015996028],"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.0001029,0.000105256455,0.0002257368,0.0003415178,0.00006107639,0.00024605266,0.00014355521,0.20371681,0.005460633,0.3272994,0.023798382,0.4384986],"study_design_scores_gemma":[0.000026969501,0.000030513907,0.00015915716,0.00007312496,0.000026921394,0.00012621577,0.00002994998,0.72298,0.0029599983,0.22613838,0.04741928,0.000029451085],"about_ca_topic_score_codex":0.012479488,"about_ca_topic_score_gemma":0.018088551,"teacher_disagreement_score":0.012479488,"about_ca_system_score_codex":0.0009546067,"about_ca_system_score_gemma":0.0015384898,"threshold_uncertainty_score":0.039367616},"labels":[],"label_agreement":null},{"id":"W1512943107","doi":"10.1007/11546849_25","title":"A Machine Learning Approach to Identifying Database Sessions Using Unlabeled Data","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"York University","funders":"","keywords":"Computer science; Session (web analytics); Database design; Data mining; Artificial intelligence; Machine learning; Database; World Wide Web","score_opus":0.31826524345177737,"score_gpt":0.4276292084454128,"score_spread":0.10936396499363543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512943107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052287434,0.00016359164,0.9928347,0.00015665425,0.000029645891,0.00007303513,0.0001639973,0.0006020671,0.0007474979],"genre_scores_gemma":[0.092129454,0.00024566575,0.901319,0.00015467178,0.00015038099,0.00023359222,0.00069980125,0.000116442265,0.004950899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796164,0.00083172147,0.00013357283,0.00051384885,0.00045046103,0.00010881745],"domain_scores_gemma":[0.99328196,0.0045967465,0.0002441592,0.00091626303,0.0007925585,0.00016837177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028704295,0.0007166014,0.0012293597,0.0024965864,0.0014434864,0.0015764807,0.0029466012,0.0017738929,0.002142507],"category_scores_gemma":[0.0077881236,0.00064432883,0.0013182434,0.002850831,0.0008938122,0.0032679355,0.0015188117,0.0021785165,0.0009750633],"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.0002621279,0.00079618127,0.0045197774,0.00020203066,0.000169575,0.00015538179,0.00040017618,0.1093577,0.008869788,0.037710764,0.011577865,0.8259786],"study_design_scores_gemma":[0.0000123864465,0.000058642305,0.00062301144,0.000014966919,0.000027763552,0.00008263733,0.000053169977,0.95588493,0.002467654,0.03845987,0.0022904987,0.000024514246],"about_ca_topic_score_codex":0.005050659,"about_ca_topic_score_gemma":0.0094212415,"teacher_disagreement_score":0.005050659,"about_ca_system_score_codex":0.0007439176,"about_ca_system_score_gemma":0.0011947397,"threshold_uncertainty_score":0.015180469},"labels":[],"label_agreement":null},{"id":"W1512958211","doi":"10.1007/978-3-540-24669-5_94","title":"Adaptive Noise Reduction in Microarray Images Based on the Center-Weighted Vector Medians","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Toronto","funders":"","keywords":"Computer science; Outlier; Noise reduction; Reduction (mathematics); Artificial intelligence; Noise (video); Median filter; Pattern recognition (psychology); Computer vision; Image (mathematics); Center (category theory); Image processing; Algorithm; Mathematics","score_opus":0.012123413276889941,"score_gpt":0.2317687317288312,"score_spread":0.21964531845194124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512958211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037715263,0.00024146594,0.99523926,0.000054774573,0.00004004654,0.000018483077,0.000034678254,0.00031014808,0.0002896177],"genre_scores_gemma":[0.03590958,0.00042143688,0.9617352,0.00005037274,0.000077145334,0.00010660085,0.00017190064,0.00012472058,0.0014031013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907184,0.0002097903,0.00005214957,0.00020706891,0.0003959991,0.00006305731],"domain_scores_gemma":[0.9991042,0.00042835766,0.000071671064,0.00010736673,0.00026204938,0.000026303198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013581791,0.00093794713,0.0016422123,0.0010311253,0.00046031948,0.0010457435,0.0014841231,0.0010816405,0.0020473602],"category_scores_gemma":[0.0022828586,0.00060639787,0.0014291228,0.0016359128,0.00076901476,0.0014717649,0.0009848835,0.0013064786,0.0008036956],"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.0005783901,0.00010395866,0.00043750036,0.00031298125,0.00018582828,0.00005871536,0.00014866969,0.12398677,0.1486806,0.024811946,0.003998131,0.69669664],"study_design_scores_gemma":[0.000021418893,0.00008359941,0.00069209747,0.000015471283,0.000046754576,0.00009583733,0.000021441212,0.9351198,0.047781866,0.011973818,0.0041056913,0.000042289263],"about_ca_topic_score_codex":0.0013152618,"about_ca_topic_score_gemma":0.0019071084,"teacher_disagreement_score":0.0020473602,"about_ca_system_score_codex":0.00081166177,"about_ca_system_score_gemma":0.00077384606,"threshold_uncertainty_score":0.0071828365},"labels":[],"label_agreement":null},{"id":"W1513008738","doi":"10.1007/978-3-642-01818-3_15","title":"Training Global Linear Models for Chinese Word Segmentation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Margin (machine learning); Segmentation; Word (group theory); Sentence; Artificial intelligence; Perceptron; Pattern recognition (psychology); Text segmentation; Linear model; Natural language processing; Speech recognition; Artificial neural network; Machine learning; Mathematics","score_opus":0.026751314275890333,"score_gpt":0.3085997165788049,"score_spread":0.2818484023029146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513008738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1073308,0.0051829373,0.8550294,0.00078752986,0.00056365,0.00017158144,0.0022414352,0.024123281,0.004569479],"genre_scores_gemma":[0.53311133,0.0018257668,0.41674113,0.0008678692,0.0005053816,0.00063155504,0.016729124,0.002863343,0.026724473],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928385,0.00017971332,0.00004559826,0.00031234956,0.000058548205,0.00012001632],"domain_scores_gemma":[0.99809974,0.0013376386,0.00006159583,0.00017957947,0.00023771047,0.00008368226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013419994,0.0030840966,0.0021230732,0.0015765182,0.0009597551,0.0013536692,0.0021573931,0.0022072627,0.009756326],"category_scores_gemma":[0.0029550423,0.0015348976,0.0018255458,0.0025782995,0.0007066163,0.0025782688,0.0017750129,0.0035877593,0.0056452774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008101602,0.00020838546,0.0015485841,0.00026818571,0.0002390915,0.0001886763,0.00016197671,0.18370166,0.00873025,0.002625253,0.020480424,0.78103733],"study_design_scores_gemma":[0.00003128276,0.00007170111,0.00033119973,0.000012318454,0.000046337227,0.000023134622,0.000050220693,0.99271095,0.0025780692,0.0030543094,0.0010773697,0.000013119694],"about_ca_topic_score_codex":0.02004873,"about_ca_topic_score_gemma":0.03426552,"teacher_disagreement_score":0.02004873,"about_ca_system_score_codex":0.0011566635,"about_ca_system_score_gemma":0.0018438192,"threshold_uncertainty_score":0.039864063},"labels":[],"label_agreement":null},{"id":"W1513009135","doi":"10.1007/978-3-540-71605-1_13","title":"GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Bidding; Genetic programming; Common value auction; Computer science; Decomposition; Genetic algorithm; Population; Classifier (UML); Mathematical optimization; Artificial intelligence; Combinatorial auction; Machine learning; Microeconomics; Economics; Mathematics","score_opus":0.025938851104528166,"score_gpt":0.2750009925150746,"score_spread":0.24906214141054642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513009135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015131214,0.00029476057,0.97812396,0.0003301056,0.00009910117,0.00008326235,0.00006905641,0.00028852094,0.005580183],"genre_scores_gemma":[0.3600119,0.0005401564,0.6216638,0.00022748622,0.00029306882,0.0004507528,0.00065643655,0.00033208748,0.015824333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00036460886,0.00005412227,0.00015171066,0.0002736044,0.00014756418],"domain_scores_gemma":[0.99783844,0.0013597797,0.00007335122,0.00018142554,0.00046686435,0.00008005859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018557081,0.0007579947,0.0019135644,0.00097258424,0.0005583988,0.0023144335,0.0012680413,0.0020457425,0.007677644],"category_scores_gemma":[0.0071850847,0.0005900065,0.0016269874,0.000955482,0.0005015461,0.0022414685,0.00111877,0.002160476,0.0010404086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013551505,0.00018042333,0.00053540687,0.00015144881,0.00007353049,0.00010631079,0.00008996866,0.66912884,0.0016624747,0.047807388,0.00837748,0.27175125],"study_design_scores_gemma":[0.000010731528,0.000013437317,0.00005916362,0.0000053135914,0.000008436506,0.000020557965,0.000009697559,0.9849332,0.00017977078,0.014237475,0.00051942776,0.0000028087284],"about_ca_topic_score_codex":0.0039826445,"about_ca_topic_score_gemma":0.0035575072,"teacher_disagreement_score":0.007677644,"about_ca_system_score_codex":0.0009988396,"about_ca_system_score_gemma":0.0014545913,"threshold_uncertainty_score":0.025684297},"labels":[],"label_agreement":null},{"id":"W1513020047","doi":"10.1007/11556930_61","title":"Area-Aware Pipeline Gating for Embedded Processors","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Pipeline (software); Overhead (engineering); Branch predictor; Power gating; Embedded system; Parallel computing; Simple (philosophy); Critical path method; Microarchitecture; Gating; Computer hardware; Operating system; Transistor","score_opus":0.023643820143294934,"score_gpt":0.2777259816483452,"score_spread":0.2540821615050503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513020047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07914987,0.0068348777,0.8826944,0.00039574815,0.00040807118,0.000049864713,0.0001612598,0.003098439,0.027207373],"genre_scores_gemma":[0.7937653,0.0034002508,0.17287771,0.00024830285,0.00015307083,0.000056836518,0.00028824297,0.00042087393,0.028789345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999522,0.0000056286176,0.0000018712319,0.000008402755,0.000019432171,0.00001242067],"domain_scores_gemma":[0.9999372,0.000021007845,0.0000075658036,0.000012325872,0.000016906572,0.000005016999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007526155,0.00036964793,0.00022513047,0.00018986237,0.00014841699,0.0002714407,0.00077188876,0.00020299276,0.0035482142],"category_scores_gemma":[0.00017494756,0.00021386553,0.0001491098,0.00036136364,0.00013380426,0.0004629629,0.0003105945,0.0004209035,0.00043772208],"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.00033860136,0.0001490546,0.0005613464,0.0004423974,0.000049661157,0.00015287759,0.00009365991,0.106699765,0.3040566,0.034658294,0.016504996,0.5362928],"study_design_scores_gemma":[0.00006776064,0.00052428944,0.0014790824,0.00007874703,0.00008754422,0.00040958924,0.00004211163,0.74558616,0.14885508,0.04805203,0.05479004,0.000027581082],"about_ca_topic_score_codex":0.00030156883,"about_ca_topic_score_gemma":0.0012856654,"teacher_disagreement_score":0.0035482142,"about_ca_system_score_codex":0.00016620161,"about_ca_system_score_gemma":0.00027739498,"threshold_uncertainty_score":0.011869907},"labels":[],"label_agreement":null},{"id":"W1513086313","doi":"10.1007/978-3-642-04271-3_14","title":"Feature-Based Morphometry","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"National Center for Research Resources; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.02757055956595886,"score_gpt":0.29299221170822004,"score_spread":0.26542165214226116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513086313","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.0056680636,0.00035643316,0.990488,0.00011585355,0.000045578407,0.0000533014,0.00045228243,0.0016717121,0.0011488594],"genre_scores_gemma":[0.1879158,0.0011150924,0.8045012,0.00020994019,0.00012719815,0.00020516399,0.0024017815,0.0007943041,0.0027295016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990777,0.00012751005,0.000052274652,0.000264748,0.000420016,0.000057693167],"domain_scores_gemma":[0.99880326,0.0003262116,0.00014494892,0.00039862382,0.00029135222,0.000035667803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009035483,0.0006967899,0.0009013157,0.0028412489,0.00041557578,0.001730368,0.0014638843,0.00082576607,0.0029816763],"category_scores_gemma":[0.0033100937,0.0005790689,0.0013512856,0.0020461103,0.00088974077,0.0016222317,0.0016154412,0.00082504214,0.0015150064],"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.00013787978,0.000059593323,0.0031250499,0.00034363454,0.00020258146,0.00012650326,0.00020076337,0.07530221,0.04112535,0.026204798,0.0088732,0.8442985],"study_design_scores_gemma":[0.00003119883,0.00013946682,0.00926146,0.00008981206,0.00011460854,0.0012245075,0.00012195875,0.8533604,0.02875229,0.060003646,0.04676274,0.00013792403],"about_ca_topic_score_codex":0.002141986,"about_ca_topic_score_gemma":0.0019107807,"teacher_disagreement_score":0.0029816763,"about_ca_system_score_codex":0.00055556383,"about_ca_system_score_gemma":0.0007014454,"threshold_uncertainty_score":0.0099746585},"labels":[],"label_agreement":null},{"id":"W1513219708","doi":"10.1007/978-3-540-75757-3_93","title":"Characterizing Task-Related Temporal Dynamics of Spatial Activation Distributions in fMRI BOLD Signals","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Functional magnetic resonance imaging; Supplementary motor area; SMA*; Primary motor cortex; Neuroscience; Dynamics (music); Psychology; Task (project management); Blood-oxygen-level dependent; Prefrontal cortex; Motor cortex; Computer science; Cognition","score_opus":0.018963518353080838,"score_gpt":0.2621649877474899,"score_spread":0.2432014693944091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513219708","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.94740117,0.00028516067,0.050295915,0.000097228505,0.000019308729,0.00006544268,0.00045409115,0.00012330821,0.001258384],"genre_scores_gemma":[0.9896143,0.0002804694,0.008441123,0.00004084728,0.00003565544,0.00007139365,0.000587552,0.00010202268,0.00082660245],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999897,0.000022024326,0.000005808486,0.000028289774,0.000025031151,0.000021789398],"domain_scores_gemma":[0.9987662,0.00089202053,0.00013795517,0.00006270189,0.00007346817,0.000067683206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035043206,0.0003356476,0.00022645055,0.00059404946,0.0002028376,0.00043208807,0.00022392371,0.00032544884,0.001369797],"category_scores_gemma":[0.0039689112,0.00024792238,0.00020644117,0.00062121876,0.00022723003,0.00040954247,0.00022449793,0.00042232085,0.00031319246],"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.0010640849,0.00017745001,0.016993005,0.00015697649,0.00007560846,0.0002699207,0.00028318545,0.005864533,0.9226132,0.00093773886,0.000591418,0.05097292],"study_design_scores_gemma":[0.00007160366,0.0006602833,0.69618225,0.00003485267,0.00017384671,0.0024455977,0.0002645277,0.14624365,0.14805038,0.0044930424,0.0013009707,0.000079042446],"about_ca_topic_score_codex":0.00076303195,"about_ca_topic_score_gemma":0.0022421682,"teacher_disagreement_score":0.001369797,"about_ca_system_score_codex":0.00013177545,"about_ca_system_score_gemma":0.00019924049,"threshold_uncertainty_score":0.0045824647},"labels":[],"label_agreement":null},{"id":"W1513235051","doi":"10.1007/11795131_12","title":"Cognitive Informatics and Contemporary Mathematics for Knowledge Manipulation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Knowledge representation and reasoning; Set (abstract data type); Informatics; Process (computing); Process calculus; Algebra over a field; Representation (politics); Field (mathematics); Theoretical computer science; Artificial intelligence; Programming language; Mathematics; Pure mathematics","score_opus":0.04220270553065884,"score_gpt":0.2725495741706762,"score_spread":0.23034686864001735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513235051","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.016065069,0.045371596,0.26460636,0.023050053,0.0014056808,0.00007545527,0.00024145919,0.00038252716,0.6488018],"genre_scores_gemma":[0.74932563,0.02177672,0.12994416,0.0028879514,0.0040738895,0.0006056674,0.0004304576,0.00023700685,0.09071843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883395,0.00045773946,0.000087103384,0.00020415187,0.000323309,0.00009367707],"domain_scores_gemma":[0.9975739,0.0017574016,0.00012957222,0.00030001297,0.00017762555,0.00006142591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124026,0.00067079277,0.00078364933,0.0027495106,0.0023842517,0.0070038615,0.0014591932,0.0024297857,0.011621288],"category_scores_gemma":[0.0037395093,0.0004756616,0.0008859193,0.002673919,0.018344548,0.014173312,0.0022038156,0.0038923817,0.0017125313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012433896,0.0000020290183,0.000010748912,0.000015931151,0.0000013585068,0.000004740013,0.00011736184,0.00007046779,0.000020904909,0.9969771,0.00054987747,0.0022283166],"study_design_scores_gemma":[0.0000022287552,0.0000011640522,0.000019175703,0.000010930519,0.00000109909,0.000014224469,0.000031021813,0.00019809695,0.000029871251,0.9920093,0.0076808734,0.000002093211],"about_ca_topic_score_codex":0.0015395831,"about_ca_topic_score_gemma":0.0013677712,"teacher_disagreement_score":0.011621288,"about_ca_system_score_codex":0.003357973,"about_ca_system_score_gemma":0.0015130651,"threshold_uncertainty_score":0.03887713},"labels":[],"label_agreement":null},{"id":"W1513366144","doi":"10.1007/11527503_11","title":"Multiagent Association Rules Mining in Cooperative Learning Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Calgary","funders":"","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Robustness (evolution); Association rule learning; Machine learning; Multi-agent system; Domain (mathematical analysis)","score_opus":0.017857517415009107,"score_gpt":0.247376344211483,"score_spread":0.2295188267964739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513366144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022890382,0.0009325631,0.97424376,0.00023639703,0.000062671184,0.00009295694,0.00006846153,0.00043948521,0.0010332934],"genre_scores_gemma":[0.37529945,0.0006174406,0.61947644,0.00014379101,0.00010560615,0.00031633553,0.0004208891,0.00009845359,0.0035216608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972283,0.0011677678,0.00030057988,0.00049894373,0.000685148,0.00011934576],"domain_scores_gemma":[0.9896578,0.007767667,0.00048579325,0.0008995163,0.0010086809,0.00018047901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041400483,0.0007368553,0.0016033403,0.0016591003,0.00084565795,0.0015597073,0.0029584104,0.001348937,0.0014577764],"category_scores_gemma":[0.012455898,0.00083548785,0.0010272054,0.001709631,0.0008090606,0.0023504035,0.0019813192,0.0016836791,0.0006777052],"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.00025706133,0.0005262106,0.0070702597,0.00029008262,0.000368789,0.0003455645,0.00039862102,0.31964007,0.0027432733,0.013976224,0.0040926877,0.6502912],"study_design_scores_gemma":[0.000014622884,0.000043413987,0.00063253846,0.000022693705,0.00003788127,0.000118561264,0.000055842083,0.97655225,0.001734388,0.01957953,0.0011940458,0.000014163851],"about_ca_topic_score_codex":0.0022978976,"about_ca_topic_score_gemma":0.0023209034,"teacher_disagreement_score":0.0041400483,"about_ca_system_score_codex":0.00056618697,"about_ca_system_score_gemma":0.00081593724,"threshold_uncertainty_score":0.021894932},"labels":[],"label_agreement":null},{"id":"W1513393364","doi":"10.1007/11880905_16","title":"Implicit Context-Sensitive Mobile Computing Using Semantic Policies","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ubiquitous computing; Provisioning; Mobile computing; Mobile device; Context (archaeology); Context awareness; Adaptability; Mobile technology; The Internet; Distributed computing; Computer network; World Wide Web; Human–computer interaction; Phone","score_opus":0.02598060272945502,"score_gpt":0.272234784432641,"score_spread":0.24625418170318597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513393364","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.04259677,0.0009495671,0.9473472,0.00032307857,0.00018312213,0.000098862,0.00013228491,0.002351679,0.0060175247],"genre_scores_gemma":[0.8393918,0.00049896137,0.1563355,0.00016043684,0.00008915989,0.00013720561,0.00025365787,0.0001753324,0.0029579233],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987668,0.00037765666,0.0001001995,0.00022979485,0.00032707126,0.00019853452],"domain_scores_gemma":[0.9978807,0.0009949575,0.00009592643,0.0007234988,0.00020658194,0.000098364726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013752629,0.0007181619,0.0011460383,0.00061976456,0.0008996968,0.0022587734,0.0017526344,0.00092530594,0.0020526357],"category_scores_gemma":[0.004470593,0.0006529599,0.0004420031,0.00097307033,0.0011976509,0.0051905056,0.0028520378,0.0020231688,0.0006919535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020445264,0.0008915276,0.002416056,0.0005453618,0.0001570993,0.00044112292,0.0013394051,0.11563583,0.071490176,0.31201574,0.008395903,0.4846272],"study_design_scores_gemma":[0.00009248206,0.00018313232,0.000516427,0.000064120344,0.000112380934,0.00023950762,0.00021481818,0.74418247,0.03593157,0.20767485,0.010717988,0.00007026638],"about_ca_topic_score_codex":0.0014742771,"about_ca_topic_score_gemma":0.0026348839,"teacher_disagreement_score":0.0022587734,"about_ca_system_score_codex":0.00053203147,"about_ca_system_score_gemma":0.0009303223,"threshold_uncertainty_score":0.0072731376},"labels":[],"label_agreement":null},{"id":"W1513403094","doi":"10.1007/978-3-540-30476-0_24","title":"Providing Automated Verification in HOL Using MDGs","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Reachability; Computer science; Model checking; Formal verification; Theoretical computer science; Programming language; Automated proof checking; State space; Automation; State (computer science); Formal methods; Equivalence (formal languages); Set (abstract data type); Proof assistant; Algorithm; Mathematical proof; Mathematics; Discrete mathematics","score_opus":0.04216792123757171,"score_gpt":0.3063406616379988,"score_spread":0.26417274040042704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513403094","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.010671158,0.00009700035,0.9761619,0.00014006573,0.000066466186,0.00006665318,0.00009060071,0.007975349,0.004730818],"genre_scores_gemma":[0.40622672,0.00028969444,0.58034766,0.00020380091,0.00006537518,0.00020261346,0.00036827655,0.0021343543,0.0101615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.00045977777,0.00012791711,0.0001653936,0.0005191856,0.00020995106],"domain_scores_gemma":[0.99540377,0.0030019467,0.00015291096,0.0010649428,0.0002999521,0.00007646872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229779,0.0009218213,0.00095740205,0.00080458797,0.0007745956,0.0019596284,0.0014046939,0.00092647487,0.010950763],"category_scores_gemma":[0.005170068,0.00096435274,0.0010629239,0.0005103932,0.0016281813,0.0032607596,0.0031403182,0.0021286872,0.0022091726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081416924,0.000281245,0.0015864118,0.0012804894,0.00014742558,0.0008608518,0.0007517812,0.13482562,0.04201423,0.43458405,0.011033809,0.37181994],"study_design_scores_gemma":[0.0002339178,0.00011529973,0.00024684577,0.00016929676,0.00009285522,0.00028086494,0.00009037043,0.547578,0.12095418,0.30020216,0.029972505,0.00006370766],"about_ca_topic_score_codex":0.0007296716,"about_ca_topic_score_gemma":0.0015111809,"teacher_disagreement_score":0.010950763,"about_ca_system_score_codex":0.0006817069,"about_ca_system_score_gemma":0.0010838964,"threshold_uncertainty_score":0.03663397},"labels":[],"label_agreement":null},{"id":"W1513599040","doi":"10.1007/11780656_27","title":"On Optimizing the k-Ward Micro-aggregation Technique for Secure Statistical Databases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Random Matrices and Applications","field":"Mathematics","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":"Computer science; Computation; Recursion (computer science); Benchmark (surveying); Set (abstract data type); Scheme (mathematics); Fraction (chemistry); Constant (computer programming); Algorithm; Theoretical computer science; Mathematics","score_opus":0.03513737788909095,"score_gpt":0.3124695322480035,"score_spread":0.27733215435891256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513599040","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.02311828,0.00033117228,0.9736979,0.0002792636,0.00005586124,0.000050862243,0.00008319111,0.00080330676,0.001580081],"genre_scores_gemma":[0.34115434,0.00040488556,0.6526215,0.00018144699,0.00012653966,0.000116936004,0.00029300654,0.00031427774,0.00478721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787974,0.00070159533,0.000177312,0.00023269556,0.0007765734,0.00023210578],"domain_scores_gemma":[0.9967173,0.001379519,0.00018542178,0.0011901114,0.00043334413,0.000094269235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219076,0.0008336643,0.0016515835,0.0006760471,0.0008912715,0.0014253644,0.0016469597,0.00071252306,0.0034044757],"category_scores_gemma":[0.0070836726,0.0005260206,0.00085797184,0.0019053738,0.00087966956,0.0029187,0.002447267,0.001504776,0.0010284735],"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.0007792234,0.0002265065,0.0025955306,0.0001388935,0.0001429567,0.0001514078,0.00024130284,0.37238446,0.014368873,0.107982785,0.011306589,0.48968148],"study_design_scores_gemma":[0.000014425692,0.000053223113,0.00026610642,0.0000050994995,0.000013071375,0.0000733902,0.000031658034,0.9690271,0.0026799233,0.02688091,0.0009454102,0.000009712533],"about_ca_topic_score_codex":0.004024391,"about_ca_topic_score_gemma":0.0071228147,"teacher_disagreement_score":0.004024391,"about_ca_system_score_codex":0.0010978334,"about_ca_system_score_gemma":0.0021867726,"threshold_uncertainty_score":0.011585951},"labels":[],"label_agreement":null},{"id":"W1513610757","doi":"10.1007/11590323_41","title":"A Demonstration of the ScriptEase Approach to Ambient and Perceptive NPC Behaviors in Computer Role-Playing Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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 Alberta","funders":"","keywords":"Scripting language; Computer science; Adventure; Entertainment; Human–computer interaction; Multimedia; Code (set theory); Computer game; Game design; Video game design; Artificial intelligence; Programming language; Visual arts","score_opus":0.01298941607671839,"score_gpt":0.21542167498849615,"score_spread":0.20243225891177777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513610757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20085505,0.00023872199,0.6303632,0.0008815055,0.0002530475,0.00037000087,0.0003990206,0.008444688,0.15819475],"genre_scores_gemma":[0.7537816,0.00018278962,0.2138094,0.00018283458,0.000017872728,0.00022127503,0.00016371442,0.0004414867,0.031198975],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998431,0.00005086032,0.0000076944625,0.000019339854,0.000058134352,0.000020701256],"domain_scores_gemma":[0.9997687,0.00010162051,0.0000093291055,0.000039696122,0.000031775166,0.00004891646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018243842,0.000341769,0.00020629556,0.00014192563,0.00039511014,0.00064320024,0.0006488508,0.0004654153,0.008429275],"category_scores_gemma":[0.0006907587,0.000144472,0.00025782836,0.00008907549,0.0006068023,0.0006072454,0.0010481043,0.0007538034,0.0010354306],"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.0010853673,0.0013586202,0.003994441,0.00056776643,0.00006231554,0.0019657155,0.00698461,0.02413911,0.4294374,0.19955531,0.014311616,0.31653768],"study_design_scores_gemma":[0.0004027122,0.0019345132,0.017693833,0.00022567745,0.00009421355,0.0032405653,0.0028174785,0.50645095,0.18433589,0.096175015,0.18645878,0.00017037366],"about_ca_topic_score_codex":0.0020972367,"about_ca_topic_score_gemma":0.0038478882,"teacher_disagreement_score":0.008429275,"about_ca_system_score_codex":0.000175135,"about_ca_system_score_gemma":0.00034396784,"threshold_uncertainty_score":0.028198779},"labels":[],"label_agreement":null},{"id":"W151366713","doi":"10.1007/978-3-642-33481-8_15","title":"On the Sosemanuk Related Key-IV Sets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and 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":"Concordia University","funders":"","keywords":"Computer science; Stream cipher; Keystream; Key (lock); Cryptanalysis; Cipher; State (computer science); Set (abstract data type); Theoretical computer science; Transposition cipher; Software; Running key cipher; Algorithm; Computer security; Cryptography; Programming language; Encryption","score_opus":0.02225030580231654,"score_gpt":0.2639576375156497,"score_spread":0.24170733171333317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151366713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13488095,0.003051989,0.50872386,0.0050356714,0.0014025312,0.0003109155,0.0008237063,0.0005569448,0.3452134],"genre_scores_gemma":[0.82200855,0.002550269,0.084198266,0.001702368,0.00068432436,0.0004978115,0.00094694644,0.00052298314,0.08688851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985072,0.0004623509,0.00010542152,0.0001908961,0.00046106693,0.00027308014],"domain_scores_gemma":[0.9981628,0.0008989703,0.00012726978,0.00051043695,0.00020157709,0.000098902434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645556,0.0008372846,0.0012112262,0.0018492955,0.0030101356,0.0043177987,0.0015058783,0.0015747083,0.013039267],"category_scores_gemma":[0.0054136096,0.00070692686,0.0012230293,0.0023460055,0.0049603763,0.007622537,0.00557105,0.004916684,0.0034179953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022494794,0.0000056175822,0.000031565967,0.000017743974,0.0000021458982,0.000015716303,0.00006653353,0.0004570378,0.00019528752,0.9946614,0.0009398977,0.003584525],"study_design_scores_gemma":[0.0000049016594,0.0000049926625,0.000018063376,0.000011785796,0.0000024237963,0.000024789748,0.000026536738,0.0011937332,0.00016262436,0.9960846,0.002460441,0.000005074241],"about_ca_topic_score_codex":0.00057752477,"about_ca_topic_score_gemma":0.000497213,"teacher_disagreement_score":0.013039267,"about_ca_system_score_codex":0.0017365739,"about_ca_system_score_gemma":0.0010745365,"threshold_uncertainty_score":0.043620646},"labels":[],"label_agreement":null},{"id":"W1513679598","doi":"10.1007/11674399_19","title":"Locally Informed Global Search for Sums of Combinatorial Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Exploit; Minimax; Mathematical optimization; Combinatorial game theory; Computation; Theoretical computer science; Search algorithm; Subgame perfect equilibrium; Algorithm; Sequential game; Game theory; Mathematics; Nash equilibrium; Mathematical economics","score_opus":0.02638382653820539,"score_gpt":0.29640842815495455,"score_spread":0.2700246016167492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513679598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0832379,0.0015216809,0.8869181,0.00095228886,0.00012628121,0.0001807,0.00027413445,0.0006557534,0.02613318],"genre_scores_gemma":[0.7302538,0.0010140681,0.23879334,0.0004095545,0.00024203387,0.00078925636,0.0008116696,0.00070091785,0.026985351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829215,0.0009968274,0.000060056613,0.00021665511,0.0002336643,0.00020066064],"domain_scores_gemma":[0.9884511,0.010066218,0.00034908473,0.00045918187,0.00022594859,0.00044832082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025632544,0.0021416591,0.004455931,0.0018838914,0.0012750342,0.0035812722,0.003375751,0.003211385,0.010848182],"category_scores_gemma":[0.015917696,0.0018694878,0.0016624318,0.002065419,0.0032411737,0.0057987813,0.0042169695,0.003676816,0.0009766322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003552283,0.00015699306,0.00045777674,0.00034600374,0.00012799416,0.00008114867,0.00019414253,0.68140185,0.0007467099,0.27990773,0.0054039964,0.030820308],"study_design_scores_gemma":[0.0000555619,0.000038750117,0.000057956793,0.000025058785,0.000017133156,0.000017485696,0.00003015411,0.7327433,0.00013867016,0.26641357,0.00044871235,0.000013680719],"about_ca_topic_score_codex":0.0024718517,"about_ca_topic_score_gemma":0.0038743215,"teacher_disagreement_score":0.010848182,"about_ca_system_score_codex":0.002014046,"about_ca_system_score_gemma":0.0014301881,"threshold_uncertainty_score":0.036290824},"labels":[],"label_agreement":null},{"id":"W1513731467","doi":"10.1007/978-3-540-24840-8_23","title":"Average Case Self-Duality of Monotone Boolean Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Monotone polygon; Duality (order theory); Mathematics; Complete Boolean algebra; Boolean function; Discrete mathematics; Pure mathematics; Two-element Boolean algebra; Algebra over a field","score_opus":0.01148410318037559,"score_gpt":0.24643895343132025,"score_spread":0.23495485025094465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513731467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3310338,0.0036716259,0.45443118,0.0026185878,0.00045696666,0.000056909346,0.00038271004,0.0002713769,0.2070768],"genre_scores_gemma":[0.94631034,0.0012466107,0.030822782,0.0003288423,0.00063602644,0.000072287854,0.00021397157,0.00011794025,0.020251164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986512,0.0004708594,0.00006286543,0.00019403105,0.00038635585,0.00023470863],"domain_scores_gemma":[0.9959715,0.0026256808,0.00027586645,0.00030275964,0.00048654634,0.00033762655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022182614,0.0005642876,0.0011414319,0.0016673116,0.0011335128,0.004055374,0.0014691659,0.0013320347,0.006547622],"category_scores_gemma":[0.009037397,0.00062150654,0.0010619188,0.0013997762,0.00223165,0.006203411,0.0014020095,0.0029029248,0.0005989681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038073526,0.000022311602,0.00011576591,0.000031111773,0.0000057312845,0.000038827493,0.000051086576,0.001955445,0.00036307794,0.99233127,0.0011640603,0.0038833015],"study_design_scores_gemma":[0.00000857975,0.000010950542,0.00008099469,0.000007368327,0.000004289987,0.00012503186,0.00001956555,0.019594371,0.00024316338,0.97905236,0.000847297,0.0000059567446],"about_ca_topic_score_codex":0.00044998646,"about_ca_topic_score_gemma":0.00038717611,"teacher_disagreement_score":0.006547622,"about_ca_system_score_codex":0.0017423367,"about_ca_system_score_gemma":0.00061865913,"threshold_uncertainty_score":0.021903992},"labels":[],"label_agreement":null},{"id":"W1513735063","doi":"10.1007/11734673_6","title":"Weak Contact Structures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Orthogonality; Axiom; Lattice (music); Distributive property; Relation (database); Algebraic structure; Algebraic number; Computer science; Connection (principal bundle); Mathematics; Pure mathematics; Algebra over a field; Geometry; Mathematical analysis; Physics; Data mining","score_opus":0.010940021367831605,"score_gpt":0.22949761510780095,"score_spread":0.21855759373996936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513735063","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.033966176,0.0009923026,0.17737933,0.0017120772,0.0006590374,0.000117304,0.00094486505,0.00085929554,0.7833697],"genre_scores_gemma":[0.43624297,0.0014749761,0.03282021,0.0009131786,0.0006898068,0.00031888968,0.0020699308,0.0009419563,0.524528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994723,0.0000756299,0.00002910311,0.0001396972,0.00019707359,0.00008619554],"domain_scores_gemma":[0.9993206,0.00015491572,0.0000587441,0.00020292292,0.00016391565,0.000098944845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036991833,0.0006777986,0.0006823686,0.0018876035,0.0024483849,0.0027373196,0.0010764381,0.0011592921,0.066651665],"category_scores_gemma":[0.0020292627,0.00045947428,0.00057600834,0.0015312786,0.0018384098,0.005400191,0.0027215688,0.0024510277,0.014393351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012612405,0.000012032912,0.000032231794,0.000024760768,0.0000024370204,0.000023638022,0.00010317351,0.00016655592,0.00055706577,0.9825837,0.005728927,0.010752758],"study_design_scores_gemma":[0.0000061618184,0.000015071275,0.000081838916,0.000016066839,0.000005348102,0.00010174213,0.00007968607,0.0013392775,0.0008890569,0.9595601,0.03789908,0.000006521921],"about_ca_topic_score_codex":0.00040147416,"about_ca_topic_score_gemma":0.00044602956,"teacher_disagreement_score":0.066651665,"about_ca_system_score_codex":0.00076503085,"about_ca_system_score_gemma":0.00047127475,"threshold_uncertainty_score":0.22297204},"labels":[],"label_agreement":null},{"id":"W1513757556","doi":"10.1007/11866565_93","title":"A Novel MRI Texture Analysis of Demyelination and Inflammation in Relapsing-Remitting Experimental Allergic Encephalomyelitis","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Multiple Sclerosis Research Studies","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 Calgary","funders":"","keywords":"Texture (cosmology); Multiple sclerosis; Encephalomyelitis; Relapsing remitting; Pathological; Lesion; Artificial intelligence; Pathology; Inflammation; Pattern recognition (psychology); Computer science; Medicine; Image (mathematics); Immunology","score_opus":0.017926128990781845,"score_gpt":0.3007438337375794,"score_spread":0.28281770474679757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513757556","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.919028,0.0016559478,0.07694691,0.00018192308,0.000110459536,0.00007751229,0.00055688136,0.00030678758,0.0011357038],"genre_scores_gemma":[0.9507672,0.00086137414,0.045914806,0.000059634836,0.0001203784,0.00004761092,0.00041376372,0.00006585658,0.0017494146],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988854,0.000017605504,0.000008439983,0.00002129137,0.000037689948,0.00002645325],"domain_scores_gemma":[0.99977237,0.000040250357,0.00003980055,0.000013642575,0.00008817256,0.000045713707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032809156,0.00026527757,0.0004684917,0.001439777,0.00019458182,0.0005772609,0.00022698058,0.0003576961,0.0008940362],"category_scores_gemma":[0.00038263045,0.00014069487,0.0003753937,0.00071843294,0.00017523054,0.00044172112,0.0002554912,0.00022822275,0.00020400563],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002694236,0.000227141,0.019933458,0.0002702807,0.0001685673,0.00038429696,0.00008149556,0.0031518072,0.77242535,0.00039688946,0.0010213297,0.19924505],"study_design_scores_gemma":[0.00035214773,0.0026047097,0.38158065,0.00006396455,0.001020923,0.0065177074,0.00063812925,0.344909,0.2542466,0.0015748827,0.0063211746,0.00017004913],"about_ca_topic_score_codex":0.0013279762,"about_ca_topic_score_gemma":0.0017060214,"teacher_disagreement_score":0.001439777,"about_ca_system_score_codex":0.00019030024,"about_ca_system_score_gemma":0.0001900982,"threshold_uncertainty_score":0.0029908419},"labels":[],"label_agreement":null},{"id":"W1513765320","doi":"10.1007/11922155_19","title":"An Event-Based Pool Physics Simulator","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parametrization (atmospheric modeling); Ball (mathematics); Algorithm; Simulation; Tree (set theory); Applied mathematics; Mathematics; Physics; Mathematical analysis","score_opus":0.01966963334584865,"score_gpt":0.22755529903588392,"score_spread":0.20788566569003528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513765320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20537652,0.0002626932,0.7556624,0.00096521026,0.0003416882,0.00069535675,0.0029326149,0.0082918415,0.025471693],"genre_scores_gemma":[0.90671843,0.00013964262,0.08371215,0.00020125673,0.000054249398,0.00042952294,0.0013478224,0.00032643118,0.0070704543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997807,0.000082061466,0.000012063824,0.00003880152,0.000052662126,0.00003376965],"domain_scores_gemma":[0.9988852,0.00065306004,0.000053069,0.00012164471,0.00014763071,0.00013934165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008149077,0.0006319926,0.0010553971,0.00039950418,0.00057676865,0.0009693741,0.0026883397,0.0017071018,0.0092405705],"category_scores_gemma":[0.0028196294,0.0005802869,0.0007090552,0.00044034616,0.0005234445,0.00088339805,0.0012802911,0.0011325101,0.0009389373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011597856,0.00007947105,0.00048351465,0.00002216544,0.000023500557,0.00004388293,0.000017673618,0.991484,0.00047506334,0.0031305808,0.00090280705,0.0032213966],"study_design_scores_gemma":[0.000034085595,0.000011043633,0.000030357874,8.3645176e-7,0.0000034378413,0.0000036443882,0.0000013464668,0.9989704,0.00009392909,0.00065936154,0.00018949568,0.0000021794165],"about_ca_topic_score_codex":0.011767175,"about_ca_topic_score_gemma":0.006072838,"teacher_disagreement_score":0.011767175,"about_ca_system_score_codex":0.0005946536,"about_ca_system_score_gemma":0.0014561808,"threshold_uncertainty_score":0.030912757},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W151377110","doi":"10.1007/978-3-642-37456-2_14","title":"Density-Based Clustering Based on Hierarchical Density Estimates","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":2412,"is_retracted":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":"Computer science; Cluster analysis; Hierarchical clustering; Data mining; Artificial intelligence","score_opus":0.021558810818848025,"score_gpt":0.2774625965106832,"score_spread":0.2559037856918352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151377110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019377252,0.00024707397,0.99643743,0.00005330732,0.000029789328,0.000035853853,0.000050554994,0.00027923397,0.00092909305],"genre_scores_gemma":[0.14318849,0.0010184951,0.8486137,0.00013298237,0.00015346048,0.00026841715,0.00090742024,0.0004453143,0.0052716946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799407,0.0006995166,0.000106930944,0.00034709254,0.00073526875,0.000117125135],"domain_scores_gemma":[0.994879,0.0025980812,0.0002801873,0.0008395088,0.0012733701,0.00012981296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023546899,0.001062691,0.0021304556,0.0028733653,0.0013402656,0.0019567758,0.0040763356,0.0019019056,0.0034579474],"category_scores_gemma":[0.013792427,0.0014000189,0.0018553176,0.0038616979,0.0011402343,0.0026602764,0.0030547744,0.002179965,0.0026145333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017354921,0.00008608483,0.0012444669,0.00036243827,0.00021758505,0.000112129834,0.00041564179,0.59596145,0.005542593,0.11221188,0.009358329,0.27431384],"study_design_scores_gemma":[0.0000073953347,0.00001371658,0.0002926247,0.000019007877,0.000020442187,0.00006084052,0.000022948241,0.97012097,0.000895777,0.026969763,0.0015502952,0.000026166681],"about_ca_topic_score_codex":0.008361296,"about_ca_topic_score_gemma":0.008475352,"teacher_disagreement_score":0.008361296,"about_ca_system_score_codex":0.0015421081,"about_ca_system_score_gemma":0.001348675,"threshold_uncertainty_score":0.016625285},"labels":[],"label_agreement":null},{"id":"W1513787550","doi":"10.1007/978-3-642-01877-0_14","title":"ERINDALE: A Polynomial Based Hashing Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and 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 Toronto","funders":"","keywords":"Hash function; Computer science; Double hashing; Algorithm; Flexibility (engineering); Set (abstract data type); Field-programmable gate array; Software; SHA-2; Polynomial; Skein; Theoretical computer science; Hash table; Cryptographic hash function; Computer hardware; Mathematics; Programming language; Statistics","score_opus":0.016432280802129273,"score_gpt":0.261587612840424,"score_spread":0.2451553320382947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513787550","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.016697478,0.0016640361,0.9419266,0.00051052176,0.00068377244,0.00027254765,0.00048094924,0.009600358,0.028163845],"genre_scores_gemma":[0.2711278,0.0010931067,0.65405494,0.00081826077,0.00034783245,0.0003468126,0.0022275685,0.0014467404,0.06853682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903274,0.00014928276,0.000056782945,0.00017075034,0.00045337027,0.0001370319],"domain_scores_gemma":[0.99945503,0.00007777054,0.0000296174,0.0003005463,0.00009474974,0.00004229271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071468705,0.0006611522,0.0010067947,0.00089810835,0.00091560546,0.0014748155,0.00241679,0.0010400563,0.01706859],"category_scores_gemma":[0.0014024202,0.0004578607,0.00066253863,0.0014063081,0.00090613606,0.0039594895,0.004053104,0.0017455908,0.009534816],"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.0007730251,0.00022049838,0.00037922995,0.00046849472,0.000071168884,0.00015439594,0.0001963893,0.006123247,0.025791083,0.20562513,0.038835272,0.7213621],"study_design_scores_gemma":[0.00057550956,0.0010519195,0.0012252074,0.00017986851,0.000164534,0.0021087995,0.00023392691,0.1390227,0.102749415,0.3677392,0.38463828,0.00031061206],"about_ca_topic_score_codex":0.00028989097,"about_ca_topic_score_gemma":0.00038866588,"teacher_disagreement_score":0.01706859,"about_ca_system_score_codex":0.00062279176,"about_ca_system_score_gemma":0.00077156746,"threshold_uncertainty_score":0.057100117},"labels":[],"label_agreement":null},{"id":"W1513988862","doi":"10.1007/978-3-642-13672-6_45","title":"Supervised Learning with Minimal Effort","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Simple (philosophy); Artificial intelligence; Exploit; Machine learning; Process (computing); Instance-based learning; Supervised learning; Active learning (machine learning); Artificial neural network","score_opus":0.0123272612070977,"score_gpt":0.23582155513398081,"score_spread":0.2234942939268831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513988862","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.0032235766,0.00042025905,0.98900396,0.00027336087,0.000111624766,0.000071730596,0.00017815671,0.002225734,0.0044916617],"genre_scores_gemma":[0.14640088,0.00061462447,0.8141013,0.00050031964,0.0004529721,0.0005578588,0.002510325,0.00114259,0.033719156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760014,0.00083404634,0.00015362882,0.00066545204,0.00060830027,0.00013841774],"domain_scores_gemma":[0.9969567,0.0012857376,0.00009967759,0.0013047713,0.00028577086,0.00006727704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019124764,0.0012310722,0.0018003165,0.0009993755,0.00085216505,0.0014734034,0.0029011378,0.0016130697,0.01213341],"category_scores_gemma":[0.0064192307,0.0010269759,0.001582782,0.0010975975,0.0011073838,0.0028541065,0.0038851188,0.0022072669,0.0071991263],"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.00024955958,0.00018045024,0.00052028504,0.00032210714,0.00016400905,0.00011049822,0.00010398658,0.06013281,0.0037754998,0.054125477,0.031760056,0.84855527],"study_design_scores_gemma":[0.000058034333,0.00010502186,0.0003177513,0.000049376173,0.000061092964,0.00019091234,0.000036271853,0.78241414,0.004626256,0.19663706,0.0154809905,0.000023037901],"about_ca_topic_score_codex":0.0008460645,"about_ca_topic_score_gemma":0.0019810759,"teacher_disagreement_score":0.01213341,"about_ca_system_score_codex":0.0005708805,"about_ca_system_score_gemma":0.0011500326,"threshold_uncertainty_score":0.040590346},"labels":[],"label_agreement":null},{"id":"W1514026820","doi":"10.1007/978-3-642-15745-5_9","title":"Registration of a Statistical Shape Model of the Lumbar Spine to 3D Ultrasound Images","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston General Hospital; National Research Council Canada; University of British Columbia; Queen's University","funders":"","keywords":"Fiducial marker; 3D ultrasound; Ultrasound; Artificial intelligence; Medicine; Statistical model; Computer vision; Image registration; Vertebra; Computer science; Lumbar; Radiology; Image (mathematics); Surgery","score_opus":0.00789873510557331,"score_gpt":0.2445896435415743,"score_spread":0.236690908436001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514026820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033562787,0.0001502243,0.9644569,0.0001484819,0.000041600768,0.000052167605,0.00020361315,0.00087676087,0.000507425],"genre_scores_gemma":[0.68890774,0.00082792423,0.30445552,0.00020111329,0.00010328757,0.0002853608,0.0013065174,0.0005231712,0.0033893753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937683,0.000116982235,0.000041933657,0.0001456223,0.0002737716,0.00004493748],"domain_scores_gemma":[0.9993419,0.0001454852,0.000118259566,0.00019639182,0.00017057512,0.000027314123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006390205,0.00047495135,0.000621098,0.0013090408,0.0002825888,0.001091555,0.00075869466,0.0011326191,0.00096757204],"category_scores_gemma":[0.0029167524,0.0006899853,0.0015422057,0.0014445927,0.00055287743,0.00050731463,0.0010151032,0.00074848573,0.00111876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039075443,0.00016111627,0.005280553,0.00020918158,0.00019100762,0.00035415392,0.00025836934,0.6002017,0.10179726,0.005430707,0.003051318,0.28267387],"study_design_scores_gemma":[0.000014686007,0.00012874634,0.0043972977,0.000016367652,0.00003648025,0.0005367015,0.000041796182,0.97195184,0.017648276,0.0028674887,0.002326611,0.000033680786],"about_ca_topic_score_codex":0.0038864145,"about_ca_topic_score_gemma":0.0040339353,"teacher_disagreement_score":0.0038864145,"about_ca_system_score_codex":0.00050264876,"about_ca_system_score_gemma":0.0016350175,"threshold_uncertainty_score":0.0077275634},"labels":[],"label_agreement":null},{"id":"W1514041516","doi":"10.1007/11424758_84","title":"A Novel Delaunay Simplex Technique for Detection of Crystalline Nuclei in Dense Packings of Spheres","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Material Dynamics and Properties","field":"Materials Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Simplex; Voronoi diagram; Nucleation; Cluster (spacecraft); SPHERES; Materials science; Crystallization; Physics; Crystallography; Geometry; Computer science; Mathematics; Chemistry; Thermodynamics","score_opus":0.017521800398555158,"score_gpt":0.23948759414999943,"score_spread":0.22196579375144426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514041516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004445459,0.00010244041,0.99386346,0.000031321946,0.000031112897,0.000048975373,0.000098759716,0.00079110236,0.00058734004],"genre_scores_gemma":[0.015364092,0.00010231065,0.9830651,0.000018929537,0.000018675542,0.00007496995,0.00018068645,0.00015543395,0.0010197142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924195,0.00013240504,0.000031256277,0.00014802028,0.0004045752,0.000041941636],"domain_scores_gemma":[0.998914,0.00040293098,0.00006140049,0.00016872506,0.00034810862,0.00010486123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047037602,0.0011144398,0.0012969181,0.002083279,0.0006989061,0.0013014105,0.0018011284,0.0008924132,0.0049907607],"category_scores_gemma":[0.0016741093,0.00082794775,0.000747537,0.0016723273,0.0005831632,0.0014132768,0.0022941828,0.0011329639,0.0023312056],"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.00034981186,0.00013470561,0.0013366557,0.0004323664,0.00015785432,0.00024677845,0.00031951437,0.0374624,0.22409564,0.021382198,0.008272577,0.7058095],"study_design_scores_gemma":[0.00003401082,0.00006619858,0.00057027984,0.000014623422,0.000021804592,0.000423474,0.00007119975,0.94620776,0.037917294,0.008596843,0.0060132057,0.00006315014],"about_ca_topic_score_codex":0.0029353774,"about_ca_topic_score_gemma":0.0046937717,"teacher_disagreement_score":0.0049907607,"about_ca_system_score_codex":0.0004979959,"about_ca_system_score_gemma":0.0008664283,"threshold_uncertainty_score":0.016695738},"labels":[],"label_agreement":null},{"id":"W1514055912","doi":"10.1007/978-3-642-12200-2_9","title":"Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Guidance and Control Systems","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 Lethbridge; Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Computer science; Boundary (topology); Robot; Schedule; Metric (unit); Combinatorics; Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.012686825079483086,"score_gpt":0.22397463120106395,"score_spread":0.21128780612158088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514055912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15820488,0.00039206518,0.823413,0.00049564894,0.0001532805,0.00033029873,0.00033374055,0.0013265917,0.015350562],"genre_scores_gemma":[0.4916974,0.0002520537,0.4948956,0.000097776574,0.00004745151,0.0002786894,0.00046527124,0.0002716292,0.011994166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997563,0.000047898877,0.000011007164,0.000056789293,0.000054564844,0.00007344372],"domain_scores_gemma":[0.9995146,0.00026415492,0.00003238913,0.000040434516,0.00007288744,0.00007547594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039464142,0.0007817549,0.0014412634,0.0005940109,0.0008364063,0.00073945627,0.001272455,0.0012079369,0.0093115745],"category_scores_gemma":[0.0017884517,0.00058997644,0.0006271782,0.00067460636,0.0005092951,0.0016021582,0.0009976884,0.0011469414,0.0010317075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018003432,0.00049502763,0.0010931377,0.0007516272,0.00011180168,0.00041697608,0.0004049299,0.63019526,0.043847367,0.04082037,0.017220143,0.26284298],"study_design_scores_gemma":[0.00020746718,0.00043824693,0.0003339162,0.000027130718,0.000023871002,0.00010753252,0.00012499045,0.9687537,0.0049276813,0.022316031,0.0027152102,0.000024239056],"about_ca_topic_score_codex":0.0036145055,"about_ca_topic_score_gemma":0.0034898277,"teacher_disagreement_score":0.0093115745,"about_ca_system_score_codex":0.00071282295,"about_ca_system_score_gemma":0.0017507426,"threshold_uncertainty_score":0.031150341},"labels":[],"label_agreement":null},{"id":"W1514214094","doi":"10.1007/978-3-642-17274-8_34","title":"Automatic Liver Segmentation from CT Scans Using Multi-layer Segmentation and Principal Component Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Principal component analysis; Artificial intelligence; Pattern recognition (psychology); Component (thermodynamics); Layer (electronics); Image segmentation; Scale-space segmentation; Computer vision","score_opus":0.03484164948683444,"score_gpt":0.30208166818681076,"score_spread":0.2672400186999763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514214094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008846842,0.0011846796,0.98647505,0.00010294073,0.000045201377,0.000088671084,0.00019058444,0.0021264588,0.0009394987],"genre_scores_gemma":[0.036769263,0.0010776393,0.959391,0.0000485408,0.000038411206,0.00007740865,0.00045037005,0.00047680538,0.0016704834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995796,0.00007473343,0.000044173616,0.00009280374,0.00015872177,0.00004992978],"domain_scores_gemma":[0.9993349,0.0002860264,0.00006054893,0.000112119305,0.00017972026,0.000026646672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096232764,0.0012520083,0.0012091318,0.002489397,0.00045543007,0.0018295158,0.001039526,0.0012016298,0.0029238656],"category_scores_gemma":[0.0015106156,0.001214963,0.0014663879,0.0021012982,0.00048430724,0.0015266503,0.0008547071,0.0011302717,0.0024264755],"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.00031667732,0.00008463397,0.0010092222,0.00057715655,0.00012986649,0.00020958358,0.00011550729,0.020202933,0.24263014,0.0025922048,0.004446941,0.7276852],"study_design_scores_gemma":[0.000044760243,0.00015058684,0.007019458,0.00015604515,0.0003045424,0.0018898408,0.00010700634,0.7178739,0.25032303,0.01072876,0.011248932,0.00015321957],"about_ca_topic_score_codex":0.0016878085,"about_ca_topic_score_gemma":0.003535925,"teacher_disagreement_score":0.0029238656,"about_ca_system_score_codex":0.0003545479,"about_ca_system_score_gemma":0.00092455425,"threshold_uncertainty_score":0.009781361},"labels":[],"label_agreement":null},{"id":"W1514217992","doi":"10.1007/11783596_1","title":"What Is a Good Process Semantics?","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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":"University of Calgary","funders":"","keywords":"Computer science; Deadlock; Focus (optics); Semantics (computer science); Programming language; Process (computing); Operational semantics; Process calculus; Formal methods; Formal semantics (linguistics); Theoretical computer science; Software engineering","score_opus":0.014867835087832083,"score_gpt":0.23421847870469328,"score_spread":0.2193506436168612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514217992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01379826,0.0041406304,0.92501503,0.030727956,0.0010040534,0.00013228862,0.0003384151,0.0012205195,0.023622803],"genre_scores_gemma":[0.4157101,0.0043501602,0.56110615,0.005709146,0.0024212196,0.00052502175,0.0007984209,0.0013206563,0.008059172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859299,0.005360775,0.001905975,0.0017938829,0.0042300164,0.00077942084],"domain_scores_gemma":[0.97136307,0.013555849,0.0016290034,0.0068883165,0.005356204,0.0012074929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014535647,0.0016191216,0.0029264314,0.0036198483,0.0029959723,0.009244457,0.0031385573,0.005427744,0.00429597],"category_scores_gemma":[0.036394253,0.0014307513,0.0028656933,0.0038351424,0.013925886,0.05029475,0.0045097047,0.006607363,0.0021858902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027008671,0.000031121082,0.00015634231,0.00016805009,0.00003395506,0.000041956904,0.00032164366,0.0012400777,0.00023475401,0.97755957,0.0023509928,0.0178345],"study_design_scores_gemma":[0.000009762426,0.000008627133,0.000025167843,0.00004695981,0.000013841436,0.000046279227,0.000091588576,0.0016436102,0.00018674895,0.9916093,0.006309375,0.00000871118],"about_ca_topic_score_codex":0.0012452762,"about_ca_topic_score_gemma":0.00095749414,"teacher_disagreement_score":0.014535647,"about_ca_system_score_codex":0.0018138981,"about_ca_system_score_gemma":0.0036113292,"threshold_uncertainty_score":0.076872766},"labels":[],"label_agreement":null},{"id":"W1514229540","doi":"10.1007/978-3-319-10470-6_37","title":"Construction of a Deformable Spatiotemporal MRI Atlas of the Fetal Brain: Evaluation of Similarity Metrics and Deformation Models","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Fetal and Pediatric Neurological Disorders","field":"Medicine","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":"National Center for Advancing Translational Sciences; National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institute of Dental and Craniofacial Research; Canadian Institutes of Health Research; National Institutes of Health; Harvard Catalyst","keywords":"Atlas (anatomy); Computer science; Segmentation; Artificial intelligence; Similarity (geometry); Metric (unit); Brain atlas; Pattern recognition (psychology); Population; Computer vision; Anatomy","score_opus":0.02546482250532835,"score_gpt":0.2616913508974298,"score_spread":0.23622652839210143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514229540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08697826,0.00041811043,0.9069003,0.00030736646,0.00007877121,0.00033704072,0.0011980527,0.0027559116,0.0010261742],"genre_scores_gemma":[0.4436238,0.000992936,0.5497445,0.000102584585,0.00004600353,0.00023139441,0.0029106103,0.0011184654,0.0012297501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993218,0.00013268132,0.00006860152,0.00015008835,0.00028111468,0.000045633704],"domain_scores_gemma":[0.9979206,0.0006894011,0.00029284786,0.00043363604,0.00050307263,0.00016043999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016924017,0.000989766,0.0010709576,0.003375244,0.00040149214,0.0020871498,0.0012992901,0.0015554538,0.001955518],"category_scores_gemma":[0.0066291606,0.0006306304,0.0013292257,0.00198253,0.000539663,0.001140488,0.0014301874,0.0010988713,0.00069477875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006753691,0.00022169869,0.006649071,0.00060923316,0.00031877178,0.0006065609,0.00046133803,0.45772725,0.070499755,0.009104236,0.0043942607,0.44873244],"study_design_scores_gemma":[0.000024568666,0.00016839571,0.0022978147,0.000036357327,0.00006633148,0.00066793634,0.000096510994,0.9703522,0.020635875,0.0038695554,0.00174464,0.000039885956],"about_ca_topic_score_codex":0.0068784696,"about_ca_topic_score_gemma":0.0051135425,"teacher_disagreement_score":0.0068784696,"about_ca_system_score_codex":0.0008495702,"about_ca_system_score_gemma":0.0020820184,"threshold_uncertainty_score":0.013676882},"labels":[],"label_agreement":null},{"id":"W1514238746","doi":"10.1007/978-3-540-68552-4_7","title":"Computing Branch Decomposition of Large Planar Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Time complexity; Pathwidth; Subroutine; Mathematics; Planar; Book embedding; Algorithm; Combinatorics; Modular decomposition; Graph; Discrete mathematics; Computer science; Line graph","score_opus":0.016986563573989203,"score_gpt":0.29362713107242466,"score_spread":0.27664056749843546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514238746","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.39844677,0.0019489262,0.54046315,0.0016630384,0.00017143789,0.00030404294,0.0072613386,0.010746259,0.038995042],"genre_scores_gemma":[0.50298214,0.001122674,0.45497462,0.00030186836,0.00017192333,0.00021392551,0.02169875,0.0021621953,0.016371952],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995229,0.000070584705,0.00002242098,0.00013532456,0.00014025735,0.000108479064],"domain_scores_gemma":[0.99809617,0.0010132197,0.000115301176,0.0003284205,0.000258505,0.0001883311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545917,0.001605274,0.0016051396,0.0022081607,0.0009540607,0.0030494872,0.0019904578,0.0012998749,0.018107198],"category_scores_gemma":[0.0039617056,0.0010353817,0.0011758578,0.0031423313,0.0008189112,0.00505709,0.0023078772,0.0022726918,0.0044780844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016675611,0.00047735052,0.008629905,0.0015316907,0.00021880955,0.0005003841,0.0009808356,0.19744684,0.036928855,0.087061524,0.09340935,0.5711469],"study_design_scores_gemma":[0.0001842736,0.00013463116,0.0018875843,0.00010359125,0.00010172713,0.00020625761,0.0005199768,0.7086565,0.009121253,0.26805946,0.01099879,0.00002602743],"about_ca_topic_score_codex":0.0026209138,"about_ca_topic_score_gemma":0.0080645885,"teacher_disagreement_score":0.018107198,"about_ca_system_score_codex":0.0010864618,"about_ca_system_score_gemma":0.0010058298,"threshold_uncertainty_score":0.06057465},"labels":[],"label_agreement":null},{"id":"W1514349372","doi":"10.1007/978-3-540-69812-8_17","title":"Examining the Role of Scale in the Context of the Non-Local-Means Filter","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scale (ratio); Context (archaeology); Filter (signal processing); Computer vision; Cartography; History; Geography","score_opus":0.023242750651924014,"score_gpt":0.24593187516751971,"score_spread":0.2226891245155957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514349372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15350866,0.00732351,0.7914859,0.003169213,0.0004124699,0.00003850557,0.00007964696,0.00021566375,0.04376632],"genre_scores_gemma":[0.83700335,0.004789296,0.13611042,0.00029880108,0.00039981486,0.000029564699,0.000075786375,0.0002931886,0.020999838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997851,0.00007303194,0.000007004866,0.00005026122,0.000057136105,0.00002743468],"domain_scores_gemma":[0.99819916,0.001348561,0.00010943746,0.00010878907,0.00017226192,0.000061713275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291806,0.00031301606,0.00040135838,0.00038258266,0.00053929636,0.0018323411,0.0005738739,0.0010849646,0.0032388729],"category_scores_gemma":[0.0072969003,0.00025184482,0.0003793066,0.000691162,0.0010879651,0.0024250331,0.000675247,0.0011731577,0.000433119],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027128917,0.00007416428,0.0028118812,0.00039257138,0.000081487015,0.00058508385,0.0012522625,0.061483793,0.05892867,0.74080175,0.0035171234,0.12979998],"study_design_scores_gemma":[0.000031141644,0.00012539794,0.012358674,0.00008358005,0.000103185936,0.00037557835,0.0006769533,0.5628462,0.012141763,0.3991181,0.012065874,0.00007351012],"about_ca_topic_score_codex":0.0041734674,"about_ca_topic_score_gemma":0.0049733636,"teacher_disagreement_score":0.0041734674,"about_ca_system_score_codex":0.00058262533,"about_ca_system_score_gemma":0.00049532135,"threshold_uncertainty_score":0.010835171},"labels":[],"label_agreement":null},{"id":"W1514384380","doi":"10.1007/978-3-642-02568-6_38","title":"3D Scene Analysis Using UIMA Framework","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and 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":"National Research Council Canada","funders":"","keywords":"Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.01641679169771358,"score_gpt":0.24295170401524044,"score_spread":0.22653491231752687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514384380","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.0011674955,0.00011300246,0.9921863,0.00001581906,0.000029896648,0.000032173157,0.00013335289,0.0043123844,0.0020095957],"genre_scores_gemma":[0.04792184,0.00030638502,0.94189686,0.00006050497,0.000039902996,0.00011220043,0.0012805,0.0016026169,0.0067791664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.000031780724,0.00001401621,0.00008271043,0.00018154494,0.00004773919],"domain_scores_gemma":[0.99984646,0.000028776903,0.00000873885,0.000040790143,0.00006311168,0.0000121078765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027114118,0.0011431174,0.0012124636,0.0024001398,0.00076491205,0.002215464,0.0020938863,0.0007143003,0.023355419],"category_scores_gemma":[0.00058728096,0.00073323736,0.0021812608,0.0015137438,0.00037783614,0.0012396512,0.001671448,0.00092902326,0.0060782162],"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.00013689174,0.00007877579,0.0006260303,0.0004103458,0.00015040067,0.0003420791,0.00021345442,0.03980646,0.09742776,0.040879514,0.016166419,0.8037619],"study_design_scores_gemma":[0.000023380111,0.000078766454,0.0010228684,0.000067058165,0.000098793,0.0009806051,0.00017728674,0.8240953,0.06269123,0.021296784,0.08938715,0.00008082305],"about_ca_topic_score_codex":0.003047713,"about_ca_topic_score_gemma":0.004476841,"teacher_disagreement_score":0.023355419,"about_ca_system_score_codex":0.00039099113,"about_ca_system_score_gemma":0.0006739486,"threshold_uncertainty_score":0.078131676},"labels":[],"label_agreement":null},{"id":"W1514392931","doi":"10.1007/3-540-45551-5_56","title":"Fairness and Aggregation: A Primal Decomposition Study","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Terminal (telecommunication); Mathematical optimization; Overhead (engineering); Optimal allocation; Resource allocation; Computer network; Population; Controller (irrigation); Distributed computing; Mathematics","score_opus":0.010318973294705961,"score_gpt":0.24348611660206224,"score_spread":0.23316714330735627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514392931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038263947,0.004192186,0.92647237,0.002315273,0.0005636467,0.00007217534,0.00011005613,0.000064708416,0.027945688],"genre_scores_gemma":[0.736584,0.004980726,0.22563894,0.000584136,0.0017620784,0.00020051586,0.00013187928,0.00033344497,0.02978426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717146,0.0016355315,0.00007132772,0.00028800938,0.00044658163,0.0003871046],"domain_scores_gemma":[0.98899543,0.008319622,0.0004891317,0.00064475153,0.0009295027,0.0006215369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007371667,0.0013963823,0.001911459,0.0012794976,0.0013916503,0.005418601,0.0020378414,0.0014423109,0.0084689595],"category_scores_gemma":[0.017774194,0.001290442,0.0016028747,0.0025549643,0.0030272764,0.0062768855,0.002724796,0.0044303522,0.00050291856],"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.00012944936,0.00008769797,0.00042208788,0.000087377644,0.000040260566,0.00005114455,0.00020591667,0.059880897,0.00051697146,0.9204222,0.0035180885,0.0146380635],"study_design_scores_gemma":[0.000020871883,0.000030543786,0.00018950977,0.00003351218,0.000044475117,0.000053530148,0.000092637194,0.3951912,0.00024309619,0.60194707,0.0021399283,0.000013624937],"about_ca_topic_score_codex":0.002607748,"about_ca_topic_score_gemma":0.0018969569,"teacher_disagreement_score":0.0084689595,"about_ca_system_score_codex":0.0030715973,"about_ca_system_score_gemma":0.0023652383,"threshold_uncertainty_score":0.03898555},"labels":[],"label_agreement":null},{"id":"W151442501","doi":"10.1007/3-540-45164-1_3","title":"Short-Term Profiling for a Case-Based Reasoning Recommendation System","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université de Montréal","funders":"","keywords":"Computer science; Profiling (computer programming); Term (time); Information retrieval; Artificial intelligence; Programming language","score_opus":0.025741535658154083,"score_gpt":0.2620913291440486,"score_spread":0.23634979348589452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151442501","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.12123667,0.00032589832,0.8510024,0.00071959273,0.000085542866,0.0004906155,0.0013928486,0.018193768,0.006552679],"genre_scores_gemma":[0.47573584,0.00016214194,0.5124396,0.00013409197,0.000049233426,0.0002289566,0.0030218943,0.00042165094,0.007806601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833894,0.0003451249,0.0002589975,0.00027876327,0.00065002835,0.00012816687],"domain_scores_gemma":[0.9953629,0.0021983164,0.00024070842,0.0009411434,0.0009350108,0.00032189282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002285758,0.00042665502,0.00068593345,0.0022046273,0.0009817956,0.0021095804,0.0018080747,0.001270329,0.006472918],"category_scores_gemma":[0.009939088,0.00060678547,0.0005256557,0.0015326403,0.00023947716,0.003154084,0.0008821187,0.00089800055,0.003580095],"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.0018488797,0.0010362768,0.01636866,0.0001478711,0.00012545421,0.0006681482,0.00083825266,0.033330258,0.03287924,0.009317508,0.016246103,0.8871933],"study_design_scores_gemma":[0.000058119153,0.00020149685,0.0052386317,0.000030840925,0.00010071725,0.00049507985,0.00017352977,0.9537757,0.021755839,0.008596395,0.009505483,0.000068180554],"about_ca_topic_score_codex":0.0076000695,"about_ca_topic_score_gemma":0.0113254255,"teacher_disagreement_score":0.0076000695,"about_ca_system_score_codex":0.00096568326,"about_ca_system_score_gemma":0.00083802413,"threshold_uncertainty_score":0.02165407},"labels":[],"label_agreement":null},{"id":"W1514429059","doi":"10.1007/3-540-44543-9_17","title":"On the Difference between Navigating Semi-structured Data and Querying It","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Computer science; Query language; Schema (genetic algorithms); Data structure; Theoretical computer science; Semi-structured data; Programming language; Information retrieval; Relational database","score_opus":0.03567632543008109,"score_gpt":0.2779481489879913,"score_spread":0.24227182355791022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514429059","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.031033495,0.019019313,0.85808814,0.030733913,0.0015255617,0.00012924112,0.0004335712,0.001108503,0.057928193],"genre_scores_gemma":[0.35676256,0.025000377,0.574685,0.0061442996,0.0019677684,0.00034434904,0.0012492678,0.0022783203,0.031568047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99319285,0.0024089145,0.00058263855,0.001040325,0.0023254424,0.0004498297],"domain_scores_gemma":[0.9417001,0.048696563,0.00071476767,0.0059970883,0.002093963,0.00079752726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009244159,0.00091117836,0.0018589356,0.0019734257,0.0024830278,0.012360548,0.0041492926,0.0056865592,0.0086909225],"category_scores_gemma":[0.049277596,0.0018381918,0.0011784638,0.0053118854,0.015555618,0.07202333,0.009608086,0.008604444,0.0016649876],"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.00015036041,0.00004290976,0.00038942616,0.00025289,0.000013933948,0.000099958655,0.002138703,0.0027968273,0.00083406235,0.9333911,0.0077415407,0.052148357],"study_design_scores_gemma":[0.000029499693,0.000044160635,0.00030582395,0.00018054011,0.00002931717,0.00023977744,0.0010439502,0.020814234,0.0013441517,0.9378151,0.03810428,0.000049061313],"about_ca_topic_score_codex":0.007720375,"about_ca_topic_score_gemma":0.006390025,"teacher_disagreement_score":0.012360548,"about_ca_system_score_codex":0.0022699654,"about_ca_system_score_gemma":0.0019093087,"threshold_uncertainty_score":0.048888385},"labels":[],"label_agreement":null},{"id":"W1514588962","doi":"10.1007/978-3-540-45012-2_11","title":"Bilateral Negotiation with Incomplete and Uncertain Information: A Decision-Theoretic Approach Using a Model of the Opponent","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Negotiation; Computer science; Adversary; Context (archaeology); Heuristic; Negotiation theory; Software agent; Simple (philosophy); Knowledge management; Influence diagram; Artificial intelligence; Decision tree; Computer security","score_opus":0.0265371045992697,"score_gpt":0.22887723534482607,"score_spread":0.20234013074555637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514588962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010291475,0.0010092183,0.9684493,0.0012172023,0.00013529373,0.0000798718,0.000056747554,0.00004374414,0.018717108],"genre_scores_gemma":[0.7314747,0.0033221112,0.24768728,0.00030611712,0.0005771389,0.00047806473,0.00012643774,0.00009919623,0.015928943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948938,0.0031534224,0.00017693559,0.00051729096,0.0008765762,0.00038194895],"domain_scores_gemma":[0.993038,0.00575398,0.00040398858,0.00023402147,0.00031576495,0.00025428677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075409682,0.0021782408,0.0038268168,0.0016633833,0.0018126905,0.007833043,0.0061343582,0.0062741786,0.0060970876],"category_scores_gemma":[0.013303512,0.002134632,0.0029541366,0.0032642053,0.004913904,0.01060563,0.0037002198,0.004415885,0.0005875477],"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.00006222966,0.000065837085,0.00009865096,0.00013864174,0.00010122277,0.00017150774,0.00018373459,0.348398,0.0003481689,0.6422544,0.0008657399,0.007311954],"study_design_scores_gemma":[0.000027498405,0.00003020921,0.000031921896,0.00002646842,0.000047548834,0.000057220284,0.000049518847,0.6571773,0.00013844966,0.34154618,0.0008377763,0.000029885237],"about_ca_topic_score_codex":0.002667344,"about_ca_topic_score_gemma":0.002455302,"teacher_disagreement_score":0.007833043,"about_ca_system_score_codex":0.0039719357,"about_ca_system_score_gemma":0.002612419,"threshold_uncertainty_score":0.03988093},"labels":[],"label_agreement":null},{"id":"W1514622417","doi":"10.1007/978-3-642-11161-7_6","title":"On the Impact of Witness-Based Collusion in Agent Societies","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Witness; Collusion; Reputation; Computer science; Exploit; Computer security; Order (exchange); Set (abstract data type); Business; Political science; Law; Industrial organization","score_opus":0.02243739668605219,"score_gpt":0.3039183998361041,"score_spread":0.28148100315005187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514622417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35396236,0.009597146,0.41533232,0.018479705,0.0011293632,0.00025508195,0.00043412278,0.00029515475,0.20051469],"genre_scores_gemma":[0.98351353,0.0022179028,0.007116762,0.0002571217,0.00030263676,0.000057788657,0.000050836225,0.00005089162,0.006432589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963302,0.002287898,0.00010873077,0.00031733737,0.0005372811,0.00041859265],"domain_scores_gemma":[0.8997214,0.08955034,0.0032422692,0.0037655507,0.002059939,0.0016605484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006569479,0.0007524524,0.0016898128,0.0009813991,0.001660061,0.0037484395,0.002466712,0.0030502004,0.017000046],"category_scores_gemma":[0.061817523,0.0006187364,0.0008778776,0.0012204342,0.004981811,0.011107433,0.0045084334,0.004068897,0.0007254256],"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.00041427749,0.00010799924,0.0008898322,0.00023889604,0.00007865119,0.00022603,0.0005847216,0.121878885,0.0009972664,0.85320705,0.0050108177,0.016365575],"study_design_scores_gemma":[0.000057968457,0.000112108144,0.00037496915,0.000056249988,0.000043593198,0.000082098326,0.00028383805,0.22063608,0.0002568054,0.7764684,0.0015970833,0.000030825067],"about_ca_topic_score_codex":0.0022326473,"about_ca_topic_score_gemma":0.0012674816,"teacher_disagreement_score":0.017000046,"about_ca_system_score_codex":0.002148705,"about_ca_system_score_gemma":0.0011967283,"threshold_uncertainty_score":0.05687082},"labels":[],"label_agreement":null},{"id":"W1514656152","doi":"10.1007/978-3-642-18073-6_13","title":"Monogamy of Multi-qubit Entanglement in Terms of Rényi and Tsallis Entropies","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","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 Calgary","funders":"Ministry of Education, India; Ministry of Earth Sciences; Canadian Institute for Advanced Research","keywords":"Quantum entanglement; Qubit; Class (philosophy); Tsallis entropy; Entropy (arrow of time); Computer science; Statistical physics; Quantum; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.018493925156373978,"score_gpt":0.2311221938174558,"score_spread":0.2126282686610818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514656152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13993284,0.0127723245,0.5480612,0.0064942166,0.0024640625,0.00011597386,0.00053222966,0.00035650333,0.2892706],"genre_scores_gemma":[0.91248673,0.0038651342,0.03693459,0.00077298953,0.0025496485,0.00023902052,0.00016652762,0.00027714335,0.042708337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988047,0.00045796335,0.00007517933,0.0001594597,0.000372372,0.00013038387],"domain_scores_gemma":[0.99721766,0.0017621116,0.00020263866,0.00044771362,0.00022394894,0.00014590102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022797622,0.0008903426,0.0011983772,0.002485657,0.0014912395,0.0030041472,0.0015569363,0.0015953379,0.006800034],"category_scores_gemma":[0.005955968,0.00071817794,0.0011048486,0.0019123418,0.005922689,0.0076896115,0.0026936338,0.0039540343,0.00092481636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006868493,0.0000047249705,0.000024921304,0.000012979469,0.0000037787147,0.000018156694,0.000048957012,0.001236586,0.00014011559,0.99700266,0.00034501005,0.0011552181],"study_design_scores_gemma":[0.0000020176371,0.0000075916278,0.00008127818,0.000012836721,0.0000033576896,0.000041637686,0.000012212715,0.010086317,0.00013982525,0.9884243,0.0011769943,0.000011658911],"about_ca_topic_score_codex":0.00045643596,"about_ca_topic_score_gemma":0.0005667487,"teacher_disagreement_score":0.006800034,"about_ca_system_score_codex":0.0016890928,"about_ca_system_score_gemma":0.0010348004,"threshold_uncertainty_score":0.022748351},"labels":[],"label_agreement":null},{"id":"W1514701801","doi":"10.1007/978-3-540-68123-6_47","title":"A Dynamic Window Based Passage Extraction Algorithm for Genomics Information Retrieval","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"York University","funders":"","keywords":"Computer science; Genomics; Paragraph; Algorithm; Window (computing); Data mining; Focus (optics); Artificial intelligence; Information retrieval; Genome; World Wide Web; Biology","score_opus":0.011321051877579093,"score_gpt":0.2531834802643988,"score_spread":0.2418624283868197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514701801","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.018500164,0.0014376149,0.9618883,0.0001454885,0.0002133104,0.00036047233,0.0023129717,0.014029266,0.0011123434],"genre_scores_gemma":[0.042923696,0.00049964373,0.94520104,0.00007531372,0.00010512127,0.00031000987,0.006296906,0.000643351,0.003944861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896634,0.00013812986,0.00016760739,0.00028420036,0.00035611575,0.00008770478],"domain_scores_gemma":[0.9981987,0.0008763237,0.0000869446,0.00023736407,0.00050972996,0.00009084852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014088209,0.000946731,0.0020844075,0.005821731,0.0014799506,0.0021151167,0.0022842905,0.0011394738,0.0072757914],"category_scores_gemma":[0.0040082065,0.0005348399,0.0012433786,0.0074532633,0.00045153117,0.0030148963,0.0016479125,0.0010712919,0.004203908],"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.00053369434,0.00023124632,0.0011524073,0.00028221137,0.00012177239,0.00019139756,0.00022401131,0.0041949586,0.030933158,0.004139926,0.02003204,0.9379632],"study_design_scores_gemma":[0.00048835645,0.0008464503,0.006264297,0.00013648227,0.0007015523,0.0017176874,0.00045615216,0.77798206,0.101560675,0.02294648,0.086676754,0.00022295307],"about_ca_topic_score_codex":0.0064937184,"about_ca_topic_score_gemma":0.006617672,"teacher_disagreement_score":0.0072757914,"about_ca_system_score_codex":0.0005882989,"about_ca_system_score_gemma":0.0014959837,"threshold_uncertainty_score":0.024339914},"labels":[],"label_agreement":null},{"id":"W1514706564","doi":"10.1007/978-3-642-16584-9_66","title":"Evaluating the Fuzzy Coverage Model for 3D Multi-camera Network Applications","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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 Windsor","funders":"","keywords":"Computer science; Fuzzy logic; Artificial intelligence","score_opus":0.05774251433461911,"score_gpt":0.3534989283383937,"score_spread":0.29575641400377456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514706564","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.23829658,0.0009600363,0.7563271,0.00015191312,0.000028706576,0.00006291086,0.00015023164,0.00033284893,0.00368975],"genre_scores_gemma":[0.94942063,0.00026817905,0.049316075,0.00002324683,0.000018534643,0.000038393944,0.00014527566,0.000035678317,0.000733953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989976,0.00027443012,0.000030933094,0.00011686761,0.0004779555,0.00010223652],"domain_scores_gemma":[0.9975204,0.0017644283,0.00015330686,0.00015040129,0.0003371267,0.000074323645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015018565,0.00064868876,0.0007900286,0.0012197264,0.00029860798,0.0012643732,0.0010833528,0.0013179372,0.001577921],"category_scores_gemma":[0.004673315,0.00035114374,0.000763572,0.00090436055,0.0004621798,0.0014896237,0.0006975942,0.0004281909,0.0001731316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019791673,0.000037485086,0.0016022865,0.0000459556,0.000036920723,0.00003947519,0.000027874356,0.95542604,0.0038457224,0.002441666,0.00026651358,0.03603216],"study_design_scores_gemma":[0.0000013298735,0.000019415582,0.00027061408,0.0000020959333,0.000005417123,0.000009691173,0.00000573043,0.9987118,0.0004186649,0.00050479826,0.0000481085,0.0000024686615],"about_ca_topic_score_codex":0.0126408,"about_ca_topic_score_gemma":0.0077109523,"teacher_disagreement_score":0.0126408,"about_ca_system_score_codex":0.0016443181,"about_ca_system_score_gemma":0.0005446868,"threshold_uncertainty_score":0.025134444},"labels":[],"label_agreement":null},{"id":"W1514731943","doi":"10.1007/978-3-540-74407-8_33","title":"Temporal Antecedent Failure: Refining Vacuity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Antecedent (behavioral psychology); Computer science; Temporal logic; Model checking; Extension (predicate logic); Linear temporal logic; Theoretical computer science; Programming language; Algorithm","score_opus":0.050014291363107866,"score_gpt":0.3104683291280238,"score_spread":0.26045403776491594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514731943","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.03494305,0.0005170915,0.869715,0.0019439831,0.00076344673,0.00027545745,0.00051688927,0.0054502287,0.085874826],"genre_scores_gemma":[0.55881834,0.0008626474,0.39185715,0.00095648854,0.0005478116,0.00020358856,0.0011127845,0.004249569,0.04139174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646336,0.0007828071,0.0002479245,0.0007824936,0.0011368289,0.0005866022],"domain_scores_gemma":[0.9879103,0.0058886763,0.0003175435,0.0039439863,0.0016798852,0.00025971205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047922647,0.0012028236,0.0015330915,0.0018836467,0.0025656987,0.0033664654,0.0050246003,0.0027136805,0.021990456],"category_scores_gemma":[0.02050078,0.0017363995,0.0028947694,0.0016985161,0.0060047624,0.011663368,0.0073409984,0.0059429617,0.0039122473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002737791,0.00008468964,0.00065821595,0.00048267056,0.00003593972,0.00085942284,0.0014123463,0.0072919917,0.00474682,0.899152,0.01057326,0.07442884],"study_design_scores_gemma":[0.00007415062,0.00004151903,0.00021303864,0.00020715455,0.00014525576,0.0005038593,0.00045760375,0.037639275,0.012384996,0.91361624,0.034652688,0.00006422295],"about_ca_topic_score_codex":0.0032556015,"about_ca_topic_score_gemma":0.0037808912,"teacher_disagreement_score":0.021990456,"about_ca_system_score_codex":0.0017179658,"about_ca_system_score_gemma":0.0023828072,"threshold_uncertainty_score":0.073565364},"labels":[],"label_agreement":null},{"id":"W1514771780","doi":"10.1007/978-3-642-20398-5_38","title":"A Tabular Expression Toolbox for Matlab/Simulink","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"McMaster University","funders":"","keywords":"Toolbox; Computer science; MATLAB; Solver; Programming language; Interface (matter); Expression (computer science); Code (set theory); Completeness (order theory); Software engineering; Embedded system; Operating system","score_opus":0.03202961409431724,"score_gpt":0.2631017049716519,"score_spread":0.23107209087733468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514771780","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006673761,0.00044497952,0.882536,0.000108005224,0.00021933942,0.00014685585,0.004663437,0.09346109,0.01775281],"genre_scores_gemma":[0.028678771,0.0018655154,0.7914379,0.00065675005,0.00018061229,0.0012589312,0.017105808,0.066095866,0.09271983],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993895,0.000139023,0.000082696926,0.00007997326,0.00025362472,0.00005509959],"domain_scores_gemma":[0.9984408,0.0006674492,0.00008522898,0.00023290321,0.00053091726,0.00004264016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081990275,0.0018792712,0.00095726835,0.0013549821,0.00040244742,0.0014407049,0.0023223658,0.0009159649,0.16358876],"category_scores_gemma":[0.0033443624,0.000960399,0.0009534673,0.0012254245,0.00034086825,0.0013620023,0.0009724151,0.0019594978,0.10239551],"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.00044152036,0.00017907984,0.00039594882,0.002217555,0.00009244325,0.00047775352,0.00025896527,0.023413988,0.02384754,0.037629075,0.3581534,0.5528928],"study_design_scores_gemma":[0.00030598362,0.00017201339,0.0005847359,0.0005890975,0.0001099919,0.0013112035,0.0000892655,0.108608246,0.046518996,0.035660584,0.80591625,0.00013366579],"about_ca_topic_score_codex":0.0009613603,"about_ca_topic_score_gemma":0.001264366,"teacher_disagreement_score":0.16358876,"about_ca_system_score_codex":0.0003531084,"about_ca_system_score_gemma":0.0006941272,"threshold_uncertainty_score":0.547259},"labels":[],"label_agreement":null},{"id":"W1514794976","doi":"10.1007/978-3-642-04146-4_2","title":"Image Analysis and Machine Learning: How to Foster a Stronger Connection?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Selection (genetic algorithm); Machine learning; Image (mathematics); Cognitive science; Psychology","score_opus":0.015201461122925834,"score_gpt":0.24404315248455546,"score_spread":0.22884169136162963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514794976","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.016869145,0.07830062,0.68522656,0.12191739,0.0039346847,0.000083112696,0.00019313999,0.0011411714,0.09233423],"genre_scores_gemma":[0.37236786,0.0660677,0.48483497,0.01905388,0.0116792815,0.0003118991,0.0003126236,0.0009770957,0.044394743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976676,0.00097194326,0.00013996083,0.00046155456,0.00065269734,0.00010617805],"domain_scores_gemma":[0.9849606,0.010157817,0.0005535562,0.0022923513,0.0014858077,0.00055000425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045483457,0.0012518854,0.0016543895,0.0017058996,0.001329957,0.005997825,0.0024542825,0.004740871,0.015737236],"category_scores_gemma":[0.024067633,0.0008469509,0.0008782818,0.0018300645,0.008911707,0.0323555,0.0070237545,0.008442054,0.0055498593],"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.00014532666,0.00012590078,0.0005023907,0.0006088289,0.00009570485,0.00006459689,0.0002393752,0.0014922342,0.0020380178,0.73523206,0.020862307,0.23859325],"study_design_scores_gemma":[0.000023879058,0.000036845762,0.00024931625,0.00015652124,0.000031499923,0.00014053092,0.000057306155,0.008312301,0.00093521224,0.9572535,0.032776482,0.0000264426],"about_ca_topic_score_codex":0.0010355623,"about_ca_topic_score_gemma":0.0010757877,"teacher_disagreement_score":0.015737236,"about_ca_system_score_codex":0.0011235516,"about_ca_system_score_gemma":0.0010520231,"threshold_uncertainty_score":0.05264628},"labels":[],"label_agreement":null},{"id":"W1514801348","doi":"10.1007/978-3-642-19595-2_1","title":"McFLAT: A Profile-Based Framework for MATLAB Loop Analysis and Transformations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Compiler; Programming language; Interpreter; Parallel computing; Loop (graph theory); For loop; Code generation; Code (set theory); Computational science; Operating system","score_opus":0.02035546000123966,"score_gpt":0.2623846154754576,"score_spread":0.24202915547421794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514801348","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.0016794018,0.00013043011,0.8355493,0.0001252945,0.00004533916,0.000117947,0.0010337747,0.15931846,0.0020000837],"genre_scores_gemma":[0.07943188,0.0003765858,0.8716011,0.00043886597,0.000085135835,0.00078356755,0.0066603688,0.03689727,0.003725243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976025,0.0004658361,0.00027785162,0.00048217442,0.00091106136,0.00026062172],"domain_scores_gemma":[0.99552476,0.0019951512,0.00040688872,0.000927493,0.00095737976,0.00018826575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027219118,0.0024525588,0.0010493391,0.0019977677,0.0007005606,0.0025881208,0.003926889,0.0012366852,0.014910902],"category_scores_gemma":[0.01269279,0.001554931,0.0024656514,0.0009776442,0.0013576484,0.0034383181,0.002850518,0.0035807176,0.008557101],"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.0012936034,0.0003947059,0.0077438764,0.0014701784,0.0002791138,0.0008462548,0.0013754221,0.17312948,0.030760417,0.09807848,0.13642147,0.5482069],"study_design_scores_gemma":[0.00017450572,0.00018765237,0.0011849364,0.00028693228,0.000059490692,0.00044400102,0.00014525538,0.8042724,0.037464745,0.06097039,0.09462488,0.00018475826],"about_ca_topic_score_codex":0.006184907,"about_ca_topic_score_gemma":0.00851542,"teacher_disagreement_score":0.014910902,"about_ca_system_score_codex":0.0014983403,"about_ca_system_score_gemma":0.0028299463,"threshold_uncertainty_score":0.049881935},"labels":[],"label_agreement":null},{"id":"W1514835576","doi":"10.1007/978-3-540-31869-9_8","title":"A Survey of Software Development Approaches Addressing Dependability","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dependability; Computer science; Software engineering; Software development; Software; Programming language","score_opus":0.15180079029563096,"score_gpt":0.3046797621082638,"score_spread":0.15287897181263285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514835576","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007279201,0.68676984,0.27688134,0.001986729,0.00062660663,0.00013253685,0.00022778536,0.00081978884,0.025276145],"genre_scores_gemma":[0.035205755,0.74181145,0.20896874,0.0010649477,0.0008956913,0.00015514794,0.0007195627,0.00027747752,0.010901207],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982551,0.0002586766,0.00023093035,0.0002668922,0.00089237426,0.00009595565],"domain_scores_gemma":[0.9953703,0.00318864,0.00023833098,0.00031915514,0.00076502876,0.00011849262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017938636,0.0011558584,0.0014274877,0.0051795705,0.0006512632,0.0022995467,0.0020847449,0.0014347245,0.0038455327],"category_scores_gemma":[0.0045730956,0.0010725994,0.00090857316,0.011830132,0.000701653,0.0044018617,0.0012026747,0.0017107634,0.0016422154],"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.0000332633,0.00011358924,0.00081360433,0.00505036,0.00004055119,0.000083672974,0.00021209325,0.0024569635,0.0025171703,0.029029254,0.008658469,0.9509909],"study_design_scores_gemma":[0.000050170987,0.00044265125,0.0040388256,0.006300968,0.00025469917,0.0028310667,0.00038938472,0.021862688,0.007067842,0.11212855,0.84451604,0.00011715106],"about_ca_topic_score_codex":0.0010140719,"about_ca_topic_score_gemma":0.0015902475,"teacher_disagreement_score":0.0051795705,"about_ca_system_score_codex":0.00078097195,"about_ca_system_score_gemma":0.001418539,"threshold_uncertainty_score":0.012864649},"labels":[],"label_agreement":null},{"id":"W1514889520","doi":"10.1007/11552253_8","title":"Knowledge Discovery in the Identification of Differentially Expressed Genes in Tumoricidal Macrophage","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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":"Biotechnology Research Institute; National Research Council Canada","funders":"","keywords":"Identification (biology); Computer science; Microarray analysis techniques; Computational biology; Set (abstract data type); Gene; Microarray; Data mining; Biology; Gene expression; Genetics","score_opus":0.01367865114990428,"score_gpt":0.26135205227865804,"score_spread":0.24767340112875377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514889520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41298372,0.06912518,0.48050553,0.007951898,0.00039010387,0.00022717123,0.0058122757,0.00083738327,0.022166643],"genre_scores_gemma":[0.69262975,0.022141108,0.27377665,0.000978095,0.00034758155,0.0002028701,0.005460461,0.000076346514,0.0043870686],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996092,0.00008929896,0.000033506727,0.00010711125,0.00011415903,0.000046746383],"domain_scores_gemma":[0.9989567,0.000812584,0.000052670483,0.00006684481,0.00008442404,0.000026816486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011887221,0.00031861622,0.0008766447,0.001499892,0.00035112095,0.0014076191,0.0011093651,0.0008023764,0.0014387175],"category_scores_gemma":[0.002072414,0.0002780946,0.0008395703,0.0022556335,0.0006558585,0.0016477862,0.0006432701,0.00088713184,0.0005692021],"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.0012690277,0.00055258686,0.016586278,0.0025116268,0.000443663,0.0019378496,0.0005019145,0.031652853,0.10878437,0.059400767,0.0095188245,0.7668403],"study_design_scores_gemma":[0.00012367657,0.0005537864,0.03219339,0.0007365659,0.00067036727,0.0023107247,0.0008977528,0.30239516,0.09931802,0.52517,0.035489116,0.00014136624],"about_ca_topic_score_codex":0.0009980767,"about_ca_topic_score_gemma":0.0014995135,"teacher_disagreement_score":0.001499892,"about_ca_system_score_codex":0.000726633,"about_ca_system_score_gemma":0.0007068154,"threshold_uncertainty_score":0.0062866807},"labels":[],"label_agreement":null},{"id":"W1514891901","doi":"10.1007/978-3-642-41299-8_39","title":"A Self-learning Audio Player That Uses a Rough Set and Neural Net Hybrid Approach","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Laurentian University","funders":"","keywords":"Computer science; Process (computing); Set (abstract data type); Active listening; Artificial neural network; Artificial intelligence; Stability (learning theory); Rough set; Machine learning; Speech recognition","score_opus":0.026499687737718883,"score_gpt":0.225733887183315,"score_spread":0.19923419944559612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514891901","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.019012216,0.00025068776,0.9647941,0.00014500298,0.00024156921,0.00024835148,0.0001327322,0.0040768115,0.011098517],"genre_scores_gemma":[0.18988867,0.00027640225,0.76666176,0.00027954215,0.00012441144,0.00029105187,0.00027070998,0.0003007127,0.041906793],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996859,0.000031585165,0.00001625474,0.00007030932,0.00016683378,0.000029154531],"domain_scores_gemma":[0.99972075,0.00007946634,0.000014776497,0.00003397416,0.00010601168,0.0000449304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053088967,0.00043759067,0.0008335174,0.00061656215,0.0005928481,0.0012512679,0.002309795,0.0011622051,0.011913349],"category_scores_gemma":[0.00076269754,0.0002798676,0.00052308594,0.00043427825,0.00036655655,0.0012263246,0.0013800267,0.00072703714,0.0032303892],"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.0008224614,0.0005177734,0.0008131151,0.00033073564,0.0001646514,0.0005219264,0.00022404682,0.05515207,0.096899495,0.014465551,0.009824202,0.8202639],"study_design_scores_gemma":[0.0001062092,0.0005419115,0.0006574297,0.00003995708,0.000096317366,0.00047033583,0.00009955513,0.93036807,0.04117179,0.0048421877,0.021539532,0.00006673077],"about_ca_topic_score_codex":0.0018227007,"about_ca_topic_score_gemma":0.002464058,"teacher_disagreement_score":0.011913349,"about_ca_system_score_codex":0.00041304767,"about_ca_system_score_gemma":0.00055483915,"threshold_uncertainty_score":0.03985417},"labels":[],"label_agreement":null},{"id":"W1514984630","doi":"10.1007/978-3-642-01818-3_28","title":"Exploratory Analysis of Co-Change Graphs for Code Refactoring","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Simon Fraser University","funders":"","keywords":"Computer science; Code refactoring; Cluster analysis; Software; Software system; Probabilistic logic; Theoretical computer science; Data mining; Software engineering; Distributed computing; Programming language; Artificial intelligence","score_opus":0.05951093469987863,"score_gpt":0.30765371465937946,"score_spread":0.24814277995950085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514984630","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.7459925,0.0011322572,0.19341117,0.00048798375,0.00010970784,0.00082614983,0.02917561,0.02060753,0.008257036],"genre_scores_gemma":[0.7709837,0.00036628632,0.19844252,0.000048515776,0.000041298877,0.00036113377,0.025118487,0.0018275244,0.0028105609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804544,0.00039699685,0.0001415561,0.00040717237,0.0008557719,0.00015304636],"domain_scores_gemma":[0.95981044,0.029454293,0.0022832851,0.0032936234,0.0045954674,0.00056275364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001900201,0.0006346751,0.00040493786,0.009193016,0.000730572,0.001430363,0.0010121583,0.0006081635,0.0034861467],"category_scores_gemma":[0.018471997,0.0002586051,0.0008337569,0.007717362,0.00043313348,0.0012987055,0.0010200245,0.0010355001,0.0008343378],"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.0012244647,0.0009937809,0.112567976,0.0024217665,0.00044324296,0.0017426736,0.011509114,0.015965601,0.056954097,0.010639176,0.01918781,0.7663503],"study_design_scores_gemma":[0.0001590689,0.001155433,0.39722848,0.00078940805,0.00064713554,0.0034569732,0.0083948355,0.40960735,0.0851927,0.033515226,0.059481256,0.00037213328],"about_ca_topic_score_codex":0.004280094,"about_ca_topic_score_gemma":0.008015788,"teacher_disagreement_score":0.009193016,"about_ca_system_score_codex":0.00052581733,"about_ca_system_score_gemma":0.0009712836,"threshold_uncertainty_score":0.011662364},"labels":[],"label_agreement":null},{"id":"W1515132277","doi":"10.1007/978-3-540-27868-9_26","title":"Dictionary-Based Syntactic Pattern Recognition Using Tries","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University","funders":"","keywords":"Trie; Levenshtein distance; Computer science; String (physics); Prefix; Edit distance; Set (abstract data type); Computation; Representation (politics); Element (criminal law); Algorithm; Substitution (logic); Theoretical computer science; Data structure; Mathematics; Programming language","score_opus":0.03047022484350267,"score_gpt":0.25345434159893476,"score_spread":0.2229841167554321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515132277","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.018556971,0.0006684977,0.9525971,0.00016419076,0.00032293468,0.00020508212,0.0011386949,0.01903809,0.0073084403],"genre_scores_gemma":[0.13217272,0.0010132361,0.84329695,0.0002691025,0.00012668465,0.0003053438,0.005164162,0.0017629305,0.01588884],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992428,0.00013558564,0.00008508978,0.00021620907,0.00023824179,0.00008217327],"domain_scores_gemma":[0.9987212,0.0004820554,0.000057386245,0.00029528796,0.00038752766,0.000056523873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059757737,0.0014586637,0.0019629202,0.0029944528,0.0007751516,0.0022597858,0.0019269107,0.00097463554,0.016823566],"category_scores_gemma":[0.0020871984,0.00068719295,0.0013870477,0.0038550687,0.0008090374,0.0029088394,0.0022300517,0.0013416256,0.016381912],"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.00040368058,0.00007244161,0.0007532861,0.00037342985,0.00010596704,0.00031800527,0.0001447137,0.00502501,0.03313907,0.011424436,0.012780706,0.9354593],"study_design_scores_gemma":[0.00020230863,0.00048943126,0.0017630341,0.00020278497,0.00039925645,0.0026013323,0.0008117009,0.72054935,0.16915405,0.055789758,0.04786464,0.00017237224],"about_ca_topic_score_codex":0.001618797,"about_ca_topic_score_gemma":0.0030299935,"teacher_disagreement_score":0.016823566,"about_ca_system_score_codex":0.00030741698,"about_ca_system_score_gemma":0.0011460318,"threshold_uncertainty_score":0.056280434},"labels":[],"label_agreement":null},{"id":"W1515149490","doi":"10.1007/3-540-45591-4_71","title":"Workshop on Java for Parallel and Distributed Computing","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Java; Computer science; Domain (mathematical analysis); Set (abstract data type); World Wide Web; Data science; Software engineering; Operating system; Programming language; Mathematics","score_opus":0.022148034365297792,"score_gpt":0.25807853346622783,"score_spread":0.23593049910093003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515149490","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063281143,0.0062626414,0.883498,0.0049924986,0.00874874,0.00030526114,0.00073996244,0.009755012,0.07936967],"genre_scores_gemma":[0.060711693,0.011647737,0.59787816,0.0032785765,0.002676708,0.0005905098,0.004728613,0.009461866,0.30902612],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986972,0.0002464636,0.000103701386,0.00024260343,0.00053297856,0.00017707789],"domain_scores_gemma":[0.99750644,0.00075229764,0.000060904033,0.0007507677,0.00060606195,0.00032352013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031279558,0.001342769,0.0014056782,0.0008291593,0.0007833361,0.0038359894,0.0028464173,0.0010799669,0.023201939],"category_scores_gemma":[0.0039913263,0.0011550351,0.0013805506,0.0013541578,0.00081357395,0.004651508,0.002293856,0.0040582637,0.009989978],"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.0005418282,0.00044544396,0.000594666,0.00058793556,0.00009075901,0.00022893155,0.00043374457,0.0037790893,0.015651124,0.09723124,0.28850088,0.59191436],"study_design_scores_gemma":[0.00022043652,0.00016215294,0.0010145032,0.0003404143,0.00013343121,0.00054693274,0.00009156348,0.036286745,0.017755494,0.07095359,0.8724353,0.000059507045],"about_ca_topic_score_codex":0.0027145725,"about_ca_topic_score_gemma":0.0023981917,"teacher_disagreement_score":0.023201939,"about_ca_system_score_codex":0.0007043637,"about_ca_system_score_gemma":0.0017748644,"threshold_uncertainty_score":0.07761824},"labels":[],"label_agreement":null},{"id":"W1515190506","doi":"10.1007/11602569_25","title":"Distributed Point Rendering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Rendering (computer graphics); Graphics pipeline; Graphics; Graphics processing unit; Computer graphics (images); Computer graphics; Computation; Parallel computing; Software rendering; Graphics hardware; Pipeline (software); General-purpose computing on graphics processing units; Visualization; 3D computer graphics; Artificial intelligence; Operating system; Algorithm","score_opus":0.0199910931952082,"score_gpt":0.27159855765546903,"score_spread":0.25160746446026083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515190506","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.003836068,0.00036847158,0.9063719,0.0001472972,0.00031657424,0.00007545178,0.00033672486,0.01513757,0.07340999],"genre_scores_gemma":[0.20990607,0.0014336167,0.55056113,0.0002111859,0.00030943475,0.00021420249,0.0024039,0.0065943287,0.22836609],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996468,0.000030890562,0.00001216035,0.00006742912,0.00021019268,0.00003253878],"domain_scores_gemma":[0.99964833,0.00005004496,0.00000827355,0.00018370534,0.00008269776,0.000026946249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002586468,0.0011718482,0.0009745558,0.000728873,0.0007002588,0.0017976323,0.0014452457,0.0007964939,0.07605266],"category_scores_gemma":[0.00080504117,0.00058453344,0.0006447702,0.0009332418,0.00048866344,0.001603896,0.0020445143,0.0015679513,0.019242765],"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.0004424243,0.00015218747,0.00033620346,0.00024307151,0.000043591626,0.00028574307,0.00026086374,0.039044794,0.0752894,0.10712795,0.07905989,0.697714],"study_design_scores_gemma":[0.00017102381,0.00012280648,0.0007375697,0.00009282676,0.000054288645,0.0010188197,0.00012253565,0.46406686,0.06853004,0.124195635,0.34081763,0.00007002629],"about_ca_topic_score_codex":0.0010671085,"about_ca_topic_score_gemma":0.0013947915,"teacher_disagreement_score":0.07605266,"about_ca_system_score_codex":0.0004394532,"about_ca_system_score_gemma":0.0003792251,"threshold_uncertainty_score":0.25442153},"labels":[],"label_agreement":null},{"id":"W1515231270","doi":"10.1007/11564126_29","title":"Hybrid Cost-Sensitive Decision Tree","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Western University","funders":"","keywords":"Decision tree; Computer science; Tree (set theory); Forestry; Mathematics; Artificial intelligence; Geography; Combinatorics","score_opus":0.019700516008589512,"score_gpt":0.26717104973799405,"score_spread":0.24747053372940453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515231270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038080104,0.00225809,0.95252436,0.0004059557,0.00022878345,0.00016235867,0.0007335701,0.0016258187,0.0039810627],"genre_scores_gemma":[0.48151046,0.0007158469,0.50667304,0.0004272612,0.00028831136,0.00023627646,0.00231302,0.0003278427,0.0075079626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975721,0.0007974196,0.00014776053,0.00036492347,0.00092787674,0.00018982327],"domain_scores_gemma":[0.99583757,0.002383076,0.0001448131,0.00056410435,0.00093341776,0.00013702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035283607,0.0009843525,0.0024276208,0.0019774316,0.00065576914,0.0017414421,0.0031844615,0.0014668229,0.004863926],"category_scores_gemma":[0.005362363,0.00061486714,0.0010193721,0.0026281732,0.00034218072,0.0026855718,0.0016404869,0.0015362472,0.0013254024],"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.00073347235,0.00054241286,0.0017645078,0.00021950474,0.00029139157,0.00011070588,0.00005448014,0.25437468,0.0037037225,0.012648261,0.012704838,0.712852],"study_design_scores_gemma":[0.000028039054,0.00007966845,0.00035460052,0.000015092522,0.000053038497,0.00007280854,0.000010268214,0.98259467,0.0015401066,0.013448649,0.0017892686,0.000013747362],"about_ca_topic_score_codex":0.002072411,"about_ca_topic_score_gemma":0.0028867675,"teacher_disagreement_score":0.004863926,"about_ca_system_score_codex":0.0009422123,"about_ca_system_score_gemma":0.0011596964,"threshold_uncertainty_score":0.01865995},"labels":[],"label_agreement":null},{"id":"W1515242312","doi":"10.1007/11548706_8","title":"“Rule + Exception” Strategies for Knowledge Management and Discovery","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Regina","funders":"","keywords":"Knowledge extraction; Computer science; Data science; Knowledge management; K-optimal pattern discovery; Artificial intelligence","score_opus":0.02111464550087499,"score_gpt":0.26870675107512376,"score_spread":0.24759210557424877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515242312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033908125,0.0004856781,0.98832744,0.00096209213,0.00015772127,0.000115672854,0.0001462896,0.0013759101,0.005038414],"genre_scores_gemma":[0.04726003,0.00042137288,0.94616574,0.0006397087,0.0001701713,0.00015338139,0.0005785405,0.00022761579,0.0043835114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911111,0.0034690266,0.0011186477,0.0012288332,0.0027160763,0.0003563424],"domain_scores_gemma":[0.9790718,0.010684438,0.0006362352,0.0065113306,0.0026827843,0.0004134108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009250066,0.0013816502,0.0014608881,0.0031951577,0.0016156067,0.0053419764,0.00532719,0.0023012112,0.005917736],"category_scores_gemma":[0.02890962,0.0008146914,0.0018267384,0.0034505054,0.0035317724,0.009876534,0.0034059,0.0032510695,0.0032016218],"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.00021901543,0.00016187556,0.0012523712,0.00038626866,0.00016364429,0.0005165608,0.0005543324,0.009843982,0.0029205498,0.37829039,0.018422468,0.5872684],"study_design_scores_gemma":[0.000049479833,0.00009376289,0.0002231166,0.00013966022,0.000168397,0.0007519012,0.00021428734,0.12313094,0.009867474,0.8241495,0.04115399,0.000057532256],"about_ca_topic_score_codex":0.0017826053,"about_ca_topic_score_gemma":0.0028950141,"teacher_disagreement_score":0.009250066,"about_ca_system_score_codex":0.0008237153,"about_ca_system_score_gemma":0.0021353003,"threshold_uncertainty_score":0.04891956},"labels":[],"label_agreement":null},{"id":"W1515298512","doi":"10.1007/978-3-540-24840-8_53","title":"Comparison of Permutation-Based and Binary Representation in a Genetic Algorithm for RNA Secondary Structure Prediction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"RNA; Computer science; Permutation (music); Algorithm; Representation (politics); Binary number; Genetic algorithm; Folding (DSP implementation); Nucleic acid secondary structure; Key (lock); Theoretical computer science; Translation (biology); Computational biology; Mathematics; Genetics; Biology; Machine learning; Gene; Physics; Messenger RNA; Arithmetic","score_opus":0.013435114660570662,"score_gpt":0.2729615861973324,"score_spread":0.2595264715367617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515298512","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.30891126,0.00095379463,0.68074113,0.00051166076,0.00020339651,0.00023378468,0.00025204275,0.003435736,0.004757231],"genre_scores_gemma":[0.43218362,0.0003043867,0.5640293,0.0002613461,0.00006954337,0.0002708458,0.00073692156,0.00039986408,0.0017442724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.0007798765,0.000116181254,0.00016749337,0.00025853093,0.00009777631],"domain_scores_gemma":[0.9921348,0.006021855,0.00017353322,0.00039866706,0.0011249888,0.00014615555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030983444,0.00071487064,0.0010561872,0.0015025022,0.0005465332,0.0010947551,0.0016725679,0.0016895185,0.002839214],"category_scores_gemma":[0.008586363,0.00034537617,0.00060301385,0.0017038089,0.0006282353,0.00192446,0.00082589826,0.0009336518,0.0005734991],"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.0025851529,0.00069808913,0.0034065458,0.00018081411,0.0001704035,0.0000669101,0.00009465705,0.41418213,0.009576471,0.008474333,0.0023801387,0.5581844],"study_design_scores_gemma":[0.00010937735,0.00018234263,0.00044653632,0.000006809992,0.000028988445,0.000024029836,0.000013576443,0.99506456,0.0015750272,0.0023306648,0.00020874129,0.00000928652],"about_ca_topic_score_codex":0.0055828947,"about_ca_topic_score_gemma":0.0049299225,"teacher_disagreement_score":0.0055828947,"about_ca_system_score_codex":0.0010470244,"about_ca_system_score_gemma":0.001561263,"threshold_uncertainty_score":0.016385794},"labels":[],"label_agreement":null},{"id":"W1515299244","doi":"10.1007/978-3-642-03364-3_32","title":"QuizMASter - A Multi-Agent Game-Style Learning Activity","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Athabasca University; Government of Alberta; Vancouver Island University","funders":"","keywords":"Computer science; Style (visual arts); Human–computer interaction; Artificial intelligence; Art; Visual arts","score_opus":0.04170535259895931,"score_gpt":0.2893219763018475,"score_spread":0.24761662370288823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515299244","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06929331,0.00026419075,0.8551954,0.00040494977,0.00016583057,0.0008315313,0.0005268328,0.017136863,0.056180995],"genre_scores_gemma":[0.35501656,0.00028007268,0.5990495,0.00041680533,0.000036636655,0.0010213573,0.0014024759,0.000879731,0.041896895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996761,0.00011952943,0.000016938659,0.000076701544,0.00006340126,0.000047358175],"domain_scores_gemma":[0.9995704,0.00021943921,0.000027288213,0.000046518126,0.000049648985,0.00008660894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261841,0.0010788157,0.00064078276,0.00049301673,0.00065350067,0.0011717918,0.0021761141,0.0010238697,0.013328527],"category_scores_gemma":[0.001645365,0.00033571527,0.0005586048,0.00033249648,0.00041017524,0.001387113,0.0024077925,0.0008829988,0.0028119644],"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.0020374837,0.0028836837,0.0056570703,0.001310986,0.0003326418,0.0010880439,0.0037779105,0.0577641,0.071025364,0.108839266,0.0667003,0.6785832],"study_design_scores_gemma":[0.00057201774,0.001384983,0.005952745,0.00028917927,0.000250667,0.0013316076,0.0010361203,0.5517732,0.047502737,0.13237876,0.25733903,0.00018892129],"about_ca_topic_score_codex":0.0015599249,"about_ca_topic_score_gemma":0.0033450604,"teacher_disagreement_score":0.013328527,"about_ca_system_score_codex":0.0004110311,"about_ca_system_score_gemma":0.0007042418,"threshold_uncertainty_score":0.044588327},"labels":[],"label_agreement":null},{"id":"W1515336868","doi":"10.1007/978-3-540-27795-8_79","title":"Multimodal Cues for Object Manipulation in Augmented and Virtual Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Human–computer interaction; Computer science; Modalities; Multimodal interaction; Haptic technology; Stimulus modality; Augmented reality; Object (grammar); Sensory system; Modality (human–computer interaction); Virtual machine; Artificial intelligence; Cognitive psychology; Psychology","score_opus":0.03186683055192454,"score_gpt":0.2733842272207767,"score_spread":0.24151739666885216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515336868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08597742,0.08559754,0.73078406,0.00077356806,0.0012767263,0.0001029382,0.00037613243,0.0032265848,0.091885],"genre_scores_gemma":[0.6603915,0.030430812,0.21724215,0.00040892066,0.00039823243,0.00019588649,0.00042243244,0.00045061932,0.09005939],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999019,0.000014351226,0.0000042464844,0.00001487818,0.00005034611,0.000014265287],"domain_scores_gemma":[0.9998987,0.00006163522,0.000007850579,0.000011890467,0.000012417447,0.000007494248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013617313,0.00047098508,0.00044276597,0.00023111388,0.0001982908,0.0011714062,0.0006228245,0.00076784973,0.011720185],"category_scores_gemma":[0.00047428702,0.00023194501,0.00024806283,0.00031088365,0.0003575667,0.0012277535,0.0010779692,0.00049471494,0.0009879698],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005430146,0.00005494739,0.00015624642,0.0007985544,0.000029104935,0.00040173793,0.00032513504,0.0038239658,0.3958241,0.021037271,0.008767306,0.56823856],"study_design_scores_gemma":[0.00018756979,0.0014888119,0.011561753,0.0015373469,0.00025761055,0.0070643066,0.0011596538,0.12149241,0.38112536,0.09469956,0.3790599,0.00036578346],"about_ca_topic_score_codex":0.00020804073,"about_ca_topic_score_gemma":0.0006258508,"teacher_disagreement_score":0.011720185,"about_ca_system_score_codex":0.00013030539,"about_ca_system_score_gemma":0.00010556558,"threshold_uncertainty_score":0.039207935},"labels":[],"label_agreement":null},{"id":"W1515339153","doi":"10.1007/978-3-540-69858-6_11","title":"Exploiting Multiple Features with MEMMs for Focused Web Crawling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Dalhousie University","funders":"","keywords":"Crawling; Web crawler; Computer science; Focused crawler; Information retrieval; Web page; World Wide Web; Task (project management); Key (lock); Context (archaeology); Link analysis; Static web page; Web development","score_opus":0.02566325501353451,"score_gpt":0.23651966483021006,"score_spread":0.21085640981667556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515339153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2593351,0.002256556,0.7082617,0.00045222024,0.00036361182,0.00028595037,0.002206767,0.022826634,0.004011355],"genre_scores_gemma":[0.6221258,0.00022876172,0.37170744,0.00017358438,0.0002297019,0.00023346017,0.0020721026,0.000620738,0.0026083675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999022,0.00024150345,0.00010398511,0.00021793814,0.00033415537,0.00008038159],"domain_scores_gemma":[0.9961636,0.0020019012,0.0003807495,0.00076096726,0.0005790702,0.00011380927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612048,0.0008761186,0.0012685409,0.0048616556,0.0006432695,0.0010320034,0.0012291142,0.0011943551,0.0013659117],"category_scores_gemma":[0.0065166526,0.00049184513,0.000769216,0.0028801688,0.0003258745,0.0021896346,0.0010453122,0.000636712,0.00081575103],"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.00065938686,0.00045967964,0.020039823,0.00040875142,0.00036416925,0.00041471742,0.00024433198,0.020097524,0.03517593,0.002211322,0.016150083,0.9037743],"study_design_scores_gemma":[0.0000550652,0.00029100614,0.0072221532,0.000032753214,0.00018407218,0.0006254078,0.00013229098,0.95273817,0.022971291,0.009033531,0.006672212,0.000042011423],"about_ca_topic_score_codex":0.0014231021,"about_ca_topic_score_gemma":0.004574127,"teacher_disagreement_score":0.0048616556,"about_ca_system_score_codex":0.0003083563,"about_ca_system_score_gemma":0.00043887732,"threshold_uncertainty_score":0.005612254},"labels":[],"label_agreement":null},{"id":"W1515386533","doi":"10.1007/978-3-642-14527-8_7","title":"Making a Nymbler Nymble Using VERBS","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Credential; Anonymity; Scheme (mathematics); Mathematical proof; Cryptography; Computer security; Blind signature; Blocking (statistics); Signature (topology); Group signature; Theoretical computer science; Digital signature; Computer network; Public-key cryptography; Encryption; Hash function","score_opus":0.03324183531006281,"score_gpt":0.27551772804922475,"score_spread":0.24227589273916195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515386533","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.025570659,0.00042315252,0.30250004,0.0029840427,0.00067582255,0.00012131075,0.0002232832,0.0016237037,0.66587794],"genre_scores_gemma":[0.59757745,0.0006069085,0.11738175,0.00063557905,0.00023815421,0.00017063573,0.00059785123,0.002775928,0.2800157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.00036540002,0.000036507103,0.00016706178,0.00017302365,0.00007732874],"domain_scores_gemma":[0.9994326,0.00026331187,0.000029133249,0.00014681113,0.000094861985,0.000033152093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000846379,0.0006648385,0.00029896403,0.0005045776,0.0018147886,0.00361985,0.000701169,0.0011283562,0.029234359],"category_scores_gemma":[0.0028093182,0.0005076927,0.000441506,0.00047141674,0.0030856659,0.011500145,0.002134105,0.0019989107,0.006497331],"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.000041263676,0.000015536487,0.00017762043,0.000055731976,0.0000043571554,0.00009622113,0.0036953194,0.00027349775,0.0026402834,0.9406339,0.011916011,0.04045027],"study_design_scores_gemma":[0.000027159676,0.00004671352,0.00036757503,0.00015488885,0.000022541042,0.00034189122,0.003588796,0.006623087,0.0044765905,0.4663912,0.51792395,0.00003564955],"about_ca_topic_score_codex":0.0013952916,"about_ca_topic_score_gemma":0.0022270626,"teacher_disagreement_score":0.029234359,"about_ca_system_score_codex":0.00096825307,"about_ca_system_score_gemma":0.000522832,"threshold_uncertainty_score":0.097798645},"labels":[],"label_agreement":null},{"id":"W1515513565","doi":"10.1007/978-3-642-04268-3_1","title":"Optimal Transseptal Puncture Location for Robot-Assisted Left Atrial Catheter Ablation","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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":"Western University","funders":"","keywords":"Medicine; Catheter ablation; Left atrium; Catheter; Atrial fibrillation; Ablation; Kinematics; Computer science; Surgery; Cardiology","score_opus":0.012366515344825846,"score_gpt":0.24470517553474352,"score_spread":0.23233866018991767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515513565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07030002,0.00072952727,0.92623484,0.00020806599,0.000065768436,0.000038342972,0.000058175163,0.00044615567,0.0019190884],"genre_scores_gemma":[0.84306353,0.00023114448,0.15588778,0.000031346477,0.000038888633,0.000046903588,0.00004909354,0.00004340128,0.0006079401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.00015278957,0.000030469942,0.00007787528,0.00012074575,0.0000456681],"domain_scores_gemma":[0.99931574,0.00039780443,0.00009185674,0.00003513857,0.00013032848,0.000029201467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030198108,0.0004937551,0.000759848,0.000431933,0.0002912884,0.00069017505,0.00038502345,0.00058966107,0.0011917476],"category_scores_gemma":[0.0027971338,0.0004411394,0.00028198512,0.0002634648,0.00029692368,0.0006184773,0.00056074787,0.00042060268,0.00038949077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016143683,0.00023302206,0.004129981,0.00038278333,0.00008283419,0.0004694188,0.00027238208,0.49035677,0.07244826,0.005707593,0.004460733,0.41984186],"study_design_scores_gemma":[0.00009286244,0.00026614632,0.0018446279,0.00001894102,0.000038363705,0.00039998363,0.00004876684,0.983957,0.009752833,0.0027280638,0.00081391516,0.00003858496],"about_ca_topic_score_codex":0.0013532122,"about_ca_topic_score_gemma":0.0022496125,"teacher_disagreement_score":0.0013532122,"about_ca_system_score_codex":0.00026111313,"about_ca_system_score_gemma":0.0009582379,"threshold_uncertainty_score":0.003986776},"labels":[],"label_agreement":null},{"id":"W1515636825","doi":"10.1007/978-3-540-39432-7_24","title":"On the Dynamics of an Artificial Regulatory Network","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":53,"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":"Computer science; Simple (philosophy); Artificial neural network; Heterochrony; Genetic algorithm; Artificial intelligence; Artificial life; Genetic network; Mutation; Machine learning; Biology; Genetics; Gene","score_opus":0.013833763981386795,"score_gpt":0.2293129863989791,"score_spread":0.2154792224175923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515636825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073427595,0.002673218,0.8312887,0.0055108494,0.00051316014,0.00006613467,0.0004015919,0.0003071027,0.08581175],"genre_scores_gemma":[0.82662654,0.00599962,0.12067841,0.0008320247,0.0005801955,0.00028225026,0.00041780176,0.0002492689,0.044333894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965966,0.0001396312,0.000012957809,0.000075172604,0.00007904428,0.000033518456],"domain_scores_gemma":[0.9981201,0.0013365495,0.00016305495,0.00010864184,0.00013978254,0.00013180739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010543966,0.0005686794,0.00091864343,0.0008685854,0.0007704804,0.0017569278,0.0017981508,0.0018764937,0.010379123],"category_scores_gemma":[0.005639913,0.0004828226,0.0007178426,0.0010767818,0.0022978298,0.0030170153,0.0012492137,0.0016062098,0.00075387204],"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.000030827458,0.000013023449,0.00028453575,0.00005289483,0.000021604894,0.00008091416,0.00008847731,0.23330529,0.0011959272,0.7556141,0.0019927179,0.007319626],"study_design_scores_gemma":[0.0000133376125,0.000012335992,0.00010738051,0.000019213892,0.000008524724,0.00004073039,0.000022771737,0.49958354,0.00014942497,0.49740857,0.0026213573,0.000012794318],"about_ca_topic_score_codex":0.0034605924,"about_ca_topic_score_gemma":0.00250013,"teacher_disagreement_score":0.010379123,"about_ca_system_score_codex":0.0012006938,"about_ca_system_score_gemma":0.00074934965,"threshold_uncertainty_score":0.034721673},"labels":[],"label_agreement":null},{"id":"W1515687624","doi":"10.1007/978-3-540-25969-5_73","title":"A Bandwidth Allocation Scheme in Optical TDM","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Computer network; Statistical time division multiplexing; Bandwidth (computing); Multiplexing; Reservation; Optical burst switching; Bandwidth allocation; Wavelength-division multiplexing; Time-division multiplexing; Scheme (mathematics); Software deployment; Resource allocation; Telecommunications; Optical performance monitoring; Wavelength","score_opus":0.010040674972768494,"score_gpt":0.2222235018788769,"score_spread":0.2121828269061084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515687624","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.049348816,0.0012077019,0.9242714,0.00037576645,0.0003515964,0.00012906981,0.000091507965,0.0008298838,0.02339415],"genre_scores_gemma":[0.63778716,0.00075800903,0.33818528,0.0001921329,0.0001740867,0.00018552548,0.000080625985,0.00012453974,0.022512615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968815,0.000090571746,0.000017466464,0.00004309358,0.00010891748,0.00005180722],"domain_scores_gemma":[0.99963224,0.0001556453,0.000021456704,0.000113440925,0.000055264605,0.00002187481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048345124,0.00033703647,0.00045991642,0.00053587224,0.00080165913,0.0009329537,0.0010651646,0.00063919544,0.0037898638],"category_scores_gemma":[0.0011319014,0.00022783031,0.00022440609,0.0010040427,0.0006622321,0.0011888972,0.00081756496,0.00074683985,0.00061404513],"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.000524464,0.00015174516,0.00025500415,0.00017834634,0.00002160642,0.000100723984,0.00018500588,0.045645203,0.069714926,0.4642037,0.0054921526,0.41352716],"study_design_scores_gemma":[0.00009020006,0.00026817003,0.0006054909,0.0000683311,0.000044893095,0.000551802,0.000075882,0.71903354,0.0317446,0.22089744,0.026567807,0.000051827337],"about_ca_topic_score_codex":0.000788098,"about_ca_topic_score_gemma":0.0009967687,"teacher_disagreement_score":0.0037898638,"about_ca_system_score_codex":0.0009332306,"about_ca_system_score_gemma":0.00045109988,"threshold_uncertainty_score":0.012678385},"labels":[],"label_agreement":null},{"id":"W1515731613","doi":"10.1007/978-3-540-88808-6_8","title":"Abductive Workflow Mining Using Binary Resolution on Task Successor Rules","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Research and Productivity Council; National Research Council Canada","funders":"","keywords":"Workflow; Computer science; Successor cardinal; Task (project management); Abductive reasoning; Process (computing); Process mining; Resolution (logic); Business process discovery; Artificial intelligence; Event (particle physics); Data mining; Database; Work in process; Programming language; Business process management; Business process modeling; Business process; Mathematics; Systems engineering","score_opus":0.031891429174677285,"score_gpt":0.24233621253862142,"score_spread":0.21044478336394412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515731613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030045537,0.00027029653,0.9630885,0.00025941583,0.000058951508,0.0002926384,0.0005997494,0.0018215643,0.0035632574],"genre_scores_gemma":[0.18033822,0.00019561115,0.8152297,0.00011379124,0.000026277197,0.00019989314,0.0014465174,0.000095064344,0.0023548978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766856,0.0005683207,0.00033146943,0.0003925718,0.0008285551,0.00021051001],"domain_scores_gemma":[0.99390924,0.0042761895,0.0002940909,0.0006823462,0.0007466178,0.00009154084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029153023,0.0011120685,0.0014760114,0.0038547993,0.0012417691,0.002041112,0.0030745568,0.0014158457,0.0038402553],"category_scores_gemma":[0.011439948,0.0010448223,0.002092235,0.0034930196,0.0009258492,0.002696275,0.0024728738,0.0018644521,0.0010585785],"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.0005507101,0.00058674574,0.004098144,0.0006202432,0.00030487234,0.0007855713,0.00047885597,0.18707477,0.009552513,0.029719599,0.005418803,0.76080924],"study_design_scores_gemma":[0.00006460767,0.000057842524,0.0006532591,0.0001076171,0.00012781029,0.00031914917,0.00012775387,0.9338905,0.008081977,0.05484144,0.0016978916,0.000030146106],"about_ca_topic_score_codex":0.0057260534,"about_ca_topic_score_gemma":0.007145982,"teacher_disagreement_score":0.0057260534,"about_ca_system_score_codex":0.00053601473,"about_ca_system_score_gemma":0.0018268992,"threshold_uncertainty_score":0.015417814},"labels":[],"label_agreement":null},{"id":"W1515737728","doi":"10.1007/978-3-642-02017-9_40","title":"An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue 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 Guelph","funders":"","keywords":"Computer science; Reinforcement learning; Ambiguity; Artificial intelligence; Natural language; Online learning; Reinforcement; Human–computer interaction; Natural language processing; Multimedia; Programming language","score_opus":0.03491495359236249,"score_gpt":0.2726276674597225,"score_spread":0.23771271386736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515737728","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.006393829,0.00007020298,0.99125284,0.00006537942,0.00006494559,0.000077474826,0.00001830563,0.0012455619,0.00081137876],"genre_scores_gemma":[0.26852903,0.00007846695,0.72682625,0.00016620342,0.0000630683,0.00039447396,0.00010365265,0.00019598196,0.003642807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922514,0.00021796893,0.000053027154,0.00022129802,0.00017983477,0.000102710466],"domain_scores_gemma":[0.9981694,0.0011577005,0.000084583306,0.00012976461,0.00035213854,0.00010634296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018730529,0.00093323295,0.0014724146,0.00060995336,0.00069923524,0.00090479705,0.0026797329,0.0019525376,0.005665958],"category_scores_gemma":[0.004330754,0.0006183423,0.0005592803,0.0005178926,0.0009333432,0.0013831134,0.0021423795,0.001944741,0.0010715869],"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.00042743582,0.0003613792,0.00064861675,0.00010303266,0.000066412336,0.000112591624,0.00015173099,0.35215402,0.0065391567,0.011388123,0.0038005472,0.62424695],"study_design_scores_gemma":[0.0000372047,0.00003135894,0.00004240587,0.000003949197,0.0000056819977,0.00001469949,0.0000063608045,0.99627364,0.0007803707,0.0025075027,0.00029178572,0.000005025049],"about_ca_topic_score_codex":0.0069141765,"about_ca_topic_score_gemma":0.0053325193,"teacher_disagreement_score":0.0069141765,"about_ca_system_score_codex":0.001003851,"about_ca_system_score_gemma":0.0016912364,"threshold_uncertainty_score":0.018954515},"labels":[],"label_agreement":null},{"id":"W1515744550","doi":"10.1007/978-3-540-24595-7_31","title":"Fixed Parameter Algorithms for one-sided crossing minimization Revisited","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"McGill University","funders":"","keywords":"Minification; Graph; Algebraic number; Combinatorics; Mathematics; Algorithm; Vertex (graph theory); Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.04726902589280202,"score_gpt":0.3136463611387548,"score_spread":0.2663773352459528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515744550","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.003901706,0.0005922852,0.99158245,0.00029992493,0.00009526718,0.000019055742,0.0000258431,0.0002213759,0.0032620535],"genre_scores_gemma":[0.125709,0.0010121504,0.8578304,0.00034853665,0.00025905887,0.00023989344,0.00026817844,0.0008561765,0.013476673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978728,0.0010501558,0.00009755548,0.00044463793,0.00038649238,0.0001483673],"domain_scores_gemma":[0.9908319,0.0066985637,0.000290542,0.0012995483,0.00064519525,0.00023421839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045490237,0.0020143804,0.002608776,0.0015650041,0.0011067673,0.0025862898,0.0053497725,0.0038002336,0.011307216],"category_scores_gemma":[0.01992423,0.0014236605,0.0017879613,0.0032793714,0.0029648747,0.005972631,0.0037216325,0.007223717,0.002210788],"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.0002556605,0.0001910471,0.0004582025,0.00030421314,0.00013330714,0.000097496944,0.0002744518,0.2976665,0.0019335764,0.48459825,0.009782978,0.20430441],"study_design_scores_gemma":[0.0000355467,0.000048389775,0.00010862517,0.0000443342,0.000025500563,0.00005020246,0.000038726474,0.68918025,0.0005653667,0.3069585,0.0029207116,0.000023788893],"about_ca_topic_score_codex":0.0032564155,"about_ca_topic_score_gemma":0.0029186723,"teacher_disagreement_score":0.011307216,"about_ca_system_score_codex":0.0016394329,"about_ca_system_score_gemma":0.0015583935,"threshold_uncertainty_score":0.03782636},"labels":[],"label_agreement":null},{"id":"W1515852838","doi":"10.1007/978-3-642-15470-6_44","title":"Visual Image Browsing and Exploration (Vibe): User Evaluations of Image Search Tasks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Image (mathematics); Computer graphics (images); Computer vision; Information retrieval; Artificial intelligence; Human–computer interaction","score_opus":0.033113197919949315,"score_gpt":0.32599776567237904,"score_spread":0.2928845677524297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515852838","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.9685116,0.005689552,0.01393953,0.0001509255,0.00018265504,0.00044097033,0.00485894,0.0023560203,0.003869836],"genre_scores_gemma":[0.94563854,0.0011468044,0.031431668,0.00015909062,0.0000816218,0.00066505675,0.014577197,0.0005296768,0.005770423],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984397,0.00080101227,0.00012791884,0.00017276283,0.0003564583,0.000102056234],"domain_scores_gemma":[0.9918584,0.0065838364,0.0002764052,0.0004375789,0.0004328414,0.00041077816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022357288,0.0012150337,0.0009357945,0.0016137763,0.00035645918,0.001144506,0.0007400023,0.0013097984,0.00395463],"category_scores_gemma":[0.013615096,0.00028734596,0.0007109488,0.0009275502,0.00028015595,0.0016085507,0.0014473846,0.0005700619,0.0013225809],"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.027369272,0.005447448,0.06308817,0.0048960526,0.0018407411,0.0006477231,0.0035785066,0.014657771,0.054796737,0.0011781259,0.06078604,0.76171345],"study_design_scores_gemma":[0.0033692995,0.019442584,0.40931818,0.0008093327,0.0016573559,0.005387029,0.0051477174,0.44133514,0.0693677,0.006544136,0.036956638,0.00066489883],"about_ca_topic_score_codex":0.0034989086,"about_ca_topic_score_gemma":0.0068862364,"teacher_disagreement_score":0.00395463,"about_ca_system_score_codex":0.00030839274,"about_ca_system_score_gemma":0.0003278952,"threshold_uncertainty_score":0.013229489},"labels":[],"label_agreement":null},{"id":"W1515861206","doi":"10.1007/978-3-642-15702-8_16","title":"A Complete Visual Hull Representation Using Bounding Edges","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Hull; Visual hull; Bounding overwatch; Computer science; Representation (politics); Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence; Minimum bounding box; Computer vision; Image (mathematics); Iterative reconstruction","score_opus":0.04624486198316703,"score_gpt":0.3371638518815994,"score_spread":0.2909189898984324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515861206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029661069,0.00013826604,0.99251294,0.000047780864,0.000037171696,0.00003636599,0.00033989848,0.00094033004,0.002981225],"genre_scores_gemma":[0.10678945,0.00084622944,0.87453884,0.00010298689,0.00007161983,0.00012756149,0.002481273,0.00074210163,0.014299951],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996026,0.00003111199,0.000020422996,0.00008589051,0.00021939167,0.00004059952],"domain_scores_gemma":[0.9997793,0.00003006706,0.000019286348,0.00007996577,0.00007262395,0.00001880641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023504975,0.0010941244,0.0012659928,0.0013382037,0.00036460953,0.0023709182,0.0017068295,0.001118297,0.009623094],"category_scores_gemma":[0.000718321,0.00075690006,0.0010566098,0.0017282498,0.0004646254,0.0023879134,0.002009099,0.0016295912,0.0042150696],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016765347,0.000087552704,0.0001664224,0.00034544236,0.000048381182,0.00022944772,0.00013678388,0.09761298,0.035634458,0.05813522,0.021181216,0.7862544],"study_design_scores_gemma":[0.000028833301,0.000091695154,0.0003045986,0.00008850927,0.00003694337,0.00046140104,0.000097020966,0.90511155,0.014081461,0.047731116,0.031919036,0.0000479165],"about_ca_topic_score_codex":0.0022336843,"about_ca_topic_score_gemma":0.002174098,"teacher_disagreement_score":0.009623094,"about_ca_system_score_codex":0.00028119743,"about_ca_system_score_gemma":0.0004837847,"threshold_uncertainty_score":0.03219241},"labels":[],"label_agreement":null},{"id":"W151594930","doi":"10.1007/978-3-642-30217-6_19","title":"Foundation of Mining Class-Imbalanced Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Western University","funders":"","keywords":"Computer science; Class (philosophy); Bounded function; Upper and lower bounds; Machine learning; Artificial intelligence; Data mining; Order (exchange); Word error rate; Sample complexity; Empirical research; Sample (material); Statistics; Mathematics","score_opus":0.05203166455733296,"score_gpt":0.2970614443172095,"score_spread":0.24502977975987653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151594930","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.005371102,0.0047121313,0.9766833,0.0025620807,0.00045079656,0.00012360475,0.0011230218,0.00064115966,0.008332856],"genre_scores_gemma":[0.15255466,0.010971413,0.8175142,0.0015342144,0.0033107,0.000793125,0.00430515,0.00029736926,0.008719135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963483,0.0005418712,0.0003226915,0.0008939464,0.0017330884,0.00016016353],"domain_scores_gemma":[0.99208283,0.004512891,0.00042989966,0.0014905791,0.001310388,0.00017337874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043858667,0.00093146873,0.0015833381,0.0037139459,0.0011101391,0.0043184855,0.0032918137,0.0012596305,0.0036164618],"category_scores_gemma":[0.020496953,0.0010102137,0.0015543906,0.0050883465,0.002237261,0.007887707,0.0031370479,0.003906851,0.0024670416],"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.00010445095,0.00017161536,0.0040634274,0.00087294634,0.00015851436,0.00029146078,0.00045895018,0.023055606,0.0024012835,0.512728,0.029826717,0.42586696],"study_design_scores_gemma":[0.000017426277,0.00003820534,0.0014040973,0.00023807827,0.00004461948,0.00039901756,0.00006253422,0.20227861,0.0021577694,0.7654858,0.027837755,0.000036021826],"about_ca_topic_score_codex":0.0018103144,"about_ca_topic_score_gemma":0.0011987973,"teacher_disagreement_score":0.0043858667,"about_ca_system_score_codex":0.001444544,"about_ca_system_score_gemma":0.0018547465,"threshold_uncertainty_score":0.023194969},"labels":[],"label_agreement":null},{"id":"W1515993207","doi":"10.1007/3-540-45108-0_12","title":"Multi-agent Negotiation to Support an Economy for Online Help and Tutoring","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Saskatchewan","funders":"","keywords":"Computer science; Negotiation; Human–computer interaction; Artificial intelligence","score_opus":0.041626150315276396,"score_gpt":0.2851570921342114,"score_spread":0.24353094181893503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515993207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108642176,0.0010897265,0.7555471,0.003445243,0.0005808652,0.00028262712,0.00014043183,0.0017714138,0.12850043],"genre_scores_gemma":[0.83544534,0.00030585058,0.139037,0.00017371785,0.00007821726,0.0003075567,0.00012738447,0.0001468715,0.024378108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999328,0.0003288321,0.000035120876,0.00007575713,0.00016539985,0.0000668835],"domain_scores_gemma":[0.9986223,0.0008412286,0.00005403025,0.00022193357,0.00012255086,0.00013804095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013517683,0.00032586674,0.00044735233,0.00048820744,0.0014127016,0.0025073744,0.0017855315,0.0016878383,0.013807846],"category_scores_gemma":[0.004862745,0.00039497964,0.00046584188,0.00047633308,0.0009551429,0.0042423666,0.0032195724,0.0016469159,0.0016685344],"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.00031435164,0.00040255836,0.00063927786,0.00015253796,0.0000655411,0.00044222147,0.0010709572,0.06293206,0.005005605,0.8381557,0.010058591,0.0807606],"study_design_scores_gemma":[0.00019678523,0.00008372925,0.00043778433,0.00007394572,0.000047630292,0.00024199435,0.00043099467,0.5612735,0.0067561567,0.37503007,0.055390075,0.000037265236],"about_ca_topic_score_codex":0.0008181413,"about_ca_topic_score_gemma":0.0008541482,"teacher_disagreement_score":0.013807846,"about_ca_system_score_codex":0.00082745403,"about_ca_system_score_gemma":0.0008932784,"threshold_uncertainty_score":0.04619181},"labels":[],"label_agreement":null},{"id":"W1516034496","doi":"10.1007/978-3-642-01818-3_6","title":"Enhancing the Bilingual Concordancer TransSearch with Word-Level Alignment","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Machine translation; Word (group theory); Natural language processing; Sentence; Translation (biology); Artificial intelligence; Bilingual dictionary; Linguistics","score_opus":0.021117568354432677,"score_gpt":0.28170173870557486,"score_spread":0.2605841703511422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516034496","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.057162005,0.0013018656,0.89910805,0.00040020188,0.00059793936,0.0002708042,0.0012258895,0.018027583,0.021905635],"genre_scores_gemma":[0.1737221,0.0006726464,0.797176,0.00035032514,0.00024126084,0.0001861443,0.005546333,0.0046294434,0.017475635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627614,0.0012886026,0.0003338566,0.0008928154,0.00095346826,0.00025518896],"domain_scores_gemma":[0.9934696,0.0021723832,0.0002496998,0.001448069,0.00244261,0.00021767267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002876333,0.0014011352,0.00197247,0.0037281767,0.0012612201,0.0033085933,0.0022832963,0.0018314308,0.020156551],"category_scores_gemma":[0.009553388,0.0008443953,0.0009930019,0.0046717036,0.0005267808,0.004477417,0.0037437913,0.0016081142,0.022752842],"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.00070684357,0.00035172963,0.001877213,0.00078931666,0.00016823193,0.0007203951,0.0007102167,0.0048862034,0.10474184,0.013548015,0.025465248,0.84603477],"study_design_scores_gemma":[0.00035470855,0.00071572646,0.003890627,0.00022874575,0.00050764444,0.0042837076,0.00173373,0.51078165,0.31500778,0.05217656,0.11001052,0.00030854286],"about_ca_topic_score_codex":0.00198288,"about_ca_topic_score_gemma":0.004856115,"teacher_disagreement_score":0.020156551,"about_ca_system_score_codex":0.00044929143,"about_ca_system_score_gemma":0.0018159454,"threshold_uncertainty_score":0.06743044},"labels":[],"label_agreement":null},{"id":"W1516042217","doi":"10.1007/3-540-45153-6_1","title":"A Case Study for Learning from Imbalanced Data Sets","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Skew; Machine learning; Artificial intelligence; Rule induction; Quality (philosophy); Focus (optics); Data mining; Set (abstract data type); Variety (cybernetics); Training set","score_opus":0.07340706613005715,"score_gpt":0.31967708466063144,"score_spread":0.2462700185305743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516042217","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.6193374,0.0036043944,0.3350136,0.012511309,0.0005259474,0.0008805055,0.0022446776,0.0012643924,0.024617717],"genre_scores_gemma":[0.7471854,0.0009999083,0.23997395,0.0006091475,0.00023445545,0.00029603706,0.0012290926,0.00016084884,0.009311193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961939,0.0018068101,0.00017294411,0.0004159965,0.0012038911,0.0002064114],"domain_scores_gemma":[0.97667515,0.018658176,0.00052717794,0.0018734828,0.0016266324,0.0006393422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004838528,0.00052511436,0.00060592353,0.0011030539,0.0013613597,0.0021990405,0.0017038991,0.0028932034,0.0021847624],"category_scores_gemma":[0.028591843,0.00025149784,0.00062527513,0.0026927742,0.0010831439,0.0024379778,0.0014849055,0.0016822241,0.00060999265],"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.0020639796,0.004393953,0.058668353,0.0014783967,0.00033224214,0.0118544325,0.0052501936,0.10344369,0.008442413,0.051571142,0.065850966,0.6866502],"study_design_scores_gemma":[0.0006395907,0.0018227797,0.021378176,0.00027637594,0.0001760331,0.012623005,0.006812334,0.74599636,0.021322798,0.11371226,0.07510703,0.00013333184],"about_ca_topic_score_codex":0.0035585032,"about_ca_topic_score_gemma":0.005760454,"teacher_disagreement_score":0.004838528,"about_ca_system_score_codex":0.0009089373,"about_ca_system_score_gemma":0.0006807788,"threshold_uncertainty_score":0.02558887},"labels":[],"label_agreement":null},{"id":"W1516069110","doi":"10.1007/978-3-642-16638-9_26","title":"Player Agency and the Relevance of Decisions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gambling Behavior and Treatments","field":"Psychology","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 Alberta","funders":"","keywords":"Relevance (law); Storytelling; Agency (philosophy); Entertainment; Interactive storytelling; Feeling; Domain (mathematical analysis); Computer science; Key (lock); Human–computer interaction; Psychology; Social psychology; Narrative; Sociology; Political science; Computer security; Art","score_opus":0.06158242615849566,"score_gpt":0.35149643032208533,"score_spread":0.2899140041635897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516069110","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.073825665,0.0072201826,0.07317762,0.009575423,0.0004182339,0.00006740114,0.00021826892,0.00007563168,0.83542156],"genre_scores_gemma":[0.93325007,0.003302714,0.008400772,0.00036380492,0.00023067603,0.00006576836,0.000113689144,0.00005275472,0.054219805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841225,0.0009152923,0.000060463037,0.0002020517,0.00026557982,0.00014443262],"domain_scores_gemma":[0.99526215,0.003669553,0.00024881682,0.00037622295,0.00028266734,0.00016069846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018311668,0.00038720344,0.00041313592,0.00070945773,0.0007845523,0.003831701,0.00067798916,0.00183213,0.016049918],"category_scores_gemma":[0.013641133,0.00037644638,0.0004890591,0.0008457107,0.0029772965,0.0042133424,0.0009945366,0.0027038944,0.0011309615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007720795,0.000033209355,0.0008358204,0.000055077828,0.000016893748,0.00010858916,0.00046504906,0.0012635577,0.00030160436,0.96874756,0.002137743,0.025957681],"study_design_scores_gemma":[0.00001372665,0.000024085139,0.001311326,0.00003936858,0.000016541417,0.00011837373,0.0002414301,0.0027947512,0.00018565613,0.98533756,0.009909019,0.000008189868],"about_ca_topic_score_codex":0.0009258708,"about_ca_topic_score_gemma":0.0012996583,"teacher_disagreement_score":0.016049918,"about_ca_system_score_codex":0.0011157517,"about_ca_system_score_gemma":0.0009642131,"threshold_uncertainty_score":0.05369234},"labels":[],"label_agreement":null},{"id":"W1516165084","doi":"10.1007/11523468_15","title":"Worst Case Optimal Union-Intersection Expression Evaluation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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 Waterloo","funders":"","keywords":"Intersection (aeronautics); Expression (computer science); Computer science; Upper and lower bounds; Set (abstract data type); Algorithm; Mathematical optimization; Discrete mathematics; Mathematics","score_opus":0.01933709617362351,"score_gpt":0.24935654607429186,"score_spread":0.23001944990066836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516165084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05097846,0.0019341363,0.8616037,0.0011421759,0.00039923438,0.00020980989,0.00078614394,0.007069725,0.07587659],"genre_scores_gemma":[0.44328895,0.0006714297,0.5078623,0.00041042187,0.00018945978,0.00017754217,0.0019451916,0.002289976,0.04316468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953393,0.0009224095,0.00021555927,0.0005085379,0.0020490866,0.00096512475],"domain_scores_gemma":[0.99684614,0.0013718696,0.00010203404,0.000823068,0.00077013724,0.00008668382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024012122,0.001291927,0.0018826876,0.0012147808,0.0015232132,0.0041768835,0.0032005464,0.0015544825,0.027235383],"category_scores_gemma":[0.007386532,0.0008104078,0.0013067332,0.0028219041,0.0016214078,0.0065516736,0.0030395498,0.001774898,0.005013606],"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.0022719314,0.00040022618,0.0013988303,0.00060853723,0.0001242864,0.00028747346,0.00027815785,0.10104712,0.01678445,0.17440127,0.04827827,0.6541195],"study_design_scores_gemma":[0.00013784671,0.00020786085,0.00065766816,0.00011364196,0.0001476478,0.00046866632,0.00026451756,0.6791972,0.039494656,0.2606055,0.01863409,0.00007083253],"about_ca_topic_score_codex":0.00264,"about_ca_topic_score_gemma":0.0054904567,"teacher_disagreement_score":0.027235383,"about_ca_system_score_codex":0.0023796717,"about_ca_system_score_gemma":0.0026947036,"threshold_uncertainty_score":0.09111148},"labels":[],"label_agreement":null},{"id":"W1516167732","doi":"10.1007/11674399_4","title":"*-Minimax Performance in Backgammon","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Minimax; Computer science; Pruning; Domain (mathematical analysis); Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.0234602086844417,"score_gpt":0.25600934127624064,"score_spread":0.23254913259179893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516167732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13644122,0.0018104651,0.54019,0.005676043,0.0014843532,0.00021983666,0.00035569974,0.0029989178,0.31082353],"genre_scores_gemma":[0.8437137,0.00039092434,0.045467082,0.00060336344,0.00026172708,0.00024331376,0.00020946152,0.00075598806,0.1083545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842465,0.00070839317,0.00006517226,0.00024124078,0.00026965974,0.00029082573],"domain_scores_gemma":[0.99750024,0.0015507493,0.000096684154,0.00041265658,0.00021527495,0.00022444093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024892823,0.0011605595,0.0015998762,0.0005490248,0.0016226108,0.0030330284,0.0015523171,0.0020493348,0.036327295],"category_scores_gemma":[0.009882286,0.0005159235,0.00066625356,0.0006376016,0.0018897842,0.0041244267,0.003452009,0.0026444572,0.0042036627],"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.0010448013,0.00018490346,0.0004564732,0.00022582132,0.00006158563,0.000097096294,0.00035598341,0.075109996,0.0017600784,0.79894084,0.028546205,0.093216315],"study_design_scores_gemma":[0.00011130889,0.00020862665,0.00037175464,0.00006528882,0.000023705607,0.000076311655,0.000100763864,0.3695747,0.0018714402,0.620825,0.006743883,0.000027179442],"about_ca_topic_score_codex":0.0011955058,"about_ca_topic_score_gemma":0.0012746826,"teacher_disagreement_score":0.036327295,"about_ca_system_score_codex":0.0013680643,"about_ca_system_score_gemma":0.0015515841,"threshold_uncertainty_score":0.12152696},"labels":[],"label_agreement":null},{"id":"W1516470032","doi":"10.1007/3-540-47922-8_33","title":"User Models: Customizing E-Commerce Websites to the Context of Use","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Concordia University","funders":"","keywords":"Computer science; Personalization; Context (archaeology); Domain (mathematical analysis); User modeling; Focus (optics); Set (abstract data type); World Wide Web; Order (exchange); E-commerce; The Internet; Computer user satisfaction; Human–computer interaction; User experience design; User interface; User interface design","score_opus":0.043164279556241456,"score_gpt":0.23836557691729307,"score_spread":0.19520129736105163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516470032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3126206,0.00056190847,0.6131704,0.0024032588,0.00014422418,0.00039595042,0.0009985075,0.015605352,0.054099772],"genre_scores_gemma":[0.80251515,0.00039371385,0.18171765,0.00032240132,0.00003278182,0.00024478207,0.0011542976,0.0017474653,0.011871691],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991423,0.0004206698,0.000042623677,0.00011926958,0.00022202797,0.00005305058],"domain_scores_gemma":[0.9976144,0.0014036109,0.0001165114,0.0005417273,0.00020668228,0.00011705479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352146,0.0006854616,0.00033463413,0.00068697723,0.00037792174,0.0027180498,0.0011596605,0.001132102,0.003426815],"category_scores_gemma":[0.008473681,0.00054171233,0.0007288355,0.000670889,0.00053333206,0.0045908513,0.0014913462,0.00095356815,0.001358273],"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.0011166199,0.001534502,0.033967312,0.00038594764,0.0002493891,0.00065351813,0.010290637,0.056954313,0.019829722,0.10590299,0.052437227,0.7166779],"study_design_scores_gemma":[0.00009301865,0.00026764997,0.015622207,0.00015284,0.00026659074,0.0007761841,0.002043454,0.8012794,0.016980654,0.10754502,0.054811187,0.00016173233],"about_ca_topic_score_codex":0.0034926329,"about_ca_topic_score_gemma":0.006513662,"teacher_disagreement_score":0.0034926329,"about_ca_system_score_codex":0.0007380132,"about_ca_system_score_gemma":0.00046501574,"threshold_uncertainty_score":0.011463881},"labels":[],"label_agreement":null},{"id":"W1516498690","doi":"10.1007/3-540-44938-8_17","title":"Finding Natural Clusters Using Multi-clusterer Combiner Based on Shared Nearest Neighbors","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":91,"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":"Cluster analysis; Graph; Computer science; k-nearest neighbors algorithm; Set (abstract data type); Pattern recognition (psychology); Data mining; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.04392408286800724,"score_gpt":0.3073721529406045,"score_spread":0.26344807007259724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516498690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05451648,0.00022882676,0.94067913,0.00007684666,0.000053383912,0.00016030125,0.00014838159,0.0019161789,0.002220484],"genre_scores_gemma":[0.18879572,0.00009087661,0.8065794,0.000055436707,0.000039927578,0.00016842457,0.00050789845,0.0002989019,0.0034634164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983191,0.00017346535,0.000085958505,0.0005132315,0.00072397996,0.0001843311],"domain_scores_gemma":[0.9980077,0.00047055443,0.00016575004,0.00044431438,0.00077041495,0.00014127414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012212592,0.0010462252,0.0025347208,0.0037449952,0.002130649,0.002081462,0.0031912464,0.0016832872,0.0040645283],"category_scores_gemma":[0.002756516,0.0007760948,0.0017184052,0.004458682,0.00097246334,0.0033036312,0.0032627783,0.0008765737,0.0015357214],"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.0012502684,0.00045883682,0.007624807,0.00036327488,0.00045692027,0.0005066408,0.00096353004,0.045784436,0.09395356,0.010713917,0.0051931944,0.83273065],"study_design_scores_gemma":[0.0001140703,0.0003269617,0.004646148,0.000022596747,0.00026014488,0.0005894152,0.00075072463,0.9307965,0.042057116,0.016266478,0.004057369,0.000112431684],"about_ca_topic_score_codex":0.003024099,"about_ca_topic_score_gemma":0.0072874143,"teacher_disagreement_score":0.0040645283,"about_ca_system_score_codex":0.0008891238,"about_ca_system_score_gemma":0.00082935137,"threshold_uncertainty_score":0.01359719},"labels":[],"label_agreement":null},{"id":"W1516611432","doi":"10.1007/978-3-540-24588-9_2","title":"A 3D Projection Scheme for Incompressible Multiphase Flows Using Dynamic Front Refinement and Reconnection","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fluid Dynamics and Heat Transfer","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 Alberta","funders":"","keywords":"Discretization; Computer science; Grid; Projection (relational algebra); Compressibility; Eulerian path; Incompressible flow; Projection method; Regular grid; Finite element method; Applied mathematics; Geometry; Computational science; Algorithm; Mechanics; Mathematical analysis; Mathematics; Physics; Dykstra's projection algorithm; Lagrangian","score_opus":0.01660463108230361,"score_gpt":0.24368119639563876,"score_spread":0.22707656531333514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516611432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014775969,0.00015586097,0.98085105,0.00006541993,0.00011774724,0.00009342695,0.00010350685,0.00074509444,0.003091889],"genre_scores_gemma":[0.10527533,0.000197094,0.89007103,0.000060442584,0.00003394987,0.00019787654,0.0002681235,0.00040383002,0.0034923602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997894,0.00004425479,0.000012468966,0.00002186757,0.00011554129,0.000016479029],"domain_scores_gemma":[0.99973434,0.00008489247,0.000015896609,0.00006593286,0.00007532239,0.000023625102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038841533,0.000736278,0.0009101484,0.00044258832,0.00053065113,0.0008840865,0.0016736167,0.0011128857,0.004368946],"category_scores_gemma":[0.00090024935,0.00065960514,0.00076647906,0.0005464473,0.0005271736,0.00080863124,0.0017912085,0.002013495,0.000924128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035409228,0.0003696132,0.00071942667,0.00034986134,0.00008394166,0.00030774807,0.0004395851,0.43591332,0.06477416,0.08849584,0.0072983843,0.40089396],"study_design_scores_gemma":[0.000031884025,0.00003820114,0.0000913392,0.000009869487,0.0000061155642,0.00005475235,0.00001006812,0.9880382,0.0040681157,0.004858315,0.0027796153,0.000013616529],"about_ca_topic_score_codex":0.002183961,"about_ca_topic_score_gemma":0.0029948088,"teacher_disagreement_score":0.004368946,"about_ca_system_score_codex":0.00031002297,"about_ca_system_score_gemma":0.0006582528,"threshold_uncertainty_score":0.014615536},"labels":[],"label_agreement":null},{"id":"W1516727468","doi":"10.1007/978-3-642-13464-7_11","title":"Theory and Implementation of a Real-Time Extension to the π-Calculus","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Soundness; Principle of compositionality; Computer science; Pi calculus; Extension (predicate logic); Equivalence (formal languages); Process calculus; Operational semantics; Calculus (dental); Bounded function; Conservative extension; Programming language; Semantics (computer science); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.013816762099965197,"score_gpt":0.26912024090269354,"score_spread":0.25530347880272836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516727468","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.013867027,0.0012143393,0.9254067,0.0009817976,0.00047270386,0.00006427605,0.00013179272,0.0010170104,0.0568444],"genre_scores_gemma":[0.53737897,0.002494879,0.4057856,0.0007049395,0.00073916203,0.00045377313,0.00040264134,0.0005905615,0.051449455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985347,0.00037402878,0.00015028598,0.0003206801,0.0004168587,0.00020341293],"domain_scores_gemma":[0.9983506,0.00076828484,0.000097269716,0.00043943804,0.00023980447,0.000104628016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023292922,0.00070714456,0.0007421598,0.00079533306,0.0013163302,0.005477957,0.0025412925,0.0016544319,0.008598638],"category_scores_gemma":[0.003411874,0.0009978676,0.0016904813,0.00088782527,0.0046265987,0.008788188,0.0024250317,0.004376619,0.001783706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013545718,0.000009385708,0.000025213889,0.000020162051,0.0000037111975,0.00003423413,0.00010782098,0.0007008843,0.00049738213,0.99396646,0.00037587635,0.004245398],"study_design_scores_gemma":[0.00002973702,0.000017959552,0.000041838288,0.000030250252,0.000018380088,0.000091785354,0.000043195785,0.008095063,0.0013556622,0.9737516,0.016508944,0.000015526995],"about_ca_topic_score_codex":0.0012815289,"about_ca_topic_score_gemma":0.0008850983,"teacher_disagreement_score":0.008598638,"about_ca_system_score_codex":0.0015692441,"about_ca_system_score_gemma":0.0015252343,"threshold_uncertainty_score":0.028765261},"labels":[],"label_agreement":null},{"id":"W1516838788","doi":"10.1007/978-3-642-10684-2_72","title":"A Markov Model for Multiagent Patrolling in Continuous Time","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":"Université Laval","funders":"","keywords":"Patrolling; Computer science; Asynchronous communication; Multi-agent system; Markov chain; Artificial intelligence; Markov decision process; Distributed computing; Markov process; Machine learning; Computer network; Mathematics","score_opus":0.020520106502168504,"score_gpt":0.2563511251970211,"score_spread":0.23583101869485257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516838788","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.023860354,0.00077390217,0.96267736,0.0011753656,0.00015432028,0.000078234356,0.0005716217,0.00035544948,0.010353324],"genre_scores_gemma":[0.86429197,0.0019394781,0.08546369,0.00041770888,0.00035863553,0.0006609856,0.0009395771,0.0002569847,0.0456709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983424,0.0005229223,0.000086454456,0.00042572542,0.00031745652,0.00030519482],"domain_scores_gemma":[0.99459064,0.0037004761,0.0006999169,0.00027440893,0.000377922,0.0003567793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021132948,0.0015960641,0.0028764424,0.0012221017,0.0012117518,0.002918843,0.00489419,0.0040474297,0.013000076],"category_scores_gemma":[0.007280256,0.0016628664,0.00183245,0.0018293103,0.0027745797,0.0040442767,0.0023543807,0.0035573656,0.0019754197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007768981,0.000056447665,0.0005008663,0.000087575296,0.00004581973,0.00013594839,0.00012754617,0.7908836,0.00045820582,0.20068447,0.0015396293,0.0054021566],"study_design_scores_gemma":[0.00001923314,0.000021088308,0.00009546175,0.0000098722385,0.000011899281,0.0000228885,0.000013388728,0.95309407,0.00004425329,0.04615303,0.00049993827,0.000014728879],"about_ca_topic_score_codex":0.019453704,"about_ca_topic_score_gemma":0.01372423,"teacher_disagreement_score":0.019453704,"about_ca_system_score_codex":0.0026650045,"about_ca_system_score_gemma":0.0019261508,"threshold_uncertainty_score":0.043489575},"labels":[],"label_agreement":null},{"id":"W1516841136","doi":"10.1007/978-3-642-19348-4_4","title":"FAANST: Fast Anonymizing Algorithm for Numerical Streaming DaTa","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Data stream mining; Anonymity; k-anonymity; Information loss; Data stream; Context (archaeology); Streaming data; Data mining; Confidentiality; Categorical variable; Algorithm; Computer security; Machine learning; Telecommunications; Artificial intelligence","score_opus":0.05595976505588636,"score_gpt":0.28352148053480514,"score_spread":0.2275617154789188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516841136","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.009011263,0.00027565425,0.9742352,0.00036446328,0.0003618397,0.00023085214,0.0011234705,0.012347166,0.002050113],"genre_scores_gemma":[0.11420888,0.00032137946,0.871383,0.00025294934,0.00020311408,0.00042469852,0.004073375,0.0007741216,0.008358536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987943,0.0002341261,0.00010851541,0.00023504603,0.00051417074,0.00011393127],"domain_scores_gemma":[0.9982303,0.00040492485,0.000082691804,0.000983254,0.00023823086,0.000060581755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014084022,0.0010058063,0.0010268907,0.0015973906,0.0012995785,0.0015254086,0.0012666887,0.000977633,0.006974451],"category_scores_gemma":[0.0060027107,0.00047161267,0.0011089742,0.0016839075,0.00079328066,0.0027962667,0.00259773,0.0018589018,0.0030861646],"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.0010562282,0.00018159715,0.0014287373,0.00025494088,0.00018551697,0.00024011664,0.00032940353,0.06458956,0.020693459,0.05405689,0.07031779,0.78666574],"study_design_scores_gemma":[0.00014517817,0.0001425865,0.00065925164,0.00004712378,0.000047687037,0.00044483744,0.000109248256,0.80771714,0.03314756,0.11620662,0.041277517,0.0000552914],"about_ca_topic_score_codex":0.002233491,"about_ca_topic_score_gemma":0.002912512,"teacher_disagreement_score":0.006974451,"about_ca_system_score_codex":0.0010159914,"about_ca_system_score_gemma":0.0019517406,"threshold_uncertainty_score":0.02333188},"labels":[],"label_agreement":null},{"id":"W1516924677","doi":"10.1007/978-3-540-68164-9_13","title":"An Adaptation of the NICE Cryptosystem to Real Quadratic Orders","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Nice; Cryptosystem; Computer science; Quadratic equation; Factorization; Quadratic residue; Adaptation (eye); Theoretical computer science; Arithmetic; Algorithm; Cryptography; Mathematics; Physics","score_opus":0.018174923402855103,"score_gpt":0.23764810164879216,"score_spread":0.21947317824593707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516924677","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.038461287,0.0016721601,0.82280797,0.002640812,0.0019800765,0.00028339546,0.00025006963,0.0026371,0.12926716],"genre_scores_gemma":[0.54010093,0.002992814,0.36572188,0.0010565895,0.0017236702,0.00022994642,0.00034173517,0.0012698218,0.08656265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.0002680274,0.00004790651,0.0001248723,0.0004050464,0.0001041633],"domain_scores_gemma":[0.99889684,0.0002468928,0.000052441137,0.00058029086,0.00014906372,0.00007446171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083258626,0.00050728756,0.0006576185,0.00072378037,0.0007311054,0.0015061802,0.0010036721,0.00069952145,0.0057919817],"category_scores_gemma":[0.0034045354,0.00040225143,0.0007813586,0.0010108482,0.0021672195,0.004116936,0.0025657082,0.00305243,0.0026350154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011887801,0.000045645997,0.00012570756,0.00009395258,0.000012860822,0.00010917039,0.00014164718,0.004540374,0.007248608,0.8952255,0.00842343,0.08391408],"study_design_scores_gemma":[0.00007409293,0.00014477682,0.00034197714,0.000046954123,0.000025338353,0.00072159094,0.000042813906,0.054801904,0.007423036,0.85029274,0.08600855,0.000076331824],"about_ca_topic_score_codex":0.00046360234,"about_ca_topic_score_gemma":0.0005156516,"teacher_disagreement_score":0.0057919817,"about_ca_system_score_codex":0.00074801804,"about_ca_system_score_gemma":0.0007120439,"threshold_uncertainty_score":0.019376159},"labels":[],"label_agreement":null},{"id":"W1517030842","doi":"10.1007/11564386_30","title":"Linear Programming for Matching in Human Body Gesture Recognition","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Computer science; Matching (statistics); Gesture recognition; Gesture; Artificial intelligence; Computer vision; Pattern recognition (psychology); Scheme (mathematics); Linear programming; Template matching; Similarity (geometry); Optimal matching; Object (grammar); Chain code; Cognitive neuroscience of visual object recognition; Algorithm; Image (mathematics); Mathematics","score_opus":0.028541372748078154,"score_gpt":0.31022553768445155,"score_spread":0.2816841649363734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517030842","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.0019289012,0.00037728305,0.9960821,0.00012990613,0.000025469957,0.000024993336,0.000054414213,0.0003368582,0.0010400359],"genre_scores_gemma":[0.20212202,0.0013474561,0.75896376,0.0004309107,0.0002697396,0.000763376,0.0007588895,0.0007360321,0.03460782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986349,0.000530405,0.000067845685,0.00031477917,0.00030562183,0.00014649094],"domain_scores_gemma":[0.9979272,0.0016250934,0.0000788808,0.00010945993,0.00021729835,0.000042075782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013301438,0.00080947694,0.0019065266,0.00080432574,0.00047972164,0.0014384744,0.002279593,0.0015693516,0.009628176],"category_scores_gemma":[0.0052422844,0.0010327607,0.0009252054,0.0019734502,0.0010276752,0.0023026261,0.0017932763,0.0023315062,0.002750031],"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.00023238253,0.00020355024,0.0002945132,0.00039427608,0.00007215673,0.000060261733,0.00010157939,0.45194918,0.0044604386,0.048365165,0.011507712,0.48235884],"study_design_scores_gemma":[0.00000871112,0.00003238565,0.00007122442,0.000011140258,0.0000065812637,0.000015306072,0.000015928947,0.9766192,0.000867603,0.02139439,0.0009496177,0.000007927866],"about_ca_topic_score_codex":0.0071163126,"about_ca_topic_score_gemma":0.0052510942,"teacher_disagreement_score":0.009628176,"about_ca_system_score_codex":0.0011226604,"about_ca_system_score_gemma":0.0010385548,"threshold_uncertainty_score":0.032209456},"labels":[],"label_agreement":null},{"id":"W1517042457","doi":"10.1007/978-3-540-68891-4_13","title":"A Polynomial Time Approximation Scheme for the Square Packing Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","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":"Western University","funders":"","keywords":"Mathematics; Square (algebra); Bin packing problem; Polynomial-time approximation scheme; Combinatorics; Approximation algorithm; Packing problems; Bin; Mathematical optimization; Time complexity; Scheme (mathematics); Discrete mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.0155292284007949,"score_gpt":0.2150886482293441,"score_spread":0.1995594198285492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517042457","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.022820257,0.0009797757,0.94717425,0.000670338,0.00034171232,0.00029550918,0.0006798656,0.0036590544,0.023379197],"genre_scores_gemma":[0.1455252,0.0009567265,0.8317383,0.0003406838,0.00026670197,0.00042503394,0.0018849062,0.0006299046,0.018232604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984744,0.00020521502,0.00008287127,0.00030116882,0.0006526199,0.00028368898],"domain_scores_gemma":[0.99827516,0.00070077775,0.00008678425,0.0006617872,0.00017294666,0.00010259756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095945527,0.001575047,0.0019471461,0.0011116422,0.0012956385,0.0029768534,0.003713461,0.0016372871,0.014834708],"category_scores_gemma":[0.0044364645,0.0009325058,0.0017800615,0.0043575694,0.0011274762,0.005713005,0.0035205332,0.0038850487,0.004802673],"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.001232567,0.00051493524,0.0004389385,0.00055481703,0.00008310942,0.00015411782,0.0003284929,0.13112453,0.016267031,0.17675593,0.05140289,0.6211427],"study_design_scores_gemma":[0.00041414754,0.00020242677,0.00032942573,0.00005993598,0.00008341715,0.00029280878,0.000112617185,0.73896754,0.0065985853,0.22740091,0.02548641,0.00005173338],"about_ca_topic_score_codex":0.004422678,"about_ca_topic_score_gemma":0.0047914614,"teacher_disagreement_score":0.014834708,"about_ca_system_score_codex":0.0026637956,"about_ca_system_score_gemma":0.0021872167,"threshold_uncertainty_score":0.049627006},"labels":[],"label_agreement":null},{"id":"W1517082020","doi":"10.1007/978-3-540-30473-9_25","title":"Information Capture Devices for Social Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Active listening; Ambient intelligence; Human–computer interaction; Multimedia; World Wide Web; Communication","score_opus":0.01159648926505227,"score_gpt":0.22554792129501208,"score_spread":0.2139514320299598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517082020","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.008966499,0.032383874,0.8315636,0.002135878,0.0015304751,0.0004002555,0.0018410964,0.0073452126,0.11383309],"genre_scores_gemma":[0.14409314,0.03161834,0.55598396,0.0011369003,0.0011420207,0.00076363183,0.0040879454,0.001249798,0.25992423],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966156,0.0000898281,0.000018154698,0.00006500041,0.00013343412,0.00003202755],"domain_scores_gemma":[0.99928635,0.00040512776,0.000021267673,0.00014017348,0.00011111277,0.00003585709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042858458,0.001096047,0.0004403434,0.00095325423,0.0005969284,0.0023230838,0.0012387176,0.001504051,0.029962575],"category_scores_gemma":[0.0013305494,0.00039467984,0.0003570018,0.0012899357,0.00047904742,0.0033345355,0.0013252951,0.0009236539,0.007979958],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017422451,0.000061547595,0.00032319076,0.0010094522,0.000035627232,0.00025604852,0.00075919204,0.001120181,0.024476942,0.07560284,0.10530875,0.790872],"study_design_scores_gemma":[0.000031468273,0.00018147015,0.0011647565,0.00049258256,0.000090369394,0.0010766962,0.00057663256,0.012639401,0.031205876,0.045776006,0.90670353,0.00006119203],"about_ca_topic_score_codex":0.000604833,"about_ca_topic_score_gemma":0.0013408873,"teacher_disagreement_score":0.029962575,"about_ca_system_score_codex":0.00043458163,"about_ca_system_score_gemma":0.00027557375,"threshold_uncertainty_score":0.10023481},"labels":[],"label_agreement":null},{"id":"W1517176311","doi":"10.1007/11944836_14","title":"Zero Error List-Decoding Capacity of the q/(q–1) Channel","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Limits and Structures in Graph Theory","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Context (archaeology); Zero (linguistics); Physics; Omega; Mathematics; Discrete mathematics; Quantum mechanics","score_opus":0.04426056993050859,"score_gpt":0.2666411813092641,"score_spread":0.22238061137875553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517176311","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.48153007,0.0048294207,0.30223054,0.009938625,0.00043477435,0.00010554175,0.003115108,0.0010127883,0.19680312],"genre_scores_gemma":[0.9751218,0.0014485391,0.00841543,0.0003666751,0.00031750006,0.00012605396,0.00046065898,0.00012153848,0.0136218155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983895,0.0005236117,0.00006459045,0.00018554612,0.0004298044,0.00040697723],"domain_scores_gemma":[0.988106,0.009617624,0.00039911302,0.00071523763,0.0009572736,0.0002047024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019959004,0.00075360626,0.0010295818,0.0016573763,0.0011600367,0.004240725,0.0014813303,0.0016464054,0.008427645],"category_scores_gemma":[0.00944177,0.00044885353,0.0004764296,0.0017763553,0.0029961374,0.0037527084,0.0022375677,0.0015882251,0.0013909612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024995528,0.000044390086,0.0003963417,0.00019494885,0.00002434409,0.00016117253,0.0004057743,0.038709417,0.0037781172,0.9362639,0.0057933037,0.013978349],"study_design_scores_gemma":[0.0000415338,0.000028458782,0.00027733532,0.000085653504,0.000025598556,0.00017955792,0.00007932359,0.13161716,0.0037730373,0.8616394,0.0021954854,0.00005760137],"about_ca_topic_score_codex":0.0022528279,"about_ca_topic_score_gemma":0.0013492196,"teacher_disagreement_score":0.008427645,"about_ca_system_score_codex":0.0016802793,"about_ca_system_score_gemma":0.0021436512,"threshold_uncertainty_score":0.028193295},"labels":[],"label_agreement":null},{"id":"W1517262512","doi":"10.1007/978-3-540-85760-0_7","title":"Sampling Precision to Depth 10000 at CLEF 2007","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"Open Text (Canada)","funders":"","keywords":"Clef; Bulgarian; Czech; Computer science; Completeness (order theory); Information retrieval; Test (biology); Natural language processing; Relevance (law); Sample (material); Artificial intelligence; Linguistics; Task (project management); Mathematics; Political science","score_opus":0.040290517578891835,"score_gpt":0.2918387463816383,"score_spread":0.25154822880274647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517262512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05016583,0.017834706,0.6746453,0.014452168,0.00903178,0.00069872604,0.02159167,0.10565937,0.10592044],"genre_scores_gemma":[0.2463272,0.0018710317,0.6324639,0.0042090346,0.0022037532,0.0007204172,0.023421608,0.021744732,0.06703831],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99284345,0.002419022,0.0002521002,0.0013495144,0.0023690022,0.0007669249],"domain_scores_gemma":[0.9927764,0.0032374868,0.00014553546,0.0022007688,0.0013594247,0.00028027827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007620449,0.0019815078,0.0023882906,0.0030081503,0.0016789505,0.0037680229,0.0031654765,0.0033007541,0.0598787],"category_scores_gemma":[0.033956442,0.0016608244,0.0016954044,0.0024812345,0.0013067997,0.0051000165,0.0020881621,0.0038872452,0.022065403],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077779894,0.00014593796,0.0009991147,0.00029025995,0.000112802016,0.00008757342,0.00010206053,0.017961774,0.002382392,0.032664396,0.6069889,0.33748698],"study_design_scores_gemma":[0.0012371805,0.00032447456,0.0029012726,0.00036652392,0.00015084361,0.00034140467,0.00012169676,0.4522798,0.025295917,0.24553569,0.27125666,0.00018849311],"about_ca_topic_score_codex":0.012705565,"about_ca_topic_score_gemma":0.025489353,"teacher_disagreement_score":0.0598787,"about_ca_system_score_codex":0.006160984,"about_ca_system_score_gemma":0.004826599,"threshold_uncertainty_score":0.20031422},"labels":[],"label_agreement":null},{"id":"W1517317534","doi":"10.1007/978-3-642-02454-2_52","title":"Energy Metrics and Sustainability","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Global Energy and Sustainability Research","field":"Energy","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sustainability; Computer science; Energy (signal processing); Metric (unit); Dependency (UML); Environmental economics; Civilization; Environmental resource management; Risk analysis (engineering); Business; Engineering; Ecology; Environmental science; Artificial intelligence; Mathematics; Geography; Operations management; Economics","score_opus":0.012364397197321724,"score_gpt":0.2637230803852319,"score_spread":0.25135868318791016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517317534","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021232672,0.056691654,0.033133667,0.010849191,0.0025358691,0.000028257156,0.00027289704,0.0001957274,0.89416945],"genre_scores_gemma":[0.17766052,0.07541943,0.02660995,0.0036440438,0.0035883782,0.00018179975,0.0006463341,0.00076804013,0.7114815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996207,0.00012509982,0.000017324277,0.000051101895,0.0001594459,0.000026385502],"domain_scores_gemma":[0.9997718,0.00007768198,0.000018766978,0.000042211806,0.00006918759,0.000020385256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050612935,0.0010578829,0.00056865584,0.0020634278,0.00076900347,0.0027614462,0.0005618302,0.0010856848,0.019513102],"category_scores_gemma":[0.0015085082,0.00023621666,0.00024418763,0.0028869237,0.0023981712,0.004486016,0.0014695507,0.0017784736,0.0041203685],"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.0000017358374,0.000005919357,0.00004122472,0.000049249695,0.000002622074,0.000010064058,0.00009995921,0.0003659373,0.000067774345,0.9145591,0.04076783,0.04402867],"study_design_scores_gemma":[7.4750466e-7,0.000003905834,0.000085279426,0.000080874874,0.0000019118806,0.000037014153,0.00008612451,0.000325883,0.00008116586,0.7002597,0.2990344,0.0000031554696],"about_ca_topic_score_codex":0.0015254907,"about_ca_topic_score_gemma":0.0030692972,"teacher_disagreement_score":0.019513102,"about_ca_system_score_codex":0.0021171314,"about_ca_system_score_gemma":0.00071766815,"threshold_uncertainty_score":0.065277815},"labels":[],"label_agreement":null},{"id":"W15173781","doi":"10.1007/978-3-642-32600-4_34","title":"Mining Frequent Itemsets Using Node-Sets of a Prefix-Tree","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Trie; Data mining; Prefix; Node (physics); Set (abstract data type); Tree (set theory); Construct (python library); Database; Tree structure; Data structure; Theoretical computer science; Algorithm; Binary tree; Mathematics","score_opus":0.039212616071202765,"score_gpt":0.27851021173089596,"score_spread":0.2392975956596932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15173781","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.2137965,0.004093731,0.7604329,0.00051634276,0.00024222248,0.0008220301,0.013821027,0.0022695735,0.0040056612],"genre_scores_gemma":[0.20625035,0.0015970393,0.776827,0.00009561606,0.00010954419,0.00040382709,0.013541152,0.00009912447,0.0010764138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827206,0.00022951177,0.00034493514,0.00037875006,0.00067390746,0.000100736004],"domain_scores_gemma":[0.994194,0.003723906,0.00041941553,0.0004819784,0.0009527041,0.00022793747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012145338,0.0008445342,0.001638605,0.007425793,0.0010872874,0.002463634,0.0015173076,0.0013234605,0.0023194663],"category_scores_gemma":[0.009684575,0.0007676431,0.0021237067,0.00966258,0.00058540015,0.004049035,0.0012483858,0.0010445098,0.0014692043],"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.0012353536,0.0006642346,0.05418014,0.0030838079,0.00087326317,0.0036443162,0.0013697331,0.065232456,0.02547621,0.029709443,0.011741182,0.80278987],"study_design_scores_gemma":[0.00016572844,0.0008789176,0.014124375,0.00086323067,0.00075912377,0.006874508,0.0012659553,0.80895877,0.01481698,0.1271425,0.02400641,0.00014344818],"about_ca_topic_score_codex":0.0012434574,"about_ca_topic_score_gemma":0.002048211,"teacher_disagreement_score":0.007425793,"about_ca_system_score_codex":0.00042089086,"about_ca_system_score_gemma":0.0010869933,"threshold_uncertainty_score":0.0077593327},"labels":[],"label_agreement":null},{"id":"W1517477680","doi":"10.1007/978-3-642-14518-6_16","title":"On the Complexity of the Montes Ideal Factorization Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Concordia University","funders":"","keywords":"Ideal (ethics); Factorization; Computer science; Algorithm; Mathematics; Philosophy; Epistemology","score_opus":0.024312501079422538,"score_gpt":0.23374817975395595,"score_spread":0.20943567867453342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517477680","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.12986034,0.0051948735,0.63735306,0.013124803,0.0014437961,0.0004900407,0.002539486,0.004697839,0.20529568],"genre_scores_gemma":[0.6066349,0.0030217622,0.32364357,0.0016862703,0.0019396631,0.000595211,0.0041197287,0.0019232308,0.056435745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937198,0.0014392893,0.00031812736,0.0010382008,0.0024419662,0.0010425585],"domain_scores_gemma":[0.9835195,0.011051432,0.0005926303,0.0029518835,0.0013229973,0.0005615413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004445842,0.0017481145,0.0027695245,0.0018089586,0.0031962285,0.007467051,0.0042812014,0.0025478627,0.03317034],"category_scores_gemma":[0.021412909,0.0011143204,0.0022168811,0.0035070763,0.0037564575,0.018964853,0.0060283598,0.0066090566,0.008556996],"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.0024650963,0.000523415,0.0028596274,0.00058373844,0.0001588375,0.00018859003,0.0005982029,0.07278578,0.0053087124,0.62549067,0.058622897,0.2304145],"study_design_scores_gemma":[0.00021170496,0.00008589803,0.0005618112,0.000073529394,0.00006324048,0.00014785677,0.00015248856,0.20939745,0.0024091688,0.7784153,0.008428732,0.000052855783],"about_ca_topic_score_codex":0.006234856,"about_ca_topic_score_gemma":0.007444633,"teacher_disagreement_score":0.03317034,"about_ca_system_score_codex":0.0049066534,"about_ca_system_score_gemma":0.005947643,"threshold_uncertainty_score":0.11096585},"labels":[],"label_agreement":null},{"id":"W1517512971","doi":"10.1007/978-3-540-30115-8_47","title":"Conditional Independence Trees","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Conditional independence; Decision tree; Computer science; Independence (probability theory); Machine learning; Representation (politics); Joint probability distribution; Conditional probability; Artificial intelligence; Conditional probability distribution; Decision tree learning; Tree (set theory); Probability distribution; Bayes' theorem; Mathematics; Statistics; Bayesian probability","score_opus":0.02251077728960907,"score_gpt":0.2536438348830263,"score_spread":0.2311330575934172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517512971","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.0050704204,0.002257251,0.83403057,0.0010986531,0.00024848926,0.000072597184,0.0018694958,0.0010324391,0.15432],"genre_scores_gemma":[0.26645195,0.0070258104,0.5310441,0.0010973783,0.0011353944,0.00050379557,0.014941306,0.0019950287,0.17580527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987349,0.00037711143,0.000063176565,0.00030342283,0.00043517642,0.000086201806],"domain_scores_gemma":[0.9967938,0.0019008189,0.00012837909,0.00063681876,0.000429799,0.00011039678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012093472,0.00075998594,0.0010677828,0.0020558224,0.0014123303,0.0026644825,0.0012868078,0.0011487752,0.027697578],"category_scores_gemma":[0.0069084656,0.0011747876,0.0012963685,0.0035480002,0.0012644755,0.0042610643,0.0014562142,0.0038436318,0.009109538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021189211,0.000030378034,0.0001888999,0.000061901665,0.000021271515,0.000054476008,0.00014671413,0.0043930765,0.00033039984,0.90339965,0.022001946,0.06935004],"study_design_scores_gemma":[0.000004289228,0.0000037895138,0.00015326288,0.000024288825,0.0000110105175,0.000094545074,0.0000126433315,0.012029604,0.00022810114,0.95633835,0.031091698,0.000008476205],"about_ca_topic_score_codex":0.0012392298,"about_ca_topic_score_gemma":0.0016780962,"teacher_disagreement_score":0.027697578,"about_ca_system_score_codex":0.0008879932,"about_ca_system_score_gemma":0.00094394793,"threshold_uncertainty_score":0.092657685},"labels":[],"label_agreement":null},{"id":"W1517555792","doi":"10.1007/978-3-540-30182-0_48","title":"Query Builder: A Natural Language Interface for Structured Databases","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Calgary","funders":"","keywords":"Computer science; Parsing; Natural language user interface; Interface (matter); Feature (linguistics); Programming language; Natural language; Natural language processing; User interface; Artificial intelligence; Natural (archaeology); Human–computer interaction; Information retrieval; Database; Operating system; Linguistics","score_opus":0.01952414774588913,"score_gpt":0.28376007365932504,"score_spread":0.2642359259134359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517555792","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.0018724626,0.0003730601,0.79478836,0.00038856777,0.00008179797,0.0003679533,0.008408542,0.18990721,0.003812119],"genre_scores_gemma":[0.05131075,0.001479619,0.8179696,0.0022142213,0.00018315033,0.002005312,0.049202386,0.052659683,0.022975335],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782205,0.00043444545,0.00036905208,0.0003420755,0.0009115039,0.00012087435],"domain_scores_gemma":[0.9964818,0.0022550893,0.00015520303,0.0005069835,0.00041604968,0.00018486229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038740365,0.0019432849,0.0020304015,0.003110911,0.00088305096,0.003992149,0.0035588378,0.0020014741,0.03773881],"category_scores_gemma":[0.009819335,0.001814765,0.0015396475,0.0027858287,0.0011652785,0.008041228,0.0048944685,0.0023704693,0.01533636],"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.001375022,0.00027481967,0.0017903676,0.002925616,0.00028159856,0.00091822643,0.0028583987,0.0057215514,0.03755773,0.08682672,0.5253028,0.3341671],"study_design_scores_gemma":[0.0007671124,0.0002125963,0.0014610073,0.0006231874,0.00029363311,0.001597588,0.00062805566,0.11814455,0.05494564,0.102059625,0.7188972,0.00036978116],"about_ca_topic_score_codex":0.004588032,"about_ca_topic_score_gemma":0.005126878,"teacher_disagreement_score":0.03773881,"about_ca_system_score_codex":0.0012113099,"about_ca_system_score_gemma":0.0015541859,"threshold_uncertainty_score":0.12624884},"labels":[],"label_agreement":null},{"id":"W1517593500","doi":"10.1007/978-3-642-05434-1_5","title":"Approximating Barrier Resilience in Wireless Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Resilience (materials science); Wireless sensor network; Wireless; Computer network; Wireless network; Distributed computing; Telecommunications; Physics","score_opus":0.009520062151468504,"score_gpt":0.22138869718984133,"score_spread":0.21186863503837283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517593500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04295274,0.0026528211,0.9396364,0.0011362619,0.00029934684,0.000045072116,0.00011780779,0.0005191503,0.01264036],"genre_scores_gemma":[0.8315337,0.004131344,0.14705886,0.00024389484,0.00041484015,0.0002198457,0.00025494548,0.0003847591,0.015757801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992594,0.00030398226,0.000028139151,0.00008738357,0.00022732679,0.00009385578],"domain_scores_gemma":[0.9957268,0.0031151555,0.00024969238,0.00040442625,0.00033523445,0.00016861808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016673728,0.0010806003,0.0012476244,0.0011009496,0.0005139271,0.0011070648,0.0019552668,0.0011262664,0.0029557508],"category_scores_gemma":[0.010427909,0.00043000237,0.0005378764,0.0012979413,0.001652218,0.002607207,0.0022866607,0.0024984826,0.00042921153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019575362,0.000041374955,0.00035955876,0.00023654947,0.00004503282,0.000093510964,0.00010810851,0.6038761,0.003421453,0.34684417,0.005111786,0.039666563],"study_design_scores_gemma":[0.000010110946,0.000024276447,0.00006952775,0.000019429011,0.000008691827,0.00003510488,0.000020921658,0.8328974,0.0004682434,0.16502877,0.0014099377,0.0000076218657],"about_ca_topic_score_codex":0.0015396902,"about_ca_topic_score_gemma":0.0010550176,"teacher_disagreement_score":0.0029557508,"about_ca_system_score_codex":0.0013998835,"about_ca_system_score_gemma":0.0005932695,"threshold_uncertainty_score":0.0101569295},"labels":[],"label_agreement":null},{"id":"W1517726756","doi":"10.1007/978-3-642-33651-5_6","title":"A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Overlay network; Search engine indexing; Overlay; Data structure; Node (physics); Rendering (computer graphics); Theoretical computer science; Distributed computing; Set (abstract data type); Algorithm; Parallel computing; Database; Information retrieval; The Internet; Operating system; Programming language","score_opus":0.03427233514111038,"score_gpt":0.28185814085391514,"score_spread":0.24758580571280475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517726756","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.0022566519,0.00006200167,0.99450254,0.000052235147,0.000035695273,0.000098327604,0.000037828348,0.0021603275,0.00079445506],"genre_scores_gemma":[0.05566211,0.0001134394,0.9409554,0.000045429817,0.000043020453,0.00032605758,0.00014872187,0.0002828634,0.0024229526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981007,0.00052221667,0.00015773617,0.00026519076,0.0007705665,0.00018355444],"domain_scores_gemma":[0.9968071,0.0008388742,0.00011912469,0.001300299,0.000798947,0.00013573558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017308177,0.0011110663,0.0013987541,0.0011469278,0.0012240182,0.0021212425,0.0022144841,0.0013747711,0.0072846413],"category_scores_gemma":[0.006532274,0.0007995489,0.00075009983,0.0017637064,0.0009076258,0.0030387032,0.0026509608,0.0018961238,0.0032547584],"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.0005104606,0.0002206234,0.00066203345,0.0004250434,0.000116038485,0.00018016685,0.00035869435,0.08501227,0.028415775,0.12359842,0.014704853,0.7457956],"study_design_scores_gemma":[0.0001811303,0.00015043806,0.00024155552,0.00003814408,0.0000776989,0.00025792068,0.00009597883,0.86828166,0.018500172,0.09370425,0.01840619,0.00006481086],"about_ca_topic_score_codex":0.0020261363,"about_ca_topic_score_gemma":0.002710397,"teacher_disagreement_score":0.0072846413,"about_ca_system_score_codex":0.0009748566,"about_ca_system_score_gemma":0.0019494253,"threshold_uncertainty_score":0.024369538},"labels":[],"label_agreement":null},{"id":"W1517841585","doi":"10.1007/978-3-540-87608-3_8","title":"Using Artificial Boundaries in the Game of Go","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Boundary (topology); Local search (optimization); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.07050931872780748,"score_gpt":0.303081793315775,"score_spread":0.23257247458796754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517841585","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.06903094,0.0012867755,0.53227794,0.0041554654,0.00050617126,0.00019153552,0.00013062634,0.000576318,0.39184412],"genre_scores_gemma":[0.837379,0.0005495549,0.12856479,0.00047831432,0.00005024146,0.00027834767,0.0001049199,0.00018762237,0.032407235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.00047005952,0.00003625906,0.0001287985,0.00016916946,0.000111955254],"domain_scores_gemma":[0.9984976,0.0009673538,0.00009141116,0.00015644194,0.0000819703,0.00020515188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100719,0.00072257087,0.00067411596,0.0005401593,0.0015114228,0.0033651362,0.0015058676,0.0018999487,0.012530727],"category_scores_gemma":[0.005633988,0.00035687315,0.0007051838,0.0005095466,0.0052759433,0.0069967723,0.0040006847,0.0023810328,0.0011057004],"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.00008000655,0.00001753416,0.00012835981,0.00006614338,0.00001104706,0.00006199839,0.00071547076,0.006459919,0.0010828036,0.98034704,0.0012265595,0.009803132],"study_design_scores_gemma":[0.00003267622,0.000039814902,0.00009286466,0.0000655449,0.000010549868,0.000060876406,0.00042549497,0.023632418,0.000609853,0.95782375,0.01718674,0.000019326795],"about_ca_topic_score_codex":0.0026291795,"about_ca_topic_score_gemma":0.0029758941,"teacher_disagreement_score":0.012530727,"about_ca_system_score_codex":0.0011416739,"about_ca_system_score_gemma":0.0010039605,"threshold_uncertainty_score":0.04191941},"labels":[],"label_agreement":null},{"id":"W1517853613","doi":"10.1007/978-3-540-74915-8_29","title":"Relativizing Small Complexity Classes and Their Theories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oracle; Stack (abstract data type); Hierarchy; Bounded function; Class (philosophy); Function (biology); Limit (mathematics); Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence; Programming language; Mathematical analysis","score_opus":0.05651785826671054,"score_gpt":0.26455284292850273,"score_spread":0.20803498466179218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517853613","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09450606,0.010399657,0.42039323,0.014759753,0.0014908443,0.00025299413,0.00084688124,0.000982898,0.4563677],"genre_scores_gemma":[0.81429183,0.0061528455,0.09760336,0.0023830156,0.0032686538,0.0007618617,0.0013686673,0.0006458028,0.07352404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821955,0.00051769585,0.00010019141,0.00034147516,0.00059031334,0.00023070752],"domain_scores_gemma":[0.99631196,0.00226137,0.00021050544,0.0006952131,0.0002867363,0.00023424886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001869906,0.0010363183,0.0013263412,0.0043082563,0.0035274907,0.004307203,0.002097097,0.0018964137,0.008574667],"category_scores_gemma":[0.005702908,0.000918439,0.001968863,0.0033169533,0.00839348,0.014724095,0.005304078,0.008903041,0.0011348493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024858077,0.0000030572166,0.000021990769,0.0000111343725,0.0000021149476,0.000004026823,0.00006985501,0.00013124585,0.000028063443,0.9978472,0.00072401017,0.0011548285],"study_design_scores_gemma":[0.0000032035637,0.0000022741206,0.00004080993,0.0000059794997,0.0000039521065,0.000010483366,0.00002146899,0.00037382412,0.000046972615,0.9961683,0.003319476,0.0000033395067],"about_ca_topic_score_codex":0.001614996,"about_ca_topic_score_gemma":0.0011484589,"teacher_disagreement_score":0.008574667,"about_ca_system_score_codex":0.0032841128,"about_ca_system_score_gemma":0.00089043926,"threshold_uncertainty_score":0.028685093},"labels":[],"label_agreement":null},{"id":"W1517867184","doi":"10.1007/978-3-642-13681-8_42","title":"Video Quality Prediction Using a 3D Dual-Tree Complex Wavelet Structural Similarity Index","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Peak signal-to-noise ratio; Computer science; Artificial intelligence; Structural similarity; Wavelet; Pyramid (geometry); Video quality; Similarity (geometry); Image quality; Pattern recognition (psychology); Complex wavelet transform; Coding (social sciences); Wavelet transform; Tree (set theory); Computer vision; Image (mathematics); Discrete wavelet transform; Mathematics","score_opus":0.05741863909908808,"score_gpt":0.3303158888853315,"score_spread":0.2728972497862434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517867184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19487843,0.00039119108,0.8017078,0.00010093233,0.000071865914,0.00008131291,0.0003910747,0.0007261371,0.0016512095],"genre_scores_gemma":[0.72133696,0.0003759479,0.27613464,0.00004517921,0.00007275117,0.000078496705,0.0007579477,0.000087145025,0.0011108919],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996517,0.000038088812,0.000022087737,0.00006844939,0.000184442,0.000035287587],"domain_scores_gemma":[0.9992329,0.00019532967,0.000091912916,0.00006930439,0.00035627396,0.000054202617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004817923,0.00041095316,0.000933509,0.0024533584,0.00028228128,0.00090471614,0.0005897951,0.0006134359,0.001077593],"category_scores_gemma":[0.001716073,0.00022297523,0.00061487354,0.0018563123,0.00022855855,0.0011286959,0.00057770533,0.0005082515,0.00049493904],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010916608,0.0005459439,0.014696293,0.00014616411,0.00014051265,0.00014675745,0.00008503987,0.13640761,0.09352781,0.004658579,0.0038831858,0.7446704],"study_design_scores_gemma":[0.000010642599,0.00006429623,0.0036791137,0.0000047445915,0.000018595252,0.000049866805,0.000010237485,0.9900795,0.0053533725,0.00047366324,0.00024321166,0.000012833372],"about_ca_topic_score_codex":0.0036899662,"about_ca_topic_score_gemma":0.0035466854,"teacher_disagreement_score":0.0036899662,"about_ca_system_score_codex":0.00049549155,"about_ca_system_score_gemma":0.0004392423,"threshold_uncertainty_score":0.007336974},"labels":[],"label_agreement":null},{"id":"W1518018027","doi":"10.1007/11867586_63","title":"Visual Aspect: A Unified Content-Based Collaborative Filtering Model for Visual Document Recommendation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Collaborative filtering; Set (abstract data type); Information retrieval; Unified Model; Content (measure theory); Generative model; Content-based image retrieval; Generative grammar; Artificial intelligence; Image (mathematics); Recommender system; Image retrieval","score_opus":0.0356109201761515,"score_gpt":0.299838290788238,"score_spread":0.26422737061208645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518018027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076730144,0.00046511984,0.9889253,0.00011851155,0.000053382504,0.0001114475,0.00020369834,0.0013948014,0.0010546905],"genre_scores_gemma":[0.30524322,0.00094121986,0.685428,0.00027472235,0.00027472156,0.0003469188,0.0011200551,0.00030055922,0.0060705803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980368,0.0004993372,0.00015823984,0.00035598347,0.0008402896,0.00010929993],"domain_scores_gemma":[0.9974137,0.000904504,0.0001628934,0.0005760139,0.00080591073,0.0001369619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025145377,0.00096158066,0.0021849577,0.002568646,0.00066007115,0.0022092087,0.0026655165,0.0019018168,0.0024129797],"category_scores_gemma":[0.0060355673,0.00059407466,0.0018631173,0.0037303271,0.0005635896,0.0034165015,0.001409006,0.0011465794,0.0013397633],"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.0014162958,0.00081466016,0.0049485043,0.00044818685,0.00070594903,0.00024335958,0.00043226357,0.16275302,0.022828633,0.03586662,0.018105173,0.7514374],"study_design_scores_gemma":[0.00004922132,0.00011974026,0.0006340164,0.000012515882,0.00009364942,0.000112201546,0.000015881496,0.985015,0.002228168,0.008870271,0.0028146144,0.000034758254],"about_ca_topic_score_codex":0.014708726,"about_ca_topic_score_gemma":0.018769454,"teacher_disagreement_score":0.014708726,"about_ca_system_score_codex":0.0008568215,"about_ca_system_score_gemma":0.0010324696,"threshold_uncertainty_score":0.029246211},"labels":[],"label_agreement":null},{"id":"W1518092398","doi":"10.1007/978-3-642-13437-1_46","title":"Using Emotional Coping Strategies in Intelligent Tutoring Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotional Intelligence and Performance","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Coping (psychology); Computer science; Anxiety; Intelligent tutoring system; Cognitive psychology; Human–computer interaction; Artificial intelligence; Psychology; Clinical psychology","score_opus":0.09127022621146984,"score_gpt":0.35846699912880864,"score_spread":0.2671967729173388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518092398","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.4421536,0.028506938,0.35752985,0.002304243,0.0008632329,0.00032085978,0.00009879294,0.0017041985,0.16651833],"genre_scores_gemma":[0.9235423,0.005067099,0.05351997,0.0002889031,0.00016338771,0.00018762887,0.00008211413,0.00006637215,0.017082175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982446,0.00008729001,0.000009425298,0.000019757073,0.000040930074,0.000018244273],"domain_scores_gemma":[0.9997031,0.00022213502,0.00001528303,0.000016560676,0.000026247528,0.000016734202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004088795,0.00037515987,0.00023175713,0.00017237026,0.0001311912,0.0010456165,0.00043161423,0.00045507247,0.0028923606],"category_scores_gemma":[0.0013335745,0.00009642755,0.00021085472,0.00020143758,0.00022521183,0.000618901,0.0004353547,0.000451262,0.00051000627],"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.00019803396,0.00046498323,0.0015595366,0.0003969526,0.00009345064,0.0002369756,0.0014072768,0.00794795,0.02855472,0.011423216,0.0050668344,0.94265014],"study_design_scores_gemma":[0.0007680357,0.004815063,0.06566496,0.0022897695,0.0015318409,0.0043647075,0.007696482,0.2980398,0.14539707,0.21457867,0.25454196,0.00031169027],"about_ca_topic_score_codex":0.000110021676,"about_ca_topic_score_gemma":0.000168927,"teacher_disagreement_score":0.0028923606,"about_ca_system_score_codex":0.00013633164,"about_ca_system_score_gemma":0.000118101394,"threshold_uncertainty_score":0.00967598},"labels":[],"label_agreement":null},{"id":"W1518101212","doi":"10.1007/3-540-45034-3_61","title":"Adaptive Resource Location in a Peer-to-Peer Network","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Flooding (psychology); Computer science; Computer network; Protocol (science); Peer-to-peer; Distributed computing; Resource (disambiguation)","score_opus":0.027549570979091283,"score_gpt":0.2638589108989674,"score_spread":0.23630933991987613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518101212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024742616,0.0013437842,0.96458113,0.0003345034,0.00024701678,0.00011144616,0.000049119273,0.0012138144,0.00737662],"genre_scores_gemma":[0.6160914,0.0019379093,0.36095792,0.00015553468,0.0002857975,0.00019781156,0.00014819173,0.00016408901,0.020061294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993387,0.00015083057,0.000039479,0.00017111811,0.00023698517,0.00006290235],"domain_scores_gemma":[0.998961,0.00057778734,0.00006413397,0.00016038532,0.0001690332,0.000067687375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008686321,0.0005601563,0.0013767784,0.0006832148,0.0011820428,0.001433019,0.0024590222,0.0013079036,0.0023898943],"category_scores_gemma":[0.0026658957,0.00047638488,0.00031370646,0.0012258763,0.0007704734,0.0023680078,0.0014954588,0.0008665551,0.0010057315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006652909,0.00019595554,0.0011760539,0.00044105432,0.00011632102,0.0010125405,0.00055792066,0.51795805,0.043501865,0.103868134,0.011606005,0.3189008],"study_design_scores_gemma":[0.000048702703,0.000116704105,0.00021686133,0.00002213832,0.00004985927,0.00039619324,0.00010437609,0.9448248,0.008032116,0.03610425,0.010040566,0.000043458924],"about_ca_topic_score_codex":0.0015762323,"about_ca_topic_score_gemma":0.0018771528,"teacher_disagreement_score":0.0024590222,"about_ca_system_score_codex":0.00063470803,"about_ca_system_score_gemma":0.0005732501,"threshold_uncertainty_score":0.007995009},"labels":[],"label_agreement":null},{"id":"W1518139685","doi":"10.1007/11901181_23","title":"Conceptualizing the Co-evolution of Organizations and Information Systems: An Agent-Oriented Perspective","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Perspective (graphical); Information system; Knowledge management; Human–computer interaction; Data science; Artificial intelligence; Political science","score_opus":0.012002334362113322,"score_gpt":0.2419638945042781,"score_spread":0.2299615601421648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518139685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036137756,0.031488657,0.6884167,0.02883802,0.0007082668,0.00019520421,0.0001384954,0.00020510812,0.21387176],"genre_scores_gemma":[0.763178,0.013122827,0.20724738,0.0014825881,0.0005564681,0.00044878753,0.0002349411,0.0001109384,0.01361809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976428,0.0014022235,0.00009575752,0.00029620383,0.00036016986,0.00020293436],"domain_scores_gemma":[0.9969861,0.0018440821,0.0003470758,0.00030520774,0.00021755707,0.00029997888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034578699,0.0009627486,0.00091342884,0.002882595,0.0022815762,0.010237889,0.0044625676,0.004469373,0.003092219],"category_scores_gemma":[0.003821106,0.0011483792,0.0010709617,0.0062058256,0.017069053,0.019334247,0.003564248,0.004889791,0.00044987473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014768844,0.0000055058476,0.000065686836,0.000020065783,0.0000042583356,0.00003764258,0.00054590043,0.0008243035,0.000046235684,0.9969163,0.00020779498,0.0013248269],"study_design_scores_gemma":[0.000006258677,0.000009477243,0.0001192094,0.000055960467,0.000010710995,0.00011568626,0.0008371734,0.006304172,0.00009663212,0.974441,0.017996173,0.000007437433],"about_ca_topic_score_codex":0.005288649,"about_ca_topic_score_gemma":0.0036566886,"teacher_disagreement_score":0.010237889,"about_ca_system_score_codex":0.0037739126,"about_ca_system_score_gemma":0.0030043414,"threshold_uncertainty_score":0.027381778},"labels":[],"label_agreement":null},{"id":"W1518158447","doi":"10.1007/3-540-45554-x_7","title":"Approximation of Information Granule Sets","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Granular computing; Computer science; Closeness; Granule (geology); Theoretical computer science; Artificial intelligence; Rough set; Mathematics","score_opus":0.014890032650957796,"score_gpt":0.22805545747229122,"score_spread":0.21316542482133344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518158447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021328975,0.0013788193,0.97156614,0.00014649892,0.00007276068,0.000032726763,0.00010596657,0.00015254066,0.005215584],"genre_scores_gemma":[0.6029836,0.0030593686,0.38490823,0.00007309144,0.00022361908,0.0001599498,0.0006965505,0.00012231656,0.0077733574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920243,0.00023865193,0.000052086398,0.00013104914,0.00031067035,0.00006523261],"domain_scores_gemma":[0.9982559,0.0009955214,0.00013903997,0.00028387934,0.00024592443,0.00007970501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013961031,0.0007680653,0.0014445233,0.0020664511,0.00037904453,0.0030848577,0.0010207132,0.0005959444,0.0019257539],"category_scores_gemma":[0.0057883933,0.00046543064,0.0011233161,0.0023408516,0.0010551402,0.0026602005,0.0014133494,0.0014678632,0.00035219998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017953853,0.000054174314,0.00062849803,0.0002275006,0.00009243183,0.000119562406,0.00025456733,0.15853518,0.0030452134,0.7240868,0.0028868178,0.10988967],"study_design_scores_gemma":[0.000009772144,0.000029056391,0.0002240973,0.00003006555,0.00002899245,0.00004648688,0.000030413978,0.7280033,0.0009810018,0.26816413,0.0024428137,0.000009945628],"about_ca_topic_score_codex":0.0013465246,"about_ca_topic_score_gemma":0.0006356194,"teacher_disagreement_score":0.0030848577,"about_ca_system_score_codex":0.0012876458,"about_ca_system_score_gemma":0.00043166464,"threshold_uncertainty_score":0.009342492},"labels":[],"label_agreement":null},{"id":"W1518202264","doi":"10.1007/978-3-642-30950-2_106","title":"Supporting Students in the Analysis of Case Studies for Professional Ethics Education","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Saskatchewan","funders":"","keywords":"Latent semantic analysis; Computer science; Argument (complex analysis); Interface (matter); Mathematics education; Artificial intelligence; Psychology","score_opus":0.08443423219674671,"score_gpt":0.426486825230885,"score_spread":0.34205259303413826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518202264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1988773,0.0014614441,0.6414393,0.02313281,0.0007297501,0.003254707,0.00028055682,0.0012865411,0.12953757],"genre_scores_gemma":[0.4871217,0.00107264,0.48702404,0.0015046924,0.00013503247,0.0021662675,0.0004664913,0.0003530003,0.020156097],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9727735,0.022410398,0.0009544455,0.00077027635,0.00224373,0.000847569],"domain_scores_gemma":[0.8894142,0.08874922,0.0028819626,0.0073442603,0.0074684084,0.004141913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031457074,0.00082952477,0.00072663085,0.0023956867,0.0032283894,0.009849177,0.003246417,0.0030983945,0.014072371],"category_scores_gemma":[0.1006723,0.00068617077,0.00054762437,0.0017160967,0.003833288,0.009782384,0.009247466,0.005350374,0.0034264924],"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.00030736087,0.0025471367,0.007605989,0.0007080645,0.000040507166,0.0020675743,0.20021106,0.0021974272,0.0068943137,0.17778172,0.038576208,0.5610627],"study_design_scores_gemma":[0.00019318952,0.0007074846,0.004608195,0.0029719945,0.000056915334,0.0042548054,0.17710076,0.023512857,0.015697462,0.4074669,0.36323473,0.00019477966],"about_ca_topic_score_codex":0.00029425774,"about_ca_topic_score_gemma":0.0013096737,"teacher_disagreement_score":0.031457074,"about_ca_system_score_codex":0.0025346472,"about_ca_system_score_gemma":0.0057699652,"threshold_uncertainty_score":0.16636294},"labels":[],"label_agreement":null},{"id":"W1518209053","doi":"10.1007/11527886_25","title":"Reasoning About Interaction in a Multi-user System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ask price; Computer science; User modeling; Human–computer interaction; User requirements document; User interface; Operations research; Software engineering","score_opus":0.13761364070822718,"score_gpt":0.3908647234771933,"score_spread":0.25325108276896613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518209053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061446063,0.00022520781,0.931041,0.00095596135,0.00003750726,0.00016931962,0.0004174514,0.0018229093,0.0038845346],"genre_scores_gemma":[0.6376625,0.00019429001,0.35784456,0.00033261915,0.0000724666,0.00019324003,0.0009606379,0.00023550786,0.0025042237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919173,0.0035097713,0.000685466,0.0010930273,0.002155367,0.0006390074],"domain_scores_gemma":[0.98019373,0.017442048,0.0005160961,0.0010105819,0.0005650903,0.00027240012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047830944,0.0014928139,0.0013765581,0.0016893212,0.0017322123,0.005030394,0.0036366554,0.0047460287,0.0063698688],"category_scores_gemma":[0.018513843,0.0016857609,0.0037987316,0.0012366034,0.0029223242,0.013203065,0.004569661,0.0039382027,0.00059530634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010640104,0.0005529347,0.0144381225,0.00092771364,0.0007219627,0.004876154,0.0050108843,0.54982656,0.012778154,0.28373113,0.0063635777,0.11970878],"study_design_scores_gemma":[0.00004871076,0.00003938846,0.00046691898,0.00003430886,0.000097902426,0.00022462406,0.00029966116,0.89298356,0.0028079054,0.10155728,0.0014064453,0.00003324815],"about_ca_topic_score_codex":0.009267558,"about_ca_topic_score_gemma":0.008233828,"teacher_disagreement_score":0.009267558,"about_ca_system_score_codex":0.0015047408,"about_ca_system_score_gemma":0.0010043269,"threshold_uncertainty_score":0.025295734},"labels":[],"label_agreement":null},{"id":"W1518212064","doi":"10.1007/11559573_117","title":"Suppression of Stripe Artifacts in Mammograms Using Weighted Median Filtering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Median filter; Artificial intelligence; Computer vision; Algorithm; Image processing; Image (mathematics)","score_opus":0.023598017720119806,"score_gpt":0.2576725451081746,"score_spread":0.23407452738805481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518212064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08297072,0.0013044555,0.9116123,0.00016544877,0.00010299542,0.0000464281,0.00012466394,0.0010135102,0.0026595898],"genre_scores_gemma":[0.2942059,0.0021094815,0.69676006,0.00013491197,0.00019414412,0.00006304337,0.00056355237,0.0004540868,0.005514819],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.000031940886,0.000016522079,0.000024402058,0.00010015841,0.000021640519],"domain_scores_gemma":[0.9993242,0.0003133982,0.00006872551,0.00007589417,0.00018840142,0.000029420895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004918613,0.0006828129,0.0005743965,0.00093257416,0.00021163722,0.0006496825,0.00038821262,0.00064947474,0.0023738241],"category_scores_gemma":[0.0015202326,0.0003347742,0.00056022225,0.0010143636,0.00022328518,0.0006082388,0.00055844476,0.00046043276,0.00068541884],"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.00072825083,0.00007941967,0.0009866002,0.00038381157,0.00009089962,0.0002656883,0.00013004935,0.006436504,0.5369604,0.0016272943,0.0013584157,0.45095265],"study_design_scores_gemma":[0.0001012797,0.0005397253,0.016735421,0.00009604454,0.00043138902,0.003109691,0.00015893573,0.3087643,0.64891875,0.004975586,0.016099429,0.000069441165],"about_ca_topic_score_codex":0.00029673407,"about_ca_topic_score_gemma":0.0006463055,"teacher_disagreement_score":0.0023738241,"about_ca_system_score_codex":0.00012137244,"about_ca_system_score_gemma":0.0002429209,"threshold_uncertainty_score":0.007941186},"labels":[],"label_agreement":null},{"id":"W1518254600","doi":"10.1007/978-3-540-72504-6_28","title":"Quantum Multiparty Communication Complexity and Circuit Lower Bounds","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Canadian Nautical Research Society","funders":"","keywords":"Omega; Communication complexity; Quantum; Function (biology); Quantum information science; Upper and lower bounds; Mathematics; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Physics; Quantum mechanics; Mathematical analysis; Quantum entanglement","score_opus":0.04172055486106492,"score_gpt":0.27308264432930723,"score_spread":0.23136208946824233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518254600","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.046613317,0.021139799,0.4481944,0.029522972,0.002396913,0.00028066814,0.0020707739,0.00093294284,0.4488482],"genre_scores_gemma":[0.7943426,0.017236577,0.08460071,0.0051082736,0.005103426,0.0014330265,0.0016585789,0.0014240174,0.08909287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99467576,0.0011274316,0.00015940348,0.0009171708,0.0022241017,0.0008961514],"domain_scores_gemma":[0.97621775,0.018471329,0.00058388704,0.0031265414,0.0011005856,0.0004999754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003880521,0.0020087461,0.0034507266,0.0030937365,0.0034323677,0.00889315,0.0055920086,0.005448267,0.026953606],"category_scores_gemma":[0.017524263,0.0018713198,0.002660285,0.0065856306,0.00572013,0.018951759,0.0068348413,0.01742693,0.004434418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047898975,0.000059114853,0.00007487906,0.00014092046,0.000017429229,0.00002552408,0.00005796058,0.0055858814,0.00039763915,0.97594154,0.0069041327,0.010747095],"study_design_scores_gemma":[0.000009638217,0.0000065340137,0.00009170362,0.000034635017,0.00001328445,0.000029166107,0.0000111750805,0.0145013565,0.00042813364,0.98171175,0.0031497264,0.000012928417],"about_ca_topic_score_codex":0.0013519215,"about_ca_topic_score_gemma":0.0012103964,"teacher_disagreement_score":0.026953606,"about_ca_system_score_codex":0.007652805,"about_ca_system_score_gemma":0.002345962,"threshold_uncertainty_score":0.090168774},"labels":[],"label_agreement":null},{"id":"W1518403088","doi":"10.1007/3-540-36209-6_29","title":"Product and Process Metrics: A Software Engineering Measurement Expert System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"University of Calgary","funders":"","keywords":"Software Engineering Process Group; Social software engineering; Personal software process; Software construction; Software measurement; Software engineering; Software development; Software system; Benchmarking; Software sizing; Verification and validation; Software; Computer science; Engineering; Systems engineering; Operating system","score_opus":0.0304681407841012,"score_gpt":0.24273348211354376,"score_spread":0.21226534132944255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518403088","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.008532109,0.00046142508,0.89922035,0.00047016566,0.00007805188,0.0004205775,0.0016278387,0.07994546,0.009243992],"genre_scores_gemma":[0.041271675,0.00055115856,0.9302222,0.00022069598,0.00008025044,0.00052038743,0.0053154924,0.008038453,0.013779668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965197,0.00061640923,0.00039287918,0.00041917645,0.0019689074,0.00008294246],"domain_scores_gemma":[0.9882129,0.0051210136,0.0006729684,0.0014208585,0.004144609,0.00042763626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063756667,0.0012985349,0.0014916572,0.004186794,0.0004726307,0.0021828162,0.0016697381,0.00095113495,0.008988231],"category_scores_gemma":[0.01885221,0.0014401322,0.0005010436,0.0028415152,0.00029552457,0.0040780585,0.0016821752,0.0014916295,0.008159204],"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.00011263703,0.0001745908,0.0024976502,0.00020353493,0.00007253131,0.00009014391,0.0003778759,0.004997938,0.00803792,0.0036839724,0.058960333,0.9207909],"study_design_scores_gemma":[0.00045974375,0.0005156249,0.026046276,0.0006556067,0.00053945475,0.0014734834,0.000376119,0.5242749,0.052903835,0.04124486,0.3511589,0.0003511866],"about_ca_topic_score_codex":0.00192131,"about_ca_topic_score_gemma":0.0029608053,"teacher_disagreement_score":0.008988231,"about_ca_system_score_codex":0.00071269117,"about_ca_system_score_gemma":0.0017836833,"threshold_uncertainty_score":0.03371817},"labels":[],"label_agreement":null},{"id":"W1518466950","doi":"10.1007/11557067_6","title":"A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Branch and bound; Consistency (knowledge bases); Set (abstract data type); Algorithm; Heuristic; Construct (python library); Computer science; Scheme (mathematics); Running time; Upper and lower bounds; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.018641154443467676,"score_gpt":0.25538623082764317,"score_spread":0.2367450763841755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518466950","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.025412936,0.00075646443,0.9580514,0.0012283222,0.00030471172,0.0004032675,0.00064021046,0.0045326096,0.008670052],"genre_scores_gemma":[0.12997791,0.00028893963,0.8609096,0.0005056575,0.00017031659,0.00042309143,0.0018181626,0.0010364638,0.004869945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839395,0.00037893976,0.00011483433,0.00044278853,0.00041176716,0.0002576285],"domain_scores_gemma":[0.99418396,0.0037594677,0.00026075915,0.0010250277,0.000502811,0.00026797818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024089692,0.001570591,0.002697546,0.0018397191,0.0016505341,0.0026792765,0.0045587267,0.0022159237,0.02238127],"category_scores_gemma":[0.010473177,0.0012593709,0.0017229256,0.0038656525,0.0012008996,0.0051944936,0.0035484552,0.0043732645,0.0027219688],"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.0015464947,0.0009529622,0.0013251848,0.0007572475,0.00016913113,0.0001955328,0.00033906294,0.16878167,0.0064669373,0.059433665,0.041213103,0.7188191],"study_design_scores_gemma":[0.0006037181,0.00021177698,0.00043762603,0.0000644368,0.000120135366,0.00013029258,0.00012501075,0.8138145,0.0025684286,0.17747186,0.0044139633,0.00003816443],"about_ca_topic_score_codex":0.0040452257,"about_ca_topic_score_gemma":0.0071892156,"teacher_disagreement_score":0.02238127,"about_ca_system_score_codex":0.0014935175,"about_ca_system_score_gemma":0.003510948,"threshold_uncertainty_score":0.07487285},"labels":[],"label_agreement":null},{"id":"W1518470882","doi":"10.1007/978-3-642-15552-9_42","title":"Optimizing Complex Loss Functions in Structured Prediction","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Solver; Piecewise linear function; Artificial intelligence; Piecewise; Algorithm; Simple (philosophy); Image segmentation; Pattern recognition (psychology); Mathematical optimization; Mathematics","score_opus":0.02164440741970232,"score_gpt":0.2540126322396124,"score_spread":0.2323682248199101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518470882","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.014038342,0.00050972326,0.9834911,0.00021233923,0.00005060748,0.000018549768,0.00005344945,0.00034680706,0.0012790128],"genre_scores_gemma":[0.4023661,0.0011110464,0.5796765,0.00038827735,0.00031216207,0.00025955844,0.0006253437,0.00068626064,0.014574725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994287,0.00024643508,0.000028321352,0.00009599207,0.00014721951,0.000053234417],"domain_scores_gemma":[0.99638414,0.0028607817,0.00013279653,0.00027547035,0.00024320587,0.00010354619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023272675,0.0010413826,0.0014694589,0.000443859,0.00030325344,0.0010904366,0.0014723269,0.001806675,0.0033814635],"category_scores_gemma":[0.0069360696,0.00072843384,0.0005254413,0.00076847087,0.0010131357,0.0025921836,0.0016519027,0.0021923084,0.0010313902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001221108,0.000097509466,0.0005140072,0.000094980714,0.00003913201,0.000063441665,0.000051174768,0.8147782,0.0022327837,0.046425454,0.0058384174,0.12974268],"study_design_scores_gemma":[0.000004914376,0.000012744064,0.00003950057,0.000004385463,0.0000023389578,0.0000072763087,0.00000227286,0.9834305,0.00026964102,0.016010227,0.00021346008,0.0000027176307],"about_ca_topic_score_codex":0.0013350219,"about_ca_topic_score_gemma":0.0016062749,"teacher_disagreement_score":0.0033814635,"about_ca_system_score_codex":0.0007296048,"about_ca_system_score_gemma":0.00060323457,"threshold_uncertainty_score":0.012307882},"labels":[],"label_agreement":null},{"id":"W1518500743","doi":"10.1007/978-3-642-03730-6_22","title":"High Performance Analytics with the R3-Cache","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Concordia University","funders":"","keywords":"Computer science; Cache; Analytics; Parallel computing; Database","score_opus":0.014388152473746488,"score_gpt":0.21484261997778403,"score_spread":0.20045446750403756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518500743","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.027117973,0.010954696,0.77934396,0.0015774792,0.0010539269,0.0003178167,0.0044526467,0.11183723,0.06334428],"genre_scores_gemma":[0.23787257,0.0035491819,0.69751245,0.0014595562,0.0006033951,0.00043163434,0.011430324,0.0058578397,0.041283105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984224,0.0002888518,0.00012718311,0.0002344712,0.0007626666,0.00016440301],"domain_scores_gemma":[0.9973744,0.0006201762,0.00010380689,0.0011114896,0.000640435,0.00014965609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014100228,0.0016918393,0.0013882298,0.0014911352,0.00086711056,0.0033463163,0.005063216,0.0011463905,0.026320387],"category_scores_gemma":[0.0046516955,0.0008658873,0.0010627011,0.004449387,0.00069240143,0.0045333635,0.0028079906,0.0021975697,0.014138662],"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.0027867323,0.00030515643,0.0027132607,0.0010454468,0.0003686246,0.0004276365,0.0002718215,0.02499793,0.02873057,0.056627546,0.32312748,0.55859786],"study_design_scores_gemma":[0.000632788,0.00065429445,0.00146304,0.00028845225,0.00030727786,0.001071252,0.00020346254,0.51390636,0.08997541,0.12915902,0.26208958,0.00024904846],"about_ca_topic_score_codex":0.0036970482,"about_ca_topic_score_gemma":0.004463322,"teacher_disagreement_score":0.026320387,"about_ca_system_score_codex":0.0009514943,"about_ca_system_score_gemma":0.0016453257,"threshold_uncertainty_score":0.088050485},"labels":[],"label_agreement":null},{"id":"W1518630539","doi":"10.1007/11753810_14","title":"A Lagrangian Approach for the Optimal Placement of Wireless Relay Nodes in Wireless Local Area Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Relay; Computer science; Subgradient method; Throughput; Path loss; Rayleigh fading; Computer network; Wireless network; Wireless; Wi-Fi; Lagrangian relaxation; Mathematical optimization; Fading; Telecommunications; Mathematics","score_opus":0.013178058977573116,"score_gpt":0.22137041393638285,"score_spread":0.20819235495880972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518630539","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.0014221696,0.00045441792,0.99305385,0.00027669978,0.00007838272,0.000041257274,0.000047698515,0.000053268916,0.0045722965],"genre_scores_gemma":[0.16249447,0.0025201398,0.81761163,0.00032776728,0.0003336351,0.00060979737,0.00023366783,0.00027453617,0.015594361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993742,0.00031495787,0.00002037536,0.00005540288,0.00017684308,0.00005828913],"domain_scores_gemma":[0.9990126,0.00070803537,0.00006684268,0.00003648808,0.00013450054,0.000041581614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015298022,0.0016319947,0.0017183339,0.0010088586,0.0007106677,0.0014983653,0.0023702946,0.0019269574,0.004325099],"category_scores_gemma":[0.0037617951,0.0013282399,0.0011014579,0.0014503325,0.0013683158,0.0017130075,0.0016824636,0.002164461,0.0010841814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025305459,0.000044353455,0.000086254084,0.00013042349,0.00001836191,0.00007878587,0.00007613334,0.8564811,0.00074383937,0.112363055,0.0053379755,0.024614483],"study_design_scores_gemma":[0.00001430872,0.000021466069,0.000020998887,0.000018429459,0.0000044942276,0.000017397384,0.000015583497,0.9681873,0.000103860606,0.029877419,0.0017114971,0.000007229197],"about_ca_topic_score_codex":0.005168874,"about_ca_topic_score_gemma":0.005350496,"teacher_disagreement_score":0.005168874,"about_ca_system_score_codex":0.001594098,"about_ca_system_score_gemma":0.0016449373,"threshold_uncertainty_score":0.014468849},"labels":[],"label_agreement":null},{"id":"W1518640747","doi":"10.1007/978-3-540-30136-3_128","title":"Wrist Kinematics from Computed Tomography Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Orthopedic Surgery and Rehabilitation","field":"Medicine","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":"Kingston General Hospital","funders":"","keywords":"Wrist; Lunate; Carpal bones; Kinematics; Range of motion; Carpal Joint; Ulnar deviation; Computer science; Anatomy; Computed tomography; Orthodontics; Medicine; Radiology; Physics","score_opus":0.028034110399249773,"score_gpt":0.2752696890485485,"score_spread":0.2472355786492987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518640747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016049271,0.002312474,0.96582496,0.00017204507,0.00024439645,0.000069953734,0.0017048528,0.0051349117,0.008487142],"genre_scores_gemma":[0.32106757,0.0108501315,0.6051579,0.00011847792,0.0002681217,0.00018890713,0.008587577,0.0018914609,0.051869817],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99974674,0.000021451613,0.00001656459,0.000058227226,0.00013862354,0.000018346245],"domain_scores_gemma":[0.99969673,0.00012606557,0.00003420951,0.00004662865,0.00008469367,0.000011667385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032350465,0.0010060277,0.0007728353,0.0013415248,0.00019348472,0.0014561518,0.0007485628,0.000691559,0.012416088],"category_scores_gemma":[0.0018221387,0.0009166421,0.00077766087,0.0016014864,0.00029830093,0.0007670431,0.0006906537,0.0005283973,0.010450469],"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.00016066346,0.000031059066,0.0017352954,0.00039546398,0.00005308355,0.00029456217,0.00010214582,0.060303684,0.04885214,0.0027646327,0.005664017,0.87964326],"study_design_scores_gemma":[0.000057520076,0.00026142248,0.03317961,0.0005934389,0.00018754517,0.0032957483,0.00035156406,0.7882244,0.099194854,0.024978518,0.049459863,0.00021560476],"about_ca_topic_score_codex":0.003394373,"about_ca_topic_score_gemma":0.006013304,"teacher_disagreement_score":0.012416088,"about_ca_system_score_codex":0.00021814802,"about_ca_system_score_gemma":0.00046478884,"threshold_uncertainty_score":0.041535974},"labels":[],"label_agreement":null},{"id":"W1518644579","doi":"10.1007/11561071_66","title":"Finding Frequent Patterns in a String in Sublinear Time","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sublinear function; String (physics); Focus (optics); Property (philosophy); Computer science; Alphabet; Algorithm; Combinatorics; Discrete mathematics; Mathematics; Physics","score_opus":0.018829689908549815,"score_gpt":0.25062956708516604,"score_spread":0.2317998771766162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518644579","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.15658382,0.005577653,0.7500838,0.010938619,0.0017003216,0.0011585243,0.015120464,0.032823935,0.026012832],"genre_scores_gemma":[0.19058652,0.0016963657,0.7509814,0.0016396956,0.00092234765,0.0007595702,0.021439238,0.0025109123,0.029463986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924516,0.00104958,0.0008429885,0.0016843869,0.0032624241,0.0007090205],"domain_scores_gemma":[0.9653577,0.025760882,0.001211492,0.005457439,0.0015095231,0.000703037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304155,0.0023218025,0.0035363906,0.003144608,0.0013700507,0.005976808,0.003671211,0.002447146,0.030955182],"category_scores_gemma":[0.019818256,0.0015479899,0.0044945697,0.008047731,0.001641314,0.015625134,0.003601025,0.0032900057,0.013695449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030635106,0.0007219925,0.0059270384,0.0023485806,0.00059541553,0.0007925787,0.0005726932,0.024432426,0.035067998,0.01441384,0.07413479,0.8379292],"study_design_scores_gemma":[0.0017592665,0.0008003261,0.0046649654,0.00025576397,0.000991142,0.0037521392,0.0012986166,0.6705627,0.037353873,0.23965296,0.038769595,0.00013861715],"about_ca_topic_score_codex":0.0028903477,"about_ca_topic_score_gemma":0.0075203585,"teacher_disagreement_score":0.030955182,"about_ca_system_score_codex":0.002154064,"about_ca_system_score_gemma":0.0044340156,"threshold_uncertainty_score":0.10355544},"labels":[],"label_agreement":null},{"id":"W1518727905","doi":"10.1007/978-3-540-31856-9_19","title":"On Weighted Balls-into-Bins Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Simon Fraser University","funders":"","keywords":"Ball (mathematics); Computer science; Bin; Context (archaeology); Running time; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Geometry","score_opus":0.01663694576698733,"score_gpt":0.20775462345661883,"score_spread":0.1911176776896315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518727905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0898891,0.0013349194,0.78577685,0.0037827096,0.0007068869,0.00055182714,0.00083539344,0.000357192,0.116765186],"genre_scores_gemma":[0.7213431,0.0029970245,0.15325773,0.002066414,0.00093675696,0.0016327486,0.0015487875,0.0005216832,0.115695715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973111,0.0013099775,0.000115747025,0.00031906282,0.0005029309,0.00044122068],"domain_scores_gemma":[0.9941625,0.0038963212,0.00036937185,0.0003251812,0.0004376937,0.0008089014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022938661,0.0032142561,0.0040156506,0.0016275351,0.0019406555,0.0050110808,0.005284336,0.004459025,0.0200808],"category_scores_gemma":[0.014516474,0.0014902849,0.0016384098,0.002953023,0.0038138656,0.008313616,0.005069501,0.004775689,0.001724881],"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.00016505488,0.00008407658,0.0001820488,0.00011363806,0.000043468815,0.00006559127,0.00016110197,0.051481385,0.0004251375,0.92842686,0.008424694,0.010426831],"study_design_scores_gemma":[0.000058113048,0.000025001475,0.000051269715,0.000023780207,0.000011961054,0.000021391055,0.0000405305,0.12145494,0.00006151491,0.87688535,0.0013508602,0.000015281084],"about_ca_topic_score_codex":0.0050660586,"about_ca_topic_score_gemma":0.005568224,"teacher_disagreement_score":0.0200808,"about_ca_system_score_codex":0.0031250163,"about_ca_system_score_gemma":0.0023521818,"threshold_uncertainty_score":0.067177},"labels":[],"label_agreement":null},{"id":"W1518764426","doi":"10.1007/bfb0023728","title":"Using partial-order semantics to avoid the state explosion problem in asynchronous systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nondeterministic algorithm; Liveness; Concurrency; Computer science; Automaton; Model checking; Finite-state machine; Petri net; Asynchronous communication; Theoretical computer science; Branching (polymer chemistry); State (computer science); Partial order reduction; Algorithm; Programming language","score_opus":0.04425788797565207,"score_gpt":0.29586458397730303,"score_spread":0.251606696001651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518764426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006413547,0.00016417481,0.98659605,0.00027811725,0.00010684057,0.00005692026,0.00003750764,0.00094762305,0.005399226],"genre_scores_gemma":[0.35044545,0.00069744,0.6367943,0.00035313057,0.00024583042,0.00045535027,0.0002595078,0.0009182083,0.009830778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778134,0.0007120508,0.00024069365,0.00025511257,0.0008028273,0.00020784898],"domain_scores_gemma":[0.99483794,0.002982863,0.00023150598,0.0013363146,0.00045570344,0.00015555907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033558847,0.00096586905,0.0010350094,0.0007271975,0.0014451403,0.0030617483,0.0018754222,0.0013138214,0.003534457],"category_scores_gemma":[0.008376911,0.00100375,0.001499173,0.0009040715,0.0031086996,0.010521658,0.0032844297,0.0044252216,0.0008689819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015492103,0.00010020546,0.00019253076,0.00024166185,0.000037343907,0.00020937219,0.0007272836,0.030650606,0.0059229634,0.8686555,0.0024378614,0.090669736],"study_design_scores_gemma":[0.00007258157,0.00006071934,0.00004807993,0.000032470514,0.00004755378,0.000120468765,0.00006479902,0.08548123,0.0077677076,0.8948281,0.011450559,0.000025788202],"about_ca_topic_score_codex":0.0007420551,"about_ca_topic_score_gemma":0.0014867379,"teacher_disagreement_score":0.003534457,"about_ca_system_score_codex":0.00061431853,"about_ca_system_score_gemma":0.0016488353,"threshold_uncertainty_score":0.017747879},"labels":[],"label_agreement":null},{"id":"W1518986690","doi":"10.1007/978-3-540-72606-7_13","title":"Integrated Clustering and Routing Strategies for Large Scale Sensor Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Windsor","funders":"","keywords":"Computer science; Cluster analysis; Static routing; Routing (electronic design automation); Relay; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Multipath routing; Heuristic; Distributed computing; Computer network; Routing protocol; Artificial intelligence","score_opus":0.01867792844754895,"score_gpt":0.24878019651971378,"score_spread":0.23010226807216483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518986690","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.011982002,0.0017570176,0.9822858,0.00018604683,0.000085956366,0.000055496224,0.000030687235,0.0005064855,0.003110501],"genre_scores_gemma":[0.50221807,0.002183597,0.48441392,0.000170066,0.00020163246,0.0002268651,0.00016625902,0.00025268068,0.010166875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.000089623725,0.000019417048,0.00005835198,0.0001518151,0.000038779937],"domain_scores_gemma":[0.9994948,0.00019910563,0.00003852763,0.000099128345,0.00014117033,0.000027299786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007225385,0.00083586056,0.0008379702,0.00053223484,0.0004333356,0.00062496413,0.0019675095,0.0009146664,0.0017559328],"category_scores_gemma":[0.0014333227,0.00044240104,0.00035721966,0.0009966927,0.00040121854,0.0017483499,0.0009096646,0.00061936537,0.0005064563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010908428,0.00009893987,0.00021341987,0.0001944953,0.0000784105,0.000052129937,0.00007916496,0.69069725,0.02019231,0.024126986,0.0040519116,0.26010585],"study_design_scores_gemma":[0.000016069767,0.000072557435,0.00015870492,0.000008868232,0.000026369464,0.00007273791,0.000024583404,0.97748613,0.0034404765,0.016227758,0.0024516748,0.000014002233],"about_ca_topic_score_codex":0.0010634657,"about_ca_topic_score_gemma":0.0029318095,"teacher_disagreement_score":0.0019675095,"about_ca_system_score_codex":0.00059068337,"about_ca_system_score_gemma":0.0004239197,"threshold_uncertainty_score":0.005874157},"labels":[],"label_agreement":null},{"id":"W1519007291","doi":"10.1007/978-3-540-27772-9_36","title":"Tree Multivalued Dependencies for XML Datasets","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"XML; Computer science; Tree (set theory); Functional dependency; Relational database; Data mining; Theoretical computer science; Dependency theory (database theory); XML database; Mathematics; Combinatorics; World Wide Web","score_opus":0.024186690029958102,"score_gpt":0.2707238614658031,"score_spread":0.24653717143584497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519007291","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.029612873,0.0014677211,0.95618457,0.0005751204,0.00012271096,0.00009681257,0.004536244,0.004533294,0.002870737],"genre_scores_gemma":[0.2808283,0.0011471024,0.69346195,0.00024822386,0.00023892909,0.00024307563,0.015163293,0.0015826677,0.00708647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865204,0.00029430547,0.00021056627,0.00030417668,0.00045721635,0.00008160621],"domain_scores_gemma":[0.9936558,0.0035881225,0.00045758008,0.0016102734,0.0005221345,0.0001661472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025332372,0.0003020044,0.0007158792,0.0020212498,0.00067458866,0.0015398719,0.0014617988,0.00081031356,0.004016656],"category_scores_gemma":[0.008850776,0.0007399508,0.00083532144,0.0035896283,0.00060320925,0.0056891968,0.0012916568,0.0014721446,0.00075599184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005440272,0.00016640588,0.005692829,0.0009049286,0.00015078274,0.00048583857,0.00064489315,0.058474455,0.013844348,0.33612987,0.043510374,0.5394512],"study_design_scores_gemma":[0.000057386125,0.00010481568,0.0022933807,0.00016339432,0.00009371455,0.0005234548,0.00011620896,0.34721386,0.012987592,0.58998656,0.046396792,0.00006290875],"about_ca_topic_score_codex":0.0018263184,"about_ca_topic_score_gemma":0.00401012,"teacher_disagreement_score":0.004016656,"about_ca_system_score_codex":0.000903721,"about_ca_system_score_gemma":0.0008574496,"threshold_uncertainty_score":0.013437092},"labels":[],"label_agreement":null},{"id":"W1519010826","doi":"10.1007/11674399_20","title":"Current Challenges in Multi-player Game Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Computer science; Perfect information; Adversary; Pruning; Combinatorial game theory; Bridge (graph theory); Sequential game; Video game design; Bayesian game; Game design; Game theory; Artificial intelligence; Mathematical economics; Computer security; Mathematics","score_opus":0.11637098636436781,"score_gpt":0.3351997276131082,"score_spread":0.21882874124874035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519010826","genre_codex":"review","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.03914853,0.39364752,0.3088619,0.11366186,0.0024199726,0.00017817291,0.0007066344,0.0011443477,0.14023098],"genre_scores_gemma":[0.56888,0.1772074,0.19149475,0.006422739,0.0050526224,0.0004940163,0.0013449332,0.0005391852,0.048564386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528885,0.0017746001,0.0002902905,0.0006593694,0.0015717956,0.00041498925],"domain_scores_gemma":[0.97551596,0.020431247,0.00039100868,0.0008461876,0.0019401021,0.0008755929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010427924,0.0008103039,0.0023388404,0.00155613,0.0018536963,0.012155704,0.006722225,0.0060672075,0.021664277],"category_scores_gemma":[0.029034965,0.00082226837,0.00075133605,0.0036249459,0.0042319675,0.02533833,0.004378558,0.004274286,0.005058323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025512232,0.00026971236,0.0012650113,0.0015634344,0.00006796701,0.00011301771,0.00066719163,0.017578846,0.00058226124,0.49919504,0.04115832,0.43728414],"study_design_scores_gemma":[0.000056453955,0.00010798976,0.00053320144,0.00051424565,0.000040291914,0.00046039984,0.0017810031,0.11614311,0.0006526967,0.7444139,0.1352358,0.00006089604],"about_ca_topic_score_codex":0.0047373422,"about_ca_topic_score_gemma":0.006079741,"teacher_disagreement_score":0.021664277,"about_ca_system_score_codex":0.0021908528,"about_ca_system_score_gemma":0.0027918464,"threshold_uncertainty_score":0.0724743},"labels":[],"label_agreement":null},{"id":"W1519204706","doi":"10.1007/978-3-642-32630-1_2","title":"A Realistic Test and Development Environment for Mixed Reality in Neurosurgery","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"McGill University","funders":"","keywords":"Visualization; Computer science; Workflow; Virtual reality; Mixed reality; Augmented reality; Human–computer interaction; Neurovascular bundle; Software; Data visualization; Artificial intelligence; Surgery; Medicine","score_opus":0.03574265956666944,"score_gpt":0.25024692371546614,"score_spread":0.2145042641487967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519204706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07956716,0.00065235025,0.8775944,0.0005780065,0.00030644605,0.0013132215,0.001825088,0.012835357,0.025328021],"genre_scores_gemma":[0.27901968,0.0006695105,0.6936179,0.00022238481,0.0000692337,0.0016881215,0.0023057915,0.0036015832,0.018805852],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991641,0.00032818955,0.000051661533,0.00006782677,0.00032503397,0.000063187385],"domain_scores_gemma":[0.9980336,0.0010762706,0.000072266994,0.00033176944,0.00027273255,0.00021350975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016419705,0.0011287841,0.000447466,0.0006630468,0.00042302374,0.0011732767,0.002107711,0.0011652975,0.017134868],"category_scores_gemma":[0.0031787765,0.00081764255,0.00051043817,0.00031328233,0.0004055156,0.0008850279,0.0019717962,0.00069404877,0.0034090185],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024328788,0.002207327,0.004715447,0.0015992234,0.00019267535,0.0035553041,0.003024009,0.1093317,0.27099323,0.019367801,0.05782272,0.5247577],"study_design_scores_gemma":[0.000997162,0.006182227,0.017650044,0.000712255,0.00038442886,0.01155515,0.00096514233,0.34186435,0.25762156,0.014334128,0.34717822,0.0005552875],"about_ca_topic_score_codex":0.00073779724,"about_ca_topic_score_gemma":0.001452042,"teacher_disagreement_score":0.017134868,"about_ca_system_score_codex":0.00030378965,"about_ca_system_score_gemma":0.00076010614,"threshold_uncertainty_score":0.057321846},"labels":[],"label_agreement":null},{"id":"W1519229316","doi":"10.1007/978-3-540-24639-8_5","title":"Experiment on Embedding Interception Service into Java RMI","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Windsor","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Java; Interception; Implementation; Service (business); Operating system; Remote procedure call; Distributed computing; Programming language","score_opus":0.03671562587027756,"score_gpt":0.3152118459270938,"score_spread":0.27849622005681623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519229316","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.99209666,0.00007056533,0.0032580632,0.00012808414,0.00008587599,0.0000416836,0.0004080362,0.0018112982,0.0020997867],"genre_scores_gemma":[0.9909458,0.000050656687,0.0037290752,0.000071798415,0.000015741272,0.000040577208,0.000826022,0.00017818795,0.004142152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989209,0.0002498861,0.00007258706,0.00024303897,0.00026537172,0.0002481473],"domain_scores_gemma":[0.99497837,0.0028127455,0.00025560526,0.0008237374,0.00073346624,0.000396027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006683128,0.00062301534,0.00046504373,0.00029185327,0.0004833003,0.0004706637,0.0013004297,0.0014541708,0.00826422],"category_scores_gemma":[0.00395487,0.00036537557,0.0002932951,0.00028972048,0.00053628406,0.001348619,0.0005893641,0.0010255782,0.0015777],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.027569257,0.011142299,0.027039055,0.0015590761,0.00032707572,0.0033319339,0.0014750354,0.039378155,0.7732866,0.0037263075,0.018849267,0.09231603],"study_design_scores_gemma":[0.0020912515,0.022000466,0.039484225,0.00008018544,0.00044356214,0.0011314955,0.0011365666,0.24036033,0.68321466,0.002012268,0.007876413,0.00016848248],"about_ca_topic_score_codex":0.0023263344,"about_ca_topic_score_gemma":0.0014882273,"teacher_disagreement_score":0.00826422,"about_ca_system_score_codex":0.00030914575,"about_ca_system_score_gemma":0.0004642261,"threshold_uncertainty_score":0.027646542},"labels":[],"label_agreement":null},{"id":"W1519300648","doi":"10.1007/978-3-540-74563-1_6","title":"Examining the Relationship Between Individual Characteristics, Product Characteristics, and Media Richness Fit on Consumer Channel Preference","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Preference; Channel (broadcasting); Species richness; Product (mathematics); Psychology; Consumer behaviour; Advertising; Computer science; Social psychology; Mathematics; Statistics; Business; Telecommunications","score_opus":0.1611390771936579,"score_gpt":0.31025859003149703,"score_spread":0.14911951283783914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519300648","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.999253,0.000047119815,0.000115136085,0.0000212182,0.0000018998487,0.000004899613,0.00004607541,0.0000024797564,0.0005081198],"genre_scores_gemma":[0.9992254,0.000039976112,0.00017532968,0.000016049886,0.0000053794024,0.0000104507735,0.00012554972,0.0000034048367,0.00039842504],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99932206,0.00035035048,0.000036077417,0.00010320274,0.000102334394,0.000085985725],"domain_scores_gemma":[0.9730982,0.022396779,0.0019265919,0.00074153795,0.0005055624,0.0013313878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017809481,0.00048730985,0.00038529388,0.0010209886,0.00043850535,0.001559792,0.00052270363,0.0010730303,0.0077800686],"category_scores_gemma":[0.008219238,0.0003561,0.0011478914,0.0011211637,0.00043885058,0.0012641004,0.0008679831,0.001196322,0.0006327743],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070026936,0.0004629023,0.9914062,0.0000244956,0.0003495275,0.00007118072,0.0005524887,0.00044289374,0.001420553,0.00017446242,0.000091528964,0.0043035382],"study_design_scores_gemma":[0.000017782033,0.00045956066,0.9942135,0.000011682492,0.0002942146,0.00008404819,0.00091689767,0.0031597947,0.00047518444,0.00024177927,0.00011136742,0.000014088335],"about_ca_topic_score_codex":0.003646025,"about_ca_topic_score_gemma":0.00650037,"teacher_disagreement_score":0.0077800686,"about_ca_system_score_codex":0.00036322215,"about_ca_system_score_gemma":0.00038080514,"threshold_uncertainty_score":0.026026964},"labels":[],"label_agreement":null},{"id":"W1519312546","doi":"10.1007/3-540-44491-2_55","title":"Web Guide: Filtering and Constraining Site Browsing through Web Walker Techniques","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Constraint (computer-aided design); Domain (mathematical analysis); Web application; Architecture; Representation (politics); Filter (signal processing); Interpreter; World Wide Web; Web site; Field (mathematics); Programming language; Information retrieval; Human–computer interaction; The Internet; Computer vision","score_opus":0.023613075037211956,"score_gpt":0.26523208368526,"score_spread":0.24161900864804806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519312546","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.012717331,0.0002870913,0.91311824,0.00015198394,0.000061023802,0.0003638557,0.00167691,0.06571763,0.0059060035],"genre_scores_gemma":[0.064089045,0.00036154047,0.9066217,0.00012310277,0.000029217394,0.00033740164,0.007789704,0.007969737,0.012678569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975528,0.00061063346,0.00022421146,0.0004327309,0.0010369455,0.00014266378],"domain_scores_gemma":[0.9942631,0.0024840967,0.00021808015,0.0019232967,0.0008553587,0.00025596653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028686926,0.0011521956,0.00131831,0.0034239762,0.0012087292,0.0027173518,0.0022168949,0.0014582978,0.01176377],"category_scores_gemma":[0.011634743,0.0012643865,0.0010986871,0.0031598164,0.0006990547,0.004708828,0.0027363421,0.0017500753,0.007712996],"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.0006953007,0.0009186954,0.0079032965,0.00071198895,0.00016636068,0.00037492174,0.0018502809,0.010647662,0.019450536,0.027939742,0.06818131,0.86115974],"study_design_scores_gemma":[0.0002808249,0.00033954254,0.0067862896,0.0005172591,0.0002973362,0.0010756999,0.0014203446,0.55810875,0.05956953,0.055877853,0.31550387,0.00022267476],"about_ca_topic_score_codex":0.007563298,"about_ca_topic_score_gemma":0.020413917,"teacher_disagreement_score":0.01176377,"about_ca_system_score_codex":0.00043119703,"about_ca_system_score_gemma":0.0018369735,"threshold_uncertainty_score":0.039353788},"labels":[],"label_agreement":null},{"id":"W1519399026","doi":"10.1007/3-540-44839-x_8","title":"Progressive Curve Representation Based on Reverse Subdivision","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Subdivision; Computer science; Rendering (computer graphics); Subdivision surface; Curve fitting; Representation (politics); Algorithm; Computer graphics (images); Polygon mesh","score_opus":0.013034954508537783,"score_gpt":0.26835664890952515,"score_spread":0.2553216944009874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519399026","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.01740419,0.0002009643,0.9653489,0.000043123437,0.00005061605,0.000056776447,0.00006761823,0.001586854,0.01524081],"genre_scores_gemma":[0.24201596,0.00074328214,0.72793823,0.000059620084,0.000052397074,0.000088807494,0.0004903698,0.0007904644,0.027820913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997992,0.000015874277,0.000009800474,0.000030076433,0.00012441145,0.000020713522],"domain_scores_gemma":[0.99978274,0.00005316838,0.000010328257,0.00008880216,0.000052846317,0.000012144711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020892412,0.0005133579,0.00068334705,0.0011603644,0.00025576245,0.0010418583,0.0011513233,0.00047835906,0.011056727],"category_scores_gemma":[0.0006613753,0.00031430938,0.00051641726,0.0009945916,0.00045762383,0.0012267126,0.0011403521,0.0010339485,0.002184995],"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.00017204044,0.00008625413,0.00025133375,0.00019989726,0.000023187898,0.00016164508,0.00023685065,0.047045216,0.106204435,0.12295135,0.0055539464,0.7171139],"study_design_scores_gemma":[0.00006300127,0.00022568552,0.000517552,0.00007517081,0.000056568955,0.0010822336,0.00008870634,0.81869584,0.056379,0.060741134,0.062023703,0.00005136863],"about_ca_topic_score_codex":0.0010813114,"about_ca_topic_score_gemma":0.001214329,"teacher_disagreement_score":0.011056727,"about_ca_system_score_codex":0.00023748353,"about_ca_system_score_gemma":0.0002899269,"threshold_uncertainty_score":0.036988437},"labels":[],"label_agreement":null},{"id":"W1519416322","doi":"10.1007/3-540-44888-8_19","title":"Alignment between Two Multiple Alignments","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Heuristic; Affine transformation; Dynamic programming; Multiple sequence alignment; Sequence (biology); Algorithm; Mathematical optimization; Mathematics; Sequence alignment; Artificial intelligence","score_opus":0.022002496849299415,"score_gpt":0.26083262514084604,"score_spread":0.23883012829154662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519416322","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.031783413,0.0027630685,0.904476,0.001541016,0.003272057,0.0005063542,0.008008074,0.020256178,0.027393837],"genre_scores_gemma":[0.099654794,0.001964445,0.83973515,0.000641508,0.0004847067,0.0004964776,0.029193012,0.006290402,0.021539526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980294,0.00041001732,0.00026267447,0.0007028401,0.00046542232,0.00012957773],"domain_scores_gemma":[0.9961273,0.0012737331,0.00036401217,0.0012812923,0.00085274276,0.00010097702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001498849,0.0020741355,0.0017226918,0.0030932128,0.0018116229,0.003068502,0.0015644633,0.0023874308,0.032710392],"category_scores_gemma":[0.0093087545,0.0013963298,0.0018211518,0.0051387167,0.00063424755,0.0032798392,0.0022234102,0.0029008398,0.026538106],"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.0015660756,0.0003373254,0.0022565967,0.0036995374,0.0005320261,0.0044968245,0.0020749092,0.005802314,0.20485353,0.05656563,0.10183968,0.6159755],"study_design_scores_gemma":[0.00024771687,0.0005344409,0.0032248881,0.001057628,0.00087657495,0.004998104,0.0014271872,0.04802463,0.18618004,0.11976835,0.63344383,0.00021663638],"about_ca_topic_score_codex":0.000322152,"about_ca_topic_score_gemma":0.0005983049,"teacher_disagreement_score":0.032710392,"about_ca_system_score_codex":0.00041930962,"about_ca_system_score_gemma":0.001002162,"threshold_uncertainty_score":0.10942721},"labels":[],"label_agreement":null},{"id":"W1519448302","doi":"10.1007/3-540-45655-4_63","title":"Quantum DNF Learnability Revisited","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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 Ottawa","funders":"","keywords":"Learnability; Computer science; Probably approximately correct learning; Computational complexity theory; Quantum; Upper and lower bounds; Theoretical computer science; Algorithm; Quantum complexity theory; Quantum algorithm; Mathematics; Artificial intelligence; Computational learning theory; Physics; Quantum mechanics; Active learning (machine learning)","score_opus":0.015956673637853747,"score_gpt":0.23883361879661905,"score_spread":0.2228769451587653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519448302","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.15155946,0.005193938,0.35081038,0.031009186,0.0018079133,0.00007799322,0.0008929104,0.00091457606,0.4577336],"genre_scores_gemma":[0.9250894,0.0019796772,0.022314738,0.0024151343,0.0022530567,0.00009583201,0.0005554221,0.00024222444,0.045054607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887055,0.00035100905,0.00004775969,0.00023282066,0.0003568305,0.00014099004],"domain_scores_gemma":[0.9941492,0.003635425,0.0002543711,0.0011807247,0.00054605346,0.00023425922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020197586,0.00056705135,0.0014413231,0.0013619032,0.0017783544,0.0023530705,0.0023326178,0.0024213179,0.012618768],"category_scores_gemma":[0.009324833,0.00044707544,0.0008844188,0.0013486646,0.004401609,0.010803487,0.0027522605,0.005504459,0.0010804022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009948694,0.000009178742,0.000077144854,0.000030383806,0.0000034199877,0.00001705455,0.00004377196,0.0010805388,0.00010755119,0.990334,0.001771616,0.0065153893],"study_design_scores_gemma":[0.0000029178832,0.0000036858912,0.000084533705,0.000009239266,0.0000017966307,0.00003036905,0.0000133758,0.0061515654,0.00013961784,0.9919395,0.0016187606,0.0000046232058],"about_ca_topic_score_codex":0.0018257796,"about_ca_topic_score_gemma":0.0015141064,"teacher_disagreement_score":0.012618768,"about_ca_system_score_codex":0.0019142184,"about_ca_system_score_gemma":0.0007242754,"threshold_uncertainty_score":0.042214036},"labels":[],"label_agreement":null},{"id":"W1519450118","doi":"10.1007/11604686_10","title":"Roman Domination over Some Graph Classes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Lethbridge","funders":"","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Graph; Interval graph; Minimum weight; Mathematics; Time complexity; Dominating set; Discrete mathematics; Line graph; Pathwidth","score_opus":0.016729671139819293,"score_gpt":0.28423662359484875,"score_spread":0.2675069524550295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519450118","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.13103513,0.0011135124,0.043746002,0.0017815162,0.000256075,0.00006647324,0.0003421023,0.00022340204,0.82143575],"genre_scores_gemma":[0.78658646,0.0014463315,0.017022261,0.00056485715,0.00047160892,0.00013522974,0.00050274545,0.0003335188,0.19293696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919695,0.00020238703,0.000033268443,0.00016117861,0.0002361836,0.0001700808],"domain_scores_gemma":[0.9988821,0.00057315576,0.00009679954,0.00012474252,0.0001661814,0.00015691809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006922127,0.00047952618,0.0007939281,0.0015572683,0.0027833672,0.0029242658,0.0007227131,0.0006165095,0.014289118],"category_scores_gemma":[0.0019988995,0.00043552864,0.0007253115,0.001961936,0.0025965045,0.0036070135,0.0014279683,0.0032149116,0.0017312511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017893013,0.000007800117,0.00007108914,0.000020119496,0.000003820131,0.000034405388,0.00017716535,0.00023092839,0.00026853103,0.9919802,0.002332186,0.0048558214],"study_design_scores_gemma":[0.000015505799,0.000008631972,0.00020697876,0.000015289617,0.000009657353,0.00015303513,0.000083000334,0.0014003722,0.00039382314,0.97478455,0.022921728,0.0000074508257],"about_ca_topic_score_codex":0.0013384612,"about_ca_topic_score_gemma":0.0017118956,"teacher_disagreement_score":0.014289118,"about_ca_system_score_codex":0.0016911252,"about_ca_system_score_gemma":0.000560753,"threshold_uncertainty_score":0.047801852},"labels":[],"label_agreement":null},{"id":"W1519476442","doi":"10.1007/3-540-47922-8_35","title":"Multi-agent System Architecture for Computer-Based Tutoring Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Acadia University","funders":"","keywords":"Computer science; Architecture; Systems architecture; Software engineering; Dissemination; Software; Software architecture; Human–computer interaction; Process (computing); Software agent; Computer architecture; Operating system","score_opus":0.03702677467560274,"score_gpt":0.24860664972933416,"score_spread":0.21157987505373144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519476442","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.017246908,0.0008287105,0.9678825,0.00037688835,0.00015615443,0.00014538421,0.000047886788,0.003928194,0.009387392],"genre_scores_gemma":[0.4726334,0.00083030877,0.50687367,0.00015667485,0.000092809954,0.00045042537,0.00023751611,0.00020096058,0.018524176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963725,0.00013038967,0.00003612747,0.000059693673,0.000099129706,0.000037451584],"domain_scores_gemma":[0.99962986,0.000101284546,0.000022656346,0.000055814206,0.00014977867,0.000040538413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065497524,0.00039355384,0.00052340137,0.0003289215,0.0006087976,0.0014427684,0.0016358776,0.0014466826,0.004599499],"category_scores_gemma":[0.0010877211,0.00032180603,0.00029377223,0.00031315393,0.00041699407,0.0011990897,0.0009576665,0.00097516045,0.001442137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055878627,0.00045202253,0.0014814083,0.0005684537,0.00020663721,0.0005657755,0.00097323477,0.39485618,0.07158447,0.124827094,0.015131494,0.38879445],"study_design_scores_gemma":[0.000054898483,0.00015055394,0.00025404466,0.000033811008,0.00005670963,0.00012279328,0.000047774654,0.9460927,0.012246203,0.017769938,0.023149507,0.00002100621],"about_ca_topic_score_codex":0.001912217,"about_ca_topic_score_gemma":0.0024285377,"teacher_disagreement_score":0.004599499,"about_ca_system_score_codex":0.0005731466,"about_ca_system_score_gemma":0.000770527,"threshold_uncertainty_score":0.015386879},"labels":[],"label_agreement":null},{"id":"W1519506066","doi":"10.1007/978-3-540-85363-3_41","title":"Near Optimal Dimensionality Reductions That Preserve Volumes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Dimension (graph theory); Linear subspace; Affine space; Euclidean space; Projection (relational algebra); Space (punctuation); Mathematics; Subspace topology; Curse of dimensionality; Dimensionality reduction; Affine transformation; Discrete mathematics; Geometry; Algorithm; Mathematical analysis; Computer science; Statistics","score_opus":0.029808267614252662,"score_gpt":0.2561323078202257,"score_spread":0.22632404020597308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519506066","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.08842569,0.0014506202,0.8654627,0.0008844668,0.0005722178,0.00008594599,0.00054138864,0.00183317,0.040743902],"genre_scores_gemma":[0.5907482,0.0016902611,0.36289135,0.0005390235,0.0004972342,0.00017809706,0.0011118463,0.0019014477,0.04044258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947804,0.00008724221,0.000025664309,0.000079814534,0.0002650241,0.00006432242],"domain_scores_gemma":[0.9992073,0.0002444515,0.00006598777,0.0003669963,0.00007376986,0.000041578613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034746126,0.0008798544,0.0011079294,0.0007279551,0.00052027794,0.0013684123,0.0010313699,0.00088140083,0.0059546945],"category_scores_gemma":[0.002449396,0.00050447276,0.00064513285,0.000978618,0.0010325379,0.00230116,0.0022174697,0.001741443,0.0017039111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004080687,0.00023626913,0.0004805492,0.00038289657,0.000080602615,0.00018030308,0.00036831884,0.16455019,0.05277968,0.3707983,0.034398783,0.37533608],"study_design_scores_gemma":[0.000072874296,0.00015047824,0.0005170985,0.00004839498,0.00004666793,0.0005246454,0.00021074212,0.4171501,0.023932865,0.5277047,0.029604843,0.000036628822],"about_ca_topic_score_codex":0.00038159246,"about_ca_topic_score_gemma":0.0009147702,"teacher_disagreement_score":0.0059546945,"about_ca_system_score_codex":0.00037516473,"about_ca_system_score_gemma":0.0003425244,"threshold_uncertainty_score":0.019920409},"labels":[],"label_agreement":null},{"id":"W1519526968","doi":"10.1007/3-540-46135-3_16","title":"Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":202,"is_retracted":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":"Benchmark (surveying); Smoothing; Probabilistic logic; Computer science; Novelty; Scaling; Range (aeronautics); Algorithm; Focus (optics); Probabilistic analysis of algorithms; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.016696272430506563,"score_gpt":0.2472365281927607,"score_spread":0.23054025576225415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519526968","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.01945478,0.00052089116,0.97153443,0.00023320236,0.000055943216,0.00009483157,0.00013688303,0.0026394674,0.005329573],"genre_scores_gemma":[0.38572678,0.00038763558,0.6051192,0.00024319111,0.00011120411,0.00043302102,0.0005350569,0.0009033846,0.0065405555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990324,0.00038172587,0.000049264843,0.00018242454,0.00025885212,0.0000952419],"domain_scores_gemma":[0.99766797,0.0015137963,0.00009993437,0.00049015414,0.000151625,0.000076455624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015858208,0.0008728473,0.0021263196,0.0014657142,0.00081842946,0.0010282119,0.0026225257,0.0011017937,0.00859828],"category_scores_gemma":[0.0069093127,0.00095119793,0.00110868,0.002902683,0.0011711987,0.0027970262,0.0032403015,0.001822725,0.0015054761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040595236,0.00016495444,0.0005679187,0.0002471046,0.00007536861,0.00005236986,0.00018654593,0.52502596,0.003841525,0.076166034,0.011757239,0.38150895],"study_design_scores_gemma":[0.000032852877,0.000027377528,0.000063250314,0.0000058217115,0.000011639455,0.000011953434,0.0000114295335,0.96338594,0.00053637906,0.0349057,0.0010016705,0.00000598933],"about_ca_topic_score_codex":0.0034930513,"about_ca_topic_score_gemma":0.006597093,"teacher_disagreement_score":0.00859828,"about_ca_system_score_codex":0.0010205747,"about_ca_system_score_gemma":0.0010714869,"threshold_uncertainty_score":0.02876407},"labels":[],"label_agreement":null},{"id":"W1519528253","doi":"10.1007/11422778_11","title":"An Energy-Efficient Image Representation for Secure Mobile Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Image compression; Energy (signal processing); Energy consumption; Transmission (telecommunications); Image quality; Image file formats; JPEG; Computation; Representation (politics); Data compression; Theoretical computer science; Image (mathematics); Algorithm; Real-time computing; Image processing; Computer vision; Computer network; Mathematics; Telecommunications","score_opus":0.01446164982040928,"score_gpt":0.2966752493291403,"score_spread":0.28221359950873104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519528253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011555875,0.00048613414,0.98316646,0.0001600169,0.00007713502,0.000029240235,0.00010042014,0.00058139313,0.0038433864],"genre_scores_gemma":[0.31036025,0.0013860957,0.67087436,0.00016949186,0.000121710276,0.00008514178,0.0004503373,0.00026246256,0.016290192],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998685,0.000019825913,0.000007659383,0.000018211731,0.00006809626,0.000017687984],"domain_scores_gemma":[0.9998821,0.000030823783,0.000010952442,0.000040215138,0.000030758445,0.00000512436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015482314,0.0004496323,0.00039343679,0.0003456675,0.00019020971,0.00065779185,0.00057037576,0.0005510172,0.004560166],"category_scores_gemma":[0.00049743225,0.00018573295,0.0003267272,0.00052970817,0.00023570684,0.0010876454,0.00056590396,0.0005942717,0.0015669486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003912235,0.00009978382,0.00017278134,0.00021068164,0.000034734483,0.0002171715,0.000071521376,0.10974913,0.19704968,0.06867612,0.008808853,0.6145183],"study_design_scores_gemma":[0.000021756161,0.00011467639,0.00021677285,0.00002619808,0.00002706919,0.00042602714,0.000030424146,0.8950901,0.07153122,0.018765075,0.0137305055,0.000020200894],"about_ca_topic_score_codex":0.00035018113,"about_ca_topic_score_gemma":0.0005357412,"teacher_disagreement_score":0.004560166,"about_ca_system_score_codex":0.00020635457,"about_ca_system_score_gemma":0.00018376845,"threshold_uncertainty_score":0.015255272},"labels":[],"label_agreement":null},{"id":"W1519555383","doi":"10.1007/978-3-642-16181-0_3","title":"Advances on Genome Duplication Distances","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Genome; Gene duplication; Tree (set theory); Phylogenetic tree; Computer science; Gene rearrangement; Node (physics); Combinatorics; Computational biology; Biology; Gene; Mathematics; Genetics; Physics","score_opus":0.007667278432481175,"score_gpt":0.236859674641153,"score_spread":0.22919239620867185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519555383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03791762,0.17693666,0.6645897,0.0073460094,0.0038585858,0.00007215716,0.0011793339,0.0009402964,0.10715959],"genre_scores_gemma":[0.42918018,0.13198017,0.38304535,0.0019702185,0.006248927,0.00020401904,0.002968396,0.00092283386,0.04347989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987312,0.00027531543,0.000056040506,0.00042141363,0.00045235056,0.000063637905],"domain_scores_gemma":[0.99731475,0.0016247148,0.00016970249,0.00034693503,0.00043994267,0.000104029205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014335418,0.00087214273,0.0013121589,0.002660203,0.0006031699,0.0016032966,0.002000201,0.0010925548,0.0077558453],"category_scores_gemma":[0.007802241,0.0005484222,0.0006482398,0.004086678,0.0013080948,0.0053473325,0.0027307668,0.0027586808,0.0027757764],"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.00009517225,0.000030991516,0.0010440378,0.00075275206,0.00006153602,0.000058097183,0.000110831716,0.020433808,0.0044338377,0.58319515,0.011237471,0.37854627],"study_design_scores_gemma":[0.000026332891,0.00007039705,0.0016892055,0.0002443361,0.00006496082,0.00043090965,0.00011773389,0.08267736,0.0060301083,0.7241226,0.18446541,0.000060613984],"about_ca_topic_score_codex":0.0010982685,"about_ca_topic_score_gemma":0.0009963613,"teacher_disagreement_score":0.0077558453,"about_ca_system_score_codex":0.0020051054,"about_ca_system_score_gemma":0.00075568317,"threshold_uncertainty_score":0.025945902},"labels":[],"label_agreement":null},{"id":"W1519624057","doi":"10.1007/978-3-540-87603-8_31","title":"Dynamic Resource Configuration & Management for Distributed Information Fusion in Maritime Surveillance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Focus (optics); Resource (disambiguation); Architecture; Set (abstract data type); Sensor fusion; Volume (thermodynamics); Resource management (computing); Multitude; Computer network; Artificial intelligence; Database","score_opus":0.010485194834694182,"score_gpt":0.22616071719096983,"score_spread":0.21567552235627566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519624057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046318017,0.0023799182,0.94246316,0.0006806999,0.00015387699,0.00008066666,0.00009688726,0.0011064045,0.0067204204],"genre_scores_gemma":[0.9272736,0.0005382857,0.06993032,0.00008239636,0.000097582786,0.000057117526,0.00007940987,0.00005294329,0.0018883743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994654,0.00012716504,0.000042258394,0.0001395588,0.0001238281,0.00010184103],"domain_scores_gemma":[0.99948007,0.00023619307,0.00006368306,0.00008533634,0.000097641256,0.00003715649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013103393,0.00060196815,0.0011078629,0.0006187957,0.0010064173,0.0018625055,0.0015618898,0.0007910591,0.0021502196],"category_scores_gemma":[0.0019524503,0.00033999683,0.00034675558,0.000803219,0.00069105136,0.0031292231,0.0013892091,0.00097357953,0.00035368316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043161077,0.00019317164,0.0010748527,0.0001362984,0.00008363958,0.00017250252,0.00034370032,0.54410946,0.024902508,0.022686029,0.0060415356,0.39982474],"study_design_scores_gemma":[0.0000136179115,0.000045720888,0.0003634404,0.000011366023,0.000022563072,0.000057935962,0.00007395276,0.97968984,0.0050904895,0.012917958,0.0016941804,0.000018902598],"about_ca_topic_score_codex":0.0036266064,"about_ca_topic_score_gemma":0.0047086542,"teacher_disagreement_score":0.0036266064,"about_ca_system_score_codex":0.00096493546,"about_ca_system_score_gemma":0.0007501824,"threshold_uncertainty_score":0.0072110295},"labels":[],"label_agreement":null},{"id":"W1519642919","doi":"10.1007/978-3-540-30211-7_58","title":"A Nearest-Neighbor Method for Resolving PP-Attachment Ambiguity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":30,"is_retracted":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":"Pointwise; Pointwise mutual information; Cosine similarity; k-nearest neighbors algorithm; Ambiguity; Similarity (geometry); Computer science; Phrase; Artificial intelligence; Task (project management); Trigonometric functions; Word (group theory); Similarity measure; Pattern recognition (psychology); Natural language processing; Algorithm; Mathematics; Mutual information; Image (mathematics); Engineering","score_opus":0.021031008482158116,"score_gpt":0.3217057140259904,"score_spread":0.3006747055438323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519642919","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.008211653,0.00046610375,0.98217195,0.00013950453,0.00028033718,0.00013195143,0.00042446048,0.0030366867,0.005137422],"genre_scores_gemma":[0.066847675,0.00029154995,0.9186531,0.00014875414,0.00014411286,0.00011387476,0.0015490513,0.00067202456,0.011579888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981206,0.00031774,0.0001264009,0.0004462794,0.0008447027,0.00014437115],"domain_scores_gemma":[0.9977914,0.0005636287,0.000094007744,0.00061169476,0.0008633413,0.0000759911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015406719,0.0009579175,0.0013334887,0.002634365,0.0018766408,0.0019398385,0.003114798,0.0020228627,0.013926234],"category_scores_gemma":[0.006155824,0.00070327404,0.0011994067,0.003351637,0.00059190916,0.0032146669,0.0021001927,0.0015626127,0.0073628454],"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.00022068869,0.00015789595,0.00085440726,0.00014836784,0.00005795348,0.00018824657,0.0002114883,0.009751451,0.009175845,0.017811542,0.018575907,0.9428462],"study_design_scores_gemma":[0.00008389096,0.00009249919,0.0014762346,0.000060783364,0.00014727814,0.0008752204,0.00041348475,0.86134094,0.019641241,0.07146075,0.04429098,0.000116677074],"about_ca_topic_score_codex":0.0066668564,"about_ca_topic_score_gemma":0.013130506,"teacher_disagreement_score":0.013926234,"about_ca_system_score_codex":0.00055429817,"about_ca_system_score_gemma":0.0013894935,"threshold_uncertainty_score":0.046587884},"labels":[],"label_agreement":null},{"id":"W1519655831","doi":"10.1007/11523468_84","title":"A Better Approximation Ratio for the Vertex Cover Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); Combinatorics; Vertex cover; Mathematics; Relaxation (psychology); Vertex (graph theory); Binary logarithm; Approximation algorithm; Discrete mathematics; Graph","score_opus":0.021028523623075977,"score_gpt":0.24140401726281083,"score_spread":0.22037549363973485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519655831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19755188,0.030024748,0.59386426,0.028803205,0.007434312,0.00061658653,0.0039090905,0.009596889,0.12819907],"genre_scores_gemma":[0.52712166,0.006783166,0.4115467,0.006125395,0.0062723686,0.0006471101,0.0051065604,0.0044603655,0.031936757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874227,0.0038843362,0.00045657085,0.0023632578,0.003751588,0.0021215351],"domain_scores_gemma":[0.96862555,0.019054975,0.00095751527,0.008265772,0.0016703587,0.0014259306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006981922,0.004456515,0.005215267,0.0037794076,0.002350057,0.009643315,0.008944208,0.007045251,0.034346968],"category_scores_gemma":[0.036467727,0.0015613448,0.0042494047,0.0075955614,0.0027174887,0.020591574,0.005182549,0.010167603,0.006915081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073983986,0.0024521905,0.0031366774,0.0015770219,0.00060244196,0.0004372121,0.0005363638,0.16777481,0.022110326,0.1960667,0.14268757,0.45522028],"study_design_scores_gemma":[0.0009878601,0.0006145087,0.0016340689,0.00021766587,0.0005179066,0.0011648366,0.00023641439,0.6637163,0.008259487,0.29573226,0.026776873,0.00014176073],"about_ca_topic_score_codex":0.003925802,"about_ca_topic_score_gemma":0.004193768,"teacher_disagreement_score":0.034346968,"about_ca_system_score_codex":0.007400372,"about_ca_system_score_gemma":0.0037235958,"threshold_uncertainty_score":0.11490208},"labels":[],"label_agreement":null},{"id":"W1519698372","doi":"10.1007/978-3-642-30779-9_33","title":"Reaching Analysis of Wheelchair Users Using Motion Planning Methods","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"York University","funders":"","keywords":"Wheelchair; Computer science; Planner; Motion planning; Task (project management); Point (geometry); Human–computer interaction; Tree traversal; Path (computing); Simulation; Robot; Artificial intelligence; Engineering; Algorithm","score_opus":0.06449479351257076,"score_gpt":0.34333604162773856,"score_spread":0.2788412481151678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519698372","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.31656075,0.0007475082,0.6751282,0.00013749592,0.000021989406,0.00011981634,0.0002707343,0.00081184175,0.006201667],"genre_scores_gemma":[0.95793927,0.00023945725,0.038493864,0.000011415317,0.0000073418705,0.00008790945,0.00016226349,0.000058965834,0.0029995728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992,0.000022961183,0.0000043003374,0.000015180266,0.000026607588,0.000010952513],"domain_scores_gemma":[0.99980205,0.00013272054,0.000013996034,0.000009548527,0.000032935335,0.000008889068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001923364,0.00047872923,0.0005305206,0.00056027324,0.00023412511,0.0003612698,0.00034310928,0.00034694537,0.0024858639],"category_scores_gemma":[0.00074377377,0.00022092737,0.00047331103,0.00039428272,0.00017376618,0.00030204185,0.00030965873,0.00021567287,0.00023686167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042635464,0.00006798612,0.0024380144,0.00020154555,0.0000873218,0.00016901238,0.00016199567,0.82324445,0.022810616,0.004120424,0.0010398926,0.14523236],"study_design_scores_gemma":[0.0000045389747,0.000045986697,0.0016965271,0.0000075348944,0.000011833586,0.000031245687,0.00003024597,0.99491227,0.0012414657,0.00185427,0.00015649194,0.000007637197],"about_ca_topic_score_codex":0.00754145,"about_ca_topic_score_gemma":0.0042674686,"teacher_disagreement_score":0.00754145,"about_ca_system_score_codex":0.00024311393,"about_ca_system_score_gemma":0.0004529622,"threshold_uncertainty_score":0.014995098},"labels":[],"label_agreement":null},{"id":"W1519709295","doi":"10.1007/978-3-642-36763-2_25","title":"Kinetic and Stationary Point-Set Embeddability for Plane Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Plane (geometry); Time complexity; Embedding; Graph; Function (biology); Algebraic number; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.016842775682434828,"score_gpt":0.2504623982825729,"score_spread":0.23361962260013805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519709295","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.4205699,0.0017448193,0.45317817,0.0012420822,0.00024869104,0.00010494446,0.00070585235,0.0004095437,0.12179606],"genre_scores_gemma":[0.9187113,0.0016935265,0.035911474,0.00015131869,0.0002358144,0.00011257433,0.0008535856,0.000333779,0.041996572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997687,0.00003751503,0.000012902177,0.000057266527,0.00008939912,0.000034303317],"domain_scores_gemma":[0.9992842,0.00033532304,0.00010637445,0.000102407845,0.00008028416,0.00009137924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002605968,0.0006904267,0.0006565981,0.0015309055,0.00071545533,0.001889383,0.0011975431,0.00091934035,0.007534027],"category_scores_gemma":[0.0017716325,0.00048988115,0.00074846833,0.0010232832,0.0017203195,0.0028649075,0.0014059846,0.0023082988,0.0010122263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003566344,0.000021766222,0.00019174737,0.000070876406,0.000009131986,0.00008336377,0.00021609805,0.0108218,0.0025196823,0.9751012,0.0012962348,0.009632524],"study_design_scores_gemma":[0.000011776196,0.00001633437,0.000188362,0.000015596239,0.000006458185,0.00011743857,0.000095667005,0.030038316,0.00084297516,0.96655434,0.0021020407,0.000010630174],"about_ca_topic_score_codex":0.0006467745,"about_ca_topic_score_gemma":0.0005364494,"teacher_disagreement_score":0.007534027,"about_ca_system_score_codex":0.00058505684,"about_ca_system_score_gemma":0.00020191082,"threshold_uncertainty_score":0.025203824},"labels":[],"label_agreement":null},{"id":"W1519712624","doi":"10.1007/978-3-540-89639-5_26","title":"A Continuous Labeling for Multiphase Graph Cut Image Partitioning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"General Electric (Canada); Institut National de la Recherche Scientifique","funders":"","keywords":"Cut; Graph partition; Computer science; Iterated function; Piecewise; Graph; Maximum cut; Partition (number theory); Minimum cut; Segmentation; Image (mathematics); Image segmentation; Artificial intelligence; Algorithm; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.02123429327167649,"score_gpt":0.2865642261312774,"score_spread":0.26532993285960094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519712624","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.0017449134,0.00007571343,0.9960758,0.00004034435,0.000021785285,0.00006334758,0.0001063718,0.0006293011,0.0012422771],"genre_scores_gemma":[0.021570422,0.00009555531,0.97581065,0.00003345735,0.000024040124,0.00013056154,0.0003805204,0.0003305383,0.0016242822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930596,0.00013247062,0.00004001863,0.00019335613,0.00028230145,0.00004587467],"domain_scores_gemma":[0.99873644,0.00041500526,0.000074734286,0.00038295664,0.0003129678,0.000077776465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065668474,0.0008832407,0.0010311778,0.0016324734,0.0007191995,0.0016918635,0.0023022701,0.0014577459,0.008956381],"category_scores_gemma":[0.002310206,0.00082038343,0.0008805916,0.0022002617,0.0009993246,0.0016459463,0.0017294679,0.0020268383,0.0027265276],"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.00028793208,0.00021975127,0.0004184023,0.0005094,0.00004098157,0.00013335262,0.00025711744,0.10958101,0.042779114,0.06723188,0.0135525,0.7649886],"study_design_scores_gemma":[0.000049331582,0.00013644184,0.0003791009,0.00007008904,0.000027769373,0.00024870323,0.00007004935,0.9224286,0.014452193,0.04466086,0.017440189,0.000036662004],"about_ca_topic_score_codex":0.0029355437,"about_ca_topic_score_gemma":0.0036374656,"teacher_disagreement_score":0.008956381,"about_ca_system_score_codex":0.00084881164,"about_ca_system_score_gemma":0.00094603765,"threshold_uncertainty_score":0.029962063},"labels":[],"label_agreement":null},{"id":"W1519779293","doi":"10.1007/978-3-540-75336-0_6","title":"An Algorithmic Theory of Mobile Agents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Carleton University","funders":"","keywords":"Mobile agent; Computer science; Distributed computing; Node (physics); Simple (philosophy); Extension (predicate logic); Fault tolerance; Mobile computing; Mainstream; Computer network; Engineering","score_opus":0.022275208424826207,"score_gpt":0.26823614155358527,"score_spread":0.24596093312875905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519779293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011068712,0.0045811883,0.8713432,0.0043949033,0.0004170969,0.00007996038,0.00017986093,0.00022345044,0.1077116],"genre_scores_gemma":[0.5152273,0.008252363,0.3999205,0.0015998264,0.0014671594,0.0006903236,0.0007719138,0.0002284011,0.07184226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987018,0.0004909101,0.00007779795,0.00019843018,0.00039069325,0.00014040766],"domain_scores_gemma":[0.9981135,0.0011174454,0.00013466494,0.00027512576,0.0002391474,0.00012006912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013554229,0.0009078489,0.0008644966,0.0016944774,0.0019027268,0.0052319355,0.0020964264,0.0022175605,0.008510582],"category_scores_gemma":[0.0050494396,0.00080911414,0.001566005,0.0021100112,0.004360796,0.008603919,0.0031164598,0.0037145126,0.001581055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021419773,0.000002881488,0.000025962718,0.000014672363,0.0000025235388,0.000009474255,0.00004229009,0.0012396963,0.00003379766,0.99527943,0.0007404576,0.0026067565],"study_design_scores_gemma":[0.0000039467673,0.0000032957867,0.00001927562,0.000011157458,0.0000030826407,0.00002299223,0.000022531378,0.0072255735,0.000029378893,0.98607695,0.006579032,0.0000027074254],"about_ca_topic_score_codex":0.0013073512,"about_ca_topic_score_gemma":0.0011285272,"teacher_disagreement_score":0.008510582,"about_ca_system_score_codex":0.0019840363,"about_ca_system_score_gemma":0.0011103732,"threshold_uncertainty_score":0.028470755},"labels":[],"label_agreement":null},{"id":"W1519845352","doi":"10.1007/3-540-47922-8_12","title":"Using Communicative Acts to Plan the Cinematographic Structure of Animations","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","field":"Engineering","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":"Western University","funders":"","keywords":"Cinematography; Animation; Computer science; Planner; Computer animation; Rhetorical question; Multimedia; Human–computer interaction; Computer graphics (images); Artificial intelligence; Visual arts; Art","score_opus":0.055956537543119855,"score_gpt":0.2880261279532211,"score_spread":0.23206959041010122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519845352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03881815,0.0003653692,0.8888475,0.0006377961,0.00016844065,0.00025679625,0.00013888544,0.003166822,0.06760034],"genre_scores_gemma":[0.5228829,0.00035107954,0.45798415,0.000103210004,0.000054038246,0.00031812696,0.00031156026,0.0006776793,0.017317293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.0003505329,0.000024336308,0.00007508818,0.000110560206,0.000040317187],"domain_scores_gemma":[0.99817777,0.0011004142,0.00011862178,0.00025114985,0.00021112524,0.00014095622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010185402,0.0007599526,0.00023661292,0.00091709895,0.0010996216,0.0027663708,0.0010687965,0.000994891,0.01102242],"category_scores_gemma":[0.007510097,0.000642006,0.0004443039,0.00055214384,0.0012867275,0.0026898447,0.0014307145,0.001356243,0.0016962311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049477717,0.00015441512,0.0015527894,0.00048344498,0.000049295755,0.00045981092,0.013865011,0.037404884,0.0692973,0.46420512,0.014792803,0.3972404],"study_design_scores_gemma":[0.00021310104,0.000323778,0.0031565272,0.00038629255,0.00014055135,0.00047482067,0.0051464457,0.51832205,0.06753977,0.26281226,0.14133075,0.00015368141],"about_ca_topic_score_codex":0.0019479592,"about_ca_topic_score_gemma":0.0026745382,"teacher_disagreement_score":0.01102242,"about_ca_system_score_codex":0.00059910485,"about_ca_system_score_gemma":0.00065691763,"threshold_uncertainty_score":0.03687364},"labels":[],"label_agreement":null},{"id":"W1519891470","doi":"10.1007/0-387-34805-0_32","title":"On Key Distribution Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Adversary; Concrete security; Computer science; Construct (python library); Key (lock); Mathematics; Distribution (mathematics); Function (biology); Theoretical computer science; Computer security; Computer security model; Discrete mathematics; Computer network","score_opus":0.018830238362220638,"score_gpt":0.24870287496624863,"score_spread":0.22987263660402799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519891470","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.015804509,0.011332025,0.65222096,0.0061002164,0.0031778587,0.0002624748,0.00044723594,0.001066277,0.30958843],"genre_scores_gemma":[0.55004466,0.016370086,0.13534221,0.0023296662,0.0028011128,0.0007783671,0.0013446843,0.0007469253,0.29024225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989655,0.00030381375,0.00004997864,0.00019003694,0.00034756464,0.00014306352],"domain_scores_gemma":[0.99897075,0.00037199445,0.000047006295,0.0004333652,0.00013520053,0.00004168457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083721476,0.0008932052,0.00077938725,0.001033589,0.0015069377,0.0030648047,0.001036458,0.0011408753,0.02507168],"category_scores_gemma":[0.0030771918,0.0004728925,0.00043815916,0.0019565783,0.001979732,0.0067008855,0.0032286625,0.0025680745,0.006585019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043638396,0.000017159133,0.0000727971,0.00006788976,0.0000071253626,0.000031853302,0.00009511335,0.0015393608,0.00073359,0.9246659,0.01454512,0.058180355],"study_design_scores_gemma":[0.000016382965,0.000023844073,0.00009461268,0.000046374924,0.000009779366,0.00014554651,0.000045889137,0.009248615,0.0010386613,0.915651,0.07366956,0.000009722613],"about_ca_topic_score_codex":0.00042587463,"about_ca_topic_score_gemma":0.0003488132,"teacher_disagreement_score":0.02507168,"about_ca_system_score_codex":0.0015840327,"about_ca_system_score_gemma":0.0007974439,"threshold_uncertainty_score":0.08387315},"labels":[],"label_agreement":null},{"id":"W1520065212","doi":"10.1007/11871842_16","title":"Evaluating Misclassifications in Imbalanced Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Receiver operating characteristic; Classifier (UML); Artificial intelligence; Confidence interval; Pattern recognition (psychology); Class (philosophy); Computer science; Machine learning; Statistics; Mathematics","score_opus":0.0892702449882283,"score_gpt":0.3475017225279319,"score_spread":0.25823147753970355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520065212","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.529768,0.0050807106,0.4555252,0.0010224128,0.0010795712,0.00032996273,0.0013516233,0.0026957241,0.0031468228],"genre_scores_gemma":[0.8202128,0.0010248685,0.17006582,0.00027820753,0.0005135563,0.00019178304,0.003432696,0.00042378355,0.0038565458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98928905,0.0033199785,0.0010318718,0.0018714487,0.0040150066,0.00047262],"domain_scores_gemma":[0.92711407,0.05777975,0.0032856378,0.0042994292,0.0062924754,0.0012285257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015085495,0.001705259,0.0024788256,0.0050409995,0.00087730185,0.0028606006,0.002375678,0.0026632359,0.0013505972],"category_scores_gemma":[0.055333078,0.0006148967,0.0010575509,0.0027460507,0.0011400111,0.0042529064,0.0020668663,0.0017737994,0.0007255777],"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.002040528,0.0006458428,0.10520302,0.0005408313,0.00074176287,0.0005258707,0.0005088638,0.14462143,0.005829673,0.003263601,0.012992651,0.72308594],"study_design_scores_gemma":[0.000052662963,0.00038153038,0.016398342,0.00009280468,0.00018524198,0.0005143589,0.0003591162,0.9565991,0.010941193,0.012446307,0.0019887015,0.00004064146],"about_ca_topic_score_codex":0.0023776656,"about_ca_topic_score_gemma":0.0029209657,"teacher_disagreement_score":0.015085495,"about_ca_system_score_codex":0.0012618774,"about_ca_system_score_gemma":0.00083235546,"threshold_uncertainty_score":0.07978064},"labels":[],"label_agreement":null},{"id":"W1520227725","doi":"10.1007/978-3-642-15317-4_11","title":"Threshold Attribute-Based Signcryption","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":96,"is_retracted":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":"Signcryption; Computer science; Communication source; Ciphertext; Smart card; Digital signature; Scheme (mathematics); Computer security; Standard Model (mathematical formulation); Theoretical computer science; Non-repudiation; Property (philosophy); Encryption; Computer network; Public-key cryptography; Mathematics","score_opus":0.018028599068222132,"score_gpt":0.2400219214272223,"score_spread":0.22199332235900018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520227725","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.059827324,0.0015149204,0.8828785,0.00086543366,0.0006904944,0.00021467175,0.00035216523,0.00300233,0.050654177],"genre_scores_gemma":[0.8251042,0.001361214,0.12966093,0.00034957784,0.00023924318,0.00013582535,0.0005482366,0.00028792754,0.04231294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782723,0.00025333065,0.00017068439,0.0002833083,0.0011280373,0.0003373716],"domain_scores_gemma":[0.9978109,0.00052034005,0.00012834645,0.0010475102,0.00036396278,0.00012895573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126773,0.00047833283,0.0010902378,0.0008135503,0.000727869,0.0032260949,0.0011746936,0.0009875497,0.0075036637],"category_scores_gemma":[0.0034441557,0.0003170732,0.00052761345,0.0017848951,0.0017780741,0.005313415,0.003365779,0.0026334082,0.0036102263],"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.00074348075,0.0001862691,0.0004415901,0.00027048052,0.00004751984,0.00013784827,0.00031504937,0.013685673,0.040669415,0.6834602,0.01049672,0.24954572],"study_design_scores_gemma":[0.00018352729,0.00040853053,0.0006333101,0.00011256071,0.000092960276,0.0010445294,0.00012289353,0.20378746,0.1193634,0.6224582,0.05167398,0.000118575736],"about_ca_topic_score_codex":0.00022149348,"about_ca_topic_score_gemma":0.00018900208,"teacher_disagreement_score":0.0075036637,"about_ca_system_score_codex":0.0008858977,"about_ca_system_score_gemma":0.000874476,"threshold_uncertainty_score":0.025102258},"labels":[],"label_agreement":null},{"id":"W1520239859","doi":"10.1007/978-3-642-13553-8_10","title":"The Impact of Naive Agents in Heterogeneous Trust-Aware Societies","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Computer science; Reputation; Witness; Order (exchange); Set (abstract data type); Compromise; Computer security; Autonomous agent; Artificial intelligence; Business; Political science","score_opus":0.014990810135448436,"score_gpt":0.2696368555642339,"score_spread":0.25464604542878544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520239859","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.8946792,0.0010556941,0.040916055,0.003260146,0.00017953585,0.00006951665,0.000118228345,0.00015994586,0.059561726],"genre_scores_gemma":[0.9969566,0.00012003418,0.0012616221,0.000041393472,0.000025601075,0.0000074992104,0.000015366792,0.000011793146,0.001560124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977062,0.0013720454,0.00006348722,0.0002107787,0.00030609214,0.00034135766],"domain_scores_gemma":[0.9671473,0.025130711,0.0013343303,0.0029149414,0.001620089,0.0018526798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038955386,0.00055,0.00094963005,0.0005747221,0.0016950163,0.0031304846,0.0013295962,0.0020443741,0.008843893],"category_scores_gemma":[0.03458577,0.00046283496,0.00054107246,0.0005952808,0.0027089538,0.007242199,0.0023078104,0.0018081393,0.0004501087],"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.002408193,0.0005520425,0.0062518413,0.0003258342,0.00021301013,0.00080247904,0.0013913857,0.413629,0.006250384,0.5014981,0.005967574,0.06071025],"study_design_scores_gemma":[0.00018078611,0.0003551326,0.0030820267,0.00003741421,0.00012718533,0.0001544141,0.0010295343,0.52708995,0.0013048996,0.4650448,0.0015488184,0.000045001518],"about_ca_topic_score_codex":0.0029438566,"about_ca_topic_score_gemma":0.0023435683,"teacher_disagreement_score":0.008843893,"about_ca_system_score_codex":0.0014452086,"about_ca_system_score_gemma":0.00083712384,"threshold_uncertainty_score":0.029585779},"labels":[],"label_agreement":null},{"id":"W1520242730","doi":"10.1007/978-3-642-04592-9_87","title":"Self-calibration and Image Rendering Using RBF Neural Network","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Rendering (computer graphics); Artificial intelligence; Computer vision; Artificial neural network; Virtual image; Radial basis function; Computer graphics (images)","score_opus":0.021260920575901426,"score_gpt":0.2719101118483037,"score_spread":0.25064919127240226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520242730","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.008305009,0.00011392178,0.9884775,0.00006453514,0.000045135104,0.000016184935,0.000017873519,0.0010964521,0.0018632469],"genre_scores_gemma":[0.25151768,0.00027287996,0.7418377,0.00006557641,0.000037301543,0.00003482202,0.00007976611,0.00066430634,0.005489928],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996686,0.000074325406,0.000013619789,0.000060074588,0.00015714772,0.000026244068],"domain_scores_gemma":[0.99947375,0.0001699173,0.00004316828,0.00016326706,0.00012811263,0.00002188165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923268,0.0005723919,0.0006967584,0.0005150263,0.00029425073,0.0009062777,0.0007928439,0.0009570714,0.0054990062],"category_scores_gemma":[0.0017411801,0.0005111392,0.0007221702,0.0007035117,0.00039310294,0.0010548594,0.0011245694,0.001280884,0.00095477444],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037830777,0.00009264264,0.000598537,0.00018627968,0.00007641644,0.00016073528,0.00031146777,0.2635098,0.10963457,0.02288163,0.0041839583,0.5979857],"study_design_scores_gemma":[0.000009699456,0.00002024415,0.00020234085,0.00001030216,0.000009899245,0.00008676419,0.000013978651,0.975211,0.019898005,0.0021907368,0.0023302964,0.000016613267],"about_ca_topic_score_codex":0.0020816203,"about_ca_topic_score_gemma":0.0018012654,"teacher_disagreement_score":0.0054990062,"about_ca_system_score_codex":0.00048271695,"about_ca_system_score_gemma":0.00039646216,"threshold_uncertainty_score":0.01839602},"labels":[],"label_agreement":null},{"id":"W1520256545","doi":"10.1007/11922155_3","title":"Automatic Generation of Search Engines","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Tree (set theory); Task (project management); Search tree; Beam search; Search engine; Search algorithm; Domain (mathematical analysis); Selection (genetic algorithm); Incremental heuristic search; Function (biology); Depth-first search; Machine learning; Data mining; Information retrieval; Artificial intelligence; Algorithm","score_opus":0.0445269752488981,"score_gpt":0.2853629682350087,"score_spread":0.24083599298611058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520256545","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.16371071,0.002371368,0.75456,0.0008896151,0.00044578747,0.0008548608,0.0056726346,0.0437232,0.027771834],"genre_scores_gemma":[0.43648452,0.0005884791,0.5326676,0.00022521663,0.00010205016,0.00034811816,0.0150090465,0.0016610504,0.012914025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994854,0.00012106972,0.00003912122,0.00011249652,0.00017542615,0.00006654503],"domain_scores_gemma":[0.99880934,0.00056312344,0.000053070133,0.00021554061,0.00031523407,0.000043608823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538685,0.0006795213,0.000873044,0.0017153397,0.0005292698,0.0012696293,0.0014137991,0.00090135867,0.0076372065],"category_scores_gemma":[0.0033404357,0.0005539657,0.000935053,0.0015080593,0.00040535792,0.0014197269,0.0009883497,0.00064509874,0.0030378683],"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.00072028756,0.0004576311,0.0033442078,0.0009237093,0.00017713927,0.00075904175,0.00027697923,0.058623135,0.04834219,0.03597728,0.057231408,0.793167],"study_design_scores_gemma":[0.000190755,0.00021429131,0.0013581325,0.00007668875,0.00016425147,0.00060564326,0.00013206966,0.8899524,0.04732603,0.033878647,0.026061388,0.000039535742],"about_ca_topic_score_codex":0.0015664643,"about_ca_topic_score_gemma":0.003116423,"teacher_disagreement_score":0.0076372065,"about_ca_system_score_codex":0.0005689746,"about_ca_system_score_gemma":0.000984261,"threshold_uncertainty_score":0.025548995},"labels":[],"label_agreement":null},{"id":"W1520277093","doi":"10.1007/978-3-540-32256-6_62","title":"ITAS and the Reverse RoboCup Challenge","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Robotics; Usability; Reverse engineering; Robot; Human–computer interaction; Software engineering; Operating system","score_opus":0.0249796114300971,"score_gpt":0.2428174508491942,"score_spread":0.2178378394190971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520277093","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06850787,0.019549437,0.17332493,0.04793331,0.006146797,0.00015247137,0.0012707184,0.004909156,0.6782054],"genre_scores_gemma":[0.6138684,0.010762654,0.071921565,0.0041884426,0.0022060324,0.00026614944,0.0029694021,0.0022152308,0.29160205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987399,0.00033462222,0.00004189055,0.00016735667,0.0004929,0.00022328006],"domain_scores_gemma":[0.9981811,0.0008017233,0.00007017884,0.0003800202,0.00036864867,0.00019838176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019868521,0.00078750495,0.00076022063,0.00069663586,0.0022681863,0.003792104,0.0018764195,0.002550596,0.029395651],"category_scores_gemma":[0.0055467994,0.0003743491,0.0006845219,0.00074945786,0.002626279,0.0047059846,0.004365884,0.0036366691,0.009985964],"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.00048686285,0.00009572345,0.0006066293,0.00047546046,0.000042763902,0.00040273357,0.0010134623,0.009947179,0.0029429628,0.39417008,0.2334928,0.35632336],"study_design_scores_gemma":[0.000049658956,0.00010643867,0.000739935,0.00022318024,0.000030906074,0.0007238491,0.0016421742,0.024528593,0.0031975515,0.3208861,0.64782083,0.00005081322],"about_ca_topic_score_codex":0.004984246,"about_ca_topic_score_gemma":0.007918772,"teacher_disagreement_score":0.029395651,"about_ca_system_score_codex":0.0008414769,"about_ca_system_score_gemma":0.0011498256,"threshold_uncertainty_score":0.09833819},"labels":[],"label_agreement":null},{"id":"W1520313186","doi":"10.1007/11951148_3","title":"Distributed Real-Time Behavioral Requirements Modeling Using Extended UML/SPT","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Unified Modeling Language; Applications of UML; Metamodeling; UML tool; Multicast; Object Constraint Language; Programming language; Distributed computing; Software engineering","score_opus":0.04286639057937804,"score_gpt":0.29493897738650726,"score_spread":0.25207258680712924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520313186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037398199,0.000027231807,0.99244577,0.00006349658,0.00001375164,0.000113252456,0.0001387193,0.0014802273,0.001977646],"genre_scores_gemma":[0.17194965,0.00017403094,0.8202802,0.00009279906,0.000024812573,0.00059936295,0.0009352958,0.00077286846,0.0051709483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976743,0.00075426453,0.0002660992,0.000289464,0.00087370054,0.000142232],"domain_scores_gemma":[0.99600995,0.0018841581,0.00043726576,0.00086288917,0.0007084904,0.000097243064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025255182,0.0011648312,0.00068083784,0.0009860501,0.00046240122,0.0019913085,0.0023308971,0.0009620704,0.0045332536],"category_scores_gemma":[0.005260702,0.0011034643,0.002172144,0.0005947222,0.00072587957,0.0021338633,0.0014080441,0.0017012706,0.0015980783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022424804,0.00022597388,0.0015668246,0.0005710684,0.00015240397,0.0011787907,0.0012276863,0.7141377,0.03811615,0.103146575,0.00400188,0.13545074],"study_design_scores_gemma":[0.000048517933,0.000046596273,0.00017931643,0.00005370845,0.000054264437,0.00020044831,0.00006306857,0.95808893,0.010337693,0.018643511,0.012260583,0.000023410645],"about_ca_topic_score_codex":0.004186629,"about_ca_topic_score_gemma":0.00483012,"teacher_disagreement_score":0.0045332536,"about_ca_system_score_codex":0.0008963925,"about_ca_system_score_gemma":0.0018481534,"threshold_uncertainty_score":0.015165269},"labels":[],"label_agreement":null},{"id":"W1520324981","doi":"10.1007/11430230_8","title":"Multiplexing of Partially Ordered Events","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Computer Research Institute of Montréal; McGill University","funders":"","keywords":"Multiplexer; Merge (version control); Computer science; Multiplexing; TRACE (psycholinguistics); Distributed computing; Code (set theory); Algorithm; Theoretical computer science; Parallel computing; Programming language; Telecommunications","score_opus":0.02697436365411322,"score_gpt":0.2704738527400422,"score_spread":0.243499489085929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520324981","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.06517746,0.0003746071,0.91286874,0.00012180398,0.00028223536,0.0000909713,0.00022077761,0.003107393,0.017756036],"genre_scores_gemma":[0.7781036,0.0004436951,0.19972111,0.00013861195,0.00025471358,0.00012857368,0.0004998127,0.0005325725,0.020177407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985958,0.0002280543,0.00009631907,0.00030246767,0.0005183658,0.00025912272],"domain_scores_gemma":[0.9968305,0.001315547,0.00025842155,0.0008632423,0.00038661997,0.00034560214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011023076,0.0010074242,0.00081675244,0.0014839069,0.0008396359,0.0021410608,0.0010640464,0.00051274424,0.009774668],"category_scores_gemma":[0.0046874834,0.0006495905,0.00066723087,0.0011264038,0.00069779635,0.0037882242,0.0020088807,0.0011117735,0.0014945925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001535057,0.00026905883,0.0022759687,0.0002561454,0.00010017597,0.0010448544,0.00042425893,0.029470323,0.07065551,0.61893106,0.004770224,0.2702673],"study_design_scores_gemma":[0.000088734545,0.00046407196,0.0012382808,0.00008092181,0.00015877285,0.0013379167,0.00019257411,0.30901024,0.113613665,0.54564285,0.02804214,0.00012986276],"about_ca_topic_score_codex":0.00037225743,"about_ca_topic_score_gemma":0.00046302576,"teacher_disagreement_score":0.009774668,"about_ca_system_score_codex":0.000512785,"about_ca_system_score_gemma":0.0005787649,"threshold_uncertainty_score":0.032699466},"labels":[],"label_agreement":null},{"id":"W1520330405","doi":"10.1007/978-3-642-10467-1_97","title":"Color Space Transformation from RGB to CIELAB Using Neural Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; RGB color model; Artificial neural network; Color space; Artificial intelligence; Transformation (genetics); Computer vision; Backpropagation; MATLAB; ICC profile; Set (abstract data type); Data set; Pattern recognition (psychology); Computer graphics (images); Color model; Image (mathematics)","score_opus":0.014780316321762956,"score_gpt":0.2540545434023325,"score_spread":0.23927422708056956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520330405","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.009653483,0.0002735076,0.97773325,0.00010817689,0.00021286985,0.000059346974,0.00025048613,0.004055671,0.0076532797],"genre_scores_gemma":[0.18743232,0.00079697336,0.7905157,0.00014583021,0.0000584592,0.00010579367,0.0009942481,0.0009563433,0.018994275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987125,0.000010189827,0.0000054706097,0.000040465537,0.000055615445,0.00001695344],"domain_scores_gemma":[0.9998392,0.000016029111,0.00000840886,0.00003590113,0.00009084479,0.000009562459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019012559,0.0005512131,0.00034803446,0.0007937869,0.00038429812,0.0009794986,0.0007882498,0.00029495967,0.0090539595],"category_scores_gemma":[0.00058302,0.00026373673,0.00061206147,0.0012700296,0.00028036383,0.0007455599,0.0005934805,0.00089838303,0.0027974118],"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.00013820177,0.000066589215,0.00058425835,0.0001440544,0.000054242842,0.0000647025,0.000064854095,0.046975803,0.07077742,0.013013015,0.0111064715,0.8570104],"study_design_scores_gemma":[0.000016711714,0.000052268384,0.0017434445,0.00004771788,0.000048482318,0.00019159664,0.000060652503,0.8499546,0.104186185,0.0097043775,0.033939365,0.00005464958],"about_ca_topic_score_codex":0.010022423,"about_ca_topic_score_gemma":0.010899114,"teacher_disagreement_score":0.010022423,"about_ca_system_score_codex":0.00065519783,"about_ca_system_score_gemma":0.0006255139,"threshold_uncertainty_score":0.030288458},"labels":[],"label_agreement":null},{"id":"W1520425575","doi":"10.1007/978-3-540-73451-2_37","title":"Rough Set Approach to Spam Filter Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Heuristics; Rough set; Focus (optics); Filter (signal processing); Set (abstract data type); Construct (python library); Decision table; Probabilistic logic; Artificial intelligence; Simple (philosophy); Data mining; Machine learning","score_opus":0.04480794662812257,"score_gpt":0.2649052055672635,"score_spread":0.22009725893914092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520425575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027368967,0.0023815222,0.99254906,0.0003899196,0.00008744581,0.000025550928,0.000047411115,0.00011349975,0.0016686487],"genre_scores_gemma":[0.2553417,0.005557476,0.7305688,0.00036498456,0.00080094195,0.00024417427,0.00032427988,0.00008251234,0.0067151384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775034,0.0009042455,0.0001267929,0.00020382345,0.0009099606,0.00010477124],"domain_scores_gemma":[0.9968905,0.0021836606,0.00014048409,0.000242526,0.0004846883,0.000058147874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027831793,0.00078313646,0.0026702224,0.0023229802,0.0006641504,0.002535214,0.002093936,0.0014742981,0.0015879582],"category_scores_gemma":[0.0072649377,0.00061282876,0.0014480492,0.0019272694,0.001437097,0.0023749492,0.0009947603,0.0022031048,0.00044033106],"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.000113527814,0.00011650158,0.0005742569,0.0005536768,0.00036211644,0.00018674479,0.0003095782,0.34467486,0.0019237406,0.45019966,0.007894703,0.19309059],"study_design_scores_gemma":[0.000017228364,0.0000481076,0.00022607534,0.000037506314,0.000063624786,0.00009055972,0.000035385452,0.60284036,0.00081710453,0.3919225,0.0038680253,0.000033516782],"about_ca_topic_score_codex":0.0022772406,"about_ca_topic_score_gemma":0.001783482,"teacher_disagreement_score":0.0027831793,"about_ca_system_score_codex":0.0016443877,"about_ca_system_score_gemma":0.0009500758,"threshold_uncertainty_score":0.014719009},"labels":[],"label_agreement":null},{"id":"W1520506906","doi":"10.1007/978-3-642-16599-3_10","title":"A Survey of Mashup Development Environments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spreadsheets and End-User Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mashup; Computer science; Personalization; World Wide Web; End-user development; The Internet; Abstraction; Software; End user; Web development; Operating system","score_opus":0.02585192248034851,"score_gpt":0.23505766943049639,"score_spread":0.20920574695014788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520506906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04762432,0.38270676,0.48830795,0.0036983918,0.0005516366,0.00042424578,0.0015753184,0.009421013,0.06569038],"genre_scores_gemma":[0.088216685,0.38242036,0.48928788,0.0015240934,0.00078326784,0.0003944408,0.005222293,0.0026142304,0.029536769],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979115,0.00028853142,0.00020209853,0.00037080084,0.0010564795,0.00017053366],"domain_scores_gemma":[0.9954581,0.002783422,0.00030112936,0.0004937807,0.0006735031,0.00029000617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135394,0.00062186056,0.00081741274,0.0048504984,0.00070724287,0.0030776118,0.0018116159,0.0008550004,0.004814107],"category_scores_gemma":[0.0058020204,0.0010227121,0.00052448513,0.013140055,0.0005084758,0.006613231,0.0013843053,0.0012803138,0.0024330749],"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.00009070822,0.00015836657,0.0013401372,0.0018564743,0.000020650785,0.000073786774,0.00032490026,0.001203008,0.003477361,0.016956132,0.01307314,0.9614254],"study_design_scores_gemma":[0.00003962285,0.00025062027,0.004760003,0.0015265223,0.000049059687,0.0019370379,0.0005295415,0.012595192,0.012599084,0.021554492,0.9440825,0.00007636274],"about_ca_topic_score_codex":0.0008740125,"about_ca_topic_score_gemma":0.0011455984,"teacher_disagreement_score":0.0048504984,"about_ca_system_score_codex":0.0006757301,"about_ca_system_score_gemma":0.0011685375,"threshold_uncertainty_score":0.016104817},"labels":[],"label_agreement":null},{"id":"W1520520259","doi":"10.1007/978-3-540-24851-4_9","title":"Programming with Crosscutting Effective Views","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":31,"is_retracted":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":"Modular programming; Computer science; Modularity (biology); Decomposition; Modular design; Programming language; Object-oriented programming; Software engineering; Theoretical computer science","score_opus":0.026726609972611556,"score_gpt":0.28873823875716326,"score_spread":0.2620116287845517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520520259","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.011199242,0.00016705014,0.9743746,0.00014944418,0.000042161555,0.00003828897,0.00005022025,0.0016388826,0.012340192],"genre_scores_gemma":[0.17749205,0.00045170615,0.8019538,0.00020919861,0.00008096491,0.00012807192,0.00032509415,0.0019301536,0.017428959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848527,0.00034093013,0.00009813995,0.0002334787,0.00068273646,0.00015944625],"domain_scores_gemma":[0.99812,0.00089734973,0.00008299504,0.00062736816,0.00019976232,0.00007246401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014055778,0.000765753,0.0005284333,0.0006648381,0.0004590601,0.0016088624,0.0015063444,0.00077258644,0.0065123998],"category_scores_gemma":[0.003632188,0.0009998254,0.00093390886,0.0010991043,0.0011167603,0.0034128875,0.0025853207,0.0028297228,0.0011031532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009445988,0.00008192788,0.0005326923,0.00033432856,0.000047551075,0.00021591505,0.0006576536,0.012089911,0.010534025,0.6209607,0.007215036,0.34723574],"study_design_scores_gemma":[0.000066489076,0.000113183734,0.00039501235,0.00014520873,0.00011749128,0.00069055334,0.00014073537,0.07992766,0.023659006,0.82670027,0.06800463,0.00003981604],"about_ca_topic_score_codex":0.00049142336,"about_ca_topic_score_gemma":0.0010450652,"teacher_disagreement_score":0.0065123998,"about_ca_system_score_codex":0.00049643376,"about_ca_system_score_gemma":0.00053246145,"threshold_uncertainty_score":0.021786153},"labels":[],"label_agreement":null},{"id":"W1520564042","doi":"10.1007/11795018_22","title":"Using Rule Based Selection to Support Change in Parametric CAD Models","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"Computer science; Software portability; Selection (genetic algorithm); CAD; Parametric statistics; Process (computing); Overhead (engineering); Software engineering; Parametric model; Data mining; Machine learning; Engineering drawing; Programming language; Engineering","score_opus":0.03931853605837703,"score_gpt":0.2507945478257656,"score_spread":0.21147601176738856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520564042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03522741,0.00019583676,0.95474094,0.00007873739,0.0000933791,0.00011905124,0.0001963471,0.0065485593,0.0027996744],"genre_scores_gemma":[0.34818614,0.00020038846,0.6465373,0.00020480354,0.00007299209,0.00013260794,0.0011643165,0.001028927,0.0024724929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754107,0.00034261722,0.00019876458,0.00043174246,0.0013696313,0.00011618639],"domain_scores_gemma":[0.993008,0.0038880405,0.00036289633,0.0013756349,0.0012049736,0.0001603877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001984822,0.00094416115,0.0015045538,0.0021369278,0.0005020105,0.0020170894,0.0025475125,0.0014071447,0.0033094296],"category_scores_gemma":[0.008995579,0.000879537,0.0012283203,0.0017246365,0.00069461623,0.0016263393,0.0014821084,0.0014198932,0.0012620739],"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.00060843414,0.00035163097,0.0029547021,0.00019760689,0.00014673991,0.001238948,0.0003200528,0.11346967,0.04744162,0.006441375,0.005542538,0.82128674],"study_design_scores_gemma":[0.00004067939,0.00010670332,0.00059223117,0.000022340842,0.00007554848,0.0003166116,0.000034297227,0.9709791,0.017729446,0.0052660955,0.0048062378,0.000030626314],"about_ca_topic_score_codex":0.002032595,"about_ca_topic_score_gemma":0.0027848275,"teacher_disagreement_score":0.0033094296,"about_ca_system_score_codex":0.000339697,"about_ca_system_score_gemma":0.0004575806,"threshold_uncertainty_score":0.011071146},"labels":[],"label_agreement":null},{"id":"W1520575325","doi":"10.1007/978-3-642-11447-2_11","title":"JASMine: Accessing Java Code from CoreASM","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Java; Plug-in; Programming language; Code (set theory); Java annotation; Computation; Real time Java; Software engineering; Set (abstract data type)","score_opus":0.028264704222108906,"score_gpt":0.2629989093744674,"score_spread":0.2347342051523585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520575325","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006095223,0.00057379995,0.43009296,0.00048131248,0.00038850802,0.00023410835,0.0056705168,0.5138409,0.042622574],"genre_scores_gemma":[0.10381227,0.0011654951,0.3901062,0.0023973538,0.00028500153,0.0006773283,0.026979286,0.36486802,0.10970903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896693,0.000119797376,0.000093246876,0.00022499313,0.00044588765,0.00014914031],"domain_scores_gemma":[0.99828243,0.00072332536,0.0000829227,0.00048276517,0.0002830208,0.00014559175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013535932,0.001523069,0.0012587245,0.0015399159,0.0007555892,0.0030681954,0.0038546294,0.0014356552,0.058089312],"category_scores_gemma":[0.0048161726,0.0016915785,0.001560918,0.0011294596,0.00089261733,0.0052048704,0.004294655,0.00276625,0.038397785],"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.0011270731,0.00032703666,0.0026968385,0.0014652036,0.00017473247,0.00056944106,0.0010118348,0.0016322954,0.033709448,0.038491286,0.48286822,0.4359265],"study_design_scores_gemma":[0.00061736786,0.00017771768,0.003956779,0.0007079103,0.00020852697,0.0012747126,0.0003912484,0.05527149,0.10971652,0.0800495,0.74729216,0.0003360626],"about_ca_topic_score_codex":0.0017647125,"about_ca_topic_score_gemma":0.0032762836,"teacher_disagreement_score":0.058089312,"about_ca_system_score_codex":0.00067621813,"about_ca_system_score_gemma":0.0014048818,"threshold_uncertainty_score":0.19432813},"labels":[],"label_agreement":null},{"id":"W1520586504","doi":"10.1007/11424918_39","title":"Vocabulary Completion Through Word Cooccurrence Analysis Using Unlabeled Documents for Text Categorization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Vocabulary; Text categorization; Categorization; Classifier (UML); Natural language processing; Artificial intelligence; Word (group theory); Vocabulary learning; Set (abstract data type); Training set; Information retrieval; Machine learning; Linguistics","score_opus":0.03748189831121202,"score_gpt":0.29811954903343774,"score_spread":0.2606376507222257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520586504","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.040212806,0.0014729854,0.9487871,0.00016103464,0.00028040298,0.00042887643,0.0011504182,0.00552063,0.0019857485],"genre_scores_gemma":[0.17704481,0.00091224804,0.80470085,0.00009954569,0.00027578286,0.0006469415,0.00835673,0.0006502203,0.0073128105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827087,0.00035381792,0.00020237445,0.0005329081,0.00047149416,0.00016846212],"domain_scores_gemma":[0.99694675,0.0012956401,0.000163771,0.00045363358,0.0010297891,0.00011044289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014868347,0.0013488868,0.0018720654,0.0051708017,0.0012153955,0.0015907238,0.0017900246,0.0011540514,0.0038859379],"category_scores_gemma":[0.004503657,0.0004571089,0.0014404936,0.0044457726,0.0006333578,0.0023430386,0.0015755481,0.0017565247,0.0047406238],"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.0003813374,0.00036925363,0.0011160978,0.0003486125,0.00009700979,0.00010541115,0.00027017258,0.0036863242,0.069411635,0.0022169254,0.008691513,0.9133057],"study_design_scores_gemma":[0.00017692173,0.00049698964,0.0051565957,0.00015489954,0.00043912188,0.00068726647,0.0010499425,0.81105506,0.11833357,0.038513042,0.023781905,0.00015473446],"about_ca_topic_score_codex":0.005096616,"about_ca_topic_score_gemma":0.0072506587,"teacher_disagreement_score":0.0051708017,"about_ca_system_score_codex":0.00044497638,"about_ca_system_score_gemma":0.0018664934,"threshold_uncertainty_score":0.012999713},"labels":[],"label_agreement":null},{"id":"W1520613697","doi":"10.1007/11754008_14","title":"Detecting Observability Problems in Distributed Testing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Ottawa; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Controllability; Sequence (biology); Computer science; Construct (python library); State (computer science); Extension (predicate logic); Sequence diagram; Finite-state machine; Theoretical computer science; Algorithm; Test (biology); Distributed computing; Unified Modeling Language; Programming language; Mathematics; Software","score_opus":0.04026543076394748,"score_gpt":0.2534101892339219,"score_spread":0.2131447584699744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520613697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14404249,0.0005662859,0.8499124,0.0003254466,0.000043348788,0.00010005268,0.00007454255,0.0025329788,0.0024024716],"genre_scores_gemma":[0.8390993,0.00016743063,0.15867716,0.00007323899,0.000041408173,0.000064256616,0.00018543613,0.00022165624,0.0014702294],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99464595,0.0015749293,0.00032332973,0.00087484304,0.0020568077,0.0005240838],"domain_scores_gemma":[0.92539084,0.06216171,0.0034744805,0.006115508,0.0021927655,0.0006646781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033535538,0.0010183423,0.0012437168,0.0015856366,0.0004937944,0.0013266469,0.0024809758,0.0015967817,0.0013399962],"category_scores_gemma":[0.03324938,0.0009108685,0.0010513534,0.001100721,0.0021488285,0.004620718,0.0024546972,0.0026052946,0.00018918939],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001623997,0.0008253258,0.0513768,0.00066596095,0.00022202497,0.0016790216,0.0010760131,0.27306294,0.027193448,0.055988397,0.0033548905,0.5829312],"study_design_scores_gemma":[0.000098100994,0.00030722693,0.0049588853,0.00007285124,0.000095555435,0.0008906377,0.00017694641,0.82054687,0.01984049,0.15169838,0.0012730111,0.000041082127],"about_ca_topic_score_codex":0.0014161537,"about_ca_topic_score_gemma":0.0019312596,"teacher_disagreement_score":0.0033535538,"about_ca_system_score_codex":0.0007223441,"about_ca_system_score_gemma":0.00073650293,"threshold_uncertainty_score":0.017735481},"labels":[],"label_agreement":null},{"id":"W1520637757","doi":"10.1007/3-540-36103-0_49","title":"A Formal Definition of Function Points for Automated Measurement of B Specifications","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Function point; Computer science; Function (biology); Programming language; Software engineering; Software; Software development; Biology","score_opus":0.08049403041518137,"score_gpt":0.2598502023984091,"score_spread":0.17935617198322773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520637757","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.00159088,0.00006756405,0.9959824,0.000112878835,0.000029046636,0.00006973755,0.00007824721,0.00075582543,0.0013134371],"genre_scores_gemma":[0.09570531,0.00021376007,0.90068877,0.0002312735,0.00010369126,0.00040644887,0.00025891626,0.00048176857,0.0019101248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342316,0.0018399801,0.001026348,0.0010462984,0.0020766214,0.0005876153],"domain_scores_gemma":[0.98817074,0.0055303276,0.001061715,0.003018473,0.0018768436,0.00034188599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005067424,0.0017699585,0.0012805455,0.0037374224,0.0015552752,0.007909249,0.0032854618,0.0040772706,0.0048965337],"category_scores_gemma":[0.016441574,0.0016391355,0.0019290552,0.0024704963,0.005442947,0.0069161546,0.0035905426,0.004536997,0.0021730878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086646876,0.0000811584,0.0006042885,0.00014639976,0.000025728543,0.00022736378,0.00045365313,0.0071661496,0.011476565,0.9205316,0.002303934,0.056896444],"study_design_scores_gemma":[0.00008694937,0.00018769996,0.00051211094,0.00024547084,0.000060462233,0.0007257949,0.000196846,0.13583246,0.034891855,0.7968696,0.030263847,0.00012697943],"about_ca_topic_score_codex":0.0020339536,"about_ca_topic_score_gemma":0.0012305434,"teacher_disagreement_score":0.007909249,"about_ca_system_score_codex":0.001455914,"about_ca_system_score_gemma":0.0019359383,"threshold_uncertainty_score":0.02679944},"labels":[],"label_agreement":null},{"id":"W1520647843","doi":"10.1007/3-540-44886-1_48","title":"Not as Easy as It Seems: Automating the Construction of Lexical Chains Using Roget’s Thesaurus","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":53,"is_retracted":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":"Thesaurus; Computer science; Automatic summarization; Natural language processing; Information retrieval; Artificial intelligence; WordNet","score_opus":0.022232095732569082,"score_gpt":0.28414608764356314,"score_spread":0.26191399191099407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520647843","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.04799782,0.001622873,0.91319627,0.0014016081,0.0004048758,0.00013427057,0.0006006724,0.01880571,0.015835892],"genre_scores_gemma":[0.08320861,0.0007977258,0.9012378,0.00034647874,0.00005800344,0.00008161469,0.0016755674,0.0025833673,0.010010811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.00027960882,0.000084636384,0.00023166505,0.00016008374,0.0000566169],"domain_scores_gemma":[0.99737954,0.0011746113,0.00012107901,0.00078215206,0.00047037916,0.00007232799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016012486,0.00082487107,0.0011337693,0.0022262067,0.0012815723,0.0037561345,0.001833572,0.0014737184,0.011750834],"category_scores_gemma":[0.006872654,0.0011378945,0.0011701275,0.0026668087,0.0011822883,0.009709723,0.002731937,0.0015008886,0.0113266045],"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.00014688823,0.0000705238,0.0012846082,0.0005161706,0.00008657484,0.00037613927,0.002299301,0.0014863607,0.023164267,0.048777465,0.025614116,0.89617753],"study_design_scores_gemma":[0.00016326149,0.0002770682,0.0034370874,0.0007787433,0.00046188367,0.0035920271,0.005196965,0.07628109,0.09380662,0.2843126,0.5313358,0.0003568912],"about_ca_topic_score_codex":0.0029587355,"about_ca_topic_score_gemma":0.005161305,"teacher_disagreement_score":0.011750834,"about_ca_system_score_codex":0.0004473444,"about_ca_system_score_gemma":0.0013229714,"threshold_uncertainty_score":0.039310515},"labels":[],"label_agreement":null},{"id":"W1520683862","doi":"10.1007/978-3-540-69052-8_72","title":"A CBR-Based Approach for Ship Collision Avoidance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Collision avoidance; Abstraction; Collision; Collision avoidance system; Granularity; Artificial intelligence; Presentation (obstetrics); Machine learning; Computer security","score_opus":0.038077119523672286,"score_gpt":0.2537699940012462,"score_spread":0.21569287447757393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520683862","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.0063060685,0.0007742964,0.9727534,0.00020856924,0.00024292532,0.0002199215,0.00009756854,0.003186057,0.016211238],"genre_scores_gemma":[0.21836433,0.00129445,0.75541025,0.00035572198,0.00015013813,0.0002659835,0.00051245367,0.00033060127,0.023316013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00008601029,0.000030208435,0.000084748805,0.0002921388,0.00005660572],"domain_scores_gemma":[0.9996989,0.00008869484,0.000014119532,0.00004632752,0.00012967027,0.000022364358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005343788,0.00082200486,0.000950739,0.0011908244,0.0007204366,0.0014019455,0.0037935616,0.0017869812,0.00727315],"category_scores_gemma":[0.0014295221,0.00043906123,0.00070217444,0.0013940266,0.0005669084,0.0011838238,0.0013548138,0.0011900221,0.0024875351],"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.00032010057,0.00041895857,0.00039999213,0.00037107393,0.00012250438,0.00074273837,0.00031176282,0.15777186,0.039679416,0.03230743,0.01529475,0.75225943],"study_design_scores_gemma":[0.00009648943,0.000103865335,0.00034810626,0.0000566593,0.00010848453,0.00047865708,0.00009089758,0.9494696,0.012678544,0.017292468,0.019211967,0.0000642516],"about_ca_topic_score_codex":0.0066659283,"about_ca_topic_score_gemma":0.004489567,"teacher_disagreement_score":0.00727315,"about_ca_system_score_codex":0.0005657818,"about_ca_system_score_gemma":0.0007112619,"threshold_uncertainty_score":0.024331093},"labels":[],"label_agreement":null},{"id":"W1520715974","doi":"10.1007/11821731_1","title":"Perception of Audio-Generated and Custom Motion Programs in Multimedia Display of Action-Oriented DVD Films","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multisensory perception and integration","field":"Psychology","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":"McGill University","funders":"","keywords":"Computer science; Motion (physics); Multimedia; Perception; Action (physics); Surround sound; Digital audio; Audio signal; Computer vision; Speech recognition; Sound (geography); Speech coding","score_opus":0.041723067214419304,"score_gpt":0.30990695093184784,"score_spread":0.2681838837174285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520715974","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.9951031,0.00021819302,0.0018434784,0.000025716374,0.000018305562,0.000023362874,0.000077796154,0.000027420112,0.0026627134],"genre_scores_gemma":[0.99645114,0.00025150305,0.0010006515,0.00004343186,0.000013166801,0.000019491197,0.000112980975,0.000028010232,0.0020796391],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9999367,0.000013022385,0.0000027786768,0.000016669008,0.000014625523,0.00001625468],"domain_scores_gemma":[0.9997346,0.00015453667,0.000019259754,0.000008019493,0.000032484677,0.00005106251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011904832,0.0001927605,0.00017196347,0.00019,0.00012469865,0.00060958986,0.00022518456,0.00030621098,0.004572694],"category_scores_gemma":[0.00092129497,0.0001426689,0.00016572056,0.000123554,0.00016082314,0.00027976785,0.00027184887,0.00037842826,0.00019007103],"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.0023104353,0.00008822341,0.001583372,0.0001514688,0.000018644836,0.00014937998,0.00046851995,0.00014186997,0.98064137,0.00029318783,0.00023447243,0.013919165],"study_design_scores_gemma":[0.00048555294,0.0026874098,0.58418757,0.00017808207,0.000229722,0.002087927,0.002929154,0.0084174955,0.39356363,0.00077381637,0.0043961327,0.00006354631],"about_ca_topic_score_codex":0.0011041673,"about_ca_topic_score_gemma":0.00050010416,"teacher_disagreement_score":0.004572694,"about_ca_system_score_codex":0.00014855094,"about_ca_system_score_gemma":0.00008978502,"threshold_uncertainty_score":0.015297174},"labels":[],"label_agreement":null},{"id":"W1520746258","doi":"10.1007/11863854_9","title":"Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Binary number; Ideal (ethics); Mathematics; Autocorrelation matrix; Complementary sequences; Pseudorandom binary sequence; Autocorrelation technique; Algorithm; Computer science; Discrete mathematics; Statistics; Arithmetic","score_opus":0.02488444683529998,"score_gpt":0.23091078610925872,"score_spread":0.20602633927395875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520746258","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.75599617,0.00066789467,0.20629732,0.00035453084,0.00010006613,0.00004101273,0.0002622244,0.00034329455,0.035937544],"genre_scores_gemma":[0.9895286,0.00021266418,0.007649397,0.000052699103,0.00007975987,0.000021988291,0.00014840816,0.000047127578,0.0022592563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993691,0.00013711386,0.000032619362,0.00007568522,0.00025521262,0.00013027192],"domain_scores_gemma":[0.99460864,0.0030258752,0.00077974587,0.0004905088,0.000723855,0.00037141054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012039475,0.00052789133,0.00045593697,0.0015314267,0.00044790574,0.001584501,0.0005859539,0.0007766796,0.0030127503],"category_scores_gemma":[0.005836344,0.00034228936,0.00027370313,0.0013025104,0.0011674716,0.0014113811,0.000764614,0.0007707227,0.0004890544],"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.00076937664,0.00014440877,0.0039442545,0.00015192764,0.000045442404,0.0010398552,0.0005387199,0.036279917,0.080700584,0.8551011,0.0014390298,0.019845264],"study_design_scores_gemma":[0.00009959239,0.00032088935,0.007692184,0.00007001102,0.00004698305,0.0023856973,0.0002680016,0.6095904,0.031278007,0.3454991,0.0025849664,0.00016421123],"about_ca_topic_score_codex":0.00034156686,"about_ca_topic_score_gemma":0.00023990383,"teacher_disagreement_score":0.0030127503,"about_ca_system_score_codex":0.0006028383,"about_ca_system_score_gemma":0.0005419656,"threshold_uncertainty_score":0.010078669},"labels":[],"label_agreement":null},{"id":"W1520747543","doi":"10.1007/bfb0023724","title":"Issues arising in the analysis of L.0","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Bell (Canada)","funders":"","keywords":"Executable; Computer science; Asynchronous communication; Programming language; Simple (philosophy); Operator (biology); Theoretical computer science; Telecommunications","score_opus":0.03234883769730573,"score_gpt":0.31551538026367226,"score_spread":0.28316654256636653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520747543","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.016767798,0.015343069,0.5620503,0.036242258,0.0019084371,0.000047832727,0.00029663037,0.0005923779,0.36675137],"genre_scores_gemma":[0.6134542,0.011934374,0.20388854,0.009898424,0.005302951,0.00023886707,0.0006776135,0.0011706452,0.15343435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976496,0.0011027528,0.00012029566,0.00041070767,0.0005185779,0.000198199],"domain_scores_gemma":[0.99260277,0.0051789545,0.0003789463,0.00087573775,0.0008104887,0.0001529514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003011845,0.0006074697,0.0006324943,0.0013373443,0.0022125198,0.0063533816,0.0018240311,0.0025809803,0.01408594],"category_scores_gemma":[0.012171317,0.0006191133,0.0009334138,0.0019068215,0.00848001,0.010926465,0.0029492544,0.004685726,0.0051050275],"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.00000850481,0.000006232984,0.00009570239,0.000046314326,0.000004102304,0.00005951359,0.00017923025,0.00031791945,0.00010108871,0.9833662,0.0052451664,0.010570059],"study_design_scores_gemma":[0.0000015495983,0.0000054318907,0.00006757594,0.00002875082,0.0000021173914,0.00006295551,0.00005668479,0.0011484869,0.00017820025,0.9835253,0.014917928,0.0000050255658],"about_ca_topic_score_codex":0.0018901468,"about_ca_topic_score_gemma":0.0017586915,"teacher_disagreement_score":0.01408594,"about_ca_system_score_codex":0.0025108065,"about_ca_system_score_gemma":0.0011024053,"threshold_uncertainty_score":0.04712218},"labels":[],"label_agreement":null},{"id":"W1520816873","doi":"10.1007/978-3-540-31984-9_17","title":"A Framework for Counterexample Generation and Exploration","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Debugging; Computer science; Property (philosophy); Structuring; Artifact (error); Programming language; Model checking; Theoretical computer science; Exploit; Loop (graph theory); Algorithm; Mathematics; Artificial intelligence; Discrete mathematics; Computer security","score_opus":0.08353658458701141,"score_gpt":0.32159458126603047,"score_spread":0.23805799667901906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520816873","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.0005074665,0.00007150698,0.99439186,0.000075275675,0.000024739857,0.00008836605,0.00005462636,0.0035380349,0.0012481045],"genre_scores_gemma":[0.027102293,0.00011428701,0.9694485,0.00008680876,0.000035615034,0.0002426719,0.00023745905,0.0009666265,0.0017657238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927269,0.0024280278,0.0005498624,0.0012828523,0.002415556,0.0005968304],"domain_scores_gemma":[0.98675066,0.008241115,0.0004273306,0.0030717873,0.0012764952,0.00023257882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006217255,0.0026239592,0.0021087574,0.0043659313,0.0016686289,0.0043540727,0.005949394,0.0031471953,0.017406238],"category_scores_gemma":[0.02369451,0.00241758,0.0039569554,0.002682558,0.0037670187,0.00775721,0.0072687827,0.004080573,0.0050384197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040284827,0.0002647755,0.0006976889,0.00075180177,0.0001733756,0.0004398448,0.00064356,0.052686404,0.009566716,0.49962857,0.013371717,0.4213727],"study_design_scores_gemma":[0.00012405102,0.00007915178,0.00013736171,0.00019225458,0.00014217704,0.00039161547,0.00011736539,0.50150126,0.019292085,0.44669637,0.03123415,0.00009218117],"about_ca_topic_score_codex":0.0025409493,"about_ca_topic_score_gemma":0.0034539732,"teacher_disagreement_score":0.017406238,"about_ca_system_score_codex":0.0012351102,"about_ca_system_score_gemma":0.0025601343,"threshold_uncertainty_score":0.058229625},"labels":[],"label_agreement":null},{"id":"W1520854924","doi":"10.1007/978-3-540-73951-7_46","title":"Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Simon Fraser University","funders":"","keywords":"Center (category theory); Computer science; Algorithm; Pruning; Trimming; Line (geometry); Time complexity; Path (computing); Mathematical optimization; Mathematics","score_opus":0.07372767433269875,"score_gpt":0.26968746749189576,"score_spread":0.195959793159197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520854924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006246132,0.0005414321,0.9865481,0.000455099,0.000103819235,0.00010335345,0.00010430422,0.00030677658,0.005590902],"genre_scores_gemma":[0.15058374,0.0010473045,0.83264345,0.0003103438,0.00033592377,0.000613552,0.0005672061,0.00058978394,0.01330873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986369,0.0004885132,0.000064727574,0.0003177831,0.00026748897,0.00022450819],"domain_scores_gemma":[0.99335986,0.0049358252,0.0003424585,0.00045076085,0.0006134643,0.00029761012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029305387,0.0023080013,0.002597636,0.0017354533,0.0013494741,0.0030624745,0.004386481,0.0033844006,0.015238513],"category_scores_gemma":[0.013609149,0.0012585531,0.0014928508,0.003010853,0.001752934,0.0062153516,0.0038201823,0.004787661,0.0023805108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047071883,0.00036786328,0.0004971777,0.00050465734,0.00009275167,0.000082102924,0.00022934377,0.5783223,0.0014818291,0.21950997,0.026321754,0.1721195],"study_design_scores_gemma":[0.00010026922,0.00006646259,0.000086514585,0.000031074134,0.000017366812,0.00003754066,0.00005466412,0.8430852,0.0004789749,0.15367073,0.0023560012,0.000015180922],"about_ca_topic_score_codex":0.0050445977,"about_ca_topic_score_gemma":0.005866334,"teacher_disagreement_score":0.015238513,"about_ca_system_score_codex":0.002338876,"about_ca_system_score_gemma":0.0025832856,"threshold_uncertainty_score":0.050977945},"labels":[],"label_agreement":null},{"id":"W1520918022","doi":"10.1007/3-540-36469-2_4","title":"Managing Digital Mathematical Discourse","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Metadata; Field (mathematics); Ontology; Rubric; Data science; Information retrieval; World Wide Web","score_opus":0.014219560881667221,"score_gpt":0.25558130602287565,"score_spread":0.24136174514120842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520918022","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.0226155,0.0045795296,0.28179607,0.01312046,0.00088860095,0.000141033,0.0006182586,0.0032899254,0.6729506],"genre_scores_gemma":[0.50622475,0.0063404427,0.15735102,0.0017250706,0.0015776703,0.00041709363,0.0022442879,0.0019920117,0.32212773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708956,0.0011517253,0.00021603986,0.00035407313,0.0009866678,0.00020185986],"domain_scores_gemma":[0.99487644,0.0019596005,0.00034036432,0.0018550593,0.00070257543,0.00026595997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033285206,0.00061326346,0.0005748593,0.004473731,0.0029500748,0.01643395,0.0020224892,0.0014676047,0.04211923],"category_scores_gemma":[0.013718584,0.00063020503,0.0005515384,0.0052691335,0.0050898143,0.028311918,0.009426476,0.0021577976,0.01066568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013413527,0.000014249244,0.00010998227,0.000052113563,0.0000042621655,0.000045695087,0.001787219,0.00030284768,0.00047130836,0.93930656,0.00981549,0.048076883],"study_design_scores_gemma":[0.000013804316,0.000011473455,0.00010679653,0.000091179936,0.000019223824,0.00012321712,0.0019754884,0.003122736,0.0019036725,0.63385147,0.35876703,0.000013901827],"about_ca_topic_score_codex":0.001172618,"about_ca_topic_score_gemma":0.0011814535,"teacher_disagreement_score":0.04211923,"about_ca_system_score_codex":0.002882787,"about_ca_system_score_gemma":0.0022444404,"threshold_uncertainty_score":0.14090288},"labels":[],"label_agreement":null},{"id":"W1520949886","doi":"10.1007/978-3-540-30075-5_51","title":"Characterizing Database User’s Access Patterns","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"York University","funders":"","keywords":"Database; Computer science","score_opus":0.027890663845458668,"score_gpt":0.27446015496738385,"score_spread":0.2465694911219252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520949886","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.933774,0.00032413087,0.06015665,0.0002190324,0.00002207167,0.00006897716,0.0016784879,0.0011117603,0.0026448902],"genre_scores_gemma":[0.9814218,0.00014551412,0.0152372625,0.000045515248,0.000033798005,0.000036811,0.0014330753,0.00011114188,0.0015351204],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973972,0.00035471848,0.00032714428,0.00048152378,0.0011454483,0.000293971],"domain_scores_gemma":[0.98447084,0.007663805,0.0017316443,0.002644169,0.0027878361,0.0007017775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011521758,0.00036234592,0.00061410165,0.004093449,0.0005268762,0.0018377386,0.00086931855,0.0007791154,0.0014350243],"category_scores_gemma":[0.0129799135,0.00040460643,0.0004086654,0.0035457704,0.0004124614,0.003079826,0.0007581059,0.00065881736,0.0006360448],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014612188,0.0007288296,0.64261943,0.00020317303,0.00021357878,0.0005358441,0.000858862,0.011215023,0.043548636,0.0072152107,0.0043611247,0.28703913],"study_design_scores_gemma":[0.00006165498,0.0006955757,0.27752632,0.00005201797,0.000234979,0.005926091,0.0010044524,0.62176204,0.06086075,0.022811221,0.008957449,0.000107452855],"about_ca_topic_score_codex":0.0022016817,"about_ca_topic_score_gemma":0.003454899,"teacher_disagreement_score":0.004093449,"about_ca_system_score_codex":0.0004741141,"about_ca_system_score_gemma":0.0006351804,"threshold_uncertainty_score":0.006093323},"labels":[],"label_agreement":null},{"id":"W1521241992","doi":"10.1007/978-3-540-87877-3_28","title":"An Adverbial Approach for the Formal Specification of Topological Constraints Involving Regions with Broad Boundaries","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre de Géomatique du Québec; Université Laval","funders":"","keywords":"Adverbial; Topology (electrical circuits); Computer science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.029364224614895316,"score_gpt":0.24688251624107543,"score_spread":0.2175182916261801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521241992","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.0010617669,0.00016892218,0.99176764,0.00054888014,0.00012273071,0.000075053686,0.00013854208,0.00039354208,0.0057228645],"genre_scores_gemma":[0.07926943,0.0005160982,0.91141343,0.0006426941,0.00028285218,0.00048292818,0.00042143784,0.00052888156,0.0064422274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966653,0.0013574262,0.00046978233,0.0005980843,0.0007043867,0.00020498938],"domain_scores_gemma":[0.99585235,0.0024588543,0.0002568056,0.0006388646,0.0005990989,0.00019395244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049867416,0.0015420244,0.0012088703,0.0021000567,0.0020247502,0.0050064987,0.005061895,0.0033970547,0.013677032],"category_scores_gemma":[0.007420154,0.0021573603,0.0034835052,0.0027292182,0.0077187126,0.011988442,0.00489843,0.007074663,0.003497534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001424872,0.000011572003,0.00003413308,0.00010532456,0.000008202407,0.00014135377,0.00044704767,0.0011385364,0.0020174775,0.9893121,0.0012352685,0.0055346587],"study_design_scores_gemma":[0.00005125948,0.0000643503,0.00008238122,0.00013430121,0.00007576831,0.00037768466,0.00036262188,0.039154325,0.0053953375,0.8775795,0.07664787,0.00007461199],"about_ca_topic_score_codex":0.0021477002,"about_ca_topic_score_gemma":0.0031536825,"teacher_disagreement_score":0.013677032,"about_ca_system_score_codex":0.0018293496,"about_ca_system_score_gemma":0.0015442763,"threshold_uncertainty_score":0.045754254},"labels":[],"label_agreement":null},{"id":"W1521262921","doi":"10.1007/3-540-45718-6_1","title":"Densification of Digital Terrain Elevations Using Shape from Shading with Single Satellite Imagery","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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 Calgary","funders":"","keywords":"Terrain; Computer science; Remote sensing; Satellite; Digital elevation model; Interpolation (computer graphics); Satellite imagery; Computer graphics (images); Computer vision; Artificial intelligence; Image resolution; Geology; Geography; Image (mathematics); Cartography; Aerospace engineering","score_opus":0.02207725690581685,"score_gpt":0.22919784504581586,"score_spread":0.207120588139999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521262921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1896859,0.0004097287,0.8011286,0.00009206995,0.000043086853,0.000083025,0.0007117323,0.003351949,0.0044938596],"genre_scores_gemma":[0.6907678,0.00042123118,0.30434296,0.000024961608,0.000031768446,0.00004923604,0.0015828963,0.0006621268,0.0021170485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986446,0.000013921081,0.000008352039,0.000031155152,0.00006397319,0.000018135726],"domain_scores_gemma":[0.9995907,0.000127769,0.000029577612,0.00014393388,0.00009071237,0.000017438611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033173658,0.0003879675,0.0004819386,0.0014917693,0.00023482463,0.0008338947,0.000424851,0.00019520415,0.0019496898],"category_scores_gemma":[0.001194614,0.00048052298,0.0005072281,0.0011760213,0.00034964253,0.00083279767,0.0008621883,0.0004485195,0.00044668777],"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.00021524298,0.00006482142,0.008036537,0.00018405721,0.000057862177,0.00009081884,0.0006581562,0.3155885,0.02191079,0.0089066075,0.00216654,0.64212],"study_design_scores_gemma":[0.0000257011,0.000027823247,0.011247453,0.000024215133,0.000027834525,0.00014381165,0.00013379136,0.96203065,0.010929163,0.01052015,0.0048615113,0.000027863076],"about_ca_topic_score_codex":0.0068140347,"about_ca_topic_score_gemma":0.015945282,"teacher_disagreement_score":0.0068140347,"about_ca_system_score_codex":0.0004775804,"about_ca_system_score_gemma":0.00035125087,"threshold_uncertainty_score":0.013548732},"labels":[],"label_agreement":null},{"id":"W1521273090","doi":"10.1007/978-3-540-89524-4_23","title":"Small-World Peer-to-Peer for Resource Discovery","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Surrey Place Centre","funders":"","keywords":"Peer-to-peer; Computer science; Resource (disambiguation); Distributed computing; Node (physics); Set (abstract data type); Range (aeronautics); Computer network; World Wide Web; Engineering","score_opus":0.03219567945958474,"score_gpt":0.253681247292864,"score_spread":0.22148556783327927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521273090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022017097,0.002881202,0.9604942,0.0004526244,0.0006809127,0.00030286837,0.00019363362,0.0036998047,0.029093044],"genre_scores_gemma":[0.13092156,0.005345273,0.75173974,0.00038967098,0.0007994816,0.0006589603,0.0010287941,0.0010345103,0.10808206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.00011370258,0.000025647145,0.00010114741,0.00027597035,0.000042190095],"domain_scores_gemma":[0.9991431,0.00042591733,0.000032295924,0.00023040293,0.00012509612,0.00004314721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073234667,0.0008558999,0.0011983654,0.0007904823,0.0010039083,0.00160619,0.0028153479,0.0014360045,0.017146267],"category_scores_gemma":[0.0022522565,0.00040548565,0.00032174253,0.0017231904,0.0007106548,0.0033655553,0.0012808754,0.0011582981,0.008996616],"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.00019695672,0.00012268104,0.000100044104,0.0012146801,0.00008268565,0.00038895835,0.00028958096,0.019510278,0.01888536,0.302597,0.0924111,0.56420076],"study_design_scores_gemma":[0.000072504496,0.00012551068,0.00017405179,0.00013028152,0.00007234425,0.0011582248,0.000118694756,0.21532333,0.020526271,0.3683729,0.3938417,0.00008414873],"about_ca_topic_score_codex":0.0005017328,"about_ca_topic_score_gemma":0.0010612296,"teacher_disagreement_score":0.017146267,"about_ca_system_score_codex":0.000492386,"about_ca_system_score_gemma":0.0004985,"threshold_uncertainty_score":0.057359934},"labels":[],"label_agreement":null},{"id":"W1521287572","doi":"10.1007/978-3-642-16599-3_3","title":"The Smart Internet as a Catalyst for Health Care Reform","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Ontario Stroke Network; University of Victoria","funders":"","keywords":"The Internet; Health care; Context (archaeology); Internet presence management; Computer science; Internet privacy; Internet Architecture Board; World Wide Web; Business; Knowledge management; Political science","score_opus":0.013945382502772836,"score_gpt":0.26901521013328483,"score_spread":0.255069827630512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521287572","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.01426983,0.012321603,0.0071000257,0.5206612,0.00484534,0.00009824318,0.00013467392,0.0001154212,0.44045365],"genre_scores_gemma":[0.6937558,0.014882269,0.005764605,0.11327063,0.011275865,0.0002998743,0.00015941421,0.00021104717,0.16038047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781346,0.00088743755,0.000060614642,0.00023276177,0.00053355406,0.00047199507],"domain_scores_gemma":[0.99697554,0.0017484076,0.00023472455,0.00024698258,0.0002345339,0.00055988994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004249699,0.00037204084,0.0003303539,0.0010502362,0.0020334967,0.008511251,0.0008277995,0.008194104,0.011135027],"category_scores_gemma":[0.008538887,0.00030036768,0.0004223935,0.0014305551,0.010850649,0.010720826,0.00444415,0.010852896,0.0015162013],"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.0000064701794,0.000014901629,0.00009108824,0.000013787853,0.0000022636113,0.00002177773,0.00030043456,0.000111946974,0.000035414647,0.97410786,0.019789167,0.0055048633],"study_design_scores_gemma":[0.000036700843,0.000021355456,0.00071100786,0.00016231484,0.0000057283714,0.000047941114,0.00060345273,0.00086106366,0.00019317614,0.7014497,0.29589373,0.000013940754],"about_ca_topic_score_codex":0.0035933706,"about_ca_topic_score_gemma":0.0036498464,"teacher_disagreement_score":0.011135027,"about_ca_system_score_codex":0.005599212,"about_ca_system_score_gemma":0.0074100774,"threshold_uncertainty_score":0.040625334},"labels":[],"label_agreement":null},{"id":"W1521339929","doi":"10.1007/978-3-540-73011-8_73","title":"3D Visual Feedback in Learning of Piano Posture","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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 Ottawa","funders":"","keywords":"Piano; Session (web analytics); Body posture; Computer science; Human–computer interaction; Visual feedback; Shoulders; Psychology; Computer vision; Physical medicine and rehabilitation; Acoustics; Medicine","score_opus":0.016223939342329897,"score_gpt":0.2619810962838651,"score_spread":0.24575715694153522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521339929","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.47745308,0.0058339313,0.44895732,0.00061615685,0.0007682232,0.0002832799,0.0004675395,0.004617036,0.06100348],"genre_scores_gemma":[0.91363645,0.0018270862,0.07157075,0.00010293785,0.000089473026,0.00016103746,0.00016775473,0.00018709966,0.012257395],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974006,0.00007029394,0.000011082667,0.000051552237,0.000096744836,0.000030235817],"domain_scores_gemma":[0.9993617,0.0004402003,0.000030685616,0.00004354344,0.00007604104,0.000047807927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181044,0.0005090483,0.00037563138,0.00028521186,0.0001223462,0.00064505445,0.00047606367,0.00073216035,0.012248992],"category_scores_gemma":[0.003360307,0.00022014558,0.0002018852,0.0002914523,0.00031291042,0.0008090451,0.0008462887,0.00050529325,0.0013795254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010451224,0.00026682013,0.0014482673,0.00039144646,0.000017102573,0.00015821162,0.00052343425,0.00808155,0.1339094,0.0017857024,0.0034245097,0.8489484],"study_design_scores_gemma":[0.00090726995,0.007980789,0.13183893,0.0011481394,0.0002653093,0.0022604433,0.0026103249,0.4673071,0.2883962,0.04258171,0.0544675,0.00023633988],"about_ca_topic_score_codex":0.0008678458,"about_ca_topic_score_gemma":0.0010798733,"teacher_disagreement_score":0.012248992,"about_ca_system_score_codex":0.00014226761,"about_ca_system_score_gemma":0.000263693,"threshold_uncertainty_score":0.04097694},"labels":[],"label_agreement":null},{"id":"W1521374744","doi":"10.1007/3-540-46885-4_72","title":"A Fast Elliptic Curve Cryptosystem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Cryptosystem; Very-large-scale integration; Multiplier (economics); Cryptography; Computer science; Modular exponentiation; Arithmetic; Elliptic curve cryptography; Embedded system; Parallel computing; Computer hardware; Encryption; Mathematics; Algorithm; Public-key cryptography; Computer network","score_opus":0.017826534189639434,"score_gpt":0.24424299836398206,"score_spread":0.22641646417434264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521374744","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.02896817,0.0058308663,0.7957532,0.0023911223,0.0022945646,0.00038673377,0.0005427183,0.006111068,0.15772161],"genre_scores_gemma":[0.27565804,0.008288407,0.53349805,0.0008890255,0.0019324209,0.00034801176,0.0010706603,0.0011418307,0.17717358],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958557,0.00005762514,0.000022478052,0.00004365649,0.0002479409,0.000042657473],"domain_scores_gemma":[0.9995147,0.00013686754,0.000024474844,0.00016815004,0.00011604261,0.000039834908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005038984,0.0009038088,0.0005288576,0.0011699315,0.00087934564,0.0014713198,0.00062619324,0.00096160587,0.012673496],"category_scores_gemma":[0.0011450459,0.00044556614,0.00042946692,0.0012397617,0.0007907479,0.0035839244,0.0013039992,0.0015252554,0.0058698803],"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.00036230515,0.00013716164,0.00017483997,0.00035529176,0.000031916607,0.0003003886,0.00014281104,0.008005227,0.040165216,0.4256704,0.045201227,0.4794533],"study_design_scores_gemma":[0.0002290329,0.00042513083,0.00044896855,0.00022396784,0.00007492828,0.0019111239,0.00006314036,0.05267871,0.04954667,0.38622874,0.5080492,0.00012044476],"about_ca_topic_score_codex":0.00017121495,"about_ca_topic_score_gemma":0.00021080827,"teacher_disagreement_score":0.012673496,"about_ca_system_score_codex":0.0006250395,"about_ca_system_score_gemma":0.0008048908,"threshold_uncertainty_score":0.04239708},"labels":[],"label_agreement":null},{"id":"W1521531200","doi":"10.1007/978-3-642-13772-3_33","title":"Robust Approaches to 3D Object Secret Sharing","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Secret sharing; Secrecy; Encryption; Cryptanalysis; Homomorphic secret sharing; Lossless compression; Theoretical computer science; Data sharing; Secure multi-party computation; Encoding (memory); Computer security; Cryptography; Distributed computing; Algorithm; Data compression; Artificial intelligence","score_opus":0.06399797411148378,"score_gpt":0.2410087963412847,"score_spread":0.1770108222298009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521531200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028701848,0.0003608792,0.99446446,0.00006513316,0.000025842417,0.000014725126,0.00002489309,0.00022055411,0.001953407],"genre_scores_gemma":[0.32291535,0.0022792737,0.65768695,0.0002364404,0.00020218923,0.0001367928,0.00019784221,0.00038117007,0.015964054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911696,0.00014559901,0.000035625897,0.0001204835,0.0005085012,0.000072915784],"domain_scores_gemma":[0.9989612,0.0003508225,0.0001113988,0.0004495447,0.00009953075,0.00002746708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065054523,0.0009797651,0.0010549513,0.00092307106,0.00047674667,0.0013771087,0.002083411,0.0017413045,0.0047151414],"category_scores_gemma":[0.0018608351,0.0009233214,0.0010583386,0.0012189077,0.0015488333,0.0018261394,0.0039141895,0.0017289065,0.0011605528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018967352,0.00006869048,0.000160485,0.00021963414,0.00011814691,0.00019543795,0.00030504173,0.44726923,0.07845929,0.25795993,0.0030779182,0.21197648],"study_design_scores_gemma":[0.00001416932,0.00005119345,0.00011225729,0.000016396587,0.000020267928,0.00022350019,0.00003457308,0.88617325,0.016434742,0.0909353,0.0059508267,0.00003361231],"about_ca_topic_score_codex":0.00064548803,"about_ca_topic_score_gemma":0.0007076508,"teacher_disagreement_score":0.0047151414,"about_ca_system_score_codex":0.000720414,"about_ca_system_score_gemma":0.0003671654,"threshold_uncertainty_score":0.015773714},"labels":[],"label_agreement":null},{"id":"W1521543822","doi":"10.1007/978-3-540-40052-3_1","title":"Learning Software Organizations and Agile Software Development: Complementary or Contradictory Concepts?","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Calgary","funders":"","keywords":"Agile software development; Lean software development; Computer science; Software development; Software development process; Extreme programming practices; Software engineering; Personal software process; Theme (computing); Software; Process (computing); Knowledge management; Flexibility (engineering); Engineering management; Process management; World Wide Web; Engineering; Management; Software construction","score_opus":0.01654559959673117,"score_gpt":0.2554953426634694,"score_spread":0.23894974306673825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521543822","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047139656,0.30620146,0.099245474,0.243012,0.00416863,0.00009872507,0.0001296864,0.00030322353,0.29970118],"genre_scores_gemma":[0.6831706,0.22441491,0.038811132,0.02546489,0.005753594,0.00038483442,0.00019169273,0.00018214544,0.021626221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942846,0.0035520734,0.00023254167,0.0003329837,0.001060923,0.00053687184],"domain_scores_gemma":[0.9737891,0.02093038,0.001949634,0.0006707523,0.0015225164,0.0011375158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067882636,0.0009594726,0.0012355202,0.002838219,0.0018178626,0.01327921,0.0024735734,0.0059846514,0.0058054654],"category_scores_gemma":[0.011725588,0.0010284279,0.0005855235,0.0060201427,0.019465,0.0343091,0.0062788036,0.0071888375,0.0011984223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050171562,0.00015643895,0.0012515438,0.00077238557,0.000031099065,0.00023923484,0.01768692,0.00021338058,0.00020056953,0.8480914,0.012175853,0.119131126],"study_design_scores_gemma":[0.00004624992,0.0000872565,0.0021774876,0.0025082512,0.00005909579,0.00080539193,0.025225077,0.0010418914,0.00023227472,0.8802999,0.087451555,0.00006553465],"about_ca_topic_score_codex":0.0016680603,"about_ca_topic_score_gemma":0.00386412,"teacher_disagreement_score":0.01327921,"about_ca_system_score_codex":0.002202041,"about_ca_system_score_gemma":0.0047068666,"threshold_uncertainty_score":0.035900235},"labels":[],"label_agreement":null},{"id":"W1521554476","doi":"10.1007/11943952_2","title":"Routing Transient Traffic in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc 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":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Transient (computer programming); Link-state routing protocol; Wireless ad hoc network; Distributed computing; Routing protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.009237131349496065,"score_gpt":0.21917491547869178,"score_spread":0.20993778412919573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521554476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023960376,0.021229655,0.908439,0.00073132064,0.0010624743,0.00009889828,0.000103486294,0.0020903032,0.04228443],"genre_scores_gemma":[0.6067397,0.037667956,0.24639842,0.000446094,0.0017670825,0.00027069563,0.0008370096,0.0006680813,0.105204955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980587,0.000041737527,0.000011370451,0.000027243486,0.00008429418,0.00002959391],"domain_scores_gemma":[0.99932873,0.00040079872,0.0000323403,0.000079804966,0.00013104508,0.000027382985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004743243,0.0005299632,0.0006525273,0.00058034057,0.00039709365,0.0013915839,0.0012476173,0.00069677725,0.0035525311],"category_scores_gemma":[0.0013957076,0.0003574583,0.00020727824,0.0012088588,0.0005522999,0.0017714907,0.0005161227,0.0007764742,0.0013678168],"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.00016289836,0.000113513335,0.00043826672,0.0007044759,0.00003526611,0.00026481264,0.00024612193,0.12756166,0.017232606,0.113986276,0.026323365,0.7129308],"study_design_scores_gemma":[0.00003771246,0.00041539688,0.00051208574,0.00021490076,0.00007789902,0.0010557881,0.00022307262,0.7413964,0.011578226,0.13499416,0.109448746,0.00004560228],"about_ca_topic_score_codex":0.00036784005,"about_ca_topic_score_gemma":0.0004563844,"teacher_disagreement_score":0.0035525311,"about_ca_system_score_codex":0.0004944748,"about_ca_system_score_gemma":0.00034689228,"threshold_uncertainty_score":0.011884391},"labels":[],"label_agreement":null},{"id":"W1521571748","doi":"10.1007/3-540-44491-2_13","title":"Logical Decision Rules: Teaching C4.5 to Speak Prolog","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Prolog; Computer science; Programming language; Logic programming; Artificial intelligence","score_opus":0.020074059094574808,"score_gpt":0.26696229658448484,"score_spread":0.24688823748991004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521571748","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.014967976,0.00057202735,0.78405994,0.0057165106,0.0007889227,0.00021607435,0.00040877107,0.009681976,0.18358783],"genre_scores_gemma":[0.121526346,0.001128295,0.790767,0.002157363,0.00028990084,0.0002370739,0.0010411246,0.0032742387,0.079578646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992267,0.00023117189,0.000042504278,0.00014543791,0.00027565175,0.000078568235],"domain_scores_gemma":[0.9979505,0.0012274536,0.00006499003,0.00016665633,0.00038187948,0.00020862123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875578,0.0007472774,0.00022077806,0.0006422143,0.00082334015,0.0025518602,0.0014853517,0.0008285792,0.024044588],"category_scores_gemma":[0.0064374986,0.00055355264,0.00042676687,0.00054943305,0.00082409254,0.002996062,0.0016490176,0.0033720103,0.010696175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001693019,0.00036331613,0.00086408434,0.00020622548,0.0000140022175,0.00013975275,0.0009373425,0.006908338,0.004541402,0.12679309,0.16074724,0.6983159],"study_design_scores_gemma":[0.00014642018,0.00008758879,0.0006760026,0.00036319872,0.00003252998,0.00029580976,0.00077245815,0.086821474,0.0222242,0.32983574,0.55868816,0.00005645243],"about_ca_topic_score_codex":0.0027972043,"about_ca_topic_score_gemma":0.00474079,"teacher_disagreement_score":0.024044588,"about_ca_system_score_codex":0.0012488099,"about_ca_system_score_gemma":0.0020308625,"threshold_uncertainty_score":0.08043718},"labels":[],"label_agreement":null},{"id":"W1521580745","doi":"10.1007/3-540-45937-5_10","title":"Decompiling Java Bytecode: Problems, Traps and Pitfalls","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":82,"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":"Java bytecode; Computer science; Programming language; Bytecode; Java; Java Modeling Language; Java annotation; Compiler; Generics in Java; Real time Java","score_opus":0.02550891549221492,"score_gpt":0.2370420212621076,"score_spread":0.21153310576989268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521580745","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.1032456,0.005789977,0.83983654,0.007870044,0.0006358875,0.00021383379,0.00030770223,0.02729574,0.014804744],"genre_scores_gemma":[0.34499955,0.0037668904,0.6219429,0.0017182974,0.00033225655,0.00018988989,0.0007862914,0.012117878,0.014146145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686986,0.0005475755,0.000234045,0.00039831156,0.0015987628,0.00035140212],"domain_scores_gemma":[0.98682076,0.0058049546,0.0010173633,0.0038367147,0.0021335327,0.00038675987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003596506,0.0009602413,0.00082160893,0.0017332383,0.0011970481,0.002742993,0.0022539739,0.0010826921,0.0028670318],"category_scores_gemma":[0.017199932,0.00096147065,0.00087792287,0.0023152914,0.0024365913,0.007396594,0.0026679197,0.0034661961,0.0022710057],"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.00013728465,0.00014062822,0.0023117824,0.00032859467,0.000023495932,0.00027353785,0.0006543965,0.007418139,0.010930996,0.040497076,0.01600251,0.9212815],"study_design_scores_gemma":[0.00012258068,0.00027728316,0.0030135063,0.00089611794,0.00014475815,0.0023986734,0.0019251212,0.19669528,0.11226407,0.5789126,0.10317056,0.0001795238],"about_ca_topic_score_codex":0.0028214802,"about_ca_topic_score_gemma":0.0054884027,"teacher_disagreement_score":0.003596506,"about_ca_system_score_codex":0.0009177501,"about_ca_system_score_gemma":0.0023759583,"threshold_uncertainty_score":0.019020319},"labels":[],"label_agreement":null},{"id":"W1521695033","doi":"10.1007/3-540-45486-1_23","title":"A Recognition-Based Alternative to Discrimination-Based Multi-layer Perceptrons","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Dalhousie University","funders":"","keywords":"Computer science; Perceptron; Layer (electronics); Artificial intelligence; Pattern recognition (psychology); Speech recognition; Artificial neural network","score_opus":0.0446931283991654,"score_gpt":0.28524388890273394,"score_spread":0.24055076050356855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521695033","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.0029532106,0.00065157283,0.9886902,0.0002818757,0.0003044543,0.00004095238,0.00010130979,0.0013604793,0.0056159957],"genre_scores_gemma":[0.23491272,0.00089972804,0.7441321,0.00081503176,0.0003646337,0.00013211474,0.00039978893,0.00037630732,0.017967544],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993326,0.00012330108,0.00006767924,0.00017434983,0.00023344763,0.00006859539],"domain_scores_gemma":[0.99885345,0.00044130415,0.000057446905,0.0003042073,0.00028810723,0.000055523557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011323462,0.0007111765,0.0013233104,0.0005422312,0.00035645833,0.002189892,0.0029198618,0.0018248213,0.009982317],"category_scores_gemma":[0.0026353651,0.00042101325,0.0009254805,0.0011785299,0.0006982407,0.0028464415,0.0012420748,0.0024931156,0.0039089597],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047412026,0.00025233353,0.00042812817,0.00044439174,0.0001891172,0.00018451938,0.00006792285,0.05819369,0.042800635,0.14193802,0.007979581,0.7470475],"study_design_scores_gemma":[0.0000379913,0.00008709234,0.00023437604,0.00003458507,0.000062960586,0.00020076401,0.000013009526,0.9145464,0.01549298,0.062273283,0.006985091,0.000031466625],"about_ca_topic_score_codex":0.0015531065,"about_ca_topic_score_gemma":0.0025073614,"teacher_disagreement_score":0.009982317,"about_ca_system_score_codex":0.00046811273,"about_ca_system_score_gemma":0.000725789,"threshold_uncertainty_score":0.033394158},"labels":[],"label_agreement":null},{"id":"W1521761938","doi":"10.1007/978-3-642-15558-1_4","title":"Automated 3D Reconstruction and Segmentation from Optical Coherence Tomography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical Coherence Tomography Applications","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 Waterloo","funders":"","keywords":"Optical coherence tomography; Segmentation; Computer vision; Artificial intelligence; Computer science; Cornea; Image segmentation; Optics; Physics","score_opus":0.008673312089035974,"score_gpt":0.2222896243406934,"score_spread":0.21361631225165745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521761938","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.0052142623,0.000781063,0.9890295,0.00012949933,0.000039943327,0.00005241276,0.00025192148,0.0028273566,0.001674006],"genre_scores_gemma":[0.041751966,0.0010642718,0.9525586,0.00008703269,0.000041901076,0.000067199675,0.0007515965,0.0008571366,0.0028203072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991553,0.00012999415,0.000039587187,0.00014589091,0.0004593589,0.00006985278],"domain_scores_gemma":[0.9990042,0.00043664506,0.00008130633,0.0002752649,0.00018147666,0.000021050344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065201503,0.0011325323,0.0011907042,0.0019793955,0.00047326525,0.0025933576,0.0016686352,0.0016646928,0.0037038976],"category_scores_gemma":[0.0020139646,0.0017594812,0.0012468945,0.0019095106,0.00074824505,0.0013218574,0.0015247675,0.0011681786,0.0026975255],"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.00017063969,0.00007030615,0.00069044187,0.0003585795,0.00008773154,0.00018264606,0.00017985574,0.06755872,0.13024981,0.011200588,0.013435522,0.7758152],"study_design_scores_gemma":[0.000019521633,0.000057681926,0.0017920415,0.000062338535,0.000045104105,0.0009529349,0.000055442288,0.84018266,0.114812285,0.017439496,0.02450248,0.00007795796],"about_ca_topic_score_codex":0.0025855312,"about_ca_topic_score_gemma":0.005627585,"teacher_disagreement_score":0.0037038976,"about_ca_system_score_codex":0.0006885529,"about_ca_system_score_gemma":0.001056162,"threshold_uncertainty_score":0.012390733},"labels":[],"label_agreement":null},{"id":"W1521828730","doi":"10.1007/978-3-540-39592-8_22","title":"Searching for the Complex Decision Reducts: The Case Study of the Survival Analysis","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Organizational Management and Leadership","field":"Business, Management and Accounting","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Data mining; Operations research; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.06674729305421451,"score_gpt":0.28089136951226473,"score_spread":0.21414407645805023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521828730","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.681846,0.0015063724,0.29321614,0.003673969,0.000053723958,0.00019621632,0.00072255067,0.00018960894,0.018595457],"genre_scores_gemma":[0.8865512,0.0006825986,0.10900411,0.00009706828,0.000036194055,0.00009231895,0.0004183202,0.00006399419,0.0030541937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998466,0.0010294225,0.000045213106,0.0001343457,0.00023811948,0.00008680879],"domain_scores_gemma":[0.98022443,0.01797386,0.00044037018,0.0007809959,0.00040620388,0.00017413648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035000907,0.00047089465,0.00085748517,0.0015770369,0.001432463,0.0020787437,0.0007884158,0.0010168479,0.0040008025],"category_scores_gemma":[0.022448126,0.00026492323,0.0012174828,0.0026525764,0.0018136824,0.00196873,0.001048699,0.0018643866,0.0002316937],"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.00044556073,0.0004064118,0.023454392,0.000551576,0.00022434731,0.002294015,0.0071485653,0.15533829,0.001112378,0.5713696,0.0090020215,0.22865283],"study_design_scores_gemma":[0.000055738405,0.00013187424,0.0042024096,0.00010510944,0.000099590616,0.00062794756,0.0030822726,0.328575,0.0009994394,0.6553738,0.0067142975,0.000032424265],"about_ca_topic_score_codex":0.004198576,"about_ca_topic_score_gemma":0.0054582837,"teacher_disagreement_score":0.004198576,"about_ca_system_score_codex":0.00076443073,"about_ca_system_score_gemma":0.0012953578,"threshold_uncertainty_score":0.01851046},"labels":[],"label_agreement":null},{"id":"W1521833600","doi":"10.1007/11774303_107","title":"Applying the Agent Metaphor to Learning Content Management Systems and Learning Object Repositories","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Saskatchewan","funders":"","keywords":"Computer science; Metaphor; Metadata; Focus (optics); Pragmatics; Negotiation; Object (grammar); Learning object; Interpretation (philosophy); Human–computer interaction; Learning Management; World Wide Web; Multimedia; Artificial intelligence; Programming language; Linguistics","score_opus":0.02759859910099999,"score_gpt":0.23821740913196346,"score_spread":0.21061881003096347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521833600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010067496,0.0026599148,0.9026909,0.006721779,0.00055442855,0.00010633182,0.000098422104,0.001159231,0.07594147],"genre_scores_gemma":[0.28467387,0.0036160653,0.65310854,0.0014902606,0.00035236892,0.00031616524,0.0003301692,0.0007161817,0.055396464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916553,0.0004348508,0.000058856214,0.000092662725,0.00019937687,0.000048730737],"domain_scores_gemma":[0.99888486,0.0006666843,0.0000515954,0.000198694,0.000112828275,0.00008536762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013330005,0.00047471307,0.0004890113,0.001467393,0.0012670102,0.0054500396,0.00151209,0.0025225482,0.0072848243],"category_scores_gemma":[0.004287031,0.00064995955,0.00077290414,0.0015964214,0.0034205643,0.010774129,0.0028029243,0.0030003863,0.001799931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002547804,0.000052063457,0.00015911649,0.00011809477,0.000014466493,0.00020523604,0.0012065062,0.0021463505,0.0012890064,0.9483574,0.005674953,0.040751297],"study_design_scores_gemma":[0.00003773792,0.000045695382,0.00022500507,0.00012495811,0.000036355348,0.0005817,0.00075377396,0.04063604,0.002723312,0.7946945,0.16011217,0.000028853927],"about_ca_topic_score_codex":0.0025714259,"about_ca_topic_score_gemma":0.0028232236,"teacher_disagreement_score":0.0072848243,"about_ca_system_score_codex":0.001270746,"about_ca_system_score_gemma":0.00093637645,"threshold_uncertainty_score":0.024370134},"labels":[],"label_agreement":null},{"id":"W1521834707","doi":"10.1007/11602613_70","title":"Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph; Computer science; Vertex (graph theory); Center (category theory); Combinatorics; Algorithm; Cactus; Running time; Mathematics; Discrete mathematics","score_opus":0.02257723903790123,"score_gpt":0.23729110949165566,"score_spread":0.21471387045375442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521834707","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.10221376,0.0012578593,0.85671633,0.0025344463,0.0003154189,0.0013437929,0.002335552,0.0048861518,0.028396644],"genre_scores_gemma":[0.18327631,0.00052580494,0.7975242,0.00034935988,0.00019197568,0.0005173232,0.003879952,0.000953311,0.01278162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.00033027472,0.0000531018,0.00043948967,0.00025793328,0.00031979167],"domain_scores_gemma":[0.9959708,0.002397809,0.00030780357,0.0006200441,0.00036988847,0.00033372344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015620169,0.0025181992,0.0029011432,0.002724911,0.002749303,0.003864081,0.006315726,0.003720533,0.02119662],"category_scores_gemma":[0.0059231576,0.001562853,0.00215985,0.004880209,0.0015008256,0.0067977216,0.0037257897,0.0030502945,0.0025372189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001076258,0.0013137177,0.0013699819,0.0011841842,0.00021613107,0.00020864313,0.00063506677,0.46472567,0.004393646,0.13833544,0.070622325,0.31591892],"study_design_scores_gemma":[0.00032907978,0.00011509681,0.00033471113,0.000053052157,0.000063254156,0.000106872314,0.0002784534,0.8562068,0.0019197405,0.13460465,0.0059578675,0.00003055934],"about_ca_topic_score_codex":0.01514819,"about_ca_topic_score_gemma":0.02386784,"teacher_disagreement_score":0.02119662,"about_ca_system_score_codex":0.003810832,"about_ca_system_score_gemma":0.004036446,"threshold_uncertainty_score":0.0709098},"labels":[],"label_agreement":null},{"id":"W1521837028","doi":"10.1007/978-3-540-24628-2_3","title":"Chemical Switching and Molecular Logic in Fluorescent-Labeled M-DNA","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Nucleic Acid Chemistry","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 Saskatchewan","funders":"","keywords":"Quenching (fluorescence); Fluorescence; Anthraquinone; Photochemistry; Electron acceptor; Acceptor; Fluorescein; Electron transfer; DNA; Chemistry; Rhodamine B; Rhodamine; Base pair; Physics; Organic chemistry; Catalysis; Biochemistry","score_opus":0.0061285132402900564,"score_gpt":0.22021746995499883,"score_spread":0.21408895671470876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521837028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1970366,0.03302368,0.461552,0.0030991356,0.002016275,0.00018367909,0.00031908203,0.0011457943,0.30162376],"genre_scores_gemma":[0.7509577,0.012999072,0.09337008,0.0008238458,0.00027362604,0.00018470781,0.00018630015,0.00018609311,0.1410184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994016,0.000008579992,0.000002563657,0.000016307948,0.00002219834,0.000010106781],"domain_scores_gemma":[0.9999291,0.000044279594,0.000007113799,0.000008432599,0.0000058171545,0.0000051873276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013576963,0.00022850973,0.00021669731,0.00020480216,0.00028304636,0.00074331637,0.0007193962,0.00051220885,0.0038130663],"category_scores_gemma":[0.00023828029,0.00026009665,0.00023295874,0.0003247357,0.0008560589,0.0011306265,0.00025983888,0.0008288986,0.00075208856],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011327355,0.000049997387,0.000065706285,0.00029883787,0.000006943604,0.00017381093,0.00021140861,0.0039128205,0.27664998,0.6537141,0.0032747495,0.061528314],"study_design_scores_gemma":[0.000031285967,0.00021290149,0.00026120184,0.00007597088,0.0000122533975,0.0005024801,0.00007396795,0.019997083,0.6284636,0.24219836,0.10813563,0.0000351015],"about_ca_topic_score_codex":0.00023928499,"about_ca_topic_score_gemma":0.00028831957,"teacher_disagreement_score":0.0038130663,"about_ca_system_score_codex":0.0005148925,"about_ca_system_score_gemma":0.00016128075,"threshold_uncertainty_score":0.01275593},"labels":[],"label_agreement":null},{"id":"W1521857773","doi":"10.1007/978-3-642-05118-0_46","title":"Black Hole Search with Tokens in Interconnected Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Network topology; Security token; Hypercube; Torus; Black hole (networking); Mobile agent; Topology (electrical circuits); Computer network; Theoretical computer science; Routing (electronic design automation); Parallel computing; Mathematics; Combinatorics","score_opus":0.014541565078390863,"score_gpt":0.2305751706863052,"score_spread":0.21603360560791435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521857773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22236082,0.0020977664,0.7365529,0.0025947695,0.00034518456,0.00016847435,0.00019463741,0.0004400702,0.035245467],"genre_scores_gemma":[0.8835335,0.0010355951,0.08988071,0.00024770657,0.00015395244,0.00018348065,0.00013328684,0.00015672408,0.024674993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989153,0.0006029229,0.000034970308,0.000115685594,0.0001659636,0.00016510118],"domain_scores_gemma":[0.990855,0.007514158,0.0004635399,0.00047440396,0.00028483203,0.00040819298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218829,0.0005697629,0.0018716031,0.0013044396,0.0015436052,0.002739816,0.0021578039,0.0028610048,0.005947578],"category_scores_gemma":[0.01554394,0.00075532537,0.0007791771,0.0020743762,0.0029827256,0.006322939,0.0031741294,0.002128272,0.00045662682],"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.00035858015,0.000043057345,0.00033667294,0.000113947666,0.000043847907,0.00018207465,0.00019107538,0.17399181,0.0004936391,0.81069547,0.003604398,0.009945426],"study_design_scores_gemma":[0.000060691138,0.000024819477,0.00004833097,0.000019598412,0.000013293211,0.000042418687,0.000059527538,0.43595314,0.00023599729,0.56262565,0.000904856,0.000011799066],"about_ca_topic_score_codex":0.0013902348,"about_ca_topic_score_gemma":0.0011982636,"teacher_disagreement_score":0.005947578,"about_ca_system_score_codex":0.0012690629,"about_ca_system_score_gemma":0.0009604214,"threshold_uncertainty_score":0.019896686},"labels":[],"label_agreement":null},{"id":"W1521873349","doi":"10.1007/978-3-642-16321-0_8","title":"Range Queries over Untangled Chains","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Computer science; Range (aeronautics); Representation (politics); Monotonic function; Data structure; Set (abstract data type); Space (punctuation); Algorithm; Combinatorics; Discrete mathematics; Mathematics","score_opus":0.01298931434922809,"score_gpt":0.2331379272691236,"score_spread":0.22014861291989551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521873349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08352583,0.0023405666,0.87648845,0.0014358425,0.00025573332,0.0002384729,0.0023547432,0.0028404114,0.030519918],"genre_scores_gemma":[0.6171151,0.0027006709,0.3442376,0.0005835752,0.0006250784,0.00031820644,0.0059835487,0.0013955906,0.027040675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943212,0.0010231362,0.00061146246,0.0009291517,0.0025039995,0.0006110296],"domain_scores_gemma":[0.9855979,0.00907786,0.0006421372,0.00347492,0.0008627627,0.00034444532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002718656,0.0009541657,0.002108321,0.002203043,0.0012728658,0.004720244,0.0021109108,0.0020992784,0.013290781],"category_scores_gemma":[0.015131815,0.0011102632,0.0011327729,0.005459321,0.0018550406,0.018403925,0.008050553,0.002931815,0.00289977],"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.0011621672,0.0002501248,0.0020716318,0.0010470552,0.0001388386,0.0006658923,0.00097169273,0.05866795,0.015606719,0.64206326,0.016459152,0.26089555],"study_design_scores_gemma":[0.00008854126,0.00007809983,0.000248161,0.00012354767,0.00005391821,0.000499083,0.00022156234,0.19475304,0.008351806,0.78040737,0.015132997,0.00004185625],"about_ca_topic_score_codex":0.0009460809,"about_ca_topic_score_gemma":0.001087011,"teacher_disagreement_score":0.013290781,"about_ca_system_score_codex":0.0010330968,"about_ca_system_score_gemma":0.0007557422,"threshold_uncertainty_score":0.044462144},"labels":[],"label_agreement":null},{"id":"W1521924723","doi":"10.1007/3-540-45468-3_157","title":"Analysis of 3D Deformation Fields for Appearance-Based Segmentation","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Segmentation; A priori and a posteriori; Novelty; Artificial intelligence; Atlas (anatomy); Pattern recognition (psychology); Computer vision","score_opus":0.01888360649441305,"score_gpt":0.28403211938718936,"score_spread":0.2651485128927763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521924723","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.016884223,0.00034691696,0.9806769,0.000086973,0.000025647041,0.00004621507,0.00011474242,0.0006939116,0.0011245996],"genre_scores_gemma":[0.46537945,0.0012168011,0.52635974,0.00008552252,0.000056449684,0.000104717954,0.0007536422,0.00066290126,0.00538078],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997204,0.000034351946,0.000015004679,0.000044262157,0.00015793895,0.000028080003],"domain_scores_gemma":[0.99950194,0.00019464895,0.000052744934,0.0000918136,0.0001386791,0.000020102041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049250596,0.00046798534,0.00061143556,0.0015569838,0.00027874892,0.0009776535,0.0006648546,0.0007203244,0.0034554112],"category_scores_gemma":[0.0013056223,0.000489448,0.000803786,0.0013138766,0.00052955316,0.0008900665,0.00048237795,0.0005846563,0.00096292107],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022432374,0.00010792193,0.0013081669,0.0002822752,0.000048763544,0.000125617,0.00012732594,0.213276,0.20160757,0.019507546,0.0027003495,0.5606841],"study_design_scores_gemma":[0.0000062427075,0.000033657954,0.0020877055,0.000016576088,0.000014234559,0.00013743062,0.000017368313,0.96686983,0.022594916,0.006490027,0.0017154372,0.000016566479],"about_ca_topic_score_codex":0.0019499646,"about_ca_topic_score_gemma":0.001950097,"teacher_disagreement_score":0.0034554112,"about_ca_system_score_codex":0.0005438181,"about_ca_system_score_gemma":0.00053724565,"threshold_uncertainty_score":0.011559486},"labels":[],"label_agreement":null},{"id":"W1521937241","doi":"10.1007/978-3-642-18469-7_28","title":"Complexity of Finding Non-Planar Rectilinear Drawings of Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council; Michael Smith Health Research BC","keywords":"Vertex (graph theory); Planar graph; Combinatorics; NP-complete; Planar; Time complexity; Enhanced Data Rates for GSM Evolution; Computer science; Computational complexity theory; Degree (music); Mathematics; Discrete mathematics; Graph; Algorithm; Artificial intelligence; Computer graphics (images)","score_opus":0.04288147402704064,"score_gpt":0.26293117609485334,"score_spread":0.22004970206781269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521937241","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.5489074,0.002839424,0.37666515,0.00838828,0.00034927073,0.0006970246,0.010383467,0.003966704,0.047803253],"genre_scores_gemma":[0.6914072,0.002156993,0.26263183,0.0006799615,0.00044029372,0.00052809826,0.015995234,0.0017327421,0.0244276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689,0.00086045486,0.00024436464,0.00068616256,0.0009065007,0.00041254688],"domain_scores_gemma":[0.9748502,0.020846292,0.0011685304,0.0016431278,0.00081635953,0.0006755903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013835205,0.0018778517,0.002566929,0.0015305235,0.0015484293,0.0076961676,0.005228328,0.0032038018,0.025077369],"category_scores_gemma":[0.017047746,0.001787587,0.0027324152,0.004243924,0.0018619346,0.010165243,0.0034424425,0.0037451733,0.0026713526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024934188,0.000913093,0.007770151,0.0032671401,0.0004430407,0.00084497314,0.0015735959,0.5354384,0.012803585,0.10901513,0.049099036,0.2763384],"study_design_scores_gemma":[0.00044903957,0.00018878722,0.0020222203,0.000086954366,0.00018683654,0.00050490675,0.00056266156,0.7874126,0.0037920736,0.20028518,0.0044483226,0.000060378763],"about_ca_topic_score_codex":0.008538807,"about_ca_topic_score_gemma":0.011725637,"teacher_disagreement_score":0.025077369,"about_ca_system_score_codex":0.003010219,"about_ca_system_score_gemma":0.0028433262,"threshold_uncertainty_score":0.08389217},"labels":[],"label_agreement":null},{"id":"W1521950123","doi":"10.1007/978-3-642-00255-7_18","title":"Application of Graph Transformation in Verification of Dynamic Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invariant (physics); Computer science; Graph rewriting; Transformation (genetics); Theoretical computer science; Graph; Property (philosophy); Distributed computing; State space; Set (abstract data type); System model; Algorithm; Mathematics; Programming language; Software engineering","score_opus":0.0077109048822389505,"score_gpt":0.2247959818739484,"score_spread":0.21708507699170945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521950123","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.003954777,0.00020877678,0.9906279,0.0000783252,0.000039092574,0.000060447845,0.000033540462,0.0011791823,0.003818034],"genre_scores_gemma":[0.239659,0.001039754,0.7528449,0.00012943753,0.0000413454,0.000120661825,0.00017651348,0.00074382767,0.0052445284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988102,0.00046856582,0.00006769064,0.00022602509,0.00034885172,0.00007857593],"domain_scores_gemma":[0.99811745,0.0012343389,0.00006264467,0.0003628894,0.00019812126,0.00002463944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010087063,0.0008715222,0.0007538304,0.0012082342,0.00056896213,0.0009159859,0.0011458854,0.0008790264,0.0040388447],"category_scores_gemma":[0.0033422923,0.0006663736,0.0014165976,0.0013509053,0.0015092388,0.0017908794,0.0013261599,0.0015864507,0.0011846669],"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.00024450693,0.00016779492,0.0006278251,0.00068606506,0.00009822672,0.0006434642,0.0004383611,0.13166837,0.04649459,0.2502787,0.0032191288,0.56543297],"study_design_scores_gemma":[0.0000672768,0.00015943527,0.00034120685,0.00012791474,0.000095698335,0.0005040198,0.000083760075,0.56038994,0.057602923,0.35881782,0.02175748,0.000052602147],"about_ca_topic_score_codex":0.0023069596,"about_ca_topic_score_gemma":0.0019679058,"teacher_disagreement_score":0.0040388447,"about_ca_system_score_codex":0.00059327995,"about_ca_system_score_gemma":0.0007815418,"threshold_uncertainty_score":0.0135112405},"labels":[],"label_agreement":null},{"id":"W1522034305","doi":"10.1007/bfb0023835","title":"On the computation of the Hilbert series","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Ottawa Mental Health Centre","funders":"","keywords":"Monomial; Hilbert–Poincaré series; Monomial basis; Mathematics; Polynomial ring; Ideal (ethics); Polynomial; Principal ideal; Series (stratigraphy); Degree (music); Combinatorics; Homogeneous polynomial; Hilbert series and Hilbert polynomial; Monomial ideal; Discrete mathematics; Hilbert R-tree; Computation; Pure mathematics; Matrix polynomial; Hilbert space; Mathematical analysis; Algorithm; Reproducing kernel Hilbert space; Rigged Hilbert space; Physics","score_opus":0.012370016204102083,"score_gpt":0.22191374476905942,"score_spread":0.20954372856495734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522034305","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.030498749,0.017394148,0.6596941,0.004192878,0.0018851494,0.00007898018,0.00041011185,0.0011415449,0.2847043],"genre_scores_gemma":[0.5351695,0.016401362,0.31034842,0.0015076774,0.0028353787,0.00021296857,0.0010166802,0.0012316329,0.13127634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00020882714,0.00003581057,0.00011568904,0.00027335988,0.00006864568],"domain_scores_gemma":[0.99898976,0.0006551065,0.000034316436,0.00017018327,0.00010019225,0.000050511015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437804,0.0012174248,0.0013746048,0.001665656,0.0011048007,0.003295688,0.0016049937,0.00093497057,0.01307727],"category_scores_gemma":[0.004653851,0.0006733959,0.0011586949,0.0025606551,0.004157985,0.0081090145,0.002150409,0.0037538225,0.0030059388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024115156,0.000009388379,0.000081575155,0.00007313988,0.000009510883,0.000024916913,0.000085686,0.0016857882,0.00039501206,0.96356565,0.0051682075,0.028877007],"study_design_scores_gemma":[0.0000069059433,0.0000050589765,0.00007668882,0.000018169285,0.0000044033113,0.000035464927,0.000011569747,0.0044808765,0.0003223102,0.98695767,0.008074071,0.0000069355056],"about_ca_topic_score_codex":0.0010767151,"about_ca_topic_score_gemma":0.0011814035,"teacher_disagreement_score":0.01307727,"about_ca_system_score_codex":0.0019251517,"about_ca_system_score_gemma":0.00081052125,"threshold_uncertainty_score":0.043747783},"labels":[],"label_agreement":null},{"id":"W1522196234","doi":"10.1007/978-3-540-39899-8_81","title":"Multivariate Statistics for Detection of MS Activity in Serial Multimodal MR Images","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Voxel; Multivariate statistics; Pattern recognition (psychology); Artificial intelligence; Statistics; Computer science; Mathematics","score_opus":0.022082235218496244,"score_gpt":0.2902562857690981,"score_spread":0.2681740505506019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522196234","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.0032056416,0.0006187264,0.9950244,0.0000747863,0.000027319282,0.000013171843,0.00010925129,0.0005970914,0.0003295267],"genre_scores_gemma":[0.078324646,0.002458894,0.91390204,0.0001143763,0.00033020182,0.00018289799,0.00077382196,0.0007067429,0.0032063678],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926716,0.00019816152,0.000071057926,0.000113797956,0.00031061465,0.00003904861],"domain_scores_gemma":[0.99742633,0.0016291792,0.0003141312,0.00030610702,0.00027042715,0.000053876473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013412475,0.0010440119,0.0010747362,0.0015749271,0.00023278092,0.0008315381,0.0009625384,0.0007632399,0.0027439373],"category_scores_gemma":[0.004695158,0.0005605734,0.0009011449,0.002187399,0.00060277135,0.0012157764,0.0007842096,0.0015385901,0.0016772122],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032620793,0.00010233642,0.0011199585,0.0004744005,0.00019328008,0.00014634934,0.000118993536,0.057283692,0.094570816,0.05795871,0.008456112,0.7792492],"study_design_scores_gemma":[0.000024412615,0.00015111252,0.005086113,0.000065206936,0.00011166943,0.00060281396,0.000029732986,0.8916831,0.035008635,0.057572544,0.0095641175,0.00010046584],"about_ca_topic_score_codex":0.00089906424,"about_ca_topic_score_gemma":0.0015589916,"teacher_disagreement_score":0.0027439373,"about_ca_system_score_codex":0.00041499737,"about_ca_system_score_gemma":0.0006575427,"threshold_uncertainty_score":0.009179354},"labels":[],"label_agreement":null},{"id":"W1522233202","doi":"10.1007/978-3-642-37331-2_16","title":"Spatially Local Coding for Object Recognition","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":40,"is_retracted":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":"Pooling; Artificial intelligence; Computer science; Pattern recognition (psychology); Coding (social sciences); Pyramid (geometry); Locality; Spatial analysis; Computer vision; Cognitive neuroscience of visual object recognition; Histogram; Feature (linguistics); Object (grammar); Image (mathematics); Geography; Mathematics","score_opus":0.02915410401670618,"score_gpt":0.27672069472438693,"score_spread":0.24756659070768075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522233202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034476847,0.004146209,0.9837571,0.00017294723,0.00015591583,0.000033030006,0.0002429313,0.0014998576,0.0065442654],"genre_scores_gemma":[0.11758919,0.006727893,0.83287907,0.00033902068,0.00030445112,0.00019873117,0.0018316244,0.00046139053,0.039668664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998324,0.000031641383,0.000008823567,0.000027019487,0.0000788608,0.00002120064],"domain_scores_gemma":[0.9998061,0.000057586538,0.00001230455,0.00007207295,0.0000463549,0.0000056405192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021054674,0.0005827064,0.00060398533,0.0007905388,0.00020066083,0.0006014864,0.0008263273,0.000647191,0.01004119],"category_scores_gemma":[0.0005020074,0.00023960212,0.00033886262,0.0017537811,0.0004693063,0.00091723655,0.00066827453,0.0006600498,0.0043613547],"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.000055347446,0.000034302648,0.00008433315,0.00021489842,0.000022820503,0.000054154803,0.00003586846,0.018054537,0.045786645,0.048317913,0.019233193,0.868106],"study_design_scores_gemma":[0.000028806488,0.00011249494,0.0011521326,0.00014364794,0.000071783674,0.00059055095,0.000074871634,0.69824,0.09891625,0.11357943,0.08702458,0.0000654096],"about_ca_topic_score_codex":0.0030952252,"about_ca_topic_score_gemma":0.0041252826,"teacher_disagreement_score":0.01004119,"about_ca_system_score_codex":0.00039971728,"about_ca_system_score_gemma":0.00044213314,"threshold_uncertainty_score":0.03359109},"labels":[],"label_agreement":null},{"id":"W152230201","doi":"10.1007/978-3-540-24771-5_16","title":"Calculational Relation-Algebraic Proofs in Isabelle/Isar","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Mathematical proof; Relation (database); Algebraic number; Calculus (dental); Computer science; Mathematics; Geometry; Mathematical analysis; Medicine; Data mining","score_opus":0.019382997627091957,"score_gpt":0.24231595754082857,"score_spread":0.22293295991373663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152230201","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.0049937842,0.0042774086,0.87083817,0.0027974576,0.00063156977,0.00012873343,0.00040710802,0.00857115,0.107354626],"genre_scores_gemma":[0.18005098,0.0048676454,0.7344058,0.0012381613,0.0010382136,0.00031547874,0.0013992285,0.0065220357,0.070162416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955449,0.0017214934,0.00030422874,0.0005244124,0.0015944081,0.00031051034],"domain_scores_gemma":[0.9954939,0.0027084865,0.00018962592,0.0009968352,0.0005004724,0.000110646855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057422426,0.0012742347,0.0018981745,0.002135773,0.0025893387,0.006769213,0.0043322467,0.0015375555,0.025097687],"category_scores_gemma":[0.008569816,0.0024782915,0.0024935044,0.002964752,0.0048994063,0.014618616,0.0032407192,0.007410138,0.010353171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018963374,0.00003544616,0.000050897077,0.00019213046,0.000019323788,0.000048784368,0.00037757368,0.0009570956,0.00049697736,0.9461907,0.013826344,0.037785675],"study_design_scores_gemma":[0.00003205046,0.0000134277825,0.00010993778,0.00012280667,0.000023710205,0.0001849428,0.000059599322,0.004633895,0.0019879765,0.9057927,0.08699372,0.000045213605],"about_ca_topic_score_codex":0.0015628255,"about_ca_topic_score_gemma":0.0025064538,"teacher_disagreement_score":0.025097687,"about_ca_system_score_codex":0.002638953,"about_ca_system_score_gemma":0.0024295177,"threshold_uncertainty_score":0.083960176},"labels":[],"label_agreement":null},{"id":"W1522338260","doi":"10.1007/978-3-642-33718-5_27","title":"Fast Fusion Moves for Multi-model Estimation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Fusion; Estimation; Artificial intelligence; Algorithm; Systems engineering","score_opus":0.023451352052131565,"score_gpt":0.2448142502144149,"score_spread":0.22136289816228336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522338260","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.0016869149,0.0006757595,0.9938776,0.000120323406,0.00013579085,0.000015650094,0.00004595763,0.00045583962,0.0029860912],"genre_scores_gemma":[0.11966497,0.0014688531,0.8572327,0.00025525718,0.00022322134,0.00015100845,0.00048284978,0.00072681886,0.019794323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993156,0.00016017976,0.000034678487,0.00015220544,0.0002807162,0.00005668993],"domain_scores_gemma":[0.99871385,0.00073307304,0.00005866836,0.0002775319,0.00017833308,0.00003846596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014536662,0.001364321,0.0015035063,0.0009911394,0.000957522,0.0014842157,0.0018164599,0.0024258383,0.011680535],"category_scores_gemma":[0.004599975,0.0011129731,0.0014281506,0.0011574483,0.0011114357,0.004242792,0.004913305,0.0035287046,0.0036477628],"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.0003199869,0.000064784836,0.00030533376,0.0004177595,0.00019949577,0.00023914824,0.00022880724,0.20454393,0.014861638,0.32003614,0.015916493,0.4428666],"study_design_scores_gemma":[0.000016760026,0.00005645639,0.00016471313,0.000035158024,0.00002710218,0.00015269007,0.00003054757,0.8513118,0.00358229,0.133493,0.011101063,0.000028416604],"about_ca_topic_score_codex":0.00203908,"about_ca_topic_score_gemma":0.0018303137,"teacher_disagreement_score":0.011680535,"about_ca_system_score_codex":0.0006631169,"about_ca_system_score_gemma":0.00045391484,"threshold_uncertainty_score":0.039075315},"labels":[],"label_agreement":null},{"id":"W1522355774","doi":"10.1007/978-3-642-01818-3_21","title":"Optimizing a Pseudo Financial Factor Model with Support Vector Machines and Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Genetic programming; Support vector machine; Computer science; Benchmark (surveying); Principal component analysis; Representation (politics); Factor (programming language); Factor analysis; Genetic algorithm; Data mining; Machine learning; Artificial intelligence; Finance; Economics","score_opus":0.0582502199363612,"score_gpt":0.33246079092161324,"score_spread":0.27421057098525203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522355774","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.030421082,0.00021705456,0.96701473,0.00017897876,0.000091356495,0.000026151793,0.000047841346,0.0002227501,0.0017800509],"genre_scores_gemma":[0.5902939,0.00025189348,0.40425327,0.00015397726,0.00012611838,0.00017865187,0.00022402301,0.00013721758,0.004380863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999613,0.00018949212,0.000019872421,0.00006555933,0.00007910349,0.000032985303],"domain_scores_gemma":[0.9987967,0.0008631396,0.000073763666,0.000056226738,0.00017761851,0.000032458658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720586,0.000744843,0.0009965958,0.00048198702,0.0003568961,0.0010377018,0.001173117,0.0019501694,0.0018991224],"category_scores_gemma":[0.0039440915,0.0006531868,0.00094447506,0.0007836485,0.0006398186,0.0013844393,0.0006419986,0.0012453366,0.00035298167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002956701,0.000013004084,0.00017733678,0.000014581699,0.00001694526,0.000024462732,0.000007959493,0.9810408,0.000201331,0.0032157756,0.0003012679,0.014956929],"study_design_scores_gemma":[0.0000024385465,0.0000041875646,0.00001788937,9.521232e-7,0.000001533467,0.0000022513177,7.2317545e-7,0.9989127,0.00004158265,0.0009733381,0.00004116076,0.000001218888],"about_ca_topic_score_codex":0.0060125086,"about_ca_topic_score_gemma":0.0036814723,"teacher_disagreement_score":0.0060125086,"about_ca_system_score_codex":0.00060326327,"about_ca_system_score_gemma":0.00091460836,"threshold_uncertainty_score":0.011955023},"labels":[],"label_agreement":null},{"id":"W1522356839","doi":"10.1007/978-3-642-21605-3_37","title":"New Techniques for Merging Text Versions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"York University","funders":"","keywords":"Computer science; Window (computing); Overlay; Software versioning; Information retrieval; Track (disk drive); Data mining; World Wide Web; Software; Programming language; Operating system","score_opus":0.024754156250914826,"score_gpt":0.25591865337717473,"score_spread":0.23116449712625992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522356839","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.005948208,0.00089302455,0.9720367,0.00029699842,0.00070987415,0.00026816785,0.0011357905,0.014924652,0.0037865024],"genre_scores_gemma":[0.024813581,0.00056531315,0.95650685,0.00012370267,0.0003868093,0.00018239996,0.0036443118,0.0040991856,0.009677928],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935953,0.00061781774,0.0010025685,0.0016082571,0.0029254032,0.0002507335],"domain_scores_gemma":[0.9812633,0.00617299,0.0010760409,0.0061034933,0.005023087,0.00036109446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042062625,0.0021938381,0.0017499486,0.009759247,0.0022454902,0.00501461,0.004357911,0.0019184987,0.026809817],"category_scores_gemma":[0.024043983,0.0018578803,0.0032485162,0.011056085,0.0014856438,0.011767802,0.005495492,0.002912638,0.012955993],"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.00033259907,0.00010141435,0.0008467917,0.00044408438,0.00014301634,0.00032563068,0.00060236023,0.002270977,0.017961662,0.017134218,0.021386871,0.9384504],"study_design_scores_gemma":[0.0003085884,0.00048570323,0.004094201,0.00045518638,0.0014659549,0.004137393,0.0016186866,0.27661392,0.18385737,0.19364142,0.33292547,0.00039613867],"about_ca_topic_score_codex":0.0016106725,"about_ca_topic_score_gemma":0.0029597636,"teacher_disagreement_score":0.026809817,"about_ca_system_score_codex":0.00068595796,"about_ca_system_score_gemma":0.0014397983,"threshold_uncertainty_score":0.089687765},"labels":[],"label_agreement":null},{"id":"W1522430317","doi":"10.1007/11551898_17","title":"Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Block scheduling; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.02580073436647414,"score_gpt":0.2597937090382982,"score_spread":0.23399297467182403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522430317","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.029634297,0.0005519057,0.9405445,0.00012619646,0.00028747326,0.00010415186,0.00009506007,0.0027360322,0.025920402],"genre_scores_gemma":[0.6170384,0.0008835093,0.34489566,0.00013221205,0.00030420272,0.00017677019,0.00034765832,0.0009371551,0.035284422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973625,0.000041907155,0.000010716353,0.0000439567,0.00010507022,0.000062000596],"domain_scores_gemma":[0.9997464,0.000069170856,0.000019181254,0.00007424588,0.000051299936,0.000039755476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037158924,0.0005254984,0.00054421846,0.0005628893,0.0005394223,0.0009803575,0.0009994336,0.00021987307,0.011069906],"category_scores_gemma":[0.00086451886,0.0003718795,0.0002827551,0.00076619093,0.00033323874,0.0011219558,0.0010126579,0.0008425998,0.0016902197],"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.0012209798,0.0002191513,0.00057509466,0.00021629778,0.00007362405,0.000107895,0.0002189896,0.099060275,0.05862065,0.16495062,0.01782899,0.65690756],"study_design_scores_gemma":[0.00016167905,0.00035818914,0.0006432342,0.000034452623,0.00008889029,0.00016499813,0.000074785625,0.7793939,0.051390562,0.10651356,0.061122485,0.000053251406],"about_ca_topic_score_codex":0.0013382732,"about_ca_topic_score_gemma":0.001963182,"teacher_disagreement_score":0.011069906,"about_ca_system_score_codex":0.0005334894,"about_ca_system_score_gemma":0.0007248496,"threshold_uncertainty_score":0.037032485},"labels":[],"label_agreement":null},{"id":"W1522470493","doi":"10.1007/11559573_85","title":"Color Indexing by Nonparametric Statistics","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Histogram; Nonparametric statistics; Color histogram; Pattern recognition (psychology); Computer science; Robustness (evolution); Kernel density estimation; Artificial intelligence; Search engine indexing; Color space; Mathematics; Kernel method; Kernel (algebra); Algorithm; Statistics; Color image; Estimator; Support vector machine; Image processing; Image (mathematics)","score_opus":0.01536051187205489,"score_gpt":0.25860551573421003,"score_spread":0.24324500386215514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522470493","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.0020174533,0.0005003822,0.9934616,0.000059852595,0.000055160253,0.00001729688,0.00011451957,0.0012096115,0.0025641054],"genre_scores_gemma":[0.12637343,0.0013779353,0.8544882,0.0001544857,0.00025601086,0.00015161632,0.001149921,0.0009181242,0.015130261],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917185,0.00023715675,0.000041938012,0.00016421855,0.00030974494,0.00007521958],"domain_scores_gemma":[0.99856806,0.0004158835,0.000091576425,0.0006050625,0.000271354,0.000047971702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010531598,0.00056998717,0.0014934835,0.0022399556,0.000642383,0.0021491956,0.0013151198,0.0006202491,0.007587259],"category_scores_gemma":[0.0034910254,0.0005263464,0.00090832735,0.004080761,0.0012119649,0.002776343,0.0016707057,0.0015380884,0.0037491107],"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.00015276863,0.00007137194,0.00038822595,0.00014117247,0.000046227324,0.000035202323,0.00004731085,0.02903071,0.013216265,0.18303473,0.0142405145,0.7595955],"study_design_scores_gemma":[0.000021721036,0.00004916431,0.00072737486,0.000025790974,0.000029454046,0.0002240311,0.000030004801,0.6999665,0.01317211,0.26557863,0.020123214,0.00005197017],"about_ca_topic_score_codex":0.0018387948,"about_ca_topic_score_gemma":0.0024921598,"teacher_disagreement_score":0.007587259,"about_ca_system_score_codex":0.00081599085,"about_ca_system_score_gemma":0.0008611574,"threshold_uncertainty_score":0.025381923},"labels":[],"label_agreement":null},{"id":"W1522548419","doi":"10.1007/3-540-44590-0_29","title":"Treatment of Diagrams in Document Image Analysis","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Document processing; Rule-based machine translation; Optical character recognition; Artificial intelligence; Natural language processing; Syntax; Image processing; Text processing; Graph; Information retrieval; Pattern recognition (psychology); Image (mathematics); Theoretical computer science","score_opus":0.011672702102148384,"score_gpt":0.2589394180748358,"score_spread":0.2472667159726874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522548419","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.00089495716,0.003810677,0.98387074,0.00018101103,0.0002911953,0.00003351351,0.00009879719,0.00060593325,0.010213123],"genre_scores_gemma":[0.046060488,0.009003541,0.8989583,0.00023962845,0.00042429066,0.00020168639,0.00049518555,0.00087041355,0.043746445],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995962,0.00011793968,0.00003199926,0.00006520494,0.00016555504,0.000023085951],"domain_scores_gemma":[0.9993305,0.00034044226,0.000039479128,0.0001016003,0.00016472212,0.000023306397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043450293,0.0008546236,0.0006241656,0.0021747623,0.00055117736,0.0021351075,0.001153325,0.00078593515,0.012143206],"category_scores_gemma":[0.0025733002,0.00044253984,0.00077460747,0.002253578,0.00084230804,0.0020639836,0.0007407721,0.001003961,0.0052874745],"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.000030816314,0.000026569682,0.000191127,0.0007454491,0.000023016388,0.00028590884,0.0002550682,0.012866112,0.011610098,0.42891827,0.021897068,0.5231505],"study_design_scores_gemma":[0.000012107589,0.000051952888,0.00040254346,0.0003541283,0.00005228526,0.0014947492,0.00020547923,0.12052604,0.015643556,0.41433805,0.44687814,0.000041016556],"about_ca_topic_score_codex":0.0010098938,"about_ca_topic_score_gemma":0.0015565293,"teacher_disagreement_score":0.012143206,"about_ca_system_score_codex":0.00053807895,"about_ca_system_score_gemma":0.0004356731,"threshold_uncertainty_score":0.04062301},"labels":[],"label_agreement":null},{"id":"W1522576837","doi":"10.1007/978-3-642-03641-5_6","title":"Parallel Hidden Hierarchical Fields for Multi-scale Reconstruction","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scale (ratio); Key (lock); Hidden Markov model; Artificial intelligence; Hierarchical database model; Theoretical computer science; Algorithm; Data mining","score_opus":0.03602701384385946,"score_gpt":0.29476145734540643,"score_spread":0.25873444350154695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522576837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024596052,0.00014955945,0.9962676,0.000063442545,0.0000262982,0.000011684444,0.00005965995,0.0003190662,0.0006431782],"genre_scores_gemma":[0.13171603,0.00056594395,0.8605976,0.00012058863,0.00009595751,0.000080306825,0.0005174904,0.00028846078,0.006017724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997998,0.000054693242,0.000010907699,0.000037938706,0.00007198718,0.000024702447],"domain_scores_gemma":[0.99946207,0.00023830043,0.000033439872,0.00016547457,0.00007054648,0.000030186848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006529317,0.00062355056,0.00080749433,0.0006891776,0.00037857835,0.00070585444,0.0011098038,0.0011096457,0.0047469297],"category_scores_gemma":[0.0014700098,0.00058371254,0.00075190014,0.0010287659,0.0006412997,0.0014773598,0.0014882464,0.0013605225,0.0010218278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002774159,0.00010010612,0.00038610987,0.00020939713,0.00011427255,0.000099374935,0.00010175444,0.42383686,0.023809914,0.13625538,0.008389935,0.40641943],"study_design_scores_gemma":[0.000009741129,0.000010119197,0.0000637034,0.000005218836,0.0000060801603,0.000024405004,0.0000051433426,0.9671166,0.0022066662,0.029306656,0.0012394079,0.000006296409],"about_ca_topic_score_codex":0.0026161752,"about_ca_topic_score_gemma":0.0041793515,"teacher_disagreement_score":0.0047469297,"about_ca_system_score_codex":0.0005858721,"about_ca_system_score_gemma":0.0006045924,"threshold_uncertainty_score":0.015880108},"labels":[],"label_agreement":null},{"id":"W1522612262","doi":"10.1007/978-3-642-13778-5_4","title":"Security, Privacy, and Dependability in Smart Homes: A Pattern Catalog Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Sherbrooke","funders":"","keywords":"Dependability; Computer science; Computer security; Home automation; Sketch; Autonomy; Internet privacy; Ubiquitous computing; Human–computer interaction; Software engineering; Telecommunications","score_opus":0.019187038122198526,"score_gpt":0.24103005756866863,"score_spread":0.2218430194464701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522612262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021626404,0.0049593654,0.92412245,0.0041437363,0.00018925282,0.00040034842,0.0011998449,0.0010258708,0.042332772],"genre_scores_gemma":[0.35296217,0.010967654,0.58643067,0.00094872457,0.0005242704,0.00083380385,0.0033101272,0.00042999,0.043592595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975828,0.000568814,0.00035366934,0.00046650955,0.0008855151,0.00014270372],"domain_scores_gemma":[0.9938579,0.0028136363,0.0004475865,0.0018219022,0.0009131613,0.00014586613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022515655,0.0007579637,0.001496476,0.004886778,0.0020085624,0.0066074133,0.0030228172,0.002736109,0.010517577],"category_scores_gemma":[0.008335519,0.00087585737,0.0016646747,0.009659364,0.0029802138,0.022310307,0.0023307353,0.00231896,0.002504877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007842533,0.00015379628,0.0030991428,0.0004001769,0.0000394077,0.0005882727,0.0009194475,0.007568465,0.0013411978,0.7205601,0.012263867,0.25298777],"study_design_scores_gemma":[0.000019279445,0.000069075606,0.0013480585,0.00021108892,0.000055280085,0.0014227586,0.0008544496,0.062826335,0.0021773758,0.8761146,0.054858815,0.00004290454],"about_ca_topic_score_codex":0.0041712723,"about_ca_topic_score_gemma":0.0033973453,"teacher_disagreement_score":0.010517577,"about_ca_system_score_codex":0.00198862,"about_ca_system_score_gemma":0.0015309425,"threshold_uncertainty_score":0.03518474},"labels":[],"label_agreement":null},{"id":"W1522635674","doi":"10.1007/978-3-540-73729-2_13","title":"An Aggregation of Agents, Roles and Coalition Formation to Support Collaborative and Dynamic Organizations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Key (lock); Knowledge management; Context (archaeology); Process management; Distributed computing; Computer security","score_opus":0.014757583431663564,"score_gpt":0.2745039057166845,"score_spread":0.2597463222850209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522635674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016118608,0.00057967723,0.9691775,0.00060569076,0.0003480645,0.00020317394,0.00012852522,0.0020853758,0.010753515],"genre_scores_gemma":[0.18107857,0.0005354588,0.8028104,0.00022263183,0.00010513104,0.0003382103,0.0003914934,0.00017647017,0.014341726],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994454,0.00017421128,0.00005112998,0.000082944825,0.00019851525,0.000047832273],"domain_scores_gemma":[0.9992131,0.00031308195,0.00005853245,0.00020711261,0.00010304182,0.00010519235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013133986,0.00036633486,0.0005543,0.00044279828,0.0012949957,0.0017609055,0.0013129034,0.0007591238,0.002780055],"category_scores_gemma":[0.002366116,0.0003217597,0.00046670457,0.0008032921,0.0006845777,0.0018615288,0.002621719,0.0011422074,0.0006452965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003855016,0.00033256412,0.001399072,0.00046119076,0.00010550667,0.00071811513,0.002066149,0.06762232,0.023271935,0.4286059,0.03240355,0.44262815],"study_design_scores_gemma":[0.00017123541,0.00035106,0.00090832583,0.00012242336,0.00018591204,0.0007213936,0.0004788559,0.54236215,0.013317907,0.2539767,0.18733275,0.00007126033],"about_ca_topic_score_codex":0.0019008983,"about_ca_topic_score_gemma":0.0036593736,"teacher_disagreement_score":0.002780055,"about_ca_system_score_codex":0.000404819,"about_ca_system_score_gemma":0.0012722567,"threshold_uncertainty_score":0.009300172},"labels":[],"label_agreement":null},{"id":"W1522639526","doi":"10.1007/11682462_38","title":"Maximizing Throughput in Queueing Networks with Limited Flexibility","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","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":"McMaster University","funders":"","keywords":"Server; Computer science; Queueing theory; Throughput; Flexibility (engineering); Layered queueing network; Class (philosophy); Computer network; Distributed computing; Set (abstract data type); Mathematical optimization; Mathematics; Artificial intelligence; Operating system","score_opus":0.016320312584408362,"score_gpt":0.22841596704720743,"score_spread":0.21209565446279907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522639526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098005176,0.0029985378,0.88397723,0.00196262,0.00025396422,0.00009775593,0.00016442512,0.00057951326,0.011960734],"genre_scores_gemma":[0.967218,0.0013301834,0.02688931,0.00018887354,0.00038865293,0.00011036286,0.000051235325,0.00013780933,0.0036856134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965759,0.001654473,0.00011745085,0.00044951367,0.00057651824,0.0006260184],"domain_scores_gemma":[0.9871148,0.010814103,0.0005980599,0.00048198798,0.00053014734,0.00046099242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053703,0.001849453,0.0028520068,0.0011879298,0.0013981595,0.003794791,0.0036021462,0.0024443713,0.002315386],"category_scores_gemma":[0.019365195,0.0017005597,0.0007718899,0.0028173083,0.0028655245,0.004944496,0.0024496943,0.0022285974,0.00041107854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022532509,0.000060496914,0.00028847012,0.000121209494,0.00004033489,0.00009335391,0.00011791299,0.9018908,0.0021070428,0.08308266,0.0014863318,0.010486089],"study_design_scores_gemma":[0.000016331802,0.000022324373,0.00007278886,0.000011882024,0.000013114627,0.000021928543,0.000015514841,0.9428586,0.00031627508,0.056397326,0.0002420799,0.000011963458],"about_ca_topic_score_codex":0.0028056724,"about_ca_topic_score_gemma":0.0021330602,"teacher_disagreement_score":0.005053703,"about_ca_system_score_codex":0.0043241787,"about_ca_system_score_gemma":0.0019138257,"threshold_uncertainty_score":0.031374276},"labels":[],"label_agreement":null},{"id":"W1522644772","doi":"10.1007/978-3-642-14049-5_36","title":"Data Mining in Precision Agriculture: Management of Spatial Information","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soil Geostatistics and Mapping","field":"Environmental Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Field (mathematics); Data mining; Machine learning; Spatial analysis; Task (project management); Precision agriculture; Global Positioning System; Variety (cybernetics); Regression; Artificial neural network; Support vector machine; Big data; Artificial intelligence; Independence (probability theory); Agriculture; Statistics; Geography; Mathematics","score_opus":0.014914128836228325,"score_gpt":0.22965052487092052,"score_spread":0.2147363960346922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522644772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025591785,0.058220074,0.9195225,0.0048609828,0.0010155512,0.000108545915,0.0011387449,0.0016305718,0.010943785],"genre_scores_gemma":[0.030716378,0.060813397,0.8865843,0.0012096,0.0012257991,0.0001851174,0.0031325407,0.00055299856,0.015579829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984933,0.0003190994,0.0001538767,0.00034313826,0.00063748186,0.00005296684],"domain_scores_gemma":[0.9971379,0.0017455633,0.00012170949,0.0005377306,0.00037656244,0.000080488026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023867607,0.0011373726,0.0018068271,0.0024564236,0.00057568477,0.004427411,0.0031900092,0.001532563,0.0046675433],"category_scores_gemma":[0.004424041,0.0010811306,0.0012326791,0.008743813,0.0016617894,0.005814127,0.0021676032,0.002732219,0.0030287735],"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.00003493248,0.00007250877,0.0008743429,0.0016545469,0.00011016861,0.00013368978,0.0003167692,0.011116278,0.001961442,0.09820233,0.07840596,0.80711704],"study_design_scores_gemma":[0.000024867755,0.00008274237,0.0020876941,0.0009302288,0.00010450383,0.0010997013,0.0002854446,0.11043871,0.007470327,0.42525268,0.45212665,0.00009645376],"about_ca_topic_score_codex":0.0022103123,"about_ca_topic_score_gemma":0.0027375838,"teacher_disagreement_score":0.0046675433,"about_ca_system_score_codex":0.000931944,"about_ca_system_score_gemma":0.0015174992,"threshold_uncertainty_score":0.01561451},"labels":[],"label_agreement":null},{"id":"W1522664242","doi":"10.1007/11422778_100","title":"Cross-Layer Radio Resource Allocation in Packet CDMA Wireless Mobile Networks with LMMSE Receivers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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 British Columbia","funders":"","keywords":"Computer network; Computer science; Quality of service; Physical layer; Network packet; Wireless network; Radio resource management; Network layer; Code division multiple access; Wireless; Layer (electronics); Telecommunications","score_opus":0.019142569813726897,"score_gpt":0.27621483890203746,"score_spread":0.25707226908831055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522664242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027043508,0.003824627,0.95924675,0.0001548121,0.00015802817,0.000033290136,0.000019124867,0.000531981,0.008988003],"genre_scores_gemma":[0.71835244,0.002326188,0.2577607,0.00027967492,0.00035329637,0.000114525996,0.00007502873,0.00020148647,0.020536613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00014151752,0.000014632668,0.000043011827,0.00012073622,0.000054013988],"domain_scores_gemma":[0.9995167,0.00031165787,0.000023431721,0.000053404732,0.00007975432,0.000015085334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248062,0.00041901253,0.0004886695,0.0003054989,0.00033218187,0.00089649286,0.000849669,0.00045507637,0.0023123194],"category_scores_gemma":[0.0015816032,0.0003710411,0.00018729708,0.0005062973,0.00040415386,0.0007660066,0.0006944947,0.00076959206,0.00055020215],"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.00039971588,0.00020825407,0.000840186,0.00017363098,0.000093676535,0.00014120972,0.0001535698,0.318629,0.050006043,0.05571986,0.0056426306,0.56799227],"study_design_scores_gemma":[0.00001843706,0.000121850666,0.0005220467,0.00001888523,0.000036332935,0.00017395675,0.000023387407,0.96968085,0.012952296,0.010051889,0.00638156,0.000018564871],"about_ca_topic_score_codex":0.0005013606,"about_ca_topic_score_gemma":0.001070972,"teacher_disagreement_score":0.0023123194,"about_ca_system_score_codex":0.00047821953,"about_ca_system_score_gemma":0.0003237953,"threshold_uncertainty_score":0.0077355504},"labels":[],"label_agreement":null},{"id":"W1522676178","doi":"10.1007/978-3-540-24840-8_57","title":"Software Agents in CVW","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Acadia University","funders":"","keywords":"Workspace; Computer science; Software; Architecture; Software engineering; Human–computer interaction; Software architecture; Virtual machine; Artificial intelligence; Operating system","score_opus":0.03521342457722028,"score_gpt":0.2846275222101677,"score_spread":0.24941409763294742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522676178","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.02216738,0.0057232883,0.43735063,0.006572661,0.0012091608,0.00010832869,0.0001641149,0.0017322362,0.5249722],"genre_scores_gemma":[0.35173312,0.00413017,0.15964036,0.00088102685,0.00047672918,0.00028821523,0.0008185095,0.0014382842,0.48059362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887675,0.0004045697,0.00006774366,0.0002037057,0.00032168234,0.00012546797],"domain_scores_gemma":[0.99904376,0.00035958484,0.00006945283,0.00023804719,0.00016086323,0.00012820195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245896,0.0004410738,0.0003751901,0.001229797,0.0013825868,0.0066586067,0.0014243048,0.0018625816,0.021506399],"category_scores_gemma":[0.0044787624,0.00047136258,0.00035496318,0.0021760727,0.002014115,0.0068534007,0.0031110353,0.0022988566,0.004816317],"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.000014854716,0.000030182195,0.00014832357,0.00004595656,0.000005235798,0.00008312576,0.0007678014,0.0013463761,0.00045679798,0.89136475,0.01266829,0.093068264],"study_design_scores_gemma":[0.000012441977,0.000015249389,0.00020722019,0.000103926424,0.000007672417,0.00019477194,0.0005158116,0.010592755,0.0009565509,0.53836536,0.44901317,0.000015049538],"about_ca_topic_score_codex":0.004626129,"about_ca_topic_score_gemma":0.004329841,"teacher_disagreement_score":0.021506399,"about_ca_system_score_codex":0.0014198608,"about_ca_system_score_gemma":0.0013981562,"threshold_uncertainty_score":0.071946084},"labels":[],"label_agreement":null},{"id":"W1522692615","doi":"10.1007/11428848_119","title":"Simultaneous Alignment and Structure Prediction of RNAs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Ottawa","funders":"","keywords":"Computer science; Inference; Sequence (biology); Algorithm; Sensitivity (control systems); Nucleic acid secondary structure; Data mining; Artificial intelligence; RNA; Biology; Genetics","score_opus":0.00735538605007773,"score_gpt":0.21402169404816176,"score_spread":0.20666630799808403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522692615","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.17956483,0.0022919027,0.78865504,0.00034631422,0.00029166046,0.00025579726,0.005674691,0.01684718,0.006072639],"genre_scores_gemma":[0.27080652,0.00058163796,0.70109075,0.00010076409,0.00016148621,0.00021592082,0.022222921,0.0014706166,0.0033493752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983315,0.00034658727,0.000121175275,0.00067115267,0.00039039756,0.00013927184],"domain_scores_gemma":[0.99768054,0.0010695849,0.00026101826,0.00043860776,0.00040477427,0.00014548372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011111499,0.0018992786,0.001755673,0.002902215,0.001282132,0.002138724,0.0018378744,0.0016557312,0.003995199],"category_scores_gemma":[0.0036929476,0.0014919051,0.0017868367,0.0030449675,0.0006207512,0.0020499425,0.0013928773,0.0018336173,0.004017556],"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.002574119,0.00046031413,0.0053250254,0.0011031788,0.00047682718,0.0010643537,0.0002474065,0.035523634,0.42752016,0.0060448665,0.018375045,0.5012851],"study_design_scores_gemma":[0.00020462734,0.0006104184,0.0074105,0.00006520441,0.00038114676,0.0010215134,0.00020028635,0.6911831,0.26441917,0.017793166,0.016627973,0.00008293815],"about_ca_topic_score_codex":0.00094723137,"about_ca_topic_score_gemma":0.0024420738,"teacher_disagreement_score":0.003995199,"about_ca_system_score_codex":0.00043758878,"about_ca_system_score_gemma":0.0010101497,"threshold_uncertainty_score":0.013365328},"labels":[],"label_agreement":null},{"id":"W1522755227","doi":"10.1007/11766247_8","title":"A New Profile Alignment Method for Clustering Gene Expression Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Windsor","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Similarity (geometry); Focus (optics); Single-linkage clustering; Cluster (spacecraft); Correlation clustering; CURE data clustering algorithm; Pattern recognition (psychology); Clustering high-dimensional data; Artificial intelligence","score_opus":0.03340420875251276,"score_gpt":0.3092505685748717,"score_spread":0.27584635982235894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522755227","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.0013849665,0.00011561731,0.99286425,0.000037948863,0.00009029446,0.000054216962,0.0004241493,0.004618634,0.00040985478],"genre_scores_gemma":[0.008734657,0.00015444237,0.9848802,0.00006913364,0.0000696469,0.00022171215,0.0022932484,0.000942602,0.0026344708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976979,0.00027701852,0.00018755581,0.0006314342,0.0010842737,0.00012172327],"domain_scores_gemma":[0.9984609,0.00039338032,0.00010510745,0.00039022558,0.00055039127,0.00010006723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013929224,0.0014835846,0.0017933275,0.0033071735,0.0016054002,0.0021797388,0.0021425998,0.0010525545,0.0066014845],"category_scores_gemma":[0.0037203704,0.0010763064,0.001969011,0.0060821436,0.00057770725,0.0022729295,0.0021565855,0.0025503254,0.007379484],"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.00023240544,0.00016346962,0.0011949039,0.0002693057,0.00023609682,0.00018828019,0.00021788417,0.005550186,0.0609843,0.0054562027,0.022360373,0.9031467],"study_design_scores_gemma":[0.0002498081,0.00031810958,0.008913024,0.00011985454,0.00043183964,0.0036258786,0.0003087102,0.6490393,0.11163679,0.06597093,0.15902418,0.00036153718],"about_ca_topic_score_codex":0.0026086012,"about_ca_topic_score_gemma":0.004725955,"teacher_disagreement_score":0.0066014845,"about_ca_system_score_codex":0.0004691428,"about_ca_system_score_gemma":0.0016124224,"threshold_uncertainty_score":0.022084177},"labels":[],"label_agreement":null},{"id":"W1522776861","doi":"10.1007/978-3-642-12963-6_20","title":"Dynamic Service Placement in Shared Service Hosting Infrastructures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Distributed computing; Service (business); Cloud computing; Popularity; Service delivery framework; Virtual machine; Computer network; Computer security; Operating system","score_opus":0.011512831612591713,"score_gpt":0.241461733199528,"score_spread":0.2299489015869363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522776861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115714386,0.0010217633,0.87370765,0.000399282,0.00012494817,0.00017556039,0.000110348,0.0017889049,0.0069571133],"genre_scores_gemma":[0.67724264,0.00056004385,0.3159211,0.000053170046,0.00006182167,0.000105095925,0.00024680572,0.00019316225,0.0056160535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999041,0.00028876847,0.0000417947,0.00019519831,0.0002282019,0.00020496816],"domain_scores_gemma":[0.9990326,0.00041493616,0.000115469025,0.0001840125,0.00010603625,0.00014699076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009319711,0.0009134697,0.0012235466,0.00084286154,0.0014696592,0.0016288053,0.0019532598,0.0014934366,0.0026915695],"category_scores_gemma":[0.0030874147,0.00095541374,0.00046737125,0.0020783185,0.0009785463,0.0020000031,0.002432797,0.0008014048,0.00077354995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028064687,0.00008015952,0.0010662028,0.0001360791,0.000030470797,0.0003653455,0.0002844185,0.8471454,0.0055619013,0.027981695,0.0035622413,0.11350549],"study_design_scores_gemma":[0.000021808732,0.00006013263,0.0002120297,0.000012169938,0.000009161119,0.00013454544,0.00013850546,0.9776365,0.0019944482,0.016705096,0.0030646706,0.000011040718],"about_ca_topic_score_codex":0.0038462288,"about_ca_topic_score_gemma":0.0034002527,"teacher_disagreement_score":0.0038462288,"about_ca_system_score_codex":0.002275022,"about_ca_system_score_gemma":0.0011919553,"threshold_uncertainty_score":0.016506493},"labels":[],"label_agreement":null},{"id":"W1522805649","doi":"10.1007/11739685_23","title":"From Clusters to Rules: A Hybrid Framework for Generalized Symbolic Rule Induction","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Rule induction; Computer science; Decision rule; Rough set; Data mining; Admissible decision rule; Decision table; Decision tree; Artificial intelligence; Cluster analysis; Machine learning; Weighted sum model; Optimal decision","score_opus":0.02095133421915504,"score_gpt":0.2566058621411619,"score_spread":0.23565452792200683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522805649","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.0018965292,0.0001382614,0.9957552,0.000056852805,0.000021091746,0.000059786707,0.0001591435,0.0007282255,0.0011849764],"genre_scores_gemma":[0.06306615,0.00025920355,0.9331231,0.00009003407,0.000052335665,0.00022450218,0.0007077109,0.00026923566,0.0022077393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978077,0.00071512355,0.00018990034,0.00041848657,0.0007619935,0.00010693433],"domain_scores_gemma":[0.9972773,0.0015619867,0.00010784042,0.0006035161,0.00037801778,0.000071289716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017446456,0.00088795094,0.0017294771,0.002139404,0.0008005366,0.0028078547,0.0033946356,0.0008772054,0.007426207],"category_scores_gemma":[0.0061709685,0.0008131198,0.0022711977,0.0034775499,0.0020047666,0.004297331,0.0028902187,0.002298978,0.0020611705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002297544,0.00010621369,0.0006300913,0.0005590931,0.00029866348,0.00031667724,0.00080237986,0.12203206,0.0040095104,0.47005242,0.007013538,0.3939496],"study_design_scores_gemma":[0.000025343643,0.000036228354,0.00014391738,0.000050775896,0.00006589169,0.00006372582,0.00006854272,0.4933886,0.0019239293,0.49783936,0.0063674795,0.000026264526],"about_ca_topic_score_codex":0.0037472092,"about_ca_topic_score_gemma":0.0066864355,"teacher_disagreement_score":0.007426207,"about_ca_system_score_codex":0.000861976,"about_ca_system_score_gemma":0.0013534352,"threshold_uncertainty_score":0.024843097},"labels":[],"label_agreement":null},{"id":"W1522811422","doi":"10.1007/978-3-642-15784-4_7","title":"Continuous Time and/or Continuous Distributions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.015675202743410943,"score_gpt":0.2635779007240898,"score_spread":0.24790269798067888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522811422","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.011231151,0.00639699,0.5560007,0.0023140514,0.0020132025,0.0000652003,0.00042439133,0.0005552008,0.42099917],"genre_scores_gemma":[0.4736895,0.012666491,0.10501488,0.0017346092,0.002906944,0.00028235494,0.00074274075,0.0006870356,0.40227538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.00004933735,0.000021448026,0.00012140246,0.00016241,0.000047711397],"domain_scores_gemma":[0.99929154,0.00037105044,0.000053219912,0.00013851709,0.00009512779,0.00005045766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004261136,0.0006658559,0.00043877694,0.0006282808,0.00039151293,0.0019292028,0.0006231052,0.00077337754,0.019821934],"category_scores_gemma":[0.0019804405,0.00026327296,0.0004439955,0.0009860331,0.002580709,0.0038116176,0.0009345355,0.0022680978,0.0029509512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011401402,0.000005521466,0.000028402983,0.000059828588,0.000003204081,0.00004742518,0.00006001379,0.0005597943,0.0006491307,0.9787894,0.0038062874,0.015979644],"study_design_scores_gemma":[0.000010209646,0.000017446559,0.00011048807,0.000029204148,0.0000075719995,0.00022058567,0.00004477685,0.0037852458,0.0012267617,0.9076654,0.08687219,0.00001013519],"about_ca_topic_score_codex":0.00045612172,"about_ca_topic_score_gemma":0.00031234234,"teacher_disagreement_score":0.019821934,"about_ca_system_score_codex":0.0006559848,"about_ca_system_score_gemma":0.0005090577,"threshold_uncertainty_score":0.066311},"labels":[],"label_agreement":null},{"id":"W1522877314","doi":"10.1007/978-3-642-15396-9_4","title":"Testing Expressibility Is Hard","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Constraint (computer-aided design); Domain (mathematical analysis); Theoretical computer science; Conjunctive normal form; Discrete mathematics; Algorithm; Mathematics","score_opus":0.02705668565429976,"score_gpt":0.2504497056246213,"score_spread":0.22339301997032157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522877314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23652066,0.002465353,0.5558434,0.044219885,0.0022604018,0.0004529491,0.0023992402,0.007648045,0.14818998],"genre_scores_gemma":[0.8563842,0.0012503798,0.10693371,0.004563117,0.0010109924,0.00041376913,0.002513711,0.0018600727,0.02506997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9831594,0.0036998515,0.001326335,0.004154013,0.0061227134,0.0015376374],"domain_scores_gemma":[0.8830427,0.08854313,0.0031821425,0.017134001,0.0062137092,0.0018843962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057257004,0.0019639435,0.001943838,0.0016609613,0.0016784613,0.0061342823,0.0042245085,0.0038078371,0.0123374425],"category_scores_gemma":[0.06310822,0.0019867264,0.0034599018,0.0017332276,0.008665185,0.026884524,0.009078643,0.012038848,0.0034203269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006015797,0.0005423372,0.0061883866,0.0011847983,0.00031957324,0.0010812266,0.0011728201,0.016103467,0.011091072,0.7424536,0.03160336,0.18765776],"study_design_scores_gemma":[0.000047248173,0.000073733456,0.00043729082,0.00014643048,0.00005778746,0.00033215337,0.0003583504,0.01423762,0.0072692684,0.96759564,0.009410771,0.00003372661],"about_ca_topic_score_codex":0.000756342,"about_ca_topic_score_gemma":0.0009078852,"teacher_disagreement_score":0.0123374425,"about_ca_system_score_codex":0.0015955816,"about_ca_system_score_gemma":0.0017016124,"threshold_uncertainty_score":0.04127288},"labels":[],"label_agreement":null},{"id":"W1522877504","doi":"10.1007/978-3-540-44400-8_6","title":"On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Inequality; Type (biology); Mathematics; Semidefinite programming; Time complexity; Polynomial; Combinatorics; Mathematical optimization; Mathematical analysis","score_opus":0.11658553600442273,"score_gpt":0.27467256941307483,"score_spread":0.1580870334086521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522877504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52848774,0.0048964834,0.37327793,0.024610963,0.0006833873,0.00072279904,0.008373952,0.0021035052,0.05684325],"genre_scores_gemma":[0.7793128,0.0020317133,0.19633923,0.0013107017,0.001311936,0.00064408977,0.0079464195,0.00076828897,0.01033481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887744,0.0039548916,0.00091375137,0.0020766591,0.003096089,0.001184185],"domain_scores_gemma":[0.7678067,0.21477605,0.0044228924,0.0073030647,0.0034039936,0.002287241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009912228,0.0018377631,0.00429504,0.0025963068,0.0026655924,0.01035887,0.0067410073,0.0038036301,0.019041987],"category_scores_gemma":[0.083592094,0.001670243,0.00471241,0.005364983,0.0052872165,0.024820251,0.0066959807,0.007431246,0.001163536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039382414,0.0009845062,0.027235202,0.0022617064,0.00081498653,0.0009438974,0.0018048001,0.28751728,0.004690378,0.46114755,0.0436502,0.16501123],"study_design_scores_gemma":[0.0002568219,0.00011320035,0.0026866272,0.00008076151,0.00015593324,0.00029185432,0.00041081605,0.37597194,0.0010419524,0.61761886,0.0013162949,0.000054968725],"about_ca_topic_score_codex":0.009836773,"about_ca_topic_score_gemma":0.010712798,"teacher_disagreement_score":0.019041987,"about_ca_system_score_codex":0.005642931,"about_ca_system_score_gemma":0.005607558,"threshold_uncertainty_score":0.06370181},"labels":[],"label_agreement":null},{"id":"W1522894013","doi":"10.1007/3-540-47906-6_76","title":"Dynamic Online Routing Algorithm for MPLS Traffic Engineering","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Equal-cost multi-path routing; Multiprotocol Label Switching; Computer network; Static routing; Routing (electronic design automation); Distributed computing; Link-state routing protocol; Bandwidth (computing); Policy-based routing; Dynamic Source Routing; Multipath routing; Algorithm; Routing protocol; Quality of service","score_opus":0.010540313508659303,"score_gpt":0.2189825577600339,"score_spread":0.2084422442513746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522894013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01465773,0.00023012426,0.97890544,0.00016365584,0.00012161778,0.00007451573,0.00007427932,0.0014296741,0.0043428796],"genre_scores_gemma":[0.27145025,0.0002605015,0.71682626,0.00016780518,0.00008747378,0.00021647452,0.00031605057,0.00022423592,0.010450877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971825,0.00005027339,0.000013393119,0.000049103797,0.00012815448,0.000040864415],"domain_scores_gemma":[0.9996414,0.00011841318,0.000026774998,0.000070400245,0.00011464485,0.000028258628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048331826,0.00051052426,0.0007803139,0.00064707315,0.00057910336,0.0007126429,0.0014320961,0.00064516795,0.0041352245],"category_scores_gemma":[0.0010065372,0.00024308586,0.00025550436,0.0007004754,0.00029170193,0.0011266158,0.0008568766,0.000953029,0.0008306048],"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.0003447482,0.00038281124,0.00039951195,0.000089750356,0.000033900244,0.000057150522,0.00006189205,0.2413041,0.011000902,0.028190121,0.010017549,0.7081176],"study_design_scores_gemma":[0.000031714684,0.00003833881,0.00009861336,0.000004447259,0.000009476904,0.000037706246,0.00000933717,0.9878328,0.0025380335,0.0070274784,0.0023649677,0.0000071086574],"about_ca_topic_score_codex":0.0018813405,"about_ca_topic_score_gemma":0.0031445855,"teacher_disagreement_score":0.0041352245,"about_ca_system_score_codex":0.0007901483,"about_ca_system_score_gemma":0.000976984,"threshold_uncertainty_score":0.013833702},"labels":[],"label_agreement":null},{"id":"W1522987234","doi":"10.1007/11559573_41","title":"Grayscale Two-Dimensional Lempel-Ziv Encoding","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Lossless compression; Computer science; Grayscale; JPEG; Color Cell Compression; Image compression; Data compression; Artificial intelligence; Compression (physics); Lossy compression; Data compression ratio; Computer vision; Compression ratio; Lossless JPEG; Encoding (memory); JPEG 2000; Pixel; Pattern recognition (psychology); Image (mathematics); Image processing","score_opus":0.01639603914863114,"score_gpt":0.25129319283220836,"score_spread":0.23489715368357722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522987234","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.046598475,0.0029171621,0.84744304,0.0015715387,0.0007010085,0.00018882885,0.0018756381,0.0038158689,0.09488845],"genre_scores_gemma":[0.4848263,0.0029794993,0.43727177,0.0015063131,0.0003380729,0.00034439936,0.0037449873,0.0006283341,0.06836036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998173,0.000029446053,0.000014687791,0.0000255913,0.000078626064,0.000034316505],"domain_scores_gemma":[0.999736,0.00006315991,0.000017765582,0.00010557039,0.00006315474,0.000014324316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019026232,0.00047845527,0.00044070015,0.0008882508,0.00034803327,0.0011972089,0.0006069234,0.00080266886,0.012847984],"category_scores_gemma":[0.0011703772,0.00015239268,0.00029865323,0.0012836679,0.00041544446,0.0013345121,0.001039771,0.00087273796,0.0041087586],"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.00049113465,0.00012509042,0.00025896975,0.0004056108,0.000025368958,0.00038401928,0.00015451702,0.021698913,0.06036799,0.2813843,0.031109834,0.60359436],"study_design_scores_gemma":[0.00018624119,0.0003169413,0.0010154392,0.00045639955,0.000077197554,0.0024599342,0.0001824888,0.3748921,0.18462774,0.3038116,0.1318011,0.0001728473],"about_ca_topic_score_codex":0.0004678897,"about_ca_topic_score_gemma":0.0007291579,"teacher_disagreement_score":0.012847984,"about_ca_system_score_codex":0.0004324983,"about_ca_system_score_gemma":0.000515344,"threshold_uncertainty_score":0.04298079},"labels":[],"label_agreement":null},{"id":"W1523014184","doi":"10.1007/11693017_13","title":"An Empirical Study of the Impact of Asynchronous Discussions on Remote Synchronous Requirements Meetings","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Victoria","funders":"","keywords":"Asynchronous communication; Ibis; Negotiation; Computer science; Software; Software engineering; Empirical research; Knowledge management; Process management; Engineering management; Telecommunications; Engineering; Operating system","score_opus":0.022926411039153476,"score_gpt":0.32642808394521244,"score_spread":0.30350167290605895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523014184","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.99193573,0.00007876861,0.00056513504,0.00022967099,0.000022500408,0.00012323605,0.000052065905,0.000027494401,0.006965381],"genre_scores_gemma":[0.99816906,0.000052266925,0.00061697623,0.000083355924,0.000028112092,0.0001360048,0.000054967317,0.000014198148,0.00084512605],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9850347,0.010681941,0.00065619696,0.00081107015,0.0020218566,0.0007942506],"domain_scores_gemma":[0.42284453,0.5280764,0.026735881,0.0074252486,0.006645849,0.008272049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0149171995,0.00045986488,0.00040997742,0.0013483852,0.0021633592,0.0021992894,0.0017082732,0.00148755,0.014037132],"category_scores_gemma":[0.1879563,0.00045934532,0.00046678446,0.0011625156,0.0011153091,0.0031530245,0.002199506,0.0031946125,0.001217037],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.025819262,0.07355425,0.47782513,0.0028656109,0.0005168368,0.0029029993,0.108333126,0.0048945528,0.016364582,0.007941192,0.0046560727,0.2743264],"study_design_scores_gemma":[0.0033216958,0.039082874,0.8179644,0.0006122464,0.000644406,0.001042603,0.10255882,0.0111926375,0.005867275,0.0050872755,0.012409423,0.0002164346],"about_ca_topic_score_codex":0.001426635,"about_ca_topic_score_gemma":0.0016073664,"teacher_disagreement_score":0.0149171995,"about_ca_system_score_codex":0.0010653681,"about_ca_system_score_gemma":0.0016557588,"threshold_uncertainty_score":0.07889062},"labels":[],"label_agreement":null},{"id":"W152303868","doi":"10.1007/978-3-642-21043-3_19","title":"Instance Selection in Semi-supervised Learning","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Labeled data; Training set; Naive Bayes classifier; Pattern recognition (psychology); Bayes classifier; Semi-supervised learning; Co-training; Support vector machine","score_opus":0.020887687691478484,"score_gpt":0.24282444718845428,"score_spread":0.2219367594969758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152303868","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.003506397,0.0011875462,0.99330634,0.00017084667,0.00007341509,0.000053631116,0.00010405173,0.0008889875,0.0007087634],"genre_scores_gemma":[0.118651904,0.0012419949,0.87108827,0.00026893473,0.00040150917,0.00048917625,0.001551181,0.0006850054,0.005621931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942826,0.0030759631,0.00043619948,0.0008759646,0.0011803742,0.00014886995],"domain_scores_gemma":[0.9780878,0.017907187,0.0005073117,0.0022026058,0.0010779727,0.00021720919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006517184,0.0010526131,0.003077009,0.0014930833,0.0006974722,0.0019751291,0.0037875946,0.0020639314,0.0038086078],"category_scores_gemma":[0.014155555,0.0013631535,0.0016194561,0.0025990324,0.0019293425,0.0040108305,0.002818305,0.0030336415,0.002109705],"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.0002597373,0.00019123411,0.0016613654,0.0007568939,0.000251967,0.00020576794,0.00022666855,0.10611906,0.0021797663,0.04654304,0.019134663,0.8224698],"study_design_scores_gemma":[0.000018740102,0.00004484756,0.00026242493,0.000041666557,0.000028419601,0.000125127,0.000025285593,0.91494966,0.0019058894,0.07953838,0.0030427969,0.000016726248],"about_ca_topic_score_codex":0.0008788971,"about_ca_topic_score_gemma":0.0013839205,"teacher_disagreement_score":0.006517184,"about_ca_system_score_codex":0.0007013421,"about_ca_system_score_gemma":0.00088483945,"threshold_uncertainty_score":0.034466565},"labels":[],"label_agreement":null},{"id":"W1523120196","doi":"10.1007/3-540-45415-2_9","title":"An Extensible, Human-Centric Framework That Promotes Universal Access to Electronic Commerce","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Extensibility; Domain (mathematical analysis); Architecture; Database-centric architecture; Population; Software engineering; Software; World Wide Web; Data science; Software architecture; Reference architecture; Operating system; Medicine","score_opus":0.05223739317082936,"score_gpt":0.3281673499628654,"score_spread":0.275929956792036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523120196","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.02041065,0.0004867901,0.93350756,0.00079864444,0.00023868498,0.0005795839,0.00021606102,0.020438796,0.023323156],"genre_scores_gemma":[0.23185539,0.0007563978,0.73688483,0.0007907689,0.0001936281,0.00044791863,0.0010385562,0.0017607986,0.026271626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977703,0.0005450677,0.00023374357,0.00035759117,0.0007531829,0.00034015524],"domain_scores_gemma":[0.9977049,0.00037910682,0.00010129921,0.0010170699,0.00027271608,0.00052491005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004940118,0.00060772715,0.00074175606,0.0014523062,0.0015048332,0.005299896,0.004094594,0.0024410668,0.0058421623],"category_scores_gemma":[0.0040329336,0.00090888666,0.00095577835,0.0011636507,0.0023753776,0.0070509645,0.007032047,0.002755473,0.0024350665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004779229,0.0009686111,0.003401614,0.00029168295,0.00012967642,0.0009926962,0.0021102105,0.01696571,0.02239048,0.6957848,0.02882143,0.22766516],"study_design_scores_gemma":[0.00019524097,0.00036046564,0.0021899291,0.00029140423,0.0002409873,0.0014627519,0.0006224181,0.27278116,0.026332483,0.33193144,0.36337394,0.00021778283],"about_ca_topic_score_codex":0.0035533158,"about_ca_topic_score_gemma":0.0046843984,"teacher_disagreement_score":0.0058421623,"about_ca_system_score_codex":0.0007714145,"about_ca_system_score_gemma":0.002693038,"threshold_uncertainty_score":0.026126206},"labels":[],"label_agreement":null},{"id":"W1523189742","doi":"10.1007/978-3-540-30139-4_5","title":"Inducing Optimal Emotional State for Learning in Intelligent Tutoring Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":44,"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":"Computer science; Intelligent tutoring system; Artificial intelligence; Classifier (UML); Cognition; State (computer science); Machine learning; Human–computer interaction; Psychology; Programming language","score_opus":0.02755480664211975,"score_gpt":0.2568877736599926,"score_spread":0.22933296701787284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523189742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14824717,0.00027710394,0.84746975,0.00028588407,0.00006903269,0.00009828653,0.00007066936,0.00052440364,0.0029576984],"genre_scores_gemma":[0.9320774,0.00009671959,0.066368245,0.0000805809,0.000026157422,0.00013904569,0.000113211754,0.00006215798,0.0010364323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949527,0.0002227366,0.000029198023,0.00010794644,0.00006346032,0.00008130783],"domain_scores_gemma":[0.9986364,0.0009770601,0.00009121287,0.00009832475,0.00014692124,0.00005007074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971957,0.000435517,0.0005942805,0.00018769305,0.00018082971,0.0005787105,0.00044871002,0.00056964473,0.0017860468],"category_scores_gemma":[0.005885411,0.0003075322,0.00033654398,0.00016448992,0.00045602088,0.0008452744,0.001177256,0.0009246538,0.0002513921],"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.001112412,0.0007188727,0.003928355,0.00030018916,0.00014173017,0.00009546599,0.0003645466,0.40625793,0.05850171,0.026517075,0.003906708,0.49815503],"study_design_scores_gemma":[0.000045318982,0.00015668837,0.0008927625,0.000010493052,0.000022893175,0.000016625387,0.00002616703,0.9754013,0.00753669,0.015587668,0.00029369627,0.000009727327],"about_ca_topic_score_codex":0.00031640887,"about_ca_topic_score_gemma":0.00065614516,"teacher_disagreement_score":0.0017860468,"about_ca_system_score_codex":0.00045367196,"about_ca_system_score_gemma":0.00028999438,"threshold_uncertainty_score":0.0059749484},"labels":[],"label_agreement":null},{"id":"W1523280505","doi":"10.1007/11564096_63","title":"Detecting Fraud in Health Insurance Data: Learning to Model Incomplete Benford’s Law Distributions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benford's law; Computer science; Probabilistic logic; Data mining; Health insurance; Data science; Health care; Artificial intelligence; Statistics; Law; Mathematics","score_opus":0.07206716951578145,"score_gpt":0.3215984773727922,"score_spread":0.24953130785701072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523280505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0735573,0.001147784,0.91953915,0.003377046,0.00006129634,0.00006668627,0.00034057404,0.00030890433,0.0016012066],"genre_scores_gemma":[0.78016484,0.0013339372,0.21362382,0.00060875056,0.0003345166,0.00016268606,0.0010530145,0.000059135295,0.0026591884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982578,0.000907169,0.00010236571,0.00030378415,0.0003193821,0.000109506116],"domain_scores_gemma":[0.97071844,0.02595595,0.0010653744,0.0013256358,0.0007027787,0.00023185185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072525805,0.0007291478,0.001306636,0.0018921035,0.00046713382,0.0017658746,0.002013495,0.002001717,0.0011398287],"category_scores_gemma":[0.034540042,0.0008335281,0.0010821017,0.0016926369,0.001772773,0.005735952,0.0015354289,0.0039794887,0.0003108487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002400582,0.0004480927,0.029358719,0.0002967225,0.00021984799,0.00023669034,0.00066351664,0.43357414,0.001088338,0.13902923,0.012334131,0.3825105],"study_design_scores_gemma":[0.000008427006,0.000018100012,0.0007698325,0.000019683273,0.000009613725,0.000052574647,0.000020380106,0.9035159,0.0002842709,0.09474861,0.0005437855,0.000008863253],"about_ca_topic_score_codex":0.0028368186,"about_ca_topic_score_gemma":0.0030527043,"teacher_disagreement_score":0.0072525805,"about_ca_system_score_codex":0.0015343057,"about_ca_system_score_gemma":0.0010647405,"threshold_uncertainty_score":0.038355708},"labels":[],"label_agreement":null},{"id":"W1523328589","doi":"10.1007/978-3-540-69812-8_77","title":"Automatic Detection of the Back Valley on Scoliotic Trunk Using Polygonal Surface Curvature","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Trunk; Computer science; Curvature; Artificial intelligence; Computer vision; Scoliosis; Surface (topology); Vertex (graph theory); Projection (relational algebra); Medicine; Geometry; Mathematics; Algorithm; Surgery","score_opus":0.014947084589322137,"score_gpt":0.22131012046337278,"score_spread":0.20636303587405064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523328589","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.52289283,0.0014805103,0.46298376,0.00024482692,0.00018967137,0.00033239095,0.00155349,0.00595559,0.0043669],"genre_scores_gemma":[0.85033417,0.0005269816,0.14556155,0.000062825275,0.00006915224,0.0000662213,0.0011635902,0.00028580945,0.0019297668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.00002746733,0.000010593751,0.00007793212,0.000115862,0.00007077675],"domain_scores_gemma":[0.9994893,0.00011431801,0.00005594992,0.000046722147,0.00021281416,0.00008080412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027295106,0.0007892125,0.0009212821,0.0028168503,0.0003066492,0.00087802525,0.0008087387,0.0007713656,0.0015861214],"category_scores_gemma":[0.00065964763,0.0004317593,0.00062851945,0.0012104564,0.00029447832,0.0004383829,0.00073734566,0.00056998146,0.00088411086],"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.0012487043,0.00021719508,0.04510085,0.000564434,0.00016072718,0.0016654456,0.00046300006,0.01257751,0.3740022,0.0012291837,0.008119943,0.55465066],"study_design_scores_gemma":[0.00012083018,0.0003944175,0.18900076,0.0001761012,0.00019177156,0.004556008,0.000643716,0.70698017,0.08855909,0.0021855829,0.0070190355,0.00017247192],"about_ca_topic_score_codex":0.0019648839,"about_ca_topic_score_gemma":0.0040191803,"teacher_disagreement_score":0.0028168503,"about_ca_system_score_codex":0.00017793657,"about_ca_system_score_gemma":0.00052944897,"threshold_uncertainty_score":0.005306065},"labels":[],"label_agreement":null},{"id":"W1523383428","doi":"10.1007/11602613_104","title":"On Routing in VLSI Design and Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Computer science; Vertex (graph theory); Mathematical optimization; Approximation algorithm; Multicast; Very-large-scale integration; Integer programming; Linear programming; Theoretical computer science; Mathematics; Distributed computing; Computer network; Graph","score_opus":0.02756434756253712,"score_gpt":0.28470505037295357,"score_spread":0.25714070281041645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523383428","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.0053764344,0.08991234,0.6466343,0.0052944943,0.0062796166,0.00014203956,0.0002563343,0.001155419,0.24494907],"genre_scores_gemma":[0.098055616,0.16906583,0.3779885,0.0034341828,0.0058464906,0.00043783928,0.000840748,0.0010675673,0.3432632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996778,0.000086287626,0.000016879747,0.000046409852,0.0001425334,0.000030103887],"domain_scores_gemma":[0.99961984,0.00020887397,0.00001801306,0.00007726702,0.000060720955,0.0000151906515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044910453,0.0013675003,0.00089652784,0.001010248,0.00046886544,0.001344902,0.0013868026,0.0010723022,0.013897301],"category_scores_gemma":[0.0011904247,0.0006678492,0.00045741576,0.0022179415,0.0010663505,0.0027122665,0.00095642154,0.001558985,0.004725547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037377788,0.000050373106,0.00012392097,0.00072621374,0.000034550343,0.00008628847,0.0001463299,0.019942127,0.0030816921,0.48281926,0.08577114,0.40718076],"study_design_scores_gemma":[0.000019546444,0.00007058385,0.00024871257,0.0003326638,0.000045757224,0.00030812444,0.00006904385,0.03643513,0.0021259815,0.5577661,0.40255514,0.000023152083],"about_ca_topic_score_codex":0.0005239462,"about_ca_topic_score_gemma":0.0012122893,"teacher_disagreement_score":0.013897301,"about_ca_system_score_codex":0.0007664264,"about_ca_system_score_gemma":0.00048555486,"threshold_uncertainty_score":0.046491086},"labels":[],"label_agreement":null},{"id":"W1523392525","doi":"10.1007/978-3-540-78921-5_20","title":"Using FCA to Suggest Refactorings to Correct Design Defects","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; Artificial intelligence; Software engineering","score_opus":0.05870075889914268,"score_gpt":0.2911270673122262,"score_spread":0.23242630841308354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523392525","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.105872296,0.0012272889,0.8447863,0.0021042353,0.00049305387,0.00052842806,0.0017013985,0.025259523,0.018027501],"genre_scores_gemma":[0.30144656,0.0002761322,0.6891403,0.0003141415,0.000084868254,0.00014572912,0.0018784296,0.0008173365,0.005896516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985045,0.0002900728,0.00009758708,0.00032524497,0.00066542166,0.000117150965],"domain_scores_gemma":[0.98638606,0.007470533,0.0010149077,0.0017470056,0.0031436882,0.00023777691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019213348,0.0018114081,0.0007093303,0.0042111985,0.0010803095,0.0014367658,0.0020325417,0.002046391,0.009735971],"category_scores_gemma":[0.021020256,0.0005790027,0.0015221208,0.0012552381,0.00059715804,0.0019162968,0.00075804093,0.001579852,0.0015686181],"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.0006025356,0.00038524784,0.011155248,0.0006943719,0.00015473318,0.00091805647,0.0007093158,0.060908448,0.021188613,0.00985066,0.023669994,0.8697628],"study_design_scores_gemma":[0.00012426921,0.0002571352,0.0027179115,0.00037186468,0.00030797604,0.0004909925,0.0003088864,0.9339781,0.025891382,0.017761523,0.017719131,0.000070940485],"about_ca_topic_score_codex":0.016157791,"about_ca_topic_score_gemma":0.035578698,"teacher_disagreement_score":0.016157791,"about_ca_system_score_codex":0.0012596155,"about_ca_system_score_gemma":0.0027431247,"threshold_uncertainty_score":0.032570064},"labels":[],"label_agreement":null},{"id":"W1523412023","doi":"10.1007/978-3-642-04639-1_16","title":"Cardinal Addition in Distributive Allegories","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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":"Brock University","funders":"","keywords":"Distributive property; Cardinality (data modeling); Computer science; Allegory; Relation (database); Function (biology); Algorithm; Discrete mathematics; Mathematics; Data mining; Pure mathematics; Art history","score_opus":0.011664409496717314,"score_gpt":0.23461490272197455,"score_spread":0.22295049322525723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523412023","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.11859709,0.0044340487,0.285422,0.0032031247,0.0017132547,0.00013079401,0.00036330876,0.0005640221,0.5855723],"genre_scores_gemma":[0.83314735,0.0025113046,0.05343458,0.0004636223,0.0010496787,0.00017846041,0.00029450198,0.00020180295,0.10871875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987544,0.00037119756,0.00009467076,0.00022226523,0.00039668995,0.00016079102],"domain_scores_gemma":[0.99858826,0.0007910424,0.00006144676,0.00023771389,0.00019499377,0.00012657765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014209611,0.00066770666,0.000859409,0.0016395716,0.003465595,0.0053033233,0.0011757247,0.00088457984,0.009093613],"category_scores_gemma":[0.0028894958,0.00085934886,0.00087873463,0.0028122251,0.0065072775,0.011913062,0.003250748,0.0046038325,0.0014719308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011627752,0.000008920648,0.00003671752,0.000017950599,0.000001799876,0.000022911157,0.00017765215,0.00015160118,0.00015865517,0.99381655,0.0006368831,0.0049588117],"study_design_scores_gemma":[0.000009503049,0.000008166625,0.00010096287,0.000012953959,0.000006989669,0.00008112556,0.000094950636,0.00062561966,0.00035621045,0.984263,0.014433289,0.0000072064577],"about_ca_topic_score_codex":0.0009793997,"about_ca_topic_score_gemma":0.0015308318,"teacher_disagreement_score":0.009093613,"about_ca_system_score_codex":0.0018008351,"about_ca_system_score_gemma":0.00087898667,"threshold_uncertainty_score":0.030421138},"labels":[],"label_agreement":null},{"id":"W1523443811","doi":"10.1007/978-3-540-24840-8_32","title":"A Decision-Theoretic Algorithm for Bundle Purchasing in Multiple Open Ascending-Price Auctions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"National Research Council Canada","funders":"","keywords":"Bidding; Common value auction; Markov decision process; Computer science; Mathematical optimization; Bundle; Purchasing; State space; Ebidding; Dynamic programming; Value (mathematics); Operations research; Markov process; Algorithm; Microeconomics; Economics; Mathematics; Machine learning; Operations management","score_opus":0.07059011920852305,"score_gpt":0.363892282680755,"score_spread":0.293302163472232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523443811","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.011625246,0.00012874331,0.98302484,0.00025525526,0.00006569172,0.00018677796,0.00008155135,0.00077864237,0.0038532552],"genre_scores_gemma":[0.1259655,0.0001378877,0.8687883,0.0001347218,0.00009448737,0.0003734757,0.0003164766,0.00016398357,0.0040250565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681973,0.0010016199,0.0002653945,0.00060162315,0.00090603495,0.00040555204],"domain_scores_gemma":[0.9952042,0.0031773432,0.00022312622,0.0005691336,0.00056110724,0.00026505487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038551074,0.0012414716,0.0035010937,0.0011659698,0.0015857499,0.0042666397,0.0047640023,0.0031603768,0.011687997],"category_scores_gemma":[0.009243684,0.0015008529,0.0017592484,0.0028334402,0.0013717683,0.0053876126,0.004260597,0.0033987744,0.0024012786],"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.0010783095,0.0009190334,0.0009672469,0.00032266186,0.0001556584,0.00016189618,0.00033345298,0.3293429,0.0030047684,0.11465034,0.011612745,0.53745097],"study_design_scores_gemma":[0.00023056456,0.00009610344,0.000119788834,0.000018415047,0.000029881849,0.000086947504,0.00004132033,0.90254414,0.0007236289,0.09483631,0.0012501053,0.000022774577],"about_ca_topic_score_codex":0.0024996223,"about_ca_topic_score_gemma":0.0028456335,"teacher_disagreement_score":0.011687997,"about_ca_system_score_codex":0.0020213614,"about_ca_system_score_gemma":0.0036417244,"threshold_uncertainty_score":0.03910023},"labels":[],"label_agreement":null},{"id":"W1523503594","doi":"10.1007/978-3-540-73131-3_9","title":"Towards an Ontological Account of Agent-Oriented Goals","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ontology; Computer science; Foundation (evidence); Knowledge management; Relation (database); Epistemology; Cognitive science; Management science; Data science; Engineering; Psychology","score_opus":0.04815208642871347,"score_gpt":0.30086970176832745,"score_spread":0.25271761533961395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523503594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009650138,0.0009678036,0.87116796,0.009396995,0.0004848282,0.00015880243,0.0004055735,0.00041414576,0.107353754],"genre_scores_gemma":[0.41098744,0.0017062569,0.5555889,0.002472151,0.00064187177,0.00081818545,0.0014486035,0.00044323565,0.025893362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778014,0.00086260657,0.0002584098,0.00025189255,0.00060135854,0.00024556657],"domain_scores_gemma":[0.9981084,0.00075827865,0.00014762087,0.00039188485,0.0003885759,0.00020515466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003531994,0.001082425,0.00077416503,0.0030870815,0.0034691524,0.0075611114,0.003420798,0.0036437581,0.0054878457],"category_scores_gemma":[0.0039911917,0.0015168007,0.0021922614,0.0032750226,0.007801901,0.019111052,0.005470058,0.006973329,0.0015639769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002373006,0.0000062113822,0.00003879457,0.000016279728,0.0000033402544,0.00002786527,0.00038625696,0.00032040797,0.000085025255,0.99643505,0.00065295934,0.002025457],"study_design_scores_gemma":[0.0000053946733,0.000003323739,0.00005614842,0.000028552875,0.000013424326,0.000051037154,0.00027523935,0.0038032145,0.00016877514,0.97771287,0.017874744,0.000007279514],"about_ca_topic_score_codex":0.0059365234,"about_ca_topic_score_gemma":0.0058685336,"teacher_disagreement_score":0.0075611114,"about_ca_system_score_codex":0.0029773389,"about_ca_system_score_gemma":0.002153371,"threshold_uncertainty_score":0.021602213},"labels":[],"label_agreement":null},{"id":"W1523564138","doi":"10.1007/bfb0032851","title":"GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Computation; Heuristic; Polynomial; Algorithm; Mathematics; Computer science; Mathematical optimization; Programming language","score_opus":0.01166784627210494,"score_gpt":0.23893931219380202,"score_spread":0.22727146592169709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523564138","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.050547842,0.002201525,0.91898036,0.00045189075,0.0008443691,0.0003760696,0.0004560365,0.010255241,0.015886689],"genre_scores_gemma":[0.2095037,0.00048652134,0.7798915,0.00024101742,0.00019288548,0.0002191525,0.001123451,0.0004970928,0.007844714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930334,0.00016476416,0.000040997787,0.0001519121,0.00018509568,0.00015385501],"domain_scores_gemma":[0.9994437,0.00011127259,0.000033615368,0.00020807497,0.00015040973,0.000052977182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079334,0.0008816775,0.0019208458,0.002170434,0.0016420238,0.00174484,0.0019647868,0.00088172127,0.011145779],"category_scores_gemma":[0.0019397701,0.00040827307,0.000750941,0.003456431,0.00075981684,0.0025379572,0.002290999,0.0009803333,0.0031255896],"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.0010007715,0.00023225347,0.0011094194,0.00029551564,0.00007853801,0.00020480569,0.00014132327,0.025914526,0.014329513,0.045601748,0.035735045,0.8753566],"study_design_scores_gemma":[0.00084678194,0.00089359895,0.0013061815,0.000105834566,0.00014895873,0.0013848095,0.00032871476,0.704067,0.06389539,0.12709196,0.099756144,0.00017470549],"about_ca_topic_score_codex":0.0016224601,"about_ca_topic_score_gemma":0.0024345035,"teacher_disagreement_score":0.011145779,"about_ca_system_score_codex":0.00081498263,"about_ca_system_score_gemma":0.0018716414,"threshold_uncertainty_score":0.03728634},"labels":[],"label_agreement":null},{"id":"W1523574531","doi":"10.1007/978-3-540-25966-4_13","title":"A Modular System for the Classification of Time Series Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Modular design; Series (stratigraphy); Representation (politics); Field (mathematics); Time series; Artificial intelligence; Data mining; Machine learning; External Data Representation; Pattern recognition (psychology); Mathematics","score_opus":0.03508346455470332,"score_gpt":0.24127707702777193,"score_spread":0.2061936124730686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523574531","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.0034426372,0.00013177852,0.97367316,0.00007604706,0.000100183104,0.00015543588,0.000584788,0.020858299,0.0009777201],"genre_scores_gemma":[0.041642122,0.00020667785,0.9465437,0.00026468607,0.00017771471,0.0005827597,0.002887921,0.0011036504,0.0065907794],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832493,0.0002627891,0.00022129716,0.0005256952,0.0005281893,0.00013721715],"domain_scores_gemma":[0.99800545,0.0005387751,0.00011846656,0.000605563,0.0006200926,0.00011165026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026019288,0.0013178613,0.0010428106,0.0026196686,0.00069931586,0.002093176,0.002150637,0.0012824379,0.016302768],"category_scores_gemma":[0.0056023966,0.0006673714,0.0014720949,0.0024148352,0.00049806567,0.0025474255,0.002628932,0.0014063041,0.017142667],"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.00051677844,0.000180228,0.0017545541,0.0002528531,0.00014927697,0.00017137702,0.00015763317,0.0054280777,0.031368572,0.011779963,0.0276653,0.9205754],"study_design_scores_gemma":[0.00020523768,0.00056540815,0.0065751327,0.00017826751,0.00038811305,0.0012605342,0.00013279922,0.69676024,0.08956774,0.079832725,0.12431809,0.0002156782],"about_ca_topic_score_codex":0.0015812153,"about_ca_topic_score_gemma":0.0017122192,"teacher_disagreement_score":0.016302768,"about_ca_system_score_codex":0.00047477102,"about_ca_system_score_gemma":0.00092248025,"threshold_uncertainty_score":0.05453819},"labels":[],"label_agreement":null},{"id":"W1523580019","doi":"10.1007/978-3-642-14287-1_36","title":"Two Sources of Again-Ambiguities: Evidence from Degree-Achievement Predicates","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Syntax, Semantics, Linguistic Variation","field":"Arts and Humanities","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Predicate (mathematical logic); Degree (music); Ambiguity; Phrase; Sentence; Computer science; Scope (computer science); Natural language processing; Linguistics; Artificial intelligence; Philosophy; Programming language","score_opus":0.04874087327289093,"score_gpt":0.2562320821060199,"score_spread":0.20749120883312897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523580019","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.61778593,0.0024822552,0.10366506,0.008552811,0.000464133,0.00017592401,0.0012732085,0.0004766098,0.2651241],"genre_scores_gemma":[0.9890565,0.00037029054,0.0069691683,0.00057077507,0.00020576798,0.000036828224,0.00046581618,0.00024013715,0.002084641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892852,0.0032227407,0.0012637295,0.0017915858,0.003838158,0.000598548],"domain_scores_gemma":[0.89247155,0.08134299,0.0073223063,0.01020965,0.007707545,0.0009457965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009215729,0.0007070279,0.0008748535,0.002813635,0.0032349422,0.0061594513,0.0020517705,0.0034385335,0.010663236],"category_scores_gemma":[0.067695886,0.0014446251,0.0007467627,0.0025794536,0.009061723,0.024613522,0.008083687,0.0067994795,0.0011224797],"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.0008689642,0.00016607389,0.012647665,0.0009920172,0.00009949691,0.002953561,0.072311275,0.0007745181,0.010751186,0.85881394,0.003881418,0.035739843],"study_design_scores_gemma":[0.0003652952,0.00025263644,0.046289306,0.0009753024,0.0002601964,0.01173732,0.030994998,0.008778991,0.030334102,0.74696547,0.12256454,0.00048192235],"about_ca_topic_score_codex":0.0015609694,"about_ca_topic_score_gemma":0.0010111897,"teacher_disagreement_score":0.010663236,"about_ca_system_score_codex":0.001236726,"about_ca_system_score_gemma":0.001130718,"threshold_uncertainty_score":0.048738003},"labels":[],"label_agreement":null},{"id":"W1523674847","doi":"10.1007/978-3-540-32262-7_13","title":"On Computing the Minimal Generator Family for Concept Lattices and Icebergs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Computer science; Equivalence (formal languages); Theoretical computer science; Closure (psychology); Lattice (music); Generator (circuit theory); Equivalence relation; Context (archaeology); Set (abstract data type); Space (punctuation); Discrete mathematics; Mathematics; Programming language","score_opus":0.023962110718037114,"score_gpt":0.25407257159118324,"score_spread":0.23011046087314613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523674847","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.14727063,0.00086822343,0.8368657,0.00085540867,0.00012147743,0.00015207693,0.00086899375,0.0012682085,0.011729313],"genre_scores_gemma":[0.48738265,0.00046708263,0.50330806,0.00018029653,0.00012049815,0.00015662835,0.0025353618,0.0003341446,0.005515243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985067,0.0004996763,0.000110791596,0.0002937927,0.00041158026,0.00017733985],"domain_scores_gemma":[0.9944372,0.0040853494,0.0002033201,0.000563026,0.0004534321,0.0002576954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030145368,0.0007978544,0.0015969601,0.0024482906,0.0014341936,0.0034266212,0.0018812472,0.00089065224,0.006311714],"category_scores_gemma":[0.012023363,0.00080655847,0.0017589972,0.0020897058,0.002487436,0.009782647,0.0027408116,0.0022270055,0.0010400792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000472812,0.00016456615,0.003077343,0.00034161165,0.000078614146,0.00016261479,0.0011170176,0.080090955,0.0023825865,0.6996925,0.010033423,0.20238598],"study_design_scores_gemma":[0.00002200448,0.00003597339,0.00023103788,0.000040758798,0.000014608937,0.000071158254,0.00016279235,0.13484189,0.0008327785,0.861508,0.0022197305,0.000019240242],"about_ca_topic_score_codex":0.002505007,"about_ca_topic_score_gemma":0.003695361,"teacher_disagreement_score":0.006311714,"about_ca_system_score_codex":0.0018644619,"about_ca_system_score_gemma":0.0013180088,"threshold_uncertainty_score":0.021114767},"labels":[],"label_agreement":null},{"id":"W1523716861","doi":"10.1007/11867586_8","title":"Mathematical Analysis of “Phase Ramping” for Super-Resolution Magnetic Resonance Imaging","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Subpixel rendering; Deconvolution; Image resolution; Computer science; Pixel; Resolution (logic); Artificial intelligence; Computer vision; Sub-pixel resolution; Image processing; Superresolution; Image (mathematics); Algorithm; Digital image processing","score_opus":0.01934529952480859,"score_gpt":0.32316793873704125,"score_spread":0.3038226392122327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523716861","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.0031274233,0.0013836189,0.9836218,0.0007161393,0.00023666845,0.000023403245,0.000058876387,0.00010177546,0.010730299],"genre_scores_gemma":[0.3376606,0.007691093,0.5920724,0.001500297,0.0017694846,0.00034233378,0.00041634275,0.00079690694,0.05775038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.00014010159,0.000025674883,0.00006128996,0.00012170508,0.000027415274],"domain_scores_gemma":[0.9983491,0.0009916908,0.00016757668,0.0001415569,0.00028135284,0.00006874008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015223743,0.001186818,0.0007745111,0.0010782778,0.00049152924,0.0014504568,0.0015132524,0.0016119613,0.005789741],"category_scores_gemma":[0.0063707656,0.00054556126,0.0010899195,0.0008811762,0.00185561,0.0037959395,0.0016214062,0.0030725831,0.00126377],"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.000017318795,0.000015352225,0.000070988506,0.00014336422,0.000018425515,0.00008374164,0.000072997165,0.038614396,0.0028907552,0.9401277,0.003617142,0.01432777],"study_design_scores_gemma":[0.0000042570505,0.000017478007,0.000110135996,0.000027364971,0.000012695237,0.00016078056,0.000017076598,0.4986977,0.0008756736,0.4946573,0.005397594,0.000021965316],"about_ca_topic_score_codex":0.0010086338,"about_ca_topic_score_gemma":0.0008930946,"teacher_disagreement_score":0.005789741,"about_ca_system_score_codex":0.0008967039,"about_ca_system_score_gemma":0.00065421703,"threshold_uncertainty_score":0.019368589},"labels":[],"label_agreement":null},{"id":"W1523796837","doi":"10.1007/978-3-642-11842-5_73","title":"A Hybrid Particle Swarm Optimization Algorithm Based on Space Transformation Search and a Modified Velocity Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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 Calgary","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Multi-swarm optimization; Computer science; Mathematical optimization; Transformation (genetics); Local optimum; Metaheuristic; Algorithm; Mathematics","score_opus":0.026336877777956808,"score_gpt":0.2683005472629652,"score_spread":0.2419636694850084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523796837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008213335,0.00023354564,0.9859848,0.000088521265,0.00022901382,0.00006642974,0.000026947351,0.0003162061,0.004841124],"genre_scores_gemma":[0.28087398,0.00038493372,0.70622563,0.00016116741,0.00017763721,0.000539894,0.0001928274,0.00017394357,0.011270022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997305,0.00006133791,0.000015331316,0.000047186146,0.00012612923,0.000019454506],"domain_scores_gemma":[0.9997421,0.00008992388,0.000023707236,0.00003282349,0.00009045595,0.000021039832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005540396,0.0007488596,0.0013007666,0.0006133298,0.00058150716,0.0009921934,0.0015398837,0.0017306587,0.0026531655],"category_scores_gemma":[0.0009307957,0.00043456277,0.0007553275,0.0011766982,0.00045620586,0.0011529536,0.00096221303,0.0008034586,0.00074570236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014991501,0.00012815696,0.0004517984,0.00012631528,0.00010826949,0.00011109915,0.00007707644,0.79207885,0.006385512,0.023200465,0.0032046349,0.17397791],"study_design_scores_gemma":[0.000020260908,0.000029677069,0.00005611421,0.0000028261684,0.000008992326,0.000016362372,0.0000030406477,0.99777263,0.00033202954,0.00079471065,0.00095713424,0.0000062479353],"about_ca_topic_score_codex":0.0038478186,"about_ca_topic_score_gemma":0.0029928018,"teacher_disagreement_score":0.0038478186,"about_ca_system_score_codex":0.0004207629,"about_ca_system_score_gemma":0.0006455871,"threshold_uncertainty_score":0.008875668},"labels":[],"label_agreement":null},{"id":"W1523797563","doi":"10.1007/978-3-642-12200-2_30","title":"On Quadratic Threshold CSPs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Predicate (mathematical logic); Quadratic equation; Combinatorics; Discrete mathematics; Computer science","score_opus":0.02164728414739782,"score_gpt":0.28453404510519054,"score_spread":0.26288676095779273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523797563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07999631,0.0020553488,0.5355227,0.006312689,0.0007579711,0.00024745506,0.0013460809,0.0014728255,0.3722887],"genre_scores_gemma":[0.7023734,0.002406519,0.10846281,0.0018827458,0.0010660029,0.000402373,0.0024786063,0.001187656,0.17973988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987184,0.00022068854,0.00008911173,0.00024355532,0.00049693475,0.00023143999],"domain_scores_gemma":[0.9977715,0.0011484628,0.00013605985,0.00038921752,0.0003193465,0.00023540061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085871364,0.00076906173,0.0011192514,0.0013401903,0.0016721913,0.003248678,0.0015089113,0.0011139532,0.030379137],"category_scores_gemma":[0.005048187,0.0006485645,0.0010642087,0.0040632836,0.0021995918,0.008245447,0.0040969085,0.0059427787,0.0037507638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037228143,0.000028445951,0.000070835435,0.00008312892,0.000005082899,0.000027903872,0.00011032155,0.0023222978,0.0006858875,0.9722391,0.0066901566,0.0176996],"study_design_scores_gemma":[0.000011444084,0.000008359091,0.00007397214,0.000015054187,0.000004492659,0.000045036137,0.000028354109,0.010000789,0.00026990543,0.9829624,0.0065740324,0.0000062727545],"about_ca_topic_score_codex":0.0017813517,"about_ca_topic_score_gemma":0.0021731467,"teacher_disagreement_score":0.030379137,"about_ca_system_score_codex":0.0023701796,"about_ca_system_score_gemma":0.0010571484,"threshold_uncertainty_score":0.10162836},"labels":[],"label_agreement":null},{"id":"W1523916651","doi":"10.1007/978-3-540-27795-8_67","title":"Factors Influencing User Selection of WWW Sitemaps","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Computer science; Usability; Selection (genetic algorithm); World Wide Web; Web design; Empirical research; Human–computer interaction; The Internet; Artificial intelligence","score_opus":0.029783251233708313,"score_gpt":0.25079851128747727,"score_spread":0.22101526005376895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523916651","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.9930736,0.00012234831,0.0006113799,0.00010682365,0.00001293794,0.000035282716,0.00011430575,0.00010367833,0.005819631],"genre_scores_gemma":[0.9963606,0.00006753629,0.0011522133,0.00003881184,0.000016308315,0.000021016956,0.00013447537,0.000048741575,0.0021602558],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99833304,0.00082261744,0.00014808266,0.00010393213,0.00044401013,0.00014839368],"domain_scores_gemma":[0.9495292,0.040102657,0.003034631,0.0013215065,0.0041414336,0.001870652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017571679,0.00021213864,0.00017629053,0.0013134079,0.00054001826,0.0019212059,0.00028928992,0.00051079196,0.007873599],"category_scores_gemma":[0.040674277,0.00024096959,0.0002484041,0.0009977188,0.0002066042,0.000993484,0.00037897265,0.0004590352,0.001710585],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016629676,0.00095591776,0.87752134,0.00020631673,0.0000896508,0.00078651746,0.007153235,0.0006035142,0.0077228392,0.00038767228,0.004433185,0.098476864],"study_design_scores_gemma":[0.000049196442,0.00061236706,0.97985613,0.00005908687,0.000101666235,0.0009665851,0.006870585,0.0038912138,0.0025193526,0.0002624387,0.004755964,0.00005553155],"about_ca_topic_score_codex":0.0028440007,"about_ca_topic_score_gemma":0.005759977,"teacher_disagreement_score":0.007873599,"about_ca_system_score_codex":0.00021013581,"about_ca_system_score_gemma":0.00038663764,"threshold_uncertainty_score":0.02633977},"labels":[],"label_agreement":null},{"id":"W1523916760","doi":"10.1007/978-3-642-02882-3_27","title":"On the Generalised Character Compatibility Problem for Non-branching Character Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Branching (polymer chemistry); Combinatorics; Mathematics; Character (mathematics); Tree (set theory); Character evolution; Computer science; Discrete mathematics; Phylogenetics; Biology","score_opus":0.01523903294797201,"score_gpt":0.24026576026952226,"score_spread":0.22502672732155024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523916760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21078037,0.0017600674,0.69564915,0.004678311,0.00048895524,0.00027908984,0.00065910857,0.00043009783,0.085274816],"genre_scores_gemma":[0.6905023,0.0022854398,0.26754355,0.0011222861,0.0014526094,0.0004250875,0.0027903067,0.0006742562,0.03320419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976125,0.0008765941,0.00016432967,0.00051144604,0.00058706506,0.00024817558],"domain_scores_gemma":[0.9886077,0.0091053005,0.00045636258,0.0008087943,0.0006176529,0.0004042493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002552091,0.00091855455,0.0018497743,0.0015950456,0.0023703373,0.0039500324,0.0029789165,0.004194746,0.013208769],"category_scores_gemma":[0.017474433,0.0010528439,0.0019142466,0.00389933,0.0038293118,0.012555367,0.004542298,0.0063565164,0.0014975193],"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.00019466178,0.00010533432,0.00074522285,0.00027040497,0.00003053418,0.00043748683,0.0005039204,0.015086094,0.0016304227,0.9334171,0.0061727874,0.041406047],"study_design_scores_gemma":[0.000031139312,0.000020663369,0.00029320002,0.000031317435,0.000012010451,0.00018204108,0.00008344956,0.026268883,0.00035420698,0.96906,0.003646048,0.000016929569],"about_ca_topic_score_codex":0.0014199838,"about_ca_topic_score_gemma":0.00091864466,"teacher_disagreement_score":0.013208769,"about_ca_system_score_codex":0.0011719592,"about_ca_system_score_gemma":0.00088634144,"threshold_uncertainty_score":0.044187784},"labels":[],"label_agreement":null},{"id":"W1523988964","doi":"10.1007/978-3-540-76848-7_12","title":"Acquaintance Based Consistency in an Instance-Mapped P2P Data Sharing System During Transaction Processing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Ottawa","funders":"","keywords":"Computer science; Correctness; Distributed transaction; Database transaction; Transaction processing; Consistency (knowledge bases); Distributed computing; Data consistency; Compensating transaction; Atomicity; Peer-to-peer; Database; Rollback; Semantics (computer science); Data sharing; Programming language","score_opus":0.04947759509804384,"score_gpt":0.28548041638453703,"score_spread":0.2360028212864932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523988964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33044988,0.0005971676,0.65761846,0.0005332719,0.00014969299,0.00026994664,0.00017802439,0.0039849197,0.0062186928],"genre_scores_gemma":[0.86914366,0.000114273775,0.12672126,0.0000792661,0.000042033844,0.00008642619,0.00018777921,0.00020764105,0.0034176973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.00077131484,0.00021774531,0.00046749538,0.0008620483,0.00031214798],"domain_scores_gemma":[0.9949904,0.0017770398,0.00021838376,0.0019837797,0.0007780897,0.00025233446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025311632,0.00036274668,0.0009830652,0.00057755917,0.0017902394,0.0029021988,0.0031910844,0.0011172822,0.002335226],"category_scores_gemma":[0.006901916,0.0008760773,0.0004590352,0.0014051414,0.0008967966,0.0031299356,0.002147737,0.0017001801,0.00044938785],"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.00419633,0.0011911663,0.018183215,0.00045051804,0.00028993937,0.0024623987,0.0040057856,0.32906857,0.08598598,0.09575923,0.011054226,0.44735274],"study_design_scores_gemma":[0.00008385812,0.00021774718,0.0012658027,0.000012021638,0.00007851969,0.0003761356,0.00026280858,0.9490924,0.02137593,0.02428183,0.0029141863,0.000038809136],"about_ca_topic_score_codex":0.006117598,"about_ca_topic_score_gemma":0.0056546,"teacher_disagreement_score":0.006117598,"about_ca_system_score_codex":0.00071669905,"about_ca_system_score_gemma":0.0018637272,"threshold_uncertainty_score":0.01338619},"labels":[],"label_agreement":null},{"id":"W1524025360","doi":"10.1007/978-3-540-74913-4_18","title":"Developmental Neural Heterogeneity Through Coarse-Coding Regulation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Neural coding; Coding (social sciences); Computer science; Adaptability; Homogeneous; Process (computing); Neuroscience; Artificial intelligence; Biology; Mathematics","score_opus":0.06253186979634819,"score_gpt":0.28153047321617236,"score_spread":0.2189986034198242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524025360","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.48086488,0.0016228816,0.44631657,0.0009429941,0.00011854269,0.000022923248,0.00026098365,0.0010131168,0.068837084],"genre_scores_gemma":[0.9721205,0.00036778027,0.02028647,0.00005540834,0.000029294146,0.0000181224,0.00006777956,0.00013441782,0.0069201314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988115,0.000007989437,0.000005454436,0.00003861172,0.000044658376,0.000022080318],"domain_scores_gemma":[0.99949825,0.0002077217,0.00006562586,0.000104652434,0.00006022536,0.00006358822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018090593,0.00015474064,0.00024668683,0.00032127756,0.00018012228,0.0008243136,0.0005613166,0.00029446036,0.0031569265],"category_scores_gemma":[0.0010277603,0.0002686247,0.00019735299,0.00023089562,0.00077113224,0.001107569,0.0006088423,0.00073731993,0.0003320071],"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.00004893583,0.000019822177,0.0025816716,0.00007062435,0.000031018415,0.00035714835,0.00027590126,0.024190733,0.35779348,0.53847706,0.0015622332,0.074591406],"study_design_scores_gemma":[0.000019039124,0.0000777956,0.041761458,0.000036853507,0.00003845154,0.0010006321,0.00021106681,0.19701794,0.111625925,0.63503414,0.0131074935,0.00006917054],"about_ca_topic_score_codex":0.00078946905,"about_ca_topic_score_gemma":0.0011452056,"teacher_disagreement_score":0.0031569265,"about_ca_system_score_codex":0.0005891678,"about_ca_system_score_gemma":0.00024115737,"threshold_uncertainty_score":0.010560989},"labels":[],"label_agreement":null},{"id":"W1524073030","doi":"10.1007/978-3-642-04639-1_23","title":"Complements in Distributive Allegories","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Brock University","funders":"","keywords":"Distributive property; Topos theory; Axiom; Axiom of choice; Computer science; Context (archaeology); Discrete mathematics; Mathematical economics; Mathematics; Theoretical computer science; Pure mathematics; Programming language; Set theory; Set (abstract data type)","score_opus":0.032575461589549465,"score_gpt":0.3182489243293403,"score_spread":0.2856734627397909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524073030","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.06655697,0.0043317336,0.13289966,0.002409921,0.001008535,0.00008454787,0.00024934395,0.00026077122,0.79219854],"genre_scores_gemma":[0.82872444,0.0031356572,0.03600798,0.0004369234,0.00069493795,0.00021666088,0.00027738238,0.0002413581,0.13026471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998889,0.0003975839,0.000057685902,0.00016682484,0.0003307299,0.00015831697],"domain_scores_gemma":[0.9988464,0.0006938367,0.000051790503,0.00016038466,0.00016937929,0.000078232435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641912,0.00057122175,0.0008694623,0.0014467549,0.003725749,0.0057167606,0.00091117795,0.0011112802,0.011627299],"category_scores_gemma":[0.0022668205,0.0007749053,0.00067221315,0.0022091812,0.007347437,0.010477516,0.0032377802,0.003464997,0.0014469582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053597932,0.0000036768668,0.000014261588,0.000011550014,9.771126e-7,0.0000134040665,0.00015072185,0.000056022687,0.00006760243,0.9962716,0.00048729836,0.0029174187],"study_design_scores_gemma":[0.000006610323,0.0000052559544,0.000055954704,0.000017524575,0.0000050401222,0.000057736128,0.00014104517,0.00031581457,0.00018913424,0.9788493,0.020351877,0.0000047452986],"about_ca_topic_score_codex":0.0013407775,"about_ca_topic_score_gemma":0.0020435816,"teacher_disagreement_score":0.011627299,"about_ca_system_score_codex":0.002227708,"about_ca_system_score_gemma":0.0010330091,"threshold_uncertainty_score":0.038897157},"labels":[],"label_agreement":null},{"id":"W1524205571","doi":"10.1007/978-3-540-30500-2_20","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Computer science; Root (linguistics); Set (abstract data type); Free monoid; Syntactic monoid; Finite-state machine; Computational complexity theory; Regular language; Finite set; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Automaton; Programming language; Linguistics","score_opus":0.021319518591987767,"score_gpt":0.23951034962227816,"score_spread":0.21819083103029038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524205571","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.43704084,0.006889935,0.39671758,0.00450526,0.00031411438,0.00015460438,0.0011414636,0.00042768323,0.15280846],"genre_scores_gemma":[0.95512915,0.0014113683,0.026990408,0.0001648998,0.0002921527,0.0001399445,0.0004586919,0.00006159705,0.015351776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815625,0.0004503195,0.00017112604,0.0003862666,0.00064477674,0.00019125895],"domain_scores_gemma":[0.99020547,0.0076319454,0.0005049249,0.0008516803,0.0004971717,0.0003087301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039837,0.00043234392,0.00094266987,0.0020046101,0.0015009192,0.0062534055,0.0009969234,0.0012529304,0.0060633495],"category_scores_gemma":[0.006796617,0.0006001476,0.0012436896,0.0018612772,0.0041991943,0.011713068,0.0020374553,0.0029879513,0.00046390315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036928064,0.000011757374,0.00025716185,0.00004201168,0.0000080859745,0.000022683213,0.00019223557,0.0022291148,0.00041850467,0.99142766,0.00038695944,0.0049670283],"study_design_scores_gemma":[0.000007232195,0.000015092981,0.00021129205,0.000008018039,0.000007598041,0.0000483867,0.000038614675,0.007925639,0.00036700387,0.98976785,0.0015935332,0.000009796635],"about_ca_topic_score_codex":0.0013804586,"about_ca_topic_score_gemma":0.000911831,"teacher_disagreement_score":0.0062534055,"about_ca_system_score_codex":0.0026060494,"about_ca_system_score_gemma":0.0009941189,"threshold_uncertainty_score":0.020283878},"labels":[],"label_agreement":null},{"id":"W1524289721","doi":"10.1007/978-3-642-03784-9_24","title":"Faster Algorithms for Sampling and Counting Biological Sequences","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise comparison; Bounded function; Sequence (biology); Mathematics; Combinatorics; Hamming distance; Algorithm; Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.05671718658480474,"score_gpt":0.29382078062225203,"score_spread":0.2371035940374473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524289721","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.004825869,0.00069495797,0.9894566,0.00016549083,0.00017932638,0.00008982371,0.0002871068,0.003049812,0.0012510042],"genre_scores_gemma":[0.02675757,0.00044572988,0.96626705,0.00015560104,0.00021122966,0.00040248796,0.0014587112,0.0005249906,0.0037766115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593484,0.0007273462,0.00039155333,0.00087046874,0.0018301568,0.0002456094],"domain_scores_gemma":[0.98580116,0.0073598805,0.0006229331,0.0042533353,0.0015654818,0.00039727153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702854,0.002636428,0.0032137642,0.00500811,0.0012846654,0.003804149,0.005682126,0.002416114,0.019981725],"category_scores_gemma":[0.018811941,0.0014888813,0.0023590804,0.0074017146,0.0014385538,0.00792811,0.0034615444,0.0039137155,0.0070339884],"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.00055263785,0.00016761357,0.0012502332,0.000540583,0.00016377796,0.00009382652,0.00030496056,0.05248075,0.01234571,0.06918364,0.01526406,0.8476522],"study_design_scores_gemma":[0.00030690432,0.00014563295,0.00101215,0.00008151679,0.00011979177,0.00046447336,0.0001312327,0.72091144,0.013166205,0.24421132,0.019374369,0.00007496477],"about_ca_topic_score_codex":0.0037065593,"about_ca_topic_score_gemma":0.006605345,"teacher_disagreement_score":0.019981725,"about_ca_system_score_codex":0.002269475,"about_ca_system_score_gemma":0.00218663,"threshold_uncertainty_score":0.06684548},"labels":[],"label_agreement":null},{"id":"W1524317667","doi":"10.1007/11767718_46","title":"Art and Science of System Release Planning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Calgary","funders":"","keywords":"Computer science; Intuition; Negotiation; Management science; Plan (archaeology); Decision support system; Operations research; Knowledge management; Artificial intelligence; Engineering","score_opus":0.014661575076145503,"score_gpt":0.2477978904997026,"score_spread":0.23313631542355712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524317667","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.0036557703,0.04810369,0.46835187,0.01858355,0.002343069,0.000100472294,0.00028665602,0.0005630712,0.45801196],"genre_scores_gemma":[0.3229269,0.09649629,0.35289037,0.0055404594,0.005871818,0.0005359384,0.00054195523,0.00068597327,0.21451029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988689,0.0003291192,0.000062226274,0.00018471832,0.00047333227,0.00008165289],"domain_scores_gemma":[0.99779,0.0015506865,0.00008876286,0.00033153984,0.00017008898,0.00006897646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016762615,0.0008410448,0.0005946105,0.0013301743,0.0012876379,0.004681378,0.0015153,0.0015491423,0.012097467],"category_scores_gemma":[0.004315339,0.00081626925,0.00069107703,0.001995984,0.007050867,0.006092276,0.0011329639,0.0048527243,0.0023119266],"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.000012617761,0.000014796534,0.00006021492,0.0001465954,0.0000061292067,0.00003499356,0.00021803356,0.0041772993,0.00020164308,0.93494874,0.014515333,0.045663647],"study_design_scores_gemma":[0.000007572061,0.000015293796,0.00010812525,0.0001323008,0.000007245985,0.00012631372,0.00006378057,0.005802654,0.00026133354,0.84074676,0.15271527,0.000013347859],"about_ca_topic_score_codex":0.0027152812,"about_ca_topic_score_gemma":0.0026065016,"teacher_disagreement_score":0.012097467,"about_ca_system_score_codex":0.0022478728,"about_ca_system_score_gemma":0.0025566819,"threshold_uncertainty_score":0.040470123},"labels":[],"label_agreement":null},{"id":"W1524444324","doi":"10.1007/978-3-642-01818-3_9","title":"Machine Translation of Legal Information and Its Evaluation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Machine translation; Certification; Translation (biology); Natural language processing; Context (archaeology); Machine translation system; Machine translation software usability; Artificial intelligence; Example-based machine translation; Law; Political science; History","score_opus":0.015865212163329694,"score_gpt":0.2749952949071796,"score_spread":0.2591300827438499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524444324","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.52029324,0.01437846,0.2870349,0.0033498243,0.0022027595,0.0020691005,0.02968916,0.04952566,0.09145685],"genre_scores_gemma":[0.71030253,0.002604277,0.19621989,0.00045501292,0.00044404806,0.00070852,0.069423184,0.0024329063,0.01740973],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99033713,0.0051907636,0.00073182903,0.00086303713,0.0024572467,0.00042001766],"domain_scores_gemma":[0.9791965,0.01270434,0.00046240023,0.0027729478,0.00440701,0.0004568708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061362945,0.0013225419,0.0015556434,0.005175395,0.0018058746,0.0033853354,0.0021437868,0.0027053142,0.01605479],"category_scores_gemma":[0.023842096,0.0004779133,0.0010013636,0.0048702797,0.0010618105,0.0036573107,0.0023467587,0.0014386907,0.007458564],"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.0040991777,0.0019298935,0.0055426448,0.0023221052,0.00051336543,0.0010392325,0.0007338208,0.06287394,0.01744688,0.020636538,0.09419616,0.7886663],"study_design_scores_gemma":[0.00094685284,0.0014798343,0.0067309444,0.000297976,0.00045902148,0.0012004619,0.0010594833,0.8467659,0.06879104,0.030787311,0.041338388,0.00014281305],"about_ca_topic_score_codex":0.0072332635,"about_ca_topic_score_gemma":0.006078971,"teacher_disagreement_score":0.01605479,"about_ca_system_score_codex":0.0015452683,"about_ca_system_score_gemma":0.0023068783,"threshold_uncertainty_score":0.053708613},"labels":[],"label_agreement":null},{"id":"W1524482766","doi":"10.1007/978-3-540-30550-7_8","title":"The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McGill University","funders":"","keywords":"Hierarchy; Delta; Polynomial; Mathematics; Combinatorics; Physics; Mathematical analysis; Political science; Astronomy","score_opus":0.017019496046477036,"score_gpt":0.2334018407475007,"score_spread":0.21638234470102366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524482766","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.12089979,0.001656043,0.6003537,0.003383514,0.0006291175,0.00012722716,0.0007660431,0.0012767689,0.2709078],"genre_scores_gemma":[0.7827787,0.00156592,0.14539818,0.0009572555,0.00040928976,0.00014575246,0.00041958597,0.0007824199,0.06754286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.00012095045,0.000055578843,0.00025087318,0.00023283256,0.00025989438],"domain_scores_gemma":[0.99753404,0.0010111784,0.00014023614,0.0005576049,0.00043372528,0.00032323363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073480426,0.0005798924,0.0008979821,0.0015062467,0.0021760727,0.00526381,0.0014220407,0.0020155734,0.017581709],"category_scores_gemma":[0.004468325,0.00083442294,0.0011482817,0.0015072325,0.004938688,0.015340293,0.003053138,0.005302043,0.0036105097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018221544,0.000008577968,0.000088030014,0.000020210424,0.0000016036419,0.000025952206,0.00015811756,0.00014541393,0.00048542506,0.9923219,0.0006914444,0.006035151],"study_design_scores_gemma":[0.000009779294,0.000011765632,0.00015073789,0.000012617301,0.000005228716,0.00008080584,0.00010549799,0.0014856219,0.0006359003,0.99142504,0.0060659316,0.000010985878],"about_ca_topic_score_codex":0.0019308066,"about_ca_topic_score_gemma":0.002760035,"teacher_disagreement_score":0.017581709,"about_ca_system_score_codex":0.0017597559,"about_ca_system_score_gemma":0.0008826307,"threshold_uncertainty_score":0.05881667},"labels":[],"label_agreement":null},{"id":"W1524550501","doi":"10.1007/978-3-540-30116-5_41","title":"Density-Based Spatial Clustering in the Presence of Obstacles and Facilitators","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":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":"Cluster analysis; Computer science; Preprocessor; Cluster (spacecraft); Data mining; Spatial analysis; Artificial intelligence; k-means clustering; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.01611851001436791,"score_gpt":0.23139271342903908,"score_spread":0.21527420341467118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524550501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06764469,0.0006905803,0.9274479,0.00029653232,0.00004977126,0.0001201692,0.00015173406,0.0005859029,0.0030126653],"genre_scores_gemma":[0.65051323,0.0008079026,0.33964097,0.00008661865,0.00008989083,0.00018285705,0.0005522089,0.00018099973,0.0079453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989655,0.00036451008,0.000047025875,0.00018254545,0.0002921124,0.00014832745],"domain_scores_gemma":[0.9931746,0.0041030226,0.000520689,0.0005635819,0.0013145452,0.00032356594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021452908,0.0007455375,0.0017880634,0.0026371179,0.001471748,0.0012785213,0.0047642803,0.001762165,0.0016227708],"category_scores_gemma":[0.008421208,0.0012511249,0.0010626409,0.003187802,0.001359566,0.0022660615,0.002369377,0.00095078524,0.00061005016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002157349,0.00007858589,0.002088065,0.0001365865,0.00007178264,0.00007460784,0.00029535507,0.92735577,0.001356367,0.01995619,0.0019534582,0.04641758],"study_design_scores_gemma":[0.00001120141,0.000015932337,0.00041534647,0.0000073553456,0.000011580161,0.000038039332,0.00005370845,0.99235946,0.00033843322,0.0064142207,0.0003165484,0.000018247085],"about_ca_topic_score_codex":0.030774418,"about_ca_topic_score_gemma":0.03173611,"teacher_disagreement_score":0.030774418,"about_ca_system_score_codex":0.002204662,"about_ca_system_score_gemma":0.0018792669,"threshold_uncertainty_score":0.061190546},"labels":[],"label_agreement":null},{"id":"W1524559442","doi":"10.1007/978-3-642-12304-7_8","title":"Two-View Geometry and Reconstruction under Quasi-perspective Projection","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Homography; Perspective (graphical); Computer science; Fundamental matrix (linear differential equation); Invariant (physics); Projective geometry; Parallel projection; Degrees of freedom (physics and chemistry); Projection (relational algebra); Pencil (optics); Cross-ratio; Projective test; Computer vision; Geometry; Algebra over a field; Orthographic projection; Mathematics; Artificial intelligence; Algorithm; Pure mathematics; Projective space; Mathematical analysis; Algebraic geometry; Physics; Optics","score_opus":0.01587892090698607,"score_gpt":0.28616862028404094,"score_spread":0.2702896993770549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524559442","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.00910297,0.00059409026,0.9824921,0.00023344698,0.000090461166,0.00002092179,0.00016698841,0.00020271358,0.0070962966],"genre_scores_gemma":[0.31004158,0.0036424997,0.6615891,0.00018529558,0.00031241402,0.00006769222,0.0009880164,0.0005197154,0.022653762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930596,0.0001265678,0.00003477698,0.00015515176,0.00032936782,0.000048106744],"domain_scores_gemma":[0.99929404,0.0002474217,0.00010418298,0.00019179608,0.00011732782,0.00004509865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005078105,0.0010157063,0.00088166574,0.0012420298,0.00037122684,0.0026204875,0.0010501978,0.001224179,0.0044734525],"category_scores_gemma":[0.0016531384,0.0011465232,0.0010571142,0.0013151241,0.0014710776,0.0037226335,0.0023009782,0.0027215742,0.0016477728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023037546,0.000040853916,0.00043224246,0.0003937959,0.000071415736,0.00058096804,0.00040933923,0.030533949,0.037211567,0.75950074,0.006652947,0.16394183],"study_design_scores_gemma":[0.000050007744,0.00012772385,0.0015951351,0.000052080522,0.00004603881,0.0047336584,0.00025174348,0.3339322,0.023721237,0.6139115,0.021472909,0.000105756895],"about_ca_topic_score_codex":0.0008443096,"about_ca_topic_score_gemma":0.00050112314,"teacher_disagreement_score":0.0044734525,"about_ca_system_score_codex":0.00036230122,"about_ca_system_score_gemma":0.00030515774,"threshold_uncertainty_score":0.014965177},"labels":[],"label_agreement":null},{"id":"W1524564918","doi":"10.1007/978-3-642-01818-3_35","title":"An Empirical Study of Category Skew on Feature Selection for Text Categorization","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Skew; Categorical variable; Feature selection; Computer science; Categorization; Text categorization; Selection (genetic algorithm); Feature (linguistics); Measure (data warehouse); Artificial intelligence; Pattern recognition (psychology); Data mining; Machine learning","score_opus":0.026645668405953876,"score_gpt":0.3034475151411274,"score_spread":0.2768018467351735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524564918","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.9912608,0.00041104775,0.006793922,0.00011001174,0.000032049637,0.00002716808,0.00020870089,0.0000596616,0.0010967087],"genre_scores_gemma":[0.9969939,0.000055470475,0.0021233882,0.000030455578,0.000027299267,0.000013304929,0.00045497064,0.000023199716,0.00027797808],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911117,0.0056610955,0.00044006255,0.0007877692,0.0017253045,0.00027396542],"domain_scores_gemma":[0.6219091,0.33912644,0.013024782,0.015289333,0.009133244,0.0015171405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018081617,0.00035632652,0.00052482967,0.0010425459,0.0006161046,0.0010925938,0.00069965585,0.0006472835,0.0022762918],"category_scores_gemma":[0.13698855,0.00016920427,0.00045132052,0.001773221,0.0010720061,0.0028496722,0.0010989839,0.0011481347,0.00045278567],"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.0053240936,0.0010880624,0.7385889,0.00030345508,0.00045312988,0.00022219252,0.0014836821,0.011337157,0.008818304,0.0031001102,0.005423759,0.22385716],"study_design_scores_gemma":[0.00018769185,0.002625991,0.79927063,0.00013419797,0.00035330773,0.0015724873,0.0025679967,0.16788992,0.008927122,0.0138354525,0.0025107386,0.000124505],"about_ca_topic_score_codex":0.0009279626,"about_ca_topic_score_gemma":0.0009283031,"teacher_disagreement_score":0.018081617,"about_ca_system_score_codex":0.0006092974,"about_ca_system_score_gemma":0.0004152006,"threshold_uncertainty_score":0.09562588},"labels":[],"label_agreement":null},{"id":"W1524593324","doi":"10.1007/11566465_102","title":"3D Needle-Tissue Interaction Simulation for Prostate Brachytherapy","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency; University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Polygon mesh; Computer science; Brachytherapy; Node (physics); Prostate brachytherapy; Haptic technology; Lemma (botany); Prostate; Simulation; Computer graphics (images); Surgery; Acoustics; Radiation therapy; Medicine; Physics","score_opus":0.013706166816993043,"score_gpt":0.28795730282465204,"score_spread":0.274251136007659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524593324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39935687,0.0022874682,0.55405676,0.0011234953,0.00026971308,0.00040649445,0.0015710995,0.0036874693,0.037240617],"genre_scores_gemma":[0.94143176,0.00057749974,0.050492644,0.00022425744,0.00003286588,0.00017649721,0.00038753604,0.0006394921,0.0060373903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957126,0.00013225645,0.000020219704,0.000033188993,0.00020237561,0.000040709947],"domain_scores_gemma":[0.99910897,0.0006398923,0.00006139946,0.000051437557,0.000081922146,0.000056234985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884716,0.00081312715,0.0009228275,0.00045489054,0.00057016325,0.0012951739,0.001220972,0.0020883349,0.005597097],"category_scores_gemma":[0.0022649576,0.0009811018,0.001162479,0.00061185146,0.0004883538,0.00053207105,0.0008372016,0.0006919714,0.0007669203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090189555,0.000040800565,0.00048020997,0.000052697935,0.000024489782,0.00014537065,0.00010283913,0.9897171,0.003340787,0.0009027733,0.0004206391,0.004681994],"study_design_scores_gemma":[0.000021465115,0.000036393627,0.0002489844,0.000006746174,0.000008621973,0.00006724564,0.000015280328,0.9970701,0.0013908308,0.00041263874,0.00070927694,0.000012390282],"about_ca_topic_score_codex":0.012447665,"about_ca_topic_score_gemma":0.008362858,"teacher_disagreement_score":0.012447665,"about_ca_system_score_codex":0.0011582143,"about_ca_system_score_gemma":0.0012633848,"threshold_uncertainty_score":0.024750412},"labels":[],"label_agreement":null},{"id":"W1524602408","doi":"10.1007/3-540-45554-x_11","title":"Approximation Spaces of Type-Free Sets","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Type (biology); Domain (mathematical analysis); Universe; Space (punctuation); Combinatorics; Mathematics; Relation (database); Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.0309637209609463,"score_gpt":0.29677112360191776,"score_spread":0.26580740264097147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524602408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10915856,0.0111665595,0.5994946,0.002328396,0.0009890363,0.000078345634,0.00061635015,0.00063585036,0.27553236],"genre_scores_gemma":[0.797304,0.00657873,0.0957557,0.00040243738,0.00090730126,0.00018932344,0.0009384984,0.00021617953,0.09770789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921227,0.00018612383,0.0000410496,0.000113979055,0.00037334854,0.000073211915],"domain_scores_gemma":[0.9990183,0.00051233155,0.000056892542,0.00017944038,0.00013803261,0.00009489947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077967544,0.00052113435,0.00069990824,0.0015115443,0.0010183705,0.0032638686,0.0011326354,0.0005856686,0.005462162],"category_scores_gemma":[0.002421864,0.00045633878,0.00083499757,0.001977092,0.0020772014,0.005747082,0.0018434682,0.0034197485,0.000835105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015570107,0.0000059493527,0.000054475317,0.00002952983,0.000005834349,0.000012945847,0.00011581614,0.00077969243,0.00027510698,0.9884293,0.0011239661,0.009151777],"study_design_scores_gemma":[0.0000056049325,0.0000119108345,0.000106332154,0.000011784998,0.000007181292,0.00008771529,0.00006824866,0.0034307193,0.00032349335,0.98553467,0.010407075,0.000005235344],"about_ca_topic_score_codex":0.00053184084,"about_ca_topic_score_gemma":0.00041749503,"teacher_disagreement_score":0.005462162,"about_ca_system_score_codex":0.0011916079,"about_ca_system_score_gemma":0.00040971758,"threshold_uncertainty_score":0.018272758},"labels":[],"label_agreement":null},{"id":"W1524663122","doi":"10.1007/978-3-642-02611-9_3","title":"Hierarchical Sampling with Constraints","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sampling (signal processing); Simulated annealing; Convergence (economics); Task (project management); Hierarchical database model; Algorithm; Scale (ratio); Artificial intelligence; Data mining; Computer vision","score_opus":0.023570253470611018,"score_gpt":0.28485284954127515,"score_spread":0.2612825960706641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524663122","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.00215285,0.0003926485,0.9930495,0.00008973207,0.000051005212,0.000053040265,0.00014208384,0.00035296957,0.0037161745],"genre_scores_gemma":[0.11316856,0.00067334814,0.86784166,0.00018189254,0.00023082398,0.00033587764,0.001350748,0.00064062857,0.015576423],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986939,0.00042130705,0.0000502466,0.0002725816,0.00045030107,0.00011169234],"domain_scores_gemma":[0.9976584,0.0014672928,0.000073526084,0.0004823994,0.00021439542,0.000104026745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015153995,0.00083256245,0.0015382284,0.0014500653,0.0007964973,0.0014796717,0.002025049,0.0011348531,0.013158445],"category_scores_gemma":[0.0068239877,0.0011686388,0.0010335619,0.0021077401,0.0009071477,0.0016197838,0.0022913653,0.0017793161,0.0022325837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031315294,0.00011497687,0.0009638577,0.00035608854,0.00011615204,0.00013452623,0.00014481558,0.22791727,0.0060667656,0.2935428,0.023456922,0.44687268],"study_design_scores_gemma":[0.000032944354,0.000032086446,0.00026095315,0.000022305003,0.000020594747,0.000089564935,0.000015185384,0.8941364,0.0018568475,0.09443401,0.009082351,0.000016807004],"about_ca_topic_score_codex":0.004953995,"about_ca_topic_score_gemma":0.008008693,"teacher_disagreement_score":0.013158445,"about_ca_system_score_codex":0.0010162189,"about_ca_system_score_gemma":0.001030302,"threshold_uncertainty_score":0.04401934},"labels":[],"label_agreement":null},{"id":"W1524709705","doi":"10.1007/bfb0014292","title":"Expert R&M design synthesis an enabling technology for concurrent engineering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Assessment and Management","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":"Douglas Mental Health University Institute","funders":"","keywords":"Concurrent engineering; Maintainability; Key (lock); Concurrency; Engineering design process; Process (computing); Software engineering; Systems engineering; Computer science; Engineering; Engineering management; Process management; Operations management; Distributed computing","score_opus":0.026255568347257875,"score_gpt":0.25543573761486116,"score_spread":0.2291801692676033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524709705","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.0040631206,0.00069690554,0.9585401,0.00028643856,0.00012668881,0.000077230245,0.000050711038,0.0010573836,0.03510148],"genre_scores_gemma":[0.10211679,0.0012204221,0.84972453,0.00026578756,0.00011080804,0.00017301213,0.00019847557,0.000315106,0.045875102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924964,0.00015268548,0.00004955804,0.00012935701,0.00036630413,0.000052412503],"domain_scores_gemma":[0.99909294,0.00040311544,0.00005088569,0.00022855637,0.00018794724,0.000036633908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964412,0.0006202,0.00030485008,0.0006595015,0.00049828744,0.0014307186,0.00092605257,0.00083427987,0.009914722],"category_scores_gemma":[0.0019171888,0.000549733,0.00040986587,0.0004571072,0.00091541273,0.0015055842,0.0011239257,0.0009407923,0.0030330184],"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.000084459054,0.000080617836,0.00041087758,0.0005989601,0.000044902732,0.00022864486,0.00075339555,0.025876794,0.056625117,0.3740592,0.011769668,0.5294672],"study_design_scores_gemma":[0.00007359849,0.0002719918,0.00044485743,0.00026263113,0.000075740485,0.000704835,0.00020035355,0.116007075,0.07342463,0.37599522,0.43249246,0.000046722518],"about_ca_topic_score_codex":0.00047483915,"about_ca_topic_score_gemma":0.00091204693,"teacher_disagreement_score":0.009914722,"about_ca_system_score_codex":0.00043580274,"about_ca_system_score_gemma":0.0009978471,"threshold_uncertainty_score":0.033168077},"labels":[],"label_agreement":null},{"id":"W1524737199","doi":"10.1007/11682462_61","title":"Randomly Colouring Graphs with Girth Five and Large Maximum Degree","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Combinatorics; Degree (music); Girth (graph theory); Graph; Mathematics; Discrete mathematics; Computer science; Physics","score_opus":0.030508984719750328,"score_gpt":0.27637773377912556,"score_spread":0.24586874905937522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524737199","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.7390614,0.00086815486,0.23141924,0.0024835805,0.00021314672,0.00015237195,0.00071050867,0.00097374606,0.024117835],"genre_scores_gemma":[0.9270717,0.00045354242,0.06236042,0.0005109281,0.00012217963,0.00012678019,0.0006928565,0.00040535783,0.008256155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981988,0.0007800116,0.00005627696,0.0003617712,0.0003205383,0.00028256234],"domain_scores_gemma":[0.9746061,0.01883324,0.001588349,0.0029049765,0.0007355326,0.0013318228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019303113,0.0008242987,0.0012306976,0.0015358843,0.0014260603,0.0021925224,0.002261768,0.0025326626,0.0046034525],"category_scores_gemma":[0.016145123,0.0013857656,0.0013382088,0.001651147,0.0028858876,0.0033697835,0.0023689428,0.002641791,0.00062379363],"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.0008502893,0.00022158712,0.0048439824,0.0005186548,0.0001701414,0.00068025454,0.001061681,0.23279576,0.017605152,0.6897214,0.012429697,0.03910143],"study_design_scores_gemma":[0.00014452671,0.00011834733,0.0016391553,0.00006314687,0.00006856117,0.0005189787,0.00019648604,0.18617803,0.0055265706,0.8018053,0.0036935343,0.000047414407],"about_ca_topic_score_codex":0.0010148431,"about_ca_topic_score_gemma":0.0019761692,"teacher_disagreement_score":0.0046034525,"about_ca_system_score_codex":0.0017139276,"about_ca_system_score_gemma":0.00073720585,"threshold_uncertainty_score":0.015400052},"labels":[],"label_agreement":null},{"id":"W1524812206","doi":"10.1007/978-3-642-02737-6_14","title":"An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Extension (predicate logic); Computer science; Algorithm; Programming language","score_opus":0.011703666272083312,"score_gpt":0.24108665072141916,"score_spread":0.22938298444933586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524812206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10377889,0.003418642,0.44943807,0.0027222824,0.0018615597,0.00008163907,0.00032229378,0.0006916019,0.43768498],"genre_scores_gemma":[0.7762589,0.00408155,0.0745902,0.0017306565,0.0028146582,0.00019275869,0.00046606807,0.0005496088,0.13931571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956757,0.00009003089,0.000029276676,0.000113582755,0.00013746425,0.00006199859],"domain_scores_gemma":[0.9992341,0.00036431002,0.000052188985,0.00015340644,0.00013899223,0.00005700863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005696071,0.0005895096,0.00080947543,0.0014759388,0.0012713373,0.0018730512,0.0009997202,0.0009362234,0.012909822],"category_scores_gemma":[0.0021793158,0.0004290246,0.0013128683,0.0012788634,0.0022723023,0.005253775,0.0023916776,0.0018883231,0.002261907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034165452,0.0000149406205,0.000062492305,0.00006606158,0.0000063307834,0.000121747566,0.00017632154,0.00076923246,0.0012881845,0.9804269,0.0020199649,0.015013517],"study_design_scores_gemma":[0.000010366016,0.00001771784,0.00009037189,0.000012779196,0.000007645374,0.00009923064,0.000029131548,0.0029781929,0.000603728,0.9868847,0.009255305,0.000010768041],"about_ca_topic_score_codex":0.00054213643,"about_ca_topic_score_gemma":0.00057208264,"teacher_disagreement_score":0.012909822,"about_ca_system_score_codex":0.000773375,"about_ca_system_score_gemma":0.0004890712,"threshold_uncertainty_score":0.043187678},"labels":[],"label_agreement":null},{"id":"W1524832982","doi":"10.1007/3-540-45486-1_35","title":"Considerations on Compositional Update Operators","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjunction (astronomy); Computer science; Sentence; Operator (biology); Syntax; Knowledge base; Prime (order theory); Belief revision; Base (topology); Natural language processing; Programming language; Artificial intelligence; Arithmetic; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.015682770503936235,"score_gpt":0.24064001481095298,"score_spread":0.22495724430701675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524832982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02102243,0.0018060618,0.62482035,0.01269433,0.001226897,0.00019200976,0.00022624947,0.000800788,0.3372109],"genre_scores_gemma":[0.58319926,0.0020656388,0.3230786,0.005876533,0.0026221136,0.0007569276,0.00042988406,0.0013212903,0.080649756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404186,0.0024702358,0.0004009137,0.00084309856,0.0015789913,0.00066492945],"domain_scores_gemma":[0.9871187,0.00847916,0.00027644218,0.0026298107,0.0011194082,0.00037639865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007973992,0.0011115061,0.0012204279,0.0011555969,0.0036402785,0.0068083443,0.0031300026,0.00513819,0.02313418],"category_scores_gemma":[0.02360726,0.0015809813,0.002024469,0.0013376978,0.007974362,0.031999625,0.0049553798,0.007009644,0.0027223742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012028173,0.0000070777783,0.000018332661,0.000014737886,0.0000019494935,0.000032536795,0.0001017866,0.00017004985,0.000109038,0.99633384,0.00081551174,0.0023830733],"study_design_scores_gemma":[0.000012006015,0.000008277276,0.00002199675,0.0000178856,0.000008608294,0.00010082411,0.000066525354,0.0020365077,0.00042005238,0.98957217,0.00772934,0.0000057660122],"about_ca_topic_score_codex":0.0013456785,"about_ca_topic_score_gemma":0.0019797864,"teacher_disagreement_score":0.02313418,"about_ca_system_score_codex":0.0014369778,"about_ca_system_score_gemma":0.0012948681,"threshold_uncertainty_score":0.077391505},"labels":[],"label_agreement":null},{"id":"W1524865704","doi":"10.1007/3-540-44466-1_13","title":"Maintaining Horizontally Partitioned Warehouse Views","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Data warehouse; Aggregate (composite); Tuple; Scheme (mathematics); Warehouse; Computer science; Database; Set (abstract data type); Materialized view; Base (topology); Data mining; Information retrieval; Mathematics; View; Geography","score_opus":0.02446178647882132,"score_gpt":0.24570998442426253,"score_spread":0.2212481979454412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524865704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22762421,0.0025996335,0.7063411,0.00083620683,0.00034132434,0.0003295542,0.00704045,0.034857493,0.020030055],"genre_scores_gemma":[0.44613117,0.0015006978,0.5108413,0.00029432072,0.0001384078,0.0001921133,0.022714369,0.0047249505,0.013462745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866617,0.00016283453,0.00012764607,0.00026904978,0.0006020613,0.00017225147],"domain_scores_gemma":[0.99558496,0.00093095604,0.00022807642,0.0024920497,0.00057660457,0.00018737219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012787356,0.0009968037,0.0011857637,0.0017897221,0.000879613,0.0044277622,0.0028656921,0.000933328,0.005795456],"category_scores_gemma":[0.0052875397,0.0018110435,0.0010224583,0.0057343966,0.00060758844,0.00789814,0.0040036896,0.0014681107,0.0019167444],"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.0013763952,0.00047857797,0.009238359,0.00068571436,0.00044032276,0.0010019707,0.0013965119,0.03757332,0.09497331,0.03491761,0.06381502,0.7541029],"study_design_scores_gemma":[0.00048495922,0.0006843092,0.010033885,0.0003222002,0.0010060724,0.001816118,0.0024503556,0.5244283,0.21831761,0.11980029,0.120365836,0.00029008102],"about_ca_topic_score_codex":0.0039207186,"about_ca_topic_score_gemma":0.0071194633,"teacher_disagreement_score":0.005795456,"about_ca_system_score_codex":0.00078608794,"about_ca_system_score_gemma":0.001331703,"threshold_uncertainty_score":0.019387722},"labels":[],"label_agreement":null},{"id":"W1524873553","doi":"10.1007/978-3-642-13772-3_26","title":"High Accuracy Optical Flow Method Based on a Theory for Warping: 3D Extension","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Western University","funders":"","keywords":"Optical flow; Computer science; Image warping; Algorithm; Regularization (linguistics); Flow (mathematics); Mathematical optimization; Applied mathematics; Artificial intelligence; Mathematics; Image (mathematics); Geometry","score_opus":0.021444467895293032,"score_gpt":0.31259796034006065,"score_spread":0.2911534924447676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524873553","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.0013164101,0.00013742023,0.99727875,0.000044466848,0.000053548632,0.000012511246,0.000013617661,0.00021829293,0.00092499657],"genre_scores_gemma":[0.063062936,0.00055016734,0.93002576,0.00011047571,0.00013961337,0.00009445614,0.000107855325,0.00024948185,0.005659324],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.000081953,0.000021421127,0.00008238902,0.00021369435,0.000027474023],"domain_scores_gemma":[0.99943143,0.00018770297,0.00005302227,0.00014658821,0.00015095955,0.000030323436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068691734,0.0010116296,0.0007784898,0.001222015,0.00046099312,0.0010720064,0.0011565528,0.0010615335,0.0041661533],"category_scores_gemma":[0.0014485422,0.00066710304,0.0008960019,0.0011260144,0.00088182796,0.0020514757,0.0017341502,0.0021646875,0.0015306671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001305783,0.00009610223,0.00036792207,0.00026352977,0.000068876434,0.00013618117,0.00021534612,0.13519982,0.062557034,0.16603988,0.008091701,0.626833],"study_design_scores_gemma":[0.000010537086,0.000046885638,0.0001596271,0.00002523029,0.000015849027,0.00021679015,0.000012911835,0.9479411,0.016668933,0.024427813,0.010445132,0.000029178856],"about_ca_topic_score_codex":0.0009885498,"about_ca_topic_score_gemma":0.0007948622,"teacher_disagreement_score":0.0041661533,"about_ca_system_score_codex":0.00047249265,"about_ca_system_score_gemma":0.0006461811,"threshold_uncertainty_score":0.013937175},"labels":[],"label_agreement":null},{"id":"W1525019419","doi":"10.1007/978-3-642-04159-4_23","title":"Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Trinomial; Computer science; Multiplication (music); Arithmetic; GF(2); Polynomial; Discrete mathematics; Parallel computing; Mathematics; Finite field; Combinatorics","score_opus":0.013453789454613254,"score_gpt":0.2494412450916692,"score_spread":0.23598745563705595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525019419","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.0749266,0.003678639,0.77904546,0.0005772968,0.0006413205,0.0002626947,0.00020764855,0.0035039326,0.13715646],"genre_scores_gemma":[0.49206695,0.0032595815,0.42449626,0.00030111344,0.00049264135,0.00023822692,0.0005106193,0.0004545533,0.07817995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950993,0.00010830068,0.000033691318,0.00006951208,0.00019681505,0.00008172244],"domain_scores_gemma":[0.9996873,0.00009763599,0.00002664057,0.00009902024,0.00007073561,0.00001852287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053587375,0.0008810368,0.0007611187,0.0010018923,0.00069231936,0.0014733388,0.0007961391,0.00035408916,0.012814474],"category_scores_gemma":[0.0012454765,0.00033608513,0.0005538236,0.0017328225,0.00061610364,0.001953375,0.0010330845,0.0009930917,0.0052564796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005333679,0.00013604351,0.000315581,0.0005313108,0.00003864157,0.0004450917,0.00046477583,0.0096684955,0.035742022,0.32979766,0.019674076,0.60265297],"study_design_scores_gemma":[0.00030460456,0.0011423723,0.0012794768,0.00035848873,0.00017537133,0.003577812,0.00032040468,0.16254438,0.14207709,0.46383557,0.224209,0.00017541682],"about_ca_topic_score_codex":0.0005449685,"about_ca_topic_score_gemma":0.0011556327,"teacher_disagreement_score":0.012814474,"about_ca_system_score_codex":0.0008149306,"about_ca_system_score_gemma":0.0008480892,"threshold_uncertainty_score":0.042868674},"labels":[],"label_agreement":null},{"id":"W1525042185","doi":"10.1007/11536444_21","title":"Immunity from Spam: An Analysis of an Artificial Immune System for Junk Email Detection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial immune system; Computer security; Population; Artificial intelligence","score_opus":0.020356957725259438,"score_gpt":0.24753737540136372,"score_spread":0.22718041767610428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525042185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4793791,0.0012303861,0.50429046,0.0007775067,0.00022992799,0.00017542123,0.00011628986,0.0012052233,0.0125957765],"genre_scores_gemma":[0.96347135,0.00017998912,0.03188645,0.00020250582,0.00011004907,0.000044275206,0.00009337926,0.00006168592,0.00395032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.000093043185,0.000013831455,0.000066482346,0.00012391173,0.00006965118],"domain_scores_gemma":[0.9986111,0.00078309985,0.00014038193,0.00013434114,0.00027214477,0.00005891102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079286133,0.0003718456,0.00076561683,0.00081007316,0.00045517812,0.000937336,0.0007702829,0.0012493576,0.002136459],"category_scores_gemma":[0.0036954435,0.0001750789,0.00068648276,0.00032368882,0.00065327395,0.0009459772,0.0004830228,0.00069443457,0.00029600563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009686464,0.0006814011,0.013515931,0.0005224374,0.00031209821,0.0009629106,0.00048422322,0.52796227,0.10534776,0.13640903,0.0074063325,0.20542695],"study_design_scores_gemma":[0.000014956655,0.00015648057,0.0017995797,0.00000904182,0.00003693091,0.00023179212,0.00002211359,0.97139615,0.005594542,0.020083357,0.0006437338,0.000011365539],"about_ca_topic_score_codex":0.00035880707,"about_ca_topic_score_gemma":0.00023699903,"teacher_disagreement_score":0.002136459,"about_ca_system_score_codex":0.00042616544,"about_ca_system_score_gemma":0.00036715038,"threshold_uncertainty_score":0.007147193},"labels":[],"label_agreement":null},{"id":"W1525155366","doi":"10.1007/bfb0025026","title":"Object oriented framework for generating machine understanding of a digital system design","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Blackboard (design pattern); Representation (politics); Blackboard system; Object (grammar); Knowledge representation and reasoning; Design rationale; Human–computer interaction; Artificial intelligence; Software engineering","score_opus":0.02582043697631344,"score_gpt":0.2276841678089786,"score_spread":0.20186373083266515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525155366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012769706,0.00005341123,0.9939773,0.0000333701,0.00001451759,0.00005741583,0.00014458325,0.0026573457,0.0017851],"genre_scores_gemma":[0.023911288,0.00017981807,0.97137344,0.000051447936,0.000011936085,0.00023460237,0.00073470897,0.00084413006,0.002658577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995658,0.000082290346,0.000034899498,0.00007533224,0.00020330495,0.000038355378],"domain_scores_gemma":[0.9995921,0.00017053487,0.000026704953,0.000092733935,0.000097662916,0.000020177864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009160139,0.0013019299,0.0007512691,0.0015430548,0.00074438564,0.0023546438,0.0016742456,0.001192376,0.008018936],"category_scores_gemma":[0.0013223459,0.00082809065,0.0018637957,0.00087457977,0.00075587473,0.0012894714,0.0010772926,0.0014794519,0.0022849068],"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.00013542372,0.00020331304,0.0012544581,0.00090134906,0.00014647265,0.00083619694,0.0014520404,0.089477025,0.025464296,0.46754447,0.018389419,0.39419553],"study_design_scores_gemma":[0.000072096474,0.000124534,0.0006191515,0.00033617028,0.00023734334,0.00054180576,0.00022671337,0.63025546,0.030655185,0.14842062,0.18844615,0.000064847765],"about_ca_topic_score_codex":0.0033568766,"about_ca_topic_score_gemma":0.0042117783,"teacher_disagreement_score":0.008018936,"about_ca_system_score_codex":0.0007966066,"about_ca_system_score_gemma":0.0011146921,"threshold_uncertainty_score":0.026826024},"labels":[],"label_agreement":null},{"id":"W1525158721","doi":"10.1007/978-3-540-75538-8_22","title":"Monte-Carlo Methods in Pool Strategy Game Trees","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Queen's University","funders":"","keywords":"Computer science; Monte Carlo tree search; Tournament; Tree (set theory); Game tree; Competitor analysis; Monte Carlo method; Ball (mathematics); Artificial intelligence; Mathematical optimization; Game theory; Sequential game; Mathematics; Statistics; Mathematical economics","score_opus":0.06654823752674012,"score_gpt":0.30229742400242143,"score_spread":0.23574918647568133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525158721","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.003901218,0.00045025424,0.9926287,0.00024428873,0.000049308135,0.0000607188,0.000060569124,0.00018677967,0.002418116],"genre_scores_gemma":[0.20864622,0.0012055385,0.77124274,0.0004539723,0.00037449235,0.0011826362,0.00056801713,0.0007908256,0.015535605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972486,0.0018311383,0.00010229538,0.0002487676,0.000381557,0.00018760549],"domain_scores_gemma":[0.9659805,0.031486005,0.00046576615,0.00069520547,0.00089053746,0.00048199878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007924937,0.0012684278,0.0026624391,0.001980895,0.0014680491,0.0023506584,0.0039993073,0.0035835395,0.009712351],"category_scores_gemma":[0.031433508,0.0021873387,0.0017335684,0.0029272386,0.002595154,0.00418365,0.0032120033,0.0045585665,0.0016396482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000746444,0.00009382509,0.0005188286,0.0001016648,0.00006199615,0.00005029985,0.00014299933,0.75698227,0.00013204156,0.20738953,0.0029513468,0.03150063],"study_design_scores_gemma":[0.000016452386,0.0000055771807,0.00003202515,0.000014761738,0.0000066846815,0.0000057494467,0.0000060997086,0.91329974,0.00003309948,0.086086944,0.00048820968,0.0000046184887],"about_ca_topic_score_codex":0.012271905,"about_ca_topic_score_gemma":0.012343207,"teacher_disagreement_score":0.012271905,"about_ca_system_score_codex":0.00206417,"about_ca_system_score_gemma":0.0024530583,"threshold_uncertainty_score":0.041911542},"labels":[],"label_agreement":null},{"id":"W1525176489","doi":"10.1007/11814764_2","title":"Advances in Wireless Personal Area Networking","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bluetooth; Computer science; Personal area network; Wireless; License; Computer network; Telecommunications; Wireless network; Multimedia","score_opus":0.016620461505405748,"score_gpt":0.23550296974779328,"score_spread":0.21888250824238753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525176489","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031362176,0.5798989,0.11213637,0.0052513997,0.015960477,0.00007618658,0.0001359803,0.00078989787,0.2826146],"genre_scores_gemma":[0.026634028,0.53367954,0.049163755,0.002426842,0.012340174,0.00012526555,0.00044702587,0.00031893252,0.37486452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996278,0.000055139015,0.000021988577,0.00005698325,0.00020710356,0.00003089684],"domain_scores_gemma":[0.9994791,0.00022502993,0.000025284187,0.00006359743,0.00016442279,0.000042604715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006461377,0.0011776054,0.0008438403,0.0012399537,0.00042812355,0.0013290764,0.0010759409,0.0011944495,0.024883334],"category_scores_gemma":[0.001170316,0.00041262756,0.0003115486,0.0022494155,0.00052115024,0.003963904,0.0012555508,0.0020729424,0.0132519845],"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.000031479984,0.00008624377,0.00013438847,0.0009954056,0.000016257089,0.000068997644,0.000085667576,0.0014565077,0.0036655278,0.059200637,0.07891202,0.8553469],"study_design_scores_gemma":[0.0000063681227,0.000066862376,0.00024327693,0.00035225195,0.000018031564,0.00037016426,0.000035195175,0.002753649,0.0013174311,0.017012695,0.977809,0.000014974833],"about_ca_topic_score_codex":0.0001750385,"about_ca_topic_score_gemma":0.00034548188,"teacher_disagreement_score":0.024883334,"about_ca_system_score_codex":0.00036821453,"about_ca_system_score_gemma":0.0004298601,"threshold_uncertainty_score":0.08324301},"labels":[],"label_agreement":null},{"id":"W1525177341","doi":"10.1007/3-540-44444-0_17","title":"A Parameter-Based Approach to Resource Discovery in Grid Computing Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":47,"is_retracted":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":"Computer science; Grid; Resource (disambiguation); Grid computing; Key (lock); Distributed computing; DRMAA; Database; Semantic grid; Resource management (computing); Resource allocation; Data science; World Wide Web; Computer network; Computer security","score_opus":0.020225553229579644,"score_gpt":0.2336349194195785,"score_spread":0.21340936618999887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525177341","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.00260245,0.00029734988,0.9917182,0.00048856874,0.00007365332,0.00007619844,0.0000482882,0.0009633291,0.0037319923],"genre_scores_gemma":[0.21146649,0.0006169144,0.78049856,0.0003069612,0.00020660105,0.0002898822,0.00019874086,0.0005486415,0.005867191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585634,0.0015523725,0.0003529869,0.00051296386,0.0014822196,0.00024320597],"domain_scores_gemma":[0.9941012,0.00288981,0.00021229444,0.0019346679,0.0006312413,0.00023074074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046276287,0.0008884146,0.0019864268,0.0017468219,0.0021239351,0.006339501,0.0068098917,0.0028625259,0.005429976],"category_scores_gemma":[0.013274706,0.0012552411,0.0012922764,0.0029943718,0.0030054373,0.010334954,0.0037740078,0.0043843053,0.0014295309],"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.00028797542,0.0002094766,0.00075559656,0.0002536009,0.00014782326,0.0002798857,0.0005664305,0.29111198,0.0061391797,0.5144753,0.010405757,0.17536697],"study_design_scores_gemma":[0.00002995751,0.000027475196,0.00009446659,0.000019476925,0.00003096275,0.00012053974,0.00006498918,0.7494063,0.0023706788,0.23893495,0.008855221,0.000044900626],"about_ca_topic_score_codex":0.003554608,"about_ca_topic_score_gemma":0.0041046767,"teacher_disagreement_score":0.0068098917,"about_ca_system_score_codex":0.0021191502,"about_ca_system_score_gemma":0.0018307352,"threshold_uncertainty_score":0.024473548},"labels":[],"label_agreement":null},{"id":"W1525181000","doi":"10.1007/978-3-642-37119-6_6","title":"Message Transmission and Key Establishment: Conditions for Equality of Weak and Strong Capacities","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Secrecy; Randomness; Communication source; Counterexample; Computer science; Key (lock); Transmission (telecommunications); Information-theoretic security; Information transmission; Key generation; Theoretical computer science; Adversary; Mutual information; Information leakage; Discrete mathematics; Computer security; Computer network; Topology (electrical circuits); Cryptography; Mathematics; Telecommunications; Combinatorics; Statistics","score_opus":0.021311259768493195,"score_gpt":0.2568934007367805,"score_spread":0.23558214096828733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525181000","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.056058705,0.0015969388,0.84586096,0.0040349723,0.00067409646,0.0003076692,0.0008494566,0.0004544429,0.09016275],"genre_scores_gemma":[0.887995,0.0023080052,0.085735284,0.0009888355,0.0014552395,0.0009177477,0.0005774202,0.00048255618,0.019539997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869963,0.0035355906,0.0010486388,0.002513538,0.0029092696,0.002996586],"domain_scores_gemma":[0.8709482,0.101144806,0.005377379,0.008256594,0.010530485,0.0037424995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012646187,0.0015429623,0.0023519068,0.002788417,0.0031574606,0.008509384,0.0038610229,0.003387553,0.0148332855],"category_scores_gemma":[0.09268401,0.0015572284,0.0014828036,0.0027797364,0.011075498,0.023209024,0.0104711605,0.009069412,0.002746491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039820123,0.000053550088,0.00018827515,0.00014944228,0.000020322841,0.00011306193,0.00033044687,0.003308925,0.0019973107,0.9833997,0.001804338,0.008236467],"study_design_scores_gemma":[0.00008738538,0.00010498784,0.00028931702,0.000100185156,0.000045127756,0.00031989676,0.00018873694,0.030559504,0.0047119395,0.9600109,0.0035154098,0.000066616056],"about_ca_topic_score_codex":0.000964293,"about_ca_topic_score_gemma":0.0005262496,"teacher_disagreement_score":0.0148332855,"about_ca_system_score_codex":0.00257484,"about_ca_system_score_gemma":0.003388799,"threshold_uncertainty_score":0.066880226},"labels":[],"label_agreement":null},{"id":"W1525194303","doi":"10.1007/11562382_11","title":"Filtering Contents with Bigrams and Named Entities to Improve Text Classification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Université de Montréal","funders":"","keywords":"Bigram; Computer science; Information retrieval; Call for bids; Window (computing); Artificial intelligence; Measure (data warehouse); Natural language processing; Data mining; World Wide Web; Trigram","score_opus":0.022896628920236126,"score_gpt":0.2413735191497738,"score_spread":0.2184768902295377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525194303","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.27722034,0.0073117614,0.6562559,0.001139753,0.0024995648,0.00081331556,0.010910307,0.031730462,0.012118653],"genre_scores_gemma":[0.35566163,0.0024444254,0.587374,0.0004984288,0.0012582812,0.00042106843,0.02486761,0.0022431628,0.025231449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876356,0.00017339338,0.00018855231,0.00029507498,0.00043867205,0.0001408086],"domain_scores_gemma":[0.9957569,0.0014862854,0.00029951677,0.0005694045,0.001641795,0.00024603086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248371,0.0017983896,0.0017473998,0.009150917,0.0014899443,0.0023829115,0.0010416647,0.0015076057,0.0066436864],"category_scores_gemma":[0.00493288,0.0005064978,0.0014965229,0.005901293,0.0004256429,0.0032501563,0.0013397723,0.0015171062,0.011607166],"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.0007633729,0.00044557606,0.00787667,0.00048370627,0.00018436999,0.00038128736,0.0002750615,0.0021386151,0.10717679,0.0014027266,0.023894893,0.85497683],"study_design_scores_gemma":[0.00020469159,0.0012911024,0.04849771,0.00042950947,0.001955586,0.0026083572,0.0017236323,0.5043271,0.3259748,0.01883965,0.093870096,0.0002777629],"about_ca_topic_score_codex":0.0038272822,"about_ca_topic_score_gemma":0.006615571,"teacher_disagreement_score":0.009150917,"about_ca_system_score_codex":0.0005071616,"about_ca_system_score_gemma":0.0011617186,"threshold_uncertainty_score":0.02222532},"labels":[],"label_agreement":null},{"id":"W1525225516","doi":"10.1007/978-3-642-03367-4_32","title":"Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Queen's University","funders":"","keywords":"Perimeter; Polygon (computer graphics); Computer science; Algorithm; Set (abstract data type); Line (geometry); Rectilinear polygon; Simple polygon; Mathematics; Monotone polygon; Geometry; Programming language; Telecommunications","score_opus":0.042727481831830054,"score_gpt":0.2994706362007461,"score_spread":0.25674315436891604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525225516","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.02178117,0.0002517199,0.9734109,0.00012220266,0.0000339209,0.00011204519,0.00015432228,0.00074136315,0.003392281],"genre_scores_gemma":[0.091299236,0.0002168875,0.90554565,0.00003516618,0.000023958346,0.00017392168,0.0005460617,0.00022780005,0.0019314702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919885,0.0001302557,0.000049434682,0.00016315025,0.0003633224,0.00009503917],"domain_scores_gemma":[0.998178,0.0011408875,0.00018191844,0.00021942673,0.00020569972,0.00007399979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094494986,0.0015903254,0.0020206855,0.0020043813,0.00080668606,0.0020797816,0.003082536,0.0019855043,0.00667862],"category_scores_gemma":[0.005954957,0.0013195109,0.0013960182,0.003393476,0.0012367807,0.002675463,0.0027264734,0.0020014788,0.0012502475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005516256,0.00023275768,0.0018772368,0.00050465454,0.00009072215,0.00018640317,0.00046382585,0.52885383,0.0051102266,0.03898677,0.007297061,0.41584483],"study_design_scores_gemma":[0.000062777566,0.000064071806,0.00016012354,0.00003236845,0.000024333252,0.000121894016,0.00008916265,0.98075473,0.0015521817,0.015440932,0.0016869417,0.000010536726],"about_ca_topic_score_codex":0.0032082286,"about_ca_topic_score_gemma":0.0034243555,"teacher_disagreement_score":0.00667862,"about_ca_system_score_codex":0.0012455821,"about_ca_system_score_gemma":0.0009884151,"threshold_uncertainty_score":0.022342205},"labels":[],"label_agreement":null},{"id":"W1525324553","doi":"10.1007/978-3-642-16599-3_8","title":"Supporting Smart Interactions with Predictive Analytics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"IBM (Canada); Queen's University","funders":"Mitacs","keywords":"Computer science; Predictive analytics; Analytics; Human–computer interaction; Task (project management); Smart environment; The Internet; Server; Data science; Decision support system; World Wide Web; Internet of Things; Artificial intelligence","score_opus":0.016172141684092978,"score_gpt":0.2815669051613372,"score_spread":0.2653947634772442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525324553","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.031241791,0.00087722286,0.9166871,0.0011923224,0.00028590474,0.00016782549,0.00094918173,0.0155221885,0.033076435],"genre_scores_gemma":[0.5845304,0.0016557917,0.37695423,0.0005750744,0.00030018363,0.00029711594,0.0028406954,0.0012470569,0.031599402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999218,0.0001394479,0.00003850528,0.00016080232,0.00035834216,0.00008501159],"domain_scores_gemma":[0.9976545,0.0013703154,0.00011807238,0.00045317443,0.00026467082,0.00013927858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008244841,0.0012500922,0.0008399008,0.00075058284,0.00063634646,0.003020751,0.002030938,0.0013259522,0.014770204],"category_scores_gemma":[0.005540829,0.0005884826,0.0004768469,0.0011257259,0.00057476724,0.005104444,0.0026417647,0.002004946,0.007555389],"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.0009388753,0.0005638285,0.004760948,0.0005404907,0.00011319949,0.0008007175,0.0014811622,0.03784472,0.039952137,0.06399875,0.05508528,0.79391986],"study_design_scores_gemma":[0.000058343125,0.00017841508,0.0017021484,0.00016398038,0.0000942609,0.00045077046,0.0005980059,0.7044886,0.040801592,0.17375192,0.07762477,0.00008719488],"about_ca_topic_score_codex":0.0010165345,"about_ca_topic_score_gemma":0.0011820209,"teacher_disagreement_score":0.014770204,"about_ca_system_score_codex":0.0002857832,"about_ca_system_score_gemma":0.0005670897,"threshold_uncertainty_score":0.049411297},"labels":[],"label_agreement":null},{"id":"W1525357930","doi":"10.1007/978-3-540-88425-5_50","title":"Computational Intelligence Techniques Applied to Magnetic Resonance Spectroscopy Data of Human Brain Cancers","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"National Research Council Canada","funders":"","keywords":"Computer science; Genetic programming; Artificial neural network; Computational intelligence; Magnetic resonance imaging; Artificial intelligence; Machine learning; Pattern recognition (psychology); Radiology; Medicine","score_opus":0.035083030048430656,"score_gpt":0.29429607840356864,"score_spread":0.259213048355138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525357930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12971212,0.0059887553,0.855536,0.0007428818,0.00022573581,0.00015741836,0.0014307232,0.0009402736,0.005266156],"genre_scores_gemma":[0.35062867,0.0057616346,0.63842064,0.00007817006,0.0002107241,0.00014892327,0.0016485216,0.0001132591,0.0029894144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969804,0.00006948559,0.000041976273,0.000041348587,0.00012700056,0.000022173375],"domain_scores_gemma":[0.99916506,0.00054990145,0.000054946602,0.00007255068,0.00014168028,0.000015965472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082812336,0.00031584405,0.00044548608,0.002425723,0.0002767887,0.0010164963,0.0004017247,0.00032516633,0.0012450663],"category_scores_gemma":[0.0029102184,0.00019986858,0.0007374282,0.0029478567,0.00024977681,0.00054752413,0.00041110654,0.0006574137,0.0005674433],"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.0002492978,0.00008879074,0.0039688554,0.0005629412,0.00015760577,0.00056152407,0.0003893399,0.045332883,0.0668693,0.011195556,0.004870494,0.86575335],"study_design_scores_gemma":[0.00003294754,0.00033289928,0.035052598,0.00013179066,0.00026677168,0.002841632,0.00059003,0.8165499,0.06831429,0.050376244,0.025403664,0.0001071523],"about_ca_topic_score_codex":0.001131558,"about_ca_topic_score_gemma":0.0015062403,"teacher_disagreement_score":0.002425723,"about_ca_system_score_codex":0.00025293007,"about_ca_system_score_gemma":0.00045589008,"threshold_uncertainty_score":0.0043795705},"labels":[],"label_agreement":null},{"id":"W1525438428","doi":"10.1007/3-540-45468-3_145","title":"A Pulsating Coronary Vessel Phantom for Two- and Three-Dimensional Intravascular Ultrasound Studies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coronary Interventions and Diagnostics","field":"Medicine","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":"Robarts Clinical Trials","funders":"","keywords":"Intravascular ultrasound; Imaging phantom; Coronary arteries; Artery; Segmentation; Computer science; Biomedical engineering; Radiology; Medicine; Artificial intelligence; Cardiology","score_opus":0.032444227463233104,"score_gpt":0.31113702563795276,"score_spread":0.27869279817471965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525438428","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.012704109,0.0049928436,0.9659374,0.0005898259,0.00039770504,0.00031470676,0.00033477746,0.0017359375,0.012992764],"genre_scores_gemma":[0.07380957,0.004965674,0.8932174,0.000497501,0.00013682425,0.0005856178,0.00082366046,0.0008494457,0.025114443],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998016,0.000052745152,0.000010726072,0.000028128547,0.000092607006,0.000014215647],"domain_scores_gemma":[0.99900454,0.0006721738,0.000033849537,0.000120434794,0.00010527998,0.00006371361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456044,0.0006747838,0.00047188767,0.000991604,0.00028475214,0.0007009435,0.0010503677,0.0012878918,0.009289949],"category_scores_gemma":[0.0015482988,0.0009141898,0.00035154918,0.0006811883,0.00046694218,0.0010492037,0.00083126395,0.0011114257,0.0024818433],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034506345,0.00021026384,0.0002673219,0.00053764234,0.000022965307,0.0010180266,0.0002061028,0.0065469304,0.7491351,0.016613783,0.009788441,0.2153084],"study_design_scores_gemma":[0.00024060998,0.0019165684,0.0028369594,0.00042888868,0.00022160576,0.025005437,0.00012457564,0.08965481,0.5800228,0.020758005,0.2785461,0.00024363899],"about_ca_topic_score_codex":0.00014177724,"about_ca_topic_score_gemma":0.00024873993,"teacher_disagreement_score":0.009289949,"about_ca_system_score_codex":0.0002257719,"about_ca_system_score_gemma":0.00040403905,"threshold_uncertainty_score":0.031077981},"labels":[],"label_agreement":null},{"id":"W1525440567","doi":"10.1007/978-3-642-05118-0_35","title":"Distributed Power Control with Multiple Agents in a Distributed Base Station Scheme Using Macrodiversity","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power Line Communications and Noise","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":"Université Laval","funders":"","keywords":"Computer science; Base station; Scheme (mathematics); Power control; Distributed power; Distributed computing; Computer network; Power (physics); Mathematics","score_opus":0.01894594724896087,"score_gpt":0.23420964638513253,"score_spread":0.21526369913617166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525440567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023360046,0.00020101582,0.97267604,0.000111757814,0.00008116261,0.000046588564,0.000019261415,0.00018642127,0.003317699],"genre_scores_gemma":[0.8889592,0.00018966828,0.10591931,0.00007336966,0.00012402053,0.0001531179,0.000030509224,0.000029012244,0.004521737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993735,0.00019694833,0.00004648723,0.00017274012,0.00013819696,0.000072145514],"domain_scores_gemma":[0.99913126,0.00038582837,0.00008100884,0.00014114725,0.00018925275,0.00007155001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008913458,0.0006962426,0.0012615235,0.00038223996,0.0008384471,0.0012909749,0.0015830834,0.0006822431,0.0021346146],"category_scores_gemma":[0.001513478,0.00032064965,0.00043293822,0.0007542105,0.00084537466,0.0010680971,0.0016574172,0.00086877,0.00032336835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041862897,0.0001602303,0.0005615707,0.00014182598,0.00014462216,0.0002141764,0.00023829115,0.80064255,0.018480053,0.06675813,0.0014768105,0.11076312],"study_design_scores_gemma":[0.000046052453,0.00010074083,0.00007978487,0.000004580959,0.000023720086,0.000038439313,0.000009678504,0.9884946,0.0010640955,0.009379303,0.0007485499,0.000010548686],"about_ca_topic_score_codex":0.0011095928,"about_ca_topic_score_gemma":0.0018278288,"teacher_disagreement_score":0.0021346146,"about_ca_system_score_codex":0.00055120443,"about_ca_system_score_gemma":0.0006060526,"threshold_uncertainty_score":0.007140994},"labels":[],"label_agreement":null},{"id":"W1525467666","doi":"10.1007/978-3-642-19167-1_3","title":"Self-organized Middle-Out Abstraction","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Abstraction; Rendering (computer graphics); Representation (politics); Theoretical computer science; Process (computing); Expressive power; Artificial intelligence; Distributed computing; Programming language","score_opus":0.03650520912462103,"score_gpt":0.26621596059910796,"score_spread":0.22971075147448694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525467666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02281276,0.00042948412,0.90518117,0.00040327065,0.0002992128,0.00007914715,0.00022100031,0.003735628,0.066838324],"genre_scores_gemma":[0.56643003,0.0008701234,0.3561351,0.00048234803,0.00027285874,0.00020478092,0.0011946063,0.0021065003,0.07230372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924195,0.00010640668,0.00005413554,0.0001577359,0.0002591868,0.00018059986],"domain_scores_gemma":[0.9986689,0.00022253951,0.00006206395,0.0007004761,0.00021322249,0.00013282143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862789,0.00076987373,0.0007053491,0.0010960726,0.0015244249,0.0034833697,0.0020228655,0.0010001123,0.020543432],"category_scores_gemma":[0.003071977,0.0006129649,0.0009954685,0.0011433798,0.0017469883,0.00835811,0.0056587416,0.0025655145,0.004935301],"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.000095573305,0.00004307177,0.0003845937,0.000090163354,0.000017269165,0.00018533075,0.0007705894,0.0030325595,0.0044606905,0.9268392,0.008004125,0.05607686],"study_design_scores_gemma":[0.000020017418,0.000028547844,0.00023429834,0.000053450996,0.000025222304,0.00017546126,0.00024858932,0.040542215,0.006494796,0.9045429,0.047609508,0.000024960927],"about_ca_topic_score_codex":0.0010712531,"about_ca_topic_score_gemma":0.0014018827,"teacher_disagreement_score":0.020543432,"about_ca_system_score_codex":0.0007975127,"about_ca_system_score_gemma":0.0008733036,"threshold_uncertainty_score":0.06872463},"labels":[],"label_agreement":null},{"id":"W1525512896","doi":"10.1007/978-3-540-39648-2_39","title":"A Declarative XML-RL Update Language","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Carleton University","funders":"","keywords":"Programming language; XML; Computer science; Declarative programming; Linguistics; Natural language processing; World Wide Web; Philosophy","score_opus":0.012814543865592403,"score_gpt":0.25242050198801835,"score_spread":0.23960595812242594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525512896","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.001430406,0.00016800789,0.91644484,0.0001951803,0.0001429471,0.00015288002,0.0012338682,0.07102678,0.009205108],"genre_scores_gemma":[0.05979355,0.0006776352,0.8456015,0.0010321122,0.00019913379,0.00054911256,0.009521248,0.027709527,0.054916233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813926,0.00031077932,0.00032057756,0.0002953665,0.00079144945,0.00014249019],"domain_scores_gemma":[0.9982316,0.00064782595,0.00010876086,0.00058653485,0.00034524366,0.00008012054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002520049,0.0011300752,0.0010494755,0.0011157824,0.0007202152,0.0045450525,0.0044946996,0.0014390703,0.023991618],"category_scores_gemma":[0.0045277374,0.0016445387,0.0011080486,0.0012535212,0.0013795135,0.005094165,0.003074706,0.0031875416,0.014941463],"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.00054844003,0.00036167313,0.0008560917,0.0011955189,0.00009400893,0.00069982704,0.001505805,0.016283194,0.03069399,0.3058151,0.14736605,0.49458042],"study_design_scores_gemma":[0.0002880995,0.00019405327,0.0003287323,0.0002938888,0.00018779577,0.0010891295,0.00026450114,0.14774151,0.07751751,0.09637331,0.6754803,0.00024120467],"about_ca_topic_score_codex":0.0029859943,"about_ca_topic_score_gemma":0.0029146885,"teacher_disagreement_score":0.023991618,"about_ca_system_score_codex":0.0007244411,"about_ca_system_score_gemma":0.0014294506,"threshold_uncertainty_score":0.08025992},"labels":[],"label_agreement":null},{"id":"W1525517827","doi":"10.1007/3-540-45005-x_18","title":"Improved Bounds on the Number of Automata Accepting Finite Languages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Computer science; Pairwise comparison; Automaton; Finite-state machine; Upper and lower bounds; DFA minimization; Regular language; Quantum finite automata; Finite set; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Automata theory; Artificial intelligence","score_opus":0.014217663678697284,"score_gpt":0.2594135747342495,"score_spread":0.2451959110555522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525517827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09938587,0.008642907,0.7389852,0.007510298,0.0027052148,0.00044603235,0.00326647,0.008621026,0.13043706],"genre_scores_gemma":[0.5912641,0.0046837823,0.32904354,0.0030177766,0.0050246106,0.0018910842,0.0051653464,0.0041980674,0.055711642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98399144,0.002871462,0.0010717076,0.0039449916,0.004964584,0.0031558322],"domain_scores_gemma":[0.87014043,0.10097415,0.00252816,0.01725513,0.005586659,0.0035155239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01010099,0.0045085344,0.004813867,0.004632745,0.0035758927,0.010558831,0.014223263,0.0050265053,0.035055652],"category_scores_gemma":[0.0528238,0.0029025876,0.005728125,0.0037045118,0.0071912245,0.030469991,0.011259516,0.016222479,0.008760187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006813597,0.0009463212,0.0044764676,0.0019505762,0.00044361895,0.0006080615,0.0013099465,0.15218161,0.03555846,0.6049186,0.044574175,0.14621854],"study_design_scores_gemma":[0.00023045077,0.0002689973,0.0013055116,0.00023383106,0.00033054495,0.0003788499,0.00014191067,0.29314896,0.013253855,0.678018,0.012522831,0.00016634275],"about_ca_topic_score_codex":0.0020620076,"about_ca_topic_score_gemma":0.0039022977,"teacher_disagreement_score":0.035055652,"about_ca_system_score_codex":0.007815981,"about_ca_system_score_gemma":0.003477831,"threshold_uncertainty_score":0.11727291},"labels":[],"label_agreement":null},{"id":"W1525524375","doi":"10.1007/978-3-540-68123-6_46","title":"Evaluating Information Retrieval System Performance Based on Multi-grade Relevance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"Relevance (law); Computer science; Information retrieval; Rank (graph theory); Precision and recall; Relevance feedback; Learning to rank; Document retrieval; Measure (data warehouse); Recall; Data mining; Artificial intelligence; Mathematics; Ranking (information retrieval); Image retrieval; Psychology","score_opus":0.048144291722296,"score_gpt":0.29308858190254466,"score_spread":0.24494429018024866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525524375","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.9815145,0.0015139238,0.01267773,0.00009662992,0.00006533595,0.00012840414,0.00035348284,0.0005414431,0.0031085345],"genre_scores_gemma":[0.9920643,0.00016761874,0.0061039845,0.00001877976,0.000044920653,0.0000278397,0.00051989267,0.000035239398,0.0010173409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559504,0.001349719,0.0005280295,0.00047354383,0.0018073685,0.00024636745],"domain_scores_gemma":[0.9655976,0.027216189,0.0020984286,0.0012886942,0.003108777,0.0006903328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047305864,0.0006943439,0.0010897124,0.003261995,0.00037567312,0.0019620555,0.00057300297,0.0014587833,0.0018702308],"category_scores_gemma":[0.03071233,0.00022902513,0.00075202377,0.0014916124,0.00032523763,0.002334887,0.0007316466,0.00054134405,0.0013884248],"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.022563241,0.0029775647,0.27540135,0.0014978405,0.0022587187,0.00026705675,0.00043772187,0.03692907,0.10113174,0.0009531684,0.003803975,0.5517787],"study_design_scores_gemma":[0.0005271273,0.01810954,0.34536767,0.000071286966,0.0020798715,0.0007988152,0.00038756704,0.5254363,0.10412903,0.0012603219,0.0015240503,0.00030841865],"about_ca_topic_score_codex":0.0015088416,"about_ca_topic_score_gemma":0.0016867394,"teacher_disagreement_score":0.0047305864,"about_ca_system_score_codex":0.00045333305,"about_ca_system_score_gemma":0.00032901592,"threshold_uncertainty_score":0.025018036},"labels":[],"label_agreement":null},{"id":"W1525657393","doi":"10.1007/978-3-540-85988-8_120","title":"Surface-Based Vector Analysis Using Heat Equation Interpolation: A New Approach to Quantify Local Hippocampal Volume Changes","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neuroscience and Neuropharmacology Research","field":"Neuroscience","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Interpolation (computer graphics); Hippocampal formation; Jacobian matrix and determinant; Displacement (psychology); Surface (topology); Computer science; Algorithm; Mathematical analysis; Geometry; Mathematics; Neuroscience; Artificial intelligence; Applied mathematics; Biology","score_opus":0.1447844019674959,"score_gpt":0.35748318234457443,"score_spread":0.21269878037707854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525657393","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.0046780463,0.00006702362,0.99459654,0.000025261943,0.000019266277,0.000018588056,0.000056193192,0.0003401797,0.00019893928],"genre_scores_gemma":[0.10621795,0.00038163265,0.89124125,0.000030818595,0.000065240354,0.000090760404,0.00019514935,0.00038942235,0.0013876769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.000049937145,0.00001824399,0.00004570819,0.00013494969,0.000020339952],"domain_scores_gemma":[0.9992268,0.00028288734,0.000093275135,0.00009466263,0.000263104,0.00003921358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007377329,0.000750858,0.0007761794,0.0020787022,0.00028514254,0.001190152,0.00086517277,0.0006320607,0.002435355],"category_scores_gemma":[0.0017476735,0.00040733773,0.0007211964,0.0024117415,0.00055632077,0.0016190637,0.0008643384,0.00073309033,0.00066375016],"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.00023761259,0.00011844423,0.0025620211,0.00029684033,0.000151576,0.00009131727,0.0002293101,0.091994174,0.118344545,0.018264022,0.003040045,0.76467013],"study_design_scores_gemma":[0.0000091306665,0.000050852366,0.0013230139,0.000010592335,0.000030559513,0.00010970408,0.000033764063,0.97413117,0.015394761,0.0063906033,0.002472585,0.00004324692],"about_ca_topic_score_codex":0.0015335015,"about_ca_topic_score_gemma":0.0018955356,"teacher_disagreement_score":0.002435355,"about_ca_system_score_codex":0.00031819666,"about_ca_system_score_gemma":0.0006511227,"threshold_uncertainty_score":0.008147061},"labels":[],"label_agreement":null},{"id":"W1525672419","doi":"10.1007/978-3-540-87989-3_17","title":"On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Reuse; Breakpoint; Genome; Computer science; Set (abstract data type); Human genome; Computational biology; Theoretical computer science; Algorithm; Chromosomal translocation; Biology; Genetics; Programming language; Gene","score_opus":0.013107243622082966,"score_gpt":0.23316020105837743,"score_spread":0.22005295743629447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525672419","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.20986913,0.0018585047,0.77230173,0.0009906042,0.00022011234,0.00019766527,0.00067909056,0.0027343428,0.011148912],"genre_scores_gemma":[0.64356107,0.0010291713,0.34780553,0.0002843258,0.00027292542,0.00029516354,0.0014864156,0.0008551101,0.0044103987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802566,0.0007966843,0.00010729922,0.000373543,0.00040414598,0.00029268407],"domain_scores_gemma":[0.9631005,0.031640522,0.0008564828,0.0025183875,0.0011049462,0.0007792461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005939782,0.0018187551,0.0030652594,0.0029910693,0.0015407226,0.0032272558,0.005641181,0.0035808606,0.0083070025],"category_scores_gemma":[0.041309077,0.0013726746,0.0017743331,0.004640024,0.0024208226,0.008641298,0.0041794525,0.0037099996,0.0011986295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065562956,0.00014477555,0.00311379,0.0001380315,0.00007536874,0.0000834466,0.00016200723,0.8801674,0.0011035654,0.039311174,0.0032037061,0.07184112],"study_design_scores_gemma":[0.000021767799,0.000020299885,0.00020173388,0.000010346998,0.0000110033825,0.000020739744,0.000022073069,0.9629416,0.00028635413,0.036280293,0.0001751493,0.0000086236505],"about_ca_topic_score_codex":0.007156958,"about_ca_topic_score_gemma":0.006187384,"teacher_disagreement_score":0.0083070025,"about_ca_system_score_codex":0.001943901,"about_ca_system_score_gemma":0.0015693376,"threshold_uncertainty_score":0.03141296},"labels":[],"label_agreement":null},{"id":"W152581782","doi":"10.1007/978-3-642-33140-4_13","title":"Evaluating the Effects of MJPEG Compression on Motion Tracking in Metro Railway Surveillance","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Nexen (Canada)","funders":"","keywords":"Computer science; Analytics; Ground truth; MATLAB; Video tracking; Real-time computing; Wireless; Tracking (education); Artificial intelligence; Computer vision; Data compression; Match moving; Computation; Bandwidth (computing); Motion (physics); Data mining; Video processing; Telecommunications; Algorithm","score_opus":0.049168844388256715,"score_gpt":0.34596490067054625,"score_spread":0.29679605628228956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152581782","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.96762365,0.0015581817,0.027418993,0.000091555805,0.0000807863,0.00007281443,0.00028940843,0.0005483529,0.0023163606],"genre_scores_gemma":[0.9788079,0.0007319269,0.018872777,0.00003172131,0.000029136745,0.000013058426,0.00044921704,0.00008312327,0.0009810884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995627,0.000081381266,0.00002840663,0.00006212334,0.00020563079,0.000059782364],"domain_scores_gemma":[0.9975356,0.0016961966,0.00018523172,0.00012292969,0.00038313668,0.000076829034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007143115,0.00049615797,0.00031222476,0.00063766574,0.00021008753,0.00053496455,0.00039045402,0.00052368635,0.0010327897],"category_scores_gemma":[0.005574805,0.00016081946,0.00018179369,0.0006180957,0.00021805258,0.00061848114,0.00031859797,0.00027773742,0.00018666575],"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.010147891,0.00076100434,0.017075399,0.0006355468,0.00021344675,0.00045547338,0.00017961982,0.24855499,0.23910806,0.0007380935,0.0017455617,0.48038495],"study_design_scores_gemma":[0.000099454504,0.0024330842,0.029581701,0.00006369211,0.00022030484,0.00046127112,0.00012565851,0.81615573,0.14944285,0.00035254404,0.0010268089,0.000036902195],"about_ca_topic_score_codex":0.0070230924,"about_ca_topic_score_gemma":0.007005288,"teacher_disagreement_score":0.0070230924,"about_ca_system_score_codex":0.00036196737,"about_ca_system_score_gemma":0.00033855214,"threshold_uncertainty_score":0.013964415},"labels":[],"label_agreement":null},{"id":"W1525829520","doi":"10.1007/11792086_7","title":"Numerical Results on Class Groups of Imaginary Quadratic Fields","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 Calgary","funders":"","keywords":"Correctness; Heuristics; Ideal class group; Quadratic equation; Discriminant; Computation; Class (philosophy); Computer science; Class field theory; Group (periodic table); Prime (order theory); Quadratic field; Mathematics; TRACE (psycholinguistics); Algorithm; Algebra over a field; Discrete mathematics; Theoretical computer science; Pure mathematics; Combinatorics; Algebraic number field; Mathematical optimization; Artificial intelligence; Quadratic function; Geometry","score_opus":0.020262058418464162,"score_gpt":0.2692201838400976,"score_spread":0.24895812542163345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525829520","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.29309055,0.004340047,0.28168568,0.0046358644,0.0014727674,0.00012158654,0.0010297745,0.00097101985,0.4126526],"genre_scores_gemma":[0.92274565,0.0012667434,0.03571592,0.00039570898,0.0007019392,0.00013028219,0.0006307562,0.00039020952,0.038022727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00019676155,0.000040164647,0.00011187852,0.00035222524,0.000112199385],"domain_scores_gemma":[0.99624395,0.0018205967,0.000401703,0.0005186531,0.00051730283,0.0004978792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014241231,0.00089345203,0.000868134,0.0034295032,0.001829219,0.0027414972,0.0017223048,0.00089050207,0.02017567],"category_scores_gemma":[0.011439075,0.0003391199,0.0004955959,0.0022871853,0.003631503,0.0053315554,0.0020056607,0.0016509568,0.001762654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007365507,0.00004691496,0.00080196845,0.00011859149,0.000011037461,0.000042743653,0.0001441901,0.008806355,0.00093948917,0.9763672,0.0033233569,0.009324564],"study_design_scores_gemma":[0.000025449877,0.000020519507,0.0006516529,0.000047962563,0.000011280376,0.000093581264,0.000088776294,0.026991319,0.00071355054,0.96584934,0.005490109,0.000016452625],"about_ca_topic_score_codex":0.0009090564,"about_ca_topic_score_gemma":0.001632304,"teacher_disagreement_score":0.02017567,"about_ca_system_score_codex":0.0018168368,"about_ca_system_score_gemma":0.00089977,"threshold_uncertainty_score":0.06749433},"labels":[],"label_agreement":null},{"id":"W1525844770","doi":"10.1007/11590354_83","title":"Grid Resource Discovery Using Semantic Communities","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 British Columbia","funders":"","keywords":"Computer science; Semantic grid; Grid; Resource (disambiguation); Variety (cybernetics); Shared resource; Data science; Semantic heterogeneity; Space (punctuation); Semantic Web; World Wide Web; Distributed computing; Information retrieval; Artificial intelligence; Computer network","score_opus":0.02715414463087967,"score_gpt":0.250932070406518,"score_spread":0.22377792577563832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525844770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017122358,0.00057694816,0.9688247,0.00054442586,0.00010627687,0.00017555029,0.00025199467,0.003047889,0.009349877],"genre_scores_gemma":[0.31554917,0.00065900723,0.6758295,0.000120337456,0.00007034601,0.00016100565,0.0013365691,0.00039006962,0.005883875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827206,0.0005571493,0.00012125418,0.0002442134,0.00069898576,0.000106330364],"domain_scores_gemma":[0.9976738,0.00092005066,0.00012227645,0.0008222742,0.0003241291,0.00013754024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022337055,0.00048532858,0.0010862465,0.0030329449,0.0017951372,0.002901542,0.0017556278,0.0008991632,0.0021726824],"category_scores_gemma":[0.0055857548,0.0006668927,0.0009299753,0.005135268,0.00093093724,0.004929193,0.0033267224,0.0010306961,0.0008308403],"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.00055600103,0.00037238296,0.002410407,0.0005598549,0.0003096256,0.00050642964,0.0008695416,0.10848301,0.008393573,0.30448723,0.022448642,0.5506034],"study_design_scores_gemma":[0.00006919732,0.000032646934,0.00038178,0.00006390752,0.000081863625,0.00033071593,0.00029818827,0.6630709,0.009346215,0.29514894,0.031122968,0.000052663432],"about_ca_topic_score_codex":0.0049807806,"about_ca_topic_score_gemma":0.007901002,"teacher_disagreement_score":0.0049807806,"about_ca_system_score_codex":0.00088122446,"about_ca_system_score_gemma":0.0013080786,"threshold_uncertainty_score":0.011813045},"labels":[],"label_agreement":null},{"id":"W1525849597","doi":"10.1007/3-540-45554-x_39","title":"Supervised Learning: A Generalized Rough Set Approach","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rough set; Computer science; Class (philosophy); Rule induction; Artificial intelligence; Dominance-based rough set approach; Data mining; Machine learning; Set (abstract data type); Noise (video); Training set; Variable (mathematics); Pattern recognition (psychology); Mathematics; Image (mathematics)","score_opus":0.03521178454381628,"score_gpt":0.24706394403905027,"score_spread":0.211852159495234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525849597","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.0023598757,0.00049343135,0.9958681,0.00013953978,0.00004071321,0.000026263195,0.000030153145,0.00014289221,0.0008990467],"genre_scores_gemma":[0.1678268,0.0013582829,0.8271953,0.00017247774,0.00029301172,0.00021083801,0.00022135791,0.00008747109,0.0026344373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965454,0.0015743294,0.00020008863,0.00038787196,0.0011879536,0.00010438944],"domain_scores_gemma":[0.9970305,0.0019387687,0.00017619914,0.00043507936,0.00036817318,0.000051243198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031746922,0.0006407263,0.0024647592,0.0013733016,0.00054376555,0.0021388065,0.0018776532,0.0011449057,0.0015865965],"category_scores_gemma":[0.008897026,0.000517728,0.001584114,0.00140533,0.001169952,0.0028289626,0.0014906718,0.001355352,0.00045849927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001400162,0.00014541578,0.0007589498,0.0005346413,0.0004040822,0.00018112402,0.00024898842,0.21514992,0.002241982,0.30056292,0.0076535293,0.47197852],"study_design_scores_gemma":[0.000023135122,0.00006087015,0.00029140673,0.000037073798,0.00007379476,0.00009945894,0.00003732963,0.6809578,0.0010825314,0.31320247,0.00410341,0.00003077999],"about_ca_topic_score_codex":0.0009562679,"about_ca_topic_score_gemma":0.0012136879,"teacher_disagreement_score":0.0031746922,"about_ca_system_score_codex":0.00075393857,"about_ca_system_score_gemma":0.0009511467,"threshold_uncertainty_score":0.016789556},"labels":[],"label_agreement":null},{"id":"W1525896424","doi":"10.1007/978-3-540-72521-3_17","title":"Tree-Traversal Orientation Analysis","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Computer science; Pointer (user interface); Data structure; Parallel computing; Compiler; Tree (set theory); Benchmark (surveying); Programming language; Artificial intelligence; Mathematics","score_opus":0.019222499828934765,"score_gpt":0.2789464715031697,"score_spread":0.25972397167423494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525896424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026683355,0.00050916406,0.9103286,0.00034080894,0.00015462039,0.0001182599,0.0006328177,0.0020262557,0.05920613],"genre_scores_gemma":[0.42620838,0.0013856201,0.50221264,0.00038896568,0.00024824473,0.00021280213,0.003886841,0.0026079377,0.062848546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995378,0.000051252122,0.00001877757,0.00008375601,0.00020258027,0.000105818865],"domain_scores_gemma":[0.9991003,0.00023687918,0.000058417718,0.00023549864,0.0003078261,0.00006107738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041183847,0.00072744983,0.00066426245,0.002038014,0.0008047815,0.0020683361,0.0013233557,0.00066405226,0.015155974],"category_scores_gemma":[0.0023944199,0.0004379663,0.0009918418,0.0027488389,0.00072893803,0.0027520368,0.001275741,0.001852026,0.0042427834],"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.00010728407,0.00012776507,0.0017494597,0.00013908822,0.000032044398,0.00014495918,0.00018418502,0.025751302,0.0071846386,0.69120926,0.022234602,0.2511354],"study_design_scores_gemma":[0.00001808977,0.000040133065,0.0010989468,0.00006186822,0.000052554467,0.00027192463,0.00015583883,0.29473296,0.008972991,0.6641456,0.030419994,0.000029053048],"about_ca_topic_score_codex":0.0028758121,"about_ca_topic_score_gemma":0.0039120372,"teacher_disagreement_score":0.015155974,"about_ca_system_score_codex":0.0010131423,"about_ca_system_score_gemma":0.0010636309,"threshold_uncertainty_score":0.050701797},"labels":[],"label_agreement":null},{"id":"W1525946179","doi":"10.1007/978-3-642-02247-0_4","title":"Modeling User Affect from Causes and Effects","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Affect (linguistics); Valence (chemistry); Variety (cybernetics); User modeling; Human–computer interaction; Computer users; Affective computing; Artificial intelligence; Machine learning; User interface; Multimedia; Programming language","score_opus":0.018378127902398903,"score_gpt":0.24331828697793034,"score_spread":0.22494015907553144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525946179","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.5007948,0.0007050198,0.47146824,0.0005711066,0.00007266438,0.000111169655,0.00036906803,0.00080657547,0.025101315],"genre_scores_gemma":[0.9847319,0.00016780687,0.012561276,0.000021937954,0.000016137807,0.000039575483,0.00007871733,0.000048116275,0.002334612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993799,0.00033125584,0.000021793587,0.000097689306,0.00010602699,0.00006326718],"domain_scores_gemma":[0.9945417,0.004554064,0.00022750262,0.0002997624,0.00027249125,0.000104577826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010815716,0.0005167607,0.00036521067,0.0007514342,0.00035524063,0.001306783,0.00044546594,0.00065781595,0.0025446692],"category_scores_gemma":[0.009223592,0.0004847019,0.0005963666,0.0004757559,0.000583226,0.0020112484,0.00071627845,0.0008345143,0.00038187485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082722865,0.00050211244,0.090259455,0.00025412499,0.0003840453,0.0007145279,0.003494007,0.56464446,0.007858136,0.122128636,0.003872579,0.20506065],"study_design_scores_gemma":[0.000013590504,0.000064785185,0.010223243,0.00001608232,0.00010175833,0.00010200094,0.00020020471,0.9454514,0.0011096806,0.041644264,0.0010531856,0.000019721278],"about_ca_topic_score_codex":0.005376522,"about_ca_topic_score_gemma":0.005157164,"teacher_disagreement_score":0.005376522,"about_ca_system_score_codex":0.00053708104,"about_ca_system_score_gemma":0.00039437631,"threshold_uncertainty_score":0.010690451},"labels":[],"label_agreement":null},{"id":"W1526028571","doi":"10.1007/3-540-44886-1_16","title":"Selective Transfer of Task Knowledge Using Stochastic Noise","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Acadia University","funders":"","keywords":"Computer science; Generalization; Task (project management); Context (archaeology); Multi-task learning; Artificial intelligence; Noise (video); Artificial neural network; Transfer of learning; Machine learning; Mathematics","score_opus":0.024703247331107212,"score_gpt":0.2606277837755209,"score_spread":0.23592453644441372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526028571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06942191,0.0005399613,0.923226,0.00029286076,0.00015291273,0.000108959925,0.00009686069,0.0014722095,0.004688333],"genre_scores_gemma":[0.8916927,0.0006425377,0.09546128,0.00039884564,0.00013734505,0.00021265094,0.0005008508,0.00029189998,0.010661955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992611,0.00019336902,0.00003548691,0.0002636546,0.00015129843,0.00009514105],"domain_scores_gemma":[0.9962657,0.0024576685,0.00015030096,0.0007110228,0.00027689908,0.00013825868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015895799,0.0009717317,0.0011981255,0.0004630591,0.00033974217,0.0010466923,0.0014137418,0.0012768722,0.002116636],"category_scores_gemma":[0.009525499,0.0005797509,0.00080312527,0.0006401806,0.0008594512,0.002559703,0.0030268405,0.0021887335,0.0010714914],"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.0006333875,0.00071839,0.0017577811,0.00033104085,0.0003310256,0.00025548882,0.0005053625,0.23534088,0.07604909,0.016173186,0.006007736,0.6618966],"study_design_scores_gemma":[0.00002906544,0.00016120086,0.0014618242,0.000024221708,0.00007267223,0.00012880962,0.00006265467,0.947026,0.018641392,0.030970741,0.0013896853,0.000031605316],"about_ca_topic_score_codex":0.0015277766,"about_ca_topic_score_gemma":0.0016127796,"teacher_disagreement_score":0.002116636,"about_ca_system_score_codex":0.0004736662,"about_ca_system_score_gemma":0.0007429488,"threshold_uncertainty_score":0.008406639},"labels":[],"label_agreement":null},{"id":"W1526081339","doi":"10.1007/978-3-642-02611-9_65","title":"Human Tracking by IP PTZ Camera Control in the Context of Video Surveillance","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Initialization; Diagonal; Feature extraction; Tracking (education); Pattern recognition (psychology); Mathematics","score_opus":0.02074441223231583,"score_gpt":0.28114794520089337,"score_spread":0.26040353296857754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526081339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040598143,0.0014530824,0.9449255,0.00011941717,0.00009838703,0.000042531738,0.0000608306,0.0008206573,0.011881472],"genre_scores_gemma":[0.80634767,0.001777148,0.17956525,0.00008742875,0.000120922836,0.000039911232,0.00015715457,0.00010245787,0.01180201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980944,0.000031376705,0.000005866137,0.000077266195,0.000054006694,0.000022053817],"domain_scores_gemma":[0.99985075,0.000058833924,0.00002154488,0.000030167268,0.000029648574,0.00000892397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024114473,0.00036407515,0.0004210217,0.00030643147,0.00014695569,0.0007410319,0.0005788253,0.000486846,0.002049971],"category_scores_gemma":[0.00080296386,0.00018881996,0.00020939297,0.00043785272,0.00036491867,0.00072763494,0.00050245237,0.00042199265,0.0005292113],"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.0006869758,0.00007143125,0.0018897512,0.0002633156,0.00004094709,0.0003316251,0.00027487442,0.056636307,0.14488202,0.017529419,0.0050601065,0.77233326],"study_design_scores_gemma":[0.000029620753,0.0003591942,0.005772119,0.00004152724,0.000058773447,0.0009986813,0.00008760325,0.8951342,0.075245224,0.010678497,0.011563299,0.00003122259],"about_ca_topic_score_codex":0.0015046771,"about_ca_topic_score_gemma":0.0010385534,"teacher_disagreement_score":0.002049971,"about_ca_system_score_codex":0.00024068257,"about_ca_system_score_gemma":0.00015049335,"threshold_uncertainty_score":0.006857872},"labels":[],"label_agreement":null},{"id":"W1526085588","doi":"10.1007/978-3-540-40899-4_122","title":"Repeatability and Accuracy of Bone Cutting and Ankle Digitization in Computer-Assisted Total Knee Replacements","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Valgus; Repeatability; Cadaver; Orthodontics; Implant; Medicine; Orientation (vector space); Digitization; Computer science; Surgery; Mathematics; Computer vision","score_opus":0.01387235892492814,"score_gpt":0.259015558326721,"score_spread":0.24514319940179288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526085588","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.82419676,0.015832335,0.14557754,0.00030837388,0.0005310817,0.000112120026,0.0010899465,0.0008183963,0.011533448],"genre_scores_gemma":[0.9660324,0.0015005047,0.029181818,0.000059740476,0.00010539859,0.000028764895,0.00036585043,0.0002270006,0.0024985895],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.990558,0.0025798953,0.0012147012,0.0014950018,0.003899343,0.00025293668],"domain_scores_gemma":[0.92270833,0.05914559,0.004172925,0.0045165406,0.009216837,0.00023978372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00745579,0.00031885016,0.00060554914,0.001461181,0.0002890374,0.0012483252,0.0015205787,0.0009477721,0.0014701036],"category_scores_gemma":[0.052411694,0.0007374869,0.0004508733,0.0014166659,0.00069464697,0.0009741431,0.0007359872,0.00060739217,0.0009209864],"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.0021572285,0.0001077074,0.28261942,0.0005670617,0.00035114275,0.0002484376,0.002147498,0.009693685,0.03979617,0.00092885137,0.0022441663,0.65913856],"study_design_scores_gemma":[0.000035072342,0.0013902747,0.9062628,0.00015332049,0.00042345136,0.004652682,0.0006676476,0.029140104,0.05211228,0.0009843487,0.0040454906,0.00013254996],"about_ca_topic_score_codex":0.0038951945,"about_ca_topic_score_gemma":0.009661357,"teacher_disagreement_score":0.00745579,"about_ca_system_score_codex":0.000526646,"about_ca_system_score_gemma":0.00041526076,"threshold_uncertainty_score":0.0394305},"labels":[],"label_agreement":null},{"id":"W1526090859","doi":"10.1007/978-3-642-02026-1_7","title":"Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Generalization; Voting; Multiplicative function; Sample (material); Data mining; Algorithm; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.013471916333133114,"score_gpt":0.2520328859135355,"score_spread":0.2385609695804024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526090859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051844507,0.00016632078,0.992665,0.00011281992,0.00003243461,0.00006622847,0.00011075476,0.0012540396,0.00040795509],"genre_scores_gemma":[0.120126545,0.00012032742,0.8731721,0.00025639145,0.00012700446,0.0003211105,0.0015701087,0.0005177615,0.0037886691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932092,0.0026071956,0.0003279308,0.00172719,0.0015319372,0.0005965088],"domain_scores_gemma":[0.9900595,0.0050219623,0.0005338067,0.0020404195,0.0020726663,0.00027165044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070003676,0.0017661377,0.004398964,0.0029699393,0.0019571623,0.0037185187,0.007643027,0.0030880282,0.0041800444],"category_scores_gemma":[0.013425046,0.0016952995,0.0025117681,0.0040587457,0.0016040686,0.0033633376,0.005250136,0.0028703818,0.004168415],"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.0012821348,0.00037367712,0.0030706096,0.00034620313,0.0007238092,0.00020242498,0.00029262793,0.12264823,0.017658873,0.014621404,0.013085284,0.82569474],"study_design_scores_gemma":[0.000034664616,0.00005710021,0.00032747063,0.000008852228,0.000047321486,0.00005186697,0.000029437582,0.9852616,0.00384447,0.009303862,0.0010116695,0.000021628422],"about_ca_topic_score_codex":0.003733774,"about_ca_topic_score_gemma":0.007442199,"teacher_disagreement_score":0.007643027,"about_ca_system_score_codex":0.0010252744,"about_ca_system_score_gemma":0.002022061,"threshold_uncertainty_score":0.037021935},"labels":[],"label_agreement":null},{"id":"W1526131532","doi":"10.1007/bfb0028285","title":"Sorting multisets and vectors in-place","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Multiset; Lexicographical order; Sorting; Upper and lower bounds; sort; Combinatorics; Mathematics; Sorting algorithm; Order (exchange); Discrete mathematics; Term (time); Algorithm; Computer science; Arithmetic","score_opus":0.01316834236935435,"score_gpt":0.24801868069461194,"score_spread":0.2348503383252576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526131532","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.03223909,0.0053002215,0.88703036,0.0008581512,0.0015535377,0.00018748314,0.0007783428,0.0033580202,0.06869476],"genre_scores_gemma":[0.1918845,0.004491088,0.6671115,0.0004617076,0.00070430746,0.00021353184,0.002633307,0.001334018,0.13116594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886715,0.00012390739,0.00011817103,0.00021198129,0.0005487621,0.00013004444],"domain_scores_gemma":[0.9989667,0.00023417007,0.00008548468,0.00042867096,0.00022818471,0.000056747904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005709186,0.0010269118,0.0012674442,0.0027707182,0.0014495378,0.0036400363,0.0017970307,0.00086983177,0.019794103],"category_scores_gemma":[0.0026110986,0.0007766803,0.0009959418,0.009163208,0.0017103913,0.007966704,0.0026790854,0.001938037,0.005809146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020924985,0.000075279204,0.00049287995,0.00043125713,0.000040196068,0.00011160028,0.0003136571,0.008721563,0.00597917,0.53793734,0.017650971,0.4280368],"study_design_scores_gemma":[0.000024626088,0.00011571206,0.00043044466,0.00014080644,0.00003911553,0.0004718065,0.0002918902,0.021977214,0.0143424785,0.8457994,0.11631593,0.000050508686],"about_ca_topic_score_codex":0.00082256977,"about_ca_topic_score_gemma":0.0014247334,"teacher_disagreement_score":0.019794103,"about_ca_system_score_codex":0.0010846809,"about_ca_system_score_gemma":0.00083884783,"threshold_uncertainty_score":0.0662179},"labels":[],"label_agreement":null},{"id":"W1526144783","doi":"10.1007/11564096_59","title":"Active Learning in Partially Observable Markov Decision Processes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Markov decision process; Observable; Computer science; Process (computing); Markov process; Mathematical optimization; Decision problem; Artificial intelligence; Decision process; Markov chain; Markov model; Machine learning; Mathematics; Algorithm; Engineering; Management science; Statistics","score_opus":0.013629442293768801,"score_gpt":0.2560121948938667,"score_spread":0.24238275260009787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526144783","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.012406171,0.0022906056,0.97947454,0.00059848005,0.00008777907,0.000037796475,0.000060673916,0.00022315077,0.0048207077],"genre_scores_gemma":[0.7597335,0.0037597888,0.22717743,0.00024481124,0.00038796445,0.00034529643,0.00026910548,0.000109429144,0.00797262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986945,0.00068103115,0.000054123633,0.00021828408,0.00024303209,0.00010904971],"domain_scores_gemma":[0.99268687,0.006604554,0.00025735347,0.00014270443,0.00017661754,0.00013197663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025938891,0.0009912386,0.0013505599,0.0006403939,0.0006429615,0.0017721824,0.0015465682,0.001736069,0.002260913],"category_scores_gemma":[0.007850461,0.00089997967,0.00086298556,0.0010832234,0.0021856169,0.002603168,0.0017043639,0.0027397652,0.0003081673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011321729,0.00007334983,0.0005651047,0.00020241647,0.00006461769,0.00012780084,0.0001935875,0.7504304,0.00054686284,0.20791933,0.0012986592,0.038464703],"study_design_scores_gemma":[0.000022107055,0.00001889343,0.000046080157,0.000014388641,0.0000076007213,0.000010498072,0.000010542497,0.88200754,0.00017657458,0.11691499,0.0007650074,0.0000057547845],"about_ca_topic_score_codex":0.003932287,"about_ca_topic_score_gemma":0.0030797045,"teacher_disagreement_score":0.003932287,"about_ca_system_score_codex":0.0015278471,"about_ca_system_score_gemma":0.0011717555,"threshold_uncertainty_score":0.013717949},"labels":[],"label_agreement":null},{"id":"W1526157805","doi":"10.1007/11424918_14","title":"A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"DBSCAN; Computer science; Cluster analysis; Data mining; Spatial analysis; Algorithm; Artificial intelligence; CURE data clustering algorithm; Correlation clustering; Pattern recognition (psychology); Machine learning; Mathematics; Statistics","score_opus":0.038952807120862576,"score_gpt":0.3084190218575835,"score_spread":0.26946621473672094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526157805","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.56072927,0.017401768,0.40421954,0.0025582856,0.0006357015,0.00073201704,0.0021375136,0.0033955302,0.008190322],"genre_scores_gemma":[0.58909696,0.00405245,0.39874846,0.0002499509,0.00019852063,0.0002878509,0.0043415744,0.0003681722,0.0026559778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898929,0.004331544,0.0007257991,0.000987129,0.0036815805,0.00038089987],"domain_scores_gemma":[0.91555053,0.0671279,0.001574675,0.0047687213,0.010284101,0.00069399935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01508126,0.001355303,0.0021769218,0.00698055,0.0022045046,0.004018028,0.0038792843,0.0028226585,0.0018654055],"category_scores_gemma":[0.05653102,0.00073470135,0.001855498,0.009371974,0.0013372035,0.00671069,0.0025937892,0.0011310988,0.0006575164],"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.0060340683,0.0010261305,0.037407838,0.0019241782,0.0020999685,0.00014614628,0.0017270155,0.25130013,0.003513557,0.018676165,0.0123294275,0.6638153],"study_design_scores_gemma":[0.0003653391,0.0007350352,0.020188626,0.00013806128,0.0005045665,0.00037312752,0.0019427445,0.9565544,0.0039158943,0.01115719,0.00398255,0.00014256124],"about_ca_topic_score_codex":0.024912085,"about_ca_topic_score_gemma":0.0285912,"teacher_disagreement_score":0.024912085,"about_ca_system_score_codex":0.0038375098,"about_ca_system_score_gemma":0.0025804355,"threshold_uncertainty_score":0.07975829},"labels":[],"label_agreement":null},{"id":"W1526167907","doi":"10.1007/978-3-540-24586-5_64","title":"A New Approach That Selects a Single Hyperplane from the Optimal Pairwise Linear Classifier","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Pairwise comparison; Hyperplane; Classifier (UML); Quadratic classifier; Pattern recognition (psychology); Artificial intelligence; Margin classifier; Linear classifier; Computer science; Machine learning; Quadratic equation; Mathematics; Combinatorics","score_opus":0.039264540055579354,"score_gpt":0.2319581402843241,"score_spread":0.19269360022874474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526167907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036444378,0.0002437316,0.9926636,0.00011776753,0.00018379677,0.000082709725,0.00006239978,0.0012726544,0.0017288319],"genre_scores_gemma":[0.041354578,0.00024375049,0.9450103,0.00028572616,0.000262733,0.0002325045,0.00064160774,0.00048975286,0.011479065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980124,0.00022513278,0.000090092406,0.00064700557,0.00090412726,0.000121307414],"domain_scores_gemma":[0.99880517,0.0001934248,0.00007081548,0.00021839677,0.0006381299,0.00007414727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014111209,0.0019934836,0.0026379481,0.001896725,0.0010475098,0.0018988703,0.003545159,0.0019936524,0.0066526458],"category_scores_gemma":[0.0022274759,0.00079017505,0.001632642,0.0021840285,0.00072049047,0.0023632352,0.0025584179,0.0020859307,0.0051926407],"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.00014976665,0.00025247096,0.00061685464,0.000111828354,0.00016245469,0.00004614627,0.00005984433,0.014366209,0.01927863,0.0057851085,0.016171938,0.9429987],"study_design_scores_gemma":[0.00009144299,0.00028656432,0.001304706,0.00003299299,0.000178555,0.00045768748,0.000075645185,0.9398992,0.020569678,0.013178559,0.023841206,0.000083751715],"about_ca_topic_score_codex":0.0027452712,"about_ca_topic_score_gemma":0.005189075,"teacher_disagreement_score":0.0066526458,"about_ca_system_score_codex":0.00064476376,"about_ca_system_score_gemma":0.0012595184,"threshold_uncertainty_score":0.022255361},"labels":[],"label_agreement":null},{"id":"W1526183512","doi":"10.1007/978-3-540-32260-3_9","title":"Inter-agent Communication in IMAGO Prolog","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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 Guelph","funders":"","keywords":"Prolog; Computer science; Unification; Syntax; Programming language; Intelligent agent; Task (project management); Semantics (computer science); Logic programming; Artificial intelligence; Engineering","score_opus":0.01603517239702582,"score_gpt":0.24412245059165585,"score_spread":0.22808727819463004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526183512","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.017694686,0.00055285945,0.85368824,0.0012214141,0.0002907877,0.00023506614,0.0010280112,0.0074916864,0.11779723],"genre_scores_gemma":[0.27652213,0.0007727905,0.6574031,0.00058498076,0.00009659936,0.0003681521,0.0023263735,0.003458751,0.058467064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991798,0.00036392006,0.000059713373,0.000103482125,0.00017536514,0.0001177894],"domain_scores_gemma":[0.9992055,0.000469065,0.00005197417,0.00013311098,0.00009494776,0.000045455276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995702,0.0005406667,0.000352726,0.0005068545,0.0009373477,0.0025851019,0.0009471889,0.0006246051,0.016944896],"category_scores_gemma":[0.0028425853,0.00054180215,0.00050001213,0.00047955083,0.0009285167,0.00283617,0.0018458581,0.0012996242,0.003993194],"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.0004938946,0.0001916224,0.0008460753,0.00063151773,0.000036746296,0.00049054675,0.0016079033,0.021530667,0.003959869,0.61157024,0.045669142,0.3129718],"study_design_scores_gemma":[0.00016708302,0.00008316612,0.00032319632,0.0002989026,0.000061256564,0.00056626543,0.00070964557,0.10083146,0.013422122,0.36640617,0.51707524,0.000055500524],"about_ca_topic_score_codex":0.0023658539,"about_ca_topic_score_gemma":0.0035441571,"teacher_disagreement_score":0.016944896,"about_ca_system_score_codex":0.00073235855,"about_ca_system_score_gemma":0.0012160091,"threshold_uncertainty_score":0.056686282},"labels":[],"label_agreement":null},{"id":"W1526184744","doi":"10.1007/3-540-44583-8_25","title":"Uses, Improvements, and Extensions of Prolog+CG: Case Studies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Prolog; Computer science; Programming language; Logic programming; Java; Expressive power; Object-oriented programming; Object (grammar); Horn clause; Software engineering; Artificial intelligence","score_opus":0.03132705726177794,"score_gpt":0.2780674808548078,"score_spread":0.2467404235930299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526184744","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.90966254,0.014460345,0.011504355,0.002227772,0.000052477088,0.0002916268,0.0003457752,0.00018025078,0.061274827],"genre_scores_gemma":[0.9694351,0.0050633484,0.021242913,0.00018426737,0.00003878592,0.00009909793,0.00018467553,0.000114097784,0.0036376284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99021673,0.0067620506,0.00040278723,0.000309475,0.0016965958,0.00061236095],"domain_scores_gemma":[0.9485741,0.04248886,0.0020347235,0.004289583,0.0019898177,0.0006229021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010156941,0.00056631403,0.0004567106,0.0023431412,0.001261619,0.0024301151,0.0020158188,0.001899512,0.0024300064],"category_scores_gemma":[0.033409767,0.00044790385,0.0005205257,0.0045570545,0.0028430545,0.0058355746,0.0022278395,0.0017610422,0.00047792195],"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.006320928,0.005650753,0.04422465,0.0022546842,0.0001295572,0.006859137,0.026637092,0.00776097,0.003958489,0.06251259,0.009855736,0.82383555],"study_design_scores_gemma":[0.002075435,0.015898526,0.1475078,0.004603423,0.0021320195,0.05809142,0.11025577,0.07497605,0.056428026,0.16227391,0.36526862,0.00048897986],"about_ca_topic_score_codex":0.004545844,"about_ca_topic_score_gemma":0.008105092,"teacher_disagreement_score":0.010156941,"about_ca_system_score_codex":0.0013092863,"about_ca_system_score_gemma":0.0008279928,"threshold_uncertainty_score":0.053715706},"labels":[],"label_agreement":null},{"id":"W1526233185","doi":"10.1007/11813040_24","title":"Formal Modeling of Communication Protocols by Graph Transformation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph rewriting; Theoretical computer science; Communications protocol; Graph; Semantics (computer science); Formalism (music); Distributed computing; Operational semantics; Protocol (science); Transformation (genetics); Programming language; Computer network","score_opus":0.017023808746668766,"score_gpt":0.2515804970817315,"score_spread":0.23455668833506277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526233185","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.0022235597,0.000070682334,0.9938393,0.00011115788,0.00002835725,0.00006654756,0.000072935,0.0007479207,0.0028395816],"genre_scores_gemma":[0.23841745,0.00091335946,0.74952036,0.00021020212,0.000107800675,0.0007173246,0.0006887893,0.0008851908,0.008539488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800605,0.0007910503,0.00014253138,0.00030008424,0.00058395066,0.00017640673],"domain_scores_gemma":[0.99780864,0.0011830643,0.00017815667,0.0005042633,0.0002653023,0.000060613773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016177855,0.001042104,0.00072549854,0.0011397375,0.00084220927,0.0024878061,0.002491098,0.0012784153,0.00470044],"category_scores_gemma":[0.0036605527,0.00075281743,0.0017436735,0.0014442592,0.0024738337,0.0037579387,0.0015578787,0.0032033494,0.0014138893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056745506,0.000067787936,0.00013857374,0.00014281282,0.000028228642,0.00015693015,0.000304071,0.09034472,0.0038949903,0.8758921,0.0015792667,0.027393837],"study_design_scores_gemma":[0.000053929904,0.000034333985,0.000055984932,0.000047514342,0.000048377326,0.00012543003,0.00006018531,0.36890912,0.006292434,0.60825586,0.016091868,0.000024929079],"about_ca_topic_score_codex":0.0030671558,"about_ca_topic_score_gemma":0.0023390618,"teacher_disagreement_score":0.00470044,"about_ca_system_score_codex":0.0011830904,"about_ca_system_score_gemma":0.0018818552,"threshold_uncertainty_score":0.0157246},"labels":[],"label_agreement":null},{"id":"W1526241488","doi":"10.1007/978-3-540-70844-5_2","title":"Language Decompositions, Primality, and Trajectory-Based Operations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Primality test; Catenation; Computer science; Theoretical computer science; Programming language; Arithmetic; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.011695224623256516,"score_gpt":0.24572345660833153,"score_spread":0.23402823198507502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526241488","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.04271756,0.001663602,0.88627183,0.0011139892,0.00033934208,0.000067357156,0.00026771432,0.00053073803,0.06702782],"genre_scores_gemma":[0.62322557,0.0021221961,0.32986036,0.00034834028,0.00044778397,0.00027968985,0.0006390489,0.0006074198,0.042469576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990208,0.00028187095,0.00009056905,0.00025580073,0.00017973782,0.00017125334],"domain_scores_gemma":[0.998448,0.00060592574,0.00014964967,0.00036597886,0.00025219558,0.00017817429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935739,0.00064596406,0.00066585874,0.0011720479,0.0013034795,0.0034229397,0.00095376297,0.00093036797,0.008714699],"category_scores_gemma":[0.0030468134,0.0005699701,0.001428686,0.0011645311,0.003987978,0.008337339,0.0031670218,0.003402179,0.0017136004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025024094,0.000006687346,0.0000349936,0.000021645625,0.0000025479267,0.000020639356,0.00013557797,0.00068064494,0.000524838,0.9900282,0.00047146247,0.008047655],"study_design_scores_gemma":[0.0000056122494,0.000011999591,0.000028144865,0.000014045168,0.000005582777,0.000060054976,0.000064889595,0.0037088813,0.0006623506,0.99141496,0.004017174,0.0000061620453],"about_ca_topic_score_codex":0.00039135283,"about_ca_topic_score_gemma":0.000340253,"teacher_disagreement_score":0.008714699,"about_ca_system_score_codex":0.0011667773,"about_ca_system_score_gemma":0.00068650045,"threshold_uncertainty_score":0.029153585},"labels":[],"label_agreement":null},{"id":"W1526277049","doi":"10.1007/978-3-642-03658-3_33","title":"Chucking: A One-Handed Document Sharing Technique","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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 Manitoba","funders":"","keywords":"Stylus; Computer science; Mobile device; Suite; Gesture; Human–computer interaction; Task (project management); Artificial intelligence; Computer vision; World Wide Web; Engineering; Geography","score_opus":0.019283896560859923,"score_gpt":0.2681673429715544,"score_spread":0.2488834464106945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526277049","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.0492898,0.0006182102,0.9250834,0.00013271642,0.00023204352,0.0002686379,0.0001333073,0.007969956,0.01627188],"genre_scores_gemma":[0.3072597,0.00060655945,0.64546907,0.00012918425,0.00012009425,0.0003117201,0.0004284701,0.0024243945,0.043250833],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857605,0.00027499165,0.0000610437,0.000268997,0.0006328057,0.00018602164],"domain_scores_gemma":[0.9970277,0.0011283464,0.0001397436,0.0010367272,0.00042130591,0.00024610464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090362586,0.00089911476,0.00097379653,0.0011918781,0.001452275,0.0015097441,0.0026998778,0.0012934684,0.017429372],"category_scores_gemma":[0.0031012103,0.0006729971,0.00055514864,0.0016039083,0.0009391301,0.0032153805,0.003502703,0.0012960352,0.003208727],"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.0008820667,0.00028435877,0.0005507045,0.00043399562,0.000057220448,0.0005331801,0.0033574328,0.0024189844,0.2374024,0.0155219585,0.011206362,0.72735137],"study_design_scores_gemma":[0.00028317905,0.0013948588,0.004020744,0.00028475572,0.000317578,0.0068607447,0.0027095103,0.16029228,0.6482606,0.021850487,0.15326732,0.0004579746],"about_ca_topic_score_codex":0.0012209534,"about_ca_topic_score_gemma":0.00182342,"teacher_disagreement_score":0.017429372,"about_ca_system_score_codex":0.00037251975,"about_ca_system_score_gemma":0.0007600953,"threshold_uncertainty_score":0.05830711},"labels":[],"label_agreement":null},{"id":"W1526355553","doi":"10.1007/3-540-47922-8_17","title":"A Structural Characterization of DAG-Isomorphic Dependency Models","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Directed acyclic graph; Axiom; Characterization (materials science); Set (abstract data type); Computer science; Probabilistic logic; Representation (politics); Undirected graph; Discrete mathematics; Dependency (UML); Functional dependency; Directed graph; Theoretical computer science; Mathematics; Combinatorics; Algorithm; Graph; Artificial intelligence; Data mining; Relational database","score_opus":0.036820985307746655,"score_gpt":0.23666008794248755,"score_spread":0.1998391026347409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526355553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049523704,0.00048411492,0.92392856,0.0015285851,0.000060091188,0.0001908485,0.001999917,0.0010574749,0.02122662],"genre_scores_gemma":[0.66723555,0.0012483748,0.31026685,0.00092577253,0.00040665656,0.0006859657,0.006244035,0.0008163131,0.012170448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975151,0.00075906503,0.00020778835,0.00074320135,0.00048530803,0.00028958233],"domain_scores_gemma":[0.98361915,0.010156615,0.0014188963,0.0030285162,0.0011861242,0.0005906826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021680892,0.0009870356,0.0012296652,0.0033956135,0.001849357,0.0036045928,0.003377619,0.002340256,0.011593843],"category_scores_gemma":[0.020249221,0.0017293452,0.0027891186,0.005803971,0.0022261962,0.009955233,0.0035236413,0.0036184865,0.0013958878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005653381,0.00009506354,0.001208549,0.00011201586,0.00004790107,0.00019748579,0.00059321924,0.016826898,0.0007789068,0.9546094,0.003188828,0.022285366],"study_design_scores_gemma":[0.000010471231,0.000009508984,0.0001528695,0.000015904243,0.000031391217,0.00012251412,0.00005185205,0.04628587,0.00022349204,0.9506597,0.0024243598,0.000012141454],"about_ca_topic_score_codex":0.003949376,"about_ca_topic_score_gemma":0.0046868534,"teacher_disagreement_score":0.011593843,"about_ca_system_score_codex":0.0019418346,"about_ca_system_score_gemma":0.0020976018,"threshold_uncertainty_score":0.03878528},"labels":[],"label_agreement":null},{"id":"W1526358376","doi":"10.1007/11559573_24","title":"Scalable e-Learning Multimedia Adaptation Architecture","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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 Toronto","funders":"","keywords":"Transcoding; Computer science; Multimedia; Scalability; Adaptation (eye); Bitstream; Computer architecture; Overhead (engineering); Architecture; Modality (human–computer interaction); Content adaptation; Encoding (memory); Human–computer interaction; Computer network; Decoding methods; Artificial intelligence; Telecommunications; Ubiquitous computing; Operating system","score_opus":0.025050153731134107,"score_gpt":0.2860627976483944,"score_spread":0.26101264391726026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526358376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028390497,0.00051060773,0.96019465,0.00017228947,0.00014254518,0.00008074313,0.000107177715,0.005478421,0.004923149],"genre_scores_gemma":[0.6411082,0.0005976391,0.33931136,0.00034399744,0.00019338567,0.00021284215,0.0006032802,0.0002500373,0.017379288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984574,0.000019695975,0.000007816069,0.00004847689,0.000051443392,0.000026744383],"domain_scores_gemma":[0.9997874,0.000049839295,0.000008334631,0.00005064071,0.00008675159,0.000017070608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034896153,0.00046867508,0.0004916007,0.00032382988,0.0002677921,0.00046435423,0.0014476452,0.0006305216,0.0055676196],"category_scores_gemma":[0.0007234194,0.00020070923,0.00030697387,0.00053687044,0.00021827246,0.0008722134,0.0008406619,0.0007791448,0.001443147],"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.00038630603,0.00036189487,0.0007049034,0.00007213723,0.000080036494,0.00012762453,0.0000406447,0.12429216,0.078763865,0.0049389717,0.010259655,0.7799718],"study_design_scores_gemma":[0.000024454204,0.0000559376,0.0005279572,0.000004789821,0.000021358526,0.000074374606,0.000010502848,0.9751981,0.0184275,0.003001642,0.0026440092,0.00000939591],"about_ca_topic_score_codex":0.0033965607,"about_ca_topic_score_gemma":0.004418051,"teacher_disagreement_score":0.0055676196,"about_ca_system_score_codex":0.00042219306,"about_ca_system_score_gemma":0.0003878677,"threshold_uncertainty_score":0.018625498},"labels":[],"label_agreement":null},{"id":"W1526377340","doi":"10.1007/978-3-540-76856-2_78","title":"Video Segmentation for Markerless Motion Capture in Unconstrained Environments","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Ottawa","funders":"","keywords":"Artificial intelligence; Segmentation; Computer vision; Computer science; Motion capture; Cluster analysis; Process (computing); Context (archaeology); Motion (physics); Tracking (education); Parametric statistics; Geography; Mathematics","score_opus":0.019901767010867735,"score_gpt":0.2780898151969188,"score_spread":0.25818804818605107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526377340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008217584,0.00038875485,0.98766136,0.000031778683,0.000041813826,0.00004443882,0.00018900687,0.0015325875,0.001892713],"genre_scores_gemma":[0.1507608,0.00092853856,0.83884484,0.00009526881,0.00006553246,0.00010133656,0.0011074699,0.000650548,0.007445714],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997539,0.000028808505,0.000009305838,0.00007681557,0.00009578935,0.00003539454],"domain_scores_gemma":[0.99974185,0.00009633217,0.000023947483,0.00005418251,0.00006553134,0.000018077371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020970048,0.0007582096,0.0006652587,0.00082838966,0.0003585732,0.00083176116,0.00094975537,0.0007898223,0.004587338],"category_scores_gemma":[0.00088493933,0.00063261815,0.000363061,0.00090621813,0.0002746319,0.00081492984,0.0006350738,0.00054088293,0.0017862857],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039318606,0.00007041045,0.00041199825,0.00024295511,0.000044583507,0.00015650709,0.00013056792,0.027184447,0.32145506,0.0049597574,0.006483173,0.6384674],"study_design_scores_gemma":[0.000028601948,0.00014159808,0.002433036,0.000063235384,0.000038320675,0.0006542828,0.00007168085,0.73217154,0.24123411,0.005945145,0.017174436,0.000043983],"about_ca_topic_score_codex":0.0029795056,"about_ca_topic_score_gemma":0.0050386107,"teacher_disagreement_score":0.004587338,"about_ca_system_score_codex":0.0004250035,"about_ca_system_score_gemma":0.00048126807,"threshold_uncertainty_score":0.015346229},"labels":[],"label_agreement":null},{"id":"W1526439378","doi":"10.1007/11610113_20","title":"TWStream: Finding Correlated Data Streams Under Time Warping","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Smoothing; Dynamic time warping; Lag; Scale (ratio); Image warping; Piecewise; Data stream mining; Algorithm; Data mining; Artificial intelligence; Mathematics; Computer vision","score_opus":0.03309132694084672,"score_gpt":0.25210398572528087,"score_spread":0.21901265878443416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526439378","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.01796678,0.0004650299,0.96957415,0.00016857067,0.0002153288,0.00014637463,0.00069513824,0.010274139,0.00049444474],"genre_scores_gemma":[0.14017431,0.0006352466,0.8492611,0.00018510068,0.0003687739,0.00033062624,0.004276176,0.0011719202,0.0035967552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988593,0.00022804269,0.00010630021,0.00025492487,0.0004427968,0.00010858158],"domain_scores_gemma":[0.99686074,0.00195599,0.00016939244,0.00052070717,0.00034121954,0.00015201584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024215886,0.0021231389,0.0022192535,0.0029822616,0.00065985514,0.002230991,0.0023021498,0.0019481231,0.0044634277],"category_scores_gemma":[0.010546394,0.001266977,0.0015209175,0.0038274475,0.00075041945,0.0039202943,0.0033465596,0.0018367174,0.0022087544],"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.0011556536,0.00037308995,0.0055075265,0.0003968364,0.00037942,0.0007423173,0.00023509201,0.09695757,0.013034792,0.007973017,0.026991637,0.8462531],"study_design_scores_gemma":[0.00007581757,0.00008969235,0.0005541605,0.00001362996,0.00003967409,0.00016650342,0.000053558873,0.977468,0.0036835833,0.015389259,0.002446806,0.000019394965],"about_ca_topic_score_codex":0.0019819916,"about_ca_topic_score_gemma":0.001810448,"teacher_disagreement_score":0.0044634277,"about_ca_system_score_codex":0.00030997506,"about_ca_system_score_gemma":0.0010359919,"threshold_uncertainty_score":0.014931679},"labels":[],"label_agreement":null},{"id":"W1526447489","doi":"10.1007/978-3-540-31980-1_6","title":"Empirically Efficient Verification for a Class of Infinite-State Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Petri net; Computer science; Parameterized complexity; Reachability; Decidability; Theoretical computer science; Model checking; Stochastic Petri net; Reduction (mathematics); Class (philosophy); Algorithm; Mathematics; Artificial intelligence","score_opus":0.034895877075869025,"score_gpt":0.29580465922407373,"score_spread":0.2609087821482047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526447489","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.21135804,0.00035766195,0.7739404,0.001079507,0.000048411304,0.00020748703,0.00037903766,0.0016992838,0.010930281],"genre_scores_gemma":[0.88311774,0.00014885118,0.11318681,0.00008843261,0.000053093554,0.00018297417,0.0004502192,0.00019759749,0.0025742697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624485,0.0010012342,0.00024122196,0.00072693767,0.0012980395,0.0004876346],"domain_scores_gemma":[0.94148976,0.04706747,0.0020768808,0.0071675763,0.0014769824,0.00072127196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040264707,0.0009874363,0.0016551426,0.0013928157,0.0015598692,0.003143834,0.002371648,0.0017585277,0.0050329748],"category_scores_gemma":[0.044277076,0.0010419546,0.0015854691,0.001088724,0.004395699,0.00627381,0.0035591573,0.003935585,0.0003897599],"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.00058991584,0.00021520672,0.003998539,0.00026743536,0.000113253576,0.00029247295,0.00045972053,0.1383274,0.008792688,0.78927547,0.0020055398,0.05566244],"study_design_scores_gemma":[0.00007339541,0.00005109879,0.00059078814,0.000020530522,0.000030868618,0.00009017412,0.000045754667,0.35374266,0.0034942622,0.6408076,0.0010336193,0.000019258043],"about_ca_topic_score_codex":0.0011883813,"about_ca_topic_score_gemma":0.0019786318,"teacher_disagreement_score":0.0050329748,"about_ca_system_score_codex":0.0021908444,"about_ca_system_score_gemma":0.0024367212,"threshold_uncertainty_score":0.021294296},"labels":[],"label_agreement":null},{"id":"W1526447634","doi":"10.1007/11914952_49","title":"A Novel Object Pool Service for Distributed Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Regina","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; Distributed object; Distributed computing; Middleware (distributed applications); Scalability; Workload; Object (grammar); Granularity; Service (business); Object request broker; Interoperable Object Reference; Operating system; Software engineering","score_opus":0.020066251258443676,"score_gpt":0.24080485980778152,"score_spread":0.22073860854933786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526447634","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.011173674,0.00081190764,0.96206695,0.00067981874,0.00059643266,0.00027168097,0.00022440321,0.015725221,0.00844979],"genre_scores_gemma":[0.206813,0.0012976783,0.7412702,0.00093747367,0.0009882168,0.00097371923,0.0013293712,0.0038847313,0.042505626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981042,0.000405417,0.0001487826,0.00023079594,0.0008273204,0.00028358703],"domain_scores_gemma":[0.9974105,0.00050100737,0.000115389106,0.0012858242,0.00033096396,0.000356297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025367746,0.00087750127,0.0016985274,0.0010167322,0.002141334,0.0039990777,0.004910499,0.0019135488,0.012338656],"category_scores_gemma":[0.00483657,0.0008057281,0.001004455,0.0023746204,0.0015529173,0.0076992526,0.0060735918,0.0027555646,0.005315167],"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.002352607,0.0005640407,0.0012503995,0.0007524509,0.00015509609,0.0006639283,0.0010078258,0.013640852,0.03630583,0.37939087,0.089240246,0.47467583],"study_design_scores_gemma":[0.00077744125,0.00064920395,0.00076746393,0.00013458036,0.00032010005,0.0011310824,0.00027554433,0.37444827,0.035369728,0.24905835,0.33687547,0.00019285578],"about_ca_topic_score_codex":0.0021235966,"about_ca_topic_score_gemma":0.001759148,"teacher_disagreement_score":0.012338656,"about_ca_system_score_codex":0.0012271351,"about_ca_system_score_gemma":0.0023802968,"threshold_uncertainty_score":0.04127693},"labels":[],"label_agreement":null},{"id":"W1526495669","doi":"10.1007/3-540-45307-5_15","title":"Shared Virtual Memory Clusters with Next-Generation Interconnection Networks and Wide Compute Nodes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Toronto","funders":"","keywords":"Computer science; Shared memory; Distributed shared memory; Synchronization (alternating current); Cache coherence; Interconnection; Distributed computing; Abstraction; Node (physics); Key (lock); Cache; Software; Computer architecture; Embedded system; Computer network; Parallel computing; CPU cache; Uniform memory access; Overlay; Memory management; Operating system; Cache algorithms","score_opus":0.024391213788908076,"score_gpt":0.2328951185804879,"score_spread":0.20850390479157982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526495669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096111156,0.040731672,0.6688386,0.0033749745,0.0051881173,0.00016734912,0.00032776245,0.004986752,0.18027355],"genre_scores_gemma":[0.5644502,0.014754966,0.29037794,0.00057360716,0.0016226857,0.00019091877,0.0009786173,0.00047190656,0.12657915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978167,0.00005466894,0.000011553615,0.000038625814,0.000076344244,0.00003704201],"domain_scores_gemma":[0.9996779,0.00007540776,0.000019423302,0.00011318028,0.00007534731,0.000038749014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003362906,0.0004693403,0.0003823779,0.00032156776,0.000586882,0.0016417197,0.0014387723,0.0006485735,0.0061252564],"category_scores_gemma":[0.0008376421,0.00039356246,0.00035739917,0.0010393353,0.00055684417,0.0028648817,0.0013948007,0.0008808475,0.0013096055],"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.0003315259,0.000099152065,0.0012966,0.00066297245,0.00012828954,0.00036276618,0.0002952741,0.08092132,0.018277593,0.3695162,0.08684361,0.44126466],"study_design_scores_gemma":[0.00006297162,0.00032598866,0.0013794978,0.0001455944,0.00011720448,0.0010683691,0.0001951011,0.21550499,0.01327456,0.3017472,0.46611705,0.00006137168],"about_ca_topic_score_codex":0.00057673076,"about_ca_topic_score_gemma":0.0013413095,"teacher_disagreement_score":0.0061252564,"about_ca_system_score_codex":0.00045097328,"about_ca_system_score_gemma":0.00051885634,"threshold_uncertainty_score":0.020491004},"labels":[],"label_agreement":null},{"id":"W1526543055","doi":"10.1007/978-3-540-70816-2_8","title":"Pattern-Based UI Design: Adding Rigor with User and Context Variables","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Persona Design and Applications","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":"Concordia University","funders":"","keywords":"User interface design; Computer science; Leverage (statistics); User interface; Human–computer interaction; User experience design; Context (archaeology); Process (computing); Design process; Software engineering; Programming language; Engineering; Work in process; Artificial intelligence","score_opus":0.034084969524327456,"score_gpt":0.24896966238746915,"score_spread":0.21488469286314169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526543055","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.0029024468,0.000108170185,0.9924495,0.00012599342,0.000040708444,0.000088258814,0.000029093513,0.0022595434,0.0019962548],"genre_scores_gemma":[0.095515564,0.00021605067,0.8964995,0.00020015694,0.000034924018,0.00034430728,0.00016098974,0.0016095099,0.005419078],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958139,0.0016354511,0.00044486325,0.0005743035,0.0013451821,0.00018627684],"domain_scores_gemma":[0.9941122,0.002517873,0.00027908015,0.0018873389,0.00095839024,0.00024511974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045561357,0.0014103766,0.0011354781,0.0009483646,0.0006686466,0.002768279,0.0028867687,0.0015101461,0.008118763],"category_scores_gemma":[0.017014936,0.0014278779,0.0012228569,0.00069600774,0.0015507614,0.004841183,0.0040040873,0.0025086948,0.0020014704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046667148,0.00029289714,0.0031211642,0.0011060376,0.00018302676,0.00037042832,0.00444068,0.019380735,0.04370174,0.13713649,0.012126121,0.77767396],"study_design_scores_gemma":[0.00041808793,0.0007938108,0.002501831,0.0010461689,0.0006197556,0.0014722247,0.0011040202,0.5211669,0.06412155,0.23855616,0.16792068,0.00027885134],"about_ca_topic_score_codex":0.0014008918,"about_ca_topic_score_gemma":0.0020761369,"teacher_disagreement_score":0.008118763,"about_ca_system_score_codex":0.0004959712,"about_ca_system_score_gemma":0.0011059147,"threshold_uncertainty_score":0.02715993},"labels":[],"label_agreement":null},{"id":"W1526576188","doi":"10.1007/978-3-540-31797-5_22","title":"Managed Architecture of Existing Code as a Practical Transition Towards MDA","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"Zymeworks (Canada)","funders":"","keywords":"Code refactoring; Architecture; Computer science; Container (type theory); Abstraction; Code (set theory); Software engineering; Programming language; Engineering","score_opus":0.0394487252914162,"score_gpt":0.314096621160483,"score_spread":0.2746478958690668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526576188","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.08346361,0.00009819711,0.88224196,0.0010051357,0.00008412118,0.00018990511,0.00006952905,0.00852184,0.02432569],"genre_scores_gemma":[0.48942256,0.00012012664,0.49329796,0.00019338375,0.000024640382,0.00015666451,0.00023104755,0.0013975933,0.015156015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841857,0.0006256514,0.00009739934,0.00017958338,0.0005491443,0.0001296901],"domain_scores_gemma":[0.9958262,0.001004036,0.0001237653,0.0024511104,0.0004030961,0.0001916419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002749869,0.0002450459,0.00023427336,0.00067848037,0.0006100516,0.0030859415,0.0015475316,0.0011005219,0.0049378285],"category_scores_gemma":[0.006277165,0.00052147196,0.0005265433,0.00043532817,0.0011492426,0.004146775,0.002942039,0.0020429087,0.0009918351],"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.00026712264,0.00035865908,0.0027498584,0.0002449486,0.00006632761,0.0011846324,0.008591682,0.017529754,0.061636936,0.55029863,0.008013817,0.3490577],"study_design_scores_gemma":[0.00015562115,0.0006096212,0.0030733664,0.00043086187,0.00022377328,0.0017828235,0.0018301148,0.35313043,0.08407258,0.33179197,0.22277294,0.00012587126],"about_ca_topic_score_codex":0.0008543566,"about_ca_topic_score_gemma":0.001525888,"teacher_disagreement_score":0.0049378285,"about_ca_system_score_codex":0.00069081364,"about_ca_system_score_gemma":0.0013292498,"threshold_uncertainty_score":0.016518652},"labels":[],"label_agreement":null},{"id":"W1526615347","doi":"10.1007/978-3-540-88030-1_20","title":"Automating Architecture Trade-Off Decision Making through a Complex Multi-attribute Decision Process","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Architecture; Software architecture; Process (computing); Quality (philosophy); Task (project management); Software engineering; Context (archaeology); Process management; Software; Systems engineering; Engineering; Programming language","score_opus":0.06623488407864711,"score_gpt":0.34006301943135525,"score_spread":0.2738281353527081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526615347","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.05482139,0.00010933203,0.94275475,0.00014557704,0.000016327995,0.00013979567,0.000044150762,0.00037118778,0.0015975052],"genre_scores_gemma":[0.42178833,0.00013040008,0.57662964,0.00006194733,0.000021860853,0.0001883628,0.00011487196,0.000064410604,0.0010002094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966834,0.0014814573,0.00021370828,0.000526029,0.0008506912,0.0002446227],"domain_scores_gemma":[0.9914671,0.0070211026,0.00039609158,0.000323589,0.0005298141,0.0002622626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058120387,0.0012932412,0.0018663264,0.001423275,0.001096613,0.0035878103,0.0016808754,0.0016495137,0.0041343747],"category_scores_gemma":[0.009089121,0.0008093798,0.0017434309,0.0014439779,0.00090165035,0.0034725412,0.0022567497,0.0020577062,0.0005210211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041024797,0.00043595931,0.0025974964,0.0002997991,0.00022162856,0.00026318806,0.0006208529,0.7544102,0.009726521,0.017178373,0.0009922943,0.21284334],"study_design_scores_gemma":[0.000016257822,0.00007772878,0.00026872993,0.000017407798,0.000038691815,0.000027605838,0.00004804485,0.9862661,0.00136059,0.011513399,0.00034741862,0.00001809679],"about_ca_topic_score_codex":0.002993586,"about_ca_topic_score_gemma":0.003598672,"teacher_disagreement_score":0.0058120387,"about_ca_system_score_codex":0.0014770117,"about_ca_system_score_gemma":0.0023427454,"threshold_uncertainty_score":0.03073734},"labels":[],"label_agreement":null},{"id":"W1526626851","doi":"10.1007/978-3-540-69858-6_31","title":"A General Architecture for Connecting NLP Frameworks and Desktop Clients Using Web Services","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; World Wide Web; Architecture; Web service; Semantic Web; Service (business); Social Semantic Web; Semantic Web Stack; Information retrieval","score_opus":0.024976158840167465,"score_gpt":0.2690918465905173,"score_spread":0.24411568775034986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526626851","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.0034992045,0.0002143728,0.95953596,0.00052668556,0.00013368353,0.00055932516,0.00032883036,0.026144437,0.009057517],"genre_scores_gemma":[0.048257213,0.00094123837,0.9027918,0.0005982527,0.00011063808,0.00093747716,0.0023754574,0.0036860146,0.04030191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982679,0.00022395274,0.00025302617,0.00031843886,0.0006821947,0.00025439396],"domain_scores_gemma":[0.99863654,0.00021708627,0.000045693614,0.0005394771,0.00034730672,0.00021392663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027825625,0.0009504402,0.001499193,0.002261113,0.0029067446,0.008270777,0.0051342184,0.0038745832,0.019672105],"category_scores_gemma":[0.0032870392,0.0023059072,0.0023973112,0.0037879343,0.0020039426,0.008589914,0.0056185042,0.0046590706,0.008805264],"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.0005437909,0.00067162275,0.001957554,0.0009815528,0.00032458868,0.0014997275,0.002640958,0.027395826,0.047907654,0.50336206,0.08095879,0.3317559],"study_design_scores_gemma":[0.00024305121,0.0001881171,0.0014216078,0.00052172097,0.00037588508,0.0014145288,0.0006613436,0.2900432,0.045704205,0.2225046,0.43662468,0.0002970894],"about_ca_topic_score_codex":0.018754588,"about_ca_topic_score_gemma":0.017355347,"teacher_disagreement_score":0.019672105,"about_ca_system_score_codex":0.0023654972,"about_ca_system_score_gemma":0.0041668834,"threshold_uncertainty_score":0.06580973},"labels":[],"label_agreement":null},{"id":"W1526636590","doi":"10.1007/11861898_37","title":"Parameterless Isomap with Adaptive Neighborhood Selection","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Isomap; Nonlinear dimensionality reduction; Computer science; Geodesic; Curse of dimensionality; Dimensionality reduction; Artificial intelligence; Point (geometry); Selection (genetic algorithm); Multidimensional scaling; Manifold (fluid mechanics); Scaling; Algorithm; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.014447866518913605,"score_gpt":0.21955559115405707,"score_spread":0.20510772463514346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526636590","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.006568967,0.0001811007,0.99044025,0.00004087218,0.00005232988,0.000027138756,0.000040662773,0.0009834304,0.0016653502],"genre_scores_gemma":[0.1611323,0.00024442602,0.8312626,0.000100700716,0.00005936404,0.00014537582,0.00026041953,0.00048208295,0.00631277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00008945422,0.000020964084,0.00011517432,0.00023094132,0.00003403855],"domain_scores_gemma":[0.99949944,0.000104953106,0.0000263137,0.00021378622,0.00013025886,0.000025223237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004942356,0.00076038943,0.0011304672,0.0008720655,0.00035242486,0.0009173462,0.0022839394,0.00094037695,0.0034338096],"category_scores_gemma":[0.0018685352,0.0004905685,0.0005959456,0.0010494746,0.0005124979,0.0015880436,0.0019380195,0.0008284943,0.0016031082],"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.00026172624,0.00010272048,0.0003289928,0.000110693625,0.00005344913,0.00007016615,0.00008802032,0.07686183,0.022891745,0.014750595,0.007268221,0.8772118],"study_design_scores_gemma":[0.000029031818,0.00009471743,0.0003562079,0.000013377855,0.000022912418,0.0002611344,0.000024036477,0.9653208,0.013109306,0.015287756,0.0054515633,0.000029247021],"about_ca_topic_score_codex":0.00179658,"about_ca_topic_score_gemma":0.0019319517,"teacher_disagreement_score":0.0034338096,"about_ca_system_score_codex":0.00027042502,"about_ca_system_score_gemma":0.0004813966,"threshold_uncertainty_score":0.011487305},"labels":[],"label_agreement":null},{"id":"W1526676349","doi":"10.1007/978-3-540-39899-8_5","title":"Needle Steering and Model-Based Trajectory Planning","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":107,"is_retracted":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":"Jacobian matrix and determinant; Computer science; Deflection (physics); Obstacle avoidance; Motion planning; Trajectory; Simulation; Robot; Artificial intelligence; Mobile robot; Physics; Mathematics; Optics; Applied mathematics","score_opus":0.025692984699967444,"score_gpt":0.24671103901393288,"score_spread":0.22101805431396543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526676349","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.0013028749,0.00071763434,0.99282736,0.00005968492,0.000068672096,0.000017915245,0.000044647237,0.0004812408,0.0044799526],"genre_scores_gemma":[0.1942518,0.0034761368,0.77697074,0.00010118676,0.00011037146,0.00020437405,0.0004938714,0.00040435354,0.023987185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997017,0.000045685025,0.000012449063,0.00006695938,0.00015553311,0.000017734044],"domain_scores_gemma":[0.9998022,0.000081575155,0.000017778299,0.000045703735,0.00004270531,0.000010129403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028271385,0.0009516625,0.0009366768,0.0005540887,0.00036577863,0.0010315694,0.0012007538,0.0011327891,0.0055694864],"category_scores_gemma":[0.00108629,0.0009215127,0.0008862237,0.0012217282,0.00067087397,0.001402463,0.0010548629,0.0010118156,0.0017493764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000723591,0.000028861845,0.00019194119,0.00019460419,0.00003496012,0.00005920835,0.00006620259,0.6392018,0.006916228,0.06896103,0.005116809,0.27915597],"study_design_scores_gemma":[0.000006340181,0.00002464933,0.000076276396,0.000019984474,0.000008331769,0.000059051938,0.000007387919,0.9457233,0.002351644,0.042256247,0.009452083,0.0000147427545],"about_ca_topic_score_codex":0.004827531,"about_ca_topic_score_gemma":0.003624271,"teacher_disagreement_score":0.0055694864,"about_ca_system_score_codex":0.0006326851,"about_ca_system_score_gemma":0.00065250054,"threshold_uncertainty_score":0.018631816},"labels":[],"label_agreement":null},{"id":"W1526752423","doi":"10.1007/978-3-540-28645-5_13","title":"Is Plausible Reasoning a Sensible Alternative for Inductive-Statistical Reasoning?","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Université de Montréal; Cegep Edouard Montpetit","funders":"","keywords":"Inductive reasoning; Computer science; Deductive reasoning; Artificial intelligence; Representation (politics); Field (mathematics); Knowledge representation and reasoning; Task (project management); Management science; Epistemology; Mathematics; Philosophy","score_opus":0.026652128850588465,"score_gpt":0.28132042809383956,"score_spread":0.2546682992432511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526752423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045004543,0.0028130887,0.9114761,0.035729397,0.0011483126,0.0000987067,0.000473248,0.0005554607,0.043205313],"genre_scores_gemma":[0.5023793,0.0038276392,0.46334884,0.009755036,0.0049134665,0.0006460382,0.0012468054,0.0005468735,0.013335994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9828892,0.009154624,0.001135589,0.0021083043,0.003997977,0.00071436353],"domain_scores_gemma":[0.94344425,0.040661562,0.0022688613,0.010000771,0.002714868,0.00090963964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020170305,0.0017353477,0.0029584514,0.0044861077,0.0029301778,0.011200692,0.010276316,0.007694187,0.022005253],"category_scores_gemma":[0.07880213,0.0014392115,0.0036839112,0.0038204216,0.016844567,0.031126238,0.005361587,0.009733061,0.005327849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029985467,0.000021764605,0.00014525844,0.00010114973,0.00003692485,0.000050354465,0.000108779546,0.0006988542,0.00006059866,0.9873531,0.0018469205,0.009546308],"study_design_scores_gemma":[0.00001080902,0.0000046563114,0.000023848828,0.000015676253,0.0000065433906,0.00004295345,0.000033145257,0.0017745898,0.00006376389,0.9961039,0.0019126512,0.000007474141],"about_ca_topic_score_codex":0.001269671,"about_ca_topic_score_gemma":0.0013220167,"teacher_disagreement_score":0.022005253,"about_ca_system_score_codex":0.002215286,"about_ca_system_score_gemma":0.0020647843,"threshold_uncertainty_score":0.10667205},"labels":[],"label_agreement":null},{"id":"W1526757356","doi":"10.1007/11424918_6","title":"Multiagent Systems Viewed as Distributed Scheduling Systems: Methodology and Experiments","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Multi-agent system; Two-level scheduling; Fair-share scheduling; Artificial intelligence; Mathematical optimization; Computer network; Mathematics","score_opus":0.041900276477206455,"score_gpt":0.2862282968172445,"score_spread":0.24432802034003803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526757356","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.7819811,0.0010553391,0.20645182,0.00028097886,0.00019323082,0.00061989296,0.00035531673,0.0005924954,0.008469834],"genre_scores_gemma":[0.9398771,0.00036642744,0.057448514,0.000040726,0.000029130164,0.0003802184,0.0002008682,0.00008055079,0.0015765463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694926,0.0022220036,0.000108207474,0.00021067302,0.0003525264,0.00015744605],"domain_scores_gemma":[0.96824425,0.025321128,0.001253714,0.0030375388,0.0016604355,0.00048285152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061250534,0.00083535095,0.0010450213,0.00077098235,0.000692095,0.0012104178,0.0013257507,0.00096320274,0.0029914107],"category_scores_gemma":[0.016657399,0.00037650185,0.0005265421,0.0013571668,0.0012729525,0.0017168459,0.0008455874,0.001421864,0.00037578805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066444073,0.007763471,0.005127281,0.0010986425,0.0003239614,0.0001595874,0.0010751168,0.807084,0.023864832,0.044982105,0.0037262866,0.09815024],"study_design_scores_gemma":[0.00062751124,0.002030327,0.0015631532,0.00003800044,0.00010662295,0.00003961638,0.00034735297,0.9681588,0.010096408,0.016019471,0.00093260827,0.000040163875],"about_ca_topic_score_codex":0.003150277,"about_ca_topic_score_gemma":0.001277225,"teacher_disagreement_score":0.0061250534,"about_ca_system_score_codex":0.0012619878,"about_ca_system_score_gemma":0.0010234655,"threshold_uncertainty_score":0.03239274},"labels":[],"label_agreement":null},{"id":"W1526821023","doi":"10.1007/978-3-642-04843-2_32","title":"Detecting Network Anomalies Using CUSUM and EM Clustering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"CUSUM; Intrusion detection system; Computer science; Anomaly detection; Cluster analysis; Data mining; Constant false alarm rate; False alarm; Anomaly-based intrusion detection system; False positive paradox; Network security; Parametric statistics; Artificial intelligence; Computer security","score_opus":0.018344522045334297,"score_gpt":0.23455111455448416,"score_spread":0.21620659250914986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526821023","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.025532398,0.0003234442,0.9719721,0.000119445176,0.000085353684,0.00004676706,0.000073200834,0.0012876272,0.0005596727],"genre_scores_gemma":[0.3610704,0.00031292034,0.6355145,0.000084530686,0.00013339584,0.000106977925,0.0005649343,0.000357125,0.0018552697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870706,0.00035850884,0.00008302991,0.0003078235,0.0004078555,0.00013578605],"domain_scores_gemma":[0.99640024,0.0019486698,0.0002827691,0.00037978307,0.00088396366,0.000104552564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021538187,0.0017582212,0.0018121772,0.0042376397,0.0009945541,0.0012407517,0.0021684584,0.0013947609,0.0009463915],"category_scores_gemma":[0.008830452,0.0007281056,0.0011339935,0.003079962,0.00069642806,0.0018170843,0.0011328894,0.0015158514,0.00062881334],"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.00063952757,0.00017189185,0.010775594,0.00017733846,0.00028575608,0.00037956235,0.0002614427,0.42689848,0.015066308,0.010632896,0.007897421,0.5268137],"study_design_scores_gemma":[0.000004389912,0.000021435704,0.00067476276,0.0000047879084,0.000015048813,0.00007269227,0.000023506824,0.9935649,0.0022605774,0.002832456,0.0005150868,0.000010360402],"about_ca_topic_score_codex":0.006525272,"about_ca_topic_score_gemma":0.0068226336,"teacher_disagreement_score":0.006525272,"about_ca_system_score_codex":0.0011140406,"about_ca_system_score_gemma":0.00081130955,"threshold_uncertainty_score":0.01297462},"labels":[],"label_agreement":null},{"id":"W1526845711","doi":"10.1007/3-540-47804-3_2","title":"Cell Suppression: Experience and Theory","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Corporate Finance and Governance","field":"Business, Management and Accounting","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":"Statistics Canada","funders":"","keywords":"Confusion; Heuristics; Computer science; Sensitivity (control systems); Mechanism (biology); Table (database); Risk analysis (engineering); Data science; Management science; Data mining; Epistemology; Psychology; Medicine","score_opus":0.015300022237299142,"score_gpt":0.2022032921454233,"score_spread":0.18690326990812414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526845711","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3195246,0.07294103,0.14681168,0.009845444,0.0009413515,0.000110314584,0.00027994413,0.0007240008,0.44882166],"genre_scores_gemma":[0.9242742,0.020299561,0.010270931,0.001500815,0.00040229465,0.000083165345,0.00022960719,0.00013935944,0.04280014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939454,0.00022016292,0.00001859694,0.0000795417,0.00018272961,0.0001043693],"domain_scores_gemma":[0.9973236,0.0018920964,0.000106825784,0.00029458437,0.00024597772,0.00013691204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009884,0.00038981822,0.00048345124,0.0007605449,0.0012184961,0.0027150903,0.0012702366,0.001300008,0.008884836],"category_scores_gemma":[0.0039534294,0.00016563541,0.0002605988,0.0010663565,0.0038730905,0.0018542707,0.0012042485,0.0012531255,0.00158168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054437155,0.00043992366,0.0057196002,0.00029460233,0.000026784483,0.0016432477,0.006102373,0.0038312979,0.01125753,0.6337521,0.016345957,0.32004213],"study_design_scores_gemma":[0.00016465747,0.0006212888,0.003907938,0.00026992237,0.000065364184,0.00729682,0.0050390307,0.013558662,0.040151432,0.5743909,0.35444218,0.000091755086],"about_ca_topic_score_codex":0.0018871156,"about_ca_topic_score_gemma":0.0012287169,"teacher_disagreement_score":0.008884836,"about_ca_system_score_codex":0.00065512914,"about_ca_system_score_gemma":0.0007128644,"threshold_uncertainty_score":0.02972275},"labels":[],"label_agreement":null},{"id":"W1526897964","doi":"10.1007/978-3-642-01932-6_50","title":"Cardiac Imaging and Modeling for Guidance of Minimally Invasive Beating Heart Interventions","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Psychological intervention; Artificial intelligence; Computer vision; Medicine","score_opus":0.027956419274906632,"score_gpt":0.33826334067475256,"score_spread":0.31030692139984595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526897964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044545974,0.0077410927,0.9733793,0.00077763386,0.00017417716,0.000025584774,0.000145969,0.00087924016,0.012422508],"genre_scores_gemma":[0.31064942,0.023811586,0.6037417,0.0007600533,0.0007807746,0.00015680757,0.00052068767,0.0007891355,0.058789726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998872,0.000024671313,0.0000041608155,0.000018841616,0.000059189337,0.000005822444],"domain_scores_gemma":[0.9997439,0.00017074564,0.000017343142,0.000020364092,0.000037338566,0.000010259041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023464982,0.0005642688,0.00061978167,0.00029167245,0.00014710794,0.00092187885,0.0007407089,0.0009080721,0.0031410034],"category_scores_gemma":[0.00069397467,0.00043536944,0.00048476315,0.00028825994,0.00029064342,0.0005587895,0.00042662717,0.00088063854,0.0009855288],"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.00008889463,0.00005804677,0.0006780707,0.0004255511,0.00006297829,0.00032441935,0.0002189953,0.42253956,0.04208287,0.05775132,0.027887132,0.4478822],"study_design_scores_gemma":[0.000008980581,0.000052002517,0.0005829265,0.00009374515,0.000030078067,0.0006862994,0.000025175328,0.92863625,0.008854493,0.024177982,0.036808174,0.000043913],"about_ca_topic_score_codex":0.0016490426,"about_ca_topic_score_gemma":0.0020082872,"teacher_disagreement_score":0.0031410034,"about_ca_system_score_codex":0.0003278708,"about_ca_system_score_gemma":0.00038608658,"threshold_uncertainty_score":0.010507762},"labels":[],"label_agreement":null},{"id":"W1526904710","doi":"10.1007/3-540-36379-3_35","title":"Connected and Loosely Connected List Homomorphisms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Bipartite graph; Homomorphism; Combinatorics; Discrete mathematics; Time complexity; Pathwidth; Indifference graph; Mathematics; Graph homomorphism; Complete bipartite graph; Computer science; Graph; Line graph; Voltage graph","score_opus":0.02350317992220167,"score_gpt":0.25560026214924325,"score_spread":0.2320970822270416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526904710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18006486,0.0029903625,0.52845573,0.0020863577,0.00063730817,0.00018336035,0.00062817725,0.0020977198,0.28285617],"genre_scores_gemma":[0.72448474,0.002647353,0.116002314,0.00079823495,0.00061506295,0.00038694288,0.0010720006,0.00078161625,0.1532117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993068,0.00019293687,0.000045445795,0.00017278873,0.00018307356,0.00009902023],"domain_scores_gemma":[0.99822384,0.0009370663,0.00011147018,0.00035366009,0.00017673067,0.00019726752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056573225,0.00055337645,0.0005815928,0.0022083572,0.0026042229,0.0031365573,0.0011937437,0.00093386084,0.014341841],"category_scores_gemma":[0.003743076,0.0006670007,0.00070171955,0.003678904,0.0022057416,0.010363994,0.003981453,0.0022158592,0.0023726039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029698966,0.000020298821,0.00016082247,0.00006225024,0.000006210701,0.000088280496,0.0006485146,0.0005108219,0.0007764714,0.974838,0.0024573945,0.02040114],"study_design_scores_gemma":[0.0000061840346,0.000010490795,0.00012003972,0.000018147464,0.00001248353,0.00014817584,0.00019555479,0.001705234,0.0006844704,0.9844431,0.012647588,0.000008527702],"about_ca_topic_score_codex":0.00053024665,"about_ca_topic_score_gemma":0.0006713188,"teacher_disagreement_score":0.014341841,"about_ca_system_score_codex":0.00085022574,"about_ca_system_score_gemma":0.00044715,"threshold_uncertainty_score":0.047978222},"labels":[],"label_agreement":null},{"id":"W1526991611","doi":"10.1007/978-3-642-37119-6_22","title":"A Case Study of Side-Channel Analysis Using Decoupling Capacitor Power Measurement with the OpenADC","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Decoupling capacitor; Decoupling (probability); Side channel attack; Capacitor; Electronic engineering; Computer science; Electrical engineering; Engineering; Control engineering; Algorithm; Voltage","score_opus":0.05616553117984636,"score_gpt":0.28381358671472123,"score_spread":0.22764805553487488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526991611","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.48352,0.0011667477,0.4582536,0.0020645417,0.00028680262,0.00038562954,0.0006338837,0.0039019773,0.049786735],"genre_scores_gemma":[0.9301049,0.00019667928,0.05787717,0.00018065302,0.000045479068,0.000033896857,0.00009393702,0.00021556274,0.011251756],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99811065,0.0005481345,0.00006144438,0.00022343964,0.0008827109,0.0001736509],"domain_scores_gemma":[0.99692804,0.0015156221,0.00011963042,0.000600069,0.0006948619,0.00014167877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013855281,0.0006774702,0.0005600682,0.00089482917,0.0010412604,0.0014892486,0.001642668,0.0023560298,0.0058053774],"category_scores_gemma":[0.00330149,0.00029137728,0.00051275594,0.0010118763,0.001054262,0.0014173384,0.0011035826,0.0010782409,0.0012933397],"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.0035049948,0.0009731757,0.041952346,0.0015331287,0.000399775,0.060596425,0.0054324544,0.08731375,0.23492652,0.0542967,0.026523152,0.48254764],"study_design_scores_gemma":[0.00026274854,0.00142309,0.014543453,0.00022953645,0.0004080469,0.03319418,0.0033172446,0.48516268,0.3591457,0.027512625,0.07451021,0.0002905448],"about_ca_topic_score_codex":0.0028103672,"about_ca_topic_score_gemma":0.00330657,"teacher_disagreement_score":0.0058053774,"about_ca_system_score_codex":0.00086145906,"about_ca_system_score_gemma":0.000662922,"threshold_uncertainty_score":0.019420922},"labels":[],"label_agreement":null},{"id":"W1527058126","doi":"10.1007/978-3-540-30475-3_32","title":"Inferring Data Transformation Rules to Integrate Semantic Web Services","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research and Productivity Council","funders":"","keywords":"Computer science; Web service; Transformation (genetics); XML; Data transformation; Programming language; Semantic reasoner; Data type; Abstract data type; Database; Data mining; Information retrieval; Theoretical computer science; World Wide Web; Artificial intelligence; Data warehouse","score_opus":0.01775234920822661,"score_gpt":0.2509740207720426,"score_spread":0.233221671563816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527058126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055498198,0.000110434295,0.92242557,0.00049148186,0.00009737617,0.0004100319,0.0011088566,0.01564753,0.0042105536],"genre_scores_gemma":[0.33276638,0.00020038751,0.65855825,0.00026658535,0.000031394942,0.00021080532,0.004143433,0.0015079845,0.0023149168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657,0.00077533885,0.00034515385,0.00054432114,0.0014685786,0.00029664984],"domain_scores_gemma":[0.99208516,0.004828933,0.00031310378,0.0015331124,0.0011111302,0.000128601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034672506,0.0008431511,0.000713992,0.0029093332,0.0008380892,0.0027693638,0.0019622787,0.0016443814,0.003017941],"category_scores_gemma":[0.017933268,0.0010772003,0.0024192813,0.0018202671,0.0012976805,0.0031586091,0.0020361934,0.0019882056,0.001351025],"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.0011765411,0.001863115,0.029929882,0.00074870564,0.0005379805,0.0025561873,0.0013177653,0.20069942,0.032817278,0.1182759,0.020909399,0.58916783],"study_design_scores_gemma":[0.0000710219,0.000054467007,0.0010486648,0.00007622111,0.00021283576,0.00023743587,0.00024037035,0.8446877,0.06619587,0.076801844,0.010329528,0.000044155444],"about_ca_topic_score_codex":0.0077937036,"about_ca_topic_score_gemma":0.0118899485,"teacher_disagreement_score":0.0077937036,"about_ca_system_score_codex":0.0010111034,"about_ca_system_score_gemma":0.0018672692,"threshold_uncertainty_score":0.018336773},"labels":[],"label_agreement":null},{"id":"W152712179","doi":"10.1007/978-3-642-40273-9_19","title":"A Survey of Data Structures in the Bitprobe Model","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Waterloo","funders":"","keywords":"Computation; Computer science; Context (archaeology); Perceptron; Algorithm; Bit (key); Data structure; Theoretical computer science; Arithmetic; Artificial intelligence; Mathematics; Programming language; Geography; Artificial neural network; Computer security","score_opus":0.07149321344670191,"score_gpt":0.2928878472238789,"score_spread":0.221394633777177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152712179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0171728,0.19430259,0.7311096,0.0067372657,0.0010587753,0.00031338213,0.0017452053,0.0026308084,0.04492951],"genre_scores_gemma":[0.1904003,0.25063634,0.5166189,0.0055024265,0.0029044156,0.0010431593,0.0045079486,0.0024839155,0.025902554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996942,0.00065923657,0.00029018903,0.00046730466,0.0014060185,0.00023518718],"domain_scores_gemma":[0.99564016,0.0019778921,0.00028239554,0.0014735971,0.00048980385,0.00013618248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029750876,0.001247663,0.0019372,0.0035494687,0.0014670506,0.005483795,0.0036048996,0.0022590829,0.009160455],"category_scores_gemma":[0.008277956,0.0015585538,0.0013785877,0.014186877,0.0030019116,0.018327193,0.003198604,0.0038255753,0.004019293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013924362,0.00011391188,0.00059994636,0.0012496082,0.000030983818,0.00007445828,0.00019410522,0.013921464,0.0015531239,0.7271211,0.02154369,0.23345828],"study_design_scores_gemma":[0.000032629363,0.00014201313,0.00030957584,0.0006410787,0.000043468102,0.000591996,0.00009948723,0.043344744,0.0028981552,0.78197914,0.16984633,0.00007129417],"about_ca_topic_score_codex":0.0014868532,"about_ca_topic_score_gemma":0.0013763241,"teacher_disagreement_score":0.009160455,"about_ca_system_score_codex":0.0033829971,"about_ca_system_score_gemma":0.002992792,"threshold_uncertainty_score":0.030644774},"labels":[],"label_agreement":null},{"id":"W1527227975","doi":"10.1007/978-3-642-12148-7_5","title":"Novelty-Based Fitness: An Evaluation under the Santa Fe Trail","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Novelty; Computer science; Artificial intelligence; Psychology","score_opus":0.03461303463023035,"score_gpt":0.28894693843921615,"score_spread":0.2543339038089858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527227975","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.6548684,0.003573682,0.2948868,0.0018292025,0.00041320702,0.00026615028,0.0002196734,0.00079754944,0.0431453],"genre_scores_gemma":[0.9421405,0.00036205002,0.0513983,0.00010081197,0.00006183629,0.00005392619,0.00011990937,0.00008416684,0.005678404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986407,0.00053169247,0.00005472276,0.00011417412,0.000547657,0.000110979156],"domain_scores_gemma":[0.9942707,0.0037068096,0.00021591512,0.00060872483,0.0009993874,0.00019839541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038324178,0.0006209254,0.001147642,0.0012919719,0.0010732987,0.0015437985,0.0014753458,0.001924787,0.003137225],"category_scores_gemma":[0.013492779,0.0002539607,0.00061607786,0.0011819719,0.00095231476,0.0015262243,0.0010904792,0.0008007781,0.0002744047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023663274,0.000600166,0.008453634,0.00025694928,0.0002958221,0.0001944548,0.00019374733,0.5202797,0.0038881688,0.048249368,0.004906718,0.41031492],"study_design_scores_gemma":[0.00017566138,0.0006799579,0.0024974996,0.00003956871,0.0001254329,0.00013843605,0.000041327658,0.98638576,0.0010370474,0.0075611607,0.0013011706,0.000016990787],"about_ca_topic_score_codex":0.0035393608,"about_ca_topic_score_gemma":0.0049900454,"teacher_disagreement_score":0.0038324178,"about_ca_system_score_codex":0.0013811925,"about_ca_system_score_gemma":0.0009764917,"threshold_uncertainty_score":0.020267963},"labels":[],"label_agreement":null},{"id":"W1527244369","doi":"10.1007/978-3-540-77444-0_58","title":"On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":67,"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; University of British Columbia; McGill University","funders":"","keywords":"Wireless ad hoc network; Computer science; Destination-Sequenced Distance Vector routing; Combinatorics; Computer network; Routing (electronic design automation); Dynamic Source Routing; Mathematics; Wireless; Routing protocol; Telecommunications","score_opus":0.01391096567403587,"score_gpt":0.2246083153789703,"score_spread":0.21069734970493442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527244369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030112993,0.0072218236,0.9772843,0.0008406975,0.00074434944,0.00006945504,0.00006534735,0.00054978236,0.010212848],"genre_scores_gemma":[0.27513623,0.034949325,0.65963805,0.0011569186,0.0020935778,0.00063307094,0.0005768372,0.0006571185,0.025158796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985775,0.0005520332,0.00008863329,0.00014281904,0.00049524213,0.0001438323],"domain_scores_gemma":[0.997315,0.0019958997,0.00009313912,0.00031982566,0.00020361254,0.00007249651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020115536,0.0017743035,0.001701554,0.0013423618,0.00088177965,0.0021746028,0.003398836,0.0016838755,0.005096108],"category_scores_gemma":[0.0058292043,0.000662838,0.00087733736,0.0027685186,0.0018340773,0.0038708579,0.0028915012,0.0028440685,0.001392681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002486338,0.00009797117,0.00029774828,0.0007024568,0.00011509407,0.00028031078,0.00034985493,0.31188852,0.0030363782,0.36151782,0.03291638,0.28854877],"study_design_scores_gemma":[0.000043500913,0.00011868463,0.0001873916,0.00013920065,0.00004467458,0.00030482374,0.000083146115,0.66641927,0.0014254581,0.30486783,0.026317164,0.000048806694],"about_ca_topic_score_codex":0.0017059555,"about_ca_topic_score_gemma":0.0015621865,"teacher_disagreement_score":0.005096108,"about_ca_system_score_codex":0.0013722341,"about_ca_system_score_gemma":0.00072589,"threshold_uncertainty_score":0.01704818},"labels":[],"label_agreement":null},{"id":"W1527285026","doi":"10.1007/978-3-540-30470-8_33","title":"Large-Scale Resource Selection in Grids","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Queen's University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Grid; Resource (disambiguation); ENCODE; Matching (statistics); Encoding (memory); Exponential function; Scale (ratio); Value (mathematics); Singular value decomposition; Algorithm; Artificial intelligence; Machine learning; Mathematics; Statistics; Computer network","score_opus":0.010972777284905741,"score_gpt":0.23067145115522925,"score_spread":0.2196986738703235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527285026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089111954,0.0056661773,0.86059767,0.0018649999,0.00035140564,0.00011629423,0.00014584839,0.0021714785,0.039974127],"genre_scores_gemma":[0.81983715,0.0020732265,0.1556529,0.00015172831,0.00020147313,0.000112857204,0.0001858725,0.00033251313,0.02145229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996215,0.0001460165,0.000015503543,0.00004856244,0.00011798271,0.0000503767],"domain_scores_gemma":[0.9991196,0.0005488139,0.00003755745,0.00014934942,0.00007119666,0.000073539464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008084856,0.00034933703,0.0007686507,0.0003539071,0.0006416329,0.0012298169,0.0010036406,0.00041934976,0.0038956108],"category_scores_gemma":[0.0021937767,0.00032956057,0.00027774693,0.0011075758,0.00071640237,0.0013539264,0.00091451476,0.00079148886,0.0006127905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004753837,0.00011791713,0.0021206946,0.00030481815,0.00007195986,0.00038093203,0.00030977651,0.3757776,0.0118017765,0.24018368,0.029676309,0.33877918],"study_design_scores_gemma":[0.00005962946,0.000058284648,0.0007152339,0.000020370335,0.000018206678,0.00017514927,0.0001432521,0.7372996,0.0042324066,0.24039316,0.016866885,0.000017751065],"about_ca_topic_score_codex":0.0012494143,"about_ca_topic_score_gemma":0.0016691263,"teacher_disagreement_score":0.0038956108,"about_ca_system_score_codex":0.00060761045,"about_ca_system_score_gemma":0.00048692912,"threshold_uncertainty_score":0.013032138},"labels":[],"label_agreement":null},{"id":"W1527417422","doi":"10.1007/11424918_27","title":"On the Role of the Markov Condition in Causal Reasoning","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Saskatchewan","funders":"","keywords":"Conditional independence; Computer science; Causal inference; Markov chain; Inference; Independence (probability theory); Causal model; Markov blanket; Causal structure; Artificial intelligence; Markov process; Theoretical computer science; Causal reasoning; Proxy (statistics); Graph; Markov model; Markov kernel; Markov property; Machine learning; Variable-order Markov model; Mathematics; Econometrics; Psychology; Statistics; Cognition","score_opus":0.011766483325785372,"score_gpt":0.233911275412569,"score_spread":0.22214479208678364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527417422","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.011868477,0.0074859746,0.898282,0.0111719435,0.0006899327,0.00006321666,0.0002696055,0.00023092423,0.06993797],"genre_scores_gemma":[0.6068774,0.011684161,0.35791904,0.0032237112,0.0035935242,0.00038675897,0.0005494318,0.00037197018,0.015393994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951141,0.0028684079,0.00029702915,0.0006571104,0.00078830647,0.00027499255],"domain_scores_gemma":[0.93904203,0.055742852,0.0010965551,0.0024339652,0.0011752904,0.000509311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011737003,0.0010366269,0.0016065615,0.0019875208,0.0021206238,0.003987541,0.0029539932,0.004403795,0.009764396],"category_scores_gemma":[0.036043577,0.001764878,0.0021160932,0.0024274164,0.01549352,0.02089273,0.002626766,0.009112668,0.0012208004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001289181,0.000005287913,0.000045723482,0.000033368728,0.000006795275,0.00002044436,0.00008413519,0.0013592035,0.000048772483,0.99456984,0.0006525664,0.0031609242],"study_design_scores_gemma":[0.000004400264,0.0000026982393,0.000018663484,0.000011274811,0.0000039356764,0.000010583193,0.0000056544927,0.003223448,0.000022744878,0.9961196,0.00057306373,0.000003957514],"about_ca_topic_score_codex":0.0043879324,"about_ca_topic_score_gemma":0.0026764187,"teacher_disagreement_score":0.011737003,"about_ca_system_score_codex":0.002886744,"about_ca_system_score_gemma":0.0018401457,"threshold_uncertainty_score":0.06207198},"labels":[],"label_agreement":null},{"id":"W1527428778","doi":"10.1007/3-540-39205-x_42","title":"A Rough Set Methodology to Support Learner Self-Assessment in Web-Based Distance Education","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Distance education; Set (abstract data type); Computer science; Probabilistic logic; Explosive material; Artificial intelligence; Machine learning; Mathematics education; Mathematics; Geography","score_opus":0.05659788192399316,"score_gpt":0.34605267774927495,"score_spread":0.2894547958252818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527428778","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.007841431,0.0001291048,0.9905364,0.000099199104,0.00003045843,0.00006825596,0.000028997692,0.00015252152,0.001113624],"genre_scores_gemma":[0.21445754,0.00022374488,0.7833144,0.000045392633,0.00003806241,0.00023859099,0.00008637634,0.000040174476,0.0015557035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966581,0.0017067783,0.00025709232,0.00022739633,0.0010569745,0.000093717215],"domain_scores_gemma":[0.9943743,0.003789901,0.00031686516,0.00038443386,0.0009963677,0.00013824594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047791875,0.00046578373,0.0010319749,0.0015623041,0.0007489917,0.0023322504,0.0016211461,0.00090465485,0.0016609636],"category_scores_gemma":[0.010997814,0.0003606858,0.0012477011,0.0012824325,0.0007439924,0.002320176,0.0016953134,0.0013448648,0.00037618127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019622594,0.00049478124,0.0036945369,0.00038325562,0.00032690147,0.00028814012,0.0017313535,0.28873187,0.0047489894,0.174818,0.0036144124,0.52097154],"study_design_scores_gemma":[0.000029282124,0.00015650954,0.0013361349,0.00006627651,0.00009560497,0.00010877917,0.0003713932,0.9238021,0.0026797813,0.06745474,0.003845993,0.00005346846],"about_ca_topic_score_codex":0.003244782,"about_ca_topic_score_gemma":0.003037981,"teacher_disagreement_score":0.0047791875,"about_ca_system_score_codex":0.0009621553,"about_ca_system_score_gemma":0.0014005563,"threshold_uncertainty_score":0.025275052},"labels":[],"label_agreement":null},{"id":"W1527499336","doi":"10.1007/11569541_35","title":"Improved Motion Correction of fMRI Time-Series Corrupted with Major Head Movement Using Extended Motion-Corrected Independent Component Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interpolation (computer graphics); Voxel; Artificial intelligence; Artifact (error); Independent component analysis; Computer vision; Motion (physics); Motion estimation; Pattern recognition (psychology)","score_opus":0.01244315308250694,"score_gpt":0.24848030789702585,"score_spread":0.23603715481451892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527499336","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.023020107,0.00086048647,0.9731482,0.00014173296,0.00019507251,0.00004288514,0.0002287715,0.0015001427,0.0008626355],"genre_scores_gemma":[0.10629092,0.0011514076,0.8857476,0.00007922196,0.00010344895,0.00008212225,0.0009207203,0.0006617103,0.004962915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976414,0.000055854613,0.000019765794,0.000047789705,0.00008640255,0.000026028667],"domain_scores_gemma":[0.99936694,0.00022123592,0.00005002505,0.00012416876,0.00021959175,0.000018088593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045786728,0.0009576748,0.0005468925,0.00062553596,0.00028806846,0.0006103363,0.0006444474,0.0006832985,0.0023110206],"category_scores_gemma":[0.0025287287,0.0003140042,0.00080074376,0.0009933127,0.00025665358,0.0006924546,0.00052228954,0.0010140757,0.00094138813],"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.0005595314,0.00008830019,0.00054295245,0.00039218657,0.0001993473,0.00020946052,0.00017275252,0.033713117,0.3406496,0.0029851312,0.004521703,0.6159659],"study_design_scores_gemma":[0.000060890663,0.00017370403,0.011088766,0.00007837844,0.00033730603,0.00080399483,0.000049835286,0.7009657,0.26606438,0.0031592767,0.017075606,0.00014217618],"about_ca_topic_score_codex":0.0033387535,"about_ca_topic_score_gemma":0.0074564423,"teacher_disagreement_score":0.0033387535,"about_ca_system_score_codex":0.00024907693,"about_ca_system_score_gemma":0.0008552677,"threshold_uncertainty_score":0.0077311397},"labels":[],"label_agreement":null},{"id":"W1527588642","doi":"10.1007/11495772_30","title":"Conceptual Query Expansion","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Regina","funders":"","keywords":"Computer science; Query optimization; Query expansion; Information retrieval; Query language","score_opus":0.02387339201551543,"score_gpt":0.2502972875464015,"score_spread":0.2264238955308861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527588642","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.008806164,0.001596953,0.8731093,0.0022823857,0.0005660405,0.0008438681,0.0060915537,0.01624841,0.090455346],"genre_scores_gemma":[0.12744936,0.0026903404,0.7467683,0.0018380344,0.0003707037,0.0007074545,0.034320537,0.00405688,0.08179843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967139,0.00074612367,0.00027676646,0.00067441026,0.0013933184,0.0001954648],"domain_scores_gemma":[0.99766845,0.0007679821,0.000048493912,0.00073449564,0.0007200145,0.000060461163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025007057,0.0012495071,0.0010507506,0.0038693983,0.0010397418,0.0032024984,0.0022605334,0.0010159919,0.048053488],"category_scores_gemma":[0.007353616,0.0006931026,0.0017892213,0.0038937535,0.0010053933,0.0066188658,0.0041793496,0.0026130988,0.017569292],"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.00019643841,0.00021984601,0.0006584012,0.00071574596,0.00007869531,0.00025807926,0.0004956615,0.0042706733,0.011729113,0.31310377,0.14612035,0.52215326],"study_design_scores_gemma":[0.00008072314,0.00007499967,0.00091112737,0.00033086326,0.00023943973,0.0010880127,0.0006137662,0.108928174,0.02992807,0.25291187,0.60479265,0.00010035595],"about_ca_topic_score_codex":0.0040035374,"about_ca_topic_score_gemma":0.0036515743,"teacher_disagreement_score":0.048053488,"about_ca_system_score_codex":0.001471189,"about_ca_system_score_gemma":0.0016938266,"threshold_uncertainty_score":0.16075486},"labels":[],"label_agreement":null},{"id":"W1527684320","doi":"10.1007/978-3-540-73210-5_30","title":"Common Semantics for Use Cases and Task Models","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Concordia University","funders":"","keywords":"Computer science; Notation; Semantics (computer science); Formalism (music); Task (project management); Semantic data model; Programming language; Natural language processing; Artificial intelligence; Information retrieval","score_opus":0.08751820155785173,"score_gpt":0.29511172845777395,"score_spread":0.20759352689992222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527684320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004996917,0.00034629487,0.98102105,0.0007065281,0.000119677214,0.00024157485,0.00063656544,0.0010854563,0.010845995],"genre_scores_gemma":[0.3116084,0.00084015715,0.665936,0.0004953393,0.00029996553,0.0017118484,0.0036244758,0.0014254138,0.014058468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98482275,0.0043959646,0.0031918462,0.002576549,0.003692039,0.0013208189],"domain_scores_gemma":[0.98764604,0.0048496085,0.000716601,0.003777232,0.0025656398,0.00044501026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076118857,0.002506672,0.0019882955,0.0067386734,0.0033681374,0.010699929,0.0050044474,0.0051401304,0.009356195],"category_scores_gemma":[0.018653918,0.0026698008,0.005443773,0.0053857043,0.006717231,0.03066741,0.006532228,0.007677858,0.0031053484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024978452,0.000034126097,0.00015915163,0.00009558943,0.000017361457,0.000096810145,0.0011947021,0.0011800523,0.00042315552,0.9825493,0.0012428327,0.012981869],"study_design_scores_gemma":[0.000018468048,0.000018569033,0.00009741287,0.00011614736,0.000046040128,0.00020837694,0.00055713794,0.014411973,0.0008753257,0.96042496,0.023195233,0.00003045279],"about_ca_topic_score_codex":0.004939232,"about_ca_topic_score_gemma":0.0040289247,"teacher_disagreement_score":0.010699929,"about_ca_system_score_codex":0.0030430066,"about_ca_system_score_gemma":0.0032111227,"threshold_uncertainty_score":0.040255964},"labels":[],"label_agreement":null},{"id":"W1527842677","doi":"10.1007/978-3-540-30115-8_46","title":"Naive Bayesian Classifiers for Ranking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":119,"is_retracted":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":"Naive Bayes classifier; Ranking (information retrieval); Bayesian programming; Machine learning; Computer science; Artificial intelligence; Bayes' theorem; Decision tree; Bayesian probability; Bayes error rate; Class (philosophy); Data mining; Bayes factor; Bayes classifier; Support vector machine","score_opus":0.028318592152459916,"score_gpt":0.261975388317121,"score_spread":0.23365679616466112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527842677","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.001379869,0.004076908,0.986134,0.0005321947,0.00042065873,0.00007883978,0.0006149448,0.0014169395,0.005345618],"genre_scores_gemma":[0.091766894,0.0048820064,0.858906,0.0007416294,0.0017619629,0.0006123066,0.005649627,0.00089793414,0.034781642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925206,0.003204954,0.00045111938,0.0010050908,0.0024730302,0.0003451741],"domain_scores_gemma":[0.9917129,0.0049378644,0.0002519919,0.0014426494,0.0014606296,0.00019393438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005617327,0.0016260551,0.0039849887,0.0039558527,0.0018061084,0.0042490996,0.0041299104,0.0031041172,0.016652979],"category_scores_gemma":[0.02452068,0.0012800272,0.0016682644,0.005386795,0.001341098,0.007978195,0.001791396,0.004271056,0.009918618],"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.00014803791,0.00012644772,0.00044978128,0.00038264983,0.00011531953,0.0000480419,0.00008281043,0.05307533,0.0005780832,0.15001501,0.09531905,0.69965935],"study_design_scores_gemma":[0.000032713695,0.000042357566,0.0002892128,0.00008047818,0.000039214865,0.00008315478,0.00002742724,0.4389326,0.0006259165,0.53981113,0.019992221,0.00004359366],"about_ca_topic_score_codex":0.006124868,"about_ca_topic_score_gemma":0.008706996,"teacher_disagreement_score":0.016652979,"about_ca_system_score_codex":0.0021277182,"about_ca_system_score_gemma":0.0020677084,"threshold_uncertainty_score":0.05570972},"labels":[],"label_agreement":null},{"id":"W1527867680","doi":"10.1007/11556114_28","title":"2D-3D MultiAgent GeoSimulation with Knowledge-Based Agents of Customers’ Shopping Behavior in a Shopping Mall","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Retail Behavior Studies","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Shopping mall; Situational ethics; Computer science; Human–computer interaction; Advertising; Business; Psychology","score_opus":0.039967568064241454,"score_gpt":0.27268129166689725,"score_spread":0.2327137236026558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527867680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27306387,0.0002199356,0.71013534,0.00043219616,0.00011101822,0.00006240441,0.00027774865,0.0010557977,0.014641694],"genre_scores_gemma":[0.93658274,0.00009595357,0.059735563,0.000056548237,0.000018549437,0.000054434106,0.00015200481,0.00008177678,0.0032224087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999043,0.000031316034,0.0000062859576,0.000023137221,0.00002087885,0.000014026864],"domain_scores_gemma":[0.99981445,0.00008181815,0.000019494288,0.000024340106,0.000033090862,0.00002668215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015608784,0.0003883831,0.00056657643,0.0003264697,0.0005240059,0.000921244,0.00077929214,0.0010122142,0.0035638213],"category_scores_gemma":[0.0005385566,0.0004993658,0.00091230514,0.0003710165,0.00054878934,0.00064588187,0.0013807176,0.00041767614,0.00036627255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050796723,0.000024392926,0.0006220466,0.000018305682,0.000022413302,0.00008206807,0.00010078223,0.98694104,0.00274365,0.0036267487,0.0002747132,0.0054930593],"study_design_scores_gemma":[0.0000034633945,0.000007136136,0.00015784486,0.0000011735327,0.0000029803725,0.000008132177,0.000013541555,0.9984457,0.00023334568,0.0009419305,0.00018077117,0.0000041044145],"about_ca_topic_score_codex":0.012730029,"about_ca_topic_score_gemma":0.011672055,"teacher_disagreement_score":0.012730029,"about_ca_system_score_codex":0.0005129791,"about_ca_system_score_gemma":0.0005433275,"threshold_uncertainty_score":0.025311887},"labels":[],"label_agreement":null},{"id":"W1527869850","doi":"10.1007/11518655_18","title":"Optimal Threshold Policies for Operation of a Dedicated-Platform with Imperfect State Information – A POMDP Framework","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Task (project management); Optimal control; Markov process; Latency (audio); Heuristic; Mathematical optimization; Process (computing); Markov chain; Markov model; Artificial intelligence; Machine learning; Mathematics","score_opus":0.009928208014848852,"score_gpt":0.2376701382809395,"score_spread":0.22774193026609063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527869850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09320393,0.00029312132,0.8897892,0.000860684,0.00011333958,0.00015459555,0.00024183514,0.00055235275,0.014790828],"genre_scores_gemma":[0.951178,0.00017117593,0.044966802,0.00007442563,0.000025418825,0.00012865986,0.000060125436,0.000099115045,0.003296351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985983,0.00031424034,0.000081173996,0.00028659648,0.00020264325,0.00051711197],"domain_scores_gemma":[0.99629265,0.002094973,0.0003996561,0.0003292313,0.00038146254,0.0005019589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018959886,0.0012418866,0.0019783417,0.0007695675,0.0008421278,0.0033198535,0.0022328554,0.0019362341,0.0051738876],"category_scores_gemma":[0.005858811,0.0009172584,0.000843489,0.00077730673,0.0019673111,0.003759094,0.0026447026,0.0024010695,0.000546534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037915155,0.00011129201,0.00026876692,0.00013916861,0.000061850296,0.00013688863,0.00013295161,0.8320647,0.0058464273,0.14741908,0.0015594003,0.011880348],"study_design_scores_gemma":[0.000024932271,0.000041114447,0.00006608238,0.000015533953,0.0000143213865,0.000013418065,0.000039522936,0.9369639,0.0008934306,0.061667733,0.0002463904,0.000013517913],"about_ca_topic_score_codex":0.0033485705,"about_ca_topic_score_gemma":0.0027468356,"teacher_disagreement_score":0.0051738876,"about_ca_system_score_codex":0.0022851916,"about_ca_system_score_gemma":0.003042583,"threshold_uncertainty_score":0.017308414},"labels":[],"label_agreement":null},{"id":"W1527917834","doi":"10.1007/978-3-540-30566-8_92","title":"Communication Using a Reconfigurable and Reliable Transport Layer Protocol","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transport layer; Computer network; Transmission Control Protocol; OSI model; Distributed computing; Application layer; User Datagram Protocol; Internet protocol suite; Network packet; Layer (electronics); Software; Interconnection; The Internet; Operating system","score_opus":0.022060710398959734,"score_gpt":0.2555663383320637,"score_spread":0.23350562793310398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527917834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06418326,0.002806438,0.86096126,0.00063360116,0.001462556,0.00037559393,0.0003088382,0.016266387,0.053002167],"genre_scores_gemma":[0.76241344,0.001880019,0.19379827,0.00036365626,0.00063082896,0.00027925684,0.0005788202,0.0008273771,0.03922836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996039,0.00005844131,0.000042837757,0.00006582229,0.00016423363,0.00006485108],"domain_scores_gemma":[0.9989887,0.00015991676,0.00010093049,0.0005381751,0.00016898518,0.000043185904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760215,0.0006960412,0.00053428253,0.00091740827,0.0008612289,0.0021245012,0.0018612603,0.0007160362,0.0042975266],"category_scores_gemma":[0.0011717656,0.00035376695,0.00044905598,0.0007249574,0.00053393096,0.0015897426,0.0009362913,0.0012023424,0.0016343419],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012649888,0.0003146757,0.0012046176,0.00068055734,0.00023911613,0.0011973481,0.00039925633,0.057945807,0.2689357,0.16492318,0.030654877,0.4722399],"study_design_scores_gemma":[0.00020427513,0.0010668176,0.0017981965,0.00015376424,0.0005624484,0.0022452604,0.00013232548,0.5070893,0.27199632,0.05298711,0.16150638,0.0002578298],"about_ca_topic_score_codex":0.00043314527,"about_ca_topic_score_gemma":0.00070885115,"teacher_disagreement_score":0.0042975266,"about_ca_system_score_codex":0.0003977286,"about_ca_system_score_gemma":0.00041011933,"threshold_uncertainty_score":0.01437664},"labels":[],"label_agreement":null},{"id":"W1527920281","doi":"10.1007/978-3-540-39592-8_36","title":"Design Patterns in Intelligent Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":13,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Set (abstract data type); Intelligent decision support system; Feature (linguistics); Component (thermodynamics); Reverse engineering; Identification (biology); Feature engineering; Embodied cognition; Pattern recognition (psychology); Deep learning","score_opus":0.029846999667185906,"score_gpt":0.22876603321823796,"score_spread":0.19891903355105206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527920281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014811479,0.007130171,0.84648263,0.0029405155,0.000451837,0.00017692386,0.0001571239,0.0006343547,0.12721503],"genre_scores_gemma":[0.29708984,0.007839436,0.60700756,0.00079857185,0.0003439997,0.0008458201,0.0005754174,0.0003849544,0.08511446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992988,0.00023689799,0.00007872722,0.00012471579,0.00021691764,0.00004387847],"domain_scores_gemma":[0.99917173,0.00042968115,0.000059072572,0.0002140674,0.00009704957,0.000028336814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007642679,0.00064296304,0.00065740146,0.00091355987,0.0006437832,0.002516008,0.00077550404,0.0009911116,0.008749332],"category_scores_gemma":[0.0028353245,0.0006442192,0.0005332878,0.0015847085,0.0022324827,0.0051062726,0.0014823349,0.0014215539,0.0018278377],"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.000011543625,0.000023266604,0.00023945249,0.00020091403,0.000013504955,0.00007169784,0.00051022146,0.0029532802,0.0003971419,0.8608437,0.005550751,0.12918447],"study_design_scores_gemma":[0.000009765191,0.00001786137,0.00009573051,0.0000877415,0.000009179385,0.0001555348,0.00014942994,0.007809539,0.0005393947,0.93761635,0.05350334,0.0000060751468],"about_ca_topic_score_codex":0.0005425112,"about_ca_topic_score_gemma":0.0005653007,"teacher_disagreement_score":0.008749332,"about_ca_system_score_codex":0.0007588342,"about_ca_system_score_gemma":0.00053090614,"threshold_uncertainty_score":0.029269457},"labels":[],"label_agreement":null},{"id":"W1527945204","doi":"10.1007/978-3-642-03348-3_22","title":"Instance Selection by Border Sampling in Multi-class Domains","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Health Canada; University of Ottawa","funders":"","keywords":"Computer science; Redundancy (engineering); Artificial intelligence; Machine learning; Training set; Selection (genetic algorithm); Class (philosophy); Sampling (signal processing); Binary classification; Binary number; Noise (video); Sample (material); Pattern recognition (psychology); Data mining; Naive Bayes classifier; Support vector machine; Mathematics; Computer vision","score_opus":0.02292200055169073,"score_gpt":0.2952974681570974,"score_spread":0.27237546760540665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527945204","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.030733857,0.0008839613,0.9653194,0.00026607758,0.00009418916,0.000096487,0.00013498924,0.0012486912,0.0012224029],"genre_scores_gemma":[0.42036417,0.00049299875,0.57209706,0.00039764986,0.0002732249,0.00023825123,0.0015201798,0.0004857475,0.0041308133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972691,0.0011490779,0.00017081537,0.0006318575,0.0005675364,0.00021160922],"domain_scores_gemma":[0.9927378,0.0049927817,0.00019210285,0.0012212902,0.0005523239,0.00030364795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056933225,0.00088812347,0.0032907515,0.0015848004,0.0007765349,0.0021239494,0.0039623114,0.0023275474,0.0029204409],"category_scores_gemma":[0.0100719,0.0008703994,0.0015055335,0.001910205,0.0010662646,0.003208584,0.0028733858,0.0030694809,0.00092672557],"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.0016197338,0.0005971271,0.0066894456,0.0003818014,0.0003063132,0.00040044074,0.0002037528,0.18346263,0.010573899,0.031997938,0.016598674,0.74716824],"study_design_scores_gemma":[0.00003519258,0.000040326104,0.00030345385,0.000010710023,0.000021702042,0.00007418153,0.000014853663,0.9864341,0.0018442699,0.010405186,0.00080976484,0.0000062736335],"about_ca_topic_score_codex":0.0013554986,"about_ca_topic_score_gemma":0.0018083896,"teacher_disagreement_score":0.0056933225,"about_ca_system_score_codex":0.000654062,"about_ca_system_score_gemma":0.0007195049,"threshold_uncertainty_score":0.030109525},"labels":[],"label_agreement":null},{"id":"W1527996235","doi":"10.1007/978-3-540-72458-2_17","title":"Ranking by Rough Approximation of Preferences for Decision Engineering Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Rough set; Dominance-based rough set approach; Pareto principle; Mathematics; Decision rule; Decision table; Ranking (information retrieval); Point (geometry); Mathematical optimization; Computer science; Data mining; Artificial intelligence; Statistics","score_opus":0.02542487052338027,"score_gpt":0.258489473297327,"score_spread":0.23306460277394675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527996235","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.010468603,0.0012887351,0.9843407,0.00026138866,0.000105867206,0.00004461758,0.00010997943,0.00014800268,0.0032320807],"genre_scores_gemma":[0.23325397,0.0021066247,0.75800216,0.00010280834,0.00022554178,0.00016574706,0.00046220433,0.000109509194,0.0055714827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967571,0.0017969493,0.00017037975,0.00021611596,0.00093497575,0.00012442171],"domain_scores_gemma":[0.99682754,0.0022710795,0.00013525509,0.00029895655,0.00035101056,0.00011617994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003099635,0.00081136514,0.0019936943,0.001551771,0.0004547054,0.0025413458,0.0010496186,0.0006287717,0.004663522],"category_scores_gemma":[0.008915213,0.00046527202,0.0015975421,0.0029369353,0.00075479364,0.0027748514,0.00082928216,0.0018960933,0.0012092037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028516882,0.00018855592,0.0005239183,0.00074987346,0.00021025707,0.0001060351,0.00035843818,0.14212783,0.0046297475,0.40153125,0.01180026,0.43748876],"study_design_scores_gemma":[0.000039234103,0.00017579329,0.00044898226,0.00007218775,0.00006323949,0.000090151,0.00010353266,0.5038634,0.0016583481,0.48534644,0.008088409,0.00005029943],"about_ca_topic_score_codex":0.00086665794,"about_ca_topic_score_gemma":0.0011672376,"teacher_disagreement_score":0.004663522,"about_ca_system_score_codex":0.0009033766,"about_ca_system_score_gemma":0.0006409908,"threshold_uncertainty_score":0.016392648},"labels":[],"label_agreement":null},{"id":"W1528015358","doi":"10.1007/978-3-540-24840-8_18","title":"A Hybrid Schema for Systematic Local Search","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Schema (genetic algorithms); Computer science; Information retrieval","score_opus":0.017355640596167517,"score_gpt":0.2537859112549982,"score_spread":0.2364302706588307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528015358","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.0017348736,0.0002784316,0.9861413,0.0002414414,0.00006697173,0.00015902106,0.00043812927,0.0012760123,0.00966382],"genre_scores_gemma":[0.040806726,0.000376829,0.9483873,0.00024696934,0.00003669538,0.0005556766,0.0010370357,0.0004729933,0.008079828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837923,0.00059239584,0.0002087212,0.00027979893,0.00044787957,0.00009192325],"domain_scores_gemma":[0.99878126,0.00036581658,0.00004580618,0.0005202268,0.00023853222,0.000048361224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016098537,0.0004924421,0.00080944074,0.001405804,0.00084765133,0.0024055818,0.0023696157,0.0013637572,0.016635753],"category_scores_gemma":[0.003906311,0.00057831797,0.0012082475,0.0027826314,0.0015302867,0.0039301584,0.003097346,0.001488172,0.004546045],"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.00009443511,0.000052530686,0.00033753415,0.0003321022,0.000045824072,0.00011109765,0.00046461142,0.015045179,0.003192576,0.7647576,0.014418188,0.2011484],"study_design_scores_gemma":[0.000107673084,0.0001315961,0.00019422304,0.00019109285,0.00010715086,0.0006102492,0.0002761207,0.19720258,0.005709736,0.64117706,0.15422733,0.00006511908],"about_ca_topic_score_codex":0.00210501,"about_ca_topic_score_gemma":0.0029717218,"teacher_disagreement_score":0.016635753,"about_ca_system_score_codex":0.000754374,"about_ca_system_score_gemma":0.0015007771,"threshold_uncertainty_score":0.05565214},"labels":[],"label_agreement":null},{"id":"W1528038736","doi":"10.1007/978-3-642-16488-0_19","title":"Towards an Integrated Model for Functional and User Interface Requirements","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Computer science; Unified Modeling Language; Software engineering; Programming language; Task (project management); Interface (matter); Semantics (computer science); User interface; Functional requirement; Process (computing); User requirements document; Software; Human–computer interaction; Systems engineering","score_opus":0.0748054291519112,"score_gpt":0.31929786887817935,"score_spread":0.24449243972626816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528038736","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.0025232057,0.00008272457,0.98943233,0.00028145683,0.000021570486,0.00010716549,0.0001198785,0.00080071465,0.006630955],"genre_scores_gemma":[0.09886365,0.00040271223,0.8881014,0.00036155293,0.000055146407,0.0005955627,0.0011174423,0.00073984766,0.009762599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958903,0.001032148,0.00044145496,0.00044906116,0.0019375416,0.0002496493],"domain_scores_gemma":[0.9956617,0.0016161212,0.00035641558,0.00093274127,0.0012995742,0.00013351787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003739564,0.0014804659,0.00090533483,0.0028344023,0.00071644125,0.0046033408,0.0034807008,0.0028288618,0.0055075474],"category_scores_gemma":[0.008393262,0.0017324167,0.0027890163,0.0016882616,0.0016427095,0.007816259,0.0028107453,0.003969277,0.003818161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007103474,0.00021025412,0.0015958454,0.00038261485,0.000102148675,0.0005544577,0.0015614392,0.091438234,0.011582039,0.7458605,0.0064113736,0.1402301],"study_design_scores_gemma":[0.000038569397,0.000108966866,0.000788622,0.0002759695,0.00017564144,0.00056140067,0.00036086745,0.69099224,0.0061682886,0.23844488,0.062024698,0.000059850816],"about_ca_topic_score_codex":0.006069439,"about_ca_topic_score_gemma":0.006002796,"teacher_disagreement_score":0.006069439,"about_ca_system_score_codex":0.0016694186,"about_ca_system_score_gemma":0.0030216116,"threshold_uncertainty_score":0.01977694},"labels":[],"label_agreement":null},{"id":"W1528095446","doi":"10.1007/11682462_62","title":"Packing Dicycle Covers in Planar Graphs with No K 5–e Minor","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"Computer science; Minor (academic); Planar; Planar graph; Combinatorics; Theoretical computer science; Computer graphics (images); Graph; Mathematics; Humanities; Art","score_opus":0.013087783474351394,"score_gpt":0.24909612712772436,"score_spread":0.23600834365337298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528095446","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.88962156,0.0011129291,0.033246085,0.00044156346,0.00019225299,0.00009208156,0.0007858859,0.0004033723,0.07410434],"genre_scores_gemma":[0.9458074,0.0009105876,0.026176283,0.00018151767,0.00009337128,0.000102860045,0.0016915879,0.00021601935,0.024820466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952996,0.000042516935,0.000026351974,0.00011297741,0.00009910914,0.00018907656],"domain_scores_gemma":[0.9992442,0.00028028234,0.00011672278,0.00015333282,0.00004838073,0.00015709599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018363603,0.00072802685,0.0010931778,0.0011481259,0.0018786918,0.002086821,0.0010561363,0.001158206,0.008392397],"category_scores_gemma":[0.0013495969,0.001054005,0.0006475964,0.002126095,0.0009182754,0.0022829855,0.0024504645,0.0012651623,0.0015606299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029651746,0.00046259593,0.011467844,0.0012695695,0.00022123045,0.004044733,0.003794455,0.036139216,0.090135776,0.5422332,0.04307567,0.26419047],"study_design_scores_gemma":[0.0003053278,0.0008869675,0.0203788,0.00032389283,0.00023794855,0.005858259,0.0029762026,0.09187395,0.044763904,0.7444572,0.08780888,0.00012880066],"about_ca_topic_score_codex":0.0009808821,"about_ca_topic_score_gemma":0.0011041447,"teacher_disagreement_score":0.008392397,"about_ca_system_score_codex":0.0006934825,"about_ca_system_score_gemma":0.0002512874,"threshold_uncertainty_score":0.028075337},"labels":[],"label_agreement":null},{"id":"W1528097685","doi":"10.1007/978-3-642-12993-3_2","title":"A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo tree search; Scalability; Parallel computing; Tree (set theory); Monte Carlo method; Algorithm; Lock (firearm); Search tree; Search algorithm; Node (physics); Monte Carlo algorithm; Theoretical computer science; Mathematics; Operating system","score_opus":0.032951479933572905,"score_gpt":0.2787970192146341,"score_spread":0.24584553928106123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528097685","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.006117405,0.00015869929,0.9880326,0.00011901885,0.00009716305,0.000068722984,0.00005886783,0.001955144,0.0033924172],"genre_scores_gemma":[0.1595477,0.000105225816,0.83333415,0.00018114324,0.00005794464,0.00031232965,0.0002248217,0.00060331466,0.005633339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987411,0.00034941395,0.00007130155,0.00019464607,0.00046603254,0.00017754377],"domain_scores_gemma":[0.9978155,0.0010342556,0.00008032174,0.00048953376,0.00039969553,0.00018072236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016870679,0.00056551414,0.0016112278,0.00069990655,0.0011142212,0.001543165,0.0029991544,0.0017988536,0.011232025],"category_scores_gemma":[0.0068732076,0.0006880049,0.00082229427,0.0013659045,0.00080683245,0.0016629273,0.0025491999,0.002023348,0.0030879606],"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.0008933884,0.00041164018,0.00130081,0.0002123515,0.00016474363,0.00015587138,0.00019892042,0.44639766,0.0071568643,0.071496055,0.01327913,0.45833257],"study_design_scores_gemma":[0.00010502502,0.00003759855,0.0000848702,0.000008665408,0.000021837708,0.000029431874,0.00000871535,0.9781908,0.0008066976,0.018599316,0.0020961962,0.000010834663],"about_ca_topic_score_codex":0.0036653276,"about_ca_topic_score_gemma":0.005417318,"teacher_disagreement_score":0.011232025,"about_ca_system_score_codex":0.0008143019,"about_ca_system_score_gemma":0.0027266263,"threshold_uncertainty_score":0.037574828},"labels":[],"label_agreement":null},{"id":"W1528124672","doi":"10.1007/978-3-642-15549-9_41","title":"Anomalous Behaviour Detection Using Spatiotemporal Oriented Energies, Subset Inclusion Histogram Comparison and Event-Driven Processing","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Histogram; Anomaly detection; Representation (politics); Event (particle physics); Set (abstract data type); Focus (optics); Artificial intelligence; Range (aeronautics); Pattern recognition (psychology); Image processing; Image (mathematics); Data mining","score_opus":0.015388278378212524,"score_gpt":0.27161810450019913,"score_spread":0.2562298261219866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528124672","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.09072823,0.00018182906,0.9059617,0.00006513564,0.000052170366,0.00007092646,0.00020572358,0.0016188297,0.0011154915],"genre_scores_gemma":[0.59760296,0.00021358469,0.39920017,0.000034779565,0.00005086107,0.0000728331,0.00070081424,0.00023291628,0.0018911127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996259,0.000041679024,0.00003096761,0.00007364636,0.0001892448,0.000038495804],"domain_scores_gemma":[0.99917173,0.00033635032,0.00010700935,0.00009440247,0.00025034937,0.000040192856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046904,0.00053695927,0.000861148,0.0022745556,0.00029677284,0.0009815234,0.00088849803,0.00037363815,0.0013772051],"category_scores_gemma":[0.0015705865,0.00024862445,0.00061052834,0.0021693048,0.00028573387,0.0009653934,0.00057536253,0.00046406966,0.00039815422],"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.00070450146,0.0004273647,0.010412457,0.00019602667,0.00019373994,0.0002940186,0.00014158023,0.06476546,0.10085952,0.0067789634,0.0020178598,0.8132085],"study_design_scores_gemma":[0.000014525413,0.00012827724,0.012780023,0.0000115034845,0.00005780805,0.0003999467,0.00007411645,0.9437533,0.03425431,0.007251443,0.0012389789,0.000035707388],"about_ca_topic_score_codex":0.0012222065,"about_ca_topic_score_gemma":0.0017826825,"teacher_disagreement_score":0.0022745556,"about_ca_system_score_codex":0.00029612618,"about_ca_system_score_gemma":0.00034976788,"threshold_uncertainty_score":0.0046072006},"labels":[],"label_agreement":null},{"id":"W1528143466","doi":"10.1007/978-3-642-39077-7_8","title":"The Path Less Travelled: Overcoming Tor’s Bottlenecks with Traffic Splitting","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Anonymity; Popularity; Scalability; Router; Latency (audio); Bandwidth (computing); Overlay network; Download; The Internet; Computer security; Telecommunications; World Wide Web; Operating system","score_opus":0.011481978458783543,"score_gpt":0.21439063497774227,"score_spread":0.20290865651895873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528143466","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.22423269,0.0062359143,0.58890814,0.0057685063,0.0015354864,0.00018828188,0.00049959676,0.0039541298,0.1686773],"genre_scores_gemma":[0.90552706,0.0013274439,0.07548607,0.0004496521,0.00020366954,0.00007511034,0.0002682041,0.00055370724,0.016109075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947876,0.00012566637,0.00001344192,0.0001047998,0.000095252835,0.0001821932],"domain_scores_gemma":[0.9985259,0.00050850556,0.000082264414,0.0003380486,0.00029548796,0.0002498559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011805941,0.0006845252,0.00091396074,0.0007437323,0.0017778972,0.0023848314,0.0021090263,0.00092854403,0.010667416],"category_scores_gemma":[0.0045719976,0.00044776165,0.0004017676,0.0011401132,0.001300846,0.005358834,0.0025900665,0.0020474927,0.0013567577],"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.0009102852,0.00024553665,0.0024212503,0.0004085118,0.00010453659,0.00029210438,0.0016806185,0.12998179,0.009083813,0.31526622,0.05983108,0.4797743],"study_design_scores_gemma":[0.00007296544,0.00020042558,0.0011429815,0.0001394471,0.00015859005,0.00032838318,0.0020572147,0.5826086,0.0065309103,0.35431698,0.05237428,0.00006925565],"about_ca_topic_score_codex":0.005249431,"about_ca_topic_score_gemma":0.006346889,"teacher_disagreement_score":0.010667416,"about_ca_system_score_codex":0.001072364,"about_ca_system_score_gemma":0.0017077324,"threshold_uncertainty_score":0.035686076},"labels":[],"label_agreement":null},{"id":"W1528184253","doi":"10.1007/978-3-642-31866-5_2","title":"Revisiting Move Groups in Monte-Carlo Tree Search","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Branching (polymer chemistry); Tree (set theory); Monte Carlo method; Game tree; Mathematical optimization; Search tree; Algorithm; Theoretical computer science; Search algorithm; Game theory; Mathematics; Combinatorics; Statistics; Sequential game; Mathematical economics","score_opus":0.04173228012486649,"score_gpt":0.2875969155058841,"score_spread":0.24586463538101763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528184253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017465595,0.00051506795,0.96777457,0.00054544676,0.0001642418,0.00015289307,0.00009640712,0.0007178249,0.01256786],"genre_scores_gemma":[0.2821578,0.0004576603,0.70356786,0.0004553025,0.0002630331,0.0004604288,0.00046015924,0.001140032,0.0110377995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995246,0.002595432,0.00016296886,0.00045409636,0.0011900377,0.00035142474],"domain_scores_gemma":[0.9735173,0.02157443,0.00061035296,0.002475165,0.0013256287,0.0004970743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006613034,0.0010361193,0.0025362486,0.00228612,0.0016118699,0.002355568,0.0045419615,0.0036173433,0.013370078],"category_scores_gemma":[0.042286783,0.0011899219,0.0015670008,0.003428983,0.0026496085,0.00700756,0.0044573783,0.0037161277,0.0024347154],"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.00037851176,0.00029849398,0.0014628426,0.00026699682,0.00010565716,0.00009550382,0.0006104229,0.38227135,0.0007781867,0.45657307,0.009647979,0.14751087],"study_design_scores_gemma":[0.000052767704,0.00006113646,0.00010750248,0.00005290052,0.000026588437,0.000026189258,0.000040670864,0.777308,0.00028613137,0.21886016,0.0031652686,0.000012682547],"about_ca_topic_score_codex":0.0060301116,"about_ca_topic_score_gemma":0.008669103,"teacher_disagreement_score":0.013370078,"about_ca_system_score_codex":0.0015458409,"about_ca_system_score_gemma":0.0028667566,"threshold_uncertainty_score":0.044727325},"labels":[],"label_agreement":null},{"id":"W1528213927","doi":"10.1007/978-3-540-24655-8_101","title":"Capturing Semantic Hierarchies to Perform Meaningful Integration in HTML Tables","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Schema (genetic algorithms); Information retrieval; Nondeterministic algorithm; Natural language processing; Normalization (sociology); Artificial intelligence; Theoretical computer science","score_opus":0.014215124770221152,"score_gpt":0.23811574985855766,"score_spread":0.2239006250883365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528213927","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.016938452,0.0002765395,0.96050215,0.0001680786,0.00007649031,0.0001500524,0.0011636448,0.017663632,0.0030609053],"genre_scores_gemma":[0.17249122,0.00047123316,0.8126855,0.00022606284,0.000060399176,0.00018878405,0.005811219,0.0038446647,0.0042209574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998351,0.00022847115,0.0002221123,0.00020574419,0.00085183216,0.0001410295],"domain_scores_gemma":[0.99686337,0.0013435974,0.00017636176,0.0008786391,0.0006357333,0.00010229839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014284538,0.0011097456,0.0008988193,0.0026839068,0.00087378186,0.004406294,0.0015630345,0.0013572773,0.00547663],"category_scores_gemma":[0.006823454,0.0012138693,0.001252718,0.0036575608,0.00088974717,0.0064891055,0.00300365,0.0015442976,0.0024583966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005986398,0.0004709313,0.007679349,0.0013428353,0.00020059553,0.00097251526,0.0037977488,0.036666743,0.07796363,0.17817183,0.047293212,0.644842],"study_design_scores_gemma":[0.00011305415,0.00016213158,0.0025285447,0.00034361196,0.0003304536,0.00052286574,0.0012108724,0.52802944,0.17256238,0.19775528,0.096286885,0.00015451048],"about_ca_topic_score_codex":0.003449466,"about_ca_topic_score_gemma":0.007186215,"teacher_disagreement_score":0.00547663,"about_ca_system_score_codex":0.0006618094,"about_ca_system_score_gemma":0.0009605592,"threshold_uncertainty_score":0.018321157},"labels":[],"label_agreement":null},{"id":"W1528282505","doi":"10.1007/978-3-642-14556-8_33","title":"University of Waterloo at INEX 2009: Ad Hoc, Book, Entity Ranking, and Link-the-Wiki Tracks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Information retrieval; Computer science; PageRank; Redundancy (engineering); Ranking (information retrieval); Post hoc; Baseline (sea); World Wide Web; Track (disk drive); Question answering","score_opus":0.009514738419151883,"score_gpt":0.20047286875322434,"score_spread":0.19095813033407247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528282505","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.0092499405,0.053696234,0.17821535,0.029160725,0.013961452,0.00044946815,0.1376621,0.052561402,0.5250433],"genre_scores_gemma":[0.012391281,0.02145863,0.1078823,0.0013613788,0.0021199519,0.00018521195,0.10202883,0.008567696,0.7440047],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784327,0.00017667879,0.00010027062,0.00033481538,0.0013791361,0.00016585142],"domain_scores_gemma":[0.99655104,0.0004842909,0.00009715042,0.00044677514,0.0017561464,0.00066447625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00337612,0.0013052511,0.0014098986,0.00517459,0.0020853211,0.006207872,0.0019832123,0.0012326386,0.09923771],"category_scores_gemma":[0.0063554016,0.0012867012,0.0005708805,0.013646178,0.0006439062,0.009719293,0.0018174155,0.001983437,0.069398195],"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.000021366468,0.000034294026,0.00022106303,0.00007600709,0.0000050345843,0.000014248373,0.000045573495,0.00033932104,0.00017759763,0.0036738159,0.8298606,0.165531],"study_design_scores_gemma":[0.000010642269,0.00001776216,0.00093844644,0.00008916162,0.000007331595,0.00007109459,0.00005876415,0.0021420503,0.0010530322,0.004012878,0.991572,0.000026800397],"about_ca_topic_score_codex":0.100121625,"about_ca_topic_score_gemma":0.18143435,"teacher_disagreement_score":0.100121625,"about_ca_system_score_codex":0.004035731,"about_ca_system_score_gemma":0.009156634,"threshold_uncertainty_score":0.3319832},"labels":[],"label_agreement":null},{"id":"W1528288700","doi":"10.1007/978-3-540-24855-2_133","title":"Multiple Species Weighted Voting – A Genetics-Based Machine Learning System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Computer science; Artificial intelligence; Voting; Classifier (UML); Machine learning; Majority rule; Pruning; Weighted voting; Population; Class (philosophy); Pattern recognition (psychology); Biology","score_opus":0.013872420682726427,"score_gpt":0.21942773845483557,"score_spread":0.20555531777210914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528288700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04991642,0.00017221541,0.9452751,0.0003784195,0.0001256945,0.00009159481,0.00005209164,0.0005617236,0.0034267963],"genre_scores_gemma":[0.56694824,0.00011236102,0.42566255,0.0003169628,0.0000762912,0.0001692362,0.00015924522,0.00013706916,0.0064181243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992262,0.00027389798,0.000042289557,0.0002096417,0.00018808637,0.000059861894],"domain_scores_gemma":[0.9986364,0.00056062586,0.000112201116,0.00022199706,0.00038215122,0.00008661503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894173,0.00046757152,0.0012350236,0.00076276436,0.0008549014,0.00097141176,0.003274472,0.0016030723,0.0025677644],"category_scores_gemma":[0.0031129464,0.00034725145,0.0007249045,0.000843066,0.0010692374,0.0014162867,0.0014498533,0.00093820447,0.0006497688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002891542,0.00023249479,0.0029339339,0.00012638696,0.0002433184,0.00018915965,0.00016628056,0.57390064,0.023995716,0.047615092,0.003844282,0.3464635],"study_design_scores_gemma":[0.000017146403,0.00003636144,0.0002083303,0.000004959875,0.00002030537,0.000046718185,0.000009077547,0.981967,0.0022051143,0.014657239,0.00081834116,0.000009354523],"about_ca_topic_score_codex":0.0016358154,"about_ca_topic_score_gemma":0.0025133025,"teacher_disagreement_score":0.003274472,"about_ca_system_score_codex":0.0007835071,"about_ca_system_score_gemma":0.0007619486,"threshold_uncertainty_score":0.010017455},"labels":[],"label_agreement":null},{"id":"W1528299167","doi":"10.1007/11495628_13","title":"From MSC to SDL: Overview and an Application to the Autonomous Shuttle Transport System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Systems engineering; Software engineering; Architecture; Programming language; Engineering","score_opus":0.025273967804745532,"score_gpt":0.2879351611787726,"score_spread":0.26266119337402705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528299167","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.005702219,0.0056313532,0.94407684,0.0015599327,0.00029397508,0.00007524108,0.00033902802,0.006120226,0.03620124],"genre_scores_gemma":[0.20354214,0.015053837,0.7314354,0.0013917058,0.001018585,0.0003408231,0.0013958036,0.003319977,0.042501792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993605,0.00013551138,0.00007028469,0.000082574115,0.0003114324,0.00003976978],"domain_scores_gemma":[0.99908257,0.00048004228,0.00005836773,0.00013615498,0.00019803368,0.00004479214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545469,0.00058480236,0.00047876526,0.0010917677,0.0003543894,0.0026047865,0.0010312265,0.00075229903,0.0073372917],"category_scores_gemma":[0.0024479982,0.00041906626,0.00049470225,0.0019101631,0.0011019785,0.0026324452,0.0018090688,0.0019214144,0.0023987268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000840116,0.000087870605,0.000464914,0.0006509931,0.000020940819,0.0002977696,0.0004719375,0.025514355,0.0052557583,0.34445566,0.028726215,0.5939696],"study_design_scores_gemma":[0.000071240815,0.00013690472,0.0002761535,0.00037412092,0.000037895585,0.0005857006,0.00016528608,0.19836904,0.016521811,0.3405754,0.44282937,0.000057041427],"about_ca_topic_score_codex":0.0018995508,"about_ca_topic_score_gemma":0.0025485975,"teacher_disagreement_score":0.0073372917,"about_ca_system_score_codex":0.0007318283,"about_ca_system_score_gemma":0.001004713,"threshold_uncertainty_score":0.02454573},"labels":[],"label_agreement":null},{"id":"W1528323501","doi":"10.1007/978-3-540-79547-6_22","title":"Evaluating Multiview Reconstruction","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer vision; Focus (optics); Computer science; License; Artificial intelligence; Ground truth; Code (set theory); Iterative reconstruction; 3D reconstruction; State (computer science); Computer graphics (images); Algorithm","score_opus":0.05268832062113673,"score_gpt":0.3333461659364914,"score_spread":0.2806578453153547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528323501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033405416,0.0028691625,0.9556915,0.0003812091,0.00021326359,0.00007191962,0.000470853,0.0021243207,0.0047723386],"genre_scores_gemma":[0.36871275,0.002260999,0.61301905,0.0002276011,0.00032119252,0.000081265425,0.002898762,0.0009306732,0.011547619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981585,0.0004765495,0.000101411104,0.00036394756,0.0007645701,0.00013494898],"domain_scores_gemma":[0.99774855,0.0010711467,0.00014295547,0.0004312859,0.0004919032,0.00011411304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024840094,0.0014106145,0.0023864873,0.0018309662,0.0003947867,0.0027175392,0.0013609392,0.0019096733,0.011949776],"category_scores_gemma":[0.008094859,0.00080741895,0.0011045928,0.0014089093,0.0007564422,0.0021123346,0.0021648388,0.0009904909,0.0024572122],"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.00072459487,0.00008216292,0.0014779043,0.00023695947,0.00024747488,0.0001211712,0.000035403744,0.1266146,0.018363178,0.0090397755,0.009069399,0.8339874],"study_design_scores_gemma":[0.000027206906,0.00013631023,0.0009848339,0.000046042784,0.00007526654,0.00033451043,0.00004650642,0.9652332,0.01581253,0.014012598,0.0032705974,0.000020369533],"about_ca_topic_score_codex":0.0028131374,"about_ca_topic_score_gemma":0.0037008612,"teacher_disagreement_score":0.011949776,"about_ca_system_score_codex":0.0008030931,"about_ca_system_score_gemma":0.00084103114,"threshold_uncertainty_score":0.039976},"labels":[],"label_agreement":null},{"id":"W1528367647","doi":"10.1007/978-3-540-69812-8_1","title":"DIAR: Advances in Degradation Modeling and Processing","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Media Forensic Detection","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Key (lock); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Degradation (telecommunications); Process (computing); Software; Shadow (psychology); State (computer science); Computer vision; Algorithm; Telecommunications; Computer security","score_opus":0.014635738112283327,"score_gpt":0.23175221350149655,"score_spread":0.21711647538921322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528367647","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.0007967179,0.00972904,0.9820349,0.00027272396,0.00044722605,0.000019414483,0.00020200762,0.0030012673,0.0034965393],"genre_scores_gemma":[0.03425708,0.025884982,0.89929295,0.00061161467,0.0021879538,0.00012302253,0.002406211,0.0022462658,0.03298997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901605,0.00011659735,0.00006248927,0.00021338084,0.0005466948,0.00004465413],"domain_scores_gemma":[0.99861276,0.0004433081,0.00009852968,0.00035456326,0.00045274405,0.000038042697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014407145,0.0017777662,0.0017814832,0.0016891346,0.00032804967,0.0021944905,0.0021995364,0.0016012067,0.008321691],"category_scores_gemma":[0.0025346025,0.00081672287,0.00084021734,0.0027742404,0.00060720637,0.0028485074,0.0012523136,0.002514686,0.009171087],"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.00004864336,0.00006481085,0.00031936908,0.00035267894,0.000051045372,0.0000708832,0.00006399002,0.024185954,0.008489586,0.014871203,0.037957877,0.9135239],"study_design_scores_gemma":[0.000020170499,0.00011801066,0.0011102374,0.00019031238,0.00009137055,0.00081226125,0.00005202772,0.66170603,0.03264055,0.042311616,0.2608502,0.00009719612],"about_ca_topic_score_codex":0.0009528914,"about_ca_topic_score_gemma":0.0009253594,"teacher_disagreement_score":0.008321691,"about_ca_system_score_codex":0.00041594397,"about_ca_system_score_gemma":0.000565924,"threshold_uncertainty_score":0.027838886},"labels":[],"label_agreement":null},{"id":"W1528400844","doi":"10.1007/11693383_13","title":"Tree-Based Key Distribution Patterns","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Tree (set theory); Probabilistic logic; Cover (algebra); Scheme (mathematics); Computer science; Upper and lower bounds; Row; Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.011134986725316567,"score_gpt":0.21994532448647866,"score_spread":0.2088103377611621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528400844","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.034637563,0.00033098247,0.9506401,0.0004427221,0.0001582012,0.00028947805,0.0008683227,0.0020824198,0.010550293],"genre_scores_gemma":[0.53467363,0.0007561842,0.44534215,0.00028807722,0.00008371613,0.0004151674,0.002334866,0.00054129475,0.01556493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986771,0.00023214353,0.0001532506,0.00022188692,0.00051610434,0.00019951614],"domain_scores_gemma":[0.9948991,0.0014087674,0.00039687447,0.0019125593,0.0011713449,0.00021141702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774021,0.00039358874,0.0006302855,0.0011420295,0.00081737887,0.0017325274,0.001449444,0.0007593579,0.006755259],"category_scores_gemma":[0.006989358,0.0004359872,0.0003746097,0.0023290585,0.0005504838,0.0036234153,0.0015971861,0.0011117962,0.0028122317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011204452,0.00030211973,0.0032761921,0.0004396508,0.000068043584,0.0003385117,0.0004044286,0.03673598,0.032905392,0.2882111,0.027006164,0.6091919],"study_design_scores_gemma":[0.00018302226,0.00045695322,0.0016605732,0.00012694592,0.00009284595,0.0019249755,0.00025621877,0.4582029,0.044445306,0.437359,0.05520233,0.0000889559],"about_ca_topic_score_codex":0.00055150583,"about_ca_topic_score_gemma":0.0009986431,"teacher_disagreement_score":0.006755259,"about_ca_system_score_codex":0.0006995655,"about_ca_system_score_gemma":0.0010196107,"threshold_uncertainty_score":0.022598624},"labels":[],"label_agreement":null},{"id":"W1528455415","doi":"10.1007/978-3-540-93900-9_24","title":"A Scalable Memory Model for Low-Level Code","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Code (set theory); Scalability; Parallel computing; Programming language; Operating system","score_opus":0.040442354558481004,"score_gpt":0.26696342567454723,"score_spread":0.22652107111606623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528455415","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.024826579,0.00072588807,0.95165795,0.0007991591,0.00013517556,0.00008255296,0.00032723893,0.0017759997,0.019669393],"genre_scores_gemma":[0.649278,0.0011117909,0.32296085,0.0004331833,0.00027804938,0.0005912622,0.00068648765,0.0011140733,0.023546316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957985,0.00008707039,0.00002013836,0.000058962152,0.00017761867,0.00007627403],"domain_scores_gemma":[0.9990239,0.00036157423,0.000075164,0.00029495635,0.00018042258,0.00006399558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005176656,0.0006718052,0.00081746175,0.00058621285,0.00071608904,0.0017226967,0.0027516806,0.0013038141,0.009839296],"category_scores_gemma":[0.0031143911,0.0005237036,0.0007522861,0.00097449956,0.0009645319,0.003386787,0.001466818,0.0019390566,0.0014768534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011487809,0.00007781963,0.0002314459,0.000122054524,0.000024363693,0.00009177529,0.000080460595,0.6077715,0.003941432,0.35447702,0.006425666,0.02664165],"study_design_scores_gemma":[0.000009648912,0.000008653056,0.000023734747,0.000004473829,0.000004728136,0.0000097920965,0.000005500228,0.92562765,0.00039654758,0.07281214,0.0010931189,0.0000039626852],"about_ca_topic_score_codex":0.0030955458,"about_ca_topic_score_gemma":0.0035087848,"teacher_disagreement_score":0.009839296,"about_ca_system_score_codex":0.0010809111,"about_ca_system_score_gemma":0.0012528265,"threshold_uncertainty_score":0.03291571},"labels":[],"label_agreement":null},{"id":"W1528498604","doi":"10.1007/11908029_56","title":"On a Parthood Specification Method for Component Software","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Component (thermodynamics); Software; Component-based software engineering; Programming language; Software engineering; Software development","score_opus":0.04075463974642257,"score_gpt":0.2993747549880432,"score_spread":0.25862011524162065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528498604","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.00064981,0.000063050196,0.997127,0.00006471434,0.0000267592,0.000029402689,0.00003352376,0.00074802985,0.001257736],"genre_scores_gemma":[0.027311351,0.0003074092,0.9628764,0.00019465997,0.000047327645,0.00017415959,0.00038070616,0.0013438656,0.0073641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974758,0.00075692375,0.0002578314,0.0002835334,0.0010890579,0.0001369024],"domain_scores_gemma":[0.99727136,0.0014255948,0.00008119867,0.0006718379,0.00047971314,0.00007035776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035332362,0.0013279502,0.0008327513,0.0013279236,0.0009706634,0.0023042238,0.0023285677,0.0015666,0.012014537],"category_scores_gemma":[0.0058160513,0.0014257507,0.0020949754,0.0015989039,0.0019784246,0.005528067,0.0023619428,0.004247345,0.003954064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020503253,0.000080051395,0.00047429538,0.0004325169,0.00005455008,0.00023242204,0.0008048639,0.014798425,0.014020811,0.51395863,0.012668167,0.44227025],"study_design_scores_gemma":[0.00015080524,0.00022455637,0.0004152079,0.00028351668,0.00014454318,0.00061634707,0.00019751381,0.21328409,0.022858657,0.60758615,0.15410908,0.00012953617],"about_ca_topic_score_codex":0.002819938,"about_ca_topic_score_gemma":0.0034845404,"teacher_disagreement_score":0.012014537,"about_ca_system_score_codex":0.0008869865,"about_ca_system_score_gemma":0.0016447807,"threshold_uncertainty_score":0.040192604},"labels":[],"label_agreement":null},{"id":"W1528514856","doi":"10.1007/11589990_129","title":"Mining with Constraints by Pruning and Avoiding Ineffectual Processing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Alberta","funders":"","keywords":"Computer science; Pruning; Set (abstract data type); Association rule learning; Dual (grammatical number); Data mining; Algorithm; Theoretical computer science; Programming language","score_opus":0.012739291039529406,"score_gpt":0.23789444974604876,"score_spread":0.22515515870651936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528514856","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.040047433,0.0009100279,0.9497389,0.0011074472,0.0001448325,0.00045836926,0.0007271317,0.0024182785,0.00444756],"genre_scores_gemma":[0.115517475,0.0003917594,0.8781191,0.00041000394,0.00014987419,0.00032673028,0.002055178,0.0005146816,0.0025152052],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916712,0.0024234804,0.0008006238,0.0010832378,0.0034297719,0.000591655],"domain_scores_gemma":[0.9660885,0.021422168,0.001210519,0.00806356,0.0028294302,0.00038591382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006007128,0.0016314619,0.0028489055,0.0031484985,0.0017767737,0.003915298,0.0052537476,0.0022432383,0.0041376916],"category_scores_gemma":[0.04284527,0.0016784007,0.0024485688,0.0048378254,0.0017180141,0.006649202,0.0033235825,0.0034876077,0.0015628472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007646503,0.00058461115,0.008009093,0.0010206832,0.00045874622,0.0013172481,0.0004785815,0.09244013,0.013296194,0.054448895,0.023050409,0.80413073],"study_design_scores_gemma":[0.0001725636,0.00017540749,0.0017215447,0.00020391995,0.00035515867,0.0010976328,0.000223892,0.72927624,0.017100561,0.23156382,0.018043011,0.000066288216],"about_ca_topic_score_codex":0.0024945673,"about_ca_topic_score_gemma":0.007038993,"teacher_disagreement_score":0.006007128,"about_ca_system_score_codex":0.00070745085,"about_ca_system_score_gemma":0.0038100681,"threshold_uncertainty_score":0.031769156},"labels":[],"label_agreement":null},{"id":"W1528551039","doi":"10.1007/3-540-44798-9_29","title":"Refinement-Based Formal Verification of Asynchronous Wrappers for Independently Clocked Domains in Systems on Chip","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"McGill University","funders":"","keywords":"Asynchronous communication; Computer science; Transfer (computing); Chip; Distributed computing; Data transmission; Computer architecture; Theoretical computer science; Embedded system; Parallel computing; Computer hardware; Computer network; Telecommunications","score_opus":0.021180798399374593,"score_gpt":0.2581024404083027,"score_spread":0.23692164200892812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528551039","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.011267106,0.000060620572,0.9863979,0.00005082031,0.000027104088,0.00009330275,0.000032291187,0.0012293286,0.0008414423],"genre_scores_gemma":[0.44109926,0.00021079263,0.554275,0.00011031747,0.000032287797,0.00027439318,0.00023145521,0.000575539,0.0031909507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955902,0.001616399,0.0003115493,0.00045615243,0.0016041152,0.00042158144],"domain_scores_gemma":[0.9883944,0.007554534,0.00047376275,0.0022235552,0.001258952,0.00009477143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004393663,0.0010276884,0.00096153485,0.0009151315,0.0007127489,0.0013559659,0.0027649044,0.001188815,0.0029804842],"category_scores_gemma":[0.010828593,0.0013391039,0.0022237687,0.000539465,0.003021294,0.0028329282,0.002108882,0.0023444167,0.00068330666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008001384,0.00024071628,0.0019391368,0.00091081817,0.00019926226,0.00058460963,0.0012656322,0.45993775,0.07822711,0.2941085,0.0030812817,0.1587051],"study_design_scores_gemma":[0.00017755388,0.00019670806,0.0003648861,0.0000879279,0.00013066432,0.0001560684,0.000086978966,0.82271785,0.079049185,0.09126554,0.0057054036,0.000061214334],"about_ca_topic_score_codex":0.0044886,"about_ca_topic_score_gemma":0.0051417155,"teacher_disagreement_score":0.0044886,"about_ca_system_score_codex":0.0011754413,"about_ca_system_score_gemma":0.001723719,"threshold_uncertainty_score":0.023236215},"labels":[],"label_agreement":null},{"id":"W1528593243","doi":"10.1007/978-3-540-24596-4_51","title":"Web Page Characteristics-Based Scheduling","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Web page; Web server; Scheduling (production processes); World Wide Web; Static web page; Distributed computing; Web development; The Internet; Engineering","score_opus":0.017696514795980268,"score_gpt":0.23830857065212405,"score_spread":0.22061205585614377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528593243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12729786,0.0019193671,0.81720895,0.0005248148,0.0005392236,0.00036134064,0.00073730614,0.010893234,0.040518027],"genre_scores_gemma":[0.805423,0.00043724044,0.18196292,0.00012486547,0.00021212458,0.00013857208,0.00086650054,0.001117095,0.009717766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887043,0.00026468927,0.000061275896,0.00016135028,0.00045531063,0.00018682204],"domain_scores_gemma":[0.9967873,0.0011232409,0.00020020345,0.00077248673,0.0007373792,0.00037937268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011782965,0.0007415066,0.0011925402,0.0017200647,0.0009526564,0.0017178099,0.001854021,0.0005690628,0.0056274813],"category_scores_gemma":[0.004442806,0.00054575317,0.0003685724,0.0030775063,0.0004362843,0.0018873726,0.0008779922,0.0008789937,0.0021042419],"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.002138057,0.0008665075,0.0039497293,0.0002523508,0.00009227774,0.00011793591,0.00015346547,0.3455639,0.033295687,0.023422355,0.027825776,0.56232196],"study_design_scores_gemma":[0.00007608036,0.00012731274,0.0013174405,0.000011814709,0.000037331018,0.00007428948,0.000048469694,0.96353996,0.0110710105,0.017215641,0.006453086,0.000027581298],"about_ca_topic_score_codex":0.0034866303,"about_ca_topic_score_gemma":0.00620609,"teacher_disagreement_score":0.0056274813,"about_ca_system_score_codex":0.0013442738,"about_ca_system_score_gemma":0.0015080824,"threshold_uncertainty_score":0.018825829},"labels":[],"label_agreement":null},{"id":"W1528603915","doi":"10.1007/11844297_76","title":"Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP): A New Developmental Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Probabilistic logic; Genetic programming; Artificial intelligence","score_opus":0.024729963209635122,"score_gpt":0.21980290430136165,"score_spread":0.19507294109172651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528603915","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.0036924006,0.00027745133,0.9878071,0.00019405576,0.00004462346,0.0000182223,0.00001818827,0.000116237345,0.007831754],"genre_scores_gemma":[0.12359915,0.0008320637,0.86744267,0.00017850577,0.000048129248,0.00016474375,0.0000633723,0.000120149576,0.007551166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997203,0.000084153406,0.000012552082,0.00006702732,0.0000986509,0.000017344966],"domain_scores_gemma":[0.99956554,0.00024995676,0.000030834486,0.000046510442,0.000081807935,0.000025224716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054290297,0.00038811626,0.0003328149,0.0003985226,0.0003037937,0.0007451288,0.0013473443,0.00082028256,0.0026834845],"category_scores_gemma":[0.00228441,0.00027399583,0.00037163033,0.0006168029,0.00090674625,0.00080688053,0.0012470833,0.0014087108,0.00035664614],"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.000018538094,0.000035766385,0.0006125985,0.00014802067,0.000027972126,0.00008703296,0.00020655422,0.13006584,0.0078741945,0.6159932,0.0024924881,0.24243785],"study_design_scores_gemma":[0.000013990325,0.000091174974,0.0003679029,0.00006713985,0.0000343621,0.00030204764,0.00005813757,0.66120964,0.0046508773,0.3033304,0.029845664,0.00002873041],"about_ca_topic_score_codex":0.00077587366,"about_ca_topic_score_gemma":0.0009787052,"teacher_disagreement_score":0.0026834845,"about_ca_system_score_codex":0.00047392165,"about_ca_system_score_gemma":0.0008232567,"threshold_uncertainty_score":0.008977175},"labels":[],"label_agreement":null},{"id":"W1528606113","doi":"10.1007/978-3-540-39763-2_4","title":"Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Sensitivity (control systems); Computer science; Extension (predicate logic); Sequence (biology); Coding (social sciences); Pairwise comparison; Algorithm; Multiple sequence alignment; Smith–Waterman algorithm; Statistical model; Sequence alignment; Theoretical computer science; Artificial intelligence; Mathematics; Genetics; Biology","score_opus":0.014323524545287255,"score_gpt":0.2368412800542062,"score_spread":0.22251775550891895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528606113","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.017373437,0.0013425195,0.9344137,0.00014085225,0.00038025776,0.00017355617,0.0011554472,0.04151857,0.0035016572],"genre_scores_gemma":[0.089680366,0.0014038272,0.87549317,0.00036589324,0.00013840024,0.00036995567,0.004653888,0.009568652,0.018325811],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852484,0.00020708526,0.00014688158,0.00049671106,0.0005376077,0.000086995824],"domain_scores_gemma":[0.99741554,0.00108479,0.00026038507,0.00069750607,0.0003759288,0.00016577463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013975318,0.0020634837,0.0017139096,0.0011488468,0.00037022648,0.0016021316,0.001835114,0.0017166964,0.014283236],"category_scores_gemma":[0.0035492058,0.0017361483,0.0008937914,0.0012279401,0.00061695656,0.001940375,0.0011446865,0.0019239107,0.014649056],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054985046,0.000111351466,0.0005584995,0.0004349167,0.00004501813,0.00013975184,0.000042935546,0.00071952696,0.85863453,0.002567611,0.007516074,0.12867981],"study_design_scores_gemma":[0.000079852805,0.00016745891,0.0008442472,0.000029447341,0.00010384768,0.0021379045,0.000015785357,0.015471193,0.9379917,0.0027873379,0.040275965,0.00009517156],"about_ca_topic_score_codex":0.00045246354,"about_ca_topic_score_gemma":0.0007893795,"teacher_disagreement_score":0.014283236,"about_ca_system_score_codex":0.00031460047,"about_ca_system_score_gemma":0.00037887116,"threshold_uncertainty_score":0.047782183},"labels":[],"label_agreement":null},{"id":"W1528709073","doi":"10.1007/3-540-46416-6_30","title":"An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":96,"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":"S-box; Cryptosystem; Set (abstract data type); Differential (mechanical device); Computer science; Computer security; Relation (database); Theoretical computer science; Information security; Cryptography; Data mining; Engineering; Block cipher; Programming language","score_opus":0.028167212938885026,"score_gpt":0.2850306899984802,"score_spread":0.25686347705959517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528709073","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.03903657,0.0009155512,0.9082797,0.00072702765,0.00015092362,0.00020145201,0.00015743145,0.00037433655,0.050157048],"genre_scores_gemma":[0.63238364,0.0008988115,0.3537608,0.00045108228,0.0003100305,0.00033543364,0.00019275509,0.00017394437,0.011493438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592835,0.001354087,0.00033989886,0.0004975141,0.0016384267,0.0002416993],"domain_scores_gemma":[0.99034786,0.005444778,0.00087678083,0.0012088687,0.0018305244,0.00029116846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003922635,0.0011187589,0.0017990926,0.0035910357,0.0011239884,0.004110843,0.0011697815,0.002130851,0.004575797],"category_scores_gemma":[0.011554914,0.00047600223,0.001113129,0.0022199326,0.0029204462,0.004236923,0.001891672,0.0018096571,0.000919258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012796264,0.000047058216,0.00044525473,0.00020094695,0.000028429293,0.00011308118,0.00011626135,0.020572973,0.006946879,0.9172541,0.0022032892,0.051943764],"study_design_scores_gemma":[0.00004467757,0.000264314,0.00029294807,0.00011818452,0.000039588023,0.00034190094,0.000053591717,0.1509701,0.006349791,0.8329679,0.008504556,0.000052400716],"about_ca_topic_score_codex":0.00026140356,"about_ca_topic_score_gemma":0.00028739774,"teacher_disagreement_score":0.004575797,"about_ca_system_score_codex":0.0014121345,"about_ca_system_score_gemma":0.0010587197,"threshold_uncertainty_score":0.020745158},"labels":[],"label_agreement":null},{"id":"W1528797807","doi":"10.1007/11799573_40","title":"Semantic Property Grammars for Knowledge Extraction from Biomedical Text","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Rule-based machine translation; Parsing; Natural language processing; Property (philosophy); Artificial intelligence; Constraint (computer-aided design); Relationship extraction; L-attributed grammar; Information extraction; Context-free grammar; Mathematics","score_opus":0.01732528293889576,"score_gpt":0.2769781635403407,"score_spread":0.259652880601445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528797807","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.00436767,0.00057255913,0.9823942,0.00037106857,0.00007049595,0.0002197735,0.0023835006,0.007049314,0.002571402],"genre_scores_gemma":[0.07798937,0.0011142015,0.90482295,0.00022522034,0.00007286642,0.0004927172,0.011264096,0.001322831,0.002695801],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.0002906618,0.00018955093,0.00019679937,0.00030018142,0.00005643561],"domain_scores_gemma":[0.99715304,0.0019863609,0.00010665534,0.00044098313,0.0002754383,0.000037593967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014189597,0.00070434186,0.0010449876,0.0020720174,0.00083634653,0.0019219778,0.0016315426,0.0009976351,0.0047954335],"category_scores_gemma":[0.005251194,0.000846304,0.0020341547,0.0024805842,0.0013696854,0.0037832449,0.0020309254,0.0017674075,0.0029002053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001875678,0.0001454331,0.0010163165,0.0015545477,0.0001863598,0.0011712462,0.0012824823,0.030093053,0.011174255,0.30191055,0.034498047,0.6167801],"study_design_scores_gemma":[0.000072069015,0.000048576905,0.0005612481,0.0003349353,0.00016714254,0.0006500473,0.0003435315,0.16117613,0.017159225,0.74785227,0.071567684,0.000067025074],"about_ca_topic_score_codex":0.002345626,"about_ca_topic_score_gemma":0.003172063,"teacher_disagreement_score":0.0047954335,"about_ca_system_score_codex":0.00084615924,"about_ca_system_score_gemma":0.0019733375,"threshold_uncertainty_score":0.016042292},"labels":[],"label_agreement":null},{"id":"W1528954433","doi":"10.1007/978-3-642-15711-0_45","title":"Calibration and Use of Intraoperative Cone-Beam Computed Tomography: An In-Vitro Study for Wrist Fracture","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston General Hospital; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Ontario Innovation Trust","keywords":"Computer science; Computer vision; Cone beam computed tomography; Wrist; Image registration; Medicine; Artificial intelligence; Image-guided surgery; Calibration; Computed tomography; Radiology; Image (mathematics); Mathematics","score_opus":0.009796569011755164,"score_gpt":0.25140328044290466,"score_spread":0.2416067114311495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528954433","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.9881793,0.002089729,0.008529811,0.00004791304,0.00003503,0.00006378461,0.0000897235,0.000031540458,0.0009330724],"genre_scores_gemma":[0.9946911,0.0010427502,0.0036826457,0.000040048573,0.000012373657,0.000030457848,0.00010397751,0.000039353825,0.000357443],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972777,0.0012829188,0.00018291279,0.0002675063,0.00079507806,0.00019383701],"domain_scores_gemma":[0.98515725,0.009439478,0.0011168041,0.0017766758,0.0023132898,0.00019644854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026916207,0.00090409216,0.0006379687,0.0005963297,0.00048098908,0.00069978787,0.0015450382,0.0011718615,0.0014891309],"category_scores_gemma":[0.011180757,0.00074524985,0.00058703194,0.0006924945,0.0011588859,0.0010914697,0.000534087,0.0006927447,0.00043284413],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025211151,0.0013394803,0.01299059,0.00038507636,0.000056319837,0.00076131657,0.0010715792,0.0041718963,0.95601225,0.00024969256,0.00014846413,0.020292215],"study_design_scores_gemma":[0.00007820736,0.00846715,0.046752535,0.000114980394,0.0002928557,0.0038162144,0.0012450392,0.023223076,0.91370404,0.00024618724,0.0019588554,0.00010079453],"about_ca_topic_score_codex":0.0029811547,"about_ca_topic_score_gemma":0.0020916308,"teacher_disagreement_score":0.0029811547,"about_ca_system_score_codex":0.00046159507,"about_ca_system_score_gemma":0.00079855067,"threshold_uncertainty_score":0.014234841},"labels":[],"label_agreement":null},{"id":"W1528962155","doi":"10.1007/978-3-642-04271-3_73","title":"An Object-Based Method for Rician Noise Estimation in MR Images","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Rician fading; Estimator; Artificial intelligence; Noise (video); Robustness (evolution); Wavelet; Ghosting; Computer vision; Pattern recognition (psychology); Algorithm; Mathematics; Statistics; Image (mathematics); Fading","score_opus":0.016022631113417507,"score_gpt":0.3314760099071288,"score_spread":0.31545337879371127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528962155","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.0010769855,0.00012968626,0.9983852,0.000027674858,0.000023774477,0.000011010008,0.000010862691,0.00013855414,0.00019633163],"genre_scores_gemma":[0.026125645,0.0004203608,0.97052985,0.000115346054,0.00008413449,0.000056318742,0.0001287625,0.00016576063,0.0023738202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940646,0.0001255399,0.00003596569,0.00010713621,0.0002869778,0.000037912134],"domain_scores_gemma":[0.9991911,0.00024339677,0.000056808898,0.00014808914,0.00032225344,0.000038438568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013897186,0.0008625235,0.0011169566,0.0013120201,0.00039066176,0.0010801691,0.0014189327,0.0017980575,0.0021134808],"category_scores_gemma":[0.00240022,0.00071161817,0.001133785,0.0011362145,0.00066276785,0.0013310183,0.0012784578,0.0012704555,0.0014796997],"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.0002924001,0.00009369388,0.0005042541,0.00035111926,0.00020449329,0.0001306029,0.00013552813,0.07861642,0.11802092,0.017997809,0.0025589652,0.78109384],"study_design_scores_gemma":[0.000027644164,0.00009119405,0.0006832047,0.000027752018,0.000105020874,0.00033086192,0.000016249833,0.95206773,0.033892438,0.0049056704,0.007794734,0.000057508838],"about_ca_topic_score_codex":0.0021920393,"about_ca_topic_score_gemma":0.002850556,"teacher_disagreement_score":0.0021920393,"about_ca_system_score_codex":0.00045145027,"about_ca_system_score_gemma":0.0008248955,"threshold_uncertainty_score":0.0073496103},"labels":[],"label_agreement":null},{"id":"W1528962822","doi":"10.1007/3-540-45075-0_21","title":"Modeling IETF Session Initiation Protocol and Its Services in SDL","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Session (web analytics); Session Initiation Protocol; Protocol (science); Computer network; World Wide Web; Server","score_opus":0.014794820837036553,"score_gpt":0.24577244163574807,"score_spread":0.2309776207987115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528962822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041942928,0.0007837833,0.9325949,0.0006406901,0.00016156692,0.00023366099,0.00035842523,0.0016841746,0.021599883],"genre_scores_gemma":[0.63494694,0.001814019,0.3405292,0.00029173258,0.00016112662,0.0006543598,0.0012004867,0.0007039984,0.019698128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880195,0.00039720818,0.000090626956,0.00013769379,0.00043123614,0.00014132605],"domain_scores_gemma":[0.9984168,0.0008339064,0.00012622589,0.0002448129,0.00033033092,0.00004793005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018886549,0.0007144344,0.00043636144,0.00094020594,0.0005531239,0.0024455972,0.0016029006,0.0011089267,0.0021175202],"category_scores_gemma":[0.0046822582,0.0007308794,0.0005942924,0.0008638712,0.0006927176,0.004158054,0.00079656293,0.0012859079,0.0007552167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074275886,0.00018418257,0.002180252,0.00013556716,0.00004438499,0.00014004562,0.00036611894,0.62848055,0.0046778587,0.3029397,0.003063083,0.057714],"study_design_scores_gemma":[0.000009808856,0.000015299292,0.00010908316,0.000022035287,0.000021251904,0.000022323435,0.000021206431,0.9606216,0.0017851614,0.030960478,0.00640149,0.000010286025],"about_ca_topic_score_codex":0.011892891,"about_ca_topic_score_gemma":0.009012495,"teacher_disagreement_score":0.011892891,"about_ca_system_score_codex":0.0020816422,"about_ca_system_score_gemma":0.002498361,"threshold_uncertainty_score":0.023647308},"labels":[],"label_agreement":null},{"id":"W1528983063","doi":"10.1007/978-3-642-13437-1_50","title":"Players’ Motivation and EEG Waves Patterns in a Serious Game Environment","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural and Behavioral Psychology Studies","field":"Neuroscience","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":"Université de Montréal","funders":"","keywords":"Electroencephalography; Computer science; Spectral analysis; Power (physics); Brain waves; Statistical analysis; Spectral density; Psychology; Statistics; Mathematics; Telecommunications; Physics","score_opus":0.055466245728306496,"score_gpt":0.2867906764771359,"score_spread":0.2313244307488294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528983063","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.99905795,0.000024083032,0.00024247452,0.000013369437,0.0000033646531,0.0000060598313,0.00007846511,0.000006165188,0.0005680718],"genre_scores_gemma":[0.99897134,0.00002031512,0.00017639455,0.000010623932,0.000003207588,0.0000081830785,0.0000766659,0.0000042219526,0.0007290203],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9999459,0.000013122889,0.0000021854967,0.000014175835,0.000009783534,0.000014885419],"domain_scores_gemma":[0.9997887,0.00008043431,0.00002849128,0.000007004678,0.000021592701,0.00007386221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008272814,0.0002250781,0.00016100206,0.0001490828,0.00016105977,0.00043931662,0.00016337697,0.00019685739,0.0018589533],"category_scores_gemma":[0.0005862408,0.00012646482,0.00009186442,0.00014364548,0.00017753629,0.00014675586,0.00024823388,0.00030204444,0.00023316052],"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.017273897,0.0039747995,0.27822402,0.00021311667,0.00042563313,0.0027211143,0.0034295872,0.0021402638,0.63456887,0.0013232429,0.0026894123,0.053016033],"study_design_scores_gemma":[0.00006389648,0.0014934016,0.98648226,0.0000090219455,0.000048558868,0.00059152296,0.0006618261,0.003795401,0.0058219433,0.00054302585,0.00046952502,0.000019628222],"about_ca_topic_score_codex":0.0015377525,"about_ca_topic_score_gemma":0.0027197616,"teacher_disagreement_score":0.0018589533,"about_ca_system_score_codex":0.000100569465,"about_ca_system_score_gemma":0.000077565244,"threshold_uncertainty_score":0.006218791},"labels":[],"label_agreement":null},{"id":"W1528987358","doi":"10.1007/11555223_16","title":"Environmentally-Aware Security Enforcement (EASE) for Cooperative Design and Engineering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"National Research Council Canada","funders":"","keywords":"Computer science; Context (archaeology); Enforcement; Computer security; Domain (mathematical analysis); Security engineering; Security policy; Software security assurance; Work (physics); Usability; Information security; Security service; Software engineering; Engineering management; Human–computer interaction; Engineering","score_opus":0.018422593034678296,"score_gpt":0.23403320333929944,"score_spread":0.21561061030462114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528987358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008881416,0.00014279541,0.9789686,0.00015929509,0.000031883603,0.00007756599,0.000018598641,0.0011593878,0.010560414],"genre_scores_gemma":[0.301073,0.00029225525,0.68587387,0.00014651757,0.000036766272,0.00021944735,0.00007902606,0.00031176212,0.011967356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836296,0.0004361942,0.000094021416,0.00025798933,0.0006879193,0.0001609366],"domain_scores_gemma":[0.99770653,0.00062373275,0.00019630749,0.0012219135,0.0001808847,0.000070527414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328763,0.00070364814,0.0005395655,0.00054932735,0.0007781238,0.0013256946,0.0014074778,0.00100338,0.0033615846],"category_scores_gemma":[0.003579488,0.00063084165,0.0008276697,0.00037661384,0.0015987692,0.0022220502,0.0044527403,0.0021270472,0.0006898653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012212049,0.0002471754,0.0013341083,0.0002791583,0.00006755592,0.00033552485,0.0007837353,0.0787355,0.027840717,0.63017476,0.0035849863,0.25649464],"study_design_scores_gemma":[0.00007110101,0.00020758822,0.0007859633,0.00013656139,0.00011764471,0.0005814743,0.00022521372,0.4082046,0.049724314,0.47259355,0.06726695,0.000085022286],"about_ca_topic_score_codex":0.0006395723,"about_ca_topic_score_gemma":0.0018456338,"teacher_disagreement_score":0.0033615846,"about_ca_system_score_codex":0.00047616806,"about_ca_system_score_gemma":0.0011424011,"threshold_uncertainty_score":0.011245608},"labels":[],"label_agreement":null},{"id":"W1529028926","doi":"10.1007/978-3-540-87734-9_44","title":"Image Denoising Using Neighbouring Contourlet Coefficients","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","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":"Concordia University","funders":"","keywords":"Contourlet; Computer science; Image denoising; Noise reduction; Artificial intelligence; Computer vision; Image (mathematics); Pattern recognition (psychology); Wavelet; Wavelet transform","score_opus":0.013734670255425166,"score_gpt":0.24516549636796156,"score_spread":0.2314308261125364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529028926","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.014297442,0.0005980549,0.9774439,0.000081499405,0.00017782749,0.00003815828,0.000041325726,0.00044792113,0.0068738805],"genre_scores_gemma":[0.12904614,0.0021948565,0.8434595,0.00013154554,0.0001273605,0.000043864595,0.00025838177,0.00041679392,0.024321502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997986,0.000018284243,0.0000096591875,0.000035521647,0.00012413453,0.0000137882525],"domain_scores_gemma":[0.99956673,0.00012578907,0.000025037969,0.000106748776,0.00015822823,0.000017512708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051045953,0.00059758534,0.0005794217,0.00074731687,0.00022247747,0.00092571165,0.00055921206,0.00078485033,0.004277947],"category_scores_gemma":[0.0014325038,0.0003300067,0.00058433966,0.00087208,0.00046431902,0.0009858885,0.0005275171,0.0011024316,0.002341258],"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.00018990668,0.0000741195,0.00030248243,0.00032791047,0.000046346497,0.00016060399,0.000116862735,0.018462522,0.38527745,0.0244328,0.0030130546,0.5675959],"study_design_scores_gemma":[0.000024949946,0.00021880966,0.0017025993,0.00010797735,0.00014074202,0.0013071068,0.00006203084,0.5364602,0.40615138,0.019587422,0.034185093,0.00005170464],"about_ca_topic_score_codex":0.0004288927,"about_ca_topic_score_gemma":0.000804918,"teacher_disagreement_score":0.004277947,"about_ca_system_score_codex":0.00021599595,"about_ca_system_score_gemma":0.00024696358,"threshold_uncertainty_score":0.014311135},"labels":[],"label_agreement":null},{"id":"W1529126210","doi":"10.1007/978-3-540-24677-0_34","title":"Integration of an Interactive Multimedia Datacasting System","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Unicast; Multicast; Software; Multimedia; Multimedia Broadcast Multicast Service; Computer network; Digital multimedia broadcasting; Interactive media; Data flow diagram; Embedded system; Operating system; Channel (broadcasting)","score_opus":0.031293132906677644,"score_gpt":0.3337557035970976,"score_spread":0.30246257069042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529126210","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08259865,0.0005984847,0.8583199,0.00023858775,0.00038678612,0.00032241628,0.00036559821,0.035159525,0.022010133],"genre_scores_gemma":[0.5779584,0.00048924756,0.3786032,0.0002860933,0.00029228991,0.0003125721,0.001564364,0.0014730609,0.039020773],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999532,0.000057757064,0.000031393945,0.00008371702,0.00023254221,0.00006258896],"domain_scores_gemma":[0.9993735,0.00014413033,0.00002214663,0.00014866199,0.00020991248,0.00010160825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053304667,0.00064872246,0.0007578394,0.00096865767,0.00045389775,0.0013194846,0.0014972407,0.0008588352,0.010328357],"category_scores_gemma":[0.0012328923,0.00047987417,0.0004366814,0.0005723428,0.00018208462,0.00093558145,0.0012416011,0.0006945907,0.0020526522],"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.0023805953,0.0007918388,0.0026908848,0.00027392476,0.00020815224,0.00063663186,0.00048473498,0.019362614,0.39432505,0.009464149,0.012878423,0.556503],"study_design_scores_gemma":[0.00029140618,0.00081058487,0.0034003933,0.00006044203,0.00046904778,0.0008190759,0.00013118418,0.57451653,0.31429318,0.0057172705,0.09934684,0.00014409014],"about_ca_topic_score_codex":0.0024650944,"about_ca_topic_score_gemma":0.0015333921,"teacher_disagreement_score":0.010328357,"about_ca_system_score_codex":0.00041545217,"about_ca_system_score_gemma":0.00052771706,"threshold_uncertainty_score":0.0345518},"labels":[],"label_agreement":null},{"id":"W1529164554","doi":"10.1007/978-3-540-31843-9_3","title":"Hexagonal Grid Drawings: Algorithms and Lower Bounds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Hexagonal crystal system; Grid; Hexagonal tiling; Combinatorics; Focus (optics); Simple (philosophy); Graph; Mathematics; Lattice graph; Simple graph; Algorithm; Computer science; Discrete mathematics; Geometry; Line graph; Physics; Optics; Voltage graph","score_opus":0.012093589034696475,"score_gpt":0.24060870073593615,"score_spread":0.22851511170123967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529164554","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.01085078,0.012740095,0.8554113,0.0023419654,0.00079076283,0.0003660553,0.0016702192,0.0028260811,0.11300278],"genre_scores_gemma":[0.13562925,0.018290812,0.7745626,0.0009309799,0.0012619677,0.0012256164,0.0049327337,0.0028686377,0.060297407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516654,0.0012370886,0.00020155741,0.0006024085,0.0021318197,0.00066052406],"domain_scores_gemma":[0.9824212,0.011354063,0.0008187447,0.0032489381,0.0015889758,0.00056807324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029055632,0.004052815,0.0035897135,0.004484266,0.0023293311,0.0106350975,0.009064327,0.003971642,0.043775383],"category_scores_gemma":[0.024833256,0.0027889158,0.0021468021,0.013435452,0.002898944,0.012657654,0.0069373935,0.009194988,0.014898292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046237142,0.0003740572,0.00088532374,0.0012571053,0.00010012739,0.000120309494,0.00031020623,0.11334271,0.0019671272,0.40315324,0.099632,0.37839532],"study_design_scores_gemma":[0.0001353599,0.00009013585,0.00052732875,0.00027828928,0.0001365689,0.00032812264,0.00021980739,0.39344504,0.003136557,0.5518725,0.049761146,0.00006907411],"about_ca_topic_score_codex":0.0048809103,"about_ca_topic_score_gemma":0.008068037,"teacher_disagreement_score":0.043775383,"about_ca_system_score_codex":0.004331753,"about_ca_system_score_gemma":0.0027727806,"threshold_uncertainty_score":0.14644325},"labels":[],"label_agreement":null},{"id":"W1529172590","doi":"10.1007/978-3-540-76888-3_43","title":"Issues in Location-Based Indexing for Co-operating Mobile Information Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Search engine indexing; Context (archaeology); World Wide Web; Tourism; Information system; Mobile device; Information access; Mobile computing; Computer network; Geography; Engineering","score_opus":0.020834333248542877,"score_gpt":0.28227208832324885,"score_spread":0.26143775507470596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529172590","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.035985913,0.042173874,0.78876245,0.033448447,0.0033590815,0.00049843796,0.0010894261,0.005329981,0.08935234],"genre_scores_gemma":[0.6079048,0.017643413,0.3253268,0.0018299057,0.005262999,0.0004615594,0.001367528,0.0014818683,0.03872122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9854977,0.0043502143,0.0015912816,0.0012938138,0.005528214,0.0017388564],"domain_scores_gemma":[0.9311668,0.03823498,0.0021712892,0.016699668,0.010237654,0.001489534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018077683,0.00097040355,0.0035076346,0.004239463,0.0060196775,0.024455102,0.010130034,0.008803928,0.021595376],"category_scores_gemma":[0.06925945,0.0019098059,0.0013699182,0.012197091,0.005280385,0.047047038,0.0068693124,0.0047650584,0.008362668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029355843,0.00030505852,0.0020079874,0.0005477969,0.000059420923,0.00030514738,0.0014154577,0.016826503,0.002393385,0.5832512,0.05237028,0.34022412],"study_design_scores_gemma":[0.00009836256,0.00022471094,0.0019653966,0.00045415113,0.0001437995,0.0018237823,0.0046111187,0.21030411,0.008904848,0.6453938,0.12576877,0.00030715868],"about_ca_topic_score_codex":0.0120512815,"about_ca_topic_score_gemma":0.010328542,"teacher_disagreement_score":0.024455102,"about_ca_system_score_codex":0.005743089,"about_ca_system_score_gemma":0.0045878254,"threshold_uncertainty_score":0.095605075},"labels":[],"label_agreement":null},{"id":"W1529317038","doi":"10.1007/bfb0024183","title":"Elementary logic programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":43,"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; Université de Moncton","funders":"","keywords":"Computer science; Program transformation; Elementary function; Simple (philosophy); Set (abstract data type); Transformation (genetics); Programming language; Resolution (logic); Logic program; Algebraic semantics; Elementary proof; Arrow; Algebraic number; Binary number; Theoretical computer science; Algebra over a field; Semantics (computer science); Arithmetic; Mathematics; Discrete mathematics; Logic programming; Pure mathematics","score_opus":0.02676493108707163,"score_gpt":0.2527745699862982,"score_spread":0.2260096388992266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529317038","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006636164,0.0020878431,0.22443028,0.0013973045,0.0003121412,0.0001224802,0.0014504221,0.0019421801,0.76162124],"genre_scores_gemma":[0.22536784,0.005271395,0.15558112,0.0012901722,0.00054854807,0.00032095748,0.005234974,0.0011588071,0.6052262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966216,0.000047987272,0.00001988083,0.00008857705,0.00013952453,0.000041841475],"domain_scores_gemma":[0.9996612,0.000116932526,0.00001506408,0.00007751326,0.00010115257,0.000028190496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037725148,0.00067550124,0.00050604617,0.000909893,0.0009308622,0.0034085487,0.001002458,0.0006332491,0.051662054],"category_scores_gemma":[0.0012869383,0.00050814,0.00057047745,0.0011180494,0.0012784591,0.004175902,0.0013833407,0.0023765462,0.015452921],"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.00001745819,0.00002657186,0.00007936343,0.00008836583,0.0000049294867,0.000028988397,0.00016351797,0.00027137334,0.0006214393,0.9249514,0.018000925,0.055745654],"study_design_scores_gemma":[0.0000138150435,0.000012207904,0.00016861447,0.00006220894,0.0000117426025,0.00013842745,0.0000631265,0.0011767176,0.0015587205,0.72455424,0.2722332,0.000006970112],"about_ca_topic_score_codex":0.0005724366,"about_ca_topic_score_gemma":0.0008855893,"teacher_disagreement_score":0.051662054,"about_ca_system_score_codex":0.0009904098,"about_ca_system_score_gemma":0.0007548134,"threshold_uncertainty_score":0.17282683},"labels":[],"label_agreement":null},{"id":"W1529376368","doi":"10.1007/978-3-642-00867-2_2","title":"Reasoning about System-Degradation and Fault-Recovery with Deontic Logic","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Formalism (music); Obligation; Fault tolerance; Duty; Artificial intelligence; Theoretical computer science; Epistemology; Distributed computing; Philosophy; Law; Political science","score_opus":0.016032991446587878,"score_gpt":0.25047559151703247,"score_spread":0.2344426000704446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529376368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017369991,0.00045329376,0.9688292,0.0010734862,0.00010586677,0.000090194626,0.0002054521,0.00091165217,0.0109607745],"genre_scores_gemma":[0.58180815,0.0008510185,0.4071455,0.0005240309,0.00018113598,0.00015010287,0.0007938877,0.00030478075,0.008241326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965429,0.0010192633,0.00032577768,0.0004515551,0.00128174,0.00037890926],"domain_scores_gemma":[0.99279684,0.0053685876,0.00038478937,0.0008454753,0.00049528945,0.00010906775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580214,0.0011945366,0.0007930245,0.0012372095,0.0011488326,0.0034347824,0.0025827067,0.0018371239,0.0032137],"category_scores_gemma":[0.012149779,0.001065396,0.0029373625,0.0009715659,0.0034276312,0.00957359,0.0027952432,0.0042851507,0.0004621009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019855672,0.000093286115,0.0010641622,0.00042209603,0.00011917409,0.001075042,0.0011827786,0.10602172,0.0038403096,0.8306161,0.0038933102,0.05147355],"study_design_scores_gemma":[0.000042259097,0.000021125872,0.00016822426,0.0000529681,0.000091181064,0.0002611847,0.00017213494,0.24739775,0.004867905,0.7405198,0.006377333,0.0000281658],"about_ca_topic_score_codex":0.0059430185,"about_ca_topic_score_gemma":0.005259979,"teacher_disagreement_score":0.0059430185,"about_ca_system_score_codex":0.0020851824,"about_ca_system_score_gemma":0.0014345851,"threshold_uncertainty_score":0.029511333},"labels":[],"label_agreement":null},{"id":"W1529431045","doi":"10.1007/978-3-642-03364-3_42","title":"Construction Knowledge Transfer through Interactive Visualization","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"National Research Council Canada","funders":"","keywords":"Laptop; Variety (cybernetics); Computer science; Knowledge transfer; Entertainment; Visualization; Demographics; Installation; Workforce; Population; Knowledge management; Data science; Artificial intelligence","score_opus":0.011112916312637146,"score_gpt":0.2451645409763001,"score_spread":0.23405162466366297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529431045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021584038,0.00054638786,0.90473306,0.00041912575,0.00006416232,0.000062964114,0.00016688452,0.004554818,0.06786861],"genre_scores_gemma":[0.52355325,0.0018725939,0.42910227,0.00010842451,0.000051334056,0.00023290397,0.00085595273,0.0011834576,0.04303991],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956375,0.000100631434,0.000021966462,0.00008031396,0.00019657277,0.000036755657],"domain_scores_gemma":[0.9986541,0.0008755346,0.000031059357,0.00029571482,0.000119406104,0.000024118704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084741757,0.0006736173,0.00052610534,0.0013310481,0.00046756037,0.0029588297,0.0013595938,0.0008642059,0.019570589],"category_scores_gemma":[0.003633519,0.0005247679,0.00056542223,0.0014664228,0.0010002762,0.0056547257,0.0035784505,0.0010661625,0.0023601544],"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.000121296696,0.00012130293,0.00047907018,0.00044965738,0.00004797777,0.00024832346,0.0040807775,0.029968468,0.022241646,0.1307466,0.011635212,0.79985964],"study_design_scores_gemma":[0.00007254198,0.00012313263,0.0023602447,0.00041904097,0.00014425526,0.0007928768,0.002746841,0.33130804,0.074210875,0.41579136,0.17192948,0.00010132846],"about_ca_topic_score_codex":0.0014391848,"about_ca_topic_score_gemma":0.0013346678,"teacher_disagreement_score":0.019570589,"about_ca_system_score_codex":0.0004898996,"about_ca_system_score_gemma":0.00046970215,"threshold_uncertainty_score":0.06547016},"labels":[],"label_agreement":null},{"id":"W1529503031","doi":"10.1007/11531371_38","title":"An Experiment on the Matching and Reuse of XML Schemas","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Windsor","funders":"","keywords":"XML Schema Editor; Computer science; XML validation; Document Structure Description; Efficient XML Interchange; RELAX NG; Streaming XML; XML Schema (W3C); Information retrieval; XML database; XML Encryption; XML; Schema matching; Database; World Wide Web; Data integration","score_opus":0.021328582114346406,"score_gpt":0.2634941184819652,"score_spread":0.24216553636761878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529503031","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.98715556,0.000413169,0.0063675977,0.00042054447,0.00012460594,0.0002989332,0.0011312047,0.0010393428,0.0030490125],"genre_scores_gemma":[0.9537772,0.00029806854,0.034931295,0.00039679435,0.000073491196,0.0003465101,0.0043046037,0.00036521722,0.0055068457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886231,0.0063595814,0.0015181525,0.0016247615,0.0014609443,0.00041350475],"domain_scores_gemma":[0.7181526,0.2503161,0.0036397108,0.019144835,0.0062921327,0.0024545977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011270903,0.0008848664,0.0010576219,0.0011479902,0.00090825383,0.0016011974,0.0026274344,0.0034129994,0.008838553],"category_scores_gemma":[0.083216555,0.0009148995,0.0009930156,0.0016658963,0.001633009,0.005692424,0.0018024637,0.0020940406,0.0018242726],"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.13359708,0.07484092,0.08536565,0.008229364,0.0024098016,0.002277091,0.008511607,0.041663215,0.19197437,0.010824416,0.021162326,0.4191442],"study_design_scores_gemma":[0.024258582,0.09663666,0.09666778,0.0007181472,0.0039610323,0.0050190557,0.007907492,0.43238223,0.26830015,0.023638396,0.03981433,0.00069613644],"about_ca_topic_score_codex":0.005112997,"about_ca_topic_score_gemma":0.003090065,"teacher_disagreement_score":0.011270903,"about_ca_system_score_codex":0.00067421363,"about_ca_system_score_gemma":0.0013242611,"threshold_uncertainty_score":0.05960691},"labels":[],"label_agreement":null},{"id":"W1529535547","doi":"10.1007/3-540-45453-5_117","title":"Color Content Matching of MPEG-4 Video Objects","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer vision; Artificial intelligence; Computer science; Color histogram; Histogram matching; JPEG; Histogram; Histogram equalization; Quantization (signal processing); Color normalization; Color quantization; Pattern recognition (psychology); Color image; Data compression; Image processing; Image (mathematics)","score_opus":0.03254991632318058,"score_gpt":0.25718766904717266,"score_spread":0.22463775272399208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529535547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25849453,0.002499864,0.7117431,0.00014277421,0.00032169264,0.00031401357,0.00080455764,0.003875404,0.021804003],"genre_scores_gemma":[0.5096342,0.0018165621,0.46447435,0.00012728301,0.00011233779,0.000099286204,0.0025442913,0.0006627133,0.020529043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998,0.000016350617,0.0000075071207,0.00003314253,0.00010032306,0.00004260027],"domain_scores_gemma":[0.9998204,0.00001833605,0.00001264134,0.000026935058,0.00010869343,0.000013003274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018913041,0.00038327204,0.00043676843,0.002886729,0.00031081756,0.0006986337,0.00064438564,0.0004207982,0.0042594643],"category_scores_gemma":[0.0006486359,0.0001973737,0.00034170476,0.0019393169,0.00018517488,0.0006458493,0.0003802949,0.00020549107,0.0014917665],"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.0006178087,0.00010039843,0.001239608,0.00011162899,0.000044897915,0.00011215218,0.00005280605,0.0074096266,0.26272616,0.003775617,0.004774591,0.71903473],"study_design_scores_gemma":[0.00006412872,0.00035642376,0.018061548,0.00006119993,0.00017884753,0.0008957314,0.00019341479,0.3571642,0.58877414,0.0052984436,0.028892444,0.00005949796],"about_ca_topic_score_codex":0.0069208597,"about_ca_topic_score_gemma":0.0077120983,"teacher_disagreement_score":0.0069208597,"about_ca_system_score_codex":0.00071219145,"about_ca_system_score_gemma":0.00045643898,"threshold_uncertainty_score":0.014249325},"labels":[],"label_agreement":null},{"id":"W1529557630","doi":"10.1007/978-3-642-01811-4_3","title":"Geometric Mesh Denoising via Multivariate Kernel Diffusion","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and 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":"Concordia University","funders":"","keywords":"Noise reduction; Kernel (algebra); Computer science; Kernel density estimation; Image denoising; Noise (video); Diffusion; Multivariate statistics; Algorithm; Artificial intelligence; Pattern recognition (psychology); Mathematics; Image (mathematics); Machine learning; Statistics","score_opus":0.011832197218585177,"score_gpt":0.22029197351703017,"score_spread":0.208459776298445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529557630","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.007432109,0.00024580504,0.99025226,0.000092051276,0.000054977972,0.000008224707,0.000022898848,0.00022419196,0.0016675155],"genre_scores_gemma":[0.31930506,0.0016801074,0.65756863,0.00014705348,0.00023451909,0.000050701816,0.00027926773,0.0006592912,0.02007548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967873,0.0000550251,0.000015285645,0.00006685129,0.00015974665,0.00002450327],"domain_scores_gemma":[0.9994599,0.00018279646,0.00006805045,0.00013824635,0.00012272035,0.000028319077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005338518,0.0005643503,0.00095982413,0.0010330997,0.00017903512,0.00088849803,0.00096321513,0.0011322999,0.0021903568],"category_scores_gemma":[0.0021108224,0.00047010285,0.0008003383,0.000857904,0.00080467795,0.0013553842,0.0013088331,0.0013943539,0.00077073555],"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.00017178577,0.00006376649,0.0005584079,0.00027568638,0.00012081486,0.00013937942,0.0001348196,0.30385122,0.078981176,0.20599571,0.005885784,0.4038214],"study_design_scores_gemma":[0.0000072624334,0.000022116952,0.0002736759,0.000009928434,0.000014288127,0.00016009033,0.000010995531,0.95831656,0.006437244,0.0316367,0.0030942417,0.000016927746],"about_ca_topic_score_codex":0.00081813784,"about_ca_topic_score_gemma":0.0009906173,"teacher_disagreement_score":0.0021903568,"about_ca_system_score_codex":0.00051356474,"about_ca_system_score_gemma":0.00028645617,"threshold_uncertainty_score":0.0073274374},"labels":[],"label_agreement":null},{"id":"W1529567625","doi":"10.1007/978-3-642-04159-4_2","title":"Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"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":"Hyperelliptic curve cryptography; Elliptic curve; Pairing; Supersingular elliptic curve; Computation; Homogeneous coordinates; Mathematics; Finite field; Hyperelliptic curve; Edwards curve; Cryptography; Prime (order theory); Genus; Context (archaeology); Schoof's algorithm; Pure mathematics; Computer science; Discrete mathematics; Algorithm; Elliptic curve cryptography; Combinatorics; Public-key cryptography; Quarter period","score_opus":0.013301836878603621,"score_gpt":0.24651526017122735,"score_spread":0.23321342329262373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529567625","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.42702273,0.0015083242,0.44657135,0.001254279,0.0005236842,0.00031599836,0.0010409303,0.007942907,0.11381982],"genre_scores_gemma":[0.8293094,0.0004621384,0.13801597,0.00019943636,0.00018795587,0.00016757302,0.0012548119,0.0007434118,0.029659314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.00022753642,0.00005260127,0.00018279125,0.0003414132,0.00032167256],"domain_scores_gemma":[0.9991622,0.0003083282,0.00005097957,0.00029923292,0.000102066784,0.000077197474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064768334,0.0013227622,0.0018306526,0.001365316,0.0018788653,0.0033326913,0.0013979692,0.0010144182,0.022624983],"category_scores_gemma":[0.0019765263,0.00057704526,0.0008969633,0.002852594,0.0012367065,0.0054024966,0.003658892,0.0014328832,0.0051207743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015682452,0.0003259596,0.0025984906,0.0006014443,0.00013406527,0.0007825236,0.0014738456,0.03507826,0.020332607,0.45453358,0.04385361,0.43871734],"study_design_scores_gemma":[0.0003153034,0.00041650224,0.0013755162,0.00013086364,0.00011993365,0.00054697925,0.00072620786,0.10844511,0.026442466,0.82454836,0.03682079,0.00011189337],"about_ca_topic_score_codex":0.0008197696,"about_ca_topic_score_gemma":0.0018375908,"teacher_disagreement_score":0.022624983,"about_ca_system_score_codex":0.0012578034,"about_ca_system_score_gemma":0.0012022314,"threshold_uncertainty_score":0.075688064},"labels":[],"label_agreement":null},{"id":"W1529596440","doi":"10.1007/3-540-45648-1_1","title":"Theories, Implementations, and Transformations","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Correctness; Structuring; Implementation; Presentation (obstetrics); Style (visual arts); Theoretical computer science; Order (exchange); Programming language","score_opus":0.01999112606207713,"score_gpt":0.25857088299015785,"score_spread":0.23857975692808073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529596440","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008485145,0.03616454,0.63611627,0.010358758,0.0012250957,0.00017641822,0.0006208483,0.0011984279,0.3056545],"genre_scores_gemma":[0.38325533,0.035827182,0.47276974,0.0028092698,0.0021455435,0.0011934404,0.0026309881,0.00092522457,0.098443285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962763,0.0015189319,0.0003847529,0.00051000144,0.0010347995,0.0002750597],"domain_scores_gemma":[0.9981007,0.0008767894,0.00009740307,0.0006498317,0.000213672,0.00006161681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033293494,0.0014957464,0.0014580514,0.0026970778,0.0022870707,0.010731254,0.002550898,0.0034505432,0.01238039],"category_scores_gemma":[0.0060083037,0.0015789346,0.0017723318,0.004974213,0.01200269,0.021077024,0.003627292,0.0057067787,0.0035518662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039020783,0.0000069944035,0.00002201923,0.000040967658,0.0000045771617,0.000014806701,0.00012800128,0.0003827385,0.00005746977,0.98880345,0.0016104482,0.008924599],"study_design_scores_gemma":[0.0000042531283,0.0000022995184,0.000011445769,0.00002798279,0.000004503832,0.000025276173,0.00006613828,0.00074269867,0.00007748957,0.98508364,0.013951224,0.0000029134885],"about_ca_topic_score_codex":0.0022085663,"about_ca_topic_score_gemma":0.0019631267,"teacher_disagreement_score":0.01238039,"about_ca_system_score_codex":0.0030883262,"about_ca_system_score_gemma":0.0023086097,"threshold_uncertainty_score":0.041416526},"labels":[],"label_agreement":null},{"id":"W1529627684","doi":"10.1007/978-3-540-72665-4_26","title":"A Profit-Based Business Model for Evaluating Rule Interestingness","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Regina","funders":"","keywords":"Computer science; Profit (economics); Database transaction; Business rule; Affinity analysis; Data mining; Association rule learning; Data science; Database; Business process; Marketing; Business; Microeconomics","score_opus":0.09324250939051158,"score_gpt":0.34500686522795604,"score_spread":0.25176435583744444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529627684","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.1499676,0.0007469084,0.8369236,0.0009905985,0.00010710163,0.00048530096,0.002112225,0.0024245826,0.0062422073],"genre_scores_gemma":[0.73304445,0.00021663922,0.2611313,0.00019993613,0.00009536504,0.00036754637,0.0022510714,0.00011972161,0.002574013],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483716,0.0010626197,0.0004645138,0.00062328886,0.0027204205,0.00029204492],"domain_scores_gemma":[0.98837644,0.007290019,0.00088261697,0.001024153,0.0020531416,0.00037355753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062839086,0.0012713543,0.0015012875,0.0064585214,0.000740089,0.0031529374,0.002168667,0.0018174172,0.0026733414],"category_scores_gemma":[0.016791282,0.0004203019,0.0015669581,0.0038887132,0.00089513493,0.004977091,0.0012819641,0.0013233653,0.0010060889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015926879,0.0013229933,0.04498649,0.00034216704,0.00061295554,0.0005312282,0.00021800502,0.352337,0.008366728,0.046973657,0.009895749,0.5328202],"study_design_scores_gemma":[0.000025828405,0.00009060948,0.001226376,0.000015647667,0.000059030197,0.00012514296,0.000029537414,0.9808872,0.0011980562,0.015726576,0.00059859775,0.00001750039],"about_ca_topic_score_codex":0.003456635,"about_ca_topic_score_gemma":0.004452362,"teacher_disagreement_score":0.0064585214,"about_ca_system_score_codex":0.0019374727,"about_ca_system_score_gemma":0.0013453958,"threshold_uncertainty_score":0.033232868},"labels":[],"label_agreement":null},{"id":"W1529661811","doi":"10.1007/978-3-642-02611-9_74","title":"Efficient Segmentation of Lung Abnormalities in CT Images","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Windsor","funders":"","keywords":"Complex wavelet transform; Wavelet; Artificial intelligence; Discrete wavelet transform; Computer science; Pattern recognition (psychology); Thresholding; Segmentation; Computer vision; Stationary wavelet transform; Wavelet transform; Tree (set theory); Second-generation wavelet transform; Mathematics; Image (mathematics)","score_opus":0.014233971890409106,"score_gpt":0.27361632825193016,"score_spread":0.25938235636152107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529661811","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.017291892,0.0015761402,0.9782508,0.00015951777,0.000038556023,0.00005969943,0.00018740677,0.0011025999,0.00133347],"genre_scores_gemma":[0.10888435,0.0023064734,0.88002,0.00012460552,0.000114013106,0.000062966785,0.0007937335,0.0006490599,0.007044773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.000036832815,0.000024700192,0.000058091333,0.00015437134,0.000038589857],"domain_scores_gemma":[0.99940085,0.00027909334,0.0000621326,0.00010421758,0.00012557644,0.00002802192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052677625,0.00081689726,0.00095133256,0.0015778374,0.00022180096,0.0012554163,0.0010686213,0.0013687199,0.0029032489],"category_scores_gemma":[0.0014289892,0.0007286942,0.00073530374,0.0011949309,0.0003902492,0.00084840535,0.0008857277,0.00072796404,0.0019465791],"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.00030073602,0.00006877423,0.0012417411,0.00047522198,0.000100585734,0.00039346633,0.00011651314,0.036565516,0.21822973,0.00404926,0.0050781234,0.7333803],"study_design_scores_gemma":[0.0000489801,0.0001740871,0.0066356426,0.00011961329,0.00021503962,0.003980201,0.000078030505,0.77102613,0.19104789,0.010486904,0.016136864,0.00005056898],"about_ca_topic_score_codex":0.0012304913,"about_ca_topic_score_gemma":0.0027484847,"teacher_disagreement_score":0.0029032489,"about_ca_system_score_codex":0.0003287475,"about_ca_system_score_gemma":0.00071258756,"threshold_uncertainty_score":0.009712338},"labels":[],"label_agreement":null},{"id":"W1529675067","doi":"10.1007/978-3-540-28631-8_3","title":"Maintaining Case-Based Reasoning Systems: A Machine Learning Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"Princess Margaret Cancer Centre; University Health Network; Ontario Institute for Cancer Research; University of Toronto","funders":"","keywords":"Computer science; Case-based reasoning; Cluster analysis; Artificial intelligence; Machine learning; Data mining; Adaptation (eye); Set (abstract data type)","score_opus":0.01497431528368983,"score_gpt":0.24356916521870592,"score_spread":0.22859484993501608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529675067","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.008784161,0.0003282035,0.98312634,0.00063496403,0.000044793178,0.00027031783,0.0005539784,0.00401004,0.002247118],"genre_scores_gemma":[0.08621958,0.0002773129,0.9089165,0.00015949816,0.00006883477,0.00014280426,0.0019637835,0.0004173991,0.0018343909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989965,0.0023757187,0.0013020767,0.001968811,0.0039688665,0.00041957624],"domain_scores_gemma":[0.9511944,0.029415434,0.002543117,0.012331793,0.003902052,0.0006132014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012922833,0.0017165984,0.00217128,0.004918679,0.0020806824,0.009569965,0.012375832,0.003057577,0.00952294],"category_scores_gemma":[0.054796446,0.0021439418,0.0032756813,0.0049290056,0.0033398024,0.017435735,0.005473795,0.0043880055,0.0023586494],"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.00049042236,0.00096321,0.004140365,0.000748307,0.00047459532,0.0010121716,0.0016855545,0.107856534,0.0060126153,0.10147992,0.012313442,0.7628228],"study_design_scores_gemma":[0.00013877658,0.00010655561,0.0008030666,0.00018761776,0.0005441999,0.00054457056,0.00042201157,0.6015957,0.013736492,0.36386275,0.017947173,0.00011102666],"about_ca_topic_score_codex":0.006391745,"about_ca_topic_score_gemma":0.0063361735,"teacher_disagreement_score":0.012922833,"about_ca_system_score_codex":0.0021652426,"about_ca_system_score_gemma":0.0033089188,"threshold_uncertainty_score":0.06834334},"labels":[],"label_agreement":null},{"id":"W1529712603","doi":"10.1007/978-3-540-72606-7_7","title":"Asynchronous Data Aggregation for Real-Time Monitoring in Sensor Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Asynchronous communication; Data aggregator; Wireless sensor network; Real-time computing; Distributed computing; Computer network","score_opus":0.03186345727003631,"score_gpt":0.27438036044463765,"score_spread":0.24251690317460134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529712603","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.0052749026,0.0028154352,0.9871546,0.00018948258,0.00037405017,0.000031262018,0.000036307865,0.0007329248,0.0033909432],"genre_scores_gemma":[0.46082035,0.0048171626,0.510916,0.00030327128,0.0009962339,0.00026594347,0.00024285034,0.00032955653,0.021308603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999506,0.000116160736,0.000044721943,0.00010602794,0.00019633416,0.000030736],"domain_scores_gemma":[0.9992669,0.00038489467,0.000055708344,0.00015683504,0.00010858446,0.000026981423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000753598,0.00071723404,0.00067482726,0.0003848385,0.00039063755,0.0010738735,0.0012079956,0.00054331997,0.0022860353],"category_scores_gemma":[0.0016340906,0.00027114505,0.00030553355,0.00071604433,0.00046110715,0.0013178092,0.0005914831,0.0010874837,0.0005465377],"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.0005545128,0.00017593212,0.00067132845,0.000794673,0.00008545055,0.0002946418,0.00041207165,0.08935026,0.07032702,0.15852095,0.01899148,0.6598217],"study_design_scores_gemma":[0.00004850347,0.00017034041,0.00045718072,0.00005092227,0.00006498031,0.00033659636,0.000047892278,0.86392945,0.026594844,0.07164687,0.0366255,0.000026896894],"about_ca_topic_score_codex":0.0002728358,"about_ca_topic_score_gemma":0.0004163724,"teacher_disagreement_score":0.0022860353,"about_ca_system_score_codex":0.00039594847,"about_ca_system_score_gemma":0.00024158196,"threshold_uncertainty_score":0.007647574},"labels":[],"label_agreement":null},{"id":"W1529714626","doi":"10.1007/3-540-44674-5_20","title":"An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Cover (algebra); Computer science; Deterministic finite automaton; DFA minimization; Finite-state machine; Automaton; Nondeterministic finite automaton; Regular language; Algorithm; Deterministic automaton; Time complexity; Quantum finite automata; Computational complexity theory; Formal language; Theoretical computer science; Automata theory","score_opus":0.015139076732280194,"score_gpt":0.26906014390683425,"score_spread":0.25392106717455404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529714626","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.040965404,0.00034107832,0.9286821,0.00047653672,0.00009062593,0.0003994282,0.0006938896,0.016590413,0.011760565],"genre_scores_gemma":[0.13707037,0.000166862,0.8510377,0.0001955003,0.00004009663,0.000591813,0.002618554,0.0014182227,0.0068608182],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00014131407,0.000062542,0.0002468461,0.0002627297,0.0001357768],"domain_scores_gemma":[0.99783593,0.0013425504,0.00007155694,0.00049399206,0.00017369354,0.00008231128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048095395,0.0014173945,0.0012231458,0.0011376635,0.0015230363,0.0020038215,0.0023659575,0.0015359217,0.017510165],"category_scores_gemma":[0.0027201185,0.0011725086,0.0021809153,0.0016312297,0.00093199953,0.0045687654,0.0033019152,0.0020086172,0.004830102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079501275,0.00040951467,0.0015115041,0.00082996715,0.00016750445,0.0002798903,0.0006711433,0.024374422,0.04486674,0.044104736,0.0280311,0.8539584],"study_design_scores_gemma":[0.0004803767,0.00034379415,0.0016355658,0.00018168984,0.00038764675,0.00073752407,0.00068609125,0.58020645,0.06673067,0.3067071,0.04175058,0.00015247164],"about_ca_topic_score_codex":0.0025584898,"about_ca_topic_score_gemma":0.0073671467,"teacher_disagreement_score":0.017510165,"about_ca_system_score_codex":0.0015835689,"about_ca_system_score_gemma":0.001689865,"threshold_uncertainty_score":0.05857736},"labels":[],"label_agreement":null},{"id":"W1529722424","doi":"10.1007/11944836_23","title":"Testing Probabilistic Equivalence Through Reinforcement Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Equivalence (formal languages); Markov decision process; Probabilistic logic; Computer science; Reinforcement learning; Bisimulation; TRACE (psycholinguistics); Markov process; Witness; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Mathematics; Programming language; Statistics","score_opus":0.05150164505242391,"score_gpt":0.29251151544253967,"score_spread":0.24100987039011576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529722424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10603396,0.00011132707,0.8843655,0.00075124466,0.00012475118,0.00017556232,0.000109118344,0.001994377,0.0063341437],"genre_scores_gemma":[0.860729,0.000049447295,0.13618404,0.00021743246,0.000059357928,0.00016117655,0.00028924123,0.00023163561,0.0020787588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98951787,0.00424319,0.0004359624,0.0021128408,0.0027993866,0.00089068996],"domain_scores_gemma":[0.93416965,0.057084847,0.0018378632,0.0041131163,0.0019123282,0.00088219834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006124888,0.0011827034,0.0014459264,0.00092115934,0.0006204235,0.0012914495,0.003426525,0.0018189965,0.0061813556],"category_scores_gemma":[0.055231772,0.00076246465,0.0015460124,0.00057330617,0.0036973383,0.005974245,0.0048033316,0.0036665294,0.00066804595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016076249,0.0012013365,0.007093688,0.00031916023,0.00020456169,0.0003085499,0.0002879278,0.5622704,0.007787289,0.13284273,0.0035680493,0.28250864],"study_design_scores_gemma":[0.000098564284,0.00013885867,0.00033711796,0.00001704802,0.000017873585,0.00004035272,0.00002713562,0.85774326,0.0030740802,0.13814226,0.00034931212,0.00001426789],"about_ca_topic_score_codex":0.002221232,"about_ca_topic_score_gemma":0.002313205,"teacher_disagreement_score":0.0061813556,"about_ca_system_score_codex":0.0015356841,"about_ca_system_score_gemma":0.0021605275,"threshold_uncertainty_score":0.032391846},"labels":[],"label_agreement":null},{"id":"W1529782179","doi":"10.1007/978-3-540-45236-2_9","title":"Lessons Learned from a Successful Implementation of Formal Methods in an Industrial Project","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Notation; Engineering management; Software engineering; Operations research; Engineering","score_opus":0.14197543767826332,"score_gpt":0.43721716113703923,"score_spread":0.2952417234587759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529782179","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.4708063,0.006191943,0.2904692,0.07016189,0.0011598472,0.0004932363,0.00013052893,0.0016889839,0.15889806],"genre_scores_gemma":[0.80697876,0.003011615,0.14465864,0.0024903303,0.00014680251,0.00020038201,0.000117764466,0.0005730191,0.041822653],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98857343,0.0068177735,0.00042433324,0.0005804109,0.0027515118,0.0008525363],"domain_scores_gemma":[0.9786517,0.013669842,0.0009657516,0.0024856827,0.002853258,0.0013737204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016922519,0.00061404635,0.00032362156,0.00091865734,0.0032951443,0.005001297,0.0022409866,0.002838261,0.0035863959],"category_scores_gemma":[0.036473803,0.0005839223,0.00040939008,0.0009615495,0.0043688114,0.0056221955,0.003296,0.0037578193,0.0012196457],"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.00032709897,0.0012848771,0.0068970807,0.0008285333,0.00003770087,0.0031730067,0.087190226,0.006183252,0.005374516,0.0900972,0.019283604,0.77932304],"study_design_scores_gemma":[0.00039622947,0.0036223955,0.012431554,0.0030085563,0.00015944774,0.0062858174,0.103058234,0.012464514,0.027719684,0.18096057,0.6494484,0.00044466887],"about_ca_topic_score_codex":0.0048739766,"about_ca_topic_score_gemma":0.010970478,"teacher_disagreement_score":0.016922519,"about_ca_system_score_codex":0.0035037769,"about_ca_system_score_gemma":0.00482205,"threshold_uncertainty_score":0.0894959},"labels":[],"label_agreement":null},{"id":"W1529851759","doi":"10.1007/11564751_55","title":"Multi-point Constructive Search","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Constructive; Backtracking; Computer science; Point (geometry); Set (abstract data type); Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics; Process (computing)","score_opus":0.01631828753033134,"score_gpt":0.24170766004717226,"score_spread":0.2253893725168409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529851759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018586862,0.0008394458,0.9549804,0.00014999037,0.00013977,0.000049350518,0.00006006825,0.00047093944,0.041451268],"genre_scores_gemma":[0.106731065,0.0012735828,0.8373165,0.0002435116,0.00019822764,0.0003690967,0.00033648775,0.00076319446,0.052768283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992029,0.00029913726,0.00002489393,0.00009738694,0.00033005135,0.00004558935],"domain_scores_gemma":[0.9988029,0.0007494801,0.00004690106,0.0001792112,0.00018251348,0.000038913284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010764566,0.0014296971,0.00153513,0.0014450516,0.00076725037,0.0014538988,0.0016568855,0.0016650938,0.019888153],"category_scores_gemma":[0.0036943166,0.00083807006,0.0011642522,0.0020403846,0.0013105932,0.001404823,0.0020874615,0.0021668784,0.005835251],"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.00010628752,0.00008684719,0.0001693879,0.00046218053,0.00008232445,0.000103480095,0.000114459035,0.2777376,0.003349545,0.3544691,0.021726238,0.3415926],"study_design_scores_gemma":[0.00006034649,0.00008972995,0.000111784095,0.00013851123,0.00003821689,0.00021065948,0.000036370187,0.73892826,0.0033359537,0.21651779,0.04050421,0.000028114673],"about_ca_topic_score_codex":0.0005093123,"about_ca_topic_score_gemma":0.0007991883,"teacher_disagreement_score":0.019888153,"about_ca_system_score_codex":0.0006325696,"about_ca_system_score_gemma":0.00066167035,"threshold_uncertainty_score":0.06653255},"labels":[],"label_agreement":null},{"id":"W1529859013","doi":"10.1007/3-540-44583-8_24","title":"Ossa - A Conceptual Modelling System for Virtual Realities","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Guelph; University of Waterloo","funders":"","keywords":"Diagrammatic reasoning; Computer science; Conceptual graph; Modalities; Conceptual model; Conceptual design; Graphics; Conceptual system; Human–computer interaction; Conceptual framework; Natural (archaeology); Virtual reality; Artificial intelligence; Programming language; Computer graphics (images); Knowledge representation and reasoning","score_opus":0.035473209952560855,"score_gpt":0.24205444404899842,"score_spread":0.20658123409643758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529859013","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.004303913,0.0001526518,0.94557786,0.00021592493,0.000102413265,0.00015537841,0.0024242562,0.034111153,0.012956441],"genre_scores_gemma":[0.11872265,0.00087257917,0.8321547,0.00019079096,0.000059130267,0.000893349,0.013157007,0.011395849,0.022553977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994578,0.00011765913,0.00007693247,0.000099664016,0.00020479532,0.000043182863],"domain_scores_gemma":[0.99916816,0.00031452614,0.000049391223,0.00023980203,0.00014098106,0.00008704631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010796259,0.0014882273,0.00097264774,0.0013863167,0.0010325438,0.0046025063,0.002801333,0.0013017098,0.031920634],"category_scores_gemma":[0.003404937,0.001201707,0.0021004674,0.0010702881,0.0012595879,0.0056637283,0.004153316,0.0019529688,0.008243927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005660472,0.00015734282,0.0022384122,0.0013550184,0.00021257045,0.0006178306,0.0035758212,0.12722397,0.013152081,0.55205464,0.069970556,0.22887576],"study_design_scores_gemma":[0.00012064048,0.000072639144,0.00037088947,0.0002703074,0.00015415678,0.00031526037,0.0003711069,0.38535643,0.007332044,0.14326818,0.46227244,0.00009595749],"about_ca_topic_score_codex":0.0061063473,"about_ca_topic_score_gemma":0.00756772,"teacher_disagreement_score":0.031920634,"about_ca_system_score_codex":0.0009416564,"about_ca_system_score_gemma":0.0016197676,"threshold_uncertainty_score":0.10678518},"labels":[],"label_agreement":null},{"id":"W1529874373","doi":"10.1007/3-540-45075-0_20","title":"Validation of SIP/H.323 Interworking Using SDL/MSC","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; The Internet; Session Initiation Protocol; Task (project management); Computer network; Simple (philosophy); Operating system; Server","score_opus":0.028790955763643402,"score_gpt":0.25316754438559524,"score_spread":0.22437658862195184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529874373","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.6255289,0.0003246468,0.31663954,0.0007206561,0.00090570963,0.0008117351,0.0019749473,0.031326037,0.021767827],"genre_scores_gemma":[0.96013826,0.000077504264,0.032476477,0.0001741119,0.000040188672,0.00024656707,0.0014110445,0.0011882734,0.0042475723],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99216133,0.0022195396,0.00068004534,0.00047993843,0.0037037884,0.00075538654],"domain_scores_gemma":[0.9821212,0.00593727,0.00085857883,0.0052207387,0.005495829,0.00036635032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061762696,0.0008238044,0.00073704426,0.0009988216,0.0008875018,0.002151936,0.0018708647,0.0013100342,0.004692514],"category_scores_gemma":[0.014028747,0.00054167927,0.00055534043,0.00033542846,0.0011334993,0.0017578186,0.0013079173,0.0014569652,0.0017486621],"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.008737018,0.002886761,0.032988194,0.001665284,0.00062384404,0.0036649357,0.002462835,0.21967721,0.37085333,0.06516404,0.034636065,0.2566406],"study_design_scores_gemma":[0.00026251894,0.0006417613,0.0032155921,0.000120233155,0.00012979949,0.00033028898,0.00018217137,0.61981523,0.35805374,0.0044773463,0.01268048,0.000090895424],"about_ca_topic_score_codex":0.0025221992,"about_ca_topic_score_gemma":0.0020360432,"teacher_disagreement_score":0.0061762696,"about_ca_system_score_codex":0.0013043277,"about_ca_system_score_gemma":0.002151375,"threshold_uncertainty_score":0.032663584},"labels":[],"label_agreement":null},{"id":"W1529877391","doi":"10.1007/978-3-540-27866-5_139","title":"A Synchronization and Session Control Based Protocol for 3D Multi-user Virtual Environments in a Peer-to-Peer Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Session (web analytics); Computer network; Distributed computing; Peer-to-peer; Latency (audio); Protocol (science); World Wide Web; Telecommunications","score_opus":0.011616940221204821,"score_gpt":0.25576518484887883,"score_spread":0.244148244627674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529877391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00694683,0.0003812643,0.9824202,0.00018676546,0.000326615,0.00040197058,0.00011935652,0.0051173647,0.0040996387],"genre_scores_gemma":[0.31388116,0.0011564357,0.65533614,0.00045001748,0.00043696174,0.0020514634,0.0011609204,0.0011352,0.024391778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842924,0.00043973635,0.00018528012,0.00017380908,0.00064862566,0.00012317482],"domain_scores_gemma":[0.99809974,0.0006241538,0.00011574536,0.00049713405,0.0004592221,0.00020397086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002274156,0.0006994188,0.0010928051,0.0009837272,0.0015346183,0.0020828051,0.0024750072,0.0015730844,0.0040862006],"category_scores_gemma":[0.003302005,0.00063732336,0.00065083575,0.0010401397,0.0010179257,0.0023296901,0.0026180197,0.0023078038,0.001398683],"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.0011781055,0.0006040252,0.00095602305,0.0007206197,0.0002863681,0.0011223308,0.0020686593,0.06710147,0.14577255,0.22629033,0.04884748,0.5050521],"study_design_scores_gemma":[0.00023847171,0.00065993896,0.0012197264,0.00009951329,0.0002893872,0.0012885126,0.00028147647,0.7179325,0.08051383,0.060014054,0.13715595,0.0003066342],"about_ca_topic_score_codex":0.0020389704,"about_ca_topic_score_gemma":0.0021584886,"teacher_disagreement_score":0.0040862006,"about_ca_system_score_codex":0.00081805355,"about_ca_system_score_gemma":0.0012372808,"threshold_uncertainty_score":0.01366967},"labels":[],"label_agreement":null},{"id":"W1529898482","doi":"10.1007/978-3-642-27697-2_8","title":"Analysis of Treatment Compliance of Patients with Diabetes","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medication Adherence and Compliance","field":"Medicine","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":"Lawson Health Research Institute","funders":"","keywords":"Medicine; Diabetes mellitus; Compliance (psychology); Intensive care medicine; Type 2 diabetes; Combination therapy; Internal medicine; Endocrinology","score_opus":0.03413248033129956,"score_gpt":0.27845658372061266,"score_spread":0.2443241033893131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529898482","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.9854946,0.0027063931,0.0030935288,0.00034717916,0.00004999532,0.000044951335,0.0009396916,0.00004537662,0.007278232],"genre_scores_gemma":[0.99269307,0.0008764583,0.0025804997,0.00012784045,0.000031851818,0.000051867828,0.0008976508,0.000012871828,0.002727847],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99895227,0.00056070747,0.00008933003,0.00010004298,0.000247194,0.00005042668],"domain_scores_gemma":[0.9979803,0.0014622448,0.0002690823,0.00007784605,0.0001535176,0.000057078236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080808,0.00017739821,0.00037957684,0.000846721,0.00018426904,0.00034110426,0.000253488,0.00031186594,0.0016413241],"category_scores_gemma":[0.0039720116,0.000127648,0.0005685079,0.0010789972,0.00011054243,0.00020646873,0.00020377134,0.00043101003,0.00021086757],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012041287,0.0004333712,0.8045223,0.00012451714,0.0003220612,0.00022146515,0.00055964885,0.00092077244,0.0009244111,0.00032945446,0.0014465781,0.18899134],"study_design_scores_gemma":[0.000025631172,0.0011368032,0.989938,0.00007874932,0.00013147517,0.000795252,0.00042343943,0.0041495226,0.0009269982,0.0005897785,0.0017841284,0.000020179414],"about_ca_topic_score_codex":0.0016557681,"about_ca_topic_score_gemma":0.0026518698,"teacher_disagreement_score":0.0016557681,"about_ca_system_score_codex":0.000286199,"about_ca_system_score_gemma":0.0002612172,"threshold_uncertainty_score":0.00549078},"labels":[],"label_agreement":null},{"id":"W1529899382","doi":"10.1007/978-3-540-76298-0_9","title":"A Cognitive Support Framework for Ontology Mapping","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Ontology; Semantic Web; Interoperability; Semantic integration; Semantic mapping; Process (computing); OWL-S; Ontology-based data integration; Upper ontology; Key (lock); World Wide Web; Information retrieval; Data science; Social Semantic Web; Semantic Web Stack","score_opus":0.057027851546690864,"score_gpt":0.3142156871143977,"score_spread":0.2571878355677068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529899382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014701016,0.00025085662,0.9805195,0.0007004099,0.000091626236,0.00010100951,0.00025664788,0.0013375921,0.015272213],"genre_scores_gemma":[0.050488193,0.00038167642,0.9392555,0.00022972122,0.00009522829,0.0003226545,0.0008255265,0.00022523054,0.008176213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983474,0.0004407881,0.00021989847,0.00029062887,0.0005340464,0.00016721402],"domain_scores_gemma":[0.998382,0.0006157646,0.00010040956,0.00035601947,0.00041044547,0.0001353641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027624248,0.0011215258,0.00080334954,0.0031180023,0.0024236043,0.0066564563,0.0038451108,0.0021327191,0.011999626],"category_scores_gemma":[0.0051143453,0.0008117909,0.0024089485,0.003076813,0.00238729,0.0092939865,0.004828835,0.0028823335,0.0037916284],"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.000028916624,0.000057173784,0.00012127226,0.00015022013,0.000032433487,0.00018255437,0.00085436396,0.0029682112,0.000993524,0.9117511,0.007256645,0.07560357],"study_design_scores_gemma":[0.000024010671,0.000017201382,0.00009892192,0.00011889664,0.000053092186,0.00020928134,0.00038646738,0.036801506,0.0016187292,0.8733511,0.08729207,0.000028781109],"about_ca_topic_score_codex":0.010887355,"about_ca_topic_score_gemma":0.01056483,"teacher_disagreement_score":0.011999626,"about_ca_system_score_codex":0.0015391815,"about_ca_system_score_gemma":0.002425251,"threshold_uncertainty_score":0.040142775},"labels":[],"label_agreement":null},{"id":"W1529909807","doi":"10.1007/978-3-540-30564-4_21","title":"Deterministic Key Predistribution Schemes for Distributed Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Key (lock); Distributed computing; Computer network; Theoretical computer science; Computer security","score_opus":0.014290256798919914,"score_gpt":0.24202720685051055,"score_spread":0.22773695005159064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529909807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011955316,0.003614475,0.97573906,0.0004275559,0.00030385438,0.00008087131,0.00010440672,0.000529267,0.007245083],"genre_scores_gemma":[0.7106845,0.004958666,0.26255322,0.000370876,0.00036938285,0.00031444634,0.00028831014,0.000114873175,0.020345842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988569,0.00030636365,0.000095178686,0.0001736189,0.00043189165,0.0001361546],"domain_scores_gemma":[0.9980817,0.00080991647,0.00015157727,0.00073990156,0.00018453506,0.000032401786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252402,0.00067158113,0.00065995293,0.00036873392,0.0005645184,0.0011308829,0.0013933982,0.0007456672,0.0035576324],"category_scores_gemma":[0.0033019013,0.00041638373,0.00031414072,0.0007795324,0.00083991955,0.0023384942,0.0016497391,0.0015872507,0.0008407375],"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.0005358914,0.000100304715,0.00028710923,0.0008511282,0.00009054019,0.00015842589,0.00026253343,0.11352608,0.03436652,0.46429408,0.009450024,0.37607747],"study_design_scores_gemma":[0.0001505465,0.000285125,0.00035532805,0.00014525076,0.00006782149,0.0008447661,0.00008825006,0.47371164,0.03482628,0.45931417,0.030112546,0.00009827586],"about_ca_topic_score_codex":0.00013847006,"about_ca_topic_score_gemma":0.0002194318,"teacher_disagreement_score":0.0035576324,"about_ca_system_score_codex":0.0007443247,"about_ca_system_score_gemma":0.0006409165,"threshold_uncertainty_score":0.011901438},"labels":[],"label_agreement":null},{"id":"W1529961032","doi":"10.1007/3-540-45424-1_10","title":"A Virtual Test Bed in Support of Cognitively-Aware Geomatics Technologies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","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":"Centre de Géomatique du Québec; Université Laval","funders":"","keywords":"Computer science; Geomatics; Turing test; Categorization; Test (biology); Spatial cognition; Scope (computer science); Human–computer interaction; Geographic information system; Virtual reality; Data science; Artificial intelligence; Cognition; Programming language","score_opus":0.02091706283206981,"score_gpt":0.2707546974414017,"score_spread":0.24983763460933187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529961032","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.7372765,0.00033761267,0.23060074,0.000367642,0.0003867595,0.00088426174,0.0022571145,0.013547355,0.014342039],"genre_scores_gemma":[0.8954959,0.00017336557,0.09269462,0.00012866296,0.000027487555,0.0005823657,0.0022922275,0.0004459174,0.0081594195],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999622,0.00014582412,0.00001922672,0.000058968744,0.000092933966,0.00006108235],"domain_scores_gemma":[0.99879116,0.0004375356,0.000047230595,0.00024537812,0.00018245513,0.00029628948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046844658,0.00075765816,0.00047071668,0.00034589993,0.00046765892,0.00087279326,0.0027953894,0.00066224125,0.008650653],"category_scores_gemma":[0.0013850076,0.00030381745,0.00027444132,0.00033129725,0.00044841346,0.00096264534,0.0013087398,0.0003971158,0.0013447015],"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.011866026,0.0061132694,0.010859674,0.0013454498,0.00038125349,0.0030265881,0.0024305673,0.1402279,0.43611085,0.010993706,0.044415817,0.33222896],"study_design_scores_gemma":[0.001574736,0.012950846,0.015206935,0.000103397426,0.00045834138,0.0012948336,0.0013641895,0.6301522,0.25779352,0.007635632,0.07122944,0.00023582537],"about_ca_topic_score_codex":0.0026120848,"about_ca_topic_score_gemma":0.0019631577,"teacher_disagreement_score":0.008650653,"about_ca_system_score_codex":0.00030138344,"about_ca_system_score_gemma":0.00047895967,"threshold_uncertainty_score":0.028939366},"labels":[],"label_agreement":null},{"id":"W1529995230","doi":"10.1007/978-3-540-88282-4_7","title":"Finite Automata, Palindromes, Powers, and Patterns","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Word (group theory); Automaton; Nondeterministic algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Theoretical computer science; Biology","score_opus":0.012039608008618592,"score_gpt":0.2215446534782919,"score_spread":0.2095050454696733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529995230","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.09577295,0.050977137,0.29270253,0.005376546,0.0019179014,0.00010306673,0.0005479994,0.0007474237,0.55185443],"genre_scores_gemma":[0.7941273,0.017687788,0.07910855,0.0011600197,0.0018871045,0.00023506109,0.0005754076,0.00021659448,0.105002135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.00012789686,0.000042429907,0.00012940966,0.00012674989,0.000043987446],"domain_scores_gemma":[0.99920434,0.00046762626,0.000054537268,0.00015700392,0.00007296848,0.00004350189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000466299,0.00056973624,0.0006492804,0.0011113844,0.000995138,0.002875236,0.0007575852,0.0008870714,0.007184395],"category_scores_gemma":[0.0020296683,0.000440647,0.00058988424,0.0017706697,0.0044195657,0.007044607,0.0009469512,0.001872879,0.0015785145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016218759,0.000010693337,0.00008726553,0.00008677722,0.0000040110303,0.00005009398,0.0003401179,0.00033541422,0.0008768623,0.9734293,0.002347654,0.02241555],"study_design_scores_gemma":[0.0000031760062,0.000008928958,0.00004678823,0.000017401542,0.0000025565137,0.00011516892,0.000074942494,0.0004297901,0.00021210927,0.9870897,0.011995758,0.0000036597187],"about_ca_topic_score_codex":0.00039115982,"about_ca_topic_score_gemma":0.0005517509,"teacher_disagreement_score":0.007184395,"about_ca_system_score_codex":0.00069146114,"about_ca_system_score_gemma":0.00034344126,"threshold_uncertainty_score":0.024034142},"labels":[],"label_agreement":null},{"id":"W1530046160","doi":"10.1007/978-3-642-13025-0_32","title":"Teaching Assignment Problem Solver","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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 Regina","funders":"","keywords":"Backtracking; Computer science; Solver; Construct (python library); Mathematical optimization; Extension (predicate logic); Constraint satisfaction problem; Task (project management); Assignment problem; Constraint satisfaction; Selection (genetic algorithm); Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.06385513410186426,"score_gpt":0.3402943713909934,"score_spread":0.2764392372891291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530046160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00489571,0.0011974603,0.6181709,0.0025763505,0.0010940027,0.00026315099,0.001107323,0.0095537715,0.3611413],"genre_scores_gemma":[0.043725546,0.0026190197,0.47057286,0.0013371778,0.00093065784,0.00035675097,0.0038819986,0.0022103135,0.47436565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994242,0.00007637111,0.000021859207,0.00019108271,0.00022919298,0.000057268855],"domain_scores_gemma":[0.9991295,0.0002802726,0.0000357968,0.0001596811,0.0002558993,0.00013872939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050722354,0.0013739726,0.0007644697,0.0009269932,0.0007991559,0.0015985029,0.0019587723,0.00094331,0.18980032],"category_scores_gemma":[0.0019971023,0.00065032084,0.00093586184,0.0015481095,0.0003392253,0.0023676755,0.0019526464,0.0028748522,0.10206565],"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.000072024224,0.00036415318,0.00026620735,0.00026600758,0.000016285387,0.00008130402,0.00013142337,0.004688429,0.0054770806,0.051995557,0.21678083,0.7198606],"study_design_scores_gemma":[0.00008990672,0.00013035547,0.00074183196,0.00018157778,0.000034283497,0.00056596944,0.00017475658,0.053537793,0.014179617,0.13624379,0.79409033,0.000029858233],"about_ca_topic_score_codex":0.0009645797,"about_ca_topic_score_gemma":0.0031273672,"teacher_disagreement_score":0.18980032,"about_ca_system_score_codex":0.0010183161,"about_ca_system_score_gemma":0.0018382041,"threshold_uncertainty_score":0.63494533},"labels":[],"label_agreement":null},{"id":"W1530049774","doi":"10.1007/978-3-540-30140-0_28","title":"An Inductive Construction for Plane Laman Graphs via Vertex Splitting","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Structural Analysis and Optimization","field":"Engineering","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":"York University","funders":"","keywords":"Planar graph; Combinatorics; Vertex (graph theory); Embedding; Mathematics; Planar; Book embedding; Dual polyhedron; Discrete mathematics; Graph; Pathwidth; Line graph; Computer science","score_opus":0.007994890477714964,"score_gpt":0.2095296847362825,"score_spread":0.20153479425856755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530049774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030048378,0.00022657233,0.9107329,0.0006573423,0.00014075443,0.00015407159,0.0003497282,0.0018743898,0.05581589],"genre_scores_gemma":[0.24527408,0.0006413176,0.71504766,0.00059732125,0.00010302911,0.00036624694,0.0013783112,0.001241682,0.03535033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945885,0.000119917655,0.00002054008,0.00012200744,0.00017449314,0.000104148115],"domain_scores_gemma":[0.999099,0.0004068887,0.0000393784,0.00019730325,0.00017797279,0.0000794918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838956,0.0007078393,0.00064362545,0.001458559,0.0016911622,0.0015692986,0.0021558662,0.0008326426,0.009029567],"category_scores_gemma":[0.0015510899,0.0010245845,0.0013769568,0.0015554626,0.0020287219,0.0034713226,0.0037457764,0.004141478,0.0034404607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056405363,0.000111664194,0.0004043297,0.00020800708,0.000026493726,0.00022172264,0.00060611125,0.003611,0.011410149,0.89741236,0.009626886,0.076304704],"study_design_scores_gemma":[0.000025194127,0.000038832026,0.00029438394,0.00004609386,0.00004536851,0.00020152949,0.00022773625,0.0111925285,0.010778721,0.9421119,0.035009563,0.000028165165],"about_ca_topic_score_codex":0.0017391334,"about_ca_topic_score_gemma":0.0032882972,"teacher_disagreement_score":0.009029567,"about_ca_system_score_codex":0.0010593008,"about_ca_system_score_gemma":0.0006536221,"threshold_uncertainty_score":0.030206919},"labels":[],"label_agreement":null},{"id":"W1530077518","doi":"10.1007/978-3-642-11842-5_4","title":"Studies on the Performance of a Heuristic Algorithm for Static and Transportation Facility Location Allocation Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Calgary","funders":"","keywords":"Computer science; Heuristic; Facility location problem; Algorithm; Mathematical optimization; Operations research; Artificial intelligence; Mathematics","score_opus":0.029043050910050633,"score_gpt":0.24563277540527384,"score_spread":0.2165897244952232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530077518","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.77587104,0.010804365,0.15742669,0.0014422613,0.00070351694,0.0002901544,0.000633734,0.0013396888,0.051488627],"genre_scores_gemma":[0.9094798,0.00186884,0.08402408,0.00016357991,0.00017850324,0.000120740675,0.00063986256,0.00026397855,0.003260566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967057,0.0016615561,0.00013278797,0.0003185178,0.0006460176,0.00053538615],"domain_scores_gemma":[0.9720195,0.023636693,0.0006315994,0.0011343035,0.002105494,0.0004723025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040985662,0.0014040351,0.001441074,0.0019005819,0.0012106478,0.00182963,0.002059548,0.0022171228,0.0047204434],"category_scores_gemma":[0.016402062,0.00045554622,0.00087306736,0.0031925163,0.0009899258,0.002031537,0.0004949109,0.0013176303,0.00042182716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016834965,0.0007325406,0.0023755284,0.00047464826,0.00018297996,0.00011100645,0.00011068097,0.8877418,0.0034872198,0.0069587035,0.0049037114,0.09123771],"study_design_scores_gemma":[0.0000975859,0.00044730032,0.0011547706,0.000029584475,0.000097497905,0.0000863534,0.00011748408,0.99308324,0.0019740278,0.0021194047,0.0007758632,0.000016896334],"about_ca_topic_score_codex":0.010595243,"about_ca_topic_score_gemma":0.0065469765,"teacher_disagreement_score":0.010595243,"about_ca_system_score_codex":0.0028944418,"about_ca_system_score_gemma":0.002467746,"threshold_uncertainty_score":0.021675527},"labels":[],"label_agreement":null},{"id":"W1530255190","doi":"10.1007/3-540-45153-6_16","title":"Personalized Contexts in Help Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","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 Saskatchewan","funders":"","keywords":"Computer science; Human–computer interaction; World Wide Web; Data science","score_opus":0.020503168914051025,"score_gpt":0.26682551613855227,"score_spread":0.24632234722450125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530255190","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.1449393,0.029595174,0.15031058,0.0075804354,0.000561427,0.00014219398,0.00027340223,0.00089262816,0.6657048],"genre_scores_gemma":[0.9489407,0.0026555054,0.017867085,0.00022545345,0.00015499769,0.00007009037,0.00009511803,0.00007340736,0.029917724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913764,0.00047379883,0.000030313135,0.00012336335,0.00013883732,0.000095867166],"domain_scores_gemma":[0.9990853,0.00055324123,0.000060179693,0.0001434069,0.00007165132,0.000086215354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053150253,0.00033030793,0.0002885283,0.0007297547,0.0016926652,0.004284193,0.0006075731,0.0013841058,0.010875504],"category_scores_gemma":[0.0029274262,0.00047366667,0.00018171551,0.0012710867,0.0019172025,0.0066601336,0.001826948,0.0014667698,0.0014641358],"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.00012464612,0.00009247962,0.0018628158,0.00018649033,0.000015523892,0.00027726757,0.0060421545,0.0033972815,0.0005173676,0.8550929,0.010174033,0.12221705],"study_design_scores_gemma":[0.000035576693,0.000066748114,0.0029056217,0.0002052016,0.000039503826,0.0005939891,0.0062856996,0.011528697,0.001150262,0.82735586,0.1497971,0.00003588299],"about_ca_topic_score_codex":0.0021262325,"about_ca_topic_score_gemma":0.0034971682,"teacher_disagreement_score":0.010875504,"about_ca_system_score_codex":0.0011733186,"about_ca_system_score_gemma":0.0006324168,"threshold_uncertainty_score":0.03638214},"labels":[],"label_agreement":null},{"id":"W1530260571","doi":"10.1007/978-3-642-02611-9_82","title":"Direct Estimation of Biological Growth Properties from Image Data Using the “GRID” Model","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Grid; Biological system; Iterated function; Domain (mathematical analysis); Mathematics; Minification; Computer science; Algorithm; Mathematical optimization; Biology; Geometry","score_opus":0.14666393740953898,"score_gpt":0.31124707258719314,"score_spread":0.16458313517765416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530260571","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.04015256,0.00018374837,0.9578361,0.00007141735,0.000019456462,0.000018727556,0.00024030716,0.00079351175,0.00068408705],"genre_scores_gemma":[0.49492192,0.0006578858,0.5011968,0.00007633523,0.000035049517,0.00012969789,0.0012747339,0.00023746118,0.001470088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998617,0.000030961444,0.00000670598,0.00004744681,0.000039468145,0.000013692976],"domain_scores_gemma":[0.9994978,0.00027835908,0.00006125068,0.00009826589,0.000049608647,0.000014790724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043978886,0.00040147986,0.0006281216,0.00050224864,0.00010896848,0.00064205495,0.0008925752,0.0006662028,0.00090302253],"category_scores_gemma":[0.0019324264,0.00048127866,0.00061833934,0.00088300975,0.00036937583,0.00095816085,0.00061572326,0.0005591063,0.0007213503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026180403,0.00006558216,0.0063007944,0.00032042657,0.00014294915,0.00017487342,0.00008563092,0.6132445,0.06341078,0.009188802,0.002247864,0.30455604],"study_design_scores_gemma":[0.0000067206374,0.000013424959,0.0012210289,0.000004754832,0.0000063254292,0.00005942857,0.000005100596,0.9920556,0.0028379946,0.0033969344,0.00038392225,0.000008732014],"about_ca_topic_score_codex":0.0029872353,"about_ca_topic_score_gemma":0.0030833315,"teacher_disagreement_score":0.0029872353,"about_ca_system_score_codex":0.00030446,"about_ca_system_score_gemma":0.00046710332,"threshold_uncertainty_score":0.005939722},"labels":[],"label_agreement":null},{"id":"W1530262931","doi":"10.1007/11765448_11","title":"Using Semantic Constraints to Improve Question Answering","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Redundancy (engineering); Question answering; Information retrieval; Ranking (information retrieval); Rank (graph theory); Artificial intelligence; Natural language processing; Semantic Web","score_opus":0.02340020090838834,"score_gpt":0.2666794486687881,"score_spread":0.24327924776039977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530262931","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.017872361,0.0022543161,0.9515891,0.0019219262,0.0005749865,0.00027676116,0.0028008483,0.009116707,0.0135929445],"genre_scores_gemma":[0.16605385,0.001370023,0.80915713,0.0006877706,0.0004791955,0.00041028473,0.012415063,0.0017655732,0.007661135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957343,0.0017832697,0.00032502817,0.0007654264,0.0011908946,0.00020110467],"domain_scores_gemma":[0.9856296,0.010359491,0.00035182785,0.0015791728,0.0017960347,0.0002838641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003960041,0.001311461,0.0015161126,0.0021937129,0.0011269099,0.00282219,0.0027798251,0.0016957654,0.016430728],"category_scores_gemma":[0.02217713,0.000940644,0.0015574886,0.0029529724,0.0008505856,0.010785346,0.0033831738,0.0036386964,0.0042750207],"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.0004384602,0.00043547875,0.0013961171,0.0013408465,0.0001702893,0.00017001962,0.0011518225,0.018305216,0.018653518,0.10535361,0.08772308,0.7648615],"study_design_scores_gemma":[0.00017501399,0.00012973034,0.0011903347,0.00025466306,0.0002955301,0.0002869385,0.0005256254,0.5427093,0.022586513,0.31830388,0.11344532,0.000097132965],"about_ca_topic_score_codex":0.004457059,"about_ca_topic_score_gemma":0.00667999,"teacher_disagreement_score":0.016430728,"about_ca_system_score_codex":0.00094747776,"about_ca_system_score_gemma":0.0014902125,"threshold_uncertainty_score":0.05496627},"labels":[],"label_agreement":null},{"id":"W1530346371","doi":"10.1007/978-3-540-72530-5_58","title":"Robotic Target Tracking with Approximation Space-Based Feedback During Reinforcement Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power Line Inspection Robots","field":"Engineering","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 Manitoba","funders":"","keywords":"Crawling; Computer science; Reinforcement learning; Artificial intelligence; Robot; Tracking (education); Computer vision; Line (geometry); Simulation; Mathematics","score_opus":0.012890451675263221,"score_gpt":0.21606839992678797,"score_spread":0.20317794825152474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530346371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022253316,0.00019650489,0.9741189,0.00006766158,0.0000477414,0.000025337113,0.0000119681545,0.0005827425,0.0026959518],"genre_scores_gemma":[0.90249586,0.00010086856,0.09477609,0.000047972797,0.000025907535,0.0000645794,0.00003144927,0.00005527483,0.0024019158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997403,0.000060540457,0.000012049757,0.000051720614,0.000099686484,0.000035707664],"domain_scores_gemma":[0.9993773,0.00033335164,0.00006018764,0.00007617854,0.00011912937,0.000033842025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943267,0.00051826297,0.0006059186,0.00018866376,0.00023985213,0.00048963865,0.0008825959,0.00063830777,0.0015649422],"category_scores_gemma":[0.0018252861,0.0002983422,0.00030346832,0.00020658631,0.00054318376,0.00064123975,0.0008476288,0.0009534273,0.00031397125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031935048,0.00010652796,0.0005010617,0.000093237904,0.00004205063,0.00008783902,0.000112013906,0.7860051,0.021124328,0.00872325,0.0013450601,0.18154012],"study_design_scores_gemma":[0.000008726652,0.000042334224,0.000078628225,0.0000035319774,0.0000035035823,0.000018459368,0.0000021141993,0.9966859,0.0015791929,0.0013466041,0.00022787008,0.0000030719202],"about_ca_topic_score_codex":0.0025081758,"about_ca_topic_score_gemma":0.0020617798,"teacher_disagreement_score":0.0025081758,"about_ca_system_score_codex":0.00041422134,"about_ca_system_score_gemma":0.00042646227,"threshold_uncertainty_score":0.0052352548},"labels":[],"label_agreement":null},{"id":"W1530406617","doi":"10.1007/978-3-642-15555-0_44","title":"Contour Grouping and Abstraction Using Simple Part Models","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Vocabulary; Abstraction; Simple (philosophy); Set (abstract data type); Artificial intelligence; Image (mathematics); Object (grammar); Pattern recognition (psychology); Ground truth; Natural language processing; Computer vision; Programming language; Linguistics","score_opus":0.04111924362959952,"score_gpt":0.2737274122449586,"score_spread":0.2326081686153591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530406617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029483223,0.0001271761,0.9954334,0.000021214684,0.0000203935,0.000021778149,0.00003216337,0.00077446236,0.0006210873],"genre_scores_gemma":[0.13749883,0.00070933736,0.8543853,0.00007190199,0.000072652205,0.00007871115,0.0004434944,0.0007283567,0.0060114767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957174,0.000059272712,0.000025259245,0.00012221735,0.0001701889,0.000051393603],"domain_scores_gemma":[0.9992429,0.0002263839,0.000050642488,0.00035527255,0.00008749503,0.000037246467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561867,0.0010806806,0.0016597266,0.0014796363,0.0005054404,0.0021271391,0.001838471,0.0011755633,0.0066327],"category_scores_gemma":[0.0017762309,0.0012094048,0.0024685254,0.002176079,0.00090946193,0.0030246037,0.0019815378,0.0014745959,0.0025106932],"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.00035081673,0.00008029712,0.0006936824,0.00026308233,0.00014520295,0.00021996429,0.00028223146,0.19137022,0.06823069,0.054014195,0.004913617,0.67943597],"study_design_scores_gemma":[0.0000125126135,0.00006024463,0.00037832005,0.000017426602,0.00004490188,0.0001544214,0.00002375453,0.9508595,0.0101944925,0.033741295,0.004485461,0.000027693864],"about_ca_topic_score_codex":0.0023696949,"about_ca_topic_score_gemma":0.0028071576,"teacher_disagreement_score":0.0066327,"about_ca_system_score_codex":0.0005127435,"about_ca_system_score_gemma":0.0005141253,"threshold_uncertainty_score":0.022188544},"labels":[],"label_agreement":null},{"id":"W1530443667","doi":"10.1007/3-540-44839-x_76","title":"Relationships Between Selected Software Measures and Latent Bug-Density: Guidelines for Improving Quality","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":60,"is_retracted":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; Carleton University","funders":"","keywords":"Computer science; Software quality; Quality (philosophy); Software development; Software engineering; Software bug; Software metric; Software; Work (physics); Software quality analyst; Verification and validation; Software peer review; Software construction; Data science; Engineering; Operations management; Programming language","score_opus":0.11930376333376365,"score_gpt":0.3259558737648782,"score_spread":0.2066521104311146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530443667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122650445,0.010335526,0.8428535,0.005282808,0.0002923252,0.0011650809,0.0048756655,0.0053069806,0.0072376058],"genre_scores_gemma":[0.41327018,0.0017618524,0.57852507,0.00050965603,0.00017220694,0.0012156272,0.0024233295,0.0006146626,0.0015074624],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9799136,0.012130189,0.0024086542,0.0016076603,0.0036318677,0.00030808695],"domain_scores_gemma":[0.5746707,0.3417402,0.030618487,0.016359808,0.034474712,0.0021361469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.039643068,0.002075643,0.0024895854,0.009286223,0.0011368684,0.0053461,0.0040366338,0.0023172572,0.0058586355],"category_scores_gemma":[0.29229856,0.0012666526,0.002059353,0.011257232,0.0017529356,0.0066854055,0.0017593874,0.0037114574,0.0017464277],"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.00068966305,0.00093083066,0.43173954,0.002954799,0.002041575,0.00029839922,0.0021918428,0.015436837,0.0038911619,0.01660452,0.030585341,0.49263543],"study_design_scores_gemma":[0.0009019156,0.0029247827,0.58851904,0.0036219084,0.0070706075,0.0013781573,0.003266092,0.19884035,0.011307741,0.15993391,0.02161664,0.0006189819],"about_ca_topic_score_codex":0.0035101653,"about_ca_topic_score_gemma":0.007889025,"teacher_disagreement_score":0.039643068,"about_ca_system_score_codex":0.0013500134,"about_ca_system_score_gemma":0.002656394,"threshold_uncertainty_score":0.20965505},"labels":[],"label_agreement":null},{"id":"W1530465016","doi":"10.1007/978-3-642-04383-3_15","title":"On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":88,"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; Concordia University; Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Traverse; Wireless sensor network; Line (geometry); Range (aeronautics); Computer science; Line segment; Algorithm; Plane (geometry); Approximation algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Geometry; Artificial intelligence; Computer network; Engineering","score_opus":0.013524354465271586,"score_gpt":0.2316597490083877,"score_spread":0.21813539454311612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530465016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041469175,0.000873957,0.9497972,0.00028955672,0.000060859686,0.00011153296,0.00016495754,0.0002827539,0.0069500203],"genre_scores_gemma":[0.6397978,0.0018179798,0.34312227,0.00019672643,0.00013520692,0.0004343601,0.0005226577,0.0008704954,0.013102401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994753,0.00019323864,0.000019103534,0.00008968837,0.00013687168,0.000085815394],"domain_scores_gemma":[0.9986565,0.0009989425,0.00009858495,0.000080789854,0.00010497185,0.000060188813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090033386,0.0021843193,0.001599423,0.00090515794,0.00052330235,0.0008417182,0.0017732389,0.0012079686,0.0040221154],"category_scores_gemma":[0.0039648153,0.0005703913,0.0008173792,0.0012985688,0.00081746647,0.0015552271,0.0014798217,0.0010274133,0.00054717046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027277833,0.00006198692,0.00051794254,0.00025094216,0.000047887443,0.00005429868,0.00013507024,0.90681016,0.009446073,0.018454166,0.003648483,0.060300216],"study_design_scores_gemma":[0.000013136111,0.00011017428,0.0002996362,0.000019334371,0.000013722837,0.000048224803,0.000037038873,0.98962504,0.0014043825,0.0075590294,0.0008616721,0.00000861608],"about_ca_topic_score_codex":0.003397116,"about_ca_topic_score_gemma":0.0027374404,"teacher_disagreement_score":0.0040221154,"about_ca_system_score_codex":0.0010095797,"about_ca_system_score_gemma":0.00069588504,"threshold_uncertainty_score":0.013455331},"labels":[],"label_agreement":null},{"id":"W1530485504","doi":"10.1007/3-540-45490-x_3","title":"From Computational Intelligence to Web Intelligence: An Ensemble from Potpourri","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Humanity; World Wide Web; Potpourri; Artificial intelligence; Political science; Law","score_opus":0.02761721328561722,"score_gpt":0.2759463979112331,"score_spread":0.24832918462561587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530485504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023535993,0.12308317,0.50736135,0.059222996,0.0041007195,0.0002080153,0.0008628518,0.0014297508,0.28019512],"genre_scores_gemma":[0.3418364,0.11467009,0.39853436,0.010170568,0.009168634,0.0004023837,0.0029702487,0.001667178,0.120580174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.0002695989,0.00008252807,0.0002750912,0.00031143124,0.00006754051],"domain_scores_gemma":[0.998343,0.00083605206,0.000042095726,0.00040734868,0.00026329857,0.00010819312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015749157,0.0008939834,0.0013895255,0.003916181,0.0018584932,0.006464739,0.0014989154,0.0015475956,0.0060098246],"category_scores_gemma":[0.003981349,0.0006681701,0.0007934285,0.00485144,0.0037632822,0.019217428,0.0046585333,0.0043953424,0.0031563742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088467656,0.00010108066,0.0011609857,0.0005149647,0.00007291517,0.0002813909,0.0015078608,0.0032733476,0.0005370476,0.6305724,0.053118736,0.3087708],"study_design_scores_gemma":[0.0000105283225,0.00002845471,0.000694108,0.00020210506,0.00003172442,0.00032077634,0.00034395282,0.014794073,0.0009580727,0.80682486,0.17576332,0.000028098912],"about_ca_topic_score_codex":0.0019228425,"about_ca_topic_score_gemma":0.0024546187,"teacher_disagreement_score":0.006464739,"about_ca_system_score_codex":0.0012516946,"about_ca_system_score_gemma":0.0010904709,"threshold_uncertainty_score":0.020104825},"labels":[],"label_agreement":null},{"id":"W1530545262","doi":"10.1007/978-3-642-04380-2_84","title":"A Real-Time Transfer and Adaptive Learning Approach for Game Agents in a Layered Architecture","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Concordia University","funders":"","keywords":"Computer science; Architecture; Transfer of learning; Artificial intelligence; Human–computer interaction; Real-time computing; Distributed computing; Computer architecture","score_opus":0.026707445206418993,"score_gpt":0.249829523060819,"score_spread":0.2231220778544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530545262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008962427,0.00004477678,0.98850983,0.00009555943,0.000024518156,0.00003115661,0.000009488611,0.0003511158,0.0019711126],"genre_scores_gemma":[0.5892192,0.00011080843,0.3998875,0.00012229774,0.000041779258,0.00025465252,0.000048572692,0.00013148002,0.010183692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964607,0.00010162454,0.000020709953,0.00006334303,0.00010620908,0.00006206196],"domain_scores_gemma":[0.9993987,0.0003045644,0.000037709153,0.00007130795,0.00012964655,0.000058016645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088292424,0.0006108746,0.0007249084,0.00028729034,0.00049712224,0.0009083166,0.0025908833,0.0013240158,0.004344675],"category_scores_gemma":[0.002339152,0.0004196905,0.0006394693,0.00030402085,0.00096795516,0.0015494381,0.0022594247,0.0019783257,0.0005848731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109963425,0.0001158948,0.00029810224,0.000065615466,0.000062633524,0.00009889364,0.00018643717,0.83212584,0.0064112456,0.05724783,0.0015399224,0.101737656],"study_design_scores_gemma":[0.000004280845,0.000013056443,0.00001989934,0.0000014800161,0.0000039241677,0.000006745436,0.0000043816685,0.993383,0.00031680023,0.0060708583,0.00017244478,0.000003118161],"about_ca_topic_score_codex":0.0053620166,"about_ca_topic_score_gemma":0.0047263633,"teacher_disagreement_score":0.0053620166,"about_ca_system_score_codex":0.00094441115,"about_ca_system_score_gemma":0.0009337238,"threshold_uncertainty_score":0.014534354},"labels":[],"label_agreement":null},{"id":"W1530557229","doi":"10.1007/11546207_29","title":"Application of Smodels in Quartet Based Phylogeny Construction","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Consistency (knowledge bases); Computer science; Set (abstract data type); Dynamic programming; Taxon; Phylogenetics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Paleontology; Biology","score_opus":0.012189819203859623,"score_gpt":0.2321604293070798,"score_spread":0.2199706101032202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530557229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013552121,0.00008974791,0.98328096,0.000083462684,0.00005286242,0.000058560814,0.0000951991,0.0010729317,0.0017140857],"genre_scores_gemma":[0.09459699,0.00009671746,0.90218294,0.00008149734,0.000040894323,0.00010646808,0.0005519629,0.00051846204,0.0018240799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.00031656196,0.000083859944,0.00025776392,0.00022217652,0.00006933839],"domain_scores_gemma":[0.9976051,0.001202955,0.00012309803,0.0005900246,0.00037584428,0.00010305393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018636528,0.0005714135,0.0013963399,0.0016245455,0.001446828,0.001282948,0.0019327962,0.0013391797,0.006097989],"category_scores_gemma":[0.005015664,0.00082056754,0.0015830307,0.001599405,0.0010845977,0.001966871,0.0026157831,0.002234796,0.0019642904],"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.00022597636,0.0002933737,0.00319548,0.0004162996,0.00015155118,0.00023502228,0.00071350246,0.15922368,0.013393342,0.1432202,0.0065952367,0.6723364],"study_design_scores_gemma":[0.000034383833,0.00010572701,0.00052037684,0.00005154743,0.000038506638,0.00010273578,0.00009932579,0.8162359,0.0043576434,0.17173535,0.0066960985,0.000022510108],"about_ca_topic_score_codex":0.0013804777,"about_ca_topic_score_gemma":0.0027422796,"teacher_disagreement_score":0.006097989,"about_ca_system_score_codex":0.00054643844,"about_ca_system_score_gemma":0.00080859853,"threshold_uncertainty_score":0.020399868},"labels":[],"label_agreement":null},{"id":"W1530581289","doi":"10.1007/978-3-642-15705-9_74","title":"Fast and Accurate Reconstruction of HARDI Data Using Compressed Sensing","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Mental Health","keywords":"Computer science; Compressed sensing; Diffusion MRI; Diffusion; Pattern recognition (psychology); Artificial intelligence; Data mining; Magnetic resonance imaging","score_opus":0.09438748449517516,"score_gpt":0.3712630114860339,"score_spread":0.27687552699085877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530581289","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.01143316,0.00037353789,0.9843231,0.00076365046,0.0001545602,0.00004353339,0.00036301478,0.0005607313,0.0019846708],"genre_scores_gemma":[0.16241065,0.0008991741,0.8316149,0.0003710282,0.00020574263,0.00010630652,0.0011389868,0.00023944167,0.0030137924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994573,0.000102479324,0.00003569715,0.000050760566,0.00030538792,0.000048393034],"domain_scores_gemma":[0.9980233,0.0010237382,0.00016578044,0.00044315017,0.00024500783,0.000099184705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834679,0.0010167524,0.00093093584,0.0007637889,0.0003527223,0.0014183518,0.00082991854,0.0013957847,0.003081025],"category_scores_gemma":[0.0052558538,0.00066325,0.0004890134,0.0013129327,0.00074790855,0.0017815026,0.0018438444,0.002547279,0.0013725889],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011085646,0.0001740849,0.0018974922,0.0009173765,0.00013218973,0.00096525624,0.0004076799,0.23374882,0.1783482,0.043083068,0.017510591,0.5217067],"study_design_scores_gemma":[0.000033302862,0.00005950232,0.0005203836,0.00003575541,0.0000109965395,0.0006086584,0.000058010148,0.9552709,0.024646608,0.014675483,0.0040358733,0.00004455128],"about_ca_topic_score_codex":0.0011743428,"about_ca_topic_score_gemma":0.0015850464,"teacher_disagreement_score":0.003081025,"about_ca_system_score_codex":0.00022714231,"about_ca_system_score_gemma":0.00072536996,"threshold_uncertainty_score":0.010307074},"labels":[],"label_agreement":null},{"id":"W1530614260","doi":"10.1007/978-3-540-24709-8_105","title":"A Spatial Multivariate Approach to the Analysis of Accessibility to Health Care Facilities in Canada","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Transport and Accessibility","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":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Multivariate statistics; Computer science; Service (business); Population; Set (abstract data type); Operations research; Focus (optics); Multivariate analysis; Key (lock); Variable (mathematics); Computer security; Machine learning; Engineering; Business; Medicine; Mathematics; Environmental health; Marketing","score_opus":0.02566000944110793,"score_gpt":0.2891104021181015,"score_spread":0.2634503926769936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530614260","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.783538,0.015804097,0.1462728,0.005417859,0.00024147787,0.0003401956,0.013188859,0.00050911197,0.034687605],"genre_scores_gemma":[0.9328388,0.0051033897,0.048834827,0.0001182473,0.000065922075,0.00014484441,0.0025708769,0.00012144865,0.010201559],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99865735,0.0005108774,0.00007052424,0.00015022304,0.00034442928,0.00026669743],"domain_scores_gemma":[0.997027,0.0013084508,0.00018625634,0.00010987206,0.001167865,0.00020060387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016858098,0.0006174045,0.000806094,0.0058455365,0.002872498,0.0024152098,0.0014685394,0.00037807683,0.0039748005],"category_scores_gemma":[0.006985332,0.00042943092,0.0017461701,0.013491624,0.0011973224,0.000848717,0.0017576689,0.0010573288,0.00015128625],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023810672,0.00014628773,0.41670224,0.00047447335,0.0013193195,0.00065896346,0.0041366406,0.12919416,0.0012056056,0.16629787,0.023393502,0.25623286],"study_design_scores_gemma":[0.000032932418,0.00008447092,0.6055248,0.0003522229,0.0005242881,0.00035757126,0.011376691,0.28716108,0.0006520902,0.059550293,0.034185875,0.00019774269],"about_ca_topic_score_codex":0.9930779,"about_ca_topic_score_gemma":0.9949576,"teacher_disagreement_score":0.022700666,"about_ca_system_score_codex":0.022700666,"about_ca_system_score_gemma":0.04196527,"threshold_uncertainty_score":0.16470563},"labels":[],"label_agreement":null},{"id":"W1530759905","doi":"10.1007/978-3-540-69812-8_25","title":"Robust 3D Watermarking Technique Using Eigendecomposition and Nonnegative Matrix Factorization","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Eigendecomposition of a matrix; Matrix decomposition; Digital watermarking; Non-negative matrix factorization; Factorization; Algorithm; Computer vision; Artificial intelligence; Eigenvalues and eigenvectors; Image (mathematics)","score_opus":0.02570028001904287,"score_gpt":0.25787724764154124,"score_spread":0.23217696762249837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530759905","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.008692072,0.0003157662,0.9890392,0.00008445737,0.00008401833,0.000021731028,0.000045630382,0.00036351537,0.001353657],"genre_scores_gemma":[0.10049516,0.00063623296,0.89345795,0.00008831598,0.000070070004,0.00006215335,0.00023077225,0.00011744056,0.004841883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944836,0.00006984449,0.000029405755,0.000106548076,0.00030568152,0.00004007674],"domain_scores_gemma":[0.99957997,0.00009273812,0.00006407788,0.00011180913,0.00013729758,0.000014161921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033628067,0.0008712693,0.00075498497,0.0008392104,0.00042940368,0.00071594235,0.00061484834,0.00086347986,0.0024793006],"category_scores_gemma":[0.00075312564,0.0004404137,0.0009970294,0.0009786544,0.00043586254,0.001391425,0.0008668734,0.00095269806,0.001015124],"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.00022548437,0.00009726444,0.00037385075,0.00019469955,0.000077063305,0.0002196079,0.000098891906,0.034420487,0.4640053,0.01713222,0.0038743978,0.47928077],"study_design_scores_gemma":[0.000024882082,0.00016751826,0.00096448377,0.000027920854,0.00006088758,0.0009928688,0.00005855401,0.7857349,0.19469132,0.006388274,0.01080374,0.00008456605],"about_ca_topic_score_codex":0.00048155722,"about_ca_topic_score_gemma":0.0009769622,"teacher_disagreement_score":0.0024793006,"about_ca_system_score_codex":0.00023223422,"about_ca_system_score_gemma":0.00042038364,"threshold_uncertainty_score":0.0082941055},"labels":[],"label_agreement":null},{"id":"W1530804984","doi":"10.1007/978-3-642-01551-9_18","title":"Prediction of Contiguous Regions in the Amniote Ancestral Genome","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological Sciences","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":"Agence Nationale de la Recherche","keywords":"Amniote; Genome; Lineage (genetic); Biology; Evolutionary biology; Extant taxon; Computational biology; Gene; Genetics; Vertebrate","score_opus":0.03126955574228415,"score_gpt":0.21713904230969075,"score_spread":0.1858694865674066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530804984","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.94736904,0.002033729,0.03776632,0.00020044077,0.000043489432,0.00003492455,0.0064060017,0.0011577882,0.004988219],"genre_scores_gemma":[0.92464083,0.0008723403,0.049406163,0.000086531974,0.00005249,0.000026107613,0.021701314,0.00022970591,0.0029845675],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999312,0.00000982243,0.0000044342287,0.0000354973,0.000010747432,0.000008334328],"domain_scores_gemma":[0.9996753,0.0001735581,0.0000412687,0.000030711963,0.000024811201,0.00005439199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019372249,0.00025386552,0.00035432386,0.00114964,0.00034704444,0.000655176,0.0004364881,0.0005519297,0.0035212107],"category_scores_gemma":[0.00062193046,0.00028426878,0.00065488066,0.00088282,0.00021165035,0.00025103427,0.0003248537,0.0005590559,0.0016419002],"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.003634731,0.00025424725,0.089132436,0.00083290593,0.00031135298,0.0048515955,0.0009794714,0.04274653,0.65303236,0.00796953,0.007395691,0.18885912],"study_design_scores_gemma":[0.0005373043,0.0011053298,0.4763943,0.00038171135,0.0012235924,0.0063918796,0.0010948564,0.27354726,0.1620893,0.017822467,0.05927335,0.00013867214],"about_ca_topic_score_codex":0.0017760195,"about_ca_topic_score_gemma":0.0029468436,"teacher_disagreement_score":0.0035212107,"about_ca_system_score_codex":0.00020597519,"about_ca_system_score_gemma":0.00024933307,"threshold_uncertainty_score":0.011779606},"labels":[],"label_agreement":null},{"id":"W1530825664","doi":"10.1007/978-3-540-74796-3_59","title":"Evaluating Reduced-Functionality Interfaces According to Feature Findability and Awareness","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"University of British Columbia","funders":"","keywords":"Interface (matter); Computer science; Feature (linguistics); Scope (computer science); Software; Layer (electronics); Human–computer interaction; World Wide Web; Information retrieval; Operating system; Programming language","score_opus":0.12564652899838022,"score_gpt":0.39079141203380535,"score_spread":0.26514488303542516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530825664","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.95528895,0.00011756641,0.041173194,0.00003314014,0.000012450114,0.00009840829,0.00016219816,0.0013637396,0.0017504811],"genre_scores_gemma":[0.96314514,0.000046786463,0.0351072,0.000021935924,0.0000066241732,0.000052090043,0.0005995656,0.00015143715,0.0008691644],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99693334,0.0007956544,0.0003022649,0.00035314533,0.0014156156,0.00019998926],"domain_scores_gemma":[0.9679533,0.024236724,0.0020826692,0.0018109279,0.0033263983,0.00058985193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030354012,0.00082120235,0.0005741617,0.001697593,0.00018541112,0.0015277345,0.0011933662,0.0010899107,0.0036369872],"category_scores_gemma":[0.033525776,0.00034488193,0.00083017355,0.00072430924,0.00035536443,0.002311057,0.00095668994,0.0004805523,0.00078385766],"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.01628995,0.001631499,0.18663143,0.0010463605,0.0007288549,0.00036410682,0.001281404,0.046186734,0.17826626,0.002496583,0.0014411873,0.5636357],"study_design_scores_gemma":[0.00048204217,0.010541791,0.19997093,0.00011256631,0.0013757815,0.00071555696,0.0009572936,0.6222387,0.15631881,0.0056127976,0.0015438235,0.00012994415],"about_ca_topic_score_codex":0.0012812878,"about_ca_topic_score_gemma":0.0014587423,"teacher_disagreement_score":0.0036369872,"about_ca_system_score_codex":0.0003975664,"about_ca_system_score_gemma":0.00040844048,"threshold_uncertainty_score":0.016052902},"labels":[],"label_agreement":null},{"id":"W1530989307","doi":"10.1007/3-540-45578-7_52","title":"Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Parallel computing; Constraint programming; Solver; Schedule; Dynamic priority scheduling; Two-level scheduling; Mathematical optimization; Programming language; Mathematics; Operating system","score_opus":0.016145709199109425,"score_gpt":0.22731769948222708,"score_spread":0.21117199028311764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530989307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07472681,0.0030009632,0.9013509,0.00046805205,0.00033077778,0.000088043314,0.00020751193,0.0029368661,0.01689004],"genre_scores_gemma":[0.50922745,0.0017544945,0.47719464,0.00011828175,0.00016525468,0.00015843207,0.00046342495,0.0006620755,0.010255963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964356,0.000060771876,0.000022813503,0.000041329622,0.00013258868,0.00009891455],"domain_scores_gemma":[0.9993586,0.00034497777,0.000039740207,0.00012867762,0.00009662789,0.000031400476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004723731,0.00074778276,0.00068046415,0.0005873529,0.0007003249,0.00078806275,0.0012000061,0.00047829704,0.0044976366],"category_scores_gemma":[0.0017241242,0.00066277036,0.00039916896,0.0014366672,0.0004506918,0.0015418732,0.0006462569,0.0011071659,0.00058644137],"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.00080075645,0.00016005448,0.00044521905,0.00035901737,0.000056314602,0.00010985444,0.00015214531,0.3748952,0.031957444,0.091222055,0.022066817,0.47777504],"study_design_scores_gemma":[0.00010386371,0.00011547299,0.00030373418,0.000020368027,0.000027963899,0.000053866006,0.0000353484,0.88688594,0.012652485,0.09209133,0.0076911435,0.00001858542],"about_ca_topic_score_codex":0.0025464708,"about_ca_topic_score_gemma":0.005988669,"teacher_disagreement_score":0.0044976366,"about_ca_system_score_codex":0.0007619921,"about_ca_system_score_gemma":0.001587655,"threshold_uncertainty_score":0.01504612},"labels":[],"label_agreement":null},{"id":"W1531013180","doi":"10.1007/3-540-45622-8_23","title":"Performance of Lookahead Control Policies in the Face of Abstractions and Approximations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Markov decision process; Abstraction; Computer science; Interpretation (philosophy); Operator (biology); Bellman equation; Task (project management); State (computer science); Optimal control; Image (mathematics); Function (biology); Face (sociological concept); Mathematical optimization; Theoretical computer science; Artificial intelligence; Markov process; Algorithm; Mathematics; Programming language","score_opus":0.023005120205627866,"score_gpt":0.25839022305198256,"score_spread":0.2353851028463547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531013180","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.8480439,0.0024868336,0.13265012,0.0014834141,0.00036127528,0.00006174417,0.00037500038,0.0018248394,0.012712901],"genre_scores_gemma":[0.99535793,0.00014127107,0.0037295101,0.00003807354,0.000012636271,0.000011062747,0.00007664487,0.00005198133,0.00058088586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738246,0.0007301665,0.000112750145,0.00029280662,0.00066249917,0.00081932533],"domain_scores_gemma":[0.96521187,0.028512603,0.001652234,0.0018020658,0.0016064892,0.0012147912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049698344,0.0009644892,0.0014463045,0.00064828026,0.0009914322,0.003017608,0.0014118408,0.0014774842,0.004442517],"category_scores_gemma":[0.034483366,0.00060502585,0.0003564072,0.0008833825,0.0016148277,0.0032049213,0.0017510676,0.0021621634,0.00041415737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034610485,0.00018161882,0.0016117188,0.000103174745,0.00004273125,0.00007721015,0.00013922408,0.95825684,0.002924083,0.0094586685,0.0018132599,0.02193049],"study_design_scores_gemma":[0.00003886721,0.00013631624,0.0003229796,0.000010971398,0.000011846157,0.0000141075325,0.000065922,0.9916643,0.0014606945,0.0061409976,0.00012161586,0.000011385353],"about_ca_topic_score_codex":0.010979805,"about_ca_topic_score_gemma":0.0047306903,"teacher_disagreement_score":0.010979805,"about_ca_system_score_codex":0.0018434637,"about_ca_system_score_gemma":0.0031539013,"threshold_uncertainty_score":0.026283324},"labels":[],"label_agreement":null},{"id":"W1531035972","doi":"10.1007/11548669_59","title":"A Comparative Evaluation of Rough Sets and Probabilistic Network Algorithms on Learning Pseudo-independent Domains","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Probabilistic logic; Computer science; Heuristics; Rough set; Artificial intelligence; Probabilistic analysis of algorithms; Algorithm; Machine learning","score_opus":0.05097814568733936,"score_gpt":0.30807070762607836,"score_spread":0.257092561938739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531035972","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.10649395,0.018332502,0.8480887,0.0026453703,0.00046001308,0.0003961448,0.0006069081,0.00078073336,0.022195702],"genre_scores_gemma":[0.54258776,0.009185349,0.44159418,0.00033347012,0.00036818697,0.0003217656,0.0011311539,0.0002778666,0.0042002886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9839295,0.009615268,0.0006797055,0.00096812815,0.004452517,0.00035494647],"domain_scores_gemma":[0.8760373,0.11131595,0.0015266554,0.005124229,0.0050862655,0.0009095872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024545569,0.0014553332,0.0027814012,0.0051833014,0.0009629316,0.005565136,0.0032712796,0.002739347,0.0036169323],"category_scores_gemma":[0.072875105,0.0005996741,0.0017173714,0.004945404,0.0026706706,0.010187673,0.0038452223,0.0024397634,0.00042742808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019228974,0.00036534594,0.0025022798,0.0008813952,0.0005154798,0.000053688982,0.0004129179,0.44454166,0.0003423265,0.17299567,0.0046233474,0.37084302],"study_design_scores_gemma":[0.00010736946,0.0003935024,0.0013309501,0.0001675411,0.00017772465,0.00006179938,0.00023538695,0.8642969,0.0005447141,0.13008843,0.0025539163,0.000041701653],"about_ca_topic_score_codex":0.005885693,"about_ca_topic_score_gemma":0.0049409643,"teacher_disagreement_score":0.024545569,"about_ca_system_score_codex":0.0043883785,"about_ca_system_score_gemma":0.0022515762,"threshold_uncertainty_score":0.12981093},"labels":[],"label_agreement":null},{"id":"W153103601","doi":"10.1007/978-3-642-39799-8_12","title":"Duet: Static Analysis for Unbounded Parallelism","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concurrency; Computer science; Invariant (physics); Abstract interpretation; Modular design; Static analysis; Bounded function; Data flow diagram; Theoretical computer science; Programming language; Data-flow analysis; Parallelism (grammar); Parallel computing; Domain (mathematical analysis); Construct (python library); Algorithm; Mathematics; Database","score_opus":0.021356358182480717,"score_gpt":0.265792047061964,"score_spread":0.2444356888794833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153103601","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.0050348775,0.0017597179,0.96077764,0.0006240547,0.0006383611,0.00010192058,0.0007463624,0.013057267,0.017259657],"genre_scores_gemma":[0.26663724,0.0030467517,0.66647726,0.0012758422,0.0013153094,0.0007054627,0.0038792791,0.014114644,0.042548284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973968,0.0005388611,0.00018030644,0.00043685292,0.0010590781,0.00038820595],"domain_scores_gemma":[0.99673176,0.0015157241,0.00013872392,0.0010394728,0.0004857244,0.000088520195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940865,0.0020636506,0.0016534667,0.0022448665,0.0014248644,0.002697156,0.0038399692,0.0010733886,0.020171512],"category_scores_gemma":[0.007037966,0.0014781675,0.0025091816,0.0025216138,0.002175998,0.007933136,0.0033484735,0.0044057984,0.005382538],"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.0004741756,0.00013895675,0.0009367178,0.00111911,0.00014065186,0.00022980053,0.00034991238,0.04723059,0.0114950705,0.48420888,0.06108313,0.39259306],"study_design_scores_gemma":[0.00006471139,0.00006363667,0.00037702348,0.0002393613,0.000112719594,0.00018756856,0.00006444319,0.20246223,0.015836388,0.72502995,0.055481672,0.00008033542],"about_ca_topic_score_codex":0.0017711881,"about_ca_topic_score_gemma":0.0020858163,"teacher_disagreement_score":0.020171512,"about_ca_system_score_codex":0.0016098592,"about_ca_system_score_gemma":0.0019513413,"threshold_uncertainty_score":0.067480445},"labels":[],"label_agreement":null},{"id":"W1531038044","doi":"10.1007/978-3-642-12439-6_18","title":"Effect of Sound Source Stimuli on the Perception of Reverberation in Large Volumes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hearing Loss and Rehabilitation","field":"Neuroscience","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":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Reverberation; Perception; Stimulus (psychology); Acoustics; Auditory perception; Computer science; Noise (video); Speech recognition; Psychoacoustics; Psychology; Physics; Cognitive psychology; Artificial intelligence","score_opus":0.01772272278618158,"score_gpt":0.2785509758390612,"score_spread":0.2608282530528796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531038044","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.9438238,0.0035753197,0.016026098,0.00029327505,0.0008403993,0.000097071475,0.0004486682,0.0013080657,0.033587366],"genre_scores_gemma":[0.9733812,0.0022676,0.007304568,0.00030658735,0.0003963129,0.000074969765,0.0005741667,0.0009246656,0.014770036],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99982846,0.00005856436,0.000011302542,0.000036564787,0.000049768623,0.000015217836],"domain_scores_gemma":[0.9960509,0.0034139294,0.00007709431,0.00008535612,0.00016846479,0.00020427423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045043303,0.0003380927,0.000307163,0.00036508692,0.00022548254,0.0012167142,0.0003864178,0.0004953633,0.017010583],"category_scores_gemma":[0.004240264,0.00021983136,0.00028316514,0.00027718983,0.0002535772,0.0008101364,0.0006222978,0.00065962056,0.0013581107],"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.008360681,0.00015939756,0.0009019185,0.0008056122,0.00007194319,0.0003811917,0.0006712382,0.00065167644,0.91700864,0.0009979045,0.0019478023,0.06804203],"study_design_scores_gemma":[0.0011761562,0.007954166,0.18825567,0.0003703229,0.000828572,0.00408477,0.0015489021,0.01074943,0.75135225,0.007981586,0.02554544,0.0001528216],"about_ca_topic_score_codex":0.00018416751,"about_ca_topic_score_gemma":0.00017008699,"teacher_disagreement_score":0.017010583,"about_ca_system_score_codex":0.00010893742,"about_ca_system_score_gemma":0.000093116985,"threshold_uncertainty_score":0.056906044},"labels":[],"label_agreement":null},{"id":"W1531045795","doi":"10.1007/978-3-642-15567-3_26","title":"A New Algorithmic Approach for Contrast Enhancement","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"McMaster University","funders":"","keywords":"Contrast (vision); Computer science; Histogram equalization; Measure (data warehouse); Tone mapping; Equalization (audio); Histogram; Mathematical optimization; Algorithm; Distortion (music); Linear programming; Artificial intelligence; Mathematics; Computer vision; Bandwidth (computing); Image (mathematics); Data mining","score_opus":0.01373552411811472,"score_gpt":0.2504953992873359,"score_spread":0.23675987516922117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531045795","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.0005052794,0.00013490698,0.99625045,0.000044679655,0.000052184176,0.000021907452,0.000011412543,0.00017453665,0.0028046824],"genre_scores_gemma":[0.01070341,0.00040538094,0.98033845,0.000078352525,0.00009604558,0.00006894555,0.00005774709,0.00013150994,0.0081201205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996691,0.000035593883,0.00001896471,0.000088908484,0.00016357344,0.000023904442],"domain_scores_gemma":[0.9997336,0.00009267934,0.000014234404,0.00006401034,0.00008237539,0.000013195832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035219343,0.0010304335,0.0005656845,0.00092561677,0.0005253845,0.0015097801,0.0015922694,0.0010173353,0.008332819],"category_scores_gemma":[0.0009239453,0.0005169415,0.0008644991,0.0006847088,0.0008672052,0.0017888781,0.0013743497,0.0016507022,0.0031535625],"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.00006376836,0.00006865576,0.00015435014,0.0002892032,0.000046543813,0.0001459923,0.00012384122,0.017594736,0.08203323,0.3071827,0.008763257,0.5835337],"study_design_scores_gemma":[0.000038173053,0.00017033836,0.00043822528,0.00010126111,0.00008576587,0.0016481688,0.000071524264,0.55917656,0.05824672,0.2621731,0.11777306,0.00007714597],"about_ca_topic_score_codex":0.00052645674,"about_ca_topic_score_gemma":0.00087275874,"teacher_disagreement_score":0.008332819,"about_ca_system_score_codex":0.00033478535,"about_ca_system_score_gemma":0.00044637854,"threshold_uncertainty_score":0.02787608},"labels":[],"label_agreement":null},{"id":"W1531070716","doi":"10.1007/978-3-540-32258-0_2","title":"Conversational Semantics with Social Commitments","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Cooperativeness; Sincerity; Computer science; Semantics (computer science); Meaning (existential); State (computer science); Mental state; Human–computer interaction; World Wide Web; Artificial intelligence; Cognitive science; Programming language; Epistemology; Social psychology; Psychology; Personality","score_opus":0.02265165496443826,"score_gpt":0.24759661109315184,"score_spread":0.22494495612871357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531070716","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008856079,0.001670781,0.79469997,0.0038300438,0.0008509663,0.0001573105,0.00057883805,0.0012209988,0.18813501],"genre_scores_gemma":[0.62092704,0.0021945008,0.2738524,0.0010537452,0.0012740714,0.0009089232,0.0019387995,0.0013298684,0.09652075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968971,0.0015669629,0.00029510527,0.0004040252,0.0006282498,0.00020856824],"domain_scores_gemma":[0.9981336,0.00095940137,0.00008396553,0.0004474373,0.00026729476,0.00010830823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024251207,0.0014977447,0.00095962477,0.001468763,0.002719512,0.0062678764,0.0021383658,0.0022810346,0.016126735],"category_scores_gemma":[0.005764803,0.0013135518,0.0013395878,0.0019465375,0.004459389,0.016629055,0.004311463,0.0046793544,0.004333845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012317987,0.000008907276,0.0000133678095,0.000039979306,0.0000047298836,0.000028359631,0.00037553287,0.0006872558,0.0001594675,0.99081576,0.0016680643,0.0061863437],"study_design_scores_gemma":[0.000008879068,0.000005088406,0.000012322877,0.00002175612,0.000007573479,0.000037858114,0.00011583135,0.004051801,0.0003134015,0.97443014,0.02098666,0.000008674412],"about_ca_topic_score_codex":0.0013574046,"about_ca_topic_score_gemma":0.0010379945,"teacher_disagreement_score":0.016126735,"about_ca_system_score_codex":0.0017218433,"about_ca_system_score_gemma":0.001065732,"threshold_uncertainty_score":0.053949237},"labels":[],"label_agreement":null},{"id":"W1531113454","doi":"10.1007/978-3-642-01818-3_13","title":"Automatic Frame Extraction from Sentences","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"Computer science; FrameNet; Natural language processing; Artificial intelligence; Automatic summarization; Frame (networking); Dependency (UML); Task (project management); Novelty; Information extraction; Textual entailment; Parsing; Logical consequence","score_opus":0.0127621946886624,"score_gpt":0.2709686067026411,"score_spread":0.2582064120139787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531113454","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.02931733,0.00398382,0.90096796,0.00068138615,0.0009909228,0.00058755634,0.01414251,0.030385548,0.018942993],"genre_scores_gemma":[0.110816486,0.0026962725,0.8178538,0.00025910407,0.00037859118,0.00048150762,0.047031187,0.0022137198,0.018269323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953294,0.00005972639,0.00004909118,0.00016996155,0.0001211218,0.00006716308],"domain_scores_gemma":[0.9994041,0.00020463769,0.000040295472,0.00008565025,0.00024012597,0.000025222012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039914632,0.0020484058,0.0014023274,0.0032791814,0.0011105647,0.0014383834,0.0011382402,0.00096237165,0.013502366],"category_scores_gemma":[0.001418839,0.0007629574,0.0013611544,0.0027549213,0.00036796345,0.0017749784,0.001265795,0.0010526909,0.011569803],"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.00033777076,0.00006347127,0.0004518271,0.0008759524,0.00006614315,0.00061994046,0.0003108155,0.0010683151,0.10767728,0.008105057,0.055058062,0.82536525],"study_design_scores_gemma":[0.00018714713,0.00038568265,0.007353729,0.0007408091,0.0010325055,0.0026133342,0.0011486269,0.15384889,0.3980651,0.05245175,0.3819506,0.00022182622],"about_ca_topic_score_codex":0.0037531557,"about_ca_topic_score_gemma":0.0058021634,"teacher_disagreement_score":0.013502366,"about_ca_system_score_codex":0.0006095977,"about_ca_system_score_gemma":0.0011223637,"threshold_uncertainty_score":0.04516989},"labels":[],"label_agreement":null},{"id":"W1531170768","doi":"10.1007/3-540-44842-x_84","title":"An Explicit Solution for Computing the Euclidean d-dimensional Voronoi Diagram of Spheres in a Floating-Point Arithmetic","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"University of Calgary","keywords":"Voronoi diagram; Weighted Voronoi diagram; Power diagram; Centroidal Voronoi tessellation; Euclidean geometry; Computation; Point (geometry); Diagram; Set (abstract data type); Mathematics; Euclidean distance; SPHERES; Algorithm; Computational geometry; Bowyer–Watson algorithm; Computer science; Geometry; Physics","score_opus":0.019167042624588838,"score_gpt":0.26274728331040426,"score_spread":0.2435802406858154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531170768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011255272,0.00021294999,0.9795725,0.00012056186,0.00009600724,0.000034720026,0.000111605215,0.0005742923,0.008022138],"genre_scores_gemma":[0.17636418,0.00026337057,0.81468517,0.000094659714,0.00006971853,0.00014123505,0.00030609482,0.0003959677,0.007679526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.00004402304,0.00001909195,0.000039974224,0.00014605322,0.000042841195],"domain_scores_gemma":[0.9994854,0.00026918243,0.00002000227,0.00007420024,0.00012528918,0.00002587363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039691123,0.0006470399,0.0009685576,0.0007626895,0.00071196683,0.001243609,0.0017158247,0.0010500401,0.0093244715],"category_scores_gemma":[0.0034459434,0.00035945792,0.000652429,0.0012579706,0.00064080296,0.0015952658,0.0016522463,0.0011768787,0.002458392],"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.0001355169,0.000086809545,0.00074138254,0.0004298823,0.000049489958,0.00019527951,0.0004158432,0.33147436,0.0058921715,0.35982096,0.009828625,0.29092962],"study_design_scores_gemma":[0.000045423803,0.000018493873,0.00011585014,0.000034199544,0.000013486541,0.000066992034,0.000074254334,0.89336824,0.0018396379,0.09722517,0.0071830433,0.000015166363],"about_ca_topic_score_codex":0.0033828346,"about_ca_topic_score_gemma":0.008911991,"teacher_disagreement_score":0.0093244715,"about_ca_system_score_codex":0.0008354683,"about_ca_system_score_gemma":0.0010189391,"threshold_uncertainty_score":0.031193435},"labels":[],"label_agreement":null},{"id":"W1531189961","doi":"10.1007/978-3-642-25959-3_31","title":"Logical Topology Design for WDM Networks Using Tabu Search","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"University of Windsor","funders":"","keywords":"Tabu search; Computer science; Network topology; Logical topology; Heuristic; Topology (electrical circuits); Wavelength-division multiplexing; Computer network; Distributed computing; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.050977445676579,"score_gpt":0.2788154925475738,"score_spread":0.22783804687099482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531189961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031811584,0.0010300061,0.9545184,0.00027491056,0.00007638381,0.00025897496,0.00030746707,0.0014154051,0.01030692],"genre_scores_gemma":[0.21513312,0.00052958087,0.77982646,0.00011905093,0.000031337677,0.00037646966,0.0005616362,0.00036091072,0.0030614224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994837,0.00025899694,0.000029334724,0.000058976668,0.00010497878,0.000063994885],"domain_scores_gemma":[0.9986173,0.0009059245,0.000092881826,0.00012314541,0.00021961375,0.00004110552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011937153,0.00072032196,0.0009462351,0.0022556817,0.0008731309,0.0013400204,0.0014220028,0.0008819649,0.010620797],"category_scores_gemma":[0.00336728,0.00074341556,0.0007958376,0.0018495375,0.00066198193,0.0018587152,0.0008166715,0.000851525,0.0011013168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016799293,0.00013450116,0.00074006687,0.0004103239,0.00007594707,0.00006749805,0.00015003314,0.67925936,0.0040253284,0.029212028,0.0058940453,0.2798628],"study_design_scores_gemma":[0.000045202585,0.0000778428,0.00009118868,0.00003610872,0.000023550523,0.000038241662,0.000071469694,0.97438353,0.0011191365,0.021851389,0.0022518309,0.000010633869],"about_ca_topic_score_codex":0.0018150753,"about_ca_topic_score_gemma":0.0033689174,"teacher_disagreement_score":0.010620797,"about_ca_system_score_codex":0.0011803585,"about_ca_system_score_gemma":0.0012113964,"threshold_uncertainty_score":0.03553015},"labels":[],"label_agreement":null},{"id":"W1531217687","doi":"10.1007/3-540-45554-x_40","title":"Unification of Knowledge Discovery and Data Mining using Rough Sets Approach in A Real-World Application","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Computer science; Knowledge extraction; Data mining; Unification; Data science","score_opus":0.07445096844524185,"score_gpt":0.3129614747815658,"score_spread":0.23851050633632392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531217687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008784708,0.0067786565,0.97509766,0.0012438956,0.00016460396,0.00010436088,0.000046471916,0.00039991652,0.0073796595],"genre_scores_gemma":[0.13108158,0.0041514733,0.8575892,0.00025772548,0.00029895912,0.00015524193,0.00019193765,0.00009726528,0.006176729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949686,0.0016115906,0.00066005555,0.00058895955,0.001987966,0.00018280366],"domain_scores_gemma":[0.99539465,0.0027173061,0.00022312252,0.0010084874,0.0005359546,0.000120471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00782529,0.0006705234,0.0023418297,0.0031435888,0.0008420018,0.0055140625,0.002273952,0.0016569975,0.0021631771],"category_scores_gemma":[0.0072500682,0.00082422607,0.0020857628,0.0038325093,0.0019571818,0.008084116,0.0033676238,0.0023817318,0.00081941107],"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.00016529897,0.00026757436,0.0009573912,0.000982348,0.0003845008,0.0005476913,0.0013319051,0.022720708,0.0069598216,0.40370888,0.0031827376,0.5587912],"study_design_scores_gemma":[0.00004247795,0.00020892713,0.0015658356,0.00036323737,0.00033756276,0.0007466348,0.0005783939,0.2756493,0.010733704,0.663298,0.04635576,0.00012016547],"about_ca_topic_score_codex":0.00090123806,"about_ca_topic_score_gemma":0.0012697617,"teacher_disagreement_score":0.00782529,"about_ca_system_score_codex":0.0010218068,"about_ca_system_score_gemma":0.002117082,"threshold_uncertainty_score":0.041384578},"labels":[],"label_agreement":null},{"id":"W1531222977","doi":"10.1007/978-3-540-39899-8_45","title":"A Spatial-Stiffness Analysis of Fiducial Registration Accuracy","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Fiducial marker; Computer science; Stiffness; Image registration; Algorithm; Error analysis; Expression (computer science); Artificial intelligence; Mathematics; Applied mathematics; Image (mathematics); Physics","score_opus":0.01414075934673779,"score_gpt":0.23077559580749699,"score_spread":0.2166348364607592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531222977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05794947,0.0017584383,0.93109757,0.00031970858,0.00008155247,0.00003131413,0.00008686681,0.00037403428,0.008300939],"genre_scores_gemma":[0.88246405,0.0012548041,0.106470905,0.00007079087,0.00011868328,0.00004282564,0.00010635596,0.00031893054,0.0091526015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998713,0.00018699204,0.00006218008,0.00019283289,0.0007499002,0.00009506202],"domain_scores_gemma":[0.9958852,0.0021291953,0.00044853028,0.0006555351,0.0008329025,0.000048605503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013046558,0.00061025546,0.00043105608,0.0015625487,0.00038555128,0.00090697827,0.0010194819,0.0007779703,0.0038285844],"category_scores_gemma":[0.00901347,0.00054952764,0.00060646894,0.0011705428,0.0013240051,0.002203994,0.0010393645,0.00070011406,0.0010585549],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039632223,0.00009102333,0.0047242506,0.00051285385,0.00010133655,0.00029883723,0.00035486103,0.3923312,0.15297301,0.070336826,0.0019339146,0.37594557],"study_design_scores_gemma":[0.000008061759,0.00015569465,0.008677986,0.0000428066,0.000060110826,0.0006474188,0.00007408594,0.94248897,0.031194441,0.013953918,0.0026382029,0.000058320227],"about_ca_topic_score_codex":0.0012975261,"about_ca_topic_score_gemma":0.0015861854,"teacher_disagreement_score":0.0038285844,"about_ca_system_score_codex":0.0007117965,"about_ca_system_score_gemma":0.0003413362,"threshold_uncertainty_score":0.012807906},"labels":[],"label_agreement":null},{"id":"W1531223525","doi":"10.1007/3-540-45105-6_11","title":"Revisiting Elitism in Ant Colony Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"Carleton University","funders":"","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Mathematical optimization; Computer science; Ant colony; Extremal optimization; Artificial intelligence; Metaheuristic; Mathematics; Meta-optimization","score_opus":0.02164736604405561,"score_gpt":0.2762496322912347,"score_spread":0.25460226624717913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531223525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009803157,0.02824006,0.86327136,0.0072997687,0.003675125,0.000066634355,0.000055573182,0.00024814915,0.0873401],"genre_scores_gemma":[0.45908335,0.03771,0.4420137,0.0045991875,0.006285393,0.0002771321,0.000109496854,0.0010249787,0.048896715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975223,0.0010772556,0.0001259097,0.00024636788,0.0008969637,0.0001311223],"domain_scores_gemma":[0.99480045,0.0039223037,0.0002375847,0.00034968596,0.0006190174,0.000071040544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00398603,0.0013859886,0.0013174841,0.001110962,0.0012146583,0.003620304,0.0034110977,0.002333669,0.004179506],"category_scores_gemma":[0.017739108,0.0006936226,0.0009871264,0.0023693736,0.0048592016,0.006702597,0.0027848724,0.006127092,0.0015809513],"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.000071462615,0.00011562913,0.0005737138,0.00063214294,0.00007115849,0.0001624317,0.0006134441,0.1191176,0.00084994634,0.68227714,0.009174157,0.18634117],"study_design_scores_gemma":[0.000042301468,0.0000659223,0.00022952644,0.0003306888,0.000039505372,0.00012468881,0.00016169775,0.17839946,0.0010310346,0.77949744,0.040043544,0.000034226567],"about_ca_topic_score_codex":0.0021564933,"about_ca_topic_score_gemma":0.0029998033,"teacher_disagreement_score":0.004179506,"about_ca_system_score_codex":0.0015619961,"about_ca_system_score_gemma":0.0013082151,"threshold_uncertainty_score":0.021080375},"labels":[],"label_agreement":null},{"id":"W1531333150","doi":"10.1007/3-540-36494-3_42","title":"The Complexity of Resolution with Generalized Symmetry Rules","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Toronto","funders":"","keywords":"Homomorphism; Homogeneous space; Injective function; Resolution (logic); Symmetry (geometry); Mathematical proof; Pure mathematics; Mathematics; Discrete mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.03060092413681015,"score_gpt":0.24401040600607196,"score_spread":0.2134094818692618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531333150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26239255,0.008470741,0.48924646,0.028468393,0.0007273434,0.0003467892,0.002521965,0.0014636744,0.20636201],"genre_scores_gemma":[0.8769639,0.004015843,0.09622848,0.0010408821,0.0012608367,0.00037024583,0.0019236834,0.0005033182,0.017692693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99034834,0.0032611906,0.0006204818,0.0011795834,0.0036247442,0.0009656273],"domain_scores_gemma":[0.95614326,0.03560919,0.0014673659,0.0048208814,0.001265442,0.00069391076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005786786,0.0009892201,0.0028114214,0.0023009025,0.0033703088,0.011581254,0.0052573397,0.0037796954,0.020606475],"category_scores_gemma":[0.036718335,0.0017308053,0.0036524138,0.005320183,0.0069173924,0.04015521,0.0066431644,0.00822093,0.0020847924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016726751,0.00007432579,0.000587853,0.00020545001,0.00006873724,0.00013866261,0.00037625717,0.013191328,0.00035614715,0.95679736,0.0061409846,0.021895505],"study_design_scores_gemma":[0.000029098597,0.000004658236,0.00008174348,0.000012045062,0.000019462588,0.000050966824,0.000043619602,0.015325238,0.00018478185,0.98297936,0.001258067,0.000010994212],"about_ca_topic_score_codex":0.003521867,"about_ca_topic_score_gemma":0.0022153482,"teacher_disagreement_score":0.020606475,"about_ca_system_score_codex":0.003598636,"about_ca_system_score_gemma":0.0026066555,"threshold_uncertainty_score":0.06893557},"labels":[],"label_agreement":null},{"id":"W1531354961","doi":"10.1007/978-3-540-75474-9_1","title":"A Multi-level Matching Algorithm for Combining Similarity Measures in Ontology Integration","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Ontology; Computer science; Ontology alignment; Matching (statistics); Ontology-based data integration; Data mining; Similarity (geometry); Data integration; Extension (predicate logic); Process (computing); Information retrieval; Algorithm; Artificial intelligence; Mathematics; Semantic Web","score_opus":0.061272447076280795,"score_gpt":0.31875032456534574,"score_spread":0.2574778774890649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531354961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047478676,0.00016107518,0.99368614,0.000037644983,0.000027793192,0.000093339964,0.000055002085,0.00084255653,0.00034862518],"genre_scores_gemma":[0.035838112,0.0000810634,0.96299535,0.000043009193,0.000014570255,0.00009322371,0.00023164369,0.00010503518,0.0005979467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465877,0.00093106093,0.0006953328,0.0010822617,0.0023367344,0.0002959344],"domain_scores_gemma":[0.99636745,0.0012606059,0.00025092377,0.00068139686,0.0013092211,0.0001302872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004503764,0.0007787198,0.002202149,0.0065365024,0.0016701564,0.0028778815,0.003179171,0.0023666935,0.0041302047],"category_scores_gemma":[0.009558604,0.0008685415,0.0021409916,0.00767334,0.00081511895,0.0056047556,0.0035839225,0.0016169655,0.0019177536],"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.00025931734,0.0002975184,0.0018197804,0.00026088426,0.00025613979,0.0001274955,0.00025556347,0.017462248,0.0260919,0.014290515,0.003057649,0.93582094],"study_design_scores_gemma":[0.00011309654,0.0002839575,0.0026500442,0.00008197551,0.00034109605,0.0006622842,0.00024965795,0.90283906,0.04438005,0.037484042,0.010802734,0.000111915666],"about_ca_topic_score_codex":0.0031330688,"about_ca_topic_score_gemma":0.003505447,"teacher_disagreement_score":0.0065365024,"about_ca_system_score_codex":0.0010723936,"about_ca_system_score_gemma":0.0016493519,"threshold_uncertainty_score":0.023818493},"labels":[],"label_agreement":null},{"id":"W1531515217","doi":"10.1007/978-3-540-31810-1_8","title":"Early Validation of Deployment and Scheduling Constraints for MSC Specifications","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Software deployment; Scheduling (production processes); Software requirements specification; Abstraction; Functional requirement; Functional specification; System requirements specification; Distributed computing; Requirements analysis; Non-functional requirement; Software engineering; Real-time computing; Programming language; Software development; Software; Software design; Mathematical optimization; Software construction","score_opus":0.047847728617715406,"score_gpt":0.2779854075615198,"score_spread":0.23013767894380438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531515217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065128446,0.0002734126,0.90845335,0.0013567564,0.00051669945,0.0006496619,0.0013702603,0.010086115,0.01216536],"genre_scores_gemma":[0.58379924,0.00029858918,0.39739224,0.0010125369,0.00023722432,0.00057912257,0.0037667302,0.0047727204,0.008141587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97021884,0.010132767,0.0020023924,0.0016980913,0.012887296,0.0030606159],"domain_scores_gemma":[0.78974456,0.13691713,0.0071697887,0.03436959,0.030353269,0.001445731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01771692,0.001954865,0.0011401002,0.0021086861,0.0012945974,0.004877269,0.004116004,0.0028715476,0.015725954],"category_scores_gemma":[0.13161717,0.0017872893,0.0027737233,0.000973012,0.0025389763,0.008000133,0.0050517037,0.0052529704,0.0032056845],"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.0038355764,0.0011810462,0.013961603,0.002164046,0.00043505628,0.0022038196,0.0028223002,0.23244432,0.09999194,0.35584593,0.033230364,0.25188407],"study_design_scores_gemma":[0.00036284805,0.00050685747,0.0015504314,0.00054129877,0.00022056277,0.00037772945,0.00054645864,0.7213231,0.15409914,0.0868162,0.03351643,0.00013894492],"about_ca_topic_score_codex":0.006789974,"about_ca_topic_score_gemma":0.010155646,"teacher_disagreement_score":0.01771692,"about_ca_system_score_codex":0.0028501467,"about_ca_system_score_gemma":0.007203933,"threshold_uncertainty_score":0.09369713},"labels":[],"label_agreement":null},{"id":"W1531553231","doi":"10.1007/978-3-540-69812-8_6","title":"A Simple Scaling Algorithm Based on Areas Pixels","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Pixel; Image scaling; Bilinear interpolation; Computer science; Scaling; Algorithm; Smoothness; Anti-aliasing; Bicubic interpolation; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Aliasing; Image (mathematics); Pattern recognition (psychology); Computer vision; Mathematics; Image processing; Filter (signal processing)","score_opus":0.017021649854461453,"score_gpt":0.26812250506761987,"score_spread":0.2511008552131584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531553231","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.006846915,0.00051577284,0.9813789,0.00013352212,0.0005031033,0.00013469659,0.00009661712,0.002762311,0.0076281237],"genre_scores_gemma":[0.03862566,0.0004958561,0.9471765,0.00015396168,0.00019657737,0.00010338549,0.00023755779,0.00055489066,0.0124555705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994506,0.000046056408,0.000031537824,0.00014655593,0.00028768787,0.000037463597],"domain_scores_gemma":[0.99965644,0.000059632057,0.000021990549,0.0001010046,0.00013190758,0.000028904047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038737417,0.0011793599,0.00083756435,0.0014921892,0.00054157135,0.0012619176,0.001145897,0.00074164936,0.016338518],"category_scores_gemma":[0.0009031756,0.00047802352,0.00072189496,0.001547528,0.00063497154,0.001534367,0.0012014472,0.000910011,0.006397926],"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.00017278468,0.000061293984,0.00029445926,0.00022055322,0.000032121243,0.00007306576,0.00006500338,0.0029721525,0.12633234,0.020842563,0.008605861,0.84032774],"study_design_scores_gemma":[0.00018257159,0.0007957846,0.0043916856,0.000113138696,0.00024595452,0.0026352715,0.00020234869,0.31183338,0.34321898,0.04470962,0.29150736,0.00016394714],"about_ca_topic_score_codex":0.00061339507,"about_ca_topic_score_gemma":0.001152313,"teacher_disagreement_score":0.016338518,"about_ca_system_score_codex":0.00027405776,"about_ca_system_score_gemma":0.00053574354,"threshold_uncertainty_score":0.054657817},"labels":[],"label_agreement":null},{"id":"W153160029","doi":"10.1007/978-3-319-06880-0_17","title":"Bisimulation for Markov Decision Processes through Families of Functional Expressions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Markov process; Markov kernel; Markov chain; Markov decision process; Discrete mathematics; Bisimulation; Metric space; State space; Markov renewal process; Bounded function; Markov model; Markov property; Variable-order Markov model; Statistics","score_opus":0.041209375807544364,"score_gpt":0.306091537224758,"score_spread":0.26488216141721366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153160029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020379791,0.00020219931,0.9690017,0.00021862081,0.000046524427,0.00006259083,0.00008381036,0.00026974786,0.00973499],"genre_scores_gemma":[0.7372316,0.00059282494,0.24769828,0.00022430715,0.00011778027,0.00068122224,0.0003550363,0.0003079045,0.012791068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996669,0.0013072515,0.00022504723,0.0005988488,0.0008195286,0.00038031235],"domain_scores_gemma":[0.992811,0.0053952616,0.0004476287,0.00058362976,0.0005485764,0.00021386119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034590866,0.0009437671,0.00088674016,0.0010775293,0.0012908014,0.0022183415,0.0014270392,0.0011813573,0.005131435],"category_scores_gemma":[0.010647863,0.0007526266,0.0019144763,0.0010034048,0.002646236,0.0037778802,0.002220653,0.0030112122,0.00071356137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055896096,0.000019004581,0.00009009647,0.000038015125,0.000017461653,0.000039211085,0.00016877356,0.027339464,0.0008193096,0.96090597,0.0003403844,0.010166548],"study_design_scores_gemma":[0.000021602125,0.000025558289,0.000041311756,0.00002670515,0.000018659599,0.000028228002,0.000025785215,0.15159267,0.0011815836,0.84533906,0.0016835269,0.000015261608],"about_ca_topic_score_codex":0.0019340786,"about_ca_topic_score_gemma":0.0017023756,"teacher_disagreement_score":0.005131435,"about_ca_system_score_codex":0.002840795,"about_ca_system_score_gemma":0.0016804306,"threshold_uncertainty_score":0.020611584},"labels":[],"label_agreement":null},{"id":"W1531653427","doi":"10.1007/3-540-44843-8_89","title":"Investigation of a Three-Dimensional Spectral Element Method for Helmholtz’s Equation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electromagnetic Simulation and Numerical 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":"Concordia University; University of Toronto","funders":"","keywords":"Helmholtz equation; Element (criminal law); Helmholtz free energy; Mathematical analysis; Mathematics; Spectral element method; Physics; Finite element method; Political science; Mixed finite element method; Law; Thermodynamics","score_opus":0.03811112443504653,"score_gpt":0.28585535714167476,"score_spread":0.24774423270662824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531653427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041459136,0.00028004864,0.9370961,0.00023980961,0.000119273485,0.00008952054,0.000050997634,0.00016445416,0.020500569],"genre_scores_gemma":[0.438273,0.0005820302,0.54097074,0.00025100543,0.00007508126,0.00024901217,0.0001568267,0.00034061176,0.019101702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977034,0.00008330624,0.000008090593,0.000015418791,0.000108540065,0.000014232565],"domain_scores_gemma":[0.9991289,0.0004698485,0.000035138804,0.00006389217,0.00025695216,0.00004537301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068012386,0.00038315807,0.00042897675,0.00039611972,0.00046244112,0.00074173626,0.000945892,0.0010882191,0.0044024675],"category_scores_gemma":[0.0021487295,0.0002520139,0.00047103406,0.00031853875,0.0007837789,0.0008164879,0.0008009818,0.00083708356,0.00063720456],"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.0003082292,0.0003591144,0.0015286193,0.00048332216,0.000057900197,0.0002883175,0.0006452114,0.3907131,0.049845487,0.44612926,0.003204354,0.106437035],"study_design_scores_gemma":[0.000009745683,0.00002977212,0.00013409092,0.000016266162,0.000005512075,0.00006948834,0.000039698527,0.9860401,0.0021704333,0.009053875,0.0024217032,0.0000093636145],"about_ca_topic_score_codex":0.0013214155,"about_ca_topic_score_gemma":0.0011196203,"teacher_disagreement_score":0.0044024675,"about_ca_system_score_codex":0.00024887396,"about_ca_system_score_gemma":0.00068313675,"threshold_uncertainty_score":0.014727712},"labels":[],"label_agreement":null},{"id":"W1531660649","doi":"10.1007/978-3-540-30126-4_3","title":"An Improved Clustering-Based Approach for DNA Microarray Image Segmentation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Windsor","funders":"","keywords":"Cluster analysis; Computer science; Artificial intelligence; Pattern recognition (psychology); Segmentation; Image segmentation; Computational biology; Biology","score_opus":0.012716720034087465,"score_gpt":0.2625703865785058,"score_spread":0.24985366654441832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531660649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002358441,0.00022403339,0.99390817,0.000056300854,0.00005051591,0.000064388034,0.000095484436,0.0025632833,0.0006792611],"genre_scores_gemma":[0.012441867,0.00018017027,0.98420703,0.000071184855,0.000034288743,0.00010849924,0.0003780798,0.00038205067,0.0021969746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876666,0.00015181299,0.00006805029,0.00029457232,0.0006034832,0.00011538402],"domain_scores_gemma":[0.998899,0.00028263518,0.00004828549,0.00019315412,0.0005319535,0.00004506651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094644824,0.0015004626,0.0023541364,0.0028738778,0.0009428149,0.0016695466,0.0030635376,0.0019371491,0.0057878722],"category_scores_gemma":[0.0015964874,0.0010367577,0.0019003213,0.003613018,0.0006482818,0.0011895281,0.0013381756,0.0013416467,0.0045564445],"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.00022164136,0.00012326555,0.00031385478,0.00029353736,0.00014902295,0.0001019786,0.00012496408,0.028672684,0.24037425,0.0034632983,0.0062834867,0.71987796],"study_design_scores_gemma":[0.000040275674,0.00011807654,0.002048355,0.000028807672,0.00011692482,0.0006249454,0.00006464577,0.8787325,0.09673831,0.0067622904,0.014617395,0.00010752149],"about_ca_topic_score_codex":0.007978886,"about_ca_topic_score_gemma":0.012505866,"teacher_disagreement_score":0.007978886,"about_ca_system_score_codex":0.0010307123,"about_ca_system_score_gemma":0.0013541332,"threshold_uncertainty_score":0.01936239},"labels":[],"label_agreement":null},{"id":"W1531673041","doi":"10.1007/11577188_36","title":"Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Sequential consistency; Synchronization (alternating current); Consistency (knowledge bases); Parallel computing; Consistency model; Out-of-order execution; Order (exchange); Programming language; Theoretical computer science; Artificial intelligence","score_opus":0.02210780547691989,"score_gpt":0.2617374258447762,"score_spread":0.23962962036785632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531673041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24915898,0.0010179128,0.72692275,0.003040512,0.0008176227,0.00013050696,0.00035700967,0.0032164091,0.015338242],"genre_scores_gemma":[0.83009756,0.000526776,0.16106671,0.0006192172,0.00025275783,0.00016539093,0.0003998994,0.0010242882,0.0058474652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978023,0.00060725666,0.00014998823,0.0003242262,0.0006790897,0.00043707114],"domain_scores_gemma":[0.97719383,0.008403996,0.0019371394,0.0095293615,0.0024171995,0.00051853765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042592497,0.0005391902,0.0011701549,0.0006190098,0.001343009,0.0023736197,0.002815578,0.0018197517,0.00312075],"category_scores_gemma":[0.02642178,0.0014169166,0.0008600115,0.0012798858,0.0026480616,0.007418117,0.001283671,0.0027829052,0.00075322646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014775378,0.00039913596,0.0070326934,0.0003452128,0.000129204,0.00035918076,0.0008249139,0.083967,0.013669026,0.7591341,0.009870005,0.12279197],"study_design_scores_gemma":[0.00020538054,0.00019317908,0.0010032905,0.000059448637,0.00010202633,0.00010882449,0.0002324775,0.1466935,0.019254334,0.82283443,0.009269997,0.000043203963],"about_ca_topic_score_codex":0.0020121674,"about_ca_topic_score_gemma":0.0031439266,"teacher_disagreement_score":0.0042592497,"about_ca_system_score_codex":0.0007375874,"about_ca_system_score_gemma":0.0032441914,"threshold_uncertainty_score":0.02252531},"labels":[],"label_agreement":null},{"id":"W1531686916","doi":"10.1007/978-3-540-24719-7_7","title":"Simulating a Coalescent Process with Recombination and Ascertainment","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Pairwise comparison; Mutation; Coalescent theory; Cutoff; Genetics; Genetic marker; Biology; Computer science; Artificial intelligence; Gene; Physics","score_opus":0.010022119115423826,"score_gpt":0.2560822342463434,"score_spread":0.24606011513091958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531686916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43306285,0.0003866625,0.55903673,0.0016745848,0.00021040296,0.00023389312,0.00071976887,0.000822079,0.0038531593],"genre_scores_gemma":[0.85798776,0.0003010226,0.13331005,0.00034644565,0.00014925744,0.00034345337,0.0009978458,0.0001543194,0.0064098444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985285,0.0008019518,0.000070903625,0.00031669976,0.00013359198,0.00014835705],"domain_scores_gemma":[0.97194743,0.024717098,0.00071651005,0.0013448576,0.00054651673,0.0007275901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060379733,0.00069177087,0.0015230748,0.0013101846,0.000925421,0.0019955796,0.0035080782,0.0045554736,0.006743035],"category_scores_gemma":[0.02761838,0.0018923115,0.002120658,0.00209424,0.002203914,0.0027275132,0.0020138791,0.0034356313,0.0008040089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016223185,0.00005763932,0.003298058,0.000025047086,0.00006681963,0.00017067496,0.00014613524,0.97067565,0.00028372637,0.020677626,0.000306827,0.00412958],"study_design_scores_gemma":[0.00009637368,0.000030878644,0.00021831508,0.000004327844,0.000029070005,0.00004554277,0.0000138114965,0.9883619,0.00013239736,0.010911851,0.00014492177,0.00001050603],"about_ca_topic_score_codex":0.013875154,"about_ca_topic_score_gemma":0.0071124025,"teacher_disagreement_score":0.013875154,"about_ca_system_score_codex":0.0013409881,"about_ca_system_score_gemma":0.0014412963,"threshold_uncertainty_score":0.031932294},"labels":[],"label_agreement":null},{"id":"W1531695270","doi":"10.1007/978-3-642-02611-9_71","title":"Region Classification for Robust Floor Detection in Indoor Environments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Artificial intelligence; Robustness (evolution); Computer vision; Obstacle; Homography; Pixel; Classifier (UML); Ground truth; Pattern recognition (psychology); Mathematics; Geography","score_opus":0.04683207120025216,"score_gpt":0.2728261870323058,"score_spread":0.22599411583205367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531695270","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.020561777,0.0008182935,0.9726902,0.000049625076,0.00010263126,0.00006084814,0.0003623006,0.004205986,0.0011481806],"genre_scores_gemma":[0.1986222,0.0007122744,0.7931011,0.00010731104,0.00009647597,0.00012600515,0.0014372697,0.0006364995,0.005160831],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992834,0.00007568623,0.00003356097,0.000204808,0.00025231778,0.0001502947],"domain_scores_gemma":[0.99940574,0.00017954507,0.000053706925,0.00013560492,0.0001932368,0.000032147862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917876,0.0010362595,0.0016877338,0.0014617293,0.00042394965,0.00095002557,0.0020841327,0.0010842294,0.0038447897],"category_scores_gemma":[0.001305746,0.0006483578,0.0012948422,0.0014240858,0.00036331877,0.0008856319,0.0010402516,0.00097242673,0.0030451007],"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.00039159952,0.00012687927,0.0010673802,0.00016030204,0.00007030976,0.00007982693,0.00005844325,0.027594414,0.089867555,0.0011421476,0.0052117133,0.87422943],"study_design_scores_gemma":[0.000018730787,0.00011275587,0.0034286603,0.000033073586,0.00006307243,0.00028638818,0.00005392988,0.9200331,0.06988268,0.0019228687,0.0041267774,0.000038036582],"about_ca_topic_score_codex":0.0056929397,"about_ca_topic_score_gemma":0.0068771434,"teacher_disagreement_score":0.0056929397,"about_ca_system_score_codex":0.00048647213,"about_ca_system_score_gemma":0.0007086604,"threshold_uncertainty_score":0.012862146},"labels":[],"label_agreement":null},{"id":"W1531741303","doi":"10.1007/978-3-642-00255-7_19","title":"Formal Probabilistic Analysis of Stuck-at Faults in Reconfigurable Memory Arrays","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"Concordia University","funders":"","keywords":"Spare part; Computer science; Row; Probabilistic logic; Row and column spaces; Parallel computing; Probabilistic analysis of algorithms; Embedded system; Algorithm; Computer engineering; Theoretical computer science; Programming language; Artificial intelligence; Engineering","score_opus":0.01928086620038324,"score_gpt":0.2522945175376208,"score_spread":0.23301365133723753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531741303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030022254,0.00089430285,0.9607047,0.00049880514,0.00009245968,0.000031399282,0.000119708086,0.00044177443,0.0071946927],"genre_scores_gemma":[0.9173819,0.0010757069,0.073526464,0.00019489694,0.00045805136,0.000108194436,0.000232945,0.0003109733,0.0067109466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983171,0.00037620886,0.000078917205,0.00020663367,0.0008526058,0.00016853226],"domain_scores_gemma":[0.9921089,0.0059814896,0.0005905382,0.0005679968,0.0006518292,0.000099351564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016623867,0.00059909717,0.00073587854,0.0013733689,0.00056482275,0.0019599912,0.002064787,0.0010338436,0.004005133],"category_scores_gemma":[0.00988609,0.0006833477,0.0012773843,0.0010340859,0.0022166672,0.0031107957,0.0011116179,0.0017672713,0.00041102344],"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.00010055456,0.00005197722,0.0007584398,0.00018430634,0.000054606888,0.00017770774,0.00013110146,0.3032701,0.00554305,0.66312975,0.0012757813,0.025322575],"study_design_scores_gemma":[0.000008391541,0.000022126926,0.00026174047,0.000019047771,0.000016115915,0.00010480582,0.000015012088,0.5037399,0.0019434064,0.492825,0.0010262869,0.000018206078],"about_ca_topic_score_codex":0.00082576723,"about_ca_topic_score_gemma":0.0008995823,"teacher_disagreement_score":0.004005133,"about_ca_system_score_codex":0.0013575145,"about_ca_system_score_gemma":0.0007130696,"threshold_uncertainty_score":0.013398528},"labels":[],"label_agreement":null},{"id":"W1531750618","doi":"10.1007/11774303_16","title":"How “Consciousness” Allows a Cognitive Tutoring Agent Make Good Diagnosis During Astronauts’ Training","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université du Québec à Montréal","funders":"","keywords":"TUTOR; Computer science; Consciousness; Human–computer interaction; Task (project management); Process (computing); Context (archaeology); Cognition; Simple (philosophy); Artificial intelligence; Cognitive science; Psychology; Programming language; Engineering; Systems engineering","score_opus":0.02149455859686149,"score_gpt":0.22750901367308224,"score_spread":0.20601445507622074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531750618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32939702,0.00039369924,0.5549168,0.0054036193,0.000481185,0.00011529061,0.00012127941,0.0064185965,0.10275254],"genre_scores_gemma":[0.93728817,0.00009809924,0.055547785,0.00029860417,0.0000249547,0.0000252031,0.00006265814,0.00013034865,0.0065242513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997904,0.00006154444,0.000012435015,0.00006537291,0.00003310086,0.000037186317],"domain_scores_gemma":[0.9994498,0.00024059863,0.000037360627,0.00008450632,0.00008181718,0.00010581258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038898224,0.00031225747,0.00012967979,0.00016087544,0.00044290294,0.0018769313,0.0006922062,0.0012560824,0.0037903807],"category_scores_gemma":[0.0026908438,0.0002654666,0.00024784295,0.00012312178,0.000751268,0.0022259462,0.001196326,0.000912196,0.00078794337],"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.0007098761,0.0004277499,0.014823329,0.00030234913,0.0001884394,0.0019943023,0.011288092,0.043700982,0.14349233,0.17342077,0.018306814,0.59134495],"study_design_scores_gemma":[0.000221791,0.0007426904,0.014732248,0.00015638376,0.0004240173,0.0029425395,0.004118951,0.3996987,0.16168082,0.3163774,0.0986727,0.00023181843],"about_ca_topic_score_codex":0.0013125282,"about_ca_topic_score_gemma":0.0011551122,"teacher_disagreement_score":0.0037903807,"about_ca_system_score_codex":0.0002557854,"about_ca_system_score_gemma":0.0005857847,"threshold_uncertainty_score":0.012680054},"labels":[],"label_agreement":null},{"id":"W1531789551","doi":"10.1007/11506447_5","title":"Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Upper and lower bounds; Mathematics; Linear cryptanalysis; Value (mathematics); Combinatorics; Cryptanalysis; Algorithm; Discrete mathematics; Statistics; Mathematical analysis; Cryptography","score_opus":0.016803766238044155,"score_gpt":0.28802413530138127,"score_spread":0.27122036906333713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531789551","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.039057028,0.00774331,0.84867495,0.0032151542,0.0009433745,0.00016014837,0.0005226223,0.00074421207,0.098939225],"genre_scores_gemma":[0.71079826,0.008219236,0.23246038,0.0015562066,0.0028725446,0.00051597174,0.0010893189,0.0013599972,0.041128106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99286896,0.0019050458,0.0003381287,0.00077946804,0.0032563687,0.00085197174],"domain_scores_gemma":[0.976319,0.01567768,0.0009333418,0.0039673964,0.002618024,0.00048465855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007532362,0.0028445255,0.00239947,0.005609632,0.001876851,0.0068337866,0.0041424297,0.0021840793,0.013087096],"category_scores_gemma":[0.03484813,0.0011646498,0.0031846429,0.0047551887,0.0053258864,0.014455663,0.005030452,0.009689305,0.0030300524],"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.00020557475,0.00006922474,0.00038139167,0.00020116032,0.000060393864,0.0001005662,0.00019289946,0.028793514,0.0018813378,0.93488497,0.004408923,0.028820096],"study_design_scores_gemma":[0.000012657429,0.000037423084,0.00027538388,0.00007708529,0.000048286296,0.00008138842,0.00003377839,0.08815628,0.001566824,0.9056204,0.00405938,0.000031018026],"about_ca_topic_score_codex":0.0017468858,"about_ca_topic_score_gemma":0.0016149414,"teacher_disagreement_score":0.013087096,"about_ca_system_score_codex":0.0052977344,"about_ca_system_score_gemma":0.0023437645,"threshold_uncertainty_score":0.043780684},"labels":[],"label_agreement":null},{"id":"W1531806653","doi":"10.1007/978-3-642-25510-6_19","title":"A General Framework for Computing Optimal Correlated Equilibria in Compact Games","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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 British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Singleton; Optimization problem; Mathematics; Algorithm","score_opus":0.08701163899252042,"score_gpt":0.36238796200849593,"score_spread":0.27537632301597553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531806653","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.004130106,0.00010441318,0.9937376,0.000058284913,0.000015000443,0.00005452777,0.000078386205,0.0003482239,0.0014734135],"genre_scores_gemma":[0.18084085,0.00045211814,0.813762,0.000121479796,0.00009391457,0.00043147174,0.0005664862,0.0003508642,0.003380723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983265,0.00047651766,0.00011420004,0.00038588475,0.00043357146,0.00026335425],"domain_scores_gemma":[0.9971048,0.0015948684,0.00016501773,0.0006181155,0.00032031618,0.00019682308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029647595,0.0016829019,0.0031533167,0.0020295891,0.0016006922,0.0048234183,0.0047886204,0.0022718236,0.009150368],"category_scores_gemma":[0.01073882,0.0013612275,0.00265529,0.004290418,0.0026178379,0.00540101,0.00480467,0.003492955,0.0015054389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001840743,0.00013492335,0.0005100284,0.0002056837,0.000080590544,0.000071258044,0.00014405079,0.3749305,0.0019708208,0.55432993,0.0030897623,0.06434848],"study_design_scores_gemma":[0.000040268395,0.000039592065,0.00007892639,0.000022906108,0.00002460832,0.00002339155,0.0000290277,0.6865202,0.0006461304,0.31105256,0.0015029388,0.000019417077],"about_ca_topic_score_codex":0.0049131135,"about_ca_topic_score_gemma":0.006882099,"teacher_disagreement_score":0.009150368,"about_ca_system_score_codex":0.0022996408,"about_ca_system_score_gemma":0.0024499681,"threshold_uncertainty_score":0.030610979},"labels":[],"label_agreement":null},{"id":"W1531814618","doi":"10.1007/978-3-642-13681-8_2","title":"Geometric Image Registration under Locally Variant Illuminations Using Huber M-estimator","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Carleton University","funders":"","keywords":"Estimator; Outlier; Image registration; Artificial intelligence; Computer science; Computer vision; Geometric modeling; Image (mathematics); Mathematics; Algorithm; Statistics; Geometry","score_opus":0.02089174992529989,"score_gpt":0.28479098654021695,"score_spread":0.26389923661491704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531814618","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.003485279,0.00010444993,0.99569464,0.000028912595,0.000017851955,0.000013268064,0.000024745896,0.00027014982,0.00036080033],"genre_scores_gemma":[0.094273046,0.0003275339,0.9020225,0.000042603235,0.000048048245,0.00005556668,0.0002318794,0.00031104754,0.0026878302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.00032929974,0.000058782483,0.00026474972,0.00033764492,0.000072112045],"domain_scores_gemma":[0.99893385,0.00027488536,0.00014507145,0.00040551336,0.00021042672,0.000030325398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013566673,0.00084899244,0.0013816159,0.0011062562,0.00041430054,0.0011321887,0.0011580588,0.0013440191,0.0019066909],"category_scores_gemma":[0.0037977574,0.000760957,0.0010514245,0.0016258708,0.000969369,0.001842897,0.0018204708,0.0015797218,0.0019266842],"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.00038506102,0.00007988826,0.0013084678,0.00036129367,0.00022887703,0.00023959199,0.00027731812,0.15651596,0.108510375,0.06670446,0.0048206337,0.66056806],"study_design_scores_gemma":[0.000025992058,0.00011971648,0.0016063154,0.000029263343,0.00007968101,0.00060584454,0.00005970018,0.9119876,0.046765193,0.03171884,0.0069247778,0.000077047924],"about_ca_topic_score_codex":0.0011604175,"about_ca_topic_score_gemma":0.0016386003,"teacher_disagreement_score":0.0019066909,"about_ca_system_score_codex":0.00040078565,"about_ca_system_score_gemma":0.0008543224,"threshold_uncertainty_score":0.00717479},"labels":[],"label_agreement":null},{"id":"W1531817010","doi":"10.1007/978-3-540-69057-3_24","title":"Designing Large Sets of Haptic Icons with Rhythm","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":158,"is_retracted":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":"Rhythm; Haptic technology; Computer science; Perception; Set (abstract data type); Human–computer interaction; Tactile perception; Haptic perception; Tactile sensor; Artificial intelligence; Speech recognition; Acoustics; Psychology; Robot","score_opus":0.035859003982804984,"score_gpt":0.2661033180412982,"score_spread":0.23024431405849324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531817010","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.049350474,0.00021812378,0.9352571,0.000081328006,0.00019486497,0.00027011347,0.00012403287,0.0036153572,0.01088862],"genre_scores_gemma":[0.31031123,0.00024392945,0.67701644,0.00017264888,0.000047367408,0.0004283901,0.00026142944,0.0011094165,0.0104092145],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995641,0.00010885828,0.000033465716,0.00008621135,0.00014827856,0.00005910501],"domain_scores_gemma":[0.99853444,0.00087449135,0.0000713819,0.00025078477,0.00015260048,0.00011624078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007880834,0.0016660634,0.0007433306,0.0005852763,0.0004327441,0.0011436936,0.0016328029,0.0009891937,0.01479494],"category_scores_gemma":[0.003062127,0.0008535905,0.0008164902,0.00044226064,0.00058843236,0.0020770184,0.0018485254,0.0009805448,0.0022909825],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006557632,0.00031593937,0.0008101928,0.0014010938,0.00011940456,0.001072645,0.0009118129,0.07222771,0.56994325,0.026149696,0.010719991,0.3156726],"study_design_scores_gemma":[0.00039625625,0.0018146269,0.0023488211,0.0003059439,0.00019890102,0.0017610675,0.00092528405,0.56132054,0.31846586,0.039975513,0.0722684,0.00021876859],"about_ca_topic_score_codex":0.00031159638,"about_ca_topic_score_gemma":0.0005918564,"teacher_disagreement_score":0.01479494,"about_ca_system_score_codex":0.0002698324,"about_ca_system_score_gemma":0.00020454261,"threshold_uncertainty_score":0.049494028},"labels":[],"label_agreement":null},{"id":"W1531821269","doi":"10.1007/11527886_47","title":"Exploring Eye Tracking to Increase Bandwidth in User Modeling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Human–computer interaction; Eye tracking; User modeling; Bandwidth (computing); User interface; User interface design; User experience design; Artificial intelligence; Telecommunications","score_opus":0.08011123054097231,"score_gpt":0.30825178920949675,"score_spread":0.22814055866852445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531821269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30233708,0.0012950748,0.67922693,0.0008033387,0.00012391288,0.00012958271,0.0006730319,0.0046889316,0.010722126],"genre_scores_gemma":[0.8847889,0.00030468826,0.11255148,0.00012795314,0.000033724617,0.00006214802,0.00025867808,0.00031730664,0.0015552557],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880576,0.0006327889,0.000036845166,0.00022690721,0.00020710837,0.00009066621],"domain_scores_gemma":[0.98880416,0.009054939,0.00036857647,0.0007820349,0.0008214549,0.00016885922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016809442,0.00074277393,0.0006450093,0.0007537445,0.0004354742,0.0018016077,0.00083159155,0.00077247195,0.0033542614],"category_scores_gemma":[0.02202407,0.00037161118,0.00042258258,0.0008208437,0.00025511123,0.0036087073,0.001212995,0.0012094191,0.0005818631],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00261859,0.0012223551,0.025467958,0.0007195679,0.00033640696,0.0002723979,0.005197601,0.060043648,0.08907756,0.011220722,0.012107689,0.79171544],"study_design_scores_gemma":[0.000079697405,0.00036508037,0.01196588,0.000096974756,0.00020217928,0.00020646144,0.00079612015,0.93001366,0.031258877,0.01995602,0.004986841,0.00007223582],"about_ca_topic_score_codex":0.006922298,"about_ca_topic_score_gemma":0.0067395833,"teacher_disagreement_score":0.006922298,"about_ca_system_score_codex":0.00059245067,"about_ca_system_score_gemma":0.000553859,"threshold_uncertainty_score":0.013764024},"labels":[],"label_agreement":null},{"id":"W1531868668","doi":"10.1007/978-3-540-73351-5_2","title":"An Efficient Denotational Semantics for Natural Language Database Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Denotational semantics; Computer science; Programming language; Action semantics; Negation; Semantics (computer science); Operational semantics; Well-founded semantics; Computational semantics; Denotational semantics of the Actor model; Natural language processing; Artificial intelligence","score_opus":0.016433020641701566,"score_gpt":0.30543840489623825,"score_spread":0.2890053842545367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531868668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008973018,0.0002344716,0.9830341,0.00042348803,0.0001237842,0.000121271725,0.00032636436,0.0031500626,0.003613501],"genre_scores_gemma":[0.22222103,0.0003571872,0.7688282,0.00039098153,0.00021287847,0.0004073478,0.0010736055,0.0011815112,0.005327213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514574,0.001121305,0.00067898736,0.000705049,0.0019075461,0.0004412452],"domain_scores_gemma":[0.9951348,0.0022781389,0.00021120631,0.0013617239,0.00087530137,0.00013900924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003006186,0.0009841655,0.0017264549,0.0016792942,0.001608167,0.006223524,0.0028854897,0.0015082038,0.006498168],"category_scores_gemma":[0.008258828,0.0014718658,0.0019109952,0.002499885,0.003213715,0.012474759,0.0051109716,0.0031428824,0.0019724474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029136514,0.00017484366,0.0004218402,0.00031167408,0.000042307165,0.00016284948,0.0008249025,0.0100285085,0.008513089,0.8581468,0.0075896597,0.11349209],"study_design_scores_gemma":[0.00012008058,0.00009575813,0.00020559448,0.00007103114,0.00011245316,0.00028654424,0.00022261991,0.13434222,0.0111507,0.8229519,0.03035806,0.0000830817],"about_ca_topic_score_codex":0.0021380913,"about_ca_topic_score_gemma":0.002516081,"teacher_disagreement_score":0.006498168,"about_ca_system_score_codex":0.0021673485,"about_ca_system_score_gemma":0.0020567332,"threshold_uncertainty_score":0.02173853},"labels":[],"label_agreement":null},{"id":"W1531872932","doi":"10.1007/978-3-642-02611-9_84","title":"Suppression of Foxing in Historical Books Using Inpainting","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cultural Heritage Materials Analysis","field":"Arts and Humanities","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 Guelph","funders":"","keywords":"Inpainting; Computer science; Appeal; Artificial intelligence; Computer vision; Image (mathematics); Computer graphics (images); Law","score_opus":0.04766480700718341,"score_gpt":0.2434267738667646,"score_spread":0.1957619668595812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531872932","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.39158955,0.008612587,0.26759014,0.001476576,0.0024396323,0.00019702256,0.0012485689,0.0045930967,0.32225275],"genre_scores_gemma":[0.57575935,0.0048675244,0.10213755,0.00034617714,0.00051324104,0.000064148924,0.0016575644,0.0024135264,0.31224087],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987733,0.000012539636,0.000005132258,0.000025192861,0.000064063635,0.000015839405],"domain_scores_gemma":[0.9994423,0.00022127498,0.00004081334,0.00009557046,0.0001667586,0.00003316418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018633819,0.00044255034,0.00025812944,0.0009386663,0.0007100276,0.0011831496,0.0004616096,0.00044336868,0.021159826],"category_scores_gemma":[0.00092484325,0.0002405963,0.00027124796,0.0009848165,0.00050274894,0.0008886885,0.0005585968,0.00062285265,0.00280177],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005961252,0.0001256271,0.0024820152,0.0014245228,0.000043245313,0.002140628,0.0049843905,0.003668163,0.21149652,0.029127939,0.05556247,0.68834835],"study_design_scores_gemma":[0.00005671152,0.00033267034,0.020358065,0.0004847987,0.00023267939,0.004802394,0.0041425503,0.02038073,0.28125483,0.0070845685,0.6607961,0.00007388167],"about_ca_topic_score_codex":0.0014932617,"about_ca_topic_score_gemma":0.00450543,"teacher_disagreement_score":0.021159826,"about_ca_system_score_codex":0.00024587134,"about_ca_system_score_gemma":0.00029171474,"threshold_uncertainty_score":0.070786655},"labels":[],"label_agreement":null},{"id":"W1531908466","doi":"10.1007/978-3-540-74581-5_2","title":"A Multi-Objective Genetic Algorithm Based on Density","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization 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":"Western University","funders":"","keywords":"Pruning; Selection (genetic algorithm); Genetic algorithm; Fitness function; Mathematical optimization; Computer science; Set (abstract data type); Population; Construct (python library); Computation; Evolutionary algorithm; Algorithm; Mathematics; Artificial intelligence; Biology","score_opus":0.0200675455014978,"score_gpt":0.2705543683378924,"score_spread":0.2504868228363946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531908466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009216828,0.00023554037,0.9863412,0.00011595157,0.00012029364,0.00011215787,0.000018944645,0.00032834575,0.0035107194],"genre_scores_gemma":[0.20437288,0.00030691922,0.79030466,0.00018798187,0.0000864172,0.00057421025,0.000087108274,0.00012715644,0.003952663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00015777563,0.000018939585,0.00007136391,0.00020961103,0.00004009667],"domain_scores_gemma":[0.9992144,0.00043459595,0.00004599654,0.000044198932,0.00021811112,0.000042748314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011745135,0.00093068613,0.0016578395,0.0012889741,0.00087591115,0.0010190818,0.0022239138,0.0021095723,0.0028018488],"category_scores_gemma":[0.0028875745,0.00076085905,0.0010114661,0.0015269135,0.0009041948,0.0009642416,0.0015169176,0.0013500622,0.0005515453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005965729,0.000095650445,0.00047501858,0.00007851628,0.00007145329,0.00006561964,0.00008188332,0.86743265,0.0023152698,0.015173069,0.0013409943,0.112810165],"study_design_scores_gemma":[0.000019442108,0.000020842192,0.000057803452,0.000006772518,0.0000104433475,0.000017270464,0.0000040896384,0.9981287,0.00025943737,0.0011313173,0.00033802996,0.0000058723044],"about_ca_topic_score_codex":0.008742058,"about_ca_topic_score_gemma":0.005136269,"teacher_disagreement_score":0.008742058,"about_ca_system_score_codex":0.0011125973,"about_ca_system_score_gemma":0.0012553433,"threshold_uncertainty_score":0.017382383},"labels":[],"label_agreement":null},{"id":"W1531979632","doi":"10.1007/11431879_25","title":"Supporting Group Awareness in Distributed Software Development","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Saskatchewan","funders":"International Business Machines Corporation","keywords":"Computer science; Group (periodic table); Software development; Software; Software engineering; Operating system","score_opus":0.018467688899658434,"score_gpt":0.27569927673023265,"score_spread":0.2572315878305742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531979632","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.07285738,0.00072659313,0.89889944,0.0005138136,0.00010805499,0.00010475216,0.000013623153,0.0024307496,0.02434564],"genre_scores_gemma":[0.75362843,0.00051514653,0.23401013,0.00013403458,0.000076247474,0.00010313637,0.00007150345,0.0002471356,0.0112142395],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990845,0.00038545305,0.000037675698,0.000099686666,0.00026237703,0.00013037825],"domain_scores_gemma":[0.9955259,0.0030092953,0.00015042041,0.0008606257,0.0002361499,0.00021759092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014191476,0.0003925289,0.00039984784,0.00037779816,0.00059337297,0.0013801444,0.0013106576,0.0009155104,0.0024111369],"category_scores_gemma":[0.004900297,0.000487885,0.00028188515,0.00040736859,0.00065905286,0.0040100208,0.0029898,0.0017850474,0.0006029843],"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.0004285197,0.0007720707,0.002763239,0.0004354477,0.00005821854,0.0005609215,0.006144622,0.020969084,0.038327258,0.13763005,0.008381507,0.7835291],"study_design_scores_gemma":[0.00025989194,0.00075262773,0.0027537097,0.00032831196,0.00022541439,0.0012333615,0.0020874334,0.4060172,0.06932045,0.42793587,0.088991165,0.000094551004],"about_ca_topic_score_codex":0.0004464147,"about_ca_topic_score_gemma":0.00062173576,"teacher_disagreement_score":0.0024111369,"about_ca_system_score_codex":0.0002158395,"about_ca_system_score_gemma":0.00059401523,"threshold_uncertainty_score":0.008065999},"labels":[],"label_agreement":null},{"id":"W1531985259","doi":"10.1007/3-540-45757-7_38","title":"An Infinite-Valued Semantics for Logic Programs with Negation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Negation; Uncountable set; Countable set; Zero (linguistics); Mathematics; Discrete mathematics; Truth value; Element (criminal law); Denotational semantics; Set (abstract data type); Semantics (computer science); Computer science; Operational semantics; Programming language; Linguistics","score_opus":0.02987368681877527,"score_gpt":0.25726529892290917,"score_spread":0.2273916121041339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531985259","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.010258853,0.0007626365,0.96530914,0.0013701887,0.000319605,0.00007276867,0.00022203491,0.0009726202,0.020712221],"genre_scores_gemma":[0.40157717,0.0009871013,0.58059424,0.0010887516,0.00056122197,0.00038366896,0.0007054324,0.00051508157,0.0135873305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.0005220298,0.00025591895,0.0003158095,0.00048329475,0.00017980576],"domain_scores_gemma":[0.99810153,0.0010096206,0.000121329926,0.0002440208,0.00034391356,0.00017961969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002621775,0.0010822729,0.0010272284,0.0015300004,0.0019084458,0.006030509,0.0029204644,0.0018980588,0.0036203538],"category_scores_gemma":[0.0036959525,0.0010104054,0.001858144,0.0013195913,0.005372441,0.013488692,0.003973283,0.0052058725,0.0008821763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026375514,0.000019872481,0.000051690415,0.000050659557,0.00000660078,0.00006253253,0.00030107092,0.00097067544,0.0007529552,0.9870302,0.0008415317,0.00988583],"study_design_scores_gemma":[0.000019223964,0.000010814233,0.000023138558,0.000027500237,0.000011344476,0.000068740264,0.00005856275,0.007218227,0.0005370976,0.98407894,0.007933952,0.000012432727],"about_ca_topic_score_codex":0.00103713,"about_ca_topic_score_gemma":0.0011663879,"teacher_disagreement_score":0.006030509,"about_ca_system_score_codex":0.0016779692,"about_ca_system_score_gemma":0.0014303412,"threshold_uncertainty_score":0.013865411},"labels":[],"label_agreement":null},{"id":"W1531996034","doi":"10.1007/11866565_110","title":"Automated 3D Freehand Ultrasound Calibration with Real-Time Accuracy Control","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"Queen's University","funders":"","keywords":"Computer science; Imaging phantom; Calibration; Computer vision; 3D ultrasound; Robustness (evolution); Artificial intelligence; Set (abstract data type); Ultrasound; Radiology; Medicine","score_opus":0.0093966034005152,"score_gpt":0.26446848233148523,"score_spread":0.25507187893097005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531996034","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.011936407,0.0001526999,0.9810876,0.000055445398,0.000072030234,0.00005033722,0.000049738104,0.0049211886,0.0016745687],"genre_scores_gemma":[0.38565522,0.0002024204,0.60881484,0.00015325115,0.0000584892,0.00013660343,0.00021190064,0.0013987216,0.0033685605],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953505,0.0005429302,0.00018920287,0.00080429815,0.0028683671,0.00024460116],"domain_scores_gemma":[0.9942305,0.0016436386,0.0005744785,0.0017089158,0.0017043563,0.00013812368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016007349,0.0014325373,0.0012565971,0.0014598486,0.00059759675,0.001944223,0.001809932,0.0014399237,0.006168305],"category_scores_gemma":[0.007876249,0.0014774188,0.00066969724,0.0011777988,0.00073761627,0.001517031,0.002980694,0.0012465465,0.0027131788],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054372597,0.00014125636,0.0018431054,0.00023545502,0.00009273056,0.00010904781,0.0004024985,0.04875509,0.23623826,0.0033860719,0.004703889,0.7035489],"study_design_scores_gemma":[0.0001253047,0.0003591158,0.009851829,0.00005914337,0.0001000289,0.0012982823,0.000108614506,0.7307699,0.2367058,0.0033375479,0.017087895,0.00019657609],"about_ca_topic_score_codex":0.0024554736,"about_ca_topic_score_gemma":0.003036674,"teacher_disagreement_score":0.006168305,"about_ca_system_score_codex":0.00054055074,"about_ca_system_score_gemma":0.0013029911,"threshold_uncertainty_score":0.020635068},"labels":[],"label_agreement":null},{"id":"W1532021344","doi":"10.1007/11538363_26","title":"Closure Properties of Weak Systems of Bounded Arithmetic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Bounded function; Class (philosophy); Axiom; Complexity class; Closure (psychology); Discrete mathematics; Descriptive complexity theory; Second-order arithmetic; Computer science; Arithmetic; Mathematics; Algebra over a field; Time complexity; Pure mathematics; Artificial intelligence","score_opus":0.027840504164713224,"score_gpt":0.2617839800224799,"score_spread":0.23394347585776665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532021344","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.51728004,0.0019543886,0.33797193,0.0019929383,0.00037359202,0.00016234667,0.0008322441,0.00065572443,0.13877691],"genre_scores_gemma":[0.9493758,0.00066133303,0.030178951,0.00021494167,0.00039998977,0.00021440671,0.0006899814,0.0002391581,0.018025514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988072,0.00025690006,0.00010085394,0.00023431049,0.00040579346,0.00019493946],"domain_scores_gemma":[0.9966813,0.0019781478,0.00023351985,0.00039216792,0.0004230854,0.00029184163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065157,0.00074708625,0.0011481007,0.001958996,0.0024391992,0.0038954108,0.001575497,0.0009827253,0.0072960164],"category_scores_gemma":[0.0052431896,0.00091117877,0.0012968514,0.0015556315,0.004315069,0.010600613,0.003757307,0.0037886037,0.0005724961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052831994,0.000014959218,0.00015317931,0.00004124637,0.000007138655,0.000034973506,0.00034511,0.00047034922,0.0012674172,0.9939539,0.0004740292,0.0031848387],"study_design_scores_gemma":[0.000020859577,0.000020855876,0.00019302602,0.000013565898,0.000010933114,0.00004132367,0.00012848119,0.0028918404,0.0007704814,0.99392575,0.0019737873,0.000009135707],"about_ca_topic_score_codex":0.00088761037,"about_ca_topic_score_gemma":0.00065379153,"teacher_disagreement_score":0.0072960164,"about_ca_system_score_codex":0.001419374,"about_ca_system_score_gemma":0.0006857001,"threshold_uncertainty_score":0.024407625},"labels":[],"label_agreement":null},{"id":"W1532068777","doi":"10.1007/bfb0028121","title":"Minimum loss of information and image segmentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Thresholding; Histogram; Image segmentation; Artificial intelligence; Balanced histogram thresholding; Segmentation; Information loss; Computer science; Pattern recognition (psychology); Scale-space segmentation; Image (mathematics); Region growing; Computer vision; Segmentation-based object categorization; Mathematics; Histogram matching","score_opus":0.009378960805021187,"score_gpt":0.2609454593000441,"score_spread":0.2515664984950229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532068777","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.0050259484,0.0038954644,0.9836916,0.00045896,0.00012789392,0.000022586268,0.000074229065,0.00028982802,0.006413507],"genre_scores_gemma":[0.2742231,0.010670114,0.6646436,0.0005096324,0.00094124826,0.00022905131,0.00072262087,0.0009677489,0.047092978],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994116,0.00014423153,0.000034674107,0.00010192425,0.00026531983,0.000042314146],"domain_scores_gemma":[0.99893576,0.0006781877,0.0000855911,0.00014884466,0.00012682231,0.000024762672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009218596,0.0007651315,0.0012842817,0.001100818,0.00031049622,0.0014042906,0.0012059669,0.0016055347,0.003232901],"category_scores_gemma":[0.0036564663,0.0005973826,0.00060575636,0.0016094751,0.0013816502,0.002589495,0.0012292824,0.001576492,0.0010940566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000352293,0.000088343026,0.00028866486,0.0006800797,0.00009753199,0.0002674999,0.00015835791,0.17915975,0.020317694,0.28849044,0.018400406,0.49169886],"study_design_scores_gemma":[0.000025614077,0.00008391111,0.00049700734,0.000083753854,0.000046388886,0.0004897282,0.000032069944,0.522457,0.010961174,0.45128098,0.014006007,0.00003630679],"about_ca_topic_score_codex":0.0006481425,"about_ca_topic_score_gemma":0.00049229426,"teacher_disagreement_score":0.003232901,"about_ca_system_score_codex":0.00086177397,"about_ca_system_score_gemma":0.00045268078,"threshold_uncertainty_score":0.010815144},"labels":[],"label_agreement":null},{"id":"W1532113059","doi":"10.1007/978-3-540-69858-6_28","title":"Using Linguistic Knowledge to Classify Non-functional Requirements in SRS documents","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":57,"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; Software requirements; Software engineering; Non-functional requirement; Software requirements specification; Software; Software development; Functional requirement; Classifier (UML); Natural language; Process (computing); Artificial intelligence; Natural language processing; Software construction; Programming language","score_opus":0.06269338556165842,"score_gpt":0.3261659636924095,"score_spread":0.2634725781307511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532113059","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.6281047,0.001344096,0.32826746,0.0014815355,0.00012969367,0.0007960658,0.0046632322,0.0043287934,0.030884521],"genre_scores_gemma":[0.74655974,0.00043599147,0.24035028,0.00016676346,0.000063375766,0.0002620772,0.008001976,0.00026523173,0.0038945586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963993,0.00082923856,0.000645981,0.00044227994,0.0015105244,0.00017271472],"domain_scores_gemma":[0.982418,0.0122636985,0.0017349473,0.0009259001,0.0024335152,0.00022392278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026264188,0.00044279467,0.00040520413,0.010163775,0.0008950061,0.00299729,0.00090507005,0.0010111261,0.0018470823],"category_scores_gemma":[0.014268353,0.00035156778,0.00080518273,0.003437243,0.00095268263,0.003223866,0.0010259559,0.0011230123,0.0011164816],"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.0004660826,0.00057127693,0.045586053,0.0014958717,0.00017356593,0.0018028897,0.010515817,0.011164764,0.05794104,0.012840427,0.007407157,0.850035],"study_design_scores_gemma":[0.00029257403,0.0011179574,0.17751117,0.002616299,0.001460875,0.0056246794,0.023190688,0.50022364,0.10841374,0.071493804,0.10754863,0.0005058715],"about_ca_topic_score_codex":0.0067395293,"about_ca_topic_score_gemma":0.011393128,"teacher_disagreement_score":0.010163775,"about_ca_system_score_codex":0.0011947209,"about_ca_system_score_gemma":0.0020343764,"threshold_uncertainty_score":0.013889968},"labels":[],"label_agreement":null},{"id":"W1532156013","doi":"10.1007/978-3-642-12116-6_24","title":"Lexical Chains Using Distributional Measures of Concept Distance","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence","score_opus":0.028210738497016326,"score_gpt":0.28011033873276103,"score_spread":0.2518996002357447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532156013","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.057068963,0.0010030327,0.93035996,0.00020747149,0.00014809766,0.000115839575,0.0006152033,0.0007771012,0.00970434],"genre_scores_gemma":[0.48861971,0.001319392,0.49589637,0.00009182546,0.0003266657,0.0003910512,0.003091498,0.0005831815,0.009680286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737394,0.0008155452,0.0003303533,0.00053129456,0.00080849126,0.00014032371],"domain_scores_gemma":[0.9882776,0.00794912,0.000677531,0.0012446594,0.0015051522,0.00034587164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022932745,0.0006031616,0.0009737279,0.0075361235,0.0013610098,0.0045958767,0.0011441256,0.0011142333,0.010516798],"category_scores_gemma":[0.01541067,0.0007575077,0.0008219735,0.008054776,0.0012948595,0.012253932,0.0031633347,0.0013258493,0.0025165346],"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.0004518001,0.00021609696,0.005905391,0.0004552626,0.00014241245,0.00028646522,0.001005367,0.020533059,0.010307827,0.45947814,0.004787228,0.49643096],"study_design_scores_gemma":[0.000052519405,0.00013354569,0.0018186356,0.00017848093,0.00007672783,0.00032144896,0.00054784934,0.23469058,0.0043809144,0.7474202,0.010309883,0.00006908643],"about_ca_topic_score_codex":0.0010586719,"about_ca_topic_score_gemma":0.0018517007,"teacher_disagreement_score":0.010516798,"about_ca_system_score_codex":0.00067491404,"about_ca_system_score_gemma":0.00082303234,"threshold_uncertainty_score":0.035182178},"labels":[],"label_agreement":null},{"id":"W1532348468","doi":"10.1007/978-3-540-30140-0_33","title":"Dynamic Shannon Coding","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Huffman coding; Shannon–Fano coding; Variable-length code; Tunstall coding; Computer science; Coding (social sciences); Context-adaptive binary arithmetic coding; Algorithm; Upper and lower bounds; Context-adaptive variable-length coding; Prefix code; Prefix; Arithmetic coding; Theoretical computer science; Data compression; Mathematics; Decoding methods; Block code; Linear code; Statistics","score_opus":0.013131127827712762,"score_gpt":0.24681742799066775,"score_spread":0.233686300162955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532348468","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009950103,0.0047635543,0.45590806,0.0020840338,0.0015754128,0.0000898237,0.0007097848,0.0009875724,0.5239316],"genre_scores_gemma":[0.41288704,0.011069896,0.15699556,0.002185594,0.0017663648,0.00034012343,0.0019203866,0.0011204528,0.41171455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962103,0.0000619066,0.000014579469,0.00005414234,0.00020707153,0.0000411905],"domain_scores_gemma":[0.9995555,0.00014893217,0.000024820203,0.0001473493,0.000093830065,0.00002966343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037507317,0.000705495,0.00051995914,0.0013476484,0.00078730605,0.0016467065,0.0006697655,0.0009743984,0.021422045],"category_scores_gemma":[0.0016497525,0.00033455627,0.00033133168,0.0014605612,0.0014312678,0.0019755955,0.001565089,0.0018323228,0.005543996],"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.000020577485,0.000009990539,0.000048018886,0.000042016836,0.000005490782,0.000039367183,0.000044804903,0.0035789867,0.0017316227,0.91959316,0.0123871695,0.062498827],"study_design_scores_gemma":[0.000009686129,0.000022706045,0.00013694908,0.000068996225,0.000011598783,0.0003217277,0.00003331203,0.027628627,0.004901294,0.8775314,0.08929989,0.000033878205],"about_ca_topic_score_codex":0.0005496471,"about_ca_topic_score_gemma":0.0005485174,"teacher_disagreement_score":0.021422045,"about_ca_system_score_codex":0.00074089173,"about_ca_system_score_gemma":0.0007403705,"threshold_uncertainty_score":0.071663916},"labels":[],"label_agreement":null},{"id":"W1532366404","doi":"10.1007/3-540-45784-4_7","title":"Improved Approximation Algorithms for NMR Spectral Peak Assignment","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Bipartite graph; Disjoint sets; Matching (statistics); Combinatorics; Mathematics; Algorithm; Approximation algorithm; Blossom algorithm; Graph; Discrete mathematics","score_opus":0.023991185663024207,"score_gpt":0.25009370055341273,"score_spread":0.22610251489038852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532366404","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.002476184,0.0003350487,0.99477947,0.00012278427,0.00008682537,0.00003687686,0.000091793634,0.0009025823,0.0011684746],"genre_scores_gemma":[0.031568184,0.00041803764,0.9629164,0.00012312457,0.00014756233,0.00022631673,0.00057717756,0.00037848306,0.003644736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749124,0.0007363017,0.00016666498,0.00037139977,0.00097316253,0.00026122914],"domain_scores_gemma":[0.9930347,0.0038412677,0.00031783103,0.0016690663,0.0009528909,0.00018434373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029998573,0.0023189567,0.0026023162,0.0022739267,0.001109232,0.0027813085,0.005173534,0.0022907897,0.012241632],"category_scores_gemma":[0.015357594,0.0011294768,0.0015940055,0.00511744,0.0014244099,0.004616009,0.003530766,0.0045687174,0.005494892],"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.00075187715,0.0003084965,0.0004396972,0.00031363446,0.00009113662,0.0000843652,0.00018762525,0.24267584,0.0055057216,0.07169739,0.018383471,0.65956074],"study_design_scores_gemma":[0.000075219235,0.00004123868,0.00012904238,0.00002077542,0.000027652404,0.00007963441,0.00003677711,0.932414,0.002163041,0.061356623,0.0036359236,0.000020063464],"about_ca_topic_score_codex":0.004711576,"about_ca_topic_score_gemma":0.0057023834,"teacher_disagreement_score":0.012241632,"about_ca_system_score_codex":0.0021727858,"about_ca_system_score_gemma":0.0022449915,"threshold_uncertainty_score":0.040952325},"labels":[],"label_agreement":null},{"id":"W1532452946","doi":"10.1007/978-3-540-87536-9_10","title":"A New Type of ART2 Architecture and Application to Color Image Segmentation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Computer science; Artificial intelligence; Color space; Pattern recognition (psychology); Segmentation; Cluster analysis; Image segmentation; Feature (linguistics); Adaptive resonance theory; Similarity (geometry); Artificial neural network; Architecture; Feature vector; Computer vision; Color image; Image (mathematics); Image processing","score_opus":0.013044934826912002,"score_gpt":0.25908820514548403,"score_spread":0.24604327031857204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532452946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011593592,0.0006296468,0.9666508,0.00015288532,0.00023521698,0.000052284126,0.00016869928,0.0059808604,0.014535979],"genre_scores_gemma":[0.16756305,0.0006020321,0.797435,0.00037747127,0.00018674468,0.00010249914,0.00051796355,0.0008817704,0.03233339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997633,0.000023832621,0.000010848202,0.00008354098,0.00008658535,0.000031857373],"domain_scores_gemma":[0.9997558,0.000044743316,0.000009499421,0.00007063266,0.00009703779,0.000022326632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003352293,0.0007834858,0.0005862002,0.00080307206,0.0005950261,0.0016371306,0.002568536,0.0014192072,0.016064472],"category_scores_gemma":[0.00073216,0.0005402376,0.00087070593,0.0011609526,0.00051277305,0.0013812898,0.0010526779,0.000996367,0.0036199186],"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.00038880378,0.00010915435,0.0006623376,0.00031696958,0.0001417911,0.000245044,0.0001292544,0.056400675,0.11141586,0.03610453,0.01731806,0.77676755],"study_design_scores_gemma":[0.000032471507,0.00015147739,0.00070550933,0.00003426922,0.000084637904,0.000534513,0.000028062219,0.8729948,0.068569675,0.021068174,0.035754822,0.000041639563],"about_ca_topic_score_codex":0.0033339476,"about_ca_topic_score_gemma":0.0068173814,"teacher_disagreement_score":0.016064472,"about_ca_system_score_codex":0.00055802794,"about_ca_system_score_gemma":0.00049689057,"threshold_uncertainty_score":0.05374098},"labels":[],"label_agreement":null},{"id":"W1532470617","doi":"10.1007/978-3-540-75444-2_22","title":"Parallel Genetic Algorithms for DVS Scheduling of Distributed Embedded Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Distributed computing; Mathematics; Mathematical optimization","score_opus":0.035800910122659096,"score_gpt":0.2809582964222402,"score_spread":0.2451573862995811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532470617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02325596,0.00089251937,0.96536547,0.00031869955,0.0001775978,0.000052096228,0.00005553903,0.0006270311,0.009255013],"genre_scores_gemma":[0.536587,0.0008114802,0.4463494,0.0001368637,0.00014545908,0.00018822135,0.0001925609,0.00030174913,0.015287284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997708,0.00007640685,0.0000075060493,0.000029202061,0.000080602884,0.000035529738],"domain_scores_gemma":[0.99966836,0.00019095266,0.000023223558,0.00003331161,0.00006424006,0.00001993687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051731564,0.0005031219,0.0007340659,0.0005065143,0.00048638982,0.0005935964,0.0011849254,0.0007155103,0.0027967575],"category_scores_gemma":[0.0015484086,0.00035507928,0.00041666883,0.00090466347,0.00052051974,0.0004649012,0.0005160317,0.0009138872,0.00041632203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007777879,0.000044204062,0.00014117215,0.000042417974,0.000017924896,0.000021457548,0.000027848117,0.9112814,0.0015512989,0.012695224,0.0017876435,0.07231151],"study_design_scores_gemma":[0.00002142904,0.000016165186,0.000048712744,0.000004082984,0.0000042033653,0.000007817718,0.0000081191,0.9889865,0.00042660895,0.009347992,0.0011260023,0.0000023948892],"about_ca_topic_score_codex":0.0071929395,"about_ca_topic_score_gemma":0.006617982,"teacher_disagreement_score":0.0071929395,"about_ca_system_score_codex":0.0011765783,"about_ca_system_score_gemma":0.0011131533,"threshold_uncertainty_score":0.0143021345},"labels":[],"label_agreement":null},{"id":"W1532575505","doi":"10.1007/3-540-47922-8_22","title":"Text Summarization as Controlled Search","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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 Ottawa","funders":"","keywords":"Automatic summarization; Computer science; Generator (circuit theory); Reliability (semiconductor); Set (abstract data type); Segmentation; Artificial intelligence; Process (computing); Quality (philosophy); Natural language processing; Information retrieval; Power (physics)","score_opus":0.016158621043454276,"score_gpt":0.27138025263504706,"score_spread":0.2552216315915928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532575505","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.014570665,0.0044763377,0.9424285,0.0007072673,0.00036827603,0.0006858192,0.0015999576,0.014797056,0.020366183],"genre_scores_gemma":[0.23988454,0.0023394781,0.6941118,0.0003667997,0.000601604,0.0007755855,0.006456454,0.0020499674,0.05341374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982697,0.00070260244,0.00014710391,0.0003147157,0.00048380566,0.000082143444],"domain_scores_gemma":[0.99594694,0.0026021057,0.00025698115,0.0006187593,0.0005026526,0.00007264527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013190843,0.0009404818,0.001681426,0.0031275707,0.00083410734,0.0024914856,0.0018257317,0.0010192731,0.020444917],"category_scores_gemma":[0.006008851,0.0005677455,0.000911003,0.004098284,0.0007685232,0.003956918,0.0013398654,0.00075316976,0.006805085],"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.0008846699,0.00020486819,0.00027364478,0.0013260522,0.00014854615,0.00022801514,0.00045047738,0.012028624,0.042734895,0.06251096,0.045681577,0.8335276],"study_design_scores_gemma":[0.0003869783,0.00090852793,0.0012289528,0.00026013804,0.00050643296,0.00093118026,0.00044686973,0.47597066,0.09343453,0.26549459,0.16024402,0.00018716555],"about_ca_topic_score_codex":0.0012758856,"about_ca_topic_score_gemma":0.0015803056,"teacher_disagreement_score":0.020444917,"about_ca_system_score_codex":0.0005749558,"about_ca_system_score_gemma":0.00073584035,"threshold_uncertainty_score":0.06839508},"labels":[],"label_agreement":null},{"id":"W1532778915","doi":"10.1007/978-3-540-74913-4_78","title":"Near-Optimal Mobile Robot Recharging with the Rate-Maximizing Forager","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":30,"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":"Heuristic; Scalability; Computer science; Foraging; Robot; Mobile robot; Groundwater recharge; Task (project management); Mathematical optimization; Simulation; Real-time computing; Artificial intelligence; Engineering; Mathematics; Ecology","score_opus":0.019447222101063512,"score_gpt":0.23412632182532062,"score_spread":0.2146790997242571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532778915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10817114,0.00089966255,0.87514246,0.00054223824,0.00011723112,0.000069506576,0.00006705061,0.0004516306,0.01453898],"genre_scores_gemma":[0.9359527,0.00031248562,0.057057198,0.0000792909,0.0000705024,0.0000605666,0.00004037038,0.000049482736,0.006377309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984026,0.00003987217,0.0000065815225,0.000042835178,0.000037930975,0.000032497843],"domain_scores_gemma":[0.99983895,0.00007174683,0.000026863396,0.000021095399,0.000024700988,0.000016712042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003835652,0.0006970575,0.0013872933,0.00034603564,0.000565106,0.0006492884,0.0011639622,0.0010330038,0.001400061],"category_scores_gemma":[0.0009036422,0.00041982875,0.00048615763,0.00045572975,0.0006755924,0.001020404,0.00087606267,0.0004988368,0.0004996434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028578076,0.000066302426,0.00052449235,0.00016325654,0.00006962338,0.0002986628,0.00017921299,0.8977669,0.021945724,0.020617653,0.0027507066,0.05533165],"study_design_scores_gemma":[0.000023957942,0.00011816581,0.00016428431,0.0000090789645,0.000016592932,0.00011902266,0.00003598088,0.9874839,0.0014508961,0.0097151995,0.000847996,0.000014807686],"about_ca_topic_score_codex":0.001147366,"about_ca_topic_score_gemma":0.0010257444,"teacher_disagreement_score":0.001400061,"about_ca_system_score_codex":0.0003808772,"about_ca_system_score_gemma":0.0004088487,"threshold_uncertainty_score":0.0046836734},"labels":[],"label_agreement":null},{"id":"W1532814626","doi":"10.1007/3-540-44467-x_32","title":"Memory Consistency and Process Coordination for SPARC Multiprocessors","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Calgary","funders":"","keywords":"Computer science; Sequential consistency; Correctness; Consistency (knowledge bases); Consistency model; Critical section; Rotation formalisms in three dimensions; Memory model; Synchronization (alternating current); Set (abstract data type); Parallel computing; Theoretical computer science; Shared memory; Programming language; Distributed computing","score_opus":0.016796391757680617,"score_gpt":0.2644749244284944,"score_spread":0.2476785326708138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532814626","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.09417465,0.006586427,0.85570186,0.0015611242,0.00083169126,0.00019669364,0.00026140708,0.0024952786,0.038190838],"genre_scores_gemma":[0.7918256,0.0019150504,0.17701387,0.00025799064,0.0005651584,0.00032046324,0.00047901674,0.00070956576,0.026913377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980459,0.00048852974,0.00013687198,0.00035092531,0.00061849505,0.00035936412],"domain_scores_gemma":[0.99554694,0.0018021711,0.0003473572,0.0015123523,0.00060790346,0.0001832385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488514,0.0006215264,0.0011268815,0.0007481813,0.001822136,0.0030495364,0.0026170027,0.0011184445,0.003766376],"category_scores_gemma":[0.008141888,0.0010242673,0.00051344896,0.0017430625,0.0017429016,0.003862795,0.0017658736,0.0023395435,0.00051585486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009982147,0.00017248205,0.0018077367,0.0003576386,0.00008365238,0.00032360438,0.00074703095,0.14186203,0.0103092,0.6694866,0.019071814,0.15478002],"study_design_scores_gemma":[0.00019818329,0.00014403148,0.0011329417,0.00005411152,0.00010791256,0.00028208844,0.0002082134,0.3838895,0.014349328,0.57150054,0.028076146,0.000056952867],"about_ca_topic_score_codex":0.004683476,"about_ca_topic_score_gemma":0.004437368,"teacher_disagreement_score":0.004683476,"about_ca_system_score_codex":0.0014132289,"about_ca_system_score_gemma":0.0023343496,"threshold_uncertainty_score":0.013160646},"labels":[],"label_agreement":null},{"id":"W1532889113","doi":"10.1007/978-3-540-45237-9_8","title":"A Multilingual Approach to Multilingual Information Retrieval","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Search engine indexing; Natural language processing; Information retrieval; Set (abstract data type); Artificial intelligence; Multilingualism; Programming language; Linguistics","score_opus":0.023396323009704394,"score_gpt":0.2649531029623329,"score_spread":0.24155677995262848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532889113","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.0043865447,0.002121877,0.97831327,0.0005569549,0.00022314397,0.00009892902,0.00034181328,0.001937375,0.012020043],"genre_scores_gemma":[0.13666365,0.0034634003,0.8327941,0.0006469151,0.0008460788,0.0003151461,0.0025389092,0.0010964699,0.021635339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973201,0.0010878479,0.0003235109,0.0003241375,0.0007422023,0.00020217129],"domain_scores_gemma":[0.99725336,0.0008865757,0.00014130231,0.0005628946,0.0010350412,0.00012079763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018961295,0.0006283584,0.0010268977,0.0044307015,0.0019788134,0.0044218367,0.0015464564,0.00090297306,0.009234552],"category_scores_gemma":[0.0056556375,0.0006706569,0.0013535254,0.004684061,0.001150864,0.007512877,0.0043373033,0.0013558968,0.00472731],"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.0003705522,0.0002467939,0.0012438061,0.0008705595,0.00026383912,0.0008028058,0.0015980134,0.010519395,0.015137597,0.18487923,0.047834825,0.73623264],"study_design_scores_gemma":[0.00011129897,0.0003043109,0.0017162809,0.00033983059,0.00062166894,0.002922732,0.0018649597,0.22672541,0.031044684,0.4064745,0.32753167,0.00034259784],"about_ca_topic_score_codex":0.0034925565,"about_ca_topic_score_gemma":0.0062133637,"teacher_disagreement_score":0.009234552,"about_ca_system_score_codex":0.0009728076,"about_ca_system_score_gemma":0.0011639262,"threshold_uncertainty_score":0.03089261},"labels":[],"label_agreement":null},{"id":"W1532976673","doi":"10.1007/10720246_15","title":"Real-Time Scheduling for Multi-agent Call Center Automation","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Computer science; Scheduling (production processes); Schedule; Distributed computing; Software agent; Service (business); Architecture; Job shop scheduling; Real-time computing; Operations research; Artificial intelligence; Operating system; Operations management; Engineering","score_opus":0.022565601078526357,"score_gpt":0.2588587918692638,"score_spread":0.23629319079073746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532976673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023726517,0.00074082747,0.96304065,0.00017045191,0.0002751252,0.000075064134,0.000043590993,0.0018913164,0.010036389],"genre_scores_gemma":[0.7733855,0.00044075144,0.21040718,0.00007032801,0.00019386435,0.00013144617,0.00012826292,0.00028645486,0.014956213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995358,0.00014976141,0.0000274365,0.00008203644,0.00012693455,0.00007808876],"domain_scores_gemma":[0.9995357,0.00023119905,0.000049757225,0.00006206801,0.000071062925,0.000050306553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064670754,0.00069666805,0.00066580664,0.0003342534,0.0006498849,0.0009094012,0.0013707124,0.0005475216,0.004897129],"category_scores_gemma":[0.0010369666,0.00038802263,0.00031790923,0.00043128565,0.0003477603,0.0007431878,0.00046556708,0.00087816163,0.00091377436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096507336,0.00028848762,0.00036519478,0.00021357625,0.00007534618,0.00022836683,0.00021681136,0.62291914,0.032003764,0.043944955,0.012378714,0.28640056],"study_design_scores_gemma":[0.000030141093,0.000067427754,0.00014387837,0.0000049338933,0.00001193222,0.000044750155,0.000017471613,0.9855112,0.0036706275,0.0063346135,0.0041534635,0.000009510718],"about_ca_topic_score_codex":0.0022013476,"about_ca_topic_score_gemma":0.0032212639,"teacher_disagreement_score":0.004897129,"about_ca_system_score_codex":0.00062147545,"about_ca_system_score_gemma":0.0005694192,"threshold_uncertainty_score":0.016382515},"labels":[],"label_agreement":null},{"id":"W1533076956","doi":"10.1007/3-540-45486-1_25","title":"Neural ARX Models and PAC Learning","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Stability (learning theory); Artificial neural network; Artificial intelligence; Sigmoid function; Machine learning","score_opus":0.014195892399732549,"score_gpt":0.23774396600253747,"score_spread":0.22354807360280493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533076956","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.010975801,0.006316794,0.9267438,0.0021865927,0.0005342331,0.000023058927,0.00020952716,0.0009273886,0.052082732],"genre_scores_gemma":[0.5517899,0.010391241,0.22268449,0.0011382353,0.0018188376,0.00019501417,0.0010723745,0.0007467606,0.21016319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965596,0.00013026783,0.000014114214,0.00006394868,0.00010286839,0.000032967975],"domain_scores_gemma":[0.9990402,0.0005795014,0.00007501133,0.00015791928,0.00011498485,0.00003246131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095227204,0.00064721226,0.0010149045,0.0004531367,0.00043468646,0.0020279614,0.0016677649,0.0015347726,0.011037181],"category_scores_gemma":[0.004096002,0.0004539088,0.0005177971,0.0009169421,0.001039517,0.004013864,0.0009663132,0.002912152,0.002807227],"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.00004070488,0.000025757832,0.00025824626,0.00007963034,0.000032289205,0.000054461514,0.00004672475,0.14257807,0.00042437628,0.7615343,0.011154367,0.08377104],"study_design_scores_gemma":[0.000007259195,0.00001624395,0.0001046898,0.000016358974,0.000009731114,0.00006899205,0.000012976,0.5055444,0.00033504184,0.48564252,0.0082298545,0.000011778759],"about_ca_topic_score_codex":0.0015362288,"about_ca_topic_score_gemma":0.0011902382,"teacher_disagreement_score":0.011037181,"about_ca_system_score_codex":0.00062972016,"about_ca_system_score_gemma":0.00043712376,"threshold_uncertainty_score":0.03692299},"labels":[],"label_agreement":null},{"id":"W1533211775","doi":"10.1007/978-3-642-38986-3_10","title":"An Introduction to Quantum Programming in Quipper","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Programming language; Computation; Quantum information; Quantum algorithm; Quantum mechanics; Physics","score_opus":0.010064551957939108,"score_gpt":0.24337859365673484,"score_spread":0.23331404169879572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533211775","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047429157,0.016320903,0.30546004,0.008639233,0.003956497,0.000109571476,0.0004503806,0.001551316,0.6587692],"genre_scores_gemma":[0.11751684,0.020130465,0.13938336,0.0042417385,0.0037707419,0.0004265567,0.00042171124,0.002273183,0.7118354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996519,0.000086839485,0.000016226126,0.000059546997,0.0001414718,0.000044049848],"domain_scores_gemma":[0.9996885,0.00018832169,0.000010996985,0.000037275975,0.000049548747,0.000025409005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004968487,0.0008604971,0.000929815,0.0012174764,0.0019130306,0.0019118977,0.0012458717,0.0010522482,0.047176376],"category_scores_gemma":[0.0011945763,0.00070792256,0.000747677,0.0022097332,0.002874501,0.0049563153,0.0015429998,0.0038372634,0.012287313],"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.0000069259854,0.000016698576,0.000023564131,0.00007682883,0.0000031517484,0.000023696099,0.0001365162,0.00046122647,0.00025160616,0.9408223,0.023759924,0.034417562],"study_design_scores_gemma":[0.0000034400414,0.000009873519,0.00006709077,0.00006652988,0.000003311753,0.00008230872,0.000025650754,0.001228132,0.0003149439,0.82776165,0.17042081,0.000016216545],"about_ca_topic_score_codex":0.0008816234,"about_ca_topic_score_gemma":0.0015548333,"teacher_disagreement_score":0.047176376,"about_ca_system_score_codex":0.001601199,"about_ca_system_score_gemma":0.0008709768,"threshold_uncertainty_score":0.15782076},"labels":[],"label_agreement":null},{"id":"W1533292482","doi":"10.1007/11745693_34","title":"Effective Dynamic Replica Maintenance Algorithm for the Grid Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing 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":"University of Calgary","funders":"","keywords":"Replica; Computer science; Latency (audio); Grid; Performance metric; Distributed computing; Metric (unit); Replication (statistics); Response time; Data grid; Parallel computing; Grid computing; Algorithm; Real-time computing; Operating system; Mathematics","score_opus":0.00673495869084776,"score_gpt":0.21870255949623957,"score_spread":0.21196760080539181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533292482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0353478,0.0006687774,0.9585932,0.00026597967,0.00015790093,0.00005667021,0.000089229856,0.0016009923,0.0032194084],"genre_scores_gemma":[0.48863173,0.00028988192,0.50544286,0.00008015595,0.00008222146,0.00010306942,0.00022745304,0.00018726075,0.0049553197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999658,0.000078571116,0.000019769426,0.000065713015,0.0001290222,0.000048889404],"domain_scores_gemma":[0.9991953,0.00017323454,0.000049538616,0.000317635,0.0002116428,0.000052649008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005978597,0.00037879983,0.00085345627,0.0006108662,0.0009119197,0.00088000786,0.0019151205,0.0005260527,0.0023280326],"category_scores_gemma":[0.0017422298,0.0002367246,0.00027834764,0.000915561,0.00040537646,0.00134793,0.00096554664,0.0007214243,0.0004042049],"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.00081435713,0.0001744776,0.001281251,0.0002343163,0.000089627436,0.00022419161,0.0002760888,0.2812669,0.025728565,0.060143072,0.018137602,0.6116295],"study_design_scores_gemma":[0.000081168546,0.00005874402,0.00019297845,0.0000051620223,0.000029154291,0.00013540515,0.00002507712,0.9738278,0.0042337226,0.018198745,0.0032003545,0.000011779364],"about_ca_topic_score_codex":0.002564197,"about_ca_topic_score_gemma":0.0028844841,"teacher_disagreement_score":0.002564197,"about_ca_system_score_codex":0.00058621337,"about_ca_system_score_gemma":0.0010671488,"threshold_uncertainty_score":0.007788062},"labels":[],"label_agreement":null},{"id":"W1533306636","doi":"10.1007/3-540-47922-8_19","title":"Using Inter-agent Trust Relationships for Efficient Coalition Formation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"University of Saskatchewan","funders":"","keywords":"Vendor; Mechanism (biology); Computer science; Multi-agent system; State (computer science); Distributed computing; Microeconomics; Business; Economics; Artificial intelligence; Marketing; Algorithm","score_opus":0.10465136299587129,"score_gpt":0.2888860246972053,"score_spread":0.184234661701334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533306636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00868302,0.00007307284,0.988902,0.00013449382,0.000020234647,0.00005097824,0.000025450341,0.00015184107,0.0019590033],"genre_scores_gemma":[0.60773814,0.00019225794,0.3883797,0.00006481305,0.00004114727,0.0002071843,0.00014733605,0.00010980246,0.00311969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973124,0.0012671461,0.0001718055,0.000361541,0.00069877616,0.00018833223],"domain_scores_gemma":[0.9900727,0.00620718,0.0007937931,0.0016804407,0.0009828612,0.00026283253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038082823,0.0007478901,0.0012070438,0.0009040948,0.0011387527,0.0018581041,0.0017909458,0.0014210227,0.0036164378],"category_scores_gemma":[0.024697023,0.0007898227,0.00080232625,0.0012298351,0.0008417472,0.006673611,0.002909445,0.0020483092,0.0010572558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042431947,0.00031725006,0.0018286783,0.00028724255,0.00021918109,0.0002808078,0.00089517777,0.43679988,0.007923609,0.20951016,0.0055111037,0.33600265],"study_design_scores_gemma":[0.000029579793,0.0000514146,0.0001625541,0.000014643422,0.000037468824,0.00007790666,0.00008648577,0.9037402,0.0024548075,0.09177147,0.0015585413,0.000014970924],"about_ca_topic_score_codex":0.0015201704,"about_ca_topic_score_gemma":0.0030024198,"teacher_disagreement_score":0.0038082823,"about_ca_system_score_codex":0.0009135702,"about_ca_system_score_gemma":0.0014026558,"threshold_uncertainty_score":0.02014035},"labels":[],"label_agreement":null},{"id":"W1533326618","doi":"10.1007/978-3-540-89454-4_16","title":"Looking at the Interactive Narrative Experience through the Eyes of the Participants","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Narrative; Chose; Drama; Computer science; Lived experience; Aesthetics; Psychology; Visual arts; Art; Literature; Psychoanalysis","score_opus":0.031044182661870385,"score_gpt":0.32014328236119916,"score_spread":0.2890990996993288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533326618","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.4806055,0.0036047164,0.05950247,0.019468224,0.0013626715,0.00024398477,0.00058291655,0.00070455053,0.43392494],"genre_scores_gemma":[0.917924,0.00089815527,0.009256316,0.0015135846,0.00013692478,0.00010527923,0.00014760478,0.00042790378,0.069590285],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9991335,0.00042587813,0.000012479362,0.00012442445,0.00015781297,0.0001459274],"domain_scores_gemma":[0.9987942,0.0007692917,0.00006711766,0.00005028362,0.0000867869,0.00023229633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009165263,0.000824523,0.00043519083,0.0006210284,0.0049243164,0.007855525,0.001067439,0.0027525236,0.018639067],"category_scores_gemma":[0.0034902836,0.00039690686,0.000748474,0.0005440263,0.0050528664,0.008285037,0.0052395747,0.00513425,0.0023390718],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029442972,0.000049558046,0.0010946164,0.0004014673,0.000025336407,0.0027585812,0.8915764,0.00035444874,0.021033151,0.060088005,0.009376865,0.012947213],"study_design_scores_gemma":[0.000059168113,0.00026969367,0.0033751472,0.00050497684,0.00006363286,0.004606278,0.6713137,0.0011148384,0.0074514505,0.03046836,0.28063735,0.00013544828],"about_ca_topic_score_codex":0.0021693625,"about_ca_topic_score_gemma":0.0025756801,"teacher_disagreement_score":0.018639067,"about_ca_system_score_codex":0.0008370916,"about_ca_system_score_gemma":0.0006945017,"threshold_uncertainty_score":0.06235385},"labels":[],"label_agreement":null},{"id":"W1533327484","doi":"10.1007/978-3-540-31985-6_20","title":"A Study of Type Analysis for Speculative Method Inlining in a JIT Environment","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Type (biology); Parallel computing","score_opus":0.046598433190515064,"score_gpt":0.30614940834916216,"score_spread":0.2595509751586471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533327484","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.06311683,0.0037568216,0.89454514,0.002447412,0.00040875067,0.00013354878,0.00015410119,0.0020244701,0.033412937],"genre_scores_gemma":[0.6199814,0.0024585186,0.3528195,0.00095837895,0.0009154096,0.00014953117,0.00023355958,0.002422846,0.020060886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953892,0.0017094502,0.00022493368,0.0005954786,0.0015609651,0.0005198269],"domain_scores_gemma":[0.9736964,0.01985458,0.0012354729,0.0035758815,0.00132991,0.00030772254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00464174,0.001244439,0.0016083071,0.0024469818,0.0021658354,0.0044469736,0.0029746962,0.0015243414,0.005515854],"category_scores_gemma":[0.025576357,0.0015689423,0.002609903,0.003928294,0.0058645853,0.01151599,0.002627777,0.0059374655,0.00062812964],"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.00022644378,0.0001160621,0.0033815359,0.0003455962,0.00006967351,0.0003004909,0.0010197923,0.015424772,0.0028673331,0.8723097,0.0052210176,0.09871758],"study_design_scores_gemma":[0.000030371135,0.000079210055,0.00092359737,0.00012379192,0.00011051161,0.00036028476,0.00022722312,0.162788,0.005294757,0.82174784,0.008272637,0.000041739888],"about_ca_topic_score_codex":0.0026684564,"about_ca_topic_score_gemma":0.002537851,"teacher_disagreement_score":0.005515854,"about_ca_system_score_codex":0.0022074769,"about_ca_system_score_gemma":0.002219283,"threshold_uncertainty_score":0.024548173},"labels":[],"label_agreement":null},{"id":"W1533329939","doi":"10.1007/978-3-540-45078-8_14","title":"The One-Round Voronoi Game Replayed","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Voronoi diagram; Polygon (computer graphics); Fraction (chemistry); Mathematics; Polyomino; Regular polygon; Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.03409214620184781,"score_gpt":0.27259146106672577,"score_spread":0.23849931486487796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533329939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19676334,0.00042158779,0.73345363,0.0008597831,0.00045445864,0.00027650903,0.0006802852,0.00091513136,0.06617528],"genre_scores_gemma":[0.8776761,0.00016773319,0.09321889,0.00013587036,0.000042580734,0.0001690526,0.00041444958,0.00020110943,0.027974203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987545,0.00046882176,0.00005387248,0.00022181103,0.00028239467,0.00021857988],"domain_scores_gemma":[0.9978188,0.0010922104,0.00011208852,0.0004553282,0.00025644523,0.00026516692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010041565,0.0006743994,0.0014900011,0.00047106927,0.0012147345,0.0016620955,0.0024536569,0.0019235326,0.012341168],"category_scores_gemma":[0.0072868485,0.00040884095,0.0007813378,0.00053633185,0.0014690806,0.0025452394,0.0030643067,0.0014591363,0.0014773161],"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.002288876,0.00016413615,0.00076365314,0.00032800238,0.00014932457,0.0006779853,0.0005993436,0.35074562,0.007774297,0.55571556,0.011122167,0.069671035],"study_design_scores_gemma":[0.00012772236,0.0001682028,0.00015442974,0.000029445142,0.000024503479,0.00020108483,0.0001382815,0.7717679,0.0021597235,0.21997847,0.0052088564,0.000041318417],"about_ca_topic_score_codex":0.003683178,"about_ca_topic_score_gemma":0.002870144,"teacher_disagreement_score":0.012341168,"about_ca_system_score_codex":0.0009058762,"about_ca_system_score_gemma":0.0013316541,"threshold_uncertainty_score":0.041285336},"labels":[],"label_agreement":null},{"id":"W1533373774","doi":"10.1007/978-3-540-24855-2_119","title":"CellNet Co-Ev: Evolving Better Pattern Recognizers Using Competitive Co-evolution","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.01845423380202252,"score_gpt":0.2564964090425729,"score_spread":0.2380421752405504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533373774","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.122089826,0.0006346017,0.85823435,0.00043548166,0.00050964265,0.00022306142,0.0002398437,0.007940757,0.009692426],"genre_scores_gemma":[0.32796484,0.00023426353,0.65531856,0.0006686084,0.00010545358,0.000281301,0.0007315603,0.0011934099,0.0135018695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.00007418983,0.000024661631,0.00013395713,0.00014475493,0.000053314507],"domain_scores_gemma":[0.99865365,0.00062742655,0.000063161606,0.00023929484,0.00034403848,0.000072324656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010338288,0.0010958852,0.0012023007,0.0010131476,0.00045541592,0.0011330923,0.0023856994,0.0020100782,0.006789913],"category_scores_gemma":[0.0029540746,0.00053619564,0.0007554758,0.0009540907,0.0006033369,0.0015850094,0.0012416999,0.001416518,0.0017468875],"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.00031476334,0.00036303434,0.0025474601,0.00019494789,0.00023944174,0.000333548,0.0001727691,0.2532271,0.041868575,0.009943366,0.012312529,0.6784824],"study_design_scores_gemma":[0.000025417241,0.00006823193,0.000148352,0.000005971491,0.000031755713,0.000097342476,0.000019882453,0.9871262,0.0083177155,0.002231956,0.0019172844,0.000009901085],"about_ca_topic_score_codex":0.00371795,"about_ca_topic_score_gemma":0.005194846,"teacher_disagreement_score":0.006789913,"about_ca_system_score_codex":0.00059310836,"about_ca_system_score_gemma":0.0006616293,"threshold_uncertainty_score":0.022714555},"labels":[],"label_agreement":null},{"id":"W1533378118","doi":"10.1007/978-3-642-15705-9_71","title":"Symmetric Positive-Definite Cartesian Tensor Orientation Distribution Functions (CT-ODF)","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian coordinate system; Tensor (intrinsic definition); Cartesian tensor; Diffusion MRI; Orientation (vector space); Tensor field; Parametrization (atmospheric modeling); Computer science; Positive-definite matrix; Mathematical analysis; Mathematics; Pure mathematics; Geometry; Physics; Tensor density; Exact solutions in general relativity; Optics","score_opus":0.023883811653267608,"score_gpt":0.3153876280106692,"score_spread":0.29150381635740163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533378118","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.0069634398,0.00029856994,0.98748606,0.0002541767,0.0001431728,0.00005411554,0.00065086986,0.00037837887,0.003771153],"genre_scores_gemma":[0.19769147,0.0016934982,0.7845009,0.0004334716,0.0002700762,0.00024276073,0.0018201466,0.00081103964,0.012536507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946684,0.00015800449,0.00003865514,0.00010271327,0.00017621901,0.00005765193],"domain_scores_gemma":[0.9976006,0.0004663188,0.00041716002,0.00052569824,0.0007664483,0.00022374412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016285931,0.0012157874,0.00049179804,0.0011884165,0.00039553258,0.0017516079,0.0009577592,0.0012416366,0.0073882076],"category_scores_gemma":[0.005737646,0.00030163466,0.00049266417,0.0012982282,0.0011355532,0.00204661,0.0008928878,0.0013028645,0.0029084592],"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.00025604988,0.000099724275,0.002000323,0.00045926307,0.00003935633,0.00047307677,0.00028137767,0.0328258,0.02015565,0.50704753,0.029376421,0.40698537],"study_design_scores_gemma":[0.00004764711,0.00012418977,0.0027443913,0.00015938283,0.000035167235,0.0028650893,0.00026521622,0.4629812,0.017743256,0.45500895,0.05785991,0.00016558815],"about_ca_topic_score_codex":0.0018244643,"about_ca_topic_score_gemma":0.0017532262,"teacher_disagreement_score":0.0073882076,"about_ca_system_score_codex":0.00040172203,"about_ca_system_score_gemma":0.0013208941,"threshold_uncertainty_score":0.02471602},"labels":[],"label_agreement":null},{"id":"W1533423916","doi":"10.1007/11527886_61","title":"User Control over User Adaptation: A Case Study","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"Acadia University","funders":"","keywords":"User modeling; Computer science; Usability; Adaptation (eye); Human–computer interaction; Computer user satisfaction; Control (management); User interface; User interface design; Context (archaeology); Filter (signal processing); User experience design; Artificial intelligence","score_opus":0.13997904750924967,"score_gpt":0.3841574351280078,"score_spread":0.24417838761875815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533423916","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.99007714,0.00016855932,0.0035088242,0.00031028065,0.000014802039,0.00012773956,0.00007232313,0.00005395022,0.0056664553],"genre_scores_gemma":[0.99592716,0.00015442453,0.0015711853,0.000105293824,0.000012694496,0.000062124134,0.00003997761,0.000024138373,0.0021029166],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99701,0.0017750618,0.000121981226,0.00025326636,0.00041629287,0.00042338803],"domain_scores_gemma":[0.985748,0.010358151,0.0007247807,0.0014753798,0.0006922119,0.0010014182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023887882,0.00052368955,0.00047889852,0.0011618033,0.0028805207,0.0015172975,0.0014112304,0.0032809817,0.003027226],"category_scores_gemma":[0.013406977,0.00034168945,0.0005856089,0.0012913654,0.0016298743,0.0010973216,0.0014382895,0.0013498173,0.0005981982],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047092317,0.03717922,0.2693883,0.0012006771,0.00048879726,0.18128152,0.21674906,0.008093695,0.013006085,0.011525054,0.011599411,0.24477899],"study_design_scores_gemma":[0.0014948716,0.023367772,0.28981608,0.00054501765,0.00085865473,0.28708348,0.22922711,0.06651214,0.03417076,0.012065802,0.054196373,0.0006619076],"about_ca_topic_score_codex":0.0059662275,"about_ca_topic_score_gemma":0.008251731,"teacher_disagreement_score":0.0059662275,"about_ca_system_score_codex":0.00081781985,"about_ca_system_score_gemma":0.00070870324,"threshold_uncertainty_score":0.012633264},"labels":[],"label_agreement":null},{"id":"W1533428031","doi":"10.1007/978-3-540-85053-3_8","title":"A Lightweight Concurrent Fault Detection Scheme for the AES S-Boxes Using Normal Basis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Western University","funders":"","keywords":"Computer science; Polynomial basis; Basis (linear algebra); Field-programmable gate array; Advanced Encryption Standard; Overhead (engineering); Normal basis; Algorithm; Fault detection and isolation; Polynomial; Representation (politics); Binary number; Realization (probability); Parallel computing; Embedded system; Mathematics; Arithmetic; Artificial intelligence; Cryptography; Discrete mathematics; Galois theory; Statistics","score_opus":0.034083789874908836,"score_gpt":0.2873423837770239,"score_spread":0.2532585939021151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533428031","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.05179246,0.00037545676,0.9399607,0.00023435308,0.00021544039,0.00023854336,0.00007104796,0.0028634798,0.004248515],"genre_scores_gemma":[0.6223143,0.00021769,0.3692419,0.00016019223,0.00013362663,0.00022154354,0.00014013183,0.0001742785,0.0073964107],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838746,0.0003063406,0.00014273197,0.00026044005,0.00069681153,0.00020623479],"domain_scores_gemma":[0.99764013,0.00048673397,0.0002102019,0.0010805514,0.0004611483,0.00012126621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015720138,0.00072993897,0.0010768095,0.00075002195,0.0011227176,0.0017577368,0.0015390011,0.0009181031,0.0034506086],"category_scores_gemma":[0.0024633294,0.0004889831,0.00068502896,0.00060851016,0.001098085,0.0029662002,0.0026452446,0.0018080169,0.0011399742],"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.0029757512,0.00038681875,0.0010602367,0.0005031119,0.00014596764,0.00040464327,0.00056897674,0.026301635,0.20395866,0.3069936,0.00652842,0.45017222],"study_design_scores_gemma":[0.0006935976,0.0014213102,0.000834068,0.0001464971,0.00031048237,0.0013692111,0.00013647023,0.4960589,0.22353406,0.24448992,0.030775309,0.00023006074],"about_ca_topic_score_codex":0.00042380474,"about_ca_topic_score_gemma":0.0006308348,"teacher_disagreement_score":0.0034506086,"about_ca_system_score_codex":0.0009679022,"about_ca_system_score_gemma":0.0016966946,"threshold_uncertainty_score":0.011543393},"labels":[],"label_agreement":null},{"id":"W1533477547","doi":"10.1007/978-3-540-28633-2_33","title":"Beyond Learners’ Interest: Personalized Paper Recommendation Based on Their Pedagogical Features for an e-Learning System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"University of Saskatchewan","funders":"","keywords":"Computer science; Recommender system; Collaborative filtering; Similarity (geometry); Context (archaeology); Process (computing); Compromise; Personalized learning; Multimedia; Artificial intelligence; World Wide Web; Teaching method; Mathematics education; Cooperative learning; Open learning","score_opus":0.06805125118574133,"score_gpt":0.30750938174108683,"score_spread":0.23945813055534548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533477547","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.5137275,0.004305031,0.4542869,0.0016282754,0.00041758074,0.0003005029,0.0010763034,0.006565111,0.017692784],"genre_scores_gemma":[0.8690952,0.0010044276,0.1147692,0.00015998587,0.00020410231,0.00009272199,0.00074073,0.00018692757,0.013746768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961287,0.00010417777,0.000032297863,0.00008220912,0.00013231028,0.000036187696],"domain_scores_gemma":[0.99825996,0.0009853641,0.00010343006,0.00017059987,0.00034957184,0.00013108355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007225213,0.00057628757,0.0006109352,0.00073869387,0.00033887185,0.0010938279,0.00082811783,0.0009581133,0.0027055368],"category_scores_gemma":[0.0038415708,0.00029698058,0.00033113494,0.00081802753,0.00014951285,0.0016069096,0.00041515543,0.0006667366,0.0017694893],"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.0014097573,0.00079286145,0.015181722,0.00017606436,0.00014701023,0.00019004226,0.00031754634,0.011614011,0.030099742,0.0011818266,0.011983274,0.9269062],"study_design_scores_gemma":[0.00036631266,0.0019575597,0.060620483,0.00008801423,0.0007787377,0.0012331336,0.0005051927,0.814102,0.086561054,0.012670829,0.020901745,0.00021493899],"about_ca_topic_score_codex":0.0012628728,"about_ca_topic_score_gemma":0.0023190426,"teacher_disagreement_score":0.0027055368,"about_ca_system_score_codex":0.00022014933,"about_ca_system_score_gemma":0.00016432014,"threshold_uncertainty_score":0.009050965},"labels":[],"label_agreement":null},{"id":"W1533525130","doi":"10.1007/978-3-642-23623-5_37","title":"Towards Intra-operative Prostate Brachytherapy Dosimetry Based on Partial Seed Localization in Ultrasound and Registration to C-arm Fluoroscopy","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"BC Cancer Agency; Queen's University; University of British Columbia; University of British Columbia Hospital","funders":"Cancer Care Ontario; Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; DOD Prostate Cancer Research Program; Centre National de la Recherche Scientifique; Prostate Cancer Foundation","keywords":"Fluoroscopy; Imaging phantom; Ultrasound; Brachytherapy; Thresholding; Dosimetry; Prostate brachytherapy; Image registration; Medicine; Computer science; Nuclear medicine; Medical physics; Computer vision; Radiology; Radiation therapy; Image (mathematics)","score_opus":0.009771428598083068,"score_gpt":0.2815538278964255,"score_spread":0.27178239929834247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533525130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013628,0.00038887555,0.9836151,0.000099434044,0.000022311135,0.000035877834,0.00002623647,0.0009572766,0.0012269436],"genre_scores_gemma":[0.24321426,0.00053074455,0.75179005,0.00008413418,0.000025976356,0.00006132712,0.00016288496,0.00045206744,0.0036786157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999308,0.00022563731,0.0000383876,0.00009447623,0.00029792252,0.00003563213],"domain_scores_gemma":[0.9992489,0.00023681592,0.00009623557,0.00020131991,0.00017418018,0.000042509357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012119279,0.00067462376,0.0004941306,0.0006159387,0.0003207325,0.0013046664,0.0011588742,0.0009238511,0.0014473805],"category_scores_gemma":[0.0022224942,0.00081057264,0.0008836801,0.0006205855,0.0005842764,0.00070935366,0.0014727552,0.001095989,0.0012712779],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063516526,0.00013653022,0.0036939282,0.0004681131,0.00011527112,0.00015368537,0.0005938545,0.096861765,0.52492726,0.018064199,0.0022388948,0.3521114],"study_design_scores_gemma":[0.00005102096,0.00041833293,0.009602628,0.0001200238,0.00018914905,0.0009646,0.000120824494,0.6192785,0.34841403,0.00757962,0.013122098,0.00013921224],"about_ca_topic_score_codex":0.002251663,"about_ca_topic_score_gemma":0.0023625102,"teacher_disagreement_score":0.002251663,"about_ca_system_score_codex":0.0004521324,"about_ca_system_score_gemma":0.001099431,"threshold_uncertainty_score":0.006409347},"labels":[],"label_agreement":null},{"id":"W1533543580","doi":"10.1007/3-540-44651-6_23","title":"A Mobile Agent Prototype for Distributed Search","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Carleton University","funders":"","keywords":"Network topology; Computer science; Mobile agent; Distributed computing; Tree (set theory); Topology (electrical circuits); Computer network; Mathematics","score_opus":0.025090603561941465,"score_gpt":0.2685616929520547,"score_spread":0.24347108939011322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533543580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04412069,0.0007397624,0.85036063,0.00046895465,0.00041272023,0.00083003275,0.0006872032,0.073176436,0.02920353],"genre_scores_gemma":[0.25846055,0.0004393105,0.68270093,0.00028060676,0.00007814479,0.0009319648,0.0017014362,0.00372766,0.051679462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971193,0.00005646745,0.000025534315,0.000052455005,0.000114657305,0.000038943646],"domain_scores_gemma":[0.9994931,0.00017880702,0.000018581792,0.00010986918,0.00011214038,0.00008749899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004661048,0.0005802706,0.0007980593,0.00036313976,0.00068616326,0.001134323,0.0026442194,0.0012975297,0.016746847],"category_scores_gemma":[0.001571505,0.00054275116,0.0003762116,0.00036570764,0.00032707377,0.0016225947,0.0011180014,0.000992016,0.005477952],"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.0038865148,0.0016666633,0.0018882797,0.0011679599,0.00022168962,0.0012131734,0.0013487941,0.03258107,0.1396667,0.043094482,0.09210762,0.68115693],"study_design_scores_gemma":[0.002022808,0.0012202327,0.001217983,0.00013946962,0.00028473663,0.0015084856,0.00035475372,0.5816078,0.08794769,0.020462614,0.30306998,0.00016345724],"about_ca_topic_score_codex":0.001719617,"about_ca_topic_score_gemma":0.0020709145,"teacher_disagreement_score":0.016746847,"about_ca_system_score_codex":0.00029471482,"about_ca_system_score_gemma":0.00049630104,"threshold_uncertainty_score":0.056023777},"labels":[],"label_agreement":null},{"id":"W153355562","doi":"10.1007/978-3-319-14717-8_3","title":"Novel Concise Representations of High Utility Itemsets Using Generator Patterns","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":57,"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 Moncton","funders":"","keywords":"Generator (circuit theory); Computer science; Representation (politics); Set (abstract data type); Task (project management); Data mining; Theoretical computer science; Power (physics); Programming language; Engineering","score_opus":0.039064917401673456,"score_gpt":0.28872565386140603,"score_spread":0.24966073645973258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153355562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037982877,0.0010483307,0.95037454,0.00047625013,0.00017642039,0.00019615254,0.004099361,0.0022468483,0.0033991917],"genre_scores_gemma":[0.28916278,0.0013026767,0.6920719,0.00021953676,0.00019411594,0.00037889922,0.010725302,0.00033993827,0.0056048655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991165,0.0002152525,0.0001157579,0.0001497997,0.00033898026,0.00006375729],"domain_scores_gemma":[0.9968797,0.001526367,0.00038664645,0.0005827974,0.00052854454,0.00009591798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084140874,0.0009115257,0.0007151718,0.0027644155,0.00038567773,0.002106565,0.0012920437,0.00081509096,0.0044529475],"category_scores_gemma":[0.008258251,0.00042855678,0.00067478477,0.0041699316,0.00036015338,0.003324331,0.0012624761,0.0012063242,0.0013486929],"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.0007762331,0.00023998102,0.004931989,0.0008784054,0.00016043747,0.0014652205,0.00062035845,0.07470502,0.012458414,0.15778401,0.028352236,0.71762764],"study_design_scores_gemma":[0.00007739068,0.00021983904,0.0012880156,0.0002250835,0.00010645137,0.0013631481,0.0003101749,0.6914167,0.007155817,0.27717957,0.020607043,0.000050756855],"about_ca_topic_score_codex":0.0006212688,"about_ca_topic_score_gemma":0.0014329527,"teacher_disagreement_score":0.0044529475,"about_ca_system_score_codex":0.00037129998,"about_ca_system_score_gemma":0.00055204256,"threshold_uncertainty_score":0.014896572},"labels":[],"label_agreement":null},{"id":"W1533630040","doi":"10.1007/978-3-642-03364-3_43","title":"Pathfinding Strategy for Multiple Non-Playing Characters in 2.5 D Game Worlds","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Athabasca University","funders":"","keywords":"Pathfinding; Computer science; Computer graphics (images); Human–computer interaction; Theoretical computer science; Shortest path problem","score_opus":0.042652186438964776,"score_gpt":0.29013502451942447,"score_spread":0.24748283808045968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533630040","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.67809635,0.00015486586,0.280668,0.00028470543,0.00004419734,0.0001520238,0.00014092415,0.000523779,0.039935198],"genre_scores_gemma":[0.9273738,0.00007593585,0.062519066,0.0000222751,0.0000026676985,0.000072400195,0.00012756241,0.000040485837,0.00976594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998332,0.0000392822,0.0000099604185,0.00004839425,0.00002632239,0.000042728472],"domain_scores_gemma":[0.9996105,0.00020035426,0.0000323045,0.000027413284,0.000055048637,0.00007444841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021314021,0.0006511574,0.00043619837,0.0005213333,0.00066830893,0.0010462761,0.0008301475,0.0012070684,0.0050213286],"category_scores_gemma":[0.0013861108,0.00023632299,0.00034889864,0.00036248172,0.00045469048,0.001361131,0.0009486886,0.0004430155,0.000612343],"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.0027518352,0.00077392446,0.012381689,0.00060481916,0.00017318041,0.0030513767,0.0038690802,0.23296787,0.10486223,0.2646189,0.007902025,0.36604306],"study_design_scores_gemma":[0.00011958488,0.00051314424,0.002973823,0.000050489125,0.000065700064,0.00059790385,0.0016139895,0.9069818,0.010566168,0.07221714,0.004243829,0.00005629569],"about_ca_topic_score_codex":0.0040810346,"about_ca_topic_score_gemma":0.0048648748,"teacher_disagreement_score":0.0050213286,"about_ca_system_score_codex":0.00044090586,"about_ca_system_score_gemma":0.00070371124,"threshold_uncertainty_score":0.01679802},"labels":[],"label_agreement":null},{"id":"W1533704302","doi":"10.1007/978-3-642-10467-1_32","title":"Automatic Detection of Object of Interest and Tracking in Active Video","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Initialization; Computer vision; Video tracking; AdaBoost; Classifier (UML); Pattern recognition (psychology); Object detection; Salient; Object (grammar)","score_opus":0.03684155327446538,"score_gpt":0.29622404265613417,"score_spread":0.2593824893816688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533704302","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.025142448,0.0011657586,0.96968573,0.00004911372,0.0001274551,0.00004415813,0.00009923043,0.0010966511,0.0025893769],"genre_scores_gemma":[0.29212692,0.0017114049,0.6929374,0.00012612954,0.00015389209,0.00008234376,0.0006792647,0.00028493168,0.011897695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.000032094063,0.000015086664,0.00011739521,0.0001586492,0.000049941755],"domain_scores_gemma":[0.999361,0.00028706057,0.000055769935,0.00009373516,0.00016700015,0.000035471643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005900833,0.00060113455,0.00076451787,0.0014035692,0.00028011587,0.0010581692,0.0015407519,0.0011046602,0.0014983066],"category_scores_gemma":[0.0013252016,0.0005628845,0.0004949664,0.0009817288,0.00040487014,0.0011329105,0.0006853643,0.00063194684,0.0012003726],"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.00021616646,0.000114474635,0.00091759366,0.00017178354,0.000035862857,0.00012838622,0.00009769923,0.0071705296,0.1790914,0.004247495,0.0028910206,0.8049177],"study_design_scores_gemma":[0.000033890974,0.0002507569,0.0072456403,0.00006290782,0.000121966965,0.0014242389,0.00007759682,0.68905175,0.27799672,0.009462325,0.01421592,0.00005628661],"about_ca_topic_score_codex":0.0010157847,"about_ca_topic_score_gemma":0.0014769442,"teacher_disagreement_score":0.0015407519,"about_ca_system_score_codex":0.0002369091,"about_ca_system_score_gemma":0.0002396743,"threshold_uncertainty_score":0.0050123334},"labels":[],"label_agreement":null},{"id":"W1533716782","doi":"10.1007/978-3-540-28637-0_20","title":"Web Page Transformation When Switching Devices","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Transformation (genetics); World Wide Web","score_opus":0.01583395283593206,"score_gpt":0.23486221410478436,"score_spread":0.2190282612688523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533716782","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4161316,0.000709243,0.38885388,0.0011083825,0.0016387941,0.0006019096,0.0018239848,0.06708189,0.12205027],"genre_scores_gemma":[0.88368756,0.00029866458,0.06884689,0.00027677996,0.000111420755,0.00010665425,0.0019447095,0.004391633,0.040335562],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987663,0.00012861595,0.00007860711,0.00022498205,0.0005445966,0.00025698243],"domain_scores_gemma":[0.99574935,0.0013932849,0.00015643387,0.0019631134,0.0005488801,0.00018884325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006211714,0.00052399666,0.0005586455,0.0010255451,0.00061069126,0.0025190003,0.001108905,0.0010274339,0.02077595],"category_scores_gemma":[0.0064215064,0.00048640303,0.0005963956,0.0009777001,0.00060424616,0.003780731,0.0013245752,0.0010755274,0.004974987],"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.0027190081,0.0009640906,0.01027002,0.00049676595,0.00009007986,0.004103505,0.0012422613,0.0147831105,0.11264611,0.038967136,0.05682541,0.75689244],"study_design_scores_gemma":[0.00019506877,0.00053016545,0.013829744,0.00022361845,0.0002442358,0.003943853,0.0022586517,0.33361956,0.41050127,0.1063935,0.12811837,0.00014200815],"about_ca_topic_score_codex":0.0011191794,"about_ca_topic_score_gemma":0.0013666429,"teacher_disagreement_score":0.02077595,"about_ca_system_score_codex":0.00030287754,"about_ca_system_score_gemma":0.00045745895,"threshold_uncertainty_score":0.06950247},"labels":[],"label_agreement":null},{"id":"W1533782139","doi":"10.1007/978-3-642-12659-8_3","title":"Application of Parallel Processing to the Simulation of Heart Mechanics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Polygon mesh; Computational science; Computational fluid dynamics; Cluster (spacecraft); Algorithm; Parallel computing; Mechanics; Computer graphics (images); Physics","score_opus":0.015860667593832672,"score_gpt":0.2744582109178014,"score_spread":0.2585975433239688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533782139","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.0496291,0.0026938147,0.9092862,0.0009460829,0.0005366402,0.00009579861,0.00018847924,0.001419621,0.035204325],"genre_scores_gemma":[0.6152905,0.0026201163,0.37044242,0.00020003015,0.00023246165,0.00019192422,0.0001624403,0.00035901606,0.010501102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.000059199032,0.000010136718,0.000027614591,0.00006856201,0.000018128287],"domain_scores_gemma":[0.99948007,0.00033506058,0.000020115429,0.000064237276,0.000075469885,0.000025093717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038140026,0.0006268029,0.0008772747,0.00033075004,0.00058613176,0.0006773224,0.0011521752,0.00085020263,0.0033509012],"category_scores_gemma":[0.0015779057,0.00048252626,0.00058101467,0.0009099048,0.00057430455,0.0004344756,0.0007506132,0.0011031149,0.00051322096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008941011,0.000055621458,0.0004265349,0.000111913556,0.0000491746,0.00016590668,0.000075601834,0.9170973,0.003912899,0.027128529,0.0024023582,0.04848473],"study_design_scores_gemma":[0.000012594479,0.000011539963,0.000080019694,0.000004509454,0.000005801723,0.000028014352,0.000005348974,0.98279977,0.000964414,0.0143627245,0.0017213692,0.0000039787365],"about_ca_topic_score_codex":0.003810202,"about_ca_topic_score_gemma":0.002241233,"teacher_disagreement_score":0.003810202,"about_ca_system_score_codex":0.00042894503,"about_ca_system_score_gemma":0.00057349773,"threshold_uncertainty_score":0.011209905},"labels":[],"label_agreement":null},{"id":"W1533790548","doi":"10.1007/978-3-540-30189-9_7","title":"Dynamic Cell-Based MAC Protocol for Target Detection Applications in Energy-Constrained Wireless Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Node (physics); Computer network; Protocol (science); Energy consumption; Sensor node; Efficient energy use; Key distribution in wireless sensor networks; Scheme (mathematics); Wireless; Real-time computing; Wireless network; Telecommunications","score_opus":0.007631690858765008,"score_gpt":0.23541418425581925,"score_spread":0.22778249339705425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533790548","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.015662273,0.003609162,0.97199947,0.00028939164,0.0004576595,0.00008673756,0.00008423721,0.0009333075,0.006877753],"genre_scores_gemma":[0.65179074,0.006003323,0.3162038,0.00075099414,0.00040700487,0.0005790314,0.000668417,0.00023361862,0.023363106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997068,0.000061510305,0.000014846761,0.000038430913,0.00013487978,0.00004345815],"domain_scores_gemma":[0.9992822,0.0003342491,0.000034235527,0.00009274136,0.00022814795,0.000028509477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004489562,0.0005510495,0.0007876412,0.0004877167,0.0005402857,0.0009265697,0.0015966682,0.0006252707,0.002111771],"category_scores_gemma":[0.001189191,0.00022646652,0.00019344801,0.00089247955,0.00045805826,0.0008999569,0.0007708905,0.0012214262,0.0008470826],"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.0006017594,0.00028028133,0.00073620514,0.0003767715,0.000121942896,0.0003932335,0.00039534603,0.12749568,0.112666756,0.08095367,0.033576693,0.64240164],"study_design_scores_gemma":[0.000042177802,0.0002629948,0.00045091627,0.000042339165,0.00007144738,0.0006901299,0.00007455016,0.9209547,0.028423615,0.018802304,0.030130478,0.000054353783],"about_ca_topic_score_codex":0.00071952713,"about_ca_topic_score_gemma":0.0011898313,"teacher_disagreement_score":0.002111771,"about_ca_system_score_codex":0.00046400953,"about_ca_system_score_gemma":0.00042680392,"threshold_uncertainty_score":0.0070645213},"labels":[],"label_agreement":null},{"id":"W1533819011","doi":"10.1007/11736790_19","title":"Partial Predicate Argument Structure Matching for Entailment Determination","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Textual entailment; WordNet; Logical consequence; Computer science; Predicate (mathematical logic); Natural language processing; Argument (complex analysis); Artificial intelligence; Programming language","score_opus":0.010378289575054097,"score_gpt":0.26317349269816404,"score_spread":0.25279520312310994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533819011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008754089,0.00040044656,0.9742628,0.00028210963,0.00010329612,0.00018997525,0.00058451993,0.0047622332,0.010660545],"genre_scores_gemma":[0.16651233,0.00037685974,0.81895274,0.00022522669,0.00015544619,0.00023418484,0.002764925,0.0017711472,0.009007251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963791,0.0009561179,0.00034799532,0.000798789,0.0012081593,0.00030980346],"domain_scores_gemma":[0.99545515,0.0021510085,0.00015364903,0.0015589618,0.0006147632,0.0000663312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027508435,0.0007564058,0.0016537255,0.002457605,0.0014207357,0.0030371693,0.0032920141,0.0022415442,0.02298578],"category_scores_gemma":[0.010116908,0.0014667581,0.0022208486,0.0033992734,0.001442153,0.009981468,0.003640315,0.0026146115,0.007337552],"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.00043758584,0.000234374,0.0005961747,0.0006142461,0.00011983577,0.00023658907,0.00046489976,0.007366052,0.011177275,0.39826107,0.020015297,0.56047654],"study_design_scores_gemma":[0.000073703195,0.000073663,0.0003469542,0.00013719707,0.00014391998,0.0003018821,0.0001460855,0.14296305,0.028513126,0.7965069,0.030730814,0.000062739164],"about_ca_topic_score_codex":0.0014705712,"about_ca_topic_score_gemma":0.0020086286,"teacher_disagreement_score":0.02298578,"about_ca_system_score_codex":0.0011734617,"about_ca_system_score_gemma":0.0015232111,"threshold_uncertainty_score":0.07689512},"labels":[],"label_agreement":null},{"id":"W1533840006","doi":"10.1007/978-3-540-24664-0_26","title":"Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Integer programming; Constraint programming; Constraint (computer-aided design); Routing (electronic design automation); Mathematical optimization; Linear programming; Parallel computing; Theoretical computer science; Algorithm; Embedded system; Mathematics; Stochastic programming","score_opus":0.020408232098208974,"score_gpt":0.2582533827822211,"score_spread":0.23784515068401213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533840006","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.0068668346,0.00041658574,0.9876858,0.00014950932,0.00006698687,0.000060082268,0.00007483944,0.00014586971,0.0045335134],"genre_scores_gemma":[0.23005567,0.000931031,0.75652,0.0001308042,0.00013288001,0.00035583455,0.00024876586,0.00030639203,0.011318691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.00032760482,0.00004092895,0.000113824004,0.0002879183,0.00009214796],"domain_scores_gemma":[0.9989404,0.00073164294,0.000089018475,0.00006219857,0.00013511689,0.00004152365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011973566,0.0015816718,0.0016835588,0.0010075421,0.00085334206,0.002620814,0.0028688142,0.0018866243,0.0037871515],"category_scores_gemma":[0.0025543165,0.0014821056,0.001462525,0.0024975534,0.000835847,0.002408395,0.0010559608,0.0017169833,0.00038550587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040841936,0.000034194658,0.00008097083,0.00008107785,0.000028010485,0.000045139448,0.000037489714,0.94960004,0.0008908236,0.018236795,0.000996448,0.029928077],"study_design_scores_gemma":[0.000005204532,0.000007743246,0.000018864215,0.000005142014,0.000005394538,0.000007957753,0.0000064690025,0.9925328,0.00028512094,0.0064642304,0.00065651373,0.000004526306],"about_ca_topic_score_codex":0.009907756,"about_ca_topic_score_gemma":0.01052204,"teacher_disagreement_score":0.009907756,"about_ca_system_score_codex":0.0012466421,"about_ca_system_score_gemma":0.0019523351,"threshold_uncertainty_score":0.01970017},"labels":[],"label_agreement":null},{"id":"W1533886078","doi":"10.1007/978-3-540-74553-2_1","title":"A Hilbert Space Compression Architecture for Data Warehouse Environments","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Computer science; Tuple; Data warehouse; Relational database; Compression (physics); Data compression; Exploit; Data mining; Database; Memory footprint; Volume (thermodynamics); Hilbert curve; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.04023864711103215,"score_gpt":0.2834590318157358,"score_spread":0.24322038470470364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533886078","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.01712398,0.0007324604,0.9638306,0.00040971072,0.00010670563,0.000084161526,0.00029996195,0.014398579,0.0030138409],"genre_scores_gemma":[0.29105347,0.0008082762,0.6914457,0.00057449465,0.00022207604,0.00024370739,0.002035669,0.00088764494,0.012728979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937326,0.0001066877,0.000058469188,0.000081761,0.0003025727,0.00007723506],"domain_scores_gemma":[0.9991704,0.00015350014,0.00003371352,0.00031499696,0.0002741992,0.00005323188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078767195,0.000584981,0.0006882813,0.0010048127,0.0006378915,0.0016657462,0.0026303476,0.00078692543,0.006739651],"category_scores_gemma":[0.0016658384,0.00046158602,0.00047832006,0.0021460587,0.00065374986,0.0040384745,0.0021195374,0.0011826656,0.0023351682],"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.0011441926,0.0003275295,0.0012489675,0.0002589023,0.00011614405,0.00022434413,0.00036931224,0.049590558,0.04190455,0.086134836,0.0448703,0.77381027],"study_design_scores_gemma":[0.00012465726,0.00030461434,0.00065615907,0.00004442202,0.000093509036,0.00036930604,0.00013841489,0.8125742,0.05941807,0.097207434,0.02897843,0.00009085005],"about_ca_topic_score_codex":0.0025746978,"about_ca_topic_score_gemma":0.0027798142,"teacher_disagreement_score":0.006739651,"about_ca_system_score_codex":0.0007738475,"about_ca_system_score_gemma":0.00095263415,"threshold_uncertainty_score":0.022546351},"labels":[],"label_agreement":null},{"id":"W1533914434","doi":"10.1007/978-3-540-72982-2_25","title":"Bridging Concrete and Abstract Syntax of Web Rule Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Athabasca University","funders":"","keywords":"RuleML; Computer science; Abstract syntax; Syntax; Programming language; Abstract syntax tree; Syntax error; Semantic Web Rule Language; XML; Natural language processing; Word grammar; XML Schema (W3C); Generalized phrase structure grammar; Markup language; Linguistics; Artificial intelligence; XHTML; Document Structure Description; Web service; World Wide Web; Emergent grammar; Relational grammar; Web standards; Generative grammar; Document type definition","score_opus":0.014368525213405982,"score_gpt":0.25458380631534777,"score_spread":0.2402152811019418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533914434","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.010839987,0.00039845728,0.979521,0.00045176814,0.00010304995,0.00004604597,0.00013115739,0.0017900047,0.0067185443],"genre_scores_gemma":[0.24078979,0.0009974864,0.7468054,0.00045097584,0.00017634963,0.00020526249,0.00085037976,0.0018960872,0.007828166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952408,0.0014759393,0.00087684015,0.0004935877,0.0016206915,0.00029217845],"domain_scores_gemma":[0.99028826,0.006038786,0.00046196883,0.0018911626,0.0010545186,0.0002653408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045513147,0.00054340437,0.0010188435,0.0014439251,0.00085825345,0.0071902294,0.0024290045,0.0018415082,0.004087472],"category_scores_gemma":[0.013058539,0.0016219629,0.0010613701,0.00146938,0.0036408752,0.011134623,0.0032872343,0.004913526,0.0017186947],"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.0000952232,0.00004206101,0.00038036463,0.00024322867,0.000023030721,0.0002959473,0.0016204895,0.0057574753,0.0060786474,0.8994307,0.0027536433,0.0832792],"study_design_scores_gemma":[0.000037599206,0.000032948632,0.00020260083,0.00021154025,0.00005518662,0.00038347315,0.0002372738,0.06490519,0.011494544,0.8815217,0.04086802,0.000049941904],"about_ca_topic_score_codex":0.0009805005,"about_ca_topic_score_gemma":0.0012795994,"teacher_disagreement_score":0.0071902294,"about_ca_system_score_codex":0.0007542447,"about_ca_system_score_gemma":0.0015707667,"threshold_uncertainty_score":0.024069965},"labels":[],"label_agreement":null},{"id":"W1533933130","doi":"10.1007/3-540-44886-1_14","title":"A Comparison of Consistency Propagation Algorithms in Constraint Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Saskatchewan","funders":"","keywords":"Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Heuristic; Algorithm; Computer science; Mathematical optimization; Arc (geometry); Constraint satisfaction problem; Mathematics; Artificial intelligence","score_opus":0.02290560349101612,"score_gpt":0.27194775385489783,"score_spread":0.24904215036388172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533933130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0133255,0.0069347806,0.9582981,0.000714791,0.0004351131,0.00035817633,0.00041540113,0.0023990108,0.017119167],"genre_scores_gemma":[0.08381645,0.0053699156,0.902855,0.00033900043,0.0002136834,0.00032630574,0.0011609874,0.001374385,0.004544279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909366,0.0035301687,0.0005964581,0.00078867894,0.0036767612,0.00047141666],"domain_scores_gemma":[0.95595986,0.032745916,0.00089393137,0.004794645,0.0051373662,0.00046823404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010351491,0.0020431108,0.0026798858,0.0041777063,0.0013898112,0.004856666,0.0053075156,0.0028446945,0.010268423],"category_scores_gemma":[0.03885174,0.0012286796,0.0020303687,0.011134932,0.0014849593,0.009712942,0.0031507725,0.0039739097,0.0018491396],"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.0010733432,0.0005578687,0.0011051818,0.0008618877,0.00031283064,0.00003694635,0.00021339199,0.117136665,0.0011283098,0.07465128,0.012272398,0.79064995],"study_design_scores_gemma":[0.00028840528,0.00028606484,0.001478132,0.00025121853,0.00025511457,0.0001636465,0.00026591422,0.8916582,0.004403667,0.086843096,0.014029545,0.00007703083],"about_ca_topic_score_codex":0.008891818,"about_ca_topic_score_gemma":0.011016625,"teacher_disagreement_score":0.010351491,"about_ca_system_score_codex":0.0023501138,"about_ca_system_score_gemma":0.004623767,"threshold_uncertainty_score":0.0547446},"labels":[],"label_agreement":null},{"id":"W1533986179","doi":"10.1007/978-3-642-14932-0_17","title":"A New Hierarchical Key Frame Tree-Based Video Representation Method Using Independent Component Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Key frame; Computer science; Artificial intelligence; Key (lock); Computer vision; Frame (networking); Tree structure; Tree (set theory); Video compression picture types; Reference frame; Representation (politics); Video tracking; Video processing; Component (thermodynamics); Pattern recognition (psychology); Feature (linguistics); Cluster analysis; Shot (pellet); Algorithm; Mathematics; Binary tree","score_opus":0.02443334668192619,"score_gpt":0.297231018180797,"score_spread":0.2727976714988708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533986179","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.0009395726,0.00015855665,0.99725217,0.000023116867,0.000054023156,0.000044971064,0.0000890191,0.00110336,0.00033514338],"genre_scores_gemma":[0.01515259,0.0003628577,0.98107874,0.00004607441,0.000065637614,0.0001629313,0.0006609091,0.00029628238,0.002173925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991048,0.00012175573,0.00005249349,0.0002175722,0.00043447886,0.00006878405],"domain_scores_gemma":[0.9991928,0.0001578708,0.000047715817,0.00008023671,0.00047585828,0.000045485438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000592149,0.0014463706,0.001694446,0.0028758405,0.0006455145,0.0012297485,0.0019401088,0.0009145514,0.004883512],"category_scores_gemma":[0.0015441754,0.0005843677,0.0013529602,0.003366427,0.00035129907,0.0018916567,0.0009742541,0.0014622409,0.0038309526],"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.00019874034,0.000083343766,0.00017526082,0.00016060505,0.00008775405,0.000048260797,0.000048569873,0.00782246,0.04602065,0.002438329,0.0074718604,0.9354442],"study_design_scores_gemma":[0.00004942407,0.0001561242,0.0012575787,0.000032445972,0.00018759164,0.00026785908,0.00006211014,0.9310422,0.04719267,0.003521868,0.016145675,0.00008441728],"about_ca_topic_score_codex":0.0063041463,"about_ca_topic_score_gemma":0.0071604494,"teacher_disagreement_score":0.0063041463,"about_ca_system_score_codex":0.00047390175,"about_ca_system_score_gemma":0.0011338406,"threshold_uncertainty_score":0.016336918},"labels":[],"label_agreement":null},{"id":"W1534080899","doi":"10.1007/978-3-540-24659-6_18","title":"Intelligent Support for Software Release Planning","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Process (computing); Software; Software release life cycle; Baseline (sea); Process management; Software engineering; Software development process; Decision support system; Software development; Software quality; Artificial intelligence; Engineering","score_opus":0.027781757330478427,"score_gpt":0.28376890796230636,"score_spread":0.2559871506318279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534080899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023265185,0.00087370374,0.9337951,0.0004134309,0.00009573186,0.00008353522,0.00019865201,0.013791819,0.027482808],"genre_scores_gemma":[0.4573504,0.00081420515,0.5229575,0.00014721566,0.00013818596,0.000108258995,0.0007453568,0.00089053676,0.016848372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937326,0.00015751821,0.00005349769,0.00010369422,0.00024000066,0.0000720513],"domain_scores_gemma":[0.9974643,0.0012604282,0.00023055231,0.00073150964,0.00021384818,0.0000993634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010078648,0.0005951548,0.00045075,0.00066084886,0.00046493424,0.0015894657,0.0016462706,0.00065368286,0.008520591],"category_scores_gemma":[0.004332658,0.000523592,0.00041972753,0.0006213022,0.00033789163,0.0020825802,0.0011069261,0.0009927006,0.003352668],"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.00066773914,0.00027807726,0.0011613136,0.00032592344,0.00005636459,0.0003955614,0.00052771607,0.03648037,0.028008949,0.04577515,0.021778407,0.8645445],"study_design_scores_gemma":[0.00016767626,0.00027381483,0.0014399604,0.0001261005,0.00014133767,0.00073353254,0.00016864907,0.7509912,0.04170698,0.10304201,0.101132445,0.000076330645],"about_ca_topic_score_codex":0.0006043458,"about_ca_topic_score_gemma":0.0013528481,"teacher_disagreement_score":0.008520591,"about_ca_system_score_codex":0.00020613612,"about_ca_system_score_gemma":0.000415239,"threshold_uncertainty_score":0.028504252},"labels":[],"label_agreement":null},{"id":"W1534140321","doi":"10.1007/3-540-36388-2_12","title":"Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Computer science; Heuristics; Set (abstract data type); Extant taxon; Solver; Genetic programming; Phylogenetic tree; Tree (set theory); Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Combinatorics; Evolutionary biology","score_opus":0.03310432674882285,"score_gpt":0.24182502912031723,"score_spread":0.20872070237149437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534140321","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.65577525,0.0027041144,0.24271722,0.0052339574,0.00014438003,0.00006726747,0.0014583645,0.0008054768,0.09109391],"genre_scores_gemma":[0.91834974,0.000758161,0.07433152,0.00021310664,0.000041451884,0.000039879473,0.0009756199,0.0003973277,0.004893144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939084,0.00026388981,0.000033375298,0.00014642102,0.00007080182,0.00009469452],"domain_scores_gemma":[0.9974119,0.0015290518,0.00025855968,0.00037643325,0.0003098343,0.00011414636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015245767,0.00037323838,0.00034990849,0.0024740961,0.0014241821,0.0032541521,0.0012177873,0.0009903074,0.0077887564],"category_scores_gemma":[0.007245361,0.00051856466,0.0006134482,0.0034318424,0.0023767406,0.00652406,0.0018849326,0.0020574958,0.00064635696],"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.00030467595,0.0001000875,0.024703985,0.00022824857,0.00012097925,0.0007531704,0.006844735,0.032708257,0.0031939617,0.76301616,0.0046725734,0.16335335],"study_design_scores_gemma":[0.00006540988,0.000046748642,0.022897853,0.0002555447,0.00012033803,0.0005929598,0.004613321,0.095986284,0.0024304234,0.8163388,0.0565733,0.000079168596],"about_ca_topic_score_codex":0.005949211,"about_ca_topic_score_gemma":0.010472841,"teacher_disagreement_score":0.0077887564,"about_ca_system_score_codex":0.0017523742,"about_ca_system_score_gemma":0.0008602791,"threshold_uncertainty_score":0.026055932},"labels":[],"label_agreement":null},{"id":"W1534184292","doi":"10.1007/3-540-45372-5_31","title":"Algorithms for Mining Share Frequent Itemsets Containing Infrequent Subsets","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Measure (data warehouse); Heuristic; Database transaction; Closure (psychology); Data mining; Algorithm; Artificial intelligence; Database","score_opus":0.0348531844896007,"score_gpt":0.2800269790353039,"score_spread":0.24517379454570318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534184292","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.024775347,0.0016163306,0.9686441,0.000312041,0.00015633469,0.000433694,0.00080982636,0.0018045139,0.0014478356],"genre_scores_gemma":[0.09129159,0.001170161,0.8988123,0.00022466178,0.000389793,0.00072397914,0.004543299,0.00015775124,0.0026864326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743575,0.00036427728,0.00038108235,0.00050824264,0.0011628392,0.00014775709],"domain_scores_gemma":[0.9885833,0.006997921,0.0007733662,0.0018726835,0.0015329556,0.00023982547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038721638,0.001912988,0.003229318,0.0055719484,0.0015540761,0.0033385998,0.004405543,0.002541672,0.004653104],"category_scores_gemma":[0.014036143,0.0012976051,0.0021262455,0.009349785,0.0009223265,0.007180994,0.0026249506,0.0018684639,0.002863848],"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.000814543,0.00057112525,0.005453404,0.00061853736,0.00036995896,0.00027417866,0.00021737858,0.025725005,0.0048979474,0.01386671,0.00890245,0.93828875],"study_design_scores_gemma":[0.0005091652,0.0008089789,0.003420981,0.00017950317,0.0005219782,0.0023030515,0.00048112773,0.8484389,0.011795909,0.118089534,0.01336498,0.00008593032],"about_ca_topic_score_codex":0.00051682396,"about_ca_topic_score_gemma":0.0012101561,"teacher_disagreement_score":0.0055719484,"about_ca_system_score_codex":0.0006350693,"about_ca_system_score_gemma":0.0011316976,"threshold_uncertainty_score":0.020478249},"labels":[],"label_agreement":null},{"id":"W1534189005","doi":"10.1007/11427445_115","title":"Adaptive Constructive Neural Networks Using Hermite Polynomials for Image Compression","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Hermite polynomials; Constructive; Image compression; Artificial neural network; Artificial intelligence; Data compression; Image (mathematics); Computer vision; Algorithm; Image processing; Mathematics; Pure mathematics; Programming language","score_opus":0.02542618094314895,"score_gpt":0.2912761856900123,"score_spread":0.2658500047468633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534189005","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.0111243855,0.0005163026,0.9851597,0.00007587036,0.00006399377,0.000012774049,0.0000119836395,0.00023503554,0.0028000928],"genre_scores_gemma":[0.46053734,0.0012980831,0.5265622,0.00017412008,0.00017657976,0.000078403595,0.000072994444,0.00013092131,0.010969346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998356,0.000045802262,0.0000063277416,0.00002364821,0.000069887756,0.000018726267],"domain_scores_gemma":[0.9995432,0.0002866292,0.000026770249,0.000042380423,0.00008934171,0.000011653227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003669114,0.00043151283,0.00038157575,0.00031445234,0.0002049944,0.000489219,0.0006662799,0.0006462732,0.0019610259],"category_scores_gemma":[0.0012071598,0.00026226658,0.00032941575,0.00058839144,0.00047409986,0.00085587206,0.0005308307,0.0011744088,0.00044111957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016540573,0.00012464689,0.00024063396,0.00014448843,0.0000615551,0.000090551875,0.00007294661,0.43696302,0.06543077,0.07141478,0.0024982572,0.42279294],"study_design_scores_gemma":[0.000004450152,0.000022066282,0.000043490905,0.0000044638136,0.0000072739676,0.00003389079,0.0000044463004,0.9878037,0.0068721883,0.0045105093,0.00068740395,0.0000060819643],"about_ca_topic_score_codex":0.0006192452,"about_ca_topic_score_gemma":0.0016072409,"teacher_disagreement_score":0.0019610259,"about_ca_system_score_codex":0.00036208262,"about_ca_system_score_gemma":0.00023980504,"threshold_uncertainty_score":0.006560266},"labels":[],"label_agreement":null},{"id":"W1534270595","doi":"10.1007/978-3-642-13437-1_47","title":"Showing the Positive Influence of Subliminal Cues on Learner’s Performance and Intuition: An ERP Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroscience, Education and Cognitive Function","field":"Neuroscience","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é de Montréal","funders":"","keywords":"Subliminal stimuli; Computer science; Intuition; Cognitive psychology; Cognition; Psychology; Cognitive science; Neuroscience","score_opus":0.031399705332407324,"score_gpt":0.2774516674172655,"score_spread":0.2460519620848582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534270595","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.99504143,0.00013359514,0.0014494937,0.00005074202,0.000023695731,0.000018984898,0.00005390437,0.000024042847,0.0032041527],"genre_scores_gemma":[0.99792165,0.000104158935,0.0008410982,0.00006872507,0.000018444765,0.00002135863,0.000042263357,0.00003572125,0.0009465216],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977046,0.000053831405,0.000010726076,0.00006937184,0.0000703943,0.000025212858],"domain_scores_gemma":[0.99691135,0.0025628633,0.00015548359,0.0001377695,0.00011238329,0.00012013306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047227897,0.0002268071,0.0002063355,0.00014449886,0.00015885585,0.0005702546,0.00033941114,0.00051280454,0.0062812287],"category_scores_gemma":[0.0058168536,0.00019004186,0.00016509158,0.00017367394,0.0005856027,0.0006293062,0.00048677408,0.0007501174,0.0005143787],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007697188,0.0016056673,0.012275463,0.00057427725,0.000104167775,0.00081073545,0.0047456967,0.0003995782,0.9066565,0.0012938872,0.0009691627,0.06286763],"study_design_scores_gemma":[0.00086345454,0.012069016,0.6866306,0.00011273713,0.00048738334,0.0038730542,0.0034310005,0.007024122,0.274875,0.005640091,0.0048721004,0.00012141525],"about_ca_topic_score_codex":0.00028758304,"about_ca_topic_score_gemma":0.00017466121,"teacher_disagreement_score":0.0062812287,"about_ca_system_score_codex":0.00007364933,"about_ca_system_score_gemma":0.00015826333,"threshold_uncertainty_score":0.021012783},"labels":[],"label_agreement":null},{"id":"W1534329287","doi":"10.1007/978-3-540-77120-3_58","title":"An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning 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":"Carleton University","funders":"","keywords":"Shortest path problem; Plane (geometry); Path (computing); Algorithm; Combinatorics; Computer science; Mathematics; Geometry; Graph","score_opus":0.024346348618276583,"score_gpt":0.278317481065577,"score_spread":0.25397113244730046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534329287","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.03622855,0.0010569091,0.94302595,0.0005859461,0.00016565066,0.00033145602,0.0009391007,0.0049027572,0.01276372],"genre_scores_gemma":[0.0685985,0.00034604955,0.925154,0.00009322462,0.00004142416,0.00027595845,0.0013003211,0.00028639476,0.0039041266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.00008581413,0.000051224706,0.00018288498,0.0002241613,0.0001049158],"domain_scores_gemma":[0.99865425,0.00076948694,0.00010052855,0.00024879017,0.00013412931,0.00009282381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006146251,0.0015915645,0.0014188923,0.0015790904,0.0009961445,0.0019690993,0.002894073,0.0014011754,0.011688778],"category_scores_gemma":[0.003552364,0.0007284394,0.0010551423,0.0029716005,0.00087460806,0.0035943012,0.0026196775,0.0016148177,0.00231638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007261904,0.0002302584,0.0010103981,0.00089343655,0.000093077964,0.0001386781,0.00034149393,0.10541532,0.010955187,0.032231744,0.029042726,0.8189215],"study_design_scores_gemma":[0.0004769138,0.00029407145,0.0009236627,0.000098278746,0.000090823145,0.0003565575,0.0002733396,0.8512273,0.0083030965,0.11808401,0.01981862,0.000053321237],"about_ca_topic_score_codex":0.005256973,"about_ca_topic_score_gemma":0.009031394,"teacher_disagreement_score":0.011688778,"about_ca_system_score_codex":0.0016675981,"about_ca_system_score_gemma":0.0014765117,"threshold_uncertainty_score":0.039102852},"labels":[],"label_agreement":null},{"id":"W1534377188","doi":"10.1007/11575863_118","title":"Translating XML Web Data into Ontologies","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XML Schema Editor; XML validation; Efficient XML Interchange; Document Structure Description; Information retrieval; Streaming XML; XML Schema (W3C); XML Encryption; XML database; Ontology; World Wide Web; XML","score_opus":0.04778795401396722,"score_gpt":0.2872209578885985,"score_spread":0.23943300387463132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534377188","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.011513629,0.0007461457,0.9249146,0.0014944284,0.0007444789,0.00021924681,0.00231606,0.010046935,0.04800446],"genre_scores_gemma":[0.095744014,0.0031075017,0.8214888,0.00097423745,0.00020038059,0.0002986861,0.016447041,0.006335517,0.055403825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931014,0.00015058207,0.00010003015,0.00011992702,0.0002769747,0.00004234816],"domain_scores_gemma":[0.99889034,0.0005958148,0.000041256437,0.00025191755,0.00019949178,0.000021296906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677081,0.0006107754,0.0004973341,0.001957599,0.0005518892,0.0036690333,0.001048695,0.0009080924,0.009959708],"category_scores_gemma":[0.0042765895,0.000881862,0.0009752826,0.0028923578,0.0008189736,0.0044521103,0.0021584374,0.0017227058,0.006235728],"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.00011152765,0.00021467717,0.0007134329,0.00083099026,0.00009407633,0.0013013505,0.0022688024,0.013389337,0.01693964,0.3943406,0.0595133,0.5102823],"study_design_scores_gemma":[0.000050353257,0.000038898812,0.00060739095,0.00048629617,0.000121201054,0.0008253572,0.0010276841,0.06328275,0.07037978,0.28968495,0.57342696,0.000068440924],"about_ca_topic_score_codex":0.0023787958,"about_ca_topic_score_gemma":0.002408443,"teacher_disagreement_score":0.009959708,"about_ca_system_score_codex":0.000769591,"about_ca_system_score_gemma":0.00080263097,"threshold_uncertainty_score":0.03331852},"labels":[],"label_agreement":null},{"id":"W1534378969","doi":"10.1007/978-3-540-85990-1_77","title":"Virtual Reality-Enhanced Ultrasound Guidance for Atrial Ablation: In vitro Epicardial Study","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac Arrhythmias and Treatments","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Ablation; Visualization; Imaging phantom; Ultrasound; Virtual reality; Cardiac Ablation; Computer science; Perspective (graphical); Augmented reality; Medicine; Biomedical engineering; Medical physics; Radiology; Computer vision; Artificial intelligence; Catheter ablation; Cardiology","score_opus":0.02254394764058769,"score_gpt":0.3047640881526105,"score_spread":0.2822201405120228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534378969","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.9611459,0.0026212663,0.0342008,0.00007094381,0.000053742486,0.000080115184,0.00010056345,0.000043162716,0.0016835292],"genre_scores_gemma":[0.9876171,0.0009818091,0.01030206,0.000048570986,0.000028665192,0.000055837456,0.0000843842,0.000017293269,0.0008643414],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989814,0.00064303644,0.000044769244,0.000096562224,0.00013364607,0.000100569065],"domain_scores_gemma":[0.99726653,0.002048893,0.0001360495,0.00027609873,0.00016327419,0.00010928788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013468247,0.00044645704,0.00050686585,0.0004124799,0.0002475586,0.00062339753,0.00071786216,0.0009943453,0.0015803966],"category_scores_gemma":[0.0024139257,0.00044555275,0.00051783683,0.00030004798,0.0008972581,0.00059596886,0.0005912007,0.00047437858,0.0002931623],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042199376,0.002294334,0.0034570813,0.00066874386,0.00014255906,0.0019394576,0.0016642716,0.015831342,0.9361405,0.0012842832,0.00047073283,0.0318868],"study_design_scores_gemma":[0.0016166444,0.06347043,0.108798675,0.00029495746,0.0012043937,0.019711588,0.0028632882,0.21952333,0.5684444,0.0028599617,0.01076914,0.00044327686],"about_ca_topic_score_codex":0.0015397435,"about_ca_topic_score_gemma":0.000990648,"teacher_disagreement_score":0.0015803966,"about_ca_system_score_codex":0.00015875317,"about_ca_system_score_gemma":0.00024803137,"threshold_uncertainty_score":0.007122755},"labels":[],"label_agreement":null},{"id":"W1534468029","doi":"10.1007/3-540-45831-x_3","title":"A Novel Approach to Proactive Password Checking","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Password; Computer science; Byte; Password strength; Computer security; One-time password; Artificial neural network; Scheme (mathematics); Artificial intelligence; Programming language","score_opus":0.03914453200605596,"score_gpt":0.24638015709025812,"score_spread":0.20723562508420218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534468029","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.0030660816,0.00015995665,0.98098344,0.000338414,0.00028873535,0.00016226749,0.000069196634,0.0034281795,0.011503735],"genre_scores_gemma":[0.17805624,0.00038782958,0.77050066,0.00076435826,0.00041510322,0.00037459683,0.00027730796,0.0006892003,0.048534717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964619,0.00050104316,0.00015650193,0.00082510884,0.0017199321,0.00033554353],"domain_scores_gemma":[0.99509853,0.0009812355,0.00021708138,0.0026499361,0.00082546484,0.00022771534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011309233,0.0010771223,0.0012023664,0.0017519881,0.0020388113,0.003407603,0.0046883286,0.0023704432,0.01143489],"category_scores_gemma":[0.004845842,0.00078988477,0.0011801949,0.0014387716,0.0021216564,0.006160651,0.0068384325,0.0033668221,0.0062594],"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.00036216227,0.0005756824,0.0006365718,0.00022354,0.00009314304,0.0003796409,0.00062833703,0.007966688,0.043370724,0.40723023,0.029234685,0.50929856],"study_design_scores_gemma":[0.00014872817,0.00032085713,0.00055955886,0.00008804755,0.00021896345,0.0023734858,0.00029367453,0.46062338,0.0626475,0.3700932,0.10244013,0.00019244122],"about_ca_topic_score_codex":0.0010962553,"about_ca_topic_score_gemma":0.0017911181,"teacher_disagreement_score":0.01143489,"about_ca_system_score_codex":0.00074390735,"about_ca_system_score_gemma":0.0017772297,"threshold_uncertainty_score":0.038253486},"labels":[],"label_agreement":null},{"id":"W1534539971","doi":"10.1007/978-3-642-01181-8_1","title":"One-Class Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Novelty detection; Class (philosophy); Computer science; Genetic programming; Artificial intelligence; One-class classification; Fitness function; Novelty; Machine learning; Scalability; Function (biology); Construct (python library); Genetic algorithm; Pattern recognition (psychology); Data mining; Support vector machine; Programming language; Database","score_opus":0.01691058351238581,"score_gpt":0.24296360388241453,"score_spread":0.22605302037002872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534539971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005237713,0.0011550309,0.74983793,0.0007716253,0.00062030344,0.00007328095,0.00010884655,0.0007289498,0.24146621],"genre_scores_gemma":[0.2265766,0.0034637798,0.5096745,0.0008962702,0.0005112427,0.00035894444,0.00048559988,0.00096942077,0.25706366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966323,0.000064644126,0.000011526584,0.00008119471,0.00013921247,0.000040150047],"domain_scores_gemma":[0.99974877,0.00010638859,0.000014593964,0.000062118976,0.000045260316,0.00002294412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036762285,0.00066070684,0.00060188153,0.0005827361,0.0007355094,0.00165912,0.001318943,0.0010903992,0.017745564],"category_scores_gemma":[0.0012822156,0.00025725723,0.0007757989,0.00083801453,0.0012593276,0.001377854,0.0012775729,0.002276579,0.003620318],"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.000015389296,0.000035947684,0.000078803976,0.00012458861,0.000015038425,0.000032133874,0.00007327231,0.012113759,0.0013244554,0.7669916,0.008017442,0.21117754],"study_design_scores_gemma":[0.00002203333,0.000043407574,0.00015171335,0.00012003106,0.000021422891,0.00021774502,0.000035440156,0.06271313,0.002676266,0.8296583,0.10431674,0.000023724198],"about_ca_topic_score_codex":0.00046073744,"about_ca_topic_score_gemma":0.00059705303,"teacher_disagreement_score":0.017745564,"about_ca_system_score_codex":0.000974547,"about_ca_system_score_gemma":0.0006681567,"threshold_uncertainty_score":0.059364796},"labels":[],"label_agreement":null},{"id":"W1534565616","doi":"10.1007/978-3-540-28647-9_27","title":"Genetically Optimized Self-Organizing Neural Networks Based on PNs and FPNs","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Artificial neural network; Perceptron; Polynomial; Computer science; Fuzzy logic; Multilayer perceptron; Selection (genetic algorithm); Neuro-fuzzy; Genetic algorithm; Biological neuron model; Artificial intelligence; Mathematics; Fuzzy control system; Machine learning","score_opus":0.009021977873851224,"score_gpt":0.20008191604395065,"score_spread":0.19105993817009942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534565616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1320828,0.00078715093,0.8510828,0.00023966872,0.00023569237,0.00007862112,0.00007142959,0.00071879954,0.014703083],"genre_scores_gemma":[0.8191544,0.00038636397,0.17429453,0.00008418516,0.000052206833,0.00015372681,0.00008650186,0.000061093226,0.005726887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998944,0.000023987757,0.0000051834236,0.000026357058,0.000030759384,0.000019407695],"domain_scores_gemma":[0.9997347,0.000107492604,0.000033962133,0.000021982603,0.00008335015,0.000018592966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038254893,0.00040610824,0.00062061986,0.00035478338,0.0003443338,0.0005743883,0.0010064427,0.00075223803,0.0012439005],"category_scores_gemma":[0.0011558083,0.00032448812,0.00042405573,0.00040877546,0.00050728756,0.00059714046,0.00043230806,0.00061073026,0.00024963348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032938315,0.000021037964,0.00028439006,0.00002875159,0.000020926067,0.00003908788,0.000022467098,0.9582943,0.0031345594,0.0065496103,0.00044621824,0.031125635],"study_design_scores_gemma":[0.000005525692,0.0000182559,0.00009545195,0.0000033016408,0.000006333878,0.00001435444,0.000003450198,0.9968131,0.0005994554,0.0021905126,0.000245849,0.0000043283517],"about_ca_topic_score_codex":0.004020314,"about_ca_topic_score_gemma":0.004042274,"teacher_disagreement_score":0.004020314,"about_ca_system_score_codex":0.00068410253,"about_ca_system_score_gemma":0.0005595557,"threshold_uncertainty_score":0.007993817},"labels":[],"label_agreement":null},{"id":"W1534640868","doi":"10.1007/978-3-642-02879-3_11","title":"Slicing through the Scientific Literature","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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 New Brunswick","funders":"","keywords":"Computer science; Information retrieval; Syntax; Knowledge base; Domain (mathematical analysis); Knowledge representation and reasoning; Scientific literature; Representation (politics); Natural language; Slicing; World Wide Web; Natural language processing; Artificial intelligence","score_opus":0.015981989477162412,"score_gpt":0.26467784056824145,"score_spread":0.24869585109107903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534640868","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.023540962,0.014081856,0.90922004,0.0047740135,0.0011001283,0.00053447427,0.008833409,0.00844337,0.029471777],"genre_scores_gemma":[0.058829315,0.007223794,0.9093894,0.00048487366,0.00031809072,0.00016565608,0.01306247,0.001353349,0.009173069],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968329,0.0005718073,0.00048560553,0.0006329436,0.0013548735,0.000121893616],"domain_scores_gemma":[0.9828773,0.007940953,0.00092961185,0.0030844377,0.004634139,0.0005336474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047105066,0.0010320948,0.0011881884,0.016079584,0.0015232407,0.0053969747,0.0017525877,0.0006690479,0.009852874],"category_scores_gemma":[0.01598116,0.000870644,0.002482174,0.011100416,0.0018487269,0.008080981,0.0044530826,0.0015388466,0.004089666],"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.00013451684,0.000058062804,0.0028848655,0.0019963544,0.00024460934,0.0006930349,0.0027045899,0.0030925896,0.008391139,0.13397339,0.048270565,0.79755634],"study_design_scores_gemma":[0.000043413078,0.000095575975,0.002687773,0.0014644128,0.0005680487,0.001429449,0.003039792,0.02920479,0.02094086,0.438359,0.5020766,0.000090373425],"about_ca_topic_score_codex":0.004729828,"about_ca_topic_score_gemma":0.008956305,"teacher_disagreement_score":0.016079584,"about_ca_system_score_codex":0.0012474385,"about_ca_system_score_gemma":0.0056058536,"threshold_uncertainty_score":0.03296119},"labels":[],"label_agreement":null},{"id":"W1534650838","doi":"10.1007/978-3-540-39979-7_24","title":"Progressive Solutions to a Parallel Automata Equation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Ottawa","funders":"","keywords":"Computer science; Automaton; Component (thermodynamics); Block (permutation group theory); Cellular automaton; Relation (database); Theoretical computer science; Action (physics); Algorithm; Parallel computing; Mathematics; Data mining; Combinatorics","score_opus":0.05603601345491594,"score_gpt":0.3063964163933527,"score_spread":0.25036040293843675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534650838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093146466,0.00042569774,0.69546205,0.001608249,0.0004027,0.0001927582,0.00022979273,0.0005050833,0.2080272],"genre_scores_gemma":[0.6295339,0.00097616774,0.20356235,0.00041619304,0.0002801921,0.00037870565,0.00038475968,0.00031623399,0.16415152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999734,0.00004851596,0.000017303519,0.000048041547,0.000112846246,0.000039270544],"domain_scores_gemma":[0.9994305,0.00032464718,0.000036469486,0.00009054934,0.000082795654,0.00003507427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332764,0.00056603615,0.00048422927,0.00048721395,0.0010710398,0.0010622446,0.001141564,0.0009026298,0.015209719],"category_scores_gemma":[0.003175966,0.0003525586,0.0008964442,0.0006514982,0.0014267293,0.0023600152,0.0024989187,0.002485716,0.0012622921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018003868,0.000012666023,0.00004101569,0.000031552634,0.0000044781846,0.00006532859,0.00012806877,0.003293077,0.0012112618,0.98427963,0.0011879392,0.009726916],"study_design_scores_gemma":[0.000041127078,0.00001815601,0.000049141057,0.000010923854,0.0000109907005,0.00009160415,0.000055718963,0.024797942,0.0017500275,0.96463627,0.008532163,0.0000058902015],"about_ca_topic_score_codex":0.0011510903,"about_ca_topic_score_gemma":0.0016770444,"teacher_disagreement_score":0.015209719,"about_ca_system_score_codex":0.00083299057,"about_ca_system_score_gemma":0.0008117526,"threshold_uncertainty_score":0.050881505},"labels":[],"label_agreement":null},{"id":"W1534667089","doi":"10.1007/3-540-45153-6_33","title":"Towards a Temporal Extension of Formal Concept analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Formal concept analysis; Extension (predicate logic); Formal methods; Formal description; Lattice Miner; Theoretical computer science; Artificial intelligence; Programming language; Algorithm","score_opus":0.02154068926283716,"score_gpt":0.2531775230194952,"score_spread":0.23163683375665803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534667089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021190336,0.00054461625,0.99158794,0.00044723932,0.00016130155,0.00003148536,0.00006894831,0.00022900879,0.0048103854],"genre_scores_gemma":[0.095123805,0.0012016435,0.8948596,0.00044460793,0.00066145,0.00024039435,0.00028526664,0.00026147746,0.00692179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670815,0.0013221909,0.0003064998,0.0007028785,0.00079031393,0.00016979314],"domain_scores_gemma":[0.99509454,0.002612055,0.00036006072,0.0010174393,0.00069448876,0.00022144904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00569159,0.0008655591,0.0009438369,0.002096994,0.0010627229,0.0038425876,0.0022750662,0.0011139086,0.0060687745],"category_scores_gemma":[0.008664556,0.0010133663,0.0032945448,0.0024185313,0.004985793,0.011695959,0.0037632606,0.0048692147,0.001254919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023780918,0.000020356945,0.00006465483,0.000070125156,0.000015717373,0.000043535427,0.00027741888,0.0017800278,0.0007120202,0.97818255,0.00075969944,0.018050153],"study_design_scores_gemma":[0.000012410897,0.000019659461,0.000053470187,0.00003713526,0.000023409706,0.000057030542,0.00005695613,0.02046442,0.00050431665,0.96275187,0.016008819,0.0000105035515],"about_ca_topic_score_codex":0.0015801755,"about_ca_topic_score_gemma":0.0010566385,"teacher_disagreement_score":0.0060687745,"about_ca_system_score_codex":0.0016283758,"about_ca_system_score_gemma":0.001340962,"threshold_uncertainty_score":0.030100346},"labels":[],"label_agreement":null},{"id":"W1534778001","doi":"10.1007/3-540-44651-6_7","title":"Multipoint-to-Point Routing With QoS Guarantees Using Mobile Agents","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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 British Columbia","funders":"","keywords":"Computer network; Computer science; Quality of service; Routing (electronic design automation); Distributed computing","score_opus":0.021322421627356248,"score_gpt":0.25187012730950226,"score_spread":0.230547705682146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534778001","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.01423074,0.0016558963,0.9713634,0.00022603833,0.00021597957,0.00005718361,0.000029570821,0.0013038812,0.010917385],"genre_scores_gemma":[0.45821363,0.0019582512,0.5140118,0.00014816453,0.00027430497,0.00019965268,0.00016052446,0.0002627944,0.024770783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954814,0.00009975539,0.00003494844,0.0000748731,0.0001866625,0.000055622397],"domain_scores_gemma":[0.99921465,0.0003651111,0.00006588714,0.00018032249,0.00013094829,0.000043102013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993972,0.0009166311,0.0007618234,0.0006309815,0.0007030877,0.0017700975,0.0020763425,0.0012581307,0.0027718474],"category_scores_gemma":[0.00151135,0.0006114493,0.0004635533,0.00078079186,0.00046113046,0.0023366362,0.001660261,0.0015594584,0.0011827783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056635035,0.00021900289,0.0005768087,0.00040459837,0.00014073524,0.0003794264,0.00034133744,0.27768442,0.044889893,0.1489688,0.012299971,0.51352876],"study_design_scores_gemma":[0.00006611295,0.0001652834,0.00020628767,0.00004023107,0.0000679447,0.00029371135,0.000044984357,0.9045055,0.012809109,0.057074446,0.024688711,0.00003770194],"about_ca_topic_score_codex":0.0005501652,"about_ca_topic_score_gemma":0.0009222588,"teacher_disagreement_score":0.0027718474,"about_ca_system_score_codex":0.00044750224,"about_ca_system_score_gemma":0.0003085651,"threshold_uncertainty_score":0.009272754},"labels":[],"label_agreement":null},{"id":"W1534866524","doi":"10.1007/3-540-45571-x_19","title":"COE: Clustering with Obstacles Entities A Preliminary Study","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Obstacle; Canopy clustering algorithm; Correlation clustering; CURE data clustering algorithm; Artificial intelligence; Geography","score_opus":0.017078148201986606,"score_gpt":0.24304088995653075,"score_spread":0.22596274175454414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534866524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08490135,0.0023070753,0.8883359,0.0010780353,0.00031547804,0.00040969186,0.001778516,0.0030021488,0.017871834],"genre_scores_gemma":[0.25163367,0.001377242,0.71188533,0.0003998041,0.00041354183,0.00029668873,0.006178575,0.001369877,0.026445331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972645,0.0006296869,0.00015791666,0.0007469752,0.0009898618,0.00021116454],"domain_scores_gemma":[0.9891011,0.00528317,0.00028909996,0.0029667143,0.0019498975,0.0004100597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024719518,0.0011017837,0.0020495856,0.0030902543,0.0023602084,0.0038926457,0.0046306015,0.0018999451,0.00958137],"category_scores_gemma":[0.020940842,0.0007862876,0.0014288934,0.0074682175,0.0016779781,0.0070283185,0.0033668976,0.0016452287,0.0026508057],"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.0011319878,0.00062428124,0.01363356,0.0008251924,0.00032921537,0.00037063495,0.0011449496,0.16557497,0.008184475,0.15312052,0.035281003,0.61977917],"study_design_scores_gemma":[0.00009666653,0.00022061869,0.004665103,0.00006154075,0.00013131021,0.0005053905,0.00068475486,0.87812495,0.010126678,0.07951578,0.025795173,0.00007207898],"about_ca_topic_score_codex":0.018344985,"about_ca_topic_score_gemma":0.016572269,"teacher_disagreement_score":0.018344985,"about_ca_system_score_codex":0.0015800957,"about_ca_system_score_gemma":0.0015118913,"threshold_uncertainty_score":0.036476433},"labels":[],"label_agreement":null},{"id":"W1534933129","doi":"10.1007/978-3-642-05415-0_12","title":"Functional Size Measurement Quality Challenges for Inexperienced Measurers","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Software; Quality (philosophy); Engineering drawing; Algorithm; Data mining; Programming language; Engineering","score_opus":0.10274443870019853,"score_gpt":0.303481252921621,"score_spread":0.20073681422142245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534933129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3378954,0.009994751,0.5807449,0.025129082,0.00084834377,0.00022893216,0.0007334434,0.005899662,0.038525477],"genre_scores_gemma":[0.7655327,0.0020079087,0.21554963,0.0017585742,0.00061850593,0.00020467672,0.0005600507,0.001069236,0.012698757],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9677308,0.0064836848,0.0018625206,0.0027140821,0.020471552,0.0007373865],"domain_scores_gemma":[0.7872671,0.12481196,0.01045399,0.016899366,0.056095254,0.0044722524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029212952,0.00063643104,0.001037097,0.0024328262,0.0008956925,0.0042110546,0.0038052588,0.0011754704,0.0038499539],"category_scores_gemma":[0.14993554,0.0006253056,0.00040438262,0.001997569,0.0014521056,0.0048951562,0.0030839383,0.001470084,0.0015906753],"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.00024554602,0.00014920185,0.03140148,0.0004475104,0.00007225611,0.00018968048,0.004067712,0.0038248983,0.010068361,0.013693341,0.014838494,0.9210015],"study_design_scores_gemma":[0.0002903616,0.0029668165,0.26333618,0.0018316652,0.00038226583,0.0065879757,0.01968046,0.2131024,0.09954877,0.2085824,0.18303363,0.00065698876],"about_ca_topic_score_codex":0.004079705,"about_ca_topic_score_gemma":0.0049292212,"teacher_disagreement_score":0.029212952,"about_ca_system_score_codex":0.0015942621,"about_ca_system_score_gemma":0.0018069458,"threshold_uncertainty_score":0.1544947},"labels":[],"label_agreement":null},{"id":"W1534941349","doi":"10.1007/978-3-540-75560-9_10","title":"The Semantics of Consistency and Trust in Peer Data Exchange Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data exchange; Peer-to-peer; Pairwise comparison; Semantics (computer science); Consistency (knowledge bases); Theoretical computer science; Set (abstract data type); Data consistency; Information retrieval; Database; Programming language; Distributed computing; Artificial intelligence","score_opus":0.052474154124825576,"score_gpt":0.2795058890128403,"score_spread":0.2270317348880147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534941349","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.017738482,0.0022590933,0.9551343,0.0050975713,0.00050138985,0.00021993228,0.00024875006,0.000571477,0.018228998],"genre_scores_gemma":[0.70390564,0.0025250665,0.2797051,0.0010993496,0.0012399617,0.00082861166,0.00061899127,0.0003742157,0.009703087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98377824,0.006767259,0.0022670848,0.0014083721,0.0047461265,0.0010329087],"domain_scores_gemma":[0.9759068,0.0132943215,0.0015934603,0.005659186,0.0027837937,0.00076235214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011072662,0.0010363375,0.0017657048,0.0019369086,0.0037164576,0.013742858,0.004544796,0.0060293917,0.0036227542],"category_scores_gemma":[0.03768867,0.0019447764,0.0016383819,0.00373847,0.011139616,0.028735025,0.0055790627,0.008670168,0.0009917289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052703086,0.000019494808,0.00011980572,0.000069008725,0.0000166872,0.00007700065,0.00059091765,0.0037325034,0.00030782877,0.9862982,0.0011802664,0.0075355726],"study_design_scores_gemma":[0.000037993377,0.00001954117,0.000055155342,0.00004383186,0.000025730516,0.000121812795,0.00016366522,0.015230811,0.000632471,0.9751188,0.008527845,0.00002232074],"about_ca_topic_score_codex":0.0030139734,"about_ca_topic_score_gemma":0.0013362399,"teacher_disagreement_score":0.013742858,"about_ca_system_score_codex":0.0035706768,"about_ca_system_score_gemma":0.0033522868,"threshold_uncertainty_score":0.058558524},"labels":[],"label_agreement":null},{"id":"W1534962401","doi":"10.1007/978-3-540-73545-8_8","title":"Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":67,"is_retracted":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":"Missing data; Phylogenetic tree; Integer programming; Genotype; Genetic data; Integer (computer science); Computation; Genetic programming; Population; Mathematics; Mathematical optimization; Computer science; Biology; Statistics; Genetics; Algorithm; Artificial intelligence; Programming language; Demography; Sociology; Gene","score_opus":0.038678892631344636,"score_gpt":0.2933822906259842,"score_spread":0.2547033979946396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534962401","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.010885183,0.001955789,0.9705409,0.0019596107,0.00028856497,0.00010925577,0.00055915676,0.00024756225,0.013453932],"genre_scores_gemma":[0.101507284,0.0020793579,0.8799265,0.0005703176,0.00064960483,0.0006342624,0.0009790619,0.00030996586,0.013343545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981799,0.00083363865,0.00010170306,0.00030549977,0.00036423872,0.0002150501],"domain_scores_gemma":[0.9904235,0.008309033,0.00038058485,0.0002842449,0.00044241402,0.0001602387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043695807,0.0019149046,0.002131926,0.0009836785,0.0010750489,0.0049791997,0.003164336,0.002771759,0.009445913],"category_scores_gemma":[0.014177336,0.001792527,0.0019876673,0.0031452659,0.0019156246,0.0049209036,0.0017344458,0.005281915,0.0011665046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015173398,0.00023801354,0.00048645877,0.0004815692,0.00007448418,0.000108688386,0.00023636624,0.6642108,0.00042019176,0.25383446,0.013698469,0.06605871],"study_design_scores_gemma":[0.000041431813,0.000025784624,0.00009221262,0.000046399484,0.000020861378,0.00002568799,0.000077868164,0.8091637,0.0002056301,0.18732193,0.002965926,0.000012503755],"about_ca_topic_score_codex":0.005705534,"about_ca_topic_score_gemma":0.0073873373,"teacher_disagreement_score":0.009445913,"about_ca_system_score_codex":0.0019208329,"about_ca_system_score_gemma":0.0021264602,"threshold_uncertainty_score":0.0315997},"labels":[],"label_agreement":null},{"id":"W1534974138","doi":"10.1007/3-540-36135-9_2","title":"Submodule Construction for Specifications with Input Assumptions and Output Guarantees","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interleaving; Rotation formalisms in three dimensions; Automaton; Generalization; Computer science; Context (archaeology); Semantics (computer science); Theoretical computer science; Finite-state machine; State (computer science); Algorithm; Programming language; Mathematics","score_opus":0.052883206613385574,"score_gpt":0.26480055956822535,"score_spread":0.21191735295483977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534974138","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.008922374,0.0000426132,0.9858394,0.00009633292,0.000027694396,0.00010508085,0.000077605255,0.0018933023,0.0029956622],"genre_scores_gemma":[0.23378286,0.00020925494,0.75279003,0.00021220832,0.000048686252,0.0006130739,0.0007760337,0.0017185604,0.009849311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976998,0.00053819525,0.00019828307,0.0003892582,0.00086127204,0.00031312995],"domain_scores_gemma":[0.99524575,0.0023681982,0.00014190286,0.0016755383,0.0004440446,0.000124475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030040974,0.00082542974,0.0011302852,0.0008732704,0.000984543,0.0017637947,0.0022675842,0.0015652701,0.00608745],"category_scores_gemma":[0.006187358,0.001107495,0.0024484294,0.00093183084,0.0020357033,0.004469871,0.0051165465,0.00395095,0.0021416517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030006576,0.00018314099,0.000993164,0.000731559,0.000087469,0.0005951356,0.00084745005,0.01864403,0.038841687,0.73249245,0.0045845695,0.20169929],"study_design_scores_gemma":[0.00008406037,0.00018534146,0.00026766735,0.00012089834,0.000118901,0.0004407211,0.00015239959,0.09579519,0.09699467,0.78880566,0.016956082,0.00007842091],"about_ca_topic_score_codex":0.0004444225,"about_ca_topic_score_gemma":0.0005976822,"teacher_disagreement_score":0.00608745,"about_ca_system_score_codex":0.0007719991,"about_ca_system_score_gemma":0.0015756688,"threshold_uncertainty_score":0.020364583},"labels":[],"label_agreement":null},{"id":"W1535001420","doi":"10.1007/978-3-540-85097-7_10","title":"Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"","keywords":"Computer science; Fence (mathematics); Polygon (computer graphics); Wireless sensor network; Intrusion; Planar; Intrusion detection system; Perimeter; Simple (philosophy); Wireless; Computer network; Telecommunications; Computer security; Computer graphics (images)","score_opus":0.012514633259221693,"score_gpt":0.2217870600299186,"score_spread":0.2092724267706969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535001420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073324025,0.00046952209,0.9189989,0.00023860755,0.00005227595,0.000071905975,0.00010664049,0.00022233695,0.0065158317],"genre_scores_gemma":[0.81730455,0.0006586384,0.17440951,0.00006353959,0.000039623137,0.00019258754,0.00018547566,0.00011211078,0.0070339222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980384,0.00004579312,0.0000073617302,0.00003880208,0.00005671995,0.00004747489],"domain_scores_gemma":[0.9996458,0.00020426384,0.000048474365,0.000028091354,0.000037271293,0.00003597739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030979104,0.0007930789,0.0008734334,0.00056173303,0.00031208873,0.0005286789,0.001136995,0.0008777789,0.0017728177],"category_scores_gemma":[0.0019810703,0.00042654705,0.00059037353,0.00053121947,0.00051584456,0.00059945416,0.0011614508,0.0006634197,0.00027667973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004592193,0.00007174252,0.0005350035,0.00020200729,0.00003709872,0.00016560835,0.00013507824,0.8928477,0.025654966,0.030931337,0.0020590029,0.046901274],"study_design_scores_gemma":[0.000025041305,0.00006776988,0.00015462993,0.000009680329,0.000008321298,0.0000543306,0.000022107834,0.9924576,0.0014543077,0.0051485416,0.000589853,0.000007803252],"about_ca_topic_score_codex":0.002180908,"about_ca_topic_score_gemma":0.0016760876,"teacher_disagreement_score":0.002180908,"about_ca_system_score_codex":0.0005462916,"about_ca_system_score_gemma":0.0005219648,"threshold_uncertainty_score":0.005930662},"labels":[],"label_agreement":null},{"id":"W1535027478","doi":"10.1007/11590316_26","title":"A New Approach for High-Dimensional Unsupervised Learning: Applications to Image Restoration","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Dirichlet distribution; Flexibility (engineering); Expectation–maximization algorithm; Maximization; Image (mathematics); Artificial intelligence; Unsupervised learning; Hierarchical Dirichlet process; Mathematical optimization; Pattern recognition (psychology); Algorithm; Latent Dirichlet allocation; Topic model; Mathematics; Maximum likelihood; Statistics; Boundary value problem","score_opus":0.02619745687332929,"score_gpt":0.28042772788479464,"score_spread":0.25423027101146534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535027478","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.00024261388,0.00014087031,0.99890316,0.000054756456,0.000029859053,0.000006759376,0.000011556063,0.00010871287,0.0005016361],"genre_scores_gemma":[0.011533158,0.00071524427,0.9824698,0.00014974187,0.00019873382,0.00008818701,0.00008582166,0.00016864872,0.0045906785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.0002105952,0.000045950797,0.00019289635,0.000392357,0.000032654145],"domain_scores_gemma":[0.9990073,0.0003901034,0.00006926906,0.00021239127,0.0002575779,0.00006337939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013250117,0.0010417079,0.0014039155,0.0011848543,0.00082169584,0.0017544115,0.0023888065,0.0019635481,0.0045026336],"category_scores_gemma":[0.002846911,0.00081402296,0.0015273142,0.0018671314,0.0017381816,0.0024582713,0.0032814108,0.0031200186,0.0021971276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008937402,0.00015095099,0.00037458338,0.0004951234,0.00021180256,0.00014388467,0.00023734316,0.11810667,0.019242955,0.23485313,0.017630799,0.6084634],"study_design_scores_gemma":[0.000018072644,0.000040692703,0.00023466865,0.00003154978,0.000042452517,0.00035941592,0.000028261651,0.8123224,0.0047042486,0.16220205,0.019971352,0.00004485205],"about_ca_topic_score_codex":0.0012158031,"about_ca_topic_score_gemma":0.0028205481,"teacher_disagreement_score":0.0045026336,"about_ca_system_score_codex":0.0004649362,"about_ca_system_score_gemma":0.0007995641,"threshold_uncertainty_score":0.015062749},"labels":[],"label_agreement":null},{"id":"W1535027497","doi":"10.1007/978-3-642-36415-0_11","title":"Is Visualization Usable for Displaying Web Search Results in an Exploratory Search Context?","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Exploratory search; Visualization; Information visualization; USable; Scope (computer science); Visual analytics; Exploratory research; Usability; Context (archaeology); Information retrieval; Human–computer interaction; Data visualization; World Wide Web; Task (project management); Artificial intelligence","score_opus":0.06679358279386398,"score_gpt":0.33005479958504985,"score_spread":0.26326121679118586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535027497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20086212,0.014126124,0.6450243,0.011671506,0.0012947134,0.00046140442,0.0072032935,0.07810389,0.041252572],"genre_scores_gemma":[0.72732323,0.007357868,0.24922,0.00078196573,0.00059924583,0.0004673282,0.0032494727,0.0055468613,0.0054541044],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99831676,0.00095514837,0.00012052106,0.00013886185,0.00033277756,0.00013598576],"domain_scores_gemma":[0.9721799,0.021127133,0.0014111293,0.0022235936,0.0024515681,0.00060663064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038823793,0.0013517071,0.0011096236,0.0022506882,0.0005464319,0.006981238,0.0011124515,0.0019353919,0.013386292],"category_scores_gemma":[0.046839356,0.0007860921,0.00068227336,0.0023621586,0.00061684835,0.008903853,0.0016203143,0.001074577,0.003935067],"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.0044721337,0.00048754286,0.02479309,0.0050006583,0.00038861966,0.0012758404,0.011945639,0.005091197,0.056371335,0.029183794,0.11674698,0.7442431],"study_design_scores_gemma":[0.0011236855,0.0018655531,0.058033135,0.008837243,0.0018596654,0.0061514983,0.017253103,0.26285356,0.08283409,0.22925381,0.32874927,0.0011853315],"about_ca_topic_score_codex":0.0016488933,"about_ca_topic_score_gemma":0.0018089216,"teacher_disagreement_score":0.013386292,"about_ca_system_score_codex":0.00032417924,"about_ca_system_score_gemma":0.0005505426,"threshold_uncertainty_score":0.044781566},"labels":[],"label_agreement":null},{"id":"W1535059793","doi":"10.1007/11428862_4","title":"A Dynamic Model for Phase Transformations in 3D Samples of Shape Memory Alloys","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Shape Memory Alloy Transformations","field":"Materials 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":"Wilfrid Laurier University","funders":"","keywords":"Shape-memory alloy; SMA*; Uniqueness; Computer science; Nonlinear system; Tetragonal crystal system; Martensite; Sensitivity (control systems); Phase (matter); Injective function; Energy (signal processing); Character (mathematics); Algorithm; Statistical physics; Biological system; Materials science; Microstructure; Artificial intelligence; Mathematical analysis; Mathematics; Physics; Geometry; Metallurgy; Pure mathematics","score_opus":0.03121352795751807,"score_gpt":0.288411494467096,"score_spread":0.25719796650957794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535059793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108123876,0.0014075864,0.86555594,0.00058694085,0.00018613189,0.00011203571,0.0007756624,0.00063080306,0.02262116],"genre_scores_gemma":[0.89130396,0.0015669886,0.077156335,0.0002672666,0.0000914943,0.00034700573,0.0007652418,0.00038802187,0.02811364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999068,0.000012987715,0.0000053815306,0.000022159695,0.00003974752,0.000012987642],"domain_scores_gemma":[0.999889,0.000040253824,0.000018605202,0.00001656973,0.000024808629,0.000010770762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016971471,0.0005385915,0.0008507424,0.00062006083,0.0005015951,0.0010344002,0.0016919287,0.0018698989,0.0040271305],"category_scores_gemma":[0.00055688183,0.00062325643,0.0008972829,0.0005559169,0.0008376134,0.0010551608,0.00054399465,0.0006270772,0.0006930742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029168823,0.000026814596,0.00023279457,0.000047735033,0.000012548705,0.00009166189,0.00005505425,0.9472736,0.008702084,0.036754396,0.000539481,0.006234658],"study_design_scores_gemma":[0.0000028297854,0.000003973601,0.00005217298,0.0000016939728,0.0000020750595,0.000014803533,0.0000043974105,0.9959143,0.00030168766,0.0032195214,0.00047889887,0.0000036055496],"about_ca_topic_score_codex":0.0071919076,"about_ca_topic_score_gemma":0.005884719,"teacher_disagreement_score":0.0071919076,"about_ca_system_score_codex":0.0008778446,"about_ca_system_score_gemma":0.00054344634,"threshold_uncertainty_score":0.014300048},"labels":[],"label_agreement":null},{"id":"W1535111017","doi":"10.1007/978-3-642-12297-2_42","title":"Better Correspondence by Registration","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"National Research Council Canada; McGill University","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Outlier; Pattern recognition (psychology); Similarity (geometry); Computer vision; Pixel; Detector; Image (mathematics); Image registration","score_opus":0.012979097685603135,"score_gpt":0.26653370401522636,"score_spread":0.25355460632962323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535111017","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.0085337395,0.0007165403,0.9682841,0.0005496109,0.0005958252,0.00007675595,0.0002310852,0.0045789904,0.01643336],"genre_scores_gemma":[0.13549706,0.0011321015,0.7856298,0.0006512928,0.0005852407,0.00013287227,0.0010686204,0.0049325144,0.07037047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587643,0.0010085002,0.00022191957,0.0012442247,0.0013302164,0.00031876005],"domain_scores_gemma":[0.99696404,0.0004913953,0.00015837741,0.0020110176,0.00026959542,0.00010556159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020132584,0.001691862,0.0028929394,0.0029559445,0.0013895789,0.0041028666,0.0020605635,0.0027741971,0.0392636],"category_scores_gemma":[0.0059382706,0.0014549999,0.0024342637,0.0039939852,0.0021136848,0.0068632937,0.0060245637,0.003943065,0.021531843],"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.0007245912,0.00020242555,0.00058716076,0.00044346444,0.00018249295,0.00030332283,0.00034124943,0.03292334,0.06387986,0.19632669,0.04169847,0.662387],"study_design_scores_gemma":[0.0001933132,0.0004733875,0.0011336359,0.000109074615,0.00024073225,0.0022338554,0.0002810516,0.37590253,0.1588848,0.2934929,0.16685627,0.00019839464],"about_ca_topic_score_codex":0.0012666362,"about_ca_topic_score_gemma":0.0013285638,"teacher_disagreement_score":0.0392636,"about_ca_system_score_codex":0.0008870165,"about_ca_system_score_gemma":0.0009886463,"threshold_uncertainty_score":0.13134986},"labels":[],"label_agreement":null},{"id":"W1535203525","doi":"10.1007/11608288_65","title":"Iris Recognition with Support Vector Machines","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Artificial intelligence; Computer science; Iris recognition; Support vector machine; Pattern recognition (psychology); Thresholding; Eyelash; Hough transform; IRIS (biosensor); Canny edge detector; Computer vision; Classifier (UML); Artificial neural network; Edge detection; Biometrics; Image processing; Image (mathematics)","score_opus":0.02317202760250498,"score_gpt":0.246878880862528,"score_spread":0.22370685326002301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535203525","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.0060842014,0.0023511995,0.98163146,0.00012987322,0.00017657167,0.000048551465,0.00015357368,0.0028906802,0.006533894],"genre_scores_gemma":[0.1752959,0.0030512305,0.7910891,0.00016006122,0.00022707279,0.00013858538,0.00067503034,0.00028348414,0.02907951],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995049,0.000090610774,0.000033942415,0.000099083976,0.00024064998,0.000030689636],"domain_scores_gemma":[0.9997094,0.00010690156,0.000029448942,0.00007567851,0.00007034034,0.000008201576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041844192,0.0005336442,0.0006435031,0.00068144774,0.00016659797,0.00082322647,0.0006060015,0.00058375706,0.010091743],"category_scores_gemma":[0.0012891883,0.00040232908,0.00052527006,0.00090185006,0.00020508529,0.0010862589,0.00076309557,0.00071281375,0.0070707914],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097636716,0.00003075509,0.00029509782,0.00014993417,0.0000415091,0.000042333646,0.000021531392,0.008499767,0.023747506,0.0026666252,0.0057596415,0.95864767],"study_design_scores_gemma":[0.000029554669,0.0002880306,0.003245839,0.0001444171,0.000101451435,0.0010525769,0.00006546293,0.7898824,0.13090874,0.0122286,0.061974157,0.00007873342],"about_ca_topic_score_codex":0.00038059105,"about_ca_topic_score_gemma":0.00059083797,"teacher_disagreement_score":0.010091743,"about_ca_system_score_codex":0.00012333905,"about_ca_system_score_gemma":0.00016415665,"threshold_uncertainty_score":0.03376025},"labels":[],"label_agreement":null},{"id":"W1535252952","doi":"10.1007/978-3-540-78913-0_7","title":"On the Structure of Demonic Refinement Algebras with Enabledness and Termination","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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":"Université Laval","funders":"","keywords":"Divergence (linguistics); Algebra over a field; Kleene algebra; Operator (biology); Set (abstract data type); Domain (mathematical analysis); Computer science; Mathematics; Pure mathematics; Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.010897801008861006,"score_gpt":0.2161452656313804,"score_spread":0.2052474646225194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535252952","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0962455,0.00319672,0.64662206,0.0024609636,0.0004018723,0.00016416793,0.00045281465,0.0008639655,0.24959198],"genre_scores_gemma":[0.84282595,0.001768218,0.09916864,0.0008646423,0.00042072142,0.00018181873,0.0006110445,0.00028427827,0.05387471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985862,0.0004378782,0.00012449893,0.00019235513,0.0004249849,0.00023408713],"domain_scores_gemma":[0.9969277,0.0015480148,0.00020603166,0.00055937364,0.00054656377,0.00021235905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029326463,0.00069697754,0.00087708497,0.0018977609,0.0025458182,0.003002908,0.0016922494,0.001279241,0.008057093],"category_scores_gemma":[0.00440419,0.0008135712,0.0014243346,0.0022543503,0.0065248045,0.010572354,0.0029915953,0.00397303,0.0010358617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007923945,0.0000032390735,0.000027993656,0.000010626157,0.0000018820947,0.000016013038,0.00013146621,0.00025454856,0.00016839933,0.99798155,0.00018421431,0.0012120814],"study_design_scores_gemma":[0.0000046332116,0.000003854601,0.000023466553,0.000006047413,0.0000029348794,0.000017502658,0.000027751272,0.000928361,0.00018462047,0.99723697,0.0015597905,0.0000041267863],"about_ca_topic_score_codex":0.0036416678,"about_ca_topic_score_gemma":0.0031751734,"teacher_disagreement_score":0.008057093,"about_ca_system_score_codex":0.002196538,"about_ca_system_score_gemma":0.0013724517,"threshold_uncertainty_score":0.026953638},"labels":[],"label_agreement":null},{"id":"W153525798","doi":"10.1007/978-3-642-40498-6_5","title":"Sharing Experiences over Video: Watching Video Programs together at a Distance","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Electronic Arts (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Fidelity; Implementation; Multimedia; Videoconferencing; World Wide Web; Internet privacy; Telecommunications","score_opus":0.029310132668165744,"score_gpt":0.30135063356223135,"score_spread":0.2720405008940656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153525798","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9143262,0.0011705293,0.029684573,0.0008187501,0.00009542485,0.00039467463,0.00018591886,0.0001922566,0.053131767],"genre_scores_gemma":[0.98205906,0.00066317397,0.011817125,0.00026403146,0.00004869014,0.00020168918,0.00011564774,0.00004700516,0.004783674],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988224,0.0007254722,0.00002973922,0.0001392561,0.0001476569,0.00013543532],"domain_scores_gemma":[0.998423,0.000851699,0.00016054387,0.00017341127,0.00009662862,0.0002947213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012915793,0.0004564168,0.00019544664,0.0005004384,0.0015211131,0.0019494161,0.00083596486,0.00090119126,0.002874885],"category_scores_gemma":[0.0032006921,0.00021752535,0.0003649764,0.00044467,0.0014009905,0.0031942606,0.003228744,0.00078507693,0.0005108748],"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.0005880481,0.001004801,0.027006006,0.0025049895,0.00017682677,0.002306139,0.54322404,0.00078948704,0.04959994,0.010529748,0.009852889,0.35241708],"study_design_scores_gemma":[0.00018240079,0.005660467,0.1354553,0.0019204956,0.00056138035,0.011873128,0.50750947,0.0036650142,0.036019597,0.012302583,0.28446725,0.00038288074],"about_ca_topic_score_codex":0.0008965523,"about_ca_topic_score_gemma":0.0017022962,"teacher_disagreement_score":0.002874885,"about_ca_system_score_codex":0.00039909323,"about_ca_system_score_gemma":0.00037070643,"threshold_uncertainty_score":0.009617448},"labels":[],"label_agreement":null},{"id":"W1535286859","doi":"10.1007/11866763_49","title":"Using Registration Uncertainty Visualization in a User Study of a Simple Surgical Task","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston General Hospital; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Visualization; Computer science; Task (project management); Simple (philosophy); Reduction (mathematics); Uncertainty reduction theory; Human–computer interaction; Artificial intelligence; Computer vision; Mathematics","score_opus":0.031217186383807622,"score_gpt":0.3398570405038726,"score_spread":0.308639854120065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535286859","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.9186559,0.00059820694,0.07228613,0.0005568579,0.000102910846,0.00033103145,0.0012155636,0.004100216,0.002153118],"genre_scores_gemma":[0.928615,0.00030365636,0.06690402,0.00019628089,0.00005010987,0.0002103324,0.0007980695,0.0008504399,0.0020720544],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998939,0.0006035148,0.00008042805,0.00014894793,0.00015610697,0.000072015326],"domain_scores_gemma":[0.9641003,0.032572906,0.00042581643,0.0013632936,0.0009888016,0.0005487653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026050492,0.0014316181,0.0010089639,0.0010515318,0.0006487358,0.001166928,0.0013418691,0.00255743,0.006566694],"category_scores_gemma":[0.023273643,0.0006645436,0.000749978,0.00049872696,0.00055366004,0.001160251,0.0012707489,0.0007893291,0.0011231573],"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.02373822,0.004487481,0.05619158,0.0057340255,0.0012441841,0.015083928,0.050187778,0.073680505,0.23007105,0.002543066,0.025979463,0.5110587],"study_design_scores_gemma":[0.0017885367,0.017508898,0.10636467,0.00077953504,0.0012886333,0.020997982,0.014601725,0.6857565,0.10610788,0.0076522306,0.035776295,0.0013769511],"about_ca_topic_score_codex":0.0022677635,"about_ca_topic_score_gemma":0.0040946603,"teacher_disagreement_score":0.006566694,"about_ca_system_score_codex":0.00023973096,"about_ca_system_score_gemma":0.0003881314,"threshold_uncertainty_score":0.021967828},"labels":[],"label_agreement":null},{"id":"W1535333387","doi":"10.1007/11795018_6","title":"Deep Surrender: Musically Controlled Responsive Video","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Timbre; Computer science; Jitter; Speech recognition; Process (computing); Musical; Computer vision; Artificial intelligence; Computer graphics (images); Telecommunications; Art; Visual arts","score_opus":0.01322810719981342,"score_gpt":0.2361420166306015,"score_spread":0.22291390943078807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535333387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036246892,0.0016573875,0.8822553,0.00022988886,0.0005977564,0.00023799522,0.00079051056,0.026669497,0.05131471],"genre_scores_gemma":[0.5185805,0.001579867,0.32876515,0.0006172044,0.00033148116,0.00024942713,0.0025941152,0.0038434782,0.14343888],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977607,0.000020244262,0.0000069200128,0.000041934367,0.00012613535,0.000028764203],"domain_scores_gemma":[0.9998491,0.00004762328,0.000006291032,0.000043384698,0.00002634453,0.000027223678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027175766,0.00059246144,0.00044656562,0.0002652657,0.00022480506,0.00082120474,0.0014151885,0.0005919512,0.020692261],"category_scores_gemma":[0.00058529247,0.00026716423,0.0002036391,0.00017073288,0.0003730502,0.0010262907,0.0014724258,0.0008376182,0.003974627],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007152984,0.00011614144,0.0001602622,0.00026049154,0.00004251607,0.00036459265,0.00026516576,0.0057810713,0.41214293,0.0202682,0.027272934,0.53261036],"study_design_scores_gemma":[0.00025645245,0.000628902,0.0012387974,0.00011724342,0.00006973131,0.0015985703,0.000203678,0.2378574,0.45427257,0.03040857,0.27319452,0.00015348726],"about_ca_topic_score_codex":0.0007193105,"about_ca_topic_score_gemma":0.0013650891,"teacher_disagreement_score":0.020692261,"about_ca_system_score_codex":0.0002558454,"about_ca_system_score_gemma":0.00018541976,"threshold_uncertainty_score":0.06922251},"labels":[],"label_agreement":null},{"id":"W1535346311","doi":"10.1007/978-3-540-87875-9_12","title":"Model Transformation as an Optimization Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":95,"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 à Montréal; Université de Montréal","funders":"","keywords":"Transformation (genetics); Computer science; Model transformation; Rotation formalisms in three dimensions; Mathematical optimization; Set (abstract data type); Particle swarm optimization; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.017854567259909734,"score_gpt":0.2352899648952768,"score_spread":0.21743539763536707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535346311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005565081,0.00013764521,0.98478186,0.00041443462,0.000037017147,0.00005455467,0.00006768802,0.0003131221,0.008628536],"genre_scores_gemma":[0.3802445,0.0007684433,0.5883744,0.000294003,0.00008616138,0.00032694207,0.00060167065,0.00071326253,0.028590696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990675,0.00034283433,0.00004061557,0.000199056,0.0002757756,0.00007425506],"domain_scores_gemma":[0.99915755,0.0005712298,0.000054162054,0.00011021612,0.00007966084,0.00002716886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010789967,0.0007437188,0.0010440745,0.0006748124,0.0005115804,0.0018476994,0.0010921224,0.0011348157,0.008786523],"category_scores_gemma":[0.002783145,0.0006814428,0.0015142031,0.0011865665,0.0009842349,0.0022268232,0.0017512885,0.0023510712,0.0010859935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012440678,0.00017462859,0.00029395105,0.00028901192,0.00008052846,0.00025194584,0.00012902413,0.51148707,0.004847333,0.31962484,0.0062864795,0.15641092],"study_design_scores_gemma":[0.00003562845,0.000057478235,0.00008923713,0.00002760894,0.000040610506,0.000118608135,0.000057083664,0.7113636,0.0023064855,0.27474186,0.011149735,0.000012041224],"about_ca_topic_score_codex":0.0015129108,"about_ca_topic_score_gemma":0.0015135478,"teacher_disagreement_score":0.008786523,"about_ca_system_score_codex":0.0008178857,"about_ca_system_score_gemma":0.0011031848,"threshold_uncertainty_score":0.029393852},"labels":[],"label_agreement":null},{"id":"W1535484496","doi":"10.1007/11880905_4","title":"Self-configuration of Network Devices with Configuration Logic","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Configuration Management (ITSM); Satisfiability; Formalism (music); Virtual LAN; Distributed computing; Theoretical computer science; Computer network","score_opus":0.021776036371796596,"score_gpt":0.25351359022172004,"score_spread":0.23173755384992345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535484496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04318998,0.00036692244,0.92039347,0.00017292103,0.00011100019,0.0000651649,0.00006594443,0.0039496045,0.031685024],"genre_scores_gemma":[0.8381464,0.0003713044,0.14210252,0.00019492353,0.00007577323,0.00012441482,0.00023101298,0.0005366037,0.018217076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950814,0.00010929645,0.000037094014,0.00010349254,0.00016792506,0.00007412548],"domain_scores_gemma":[0.9993368,0.00018565486,0.000057417124,0.0002915651,0.00008776392,0.0000407423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047871232,0.00047696373,0.00038000985,0.0005502782,0.0005006374,0.0019352563,0.0012346249,0.00056539854,0.0050402726],"category_scores_gemma":[0.0012232047,0.00038028293,0.00038194036,0.0005611377,0.0009729698,0.0026979349,0.0014172568,0.0008424645,0.00085039425],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035181147,0.00014903668,0.001310477,0.00025120517,0.00006856031,0.0005859947,0.00049039937,0.078614436,0.044288926,0.58067536,0.007397473,0.28581637],"study_design_scores_gemma":[0.000067956564,0.00017488177,0.0005684792,0.000080833204,0.00007582172,0.00079459464,0.0001255227,0.4453165,0.06822218,0.45294577,0.03157196,0.000055528253],"about_ca_topic_score_codex":0.000310865,"about_ca_topic_score_gemma":0.00042256873,"teacher_disagreement_score":0.0050402726,"about_ca_system_score_codex":0.00046228355,"about_ca_system_score_gemma":0.00035513614,"threshold_uncertainty_score":0.01686132},"labels":[],"label_agreement":null},{"id":"W1535504912","doi":"10.1007/978-3-540-30574-3_25","title":"New Minimal Weight Representations for Left-to-Right Window Methods","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Window (computing); Arithmetic; Elliptic curve; Combinatorics; Discrete mathematics; Representation (politics); Elliptic curve cryptography; Point (geometry); Radix (gastropod); Simple (philosophy); Computer science; Pure mathematics; Geometry; Public-key cryptography; Encryption","score_opus":0.018566890992097556,"score_gpt":0.31059878868942725,"score_spread":0.2920318976973297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535504912","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.025357125,0.00042758862,0.9467612,0.00022401786,0.00038964217,0.000058178084,0.00010046407,0.0008285038,0.025853235],"genre_scores_gemma":[0.3041564,0.0009161321,0.63730186,0.0003470418,0.00057101896,0.00030834376,0.00043116295,0.0020786189,0.05388939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954754,0.000095967975,0.00003374774,0.00006828814,0.00018824988,0.00006622627],"domain_scores_gemma":[0.99962914,0.00009829868,0.000033150962,0.00011928822,0.00006647727,0.000053635536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064443174,0.0007904457,0.0006658822,0.0010947228,0.0006095483,0.001807555,0.0011139117,0.000838901,0.011510374],"category_scores_gemma":[0.0020419406,0.00040703596,0.00059482764,0.0009268695,0.0008181156,0.0029341106,0.0018595974,0.0019323895,0.0031864764],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013488096,0.00006737501,0.00010727509,0.00009315493,0.000013053196,0.00005082227,0.00016527333,0.0022234593,0.01111833,0.8588763,0.004999454,0.12215059],"study_design_scores_gemma":[0.00004763881,0.000070760536,0.00012204378,0.000048383936,0.00002614278,0.00015139871,0.00005712216,0.05311835,0.008291176,0.91529316,0.022739619,0.00003405326],"about_ca_topic_score_codex":0.0001455007,"about_ca_topic_score_gemma":0.00026114326,"teacher_disagreement_score":0.011510374,"about_ca_system_score_codex":0.00035547724,"about_ca_system_score_gemma":0.00029553164,"threshold_uncertainty_score":0.03850603},"labels":[],"label_agreement":null},{"id":"W1535506841","doi":"10.1007/11559573_69","title":"Compressing 2-D Shapes Using Concavity Trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Lossy compression; Silhouette; Computer science; Set (abstract data type); Representation (politics); Image compression; Data compression; Compression (physics); Algorithm; Binary tree; Binary number; Artificial intelligence; Pattern recognition (psychology); Image (mathematics); Mathematics; Image processing; Arithmetic","score_opus":0.0332014866826259,"score_gpt":0.2870011038123816,"score_spread":0.2537996171297557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535506841","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.07297706,0.0007948282,0.9156758,0.00022161413,0.00017896558,0.000099874924,0.00038447184,0.002138379,0.007528896],"genre_scores_gemma":[0.28367808,0.0014557788,0.6981838,0.0002621088,0.00018323254,0.00015624939,0.0012056457,0.00073650957,0.014138606],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999718,0.000025691385,0.000017130695,0.000036235084,0.00017571682,0.000027249302],"domain_scores_gemma":[0.9992679,0.00030962937,0.00005605186,0.00021466493,0.00011429868,0.00003730979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020213523,0.00084465044,0.0006798633,0.0013738896,0.0003002975,0.0007812488,0.00074439636,0.0005944315,0.0053660134],"category_scores_gemma":[0.0015230058,0.00056131475,0.0005735382,0.0021400056,0.00053253147,0.0013333941,0.0014636563,0.0010787351,0.0015590525],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042599044,0.0001097113,0.00066228776,0.00030547235,0.000048655784,0.0004297879,0.00030454938,0.10608935,0.113207065,0.026250508,0.009462926,0.7427037],"study_design_scores_gemma":[0.00005614041,0.00026524306,0.00084130955,0.000053999698,0.000036210422,0.00090721116,0.0001385289,0.8827952,0.07187423,0.021984102,0.020991776,0.000056059092],"about_ca_topic_score_codex":0.001381495,"about_ca_topic_score_gemma":0.002987146,"teacher_disagreement_score":0.0053660134,"about_ca_system_score_codex":0.00029253605,"about_ca_system_score_gemma":0.000412543,"threshold_uncertainty_score":0.01795113},"labels":[],"label_agreement":null},{"id":"W1535647113","doi":"10.1007/978-3-540-74260-9_20","title":"Enhancing Contour Primitives by Pairwise Grouping and Relaxation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Université Laval","funders":"","keywords":"Silhouette; Computer science; Artificial intelligence; Pairwise comparison; Computer vision; Matching (statistics); Curvature; Pattern recognition (psychology); Binary number; Object (grammar); Mathematics; Geometry","score_opus":0.017765657929045983,"score_gpt":0.2737278084279845,"score_spread":0.2559621504989385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535647113","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.008262143,0.00016121939,0.98946804,0.00004328019,0.000029633376,0.000041999876,0.000026781738,0.00053440465,0.0014325571],"genre_scores_gemma":[0.08865879,0.0002437643,0.9072085,0.00007184319,0.00004580318,0.00008633121,0.00015853606,0.0006700256,0.0028563722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993228,0.00010753113,0.00003234174,0.00015593866,0.00029757112,0.00008394396],"domain_scores_gemma":[0.9989784,0.00039653192,0.00012171003,0.00031580921,0.00013192574,0.000055618584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009541897,0.0014506087,0.0017467113,0.0013647543,0.0005961708,0.0014229612,0.0021924295,0.0014420259,0.0048594577],"category_scores_gemma":[0.0025192543,0.0013568307,0.0014339718,0.0020006285,0.0011038523,0.0021185735,0.0024912294,0.0026017076,0.0019934287],"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.0005119834,0.00022933743,0.00035980708,0.0005482381,0.00010275657,0.00015553394,0.0003789803,0.20445952,0.2619657,0.027543284,0.004648049,0.49909684],"study_design_scores_gemma":[0.00006492946,0.0002688814,0.00039191174,0.00003835046,0.00007699542,0.0004059549,0.00007855851,0.91157126,0.056872617,0.022201598,0.007977406,0.00005153791],"about_ca_topic_score_codex":0.00093856436,"about_ca_topic_score_gemma":0.0014374459,"teacher_disagreement_score":0.0048594577,"about_ca_system_score_codex":0.00042645924,"about_ca_system_score_gemma":0.0006531681,"threshold_uncertainty_score":0.016256452},"labels":[],"label_agreement":null},{"id":"W1535667553","doi":"10.1007/978-3-642-22427-0_7","title":"A Centralized Framework to Multi-robots Formation Control: Theory and Application","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Robot; Group (periodic table); Consistency (knowledge bases); Controller (irrigation); Perspective (graphical); Property (philosophy); Graph; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Distributed computing; Theoretical computer science; Computer network; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.016302015788813656,"score_gpt":0.2504416907569624,"score_spread":0.23413967496814872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535667553","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.00079435745,0.0012662952,0.99229336,0.0001702194,0.00015285356,0.0000146755165,0.00001342134,0.00017658995,0.0051183063],"genre_scores_gemma":[0.3880289,0.007169079,0.566906,0.0006364913,0.0013148176,0.00043194584,0.00015674566,0.00034770477,0.035008393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929535,0.00018141343,0.000025220397,0.00015729098,0.00029353276,0.000047177666],"domain_scores_gemma":[0.99950707,0.00017532425,0.000044504108,0.0001225147,0.00011838078,0.00003205297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006377055,0.00076113106,0.0011497637,0.00049193046,0.0008286838,0.001515735,0.0022161081,0.0012123793,0.0044360706],"category_scores_gemma":[0.0012914927,0.00063349085,0.0008201829,0.00110705,0.0016076947,0.0015686444,0.0018038799,0.0021410864,0.0012361006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047343125,0.00007260383,0.000151524,0.00022459733,0.000054157234,0.0001617961,0.00014039657,0.22709265,0.004969359,0.64012754,0.009543047,0.117415115],"study_design_scores_gemma":[0.00003621818,0.00008851106,0.00014997997,0.00004346522,0.00003080212,0.00015934132,0.000034350127,0.667886,0.0024704062,0.3084644,0.020609163,0.000027293385],"about_ca_topic_score_codex":0.0011712249,"about_ca_topic_score_gemma":0.0015447292,"teacher_disagreement_score":0.0044360706,"about_ca_system_score_codex":0.0011232777,"about_ca_system_score_gemma":0.001222497,"threshold_uncertainty_score":0.014840126},"labels":[],"label_agreement":null},{"id":"W1535718607","doi":"10.1007/11796435_31","title":"Reducing Execution Unit Leakage Power in Embedded Processors","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Leakage (economics); Leakage power; Unit (ring theory); Computer science; Embedded system; Power (physics); Power consumption; Psychology; Physics; Economics","score_opus":0.01537262898530158,"score_gpt":0.2574425904635573,"score_spread":0.24206996147825569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535718607","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.31694707,0.0130474055,0.63063604,0.00096878415,0.00036236504,0.00007814595,0.00026081287,0.0055864295,0.032113012],"genre_scores_gemma":[0.8727877,0.002393837,0.10248422,0.00038999185,0.00014636667,0.00004579938,0.0002615681,0.000735861,0.020754518],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997992,0.000031387426,0.000012672202,0.000032439286,0.000074988755,0.00004934113],"domain_scores_gemma":[0.9996369,0.00014398435,0.000042391144,0.00009446101,0.00006966128,0.000012567457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015526578,0.00073942746,0.00050731876,0.00037788137,0.00028021177,0.00054822234,0.0012118332,0.00030581886,0.0046221633],"category_scores_gemma":[0.0007352382,0.00028079827,0.00031692692,0.0008410593,0.00028035234,0.0013515597,0.00054096564,0.00055952184,0.0008458344],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075442565,0.00024048246,0.0013669003,0.00078419957,0.00012373936,0.0002662817,0.00018143431,0.11997984,0.21142891,0.027178276,0.009030431,0.6286651],"study_design_scores_gemma":[0.00012365945,0.0013533717,0.0028899377,0.00014354903,0.00038507633,0.00092762377,0.0001294648,0.5137178,0.37745935,0.0642922,0.03852622,0.000051827243],"about_ca_topic_score_codex":0.00032920792,"about_ca_topic_score_gemma":0.0008418979,"teacher_disagreement_score":0.0046221633,"about_ca_system_score_codex":0.00034431164,"about_ca_system_score_gemma":0.00045509893,"threshold_uncertainty_score":0.015462697},"labels":[],"label_agreement":null},{"id":"W1535837205","doi":"10.1007/11863939_15","title":"Coupling Bayesian Networks with GIS-Based Cellular Automata for Modeling Land Use Change","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Land Use and Ecosystem Services","field":"Environmental 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":"Simon Fraser University","funders":"","keywords":"Rotation formalisms in three dimensions; Geospatial analysis; Computer science; Cellular automaton; Data mining; Bayesian network; Formalism (music); Key (lock); Graphical model; Geographic information system; Theoretical computer science; Automaton; Process (computing); Machine learning; Artificial intelligence; Remote sensing; Geography; Mathematics; Programming language","score_opus":0.020638584982594806,"score_gpt":0.2079931720252403,"score_spread":0.18735458704264552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535837205","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039610423,0.00052939,0.9558224,0.00023695258,0.00008554855,0.00004493181,0.00022932219,0.00038579377,0.0030552186],"genre_scores_gemma":[0.8353842,0.0006841632,0.15896572,0.00009459968,0.00010401896,0.00025387583,0.00035406795,0.00016527029,0.0039940337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999156,0.0003704235,0.00005790727,0.00018493764,0.00017061578,0.000060195605],"domain_scores_gemma":[0.9961901,0.0029388526,0.00026815577,0.00022249474,0.00027554255,0.00010490361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289244,0.00094384624,0.0016783997,0.0012282383,0.0007685254,0.0014880954,0.002351448,0.0024262236,0.0028096626],"category_scores_gemma":[0.009053142,0.0015144078,0.0015089493,0.002020894,0.0013209677,0.0025214518,0.0019805224,0.0016362034,0.00051361934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009003176,0.000010749834,0.000270896,0.000009481756,0.0000172835,0.000012656148,0.00002510467,0.9919532,0.00012663615,0.004669528,0.00009133855,0.002804009],"study_design_scores_gemma":[0.0000021732117,0.0000021873047,0.00003579262,0.0000015273808,0.0000033949925,0.0000031919872,0.000002244901,0.994545,0.000034456665,0.0052773105,0.00009020955,0.0000026509736],"about_ca_topic_score_codex":0.023858216,"about_ca_topic_score_gemma":0.020942193,"teacher_disagreement_score":0.023858216,"about_ca_system_score_codex":0.001782563,"about_ca_system_score_gemma":0.00088153814,"threshold_uncertainty_score":0.04743868},"labels":[],"label_agreement":null},{"id":"W1535846614","doi":"10.1007/978-3-540-79980-1_28","title":"A Hybrid Approach for Safe Memory Management in C","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Computer science; Instrumentation (computer programming); Compiler; C dynamic memory allocation; Static analysis; Memory management; Memory safety; Code (set theory); Memory address; Programming language; Memory protection; Operating system; Undecidable problem; Dynamic program analysis; Compile time; Embedded system; Virtual memory; Program analysis; Semiconductor memory; Algorithm; Decidability","score_opus":0.029723826577956667,"score_gpt":0.2508437584516531,"score_spread":0.2211199318736964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535846614","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010951747,0.00031711,0.9758185,0.0002538511,0.000108665605,0.0000960087,0.0000921324,0.0029723877,0.009389532],"genre_scores_gemma":[0.27792484,0.0004087428,0.6961015,0.00050870056,0.0001323099,0.0003711413,0.0003483924,0.0012184525,0.022985993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983798,0.00023651744,0.00010968235,0.00028298877,0.0007510927,0.00023985654],"domain_scores_gemma":[0.99826354,0.00044399026,0.000059976253,0.0008710533,0.0002917079,0.00006973907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009103262,0.0008127917,0.0006323475,0.001151019,0.0013694507,0.0023546494,0.0032054451,0.0012845217,0.008349333],"category_scores_gemma":[0.002377264,0.0006356303,0.0011595195,0.0013418883,0.0017930553,0.0037704685,0.0036426852,0.0020864527,0.0017386301],"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.00044622255,0.00013638337,0.0007706326,0.00038260903,0.000104875355,0.000303986,0.00068853924,0.04439449,0.02615741,0.5962731,0.013204003,0.3171377],"study_design_scores_gemma":[0.00008717061,0.00017748046,0.00030859132,0.000089671696,0.0001443036,0.00035953833,0.00015676366,0.38417062,0.040660385,0.52809376,0.04566607,0.000085707434],"about_ca_topic_score_codex":0.002728734,"about_ca_topic_score_gemma":0.0037883862,"teacher_disagreement_score":0.008349333,"about_ca_system_score_codex":0.0010197816,"about_ca_system_score_gemma":0.001642324,"threshold_uncertainty_score":0.027931273},"labels":[],"label_agreement":null},{"id":"W1535850189","doi":"10.1007/978-3-642-13437-1_35","title":"Delivering Tutoring Feedback Using Persuasive Dialogues","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Argumentation theory; Computer science; Domain (mathematical analysis); Intelligent tutoring system; Human–computer interaction; Multimedia; Persuasive technology; Artificial intelligence; Persuasion; Psychology; Linguistics","score_opus":0.035444641282329735,"score_gpt":0.2512576402461402,"score_spread":0.21581299896381048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535850189","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119105525,0.00133023,0.8331886,0.0004332153,0.0006399091,0.00056392077,0.00017252461,0.023178164,0.021387901],"genre_scores_gemma":[0.6801665,0.0009127108,0.29462212,0.00032681128,0.00042883505,0.00065529684,0.0003951499,0.0011414768,0.021351153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980192,0.0008727503,0.00011203322,0.00030523975,0.00058910955,0.000101623],"domain_scores_gemma":[0.9898399,0.008385141,0.00027240682,0.00043542378,0.00085096573,0.00021608708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014249628,0.0016809697,0.0011529278,0.00082117773,0.00040575748,0.0020129995,0.0012616407,0.0022614272,0.011535993],"category_scores_gemma":[0.013716842,0.00050323986,0.00043404277,0.00041769666,0.00024913726,0.0019623516,0.0016084167,0.0013457264,0.0050431024],"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.0013601804,0.0010228059,0.0008915765,0.00094914343,0.00010413069,0.00047512105,0.0024186866,0.008271978,0.16360448,0.0023426968,0.010037954,0.8085212],"study_design_scores_gemma":[0.0017383983,0.007694295,0.0088847745,0.00081828405,0.00094463397,0.0032889706,0.0024086856,0.4465846,0.40984482,0.022225844,0.0951365,0.00043019824],"about_ca_topic_score_codex":0.00017878896,"about_ca_topic_score_gemma":0.00019184683,"teacher_disagreement_score":0.011535993,"about_ca_system_score_codex":0.00014686925,"about_ca_system_score_gemma":0.00023976139,"threshold_uncertainty_score":0.038591743},"labels":[],"label_agreement":null},{"id":"W1535866878","doi":"10.1007/3-540-47922-8_21","title":"An Efficient Compositional Semantics for Natural-Language Database Queries with Arbitrarily-Nested Quantification and Negation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Windsor","funders":"","keywords":"Computer science; Negation; Programming language; Semantics (computer science); Natural language processing; Artificial intelligence","score_opus":0.014838123771695022,"score_gpt":0.24858257800142836,"score_spread":0.23374445422973333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535866878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00720544,0.00011985063,0.98593044,0.00029406606,0.000081614504,0.00021270174,0.00018833567,0.0036909766,0.0022766385],"genre_scores_gemma":[0.13753098,0.00015696045,0.8573381,0.00033743848,0.00010937111,0.0003292551,0.00050577795,0.000890269,0.0028018637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942931,0.0013605591,0.00065973355,0.0008199319,0.002310651,0.0005560663],"domain_scores_gemma":[0.99548846,0.0021536052,0.00023434024,0.001080413,0.0008241597,0.0002189432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052078953,0.0011740783,0.001831171,0.0013417592,0.001953256,0.0055507147,0.0038494603,0.0020806934,0.0062811277],"category_scores_gemma":[0.009236245,0.0018350641,0.002714456,0.0016859608,0.0040265606,0.012202338,0.0075035356,0.0035282031,0.0017730633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057183753,0.00034588506,0.00056036556,0.00042332473,0.00007650263,0.00031430364,0.0013166019,0.016423177,0.01888666,0.8481584,0.007695819,0.10522705],"study_design_scores_gemma":[0.00022809464,0.00011554115,0.00015463225,0.00008158997,0.00016536623,0.00035346457,0.00026456828,0.22299282,0.020139676,0.73414505,0.021238115,0.00012110607],"about_ca_topic_score_codex":0.0036650805,"about_ca_topic_score_gemma":0.005560549,"teacher_disagreement_score":0.0062811277,"about_ca_system_score_codex":0.0018357865,"about_ca_system_score_gemma":0.0028793267,"threshold_uncertainty_score":0.027542293},"labels":[],"label_agreement":null},{"id":"W1535872236","doi":"10.1007/978-3-642-39736-3_16","title":"Matching Semi-structured Documents Using Similarity of Regions through Fuzzy Rule-Based System","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Information retrieval; Fuzzy logic; Similarity (geometry); Categorization; Set (abstract data type); Artificial intelligence; Matching (statistics); Data mining; Representation (politics); Similarity measure; Semantic similarity; Metric (unit); Natural language processing; Image (mathematics); Mathematics","score_opus":0.031460472136494416,"score_gpt":0.2695239977017202,"score_spread":0.23806352556522578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535872236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1150941,0.0007282886,0.8784064,0.0000993019,0.000115337316,0.00030911143,0.00044981172,0.0025085183,0.0022891096],"genre_scores_gemma":[0.43722004,0.0003595845,0.55970955,0.00006387524,0.000046736583,0.00014400412,0.00084685127,0.00008199303,0.0015273205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780554,0.00019444371,0.00034389584,0.0006825069,0.00087025523,0.00010338948],"domain_scores_gemma":[0.9978516,0.0006207771,0.00026041397,0.00028102146,0.0009133352,0.00007292296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012262651,0.00053837884,0.0013004508,0.0035888592,0.00067222305,0.0020123483,0.0016811707,0.0009830208,0.0013128301],"category_scores_gemma":[0.0048269997,0.00036010979,0.0010686818,0.0028211114,0.0005243789,0.0021263256,0.0007760418,0.00040167817,0.0008188074],"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.0010025944,0.00030684934,0.0056451443,0.0005630141,0.00024108733,0.0006242955,0.0006063849,0.04145616,0.09583467,0.004026763,0.0028970612,0.84679604],"study_design_scores_gemma":[0.00006896426,0.000345564,0.005643513,0.0000775409,0.00039638535,0.0008170008,0.0003505472,0.9164565,0.06465636,0.006972418,0.0041192034,0.000095942276],"about_ca_topic_score_codex":0.0045551797,"about_ca_topic_score_gemma":0.0034838845,"teacher_disagreement_score":0.0045551797,"about_ca_system_score_codex":0.00064547296,"about_ca_system_score_gemma":0.0010265309,"threshold_uncertainty_score":0.009057283},"labels":[],"label_agreement":null},{"id":"W1535886950","doi":"10.1007/11943952_42","title":"Key Exchange in 802.15.4 Networks and Its Performance Implications","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Body Area Networks","field":"Engineering","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 Manitoba","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Key exchange; Key (lock); Protocol (science); Scheme (mathematics); Data exchange; Wireless network; Wireless; Computer security; Public-key cryptography; Database; Telecommunications; Encryption; Operating system","score_opus":0.010737972575909697,"score_gpt":0.20298003813570673,"score_spread":0.19224206555979703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535886950","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13935493,0.15861948,0.5273709,0.038560957,0.0044399337,0.00024676308,0.00057415135,0.0010320867,0.12980083],"genre_scores_gemma":[0.91333807,0.032681774,0.035029788,0.0009373523,0.0026133826,0.000200485,0.00020296474,0.0001775284,0.01481869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99704343,0.0010318797,0.00014585564,0.0003646309,0.0009945764,0.0004196584],"domain_scores_gemma":[0.9834538,0.01264788,0.00085488154,0.0012697151,0.0015798938,0.00019390178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057771564,0.0011854001,0.0013712223,0.001255885,0.0014967802,0.005865878,0.002313994,0.003350562,0.0059632785],"category_scores_gemma":[0.025373256,0.00095133524,0.0003042531,0.003187972,0.0033919443,0.015439729,0.0019841895,0.0037456802,0.0014094422],"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.0006052175,0.00013544029,0.0014034295,0.00053216587,0.00004817451,0.00029042776,0.0005017156,0.08027372,0.004736986,0.77693206,0.012655332,0.121885374],"study_design_scores_gemma":[0.0000989566,0.00023868008,0.0009194626,0.0002524792,0.000058052385,0.0009961016,0.00054425624,0.1922823,0.0047988757,0.7804581,0.019253125,0.00009960679],"about_ca_topic_score_codex":0.0015896359,"about_ca_topic_score_gemma":0.0009393763,"teacher_disagreement_score":0.0059632785,"about_ca_system_score_codex":0.0026364143,"about_ca_system_score_gemma":0.0011726359,"threshold_uncertainty_score":0.030552864},"labels":[],"label_agreement":null},{"id":"W1536000481","doi":"10.1007/978-3-642-02658-4_50","title":"Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Application Security Vulnerabilities","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Ajax; Java applet; XML; Interface (matter); Java; Programming language; Operating system; Web application; JSON; Database; User interface","score_opus":0.012032936278524153,"score_gpt":0.2488462742398305,"score_spread":0.23681333796130635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536000481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1729492,0.0004256586,0.7732568,0.00057127076,0.00020500431,0.0003128734,0.0001118818,0.015946016,0.036221314],"genre_scores_gemma":[0.8086021,0.00023885879,0.16915374,0.00021028655,0.0000331434,0.00015246923,0.00017618187,0.0017271902,0.019705964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973104,0.0006692384,0.00016716112,0.00019687625,0.0012710533,0.00038526888],"domain_scores_gemma":[0.9952348,0.0018991831,0.00023100736,0.0019275168,0.0005590651,0.00014853975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034061945,0.00041272375,0.0005801268,0.0006173192,0.00095524214,0.0019683281,0.0016764068,0.0017591104,0.0046402556],"category_scores_gemma":[0.009877617,0.00086156913,0.000491934,0.00061536714,0.0015085764,0.0022050857,0.0025903275,0.002769173,0.0010451458],"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.0013687228,0.00085779023,0.005317815,0.00032396708,0.00009631642,0.0016891899,0.0023378255,0.044442117,0.091357924,0.3930995,0.019106276,0.4400026],"study_design_scores_gemma":[0.00020534573,0.00015879393,0.0023412046,0.0001783498,0.00008677084,0.0009070507,0.00022698853,0.6932327,0.11595098,0.13671054,0.04989302,0.00010822333],"about_ca_topic_score_codex":0.003239823,"about_ca_topic_score_gemma":0.0049792994,"teacher_disagreement_score":0.0046402556,"about_ca_system_score_codex":0.000683833,"about_ca_system_score_gemma":0.001362849,"threshold_uncertainty_score":0.018013895},"labels":[],"label_agreement":null},{"id":"W1536047544","doi":"10.1007/11925903_6","title":"Gene Assembly Algorithms for Ciliates","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Computer science; Coding (social sciences); Gene; Algorithm; Coding region; Heuristic; Theoretical computer science; Biology; Mathematics; Genetics; Artificial intelligence","score_opus":0.020294322320876496,"score_gpt":0.26163653968018563,"score_spread":0.24134221735930914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536047544","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.04682565,0.000524661,0.944005,0.00032945926,0.00006835886,0.00009228548,0.00019594532,0.0021600523,0.005798503],"genre_scores_gemma":[0.23550229,0.0004223279,0.7535487,0.00013288452,0.00007435501,0.00019634116,0.0012835021,0.0007358922,0.008103786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974936,0.00004739585,0.000016890826,0.00005880799,0.00007806255,0.000049388385],"domain_scores_gemma":[0.9992607,0.0003890425,0.00004782184,0.00010910654,0.00014555594,0.00004784145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388083,0.00069451757,0.001109019,0.00092694105,0.0012757836,0.0010625422,0.0017567221,0.0014714011,0.0050300723],"category_scores_gemma":[0.0025175188,0.0007406507,0.0013845849,0.0009797823,0.0006906396,0.0012162565,0.0017183446,0.0011537727,0.0015378593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022946707,0.000084199135,0.0021087336,0.00017135032,0.000077868346,0.00014102677,0.00033071617,0.55949503,0.0058713127,0.045118585,0.010698379,0.37567332],"study_design_scores_gemma":[0.000033441785,0.000021606635,0.00025204275,0.000017211287,0.000013171217,0.000032148597,0.00004050962,0.9602104,0.0012362009,0.03651131,0.0016255144,0.000006527785],"about_ca_topic_score_codex":0.005870774,"about_ca_topic_score_gemma":0.007175275,"teacher_disagreement_score":0.005870774,"about_ca_system_score_codex":0.000984513,"about_ca_system_score_gemma":0.0010319808,"threshold_uncertainty_score":0.016827226},"labels":[],"label_agreement":null},{"id":"W1536062251","doi":"10.1007/3-540-45813-1_7","title":"Fuzzy Sets, Multi-valued Mappings, and Rough Sets","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rough set; Computer science; Schema (genetic algorithms); Fuzzy logic; Fuzzy set; Artificial intelligence; Fuzzy set operations; Data mining; Machine learning","score_opus":0.0326078121531624,"score_gpt":0.25111862581650135,"score_spread":0.21851081366333897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536062251","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.018876323,0.36476433,0.39827517,0.009440286,0.004328347,0.00010419895,0.00044162964,0.00028230072,0.20348737],"genre_scores_gemma":[0.53405654,0.13780841,0.2640207,0.0021542013,0.0062059197,0.00036955756,0.00070078083,0.000089553694,0.054594375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988274,0.0003840782,0.00008407792,0.00014467827,0.0005088893,0.00005088585],"domain_scores_gemma":[0.99878937,0.0008282737,0.00011026358,0.00011580071,0.000114492956,0.000041820695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016059376,0.0009785155,0.0014665561,0.0020995212,0.0010449557,0.004745107,0.0009097605,0.0013388118,0.0038089317],"category_scores_gemma":[0.00456759,0.00051567913,0.00077081047,0.0036048652,0.0038397121,0.004850199,0.0010063478,0.0025473284,0.0007840556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011794645,0.00001313253,0.000096698976,0.00021066544,0.000019743671,0.00007003345,0.00029576797,0.002312312,0.0002397613,0.961701,0.0054968204,0.029532174],"study_design_scores_gemma":[0.0000035250378,0.000009616789,0.00014233182,0.00005713285,0.0000082636125,0.00008179706,0.000089231784,0.0023727422,0.000069129965,0.9783966,0.01876139,0.000008332588],"about_ca_topic_score_codex":0.0011791207,"about_ca_topic_score_gemma":0.0011649383,"teacher_disagreement_score":0.004745107,"about_ca_system_score_codex":0.001355521,"about_ca_system_score_gemma":0.00063752383,"threshold_uncertainty_score":0.012742221},"labels":[],"label_agreement":null},{"id":"W1536075984","doi":"10.1007/978-3-540-27824-5_49","title":"Flexible QoS Routing Protocol for Mobile Ad Hoc Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Computer network; Quality of service; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Wireless ad hoc network; Network packet; Optimized Link State Routing Protocol; Queuing delay; Routing protocol; Mobile QoS; Distributed computing; Ad hoc wireless distribution service; Queueing theory; Service (business); Wireless","score_opus":0.02200180455192185,"score_gpt":0.28410791243299155,"score_spread":0.2621061078810697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536075984","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.010658055,0.009359605,0.9451537,0.0010403167,0.0016174266,0.00019371406,0.0003114137,0.0031512,0.028514517],"genre_scores_gemma":[0.3478694,0.011865302,0.559453,0.0008689558,0.0010611444,0.0006256586,0.0018559949,0.000873444,0.07552713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969697,0.00005269067,0.000022496684,0.000039717208,0.0001494782,0.000038674516],"domain_scores_gemma":[0.9995413,0.00013524875,0.000028703716,0.00011154186,0.00015210877,0.000031115902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436041,0.00055791915,0.0004073034,0.00067420176,0.00060657033,0.00088783033,0.0013184149,0.0005831011,0.0032585599],"category_scores_gemma":[0.001101989,0.000281016,0.00025789425,0.0009216009,0.0004380692,0.0010485263,0.0007011607,0.0014456841,0.0010547206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023251191,0.00007985984,0.00030174453,0.0005315545,0.00005064909,0.00037335703,0.00032174922,0.030844701,0.05516018,0.1407321,0.056632522,0.714739],"study_design_scores_gemma":[0.00010821672,0.00045343212,0.001038614,0.00026789287,0.0001542653,0.0018696862,0.00023004651,0.2912353,0.034931786,0.14586298,0.5236734,0.00017437642],"about_ca_topic_score_codex":0.0009190872,"about_ca_topic_score_gemma":0.0012628295,"teacher_disagreement_score":0.0032585599,"about_ca_system_score_codex":0.0005072484,"about_ca_system_score_gemma":0.00046880776,"threshold_uncertainty_score":0.010900974},"labels":[],"label_agreement":null},{"id":"W1536098516","doi":"10.1007/3-540-36579-6_12","title":"Scaling Java Points-to Analysis Using Spark","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":430,"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":"SPARK (programming language); Computer science; Java; Modular design; Implementation; Scala; Graph; Scaling; Theoretical computer science; Programming language; Mathematics","score_opus":0.030142607051338765,"score_gpt":0.26493284019966856,"score_spread":0.2347902331483298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536098516","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.060341522,0.0012283777,0.74058235,0.0006907526,0.00091597164,0.00022429839,0.0017684784,0.16273314,0.03151507],"genre_scores_gemma":[0.43233803,0.00065122795,0.5257217,0.00057087146,0.00030463436,0.00034752997,0.0051119835,0.022659563,0.012294434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588156,0.00062578934,0.0002814892,0.00081174413,0.0019553688,0.00044398938],"domain_scores_gemma":[0.99337375,0.001925233,0.00023377019,0.0025864416,0.0016089008,0.0002719543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021411178,0.0018920593,0.001910595,0.0029623075,0.0012452198,0.003252627,0.0029518032,0.00082261756,0.0154266525],"category_scores_gemma":[0.012309108,0.0009812337,0.0016962586,0.0032146287,0.0008570575,0.004810581,0.002727438,0.002375252,0.0057565803],"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.0021156904,0.0007643109,0.009108497,0.0006489946,0.00047025384,0.00020132618,0.00056363636,0.06548176,0.030214984,0.06752646,0.11292784,0.70997626],"study_design_scores_gemma":[0.0004423661,0.00021530373,0.002931088,0.00011608664,0.0002771121,0.00021871827,0.0003028948,0.73513204,0.04996506,0.15062732,0.059603725,0.000168257],"about_ca_topic_score_codex":0.006173604,"about_ca_topic_score_gemma":0.006644083,"teacher_disagreement_score":0.0154266525,"about_ca_system_score_codex":0.0012147265,"about_ca_system_score_gemma":0.0023028508,"threshold_uncertainty_score":0.05160731},"labels":[],"label_agreement":null},{"id":"W1536129331","doi":"10.1007/978-3-642-14203-1_2","title":"Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":108,"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":"Mathematical proof; Computer science; Programming language; Abstract syntax; Syntax; Beluga Whale; Axiom; Compiler; Debugging; Theoretical computer science; Artificial intelligence; Semantics (computer science); Mathematics","score_opus":0.01865205842879661,"score_gpt":0.23836976032286716,"score_spread":0.21971770189407056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536129331","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.0006074176,0.0010873824,0.98199505,0.00045461403,0.0001185745,0.00008772602,0.00072989723,0.004252987,0.010666363],"genre_scores_gemma":[0.037026808,0.0020126884,0.9443666,0.0005116963,0.00017766106,0.00040870853,0.0022427365,0.0012621037,0.011991013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974233,0.0008585522,0.00026574876,0.0003591456,0.00086349214,0.00022984429],"domain_scores_gemma":[0.99854004,0.00075388054,0.000073092364,0.00031494867,0.00022612004,0.00009183623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034371468,0.0017518138,0.0014706111,0.0027306008,0.0016300613,0.007292098,0.0057244115,0.0018129427,0.016666688],"category_scores_gemma":[0.0044056126,0.0022468977,0.0038466179,0.0031441133,0.0038302303,0.011172815,0.003966806,0.0059046224,0.006421339],"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.000037744656,0.00002046134,0.00008920652,0.00043119624,0.000024016754,0.00008323523,0.00035492517,0.0037924126,0.00057682284,0.92772424,0.012737851,0.054127827],"study_design_scores_gemma":[0.00004143063,0.000026501442,0.00008821178,0.00017696271,0.000055554527,0.00020254732,0.00009627105,0.03406154,0.0018890374,0.75631803,0.20699243,0.000051386985],"about_ca_topic_score_codex":0.011752174,"about_ca_topic_score_gemma":0.012451423,"teacher_disagreement_score":0.016666688,"about_ca_system_score_codex":0.002797614,"about_ca_system_score_gemma":0.0027711857,"threshold_uncertainty_score":0.055755615},"labels":[],"label_agreement":null},{"id":"W1536146564","doi":"10.1007/978-3-540-69057-3_83","title":"Haptic Feedback Based on Physically Based Modeling for Cellular Manipulation Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Mechanics and Interactions","field":"Biochemistry, Genetics and Molecular Biology","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":"Toronto Metropolitan University","funders":"","keywords":"Haptic technology; Computer science; Rendering (computer graphics); Stereotaxy; Simulation; Virtual reality; Artificial intelligence; Computer vision; Human–computer interaction; Computer graphics (images)","score_opus":0.022550584317285908,"score_gpt":0.236122572504989,"score_spread":0.2135719881877031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536146564","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.008847664,0.0004903628,0.9834757,0.00019254707,0.00014626377,0.000033226326,0.00003769006,0.00088801875,0.0058885505],"genre_scores_gemma":[0.7445138,0.001366914,0.2318805,0.00017519624,0.00012290217,0.00017468938,0.00015378075,0.00024711955,0.021365188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979085,0.00003338286,0.000009564131,0.000022986698,0.00013155393,0.000011633526],"domain_scores_gemma":[0.9997999,0.00011268742,0.000018890345,0.000030955813,0.000029175324,0.000008435718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019374411,0.00051493774,0.00061848643,0.00024540926,0.00025555282,0.00076882244,0.0008292857,0.000919307,0.0048360466],"category_scores_gemma":[0.00073225703,0.0003113357,0.000497886,0.0002247262,0.00041013162,0.0007597176,0.0006834167,0.00057084643,0.00072645955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022902341,0.00013033708,0.00022110602,0.00039017838,0.000044654164,0.00043787487,0.0003048856,0.59129417,0.18602759,0.049317736,0.004455399,0.16714692],"study_design_scores_gemma":[0.000011908567,0.000048816644,0.00011270961,0.000010891957,0.0000072579396,0.00008249786,0.000008784528,0.9868715,0.004615236,0.0050379657,0.0031800487,0.000012358529],"about_ca_topic_score_codex":0.0012495928,"about_ca_topic_score_gemma":0.0010676653,"teacher_disagreement_score":0.0048360466,"about_ca_system_score_codex":0.00027595263,"about_ca_system_score_gemma":0.00020018421,"threshold_uncertainty_score":0.01617819},"labels":[],"label_agreement":null},{"id":"W1536157588","doi":"10.1007/978-3-540-74615-7_5","title":"Rule Interchange on the Web","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"World Wide Web; Computer science","score_opus":0.052075355675616004,"score_gpt":0.27466585247669645,"score_spread":0.22259049680108045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536157588","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.0068898615,0.004431613,0.8647995,0.001892092,0.00077236706,0.000201885,0.0006810592,0.0046973503,0.11563427],"genre_scores_gemma":[0.11950949,0.008627364,0.76457804,0.001089285,0.000557682,0.00049293565,0.005641678,0.002138362,0.097365156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665606,0.0010211782,0.00042089168,0.00041815112,0.001339693,0.00014388765],"domain_scores_gemma":[0.99704033,0.00115358,0.000065996115,0.001291723,0.00036468264,0.000083681014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033044775,0.00083980116,0.0012831033,0.003065835,0.0016526388,0.007490979,0.0030416357,0.0020604685,0.012827214],"category_scores_gemma":[0.005779901,0.0009997821,0.0014705523,0.004671854,0.0022982017,0.01147713,0.0038283316,0.0027841085,0.007519618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005801571,0.00008860717,0.00019287402,0.00021351206,0.000052951662,0.00031718475,0.00041629715,0.0058530993,0.0019524058,0.6270489,0.02284582,0.3409603],"study_design_scores_gemma":[0.000024894027,0.000021157855,0.00015394378,0.00016205442,0.000044397453,0.00031472286,0.000119437325,0.031428464,0.005457331,0.7591792,0.20306662,0.000027805561],"about_ca_topic_score_codex":0.0021869359,"about_ca_topic_score_gemma":0.002011793,"teacher_disagreement_score":0.012827214,"about_ca_system_score_codex":0.0010603635,"about_ca_system_score_gemma":0.0011712037,"threshold_uncertainty_score":0.04291129},"labels":[],"label_agreement":null},{"id":"W1536212463","doi":"10.1007/978-3-540-77092-3_43","title":"Extraction and Classification of User Behavior","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Markov chain; Generator (circuit theory); Artificial neural network; User group; Artificial intelligence; Human–computer interaction; Machine learning; Multimedia; Power (physics)","score_opus":0.041530658813898766,"score_gpt":0.29418579905001263,"score_spread":0.25265514023611385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536212463","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.43655634,0.0044073644,0.45831525,0.0011592102,0.00039112393,0.00089747744,0.053980574,0.020574113,0.023718547],"genre_scores_gemma":[0.68075955,0.0018824508,0.24168172,0.00019973819,0.0002784829,0.00044882458,0.050437555,0.00051086105,0.023800755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929595,0.000117687436,0.00006582003,0.0001826593,0.00024073165,0.00009702702],"domain_scores_gemma":[0.99845505,0.0006350846,0.0001554177,0.0002139418,0.00043450345,0.00010596706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055589835,0.0007818755,0.00074030913,0.0055500646,0.00044215992,0.0011152168,0.00061067584,0.0005707045,0.0030888752],"category_scores_gemma":[0.002313534,0.00021153898,0.0008359298,0.003266457,0.00018041601,0.0010288601,0.0005128185,0.00058893906,0.004855417],"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.00042838548,0.0004570397,0.075009175,0.00042468382,0.00010874586,0.00021392027,0.00044244734,0.0014474938,0.030419143,0.0016344712,0.0216342,0.86778027],"study_design_scores_gemma":[0.00006531375,0.0008441558,0.45025447,0.00047786772,0.0005052702,0.0028517793,0.001827003,0.35455716,0.0977488,0.012737517,0.07790703,0.00022367528],"about_ca_topic_score_codex":0.005793841,"about_ca_topic_score_gemma":0.010605451,"teacher_disagreement_score":0.005793841,"about_ca_system_score_codex":0.00035849834,"about_ca_system_score_gemma":0.00067778566,"threshold_uncertainty_score":0.011520207},"labels":[],"label_agreement":null},{"id":"W1536214186","doi":"10.1007/11559573_74","title":"Probabilistic Similarity Measures in Image Databases with SVM Based Categorization and Relevance Feedback","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Relevance feedback; Pattern recognition (psychology); Support vector machine; Artificial intelligence; Probabilistic logic; Image retrieval; Similarity measure; Data mining; Classifier (UML); Image (mathematics)","score_opus":0.023975241489131608,"score_gpt":0.2511755320630891,"score_spread":0.22720029057395752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536214186","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.0124570215,0.0018163939,0.9842168,0.0001304553,0.00006865188,0.000056220124,0.00008489633,0.0005824557,0.00058702735],"genre_scores_gemma":[0.41426715,0.001468773,0.5805965,0.00010859969,0.00026231885,0.0002334058,0.0005913228,0.00014379481,0.0023281157],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594265,0.0011702208,0.00042257755,0.0005932783,0.0017163623,0.00015490661],"domain_scores_gemma":[0.9973635,0.001098257,0.0002305642,0.0004728182,0.0007823704,0.000052512914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029305497,0.0005159722,0.0020275358,0.0020919272,0.00044455598,0.0018671135,0.001958011,0.0011320577,0.0013335237],"category_scores_gemma":[0.0097359475,0.0005000696,0.0010999502,0.003448279,0.0006372917,0.0036735018,0.0014463636,0.0012099976,0.00082421815],"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.0003795928,0.00019279566,0.00088266475,0.00037648866,0.00010902089,0.00006037506,0.000111400805,0.071126126,0.0105221905,0.019688796,0.0054161013,0.8911344],"study_design_scores_gemma":[0.00002338419,0.00015497429,0.0011255014,0.00002863643,0.00004050719,0.00019924233,0.000038686565,0.9613879,0.005700585,0.029462958,0.0018061261,0.00003158376],"about_ca_topic_score_codex":0.0018651249,"about_ca_topic_score_gemma":0.0014526393,"teacher_disagreement_score":0.0029305497,"about_ca_system_score_codex":0.00095137017,"about_ca_system_score_gemma":0.0006238805,"threshold_uncertainty_score":0.0154984},"labels":[],"label_agreement":null},{"id":"W1536221388","doi":"10.1007/11866565_109","title":"A New Method for CT to Fluoroscope Registration Based on Unscented Kalman Filter","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Queen's University","funders":"","keywords":"Computer science; Kalman filter; Artificial intelligence; Simplex; Computation; Computer vision; Extended Kalman filter; Range (aeronautics); Filter (signal processing); Algorithm; Mathematics","score_opus":0.022639572472208463,"score_gpt":0.35499440808709715,"score_spread":0.33235483561488866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536221388","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.0007278458,0.00009505568,0.99857974,0.000018832632,0.000053653475,0.000014564893,0.000011619656,0.00033957124,0.00015908253],"genre_scores_gemma":[0.024287825,0.00025745927,0.9724751,0.000051475352,0.00007340318,0.00008086386,0.00009994767,0.00014143705,0.0025325413],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988181,0.00015322286,0.000075337666,0.00030121385,0.0005974897,0.000054581997],"domain_scores_gemma":[0.9990735,0.0002582734,0.00008022116,0.00012345264,0.00042031557,0.00004417475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048241,0.0008933282,0.001394897,0.001208079,0.0006591326,0.0011252617,0.0014166813,0.0013988029,0.0031563158],"category_scores_gemma":[0.002112384,0.0009975372,0.0012372372,0.0010644571,0.00053089496,0.0016118637,0.0013544493,0.0012701602,0.0018489347],"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.00027283243,0.000107393535,0.0009829552,0.00030207576,0.00026707124,0.000179316,0.00021125225,0.049099877,0.089426674,0.00902362,0.004578195,0.84554875],"study_design_scores_gemma":[0.00005110123,0.00011839971,0.001075178,0.000024883147,0.00013158967,0.00045739516,0.000026833657,0.9511037,0.03026684,0.002317441,0.014331122,0.0000955285],"about_ca_topic_score_codex":0.005664993,"about_ca_topic_score_gemma":0.008677631,"teacher_disagreement_score":0.005664993,"about_ca_system_score_codex":0.0006070235,"about_ca_system_score_gemma":0.0015276574,"threshold_uncertainty_score":0.011264086},"labels":[],"label_agreement":null},{"id":"W1536228797","doi":"10.1007/978-3-540-39899-8_79","title":"Automatic Identification and Localization of Craniofacial Landmarks Using Multi Layer Neural Network","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dental Radiography and Imaging","field":"Dentistry","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 Windsor","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Preprocessor; Landmark; Pattern recognition (psychology); Artificial neural network; Craniofacial; Feature extraction","score_opus":0.021010757418744964,"score_gpt":0.2700444766835953,"score_spread":0.24903371926485035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536228797","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.055860832,0.0010052024,0.93561834,0.00012384234,0.00012636141,0.00007711959,0.00031919507,0.0042265975,0.002642586],"genre_scores_gemma":[0.48739386,0.0007940761,0.5010517,0.0001079753,0.0000482748,0.00014247779,0.0008998255,0.00019873469,0.009363029],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978775,0.000017286306,0.00001197086,0.000079278114,0.000061479506,0.00004230945],"domain_scores_gemma":[0.9997427,0.000074559095,0.000036955775,0.000035719877,0.0000978698,0.00001222615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000460887,0.0008720895,0.0008445792,0.0009254554,0.00039779078,0.0006652536,0.0011715741,0.0009052796,0.0026205634],"category_scores_gemma":[0.00076291163,0.0006027823,0.0006739547,0.000939153,0.00026287918,0.000672045,0.0007144432,0.0007799381,0.0012122523],"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.00027892695,0.00007947545,0.0021196597,0.000095414296,0.00005579321,0.00015188703,0.000052992124,0.06192463,0.052111786,0.0009108947,0.0031920434,0.8790264],"study_design_scores_gemma":[0.000015520925,0.00006540059,0.0051926184,0.000027675957,0.0000498966,0.00017741494,0.000033590804,0.96405977,0.027971674,0.0010530853,0.0013258285,0.000027502172],"about_ca_topic_score_codex":0.011088243,"about_ca_topic_score_gemma":0.018170021,"teacher_disagreement_score":0.011088243,"about_ca_system_score_codex":0.0004648006,"about_ca_system_score_gemma":0.000827566,"threshold_uncertainty_score":0.0220474},"labels":[],"label_agreement":null},{"id":"W1536265389","doi":"10.1007/3-540-46423-9_2","title":"Optimizing Java Bytecode Using the Soot Framework: Is It Feasible?","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":313,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bytecode; Java bytecode; Computer science; Java; Programming language; Java annotation; Class (philosophy); Generics in Java; Program optimization; Java applet; Operating system; Compiler; Artificial intelligence","score_opus":0.05289934935660727,"score_gpt":0.30319578851342266,"score_spread":0.2502964391568154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536265389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102399394,0.003654298,0.83425856,0.0035608197,0.0005343759,0.00008674145,0.00020554457,0.026775414,0.02852483],"genre_scores_gemma":[0.5190296,0.0020888224,0.45905653,0.00064208533,0.00015870295,0.00008102616,0.00050336757,0.006222447,0.012217349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861526,0.00031692337,0.000056121175,0.00018160178,0.0005206033,0.00030956444],"domain_scores_gemma":[0.99727684,0.0009661342,0.00017332293,0.0009676834,0.0005208286,0.000095184216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011519503,0.0009612363,0.0010742081,0.0004554459,0.00043383948,0.0015864681,0.0017244107,0.00096383796,0.005710925],"category_scores_gemma":[0.0052539846,0.0005940288,0.00091968034,0.00070184993,0.00087808596,0.0048975237,0.0007802619,0.0015451772,0.0018764373],"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.0009462987,0.00029500376,0.004262058,0.0005423957,0.00017498924,0.0001403301,0.00020164085,0.05462862,0.030804036,0.10709894,0.024142789,0.7767628],"study_design_scores_gemma":[0.00025907747,0.00047279685,0.0032756007,0.000291982,0.00031474076,0.00039419375,0.00032516767,0.636728,0.078263976,0.21282609,0.06670976,0.00013861124],"about_ca_topic_score_codex":0.003691611,"about_ca_topic_score_gemma":0.005886809,"teacher_disagreement_score":0.005710925,"about_ca_system_score_codex":0.00052595796,"about_ca_system_score_gemma":0.001530004,"threshold_uncertainty_score":0.019104958},"labels":[],"label_agreement":null},{"id":"W1536271794","doi":"10.1007/978-3-540-75187-8_7","title":"Comprehensive Triangular Decomposition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":94,"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":"Disjoint sets; Computer science; Polynomial; Parametric statistics; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics","score_opus":0.022340740939051473,"score_gpt":0.2754742945676292,"score_spread":0.2531335536285777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536271794","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009523802,0.0017172961,0.26271224,0.00081656245,0.0009226887,0.00008890479,0.0008335715,0.0009103585,0.72247463],"genre_scores_gemma":[0.22223584,0.0028899773,0.17919685,0.0008179305,0.0010484857,0.00018211159,0.0038013984,0.0012966334,0.5885308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971837,0.000031497755,0.000010692071,0.00005595613,0.0001453885,0.000038064114],"domain_scores_gemma":[0.9997905,0.000026923646,0.000010094664,0.00006584927,0.000080600774,0.000026019548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766375,0.00059014966,0.00055986375,0.0009798757,0.0008715691,0.0017171231,0.0006852686,0.00041513075,0.05253354],"category_scores_gemma":[0.0006376548,0.00033235102,0.00054115057,0.0011299665,0.00096393254,0.001779239,0.0011833288,0.001937587,0.017622426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002211674,0.00002326287,0.00006324312,0.00008290586,0.000007908546,0.000042683852,0.00011914968,0.0016082969,0.0021043126,0.8370064,0.052159086,0.10676062],"study_design_scores_gemma":[0.000008705696,0.000017886181,0.00014765476,0.000035232293,0.000011099101,0.00014250175,0.000071426446,0.005951086,0.0015586478,0.82546026,0.16658351,0.000012000429],"about_ca_topic_score_codex":0.00079063897,"about_ca_topic_score_gemma":0.00193916,"teacher_disagreement_score":0.05253354,"about_ca_system_score_codex":0.0007141427,"about_ca_system_score_gemma":0.0005890636,"threshold_uncertainty_score":0.17574221},"labels":[],"label_agreement":null},{"id":"W1536307206","doi":"10.1007/978-3-540-30228-5_11","title":"Developing a Minimalist Parser for Free Word Order Languages with Discontinuous Constituency","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"Computer science; Parsing; Word order; Natural language processing; Artificial intelligence; Sentence; Top-down parsing; Parser combinator; Sketch; Phrase; Word (group theory); Linguistics; Algorithm","score_opus":0.015222180761953892,"score_gpt":0.2695471241693817,"score_spread":0.2543249434074278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536307206","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.015618175,0.00015778025,0.9460693,0.00067769154,0.00015533481,0.00021976636,0.0014127498,0.030162102,0.005527121],"genre_scores_gemma":[0.13421112,0.0002240534,0.84243333,0.0004003733,0.00013554384,0.00028953396,0.0066638454,0.00699076,0.0086514875],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988416,0.00024334552,0.00012887662,0.0003745339,0.00027149665,0.00014019302],"domain_scores_gemma":[0.9959526,0.0025826192,0.00013427783,0.00045624364,0.0007783491,0.00009592552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015580835,0.0010708123,0.0016238891,0.0012578286,0.0015142534,0.0037100455,0.002940488,0.0018538206,0.014104348],"category_scores_gemma":[0.0053995405,0.0027948243,0.0019496434,0.0014386347,0.0012514335,0.006744322,0.004075838,0.0038496086,0.007884741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003938516,0.0003265213,0.0028678095,0.0013212402,0.00021348082,0.0015142142,0.0028435227,0.03192169,0.05067798,0.23578034,0.08014835,0.59199095],"study_design_scores_gemma":[0.00018808259,0.00017366502,0.0011021327,0.00018163159,0.0003397188,0.0010366556,0.0012307537,0.52669275,0.07564668,0.30913565,0.08406915,0.00020307563],"about_ca_topic_score_codex":0.004076831,"about_ca_topic_score_gemma":0.010537322,"teacher_disagreement_score":0.014104348,"about_ca_system_score_codex":0.0014108329,"about_ca_system_score_gemma":0.003376858,"threshold_uncertainty_score":0.047183692},"labels":[],"label_agreement":null},{"id":"W1536365843","doi":"10.1007/978-3-540-74510-5_41","title":"Generic Complexity of Undecidable Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Decidability; Turing machine; Halting problem; Construct (python library); Word problem (mathematics education); Mathematics; Computational complexity theory; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Arithmetic; Programming language","score_opus":0.07644337339592297,"score_gpt":0.27647507757776096,"score_spread":0.200031704181838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536365843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22226357,0.005670351,0.5522642,0.015470366,0.0004863506,0.00043307152,0.0037265106,0.001712684,0.19797283],"genre_scores_gemma":[0.87953323,0.0035465015,0.086940184,0.0014991184,0.0011594353,0.00066193484,0.005827269,0.0006275177,0.020204885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935091,0.0014348038,0.00042920528,0.0014211753,0.0023142917,0.0008913306],"domain_scores_gemma":[0.9827339,0.012611976,0.0007777171,0.0025462853,0.0007158638,0.00061411544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035973266,0.0016391105,0.0023208945,0.0029943474,0.002717853,0.009238876,0.0058055115,0.0035797972,0.013039217],"category_scores_gemma":[0.017901754,0.0015004756,0.004035706,0.004961993,0.0072456244,0.022221992,0.005904989,0.009846782,0.001074942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007889196,0.00005439821,0.0004448671,0.0002042346,0.000039833783,0.00006401753,0.00021598542,0.00958958,0.00038481937,0.9734596,0.0030880722,0.0123756],"study_design_scores_gemma":[0.000022663256,0.0000057239536,0.000147846,0.000016750024,0.000016030535,0.00005362523,0.000030354684,0.009442287,0.00023324192,0.9882682,0.0017562793,0.0000070324363],"about_ca_topic_score_codex":0.0017374305,"about_ca_topic_score_gemma":0.0017801643,"teacher_disagreement_score":0.013039217,"about_ca_system_score_codex":0.0059083346,"about_ca_system_score_gemma":0.0019411304,"threshold_uncertainty_score":0.043620586},"labels":[],"label_agreement":null},{"id":"W1536395354","doi":"10.1007/3-540-40026-5_24","title":"Short Headers Suffice for Communication in a DAG with Link Failures","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Toronto","funders":"","keywords":"Computer science; Queue; Directed acyclic graph; Link (geometry); Computer network; Enhanced Data Rates for GSM Evolution; Graph; Telecommunications network; Theoretical computer science; Distributed computing; Parallel computing; Algorithm; Telecommunications","score_opus":0.018298761677425807,"score_gpt":0.25196729811038265,"score_spread":0.23366853643295685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536395354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03730184,0.002272498,0.78731054,0.0055474457,0.023579286,0.0014873552,0.022669876,0.040386193,0.079445004],"genre_scores_gemma":[0.29635474,0.002952427,0.4712228,0.005900404,0.0056981174,0.0026989286,0.035040848,0.027379515,0.15275224],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988017,0.0002381882,0.00024699979,0.00023063434,0.00019425582,0.00028833994],"domain_scores_gemma":[0.9824425,0.007398204,0.0014283789,0.0052261227,0.0027965272,0.0007083451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102354,0.0020713443,0.001223873,0.0014582416,0.0019878906,0.0026435242,0.0011404847,0.002515302,0.053982075],"category_scores_gemma":[0.013859405,0.0012580401,0.0007714034,0.0022997698,0.0012682605,0.006521588,0.00255866,0.0034582927,0.027125534],"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.002729826,0.00046935378,0.00148076,0.0021801337,0.00008576939,0.0016692717,0.0010323218,0.0129404785,0.036877107,0.25013435,0.31115952,0.3792411],"study_design_scores_gemma":[0.00018844784,0.00047646833,0.00065315445,0.00043641476,0.000128486,0.0007716354,0.00040339504,0.013034008,0.033599272,0.19559714,0.7545989,0.00011271736],"about_ca_topic_score_codex":0.0004985126,"about_ca_topic_score_gemma":0.0005965002,"teacher_disagreement_score":0.053982075,"about_ca_system_score_codex":0.0005642255,"about_ca_system_score_gemma":0.0010418136,"threshold_uncertainty_score":0.18058807},"labels":[],"label_agreement":null},{"id":"W1536491757","doi":"10.1007/3-540-45868-9_8","title":"User Interfaces for On-Line Diagram Recognition","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Queen's University","funders":"","keywords":"Computer science; Diagram; User interface; Line (geometry); Human–computer interaction; Computer graphics (images); Programming language; Database; Geometry","score_opus":0.04249097015294622,"score_gpt":0.2830589086682049,"score_spread":0.24056793851525865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536491757","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.0064127543,0.00068371405,0.8576069,0.0001420458,0.00021732892,0.00022164115,0.0021820252,0.114367,0.01816669],"genre_scores_gemma":[0.11570428,0.0013656814,0.7286897,0.0009327986,0.00017663027,0.001170126,0.009574479,0.014015255,0.128371],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966216,0.00006563062,0.00003305658,0.00005378011,0.00014814439,0.00003730021],"domain_scores_gemma":[0.99884534,0.0005860992,0.000043050593,0.00023261971,0.00022841258,0.00006445518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045937332,0.0018499478,0.0009880451,0.0011102288,0.0003231178,0.0015438845,0.0017019827,0.0014076995,0.15449847],"category_scores_gemma":[0.0025350715,0.00061413617,0.00058601424,0.00093962735,0.00020046099,0.0019252698,0.0020377676,0.0007315724,0.04244383],"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.0009555462,0.00017546085,0.0005063835,0.00056402583,0.000046477293,0.0003534004,0.0003200288,0.00145774,0.05401236,0.0070250877,0.15698603,0.7775975],"study_design_scores_gemma":[0.00050700275,0.00048876135,0.003116102,0.0006085969,0.00021660345,0.0026692348,0.00042120184,0.20491116,0.1458316,0.019731546,0.62127995,0.00021822071],"about_ca_topic_score_codex":0.0011655682,"about_ca_topic_score_gemma":0.0020882695,"teacher_disagreement_score":0.15449847,"about_ca_system_score_codex":0.00026815003,"about_ca_system_score_gemma":0.00015323942,"threshold_uncertainty_score":0.5168489},"labels":[],"label_agreement":null},{"id":"W1536516579","doi":"10.1007/978-3-540-85988-8_77","title":"Surface-Based Texture and Morphological Analysis Detects Subtle Cortical Dysplasia","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Cortical dysplasia; Computer science; Artificial intelligence; Epilepsy; Pattern recognition (psychology); Classifier (UML); Magnetic resonance imaging; Medicine; Radiology","score_opus":0.013785132927842747,"score_gpt":0.2745169037538729,"score_spread":0.26073177082603016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536516579","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.97627115,0.00046323717,0.021705415,0.000111728026,0.000026441156,0.000026440928,0.00016069852,0.0001991359,0.0010356337],"genre_scores_gemma":[0.9884707,0.0003124114,0.010369634,0.00003412054,0.00002656553,0.000010191862,0.000105869956,0.000079217505,0.0005912898],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998646,0.000014709064,0.000013819125,0.000016931028,0.00006197391,0.00002793652],"domain_scores_gemma":[0.99911684,0.00030157962,0.00014732355,0.00006452745,0.0002788478,0.000090902955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031928305,0.00033740397,0.00056792947,0.0032706482,0.00015460128,0.0008149947,0.0003360672,0.0006454736,0.0018888788],"category_scores_gemma":[0.00191149,0.00028744322,0.0002752408,0.0011893236,0.00034032177,0.0007060862,0.0003772696,0.0002935141,0.00040064374],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002425765,0.00010504298,0.110905804,0.0002713002,0.00012630453,0.0021315129,0.00019548905,0.002121272,0.617992,0.0004182316,0.00080356427,0.26250377],"study_design_scores_gemma":[0.00021653344,0.00082590483,0.69151586,0.00008840345,0.00042104238,0.03147834,0.0011962841,0.110562615,0.15866114,0.0027094095,0.0022197554,0.00010480954],"about_ca_topic_score_codex":0.0017736575,"about_ca_topic_score_gemma":0.0028542355,"teacher_disagreement_score":0.0032706482,"about_ca_system_score_codex":0.000121088065,"about_ca_system_score_gemma":0.00024786044,"threshold_uncertainty_score":0.006318927},"labels":[],"label_agreement":null},{"id":"W1536571263","doi":"10.1007/3-540-70659-3_45","title":"Comparison of Two Classification Methodologies on a Real-World Biomedical Problem","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"National Research Council Institute for Biodiagnostics","funders":"","keywords":"Computer science; Classifier (UML); Perceptron; Artificial intelligence; Pattern recognition (psychology); Linear discriminant analysis; Quadratic classifier; Exploit; Machine learning; Discriminant; Feature extraction; Linear classifier; Data mining; Artificial neural network","score_opus":0.13739427996515102,"score_gpt":0.3827225927617744,"score_spread":0.24532831279662337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536571263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24640974,0.019382054,0.7127026,0.0023137399,0.0015634033,0.0006237275,0.0009471611,0.0023883656,0.01366932],"genre_scores_gemma":[0.50833493,0.0042596995,0.47653854,0.00069211406,0.00050987565,0.00033483902,0.002221763,0.00029656917,0.006811669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970938,0.0010740478,0.00028456285,0.00041349357,0.0009083321,0.0002258074],"domain_scores_gemma":[0.98438245,0.011181368,0.00038301994,0.0005818979,0.0031247837,0.00034650552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069477097,0.0014488195,0.0015138087,0.003875317,0.0007792361,0.002570483,0.0016942685,0.0026138506,0.002500827],"category_scores_gemma":[0.013272857,0.00023851827,0.0010982172,0.0024701403,0.00054991164,0.0018033809,0.0014194152,0.0009935251,0.0007883598],"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.0019691214,0.0008189034,0.007362717,0.00090955914,0.0005916427,0.00013956091,0.00030993874,0.045921583,0.0049523185,0.0036384931,0.008794781,0.9245914],"study_design_scores_gemma":[0.00037697947,0.0013049282,0.01355528,0.00021617493,0.00049328856,0.00049549894,0.0006953669,0.96031135,0.008331509,0.0067514903,0.0073851105,0.00008295692],"about_ca_topic_score_codex":0.0041778,"about_ca_topic_score_gemma":0.005328287,"teacher_disagreement_score":0.0069477097,"about_ca_system_score_codex":0.00094898115,"about_ca_system_score_gemma":0.0013468728,"threshold_uncertainty_score":0.036743462},"labels":[],"label_agreement":null},{"id":"W1536575850","doi":"10.1007/11424918_7","title":"Planning for a Mobile Robot to Attend a Conference","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Desk; Robot; Mobile robot; Motion planning; Human–computer interaction; Artificial intelligence; Automated planning and scheduling; Robotics; Operations research; Engineering management; Multimedia; Engineering","score_opus":0.033563089086928115,"score_gpt":0.28057479871134194,"score_spread":0.24701170962441382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536575850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0818733,0.0006663354,0.6790577,0.0045675677,0.0006178843,0.00070753956,0.0005636647,0.0041973838,0.22774865],"genre_scores_gemma":[0.6065547,0.00042946462,0.31125033,0.0002294109,0.00007322804,0.00042630866,0.0006920227,0.00020242989,0.080142066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987566,0.000021116783,0.000004460422,0.000036891004,0.0000289247,0.000032973618],"domain_scores_gemma":[0.9998454,0.000037448524,0.000011960344,0.000017048531,0.000030595624,0.000057538567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001942737,0.0004660142,0.00021623829,0.00044279214,0.0017786219,0.0010516058,0.000745707,0.00083984033,0.022271313],"category_scores_gemma":[0.0008133697,0.00038887677,0.0005616704,0.00031984452,0.0004548771,0.001034971,0.0010151733,0.00088918867,0.002633448],"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.0009075572,0.00039806226,0.0041639516,0.0004396154,0.00009645858,0.0017249269,0.0013356318,0.29390827,0.020040402,0.19238259,0.08848148,0.39612097],"study_design_scores_gemma":[0.00017573444,0.00047428388,0.002083875,0.00014136962,0.00008345072,0.00040925658,0.0022016007,0.7353175,0.010860843,0.12272518,0.1254237,0.00010318911],"about_ca_topic_score_codex":0.012042007,"about_ca_topic_score_gemma":0.0258053,"teacher_disagreement_score":0.022271313,"about_ca_system_score_codex":0.0007225743,"about_ca_system_score_gemma":0.0016798866,"threshold_uncertainty_score":0.07450491},"labels":[],"label_agreement":null},{"id":"W1536631555","doi":"10.1007/978-3-642-28872-2_16","title":"Language Independent Refinement Using Partial Modeling","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Unified Modeling Language; Class diagram; Sequence diagram; Modeling language; Domain (mathematical analysis); Use Case Diagram; Expression (computer science); Class (philosophy); Key (lock); Programming language; Process (computing); Sequence (biology); Theoretical computer science; Artificial intelligence; Software","score_opus":0.02908888954304066,"score_gpt":0.2646395623505765,"score_spread":0.23555067280753583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536631555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020817877,0.00006863324,0.99239904,0.000040619703,0.000022494865,0.000039340353,0.000032073527,0.0011558755,0.0041602785],"genre_scores_gemma":[0.12404985,0.00034794677,0.86139727,0.00012093411,0.000031903197,0.00023275294,0.0005460269,0.0016036583,0.011669707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975527,0.0006865856,0.00014689736,0.00031884408,0.0011262082,0.00016884627],"domain_scores_gemma":[0.9967194,0.0009861246,0.000095356096,0.00165306,0.0004968624,0.00004905825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00190795,0.0010689334,0.000892724,0.0010967336,0.0008311508,0.0011011002,0.0022148823,0.0007014541,0.006142524],"category_scores_gemma":[0.0048535396,0.0012192468,0.0024802457,0.0010077419,0.0015009829,0.002842592,0.0033828185,0.0023456104,0.002656059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017455859,0.00012307226,0.0006340696,0.0005004126,0.00013661562,0.0003762604,0.00086953206,0.07805248,0.03582285,0.51333624,0.005990686,0.36398324],"study_design_scores_gemma":[0.000064663385,0.000114575036,0.0002560088,0.00010122674,0.00020542378,0.00039685352,0.00014882247,0.46707407,0.053155333,0.4223338,0.056081146,0.00006811146],"about_ca_topic_score_codex":0.002341638,"about_ca_topic_score_gemma":0.0036753037,"teacher_disagreement_score":0.006142524,"about_ca_system_score_codex":0.0006095007,"about_ca_system_score_gemma":0.0013397156,"threshold_uncertainty_score":0.02054882},"labels":[],"label_agreement":null},{"id":"W1536638548","doi":"10.1007/978-3-642-14770-8_36","title":"Using Comparable Corpora to Improve the Effectiveness of Cross-Language Information Retrieval","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Natural language processing; Cross-language information retrieval; Terminology; Artificial intelligence; Information retrieval; Focus (optics); Selection (genetic algorithm); Machine translation; Point (geometry); Ambiguity; Text corpus; Linguistics","score_opus":0.014605610077631628,"score_gpt":0.2992259525697489,"score_spread":0.28462034249211726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536638548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23987865,0.037025854,0.45597744,0.0063441144,0.010281141,0.0045362287,0.054418497,0.056686748,0.13485125],"genre_scores_gemma":[0.31157723,0.008110849,0.49462655,0.0020564662,0.0019069513,0.0018685521,0.15464473,0.0062661613,0.018942572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9867322,0.0063477755,0.001960056,0.0020312055,0.0024586332,0.0004700939],"domain_scores_gemma":[0.9545796,0.024000287,0.0009660532,0.0091423225,0.010720533,0.000591227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014052716,0.0027207823,0.0030742895,0.01607631,0.003261031,0.006320552,0.0031770093,0.0023913144,0.028205547],"category_scores_gemma":[0.066834,0.001290571,0.001677514,0.013095838,0.0011878693,0.013311733,0.006175163,0.0026717135,0.017875474],"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.0012653939,0.0015397252,0.0055519673,0.0059006843,0.0010563505,0.0016630791,0.0018829545,0.0045623705,0.059922516,0.010101665,0.17632216,0.73023105],"study_design_scores_gemma":[0.0024863605,0.0023355323,0.029848449,0.0031864329,0.005821525,0.006944537,0.006099789,0.1566087,0.19159614,0.039101496,0.5549099,0.0010611577],"about_ca_topic_score_codex":0.0074402797,"about_ca_topic_score_gemma":0.011233363,"teacher_disagreement_score":0.028205547,"about_ca_system_score_codex":0.0011822303,"about_ca_system_score_gemma":0.0025431653,"threshold_uncertainty_score":0.094356954},"labels":[],"label_agreement":null},{"id":"W1536691023","doi":"10.1007/11955498_19","title":"The Service Availability Forum Security Service (SEC): Status and Future Directions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Ericsson (Canada)","funders":"","keywords":"Computer science; Implementation; Scope (computer science); Middleware (distributed applications); Service (business); Computer security; Security service; Architecture; Interface (matter); Software engineering; Distributed computing; Information security; Operating system","score_opus":0.006967758634258797,"score_gpt":0.21716812104233912,"score_spread":0.21020036240808032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536691023","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024384003,0.27632257,0.08980998,0.12925458,0.019792197,0.00020987717,0.0013385202,0.0064013745,0.45248687],"genre_scores_gemma":[0.26457855,0.29808724,0.1026984,0.016602665,0.022366568,0.0003814322,0.004403553,0.0012226872,0.28965893],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934345,0.00015380603,0.000032103275,0.000061320585,0.0002944329,0.00011486016],"domain_scores_gemma":[0.99579656,0.001430448,0.00030328613,0.00028445292,0.001263191,0.0009220952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005137856,0.0005589331,0.0005889904,0.0018710028,0.00082108495,0.0048238696,0.0011621641,0.002069748,0.022295892],"category_scores_gemma":[0.003920052,0.0002886747,0.0003369096,0.004218786,0.001327124,0.0073185265,0.0013751194,0.0022484888,0.007806033],"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.00006816208,0.00013306053,0.001236159,0.00032598854,0.000006988175,0.00004167034,0.00016466706,0.0005645839,0.0008282262,0.08142078,0.20615552,0.70905423],"study_design_scores_gemma":[0.000018341463,0.00013279657,0.0012747134,0.0003732878,0.000010873457,0.00021466064,0.00024872806,0.0034534312,0.00043424388,0.022004792,0.97181004,0.00002411641],"about_ca_topic_score_codex":0.0046172403,"about_ca_topic_score_gemma":0.00442436,"teacher_disagreement_score":0.022295892,"about_ca_system_score_codex":0.0018978133,"about_ca_system_score_gemma":0.0037816814,"threshold_uncertainty_score":0.07458717},"labels":[],"label_agreement":null},{"id":"W1536766384","doi":"10.1007/978-3-540-69812-8_10","title":"A New Super-Resolution Algorithm Based on Areas Pixels and the Sampling Theorem of Papoulis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Pixel; Wavelet; Noise (video); Algorithm; Artificial intelligence; Similarity (geometry); Resolution (logic); Sampling (signal processing); Set (abstract data type); Image (mathematics); Computer vision","score_opus":0.018229261594582293,"score_gpt":0.258790985889735,"score_spread":0.24056172429515268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536766384","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.0037168511,0.000770917,0.99394435,0.00008573025,0.000100865815,0.00001752877,0.000022963433,0.00024611218,0.0010946564],"genre_scores_gemma":[0.029046766,0.0007785551,0.96788543,0.00008359199,0.00011928365,0.000034640463,0.000052922864,0.00007800969,0.0019206961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996661,0.000050813116,0.000015753303,0.000076952165,0.00016862134,0.00002175671],"domain_scores_gemma":[0.99961686,0.00016570392,0.000022289172,0.000051307772,0.00011814993,0.000025753716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055515365,0.0006427262,0.0008799244,0.0010899522,0.0003212549,0.0010668733,0.000959133,0.0008514435,0.0021276441],"category_scores_gemma":[0.0012494933,0.00050412567,0.00059339084,0.0010318334,0.0006748289,0.0017285133,0.000987067,0.0015632957,0.0008194755],"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.0002307053,0.000048302685,0.0004843062,0.00041129702,0.00009606309,0.00025655798,0.00012979314,0.024115717,0.15628874,0.07841224,0.0047772555,0.734749],"study_design_scores_gemma":[0.00005159881,0.00013961965,0.00089161936,0.000037618778,0.000096624775,0.0018772752,0.00003103702,0.85505277,0.06979407,0.045793418,0.026173344,0.00006100828],"about_ca_topic_score_codex":0.00067683257,"about_ca_topic_score_gemma":0.00073951023,"teacher_disagreement_score":0.0021276441,"about_ca_system_score_codex":0.0003162487,"about_ca_system_score_gemma":0.00040019827,"threshold_uncertainty_score":0.0071176887},"labels":[],"label_agreement":null},{"id":"W1536828366","doi":"10.1007/978-3-642-14064-8_11","title":"Modeling and Experimental Studies of a Novel 6-DOF Haptic Device","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","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":"Simon Fraser University","funders":"","keywords":"Stylus; Haptic technology; Computer science; Kinematics; Moment (physics); Torque; Simulation; Frame (networking); Computer vision","score_opus":0.04114353418402083,"score_gpt":0.2750148223174049,"score_spread":0.23387128813338404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536828366","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.8139832,0.00042796682,0.1776692,0.00023190919,0.0001448666,0.00022043264,0.00042261198,0.0010244967,0.0058752983],"genre_scores_gemma":[0.9705594,0.00018029388,0.025740914,0.000019087254,0.0000102038275,0.0000682446,0.00012081903,0.000031905074,0.003269134],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995977,0.00005572742,0.000020940555,0.00006549984,0.00021728798,0.000042816784],"domain_scores_gemma":[0.999332,0.00026477093,0.000093199684,0.00015720123,0.00010422253,0.00004858191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157101,0.00046985375,0.0005517172,0.00029767794,0.00040207643,0.0006317222,0.0015767268,0.0012823213,0.0039742207],"category_scores_gemma":[0.0012031284,0.00040095532,0.0005232662,0.0002731669,0.00051407923,0.0010327081,0.00043966013,0.00041234738,0.00080226397],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001027695,0.00048624686,0.0015899236,0.00047338096,0.000028562636,0.0007856455,0.00064941915,0.072548926,0.89525384,0.0026191343,0.0006858661,0.023851324],"study_design_scores_gemma":[0.00022872062,0.0035366563,0.008086871,0.00005717034,0.00009517488,0.00092872547,0.0003043057,0.7048893,0.27167886,0.0009084409,0.009159961,0.00012578933],"about_ca_topic_score_codex":0.00088333705,"about_ca_topic_score_gemma":0.0007054227,"teacher_disagreement_score":0.0039742207,"about_ca_system_score_codex":0.00028939667,"about_ca_system_score_gemma":0.0004977175,"threshold_uncertainty_score":0.013295114},"labels":[],"label_agreement":null},{"id":"W1536848116","doi":"10.1007/978-3-642-30220-6_27","title":"RadialViz: An Orientation-Free Frequent Pattern Visualizer","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Legibility; Computer science; Graph; Orientation (vector space); Face (sociological concept); Representation (politics); Information retrieval; Human–computer interaction; Theoretical computer science; Artificial intelligence; Computer graphics (images); Mathematics; Geometry; Art; Visual arts","score_opus":0.023182608932740007,"score_gpt":0.28423811563833223,"score_spread":0.26105550670559224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536848116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008358571,0.0006526102,0.8383987,0.00024771824,0.00012049163,0.00016299813,0.00911232,0.14049439,0.0024523453],"genre_scores_gemma":[0.06118491,0.00069860613,0.9071205,0.0002069338,0.000094291776,0.0004528446,0.015506575,0.009664515,0.0050708824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921393,0.000113500566,0.000092703456,0.0001486856,0.00036921285,0.00006193062],"domain_scores_gemma":[0.99842775,0.0007578358,0.0001586514,0.00033415254,0.00022967305,0.00009195454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010183806,0.0018581757,0.0013885987,0.003822633,0.00047541133,0.0023913477,0.0022378669,0.001144837,0.018502682],"category_scores_gemma":[0.0054745576,0.0011312892,0.001786869,0.0025623743,0.00027894857,0.0028890837,0.002517077,0.0014140664,0.008498625],"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.0015824505,0.00019482562,0.0029276886,0.0011532126,0.0002920409,0.00075823476,0.00039188028,0.010410215,0.028100679,0.014276379,0.099035114,0.8408774],"study_design_scores_gemma":[0.0007311484,0.00044004733,0.0035735236,0.00036860857,0.00027191415,0.0030653076,0.000280209,0.6341751,0.06899215,0.079835035,0.20797588,0.00029110102],"about_ca_topic_score_codex":0.0012380984,"about_ca_topic_score_gemma":0.0017319451,"teacher_disagreement_score":0.018502682,"about_ca_system_score_codex":0.0003016171,"about_ca_system_score_gemma":0.00060171034,"threshold_uncertainty_score":0.061897635},"labels":[],"label_agreement":null},{"id":"W1536874373","doi":"10.1007/3-540-45554-x_41","title":"The Application of a Distance Learning Algorithm in Web-Based Course Delivery","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Computer science; Distance education; Set (abstract data type); Course (navigation); Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.009687410139275272,"score_gpt":0.23241037012992138,"score_spread":0.22272295999064612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536874373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18522523,0.0008365816,0.7964734,0.0003891955,0.00024706897,0.0002012975,0.000106945816,0.001246154,0.015274265],"genre_scores_gemma":[0.6361597,0.00038680213,0.35152182,0.000049663748,0.00007305496,0.00007539136,0.00013684147,0.00010901882,0.011487713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00031532225,0.000056168137,0.00015901524,0.00036248885,0.000058131725],"domain_scores_gemma":[0.99792445,0.0012017627,0.00007189246,0.00015507785,0.0005539323,0.00009296728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001366384,0.00026355372,0.0005042838,0.0011046028,0.0007633556,0.0012432744,0.0011885676,0.0011285653,0.0057306597],"category_scores_gemma":[0.0060449773,0.0002070499,0.000431241,0.0015786453,0.0003775391,0.0019927847,0.00091335,0.00071938796,0.0011336176],"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.00043773168,0.00049982115,0.0026357207,0.00007961954,0.000030512543,0.00007776596,0.00018840455,0.069000505,0.006708555,0.011786441,0.0019380882,0.9066169],"study_design_scores_gemma":[0.000036789716,0.0002942864,0.002661197,0.0000120021505,0.000033563483,0.00013879262,0.00013704803,0.9790759,0.00881969,0.0055687004,0.0032017399,0.000020188922],"about_ca_topic_score_codex":0.00673193,"about_ca_topic_score_gemma":0.0044305567,"teacher_disagreement_score":0.00673193,"about_ca_system_score_codex":0.0011148412,"about_ca_system_score_gemma":0.00086081325,"threshold_uncertainty_score":0.01917094},"labels":[],"label_agreement":null},{"id":"W1536910550","doi":"10.1007/978-3-642-02047-6_10","title":"Academic Software Development Tools and Techniques","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"University of Victoria","funders":"","keywords":"Computer science; Code refactoring; Software engineering; Context (archaeology); Object-oriented programming; Programming language; Software development; Focus (optics); Theme (computing); Software; World Wide Web","score_opus":0.025594859704889478,"score_gpt":0.274416134015549,"score_spread":0.2488212743106595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536910550","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.002536395,0.020269413,0.65956324,0.0019327158,0.0012063954,0.00018400956,0.0005918889,0.009767523,0.30394843],"genre_scores_gemma":[0.018425541,0.035152093,0.37248814,0.0005489646,0.0007234018,0.00032135803,0.00256616,0.0041231383,0.5656512],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988393,0.0001107746,0.00008924117,0.00011829515,0.00079631625,0.00004611787],"domain_scores_gemma":[0.99841475,0.0006732226,0.00007852341,0.0003238966,0.0004206241,0.00008892269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087122124,0.0012941097,0.0007181862,0.0038581372,0.00070890324,0.0025592234,0.0017118239,0.00078056304,0.036356844],"category_scores_gemma":[0.0030981915,0.0011155407,0.0008460714,0.0059475186,0.00074602297,0.0036441947,0.001464336,0.0024621496,0.033950984],"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.000011802903,0.000049982948,0.0001106136,0.00048921694,0.000012198907,0.000049970844,0.00025209595,0.0011858424,0.002389,0.085332714,0.088406876,0.8217097],"study_design_scores_gemma":[0.000011578594,0.000024311901,0.0003338616,0.00039247095,0.000021681435,0.00043740877,0.0000493691,0.0034194272,0.0034524503,0.06708447,0.92475325,0.000019545483],"about_ca_topic_score_codex":0.00045828603,"about_ca_topic_score_gemma":0.00088972936,"teacher_disagreement_score":0.036356844,"about_ca_system_score_codex":0.00087678793,"about_ca_system_score_gemma":0.0015978653,"threshold_uncertainty_score":0.12162572},"labels":[],"label_agreement":null},{"id":"W1537078480","doi":"10.1007/11753810_72","title":"Distributed Data Gathering in Multi-sink Sensor Networks with Correlated Sources","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Toronto","funders":"","keywords":"Wireless sensor network; Subgradient method; Asynchronous communication; Computer science; Exploit; Sink (geography); Distributed algorithm; Distributed computing; Mathematical optimization; Computer network; Mathematics","score_opus":0.021707340314721612,"score_gpt":0.22940965736442434,"score_spread":0.20770231704970274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537078480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017054753,0.0010008399,0.9801917,0.00011479408,0.000057217974,0.000037231275,0.00002473743,0.00014551535,0.0013731665],"genre_scores_gemma":[0.69592655,0.0030034776,0.29412472,0.00010166996,0.00019272919,0.00025663635,0.00013465101,0.00010513528,0.0061544254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995679,0.00013419492,0.000027274536,0.00011344834,0.00013456479,0.000022632918],"domain_scores_gemma":[0.9991825,0.0005657747,0.00006215233,0.000087553926,0.0000831813,0.000018852199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008563824,0.0007040241,0.00094639644,0.00057576987,0.0004800565,0.0006965778,0.001126796,0.000649032,0.0007074771],"category_scores_gemma":[0.0015297519,0.0007140219,0.0005183003,0.0011877641,0.0005926117,0.0014789313,0.001030782,0.0007879632,0.0001514856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030985827,0.00013337976,0.0010503139,0.0005271168,0.00014392691,0.00033652346,0.00041626897,0.77315277,0.045053277,0.03168369,0.0020635324,0.1451294],"study_design_scores_gemma":[0.000015699687,0.00006818892,0.0002111197,0.000013925663,0.000022590177,0.000078110796,0.000024699404,0.9856124,0.0043159937,0.008645718,0.0009828166,0.00000886317],"about_ca_topic_score_codex":0.0003501347,"about_ca_topic_score_gemma":0.00051024504,"teacher_disagreement_score":0.001126796,"about_ca_system_score_codex":0.0003628629,"about_ca_system_score_gemma":0.000289036,"threshold_uncertainty_score":0.004529059},"labels":[],"label_agreement":null},{"id":"W1537152028","doi":"10.1007/978-3-540-28647-9_64","title":"Analysing Contributions of Components and Factors to Pork Odour Using Structural Learning with Forgetting Method","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Odor and Emission Control Technologies","field":"Chemical Engineering","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 Guelph","funders":"","keywords":"Forgetting; Computer science; Component (thermodynamics); Artificial neural network; Artificial intelligence; Perception; Machine learning; Pattern recognition (psychology); Cognitive psychology","score_opus":0.02472752274667274,"score_gpt":0.28246626984456014,"score_spread":0.2577387470978874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537152028","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.7332212,0.0007140696,0.26357284,0.000050142487,0.00007561439,0.000046809262,0.00030642483,0.0010702069,0.0009427427],"genre_scores_gemma":[0.95543396,0.00024100048,0.0424713,0.000011422668,0.00002083883,0.000019190855,0.0005337886,0.00015774298,0.0011107674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959797,0.00008763687,0.000022664095,0.00015195354,0.00008561003,0.00005421058],"domain_scores_gemma":[0.9950846,0.0034755797,0.00024034434,0.00037194014,0.00071625476,0.000111256195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008473336,0.0009919641,0.0006910382,0.0017495438,0.00029923354,0.0007085817,0.0005698511,0.00048195486,0.0017657503],"category_scores_gemma":[0.0054923836,0.00041143075,0.0012329468,0.0013493173,0.000388687,0.0012705468,0.000646895,0.00085290713,0.0004293394],"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.0024184005,0.0005758938,0.14896734,0.00054417044,0.0008344639,0.00053595804,0.0005943197,0.068261094,0.07515596,0.0014655882,0.0010508274,0.699596],"study_design_scores_gemma":[0.00004479596,0.0005762163,0.14589873,0.000048692706,0.000922989,0.0003677122,0.0003514493,0.8068498,0.03897109,0.004461315,0.0014105424,0.00009672311],"about_ca_topic_score_codex":0.0074451976,"about_ca_topic_score_gemma":0.005796437,"teacher_disagreement_score":0.0074451976,"about_ca_system_score_codex":0.00030076542,"about_ca_system_score_gemma":0.0004978466,"threshold_uncertainty_score":0.014803708},"labels":[],"label_agreement":null},{"id":"W1537172410","doi":"10.1007/3-540-44651-6_22","title":"Multi-domain Policy Based Management Using Mobile Agents","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Interoperability; Quality of service; Service provider; Computer network; Negotiation; Merge (version control); Process management; Service (business); World Wide Web; Business","score_opus":0.02794066535566718,"score_gpt":0.2765414996635506,"score_spread":0.24860083430788343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537172410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020318205,0.00089033094,0.9633566,0.0003175118,0.00018137279,0.0001421011,0.000048750273,0.0032979639,0.011447077],"genre_scores_gemma":[0.5645844,0.0007396459,0.41726893,0.00021862517,0.00015590158,0.00027118775,0.00025351666,0.0002524711,0.016255327],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991696,0.00023535195,0.00008854632,0.00015375316,0.00023998058,0.000112802976],"domain_scores_gemma":[0.998676,0.0005361619,0.0001390645,0.0003438294,0.00014447655,0.00016041481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017712505,0.00047385567,0.0007725802,0.00086348277,0.0008504336,0.0027210824,0.0016360475,0.0009915092,0.0030878359],"category_scores_gemma":[0.0020845067,0.0005291891,0.0004195439,0.00086282066,0.0005720788,0.003105397,0.0019446235,0.0014026138,0.0010147893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085855636,0.00091699907,0.002025148,0.00032660176,0.0002776505,0.0006598966,0.0007598355,0.14100678,0.046849627,0.13988988,0.014250544,0.65217847],"study_design_scores_gemma":[0.00007388909,0.00013283886,0.00042095617,0.000041453084,0.000102539554,0.00029180702,0.00012895817,0.8844397,0.023884596,0.050760925,0.039669883,0.00005234347],"about_ca_topic_score_codex":0.00084462063,"about_ca_topic_score_gemma":0.001071473,"teacher_disagreement_score":0.0030878359,"about_ca_system_score_codex":0.00060699455,"about_ca_system_score_gemma":0.0005906178,"threshold_uncertainty_score":0.010329902},"labels":[],"label_agreement":null},{"id":"W153718729","doi":"10.1007/978-3-642-38457-8_12","title":"Navigation by Path Integration and the Fourier Transform: A Spiking-Neuron Model","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fourier transform; Path integration; Computer science; Grid; Precession; Grid cell; Computation; Physics; Algorithm; Artificial intelligence; Mathematics; Geometry; Quantum mechanics","score_opus":0.03654641595400238,"score_gpt":0.25979831538587284,"score_spread":0.22325189943187046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153718729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06840421,0.003470993,0.89300835,0.0017599927,0.0004125776,0.00004082197,0.00046589333,0.0004170237,0.032020133],"genre_scores_gemma":[0.8544135,0.0049644546,0.0891409,0.00034794648,0.00033249066,0.00013653447,0.0004405743,0.00035856923,0.049865104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985147,0.00003833039,0.0000072488547,0.000033631426,0.000040681454,0.000028664856],"domain_scores_gemma":[0.99962926,0.00016984004,0.000049345683,0.000030256868,0.0000798755,0.000041392454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656648,0.00073778146,0.0013480778,0.00062597846,0.0005232363,0.0017220965,0.00252392,0.0029432254,0.0034069943],"category_scores_gemma":[0.0017288374,0.00062516076,0.0012536395,0.0016793957,0.001358114,0.0026852936,0.0009243433,0.0017105873,0.0007532222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043833534,0.00004073413,0.00036367896,0.000058159116,0.000044289915,0.000105011386,0.00007719702,0.756858,0.0013699143,0.2297899,0.0018820798,0.0093673095],"study_design_scores_gemma":[0.0000069658204,0.000005181636,0.000054007996,0.000004542075,0.0000072811913,0.000031144777,0.00000585815,0.9557271,0.0000599632,0.043702863,0.00038543573,0.00000958228],"about_ca_topic_score_codex":0.0121689895,"about_ca_topic_score_gemma":0.006500979,"teacher_disagreement_score":0.0121689895,"about_ca_system_score_codex":0.0011622366,"about_ca_system_score_gemma":0.0013024972,"threshold_uncertainty_score":0.024196327},"labels":[],"label_agreement":null},{"id":"W1537207111","doi":"10.1007/978-3-642-13059-5_6","title":"A Three-Way Decision Approach to Email Spam Filtering","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":111,"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","keywords":"Computer science; Machine learning; Odds; Binary number; Function (biology); Artificial intelligence; Bayesian probability; Data mining; Mathematics; Logistic regression","score_opus":0.021655787547468937,"score_gpt":0.23559731988035615,"score_spread":0.2139415323328872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537207111","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.005520041,0.00019279656,0.99202687,0.00029394994,0.000096668526,0.000065803244,0.00006050435,0.00049712,0.0012461606],"genre_scores_gemma":[0.2527475,0.00026543977,0.73505914,0.00048811838,0.00040481315,0.0002959165,0.00037217865,0.00024645834,0.010120532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940493,0.0026499296,0.00044379913,0.0009554277,0.0013217264,0.00057985773],"domain_scores_gemma":[0.98960835,0.0075192535,0.00022246763,0.0006994419,0.0016394757,0.0003110843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007062939,0.0012424167,0.003575422,0.0019657426,0.0024533465,0.003973989,0.0055214153,0.0038050816,0.008684886],"category_scores_gemma":[0.01064132,0.0013435705,0.00286842,0.002045721,0.0018655724,0.0041800244,0.0034767124,0.0032215272,0.002097431],"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.0013172205,0.0008390413,0.0023448775,0.00029672857,0.0004982817,0.00043615923,0.00061306654,0.33723623,0.004986292,0.07864293,0.010619712,0.5621694],"study_design_scores_gemma":[0.000023291377,0.000048600654,0.00012753259,0.000007778412,0.000041644544,0.000046144865,0.000027565186,0.96832764,0.0008243808,0.029675566,0.00082404475,0.000025767366],"about_ca_topic_score_codex":0.01027011,"about_ca_topic_score_gemma":0.009880793,"teacher_disagreement_score":0.01027011,"about_ca_system_score_codex":0.001986025,"about_ca_system_score_gemma":0.0023424716,"threshold_uncertainty_score":0.03735286},"labels":[],"label_agreement":null},{"id":"W153724733","doi":"10.1007/978-3-642-40131-2_22","title":"An Automatic Email Management Approach Using Data Mining Techniques","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision 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 Windsor","funders":"","keywords":"Computer science; Cluster analysis; Information overload; Information retrieval; Data mining; Search engine indexing; Identification (biology); Structuring; Similarity (geometry); World Wide Web; Artificial intelligence","score_opus":0.2944473722077188,"score_gpt":0.4191454377675028,"score_spread":0.12469806555978397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153724733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065993786,0.000829869,0.906494,0.0005281144,0.00025825086,0.0006011055,0.0017206497,0.017195994,0.0063781543],"genre_scores_gemma":[0.22439155,0.00034219076,0.76501274,0.00020236908,0.00016407488,0.00036365414,0.0028153255,0.0001899927,0.0065181013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987361,0.00025709695,0.00014218554,0.00026613227,0.0005177731,0.00008070443],"domain_scores_gemma":[0.9977704,0.0009519219,0.00017321485,0.00027960163,0.00074874813,0.00007616131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013588009,0.00071429147,0.00074420584,0.0038603407,0.00084156386,0.0019143998,0.0013507772,0.0010333385,0.0021373814],"category_scores_gemma":[0.0039714267,0.00030415042,0.00070301275,0.0025459537,0.00019310837,0.0014088503,0.0007984416,0.00080162013,0.0022155147],"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.00023523778,0.0006578627,0.007205607,0.00023279068,0.00009029438,0.00021612995,0.00013752002,0.005426736,0.019229254,0.0023614708,0.011595406,0.9526118],"study_design_scores_gemma":[0.00008004052,0.0004095927,0.0130869765,0.00012902587,0.00031792332,0.0009405408,0.0004462365,0.85814303,0.07364168,0.016501913,0.036212128,0.0000909194],"about_ca_topic_score_codex":0.0011537634,"about_ca_topic_score_gemma":0.002309247,"teacher_disagreement_score":0.0038603407,"about_ca_system_score_codex":0.0004358233,"about_ca_system_score_gemma":0.00076551584,"threshold_uncertainty_score":0.0071861744},"labels":[],"label_agreement":null},{"id":"W1537247569","doi":"10.1007/978-3-642-04667-4_22","title":"Automatic Classification of Image Registration Problems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 British Columbia","funders":"","keywords":"Image registration; Computer science; Artificial intelligence; Variation (astronomy); Image (mathematics); Flexibility (engineering); Pattern recognition (psychology); Computer vision; Algorithm; Mathematics; Statistics","score_opus":0.024529212598800892,"score_gpt":0.282875417088396,"score_spread":0.2583462044895951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537247569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058312763,0.0029747293,0.9286944,0.0006709073,0.00027025063,0.00028789052,0.00058767287,0.0029054612,0.0052960054],"genre_scores_gemma":[0.32658258,0.0018333985,0.65402806,0.00028373208,0.0005163854,0.00034188243,0.0048686923,0.0006495206,0.010895763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974583,0.0005391024,0.00024322784,0.0006845998,0.00080273655,0.00027201287],"domain_scores_gemma":[0.9960962,0.0013781184,0.00050425465,0.00088222837,0.00097082887,0.00016835022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025033143,0.0011063673,0.0022093966,0.0043913503,0.00087533554,0.0031631223,0.0027158854,0.0022477242,0.004973456],"category_scores_gemma":[0.006839932,0.0006098872,0.0018671455,0.002896205,0.0009807425,0.0026881273,0.0018273088,0.002214584,0.0029124443],"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.00037280962,0.0003602881,0.0036805153,0.0004305965,0.00008470098,0.00016434064,0.0001286676,0.022593953,0.027285745,0.014015131,0.012341698,0.9185416],"study_design_scores_gemma":[0.00005015574,0.00028087597,0.0053504743,0.00010989196,0.00009356592,0.0008402635,0.00016688823,0.9175184,0.026776696,0.03739322,0.0113741,0.000045568348],"about_ca_topic_score_codex":0.0011276605,"about_ca_topic_score_gemma":0.0015107235,"teacher_disagreement_score":0.004973456,"about_ca_system_score_codex":0.00067394733,"about_ca_system_score_gemma":0.0010483499,"threshold_uncertainty_score":0.016637802},"labels":[],"label_agreement":null},{"id":"W1537270548","doi":"10.1007/11422778_38","title":"Improving Network Convergence Time and Network Stability of an OSPF-Routed IP Network","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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":"Solana Networks (Canada); Nortel (Canada)","funders":"","keywords":"Computer network; Computer science; Open Shortest Path First; Routing protocol; Network packet; Network congestion; Hazy Sighted Link State Routing Protocol; Packet loss; Convergence (economics); Node (physics); Distributed computing; Link-state routing protocol; Engineering","score_opus":0.008755596036375773,"score_gpt":0.2065472179826279,"score_spread":0.19779162194625213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537270548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39593133,0.0012188461,0.5903989,0.00034754872,0.0001466689,0.000060662293,0.00006740721,0.000918953,0.010909683],"genre_scores_gemma":[0.92212975,0.00032410488,0.07506438,0.000030405037,0.000069591726,0.00003112521,0.000054267235,0.00012418944,0.0021721506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926287,0.0002580082,0.000030187799,0.00009738999,0.00025133204,0.00010021849],"domain_scores_gemma":[0.99593544,0.0026443785,0.00023530716,0.00032913522,0.0006892638,0.0001664582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001746249,0.0006470266,0.00066651584,0.0010776792,0.00063056336,0.00069160876,0.0009816188,0.00072831305,0.0019308652],"category_scores_gemma":[0.008404541,0.0003089931,0.00027897517,0.0008789472,0.00064393226,0.0018359649,0.00079847424,0.00095146935,0.00026228908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009573904,0.00018066818,0.001333499,0.000079077116,0.000043251333,0.000099658515,0.00015301148,0.7923596,0.034379046,0.030342003,0.002174826,0.13789794],"study_design_scores_gemma":[0.000014656304,0.00009574462,0.00018806876,0.0000036048934,0.00001531892,0.000035235313,0.000014038621,0.9901328,0.0039764526,0.005323845,0.00019463066,0.000005551892],"about_ca_topic_score_codex":0.0011335377,"about_ca_topic_score_gemma":0.0013346887,"teacher_disagreement_score":0.0019308652,"about_ca_system_score_codex":0.0008741257,"about_ca_system_score_gemma":0.0006316481,"threshold_uncertainty_score":0.009235203},"labels":[],"label_agreement":null},{"id":"W1537285640","doi":"10.1007/978-3-540-30219-3_22","title":"A New Integer Programming Formulation for the Pure Parsimony Problem in Haplotype Analysis","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer programming; Computer science; Integer (computer science); Inference; Mathematical optimization; Linear programming; Algorithm; Polynomial; Theoretical computer science; Mathematics; Artificial intelligence; Programming language","score_opus":0.01544918086088299,"score_gpt":0.2672174758895523,"score_spread":0.2517682950286693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537285640","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.0019422527,0.0003630856,0.99306315,0.0005409872,0.00010464716,0.000058817393,0.00020491616,0.000077181336,0.0036449658],"genre_scores_gemma":[0.03854018,0.00070399826,0.94971377,0.00047432948,0.00038102252,0.000492289,0.00053040433,0.00029820195,0.008865856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980736,0.0009818199,0.00009013849,0.00032107293,0.00036578407,0.00016759276],"domain_scores_gemma":[0.9950923,0.004170141,0.0001738894,0.00017535036,0.00025249153,0.00013584677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040312507,0.0018430953,0.0020363524,0.001046982,0.0009549841,0.003298932,0.0036829312,0.0025554127,0.010961955],"category_scores_gemma":[0.009384266,0.0016092055,0.0020283533,0.002920667,0.0015773245,0.0049818773,0.002190391,0.005674779,0.0013268644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010088672,0.00025631976,0.00055911375,0.00039048961,0.00011699214,0.00019745146,0.00022879336,0.5668551,0.0010625906,0.31623524,0.018948594,0.095048405],"study_design_scores_gemma":[0.00003568676,0.000035460882,0.000101188256,0.0000424802,0.000026937061,0.000055707787,0.000042412918,0.7968671,0.00020735039,0.19817927,0.004387896,0.000018505556],"about_ca_topic_score_codex":0.003473895,"about_ca_topic_score_gemma":0.005087212,"teacher_disagreement_score":0.010961955,"about_ca_system_score_codex":0.001474204,"about_ca_system_score_gemma":0.0020204065,"threshold_uncertainty_score":0.0366714},"labels":[],"label_agreement":null},{"id":"W1537286826","doi":"10.1007/978-3-642-11842-5_10","title":"Performance of Local Gauss Integration in Finite Element and Finite Volume Methods for the Navier-Stokes Equations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Methods in Computational Mathematics","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 Calgary","funders":"","keywords":"Finite element method; Finite volume method; Gauss; Mixed finite element method; Extended finite element method; Mathematics; Smoothed finite element method; Mathematical analysis; Applied mathematics; hp-FEM; Finite element limit analysis; Boundary knot method; Physics; Mechanics; Thermodynamics","score_opus":0.031570278031360775,"score_gpt":0.32871327744929957,"score_spread":0.2971429994179388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537286826","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.62290955,0.0022707756,0.35735446,0.00053173973,0.00016934436,0.000043490232,0.00014232617,0.003132421,0.013445839],"genre_scores_gemma":[0.9417595,0.00022615452,0.05450605,0.000061533385,0.000032060914,0.000028964869,0.0001825387,0.00052448025,0.0026786388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990421,0.00033621961,0.000041777013,0.00009428173,0.0003927688,0.00009286163],"domain_scores_gemma":[0.9921956,0.0058959234,0.00025520904,0.00040405567,0.0010032733,0.0002459584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020011333,0.00069190474,0.001080062,0.00056910154,0.00060833653,0.001429565,0.0010126932,0.001075426,0.0028895908],"category_scores_gemma":[0.008752104,0.0002681587,0.0002542303,0.0007142128,0.00096322835,0.0014698572,0.0011475228,0.00072590756,0.000561888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028818438,0.0005478352,0.0065253275,0.00039497268,0.00009680989,0.00012478264,0.0008122659,0.6736954,0.0393997,0.019585142,0.0033720555,0.25256392],"study_design_scores_gemma":[0.000016227836,0.0000745441,0.00046862292,0.000007846407,0.000008893442,0.000016884902,0.00004385775,0.9913481,0.006635302,0.0010567809,0.0003133791,0.000009577327],"about_ca_topic_score_codex":0.0044131186,"about_ca_topic_score_gemma":0.003445074,"teacher_disagreement_score":0.0044131186,"about_ca_system_score_codex":0.00073830964,"about_ca_system_score_gemma":0.0010606556,"threshold_uncertainty_score":0.010583162},"labels":[],"label_agreement":null},{"id":"W1537323006","doi":"10.1007/11821830_36","title":"Invited Talk: Rule Systems and Video Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","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":"Electronic Arts (Canada)","funders":"","keywords":"Computer science; Cover (algebra); Field (mathematics); Everyday life; Multimedia; Human–computer interaction; Epistemology; Mathematics","score_opus":0.014046182660091585,"score_gpt":0.2489372594117273,"score_spread":0.23489107675163573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537323006","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012158454,0.09560128,0.048890933,0.08358063,0.07958477,0.000116923016,0.0005041745,0.0005395021,0.6790233],"genre_scores_gemma":[0.096061625,0.040875293,0.010772184,0.008855457,0.036808014,0.00012963761,0.00056188926,0.0003846613,0.80555123],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975294,0.00007415445,0.000009911938,0.0000616608,0.00007187186,0.000029429391],"domain_scores_gemma":[0.9993507,0.0003704028,0.000017345352,0.000023193164,0.00014534876,0.00009297487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061441073,0.0007250399,0.0006526962,0.0004349613,0.0010463444,0.0034363251,0.0009666382,0.0020089487,0.049155746],"category_scores_gemma":[0.002356235,0.00022258332,0.0003871643,0.00057971117,0.0007410859,0.0034752518,0.0007570108,0.0022776762,0.01010874],"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.00007710344,0.00013198965,0.00019432833,0.00027662842,0.000025269153,0.000079290716,0.0004692883,0.0010447203,0.0007436071,0.19348237,0.7057431,0.097732335],"study_design_scores_gemma":[0.000037314687,0.000053907046,0.00058040937,0.00019296167,0.000025855388,0.00016217389,0.0003630876,0.0017178555,0.0006791004,0.16577384,0.83039063,0.000022942371],"about_ca_topic_score_codex":0.0009598031,"about_ca_topic_score_gemma":0.0015411724,"teacher_disagreement_score":0.049155746,"about_ca_system_score_codex":0.0007486734,"about_ca_system_score_gemma":0.00043028465,"threshold_uncertainty_score":0.16444236},"labels":[],"label_agreement":null},{"id":"W153733639","doi":"10.1007/978-3-540-85958-1_52","title":"Probabilistically Estimating Backbones and Variable Bias: Experimental Overview","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Error Correcting Code Techniques","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 Toronto","funders":"","keywords":"Variable (mathematics); Econometrics; Computer science; Statistics; Mathematics; Mathematical analysis","score_opus":0.04623804926044622,"score_gpt":0.2855706726050892,"score_spread":0.239332623344643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153733639","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.1332265,0.00344206,0.84710425,0.0006860519,0.00027969462,0.00029365928,0.0015560576,0.0036240718,0.009787798],"genre_scores_gemma":[0.41380876,0.002093652,0.57024103,0.00037928481,0.0001596184,0.00030158652,0.0041492954,0.0027486584,0.006117973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964792,0.0012022542,0.00013497347,0.0011005509,0.00090496347,0.00017814443],"domain_scores_gemma":[0.9774154,0.014927415,0.0011207092,0.0041234964,0.0020959494,0.00031707538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057800435,0.0015125804,0.0012486933,0.0011678427,0.001370189,0.002087271,0.0029690585,0.0028851703,0.010497667],"category_scores_gemma":[0.034566335,0.0011546798,0.00076883484,0.0024276713,0.0017328878,0.0048224847,0.0022529552,0.0032267512,0.0033529084],"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.0053444346,0.0017436657,0.010850613,0.0022363109,0.00088156684,0.0001866794,0.00066375814,0.16692697,0.19162637,0.07664392,0.015121513,0.5277742],"study_design_scores_gemma":[0.0004841417,0.00148751,0.004847215,0.0002616918,0.0004809301,0.0008156077,0.00025198897,0.6492762,0.21694604,0.110942535,0.013955679,0.00025044454],"about_ca_topic_score_codex":0.0033968494,"about_ca_topic_score_gemma":0.002991492,"teacher_disagreement_score":0.010497667,"about_ca_system_score_codex":0.0011346592,"about_ca_system_score_gemma":0.0012056952,"threshold_uncertainty_score":0.035118163},"labels":[],"label_agreement":null},{"id":"W1537340563","doi":"10.1007/3-540-47887-6_12","title":"Toward Bayesian Classifiers with Accurate Probabilities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Naive Bayes classifier; Ranking (information retrieval); Artificial intelligence; Receiver operating characteristic; Machine learning; Bayesian probability; Bayes' theorem; Decision tree; Data mining; Pattern recognition (psychology); Statistics; Support vector machine; Mathematics","score_opus":0.043110102307826616,"score_gpt":0.242856787131332,"score_spread":0.19974668482350538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537340563","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.0015843807,0.0006358694,0.9953424,0.0004124363,0.000082275765,0.000029647506,0.00009714936,0.00037547096,0.0014404423],"genre_scores_gemma":[0.07909919,0.0020211793,0.90769947,0.0009778652,0.00089338765,0.0003807095,0.0009452852,0.00038959546,0.0075933104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947996,0.0019815494,0.0003134985,0.0009124724,0.0017778712,0.00021489122],"domain_scores_gemma":[0.9813374,0.014167677,0.00064475095,0.0017433263,0.0018900416,0.00021688733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007861053,0.0016054123,0.0032069217,0.0029106047,0.0012351725,0.0041524936,0.0031463082,0.00408655,0.005126899],"category_scores_gemma":[0.042851817,0.0022614507,0.0015958294,0.0027449918,0.0017551885,0.008987195,0.0038834491,0.0066467966,0.00447331],"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.00022749919,0.00010810452,0.00091789564,0.0003371837,0.00018321158,0.00011067892,0.0002866798,0.121181525,0.0023547695,0.24166623,0.029364126,0.6032621],"study_design_scores_gemma":[0.000022562781,0.000022738875,0.00015099479,0.000058405138,0.000048619735,0.00007482216,0.000024748177,0.5550156,0.0012796456,0.43632713,0.0069549843,0.000019718249],"about_ca_topic_score_codex":0.0022298745,"about_ca_topic_score_gemma":0.0028973084,"teacher_disagreement_score":0.007861053,"about_ca_system_score_codex":0.0015409243,"about_ca_system_score_gemma":0.0015413829,"threshold_uncertainty_score":0.041573703},"labels":[],"label_agreement":null},{"id":"W1537351342","doi":"10.1007/3-540-47884-1_6","title":"Assume-Guarantee Algorithms for Automatic Detection of Software Failures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Formalism (music); Finite-state machine; Software; Key (lock); State (computer science); Algorithm; Detector; Programming language; Operating system","score_opus":0.03209195549356824,"score_gpt":0.2801008445614702,"score_spread":0.24800888906790197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537351342","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.0091077015,0.00024023253,0.98528755,0.00028686202,0.000036490488,0.00006447213,0.00008620803,0.003797265,0.0010932691],"genre_scores_gemma":[0.3377937,0.00030656028,0.6571038,0.00031652374,0.00018072203,0.00034455437,0.00042686416,0.0009750166,0.0025523251],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902366,0.0024098882,0.00092225085,0.0013805572,0.0040379106,0.0010127998],"domain_scores_gemma":[0.93710136,0.04563082,0.0032372014,0.010251499,0.0030451205,0.00073399406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008626629,0.0019634706,0.0025576975,0.0018981501,0.0018135959,0.0032759286,0.00622325,0.0025075234,0.008804557],"category_scores_gemma":[0.043855384,0.0021316113,0.0024241495,0.0013840299,0.0035137516,0.009267751,0.0062502623,0.0066913045,0.002261098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046241027,0.0005641622,0.0049349307,0.000817198,0.00040139683,0.00026108758,0.0011226502,0.18405491,0.01893655,0.2159803,0.012888828,0.5554139],"study_design_scores_gemma":[0.00031686394,0.00021373921,0.0005873035,0.00006910317,0.00018623973,0.00016118011,0.000090915004,0.6989335,0.0173635,0.2797786,0.002242523,0.00005652087],"about_ca_topic_score_codex":0.0017101715,"about_ca_topic_score_gemma":0.003453522,"teacher_disagreement_score":0.008804557,"about_ca_system_score_codex":0.002318104,"about_ca_system_score_gemma":0.0034549846,"threshold_uncertainty_score":0.045622528},"labels":[],"label_agreement":null},{"id":"W1537351989","doi":"10.1007/3-540-45153-6_8","title":"Constraint Programming Lessons Learned from Crossword Puzzles","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Constraint programming; Constraint logic programming; Constraint (computer-aided design); Heuristic; Constraint satisfaction; Independence (probability theory); Mathematical optimization; Concurrent constraint logic programming; Theoretical computer science; Artificial intelligence; Mathematics; Stochastic programming","score_opus":0.041867821549464446,"score_gpt":0.2843121943162207,"score_spread":0.24244437276675623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537351989","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022350822,0.02163623,0.5900629,0.033782374,0.0019965423,0.00012510705,0.00089799514,0.0012915669,0.32785636],"genre_scores_gemma":[0.25062174,0.025545944,0.5977114,0.0049547325,0.0021360684,0.000330173,0.0023389428,0.0027319195,0.11362906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851245,0.0005105995,0.00012056814,0.00034093307,0.00042866505,0.00008681639],"domain_scores_gemma":[0.9927174,0.0050126044,0.00020133154,0.00081482256,0.0010711872,0.00018267326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001996825,0.0012214012,0.0007154608,0.0010912655,0.0016832544,0.004573341,0.002946943,0.0019706197,0.027534598],"category_scores_gemma":[0.021053346,0.00082717463,0.0008013597,0.0025822253,0.0034066672,0.011859138,0.0027693138,0.0047579133,0.005432802],"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.00005674371,0.000071151924,0.0004563346,0.00045027162,0.00003105008,0.00027234512,0.001901203,0.009845723,0.00060711784,0.6032221,0.09327617,0.28980988],"study_design_scores_gemma":[0.00001709467,0.000015292424,0.00019489328,0.00036455158,0.000012626127,0.00025734646,0.00066987285,0.013096413,0.00075189664,0.77187175,0.21271926,0.000028964154],"about_ca_topic_score_codex":0.0058366256,"about_ca_topic_score_gemma":0.0066940654,"teacher_disagreement_score":0.027534598,"about_ca_system_score_codex":0.0017859463,"about_ca_system_score_gemma":0.0016593839,"threshold_uncertainty_score":0.09211242},"labels":[],"label_agreement":null},{"id":"W1537370018","doi":"10.1007/978-3-540-76386-4_46","title":"Hierarchical Learning of Dominant Constellations for Object Class Recognition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"York University","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Class (philosophy); Object (grammar); Cognitive neuroscience of visual object recognition; Representation (politics); Segmentation; Constellation; Spatial analysis; Contrast (vision); Voting; Computer vision; Mathematics","score_opus":0.0376495137055823,"score_gpt":0.30871165762931263,"score_spread":0.27106214392373035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537370018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029297404,0.0004493297,0.96741176,0.00015036098,0.000032529813,0.00004504239,0.00025288947,0.0009825008,0.0013782262],"genre_scores_gemma":[0.4560287,0.0005839484,0.5363339,0.00018704026,0.00012725852,0.00016496157,0.0023127147,0.0003123807,0.0039490997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.00022433797,0.00005194467,0.00023597527,0.00021358924,0.00017379575],"domain_scores_gemma":[0.9984282,0.00063178764,0.000119175245,0.00039624854,0.00029865655,0.00012605687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012995197,0.0007366988,0.0015008658,0.0019732867,0.0007718131,0.0010324096,0.0025406736,0.0010448796,0.0046491968],"category_scores_gemma":[0.004012023,0.00070112664,0.0012663883,0.0022980322,0.0008980073,0.0021934041,0.0029273664,0.0018152894,0.0016916984],"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.00035503536,0.00021216432,0.002043713,0.00015103788,0.000100653604,0.00008047567,0.00021030816,0.0885914,0.018558236,0.019685237,0.0082935365,0.8617181],"study_design_scores_gemma":[0.000022347329,0.000081889986,0.0007864967,0.000017825972,0.000022206585,0.00006763792,0.00005805618,0.9589473,0.002567763,0.036015462,0.0013986276,0.0000143655825],"about_ca_topic_score_codex":0.0049187117,"about_ca_topic_score_gemma":0.0093463,"teacher_disagreement_score":0.0049187117,"about_ca_system_score_codex":0.00079190347,"about_ca_system_score_gemma":0.001030431,"threshold_uncertainty_score":0.015553117},"labels":[],"label_agreement":null},{"id":"W1537398163","doi":"10.1007/978-3-642-31951-8_2","title":"Beyond Reward: The Problem of Knowledge and Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Commonsense knowledge; Meaning (existential); Knowledge base; Artificial intelligence; Reinforcement learning; Knowledge management; Cognitive science; Epistemology; Psychology","score_opus":0.03249919021536033,"score_gpt":0.27527754977510144,"score_spread":0.2427783595597411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537398163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022063235,0.015135125,0.7866417,0.085255444,0.0011248575,0.00010269275,0.00082515937,0.0004699077,0.08838189],"genre_scores_gemma":[0.7850047,0.012265521,0.14747189,0.0042538545,0.0030015644,0.00028532906,0.00055725046,0.00055891526,0.04660094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520147,0.0021943825,0.00029464465,0.0009049752,0.0010054888,0.0003990235],"domain_scores_gemma":[0.96314174,0.02902044,0.0011891108,0.00409218,0.001440767,0.0011157587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076449076,0.00086917356,0.0022858428,0.0016358934,0.0025252611,0.011381142,0.003763679,0.0056425054,0.009933276],"category_scores_gemma":[0.04430298,0.0008941495,0.001476492,0.00342868,0.01620379,0.04191032,0.005579838,0.007494266,0.0014191896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038769682,0.000013124668,0.00011816122,0.000065615706,0.000011833629,0.00003740225,0.0001118473,0.0023082956,0.000054947188,0.9807194,0.0028602479,0.013660394],"study_design_scores_gemma":[0.0000051187903,0.0000028183422,0.000013836467,0.0000108786635,0.0000027758042,0.000015753458,0.00001543415,0.0033382846,0.000041186788,0.9943816,0.002168768,0.000003437924],"about_ca_topic_score_codex":0.002581788,"about_ca_topic_score_gemma":0.0013943095,"teacher_disagreement_score":0.011381142,"about_ca_system_score_codex":0.0038651477,"about_ca_system_score_gemma":0.0027494454,"threshold_uncertainty_score":0.040430605},"labels":[],"label_agreement":null},{"id":"W1537414353","doi":"10.1007/978-3-642-04128-0_23","title":"Optimality and Competitiveness of Exploring Polygons by Mobile Robots","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Mobile robot; Focus (optics); Computer science; Robot; Trajectory; Boundary (topology); Metric (unit); Point (geometry); Square (algebra); Convex polygon; Point in polygon; Motion planning; Computer vision; Artificial intelligence; Regular polygon; Mathematics; Computer graphics (images); Geometry; Engineering","score_opus":0.032012159208564914,"score_gpt":0.26406943252698734,"score_spread":0.2320572733184224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537414353","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.56711847,0.002916074,0.2971343,0.0017299507,0.00022129128,0.00016350111,0.00081565336,0.0004800522,0.12942074],"genre_scores_gemma":[0.8861283,0.0014454116,0.0923435,0.0001232047,0.00020406238,0.0002132875,0.0007557265,0.0005391051,0.01824735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872977,0.00033803182,0.00005335719,0.00022142933,0.00032463094,0.0003327664],"domain_scores_gemma":[0.995675,0.0029384247,0.000325287,0.00031034957,0.0002601549,0.000490679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010164895,0.0009265455,0.0021944572,0.0011095178,0.001021165,0.0032392116,0.0022363237,0.0016776354,0.008525225],"category_scores_gemma":[0.0071665947,0.000834673,0.0015085139,0.0017965757,0.003246684,0.003742098,0.002461837,0.0022572414,0.0008896523],"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.0009633589,0.0001611635,0.0028255687,0.00039343708,0.00007495656,0.00026291423,0.0005356424,0.30935174,0.007682095,0.6156241,0.0071911854,0.054933798],"study_design_scores_gemma":[0.00014704833,0.00025011747,0.0021986265,0.00006966119,0.00005226615,0.00030141356,0.00035427228,0.34251556,0.0034353526,0.6435816,0.0070507647,0.000043291744],"about_ca_topic_score_codex":0.0038923817,"about_ca_topic_score_gemma":0.0031200114,"teacher_disagreement_score":0.008525225,"about_ca_system_score_codex":0.0013662461,"about_ca_system_score_gemma":0.0013397263,"threshold_uncertainty_score":0.02851969},"labels":[],"label_agreement":null},{"id":"W1537428274","doi":"10.1007/978-3-540-77129-6_75","title":"Shape-Based Image Retrieval Using k-Means Clustering and Neural Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Windsor","funders":"","keywords":"Pattern recognition (psychology); Image retrieval; Zernike polynomials; Artificial intelligence; Artificial neural network; Computer science; Cluster analysis; Disjoint sets; Feature vector; Similarity (geometry); Content-based image retrieval; Similarity measure; Image (mathematics); Mathematics","score_opus":0.033587202556801705,"score_gpt":0.27817181890415354,"score_spread":0.24458461634735185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537428274","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.016694365,0.0013497202,0.97682273,0.0001143414,0.00009919829,0.00012354426,0.00015119414,0.0021154867,0.002529426],"genre_scores_gemma":[0.16353124,0.0013176048,0.82799584,0.00013418321,0.000119619406,0.00015364154,0.0006228496,0.0003492391,0.0057758205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992895,0.00007416321,0.00004944129,0.00015234118,0.00035947785,0.000075047436],"domain_scores_gemma":[0.9993788,0.00014144987,0.00006334144,0.000109463705,0.00028672584,0.000020142415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068266806,0.0009441755,0.0021499118,0.0025825507,0.00070644636,0.0014529949,0.0018839891,0.001214631,0.0028153358],"category_scores_gemma":[0.0019069567,0.0006013328,0.0014630988,0.003741654,0.0006085235,0.0018844751,0.0011042431,0.00069631886,0.002418614],"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.00035969386,0.00015168032,0.00044544134,0.00026776956,0.00012627183,0.0000688063,0.000077334014,0.080268905,0.059430007,0.0031588662,0.0049611153,0.8506841],"study_design_scores_gemma":[0.000018657971,0.000062336105,0.0007700525,0.000018358774,0.00004640668,0.00016507243,0.00003996361,0.9709562,0.023205914,0.0030039214,0.0016726095,0.000040519302],"about_ca_topic_score_codex":0.008490099,"about_ca_topic_score_gemma":0.010781505,"teacher_disagreement_score":0.008490099,"about_ca_system_score_codex":0.0010831846,"about_ca_system_score_gemma":0.0007198019,"threshold_uncertainty_score":0.016881347},"labels":[],"label_agreement":null},{"id":"W1537431299","doi":"10.1007/11775096_25","title":"Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Multiset; Graph; Mathematics; Partition (number theory); Discrete mathematics; Time complexity; Split graph; Computer science; Pathwidth; Line graph","score_opus":0.019577771788288685,"score_gpt":0.2545518202272691,"score_spread":0.2349740484389804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537431299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45003396,0.00039077713,0.52796495,0.00037822427,0.000090921625,0.00017689119,0.0016059768,0.0026777743,0.016680432],"genre_scores_gemma":[0.75913906,0.0003030343,0.22320965,0.00018501015,0.00005985916,0.00016783517,0.0054770266,0.0006865175,0.0107721025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.000060708244,0.000033482407,0.00022034478,0.00010305914,0.00008988506],"domain_scores_gemma":[0.99785197,0.0007307917,0.00031798545,0.0006305451,0.00028970942,0.00017915928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002530369,0.00050818315,0.0008118052,0.0011286932,0.00090327335,0.0018008396,0.0012144361,0.0010655253,0.005452731],"category_scores_gemma":[0.002867854,0.00053320266,0.0006177671,0.0016912436,0.00087418733,0.0036006987,0.0011311301,0.00096942857,0.0012204627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011131624,0.000510855,0.013814142,0.00083330437,0.00009651434,0.0013589233,0.0018690204,0.057867907,0.11042082,0.35119653,0.019297007,0.44162175],"study_design_scores_gemma":[0.00007003367,0.00023336009,0.009647669,0.00011593992,0.00008904601,0.0019209678,0.0016270702,0.3007316,0.06344324,0.59546596,0.026574375,0.0000807546],"about_ca_topic_score_codex":0.001243772,"about_ca_topic_score_gemma":0.002286243,"teacher_disagreement_score":0.005452731,"about_ca_system_score_codex":0.00062532496,"about_ca_system_score_gemma":0.00052650267,"threshold_uncertainty_score":0.018241167},"labels":[],"label_agreement":null},{"id":"W1537433749","doi":"10.1007/978-3-540-30104-2_17","title":"An Agent Simulation Model for the Québec Forest Supply Chain","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Supply chain; Computer science; Incentive; Simulation modeling; Operations research; Chain (unit); Industrial engineering; Simulation; Microeconomics; Business; Marketing; Engineering","score_opus":0.12707539696724557,"score_gpt":0.3754211191258418,"score_spread":0.24834572215859624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537433749","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.56592894,0.0018733125,0.26647538,0.0038136241,0.00022759326,0.00054634,0.0055326107,0.00095510104,0.15464719],"genre_scores_gemma":[0.92420506,0.0007438439,0.02312053,0.00015585824,0.000027100044,0.00030527991,0.0010732682,0.00007072689,0.050298277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997627,0.00009159937,0.000008245492,0.00003677809,0.000041661002,0.00005893246],"domain_scores_gemma":[0.9995022,0.0002387158,0.00003817096,0.000016591048,0.00014813848,0.000056308003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048604223,0.00068887655,0.00092202425,0.00078060135,0.0018136513,0.002212641,0.0020960355,0.0023564827,0.011608091],"category_scores_gemma":[0.001342342,0.00064249354,0.0006947983,0.0013171404,0.0008844361,0.0009734092,0.00072485406,0.00090851996,0.00073825056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003923229,0.000019800858,0.0005779445,0.000011346456,0.000012209895,0.000071223185,0.000039764123,0.98871464,0.00017226968,0.0080614295,0.0006716884,0.001608415],"study_design_scores_gemma":[0.000014753988,0.000007596969,0.00018042835,0.0000048828633,0.000006043878,0.000004762702,0.000020495725,0.9980046,0.000032641285,0.0009248946,0.00079282856,0.0000060589173],"about_ca_topic_score_codex":0.8590979,"about_ca_topic_score_gemma":0.7970247,"teacher_disagreement_score":0.1409021,"about_ca_system_score_codex":0.009866011,"about_ca_system_score_gemma":0.008633784,"threshold_uncertainty_score":0.28346378},"labels":[],"label_agreement":null},{"id":"W1537460407","doi":"10.1007/11549468_65","title":"A Novel Lightweight Directory Architecture for Scalable Shared-Memory Multiprocessors","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"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":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Directory; Computer science; Scalability; Cache coherence; Operating system; Cache-only memory architecture; Lightweight Directory Access Protocol; Shared memory; Distributed shared memory; Directory service; Parallel computing; Computer architecture; Uniform memory access; Computer network; CPU cache; Cache; Memory management; Cache algorithms; Overlay","score_opus":0.01762340893797223,"score_gpt":0.25552755548724093,"score_spread":0.2379041465492687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537460407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098343454,0.002592058,0.8679017,0.0006273851,0.00064524804,0.00018615692,0.0005712144,0.019088272,0.010044554],"genre_scores_gemma":[0.49233767,0.00079665036,0.48760897,0.00027114333,0.00034919073,0.0003833073,0.0015001951,0.0006008972,0.016151937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.0000530057,0.000033056716,0.00005079049,0.00013051138,0.00007901691],"domain_scores_gemma":[0.9992461,0.000111523055,0.00005840023,0.0003031075,0.00018693473,0.0000939611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004080818,0.00045157035,0.00064271735,0.00086168846,0.0012009667,0.001275664,0.002808486,0.0005975438,0.0048303017],"category_scores_gemma":[0.0009943694,0.00042236032,0.00029201803,0.0013159428,0.0003950297,0.0021404447,0.002065641,0.00072036695,0.0013221425],"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.002198888,0.00044132367,0.0023569574,0.0010843922,0.00013953628,0.0004257603,0.00044595645,0.0615557,0.15490438,0.099703796,0.08184649,0.59489685],"study_design_scores_gemma":[0.00041181347,0.0010097299,0.0013308127,0.00007445073,0.00019920172,0.0005852944,0.00018145653,0.77346486,0.07432544,0.051953793,0.096324995,0.00013815022],"about_ca_topic_score_codex":0.0013108236,"about_ca_topic_score_gemma":0.004031055,"teacher_disagreement_score":0.0048303017,"about_ca_system_score_codex":0.00072461856,"about_ca_system_score_gemma":0.0010742045,"threshold_uncertainty_score":0.016158938},"labels":[],"label_agreement":null},{"id":"W1537473998","doi":"10.1007/11510888_57","title":"Text Classification Using Small Number of Features","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Information retrieval","score_opus":0.040018100165544614,"score_gpt":0.2860904354397913,"score_spread":0.24607233527424668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537473998","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.10972972,0.0025847065,0.85938656,0.0005843732,0.0008998488,0.000796195,0.004365361,0.011252381,0.010400853],"genre_scores_gemma":[0.481261,0.0010852634,0.46869773,0.0002948949,0.0007476949,0.0010794341,0.01325318,0.00045417467,0.03312675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906975,0.00013238145,0.000112796224,0.00025868486,0.00034845588,0.00007788661],"domain_scores_gemma":[0.99771106,0.0011696843,0.00011416208,0.00045123225,0.00046683324,0.00008699799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726835,0.0011686026,0.0015498778,0.0029339415,0.0007693117,0.0013742403,0.0010170566,0.001011874,0.009968307],"category_scores_gemma":[0.0036518672,0.00033601228,0.0011485794,0.0028855514,0.00033538177,0.0029684403,0.0011587683,0.00083107984,0.008423195],"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.0005413413,0.00024833603,0.001638038,0.00023394088,0.00009542357,0.00017186615,0.000033170698,0.0038168048,0.052363258,0.0010661407,0.011719549,0.9280721],"study_design_scores_gemma":[0.00020423389,0.0013436365,0.018689757,0.00014106088,0.00045452398,0.0017368101,0.00024151309,0.7912732,0.12297263,0.01949859,0.04332076,0.00012338236],"about_ca_topic_score_codex":0.0010742598,"about_ca_topic_score_gemma":0.001772072,"teacher_disagreement_score":0.009968307,"about_ca_system_score_codex":0.0003399087,"about_ca_system_score_gemma":0.000628986,"threshold_uncertainty_score":0.03334731},"labels":[],"label_agreement":null},{"id":"W1537507437","doi":"10.1007/11766247_42","title":"The K Best-Paths Approach to Approximate Dynamic Programming with Application to Portfolio Optimization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Dynamic programming; Reinforcement learning; Mathematical optimization; Markov decision process; Portfolio; Kernel (algebra); Controller (irrigation); Sharpe ratio; Project portfolio management; Portfolio optimization; Artificial intelligence; Markov process; Algorithm; Mathematics; Finance; Project management","score_opus":0.008187980339184919,"score_gpt":0.22828879796239565,"score_spread":0.22010081762321074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537507437","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.0020817963,0.0005582009,0.99507326,0.00015681727,0.000045270444,0.000014043804,0.000022063685,0.00008349688,0.001965076],"genre_scores_gemma":[0.21683522,0.0020748961,0.77045745,0.00017612881,0.00019464974,0.0003190157,0.00016166698,0.00027751317,0.009503477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905676,0.0005241621,0.00004546697,0.00013475351,0.00018616267,0.000052738338],"domain_scores_gemma":[0.9970475,0.0022730879,0.00013945853,0.0001643621,0.0002662868,0.00010940047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023648187,0.0015691125,0.0020843223,0.0011789235,0.0008165988,0.0016940362,0.0021793947,0.0026148702,0.004389616],"category_scores_gemma":[0.0109311035,0.0013887997,0.0012400569,0.002405591,0.0020168985,0.002937543,0.0025803274,0.0033408422,0.0006769713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046067762,0.00004633194,0.00034318745,0.00009138483,0.000059343605,0.00004672459,0.00006153781,0.8111172,0.0002536834,0.12192557,0.0019469026,0.0640621],"study_design_scores_gemma":[0.000006384874,0.00000924496,0.000028250077,0.0000071901213,0.0000051747625,0.000010733089,0.000004504538,0.9400777,0.000046878777,0.059251346,0.00054724613,0.0000052519035],"about_ca_topic_score_codex":0.0055628116,"about_ca_topic_score_gemma":0.005585606,"teacher_disagreement_score":0.0055628116,"about_ca_system_score_codex":0.0012910868,"about_ca_system_score_gemma":0.0016168661,"threshold_uncertainty_score":0.014684737},"labels":[],"label_agreement":null},{"id":"W1537572056","doi":"10.1007/978-3-642-14785-2_2","title":"An Energy Efficient Power Control Protocol for Ad Hoc Networks Using Directional Antennas","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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 Victoria","funders":"","keywords":"Computer science; Omnidirectional antenna; Directional antenna; Wireless ad hoc network; Computer network; Power control; Transmission (telecommunications); Node (physics); Transmitter power output; Mobile ad hoc network; Wireless; Wireless network; Power (physics); Telecommunications; Transmitter; Channel (broadcasting); Antenna (radio); Network packet; Engineering","score_opus":0.013659303393195304,"score_gpt":0.2666508605373502,"score_spread":0.2529915571441549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537572056","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.00486926,0.0007670732,0.98700047,0.00013015387,0.00027520568,0.00009640188,0.000035238452,0.0007992004,0.006027138],"genre_scores_gemma":[0.39734274,0.002212405,0.55930054,0.00043342245,0.00044956722,0.00059428957,0.0003618494,0.00029100163,0.039014168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996921,0.00006160891,0.000026505979,0.000031799653,0.00016256634,0.00002551195],"domain_scores_gemma":[0.9996,0.00018719345,0.000026045225,0.00006963559,0.00010251048,0.000014568488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045008768,0.0006450373,0.00045891947,0.00039969652,0.00038776436,0.00070408545,0.0010770268,0.00049631356,0.0023870708],"category_scores_gemma":[0.00089056016,0.0002504347,0.00028401305,0.0005064112,0.00044197612,0.0008432688,0.0006568297,0.0010056305,0.0006549172],"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.00038668764,0.00026787687,0.00029409636,0.00033517103,0.00010772036,0.00039738562,0.00023360271,0.1635234,0.09746773,0.11753834,0.019921146,0.5995268],"study_design_scores_gemma":[0.00013702209,0.00044552787,0.00044414573,0.00004806736,0.00012485239,0.0007849939,0.00006328382,0.8603966,0.036527306,0.04097635,0.05998477,0.00006708358],"about_ca_topic_score_codex":0.0003498344,"about_ca_topic_score_gemma":0.0008040203,"teacher_disagreement_score":0.0023870708,"about_ca_system_score_codex":0.00025930777,"about_ca_system_score_gemma":0.00027243994,"threshold_uncertainty_score":0.007985592},"labels":[],"label_agreement":null},{"id":"W1537646727","doi":"10.1007/978-3-642-15711-0_23","title":"Segmentation of Cortical MS Lesions on MRI Using Automated Laminar Profile Shape Analysis","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Multiple Sclerosis Research Studies","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Grey matter; White matter; Magnetic resonance imaging; Segmentation; Multiple sclerosis; Computer science; Image segmentation; Artificial intelligence; Grey level; Partial volume; Pattern recognition (psychology); Medicine; Radiology","score_opus":0.044154730135293134,"score_gpt":0.36740121500331735,"score_spread":0.3232464848680242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537646727","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.33081862,0.0009144601,0.66122633,0.00024409985,0.000040463645,0.00031155115,0.0005427235,0.00338656,0.0025152115],"genre_scores_gemma":[0.5375167,0.0004992289,0.4586743,0.00008230049,0.000037961745,0.000115955416,0.0005995868,0.0005766459,0.0018972895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997638,0.000046863963,0.000024612998,0.000037528913,0.00006899497,0.000058163732],"domain_scores_gemma":[0.9993537,0.0001923723,0.00008115588,0.00010384529,0.00023170719,0.000037175887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007366328,0.00049919495,0.0005474743,0.002692339,0.00053650874,0.0018317166,0.00058890705,0.00081650814,0.0011166342],"category_scores_gemma":[0.0014100483,0.0004669934,0.0006559288,0.0012651676,0.00035895623,0.00066265924,0.0006046457,0.00043202774,0.00073496153],"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.0013888692,0.00018643464,0.014060068,0.00046519825,0.00015413052,0.0007990519,0.0008805033,0.03584236,0.35986817,0.003150629,0.002553072,0.58065146],"study_design_scores_gemma":[0.00008897507,0.000351079,0.04419868,0.00016849002,0.00019877094,0.0031841602,0.00076076086,0.69037616,0.24230628,0.010215355,0.008003448,0.00014794424],"about_ca_topic_score_codex":0.0038390919,"about_ca_topic_score_gemma":0.004359525,"teacher_disagreement_score":0.0038390919,"about_ca_system_score_codex":0.00040050742,"about_ca_system_score_gemma":0.0015497082,"threshold_uncertainty_score":0.0076335073},"labels":[],"label_agreement":null},{"id":"W1537678260","doi":"10.1007/978-3-540-73368-3_2","title":"A Mathematical Approach to RTL Verification","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Verilog; Programming language; Formal verification; Floating point; High-level verification; Simple (philosophy); Functional verification; Microprocessor; Embedded system; Field-programmable gate array; Software; Software development","score_opus":0.05664458941576381,"score_gpt":0.3078611762955581,"score_spread":0.2512165868797943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537678260","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.0006465247,0.00073145726,0.97078526,0.0007944817,0.00020294137,0.000037349222,0.000071978786,0.00050149305,0.026228527],"genre_scores_gemma":[0.14931248,0.004200835,0.7816135,0.0014684751,0.0013122039,0.00059255754,0.00034269688,0.0012009933,0.059956137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983285,0.00039259737,0.00016330859,0.00025171318,0.00075430144,0.000109574874],"domain_scores_gemma":[0.9981268,0.0010758365,0.00012652566,0.0003728914,0.0002587171,0.00003930505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016607344,0.0012685644,0.0009395043,0.0019452493,0.0012919232,0.0033959863,0.0027392441,0.0015929579,0.015042375],"category_scores_gemma":[0.0046640756,0.0014679065,0.002299142,0.0015405369,0.005266787,0.0081530325,0.0024767444,0.005723513,0.0054038316],"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.000006162316,0.000010261739,0.000015874422,0.00008036504,0.0000071687077,0.000035587298,0.00008521031,0.0022288586,0.00056723534,0.9795694,0.002337171,0.015056669],"study_design_scores_gemma":[0.000008963669,0.00001057545,0.000020471016,0.00004267861,0.000012261772,0.000098636614,0.000015235111,0.0129181575,0.0011600868,0.9588963,0.026802449,0.000014063957],"about_ca_topic_score_codex":0.000869645,"about_ca_topic_score_gemma":0.0008718727,"teacher_disagreement_score":0.015042375,"about_ca_system_score_codex":0.002185127,"about_ca_system_score_gemma":0.0011627572,"threshold_uncertainty_score":0.0503217},"labels":[],"label_agreement":null},{"id":"W1537741773","doi":"10.1007/978-3-642-04238-6_61","title":"Using Answer Set Programming to Enhance Operating System Discovery","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Computer science; Answer set programming; Set (abstract data type); Programming language; Theoretical computer science","score_opus":0.02440303175057502,"score_gpt":0.2845097389681351,"score_spread":0.2601067072175601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537741773","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.008272482,0.000173751,0.97781575,0.00058037514,0.00008413965,0.0001248212,0.00023337424,0.0067831893,0.005932174],"genre_scores_gemma":[0.09755469,0.00018548152,0.8960188,0.0002665374,0.000097053235,0.00012426019,0.0010761687,0.0010138035,0.0036632228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932167,0.0019218863,0.0005284477,0.0010885481,0.0028066891,0.00043776276],"domain_scores_gemma":[0.9800408,0.013940336,0.0007666567,0.0030692967,0.0017539953,0.00042903825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062725535,0.0009322934,0.001232375,0.0033764697,0.0014552771,0.005190538,0.004544996,0.001748469,0.011711638],"category_scores_gemma":[0.025537722,0.0011039854,0.0023122742,0.0026422245,0.0015501316,0.011859428,0.0041007414,0.004173634,0.0028946537],"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.00060559745,0.0008629504,0.0042590597,0.00072361314,0.00022963253,0.00041827786,0.0012684495,0.030555168,0.013888394,0.20849502,0.019475127,0.71921873],"study_design_scores_gemma":[0.00010560222,0.00011935162,0.0005992698,0.0001487951,0.00015539615,0.00039617324,0.00028236196,0.52241665,0.025429247,0.41805097,0.03221917,0.00007693224],"about_ca_topic_score_codex":0.0015349765,"about_ca_topic_score_gemma":0.0036982445,"teacher_disagreement_score":0.011711638,"about_ca_system_score_codex":0.0010162441,"about_ca_system_score_gemma":0.001798821,"threshold_uncertainty_score":0.039179325},"labels":[],"label_agreement":null},{"id":"W1537817240","doi":"10.1007/3-540-46117-5_24","title":"A Method for Implementing Bit-Serial Finite Impulse Response Digital Filters in FPGAs Using JBits™","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Filter Design and Implementation","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 Calgary","funders":"","keywords":"Field-programmable gate array; Finite impulse response; Computer science; Digital filter; Filter (signal processing); Computer hardware; Impulse (physics); Infinite impulse response; Algorithm; Parallel computing; Computer vision","score_opus":0.05551890811338977,"score_gpt":0.31896545903387397,"score_spread":0.2634465509204842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537817240","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.0066263145,0.00019269923,0.98679334,0.00004523296,0.00013076352,0.000065890374,0.0000261273,0.00143097,0.004688631],"genre_scores_gemma":[0.07157892,0.0002853098,0.9133542,0.000081444676,0.000042344996,0.00012385736,0.00010526926,0.00012147471,0.01430708],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981135,0.000022178658,0.000017415385,0.000028098579,0.00010453827,0.00001641433],"domain_scores_gemma":[0.999826,0.000047498266,0.000019030269,0.00004391188,0.000054056334,0.00000938991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017316976,0.000687362,0.00027013847,0.00045511173,0.00038691136,0.0006084812,0.00070502347,0.00033609202,0.0060252724],"category_scores_gemma":[0.00038535945,0.00038415106,0.0003904073,0.00044352232,0.0002505587,0.00053814816,0.00030891565,0.0004997987,0.0017978085],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027557375,0.000093131166,0.00045456993,0.00042136392,0.000081534374,0.0003099769,0.00018139496,0.01131486,0.16872704,0.03661855,0.0060917498,0.7754303],"study_design_scores_gemma":[0.0003402437,0.0011222535,0.0015221968,0.00026868738,0.0002810497,0.004995389,0.00014989788,0.30915487,0.46043697,0.028632829,0.192926,0.00016967345],"about_ca_topic_score_codex":0.000556411,"about_ca_topic_score_gemma":0.0013768827,"teacher_disagreement_score":0.0060252724,"about_ca_system_score_codex":0.00022720514,"about_ca_system_score_gemma":0.00028314977,"threshold_uncertainty_score":0.020156562},"labels":[],"label_agreement":null},{"id":"W1537870","doi":"10.1007/978-3-319-11656-3_17","title":"Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificial Neural Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","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 Manitoba","funders":"","keywords":"Transposable element; Support vector machine; Sleeping Beauty transposon system; Artificial neural network; Artificial intelligence; Computer science; Selection (genetic algorithm); Functional genomics; Genome; Machine learning; Pattern recognition (psychology); Genomics; Biology; Genetics; Gene","score_opus":0.019576614467808968,"score_gpt":0.25282321789616585,"score_spread":0.23324660342835687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537870","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.53896636,0.0015604737,0.4552304,0.00018300478,0.00008738663,0.00006152265,0.0009832388,0.0012207506,0.0017068493],"genre_scores_gemma":[0.8200951,0.00071191177,0.17459816,0.000050068524,0.00005982271,0.00005382142,0.0017610788,0.00008896946,0.0025810455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998061,0.00003935725,0.000017452669,0.000063924934,0.000051355917,0.000021875527],"domain_scores_gemma":[0.99872476,0.0009181732,0.00011437817,0.00004239502,0.00016536022,0.00003492598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061481376,0.00062611717,0.00056462816,0.00067951676,0.00016253341,0.00057577505,0.0005235039,0.000546989,0.0010193707],"category_scores_gemma":[0.0018356983,0.00029298375,0.000694942,0.00063213444,0.00014324798,0.00067455653,0.00024393562,0.0008699454,0.00056562165],"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.000800523,0.00030834667,0.021090668,0.00022776182,0.00016363506,0.00017488387,0.000054292774,0.42946643,0.038255107,0.0011260957,0.0020974812,0.50623477],"study_design_scores_gemma":[0.0000051037337,0.000038020313,0.0016187514,0.0000054992975,0.000009739714,0.000023791234,0.000010524123,0.99440926,0.003100893,0.0006576069,0.00011353995,0.0000072062785],"about_ca_topic_score_codex":0.0020703045,"about_ca_topic_score_gemma":0.0030368087,"teacher_disagreement_score":0.0020703045,"about_ca_system_score_codex":0.000264901,"about_ca_system_score_gemma":0.00025205236,"threshold_uncertainty_score":0.004116535},"labels":[],"label_agreement":null},{"id":"W1537894905","doi":"10.1007/11428848_113","title":"A Data-Adaptive Approach to cDNA Microarray Image Enhancement","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Noise (video); Filter (signal processing); Weighting; Artificial intelligence; Pattern recognition (psychology); Complementary DNA; Image (mathematics); Sliding window protocol; Image processing; Computer vision; Data mining; Window (computing); Biology; Physics","score_opus":0.029867005599864587,"score_gpt":0.2764805520070064,"score_spread":0.2466135464071418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537894905","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.0016711784,0.00013814955,0.99711823,0.00005433234,0.00003330445,0.00003300937,0.00003199439,0.0005440078,0.00037581063],"genre_scores_gemma":[0.019277403,0.00032487695,0.9767646,0.00010166977,0.000042970853,0.00012001809,0.0001610529,0.00016694883,0.0030404367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945563,0.00008268269,0.000038325594,0.00012024249,0.00025585352,0.0000473183],"domain_scores_gemma":[0.9990509,0.00038106387,0.000042603242,0.00018528271,0.0003098185,0.00003029507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009064906,0.00082197506,0.0008451766,0.00087404286,0.00034826345,0.0008074794,0.0017991848,0.00074239186,0.0033233296],"category_scores_gemma":[0.0015234635,0.0005661462,0.0010284391,0.0011366794,0.00063427235,0.00075798354,0.0014105747,0.0012339297,0.0015611204],"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.00018932969,0.00012661451,0.00027076938,0.00020489917,0.00006858872,0.000103911145,0.00006912746,0.022445302,0.36254036,0.008108179,0.002810514,0.60306245],"study_design_scores_gemma":[0.000028444441,0.00011649881,0.00083569746,0.000018909832,0.00006564124,0.0004699902,0.000037862264,0.71129334,0.2610908,0.011456019,0.014539349,0.00004737701],"about_ca_topic_score_codex":0.0009455182,"about_ca_topic_score_gemma":0.0014980172,"teacher_disagreement_score":0.0033233296,"about_ca_system_score_codex":0.00042625132,"about_ca_system_score_gemma":0.0004964039,"threshold_uncertainty_score":0.011117578},"labels":[],"label_agreement":null},{"id":"W1537921975","doi":"10.1007/11860990_11","title":"Towards a Formal Semantics for AspectJ Weaving","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Concordia University","funders":"","keywords":"AspectJ; Bytecode; Programming language; Aspect-oriented programming; Computer science; Weaving; Java; Semantics (computer science); Focus (optics); Class (philosophy); Software engineering; Software; Engineering; Artificial intelligence","score_opus":0.025686241016914794,"score_gpt":0.25778956004475123,"score_spread":0.23210331902783643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537921975","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.0021614002,0.00021301057,0.991702,0.00038752452,0.00014586306,0.000088351786,0.00008025105,0.0016909572,0.0035305193],"genre_scores_gemma":[0.10214425,0.00068837975,0.8892471,0.0005263644,0.00029506552,0.00034109488,0.00040661413,0.001679884,0.004671153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99444807,0.0012605328,0.0009220258,0.00089602626,0.0019209742,0.000552344],"domain_scores_gemma":[0.9943825,0.0018803602,0.00038598382,0.0015058469,0.0015873697,0.0002579192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052440106,0.00144706,0.0012574537,0.0021265815,0.0022452392,0.007690081,0.003760516,0.0028292765,0.003989528],"category_scores_gemma":[0.008710478,0.0025656268,0.0025224185,0.002429544,0.006131402,0.011424525,0.0055568484,0.008292182,0.0018272026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004560567,0.00006404145,0.0002519333,0.00023304929,0.000027548955,0.0001574444,0.0012428336,0.0031726656,0.0036617382,0.94803256,0.0029075404,0.04020303],"study_design_scores_gemma":[0.00005697819,0.000042210995,0.00015704121,0.00018832766,0.000087457134,0.00036067623,0.00035852342,0.036802594,0.0077172634,0.8745815,0.07957203,0.00007542613],"about_ca_topic_score_codex":0.004084633,"about_ca_topic_score_gemma":0.0043942886,"teacher_disagreement_score":0.007690081,"about_ca_system_score_codex":0.0015606433,"about_ca_system_score_gemma":0.0027746388,"threshold_uncertainty_score":0.027733326},"labels":[],"label_agreement":null},{"id":"W1537988608","doi":"10.1007/978-3-642-23765-2","title":"Human-Computer Interaction – INTERACT 2011","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":268,"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":"Human interaction; Set (abstract data type); Computer science; Volume (thermodynamics); Human–computer interaction; World Wide Web; Physics; Programming language","score_opus":0.028839607579266426,"score_gpt":0.29161251588461284,"score_spread":0.26277290830534644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537988608","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005668115,0.088176005,0.21930781,0.002885262,0.018329455,0.00025862418,0.0010711192,0.008409284,0.65589434],"genre_scores_gemma":[0.010753057,0.02421128,0.018254256,0.00046776165,0.0013524817,0.00015465629,0.0011945767,0.0008835894,0.94272834],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948955,0.000055021505,0.000023419601,0.00009699807,0.00029436356,0.000040489995],"domain_scores_gemma":[0.999308,0.0002305922,0.000024531584,0.000103290105,0.00023406117,0.00009950199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059396285,0.0019272187,0.0013206274,0.001292426,0.0007694194,0.00284098,0.0013865372,0.0017434144,0.10874242],"category_scores_gemma":[0.000966512,0.00079682487,0.0005744983,0.0016293918,0.000677403,0.0038670758,0.0014790419,0.0022768269,0.07006095],"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.00010045453,0.00010529964,0.000109248766,0.0005451583,0.000026105628,0.00007824034,0.000104371444,0.0012592452,0.005904635,0.01086143,0.3987977,0.58210814],"study_design_scores_gemma":[0.000018884803,0.00012018786,0.0011486599,0.00036651996,0.000041606974,0.0007711645,0.000069480964,0.0065100933,0.0041613425,0.0073300074,0.97942126,0.000040904106],"about_ca_topic_score_codex":0.001447892,"about_ca_topic_score_gemma":0.0028397175,"teacher_disagreement_score":0.10874242,"about_ca_system_score_codex":0.0007765749,"about_ca_system_score_gemma":0.00082042365,"threshold_uncertainty_score":0.3637796},"labels":[],"label_agreement":null},{"id":"W1538002354","doi":"10.1007/3-540-45111-0_5","title":"Adaptive Portals with Wireless Components","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Computer science; Context (archaeology); Task (project management); Wireless; Class (philosophy); World Wide Web; Multimedia; Human–computer interaction; Telecommunications; Artificial intelligence","score_opus":0.14289946103555148,"score_gpt":0.349407998715736,"score_spread":0.20650853768018454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538002354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050607417,0.0003365803,0.9304881,0.00015524031,0.0001153208,0.00007551564,0.000049164562,0.0057043424,0.0124682905],"genre_scores_gemma":[0.751092,0.00039736094,0.22155109,0.00011621151,0.0000834984,0.0001127273,0.00016060912,0.00041395216,0.026072487],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995567,0.00013135101,0.000025813833,0.00010388769,0.0001260716,0.0000560463],"domain_scores_gemma":[0.9989248,0.00039344112,0.000068633286,0.0003809124,0.00015050922,0.00008169828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005949192,0.00047107018,0.0005712022,0.0005644853,0.00042779025,0.0014382455,0.0012916666,0.00079878897,0.008935269],"category_scores_gemma":[0.0024975757,0.0004277101,0.0003620707,0.0008625679,0.0004506658,0.002707948,0.001644311,0.0008184458,0.0023590557],"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.001735514,0.0008416988,0.0032945795,0.00027814473,0.00012649591,0.0005646551,0.00057174853,0.047076926,0.078433506,0.10379625,0.01239461,0.75088596],"study_design_scores_gemma":[0.00034616073,0.0008322369,0.0026039719,0.00008084924,0.00019922921,0.0010665217,0.00026545886,0.7784597,0.06307436,0.100336954,0.05264294,0.000091620386],"about_ca_topic_score_codex":0.0005294398,"about_ca_topic_score_gemma":0.00045700127,"teacher_disagreement_score":0.008935269,"about_ca_system_score_codex":0.0002046897,"about_ca_system_score_gemma":0.0001842093,"threshold_uncertainty_score":0.029891491},"labels":[],"label_agreement":null},{"id":"W1538069762","doi":"10.1007/978-3-540-69927-9_7","title":"Programmed Graph Rewriting with Time for Simulation-Based Design","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Rewriting; Graph; Theoretical computer science; Programming language; Graph rewriting","score_opus":0.023719394307800665,"score_gpt":0.24463655799079642,"score_spread":0.22091716368299574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538069762","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.0020993005,0.00016306624,0.9916367,0.000056985253,0.00004331536,0.000038504393,0.000019811594,0.00064635783,0.0052959304],"genre_scores_gemma":[0.18616274,0.00057636126,0.8001318,0.00014528693,0.0000546311,0.00026501558,0.0001781008,0.00081918546,0.011666871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986198,0.0005143358,0.00008477745,0.00017934042,0.00052878284,0.000072981886],"domain_scores_gemma":[0.9987356,0.0006678991,0.00005485587,0.00037186628,0.00013986367,0.000029880706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010056928,0.0008806411,0.0006270476,0.00053224375,0.0004235398,0.001089619,0.0016009673,0.00072545774,0.005884722],"category_scores_gemma":[0.0028536804,0.0007058615,0.0012059262,0.0004789207,0.0015135824,0.0014635008,0.0010512893,0.0020176328,0.0012763755],"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.00009662401,0.00007365643,0.0001475113,0.00027006704,0.00006194963,0.0001392955,0.00029533467,0.19695619,0.015496264,0.6636599,0.00243915,0.12036404],"study_design_scores_gemma":[0.000052040203,0.00009684615,0.00006162335,0.000074188196,0.00007520679,0.000105572886,0.000034500154,0.4973266,0.018234206,0.4546917,0.029215897,0.000031500378],"about_ca_topic_score_codex":0.001370505,"about_ca_topic_score_gemma":0.0016697476,"teacher_disagreement_score":0.005884722,"about_ca_system_score_codex":0.0008533855,"about_ca_system_score_gemma":0.0007590342,"threshold_uncertainty_score":0.0196864},"labels":[],"label_agreement":null},{"id":"W1538131118","doi":"10.1007/11548706_38","title":"Relevant Attribute Discovery in High Dimensional Data Based on Rough Sets and Unsupervised Classification: Application to Leukemia Gene Expressions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"National Research Council Canada","funders":"","keywords":"Rough set; Artificial intelligence; Computer science; Pattern recognition (psychology); High dimensional; Data mining","score_opus":0.03730734188509197,"score_gpt":0.26651628584009224,"score_spread":0.22920894395500027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538131118","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.032232385,0.0013564233,0.9642753,0.00040037333,0.00006153905,0.000068374604,0.0001236358,0.00031710006,0.0011648024],"genre_scores_gemma":[0.17735524,0.0014365587,0.81932276,0.00007671885,0.00012476105,0.00013539777,0.0002481837,0.00006414956,0.0012362592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831486,0.0006107871,0.00014054212,0.00016246444,0.00071269315,0.000058573045],"domain_scores_gemma":[0.9941409,0.004791987,0.00023673938,0.00029121278,0.00048303814,0.00005600683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035714386,0.00061196665,0.0022141996,0.0020871398,0.00072616845,0.0021787828,0.0010860178,0.0008102209,0.00068250846],"category_scores_gemma":[0.009107933,0.00040067756,0.0018340006,0.0038209446,0.0009504402,0.0014513418,0.0011068871,0.0019006297,0.0002443269],"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.0003407735,0.0004018825,0.0036543957,0.0006650048,0.00023347583,0.0005311871,0.0012539914,0.18276212,0.01659645,0.059529636,0.005609245,0.72842187],"study_design_scores_gemma":[0.000025465615,0.000081849095,0.0019339272,0.000032872966,0.000074579555,0.00028841812,0.0001746697,0.9064063,0.006836522,0.081503056,0.0025932146,0.00004914734],"about_ca_topic_score_codex":0.0009899762,"about_ca_topic_score_gemma":0.0013860051,"teacher_disagreement_score":0.0035714386,"about_ca_system_score_codex":0.0006883899,"about_ca_system_score_gemma":0.0008491716,"threshold_uncertainty_score":0.018887758},"labels":[],"label_agreement":null},{"id":"W1538136384","doi":"10.1007/11774129_2","title":"Foundations of Agile Decision Making from Agile Mentors and Developers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Calgary","funders":"","keywords":"Agile software development; Computer science; Interview; Agile usability engineering; Agile Unified Process; Management science; Context (archaeology); Business decision mapping; Knowledge management; Software engineering; Software; Software development; Decision support system; Software development process; Engineering; Artificial intelligence; Sociology","score_opus":0.01635601027326155,"score_gpt":0.27038276416590223,"score_spread":0.2540267538926407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538136384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013690645,0.0032261105,0.8543229,0.007517858,0.00021625611,0.00010727612,0.00013138844,0.00014806548,0.1206395],"genre_scores_gemma":[0.6477914,0.0032041231,0.3308062,0.00057220424,0.0004094081,0.00030988918,0.00022459723,0.00011006719,0.016572157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9960969,0.0019423212,0.0002531073,0.000488871,0.0008850714,0.0003335884],"domain_scores_gemma":[0.98290515,0.012422927,0.0009325396,0.0020079878,0.0012347953,0.0004966458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046688085,0.0008142262,0.0005911444,0.0017454745,0.0019019754,0.0061571514,0.0019725235,0.002383704,0.005980506],"category_scores_gemma":[0.016071575,0.0013692525,0.0007609878,0.0024390486,0.0074507603,0.008098402,0.0037782518,0.005208481,0.0011529437],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000734614,0.000017149949,0.00017470108,0.000028748933,0.000006426369,0.000049108377,0.00038375548,0.0016424942,0.00008393208,0.9828335,0.0007772064,0.0139957005],"study_design_scores_gemma":[0.000005387251,0.0000071027325,0.00016520641,0.000045788398,0.000004124392,0.000042358493,0.00012422077,0.0065512713,0.0001200381,0.9874566,0.0054703844,0.0000075359917],"about_ca_topic_score_codex":0.0033851345,"about_ca_topic_score_gemma":0.0027113508,"teacher_disagreement_score":0.0061571514,"about_ca_system_score_codex":0.002540901,"about_ca_system_score_gemma":0.0030302037,"threshold_uncertainty_score":0.024691284},"labels":[],"label_agreement":null},{"id":"W1538186882","doi":"10.1007/978-3-642-04271-3_134","title":"A Fully Automatic Random Walker Segmentation for Skin Lesions in a Supervised Setting","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Coastal Health Research Institute; University of British Columbia; Vancouver Coastal Health; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Initialization; Artificial intelligence; Segmentation; Leverage (statistics); Robustness (evolution); Pattern recognition (psychology); Market segmentation; Random walker algorithm; Image segmentation; Random forest; Computer vision; Image (mathematics)","score_opus":0.012127120013077962,"score_gpt":0.27479988779070985,"score_spread":0.2626727677776319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538186882","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.01578949,0.00017510512,0.97626275,0.000081200196,0.00004815859,0.00011979981,0.00029782092,0.0064912373,0.00073447265],"genre_scores_gemma":[0.08883403,0.00016891795,0.90459704,0.00009339547,0.00005436219,0.00013847691,0.00121312,0.0010545062,0.003846196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994442,0.00010022558,0.000035957204,0.00018967126,0.00016851719,0.00006148675],"domain_scores_gemma":[0.9994276,0.0001829812,0.00005084413,0.00012318634,0.0001611216,0.000054199896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587975,0.00094472617,0.0019745154,0.001781255,0.00057920336,0.0010967535,0.0016704617,0.0022893483,0.004723511],"category_scores_gemma":[0.0014344614,0.0009867502,0.0012771556,0.0011225294,0.0003373184,0.00092496263,0.0012089614,0.0009142765,0.0038946096],"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.00051865424,0.0002743809,0.0011847299,0.00020027068,0.00014700418,0.00022575521,0.00008338593,0.046502534,0.14369504,0.0022274975,0.008689508,0.79625124],"study_design_scores_gemma":[0.000028876622,0.000085016174,0.00084869633,0.000013967431,0.000030127441,0.00027246407,0.000015181774,0.97151744,0.022600606,0.0022232675,0.00233816,0.000026269403],"about_ca_topic_score_codex":0.003329348,"about_ca_topic_score_gemma":0.007524224,"teacher_disagreement_score":0.004723511,"about_ca_system_score_codex":0.0003650314,"about_ca_system_score_gemma":0.0012539524,"threshold_uncertainty_score":0.015801728},"labels":[],"label_agreement":null},{"id":"W1538363243","doi":"10.1007/978-3-540-25959-6_21","title":"Meta-Modelling, Graph Transformation and Model Checking for the Analysis of Hybrid Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Rotation formalisms in three dimensions; Petri net; Reachability; Computer science; Graph rewriting; Stochastic Petri net; Model checking; Formalism (music); Graph; Theoretical computer science; Model transformation; Transformation (genetics); Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.042253071780074994,"score_gpt":0.24784077524035175,"score_spread":0.20558770346027677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538363243","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.005191123,0.00068951305,0.9915411,0.00011074864,0.000026137166,0.000026253681,0.00004576562,0.00086154824,0.0015078522],"genre_scores_gemma":[0.22559913,0.0014063738,0.767337,0.00011401622,0.000065500986,0.00020836825,0.0003155847,0.00066859985,0.0042854836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998329,0.0007242547,0.000097839955,0.00019074045,0.0005758276,0.000082384555],"domain_scores_gemma":[0.997592,0.0017473218,0.00010618873,0.0004099123,0.000119385164,0.000025233028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658628,0.0012248817,0.0011651542,0.0014832456,0.0005300258,0.0016431106,0.0020276506,0.0013200464,0.002263144],"category_scores_gemma":[0.0035102337,0.0011089155,0.0021093113,0.0020450514,0.0017245773,0.003404788,0.0013054345,0.0026619555,0.0004581264],"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.00032667725,0.00017813,0.0010064312,0.0007334564,0.00025321348,0.00035353628,0.000467405,0.34364006,0.021708075,0.36140576,0.0037684974,0.26615873],"study_design_scores_gemma":[0.000040856354,0.000058523354,0.00022483256,0.00006983298,0.00009171672,0.00012530907,0.000044009186,0.5246041,0.010405546,0.45856115,0.0057415776,0.000032537882],"about_ca_topic_score_codex":0.0019746367,"about_ca_topic_score_gemma":0.0029354526,"teacher_disagreement_score":0.002263144,"about_ca_system_score_codex":0.0009769361,"about_ca_system_score_gemma":0.00076321844,"threshold_uncertainty_score":0.008771777},"labels":[],"label_agreement":null},{"id":"W1538369613","doi":"10.1007/978-3-540-72665-4_25","title":"Question Answering Summarization of Multiple Biomedical Documents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":47,"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":"Automatic summarization; Information retrieval; Computer science; Question answering","score_opus":0.02123581115807662,"score_gpt":0.27439893159899154,"score_spread":0.25316312044091493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538369613","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.11968552,0.021077776,0.817051,0.0051710806,0.0012889251,0.00094070233,0.0155565925,0.009855232,0.0093731955],"genre_scores_gemma":[0.29195875,0.006242176,0.6199294,0.0009764657,0.0023990422,0.00062226946,0.062957406,0.00073199807,0.014182421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980332,0.00069591554,0.0002296195,0.00044683268,0.00045338972,0.00014102092],"domain_scores_gemma":[0.9950014,0.0031508985,0.0003178676,0.00035164642,0.0010382439,0.0001399033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027227197,0.0014925351,0.0018686871,0.0047633355,0.0008393907,0.0021390691,0.001602484,0.0018711665,0.00583272],"category_scores_gemma":[0.0069822627,0.0004356337,0.0014617752,0.003202547,0.00034863633,0.0022584274,0.0012655739,0.0012708955,0.0029610954],"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.00094328204,0.00041093046,0.0019657896,0.0024867142,0.00052029773,0.0009514408,0.0011255764,0.012163469,0.072643094,0.005072319,0.0640952,0.83762187],"study_design_scores_gemma":[0.0004092861,0.0017963562,0.020410802,0.00089681253,0.0030179687,0.0041279844,0.0027744847,0.55012876,0.1577712,0.058725696,0.19967602,0.00026464034],"about_ca_topic_score_codex":0.001319465,"about_ca_topic_score_gemma":0.0019180094,"teacher_disagreement_score":0.00583272,"about_ca_system_score_codex":0.0006536028,"about_ca_system_score_gemma":0.0009745725,"threshold_uncertainty_score":0.019512415},"labels":[],"label_agreement":null},{"id":"W1538521242","doi":"10.1007/978-3-642-40450-4_37","title":"Network Bargaining with General Capacities","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Core (optical fiber); Set (abstract data type); Mathematical economics; Mathematical optimization; Computer science; Graph; Class (philosophy); Unit (ring theory); Mathematics; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.028893049063614132,"score_gpt":0.19625367510515196,"score_spread":0.16736062604153784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538521242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04535396,0.0016112609,0.58494866,0.0041381433,0.00038427243,0.00014754181,0.00040784653,0.00022089868,0.36278734],"genre_scores_gemma":[0.7970987,0.0030338932,0.05452791,0.0007833518,0.0007641736,0.00050691026,0.00039651987,0.00020654508,0.14268187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794346,0.0009557793,0.000064754546,0.00036012314,0.0003846099,0.00029135248],"domain_scores_gemma":[0.9951461,0.0034911877,0.00025773598,0.0005611098,0.00027509162,0.00026875114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002723213,0.0013548002,0.0013022808,0.0012423375,0.0014635148,0.0040400377,0.0024030898,0.0031683922,0.024090823],"category_scores_gemma":[0.010754858,0.0008171106,0.0010469885,0.0023823234,0.003449748,0.0077077644,0.0030280983,0.0036373343,0.0027532054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019545838,0.000010830565,0.000028208566,0.000035873858,0.0000088376855,0.00003104298,0.00004162917,0.018689873,0.00017231163,0.97527367,0.0020123327,0.003675736],"study_design_scores_gemma":[0.000013512814,0.000006327852,0.000028413393,0.000017096547,0.0000062437257,0.000033604458,0.000028028722,0.043827493,0.00010531988,0.95269275,0.003233747,0.000007427814],"about_ca_topic_score_codex":0.0009714923,"about_ca_topic_score_gemma":0.0008873474,"teacher_disagreement_score":0.024090823,"about_ca_system_score_codex":0.0024090619,"about_ca_system_score_gemma":0.0008912754,"threshold_uncertainty_score":0.08059186},"labels":[],"label_agreement":null},{"id":"W1538612309","doi":"10.1007/978-3-540-88808-6_5","title":"Connecting Legacy Code, Business Rules and Documentation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"National Research Council Canada","funders":"","keywords":"Computer science; USable; Documentation; Legacy system; Source code; Reverse engineering; Legacy code; Software engineering; Code (set theory); Business rule; Semantics of Business Vocabulary and Business Rules; Internal documentation; KPI-driven code analysis; Programming language; Business process; World Wide Web; Static program analysis; Software development; Software; Set (abstract data type); Engineering","score_opus":0.016064652009727676,"score_gpt":0.2751270604093387,"score_spread":0.25906240839961103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538612309","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027678736,0.009709485,0.6917524,0.010390652,0.00086408237,0.00011738498,0.0008919072,0.005515693,0.25307956],"genre_scores_gemma":[0.2936633,0.022667006,0.51213884,0.0024779881,0.0009970743,0.00018852574,0.004068693,0.0039816806,0.1598169],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999076,0.00022320123,0.00007990799,0.00014104499,0.00042001894,0.000059691574],"domain_scores_gemma":[0.9950127,0.00294241,0.00025328767,0.0009852762,0.0006702283,0.00013623094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013251366,0.0005096729,0.00038168777,0.003682233,0.00090902485,0.00638856,0.0013018642,0.0015795693,0.012328248],"category_scores_gemma":[0.013633655,0.00093699765,0.000386916,0.0050834967,0.0018114314,0.01242972,0.003463409,0.0025242823,0.004059299],"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.000030372421,0.000056527322,0.0020714495,0.00047487448,0.000028880224,0.00049082155,0.0025378973,0.00242496,0.0021277284,0.3652257,0.029806877,0.59472394],"study_design_scores_gemma":[0.000011087446,0.00002827857,0.0018660538,0.0007418945,0.000045652814,0.00092327833,0.001001156,0.014117092,0.0028342586,0.6290436,0.34934726,0.000040445415],"about_ca_topic_score_codex":0.0028305883,"about_ca_topic_score_gemma":0.003484439,"teacher_disagreement_score":0.012328248,"about_ca_system_score_codex":0.00092712167,"about_ca_system_score_gemma":0.0014109147,"threshold_uncertainty_score":0.041242063},"labels":[],"label_agreement":null},{"id":"W1538648148","doi":"10.1007/11795018_4","title":"Experiments in the Perception of Causality","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 Saskatchewan","funders":"","keywords":"Computer science; Animation; Causality (physics); Metaphor; Perception; Simple (philosophy); Artificial intelligence; Human–computer interaction; Cognitive science; Cognitive psychology; Natural language processing; Computer graphics (images); Epistemology; Linguistics; Psychology; Philosophy","score_opus":0.03359837867885808,"score_gpt":0.314826521982209,"score_spread":0.28122814330335094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538648148","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.62990594,0.0076927613,0.27484128,0.0053638867,0.0013912618,0.00041107426,0.00084452244,0.0008331954,0.07871612],"genre_scores_gemma":[0.93810374,0.0016178853,0.055292655,0.00058206223,0.0001652312,0.00022392633,0.0003199287,0.00023390261,0.0034606052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959792,0.002712271,0.00025122627,0.0005407675,0.0004075367,0.00010901479],"domain_scores_gemma":[0.91807103,0.07509446,0.002018645,0.0034625223,0.0007482657,0.0006050603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065633105,0.0007342754,0.00045577402,0.00052170665,0.00048228374,0.002727604,0.0014043407,0.0016476443,0.013988222],"category_scores_gemma":[0.07562328,0.0010287708,0.00044589117,0.00070766493,0.003862325,0.007387746,0.0016748561,0.0031675748,0.00077077374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077840798,0.0018566635,0.01331301,0.0031898946,0.00052145385,0.000708162,0.014202036,0.022090655,0.1382596,0.6138978,0.010349516,0.17382705],"study_design_scores_gemma":[0.0013118003,0.0012011615,0.015662977,0.00029869066,0.00018577138,0.0007677898,0.0019185959,0.028656302,0.026549432,0.90795255,0.01528605,0.00020890165],"about_ca_topic_score_codex":0.0008094828,"about_ca_topic_score_gemma":0.00040212914,"teacher_disagreement_score":0.013988222,"about_ca_system_score_codex":0.00051525683,"about_ca_system_score_gemma":0.00040354175,"threshold_uncertainty_score":0.04679531},"labels":[],"label_agreement":null},{"id":"W1538691881","doi":"10.1007/978-3-540-69738-1_8","title":"An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Heap (data structure); Computer science; Pointer (user interface); Separation logic; Mathematical proof; Inference; Programming language; Rule of inference; Theoretical computer science; Data structure; Artificial intelligence; Mathematics","score_opus":0.09226293328640164,"score_gpt":0.32866658023875556,"score_spread":0.2364036469523539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538691881","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.004149885,0.000044460117,0.9809163,0.00011479638,0.00007252583,0.00034672712,0.00026936107,0.01276644,0.0013194018],"genre_scores_gemma":[0.117783345,0.00008213851,0.87622654,0.00038212037,0.00007884581,0.0003539081,0.0010531597,0.0014557872,0.0025842516],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99204296,0.0019883516,0.00084931793,0.0019157765,0.0024002355,0.0008033933],"domain_scores_gemma":[0.9831759,0.011471121,0.0006611487,0.0022049746,0.002092728,0.0003941921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076672058,0.0017451105,0.002170623,0.00254588,0.0016140875,0.0038153508,0.005440408,0.0029659083,0.013226194],"category_scores_gemma":[0.022265421,0.0014803587,0.0042414623,0.0009463189,0.003282783,0.0045015817,0.0041489694,0.0033540798,0.004758464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027934157,0.0014068983,0.0052339104,0.0016359417,0.00087855064,0.0017891591,0.00094057183,0.08224816,0.079549335,0.15510036,0.02235548,0.64606816],"study_design_scores_gemma":[0.00038991703,0.00037396586,0.0010021025,0.00018510109,0.0005085169,0.00047388452,0.00014430544,0.74963284,0.09783684,0.13931301,0.009937174,0.00020233172],"about_ca_topic_score_codex":0.00415331,"about_ca_topic_score_gemma":0.005205144,"teacher_disagreement_score":0.013226194,"about_ca_system_score_codex":0.0014659069,"about_ca_system_score_gemma":0.004748365,"threshold_uncertainty_score":0.04424596},"labels":[],"label_agreement":null},{"id":"W1538703232","doi":"10.1007/978-3-642-04428-1_39","title":"Anytime Self-play Learning to Satisfy Functional Optimality Criteria","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.01797993096656769,"score_gpt":0.2577936049483812,"score_spread":0.23981367398181352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538703232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043648023,0.00025289762,0.9266351,0.00040611762,0.00012850558,0.000109623834,0.00011597339,0.00030934287,0.028394401],"genre_scores_gemma":[0.8041073,0.0003069969,0.15384167,0.00025134545,0.00009149772,0.00036877205,0.00028720024,0.0003801651,0.040365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926406,0.00019113172,0.00004822061,0.00012768853,0.00022849263,0.00014042175],"domain_scores_gemma":[0.9984419,0.0008671642,0.00009000379,0.00012506125,0.00030535768,0.00017052978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014413932,0.0011453398,0.0010107486,0.0003932073,0.00053119543,0.0011633951,0.0014831243,0.0012216519,0.007843879],"category_scores_gemma":[0.004461483,0.0003849897,0.0006230886,0.00035406672,0.0012015038,0.0020105077,0.0020898578,0.0019359741,0.00079532736],"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.00022916571,0.0001626298,0.00045670348,0.0002096423,0.000045087676,0.0001227093,0.00030121123,0.121795274,0.0068025524,0.80592257,0.0051645976,0.058787815],"study_design_scores_gemma":[0.000038526035,0.00015462308,0.00016002152,0.000026779388,0.000011147936,0.00006349423,0.000046448673,0.63019955,0.0020469788,0.36494914,0.0022915283,0.000011729726],"about_ca_topic_score_codex":0.0014476811,"about_ca_topic_score_gemma":0.0015573151,"teacher_disagreement_score":0.007843879,"about_ca_system_score_codex":0.000978022,"about_ca_system_score_gemma":0.0012332716,"threshold_uncertainty_score":0.026240408},"labels":[],"label_agreement":null},{"id":"W1538726234","doi":"10.1007/3-540-44683-4_60","title":"Alignment between Two RNA Structures","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"RNA; Base pair; Base (topology); Affine transformation; Nucleic acid secondary structure; Alphabet; Set (abstract data type); Computer science; Combinatorics; Sequence (biology); Nucleic acid structure; Algorithm; Mathematics; DNA; Genetics; Biology; Geometry; Gene","score_opus":0.01600047643876409,"score_gpt":0.25531979558728685,"score_spread":0.23931931914852275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538726234","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.2153404,0.0028873782,0.6994794,0.001341436,0.0016177334,0.0004701986,0.009830412,0.02257899,0.04645406],"genre_scores_gemma":[0.44699618,0.0012606002,0.49836174,0.00036352954,0.00030265716,0.00030360938,0.032238666,0.002542922,0.017630063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931943,0.00012210112,0.000050779414,0.00023320291,0.00020305859,0.000071373186],"domain_scores_gemma":[0.99917847,0.00025893736,0.00013249883,0.0002464089,0.00012928601,0.000054453118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038392958,0.0009542306,0.0008494241,0.0017927822,0.0008931716,0.0017726236,0.0009982117,0.0014104579,0.015662972],"category_scores_gemma":[0.0024827172,0.0007263944,0.0008214833,0.0024724607,0.00038671336,0.0017036914,0.0010489223,0.0011155455,0.007950249],"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.0024583836,0.00044439948,0.0035434384,0.00135636,0.00023672028,0.0022438779,0.00053919974,0.023959113,0.38007882,0.055729143,0.0322686,0.497142],"study_design_scores_gemma":[0.0003188742,0.0010278117,0.009553271,0.0003221564,0.00038406425,0.0025141342,0.0006237644,0.25328204,0.43029863,0.111588046,0.1899049,0.00018233815],"about_ca_topic_score_codex":0.0003708537,"about_ca_topic_score_gemma":0.0008271639,"teacher_disagreement_score":0.015662972,"about_ca_system_score_codex":0.0004350639,"about_ca_system_score_gemma":0.0004897742,"threshold_uncertainty_score":0.052397847},"labels":[],"label_agreement":null},{"id":"W1538770913","doi":"10.1007/978-3-642-22092-0_54","title":"Fast Brain Matching with Spectral Correspondence","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":28,"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":"Computer science; Matching (statistics); Curvature; Polygon mesh; Computation; Pattern recognition (psychology); Graph; Neuroimaging; Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Neuroscience; Geometry","score_opus":0.031560441049615785,"score_gpt":0.2500957535236234,"score_spread":0.21853531247400762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538770913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006747454,0.00012539639,0.99069095,0.00008719326,0.000060430364,0.00004373215,0.0000696539,0.0010372483,0.0011379728],"genre_scores_gemma":[0.16238038,0.00023303406,0.83232194,0.00012275325,0.00011346023,0.00015312711,0.00034977548,0.0005574491,0.0037681449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987729,0.0003898044,0.000062237625,0.00029822992,0.00035961455,0.00011713419],"domain_scores_gemma":[0.99804544,0.000901366,0.00014783374,0.0005005582,0.00030719978,0.00009751068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016652745,0.0010181624,0.0016286379,0.0028855926,0.00096354604,0.0022538935,0.0015224969,0.0020747315,0.010594914],"category_scores_gemma":[0.0059167845,0.0010347244,0.0015215208,0.0032314246,0.00079414144,0.003236214,0.0037028403,0.0015754176,0.0043859626],"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.00079791446,0.00017782344,0.00076188846,0.0002597425,0.00022798385,0.00018102003,0.00015271062,0.058949746,0.037098993,0.037939657,0.007270941,0.8561815],"study_design_scores_gemma":[0.000053232103,0.000080710066,0.0005708834,0.000016831778,0.00004391789,0.00031847725,0.000054834105,0.9289461,0.016629634,0.04970155,0.0035492505,0.000034531895],"about_ca_topic_score_codex":0.0016287179,"about_ca_topic_score_gemma":0.0019049864,"teacher_disagreement_score":0.010594914,"about_ca_system_score_codex":0.00045489488,"about_ca_system_score_gemma":0.0010792217,"threshold_uncertainty_score":0.035443485},"labels":[],"label_agreement":null},{"id":"W1538798823","doi":"10.1007/11901181_49","title":"Auto-completion of Underspecified SQL Queries","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Stored procedure; SQL; SQL/PSM; PL/SQL; Query by Example; Joins; SQL injection; Language Integrated Query; Programming language; Data definition language; Database; Data Transformation Services; Information retrieval; Web search query; Search engine","score_opus":0.02050467328655909,"score_gpt":0.24317446881437982,"score_spread":0.22266979552782074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538798823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07705099,0.0005479701,0.894507,0.00018950006,0.0001531653,0.000127839,0.0005648461,0.018990243,0.007868358],"genre_scores_gemma":[0.46143472,0.0005578534,0.5088756,0.00033205198,0.000299029,0.00014556694,0.004488655,0.0051974277,0.018669046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99417734,0.0010421078,0.00049368845,0.0009413403,0.0028515835,0.0004938987],"domain_scores_gemma":[0.9873438,0.004216203,0.000580578,0.0049019996,0.0026843862,0.000273065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035505279,0.0009437293,0.0014425555,0.0010739549,0.0006547771,0.001999827,0.0016764698,0.00063255633,0.0043956344],"category_scores_gemma":[0.008760332,0.0010957103,0.0016731094,0.0010984349,0.0013314913,0.00390746,0.0026602244,0.002202717,0.0022284396],"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.0014310315,0.0006141457,0.0048675933,0.0011057395,0.00019588397,0.0013213642,0.0022501268,0.06295007,0.06699618,0.2035524,0.034757104,0.61995834],"study_design_scores_gemma":[0.00012330442,0.0003506617,0.0022531687,0.00015255074,0.00018265615,0.0014394997,0.0004554904,0.48476908,0.15211059,0.29554006,0.062452856,0.0001700652],"about_ca_topic_score_codex":0.0020139108,"about_ca_topic_score_gemma":0.0023464686,"teacher_disagreement_score":0.0043956344,"about_ca_system_score_codex":0.0006244117,"about_ca_system_score_gemma":0.0012528374,"threshold_uncertainty_score":0.018777192},"labels":[],"label_agreement":null},{"id":"W153882112","doi":"10.1007/978-3-540-79549-0_81","title":"Multi-commodity Flow Problem for Multi-hop Wireless Networks with Realistic Smart Antenna Model","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless network; Smart antenna; Interference (communication); Wireless sensor network; Wireless; Distributed computing; Antenna (radio); Directional antenna; Telecommunications; Channel (broadcasting)","score_opus":0.032839794792759634,"score_gpt":0.24951143519062896,"score_spread":0.21667164039786932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153882112","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.031117832,0.0011368559,0.95681363,0.001814958,0.000255315,0.00018837603,0.0004082579,0.00017555329,0.008089232],"genre_scores_gemma":[0.7299887,0.0028286122,0.23873721,0.0004352711,0.0005396895,0.0006794547,0.00081732194,0.00022262958,0.025751144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998591,0.0007137202,0.000048275386,0.0002630838,0.00019672544,0.00018706906],"domain_scores_gemma":[0.99691343,0.0023595698,0.00020799342,0.0001361751,0.0001843697,0.0001984863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026635537,0.0015969998,0.0024822496,0.001057428,0.0012642267,0.0028158873,0.0035094284,0.0036209628,0.004966641],"category_scores_gemma":[0.0066273236,0.0017779947,0.001235984,0.0024156002,0.0017805065,0.004723747,0.0018012852,0.0026448634,0.00047385902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007062042,0.000052999956,0.000177868,0.00011665201,0.000034266366,0.00012389438,0.00003818882,0.93195957,0.0003056363,0.058004048,0.0028696926,0.006246565],"study_design_scores_gemma":[0.000016777536,0.000013127474,0.00005076374,0.000007702126,0.000007132466,0.000032441516,0.000014672826,0.9710906,0.0000672134,0.028045798,0.0006463557,0.000007355661],"about_ca_topic_score_codex":0.0032610775,"about_ca_topic_score_gemma":0.0020918606,"teacher_disagreement_score":0.004966641,"about_ca_system_score_codex":0.0026957649,"about_ca_system_score_gemma":0.0013832465,"threshold_uncertainty_score":0.019559264},"labels":[],"label_agreement":null},{"id":"W1538826635","doi":"10.1007/978-3-642-13437-1_6","title":"Persuasive Dialogues in an Intelligent Tutoring System for Medical Diagnosis","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Argumentation theory; Normative; Computer science; Intelligent tutoring system; Component (thermodynamics); Mathematics education; Artificial intelligence; Epistemology; Psychology","score_opus":0.0371048615320197,"score_gpt":0.281796908971737,"score_spread":0.2446920474397173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538826635","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.16433613,0.00097275333,0.80819374,0.0010102763,0.00035203923,0.00037168415,0.00017709463,0.0064978,0.018088501],"genre_scores_gemma":[0.677159,0.00029569017,0.30728114,0.00029291006,0.00013949643,0.0003101753,0.00021723336,0.00031921643,0.013985174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871814,0.0008473714,0.00007749074,0.00013382433,0.00016337093,0.000059801503],"domain_scores_gemma":[0.99578446,0.0036934381,0.00007251957,0.0001165694,0.00020396207,0.00012905864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014913043,0.00078439235,0.0007187688,0.00038309817,0.0007955867,0.0017067362,0.0014001909,0.002474382,0.008166416],"category_scores_gemma":[0.007393293,0.00042287554,0.00037585438,0.00024842305,0.0005279248,0.0012214059,0.001725341,0.0012458195,0.0015954671],"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.0052140155,0.0022866486,0.002880075,0.0010793769,0.00019494188,0.004562661,0.014715639,0.08407573,0.10426789,0.033866003,0.022317147,0.72453994],"study_design_scores_gemma":[0.00065850845,0.0013554047,0.0017937452,0.0001910338,0.00020654558,0.0023773997,0.0013157834,0.86865246,0.04648109,0.032853298,0.04395541,0.00015941347],"about_ca_topic_score_codex":0.000539798,"about_ca_topic_score_gemma":0.0005847106,"teacher_disagreement_score":0.008166416,"about_ca_system_score_codex":0.00029313576,"about_ca_system_score_gemma":0.00036432254,"threshold_uncertainty_score":0.027319312},"labels":[],"label_agreement":null},{"id":"W1538899008","doi":"10.1007/bfb0043597","title":"An undergraduate course in software design","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Victoria","funders":"","keywords":"Software engineering; Course (navigation); Standardization; Computer science; Context (archaeology); Software design; Social software engineering; Software; Software construction; Software peer review; Software requirements; Software development; Engineering; Programming language","score_opus":0.02000157494071319,"score_gpt":0.2663084654260925,"score_spread":0.2463068904853793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538899008","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023637058,0.009422438,0.053037144,0.016041886,0.008072381,0.0005071195,0.0012586234,0.0030084217,0.88501495],"genre_scores_gemma":[0.025873447,0.004854577,0.011359809,0.0020724796,0.0007034136,0.00016045615,0.00066147663,0.0004388889,0.9538755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992304,0.00008295831,0.00003332866,0.00010861944,0.00042713562,0.00011758133],"domain_scores_gemma":[0.99840575,0.00016416684,0.000054518732,0.00012469874,0.0004762304,0.00077474146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011262594,0.0020221532,0.0012330308,0.0012370364,0.0015633272,0.0034412341,0.00096627226,0.0012132452,0.09641625],"category_scores_gemma":[0.0018105868,0.00088743074,0.00081379147,0.0012321778,0.00072695257,0.0021979965,0.0018594372,0.0030729468,0.060475167],"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.000093919465,0.0012832268,0.0012470909,0.0003397879,0.000014820645,0.00021579125,0.0010209773,0.0010003116,0.0045625432,0.027556375,0.44015282,0.5225124],"study_design_scores_gemma":[0.000025302112,0.000509509,0.002667239,0.00038922313,0.000017969965,0.000343933,0.00035959273,0.0010886346,0.0024281493,0.019080177,0.97307193,0.000018237537],"about_ca_topic_score_codex":0.0011274135,"about_ca_topic_score_gemma":0.004228647,"teacher_disagreement_score":0.09641625,"about_ca_system_score_codex":0.001742131,"about_ca_system_score_gemma":0.0033550346,"threshold_uncertainty_score":0.32254452},"labels":[],"label_agreement":null},{"id":"W1538933717","doi":"10.1007/978-3-540-74780-2_10","title":"Private Data Management in Collaborative Environments","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"National Research Council Canada","funders":"","keywords":"Computer science; Workflow; Personally identifiable information; Personal information management; World Wide Web; Collaborative software; Personal information manager; Software; Knowledge management; Data science; Information system; Management information systems; Computer security; Database; Engineering","score_opus":0.143453871508199,"score_gpt":0.38611388243082495,"score_spread":0.24266001092262596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538933717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017269911,0.0019932683,0.94550943,0.0019193136,0.00031582688,0.00011802399,0.00015633207,0.0017083635,0.031009529],"genre_scores_gemma":[0.42765975,0.0037944023,0.4621315,0.0005548079,0.00082907133,0.0002894073,0.0010837178,0.0009096996,0.10274766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676824,0.00082505395,0.0002643366,0.00043052557,0.0013475439,0.00036428837],"domain_scores_gemma":[0.9939166,0.0020568843,0.00029744714,0.002786193,0.0005104067,0.00043251316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041330354,0.00048510957,0.00077129545,0.0009382908,0.0018457965,0.0067501767,0.0023593013,0.0018101593,0.006186812],"category_scores_gemma":[0.0068473406,0.000669598,0.0006886694,0.002621315,0.0013624291,0.012661676,0.0053974153,0.002011906,0.0019752297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001689486,0.00022049196,0.0016074417,0.00029908508,0.00006386663,0.00038733473,0.0026194535,0.014279391,0.004274856,0.50942975,0.03382933,0.43282008],"study_design_scores_gemma":[0.00004773872,0.00011185359,0.0011289037,0.00016227053,0.000076717,0.0009804574,0.001037443,0.14338861,0.011743397,0.54607695,0.2951822,0.000063486696],"about_ca_topic_score_codex":0.0011582937,"about_ca_topic_score_gemma":0.0010315862,"teacher_disagreement_score":0.0067501767,"about_ca_system_score_codex":0.0008810871,"about_ca_system_score_gemma":0.0012355602,"threshold_uncertainty_score":0.021857798},"labels":[],"label_agreement":null},{"id":"W1538979191","doi":"10.1007/3-540-44456-4_19","title":"Performance Analysis of Secure Web Server Based on SSL","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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 Waterloo","funders":"","keywords":"Computer science; Transport Layer Security; The Internet; Web server; Secure communication; Session (web analytics); Software deployment; Client; Database transaction; Computer network; Fat client; Operating system; Server; World Wide Web; Database; Encryption","score_opus":0.008198137368940863,"score_gpt":0.20662415664984862,"score_spread":0.19842601928090775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538979191","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.9421039,0.0014273856,0.049156033,0.0002968038,0.000093550705,0.00006901813,0.00014833703,0.0016043349,0.005100659],"genre_scores_gemma":[0.9976889,0.0001209552,0.0015162821,0.000014524793,0.000024293458,0.000007746579,0.00005542255,0.000025565576,0.00054639846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997532,0.0006364231,0.00011081948,0.0002432869,0.0010019634,0.0004754512],"domain_scores_gemma":[0.9959311,0.0019449133,0.0002989236,0.0004930676,0.0011481256,0.00018379428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015427853,0.00077509444,0.00095437566,0.0012088997,0.0007257527,0.001331164,0.00091765483,0.0007047307,0.0025337082],"category_scores_gemma":[0.0037309139,0.00026498133,0.0003980497,0.0009281509,0.00064096844,0.0015823359,0.00048098195,0.0004986055,0.0004851105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0107706515,0.0009383826,0.024911352,0.0006793794,0.00038898253,0.00080905476,0.00048284314,0.62703335,0.16537808,0.031290967,0.008060132,0.12925681],"study_design_scores_gemma":[0.000037365382,0.00042119122,0.0027320627,0.0000061505566,0.00006050222,0.000113945425,0.000041951695,0.9798274,0.015204211,0.0012949499,0.00024256924,0.000017682705],"about_ca_topic_score_codex":0.0030671896,"about_ca_topic_score_gemma":0.0016650368,"teacher_disagreement_score":0.0030671896,"about_ca_system_score_codex":0.0019934145,"about_ca_system_score_gemma":0.00078826887,"threshold_uncertainty_score":0.0144633055},"labels":[],"label_agreement":null},{"id":"W1539057350","doi":"10.1007/11734673_5","title":"Static Analysis of Programs Using Omega Algebra with Tests","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Omega; Computer science; Algebra over a field; Programming language; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.031593445004416645,"score_gpt":0.2886487115809467,"score_spread":0.25705526657653005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539057350","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.04263009,0.00012575793,0.94631153,0.00011600875,0.000049279224,0.00007202124,0.0001377182,0.0030486027,0.007508941],"genre_scores_gemma":[0.7355411,0.00028125828,0.2537227,0.00008557295,0.00012042083,0.00020846796,0.0006124699,0.00094718003,0.008480918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726593,0.00061344064,0.00017641614,0.00034704976,0.0011870385,0.00041007702],"domain_scores_gemma":[0.9964772,0.0019939847,0.00026038435,0.0007425311,0.0004466049,0.00007927593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022153482,0.00080750015,0.0010338613,0.0022039132,0.0010582856,0.0016280317,0.0018700154,0.00069316535,0.0054449197],"category_scores_gemma":[0.005332486,0.0007019483,0.0018890288,0.00194569,0.0026490642,0.0049931887,0.0016843965,0.0015645749,0.0008108894],"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.00067456625,0.00021044943,0.0025601732,0.00035924886,0.00009423484,0.0003245133,0.00051698106,0.070755936,0.027410807,0.7281392,0.0027059184,0.16624786],"study_design_scores_gemma":[0.000051875235,0.00017118265,0.00080851594,0.00007153834,0.000108889726,0.0001655958,0.00013334707,0.27962217,0.04376112,0.6689924,0.006058011,0.00005546807],"about_ca_topic_score_codex":0.0016073548,"about_ca_topic_score_gemma":0.0016855611,"teacher_disagreement_score":0.0054449197,"about_ca_system_score_codex":0.0011374025,"about_ca_system_score_gemma":0.0016545564,"threshold_uncertainty_score":0.01821506},"labels":[],"label_agreement":null},{"id":"W1539081329","doi":"10.1007/978-3-642-13681-8_27","title":"Human Detection with a Multi-sensors Stereovision System","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Artificial intelligence; Daylight; Computer vision; Process (computing); Cascade; Object detection; Pattern recognition (psychology); Optics; Engineering","score_opus":0.025106295036767964,"score_gpt":0.27881905786219585,"score_spread":0.2537127628254279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539081329","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.03633877,0.0005950791,0.9526807,0.00011933849,0.0001353207,0.000120830664,0.00031502638,0.0022997349,0.0073952395],"genre_scores_gemma":[0.40232396,0.0006956413,0.5856651,0.0002632424,0.00013601323,0.000122053294,0.00047399593,0.00011173333,0.010208332],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996032,0.000050252074,0.000012909038,0.00009636586,0.00019944062,0.000037846614],"domain_scores_gemma":[0.99978846,0.000047490776,0.000013900814,0.000037612106,0.00008727255,0.000025313731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003704581,0.0005073995,0.0005836202,0.0009177274,0.00029787212,0.000612404,0.0008064032,0.0009589759,0.0038722996],"category_scores_gemma":[0.0004896281,0.0005699326,0.00046971266,0.00071424514,0.00021819671,0.0006341617,0.0007063639,0.00043578507,0.0015150907],"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.000594886,0.00014420804,0.001421466,0.00018467159,0.000095550145,0.0001421807,0.00010132379,0.008992128,0.3603552,0.0018301889,0.004851468,0.62128675],"study_design_scores_gemma":[0.00020126684,0.00095913385,0.023299653,0.00008737529,0.00029212385,0.002910746,0.00012082641,0.6349672,0.30303177,0.0052507455,0.02869009,0.0001890471],"about_ca_topic_score_codex":0.0017848272,"about_ca_topic_score_gemma":0.003475911,"teacher_disagreement_score":0.0038722996,"about_ca_system_score_codex":0.00031446794,"about_ca_system_score_gemma":0.0005281513,"threshold_uncertainty_score":0.0129541755},"labels":[],"label_agreement":null},{"id":"W1539137932","doi":"10.1007/11957454_4","title":"Enhancing Consumer Privacy in the Liberty Alliance Identity Federation and Web Services Frameworks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Identity management; Internet privacy; Personally identifiable information; Identity (music); Alliance; Computer security; The Internet; Computer science; Information privacy; Identity theft; Privacy software; Digital identity; World Wide Web; Authentication (law); Political science; Access control; Law","score_opus":0.01601300631646544,"score_gpt":0.2822478074615495,"score_spread":0.266234801145084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539137932","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.078727104,0.0010028963,0.79562765,0.007978775,0.00020858894,0.0002245912,0.0000804034,0.0013749006,0.11477509],"genre_scores_gemma":[0.78228736,0.0005095766,0.1964005,0.000546941,0.00007663404,0.00018347154,0.00016002152,0.00022228234,0.019613253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99551743,0.0019937118,0.00016075607,0.00040099607,0.0013416413,0.00058542896],"domain_scores_gemma":[0.9970221,0.00104813,0.00016370902,0.0012487954,0.0002944625,0.00022279484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068621007,0.00040394298,0.0005765543,0.00093394663,0.0025368445,0.0059472425,0.0024044847,0.0024074453,0.004258754],"category_scores_gemma":[0.005848225,0.00048768296,0.0011712176,0.001338024,0.0035063813,0.0131662125,0.006896646,0.0041418886,0.0007130716],"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.0000626251,0.00011530629,0.00034459084,0.000026539701,0.000014661424,0.00010378126,0.00062018126,0.0055222097,0.00074255856,0.958033,0.002306876,0.03210763],"study_design_scores_gemma":[0.00004364379,0.000060608083,0.00031971146,0.00006796366,0.00004359978,0.00030155573,0.0007557422,0.16096437,0.0056624156,0.7789882,0.052753843,0.000038345308],"about_ca_topic_score_codex":0.0036372687,"about_ca_topic_score_gemma":0.0038663833,"teacher_disagreement_score":0.0068621007,"about_ca_system_score_codex":0.0023571274,"about_ca_system_score_gemma":0.002976528,"threshold_uncertainty_score":0.036290705},"labels":[],"label_agreement":null},{"id":"W1539236023","doi":"10.1007/3-540-45831-x_7","title":"Structured Risk Analysis","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Risk and Safety Analysis","field":"Decision Sciences","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":"Hyperion Technologies (Canada)","funders":"","keywords":"Risk analysis (engineering); Computer science; Context (archaeology); Information security; Information system; Business information; Computer security; Knowledge management; Business; Marketing; Engineering","score_opus":0.04129723590389868,"score_gpt":0.3097027969758662,"score_spread":0.26840556107196756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539236023","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.0035571952,0.0024003536,0.78455025,0.0014485603,0.00039406566,0.00010229895,0.00043979878,0.00071365567,0.2063939],"genre_scores_gemma":[0.21889906,0.006197505,0.38963863,0.0011772183,0.0010551813,0.00034461333,0.0026286386,0.00087509176,0.37918404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993482,0.00016215233,0.000029230305,0.00009814845,0.00032400002,0.00003818919],"domain_scores_gemma":[0.9992716,0.00027733645,0.000042056552,0.00019119823,0.00018162307,0.000036164714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009627619,0.0010086169,0.00065066555,0.0013042782,0.00050052785,0.0018994224,0.0008005045,0.0007503365,0.029000813],"category_scores_gemma":[0.0027294126,0.00043653784,0.0009601452,0.0008861505,0.00094257464,0.002070016,0.0012085814,0.0017041821,0.008685477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018990368,0.00004610936,0.00017778971,0.0001015141,0.000035580604,0.000053684955,0.00012178626,0.0108572375,0.0008740999,0.7845735,0.035498686,0.16764103],"study_design_scores_gemma":[0.0000044197773,0.000014804211,0.00013531558,0.000053518725,0.000012608606,0.00005806927,0.000026703468,0.013854041,0.0005358882,0.93884784,0.046448994,0.000007851381],"about_ca_topic_score_codex":0.0005142204,"about_ca_topic_score_gemma":0.0006312804,"teacher_disagreement_score":0.029000813,"about_ca_system_score_codex":0.0007817813,"about_ca_system_score_gemma":0.0008054494,"threshold_uncertainty_score":0.09701741},"labels":[],"label_agreement":null},{"id":"W1539296241","doi":"10.1007/978-3-540-44400-8_15","title":"A Note on Point Subsets with a Specified Number of Interior Points","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"","keywords":"Integer (computer science); Combinatorics; Convex hull; Plane (geometry); Point (geometry); Mathematics; Interior point method; Boundary (topology); Set (abstract data type); Regular polygon; Geometry; Discrete mathematics; Mathematical analysis; Algorithm; Computer science","score_opus":0.01586065914874254,"score_gpt":0.25547946848531383,"score_spread":0.2396188093365713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539296241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068857837,0.004372492,0.92986554,0.0019158192,0.0030047596,0.00014212001,0.00037643997,0.00068296015,0.052754115],"genre_scores_gemma":[0.09113922,0.008452839,0.8340081,0.0014061877,0.00307876,0.00059965905,0.0009845269,0.0017598666,0.0585708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986659,0.00033481958,0.00014684153,0.0002652397,0.0005094082,0.00007785661],"domain_scores_gemma":[0.99551576,0.002587082,0.00009377537,0.0011297708,0.0005287113,0.00014497587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580068,0.0014567968,0.0016848319,0.00088515313,0.0014263468,0.0016938653,0.0023563525,0.0013427498,0.010065959],"category_scores_gemma":[0.0059614247,0.001036574,0.002429113,0.0016212951,0.0021852737,0.0048147193,0.0032949804,0.006617211,0.004525561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043091577,0.00011879161,0.0006168026,0.0010144467,0.000057746747,0.0008615156,0.00054804474,0.02305496,0.022293089,0.58876723,0.07216602,0.29007038],"study_design_scores_gemma":[0.000054046373,0.0002909138,0.0007373387,0.00039299586,0.00009385517,0.0015392627,0.00021196171,0.043892298,0.014181785,0.6020576,0.33646998,0.00007793788],"about_ca_topic_score_codex":0.00079150393,"about_ca_topic_score_gemma":0.0012068615,"teacher_disagreement_score":0.010065959,"about_ca_system_score_codex":0.0007622492,"about_ca_system_score_gemma":0.000559109,"threshold_uncertainty_score":0.03367406},"labels":[],"label_agreement":null},{"id":"W1539339048","doi":"10.1007/978-3-540-72839-9_17","title":"Fusion of Dependence Networks in Multi-agent Systems - Application to Support Net-Enabled Littoral Surveillance","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Defence Research and Development Canada","funders":"","keywords":"Fuse (electrical); Computer science; Task (project management); Multi-agent system; Order (exchange); Distributed computing; Fusion; Artificial intelligence; Engineering; Systems engineering; Business","score_opus":0.03199579107167098,"score_gpt":0.2775652277867162,"score_spread":0.24556943671504525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539339048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027973581,0.00028444952,0.9685416,0.00011506903,0.00004610122,0.00005356599,0.000060336923,0.00084417325,0.0020810098],"genre_scores_gemma":[0.8007992,0.0003140851,0.1960829,0.00005258589,0.000032892316,0.00009556937,0.00015076855,0.00011715479,0.0023547781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952674,0.00016253852,0.00003590264,0.00009441611,0.00013937132,0.000041083833],"domain_scores_gemma":[0.9986039,0.0007788734,0.00010694772,0.00013680832,0.00028059064,0.000093019305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015863843,0.0006349198,0.00094450254,0.0006793979,0.00079186354,0.0010591848,0.0008636605,0.0008587652,0.0016195847],"category_scores_gemma":[0.0030532468,0.00047261378,0.0005931497,0.00089958485,0.0004647255,0.001955799,0.0020774305,0.0010726163,0.0002814383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034321536,0.00013616862,0.001825691,0.000117450414,0.00007659886,0.0001840884,0.00026266245,0.811211,0.011386107,0.018606337,0.0015352995,0.15431535],"study_design_scores_gemma":[0.0000072252274,0.000026704103,0.00015465861,0.0000050507942,0.000010842224,0.00002175117,0.000014396183,0.9925055,0.0017202492,0.004949583,0.00057764124,0.0000064728542],"about_ca_topic_score_codex":0.003270067,"about_ca_topic_score_gemma":0.003202818,"teacher_disagreement_score":0.003270067,"about_ca_system_score_codex":0.0007101277,"about_ca_system_score_gemma":0.00052696484,"threshold_uncertainty_score":0.008389652},"labels":[],"label_agreement":null},{"id":"W1539366558","doi":"10.1007/978-3-540-85194-3_2","title":"Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Nucleic Acid Chemistry","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 British Columbia","funders":"","keywords":"Computer science; Folding (DSP implementation); Nucleic acid; Function (biology); Nucleic acid structure; Energy (signal processing); RNA; Molecular machine; Inference; Biological system; Theoretical computer science; Algorithm; Artificial intelligence; Chemistry; Nanotechnology; Physics; Biology; Materials science","score_opus":0.03717423947089902,"score_gpt":0.2410589872127737,"score_spread":0.20388474774187468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539366558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097504,0.027524605,0.8084307,0.010496557,0.0010936671,0.00009051402,0.0001949032,0.0010438274,0.053621214],"genre_scores_gemma":[0.41499114,0.014563499,0.5590247,0.00079640525,0.0004091085,0.00031978817,0.0003598662,0.0004600354,0.009075449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996482,0.00014022022,0.000017830705,0.00005204244,0.00010831329,0.000033331373],"domain_scores_gemma":[0.9987017,0.000977124,0.00004441002,0.00016265159,0.000058935246,0.000055133867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013366753,0.0006046152,0.0012337855,0.00026505484,0.0008706876,0.0021195859,0.0022285422,0.0017691035,0.0041886973],"category_scores_gemma":[0.0029411316,0.00073757616,0.0007278239,0.00057117495,0.0024480412,0.0050276197,0.0020486396,0.0037698704,0.0010267156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010033561,0.000050595252,0.0002031553,0.00045423658,0.000039148694,0.00011119197,0.0002409356,0.12064913,0.003319696,0.81882185,0.0036802008,0.05232955],"study_design_scores_gemma":[0.000025306834,0.00003094773,0.00003893605,0.000043294,0.000008644764,0.00004924946,0.00005202876,0.17691492,0.001300084,0.8053902,0.016129846,0.000016626662],"about_ca_topic_score_codex":0.0002957174,"about_ca_topic_score_gemma":0.0006473853,"teacher_disagreement_score":0.0041886973,"about_ca_system_score_codex":0.00064818695,"about_ca_system_score_gemma":0.0007832992,"threshold_uncertainty_score":0.014012575},"labels":[],"label_agreement":null},{"id":"W1539417924","doi":"10.1007/11766247_6","title":"Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Observability; Nash equilibrium; Equilibrium selection; Solution concept; Context (archaeology); Mathematical economics; Complete information; Rational agent; Correlated equilibrium; Deliberation; Pareto principle; Game theory; Epsilon-equilibrium; Mathematical optimization; Best response; Repeated game; Artificial intelligence; Mathematics","score_opus":0.03915314013422875,"score_gpt":0.30918814919938353,"score_spread":0.27003500906515476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539417924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06267292,0.0002893426,0.8971191,0.0014309667,0.000084940424,0.00025496265,0.00012000245,0.0002296933,0.037798043],"genre_scores_gemma":[0.81593925,0.0005473546,0.16780543,0.00040857695,0.0001812406,0.00094603887,0.00031642098,0.00011998137,0.013735616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960311,0.0023041337,0.00016512118,0.00031047923,0.00074678595,0.0004423681],"domain_scores_gemma":[0.99635136,0.002552406,0.00024839144,0.00026665215,0.00034779654,0.00023348062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037769815,0.0013235947,0.0016318153,0.0007284446,0.0010676852,0.002710727,0.0024199502,0.0025854893,0.004214859],"category_scores_gemma":[0.0072206566,0.0005466627,0.0011622068,0.0016558676,0.002553028,0.0038663412,0.0030187904,0.0026029376,0.00082521664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024601948,0.0001487326,0.00031784162,0.00026989277,0.000083461186,0.00017504572,0.00071173155,0.05994521,0.0032826818,0.90243596,0.003972246,0.028411161],"study_design_scores_gemma":[0.000096300515,0.0001238826,0.00011152927,0.00002832618,0.000021226277,0.00007034278,0.00013901264,0.19510706,0.0010180891,0.8017112,0.0015564839,0.00001661473],"about_ca_topic_score_codex":0.00070781773,"about_ca_topic_score_gemma":0.00057554076,"teacher_disagreement_score":0.004214859,"about_ca_system_score_codex":0.0008886563,"about_ca_system_score_gemma":0.0016223945,"threshold_uncertainty_score":0.019974828},"labels":[],"label_agreement":null},{"id":"W1539524058","doi":"10.1007/11551188_36","title":"Empirical Study on Weighted Voting Multiple Classifiers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Voting; Computer science; Classifier (UML); Weighted voting; Artificial intelligence; Random subspace method; Machine learning; AdaBoost; Majority rule; Pattern recognition (psychology)","score_opus":0.043365052029538886,"score_gpt":0.3060205666199402,"score_spread":0.2626555145904013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539524058","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.9001422,0.007164208,0.08297992,0.00088229694,0.00024434444,0.00016662874,0.00057451596,0.00022101538,0.0076247617],"genre_scores_gemma":[0.9766916,0.00046563888,0.019002113,0.00007736247,0.00012465095,0.000055374065,0.0013815628,0.000082295555,0.0021194296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9825936,0.011949401,0.0008324117,0.0016032291,0.0025285482,0.0004927978],"domain_scores_gemma":[0.752229,0.22465447,0.0036707413,0.010853903,0.007733166,0.00085876754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024225222,0.0009814019,0.0013930857,0.0018638347,0.001342996,0.00164766,0.002882528,0.001391983,0.0046145017],"category_scores_gemma":[0.13707882,0.00046924595,0.00088732835,0.0028531447,0.0012263067,0.005960933,0.0013152362,0.0017811888,0.00075850013],"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.008682492,0.0027874021,0.20367853,0.0011773206,0.0014346859,0.00045656817,0.0010683625,0.08638134,0.0029484187,0.032616794,0.022048011,0.6367201],"study_design_scores_gemma":[0.0003305345,0.0017280955,0.0448989,0.00028409198,0.00086879765,0.0013544342,0.0013878117,0.8989716,0.0041394965,0.038701523,0.007255968,0.000078781304],"about_ca_topic_score_codex":0.0019450578,"about_ca_topic_score_gemma":0.0017289846,"teacher_disagreement_score":0.024225222,"about_ca_system_score_codex":0.0010867205,"about_ca_system_score_gemma":0.0007155989,"threshold_uncertainty_score":0.12811673},"labels":[],"label_agreement":null},{"id":"W1539533914","doi":"10.1007/978-3-540-30219-3_27","title":"New Algorithms for Multiple DNA Sequence Alignment","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Waterloo","funders":"","keywords":"Computer science; Algorithm; Sequence (biology); Computational biology; Multiple sequence alignment; DNA sequencing; DNA; Sequence alignment; Biology; Genetics; Gene; Peptide sequence","score_opus":0.033965492137359596,"score_gpt":0.2731560222180068,"score_spread":0.23919053008064717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539533914","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.00051343744,0.0010399702,0.99512863,0.00008884209,0.0003501499,0.000032709468,0.00008310202,0.0019227088,0.00084040035],"genre_scores_gemma":[0.0032863477,0.0008518322,0.99166745,0.00009744074,0.00019250774,0.00012631674,0.0005521755,0.00040225446,0.0028236746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705493,0.00057980674,0.00029424028,0.0006372131,0.0013199983,0.000113733615],"domain_scores_gemma":[0.99635124,0.0016397103,0.00023448878,0.00087006355,0.000800312,0.00010422687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550392,0.002682558,0.002512815,0.003662344,0.0013168425,0.0030261816,0.0044758017,0.0023743787,0.011181605],"category_scores_gemma":[0.008208598,0.0018718346,0.0016436591,0.005325611,0.0011829489,0.0069741243,0.0028818783,0.0049352753,0.011663401],"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.00019423949,0.000102005426,0.00020647542,0.00047059002,0.0001271773,0.00012617595,0.00013844375,0.017225053,0.017581701,0.04120382,0.021607462,0.9010169],"study_design_scores_gemma":[0.00017596278,0.00018014299,0.00051408436,0.0002466805,0.00018745256,0.0015439381,0.00012021427,0.57614356,0.04591749,0.20827003,0.16654366,0.00015683532],"about_ca_topic_score_codex":0.00069377536,"about_ca_topic_score_gemma":0.0012408822,"teacher_disagreement_score":0.011181605,"about_ca_system_score_codex":0.000845214,"about_ca_system_score_gemma":0.0007423649,"threshold_uncertainty_score":0.037406147},"labels":[],"label_agreement":null},{"id":"W1539553127","doi":"10.1007/978-3-540-45193-8_125","title":"Restart Strategies: Analysis and Simulation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Cutoff; Mathematical optimization; Algorithm; Mathematics","score_opus":0.02271104224915202,"score_gpt":0.2800543574949932,"score_spread":0.2573433152458412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539553127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0857584,0.009323515,0.83970207,0.0011199496,0.00023147177,0.00017317846,0.00041407565,0.00079680857,0.0624805],"genre_scores_gemma":[0.84971774,0.006755923,0.10622326,0.00031474247,0.00020746147,0.00053988036,0.0004140081,0.0006260673,0.035200853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993926,0.00024073772,0.000021428865,0.00005996729,0.0001680859,0.000117077056],"domain_scores_gemma":[0.9948414,0.0040871543,0.0002914346,0.0002735974,0.00037188755,0.000134611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013575662,0.0013516581,0.0020005829,0.0012377464,0.0008104823,0.0023414376,0.0026742446,0.0018779929,0.009944246],"category_scores_gemma":[0.010721337,0.00071187626,0.0012520379,0.0018668275,0.0014665778,0.0032078521,0.0012257928,0.00189775,0.001302743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017022586,0.00010631402,0.00060778647,0.0001935132,0.000052096286,0.0000960885,0.00013424839,0.6845357,0.0007548546,0.2709514,0.008093057,0.03430476],"study_design_scores_gemma":[0.000010797484,0.000014770366,0.00009477193,0.000013507879,0.000013237457,0.000024790214,0.000018916917,0.9668422,0.00016377466,0.032112062,0.00068486173,0.000006283772],"about_ca_topic_score_codex":0.0076014474,"about_ca_topic_score_gemma":0.0043095755,"teacher_disagreement_score":0.009944246,"about_ca_system_score_codex":0.0016364214,"about_ca_system_score_gemma":0.0012275793,"threshold_uncertainty_score":0.033266842},"labels":[],"label_agreement":null},{"id":"W1539591738","doi":"10.1007/3-540-45108-0_9","title":"Active Learner Modelling","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Argument (complex analysis); Process (computing); Domain (mathematical analysis); Action (physics); Verb; Artificial intelligence; Programming language","score_opus":0.02718184775081257,"score_gpt":0.24029552475830973,"score_spread":0.21311367700749717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539591738","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.008058327,0.0007305903,0.87751734,0.0009400017,0.000250977,0.00013990012,0.00062673294,0.0014367775,0.110299334],"genre_scores_gemma":[0.43910176,0.0019023814,0.22026813,0.0003708956,0.00023190561,0.0004475054,0.0023283083,0.00088977895,0.33445933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998978,0.00034621393,0.000039921688,0.00021939493,0.00032476644,0.000091771864],"domain_scores_gemma":[0.998278,0.00082018453,0.0000536804,0.00040335857,0.00035216607,0.000092582624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299089,0.000705486,0.0006044821,0.0007572388,0.00067051663,0.0037457906,0.002249392,0.0018705808,0.03524235],"category_scores_gemma":[0.0062806164,0.00042709612,0.0010506485,0.0007299723,0.0006064721,0.004648423,0.0023029079,0.002199239,0.012357528],"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.00015436966,0.00026230316,0.0010472473,0.00019469744,0.00004887428,0.00017664017,0.00075190904,0.09080396,0.0019409104,0.63867617,0.021063618,0.2448793],"study_design_scores_gemma":[0.000030063244,0.000071099224,0.00032786088,0.00008650938,0.00004039815,0.00019876628,0.00015364404,0.6021789,0.0044992203,0.28758258,0.104801916,0.000029143353],"about_ca_topic_score_codex":0.0021132042,"about_ca_topic_score_gemma":0.0020863554,"teacher_disagreement_score":0.03524235,"about_ca_system_score_codex":0.00073448714,"about_ca_system_score_gemma":0.00093601923,"threshold_uncertainty_score":0.11789739},"labels":[],"label_agreement":null},{"id":"W153960976","doi":"10.1007/978-3-540-39404-4_27","title":"Predicting Violations of QoS Requirements in Distributed Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Western University","funders":"","keywords":"Quality of service; Computer science; Mobile QoS; Distributed computing; Computer network; Service (business); Service provider","score_opus":0.019800063890656448,"score_gpt":0.25390033576544424,"score_spread":0.2341002718747878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153960976","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.922881,0.00031683288,0.07477894,0.00021184892,0.000037773516,0.000024438054,0.0001671491,0.00068324717,0.0008988724],"genre_scores_gemma":[0.9887593,0.00007320213,0.010367518,0.000016756221,0.000028348744,0.00001235643,0.00021975505,0.00002552761,0.0004971793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993586,0.00016388998,0.00005032984,0.000112086906,0.0002454061,0.00006974497],"domain_scores_gemma":[0.9861346,0.011922502,0.00069260254,0.00035114505,0.0006240406,0.0002751135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536975,0.0005984745,0.00062559615,0.001002832,0.00027431446,0.00066044874,0.00075190584,0.0010893792,0.0006038751],"category_scores_gemma":[0.011665819,0.00036768417,0.00025653347,0.0006832383,0.00033951164,0.0008680021,0.00051066594,0.00096000254,0.00017494289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006762521,0.00027677842,0.07111303,0.0000719342,0.000055305343,0.00019171753,0.0001327187,0.81063443,0.005611494,0.0012062719,0.0014046923,0.10862535],"study_design_scores_gemma":[0.000007011106,0.00005261395,0.004022333,0.000001776261,0.000004413015,0.000029152885,0.000018944724,0.99375993,0.00086898747,0.0011691687,0.00006194326,0.000003716163],"about_ca_topic_score_codex":0.0041834954,"about_ca_topic_score_gemma":0.0033946019,"teacher_disagreement_score":0.0041834954,"about_ca_system_score_codex":0.00044480103,"about_ca_system_score_gemma":0.0003013395,"threshold_uncertainty_score":0.008318305},"labels":[],"label_agreement":null},{"id":"W1539623450","doi":"10.1007/978-3-642-04268-3_99","title":"Biomechanically Constrained Groupwise US to CT Registration of the Lumbar Spine","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Imaging phantom; Metric (unit); Artificial intelligence; Displacement (psychology); Image registration; Volume (thermodynamics); Computer vision; Vertebra; Similarity (geometry); Image (mathematics); Medicine; Nuclear medicine; Anatomy","score_opus":0.0068458341214057165,"score_gpt":0.22953233251822536,"score_spread":0.22268649839681964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539623450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25129482,0.00085829414,0.7413951,0.0005286128,0.00013345364,0.00013746791,0.0003681247,0.0009546283,0.004329423],"genre_scores_gemma":[0.79466504,0.00096838584,0.19761212,0.00018935768,0.000107791966,0.00014037247,0.0003937876,0.00047731027,0.0054458617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998349,0.000056765704,0.000013599805,0.000027558326,0.00005086863,0.000016261243],"domain_scores_gemma":[0.99967253,0.00012501722,0.000061586674,0.0000663886,0.000054081185,0.000020419013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035246345,0.00041180587,0.00042842832,0.00091800856,0.00029351437,0.0010109893,0.00044060312,0.00066953484,0.0034452116],"category_scores_gemma":[0.0029230898,0.00041653917,0.00052393874,0.0010230171,0.0004540079,0.00053568836,0.0010874833,0.0006105868,0.0008205116],"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.0011013732,0.00025787388,0.0056485757,0.00065701833,0.0001364605,0.0006143596,0.00067000085,0.15154162,0.35582596,0.009882472,0.004666114,0.4689981],"study_design_scores_gemma":[0.00009580909,0.00052287587,0.019035634,0.00017371119,0.00023396336,0.0028123558,0.00045292394,0.78299946,0.16254602,0.017413741,0.013610102,0.000103447324],"about_ca_topic_score_codex":0.003001254,"about_ca_topic_score_gemma":0.00463435,"teacher_disagreement_score":0.0034452116,"about_ca_system_score_codex":0.00022034885,"about_ca_system_score_gemma":0.0011821188,"threshold_uncertainty_score":0.0115253925},"labels":[],"label_agreement":null},{"id":"W1539639468","doi":"10.1007/11681878_6","title":"Key Exchange Using Passwords and Long Keys","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Password; Computer science; Key exchange; Computer security; Server; Cryptography; Key (lock); Public-key cryptography; S/KEY; Protocol (science); Denial-of-service attack; Computer network; Encryption; World Wide Web; The Internet","score_opus":0.022831650658605717,"score_gpt":0.276431309008438,"score_spread":0.2535996583498323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539639468","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.020417769,0.0017054254,0.91455173,0.00068738346,0.0007648958,0.00036691912,0.00031479623,0.0031366139,0.058054503],"genre_scores_gemma":[0.550766,0.002561094,0.29335704,0.00047067247,0.0003672627,0.0006936946,0.0008836643,0.0010610556,0.1498396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981786,0.00054803304,0.00021026762,0.00030854743,0.00047790512,0.0002767553],"domain_scores_gemma":[0.9957283,0.0010805682,0.0002442382,0.0024103841,0.00038126684,0.00015510726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018581544,0.001096882,0.0009451723,0.0008211331,0.0012594069,0.0027075885,0.0012009632,0.0017421668,0.023840537],"category_scores_gemma":[0.0056809676,0.0006792027,0.0004690791,0.0013596307,0.0013044899,0.011818042,0.005346346,0.001792579,0.015332862],"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.0013764636,0.00016767526,0.0005747933,0.0008310718,0.000073956784,0.00076188816,0.0012509063,0.002374129,0.055448953,0.5333293,0.031973183,0.3718377],"study_design_scores_gemma":[0.0003127705,0.0007622172,0.0006966662,0.00042952152,0.00012738067,0.004453644,0.0005633221,0.033922244,0.15189585,0.50855553,0.29804873,0.00023205302],"about_ca_topic_score_codex":0.0000881672,"about_ca_topic_score_gemma":0.00011424335,"teacher_disagreement_score":0.023840537,"about_ca_system_score_codex":0.00039313274,"about_ca_system_score_gemma":0.0005056431,"threshold_uncertainty_score":0.07975459},"labels":[],"label_agreement":null},{"id":"W1539681359","doi":"10.1007/3-540-44596-x_19","title":"Local Learning Framework for Recognition of Lowercase Handwritten Characters","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Artificial neural network; Learning vector quantization; Machine learning; Pattern recognition (psychology)","score_opus":0.023460606819466056,"score_gpt":0.26572467373689024,"score_spread":0.2422640669174242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539681359","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.009926123,0.000586115,0.9853167,0.00004408945,0.000028765826,0.00003255103,0.00012351097,0.0031288143,0.0008133266],"genre_scores_gemma":[0.25740883,0.0010647142,0.71543324,0.00023961139,0.000118827964,0.00025140593,0.0017008252,0.0006962265,0.023086218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996836,0.000054449898,0.000016653954,0.00009668163,0.00010072483,0.000047881334],"domain_scores_gemma":[0.9996995,0.00007969157,0.000026244477,0.00006321775,0.00010756583,0.000023818377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137094,0.0006165983,0.0011160583,0.00063076,0.0003561528,0.00081738154,0.0016643411,0.00076425046,0.0052093705],"category_scores_gemma":[0.0006337312,0.00034268232,0.00073220115,0.0008018196,0.00038307518,0.0009384825,0.0007967026,0.0009150853,0.0029049474],"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.00029500565,0.0001757537,0.0003511082,0.00014418909,0.00007364935,0.000079558566,0.000049390743,0.08261851,0.057582058,0.0041503613,0.0064321295,0.8480484],"study_design_scores_gemma":[0.000015780251,0.0000888562,0.0005450902,0.000012654649,0.000042676587,0.000083895575,0.000019789719,0.9662053,0.026633263,0.002841001,0.003492955,0.00001877359],"about_ca_topic_score_codex":0.008903604,"about_ca_topic_score_gemma":0.011249295,"teacher_disagreement_score":0.008903604,"about_ca_system_score_codex":0.0006049904,"about_ca_system_score_gemma":0.0008063187,"threshold_uncertainty_score":0.017703533},"labels":[],"label_agreement":null},{"id":"W1539705164","doi":"10.1007/978-3-642-02161-9_3","title":"Engineering Self-Adaptive Systems through Feedback Loops","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":560,"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); York University; University of Victoria","funders":"","keywords":"Computer science; Adaptation (eye); Adaptive system; Process (computing); Perspective (graphical); Software; Class (philosophy); Software engineering; Artificial intelligence","score_opus":0.02784657795735096,"score_gpt":0.25255728229810154,"score_spread":0.22471070434075058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539705164","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.01595957,0.00056815875,0.97136396,0.00012361295,0.000112884525,0.000027691021,0.000008907764,0.0005886282,0.011246465],"genre_scores_gemma":[0.8424717,0.001637418,0.13361834,0.00018866338,0.00014287938,0.00013009142,0.00004271572,0.00017212598,0.021595921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998216,0.000033767843,0.000009503362,0.000027592121,0.00009222098,0.000015229391],"domain_scores_gemma":[0.9996928,0.00018386844,0.000027190441,0.000039254548,0.000046157365,0.000010772386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000270716,0.0004927891,0.00030645425,0.00025205524,0.00020643862,0.00072823116,0.00041057137,0.0005815183,0.0025612898],"category_scores_gemma":[0.0011074523,0.00025480034,0.00029338765,0.00019427095,0.00057383534,0.00083624886,0.00084168615,0.00070057425,0.00056976505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014940163,0.00011753225,0.0005932973,0.000592005,0.00009649701,0.00030820526,0.00059500284,0.30093992,0.11912624,0.20144136,0.002706975,0.37333357],"study_design_scores_gemma":[0.00004639872,0.0002960059,0.0003281831,0.00007490663,0.00004941064,0.00024720098,0.00006630445,0.8073821,0.03328882,0.14013758,0.018056521,0.000026663633],"about_ca_topic_score_codex":0.00022511199,"about_ca_topic_score_gemma":0.00021893253,"teacher_disagreement_score":0.0025612898,"about_ca_system_score_codex":0.00018816719,"about_ca_system_score_gemma":0.00016291185,"threshold_uncertainty_score":0.008568406},"labels":[],"label_agreement":null},{"id":"W1539735287","doi":"10.1007/978-3-540-73545-8_47","title":"An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Linearity; Algorithm; Computer science; Tree (set theory); Edit distance; Mathematics; Engineering; Combinatorics; Electronic engineering","score_opus":0.019891060574186565,"score_gpt":0.2802475830311097,"score_spread":0.26035652245692315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539735287","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.0038021454,0.00013941305,0.9921456,0.000047303973,0.00011359566,0.00007213077,0.0001208038,0.0026077563,0.00095128175],"genre_scores_gemma":[0.022107577,0.00007803165,0.97355765,0.00005250436,0.00006734535,0.000101129845,0.0004326173,0.00041788252,0.0031851581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668604,0.00044801852,0.00028443616,0.0008480062,0.00153827,0.00019517214],"domain_scores_gemma":[0.99507326,0.0014596417,0.00014255258,0.0018056531,0.0013778807,0.00014093347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016193212,0.0012166005,0.002099438,0.0027292103,0.0012599918,0.0021293792,0.0038459583,0.0015934578,0.008265674],"category_scores_gemma":[0.007441988,0.00081210036,0.0013360961,0.0038562152,0.0008995141,0.0045687957,0.0036047553,0.0024990898,0.005446306],"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.00023829806,0.00022139832,0.0005768604,0.0002280097,0.00009143313,0.00013074704,0.00020012051,0.021603124,0.028090823,0.0328354,0.010289555,0.90549433],"study_design_scores_gemma":[0.00019686493,0.0004900746,0.00092351175,0.00005072131,0.00016295588,0.0009894276,0.00015590727,0.80563855,0.064544275,0.07821751,0.048481353,0.00014882836],"about_ca_topic_score_codex":0.0033418126,"about_ca_topic_score_gemma":0.006716433,"teacher_disagreement_score":0.008265674,"about_ca_system_score_codex":0.0010284215,"about_ca_system_score_gemma":0.0020567628,"threshold_uncertainty_score":0.02765143},"labels":[],"label_agreement":null},{"id":"W1539803318","doi":"10.1007/978-3-642-13033-5_11","title":"Data Integration and Knowledge Discovery in Life Sciences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"National Research Council Canada","funders":"","keywords":"Exploit; Data integration; Data science; Computer science; Knowledge extraction; Data management; Complement (music); Visualization; Data mining; Biology","score_opus":0.020505806714702066,"score_gpt":0.2644848771202468,"score_spread":0.24397907040554476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539803318","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035991834,0.035509326,0.94311035,0.0044300677,0.00065105135,0.00017065892,0.0008972376,0.0022606815,0.009371337],"genre_scores_gemma":[0.036720514,0.022978004,0.92577446,0.001468565,0.00067984156,0.00031763958,0.0032271524,0.0003974143,0.008436368],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972037,0.0008373285,0.00038657922,0.00045771728,0.0010334402,0.00008127536],"domain_scores_gemma":[0.99293995,0.005348828,0.00015297797,0.0009958383,0.0004346709,0.00012774927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005483478,0.0008421034,0.0018264854,0.0031619696,0.0006637233,0.0053218463,0.0023966315,0.0014387264,0.005236372],"category_scores_gemma":[0.010019533,0.0009338947,0.001251051,0.006570789,0.001841317,0.008330719,0.0035088249,0.0022274961,0.002831171],"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.00009113911,0.00010254056,0.0007708745,0.0020802508,0.00019523036,0.00023702894,0.0004116313,0.0043324986,0.0028851347,0.18249506,0.032961003,0.7734376],"study_design_scores_gemma":[0.000024531682,0.00003359254,0.0005761461,0.00043783992,0.000112719135,0.00041658603,0.0001800369,0.05071236,0.0049142507,0.7764871,0.16607033,0.000034529887],"about_ca_topic_score_codex":0.0009954964,"about_ca_topic_score_gemma":0.0007680228,"teacher_disagreement_score":0.005483478,"about_ca_system_score_codex":0.00087865884,"about_ca_system_score_gemma":0.0013316282,"threshold_uncertainty_score":0.028999746},"labels":[],"label_agreement":null},{"id":"W1539879039","doi":"10.1007/978-3-540-85836-2_12","title":"Processing Aggregate Queries on Spatial OLAP Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Online analytical processing; Computer science; Spatial query; Query optimization; Spatial database; Set (abstract data type); Database; Aggregate (composite); Spatial analysis; Data mining; Query language; Information retrieval; Sargable; Web search query; Data warehouse; Search engine; Geography","score_opus":0.03638146454789528,"score_gpt":0.26065759763387575,"score_spread":0.22427613308598046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539879039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28138626,0.0013449236,0.6634459,0.0010032762,0.00031086744,0.00033653135,0.0044920407,0.028176656,0.019503558],"genre_scores_gemma":[0.58206,0.001134115,0.38380218,0.00034081386,0.00034576285,0.00030455872,0.010959426,0.0023003237,0.018752865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986046,0.00012686323,0.00012364313,0.00015588915,0.00079912465,0.00018986994],"domain_scores_gemma":[0.9973354,0.0012218261,0.00014330486,0.00077728234,0.00040124054,0.00012092664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011451031,0.0012008031,0.001522518,0.0014553609,0.0012647532,0.0037559757,0.0014768456,0.00092799927,0.005318579],"category_scores_gemma":[0.00390071,0.0007156265,0.0009669026,0.0042437506,0.0006288724,0.004682936,0.0027505986,0.0012140219,0.0022788274],"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.002016433,0.0004598999,0.011285795,0.0011003944,0.00037573458,0.0012936248,0.0022144886,0.07952418,0.123896874,0.04109807,0.07007899,0.6666556],"study_design_scores_gemma":[0.00009922624,0.0003002681,0.0039124074,0.00007477671,0.0001761655,0.00070535793,0.0018850036,0.73707414,0.108558275,0.10935084,0.037777025,0.0000865863],"about_ca_topic_score_codex":0.003997287,"about_ca_topic_score_gemma":0.0051573697,"teacher_disagreement_score":0.005318579,"about_ca_system_score_codex":0.00070072414,"about_ca_system_score_gemma":0.0008094153,"threshold_uncertainty_score":0.017792404},"labels":[],"label_agreement":null},{"id":"W1539956586","doi":"10.1007/11944874_12","title":"Mechanisms to Induce Random Choice","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Nash equilibrium; Impossibility; Protocol (science); Node (physics); Strategy; Game theory; Range (aeronautics); Channel (broadcasting); Computer network; Strategic dominance; Repeated game; Mathematical economics; Mathematics","score_opus":0.016807550099058113,"score_gpt":0.2536614815053744,"score_spread":0.23685393140631628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539956586","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.02939232,0.0007257174,0.7744679,0.007422337,0.00071367144,0.0002926325,0.00042600156,0.0012411814,0.18531819],"genre_scores_gemma":[0.7797768,0.0008632485,0.10964404,0.0024862576,0.0006508909,0.0014399005,0.00040485486,0.00056016044,0.104173936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962049,0.0020565477,0.00017725394,0.00048006856,0.0007397487,0.0003414037],"domain_scores_gemma":[0.98398006,0.009892688,0.0009220106,0.0038970993,0.00062247826,0.0006856318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004663261,0.0007456597,0.00082993513,0.0010983627,0.0011193249,0.0027764484,0.001899201,0.0019848968,0.019063601],"category_scores_gemma":[0.021530742,0.00067557686,0.001249544,0.0010316957,0.0029386757,0.0057762773,0.0036234704,0.004232369,0.0028215244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015621981,0.000011978509,0.000032744785,0.0000147979745,0.0000060333714,0.0000062829226,0.000031724656,0.0004463344,0.00009960899,0.99474686,0.0013522936,0.0032356973],"study_design_scores_gemma":[0.00002297896,0.000008049052,0.00002586446,0.000007594136,0.000005239007,0.000016663826,0.000007397123,0.003398294,0.00015770878,0.9935602,0.002785242,0.0000047990584],"about_ca_topic_score_codex":0.00019317154,"about_ca_topic_score_gemma":0.00025721823,"teacher_disagreement_score":0.019063601,"about_ca_system_score_codex":0.00116239,"about_ca_system_score_gemma":0.00082692277,"threshold_uncertainty_score":0.06377405},"labels":[],"label_agreement":null},{"id":"W1540001519","doi":"10.1007/978-3-642-10677-4_11","title":"Finding MAPs Using High Order Recurrent Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bayesian network; Maximum a posteriori estimation; Probabilistic logic; A priori and a posteriori; Formalism (music); Set (abstract data type); Artificial intelligence; Belief propagation; Theoretical computer science; Representation (politics); Graphical model; Algorithm; Mathematics","score_opus":0.03538047836097289,"score_gpt":0.26969045339561526,"score_spread":0.23430997503464238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540001519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026949037,0.00035940437,0.9702194,0.00013773218,0.000029909817,0.00003338766,0.00017001475,0.0009839053,0.0011171767],"genre_scores_gemma":[0.48110926,0.0005310164,0.50910705,0.000116002826,0.00014885516,0.00016373818,0.0013344754,0.00047227752,0.0070173494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951327,0.00012475043,0.000031420317,0.00015230756,0.00012229018,0.000055986384],"domain_scores_gemma":[0.99411076,0.0048375833,0.00029408603,0.00036129108,0.00028796642,0.0001082874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008928521,0.0011834562,0.0015796894,0.0017327375,0.00055691844,0.0014582778,0.0020001193,0.0017686556,0.0039480818],"category_scores_gemma":[0.008926616,0.0013838059,0.0011108007,0.0012383761,0.0007848069,0.0034626566,0.0017036144,0.0016054123,0.00085636525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031772262,0.00014803035,0.0028782124,0.00036203975,0.00025818034,0.00036055467,0.00021684288,0.65732384,0.0077507193,0.04073402,0.004644856,0.285005],"study_design_scores_gemma":[0.000007748431,0.000016800897,0.00014189899,0.000006964685,0.000013504022,0.000030839048,0.000011667768,0.9735247,0.0006416319,0.025326347,0.0002720451,0.0000059077515],"about_ca_topic_score_codex":0.003342918,"about_ca_topic_score_gemma":0.0041413656,"teacher_disagreement_score":0.0039480818,"about_ca_system_score_codex":0.00059048214,"about_ca_system_score_gemma":0.00047578858,"threshold_uncertainty_score":0.013207674},"labels":[],"label_agreement":null},{"id":"W1540085086","doi":"10.1007/978-3-540-77090-9_56","title":"Energy-Efficiency on a Variable-Bitrate Device","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Conventional PCI; Energy consumption; Network packet; Efficient energy use; Dynamic demand; Power management; Variable (mathematics); Power consumption; Power (physics); Embedded system; Real-time computing; Computer network; Engineering; Electrical engineering","score_opus":0.023437669300936256,"score_gpt":0.26270223703147183,"score_spread":0.23926456773053556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540085086","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.59060067,0.0056377435,0.30954114,0.0017902773,0.0007219928,0.00012396112,0.0008010763,0.0017536682,0.0890294],"genre_scores_gemma":[0.94863975,0.0007609608,0.028871732,0.00014685896,0.000074841155,0.000030823554,0.00014289483,0.00011810457,0.021213902],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997129,0.000042376465,0.00001425079,0.000040367166,0.0001385764,0.000051485],"domain_scores_gemma":[0.99968195,0.00012659584,0.000031127907,0.00007125228,0.00006802618,0.000021082513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332319,0.00033928172,0.000794777,0.0003065676,0.0004989533,0.0011413874,0.0020304632,0.0006032648,0.0055835405],"category_scores_gemma":[0.00053644204,0.00021275708,0.0003489795,0.00066364574,0.0003372766,0.0015247596,0.0005749881,0.0005374318,0.0011968149],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018680331,0.00044771863,0.0026357574,0.00084303465,0.00018001476,0.00088473293,0.00033173407,0.17286628,0.5112584,0.18186258,0.013391571,0.11343015],"study_design_scores_gemma":[0.0001161411,0.0009676703,0.0030974548,0.00010790886,0.00014520047,0.00075205084,0.00012552855,0.79633373,0.14997163,0.02490411,0.023372473,0.00010620641],"about_ca_topic_score_codex":0.00060880923,"about_ca_topic_score_gemma":0.0009857325,"teacher_disagreement_score":0.0055835405,"about_ca_system_score_codex":0.00060116686,"about_ca_system_score_gemma":0.0002513938,"threshold_uncertainty_score":0.018678844},"labels":[],"label_agreement":null},{"id":"W1540218530","doi":"10.1007/11527862_34","title":"Automatic State Abstraction for Pathfinding in Real-Time Video Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Pathfinding; Abstraction; Adversarial system; Domain (mathematical analysis); State (computer science); Video game; Plan (archaeology); Human–computer interaction; Artificial intelligence; Theoretical computer science; Programming language; Multimedia","score_opus":0.027409968702692352,"score_gpt":0.28901069773212085,"score_spread":0.2616007290294285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540218530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013903519,0.00008540232,0.9794601,0.000047011723,0.00003148398,0.00007197792,0.00016309292,0.004134024,0.0021033173],"genre_scores_gemma":[0.5072681,0.00015619917,0.48706335,0.000049915783,0.000018783403,0.00018070723,0.00087543414,0.0004556434,0.003931844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999448,0.00011623667,0.000041565556,0.00012489714,0.000169266,0.00009995098],"domain_scores_gemma":[0.999246,0.00038764055,0.000045009307,0.00017762557,0.00011010337,0.000033655484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005882083,0.0007703875,0.0008782039,0.0007580138,0.00065154076,0.0012391715,0.00169614,0.00066835986,0.006753345],"category_scores_gemma":[0.0021071124,0.0005354964,0.0012440657,0.0006713303,0.00090763916,0.0022477317,0.0022401304,0.0015872084,0.00090055517],"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.000725714,0.00030399024,0.0016901976,0.0006288673,0.00014740457,0.00035316555,0.0012347155,0.20225158,0.028982803,0.15377846,0.010282061,0.59962106],"study_design_scores_gemma":[0.000037067464,0.000039303788,0.00040649268,0.000026593005,0.00003433474,0.00005242007,0.00010429888,0.89348835,0.008741384,0.09320706,0.0038419052,0.000020864352],"about_ca_topic_score_codex":0.006417367,"about_ca_topic_score_gemma":0.010213898,"teacher_disagreement_score":0.006753345,"about_ca_system_score_codex":0.000761122,"about_ca_system_score_gemma":0.00096423976,"threshold_uncertainty_score":0.022592247},"labels":[],"label_agreement":null},{"id":"W1540226096","doi":"10.1007/978-3-540-71233-6_36","title":"Efficient and Scalable Indexing Techniques for Biological Sequence Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Search engine indexing; Scalability; Computer science; Suffix tree; Suffix; Sequence (biology); Data mining; Data structure; Search algorithm; Representation (politics); Variety (cybernetics); Theoretical computer science; Information retrieval; Algorithm; Artificial intelligence; Database; Programming language","score_opus":0.08733877345549901,"score_gpt":0.32181524515835597,"score_spread":0.23447647170285696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540226096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017150095,0.0059560384,0.95344764,0.000768153,0.00064789545,0.00031285424,0.0042307363,0.014562899,0.002923653],"genre_scores_gemma":[0.046722263,0.0034355656,0.9319419,0.00020961191,0.00043742196,0.00048911164,0.012212234,0.0007992432,0.003752512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984829,0.00016769188,0.00022804615,0.00022309598,0.00076607923,0.00013218111],"domain_scores_gemma":[0.9962029,0.0012708752,0.00029588433,0.001502922,0.00059956656,0.00012777085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018685,0.0013821563,0.0017970095,0.004764658,0.001311132,0.0027599852,0.0030415778,0.0011743858,0.0044739577],"category_scores_gemma":[0.0056828507,0.00081246224,0.0013077733,0.011815498,0.00094805245,0.0055184574,0.0028823717,0.0017769971,0.0037927597],"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.00033572482,0.00017288078,0.00058164983,0.0008768181,0.00008688069,0.00022329591,0.0002961799,0.010870646,0.07502332,0.022518521,0.041151643,0.8478625],"study_design_scores_gemma":[0.0003950494,0.0005671501,0.0020959089,0.00026990304,0.00025390444,0.0019271165,0.0005356073,0.50482106,0.18589734,0.2032437,0.09979426,0.00019901498],"about_ca_topic_score_codex":0.001686538,"about_ca_topic_score_gemma":0.0028055161,"teacher_disagreement_score":0.004764658,"about_ca_system_score_codex":0.00096361304,"about_ca_system_score_gemma":0.0019096951,"threshold_uncertainty_score":0.0149668455},"labels":[],"label_agreement":null},{"id":"W1540251538","doi":"10.1007/11551492_28","title":"Closed-Form Formulas for Private Watermarking Capacities of Laplacian Sources with the Magnitude-Error Distortion Measure and Under Additive Attacks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digital watermarking; Distortion (music); Laplace operator; Measure (data warehouse); Mathematics; Laplacian matrix; Computer science; Image (mathematics); Artificial intelligence; Mathematical analysis; Data mining; Telecommunications","score_opus":0.016342487076546276,"score_gpt":0.23805450212193416,"score_spread":0.22171201504538787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540251538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016417297,0.0034738882,0.9140789,0.0022672925,0.00031654717,0.00019513814,0.0008475412,0.00032714786,0.062076256],"genre_scores_gemma":[0.60584056,0.01142943,0.33475766,0.0018302031,0.0020457308,0.0017734759,0.0017777719,0.0010925734,0.03945258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979734,0.00073320256,0.000112828784,0.0002840159,0.00064255454,0.0002541109],"domain_scores_gemma":[0.978879,0.016532032,0.00083879393,0.0009885514,0.002414499,0.00034718766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049201264,0.0030168965,0.001827721,0.0038487911,0.0010938675,0.005622827,0.003924359,0.0040279473,0.02513875],"category_scores_gemma":[0.039117366,0.0012488164,0.0013220197,0.0036232292,0.003970559,0.01255104,0.003964772,0.004908675,0.0033913448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432536,0.00006060638,0.00013957139,0.00035253438,0.00002453577,0.00009587508,0.00032373643,0.037605867,0.0012830275,0.9306111,0.005602949,0.023856025],"study_design_scores_gemma":[0.0000144132455,0.000019802399,0.00014252507,0.00020230374,0.000028128516,0.00023303786,0.00012217888,0.17526406,0.00080971164,0.8200451,0.0030653595,0.000053338546],"about_ca_topic_score_codex":0.0010612528,"about_ca_topic_score_gemma":0.0018803647,"teacher_disagreement_score":0.02513875,"about_ca_system_score_codex":0.0041579236,"about_ca_system_score_gemma":0.0016635924,"threshold_uncertainty_score":0.084097564},"labels":[],"label_agreement":null},{"id":"W1540315273","doi":"10.1007/11963271_3","title":"A Context Interpretation Based Wireless Sensor Network for the Emergency Preparedness Class of Applications","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Ottawa","funders":"","keywords":"Wireless sensor network; Interpretation (philosophy); Preparedness; Class (philosophy); Context (archaeology); Wireless network; Computer science; Wireless; Computer network; Computer security; Telecommunications; Geography; Artificial intelligence; Political science; Programming language","score_opus":0.011695981361933757,"score_gpt":0.23920603423387815,"score_spread":0.2275100528719444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540315273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013505489,0.0047966284,0.9632555,0.00046984124,0.00051221397,0.00021716901,0.00020815304,0.0029472506,0.014087747],"genre_scores_gemma":[0.17809682,0.004971758,0.7920201,0.0004369091,0.00027826003,0.00031170453,0.0004512193,0.00022782617,0.023205377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999876,0.000016798504,0.0000070068527,0.000030222342,0.000058057423,0.0000118035205],"domain_scores_gemma":[0.999913,0.000024064391,0.0000072388825,0.000014288864,0.000027658667,0.000013768673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019882298,0.0007144211,0.0005194088,0.00031297427,0.00036549245,0.0005526032,0.0010063417,0.0006446922,0.003428763],"category_scores_gemma":[0.0003826815,0.00024617065,0.00035005691,0.00046039518,0.0002601108,0.0008576706,0.00054826547,0.0009766216,0.0010427714],"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.00036094635,0.0001997378,0.00079278584,0.0005051282,0.00007282372,0.00064001424,0.0002665817,0.038027633,0.12032916,0.03778883,0.02434198,0.77667433],"study_design_scores_gemma":[0.00010122069,0.00062522746,0.0024239314,0.00020396663,0.00021144244,0.00216966,0.00016511658,0.6778634,0.06725783,0.03910712,0.20976011,0.000111013556],"about_ca_topic_score_codex":0.00093701726,"about_ca_topic_score_gemma":0.0027111263,"teacher_disagreement_score":0.003428763,"about_ca_system_score_codex":0.00020290917,"about_ca_system_score_gemma":0.0003005831,"threshold_uncertainty_score":0.011470318},"labels":[],"label_agreement":null},{"id":"W1540378711","doi":"10.1007/978-3-540-30219-3_6","title":"Algorithms for Finding Maximal-Scoring Segment Sets","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Disjoint sets; Computer science; Sequence (biology); Maximal set; Set (abstract data type); Segmentation; Algorithm; Coding (social sciences); Time complexity; Combinatorics; Mathematics; Artificial intelligence; Genetics","score_opus":0.02468977663481753,"score_gpt":0.2664419108260368,"score_spread":0.24175213419121927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540378711","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.023538778,0.00084533525,0.960662,0.00032083655,0.00009909315,0.00044945237,0.0013895442,0.007276499,0.0054184822],"genre_scores_gemma":[0.06874606,0.00042084142,0.91843253,0.000121764446,0.00008301413,0.00047847882,0.0066824355,0.00067518564,0.0043597315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975063,0.0004043338,0.00025336657,0.0006183682,0.0009483156,0.0002693277],"domain_scores_gemma":[0.9930936,0.0042884476,0.0003036134,0.0010699986,0.0009944757,0.0002498351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033295236,0.0032356416,0.0034346292,0.006096689,0.0025006854,0.004113139,0.0067167864,0.0040619792,0.020459838],"category_scores_gemma":[0.013124273,0.0022289772,0.0028940688,0.0077346084,0.0017854084,0.0073999343,0.005814246,0.0030877287,0.0070359902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006727113,0.00036023508,0.0016873745,0.0005282209,0.00014681999,0.00015534916,0.00033039742,0.08526874,0.006043029,0.03619959,0.023839636,0.8447679],"study_design_scores_gemma":[0.00019297274,0.0001653465,0.0007222073,0.00011868836,0.00012751362,0.00031173864,0.00026663998,0.7944232,0.008209551,0.18766011,0.007747189,0.000054785636],"about_ca_topic_score_codex":0.0024976162,"about_ca_topic_score_gemma":0.0050842464,"teacher_disagreement_score":0.020459838,"about_ca_system_score_codex":0.0017563191,"about_ca_system_score_gemma":0.0022160113,"threshold_uncertainty_score":0.06844497},"labels":[],"label_agreement":null},{"id":"W1540511301","doi":"10.1007/978-3-642-13059-5_12","title":"Finding a Single, All, or the Most Probable Solution to a Finite or Non-finite Interval Algebra Network","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Acadia University","funders":"","keywords":"Interval (graph theory); Computer science; Algebra over a field; Mathematics; Pure mathematics; Combinatorics","score_opus":0.03095552379147703,"score_gpt":0.25525366600454746,"score_spread":0.22429814221307043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540511301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05258165,0.00045267117,0.93763334,0.0012034414,0.000053314736,0.0001252547,0.0006935989,0.00033169493,0.00692505],"genre_scores_gemma":[0.3348526,0.0006321941,0.65761876,0.00017751181,0.00011487265,0.00019163499,0.0013459985,0.00014530214,0.004921087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992399,0.00022520275,0.000045546883,0.00030910768,0.00010396376,0.00007625675],"domain_scores_gemma":[0.99677867,0.0025981662,0.00020787687,0.00015681228,0.00015949391,0.000099058554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014417233,0.00071000564,0.0012587149,0.0010466409,0.00089582853,0.0019118803,0.0025637944,0.0017699088,0.007564433],"category_scores_gemma":[0.007634005,0.00064145244,0.0016633375,0.0012870394,0.0013045782,0.0038422807,0.0010505294,0.0015174024,0.00069067936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020855866,0.000108298955,0.002258115,0.00056287483,0.00024381651,0.00020023255,0.00037085402,0.76797664,0.0019463123,0.11119421,0.004106991,0.11082308],"study_design_scores_gemma":[0.000027204635,0.00005879766,0.00026738498,0.000038812326,0.00005924972,0.00012426887,0.00021175285,0.7975737,0.001181964,0.19855969,0.0018752026,0.00002197236],"about_ca_topic_score_codex":0.0028979313,"about_ca_topic_score_gemma":0.0036668202,"teacher_disagreement_score":0.007564433,"about_ca_system_score_codex":0.0010552774,"about_ca_system_score_gemma":0.0016287636,"threshold_uncertainty_score":0.02530551},"labels":[],"label_agreement":null},{"id":"W1540524588","doi":"10.1007/978-3-540-69939-2_7","title":"Supervised Incremental Learning with the Fuzzy ARTMAP Neural Network","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and ELM","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Incremental learning; Machine learning; Generalization; Retraining; Word error rate; Fuzzy logic; Semi-supervised learning; Generalization error; Supervised learning; Pattern recognition (psychology); Block (permutation group theory); Mathematics","score_opus":0.01202916776167779,"score_gpt":0.21821246572499722,"score_spread":0.20618329796331944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540524588","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.018215286,0.0010735178,0.97525036,0.00014450533,0.00015333126,0.000060303628,0.00008941601,0.0010498295,0.0039634663],"genre_scores_gemma":[0.4371138,0.00062942697,0.5543426,0.00015146912,0.00021032935,0.00017705359,0.00033941082,0.00014927448,0.006886694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997168,0.000059121652,0.000018354305,0.00007929926,0.00010165296,0.000024767338],"domain_scores_gemma":[0.9992519,0.00034651582,0.00004390215,0.00012260274,0.0002125227,0.000022525088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008109768,0.00048640696,0.00096263253,0.0005508938,0.00032807,0.0007953524,0.0020354057,0.0009984819,0.0032148394],"category_scores_gemma":[0.0029805794,0.00042909372,0.0006492315,0.00071684254,0.00043678092,0.0015247116,0.0008945833,0.0012272256,0.00064423826],"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.00013966089,0.000093085146,0.0005553388,0.00015901325,0.00008246093,0.00008489122,0.000058537436,0.20844738,0.004690739,0.012997824,0.0057874913,0.7669035],"study_design_scores_gemma":[0.000005625791,0.000027535218,0.00012505389,0.000006535567,0.000011881699,0.000034935878,0.000003530088,0.9920459,0.0012141943,0.005811255,0.00070760545,0.000005990811],"about_ca_topic_score_codex":0.0031990525,"about_ca_topic_score_gemma":0.0041696858,"teacher_disagreement_score":0.0032148394,"about_ca_system_score_codex":0.0004196585,"about_ca_system_score_gemma":0.00062776875,"threshold_uncertainty_score":0.0107547045},"labels":[],"label_agreement":null},{"id":"W154056955","doi":"10.1007/978-3-642-23626-6_59","title":"Automatic View Planning for Cardiac MRI Acquisition","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Siemens (Canada)","funders":"","keywords":"Computer science; Computer vision; Workflow; Segmentation; Ventricle; Artificial intelligence; Process (computing); Medicine; Cardiology","score_opus":0.029079452560573385,"score_gpt":0.30446686640723286,"score_spread":0.2753874138466595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154056955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00959581,0.00084103725,0.98538685,0.00009946373,0.00002855075,0.00007867621,0.00023037476,0.0024565542,0.001282658],"genre_scores_gemma":[0.15490654,0.0013059253,0.8405552,0.00011137106,0.000039218558,0.00013131718,0.0005528454,0.00097483536,0.0014227604],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964654,0.00008974609,0.000022953589,0.00006731718,0.00011923263,0.000054149918],"domain_scores_gemma":[0.9993344,0.00035036769,0.00005695821,0.00008920557,0.000104411694,0.00006469735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046929152,0.0009385523,0.0008555354,0.0011977861,0.00047309606,0.0015221005,0.0008296307,0.0010644651,0.004034514],"category_scores_gemma":[0.001971628,0.0014756528,0.00087744405,0.0008877732,0.0002681858,0.00069959846,0.0009620572,0.0013565982,0.0015009486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008750287,0.00011963047,0.0032934484,0.00045589043,0.00011585953,0.00071218243,0.00036242965,0.09310693,0.1662031,0.0065699737,0.014452091,0.7137335],"study_design_scores_gemma":[0.00009807985,0.00035671794,0.0037591148,0.00013868895,0.00013934946,0.002909364,0.00014371915,0.8500005,0.11481858,0.010669006,0.016805958,0.0001609879],"about_ca_topic_score_codex":0.005547412,"about_ca_topic_score_gemma":0.012027295,"teacher_disagreement_score":0.005547412,"about_ca_system_score_codex":0.0004953508,"about_ca_system_score_gemma":0.0020707587,"threshold_uncertainty_score":0.013496816},"labels":[],"label_agreement":null},{"id":"W1540636713","doi":"10.1007/3-540-47887-6_52","title":"Interactive Construction of Classification Rules","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Visualization; Classifier (UML); Human–computer interaction; Process (computing); Interactive visualization; Table (database); Domain (mathematical analysis); Multidimensional data; Data mining; Artificial intelligence; Machine learning; Information retrieval; Programming language","score_opus":0.031236686092690216,"score_gpt":0.2853442404498113,"score_spread":0.2541075543571211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540636713","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.0146485735,0.00024616354,0.92840374,0.0004253169,0.0001476254,0.0002390436,0.0022702566,0.042550735,0.011068555],"genre_scores_gemma":[0.14389426,0.00030278004,0.8339327,0.00029289268,0.000081313745,0.00034343748,0.0064778663,0.00349518,0.011179622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839634,0.0003206638,0.00013837345,0.00043009748,0.00060161174,0.00011278149],"domain_scores_gemma":[0.994383,0.0039824597,0.000136129,0.00078995526,0.000531293,0.00017723815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021340735,0.0012969027,0.0014398482,0.0022439312,0.0008572927,0.0037293474,0.0018878658,0.0010254068,0.028109666],"category_scores_gemma":[0.0095013175,0.00079957524,0.0019414767,0.0016037067,0.0006390942,0.0023671733,0.0036096724,0.0016772537,0.008026913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057817315,0.00021947782,0.002458702,0.0005782258,0.00016992359,0.0005618733,0.0010967233,0.011351529,0.022471568,0.030461,0.05642299,0.8736298],"study_design_scores_gemma":[0.00019490253,0.00016360087,0.0032711534,0.00036215846,0.00024188192,0.00070380204,0.00071138353,0.5707862,0.080882065,0.14812906,0.19444455,0.00010922703],"about_ca_topic_score_codex":0.0026360194,"about_ca_topic_score_gemma":0.0047872686,"teacher_disagreement_score":0.028109666,"about_ca_system_score_codex":0.0007738601,"about_ca_system_score_gemma":0.0009328435,"threshold_uncertainty_score":0.09403622},"labels":[],"label_agreement":null},{"id":"W1540675203","doi":"10.1007/11691792_13","title":"An Intensional Programming Approach to Multi-agent Coordination in a Distributed Network of Agents","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Concordia University","funders":"","keywords":"Computer science; Distributed object; Programming language; Semantics (computer science); Syntax; Operational semantics; Context (archaeology); Database transaction; Class (philosophy); Object-oriented programming; Distributed computing; Theoretical computer science; Artificial intelligence; Common Object Request Broker Architecture","score_opus":0.0314149195943965,"score_gpt":0.26805731233728397,"score_spread":0.23664239274288748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540675203","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.0019385923,0.00017284161,0.9789863,0.0004452212,0.00005494574,0.000035365076,0.000017212598,0.000085521366,0.01826403],"genre_scores_gemma":[0.17533647,0.00082429516,0.7887291,0.00040232902,0.00026940848,0.00050856825,0.00008095118,0.00016775665,0.033681072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891603,0.00053198106,0.000056497713,0.0001293359,0.00027759917,0.00008866656],"domain_scores_gemma":[0.99910504,0.000558523,0.000060497085,0.0001128651,0.000105989435,0.00005704543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021758429,0.0007907787,0.0006748176,0.000525394,0.0009268717,0.0024018304,0.002747072,0.0010257742,0.0064176316],"category_scores_gemma":[0.0028320975,0.00069168385,0.0009179307,0.00097134936,0.0025782774,0.0040964885,0.0022003485,0.003620206,0.00053502043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010236003,0.000015885826,0.000027649176,0.00003993056,0.000007998826,0.000039997147,0.00015040176,0.022482097,0.0004773918,0.9665803,0.0008993078,0.00926883],"study_design_scores_gemma":[0.000022484937,0.000022489527,0.000042665415,0.000029079361,0.000017901475,0.00006761805,0.000056119225,0.22528449,0.00063893443,0.7600278,0.013778102,0.000012373386],"about_ca_topic_score_codex":0.001074877,"about_ca_topic_score_gemma":0.0015853543,"teacher_disagreement_score":0.0064176316,"about_ca_system_score_codex":0.0011933515,"about_ca_system_score_gemma":0.00086369214,"threshold_uncertainty_score":0.021469116},"labels":[],"label_agreement":null},{"id":"W1540704818","doi":"10.1007/3-540-45053-x_33","title":"Multimodal Elastic Matching of Brain Images","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Image registration; Artificial intelligence; Matching (statistics); Transformation (genetics); Iterated function; Computer vision; Image (mathematics); Pattern recognition (psychology); Mathematics","score_opus":0.011044005041093256,"score_gpt":0.2686283494709561,"score_spread":0.25758434442986283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540704818","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.036370452,0.0012698725,0.95410365,0.00030944808,0.000103243496,0.00006508593,0.00024029867,0.0010783128,0.006459618],"genre_scores_gemma":[0.42307445,0.0029130387,0.54382217,0.0003292016,0.00023328724,0.0001323664,0.0010558707,0.001212885,0.027226668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997098,0.00004116313,0.000017396154,0.000073900344,0.00010747168,0.000050247512],"domain_scores_gemma":[0.99957746,0.00013760124,0.000055803936,0.0001249728,0.00007959102,0.000024620947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007979156,0.0005271992,0.0007703299,0.0017549937,0.00034095356,0.0014737963,0.0009207167,0.0011276864,0.007874866],"category_scores_gemma":[0.0024216648,0.00047956273,0.00078063895,0.0020420377,0.00049884274,0.0017640507,0.0015220207,0.00075172033,0.001891222],"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.00036767664,0.00009859873,0.00075113436,0.0002779163,0.000118108896,0.00032015468,0.00013356435,0.06037135,0.0950103,0.0157273,0.006367965,0.8204559],"study_design_scores_gemma":[0.000028673832,0.00015797945,0.005536599,0.00011938411,0.0001446388,0.0023109382,0.00020446068,0.8069665,0.10694292,0.05972591,0.017786797,0.00007520103],"about_ca_topic_score_codex":0.0012592102,"about_ca_topic_score_gemma":0.002217796,"teacher_disagreement_score":0.007874866,"about_ca_system_score_codex":0.0003902875,"about_ca_system_score_gemma":0.00037973374,"threshold_uncertainty_score":0.02634406},"labels":[],"label_agreement":null},{"id":"W1540779876","doi":"10.1007/978-3-540-30480-7_16","title":"Wrapping HTML Tables into XML","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Carleton University","funders":"","keywords":"Computer science; XML; Programming language; Information retrieval; World Wide Web","score_opus":0.01515788186687181,"score_gpt":0.2384742168423802,"score_spread":0.2233163349755084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540779876","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.0063769934,0.00037596354,0.90734863,0.00036131623,0.0003844523,0.00018302811,0.0023613924,0.06876149,0.013846711],"genre_scores_gemma":[0.0867254,0.0019680986,0.78301215,0.0010551943,0.00019812273,0.00041815176,0.026198188,0.03142183,0.06900286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907744,0.00016068648,0.00013612781,0.00016587548,0.0003856669,0.00007416868],"domain_scores_gemma":[0.99748766,0.0009070135,0.000087415756,0.001102722,0.0003443825,0.00007081412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014700316,0.001198597,0.0007717432,0.0021755365,0.0005999663,0.0033912945,0.0016801336,0.0010765453,0.01582085],"category_scores_gemma":[0.0054839174,0.0016871128,0.0015209841,0.003175812,0.00057316304,0.004373256,0.0029903003,0.0015847703,0.013556569],"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.00022718671,0.0002561044,0.001619855,0.00087058346,0.00015492758,0.001260786,0.0014585077,0.008098916,0.026965138,0.05608794,0.13034926,0.7726508],"study_design_scores_gemma":[0.00010407431,0.00010404097,0.0015797886,0.000701164,0.0002653075,0.0015782813,0.0004527243,0.08640899,0.14580795,0.10495303,0.65788263,0.00016199898],"about_ca_topic_score_codex":0.0014461654,"about_ca_topic_score_gemma":0.0014175484,"teacher_disagreement_score":0.01582085,"about_ca_system_score_codex":0.00048252422,"about_ca_system_score_gemma":0.00053763884,"threshold_uncertainty_score":0.052926064},"labels":[],"label_agreement":null},{"id":"W1540786568","doi":"10.1007/11919476_23","title":"Temporal Alignment of Time Varying MRI Datasets for High Resolution Medical Visualization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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 Alberta","funders":"","keywords":"Computer science; Visualization; Dimension (graph theory); Temporal resolution; Data mining; Data visualization; Medical imaging; Artificial intelligence; Resolution (logic); Surgical planning; High resolution; Image resolution; Computer vision; Radiology; Remote sensing","score_opus":0.016619591063450234,"score_gpt":0.290873090100731,"score_spread":0.27425349903728075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540786568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016576353,0.0009417744,0.97829276,0.000249938,0.00013653559,0.000050645667,0.0003432334,0.0014869862,0.0019217923],"genre_scores_gemma":[0.15887225,0.0023318678,0.83361644,0.00014126838,0.00015941077,0.00018281069,0.0010255538,0.001123191,0.002547264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997466,0.00006388938,0.000020795223,0.000034764154,0.00010896105,0.000025083347],"domain_scores_gemma":[0.99906987,0.000391589,0.00013119477,0.00015421271,0.00019113795,0.00006201022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944418,0.0005221571,0.00042333413,0.0010999679,0.0003205152,0.0014096408,0.0006018411,0.0005470612,0.0057549565],"category_scores_gemma":[0.00413365,0.00046273126,0.00037678477,0.0022344752,0.00021860152,0.0010944814,0.0007594878,0.0010052669,0.0008672415],"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.00080173713,0.0001988378,0.002048531,0.0007061577,0.00014226935,0.0003353531,0.00043273353,0.066776045,0.27874073,0.023160033,0.019431978,0.60722554],"study_design_scores_gemma":[0.00006854091,0.00024104898,0.008256838,0.00011907372,0.00011589792,0.0012901333,0.00028850362,0.7855431,0.13684058,0.027043859,0.04008887,0.00010362137],"about_ca_topic_score_codex":0.0012627166,"about_ca_topic_score_gemma":0.003076911,"teacher_disagreement_score":0.0057549565,"about_ca_system_score_codex":0.00031426112,"about_ca_system_score_gemma":0.00066658447,"threshold_uncertainty_score":0.01925224},"labels":[],"label_agreement":null},{"id":"W1540819628","doi":"10.1007/978-3-540-73499-4_31","title":"A Comparative Study of Unsupervised Machine Learning and Data Mining Techniques for Intrusion Detection","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 New Brunswick","funders":"","keywords":"Computer science; Intrusion detection system; Machine learning; Artificial intelligence; Data mining; Heuristics; Unsupervised learning; Set (abstract data type); Intrusion","score_opus":0.05115475528035425,"score_gpt":0.31494791937325556,"score_spread":0.2637931640929013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540819628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18539536,0.008375034,0.7939013,0.0007023088,0.00014696237,0.00020449152,0.0002906785,0.00109397,0.009889918],"genre_scores_gemma":[0.515963,0.0047859256,0.47446394,0.00016016568,0.00018910135,0.00014213107,0.0005851364,0.00020765295,0.0035029023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679995,0.0013517339,0.00020737817,0.00028835132,0.0012607088,0.00009181495],"domain_scores_gemma":[0.95472497,0.039713062,0.00085260946,0.0015557328,0.0030201036,0.00013357167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044217063,0.000577262,0.000814499,0.002757208,0.0004613439,0.0016841593,0.0009852584,0.00070434326,0.00089287973],"category_scores_gemma":[0.018426074,0.0002433827,0.0008051885,0.0036028412,0.0007465542,0.0034036087,0.0006827062,0.00072777923,0.00027077564],"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.0006115248,0.0004366517,0.015954,0.0007107558,0.0003890307,0.00011362152,0.0004887628,0.03713708,0.0074521997,0.015512561,0.0022241124,0.9189698],"study_design_scores_gemma":[0.00006485837,0.00078776665,0.023106987,0.00020185614,0.0003220559,0.00092652504,0.0006940536,0.9157758,0.016827708,0.032301035,0.008913189,0.00007818879],"about_ca_topic_score_codex":0.0017384083,"about_ca_topic_score_gemma":0.0028307901,"teacher_disagreement_score":0.0044217063,"about_ca_system_score_codex":0.00072990666,"about_ca_system_score_gemma":0.0008661275,"threshold_uncertainty_score":0.023384511},"labels":[],"label_agreement":null},{"id":"W1540848743","doi":"10.1007/978-3-540-70567-3_21","title":"Towards Automation of Testing High-Level Security Properties","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Concordia University","funders":"","keywords":"Security testing; Software security assurance; Computer science; System integration testing; Computer security; Software reliability testing; Automation; Software; Argument (complex analysis); Software testing; Software engineering; Software development; Software construction; Engineering; Cloud computing security; Security information and event management; Information security; Security service; Operating system; Cloud computing","score_opus":0.05668893060895422,"score_gpt":0.2531988604468793,"score_spread":0.19650992983792506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540848743","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.0074863727,0.00024934235,0.9827626,0.00016999243,0.000043582957,0.0000684315,0.00006975837,0.0053809355,0.0037690043],"genre_scores_gemma":[0.13016716,0.00055749883,0.8638897,0.00024086302,0.00007644752,0.000119322656,0.00049641065,0.00083199056,0.0036206322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930012,0.0021422033,0.00048220952,0.0008860381,0.003066805,0.0004213948],"domain_scores_gemma":[0.98082113,0.010530419,0.0006175542,0.006084425,0.0017346663,0.00021178945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027765778,0.0014329467,0.0011691967,0.0015320429,0.0005234233,0.0027133527,0.002323587,0.0014739829,0.0047625126],"category_scores_gemma":[0.010513226,0.0015358398,0.0018710884,0.0009920034,0.0018557506,0.0035829777,0.0026981323,0.0057186284,0.0033440972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034259618,0.00058921415,0.003215324,0.0011860059,0.000162412,0.00066292187,0.0009986861,0.03348495,0.09424993,0.13255884,0.011440354,0.7211088],"study_design_scores_gemma":[0.00016811752,0.00035093745,0.0025186217,0.00041060688,0.00023079748,0.0019352286,0.00015719626,0.36993286,0.19883901,0.37503728,0.050327398,0.00009190687],"about_ca_topic_score_codex":0.00086299994,"about_ca_topic_score_gemma":0.0012360634,"teacher_disagreement_score":0.0047625126,"about_ca_system_score_codex":0.0005956511,"about_ca_system_score_gemma":0.0013081633,"threshold_uncertainty_score":0.015932143},"labels":[],"label_agreement":null},{"id":"W1540871397","doi":"10.1007/978-3-540-75759-7_61","title":"Is a Single Energy Functional Sufficient? Adaptive Energy Functionals and Automatic Initialization","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","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":"Simon Fraser University","funders":"Canadian Institutes of Health Research; University of British Columbia","keywords":"Initialization; Artificial intelligence; Segmentation; Image segmentation; Energy functional; Image (mathematics); Pattern recognition (psychology); Minification; Energy (signal processing); Computer science; Ideal (ethics); Context (archaeology); Set (abstract data type); Scale-space segmentation; Manifold (fluid mechanics); Mathematics; Computer vision; Mathematical optimization; Statistics; Engineering","score_opus":0.025156991252737577,"score_gpt":0.26768392699837257,"score_spread":0.242526935745635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540871397","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.02391117,0.0012495607,0.96886194,0.0019273538,0.00017998749,0.000029928877,0.00011232242,0.00021973968,0.0035079173],"genre_scores_gemma":[0.4860441,0.0022488122,0.5036258,0.0008011339,0.0005094889,0.00024272571,0.0004840232,0.0008490875,0.005194817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990984,0.00029879552,0.00009515531,0.00023876641,0.00015033955,0.000118537166],"domain_scores_gemma":[0.99440753,0.0035878916,0.00050309044,0.0007537144,0.00054821966,0.00019949417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033357593,0.0009277522,0.0024576506,0.0015317133,0.00077205617,0.0016570315,0.0015994438,0.0037077654,0.0045356494],"category_scores_gemma":[0.016454032,0.0014298543,0.0012243219,0.00095712935,0.0023238931,0.0063139033,0.002507761,0.002816719,0.0012330596],"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.00059200777,0.0001374263,0.0033447724,0.001045723,0.00025575675,0.00046514423,0.0002800869,0.12414733,0.033909403,0.6716769,0.0083728675,0.15577266],"study_design_scores_gemma":[0.00005977991,0.0000829882,0.0018591605,0.00021278496,0.000069036505,0.00039839916,0.00010633815,0.60889083,0.007116743,0.37773156,0.003375405,0.00009691243],"about_ca_topic_score_codex":0.00075982837,"about_ca_topic_score_gemma":0.0011846224,"teacher_disagreement_score":0.0045356494,"about_ca_system_score_codex":0.0004004551,"about_ca_system_score_gemma":0.0010816699,"threshold_uncertainty_score":0.017641366},"labels":[],"label_agreement":null},{"id":"W1540887169","doi":"10.1007/3-540-39205-x_27","title":"Adaptive Granular Control of an HVDC System: A Rough Set Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Control theory (sociology); Controller (irrigation); PID controller; High-voltage direct current; Adaptive control; Control engineering; Rough set; Computer science; Control system; Set (abstract data type); Voltage; Engineering; Control (management); Artificial intelligence; Direct current; Temperature control","score_opus":0.030938275970327125,"score_gpt":0.2442652648386202,"score_spread":0.2133269888682931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540887169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017485179,0.0007146387,0.9758518,0.00017483953,0.00010244426,0.00004284574,0.000039252158,0.00016090208,0.0054281885],"genre_scores_gemma":[0.94266754,0.0008660927,0.05388782,0.000056134042,0.00008523017,0.000077303055,0.000041415013,0.000037465474,0.0022810919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933416,0.00015563481,0.000048513677,0.00009918881,0.0002703902,0.00009203627],"domain_scores_gemma":[0.99950194,0.00019780456,0.00009790896,0.000062359126,0.00011252027,0.000027512706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010110914,0.00080013205,0.0021248104,0.00077650533,0.00065478275,0.002935612,0.0013760955,0.0008453231,0.0013163773],"category_scores_gemma":[0.0017086343,0.00052484265,0.0010845151,0.001103292,0.0011974451,0.0015545934,0.0010463683,0.0010324799,0.00013015029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006234018,0.000025789395,0.00014186482,0.00011603918,0.000054354525,0.00008770013,0.0000709876,0.94671226,0.0029524886,0.027146814,0.00054550666,0.022083793],"study_design_scores_gemma":[0.0000057607485,0.000036335583,0.00015479833,0.000012180615,0.000020723935,0.000015158629,0.000018907185,0.9868564,0.00036746915,0.012124285,0.00037146814,0.000016513111],"about_ca_topic_score_codex":0.0056129023,"about_ca_topic_score_gemma":0.002933788,"teacher_disagreement_score":0.0056129023,"about_ca_system_score_codex":0.0010904408,"about_ca_system_score_gemma":0.0007036921,"threshold_uncertainty_score":0.011160493},"labels":[],"label_agreement":null},{"id":"W1541017766","doi":"10.1007/978-3-642-15880-3_30","title":"Asking Generalized Queries to Ambiguous Oracle","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Oracle; Computer science; Probabilistic logic; Set (abstract data type); Construct (python library); Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.011156877252388862,"score_gpt":0.25354382179337587,"score_spread":0.242386944540987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541017766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16667476,0.0020872273,0.75365615,0.013604631,0.00079680514,0.00034019913,0.0018192998,0.007104481,0.053916447],"genre_scores_gemma":[0.8379189,0.0011363961,0.13185716,0.0031142167,0.0010561092,0.00023856474,0.003006441,0.0013747948,0.020297395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923396,0.0032041832,0.00047662054,0.0013714143,0.0016373375,0.00097085716],"domain_scores_gemma":[0.9805259,0.014751764,0.00041543518,0.002994527,0.0008404492,0.0004719459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003861912,0.0012998229,0.0028414582,0.0007641733,0.0019483615,0.00523132,0.0028859426,0.0044643665,0.011584852],"category_scores_gemma":[0.023333555,0.0010415011,0.0019530281,0.0018968054,0.0038537888,0.014225174,0.0075566475,0.006318878,0.0023654103],"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.0017180492,0.00028831707,0.0046693045,0.001369359,0.00031607985,0.0030259516,0.0048520635,0.040068325,0.015451531,0.67981803,0.073592894,0.17482999],"study_design_scores_gemma":[0.000086461754,0.000053793567,0.0005890647,0.00006501776,0.00008557196,0.00068434235,0.0008634685,0.07041291,0.0037940675,0.90986454,0.013445969,0.00005478538],"about_ca_topic_score_codex":0.0017239001,"about_ca_topic_score_gemma":0.0016316964,"teacher_disagreement_score":0.011584852,"about_ca_system_score_codex":0.0019469629,"about_ca_system_score_gemma":0.0012511499,"threshold_uncertainty_score":0.03875518},"labels":[],"label_agreement":null},{"id":"W1541033774","doi":"10.1007/978-3-642-13059-5_22","title":"Overlap versus Imbalance","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Classifier (UML); Interdependence; Training set; Isolation (microbiology); Artificial intelligence; Machine learning; Pattern recognition (psychology)","score_opus":0.020382886878291023,"score_gpt":0.2655751414727915,"score_spread":0.24519225459450047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541033774","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.030674295,0.008922033,0.84242356,0.0055363146,0.0019468896,0.00018819024,0.00093925226,0.0016469612,0.107722424],"genre_scores_gemma":[0.5730159,0.007266629,0.2824387,0.0022262214,0.0061348714,0.00067597843,0.0031324148,0.0017722346,0.123336956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947358,0.0014713225,0.00028043988,0.0011491353,0.0019889988,0.0003743755],"domain_scores_gemma":[0.98924005,0.005918358,0.0004993114,0.00277828,0.0011675457,0.00039646085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003989602,0.0010888018,0.0016083576,0.002411784,0.0015276609,0.004001568,0.00185776,0.0014296168,0.01931017],"category_scores_gemma":[0.023214856,0.00062536425,0.00071873935,0.0036134403,0.0023955954,0.010932073,0.004873158,0.0026027805,0.005769542],"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.0003707466,0.000091097085,0.0017580118,0.00028565445,0.000053959702,0.000101956684,0.00039133523,0.0055043017,0.0019097711,0.49398866,0.039633524,0.45591098],"study_design_scores_gemma":[0.00002450143,0.000088307796,0.001047607,0.00010822402,0.000049295508,0.000671678,0.0002585278,0.047036313,0.0043690214,0.8642438,0.08207577,0.000026877111],"about_ca_topic_score_codex":0.00042143182,"about_ca_topic_score_gemma":0.0004971123,"teacher_disagreement_score":0.01931017,"about_ca_system_score_codex":0.0010298397,"about_ca_system_score_gemma":0.0007940763,"threshold_uncertainty_score":0.06459898},"labels":[],"label_agreement":null},{"id":"W1541070567","doi":"10.1007/978-3-642-04238-6_68","title":"What Next for ASP? (A Not-Entirely-Well-Informed Opinion)","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Answer set programming; Computer science; Stable model semantics; Non-monotonic logic; Semantics (computer science); Set (abstract data type); Circumscription; Default logic; Logic programming; Programming language; Description logic; Operational semantics","score_opus":0.031548426491185874,"score_gpt":0.2755483100393093,"score_spread":0.2439998835481234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541070567","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007169632,0.050713,0.011320522,0.8782563,0.017861849,0.0000143823845,0.00025313627,0.000115094794,0.040748786],"genre_scores_gemma":[0.057809323,0.16988745,0.03347197,0.6203065,0.043693442,0.00011028804,0.0007674191,0.0006621007,0.073291525],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970078,0.00090987154,0.00027801722,0.00060700695,0.00090690615,0.0002904039],"domain_scores_gemma":[0.99080443,0.0047850567,0.00038983324,0.0008535721,0.0022216763,0.0009453797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007996418,0.0006623126,0.0010464012,0.0016253431,0.0023621293,0.01145691,0.002864981,0.0104560135,0.012328986],"category_scores_gemma":[0.013504749,0.00047209352,0.00084301294,0.003001746,0.005871044,0.042170748,0.0038849174,0.015649246,0.008264623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036622878,0.00002432742,0.00019768708,0.00047747372,0.000022695294,0.00012142582,0.0009467744,0.00023283095,0.00023592406,0.42387155,0.46815932,0.105673335],"study_design_scores_gemma":[0.000009702952,0.000009187702,0.00017256793,0.0009055583,0.000014584234,0.00022360423,0.0010577723,0.00033191172,0.0002006699,0.20638683,0.7906662,0.000021423433],"about_ca_topic_score_codex":0.007327022,"about_ca_topic_score_gemma":0.00663545,"teacher_disagreement_score":0.012328986,"about_ca_system_score_codex":0.0027678749,"about_ca_system_score_gemma":0.0054568443,"threshold_uncertainty_score":0.042289615},"labels":[],"label_agreement":null},{"id":"W1541071326","doi":"10.1007/978-3-540-73214-3_2","title":"NPR Lenses: Interactive Tools for Non-photorealistic Line Drawings","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Rendering (computer graphics); Computer graphics (images); Lens (geology); Line drawings; Emphasis (telecommunications); Non-photorealistic rendering; Computer vision; Artificial intelligence; Engineering drawing; Animation; Optics; Computer facial animation; Computer animation","score_opus":0.03208193968877359,"score_gpt":0.30352978190764823,"score_spread":0.27144784221887464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541071326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069145244,0.0012165502,0.9065068,0.00014225936,0.00014059502,0.00014539677,0.0006462439,0.0141608445,0.07012681],"genre_scores_gemma":[0.11693921,0.003411242,0.747831,0.00021134022,0.000121495876,0.0004370872,0.0020469285,0.008180538,0.12082115],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952865,0.000069573674,0.000018235987,0.00005544369,0.00028814198,0.000040047707],"domain_scores_gemma":[0.9993456,0.00038265812,0.000024522496,0.00013647792,0.00008086843,0.000029805635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003201157,0.001154362,0.0004363816,0.000823983,0.00030026233,0.0015554277,0.0020233286,0.0007478858,0.08033154],"category_scores_gemma":[0.0018545416,0.0008579996,0.0006091479,0.0008060325,0.00037791755,0.0018722045,0.0017346579,0.0010126329,0.014031463],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019850286,0.000091429516,0.00018570154,0.0013705766,0.000027916893,0.0003858526,0.00070516195,0.0023114027,0.12879893,0.042593356,0.055966012,0.76736516],"study_design_scores_gemma":[0.00019485582,0.00024342466,0.0019820326,0.0004157919,0.00007205157,0.0046153436,0.0004213814,0.047389556,0.13606445,0.027270475,0.7811651,0.00016555157],"about_ca_topic_score_codex":0.00057199516,"about_ca_topic_score_gemma":0.0011877182,"teacher_disagreement_score":0.08033154,"about_ca_system_score_codex":0.00029456732,"about_ca_system_score_gemma":0.00021977644,"threshold_uncertainty_score":0.26873577},"labels":[],"label_agreement":null},{"id":"W1541236345","doi":"10.1007/11871842_44","title":"Improving the Ranking Performance of Decision Trees","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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 New Brunswick","funders":"","keywords":"Ranking (information retrieval); Computer science; Decision tree; Shrinkage; Artificial intelligence; Node (physics); Tree (set theory); Machine learning; Class (philosophy); Algorithm; Sample (material); Interpolation (computer graphics); Pattern recognition (psychology); Mathematics; Image (mathematics)","score_opus":0.013703560184896576,"score_gpt":0.23664064039214722,"score_spread":0.22293708020725064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541236345","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.22323126,0.012293822,0.7376966,0.0015716772,0.0015540209,0.00021592095,0.0016773671,0.010613917,0.011145536],"genre_scores_gemma":[0.6113612,0.0016407865,0.37123162,0.00044271437,0.0009990714,0.000109671906,0.0039744484,0.0008818006,0.009358759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549437,0.0016872839,0.00023716502,0.0004708392,0.0016611788,0.0004492428],"domain_scores_gemma":[0.9859903,0.008727011,0.00047562015,0.0016231025,0.0027624322,0.0004216229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004689978,0.0014523324,0.0025486168,0.0030511448,0.0009121751,0.002154526,0.00222013,0.0017799693,0.0041025486],"category_scores_gemma":[0.020988576,0.00054666423,0.00092600315,0.0037115014,0.00038400223,0.0035346919,0.001117313,0.002059998,0.00419622],"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.00080308004,0.000518109,0.0031845218,0.00025487982,0.00017910491,0.00008440396,0.000081950726,0.086184084,0.0066200136,0.0050105653,0.032451637,0.86462766],"study_design_scores_gemma":[0.00009223109,0.0003544294,0.0013694894,0.000030208184,0.00008442543,0.00010376725,0.00004222252,0.97516495,0.0065035294,0.013025239,0.0032000474,0.0000294366],"about_ca_topic_score_codex":0.0035112016,"about_ca_topic_score_gemma":0.004555545,"teacher_disagreement_score":0.004689978,"about_ca_system_score_codex":0.00081564224,"about_ca_system_score_gemma":0.0010733416,"threshold_uncertainty_score":0.02480328},"labels":[],"label_agreement":null},{"id":"W1541293861","doi":"10.1007/978-3-540-30178-3_5","title":"Building Policy-Based Context Aware Applications for Mobile Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"University of Ottawa","funders":"","keywords":"Computer science; Provisioning; Mobile device; Context (archaeology); Set (abstract data type); Context awareness; Ubiquitous computing; Mobile computing; Service (business); Mobile service; Human–computer interaction; World Wide Web; Computer network; Business","score_opus":0.021211352864516544,"score_gpt":0.2746714189806061,"score_spread":0.25346006611608957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541293861","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.032025617,0.0007354668,0.9381134,0.00024137666,0.00012282791,0.00021102797,0.00013272962,0.02524899,0.0031686486],"genre_scores_gemma":[0.3578226,0.0008439693,0.63514006,0.00022539214,0.000054908887,0.0003311916,0.00043590128,0.0010480444,0.0040979413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00011516786,0.000070338756,0.000120718716,0.00017633768,0.00009361188],"domain_scores_gemma":[0.99917465,0.00034146936,0.0000675682,0.0002011071,0.000115530274,0.00009969624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011931339,0.0009286773,0.00097570877,0.0006597891,0.0006959086,0.0019192976,0.0021901983,0.0016270323,0.002037468],"category_scores_gemma":[0.0029319408,0.0012387123,0.000563396,0.00066455966,0.0005259319,0.0025597408,0.0021722906,0.0020559211,0.0012090189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009265537,0.0011693824,0.0047687846,0.0006688906,0.00033018106,0.0013272661,0.001879511,0.21606603,0.12969187,0.03574716,0.025057018,0.58236736],"study_design_scores_gemma":[0.000047790305,0.00009386229,0.0006565383,0.00006134975,0.00009122884,0.00028516696,0.00021712488,0.89062357,0.059512835,0.024924902,0.023423836,0.00006185758],"about_ca_topic_score_codex":0.0027004646,"about_ca_topic_score_gemma":0.0035953734,"teacher_disagreement_score":0.0027004646,"about_ca_system_score_codex":0.0004671156,"about_ca_system_score_gemma":0.00068837486,"threshold_uncertainty_score":0.0068160295},"labels":[],"label_agreement":null},{"id":"W1541330210","doi":"10.1007/11527886_44","title":"Off-line Evaluation of Recommendation Functions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Session (web analytics); Computer science; Information retrieval; Similarity (geometry); Line (geometry); Web page; Computation; Recommender system; Function (biology); Data mining; World Wide Web; Algorithm; Artificial intelligence; Mathematics","score_opus":0.054047633223123025,"score_gpt":0.3053255259801609,"score_spread":0.2512778927570379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541330210","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.19112247,0.002381849,0.77749896,0.0003641366,0.00022774441,0.0004686526,0.0011446904,0.011564796,0.015226682],"genre_scores_gemma":[0.71409845,0.00046538268,0.26686677,0.00018331737,0.0001432874,0.00027272938,0.003026383,0.0009459441,0.01399777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99032205,0.0051003126,0.0004584266,0.00079071196,0.0028137446,0.0005148476],"domain_scores_gemma":[0.96978915,0.01818554,0.00066735846,0.005363969,0.005523826,0.00047012712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007672051,0.0017774055,0.0025724692,0.0021905985,0.0006435746,0.003330489,0.0025368421,0.0025169991,0.01485447],"category_scores_gemma":[0.03430737,0.0005728209,0.00081308413,0.0016681103,0.0006015667,0.0034547646,0.0016369612,0.0013147853,0.005211545],"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.0033553743,0.000833896,0.0036187223,0.0003233947,0.00020791031,0.00014206432,0.00010201154,0.11939423,0.008119991,0.0045344173,0.011137483,0.84823054],"study_design_scores_gemma":[0.00013054938,0.00036353938,0.0011029721,0.000025084586,0.0000412196,0.00010686636,0.000046312096,0.98843074,0.0055307853,0.0028841828,0.0013219815,0.000015731192],"about_ca_topic_score_codex":0.0039260443,"about_ca_topic_score_gemma":0.004388868,"teacher_disagreement_score":0.01485447,"about_ca_system_score_codex":0.0014072981,"about_ca_system_score_gemma":0.0011814975,"threshold_uncertainty_score":0.049693108},"labels":[],"label_agreement":null},{"id":"W1541367332","doi":"10.1007/978-3-642-21043-3_15","title":"Exploiting Conversational Features to Detect High-Quality Blog Comments","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 British Columbia","funders":"","keywords":"CRFS; Computer science; Conditional random field; Quality (philosophy); Natural language processing; Artificial intelligence; Moderation; Social media; Binary number; Information retrieval; Machine learning; World Wide Web; Mathematics","score_opus":0.04797135374995147,"score_gpt":0.27760490326209586,"score_spread":0.22963354951214437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541367332","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.9070769,0.003561719,0.06817628,0.00066400407,0.00077045953,0.00028953326,0.0061085112,0.0032210718,0.010131649],"genre_scores_gemma":[0.9643561,0.0005649018,0.024344295,0.00009033568,0.000681986,0.00014534133,0.0042343703,0.00020647951,0.005376248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.00019554807,0.0000619813,0.00017000888,0.00033104597,0.00014217541],"domain_scores_gemma":[0.9945998,0.0032389557,0.00057239784,0.00023304905,0.0010087995,0.0003469761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020322,0.0006147478,0.00056873146,0.0041358904,0.0007759202,0.0013764028,0.0004409729,0.0008470446,0.0022078918],"category_scores_gemma":[0.005670626,0.00030240664,0.00042728856,0.0020617368,0.00018836213,0.0011609697,0.0009341456,0.00088378746,0.0020935864],"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.0032433125,0.00086378295,0.10346387,0.0012840566,0.00040546086,0.0014086668,0.0027739685,0.0035541605,0.20954812,0.0015504723,0.032311343,0.6395928],"study_design_scores_gemma":[0.00022664567,0.0014032793,0.40605348,0.0002472934,0.0007249881,0.0030189694,0.004717023,0.4601492,0.07530383,0.0060768714,0.04180372,0.00027467392],"about_ca_topic_score_codex":0.001447572,"about_ca_topic_score_gemma":0.0040951152,"teacher_disagreement_score":0.0041358904,"about_ca_system_score_codex":0.0002623356,"about_ca_system_score_gemma":0.0003590863,"threshold_uncertainty_score":0.0073862076},"labels":[],"label_agreement":null},{"id":"W1541460014","doi":"10.1007/978-3-540-39592-8_89","title":"An Intelligent Agent for Automatic Course Adaptation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Java; Session (web analytics); Presentation (obstetrics); Course (navigation); XML; Adaptation (eye); Track (disk drive); Intelligent agent; JADE (particle detector); Domain (mathematical analysis); World Wide Web; Artificial intelligence; Programming language; Operating system","score_opus":0.03415600958079874,"score_gpt":0.3002941821605782,"score_spread":0.26613817257977945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541460014","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.0581872,0.00039850455,0.8914787,0.0006741749,0.00042795498,0.00033674014,0.00025586013,0.020290287,0.02795055],"genre_scores_gemma":[0.50943613,0.0002273025,0.45031393,0.00042764,0.00011656781,0.00032141083,0.0004730948,0.00054480747,0.038139116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997482,0.0000525736,0.000016193891,0.00006696122,0.00008827062,0.000027798214],"domain_scores_gemma":[0.9995639,0.00015583694,0.00003549052,0.00008921797,0.00009924718,0.000056280664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057298853,0.00035063107,0.0004548474,0.0004561554,0.00048293697,0.0009139381,0.0012450058,0.0010620342,0.005678108],"category_scores_gemma":[0.0020010048,0.00027283008,0.0003024499,0.0002962473,0.00029940275,0.0010456244,0.0011072583,0.00076702115,0.0019406463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009970561,0.001141547,0.0045585237,0.00021784865,0.00012767223,0.0005929063,0.0005637054,0.051953737,0.0632182,0.029318374,0.0381611,0.8091494],"study_design_scores_gemma":[0.00015910841,0.00019619199,0.0014290154,0.000025985924,0.00010986844,0.00030570163,0.00009007759,0.90302616,0.028085269,0.011822733,0.05470105,0.00004887388],"about_ca_topic_score_codex":0.0013489004,"about_ca_topic_score_gemma":0.0021629713,"teacher_disagreement_score":0.005678108,"about_ca_system_score_codex":0.00030297166,"about_ca_system_score_gemma":0.00043988385,"threshold_uncertainty_score":0.018995166},"labels":[],"label_agreement":null},{"id":"W1541525032","doi":"10.1007/11527695_25","title":"Fifty-Five Solvers in Vancouver: The SAT 2004 Competition","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":44,"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":"Competition (biology); Computer science; Event (particle physics); Operations research; Mathematics","score_opus":0.008528507595670216,"score_gpt":0.2171496943903909,"score_spread":0.20862118679472066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541525032","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.070868924,0.036514428,0.03433817,0.036141135,0.015331917,0.00081787107,0.037834227,0.019496948,0.74865645],"genre_scores_gemma":[0.15325542,0.015463269,0.04662611,0.0051254462,0.0017207243,0.00036818543,0.120411985,0.0077601746,0.6492687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786973,0.00046374914,0.00009934598,0.00030981927,0.0008205398,0.00043681773],"domain_scores_gemma":[0.99601847,0.000641796,0.00005485579,0.00029769432,0.0013457794,0.0016414496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00337921,0.0024355764,0.0019429409,0.0024645596,0.0037715866,0.007731009,0.0039872224,0.0025354768,0.10035459],"category_scores_gemma":[0.006014963,0.0012350908,0.0013151561,0.0071344716,0.0011101903,0.002063353,0.003431645,0.0032812892,0.04380924],"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.00023096486,0.00012514743,0.0005049109,0.00019480563,0.00004416714,0.000043653825,0.00006475497,0.002765623,0.00032253488,0.0028074973,0.9259867,0.06690921],"study_design_scores_gemma":[0.00053344667,0.00020105139,0.0039778044,0.00026487204,0.00006699729,0.00013080193,0.00052186375,0.01703787,0.0017344222,0.015626175,0.9598448,0.00005979418],"about_ca_topic_score_codex":0.089308105,"about_ca_topic_score_gemma":0.33792704,"teacher_disagreement_score":0.10035459,"about_ca_system_score_codex":0.006209523,"about_ca_system_score_gemma":0.009981299,"threshold_uncertainty_score":0.33571953},"labels":[],"label_agreement":null},{"id":"W1541540306","doi":"10.1007/978-3-642-33418-4_64","title":"A Convex Relaxation Approach to Fat/Water Separation with Minimum Label Description","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research","keywords":"Offset (computer science); Computer science; Minimum description length; Algorithm; Regular polygon; Homogeneity (statistics); Robustness (evolution); Limiting; Gradient descent; Mathematical optimization; Mathematics; Artificial intelligence; Artificial neural network; Machine learning; Geometry","score_opus":0.032190124902272556,"score_gpt":0.31506678166047863,"score_spread":0.28287665675820606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541540306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079553865,0.0001305643,0.99824846,0.00014110797,0.000022549817,0.000020739144,0.000042853615,0.00007674037,0.0005214733],"genre_scores_gemma":[0.05332444,0.0004932845,0.9365044,0.0002828548,0.00020048708,0.0002617237,0.00044348082,0.0005094364,0.007979923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985018,0.0006419445,0.00006485648,0.00026044104,0.00039437233,0.00013667905],"domain_scores_gemma":[0.9970391,0.0020506186,0.00016973633,0.0002175483,0.00037907425,0.00014399429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034132006,0.0021140007,0.0025995541,0.0013348248,0.0009008826,0.002385451,0.0048369234,0.003398535,0.005552818],"category_scores_gemma":[0.0064030383,0.0020899116,0.0022357863,0.0019537292,0.0017251488,0.0033331634,0.0041963975,0.0050847726,0.0014339098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029181872,0.00021601477,0.00022523353,0.00041050138,0.00015186526,0.0001669322,0.00016445812,0.7900261,0.0048753154,0.075413935,0.009979343,0.11807841],"study_design_scores_gemma":[0.000014172029,0.000022174376,0.000023049237,0.000010212102,0.00001010693,0.00001804651,0.000010385559,0.98279446,0.0005533282,0.015584397,0.0009491048,0.000010563665],"about_ca_topic_score_codex":0.007049258,"about_ca_topic_score_gemma":0.005059074,"teacher_disagreement_score":0.007049258,"about_ca_system_score_codex":0.001517252,"about_ca_system_score_gemma":0.0021237007,"threshold_uncertainty_score":0.018576086},"labels":[],"label_agreement":null},{"id":"W1541666628","doi":"10.1007/11496656_27","title":"Reducing the Size of NFAs by Using Equivalences and Preorders","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Computer science; Regular expression; Matching (statistics); DFA minimization; Deterministic automaton; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Automata theory; Programming language","score_opus":0.01572826700469847,"score_gpt":0.2468300156282682,"score_spread":0.23110174862356972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541666628","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.1751485,0.0012827555,0.7783728,0.0032613534,0.00055886665,0.00040263368,0.00094927935,0.011417636,0.028606167],"genre_scores_gemma":[0.52675563,0.0009964926,0.45258912,0.00076378125,0.00042354284,0.00046382193,0.0017698349,0.0035966067,0.012641229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938412,0.0017417592,0.0005812213,0.00096678804,0.0021357012,0.0007333252],"domain_scores_gemma":[0.945669,0.037100803,0.0013281181,0.012761838,0.0024249847,0.0007153054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030908803,0.0012582912,0.0020577514,0.001957982,0.0015447711,0.004228894,0.0037951407,0.001576344,0.014268636],"category_scores_gemma":[0.02439435,0.0014798414,0.0045245946,0.0018882675,0.0030493494,0.021912271,0.0051205726,0.004149336,0.0019446719],"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.0013709449,0.0008259616,0.004074445,0.0014808754,0.00022804042,0.00053149625,0.0013406386,0.08442533,0.046886202,0.32665238,0.015509887,0.5166738],"study_design_scores_gemma":[0.00023656905,0.00024287947,0.0008405365,0.00018376479,0.00029854008,0.0003784031,0.00048727938,0.18173948,0.027443433,0.76867,0.019377047,0.000101948135],"about_ca_topic_score_codex":0.002350994,"about_ca_topic_score_gemma":0.0046628513,"teacher_disagreement_score":0.014268636,"about_ca_system_score_codex":0.0027114244,"about_ca_system_score_gemma":0.0026077342,"threshold_uncertainty_score":0.047733366},"labels":[],"label_agreement":null},{"id":"W1541677343","doi":"10.1007/3-540-45984-7_18","title":"An Analysis of Koza’s Computational Effort Statistic for Genetic Programming","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":135,"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":"Genetic programming; Computer science; Statistic; Mathematics; Statistics; Artificial intelligence","score_opus":0.01695518108309615,"score_gpt":0.2714305306652515,"score_spread":0.2544753495821554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541677343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38907284,0.0013199776,0.59465176,0.0013203605,0.0001512442,0.00009998166,0.00043663132,0.001551849,0.011395322],"genre_scores_gemma":[0.91661435,0.00023966479,0.08083447,0.00016745218,0.000091698224,0.00008755373,0.0004307567,0.000429666,0.0011044869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511683,0.0026371437,0.00017405316,0.0006365652,0.0011447023,0.00029064532],"domain_scores_gemma":[0.79772645,0.18356955,0.004674427,0.008323759,0.0046250653,0.001080657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0126251215,0.00041298292,0.00080837705,0.0032084633,0.00061958586,0.0016962296,0.0017097017,0.0012718436,0.0029397027],"category_scores_gemma":[0.120527916,0.00029695284,0.0008314034,0.0037224072,0.0022128557,0.0024768584,0.0011116771,0.0021830322,0.00030486868],"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.0014962812,0.00040604034,0.08787451,0.00040881833,0.0006068365,0.0003081075,0.00089955865,0.2806075,0.008853121,0.33557427,0.00923137,0.2737336],"study_design_scores_gemma":[0.00008717108,0.00042459834,0.031616222,0.0000752816,0.00014569312,0.00028638315,0.00028995643,0.860624,0.003959606,0.09940823,0.0030084108,0.0000744761],"about_ca_topic_score_codex":0.0015612496,"about_ca_topic_score_gemma":0.0013723628,"teacher_disagreement_score":0.0126251215,"about_ca_system_score_codex":0.0011574213,"about_ca_system_score_gemma":0.0013338646,"threshold_uncertainty_score":0.066768885},"labels":[],"label_agreement":null},{"id":"W1541719409","doi":"10.1007/3-540-45372-5_47","title":"Applying Objective Interestingness Measures in Data Mining Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":45,"is_retracted":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":"Ranking (information retrieval); Spurious relationship; Computer science; Data mining; Independence (probability theory); Interpretation (philosophy); Association rule learning; Process (computing); Task (project management); Focus (optics); Artificial intelligence; Machine learning; Statistics; Mathematics; Engineering","score_opus":0.05861183514258421,"score_gpt":0.2854879178597035,"score_spread":0.2268760827171193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541719409","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.036613703,0.0007902197,0.9603657,0.00018672594,0.00005156777,0.00009404279,0.00013049864,0.00035012118,0.001417388],"genre_scores_gemma":[0.47663903,0.00060172274,0.5201772,0.00010532255,0.00020865125,0.0002628612,0.000371704,0.00015748366,0.0014759955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99321634,0.0022450637,0.00077072415,0.0007578857,0.0028255524,0.00018445993],"domain_scores_gemma":[0.9750378,0.018397061,0.0016171673,0.001975959,0.0025663672,0.0004057188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008295556,0.00086909655,0.0012931764,0.0044105677,0.00051638327,0.002918783,0.0015024737,0.0007265156,0.0014987263],"category_scores_gemma":[0.034176923,0.00052489724,0.0009811546,0.0032759847,0.0011967021,0.0053236564,0.0021359771,0.0014669724,0.00027664754],"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.0006258833,0.0004785131,0.016456319,0.0009374587,0.00051923486,0.00021060371,0.0004144131,0.14339149,0.011217751,0.12892826,0.0027854003,0.69403464],"study_design_scores_gemma":[0.000039828232,0.00030773043,0.0025195084,0.000071060844,0.00012757888,0.00018892286,0.00009530136,0.8218705,0.010850619,0.1614828,0.0024066826,0.000039451523],"about_ca_topic_score_codex":0.00034420006,"about_ca_topic_score_gemma":0.00057775876,"teacher_disagreement_score":0.008295556,"about_ca_system_score_codex":0.0009890547,"about_ca_system_score_gemma":0.0007802121,"threshold_uncertainty_score":0.04387158},"labels":[],"label_agreement":null},{"id":"W1541872440","doi":"10.1007/3-540-45477-2_9","title":"On the Relationship between Clique-Width and Treewidth","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Toronto","funders":"","keywords":"Treewidth; Combinatorics; Clique-width; Clique-sum; Partial k-tree; Mathematics; Discrete mathematics; Bounded function; Graph; Tree decomposition; Tree-depth; Chordal graph; Pathwidth; 1-planar graph; Line graph; Voltage graph","score_opus":0.05768015266796828,"score_gpt":0.3089462622550377,"score_spread":0.2512661095870694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541872440","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.22718923,0.046741396,0.574825,0.01707441,0.0016208316,0.00014468389,0.0020223379,0.0011606651,0.12922142],"genre_scores_gemma":[0.7992841,0.026474278,0.14863974,0.002636655,0.005430284,0.00035040273,0.0015620093,0.0012723398,0.014350169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682534,0.0009988496,0.00016589442,0.000875991,0.00077679736,0.00035713243],"domain_scores_gemma":[0.84239835,0.14501484,0.0047097015,0.0037661463,0.002503351,0.0016076324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060912045,0.0015443263,0.002503444,0.0040344144,0.0021095353,0.0050683594,0.005139445,0.0032695683,0.011432278],"category_scores_gemma":[0.06462514,0.002399851,0.0012906584,0.009230099,0.0071553085,0.026752647,0.004443266,0.009148945,0.0017739006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004225968,0.00019413755,0.0058805584,0.00064137933,0.00015030688,0.00019285138,0.00085837906,0.028774379,0.0024822617,0.870625,0.014067873,0.07571024],"study_design_scores_gemma":[0.000031957126,0.000041699906,0.0015613385,0.00011195396,0.00006915106,0.00024838428,0.00011183039,0.03553177,0.00044105857,0.9590921,0.0027154218,0.000043385695],"about_ca_topic_score_codex":0.0027522093,"about_ca_topic_score_gemma":0.0033863236,"teacher_disagreement_score":0.011432278,"about_ca_system_score_codex":0.0024822517,"about_ca_system_score_gemma":0.0010873718,"threshold_uncertainty_score":0.038244843},"labels":[],"label_agreement":null},{"id":"W1541873744","doi":"10.1007/978-3-540-30566-8_112","title":"SuperPAS: A Parallel Architectural Skeleton Model Supporting Extensibility and Skeleton Composition","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Concordia University","funders":"","keywords":"Computer science; Extensibility; Generic programming; Parallel programming model; Programming language; Programming paradigm; Skeleton (computer programming); Reusability; Reuse; Parallelism (grammar); Parallel computing; Software","score_opus":0.01573851452064644,"score_gpt":0.25297211544091275,"score_spread":0.2372336009202663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541873744","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.005565011,0.000083385814,0.9798686,0.000075701675,0.000053583197,0.00008957653,0.00016633632,0.009741819,0.0043559987],"genre_scores_gemma":[0.110923395,0.00040749452,0.8677244,0.00015663891,0.00005126452,0.00034630523,0.0014973568,0.003277402,0.015615836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.00008266412,0.000073197945,0.00012353374,0.00027456076,0.00006238018],"domain_scores_gemma":[0.9990313,0.00017418113,0.00007335261,0.00048551476,0.00015371034,0.000081918275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010048245,0.00097575434,0.0006439559,0.0008917472,0.0007236649,0.001987898,0.002782408,0.0012546172,0.0086965235],"category_scores_gemma":[0.0022396222,0.0013859721,0.0014052236,0.0008966753,0.0011625638,0.0039185705,0.0026903972,0.0019986806,0.0029272775],"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.0007144695,0.00032497093,0.00179504,0.00068844395,0.00015102712,0.0007530134,0.00081431115,0.14322804,0.05369962,0.35923338,0.028427448,0.4101702],"study_design_scores_gemma":[0.00013953201,0.00015659635,0.0003587621,0.000110051384,0.00017256608,0.0006617772,0.00010821777,0.6744215,0.029901477,0.17819633,0.11569851,0.000074775904],"about_ca_topic_score_codex":0.0016675489,"about_ca_topic_score_gemma":0.0034483038,"teacher_disagreement_score":0.0086965235,"about_ca_system_score_codex":0.00051596604,"about_ca_system_score_gemma":0.0010428494,"threshold_uncertainty_score":0.029092789},"labels":[],"label_agreement":null},{"id":"W1541898677","doi":"10.1007/978-3-540-87734-9_43","title":"Image Denoising Using Three Scales of Wavelet Coefficients","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Concordia University","funders":"","keywords":"Complex wavelet transform; Wavelet; Noise reduction; Computer science; Non-local means; Artificial intelligence; Image denoising; Pattern recognition (psychology); Additive white Gaussian noise; Video denoising; Wavelet transform; Image (mathematics); White noise; Tree (set theory); Noise (video); Computer vision; Mathematics; Discrete wavelet transform; Video processing; Telecommunications","score_opus":0.032597463091270415,"score_gpt":0.2821404873219925,"score_spread":0.24954302423072205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541898677","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.07339532,0.0014720577,0.9110587,0.00019267622,0.00027460261,0.00005957849,0.000110069275,0.0005340457,0.0129029155],"genre_scores_gemma":[0.3817966,0.0028773036,0.60140157,0.0001410503,0.00015801555,0.000051417293,0.00023297504,0.00038358013,0.012957459],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998336,0.000019391973,0.000008825379,0.000027463053,0.00008851649,0.000022194132],"domain_scores_gemma":[0.99967813,0.00008886632,0.000023764413,0.00006691708,0.00010966358,0.000032787164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042785244,0.0004973095,0.0003746372,0.0005593747,0.00018612777,0.00085642765,0.00030359766,0.0005359269,0.0025815929],"category_scores_gemma":[0.0009631458,0.00020414844,0.00063001673,0.00088351796,0.00046933966,0.000613676,0.0004082036,0.0007787491,0.0008839428],"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.00050147495,0.00010112866,0.0011524648,0.00038125468,0.000087731896,0.00019698513,0.0002471765,0.013151383,0.49955878,0.042622034,0.0035862303,0.43841335],"study_design_scores_gemma":[0.00008672736,0.0005165816,0.0145256035,0.00014237815,0.00039291268,0.0015053733,0.00024044889,0.43216383,0.47449636,0.03373101,0.04206314,0.00013558727],"about_ca_topic_score_codex":0.00035623123,"about_ca_topic_score_gemma":0.00050690817,"teacher_disagreement_score":0.0025815929,"about_ca_system_score_codex":0.00017928368,"about_ca_system_score_gemma":0.0002089052,"threshold_uncertainty_score":0.008636296},"labels":[],"label_agreement":null},{"id":"W1541914436","doi":"10.1007/11766247_24","title":"Unsupervised Labeling of Noun Clusters","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Noun; Linguistics; Natural language processing; Computer science; Artificial intelligence; Psychology; Philosophy","score_opus":0.011750333482289908,"score_gpt":0.24511323993200274,"score_spread":0.23336290644971283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541914436","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.047419436,0.0014887975,0.91338754,0.00071045425,0.00031602272,0.00043944333,0.009447435,0.009752653,0.017038194],"genre_scores_gemma":[0.15377787,0.00087220105,0.78746516,0.0002552151,0.0001776527,0.00040405893,0.0350044,0.0018172112,0.020226283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981305,0.0003515143,0.00013003754,0.00076520693,0.00045410293,0.00016865865],"domain_scores_gemma":[0.99684614,0.0010240957,0.00021478979,0.0006696833,0.0010585167,0.00018677604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009603052,0.0011237138,0.001084336,0.0046832273,0.0024689988,0.0028919824,0.0028494124,0.0014618913,0.008302478],"category_scores_gemma":[0.0041133757,0.0008789808,0.0016250506,0.0053390176,0.0010479849,0.002578897,0.002185933,0.0017618538,0.007143953],"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.00064598257,0.00031289225,0.006376507,0.0007440399,0.00019349209,0.00042152908,0.00077517354,0.010537233,0.04800297,0.032601938,0.058095977,0.8412922],"study_design_scores_gemma":[0.00016479497,0.00020680153,0.012623809,0.0003908841,0.00032074982,0.001447596,0.0016095311,0.60539305,0.07119524,0.16357896,0.14290395,0.00016469158],"about_ca_topic_score_codex":0.009747641,"about_ca_topic_score_gemma":0.032163903,"teacher_disagreement_score":0.009747641,"about_ca_system_score_codex":0.0015996028,"about_ca_system_score_gemma":0.0032595138,"threshold_uncertainty_score":0.027774572},"labels":[],"label_agreement":null},{"id":"W1542059531","doi":"10.1007/11814948_29","title":"Efficiency of Local Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Local search (optimization); Heuristic; Constant (computer programming); Guided Local Search; Computer science; Search problem; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.01910925632822527,"score_gpt":0.2489409918068747,"score_spread":0.22983173547864943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542059531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16488507,0.0049105724,0.6566375,0.0035586406,0.00028351846,0.00026795082,0.0015811566,0.0032912546,0.16458446],"genre_scores_gemma":[0.8557815,0.0017473587,0.103193425,0.00040812758,0.0003203925,0.00038054754,0.0012365738,0.00153712,0.035394933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466985,0.0021479651,0.00016797711,0.0007614732,0.0015036945,0.00074901845],"domain_scores_gemma":[0.97082597,0.019978656,0.0007313969,0.006384659,0.0013909932,0.00068828993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039818957,0.0008899583,0.002382278,0.0021449672,0.0012676911,0.0045416555,0.0041889935,0.0023650955,0.028512549],"category_scores_gemma":[0.031570695,0.0007678007,0.0013497338,0.0033697034,0.0022624044,0.007952574,0.003131312,0.0025308416,0.005835273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016109005,0.0003534893,0.002483446,0.000653202,0.000183756,0.00015994419,0.0004077254,0.21835847,0.0094068125,0.53315574,0.028261904,0.20496458],"study_design_scores_gemma":[0.00014308839,0.00013494481,0.0009055754,0.00007043664,0.00013038861,0.0002881976,0.00011605821,0.6098064,0.007591153,0.37500226,0.005774359,0.000037051508],"about_ca_topic_score_codex":0.0016242608,"about_ca_topic_score_gemma":0.0021968882,"teacher_disagreement_score":0.028512549,"about_ca_system_score_codex":0.003182709,"about_ca_system_score_gemma":0.0032403634,"threshold_uncertainty_score":0.09538394},"labels":[],"label_agreement":null},{"id":"W1542066058","doi":"10.1007/3-540-45151-x_40","title":"Rough Set Based WebCT Learning","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Set (abstract data type); Computer science; Mathematics education; Focus (optics); Multimedia; World Wide Web; Psychology","score_opus":0.019913524857273112,"score_gpt":0.23799478809356514,"score_spread":0.21808126323629204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542066058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013123994,0.0005234118,0.9779708,0.00013172213,0.00006698303,0.000067506,0.00014966723,0.0009395105,0.0070264526],"genre_scores_gemma":[0.44832203,0.0011482692,0.5291063,0.00018969437,0.00014355479,0.00029191404,0.00106963,0.0002377215,0.019490903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924064,0.00020084305,0.000048200443,0.000105914696,0.00034050673,0.00006384133],"domain_scores_gemma":[0.99878997,0.0005893877,0.000051756277,0.00022308946,0.00029264993,0.000053107076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009805145,0.0003523472,0.0013661615,0.0015222975,0.000470032,0.0016293034,0.0013851764,0.0009988638,0.009658588],"category_scores_gemma":[0.0028809633,0.0002895595,0.00088505354,0.001538744,0.00048242163,0.0025621012,0.0015021954,0.0013286365,0.0017455668],"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.00019317678,0.00018235897,0.0005759586,0.00011010807,0.000062729974,0.000074290496,0.00005655001,0.2351837,0.0018867134,0.034579746,0.005922049,0.72117263],"study_design_scores_gemma":[0.000014218518,0.000052660806,0.00029673713,0.000019782618,0.000017939796,0.000050836672,0.000015772663,0.9707399,0.0021216313,0.023831556,0.0028252224,0.000013747313],"about_ca_topic_score_codex":0.002550289,"about_ca_topic_score_gemma":0.0022921371,"teacher_disagreement_score":0.009658588,"about_ca_system_score_codex":0.00072635396,"about_ca_system_score_gemma":0.0007654068,"threshold_uncertainty_score":0.03231114},"labels":[],"label_agreement":null},{"id":"W1542080112","doi":"10.1007/11841760_19","title":"E-Service/Process Composition Through Multi-agent Constraint Management","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Windsor","funders":"","keywords":"Computer science; Service (business); Process (computing); Service composition; Service provider; Service delivery framework; Process management; Constraint (computer-aided design); Component (thermodynamics); Composition (language); Set (abstract data type); Distributed computing; Operations research; Web service; World Wide Web; Business","score_opus":0.016201767776133878,"score_gpt":0.2528554501020519,"score_spread":0.23665368232591802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542080112","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.005434049,0.00009916261,0.9840379,0.00011163525,0.000035363348,0.00016089554,0.00003848978,0.0009511093,0.009131472],"genre_scores_gemma":[0.09675167,0.00024219349,0.8926029,0.00008146407,0.00003165564,0.0003119295,0.00020858183,0.00032190856,0.009447737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981956,0.00042985537,0.00017609527,0.00027714722,0.0007781111,0.00014317018],"domain_scores_gemma":[0.99856216,0.00071148283,0.00011493027,0.00026871052,0.0002478626,0.00009495244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022654126,0.0008453231,0.0010649987,0.0010948016,0.0015581851,0.0027826102,0.0022491587,0.001323393,0.0076356237],"category_scores_gemma":[0.004010857,0.0008883198,0.0011257747,0.0019306496,0.0010814772,0.0030727321,0.0029372787,0.0017411156,0.0018471235],"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.00031971125,0.00053721206,0.0007813751,0.0005774649,0.00019175347,0.0011684105,0.0008268639,0.23086753,0.046702515,0.32250372,0.0064308257,0.38909268],"study_design_scores_gemma":[0.00007266434,0.000033635413,0.00016267916,0.000048251182,0.000065529544,0.00023063783,0.00009933762,0.8611185,0.033416852,0.07751911,0.027190726,0.000042043226],"about_ca_topic_score_codex":0.004438038,"about_ca_topic_score_gemma":0.0062518264,"teacher_disagreement_score":0.0076356237,"about_ca_system_score_codex":0.00093671825,"about_ca_system_score_gemma":0.0022322023,"threshold_uncertainty_score":0.02554369},"labels":[],"label_agreement":null},{"id":"W1542132029","doi":"10.1007/978-3-540-30587-3_30","title":"Managing Dependencies Between Software Products","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Software deployment; Software; Software engineering; Context (archaeology); Software system; Process (computing); Distributed computing; Programming language","score_opus":0.039508203550401744,"score_gpt":0.274151817127704,"score_spread":0.23464361357730223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542132029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25882208,0.0014915332,0.694968,0.0008106372,0.00017578654,0.00022877549,0.0004452433,0.005265604,0.037792478],"genre_scores_gemma":[0.62272,0.0014433549,0.33767915,0.00017362958,0.00011578573,0.00014946795,0.001966516,0.0015592179,0.034192752],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880445,0.00020829875,0.00008039252,0.0002102789,0.00052738725,0.00016919845],"domain_scores_gemma":[0.99392253,0.0032737625,0.0006134984,0.0013354345,0.0005744764,0.0002802507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015059679,0.0006875166,0.00046643396,0.0017138704,0.00096122245,0.0016917299,0.0015601098,0.00068275206,0.005204638],"category_scores_gemma":[0.008146264,0.0010915415,0.0006268349,0.001447326,0.0004977095,0.004628303,0.0024847207,0.0016070565,0.0014126383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036188826,0.0004304121,0.009463573,0.00055194524,0.00010477203,0.0011168012,0.0014464835,0.04575504,0.0336658,0.056888178,0.015292992,0.8349222],"study_design_scores_gemma":[0.00011933624,0.00068365125,0.013915703,0.0005019684,0.0005157128,0.0023062949,0.0010047256,0.49706635,0.08116641,0.24989201,0.15267393,0.00015390944],"about_ca_topic_score_codex":0.0019590522,"about_ca_topic_score_gemma":0.00335122,"teacher_disagreement_score":0.005204638,"about_ca_system_score_codex":0.00065802137,"about_ca_system_score_gemma":0.0013077143,"threshold_uncertainty_score":0.017411292},"labels":[],"label_agreement":null},{"id":"W1542186358","doi":"10.1007/978-3-540-45080-1_19","title":"Learning from Average Experience","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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":"Queen's University","funders":"","keywords":"Outcome (game theory); Computer science; Stochastic game; Class (philosophy); Oligopoly; Artificial intelligence; Microeconomics; Economics; Cournot competition","score_opus":0.062307684646932274,"score_gpt":0.3294645827433816,"score_spread":0.2671568980964493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542186358","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.081980295,0.0013192073,0.117271036,0.005544005,0.00041191193,0.00006914354,0.00022271987,0.00063895533,0.7925427],"genre_scores_gemma":[0.8235404,0.0013196362,0.02779483,0.0009653127,0.000189149,0.00010431822,0.00050753733,0.00017189082,0.1454069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995148,0.0001408754,0.000016600816,0.00012030858,0.00014722644,0.00006016516],"domain_scores_gemma":[0.99846077,0.0006423437,0.00007437215,0.00036390434,0.00018745934,0.00027110885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008830101,0.00034740573,0.00034720823,0.0003889637,0.0007191446,0.002431299,0.00084828807,0.0006005352,0.029097203],"category_scores_gemma":[0.005936695,0.00018723296,0.000378123,0.0004311822,0.0014333179,0.0065860553,0.0024734712,0.0016893712,0.004559651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009521744,0.0002063655,0.0025723337,0.00014637447,0.000028088623,0.00010329173,0.0031202943,0.0024325768,0.0010718456,0.556831,0.03574599,0.3976466],"study_design_scores_gemma":[0.000015147606,0.000120880126,0.002167709,0.00009362983,0.00001645724,0.00019365782,0.0013652878,0.0041939975,0.0010708283,0.91451675,0.0762256,0.000020041041],"about_ca_topic_score_codex":0.0005954385,"about_ca_topic_score_gemma":0.0010390462,"teacher_disagreement_score":0.029097203,"about_ca_system_score_codex":0.0005172764,"about_ca_system_score_gemma":0.000638504,"threshold_uncertainty_score":0.09733981},"labels":[],"label_agreement":null},{"id":"W1542192939","doi":"10.1007/3-540-45311-3_20","title":"Cryptanalysis of Imai and Matsumoto Scheme B Asymmetric Cryptosystem","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Cryptanalysis; Public-key cryptography; Ciphertext; Computer science; Encryption; Scheme (mathematics); Theoretical computer science; Key (lock); Hybrid cryptosystem; Simple (philosophy); Cryptography; Mathematics; Algorithm; Computer security","score_opus":0.012103994265801641,"score_gpt":0.227014010747114,"score_spread":0.21491001648131236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542192939","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.60294634,0.0024390128,0.31200108,0.001984178,0.0004943508,0.00028161283,0.00025300126,0.000750071,0.07885034],"genre_scores_gemma":[0.95404375,0.0005873604,0.03297824,0.000106287116,0.000097310076,0.00005732945,0.00011811757,0.000045684883,0.011965822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948114,0.000096431315,0.000026110516,0.0000575855,0.00024493647,0.00009385539],"domain_scores_gemma":[0.99976856,0.00006535397,0.000028193333,0.000071194605,0.00004309454,0.000023488015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324559,0.00038778948,0.00052644545,0.0006697742,0.0008915858,0.00069827127,0.0005149215,0.0007900372,0.0028940523],"category_scores_gemma":[0.00074404845,0.00023558868,0.00045938694,0.00076550996,0.0006342164,0.0011470984,0.00080867246,0.0009482779,0.00053745747],"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.0020912616,0.00028716016,0.0038483872,0.00042973747,0.00015348749,0.0028725564,0.0009829493,0.020229686,0.17254911,0.6222072,0.011612689,0.16273582],"study_design_scores_gemma":[0.00058547984,0.0009085181,0.007223775,0.00016632752,0.00029244137,0.0078178495,0.0003642523,0.27505213,0.32055014,0.32910204,0.0577172,0.00021980394],"about_ca_topic_score_codex":0.00023903324,"about_ca_topic_score_gemma":0.00023072859,"teacher_disagreement_score":0.0028940523,"about_ca_system_score_codex":0.0005001535,"about_ca_system_score_gemma":0.00055364944,"threshold_uncertainty_score":0.009681523},"labels":[],"label_agreement":null},{"id":"W1542194017","doi":"10.1007/3-540-44886-1_18","title":"Case Authoring from Text and Historical Experiences","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; National Research Council Canada","funders":"","keywords":"Technician; Computer science; Documentation; Domain (mathematical analysis); Technical documentation; Knowledge base; Task (project management); Software engineering; Reflection (computer programming); Truck; Engineering; Artificial intelligence; Systems engineering; Programming language","score_opus":0.031170056518140796,"score_gpt":0.23836123312984148,"score_spread":0.20719117661170067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542194017","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12434324,0.002399423,0.38487118,0.004594392,0.001069149,0.0009912682,0.005058364,0.0036587338,0.47301415],"genre_scores_gemma":[0.53953993,0.0035255183,0.3552813,0.00022386285,0.00039558008,0.0005900853,0.007731829,0.0017994707,0.090912536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822766,0.0008199219,0.00016373294,0.00021284026,0.00050475687,0.00007103324],"domain_scores_gemma":[0.9746562,0.021107433,0.00062859576,0.0017909999,0.0015044905,0.0003122795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029289953,0.0005804786,0.00026490403,0.006356983,0.001503968,0.0042109466,0.001549754,0.0010224753,0.036185183],"category_scores_gemma":[0.026708564,0.00037229576,0.00028852062,0.004790111,0.0014624824,0.0062743574,0.0020321182,0.0009275122,0.0058247265],"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.00023132782,0.0001876164,0.0039716368,0.0008332903,0.000014569481,0.00477889,0.04340236,0.004976368,0.004398965,0.10526069,0.054425877,0.7775184],"study_design_scores_gemma":[0.000054838805,0.0000793476,0.003732547,0.0015407295,0.000039502338,0.006236966,0.031655096,0.022530891,0.010934436,0.14048764,0.78261805,0.00008993095],"about_ca_topic_score_codex":0.0005892742,"about_ca_topic_score_gemma":0.0024838087,"teacher_disagreement_score":0.036185183,"about_ca_system_score_codex":0.0012229257,"about_ca_system_score_gemma":0.00088167086,"threshold_uncertainty_score":0.12105149},"labels":[],"label_agreement":null},{"id":"W1542204591","doi":"10.1007/978-3-540-27868-9_107","title":"Multiple Classifier Prediction Improvements against Imbalanced Datasets through Added Synthetic Examples","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Boosting (machine learning); Computer science; Machine learning; Benchmarking; Classifier (UML); Artificial intelligence; Training set; Ensemble learning; Data mining; Pattern recognition (psychology)","score_opus":0.02694847425055517,"score_gpt":0.2593697036325736,"score_spread":0.23242122938201845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542204591","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.780023,0.0032631706,0.18980837,0.0022616182,0.00181057,0.00033739192,0.0035818978,0.007648366,0.01126565],"genre_scores_gemma":[0.85304785,0.0005255347,0.13260877,0.00033395173,0.00031717453,0.00019806129,0.0059386245,0.0005068914,0.0065231393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551195,0.0016419016,0.00029999216,0.0009972987,0.0013603523,0.00018843361],"domain_scores_gemma":[0.9766767,0.013255163,0.0006400551,0.00422439,0.004798109,0.00040558475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005568882,0.0017727467,0.0011535739,0.0017218008,0.00081004144,0.0015374888,0.0014338605,0.0018983227,0.0017145297],"category_scores_gemma":[0.024312004,0.00050379516,0.00084344647,0.0014277073,0.0004922581,0.0028250404,0.0014200966,0.0021660042,0.0015529054],"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.0016717406,0.0012150868,0.015903387,0.00034177903,0.00038491306,0.00056241953,0.00028555238,0.34388193,0.014782467,0.001630347,0.037159353,0.5821809],"study_design_scores_gemma":[0.00005293853,0.00027676055,0.0020954066,0.000025781928,0.00009273376,0.0001568243,0.000067389046,0.98028725,0.01257133,0.0018867886,0.002461327,0.000025466305],"about_ca_topic_score_codex":0.0027198507,"about_ca_topic_score_gemma":0.0044481535,"teacher_disagreement_score":0.005568882,"about_ca_system_score_codex":0.00081894983,"about_ca_system_score_gemma":0.00060483447,"threshold_uncertainty_score":0.02945137},"labels":[],"label_agreement":null},{"id":"W1542279835","doi":"10.1007/978-3-540-70960-2_8","title":"Maintaining Semantic Mappings between Database Schemas and Ontologies","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Computer science; Information retrieval; Semantic integration; Schema (genetic algorithms); Sketch; Database schema; Ontology; Semantic heterogeneity; Ontology-based data integration; Semantic computing; Semantic Web; Database design; Algorithm","score_opus":0.0366972020552323,"score_gpt":0.2597780757655047,"score_spread":0.2230808737102724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542279835","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.027982147,0.0007225549,0.9530458,0.00087643287,0.00029272394,0.00020315028,0.0013743836,0.009936833,0.005566074],"genre_scores_gemma":[0.16382751,0.0019830088,0.8119133,0.0005723694,0.0001423538,0.00024290204,0.010337336,0.0038589844,0.0071223006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99375373,0.0013084855,0.0011394152,0.0011704339,0.0023298485,0.0002981214],"domain_scores_gemma":[0.9821774,0.007008,0.0007977653,0.0070777717,0.0026644063,0.00027464915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096366145,0.0009588539,0.0015874449,0.0047257603,0.0017040719,0.009555477,0.004505081,0.0019353192,0.0036122939],"category_scores_gemma":[0.03459373,0.0022517925,0.0020360113,0.00818518,0.0015642911,0.023462718,0.00806945,0.0028225537,0.002388236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033635975,0.00041111445,0.0077351085,0.0012014323,0.0005217801,0.0010029654,0.0042813476,0.023606362,0.018530626,0.31577647,0.03410217,0.59249425],"study_design_scores_gemma":[0.000116803,0.00011646542,0.0025310242,0.0007036962,0.0010349954,0.0013243691,0.003251127,0.20843059,0.10542758,0.50857085,0.16827765,0.0002147834],"about_ca_topic_score_codex":0.0043033804,"about_ca_topic_score_gemma":0.0048062387,"teacher_disagreement_score":0.0096366145,"about_ca_system_score_codex":0.0015334535,"about_ca_system_score_gemma":0.0037319986,"threshold_uncertainty_score":0.05096388},"labels":[],"label_agreement":null},{"id":"W1542295728","doi":"10.1007/11428862_19","title":"Modelling Dynamics of Genetic Networks as a Multiscale Process","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Process (computing); Task (project management); Nonlinear system; Dynamics (music); Key (lock); Phenomenon; Genetic algorithm; Artificial intelligence; Machine learning; Systems engineering","score_opus":0.007310036151212782,"score_gpt":0.2275702097607649,"score_spread":0.2202601736095521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542295728","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.10109716,0.00067488296,0.8878877,0.0009874707,0.000091942864,0.000043619973,0.00012097804,0.0003236358,0.00877266],"genre_scores_gemma":[0.89432544,0.0010554387,0.096770614,0.00012208668,0.00014825768,0.0001606459,0.000120741686,0.00015125248,0.0071454654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997693,0.000085172374,0.000011904893,0.000054637672,0.00005409416,0.000024932044],"domain_scores_gemma":[0.9989272,0.00076467084,0.00012248929,0.00006270548,0.0000456542,0.00007725207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005664825,0.00064682745,0.00082444324,0.0006058086,0.00038445496,0.0014590208,0.0015273351,0.0020120342,0.0021839733],"category_scores_gemma":[0.0029920707,0.00073494366,0.0011865648,0.0006102473,0.0016127748,0.002001778,0.0013428752,0.0012555759,0.0002754277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001270245,0.000014871416,0.00029452302,0.000027264643,0.000023245302,0.000057202225,0.00005394735,0.92554975,0.001853681,0.06967724,0.00019049161,0.0022450793],"study_design_scores_gemma":[0.0000036905435,0.0000038097824,0.000041484185,0.0000018346951,0.000004033857,0.000007559913,0.0000036698539,0.97821224,0.000086150576,0.021449741,0.0001825473,0.0000032289695],"about_ca_topic_score_codex":0.0049634906,"about_ca_topic_score_gemma":0.003643765,"teacher_disagreement_score":0.0049634906,"about_ca_system_score_codex":0.0009346063,"about_ca_system_score_gemma":0.00055786385,"threshold_uncertainty_score":0.009869218},"labels":[],"label_agreement":null},{"id":"W1542312740","doi":"10.1007/11581062_34","title":"Towards the Automation of E-Negotiation Processes Based on Web Services – A Modeling Approach","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":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":"Negotiation; Computer science; Web service; Software engineering; Formalism (music); Knowledge management; Automation; Business process; Protocol (science); World Wide Web; Process management; Engineering; Work in process","score_opus":0.02188425268523489,"score_gpt":0.2218165237128154,"score_spread":0.19993227102758052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542312740","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.007898395,0.00023002108,0.9861661,0.00021590725,0.000024249432,0.00008078705,0.000044936904,0.0011959713,0.004143666],"genre_scores_gemma":[0.26783365,0.0009803361,0.7261563,0.0001042951,0.000040942534,0.00020151238,0.00034876977,0.00035039015,0.003983868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758506,0.00078164315,0.00019403973,0.0003598505,0.0008880212,0.00019142553],"domain_scores_gemma":[0.9979651,0.0009526785,0.00020281879,0.000519476,0.00029556488,0.00006444372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002292003,0.000808852,0.0009024892,0.0009870807,0.00084875297,0.004328745,0.0026183485,0.0018353715,0.0024999517],"category_scores_gemma":[0.0040565487,0.0015038599,0.0020986153,0.0014380374,0.0013359676,0.0050448207,0.0018740864,0.0025487975,0.0009090806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019302688,0.00033302073,0.0016615599,0.00044854783,0.0001902192,0.00038733214,0.0010643916,0.44147024,0.015963195,0.37819803,0.00240006,0.15769036],"study_design_scores_gemma":[0.00001675516,0.000021895821,0.00019833598,0.00003832369,0.000035920017,0.00006801674,0.000048233305,0.9207768,0.0056260508,0.06589727,0.0072554797,0.000016920232],"about_ca_topic_score_codex":0.0075954064,"about_ca_topic_score_gemma":0.0050243954,"teacher_disagreement_score":0.0075954064,"about_ca_system_score_codex":0.0011773243,"about_ca_system_score_gemma":0.0029088473,"threshold_uncertainty_score":0.015102446},"labels":[],"label_agreement":null},{"id":"W154235046","doi":"10.1007/978-3-319-11653-2_5","title":"Streaming Model Transformations By Complex Event Processing","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Montréal; McGill University","funders":"","keywords":"Computer science; Complex event processing; Streaming data; Event (particle physics); Model transformation; Transformation (genetics); Class (philosophy); Context (archaeology); Process (computing); Stream processing; Data mining; Data stream; Theoretical computer science; Artificial intelligence; Distributed computing; Programming language","score_opus":0.03245666733986978,"score_gpt":0.26579769877965315,"score_spread":0.23334103143978335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154235046","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.002360701,0.00004671824,0.9956404,0.000034083023,0.000022765134,0.000015926917,0.000090655274,0.0009967898,0.00079192594],"genre_scores_gemma":[0.29462567,0.00043353977,0.69132847,0.000084710904,0.000099907935,0.00016400026,0.0018627668,0.0010209451,0.010379968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996817,0.000061552186,0.000023695202,0.00009913685,0.00010765936,0.000026296271],"domain_scores_gemma":[0.9993437,0.00030166883,0.00003658751,0.00021144967,0.00008520532,0.000021399268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047181483,0.0006814909,0.0006253437,0.0004153536,0.00022442857,0.0008301012,0.0009367763,0.00042437963,0.006256372],"category_scores_gemma":[0.0020054106,0.00046037437,0.0008648632,0.0006910266,0.00037256008,0.0016485378,0.0010293267,0.001373006,0.0018491995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022817637,0.00009733399,0.0004368101,0.00014195559,0.00007618485,0.0001919317,0.00012856483,0.47170508,0.017909633,0.11749566,0.007555436,0.38403323],"study_design_scores_gemma":[0.0000053882213,0.000011364117,0.000052489493,0.0000025710656,0.0000053894905,0.000029768635,0.000006958136,0.95269185,0.0029969884,0.04181389,0.002378665,0.000004674707],"about_ca_topic_score_codex":0.00255241,"about_ca_topic_score_gemma":0.0023400523,"teacher_disagreement_score":0.006256372,"about_ca_system_score_codex":0.00043634773,"about_ca_system_score_gemma":0.0003782102,"threshold_uncertainty_score":0.020929635},"labels":[],"label_agreement":null},{"id":"W1542357591","doi":"10.1007/3-540-44687-7_6","title":"Macrocell Architectures for Product Term Embedded Memory Arrays","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Macrocell; Computer science; Term (time); Granularity; Product (mathematics); Field-programmable gate array; Computer architecture; Embedded system; Computer hardware; Computer network; Operating system","score_opus":0.021381264471036512,"score_gpt":0.263721263431414,"score_spread":0.2423399989603775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542357591","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.17178607,0.019737065,0.68346,0.00084030256,0.0014269354,0.00014370865,0.0009969337,0.00748166,0.114127316],"genre_scores_gemma":[0.62745214,0.006420811,0.2583645,0.0005227349,0.00033527115,0.0002772829,0.0013283888,0.00043845485,0.10486053],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999527,0.0000062510735,0.0000026914727,0.000009142742,0.000017408596,0.000011791193],"domain_scores_gemma":[0.99985695,0.00002779273,0.000013904444,0.00003166344,0.000056297915,0.000013336675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006350087,0.00036234732,0.00026907225,0.00022283153,0.0002278577,0.00081923505,0.0009877655,0.00033959936,0.012223674],"category_scores_gemma":[0.00021666693,0.00016945615,0.00013822429,0.0005028917,0.00015194679,0.00083258667,0.00045151717,0.0004889628,0.0030309816],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043529648,0.000117986165,0.0008131621,0.0005773009,0.00006534116,0.00037207233,0.00020077876,0.025335811,0.2744088,0.14848736,0.054766007,0.49442008],"study_design_scores_gemma":[0.00008864474,0.0014146038,0.0019442347,0.00018559404,0.00012797985,0.0013219652,0.00021080427,0.24903524,0.253756,0.0824456,0.40938076,0.00008852773],"about_ca_topic_score_codex":0.0004815198,"about_ca_topic_score_gemma":0.0015658007,"teacher_disagreement_score":0.012223674,"about_ca_system_score_codex":0.00029293515,"about_ca_system_score_gemma":0.0001763334,"threshold_uncertainty_score":0.040892243},"labels":[],"label_agreement":null},{"id":"W1542362256","doi":"10.1007/978-3-540-88594-8_10","title":"A Top-Down Approach to Rewriting Conjunctive Queries Using Views","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Rewriting; Computer science; Conjunctive query; Context (archaeology); Graph; Theoretical computer science; Top-down and bottom-up design; Query language; Information retrieval; Programming language; Relational database","score_opus":0.043135234032639594,"score_gpt":0.27193436959338396,"score_spread":0.22879913556074438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542362256","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.0019994788,0.0002776355,0.991795,0.00018562381,0.00011877204,0.00012743025,0.0002377586,0.002826336,0.0024319992],"genre_scores_gemma":[0.047529295,0.00046895104,0.94263685,0.0003995353,0.00014354794,0.00014749417,0.0010553421,0.0013927196,0.0062262933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941203,0.0012618286,0.0006737149,0.00096669584,0.0025988407,0.00037859892],"domain_scores_gemma":[0.9938545,0.0025444706,0.00016183314,0.0020831334,0.0012059828,0.00015012336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002474733,0.0013012649,0.0017925543,0.0016983415,0.0013822266,0.0039804564,0.0037323853,0.0016566499,0.0070879767],"category_scores_gemma":[0.007477392,0.0016382891,0.0044398564,0.0024080903,0.0025700699,0.005480166,0.0040494218,0.004635811,0.0029071523],"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.0003645803,0.0003460375,0.00082932686,0.0010382714,0.00040122602,0.0009792536,0.001868573,0.028321313,0.057967123,0.30839506,0.031298872,0.56819034],"study_design_scores_gemma":[0.00012950548,0.00027222658,0.00047098656,0.00017713866,0.00067563256,0.0011328195,0.00052717514,0.26553115,0.08562792,0.5573736,0.087799564,0.00028237436],"about_ca_topic_score_codex":0.0063560456,"about_ca_topic_score_gemma":0.009100994,"teacher_disagreement_score":0.0070879767,"about_ca_system_score_codex":0.0012009317,"about_ca_system_score_gemma":0.0014571609,"threshold_uncertainty_score":0.023711622},"labels":[],"label_agreement":null},{"id":"W1542369266","doi":"10.1007/11740698_13","title":"The Importance of Scalability When Comparing Dynamic Weighted Aggregation and Pareto Front Techniques","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Computer science; Computation; Multi-objective optimization; Genetic algorithm; Population; Pareto principle; Mathematical optimization; Algorithm; Machine learning; Mathematics; Database","score_opus":0.008861077321542761,"score_gpt":0.24371619178205867,"score_spread":0.2348551144605159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542369266","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.20384477,0.013232169,0.71224636,0.0034247686,0.001995738,0.00075932796,0.00094005873,0.0013782494,0.062178615],"genre_scores_gemma":[0.70010805,0.0029936007,0.2899194,0.00043383986,0.0005684272,0.00047511543,0.00083385396,0.0007239023,0.0039436957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98361963,0.008821826,0.000908265,0.0006241441,0.0056701587,0.00035598016],"domain_scores_gemma":[0.8836475,0.09832196,0.0018793045,0.0075827986,0.007994227,0.000574246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021578006,0.0009409313,0.0016863943,0.0031559423,0.0011883554,0.0032754273,0.0018388194,0.0013818016,0.0040239836],"category_scores_gemma":[0.12606299,0.00038002452,0.0010342633,0.0044578565,0.001011952,0.008118052,0.0023103126,0.0018908673,0.00053436955],"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.0030732348,0.0005502909,0.012805568,0.0015846747,0.0010757786,0.000299556,0.0006253479,0.19855295,0.00905712,0.07786381,0.0144577585,0.6800539],"study_design_scores_gemma":[0.0003247233,0.00174993,0.01145152,0.0005587823,0.0009124564,0.00075577875,0.0012433045,0.7914329,0.01627203,0.16054656,0.0146216,0.00013039526],"about_ca_topic_score_codex":0.0019618268,"about_ca_topic_score_gemma":0.0034257912,"teacher_disagreement_score":0.021578006,"about_ca_system_score_codex":0.0009856626,"about_ca_system_score_gemma":0.0012438033,"threshold_uncertainty_score":0.11411673},"labels":[],"label_agreement":null},{"id":"W1542399126","doi":"10.1007/11866565_48","title":"Viscoelasticity Modeling of the Prostate Region Using Vibro-elastography","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency; University of British Columbia","funders":"","keywords":"Imaging phantom; Elastography; Viscoelasticity; Transducer; Acoustics; Stiffness; Biomedical engineering; Ultrasound; Materials science; Computer science; Physics; Optics; Medicine","score_opus":0.012419706727883844,"score_gpt":0.24319485840447477,"score_spread":0.23077515167659093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542399126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18557945,0.00093429803,0.8096241,0.0001729685,0.000036767673,0.000032858996,0.000118599695,0.0005049713,0.002996053],"genre_scores_gemma":[0.96670055,0.0005804411,0.02989867,0.00005499605,0.000019682027,0.000023680073,0.00007044817,0.0000613458,0.0025900744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999298,0.000016405365,0.000004083299,0.0000134246775,0.000027161195,0.0000091198735],"domain_scores_gemma":[0.99988854,0.00006225832,0.000016210617,0.000012464352,0.000012760264,0.000007752131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017605099,0.0003427903,0.00029040937,0.00031258454,0.00014853763,0.00054606644,0.00044447463,0.0008085877,0.0008788188],"category_scores_gemma":[0.0005887673,0.00031687226,0.0005105924,0.0002448362,0.00018000312,0.00042523188,0.00028785132,0.00021253811,0.0002193839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014556265,0.000052610507,0.0019072618,0.0000930696,0.0000459647,0.00049854896,0.00013683268,0.8123973,0.15056759,0.0013092351,0.00027332082,0.032572746],"study_design_scores_gemma":[0.0000053174367,0.000040673756,0.0015168084,0.0000069530192,0.000014583893,0.00021391895,0.000015316034,0.9887293,0.008647308,0.00040833958,0.00038831288,0.000013163141],"about_ca_topic_score_codex":0.0015509437,"about_ca_topic_score_gemma":0.0013068676,"teacher_disagreement_score":0.0015509437,"about_ca_system_score_codex":0.00016336139,"about_ca_system_score_gemma":0.00026588936,"threshold_uncertainty_score":0.0030838847},"labels":[],"label_agreement":null},{"id":"W1542447206","doi":"10.1007/3-540-45399-7_13","title":"Using Information Extraction and Natural Language Generation to Answer E-Mail","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Information extraction; Natural language; Natural language generation; Question answering; Natural language processing; Artificial intelligence; World Wide Web; Information retrieval","score_opus":0.01768209204753136,"score_gpt":0.28808717223935154,"score_spread":0.2704050801918202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542447206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025867399,0.00058928237,0.9435841,0.0007201931,0.00023415657,0.0005294952,0.0010914067,0.019759642,0.0076243132],"genre_scores_gemma":[0.12547024,0.00035631337,0.86354506,0.00031270826,0.00014931678,0.00033225617,0.0039612846,0.0006298284,0.0052429345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984138,0.00068157125,0.00014377512,0.0003088745,0.0003698867,0.00008198609],"domain_scores_gemma":[0.9955279,0.0032710265,0.00017748857,0.00030175823,0.00067050447,0.0000512793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017022281,0.0010273497,0.0009035902,0.002588041,0.00082294334,0.0015726314,0.0013866586,0.0013707457,0.0075714453],"category_scores_gemma":[0.0068262434,0.00060721074,0.0011348963,0.0016420628,0.00060561724,0.0026947216,0.0010980159,0.0009967069,0.004267918],"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.00038739826,0.00044642983,0.0017848365,0.0006850071,0.000096329306,0.0006802002,0.0006859916,0.011006399,0.037924014,0.020022187,0.028666275,0.8976149],"study_design_scores_gemma":[0.0003298819,0.0003834895,0.0018553054,0.0001709498,0.00036520814,0.0012419599,0.0005257194,0.69128954,0.13383953,0.10778744,0.062088333,0.00012269692],"about_ca_topic_score_codex":0.0016163413,"about_ca_topic_score_gemma":0.002112371,"teacher_disagreement_score":0.0075714453,"about_ca_system_score_codex":0.0005674033,"about_ca_system_score_gemma":0.00082345953,"threshold_uncertainty_score":0.025329053},"labels":[],"label_agreement":null},{"id":"W1542499968","doi":"10.1007/978-3-642-13529-3_22","title":"Improving Co-training with Agreement-Based Sampling","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Co-training; Sampling (signal processing); Training (meteorology); Artificial intelligence; Machine learning; Training set; Process (computing); Data sampling; Pattern recognition (psychology); Data mining; Semi-supervised learning; Computer vision","score_opus":0.020738141482419998,"score_gpt":0.2622375231549632,"score_spread":0.24149938167254317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542499968","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.017442493,0.000528128,0.97520185,0.00035375994,0.00024298255,0.0001747021,0.00014770296,0.0040285503,0.0018797665],"genre_scores_gemma":[0.39536688,0.00025567482,0.5893586,0.0011364046,0.0006000084,0.000684702,0.002217742,0.0019222888,0.008457724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98415816,0.008791352,0.00084362854,0.002315328,0.0027056138,0.0011857899],"domain_scores_gemma":[0.921352,0.053834774,0.001400997,0.014826217,0.0067834356,0.0018025668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012625508,0.0024781558,0.0050594006,0.0020874913,0.0021239785,0.0023361193,0.0084919175,0.0058221146,0.011324858],"category_scores_gemma":[0.057769135,0.0019312403,0.0022913206,0.0030539043,0.0023260345,0.0070098103,0.0079588285,0.00719041,0.006334736],"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.0031960977,0.0012422826,0.007344182,0.00036582354,0.0005630931,0.0002772966,0.0004207147,0.28469706,0.007356769,0.019669624,0.024873333,0.6499937],"study_design_scores_gemma":[0.00009573432,0.000116226955,0.00022025523,0.000016025368,0.000043960354,0.000073605064,0.000034051565,0.98753977,0.0020212708,0.009065786,0.00075966486,0.000013764519],"about_ca_topic_score_codex":0.0057862317,"about_ca_topic_score_gemma":0.010148833,"teacher_disagreement_score":0.012625508,"about_ca_system_score_codex":0.0012438216,"about_ca_system_score_gemma":0.0032459185,"threshold_uncertainty_score":0.06677085},"labels":[],"label_agreement":null},{"id":"W1542530661","doi":"10.1007/978-3-540-78582-8_53","title":"Incremental Biomedical Ontology Change Management through Learning Agents","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Ontology; Computer science; Process (computing); Process ontology; Domain (mathematical analysis); Data science; Knowledge management; Change management (ITSM); Domain knowledge; Risk analysis (engineering); Process management; Artificial intelligence; Engineering; Medicine; Operations management","score_opus":0.053301041765661014,"score_gpt":0.28262354644470117,"score_spread":0.22932250467904014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542530661","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.051134802,0.00050347537,0.919845,0.0010038887,0.00026091476,0.00039873557,0.0003655118,0.013834065,0.012653658],"genre_scores_gemma":[0.44197047,0.00029474884,0.54704237,0.00040996,0.000109930814,0.00023219515,0.0011907658,0.00064322207,0.008106347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837494,0.00041339832,0.00015400906,0.00038511556,0.00056261854,0.00010994635],"domain_scores_gemma":[0.9932376,0.003465526,0.00040345005,0.0017295495,0.0009497009,0.00021415252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027127336,0.00053841574,0.0007805244,0.0014218646,0.00080401695,0.00274108,0.0030132728,0.0012413852,0.004425434],"category_scores_gemma":[0.012834069,0.0004762677,0.0008239214,0.0012812299,0.00082448527,0.0039181514,0.0034141627,0.0017937125,0.0012396205],"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.00037497477,0.00084463716,0.0056023966,0.00020139382,0.00013304212,0.00036331321,0.00082239194,0.046148214,0.009926343,0.017284028,0.013486224,0.904813],"study_design_scores_gemma":[0.00010513611,0.00012155732,0.0019456593,0.000054514563,0.0002007355,0.00029125653,0.0004105613,0.87463593,0.02693879,0.054720555,0.04052291,0.000052362488],"about_ca_topic_score_codex":0.0038708632,"about_ca_topic_score_gemma":0.005913134,"teacher_disagreement_score":0.004425434,"about_ca_system_score_codex":0.00079779624,"about_ca_system_score_gemma":0.0013819279,"threshold_uncertainty_score":0.014804542},"labels":[],"label_agreement":null},{"id":"W1542565836","doi":"10.1007/978-3-540-74126-8_30","title":"HFold: RNA Pseudoknotted Secondary Structure Prediction Using Hierarchical Folding","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Folding (DSP implementation); Nucleic acid secondary structure; Computational biology; Algorithm; RNA; Artificial intelligence; Biology; Structural engineering; Genetics; Engineering","score_opus":0.017795513563793296,"score_gpt":0.2544326796627245,"score_spread":0.23663716609893118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542565836","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.020757327,0.0016759364,0.8763156,0.00016886138,0.0003597062,0.00016350912,0.0052215597,0.09295574,0.0023817702],"genre_scores_gemma":[0.08249896,0.001004363,0.88067055,0.00021142428,0.00008712623,0.0003777203,0.020038044,0.0093743475,0.005737489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995683,0.00006613083,0.000029889481,0.00012753837,0.0001645829,0.00004355755],"domain_scores_gemma":[0.9995932,0.00018605919,0.00003443955,0.00006967099,0.00008747905,0.000029224619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010139091,0.0018279316,0.0014825447,0.0009835163,0.0006969201,0.0009948821,0.002273689,0.0010008223,0.00713101],"category_scores_gemma":[0.0011974245,0.001138078,0.0011859299,0.00077266153,0.00035362394,0.0013994331,0.00084801414,0.001684885,0.005798075],"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.0010159097,0.000278771,0.0017681589,0.001178101,0.00034435838,0.00035088148,0.0001925435,0.07274189,0.11098284,0.0074239643,0.11243801,0.6912846],"study_design_scores_gemma":[0.0001838865,0.00030647824,0.0017287022,0.00013187865,0.00012902901,0.00042945365,0.000053007006,0.76706797,0.16159868,0.022523489,0.045665227,0.00018211476],"about_ca_topic_score_codex":0.0012566982,"about_ca_topic_score_gemma":0.0016662913,"teacher_disagreement_score":0.00713101,"about_ca_system_score_codex":0.00047541317,"about_ca_system_score_gemma":0.00054754113,"threshold_uncertainty_score":0.023855627},"labels":[],"label_agreement":null},{"id":"W1542640015","doi":"10.1007/978-3-540-30201-8_23","title":"A Domain Consistency Algorithm for the Stretch Constraint","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal; University of Waterloo","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Benchmark (surveying); Domain (mathematical analysis); Constraint satisfaction; Constraint satisfaction problem; Algorithm; Constraint programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.014307262675304735,"score_gpt":0.23930924568274253,"score_spread":0.2250019830074378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542640015","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.0034612273,0.00012764893,0.99253404,0.00011787047,0.000048810984,0.00010181178,0.00009445505,0.0008549134,0.0026593024],"genre_scores_gemma":[0.038326964,0.00014108908,0.95573246,0.000108691,0.000047482496,0.00014495113,0.00042468277,0.00054060784,0.004532936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985261,0.00028251618,0.00010218836,0.0004245494,0.0005248523,0.00013985486],"domain_scores_gemma":[0.9969958,0.0013978224,0.00014528933,0.0007354691,0.000637954,0.00008767162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018105308,0.0010896984,0.0014952694,0.0017725283,0.0013587362,0.0021266746,0.0032925757,0.0017214115,0.01283909],"category_scores_gemma":[0.0067735612,0.0010049758,0.0017083489,0.0026573718,0.0013340489,0.0051819496,0.003926753,0.003833749,0.0023722698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003387447,0.00026343664,0.0007022837,0.0003996633,0.00007877143,0.00014083955,0.0002684798,0.08433839,0.011021832,0.13624926,0.017575575,0.7486228],"study_design_scores_gemma":[0.00022058527,0.00013299816,0.00039303067,0.00009871064,0.000086439206,0.00025834522,0.00019464818,0.7734394,0.014793275,0.18788362,0.022443341,0.000055585082],"about_ca_topic_score_codex":0.0033107703,"about_ca_topic_score_gemma":0.003584093,"teacher_disagreement_score":0.01283909,"about_ca_system_score_codex":0.0010070278,"about_ca_system_score_gemma":0.0021033648,"threshold_uncertainty_score":0.042950988},"labels":[],"label_agreement":null},{"id":"W1542659240","doi":"10.1007/978-3-540-45173-0_33","title":"Generic Agent Architecture for Embedded Intelligent Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Maintainability; Software portability; Architecture; Reusability; Agent architecture; Embedded system; Software engineering; Multi-agent system; Artificial intelligence; Programming language; Software","score_opus":0.03504777767310378,"score_gpt":0.26060298992518777,"score_spread":0.22555521225208397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542659240","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.0052965456,0.0023296834,0.9639199,0.0005120531,0.00025166254,0.00015568057,0.00014003138,0.0029853922,0.024409035],"genre_scores_gemma":[0.17153251,0.0042684427,0.7842424,0.00037779284,0.00014147181,0.00046346764,0.0011764469,0.0005391306,0.037258357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.000072006675,0.000029466717,0.000046040255,0.00008386565,0.000044169654],"domain_scores_gemma":[0.9998369,0.000028158636,0.000008780117,0.000065450506,0.000042170777,0.000018436265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558562,0.000722141,0.0007531213,0.00044981984,0.00055232283,0.0018610636,0.0018283918,0.0017413252,0.0053189644],"category_scores_gemma":[0.0006955095,0.00047244175,0.000692227,0.000755008,0.00086153834,0.0020300855,0.001376338,0.0016959123,0.0024313696],"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.00008340025,0.00005592493,0.00018573874,0.00041201967,0.0000602507,0.0002026053,0.00023749641,0.05254403,0.008108426,0.82172287,0.014484404,0.101902865],"study_design_scores_gemma":[0.00006358949,0.00008604528,0.0002224454,0.00014826428,0.00008237163,0.00036743522,0.00006901166,0.32391366,0.005945615,0.45357993,0.21548402,0.000037595306],"about_ca_topic_score_codex":0.0011663735,"about_ca_topic_score_gemma":0.0017768702,"teacher_disagreement_score":0.0053189644,"about_ca_system_score_codex":0.0007101494,"about_ca_system_score_gemma":0.0007331655,"threshold_uncertainty_score":0.017793715},"labels":[],"label_agreement":null},{"id":"W1542704817","doi":"10.1007/11559573_22","title":"All-in-Focus Imaging Using a Series of Images on Different Focal Planes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","field":"Engineering","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":"Focus (optics); Series (stratigraphy); Computer vision; Computer science; Artificial intelligence; Geology; Optics; Physics; Paleontology","score_opus":0.015114107368166015,"score_gpt":0.251803693929482,"score_spread":0.23668958656131597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542704817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117146045,0.0016771579,0.856299,0.00039419674,0.00019589569,0.0002055073,0.00033698406,0.00083283224,0.022912368],"genre_scores_gemma":[0.24301444,0.002605033,0.74479604,0.00016221672,0.00010105053,0.00009310161,0.00034192458,0.00022090715,0.008665269],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999841,0.000017572227,0.000009543508,0.000034829292,0.00007951138,0.00001754065],"domain_scores_gemma":[0.99963415,0.000093652205,0.000052989497,0.00008790606,0.00010426517,0.000027018561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004318134,0.0009673739,0.0006093325,0.00092593837,0.00032130143,0.0010465009,0.0006469585,0.0007813355,0.0033235902],"category_scores_gemma":[0.0006372295,0.00062405586,0.0005078834,0.0012273776,0.00058303087,0.0015896442,0.00079920277,0.00084272266,0.00087077636],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004287791,0.000061692954,0.000827179,0.0003695093,0.00008356805,0.00032558353,0.00017731423,0.0038087065,0.8488699,0.0065493686,0.0013230782,0.1371754],"study_design_scores_gemma":[0.000045847195,0.00032207475,0.0060751545,0.00008713439,0.00019133867,0.0038503117,0.00017411105,0.03631952,0.93450016,0.0056685046,0.01268483,0.000080991245],"about_ca_topic_score_codex":0.00047378207,"about_ca_topic_score_gemma":0.00094353606,"teacher_disagreement_score":0.0033235902,"about_ca_system_score_codex":0.00032298785,"about_ca_system_score_gemma":0.00029189998,"threshold_uncertainty_score":0.011118472},"labels":[],"label_agreement":null},{"id":"W1542739256","doi":"10.1007/978-3-540-89639-5_5","title":"Enhancing Boundary Primitives Using a Multiscale Quadtree Segmentation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Université Laval","funders":"","keywords":"Boundary (topology); Quadtree; Computer science; Segmentation; Superposition principle; Artificial intelligence; Computer vision; Curvature; Image segmentation; Object (grammar); Binary number; Binary image; Algorithm; Pattern recognition (psychology); Image (mathematics); Geometry; Mathematics; Image processing; Mathematical analysis; Arithmetic","score_opus":0.025115508303298673,"score_gpt":0.2917443832834117,"score_spread":0.266628874980113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542739256","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.014605579,0.00019613041,0.98280615,0.000063047075,0.00002574448,0.00006512264,0.000053265012,0.00087247626,0.0013124334],"genre_scores_gemma":[0.0846569,0.0002655479,0.9131198,0.00006596061,0.000024078603,0.000041468935,0.00014028627,0.00040300871,0.0012829172],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969697,0.00002751191,0.000015546068,0.000053657084,0.00017002155,0.00003635068],"domain_scores_gemma":[0.9995664,0.00014955207,0.000037271497,0.00010838957,0.00010727739,0.000031176918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004315813,0.0007232295,0.0009873079,0.0013686436,0.00035554435,0.0010999873,0.00096412224,0.0011060565,0.0029813757],"category_scores_gemma":[0.0013199301,0.00077884225,0.0008071439,0.0013396186,0.00046152118,0.0014091798,0.0014504208,0.000983389,0.001038307],"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.00026075012,0.00010899209,0.0004927174,0.00036276568,0.00004878953,0.0002771834,0.00021707111,0.06442767,0.489012,0.017317876,0.003135418,0.4243387],"study_design_scores_gemma":[0.000029096169,0.00011868762,0.0008528948,0.000036975103,0.00006616944,0.0007809194,0.000044600656,0.86945933,0.110357985,0.011416571,0.0068027284,0.00003407375],"about_ca_topic_score_codex":0.0010684492,"about_ca_topic_score_gemma":0.0014755025,"teacher_disagreement_score":0.0029813757,"about_ca_system_score_codex":0.00032716605,"about_ca_system_score_gemma":0.00054727844,"threshold_uncertainty_score":0.009973645},"labels":[],"label_agreement":null},{"id":"W1542770311","doi":"10.1007/978-3-642-31149-9_2","title":"Perceptual Grouping Using Superpixels","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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 Toronto","funders":"Army Research Laboratory; Natural Sciences and Engineering Research Council of Canada","keywords":"Categorization; Computer science; Artificial intelligence; Object (grammar); Perception; Cognitive neuroscience of visual object recognition; Pattern recognition (psychology); Prior probability; Segmentation; Figure–ground; Object detection; Computer vision; Psychology","score_opus":0.038740097280703746,"score_gpt":0.2935758169729944,"score_spread":0.25483571969229063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542770311","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.013621299,0.0006658876,0.98021704,0.0000610677,0.00009825341,0.00006543815,0.00009438923,0.001031636,0.004145025],"genre_scores_gemma":[0.13084273,0.0010149359,0.86239123,0.00007875716,0.00010411205,0.00006913097,0.0003722104,0.00041576033,0.004711069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995603,0.000064129315,0.000023632208,0.000108891814,0.00019662121,0.00004651251],"domain_scores_gemma":[0.99943525,0.00013381166,0.0000452472,0.00016615944,0.00016426183,0.0000551509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005819671,0.00086965365,0.0013068352,0.001985115,0.0003881645,0.001206314,0.0009653171,0.00057834416,0.0075107343],"category_scores_gemma":[0.0009927152,0.0006239726,0.00079824607,0.0027399126,0.00058557064,0.0016618447,0.0012650706,0.000657216,0.00230915],"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.0004388814,0.00009580508,0.00031991297,0.00043824612,0.00008910942,0.00013026023,0.00015271781,0.021235524,0.22414905,0.014624401,0.004707976,0.7336181],"study_design_scores_gemma":[0.00006574448,0.00037896459,0.0032605622,0.00010305338,0.00018556512,0.00071212434,0.00019438675,0.7570552,0.16039373,0.044426553,0.033138156,0.00008594804],"about_ca_topic_score_codex":0.0010116064,"about_ca_topic_score_gemma":0.0016735594,"teacher_disagreement_score":0.0075107343,"about_ca_system_score_codex":0.00032722784,"about_ca_system_score_gemma":0.00034312936,"threshold_uncertainty_score":0.025125861},"labels":[],"label_agreement":null},{"id":"W1542773558","doi":"10.1007/978-3-540-74767-3_38","title":"Distributed Multi-source Regular Path Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Path (computing); Distributed computing; Theoretical computer science; Programming language","score_opus":0.023895276126301032,"score_gpt":0.24997032842705894,"score_spread":0.22607505230075792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542773558","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.044530787,0.0005814525,0.92468214,0.0007819308,0.00019251967,0.00029869028,0.0011625801,0.013129529,0.014640302],"genre_scores_gemma":[0.5668521,0.0006231077,0.40176708,0.00033004844,0.00023571377,0.00032757994,0.0038739743,0.0019096703,0.02408074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983279,0.0002945328,0.0001255589,0.0003594972,0.00071306963,0.00017940874],"domain_scores_gemma":[0.9955035,0.0016867233,0.00015043812,0.0021759088,0.00034756126,0.00013585082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017251915,0.0007872446,0.0015603543,0.0010235026,0.0010483025,0.002064516,0.0024004185,0.0013440754,0.007954014],"category_scores_gemma":[0.0055431467,0.0006029667,0.00058377313,0.002405431,0.0008400213,0.0046593896,0.003939048,0.0014222438,0.0023810316],"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.0029990044,0.0005863651,0.0025302132,0.001004192,0.00019625718,0.0005874185,0.00082779425,0.11147699,0.055240363,0.15301381,0.060697004,0.61084056],"study_design_scores_gemma":[0.00041025138,0.00023211057,0.0006133194,0.000047688554,0.000108298926,0.0008044675,0.00028699165,0.7417774,0.035862483,0.18161319,0.038178664,0.00006502607],"about_ca_topic_score_codex":0.0007698719,"about_ca_topic_score_gemma":0.0011744876,"teacher_disagreement_score":0.007954014,"about_ca_system_score_codex":0.0008564999,"about_ca_system_score_gemma":0.00081615965,"threshold_uncertainty_score":0.026608765},"labels":[],"label_agreement":null},{"id":"W1542807488","doi":"10.1007/978-3-642-04355-0_47","title":"From Almost Everywhere to Everywhere: Byzantine Agreement with $\\tilde{O}(n^{3/2})$ Bits","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Leader election; Adversary; Set (abstract data type); Byzantine fault tolerance; Theoretical computer science; Distributed computing; Discrete mathematics; Parallel computing; Algorithm; Computer security; Fault tolerance; Mathematics","score_opus":0.010895341814394659,"score_gpt":0.22631574826434261,"score_spread":0.21542040644994795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542807488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030559298,0.0017978707,0.6362776,0.016427306,0.001970577,0.00017704401,0.0005368487,0.001832122,0.31042135],"genre_scores_gemma":[0.73315126,0.0017072029,0.14782323,0.0030878403,0.00094352785,0.0005676997,0.00044071977,0.0020770277,0.11020147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948205,0.0021183584,0.00028888165,0.00083474995,0.0012016429,0.00073576416],"domain_scores_gemma":[0.99398273,0.0028900404,0.0002365099,0.002057627,0.0005874108,0.00024566182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038781846,0.000847066,0.0016247466,0.0011118174,0.005721451,0.0072729858,0.0019494096,0.0032322432,0.016703341],"category_scores_gemma":[0.012927845,0.0008636975,0.0010360423,0.0021495004,0.008889507,0.022406831,0.007161758,0.008892608,0.0057463655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020951116,0.000004346564,0.000010036774,0.000013080026,0.0000015571827,0.00000970605,0.00015285736,0.0001836697,0.00012324534,0.9934865,0.0019503,0.0040435903],"study_design_scores_gemma":[0.000005411263,0.0000028347001,0.0000050756457,0.000011704414,0.0000020764362,0.00001343754,0.00003454093,0.00073293684,0.0003206826,0.9932694,0.005595997,0.000005969495],"about_ca_topic_score_codex":0.00090906204,"about_ca_topic_score_gemma":0.00091570884,"teacher_disagreement_score":0.016703341,"about_ca_system_score_codex":0.0021110233,"about_ca_system_score_gemma":0.0019828123,"threshold_uncertainty_score":0.055878222},"labels":[],"label_agreement":null},{"id":"W1542812669","doi":"10.1007/3-540-36492-7_19","title":"New Results on Unconditionally Secure Distributed Oblivious Transfer","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oblivious transfer; Computer science; Communication source; Theoretical computer science; Randomness; Server; Impossibility; Set (abstract data type); Access structure; Secret sharing; Transfer (computing); Upper and lower bounds; Cryptography; Distributed computing; Algorithm; Computer network; Mathematics; Parallel computing","score_opus":0.012989627268754307,"score_gpt":0.2276530457781751,"score_spread":0.2146634185094208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542812669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029555788,0.0027755955,0.84510016,0.0034091407,0.0015715561,0.0001393474,0.0004062682,0.0020342628,0.11500789],"genre_scores_gemma":[0.70319057,0.005066292,0.1359913,0.0026334133,0.0040913713,0.000786986,0.0009580555,0.0018321947,0.14544983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646395,0.00042591736,0.00018850862,0.00071019604,0.0016170231,0.000594429],"domain_scores_gemma":[0.99283737,0.003842336,0.00036520732,0.002026177,0.0005530176,0.00037576223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021518809,0.0020786982,0.0020349594,0.0026341833,0.002944625,0.0045411834,0.003831497,0.0022966308,0.016405117],"category_scores_gemma":[0.0074582077,0.0013667536,0.0019023274,0.0034445713,0.006501731,0.017809942,0.009308808,0.009960607,0.005356961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019124558,0.000080355036,0.000106358246,0.00018682695,0.00002662633,0.000096466974,0.0002360014,0.0048485417,0.002858845,0.95613736,0.006078004,0.029153366],"study_design_scores_gemma":[0.000029888206,0.000031260028,0.000082689265,0.000027668315,0.000038160248,0.00012246068,0.000028364295,0.016254386,0.0029227065,0.970786,0.0096470015,0.000029551156],"about_ca_topic_score_codex":0.00036236597,"about_ca_topic_score_gemma":0.00033963108,"teacher_disagreement_score":0.016405117,"about_ca_system_score_codex":0.0020605293,"about_ca_system_score_gemma":0.0014150282,"threshold_uncertainty_score":0.05488056},"labels":[],"label_agreement":null},{"id":"W1542956397","doi":"10.1007/3-540-45749-6_64","title":"Frequency Channel Assignment on Planar Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Frequency assignment; Planar; Channel (broadcasting); Computer network; Telecommunications; Algorithm; Computer graphics (images)","score_opus":0.02724496262158387,"score_gpt":0.2615314947421288,"score_spread":0.2342865321205449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542956397","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.06256432,0.001394785,0.8042349,0.00075740815,0.0003184715,0.00008921019,0.00024318999,0.0008200757,0.12957756],"genre_scores_gemma":[0.669423,0.0051438203,0.22304225,0.00025910218,0.00046686674,0.00025244546,0.0005827756,0.0002667668,0.10056296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980897,0.000041526353,0.0000052866276,0.000034345885,0.00005853385,0.000051364197],"domain_scores_gemma":[0.9996395,0.00017137722,0.000037443453,0.000058035606,0.000061630286,0.00003201121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015858404,0.0004833507,0.00043744888,0.00074183743,0.00068840076,0.0009811869,0.0008601094,0.00045946045,0.008319295],"category_scores_gemma":[0.0011162801,0.00031599947,0.00024118954,0.0017403805,0.0005818157,0.001222766,0.0011506294,0.000763165,0.0013419688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013679639,0.000053582495,0.00017784735,0.00023791163,0.000019596604,0.00009131377,0.00012779067,0.15433471,0.0068209814,0.5980754,0.016862927,0.22306111],"study_design_scores_gemma":[0.00003239401,0.00008578292,0.00030838486,0.00004264997,0.000026879354,0.00021870367,0.000103430735,0.25591782,0.0029007301,0.70566756,0.03467004,0.000025557092],"about_ca_topic_score_codex":0.0011762707,"about_ca_topic_score_gemma":0.0011799684,"teacher_disagreement_score":0.008319295,"about_ca_system_score_codex":0.0006668917,"about_ca_system_score_gemma":0.00043415907,"threshold_uncertainty_score":0.02783078},"labels":[],"label_agreement":null},{"id":"W1542990689","doi":"10.1007/978-3-642-19222-7_7","title":"Shortest Paths between Shortest Paths and Independent Sets","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control reconfiguration; K shortest path routing; Shortest path problem; Sequence (biology); Yen's algorithm; Shortest Path Faster Algorithm; Floyd–Warshall algorithm; Graph","score_opus":0.03353041539316524,"score_gpt":0.2815773617864456,"score_spread":0.24804694639328037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542990689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03469144,0.015180313,0.72245497,0.0016280304,0.0014077644,0.00022329493,0.0030103936,0.0009283066,0.22047563],"genre_scores_gemma":[0.25148332,0.025979772,0.6078677,0.00056598167,0.0015221965,0.0006915269,0.0074725654,0.00085729087,0.1035596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999632,0.000051082883,0.000022567938,0.00010973155,0.0001575007,0.000027084881],"domain_scores_gemma":[0.99944836,0.00032257842,0.00004958189,0.000052846935,0.000093319846,0.00003330936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030529333,0.0010227048,0.0006532372,0.0025665688,0.0008009345,0.0015337864,0.0010934059,0.00070030056,0.010568384],"category_scores_gemma":[0.002091779,0.0006689213,0.0007780211,0.0058178,0.00096633844,0.004042875,0.0013030085,0.0023331284,0.0024629438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006550246,0.000032079024,0.00019596082,0.00058799045,0.000051679366,0.000110032626,0.00027500655,0.017786587,0.0018651499,0.78259873,0.02356201,0.17286922],"study_design_scores_gemma":[0.000011731343,0.00001782087,0.00017543019,0.000053867,0.000019610867,0.00013469158,0.000050096733,0.0075758095,0.0005022577,0.9411019,0.050344493,0.000012243304],"about_ca_topic_score_codex":0.00079940265,"about_ca_topic_score_gemma":0.0010932616,"teacher_disagreement_score":0.010568384,"about_ca_system_score_codex":0.0009840647,"about_ca_system_score_gemma":0.00063096493,"threshold_uncertainty_score":0.035354733},"labels":[],"label_agreement":null},{"id":"W1543021324","doi":"10.1007/978-3-540-73549-6_95","title":"Performance Evaluation of 3-Hierarchical Resource Management Model with Grid Service Architecture","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Distributed computing; Grid; Resource management (computing); Resource allocation; Rendering (computer graphics); Virtual organization; Grid computing; Fault tolerance; Task (project management); Resource (disambiguation); Computer network; Artificial intelligence; Engineering; Systems engineering","score_opus":0.03131564041133664,"score_gpt":0.2603528238895165,"score_spread":0.2290371834781799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543021324","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.9328417,0.000661879,0.0482579,0.0005978227,0.00015200165,0.00016404857,0.0005491059,0.0027270946,0.01404834],"genre_scores_gemma":[0.99165404,0.00008720747,0.0071172696,0.000028632254,0.0000103047405,0.00002826375,0.00023366234,0.000037705617,0.0008029674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987601,0.00046474097,0.00005555952,0.00013047893,0.00030077988,0.00028835377],"domain_scores_gemma":[0.9979231,0.0009118101,0.00011871644,0.00024860943,0.000587517,0.00021024728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018447442,0.0008040391,0.0007892513,0.00074911444,0.0008035612,0.0013428944,0.0016330905,0.0008154747,0.004359051],"category_scores_gemma":[0.0028548695,0.00021248075,0.000580348,0.0012797078,0.00051998516,0.0016772745,0.0005778499,0.0005880214,0.00034613593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036959671,0.0006623936,0.0051409006,0.00019167278,0.00012569489,0.00016185876,0.00010313675,0.9329083,0.006815623,0.0071150037,0.0044773757,0.038602103],"study_design_scores_gemma":[0.000041998668,0.00020968496,0.00063043536,0.00000281056,0.000026061556,0.0000133953445,0.00003813814,0.9965515,0.001605897,0.00070810004,0.00016340175,0.000008538155],"about_ca_topic_score_codex":0.029284488,"about_ca_topic_score_gemma":0.011672039,"teacher_disagreement_score":0.029284488,"about_ca_system_score_codex":0.0024909559,"about_ca_system_score_gemma":0.0017362674,"threshold_uncertainty_score":0.058228016},"labels":[],"label_agreement":null},{"id":"W1543042058","doi":"10.1007/978-3-642-12116-6_51","title":"Optimal IR: How Far Away?","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"York University","funders":"","keywords":"Computer science; Perspective (graphical); Path (computing); Upper and lower bounds; Algorithm; Artificial intelligence; Mathematics","score_opus":0.018982093840062775,"score_gpt":0.2503416385279176,"score_spread":0.2313595446878548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543042058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01069424,0.23909841,0.35350534,0.30372348,0.006518553,0.00008176573,0.00073303236,0.001719752,0.08392544],"genre_scores_gemma":[0.4348455,0.12589526,0.3251071,0.043997716,0.023868334,0.00024327595,0.0012274805,0.0035023398,0.041312996],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907602,0.0056700916,0.00051894196,0.0011952978,0.0014687581,0.0003867004],"domain_scores_gemma":[0.9740369,0.019335361,0.0005467035,0.0032129788,0.0019995058,0.0008686952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010332282,0.0015497664,0.0039652106,0.0016888711,0.0013239722,0.009012747,0.0027739767,0.006038995,0.023097666],"category_scores_gemma":[0.04315249,0.0012014398,0.0010420588,0.0020611894,0.0083284695,0.031949695,0.004014354,0.009376083,0.0076724244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041683283,0.0003132337,0.00065600907,0.0012613836,0.00021281964,0.000049329974,0.00024951185,0.00680568,0.00059774466,0.29195246,0.12272853,0.57475644],"study_design_scores_gemma":[0.000052367974,0.000052714313,0.0002699566,0.00042432363,0.000058170852,0.00009628115,0.00025967587,0.010477037,0.0002562551,0.96059126,0.027422514,0.000039570077],"about_ca_topic_score_codex":0.0020273305,"about_ca_topic_score_gemma":0.0020520769,"teacher_disagreement_score":0.023097666,"about_ca_system_score_codex":0.0020120486,"about_ca_system_score_gemma":0.002344226,"threshold_uncertainty_score":0.077269375},"labels":[],"label_agreement":null},{"id":"W1543121172","doi":"10.1007/978-3-642-12535-5_70","title":"Inverse Problem for Coefficient Identification in Euler-Bernoulli Equation by Linear Spline Approximation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical methods in inverse problems","field":"Mathematics","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 Saskatchewan; Concordia University of Edmonton","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Inverse problem; Bernoulli's principle; Spline (mechanical); Applied mathematics; Mathematics; Inverse; Parameter identification problem; Euler equations; Euler's formula; Mathematical analysis; Geometry; Physics","score_opus":0.06607497587865394,"score_gpt":0.3310737988142828,"score_spread":0.2649988229356288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543121172","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.013590544,0.0023414856,0.96371776,0.0008399484,0.00058605394,0.000041354808,0.00006530648,0.00009460497,0.018723015],"genre_scores_gemma":[0.41436327,0.00772327,0.46675092,0.0005213978,0.0013518215,0.0003061285,0.00046181018,0.00048486868,0.10803652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947387,0.00021313688,0.000027317783,0.000071476046,0.00018364402,0.00003065533],"domain_scores_gemma":[0.9991448,0.0005541666,0.000047937654,0.000053969037,0.00014848799,0.00005063708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012217497,0.0007496189,0.0015114285,0.0011420562,0.0006336485,0.0015759232,0.0014080052,0.0023369384,0.0035011019],"category_scores_gemma":[0.0040296023,0.0005019019,0.0011840865,0.001017756,0.0019562654,0.002117324,0.0022837296,0.00321898,0.0006598145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006865835,0.000049976843,0.00031598995,0.00046257384,0.000037877246,0.00023919255,0.00030568693,0.083762385,0.0070455167,0.8711099,0.0036680703,0.032934267],"study_design_scores_gemma":[0.000015266165,0.000025702771,0.00018375869,0.00006119402,0.000021471187,0.00028198928,0.00008373241,0.7151694,0.0014892877,0.27619883,0.006431618,0.000037661623],"about_ca_topic_score_codex":0.0017147168,"about_ca_topic_score_gemma":0.0011578287,"teacher_disagreement_score":0.0035011019,"about_ca_system_score_codex":0.0005986859,"about_ca_system_score_gemma":0.0010720697,"threshold_uncertainty_score":0.011712313},"labels":[],"label_agreement":null},{"id":"W1543143808","doi":"10.1007/978-3-540-87412-6_4","title":"A Calibration Framework for Capturing and Calibrating Software Performance Models","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Calibration; Computer science; Software; Software engineering; Statistics; Mathematics; Programming language","score_opus":0.022846538979935212,"score_gpt":0.2366368869208145,"score_spread":0.21379034794087928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543143808","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.0015750573,0.000037688562,0.99690115,0.000022451148,0.000010837983,0.000014810207,0.000051008818,0.0008600883,0.000526982],"genre_scores_gemma":[0.17009993,0.00023557112,0.8265778,0.000057801128,0.00004702673,0.00016877048,0.00056730205,0.0005701332,0.0016757578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978884,0.00046569546,0.000107687105,0.0005054476,0.00090589456,0.00012692272],"domain_scores_gemma":[0.9960218,0.0012134073,0.00043688287,0.0011448575,0.0010923353,0.00009075507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027988807,0.001565932,0.0010557405,0.0020836915,0.0007852756,0.002118159,0.002647665,0.001973779,0.0022763547],"category_scores_gemma":[0.012169276,0.001100416,0.0012977947,0.0020420076,0.0007429891,0.0027396895,0.0017500527,0.002849666,0.0014312549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034562185,0.00010690382,0.0016411081,0.000073219104,0.00008060371,0.000066105,0.00013198997,0.7746678,0.011977674,0.057165794,0.0027416633,0.15131254],"study_design_scores_gemma":[0.000004690178,0.00002159843,0.000440316,0.000012063438,0.000014607415,0.00003877102,0.000013138182,0.97633445,0.003346079,0.017100723,0.002649962,0.000023632518],"about_ca_topic_score_codex":0.007917731,"about_ca_topic_score_gemma":0.005538473,"teacher_disagreement_score":0.007917731,"about_ca_system_score_codex":0.0012438311,"about_ca_system_score_gemma":0.0017350197,"threshold_uncertainty_score":0.015743315},"labels":[],"label_agreement":null},{"id":"W1543181490","doi":"10.1007/978-3-540-73556-4_6","title":"Searching Cycle-Disjoint Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Disjoint sets; Computer science; Graph; Time complexity; Vertex (graph theory); Running time; Mathematics; Discrete mathematics; Algorithm","score_opus":0.033346422014682714,"score_gpt":0.2770830695380785,"score_spread":0.24373664752339577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543181490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.282511,0.0032552634,0.6168687,0.002629911,0.0003220138,0.00064864615,0.0027360406,0.003398786,0.087629735],"genre_scores_gemma":[0.40888965,0.0017426217,0.5531549,0.00054946047,0.00013677558,0.000327138,0.008673893,0.0008049959,0.02572066],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992126,0.00015919018,0.000052097854,0.00022883937,0.00022673894,0.000120420715],"domain_scores_gemma":[0.9975932,0.0015198847,0.00013094343,0.00042246006,0.00018518395,0.00014829799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586767,0.0011148608,0.0014725351,0.0026093333,0.0011629137,0.0017616878,0.0032133576,0.001909696,0.021678343],"category_scores_gemma":[0.0063226963,0.0010347669,0.0013162437,0.004330599,0.0010457793,0.0046375124,0.0038738432,0.0014248955,0.0026382855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009107546,0.00045970935,0.0033792574,0.0019324147,0.00024300437,0.0004137398,0.00078079215,0.11231857,0.017869912,0.14267285,0.050197132,0.66882193],"study_design_scores_gemma":[0.00029556573,0.00033484385,0.0013818325,0.0002741946,0.0002369213,0.00089556666,0.0008629895,0.43272823,0.015094877,0.51523876,0.032590777,0.000065369175],"about_ca_topic_score_codex":0.0018020408,"about_ca_topic_score_gemma":0.0036610167,"teacher_disagreement_score":0.021678343,"about_ca_system_score_codex":0.0010901063,"about_ca_system_score_gemma":0.0009531942,"threshold_uncertainty_score":0.07252133},"labels":[],"label_agreement":null},{"id":"W1543182999","doi":"10.1007/3-540-46105-1_1","title":"Managing Specialization/Generalization HIerarchies","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Class hierarchy; Hierarchy; Programming language; Software engineering; Inheritance (genetic algorithm); Theoretical computer science; Knowledge representation and reasoning; Representation (politics); Object-oriented programming; Artificial intelligence","score_opus":0.012982148168356118,"score_gpt":0.22312318902564904,"score_spread":0.21014104085729293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543182999","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.17965816,0.0014787349,0.74297035,0.0017036787,0.00020243344,0.00038217448,0.0009266006,0.014343172,0.058334645],"genre_scores_gemma":[0.5740437,0.0009406972,0.39203247,0.0005368213,0.00016331005,0.0001483271,0.0022932212,0.002454214,0.027387226],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983078,0.0003085438,0.000145836,0.00028857694,0.0006072613,0.0003420024],"domain_scores_gemma":[0.9941876,0.0015951766,0.00034312095,0.002638708,0.0007650523,0.0004704302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022920729,0.0004644813,0.00071545533,0.0015539313,0.0013549648,0.0020453841,0.0017014568,0.0008357848,0.0068955626],"category_scores_gemma":[0.0068187993,0.00073243707,0.00088111364,0.0017394488,0.00093444117,0.005713235,0.00488133,0.001619076,0.0015574775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037563746,0.00034816208,0.011375123,0.00047278203,0.00016284976,0.0011846788,0.0027608091,0.017093424,0.025866617,0.1849902,0.038973723,0.716396],"study_design_scores_gemma":[0.00010418279,0.000148929,0.007866403,0.00037824688,0.00042154698,0.001895635,0.0019763364,0.29228038,0.04486919,0.44237557,0.20754842,0.00013519169],"about_ca_topic_score_codex":0.004008751,"about_ca_topic_score_gemma":0.00994504,"teacher_disagreement_score":0.0068955626,"about_ca_system_score_codex":0.00087731617,"about_ca_system_score_gemma":0.0014928522,"threshold_uncertainty_score":0.02306801},"labels":[],"label_agreement":null},{"id":"W1543201103","doi":"10.1007/978-3-642-13800-3_30","title":"Time-Bounded Sequential Parameter Optimization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Bounded function; Overhead (engineering); Focus (optics); Optimization problem; Discrete optimization; Algorithm; Mathematics","score_opus":0.013939214822209132,"score_gpt":0.2546079592798334,"score_spread":0.24066874445762423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543201103","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.0040288176,0.00031415894,0.98339903,0.00014515269,0.00010401789,0.000045032728,0.00007599226,0.00043939002,0.011448502],"genre_scores_gemma":[0.497504,0.0010141562,0.4660353,0.00035378322,0.00030519057,0.00057484105,0.0006050082,0.0011344701,0.03247332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906665,0.0002796604,0.00003910337,0.00017310723,0.00032649902,0.00011512714],"domain_scores_gemma":[0.99807346,0.0012836688,0.00010086486,0.00025955736,0.00021243854,0.000069884765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014445116,0.0026143254,0.0019277242,0.0005548585,0.00051419856,0.0011049033,0.001557069,0.0012105406,0.010540578],"category_scores_gemma":[0.005654774,0.0008154138,0.0008200251,0.0012987865,0.0009983971,0.0015593813,0.0021400515,0.0019995454,0.0020624304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029631576,0.00007366569,0.00016011478,0.00019957985,0.00004568226,0.00006952472,0.00005355052,0.8503747,0.003453277,0.040269066,0.008042543,0.096961975],"study_design_scores_gemma":[0.000020795245,0.00003541056,0.00004403399,0.000007897722,0.000008583621,0.000021565766,0.000006227749,0.9757722,0.0006594025,0.022057965,0.0013620076,0.0000038997614],"about_ca_topic_score_codex":0.0021833458,"about_ca_topic_score_gemma":0.0021139877,"teacher_disagreement_score":0.010540578,"about_ca_system_score_codex":0.00076953607,"about_ca_system_score_gemma":0.0010856206,"threshold_uncertainty_score":0.03526175},"labels":[],"label_agreement":null},{"id":"W1543215536","doi":"10.1007/978-3-642-02611-9_42","title":"Level Set Approaches and Adaptive Asymmetrical SVMs Applied for Nonideal Iris Recognition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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":"Concordia University","funders":"","keywords":"Computer science; Pattern recognition (psychology); Artificial intelligence; Support vector machine; Iris recognition; Wavelet; Segmentation; Feature extraction; Daubechies wavelet; Wavelet transform; Feature (linguistics); Biometrics; Wavelet packet decomposition","score_opus":0.12809400847391386,"score_gpt":0.27001393483039593,"score_spread":0.14191992635648207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543215536","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.005025706,0.00033177264,0.9934869,0.00006183754,0.0000472131,0.00001307624,0.000015269532,0.00016661445,0.0008515789],"genre_scores_gemma":[0.30423504,0.0008116124,0.6879922,0.000074805,0.00009838316,0.00007705675,0.0001212651,0.00016406806,0.006425519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.00016479097,0.00004680419,0.00009285161,0.00024345795,0.000041354608],"domain_scores_gemma":[0.9992061,0.0003389525,0.00006603,0.00012750286,0.00023306663,0.000028289674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010002328,0.00042572647,0.0007731145,0.00066080224,0.000303849,0.0013617092,0.0011820158,0.0008129335,0.002534694],"category_scores_gemma":[0.003079267,0.0003503923,0.000698657,0.0007712671,0.00057321874,0.001330849,0.0010453858,0.001401782,0.00083306717],"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.00022219626,0.00008704563,0.00069440244,0.00023404589,0.0000795792,0.00008832253,0.00013207542,0.2493651,0.027245421,0.06989088,0.0024790433,0.6494819],"study_design_scores_gemma":[0.0000018550201,0.000016345279,0.00017978427,0.000005334823,0.0000063669972,0.00003204501,0.000006887662,0.9897982,0.0026112832,0.0065456294,0.0007900017,0.000006216031],"about_ca_topic_score_codex":0.00080478034,"about_ca_topic_score_gemma":0.0010046815,"teacher_disagreement_score":0.002534694,"about_ca_system_score_codex":0.00048159398,"about_ca_system_score_gemma":0.00029234227,"threshold_uncertainty_score":0.008479357},"labels":[],"label_agreement":null},{"id":"W1543260786","doi":"10.1007/978-3-540-69423-6_43","title":"Cross-Modal Interaction and Integration with Relevance Feedback for Medical Image Retrieval","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relevance feedback; Image retrieval; Information retrieval; Automatic image annotation; Relevance (law); Modality (human–computer interaction); Visual Word; Set (abstract data type); Vector space model; XML; Modal; Matching (statistics); Similarity (geometry); Artificial intelligence; Image (mathematics); World Wide Web","score_opus":0.012374034496659402,"score_gpt":0.28144280282919565,"score_spread":0.26906876833253623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543260786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024512472,0.0028273254,0.96657336,0.00021544867,0.00018140988,0.00012102519,0.00013084846,0.0028789695,0.002559101],"genre_scores_gemma":[0.39430398,0.0013289239,0.595185,0.0003510171,0.00028427914,0.00031157766,0.00052190415,0.00042129986,0.0072919615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998852,0.00045409412,0.000057672874,0.0001494449,0.0004046164,0.00008218055],"domain_scores_gemma":[0.9987338,0.0007231236,0.000054213066,0.00011544076,0.00033831768,0.000035051828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018615538,0.0006289347,0.0008842996,0.00083651027,0.00028454562,0.00074358634,0.0008595326,0.0011496488,0.005270053],"category_scores_gemma":[0.003988933,0.000337086,0.0006846723,0.00079835893,0.00028321077,0.0014426901,0.0015258902,0.0006835343,0.001656623],"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.000928273,0.00031253567,0.00034382907,0.0003913156,0.000098081684,0.00012636937,0.0001803386,0.01399578,0.13031606,0.0018673377,0.0072764014,0.8441636],"study_design_scores_gemma":[0.00008665771,0.0006747352,0.0034107058,0.00005004833,0.0002049691,0.0007742475,0.000109698456,0.89588976,0.082901716,0.00728051,0.008535547,0.00008137378],"about_ca_topic_score_codex":0.001202094,"about_ca_topic_score_gemma":0.001995967,"teacher_disagreement_score":0.005270053,"about_ca_system_score_codex":0.00023577607,"about_ca_system_score_gemma":0.00026969146,"threshold_uncertainty_score":0.0176301},"labels":[],"label_agreement":null},{"id":"W1543318480","doi":"10.1007/978-3-642-05290-3_107","title":"Collaborative Building, Sharing and Handling of Graphs of Documents Using P2P File-Sharing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Computer science; File sharing; Schema (genetic algorithms); Graph; World Wide Web; Scheme (mathematics); Peer-to-peer; Information retrieval; Theoretical computer science; The Internet","score_opus":0.01692482159742105,"score_gpt":0.270441593447911,"score_spread":0.25351677185049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543318480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030006004,0.0002890382,0.95755404,0.00022083838,0.00006801097,0.00024335142,0.00036521378,0.006862491,0.0043911394],"genre_scores_gemma":[0.2429045,0.00049946195,0.74465877,0.000056423753,0.00007571835,0.00024335727,0.0014972475,0.0012465294,0.008817953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816495,0.00037716443,0.00014294559,0.00042636375,0.0007393587,0.00014924842],"domain_scores_gemma":[0.99226224,0.003213291,0.0003227844,0.0031000164,0.0006826322,0.00041896602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019163978,0.00096414937,0.0016415266,0.002727782,0.0021218876,0.003943273,0.0039664293,0.0015712033,0.004412821],"category_scores_gemma":[0.0076599135,0.0008030679,0.0016541169,0.004713526,0.0011156533,0.005168886,0.004743842,0.0015475582,0.0015502076],"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.0006071858,0.0005390662,0.0028585212,0.00080611004,0.00032622323,0.0018510981,0.0029606582,0.1085218,0.07052976,0.06603587,0.019404296,0.72555935],"study_design_scores_gemma":[0.00013376055,0.00020438283,0.0021716557,0.00007764217,0.00021871211,0.0013781916,0.0010560459,0.72123545,0.08125713,0.14115104,0.05092838,0.00018769376],"about_ca_topic_score_codex":0.005109253,"about_ca_topic_score_gemma":0.0057992786,"teacher_disagreement_score":0.005109253,"about_ca_system_score_codex":0.0008655257,"about_ca_system_score_gemma":0.0012689112,"threshold_uncertainty_score":0.014762402},"labels":[],"label_agreement":null},{"id":"W1543423052","doi":"10.1007/978-3-642-02962-2_77","title":"Learning Optimal Parameters in Decision-Theoretic Rough Sets","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":31,"is_retracted":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":"Rough set; Probabilistic logic; Computer science; Game theory; Sequence (biology); Decision theory; Set (abstract data type); Artificial intelligence; Mathematical optimization; Decision rule; Dominance-based rough set approach; Machine learning; Mathematics; Mathematical economics; Statistics","score_opus":0.014994984703735647,"score_gpt":0.2481218448490146,"score_spread":0.23312686014527895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543423052","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.014295232,0.0009910067,0.9830908,0.00023062513,0.000035179397,0.000031120795,0.000053073378,0.00012598166,0.0011469108],"genre_scores_gemma":[0.42987433,0.0018986281,0.5660408,0.00012580337,0.00014841069,0.00024206929,0.00029545912,0.00012222305,0.0012523432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958125,0.0021242383,0.0003590027,0.00056609715,0.0009554206,0.00018284237],"domain_scores_gemma":[0.98770845,0.010071387,0.00058243034,0.0009196568,0.00056990935,0.00014813461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007067649,0.0009358302,0.0029033595,0.001702024,0.00057962636,0.00351473,0.0021544553,0.001613191,0.0015847046],"category_scores_gemma":[0.029542664,0.0013228493,0.0014616478,0.0022173412,0.0026535278,0.0075027514,0.0022449475,0.0040703486,0.00034541602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015488233,0.00008255918,0.0007890713,0.0002610109,0.0001530687,0.00006111509,0.00032735945,0.5890131,0.0007173936,0.26467112,0.0014929106,0.14227644],"study_design_scores_gemma":[0.000016574557,0.00003191249,0.0001221568,0.000046975376,0.000026666548,0.000016694934,0.000032105472,0.58842564,0.00036134594,0.41032097,0.0005764558,0.000022573107],"about_ca_topic_score_codex":0.001591088,"about_ca_topic_score_gemma":0.0012983815,"teacher_disagreement_score":0.007067649,"about_ca_system_score_codex":0.0018283571,"about_ca_system_score_gemma":0.001001034,"threshold_uncertainty_score":0.037377775},"labels":[],"label_agreement":null},{"id":"W1543501759","doi":"10.1007/11427469_92","title":"A Dynamic Recurrent Neural Network Fault Diagnosis and Isolation Architecture for Satellite’s Actuator/Thruster Failures","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Artificial neural network; Fault detection and isolation; Fault (geology); Actuator; Real-time computing; Satellite; Architecture; Isolation (microbiology); Control theory (sociology); Control engineering; Artificial intelligence; Control (management); Engineering","score_opus":0.00903868970538825,"score_gpt":0.22693540525651096,"score_spread":0.21789671555112272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543501759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050893124,0.00053430104,0.94205225,0.00016934588,0.00011562005,0.000045454457,0.00007575826,0.0033514595,0.002762669],"genre_scores_gemma":[0.8651646,0.00019512871,0.12823549,0.00012315466,0.000062627165,0.000060481783,0.0001892759,0.000069683454,0.005899698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998503,0.00001756165,0.000011253839,0.000044206397,0.000052146865,0.000024488318],"domain_scores_gemma":[0.9997719,0.0000588064,0.000026164706,0.000034754394,0.00009703722,0.000011343064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034368757,0.0005278418,0.00053303875,0.00021700248,0.00027581846,0.00033689116,0.0012403451,0.00068177935,0.0024777646],"category_scores_gemma":[0.00054817717,0.00028622957,0.0003731786,0.0001388024,0.0002119674,0.00062160456,0.00045157378,0.00058520294,0.0004949867],"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.00040253473,0.00014288533,0.00062004494,0.00011896226,0.00010302054,0.000193816,0.00008143838,0.43005872,0.055232886,0.0029673579,0.0036770152,0.50640136],"study_design_scores_gemma":[0.0000096996055,0.00008318319,0.00022231658,0.0000040911614,0.000022500293,0.000030357336,0.0000036102028,0.9939486,0.004761391,0.0005298281,0.00037843012,0.0000059864997],"about_ca_topic_score_codex":0.007925184,"about_ca_topic_score_gemma":0.011800036,"teacher_disagreement_score":0.007925184,"about_ca_system_score_codex":0.00047942656,"about_ca_system_score_gemma":0.00048078096,"threshold_uncertainty_score":0.015758097},"labels":[],"label_agreement":null},{"id":"W1543571078","doi":"10.1007/11428848_49","title":"Simulating Market Dynamics with CD++","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Formalism (music); Purchasing; Dynamics (music); System dynamics; Computational science; Theoretical computer science; Distributed computing; Parallel computing; Simulation; Artificial intelligence; Modeling and simulation; Physics","score_opus":0.04182254400018608,"score_gpt":0.34164979979151466,"score_spread":0.2998272557913286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543571078","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.38444895,0.0004438186,0.5196132,0.0012523823,0.00062126445,0.0003414155,0.003485405,0.0076427767,0.0821507],"genre_scores_gemma":[0.80313474,0.00020023667,0.17622,0.00023755347,0.00006544182,0.00021940873,0.00073929364,0.00034010375,0.018843208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996724,0.00013085893,0.00001406304,0.000055922083,0.00008352725,0.00004324465],"domain_scores_gemma":[0.9977488,0.0016318583,0.00008602,0.00021262295,0.00020779205,0.000112912756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076343236,0.00042528982,0.00069812726,0.00034492734,0.0004428219,0.0012626703,0.0015773111,0.0013065726,0.019977963],"category_scores_gemma":[0.0041925316,0.00048909476,0.00037480614,0.00086187857,0.00044455958,0.0013469274,0.00076221034,0.0010553568,0.0013759788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003209036,0.0002146807,0.001348074,0.00008270855,0.00003201466,0.00008701458,0.000056485012,0.94365937,0.0011771831,0.023766655,0.005959945,0.023294989],"study_design_scores_gemma":[0.00006921314,0.000018487923,0.0000729562,0.000002419375,0.0000056756367,0.000013034938,0.000006601855,0.99285865,0.0007369272,0.0051782,0.0010337804,0.0000040255504],"about_ca_topic_score_codex":0.008292076,"about_ca_topic_score_gemma":0.005653118,"teacher_disagreement_score":0.019977963,"about_ca_system_score_codex":0.0006346143,"about_ca_system_score_gemma":0.0006535891,"threshold_uncertainty_score":0.0668329},"labels":[],"label_agreement":null},{"id":"W1543579282","doi":"10.1007/3-540-44842-x_17","title":"Two Factor Option Pricing with Uncertain Volatility","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stochastic volatility; Computer science; Volatility (finance); Valuation of options; Mathematical optimization; Partial differential equation; Nonlinear system; Applied mathematics; Econometrics; Mathematics","score_opus":0.028893741408452082,"score_gpt":0.23565140588510775,"score_spread":0.20675766447665567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543579282","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.09779544,0.0011061365,0.87727296,0.0010546793,0.0004003415,0.000035954377,0.00010091014,0.0003111371,0.021922406],"genre_scores_gemma":[0.92565787,0.00074931886,0.04505867,0.00008660914,0.00036034425,0.000031841948,0.00010839635,0.00007410553,0.027872784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964297,0.00010926513,0.000021267026,0.000058796297,0.00012399287,0.000043785752],"domain_scores_gemma":[0.99880767,0.00071337284,0.000110981935,0.00015252204,0.0001093687,0.00010603391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010429958,0.0010302106,0.0009413522,0.0004241402,0.0002728137,0.0020033398,0.00085846777,0.0020401815,0.006707249],"category_scores_gemma":[0.00480688,0.00044126742,0.0010015044,0.0006549447,0.00075848826,0.003449289,0.00088102673,0.0015359385,0.0005204379],"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.00032281748,0.00008972237,0.0007781712,0.00009147131,0.0000839983,0.0009919611,0.00009930111,0.20539896,0.005243541,0.73833054,0.00265768,0.04591191],"study_design_scores_gemma":[0.000041326224,0.000042965145,0.0002613403,0.0000062507797,0.000016234611,0.00023929136,0.000008379621,0.68331766,0.0005256451,0.31422657,0.001287078,0.00002732088],"about_ca_topic_score_codex":0.00039169268,"about_ca_topic_score_gemma":0.00022922941,"teacher_disagreement_score":0.006707249,"about_ca_system_score_codex":0.00040597375,"about_ca_system_score_gemma":0.00023524479,"threshold_uncertainty_score":0.02243799},"labels":[],"label_agreement":null},{"id":"W1543581404","doi":"10.1007/978-3-540-76386-4_50","title":"Spatiotemporal Oriented Energy Features for Visual Tracking","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":33,"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":"BitTorrent tracker; Computer science; Artificial intelligence; Clutter; Tracking (education); Computer vision; Eye tracking; Set (abstract data type); Feature (linguistics); Orientation (vector space); Video tracking; Energy (signal processing); Estimator; Pattern recognition (psychology); Mathematics; Object (grammar)","score_opus":0.034631170678768274,"score_gpt":0.32310466603994215,"score_spread":0.2884734953611739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543581404","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.007355747,0.0008893756,0.9895438,0.000048482434,0.00006256091,0.000018016837,0.00018585678,0.0004988645,0.0013972686],"genre_scores_gemma":[0.312305,0.00252823,0.67113,0.00009475123,0.00016294022,0.0001392871,0.0013570935,0.00054528273,0.011737348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998869,0.000014855414,0.000008331599,0.00003093829,0.00004715218,0.000011764472],"domain_scores_gemma":[0.9998056,0.00007208543,0.000023187155,0.0000470271,0.000044535493,0.0000074178124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022287275,0.00046820487,0.0006224496,0.00074360264,0.00016574567,0.00069690606,0.00064369664,0.0005056657,0.0029917008],"category_scores_gemma":[0.0010649342,0.00026401549,0.00034045565,0.0016871266,0.00021231652,0.0012074094,0.00062149117,0.00053494214,0.0010530725],"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.00017977774,0.00005956028,0.00039581725,0.00013713248,0.000042755153,0.00007507328,0.000035588135,0.054676022,0.04648992,0.02725301,0.0059305644,0.8647247],"study_design_scores_gemma":[0.000014435883,0.00005672277,0.0017594767,0.000029567756,0.000032529624,0.00020210212,0.000026948772,0.93715936,0.018853322,0.03248433,0.009356424,0.000024809142],"about_ca_topic_score_codex":0.0008856019,"about_ca_topic_score_gemma":0.0011696228,"teacher_disagreement_score":0.0029917008,"about_ca_system_score_codex":0.00024361232,"about_ca_system_score_gemma":0.00013827109,"threshold_uncertainty_score":0.0100082755},"labels":[],"label_agreement":null},{"id":"W1543778886","doi":"10.1007/978-3-642-13388-6_44","title":"How Adaptive Is an Expert Human Tutor?","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Medical Council of Canada","funders":"","keywords":"TUTOR; Computer science; Perspective (graphical); Coding (social sciences); Artificial intelligence; Mathematics education; Human–computer interaction; Programming language; Psychology; Mathematics","score_opus":0.03932559985533425,"score_gpt":0.2680833217918474,"score_spread":0.22875772193651317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543778886","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.4218093,0.010443481,0.16863136,0.07170939,0.0017612223,0.00010659074,0.00025095657,0.001679546,0.32360816],"genre_scores_gemma":[0.969993,0.0015452185,0.012684042,0.0020764,0.00028936384,0.000027888036,0.000084723615,0.000088932626,0.013210496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977677,0.0011742321,0.00008896088,0.00041269755,0.00038083963,0.00017553702],"domain_scores_gemma":[0.9927973,0.0033703698,0.0005220653,0.00061877276,0.0014484683,0.0012430296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911395,0.0003149468,0.00029362133,0.00070726214,0.0006764318,0.0037426546,0.0009866266,0.0029305946,0.0057512415],"category_scores_gemma":[0.025056178,0.00017472735,0.00016340938,0.00047927027,0.0020114072,0.008463239,0.0014007625,0.0011393457,0.0024977126],"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.00048518262,0.00039125455,0.059460945,0.00041690754,0.00017213517,0.0009207465,0.01320014,0.0074025025,0.00695418,0.105309494,0.044051897,0.76123464],"study_design_scores_gemma":[0.00010458947,0.0008593853,0.05099837,0.00071722,0.00036820973,0.0075638713,0.03561469,0.06272087,0.015623247,0.57635725,0.2487563,0.00031596873],"about_ca_topic_score_codex":0.00069237675,"about_ca_topic_score_gemma":0.00059758703,"teacher_disagreement_score":0.0057512415,"about_ca_system_score_codex":0.0005733597,"about_ca_system_score_gemma":0.0005360278,"threshold_uncertainty_score":0.019239843},"labels":[],"label_agreement":null},{"id":"W1543832863","doi":"10.1007/978-3-540-79721-0_22","title":"Game-Theoretic Risk Analysis in Decision-Theoretic Rough Sets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Stochastic game; Rough set; Probabilistic logic; Game theory; Computer science; Set (abstract data type); Mathematics; Mathematical economics; Mathematical optimization; Artificial intelligence","score_opus":0.011433649011573227,"score_gpt":0.24146010011863134,"score_spread":0.2300264511070581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543832863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015255663,0.003548514,0.9584481,0.0020605233,0.00019610432,0.00005740608,0.00009897913,0.000060887687,0.020273937],"genre_scores_gemma":[0.80681825,0.005264121,0.17110299,0.00038119513,0.00082454534,0.00029956695,0.0001840576,0.000095978365,0.015029263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945821,0.0032881591,0.00021485201,0.0003306196,0.0012638692,0.00032033716],"domain_scores_gemma":[0.99029326,0.008022492,0.00041206312,0.0004509612,0.0005572569,0.0002639933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067376685,0.0015564656,0.0024215425,0.0015850367,0.00096624513,0.006015653,0.0025995949,0.0020123587,0.003717016],"category_scores_gemma":[0.014708975,0.0010558884,0.002240945,0.0020261016,0.004060847,0.006808215,0.0024901726,0.0049097463,0.00038238903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001227825,0.000020293146,0.000102314414,0.00006139424,0.00004180898,0.000031965756,0.00009668899,0.0420671,0.00012674776,0.9521832,0.000724585,0.004531612],"study_design_scores_gemma":[0.000005137708,0.000010874578,0.00006645794,0.000020830292,0.000013882849,0.000016248336,0.000027515187,0.08065655,0.000048950467,0.91825575,0.0008667014,0.000011168744],"about_ca_topic_score_codex":0.0018658974,"about_ca_topic_score_gemma":0.001285158,"teacher_disagreement_score":0.0067376685,"about_ca_system_score_codex":0.0038333521,"about_ca_system_score_gemma":0.0014252327,"threshold_uncertainty_score":0.03563261},"labels":[],"label_agreement":null},{"id":"W1543857878","doi":"10.1007/978-3-540-30136-3_125","title":"Automatic Detection and Removal of Fiducial Markers Embedded in Fluoroscopy Images for Online Calibration","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fiducial marker; Computer science; Fluoroscopy; Calibration; Computer vision; Grid; Artificial intelligence; Process (computing); Brachytherapy; Radiology; Medicine; Radiation therapy; Mathematics; Geometry","score_opus":0.015929620270165968,"score_gpt":0.30363215868310434,"score_spread":0.28770253841293836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543857878","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.016865209,0.00094775425,0.9789282,0.000082762475,0.00009628123,0.000029343568,0.000054261276,0.0020182338,0.0009779581],"genre_scores_gemma":[0.16751257,0.00085169077,0.8246338,0.00014827275,0.000063833446,0.000057896574,0.00031077408,0.00065048825,0.0057707005],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932086,0.00008399264,0.000035643705,0.00012936191,0.0003693781,0.000060758746],"domain_scores_gemma":[0.9984193,0.0005777093,0.0001587451,0.00042072107,0.00038744046,0.000036039986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006093366,0.00088906917,0.0007792424,0.0009771563,0.0003104847,0.0010057718,0.0016582239,0.001598117,0.0032128552],"category_scores_gemma":[0.002655439,0.0007134532,0.0005525518,0.00066193397,0.0003632625,0.0010328261,0.0011298335,0.0009939366,0.0023506696],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027815963,0.000065174274,0.00044253207,0.00016946532,0.000031165386,0.00011334715,0.00010888603,0.0041995645,0.38926935,0.001557202,0.0025905368,0.60117453],"study_design_scores_gemma":[0.000036026282,0.00019360513,0.0050062924,0.00007142673,0.00010150856,0.0025357811,0.00004305975,0.1680071,0.80644476,0.0022935783,0.015187824,0.00007901213],"about_ca_topic_score_codex":0.0005675026,"about_ca_topic_score_gemma":0.0012014785,"teacher_disagreement_score":0.0032128552,"about_ca_system_score_codex":0.00025563544,"about_ca_system_score_gemma":0.00045534997,"threshold_uncertainty_score":0.010748088},"labels":[],"label_agreement":null},{"id":"W1543918438","doi":"10.1007/978-3-540-71457-6_51","title":"Classification of Facial Expressions Using K-Nearest Neighbor Classifier","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Artificial intelligence; Classifier (UML); Pattern recognition (psychology); Facial expression; Computer science; Computer vision; Feature vector; k-nearest neighbors algorithm; Feature (linguistics); Face (sociological concept); Support vector machine; Point (geometry); Mathematics","score_opus":0.07209120055610711,"score_gpt":0.30398888908995286,"score_spread":0.23189768853384574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543918438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2274804,0.0020183688,0.75301355,0.00018916983,0.00053189235,0.0004421006,0.0009837144,0.0033899213,0.011950869],"genre_scores_gemma":[0.6676352,0.0015548724,0.31317768,0.00010351664,0.00011398804,0.00028944848,0.0017612401,0.0001560387,0.015208033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.00006255366,0.000038824972,0.00014979392,0.0002794953,0.00008562164],"domain_scores_gemma":[0.99964523,0.00006650795,0.000018636889,0.000030815896,0.00022186556,0.000016996062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195757,0.00045071132,0.0010982712,0.0009555352,0.0004123798,0.0005572261,0.0005674379,0.00049547385,0.002771854],"category_scores_gemma":[0.0007214614,0.00017140557,0.0006638416,0.0008513648,0.00021371245,0.00057654665,0.00029498382,0.00042445367,0.0024159923],"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.00033605975,0.00016277932,0.0030171166,0.00012396027,0.000052714022,0.00009355228,0.00007800441,0.004290975,0.064396955,0.0005542506,0.0033836248,0.9235099],"study_design_scores_gemma":[0.000041277788,0.0004998532,0.03386795,0.00009740983,0.00018324167,0.0011531747,0.00044951306,0.8677157,0.08767615,0.0014725702,0.006746581,0.00009655698],"about_ca_topic_score_codex":0.0034000054,"about_ca_topic_score_gemma":0.0036804983,"teacher_disagreement_score":0.0034000054,"about_ca_system_score_codex":0.00028439186,"about_ca_system_score_gemma":0.00040572323,"threshold_uncertainty_score":0.009272754},"labels":[],"label_agreement":null},{"id":"W1543956695","doi":"10.1007/3-540-44886-1_46","title":"Motion Recognition from Video Sequences","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Guelph","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Motion (physics); Pattern recognition (psychology); Feature (linguistics); Enhanced Data Rates for GSM Evolution; Sequence (biology); Image (mathematics)","score_opus":0.026603774974495516,"score_gpt":0.2633477211230016,"score_spread":0.23674394614850608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543956695","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.016579809,0.0022051635,0.970634,0.00012297442,0.00016117764,0.000105032836,0.0006262139,0.0035182468,0.0060473075],"genre_scores_gemma":[0.17795321,0.0057907235,0.7684263,0.00019504181,0.00024542733,0.00014404143,0.00613628,0.00043621872,0.040672738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998747,0.00000867841,0.000007686344,0.00004445302,0.00004807916,0.000016498141],"domain_scores_gemma":[0.9998988,0.000020350762,0.000015499785,0.000022893482,0.00003486358,0.000007693959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013155247,0.0007309163,0.00067600264,0.0013754764,0.00016485924,0.000560481,0.000567004,0.00052071846,0.005463463],"category_scores_gemma":[0.00050171773,0.00029033076,0.00046168198,0.0012381119,0.00018774281,0.00069104054,0.00035284756,0.00036649223,0.0045042494],"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.00008035604,0.000028021603,0.00023739197,0.00013978944,0.000023834666,0.000073761075,0.000019239598,0.00524853,0.122604504,0.0018074295,0.0049762437,0.864761],"study_design_scores_gemma":[0.000032601878,0.00029287374,0.007235469,0.00015999621,0.000115555486,0.0014114132,0.0001055731,0.50862443,0.4168938,0.009598983,0.055468556,0.000060741677],"about_ca_topic_score_codex":0.0016062625,"about_ca_topic_score_gemma":0.0025415898,"teacher_disagreement_score":0.005463463,"about_ca_system_score_codex":0.00016813204,"about_ca_system_score_gemma":0.00017871261,"threshold_uncertainty_score":0.018277049},"labels":[],"label_agreement":null},{"id":"W1543976631","doi":"10.1007/978-3-540-30132-5_158","title":"Policies, Rules and Their Engines: What do They Mean for SLAs?","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Service level; Embodied cognition; Position (finance); Service (business); Ideal (ethics); Operations research; Artificial intelligence; Law; Political science; Finance; Business; Economics; Economy","score_opus":0.01668912686725806,"score_gpt":0.2646845172959174,"score_spread":0.24799539042865934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543976631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037681147,0.07749888,0.56517154,0.14844525,0.00494761,0.00017090219,0.0011641725,0.0015663414,0.16335417],"genre_scores_gemma":[0.6688368,0.03801141,0.23727639,0.009720414,0.0048729307,0.0005909399,0.00086866843,0.00069286616,0.03912965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961511,0.0016071143,0.00028746095,0.00054484006,0.0008934631,0.00051601004],"domain_scores_gemma":[0.98791504,0.0074844677,0.0009670552,0.0015804045,0.0012304859,0.0008225883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008331471,0.00091167685,0.0016483599,0.0016426452,0.0022950494,0.017338507,0.0025917804,0.005488522,0.011184204],"category_scores_gemma":[0.022459932,0.0013590073,0.001141407,0.003787528,0.010807702,0.045766473,0.0024151006,0.0070513817,0.0030596547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031765074,0.000030989166,0.00037828542,0.00014963938,0.000025505558,0.000025765561,0.00048387455,0.00095075276,0.00013348417,0.9598666,0.0060359538,0.03188746],"study_design_scores_gemma":[0.000011086442,0.000014317864,0.00030379897,0.0001578075,0.000026039046,0.000063100466,0.00034435964,0.0045720353,0.00010410097,0.9758915,0.018488241,0.000023720333],"about_ca_topic_score_codex":0.0031347687,"about_ca_topic_score_gemma":0.0022808718,"teacher_disagreement_score":0.017338507,"about_ca_system_score_codex":0.0026292396,"about_ca_system_score_gemma":0.0034920056,"threshold_uncertainty_score":0.0440616},"labels":[],"label_agreement":null},{"id":"W1543993108","doi":"10.1007/978-3-540-87827-8_2","title":"Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Monic polynomial; Quartic function; Algebraic expression; Mathematics; Degree (music); Polynomial; Algebraic number; Simple (philosophy); Parametric statistics; Matrix polynomial; Upper and lower bounds; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.015018283156053209,"score_gpt":0.22590070869242884,"score_spread":0.21088242553637562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543993108","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.011276899,0.00044824564,0.9767696,0.00023374544,0.000060839062,0.000022786793,0.00007770436,0.0002259021,0.01088421],"genre_scores_gemma":[0.36452317,0.00093583635,0.61449414,0.00015392128,0.00018945102,0.00014139908,0.0003371891,0.0007276654,0.018497255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993374,0.00020723717,0.000022718035,0.0001490669,0.000222511,0.000061036255],"domain_scores_gemma":[0.9983871,0.0010964372,0.00006966116,0.00029205493,0.00011156968,0.000043223743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009873135,0.0012050316,0.0015175114,0.00046829524,0.0005603934,0.0015335133,0.0016395093,0.0015098808,0.006899341],"category_scores_gemma":[0.0068570105,0.0007822452,0.00077840453,0.0012043071,0.0015362706,0.0035675752,0.0022612615,0.002409487,0.0011532843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017280759,0.00011003999,0.000298966,0.0004776657,0.000054671884,0.00009707643,0.000120862314,0.585305,0.0035702141,0.20541944,0.008345244,0.19602801],"study_design_scores_gemma":[0.000012354437,0.0000290479,0.00008707479,0.000016627377,0.00001034414,0.0000646478,0.000029313498,0.9012866,0.00090321334,0.09519242,0.0023583255,0.000010068255],"about_ca_topic_score_codex":0.0014211702,"about_ca_topic_score_gemma":0.0027235576,"teacher_disagreement_score":0.006899341,"about_ca_system_score_codex":0.0006675225,"about_ca_system_score_gemma":0.0008721078,"threshold_uncertainty_score":0.023080528},"labels":[],"label_agreement":null},{"id":"W1544144575","doi":"10.1007/3-540-44652-4_45","title":"On Computing Solutions to Belief Change Scenarios","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Belief revision; Axiom; Computer science; Belief structure; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.040444093220440715,"score_gpt":0.2623968201497717,"score_spread":0.22195272692933102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544144575","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048905503,0.0020792421,0.9060627,0.0048110844,0.00032784208,0.0007268277,0.0013605243,0.002360812,0.033365417],"genre_scores_gemma":[0.386696,0.0013496813,0.5997443,0.0006978991,0.0002625779,0.00060562865,0.002915762,0.00031343833,0.0074147116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702686,0.0011007547,0.00028092688,0.00063192396,0.0005965007,0.00036296976],"domain_scores_gemma":[0.98939383,0.008177064,0.00035913876,0.0010910188,0.00065081636,0.00032809915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033741966,0.0017087717,0.00197612,0.0033662205,0.0023331717,0.0058521824,0.0039923843,0.0035478366,0.018625066],"category_scores_gemma":[0.026988365,0.0009792588,0.0023893374,0.004649958,0.003978542,0.014954839,0.006508153,0.003323306,0.0017629033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069850235,0.00026463062,0.0017635658,0.00058466225,0.00014858518,0.00018863672,0.00086572324,0.18206772,0.0008804032,0.56519675,0.017176112,0.2301647],"study_design_scores_gemma":[0.00004822938,0.000036278176,0.00014755824,0.00006006154,0.000037158294,0.000052517164,0.00024788704,0.21710922,0.00040603816,0.77908874,0.0027505076,0.0000158756],"about_ca_topic_score_codex":0.0057489136,"about_ca_topic_score_gemma":0.007781291,"teacher_disagreement_score":0.018625066,"about_ca_system_score_codex":0.00225969,"about_ca_system_score_gemma":0.0014891877,"threshold_uncertainty_score":0.062307},"labels":[],"label_agreement":null},{"id":"W1544223034","doi":"10.1007/3-540-47922-8_2","title":"AERO: An Outsourced Approach to Exception Handling in Multi-agent Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sketch; Exception handling; Host (biology); Outsourcing; Work (physics); Multi-agent system; Computer security; Service (business); Distributed computing; Artificial intelligence; Operating system; Business; Engineering","score_opus":0.06323396977989709,"score_gpt":0.2663961588240794,"score_spread":0.20316218904418232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544223034","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.006348591,0.00023797079,0.98004615,0.00021020585,0.00014835245,0.00012896425,0.00010494502,0.0069663515,0.0058085304],"genre_scores_gemma":[0.19043349,0.00074119115,0.78378034,0.0004089124,0.00023555815,0.00030614968,0.00067021634,0.0030734194,0.0203507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767476,0.00053066603,0.00017932898,0.00023924388,0.001117097,0.00025881582],"domain_scores_gemma":[0.99699736,0.0006940767,0.00019319296,0.001568285,0.00033506862,0.00021198699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028731728,0.00082487264,0.001327304,0.00057951093,0.0010479509,0.003547771,0.003661422,0.0009982759,0.008043195],"category_scores_gemma":[0.0043745167,0.0011264982,0.0011110716,0.00094329077,0.0014859736,0.004581691,0.0043152906,0.0028290905,0.0015407732],"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.0010755106,0.00036456418,0.0014818575,0.00070279936,0.0002241813,0.0008182845,0.0015792473,0.09542431,0.017412217,0.2149193,0.03346502,0.6325328],"study_design_scores_gemma":[0.00033335565,0.00022781406,0.0010323296,0.0001353573,0.00017292678,0.0005666008,0.0002858644,0.7020351,0.023316087,0.15044397,0.12133165,0.000118972064],"about_ca_topic_score_codex":0.0024259412,"about_ca_topic_score_gemma":0.0030625928,"teacher_disagreement_score":0.008043195,"about_ca_system_score_codex":0.0006817225,"about_ca_system_score_gemma":0.0017607864,"threshold_uncertainty_score":0.026907206},"labels":[],"label_agreement":null},{"id":"W1544240449","doi":"10.1007/3-540-45486-1_4","title":"Using Noun Phrase Heads to Extract Document Keyphrases","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":236,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Noun phrase; Automatic summarization; Natural language processing; Artificial intelligence; Phrase; Task (project management); Extractor; Head (geology); Noun; Proper noun; Information retrieval; Linguistics","score_opus":0.025876714810008236,"score_gpt":0.31183386811917013,"score_spread":0.2859571533091619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544240449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06625529,0.0034909656,0.84257656,0.0005862986,0.00085359416,0.0009565554,0.017655872,0.052351974,0.015272913],"genre_scores_gemma":[0.14528714,0.0028402237,0.80033666,0.00022407279,0.0004122438,0.0004819517,0.028722776,0.00375346,0.017941535],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933475,0.00005795266,0.000086231616,0.00020134854,0.00023721352,0.00008243225],"domain_scores_gemma":[0.9964753,0.0014048143,0.00031023961,0.00030165733,0.0013566046,0.00015135843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070029055,0.0019519504,0.0011969587,0.0060499785,0.0010443765,0.0027988807,0.0007317809,0.0010575624,0.011895568],"category_scores_gemma":[0.0036693073,0.0008113304,0.0010602408,0.004638606,0.000534061,0.003023813,0.0012792886,0.0013261448,0.021410199],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063154224,0.00011223633,0.002544596,0.0017350015,0.00009180542,0.0011761172,0.0008391306,0.0008613307,0.20140679,0.004592314,0.02451679,0.76149243],"study_design_scores_gemma":[0.00030181298,0.00095262524,0.026042748,0.00064731296,0.0008528254,0.0052169473,0.0034621167,0.108234055,0.56359565,0.029953659,0.26029733,0.00044288937],"about_ca_topic_score_codex":0.002821813,"about_ca_topic_score_gemma":0.0039766436,"teacher_disagreement_score":0.011895568,"about_ca_system_score_codex":0.00064197567,"about_ca_system_score_gemma":0.0015433516,"threshold_uncertainty_score":0.039794624},"labels":[],"label_agreement":null},{"id":"W1544301742","doi":"10.1007/3-540-46000-4_6","title":"Coordination through Channel Composition","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":58,"is_retracted":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":"Cable gland; Component (thermodynamics); Computer science; Channel (broadcasting); Composition (language); Set (abstract data type); Expressive power; Distributed computing; Theoretical computer science; Programming language; Computer network; Telecommunications; Linguistics; Physics","score_opus":0.027297080894703302,"score_gpt":0.24554873753222553,"score_spread":0.21825165663752222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544301742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015518805,0.00072077377,0.8048378,0.0012616342,0.0008203513,0.00014880598,0.00031963454,0.0040370794,0.17233521],"genre_scores_gemma":[0.5384336,0.0015159259,0.306084,0.0009367191,0.00060224853,0.00054449396,0.0010954642,0.0030858673,0.14770171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997647,0.0006145365,0.00014646357,0.00069096574,0.0004946185,0.00040632178],"domain_scores_gemma":[0.9973636,0.0009206738,0.00013655906,0.00094731216,0.00037765517,0.00025412568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670977,0.00086056895,0.000951241,0.0013045936,0.0028597943,0.0057002506,0.0017786049,0.0014056212,0.03153536],"category_scores_gemma":[0.0054815197,0.00091765,0.0011049834,0.001604652,0.00311574,0.009587848,0.005074564,0.0027007177,0.0074474667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010960563,0.000040196108,0.00017362044,0.00006300019,0.000016386442,0.00010044807,0.0003171559,0.0023166796,0.002387664,0.9539538,0.007569329,0.032952126],"study_design_scores_gemma":[0.000041146057,0.000025162155,0.0001032477,0.000051962965,0.000037493683,0.00016821701,0.00012947655,0.019691106,0.0060398825,0.9215811,0.05209954,0.000031748667],"about_ca_topic_score_codex":0.002333407,"about_ca_topic_score_gemma":0.0028103655,"teacher_disagreement_score":0.03153536,"about_ca_system_score_codex":0.0013992158,"about_ca_system_score_gemma":0.0019109572,"threshold_uncertainty_score":0.10549629},"labels":[],"label_agreement":null},{"id":"W1544328073","doi":"10.1007/3-540-44472-6_29","title":"Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computation; Database transaction; Distributed computing; Concurrency control; Cache; State (computer science); Concurrency; Parallel computing; Database; Algorithm","score_opus":0.010775949276477044,"score_gpt":0.23718565007381281,"score_spread":0.22640970079733577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544328073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10709699,0.0014355489,0.87786126,0.00028428895,0.00018799692,0.0000998846,0.00006270034,0.004479364,0.008491981],"genre_scores_gemma":[0.8698292,0.00030244797,0.12484204,0.00007499739,0.000068829286,0.000070729,0.00008468206,0.00036688914,0.0043602064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987043,0.00019794851,0.00010453251,0.00017222618,0.0005433481,0.00027757708],"domain_scores_gemma":[0.99731785,0.0007881663,0.00017686891,0.0011217844,0.0003784642,0.00021690819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018776354,0.0005452374,0.0006806906,0.0004668886,0.00083890295,0.0023791704,0.0021698847,0.0006398735,0.002181976],"category_scores_gemma":[0.004358488,0.00090314855,0.0003583379,0.0005526672,0.0009101749,0.0027519176,0.0026248954,0.001501441,0.00068526046],"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.002314452,0.00044617415,0.005074418,0.00027727798,0.00014251901,0.00057467166,0.001728436,0.16667068,0.107482105,0.093755454,0.0051048105,0.61642903],"study_design_scores_gemma":[0.0002108569,0.0003461354,0.0012627295,0.00008081025,0.00014173244,0.00037855736,0.00032719743,0.85219914,0.0549749,0.07017867,0.019780789,0.00011852979],"about_ca_topic_score_codex":0.0014659342,"about_ca_topic_score_gemma":0.0028256476,"teacher_disagreement_score":0.0023791704,"about_ca_system_score_codex":0.00041065863,"about_ca_system_score_gemma":0.00083669205,"threshold_uncertainty_score":0.009930015},"labels":[],"label_agreement":null},{"id":"W1544461837","doi":"10.1007/3-540-36086-7_13","title":"Evaluation of Migration Strategies for Mobile Agents in Network Routing","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network","score_opus":0.05282371917765464,"score_gpt":0.2921168886073935,"score_spread":0.23929316942973886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544461837","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.88159144,0.0024854096,0.10446237,0.0004935208,0.00020004118,0.0004141579,0.00015217676,0.0006338949,0.009567056],"genre_scores_gemma":[0.97651833,0.00025395906,0.022277642,0.000020948024,0.000016479122,0.000060508326,0.00006803057,0.000036396184,0.0007475638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971591,0.0017655657,0.00013368961,0.00019022537,0.0004585081,0.00029288683],"domain_scores_gemma":[0.9804554,0.015854733,0.0007085204,0.0007897922,0.0017591356,0.0004323678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052595222,0.0013398705,0.0010778424,0.0014751225,0.0006743756,0.0012202837,0.0013446971,0.0013062336,0.0017103114],"category_scores_gemma":[0.017983532,0.00031998544,0.00047045067,0.000982782,0.0008308791,0.0016127796,0.00068680214,0.0005582793,0.00017319534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027804936,0.0008077515,0.004007022,0.00028476949,0.00013649116,0.0000657554,0.00012376707,0.87985426,0.005022127,0.00512744,0.0010469258,0.10074315],"study_design_scores_gemma":[0.000094114206,0.0007841796,0.0006255096,0.000015751733,0.00008940865,0.000028651575,0.00009359872,0.99428034,0.0024917088,0.0012586325,0.0002284465,0.000009610035],"about_ca_topic_score_codex":0.004972344,"about_ca_topic_score_gemma":0.0036947026,"teacher_disagreement_score":0.0052595222,"about_ca_system_score_codex":0.002149477,"about_ca_system_score_gemma":0.0012605211,"threshold_uncertainty_score":0.027815402},"labels":[],"label_agreement":null},{"id":"W1544469572","doi":"10.1007/978-3-540-30125-7_18","title":"An Effective Detail Preserving Filter for Impulse Noise Removal","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Impulse noise; Median filter; Computer science; Filter (signal processing); Salt-and-pepper noise; Noise (video); Pixel; Algorithm; Linear filter; Impulse (physics); Mathematics; Artificial intelligence; Computer vision; Image (mathematics); Image processing; Physics","score_opus":0.018477427557943706,"score_gpt":0.2856261887110862,"score_spread":0.2671487611531425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544469572","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.009079127,0.00057765224,0.98782176,0.000051554616,0.00009019695,0.00001398846,0.000032276548,0.00032065055,0.0020128144],"genre_scores_gemma":[0.104219005,0.0014239276,0.8772067,0.00016468811,0.00020138753,0.00003610094,0.00016782423,0.00018395466,0.0163964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998598,0.000013609798,0.0000058500186,0.000024239102,0.00008435961,0.000012093543],"domain_scores_gemma":[0.9998349,0.000059908296,0.000012626342,0.000031985357,0.00004709805,0.000013516677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001870308,0.00052226864,0.0004697597,0.00037444205,0.00019039771,0.00043391495,0.000443752,0.000774933,0.002868795],"category_scores_gemma":[0.00041182377,0.00024628473,0.00051119406,0.00040642,0.00022686637,0.0007064867,0.00036781986,0.0006605029,0.0010430223],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026745218,0.00008498217,0.00017101492,0.00022442453,0.000054855536,0.0002547097,0.000075055315,0.02163078,0.53279793,0.017949443,0.0037238498,0.42276555],"study_design_scores_gemma":[0.00005223626,0.00038836227,0.0015365726,0.000033574153,0.0001869037,0.001814768,0.000034493314,0.65847325,0.28319424,0.013270338,0.04095259,0.00006262986],"about_ca_topic_score_codex":0.0003534836,"about_ca_topic_score_gemma":0.00082569174,"teacher_disagreement_score":0.002868795,"about_ca_system_score_codex":0.00015124775,"about_ca_system_score_gemma":0.00019798588,"threshold_uncertainty_score":0.009597123},"labels":[],"label_agreement":null},{"id":"W1544510803","doi":"10.1007/978-3-540-25929-9_44","title":"Towards Jointree Propagation with Conditional Probability Distributions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"A priori and a posteriori; Computation; Salient; Computer science; Feature (linguistics); Conditional probability; Conditional probability distribution; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Statistics","score_opus":0.02297637060075111,"score_gpt":0.24126406940708833,"score_spread":0.21828769880633722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544510803","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.0005674798,0.0000770979,0.998418,0.00004669277,0.00001403096,0.000010609139,0.000032116208,0.0002396958,0.00059427856],"genre_scores_gemma":[0.035624158,0.0006137442,0.95794857,0.00017147516,0.00010061929,0.00011274061,0.0004887347,0.0005253621,0.0044146213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976647,0.0009057027,0.00012318384,0.00043421812,0.00073809474,0.00013413384],"domain_scores_gemma":[0.99205846,0.005087888,0.00028705446,0.0014217987,0.00097398733,0.00017086521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488849,0.0013971751,0.0017884123,0.0023704907,0.0010732572,0.003049029,0.004246627,0.002308904,0.005974984],"category_scores_gemma":[0.016509848,0.002345924,0.0026628028,0.0035352025,0.0019920592,0.006591954,0.0058799284,0.0041052187,0.0030426334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121091856,0.00008942363,0.0005971735,0.00026075222,0.00013673173,0.00013475961,0.00044246358,0.25813738,0.0019924757,0.45454952,0.009241454,0.27429682],"study_design_scores_gemma":[0.000014757696,0.000009767758,0.000078047065,0.00003334047,0.000025023994,0.00005778698,0.000019427192,0.63158,0.0008806603,0.3615276,0.005757679,0.000015992737],"about_ca_topic_score_codex":0.008524616,"about_ca_topic_score_gemma":0.010576904,"teacher_disagreement_score":0.008524616,"about_ca_system_score_codex":0.00130885,"about_ca_system_score_gemma":0.0014135622,"threshold_uncertainty_score":0.023739636},"labels":[],"label_agreement":null},{"id":"W1544588077","doi":"10.1007/978-3-642-14785-2_12","title":"Data Aggregation Integrity Based on Homomorphic Primitives in Sensor Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Homomorphic encryption; Base station; Computer network; Node (physics); Wireless sensor network; Key (lock); Payload (computing); Scheme (mathematics); Message authentication code; Data aggregator; Public-key cryptography; Hash function; Computation; Aggregate (composite); Data integrity; Distributed computing; Encryption; Computer security; Cryptography; Network packet; Algorithm","score_opus":0.033157265553286686,"score_gpt":0.2631973923589797,"score_spread":0.23004012680569302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544588077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03254516,0.0020129343,0.9488831,0.00062517554,0.00023367742,0.00009791858,0.00008019955,0.0010908393,0.014430964],"genre_scores_gemma":[0.7487788,0.0026307602,0.23426382,0.000255268,0.00042542172,0.00023464508,0.00024350226,0.000354113,0.012813779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99715567,0.0007807443,0.00020335395,0.0003301894,0.00133935,0.00019072753],"domain_scores_gemma":[0.9955746,0.0015820203,0.00023581127,0.0021630172,0.0003717021,0.000072885305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022972375,0.00057317526,0.0011095924,0.0007575639,0.00086791354,0.002726569,0.0014908101,0.0009669173,0.0018807718],"category_scores_gemma":[0.0043803398,0.0007192841,0.0005906589,0.0013648837,0.0027785313,0.006659698,0.0028573438,0.0035008395,0.0005500548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033617174,0.00010927994,0.00047867454,0.0002528403,0.000048889146,0.0002334242,0.0004930187,0.0269625,0.011626158,0.7913275,0.004904538,0.16322713],"study_design_scores_gemma":[0.00005896372,0.00015039189,0.00036394148,0.00007313526,0.00005031064,0.0006486811,0.00012250047,0.23488285,0.03004559,0.7187354,0.014823055,0.000045249984],"about_ca_topic_score_codex":0.00019135154,"about_ca_topic_score_gemma":0.00013371358,"teacher_disagreement_score":0.002726569,"about_ca_system_score_codex":0.0007802611,"about_ca_system_score_gemma":0.00084336684,"threshold_uncertainty_score":0.012149096},"labels":[],"label_agreement":null},{"id":"W154460323","doi":"10.1007/978-3-642-31623-4_9","title":"Syntactic Complexities of Some Classes of Star-Free Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abstract family of languages; Cardinality (data modeling); Computer science; Monotonic function; Regular language; Pumping lemma for regular languages; Cone (formal languages); Star (game theory); Discrete mathematics; Upper and lower bounds; Context-free language; Function (biology); Automaton; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Second-generation programming language; Programming language; Fifth-generation programming language; Rule-based machine translation; Programming paradigm","score_opus":0.019513624987755076,"score_gpt":0.25123815036967634,"score_spread":0.23172452538192126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154460323","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.74042237,0.0015321735,0.10739006,0.0046088374,0.00013083502,0.00014503137,0.0010158577,0.00050049426,0.14425434],"genre_scores_gemma":[0.9674442,0.000847454,0.014065037,0.0002561405,0.00028347413,0.00022151181,0.0008094112,0.00019300125,0.015879834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980946,0.0003864642,0.00014266369,0.00024245588,0.0008480858,0.00028571472],"domain_scores_gemma":[0.991623,0.006539779,0.00045531787,0.0005833106,0.00043983507,0.00035874438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001300522,0.0005107141,0.0009291455,0.0018227407,0.0021415958,0.0048895916,0.0015236123,0.0012549463,0.0098566525],"category_scores_gemma":[0.0073352084,0.0009907811,0.001617576,0.0020741501,0.0036907448,0.009209574,0.002516171,0.003887956,0.00076472404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006376373,0.000038836984,0.0004720294,0.00006495671,0.000012099946,0.00013753212,0.00068000273,0.0022620384,0.0007937454,0.9895097,0.0012857855,0.004679469],"study_design_scores_gemma":[0.0000217756,0.000010070178,0.0005076482,0.000009588115,0.000013379336,0.00012585906,0.00014629509,0.0055368883,0.0004678506,0.99126536,0.0018803052,0.00001495465],"about_ca_topic_score_codex":0.0011134783,"about_ca_topic_score_gemma":0.00090700336,"teacher_disagreement_score":0.0098566525,"about_ca_system_score_codex":0.002042615,"about_ca_system_score_gemma":0.0011296791,"threshold_uncertainty_score":0.032973766},"labels":[],"label_agreement":null},{"id":"W1544662517","doi":"10.1007/978-3-642-15979-4_34","title":"Impact of Coupling of Distributed Denial of Service Attack with Routing on Throughput of Packet Switching Network","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Fields Institute for Research in Mathematical Sciences; University of Guelph","funders":"","keywords":"Computer science; Computer network; Denial-of-service attack; Network packet; Throughput; Routing protocol; Application layer DDoS attack; Network layer; Distributed computing; Layer (electronics); The Internet; Telecommunications; Materials science; Operating system","score_opus":0.016803406141611715,"score_gpt":0.2619848673674239,"score_spread":0.24518146122581216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544662517","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.9789787,0.0010076739,0.013876675,0.00027671788,0.00013582206,0.000020900383,0.000100773,0.0005128923,0.005089837],"genre_scores_gemma":[0.999265,0.000083505714,0.00040223412,0.000014617107,0.000019457133,0.0000027874207,0.000027740565,0.00002463032,0.00015999516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984004,0.00051888055,0.000049937407,0.0002636439,0.00039956885,0.0003675304],"domain_scores_gemma":[0.9844981,0.012487586,0.0007290383,0.0008039043,0.0008394933,0.00064190465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014868794,0.0005483125,0.00051231525,0.00068628363,0.00043277213,0.0008487946,0.0007430079,0.0006703981,0.0019383121],"category_scores_gemma":[0.009224389,0.00036055205,0.0003586696,0.0006794785,0.000683265,0.0013624233,0.00061183085,0.00087127555,0.00026376263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006611892,0.000999932,0.022850296,0.00023883225,0.00036847673,0.00072324835,0.00026970948,0.75589734,0.14095573,0.005621617,0.0018719638,0.06359089],"study_design_scores_gemma":[0.00007898367,0.002061806,0.025242895,0.00003742074,0.0003722198,0.0005275251,0.00014812998,0.9038217,0.06465483,0.002286058,0.00071292237,0.000055473887],"about_ca_topic_score_codex":0.0012632657,"about_ca_topic_score_gemma":0.0010694752,"teacher_disagreement_score":0.0019383121,"about_ca_system_score_codex":0.001170724,"about_ca_system_score_gemma":0.00044351324,"threshold_uncertainty_score":0.008494258},"labels":[],"label_agreement":null},{"id":"W1544683773","doi":"10.1007/978-3-540-89796-5_38","title":"Automatic Web Page Classification Using Various Features","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Web page; Information retrieval; Artificial intelligence; World Wide Web","score_opus":0.031645864750477905,"score_gpt":0.25931603903771194,"score_spread":0.22767017428723405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544683773","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.6344538,0.003238847,0.3173377,0.0003404045,0.00042177696,0.00045878874,0.008209729,0.019491637,0.016047422],"genre_scores_gemma":[0.79044515,0.0006994108,0.18337637,0.00010043013,0.0002571865,0.00016998292,0.011242592,0.0004276774,0.013281227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.00003291635,0.00002936995,0.00010174722,0.00016376119,0.00006243263],"domain_scores_gemma":[0.99920803,0.00027917683,0.00007371977,0.00009887465,0.0002732825,0.000066978035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036060103,0.00059948844,0.0009421724,0.005122173,0.0004635429,0.001095621,0.00051726383,0.00060401816,0.0033103013],"category_scores_gemma":[0.001092879,0.0001654209,0.0007284595,0.003219378,0.00015963115,0.0013996982,0.000502414,0.000453111,0.0028411315],"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.00042941084,0.00042909788,0.020061344,0.00022394718,0.00007608375,0.0001904242,0.00005173105,0.0016850645,0.05942879,0.00058525515,0.010876441,0.90596235],"study_design_scores_gemma":[0.00010114834,0.00079209264,0.16771385,0.00014284541,0.00056680886,0.0021345913,0.00035141275,0.65977997,0.13827239,0.007241705,0.022780083,0.00012312846],"about_ca_topic_score_codex":0.0014838757,"about_ca_topic_score_gemma":0.002788092,"teacher_disagreement_score":0.005122173,"about_ca_system_score_codex":0.00023219593,"about_ca_system_score_gemma":0.0003395037,"threshold_uncertainty_score":0.011074007},"labels":[],"label_agreement":null},{"id":"W1544695114","doi":"10.1007/3-540-44886-1_61","title":"Dueling CSP Representations: Local Search in the Primal versus Dual Constraint Graph","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Windsor","funders":"","keywords":"Constraint satisfaction dual problem; Constraint satisfaction problem; Constraint satisfaction; Computer science; Constraint graph; Mathematical optimization; Constraint (computer-aided design); Hybrid algorithm (constraint satisfaction); Dual (grammatical number); Graph; Constraint programming; Local consistency; Constraint logic programming; Representation (politics); Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03082609765807935,"score_gpt":0.2827214531049179,"score_spread":0.25189535544683855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544695114","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.0061550615,0.0004148575,0.9816064,0.00049570797,0.00006463121,0.00006499967,0.00010996509,0.0004227216,0.010665676],"genre_scores_gemma":[0.24992527,0.0010608117,0.73411816,0.00038546557,0.00015673823,0.0003488745,0.0004948442,0.0006048061,0.012905059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989893,0.00057366595,0.00003438728,0.00012875808,0.00019212397,0.00008176708],"domain_scores_gemma":[0.997715,0.0016011731,0.00011034263,0.0003361339,0.00015745733,0.000079834615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161252,0.0007243628,0.0015486386,0.0009004321,0.0007167766,0.002433752,0.0021047636,0.0015611189,0.012203878],"category_scores_gemma":[0.0074149896,0.00067265664,0.001003435,0.0022886044,0.0011446271,0.005630011,0.0022878947,0.0033161622,0.0012135879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014627581,0.00012317518,0.0001532111,0.0003047054,0.000030614472,0.00007528937,0.00016348761,0.2655383,0.0013555216,0.53532606,0.013182982,0.18360029],"study_design_scores_gemma":[0.000033931887,0.0000322702,0.000033195363,0.000041558793,0.000012311192,0.00004638567,0.000040796313,0.7284434,0.00075472245,0.2669455,0.003603754,0.000012183229],"about_ca_topic_score_codex":0.0023298974,"about_ca_topic_score_gemma":0.0036896667,"teacher_disagreement_score":0.012203878,"about_ca_system_score_codex":0.0011125855,"about_ca_system_score_gemma":0.0013747619,"threshold_uncertainty_score":0.040826023},"labels":[],"label_agreement":null},{"id":"W1544835031","doi":"10.1007/bfb0017400","title":"Physically-based graphical interpretation of marker cellwork L-systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Interpretation (philosophy); Computer science; Computational biology; Biological system; Artificial intelligence; Bioinformatics; Computer graphics (images); Pattern recognition (psychology); Engineering drawing; Biology; Engineering; Programming language","score_opus":0.00845366282883771,"score_gpt":0.2013777689890079,"score_spread":0.19292410616017017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544835031","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.003409307,0.00006871683,0.98386544,0.00007534828,0.000056559384,0.000041474428,0.0004811575,0.0067222132,0.0052798316],"genre_scores_gemma":[0.25287017,0.00027324117,0.73145425,0.00016220297,0.00006990628,0.00021758585,0.002203602,0.003067674,0.0096812565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992223,0.00021992836,0.00006989146,0.0001970241,0.00022356777,0.0000672239],"domain_scores_gemma":[0.9988193,0.00047284996,0.00009880396,0.00028590148,0.00026642997,0.000056596426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406106,0.0011794167,0.00068746187,0.001455234,0.00066978944,0.004477304,0.0018588223,0.0013002408,0.02511741],"category_scores_gemma":[0.0033811228,0.0006159064,0.0014242023,0.00089261687,0.0011439474,0.0022133864,0.001978274,0.0012032223,0.0067487634],"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.0007056925,0.00013468172,0.0022539236,0.0010917004,0.00009311388,0.0013849888,0.002350883,0.096328884,0.07590837,0.4255185,0.02627767,0.36795166],"study_design_scores_gemma":[0.000119199205,0.00012604469,0.001077385,0.00023692733,0.00009727864,0.0006207401,0.0003674557,0.60471207,0.060316585,0.202362,0.12983651,0.0001278533],"about_ca_topic_score_codex":0.001899408,"about_ca_topic_score_gemma":0.0025181295,"teacher_disagreement_score":0.02511741,"about_ca_system_score_codex":0.00063973723,"about_ca_system_score_gemma":0.00042333052,"threshold_uncertainty_score":0.08402604},"labels":[],"label_agreement":null},{"id":"W1544898917","doi":"10.1007/978-3-642-04271-3_116","title":"3D Prostate Segmentation in Ultrasound Images Based on Tapered and Deformed Ellipsoids","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"BC Cancer Agency; University of British Columbia","funders":"National Cancer Institute; National Institutes of Health","keywords":"Segmentation; Computer science; Repeatability; Ellipsoid; 3D ultrasound; Computer vision; Artificial intelligence; Prostate cancer; Brachytherapy; Prostate brachytherapy; Image segmentation; Prostate; Ultrasound; Medicine; Radiation therapy; Radiology; Cancer; Mathematics; Physics","score_opus":0.00804747775476821,"score_gpt":0.2685411104758444,"score_spread":0.2604936327210762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544898917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13904746,0.0009309417,0.85664743,0.00023324271,0.00004956428,0.00013587576,0.00013312906,0.0007952278,0.0020270208],"genre_scores_gemma":[0.47583055,0.0006862659,0.5214729,0.00009083335,0.000043100867,0.00008179419,0.0001966362,0.0002949342,0.0013030593],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922943,0.00018066478,0.000066358676,0.00010081886,0.0003595066,0.000063282096],"domain_scores_gemma":[0.9975783,0.0012235108,0.00020940996,0.0004166247,0.0004373038,0.00013488198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293711,0.0004701418,0.00066124863,0.0014788067,0.00038374294,0.0015638354,0.0010095696,0.0011031248,0.0013951242],"category_scores_gemma":[0.0055868914,0.00093748386,0.0008094026,0.0009103063,0.0006797804,0.0011339864,0.0014164324,0.0009065329,0.00042624545],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001963065,0.00012547578,0.007437459,0.0007150147,0.00014007474,0.00089964987,0.0016495084,0.29237583,0.22966684,0.011683572,0.0014922951,0.45185116],"study_design_scores_gemma":[0.000025417608,0.0001159652,0.004854107,0.000067707675,0.000040660514,0.00093451556,0.000100099045,0.9593093,0.03102297,0.0021625243,0.0012755566,0.00009114052],"about_ca_topic_score_codex":0.0028129192,"about_ca_topic_score_gemma":0.0030935437,"teacher_disagreement_score":0.0028129192,"about_ca_system_score_codex":0.00051555724,"about_ca_system_score_gemma":0.000990658,"threshold_uncertainty_score":0.0080881715},"labels":[],"label_agreement":null},{"id":"W1544975162","doi":"10.1007/978-3-540-74984-4_14","title":"Formal Verification of Use Case Maps with Real Time Extensions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Programming language; Formal verification; Real-time computing","score_opus":0.042013842973843696,"score_gpt":0.2870835550058629,"score_spread":0.24506971203201922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544975162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022786373,0.0001959308,0.96528274,0.00017326455,0.000089815454,0.0001834209,0.00013326845,0.004869835,0.006285366],"genre_scores_gemma":[0.602687,0.00033120383,0.3873961,0.00016237171,0.00007550727,0.00031992205,0.00034212237,0.0008663314,0.007819494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935548,0.002063992,0.00047206576,0.0008784682,0.0023853658,0.0006452079],"domain_scores_gemma":[0.9854101,0.009179075,0.0010201657,0.0030036687,0.0012122501,0.00017469765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005366194,0.0012941703,0.0007328741,0.0010396874,0.00068511517,0.002654559,0.002647564,0.0013942529,0.006184274],"category_scores_gemma":[0.01489012,0.0011685364,0.0017943317,0.00072304066,0.0036952642,0.0066853995,0.003134073,0.0024800273,0.0010998228],"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.0008546158,0.00031244467,0.0020665862,0.0010868273,0.00017891491,0.002354493,0.0022123184,0.116984665,0.042165477,0.6379397,0.0039380095,0.18990596],"study_design_scores_gemma":[0.00021908084,0.00020290265,0.0006763999,0.00032987128,0.00023840791,0.0009678112,0.00034147783,0.4730329,0.104959,0.37209675,0.04681865,0.00011682634],"about_ca_topic_score_codex":0.0016636971,"about_ca_topic_score_gemma":0.0017282376,"teacher_disagreement_score":0.006184274,"about_ca_system_score_codex":0.0009138681,"about_ca_system_score_gemma":0.0018715496,"threshold_uncertainty_score":0.0283795},"labels":[],"label_agreement":null},{"id":"W1544986387","doi":"10.1007/978-3-540-74481-8_24","title":"Using Adaptable Design to Classify Interactions Within a Distributed Control Architecture","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Mechatronics; Modular design; Architecture; Distributed computing; Fault tolerance; Distributed design patterns; Control engineering; Computer architecture; Embedded system; Artificial intelligence; Distributed algorithm; Engineering; Operating system","score_opus":0.039965212508460746,"score_gpt":0.25881538371005225,"score_spread":0.2188501712015915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544986387","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.0098536955,0.00007291714,0.98720145,0.000052181153,0.00003225517,0.00007454409,0.00002645315,0.00079945277,0.0018869432],"genre_scores_gemma":[0.38502628,0.00018527324,0.60741204,0.00016186501,0.000059440088,0.00041362626,0.0002564064,0.00035331413,0.0061317366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981476,0.00043323304,0.00019218375,0.000441275,0.0006179142,0.00016779278],"domain_scores_gemma":[0.99731797,0.0009038105,0.0002770512,0.0008965773,0.00048923836,0.00011543321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001613502,0.0010661717,0.00065410446,0.0013068421,0.0007872634,0.002437281,0.0013943532,0.0011971353,0.0024371],"category_scores_gemma":[0.0040395623,0.0005022929,0.001111152,0.0006558479,0.0023729107,0.0025013494,0.0015471537,0.00193929,0.00050437875],"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.0004703216,0.00025904938,0.0070846668,0.00034468184,0.00019110633,0.0004586493,0.0014567598,0.29002684,0.048528243,0.33840576,0.0032924765,0.30948153],"study_design_scores_gemma":[0.00003446364,0.00014309502,0.0008259238,0.00004677557,0.00009466071,0.00013514789,0.000106333915,0.82472324,0.013390919,0.1508534,0.009607262,0.00003886031],"about_ca_topic_score_codex":0.0021333627,"about_ca_topic_score_gemma":0.0026534747,"teacher_disagreement_score":0.002437281,"about_ca_system_score_codex":0.00095998746,"about_ca_system_score_gemma":0.00085936196,"threshold_uncertainty_score":0.00853312},"labels":[],"label_agreement":null},{"id":"W1544996779","doi":"10.1007/978-3-540-78808-9_12","title":"A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Phrase; Recommender system; Phrase search; Information retrieval; Set (abstract data type); Web search query; Artificial intelligence; Search engine; Web query classification; Data mining","score_opus":0.02337569642548815,"score_gpt":0.2581162057507853,"score_spread":0.23474050932529716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544996779","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.06024697,0.0021851035,0.92872757,0.00045215595,0.00023412844,0.00043063343,0.0009281134,0.004845957,0.0019494272],"genre_scores_gemma":[0.17781772,0.0008952902,0.8130326,0.00023167678,0.00034678963,0.00033038523,0.002240251,0.00020456598,0.0049007707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904734,0.00016423066,0.00010888473,0.00018918632,0.00040486036,0.00008557837],"domain_scores_gemma":[0.9984199,0.0006509173,0.00007426591,0.00015596113,0.0006350068,0.00006402732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012527431,0.00071549014,0.0023041845,0.002956109,0.0007997813,0.0012575131,0.0019403573,0.001261276,0.0028982826],"category_scores_gemma":[0.0036169032,0.00050847366,0.00096289674,0.0039690454,0.00034218267,0.0019851632,0.000657005,0.0009723262,0.0019881064],"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.00075535855,0.00047902734,0.0043134405,0.00021737546,0.00019467394,0.0001446956,0.000102838676,0.019178178,0.021990249,0.003642266,0.0127070835,0.9362749],"study_design_scores_gemma":[0.00015881062,0.00022813401,0.0020859533,0.000016936763,0.00017650901,0.0002479727,0.00005033386,0.9799355,0.0099404855,0.0038608138,0.0032586541,0.00003987128],"about_ca_topic_score_codex":0.01110262,"about_ca_topic_score_gemma":0.011531764,"teacher_disagreement_score":0.01110262,"about_ca_system_score_codex":0.00056800933,"about_ca_system_score_gemma":0.0015281608,"threshold_uncertainty_score":0.02207601},"labels":[],"label_agreement":null},{"id":"W1545021118","doi":"10.1007/978-3-540-77026-8_4","title":"On the Bits of Elliptic Curve Diffie-Hellman Keys","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"Mathematics; Elliptic curve; Finite field; Discrete mathematics; Counting points on elliptic curves; Key size; Arithmetic; Schoof's algorithm; Computer science; Pure mathematics; Public-key cryptography; Encryption; Quarter period","score_opus":0.02444145475790404,"score_gpt":0.24924164457106449,"score_spread":0.22480018981316044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545021118","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.046168156,0.024488075,0.6247143,0.008112693,0.004092044,0.0002536974,0.0009535766,0.0008293208,0.29038817],"genre_scores_gemma":[0.6249358,0.027938316,0.21757245,0.0026876712,0.0032433022,0.00053365796,0.0012687189,0.0010358393,0.12078431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828255,0.0004915541,0.00012934538,0.00019183487,0.00070275157,0.00020194823],"domain_scores_gemma":[0.9968917,0.0017151142,0.00015688779,0.00084093557,0.00030593533,0.00008951405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017526221,0.0013110184,0.0010382996,0.0026001588,0.001428209,0.005127262,0.0013257975,0.001991194,0.011517473],"category_scores_gemma":[0.008301681,0.0011494451,0.00063154224,0.0037338496,0.005077452,0.014136396,0.0031730235,0.005252621,0.004186271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054835695,0.000007901157,0.000061062776,0.000042971555,0.000003498425,0.000035737372,0.00013443122,0.0016979573,0.0005746192,0.9702279,0.0035587235,0.023600278],"study_design_scores_gemma":[0.000008347881,0.000010538501,0.000052413594,0.00006207865,0.000004250162,0.00006663358,0.000030185007,0.003170586,0.0006558758,0.9774032,0.01852264,0.000013292077],"about_ca_topic_score_codex":0.00051086233,"about_ca_topic_score_gemma":0.0003799711,"teacher_disagreement_score":0.011517473,"about_ca_system_score_codex":0.0013971758,"about_ca_system_score_gemma":0.0007808592,"threshold_uncertainty_score":0.038529754},"labels":[],"label_agreement":null},{"id":"W1545062333","doi":"10.1007/978-3-642-10520-3_104","title":"Animated Classic Mosaics from Video","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Western University","funders":"","keywords":"Computer science; Computer vision; Rendering (computer graphics); Animation; Computer graphics (images); Artificial intelligence; Segmentation; Non-photorealistic rendering; Mosaic; Computer animation; Computer facial animation","score_opus":0.016409297407013246,"score_gpt":0.2622693312485581,"score_spread":0.24586003384154487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545062333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04244531,0.0017218925,0.87098616,0.0005676829,0.0013208316,0.00025277963,0.0025825026,0.010159084,0.06996374],"genre_scores_gemma":[0.20055273,0.0028156268,0.7133902,0.00028543276,0.0005404001,0.00014177419,0.0051693753,0.0044658137,0.072638735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991,0.000008991449,0.0000030720682,0.000023929046,0.00004145651,0.000012457312],"domain_scores_gemma":[0.9998343,0.000049069986,0.0000080938335,0.00004479738,0.00004229835,0.000021372156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017922423,0.0005874106,0.00035394792,0.0008382154,0.00028121486,0.0009396779,0.00054547394,0.0004799286,0.030810414],"category_scores_gemma":[0.00080608635,0.0004185223,0.00050017994,0.00066070934,0.0003136691,0.00078019866,0.0009993874,0.0006887357,0.0047103837],"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.0006441796,0.00008470265,0.0005460419,0.00084918493,0.00015374456,0.0010429267,0.00068491965,0.04411388,0.19537383,0.040072225,0.06764192,0.64879227],"study_design_scores_gemma":[0.00014382314,0.00027682504,0.0042867223,0.00032996252,0.00015666487,0.004341826,0.00053059676,0.36663425,0.11657482,0.055122443,0.45147035,0.00013173759],"about_ca_topic_score_codex":0.00094073225,"about_ca_topic_score_gemma":0.001753919,"teacher_disagreement_score":0.030810414,"about_ca_system_score_codex":0.00023131627,"about_ca_system_score_gemma":0.00017188543,"threshold_uncertainty_score":0.10307109},"labels":[],"label_agreement":null},{"id":"W1545073706","doi":"10.1007/978-3-540-24596-4_10","title":"Efficient Algorithm for Embedding Hypergraphs in a Cycle","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Embedding; Computer science; Computation; Algorithm; Approximation algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.01249321993447994,"score_gpt":0.24651903251036908,"score_spread":0.23402581257588914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545073706","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.034128953,0.00045112753,0.9465568,0.0004373341,0.00011929796,0.00040279847,0.0007883572,0.0057219486,0.011393256],"genre_scores_gemma":[0.10057859,0.00029030992,0.88615066,0.00009962497,0.000038726044,0.00034164372,0.0020389091,0.00048721733,0.00997428],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994005,0.00011833746,0.000041141368,0.00018116002,0.00015376566,0.00010509094],"domain_scores_gemma":[0.9990262,0.00035310688,0.000056636338,0.00029731463,0.00019652159,0.000070159665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046450362,0.0014181142,0.0011687229,0.0016318735,0.001014381,0.0020841616,0.0021965518,0.0013568999,0.01672853],"category_scores_gemma":[0.002039936,0.000842109,0.0009423107,0.002500808,0.0006114245,0.003558314,0.0027753767,0.0013610356,0.0040460075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004538666,0.0002860645,0.00081076875,0.0005971092,0.00010044853,0.00017362258,0.0003063829,0.051388886,0.016722089,0.044435397,0.02659309,0.85813224],"study_design_scores_gemma":[0.00048593277,0.00036993314,0.00087215105,0.00012904592,0.00019334289,0.0004958715,0.0005231417,0.72040296,0.02875951,0.20940486,0.03827772,0.00008561312],"about_ca_topic_score_codex":0.0033303273,"about_ca_topic_score_gemma":0.006599346,"teacher_disagreement_score":0.01672853,"about_ca_system_score_codex":0.001264074,"about_ca_system_score_gemma":0.0019019219,"threshold_uncertainty_score":0.055962503},"labels":[],"label_agreement":null},{"id":"W1545081977","doi":"10.1007/978-3-540-70956-5_5","title":"Creation and Collaboration: Engaging New Audiences for Information Visualization","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":103,"is_retracted":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":"Mainstream; Visualization; Computer science; Information visualization; Data science; World Wide Web; Data visualization; Human–computer interaction; Multimedia; Artificial intelligence","score_opus":0.019901538312893735,"score_gpt":0.2938227848890942,"score_spread":0.27392124657620043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545081977","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09346945,0.0037646391,0.6281935,0.009710587,0.0012288449,0.00045689076,0.00039061604,0.007441368,0.25534415],"genre_scores_gemma":[0.60480857,0.002036934,0.26218227,0.001083568,0.00076007517,0.0010711891,0.00082901085,0.003688738,0.123539746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973937,0.0016138164,0.000053741547,0.00032425325,0.00041346392,0.00020107535],"domain_scores_gemma":[0.99555343,0.0028006826,0.00016201982,0.0005811778,0.0002087871,0.0006939766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026849625,0.0013271853,0.00068649615,0.0014503595,0.003437906,0.008776034,0.0020308131,0.0031303521,0.03254169],"category_scores_gemma":[0.007689128,0.0006588485,0.0009303152,0.0012219358,0.0026655763,0.014962112,0.013674677,0.0027281372,0.0051436233],"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.0005765354,0.00040781277,0.003042746,0.00136721,0.00008346904,0.0018849844,0.22394773,0.0019825448,0.04219949,0.25940338,0.09244687,0.3726572],"study_design_scores_gemma":[0.00014701932,0.00027586243,0.0016821218,0.00055613613,0.00010810183,0.0019360789,0.047625605,0.014881346,0.01653333,0.20837727,0.7077421,0.00013509134],"about_ca_topic_score_codex":0.00031148235,"about_ca_topic_score_gemma":0.0006136529,"teacher_disagreement_score":0.03254169,"about_ca_system_score_codex":0.00049665145,"about_ca_system_score_gemma":0.00068321975,"threshold_uncertainty_score":0.10886282},"labels":[],"label_agreement":null},{"id":"W1545136458","doi":"10.1007/978-3-642-14031-0_50","title":"On the Computation of 3D Visibility Skeletons","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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; McGill University","funders":"","keywords":"Visibility; Set (abstract data type); Skeleton (computer programming); Computation; Computer science; Rest (music); Data structure; Theoretical computer science; Visibility graph; Algorithm; Artificial intelligence; Mathematics; Geography; Geometry","score_opus":0.012595781198817164,"score_gpt":0.23040284644355374,"score_spread":0.2178070652447366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545136458","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.016213669,0.00031666746,0.97466964,0.00007812957,0.00005534655,0.00006009628,0.000184707,0.0027095024,0.0057122316],"genre_scores_gemma":[0.18588798,0.0005374123,0.804477,0.00007740305,0.00006830287,0.00010722609,0.0013150559,0.0014151287,0.00611449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991503,0.00011127599,0.000060043727,0.00015030752,0.00042387305,0.00010420536],"domain_scores_gemma":[0.99818003,0.00088789436,0.00010958345,0.00039253413,0.00033270344,0.000097280186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069589337,0.0015015246,0.0019567162,0.0024359804,0.0008372934,0.002809842,0.002329842,0.0014990646,0.013818642],"category_scores_gemma":[0.00502125,0.0011078175,0.0016399481,0.0026175228,0.0014629309,0.0029688017,0.0039564706,0.001572186,0.003232119],"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.0005054604,0.00013451822,0.0016994071,0.0004779804,0.000109891145,0.0002139743,0.00047925065,0.15373099,0.020259447,0.09766525,0.0112552885,0.71346855],"study_design_scores_gemma":[0.00006294858,0.00007584978,0.0006527999,0.00006114664,0.00003367881,0.00011514238,0.00009042111,0.9117309,0.006390028,0.07270335,0.008055201,0.000028510558],"about_ca_topic_score_codex":0.004173969,"about_ca_topic_score_gemma":0.009128837,"teacher_disagreement_score":0.013818642,"about_ca_system_score_codex":0.00076234003,"about_ca_system_score_gemma":0.0008242681,"threshold_uncertainty_score":0.04622799},"labels":[],"label_agreement":null},{"id":"W1545157032","doi":"10.1007/11422778_102","title":"Load Balancing and Relaying Framework in TDD W-CDMA Multi-hop Cellular Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","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":"Queen's University","funders":"","keywords":"Computer science; Load balancing (electrical power); Computer network; Hotspot (geology); Network packet; Distributed computing; Cellular network; Code division multiple access","score_opus":0.0074160540446062285,"score_gpt":0.20965384100333864,"score_spread":0.2022377869587324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545157032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014861612,0.00076396397,0.97784984,0.0001533095,0.00007201552,0.000031645923,0.000028710532,0.00030303595,0.005935867],"genre_scores_gemma":[0.7821153,0.0015636316,0.19874889,0.000121917845,0.00023498555,0.000121854275,0.00008043314,0.00008598526,0.016927017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983954,0.00004762069,0.000006954114,0.000026874277,0.000059722835,0.00001930713],"domain_scores_gemma":[0.99984753,0.00006702844,0.000010802821,0.000026236152,0.000039326915,0.000008976084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031482702,0.00032124354,0.00043556935,0.00024364695,0.00037939957,0.0009539679,0.0010112431,0.0005208471,0.0014150275],"category_scores_gemma":[0.0005075705,0.00015635016,0.0002080947,0.00039916573,0.00037458612,0.0007935291,0.00045893434,0.0004918815,0.0003686188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011972559,0.00010273031,0.0002931331,0.00012784786,0.000044412307,0.00027021216,0.00017876494,0.52409756,0.035089176,0.22144847,0.0045494987,0.21367846],"study_design_scores_gemma":[0.000005267136,0.000029061506,0.0000694748,0.000004838165,0.000010364117,0.00006278962,0.000015000512,0.97015846,0.0017380118,0.025286747,0.0026131724,0.0000067080355],"about_ca_topic_score_codex":0.0012918039,"about_ca_topic_score_gemma":0.0021134918,"teacher_disagreement_score":0.0014150275,"about_ca_system_score_codex":0.00047889966,"about_ca_system_score_gemma":0.00036513043,"threshold_uncertainty_score":0.0047336817},"labels":[],"label_agreement":null},{"id":"W1545173843","doi":"10.1007/978-3-540-72031-7_11","title":"Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","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":"Haplotype; Phylogenetic tree; Tree (set theory); Phylogenetic network; Simple (philosophy); Biology; Theoretical computer science; Computer science; Computational biology; Evolutionary biology; Data mining; Mathematics; Genotype; Combinatorics; Genetics; Gene","score_opus":0.016288216463620803,"score_gpt":0.26555367267809354,"score_spread":0.24926545621447274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545173843","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.0062109483,0.00011519325,0.98572886,0.00021602011,0.000050538805,0.00028104373,0.0009979447,0.005023672,0.001375727],"genre_scores_gemma":[0.036717687,0.000060009377,0.95791364,0.00012441409,0.000030216279,0.0003325118,0.002765094,0.00036634353,0.0016901422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883014,0.0002638414,0.00011665239,0.00037023754,0.00030705685,0.0001119629],"domain_scores_gemma":[0.9954032,0.0023849765,0.00018288089,0.0011395587,0.0007190966,0.00017030028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002171341,0.0012936846,0.0016409626,0.0028678363,0.0013437651,0.0021539868,0.003783631,0.0021679602,0.016967373],"category_scores_gemma":[0.012170164,0.0013176899,0.00176292,0.002331961,0.000900454,0.0038796898,0.004192446,0.002145147,0.0061747218],"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.0006139735,0.0002588919,0.0033568712,0.0004559188,0.00029003673,0.00023421702,0.00048102875,0.10463839,0.005273651,0.026780251,0.026790172,0.83082664],"study_design_scores_gemma":[0.00016608006,0.000065763,0.00060600386,0.000058246686,0.00013002176,0.00020776963,0.00013738326,0.91376424,0.0033943558,0.07395426,0.0074837524,0.000032015505],"about_ca_topic_score_codex":0.0037195592,"about_ca_topic_score_gemma":0.0068656895,"teacher_disagreement_score":0.016967373,"about_ca_system_score_codex":0.001048699,"about_ca_system_score_gemma":0.0020245952,"threshold_uncertainty_score":0.056761563},"labels":[],"label_agreement":null},{"id":"W1545179438","doi":"10.1007/11919476_11","title":"Real-Time Detection of Out-of-Plane Objects in Stereo Vision","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"McMaster University","funders":"","keywords":"Artificial intelligence; Homography; Computer vision; Pixel; Computer science; Initialization; Robustness (evolution); Similarity (geometry); Similarity measure; Planar; Image plane; Computation; Object detection; Pattern recognition (psychology); Mathematics; Computer graphics (images); Algorithm; Image (mathematics)","score_opus":0.010552324017895862,"score_gpt":0.26075358993660525,"score_spread":0.2502012659187094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545179438","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.087172695,0.00076422223,0.9038962,0.00009154252,0.00010697558,0.00006527765,0.00025510212,0.0023451822,0.0053028893],"genre_scores_gemma":[0.42823774,0.0009963508,0.56190014,0.0001477611,0.0000871246,0.00007031652,0.00068235025,0.00028261574,0.0075954953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997559,0.000018922183,0.000007003179,0.00003272146,0.00014537705,0.000040049934],"domain_scores_gemma":[0.99975294,0.000074322816,0.00002448467,0.00003508465,0.00008669947,0.000026537742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025466748,0.00042628203,0.00059029507,0.0006641839,0.00018750221,0.00062903995,0.00072833424,0.0006014193,0.0029225731],"category_scores_gemma":[0.0006022531,0.00040906935,0.00026311586,0.0007928896,0.0002379924,0.000725716,0.0005378505,0.0004140204,0.0010677491],"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.00038334596,0.00008818592,0.0007698711,0.0001319162,0.000031782798,0.000093970695,0.00007841129,0.0061802594,0.48438177,0.0024184939,0.003881817,0.50156015],"study_design_scores_gemma":[0.000060557755,0.00029171444,0.009691188,0.000033063756,0.00006793151,0.0012497592,0.0000926299,0.52572775,0.44563806,0.0057112332,0.011389402,0.00004660981],"about_ca_topic_score_codex":0.0016744552,"about_ca_topic_score_gemma":0.0031747976,"teacher_disagreement_score":0.0029225731,"about_ca_system_score_codex":0.00024609413,"about_ca_system_score_gemma":0.0003207111,"threshold_uncertainty_score":0.00977695},"labels":[],"label_agreement":null},{"id":"W1545185546","doi":"10.1007/3-540-44839-x_73","title":"A New Definitional Specification Language","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Digital subscriber line; Programming language; Predicate (mathematical logic); Specification language; Exception handling; Modularity (biology); Domain-specific language; First-order logic; Formal specification; Refinement calculus; Theoretical computer science","score_opus":0.028489696985775862,"score_gpt":0.2454100951733883,"score_spread":0.21692039818761244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545185546","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.0012023496,0.00040448183,0.9802854,0.00084083463,0.00041945314,0.000098567354,0.00037031158,0.0036020642,0.012776579],"genre_scores_gemma":[0.03316043,0.0012661952,0.9207249,0.0016753547,0.00041662765,0.00066940725,0.0018643291,0.0023281588,0.037894476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549234,0.0011268372,0.00073211815,0.00075648987,0.0016343298,0.0002578906],"domain_scores_gemma":[0.9964904,0.0016304003,0.00019846283,0.00075338094,0.00069932506,0.00022791015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004793793,0.0014381845,0.0013179736,0.001759338,0.0012710934,0.0073675797,0.0036215803,0.0017676844,0.014782296],"category_scores_gemma":[0.0049020597,0.0017897553,0.0021573224,0.0018840384,0.0033092836,0.012338883,0.005034243,0.0067436993,0.0060524573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047688543,0.000056640183,0.00008518997,0.00026231576,0.000017987986,0.00013752119,0.0005405774,0.0016255156,0.004398454,0.9004655,0.016857257,0.07550522],"study_design_scores_gemma":[0.00010084647,0.000077232944,0.00007136043,0.00015741611,0.000079394435,0.00068712415,0.00015038467,0.02711791,0.008053704,0.4264143,0.5369961,0.000094310824],"about_ca_topic_score_codex":0.00082019466,"about_ca_topic_score_gemma":0.0014471057,"teacher_disagreement_score":0.014782296,"about_ca_system_score_codex":0.0012263849,"about_ca_system_score_gemma":0.0026809587,"threshold_uncertainty_score":0.04945177},"labels":[],"label_agreement":null},{"id":"W1545187869","doi":"10.1007/11823728_49","title":"A Method for Feature Selection on Microarray Data Using Support Vector Machine","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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":"Memorial University of Newfoundland","funders":"","keywords":"Support vector machine; Computer science; Feature selection; Hill climbing; Classifier (UML); Artificial intelligence; Pattern recognition (psychology); Gene selection; Data mining; Margin (machine learning); Selection (genetic algorithm); Microarray analysis techniques; Machine learning; Gene; Biology; Gene expression","score_opus":0.03262124736886414,"score_gpt":0.3191683952473193,"score_spread":0.2865471478784552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545187869","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.0015600926,0.00017839896,0.9956671,0.000057045134,0.00007281933,0.00005441297,0.00012451997,0.0021796916,0.00010591998],"genre_scores_gemma":[0.01826041,0.00016094526,0.9787274,0.000068075504,0.00011460762,0.00038157025,0.0007273932,0.00022604984,0.0013335269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982693,0.00039861325,0.00015319067,0.0003448319,0.000736127,0.00009790233],"domain_scores_gemma":[0.9970847,0.001825497,0.000104722705,0.00027541438,0.00064370135,0.00006593117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021845554,0.0016508516,0.0023136146,0.0022708923,0.0008043611,0.0011683628,0.0020411867,0.0012469408,0.0036219885],"category_scores_gemma":[0.0051847547,0.00083929114,0.0018865921,0.002899902,0.00048561502,0.0011133065,0.001128181,0.0022130464,0.0025223633],"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.00020239217,0.00012771106,0.0004946572,0.00017033299,0.00018698056,0.00012927664,0.000045035547,0.019779487,0.015038437,0.0019863008,0.008314726,0.9535246],"study_design_scores_gemma":[0.00013784714,0.00019086726,0.001683198,0.00003228521,0.00012943539,0.000376549,0.000036583657,0.9580885,0.017946508,0.010752945,0.010532863,0.00009242915],"about_ca_topic_score_codex":0.0019432665,"about_ca_topic_score_gemma":0.0026732895,"teacher_disagreement_score":0.0036219885,"about_ca_system_score_codex":0.0004024152,"about_ca_system_score_gemma":0.0009634308,"threshold_uncertainty_score":0.01211679},"labels":[],"label_agreement":null},{"id":"W1545221000","doi":"10.1007/978-3-642-33642-3_22","title":"Designer - Supporting Teachers Experience in Learning Management Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Education and Technology Integration","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":"Athabasca University","funders":"","keywords":"Computer science; Learning Management; Management system; Human–computer interaction; Multimedia; Knowledge management; Software engineering; Engineering management; Operations management; Engineering","score_opus":0.03823884926253821,"score_gpt":0.3300353195903748,"score_spread":0.29179647032783657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545221000","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.44851068,0.00239968,0.14438675,0.006248487,0.00027524983,0.00014632258,0.00016824224,0.002673591,0.39519104],"genre_scores_gemma":[0.72377634,0.0011412167,0.028690528,0.0006629202,0.000042429718,0.00005857183,0.00020564403,0.0003885022,0.2450339],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979018,0.0011959075,0.00009085607,0.00019478021,0.0004615278,0.00015508335],"domain_scores_gemma":[0.9979361,0.0010699661,0.00015248607,0.00027851376,0.00021527662,0.00034758815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019940757,0.00039145528,0.00027117375,0.00038698572,0.0010580538,0.0043187826,0.0007970181,0.0011186283,0.016553503],"category_scores_gemma":[0.003305701,0.00046735097,0.00031912842,0.00022578784,0.0007489424,0.0035366593,0.0022142015,0.001561677,0.0044063465],"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.00039466383,0.0018955391,0.02360984,0.0010658159,0.000048803984,0.0018652336,0.28680998,0.0015592267,0.056010604,0.118422315,0.050548587,0.45776945],"study_design_scores_gemma":[0.000085191285,0.00096215954,0.010197317,0.0005311138,0.000087795524,0.0035749655,0.050501112,0.0038756288,0.032795243,0.010475446,0.88684094,0.00007306894],"about_ca_topic_score_codex":0.00032513254,"about_ca_topic_score_gemma":0.0011511588,"teacher_disagreement_score":0.016553503,"about_ca_system_score_codex":0.0008099527,"about_ca_system_score_gemma":0.0010511095,"threshold_uncertainty_score":0.055376947},"labels":[],"label_agreement":null},{"id":"W1545235289","doi":"10.1007/978-3-642-04271-3_31","title":"High-Quality Model Generation for Finite Element Simulation of Tissue Deformation","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Finite element method; Mesh generation; Computer science; Interpolation (computer graphics); Segmentation; Deformation (meteorology); Feature (linguistics); Algorithm; Artificial intelligence; Computer vision; Image (mathematics); Structural engineering; Materials science","score_opus":0.040745924981870636,"score_gpt":0.3538679032349211,"score_spread":0.3131219782530505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545235289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011889927,0.000076816534,0.98101556,0.0001560165,0.00006843035,0.00011921702,0.00025867912,0.003725889,0.002689499],"genre_scores_gemma":[0.33257803,0.0001751583,0.65957946,0.00019661152,0.000028099006,0.0004401181,0.0010814078,0.002225382,0.0036957737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994956,0.00008908605,0.000030392466,0.000045991063,0.00030186668,0.000036964586],"domain_scores_gemma":[0.9988997,0.00045866845,0.00007160768,0.00022923638,0.000284969,0.0000558974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008718836,0.0010127163,0.0010117848,0.00075745385,0.00049606146,0.0012704706,0.0019575004,0.002397163,0.009730681],"category_scores_gemma":[0.003918533,0.0012553995,0.0008544547,0.00077313144,0.0005687022,0.0009087581,0.0012415024,0.0015853099,0.0022715179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018859077,0.00014517624,0.0007988585,0.00017886313,0.00004884938,0.00021927398,0.00020033879,0.9079251,0.026742186,0.007793898,0.0051309895,0.050627775],"study_design_scores_gemma":[0.000020371212,0.000017786566,0.00007257095,0.000005742458,0.000005109611,0.00003814859,0.000011696496,0.99236274,0.004780146,0.0014022397,0.001273049,0.000010420067],"about_ca_topic_score_codex":0.0028154,"about_ca_topic_score_gemma":0.0045009986,"teacher_disagreement_score":0.009730681,"about_ca_system_score_codex":0.00080622884,"about_ca_system_score_gemma":0.0014817273,"threshold_uncertainty_score":0.032552302},"labels":[],"label_agreement":null},{"id":"W1545257085","doi":"10.1007/11499107_3","title":"Substitutional Definition of Satisfiability in Classical Propositional Logic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Propositional variable; Satisfiability; Well-formed formula; Zeroth-order logic; Propositional calculus; Autoepistemic logic; Propositional formula; Mathematics; Intermediate logic; Discrete mathematics; Computer science; Calculus (dental); Theoretical computer science; Description logic; Multimodal logic","score_opus":0.026191688043510904,"score_gpt":0.24930910968585182,"score_spread":0.2231174216423409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545257085","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.019042855,0.009680704,0.76881444,0.0079349335,0.0016529448,0.000120541175,0.00054705027,0.00039793708,0.19180864],"genre_scores_gemma":[0.5896979,0.0067990124,0.35620177,0.0047370987,0.0025372496,0.0004651493,0.0012904424,0.00036055016,0.037910767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969311,0.0012126159,0.00029755253,0.00042626698,0.00090530433,0.00022704554],"domain_scores_gemma":[0.99790597,0.001249193,0.000078878686,0.00026505027,0.0004298393,0.000071126524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164405,0.0009650389,0.0010724973,0.0026387246,0.0016703297,0.0043897117,0.0027001346,0.002062196,0.006865309],"category_scores_gemma":[0.004293207,0.0012360775,0.0017591277,0.0032966656,0.010351388,0.010475728,0.0025382314,0.007740228,0.001505279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065688896,0.0000063094785,0.000024450042,0.00003525675,0.0000052311902,0.000016800617,0.0001111972,0.00025362504,0.00016038287,0.9952258,0.00089936913,0.0032550183],"study_design_scores_gemma":[0.0000059715335,0.000007680108,0.00003178281,0.000027218559,0.000012242793,0.00005337334,0.000040271563,0.0018196005,0.0003107531,0.99055636,0.0071275267,0.000007228961],"about_ca_topic_score_codex":0.0014934813,"about_ca_topic_score_gemma":0.0014744429,"teacher_disagreement_score":0.006865309,"about_ca_system_score_codex":0.0022527904,"about_ca_system_score_gemma":0.0016096957,"threshold_uncertainty_score":0.022966802},"labels":[],"label_agreement":null},{"id":"W1545365353","doi":"10.1007/978-3-642-15294-8_11","title":"Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"Pedigree chart; Combinatorics; Computer science; Recombination; Algorithm; Parity (physics); Discrete mathematics; Mathematics; Physics; Biology; Genetics","score_opus":0.022501708055048055,"score_gpt":0.2724828247361368,"score_spread":0.24998111668108872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545365353","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.0018465238,0.00010277772,0.9958748,0.00005956697,0.000026314015,0.00009314771,0.00018184137,0.001437715,0.00037728352],"genre_scores_gemma":[0.020844854,0.00007148353,0.97593564,0.00008443553,0.00004059305,0.000490472,0.0008592767,0.00036529533,0.0013078628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968521,0.001386685,0.00027500768,0.000813262,0.0004787422,0.0001941514],"domain_scores_gemma":[0.9793799,0.01572408,0.0003120082,0.0029699733,0.0013639075,0.00025021788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063620033,0.0017429398,0.0026488814,0.0025022654,0.0014343297,0.0019898582,0.0081115505,0.0029775724,0.017914701],"category_scores_gemma":[0.03038363,0.0020318609,0.0022377134,0.0035643985,0.0015510124,0.004853086,0.0038470018,0.004607617,0.0061854785],"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.0013164624,0.00034003693,0.0023384355,0.0004318587,0.0004616271,0.00026405792,0.00032937777,0.21659112,0.0034419438,0.0388437,0.015396743,0.72024465],"study_design_scores_gemma":[0.0004803901,0.00008332018,0.00049043243,0.000049091585,0.000116160714,0.00015816382,0.00005388294,0.8818093,0.0020244438,0.111229606,0.003456638,0.000048598657],"about_ca_topic_score_codex":0.0068863076,"about_ca_topic_score_gemma":0.010330859,"teacher_disagreement_score":0.017914701,"about_ca_system_score_codex":0.0014013909,"about_ca_system_score_gemma":0.0035317405,"threshold_uncertainty_score":0.059930682},"labels":[],"label_agreement":null},{"id":"W1545435124","doi":"10.1007/978-3-642-17679-1_26","title":"Energy Aware Fault Tolerant Routing in Two-Tiered Sensor Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor","funders":"","keywords":"Computer science; Relay; Wireless sensor network; Computer network; Multipath routing; Static routing; Routing (electronic design automation); Fault tolerance; Node (physics); Routing protocol; Transmission (telecommunications); Distributed computing; Telecommunications; Engineering","score_opus":0.015144995092974626,"score_gpt":0.2288954070065526,"score_spread":0.21375041191357796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545435124","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.039727833,0.0120216105,0.9312738,0.0008934844,0.00082049245,0.00005500759,0.00016965423,0.0013183416,0.013719733],"genre_scores_gemma":[0.7729582,0.006831383,0.18865189,0.00030795432,0.00030531545,0.00008517237,0.00029407523,0.00016553995,0.03040052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969184,0.000063868814,0.00002016864,0.000053649746,0.00013134397,0.000039217917],"domain_scores_gemma":[0.9996855,0.0001284955,0.00002854888,0.00006372313,0.0000736745,0.000020027064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036454402,0.00057794957,0.00060115516,0.00032588912,0.00032802337,0.0010650225,0.0013556011,0.00078375085,0.0017739108],"category_scores_gemma":[0.0008326676,0.0003015757,0.00031928,0.00077044993,0.0003565428,0.0013344346,0.0006726605,0.0006232222,0.0003825108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002657859,0.00011089657,0.0005609246,0.00056903175,0.000084302366,0.00024978182,0.00015726282,0.5694586,0.043392,0.051355407,0.012081892,0.32171416],"study_design_scores_gemma":[0.000013403037,0.00014027381,0.0005030244,0.000037600323,0.00002843331,0.00031569196,0.000046638248,0.9392874,0.0075118477,0.03987606,0.012207063,0.000032445143],"about_ca_topic_score_codex":0.00074820407,"about_ca_topic_score_gemma":0.0013067978,"teacher_disagreement_score":0.0017739108,"about_ca_system_score_codex":0.00052708766,"about_ca_system_score_gemma":0.0002893503,"threshold_uncertainty_score":0.0059343576},"labels":[],"label_agreement":null},{"id":"W1545471058","doi":"10.1007/11776420_39","title":"Online Learning with Constraints","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Hindsight bias; Convex hull; Computer science; Path (computing); Decision maker; Mathematical optimization; Constraint (computer-aided design); Term (time); Function (biology); Online learning; Regular polygon; Artificial intelligence; Operations research; Mathematics","score_opus":0.05701351581155001,"score_gpt":0.3661818562238235,"score_spread":0.3091683404122735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545471058","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.0132522825,0.0019894126,0.9198312,0.0023383538,0.00042432162,0.00009437047,0.0004407896,0.00090708386,0.060722128],"genre_scores_gemma":[0.5463246,0.003028154,0.31988722,0.0011915328,0.0015074587,0.00058851007,0.0021711546,0.0006849204,0.12461648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990933,0.00029673407,0.000041331772,0.00023859083,0.00024379622,0.00008626679],"domain_scores_gemma":[0.9948177,0.0038155443,0.00015761548,0.0007832924,0.00025864283,0.00016723476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012021317,0.0009909029,0.0012827049,0.0005880326,0.00058133487,0.0018517757,0.0016843781,0.0012706255,0.024856137],"category_scores_gemma":[0.008969364,0.00051182206,0.0005585933,0.0015041886,0.0008693786,0.0041698264,0.0022278458,0.0032150918,0.0033564013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002524607,0.00037217423,0.00071347435,0.0003360533,0.00006948294,0.000103758095,0.00007837572,0.11182284,0.00084346614,0.28833556,0.052713457,0.54435897],"study_design_scores_gemma":[0.000045400167,0.00006581106,0.0002066413,0.00005778452,0.000018105395,0.00007714547,0.000024045485,0.53552467,0.0009890359,0.44946107,0.013516296,0.000013952297],"about_ca_topic_score_codex":0.0009767984,"about_ca_topic_score_gemma":0.0014650535,"teacher_disagreement_score":0.024856137,"about_ca_system_score_codex":0.0008340247,"about_ca_system_score_gemma":0.00097281544,"threshold_uncertainty_score":0.083152115},"labels":[],"label_agreement":null},{"id":"W1545491710","doi":"10.1007/978-3-642-02026-1_47","title":"A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor","funders":"","keywords":"Wireless sensor network; Computer science; Digraph; Algorithm; Node (physics); Wireless network; Path (computing); Wireless; Strongly connected component; Integer programming; Transmission (telecommunications); Computer network; Mathematics; Discrete mathematics; Telecommunications","score_opus":0.010224371087268662,"score_gpt":0.2176706564112874,"score_spread":0.20744628532401874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545491710","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.011900224,0.00052742555,0.97844017,0.00058102404,0.00014492586,0.00023222937,0.00022901241,0.0006737555,0.0072712563],"genre_scores_gemma":[0.080498345,0.000520922,0.9113632,0.00018598969,0.00015116415,0.0004259068,0.0006307228,0.0002882778,0.0059355837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934644,0.00020306678,0.000032310232,0.00012117094,0.00021091293,0.00008616159],"domain_scores_gemma":[0.9983494,0.0011743892,0.00007861343,0.00011384968,0.0001834747,0.00010015228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013464463,0.0014861192,0.0021623252,0.0013391899,0.0010268668,0.0015997399,0.0027045412,0.0021808012,0.010991628],"category_scores_gemma":[0.0041710585,0.0008712,0.0010998275,0.0026838623,0.00088185014,0.0028036332,0.0018983732,0.0026134453,0.0013721648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004205715,0.0004344219,0.00042195772,0.0003172054,0.00010031191,0.00011812443,0.00014678521,0.51349276,0.0023020508,0.054254316,0.022732794,0.40525866],"study_design_scores_gemma":[0.00012794076,0.00006605898,0.000102357866,0.000021744048,0.000022873633,0.00005221182,0.00003404046,0.9534947,0.0005351995,0.043192957,0.0023406926,0.00000929386],"about_ca_topic_score_codex":0.0040248325,"about_ca_topic_score_gemma":0.00449743,"teacher_disagreement_score":0.010991628,"about_ca_system_score_codex":0.001282617,"about_ca_system_score_gemma":0.0020730817,"threshold_uncertainty_score":0.0367707},"labels":[],"label_agreement":null},{"id":"W1545553655","doi":"10.1007/11424918_16","title":"Analysis and Classification of Strategies in Electronic Negotiations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Negotiation; Computer science; Representation (politics); Instant messaging; Artificial intelligence; Machine learning; World Wide Web","score_opus":0.018751418701297522,"score_gpt":0.2598066475336483,"score_spread":0.24105522883235078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545553655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31485665,0.0036720787,0.61766595,0.0012435283,0.00009530007,0.00041962517,0.0006277179,0.00032714396,0.061091904],"genre_scores_gemma":[0.91096,0.0009310976,0.07930699,0.00007268965,0.000086086875,0.00025142,0.0007377364,0.000068251626,0.0075857304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970241,0.0011949411,0.00025966356,0.00038579848,0.0007054021,0.0004300939],"domain_scores_gemma":[0.98877954,0.0075832265,0.0010298676,0.0009411189,0.0012162455,0.00045005206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033907646,0.0006895899,0.0007996053,0.005004148,0.0013990938,0.0053187627,0.00211638,0.001431235,0.00611899],"category_scores_gemma":[0.019092146,0.00042242472,0.0013166262,0.0046144603,0.003010631,0.0073498115,0.0013267683,0.0017168778,0.00067799335],"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.00011053182,0.00008494213,0.005241742,0.00007721223,0.000027705257,0.000068506,0.00080122304,0.011061255,0.00064193335,0.9295287,0.0009425336,0.051413625],"study_design_scores_gemma":[0.000021405922,0.00005582053,0.0026605825,0.000058697075,0.000035575,0.00015714385,0.00074087526,0.15829693,0.0006940534,0.83417267,0.0030863972,0.00001986362],"about_ca_topic_score_codex":0.0027360779,"about_ca_topic_score_gemma":0.0015171291,"teacher_disagreement_score":0.00611899,"about_ca_system_score_codex":0.0024300423,"about_ca_system_score_gemma":0.0016836902,"threshold_uncertainty_score":0.020470023},"labels":[],"label_agreement":null},{"id":"W1545568894","doi":"10.1007/3-540-39963-1_30","title":"Design of Rough Neurons: Rough Set Foundation and Petri Net Model","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Rough set; Petri net; Computer science; Artificial neural network; Artificial neuron; Filter (signal processing); Set (abstract data type); Artificial intelligence; Pattern recognition (psychology); Algorithm; Data mining","score_opus":0.040747601832327146,"score_gpt":0.25150009174050486,"score_spread":0.21075248990817771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545568894","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.005763669,0.0001566195,0.99198323,0.00007076306,0.000020997546,0.000035794717,0.000023238797,0.000071226634,0.001874373],"genre_scores_gemma":[0.46358788,0.00067764247,0.53211385,0.00005595223,0.00003073805,0.00022898064,0.000114298105,0.00005185159,0.0031387724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956113,0.000112367896,0.000032393353,0.00009876123,0.00014452588,0.00005080342],"domain_scores_gemma":[0.9995436,0.00018756138,0.000040586092,0.0000459681,0.00014955463,0.000032633183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995288,0.0005012481,0.000964708,0.0005263135,0.0004905192,0.001281036,0.0017575051,0.00079366553,0.0017027404],"category_scores_gemma":[0.0019046366,0.0006047048,0.0011670615,0.00054095587,0.000689559,0.0014273763,0.00077470153,0.0008100106,0.0003320359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007779669,0.00003277458,0.00030559135,0.00015439646,0.0000477336,0.000111403664,0.0001155026,0.825268,0.0062561654,0.12017575,0.00064402766,0.046810824],"study_design_scores_gemma":[0.000012316592,0.000036915666,0.00006304348,0.000014815162,0.000025932055,0.0000387498,0.0000175561,0.95044523,0.0017505292,0.046485342,0.0010974132,0.000012120091],"about_ca_topic_score_codex":0.0027104926,"about_ca_topic_score_gemma":0.0028913897,"teacher_disagreement_score":0.0027104926,"about_ca_system_score_codex":0.0009848436,"about_ca_system_score_gemma":0.0012934394,"threshold_uncertainty_score":0.0071455836},"labels":[],"label_agreement":null},{"id":"W1545580834","doi":"10.1007/3-540-45074-2_9","title":"Modeling and Evaluating Cooperation Strategies in P2P Agent Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Peer-to-peer; Order (exchange); Software; Information exchange; Operating system","score_opus":0.06021016388477613,"score_gpt":0.3107023097221115,"score_spread":0.25049214583733537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545580834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36616868,0.0010487083,0.62019163,0.00079406466,0.00008559043,0.0004462773,0.00016123558,0.00044613332,0.010657571],"genre_scores_gemma":[0.9454504,0.00031456875,0.052073315,0.000030057163,0.000023331562,0.00020730366,0.00008372998,0.000043410462,0.0017738651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763775,0.0012826514,0.00012319355,0.0002884913,0.00044289493,0.00022501113],"domain_scores_gemma":[0.98356205,0.014178752,0.00070861686,0.00041775397,0.00086684583,0.0002659591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004395394,0.0013461149,0.0014425829,0.0009020714,0.0008536771,0.0026694923,0.0024697515,0.0022714464,0.0018182244],"category_scores_gemma":[0.017549215,0.0008582269,0.00067239703,0.0011692257,0.0018235563,0.0037080771,0.0012688454,0.0013562236,0.00023412151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048685466,0.000051641728,0.0005667931,0.000027912181,0.000014845198,0.00003200349,0.000045713045,0.9847247,0.00023256593,0.008573641,0.00013943386,0.005542024],"study_design_scores_gemma":[0.0000045271404,0.000013508881,0.000048212325,0.0000015407696,0.000003902795,0.0000038475205,0.00001388258,0.9959835,0.000086534674,0.0038035281,0.000035158973,0.0000018812736],"about_ca_topic_score_codex":0.012761764,"about_ca_topic_score_gemma":0.008491379,"teacher_disagreement_score":0.012761764,"about_ca_system_score_codex":0.0026873501,"about_ca_system_score_gemma":0.0019829378,"threshold_uncertainty_score":0.025375009},"labels":[],"label_agreement":null},{"id":"W1545603837","doi":"10.1007/978-3-540-73210-5_15","title":"Finding State Solutions to Temporal Logic Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Computer science; Model checking; Generality; State (computer science); Temporal logic; Linear temporal logic; Theoretical computer science; State space; Black box; Algorithm; Artificial intelligence; Mathematics","score_opus":0.08577738197006582,"score_gpt":0.3293216682192162,"score_spread":0.2435442862491504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545603837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077398635,0.0005480905,0.89626294,0.0012115933,0.00013559608,0.00053610327,0.00078151777,0.0048670536,0.018258467],"genre_scores_gemma":[0.33394754,0.00069838617,0.64963305,0.00034736466,0.000092094364,0.00040046932,0.002236706,0.000927312,0.011717047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978241,0.0004893585,0.00022582758,0.00040887078,0.000777202,0.00027455954],"domain_scores_gemma":[0.9937163,0.0050576823,0.00021741402,0.00056163117,0.00036770146,0.000079345264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021233854,0.0011944073,0.0014403948,0.0015901823,0.0010068787,0.0034521797,0.002258594,0.0026840868,0.010488561],"category_scores_gemma":[0.014665998,0.0010976065,0.002843675,0.0020802608,0.0017835585,0.005642786,0.003032831,0.0028388952,0.0016017159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010264635,0.00044234254,0.0011896896,0.0013782567,0.00022701443,0.00065138895,0.0020494452,0.09871317,0.020941779,0.41176623,0.014637068,0.4469771],"study_design_scores_gemma":[0.00025975806,0.00021010626,0.0002537923,0.0001602539,0.00018925792,0.00026144032,0.0008340792,0.35624352,0.018784601,0.61351955,0.009229071,0.000054516782],"about_ca_topic_score_codex":0.0018662742,"about_ca_topic_score_gemma":0.0023528042,"teacher_disagreement_score":0.010488561,"about_ca_system_score_codex":0.0012883916,"about_ca_system_score_gemma":0.0018251305,"threshold_uncertainty_score":0.035087764},"labels":[],"label_agreement":null},{"id":"W1545653268","doi":"10.1007/3-540-45786-0_29","title":"Computer-Assisted Correction of Bone Deformities Using a 6-DOF Parallel Spatial Mechanism","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Kinematics; Distraction osteogenesis; Frame (networking); Mechanism (biology); Wedge (geometry); Osteotomy; Fixation (population genetics); Distraction; Simulation; Orthodontics; Medicine; Optics; Physics","score_opus":0.017726896894241815,"score_gpt":0.20702862996027524,"score_spread":0.18930173306603343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545653268","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.04039878,0.0002347037,0.9545905,0.00006900513,0.00013171449,0.000076603996,0.00010438241,0.0023170367,0.0020773269],"genre_scores_gemma":[0.32268968,0.00039177126,0.6672188,0.00006417797,0.000039019866,0.00008348947,0.0002036767,0.0003531108,0.008956174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999629,0.000028899673,0.000019605155,0.00007267504,0.00022632326,0.000023409293],"domain_scores_gemma":[0.9994842,0.00014100011,0.00006864153,0.00017265533,0.00011111908,0.000022285705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063064427,0.000980416,0.00073156995,0.0008479757,0.00034939413,0.00047257257,0.0012292443,0.0007430246,0.008117522],"category_scores_gemma":[0.001092955,0.0007115765,0.00065781415,0.0007142111,0.00041748845,0.00045859828,0.0010108901,0.0006255568,0.0009466237],"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.00067272526,0.00014587856,0.0013357659,0.00028154717,0.0001246689,0.00040125215,0.00013845199,0.095327385,0.30894896,0.0027189916,0.0029562053,0.58694816],"study_design_scores_gemma":[0.00031701365,0.0009452319,0.009648631,0.00008450356,0.00026646213,0.0063198744,0.00012338515,0.7654193,0.19166937,0.0031075608,0.021935046,0.00016368512],"about_ca_topic_score_codex":0.0017825637,"about_ca_topic_score_gemma":0.00398892,"teacher_disagreement_score":0.008117522,"about_ca_system_score_codex":0.0001876419,"about_ca_system_score_gemma":0.0008477774,"threshold_uncertainty_score":0.027155817},"labels":[],"label_agreement":null},{"id":"W1545752326","doi":"10.1007/978-3-642-15555-0_14","title":"Discovering Multipart Appearance Models from Captioned Images","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Artificial intelligence; Flexibility (engineering); Invariant (physics); Set (abstract data type); Translation (biology); Computer vision; Annotation; Precision and recall; Pattern recognition (psychology)","score_opus":0.018309031936540106,"score_gpt":0.2600122788668847,"score_spread":0.24170324693034462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545752326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083949745,0.0019504962,0.8957323,0.0004030808,0.00035323927,0.00037926037,0.0026061821,0.010681215,0.0039444366],"genre_scores_gemma":[0.4310116,0.0019650494,0.54126006,0.000606059,0.00039540272,0.00041933462,0.014549551,0.0020373398,0.007755595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880004,0.00015422047,0.00004410416,0.0005532484,0.0003042151,0.00014424571],"domain_scores_gemma":[0.9980205,0.00071309216,0.0001915478,0.0005531636,0.00035756166,0.00016411663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009071321,0.0028514562,0.0025133386,0.0030321074,0.00079463003,0.0023290263,0.0036695336,0.0041827443,0.005253177],"category_scores_gemma":[0.0034880124,0.00205154,0.003417099,0.0038743843,0.001096448,0.002911882,0.0019908643,0.0036866933,0.006181335],"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.0017382585,0.0009790396,0.0059616743,0.00080660684,0.0005090474,0.0026745037,0.00040885794,0.12779745,0.12437041,0.004303916,0.031144004,0.6993062],"study_design_scores_gemma":[0.000030318715,0.00016334016,0.0015488815,0.000051284052,0.0000849447,0.00063818286,0.00008662231,0.9811731,0.008983684,0.0045776404,0.002632202,0.000029740153],"about_ca_topic_score_codex":0.006235356,"about_ca_topic_score_gemma":0.0088463975,"teacher_disagreement_score":0.006235356,"about_ca_system_score_codex":0.00093938655,"about_ca_system_score_gemma":0.00082460785,"threshold_uncertainty_score":0.017573595},"labels":[],"label_agreement":null},{"id":"W154580602","doi":"10.1007/978-3-319-04657-0_13","title":"The ${\\mathcal{G}}$ -Packing with t-Overlap Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Packing problems; Disjoint sets; Combinatorics; Clique; Set packing; Bounded function; Focus (optics); Mathematics; Discrete mathematics; Computer science; Physics","score_opus":0.00879632036603044,"score_gpt":0.1979327203784873,"score_spread":0.18913640001245685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154580602","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.049220033,0.0033206036,0.65937406,0.0040155286,0.0018071999,0.00019917256,0.0008560551,0.000762423,0.28044492],"genre_scores_gemma":[0.38400665,0.0056132474,0.44260937,0.0016805524,0.0020711266,0.00061564567,0.0019367101,0.0017212178,0.15974553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992343,0.00014427431,0.000045949757,0.00017652196,0.00025547968,0.0001434518],"domain_scores_gemma":[0.9993445,0.00026834535,0.000058882928,0.00018560709,0.000075676864,0.00006703051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456949,0.0011963852,0.0016340697,0.0009245168,0.0016544667,0.002686259,0.0021772915,0.002277777,0.02256114],"category_scores_gemma":[0.002688695,0.0007590045,0.0015259578,0.0035307156,0.0016776202,0.0049494207,0.003112803,0.0037598908,0.004734778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012246739,0.0000971669,0.0001600446,0.00039925406,0.00003547957,0.00018457053,0.0001289695,0.027175711,0.0014848901,0.7926011,0.05055135,0.12705898],"study_design_scores_gemma":[0.0000279432,0.000040990726,0.00018059913,0.00008139892,0.000020119687,0.00036843383,0.00007639271,0.06754469,0.0017415195,0.892488,0.037406642,0.000023233892],"about_ca_topic_score_codex":0.0011622144,"about_ca_topic_score_gemma":0.00093853934,"teacher_disagreement_score":0.02256114,"about_ca_system_score_codex":0.0011308371,"about_ca_system_score_gemma":0.00093641,"threshold_uncertainty_score":0.0754745},"labels":[],"label_agreement":null},{"id":"W1545895816","doi":"10.1007/978-3-642-15274-0_12","title":"Series Transformations to Improve and Extend Convergence","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Dynamics and Biomechanics","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":"Western University","funders":"","keywords":"Convergence (economics); Transformation (genetics); Computer science; Series (stratigraphy); Invariant (physics); Maple; Applied mathematics; Domain (mathematical analysis); Function (biology); Algorithm; Algebra over a field; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.004523693658604937,"score_gpt":0.19004444984527802,"score_spread":0.18552075618667307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545895816","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.021889292,0.0007630119,0.9446869,0.00031314543,0.0006436593,0.000047840844,0.000067069115,0.0014076186,0.030181458],"genre_scores_gemma":[0.48558915,0.0031694097,0.42033005,0.00076616736,0.0014452843,0.00025284154,0.000490011,0.004432127,0.08352497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991404,0.00029907204,0.00007221038,0.00016158979,0.00025001442,0.0000767751],"domain_scores_gemma":[0.9979849,0.00093512185,0.00009965619,0.0004933449,0.00037001952,0.00011692775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016033967,0.0013698909,0.00088670885,0.001700423,0.0006562387,0.0010382858,0.0009992132,0.0007130678,0.012525502],"category_scores_gemma":[0.008137764,0.00036414404,0.0014619672,0.0014259294,0.0018125009,0.003430238,0.0028735567,0.002746094,0.0037165547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022503476,0.0001623555,0.00031595232,0.00021955158,0.000054129876,0.00015830048,0.00044752887,0.024521261,0.016925097,0.654139,0.008585481,0.29424638],"study_design_scores_gemma":[0.000096331016,0.00040980504,0.00033956053,0.00007979004,0.00009387274,0.00045011454,0.00015614758,0.1800518,0.02687941,0.74434453,0.04705017,0.00004849781],"about_ca_topic_score_codex":0.0003294371,"about_ca_topic_score_gemma":0.00034183316,"teacher_disagreement_score":0.012525502,"about_ca_system_score_codex":0.00045949727,"about_ca_system_score_gemma":0.00040621142,"threshold_uncertainty_score":0.041901946},"labels":[],"label_agreement":null},{"id":"W1545937013","doi":"10.1007/978-3-540-30139-4_95","title":"Optimal Emotional Conditions for Learning with an Intelligent Tutoring System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Memorization; Computer science; Realization (probability); Intelligent tutoring system; Artificial intelligence; Cognition; Intelligent decision support system; Human–computer interaction; Multimedia; Mathematics education; Psychology","score_opus":0.022949028349039124,"score_gpt":0.25664476233008743,"score_spread":0.23369573398104831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545937013","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.71175855,0.00039661306,0.27053675,0.00047936806,0.00012861684,0.00024936307,0.00012426612,0.00038308944,0.015943324],"genre_scores_gemma":[0.9930948,0.000053139393,0.0062402356,0.000016459304,0.000016714657,0.00006885017,0.000025738225,0.000021006806,0.00046310807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941266,0.00020778357,0.0000335018,0.00008240991,0.00008697599,0.00017676051],"domain_scores_gemma":[0.9957509,0.003022272,0.00024003073,0.00013319636,0.0005319911,0.0003216138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009524372,0.00056481815,0.0005953594,0.00035490887,0.00043076277,0.0013752831,0.0003602959,0.00073961803,0.004444964],"category_scores_gemma":[0.010434141,0.0002775558,0.00020980366,0.00012193693,0.0006258988,0.0012376179,0.0014346335,0.0005503587,0.0004110456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010673604,0.001426504,0.0068966495,0.0005970582,0.00012230253,0.00069163536,0.0010556062,0.60493773,0.13982251,0.08320674,0.004066386,0.14650331],"study_design_scores_gemma":[0.00050504995,0.0012575537,0.006085138,0.000060346396,0.000101674865,0.0001376938,0.0005182153,0.917768,0.020927241,0.051734574,0.0008361102,0.000068329144],"about_ca_topic_score_codex":0.00046750985,"about_ca_topic_score_gemma":0.00052044855,"teacher_disagreement_score":0.004444964,"about_ca_system_score_codex":0.0004345723,"about_ca_system_score_gemma":0.0005404163,"threshold_uncertainty_score":0.014869869},"labels":[],"label_agreement":null},{"id":"W1546006857","doi":"10.1007/978-3-540-30500-2_16","title":"An Automata Approach to Match Gapped Sequence Tags Against Protein Database","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Automaton; Sequence (biology); Database; Theoretical computer science; Information retrieval; Artificial intelligence","score_opus":0.028416006976202217,"score_gpt":0.271612990929167,"score_spread":0.2431969839529648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546006857","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.024698095,0.00018928254,0.96768326,0.00018734175,0.00014494648,0.00010262212,0.00031229862,0.0044233575,0.002258854],"genre_scores_gemma":[0.32464197,0.0003071143,0.66723955,0.00033209077,0.000073448085,0.0002894403,0.00092217675,0.00042307063,0.005771156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991456,0.00015874986,0.0001147691,0.0002631627,0.00023643288,0.00008113874],"domain_scores_gemma":[0.99765575,0.0012434919,0.00009124303,0.0005135454,0.0004105232,0.000085470994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762437,0.0006136309,0.0009573614,0.001334591,0.000932956,0.0014902728,0.0023270573,0.0013172074,0.0037813596],"category_scores_gemma":[0.0032939436,0.00054874405,0.0012030315,0.0012887875,0.0010283573,0.0027090257,0.0019168949,0.0010230255,0.0016203307],"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.001067017,0.0004860977,0.003505947,0.00055482716,0.0002818318,0.00089246046,0.00071803946,0.20905265,0.065702006,0.15537354,0.009846602,0.552519],"study_design_scores_gemma":[0.000022486129,0.00011854653,0.00022511459,0.000024292372,0.000065025386,0.00023264113,0.00011881216,0.8656087,0.021788241,0.10772735,0.004037241,0.000031570962],"about_ca_topic_score_codex":0.0038579227,"about_ca_topic_score_gemma":0.004642337,"teacher_disagreement_score":0.0038579227,"about_ca_system_score_codex":0.0008086763,"about_ca_system_score_gemma":0.0010992896,"threshold_uncertainty_score":0.012649894},"labels":[],"label_agreement":null},{"id":"W1546033115","doi":"10.1007/978-3-540-74984-4_13","title":"Consistency of UML/SPT Models","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Consistency (knowledge bases); Unified Modeling Language; Computer science; Applications of UML; Programming language; Software engineering; Artificial intelligence","score_opus":0.06231878821109783,"score_gpt":0.3036934811703212,"score_spread":0.24137469295922337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546033115","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.02665897,0.00039705966,0.95386344,0.0008573029,0.00014274979,0.00019258022,0.0006401734,0.0019651419,0.01528253],"genre_scores_gemma":[0.5436504,0.0007361413,0.43749875,0.00045322147,0.00020430844,0.0007035978,0.0033745908,0.00231624,0.011062694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98254657,0.0058716144,0.0015687762,0.0019179904,0.0072869244,0.00080809224],"domain_scores_gemma":[0.9641955,0.014528893,0.002439357,0.01263852,0.005784507,0.0004131153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01220101,0.00072159857,0.0011890285,0.0021237745,0.0014309278,0.0059229136,0.003860986,0.0020222727,0.0054157744],"category_scores_gemma":[0.042141493,0.0020758733,0.0022711903,0.0019921523,0.0033464152,0.008384944,0.0040369,0.0036377094,0.001757946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027702615,0.00009291443,0.001844383,0.00037760413,0.00010050202,0.000461107,0.0015467731,0.04470313,0.0076604937,0.8659935,0.005323675,0.071618855],"study_design_scores_gemma":[0.00011785849,0.0000680439,0.00058437657,0.00021807046,0.00012400125,0.00029215708,0.00033334122,0.1646338,0.018377064,0.7906371,0.024563352,0.00005082846],"about_ca_topic_score_codex":0.003801831,"about_ca_topic_score_gemma":0.0027268012,"teacher_disagreement_score":0.01220101,"about_ca_system_score_codex":0.0021032828,"about_ca_system_score_gemma":0.0039927275,"threshold_uncertainty_score":0.0645259},"labels":[],"label_agreement":null},{"id":"W1546042720","doi":"10.1007/978-3-642-16248-0_43","title":"A Belief Structure for Reasoning about Knowledge","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Lakehead University; University of Regina","funders":"","keywords":"Computer science; Knowledge representation and reasoning; Kripke structure; Modal logic; Representation (politics); Belief structure; Artificial intelligence; Modal; Belief revision; Epistemic modal logic; Normal modal logic; Measure (data warehouse); Natural language processing; Multimodal logic; Theoretical computer science; Description logic; Temporal logic; Data mining","score_opus":0.01351968386930969,"score_gpt":0.25562435839438813,"score_spread":0.24210467452507844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546042720","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.00220483,0.0010125069,0.9835587,0.0016886086,0.00013059517,0.00007328241,0.00043964665,0.00033012184,0.010561623],"genre_scores_gemma":[0.19824934,0.0018565241,0.7875002,0.00086937303,0.00056341547,0.00055402215,0.0012620902,0.00015759353,0.008987488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666387,0.0012128666,0.0004097687,0.00058447657,0.0009249831,0.00020407427],"domain_scores_gemma":[0.994132,0.004126992,0.00027919456,0.0007020115,0.00056514906,0.00019464822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004188375,0.0014131705,0.0013557154,0.0030667023,0.0020280057,0.0064246804,0.0038898308,0.0034868708,0.009776145],"category_scores_gemma":[0.012107245,0.0014611245,0.0031400824,0.0034716786,0.0044694683,0.015901497,0.003801703,0.006324299,0.0023525087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038578324,0.000022003183,0.00012220803,0.0001734695,0.000048001657,0.00007817161,0.00046828503,0.0039759153,0.00035737606,0.9619199,0.002484465,0.030311601],"study_design_scores_gemma":[0.000014080191,0.000012611295,0.000049010974,0.000056576362,0.000031297935,0.000044828506,0.000057349436,0.018192573,0.00024618674,0.97654486,0.004736826,0.000013889025],"about_ca_topic_score_codex":0.0051232576,"about_ca_topic_score_gemma":0.004592575,"teacher_disagreement_score":0.009776145,"about_ca_system_score_codex":0.0024918397,"about_ca_system_score_gemma":0.0013411549,"threshold_uncertainty_score":0.032704473},"labels":[],"label_agreement":null},{"id":"W1546049643","doi":"10.1007/978-3-540-74260-9_76","title":"Iris Recognition Based on Zigzag Collarette Region and Asymmetrical Support Vector Machines","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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":"Concordia University","funders":"","keywords":"Support vector machine; Iris recognition; Computer science; Zigzag; Pattern recognition (psychology); Artificial intelligence; IRIS (biosensor); Segmentation; Feature (linguistics); Matching (statistics); Feature vector; Computer vision; Mathematics; Biometrics","score_opus":0.041335701624962126,"score_gpt":0.2699329665011318,"score_spread":0.22859726487616966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546049643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16990039,0.0011390186,0.8215816,0.000121026016,0.00017927388,0.00009162702,0.00013975572,0.0013099486,0.0055373013],"genre_scores_gemma":[0.6731911,0.0006571993,0.3214708,0.000073880445,0.0000859323,0.00008021497,0.00023581123,0.00007361684,0.0041313977],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995241,0.000084226325,0.000028529712,0.000115653595,0.0002028377,0.00004478387],"domain_scores_gemma":[0.99960047,0.00012085374,0.00004446669,0.00007427726,0.00014207998,0.00001795483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035745694,0.00045474246,0.0006152405,0.0008029053,0.00024222222,0.0004511947,0.00052376644,0.00046465508,0.0015923087],"category_scores_gemma":[0.0006383145,0.00030666264,0.0004813328,0.0008528152,0.00027745846,0.0009896825,0.00046649197,0.00032795363,0.00079112395],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011311367,0.00009386904,0.003920489,0.00016874078,0.00008054961,0.0002196559,0.00009944936,0.007864913,0.23869585,0.0030115426,0.0021717097,0.7425421],"study_design_scores_gemma":[0.000094077004,0.00069988373,0.020661946,0.00004497287,0.00026076174,0.0026620347,0.00013493578,0.71262586,0.255084,0.0023014932,0.0052929525,0.00013717997],"about_ca_topic_score_codex":0.00069512747,"about_ca_topic_score_gemma":0.0009078169,"teacher_disagreement_score":0.0015923087,"about_ca_system_score_codex":0.00014322545,"about_ca_system_score_gemma":0.0002928846,"threshold_uncertainty_score":0.0053268075},"labels":[],"label_agreement":null},{"id":"W1546134733","doi":"10.1007/11890393_22","title":"Association-Rules Mining Based Broadcasting Approach for XML Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Calgary","funders":"","keywords":"Computer science; Broadcasting (networking); XML; Association rule learning; Software portability; Flexibility (engineering); Mobile device; XML database; Scalability; Database; Data mining; World Wide Web; Computer network; Programming language","score_opus":0.03879452689165791,"score_gpt":0.26191958306383156,"score_spread":0.22312505617217365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546134733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021721989,0.00067849597,0.9702593,0.0003499553,0.00009554581,0.00023508604,0.00094260497,0.0037035581,0.0020133937],"genre_scores_gemma":[0.114565745,0.0007553616,0.87504375,0.00019054307,0.00012397845,0.0002652828,0.0028835244,0.00025368854,0.005918064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814093,0.00034186943,0.00019706142,0.0003429563,0.00087949925,0.00009764183],"domain_scores_gemma":[0.99550974,0.0025466203,0.00019469543,0.0008321717,0.00079657853,0.000120223456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257132,0.00053736725,0.001294007,0.003732988,0.0012244974,0.0015889223,0.0024745527,0.0009695783,0.0033726303],"category_scores_gemma":[0.0059197024,0.0005234984,0.0013111064,0.0049352706,0.0005139141,0.0021876008,0.0011335673,0.0014679589,0.0014867788],"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.0004465748,0.00053310534,0.003485203,0.00039269455,0.00028472417,0.0005605415,0.0003967915,0.02407674,0.020421274,0.015238645,0.010092,0.92407155],"study_design_scores_gemma":[0.0001451134,0.00028360335,0.002967868,0.00008912698,0.00048447313,0.0013046352,0.00046956094,0.87146276,0.034983702,0.059981305,0.02774782,0.00008003705],"about_ca_topic_score_codex":0.0047207344,"about_ca_topic_score_gemma":0.007618149,"teacher_disagreement_score":0.0047207344,"about_ca_system_score_codex":0.0006079192,"about_ca_system_score_gemma":0.0019045451,"threshold_uncertainty_score":0.011937022},"labels":[],"label_agreement":null},{"id":"W1546157169","doi":"10.1007/11840930_57","title":"Selective Tuning: Feature Binding Through Selective Attention","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","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":"York University","funders":"","keywords":"Percept; Computer science; Artificial intelligence; Hierarchy; Computer vision; Pattern recognition (psychology); Neuroscience; Perception; Biology","score_opus":0.042206779910784406,"score_gpt":0.30323298221316025,"score_spread":0.26102620230237583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546157169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08167548,0.0045617134,0.8284938,0.0008760059,0.00059896836,0.000051609604,0.00018484332,0.002259918,0.08129764],"genre_scores_gemma":[0.8495094,0.0026679295,0.10827944,0.00065081887,0.0003232713,0.00008214557,0.00028219307,0.00076866127,0.03743612],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980813,0.000013738178,0.0000049831747,0.00006773238,0.000056341785,0.00004901426],"domain_scores_gemma":[0.99973375,0.00013448921,0.000021121221,0.00005191899,0.000026548876,0.00003220721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026171256,0.0003428488,0.00051374413,0.00031863988,0.00031161212,0.0010661184,0.0015230074,0.00079650985,0.00929282],"category_scores_gemma":[0.0011761065,0.00043980416,0.0003698552,0.0004353066,0.0007027622,0.0022788914,0.0011425638,0.0008197665,0.00171719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037257472,0.00007556087,0.00050454616,0.00028519038,0.00008125554,0.00035898326,0.00021769096,0.00747777,0.37178355,0.14043581,0.013770383,0.4646367],"study_design_scores_gemma":[0.00008825584,0.00014958774,0.00740369,0.000051938427,0.00008734907,0.0013761669,0.00012855031,0.14552383,0.15408368,0.6612757,0.029733721,0.00009758863],"about_ca_topic_score_codex":0.00057189073,"about_ca_topic_score_gemma":0.00063322316,"teacher_disagreement_score":0.00929282,"about_ca_system_score_codex":0.00031547208,"about_ca_system_score_gemma":0.0002082249,"threshold_uncertainty_score":0.031087577},"labels":[],"label_agreement":null},{"id":"W1546217776","doi":"10.1007/11566489_28","title":"2D/3D Deformable Registration Using a Hybrid Atlas","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence; Point distribution model; Atlas (anatomy); Computer vision; Range (aeronautics); Surface reconstruction; Point (geometry); Object (grammar); Image registration; Surface (topology); Computer graphics (images); Image (mathematics); Geometry; Anatomy; Mathematics","score_opus":0.01984461026091034,"score_gpt":0.29143815596994077,"score_spread":0.27159354570903044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546217776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011440673,0.00020645418,0.98268294,0.00012018696,0.000084690895,0.00008491087,0.0002278815,0.0025634288,0.0025888353],"genre_scores_gemma":[0.14853546,0.00048843125,0.8434163,0.00020815208,0.00007301679,0.00015180852,0.00069446163,0.0015137735,0.0049186037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992743,0.00010246858,0.000056252233,0.00019717176,0.00029450515,0.00007536424],"domain_scores_gemma":[0.9994265,0.000120771656,0.000055821005,0.00025557925,0.000105489606,0.000035886784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176937,0.0011170019,0.0011976177,0.0023375144,0.00078554876,0.0036529533,0.0012564313,0.0018432944,0.005559961],"category_scores_gemma":[0.0019329572,0.0012487931,0.0020094307,0.002560419,0.00073431776,0.0018270488,0.0026711216,0.0012315414,0.003765163],"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.000703389,0.00014295215,0.0033993092,0.0005359303,0.0004244815,0.0009918428,0.0005075705,0.09923395,0.23294054,0.024295362,0.0077213976,0.6291033],"study_design_scores_gemma":[0.00008706017,0.00034207682,0.004913541,0.00012996754,0.0004443294,0.0058048163,0.00027897485,0.71462435,0.20273198,0.029261015,0.04114026,0.00024162127],"about_ca_topic_score_codex":0.002414246,"about_ca_topic_score_gemma":0.0036341597,"teacher_disagreement_score":0.005559961,"about_ca_system_score_codex":0.00060482323,"about_ca_system_score_gemma":0.001347916,"threshold_uncertainty_score":0.018599868},"labels":[],"label_agreement":null},{"id":"W1546283771","doi":"10.1007/978-3-540-32256-6_60","title":"The Use of Gyroscope Feedback in the Control of the Walking Gaits for a Small Humanoid Robot","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Gyroscope; Humanoid robot; Computer science; Robot; Actuator; Artificial intelligence; Control (management); Computer vision; Simulation; Control theory (sociology); Human–computer interaction; Engineering","score_opus":0.02515019237809163,"score_gpt":0.21862111249368318,"score_spread":0.19347092011559155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546283771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16905688,0.010813033,0.79681903,0.0004908677,0.00044968023,0.00011320382,0.00013533626,0.0018007248,0.020321274],"genre_scores_gemma":[0.8937828,0.0019149265,0.09882603,0.000078219986,0.00006382815,0.000049309398,0.000054465923,0.00005474787,0.0051757926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999713,0.000006779884,0.0000022917543,0.0000061424303,0.000010452742,0.000003013621],"domain_scores_gemma":[0.9999107,0.000049234193,0.0000075233907,0.0000101438045,0.000014947701,0.0000075175026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014092312,0.00029232333,0.00017947491,0.00020830373,0.00019878014,0.00023036545,0.00020966947,0.00020813994,0.0012618348],"category_scores_gemma":[0.00047547277,0.00015447367,0.00012609886,0.00016619163,0.00031946175,0.00022740345,0.00016575422,0.00021349065,0.00016950819],"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.0008203413,0.000063494306,0.00075724814,0.0004689921,0.0000400924,0.00040753078,0.00043508288,0.03837842,0.4553216,0.008444766,0.0024843148,0.4923781],"study_design_scores_gemma":[0.00034089395,0.002821364,0.015190245,0.00043623126,0.000249821,0.0023563062,0.00023531621,0.5797412,0.31052178,0.018899497,0.06903822,0.00016914966],"about_ca_topic_score_codex":0.001438149,"about_ca_topic_score_gemma":0.0025954577,"teacher_disagreement_score":0.001438149,"about_ca_system_score_codex":0.00009533852,"about_ca_system_score_gemma":0.00011118466,"threshold_uncertainty_score":0.0042212605},"labels":[],"label_agreement":null},{"id":"W1546306263","doi":"10.1007/978-3-642-30618-1","title":"Information Processing in Computer-Assisted Interventions","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Education","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Information processing; Human–computer interaction","score_opus":0.044899384452129674,"score_gpt":0.32451450985239483,"score_spread":0.2796151254002652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546306263","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013211928,0.24949901,0.4159613,0.0057186466,0.0037906405,0.00031088316,0.00036004832,0.0010371913,0.3101104],"genre_scores_gemma":[0.35721496,0.18028398,0.21074721,0.0025778715,0.0035761266,0.00081976317,0.00069988624,0.0002491714,0.24383104],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996551,0.00014495029,0.000019749112,0.00004260588,0.00011478623,0.000022742019],"domain_scores_gemma":[0.9993895,0.0004898435,0.000020038631,0.000036829417,0.000047895785,0.000015840587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043670184,0.00045971898,0.0005557908,0.0006332313,0.00022705007,0.001233711,0.00055231125,0.000841521,0.017424311],"category_scores_gemma":[0.0014296747,0.00015385434,0.0003291894,0.00081759033,0.0007951512,0.0011857293,0.0005240284,0.0009378684,0.0023187094],"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.00010265016,0.00010257208,0.00013944361,0.0013431069,0.000044575314,0.00014383544,0.00020003082,0.0040353346,0.0020400118,0.08237627,0.041312005,0.8681602],"study_design_scores_gemma":[0.000089654815,0.000544356,0.003712,0.002327943,0.0001417287,0.0021820306,0.00045323436,0.04430701,0.008847699,0.5358919,0.40142092,0.000081504535],"about_ca_topic_score_codex":0.0006746073,"about_ca_topic_score_gemma":0.0007643022,"teacher_disagreement_score":0.017424311,"about_ca_system_score_codex":0.0004993634,"about_ca_system_score_gemma":0.00053682947,"threshold_uncertainty_score":0.058290124},"labels":[],"label_agreement":null},{"id":"W1546338010","doi":"10.1007/11527695_24","title":"UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":166,"is_retracted":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":"Implementation; Computer science; Algorithm; Parallel computing; Theoretical computer science; Programming language","score_opus":0.027692267524924458,"score_gpt":0.3104371693902008,"score_spread":0.28274490186527634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546338010","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.021752778,0.00044835417,0.46281317,0.0006076921,0.0005038567,0.00092598994,0.01390001,0.45617834,0.042869795],"genre_scores_gemma":[0.13923663,0.0003664998,0.7588736,0.0007114378,0.00009633582,0.0024614867,0.03174194,0.051851522,0.014660652],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944734,0.0022976622,0.00052104006,0.0007613308,0.0014523722,0.000494259],"domain_scores_gemma":[0.9890205,0.0064388765,0.00028129705,0.0022594437,0.0016981055,0.00030173184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044743656,0.002144305,0.0010397285,0.0024327647,0.0014024497,0.0021502983,0.005378287,0.0013942071,0.057359446],"category_scores_gemma":[0.0136817675,0.0017677516,0.0018258952,0.0030376704,0.0010001808,0.004285318,0.0021886306,0.0032099201,0.018320477],"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.004696257,0.0027232207,0.005144092,0.0025817284,0.00035199177,0.00026916852,0.0009283734,0.0556675,0.019156031,0.043190032,0.46241808,0.40287346],"study_design_scores_gemma":[0.002806264,0.0007878432,0.0025220383,0.00033883512,0.00024355973,0.000323697,0.00039358492,0.6358534,0.07723314,0.034567308,0.2447357,0.0001945503],"about_ca_topic_score_codex":0.007933493,"about_ca_topic_score_gemma":0.010745341,"teacher_disagreement_score":0.057359446,"about_ca_system_score_codex":0.0018111134,"about_ca_system_score_gemma":0.002465397,"threshold_uncertainty_score":0.19188643},"labels":[],"label_agreement":null},{"id":"W1546360871","doi":"10.1007/3-540-45049-1_64","title":"Improving Peanut Maturity Prediction Using a Hybrid Artificial Neural Network and Fuzzy Inference System","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Adaptive neuro fuzzy inference system; Computer science; Artificial neural network; Inference system; Robustness (evolution); Neuro-fuzzy; Artificial intelligence; Fuzzy inference system; Machine learning; Fuzzy logic; Data mining; Fuzzy control system","score_opus":0.019179345914209507,"score_gpt":0.24855094525379826,"score_spread":0.22937159933958876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546360871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37496114,0.0011920376,0.61626244,0.00022148903,0.00019137663,0.000089490764,0.00032787677,0.002226291,0.0045278464],"genre_scores_gemma":[0.8569928,0.00023095039,0.13997789,0.00006630863,0.000049140253,0.00005165722,0.00030107007,0.000040000377,0.0022901539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999824,0.000022760723,0.000012058492,0.00006703082,0.000052038537,0.00002207013],"domain_scores_gemma":[0.9994986,0.00019959631,0.000033090284,0.000023678982,0.00022812927,0.000016795237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525953,0.00065522623,0.0007863344,0.00076607155,0.0004168661,0.0006275851,0.00091986515,0.00099902,0.001237523],"category_scores_gemma":[0.0013204645,0.00033788328,0.0005983083,0.0007401465,0.00011999382,0.0010143259,0.00031315244,0.00057087536,0.000431635],"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.0009222971,0.00043005915,0.010419593,0.00019412184,0.00020882474,0.00019014707,0.00006311108,0.30688053,0.06243799,0.0006436612,0.0022027723,0.61540693],"study_design_scores_gemma":[0.000014330137,0.0000507477,0.0019509153,0.0000055233163,0.00004955824,0.000018385052,0.0000073767824,0.99168736,0.00585079,0.00017585109,0.00017864096,0.000010507335],"about_ca_topic_score_codex":0.012557059,"about_ca_topic_score_gemma":0.015195262,"teacher_disagreement_score":0.012557059,"about_ca_system_score_codex":0.0005679343,"about_ca_system_score_gemma":0.0004386532,"threshold_uncertainty_score":0.024967909},"labels":[],"label_agreement":null},{"id":"W1546393105","doi":"10.1007/978-3-540-39903-2_52","title":"PUPIL: Programmable Ultrasound Platform and Interface Library","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interface (matter); Visibility; Software; Pipeline (software); Computer science; Flexibility (engineering); Ultrasound; Computer vision; Ranging; Computer hardware; Artificial intelligence; Acoustics; Optics; Physics; Telecommunications","score_opus":0.011380517896763817,"score_gpt":0.23629409409007626,"score_spread":0.22491357619331245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546393105","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.002162568,0.0017210955,0.6433811,0.0003256843,0.00045923243,0.0003647173,0.0052361563,0.19088762,0.15546176],"genre_scores_gemma":[0.024575777,0.003553882,0.21062385,0.0011915269,0.00043450954,0.0009835457,0.01347597,0.055624697,0.6895362],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961036,0.000032524782,0.000030035731,0.00007793842,0.00020859232,0.0000405859],"domain_scores_gemma":[0.999511,0.0001343713,0.000025101986,0.00012002894,0.00014335502,0.0000661676],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005247176,0.0015202696,0.0011340308,0.0015110924,0.0005537355,0.0021594965,0.002686361,0.0010980357,0.33966786],"category_scores_gemma":[0.0015004405,0.0011005093,0.00072350004,0.0012368684,0.0002388831,0.0033410075,0.00263,0.0015744127,0.24930051],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003202122,0.00009292411,0.00023571482,0.00076099904,0.00002862653,0.00021195455,0.00018227975,0.00057916006,0.027649617,0.013917617,0.4779702,0.4780506],"study_design_scores_gemma":[0.00011416255,0.00012228188,0.00080705347,0.00020996004,0.000057016503,0.0013180443,0.00005097759,0.007148922,0.03507751,0.0072478266,0.9477606,0.00008574052],"about_ca_topic_score_codex":0.00049770164,"about_ca_topic_score_gemma":0.0006777175,"teacher_disagreement_score":0.33966786,"about_ca_system_score_codex":0.00036226457,"about_ca_system_score_gemma":0.0006293398,"threshold_uncertainty_score":0.9418837},"labels":[],"label_agreement":null},{"id":"W1546410696","doi":"10.1007/978-3-540-39611-6_5","title":"Architecture and Algorithms for Real-Time Mobility Management in Mobile IP Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobile IP; Mobility management; Architecture; Computer network; Mobility model; Distributed computing; Mobile computing; Context (archaeology); Network architecture; Real-time computing","score_opus":0.01997641456657762,"score_gpt":0.2824004134256543,"score_spread":0.2624239988590767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546410696","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.003089602,0.00033876265,0.99352443,0.00012150678,0.000058842023,0.000070583905,0.000026520964,0.0010395797,0.001730148],"genre_scores_gemma":[0.1376757,0.00077352545,0.85605353,0.00010549094,0.00012629793,0.00035114857,0.00025941184,0.00022710244,0.004427791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991653,0.00021186647,0.00008027291,0.00012178586,0.00029856426,0.00012220972],"domain_scores_gemma":[0.9985061,0.00064972875,0.00012144697,0.00032092424,0.0003461413,0.00005565929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017008545,0.00094409904,0.00082560006,0.0011445791,0.0008487918,0.0027240433,0.0032680316,0.0014471724,0.004631538],"category_scores_gemma":[0.00475418,0.0007204538,0.0005555233,0.0011066172,0.0010082287,0.0041455016,0.0017248974,0.0019622338,0.0015241366],"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.00034561873,0.00021153782,0.00060600817,0.0002436497,0.000055461187,0.00009023771,0.0003130482,0.30243856,0.010360973,0.24979484,0.010654531,0.4248855],"study_design_scores_gemma":[0.000046632358,0.000059380178,0.00010341116,0.000026126272,0.000021995405,0.00007769803,0.00004569392,0.91176015,0.0032433006,0.079829514,0.0047675795,0.000018571958],"about_ca_topic_score_codex":0.0019966748,"about_ca_topic_score_gemma":0.002043989,"teacher_disagreement_score":0.004631538,"about_ca_system_score_codex":0.0012381655,"about_ca_system_score_gemma":0.0010434089,"threshold_uncertainty_score":0.015494049},"labels":[],"label_agreement":null},{"id":"W1546422272","doi":"10.1007/978-3-540-45157-0_8","title":"Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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 Ottawa","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Unit (ring theory); Training (meteorology); Mathematical optimization; Operations research; Artificial intelligence; Psychology; Engineering; Mathematics; Mathematics education; Geography","score_opus":0.3609674661402971,"score_gpt":0.4532695223027544,"score_spread":0.09230205616245729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546422272","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.0826454,0.0015846234,0.87207264,0.0013079521,0.000506175,0.0011251942,0.0013841637,0.0035016304,0.035872325],"genre_scores_gemma":[0.405837,0.00092899456,0.5715257,0.00030616517,0.00013394404,0.00078857964,0.0013926037,0.0007347655,0.018352242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00044481148,0.000027896727,0.00008691872,0.00011369003,0.00013671027],"domain_scores_gemma":[0.99849844,0.00092038006,0.00013261185,0.000112946305,0.00016064453,0.00017497437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014701316,0.0009628458,0.0010653883,0.0011107366,0.0009529504,0.0012375436,0.0012842788,0.0011245769,0.023435656],"category_scores_gemma":[0.003634258,0.0011363167,0.0009719923,0.0022797782,0.0003140123,0.00087028614,0.0007790189,0.0011638491,0.0028805672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059716107,0.0002772147,0.0008591815,0.00020681803,0.00006820844,0.00006653257,0.00013943824,0.7396639,0.0021693856,0.007068604,0.022064956,0.2268186],"study_design_scores_gemma":[0.0001911179,0.0003308961,0.00095046026,0.000027495831,0.00003825056,0.000056700854,0.0001370941,0.9755077,0.0022617206,0.011516896,0.008954552,0.00002715143],"about_ca_topic_score_codex":0.009908396,"about_ca_topic_score_gemma":0.012019014,"teacher_disagreement_score":0.023435656,"about_ca_system_score_codex":0.0016569739,"about_ca_system_score_gemma":0.003729108,"threshold_uncertainty_score":0.078400075},"labels":[],"label_agreement":null},{"id":"W1546469383","doi":"10.1007/978-3-540-30139-4_62","title":"Scaffolding Self-Explanation to Improve Learning in Exploratory Learning Environments.","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scaffold; Artificial intelligence; Human–computer interaction; Programming language","score_opus":0.012858551342695349,"score_gpt":0.22317191722619478,"score_spread":0.21031336588349944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546469383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32211477,0.008161174,0.6032492,0.0017527478,0.00042555877,0.00057533424,0.00032760022,0.00798434,0.05540921],"genre_scores_gemma":[0.76165366,0.0015612697,0.22061509,0.00018094401,0.00007574493,0.00027222795,0.00038739943,0.0002447512,0.015008995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964297,0.00016857353,0.00001643865,0.00005341097,0.00009221356,0.000026393993],"domain_scores_gemma":[0.9958961,0.0030352362,0.00019966558,0.0004295569,0.00026621783,0.00017326264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074394315,0.00033572823,0.0002418945,0.00027402144,0.00016172767,0.00091000664,0.0009032355,0.0006194728,0.0049513746],"category_scores_gemma":[0.008073753,0.00012847372,0.00021362076,0.00023985741,0.00033146658,0.0017525677,0.0011814906,0.0006422254,0.00089253095],"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.0004993482,0.0011042671,0.0025276297,0.0009151021,0.00007251874,0.0001639677,0.0027910874,0.009797582,0.023222469,0.017868256,0.014369905,0.92666787],"study_design_scores_gemma":[0.0012418686,0.0050732954,0.03706366,0.0017476467,0.0007875777,0.001702165,0.0037468902,0.2684072,0.14250344,0.30408993,0.23341669,0.0002196514],"about_ca_topic_score_codex":0.00033107688,"about_ca_topic_score_gemma":0.0008127689,"teacher_disagreement_score":0.0049513746,"about_ca_system_score_codex":0.00017429338,"about_ca_system_score_gemma":0.0004083599,"threshold_uncertainty_score":0.016564071},"labels":[],"label_agreement":null},{"id":"W1546518574","doi":"10.1007/3-540-45486-1_34","title":"Task-Structure Based Mediation: The Travel-Planning Assistant Example","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Computer science; Task (project management); Architecture; Mediation; Set (abstract data type); Domain (mathematical analysis); Variety (cybernetics); Human–computer interaction; World Wide Web; Web service; Artificial intelligence","score_opus":0.020851723888740452,"score_gpt":0.23869542401750257,"score_spread":0.2178437001287621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546518574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15414993,0.0007533275,0.63260406,0.006198748,0.00028731808,0.0004962291,0.0009340355,0.0030302098,0.20154607],"genre_scores_gemma":[0.801481,0.00040442136,0.15965526,0.0002875158,0.000064403685,0.00025407493,0.00036988844,0.00019386564,0.03728955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988318,0.0005629437,0.000046401725,0.00014231476,0.00018593944,0.0002305597],"domain_scores_gemma":[0.99688727,0.0019689344,0.00008870421,0.00053423655,0.00023416137,0.0002867599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014851148,0.0005811897,0.00085780997,0.000578464,0.0023765902,0.00237453,0.0024640698,0.0035910476,0.020203099],"category_scores_gemma":[0.007283773,0.0004841817,0.0011740084,0.0014035753,0.0014255327,0.004439601,0.0028103162,0.0019428104,0.0024415918],"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.0017734744,0.0013996261,0.0043613818,0.0005591813,0.00017771016,0.0059284866,0.0057675284,0.07422593,0.010099591,0.738959,0.024071062,0.13267703],"study_design_scores_gemma":[0.0006742971,0.00042437646,0.0015269971,0.00008702355,0.00022266812,0.0017090974,0.0035193572,0.37897772,0.0099011855,0.53592247,0.06690502,0.00012975637],"about_ca_topic_score_codex":0.009693844,"about_ca_topic_score_gemma":0.007162205,"teacher_disagreement_score":0.020203099,"about_ca_system_score_codex":0.00066577905,"about_ca_system_score_gemma":0.0018802027,"threshold_uncertainty_score":0.067586064},"labels":[],"label_agreement":null},{"id":"W1546598822","doi":"10.1007/11565123_27","title":"A Cognitive Model for Autonomous Agents Based on Bayesian Programming","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Correctness; Robot; Cognitive model; Artificial intelligence; Human–computer interaction; Bayesian probability; Phenomenon; Interface (matter); Simple (philosophy); Cognition; Machine learning; Programming language","score_opus":0.041268400891440106,"score_gpt":0.2881066014277865,"score_spread":0.2468382005363464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546598822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042541986,0.00014673262,0.98568404,0.00069439306,0.000047625297,0.000043386284,0.00009626026,0.00019007419,0.008843339],"genre_scores_gemma":[0.23319858,0.000680924,0.75528395,0.00033127717,0.00014597,0.0004447363,0.00031706336,0.00012578254,0.009471697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990803,0.00035167654,0.000061310755,0.00015859817,0.00025369885,0.00009444272],"domain_scores_gemma":[0.9984524,0.0009821898,0.000098752025,0.0001381875,0.00020407757,0.00012421436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156043,0.0008132469,0.0011401497,0.00082308915,0.001101674,0.00366045,0.0030792903,0.002179576,0.005360659],"category_scores_gemma":[0.0045010243,0.00078249123,0.0020157893,0.0011955878,0.0020344579,0.004438421,0.0019372893,0.0031425117,0.00094214646],"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.000029471636,0.00004246004,0.00016976745,0.000066799475,0.000038625374,0.00008616616,0.00027726006,0.09725387,0.00043171347,0.88378465,0.0017229979,0.016096225],"study_design_scores_gemma":[0.000015150825,0.000011780709,0.00004005328,0.000014018759,0.00001672037,0.000034837347,0.00003225568,0.31079757,0.00013811445,0.6863052,0.002581039,0.000013255997],"about_ca_topic_score_codex":0.006797033,"about_ca_topic_score_gemma":0.00623623,"teacher_disagreement_score":0.006797033,"about_ca_system_score_codex":0.0013366389,"about_ca_system_score_gemma":0.0018792062,"threshold_uncertainty_score":0.01793319},"labels":[],"label_agreement":null},{"id":"W1546643567","doi":"10.1007/11880646_1","title":"Property-Driven Statistics of Biological Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Canadian Nautical Research Society","funders":"","keywords":"Shuffling; Component (thermodynamics); Constraint (computer-aided design); Biological network; Property (philosophy); Computer science; Interaction network; Population; Relevance (law); Theoretical computer science; Computational biology; Mathematics; Biology; Genetics; Gene; Physics","score_opus":0.012821044761728302,"score_gpt":0.2226659422525081,"score_spread":0.2098448974907798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546643567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124042094,0.0011476108,0.8682573,0.0011594853,0.000084351464,0.00005013885,0.0011077492,0.0008523308,0.0032989427],"genre_scores_gemma":[0.9426658,0.001508726,0.049822688,0.00019617949,0.00028283676,0.00020007798,0.0020235747,0.00031492868,0.0029850735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884486,0.00047362028,0.00004822144,0.0002765162,0.00027609617,0.00008064935],"domain_scores_gemma":[0.973821,0.020421254,0.0019354562,0.0021667792,0.0010187774,0.00063679507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036083318,0.0004386841,0.0010977492,0.0020554066,0.00043206272,0.0016168592,0.0019545075,0.0011366837,0.0022930608],"category_scores_gemma":[0.024356747,0.00070666283,0.0009067035,0.001509047,0.0016734805,0.004433142,0.0010402496,0.0016939403,0.00033108855],"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.00010944366,0.000054294353,0.0051828916,0.00018076185,0.000096057534,0.00014932323,0.0001503343,0.4518405,0.002778572,0.5116214,0.0037672082,0.024069196],"study_design_scores_gemma":[0.000006979067,0.000017823542,0.0010296408,0.000010459021,0.000008731208,0.000062201136,0.000009649233,0.6622017,0.00040391865,0.3357421,0.00049631123,0.000010588527],"about_ca_topic_score_codex":0.0011877228,"about_ca_topic_score_gemma":0.0013715567,"teacher_disagreement_score":0.0036083318,"about_ca_system_score_codex":0.0013054637,"about_ca_system_score_gemma":0.00075400464,"threshold_uncertainty_score":0.019082904},"labels":[],"label_agreement":null},{"id":"W1546692412","doi":"10.1007/978-3-642-16901-4_38","title":"Comparison of Model Checking Tools for Information Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Model checking; Computer science; Temporal logic; Programming language; Information system; Formal verification; Theoretical computer science","score_opus":0.07874912144205573,"score_gpt":0.340206260501616,"score_spread":0.26145713905956025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546692412","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.15477328,0.0049386844,0.7926058,0.0013633406,0.00058621785,0.00043405514,0.0012091437,0.011623731,0.032465708],"genre_scores_gemma":[0.7687735,0.0013513247,0.22271948,0.00021333034,0.00010512497,0.00029521092,0.0013796077,0.0014504968,0.0037118662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9824232,0.008056556,0.0009449956,0.0007784116,0.006428434,0.001368423],"domain_scores_gemma":[0.91744554,0.063178144,0.0015001829,0.0120518375,0.00520248,0.0006217922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010951852,0.0014309598,0.001822849,0.004315618,0.0010310713,0.0039034106,0.0033219194,0.0018080642,0.00961901],"category_scores_gemma":[0.049848128,0.0008887262,0.0023015342,0.0032512827,0.0018492662,0.00894929,0.0028591268,0.0023967538,0.0009400652],"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.005139678,0.00079027814,0.004565364,0.0014208222,0.0005368088,0.00012880474,0.0004953076,0.23974113,0.01060848,0.38154274,0.013673313,0.3413572],"study_design_scores_gemma":[0.00036395763,0.00053128117,0.001498651,0.00030024446,0.0003455092,0.00012067883,0.0002011848,0.7704628,0.020996919,0.19645268,0.008646538,0.00007967489],"about_ca_topic_score_codex":0.003438174,"about_ca_topic_score_gemma":0.004147703,"teacher_disagreement_score":0.010951852,"about_ca_system_score_codex":0.0030676955,"about_ca_system_score_gemma":0.00405615,"threshold_uncertainty_score":0.05791962},"labels":[],"label_agreement":null},{"id":"W1546714293","doi":"10.1007/978-3-642-15114-9_6","title":"Towards Architecture-Centric Software Generation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Nortel (Canada); Carleton University","funders":"","keywords":"Computer science; Software engineering; Resource-oriented architecture; Reference architecture; Software architecture description; Software architecture; Applications architecture; Database-centric architecture; Architecture; Reuse; Architecture tradeoff analysis method; Component-based software engineering; Solution architecture; Domain (mathematical analysis); Computer architecture; Software; Software development; Operating system; Engineering","score_opus":0.03228527607934365,"score_gpt":0.27016992344658447,"score_spread":0.23788464736724083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546714293","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.006453066,0.0003062769,0.978207,0.00036054358,0.00008243173,0.00008198391,0.00006263485,0.0031771602,0.011268953],"genre_scores_gemma":[0.119538836,0.0007468048,0.86566925,0.00032589817,0.00005121011,0.00016988479,0.00056250626,0.0013153614,0.011620219],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990796,0.0002521785,0.000049976054,0.00012822941,0.000406023,0.00008395026],"domain_scores_gemma":[0.99869317,0.0003458323,0.000051797622,0.00060066907,0.00026762832,0.000040925348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014063115,0.00066680333,0.00037166366,0.0008480678,0.0004413987,0.0015985881,0.0015456893,0.0010632023,0.0045614084],"category_scores_gemma":[0.0030069835,0.00084113504,0.0007357555,0.00095677096,0.00082003366,0.002933081,0.002190708,0.0024705117,0.0023929817],"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.00007468745,0.00014484672,0.00079864817,0.00029664466,0.00005106709,0.00026658314,0.00059144344,0.044341944,0.026860619,0.4076213,0.019426228,0.49952593],"study_design_scores_gemma":[0.000054747583,0.00009906645,0.0004457206,0.00015326907,0.00006932805,0.0005472592,0.00015408621,0.45291963,0.043365393,0.37816125,0.12400122,0.000028908556],"about_ca_topic_score_codex":0.0007377836,"about_ca_topic_score_gemma":0.0016653619,"teacher_disagreement_score":0.0045614084,"about_ca_system_score_codex":0.0006476028,"about_ca_system_score_gemma":0.0013743718,"threshold_uncertainty_score":0.015259385},"labels":[],"label_agreement":null},{"id":"W1546854872","doi":"10.1007/978-3-642-16181-0_18","title":"Mapping Association between Long-Range Cis-Regulatory Regions and Their Target Genes Using Comparative Genomics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Chromatin Dynamics","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":"McGill University","funders":"","keywords":"Synteny; Genome; Enhancer; Biology; Gene; Computational biology; Genetics; Regulatory sequence; Functional genomics; Human genome; Comparative genomics; Genomics; Regulation of gene expression; Transcription factor","score_opus":0.019065456438823566,"score_gpt":0.23584659166542626,"score_spread":0.2167811352266027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546854872","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.7565355,0.014275465,0.20044187,0.00029937335,0.00012894234,0.00015223898,0.0033601483,0.0009103111,0.023896275],"genre_scores_gemma":[0.7549195,0.005458671,0.20871587,0.00039276894,0.00008369164,0.00030837816,0.009903044,0.00050769263,0.019710377],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.00003061714,0.000012065848,0.00017040622,0.00009110634,0.00005529237],"domain_scores_gemma":[0.99965286,0.00019853922,0.000036774254,0.00004555293,0.000029620296,0.000036568683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037656608,0.00034218235,0.0007128202,0.0013083813,0.0006708366,0.00070507394,0.000952199,0.0005959873,0.0056099673],"category_scores_gemma":[0.0003671117,0.00062097545,0.00077838,0.001682748,0.0004231883,0.00054913387,0.0005891431,0.0010745791,0.002508744],"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.000070005546,0.000020228696,0.001116097,0.00009909916,0.000022526188,0.00005861562,0.000054089902,0.00021406543,0.9849984,0.00069019466,0.0001307746,0.012525947],"study_design_scores_gemma":[0.00004985112,0.0002585114,0.08621468,0.000043752963,0.00017156087,0.0017417973,0.000272674,0.0036359255,0.8805766,0.0047949497,0.022187287,0.00005238112],"about_ca_topic_score_codex":0.0020867763,"about_ca_topic_score_gemma":0.005261174,"teacher_disagreement_score":0.0056099673,"about_ca_system_score_codex":0.00048164141,"about_ca_system_score_gemma":0.00027782217,"threshold_uncertainty_score":0.018767178},"labels":[],"label_agreement":null},{"id":"W1546884344","doi":"10.1007/978-3-642-13923-9_15","title":"Computerized Pork Quality Evaluation System","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","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":"McGill University","funders":"","keywords":"Principal component analysis; Hyperspectral imaging; Linear discriminant analysis; Artificial intelligence; Pattern recognition (psychology); Hypercube; Computer science; Quality (philosophy); Mathematics; Computer vision","score_opus":0.0356077043467755,"score_gpt":0.3207598237616105,"score_spread":0.285152119414835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546884344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1619093,0.0013665757,0.65996665,0.0003033276,0.00023587608,0.0017553724,0.031004554,0.103550926,0.03990747],"genre_scores_gemma":[0.40089217,0.00081990246,0.4767838,0.00029681323,0.00008323816,0.0014206256,0.05108479,0.0022567357,0.06636182],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992378,0.00009203617,0.00008154855,0.00019527586,0.00035842956,0.000034922763],"domain_scores_gemma":[0.9982256,0.0002757456,0.00011865123,0.00020277618,0.0011179958,0.00005927593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011073833,0.0006761679,0.0009902149,0.0027969212,0.00043343767,0.001190279,0.0008575317,0.00047130848,0.029052585],"category_scores_gemma":[0.0019392385,0.00030785223,0.00041557557,0.0018508795,0.0002131262,0.0012020246,0.0008285879,0.00031233547,0.009777308],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025563773,0.00055288203,0.015923457,0.00068781554,0.00015867519,0.0001623199,0.00011153861,0.0074789943,0.05911084,0.0021167551,0.049657248,0.861483],"study_design_scores_gemma":[0.00063334656,0.0014083467,0.105753385,0.00022900438,0.000707365,0.0011718025,0.00042737284,0.5337744,0.18565674,0.004368329,0.16556655,0.00030336445],"about_ca_topic_score_codex":0.0034909272,"about_ca_topic_score_gemma":0.0033540144,"teacher_disagreement_score":0.029052585,"about_ca_system_score_codex":0.0006172765,"about_ca_system_score_gemma":0.0007072442,"threshold_uncertainty_score":0.09719056},"labels":[],"label_agreement":null},{"id":"W1546953651","doi":"10.1007/11581062_61","title":"Automatic Keyword Extraction by Server Log Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Web page; Information retrieval; Static web page; World Wide Web; Web server; Web navigation; The Internet","score_opus":0.011167238721283796,"score_gpt":0.27492132079478504,"score_spread":0.26375408207350126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546953651","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.075584635,0.0035394034,0.7895546,0.0005223937,0.00041320722,0.00049219973,0.01240016,0.10837224,0.009121183],"genre_scores_gemma":[0.34761077,0.0033527652,0.57453144,0.00027260403,0.0003829999,0.0004405843,0.035393387,0.0051324638,0.032883074],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916315,0.000082773266,0.00010145917,0.00013020087,0.00043479586,0.00008765115],"domain_scores_gemma":[0.9978956,0.0007847112,0.00015815243,0.00032705255,0.00075785856,0.0000766812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042770032,0.0011781125,0.0015283265,0.004703983,0.000619342,0.0019526697,0.0010022054,0.00062781124,0.007658174],"category_scores_gemma":[0.0025862087,0.00056769943,0.00079351966,0.004208406,0.00026009095,0.002800674,0.0009091356,0.00058624696,0.018203698],"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.0006070975,0.00016901197,0.0030421792,0.0006520151,0.00005995244,0.00046260768,0.00012983115,0.0025639813,0.13420203,0.0015166384,0.034782205,0.82181245],"study_design_scores_gemma":[0.00017141442,0.0003967885,0.013021241,0.00016491777,0.00038322964,0.004369494,0.0005485669,0.40827298,0.4629327,0.015986856,0.0935556,0.0001963045],"about_ca_topic_score_codex":0.0018958802,"about_ca_topic_score_gemma":0.0028525533,"teacher_disagreement_score":0.007658174,"about_ca_system_score_codex":0.0004035981,"about_ca_system_score_gemma":0.0011879151,"threshold_uncertainty_score":0.02561915},"labels":[],"label_agreement":null},{"id":"W1546993490","doi":"10.1007/978-3-540-74469-6_12","title":"Adaptive Tuple Differential Coding","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tuple; Computer science; Coding (social sciences); Skew; Encoder; Data compression; Algorithm; Tuple space; Adaptive coding; Outlier; Theoretical computer science; Artificial intelligence; Mathematics; Lossless compression; Discrete mathematics; Statistics","score_opus":0.03403773032016607,"score_gpt":0.26840111310510617,"score_spread":0.2343633827849401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546993490","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.014201919,0.0005999439,0.95391476,0.00032462596,0.00032022543,0.00005017145,0.0002176254,0.0007760438,0.029594688],"genre_scores_gemma":[0.5537577,0.0012768252,0.37885433,0.0007806944,0.0003131768,0.00019588706,0.00086195156,0.0003072656,0.06365218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995023,0.000091276364,0.000019653791,0.0000940146,0.00021105469,0.000081730475],"domain_scores_gemma":[0.99931633,0.0002203219,0.000035906214,0.00023091432,0.0001545333,0.000042062085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043360444,0.00056259375,0.0005818462,0.000597652,0.0005643314,0.001168098,0.0008241652,0.00074568676,0.008536078],"category_scores_gemma":[0.001595126,0.00024200637,0.00039748888,0.0009828415,0.0008038864,0.001040494,0.001900333,0.0011646298,0.0023944436],"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.00035782665,0.00004988938,0.00044854174,0.00009193807,0.00003270923,0.00012867467,0.00013427563,0.043742206,0.03645795,0.51546043,0.010226617,0.39286897],"study_design_scores_gemma":[0.00003803789,0.000101551785,0.0004606779,0.00006304448,0.000031055217,0.0005106233,0.00005254047,0.6600393,0.031494822,0.28240588,0.0247324,0.00007004391],"about_ca_topic_score_codex":0.00064070185,"about_ca_topic_score_gemma":0.00086875254,"teacher_disagreement_score":0.008536078,"about_ca_system_score_codex":0.0006331894,"about_ca_system_score_gemma":0.00066569087,"threshold_uncertainty_score":0.02855599},"labels":[],"label_agreement":null},{"id":"W1546994747","doi":"10.1007/978-3-540-45224-9_33","title":"Fuzzy Coefficients and Fuzzy Preference Relations in Models of Decision Making","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Fuzzy logic; Preference; Fuzzy number; Mathematical optimization; Fuzzy set operations; Preference relation; Class (philosophy); Artificial intelligence; Fuzzy set; Mathematics","score_opus":0.13188344004692884,"score_gpt":0.3646782975278237,"score_spread":0.23279485748089487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546994747","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.030408273,0.00948875,0.928221,0.0023614492,0.00039813918,0.00006619671,0.00016136914,0.0001081718,0.028786644],"genre_scores_gemma":[0.679167,0.009522177,0.29414085,0.0002106576,0.0007319821,0.00029917902,0.00026505638,0.00010512452,0.01555798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684286,0.0019952585,0.0001419791,0.00015567827,0.0007153753,0.00014879594],"domain_scores_gemma":[0.99221134,0.0064229374,0.00031751266,0.00028170334,0.0005964121,0.00017023747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050790994,0.0012474356,0.0012283529,0.002224991,0.00068599195,0.0031813118,0.0013767186,0.0012174404,0.0043438375],"category_scores_gemma":[0.020823713,0.00082888006,0.00093607453,0.0040620277,0.0025641248,0.0070482036,0.0011481264,0.00327755,0.0006556323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002641972,0.00001407859,0.00012521859,0.000118177995,0.00002231704,0.000036622616,0.0002599399,0.022287998,0.00019890713,0.95620644,0.0017491062,0.01895477],"study_design_scores_gemma":[0.000010225875,0.000012178517,0.00006166686,0.00003554927,0.000012710575,0.000027976617,0.000044689496,0.047459718,0.00008087802,0.95008594,0.002154266,0.000014231002],"about_ca_topic_score_codex":0.0031604487,"about_ca_topic_score_gemma":0.0032643666,"teacher_disagreement_score":0.0050790994,"about_ca_system_score_codex":0.0017771121,"about_ca_system_score_gemma":0.0010605681,"threshold_uncertainty_score":0.02686119},"labels":[],"label_agreement":null},{"id":"W1547053294","doi":"10.1007/978-3-642-02767-3_29","title":"Cultural Interface Design Advisor Tool: Research Methodology and Practical Development Efforts","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"National Research Council Canada","funders":"","keywords":"Computer science; Interface (matter); Development (topology); Software engineering; Interface design; User interface; Human–computer interaction; Engineering drawing; Programming language; Operating system; Engineering","score_opus":0.21524750128869755,"score_gpt":0.42650533939774854,"score_spread":0.211257838109051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547053294","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.23102055,0.0010430116,0.67933625,0.0018455382,0.0002601416,0.011434116,0.0018909387,0.006079297,0.06709016],"genre_scores_gemma":[0.23260541,0.0007610557,0.7391345,0.0003932848,0.00004357064,0.0055237524,0.0010810759,0.0009989302,0.019458499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98573303,0.010014646,0.0007911568,0.00091170426,0.002261146,0.00028834149],"domain_scores_gemma":[0.9447002,0.03698698,0.0010446708,0.0049757985,0.011080712,0.0012116412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030900046,0.0013947437,0.0008979531,0.0032493286,0.0015006242,0.0043869163,0.002829178,0.0015052948,0.016808754],"category_scores_gemma":[0.08791005,0.0008381219,0.0005143721,0.0022709665,0.0012661375,0.005372543,0.0031804452,0.0019190236,0.0031239204],"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.0006914048,0.002927669,0.013027749,0.0016653539,0.00006497969,0.00021722847,0.020101044,0.002055618,0.012474442,0.020456204,0.0105237,0.9157946],"study_design_scores_gemma":[0.002223192,0.012641703,0.045722097,0.008343381,0.0016089268,0.0030426898,0.06773893,0.112611674,0.235974,0.039667934,0.469882,0.0005434508],"about_ca_topic_score_codex":0.0030891546,"about_ca_topic_score_gemma":0.0038518438,"teacher_disagreement_score":0.030900046,"about_ca_system_score_codex":0.0022233785,"about_ca_system_score_gemma":0.008618086,"threshold_uncertainty_score":0.16341704},"labels":[],"label_agreement":null},{"id":"W1547059661","doi":"10.1007/11561354_7","title":"A Multiple Path Characterization of Ad-Hoc Network Capacity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Computer science; Throughput; Interference (communication); Wireless ad hoc network; Path (computing); Routing (electronic design automation); Path loss; Channel (broadcasting); Mobile ad hoc network; Computer network; Distributed computing; Topology (electrical circuits); Wireless; Telecommunications; Network packet; Mathematics","score_opus":0.013942518626851757,"score_gpt":0.2107574318717977,"score_spread":0.19681491324494596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547059661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08556964,0.004968904,0.86381173,0.0012217665,0.00017804463,0.00012033161,0.00087822374,0.00054902886,0.04270228],"genre_scores_gemma":[0.9322709,0.002667513,0.056050852,0.00021152991,0.0007389135,0.00025356805,0.00034460987,0.000190683,0.0072715115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828315,0.00043186467,0.000067040724,0.00037226558,0.0005981905,0.00024746818],"domain_scores_gemma":[0.98400486,0.012770598,0.00079494447,0.0010375755,0.0009958512,0.00039611242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019576242,0.0011733035,0.0010579141,0.0043348633,0.0007854391,0.0022383535,0.0022144155,0.0010516449,0.006660083],"category_scores_gemma":[0.013800679,0.0006234335,0.0005706618,0.00431603,0.0027567507,0.008575413,0.0019379146,0.00259647,0.00069942884],"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.00012890194,0.00006349876,0.0016370642,0.00034795757,0.000065758795,0.00022097016,0.0003372514,0.20351602,0.009460025,0.72109056,0.0057375077,0.05739448],"study_design_scores_gemma":[0.000009692231,0.00010831203,0.0012251815,0.000080491045,0.000039953262,0.00064778945,0.00012493192,0.61694515,0.003100417,0.37064427,0.007028406,0.00004542019],"about_ca_topic_score_codex":0.000753936,"about_ca_topic_score_gemma":0.00043786442,"teacher_disagreement_score":0.006660083,"about_ca_system_score_codex":0.0016547006,"about_ca_system_score_gemma":0.0005069137,"threshold_uncertainty_score":0.022280157},"labels":[],"label_agreement":null},{"id":"W1547092959","doi":"10.1007/978-3-540-75759-7_88","title":"Simultaneous Segmentation, Kinetic Parameter Estimation, and Uncertainty Visualization of Dynamic PET Images","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Segmentation; Artificial intelligence; Computer science; Visualization; Scale-space segmentation; Image segmentation; Computer vision; Pattern recognition (psychology)","score_opus":0.008912646637996312,"score_gpt":0.33177069924540253,"score_spread":0.32285805260740624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547092959","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.047861025,0.0012028628,0.94865304,0.00035327056,0.00002386213,0.000022369244,0.00016428184,0.0008387063,0.00088052265],"genre_scores_gemma":[0.64339626,0.0017323743,0.35217467,0.000102634935,0.00009622049,0.000072069386,0.00037492675,0.0006517223,0.0013990969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.00009304869,0.000020568576,0.00006312938,0.000111815396,0.000037297912],"domain_scores_gemma":[0.9990441,0.0005946748,0.00013267773,0.000098426644,0.00008739332,0.00004265129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008554795,0.00087950984,0.0011075136,0.0013850663,0.00033417216,0.0021306644,0.0007658905,0.0013496219,0.001101418],"category_scores_gemma":[0.004413387,0.0010112079,0.0006185318,0.0010927677,0.0004905816,0.0014985694,0.0011579423,0.0009419494,0.00022873555],"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.0014369602,0.00008141961,0.0025143092,0.0006532652,0.0002349504,0.00095116533,0.00044372302,0.2543943,0.33962783,0.011755122,0.0022622051,0.38564476],"study_design_scores_gemma":[0.00002343033,0.000066499895,0.0027320667,0.000030729934,0.00006722675,0.0009105053,0.00006547515,0.91796917,0.062490076,0.013278004,0.0023134567,0.000053381653],"about_ca_topic_score_codex":0.0019790735,"about_ca_topic_score_gemma":0.0023022175,"teacher_disagreement_score":0.0021306644,"about_ca_system_score_codex":0.00050011056,"about_ca_system_score_gemma":0.0006475658,"threshold_uncertainty_score":0.004524231},"labels":[],"label_agreement":null},{"id":"W1547102391","doi":"10.1007/978-3-642-13651-1_23","title":"Fast Decentralized Averaging via Multi-scale Gossip","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Computer science; Logarithm; Pairwise comparison; Computation; Partition (number theory); Graph; Binary logarithm; Theoretical computer science; Random graph; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.014253015160981743,"score_gpt":0.24077551345586343,"score_spread":0.2265224982948817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547102391","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.02483789,0.00036818793,0.96679205,0.00020388959,0.00014866835,0.000040178387,0.000047148056,0.0010275799,0.0065344675],"genre_scores_gemma":[0.88218826,0.00029838036,0.11161373,0.00013341455,0.00015278893,0.00016101095,0.000091343005,0.00021166708,0.0051493687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.00019590167,0.000034359735,0.00012465585,0.0002272395,0.000073426214],"domain_scores_gemma":[0.9982339,0.0011054631,0.000106918706,0.00033980864,0.0001314062,0.00008257106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474358,0.0006843621,0.0015603809,0.0005977685,0.00084187475,0.00087605434,0.0010298858,0.00079053646,0.002372377],"category_scores_gemma":[0.002949435,0.00043258036,0.00056865584,0.00086556404,0.0010303834,0.0018272167,0.0017601346,0.0011015177,0.00043003596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006219557,0.00011621225,0.0005270226,0.00021607964,0.00021183117,0.00024081621,0.00021565802,0.71481484,0.028199594,0.14464174,0.0058929073,0.10430138],"study_design_scores_gemma":[0.00002324755,0.000026959788,0.00010184322,0.0000024687286,0.000012449369,0.000021668666,0.00000924423,0.9692497,0.0011960567,0.028834447,0.00051044085,0.000011384615],"about_ca_topic_score_codex":0.0011252504,"about_ca_topic_score_gemma":0.0017813982,"teacher_disagreement_score":0.002372377,"about_ca_system_score_codex":0.0006138046,"about_ca_system_score_gemma":0.00042949908,"threshold_uncertainty_score":0.007936418},"labels":[],"label_agreement":null},{"id":"W1547126889","doi":"10.1007/3-540-36385-8_24","title":"Design of Aliasing Free Space Compressor in BIST with Maximal Compaction Ratio Using Concepts of Strong and Weak Compatibilities of Response Data Outputs and Generalized Sequence Mergeability","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Aliasing; Computer science; Algorithm; Overhead (engineering); Sequence (biology); Telecommunications","score_opus":0.12102526001238031,"score_gpt":0.30694688600764797,"score_spread":0.18592162599526765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547126889","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.10973919,0.0007505016,0.87995994,0.00022110798,0.00006593737,0.00021145224,0.00016339996,0.0019672324,0.006921185],"genre_scores_gemma":[0.80687356,0.0002672279,0.18962577,0.00021414411,0.00006191412,0.0001525082,0.00017675864,0.000076387405,0.002551658],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998454,0.00002439603,0.000011672547,0.000046325207,0.000044198972,0.000027960958],"domain_scores_gemma":[0.9997651,0.0000731586,0.00006595601,0.000027559347,0.000054402324,0.000013983989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019288203,0.00057208125,0.00043774545,0.00040075544,0.00029223834,0.0005081064,0.00083497015,0.0004251761,0.0017526661],"category_scores_gemma":[0.00031738984,0.00021191446,0.00027045907,0.00041042085,0.0002325575,0.00050058437,0.00030418058,0.00025669226,0.00025396576],"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.0007126909,0.00013232668,0.0009908661,0.00048831874,0.0001363761,0.00033513486,0.00014854652,0.030109057,0.70047605,0.041228686,0.001773775,0.22346818],"study_design_scores_gemma":[0.00027651986,0.001995154,0.0017039184,0.00006952961,0.00030383683,0.001233019,0.000057994188,0.32336566,0.64373237,0.014430573,0.012771338,0.000060092232],"about_ca_topic_score_codex":0.00033816652,"about_ca_topic_score_gemma":0.00085140613,"teacher_disagreement_score":0.0017526661,"about_ca_system_score_codex":0.00034767116,"about_ca_system_score_gemma":0.0004023989,"threshold_uncertainty_score":0.005863309},"labels":[],"label_agreement":null},{"id":"W1547147576","doi":"10.1007/978-3-642-15696-0_64","title":"Recognizing Human Emotional State Based on the Phase Information of the Two Dimensional Fractional Fourier Transform","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Fractional Fourier transform; Computer science; Fourier transform; Artificial intelligence; Short-time Fourier transform; Feature extraction; Pattern recognition (psychology); Biometrics; Speech recognition; Computer vision; Fourier analysis; Mathematics","score_opus":0.04698081869331562,"score_gpt":0.3326339070100653,"score_spread":0.2856530883167497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547147576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33525512,0.0024966933,0.6469085,0.00040116673,0.00032420125,0.00006150607,0.00031880935,0.0004479946,0.013785894],"genre_scores_gemma":[0.8625653,0.001690444,0.1324623,0.00013853465,0.00013155784,0.000036150093,0.00021857275,0.000052955424,0.0027042537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994934,0.000009784146,0.000002676888,0.000012559665,0.000017650822,0.0000080731625],"domain_scores_gemma":[0.9999083,0.000054729604,0.000010936624,0.00000789893,0.000013405314,0.0000047069784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015179372,0.00025028051,0.000221739,0.0003843901,0.00012535509,0.0005225741,0.00014819583,0.00041278847,0.0015072167],"category_scores_gemma":[0.00075707684,0.00009518037,0.00022136004,0.00039553334,0.00029820856,0.0007134509,0.0002044646,0.00026309153,0.00035761815],"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.00047362834,0.00006873609,0.003176676,0.00025540843,0.00005138942,0.00026726883,0.00033977494,0.00804987,0.39766076,0.008840715,0.0021873438,0.57862836],"study_design_scores_gemma":[0.00008562548,0.0005890633,0.06402262,0.00019713618,0.00030511917,0.0049411757,0.00076690124,0.6695936,0.17601381,0.06797164,0.015295337,0.00021799293],"about_ca_topic_score_codex":0.00014603556,"about_ca_topic_score_gemma":0.00016910993,"teacher_disagreement_score":0.0015072167,"about_ca_system_score_codex":0.00006341476,"about_ca_system_score_gemma":0.00007117296,"threshold_uncertainty_score":0.0050421357},"labels":[],"label_agreement":null},{"id":"W1547211606","doi":"10.1007/978-3-642-03641-5_23","title":"Image Registration under Varying Illumination: Hyper-Demons Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Generalization; Computer science; Extension (predicate logic); Algorithm; Optical flow; Image registration; Artificial intelligence; Point (geometry); Image (mathematics); Computer vision; Interpretation (philosophy); Mathematics; Geometry","score_opus":0.01867295029330719,"score_gpt":0.2747065265540911,"score_spread":0.25603357626078393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547211606","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.005848846,0.0003301818,0.9901631,0.00014833489,0.000061511455,0.000046485515,0.00006497078,0.0008364505,0.0025002705],"genre_scores_gemma":[0.065738715,0.00044661626,0.9273697,0.00011092853,0.000045453526,0.00006881616,0.00028563684,0.0003960187,0.005538028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993722,0.00016544439,0.000032097825,0.00014425885,0.00023880154,0.00004733511],"domain_scores_gemma":[0.9995408,0.00012294899,0.000042128304,0.00014457933,0.00012193171,0.000027585873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038033,0.0007691144,0.00077368197,0.0012942188,0.0005098401,0.0013181117,0.0012865756,0.0014232498,0.0041175107],"category_scores_gemma":[0.0019999195,0.00047813472,0.00082084595,0.0016661232,0.00066335493,0.0012716873,0.0014692253,0.0010999563,0.0021776916],"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.00039664924,0.000069348695,0.00066833914,0.00022889314,0.00015686292,0.00014833167,0.00017010301,0.049574114,0.051672265,0.026126744,0.009050625,0.8617378],"study_design_scores_gemma":[0.000061685394,0.00014617601,0.0016879555,0.000050516985,0.00010888665,0.0010606776,0.00010868164,0.8612215,0.07765122,0.024856117,0.032969244,0.00007738396],"about_ca_topic_score_codex":0.00189488,"about_ca_topic_score_gemma":0.00301964,"teacher_disagreement_score":0.0041175107,"about_ca_system_score_codex":0.00045931007,"about_ca_system_score_gemma":0.0009618793,"threshold_uncertainty_score":0.013774455},"labels":[],"label_agreement":null},{"id":"W1547339056","doi":"10.1007/3-540-45554-x_1","title":"Rough Sets: Trends, Challenges, and Prospects","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Rough set; Computer science; Set (abstract data type); Point (geometry); Context (archaeology); Data science; State (computer science); Data mining; Operations research; Management science; Algorithm; Mathematics; Programming language; Geography; Engineering","score_opus":0.03007685333295929,"score_gpt":0.24491337387285458,"score_spread":0.2148365205398953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547339056","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003228708,0.9147483,0.020476524,0.044817854,0.0016502346,0.000018149769,0.000066007146,0.0000870424,0.014907184],"genre_scores_gemma":[0.06358944,0.897126,0.024821967,0.0033137202,0.006495691,0.000056182744,0.00012072113,0.00003924732,0.0044371304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975242,0.000994554,0.00016677988,0.00022361416,0.0009496947,0.0001411077],"domain_scores_gemma":[0.9889314,0.007859673,0.00045371946,0.00044686798,0.0017757331,0.00053251575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010746101,0.00072639756,0.0021906297,0.0025173333,0.00072870014,0.0076570613,0.0020509358,0.0024440086,0.0039754426],"category_scores_gemma":[0.009198117,0.00055322534,0.00071483385,0.005135975,0.0046546836,0.00973758,0.0019474465,0.0042719264,0.0014003728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012824763,0.00012630678,0.0010834504,0.0023808593,0.000060232807,0.00010434496,0.00087613775,0.0029127477,0.00032808073,0.42231396,0.042234164,0.5274514],"study_design_scores_gemma":[0.000037637757,0.00015056698,0.0013079153,0.0017925167,0.00004430572,0.000335028,0.0022981132,0.0060560326,0.00025667468,0.685486,0.30214888,0.00008620908],"about_ca_topic_score_codex":0.0013302028,"about_ca_topic_score_gemma":0.0020915929,"teacher_disagreement_score":0.010746101,"about_ca_system_score_codex":0.0014970012,"about_ca_system_score_gemma":0.0018094822,"threshold_uncertainty_score":0.05683154},"labels":[],"label_agreement":null},{"id":"W1547470232","doi":"10.1007/978-3-642-01181-8_8","title":"The Role of Population Size in Rate of Evolution in Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Evolutionary computation; Population; Population size; Rate of evolution; Evolutionary programming; Computer science; Genetic representation; Evolutionary algorithm; Genetic algorithm; Artificial intelligence; Machine learning; Biology; Genetics; Demography","score_opus":0.0068051540346034545,"score_gpt":0.22680964543433252,"score_spread":0.22000449139972905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547470232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14240061,0.018783085,0.74487686,0.0060081827,0.0011970481,0.00008563133,0.000087051856,0.0003756907,0.08618586],"genre_scores_gemma":[0.85835034,0.007819658,0.11548448,0.00061265,0.000931728,0.00016868832,0.000038077764,0.0005586502,0.016035685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985837,0.00087901246,0.00005244375,0.00016634275,0.0002437604,0.00007464145],"domain_scores_gemma":[0.974534,0.023412166,0.0005012111,0.00074163056,0.00058402924,0.00022705962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005112024,0.00064376014,0.0008156527,0.00060028,0.000566682,0.0021877394,0.001878607,0.0019813022,0.0035864285],"category_scores_gemma":[0.03497263,0.00073411554,0.00064946606,0.0007590674,0.0027260818,0.0053814556,0.0012102599,0.0030031393,0.00045547367],"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.00014175917,0.00006837071,0.002202892,0.00031381528,0.00007453069,0.00023598976,0.0006733033,0.17275193,0.00576648,0.742228,0.0023080653,0.07323486],"study_design_scores_gemma":[0.00007570275,0.00016708928,0.0014417024,0.00016456563,0.00010674476,0.0004615252,0.00012674645,0.46204534,0.0028050416,0.52483904,0.007675255,0.00009121799],"about_ca_topic_score_codex":0.0006601344,"about_ca_topic_score_gemma":0.00067326304,"teacher_disagreement_score":0.005112024,"about_ca_system_score_codex":0.0011771712,"about_ca_system_score_gemma":0.000591039,"threshold_uncertainty_score":0.027035296},"labels":[],"label_agreement":null},{"id":"W1547622250","doi":"10.1007/3-540-45123-4_20","title":"Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":79,"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; Université du Québec à Montréal","funders":"","keywords":"Genome; Sorting; Heuristic; Computer science; Time complexity; Algorithm; Gene rearrangement; Gene; Computational biology; Genetics; Biology; Artificial intelligence","score_opus":0.008509472042093532,"score_gpt":0.22101751444506404,"score_spread":0.2125080424029705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547622250","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.12775266,0.0012141531,0.85339105,0.00027900893,0.00027017237,0.00020463429,0.000613177,0.0025286283,0.013746511],"genre_scores_gemma":[0.40535036,0.0016583089,0.5732431,0.00017756148,0.000111990776,0.0001764302,0.002428442,0.0010425984,0.01581115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995005,0.000090450056,0.00003419249,0.00022151189,0.000100442994,0.00005284999],"domain_scores_gemma":[0.9990854,0.00049913116,0.00012172469,0.00020518323,0.0000528156,0.000035834124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161678,0.0005073848,0.000843285,0.0009514581,0.00046530575,0.0011267118,0.0012906664,0.0006810676,0.006026354],"category_scores_gemma":[0.0021329536,0.00061419,0.0012773874,0.0015696253,0.0011744536,0.0016254637,0.0008923911,0.0010758927,0.002335749],"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.0010085328,0.00014386888,0.0053981617,0.00089111255,0.00015372607,0.0007178423,0.00048551537,0.07994037,0.1855119,0.15675266,0.0075097797,0.56148654],"study_design_scores_gemma":[0.00029362534,0.0006870913,0.006369035,0.00016191999,0.00038978958,0.0040276386,0.0005121235,0.39129788,0.18837442,0.33979917,0.06792962,0.00015764452],"about_ca_topic_score_codex":0.0005213942,"about_ca_topic_score_gemma":0.00096718123,"teacher_disagreement_score":0.006026354,"about_ca_system_score_codex":0.00037148158,"about_ca_system_score_gemma":0.00037909046,"threshold_uncertainty_score":0.020160198},"labels":[],"label_agreement":null},{"id":"W1547629678","doi":"10.1007/978-3-540-68155-7_11","title":"Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Toronto","funders":"","keywords":"Constructive; Constraint satisfaction problem; Knapsack problem; Constraint (computer-aided design); Heuristic; Mathematical optimization; Local search (optimization); Constraint satisfaction; Point (geometry); Mathematics; Computer science; Artificial intelligence; Process (computing)","score_opus":0.030171486859607702,"score_gpt":0.26902450178747395,"score_spread":0.23885301492786626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547629678","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.00989334,0.0006157381,0.9835683,0.00018993717,0.00004498948,0.000059492566,0.000027719592,0.00017210445,0.0054284367],"genre_scores_gemma":[0.335658,0.00087983557,0.65476286,0.0001781244,0.00013776102,0.00041483392,0.00017858144,0.00036194504,0.0074280677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789387,0.0009856154,0.00007115015,0.00020464887,0.00071000116,0.00013481942],"domain_scores_gemma":[0.9947524,0.004026271,0.00031905255,0.0002907379,0.00048929366,0.0001221436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028190813,0.0015840793,0.0023644506,0.001737552,0.00094056915,0.0015771938,0.0025502283,0.0020792205,0.0030876864],"category_scores_gemma":[0.011289655,0.0012848887,0.0015770001,0.0034894648,0.0026512898,0.0019395606,0.002720658,0.0027549672,0.00040129127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084191335,0.000055807413,0.00022395956,0.0001446575,0.00004456196,0.0000520216,0.0000871094,0.84099466,0.0011749462,0.10699686,0.0015724287,0.048568875],"study_design_scores_gemma":[0.000012946495,0.00002608772,0.000056632045,0.000015986374,0.0000076110914,0.00001882208,0.000006799492,0.9682853,0.0003277455,0.030691648,0.00054312736,0.0000073123424],"about_ca_topic_score_codex":0.0045023873,"about_ca_topic_score_gemma":0.004064478,"teacher_disagreement_score":0.0045023873,"about_ca_system_score_codex":0.0020599116,"about_ca_system_score_gemma":0.0020356935,"threshold_uncertainty_score":0.0149457455},"labels":[],"label_agreement":null},{"id":"W1547658473","doi":"10.1007/11553090_8","title":"A Coarse-Coding Framework for a Gene-Regulatory-Based Artificial Neural Tissue","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Coding (social sciences); Artificial neural network; Artificial intelligence; Network topology; Neural coding; Gene regulatory network; Scalability; Gene; Biology; Gene expression; Computer network","score_opus":0.03752346464445932,"score_gpt":0.27802196668814955,"score_spread":0.24049850204369022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547658473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023970597,0.00008171178,0.99423957,0.00007067413,0.000021443326,0.000015314481,0.000032123393,0.00018107246,0.002961],"genre_scores_gemma":[0.21379726,0.0003588245,0.77459514,0.00014670045,0.000059101196,0.00019411757,0.00016262126,0.00029399735,0.010392273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998603,0.000025871836,0.00000687796,0.00002776045,0.00005977798,0.000019283829],"domain_scores_gemma":[0.9998216,0.000078297766,0.000011629425,0.000027403494,0.000044512086,0.000016562164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034813464,0.00036015117,0.0005869757,0.00047742293,0.0004830106,0.0008751141,0.0018012002,0.0009517537,0.0042250566],"category_scores_gemma":[0.0008222465,0.0003299995,0.0007240225,0.0005603157,0.00089542364,0.00071660924,0.0010754992,0.00097381935,0.00071905926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020329946,0.000020279389,0.00010079263,0.00007354818,0.000013555598,0.000086557855,0.00008235945,0.6484722,0.012149938,0.2945587,0.0014524213,0.042969294],"study_design_scores_gemma":[0.0000024810695,0.000006772515,0.000023352935,0.0000035832975,0.0000032887267,0.000017160637,0.000004749344,0.9655075,0.00057904725,0.032660466,0.0011878372,0.000003885102],"about_ca_topic_score_codex":0.0061953356,"about_ca_topic_score_gemma":0.008248637,"teacher_disagreement_score":0.0061953356,"about_ca_system_score_codex":0.0008298869,"about_ca_system_score_gemma":0.00092271535,"threshold_uncertainty_score":0.014134169},"labels":[],"label_agreement":null},{"id":"W1547665694","doi":"10.1007/11761679_13","title":"Optimal Reductions Between Oblivious Transfers Using Interactive Hashing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Hash function; Theoretical computer science; Computer security","score_opus":0.02452952840016438,"score_gpt":0.26604784353527416,"score_spread":0.2415183151351098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547665694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274649,0.0017301091,0.75338316,0.0026446395,0.0010565703,0.0006898869,0.0010458735,0.006161792,0.10582309],"genre_scores_gemma":[0.74750984,0.00086467096,0.19532688,0.00071464153,0.00059345644,0.0007410333,0.0016852542,0.002276276,0.050287906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950139,0.0010531297,0.00022452146,0.0005981013,0.0019035937,0.0012066744],"domain_scores_gemma":[0.99325997,0.0031283263,0.00020682013,0.0028807044,0.00031719176,0.00020693337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020497318,0.0013639987,0.0021352589,0.0015060633,0.002712118,0.0042857085,0.0043840823,0.0023003935,0.019469794],"category_scores_gemma":[0.0070242966,0.0014666065,0.002567382,0.0025901354,0.0035945587,0.011833081,0.007129798,0.0066891084,0.004201781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016474687,0.00052410644,0.00037479942,0.0005774021,0.00012252554,0.00015241935,0.00071605167,0.034668606,0.0083913915,0.8016945,0.023831202,0.1272995],"study_design_scores_gemma":[0.00019735686,0.00010772781,0.000226602,0.00006103024,0.00010693442,0.000109583736,0.00015516413,0.054750692,0.010814171,0.92381275,0.009608857,0.000049191265],"about_ca_topic_score_codex":0.0008911471,"about_ca_topic_score_gemma":0.0013722668,"teacher_disagreement_score":0.019469794,"about_ca_system_score_codex":0.0030544826,"about_ca_system_score_gemma":0.0023855371,"threshold_uncertainty_score":0.065132976},"labels":[],"label_agreement":null},{"id":"W1547799720","doi":"10.1007/978-3-540-73420-8_25","title":"Universal Algebra and Hardness Results for Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Université Laval; Concordia University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Idempotence; Congruence (geometry); Reduct; Discrete mathematics; Semiring; Algebraic number; Combinatorics; Algebra over a field; Computer science; Rough set; Pure mathematics","score_opus":0.020002480328235362,"score_gpt":0.28802100532307223,"score_spread":0.26801852499483686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547799720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10539739,0.0068766773,0.7168661,0.020854207,0.0010687737,0.0004217868,0.0031475858,0.0013736393,0.14399393],"genre_scores_gemma":[0.82816446,0.005572629,0.121399835,0.0038252773,0.0036350812,0.0008685968,0.0053511476,0.0007065543,0.03047642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99266243,0.0018191678,0.0004987489,0.0016079167,0.0023253136,0.0010864227],"domain_scores_gemma":[0.97559935,0.018705811,0.00094748824,0.0024256115,0.0012483061,0.0010735057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080451,0.0018387702,0.0029056435,0.0037059216,0.00455795,0.008505128,0.005798149,0.0029952233,0.016016051],"category_scores_gemma":[0.023094922,0.0018524968,0.0044476595,0.007916773,0.007537728,0.023761913,0.007635627,0.0155014135,0.0015187777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014830231,0.0001580292,0.00053890113,0.0003877802,0.00009131526,0.00010211679,0.0004923912,0.007809574,0.0005762646,0.96153355,0.008808485,0.019353231],"study_design_scores_gemma":[0.000019595724,0.000010058023,0.00012621611,0.000020385754,0.000021276697,0.000044763823,0.00006328589,0.007156251,0.00022505691,0.99046737,0.0018319382,0.000013775367],"about_ca_topic_score_codex":0.003227294,"about_ca_topic_score_gemma":0.0028022365,"teacher_disagreement_score":0.016016051,"about_ca_system_score_codex":0.0038060776,"about_ca_system_score_gemma":0.0023705459,"threshold_uncertainty_score":0.053578973},"labels":[],"label_agreement":null},{"id":"W1547801334","doi":"10.1007/11559573_9","title":"Mutual Information-Based Methods to Improve Local Region-of-Interest Image Registration","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Image registration; Computer science; Mutual information; Artificial intelligence; Region of interest; Computer vision; Similarity (geometry); Similarity measure; Image (mathematics); Pattern recognition (psychology)","score_opus":0.030484618543668962,"score_gpt":0.3253488648489821,"score_spread":0.29486424630531316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547801334","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.003067267,0.0003709617,0.9951609,0.000051512827,0.0000350098,0.00002841777,0.00003271723,0.0006785144,0.0005747559],"genre_scores_gemma":[0.07433287,0.00061692204,0.9200603,0.00011194755,0.00010867975,0.00015069649,0.000351135,0.00088043575,0.0033870854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790406,0.0005335497,0.00012439027,0.0003124998,0.0010166677,0.000108868044],"domain_scores_gemma":[0.99715304,0.001369502,0.0002598168,0.0004479246,0.00071035343,0.000059297683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023486977,0.0014120768,0.0020587759,0.0025823112,0.0007496418,0.0014608587,0.0028084368,0.001839953,0.0032605443],"category_scores_gemma":[0.006424312,0.0010459985,0.0017496763,0.00300453,0.000959197,0.0024266231,0.0029842884,0.001964854,0.001756968],"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.00040851108,0.00021698156,0.0006232276,0.00035161502,0.00041286196,0.00012651028,0.0002933079,0.19663884,0.06252522,0.021293357,0.00701315,0.7100965],"study_design_scores_gemma":[0.000021007416,0.000075625074,0.00050409214,0.000015554973,0.000077691606,0.00017649734,0.000021988808,0.96116304,0.02792422,0.0064622047,0.0035163192,0.000041700212],"about_ca_topic_score_codex":0.0026735298,"about_ca_topic_score_gemma":0.005445018,"teacher_disagreement_score":0.0032605443,"about_ca_system_score_codex":0.00085646234,"about_ca_system_score_gemma":0.00095240277,"threshold_uncertainty_score":0.012421191},"labels":[],"label_agreement":null},{"id":"W1547835462","doi":"10.1007/978-3-642-22056-2_39","title":"A Coordination Space Architecture for Service Collaboration and Cooperation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation Ireland; Canada Millennium Scholarship Foundation","keywords":"Computer science; Architecture; Event (particle physics); Service (business); Software architecture; Service-oriented architecture; Reference architecture; Software engineering; Resource-oriented architecture; Software; Space (punctuation); Knowledge management; Process management; Component-based software engineering; World Wide Web; Web service; Software system; Engineering; Operating system; Business","score_opus":0.012060388983131873,"score_gpt":0.23196202865846147,"score_spread":0.2199016396753296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547835462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047816695,0.0005196937,0.9716731,0.0006232159,0.00016324139,0.00011281238,0.00007273032,0.002055699,0.01999789],"genre_scores_gemma":[0.23449895,0.0011444483,0.7301532,0.0002532405,0.00017007,0.0005136311,0.00036378604,0.00043281534,0.032469958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869436,0.0003853334,0.00011694617,0.00020406612,0.00041310998,0.00018623237],"domain_scores_gemma":[0.99913436,0.00023942624,0.000048479098,0.00025892272,0.00020788523,0.00011104196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017518097,0.0007606452,0.00068785547,0.0010471377,0.002164433,0.0051508658,0.0018244869,0.0018871813,0.008156974],"category_scores_gemma":[0.0020668455,0.000716889,0.00095709926,0.0017080333,0.0026845085,0.004560822,0.003235265,0.0025720298,0.0022209203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006754899,0.000035364174,0.00014751677,0.00008652856,0.00002138163,0.00009478883,0.0005628538,0.018033484,0.0028688149,0.9147559,0.0062533314,0.05707253],"study_design_scores_gemma":[0.00008111245,0.00009805083,0.00018077632,0.00009004681,0.00007305264,0.00031018117,0.000348381,0.22787324,0.006306552,0.61341685,0.15116327,0.000058462785],"about_ca_topic_score_codex":0.0058702175,"about_ca_topic_score_gemma":0.005572736,"teacher_disagreement_score":0.008156974,"about_ca_system_score_codex":0.0018576547,"about_ca_system_score_gemma":0.0025711725,"threshold_uncertainty_score":0.02728784},"labels":[],"label_agreement":null},{"id":"W1547865988","doi":"10.1007/978-3-540-88192-6_10","title":"Enhancing Text Categorization Using Sentence Semantics","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Categorization; Natural language processing; Sentence; Phrase; Term (time); Weighting; Artificial intelligence; Set (abstract data type); Semantics (computer science); Meaning (existential); Text categorization; Word (group theory); Information retrieval; Linguistics","score_opus":0.026956552141217945,"score_gpt":0.2548127334415361,"score_spread":0.22785618130031815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547865988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12377659,0.0030991447,0.84370494,0.0008646567,0.0011671068,0.00032518088,0.001897278,0.013924554,0.011240491],"genre_scores_gemma":[0.38173795,0.0013274018,0.594223,0.0004970295,0.000785614,0.0002798009,0.0074482122,0.0010572469,0.012643761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.00012276055,0.000056679593,0.00012809283,0.00016060098,0.000042905725],"domain_scores_gemma":[0.99859685,0.0005346497,0.00009090124,0.00013893354,0.0005810966,0.0000575261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201555,0.0009890627,0.00082440436,0.002151814,0.0004754127,0.001264213,0.00067987916,0.0006772042,0.0052025965],"category_scores_gemma":[0.0023184658,0.00020421638,0.00082002033,0.0017445949,0.00023856059,0.00297771,0.0010762474,0.0008022938,0.004366781],"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.00038591167,0.0003390405,0.0011815262,0.0004826321,0.00006929864,0.00012671483,0.00024011233,0.0023882021,0.14175117,0.0033449782,0.020822063,0.8288682],"study_design_scores_gemma":[0.00020925229,0.0012680071,0.008392013,0.00024030702,0.00080681796,0.0014700417,0.0011956376,0.5572176,0.2924755,0.060127176,0.076456964,0.0001406118],"about_ca_topic_score_codex":0.0007352123,"about_ca_topic_score_gemma":0.0012487919,"teacher_disagreement_score":0.0052025965,"about_ca_system_score_codex":0.00027263194,"about_ca_system_score_gemma":0.00047683236,"threshold_uncertainty_score":0.017404377},"labels":[],"label_agreement":null},{"id":"W1547894260","doi":"10.1007/978-3-540-71229-9_7","title":"Obfuscating Java: The Most Pain for the Least Gain","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Bytecode; Computer science; Java bytecode; Programming language; Java; Control flow; Source code; Obfuscation; Reverse engineering; Exploit; Theoretical computer science; Java annotation; Real time Java; Computer security","score_opus":0.025510513213077044,"score_gpt":0.2771838422285257,"score_spread":0.25167332901544864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547894260","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.055693075,0.052814666,0.5476658,0.07095432,0.0044195936,0.000103656086,0.00038274343,0.010779087,0.2571872],"genre_scores_gemma":[0.5533299,0.029399628,0.2830711,0.010696688,0.004086673,0.00010206295,0.00039191535,0.0056789475,0.11324304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878484,0.0002058713,0.000047645055,0.00015965039,0.0006300605,0.00017191908],"domain_scores_gemma":[0.9971853,0.0013023936,0.0001566278,0.0009808628,0.00025373136,0.000121137775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009373552,0.00082728296,0.00063165603,0.0008295414,0.00082243694,0.0027388597,0.0009847225,0.0014348857,0.00800419],"category_scores_gemma":[0.0055369944,0.0005949257,0.0006011955,0.00058690493,0.0031821388,0.009100938,0.0023170908,0.004124372,0.0053522573],"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.00030795086,0.0001438025,0.0008133404,0.0004905335,0.000059754588,0.00021736424,0.00046857077,0.0018238805,0.023495916,0.18291184,0.07223774,0.7170293],"study_design_scores_gemma":[0.000055686065,0.00022120123,0.0010516021,0.00069007196,0.00013814608,0.0022221773,0.0003427424,0.01305019,0.032646075,0.6741403,0.27535838,0.00008354296],"about_ca_topic_score_codex":0.0002741113,"about_ca_topic_score_gemma":0.00048493897,"teacher_disagreement_score":0.00800419,"about_ca_system_score_codex":0.0006156062,"about_ca_system_score_gemma":0.0006208577,"threshold_uncertainty_score":0.026776671},"labels":[],"label_agreement":null},{"id":"W1547899855","doi":"10.1007/3-540-44709-1_27","title":"Efficient Implementation of “Large” Stream Cipher Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Bottleneck; Shift register; Boolean function; Key (lock); Block cipher; Algorithm; Cryptosystem; Parallel computing; Theoretical computer science; Arithmetic; Cryptography; Mathematics; Embedded system","score_opus":0.013045707623149126,"score_gpt":0.26455108258408533,"score_spread":0.2515053749609362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547899855","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.08645016,0.000627064,0.892806,0.00067835866,0.00024118634,0.00020263338,0.00024353973,0.0034974602,0.015253575],"genre_scores_gemma":[0.6928397,0.00042129282,0.29074037,0.0003183444,0.00019699383,0.00026852268,0.00047020754,0.00024649626,0.014498017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992787,0.00021080654,0.000063431195,0.000071543924,0.00026894512,0.00010660297],"domain_scores_gemma":[0.9988028,0.00048505803,0.00010077678,0.00040653071,0.00015984218,0.000045083492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065186154,0.000628259,0.0004901867,0.00044739456,0.00053445797,0.0013310424,0.001027754,0.00062869804,0.008443263],"category_scores_gemma":[0.0018660235,0.00045274766,0.00030368162,0.0004987909,0.00054700306,0.002562244,0.0011628667,0.0008891523,0.0018087993],"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.0017114067,0.00030428302,0.000755425,0.0005049105,0.00012126239,0.00037555097,0.00029984766,0.071600296,0.1833902,0.3396521,0.02172051,0.3795643],"study_design_scores_gemma":[0.0003808393,0.00048319183,0.00059976184,0.000079529316,0.0000903707,0.00043750185,0.000054325184,0.61081094,0.2029634,0.14721009,0.03683155,0.000058540558],"about_ca_topic_score_codex":0.00022258586,"about_ca_topic_score_gemma":0.00060242444,"teacher_disagreement_score":0.008443263,"about_ca_system_score_codex":0.0007200986,"about_ca_system_score_gemma":0.00079946325,"threshold_uncertainty_score":0.028245568},"labels":[],"label_agreement":null},{"id":"W1548019825","doi":"10.1007/978-3-540-30201-8_5","title":"Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Alberta","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Local consistency; Computer science; Consistency (knowledge bases); Constraint satisfaction dual problem; Binary constraint; Constraint logic programming; Constraint programming; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.0123489719733718,"score_gpt":0.21227572460906163,"score_spread":0.19992675263568982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548019825","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.049107052,0.00075603207,0.93839985,0.0022251704,0.00010566157,0.00011165313,0.00052358356,0.00049944065,0.008271545],"genre_scores_gemma":[0.7610474,0.000637847,0.22098835,0.001038406,0.00040761978,0.00053352845,0.0011651954,0.0005149496,0.013666646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904779,0.0042661307,0.00047737337,0.001960224,0.0019632326,0.00085512415],"domain_scores_gemma":[0.9567352,0.0306911,0.0026920482,0.006731767,0.0021001473,0.0010497847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063067214,0.001236654,0.0028206056,0.0017297708,0.0017511486,0.0041812295,0.0043723076,0.0029242618,0.006994152],"category_scores_gemma":[0.03810216,0.0024162948,0.0027503553,0.0035917368,0.004036626,0.009205003,0.0036728282,0.006173352,0.0007063524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028737105,0.0001544756,0.0011292675,0.000253443,0.00015966869,0.00023016511,0.00025223714,0.14821821,0.0020217758,0.8228202,0.004294078,0.020179017],"study_design_scores_gemma":[0.000045751276,0.000036324396,0.00024589195,0.000016212804,0.00002968655,0.00010524033,0.000034310462,0.2652778,0.00065545645,0.73244756,0.0010797802,0.000025979542],"about_ca_topic_score_codex":0.0027284927,"about_ca_topic_score_gemma":0.0029524276,"teacher_disagreement_score":0.006994152,"about_ca_system_score_codex":0.0020481125,"about_ca_system_score_gemma":0.0019686401,"threshold_uncertainty_score":0.033353508},"labels":[],"label_agreement":null},{"id":"W1548053363","doi":"10.1007/3-540-46502-2_9","title":"Parallel Predictor Generation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Queen's University","funders":"","keywords":"Computer science; Training set; Range (aeronautics); Regression; Set (abstract data type); Data mining; Machine learning; Artificial intelligence; Data set; Statistics; Mathematics","score_opus":0.02959770801902471,"score_gpt":0.24951881216591523,"score_spread":0.21992110414689053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548053363","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.013787546,0.0004052356,0.93520373,0.00037794703,0.00078543107,0.00029060067,0.0019276555,0.027078575,0.020143194],"genre_scores_gemma":[0.21863838,0.00038620085,0.6964603,0.00051674334,0.00043643254,0.0006680144,0.008436099,0.0032646137,0.07119318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995353,0.00006435267,0.000027811147,0.00016302629,0.00013552695,0.00007406749],"domain_scores_gemma":[0.9992223,0.00015654742,0.000025891251,0.00033215506,0.00021861555,0.000044556647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062316435,0.0012575196,0.00110218,0.0010392095,0.00086428045,0.001318202,0.0015677051,0.00084897265,0.06283176],"category_scores_gemma":[0.0021049888,0.00073925377,0.00093374023,0.001119333,0.0003387764,0.0013707444,0.0015888875,0.0014430439,0.018733472],"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.0006894986,0.00022726705,0.0014233834,0.00016967012,0.00010176242,0.00024472256,0.00005969748,0.04497331,0.015567383,0.022499697,0.08376084,0.8302828],"study_design_scores_gemma":[0.00020254221,0.00016447825,0.0008638311,0.000046080415,0.00010545258,0.0003627915,0.000047280373,0.84527886,0.04464994,0.05393643,0.05428716,0.000055094784],"about_ca_topic_score_codex":0.002265931,"about_ca_topic_score_gemma":0.00442174,"teacher_disagreement_score":0.06283176,"about_ca_system_score_codex":0.00048653662,"about_ca_system_score_gemma":0.0016526373,"threshold_uncertainty_score":0.21019316},"labels":[],"label_agreement":null},{"id":"W1548067747","doi":"10.1007/0-387-34805-0_6","title":"UNIX Password Security - Ten Years Later","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":171,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Password; Password cracking; Unix; Computer science; Password policy; Computer security; Password strength; S/KEY; Operating system; Unix architecture; One-time password; Software","score_opus":0.020045622817876856,"score_gpt":0.2564198743833928,"score_spread":0.23637425156551595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548067747","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039777573,0.029372202,0.05519705,0.033639077,0.03418031,0.0004584555,0.0016577601,0.0057613286,0.7999562],"genre_scores_gemma":[0.05923207,0.002858784,0.005474077,0.0018576836,0.0011498327,0.000061252635,0.00035057968,0.0002985447,0.92871714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999255,0.000106427455,0.000037269052,0.00018534355,0.00022534988,0.00019057594],"domain_scores_gemma":[0.9991478,0.00011403889,0.00003322825,0.0001880917,0.0003361452,0.00018069464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756288,0.000991053,0.00036529527,0.0012072237,0.0012357768,0.0037090303,0.0006468786,0.0018219652,0.037429232],"category_scores_gemma":[0.0019583977,0.0003473905,0.00029989384,0.000877197,0.0012101958,0.0050792373,0.0020643086,0.0034597684,0.026883245],"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.00032771635,0.00021402576,0.0010287191,0.00018038739,0.00001713052,0.0002801582,0.0011085079,0.00057429,0.005653196,0.1969746,0.31182036,0.4818208],"study_design_scores_gemma":[0.00001995223,0.00012391109,0.0008602702,0.000120184326,0.000010079757,0.00029539005,0.00019726448,0.0006894945,0.005422547,0.012144712,0.9800961,0.00002021709],"about_ca_topic_score_codex":0.0020516396,"about_ca_topic_score_gemma":0.0029725146,"teacher_disagreement_score":0.037429232,"about_ca_system_score_codex":0.0016427453,"about_ca_system_score_gemma":0.0013523767,"threshold_uncertainty_score":0.12521327},"labels":[],"label_agreement":null},{"id":"W1548071698","doi":"10.1007/978-3-540-24840-8_55","title":"Comparison of Parallel and Serial Genetic Algorithms for RNA Secondary Structure Prediction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"Simon Fraser University","funders":"","keywords":"Nucleic acid secondary structure; Computer science; Algorithm; RNA; Protein tertiary structure; Biomolecule; Base pair; Protein secondary structure; Dynamic programming; Biomolecular structure; Base (topology); Nucleic acid structure; Function (biology); Sequence (biology); Genetic programming; Theoretical computer science; Computational biology; Protein structure; Artificial intelligence; DNA; Mathematics; Biology; Genetics","score_opus":0.014819119035048275,"score_gpt":0.2584167251990457,"score_spread":0.2435976061639974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548071698","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.55333704,0.0031389282,0.4228039,0.00060900894,0.0005461333,0.00029712412,0.00043779777,0.0067860074,0.012044092],"genre_scores_gemma":[0.58885014,0.0007485374,0.403087,0.00028328082,0.0001595121,0.00022992316,0.0010108905,0.00064615713,0.004984651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988838,0.00041065822,0.00009548627,0.00020066852,0.00029762628,0.00011181376],"domain_scores_gemma":[0.9908432,0.0068397876,0.00021121379,0.00058957393,0.0013135159,0.00020281723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964045,0.0013877929,0.0015083703,0.0019440944,0.0007794043,0.0011550995,0.002322831,0.001621235,0.0036394089],"category_scores_gemma":[0.006742403,0.000597271,0.0009826242,0.0020835735,0.00070534606,0.0017561419,0.00088660244,0.0009664333,0.0006553527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002302205,0.00074139674,0.0034343437,0.00018714213,0.00026746327,0.000065219836,0.00009726581,0.63535863,0.0044388035,0.003470773,0.0029166155,0.34672013],"study_design_scores_gemma":[0.00019398773,0.00020381126,0.00063149823,0.0000070895867,0.000057842088,0.000027075548,0.000025988806,0.99500823,0.001469017,0.0020910045,0.00027548563,0.000008911521],"about_ca_topic_score_codex":0.012211256,"about_ca_topic_score_gemma":0.011934865,"teacher_disagreement_score":0.012211256,"about_ca_system_score_codex":0.0015442035,"about_ca_system_score_gemma":0.0020861588,"threshold_uncertainty_score":0.02428037},"labels":[],"label_agreement":null},{"id":"W1548154052","doi":"10.1007/3-540-45486-1_24","title":"Accelerated Backpropagation Learning: Extended Dynamic Parallel Tangent Optimization Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"","keywords":"Backpropagation; Computer science; Algorithm; Artificial neural network; Convergence (economics); Gradient descent; Rate of convergence; Acceleration; Artificial intelligence","score_opus":0.015339068690620898,"score_gpt":0.24793504692690832,"score_spread":0.23259597823628742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548154052","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.0068235546,0.0003163711,0.9850065,0.00013879348,0.00020820074,0.000057331865,0.000100131394,0.0032288753,0.004120203],"genre_scores_gemma":[0.11571598,0.00040969902,0.8640327,0.00012577859,0.00015513966,0.00023733525,0.00041563142,0.0009070678,0.018000795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994962,0.0000917862,0.000024284973,0.000088974455,0.00025936455,0.000039334962],"domain_scores_gemma":[0.99938726,0.00010606894,0.000034990502,0.00012694462,0.00031534728,0.00002930779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076853676,0.0008902403,0.0010485837,0.00063462305,0.0004938521,0.00093140075,0.0022064731,0.0010958372,0.008210676],"category_scores_gemma":[0.0017992886,0.0005217974,0.0005438661,0.0013185098,0.00037795503,0.0015378651,0.0012922179,0.0013889743,0.0035435706],"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.00023693833,0.0001559164,0.00042076074,0.00013582161,0.00009007525,0.00009905433,0.00005810722,0.34109542,0.0074634566,0.017402576,0.02161071,0.6112312],"study_design_scores_gemma":[0.000016831951,0.000015530652,0.00006946576,0.0000039699867,0.000008541691,0.000029609308,0.000002808208,0.9919803,0.0016263857,0.0029824653,0.0032578288,0.0000062127906],"about_ca_topic_score_codex":0.0059070946,"about_ca_topic_score_gemma":0.0070987977,"teacher_disagreement_score":0.008210676,"about_ca_system_score_codex":0.00057475275,"about_ca_system_score_gemma":0.0016400542,"threshold_uncertainty_score":0.02746749},"labels":[],"label_agreement":null},{"id":"W1548178949","doi":"10.1007/978-3-540-70904-6_39","title":"Biclique Edge Cover Graphs and Confluent Drawings","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Queen's University","funders":"","keywords":"Planarity testing; Heuristics; Cover (algebra); Computer science; Combinatorics; Enhanced Data Rates for GSM Evolution; Planar graph; Graph drawing; Planar; Complete bipartite graph; Book embedding; Graph; Set (abstract data type); Crossing number (knot theory); Mathematics; Bipartite graph; Algorithm; 1-planar graph; Artificial intelligence; Computer graphics (images); Chordal graph; Programming language; Engineering","score_opus":0.018268175329017512,"score_gpt":0.2581348821296759,"score_spread":0.23986670680065839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548178949","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.22544746,0.0026604212,0.38202995,0.0014733816,0.0003091514,0.00019580557,0.0008690216,0.0007591772,0.38625565],"genre_scores_gemma":[0.7738568,0.0039236303,0.11173308,0.0005867671,0.00026536055,0.00029043865,0.0016136114,0.0005186673,0.10721161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996068,0.00009107217,0.000015434687,0.0000793605,0.00013846197,0.0000688024],"domain_scores_gemma":[0.9990226,0.00041970878,0.00010539068,0.00017211915,0.00016057718,0.00011968301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031557586,0.0007579954,0.00058965094,0.001858074,0.0015607895,0.0020098859,0.0010987923,0.0011660418,0.012531956],"category_scores_gemma":[0.0022684808,0.0008007441,0.0004608532,0.0026874384,0.0012204273,0.0026344263,0.0017204144,0.002562747,0.001953706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032407384,0.000026737225,0.00018884563,0.00009042878,0.0000077798195,0.0001441615,0.00022721007,0.0043477756,0.0018519382,0.96510804,0.0051287324,0.022845944],"study_design_scores_gemma":[0.00001213445,0.000012680113,0.0002499898,0.00003162312,0.000013396688,0.00028877286,0.00018625721,0.010801311,0.0011598364,0.97205275,0.015180908,0.000010466717],"about_ca_topic_score_codex":0.0015843592,"about_ca_topic_score_gemma":0.0022509154,"teacher_disagreement_score":0.012531956,"about_ca_system_score_codex":0.0008664915,"about_ca_system_score_gemma":0.0003322924,"threshold_uncertainty_score":0.041923583},"labels":[],"label_agreement":null},{"id":"W1548204199","doi":"10.1007/978-3-642-29863-9_14","title":"What Makes Corporate Wikis Work? Wiki Affordances and Their Suitability for Corporate Knowledge Work","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Affordance; Computer science; Knowledge management; Work (physics); The Internet; Software deployment; Empirical research; Perception; World Wide Web; Human–computer interaction; Engineering; Software engineering; Psychology","score_opus":0.057963681028060834,"score_gpt":0.30191678514831155,"score_spread":0.24395310412025073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548204199","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.6723474,0.011260423,0.04242302,0.010623966,0.00051723927,0.00014912891,0.00042143653,0.0015583801,0.2606989],"genre_scores_gemma":[0.98290044,0.0014070316,0.0110212695,0.00008532584,0.00012854474,0.000050477385,0.0001144852,0.0002195942,0.0040727984],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99733573,0.0011966309,0.00019938542,0.00027542858,0.00075910636,0.00023365246],"domain_scores_gemma":[0.97938055,0.014330463,0.00212897,0.0016189688,0.0012894373,0.0012516548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042079026,0.00031006197,0.00034388373,0.0028237298,0.0022456346,0.015074151,0.0008293047,0.0012379922,0.0057459027],"category_scores_gemma":[0.025954947,0.00054832635,0.00039616125,0.003015623,0.0029830246,0.022911329,0.002988038,0.0008494261,0.0012902564],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005268726,0.0002872372,0.061701033,0.0012388634,0.00010863323,0.0011011661,0.08822214,0.0012677549,0.0074694357,0.29297265,0.01750627,0.52759796],"study_design_scores_gemma":[0.00011535362,0.00038430348,0.07109586,0.0014881181,0.00029269743,0.0033639749,0.16279861,0.013024482,0.008443196,0.43471798,0.3040412,0.00023412646],"about_ca_topic_score_codex":0.0018736841,"about_ca_topic_score_gemma":0.0028980263,"teacher_disagreement_score":0.015074151,"about_ca_system_score_codex":0.00089257007,"about_ca_system_score_gemma":0.0009721604,"threshold_uncertainty_score":0.022253811},"labels":[],"label_agreement":null},{"id":"W1548237836","doi":"10.1007/bfb0023747","title":"Extension of the Karp and miller procedure to lotos specifications","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Université de Montréal","funders":"","keywords":"Computer science; Reachability; Net (polyhedron); Petri net; Programming language; Extension (predicate logic); Reachability problem; Semantics (computer science); Algorithm; Theoretical computer science; Mathematics","score_opus":0.029909750233143375,"score_gpt":0.22699371154997078,"score_spread":0.1970839613168274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548237836","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.0040096855,0.00004528473,0.97909397,0.00021035019,0.000040956707,0.00014308144,0.00019670078,0.001384695,0.014875222],"genre_scores_gemma":[0.18377465,0.0002871077,0.7912238,0.00041216545,0.00012926507,0.0005588766,0.00087700755,0.0018650873,0.020871973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965803,0.0010936433,0.0003316024,0.00042721015,0.0013018323,0.00026550566],"domain_scores_gemma":[0.9944225,0.0024511348,0.00022968775,0.0015982942,0.0012047311,0.00009355695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038175608,0.0007908006,0.00078119035,0.0019731245,0.001463048,0.002055442,0.0021878881,0.0010613105,0.019123886],"category_scores_gemma":[0.013596583,0.00096664234,0.0022742578,0.0021869212,0.002004448,0.0072931745,0.002928898,0.0033216167,0.005375782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001167351,0.00007088002,0.00030156967,0.00016541698,0.00003417706,0.00019536143,0.00047339054,0.005792554,0.002854517,0.84715724,0.006305806,0.13653237],"study_design_scores_gemma":[0.00006100892,0.000064371125,0.00022738124,0.00007396674,0.00006373942,0.0002678825,0.00012983066,0.059594482,0.009160717,0.8908295,0.03945654,0.000070542344],"about_ca_topic_score_codex":0.0018051707,"about_ca_topic_score_gemma":0.002446186,"teacher_disagreement_score":0.019123886,"about_ca_system_score_codex":0.0008437841,"about_ca_system_score_gemma":0.002068462,"threshold_uncertainty_score":0.06397575},"labels":[],"label_agreement":null},{"id":"W1548276524","doi":"10.1007/978-3-540-85988-8_34","title":"Joint Segmentation of Thalamic Nuclei from a Population of Diffusion Tensor MR Images","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health; National Institutes of Health","keywords":"Segmentation; Computer science; Artificial intelligence; Diffusion MRI; Population; Pattern recognition (psychology); Cluster analysis; Scale-space segmentation; Market segmentation; Image segmentation; Consistency (knowledge bases); Computer vision; Magnetic resonance imaging; Medicine","score_opus":0.042578165811634254,"score_gpt":0.31693476319321184,"score_spread":0.2743565973815776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548276524","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.5461018,0.0019851606,0.4473696,0.00041904085,0.000099434255,0.00013263673,0.0010183625,0.0013222041,0.0015518294],"genre_scores_gemma":[0.8649598,0.00079332484,0.12908241,0.00006107513,0.000119407574,0.00008329889,0.0023508351,0.00026959745,0.0022803228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996183,0.00006194174,0.00002237002,0.00013791348,0.00009425552,0.00006514565],"domain_scores_gemma":[0.9990584,0.00023335931,0.00014695697,0.00014340835,0.0003422817,0.0000756086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013803737,0.00077233097,0.0011177362,0.0020826298,0.0004977804,0.0016381635,0.00094613095,0.0011669252,0.00090618577],"category_scores_gemma":[0.0031838361,0.0006166512,0.0014202509,0.0021081252,0.0004976269,0.0006855299,0.00070748356,0.0006638909,0.00060931046],"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.0019299127,0.00033303586,0.048591595,0.00041628213,0.0010372804,0.0009807589,0.0011187932,0.07768987,0.37523225,0.004171606,0.0048002372,0.48369846],"study_design_scores_gemma":[0.0000867852,0.00040916484,0.10245571,0.0000743814,0.00086025824,0.0021424827,0.0004937749,0.7727123,0.10399935,0.012535242,0.0040880605,0.00014249986],"about_ca_topic_score_codex":0.009391286,"about_ca_topic_score_gemma":0.015424386,"teacher_disagreement_score":0.009391286,"about_ca_system_score_codex":0.0006633527,"about_ca_system_score_gemma":0.0011278496,"threshold_uncertainty_score":0.018673241},"labels":[],"label_agreement":null},{"id":"W1548403904","doi":"10.1007/978-3-540-89378-3_5","title":"Knowledge Generation for Improving Simulations in UCT for General Game Playing","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Monte Carlo tree search; Heuristic; Tree (set theory); Variety (cybernetics); Convergence (economics); Artificial intelligence; Domain (mathematical analysis); Machine learning; Theoretical computer science; Monte Carlo method","score_opus":0.06872235864019587,"score_gpt":0.3167640353685558,"score_spread":0.24804167672835992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548403904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029078538,0.00017134682,0.9470039,0.00027841792,0.00010161436,0.00023687322,0.00031145188,0.007318457,0.0154993],"genre_scores_gemma":[0.37978953,0.00013548635,0.61262155,0.0001664906,0.00004446001,0.00029497955,0.0010286494,0.0007611817,0.0051577124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998879,0.00042184835,0.00008076756,0.0002283497,0.00026652473,0.00012353506],"domain_scores_gemma":[0.99652857,0.0020112954,0.000118311895,0.00081115874,0.00044062352,0.00009003193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013350644,0.0009557742,0.0008985517,0.00094790076,0.0007322235,0.0013419566,0.0022723987,0.0014658448,0.0154056195],"category_scores_gemma":[0.009290879,0.00050949684,0.0011448102,0.0008769839,0.00090969756,0.0029882651,0.0026048387,0.001861489,0.0022589066],"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.0005553272,0.00049608905,0.0016043269,0.00047083982,0.000113536364,0.00025893486,0.00040800168,0.40679333,0.008302601,0.06644833,0.011183043,0.50336564],"study_design_scores_gemma":[0.000031185515,0.000037207745,0.000103232305,0.000024385525,0.000030077746,0.000037351696,0.000032181248,0.96448386,0.005005752,0.027298832,0.002908626,0.0000073572446],"about_ca_topic_score_codex":0.0033994657,"about_ca_topic_score_gemma":0.004858897,"teacher_disagreement_score":0.0154056195,"about_ca_system_score_codex":0.0009691266,"about_ca_system_score_gemma":0.0011423625,"threshold_uncertainty_score":0.051536977},"labels":[],"label_agreement":null},{"id":"W1548457950","doi":"10.1007/11566465_113","title":"Experimental Validation of a 3D Dynamic Finite-Element Model of a Total Knee Replacement","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","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":"Queen's University","funders":"","keywords":"Kinematics; Finite element method; Knee Joint; Ligament; Tibia; Total knee replacement; Patella; Femur; Tension (geology); Mechanics; Structural engineering; Physics; Engineering; Orthodontics; Geology; Moment (physics); Anatomy; Classical mechanics; Medicine; Surgery","score_opus":0.014381934837671022,"score_gpt":0.2838373280134349,"score_spread":0.2694553931757639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548457950","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.9263751,0.00014329745,0.06661115,0.00018929287,0.00020743848,0.00025872482,0.002064083,0.0007318392,0.0034191366],"genre_scores_gemma":[0.977004,0.00010562449,0.01963106,0.000037059195,0.000008991534,0.00018118182,0.0009980485,0.00005696237,0.0019770672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992047,0.000110814704,0.000079774676,0.00010547032,0.00042808545,0.00007108012],"domain_scores_gemma":[0.9987349,0.00041670376,0.00011393732,0.00033031736,0.00032212626,0.000081945844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075759174,0.00082576217,0.0006487596,0.00074574753,0.0003537064,0.0008249749,0.001860882,0.0021489626,0.0045896526],"category_scores_gemma":[0.002358,0.0006323122,0.0006386699,0.00042684746,0.00089879404,0.00049030327,0.00074722327,0.00053752353,0.0012513441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018512227,0.0017005337,0.0043427483,0.0004515591,0.000092078124,0.00048165748,0.00071417086,0.61471605,0.33977148,0.0020221309,0.0015730582,0.032283448],"study_design_scores_gemma":[0.00024466947,0.0022091223,0.007682581,0.000057183614,0.000095067684,0.00023765367,0.00023397166,0.8971469,0.08837857,0.00040491926,0.0032211966,0.00008815395],"about_ca_topic_score_codex":0.0033946356,"about_ca_topic_score_gemma":0.00310655,"teacher_disagreement_score":0.0045896526,"about_ca_system_score_codex":0.00042829826,"about_ca_system_score_gemma":0.00090917427,"threshold_uncertainty_score":0.015353918},"labels":[],"label_agreement":null},{"id":"W1548465546","doi":"10.1007/978-3-642-14347-2_15","title":"A Repository of Agile Method Fragments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Toronto","funders":"","keywords":"Agile software development; Agile Unified Process; Computer science; Agile usability engineering; Lean software development; Extreme programming practices; Software deployment; Software engineering; Process (computing); Software; Process management; Knowledge management; Software development process; Data science; Software development; Engineering","score_opus":0.012725943731351613,"score_gpt":0.2719314962684365,"score_spread":0.2592055525370849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548465546","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02198356,0.0034310813,0.8166327,0.002347083,0.00068998424,0.0010043861,0.03484754,0.07078889,0.048274737],"genre_scores_gemma":[0.08024665,0.004348493,0.6848534,0.00042994157,0.0002818756,0.001046621,0.15433976,0.023813378,0.05063987],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99428636,0.0011285623,0.0009111231,0.00072881195,0.0026975046,0.00024763777],"domain_scores_gemma":[0.9645694,0.010086711,0.0020505395,0.014794526,0.006903156,0.0015957446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008702815,0.0017851553,0.0016564099,0.017675683,0.00207155,0.00874152,0.0047170306,0.0020662711,0.020010145],"category_scores_gemma":[0.02740746,0.002447863,0.0017275524,0.018645339,0.0011572333,0.013959478,0.0058730254,0.004204583,0.01427221],"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.00038868748,0.00057340343,0.0058006104,0.0010512101,0.000117195996,0.00093413144,0.0040385197,0.0073353406,0.0054837484,0.034724295,0.12698601,0.8125669],"study_design_scores_gemma":[0.0002811579,0.0004998554,0.007260465,0.0022698976,0.00021689414,0.003987628,0.0017393688,0.060069,0.013957453,0.0821991,0.8270934,0.00042576392],"about_ca_topic_score_codex":0.002687326,"about_ca_topic_score_gemma":0.004997021,"teacher_disagreement_score":0.020010145,"about_ca_system_score_codex":0.0014415372,"about_ca_system_score_gemma":0.003950824,"threshold_uncertainty_score":0.066940606},"labels":[],"label_agreement":null},{"id":"W1548471706","doi":"10.1007/978-3-642-03655-2_4","title":"The Attentive Hearing Aid: Eye Selection of Auditory Sources for Hearing Impaired Users","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Hearing impaired; Hearing aid; Selection (genetic algorithm); Speech recognition; Audiology; Artificial intelligence; Medicine","score_opus":0.020191731213577466,"score_gpt":0.25473393891741186,"score_spread":0.23454220770383438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548471706","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.7194081,0.014704877,0.2154765,0.0006958608,0.00070990226,0.00043154575,0.0011523301,0.006177359,0.04124344],"genre_scores_gemma":[0.7950626,0.007248563,0.14056322,0.0006482928,0.00024559908,0.00031393775,0.00095596805,0.00044013144,0.05452164],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994266,0.000013515932,0.0000030157598,0.0000121555195,0.000020418296,0.000008353823],"domain_scores_gemma":[0.99984443,0.00009290094,0.0000057314,0.000010590165,0.000031061467,0.000015229085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020720494,0.00039553505,0.00023137206,0.00019208038,0.00010705976,0.00026296766,0.00049758307,0.0003850383,0.007633312],"category_scores_gemma":[0.0006320242,0.00011852254,0.00016223056,0.00013348147,0.000101049154,0.00030946865,0.00036697436,0.0002459377,0.0017382634],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021146785,0.00019824534,0.0022240255,0.00042353003,0.00004297746,0.00042107215,0.0004964689,0.00042200135,0.24588099,0.00041385496,0.010275707,0.7370864],"study_design_scores_gemma":[0.0012509488,0.016436348,0.24085523,0.00053283357,0.0010795103,0.025389783,0.002571038,0.049109872,0.50952995,0.0042448225,0.14867845,0.00032123402],"about_ca_topic_score_codex":0.00083847385,"about_ca_topic_score_gemma":0.0016198587,"teacher_disagreement_score":0.007633312,"about_ca_system_score_codex":0.00006114123,"about_ca_system_score_gemma":0.00015541285,"threshold_uncertainty_score":0.025535941},"labels":[],"label_agreement":null},{"id":"W1548484977","doi":"10.1007/978-3-540-69812-8_9","title":"Fast Exact Area Image Upsampling with Natural Biquadratic Histosplines","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Memorial University of Newfoundland; Laurentian University","funders":"","keywords":"Upsampling; Image (mathematics); Natural (archaeology); Computer science; Computer vision; Artificial intelligence; Mathematics; Geology","score_opus":0.021558970506468135,"score_gpt":0.25691283363890266,"score_spread":0.23535386313243453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548484977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006720762,0.00013497406,0.9889241,0.000041479907,0.000036545305,0.000021524214,0.0000378994,0.000579575,0.0035032004],"genre_scores_gemma":[0.07447222,0.0001933199,0.9199091,0.000063730804,0.000039569168,0.00003904013,0.00012258279,0.00028627666,0.0048740725],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965036,0.00005213798,0.000012534638,0.000047829082,0.0002072408,0.00002993667],"domain_scores_gemma":[0.9996699,0.000088591514,0.000023142322,0.00011868926,0.00007356306,0.00002613356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043760278,0.00062986877,0.00052162015,0.00057575066,0.00028393292,0.0008272183,0.00062823977,0.00051925017,0.0065577477],"category_scores_gemma":[0.0008680951,0.00039648122,0.00039154617,0.0006647459,0.0004299101,0.0009957165,0.0010405877,0.0009332183,0.001824038],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004602182,0.000092309514,0.00053024036,0.00030093826,0.000044375953,0.0001279461,0.00025054405,0.03700452,0.12256434,0.080841124,0.010031223,0.7477522],"study_design_scores_gemma":[0.00005180869,0.00014818991,0.00075324683,0.000034865472,0.000028714308,0.0006904789,0.000079571815,0.8685829,0.06647072,0.030540114,0.03258575,0.000033670276],"about_ca_topic_score_codex":0.0007834175,"about_ca_topic_score_gemma":0.002093638,"teacher_disagreement_score":0.0065577477,"about_ca_system_score_codex":0.00030701104,"about_ca_system_score_gemma":0.00028128564,"threshold_uncertainty_score":0.021937788},"labels":[],"label_agreement":null},{"id":"W1548490899","doi":"10.1007/11779148_15","title":"On Weakly Ambiguous Finite Transducers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Nondeterministic algorithm; Transducer; Hierarchy; Ambiguity; Expressive power; Finite set; Computer science; Nondeterministic finite automaton; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Automaton; Acoustics; Physics; Automata theory; Programming language; Mathematical analysis","score_opus":0.010220810517743562,"score_gpt":0.2162199880394688,"score_spread":0.20599917752172522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548490899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044935714,0.008042094,0.6461737,0.004181955,0.0015680395,0.00011094316,0.00043446445,0.0010341929,0.29351884],"genre_scores_gemma":[0.7412635,0.008183083,0.10465861,0.001866614,0.0020299267,0.00039350355,0.0011099842,0.0010732748,0.1394214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984995,0.00039779174,0.00009732135,0.0003052958,0.00054438255,0.00015569982],"domain_scores_gemma":[0.9972746,0.0018122131,0.00007389419,0.000467078,0.00027175876,0.000100419165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011877012,0.0012500195,0.0013874215,0.0015112924,0.0022778497,0.0036150103,0.0013742547,0.0018939619,0.009726194],"category_scores_gemma":[0.004661086,0.0013180376,0.0013265294,0.0019141538,0.006186666,0.010491452,0.005879856,0.005627695,0.00250333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024448746,0.000009014457,0.00008091577,0.00006342363,0.0000045975085,0.000097681914,0.00037083743,0.0011162489,0.00083811744,0.984939,0.0015653803,0.010890395],"study_design_scores_gemma":[0.0000021003452,0.0000050245317,0.00003846897,0.000020276344,0.0000043215687,0.000059909467,0.00004817572,0.0020550152,0.00042365695,0.99115247,0.0061849533,0.000005498999],"about_ca_topic_score_codex":0.0006719733,"about_ca_topic_score_gemma":0.00058167323,"teacher_disagreement_score":0.009726194,"about_ca_system_score_codex":0.0016004201,"about_ca_system_score_gemma":0.00082253094,"threshold_uncertainty_score":0.03253734},"labels":[],"label_agreement":null},{"id":"W1548637683","doi":"10.1007/978-3-642-15874-2_22","title":"New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Hadamard transform; Hadamard three-lines theorem; Hadamard matrix; Complex Hadamard matrix; Hadamard product; Kronecker product; Hadamard's inequality; Mathematics; Block matrix; Hadamard's maximal determinant problem; Matrix (chemical analysis); Hadamard three-circle theorem; Kronecker delta; Combinatorics; Pure mathematics; Computer science; Physics; Mathematical analysis; Eigenvalues and eigenvectors; Materials science; Composite material","score_opus":0.006851824099351875,"score_gpt":0.1847018446053393,"score_spread":0.17785002050598744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548637683","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.13117991,0.0047652274,0.63261485,0.0014599217,0.0011480398,0.00018346665,0.0003651399,0.00077262527,0.2275108],"genre_scores_gemma":[0.57382697,0.0037215662,0.3060435,0.000817876,0.00073531835,0.0003702752,0.0005260263,0.0005533471,0.11340527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.00009643388,0.000022170194,0.00006610893,0.0001226469,0.00005140022],"domain_scores_gemma":[0.99954945,0.00016651727,0.000048754388,0.00007733352,0.000092888586,0.000064968015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181496,0.000803361,0.00058300974,0.002044211,0.0014007484,0.0024583405,0.0007728073,0.0010825188,0.0058313347],"category_scores_gemma":[0.0014288062,0.0005176562,0.00063529843,0.0013875498,0.001725649,0.0027158028,0.0011143724,0.0020912604,0.001484514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016552236,0.00001062733,0.000034399265,0.00003520314,0.0000021515193,0.000054656335,0.00012761963,0.00052414666,0.0023650492,0.98463744,0.0010375527,0.011154508],"study_design_scores_gemma":[0.000013030613,0.000033841996,0.00010421584,0.00002951577,0.0000072238026,0.0005248767,0.00009711483,0.0056491937,0.004387799,0.9674805,0.02164999,0.000022763885],"about_ca_topic_score_codex":0.00023765703,"about_ca_topic_score_gemma":0.00031955892,"teacher_disagreement_score":0.0058313347,"about_ca_system_score_codex":0.0010531594,"about_ca_system_score_gemma":0.0004737367,"threshold_uncertainty_score":0.019507766},"labels":[],"label_agreement":null},{"id":"W1548697732","doi":"10.1007/978-3-642-04840-1_29","title":"Modelling Safe Interface Interactions in Web Applications","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Undo; Hyperlink; Web navigation; World Wide Web; Human–computer interaction; User interface; SAFER; Interface (matter); Web page; Web modeling; Programming language; Operating system; Computer security","score_opus":0.026080309594213594,"score_gpt":0.274858731340608,"score_spread":0.24877842174639442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548697732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027754528,0.00024676498,0.9599337,0.00018288191,0.000070360424,0.00010128519,0.00011167082,0.0013558712,0.010242934],"genre_scores_gemma":[0.5816049,0.00076717784,0.3865552,0.00018653857,0.00008649719,0.00043924426,0.00064712524,0.0019469982,0.027766282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698395,0.0010677692,0.00021286051,0.00028555526,0.001052206,0.00039765835],"domain_scores_gemma":[0.9951645,0.003139864,0.00030992404,0.0006159635,0.0006380566,0.00013178191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020638136,0.0011824443,0.0008204327,0.0009877444,0.0009831707,0.0038183136,0.0028355778,0.0030407798,0.0075925174],"category_scores_gemma":[0.009581638,0.0016959646,0.001598012,0.0007599682,0.0023146097,0.0056357696,0.00290024,0.0036030877,0.0016077483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028189426,0.00019552995,0.0012036065,0.00033078383,0.000059617425,0.00066270935,0.0014462409,0.5228748,0.01007624,0.41646746,0.0024984607,0.043902747],"study_design_scores_gemma":[0.000028605382,0.000036122434,0.00012250856,0.000036329446,0.000026273541,0.00005820419,0.00010292709,0.85236126,0.003399584,0.13836649,0.0054392302,0.000022496151],"about_ca_topic_score_codex":0.008416025,"about_ca_topic_score_gemma":0.006950825,"teacher_disagreement_score":0.008416025,"about_ca_system_score_codex":0.0012382717,"about_ca_system_score_gemma":0.0015706926,"threshold_uncertainty_score":0.025399566},"labels":[],"label_agreement":null},{"id":"W1548715740","doi":"10.1007/978-3-642-15274-0_7","title":"Type Specialization in Aldor","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Western University","funders":"","keywords":"Computer science; Dilemma; Computation; Programming language; Theoretical computer science; Parametric statistics; Type (biology); Symbolic computation; Mathematics","score_opus":0.021458780009846336,"score_gpt":0.2489602511939606,"score_spread":0.22750147118411426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548715740","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032466564,0.0059625776,0.3063123,0.0036276625,0.0022753668,0.000091721544,0.00077245425,0.0050656567,0.6434257],"genre_scores_gemma":[0.54288155,0.0039056966,0.17384553,0.002878304,0.0014073036,0.0001492754,0.0013846295,0.0028487616,0.27069896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987386,0.00031726496,0.00009606239,0.0002883297,0.00036570447,0.00019396958],"domain_scores_gemma":[0.9994784,0.00013536694,0.000032209886,0.00018242681,0.00012671996,0.000044861627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013089977,0.0007093925,0.0009862634,0.0016736328,0.0020748195,0.0036044044,0.0011683801,0.0008542064,0.016648108],"category_scores_gemma":[0.0018671998,0.00068187714,0.0012141538,0.001762347,0.0025477612,0.0070621534,0.0028512923,0.0029341606,0.005194959],"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.000063725885,0.000023225915,0.00024693686,0.00008602261,0.000013535727,0.00008316639,0.0004183686,0.00033493372,0.00058507145,0.91999257,0.014890472,0.063261986],"study_design_scores_gemma":[0.000023488188,0.000019454536,0.0002489321,0.000052595522,0.00003613427,0.0003429783,0.00015074424,0.0018132741,0.0019621,0.80735475,0.18796284,0.000032644628],"about_ca_topic_score_codex":0.0015069756,"about_ca_topic_score_gemma":0.0016846346,"teacher_disagreement_score":0.016648108,"about_ca_system_score_codex":0.0015337464,"about_ca_system_score_gemma":0.00084973936,"threshold_uncertainty_score":0.055693507},"labels":[],"label_agreement":null},{"id":"W1548766114","doi":"10.1007/3-540-46429-8_3","title":"Object Allocation for Distributed Applications with Complex Workloads","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University; IBM (Canada)","funders":"","keywords":"Computer science; Distributed computing; Distributed object; Object (grammar); Artificial intelligence; Common Object Request Broker Architecture","score_opus":0.015631591387648375,"score_gpt":0.24715935828766003,"score_spread":0.23152776690001164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548766114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16120695,0.0022836046,0.82065254,0.0003026485,0.00021133629,0.00010377838,0.000068367226,0.0025881259,0.012582569],"genre_scores_gemma":[0.72730213,0.0008142302,0.2545561,0.00011184357,0.00017438733,0.00015115114,0.00017303569,0.00047768847,0.016239561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996977,0.00007601099,0.000023175344,0.00003629023,0.00010595748,0.000060979524],"domain_scores_gemma":[0.99931633,0.00030560326,0.000039329985,0.00018621032,0.000086563065,0.00006599056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065128156,0.0004181889,0.00056813116,0.0004350894,0.00061410834,0.0010565866,0.0013173987,0.00042771827,0.004038789],"category_scores_gemma":[0.0019480018,0.0003332794,0.00018981242,0.00082854164,0.00040355654,0.0012969613,0.0010525034,0.00049854896,0.00068543875],"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.001570651,0.00024357533,0.0021335308,0.00030557482,0.000057407186,0.00023218979,0.00048337757,0.17710204,0.05136122,0.056713708,0.013773657,0.69602305],"study_design_scores_gemma":[0.00014582313,0.00020043473,0.001303522,0.000025150855,0.000043152246,0.00026276664,0.000099385376,0.90343636,0.016155656,0.06458434,0.013715078,0.000028412267],"about_ca_topic_score_codex":0.00073304004,"about_ca_topic_score_gemma":0.0013148404,"teacher_disagreement_score":0.004038789,"about_ca_system_score_codex":0.00055138126,"about_ca_system_score_gemma":0.00043807356,"threshold_uncertainty_score":0.013511062},"labels":[],"label_agreement":null},{"id":"W1548867233","doi":"10.1007/978-3-540-30115-8_33","title":"Sparse Distributed Memories for On-Line Value-Based Reinforcement Learning","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":52,"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":"Computer science; Reinforcement learning; A priori and a posteriori; Bellman equation; Line (geometry); Function (biology); Scheme (mathematics); Dynamic random-access memory; Distributed computing; Artificial intelligence; Mathematical optimization; Semiconductor memory; Computer hardware","score_opus":0.030305597366027073,"score_gpt":0.26716725850461265,"score_spread":0.2368616611385856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548867233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01083771,0.00028355184,0.9847698,0.00015102932,0.00008832184,0.000037183374,0.000046491677,0.00045662135,0.0033293713],"genre_scores_gemma":[0.81123227,0.0004382778,0.178263,0.0001881378,0.00010862381,0.00027555847,0.00016826698,0.000112538226,0.009213357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997298,0.000069883616,0.000018828088,0.000059242524,0.000081517384,0.000040721956],"domain_scores_gemma":[0.99909234,0.0005368069,0.00006175548,0.00013372785,0.00013768353,0.000037638645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051289523,0.0006754221,0.0011055782,0.0002527729,0.00029811816,0.00088452426,0.0015154385,0.0009264607,0.006860473],"category_scores_gemma":[0.002233867,0.0003885601,0.00035997847,0.00052508287,0.0006667335,0.0011238834,0.0011746667,0.0021624896,0.000712018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021479395,0.00014896643,0.00024615575,0.00013952897,0.000058582737,0.00006860024,0.00007093942,0.7213832,0.0039305976,0.059678137,0.0042894906,0.20977102],"study_design_scores_gemma":[0.000017235492,0.000025111573,0.000032635147,0.0000048666107,0.000005104475,0.000011168268,0.000003840272,0.97245854,0.00055550516,0.026448067,0.00043396564,0.000003915335],"about_ca_topic_score_codex":0.0019570617,"about_ca_topic_score_gemma":0.0035358593,"teacher_disagreement_score":0.006860473,"about_ca_system_score_codex":0.0006177497,"about_ca_system_score_gemma":0.0005345953,"threshold_uncertainty_score":0.02295053},"labels":[],"label_agreement":null},{"id":"W1548891487","doi":"10.1007/978-3-540-85988-8_100","title":"Analysis of Surfaces Using Constrained Regression Models","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Hearing Loss and Rehabilitation","field":"Neuroscience","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Outer ear; Deformation (meteorology); Logistic regression; Support vector machine; Regression; Field (mathematics); Artificial intelligence; Regression analysis; Movement (music); Pattern recognition (psychology); Machine learning; Acoustics; Statistics; Middle ear; Mathematics; Anatomy; Medicine; Geology","score_opus":0.06022997664479031,"score_gpt":0.31194173601844555,"score_spread":0.25171175937365525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548891487","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.0156164225,0.00015270898,0.98246056,0.00007610568,0.000019178206,0.000026800837,0.00015954603,0.0008117912,0.00067689957],"genre_scores_gemma":[0.60367566,0.00077858975,0.38439965,0.00007492,0.00007008264,0.00020840872,0.0016007058,0.0018170645,0.007374902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992423,0.00022677226,0.000030254618,0.00018091142,0.00023293152,0.00008694143],"domain_scores_gemma":[0.9967713,0.0022268393,0.00019526256,0.0003481708,0.0004008878,0.000057580954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429187,0.0013201595,0.0013512785,0.001526877,0.0004295869,0.0019238135,0.0015806818,0.0014456579,0.005078531],"category_scores_gemma":[0.0063067037,0.0011261958,0.0018004777,0.0015631149,0.0007133707,0.0016927369,0.0012876672,0.0016454002,0.0014244858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011629545,0.000054887634,0.0011228457,0.00013462814,0.00007629651,0.00009059968,0.00007352704,0.9016923,0.007827644,0.011561184,0.0015697941,0.07568012],"study_design_scores_gemma":[0.0000017230936,0.0000056842173,0.00013487249,0.000003852429,0.000003416652,0.000008151837,0.0000064313203,0.9964604,0.0005967983,0.0024815283,0.00029295892,0.000004266048],"about_ca_topic_score_codex":0.0072804703,"about_ca_topic_score_gemma":0.0044012098,"teacher_disagreement_score":0.0072804703,"about_ca_system_score_codex":0.00055258634,"about_ca_system_score_gemma":0.0008904333,"threshold_uncertainty_score":0.01698935},"labels":[],"label_agreement":null},{"id":"W1548895590","doi":"10.1007/11568421_13","title":"Semantic Integration in Distributed Multidisciplinary Design Optimization Environments","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Western University","funders":"","keywords":"Computer science; Reusability; Multidisciplinary approach; Multidisciplinary design optimization; Ontology; Software engineering; Systems engineering; Software; Service (business); Distributed computing; Engineering; Programming language","score_opus":0.02295540652687737,"score_gpt":0.2471890027655129,"score_spread":0.22423359623863554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548895590","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.015895132,0.00029523254,0.97375304,0.00020598705,0.000027410146,0.00004251079,0.000038707363,0.00086405786,0.008877938],"genre_scores_gemma":[0.2749549,0.0004141149,0.71749485,0.00009266936,0.000038521703,0.00016478654,0.00041251635,0.00040481874,0.0060228524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977622,0.0009035843,0.00014029806,0.00024083254,0.0008277139,0.0001252582],"domain_scores_gemma":[0.9989619,0.00044741118,0.00007123329,0.00032455754,0.0001415992,0.000053245243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027902673,0.00069760217,0.001014513,0.0010723431,0.0010833503,0.0033014948,0.0019098632,0.0012223352,0.0038387126],"category_scores_gemma":[0.0034603274,0.00096708135,0.0011592192,0.0018595664,0.0010778378,0.004433018,0.004315653,0.0014836073,0.0007575015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002503557,0.0003627947,0.0012780738,0.00023509636,0.00015460725,0.00022764667,0.0011533777,0.3347481,0.0073014954,0.3313066,0.004028015,0.31895387],"study_design_scores_gemma":[0.00005758925,0.00005983608,0.00046428826,0.00006144485,0.000074487165,0.000103668564,0.00029548904,0.6020259,0.0064088376,0.36146468,0.028955378,0.000028426406],"about_ca_topic_score_codex":0.0011596197,"about_ca_topic_score_gemma":0.00205359,"teacher_disagreement_score":0.0038387126,"about_ca_system_score_codex":0.0007726936,"about_ca_system_score_gemma":0.0010789781,"threshold_uncertainty_score":0.01475656},"labels":[],"label_agreement":null},{"id":"W1548953334","doi":"10.1007/978-3-642-15555-0_16","title":"Superpixels and Supervoxels in an Energy Optimization Framework","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":441,"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":"Computer science; Artificial intelligence; Computer vision","score_opus":0.01308034700212096,"score_gpt":0.2652442031675602,"score_spread":0.25216385616543924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548953334","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.0021681595,0.00019093054,0.9966466,0.000051418065,0.000016000798,0.000010311169,0.000017298054,0.000070668495,0.00082856166],"genre_scores_gemma":[0.09246132,0.00061607297,0.89522135,0.00009081904,0.00008221595,0.00009118372,0.0001512275,0.00044000542,0.010845889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972886,0.000078492725,0.000014142623,0.000062905725,0.000092166796,0.000023462637],"domain_scores_gemma":[0.999811,0.00009623233,0.000016277922,0.00002939985,0.00003626279,0.000010791058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007508072,0.00061928504,0.0009944044,0.00059718906,0.0002804475,0.00093808695,0.0015186324,0.0011494961,0.0034219641],"category_scores_gemma":[0.0010704236,0.0007246534,0.0008304929,0.00094096945,0.0006462122,0.0014626357,0.0011239093,0.0011548256,0.0005947024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107723696,0.00006300978,0.00020054252,0.00017830828,0.00006798955,0.00009437173,0.00007770162,0.5526717,0.01589937,0.19733937,0.002834245,0.23046571],"study_design_scores_gemma":[0.0000048651887,0.000017932603,0.00009601885,0.000008757699,0.00001079521,0.000042117612,0.000007292308,0.95776516,0.002035824,0.03804595,0.0019586547,0.000006649316],"about_ca_topic_score_codex":0.0016628158,"about_ca_topic_score_gemma":0.003346501,"teacher_disagreement_score":0.0034219641,"about_ca_system_score_codex":0.00043708205,"about_ca_system_score_gemma":0.00041805417,"threshold_uncertainty_score":0.0114476085},"labels":[],"label_agreement":null},{"id":"W1549034128","doi":"10.1007/978-3-642-02611-9_14","title":"Coefficient-Tracking Speckle Reducing Anisotropic Diffusion","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Western University","funders":"","keywords":"Anisotropic diffusion; Computer vision; Artificial intelligence; Smoothing; Speckle pattern; Tracking (education); Computer science; Diffusion; Edge-preserving smoothing; Speckle noise; Distortion (music); Noise (video); Filter (signal processing); Image (mathematics); Physics","score_opus":0.020521701983570294,"score_gpt":0.2707639098477116,"score_spread":0.2502422078641413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549034128","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.009172438,0.00041700352,0.98274845,0.00009798304,0.000105932995,0.000023799706,0.00003408832,0.0003351334,0.0070651476],"genre_scores_gemma":[0.101846874,0.001350676,0.8737741,0.000120411074,0.00008135363,0.000049260296,0.00027065814,0.00029201838,0.022214746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997967,0.000018523111,0.000007677971,0.000034724973,0.000128475,0.000013961072],"domain_scores_gemma":[0.9996197,0.00010240453,0.00003526954,0.00007070418,0.00015099751,0.000020916725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443018,0.0005793615,0.0005099472,0.0006583027,0.00022010715,0.00062780554,0.00084285793,0.0008820431,0.0017546021],"category_scores_gemma":[0.0010238367,0.00038665716,0.0003710519,0.00082572753,0.00046320344,0.00072998385,0.00081712386,0.0008875985,0.0012068799],"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.00013346026,0.00010475386,0.00043831606,0.00023625273,0.0000595342,0.00015405474,0.00017922683,0.10066913,0.29319403,0.06931376,0.010523595,0.5249939],"study_design_scores_gemma":[0.00001418607,0.000048635527,0.00029444456,0.000021458478,0.000029880954,0.00033426977,0.000014342371,0.89962626,0.076015584,0.011520009,0.0120531535,0.000027855722],"about_ca_topic_score_codex":0.0011696763,"about_ca_topic_score_gemma":0.0016468506,"teacher_disagreement_score":0.0017546021,"about_ca_system_score_codex":0.00030816114,"about_ca_system_score_gemma":0.0003975203,"threshold_uncertainty_score":0.005869746},"labels":[],"label_agreement":null},{"id":"W1549035077","doi":"10.1007/11609773_25","title":"Systematic Construction of Abstractions for Model-Checking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Toronto","funders":"","keywords":"Computer science; Constructive; Model checking; Interpretation (philosophy); Abstract interpretation; Programming language; Theoretical computer science; Process (computing)","score_opus":0.037041112368106886,"score_gpt":0.2962497621532289,"score_spread":0.25920864978512204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549035077","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.00292592,0.00013300937,0.99336064,0.00006619201,0.00003437778,0.00009847666,0.000085741216,0.0019948299,0.0013008511],"genre_scores_gemma":[0.09289112,0.00040278237,0.9019886,0.00009876813,0.000038304286,0.0004270198,0.0005620215,0.001123833,0.0024674637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952933,0.001433894,0.00043170483,0.00060086,0.0017189335,0.0005211826],"domain_scores_gemma":[0.9915792,0.0039013566,0.0002932599,0.0033144946,0.00074950635,0.00016212581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038770388,0.0015543901,0.001865678,0.0018800623,0.0014793475,0.0028244792,0.003706376,0.0014395617,0.0046320697],"category_scores_gemma":[0.012364344,0.0027429094,0.0040003466,0.0017756451,0.0031821325,0.005058515,0.0068204105,0.005877067,0.0022468762],"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.00025422985,0.00020105638,0.0012551987,0.0010931251,0.0001729105,0.0004668584,0.001219225,0.04731102,0.017849598,0.6778071,0.0076256962,0.24474396],"study_design_scores_gemma":[0.00007959784,0.00007517344,0.00024680694,0.00025517237,0.00018856798,0.00020821833,0.00012646268,0.123974785,0.022228923,0.82613873,0.026409207,0.0000683159],"about_ca_topic_score_codex":0.0015109342,"about_ca_topic_score_gemma":0.0023366283,"teacher_disagreement_score":0.0046320697,"about_ca_system_score_codex":0.0013030693,"about_ca_system_score_gemma":0.003413634,"threshold_uncertainty_score":0.020503998},"labels":[],"label_agreement":null},{"id":"W1549086459","doi":"10.1007/978-3-540-71080-6_21","title":"Integrative Visual Data Mining of Biomedical Data: Investigating Cases in Chronic Fatigue Syndrome and Acute Lymphoblastic Leukaemia","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Computer science; Visualization; Data set; Data mining; Data visualization; Set (abstract data type); Data science; Domain (mathematical analysis); Artificial intelligence","score_opus":0.03650813956180147,"score_gpt":0.29485132375716716,"score_spread":0.25834318419536567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549086459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40522143,0.03293089,0.4633178,0.010166352,0.00095737074,0.000800637,0.024661263,0.008911405,0.053032804],"genre_scores_gemma":[0.5195456,0.010856888,0.43361238,0.00085143885,0.00046267212,0.00025668414,0.020028956,0.00065081916,0.013734528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996898,0.00007680655,0.000031174943,0.00006306088,0.000114280556,0.000024880279],"domain_scores_gemma":[0.9988865,0.0007285077,0.000086330154,0.00008615514,0.00014553545,0.000067038716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097540393,0.00047285287,0.00035856428,0.0029594135,0.00021864695,0.0014229551,0.0009525656,0.00039316047,0.0035493746],"category_scores_gemma":[0.0031136982,0.00020447299,0.0006941841,0.0027468356,0.00029088793,0.00068106723,0.0007631937,0.00036827353,0.0007095253],"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.00028416034,0.00011858666,0.023147907,0.0010817309,0.00020364382,0.0013210507,0.00089668337,0.0031351068,0.012998337,0.004931237,0.0423207,0.90956086],"study_design_scores_gemma":[0.0002213485,0.00077517715,0.2884477,0.0024736545,0.001346578,0.027943766,0.00671957,0.18108344,0.0533013,0.12299891,0.31440926,0.00027930483],"about_ca_topic_score_codex":0.0027631905,"about_ca_topic_score_gemma":0.0054093264,"teacher_disagreement_score":0.0035493746,"about_ca_system_score_codex":0.00034453577,"about_ca_system_score_gemma":0.00043204194,"threshold_uncertainty_score":0.011873841},"labels":[],"label_agreement":null},{"id":"W1549097495","doi":"10.1007/978-3-540-45209-6_179","title":"Peer-to-Peer Communication through the Design and Implementation of Xiangqi","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Peer-to-peer; Multimedia; Work (physics); Peer review; Human–computer interaction; World Wide Web","score_opus":0.030342107961868623,"score_gpt":0.29489497611596355,"score_spread":0.2645528681540949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549097495","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01814171,0.00035453227,0.9671387,0.0002510936,0.00013719381,0.0003200245,0.000037177997,0.0033806048,0.010239067],"genre_scores_gemma":[0.41158614,0.00040084432,0.5696759,0.00018071552,0.000045651712,0.0006348854,0.00016522802,0.00025988463,0.017050825],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990087,0.0002654444,0.000066330475,0.00021580106,0.00034348568,0.00010024442],"domain_scores_gemma":[0.9989472,0.00023401817,0.00008380133,0.00024833207,0.00041093878,0.00007562318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015034848,0.000425136,0.0004015754,0.00040247603,0.00082073495,0.0012163584,0.0017849801,0.0007133091,0.005110683],"category_scores_gemma":[0.002602632,0.00036054928,0.00031276487,0.0004327375,0.000659071,0.0018303659,0.0010982403,0.0008501144,0.0012917885],"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.00065584487,0.00036461616,0.002974757,0.00064736203,0.00014461139,0.00045526284,0.002334799,0.04699247,0.08834969,0.16928986,0.016567992,0.6712228],"study_design_scores_gemma":[0.00016748371,0.000698647,0.0011149058,0.00010805821,0.00024140162,0.0006724605,0.00048561292,0.6755762,0.12057205,0.04792061,0.15232585,0.00011667611],"about_ca_topic_score_codex":0.001695018,"about_ca_topic_score_gemma":0.0019992446,"teacher_disagreement_score":0.005110683,"about_ca_system_score_codex":0.0005727611,"about_ca_system_score_gemma":0.0015199244,"threshold_uncertainty_score":0.017096937},"labels":[],"label_agreement":null},{"id":"W1549140495","doi":"10.1007/978-3-540-87700-4_23","title":"Dynamic Cooperative Coevolutionary Sensor Deployment Via Localized Fitness Evaluation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Software deployment; Coevolution; Evolutionary computation; Computation; Evolutionary algorithm; Distributed computing; Range (aeronautics); Wireless sensor network; Artificial intelligence; Algorithm; Computer network; Ecology; Engineering","score_opus":0.018647123594120355,"score_gpt":0.2710565834751944,"score_spread":0.25240945988107405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549140495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12340442,0.00019127417,0.86947256,0.00015720061,0.000034791217,0.000054984346,0.000013954927,0.00032106164,0.006349665],"genre_scores_gemma":[0.9143593,0.00007395107,0.08158973,0.00005791393,0.000013064386,0.00010850581,0.000025148018,0.000060324426,0.0037120208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996836,0.00011119162,0.000011391592,0.0000638926,0.00008324286,0.000046589415],"domain_scores_gemma":[0.9991673,0.0005048946,0.00006411547,0.00010620114,0.0001165403,0.00004098822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007597064,0.00060226716,0.0007163597,0.00042415317,0.00039027876,0.0006154006,0.0010787176,0.0007937215,0.0014670368],"category_scores_gemma":[0.0028885799,0.00040188388,0.00035765566,0.0004452914,0.0006013457,0.0010273115,0.0016101488,0.000585266,0.0002600493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061710314,0.00007575587,0.0010920789,0.000028849874,0.000041358813,0.00008549998,0.00010361197,0.9074439,0.010967642,0.006447329,0.00054635224,0.0731059],"study_design_scores_gemma":[0.000005029258,0.000030854335,0.00018645223,0.0000026087316,0.000006174564,0.00002394456,0.000011524884,0.9975884,0.0008832888,0.0011032121,0.00015490933,0.0000035797614],"about_ca_topic_score_codex":0.0011769773,"about_ca_topic_score_gemma":0.0015817222,"teacher_disagreement_score":0.0014670368,"about_ca_system_score_codex":0.0005062922,"about_ca_system_score_gemma":0.00034580776,"threshold_uncertainty_score":0.004907787},"labels":[],"label_agreement":null},{"id":"W1549168358","doi":"10.1007/3-540-47987-2_70","title":"Assessing Effective Exploration in Open Learning Environments Using Bayesian Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Research and Analysis","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Process (computing); Machine learning; Bayesian network; Artificial intelligence; Bayesian probability; Learning environment; Human–computer interaction","score_opus":0.06376032464322319,"score_gpt":0.37599821951602536,"score_spread":0.3122378948728022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549168358","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.63199246,0.00047921398,0.36453596,0.00012522867,0.000015233107,0.000103930055,0.00017879036,0.00027662492,0.0022925993],"genre_scores_gemma":[0.9225481,0.00022712658,0.0762645,0.0000100413845,0.000010204261,0.00011122428,0.00018342158,0.00004226053,0.0006030657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972928,0.0012641284,0.0001364917,0.00031641676,0.00081449887,0.00017559205],"domain_scores_gemma":[0.9658906,0.03048315,0.0014100334,0.0007529205,0.00081453146,0.00064878823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035170538,0.0009085685,0.00090816815,0.0018090293,0.00045931622,0.0021202213,0.0011618919,0.0018363126,0.0013290542],"category_scores_gemma":[0.031783625,0.00071553,0.00073273026,0.0012950875,0.0009266872,0.007034408,0.002767688,0.0013430152,0.00018223398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008251432,0.00050588674,0.028549377,0.0001705682,0.00024082501,0.000060050912,0.00035199558,0.8476367,0.0025323485,0.0062094457,0.00027028567,0.11264737],"study_design_scores_gemma":[0.000023144305,0.00021112006,0.0057545695,0.00002431742,0.00003250439,0.00003317103,0.00013767078,0.97714406,0.0014916634,0.015001889,0.00012067404,0.000025180234],"about_ca_topic_score_codex":0.003146356,"about_ca_topic_score_gemma":0.0037414832,"teacher_disagreement_score":0.0035170538,"about_ca_system_score_codex":0.0007160048,"about_ca_system_score_gemma":0.0007516186,"threshold_uncertainty_score":0.018600166},"labels":[],"label_agreement":null},{"id":"W1549198005","doi":"10.1007/3-540-45545-0_69","title":"A General Framework for Trinomial Trees","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Calgary","funders":"Mitacs","keywords":"Trinomial; Trinomial tree; Computer science; Valuation of options; Mathematical economics; Applied mathematics; Binomial options pricing model; Algorithm; Mathematics; Econometrics; Discrete mathematics","score_opus":0.031877701075294175,"score_gpt":0.24712062580231378,"score_spread":0.2152429247270196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549198005","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.003877143,0.0008136219,0.9831078,0.0009400809,0.00013636255,0.000044933433,0.0003061409,0.00025731482,0.010516607],"genre_scores_gemma":[0.24388668,0.0041253497,0.6979331,0.0014817008,0.0016083212,0.000810057,0.0018279026,0.0008902074,0.04743671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967204,0.0016461482,0.00020081163,0.0005612423,0.00050016755,0.0003712634],"domain_scores_gemma":[0.99294347,0.0043204958,0.0003854001,0.0011085797,0.00075187796,0.0004901133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005073467,0.0011976417,0.0024799637,0.0026253797,0.0025046638,0.0050934083,0.004539789,0.0035935356,0.022775007],"category_scores_gemma":[0.015337404,0.0015218453,0.0029497535,0.005890577,0.0032695464,0.011509116,0.0039127064,0.0055090077,0.0048342086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050396457,0.000008922789,0.00009033597,0.000025617264,0.000007198067,0.000042265914,0.000079045465,0.0040811617,0.00007006547,0.990022,0.0015664592,0.0040018624],"study_design_scores_gemma":[0.0000054340762,0.0000031245593,0.000031339136,0.000014186,0.0000051247093,0.00005359074,0.00001623538,0.024543593,0.000016531583,0.97143644,0.0038680201,0.000006404152],"about_ca_topic_score_codex":0.00430375,"about_ca_topic_score_gemma":0.006586854,"teacher_disagreement_score":0.022775007,"about_ca_system_score_codex":0.00225563,"about_ca_system_score_gemma":0.0018499873,"threshold_uncertainty_score":0.076189935},"labels":[],"label_agreement":null},{"id":"W1549228503","doi":"10.1007/0-387-34805-0_39","title":"A Design Principle for Hash Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1190,"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; Université du Québec à Montréal","funders":"","keywords":"Hash function; Computer science; Mathematics; Computer security","score_opus":0.06384997702380152,"score_gpt":0.3182864825069628,"score_spread":0.25443650548316127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549228503","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.0027453734,0.001043095,0.9623755,0.0013235293,0.000437201,0.00012070649,0.000104090635,0.0005563417,0.031294227],"genre_scores_gemma":[0.22058938,0.0021294474,0.7249584,0.002088067,0.0012376988,0.00092525536,0.00035322027,0.0006103902,0.047108043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978169,0.0005995431,0.00017474359,0.00037984207,0.00082869845,0.0002001856],"domain_scores_gemma":[0.9979595,0.0008847908,0.000064379776,0.0006913918,0.00032436854,0.00007549332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026857532,0.0012209865,0.00077700085,0.0011166682,0.0018147333,0.0045669074,0.0016681667,0.0028200196,0.006332449],"category_scores_gemma":[0.004552793,0.0015366165,0.0014262818,0.000978123,0.0065797935,0.008319185,0.003329495,0.0060766353,0.00460726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018380182,0.000009985596,0.000028872628,0.000059659968,0.000005678227,0.000017941447,0.00010483788,0.0004654288,0.0009784681,0.9804986,0.002462858,0.015349333],"study_design_scores_gemma":[0.000027695318,0.000037284444,0.00003430499,0.000044034616,0.000014429743,0.0001511615,0.000024107036,0.0034507145,0.002785648,0.95784116,0.035571128,0.000018271528],"about_ca_topic_score_codex":0.00020931833,"about_ca_topic_score_gemma":0.0002274132,"teacher_disagreement_score":0.006332449,"about_ca_system_score_codex":0.0013419004,"about_ca_system_score_gemma":0.0010005583,"threshold_uncertainty_score":0.021184206},"labels":[],"label_agreement":null},{"id":"W1549299641","doi":"10.1007/978-3-540-69068-9_27","title":"Towards a Solution to the “Runs” Conjecture","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":50,"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":"Conjecture; Upper and lower bounds; String (physics); Combinatorics; Mathematics; Computer science; Mathematical physics; Mathematical analysis","score_opus":0.0195496255433816,"score_gpt":0.24630945086831418,"score_spread":0.22675982532493258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549299641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055207662,0.0038909186,0.64721996,0.053046245,0.005281102,0.00009704401,0.0008365425,0.0029315292,0.23148906],"genre_scores_gemma":[0.57780373,0.0042342436,0.27656737,0.019047793,0.00656781,0.00046748543,0.0027833367,0.0030981225,0.10943013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747854,0.00078526465,0.00009948136,0.00066514825,0.00065199827,0.00031953116],"domain_scores_gemma":[0.9902484,0.00594605,0.0003827061,0.0023507024,0.00076584955,0.00030627014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028677136,0.001445682,0.0018677001,0.0011074487,0.0028181646,0.004242308,0.0031089108,0.0048291027,0.018238036],"category_scores_gemma":[0.019153312,0.0010579716,0.0018237507,0.0014985201,0.0065372055,0.01505559,0.0063647614,0.010905105,0.006582306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009862617,0.00003026713,0.00022362759,0.00011293741,0.00002353132,0.00006427424,0.00017147676,0.002473202,0.0005437341,0.95998687,0.022713162,0.013558313],"study_design_scores_gemma":[0.000023249011,0.000010953428,0.0000667298,0.000031881355,0.000010278701,0.000038340757,0.000049978167,0.0061482615,0.00027477485,0.9839631,0.009371085,0.000011433697],"about_ca_topic_score_codex":0.0011582501,"about_ca_topic_score_gemma":0.0011933481,"teacher_disagreement_score":0.018238036,"about_ca_system_score_codex":0.0011878071,"about_ca_system_score_gemma":0.0014143129,"threshold_uncertainty_score":0.061012328},"labels":[],"label_agreement":null},{"id":"W1549312786","doi":"10.1007/3-540-36577-x_12","title":"Proof-Like Counter-Examples","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"is_retracted":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":"Counterexample; Computer science; Property (philosophy); Debugging; Counter-Reformation; Temporal logic; Over-the-counter; Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics","score_opus":0.03468008443113473,"score_gpt":0.2801073801658396,"score_spread":0.24542729573470484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549312786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028886413,0.0014290627,0.51298404,0.0067124167,0.0014892743,0.0004540144,0.00067821,0.0038544035,0.44351226],"genre_scores_gemma":[0.5823701,0.0017585556,0.24144904,0.0030997503,0.00039433604,0.0010862867,0.0008758077,0.0016350386,0.16733108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978662,0.0008905026,0.00012160885,0.0002967885,0.0006091836,0.00021578278],"domain_scores_gemma":[0.9921474,0.005604325,0.00016264812,0.0012722928,0.00063790125,0.00017555773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016852114,0.001273449,0.0007735272,0.001430002,0.0019206629,0.0032004323,0.0016833071,0.0031608483,0.031202203],"category_scores_gemma":[0.013093743,0.00097062264,0.001199714,0.00147839,0.003077056,0.008119139,0.0034837339,0.0034178086,0.0060402206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006846441,0.000045424687,0.00008086497,0.00016411155,0.000011729592,0.00014229731,0.00023049077,0.001170281,0.0010425398,0.9711946,0.010716635,0.015132607],"study_design_scores_gemma":[0.00006384537,0.000028892418,0.00008330318,0.00011273146,0.000038407765,0.0006136472,0.00010436729,0.0095331855,0.0064521804,0.90438396,0.078559026,0.000026500358],"about_ca_topic_score_codex":0.00026517693,"about_ca_topic_score_gemma":0.0004139612,"teacher_disagreement_score":0.031202203,"about_ca_system_score_codex":0.0010523329,"about_ca_system_score_gemma":0.00067986036,"threshold_uncertainty_score":0.10438174},"labels":[],"label_agreement":null},{"id":"W1549353755","doi":"10.1007/11559573_101","title":"Real Time Head Tracking via Camera Saccade and Shape-Fitting","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor; Simon Fraser University; BC Innovation Council","funders":"","keywords":"Ellipse; Computer vision; Artificial intelligence; Computer science; Saccade; Tracking (education); Kalman filter; Orientation (vector space); Position (finance); Mathematics; Eye movement; Geometry","score_opus":0.016563064124393352,"score_gpt":0.2787470036476064,"score_spread":0.26218393952321306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549353755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03802091,0.00060004153,0.9506578,0.00011933837,0.00014912333,0.000060290182,0.00029028155,0.007072504,0.0030297516],"genre_scores_gemma":[0.3630669,0.000475564,0.62609595,0.00015908705,0.00006916001,0.00006511931,0.0005285281,0.00067839964,0.008861376],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999683,0.000039130744,0.000012930091,0.00010459255,0.00012533726,0.00003502877],"domain_scores_gemma":[0.9995141,0.00013476057,0.000043102926,0.00011887759,0.00015685528,0.00003228682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000423989,0.00071469176,0.0008601148,0.0007389784,0.00037060998,0.0008979796,0.0008438709,0.00096901634,0.0039046358],"category_scores_gemma":[0.0014847508,0.00051964034,0.0004436985,0.0011737215,0.00021512472,0.0006799472,0.00085395656,0.0005769649,0.0023771634],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009932483,0.00005899661,0.0018134392,0.00014834647,0.00012102248,0.00021801173,0.0001680649,0.014912851,0.22519755,0.001670663,0.006351526,0.7483464],"study_design_scores_gemma":[0.00010193187,0.0002720367,0.012724552,0.000039493083,0.00012878222,0.0020413846,0.00012534202,0.78479844,0.18731804,0.003598677,0.008764619,0.00008658704],"about_ca_topic_score_codex":0.006027997,"about_ca_topic_score_gemma":0.011637485,"teacher_disagreement_score":0.006027997,"about_ca_system_score_codex":0.00042590225,"about_ca_system_score_gemma":0.0007230758,"threshold_uncertainty_score":0.013062298},"labels":[],"label_agreement":null},{"id":"W1549433704","doi":"10.1007/978-3-540-68825-9_9","title":"Aspects of Inconsistency Resolution in Modular Ontologies","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Modular design; Ontology; Modular programming; Ontology components; Modularity (biology); Ontology-based data integration; Process ontology; Formalism (music); Interface (matter); Focus (optics); Ontology alignment; Description logic; Information retrieval; Software engineering; Process (computing); Theoretical computer science; Programming language","score_opus":0.026038989531925374,"score_gpt":0.24303134031119653,"score_spread":0.21699235077927115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549433704","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.017365152,0.0026881057,0.96109617,0.002137351,0.00017485181,0.000121684425,0.00010139219,0.00042966413,0.015885543],"genre_scores_gemma":[0.39062,0.003260488,0.59545845,0.00075581396,0.0006586784,0.0003125603,0.00073039054,0.0006301748,0.0075734616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9829296,0.0071229218,0.0018717148,0.0018065972,0.005351495,0.00091766],"domain_scores_gemma":[0.96012187,0.028201453,0.0015748255,0.0072194403,0.002430315,0.0004520196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017902583,0.00094787544,0.0016299194,0.003447473,0.0026626736,0.008299731,0.00659029,0.0041278633,0.0055222055],"category_scores_gemma":[0.0536325,0.0023381582,0.0036184844,0.0062662703,0.008314359,0.029797813,0.007361298,0.005868086,0.0006600523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073907955,0.000052580952,0.00053639937,0.0002385885,0.00008447503,0.00035695065,0.00111929,0.010551879,0.00072420406,0.9420997,0.0019268086,0.042235292],"study_design_scores_gemma":[0.0000177635,0.000009176005,0.0001439245,0.000056397184,0.000061502724,0.00021464104,0.00015156047,0.024766337,0.00087484013,0.96923256,0.0044515925,0.000019715126],"about_ca_topic_score_codex":0.00279333,"about_ca_topic_score_gemma":0.001728728,"teacher_disagreement_score":0.017902583,"about_ca_system_score_codex":0.0023927118,"about_ca_system_score_gemma":0.0017122958,"threshold_uncertainty_score":0.09467906},"labels":[],"label_agreement":null},{"id":"W1549440267","doi":"10.1007/978-3-642-18302-7_10","title":"Perceptual Tolerance Intersection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Intersection (aeronautics); Disjoint sets; Computer science; Closeness; Perception; Set (abstract data type); Artificial intelligence; Theoretical computer science; Mathematics; Discrete mathematics; Cartography","score_opus":0.02509609819682561,"score_gpt":0.23036231608231625,"score_spread":0.20526621788549065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549440267","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.04538248,0.0037995495,0.4845496,0.001179534,0.0008112546,0.000111707566,0.0004788096,0.0009257479,0.46276122],"genre_scores_gemma":[0.76678526,0.002468194,0.13329135,0.0003064673,0.00038081297,0.00013731078,0.001102517,0.00053526735,0.094992734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992465,0.00010164826,0.000036226975,0.00026058333,0.0002754748,0.000079615966],"domain_scores_gemma":[0.9994685,0.000119233686,0.00004305819,0.00013494784,0.00017175268,0.00006254764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004196121,0.0006451956,0.0007022648,0.0012092568,0.0013758182,0.0035562012,0.00085373805,0.00077813753,0.03188004],"category_scores_gemma":[0.0021419546,0.00040390485,0.00065639126,0.001207445,0.0015213528,0.0040919697,0.0024354602,0.0016183577,0.003704568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003204288,0.00004998077,0.00053196977,0.00028052306,0.000042003423,0.0002062892,0.0009271093,0.0035405294,0.014059883,0.73889637,0.015195046,0.2259499],"study_design_scores_gemma":[0.00002416397,0.00015588365,0.0029324389,0.00014469665,0.000065543376,0.0010011543,0.0012945667,0.031365793,0.012944025,0.8148159,0.13518314,0.00007275118],"about_ca_topic_score_codex":0.0011172385,"about_ca_topic_score_gemma":0.0008008609,"teacher_disagreement_score":0.03188004,"about_ca_system_score_codex":0.0007976578,"about_ca_system_score_gemma":0.0004706245,"threshold_uncertainty_score":0.1066494},"labels":[],"label_agreement":null},{"id":"W1549442051","doi":"10.1007/11870814_18","title":"On Decomposition of Tame Polynomials and Rational Functions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Polynomial; Rational function; Decomposition; Computer science; Order (exchange); Algebra over a field; Relation (database); Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.009834493856995828,"score_gpt":0.23549988852708403,"score_spread":0.2256653946700882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549442051","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078055665,0.027131066,0.35337368,0.0044537405,0.0023315612,0.000104357576,0.00046509708,0.00044456546,0.5336402],"genre_scores_gemma":[0.6853483,0.019422859,0.11169766,0.0013319827,0.002296301,0.000156211,0.0009978297,0.00046570748,0.17828313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.00009263286,0.000020544237,0.00006818337,0.00012117557,0.000085056665],"domain_scores_gemma":[0.9995982,0.00016844095,0.000037454265,0.000073430565,0.000071143455,0.0000514083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614989,0.0014932326,0.0009902886,0.0020908078,0.0011528317,0.0032602823,0.00078792754,0.00074425124,0.007937341],"category_scores_gemma":[0.001548775,0.0005263411,0.000975613,0.0022912333,0.0043075383,0.00516816,0.0016690427,0.00394931,0.0023162784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015236246,0.000008211879,0.00003133701,0.00003442482,0.0000029977234,0.000021724096,0.00020170034,0.00027890873,0.0002983068,0.98733574,0.0020923864,0.009678833],"study_design_scores_gemma":[0.0000050398435,0.0000061159108,0.000053599633,0.000017945,0.0000030990025,0.00004977312,0.000051356958,0.0005867829,0.0001536075,0.9892407,0.009827308,0.0000045722213],"about_ca_topic_score_codex":0.0007831424,"about_ca_topic_score_gemma":0.0009676085,"teacher_disagreement_score":0.007937341,"about_ca_system_score_codex":0.0017310377,"about_ca_system_score_gemma":0.0005073086,"threshold_uncertainty_score":0.026553035},"labels":[],"label_agreement":null},{"id":"W1549450456","doi":"10.1007/978-3-540-73101-6_28","title":"A Case Study of the Implementation of Agile Methods in a Bioinformatics Project","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Calgary","funders":"","keywords":"Agile software development; Scrum; Project management; Perspective (graphical); Process (computing); Engineering; Project team; Engineering management; Computer science; Process management; Knowledge management; Software engineering; Systems engineering; Software; Software development; Artificial intelligence","score_opus":0.061380940611440546,"score_gpt":0.4003194130550195,"score_spread":0.33893847244357894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549450456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482452,0.0003540548,0.028886477,0.0027453194,0.00009044921,0.00069788,0.00011059676,0.00016062893,0.01870936],"genre_scores_gemma":[0.956795,0.00051243656,0.033116724,0.0004154037,0.000029988536,0.00033214455,0.00011055553,0.000074799056,0.008612928],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9840342,0.011833819,0.00037692752,0.00054137467,0.0018840795,0.0013296792],"domain_scores_gemma":[0.96486527,0.022305435,0.0023921567,0.0023770838,0.0026677311,0.005392325],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011468192,0.0008968774,0.00056782743,0.0017712386,0.0084442375,0.0037695677,0.0037618736,0.006033531,0.0025965404],"category_scores_gemma":[0.023033476,0.0007964726,0.0008272877,0.0026448849,0.0032458447,0.0025272667,0.0040720673,0.0035012134,0.00085054495],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018675848,0.01697214,0.061110757,0.0021355457,0.0003181195,0.10639752,0.48247048,0.015699187,0.019977719,0.037161306,0.014728205,0.2411615],"study_design_scores_gemma":[0.00092496304,0.014243641,0.077187106,0.0020758605,0.00043720004,0.041042402,0.6429935,0.035440523,0.021148877,0.014094412,0.1499208,0.0004907179],"about_ca_topic_score_codex":0.006403812,"about_ca_topic_score_gemma":0.013853848,"teacher_disagreement_score":0.9885318,"about_ca_system_score_codex":0.0030928394,"about_ca_system_score_gemma":0.0041719675,"threshold_uncertainty_score":0.06065029},"labels":[],"label_agreement":null},{"id":"W1549492047","doi":"10.1007/978-3-540-77891-2_2","title":"Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closing (real estate); Line (geometry); Algorithm; Computer science; Mathematics; Political science; Law; Geometry","score_opus":0.07252690889965911,"score_gpt":0.33353765075610664,"score_spread":0.2610107418564475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549492047","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.0030336229,0.0022969446,0.98834616,0.00145904,0.00021510087,0.00003744686,0.00003495238,0.00027114313,0.0043055844],"genre_scores_gemma":[0.22240399,0.0029895194,0.7644464,0.0012394604,0.0018731131,0.00045875434,0.00017909722,0.0012844832,0.0051252623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9786227,0.011932158,0.0009172578,0.0016129381,0.006346937,0.00056796346],"domain_scores_gemma":[0.9175868,0.058043707,0.0041942205,0.011383289,0.006647676,0.002144285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014729478,0.0026381314,0.0028430938,0.0040088557,0.0016326117,0.00828228,0.005841082,0.0047186804,0.0059806393],"category_scores_gemma":[0.09179481,0.0012594945,0.001522376,0.0039642127,0.010697053,0.021451995,0.007986011,0.011055237,0.0014127546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010663715,0.0001357981,0.0007440488,0.00028793514,0.00007638491,0.000029819821,0.00027899703,0.029979333,0.0009358157,0.8317308,0.00681406,0.12888029],"study_design_scores_gemma":[0.000021740507,0.00010250648,0.0002834211,0.00012276917,0.00002783524,0.000053238884,0.00007264474,0.22860429,0.0008179204,0.7621793,0.007682471,0.000031849377],"about_ca_topic_score_codex":0.00086055294,"about_ca_topic_score_gemma":0.00060502096,"teacher_disagreement_score":0.014729478,"about_ca_system_score_codex":0.003059525,"about_ca_system_score_gemma":0.0020154056,"threshold_uncertainty_score":0.07789791},"labels":[],"label_agreement":null},{"id":"W1549661237","doi":"10.1007/978-3-540-69132-7_35","title":"A Standard Method of Developing User Interfaces for a Generic ITS Framework","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; User interface; Human–computer interaction; Programming language","score_opus":0.046584006290769996,"score_gpt":0.3061697593492206,"score_spread":0.2595857530584506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549661237","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.00047198613,0.000017957736,0.9915131,0.000028722883,0.000029264907,0.00017821837,0.00011755186,0.005663304,0.0019798728],"genre_scores_gemma":[0.013769895,0.00008530932,0.9707445,0.00009017776,0.000024953895,0.00077835046,0.00061964436,0.0049121,0.00897499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959628,0.0009963403,0.00055024074,0.00081690226,0.0013989372,0.00027478408],"domain_scores_gemma":[0.99415153,0.0013785829,0.00016308334,0.0026180812,0.0014571156,0.00023166262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038662641,0.0016343871,0.001206381,0.0015926901,0.0012333409,0.005735147,0.0032758946,0.0022875422,0.026797758],"category_scores_gemma":[0.011561795,0.0018691043,0.002864639,0.0013774453,0.0019887877,0.0044576726,0.0044767475,0.004993731,0.014247237],"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.00046795464,0.00027206592,0.0014263544,0.0017225747,0.00026981972,0.0005394622,0.0054846937,0.0063113715,0.05926467,0.32962725,0.049830154,0.5447836],"study_design_scores_gemma":[0.00020959906,0.00034681827,0.0011539895,0.00070177537,0.0003572902,0.0019935747,0.0006793856,0.11910134,0.088672236,0.118427455,0.66807896,0.00027760823],"about_ca_topic_score_codex":0.0018152671,"about_ca_topic_score_gemma":0.0023939644,"teacher_disagreement_score":0.026797758,"about_ca_system_score_codex":0.00084134704,"about_ca_system_score_gemma":0.0023066774,"threshold_uncertainty_score":0.08964747},"labels":[],"label_agreement":null},{"id":"W1549677228","doi":"10.1007/3-540-45821-2_6","title":"A Protocol Stack Development Tool Using Generative Programming","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Protocol (science); Protocol stack; Sketch; Communications protocol; Generative grammar; Distributed computing; Programming language; Reprogramming; Stack (abstract data type); Artificial intelligence; Operating system; Algorithm","score_opus":0.08620018224210127,"score_gpt":0.32497788737744054,"score_spread":0.23877770513533927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549677228","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.001490375,0.000026490856,0.97145575,0.00005618987,0.00003829891,0.00009800108,0.00007291856,0.023467088,0.0032947378],"genre_scores_gemma":[0.050273985,0.00029569847,0.91004074,0.00018400636,0.000035816713,0.0005122119,0.00084857026,0.020173725,0.01763533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988643,0.00023611981,0.00010986562,0.00014132017,0.00055831304,0.000090008136],"domain_scores_gemma":[0.99739057,0.0014659382,0.00010365444,0.0006490406,0.00027982856,0.00011086295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022121535,0.0015028364,0.0007812365,0.0015520459,0.0010018647,0.0024762412,0.002710955,0.001642396,0.017048737],"category_scores_gemma":[0.0053626015,0.0024634816,0.0017377432,0.00094351,0.0012868538,0.0036896945,0.003127471,0.0038193746,0.0055999532],"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.0002605737,0.00039054497,0.0017583191,0.00078440766,0.00016166024,0.0013920651,0.0019343541,0.035177235,0.034058385,0.21917535,0.054026898,0.65088016],"study_design_scores_gemma":[0.0003052139,0.00022905383,0.0006308151,0.00051277276,0.0003274458,0.0030415684,0.0002622156,0.39990488,0.09705566,0.18850018,0.30895355,0.0002765874],"about_ca_topic_score_codex":0.0010372279,"about_ca_topic_score_gemma":0.0014172265,"teacher_disagreement_score":0.017048737,"about_ca_system_score_codex":0.00053549104,"about_ca_system_score_gemma":0.0014902544,"threshold_uncertainty_score":0.057033718},"labels":[],"label_agreement":null},{"id":"W154968520","doi":"10.1007/978-3-642-44949-9_21","title":"A Secure and Privacy-Aware Cloud-Based Architecture for Online Social Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Winnipeg","funders":"","keywords":"Computer science; Cloud computing; Architecture; Overhead (engineering); Computer security; Encryption; Information privacy; Social network (sociolinguistics); Trustworthiness; Secret sharing; Internet privacy; Cryptography; Computer network; World Wide Web; Social media","score_opus":0.02419047251671045,"score_gpt":0.2628071548160704,"score_spread":0.23861668229935998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154968520","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.047914464,0.0012055581,0.9232989,0.0018316996,0.0004982828,0.00090266,0.00060187344,0.0114747975,0.012271862],"genre_scores_gemma":[0.6740191,0.0009470911,0.30207762,0.0009783895,0.00021556903,0.0004963176,0.0010820866,0.0006555367,0.019528227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814475,0.0002527786,0.00014146531,0.00031876052,0.00072722835,0.00041501044],"domain_scores_gemma":[0.9982614,0.00016960876,0.00010638177,0.00070221745,0.0004110263,0.00034938788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014486491,0.0006754575,0.0011208102,0.000851648,0.0031652355,0.0038105552,0.004633169,0.0016802129,0.005003875],"category_scores_gemma":[0.0021875268,0.0006441302,0.0009074183,0.0015448763,0.0011113447,0.0056591057,0.0066259205,0.0019822838,0.0022994922],"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.0029475156,0.0016817932,0.008460668,0.00078207074,0.00055769325,0.0015613092,0.0020800934,0.09997751,0.08378611,0.28871924,0.11919932,0.39024678],"study_design_scores_gemma":[0.00009841679,0.00024164062,0.0015020308,0.00008811531,0.00020075399,0.00068287697,0.00039343897,0.80890715,0.039199915,0.073674865,0.07485503,0.0001557387],"about_ca_topic_score_codex":0.008170024,"about_ca_topic_score_gemma":0.010450722,"teacher_disagreement_score":0.008170024,"about_ca_system_score_codex":0.0023602128,"about_ca_system_score_gemma":0.003289832,"threshold_uncertainty_score":0.017124593},"labels":[],"label_agreement":null},{"id":"W1549690229","doi":"10.1007/978-3-540-30500-2_2","title":"Enumerating Regular Expressions and Their Languages","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Computer science; Enumeration; Programming language; Regular expression; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.009472930485466024,"score_gpt":0.2319570946696085,"score_spread":0.2224841641841425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549690229","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.050372124,0.00256162,0.90647984,0.00096584484,0.00020494021,0.00019736633,0.00095674285,0.003623378,0.034638066],"genre_scores_gemma":[0.19671354,0.0027359237,0.7454829,0.00051500305,0.00023004154,0.0004442427,0.003761804,0.0013538651,0.048762556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976928,0.00060091633,0.0002845552,0.00042169308,0.00082116615,0.00017881308],"domain_scores_gemma":[0.9941147,0.0041391486,0.00021160198,0.0008626254,0.00057597266,0.00009595856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019563902,0.0009593373,0.0014842001,0.0028952167,0.0013775621,0.003856774,0.0023713186,0.0011255275,0.008523786],"category_scores_gemma":[0.00964027,0.0013811621,0.0017175815,0.004090008,0.002232457,0.012157816,0.0031301081,0.003648203,0.0034947398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009349421,0.00007117177,0.0008836593,0.000509485,0.000032994325,0.00015944267,0.0013158381,0.005683835,0.0040123183,0.700685,0.00630808,0.28024462],"study_design_scores_gemma":[0.000011646945,0.000019966159,0.00020210908,0.0001300644,0.000032703287,0.00026515734,0.00017813845,0.014672681,0.004126623,0.96332675,0.017008932,0.000025155721],"about_ca_topic_score_codex":0.0007899544,"about_ca_topic_score_gemma":0.0011614154,"teacher_disagreement_score":0.008523786,"about_ca_system_score_codex":0.0012369279,"about_ca_system_score_gemma":0.0012757501,"threshold_uncertainty_score":0.028514922},"labels":[],"label_agreement":null},{"id":"W1549713128","doi":"10.1007/11922155_17","title":"Solving Probabilistic Combinatorial Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Monte Carlo method; Solver; Heuristic; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.020544321648159714,"score_gpt":0.2557867510401933,"score_spread":0.2352424293920336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549713128","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.02363624,0.0007486827,0.8741169,0.0016679326,0.00018864614,0.00014815819,0.0002812176,0.00071998395,0.098492205],"genre_scores_gemma":[0.49875274,0.0017457014,0.41360703,0.0006156967,0.000448046,0.0005545598,0.0017114696,0.00068633154,0.08187847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.0004667438,0.00007006721,0.0002638905,0.00044223908,0.0001390901],"domain_scores_gemma":[0.99790025,0.0015906307,0.00008330748,0.00020741255,0.00011545215,0.00010289947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315606,0.0013040191,0.0013533662,0.0007475616,0.0010831067,0.0030106052,0.0027082118,0.0016399504,0.019608445],"category_scores_gemma":[0.0073278374,0.0010920548,0.0017626188,0.001629893,0.0014883355,0.004089813,0.0030975007,0.0038349368,0.002015346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005947534,0.00012904001,0.0002776586,0.00026455586,0.00007949046,0.00006263267,0.00018856679,0.08244156,0.000979624,0.83136255,0.009848604,0.07430624],"study_design_scores_gemma":[0.000029169658,0.000018355486,0.000101398946,0.00002429157,0.000022106953,0.0000567456,0.000035565634,0.18869583,0.00049586175,0.80331606,0.0071926103,0.000011926397],"about_ca_topic_score_codex":0.0015758489,"about_ca_topic_score_gemma":0.0025958281,"teacher_disagreement_score":0.019608445,"about_ca_system_score_codex":0.0013122894,"about_ca_system_score_gemma":0.0011806176,"threshold_uncertainty_score":0.06559676},"labels":[],"label_agreement":null},{"id":"W1549745658","doi":"10.1007/978-3-540-74771-0_23","title":"An Improved Algorithm on Detecting Transcription and Translation Motif in Archaeal Genomic Sequences","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"Archaea; Computer science; Computational biology; Start codon; Genome; DNA binding site; Algorithm; Promoter; Biology; Genetics; Base sequence; DNA; Gene","score_opus":0.021747255298977187,"score_gpt":0.256455442541121,"score_spread":0.23470818724214382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549745658","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.028180303,0.00030651342,0.9604809,0.000083043764,0.000086916814,0.00013326894,0.00057138887,0.009188632,0.0009689657],"genre_scores_gemma":[0.029865162,0.000084182655,0.9657815,0.00006999169,0.000032647025,0.00013674493,0.0013628333,0.00034432593,0.0023225995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992106,0.000096997086,0.00007672011,0.00031306894,0.00022182747,0.00008075124],"domain_scores_gemma":[0.9989452,0.00043385715,0.000051397405,0.0002086922,0.00030402464,0.000056777317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008884176,0.0015411671,0.0015345139,0.0019697084,0.0012035678,0.0015950325,0.0024379233,0.0018090147,0.0058142017],"category_scores_gemma":[0.0018782557,0.000831407,0.0011915023,0.002579299,0.0006456172,0.0013825116,0.001603496,0.0011561116,0.0034354483],"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.00090044516,0.00017885651,0.0020964968,0.00029684187,0.00012238177,0.000315561,0.00019451014,0.014780198,0.10036629,0.003065994,0.0064224754,0.87126],"study_design_scores_gemma":[0.00042080224,0.000430264,0.004528674,0.000076256874,0.00026519224,0.0010764867,0.0002490165,0.8372314,0.11415105,0.01547514,0.025995648,0.000100205565],"about_ca_topic_score_codex":0.0030033435,"about_ca_topic_score_gemma":0.0038390136,"teacher_disagreement_score":0.0058142017,"about_ca_system_score_codex":0.00058837264,"about_ca_system_score_gemma":0.0010950941,"threshold_uncertainty_score":0.019450426},"labels":[],"label_agreement":null},{"id":"W1549789849","doi":"10.1007/978-3-540-87883-4_3","title":"Perceptually Informed Roles for Haptic Feedback in Expressive Music Controllers","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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 British Columbia","funders":"","keywords":"Haptic technology; Computer science; Controllability; Gesture; Human–computer interaction; Modalities; Interface (matter); Audio feedback; Simulation; Artificial intelligence; Acoustics","score_opus":0.041848803895819395,"score_gpt":0.2704865409127972,"score_spread":0.22863773701697782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549789849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116533354,0.0057475152,0.56680226,0.0017673211,0.0007392025,0.00011473656,0.000253629,0.0011787456,0.30686316],"genre_scores_gemma":[0.90383047,0.0017977055,0.06634349,0.0001877757,0.00011914482,0.00007496161,0.00009528668,0.00026314092,0.027287882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995554,0.000090911635,0.000022559108,0.00008685851,0.00017154987,0.00007271545],"domain_scores_gemma":[0.9994992,0.00025273138,0.000037445272,0.000108724635,0.00005923948,0.00004270043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062876,0.0006937142,0.00030943032,0.00026252802,0.000679328,0.0052298037,0.0012558546,0.0012887745,0.016674826],"category_scores_gemma":[0.002722155,0.00054543803,0.0004707829,0.00025315853,0.0020250403,0.005215814,0.0017108341,0.001548391,0.0017765462],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006428338,0.00007717026,0.00027214419,0.0004564815,0.000031762684,0.00047880018,0.0018015796,0.004548667,0.319635,0.5522548,0.0017853269,0.11801537],"study_design_scores_gemma":[0.00012788083,0.00036381665,0.0030875292,0.00030584296,0.000066943736,0.0010403108,0.0015158755,0.050047655,0.14374407,0.7676778,0.03186749,0.00015467237],"about_ca_topic_score_codex":0.0002590288,"about_ca_topic_score_gemma":0.0003273408,"teacher_disagreement_score":0.016674826,"about_ca_system_score_codex":0.00032434615,"about_ca_system_score_gemma":0.00034309813,"threshold_uncertainty_score":0.055782795},"labels":[],"label_agreement":null},{"id":"W1549799209","doi":"10.1007/978-3-540-85194-3_15","title":"Quantum Wireless Sensor Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cryptography; Quantum cryptography; Neural cryptography; Wireless sensor network; Computer security; Wireless network; Field (mathematics); Scheme (mathematics); Wireless; Public-key cryptography; Computer network; Quantum; Theoretical computer science; Encryption; Telecommunications; Quantum information; Mathematics","score_opus":0.013748321293495727,"score_gpt":0.22230334062765136,"score_spread":0.20855501933415563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549799209","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.011585064,0.0379586,0.44109175,0.0050238254,0.0049192496,0.00014376659,0.0004405652,0.0010187945,0.49781838],"genre_scores_gemma":[0.26763782,0.057452723,0.10797238,0.0015352595,0.0023179427,0.00026011633,0.00070257665,0.00035316337,0.56176805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987125,0.000020178033,0.0000042762767,0.00002627253,0.000067143534,0.000010866543],"domain_scores_gemma":[0.9998833,0.000034799956,0.000008454979,0.000031318483,0.00003101507,0.0000110851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017601273,0.0003453569,0.0003298985,0.00039765146,0.00034979192,0.00066513,0.0004904217,0.00043470075,0.011539811],"category_scores_gemma":[0.0004246119,0.00022782099,0.00013798632,0.0006327159,0.000587978,0.001309852,0.0006766727,0.00068708527,0.0027765804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004074246,0.00003401921,0.00012453753,0.00037895312,0.000024092193,0.000060870152,0.000096768184,0.010669746,0.012332519,0.60522974,0.052151073,0.31885684],"study_design_scores_gemma":[0.000010884837,0.00004995745,0.00043058064,0.00011298828,0.000020512196,0.00029531773,0.000052079868,0.040909763,0.009939518,0.31728417,0.6308689,0.000025273828],"about_ca_topic_score_codex":0.00024014025,"about_ca_topic_score_gemma":0.00048078166,"teacher_disagreement_score":0.011539811,"about_ca_system_score_codex":0.00052768964,"about_ca_system_score_gemma":0.00034221596,"threshold_uncertainty_score":0.038604558},"labels":[],"label_agreement":null},{"id":"W1549854013","doi":"10.1007/978-3-540-30135-6_20","title":"Image Segmentation Adapted for Clinical Settings by Combining Pattern Classification and Level Sets","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Classifier (UML); Segmentation; Image segmentation; Computer science","score_opus":0.06571400330680793,"score_gpt":0.35235838206945164,"score_spread":0.2866443787626437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549854013","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.007417425,0.00041628603,0.9872219,0.00019833671,0.000095850206,0.00016700113,0.00021820661,0.0033316384,0.0009333497],"genre_scores_gemma":[0.073323086,0.00066796615,0.92226076,0.00023657583,0.00011507399,0.00026196198,0.00056453247,0.0012712221,0.0012988407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00018464867,0.00013267492,0.00024869668,0.0004136867,0.000066963454],"domain_scores_gemma":[0.9982907,0.0008149586,0.00014187947,0.0003161989,0.00037067867,0.000065585285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019802726,0.0012013597,0.0019740711,0.0032031394,0.00036926067,0.0025546218,0.0018315685,0.0016800058,0.003614974],"category_scores_gemma":[0.0047476594,0.0013806347,0.0017347604,0.0027012995,0.0004974806,0.0013567753,0.0013039489,0.0019379689,0.0026841431],"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.00039092766,0.00014746035,0.002504275,0.00042648645,0.00023747506,0.0002297722,0.00013612292,0.041317113,0.055843968,0.0016343432,0.0067514973,0.89038056],"study_design_scores_gemma":[0.00011125621,0.00031458036,0.007380833,0.00014639826,0.00037691096,0.002215198,0.00009473327,0.899677,0.064816035,0.015601199,0.009125571,0.00014027827],"about_ca_topic_score_codex":0.0022486462,"about_ca_topic_score_gemma":0.003618409,"teacher_disagreement_score":0.003614974,"about_ca_system_score_codex":0.0006162637,"about_ca_system_score_gemma":0.0009787178,"threshold_uncertainty_score":0.012093246},"labels":[],"label_agreement":null},{"id":"W1549861330","doi":"10.1007/3-540-44495-5_19","title":"On Efficient Normal Basis Multiplication","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Computer science; Normal basis; Cryptography; Finite field; Basis (linear algebra); Multiplication algorithm; Arithmetic; Field (mathematics); Class (philosophy); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Galois theory","score_opus":0.010359372274557686,"score_gpt":0.22187067641790617,"score_spread":0.21151130414334848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549861330","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.03275571,0.0045528635,0.5985794,0.0019345433,0.0014585011,0.00014573713,0.00028995675,0.0014057354,0.35887754],"genre_scores_gemma":[0.44887307,0.0074590435,0.22253652,0.0011025427,0.0016124283,0.00028366668,0.0009455962,0.0012536976,0.31593353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910563,0.0002298838,0.00003600723,0.000091177244,0.00041715952,0.00012015249],"domain_scores_gemma":[0.9995264,0.00016967428,0.000023138824,0.00017570794,0.00007726731,0.000027952623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712814,0.001395166,0.0010688723,0.0014770537,0.0008818671,0.0019755438,0.0009827169,0.0006887866,0.016734382],"category_scores_gemma":[0.0016580456,0.0005838917,0.0005540998,0.00230207,0.0019510179,0.0053433473,0.003047632,0.0023344173,0.0055027283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000497758,0.000033181746,0.00006915815,0.00006957862,0.00000808063,0.000035467674,0.00008665446,0.0018982152,0.0018469965,0.9036904,0.0076679727,0.08454461],"study_design_scores_gemma":[0.0000101156575,0.000019736714,0.0000743306,0.000029158737,0.00000745006,0.000119439246,0.000019345043,0.0076933717,0.0019808135,0.96466744,0.025366085,0.000012687369],"about_ca_topic_score_codex":0.0003885518,"about_ca_topic_score_gemma":0.00061382866,"teacher_disagreement_score":0.016734382,"about_ca_system_score_codex":0.0010037802,"about_ca_system_score_gemma":0.0005213818,"threshold_uncertainty_score":0.055982113},"labels":[],"label_agreement":null},{"id":"W1549862809","doi":"10.1007/978-3-540-74695-9_66","title":"Neural Dynamics Based Exploration Algorithm for a Mobile Robot","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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 Guelph","funders":"","keywords":"Mobile robot; Computer science; Robot; Artificial intelligence; Plan (archaeology); Simultaneous localization and mapping; Certainty; Computer vision; Algorithm; Mathematics","score_opus":0.021272469758500324,"score_gpt":0.24169163482467565,"score_spread":0.22041916506617532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549862809","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.014186617,0.0002516411,0.98128164,0.00014593663,0.00006228381,0.00003869673,0.00002387973,0.00044654388,0.0035627245],"genre_scores_gemma":[0.47347936,0.00033235585,0.51270735,0.00014672654,0.00005677339,0.0002926594,0.00010402169,0.000077963276,0.012802708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999492,0.0000062792183,0.000002742256,0.000014618567,0.000020110214,0.0000070317465],"domain_scores_gemma":[0.99992836,0.0000221155,0.000007051336,0.000005311791,0.000031779877,0.0000053744047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016023597,0.00036001677,0.00036512574,0.00026951873,0.00035043925,0.0003048306,0.00056159485,0.0007295666,0.002314855],"category_scores_gemma":[0.00040004626,0.00022307517,0.00020677115,0.00022171912,0.0002606654,0.0004932922,0.0006155889,0.0004370102,0.0004290107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013845887,0.00005069677,0.00044877196,0.00013194524,0.000033582997,0.0001182197,0.000101712416,0.557285,0.028914955,0.0131183695,0.0027422388,0.39691597],"study_design_scores_gemma":[0.000013502293,0.00004210023,0.00012682966,0.000007848039,0.0000062279737,0.000043508237,0.00000850231,0.9946891,0.0018951112,0.0020236461,0.0011382244,0.0000054768498],"about_ca_topic_score_codex":0.0031102572,"about_ca_topic_score_gemma":0.003372246,"teacher_disagreement_score":0.0031102572,"about_ca_system_score_codex":0.00035316276,"about_ca_system_score_gemma":0.0005472205,"threshold_uncertainty_score":0.0077440143},"labels":[],"label_agreement":null},{"id":"W1549894404","doi":"10.1007/11600930_101","title":"Heuristic Approaches to Service Level Agreements in Packet Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Heuristics; Quality of service; Admission control; Scalability; Reservation; The Internet; Computer network; Heuristic; Call Admission Control; Distributed computing; Network packet; Resource allocation; Computational complexity theory; Wireless network; Artificial intelligence; Wireless; Algorithm","score_opus":0.07028767277108075,"score_gpt":0.23424971898856364,"score_spread":0.1639620462174829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549894404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068928576,0.0009134213,0.9828441,0.0004535536,0.00011565666,0.000092263974,0.00005782097,0.00016611174,0.008464152],"genre_scores_gemma":[0.34366757,0.0025881098,0.6432932,0.0002524842,0.0004406524,0.00048905984,0.00021678742,0.00021893992,0.008833117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997109,0.0017258367,0.00008235288,0.00016696948,0.0006106157,0.00030522034],"domain_scores_gemma":[0.9919258,0.0068621226,0.00023418285,0.00041354756,0.00038190986,0.00018254832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044280314,0.0013267695,0.001976549,0.0017093876,0.0013613118,0.002747153,0.0036942672,0.0023597279,0.007004071],"category_scores_gemma":[0.013991308,0.0015251356,0.0011382721,0.0035818594,0.0031536298,0.0035616662,0.001974711,0.003383645,0.0006630806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070095426,0.00007641415,0.00013595936,0.00010479518,0.00003159355,0.000034615605,0.00011424985,0.6631916,0.00016250648,0.3040669,0.0026067866,0.029404555],"study_design_scores_gemma":[0.00002917067,0.000016575783,0.000025954754,0.000016236418,0.000010314434,0.00001104021,0.000031210464,0.8191736,0.000103209335,0.17928486,0.001290489,0.000007315409],"about_ca_topic_score_codex":0.0044812057,"about_ca_topic_score_gemma":0.004549814,"teacher_disagreement_score":0.007004071,"about_ca_system_score_codex":0.0029763568,"about_ca_system_score_gemma":0.00258689,"threshold_uncertainty_score":0.023431003},"labels":[],"label_agreement":null},{"id":"W1549895339","doi":"10.1007/11734673_15","title":"Verification of Pushdown Systems Using Omega Algebra with Domain","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Extension (predicate logic); Kleene algebra; Omega; Programming language; Domain (mathematical analysis); Algebra over a field; Theoretical computer science; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.02279339813481427,"score_gpt":0.2566405629820762,"score_spread":0.23384716484726195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549895339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024904054,0.000076644144,0.9699602,0.00012696168,0.00006378222,0.00009085778,0.000118639626,0.0013874287,0.003271384],"genre_scores_gemma":[0.71811336,0.00028180392,0.27385277,0.0001363197,0.00008022707,0.00029618345,0.0005167241,0.00038131233,0.006341299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961593,0.0010298779,0.00039013167,0.00056663353,0.0014326542,0.00042148444],"domain_scores_gemma":[0.99345595,0.0041073016,0.00026802748,0.001342377,0.00065569085,0.00017060486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037615718,0.000857256,0.00106046,0.00091003696,0.0012614111,0.002958094,0.0018209076,0.0010751232,0.004939956],"category_scores_gemma":[0.007016857,0.0010226751,0.0023493536,0.000836431,0.0026373058,0.0074574803,0.00437106,0.00259128,0.00096714403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005188174,0.00013517418,0.0008157381,0.00031641472,0.000102565165,0.00047711175,0.0004512764,0.058497235,0.021735687,0.86889684,0.0013214296,0.046731703],"study_design_scores_gemma":[0.00012922702,0.000101672114,0.00015804531,0.0000541503,0.00006629232,0.00014377912,0.00008947897,0.2551738,0.039892428,0.69918364,0.004956342,0.00005123499],"about_ca_topic_score_codex":0.0013221671,"about_ca_topic_score_gemma":0.001235359,"teacher_disagreement_score":0.004939956,"about_ca_system_score_codex":0.0010085487,"about_ca_system_score_gemma":0.0018419938,"threshold_uncertainty_score":0.019893348},"labels":[],"label_agreement":null},{"id":"W1549927893","doi":"10.1007/978-3-540-30178-3_33","title":"AgentViz: A Visualization System for Mobile Agents","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; Network topology; Mobile agent; Process (computing); Variety (cybernetics); Graphics; Distributed computing; Computer graphics; Human–computer interaction; Architecture; Computer network; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.02752594945974822,"score_gpt":0.30567850555567927,"score_spread":0.27815255609593104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549927893","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.011374431,0.0010145019,0.6099064,0.00075716194,0.00044916355,0.00034817675,0.009793186,0.3439088,0.02244821],"genre_scores_gemma":[0.1585849,0.003449712,0.6801674,0.0008939773,0.00030737184,0.0013086752,0.024760636,0.056357294,0.07416999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.000038963797,0.000018237546,0.000037405993,0.00011684207,0.000026664111],"domain_scores_gemma":[0.9995466,0.00017378948,0.000030898245,0.00009539385,0.00009463045,0.000058709662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048267166,0.0015930639,0.0007777735,0.0014006984,0.0005539606,0.0026059712,0.0014283533,0.001036066,0.032399256],"category_scores_gemma":[0.0017440146,0.0008171724,0.00073021767,0.0007775364,0.00020601723,0.0017605318,0.0017835678,0.0014976898,0.008549333],"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.0014691938,0.00022737769,0.0019714574,0.0013099079,0.00029227493,0.0006178071,0.0011737325,0.015292005,0.043082617,0.019173685,0.4352392,0.4801508],"study_design_scores_gemma":[0.00061275694,0.0001797656,0.0022196132,0.00030781337,0.00026544486,0.0007746797,0.00024612213,0.19612472,0.05609054,0.025212748,0.717705,0.00026082023],"about_ca_topic_score_codex":0.0035618728,"about_ca_topic_score_gemma":0.00442288,"teacher_disagreement_score":0.032399256,"about_ca_system_score_codex":0.00037499933,"about_ca_system_score_gemma":0.00060764374,"threshold_uncertainty_score":0.10838634},"labels":[],"label_agreement":null},{"id":"W1549969148","doi":"10.1007/978-3-540-45198-3_10","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Minimum spanning tree; Spanning tree; Combinatorics; Gomory–Hu tree; Degree (music); k-minimum spanning tree; Bounded function; Steiner tree problem; Kruskal's algorithm; Node (physics); Mathematics; Approximation algorithm; Discrete mathematics; Graph; Distributed minimum spanning tree; Undirected graph; Minimum degree spanning tree; Shortest-path tree; Enhanced Data Rates for GSM Evolution; Tree (set theory); Computer science; K-ary tree; Tree structure; Binary tree; Artificial intelligence","score_opus":0.03657327550404496,"score_gpt":0.2512355080131645,"score_spread":0.21466223250911956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549969148","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.08222497,0.000948021,0.90634555,0.0007747538,0.00013366382,0.000051983738,0.00031891582,0.00044808915,0.0087539805],"genre_scores_gemma":[0.6291297,0.0010195146,0.36281148,0.00018503424,0.0001457911,0.00012412971,0.0007905459,0.00026868485,0.0055251163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993418,0.0002279732,0.000022978782,0.000119343575,0.00020404307,0.00008376203],"domain_scores_gemma":[0.9979633,0.0013278932,0.00013598286,0.00022323646,0.0002428463,0.00010674375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010458694,0.0007956761,0.0012001381,0.0007024485,0.0004128648,0.0010780052,0.0018915649,0.001269026,0.0026930177],"category_scores_gemma":[0.008006296,0.00044405094,0.0005473081,0.0012853293,0.0005568842,0.0020639286,0.0014666043,0.0012352772,0.00056425855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002624864,0.00007407498,0.000824457,0.00018733797,0.00003130776,0.000069699585,0.00008493598,0.87712586,0.0032630519,0.03548914,0.0055998247,0.07698789],"study_design_scores_gemma":[0.000013510559,0.000020457343,0.00012593354,0.000008532697,0.000006650476,0.000035002875,0.000015690783,0.9785209,0.00046490124,0.020042678,0.0007432704,0.0000025903933],"about_ca_topic_score_codex":0.0020903104,"about_ca_topic_score_gemma":0.0025747837,"teacher_disagreement_score":0.0026930177,"about_ca_system_score_codex":0.0010205368,"about_ca_system_score_gemma":0.00066470605,"threshold_uncertainty_score":0.009009063},"labels":[],"label_agreement":null},{"id":"W1550040990","doi":"10.1007/978-3-642-05031-2_4","title":"Implementing MSC Tests with Quiescence Observation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Asynchronous communication; Test (biology); Chart; Fault detection and isolation; Sequence (biology); Distributed computing; Fault (geology); Test case; Class (philosophy); Reliability engineering; Real-time computing; Embedded system; Programming language; Artificial intelligence; Computer network; Machine learning; Engineering","score_opus":0.02877733741771017,"score_gpt":0.26947884009723283,"score_spread":0.24070150267952267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550040990","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.07436527,0.00010189796,0.8793693,0.0002766225,0.00013702014,0.00014198301,0.00024522597,0.032954246,0.012408504],"genre_scores_gemma":[0.75938594,0.00006413297,0.23044457,0.00018911416,0.000072542825,0.00015105157,0.0005344804,0.002802513,0.0063556163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562645,0.0010821597,0.00031183174,0.00050785125,0.0018278391,0.0006439395],"domain_scores_gemma":[0.98301226,0.008275719,0.0010688497,0.004746836,0.0024551875,0.00044103822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002294127,0.0011804511,0.0007376654,0.0012752509,0.0005105403,0.0022119116,0.0027575411,0.0013292257,0.008908634],"category_scores_gemma":[0.016718252,0.0007567988,0.0007506619,0.00090449455,0.0015620594,0.0040816274,0.002640727,0.0015411202,0.0023318003],"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.0028227665,0.0009746051,0.01543418,0.00057449384,0.00017296505,0.0011705622,0.0015440314,0.061242554,0.083236426,0.13926934,0.018675666,0.6748824],"study_design_scores_gemma":[0.00036030193,0.0006583973,0.0019913889,0.00013313082,0.00020942459,0.00051229866,0.00027940844,0.6182138,0.24726824,0.1021719,0.028090239,0.000111563226],"about_ca_topic_score_codex":0.0022356533,"about_ca_topic_score_gemma":0.0025406543,"teacher_disagreement_score":0.008908634,"about_ca_system_score_codex":0.0007855219,"about_ca_system_score_gemma":0.0013625188,"threshold_uncertainty_score":0.029802322},"labels":[],"label_agreement":null},{"id":"W1550070798","doi":"10.1007/978-3-540-89454-4_30","title":"Making Stories Player-Specific: Delayed Authoring in Interactive Storytelling","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Storytelling; Computer science; Interactive storytelling; Multimedia; Human–computer interaction; Art; Narrative; Literature","score_opus":0.040603962676925114,"score_gpt":0.3074556592358635,"score_spread":0.26685169655893837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550070798","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.12325895,0.0009230752,0.8308978,0.0004215934,0.0002582145,0.00017781231,0.00022433295,0.0032093327,0.040628873],"genre_scores_gemma":[0.81328446,0.0005913139,0.1612964,0.000085360065,0.00007303503,0.00016729097,0.00042467387,0.000851242,0.023226243],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942917,0.00022143294,0.00003141845,0.00012599025,0.00014586732,0.000046140573],"domain_scores_gemma":[0.9958919,0.002883344,0.00018130612,0.0005788242,0.0002769325,0.00018767377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008547047,0.0005709251,0.00034844194,0.00024885903,0.00042407063,0.0020822673,0.0012836771,0.00079919206,0.0087078195],"category_scores_gemma":[0.0062906533,0.0003995249,0.00023524302,0.00027575536,0.000851336,0.0038388912,0.0018879097,0.0011428414,0.0014141034],"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.0014163387,0.00044107277,0.0024363042,0.0012952968,0.00006139535,0.0014674353,0.019379344,0.026445556,0.1441467,0.14275116,0.011932543,0.64822686],"study_design_scores_gemma":[0.0002432463,0.00083785347,0.003636278,0.00033001363,0.00021816087,0.0034654483,0.006901983,0.3097832,0.24112427,0.20492755,0.22835743,0.00017454383],"about_ca_topic_score_codex":0.00027146243,"about_ca_topic_score_gemma":0.0005668611,"teacher_disagreement_score":0.0087078195,"about_ca_system_score_codex":0.0002808628,"about_ca_system_score_gemma":0.0002643994,"threshold_uncertainty_score":0.029130578},"labels":[],"label_agreement":null},{"id":"W1550087630","doi":"10.1007/978-3-540-30551-4_23","title":"Geometric Optimization Problems Over Sliding Windows","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer graphics (images); Mathematical optimization; Mathematics","score_opus":0.01725328938100285,"score_gpt":0.2349357074300714,"score_spread":0.21768241804906854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550087630","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.022457875,0.0017046122,0.96453166,0.00028044704,0.00015973326,0.000047703437,0.0001340443,0.0001773808,0.010506499],"genre_scores_gemma":[0.42045018,0.0065147053,0.51042527,0.00021309804,0.0005806344,0.00043265938,0.00090924895,0.0007951445,0.059679005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957937,0.00010406913,0.000030064546,0.00010186828,0.00014473558,0.000039839004],"domain_scores_gemma":[0.9992059,0.0005180724,0.00007746857,0.000086158434,0.00005993459,0.00005253346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009003386,0.0012518555,0.0016873459,0.0009381813,0.0003886777,0.0014602941,0.0014075675,0.0010063123,0.007635797],"category_scores_gemma":[0.0029414853,0.0008867393,0.0010577801,0.0016687504,0.0009850853,0.0029370666,0.0020971838,0.0024167635,0.00084601453],"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.000115489915,0.000073735,0.00029011245,0.00030908946,0.00007930674,0.00008648888,0.000090381385,0.46920168,0.0036701101,0.40005007,0.0053230855,0.120710485],"study_design_scores_gemma":[0.000022740282,0.00006812765,0.00016840911,0.000035790126,0.00001959363,0.000050799525,0.00002967318,0.7188904,0.00097111665,0.27432323,0.0054097096,0.000010358493],"about_ca_topic_score_codex":0.0012457649,"about_ca_topic_score_gemma":0.0008394367,"teacher_disagreement_score":0.007635797,"about_ca_system_score_codex":0.0006318878,"about_ca_system_score_gemma":0.0004881104,"threshold_uncertainty_score":0.025544286},"labels":[],"label_agreement":null},{"id":"W155016030","doi":"10.1007/978-3-642-40498-6_44","title":"Evaluation of PhonAge: An Adapted Smartphone Interface for Elderly People","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Interface (matter); Computer science; Elderly people; Phone; Key (lock); Human–computer interaction; Smart phone; User interface; Older people; Multimedia; Computer security; Telecommunications; Operating system; Gerontology; Medicine","score_opus":0.0347603177479734,"score_gpt":0.3139632248134259,"score_spread":0.27920290706545253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155016030","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.9866044,0.0011094642,0.0075318185,0.00012391299,0.00017283899,0.00079883967,0.0009670709,0.00045341352,0.002238111],"genre_scores_gemma":[0.96507317,0.0019064441,0.020102205,0.00044267584,0.00012887528,0.0011432946,0.0019200722,0.00020001488,0.009083357],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995234,0.00019818664,0.00005426902,0.000054190874,0.00013768961,0.000032324242],"domain_scores_gemma":[0.9987721,0.0005885428,0.000050342915,0.000055758603,0.00041242802,0.00012076339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010663408,0.0008027825,0.00051462173,0.00039961247,0.00015601939,0.00049465627,0.0006579696,0.00075080857,0.006864441],"category_scores_gemma":[0.0036502734,0.00012814485,0.00039926067,0.00017480216,0.00019755123,0.0006673622,0.00060127716,0.00023219062,0.0011767907],"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.03659678,0.009103327,0.018774014,0.0077302675,0.0008518236,0.0014877407,0.004262137,0.0018511045,0.13583429,0.00036779486,0.014080616,0.76906013],"study_design_scores_gemma":[0.012302746,0.31288302,0.45318303,0.0016947748,0.0075876606,0.010120702,0.009528033,0.034052923,0.09761901,0.00088151795,0.05951999,0.00062659214],"about_ca_topic_score_codex":0.0010439075,"about_ca_topic_score_gemma":0.0013463418,"teacher_disagreement_score":0.006864441,"about_ca_system_score_codex":0.00014474474,"about_ca_system_score_gemma":0.00021193143,"threshold_uncertainty_score":0.022963822},"labels":[],"label_agreement":null},{"id":"W1550167744","doi":"10.1007/978-3-540-85557-6_6","title":"Detecting Statistical Covariations of Sequence Physicochemical Properties","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph","funders":"","keywords":"Sequence (biology); Folding (DSP implementation); Computer science; Measure (data warehouse); Biological system; Statistical analysis; Molecule; Data mining; Chemistry; Computational biology; Mathematics; Statistics; Biology; Biochemistry","score_opus":0.018458076649272133,"score_gpt":0.2467611596619679,"score_spread":0.22830308301269578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550167744","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.8986419,0.00028409206,0.09898201,0.00008122059,0.000031592073,0.00002733477,0.00044147548,0.00076837454,0.000741986],"genre_scores_gemma":[0.95892906,0.00020157802,0.038531967,0.000062730076,0.000089139474,0.000042679134,0.0013729028,0.00011367944,0.0006562558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989304,0.00019792988,0.00007046627,0.0003964828,0.00029171017,0.00011294561],"domain_scores_gemma":[0.99408984,0.0039669047,0.00096208067,0.00039886622,0.0002944823,0.00028792548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015214462,0.0005462731,0.0010291277,0.0030026552,0.00036503817,0.00079843774,0.00093217846,0.0011182891,0.0009645797],"category_scores_gemma":[0.004298547,0.0004350979,0.0007894852,0.002324937,0.00064935035,0.0011140328,0.00091467076,0.00079745,0.0005364346],"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.0019475908,0.0008404338,0.23928757,0.00027018163,0.0006439465,0.0010161494,0.0002620776,0.03744192,0.34915623,0.0033598156,0.001980736,0.3637934],"study_design_scores_gemma":[0.000083833016,0.0008404119,0.16285858,0.00002016726,0.00019598755,0.0018605022,0.00021034376,0.77706695,0.04756227,0.008128044,0.0010875956,0.00008537568],"about_ca_topic_score_codex":0.00079702307,"about_ca_topic_score_gemma":0.0013225147,"teacher_disagreement_score":0.0030026552,"about_ca_system_score_codex":0.00025050755,"about_ca_system_score_gemma":0.0004213722,"threshold_uncertainty_score":0.008046329},"labels":[],"label_agreement":null},{"id":"W1550176162","doi":"10.1007/978-3-540-39899-8_62","title":"Cardiac Endoscopy Enhanced by Dynamic Organ Modeling for Minimally-Invasive Surgery Guidance","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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":"Lawson Health Research Institute; Western University; Robarts Clinical Trials","funders":"","keywords":"Endoscope; Computer science; Computer vision; Imaging phantom; Augmented reality; Endoscopy; Virtual image; Artificial intelligence; Invasive surgery; Computer graphics (images); Radiology; Surgery; Medicine","score_opus":0.01146130569960857,"score_gpt":0.22699324089242903,"score_spread":0.21553193519282046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550176162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013338007,0.0018297953,0.97821486,0.00017788443,0.0000958996,0.00002172545,0.00006465382,0.0011145703,0.005142615],"genre_scores_gemma":[0.5025799,0.0061854883,0.46990392,0.0002763612,0.00016105484,0.00007361086,0.00039987828,0.0007010731,0.01971866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999224,0.000014149571,0.0000029068535,0.0000109912535,0.000043668202,0.000005925668],"domain_scores_gemma":[0.9999162,0.00004661105,0.0000069774333,0.000011740394,0.000013345467,0.0000050914487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000144697,0.000510829,0.0004413627,0.00020925925,0.00010319803,0.00052404235,0.00051148114,0.00068003434,0.0028540904],"category_scores_gemma":[0.00037069604,0.0003715836,0.0005006829,0.00020794732,0.00012647132,0.00045999142,0.00046875194,0.00047791787,0.00081161765],"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.00024656748,0.00007514554,0.00070244994,0.00033586702,0.00008814533,0.00074422214,0.00012968546,0.3291592,0.29133525,0.008733665,0.007954625,0.3604952],"study_design_scores_gemma":[0.000011591146,0.000073059105,0.00056841027,0.000035451827,0.00004129253,0.0009953812,0.000012832664,0.9511646,0.03358361,0.0028923405,0.010591479,0.000029967301],"about_ca_topic_score_codex":0.00059293455,"about_ca_topic_score_gemma":0.0010648333,"teacher_disagreement_score":0.0028540904,"about_ca_system_score_codex":0.00015586757,"about_ca_system_score_gemma":0.0001907897,"threshold_uncertainty_score":0.00954783},"labels":[],"label_agreement":null},{"id":"W1550219943","doi":"10.1007/978-3-642-16355-5_9","title":"Support Vector Machines for Inhabitant Identification in Smart Houses","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Support vector machine; Password; Identification (biology); Feature selection; Classifier (UML); Machine learning; Artificial intelligence; Data mining; Feature vector; Smart environment; Process (computing); Computer security; Internet of Things","score_opus":0.023927445871866224,"score_gpt":0.2921565550762632,"score_spread":0.26822910920439696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550219943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04118231,0.0013336778,0.9548885,0.000115651295,0.00009916691,0.000030235347,0.000317926,0.0010396395,0.0009928695],"genre_scores_gemma":[0.7031059,0.001145472,0.28721058,0.00007781447,0.0001289307,0.00013216416,0.0010138556,0.00009763584,0.0070876703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962854,0.00009686365,0.000024347186,0.00010430058,0.00008952462,0.000056510144],"domain_scores_gemma":[0.9995023,0.00030535072,0.00004389758,0.000047375237,0.00008233316,0.00001883702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041343176,0.0006417983,0.001109026,0.0005860005,0.00027738625,0.0006118147,0.0010311041,0.00097647123,0.0018734585],"category_scores_gemma":[0.0016007121,0.00031948704,0.00057142595,0.0009979678,0.0002552499,0.0010197927,0.0005934165,0.0009203597,0.0011002786],"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.00018384212,0.00011166369,0.0030494134,0.00016471487,0.000063524196,0.00017769393,0.00011903373,0.23668972,0.0086433785,0.003947495,0.0047674947,0.7420821],"study_design_scores_gemma":[0.0000025616787,0.000019161485,0.00076573645,0.000007849524,0.0000058221,0.000035180266,0.000042941698,0.99417555,0.0014914823,0.0028243768,0.00062212185,0.000007252461],"about_ca_topic_score_codex":0.0041436907,"about_ca_topic_score_gemma":0.003773117,"teacher_disagreement_score":0.0041436907,"about_ca_system_score_codex":0.00029931054,"about_ca_system_score_gemma":0.0002831063,"threshold_uncertainty_score":0.00823915},"labels":[],"label_agreement":null},{"id":"W1550312395","doi":"10.1007/978-3-642-04930-9_38","title":"Optimizing Web Service Composition While Enforcing Regulations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workflow; Web service; Heuristics; Personalization; Composition (language); Task (project management); Service (business); Enforcement; World Wide Web; Process management; Database; Business; Systems engineering; Engineering","score_opus":0.013697819925948995,"score_gpt":0.23010061127318926,"score_spread":0.21640279134724028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550312395","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.14687392,0.00016438848,0.83563864,0.00036662002,0.00010994436,0.00030813378,0.00006411854,0.005253335,0.011220788],"genre_scores_gemma":[0.6504361,0.00016938252,0.34167856,0.00015476202,0.000063098596,0.00016168144,0.00021387568,0.00092883076,0.0061936644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722135,0.00076764013,0.0001561292,0.00035523903,0.0010406992,0.00045901843],"domain_scores_gemma":[0.99607795,0.0019238933,0.00029082425,0.00084581226,0.0007040558,0.00015748916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023420881,0.0012927449,0.0013261378,0.00085691665,0.0013780259,0.00179977,0.0013545384,0.0011047623,0.00246634],"category_scores_gemma":[0.006030663,0.0008206528,0.00091977976,0.0013354714,0.0010834148,0.0014792412,0.0015612347,0.0016499684,0.0010222138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007771775,0.0007376521,0.0033125172,0.0002346487,0.00009430464,0.000518543,0.00036722372,0.57323885,0.104147926,0.036056165,0.003760184,0.27675474],"study_design_scores_gemma":[0.000032375574,0.000050053783,0.00018963887,0.00000923297,0.000041071347,0.00007816579,0.000073898605,0.960162,0.02370688,0.014027171,0.0016189493,0.000010539447],"about_ca_topic_score_codex":0.0037083311,"about_ca_topic_score_gemma":0.005621846,"teacher_disagreement_score":0.0037083311,"about_ca_system_score_codex":0.0011686762,"about_ca_system_score_gemma":0.0028024365,"threshold_uncertainty_score":0.012386322},"labels":[],"label_agreement":null},{"id":"W1550319016","doi":"10.1007/978-3-540-88636-5_2","title":"Nonlinear Bayesian Filters for Training Recurrent Neural Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Target Tracking and Data Fusion in Sensor Networks","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":"McMaster University","funders":"","keywords":"Computer science; Kalman filter; Bayesian probability; Nonlinear system; Artificial neural network; Stability (learning theory); State space; Algorithm; Filter (signal processing); Ensemble Kalman filter; Chaotic; Artificial intelligence; Control theory (sociology); Extended Kalman filter; Machine learning; Mathematics; Statistics","score_opus":0.03231273042557693,"score_gpt":0.25689436672926835,"score_spread":0.22458163630369143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550319016","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.0019844268,0.0004253983,0.99650514,0.00007038568,0.00004730503,0.00001248148,0.00004855549,0.00036868383,0.0005376464],"genre_scores_gemma":[0.22258867,0.0015327347,0.7596295,0.0002677141,0.00032722094,0.00045628665,0.0010422461,0.00058937445,0.013566249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999292,0.00022251216,0.000055186345,0.00014750726,0.00020306947,0.00007964056],"domain_scores_gemma":[0.99780816,0.0014704957,0.00016199946,0.00015927281,0.00035317353,0.000046883848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018788306,0.0010922373,0.0016488284,0.0006296398,0.0004067272,0.0011086199,0.0019965284,0.0020447215,0.0044128713],"category_scores_gemma":[0.008365005,0.0012479079,0.0007963132,0.0010161429,0.0006748674,0.0019426635,0.0011279823,0.0027586375,0.0019467989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014295593,0.00007147882,0.00035164625,0.00015095802,0.00009673149,0.000036455654,0.00007040017,0.6962687,0.0033260225,0.031843983,0.004383608,0.2632571],"study_design_scores_gemma":[0.0000056863187,0.000008284306,0.00004219099,0.000008303035,0.000006309079,0.0000054109323,0.0000021508633,0.99311864,0.00037853466,0.005989125,0.00043029987,0.0000050444382],"about_ca_topic_score_codex":0.008234026,"about_ca_topic_score_gemma":0.015163826,"teacher_disagreement_score":0.008234026,"about_ca_system_score_codex":0.0010039437,"about_ca_system_score_gemma":0.0009387102,"threshold_uncertainty_score":0.016372204},"labels":[],"label_agreement":null},{"id":"W1550403096","doi":"10.1007/978-3-540-72870-2_4","title":"Digraph Strong Searching: Monotonicity and Complexity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0658866268132134,"score_gpt":0.3033950996447445,"score_spread":0.2375084728315311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550403096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124137655,0.0068948334,0.6753688,0.0061882474,0.00029306614,0.00020319934,0.0010915183,0.00056541077,0.18525718],"genre_scores_gemma":[0.76439846,0.0055129686,0.18200499,0.0008471234,0.0004742615,0.00028878768,0.00080302695,0.0002710234,0.045399312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992539,0.00019669841,0.000045693923,0.00016566574,0.0002519525,0.000086055166],"domain_scores_gemma":[0.99398637,0.004523331,0.00022320753,0.0005891687,0.00040032915,0.0002774429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096818304,0.00052684057,0.0011520304,0.001133861,0.0010831578,0.003775071,0.0016103436,0.0012690303,0.008406003],"category_scores_gemma":[0.0073643825,0.000731404,0.00091749354,0.0022885958,0.0023592713,0.008661766,0.0019493446,0.0033578896,0.00063774624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004108479,0.00003377838,0.00023866461,0.00018137315,0.000011057642,0.000046368845,0.00009096753,0.005554114,0.0006199215,0.9589441,0.0041307593,0.030107886],"study_design_scores_gemma":[0.000013460275,0.0000143191255,0.00013753054,0.000020597547,0.000010291966,0.0001198273,0.000031965053,0.021886544,0.00041718097,0.97369236,0.0036485994,0.0000073446954],"about_ca_topic_score_codex":0.0014237671,"about_ca_topic_score_gemma":0.0018306534,"teacher_disagreement_score":0.008406003,"about_ca_system_score_codex":0.0019546454,"about_ca_system_score_gemma":0.0014420176,"threshold_uncertainty_score":0.028120935},"labels":[],"label_agreement":null},{"id":"W1550577131","doi":"10.1007/978-3-642-16321-0_10","title":"Why Large Closest String Instances Are Easy to Solve in Practice","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Hamming distance; Greedy algorithm; String searching algorithm; Computer science; Approximation algorithm; String metric; Combinatorics; Algorithm; Discrete mathematics; Mathematics; Data structure","score_opus":0.015514006894249336,"score_gpt":0.26807139282740855,"score_spread":0.25255738593315924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550577131","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.09161564,0.0041061346,0.80421215,0.021145768,0.0017661131,0.00033228556,0.00123824,0.0069288346,0.068654895],"genre_scores_gemma":[0.29615316,0.002235789,0.66375154,0.002341648,0.0012261515,0.00043668464,0.002166313,0.0036840758,0.028004672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937669,0.0019785815,0.00043111594,0.0017650248,0.0015212608,0.0005371494],"domain_scores_gemma":[0.9522256,0.035763673,0.0013031358,0.00788399,0.0021223044,0.00070129917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037272556,0.0010647603,0.0016061654,0.0010742147,0.0019876398,0.0057313386,0.0025431302,0.0040842625,0.044783607],"category_scores_gemma":[0.073339,0.001586777,0.0013633748,0.0030871301,0.0022527012,0.0213833,0.0038876312,0.0054449253,0.017330928],"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.00076541514,0.000457178,0.0037768062,0.0014051547,0.00016376725,0.00061397697,0.0009579175,0.04481035,0.0037970198,0.2759211,0.14525865,0.5220727],"study_design_scores_gemma":[0.00017796025,0.00010789296,0.00045348928,0.00012605595,0.000039481092,0.0010348646,0.00068600464,0.076520704,0.0025348647,0.89523655,0.023045732,0.000036389938],"about_ca_topic_score_codex":0.0009202097,"about_ca_topic_score_gemma":0.0014158619,"teacher_disagreement_score":0.044783607,"about_ca_system_score_codex":0.00076540356,"about_ca_system_score_gemma":0.0020839018,"threshold_uncertainty_score":0.14981616},"labels":[],"label_agreement":null},{"id":"W1550613540","doi":"10.1007/978-3-642-15711-0_51","title":"Fused Video and Ultrasound Images for Minimally Invasive Partial Nephrectomy: A Phantom Study","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":47,"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; Robarts Clinical Trials","funders":"","keywords":"Visualization; Nephrectomy; Computer science; Invasive surgery; Imaging phantom; Computer vision; Workload; Image-guided surgery; Artificial intelligence; Medicine; Radiology; Surgery; Kidney","score_opus":0.02157559993695826,"score_gpt":0.30956734911026007,"score_spread":0.28799174917330184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550613540","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.97055995,0.0022090387,0.021958832,0.00024145057,0.000043321423,0.00011192935,0.00060435425,0.00011639145,0.0041547734],"genre_scores_gemma":[0.9924205,0.00084355805,0.0053880396,0.000059864557,0.000028339355,0.00003327017,0.00023657887,0.00008279845,0.0009070902],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996669,0.00017764448,0.000018340406,0.000030057316,0.00006473783,0.000042274532],"domain_scores_gemma":[0.99784124,0.0016453649,0.00014591067,0.00015318707,0.00013161017,0.000082713195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092367595,0.00042390716,0.00035793244,0.00083271245,0.00020445876,0.00071487814,0.00058069854,0.001129103,0.003411623],"category_scores_gemma":[0.004341799,0.0005370951,0.00036986632,0.00078635535,0.00053299713,0.0011567996,0.0005263235,0.00058986427,0.00023676954],"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.023180323,0.0046671066,0.02466659,0.0019560715,0.00041105042,0.011281588,0.0019567152,0.10752261,0.6731321,0.004324349,0.003145689,0.14375581],"study_design_scores_gemma":[0.0024908988,0.028047305,0.15455216,0.00042774904,0.0015565461,0.050521765,0.0018492518,0.29544008,0.45009503,0.0037110723,0.010649943,0.00065827655],"about_ca_topic_score_codex":0.002016886,"about_ca_topic_score_gemma":0.0011370146,"teacher_disagreement_score":0.003411623,"about_ca_system_score_codex":0.00042632633,"about_ca_system_score_gemma":0.00051334815,"threshold_uncertainty_score":0.011413038},"labels":[],"label_agreement":null},{"id":"W1550614477","doi":"10.1007/978-3-642-15120-0_7","title":"Helping Biologists Effectively Build Workflows, without Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Workflow; Computer science; Workflow technology; Workflow management system; World Wide Web; Workflow engine; Windows Workflow Foundation; Task (project management); Software engineering; Automation; Control flow; Database; Programming language; Systems engineering; Engineering","score_opus":0.06275896940107863,"score_gpt":0.34595379262396836,"score_spread":0.28319482322288975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550614477","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.004063223,0.00017802333,0.974003,0.0015401604,0.00013765093,0.00018280222,0.0002514514,0.010734558,0.0089090485],"genre_scores_gemma":[0.013385562,0.00042286905,0.9766241,0.00066273316,0.000044879882,0.00017440315,0.00048814082,0.0019453684,0.0062520113],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980033,0.00061715266,0.00018405782,0.0004869562,0.000540213,0.00016823589],"domain_scores_gemma":[0.9872242,0.008026849,0.00038597733,0.0032323357,0.00065791624,0.0004726685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064286813,0.0016906052,0.0006864952,0.0011015639,0.001509285,0.0054827677,0.0036478166,0.0018306604,0.008904775],"category_scores_gemma":[0.01718774,0.0018926086,0.0017263843,0.0010925548,0.0024853223,0.008699065,0.003601525,0.005509844,0.009568925],"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.00029697138,0.0004499047,0.002862557,0.0015837546,0.00018630736,0.0004583917,0.0030038562,0.016509542,0.0390586,0.21316758,0.06661458,0.655808],"study_design_scores_gemma":[0.00017065991,0.00014330304,0.00077020895,0.0003827312,0.00018694626,0.0009085605,0.0007278251,0.078304954,0.03937036,0.5551884,0.32371858,0.00012754246],"about_ca_topic_score_codex":0.001821705,"about_ca_topic_score_gemma":0.0030755496,"teacher_disagreement_score":0.008904775,"about_ca_system_score_codex":0.0010461978,"about_ca_system_score_gemma":0.0030634706,"threshold_uncertainty_score":0.03399849},"labels":[],"label_agreement":null},{"id":"W1550636281","doi":"10.1007/978-3-540-45063-4_13","title":"Hierarchical Annealing for Random Image Synthesis","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simulated annealing; Computer science; Computational complexity theory; Annealing (glass); Binary number; Image processing; Algorithm; Theoretical computer science; Computational science; Distributed computing; Image (mathematics); Artificial intelligence; Materials science; Mathematics","score_opus":0.01920783679366844,"score_gpt":0.2820072545582969,"score_spread":0.26279941776462845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550636281","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.0025732138,0.00026830618,0.9938129,0.00004704456,0.000040133757,0.000026034739,0.00002477091,0.00047528115,0.0027323363],"genre_scores_gemma":[0.16792783,0.00033677256,0.8193445,0.000113503505,0.00007011546,0.00028432737,0.00016718131,0.000689215,0.011066584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00016231589,0.000018205576,0.000078475874,0.0001327589,0.000037812835],"domain_scores_gemma":[0.9992489,0.00049617444,0.000037387083,0.00013192272,0.000058290774,0.000027267755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200419,0.0006011053,0.0010989932,0.0005829817,0.0004843218,0.0007365713,0.001102262,0.0011021559,0.007750651],"category_scores_gemma":[0.0021891347,0.0007793675,0.00089564425,0.00069270504,0.00096072635,0.0007867635,0.0012489847,0.0013741053,0.0012713476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013170892,0.0000511939,0.00016054485,0.00016508503,0.000058446927,0.000054461387,0.00011090664,0.66932595,0.012523665,0.19277145,0.0045613293,0.12008523],"study_design_scores_gemma":[0.000017717475,0.00001642784,0.000048965958,0.000006787331,0.0000069524576,0.000013682701,0.0000042552524,0.9601794,0.0013237898,0.036559675,0.0018133621,0.000008991513],"about_ca_topic_score_codex":0.0020184808,"about_ca_topic_score_gemma":0.003347164,"teacher_disagreement_score":0.007750651,"about_ca_system_score_codex":0.0009845139,"about_ca_system_score_gemma":0.0005236544,"threshold_uncertainty_score":0.025928557},"labels":[],"label_agreement":null},{"id":"W1550651188","doi":"10.1007/978-3-642-01513-7_36","title":"An Efficient Wavelet Based Feature Extraction Method for Face Recognition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Computer science; Facial recognition system; Artificial intelligence; Feature extraction; Pattern recognition (psychology); Wavelet; Face (sociological concept); Computer vision","score_opus":0.025674943918926496,"score_gpt":0.3003327080841094,"score_spread":0.2746577641651829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550651188","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.005245779,0.0004770509,0.99264187,0.000037129827,0.00008702511,0.00003548471,0.00008503496,0.0006299586,0.0007605591],"genre_scores_gemma":[0.037824098,0.0010560633,0.9513295,0.000073110044,0.00008969451,0.00012669683,0.0005137558,0.00017006605,0.008816968],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979943,0.000017526743,0.000011546924,0.00002559819,0.0001287652,0.000017217078],"domain_scores_gemma":[0.9998078,0.000054769578,0.000013826341,0.000028487502,0.00008598676,0.000009182887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024560283,0.0005426952,0.0006531501,0.0007042966,0.00024005506,0.00036466148,0.0006763654,0.000488331,0.0046128416],"category_scores_gemma":[0.0005009023,0.0003404753,0.00057792815,0.001003642,0.00017305254,0.00065448356,0.00042088062,0.00064740476,0.0027978667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011872424,0.000064220505,0.00012752044,0.00013114244,0.000029500874,0.00006305241,0.000024134328,0.0042712875,0.20979863,0.001971023,0.004915751,0.77848506],"study_design_scores_gemma":[0.00007137844,0.00040508504,0.004824749,0.00006424933,0.00018502968,0.0015658583,0.000054818323,0.644526,0.30151746,0.0037139228,0.04298108,0.00009032715],"about_ca_topic_score_codex":0.0009557774,"about_ca_topic_score_gemma":0.001499952,"teacher_disagreement_score":0.0046128416,"about_ca_system_score_codex":0.00017604344,"about_ca_system_score_gemma":0.00033683862,"threshold_uncertainty_score":0.015431464},"labels":[],"label_agreement":null},{"id":"W1550673449","doi":"10.1007/3-540-44503-x_19","title":"Algebraic Rewritings for Optimizing Regular Path Queries","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Rewriting; Computer science; Query optimization; Materialized view; Context (archaeology); Relational algebra; Algebraic number; Path (computing); Query language; Conjunctive query; Theoretical computer science; Focus (optics); Product (mathematics); Relational database; View; Information retrieval; Programming language; Mathematics; Database design","score_opus":0.015655398096001822,"score_gpt":0.24259114404018642,"score_spread":0.22693574594418459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550673449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022357818,0.000682977,0.9538108,0.00035179083,0.0001877075,0.00014498398,0.0002752908,0.004626089,0.017562626],"genre_scores_gemma":[0.35611138,0.0010028748,0.62363255,0.00029314458,0.00035018593,0.00022307188,0.0010077144,0.001681706,0.015697306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970552,0.0005664901,0.0002321501,0.000361819,0.0015270704,0.00025733165],"domain_scores_gemma":[0.9973405,0.001393995,0.00014840032,0.00059573055,0.00045390968,0.00006745048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013840221,0.00073103857,0.0010886847,0.0011773434,0.000878671,0.0020295572,0.0017850252,0.00073059596,0.00650309],"category_scores_gemma":[0.0067372127,0.00075366657,0.0013541004,0.0023118518,0.0016366701,0.0041788495,0.0017824416,0.0026095978,0.001602346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023763365,0.00013397727,0.00038468852,0.00033848878,0.00005919582,0.00018344894,0.0004980077,0.03333759,0.009453104,0.6791388,0.011883457,0.26435167],"study_design_scores_gemma":[0.00008718733,0.00010603205,0.0002089354,0.00004585139,0.00010024544,0.00023203746,0.00014932167,0.17567895,0.011260256,0.78798455,0.024094708,0.00005186143],"about_ca_topic_score_codex":0.0019864116,"about_ca_topic_score_gemma":0.0028536303,"teacher_disagreement_score":0.00650309,"about_ca_system_score_codex":0.0012087984,"about_ca_system_score_gemma":0.00086088624,"threshold_uncertainty_score":0.02175498},"labels":[],"label_agreement":null},{"id":"W1550711264","doi":"10.1007/978-3-540-40899-4_1","title":"A 3-Dimensional Database of Deep Brain Functional Anatomy, and Its Application to Image-Guided Neurosurgery","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"London Health Sciences Centre; Western University","funders":"","keywords":"Computer science; Surgical planning; Population; Neurosurgery; Database; Medical physics; Medicine; Radiology","score_opus":0.020345872524069015,"score_gpt":0.2718139413326631,"score_spread":0.2514680688085941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550711264","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.016495096,0.0019011628,0.94323134,0.0003798848,0.00018779657,0.00018202943,0.022458425,0.011581729,0.0035824976],"genre_scores_gemma":[0.13181978,0.0040435623,0.8107169,0.0002891527,0.0001256016,0.00066069997,0.04293019,0.0016816739,0.00773241],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996953,0.000029999836,0.00003806927,0.000081229606,0.00013522636,0.00002020402],"domain_scores_gemma":[0.999413,0.00012509267,0.000042289197,0.0002155391,0.00015738362,0.000046738143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052320585,0.00063081464,0.0010317429,0.0019054817,0.0004621494,0.0019885595,0.0017790536,0.0008256713,0.007606917],"category_scores_gemma":[0.0019858056,0.00074381876,0.00093158364,0.0028595808,0.00030415476,0.0013619609,0.0010927743,0.0011308031,0.004296792],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003138236,0.00014571763,0.0015604806,0.0002806344,0.00008106649,0.00026329595,0.00011799223,0.035007145,0.013908313,0.010991804,0.06817675,0.86915284],"study_design_scores_gemma":[0.00010242886,0.0002869594,0.0124379285,0.00017358075,0.00016972817,0.0032669117,0.00020534192,0.74713856,0.034114636,0.07650241,0.12538387,0.00021762394],"about_ca_topic_score_codex":0.0067022787,"about_ca_topic_score_gemma":0.013007182,"teacher_disagreement_score":0.007606917,"about_ca_system_score_codex":0.00043429626,"about_ca_system_score_gemma":0.0010088278,"threshold_uncertainty_score":0.025447667},"labels":[],"label_agreement":null},{"id":"W1550752171","doi":"10.1007/978-3-540-73101-6_1","title":"Comparing Decision Making in Agile and Non-agile Software Organizations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Agile software development; Agile usability engineering; Agile Unified Process; Software; Context (archaeology); Knowledge management; Lean software development; Software development; Computer science; Process management; Engineering; Software engineering; Software development process","score_opus":0.020160076673827163,"score_gpt":0.2785978708932468,"score_spread":0.2584377942194196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550752171","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.98589677,0.00064189895,0.005834552,0.00029371967,0.000044894605,0.00006596235,0.000062784886,0.000020293637,0.007139155],"genre_scores_gemma":[0.9934869,0.0002446835,0.005185164,0.000040535026,0.000011521059,0.00006202761,0.00010815816,0.00000860213,0.00085238414],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.991979,0.0054445425,0.00032244678,0.0002849146,0.0013524784,0.0006165784],"domain_scores_gemma":[0.8852586,0.10689915,0.002582842,0.0013501263,0.0026017593,0.0013074984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008468883,0.0003207172,0.00041196807,0.0013397257,0.0006411496,0.0026597106,0.00080240314,0.00084102957,0.0027711962],"category_scores_gemma":[0.042364597,0.00025185803,0.00077453477,0.0019667149,0.0009865096,0.0020686225,0.0011164065,0.0011657597,0.00024373637],"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.01779684,0.0043907585,0.21862741,0.0018291313,0.0012485945,0.00075030816,0.017609539,0.07793185,0.005932068,0.08852629,0.0068320413,0.55852515],"study_design_scores_gemma":[0.0018216312,0.011295503,0.34131888,0.00089065504,0.0009373369,0.00066980586,0.076573804,0.27267122,0.011498252,0.26402602,0.01792492,0.0003720874],"about_ca_topic_score_codex":0.0023049805,"about_ca_topic_score_gemma":0.0038306252,"teacher_disagreement_score":0.008468883,"about_ca_system_score_codex":0.0013071632,"about_ca_system_score_gemma":0.0014113615,"threshold_uncertainty_score":0.04478824},"labels":[],"label_agreement":null},{"id":"W1550779412","doi":"10.1007/11559573_150","title":"Fixed Pixel Threshold PDC Algorithm and Its Implementation for Full Search Block Matching Motion Estimation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Coding and Compression Technologies","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 Windsor","funders":"","keywords":"Computer science; Very-large-scale integration; Motion estimation; Block (permutation group theory); Pixel; Implementation; Matching (statistics); CMOS; Algorithm; Chip; Stability (learning theory); Computer engineering; Computer hardware; Computer vision; Embedded system; Electronic engineering; Telecommunications; Mathematics","score_opus":0.031055609068975937,"score_gpt":0.30351408874744246,"score_spread":0.27245847967846654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550779412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065376475,0.0003945926,0.9893448,0.000065606066,0.00007137659,0.000065318636,0.00009127508,0.0014543609,0.001974999],"genre_scores_gemma":[0.06581721,0.00023830743,0.9285133,0.00006230948,0.00003825123,0.00013348459,0.00029598188,0.0001349884,0.0047661504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996201,0.000052580806,0.000023436156,0.00005965486,0.00021419981,0.000029896617],"domain_scores_gemma":[0.9995403,0.000103281025,0.000022216102,0.00010412463,0.00021272336,0.000017490614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041585436,0.00040245184,0.0004936638,0.0010459333,0.00036577095,0.0006527571,0.0011148576,0.0008577298,0.008434988],"category_scores_gemma":[0.0015573952,0.00038168996,0.00028382897,0.0014109381,0.00026344118,0.00059705874,0.0005434935,0.00048684393,0.002622592],"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.00035901272,0.00008439535,0.00057904626,0.00010301672,0.0000349086,0.00010383954,0.00006396729,0.018186,0.060073256,0.011097826,0.006402484,0.9029123],"study_design_scores_gemma":[0.0001065354,0.00021910027,0.002052256,0.00003247975,0.00004672403,0.0009378174,0.00004009708,0.8738779,0.093950845,0.0046915947,0.02398479,0.000059826063],"about_ca_topic_score_codex":0.004029078,"about_ca_topic_score_gemma":0.004908547,"teacher_disagreement_score":0.008434988,"about_ca_system_score_codex":0.0004981293,"about_ca_system_score_gemma":0.0009576958,"threshold_uncertainty_score":0.028217852},"labels":[],"label_agreement":null},{"id":"W1550792544","doi":"10.1007/978-3-642-13489-0_19","title":"ExpLOD: Summary-Based Exploration of Interlinking and RDF Usage in the Linked Open Data Cloud","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":87,"is_retracted":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":"SPARQL; Computer science; Linked data; RDF; Automatic summarization; RDF Schema; Cloud computing; Semantic Web; Information retrieval; Schema (genetic algorithms); Graph; Simple Knowledge Organization System; Named graph; World Wide Web; Theoretical computer science","score_opus":0.09826242608921838,"score_gpt":0.31152117850259,"score_spread":0.2132587524133716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550792544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19056141,0.0031522415,0.3858077,0.0017235308,0.00044222033,0.0005650582,0.26301318,0.122337565,0.03239719],"genre_scores_gemma":[0.3396582,0.0021693013,0.48301727,0.00026276658,0.00009053585,0.00038217127,0.15387644,0.010087839,0.010455512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995339,0.00008459173,0.000044947625,0.00011471334,0.00017590274,0.000045998528],"domain_scores_gemma":[0.9985208,0.00089541514,0.00008999365,0.00024367069,0.000142396,0.0001078267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076941645,0.00078634295,0.00058491185,0.0041299067,0.0008208898,0.002814653,0.0008600398,0.000549474,0.014359399],"category_scores_gemma":[0.0032397057,0.00038832033,0.0009178031,0.0053592734,0.00031508677,0.003530063,0.0023754225,0.0006589577,0.0025470972],"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.0016840276,0.00034168488,0.029468326,0.002842794,0.0003898723,0.0017433118,0.0074862624,0.020919729,0.022223216,0.030540684,0.22309951,0.65926063],"study_design_scores_gemma":[0.00028277282,0.00024244274,0.029335385,0.00055513164,0.00036364293,0.0012483163,0.0076090326,0.30529973,0.04989682,0.07240329,0.5325167,0.0002468226],"about_ca_topic_score_codex":0.010114797,"about_ca_topic_score_gemma":0.029744657,"teacher_disagreement_score":0.014359399,"about_ca_system_score_codex":0.0005860916,"about_ca_system_score_gemma":0.00093223306,"threshold_uncertainty_score":0.048036933},"labels":[],"label_agreement":null},{"id":"W1550827057","doi":"10.1007/978-3-642-31295-3_16","title":"Self-similarity of Images in the Wavelet Domain in Terms of ℓ2 and Structural Similarity (SSIM)","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Affine transformation; Mathematics; Grayscale; Similarity (geometry); Quadtree; Measure (data warehouse); Similarity measure; Pattern recognition (psychology); Self-similarity; Image (mathematics); Norm (philosophy); Degree (music); Artificial intelligence; Algorithm; Computer science; Geometry; Data mining; Physics","score_opus":0.017259818904367376,"score_gpt":0.2682393700364405,"score_spread":0.2509795511320731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550827057","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.06568761,0.0040060147,0.9137238,0.0004151426,0.000485565,0.00007460547,0.00025147118,0.00036749284,0.0149881905],"genre_scores_gemma":[0.5459696,0.0065028374,0.4222153,0.0002850477,0.0008035077,0.00015889807,0.0008777383,0.0003437387,0.022843277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996635,0.00005041433,0.000031748925,0.00006654774,0.00016959434,0.000018340028],"domain_scores_gemma":[0.9994562,0.00016691256,0.00009094667,0.00008473735,0.00016551292,0.00003576533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005426358,0.00038229828,0.0005581255,0.0018331078,0.00018999583,0.001419276,0.00049589504,0.0006437982,0.0021878048],"category_scores_gemma":[0.0014785645,0.00018230836,0.00047564707,0.0014978381,0.00075934094,0.0025278388,0.0006858328,0.0007361706,0.00080121733],"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.00016599732,0.00010181421,0.0010881341,0.00073969056,0.00011805249,0.00028576783,0.00046411424,0.022044413,0.14412755,0.41561282,0.006190504,0.40906104],"study_design_scores_gemma":[0.000033770677,0.0005550703,0.007323394,0.000166041,0.00013456492,0.003578,0.00051273406,0.4442139,0.07814449,0.4252659,0.039894085,0.00017807874],"about_ca_topic_score_codex":0.0001478998,"about_ca_topic_score_gemma":0.00018007401,"teacher_disagreement_score":0.0021878048,"about_ca_system_score_codex":0.00025903078,"about_ca_system_score_gemma":0.00023651842,"threshold_uncertainty_score":0.0073189735},"labels":[],"label_agreement":null},{"id":"W1550835464","doi":"10.1007/978-3-642-36961-2_10","title":"Hierarchical Conditional Random Fields for Myocardium Infarction Detection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Conditional random field; Computer science; Segmentation; Artificial intelligence; Infarction; Probabilistic logic; Pattern recognition (psychology); Classifier (UML); Myocardial infarction; Magnetic resonance imaging; Radiology; Cardiology; Medicine","score_opus":0.013787823703578976,"score_gpt":0.2635684421208188,"score_spread":0.24978061841723984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550835464","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.002416509,0.0006075164,0.99508876,0.00006938177,0.00002901003,0.00002711526,0.00024284545,0.001005512,0.0005134602],"genre_scores_gemma":[0.14413904,0.0014734705,0.8435177,0.00020180356,0.00015991769,0.00021292317,0.002519405,0.00045590123,0.0073197996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960285,0.00012207833,0.00001716183,0.0000822701,0.00013051608,0.000045191606],"domain_scores_gemma":[0.9991215,0.0005619342,0.00004950709,0.000113299844,0.0001287384,0.00002501021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012035777,0.0006343551,0.0009315863,0.0012796432,0.0003293178,0.0005494957,0.0016916356,0.0010551633,0.004291634],"category_scores_gemma":[0.0022503757,0.00053848606,0.00094806246,0.0011656065,0.00032770456,0.00077981624,0.0007717601,0.0010525495,0.0016493049],"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.00018037276,0.00009880229,0.0006575544,0.00017790824,0.000091459915,0.00008989988,0.000048779733,0.29558325,0.011220121,0.019089682,0.014896132,0.65786594],"study_design_scores_gemma":[0.000007062026,0.000016474867,0.00043062516,0.000012394561,0.000014461042,0.00004946254,0.0000056891654,0.984894,0.0021946472,0.010627124,0.0017353623,0.000012717273],"about_ca_topic_score_codex":0.008619862,"about_ca_topic_score_gemma":0.013341627,"teacher_disagreement_score":0.008619862,"about_ca_system_score_codex":0.0006550586,"about_ca_system_score_gemma":0.0008273862,"threshold_uncertainty_score":0.017139375},"labels":[],"label_agreement":null},{"id":"W1550864413","doi":"10.1007/978-3-540-27779-8_9","title":"Schema-Based Natural Language Semantic Mapping","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; WordNet; SQL; Information retrieval; Natural language processing; Schema (genetic algorithms); Artificial intelligence; Lexical database; Database schema; Database; Programming language; Database design","score_opus":0.015419263256278484,"score_gpt":0.24317714428027404,"score_spread":0.22775788102399555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550864413","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.0033739586,0.0004915,0.97847605,0.00052785594,0.00015765984,0.00014092322,0.0010951567,0.0041520842,0.011584807],"genre_scores_gemma":[0.06367755,0.0012886563,0.9166952,0.00044412175,0.000052259857,0.0002797006,0.007174512,0.0010524116,0.009335556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983102,0.0005436942,0.00021836288,0.000337909,0.000521161,0.00006864694],"domain_scores_gemma":[0.9980198,0.00080521393,0.00007631923,0.00062795583,0.0004211669,0.000049613678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020322807,0.00066408614,0.0007613327,0.0022019614,0.000834477,0.0034382492,0.0023042327,0.0011298432,0.009514183],"category_scores_gemma":[0.005609036,0.00071706186,0.0016151359,0.003156844,0.0012845778,0.009006122,0.0028885563,0.0018669278,0.0038451313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095745585,0.00012427439,0.00053801114,0.00048879517,0.00010821195,0.00026196,0.0009210947,0.0118162045,0.005252019,0.66276526,0.03088774,0.28674063],"study_design_scores_gemma":[0.000040937437,0.000035231733,0.00036966708,0.00021893258,0.0001418004,0.00064118946,0.00039607627,0.15208977,0.015925761,0.62557673,0.20451532,0.00004859791],"about_ca_topic_score_codex":0.0036793284,"about_ca_topic_score_gemma":0.0038756875,"teacher_disagreement_score":0.009514183,"about_ca_system_score_codex":0.0010487101,"about_ca_system_score_gemma":0.001741007,"threshold_uncertainty_score":0.031828105},"labels":[],"label_agreement":null},{"id":"W1550913451","doi":"10.1007/978-3-540-30125-7_11","title":"A Multistage Image Segmentation and Denoising Method – Based on the Mumford and Shah Variational Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Smoothing; Piecewise; Segmentation; Computer science; Image segmentation; Scale-space segmentation; Noise reduction; Artificial intelligence; Segmentation-based object categorization; Noise (video); Computer vision; Active contour model; Level set (data structures); Pattern recognition (psychology); Image denoising; Algorithm; Image (mathematics); Mathematics; Mathematical analysis","score_opus":0.01961389575014118,"score_gpt":0.28636367099322524,"score_spread":0.2667497752430841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550913451","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.0013009609,0.000091106034,0.99802434,0.00003931455,0.000026009133,0.000014455774,0.000011434761,0.00010815116,0.00038424745],"genre_scores_gemma":[0.035289306,0.00021424361,0.95939136,0.000066369765,0.000058084835,0.000059814396,0.00008352459,0.00013814257,0.0046992805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955386,0.00008224755,0.000023011688,0.000097519114,0.00020416344,0.000039194143],"domain_scores_gemma":[0.99965155,0.00011924608,0.000024408404,0.000054787295,0.00011640245,0.000033604025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007175044,0.00058142655,0.0012946596,0.00089025684,0.0004788513,0.0008985521,0.0014738574,0.0017411172,0.0022516684],"category_scores_gemma":[0.0009567715,0.0008587996,0.0014230467,0.0006569715,0.0006946463,0.0009964402,0.0012867551,0.0014204715,0.0008131058],"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.00021868089,0.00013785514,0.0007564656,0.00038833078,0.00027227114,0.00015927794,0.00023026255,0.22144271,0.21845703,0.09706744,0.0054676034,0.45540217],"study_design_scores_gemma":[0.000008490836,0.000046820893,0.00026207606,0.000010600748,0.000032638094,0.00017971215,0.000007994801,0.97318643,0.012660253,0.008191729,0.0053769085,0.000036397196],"about_ca_topic_score_codex":0.0029899178,"about_ca_topic_score_gemma":0.005380792,"teacher_disagreement_score":0.0029899178,"about_ca_system_score_codex":0.0005618931,"about_ca_system_score_gemma":0.0010582821,"threshold_uncertainty_score":0.007532537},"labels":[],"label_agreement":null},{"id":"W1551002398","doi":"10.1007/978-3-540-76928-6_88","title":"Merging Algorithm to Reduce Dimensionality in Application to Web-Mining","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Suncor Energy (Canada)","funders":"","keywords":"Computer science; Dimensionality reduction; Data mining; Matrix (chemical analysis); Cluster (spacecraft); Dimension (graph theory); Process (computing); Divergence (linguistics); Algorithm; Independence (probability theory); Attractor; Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Combinatorics","score_opus":0.02452607990758312,"score_gpt":0.2976618000369684,"score_spread":0.2731357201293853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551002398","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.0106857,0.000538212,0.9842674,0.00015540351,0.00013367688,0.00014155239,0.00027538562,0.0028654397,0.00093722454],"genre_scores_gemma":[0.037625328,0.00019792418,0.9590287,0.00010359528,0.00007956072,0.00017813133,0.0008243248,0.00034348227,0.0016189397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978465,0.0004946247,0.00023720929,0.00040810416,0.0008559383,0.00015767374],"domain_scores_gemma":[0.9961831,0.0013698156,0.0002151277,0.0010030649,0.0010825912,0.00014620363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113164,0.00095843244,0.0022768832,0.0031044066,0.0021880423,0.001772212,0.0028137525,0.0015001699,0.005887205],"category_scores_gemma":[0.007768445,0.0008980574,0.0020203337,0.006272208,0.00067825185,0.0028410463,0.0027182915,0.001855769,0.00249626],"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.00033962782,0.00028730952,0.003092081,0.0002449963,0.0002839539,0.00018497347,0.00032636017,0.02034547,0.012492756,0.010570249,0.016237915,0.9355943],"study_design_scores_gemma":[0.00014105848,0.00031997505,0.0048743095,0.000059810223,0.00038757783,0.0010580698,0.00028355638,0.877968,0.04335309,0.03522132,0.036232203,0.00010108412],"about_ca_topic_score_codex":0.0020786617,"about_ca_topic_score_gemma":0.0032828958,"teacher_disagreement_score":0.005887205,"about_ca_system_score_codex":0.0005808818,"about_ca_system_score_gemma":0.0016555886,"threshold_uncertainty_score":0.019694686},"labels":[],"label_agreement":null},{"id":"W1551008871","doi":"10.1007/11428862_182","title":"Design of Evolutionally Optimized Rule-Based Fuzzy Neural Networks Based on Fuzzy Relation and Evolutionary Optimization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","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 Alberta","funders":"","keywords":"Computer science; Fuzzy rule; Fuzzy logic; Artificial neural network; Neuro-fuzzy; Genetic algorithm; Relation (database); Convergence (economics); Mathematical optimization; Artificial intelligence; Fuzzy control system; Machine learning; Data mining; Mathematics","score_opus":0.013428981496936018,"score_gpt":0.20720323345247957,"score_spread":0.19377425195554354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551008871","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.028275087,0.0005986136,0.96421134,0.000101380894,0.000109503424,0.000114703565,0.000030182731,0.00029294437,0.0062661725],"genre_scores_gemma":[0.63253796,0.0004065278,0.3620501,0.000117349635,0.00005137075,0.0004209875,0.000087199696,0.00006477134,0.004263759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972934,0.00004786818,0.000019948966,0.00007130597,0.00009344789,0.000038180733],"domain_scores_gemma":[0.9995796,0.00013907623,0.00006268598,0.000027138585,0.00017081953,0.000020641794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084408367,0.0006930313,0.0012169934,0.00049344363,0.0005140496,0.0011087407,0.0018031577,0.0017138532,0.0018759238],"category_scores_gemma":[0.0016257958,0.00069283217,0.0007304832,0.00054169964,0.0004892293,0.00072736526,0.0005764458,0.0008652585,0.00039560592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007264545,0.000062971885,0.00024457474,0.000083431834,0.00006156737,0.000093211296,0.00006295676,0.90784585,0.009029875,0.0070727644,0.0005480694,0.07482213],"study_design_scores_gemma":[0.000010094914,0.000035366746,0.000080339545,0.000007698006,0.000014799699,0.00001826991,0.0000035717344,0.99779785,0.0010261023,0.0007140721,0.00028655416,0.0000053409763],"about_ca_topic_score_codex":0.003449194,"about_ca_topic_score_gemma":0.004333197,"teacher_disagreement_score":0.003449194,"about_ca_system_score_codex":0.0008024788,"about_ca_system_score_gemma":0.0008917086,"threshold_uncertainty_score":0.0068582296},"labels":[],"label_agreement":null},{"id":"W1551096017","doi":"10.1007/978-3-642-14888-0_9","title":"On the Central Role of Mailing Lists in Open Source Projects: An Exploratory Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Source Software Innovations","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Open source; Exploratory research; Exploratory analysis; Computer science; World Wide Web; Data science; Sociology; Programming language; Social science","score_opus":0.02994028184153208,"score_gpt":0.27564799832413184,"score_spread":0.24570771648259976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551096017","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.9383153,0.0008702764,0.004418906,0.003155218,0.000033372715,0.00008283508,0.00006979113,0.00006517978,0.052989256],"genre_scores_gemma":[0.99627197,0.0001617985,0.00066092174,0.00011412708,0.00002592007,0.000035980032,0.000031481806,0.000050032235,0.0026477012],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9889448,0.006736123,0.00045880262,0.00086148066,0.0015982128,0.0014004605],"domain_scores_gemma":[0.7095611,0.24325585,0.02096511,0.0051310873,0.009046238,0.0120405955],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.019618459,0.00026463898,0.00048346663,0.0028002106,0.0060504065,0.009954162,0.0022358492,0.0025091185,0.01283004],"category_scores_gemma":[0.08891328,0.0005770799,0.0002972956,0.0034492973,0.005403739,0.014065055,0.0041545033,0.0033537913,0.0019310116],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018925994,0.0024283917,0.33991048,0.0007605468,0.00007757754,0.0011806104,0.3408067,0.00037700764,0.0073810895,0.12721679,0.00563687,0.17233123],"study_design_scores_gemma":[0.00016596536,0.00079648563,0.4696343,0.0010552902,0.00016578202,0.0009535304,0.4415755,0.0026351379,0.0032436838,0.034672953,0.04499937,0.000102012105],"about_ca_topic_score_codex":0.0037645446,"about_ca_topic_score_gemma":0.005465704,"teacher_disagreement_score":0.99004585,"about_ca_system_score_codex":0.003240864,"about_ca_system_score_gemma":0.0051662577,"threshold_uncertainty_score":0.10375363},"labels":[],"label_agreement":null},{"id":"W1551118875","doi":"10.1007/978-3-642-14274-1_38","title":"Runtime Estimation Using the Case-Based Reasoning Approach for Scheduling in a Grid Environment","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Toronto; Ontario Institute for Cancer Research","funders":"","keywords":"Computer science; Grid; Scheduling (production processes); Grid system; Distributed computing; Artificial intelligence; Mathematical optimization","score_opus":0.02341268927035839,"score_gpt":0.24847943688671836,"score_spread":0.22506674761635997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551118875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017552897,0.000097203636,0.97886753,0.00013702016,0.000034670302,0.00006736279,0.00007851031,0.0015660414,0.0015987329],"genre_scores_gemma":[0.4329491,0.00016798687,0.56495476,0.000049636325,0.00004385435,0.000092338654,0.00034251186,0.00024009508,0.0011597562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749124,0.0006691804,0.00022878373,0.0004031766,0.00097141974,0.00023628147],"domain_scores_gemma":[0.995631,0.002606198,0.0003776547,0.00063482026,0.00057943433,0.00017090957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002845252,0.0011181686,0.0014410713,0.002281383,0.0012363383,0.0024783693,0.0030711622,0.0013903421,0.004007074],"category_scores_gemma":[0.0110651245,0.0012092919,0.0015948944,0.0017074341,0.0009120656,0.0028430205,0.001345884,0.0013848743,0.0006719333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038846425,0.00030916318,0.0026188327,0.00014220373,0.000111951515,0.0003656431,0.00014438663,0.8386222,0.006099843,0.017671185,0.0025559985,0.13097009],"study_design_scores_gemma":[0.00001184424,0.00000828018,0.00013988819,0.0000044708368,0.000014471317,0.000026664335,0.00001199624,0.9931733,0.00093357207,0.005457092,0.0002098637,0.00000850832],"about_ca_topic_score_codex":0.01585951,"about_ca_topic_score_gemma":0.012481785,"teacher_disagreement_score":0.01585951,"about_ca_system_score_codex":0.0013232984,"about_ca_system_score_gemma":0.0019948997,"threshold_uncertainty_score":0.031534433},"labels":[],"label_agreement":null},{"id":"W1551174193","doi":"10.1007/978-3-540-74171-8_8","title":"Agent-Based Routing for Wireless Sensor Network","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Acadia University","funders":"","keywords":"Computer network; Wireless sensor network; Computer science; Distributed computing; Redundancy (engineering); Network topology","score_opus":0.024974203470018122,"score_gpt":0.25442789947678407,"score_spread":0.22945369600676596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551174193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029761593,0.019014064,0.94687307,0.0006234598,0.0015135581,0.0001215519,0.00011050783,0.0018200637,0.026947634],"genre_scores_gemma":[0.13735758,0.031131493,0.72372806,0.00040474968,0.0010823299,0.00044459986,0.00072511303,0.0004937837,0.104632296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974483,0.0000692244,0.000018346664,0.00003683429,0.00011802,0.000012715334],"domain_scores_gemma":[0.9998331,0.00006774491,0.000012443518,0.000032402015,0.000043493324,0.000010858876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003305776,0.00068707217,0.00063483964,0.0004212736,0.00030269133,0.0010326126,0.0012611096,0.00084497523,0.0036100824],"category_scores_gemma":[0.00068552204,0.00035557046,0.00028570936,0.0008577895,0.00031730303,0.0012036263,0.0006028708,0.0009180781,0.0018836672],"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.00009184135,0.00011567263,0.00021004918,0.00090789807,0.00010905733,0.00016883384,0.00014484985,0.12619738,0.014798859,0.1491975,0.060314175,0.6477439],"study_design_scores_gemma":[0.000039113158,0.00013300077,0.00027455267,0.00013690568,0.000075595475,0.00040755814,0.000047693287,0.5603862,0.0058253515,0.11107167,0.3215673,0.000035017267],"about_ca_topic_score_codex":0.00062709005,"about_ca_topic_score_gemma":0.00075918605,"teacher_disagreement_score":0.0036100824,"about_ca_system_score_codex":0.0003243944,"about_ca_system_score_gemma":0.0003050245,"threshold_uncertainty_score":0.012076914},"labels":[],"label_agreement":null},{"id":"W1551177187","doi":"10.1007/978-3-540-24587-2_4","title":"A Dynamic Dictionary for Priced Information with Application","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Computer science; Set (abstract data type); Function (biology); Element (criminal law); Line (geometry); Algorithm; Data mining; Programming language; Mathematics","score_opus":0.00679341783684708,"score_gpt":0.2138476800579751,"score_spread":0.20705426222112802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551177187","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.004197234,0.0054457136,0.824674,0.0046105683,0.0032035385,0.00015119993,0.004610309,0.0013900051,0.15171742],"genre_scores_gemma":[0.13283326,0.011837234,0.73062146,0.001595619,0.0034047985,0.0004258043,0.006294759,0.0018995451,0.11108763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990921,0.00020305868,0.00017416498,0.00017342244,0.0003098461,0.00004734437],"domain_scores_gemma":[0.9981583,0.0006244994,0.00011095315,0.0005237436,0.000508675,0.00007385691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009592911,0.000810913,0.0009799644,0.0044262577,0.0014525868,0.004607087,0.0015714413,0.0012680093,0.032678846],"category_scores_gemma":[0.0068741417,0.00059133884,0.00067109073,0.008437521,0.0023667342,0.011040399,0.0019938576,0.0025214744,0.012131839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001810289,0.0000090873955,0.00007901394,0.00012499694,0.0000041327485,0.00011720737,0.00025419443,0.0008246982,0.00046778173,0.87997437,0.032101348,0.086025134],"study_design_scores_gemma":[0.000008516911,0.000020728145,0.00014376786,0.0001754662,0.000013999733,0.00064381276,0.00019236056,0.012530272,0.00084419496,0.4326252,0.5527675,0.00003412465],"about_ca_topic_score_codex":0.0018592167,"about_ca_topic_score_gemma":0.0015998983,"teacher_disagreement_score":0.032678846,"about_ca_system_score_codex":0.0011811515,"about_ca_system_score_gemma":0.0011021963,"threshold_uncertainty_score":0.109321594},"labels":[],"label_agreement":null},{"id":"W1551197562","doi":"10.1007/11802914_50","title":"Spectral Sequencing Based on Graph Distance","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Polygon mesh; Heuristics; Algorithm; Eigenvalues and eigenvectors; Graph; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.01594829513534505,"score_gpt":0.2555742143860312,"score_spread":0.23962591925068613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551197562","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.017146792,0.000099764664,0.9781211,0.000069127105,0.00006505748,0.000054979333,0.00006287549,0.0006835131,0.0036968398],"genre_scores_gemma":[0.3176634,0.00036616586,0.66876036,0.00016370985,0.00012125052,0.0002053877,0.00064647,0.0005259299,0.011547324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.00026145208,0.000040166888,0.00018415303,0.00035561685,0.00008653885],"domain_scores_gemma":[0.99732494,0.0012071446,0.00014115233,0.00056323304,0.0005311908,0.00023233097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000761127,0.0009050433,0.0012923226,0.0020500605,0.0010026962,0.0010723084,0.0016366333,0.0009256724,0.0058048433],"category_scores_gemma":[0.004034786,0.0005387037,0.000694733,0.0019135653,0.0009287055,0.0023836326,0.0017789807,0.0011624448,0.0023611507],"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.0004909611,0.0003527481,0.0008489534,0.00019348384,0.00005056578,0.00018467972,0.00027703468,0.27229455,0.027408322,0.23903772,0.0074531063,0.45140782],"study_design_scores_gemma":[0.000017352844,0.00008414186,0.00021096127,0.000013707711,0.0000128039255,0.000102852064,0.00003893221,0.88822985,0.004522909,0.10393788,0.0028035336,0.000024995197],"about_ca_topic_score_codex":0.0023800205,"about_ca_topic_score_gemma":0.0028301564,"teacher_disagreement_score":0.0058048433,"about_ca_system_score_codex":0.0006721622,"about_ca_system_score_gemma":0.0011434403,"threshold_uncertainty_score":0.019419134},"labels":[],"label_agreement":null},{"id":"W1551198839","doi":"10.1007/11559573_147","title":"Real-Time Image Processing Using Graphics Hardware: A Performance Study","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Laurentian University; University of Calgary","funders":"","keywords":"Computer science; Speedup; Graphics; Image processing; Parallel computing; Graphics hardware; General-purpose computing on graphics processing units; Computer graphics (images); CUDA; Computer hardware; Image (mathematics); Artificial intelligence","score_opus":0.020080722733203056,"score_gpt":0.2867438075536173,"score_spread":0.26666308482041423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551198839","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.74296623,0.012989881,0.2073282,0.0006362937,0.00020009185,0.00017520427,0.00088748866,0.00463425,0.030182354],"genre_scores_gemma":[0.9494593,0.0041724104,0.035855234,0.00006299244,0.00009392123,0.000047242145,0.0008860746,0.0006709503,0.008751709],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827325,0.0004299073,0.00010517873,0.00018186346,0.0007751338,0.00023461846],"domain_scores_gemma":[0.98977685,0.0068404786,0.0005075441,0.0008587769,0.0017658295,0.0002504258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385162,0.0010916372,0.00079699716,0.0017892256,0.000442424,0.0016647023,0.0017998153,0.0009482603,0.008219067],"category_scores_gemma":[0.009294268,0.000385942,0.00046431218,0.0039659096,0.00053808664,0.0022580675,0.000619006,0.0005724571,0.0019477033],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00905755,0.0010851115,0.010942868,0.0013572306,0.0002860047,0.0006942602,0.0006446153,0.10446392,0.112640016,0.010992468,0.011535581,0.73630035],"study_design_scores_gemma":[0.0004203677,0.0061712614,0.026423056,0.00013025607,0.00056736707,0.003545735,0.000833836,0.752377,0.19003463,0.0054134494,0.013924981,0.00015808389],"about_ca_topic_score_codex":0.0038334795,"about_ca_topic_score_gemma":0.0015473496,"teacher_disagreement_score":0.008219067,"about_ca_system_score_codex":0.000856946,"about_ca_system_score_gemma":0.00052105484,"threshold_uncertainty_score":0.027495503},"labels":[],"label_agreement":null},{"id":"W1551220477","doi":"10.1007/978-3-540-71615-0_21","title":"Crossover Operators for the Car Sequencing Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Assembly Line Balancing Optimization","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Crossover; Computer science; Operator (biology); Benchmark (surveying); Scheduling (production processes); Job shop scheduling; Mathematical optimization; Assembly line; Genetic algorithm; Artificial intelligence; Mathematics; Machine learning; Engineering; Schedule","score_opus":0.01749189456774317,"score_gpt":0.24416984797761504,"score_spread":0.22667795340987187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551220477","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.018767534,0.001966351,0.94051766,0.00037705072,0.00024464034,0.00009313632,0.00016888371,0.00037329213,0.03749152],"genre_scores_gemma":[0.30317095,0.0037688545,0.63110185,0.00033460054,0.00036806345,0.00039948872,0.00089690246,0.0006710016,0.05928825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997744,0.00006824607,0.000009955094,0.000034752557,0.000082624385,0.000029993567],"domain_scores_gemma":[0.99974495,0.00016552125,0.000013771493,0.000024975152,0.00003538261,0.000015309783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053779565,0.0008605927,0.00073817314,0.0006175119,0.0005761717,0.00069673744,0.0009939409,0.0008351297,0.006574743],"category_scores_gemma":[0.0011958219,0.00024958065,0.0006954806,0.0012408037,0.00050133484,0.0007993181,0.00064345653,0.0019677288,0.0008430949],"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.00011622704,0.00015094252,0.00029496965,0.00027257347,0.000046075977,0.00025567863,0.00026892018,0.22775453,0.009143753,0.24962641,0.018586053,0.4934838],"study_design_scores_gemma":[0.0001503703,0.00017056178,0.0008691601,0.00012744697,0.000071481256,0.0005346543,0.00009584315,0.55144125,0.0046896148,0.3983851,0.04341906,0.000045483073],"about_ca_topic_score_codex":0.0014249878,"about_ca_topic_score_gemma":0.0014235604,"teacher_disagreement_score":0.006574743,"about_ca_system_score_codex":0.0004921432,"about_ca_system_score_gemma":0.00046532103,"threshold_uncertainty_score":0.02199471},"labels":[],"label_agreement":null},{"id":"W1551244780","doi":"10.1007/978-3-540-30125-7_2","title":"Hierarchical Regions for Image Segmentation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Segmentation; Image segmentation; Artificial intelligence; Straddle; Block (permutation group theory); Image (mathematics); Computer vision; Market segmentation; Iterated function; Scale-space segmentation; Pattern recognition (psychology); Mathematics","score_opus":0.02111746710785406,"score_gpt":0.2967925874741635,"score_spread":0.2756751203663094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551244780","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.0012237332,0.0040562986,0.98627883,0.00008051122,0.000103404396,0.000045262914,0.00017354639,0.0022872826,0.005751182],"genre_scores_gemma":[0.03348943,0.0044824765,0.9375251,0.00015674002,0.00019949954,0.00014020878,0.000949173,0.0012317393,0.021825597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962986,0.00005253315,0.00002021314,0.00010317696,0.00016029231,0.000033829536],"domain_scores_gemma":[0.9996593,0.00012199735,0.000024230356,0.00010879755,0.00007240253,0.000013264762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034869215,0.0009875647,0.0010394739,0.0014080502,0.00031345474,0.0010944032,0.0016050915,0.0010194922,0.013634822],"category_scores_gemma":[0.00084372255,0.0008259589,0.00071328535,0.002159697,0.00060975313,0.0014870797,0.0010352269,0.00093238853,0.0070970096],"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.00010961436,0.000032138443,0.000087796,0.0006284177,0.00006777972,0.00013997203,0.00011738143,0.022379493,0.069170736,0.06860841,0.026718153,0.81194013],"study_design_scores_gemma":[0.000054515207,0.00016315919,0.0011755917,0.0002145258,0.00019563892,0.0014864467,0.00009634604,0.4572509,0.11714683,0.18800992,0.23411182,0.00009433173],"about_ca_topic_score_codex":0.0011571832,"about_ca_topic_score_gemma":0.0016518633,"teacher_disagreement_score":0.013634822,"about_ca_system_score_codex":0.0004246945,"about_ca_system_score_gemma":0.00039047914,"threshold_uncertainty_score":0.04561305},"labels":[],"label_agreement":null},{"id":"W1551287518","doi":"10.1007/978-3-540-85988-8_35","title":"Bone Segmentation and Fracture Detection in Ultrasound Using 3D Local Phase Features","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; 3D ultrasound; Artificial intelligence; Segmentation; Speckle pattern; Imaging phantom; Computer vision; Phase congruency; Ridge; Filter (signal processing); Pattern recognition (psychology); Ultrasound; Feature extraction; Geology; Radiology; Acoustics; Physics; Medicine","score_opus":0.01581582623786595,"score_gpt":0.3019868058840909,"score_spread":0.28617097964622495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551287518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09050753,0.0007948625,0.9059295,0.00019957313,0.000035710513,0.0000729337,0.00016672428,0.0010077524,0.0012854534],"genre_scores_gemma":[0.4107874,0.00077428704,0.5855157,0.00011179221,0.00007574236,0.0000901941,0.00024666952,0.00028401523,0.0021142722],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996476,0.000045994853,0.000022272903,0.000061609746,0.00018615379,0.000036402762],"domain_scores_gemma":[0.99942386,0.00030820782,0.00006810558,0.00005597337,0.00011511834,0.00002875141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005545684,0.00051006995,0.000644557,0.0022873562,0.00030141388,0.0009894435,0.0007382396,0.0015051601,0.002544575],"category_scores_gemma":[0.001981241,0.00083824294,0.00067626714,0.0013957137,0.0004917849,0.00091317337,0.0006409104,0.00057092815,0.00089926174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008928096,0.00013461341,0.0064563095,0.00036228585,0.00008486141,0.00059770094,0.0002498677,0.029307006,0.38529947,0.0030327125,0.0014823639,0.5721],"study_design_scores_gemma":[0.00009364576,0.00032969375,0.02206443,0.00006173843,0.00017709142,0.00390802,0.00018509052,0.6983856,0.2654312,0.005491266,0.003786309,0.00008591442],"about_ca_topic_score_codex":0.0018380886,"about_ca_topic_score_gemma":0.0031603272,"teacher_disagreement_score":0.002544575,"about_ca_system_score_codex":0.00030877697,"about_ca_system_score_gemma":0.00056710566,"threshold_uncertainty_score":0.008512497},"labels":[],"label_agreement":null},{"id":"W1551380792","doi":"10.1007/978-3-642-14186-7_23","title":"Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Benchmark (surveying); Computer science; Variable (mathematics); Generalization; Satisfiability; Weighting; Selection (genetic algorithm); Algorithm; Software; Theoretical computer science; Artificial intelligence; Mathematics; Programming language","score_opus":0.03028256369701329,"score_gpt":0.3246639566711262,"score_spread":0.2943813929741129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551380792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016499214,0.0001227862,0.99102366,0.00013436809,0.000057393354,0.00004757341,0.00006563998,0.0008936086,0.0060050916],"genre_scores_gemma":[0.08636828,0.00030733753,0.8942012,0.00028998373,0.00015142195,0.0004369543,0.0004536641,0.001375209,0.01641591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977633,0.0009641819,0.00012696009,0.00030329882,0.00067040266,0.00017199434],"domain_scores_gemma":[0.99744606,0.001609261,0.00010282959,0.0004731494,0.00028866704,0.0000799705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028345264,0.0013447322,0.0012201924,0.0015977495,0.00087691325,0.0019624233,0.0038326853,0.0010969181,0.015945446],"category_scores_gemma":[0.007414635,0.0008477859,0.0017522031,0.002098932,0.0022164918,0.0043676374,0.0033754879,0.0036081346,0.0036252644],"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.00011695513,0.00014311205,0.0003804424,0.00031860598,0.00006822036,0.000046519228,0.00033946946,0.051948763,0.0020795325,0.56326085,0.013243135,0.3680544],"study_design_scores_gemma":[0.0000680868,0.000025957517,0.00009261482,0.00006132837,0.000035971145,0.000035479385,0.000051663024,0.42730138,0.0016085841,0.55616593,0.014532785,0.00002018291],"about_ca_topic_score_codex":0.0015652396,"about_ca_topic_score_gemma":0.003998576,"teacher_disagreement_score":0.015945446,"about_ca_system_score_codex":0.0014366726,"about_ca_system_score_gemma":0.0015449073,"threshold_uncertainty_score":0.05334282},"labels":[],"label_agreement":null},{"id":"W1551436493","doi":"10.1007/978-3-642-01818-3_45","title":"A Semi-supervised Approach to Bengali-English Phrase-Based Statistical Machine Translation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bengali; Computer science; Phrase; Machine translation; Natural language processing; Artificial intelligence; Machine translation software usability; Evaluation of machine translation; Example-based machine translation; Translation (biology)","score_opus":0.017684208910393368,"score_gpt":0.2575843355221754,"score_spread":0.23990012661178203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551436493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008364458,0.00075060467,0.9760139,0.00030154563,0.00025799967,0.00019789825,0.0010185088,0.009102589,0.003992595],"genre_scores_gemma":[0.13538675,0.0006994605,0.84339803,0.00034308297,0.00032679032,0.0005505932,0.0075024916,0.0019426837,0.009850146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597794,0.0019018016,0.0003718917,0.000753731,0.0007709686,0.00022377551],"domain_scores_gemma":[0.9937727,0.002385584,0.00032838323,0.0011041106,0.0022744501,0.00013484417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281078,0.0012871082,0.0019543672,0.0021128512,0.0015474285,0.0028279554,0.0026805676,0.0011353294,0.005066681],"category_scores_gemma":[0.007397032,0.00079226535,0.0014335717,0.0035626495,0.0007441995,0.002111169,0.002554765,0.0023644564,0.008143486],"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.0005302603,0.0004824262,0.0009665506,0.0007064706,0.0004051539,0.00040048506,0.0006902161,0.01949404,0.05244903,0.017133094,0.035884876,0.8708574],"study_design_scores_gemma":[0.00009637908,0.00033948186,0.0022720932,0.00008169366,0.00027193822,0.000790651,0.00046753717,0.85535485,0.06724207,0.03712856,0.03578685,0.00016789921],"about_ca_topic_score_codex":0.0053489255,"about_ca_topic_score_gemma":0.0096146045,"teacher_disagreement_score":0.0053489255,"about_ca_system_score_codex":0.0008819199,"about_ca_system_score_gemma":0.002484411,"threshold_uncertainty_score":0.016949773},"labels":[],"label_agreement":null},{"id":"W1551503949","doi":"10.1007/11941354_26","title":"Exploring Human-Robot Interaction Through Telepresence Board Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Human–computer interaction; Robot; Computer science; Situated; Human–robot interaction; Test (biology); Simulation; Artificial intelligence","score_opus":0.16033913236045352,"score_gpt":0.3803700779015312,"score_spread":0.2200309455410777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551503949","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.9332222,0.00015780407,0.047489885,0.000097347096,0.000010109063,0.00005168108,0.00007845607,0.00012712582,0.018765384],"genre_scores_gemma":[0.9905738,0.00004366976,0.0072595463,0.000013140846,0.0000010948349,0.000020465674,0.00004380762,0.000016952956,0.0020275477],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998747,0.00006704247,0.0000017207368,0.000019405054,0.000015577505,0.000021511827],"domain_scores_gemma":[0.99980575,0.0001566475,0.0000086559585,0.0000067565534,0.0000069839316,0.000015127461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013619676,0.0004904187,0.00020307949,0.000108030494,0.00033108855,0.0008550036,0.00045201546,0.00046415886,0.0051979693],"category_scores_gemma":[0.0007551926,0.00020161377,0.00019050975,0.000095616655,0.00041758578,0.00094712974,0.0006434832,0.00034535886,0.0002178836],"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.0050555156,0.0017726113,0.036580134,0.0011745048,0.00040302932,0.0036687576,0.069906995,0.09730543,0.44561136,0.07107706,0.007562871,0.2598817],"study_design_scores_gemma":[0.00030497008,0.0018082109,0.101291366,0.00013887302,0.0001837959,0.0014247517,0.037510555,0.72871745,0.051064834,0.052859493,0.024559269,0.00013647953],"about_ca_topic_score_codex":0.0019375316,"about_ca_topic_score_gemma":0.0036403493,"teacher_disagreement_score":0.0051979693,"about_ca_system_score_codex":0.00022289403,"about_ca_system_score_gemma":0.00014853224,"threshold_uncertainty_score":0.01738894},"labels":[],"label_agreement":null},{"id":"W1551510483","doi":"10.1007/978-3-540-92865-2_25","title":"Gesture Control of Sound Spatialization for Live Musical Performance","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Spatialization; Gesture; Computer science; Control (management); Point (geometry); Sound (geography); Musical; Human–computer interaction; Artificial intelligence; Computer vision; Acoustics; Visual arts; Art","score_opus":0.013934145368272402,"score_gpt":0.23188294972848744,"score_spread":0.21794880436021505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551510483","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22864531,0.0016939954,0.71779346,0.00021399187,0.00032886534,0.00015173109,0.00037474828,0.0049483906,0.045849483],"genre_scores_gemma":[0.9235475,0.0003550655,0.059937514,0.0000690223,0.000040815616,0.000108113236,0.00017107753,0.00035290734,0.01541802],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980456,0.000027295671,0.000011180797,0.000052453463,0.00006606778,0.000038429134],"domain_scores_gemma":[0.999813,0.00008330749,0.000015012539,0.00003759689,0.000031633863,0.000019460118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021367942,0.0004315161,0.00039186858,0.00023483246,0.00028442845,0.00084048323,0.00075886125,0.00031408804,0.013590024],"category_scores_gemma":[0.00083493436,0.00019931783,0.00021287943,0.00023165306,0.00051554816,0.00059527624,0.0009308964,0.0003042041,0.0012873441],"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.00072499114,0.0000720701,0.00042459462,0.00021728818,0.000021530945,0.00013179521,0.0003393862,0.0042532147,0.7293676,0.0057702474,0.0022272568,0.25644994],"study_design_scores_gemma":[0.00024956668,0.00082857534,0.014741935,0.00013079272,0.00013404692,0.0011170624,0.00074736314,0.23116408,0.68454295,0.012983601,0.053218275,0.00014166915],"about_ca_topic_score_codex":0.0009854547,"about_ca_topic_score_gemma":0.0018415573,"teacher_disagreement_score":0.013590024,"about_ca_system_score_codex":0.00018256894,"about_ca_system_score_gemma":0.00017515886,"threshold_uncertainty_score":0.045463204},"labels":[],"label_agreement":null},{"id":"W1551534812","doi":"10.1007/978-3-642-03784-9_30","title":"Practical Algorithms for the Longest Common Extension Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Substring; Computer science; String (physics); Computation; Algorithm; Constant (computer programming); Extension (predicate logic); Preprocessor; Time complexity; String searching algorithm; Theoretical computer science; Data structure; Mathematics; Artificial intelligence","score_opus":0.041541350322374326,"score_gpt":0.3083783851601656,"score_spread":0.26683703483779125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551534812","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.008673394,0.0011362915,0.9705154,0.0011466303,0.00033846634,0.00025310268,0.00043647512,0.0018905286,0.015609609],"genre_scores_gemma":[0.0814061,0.0010402108,0.90289986,0.00039339595,0.00060424604,0.0006418747,0.0016884183,0.0009015975,0.010424265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952468,0.0011380705,0.00037486767,0.0012172295,0.0014227965,0.0006001796],"domain_scores_gemma":[0.9862255,0.008164376,0.000587691,0.0034603062,0.0012256713,0.00033653443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004145273,0.002576587,0.0028109804,0.002977854,0.0025981772,0.0053766156,0.0059717186,0.0032084407,0.028274966],"category_scores_gemma":[0.01961007,0.0014777664,0.0026537168,0.0059092618,0.002912033,0.011824186,0.0066699046,0.0062864963,0.007842009],"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.00070854364,0.00046511405,0.0006340281,0.00073460425,0.00011866919,0.00015078313,0.00049918966,0.05952926,0.003753493,0.36214626,0.044284232,0.52697575],"study_design_scores_gemma":[0.0003662999,0.0001072174,0.00020680812,0.00010324289,0.00006761659,0.0003329964,0.00020340952,0.18710785,0.0023833031,0.79323685,0.015825462,0.00005907666],"about_ca_topic_score_codex":0.0019561073,"about_ca_topic_score_gemma":0.0028746703,"teacher_disagreement_score":0.028274966,"about_ca_system_score_codex":0.0026186947,"about_ca_system_score_gemma":0.0037871625,"threshold_uncertainty_score":0.094589114},"labels":[],"label_agreement":null},{"id":"W1551572893","doi":"10.1007/978-3-540-30500-2_21","title":"An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Trent University","funders":"","keywords":"Computer science; Quantum; Automaton; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.01346062156270837,"score_gpt":0.2702512214973635,"score_spread":0.25679059993465514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551572893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013523281,0.0018005754,0.91523355,0.0014305603,0.0008663508,0.00011951246,0.00011565994,0.00094040507,0.065970026],"genre_scores_gemma":[0.48601088,0.0028386037,0.47087666,0.00083307375,0.0011321389,0.00036217264,0.00022329796,0.00062551687,0.03709759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893504,0.00042605918,0.00006839171,0.00016868596,0.00030822752,0.000093724615],"domain_scores_gemma":[0.9975326,0.0019052416,0.000046818946,0.00027373226,0.00017835453,0.00006321948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692157,0.0005522504,0.0008102186,0.00089690037,0.0016206963,0.0027607123,0.0015064813,0.0012861639,0.014499778],"category_scores_gemma":[0.0056482097,0.00063971645,0.0020698889,0.0012506471,0.0031375922,0.0043397914,0.002885055,0.0026670052,0.0016970031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002494889,0.000026523378,0.000078878555,0.00009556027,0.000023369506,0.00013905184,0.00024895044,0.006421628,0.0012181541,0.96417123,0.0025331762,0.025018536],"study_design_scores_gemma":[0.00001077561,0.000011130776,0.00006169424,0.00002147507,0.000012258401,0.00006114622,0.000016774353,0.02795339,0.0007752311,0.962548,0.008516234,0.000011801612],"about_ca_topic_score_codex":0.0019769536,"about_ca_topic_score_gemma":0.0013971792,"teacher_disagreement_score":0.014499778,"about_ca_system_score_codex":0.0017195008,"about_ca_system_score_gemma":0.00088901847,"threshold_uncertainty_score":0.048506618},"labels":[],"label_agreement":null},{"id":"W1551586077","doi":"10.1007/978-3-319-12340-0_20","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Constant (computer programming); Treewidth; Graph; Discrete mathematics; Physics; Pathwidth; Computer science","score_opus":0.0165859407235565,"score_gpt":0.28004999691450977,"score_spread":0.26346405619095326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551586077","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.11314021,0.0031400735,0.82385707,0.0022614037,0.00042262467,0.00056936685,0.0031882024,0.013473173,0.039947942],"genre_scores_gemma":[0.26332125,0.0010046664,0.70809084,0.00051899644,0.00019002496,0.0004712218,0.007402886,0.0013751355,0.017624974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881613,0.00016268138,0.000054670396,0.00033439446,0.00029728728,0.00033489038],"domain_scores_gemma":[0.998389,0.00063368893,0.00010577458,0.0004532069,0.00024604844,0.00017231356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073775894,0.0027755653,0.0023553597,0.0016314883,0.0012269737,0.002888047,0.0038580217,0.0019146731,0.026537545],"category_scores_gemma":[0.0032225025,0.0008511571,0.0017026908,0.0037025588,0.00079540245,0.0052207946,0.002812149,0.0031061457,0.007867556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020909514,0.0011182657,0.00163623,0.0012870423,0.00020120923,0.00024011027,0.00049973745,0.12757097,0.021096494,0.03943315,0.08874761,0.7160783],"study_design_scores_gemma":[0.0006614872,0.00026847818,0.00076468097,0.00008554906,0.00016678682,0.00030031163,0.00036282185,0.8775657,0.0076699913,0.09989977,0.012209794,0.00004469429],"about_ca_topic_score_codex":0.007229026,"about_ca_topic_score_gemma":0.011601801,"teacher_disagreement_score":0.026537545,"about_ca_system_score_codex":0.0025590772,"about_ca_system_score_gemma":0.0031869914,"threshold_uncertainty_score":0.08877689},"labels":[],"label_agreement":null},{"id":"W1551733566","doi":"10.1007/3-540-45102-1_11","title":"Copying and Comparing: Problems and Solutions","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Copying; Computer science; Smalltalk; Programming language; Compiler; Object (grammar); Simple (philosophy); Theoretical computer science; Object-oriented programming; Artificial intelligence","score_opus":0.04190227033426121,"score_gpt":0.2422508583122937,"score_spread":0.2003485879780325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551733566","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.087759204,0.014113291,0.7109595,0.0174977,0.0011238534,0.0003042589,0.0011008494,0.0021184587,0.16502288],"genre_scores_gemma":[0.66290385,0.0065839677,0.27263004,0.0011799749,0.0019108367,0.0003924869,0.0013621236,0.0019890317,0.051047694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9847837,0.0063933823,0.0013471318,0.0035823323,0.0031507153,0.0007428231],"domain_scores_gemma":[0.9291802,0.05570584,0.0020800147,0.009571548,0.0026136618,0.0008488125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008678279,0.0011147239,0.0039856266,0.0036906465,0.004937859,0.01167846,0.008465099,0.005570321,0.028242253],"category_scores_gemma":[0.09071307,0.0016462784,0.0024879351,0.016069336,0.01121737,0.03853597,0.0067149545,0.0038287097,0.002840745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079096004,0.000055389217,0.00085956993,0.00019831801,0.000026813224,0.00007757355,0.0007773058,0.0026988809,0.00014611552,0.8577215,0.009415108,0.12794428],"study_design_scores_gemma":[0.000011246107,0.000004778483,0.00016568547,0.00004128645,0.00001106448,0.00009639633,0.00024747764,0.0036791035,0.00028124897,0.99030674,0.0051399707,0.0000151124505],"about_ca_topic_score_codex":0.0046844566,"about_ca_topic_score_gemma":0.0034323381,"teacher_disagreement_score":0.028242253,"about_ca_system_score_codex":0.003696123,"about_ca_system_score_gemma":0.002827727,"threshold_uncertainty_score":0.0944798},"labels":[],"label_agreement":null},{"id":"W1551741615","doi":"10.1007/3-540-45724-0_28","title":"Using Genetic Algorithms to Optimize ACS-TSP","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Genetic algorithm; Ant colony optimization algorithms; Algorithm; Variable (mathematics); Ant colony; Travelling salesman problem; Population-based incremental learning; Mathematical optimization; Machine learning; Mathematics","score_opus":0.05726925925110299,"score_gpt":0.3053369914652968,"score_spread":0.24806773221419381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551741615","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.093366526,0.0014747146,0.8525985,0.0004114477,0.0003651386,0.00014530723,0.000095261916,0.0013635778,0.05017962],"genre_scores_gemma":[0.46770686,0.0007009792,0.5212255,0.00017194297,0.0001024291,0.00016466416,0.00016067065,0.00035756128,0.009409347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997707,0.000066022905,0.000008145905,0.000024369234,0.00010242742,0.00002838887],"domain_scores_gemma":[0.999734,0.00013368404,0.000026187305,0.000030316305,0.000065212625,0.000010611943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005188548,0.0006442076,0.0006188561,0.0007765912,0.00039385425,0.00083925953,0.00088491704,0.0010828417,0.002403787],"category_scores_gemma":[0.0017567731,0.00036673236,0.00054758,0.0015287459,0.00046558862,0.00073621905,0.00046566647,0.00082358776,0.00045827992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004641194,0.000053221647,0.0002506944,0.00006064028,0.00003461944,0.0000466115,0.000031794676,0.9047716,0.0030045812,0.0134448875,0.0015827958,0.0766722],"study_design_scores_gemma":[0.00001533384,0.000032734883,0.00007870391,0.000006482697,0.000016494438,0.000017580085,0.000008889776,0.99169296,0.00097146246,0.005367676,0.001788009,0.0000036260467],"about_ca_topic_score_codex":0.0039298353,"about_ca_topic_score_gemma":0.0051105907,"teacher_disagreement_score":0.0039298353,"about_ca_system_score_codex":0.0006399524,"about_ca_system_score_gemma":0.0007828138,"threshold_uncertainty_score":0.008041501},"labels":[],"label_agreement":null},{"id":"W1551753208","doi":"10.1007/978-3-642-13208-7_61","title":"Using Feature Selection Approaches to Find the Dependent Features","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Feature selection; Selection (genetic algorithm); Artificial intelligence; Feature (linguistics); Pattern recognition (psychology)","score_opus":0.06967491408382005,"score_gpt":0.27316246559877755,"score_spread":0.2034875515149575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551753208","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.015107878,0.00044476375,0.9818255,0.000114407994,0.00010773363,0.00008520611,0.00023094524,0.0012073283,0.00087619905],"genre_scores_gemma":[0.2755054,0.00074495655,0.7123434,0.00019707555,0.00036694488,0.000375986,0.0029744997,0.00051465177,0.0069770245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.00013498416,0.000058747934,0.00021412878,0.0003119376,0.00008128078],"domain_scores_gemma":[0.9979954,0.0010278075,0.000101780504,0.00022666539,0.0005907208,0.00005759638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015803658,0.001956991,0.0020015829,0.0027467704,0.00067917974,0.001375549,0.0015990097,0.001117913,0.0029179356],"category_scores_gemma":[0.0036824974,0.0004345402,0.0018827987,0.002966828,0.0003596576,0.0013442752,0.000938011,0.0015366077,0.0022275916],"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.0003993386,0.00036075656,0.0041914415,0.00023302836,0.0003424557,0.00037529133,0.00009283108,0.025497187,0.047795992,0.002945457,0.0093808705,0.90838546],"study_design_scores_gemma":[0.0001411214,0.00029991445,0.009306111,0.000047190253,0.0005320749,0.0005027227,0.0001299666,0.9318844,0.033912286,0.014296306,0.008856599,0.000091378846],"about_ca_topic_score_codex":0.0019374285,"about_ca_topic_score_gemma":0.0021989474,"teacher_disagreement_score":0.0029179356,"about_ca_system_score_codex":0.00027637547,"about_ca_system_score_gemma":0.0006432594,"threshold_uncertainty_score":0.009761512},"labels":[],"label_agreement":null},{"id":"W1551848062","doi":"10.1007/11527800_25","title":"Overview of Generative Software Development","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Generative grammar; Software engineering; Domain (mathematical analysis); Software development; Software system; Domain engineering; Exploit; Set (abstract data type); Development (topology); Generative Design; Software; Model-driven architecture; Component-based software engineering; Programming language; Artificial intelligence; Engineering","score_opus":0.06802886348182707,"score_gpt":0.305745856795859,"score_spread":0.2377169933140319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551848062","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021413837,0.13375726,0.6143099,0.0032262348,0.0008054776,0.00025683315,0.00030908312,0.003748204,0.24144554],"genre_scores_gemma":[0.06445254,0.21172468,0.5653075,0.0019775596,0.0012914673,0.0006150755,0.0016331446,0.0015788614,0.15141921],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926096,0.00015324868,0.000054705597,0.000119516946,0.00035995746,0.000051605526],"domain_scores_gemma":[0.9993067,0.00034139387,0.00002882873,0.00015151444,0.00012861953,0.000042931053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083066063,0.0007995352,0.0006317331,0.0024980418,0.0008059362,0.003201762,0.0015980402,0.0014757288,0.01750421],"category_scores_gemma":[0.001536689,0.001022604,0.0008801377,0.0036933601,0.0011697415,0.003280634,0.0018407799,0.0020315526,0.010442173],"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.000020482923,0.000075098185,0.00022414316,0.0013284085,0.000014137752,0.000109467364,0.00042683893,0.0034413093,0.0018541117,0.27501208,0.02322661,0.69426733],"study_design_scores_gemma":[0.000010573241,0.000037372956,0.00025182866,0.00061805,0.00001381696,0.0006250716,0.00006969494,0.0047535575,0.0013096123,0.14200836,0.85027826,0.00002381892],"about_ca_topic_score_codex":0.0012169923,"about_ca_topic_score_gemma":0.0017550155,"teacher_disagreement_score":0.01750421,"about_ca_system_score_codex":0.0009792481,"about_ca_system_score_gemma":0.0017788596,"threshold_uncertainty_score":0.05855745},"labels":[],"label_agreement":null},{"id":"W1551876208","doi":"10.1007/978-3-540-24840-8_46","title":"Histogram Arc Consistency as a Value Ordering Heuristic","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Constraint satisfaction problem; Local consistency; Computer science; Consistency (knowledge bases); Heuristic; Mathematical optimization; Histogram; Constraint satisfaction; Algorithm; Variable (mathematics); Constraint (computer-aided design); Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.012639467594450947,"score_gpt":0.23458449026805703,"score_spread":0.22194502267360608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551876208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036381178,0.000629939,0.9457648,0.0005391294,0.00026726746,0.00022548756,0.0002511277,0.0017845005,0.014156689],"genre_scores_gemma":[0.36046222,0.0003367338,0.6285427,0.00023071106,0.00015155296,0.00017731369,0.0004992268,0.00068980566,0.008909718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983063,0.00062525243,0.000059878916,0.00023936428,0.00056698034,0.00020223844],"domain_scores_gemma":[0.99444264,0.0034623116,0.00021779527,0.0010466215,0.0006129782,0.00021766903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019681577,0.0006534082,0.001507974,0.0022445545,0.001071719,0.0017353154,0.0030323134,0.001205817,0.011894606],"category_scores_gemma":[0.008732526,0.0007903644,0.0008267053,0.0038876976,0.0012975656,0.0033641544,0.0015581317,0.0021470524,0.00080229953],"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.0006126468,0.00044691243,0.0018193468,0.00028285402,0.00009341431,0.00012759033,0.00019932112,0.20822911,0.0043511367,0.19184108,0.016808076,0.5751886],"study_design_scores_gemma":[0.00011210946,0.0001349419,0.0006079983,0.000049119153,0.000068515066,0.00011006477,0.00011031171,0.8051298,0.005356136,0.18052948,0.007748626,0.000042972115],"about_ca_topic_score_codex":0.0045833546,"about_ca_topic_score_gemma":0.0057370183,"teacher_disagreement_score":0.011894606,"about_ca_system_score_codex":0.0016511078,"about_ca_system_score_gemma":0.0022017895,"threshold_uncertainty_score":0.039791465},"labels":[],"label_agreement":null},{"id":"W155192273","doi":"10.1007/978-3-642-32584-7_24","title":"Mining Popular Patterns from Transactional Databases","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Popularity; Computer science; Data mining; Transactional leadership; Tree (set theory); Space (punctuation); Theoretical computer science; Mathematics","score_opus":0.03628745681093394,"score_gpt":0.266679770341694,"score_spread":0.23039231353076006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155192273","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.58145535,0.0075166686,0.38603154,0.0014097753,0.0003246693,0.00047755206,0.011649852,0.003696011,0.0074386285],"genre_scores_gemma":[0.74663895,0.003271222,0.22083253,0.00020096767,0.00039978288,0.0002906566,0.022094073,0.00028740818,0.00598442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985844,0.000125316,0.00019556178,0.00028671278,0.0006812341,0.00012678931],"domain_scores_gemma":[0.9967001,0.0014989087,0.0004341323,0.0004900594,0.0006943288,0.00018240124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096794,0.00081177196,0.001056319,0.0064452128,0.00069853116,0.0023058162,0.0020037205,0.00091090926,0.002470499],"category_scores_gemma":[0.006969443,0.0006263225,0.0011517665,0.009343277,0.00048001227,0.0052925632,0.0012634757,0.0010472942,0.0016580872],"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.0009573137,0.0004741639,0.06185399,0.001164488,0.0004702768,0.0021679904,0.0006482208,0.011109685,0.018492766,0.01446926,0.015308557,0.87288326],"study_design_scores_gemma":[0.00021542465,0.0007148019,0.041296955,0.0003361644,0.00066036155,0.010176833,0.0020119858,0.76050484,0.029558832,0.124215245,0.030181946,0.00012659308],"about_ca_topic_score_codex":0.00078366953,"about_ca_topic_score_gemma":0.0018206727,"teacher_disagreement_score":0.0064452128,"about_ca_system_score_codex":0.00035644727,"about_ca_system_score_gemma":0.0005557201,"threshold_uncertainty_score":0.008264601},"labels":[],"label_agreement":null},{"id":"W155194117","doi":"10.1007/978-3-642-31087-4_34","title":"A Semantic-Based Social Network of Academic Researchers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Artificial intelligence; World Wide Web; Data science; Information retrieval; Social media","score_opus":0.041521192869372746,"score_gpt":0.3198772308341208,"score_spread":0.27835603796474806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155194117","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.5878258,0.003015495,0.2761312,0.0070054047,0.0004587236,0.0006294834,0.05637723,0.0016084765,0.0669481],"genre_scores_gemma":[0.8778556,0.0011971504,0.09350664,0.000275286,0.00025087388,0.00029723338,0.020624014,0.000093716924,0.005899567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989549,0.00030915008,0.00009053414,0.000257338,0.00031934283,0.00006865289],"domain_scores_gemma":[0.9970343,0.001475145,0.00044561195,0.00022669084,0.00056386204,0.00025439454],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0009221393,0.00030858803,0.00030337257,0.007768045,0.0013835666,0.002239551,0.0007782391,0.0011822849,0.0036492348],"category_scores_gemma":[0.0057145488,0.00027496723,0.0005408342,0.009112233,0.00063114177,0.005829113,0.0013605439,0.00051145727,0.0009785537],"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.0010866359,0.00056565105,0.14696404,0.0013003884,0.00043408558,0.0021413236,0.009499291,0.059277132,0.01291947,0.4281731,0.07335241,0.26428643],"study_design_scores_gemma":[0.000085854845,0.00018341192,0.072535515,0.0003006431,0.0003464077,0.0015736198,0.0063160635,0.40434936,0.003373111,0.36875784,0.14203167,0.00014661449],"about_ca_topic_score_codex":0.006885854,"about_ca_topic_score_gemma":0.013694662,"teacher_disagreement_score":0.99223197,"about_ca_system_score_codex":0.00087911607,"about_ca_system_score_gemma":0.00083746103,"threshold_uncertainty_score":0.0136915445},"labels":[],"label_agreement":null},{"id":"W1552056093","doi":"10.1007/978-3-540-30536-1_34","title":"A User Level, Reliable, and Reconfigurable Transport Layer Protocol","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transport layer; Computer network; TCP Friendly Rate Control; Transmission Control Protocol; Distributed computing; Network packet; Layer (electronics)","score_opus":0.021297036056935805,"score_gpt":0.24183109956596427,"score_spread":0.22053406350902846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552056093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01888706,0.0018293213,0.9317105,0.00059851224,0.00083798607,0.00022491369,0.00019252443,0.01326791,0.032451313],"genre_scores_gemma":[0.39820048,0.002237267,0.5345579,0.00058715313,0.00095196534,0.00043413573,0.0006442115,0.0017139814,0.06067305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929917,0.00011251954,0.00005710768,0.0000844815,0.00034923226,0.000097482174],"domain_scores_gemma":[0.99904114,0.00015230113,0.000064117405,0.0004744082,0.00019912119,0.0000688931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008374031,0.00064033497,0.0005315791,0.0008074112,0.00074624195,0.0020288774,0.0024059217,0.0008707905,0.004417688],"category_scores_gemma":[0.0016090468,0.00053135114,0.00046352833,0.0006752892,0.0007178406,0.0022492798,0.0013396319,0.0022801354,0.0022020233],"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.00083448,0.00029628183,0.00094518496,0.00040789173,0.00012727559,0.0006028985,0.00038454722,0.034214664,0.117735155,0.33792567,0.047091078,0.45943487],"study_design_scores_gemma":[0.00017143294,0.000708823,0.001289798,0.0001258216,0.00035702344,0.0018028675,0.00011842344,0.5318146,0.11212571,0.10764164,0.24364765,0.00019625363],"about_ca_topic_score_codex":0.0006880243,"about_ca_topic_score_gemma":0.001053771,"teacher_disagreement_score":0.004417688,"about_ca_system_score_codex":0.00054463616,"about_ca_system_score_gemma":0.0007533083,"threshold_uncertainty_score":0.014778614},"labels":[],"label_agreement":null},{"id":"W1552089245","doi":"10.1007/978-3-642-12159-3_19","title":"Bayesian Learning of Generalized Gaussian Mixture Models on Biomedical Images","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Mixture model; Computer science; Artificial intelligence; Pattern recognition (psychology); Outlier; Context (archaeology); Gaussian; Segmentation; Image segmentation; Bayesian probability; Gaussian noise; Gaussian process; Noise (video); Image (mathematics)","score_opus":0.011570056695814521,"score_gpt":0.255546397975233,"score_spread":0.24397634127941847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552089245","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.0042466107,0.000500495,0.9941831,0.00020546836,0.000024391793,0.000024867304,0.00010242617,0.00031898674,0.00039368274],"genre_scores_gemma":[0.26442924,0.0031265577,0.71984744,0.0005247251,0.0004040468,0.00043429862,0.0023941342,0.0005355944,0.00830399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853015,0.00060411356,0.00007497139,0.00034899,0.0003227853,0.00011893523],"domain_scores_gemma":[0.9961063,0.0027321032,0.00026948578,0.0003814072,0.00041810644,0.0000925755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038653333,0.0010955877,0.0021409907,0.0016613876,0.00040904892,0.0019587118,0.0029911776,0.0030003963,0.0020556345],"category_scores_gemma":[0.01044545,0.002065136,0.0029554316,0.0021433616,0.0014706026,0.0026033933,0.0025620183,0.0028523486,0.0012882843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026517693,0.000092022354,0.0008744487,0.00026652956,0.000234438,0.00008552937,0.00017700122,0.6584726,0.004600995,0.04195637,0.0048438134,0.28813115],"study_design_scores_gemma":[0.000008091317,0.0000139659105,0.00023082542,0.000015872607,0.000016042748,0.000034372606,0.00000507245,0.98039746,0.00044760376,0.018326301,0.0004895656,0.00001470863],"about_ca_topic_score_codex":0.0075472514,"about_ca_topic_score_gemma":0.008799503,"teacher_disagreement_score":0.0075472514,"about_ca_system_score_codex":0.001292082,"about_ca_system_score_gemma":0.0009962465,"threshold_uncertainty_score":0.020442069},"labels":[],"label_agreement":null},{"id":"W1552110283","doi":"10.1007/978-3-642-13495-1_8","title":"A New Particle Swarm Optimization Algorithm and Its Numerical Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Science North","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Position (finance); Metaheuristic; Computer science; Mathematical optimization; Current (fluid); Algorithm; Swarm behaviour; Derivative-free optimization; Imperialist competitive algorithm; Particle (ecology); Mathematics; Physics","score_opus":0.018230710757319944,"score_gpt":0.2749722324822797,"score_spread":0.25674152172495973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552110283","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.0033567278,0.00083071366,0.98957026,0.00016894203,0.00030262888,0.000036839097,0.000023738448,0.00012470268,0.005585462],"genre_scores_gemma":[0.13923503,0.002231136,0.8389801,0.00021597653,0.00046677075,0.00035280324,0.00015540251,0.00025781844,0.018104918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962664,0.00009804573,0.000018408075,0.00003921663,0.00020160913,0.000016143124],"domain_scores_gemma":[0.9990416,0.00054741884,0.00005360882,0.00008222077,0.00024820332,0.000026887501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010002981,0.0007813367,0.0008275006,0.00082458544,0.0005350604,0.0012097642,0.00095594866,0.0018571492,0.0038272094],"category_scores_gemma":[0.003538947,0.00041590672,0.0007484829,0.0015028163,0.00084526476,0.0018750546,0.00090666115,0.001474687,0.0008958827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001109199,0.000077026976,0.0006513044,0.0002812024,0.00007242055,0.00016148372,0.00012301776,0.6607338,0.0033774052,0.14418635,0.007588129,0.18263686],"study_design_scores_gemma":[0.000005675847,0.000015801708,0.00006790986,0.0000059919803,0.000005705702,0.00003753036,0.0000041104904,0.9909156,0.0002414219,0.006656823,0.002037965,0.0000054297134],"about_ca_topic_score_codex":0.0017403506,"about_ca_topic_score_gemma":0.0011060644,"teacher_disagreement_score":0.0038272094,"about_ca_system_score_codex":0.0004227069,"about_ca_system_score_gemma":0.0005228865,"threshold_uncertainty_score":0.012803316},"labels":[],"label_agreement":null},{"id":"W1552126856","doi":"10.1007/978-3-540-85988-8_4","title":"A Distributed Spatio-temporal EEG/MEG Inverse Solver","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke","keywords":"Computer science; Solver; Inverse; Inverse problem; Electroencephalography; Magnetoencephalography; Algorithm; Artificial intelligence; Mathematics; Neuroscience; Geometry; Programming language; Mathematical analysis","score_opus":0.029816282820690106,"score_gpt":0.26273961539598467,"score_spread":0.23292333257529457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552126856","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.00084532774,0.000030597166,0.9972806,0.000079700825,0.00003058961,0.000023593157,0.000043805514,0.00020100825,0.001464841],"genre_scores_gemma":[0.051577345,0.00012914045,0.9387046,0.00020284757,0.000109775596,0.00016924129,0.00021164078,0.00031165304,0.008583837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999744,0.00005744211,0.000021878883,0.00005704055,0.00009862597,0.000020881675],"domain_scores_gemma":[0.9995171,0.0002275774,0.00003661009,0.00006815346,0.00011507375,0.000035566958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813598,0.0009337798,0.0009327675,0.00042023195,0.00043215603,0.001198871,0.0014999005,0.0021183216,0.014759403],"category_scores_gemma":[0.0017567405,0.0006714739,0.0010369853,0.00068349065,0.0005088458,0.0010197792,0.0021812993,0.0014878205,0.0032803426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031065586,0.00018185531,0.00054988026,0.00038476492,0.00024609588,0.0006090061,0.00022023347,0.61125153,0.028396366,0.056777135,0.009752914,0.29131955],"study_design_scores_gemma":[0.00005385759,0.000029442454,0.000060096816,0.000009895762,0.00002238589,0.00012459226,0.000024378525,0.9852246,0.002440174,0.007686617,0.004313708,0.000010145042],"about_ca_topic_score_codex":0.0032340335,"about_ca_topic_score_gemma":0.004500424,"teacher_disagreement_score":0.014759403,"about_ca_system_score_codex":0.00027866496,"about_ca_system_score_gemma":0.0013116428,"threshold_uncertainty_score":0.049375057},"labels":[],"label_agreement":null},{"id":"W1552173337","doi":"10.1007/11499107_20","title":"Constraint Metrics for Local Search","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Alberta","funders":"","keywords":"Constraint satisfaction problem; Computer science; Boolean satisfiability problem; Local search (optimization); Dual (grammatical number); Satisfiability; Constraint satisfaction; Theoretical computer science; Variety (cybernetics); Class (philosophy); Backtracking; Constraint (computer-aided design); Perspective (graphical); Algorithm; Artificial intelligence; Mathematics","score_opus":0.025583246936362998,"score_gpt":0.2690679519971328,"score_spread":0.2434847050607698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552173337","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.0031497218,0.009927652,0.9561964,0.00087132887,0.00033534016,0.000083781175,0.0005060729,0.00046451113,0.028465232],"genre_scores_gemma":[0.21206631,0.011602263,0.7231316,0.0007971746,0.001178962,0.0012247743,0.0023204172,0.0019390325,0.045739375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976255,0.0009118817,0.00014646407,0.00030820622,0.000894649,0.0001131969],"domain_scores_gemma":[0.9960601,0.0021294341,0.00028577642,0.0006114457,0.0007206264,0.00019255227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002405195,0.0017478974,0.0020183136,0.003473068,0.00085693377,0.0025491065,0.0022388168,0.0015397569,0.013828554],"category_scores_gemma":[0.013937592,0.00069333875,0.0008938454,0.00653349,0.0020620753,0.0063461126,0.0025578728,0.0037637437,0.002009621],"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.000027911028,0.000030985808,0.00019544586,0.00030479598,0.000038097136,0.000030723804,0.00010355124,0.03318279,0.000665312,0.7902099,0.022792088,0.15241839],"study_design_scores_gemma":[0.000009731926,0.00003201379,0.00021577296,0.000109793466,0.000019426476,0.000052059586,0.00003354677,0.12708008,0.0004207431,0.84807855,0.02392726,0.000020993555],"about_ca_topic_score_codex":0.0032741015,"about_ca_topic_score_gemma":0.0032628342,"teacher_disagreement_score":0.013828554,"about_ca_system_score_codex":0.0030001937,"about_ca_system_score_gemma":0.0010956727,"threshold_uncertainty_score":0.046261072},"labels":[],"label_agreement":null},{"id":"W1552211690","doi":"10.1007/11494683_31","title":"Data Partitioning Evaluation Measures for Classifier Ensembles","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Classifier (UML); Disjoint sets; Artificial intelligence; Probabilistic logic; Machine learning; Training set; Quadratic classifier; Probabilistic classification; Data mining; Support vector machine; Naive Bayes classifier; Mathematics","score_opus":0.11925411094769287,"score_gpt":0.3259983224447972,"score_spread":0.20674421149710434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552211690","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.13583343,0.010841016,0.84193254,0.0007072679,0.0005532644,0.00051653123,0.0016515399,0.0018471717,0.006117372],"genre_scores_gemma":[0.6610476,0.0015344527,0.32532507,0.00020645454,0.00058822794,0.0006587978,0.0067137647,0.0006624798,0.0032630484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98328066,0.0065261605,0.0013920729,0.0014832777,0.0067415987,0.00057632034],"domain_scores_gemma":[0.94910395,0.03269107,0.001665112,0.004933258,0.010542255,0.0010643412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02192348,0.0018715293,0.003075877,0.0059566456,0.001097502,0.0031204948,0.0023328287,0.0019366643,0.0019119395],"category_scores_gemma":[0.054440174,0.00044856526,0.0015464622,0.003469965,0.00084869313,0.0037733784,0.0020704158,0.0021647473,0.0006900135],"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.0017152622,0.00057608256,0.016912522,0.0006124699,0.001114491,0.00006401088,0.00023357756,0.17086756,0.005845193,0.013479929,0.0153747555,0.77320415],"study_design_scores_gemma":[0.00007632282,0.001042048,0.01169135,0.00017535701,0.00041743895,0.00028055717,0.00016237542,0.9516193,0.007894356,0.023374315,0.0031858003,0.000080732214],"about_ca_topic_score_codex":0.0016094773,"about_ca_topic_score_gemma":0.0017956867,"teacher_disagreement_score":0.02192348,"about_ca_system_score_codex":0.0021513577,"about_ca_system_score_gemma":0.0010660132,"threshold_uncertainty_score":0.11594385},"labels":[],"label_agreement":null},{"id":"W1552237596","doi":"10.1007/978-3-642-01818-3_14","title":"Control of Constraint Weights for a 2D Autonomous Camera","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Computer science; Constraint (computer-aided design); Computer vision; Rotation (mathematics); Coherence (philosophical gambling strategy); Frame (networking); Domain (mathematical analysis); Solver; Orientation (vector space); Artificial intelligence; Representation (politics); Position (finance); Algorithm; Mathematics","score_opus":0.01184999862121359,"score_gpt":0.25800407406831277,"score_spread":0.2461540754470992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552237596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017862692,0.00009729762,0.9785943,0.0000790512,0.000051350096,0.00004251936,0.000039101247,0.0002268401,0.0030068231],"genre_scores_gemma":[0.73477864,0.00018605602,0.25780305,0.00011925221,0.00005302788,0.00032032665,0.0000972937,0.00018922005,0.006453074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999749,0.000037925347,0.000009747114,0.000074932876,0.00009121204,0.000037164147],"domain_scores_gemma":[0.99971646,0.000100197256,0.000055920274,0.000025549825,0.000073045376,0.000028784223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045139564,0.0009283322,0.0006959341,0.00042238506,0.00043585442,0.0009223436,0.0009714415,0.00086229347,0.003437521],"category_scores_gemma":[0.0013419617,0.0006790626,0.0003478661,0.0005944621,0.0005181491,0.00091070053,0.0014388743,0.00086135685,0.0004300962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028014035,0.00010364946,0.00034086136,0.00018261792,0.000048172064,0.00012952132,0.00019779499,0.77907556,0.057783414,0.019864457,0.0030016203,0.13899219],"study_design_scores_gemma":[0.000028178049,0.000054403517,0.00017898327,0.000006639579,0.0000055112123,0.000019571822,0.000008866075,0.9935347,0.0023016047,0.002925526,0.0009238451,0.000012165025],"about_ca_topic_score_codex":0.0066765575,"about_ca_topic_score_gemma":0.009071542,"teacher_disagreement_score":0.0066765575,"about_ca_system_score_codex":0.00060052925,"about_ca_system_score_gemma":0.0007234384,"threshold_uncertainty_score":0.013275385},"labels":[],"label_agreement":null},{"id":"W1552241428","doi":"10.1007/11839569_12","title":"Interference-Aware Selfish Routing in Multi-ratio Multi-channel Wireless Mesh Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Wireless mesh network; Computer network; Embarrassment; Game theory; Routing (electronic design automation); Wireless network; Channel (broadcasting); Wireless; Transmission (telecommunications); Interference (communication); Potential game; Distributed computing; Mathematical optimization; Telecommunications; Mathematical economics; Mathematics","score_opus":0.02337255677623723,"score_gpt":0.2456993827548776,"score_spread":0.22232682597864037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552241428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03123741,0.0025762152,0.9590296,0.0002249177,0.00015980219,0.00003084782,0.000026381056,0.000431069,0.006283677],"genre_scores_gemma":[0.8834817,0.0016580619,0.10955961,0.00011155958,0.00021080674,0.00005192427,0.00005274875,0.000119764154,0.0047538304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995782,0.00014855835,0.000018197157,0.00005579669,0.00015227855,0.000046973557],"domain_scores_gemma":[0.9991208,0.00056387874,0.00007205542,0.00009901057,0.000116166804,0.000028162736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070215506,0.00039192033,0.00061988446,0.00044014346,0.0003366301,0.00063333695,0.0014261554,0.00046152493,0.000999896],"category_scores_gemma":[0.0017198282,0.000288448,0.00032839918,0.00055673934,0.00046706016,0.0010157126,0.0008279565,0.0005643823,0.00023341899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029471793,0.00012910918,0.00091152504,0.00037388457,0.00012141323,0.00033599476,0.0003318859,0.60197365,0.050663635,0.085341215,0.0057149027,0.2538081],"study_design_scores_gemma":[0.0000108604445,0.000083212566,0.00020113596,0.000011800139,0.000023211147,0.0002793636,0.00003251344,0.97559637,0.004166722,0.01725733,0.0023214135,0.000016040245],"about_ca_topic_score_codex":0.00023442577,"about_ca_topic_score_gemma":0.00040014315,"teacher_disagreement_score":0.0014261554,"about_ca_system_score_codex":0.00037037072,"about_ca_system_score_gemma":0.00015959919,"threshold_uncertainty_score":0.003713429},"labels":[],"label_agreement":null},{"id":"W1552333418","doi":"10.1007/978-3-540-30564-4_19","title":"Password Based Key Exchange with Mutual Authentication","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Random oracle; Password; Oracle; Dictionary attack; Mutual authentication; Protocol (science); Authenticated Key Exchange; Key exchange; Computer security; Key (lock); Provable security; Computer network; Theoretical computer science; Cryptography; Encryption; Public-key cryptography","score_opus":0.01595933749593907,"score_gpt":0.25497492002654426,"score_spread":0.23901558253060518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552333418","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.0071708704,0.0006838154,0.9598442,0.00025085887,0.00028904533,0.00033796436,0.00015348944,0.0021259002,0.029143851],"genre_scores_gemma":[0.3954601,0.0012603117,0.48468074,0.0003715428,0.00028843622,0.0011520999,0.0009107736,0.0005667558,0.115309246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756503,0.000934552,0.00017080708,0.00026574903,0.00078879,0.00027512512],"domain_scores_gemma":[0.99831283,0.00055577606,0.00009244098,0.0007953669,0.00018752525,0.000056009343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015912334,0.0009048626,0.0011195397,0.00079548656,0.0011680401,0.0021248064,0.0018250464,0.0020195616,0.022747207],"category_scores_gemma":[0.0038747045,0.0006426779,0.0005440968,0.0014156097,0.0011371212,0.0058287536,0.0052694506,0.0017455776,0.014097274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011988796,0.00026054188,0.00037368643,0.0006807461,0.00006688286,0.00061631773,0.0004957767,0.009259836,0.029167205,0.4253516,0.03500303,0.49752548],"study_design_scores_gemma":[0.00032852325,0.00085286755,0.0005752525,0.0002498053,0.0001378981,0.004113163,0.0002349552,0.21679951,0.104375176,0.5082044,0.16396083,0.00016764419],"about_ca_topic_score_codex":0.00009486142,"about_ca_topic_score_gemma":0.00015081727,"teacher_disagreement_score":0.022747207,"about_ca_system_score_codex":0.00036072018,"about_ca_system_score_gemma":0.0004974799,"threshold_uncertainty_score":0.07609701},"labels":[],"label_agreement":null},{"id":"W1552511991","doi":"10.1007/978-3-540-30205-6_7","title":"Crosstalk Cancellation for Realistic PCB Buses","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","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":"University of British Columbia","funders":"","keywords":"Computer science; Crosstalk; Bandwidth (computing); Electronic engineering; Linear programming; Algorithm; Telecommunications; Engineering","score_opus":0.017302427688834044,"score_gpt":0.24195073129676462,"score_spread":0.22464830360793056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552511991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028723732,0.0008292872,0.8629723,0.00028823514,0.00030903364,0.00006001424,0.000119610435,0.0015567215,0.105141014],"genre_scores_gemma":[0.6788942,0.0015136991,0.23302867,0.0002997999,0.00021884247,0.00008531773,0.0004432547,0.0007080023,0.08480817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973947,0.00005216322,0.000008703758,0.000034838446,0.00012599428,0.00003890255],"domain_scores_gemma":[0.99955064,0.00020235464,0.000043515556,0.00008743929,0.000098774515,0.000017266295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030216743,0.000772076,0.00033987904,0.00044511893,0.00042274964,0.0007966088,0.00072376966,0.00057662796,0.010706023],"category_scores_gemma":[0.0015222273,0.00034683524,0.0003733117,0.00052776205,0.00036511474,0.00088360556,0.00037652784,0.000721503,0.0020863425],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005328174,0.00018474238,0.0005971041,0.00091428956,0.000076645796,0.000733742,0.0002721461,0.31081328,0.18881185,0.2627717,0.022559796,0.21173188],"study_design_scores_gemma":[0.00006132712,0.00036541896,0.00057788164,0.00013411192,0.000084112835,0.0013402913,0.00008978116,0.79953015,0.07343074,0.08374905,0.0405825,0.00005462772],"about_ca_topic_score_codex":0.0005833702,"about_ca_topic_score_gemma":0.0013398661,"teacher_disagreement_score":0.010706023,"about_ca_system_score_codex":0.0006209388,"about_ca_system_score_gemma":0.0003555435,"threshold_uncertainty_score":0.03581524},"labels":[],"label_agreement":null},{"id":"W1552557113","doi":"10.1007/978-3-642-13681-8_58","title":"Performance Evaluation of Multiresolution Methods in Disparity Estimation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Computer science; Multiresolution analysis; Estimation; Matching (statistics); Artificial intelligence; Data mining; Mathematics; Statistics; Wavelet; Wavelet transform","score_opus":0.043569607732794696,"score_gpt":0.3765136514016254,"score_spread":0.3329440436688307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552557113","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.45781672,0.011543711,0.5199151,0.0003294194,0.00034068697,0.00018095352,0.00089115516,0.0029469507,0.006035349],"genre_scores_gemma":[0.7105496,0.0024909377,0.2821715,0.00008674367,0.0001129548,0.00007246999,0.001463918,0.00034493633,0.0027069987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779034,0.0006062264,0.00012015622,0.00026799832,0.0010299147,0.00018538824],"domain_scores_gemma":[0.99387884,0.0039227963,0.0003143155,0.0005324958,0.0012026402,0.00014881702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026678792,0.000997026,0.0011498508,0.0019952576,0.0003755805,0.0012588636,0.0010242708,0.001391513,0.003150918],"category_scores_gemma":[0.01120954,0.00039745172,0.0005995896,0.0018876331,0.0002805181,0.0012058606,0.0012919914,0.000551718,0.0007814628],"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.004537935,0.00047641122,0.0045377766,0.0007925817,0.0004705574,0.00014759686,0.00011611303,0.14655456,0.06633665,0.0020987678,0.002745765,0.7711853],"study_design_scores_gemma":[0.000076204255,0.0005585148,0.004992146,0.000044008393,0.00015057207,0.00032589983,0.00005042932,0.9586823,0.033491593,0.0006255329,0.0009650165,0.000037869],"about_ca_topic_score_codex":0.0042400546,"about_ca_topic_score_gemma":0.0027956166,"teacher_disagreement_score":0.0042400546,"about_ca_system_score_codex":0.00053890067,"about_ca_system_score_gemma":0.0006526529,"threshold_uncertainty_score":0.014109254},"labels":[],"label_agreement":null},{"id":"W1552577690","doi":"10.1007/978-3-642-21311-3_1","title":"Preference Elicitation and Preference Learning in Social Choice","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Preference; Computer science; Realm; Preference elicitation; Social choice theory; Preference learning; Subject (documents); Social preferences; Usability; Artificial intelligence; Data science; Human–computer interaction; World Wide Web; Psychology; Social psychology; Mathematical economics; Statistics; Mathematics","score_opus":0.08839179875528548,"score_gpt":0.24018333532145186,"score_spread":0.1517915365661664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552577690","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.027745109,0.00080442964,0.9551852,0.0017823809,0.000059418955,0.00010306513,0.00017430176,0.00007266151,0.014073449],"genre_scores_gemma":[0.7087545,0.0017477991,0.2757376,0.00044587918,0.00026292965,0.0005772502,0.00056941726,0.000086036736,0.0118186865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98723096,0.010296701,0.00042822433,0.00068825955,0.0010403679,0.0003154842],"domain_scores_gemma":[0.93479633,0.059034698,0.0012134511,0.0030582245,0.0014116408,0.00048568627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011680535,0.0007900511,0.0016243405,0.00083764334,0.0009030552,0.0031297586,0.0018889488,0.0017800998,0.007591289],"category_scores_gemma":[0.04452446,0.0008442562,0.0013707659,0.0023379137,0.0037373372,0.007910228,0.0022997218,0.0036704943,0.0007221238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014559984,0.000106966145,0.00070716656,0.00023571959,0.00006951365,0.000048432732,0.00062168937,0.021829272,0.0004914838,0.8998645,0.0023920161,0.07348778],"study_design_scores_gemma":[0.000017238124,0.00001744169,0.000116669304,0.00001651579,0.000007970399,0.000016602138,0.000053916865,0.051237084,0.00020980278,0.9472747,0.0010217426,0.000010326214],"about_ca_topic_score_codex":0.0019155272,"about_ca_topic_score_gemma":0.0017173977,"teacher_disagreement_score":0.011680535,"about_ca_system_score_codex":0.002056152,"about_ca_system_score_gemma":0.0013057379,"threshold_uncertainty_score":0.0617733},"labels":[],"label_agreement":null},{"id":"W1552659580","doi":"10.1007/11943952_5","title":"Skipping Face Routing with Guaranteed Message Delivery for Wireless Ad Hoc and Sensor Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Antenna Design and Analysis","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":"University of Waterloo","funders":"","keywords":"Computer science; Dynamic Source Routing; Static routing; Computer network; Link-state routing protocol; Policy-based routing; Multipath routing; Geographic routing; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Distributed computing; Equal-cost multi-path routing; Routing (electronic design automation); Routing protocol","score_opus":0.0080910454632063,"score_gpt":0.19096743569917496,"score_spread":0.18287639023596866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552659580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012144229,0.0009961248,0.97999865,0.0001788843,0.00024917757,0.00005342584,0.000044177214,0.0011142937,0.005221069],"genre_scores_gemma":[0.39765352,0.0013948823,0.57700765,0.00024873402,0.00033974316,0.00021626696,0.00023745414,0.00039247697,0.022509253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995504,0.000108583576,0.000019795218,0.000061433915,0.00019262628,0.00006711238],"domain_scores_gemma":[0.99945194,0.00027346183,0.000033945627,0.0001283751,0.00008726239,0.000025059482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991023,0.00075731747,0.00080731354,0.00057701004,0.0005868504,0.00072777603,0.001889607,0.00086167577,0.0036091218],"category_scores_gemma":[0.0018355541,0.0003472415,0.00048014958,0.0006372201,0.00049006473,0.0014955876,0.0013471107,0.0010781043,0.00084565673],"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.0004935228,0.00011224366,0.00035512415,0.0003859648,0.00006827884,0.00033759064,0.00024196864,0.14846724,0.02885374,0.09902634,0.020335265,0.70132273],"study_design_scores_gemma":[0.000036072863,0.000285486,0.00022183328,0.00003617887,0.000041463736,0.00044193878,0.000052948533,0.895804,0.009568517,0.07993555,0.013544926,0.000031123753],"about_ca_topic_score_codex":0.000742023,"about_ca_topic_score_gemma":0.001438167,"teacher_disagreement_score":0.0036091218,"about_ca_system_score_codex":0.00048555786,"about_ca_system_score_gemma":0.00054087676,"threshold_uncertainty_score":0.012073696},"labels":[],"label_agreement":null},{"id":"W1552717418","doi":"10.1007/978-3-540-73331-7_38","title":"Cognitive, Perceptual, Sensory and Verbal Abilities as Predictors of PDA Text Entry Error and Instructions Across the Lifespan","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ergonomics and Musculoskeletal Disorders","field":"Psychology","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 British Columbia","funders":"","keywords":"Perception; Computer science; Text entry; Cognition; Sensory system; Episodic memory; Audiology; Speech recognition; Cognitive psychology; Psychology; Human–computer interaction; Medicine","score_opus":0.02271921146352911,"score_gpt":0.3080101463485952,"score_spread":0.28529093488506607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552717418","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.99786144,0.00087779056,0.000076143486,0.0000759072,0.000011294159,0.000004556956,0.00043598464,0.000007742651,0.0006491241],"genre_scores_gemma":[0.99798656,0.0004917539,0.00014652041,0.000023076245,0.0000112028,0.000009865095,0.00048694963,0.0000063918988,0.00083766785],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99958545,0.00006506237,0.00005812569,0.0001394186,0.00008284103,0.00006915999],"domain_scores_gemma":[0.99121034,0.0033648557,0.0030682404,0.000475287,0.00080496754,0.0010763749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011688826,0.0003828968,0.00035043174,0.0010991661,0.000398037,0.0010377833,0.00063286937,0.0010007727,0.0025788292],"category_scores_gemma":[0.0102118105,0.00041049113,0.00063525117,0.0009841252,0.00046713452,0.0011297372,0.00091615174,0.001302292,0.000556328],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015869833,0.00009706558,0.99431914,0.000014291664,0.0000785225,0.00015089285,0.00036802067,0.00011472362,0.00026054052,0.000028617927,0.00014499451,0.004264576],"study_design_scores_gemma":[0.0000018641127,0.000087495704,0.99936885,0.000008735501,0.000021838347,0.00012481069,0.00013325163,0.000093409915,0.000045613186,0.000043122564,0.00006665622,0.0000042182783],"about_ca_topic_score_codex":0.012146495,"about_ca_topic_score_gemma":0.009924628,"teacher_disagreement_score":0.012146495,"about_ca_system_score_codex":0.00029184768,"about_ca_system_score_gemma":0.00048989983,"threshold_uncertainty_score":0.024151623},"labels":[],"label_agreement":null},{"id":"W1552846432","doi":"10.1007/3-540-36970-8_24","title":"A New MOEA for Multi-objective TSP and Its Convergence Property Analysis","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":30,"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":"Crossover; Mathematical optimization; Selection (genetic algorithm); Convergence (economics); Evolutionary algorithm; Computer science; Property (philosophy); Operator (biology); Markov chain; Multi-objective optimization; Population; Tournament selection; Mutation; Mathematics; Artificial intelligence; Machine learning","score_opus":0.028218236087315086,"score_gpt":0.28008080356214216,"score_spread":0.25186256747482705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552846432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082497075,0.0011337367,0.98193604,0.0001108505,0.00020005126,0.000051429615,0.000036857236,0.00032207675,0.007959258],"genre_scores_gemma":[0.14510734,0.0018565516,0.83023846,0.00018722739,0.0002457453,0.00031493485,0.00020067344,0.00040877122,0.021440353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956185,0.00008179561,0.00002179822,0.000063953026,0.00023760392,0.00003299409],"domain_scores_gemma":[0.99949837,0.00019055801,0.000035429184,0.00006128116,0.00019059291,0.00002379701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867458,0.00082490686,0.0008578639,0.0011685621,0.0005979204,0.000818047,0.0009242896,0.00083493715,0.0031755012],"category_scores_gemma":[0.0018308357,0.0003586431,0.0010541315,0.0014821212,0.00066777447,0.0011790813,0.00086480845,0.0014293398,0.0006288379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016820162,0.0001389528,0.00072375813,0.0004781049,0.00021765113,0.00015083665,0.00015030909,0.43032897,0.022110684,0.11308935,0.0068379613,0.42560527],"study_design_scores_gemma":[0.000024585397,0.00014416593,0.0004763729,0.000030794734,0.00005798519,0.00023034768,0.000019432371,0.9548472,0.003422592,0.02822281,0.012500411,0.000023322225],"about_ca_topic_score_codex":0.0014184214,"about_ca_topic_score_gemma":0.0016078049,"teacher_disagreement_score":0.0031755012,"about_ca_system_score_codex":0.0006048722,"about_ca_system_score_gemma":0.00062351336,"threshold_uncertainty_score":0.010623097},"labels":[],"label_agreement":null},{"id":"W1552859027","doi":"10.1007/978-3-540-72031-7_2","title":"Significance Analysis of Time-Course Gene Expression Profiles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan","funders":"","keywords":"Pairwise comparison; Autoregressive model; Statistics; Gaussian; Expression (computer science); Gene; Gene expression; Mathematics; Computer science; Biology; Genetics","score_opus":0.01583761840119808,"score_gpt":0.2740763460377109,"score_spread":0.25823872763651284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552859027","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.4689984,0.0020621861,0.5214258,0.0002730731,0.0001355427,0.00009082662,0.0018170903,0.002155929,0.0030411666],"genre_scores_gemma":[0.920892,0.00041267197,0.07295064,0.000057680012,0.00009342847,0.000079799516,0.0031172286,0.00022439101,0.0021721942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922335,0.00018336003,0.000047623624,0.00024149017,0.00019400433,0.00011008806],"domain_scores_gemma":[0.99767596,0.0015506622,0.0001952116,0.00024243971,0.000241828,0.00009400503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015225977,0.00030138227,0.0006024354,0.0016657622,0.0004211965,0.0008567823,0.0007602626,0.0003568451,0.002572052],"category_scores_gemma":[0.003238482,0.00020600819,0.0011543016,0.0018502489,0.00042124672,0.00056219095,0.0005343828,0.00074748066,0.0005370703],"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.0013123578,0.00025710676,0.06553806,0.0006048079,0.00073239265,0.0005445307,0.0003178313,0.014075185,0.31679612,0.0077698813,0.002450067,0.58960164],"study_design_scores_gemma":[0.0001224615,0.0013368555,0.5488017,0.00007375319,0.0011313881,0.0027262515,0.0007217023,0.24527071,0.13935731,0.046921767,0.013375527,0.00016052175],"about_ca_topic_score_codex":0.0008610221,"about_ca_topic_score_gemma":0.0010356851,"teacher_disagreement_score":0.002572052,"about_ca_system_score_codex":0.00031537766,"about_ca_system_score_gemma":0.0005245061,"threshold_uncertainty_score":0.008604407},"labels":[],"label_agreement":null},{"id":"W1552864862","doi":"10.1007/978-3-642-02611-9_88","title":"Detection of Linear Structures in Remote-Sensed Images","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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 Alberta","funders":"","keywords":"Computer science; Hough transform; Artificial intelligence; Computer vision; Markov random field; Orientation (vector space); Field (mathematics); Line (geometry); Change detection; Interpretation (philosophy); Object detection; Markov chain; Pipeline transport; Pattern recognition (psychology); Remote sensing; Image (mathematics); Image segmentation; Machine learning; Geography; Mathematics","score_opus":0.009971180986957168,"score_gpt":0.24530494018554916,"score_spread":0.23533375919859198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552864862","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.08767478,0.0016382759,0.9024809,0.00019325971,0.00005872744,0.0000758375,0.00021486073,0.002088553,0.0055748015],"genre_scores_gemma":[0.32894862,0.0022669747,0.6562391,0.00015127944,0.00011008155,0.00006686297,0.0008235231,0.00021777405,0.011175746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979216,0.000016824475,0.0000066098246,0.000047065147,0.00011574685,0.0000217148],"domain_scores_gemma":[0.99971455,0.00013886478,0.000036191308,0.00003976456,0.00005397325,0.000016615033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019520675,0.00054903654,0.00043672055,0.0009447982,0.00014385121,0.0006367909,0.00083316205,0.0007500862,0.0025138836],"category_scores_gemma":[0.0007128807,0.00043456236,0.0003652596,0.00060913624,0.0003717182,0.0007347931,0.0005382695,0.0004074197,0.0019367482],"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.00013000895,0.0000826548,0.0012512717,0.0003135893,0.00004394413,0.00019391203,0.00010386492,0.009066456,0.42233616,0.0022310966,0.0019442608,0.5623028],"study_design_scores_gemma":[0.000039078015,0.00026464628,0.017586892,0.00009016012,0.00013055181,0.0019876878,0.00014076494,0.45359257,0.50766325,0.0064191073,0.012033798,0.00005153794],"about_ca_topic_score_codex":0.00047360413,"about_ca_topic_score_gemma":0.0009130043,"teacher_disagreement_score":0.0025138836,"about_ca_system_score_codex":0.00016949962,"about_ca_system_score_gemma":0.000189862,"threshold_uncertainty_score":0.008409798},"labels":[],"label_agreement":null},{"id":"W1552977268","doi":"10.1007/11916277_31","title":"Constructing Camin-Sokal Phylogenies Via Answer Set Programming","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Computer science; Set (abstract data type); Phylogenetic tree; Phylogenetics; Binary number; Theoretical computer science; Cladistics; Programming language; Biology; Mathematics","score_opus":0.014646635969426846,"score_gpt":0.23403365947712865,"score_spread":0.2193870235077018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552977268","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.0127215125,0.00018315813,0.98021334,0.00053584215,0.00006904281,0.00006663266,0.0005093673,0.002056544,0.0036445323],"genre_scores_gemma":[0.13378932,0.000249137,0.85978436,0.0003792511,0.00010382684,0.00023082116,0.0021676065,0.0009307418,0.002364867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976241,0.0008345403,0.00017216791,0.00061852176,0.0005225119,0.00022810938],"domain_scores_gemma":[0.99057287,0.0074385083,0.00031701557,0.0010196388,0.00045628284,0.00019566502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047407993,0.0012563624,0.0019730427,0.0042413375,0.0022214623,0.0036296938,0.0041516614,0.002313392,0.010253856],"category_scores_gemma":[0.0207536,0.001439315,0.003980022,0.0029369884,0.0032098484,0.0076770475,0.00526227,0.0051074014,0.0020708474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035035046,0.00020507853,0.0035052057,0.00069906464,0.00028062018,0.00029199896,0.0010920839,0.125671,0.0036143905,0.6111084,0.011666052,0.24151577],"study_design_scores_gemma":[0.000057348258,0.000026118665,0.00024316557,0.00006888863,0.00007686452,0.000060374707,0.000109083485,0.15848118,0.0017310632,0.8342135,0.0049072993,0.00002511168],"about_ca_topic_score_codex":0.0014236605,"about_ca_topic_score_gemma":0.0038450947,"teacher_disagreement_score":0.010253856,"about_ca_system_score_codex":0.001622689,"about_ca_system_score_gemma":0.0013256996,"threshold_uncertainty_score":0.034302533},"labels":[],"label_agreement":null},{"id":"W1552977961","doi":"10.1007/978-3-642-13437-1_32","title":"Using Expert Models to Provide Feedback on Clinical Reasoning Skills","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical Reasoning and Diagnostic Skills","field":"Medicine","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":"McGill University","funders":"","keywords":"Computer science; Process (computing); Outcome (game theory); Expert system; Model-based reasoning; Artificial intelligence; Management science; Data science; Knowledge representation and reasoning","score_opus":0.08075114636588483,"score_gpt":0.3851151452991617,"score_spread":0.30436399893327687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552977961","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.08148721,0.0005680936,0.8589268,0.002026548,0.00032706294,0.0003472905,0.0018553046,0.011240265,0.043221343],"genre_scores_gemma":[0.674385,0.00045953126,0.3095333,0.0004605289,0.00006759566,0.00030634832,0.0023494512,0.00047468478,0.011963423],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983847,0.0006982282,0.00008488368,0.00019474851,0.0005746506,0.00006287899],"domain_scores_gemma":[0.9816356,0.01480609,0.0003884697,0.00093454024,0.0020329417,0.0002022614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029646491,0.00095976656,0.00044793627,0.00085308467,0.00017160541,0.0016284923,0.0010646076,0.0012524531,0.010745011],"category_scores_gemma":[0.028267762,0.00039572772,0.0005044747,0.00046542467,0.00018928105,0.0020949985,0.00075867836,0.0011601477,0.0028716812],"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.0014119804,0.00085800356,0.0073871794,0.00037839563,0.00013708569,0.00029187853,0.0009520379,0.14950077,0.00867898,0.0077704107,0.037108053,0.78552514],"study_design_scores_gemma":[0.00013018309,0.00026624423,0.0023907635,0.00018385198,0.00010732114,0.0001858011,0.00024171174,0.9532715,0.01252803,0.019831162,0.010805735,0.00005773166],"about_ca_topic_score_codex":0.0036543715,"about_ca_topic_score_gemma":0.0043135574,"teacher_disagreement_score":0.010745011,"about_ca_system_score_codex":0.00071707513,"about_ca_system_score_gemma":0.0007099007,"threshold_uncertainty_score":0.035945654},"labels":[],"label_agreement":null},{"id":"W1553045544","doi":"10.1007/978-3-540-72792-7_24","title":"DINS, a MIP Improvement Heuristic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":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":"Solver; Heuristics; Computer science; Benchmark (surveying); Mathematical optimization; Neighbourhood (mathematics); Heuristic; Integer programming; Search tree; Algorithm; Mathematics; Search algorithm","score_opus":0.02662322317191979,"score_gpt":0.27321937636394344,"score_spread":0.24659615319202366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553045544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013133169,0.0019781555,0.8598537,0.0010576767,0.0017509832,0.00038392478,0.000901914,0.0055104517,0.11543001],"genre_scores_gemma":[0.11553183,0.0009892342,0.8409887,0.0009074217,0.00026498295,0.00034443586,0.0015987233,0.0010352893,0.038339406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927825,0.0001645146,0.0000316494,0.000101135614,0.00029411,0.00013036847],"domain_scores_gemma":[0.999373,0.00023564155,0.000043611177,0.00012611577,0.00015417492,0.00006744821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009261995,0.0015554775,0.0012603838,0.0018076453,0.000877116,0.0013308066,0.0023472938,0.0012437968,0.024788594],"category_scores_gemma":[0.0029140676,0.0006907004,0.0012459329,0.002023108,0.0006579038,0.0015550841,0.0019326297,0.002769202,0.0033100983],"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.00047399223,0.00039188992,0.00042559096,0.0005895498,0.00009941383,0.00013288192,0.00007396317,0.25607175,0.0042857844,0.07279319,0.061085913,0.6035761],"study_design_scores_gemma":[0.00020016437,0.00025732737,0.00036222313,0.00015032664,0.00010739223,0.00019281164,0.00007876459,0.8787564,0.0046169204,0.042626966,0.07261273,0.00003791158],"about_ca_topic_score_codex":0.0032407485,"about_ca_topic_score_gemma":0.007527886,"teacher_disagreement_score":0.024788594,"about_ca_system_score_codex":0.0012698622,"about_ca_system_score_gemma":0.0020393624,"threshold_uncertainty_score":0.082926095},"labels":[],"label_agreement":null},{"id":"W1553119936","doi":"10.1007/3-540-47789-6_17","title":"Improvement of Digital Terrain Model Interpolation Using SFS Techniques with Single Satellite Imagery","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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 Calgary","funders":"","keywords":"Computer science; Remote sensing; Terrain; Photogrammetry; Digital elevation model; Satellite; Computer vision; Artificial intelligence; Interpolation (computer graphics); Grid; Computer graphics (images); Geology; Geography; Image (mathematics); Geodesy; Cartography","score_opus":0.016235922009683636,"score_gpt":0.22446875756691329,"score_spread":0.20823283555722966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553119936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12230645,0.00026150487,0.8701901,0.00008165624,0.000111524016,0.000047480138,0.00039955735,0.0031431487,0.0034584925],"genre_scores_gemma":[0.3403797,0.00019497279,0.6556001,0.000022286229,0.000031536347,0.000028759281,0.0009618878,0.00027815538,0.0025026586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997553,0.000036852318,0.0000135272085,0.000037696933,0.00013574268,0.000020802723],"domain_scores_gemma":[0.99929607,0.00016313703,0.00003491491,0.00020400125,0.00028375947,0.000018120598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039622924,0.00052064355,0.00051062624,0.001280476,0.00028406017,0.00043423273,0.0005973627,0.00034759394,0.0038935093],"category_scores_gemma":[0.0016841472,0.00033946568,0.0006423564,0.0016446366,0.0001600158,0.0008068801,0.00054011506,0.00041437044,0.0010691962],"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.0003725967,0.00013558632,0.0035701937,0.0001582452,0.000070845104,0.00007939724,0.00013591269,0.09114634,0.048910473,0.001836214,0.002646324,0.8509379],"study_design_scores_gemma":[0.0000359354,0.00007603579,0.003983373,0.000011185456,0.000045378452,0.00012830201,0.000040161656,0.96906495,0.021384295,0.001026741,0.0041885143,0.000015196341],"about_ca_topic_score_codex":0.006884736,"about_ca_topic_score_gemma":0.009919288,"teacher_disagreement_score":0.006884736,"about_ca_system_score_codex":0.00022899415,"about_ca_system_score_gemma":0.00044918226,"threshold_uncertainty_score":0.01368928},"labels":[],"label_agreement":null},{"id":"W1553144061","doi":"10.1007/11753681_12","title":"Hairpin Structures in DNA Words","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Computer science; DNA; Algebraic structure; Algorithm; Algebraic properties; Discrete mathematics; Mathematics; Biology; Genetics; Pure mathematics","score_opus":0.011269634811849989,"score_gpt":0.2392232831598932,"score_spread":0.22795364834804321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553144061","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16220711,0.0095744375,0.2670743,0.0029855499,0.0024351063,0.00019611699,0.000583006,0.0011001024,0.5538444],"genre_scores_gemma":[0.7962689,0.0031586597,0.06568372,0.000850102,0.0010100013,0.00023250584,0.0007508874,0.00045781347,0.13158748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997658,0.00006565652,0.000013846042,0.000047379683,0.000070193455,0.000037082315],"domain_scores_gemma":[0.99964166,0.0001652983,0.000040229017,0.00005208763,0.00006335453,0.00003724147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018628704,0.00035511923,0.0004026777,0.0009705737,0.001119101,0.0018667103,0.0004938841,0.0008418362,0.012137852],"category_scores_gemma":[0.0011921613,0.00034580877,0.00031483962,0.0012236072,0.0014055403,0.0026763245,0.00082684006,0.0010790516,0.0028768524],"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.000014782629,0.000008297128,0.00004209725,0.000031299,0.0000016207438,0.00005405946,0.00024418905,0.0005346892,0.001401161,0.9834484,0.0022834488,0.011936015],"study_design_scores_gemma":[0.0000060220596,0.000024743644,0.000081317026,0.000025998443,0.000003229684,0.00011476785,0.000152461,0.002610732,0.0015729765,0.9650581,0.03034149,0.000008088248],"about_ca_topic_score_codex":0.00024523545,"about_ca_topic_score_gemma":0.00035171327,"teacher_disagreement_score":0.012137852,"about_ca_system_score_codex":0.00054321927,"about_ca_system_score_gemma":0.00029227344,"threshold_uncertainty_score":0.040605187},"labels":[],"label_agreement":null},{"id":"W1553279924","doi":"10.1007/978-3-540-46464-8_33","title":"Deriving Software Performance Models from Architectural Patterns by Graph Transformations","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Graph rewriting; Programming language; Formalism (music); Theoretical computer science; Graph; Software architecture; Model transformation; Queueing theory; Software system; Software; Distributed computing; Artificial intelligence","score_opus":0.01094358476890152,"score_gpt":0.20870266763625775,"score_spread":0.19775908286735622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553279924","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.011787438,0.000070482594,0.98133254,0.00011499293,0.00002057255,0.000113565024,0.00048477427,0.003582352,0.0024932204],"genre_scores_gemma":[0.28559053,0.0006091158,0.7051133,0.000098385695,0.00004230822,0.00039057224,0.0029591639,0.0024329966,0.0027636024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899083,0.0002542584,0.00008797097,0.00019191552,0.00038601283,0.00008903205],"domain_scores_gemma":[0.9971731,0.0015043821,0.00027634445,0.0006732294,0.0003265911,0.00004631362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070740934,0.0016402754,0.0006908499,0.0024016977,0.00046848212,0.0015175171,0.0016026717,0.0011430542,0.00264],"category_scores_gemma":[0.005674876,0.0014478404,0.0025308453,0.0017537852,0.0008741232,0.002757237,0.0011643021,0.002138362,0.0017035656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012341999,0.00023064994,0.0029870474,0.00053680217,0.00017149719,0.0005813907,0.0005722693,0.63599074,0.014241354,0.12746526,0.005303727,0.21179588],"study_design_scores_gemma":[0.000028264092,0.000031311465,0.00032756652,0.0000479317,0.000095685515,0.00010904414,0.00006215311,0.856224,0.010159797,0.12608054,0.006810159,0.000023506935],"about_ca_topic_score_codex":0.0040053767,"about_ca_topic_score_gemma":0.005891373,"teacher_disagreement_score":0.0040053767,"about_ca_system_score_codex":0.0007659843,"about_ca_system_score_gemma":0.001012357,"threshold_uncertainty_score":0.008831739},"labels":[],"label_agreement":null},{"id":"W1553282839","doi":"10.1007/978-3-540-39867-7_51","title":"Experimental Results of 802.11a Wireless LAN System over Optical Fiber","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Photonic Communication Systems","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":"Communications Research Centre Canada","funders":"","keywords":"Broadband; Computer science; Wireless broadband; Optical wireless; Merge (version control); Wireless; Fixed wireless; Broadband networks; Optical fiber; Optical cross-connect; Passive optical network; Telecommunications; Computer network; Wi-Fi array; Radio over fiber; Electronic engineering; Wireless network; Engineering; Wavelength-division multiplexing; Optoelectronics; Physics","score_opus":0.014505242397081997,"score_gpt":0.24720922335148515,"score_spread":0.23270398095440314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553282839","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.9873891,0.00034620173,0.006773119,0.00012818624,0.00010017804,0.000046793542,0.00035948836,0.00053495483,0.0043219295],"genre_scores_gemma":[0.9970595,0.00014926537,0.0011109575,0.000018516494,0.000024665467,0.0000173058,0.00018753899,0.00003307344,0.001399046],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991679,0.00025267337,0.000060643517,0.000103033235,0.000235948,0.00017985223],"domain_scores_gemma":[0.9979735,0.00091588043,0.00013296612,0.00018837441,0.0006863364,0.0001028559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008758657,0.00052528887,0.00040503422,0.00054091745,0.0007290064,0.00042673637,0.00067661685,0.00055587135,0.004658715],"category_scores_gemma":[0.0013118052,0.00020543896,0.00023181678,0.0004376933,0.00045207748,0.00090374984,0.00025829882,0.0004714772,0.0007589937],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043157046,0.0013127143,0.010281532,0.0007916277,0.0002403086,0.00058495847,0.00093622226,0.027644636,0.8993236,0.0016594897,0.0039389073,0.04897016],"study_design_scores_gemma":[0.0003059805,0.007706363,0.024800524,0.00006610853,0.00047441653,0.0008175249,0.00080006843,0.12359786,0.8363464,0.0007322241,0.004222577,0.00013003737],"about_ca_topic_score_codex":0.00161768,"about_ca_topic_score_gemma":0.0010669851,"teacher_disagreement_score":0.004658715,"about_ca_system_score_codex":0.00039504247,"about_ca_system_score_gemma":0.00016988601,"threshold_uncertainty_score":0.015585005},"labels":[],"label_agreement":null},{"id":"W1553404127","doi":"10.1007/11559573_15","title":"Efficient Global Weighted Least-Squares Translation Registration in the Frequency Domain","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Frequency domain; Invariant (physics); Image registration; Algorithm; Fractal; Translation (biology); Function (biology); Image translation; Image (mathematics); Coding (social sciences); Artificial intelligence; Computer vision; Mathematics; Statistics","score_opus":0.017862459543023963,"score_gpt":0.2755722656234865,"score_spread":0.25770980608046257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553404127","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.002933278,0.00007945906,0.9955913,0.000035672,0.000023498158,0.000012295074,0.000036734153,0.00067204674,0.0006156975],"genre_scores_gemma":[0.049093135,0.00020763553,0.9442207,0.00004405546,0.000040963372,0.000069561596,0.00040173196,0.0005915177,0.005330712],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993363,0.00010790242,0.000033586828,0.00014760456,0.0003193024,0.000055334298],"domain_scores_gemma":[0.99936146,0.00019961593,0.000068530746,0.00019818665,0.00015097375,0.000021314227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005420351,0.001203616,0.0012437475,0.0009198065,0.00048586878,0.0012009364,0.0012299845,0.0012162484,0.005330122],"category_scores_gemma":[0.0018338374,0.00063799974,0.0009909077,0.0015697477,0.0005455332,0.0015181248,0.001844479,0.001156017,0.00432492],"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.0002914702,0.00010207756,0.00046134202,0.00021159922,0.000116430245,0.00010815245,0.00013953945,0.06554782,0.12402248,0.009631796,0.0074916235,0.79187566],"study_design_scores_gemma":[0.000049219354,0.00017630767,0.0014570055,0.000027455531,0.000091692724,0.0007161405,0.00010183607,0.8873446,0.08098107,0.01462861,0.014363024,0.00006305105],"about_ca_topic_score_codex":0.0013408988,"about_ca_topic_score_gemma":0.003383436,"teacher_disagreement_score":0.005330122,"about_ca_system_score_codex":0.00027565914,"about_ca_system_score_gemma":0.0009965588,"threshold_uncertainty_score":0.017831028},"labels":[],"label_agreement":null},{"id":"W1553467605","doi":"10.1007/978-3-540-73105-4_130","title":"Model-Driven Architecture for Web Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"École de Technologie Supérieure; Concordia University","funders":"","keywords":"Architecture; Computer science; Computer architecture; Web application; World Wide Web; Art; Visual arts","score_opus":0.026974950155399805,"score_gpt":0.26963856531287705,"score_spread":0.24266361515747725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553467605","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.006612023,0.00055350043,0.9829762,0.00035930847,0.000067403205,0.00009825448,0.000082295366,0.0028268674,0.0064242603],"genre_scores_gemma":[0.21070026,0.0016588552,0.7598478,0.00027864004,0.000048943275,0.00051722437,0.0009364228,0.00086465484,0.02514719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999458,0.00014055753,0.000043165586,0.00005797164,0.00025699442,0.00004337873],"domain_scores_gemma":[0.9996315,0.00012866882,0.000018683828,0.00010281399,0.00009473855,0.000023483944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009219214,0.00064086216,0.00045756708,0.00046194435,0.00048029562,0.001735308,0.0016872479,0.0013555811,0.003846176],"category_scores_gemma":[0.0016608657,0.0007233956,0.0007547886,0.00047152865,0.00049220066,0.0016894772,0.0010798861,0.0018431724,0.001259155],"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.00016466374,0.0002833333,0.0010266008,0.00047774205,0.00014192039,0.00037298622,0.0004158082,0.32691664,0.026731739,0.33908007,0.015109644,0.28927898],"study_design_scores_gemma":[0.00003931932,0.0000646811,0.00023271111,0.000079579986,0.00005087371,0.00017945415,0.00003471192,0.8034517,0.009644909,0.14287621,0.043319367,0.000026534919],"about_ca_topic_score_codex":0.0032584963,"about_ca_topic_score_gemma":0.0047805323,"teacher_disagreement_score":0.003846176,"about_ca_system_score_codex":0.0009670343,"about_ca_system_score_gemma":0.0012290224,"threshold_uncertainty_score":0.012866735},"labels":[],"label_agreement":null},{"id":"W1553491479","doi":"10.1007/978-3-642-27901-0_5","title":"Private Identification of RFID Tags","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RFID technology advancements","field":"Engineering","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; University of Ottawa","funders":"","keywords":"McEliece cryptosystem; Computer science; Cryptosystem; Identification (biology); Public-key cryptography; Computer security; Key (lock); Scheme (mathematics); TRACE (psycholinguistics); Cryptography; Encryption","score_opus":0.009833480615636169,"score_gpt":0.22587640668503306,"score_spread":0.2160429260693969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553491479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025501328,0.007538545,0.7245249,0.0011175575,0.0012315018,0.00007872048,0.00030247122,0.0011887929,0.23851621],"genre_scores_gemma":[0.36889493,0.008164986,0.12814681,0.0006049173,0.0008304931,0.00011874768,0.0009787303,0.00057130255,0.4916891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890196,0.00016436673,0.00005420121,0.00023802972,0.0005138398,0.000127578],"domain_scores_gemma":[0.99889165,0.00023188005,0.000094414805,0.00057670136,0.00017395907,0.000031414616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006467834,0.0006680249,0.0005326663,0.0008119166,0.0008421459,0.0024398689,0.000958885,0.0014999898,0.00967881],"category_scores_gemma":[0.001649009,0.00055182393,0.00040416967,0.0012327613,0.001410061,0.0042522284,0.0025633506,0.0015315746,0.008804827],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028735262,0.00007190559,0.0008352208,0.00037501546,0.0000224582,0.0004071583,0.00122645,0.0037087433,0.059962064,0.53471905,0.01571722,0.38266733],"study_design_scores_gemma":[0.000019568395,0.00024385612,0.0014535801,0.00026467795,0.00005907532,0.0038392046,0.00057811174,0.0211283,0.15743804,0.21905707,0.59582347,0.00009508816],"about_ca_topic_score_codex":0.0001623333,"about_ca_topic_score_gemma":0.00016830335,"teacher_disagreement_score":0.00967881,"about_ca_system_score_codex":0.0006655345,"about_ca_system_score_gemma":0.0004195837,"threshold_uncertainty_score":0.032378852},"labels":[],"label_agreement":null},{"id":"W1553574248","doi":"10.1007/978-3-540-30135-6_76","title":"Spatial-Stiffness Analysis of Surface-Based Registration","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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":"Queen's University","funders":"","keywords":"Fiducial marker; Image registration; Maximization; Selection (genetic algorithm); Computer science; Artificial intelligence; Surface (topology); Computer vision; Pattern recognition (psychology); Mathematics; Image (mathematics); Mathematical optimization; Geometry","score_opus":0.01395979185149502,"score_gpt":0.22834845278147703,"score_spread":0.21438866092998202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553574248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051650118,0.0004067667,0.9424518,0.00017448113,0.000034968187,0.00002823865,0.000063338164,0.0002903152,0.0048999637],"genre_scores_gemma":[0.8773114,0.0006611764,0.10660594,0.000057314992,0.00006061867,0.00005083554,0.00014605178,0.00032506444,0.014781542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996289,0.000071933566,0.000018869147,0.00005670775,0.00018564131,0.000037971706],"domain_scores_gemma":[0.9989215,0.0005394214,0.00013585885,0.0001691615,0.0002026725,0.00003140525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005951322,0.00047246137,0.0004703942,0.0009477369,0.00031020714,0.000936289,0.00087020535,0.0007969497,0.0039217],"category_scores_gemma":[0.0026871662,0.000491174,0.00045429968,0.0008742244,0.00092433934,0.0014953456,0.0008736811,0.0005244404,0.00071314943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026657872,0.00007470262,0.001542954,0.00031684837,0.000068697445,0.00028929173,0.00028253897,0.61493033,0.0901246,0.10664925,0.0017761171,0.18367808],"study_design_scores_gemma":[0.0000022550837,0.000015683836,0.0006646068,0.00000625861,0.0000065202007,0.00008574472,0.000019944413,0.98649246,0.0040308265,0.0081104785,0.00055334216,0.000011836253],"about_ca_topic_score_codex":0.0019126575,"about_ca_topic_score_gemma":0.002712348,"teacher_disagreement_score":0.0039217,"about_ca_system_score_codex":0.0005185209,"about_ca_system_score_gemma":0.00042614917,"threshold_uncertainty_score":0.01311934},"labels":[],"label_agreement":null},{"id":"W1553664401","doi":"10.1007/11964254_13","title":"Cryptographic Protocol to Establish Trusted History of Interactions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Polytechnique Montréal","funders":"","keywords":"Cryptographic protocol; Computer science; Protocol (science); Cryptography; Computer security; Cryptographic primitive; Context (archaeology); Public-key cryptography; Computer network; Key management; Encryption; Geography; Medicine","score_opus":0.017544731609668664,"score_gpt":0.25551568009658604,"score_spread":0.23797094848691738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553664401","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.010232486,0.00037606034,0.95916766,0.0010614522,0.00051376066,0.00036051084,0.0002584694,0.0017826821,0.026246982],"genre_scores_gemma":[0.48493403,0.0009332026,0.44619393,0.0006930752,0.0006507946,0.0013284162,0.0010534032,0.0006804365,0.06353271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963175,0.0009105175,0.00033762841,0.0005111003,0.001513201,0.00040994925],"domain_scores_gemma":[0.9877079,0.003294355,0.00064158597,0.0063383556,0.001440323,0.00057740835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003984071,0.000821941,0.0010484947,0.002312194,0.0030881988,0.0038059384,0.0026874267,0.0021950777,0.011955949],"category_scores_gemma":[0.012322333,0.00081855495,0.0010320152,0.0023533527,0.0034218212,0.010939025,0.00701255,0.006642101,0.006730993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014084051,0.000061390514,0.00017165668,0.00009012323,0.00002135036,0.000119304175,0.00038206074,0.002047971,0.003952666,0.94506013,0.0067625144,0.041190047],"study_design_scores_gemma":[0.00019116612,0.00024126057,0.0002585718,0.00015905872,0.000115744064,0.0007322893,0.00024103196,0.08079639,0.028180607,0.8059714,0.08300912,0.0001033629],"about_ca_topic_score_codex":0.00042043193,"about_ca_topic_score_gemma":0.0004946414,"teacher_disagreement_score":0.011955949,"about_ca_system_score_codex":0.0015462531,"about_ca_system_score_gemma":0.003175107,"threshold_uncertainty_score":0.039996624},"labels":[],"label_agreement":null},{"id":"W1553669113","doi":"10.1007/978-3-642-12116-6_43","title":"Identification of Translationese: A Machine Learning Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":74,"is_retracted":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":"Computer science; Artificial intelligence; Support vector machine; Machine learning; Classifier (UML)","score_opus":0.012428459942297453,"score_gpt":0.2552222638959913,"score_spread":0.24279380395369382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553669113","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.106261924,0.0021066507,0.85216594,0.00068087556,0.00056884944,0.00038465345,0.0040090447,0.011989659,0.021832354],"genre_scores_gemma":[0.40295547,0.0015155177,0.5500119,0.00026847454,0.0003521413,0.0002822657,0.014105677,0.002277721,0.028230939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991968,0.00013821089,0.000061753344,0.00030293703,0.00018287056,0.000117484014],"domain_scores_gemma":[0.99796474,0.0005582834,0.00017870631,0.0003773703,0.0008235085,0.0000974382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084346853,0.0015748378,0.0013164512,0.0036323934,0.0014715377,0.0028925445,0.0012563965,0.0015822357,0.011402053],"category_scores_gemma":[0.0033485196,0.0004914077,0.0013104597,0.0035583575,0.00067952974,0.00303828,0.0014429622,0.0018739955,0.011513445],"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.0005992684,0.0003253564,0.007199232,0.00049758714,0.00011923894,0.0010198833,0.0004520936,0.0069169463,0.057332303,0.014969712,0.016789868,0.89377856],"study_design_scores_gemma":[0.00014550649,0.00063979736,0.012974314,0.00022503498,0.0004674654,0.0035015983,0.0016601529,0.7239512,0.11923259,0.061588567,0.075415894,0.00019785615],"about_ca_topic_score_codex":0.0027018776,"about_ca_topic_score_gemma":0.00322848,"teacher_disagreement_score":0.011402053,"about_ca_system_score_codex":0.00049327855,"about_ca_system_score_gemma":0.0014601753,"threshold_uncertainty_score":0.038143635},"labels":[],"label_agreement":null},{"id":"W1553695279","doi":"10.1007/978-3-540-24681-7_11","title":"Computing Minimal Probabilistic Rules from Probabilistic Decision Tables: Decision Matrix Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Decision table; Computer science; Probabilistic logic; Decision matrix; Influence diagram; Boolean function; Probabilistic CTL; Decision tree; Decision rule; Algorithm; Rough set; Theoretical computer science; Decision model; Probabilistic analysis of algorithms; Artificial intelligence; Machine learning; Mathematics; Operations research","score_opus":0.020160893538473557,"score_gpt":0.25408260956726564,"score_spread":0.23392171602879208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553695279","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.0157313,0.00039459794,0.981295,0.00018190817,0.000028488323,0.000115343384,0.00054651796,0.00055070326,0.0011561293],"genre_scores_gemma":[0.17577662,0.0005096478,0.82020277,0.00009356044,0.00007256481,0.00021859225,0.0021536732,0.000121703655,0.00085082126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644864,0.00096869335,0.00040184474,0.00070094626,0.0012994322,0.00018049235],"domain_scores_gemma":[0.98804575,0.0098303985,0.00045012226,0.00057632,0.00094294717,0.00015445944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030615663,0.0012307586,0.002840317,0.0032131623,0.00088114967,0.0034465704,0.0027804226,0.0012275786,0.004620902],"category_scores_gemma":[0.019489942,0.0015060912,0.0026825862,0.0029265317,0.0009934485,0.0038177348,0.0019368181,0.0020062546,0.0011495316],"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.0004329799,0.00033888276,0.002319653,0.0012059868,0.0005301329,0.0004885555,0.00045925405,0.4050109,0.0054495134,0.067780174,0.005876324,0.5101077],"study_design_scores_gemma":[0.000045951314,0.00008313688,0.0003166715,0.000080185004,0.00013653672,0.00013141157,0.000093004,0.7885414,0.0026247299,0.2062793,0.001629731,0.000037991613],"about_ca_topic_score_codex":0.0030197345,"about_ca_topic_score_gemma":0.0046327757,"teacher_disagreement_score":0.004620902,"about_ca_system_score_codex":0.0009951949,"about_ca_system_score_gemma":0.0018671376,"threshold_uncertainty_score":0.016191304},"labels":[],"label_agreement":null},{"id":"W1553704381","doi":"10.1007/3-540-45110-2_33","title":"The Master-Slave Architecture for Evolutionary Computations Revisited","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Université Laval","funders":"","keywords":"Computer science; Workstation; Exploit; Computation; Architecture; Parallel computing; Distributed computing; Evolutionary computation; Idle; Operating system; Artificial intelligence; Algorithm; Computer security","score_opus":0.01817391371438399,"score_gpt":0.24979223902858258,"score_spread":0.2316183253141986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553704381","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.026274826,0.0032786957,0.8913959,0.0039086356,0.0006339146,0.000059159825,0.000051124003,0.00038182412,0.07401593],"genre_scores_gemma":[0.73627865,0.0023705845,0.22647093,0.0005503368,0.00035803072,0.00014205828,0.00005205976,0.00015158008,0.03362583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962866,0.00013517312,0.000019593428,0.00007859316,0.000089052715,0.000049011305],"domain_scores_gemma":[0.999366,0.0003105947,0.000023319275,0.0001776396,0.000085713174,0.0000367979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010119143,0.0003419508,0.0009370012,0.00025960215,0.00083405885,0.0018486476,0.0021991723,0.0020543388,0.008518215],"category_scores_gemma":[0.0026886694,0.00048039792,0.00052399817,0.00058501755,0.001986371,0.0032353033,0.00095256924,0.0025841738,0.00114949],"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.000056441935,0.00002388808,0.00011892551,0.0000776138,0.000026092648,0.00008610324,0.00013457482,0.043899674,0.002635082,0.9187032,0.0022479447,0.03199055],"study_design_scores_gemma":[0.000054041117,0.000050666375,0.00012669426,0.000025681638,0.000022308443,0.00013516883,0.00004797252,0.33972925,0.0015169387,0.6468968,0.011378012,0.000016491122],"about_ca_topic_score_codex":0.0011423859,"about_ca_topic_score_gemma":0.0017232118,"teacher_disagreement_score":0.008518215,"about_ca_system_score_codex":0.0007160126,"about_ca_system_score_gemma":0.00086882955,"threshold_uncertainty_score":0.028496265},"labels":[],"label_agreement":null},{"id":"W155370557","doi":"10.1007/978-3-642-37382-4_4","title":"Learning in the Presence of Large Fluctuations: A Study of Aggregation and Correlation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Outlier; Gaussian; Computer science; Generalization; Exponent; Heavy-tailed distribution; Stability (learning theory); Distribution (mathematics); Stable distribution; Statistical physics; Econometrics; Data mining; Mathematics; Statistics; Artificial intelligence; Machine learning; Physics","score_opus":0.02023860655360945,"score_gpt":0.2236224929230843,"score_spread":0.20338388636947485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155370557","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.49469182,0.0051547107,0.48335132,0.0045953705,0.00018219191,0.00008232939,0.0002200011,0.00033290833,0.011389317],"genre_scores_gemma":[0.97528005,0.0019730895,0.018355908,0.00019106838,0.00036142167,0.000060082555,0.00012980333,0.000108944856,0.003539601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972606,0.0013999362,0.00015733638,0.00047304382,0.00040612448,0.00030309428],"domain_scores_gemma":[0.89750636,0.08720176,0.0072131576,0.004347716,0.0020650479,0.0016659817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008364757,0.00068445865,0.002698575,0.0019472176,0.0010535727,0.003820556,0.0030488477,0.0025733379,0.0018456322],"category_scores_gemma":[0.06008926,0.0009294217,0.0016557241,0.0028206704,0.0045225397,0.0075401044,0.0026628028,0.0031443036,0.00019397127],"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.00011831347,0.0001559645,0.010819849,0.0001691152,0.0003015092,0.0004979034,0.0010739237,0.20450847,0.0006990791,0.7528514,0.002836546,0.025967872],"study_design_scores_gemma":[0.000018329974,0.00004157804,0.0026244638,0.000027395266,0.000045364268,0.000093044066,0.00013585038,0.58701706,0.0001387989,0.40919784,0.00062785944,0.00003249498],"about_ca_topic_score_codex":0.003851161,"about_ca_topic_score_gemma":0.0021732366,"teacher_disagreement_score":0.008364757,"about_ca_system_score_codex":0.0014841901,"about_ca_system_score_gemma":0.0011895308,"threshold_uncertainty_score":0.044237554},"labels":[],"label_agreement":null},{"id":"W1553725291","doi":"10.1007/978-3-540-25840-7_3","title":"Bayesian Network Trust Model in Peer-to-Peer Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":150,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bayesian network; Peer-to-peer; Context (archaeology); Peer review; Computational trust; Bayesian probability; Artificial intelligence; World Wide Web; Reputation","score_opus":0.016106619139255967,"score_gpt":0.2722836041111216,"score_spread":0.25617698497186564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553725291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025646567,0.00077813206,0.96653324,0.0014791616,0.0001310147,0.000092547234,0.00027849813,0.00022161941,0.004839161],"genre_scores_gemma":[0.85284925,0.0027239802,0.116260596,0.0003002968,0.00045246186,0.0005077629,0.0006589443,0.00014546381,0.026101282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957468,0.0019212152,0.00019057233,0.00074187433,0.0010111134,0.00038854367],"domain_scores_gemma":[0.9850846,0.011313097,0.0010027939,0.00063301297,0.0015530628,0.0004134707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064352327,0.001188554,0.0035990633,0.0015633167,0.0012691099,0.0032961909,0.005669844,0.0044088867,0.00418005],"category_scores_gemma":[0.03018521,0.0016199496,0.001097134,0.0025552367,0.0025410496,0.008789418,0.0018899865,0.0035997818,0.0011643148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001665654,0.00007138921,0.0007987655,0.00013629983,0.0000968329,0.00016143873,0.000285206,0.6908447,0.00046102863,0.2858309,0.0032515575,0.017895391],"study_design_scores_gemma":[0.000018721428,0.000017874218,0.00014516865,0.000011848878,0.000023089631,0.00003429872,0.000018045615,0.9240163,0.00007454441,0.075022146,0.0005994129,0.000018567289],"about_ca_topic_score_codex":0.01462278,"about_ca_topic_score_gemma":0.010082303,"teacher_disagreement_score":0.01462278,"about_ca_system_score_codex":0.003688261,"about_ca_system_score_gemma":0.0016907284,"threshold_uncertainty_score":0.03403318},"labels":[],"label_agreement":null},{"id":"W1553735400","doi":"10.1007/11888116_32","title":"Minimizing Coordination Channels in Distributed Testing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Ottawa","funders":"Sabancı Üniversitesi; Government of Ontario","keywords":"Computer science; Architecture; Distributed computing; Test (biology); Test case; Transitive relation; Systems architecture","score_opus":0.028546060329400658,"score_gpt":0.25505638375437323,"score_spread":0.22651032342497257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553735400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029536167,0.0003199688,0.9628964,0.00033409006,0.00005303457,0.00012175122,0.000038541148,0.0011627496,0.005537366],"genre_scores_gemma":[0.7047268,0.00029848472,0.287996,0.0001460509,0.00009701235,0.0002860304,0.00011997,0.0005954266,0.0057342197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.992804,0.003260876,0.00037823195,0.0009427211,0.0016448955,0.00096931454],"domain_scores_gemma":[0.95679986,0.031131892,0.0022373064,0.0068645184,0.0016725191,0.001293863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005668322,0.0014794109,0.0022493878,0.0010829896,0.001376355,0.0019433822,0.0034617123,0.0015627071,0.0054380037],"category_scores_gemma":[0.023000548,0.0010186353,0.0010708418,0.0014747116,0.0028702181,0.0055193733,0.0041313795,0.0034950022,0.00063792436],"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.001492078,0.00051355304,0.002653013,0.00049788394,0.00011015704,0.0003401042,0.00048516845,0.42791483,0.008048925,0.24700043,0.0058124964,0.30513135],"study_design_scores_gemma":[0.00022139715,0.00026412393,0.00048595323,0.00007891651,0.000118649084,0.00020591445,0.000116622825,0.64262915,0.0068927566,0.34599283,0.0029566644,0.000037014706],"about_ca_topic_score_codex":0.0015537973,"about_ca_topic_score_gemma":0.0020655664,"teacher_disagreement_score":0.005668322,"about_ca_system_score_codex":0.0015335958,"about_ca_system_score_gemma":0.0024845744,"threshold_uncertainty_score":0.029977322},"labels":[],"label_agreement":null},{"id":"W1553738992","doi":"10.1007/978-3-642-19315-6_30","title":"Compressed Sensing for Robust Texture Classification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Texture (cosmology); Artificial intelligence; Computer science; Pattern recognition (psychology); Compressed sensing; Computer vision; Image (mathematics)","score_opus":0.05823035430574065,"score_gpt":0.28460980108116657,"score_spread":0.22637944677542593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553738992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042706653,0.0036591117,0.9840242,0.0005178521,0.0003011168,0.00004169649,0.00031248012,0.000785005,0.0060878447],"genre_scores_gemma":[0.12320661,0.0068327812,0.8478739,0.0006426322,0.0010344961,0.00015960525,0.0013509387,0.0003902688,0.01850869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969506,0.000040630235,0.0000131635,0.00004290164,0.00018729626,0.000021022719],"domain_scores_gemma":[0.9995408,0.0002472691,0.00003097968,0.000092141374,0.00007628713,0.00001253073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027396606,0.0006290984,0.0006736491,0.00082531536,0.00019592729,0.00073251454,0.0007118379,0.00076852506,0.008716756],"category_scores_gemma":[0.0012854107,0.00025623402,0.00041366063,0.0013404449,0.0005643048,0.0007863273,0.0006709258,0.0010339209,0.0020712574],"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.00012526746,0.00004532817,0.00009804068,0.00028600893,0.00003549163,0.000078925135,0.000042903244,0.02436491,0.05046167,0.029309515,0.019250892,0.875901],"study_design_scores_gemma":[0.000036545884,0.000121703146,0.0008859435,0.00010596354,0.0000501392,0.00057223946,0.000047033638,0.8536852,0.0467159,0.056329828,0.04140255,0.00004695525],"about_ca_topic_score_codex":0.0014366255,"about_ca_topic_score_gemma":0.0019457956,"teacher_disagreement_score":0.008716756,"about_ca_system_score_codex":0.00029033297,"about_ca_system_score_gemma":0.00031049887,"threshold_uncertainty_score":0.0291605},"labels":[],"label_agreement":null},{"id":"W1553770895","doi":"10.1007/11878773_83","title":"Using Various Indexing Schemes and Multiple Translations in the CL-SR Task at CLEF 2005","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"Clef; Computer science; Search engine indexing; Information retrieval; Weighting; Task (project management); Natural language processing; Scheme (mathematics); Document retrieval; Artificial intelligence; Mathematics","score_opus":0.021290792088598617,"score_gpt":0.26971849834721756,"score_spread":0.24842770625861893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553770895","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.4308045,0.0090496745,0.33076635,0.010409498,0.0032057515,0.0021277668,0.04676786,0.106219746,0.06064889],"genre_scores_gemma":[0.35510418,0.0012915869,0.49224398,0.0015732385,0.0006554332,0.000633928,0.11648709,0.009230588,0.022780068],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9925055,0.003293485,0.0008494948,0.0017279105,0.0011108851,0.00051273586],"domain_scores_gemma":[0.9869572,0.0068805036,0.0004112174,0.0027537567,0.0025400121,0.00045729004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072219414,0.0025390005,0.003125165,0.00311743,0.002992651,0.0035993163,0.0031151164,0.004039215,0.029046088],"category_scores_gemma":[0.01856536,0.001071027,0.0017997752,0.0044309413,0.00096448464,0.008324843,0.0028885715,0.00312278,0.014576523],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002940103,0.0010813343,0.0019743342,0.0025606689,0.00023585962,0.00073080015,0.0009742594,0.007413278,0.030760562,0.010150874,0.29767248,0.6435055],"study_design_scores_gemma":[0.006037851,0.0037181377,0.008187696,0.0007127994,0.0010944656,0.004048013,0.0057684383,0.45695254,0.18642999,0.08375112,0.24231341,0.0009854932],"about_ca_topic_score_codex":0.007726159,"about_ca_topic_score_gemma":0.014959005,"teacher_disagreement_score":0.029046088,"about_ca_system_score_codex":0.0011590343,"about_ca_system_score_gemma":0.0035378914,"threshold_uncertainty_score":0.09716886},"labels":[],"label_agreement":null},{"id":"W1553775054","doi":"10.1007/11814764_19","title":"Key Revocation for Identity-Based Schemes in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Revocation; Computer science; Computer network; Public-key cryptography; Node (physics); Mobile ad hoc network; Computer security; Wireless ad hoc network; Key (lock); Key management; Revocation list; Cryptography; Scheme (mathematics); Public key infrastructure; Encryption; Telecommunications; Wireless; Overhead (engineering); Engineering; Mathematics","score_opus":0.012511211369120218,"score_gpt":0.2545338079866253,"score_spread":0.24202259661750505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553775054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025257358,0.007371122,0.937198,0.001320496,0.0007908101,0.00032302272,0.000092514994,0.0008651109,0.026781607],"genre_scores_gemma":[0.7414873,0.0055158725,0.2154002,0.0003754116,0.0006790814,0.00045075922,0.00036983265,0.00024366326,0.035477776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966214,0.0012108029,0.00026605368,0.00037195277,0.0010728624,0.00045699388],"domain_scores_gemma":[0.99546057,0.0018820398,0.0003130714,0.0017815473,0.00042451208,0.00013826888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031094,0.0007027682,0.0011737143,0.00074035465,0.0016912429,0.0033693209,0.0025957834,0.0018849191,0.0045886487],"category_scores_gemma":[0.008990449,0.00056713837,0.0006269042,0.0014529534,0.0025749025,0.008979741,0.0039675017,0.0034329044,0.0018923727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006187473,0.00015032061,0.00039586684,0.00059840677,0.000049318583,0.00035970635,0.00093585986,0.01734056,0.0126343435,0.7345562,0.011207369,0.22115335],"study_design_scores_gemma":[0.00015683589,0.00030372405,0.00031699368,0.0002329856,0.000064856475,0.0016077394,0.00047393725,0.16991931,0.013908616,0.74290067,0.07000327,0.000110986875],"about_ca_topic_score_codex":0.0003118466,"about_ca_topic_score_gemma":0.00027967078,"teacher_disagreement_score":0.0045886487,"about_ca_system_score_codex":0.0016411187,"about_ca_system_score_gemma":0.0009731033,"threshold_uncertainty_score":0.016444266},"labels":[],"label_agreement":null},{"id":"W1553820083","doi":"10.1007/3-540-47987-2_47","title":"Exploring Various Guidance Mechanisms to Support Interaction with Inspectable Learner Models","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Reflection (computer programming); Protocol (science); Human–computer interaction; Knowledge management","score_opus":0.0800284965442352,"score_gpt":0.249513965551562,"score_spread":0.1694854690073268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553820083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19047637,0.0009212315,0.7959669,0.00035302137,0.00003425082,0.00019430506,0.00009302954,0.0055423323,0.0064185862],"genre_scores_gemma":[0.7237111,0.00039078807,0.27105623,0.00009793639,0.000012141353,0.00013367385,0.00013666673,0.00024738463,0.0042141103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995907,0.000120875615,0.000029301684,0.00007501452,0.00012873439,0.000055397235],"domain_scores_gemma":[0.99831605,0.0011506352,0.00009658419,0.00013855274,0.00021763485,0.000080458034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348684,0.0004619754,0.00044313964,0.00038162974,0.0003708795,0.0015656204,0.0016318231,0.0009378626,0.0033674834],"category_scores_gemma":[0.004077284,0.00025023925,0.00039872015,0.00030951086,0.0003876677,0.0021824858,0.0012825717,0.00090651045,0.00045247283],"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.0022646263,0.0009663602,0.0038263034,0.00070460397,0.00012370948,0.00034765602,0.00431093,0.033261005,0.080804184,0.031793945,0.003407304,0.83818924],"study_design_scores_gemma":[0.0004412369,0.0014337404,0.0023203955,0.00020481453,0.000400619,0.0005049513,0.0014162263,0.8450648,0.10090725,0.029365128,0.01781081,0.00012990477],"about_ca_topic_score_codex":0.0012994993,"about_ca_topic_score_gemma":0.001815987,"teacher_disagreement_score":0.0033674834,"about_ca_system_score_codex":0.00022151436,"about_ca_system_score_gemma":0.00043246924,"threshold_uncertainty_score":0.0112653375},"labels":[],"label_agreement":null},{"id":"W1553866454","doi":"10.1007/978-3-540-30117-2_4","title":"Hardware Accelerated Novel Protein Identification","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mass Spectrometry Techniques and Applications","field":"Chemistry","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Software; Key (lock); Process (computing); Identification (biology); Function (biology); Computer hardware; Hardware architecture; Computational biology; Embedded system; Biology; Operating system; Genetics","score_opus":0.02548243290242062,"score_gpt":0.2679966575271524,"score_spread":0.2425142246247318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553866454","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.08760148,0.0030129363,0.86064345,0.0008123489,0.0012687258,0.00019436724,0.0007347974,0.020773238,0.024958657],"genre_scores_gemma":[0.23456702,0.0011492394,0.68629235,0.00053804286,0.00022686436,0.00016612938,0.0019667235,0.00054814486,0.07454561],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996363,0.00002805093,0.0000118205135,0.00008141444,0.00019272772,0.000049683473],"domain_scores_gemma":[0.9997286,0.00005687373,0.000018552877,0.00008669505,0.000088680645,0.00002057117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028504903,0.0007028211,0.000563797,0.0004263353,0.0004651563,0.0009725421,0.0016422794,0.00057154964,0.010554572],"category_scores_gemma":[0.0003451637,0.0004126649,0.00027430974,0.0005580559,0.00025072834,0.0009955505,0.001039213,0.00082504837,0.0054542203],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072887004,0.00018887842,0.0007031995,0.000222913,0.000046807927,0.00022593804,0.00005867296,0.0029118801,0.50277054,0.009434033,0.024107095,0.45860124],"study_design_scores_gemma":[0.0000869005,0.0005911506,0.0024397862,0.00003024153,0.000060187507,0.001441224,0.000059196656,0.15695246,0.73589224,0.0053383573,0.09703881,0.000069327536],"about_ca_topic_score_codex":0.00047586882,"about_ca_topic_score_gemma":0.0013543591,"teacher_disagreement_score":0.010554572,"about_ca_system_score_codex":0.0004173259,"about_ca_system_score_gemma":0.0005080555,"threshold_uncertainty_score":0.0353086},"labels":[],"label_agreement":null},{"id":"W1553874875","doi":"10.1007/978-3-540-39899-8_31","title":"Application of an Intra-operative Load Measuring System for Knee Replacement Surgery","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","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":"St Joseph's Health Care; Western University","funders":"","keywords":"Computer science; Cadaveric spasm; Knee Joint; Joint (building); Ligament; Total knee arthroplasty; Simulation; Surgery; Medicine; Structural engineering; Engineering","score_opus":0.0215896169622093,"score_gpt":0.26129284815015663,"score_spread":0.23970323118794734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553874875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20783634,0.0031013617,0.7324228,0.0014715466,0.0015425296,0.00061513257,0.0011924201,0.0107403,0.041077487],"genre_scores_gemma":[0.621697,0.0022638175,0.31654352,0.0010720657,0.00046652666,0.00036133788,0.0007610208,0.0006152922,0.056219403],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996321,0.000051556555,0.000025696037,0.000058055106,0.00021665337,0.000015867676],"domain_scores_gemma":[0.9993511,0.00028237558,0.000035133784,0.000070543225,0.00022113876,0.00003977312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051015796,0.00050287973,0.00037979308,0.0005533627,0.0002599836,0.00065534184,0.0009757464,0.0007559183,0.008326064],"category_scores_gemma":[0.0010866356,0.00033192735,0.00023895326,0.0004410555,0.00016104657,0.00053594727,0.00057221734,0.00040689667,0.0020658427],"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.00069743866,0.0003540096,0.010955302,0.00026414945,0.000043493103,0.0005935572,0.0004299945,0.0015958175,0.20552506,0.0009822189,0.011462574,0.7670964],"study_design_scores_gemma":[0.00036771083,0.005130672,0.15878443,0.00038637995,0.0007459326,0.012722075,0.00078949024,0.132576,0.4998658,0.0051600374,0.18306632,0.00040510888],"about_ca_topic_score_codex":0.0008209899,"about_ca_topic_score_gemma":0.0014960692,"teacher_disagreement_score":0.008326064,"about_ca_system_score_codex":0.00017337147,"about_ca_system_score_gemma":0.00037253913,"threshold_uncertainty_score":0.02785343},"labels":[],"label_agreement":null},{"id":"W1553894164","doi":"10.1007/978-3-642-02611-9_54","title":"A Robust Modular Wavelet Network Based Symbol Classifier","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Else Kröner-Fresenius-Stiftung","keywords":"Pattern recognition (psychology); Artificial intelligence; Computer science; Wavelet; Classifier (UML); Zernike polynomials; Affine transformation; Mathematics","score_opus":0.02730060925786366,"score_gpt":0.23443129257313877,"score_spread":0.20713068331527512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553894164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010902693,0.00026635156,0.9855048,0.00009078824,0.00014379034,0.000051830517,0.00011795261,0.0014862494,0.0014355325],"genre_scores_gemma":[0.17589572,0.0005829467,0.80880946,0.00021477009,0.0002525781,0.00016671038,0.0010858375,0.00023996222,0.012751981],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948287,0.00007544563,0.000026816899,0.000102572,0.00026060425,0.00005173245],"domain_scores_gemma":[0.99950385,0.00012564952,0.000037186586,0.00009880456,0.00019968493,0.000034777964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007312946,0.0006820503,0.0013271475,0.0009378077,0.0004000497,0.0008696694,0.0015678715,0.0010019013,0.0049913414],"category_scores_gemma":[0.0014360346,0.0003187216,0.00065509795,0.0008987714,0.00033057542,0.0015262621,0.0012662803,0.0010002266,0.003578071],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039544163,0.00013287272,0.00039436377,0.00008972639,0.000061632825,0.00009290469,0.000021287002,0.022211669,0.060466528,0.0060558333,0.0066469037,0.9034308],"study_design_scores_gemma":[0.000026193704,0.00013759182,0.00057586515,0.000011698998,0.000061255465,0.000178801,0.000010326072,0.9652071,0.025791466,0.0030118895,0.0049638846,0.000024017194],"about_ca_topic_score_codex":0.0011670897,"about_ca_topic_score_gemma":0.0018084482,"teacher_disagreement_score":0.0049913414,"about_ca_system_score_codex":0.00037748224,"about_ca_system_score_gemma":0.00075050525,"threshold_uncertainty_score":0.016697764},"labels":[],"label_agreement":null},{"id":"W1553923728","doi":"10.1007/978-3-540-76856-2_44","title":"Surface Signature-Based Method for Modeling and Recognizing Free-Form Objects","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and 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":"University of British Columbia","funders":"","keywords":"Signature (topology); Surface (topology); Computer vision; Artificial intelligence; ENCODE; Point (geometry); Point cloud; Principal curvature; Symmetry (geometry); Object (grammar); Curvature; Computer science; Pattern recognition (psychology); Orientation (vector space); Geometry; Algorithm; Mathematics; Mean curvature","score_opus":0.03202936121182659,"score_gpt":0.26738151159071694,"score_spread":0.23535215037889035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553923728","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.0039705127,0.00011018684,0.9932307,0.000017755767,0.000036626443,0.000035167854,0.00008718767,0.0017112921,0.0008006075],"genre_scores_gemma":[0.09074121,0.00037048061,0.9006072,0.0000650588,0.000028038952,0.00009689786,0.00081742177,0.00037954526,0.006893998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995258,0.000028741566,0.000021111025,0.00008126333,0.00030332332,0.000039829654],"domain_scores_gemma":[0.9996357,0.00004551645,0.000020920552,0.00008336503,0.00019517913,0.000019250743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002867857,0.0009656639,0.0009536271,0.0016354214,0.0004095405,0.0008137833,0.001602517,0.0010094965,0.0044321194],"category_scores_gemma":[0.0005336298,0.0004326251,0.00083663384,0.0016341016,0.00039403263,0.0013416206,0.00084066263,0.0008424982,0.0037890377],"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.00011716886,0.00007823603,0.000736918,0.00014582208,0.00004715144,0.00010147636,0.00008586208,0.018542605,0.15012695,0.005681307,0.0043906285,0.8199459],"study_design_scores_gemma":[0.000011046779,0.00008342718,0.0009417221,0.00001698502,0.000040800936,0.0005164615,0.00008195263,0.87175846,0.10841673,0.0049074558,0.013182328,0.00004268885],"about_ca_topic_score_codex":0.002955225,"about_ca_topic_score_gemma":0.0038553432,"teacher_disagreement_score":0.0044321194,"about_ca_system_score_codex":0.0003621268,"about_ca_system_score_gemma":0.0010294601,"threshold_uncertainty_score":0.014826894},"labels":[],"label_agreement":null},{"id":"W1553935757","doi":"10.1007/978-3-540-72863-4_48","title":"A Web Services-Based Architecture for Wide-Area Protection System Design and Simulation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","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":"National Research Council Canada; Western University","funders":"","keywords":"Web service; Architecture; Computer science; Electric power system; Energy management system; Scheme (mathematics); Service (business); Power (physics); Energy (signal processing); Energy management; World Wide Web","score_opus":0.019151616784615244,"score_gpt":0.2265807366501223,"score_spread":0.20742911986550705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553935757","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.0041065877,0.00007683577,0.9850192,0.00013549761,0.000050400657,0.00012680383,0.000093321825,0.0054314253,0.004959943],"genre_scores_gemma":[0.11664759,0.0004045107,0.86980546,0.00016077884,0.00004318811,0.0005790636,0.00075055734,0.001428849,0.010179991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938524,0.0001788,0.000047686517,0.000055609195,0.0002897702,0.00004293557],"domain_scores_gemma":[0.9994436,0.00016577874,0.000022591115,0.00012370334,0.00018652697,0.000057733894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010238552,0.0007859613,0.0006376797,0.00075038977,0.0007918857,0.0017669491,0.0017823982,0.0013088383,0.008010118],"category_scores_gemma":[0.0017213827,0.00067096285,0.00097594125,0.00076939637,0.0006929137,0.0012332057,0.0010657791,0.0013906148,0.0025051415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003226205,0.00034741234,0.0014031895,0.00031388665,0.00016427044,0.0003977943,0.00045171424,0.6377144,0.025280964,0.1101958,0.0147210155,0.20868695],"study_design_scores_gemma":[0.00003472257,0.000038869337,0.00013915742,0.000030015995,0.000026867676,0.000067246205,0.000019024255,0.95274734,0.005681276,0.022133453,0.019065436,0.000016566546],"about_ca_topic_score_codex":0.0074824854,"about_ca_topic_score_gemma":0.005765916,"teacher_disagreement_score":0.008010118,"about_ca_system_score_codex":0.00067484204,"about_ca_system_score_gemma":0.0014098374,"threshold_uncertainty_score":0.02679652},"labels":[],"label_agreement":null},{"id":"W1553966554","doi":"10.1007/978-3-642-25261-7_12","title":"Multi-Test Decision Trees for Gene Expression Data Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Univariate; Computer science; Decision tree; Data mining; Tree (set theory); Expression (computer science); Node (physics); Microarray analysis techniques; Machine learning; Gene expression; Gene; Mathematics; Multivariate statistics; Biology","score_opus":0.04287942774529186,"score_gpt":0.311398551636153,"score_spread":0.26851912389086113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553966554","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.0021286146,0.0010106104,0.99349606,0.00014272341,0.000111096706,0.000050793155,0.0006565968,0.0019383319,0.0004652391],"genre_scores_gemma":[0.050890923,0.0006517446,0.94148004,0.00014330246,0.00022532606,0.00039637214,0.0033114548,0.0005906102,0.0023101582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967062,0.001596143,0.00030124417,0.00046783485,0.0008258052,0.00010293368],"domain_scores_gemma":[0.9869391,0.011204534,0.00023852772,0.00082087796,0.0006719981,0.00012501611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037612212,0.0011709287,0.001887111,0.0015081557,0.00060309516,0.0011675569,0.0025594754,0.0015164858,0.006826505],"category_scores_gemma":[0.014549144,0.0008047187,0.0017393593,0.0025704193,0.00050984125,0.0013818956,0.0010726552,0.0026855487,0.0034648883],"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.0002336846,0.00012140763,0.0010202215,0.0003734196,0.00020542213,0.00016203123,0.000082799765,0.11226,0.0022287446,0.012947413,0.021264002,0.8491009],"study_design_scores_gemma":[0.000037862854,0.00006530477,0.00067828514,0.00005009349,0.00004863792,0.00014733832,0.000021957982,0.9193646,0.0017469338,0.07060221,0.007212851,0.000023932284],"about_ca_topic_score_codex":0.0014003956,"about_ca_topic_score_gemma":0.0022332573,"teacher_disagreement_score":0.006826505,"about_ca_system_score_codex":0.00056674524,"about_ca_system_score_gemma":0.00074388756,"threshold_uncertainty_score":0.022836864},"labels":[],"label_agreement":null},{"id":"W1553969852","doi":"10.1007/11766247_26","title":"Using Natural Language Processing to Assist the Visually Handicapped in Writing Compositions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"Concordia University","funders":"","keywords":"Computer science; Natural (archaeology); Programming language; Natural language processing; Human–computer interaction; Computer graphics (images); Artificial intelligence; Multimedia; Engineering drawing; History; Engineering","score_opus":0.03467231320735319,"score_gpt":0.32548952899767825,"score_spread":0.29081721579032505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553969852","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.5382124,0.0026707856,0.36647287,0.0016188632,0.0005439677,0.0006400912,0.0010954853,0.0100572305,0.07868829],"genre_scores_gemma":[0.61055875,0.0020251172,0.34518087,0.00043874863,0.000107967455,0.00034281993,0.0012490778,0.00043086236,0.03966576],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998165,0.000047288773,0.000020542413,0.000056091616,0.00003749901,0.000022109822],"domain_scores_gemma":[0.9992362,0.00052638113,0.000042723652,0.000046801728,0.000114420596,0.000033322052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754275,0.0008388127,0.0003058031,0.00030938222,0.00027692592,0.0013753212,0.00076051586,0.00063884794,0.010661449],"category_scores_gemma":[0.0029151372,0.00019966818,0.00030320516,0.00021017667,0.00039733032,0.0012005412,0.0007007104,0.0006973047,0.0031067568],"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.00066024036,0.00039965715,0.0017781106,0.0006911932,0.00003882717,0.0026960345,0.003109986,0.001605291,0.21023543,0.001825,0.01059186,0.7663684],"study_design_scores_gemma":[0.000564558,0.003700441,0.03802583,0.00090876356,0.00053311785,0.027366258,0.014035555,0.13860397,0.55994916,0.035060305,0.18090998,0.0003421022],"about_ca_topic_score_codex":0.0008351909,"about_ca_topic_score_gemma":0.0017491316,"teacher_disagreement_score":0.010661449,"about_ca_system_score_codex":0.00013291666,"about_ca_system_score_gemma":0.00041456503,"threshold_uncertainty_score":0.035666108},"labels":[],"label_agreement":null},{"id":"W1554003089","doi":"10.1007/3-540-45104-8_4","title":"From UML Descriptions of High-Level Software Architectures to LQN Performance Models","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Graph rewriting; Applications of UML; Programming language; Software system; Software architecture; Software engineering; Graph; Software; Theoretical computer science","score_opus":0.02618091706823653,"score_gpt":0.23262706761776472,"score_spread":0.2064461505495282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554003089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035518657,0.00092503737,0.97467935,0.00068063696,0.00014163008,0.00012781417,0.0017140037,0.004544387,0.013635197],"genre_scores_gemma":[0.12644324,0.0035914867,0.8398196,0.00065605645,0.00016545078,0.00072120666,0.007170356,0.0029968296,0.01843572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858606,0.00047061322,0.00018552017,0.00013031145,0.0005387123,0.000088900466],"domain_scores_gemma":[0.9973869,0.001339916,0.00021508058,0.00038288144,0.0006027466,0.00007252012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018757115,0.0013466239,0.0005166272,0.001979338,0.00059524475,0.003912879,0.0017095146,0.0014180188,0.007919278],"category_scores_gemma":[0.0063930047,0.0012569986,0.0010900352,0.0015374699,0.0013537988,0.003963053,0.0012768941,0.002409385,0.003298465],"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.000103389015,0.00009996694,0.0009302677,0.0010672837,0.00005150001,0.0007316052,0.0033999868,0.08102427,0.010462159,0.73964244,0.018982563,0.14350465],"study_design_scores_gemma":[0.000061425555,0.000053690233,0.00045888338,0.000892425,0.00009100256,0.00049756916,0.000491668,0.20746225,0.016872251,0.36161646,0.41142505,0.0000774402],"about_ca_topic_score_codex":0.008622899,"about_ca_topic_score_gemma":0.0070247385,"teacher_disagreement_score":0.008622899,"about_ca_system_score_codex":0.0017633875,"about_ca_system_score_gemma":0.0018329334,"threshold_uncertainty_score":0.026492655},"labels":[],"label_agreement":null},{"id":"W1554004825","doi":"10.1007/978-3-540-74260-9_60","title":"Logo and Trademark Retrieval in General Image Databases Using Color Edge Gradient Co-occurrence Histograms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Color histogram; Histogram; Artificial intelligence; Trademark; Pattern recognition (psychology); Computer vision; Color image; Color normalization; Image retrieval; Histogram equalization; Enhanced Data Rates for GSM Evolution; Color difference; Image (mathematics); Image processing","score_opus":0.061649364680067605,"score_gpt":0.3177849938339577,"score_spread":0.2561356291538901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554004825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23244236,0.013824245,0.6898653,0.0011503457,0.00064536853,0.0005362522,0.012021095,0.027674263,0.021840801],"genre_scores_gemma":[0.586205,0.00551173,0.35645673,0.0003691352,0.0004102635,0.00020499456,0.018737262,0.00085604214,0.03124888],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995116,0.000051896513,0.0000461862,0.000087610584,0.00023723877,0.000065471955],"domain_scores_gemma":[0.9994367,0.00013347765,0.000049468144,0.00020166177,0.00013611728,0.000042707983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045534977,0.00042596617,0.001311227,0.0038702292,0.0004448913,0.0020539516,0.00083485956,0.00052181433,0.006181344],"category_scores_gemma":[0.0017506492,0.00025302026,0.00053756277,0.0047910386,0.00029205033,0.0031308492,0.00078431313,0.00037110725,0.0036693648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006317798,0.00028013386,0.0032872094,0.0002629291,0.000053327956,0.00020354317,0.00007471621,0.0055602854,0.023770621,0.0046560164,0.034765113,0.9264542],"study_design_scores_gemma":[0.00013498784,0.00033247902,0.02023804,0.000098825454,0.00017003957,0.0020541078,0.0006878621,0.8076838,0.08611017,0.027004374,0.055341404,0.00014385782],"about_ca_topic_score_codex":0.0052576293,"about_ca_topic_score_gemma":0.009453072,"teacher_disagreement_score":0.006181344,"about_ca_system_score_codex":0.00048433564,"about_ca_system_score_gemma":0.00068669673,"threshold_uncertainty_score":0.02067858},"labels":[],"label_agreement":null},{"id":"W1554010179","doi":"10.1007/978-3-540-75538-8_10","title":"Automatic Strategy Verification for Hex","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Correctness; Computer science; Notation; Programming language; Tree (set theory); Theoretical computer science; Algorithm; Arithmetic; Mathematics","score_opus":0.06068119719418439,"score_gpt":0.31847913712450593,"score_spread":0.2577979399303215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554010179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045730934,0.00022214117,0.91284895,0.00035410316,0.00024145897,0.00030267518,0.0010406455,0.012330613,0.026928477],"genre_scores_gemma":[0.713714,0.00018988385,0.2674671,0.00029183895,0.00004410877,0.00020181655,0.0021510066,0.0012987672,0.014641515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859816,0.00025459487,0.000109404595,0.0003074391,0.00041838855,0.00031191861],"domain_scores_gemma":[0.99845684,0.0007495956,0.00007112969,0.00039371065,0.0002861337,0.000042557036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088392774,0.0009629375,0.000980096,0.0008041587,0.0008099797,0.0021371646,0.0012244029,0.0009590143,0.018030217],"category_scores_gemma":[0.0032662787,0.00064975396,0.0016641802,0.0006044553,0.0011319903,0.0026773622,0.0027952895,0.0016381316,0.00466685],"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.0009761894,0.00020896744,0.0017659665,0.0008177775,0.00014312442,0.0009223018,0.00047420617,0.05491518,0.033890165,0.4897629,0.017793102,0.3983302],"study_design_scores_gemma":[0.00014769603,0.00013158888,0.00062598434,0.00014275764,0.00008987303,0.00024433332,0.00026477283,0.32553396,0.051014382,0.6054536,0.016288351,0.000062706844],"about_ca_topic_score_codex":0.002439081,"about_ca_topic_score_gemma":0.0031241577,"teacher_disagreement_score":0.018030217,"about_ca_system_score_codex":0.00095921115,"about_ca_system_score_gemma":0.0015113781,"threshold_uncertainty_score":0.0603171},"labels":[],"label_agreement":null},{"id":"W1554051257","doi":"10.1007/978-3-642-15711-0_37","title":"Surgical Task and Skill Classification from Eye Tracking and Tool Motion in Minimally Invasive Surgery","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":84,"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":"National Cancer Institute; Johns Hopkins University; National Institutes of Health; National Science Foundation","keywords":"Task (project management); Gaze; Surgical simulation; Context (archaeology); Invasive surgery; Eye tracking; Motion (physics); Computer science; Artificial intelligence; Medical physics; Computer vision; Surgery; Medicine; Engineering","score_opus":0.02651912413077506,"score_gpt":0.29263449679777265,"score_spread":0.2661153726669976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554051257","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.9909638,0.00033600797,0.006346115,0.000053429732,0.00004563493,0.000038606806,0.0006540937,0.00009830147,0.0014639802],"genre_scores_gemma":[0.9964122,0.00013511932,0.0020332271,0.000025421314,0.000018698936,0.000019754534,0.0005386876,0.000016330732,0.00080064795],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997789,0.00005550863,0.00002034609,0.00004841627,0.0000504378,0.00004638101],"domain_scores_gemma":[0.9978327,0.0013545237,0.00020241665,0.00008608206,0.00040048352,0.0001237484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069057767,0.00029728768,0.0003581209,0.0010832187,0.00014915131,0.00040917782,0.00021485085,0.00059962954,0.0013178725],"category_scores_gemma":[0.0050049266,0.00012965617,0.00032004184,0.0005399359,0.00012309747,0.00043042333,0.0003056915,0.00029555897,0.00046231397],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004845671,0.0006441827,0.49661547,0.0002570488,0.0002746273,0.00023391799,0.00041228993,0.011773285,0.100266896,0.00020544734,0.0034082923,0.3810629],"study_design_scores_gemma":[0.000038707018,0.000276718,0.9209849,0.000021659702,0.00008083137,0.00023366013,0.00013726977,0.0721353,0.005515413,0.00025007877,0.00029987795,0.000025626483],"about_ca_topic_score_codex":0.0070358603,"about_ca_topic_score_gemma":0.008989357,"teacher_disagreement_score":0.0070358603,"about_ca_system_score_codex":0.00021427192,"about_ca_system_score_gemma":0.0002958688,"threshold_uncertainty_score":0.013989806},"labels":[],"label_agreement":null},{"id":"W1554064029","doi":"10.1007/11839354_17","title":"Improving Example Selection for Agents Teaching Ontology Concepts","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Calgary","funders":"","keywords":"Viewpoints; Ontology; Computer science; Selection (genetic algorithm); Set (abstract data type); Feature (linguistics); Artificial intelligence; Epistemology","score_opus":0.031440299614480985,"score_gpt":0.2854827921764887,"score_spread":0.2540424925620077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554064029","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.15809718,0.0003657599,0.8143645,0.0005417017,0.00012762287,0.00032763687,0.0005705507,0.013704314,0.011900765],"genre_scores_gemma":[0.26882187,0.0001823107,0.7186807,0.00014764915,0.000043114025,0.0001556609,0.0019399036,0.0011360507,0.008892757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984078,0.00054126035,0.00010554049,0.0002783819,0.000545582,0.00012139563],"domain_scores_gemma":[0.9926938,0.0045973863,0.00018320208,0.00085086573,0.0013848913,0.00028984304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017285419,0.00086545356,0.0011645677,0.001543057,0.0010355711,0.0013614271,0.0019851255,0.0012106784,0.021729179],"category_scores_gemma":[0.012284627,0.0005810493,0.00090650655,0.0013476477,0.00029724545,0.0029499414,0.0020212065,0.0011756703,0.004538227],"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.0013292595,0.00059621927,0.004636807,0.00028760787,0.00008127313,0.00025143803,0.00060273893,0.0129887285,0.018284762,0.006514897,0.018555101,0.9358711],"study_design_scores_gemma":[0.00051390036,0.00036431715,0.0033022459,0.00011219568,0.00029046283,0.0006022994,0.0011765474,0.8616852,0.064769164,0.027037516,0.040063675,0.0000824907],"about_ca_topic_score_codex":0.0033119475,"about_ca_topic_score_gemma":0.006311604,"teacher_disagreement_score":0.021729179,"about_ca_system_score_codex":0.0006803682,"about_ca_system_score_gemma":0.0012101146,"threshold_uncertainty_score":0.07269132},"labels":[],"label_agreement":null},{"id":"W1554082442","doi":"10.1007/978-3-642-14064-8_56","title":"Gesture Recognition in the Haptic Creature","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":33,"is_retracted":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":"Gesture; Computer science; Haptic technology; Gesture recognition; Robot; Artificial intelligence; Human–computer interaction; Computer vision; Speech recognition","score_opus":0.04104044847069832,"score_gpt":0.3270725089049869,"score_spread":0.2860320604342886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554082442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11036415,0.009585981,0.80334663,0.0006150083,0.00045284335,0.000064468266,0.00031872877,0.0027818105,0.072470345],"genre_scores_gemma":[0.78578854,0.0030893914,0.15766048,0.00018038943,0.00014062495,0.00005526018,0.00032419726,0.00032426,0.052436776],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999772,0.0000430893,0.00000959666,0.000078704645,0.000055722416,0.0000408233],"domain_scores_gemma":[0.9997168,0.00011929743,0.000029491766,0.00007095627,0.000041505104,0.000022009983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034792876,0.00032672036,0.0004962497,0.000407015,0.0002878203,0.0016913499,0.0008759049,0.0011714363,0.0068979957],"category_scores_gemma":[0.0012530963,0.0003251818,0.00037893796,0.00053434283,0.0011747787,0.0024016371,0.00082324765,0.0005887808,0.002003666],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025342568,0.000038263053,0.0013123393,0.0004586177,0.000034033514,0.00055577856,0.0010577587,0.007422337,0.36483005,0.065855145,0.0051537156,0.5530285],"study_design_scores_gemma":[0.000081425256,0.00079783937,0.040754277,0.0007359671,0.00012018011,0.005139964,0.002099998,0.33907053,0.3885166,0.1282133,0.094111465,0.0003585545],"about_ca_topic_score_codex":0.0011377312,"about_ca_topic_score_gemma":0.00093733025,"teacher_disagreement_score":0.0068979957,"about_ca_system_score_codex":0.00022434918,"about_ca_system_score_gemma":0.00021979866,"threshold_uncertainty_score":0.023076057},"labels":[],"label_agreement":null},{"id":"W1554100114","doi":"10.1007/978-3-642-02846-5_17","title":"Merging Logic Programs under Answer Set Semantics","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Multiset; Logic programming; Answer set programming; Stable model semantics; Logic program; Theoretical computer science; Programming language; Formalism (music); Semantics (computer science); Set (abstract data type); Well-founded semantics; Description logic; Operational semantics; Mathematics; Denotational semantics; Discrete mathematics","score_opus":0.029611324319468488,"score_gpt":0.2624571032124359,"score_spread":0.23284577889296743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554100114","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.022071235,0.00049499044,0.9562932,0.0010257751,0.00016125148,0.00018272933,0.00039250863,0.005384071,0.01399422],"genre_scores_gemma":[0.23743267,0.00060263014,0.7484311,0.0006121856,0.0002449082,0.00026430996,0.0024737306,0.0017528048,0.008185686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937716,0.0017877031,0.0005931135,0.00087995967,0.002416535,0.0005511265],"domain_scores_gemma":[0.9909956,0.005763059,0.00035050436,0.0015593498,0.0011043155,0.00022721654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004891569,0.0008837685,0.0013178613,0.002256068,0.0016039754,0.0045452723,0.0039256937,0.002127866,0.008367395],"category_scores_gemma":[0.015582558,0.0013062124,0.002334153,0.0030410904,0.0025162245,0.014578261,0.0067610745,0.0033586079,0.0021529028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005125351,0.00024743978,0.00085022685,0.0005371281,0.00017010409,0.00044503796,0.0016718075,0.013822926,0.011701396,0.68573177,0.010818504,0.2734911],"study_design_scores_gemma":[0.00009744931,0.00007923819,0.00025426663,0.00009808219,0.00019553224,0.0002237141,0.00026789837,0.049112935,0.020833803,0.9047398,0.024045547,0.00005178367],"about_ca_topic_score_codex":0.0010980892,"about_ca_topic_score_gemma":0.0012775565,"teacher_disagreement_score":0.008367395,"about_ca_system_score_codex":0.0012711224,"about_ca_system_score_gemma":0.00141449,"threshold_uncertainty_score":0.027991712},"labels":[],"label_agreement":null},{"id":"W1554118774","doi":"10.1007/3-540-45061-0_76","title":"Locally Commutative Categories","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Variety (cybernetics); Commutative property; Monoid; Characterization (materials science); Mathematics; Pure mathematics; Algebra over a field; Physics","score_opus":0.012707246946327678,"score_gpt":0.23440598915890878,"score_spread":0.2216987422125811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554118774","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019790137,0.0052248603,0.044526197,0.0012455393,0.0005969052,0.000036733774,0.00039502326,0.0004585259,0.9277261],"genre_scores_gemma":[0.399293,0.0046139825,0.017566895,0.00058343343,0.00089938147,0.00012711204,0.0009777341,0.00035206464,0.5755864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997583,0.00004342194,0.000011562802,0.000057495763,0.000096751115,0.000032465876],"domain_scores_gemma":[0.99979657,0.000054993285,0.0000119076585,0.000049686558,0.0000557786,0.000031017913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887845,0.00046021593,0.000475558,0.0012741212,0.0013397997,0.0022461698,0.00047383824,0.00038485596,0.030314906],"category_scores_gemma":[0.00050436286,0.00029437026,0.00031468747,0.0012074881,0.0017346893,0.003587744,0.0014014082,0.0013396459,0.005545053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046495466,0.0000038800654,0.000031157062,0.000028312123,0.0000025226836,0.000018221615,0.00021103799,0.000065757566,0.00042159442,0.98448426,0.005984384,0.008744291],"study_design_scores_gemma":[0.000004138449,0.0000091798265,0.00016900757,0.000018372342,0.0000068201502,0.00016471554,0.00012570758,0.00023653058,0.00062879117,0.8522536,0.14637768,0.0000054864513],"about_ca_topic_score_codex":0.00054967613,"about_ca_topic_score_gemma":0.00064141856,"teacher_disagreement_score":0.030314906,"about_ca_system_score_codex":0.0009951328,"about_ca_system_score_gemma":0.0005251422,"threshold_uncertainty_score":0.10141343},"labels":[],"label_agreement":null},{"id":"W1554139122","doi":"10.1007/11527886_18","title":"Using Similarity to Infer Meta-cognitive Behaviors During Analogical Problem Solving","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Similarity (geometry); Exploit; Key (lock); Artificial intelligence; Metacognition; Analogical reasoning; Cognition; Machine learning; Analogy","score_opus":0.0725316314571968,"score_gpt":0.3011300764468898,"score_spread":0.22859844498969303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554139122","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.9080975,0.00025302844,0.08534653,0.000094536204,0.000038013077,0.0001318692,0.0002876944,0.00066903717,0.0050817397],"genre_scores_gemma":[0.9794964,0.000055344546,0.019653194,0.00002218627,0.00000894432,0.000042872387,0.00024076231,0.000037270634,0.0004430645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00023725879,0.00005216822,0.00021108755,0.00018415738,0.000047158923],"domain_scores_gemma":[0.99411494,0.0038649633,0.000690371,0.00062308944,0.0004696739,0.00023695976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008168202,0.00031299752,0.0004035808,0.0011443021,0.0002447272,0.0008011196,0.0005251722,0.00057443266,0.0020738838],"category_scores_gemma":[0.015266224,0.0003171288,0.00034635066,0.0008021127,0.0002921968,0.0015409369,0.0007966157,0.00063096103,0.00045540207],"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.0021182254,0.0011250696,0.23992194,0.00035229008,0.00043640143,0.00027251858,0.0025669977,0.01744535,0.061205186,0.0039397283,0.0018591838,0.6687572],"study_design_scores_gemma":[0.00016404476,0.001285941,0.35641304,0.00006191689,0.00021227915,0.0006966701,0.0011052843,0.5804835,0.027006779,0.030614967,0.001865879,0.00008964358],"about_ca_topic_score_codex":0.0022610088,"about_ca_topic_score_gemma":0.0024838557,"teacher_disagreement_score":0.0022610088,"about_ca_system_score_codex":0.00029406085,"about_ca_system_score_gemma":0.0003538941,"threshold_uncertainty_score":0.0069378614},"labels":[],"label_agreement":null},{"id":"W1554198265","doi":"10.1007/978-3-540-31849-1_33","title":"Making DTD a Truly Powerful Schema Language","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Computer science; Schema (genetic algorithms); Programming language; Natural language processing; Information retrieval; Artificial intelligence","score_opus":0.02090417509429613,"score_gpt":0.2752320241306938,"score_spread":0.25432784903639766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554198265","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.0013414886,0.00030923384,0.9838457,0.00093707145,0.00046122906,0.0000563564,0.0011609638,0.0074312347,0.004456668],"genre_scores_gemma":[0.03200141,0.0011454644,0.94090134,0.0012267225,0.0002810306,0.00021640013,0.004481382,0.00542465,0.014321568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968809,0.00056216464,0.0005120144,0.0007069829,0.0012026947,0.00013510943],"domain_scores_gemma":[0.99522084,0.0014100841,0.00015296863,0.002444969,0.00060356193,0.00016765585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004102395,0.0007866545,0.0008290013,0.0014291336,0.0007514686,0.0044545103,0.002690066,0.0011555959,0.010072646],"category_scores_gemma":[0.008219545,0.0015284227,0.0018167901,0.0021467756,0.0017071433,0.011404391,0.004831847,0.004620838,0.006150811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011576128,0.00005535203,0.0006844825,0.00056522636,0.000093068804,0.0002067872,0.0006019877,0.0029282605,0.012449036,0.5970417,0.06442804,0.32083035],"study_design_scores_gemma":[0.000047878086,0.000030220988,0.00010617831,0.0001350106,0.000107201784,0.0005319201,0.00009402474,0.017908676,0.02207925,0.32323962,0.6356733,0.00004680013],"about_ca_topic_score_codex":0.0009153643,"about_ca_topic_score_gemma":0.0012044545,"teacher_disagreement_score":0.010072646,"about_ca_system_score_codex":0.0009820206,"about_ca_system_score_gemma":0.0017192675,"threshold_uncertainty_score":0.033696353},"labels":[],"label_agreement":null},{"id":"W1554247483","doi":"10.1007/978-3-540-77046-6_22","title":"Multiscale Boundary Identification for Medical Images","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Identification (biology); Boundary (topology); Computer science; Artificial intelligence; Segmentation; Task (project management); Computer vision; Object (grammar); Operator (biology); Image (mathematics); Image segmentation; Pattern recognition (psychology); Mathematics; Engineering","score_opus":0.022179599693414615,"score_gpt":0.3218266724970275,"score_spread":0.2996470728036129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554247483","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.0038753904,0.0012480557,0.9914814,0.00009994224,0.000049013586,0.000025707563,0.000058332218,0.0008284681,0.0023336003],"genre_scores_gemma":[0.058095716,0.0020875032,0.9310069,0.00009703001,0.00009958759,0.00006471148,0.00033458517,0.0005001391,0.0077136955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980885,0.000024049312,0.000010384221,0.000041956748,0.00009690607,0.000017906717],"domain_scores_gemma":[0.99974924,0.00010007525,0.000026037218,0.000055325974,0.000055271918,0.0000140693255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033784268,0.00046648973,0.000845274,0.0010770479,0.00018762953,0.00089869427,0.00068888115,0.0008823599,0.005261806],"category_scores_gemma":[0.0011472043,0.0004961792,0.0006067696,0.00081177073,0.00038926082,0.00094748894,0.00077657675,0.000864647,0.002653722],"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.000077082965,0.00003471732,0.00022787105,0.0005174146,0.000039925486,0.00020522314,0.00014148687,0.018466918,0.21035382,0.04733821,0.009995366,0.71260196],"study_design_scores_gemma":[0.000022822567,0.000107447806,0.0018985644,0.0001379657,0.00008011792,0.0016263956,0.00008369248,0.7460673,0.11135125,0.08718133,0.051389888,0.00005321274],"about_ca_topic_score_codex":0.00037344193,"about_ca_topic_score_gemma":0.0004846104,"teacher_disagreement_score":0.005261806,"about_ca_system_score_codex":0.0002514463,"about_ca_system_score_gemma":0.00023017355,"threshold_uncertainty_score":0.017602503},"labels":[],"label_agreement":null},{"id":"W1554277184","doi":"10.1007/978-3-540-73545-8_49","title":"Priority Algorithms for the Subset-Sum Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Key (lock); Greedy algorithm; Algorithm; Approximation algorithm; Power (physics); Simple (philosophy); Order (exchange); Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.046083054014039206,"score_gpt":0.28702786996586904,"score_spread":0.24094481595182984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554277184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014633065,0.0016647681,0.9610617,0.0012762097,0.000594766,0.00019686876,0.00023435375,0.0012503641,0.019087855],"genre_scores_gemma":[0.2360728,0.003108773,0.7284222,0.00077894,0.00150887,0.0005146324,0.0010500182,0.0009777996,0.027565997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979796,0.00054468523,0.00013210365,0.00033321066,0.0006746452,0.00033578515],"domain_scores_gemma":[0.9939434,0.0035416454,0.00027854063,0.0011750037,0.0006294484,0.00043202558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031984916,0.0014290104,0.0023728192,0.001422821,0.002068028,0.0043274793,0.004393613,0.0016401346,0.013178584],"category_scores_gemma":[0.010601914,0.00087899674,0.0014507123,0.0030671952,0.0013144221,0.008238085,0.0031911875,0.0051238528,0.0033797657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007364012,0.0004345312,0.00036235648,0.00054362183,0.000073881216,0.000046462555,0.0003185956,0.034277298,0.0027661882,0.6296897,0.030103315,0.30064765],"study_design_scores_gemma":[0.0002143398,0.00013321041,0.00013646673,0.00004470739,0.000053935124,0.00011368054,0.0000899746,0.14296737,0.0018203757,0.8434103,0.010986545,0.00002896887],"about_ca_topic_score_codex":0.0014544894,"about_ca_topic_score_gemma":0.0020438635,"teacher_disagreement_score":0.013178584,"about_ca_system_score_codex":0.0022620566,"about_ca_system_score_gemma":0.0023892806,"threshold_uncertainty_score":0.044086754},"labels":[],"label_agreement":null},{"id":"W1554346544","doi":"10.1007/978-3-540-27777-4_41","title":"First Encounter with Agile Methods","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Agile software development; Scrum; Extreme programming; Popularity; Extreme programming practices; Agile Unified Process; User story; Computer science; Agile usability engineering; Order (exchange); Software; Software engineering; Software development; Management science; Engineering; Software development process; Psychology; Business","score_opus":0.016860149210102707,"score_gpt":0.2840244327893491,"score_spread":0.2671642835792464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554346544","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.020481862,0.08377967,0.071700834,0.124104805,0.012312098,0.00008471109,0.00012861264,0.0008645072,0.68654287],"genre_scores_gemma":[0.11517156,0.04510185,0.034075383,0.022074215,0.0035718605,0.00010342388,0.00016488691,0.0009663135,0.7787705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974419,0.0011405403,0.000086299246,0.0002313998,0.0008390775,0.00026074087],"domain_scores_gemma":[0.9969963,0.001496914,0.0001167667,0.00036643402,0.00040493105,0.0006187807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042049782,0.0008042112,0.00060241786,0.0016660247,0.0046640136,0.0074923513,0.0009322717,0.0033745447,0.030262345],"category_scores_gemma":[0.006692502,0.00068313506,0.00065354956,0.0020305628,0.0038628331,0.009360762,0.0057932776,0.009373439,0.009907363],"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.00006054343,0.00015637594,0.000923082,0.00035933143,0.00002344645,0.0019789455,0.035016183,0.00021450553,0.0017176939,0.3561233,0.281668,0.32175863],"study_design_scores_gemma":[0.0000026475295,0.00002468248,0.00015118468,0.00022133178,0.0000021349085,0.0011386075,0.003231429,0.00007465564,0.00022036483,0.021145953,0.973776,0.000011041204],"about_ca_topic_score_codex":0.0007986222,"about_ca_topic_score_gemma":0.0023797634,"teacher_disagreement_score":0.030262345,"about_ca_system_score_codex":0.002330558,"about_ca_system_score_gemma":0.0014804777,"threshold_uncertainty_score":0.101237655},"labels":[],"label_agreement":null},{"id":"W1554401943","doi":"10.1007/978-3-642-01815-2_13","title":"Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Generality; Hasse diagram; Computation; Formal concept analysis; Scalability; Theoretical computer science; Lattice (music); Image stitching; Algorithm; Set (abstract data type); Data mining; Partially ordered set; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Database","score_opus":0.023080369117880268,"score_gpt":0.26221181861366466,"score_spread":0.23913144949578438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554401943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022966072,0.00016026749,0.99228066,0.00014094907,0.000116565505,0.00006113338,0.00014463063,0.0016262537,0.0031728547],"genre_scores_gemma":[0.017609507,0.000118157,0.97929364,0.000055029912,0.000024625291,0.00006223628,0.00028017722,0.00025657308,0.0023001044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987198,0.00030167666,0.000093855204,0.00035327172,0.00044916093,0.00008230606],"domain_scores_gemma":[0.99802554,0.0007422437,0.000053133175,0.00069338223,0.0004051651,0.000080550926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326251,0.0012107741,0.001452961,0.001636275,0.0010755233,0.0040179016,0.0016898321,0.0014437394,0.032881267],"category_scores_gemma":[0.0047440673,0.0008759284,0.0019273482,0.0024349657,0.00090916385,0.005607249,0.0024875186,0.0031752354,0.007630231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021693142,0.000115723575,0.0004542287,0.0006058372,0.00012823915,0.0001360703,0.00038022545,0.019278409,0.012899709,0.17900571,0.013660444,0.7731184],"study_design_scores_gemma":[0.0002357787,0.00022230303,0.00043678758,0.00017921659,0.00014309473,0.00060773024,0.0005291414,0.25040847,0.017083041,0.62433696,0.10570759,0.00010991194],"about_ca_topic_score_codex":0.0034269942,"about_ca_topic_score_gemma":0.0060839113,"teacher_disagreement_score":0.032881267,"about_ca_system_score_codex":0.00096681324,"about_ca_system_score_gemma":0.001976217,"threshold_uncertainty_score":0.10999876},"labels":[],"label_agreement":null},{"id":"W1554418054","doi":"10.1007/978-3-540-45209-6_148","title":"Performance Evaluation of Two Congestion Control Mechanisms with On-Demand Distance Vector (AODV) Routing Protocol for Mobile and Wireless Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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 Ottawa","funders":"","keywords":"Computer science; Wireless Routing Protocol; Computer network; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Distance-vector routing protocol; Destination-Sequenced Distance Vector routing; Zone Routing Protocol; Wireless ad hoc network; Distributed computing; Routing protocol; Mobile ad hoc network; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.016009693867761795,"score_gpt":0.2682478248544917,"score_spread":0.2522381309867299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554418054","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.97569543,0.001982872,0.016779907,0.00019196837,0.00024944256,0.0001543183,0.0001473319,0.0008188553,0.0039797947],"genre_scores_gemma":[0.99535084,0.00023043601,0.003154617,0.000019629359,0.0000231701,0.000025747735,0.00009942426,0.00002499257,0.0010711754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817085,0.000521137,0.00011025953,0.00019755356,0.0006860467,0.00031406572],"domain_scores_gemma":[0.9926783,0.0044043884,0.0004900529,0.0004703001,0.001622358,0.0003345983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430329,0.001119537,0.0009528011,0.0013924257,0.00059797365,0.0010181842,0.0016864032,0.0008786304,0.0014609743],"category_scores_gemma":[0.0054886676,0.0002753865,0.00031936524,0.00079584407,0.0006452903,0.0012170433,0.000537219,0.00052013417,0.0001609009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.027730858,0.0049758772,0.016204065,0.0014738145,0.000835816,0.00059839047,0.0006490488,0.41945133,0.20173147,0.005976946,0.0061920094,0.31418034],"study_design_scores_gemma":[0.00071759545,0.011289265,0.009773679,0.000031931733,0.0006073218,0.00029151488,0.00034724435,0.875259,0.09922583,0.000846969,0.0014939622,0.000115738956],"about_ca_topic_score_codex":0.0053294674,"about_ca_topic_score_gemma":0.003328517,"teacher_disagreement_score":0.0053294674,"about_ca_system_score_codex":0.0012686828,"about_ca_system_score_gemma":0.000700054,"threshold_uncertainty_score":0.012852967},"labels":[],"label_agreement":null},{"id":"W1554432800","doi":"10.1007/978-3-642-27269-1_10","title":"Systems-Theoretic View of Component-Based Software Development","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Université de Sherbrooke","funders":"","keywords":"Liveness; Computer science; Component (thermodynamics); Predictability; Hierarchy; Controller (irrigation); Task (project management); Control (management); Perspective (graphical); Software; Software development; Supervisory control theory; Distributed computing; Supervisory control; Systems engineering; Artificial intelligence; Programming language; Mathematics; Engineering","score_opus":0.02504711163928686,"score_gpt":0.23975013156628833,"score_spread":0.21470301992700147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554432800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073939445,0.0076704947,0.8512031,0.0030870275,0.0003988926,0.00007711532,0.00012877601,0.0002938087,0.12974682],"genre_scores_gemma":[0.583574,0.011978234,0.35765418,0.0012628196,0.0011994736,0.00045153685,0.00039730128,0.00018588135,0.043296546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923766,0.00023099832,0.00004413375,0.00009062198,0.00034447416,0.000052044936],"domain_scores_gemma":[0.9994517,0.00029132018,0.000032876193,0.000076800774,0.00010899052,0.00003825183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009046498,0.0009784045,0.000618276,0.0013884665,0.00071134354,0.0039485507,0.0020577936,0.0011460324,0.003949299],"category_scores_gemma":[0.0012494279,0.0006331263,0.00091948616,0.001277371,0.003933931,0.0033926794,0.0010388498,0.0030729335,0.0008221678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028471684,0.000008493479,0.00003109957,0.000038101996,0.000008239576,0.000028992965,0.00008463113,0.003986712,0.000234896,0.9922695,0.00049544085,0.0028110421],"study_design_scores_gemma":[0.000009077777,0.0000130389035,0.0000696422,0.000024803454,0.000017766644,0.000057062556,0.000034640074,0.016978756,0.00034186893,0.96517557,0.017272087,0.000005848312],"about_ca_topic_score_codex":0.0029206949,"about_ca_topic_score_gemma":0.001829709,"teacher_disagreement_score":0.003949299,"about_ca_system_score_codex":0.002271545,"about_ca_system_score_gemma":0.0012008665,"threshold_uncertainty_score":0.01648134},"labels":[],"label_agreement":null},{"id":"W1554583167","doi":"10.1007/978-3-540-74484-9_79","title":"Building Web Application Fragments Using Presentation Framework","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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":"Polytechnique Montréal","funders":"","keywords":"Asynchronous communication; Computer science; Presentation (obstetrics); Design pattern; Web application; Software design pattern; Distributed computing; Software engineering; Programming language; World Wide Web; Computer network","score_opus":0.031028389023951285,"score_gpt":0.31329952189195354,"score_spread":0.28227113286800226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554583167","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.019497482,0.00033681825,0.9314617,0.00009109252,0.00007765023,0.00034078467,0.000511685,0.04175842,0.0059243618],"genre_scores_gemma":[0.1270613,0.0007602306,0.8359544,0.00013601124,0.00004702041,0.00053424184,0.004798756,0.012233875,0.018474143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.000047014735,0.000034180695,0.00008648232,0.0001808809,0.0000630097],"domain_scores_gemma":[0.9993717,0.00018617803,0.00003204682,0.00020072846,0.000132152,0.00007727878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059190975,0.0013299551,0.0010334556,0.0014222385,0.0008698149,0.0017606525,0.001948164,0.0011902358,0.012585008],"category_scores_gemma":[0.0017917875,0.0010422098,0.0019538444,0.0012073118,0.000545016,0.0032230772,0.0025494534,0.0018301107,0.0049054893],"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.0007182715,0.0006466811,0.002806903,0.0014430619,0.00017589482,0.0023250212,0.001192355,0.04365327,0.11793748,0.028596532,0.035526533,0.764978],"study_design_scores_gemma":[0.0002505396,0.0005181769,0.0024513167,0.0003676363,0.00048327618,0.0027916238,0.0005181631,0.4890537,0.21804713,0.04265063,0.24263975,0.00022809168],"about_ca_topic_score_codex":0.0035403566,"about_ca_topic_score_gemma":0.0026360145,"teacher_disagreement_score":0.012585008,"about_ca_system_score_codex":0.0005240356,"about_ca_system_score_gemma":0.00084154104,"threshold_uncertainty_score":0.042101085},"labels":[],"label_agreement":null},{"id":"W1554612648","doi":"10.1007/3-540-45720-8_38","title":"Bistable Gradient Neural Networks: Their Computational Properties","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bistability; Spurious relationship; Computer science; Artificial neural network; Attractor; Hopfield network; Coupling (piping); Topology (electrical circuits); Artificial intelligence; Physics; Mathematics; Machine learning; Materials science","score_opus":0.024828242152620868,"score_gpt":0.22467505415401337,"score_spread":0.1998468120013925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554612648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27107552,0.004883326,0.6741231,0.0018762472,0.00022599821,0.00006786874,0.00044856302,0.000835504,0.0464638],"genre_scores_gemma":[0.94391125,0.0014746649,0.04502339,0.00024469462,0.00018954773,0.00009425779,0.00016768563,0.0001477485,0.008746709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999224,0.000019185618,0.0000034730813,0.000017843391,0.000026369464,0.000010770505],"domain_scores_gemma":[0.9987525,0.00088411715,0.00012906069,0.000089728266,0.00008866616,0.000055897744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003030205,0.00027849575,0.00043476996,0.00041573687,0.00030867927,0.0008662414,0.0006133596,0.00082306453,0.0036385045],"category_scores_gemma":[0.003931725,0.00027233709,0.00019061331,0.0005273364,0.0007739423,0.0015578573,0.0005300289,0.0008296252,0.00032556182],"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.00009594515,0.00003069892,0.00083571236,0.00012952751,0.000020036136,0.00009397301,0.00009506423,0.073459126,0.00765579,0.8580742,0.003164524,0.056345332],"study_design_scores_gemma":[0.000016621425,0.0000222665,0.00059435325,0.00001533997,0.0000085763095,0.00012252464,0.000015215312,0.54483145,0.0015591023,0.4516189,0.0011833091,0.000012351735],"about_ca_topic_score_codex":0.000543905,"about_ca_topic_score_gemma":0.00071772636,"teacher_disagreement_score":0.0036385045,"about_ca_system_score_codex":0.00036788263,"about_ca_system_score_gemma":0.00023698862,"threshold_uncertainty_score":0.012172043},"labels":[],"label_agreement":null},{"id":"W1554687505","doi":"10.1007/3-540-39195-9_5","title":"Software Configuration Management Related to the Management of Distributed Systems and Service-Oriented Architectures","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Dynamism; Software configuration management; Configuration Management (ITSM); Software as a service; Service (business); Software engineering; Software; Application lifecycle management; Software system; Software development; Process management; Software construction; Operating system; Engineering; Computer network; Business","score_opus":0.01729710530411191,"score_gpt":0.25329379109574635,"score_spread":0.23599668579163444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554687505","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.01659391,0.086857006,0.59581876,0.0037439594,0.0038489092,0.00020870102,0.00017429808,0.003344532,0.28940988],"genre_scores_gemma":[0.34715027,0.12117765,0.24415955,0.0019217053,0.0071439007,0.00044816462,0.0015716155,0.0015486086,0.27487847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935573,0.00014106417,0.000045586756,0.00012202347,0.00027596645,0.000059663485],"domain_scores_gemma":[0.9991769,0.00036527944,0.00008203029,0.00018223461,0.00012002705,0.00007342622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831011,0.00094773376,0.00073437026,0.001505504,0.0010271159,0.0027822517,0.0015602324,0.0015781868,0.008057505],"category_scores_gemma":[0.0018255762,0.0006404967,0.000536443,0.005679928,0.001612332,0.003332745,0.0011572917,0.0020359764,0.0024546317],"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.000055874178,0.0001456707,0.0005684325,0.00063130417,0.00003642351,0.00038408258,0.0006486768,0.01991726,0.005599687,0.26920673,0.044171926,0.6586339],"study_design_scores_gemma":[0.00002049814,0.00012242877,0.0015541873,0.00067633257,0.0000646243,0.0015798988,0.00025792886,0.051328015,0.0057859668,0.4684059,0.47013977,0.000064452586],"about_ca_topic_score_codex":0.00094943866,"about_ca_topic_score_gemma":0.0010221701,"teacher_disagreement_score":0.008057505,"about_ca_system_score_codex":0.0010035961,"about_ca_system_score_gemma":0.0008184212,"threshold_uncertainty_score":0.026955068},"labels":[],"label_agreement":null},{"id":"W1554796723","doi":"10.1007/3-540-46105-1_24","title":"Finding Similar Queries to Satisfy Searches Based on Query Traces","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":45,"is_retracted":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":"Computer science; Information retrieval; Web query classification; Search engine; Web search query; Similarity (geometry); Query expansion; Task (project management); Spatial query; Disappointment; Query language; Sargable; Query optimization; Variety (cybernetics); Search-oriented architecture; Ranking (information retrieval); Data mining; Artificial intelligence","score_opus":0.039374169030028223,"score_gpt":0.2637484585050917,"score_spread":0.2243742894750635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554796723","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.74615854,0.0016264502,0.23623364,0.0018094821,0.00014080608,0.0007322758,0.0032941634,0.0066175577,0.0033871022],"genre_scores_gemma":[0.8563855,0.0005289022,0.13304687,0.0002888143,0.00014244186,0.00018777364,0.006816828,0.00068142964,0.0019214054],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932921,0.0009499323,0.00086412474,0.0009868486,0.003230663,0.00067631446],"domain_scores_gemma":[0.97004145,0.018941974,0.0015897754,0.0038278014,0.0042205746,0.0013784812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033540397,0.0011752655,0.002311336,0.006860778,0.0015285675,0.0038264312,0.0022744301,0.0022825545,0.0023471352],"category_scores_gemma":[0.03661977,0.0008740599,0.0016766445,0.005087417,0.0011898152,0.007966313,0.002271103,0.0021005545,0.0009987768],"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.006763405,0.0029599671,0.198836,0.0023886203,0.0015284749,0.002629296,0.0047747265,0.068086796,0.15861471,0.0358534,0.021499997,0.49606472],"study_design_scores_gemma":[0.00021833795,0.000930008,0.016170213,0.000118618766,0.00064667594,0.002161176,0.0023303223,0.8823588,0.04429063,0.042357627,0.008287021,0.0001306135],"about_ca_topic_score_codex":0.0054953117,"about_ca_topic_score_gemma":0.008153332,"teacher_disagreement_score":0.006860778,"about_ca_system_score_codex":0.0011172385,"about_ca_system_score_gemma":0.0030165724,"threshold_uncertainty_score":0.017738104},"labels":[],"label_agreement":null},{"id":"W1554811214","doi":"10.1007/978-3-540-30191-2_28","title":"Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canada Research Chairs","keywords":"Destination-Sequenced Distance Vector routing; Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Routing protocol; Distance-vector routing protocol; Zone Routing Protocol; Network packet","score_opus":0.014502823052608423,"score_gpt":0.2547890168051272,"score_spread":0.2402861937525188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554811214","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.07773242,0.0051080626,0.86916447,0.0007121769,0.0013235168,0.00016615896,0.00027100026,0.0023479692,0.043174192],"genre_scores_gemma":[0.6739295,0.006895626,0.26857382,0.00032664035,0.00036810682,0.00013972507,0.0006899714,0.00032118763,0.048755474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969184,0.000060265178,0.000023663828,0.00003767664,0.00015905433,0.000027439632],"domain_scores_gemma":[0.99950147,0.00015703755,0.00004976587,0.0001335119,0.00013109784,0.000027116957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535745,0.00028999767,0.00040888478,0.0004411028,0.00027456722,0.00076262775,0.00052880513,0.0005177798,0.0016929471],"category_scores_gemma":[0.0013261599,0.00023624256,0.00019104128,0.00037266593,0.000445402,0.0014271322,0.0008977075,0.0005328283,0.0011739586],"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.00033496745,0.000067097586,0.0014222797,0.00047344423,0.00005102325,0.0004057295,0.0003923252,0.016000144,0.10348539,0.09634678,0.01927272,0.7617481],"study_design_scores_gemma":[0.00015207838,0.0010020562,0.0016800882,0.00028324034,0.00014945088,0.0035855793,0.00027959977,0.28530535,0.23031317,0.08857369,0.38854608,0.00012965326],"about_ca_topic_score_codex":0.00031061552,"about_ca_topic_score_gemma":0.00036179196,"teacher_disagreement_score":0.0016929471,"about_ca_system_score_codex":0.00020385724,"about_ca_system_score_gemma":0.0005483561,"threshold_uncertainty_score":0.005663514},"labels":[],"label_agreement":null},{"id":"W1554852049","doi":"10.1007/978-3-642-15369-3_25","title":"Maximum Flows on Disjoint Paths","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Disjoint sets; Upper and lower bounds; Combinatorics; Maximum flow problem; Mathematics; Path (computing); Enhanced Data Rates for GSM Evolution; Flow (mathematics); Simple (philosophy); Constant (computer programming); Flow network; Planar; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.01871409523069201,"score_gpt":0.2704832735398518,"score_spread":0.2517691783091598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554852049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10639232,0.0050730715,0.49471113,0.002807425,0.00074709434,0.00022202216,0.0010927126,0.0006101934,0.38834396],"genre_scores_gemma":[0.54251444,0.010513463,0.29789355,0.00084695994,0.001385881,0.0006964006,0.0021620907,0.0007909954,0.14319621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952507,0.00010825502,0.000026583106,0.000117315,0.00014765993,0.00007521188],"domain_scores_gemma":[0.99843544,0.0010727886,0.00009461978,0.00014846353,0.00012317547,0.00012543717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057405117,0.0011346007,0.00091314426,0.002092672,0.001559313,0.001823092,0.0010526929,0.0009928411,0.012819851],"category_scores_gemma":[0.0032590448,0.0010997473,0.00094679784,0.0027770572,0.0013295669,0.006250375,0.002683163,0.00306506,0.0013059673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007250557,0.00003265677,0.000104046616,0.00027021373,0.000018646098,0.000049376937,0.00019561968,0.0067590303,0.0018133873,0.9310666,0.007992003,0.05162591],"study_design_scores_gemma":[0.000013265243,0.000013412998,0.0001232672,0.000041443192,0.000012089814,0.000077298515,0.000037568705,0.0056086434,0.0005925527,0.9825508,0.010922806,0.0000067801807],"about_ca_topic_score_codex":0.00047235572,"about_ca_topic_score_gemma":0.0006171215,"teacher_disagreement_score":0.012819851,"about_ca_system_score_codex":0.0010546765,"about_ca_system_score_gemma":0.00054199714,"threshold_uncertainty_score":0.042886674},"labels":[],"label_agreement":null},{"id":"W1554979559","doi":"10.1007/978-3-540-77966-7_15","title":"Exploiting Shared Structure in Software Verification Conditions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dataflow; Exploit; Granularity; Software verification; Data-flow analysis; Context (archaeology); Software; Data structure; Distributed computing; Code (set theory); Parallel computing; Data flow diagram; Programming language; Software system; Software construction; Database","score_opus":0.03528894889525886,"score_gpt":0.281387366251264,"score_spread":0.24609841735600513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554979559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011884644,0.00026741443,0.9748141,0.00031910712,0.00010835682,0.00009899677,0.0000650148,0.0006954921,0.011746946],"genre_scores_gemma":[0.5088626,0.0005365874,0.47870576,0.000273617,0.00024898502,0.0003744312,0.00028428066,0.00054893823,0.010164733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946188,0.0016206257,0.00038095753,0.0007468256,0.0022076964,0.00042504474],"domain_scores_gemma":[0.98824954,0.0072829444,0.00047132396,0.003029405,0.00080206303,0.00016477477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037163093,0.00092143577,0.000964107,0.0012694891,0.0011127298,0.0020399205,0.0018928834,0.0013493398,0.006211006],"category_scores_gemma":[0.012912035,0.0012053755,0.0015617112,0.0013252251,0.005095555,0.012789537,0.0053080595,0.003826039,0.0015355262],"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.000121497615,0.000036058318,0.00018291644,0.00018946362,0.000028831277,0.00019888899,0.00034504748,0.007901,0.0042909314,0.9283557,0.0013461141,0.057003632],"study_design_scores_gemma":[0.000036522804,0.00006419262,0.00008498839,0.00007224953,0.00003944032,0.00014865358,0.000043586984,0.028884882,0.010557929,0.95195484,0.008088378,0.000024366005],"about_ca_topic_score_codex":0.0004028349,"about_ca_topic_score_gemma":0.0005949116,"teacher_disagreement_score":0.006211006,"about_ca_system_score_codex":0.0012020527,"about_ca_system_score_gemma":0.0015665592,"threshold_uncertainty_score":0.020777881},"labels":[],"label_agreement":null},{"id":"W1555007144","doi":"10.1007/978-3-540-75975-1_12","title":"The OO jDREW Engine of Rule Responder: Naf Hornlog RuleML Query Answering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"RuleML; Computer science; Semantic Web Rule Language; World Wide Web; Semantic reasoner; Inference engine; Rule-based system; XML; Database; Sublanguage; Java; Web service; Programming language; Information retrieval; Web modeling; Markup language; XHTML; Artificial intelligence; Semantic analytics","score_opus":0.02212135089613528,"score_gpt":0.26016596336162623,"score_spread":0.23804461246549094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555007144","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.0069864187,0.0005755361,0.63725376,0.0008256649,0.00036149353,0.00042035925,0.005597445,0.3248229,0.02315637],"genre_scores_gemma":[0.12721711,0.0008457315,0.7135389,0.0033774301,0.00037920108,0.0005371866,0.02842777,0.062462684,0.06321401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974401,0.00040607175,0.00028823095,0.0005263934,0.0011455958,0.00019353532],"domain_scores_gemma":[0.9961881,0.0018492145,0.00012609098,0.0011974085,0.0005180365,0.00012119277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038234934,0.0010043785,0.0017261689,0.002187553,0.0006942433,0.004725325,0.0045678676,0.0017848638,0.039331287],"category_scores_gemma":[0.011772239,0.0015013845,0.0015277191,0.0016590032,0.0011317201,0.005062589,0.0032293622,0.0018548339,0.016619053],"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.0010886362,0.00037134776,0.0036195123,0.0013913821,0.00023180954,0.00060459255,0.0010583446,0.0043139975,0.022780651,0.052911025,0.2346978,0.6769309],"study_design_scores_gemma":[0.0006668486,0.00018934358,0.002357841,0.0003516682,0.00039556,0.0010157677,0.00040866417,0.25286967,0.08835698,0.08360807,0.56948614,0.00029343646],"about_ca_topic_score_codex":0.01121166,"about_ca_topic_score_gemma":0.010188068,"teacher_disagreement_score":0.039331287,"about_ca_system_score_codex":0.0011538613,"about_ca_system_score_gemma":0.0016834756,"threshold_uncertainty_score":0.13157624},"labels":[],"label_agreement":null},{"id":"W1555019970","doi":"10.1007/978-3-540-27776-7_35","title":"Using CoDeL to Rapidly Prototype Network Processsor Extensions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Workstation; Focus (optics); Latency (audio); Computer architecture; Embedded system; Computer network; Operating system; Distributed computing; Telecommunications","score_opus":0.03361342319958882,"score_gpt":0.28830881701349464,"score_spread":0.2546953938139058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555019970","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.034776147,0.00015708798,0.66506815,0.00027592646,0.00038296593,0.0004857505,0.001094641,0.27959996,0.018159408],"genre_scores_gemma":[0.29729527,0.00034131785,0.5795602,0.0007571005,0.00009944542,0.0010929174,0.0059728194,0.09454526,0.020335669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987337,0.0002485685,0.0000959969,0.00018271364,0.00058213715,0.00015687669],"domain_scores_gemma":[0.99431396,0.0027066749,0.00023328156,0.0013850294,0.0011184094,0.00024262325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020832978,0.0017544224,0.0006386939,0.0010075954,0.00079315825,0.0022516823,0.0030329595,0.0012793891,0.018925082],"category_scores_gemma":[0.010614526,0.001519996,0.0009769556,0.0006705757,0.00092138053,0.003490171,0.0019752148,0.0027453885,0.006238642],"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.0034335929,0.0010690057,0.0071033323,0.001515459,0.0003118734,0.0016638245,0.0019329853,0.1099826,0.10413455,0.04693751,0.17190239,0.5500129],"study_design_scores_gemma":[0.0007421783,0.00035008256,0.00093413686,0.00017594748,0.00015220407,0.00041731584,0.00018336029,0.7174141,0.12813097,0.018822404,0.13252907,0.00014832492],"about_ca_topic_score_codex":0.003575981,"about_ca_topic_score_gemma":0.0047556534,"teacher_disagreement_score":0.018925082,"about_ca_system_score_codex":0.0014684441,"about_ca_system_score_gemma":0.0012586981,"threshold_uncertainty_score":0.06331068},"labels":[],"label_agreement":null},{"id":"W1555151062","doi":"10.1007/978-3-642-11842-5_8","title":"An Efficient Splitting Domain Decomposition Approach for Parabolic-Type Time-Dependent Problems in Porous Media","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","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":"York University","funders":"","keywords":"Domain decomposition methods; Computer science; Block (permutation group theory); Decomposition; Domain (mathematical analysis); Decomposition method (queueing theory); Type (biology); Algorithm; Scheme (mathematics); Computational complexity theory; Porous medium; Interface (matter); Computational science; Mathematical optimization; Applied mathematics; Porosity; Mathematics; Parallel computing; Mathematical analysis; Geometry; Finite element method; Discrete mathematics; Materials science; Physics","score_opus":0.01706618341024611,"score_gpt":0.2862113581433468,"score_spread":0.2691451747331007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555151062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052345237,0.00020073606,0.99087113,0.00007784997,0.00009960876,0.00003996652,0.00004757979,0.00010878095,0.0033197252],"genre_scores_gemma":[0.10394365,0.00064628536,0.88480556,0.0001298396,0.00013314234,0.00029772468,0.0002787853,0.00024156555,0.009523483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981266,0.000050895356,0.000011283958,0.000017765062,0.00009097165,0.000016382619],"domain_scores_gemma":[0.9996724,0.00016017369,0.00001419513,0.000035258785,0.00008506801,0.000032862576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005200226,0.00085322454,0.00091142673,0.0004771263,0.00038889438,0.0008372339,0.0011363303,0.0010769357,0.0036697008],"category_scores_gemma":[0.0008456515,0.00040731562,0.0008727201,0.00059169764,0.00058385055,0.0008391704,0.0015240634,0.0014689799,0.0009861873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026082396,0.00033119658,0.0005519703,0.0006100649,0.00011140557,0.00034941037,0.00024862483,0.49255225,0.0615113,0.16783322,0.009470309,0.26616952],"study_design_scores_gemma":[0.000009946052,0.000017335044,0.00004072359,0.000007275161,0.0000058177034,0.000032115226,0.000010798006,0.98676425,0.0010197771,0.01036891,0.0017181634,0.000004837773],"about_ca_topic_score_codex":0.00126669,"about_ca_topic_score_gemma":0.0017066387,"teacher_disagreement_score":0.0036697008,"about_ca_system_score_codex":0.00027841295,"about_ca_system_score_gemma":0.000676039,"threshold_uncertainty_score":0.012276411},"labels":[],"label_agreement":null},{"id":"W1555194136","doi":"10.1007/978-3-540-39966-7_26","title":"Incremental Algorithms Based on Discrete Green Theorem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Algorithm; Pixel; Moment (physics); Bivariate analysis; Computer science; Moment of inertia; Mathematics; Order (exchange); Discrete mathematics; Calculus (dental); Geometry; Artificial intelligence; Statistics","score_opus":0.016752481403168658,"score_gpt":0.25304841619316987,"score_spread":0.23629593479000122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555194136","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.008043055,0.00045727077,0.9876773,0.000120103294,0.00014737764,0.00004410548,0.000040300412,0.000776949,0.002693567],"genre_scores_gemma":[0.15388069,0.00056532066,0.83841085,0.00014895358,0.00022612665,0.00018694068,0.0002701031,0.0004449289,0.0058661294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994423,0.0001335482,0.000032842603,0.000104193474,0.00022457079,0.0000624617],"domain_scores_gemma":[0.9977858,0.0012840463,0.00009716315,0.0003980036,0.00034112504,0.00009376368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095025497,0.00075386564,0.0015357886,0.0016596707,0.00060730905,0.0013541888,0.0025126871,0.0008745011,0.005376823],"category_scores_gemma":[0.004992288,0.00056669366,0.00082631235,0.0017340041,0.0010273193,0.0030908936,0.0022297208,0.0020348402,0.0012002352],"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.00037285988,0.0002007847,0.0006174768,0.00024707097,0.00007813582,0.000092497285,0.00015674754,0.096565455,0.008840495,0.27806562,0.01015087,0.60461205],"study_design_scores_gemma":[0.00008927813,0.00008771949,0.00022268007,0.000017813274,0.000039884566,0.000106628184,0.000023156268,0.8479782,0.0032899487,0.14217289,0.005946795,0.000025056333],"about_ca_topic_score_codex":0.0013592008,"about_ca_topic_score_gemma":0.0017903493,"teacher_disagreement_score":0.005376823,"about_ca_system_score_codex":0.000716681,"about_ca_system_score_gemma":0.0007804374,"threshold_uncertainty_score":0.017987251},"labels":[],"label_agreement":null},{"id":"W1555201727","doi":"10.1007/978-3-540-70567-3_6","title":"P4A: A New Privacy Model for XML","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Information privacy; Permission; Internet privacy; Privacy by Design; Privacy software; XML; Data collection; Flexibility (engineering); Privacy policy; Computer security; World Wide Web","score_opus":0.05262114688647754,"score_gpt":0.27817611868186437,"score_spread":0.22555497179538683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555201727","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.0014156841,0.0002572999,0.9896024,0.00094709126,0.00023825848,0.00015112918,0.00042632114,0.0030314056,0.00393034],"genre_scores_gemma":[0.087783,0.0010840202,0.87319446,0.0028084381,0.00057816977,0.0010767851,0.0024799854,0.002468498,0.028526634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9867936,0.0038062492,0.0017356768,0.001621259,0.005286334,0.000756972],"domain_scores_gemma":[0.9883264,0.0029874297,0.0006193071,0.0062479656,0.0013588521,0.00046006584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011022852,0.0014713389,0.0014327113,0.002249084,0.0028387993,0.01048636,0.005294336,0.0045684488,0.009475611],"category_scores_gemma":[0.013841958,0.0018233533,0.0031728335,0.0030982532,0.0040030563,0.022887565,0.007822884,0.010955521,0.00488253],"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.0003712522,0.00016692541,0.00055813254,0.00038796666,0.000098585704,0.00029732255,0.00054094975,0.009464764,0.0058178687,0.8251801,0.038424037,0.11869201],"study_design_scores_gemma":[0.00011001715,0.00014503897,0.00017094251,0.00014924935,0.00015901291,0.0009283946,0.0001447673,0.11937983,0.020793218,0.65257597,0.20532161,0.00012198653],"about_ca_topic_score_codex":0.001861823,"about_ca_topic_score_gemma":0.0016633406,"teacher_disagreement_score":0.011022852,"about_ca_system_score_codex":0.0026819725,"about_ca_system_score_gemma":0.003533048,"threshold_uncertainty_score":0.05829513},"labels":[],"label_agreement":null},{"id":"W1555260909","doi":"10.1007/978-3-540-30231-5_7","title":"Floating-Point Filter for the Line Intersection Algorithm","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"Carleton University","funders":"","keywords":"Intersection (aeronautics); Computer science; Point (geometry); Filter (signal processing); Floating point; Computation; Algorithm; Representation (politics); Line (geometry); Line segment; Theoretical computer science; Artificial intelligence; Mathematics; Computer vision","score_opus":0.011769418719654772,"score_gpt":0.2446099806250346,"score_spread":0.23284056190537983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555260909","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.0021831575,0.00017767369,0.9942954,0.000054693926,0.00006143748,0.00001067046,0.00004728132,0.0012597854,0.0019098718],"genre_scores_gemma":[0.08358419,0.00037297505,0.9036562,0.00010382128,0.00012787028,0.000095907155,0.000464527,0.0004950675,0.011099509],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990866,0.00011832885,0.000043836488,0.00016756971,0.0005034547,0.00008016776],"domain_scores_gemma":[0.99898857,0.00034085082,0.000052028685,0.00023990119,0.00034492192,0.000033767355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000787191,0.0008625811,0.001074276,0.0010923862,0.00089888566,0.002016526,0.0018500579,0.0012895187,0.015653925],"category_scores_gemma":[0.003747688,0.00037226008,0.00060745963,0.0015976477,0.00062483584,0.0023133405,0.0010947135,0.00220241,0.0063991295],"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.0005893603,0.00008421206,0.0003805684,0.00015954858,0.000055461274,0.00011449158,0.00013584249,0.063115,0.022355247,0.12998717,0.01701629,0.7660068],"study_design_scores_gemma":[0.00006357296,0.000108309694,0.00026990345,0.000053520987,0.000032497246,0.00024477966,0.00003186547,0.88189894,0.026038237,0.059449103,0.031762183,0.000047123223],"about_ca_topic_score_codex":0.003393905,"about_ca_topic_score_gemma":0.0025218655,"teacher_disagreement_score":0.015653925,"about_ca_system_score_codex":0.0009836513,"about_ca_system_score_gemma":0.0010096831,"threshold_uncertainty_score":0.052367628},"labels":[],"label_agreement":null},{"id":"W1555335063","doi":"10.1007/978-3-540-30463-0_42","title":"New Bounds and Approximations for the Error of Linear Classifiers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Classifier (UML); Curse of dimensionality; Computation; Approximation error; Mathematics; Algorithm; Word error rate; Mean squared prediction error; Bayes error rate; Applied mathematics; Approximations of π; Computer science; Artificial intelligence; Statistics; Support vector machine; Bayes classifier","score_opus":0.021532263334467967,"score_gpt":0.27153473300027414,"score_spread":0.2500024696658062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555335063","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.0023514535,0.010492063,0.97790456,0.0010195868,0.000784706,0.00005518072,0.00022661797,0.0005324276,0.0066333795],"genre_scores_gemma":[0.106012456,0.01429271,0.8386069,0.0025759602,0.0061399788,0.0011379807,0.0019349618,0.002547341,0.02675178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9723292,0.009653956,0.0017756722,0.0040454734,0.010463187,0.0017325765],"domain_scores_gemma":[0.8117834,0.1577305,0.0045599104,0.012028036,0.011750302,0.002147907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032973677,0.007291659,0.005891881,0.0084899785,0.002031284,0.008905709,0.01285862,0.008908003,0.011824671],"category_scores_gemma":[0.20824358,0.0038404525,0.0045546587,0.007702773,0.008942319,0.022149853,0.01218664,0.023520445,0.005630887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062260986,0.000278549,0.0019875779,0.0014261567,0.0004883189,0.00027732036,0.0007101598,0.22974096,0.0030340515,0.51903147,0.02873614,0.21366666],"study_design_scores_gemma":[0.000030371582,0.00007944764,0.00057957554,0.0003873592,0.00015848658,0.00022756151,0.000072527095,0.6479847,0.0015328662,0.34063712,0.008224765,0.00008527886],"about_ca_topic_score_codex":0.0041920003,"about_ca_topic_score_gemma":0.004461818,"teacher_disagreement_score":0.032973677,"about_ca_system_score_codex":0.008177287,"about_ca_system_score_gemma":0.0027102395,"threshold_uncertainty_score":0.17438358},"labels":[],"label_agreement":null},{"id":"W1555413501","doi":"10.1007/11758525_105","title":"Genomes Containing Duplicates Are Hard to Compare","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Permutation (music); Computer science; Genome; Similarity (geometry); Theoretical computer science; Time complexity; Matching (statistics); Computational complexity theory; Combinatorics; Algorithm; Gene; Mathematics; Artificial intelligence; Biology; Genetics; Image (mathematics); Physics","score_opus":0.016468274548295338,"score_gpt":0.24031357721880658,"score_spread":0.22384530267051125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555413501","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.5298603,0.02018764,0.38706723,0.005169132,0.0017559333,0.00031139833,0.011760689,0.008243919,0.035643805],"genre_scores_gemma":[0.66235495,0.0055969134,0.29188803,0.001838218,0.00061881676,0.00024128216,0.02312175,0.0035445457,0.010795542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760026,0.0005425272,0.00020932413,0.00077981857,0.00069264276,0.0001754483],"domain_scores_gemma":[0.9874178,0.008646905,0.0008720527,0.0017687662,0.0009455224,0.00034881674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020528652,0.0007997067,0.0024506953,0.0039869687,0.0019829103,0.0047051804,0.001876239,0.0023382339,0.009019137],"category_scores_gemma":[0.019425686,0.0010496171,0.0011269732,0.0057067433,0.0015237377,0.010853079,0.003540809,0.0019109087,0.004453651],"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.002251071,0.00033527298,0.019814564,0.0032613452,0.0011623097,0.0014351583,0.0014288224,0.038764726,0.049902428,0.12906973,0.057491995,0.6950826],"study_design_scores_gemma":[0.00018480167,0.00029408658,0.0075855264,0.00033674983,0.0005392614,0.0035707932,0.0018473921,0.0368729,0.035244692,0.8306692,0.08268181,0.0001726824],"about_ca_topic_score_codex":0.00044219973,"about_ca_topic_score_gemma":0.000626381,"teacher_disagreement_score":0.009019137,"about_ca_system_score_codex":0.0006535243,"about_ca_system_score_gemma":0.0007061909,"threshold_uncertainty_score":0.03017199},"labels":[],"label_agreement":null},{"id":"W1555433412","doi":"10.1007/978-3-540-72530-5_68","title":"Description Logic Framework for Access Control and Security in Object-Oriented Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Concordia University","funders":"","keywords":"Role-based access control; Access control; Computer science; Object (grammar); Authorization; Context (archaeology); Discretionary access control; Object model; Programming language; Computer security; Artificial intelligence","score_opus":0.03802370468364352,"score_gpt":0.3238098670142793,"score_spread":0.28578616233063575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555433412","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.0010791593,0.0013880646,0.9866716,0.0010515676,0.00010122567,0.00009781606,0.00031716743,0.0007319321,0.008561399],"genre_scores_gemma":[0.098812304,0.0038255528,0.8759301,0.0011167862,0.00031487545,0.00058643817,0.0017075163,0.0003732348,0.017333234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977805,0.0006772694,0.00030710886,0.0002458945,0.00077883893,0.00021041681],"domain_scores_gemma":[0.9984308,0.0008905533,0.00007947432,0.00024478996,0.00026470755,0.00008967089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003213831,0.0012949655,0.0012403463,0.0022217794,0.0013988208,0.0064924485,0.0036204879,0.0021144736,0.0069093495],"category_scores_gemma":[0.0027720002,0.0011143417,0.0025001622,0.0029637741,0.0029506343,0.008002861,0.0021838394,0.005207419,0.0018696025],"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.000014085384,0.00002909841,0.000070936585,0.00016708816,0.000021165526,0.00009836939,0.00019939046,0.0042339275,0.0005869562,0.9684083,0.0031948753,0.022975938],"study_design_scores_gemma":[0.000036512098,0.0000200913,0.00006976665,0.00013405387,0.000056544573,0.00016021564,0.00010421782,0.050681494,0.0015056574,0.8877558,0.059443533,0.0000321047],"about_ca_topic_score_codex":0.009016887,"about_ca_topic_score_gemma":0.0061022188,"teacher_disagreement_score":0.009016887,"about_ca_system_score_codex":0.0037972794,"about_ca_system_score_gemma":0.002876746,"threshold_uncertainty_score":0.027551293},"labels":[],"label_agreement":null},{"id":"W1555558392","doi":"10.1007/11930242_11","title":"A Fixed Structure Learning Automaton Micro-aggregation Technique for Secure Statistical Databases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Carleton University","funders":"","keywords":"Computer science; Heuristic; Automaton; Cellular automaton; Scheme (mathematics); Learning automata; Theoretical computer science; Algorithm; Data mining; Artificial intelligence; Mathematics","score_opus":0.01717331659407111,"score_gpt":0.27487022260351857,"score_spread":0.25769690600944745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555558392","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.005949417,0.00009281408,0.9923666,0.00009807227,0.000030311825,0.00003059963,0.000048940383,0.0006746772,0.00070861157],"genre_scores_gemma":[0.37181547,0.00021664746,0.62160236,0.00018414357,0.000119100274,0.00020732684,0.00027694443,0.00021902403,0.005359001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985322,0.00036618602,0.00012097895,0.0003068037,0.00052783615,0.00014610923],"domain_scores_gemma":[0.9967572,0.0010419994,0.00015431111,0.0015200209,0.00042253235,0.000103854116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014082185,0.00047925932,0.0013916787,0.00083579554,0.0009430566,0.0012702226,0.002213118,0.0008059542,0.0031564764],"category_scores_gemma":[0.004615102,0.0004865171,0.0010928379,0.0014444683,0.0010400877,0.0023822654,0.0026682573,0.0019652206,0.0009003493],"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.00051043427,0.00021937463,0.0013276838,0.00013136977,0.00014580482,0.00020214307,0.00033643522,0.22667736,0.016925056,0.3025153,0.007885999,0.44312304],"study_design_scores_gemma":[0.000014062171,0.00006978539,0.00013297219,0.000007592385,0.000022670522,0.000085714295,0.000021514803,0.8991457,0.003572453,0.09487515,0.002038442,0.00001389911],"about_ca_topic_score_codex":0.0018306804,"about_ca_topic_score_gemma":0.0028573314,"teacher_disagreement_score":0.0031564764,"about_ca_system_score_codex":0.0010795961,"about_ca_system_score_gemma":0.0014194449,"threshold_uncertainty_score":0.010559499},"labels":[],"label_agreement":null},{"id":"W1555588400","doi":"10.1007/3-540-37620-8_14","title":"A Perception and Selective Attention System for Synthetic Creatures","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Creatures; Computer science; Perception; Salient; Human–computer interaction; Action (physics); Character (mathematics); Cognitive science; Interface (matter); Active perception; Natural (archaeology); Artificial intelligence; Psychology","score_opus":0.00997225618188669,"score_gpt":0.21541729743903118,"score_spread":0.2054450412571445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555588400","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.092621095,0.00053738046,0.88789105,0.00020571207,0.00024382178,0.00017043724,0.0002612617,0.011778168,0.0062910444],"genre_scores_gemma":[0.6180241,0.00033947456,0.37188202,0.00042062555,0.00013722685,0.00026347555,0.00063561223,0.0005315446,0.007765839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998876,0.000014611701,0.000005603019,0.000047233,0.000023354376,0.000021536674],"domain_scores_gemma":[0.9997478,0.000095623654,0.0000134397305,0.00004416201,0.000055950622,0.000043076343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041757003,0.00046198885,0.0004903965,0.00031152988,0.0002590466,0.00054139586,0.0011974119,0.0007225106,0.0062149274],"category_scores_gemma":[0.0009311692,0.00027577454,0.00034357555,0.0002560328,0.0002795732,0.00077453104,0.0007729296,0.00049670355,0.0012561819],"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.0007941947,0.00017419858,0.0008729887,0.00018867843,0.00010007228,0.00023624513,0.00025475927,0.008477083,0.4014678,0.0041980417,0.010190002,0.57304585],"study_design_scores_gemma":[0.00024498568,0.0007526217,0.007201031,0.000040650197,0.00029333276,0.00069912494,0.00012979029,0.7543598,0.20529978,0.014001606,0.016904652,0.00007265476],"about_ca_topic_score_codex":0.0021800469,"about_ca_topic_score_gemma":0.0020847933,"teacher_disagreement_score":0.0062149274,"about_ca_system_score_codex":0.00031541433,"about_ca_system_score_gemma":0.00026675928,"threshold_uncertainty_score":0.020790994},"labels":[],"label_agreement":null},{"id":"W1555694369","doi":"10.1007/3-540-45067-x_43","title":"New Constructions for Resilient and Highly Nonlinear Boolean Functions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Boolean function; Correlation attack; Concatenation (mathematics); Block cipher; Boolean network; Hadamard transform; Construct (python library); Discrete mathematics; Bent function; Nonlinear system; Computer science; Algebraic number; Mathematics; Cryptography; Algorithm; Combinatorics","score_opus":0.012358944843393007,"score_gpt":0.22787206342381894,"score_spread":0.21551311858042593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555694369","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.04176542,0.0018354183,0.84739935,0.0028967152,0.0009539412,0.00023257908,0.00042484183,0.0023259274,0.10216567],"genre_scores_gemma":[0.52329856,0.0030397133,0.3844061,0.0017667995,0.0011226847,0.00076883996,0.0007461943,0.0012245075,0.08362666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.0002250451,0.000079659316,0.00017268158,0.0004475194,0.00020233239],"domain_scores_gemma":[0.9986155,0.0006235706,0.00012014669,0.00039310928,0.00012286998,0.00012480703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012320493,0.0018551623,0.0008921271,0.0020563987,0.0018677659,0.0025175356,0.0016700275,0.0014719443,0.01069509],"category_scores_gemma":[0.0036033888,0.0010149751,0.0013778368,0.0013592493,0.003408884,0.0062212073,0.006286562,0.005375828,0.0026659563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066246306,0.000032951048,0.00007435363,0.00011613224,0.000013443655,0.00009780593,0.00015952872,0.0020293624,0.0059492523,0.9612254,0.004249438,0.025986047],"study_design_scores_gemma":[0.000036425194,0.00006310936,0.00011763133,0.000058487076,0.0000460329,0.00052831316,0.000060393053,0.015074229,0.013452163,0.94109476,0.029414926,0.00005353233],"about_ca_topic_score_codex":0.00018676707,"about_ca_topic_score_gemma":0.00041100464,"teacher_disagreement_score":0.01069509,"about_ca_system_score_codex":0.0017459565,"about_ca_system_score_gemma":0.00053102,"threshold_uncertainty_score":0.0357787},"labels":[],"label_agreement":null},{"id":"W1555785714","doi":"10.1007/978-3-540-74309-5_20","title":"A Power-Aware Alternative for the Perceptron Branch Predictor","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Computer science; Branch predictor; Computation; Perceptron; Computational complexity theory; Power (physics); Multilayer perceptron; Dissipation; Predictive power; Algorithm; Artificial intelligence; Machine learning; Artificial neural network; Parallel computing","score_opus":0.023391801836428118,"score_gpt":0.2843282487658861,"score_spread":0.26093644692945794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555785714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008424279,0.00090279477,0.98183155,0.0003340921,0.0003806131,0.00004329356,0.000105791776,0.0023563325,0.005621153],"genre_scores_gemma":[0.27619362,0.0006950664,0.6973109,0.00054411805,0.0004873428,0.00013680548,0.00049685145,0.0005100086,0.02362527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930525,0.00016501291,0.000031527103,0.00011936687,0.00029598773,0.000082740444],"domain_scores_gemma":[0.99903727,0.00034195866,0.000039671097,0.00020696461,0.0003159432,0.000058252645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093354064,0.0007264567,0.0013126101,0.000660085,0.0005602343,0.0013550861,0.002498013,0.00108104,0.010678795],"category_scores_gemma":[0.0034223462,0.00046134106,0.00050644233,0.0011882575,0.00038471396,0.0017520606,0.000998606,0.0024608287,0.002982409],"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.0006021964,0.00030708968,0.00075944274,0.00016118832,0.00012459718,0.000086856526,0.00004589168,0.14296785,0.010398717,0.024367334,0.0132816,0.8068973],"study_design_scores_gemma":[0.00003160045,0.000051012783,0.00012052147,0.000013555925,0.00002450862,0.000028643208,0.0000067041447,0.98728704,0.0022494795,0.0077378084,0.0024399364,0.000009174829],"about_ca_topic_score_codex":0.0026742318,"about_ca_topic_score_gemma":0.009920552,"teacher_disagreement_score":0.010678795,"about_ca_system_score_codex":0.0004586547,"about_ca_system_score_gemma":0.0013488136,"threshold_uncertainty_score":0.035724163},"labels":[],"label_agreement":null},{"id":"W1555963762","doi":"10.1007/978-3-540-27764-4_10","title":"Probabilistic Predicative Programming","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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 Toronto","funders":"","keywords":"Predicative expression; Probabilistic logic; Computer science; Programming language; Artificial intelligence; Linguistics; Philosophy","score_opus":0.020473737386211926,"score_gpt":0.24722796269204006,"score_spread":0.22675422530582814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555963762","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.008245512,0.0049950643,0.69706875,0.0055801827,0.00051342056,0.000046385783,0.00046901402,0.0010019029,0.28207988],"genre_scores_gemma":[0.6037545,0.0055102822,0.21307668,0.0016812761,0.0017937758,0.00022041958,0.001384454,0.0007718312,0.17180684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885535,0.0003480633,0.000048046135,0.0002709213,0.00040443527,0.000073102055],"domain_scores_gemma":[0.99874866,0.00066490937,0.000057682966,0.00027198295,0.00019151982,0.00006518582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013101315,0.0006795997,0.00066340104,0.00085433014,0.0012949932,0.003567735,0.0011058917,0.0009491353,0.016927136],"category_scores_gemma":[0.0037505608,0.0006016108,0.00071206014,0.0013764572,0.0028061434,0.004933732,0.0017319468,0.0030700732,0.0034594252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008096372,0.000008310937,0.00008139195,0.000020602476,0.0000055851297,0.000011427093,0.000050578492,0.00087312784,0.000102870916,0.97782946,0.004711834,0.016296735],"study_design_scores_gemma":[0.0000023553387,0.0000024757528,0.000059325495,0.000010406782,0.0000039506695,0.000030473446,0.000011603472,0.0034759133,0.00014174773,0.98051625,0.015741933,0.0000035939843],"about_ca_topic_score_codex":0.0007695052,"about_ca_topic_score_gemma":0.0009856011,"teacher_disagreement_score":0.016927136,"about_ca_system_score_codex":0.0012988854,"about_ca_system_score_gemma":0.0006899287,"threshold_uncertainty_score":0.056626856},"labels":[],"label_agreement":null},{"id":"W1556071759","doi":"10.1007/978-3-540-85992-5_25","title":"From Desktop to Tabletop: Migrating the User Interface of AgilePlanner","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Agile software development; Human–computer interaction; User interface; Process (computing); Interface (matter); Multimedia; Computer graphics (images); Software engineering; Operating system","score_opus":0.02527638083537568,"score_gpt":0.26299433608785056,"score_spread":0.23771795525247488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556071759","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.12415012,0.0015816091,0.7901624,0.0015325301,0.0004928413,0.00016626502,0.0003418829,0.01651517,0.06505715],"genre_scores_gemma":[0.32415554,0.0020474417,0.5726888,0.0007145313,0.00008497039,0.00026951125,0.0012924626,0.0086789355,0.09006773],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957246,0.0001258439,0.0000262939,0.00007692214,0.00013017026,0.000068304165],"domain_scores_gemma":[0.999398,0.00020128045,0.000026183397,0.0001759008,0.00009053984,0.00010805819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006896579,0.00054788595,0.000269257,0.00029223974,0.00045177914,0.002322516,0.0010543092,0.0008070478,0.012547661],"category_scores_gemma":[0.0019108834,0.00046756127,0.00029552798,0.00050487055,0.00048784201,0.0030156993,0.0018806743,0.0015075842,0.0046592765],"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.00042621186,0.00014261856,0.0019521441,0.00023910418,0.000023024977,0.0006746562,0.0066784252,0.0025099472,0.031548396,0.015986422,0.033379503,0.9064396],"study_design_scores_gemma":[0.00022448637,0.0010909576,0.009985478,0.0007523111,0.0001446511,0.0051144687,0.014205448,0.090859614,0.119320706,0.04095127,0.7169504,0.0004002742],"about_ca_topic_score_codex":0.002056941,"about_ca_topic_score_gemma":0.0030302526,"teacher_disagreement_score":0.012547661,"about_ca_system_score_codex":0.00020229408,"about_ca_system_score_gemma":0.0005868126,"threshold_uncertainty_score":0.041976154},"labels":[],"label_agreement":null},{"id":"W1556141317","doi":"10.1007/978-3-642-37119-6_14","title":"RESource: A Framework for Online Matching of Assembly with Open Source Code","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Computer science; Source code; Open source; Coding (social sciences); Software; Reverse engineering; File format; Set (abstract data type); Database; Programming language; Software engineering","score_opus":0.027590689778475667,"score_gpt":0.2978994570741178,"score_spread":0.2703087672956421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556141317","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.0010908343,0.00012392763,0.7810156,0.00012092393,0.0001431035,0.00014379957,0.0012587651,0.21181378,0.004289281],"genre_scores_gemma":[0.050104067,0.00035202387,0.8394475,0.00040567442,0.00018828182,0.0006863033,0.011899693,0.0819505,0.014965938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546635,0.00088343467,0.00047015745,0.00094706105,0.0017378374,0.0004951788],"domain_scores_gemma":[0.99179053,0.002892778,0.0004260935,0.003730628,0.00084950967,0.00031043545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004359914,0.0028048842,0.0017802345,0.004222728,0.0017489801,0.0052457545,0.008105242,0.0031050593,0.06912295],"category_scores_gemma":[0.020972744,0.0032174904,0.004617659,0.003473581,0.00176553,0.011229774,0.009885021,0.003992549,0.040734895],"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.0013275638,0.00041094286,0.0027487776,0.0013592574,0.00032369694,0.00061831955,0.0008927975,0.018515931,0.012839349,0.14055094,0.24416988,0.5762425],"study_design_scores_gemma":[0.00033354398,0.00017260226,0.0011052215,0.00040424388,0.0001573145,0.00070310227,0.0003200398,0.3651965,0.057305068,0.24356604,0.3304322,0.00030412117],"about_ca_topic_score_codex":0.005322657,"about_ca_topic_score_gemma":0.005315696,"teacher_disagreement_score":0.06912295,"about_ca_system_score_codex":0.0016150922,"about_ca_system_score_gemma":0.002701594,"threshold_uncertainty_score":0.23123926},"labels":[],"label_agreement":null},{"id":"W1556245316","doi":"10.1007/978-3-540-85097-7_27","title":"An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","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 Alberta","funders":"","keywords":"Steiner tree problem; Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Node (physics); Routing algorithm; Approximation algorithm; Algorithm; Mathematical optimization; Combinatorics; Computer network; Mathematics; Routing protocol; Physics","score_opus":0.014494126086705883,"score_gpt":0.227576433408481,"score_spread":0.2130823073217751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556245316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031717796,0.000907213,0.9463011,0.0010167408,0.00040905722,0.00024569395,0.00046840357,0.002578534,0.016355518],"genre_scores_gemma":[0.19379735,0.00045859345,0.79467225,0.00039461977,0.00026804558,0.00041372678,0.0012837546,0.00040932067,0.008302376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870634,0.00030432147,0.000052994517,0.00023479683,0.00043206094,0.00026953703],"domain_scores_gemma":[0.99833715,0.00079704163,0.000092663184,0.0003587883,0.0002951322,0.00011914369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011863478,0.0014697096,0.0017579893,0.0011913741,0.00097192003,0.0018874498,0.0038889998,0.0023421347,0.010285714],"category_scores_gemma":[0.0049049165,0.000724525,0.0011452177,0.0026885606,0.0006164843,0.00277368,0.0021888574,0.0029306056,0.001819271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009744528,0.00063290074,0.00080421375,0.0003575937,0.000108451924,0.0001710801,0.00017708614,0.5137992,0.0058397288,0.04516935,0.035097867,0.39686814],"study_design_scores_gemma":[0.00010878204,0.00006273741,0.00013590159,0.000015006532,0.000024226349,0.00007257837,0.000025478084,0.9816803,0.00073035737,0.01423992,0.0028932581,0.000011468069],"about_ca_topic_score_codex":0.005262652,"about_ca_topic_score_gemma":0.0063094087,"teacher_disagreement_score":0.010285714,"about_ca_system_score_codex":0.0025592612,"about_ca_system_score_gemma":0.0024667578,"threshold_uncertainty_score":0.034409106},"labels":[],"label_agreement":null},{"id":"W1556278383","doi":"10.1007/978-3-540-24625-1_2","title":"Lexicon Based Ontology Construction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Toronto","funders":"","keywords":"Computer science; Ontology; Software engineering; Process ontology; Documentation; Interoperability; Deliverable; World Wide Web; Ontology language; Semantic Web; Programming language; Systems engineering; Engineering","score_opus":0.018455768450639534,"score_gpt":0.24336394804342196,"score_spread":0.22490817959278242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556278383","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.006160448,0.0003019022,0.9394709,0.00038753223,0.0002602416,0.00025625364,0.0014132585,0.0065834285,0.04516611],"genre_scores_gemma":[0.11968118,0.0008503023,0.8240109,0.00035010386,0.00008371291,0.00037606648,0.014397327,0.002807799,0.037442643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988267,0.00026823877,0.000120187455,0.0002597384,0.00042418903,0.00010093577],"domain_scores_gemma":[0.9991641,0.00018937813,0.000028750737,0.00027141525,0.00031209897,0.000034315613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478013,0.00071809586,0.0007050027,0.0032100924,0.0014606828,0.0035033287,0.0014441877,0.0008371326,0.0204785],"category_scores_gemma":[0.003195108,0.00074409705,0.0017483142,0.0029214465,0.0008624208,0.0044562803,0.00413197,0.0017296474,0.01515324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080399346,0.00015376382,0.00087314006,0.0004254379,0.00009185757,0.0005474272,0.0009177425,0.0039835125,0.017402623,0.339152,0.04891736,0.58745474],"study_design_scores_gemma":[0.00003684661,0.000049007453,0.00092888076,0.00026649403,0.00022107587,0.0012590038,0.0008910344,0.08151583,0.0465709,0.42342755,0.44475144,0.0000819562],"about_ca_topic_score_codex":0.002507782,"about_ca_topic_score_gemma":0.0046207327,"teacher_disagreement_score":0.0204785,"about_ca_system_score_codex":0.0009175687,"about_ca_system_score_gemma":0.00195369,"threshold_uncertainty_score":0.06850737},"labels":[],"label_agreement":null},{"id":"W1556292914","doi":"10.1007/978-3-642-01818-3_3","title":"Computer (and Human) Perfection at Checkers","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfection; Champion; Computer science; Championship; Obstacle; Artificial intelligence; Operations research; Law; Epistemology; Mathematics; Philosophy","score_opus":0.017429923052116734,"score_gpt":0.26953473878305595,"score_spread":0.25210481573093924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556292914","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.17141499,0.00090973795,0.1168921,0.0061991927,0.0006680471,0.000065803535,0.00023068076,0.0010971582,0.7025223],"genre_scores_gemma":[0.92198604,0.00022368549,0.014847835,0.0003073591,0.00006765577,0.000020750886,0.000090785106,0.00021777445,0.06223803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988255,0.00038505666,0.000034613022,0.00028965654,0.00023991166,0.00022522682],"domain_scores_gemma":[0.99748504,0.0010416592,0.00017998856,0.0007360356,0.0003180053,0.00023927983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009721466,0.00045331728,0.00047170353,0.0006999069,0.0023438449,0.0038830433,0.0010018274,0.0014537756,0.031367686],"category_scores_gemma":[0.007343793,0.00047099814,0.0005562556,0.0004862167,0.0069055613,0.0066913236,0.0024419355,0.0017828514,0.0026233504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009391532,0.000021919746,0.0009324461,0.00005351307,0.000018556517,0.0002116915,0.00136873,0.0031638122,0.0013359298,0.96721673,0.0076491614,0.01793351],"study_design_scores_gemma":[0.00004249799,0.00007719487,0.0012121906,0.00006542864,0.000029744873,0.00035227352,0.0009662694,0.008407309,0.003544899,0.92070717,0.064555645,0.000039318016],"about_ca_topic_score_codex":0.003638902,"about_ca_topic_score_gemma":0.0037663174,"teacher_disagreement_score":0.031367686,"about_ca_system_score_codex":0.0010414544,"about_ca_system_score_gemma":0.0010236645,"threshold_uncertainty_score":0.10493535},"labels":[],"label_agreement":null},{"id":"W1556316174","doi":"10.1007/978-3-540-68825-9_10","title":"Fast Markov Blanket Discovery Algorithm Via Local Learning within Single Pass","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":64,"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":"Markov blanket; Computer science; Bayesian network; Markov chain; Conditional independence; Construct (python library); Independence (probability theory); Algorithm; Markov decision process; Feature (linguistics); Tree (set theory); Artificial intelligence; Markov process; State (computer science); Machine learning; Markov model; Theoretical computer science; Variable-order Markov model; Mathematics","score_opus":0.015264437059283608,"score_gpt":0.2219545195051041,"score_spread":0.2066900824458205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556316174","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.0041240584,0.00018247854,0.9935846,0.0001224804,0.00003588192,0.000054160035,0.00008749014,0.0011400767,0.0006688022],"genre_scores_gemma":[0.12611923,0.00018548188,0.864809,0.00024208221,0.00012470076,0.00039881258,0.00092219876,0.0005382094,0.006660434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967391,0.0011489787,0.00020044288,0.00079014484,0.00076964515,0.00035173536],"domain_scores_gemma":[0.9854359,0.010563913,0.0004834524,0.0016976758,0.001413783,0.00040532168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005250808,0.0012271567,0.005032476,0.0024196187,0.0021075327,0.0026066506,0.0066826358,0.0033677598,0.0109051615],"category_scores_gemma":[0.015175059,0.0018959553,0.0022271962,0.0031933147,0.002041759,0.0059169815,0.0053228666,0.004093863,0.0030806167],"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.0012960404,0.00044903054,0.0021682237,0.00036318222,0.00036379963,0.0002718574,0.00027165885,0.35314217,0.0034222729,0.08994892,0.011759686,0.53654313],"study_design_scores_gemma":[0.000049969753,0.000040663534,0.00009223007,0.000009761221,0.000028910843,0.00004247066,0.000012215195,0.97127646,0.00087547646,0.026765097,0.0007915224,0.0000151675895],"about_ca_topic_score_codex":0.007771192,"about_ca_topic_score_gemma":0.0093038315,"teacher_disagreement_score":0.0109051615,"about_ca_system_score_codex":0.0015208625,"about_ca_system_score_gemma":0.005036632,"threshold_uncertainty_score":0.03648144},"labels":[],"label_agreement":null},{"id":"W1556372911","doi":"10.1007/978-3-540-72393-6_31","title":"Comparative Studies of Fuzzy Genetic Algorithms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Toronto Metropolitan University","funders":"China Scholarship Council","keywords":"Crossover; Computer science; Fuzzy logic; Quality control and genetic algorithms; Genetic algorithm; Algorithm; Mutation; Artificial intelligence; Data mining; Machine learning; Meta-optimization","score_opus":0.09541663711369208,"score_gpt":0.36418204513654645,"score_spread":0.26876540802285437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556372911","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.64168686,0.08426737,0.11955755,0.001431938,0.00042413248,0.00022863576,0.00049878884,0.0002591791,0.15164554],"genre_scores_gemma":[0.9513605,0.008265787,0.036697567,0.00006686893,0.000074952375,0.000047486497,0.00022305398,0.000044538192,0.003219224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767524,0.0011735529,0.000075072334,0.0001283574,0.00084522576,0.00010261435],"domain_scores_gemma":[0.98449254,0.01280588,0.00030069175,0.00051546673,0.001751876,0.00013359732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004814966,0.00067138084,0.00085038337,0.003964401,0.0006745299,0.002154771,0.0015013688,0.0011449396,0.0042993594],"category_scores_gemma":[0.020581778,0.00016502327,0.00058835273,0.0052962424,0.0007947948,0.0018460213,0.0005765873,0.0005404889,0.00028287398],"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.0024391674,0.00059975364,0.009412442,0.0017060676,0.00068651617,0.00019221562,0.00065191614,0.26821008,0.0027861188,0.16226146,0.004514552,0.5465397],"study_design_scores_gemma":[0.00035115777,0.0026916293,0.024385534,0.0010121748,0.0013146176,0.00066593185,0.002487019,0.80830413,0.013114577,0.119079605,0.026471006,0.00012262895],"about_ca_topic_score_codex":0.0044440613,"about_ca_topic_score_gemma":0.0036892076,"teacher_disagreement_score":0.004814966,"about_ca_system_score_codex":0.0018518048,"about_ca_system_score_gemma":0.0007687924,"threshold_uncertainty_score":0.025464296},"labels":[],"label_agreement":null},{"id":"W1556380767","doi":"10.1007/11866763_78","title":"Analytic Expressions for Fiducial and Surface Target Registration Error","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fiducial marker; Surface (topology); Image registration; Computer science; Stiffness; Artificial intelligence; Computer vision; Mathematics; Geometry; Physics; Image (mathematics)","score_opus":0.011351634019030785,"score_gpt":0.2358399329336681,"score_spread":0.2244882989146373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556380767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002128848,0.0006459513,0.993922,0.00017754464,0.00007319192,0.00002543441,0.000047664744,0.00023030193,0.002749101],"genre_scores_gemma":[0.27789795,0.0037304612,0.6987256,0.00032556345,0.00028240972,0.00035498862,0.0004594212,0.0010163594,0.017207231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985851,0.00022799901,0.00008928323,0.00019434375,0.0008082011,0.000095070514],"domain_scores_gemma":[0.99612135,0.002005094,0.00033460278,0.00036315387,0.0011135594,0.00006209229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032654013,0.001330747,0.0010080328,0.0020586476,0.0005123878,0.0021491875,0.0020157115,0.0023609484,0.005850321],"category_scores_gemma":[0.0230795,0.0006126401,0.0006917327,0.0017374264,0.0014908946,0.003092262,0.001975164,0.0019656294,0.00242683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009357292,0.000037713966,0.0006897895,0.0003684287,0.000039016333,0.00023350502,0.00034648177,0.37628454,0.009507878,0.49211383,0.0043932265,0.11589201],"study_design_scores_gemma":[0.0000061046962,0.000020074585,0.00028428677,0.00005768942,0.000014123225,0.0003204606,0.000057230223,0.9367189,0.002708549,0.05706785,0.0027093303,0.000035436165],"about_ca_topic_score_codex":0.0023722674,"about_ca_topic_score_gemma":0.002451008,"teacher_disagreement_score":0.005850321,"about_ca_system_score_codex":0.0016427282,"about_ca_system_score_gemma":0.0011887436,"threshold_uncertainty_score":0.019571245},"labels":[],"label_agreement":null},{"id":"W1556443226","doi":"10.1007/3-540-36178-2_22","title":"On Unconditionally Secure Robust Distributed Key Distribution Centers","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"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; Verifiable secret sharing; Key distribution; Secret sharing; Encryption; Key (lock); Computer network; Scheme (mathematics); Server; Computer security; Distributed computing; Adversary; Set (abstract data type); Cryptography; Public-key cryptography; Mathematics","score_opus":0.013509845303457748,"score_gpt":0.21453234559898712,"score_spread":0.20102250029552937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556443226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009892178,0.0006593093,0.9745928,0.0008086051,0.00021887782,0.00010733715,0.0001483519,0.000929957,0.012642525],"genre_scores_gemma":[0.6596039,0.0026368944,0.28456038,0.0010749669,0.00081679196,0.0005584369,0.00069038855,0.0009150241,0.049143195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975654,0.00051805243,0.00011336736,0.00041037955,0.0010533981,0.00033952892],"domain_scores_gemma":[0.9961461,0.001698525,0.00027983385,0.0013656813,0.000399672,0.00011016365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020075382,0.0012494744,0.0013474501,0.00095733267,0.0013885591,0.0031730675,0.0029392722,0.0018174535,0.009584561],"category_scores_gemma":[0.007182987,0.00079970056,0.00068651943,0.0017065776,0.002895584,0.008122634,0.0070736352,0.0043270458,0.0030249401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032572882,0.00006608721,0.00012114632,0.000100370824,0.000021364353,0.00007702768,0.00011721888,0.046150945,0.0059553585,0.86938727,0.00759545,0.07008204],"study_design_scores_gemma":[0.000054713964,0.000081785685,0.00011399476,0.000036004873,0.000023462511,0.00013071808,0.000048667924,0.2275003,0.0069494536,0.7550917,0.009932338,0.00003678703],"about_ca_topic_score_codex":0.00051339,"about_ca_topic_score_gemma":0.00044840854,"teacher_disagreement_score":0.009584561,"about_ca_system_score_codex":0.0018075197,"about_ca_system_score_gemma":0.0012304924,"threshold_uncertainty_score":0.032063603},"labels":[],"label_agreement":null},{"id":"W1556550766","doi":"10.1007/978-3-642-12659-8_20","title":"Interactive Data Mining on a CBEA Cluster","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Trent University","funders":"","keywords":"Computer science; Implementation; Cluster (spacecraft); Data mining; Architecture; Tree (set theory); Decision tree; Broadband; Parallel computing; Operating system; Programming language","score_opus":0.03327072161653707,"score_gpt":0.2918810401726122,"score_spread":0.25861031855607514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556550766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09049454,0.00046051748,0.8718842,0.00059454073,0.00016409086,0.0002794761,0.0010860167,0.01551874,0.01951791],"genre_scores_gemma":[0.24798064,0.00018888061,0.73033357,0.00010544288,0.00006835644,0.00020709669,0.0017661147,0.00080287963,0.018547017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.0001313962,0.000035713052,0.00017861363,0.00030295472,0.00010270367],"domain_scores_gemma":[0.99871457,0.00037837107,0.00002772634,0.00039584257,0.0003266966,0.0001567699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942109,0.00064893084,0.00081808673,0.0013501793,0.001871472,0.0015906162,0.0024949184,0.0005897333,0.013392472],"category_scores_gemma":[0.0027664907,0.0005523138,0.00073358475,0.0026977551,0.00047658925,0.0015889351,0.0023119948,0.0009013153,0.0026144786],"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.0021807137,0.00048840407,0.007826192,0.0004052207,0.00020895507,0.000757198,0.0010093548,0.13875143,0.050876003,0.03559976,0.049161088,0.71273565],"study_design_scores_gemma":[0.0000955928,0.00013681641,0.0023040709,0.00003129667,0.000047613164,0.00020882074,0.00030324588,0.924728,0.019292237,0.0265148,0.026304979,0.00003251702],"about_ca_topic_score_codex":0.010330472,"about_ca_topic_score_gemma":0.016259475,"teacher_disagreement_score":0.013392472,"about_ca_system_score_codex":0.0009977786,"about_ca_system_score_gemma":0.0012926193,"threshold_uncertainty_score":0.044802308},"labels":[],"label_agreement":null},{"id":"W1556554067","doi":"10.1007/978-3-540-68123-6_63","title":"An Effective Ontology Matching Technique","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Matching (statistics); Ontology; Computer science; Ontology alignment; Information retrieval; Mathematics; Process ontology; Philosophy; Epistemology; Semantic Web; Statistics","score_opus":0.013134951960008877,"score_gpt":0.2595407562102899,"score_spread":0.246405804250281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556554067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044755004,0.00024107035,0.9893953,0.00012538176,0.000099811405,0.000077221455,0.00011207018,0.0011639005,0.00430968],"genre_scores_gemma":[0.057877608,0.00032805873,0.93198335,0.00013818788,0.000050723742,0.00008235397,0.0006459881,0.00035168233,0.008542145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977284,0.0003587587,0.00016531568,0.00047745183,0.0011271856,0.00014293172],"domain_scores_gemma":[0.9987404,0.00035243435,0.00005455677,0.00047622426,0.00034273774,0.000033653665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010772917,0.00067286566,0.0008661316,0.003269795,0.0015256963,0.0018586108,0.0018239529,0.0011351202,0.008114716],"category_scores_gemma":[0.0036534013,0.00059601484,0.0013121446,0.00435956,0.00065711484,0.0047743204,0.0029654782,0.0015798776,0.0031879977],"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.000100007885,0.00017343955,0.0005173619,0.00022473061,0.00009507519,0.00020775582,0.00022713517,0.0034432772,0.032870114,0.081747904,0.011367796,0.86902547],"study_design_scores_gemma":[0.00008059119,0.0001713561,0.0020999273,0.00016962175,0.00048721672,0.00276755,0.00070462795,0.3860158,0.13466263,0.30294645,0.16977745,0.00011678007],"about_ca_topic_score_codex":0.0018402333,"about_ca_topic_score_gemma":0.0032883394,"teacher_disagreement_score":0.008114716,"about_ca_system_score_codex":0.0005794855,"about_ca_system_score_gemma":0.0014298782,"threshold_uncertainty_score":0.027146459},"labels":[],"label_agreement":null},{"id":"W1556588790","doi":"10.1007/978-3-642-15396-9_17","title":"Using Learnt Clauses in maxsat","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Soundness; Computer science; Set (abstract data type); Solver; Boolean satisfiability problem; Exploit; Connection (principal bundle); Theoretical computer science; Algorithm; Mathematics; Programming language; Boolean function","score_opus":0.05979020646472324,"score_gpt":0.31854603444125307,"score_spread":0.25875582797652985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556588790","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.016627926,0.0011560051,0.93341094,0.002160771,0.00038629002,0.00013393859,0.00085316953,0.0031810885,0.042089958],"genre_scores_gemma":[0.3447601,0.0015622576,0.60888535,0.0011118422,0.00038910776,0.0003971324,0.002799418,0.00216905,0.037925724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876875,0.00046106172,0.000072348514,0.00023456954,0.00037302164,0.000090166875],"domain_scores_gemma":[0.9967656,0.002524503,0.000094981944,0.00041572214,0.00015228878,0.000046830668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014555743,0.0009388251,0.0007451739,0.0007327181,0.0005908771,0.0020322653,0.0024784717,0.00086696225,0.026817184],"category_scores_gemma":[0.007005656,0.00095044286,0.0012607967,0.0012398373,0.0016715251,0.009440498,0.0031339,0.004072953,0.0033769927],"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.00026385023,0.00010994383,0.00036062073,0.0006951434,0.00007287678,0.00012117257,0.00025958588,0.043131247,0.002698638,0.63727057,0.019423673,0.29559276],"study_design_scores_gemma":[0.00005234849,0.000029421293,0.000085782725,0.00010244216,0.000030318255,0.000081661005,0.00005238115,0.09758695,0.00417803,0.8809904,0.016791636,0.000018591347],"about_ca_topic_score_codex":0.0007244566,"about_ca_topic_score_gemma":0.0018186892,"teacher_disagreement_score":0.026817184,"about_ca_system_score_codex":0.0011413138,"about_ca_system_score_gemma":0.000751117,"threshold_uncertainty_score":0.08971238},"labels":[],"label_agreement":null},{"id":"W1556592724","doi":"10.1007/978-3-540-72990-7_25","title":"Understanding IP Traffic Via Cluster Processes","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","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 Calgary","funders":"","keywords":"Range (aeronautics); Point process; Network packet; Cluster (spacecraft); Flow (mathematics); Statistical physics; Variance (accounting); Interflow; Mathematics; Traffic flow (computer networking); Computer science; Statistics; Computer network; Physics; Engineering; Economics","score_opus":0.13322241195864443,"score_gpt":0.32376907823087836,"score_spread":0.19054666627223393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556592724","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.08187043,0.00066827616,0.89286125,0.0011764469,0.000095629184,0.0000394747,0.0002951401,0.0004663006,0.022527127],"genre_scores_gemma":[0.9003972,0.0018229989,0.0849442,0.00016694734,0.00033357882,0.00008045784,0.00038827566,0.00022533562,0.0116411075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999803,0.000053903022,0.0000060950683,0.000046686073,0.00005823384,0.000032015832],"domain_scores_gemma":[0.99906117,0.0006184999,0.00006725717,0.000101464866,0.00010892041,0.000042645013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048458198,0.00066539756,0.0005495266,0.0009129276,0.0004957299,0.001963707,0.0010929784,0.0011631802,0.0029853925],"category_scores_gemma":[0.003354456,0.00051245495,0.0004896445,0.0010887473,0.00085312617,0.0039871167,0.000927723,0.0015194135,0.0004400996],"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.000023173294,0.000034781264,0.0011670988,0.000039600567,0.000021682565,0.000084429164,0.00016351233,0.32821685,0.0020879686,0.6463029,0.0025234492,0.019334543],"study_design_scores_gemma":[0.0000018895789,0.000003904541,0.0002459287,0.0000044954622,0.0000047681115,0.0000256512,0.000026638556,0.7315604,0.0002995162,0.26663646,0.0011840409,0.0000063014263],"about_ca_topic_score_codex":0.0043643643,"about_ca_topic_score_gemma":0.0019730642,"teacher_disagreement_score":0.0043643643,"about_ca_system_score_codex":0.0011689567,"about_ca_system_score_gemma":0.0005784955,"threshold_uncertainty_score":0.009987116},"labels":[],"label_agreement":null},{"id":"W1556610000","doi":"10.1007/11493402_14","title":"Intensional Programming for Agent Communication","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language","score_opus":0.036009474196362745,"score_gpt":0.2776279431013793,"score_spread":0.24161846890501654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556610000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038657452,0.001176817,0.8619938,0.0014463637,0.00024648118,0.00004996416,0.00007909706,0.00032288974,0.13081886],"genre_scores_gemma":[0.3645569,0.0028484876,0.50010693,0.0009295122,0.0008166371,0.0006401001,0.00035259314,0.00055663905,0.12919226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.00043973542,0.000046566594,0.000112635134,0.00021375882,0.00008373127],"domain_scores_gemma":[0.9992005,0.0005034595,0.00004154789,0.00013568017,0.000079643745,0.00003913346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015373856,0.0010580578,0.0007123988,0.0005531671,0.0009151982,0.0025715823,0.001716461,0.0011861268,0.01536387],"category_scores_gemma":[0.0022466509,0.00070334977,0.00082952954,0.00099392,0.0028769593,0.005824867,0.0018736726,0.004636328,0.002135717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004404765,0.000006047312,0.0000074867794,0.00001964804,0.0000022996896,0.000009569127,0.000057950067,0.0011460035,0.00010289449,0.99197406,0.0010033731,0.005666215],"study_design_scores_gemma":[0.000007640045,0.000005666035,0.000014071424,0.000018058454,0.000005148107,0.00002710665,0.000023261357,0.011551973,0.00020072528,0.9753711,0.01277027,0.0000049785513],"about_ca_topic_score_codex":0.00062356476,"about_ca_topic_score_gemma":0.0005909827,"teacher_disagreement_score":0.01536387,"about_ca_system_score_codex":0.0013187514,"about_ca_system_score_gemma":0.0005037371,"threshold_uncertainty_score":0.051397264},"labels":[],"label_agreement":null},{"id":"W1556620685","doi":"10.1007/bfb0024977","title":"A multiple paradigm diagnostic system for wide area communication networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Computer science; Scale (ratio); Fault (geology); Distributed computing; Artificial intelligence; Cartography; Geography","score_opus":0.014911775369153429,"score_gpt":0.2310707619177643,"score_spread":0.21615898654861088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556620685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014753982,0.00064379844,0.95237905,0.00030275082,0.0002584091,0.00027282586,0.00025602916,0.027152188,0.0039810026],"genre_scores_gemma":[0.32714146,0.00039225156,0.66030174,0.00066996756,0.00021548492,0.00033174263,0.00049008115,0.0008439167,0.009613354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992668,0.00020006033,0.00004131826,0.00012968792,0.0003136783,0.000048481685],"domain_scores_gemma":[0.9982399,0.00069478137,0.00009607524,0.0003380436,0.0005424913,0.00008870047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012109794,0.0009558899,0.000879165,0.0017653551,0.00077209773,0.0010683464,0.0019300082,0.0012453425,0.011093462],"category_scores_gemma":[0.003072275,0.0004028608,0.00040714964,0.000596216,0.0003783009,0.0019350733,0.0012774098,0.0010839924,0.0020474147],"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.0011400701,0.0003223538,0.0022048545,0.00038461247,0.00012047853,0.00061364553,0.00023673195,0.015122596,0.06303012,0.015880352,0.030120594,0.8708236],"study_design_scores_gemma":[0.00024277635,0.00062606594,0.0010775442,0.00008074417,0.0001901973,0.0015256709,0.00010098124,0.855622,0.07422823,0.030662248,0.0355449,0.0000985321],"about_ca_topic_score_codex":0.00091185444,"about_ca_topic_score_gemma":0.0017651905,"teacher_disagreement_score":0.011093462,"about_ca_system_score_codex":0.0006096,"about_ca_system_score_gemma":0.000934654,"threshold_uncertainty_score":0.037111342},"labels":[],"label_agreement":null},{"id":"W1556623511","doi":"10.1007/978-3-540-24698-5_20","title":"Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"","keywords":"Convex hull; Partition (number theory); Simple (philosophy); SIMPLE algorithm; Regular polygon; Computer science; Algorithm; Extreme point; Line segment; Time complexity; Combinatorics; Mathematics; Geometry; Artificial intelligence","score_opus":0.020076447813308675,"score_gpt":0.27153900865106706,"score_spread":0.25146256083775836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556623511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019901654,0.00042232798,0.9639416,0.00021532421,0.00006954023,0.00023412376,0.00048409504,0.0049728123,0.009758586],"genre_scores_gemma":[0.117258966,0.00034610293,0.871944,0.00008232331,0.00006299901,0.00030523152,0.0022564195,0.00086122006,0.006882714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988691,0.00010720991,0.00006966502,0.00020760442,0.0005545761,0.00019182407],"domain_scores_gemma":[0.99799514,0.0010759587,0.00014169725,0.00036319892,0.0003246184,0.00009936169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143684,0.0025808197,0.0018767954,0.0021514783,0.0012979544,0.0032412782,0.0028784247,0.0013969077,0.022390334],"category_scores_gemma":[0.003853613,0.0011475447,0.0017211344,0.00393987,0.0012074697,0.004092601,0.003214444,0.002838354,0.006076983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062728557,0.00035700575,0.0012533658,0.0006241322,0.00013421009,0.00021150205,0.00052420446,0.17096649,0.014348215,0.05459089,0.029181404,0.7271813],"study_design_scores_gemma":[0.0001949784,0.00013203724,0.000444005,0.00003886655,0.000050590697,0.00013965489,0.00032898356,0.91539997,0.009074358,0.06565014,0.008516591,0.000029851331],"about_ca_topic_score_codex":0.008656547,"about_ca_topic_score_gemma":0.016908104,"teacher_disagreement_score":0.022390334,"about_ca_system_score_codex":0.0016120686,"about_ca_system_score_gemma":0.001671966,"threshold_uncertainty_score":0.07490313},"labels":[],"label_agreement":null},{"id":"W1556718077","doi":"10.1007/11566465_11","title":"Elastic Registration of 3D Ultrasound Images","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Voxel; Artificial intelligence; Computer vision; Image registration; 3D ultrasound; Segmentation; Speckle pattern; Ultrasound; Process (computing); Image (mathematics); Acoustics","score_opus":0.01120584617764754,"score_gpt":0.2798254599276722,"score_spread":0.2686196137500247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556718077","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.02903413,0.00032427788,0.96644175,0.00023076787,0.0001029068,0.00008044023,0.0001315824,0.0010763806,0.0025777563],"genre_scores_gemma":[0.40384868,0.0016036329,0.5793014,0.00034331437,0.00018827985,0.00021845232,0.00084480946,0.001263218,0.01238817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895704,0.00022430813,0.00008884161,0.00021896287,0.00041828814,0.000092484224],"domain_scores_gemma":[0.9986951,0.00039520927,0.00020444025,0.00048007694,0.00017975856,0.000045438945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104148,0.00068114063,0.0008262698,0.0023760204,0.00055759854,0.0024073883,0.0009828265,0.0017027194,0.004368519],"category_scores_gemma":[0.0048620477,0.0012228499,0.0011828279,0.0025126438,0.0009133362,0.0018800363,0.0025890504,0.0015260137,0.0021981858],"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.00083465356,0.00026047477,0.0031536617,0.000421378,0.00019087114,0.0007563059,0.0006974144,0.13481966,0.19970252,0.02165929,0.0049632993,0.63254046],"study_design_scores_gemma":[0.000050932285,0.00028605715,0.0076462645,0.00011766012,0.00012128281,0.0022965367,0.00033556388,0.8036989,0.13747063,0.024529586,0.023302412,0.00014421354],"about_ca_topic_score_codex":0.0014853163,"about_ca_topic_score_gemma":0.002358112,"teacher_disagreement_score":0.004368519,"about_ca_system_score_codex":0.00044209117,"about_ca_system_score_gemma":0.0009018965,"threshold_uncertainty_score":0.014614105},"labels":[],"label_agreement":null},{"id":"W1556736612","doi":"10.1007/978-3-540-30203-2_1","title":"Improving Flow in Software Development Through Graphical Representations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Victoria","funders":"","keywords":"Computer science; Software development; Software engineering; Software; Software construction; Program comprehension; Software visualization; Software analytics; Software framework; Human–computer interaction; Software system; Programming language","score_opus":0.01993614611788694,"score_gpt":0.26879061743768595,"score_spread":0.24885447131979901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556736612","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.0056460905,0.00064683007,0.9806778,0.0002853642,0.0000636651,0.000033234843,0.000031583306,0.0039822333,0.008633243],"genre_scores_gemma":[0.12097891,0.0022968322,0.85700035,0.000147352,0.00009754598,0.00013066472,0.00026824317,0.001583209,0.017496927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915004,0.00028948358,0.000056263154,0.00011864485,0.00031777273,0.00006788405],"domain_scores_gemma":[0.99751616,0.0015512672,0.00014783807,0.0005051548,0.00021910667,0.00006045666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110451,0.0010249849,0.00044614667,0.0013044359,0.00034942708,0.0017716476,0.0012119054,0.00091586506,0.007582457],"category_scores_gemma":[0.0060704984,0.00066406716,0.0007834365,0.0013186642,0.0008749453,0.004317401,0.0014278737,0.0019626485,0.0018557751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011600769,0.00012870354,0.00040116045,0.00043941598,0.000027861395,0.00007885239,0.00063768774,0.04417987,0.016154883,0.13947333,0.008615199,0.78974706],"study_design_scores_gemma":[0.0001474893,0.00035452362,0.00070273515,0.00064326014,0.00018937007,0.00040837165,0.0001785603,0.40252528,0.07013407,0.38285866,0.141759,0.00009871423],"about_ca_topic_score_codex":0.00080389326,"about_ca_topic_score_gemma":0.0006735065,"teacher_disagreement_score":0.007582457,"about_ca_system_score_codex":0.00046220733,"about_ca_system_score_gemma":0.0006090945,"threshold_uncertainty_score":0.02536583},"labels":[],"label_agreement":null},{"id":"W1556824961","doi":"10.1007/3-540-45622-8_16","title":"Learning Options in Reinforcement Learning","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":270,"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":"Reinforcement learning; Computer science; Psychology; Artificial intelligence","score_opus":0.021089761123276374,"score_gpt":0.2445734416842048,"score_spread":0.22348368056092843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556824961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014524392,0.0062356535,0.91782737,0.0015067187,0.0003095269,0.00003816838,0.000064402906,0.00028388377,0.05920988],"genre_scores_gemma":[0.68233055,0.0060686017,0.25105098,0.00041751866,0.0004628431,0.00028971717,0.00019398786,0.0001673007,0.05901855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967146,0.0001679115,0.000014747866,0.00004713654,0.00007814249,0.000020586576],"domain_scores_gemma":[0.9990978,0.000738562,0.000029392779,0.000057759564,0.000046858924,0.00002963823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081407645,0.00063182006,0.00068008946,0.00028850796,0.00026108974,0.001121903,0.00079766015,0.0008988484,0.007125658],"category_scores_gemma":[0.0029137875,0.0003402363,0.00039167702,0.0004951528,0.0015274689,0.0025659525,0.00080714625,0.002286638,0.0008303144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042236385,0.000044846573,0.00020779905,0.00013244637,0.000026238102,0.0000570968,0.00011979473,0.07452527,0.00046489394,0.78527963,0.0046382886,0.13446146],"study_design_scores_gemma":[0.000014624526,0.000021955271,0.00006504189,0.000031062773,0.000007649739,0.000027692908,0.000017408593,0.15377645,0.00031557315,0.83972436,0.0059897746,0.000008328362],"about_ca_topic_score_codex":0.0005394966,"about_ca_topic_score_gemma":0.00062017696,"teacher_disagreement_score":0.007125658,"about_ca_system_score_codex":0.00065483956,"about_ca_system_score_gemma":0.00030640632,"threshold_uncertainty_score":0.023837686},"labels":[],"label_agreement":null},{"id":"W1556829956","doi":"10.1007/978-3-540-25966-4_14","title":"A Probabilistic Model Using Information Theoretic Measures for Cluster Ensembles","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Computer science; Conditional probability; Cluster analysis; Probability distribution; Entropy (arrow of time); Conditional probability distribution; Data mining; Divergence (linguistics); Expectation–maximization algorithm; Statistical model; Artificial intelligence; Mathematics; Statistics","score_opus":0.03497427916053233,"score_gpt":0.29213932538523485,"score_spread":0.25716504622470254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556829956","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.0038813266,0.00018209862,0.9934809,0.00040990306,0.00004795713,0.000024624916,0.00010317313,0.00009101689,0.0017790782],"genre_scores_gemma":[0.43286678,0.0015152543,0.5458333,0.0007599997,0.00096642977,0.00084647955,0.0012473216,0.0005560414,0.015408434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484056,0.0023097822,0.00028518031,0.0009168094,0.001318803,0.00032889636],"domain_scores_gemma":[0.98877245,0.0074304887,0.00087030587,0.0014374079,0.001066137,0.00042319624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055294847,0.0011502227,0.0023225746,0.0023512836,0.0018624973,0.005102461,0.006008395,0.0032965934,0.0047569717],"category_scores_gemma":[0.019787647,0.0014736545,0.0026586612,0.0034293383,0.0032259137,0.009740058,0.0039046102,0.0047112894,0.0014380798],"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.000034621065,0.00004307585,0.00035786926,0.000072078095,0.00005897408,0.0000666274,0.00017592964,0.15797311,0.0004894873,0.82531005,0.0023425776,0.013075597],"study_design_scores_gemma":[0.000005281578,0.000011296922,0.00008328528,0.000014163543,0.000015927748,0.00004825698,0.000020958327,0.5396363,0.00013078684,0.45913437,0.00087770296,0.000021716407],"about_ca_topic_score_codex":0.002205008,"about_ca_topic_score_gemma":0.002559955,"teacher_disagreement_score":0.006008395,"about_ca_system_score_codex":0.0022693153,"about_ca_system_score_gemma":0.0013075324,"threshold_uncertainty_score":0.029243052},"labels":[],"label_agreement":null},{"id":"W1556896368","doi":"10.1007/978-3-642-11876-0","title":"RoboCup 2009: Robot Soccer World Cup XIII","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":84,"is_retracted":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":"Computer science; Artificial intelligence; Robot; Humanoid robot; Computer vision; Particle filter; Simulation; Kalman filter","score_opus":0.009046672749332588,"score_gpt":0.2189738793176141,"score_spread":0.2099272065682815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556896368","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00725131,0.05286791,0.11905521,0.0029730464,0.019458225,0.00045362976,0.014812979,0.024366353,0.75876135],"genre_scores_gemma":[0.0060713226,0.008703215,0.012118044,0.0004061019,0.0008859733,0.000111738314,0.010805285,0.0032884937,0.9576099],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997693,0.00000998646,0.000008754392,0.00005432577,0.00013620946,0.0000214893],"domain_scores_gemma":[0.9997067,0.000025026984,0.000011408424,0.00002673105,0.00015617794,0.0000739877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024802663,0.0024356178,0.0011711685,0.0011290815,0.0007934939,0.00237539,0.0017882173,0.0007742945,0.16363716],"category_scores_gemma":[0.0005644404,0.00066617515,0.00055647246,0.001759657,0.00026976757,0.002057778,0.0013487738,0.0017580707,0.14427039],"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.00006780968,0.000039685507,0.00006408242,0.00022810114,0.000008694558,0.00003290888,0.000022471377,0.00076912664,0.0017086716,0.0016036283,0.8086793,0.18677548],"study_design_scores_gemma":[0.000013400057,0.00007111984,0.00065162324,0.00016129315,0.000012602578,0.00021942898,0.00003092558,0.0023971004,0.0022131582,0.001899446,0.9923064,0.000023570326],"about_ca_topic_score_codex":0.003982204,"about_ca_topic_score_gemma":0.00983858,"teacher_disagreement_score":0.16363716,"about_ca_system_score_codex":0.0008196352,"about_ca_system_score_gemma":0.0010782845,"threshold_uncertainty_score":0.54742086},"labels":[],"label_agreement":null},{"id":"W1556932833","doi":"10.1007/978-3-540-88564-1_33","title":"An Interface-Based Ontology Modularization Framework for Knowledge Encapsulation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 New Brunswick","funders":"","keywords":"Computer science; Encapsulation (networking); Modular programming; Software engineering; Ontology; Programming language","score_opus":0.03219758898829777,"score_gpt":0.29448525506737694,"score_spread":0.26228766607907916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556932833","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.00090972765,0.00007932542,0.99303097,0.00014511899,0.000045547586,0.000090814865,0.00011928319,0.003301441,0.0022778073],"genre_scores_gemma":[0.02620469,0.0002644838,0.96601135,0.00021777973,0.00006023689,0.0002959997,0.0010590501,0.0011751256,0.0047111716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787295,0.00041832917,0.00038623746,0.00039253684,0.0007188666,0.00021110203],"domain_scores_gemma":[0.9980744,0.0003975591,0.00011951925,0.0007717998,0.00048740307,0.0001491996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004513423,0.001038038,0.0011240976,0.002409378,0.001582256,0.0061346604,0.0041440134,0.0018020623,0.005938805],"category_scores_gemma":[0.0044115474,0.00140117,0.0030459983,0.002583848,0.0025110275,0.010219785,0.0059715523,0.0039573917,0.0032310283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008488159,0.00014941092,0.00039607118,0.0003035726,0.00008926048,0.00032451004,0.0013039341,0.00541339,0.008979162,0.80609846,0.01507562,0.16178164],"study_design_scores_gemma":[0.00007548007,0.000073204974,0.00037119197,0.00030189136,0.00031391688,0.00067115156,0.00032623863,0.1275353,0.024668926,0.6125437,0.2329856,0.00013332348],"about_ca_topic_score_codex":0.003864217,"about_ca_topic_score_gemma":0.004517909,"teacher_disagreement_score":0.0061346604,"about_ca_system_score_codex":0.0012740514,"about_ca_system_score_gemma":0.002712425,"threshold_uncertainty_score":0.023869574},"labels":[],"label_agreement":null},{"id":"W1557014463","doi":"10.1007/3-540-46766-1_20","title":"New Public-Key Schemes Based on Elliptic Curves over the Ring Zn","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":173,"is_retracted":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":"Factoring; Public key cryptosystem; Public-key cryptography; Elliptic curve; Cryptosystem; Mathematics; Multiplier (economics); Class (philosophy); Digital signature; Computer science; Ring (chemistry); Arithmetic; Discrete mathematics; Cryptography; Computer security; Pure mathematics; Algorithm; Encryption","score_opus":0.023630739395868256,"score_gpt":0.252383862852978,"score_spread":0.2287531234571097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557014463","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.19211636,0.014506953,0.63022214,0.0051911003,0.002648337,0.00068492047,0.0007283295,0.0031833476,0.15071853],"genre_scores_gemma":[0.7029427,0.0079929,0.19925,0.0007046195,0.001142063,0.00039045126,0.00074938365,0.0003450518,0.08648266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893814,0.0001581295,0.00007464701,0.00018262246,0.0004894932,0.00015685165],"domain_scores_gemma":[0.9989236,0.00028356173,0.00013867301,0.00037164835,0.00016171088,0.00012077295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011915064,0.0007828343,0.000945925,0.0012231201,0.0011494401,0.0029775838,0.0015881964,0.0010830015,0.0087949075],"category_scores_gemma":[0.0026209909,0.0005387961,0.0005293672,0.0013935567,0.0018698935,0.00989016,0.00297545,0.0023239804,0.0023494028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051514927,0.0001532703,0.00029005154,0.00031073607,0.00003636575,0.0001463989,0.0003667361,0.00346971,0.0133986855,0.8790033,0.0059703477,0.09633928],"study_design_scores_gemma":[0.00056372094,0.00025360077,0.00070393924,0.0002041553,0.00012023058,0.0016709509,0.00015299699,0.03655563,0.027577385,0.72519225,0.20686819,0.00013687096],"about_ca_topic_score_codex":0.00015232078,"about_ca_topic_score_gemma":0.00031769412,"teacher_disagreement_score":0.0087949075,"about_ca_system_score_codex":0.0017456008,"about_ca_system_score_gemma":0.00092900824,"threshold_uncertainty_score":0.029421866},"labels":[],"label_agreement":null},{"id":"W1557039239","doi":"10.1007/978-3-540-89694-4_39","title":"General Game Playing with Ants","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Windsor","funders":"","keywords":"Computer science; Combinatorial game theory; Artificial intelligence; Neuroevolution; Sequential game; Heuristic; Tree (set theory); Video game design; Monte Carlo tree search; Game design; Machine learning; Game theory; Artificial neural network; Mathematical economics","score_opus":0.03200967312283512,"score_gpt":0.26380372756818066,"score_spread":0.23179405444534554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557039239","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023732513,0.003555124,0.29019025,0.0017571367,0.0005471836,0.00022140161,0.00028811293,0.00093452854,0.6787737],"genre_scores_gemma":[0.5511356,0.0036422953,0.16168919,0.00058863795,0.0002978436,0.00037804665,0.00069802295,0.00035915454,0.2812112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997423,0.00007713835,0.00001162726,0.000053513562,0.00007050297,0.00004476102],"domain_scores_gemma":[0.9998323,0.00006783459,0.000010986029,0.000040055824,0.00002262347,0.000026160647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021245363,0.0007938267,0.00047576564,0.00030955777,0.0007305281,0.0019154705,0.0011854323,0.0011043645,0.017473893],"category_scores_gemma":[0.0009321669,0.00034745113,0.00069096906,0.000591079,0.0012593565,0.001783262,0.0011583152,0.0016715069,0.0029343923],"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.00010409593,0.0000896476,0.00021180211,0.00029434962,0.000038952265,0.00013278605,0.0003382234,0.03560063,0.002592228,0.86776495,0.017659888,0.075172395],"study_design_scores_gemma":[0.000046629677,0.000040785013,0.00022492059,0.00006120092,0.000017578022,0.0001989587,0.0000822739,0.06340925,0.0012600626,0.844324,0.09031923,0.000015131684],"about_ca_topic_score_codex":0.0012842153,"about_ca_topic_score_gemma":0.0016991072,"teacher_disagreement_score":0.017473893,"about_ca_system_score_codex":0.0007149421,"about_ca_system_score_gemma":0.00057763123,"threshold_uncertainty_score":0.058456063},"labels":[],"label_agreement":null},{"id":"W1557077451","doi":"10.1007/978-3-540-73597-7_25","title":"A Survey of Analysis Models and Methods in Website Verification and Testing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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":"Queen's University","funders":"","keywords":"Computer science; Software engineering; Software testing; Verification and validation; Software; Data mining; Engineering; Programming language","score_opus":0.08935207877882093,"score_gpt":0.34586456946750604,"score_spread":0.2565124906886851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557077451","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001699092,0.01688123,0.9744824,0.0009143049,0.000104414954,0.00011952023,0.00022502732,0.0011183117,0.0044557517],"genre_scores_gemma":[0.10060009,0.032167934,0.8581744,0.0008499025,0.0006409034,0.0005569676,0.00086666405,0.0009444847,0.005198646],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9850994,0.004305257,0.0017430271,0.0019725335,0.006395026,0.00048472098],"domain_scores_gemma":[0.96234554,0.028510552,0.0015949903,0.0048926286,0.002404978,0.00025134571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010108172,0.0028588155,0.0036377632,0.00600844,0.0011482916,0.006873263,0.0049867183,0.002806102,0.0051088384],"category_scores_gemma":[0.030305343,0.0021188112,0.0038016522,0.0058552236,0.003328739,0.010066367,0.0026006175,0.0037091412,0.0025091984],"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.00015072104,0.00037633715,0.003115014,0.0028211954,0.00022484391,0.0003001058,0.00035490366,0.063399486,0.0026328703,0.35456532,0.011630642,0.5604286],"study_design_scores_gemma":[0.00004630206,0.00013177807,0.0011055003,0.0013048847,0.00022817246,0.0008389575,0.00016346238,0.2885105,0.0058915946,0.66080064,0.04084853,0.0001296529],"about_ca_topic_score_codex":0.004135413,"about_ca_topic_score_gemma":0.0034561635,"teacher_disagreement_score":0.010108172,"about_ca_system_score_codex":0.0031333712,"about_ca_system_score_gemma":0.0038319777,"threshold_uncertainty_score":0.053457737},"labels":[],"label_agreement":null},{"id":"W1557139302","doi":"10.1007/11534273_26","title":"A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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":"University of Alberta","funders":"","keywords":"Adjacency list; Computer science; Graph; Adjacency matrix; Labelling; Line (geometry); Combinatorics; Scheme (mathematics); Line graph; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science","score_opus":0.009875477647055073,"score_gpt":0.22399919091034076,"score_spread":0.2141237132632857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557139302","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.0069301343,0.00005358646,0.9825616,0.00009087761,0.000058029924,0.00007592964,0.00035093157,0.0014595679,0.008419242],"genre_scores_gemma":[0.10924377,0.00022819826,0.8687821,0.00011508634,0.0000622077,0.00026529032,0.0011869775,0.00075980823,0.019356476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916244,0.00019290071,0.00006553928,0.00018116334,0.00029068973,0.00010722861],"domain_scores_gemma":[0.9975132,0.0006207433,0.000116530915,0.0012559465,0.0003887733,0.000104925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092705456,0.00060502614,0.0006842258,0.0012554993,0.0014370264,0.0022188735,0.002837566,0.0010692303,0.013899811],"category_scores_gemma":[0.0034338178,0.0006804493,0.00066346716,0.0024034863,0.0011554544,0.0051656333,0.0029588365,0.002388302,0.0041592666],"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.00023305028,0.00015763144,0.00019993962,0.00021205095,0.000015858053,0.000080200734,0.00055575394,0.026792374,0.014772408,0.6101887,0.013424676,0.33336726],"study_design_scores_gemma":[0.00009569208,0.000113084076,0.00018022972,0.00011390667,0.00004616189,0.00015331327,0.00017830062,0.2561021,0.016256941,0.6369133,0.0897608,0.00008623057],"about_ca_topic_score_codex":0.0018346582,"about_ca_topic_score_gemma":0.0032025746,"teacher_disagreement_score":0.013899811,"about_ca_system_score_codex":0.0009912376,"about_ca_system_score_gemma":0.0009401566,"threshold_uncertainty_score":0.04649949},"labels":[],"label_agreement":null},{"id":"W1557217172","doi":"10.1007/978-3-540-74628-7_21","title":"Word Distribution Based Methods for Minimizing Segment Overlaps","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Guelph","funders":"","keywords":"Cohesion (chemistry); Computer science; Natural language processing; Text segmentation; Word (group theory); Segmentation; Artificial intelligence; Task (project management); Sequence (biology); Linguistics; Engineering","score_opus":0.030367122043345688,"score_gpt":0.34208663133721773,"score_spread":0.31171950929387204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557217172","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.010772478,0.00082130946,0.9845659,0.00008299655,0.00008688646,0.0000922589,0.00029807707,0.002331243,0.0009487819],"genre_scores_gemma":[0.10308762,0.0008706648,0.87862337,0.0001918266,0.00023470653,0.0004504539,0.0040708864,0.0021180685,0.010352346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795866,0.00037122174,0.00017769235,0.0005454242,0.00075220666,0.00019476067],"domain_scores_gemma":[0.99568594,0.0026106527,0.0001720266,0.00043923,0.0009807068,0.00011157576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020063224,0.0020844373,0.0027062215,0.004299731,0.0012165642,0.0017977769,0.002992321,0.0023987347,0.008062995],"category_scores_gemma":[0.0056845327,0.0011279543,0.001627088,0.005348971,0.0010171991,0.0030835413,0.0023919484,0.0018074629,0.004427964],"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.0006968411,0.00018926727,0.0012082467,0.00037454913,0.00015853708,0.00017000517,0.0002195813,0.061028242,0.023110166,0.008560121,0.009452296,0.8948322],"study_design_scores_gemma":[0.0000897848,0.00015632113,0.0012599183,0.000044964658,0.00014340674,0.00027127995,0.0001641575,0.9440269,0.020039028,0.024791608,0.00897041,0.000042283387],"about_ca_topic_score_codex":0.0052023027,"about_ca_topic_score_gemma":0.0116072595,"teacher_disagreement_score":0.008062995,"about_ca_system_score_codex":0.00086588366,"about_ca_system_score_gemma":0.0017898013,"threshold_uncertainty_score":0.026973367},"labels":[],"label_agreement":null},{"id":"W1557240566","doi":"10.1007/3-540-37620-8_3","title":"Pointing and Visual Feedback for Spatial Interaction in Large-Screen Display Environments","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visual feedback; Illusion; Computer vision; Artificial intelligence; Optical illusion; Frame (networking); Offset (computer science); Visual perception; Frame of reference; Reference frame; Human–computer interaction; Cognitive psychology; Perception; Psychology; Neuroscience","score_opus":0.012482764544939549,"score_gpt":0.2580336686441565,"score_spread":0.24555090409921695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557240566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09761858,0.012022317,0.85173804,0.00043947925,0.0005936298,0.00018609273,0.0003233765,0.00714393,0.029934539],"genre_scores_gemma":[0.73630404,0.005205235,0.21556826,0.00018182519,0.00018150017,0.0004324206,0.00043476583,0.00080806995,0.040883835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956495,0.00013837815,0.000026031126,0.00006148521,0.00016239537,0.000046832396],"domain_scores_gemma":[0.9984841,0.0010882412,0.0000454063,0.00013566086,0.00019391607,0.00005275855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000542784,0.00092056097,0.0006630588,0.00036707896,0.0004284751,0.0010224252,0.0011746002,0.0013771744,0.01946976],"category_scores_gemma":[0.0037180365,0.00040036847,0.0003396115,0.0004655866,0.00047138284,0.001645187,0.0010868364,0.00082578225,0.002421796],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025241675,0.00014164888,0.00037090547,0.001250335,0.000044353124,0.0003088775,0.0012054925,0.006594029,0.38765395,0.010846081,0.011019025,0.5780411],"study_design_scores_gemma":[0.0010792519,0.0051730652,0.024312045,0.0012983583,0.00043237873,0.0049998113,0.0020413601,0.33731124,0.39661968,0.07874035,0.14757076,0.00042165772],"about_ca_topic_score_codex":0.0013686761,"about_ca_topic_score_gemma":0.0021610772,"teacher_disagreement_score":0.01946976,"about_ca_system_score_codex":0.00021621809,"about_ca_system_score_gemma":0.00031066054,"threshold_uncertainty_score":0.06513286},"labels":[],"label_agreement":null},{"id":"W1557298495","doi":"10.1007/11795131_7","title":"Partition Dependencies in Hierarchies of Probabilistic Decision Tables","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Computer science; Partition (number theory); Probabilistic logic; Decision table; Theoretical computer science; Data mining; Artificial intelligence; Mathematics; Combinatorics; Rough set","score_opus":0.016649909374134134,"score_gpt":0.23292720503804334,"score_spread":0.2162772956639092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557298495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08783939,0.002824783,0.89833784,0.00071845803,0.000073587566,0.00012802446,0.0013030928,0.00048343724,0.008291437],"genre_scores_gemma":[0.56362903,0.0024755853,0.42386153,0.00020391562,0.00017754655,0.00034211605,0.003443908,0.00022594954,0.0056404383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966377,0.0013116635,0.0002497752,0.00042533723,0.0011242045,0.0002514355],"domain_scores_gemma":[0.9818903,0.01514294,0.0009062796,0.0008834601,0.0008294212,0.00034759642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039615342,0.00062854827,0.0014644705,0.002558234,0.0012372249,0.0037164083,0.0016978136,0.0011309469,0.0046192855],"category_scores_gemma":[0.021236844,0.0021531282,0.0014654009,0.0043673306,0.0015085844,0.0069301864,0.0017126626,0.0020930236,0.00062078726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029708585,0.00010350335,0.0034287584,0.0005915228,0.00016651588,0.00029914163,0.0010819117,0.20384976,0.0017360938,0.67749304,0.00636021,0.10459239],"study_design_scores_gemma":[0.000027962727,0.000030761727,0.0011146873,0.000075050615,0.00006398742,0.00010172589,0.000077380784,0.2554882,0.00051342306,0.73920345,0.0032735695,0.000029849654],"about_ca_topic_score_codex":0.0053008916,"about_ca_topic_score_gemma":0.008563203,"teacher_disagreement_score":0.0053008916,"about_ca_system_score_codex":0.0020619554,"about_ca_system_score_gemma":0.0014208956,"threshold_uncertainty_score":0.020950854},"labels":[],"label_agreement":null},{"id":"W1557327310","doi":"10.1007/978-3-540-72665-4_18","title":"Pattern Classification in No-Limit Poker: A Head-Start Evolutionary Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Regina","funders":"","keywords":"Computer science; Scratch; Classifier (UML); Artificial intelligence; Head (geology); Machine learning; Limit (mathematics); Operating system; Mathematics","score_opus":0.07049702177687692,"score_gpt":0.2965773750016932,"score_spread":0.22608035322481626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557327310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12592284,0.000324165,0.8639535,0.0004663053,0.00007212723,0.00016041944,0.00007017383,0.00045135018,0.008579169],"genre_scores_gemma":[0.5233476,0.00019811862,0.4612133,0.00023495665,0.000066588,0.0001628581,0.0002216892,0.00017240198,0.01438247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994722,0.00015423361,0.000032491087,0.00014582727,0.00012326353,0.00007195742],"domain_scores_gemma":[0.9971973,0.0018092303,0.00011960375,0.00025146632,0.0004914043,0.00013105133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449754,0.0003989793,0.0013334017,0.0014258553,0.000917153,0.0014693988,0.002385359,0.0018419789,0.0043007536],"category_scores_gemma":[0.0052996273,0.0004790154,0.0009329124,0.0012118876,0.0010701877,0.0019332165,0.0012461477,0.0011468317,0.00054521085],"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.00022621271,0.00046598833,0.008290742,0.00021905913,0.00014513776,0.0003273579,0.00051997893,0.40634784,0.0076006046,0.049732406,0.003361919,0.5227627],"study_design_scores_gemma":[0.000009926537,0.00003191955,0.00041157362,0.0000086260525,0.000015784724,0.000060552386,0.0000482629,0.9841202,0.00070168247,0.014162925,0.00042160435,0.0000069141156],"about_ca_topic_score_codex":0.0034160207,"about_ca_topic_score_gemma":0.0036183163,"teacher_disagreement_score":0.0043007536,"about_ca_system_score_codex":0.00071537896,"about_ca_system_score_gemma":0.0007859392,"threshold_uncertainty_score":0.014387429},"labels":[],"label_agreement":null},{"id":"W1557370378","doi":"10.1007/11744078_3","title":"Sparse Flexible Models of Local Features","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Prior probability; Pattern recognition (psychology); Feature (linguistics); Representation (politics); Inference; Object (grammar); Matching (statistics); Class (philosophy); Cognitive neuroscience of visual object recognition; Machine learning; Mathematics","score_opus":0.02240709996144876,"score_gpt":0.26966446138430755,"score_spread":0.24725736142285878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557370378","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.008044197,0.000349198,0.9898711,0.0001548474,0.00003855015,0.000012153061,0.00017121811,0.00023628234,0.0011225006],"genre_scores_gemma":[0.7800092,0.0020301505,0.19519238,0.00031946014,0.0003294664,0.00021819511,0.0018126495,0.00046341753,0.019625112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953735,0.00013062867,0.000017860893,0.00013357081,0.000117281656,0.000063297615],"domain_scores_gemma":[0.9984372,0.000796558,0.00015465009,0.00039124736,0.00015503669,0.00006530349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008654745,0.00085423974,0.0014577688,0.0008401249,0.0002884282,0.0015060166,0.0028734775,0.0020977505,0.0031653107],"category_scores_gemma":[0.0047462853,0.0011232963,0.0010260791,0.0018802744,0.001221453,0.003695577,0.0017710278,0.002432972,0.0012102657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012779803,0.000039632712,0.0003215368,0.000113402384,0.00006166945,0.00011496258,0.00007047011,0.8252711,0.004447439,0.10492234,0.0031376015,0.06137206],"study_design_scores_gemma":[0.0000048991305,0.000009771475,0.000058574915,0.0000039366746,0.000006159707,0.00002528304,0.000004172197,0.9754043,0.00026092265,0.023868393,0.0003468401,0.0000066219145],"about_ca_topic_score_codex":0.0031393643,"about_ca_topic_score_gemma":0.004208214,"teacher_disagreement_score":0.0031653107,"about_ca_system_score_codex":0.00060227665,"about_ca_system_score_gemma":0.0003744519,"threshold_uncertainty_score":0.010589004},"labels":[],"label_agreement":null},{"id":"W1557381702","doi":"10.1007/978-3-642-32630-1_9","title":"CT-US Registration for Guidance of Transcatheter Aortic Valve Implantation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Biplane; Fluoroscopy; Computer science; Image registration; Computer vision; Artificial intelligence; Iterative closest point; Medicine; Radiology; Image (mathematics); Point cloud","score_opus":0.019656516480703774,"score_gpt":0.3173413037149888,"score_spread":0.29768478723428504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557381702","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.030974861,0.06520584,0.7592712,0.003483816,0.0023674297,0.0003302161,0.0011836765,0.004236302,0.13294664],"genre_scores_gemma":[0.32194743,0.049585387,0.55368465,0.0024371871,0.0018267531,0.0003170669,0.0016700559,0.0023884638,0.066142954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998198,0.00004938673,0.00002124261,0.000025014831,0.00007053749,0.000014079232],"domain_scores_gemma":[0.99948585,0.00030666418,0.00003451627,0.000076661585,0.000066425986,0.000029813713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006516196,0.00053893484,0.00035548233,0.0011321311,0.0002472541,0.0012521263,0.00071632554,0.0010264369,0.010107901],"category_scores_gemma":[0.0020251733,0.00047352153,0.0005175284,0.0009022824,0.0003644608,0.0008621263,0.0006224532,0.0015069778,0.003420982],"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.00057490723,0.0000781254,0.0013872181,0.0010700593,0.000052769356,0.0017233519,0.00028904,0.006965938,0.10761472,0.011645153,0.036212172,0.83238655],"study_design_scores_gemma":[0.00019611292,0.0011285256,0.013874742,0.0018777376,0.00048893405,0.08360677,0.00028340556,0.06908292,0.19752537,0.01769648,0.61388487,0.00035410497],"about_ca_topic_score_codex":0.0010168145,"about_ca_topic_score_gemma":0.0018527216,"teacher_disagreement_score":0.010107901,"about_ca_system_score_codex":0.00027100265,"about_ca_system_score_gemma":0.00087392755,"threshold_uncertainty_score":0.03381431},"labels":[],"label_agreement":null},{"id":"W1557406404","doi":"10.1007/978-3-540-30187-5_4","title":"A Metamodel for Generating Performance Models from UML Designs","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Metamodeling; Unified Modeling Language; Rotation formalisms in three dimensions; Queueing theory; Petri net; Applications of UML; Process (computing); Distributed computing; Programming language; Software","score_opus":0.04388536960521694,"score_gpt":0.25197371794667733,"score_spread":0.2080883483414604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557406404","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.0025680487,0.0000401705,0.9834378,0.00009646516,0.00003145978,0.00018249935,0.0008324272,0.011068946,0.0017421228],"genre_scores_gemma":[0.037326742,0.00027163766,0.9507386,0.00011690759,0.000021080414,0.0005952492,0.00398864,0.0036248143,0.0033163547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983719,0.00039076371,0.00022606063,0.00021035688,0.0007136507,0.00008733443],"domain_scores_gemma":[0.99521255,0.002499978,0.0004346283,0.0009801297,0.00077598816,0.00009669839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00306999,0.0018048915,0.0007428426,0.0029258581,0.00069418375,0.0022772136,0.0019902787,0.0016638768,0.0060978946],"category_scores_gemma":[0.010794069,0.0019850149,0.0026243562,0.0012978276,0.0006397463,0.00268246,0.0013885094,0.002272694,0.003449566],"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.00039231154,0.00084915163,0.005953066,0.0020191108,0.0002840241,0.0016384239,0.00268722,0.22883524,0.06338708,0.19595861,0.03615239,0.46184337],"study_design_scores_gemma":[0.00016013513,0.00017730109,0.000831694,0.00062175805,0.00034204064,0.0008451716,0.00027817907,0.7166996,0.06284796,0.069351114,0.14769408,0.00015106228],"about_ca_topic_score_codex":0.0035329373,"about_ca_topic_score_gemma":0.005114967,"teacher_disagreement_score":0.0060978946,"about_ca_system_score_codex":0.001155978,"about_ca_system_score_gemma":0.0024989222,"threshold_uncertainty_score":0.020399451},"labels":[],"label_agreement":null},{"id":"W1557429592","doi":"10.1007/978-3-642-15512-3_36","title":"Towards Automatic Deduction and Event Reconstruction Using Forensic Lucid and Probabilities to Encode the IDS Evidence","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Cyber Forensics","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":"Concordia University","funders":"","keywords":"Computer science; Lucid dream; ENCODE; Event (particle physics); Artificial intelligence; Natural language processing","score_opus":0.022943895947940218,"score_gpt":0.24720739414175058,"score_spread":0.22426349819381036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557429592","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.0031116263,0.00012239553,0.9917133,0.000116879215,0.000036204074,0.00005482592,0.00025507572,0.0039410396,0.0006486302],"genre_scores_gemma":[0.06469733,0.00021361177,0.9319825,0.00010190008,0.000046210625,0.000071121634,0.001198876,0.00045498207,0.0012333891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750334,0.0005925573,0.00025104766,0.00061193085,0.0008789232,0.00016232184],"domain_scores_gemma":[0.99115074,0.0048926803,0.0005123965,0.0021545887,0.0011863208,0.000103273305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030444376,0.0012050122,0.0013316827,0.0037364156,0.0011634196,0.0044346913,0.0030374653,0.0015672282,0.0044962536],"category_scores_gemma":[0.015543808,0.0014714138,0.0024240734,0.0021839559,0.0022375442,0.0067610163,0.004648164,0.0032789786,0.0029912286],"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.00047831933,0.00018414439,0.0019718548,0.00066586514,0.00016342255,0.0007337868,0.000622342,0.08910834,0.015821602,0.14673965,0.008811405,0.73469925],"study_design_scores_gemma":[0.00003202916,0.00006623703,0.00038952092,0.00013346653,0.00010407786,0.00046510622,0.0001150741,0.6942258,0.038166825,0.25649202,0.009752123,0.000057666835],"about_ca_topic_score_codex":0.0022709137,"about_ca_topic_score_gemma":0.0027276354,"teacher_disagreement_score":0.0044962536,"about_ca_system_score_codex":0.0012802448,"about_ca_system_score_gemma":0.0020763376,"threshold_uncertainty_score":0.016100764},"labels":[],"label_agreement":null},{"id":"W1557447656","doi":"10.1007/978-3-540-24840-8_60","title":"Extending Montague Semantics for Use in Natural-Language Database-Query Processing","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Windsor","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Computational semantics; Natural language processing; Natural language; Syntax; Artificial intelligence; Linguistics; Operational semantics","score_opus":0.023782945619373927,"score_gpt":0.2711180010463937,"score_spread":0.24733505542701978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557447656","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.007885242,0.00019356453,0.9802203,0.00035872098,0.00008984083,0.000119669196,0.00017430937,0.0042380095,0.006720306],"genre_scores_gemma":[0.25319827,0.0002997866,0.7361779,0.0005015243,0.00021097028,0.00036569822,0.00082670746,0.0013983801,0.007020807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967007,0.0010643291,0.0004166029,0.0005416481,0.0009012691,0.00037551357],"domain_scores_gemma":[0.99593264,0.0017678409,0.0002481713,0.0011408799,0.000718687,0.00019193585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042460486,0.0009764099,0.0014035312,0.0023600063,0.0024053783,0.0060644103,0.0032871081,0.0013962446,0.0085300105],"category_scores_gemma":[0.010227332,0.0009820506,0.0020817977,0.0027445664,0.0032762433,0.012690913,0.0053625763,0.0024788019,0.00206167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029882602,0.00022488098,0.0007479958,0.00021123113,0.000050469567,0.00027839202,0.0013594528,0.0077575687,0.0044966694,0.85916597,0.0077261315,0.117682435],"study_design_scores_gemma":[0.000091355614,0.0000924041,0.00012638337,0.0000751316,0.00008089978,0.0002897591,0.0002798381,0.0841276,0.008486928,0.8691482,0.037139665,0.00006172464],"about_ca_topic_score_codex":0.006305422,"about_ca_topic_score_gemma":0.008759024,"teacher_disagreement_score":0.0085300105,"about_ca_system_score_codex":0.0013728106,"about_ca_system_score_gemma":0.0015648246,"threshold_uncertainty_score":0.028535783},"labels":[],"label_agreement":null},{"id":"W1557455359","doi":"10.1007/978-3-540-27764-4_7","title":"Describing Gen/Kill Static Analysis Techniques with Kleene Algebra","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université Laval","funders":"","keywords":"Kleene algebra; Computer science; Control flow graph; Static analysis; Kleene's recursion theorem; Control flow; Compiler; Programming language; Program analysis; Theoretical computer science; Graph; Algebra over a field; Compile time; Call graph; Algorithm; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.015703920000733677,"score_gpt":0.24144414169345718,"score_spread":0.2257402216927235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557455359","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.0032480368,0.0007166106,0.9635886,0.00024735305,0.00012508302,0.00010738949,0.0002308037,0.007300396,0.024435746],"genre_scores_gemma":[0.14735231,0.003025635,0.80232966,0.000628895,0.0002357696,0.00025885832,0.0015262471,0.0065820385,0.03806063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985769,0.00023890978,0.000110360466,0.00023376124,0.0006544621,0.00018557067],"domain_scores_gemma":[0.9991172,0.00043612425,0.000050920327,0.0002525447,0.00012212773,0.000021084956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012235414,0.0014802516,0.00087850355,0.0023394946,0.0015368251,0.0036326698,0.0020901074,0.0012256848,0.01557319],"category_scores_gemma":[0.0027202764,0.0014688218,0.0022668487,0.0024847325,0.0021023983,0.008334383,0.0023436486,0.0034848978,0.008607499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014055162,0.00013335161,0.0005239346,0.00079357583,0.0000857536,0.0005951038,0.00084368064,0.013340513,0.017571868,0.67662376,0.016218012,0.2731299],"study_design_scores_gemma":[0.000030615454,0.000047975813,0.0002829769,0.00019842004,0.00010701478,0.0007568107,0.00018143373,0.045378916,0.03357864,0.7891499,0.1301833,0.00010404049],"about_ca_topic_score_codex":0.0011585039,"about_ca_topic_score_gemma":0.0022153556,"teacher_disagreement_score":0.01557319,"about_ca_system_score_codex":0.0010209886,"about_ca_system_score_gemma":0.0010871383,"threshold_uncertainty_score":0.05209756},"labels":[],"label_agreement":null},{"id":"W1557475033","doi":"10.1007/3-540-45841-7_37","title":"Nesting Until and Since in Linear Temporal Logic","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Temporal logic; Interval temporal logic; Characterization (materials science); Hierarchy; Property (philosophy); Computer science; Computation tree logic; Class (philosophy); Block (permutation group theory); Algebraic number; Semigroup; Mathematics; Theoretical computer science; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Artificial intelligence; Combinatorics","score_opus":0.02280034160031561,"score_gpt":0.23929726892646178,"score_spread":0.21649692732614617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557475033","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.03554449,0.0041898848,0.8180117,0.002455369,0.0008067377,0.000092911185,0.00031517356,0.0022666585,0.13631712],"genre_scores_gemma":[0.6124051,0.002738077,0.30360866,0.0011015551,0.0007822287,0.00013866037,0.00041928826,0.0013991544,0.07740735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.00046582276,0.00010157563,0.00022228809,0.0002389764,0.00016656375],"domain_scores_gemma":[0.99803406,0.0011970542,0.00014191699,0.0003458162,0.00017425552,0.0001067787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018635057,0.00063948514,0.0007063962,0.0008465576,0.0021573564,0.003554662,0.00143025,0.0009377782,0.006485509],"category_scores_gemma":[0.0037385677,0.0014601224,0.0010048513,0.0016301473,0.004246234,0.012667114,0.0019273061,0.003343646,0.0016304316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003364162,0.000012332044,0.000083793624,0.000050197625,0.0000045410516,0.00006491076,0.00065859564,0.0006607598,0.0005407405,0.97588444,0.001438608,0.02056738],"study_design_scores_gemma":[0.000009517485,0.000014455274,0.000033848384,0.000025184156,0.000019616451,0.000089502726,0.00009512182,0.0031942537,0.0008812953,0.9814432,0.014180776,0.000013241598],"about_ca_topic_score_codex":0.0029165319,"about_ca_topic_score_gemma":0.0047276737,"teacher_disagreement_score":0.006485509,"about_ca_system_score_codex":0.001807358,"about_ca_system_score_gemma":0.0012602084,"threshold_uncertainty_score":0.02169621},"labels":[],"label_agreement":null},{"id":"W1557503982","doi":"10.1007/3-540-45672-4_50","title":"Are Testers eXtinct? How Can Testers Contribute to XP Teams?","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"TransCanada (Canada)","funders":"","keywords":"Extreme programming; Computer science; Test (biology); Quality (philosophy); Software; World Wide Web; Software engineering; Software development; Software development process; Programming language","score_opus":0.014176524186558627,"score_gpt":0.22510482517148164,"score_spread":0.21092830098492302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557503982","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5067719,0.005129886,0.031162908,0.25134346,0.0018549792,0.00027898807,0.00013969286,0.0004978468,0.20282024],"genre_scores_gemma":[0.94933,0.0012044015,0.0056310715,0.015229012,0.0004726665,0.00015565971,0.00007736147,0.00014304082,0.027756682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98166925,0.009645083,0.00055747345,0.0015429078,0.0034463638,0.003138878],"domain_scores_gemma":[0.8695429,0.063103914,0.013046028,0.0095783025,0.01747567,0.02725323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02363333,0.00055836653,0.00068382587,0.0019366485,0.006083211,0.0077051898,0.0038966173,0.0057129045,0.018222157],"category_scores_gemma":[0.13422778,0.0007267129,0.0006329112,0.0012548843,0.009166612,0.013780697,0.008888482,0.0059677437,0.0032216895],"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.0005788991,0.0014924147,0.19052513,0.0004148956,0.00017128405,0.0046245083,0.048546534,0.002050077,0.0020570217,0.11537726,0.06433088,0.569831],"study_design_scores_gemma":[0.0003984156,0.0017989693,0.12815553,0.0026717677,0.00027301165,0.006207228,0.122579,0.0065698503,0.0025768739,0.5440379,0.18450755,0.00022395967],"about_ca_topic_score_codex":0.0025103756,"about_ca_topic_score_gemma":0.003661048,"teacher_disagreement_score":0.02363333,"about_ca_system_score_codex":0.0026194605,"about_ca_system_score_gemma":0.0056566996,"threshold_uncertainty_score":0.12498647},"labels":[],"label_agreement":null},{"id":"W1557529316","doi":"10.1007/3-540-44843-8_90","title":"Effect of Vortex Profile on Sound Generation in a Non-uniform Flow","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fluid Dynamics and Turbulent Flows","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":"Concordia University","funders":"","keywords":"Vortex; Physics; Mechanics; Sound pressure; Vorticity; Mean flow; Acoustic radiation; Vortex ring; Acoustic wave; Aeroacoustics; Flow (mathematics); Starting vortex; Acoustics; Optics; Turbulence; Radiation","score_opus":0.0064914413593324645,"score_gpt":0.20685995503528284,"score_spread":0.20036851367595038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557529316","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.9853195,0.00041074984,0.01073174,0.00006555209,0.00006532268,0.000021535117,0.000051377894,0.00019528905,0.0031389536],"genre_scores_gemma":[0.99849963,0.00011041761,0.00086831296,0.000011401465,0.000012084949,0.0000026936327,0.000019085943,0.000035974615,0.00044037527],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997894,0.000080481164,0.000008950593,0.000030016308,0.000044273744,0.00004690107],"domain_scores_gemma":[0.99710804,0.0021902507,0.00014424023,0.00011274815,0.00020142997,0.00024333058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036288385,0.00036969202,0.00045921182,0.00044127184,0.0003181327,0.00068696216,0.0002813747,0.00043314896,0.002215055],"category_scores_gemma":[0.0028493812,0.00030325775,0.00025223457,0.00036118817,0.000549535,0.0005038538,0.00040393625,0.00037120897,0.0003023974],"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.008571621,0.0005681075,0.0046791723,0.00028940247,0.00004679065,0.00094780663,0.00027742074,0.044591475,0.8883491,0.0014288292,0.0005298875,0.049720414],"study_design_scores_gemma":[0.00050304324,0.0022603662,0.018322024,0.000066554276,0.00021455094,0.000627266,0.0002137844,0.2917091,0.6840825,0.0011381862,0.0007732476,0.00008928951],"about_ca_topic_score_codex":0.0003233147,"about_ca_topic_score_gemma":0.0002155711,"teacher_disagreement_score":0.002215055,"about_ca_system_score_codex":0.00021188556,"about_ca_system_score_gemma":0.00019722225,"threshold_uncertainty_score":0.007410109},"labels":[],"label_agreement":null},{"id":"W1557666268","doi":"10.1007/978-3-642-21073-0_10","title":"Skeleton Path Based Approach for Nonrigid 3D Shape Analysis and Retrieval","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"","keywords":"Geodesic; Computer science; Skeleton (computer programming); Topological skeleton; Robustness (evolution); Artificial intelligence; Path (computing); Graph; Pattern recognition (psychology); Shape analysis (program analysis); Computer vision; Segmentation; Theoretical computer science; Mathematics; Active shape model; Geometry","score_opus":0.01724058477939125,"score_gpt":0.21459280917624754,"score_spread":0.1973522243968563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557666268","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.002903358,0.0003939333,0.9923413,0.00004066788,0.00004565585,0.00006662389,0.00017972232,0.0020874904,0.0019413047],"genre_scores_gemma":[0.043513514,0.0010594779,0.9386872,0.0000946811,0.000045178247,0.00012518423,0.0013853764,0.0005511165,0.014538288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932015,0.000053331838,0.000024319303,0.00010524898,0.00044803286,0.000048923757],"domain_scores_gemma":[0.99967444,0.000055969627,0.000017409364,0.000102811835,0.00013531772,0.000014157332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003907586,0.0009683805,0.0009491135,0.0021284705,0.0005348608,0.0010810122,0.0016918774,0.0012291142,0.01272955],"category_scores_gemma":[0.0007889309,0.00054659706,0.0010351574,0.0025382326,0.00047574635,0.0015708819,0.0013571972,0.0008616988,0.0070017],"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.0001139726,0.00010314552,0.00026145828,0.0002032884,0.000055292647,0.00014672815,0.000087331915,0.019801654,0.103247955,0.010044517,0.011301078,0.8546337],"study_design_scores_gemma":[0.000020325111,0.00015050112,0.0013363876,0.000033437947,0.00005960464,0.0011790441,0.000096777134,0.86478883,0.07460571,0.021921081,0.03575502,0.000053376847],"about_ca_topic_score_codex":0.002971205,"about_ca_topic_score_gemma":0.006378603,"teacher_disagreement_score":0.01272955,"about_ca_system_score_codex":0.00049484725,"about_ca_system_score_gemma":0.0009151789,"threshold_uncertainty_score":0.042584598},"labels":[],"label_agreement":null},{"id":"W1557674169","doi":"10.1007/11428848_42","title":"On the Impulse Method for Cloth Animation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and 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":"Western University","funders":"","keywords":"Computer science; Computer graphics (images); Animation; Impulse (physics); Computer vision; Physics","score_opus":0.017597540795253986,"score_gpt":0.2589744967838225,"score_spread":0.2413769559885685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557674169","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.0016704554,0.0008758297,0.9824154,0.000093364324,0.00025807525,0.00002019232,0.000041247207,0.000692159,0.013933364],"genre_scores_gemma":[0.12912376,0.004310878,0.7887153,0.00030161595,0.0005978865,0.00016903282,0.0004435783,0.002001955,0.07433594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975306,0.0000641478,0.000011094358,0.00003204447,0.00011631694,0.000023386043],"domain_scores_gemma":[0.9997402,0.00014214727,0.000008819314,0.00004382762,0.000043897555,0.000021201513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037337394,0.00058667676,0.00064010464,0.0010604919,0.0004002477,0.00091108633,0.0010173135,0.0008338987,0.018778428],"category_scores_gemma":[0.0011789651,0.00048822438,0.00082218304,0.0009997683,0.00095307623,0.0011820463,0.0016408757,0.002073051,0.004133601],"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.00011035947,0.00006740731,0.00021700637,0.00031706825,0.000048465106,0.00016150923,0.00023969384,0.07002381,0.013780004,0.35439843,0.018277468,0.54235876],"study_design_scores_gemma":[0.000035128607,0.00005219517,0.0002695844,0.00010494349,0.000022317434,0.00025431009,0.00006815498,0.6384198,0.0053148065,0.26633418,0.089084595,0.000040069106],"about_ca_topic_score_codex":0.0011454375,"about_ca_topic_score_gemma":0.0012999505,"teacher_disagreement_score":0.018778428,"about_ca_system_score_codex":0.00038366707,"about_ca_system_score_gemma":0.0002670692,"threshold_uncertainty_score":0.06282008},"labels":[],"label_agreement":null},{"id":"W1557675393","doi":"10.1007/3-540-36389-0_30","title":"Adaptive File Cache Management for Mobile Computing","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","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 Saskatchewan","funders":"","keywords":"Computer science; Cache; Cache algorithms; Cache invalidation; Smart Cache; Cache pollution; Page cache; Operating system; Mobile computing; Computer network; File system; Block (permutation group theory); Distributed computing; CPU cache","score_opus":0.02461779716283751,"score_gpt":0.25351260726933345,"score_spread":0.22889481010649593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557675393","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.09940673,0.02239847,0.82648224,0.0011742205,0.00086490525,0.00025978958,0.0007912658,0.015916547,0.032705814],"genre_scores_gemma":[0.7716766,0.005075176,0.18431994,0.0003540958,0.00048646168,0.00019185123,0.00095070974,0.0007300845,0.03621507],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997863,0.000031933483,0.00001379412,0.000033700606,0.0000868973,0.000047332964],"domain_scores_gemma":[0.99936885,0.00019064274,0.000032886484,0.00018598246,0.00018701992,0.000034611803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032008096,0.00049616926,0.0005581032,0.000751325,0.00065634213,0.0011024904,0.0020586879,0.0007672269,0.005381828],"category_scores_gemma":[0.0013186936,0.00024415227,0.00022784749,0.0013793127,0.00025743587,0.0019449188,0.00069774844,0.00086307275,0.0010506265],"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.0006641192,0.00021610344,0.0018314654,0.00044709013,0.000087730514,0.00028120683,0.00026317887,0.03792903,0.067565985,0.024270998,0.048727144,0.8177159],"study_design_scores_gemma":[0.0001341531,0.00050812133,0.0035490517,0.00016881636,0.00022636124,0.0016225678,0.00036886724,0.7558567,0.07537834,0.041630868,0.12043611,0.000120023666],"about_ca_topic_score_codex":0.0028000416,"about_ca_topic_score_gemma":0.0044859243,"teacher_disagreement_score":0.005381828,"about_ca_system_score_codex":0.0005815806,"about_ca_system_score_gemma":0.00039988043,"threshold_uncertainty_score":0.018004},"labels":[],"label_agreement":null},{"id":"W1557692463","doi":"10.1007/3-540-45435-7_20","title":"On the Proper Learning of Axis Parallel Concepts","year":2002,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Equivalence (formal languages); Mathematics; Oracle; Time complexity; Polynomial; Combinatorics; Concept class; Discrete mathematics; Constant (computer programming); Disjunctive normal form; Binary decision diagram; Computer science; Algorithm; Artificial intelligence","score_opus":0.01622434892193078,"score_gpt":0.2566282629044358,"score_spread":0.24040391398250502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557692463","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.035626166,0.0011446303,0.9520815,0.001509132,0.00023251204,0.00006864834,0.00016204348,0.00039279554,0.008782661],"genre_scores_gemma":[0.55858046,0.0023487916,0.42187968,0.0010885667,0.0008028678,0.0002885364,0.0013086142,0.00040625088,0.013296302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973145,0.00108395,0.0001953319,0.00068537774,0.0005416704,0.00017908789],"domain_scores_gemma":[0.9829705,0.011367742,0.0008579521,0.002368702,0.001805119,0.0006300109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053139897,0.00087342714,0.0016203722,0.0015683948,0.0013887256,0.0025248611,0.002537308,0.001637602,0.008808477],"category_scores_gemma":[0.03648674,0.00081216655,0.001201857,0.0020098083,0.005021724,0.011842067,0.0063620033,0.0042231353,0.0011822234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034165572,0.00007401948,0.001696107,0.00022704115,0.00005369888,0.000068275906,0.00041608853,0.028968543,0.0007407425,0.83153737,0.0070284544,0.1288479],"study_design_scores_gemma":[0.000025347248,0.0000344737,0.00021330737,0.00003208504,0.000009374423,0.000025395617,0.000057002166,0.11301865,0.0003195247,0.8840297,0.002226747,0.000008429738],"about_ca_topic_score_codex":0.002371304,"about_ca_topic_score_gemma":0.0015159566,"teacher_disagreement_score":0.008808477,"about_ca_system_score_codex":0.0012493999,"about_ca_system_score_gemma":0.0014713114,"threshold_uncertainty_score":0.029467225},"labels":[],"label_agreement":null},{"id":"W1557693712","doi":"10.1007/978-3-540-30499-9_23","title":"An Efficient Two-Level SOMART Document Clustering Through Dimensionality Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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 Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Dimensionality reduction; Artificial intelligence; Adaptive resonance theory; Pattern recognition (psychology); Clustering high-dimensional data; Artificial neural network; Data mining; Brown clustering; Hierarchical clustering; Reduction (mathematics); Entropy (arrow of time); Dimension (graph theory); Document clustering; Correlation clustering; Curse of dimensionality; Canopy clustering algorithm; Mathematics","score_opus":0.02858114946698372,"score_gpt":0.28656072384581666,"score_spread":0.25797957437883295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557693712","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.008584171,0.00056251977,0.982605,0.00014493096,0.00018857224,0.00014523396,0.0005092863,0.005442344,0.001817995],"genre_scores_gemma":[0.032197043,0.0002674308,0.95676136,0.000105550505,0.000078526784,0.00016501045,0.0021055916,0.00025675804,0.008062756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828535,0.00023009868,0.00015554267,0.0003382257,0.0008427085,0.00014810891],"domain_scores_gemma":[0.9991761,0.00013273614,0.000035592682,0.00024932524,0.00035565082,0.000050541596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591622,0.001027154,0.0025341758,0.0021325569,0.0015041169,0.0024377913,0.0024760317,0.0012984718,0.006823619],"category_scores_gemma":[0.0017242851,0.0006321372,0.0023448775,0.0031918911,0.00047028522,0.0018909366,0.0028064516,0.0013613201,0.008940409],"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.00022897033,0.00017921135,0.00034965487,0.00018823722,0.000118218995,0.00008829513,0.00011951789,0.009724282,0.031738676,0.0046532876,0.016221061,0.93639064],"study_design_scores_gemma":[0.000114343464,0.00041968306,0.0020057773,0.000043849745,0.00018393176,0.000995976,0.00021672188,0.89171135,0.057244275,0.014544645,0.032387026,0.00013239973],"about_ca_topic_score_codex":0.0047104596,"about_ca_topic_score_gemma":0.008507082,"teacher_disagreement_score":0.006823619,"about_ca_system_score_codex":0.00064012874,"about_ca_system_score_gemma":0.0021084875,"threshold_uncertainty_score":0.022827327},"labels":[],"label_agreement":null},{"id":"W1557826151","doi":"10.1007/11608288_15","title":"Revealing the Secret of FaceHashing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Security token; Biometrics; Computer science; Authentication (law); Zero (linguistics); Computer security; Word error rate; Face (sociological concept); Artificial intelligence; Sociology","score_opus":0.02605703618294901,"score_gpt":0.259299749964127,"score_spread":0.233242713781178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557826151","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.041234214,0.0043663746,0.8227623,0.004736986,0.0010385895,0.00008988915,0.0003768872,0.0015206237,0.12387409],"genre_scores_gemma":[0.720034,0.004393201,0.16921893,0.0012710487,0.0011991768,0.00010629746,0.00042340133,0.00048474022,0.102869116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988034,0.0002822833,0.000037371985,0.00013306731,0.0005848527,0.00015906217],"domain_scores_gemma":[0.9976272,0.0011244882,0.000095520336,0.00095139095,0.0001442035,0.00005718595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010782557,0.0006610155,0.00061342947,0.0005588865,0.0008763207,0.002483029,0.0008774557,0.0018789021,0.01148801],"category_scores_gemma":[0.0039867945,0.0005890328,0.00052193296,0.0007026812,0.0028623068,0.0057135304,0.0025821505,0.002941856,0.0037247352],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059860566,0.000084875486,0.00039070693,0.00033418954,0.00007204621,0.0004082601,0.0009083927,0.009607023,0.037442118,0.65047264,0.023649007,0.27603215],"study_design_scores_gemma":[0.000056956418,0.00015280329,0.0004311945,0.00016243162,0.000053876465,0.0015296207,0.00022404986,0.06269688,0.073753655,0.7936758,0.06716906,0.00009373571],"about_ca_topic_score_codex":0.00020671221,"about_ca_topic_score_gemma":0.00021683807,"teacher_disagreement_score":0.01148801,"about_ca_system_score_codex":0.0006004998,"about_ca_system_score_gemma":0.0004555208,"threshold_uncertainty_score":0.038431227},"labels":[],"label_agreement":null},{"id":"W1557990975","doi":"10.1007/978-3-540-87875-9_2","title":"Algebraic Models for Bidirectional Model Synchronization","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Synchronization (alternating current); Transformation (genetics); Model transformation; Theoretical computer science; Semantics (computer science); Algebraic number; Algebraic specification; Formal specification; Programming language; Artificial intelligence; Mathematics","score_opus":0.01821972415490465,"score_gpt":0.23105930929506163,"score_spread":0.212839585140157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557990975","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.021233063,0.0004128737,0.92604303,0.00092267664,0.0002841742,0.00010320395,0.0002789546,0.00077348435,0.049948502],"genre_scores_gemma":[0.8273243,0.0010208302,0.1347406,0.0005554844,0.0005126839,0.0006458679,0.0009478675,0.00049568014,0.03375667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983102,0.0004661919,0.00016756552,0.00031685922,0.0005257018,0.00021355793],"domain_scores_gemma":[0.9976828,0.0009574388,0.00028900692,0.0004840278,0.00046046227,0.00012623117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015166185,0.00082963944,0.0009203452,0.0012265986,0.0018127313,0.00345014,0.0014640458,0.0015605355,0.011375508],"category_scores_gemma":[0.005049595,0.00067222153,0.0015615841,0.0016122528,0.002218526,0.0065570325,0.003919045,0.0032826553,0.001978129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010385608,0.000008929197,0.000029987852,0.00001675795,0.000006078149,0.00002931395,0.00009967155,0.002194271,0.00026236605,0.994255,0.00045448166,0.0026328668],"study_design_scores_gemma":[0.0000152459315,0.000010070009,0.000022140175,0.0000105653435,0.000013323125,0.00003734614,0.000054652686,0.01803185,0.00041175383,0.9767364,0.0046462077,0.000010444494],"about_ca_topic_score_codex":0.0016124808,"about_ca_topic_score_gemma":0.0012664776,"teacher_disagreement_score":0.011375508,"about_ca_system_score_codex":0.0017022921,"about_ca_system_score_gemma":0.0013047806,"threshold_uncertainty_score":0.038054883},"labels":[],"label_agreement":null},{"id":"W1558034224","doi":"10.1007/978-3-642-14518-6_29","title":"Improved Primality Proving with Eisenstein Pseudocubes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Primality test; Mathematics; Prime (order theory); Combinatorics","score_opus":0.009704069767134891,"score_gpt":0.22605510917721278,"score_spread":0.21635103941007788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558034224","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.07820152,0.0020984411,0.79883325,0.0026962792,0.00094198686,0.0001326955,0.00031387975,0.0016258698,0.11515607],"genre_scores_gemma":[0.63617766,0.002197728,0.31736287,0.0011677155,0.0011564669,0.00033469909,0.0008625786,0.0011662121,0.039574087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963612,0.0016250075,0.00016128669,0.00042519247,0.001081422,0.0003458073],"domain_scores_gemma":[0.9941842,0.0037442206,0.00019107264,0.0010604416,0.0005768623,0.00024329918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043385224,0.0018701357,0.0021716147,0.0030969381,0.0020788952,0.0036775165,0.0021001317,0.0016327834,0.011145989],"category_scores_gemma":[0.010695927,0.0014116492,0.0016789952,0.0026094238,0.0042382693,0.010823195,0.008283212,0.007343247,0.0024348532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012921129,0.000052569296,0.00024183144,0.00013644934,0.000024756571,0.000113756694,0.00016117792,0.005750479,0.0017646932,0.9658911,0.0041416893,0.021592213],"study_design_scores_gemma":[0.000026699225,0.000027566091,0.000072244555,0.000030892494,0.000017840815,0.00007465088,0.000032297467,0.019822476,0.0020253796,0.9732116,0.0046396325,0.0000188111],"about_ca_topic_score_codex":0.00041715882,"about_ca_topic_score_gemma":0.0005488422,"teacher_disagreement_score":0.011145989,"about_ca_system_score_codex":0.0014754477,"about_ca_system_score_gemma":0.00069634744,"threshold_uncertainty_score":0.037286997},"labels":[],"label_agreement":null},{"id":"W1558193805","doi":"10.1007/3-540-47772-1_6","title":"An Architecture for Modeling Internet-based Collaborative Agent Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Distributed Component Object Model; Computer science; Java; Architecture; Software engineering; Multi-agent system; Distributed computing; Human–computer interaction; Common Object Request Broker Architecture; Artificial intelligence; Programming language","score_opus":0.0304766645236385,"score_gpt":0.271537516914093,"score_spread":0.2410608523904545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558193805","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.005507761,0.00031215406,0.98317,0.00038885305,0.00007965065,0.00014402445,0.00014147643,0.0010805213,0.009175624],"genre_scores_gemma":[0.22623225,0.0013195106,0.7534816,0.00016074823,0.00012080488,0.0010196514,0.00065351295,0.00036590104,0.016645996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999238,0.00027005008,0.000095160445,0.00011073938,0.00020605665,0.000079947175],"domain_scores_gemma":[0.9994504,0.0001599867,0.000053766977,0.00013801978,0.00014222552,0.000055568766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012589673,0.00089657743,0.0009552535,0.0010533484,0.0015335601,0.0040210206,0.003846669,0.002799661,0.0050020874],"category_scores_gemma":[0.0022784935,0.0011792813,0.0013727419,0.0016261698,0.0016918691,0.0048687295,0.0024615698,0.0023852137,0.0016508334],"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.00004181848,0.00006889641,0.00042845443,0.00010682216,0.000050481114,0.00021215202,0.00036083197,0.40049702,0.0014372129,0.5714939,0.0025296235,0.022772815],"study_design_scores_gemma":[0.00002336491,0.000020451353,0.00006487672,0.000024932946,0.000037288093,0.000052920248,0.00004334736,0.8568958,0.00060325855,0.12809455,0.014123294,0.000015935855],"about_ca_topic_score_codex":0.010960606,"about_ca_topic_score_gemma":0.0095097255,"teacher_disagreement_score":0.010960606,"about_ca_system_score_codex":0.0017260268,"about_ca_system_score_gemma":0.001956582,"threshold_uncertainty_score":0.021793604},"labels":[],"label_agreement":null},{"id":"W1558213091","doi":"10.1007/978-3-540-79719-7_10","title":"Complexity and Algorithms for Well-Structured k-SAT Instances","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Constructive; Discrete mathematics; Path (computing); Computational complexity theory; Algorithm; Graph; Pathwidth; Computer science; Line graph","score_opus":0.047337264908975586,"score_gpt":0.30210024391376333,"score_spread":0.2547629790047877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558213091","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.12062952,0.006157065,0.77249223,0.013630109,0.0006220455,0.0005631462,0.0046626376,0.0022915923,0.07895171],"genre_scores_gemma":[0.49053478,0.004559774,0.4603038,0.0015722392,0.001650126,0.0012634917,0.009613578,0.0012868204,0.029215353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957216,0.0012805499,0.0003176902,0.0009988266,0.0011761913,0.0005051538],"domain_scores_gemma":[0.9767825,0.01854349,0.00093296956,0.002408101,0.00082849397,0.000504454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291487,0.0017437232,0.001951187,0.0021338856,0.001937578,0.010546583,0.0049429666,0.003233666,0.018929066],"category_scores_gemma":[0.018752465,0.0020847744,0.0040309518,0.00551813,0.003331217,0.020749329,0.00456831,0.009623426,0.0034204978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075725274,0.00049853144,0.0024359243,0.0014005797,0.00023448058,0.00020758262,0.00081441645,0.093167774,0.0038672606,0.72632617,0.03520554,0.13508458],"study_design_scores_gemma":[0.000085277636,0.000030998388,0.00037925327,0.000053168893,0.000056259974,0.0001447076,0.000107876105,0.1093656,0.0008683533,0.8857652,0.0031138281,0.000029483532],"about_ca_topic_score_codex":0.0019930047,"about_ca_topic_score_gemma":0.0033307076,"teacher_disagreement_score":0.018929066,"about_ca_system_score_codex":0.0043774624,"about_ca_system_score_gemma":0.0029605338,"threshold_uncertainty_score":0.063324034},"labels":[],"label_agreement":null},{"id":"W1558244650","doi":"10.1007/978-3-642-04271-3_65","title":"Tumor Invasion Margin on the Riemannian Space of Brain Fibers","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Alberta","funders":"","keywords":"Geodesic; Margin (machine learning); Glioma; Euclidean distance; Computer science; Euclidean space; Fiber tract; Lesion; Brain tumor; Pathology; Artificial intelligence; Mathematics; Medicine; Radiology; Pure mathematics; Geometry; Magnetic resonance imaging; Diffusion MRI; Cancer research; Machine learning","score_opus":0.014122522865845803,"score_gpt":0.27062858985566063,"score_spread":0.2565060669898148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558244650","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.8931008,0.00096346025,0.09419667,0.00058535143,0.000022141616,0.000033130458,0.00031699453,0.00016235985,0.010619146],"genre_scores_gemma":[0.9825116,0.0003466213,0.012265726,0.000042588716,0.000048415197,0.000020357807,0.00014495589,0.000058163263,0.0045617814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984515,0.000035380894,0.0000063232587,0.000031200194,0.00006233189,0.00001962483],"domain_scores_gemma":[0.999342,0.00019089323,0.00014600114,0.000030322746,0.00013281035,0.00015782543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034616268,0.00045515643,0.00031394642,0.0013820588,0.00030958108,0.00089791283,0.00036724788,0.00038332885,0.0022689623],"category_scores_gemma":[0.0015140552,0.00021301485,0.00022640759,0.00033297896,0.00064436166,0.0007359732,0.0009982716,0.00049143273,0.0003285144],"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.0013300551,0.00017963692,0.02698764,0.00054516626,0.00016770833,0.0023015244,0.0015014946,0.06691879,0.110469505,0.65773135,0.005485361,0.1263818],"study_design_scores_gemma":[0.00010855751,0.00068940304,0.11099785,0.00015035625,0.00015625097,0.004171018,0.0005410296,0.49982178,0.017544378,0.35112974,0.014559368,0.00013034034],"about_ca_topic_score_codex":0.0016900364,"about_ca_topic_score_gemma":0.0014686455,"teacher_disagreement_score":0.0022689623,"about_ca_system_score_codex":0.0005576709,"about_ca_system_score_gemma":0.00027300077,"threshold_uncertainty_score":0.0075904727},"labels":[],"label_agreement":null},{"id":"W1558294391","doi":"10.1007/3-540-44886-1_8","title":"Monadic Memoization towards Correctness-Preserving Reduction of Search","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Memoization; Computer science; Correctness; Reduction (mathematics); Table (database); Pace; Theoretical computer science; Programming language; Data mining; Mathematics","score_opus":0.03158398901796504,"score_gpt":0.2656718112774615,"score_spread":0.23408782225949643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558294391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024904279,0.0010610495,0.9442439,0.00096887525,0.00029438318,0.000103448656,0.00020760222,0.004854007,0.023362553],"genre_scores_gemma":[0.48414445,0.00063649286,0.48671168,0.0008420227,0.00047293052,0.00041118747,0.00052032183,0.0022310542,0.024029916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963798,0.0011464219,0.00023380124,0.0005419726,0.0011736511,0.0005244394],"domain_scores_gemma":[0.99340314,0.002795909,0.0002287767,0.0027155513,0.00066001486,0.0001966437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002588878,0.00080459216,0.00165438,0.0015920207,0.0015743454,0.0032872283,0.0044586756,0.0012531118,0.0060120756],"category_scores_gemma":[0.008751706,0.0008893403,0.0019182512,0.0022617283,0.003693746,0.0077420375,0.0055764234,0.0043939385,0.001328255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780845,0.00008678787,0.00028281682,0.00030941993,0.000059142152,0.00008067285,0.0006335693,0.009166972,0.0057573323,0.9030504,0.007620025,0.07267482],"study_design_scores_gemma":[0.000056938607,0.000040151925,0.00013043151,0.00003923007,0.00008461494,0.00010265383,0.00009059229,0.06310384,0.009321199,0.9150751,0.011927398,0.000027835218],"about_ca_topic_score_codex":0.0017438119,"about_ca_topic_score_gemma":0.0028243891,"teacher_disagreement_score":0.0060120756,"about_ca_system_score_codex":0.0019454687,"about_ca_system_score_gemma":0.0018099189,"threshold_uncertainty_score":0.020112395},"labels":[],"label_agreement":null},{"id":"W1558298672","doi":"10.1007/978-3-540-68825-9_28","title":"Image Transformation: Inductive Transfer between Multiple Tasks Having Multiple Outputs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Acadia University","funders":"","keywords":"Transfer of learning; Computer science; Inductive transfer; Task (project management); Transformation (genetics); Inductive bias; Artificial intelligence; Multi-task learning; Context (archaeology); Scalar (mathematics); Artificial neural network; Domain (mathematical analysis); Image (mathematics); Machine learning; Transfer (computing); Pattern recognition (psychology); Mathematics","score_opus":0.03240238157992148,"score_gpt":0.25012021528536144,"score_spread":0.21771783370543996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558298672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006631381,0.00014187342,0.9877659,0.00010329576,0.00007189761,0.00007737181,0.0000842075,0.0032231172,0.0019009257],"genre_scores_gemma":[0.34634387,0.00036905555,0.6344084,0.00040259465,0.0001694384,0.00043323726,0.0012131705,0.0008693856,0.015790826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994154,0.00014182965,0.000022732704,0.00023409369,0.000112053196,0.000073885494],"domain_scores_gemma":[0.9992192,0.00033758974,0.000039847902,0.000235194,0.00012211691,0.000046013563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012877415,0.00096340914,0.00082527247,0.0005854133,0.00037414877,0.0008043549,0.002242072,0.0016196034,0.0064697424],"category_scores_gemma":[0.0023626394,0.0005428011,0.0010902985,0.0009062721,0.00077977614,0.0021705674,0.0029661818,0.0021540595,0.003465931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003438917,0.0003799696,0.0005680717,0.00023422409,0.00016763892,0.0002107437,0.0001933242,0.06292448,0.056255758,0.010305508,0.010212227,0.8582042],"study_design_scores_gemma":[0.000045798806,0.00015839809,0.00069054,0.000025980406,0.0000668438,0.00023497644,0.00008873252,0.8986278,0.05551555,0.039017934,0.005497383,0.000030085072],"about_ca_topic_score_codex":0.0016033975,"about_ca_topic_score_gemma":0.0017603617,"teacher_disagreement_score":0.0064697424,"about_ca_system_score_codex":0.00044670823,"about_ca_system_score_gemma":0.0006075537,"threshold_uncertainty_score":0.02164352},"labels":[],"label_agreement":null},{"id":"W1558322003","doi":"10.1007/978-3-540-30566-8_18","title":"A Fault-Tolerant Multi-agent Development Framework","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Concordia University","funders":"","keywords":"JADE (particle detector); Fault tolerance; Computer science; Protocol (science); Distributed computing; Software fault tolerance; Embedded system","score_opus":0.021880487145487654,"score_gpt":0.25589391400805633,"score_spread":0.23401342686256868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558322003","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.0026378306,0.00023463108,0.9900809,0.00017545809,0.00003774099,0.00009561477,0.000046582656,0.0031689126,0.0035222515],"genre_scores_gemma":[0.08275557,0.00050955726,0.90910655,0.00011035492,0.000030225483,0.00027550568,0.00023955942,0.00039777096,0.006574899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928844,0.00016635779,0.000063140185,0.000113696675,0.00028549207,0.000082801416],"domain_scores_gemma":[0.9993343,0.00024191257,0.00005913263,0.0001485401,0.00011502626,0.00010106714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015914509,0.0007266163,0.00066822994,0.00067301927,0.001090711,0.002170368,0.0030171503,0.0013610207,0.0036140673],"category_scores_gemma":[0.0019982564,0.00076149957,0.00083621265,0.0005303101,0.0009084243,0.0020878033,0.0023263774,0.0016562429,0.0012408025],"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.00025425176,0.00031480734,0.00096167484,0.00057931815,0.00013461107,0.00088606845,0.0007553229,0.22057727,0.020375086,0.39383647,0.015557689,0.3457675],"study_design_scores_gemma":[0.0001396274,0.00011677715,0.00020869522,0.00009344605,0.00010057129,0.00056947634,0.00007299523,0.75450677,0.01482135,0.13698046,0.09232962,0.000060184924],"about_ca_topic_score_codex":0.0023748407,"about_ca_topic_score_gemma":0.0029605662,"teacher_disagreement_score":0.0036140673,"about_ca_system_score_codex":0.00067575136,"about_ca_system_score_gemma":0.0016361759,"threshold_uncertainty_score":0.012090266},"labels":[],"label_agreement":null},{"id":"W1558388442","doi":"10.1007/978-3-642-13437-1_107","title":"Authoring Problem-Solving ITS with ASTUS","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Tracing; TUTOR; Constraint (computer-aided design); Task (project management); SQL; Domain (mathematical analysis); Programming language; Software engineering; Artificial intelligence; Human–computer interaction; Systems engineering","score_opus":0.01924184846946636,"score_gpt":0.24017185127639348,"score_spread":0.22093000280692712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558388442","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.00834599,0.00011838244,0.9139499,0.00038169464,0.00033201018,0.00020064761,0.0020225134,0.038546193,0.03610278],"genre_scores_gemma":[0.124781944,0.00030377795,0.82089436,0.00022271229,0.00010724321,0.00051978906,0.007282881,0.012154179,0.033732988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866176,0.00044697485,0.00013339617,0.0001931738,0.00045605545,0.00010861448],"domain_scores_gemma":[0.99621886,0.0021925103,0.000116101575,0.00084621593,0.0004570629,0.0001691483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016180835,0.0012489633,0.0007926981,0.0010707612,0.0009389365,0.0026734103,0.0018281762,0.0012398255,0.03211346],"category_scores_gemma":[0.008043564,0.000932688,0.001908828,0.0010691676,0.0012713706,0.0032615939,0.0042118826,0.0028627287,0.0078758085],"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.0006704957,0.00038204403,0.002581866,0.0017599176,0.00016436799,0.0009918464,0.003761529,0.106675915,0.0112555465,0.2888876,0.15889432,0.42397457],"study_design_scores_gemma":[0.00017574632,0.00008265881,0.00021925895,0.00025889813,0.000079508885,0.00036454192,0.00037218627,0.3654386,0.018231243,0.18080182,0.4339238,0.000051718227],"about_ca_topic_score_codex":0.00147209,"about_ca_topic_score_gemma":0.0047296863,"teacher_disagreement_score":0.03211346,"about_ca_system_score_codex":0.00073866185,"about_ca_system_score_gemma":0.0014183971,"threshold_uncertainty_score":0.10743022},"labels":[],"label_agreement":null},{"id":"W1558434498","doi":"10.1007/11941439_156","title":"Empirical Verification of a Strategy for Unbounded Resolution in Finite Player Goore Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Guidance and Control Systems","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":"Carleton University","funders":"","keywords":"Computer science; Resolution (logic); Theoretical computer science; Artificial intelligence","score_opus":0.02885208952373859,"score_gpt":0.2589080934676012,"score_spread":0.2300560039438626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558434498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24268024,0.00030263004,0.7065554,0.0051242136,0.00015767582,0.00032044773,0.0006675488,0.0014880027,0.04270382],"genre_scores_gemma":[0.95171505,0.00011583203,0.042323016,0.00045635764,0.00006372813,0.00016946875,0.00035737298,0.0001665908,0.0046325545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206287,0.0034712488,0.000486614,0.0011615804,0.0015383483,0.0012792627],"domain_scores_gemma":[0.86988723,0.10966888,0.0035568613,0.009167655,0.00504804,0.002671271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00860855,0.001441288,0.002592302,0.0017003792,0.0021573892,0.0049629705,0.005447143,0.0052258116,0.01266105],"category_scores_gemma":[0.10891177,0.0016260024,0.0029840034,0.0012386214,0.009299682,0.012872718,0.006465389,0.008458291,0.0009735247],"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.00024629623,0.00014806475,0.0018645535,0.00016045292,0.00008776788,0.00036771077,0.00072448363,0.016856771,0.0016103215,0.96932083,0.0015946433,0.0070181405],"study_design_scores_gemma":[0.00006209239,0.0000479052,0.00037049668,0.000044992386,0.000020066054,0.00008125203,0.00019260171,0.09017148,0.0010207712,0.90735924,0.00059785723,0.000031215524],"about_ca_topic_score_codex":0.003050837,"about_ca_topic_score_gemma":0.002869398,"teacher_disagreement_score":0.01266105,"about_ca_system_score_codex":0.0025416357,"about_ca_system_score_gemma":0.0034648934,"threshold_uncertainty_score":0.04552692},"labels":[],"label_agreement":null},{"id":"W1558494856","doi":"10.1007/978-3-642-00672-2_64","title":"Complete and Equivalent Query Rewriting Using Views","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; IBM (Canada); University of Windsor","funders":"","keywords":"Rewriting; Computer science; Materialized view; Conjunctive query; Query optimization; Query language; Set (abstract data type); Theoretical computer science; Information retrieval; Programming language; View; Relational database; Database design","score_opus":0.05899105264639242,"score_gpt":0.29226862465899583,"score_spread":0.2332775720126034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558494856","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.028733242,0.000981013,0.9351467,0.00066045864,0.00029300255,0.00014720229,0.0005620251,0.0026983381,0.030778006],"genre_scores_gemma":[0.51105964,0.0011067009,0.45589933,0.00078776263,0.0004949716,0.00023479498,0.0022443805,0.0026107808,0.02556163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904344,0.0023829753,0.0007282675,0.0013403483,0.00429337,0.0008206315],"domain_scores_gemma":[0.9916459,0.0034986716,0.00023303597,0.003144594,0.001305994,0.00017179898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030938468,0.00078820955,0.0014591946,0.0012384098,0.0010110582,0.0040247003,0.002192924,0.0013487802,0.005358839],"category_scores_gemma":[0.011120231,0.00102247,0.002679971,0.001639521,0.0026856484,0.007292922,0.0030326217,0.0037222109,0.0016167499],"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.00021442657,0.00011306103,0.00034861956,0.0003389096,0.00013032024,0.0003394182,0.0011755008,0.009686102,0.0121850595,0.8559304,0.009618757,0.10991951],"study_design_scores_gemma":[0.000062440966,0.000048307687,0.00023969171,0.000041033134,0.00013094288,0.0003566787,0.00017865367,0.031627104,0.011589436,0.9348915,0.02078288,0.000051342853],"about_ca_topic_score_codex":0.0019916971,"about_ca_topic_score_gemma":0.0017156026,"teacher_disagreement_score":0.005358839,"about_ca_system_score_codex":0.0011602383,"about_ca_system_score_gemma":0.0011335689,"threshold_uncertainty_score":0.01792711},"labels":[],"label_agreement":null},{"id":"W1558536082","doi":"10.1007/978-3-319-30671-1_27","title":"Multi-document Summarization Based on Atomic Semantic Events and Their Temporal Relationships","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Automatic summarization; Computer science; Novelty; Natural language processing; Event (particle physics); Sentence; Information retrieval; Artificial intelligence; Domain (mathematical analysis); Precision and recall; Set (abstract data type); Multi-document summarization; Salient","score_opus":0.029557536198477907,"score_gpt":0.24569082159476685,"score_spread":0.21613328539628895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558536082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064659804,0.0078548705,0.907836,0.0005488747,0.0008814547,0.00045661916,0.0046062684,0.007234741,0.005921465],"genre_scores_gemma":[0.2808633,0.0027748952,0.6843346,0.00015327142,0.0010115992,0.00039069107,0.017067695,0.00072056137,0.012683385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889296,0.00021373946,0.00015577512,0.00033054265,0.0003150149,0.0000920885],"domain_scores_gemma":[0.99728715,0.001131476,0.00023628653,0.00028241577,0.0009581156,0.00010457659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869311,0.0015707539,0.0014397523,0.0040380047,0.0010410829,0.0019597637,0.0009415464,0.0009941089,0.0041541937],"category_scores_gemma":[0.0029214532,0.00053446257,0.0012642876,0.0037860095,0.0002641225,0.0028252716,0.00096520444,0.0008711503,0.0024538017],"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.00161252,0.00026063214,0.0023729785,0.0013676962,0.0003535736,0.0006189018,0.0005695118,0.010987735,0.08096284,0.0054385327,0.026169378,0.8692857],"study_design_scores_gemma":[0.00023543603,0.00087902305,0.0141050415,0.00023376655,0.002239747,0.0012001061,0.0010739805,0.7907615,0.1073178,0.021363022,0.060356513,0.00023412061],"about_ca_topic_score_codex":0.0016314619,"about_ca_topic_score_gemma":0.003465865,"teacher_disagreement_score":0.0041541937,"about_ca_system_score_codex":0.0003987502,"about_ca_system_score_gemma":0.0006754771,"threshold_uncertainty_score":0.013897181},"labels":[],"label_agreement":null},{"id":"W1558629361","doi":"10.1007/3-540-39963-1_28","title":"Finding Temporal Relations: Causal Bayesian Networks vs. C4.5","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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","funders":"","keywords":"Computer science; Bayesian network; Tetrad; Flattening; Set (abstract data type); Artificial intelligence; Bayesian probability; Domain (mathematical analysis); Machine learning; Data mining; Mathematics","score_opus":0.021172881191489662,"score_gpt":0.25015583431929916,"score_spread":0.2289829531278095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558629361","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.0022068925,0.0009615809,0.9917904,0.0006477883,0.00005202289,0.000056927434,0.0003542406,0.0010198252,0.0029103667],"genre_scores_gemma":[0.060446836,0.002103086,0.93274206,0.00030474947,0.00017303828,0.00020408756,0.0010680449,0.00054226606,0.0024159465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679863,0.0013197283,0.0002686417,0.00058946543,0.00082827685,0.0001952221],"domain_scores_gemma":[0.9753632,0.020293653,0.00098055,0.0015293794,0.0014477388,0.00038558018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007857164,0.0019345272,0.0019068124,0.0049730213,0.0016413415,0.0042378227,0.004138197,0.0029461125,0.014969385],"category_scores_gemma":[0.052395098,0.001500275,0.0022058568,0.006357146,0.0020112244,0.0069347234,0.0028015252,0.0034122358,0.003116956],"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.0005244642,0.00012350005,0.0025768653,0.0007287775,0.00025570655,0.00015282424,0.00036892798,0.12708487,0.000944738,0.25049442,0.022639643,0.5941052],"study_design_scores_gemma":[0.000045137083,0.000023621296,0.00041004273,0.00012705912,0.000148675,0.00013282767,0.00008480396,0.47173044,0.0013700527,0.5161606,0.009717989,0.000048724924],"about_ca_topic_score_codex":0.020066224,"about_ca_topic_score_gemma":0.015328196,"teacher_disagreement_score":0.020066224,"about_ca_system_score_codex":0.0021573468,"about_ca_system_score_gemma":0.0037312948,"threshold_uncertainty_score":0.050077558},"labels":[],"label_agreement":null},{"id":"W1558666880","doi":"10.1007/3-540-36492-7_25","title":"On Some Attacks on Multi-prime RSA","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Computer science; Public-key cryptography; Encryption; Prime (order theory); Cryptography; Integer factorization; Integer (computer science); Modulus; Prime factor; Factorization; Theoretical computer science; Key (lock); Arithmetic; Algorithm; Mathematics; Computer security; Combinatorics","score_opus":0.018156853772574855,"score_gpt":0.2520601455424164,"score_spread":0.23390329176984154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558666880","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.15639947,0.029445967,0.29708683,0.021337338,0.003441961,0.00039411857,0.0007044118,0.001950799,0.48923916],"genre_scores_gemma":[0.8511112,0.01590372,0.047605585,0.0021735758,0.0026351435,0.0002261501,0.00053671096,0.0004565496,0.07935138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763083,0.0005235517,0.00009441,0.00025854248,0.0011284441,0.00036414826],"domain_scores_gemma":[0.99674535,0.0019507991,0.00016805202,0.0008593714,0.0001907187,0.000085800006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015051708,0.0018566287,0.0013192168,0.002263148,0.002272269,0.0035315612,0.0012605236,0.002844884,0.007977565],"category_scores_gemma":[0.005962665,0.000983701,0.0015267251,0.0024668246,0.0032087942,0.0081668245,0.003207544,0.004198873,0.0030436113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080162677,0.00014372883,0.0006858266,0.00033833744,0.000111847236,0.00055102515,0.000608379,0.015101358,0.0086445995,0.8282687,0.027578874,0.11716565],"study_design_scores_gemma":[0.000094437564,0.000112233625,0.0005609504,0.00013753014,0.00009055663,0.0011067342,0.00013448973,0.030734506,0.0077756085,0.9203799,0.03882157,0.000051446423],"about_ca_topic_score_codex":0.0003454234,"about_ca_topic_score_gemma":0.00035476935,"teacher_disagreement_score":0.007977565,"about_ca_system_score_codex":0.0016818029,"about_ca_system_score_gemma":0.00050915556,"threshold_uncertainty_score":0.026687622},"labels":[],"label_agreement":null},{"id":"W1558697857","doi":"10.1007/978-3-642-12659-8_12","title":"Considerations for Progressive Damage in Fiber-Reinforced Composite Materials Subject to Fatigue","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mechanical Behavior of Composites","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":"Toronto Metropolitan University","funders":"","keywords":"Aerospace; Composite number; Computer science; Finite element method; Structural engineering; Fiber-reinforced composite; Representative elementary volume; Materials science; Composite material; Engineering; Aerospace engineering","score_opus":0.02495589616680002,"score_gpt":0.27101762588329864,"score_spread":0.24606172971649862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558697857","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.20195623,0.020962413,0.37758765,0.004765641,0.0018452536,0.00042997336,0.00029092008,0.0007661921,0.39139578],"genre_scores_gemma":[0.85944706,0.007825689,0.041224208,0.00049653504,0.000663552,0.000180207,0.00020086812,0.000415887,0.08954601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999726,0.000046410412,0.0000106969555,0.00003486304,0.0001428304,0.000039273225],"domain_scores_gemma":[0.9993542,0.00036550823,0.000040980874,0.000052835756,0.00015792825,0.000028560791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006843089,0.0006498924,0.0006087161,0.00089397875,0.001008235,0.00091186754,0.0015502166,0.0014557247,0.011830288],"category_scores_gemma":[0.0024870962,0.0004116793,0.0005436883,0.00029563392,0.00084204314,0.0014371879,0.0008229904,0.0009400415,0.0010134629],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007492982,0.00024023009,0.0015821232,0.0014038379,0.000050539224,0.0034902974,0.0008660362,0.20007567,0.17358582,0.44361213,0.01574183,0.15860209],"study_design_scores_gemma":[0.00007905688,0.001195191,0.009160116,0.0007262205,0.00016557834,0.004630303,0.0010417143,0.49409077,0.060161293,0.35046372,0.07812335,0.00016258667],"about_ca_topic_score_codex":0.0010709593,"about_ca_topic_score_gemma":0.0027294492,"teacher_disagreement_score":0.011830288,"about_ca_system_score_codex":0.00058812986,"about_ca_system_score_gemma":0.00034450076,"threshold_uncertainty_score":0.039576292},"labels":[],"label_agreement":null},{"id":"W1558734229","doi":"10.1007/3-540-44612-5_37","title":"Alternating and Empty Alternating Auxiliary Stack Automata","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Bounded function; Hierarchy; Automaton; Polynomial hierarchy; Constant (computer programming); Combinatorics; Mathematics; Cellular automaton; Discrete mathematics; Time complexity; Computer science; Computational complexity theory; Theoretical computer science; Algorithm; Programming language","score_opus":0.013270922330737804,"score_gpt":0.24352863857550208,"score_spread":0.23025771624476427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558734229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19887374,0.0009550882,0.6087524,0.0010420516,0.000819929,0.00012628193,0.0007859856,0.001870119,0.18677436],"genre_scores_gemma":[0.80376256,0.00071615406,0.10029402,0.0003429049,0.00029385914,0.00023645461,0.00086872303,0.0008521053,0.09263317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.00021291194,0.000110832596,0.00021180073,0.00029066164,0.00023078774],"domain_scores_gemma":[0.99665976,0.0015707336,0.00016997947,0.00071598706,0.0005971677,0.0002863887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011214996,0.00080433453,0.0006740742,0.00087216485,0.0019763384,0.0036532746,0.0018505651,0.0013675014,0.013085987],"category_scores_gemma":[0.0052433168,0.00073454797,0.0011451937,0.0010382418,0.003049064,0.012155664,0.0031947433,0.003458248,0.0024373888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009175664,0.000028422064,0.00013660519,0.000046015495,0.0000054577486,0.00008749412,0.0003687756,0.0008464316,0.0021039944,0.9830656,0.0015731326,0.011646246],"study_design_scores_gemma":[0.000011517056,0.00002280236,0.00011401136,0.000014854684,0.000019439936,0.0001578539,0.00010832122,0.007161467,0.0034008434,0.9807984,0.008173653,0.000016837666],"about_ca_topic_score_codex":0.00045451822,"about_ca_topic_score_gemma":0.0005929419,"teacher_disagreement_score":0.013085987,"about_ca_system_score_codex":0.0006489188,"about_ca_system_score_gemma":0.00082939834,"threshold_uncertainty_score":0.04377699},"labels":[],"label_agreement":null},{"id":"W1558799714","doi":"10.1007/978-3-642-33564-8_50","title":"Analysis of White Blood Cell Differential Counts Using Dual-Tree Complex Wavelet Transform and Support Vector Machine Classifier","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Concordia University","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Pattern recognition (psychology); Classifier (UML); Dual (grammatical number); Structured support vector machine; Wavelet","score_opus":0.021663428742420936,"score_gpt":0.24233444234025697,"score_spread":0.22067101359783603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558799714","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.25637874,0.0012775506,0.7379431,0.00023565377,0.00017281112,0.000075731536,0.00058953854,0.0011553006,0.0021715616],"genre_scores_gemma":[0.628497,0.0011578065,0.36450514,0.00008981046,0.00011648125,0.0000804913,0.001228556,0.00014880103,0.00417589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978584,0.000022484484,0.000017072653,0.000041315954,0.00010935498,0.000023961102],"domain_scores_gemma":[0.99967563,0.000113110094,0.000034147186,0.00002088638,0.00014182612,0.000014412956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039505647,0.0003365143,0.00056684786,0.001291355,0.0001544993,0.000684352,0.0003189806,0.00035243458,0.0012265613],"category_scores_gemma":[0.0010177293,0.00016338834,0.00050022214,0.0011455471,0.000111239904,0.00048360883,0.00025736296,0.0003794162,0.00080965867],"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.00041602008,0.0001413655,0.010823366,0.00013641367,0.00007836334,0.00026906756,0.00008162249,0.009495421,0.09799556,0.0011706632,0.0026276032,0.87676466],"study_design_scores_gemma":[0.000031840227,0.00022391345,0.0474689,0.000028742821,0.0001460693,0.0009604537,0.00013369018,0.89466584,0.050037976,0.0024554715,0.003798788,0.000048226324],"about_ca_topic_score_codex":0.0009222979,"about_ca_topic_score_gemma":0.0012241271,"teacher_disagreement_score":0.001291355,"about_ca_system_score_codex":0.00016888771,"about_ca_system_score_gemma":0.00028160846,"threshold_uncertainty_score":0.004103303},"labels":[],"label_agreement":null},{"id":"W1558850179","doi":"10.1007/978-3-642-13437-1_30","title":"An Authoring Language as a Key to Usability in a Problem-Solving ITS Framework","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Usability; Key (lock); Domain (mathematical analysis); Task (project management); Class (philosophy); Human–computer interaction; Domain-specific language; Software engineering; Programming language; Multimedia; Artificial intelligence; Systems engineering","score_opus":0.017552994888765043,"score_gpt":0.2855506069192189,"score_spread":0.26799761203045386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558850179","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.0067988243,0.00029003667,0.9600851,0.0015685321,0.00016328557,0.00007655976,0.000046865203,0.001334614,0.02963625],"genre_scores_gemma":[0.29704797,0.00044330076,0.6770663,0.00035746096,0.00022718405,0.0003442959,0.00015370539,0.0012406366,0.023119144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933102,0.0037909017,0.0007712617,0.000749224,0.001069507,0.00030895474],"domain_scores_gemma":[0.98267704,0.010405693,0.0004422687,0.0037981255,0.0017002557,0.000976667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00557356,0.0009088104,0.00092629396,0.0011889639,0.0018547411,0.009913548,0.0021934188,0.0026131894,0.008771361],"category_scores_gemma":[0.014825345,0.0011215113,0.0014482932,0.0010773999,0.009790239,0.016508354,0.0046586795,0.0058982503,0.0022143228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026684673,0.000026412397,0.00013645097,0.00011193259,0.000008241856,0.00008649727,0.0023176686,0.0012732659,0.0018284661,0.9726951,0.0013384962,0.020150749],"study_design_scores_gemma":[0.00004960289,0.00010283655,0.000111525325,0.00017374095,0.000060196122,0.0004255974,0.0007913336,0.03130366,0.006757152,0.8706054,0.08957047,0.00004845999],"about_ca_topic_score_codex":0.0009669445,"about_ca_topic_score_gemma":0.0007796443,"teacher_disagreement_score":0.009913548,"about_ca_system_score_codex":0.0011490482,"about_ca_system_score_gemma":0.0021145209,"threshold_uncertainty_score":0.029476106},"labels":[],"label_agreement":null},{"id":"W1558923211","doi":"10.1007/978-3-642-04268-3_100","title":"A General PDE-Framework for Registration of Contrast Enhanced Images","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"Natural Sciences and Engineering Research Council of Canada; Terry Fox Foundation","keywords":"Regularization (linguistics); Computer science; Contrast (vision); Parametric statistics; Image registration; Term (time); Artificial intelligence; Exploit; Computer vision; Algorithm; Image (mathematics); Mathematics","score_opus":0.013338396922364762,"score_gpt":0.3103721865101055,"score_spread":0.29703378958774074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558923211","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.0001883635,0.000063054234,0.999288,0.00002763015,0.000019213057,0.000014543982,0.000020341919,0.00011219908,0.0002666051],"genre_scores_gemma":[0.021219973,0.0005870138,0.97209543,0.000092774695,0.00009808665,0.00011263894,0.00023336617,0.00039865554,0.005162084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944013,0.00011510989,0.000040187628,0.000112091446,0.00025039085,0.000042085197],"domain_scores_gemma":[0.9997002,0.000075976895,0.00002376938,0.00007857263,0.000092165916,0.000029428118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010900975,0.0008859818,0.0013347124,0.00075451605,0.0003985171,0.0014646951,0.0022137538,0.0016872004,0.0046195947],"category_scores_gemma":[0.0018917855,0.00066303543,0.0019083532,0.00095513614,0.0006864612,0.0014486306,0.0021965746,0.00217137,0.0029349616],"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.00012393983,0.00013411371,0.00034584504,0.0005862356,0.00013497738,0.00043919013,0.00019448274,0.2292196,0.084412314,0.38374826,0.009594053,0.2910669],"study_design_scores_gemma":[0.000026790642,0.000061650535,0.0001633872,0.000027976443,0.000031072563,0.0004355482,0.00001609148,0.913907,0.008762906,0.057386737,0.019147135,0.000033678065],"about_ca_topic_score_codex":0.0017710262,"about_ca_topic_score_gemma":0.0019971232,"teacher_disagreement_score":0.0046195947,"about_ca_system_score_codex":0.0004648458,"about_ca_system_score_gemma":0.0010285166,"threshold_uncertainty_score":0.0154541135},"labels":[],"label_agreement":null},{"id":"W1559021664","doi":"10.1007/3-540-45009-2_7","title":"Busy-Wait Barrier Synchronization Using Distributed Counters with Local Sensor","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"IBM (Canada)","funders":"","keywords":"Computer science; Synchronization (alternating current); Overhead (engineering); Fetch; Benchmark (surveying); Cache; Parallel computing; CPU cache; Reduction (mathematics); Embedded system; Implementation; Distributed computing; Operating system; Computer network","score_opus":0.01179537747796493,"score_gpt":0.2329380179915319,"score_spread":0.22114264051356697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559021664","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.033484478,0.00085159374,0.95482975,0.00017940108,0.00029888793,0.000090140245,0.00006742815,0.0047433376,0.0054550306],"genre_scores_gemma":[0.7423568,0.0003591451,0.24635543,0.0001339392,0.0000946897,0.00020662889,0.00019592953,0.00064087915,0.009656502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988865,0.00023861244,0.000071954084,0.00023094182,0.00042086543,0.00015124389],"domain_scores_gemma":[0.99750453,0.0008887827,0.00018596314,0.0008844806,0.0003762532,0.00016002676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750517,0.0008487894,0.0014084667,0.0008844584,0.0009831098,0.0019044825,0.0033778884,0.0008747656,0.0047566397],"category_scores_gemma":[0.0043036276,0.0007884973,0.00035820043,0.0011403674,0.00075655465,0.0026865555,0.002527792,0.001991302,0.0010420647],"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.004861148,0.00058088923,0.0032087006,0.0007615087,0.00032931642,0.00045102843,0.0012252952,0.1868362,0.15954402,0.20446861,0.01845182,0.41928148],"study_design_scores_gemma":[0.00037116613,0.00031610677,0.00045368474,0.000048797243,0.0001371164,0.00016819891,0.00010011771,0.8666897,0.08294379,0.03391839,0.014760395,0.0000926736],"about_ca_topic_score_codex":0.0014086101,"about_ca_topic_score_gemma":0.002164192,"teacher_disagreement_score":0.0047566397,"about_ca_system_score_codex":0.000860694,"about_ca_system_score_gemma":0.0012884671,"threshold_uncertainty_score":0.015912533},"labels":[],"label_agreement":null},{"id":"W1559053395","doi":"10.1007/11802914_21","title":"Shape-Based Retrieval of Articulated 3D Models Using Spectral Embedding","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Simon Fraser University","funders":"","keywords":"Embedding; Computer science; Eigenvalues and eigenvectors; Artificial intelligence; Pattern recognition (psychology); Rigid transformation; Shape analysis (program analysis); Transformation (genetics); Heat kernel signature; Scaling; Domain (mathematical analysis); Algorithm; Computer vision; Mathematics; Active shape model; Geometry; Mathematical analysis","score_opus":0.0206886443462132,"score_gpt":0.23517037903902352,"score_spread":0.21448173469281032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559053395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01959803,0.0003064012,0.97729546,0.00007550052,0.000055491215,0.00003468024,0.00019244719,0.0014029039,0.0010389333],"genre_scores_gemma":[0.28166568,0.0013924898,0.7077146,0.00018161604,0.000121260615,0.000109962035,0.002772092,0.0006261521,0.0054160943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936074,0.00008987938,0.000033049142,0.00013024476,0.00031732305,0.00006873117],"domain_scores_gemma":[0.99921215,0.00019240065,0.00006692722,0.00029892614,0.00019208457,0.000037452337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005203863,0.0012138064,0.0017067654,0.0023970203,0.0003526562,0.0014399559,0.0015025117,0.0014936484,0.003329422],"category_scores_gemma":[0.0019652375,0.0007810337,0.0016385862,0.0032520061,0.0006436531,0.002735857,0.0021463875,0.00092804525,0.0035673468],"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.00052596035,0.00019817146,0.0005651501,0.00026685325,0.00012279095,0.00033013363,0.00017068465,0.103825554,0.17223425,0.0095414445,0.0075898375,0.7046292],"study_design_scores_gemma":[0.000019037821,0.00006982679,0.00046510878,0.000015846977,0.000034105553,0.00035693857,0.00006214315,0.96208924,0.027625896,0.007168411,0.0020606155,0.000032808497],"about_ca_topic_score_codex":0.0013957554,"about_ca_topic_score_gemma":0.0023271744,"teacher_disagreement_score":0.003329422,"about_ca_system_score_codex":0.00038290813,"about_ca_system_score_gemma":0.0004387851,"threshold_uncertainty_score":0.011138022},"labels":[],"label_agreement":null},{"id":"W1559066648","doi":"10.1007/978-3-540-39597-3_39","title":"Extending XML Schema with Nonmonotonic Inheritance","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Computer science; Inheritance (genetic algorithm); Schema (genetic algorithms); XML; XML Schema (W3C); Document Structure Description; Theoretical computer science; Information retrieval; XML Encryption; World Wide Web","score_opus":0.014453287019744231,"score_gpt":0.23829901951868543,"score_spread":0.22384573249894119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559066648","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.027674556,0.00046757062,0.95587814,0.00041383595,0.00018697805,0.00010477071,0.0002532456,0.004943179,0.010077686],"genre_scores_gemma":[0.15776353,0.00081021327,0.82494324,0.0003964121,0.00011361806,0.00008271796,0.001260545,0.0015411826,0.013088513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984628,0.0003783686,0.00028088246,0.00022726561,0.0005555122,0.00009516427],"domain_scores_gemma":[0.9973047,0.0009937941,0.00012566477,0.0012634847,0.00025059585,0.000061718754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034555083,0.0004018716,0.0006046789,0.0008748178,0.0005086622,0.001879292,0.0016961672,0.0009331519,0.0034930015],"category_scores_gemma":[0.004408707,0.00081907545,0.0011135256,0.0011336743,0.0006388857,0.0063829897,0.0028099592,0.0014418447,0.0009816136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024094644,0.00034934646,0.002583843,0.0005616817,0.000104433486,0.0019562615,0.0018407975,0.0085492935,0.029207787,0.351616,0.010355252,0.59263444],"study_design_scores_gemma":[0.00016536281,0.00017304027,0.0015571383,0.00031939268,0.0003896088,0.0036043387,0.0005015349,0.19562352,0.06775463,0.45235243,0.2774146,0.00014440555],"about_ca_topic_score_codex":0.00085359823,"about_ca_topic_score_gemma":0.0012284582,"teacher_disagreement_score":0.0034930015,"about_ca_system_score_codex":0.00040782924,"about_ca_system_score_gemma":0.00043909534,"threshold_uncertainty_score":0.018274665},"labels":[],"label_agreement":null},{"id":"W1559068944","doi":"10.1007/978-3-540-70504-8_2","title":"Efficient Mining of Frequent Itemsets from Data Streams","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Computer science; Data stream mining; Data mining; STREAMS; Tree (set theory); Data stream; Wireless sensor network; Computer network","score_opus":0.03794779456616829,"score_gpt":0.2669591683562896,"score_spread":0.2290113737901213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559068944","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.08384787,0.002124274,0.9084508,0.00037303436,0.00014768816,0.0003201023,0.0019192223,0.0018626255,0.0009544668],"genre_scores_gemma":[0.27932054,0.001344803,0.70779324,0.000108171735,0.00023403295,0.00030111472,0.008920152,0.00014413512,0.0018338799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977842,0.0003655737,0.00038763997,0.00039719,0.00090449787,0.00016100568],"domain_scores_gemma":[0.9924516,0.0049939537,0.00054627744,0.0007323425,0.001107667,0.00016818466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00169348,0.0009317394,0.0022366098,0.00366581,0.0007917873,0.0022143724,0.0021751483,0.0011177085,0.00097043964],"category_scores_gemma":[0.010008363,0.00090139307,0.0015502844,0.0045056394,0.0003798534,0.0028434803,0.0012315384,0.0011783369,0.0009485783],"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.00087472727,0.0004752833,0.015036706,0.0009847347,0.0004956568,0.0010191305,0.00035380013,0.053388286,0.016099118,0.005283578,0.008648721,0.8973402],"study_design_scores_gemma":[0.00009806847,0.00028547188,0.0041029677,0.000111496825,0.00020494734,0.001753572,0.0002434093,0.95076895,0.011585237,0.026005952,0.0047996007,0.000040367726],"about_ca_topic_score_codex":0.0010892662,"about_ca_topic_score_gemma":0.0015873798,"teacher_disagreement_score":0.00366581,"about_ca_system_score_codex":0.00036981926,"about_ca_system_score_gemma":0.0011034312,"threshold_uncertainty_score":0.008956134},"labels":[],"label_agreement":null},{"id":"W1559071892","doi":"10.1007/3-540-45429-2_12","title":"Supporting Formal Verification of Crosscutting Concerns","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Formal methods; Formal verification; Composition (language); Programming language; Software engineering; Process (computing); Formal description; Formal specification; Linguistics","score_opus":0.04510924830627148,"score_gpt":0.326859788120967,"score_spread":0.2817505398146955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559071892","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.027452912,0.00019830339,0.96115667,0.0001311602,0.00006226939,0.00008341121,0.00006788556,0.0069891387,0.0038583574],"genre_scores_gemma":[0.50156504,0.00052279717,0.48881218,0.00014589936,0.00008791765,0.00014054561,0.00057994423,0.0018778808,0.0062678163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99598265,0.001049943,0.00037865594,0.00044356255,0.0017156048,0.00042962618],"domain_scores_gemma":[0.98320514,0.0122751575,0.0007864811,0.0025195119,0.0010419743,0.00017180611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004343254,0.0013931845,0.000754208,0.0010403258,0.0006464922,0.0029052554,0.0026747203,0.0018963694,0.005838729],"category_scores_gemma":[0.015658606,0.0016689507,0.0012567227,0.0006543763,0.0015824491,0.0058141,0.0034941817,0.0021702275,0.0014229274],"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.0007183813,0.00042158182,0.003512182,0.0014653705,0.0001496181,0.0016937719,0.0020303575,0.070362315,0.11034612,0.3286798,0.006034117,0.4745864],"study_design_scores_gemma":[0.0003105659,0.00027356256,0.00085949805,0.00039516288,0.00021231578,0.0012628792,0.00017963516,0.49971434,0.22304983,0.24015193,0.033489898,0.000100333105],"about_ca_topic_score_codex":0.0013924377,"about_ca_topic_score_gemma":0.0017795746,"teacher_disagreement_score":0.005838729,"about_ca_system_score_codex":0.0006810017,"about_ca_system_score_gemma":0.001425167,"threshold_uncertainty_score":0.022969604},"labels":[],"label_agreement":null},{"id":"W1559083155","doi":"10.1007/978-3-540-88690-7_53","title":"Multiple Tree Models for Occlusion and Spatial Constraints in Human Pose Estimation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Discriminative model; Tree (set theory); Artificial intelligence; Inference; Machine learning; Boosting (machine learning); Tree structure; Pose; Tree traversal; Pattern recognition (psychology); Data mining; Binary tree; Algorithm; Mathematics","score_opus":0.027437917663592062,"score_gpt":0.2585265673797306,"score_spread":0.23108864971613857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559083155","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.00326364,0.00040359804,0.9955089,0.000045250803,0.000027766586,0.000012112393,0.000095928146,0.00035699632,0.00028586193],"genre_scores_gemma":[0.30679384,0.0023627281,0.6793036,0.00018650256,0.00023689994,0.0003597184,0.0022762672,0.0010640671,0.007416384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.00034036973,0.000060335373,0.00025710496,0.00030050104,0.000111628324],"domain_scores_gemma":[0.9981805,0.0011819531,0.00011965627,0.00023831557,0.00021847032,0.00006102237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433468,0.0011860834,0.002480602,0.0011579617,0.0006048512,0.0012623888,0.0026227105,0.0022988718,0.0036646258],"category_scores_gemma":[0.0053897006,0.0015561545,0.0016987005,0.0028727385,0.00064451835,0.0033699276,0.0015566961,0.0026837627,0.0018416204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016225516,0.00008617677,0.00042887934,0.00010518599,0.00010584186,0.00008011841,0.0001119434,0.7506716,0.0040859235,0.012182567,0.0033186486,0.22866091],"study_design_scores_gemma":[0.0000040877003,0.000010941308,0.00008037178,0.000006006599,0.000009987554,0.000024505207,0.0000046537198,0.9936667,0.00031269089,0.0053724097,0.00050102663,0.00000658822],"about_ca_topic_score_codex":0.012154542,"about_ca_topic_score_gemma":0.01824406,"teacher_disagreement_score":0.012154542,"about_ca_system_score_codex":0.0005245454,"about_ca_system_score_gemma":0.0009942306,"threshold_uncertainty_score":0.024167597},"labels":[],"label_agreement":null},{"id":"W1559186764","doi":"10.1007/978-3-540-45091-7_26","title":"Sesei: A CG-Based Filter for Internet Search Engines","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université Laval","funders":"","keywords":"Computer science; The Internet; Filter (signal processing); Search engine; World Wide Web; Information retrieval; Artificial intelligence; Speech recognition; Computer vision","score_opus":0.022449494893691795,"score_gpt":0.2802579448231724,"score_spread":0.2578084499294806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559186764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018004114,0.000615344,0.6976673,0.0004286117,0.00028962982,0.00050775707,0.011897829,0.26134518,0.009244228],"genre_scores_gemma":[0.14646408,0.00054111064,0.763673,0.0007651122,0.00029835227,0.00057300733,0.031486433,0.0145227695,0.041676152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.00010314031,0.000080403384,0.00015021244,0.00041419134,0.00010313726],"domain_scores_gemma":[0.9978276,0.00086712383,0.00012121603,0.00052861637,0.0004900474,0.00016535986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011914723,0.0013788647,0.0015660602,0.004275489,0.00090716017,0.0021477104,0.0017826699,0.0014030366,0.02046576],"category_scores_gemma":[0.0054316837,0.00072797516,0.0011652374,0.0030616012,0.00045836027,0.0029694256,0.0017447078,0.001222447,0.010995127],"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.00213259,0.0004462131,0.0046278555,0.00088615797,0.00027452325,0.00038295222,0.0003466274,0.009115722,0.035959616,0.021453826,0.23737621,0.68699783],"study_design_scores_gemma":[0.0005840671,0.0005153769,0.0056249355,0.00017299008,0.00036015396,0.00067240524,0.00022853384,0.51546675,0.1073182,0.04495723,0.32388175,0.00021767913],"about_ca_topic_score_codex":0.008464719,"about_ca_topic_score_gemma":0.015502673,"teacher_disagreement_score":0.02046576,"about_ca_system_score_codex":0.0008382837,"about_ca_system_score_gemma":0.0016110683,"threshold_uncertainty_score":0.068464816},"labels":[],"label_agreement":null},{"id":"W1559247248","doi":"10.1007/978-3-540-74450-4_35","title":"Robust Optimization Model for a Class of Uncertain Linear Programs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Robustness (evolution); Computer science; Robust optimization; Mathematical optimization; Probabilistic logic; Class (philosophy); Optimization problem; Linear programming; Contrast (vision); Algorithm; Mathematics; Artificial intelligence","score_opus":0.15522962164068388,"score_gpt":0.35903669729226834,"score_spread":0.20380707565158446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559247248","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.012485909,0.000691919,0.97531724,0.0006321745,0.00005357799,0.00006121028,0.0002563467,0.00022723127,0.01027443],"genre_scores_gemma":[0.7757337,0.0018503834,0.18475184,0.00037459706,0.0003568129,0.00062707416,0.0009296484,0.00023550876,0.035140514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919015,0.00022872971,0.000030204692,0.00020496338,0.00026021205,0.00008559632],"domain_scores_gemma":[0.99876547,0.00074195786,0.00021426911,0.000055635268,0.00016194655,0.0000606664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436247,0.0014479478,0.0018420577,0.00080454117,0.00042792768,0.0024160268,0.0020284439,0.0023623325,0.0052213],"category_scores_gemma":[0.0034926261,0.00066585775,0.0013884526,0.0010385514,0.0011432051,0.0019444932,0.0010800682,0.002701058,0.000640483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042757405,0.000050050672,0.00013102558,0.00010172655,0.000052908832,0.00009641476,0.000043600303,0.8226818,0.001099242,0.16232938,0.0019486451,0.011422534],"study_design_scores_gemma":[0.0000066698162,0.000017125723,0.000045641038,0.000005829558,0.000007658273,0.0000153083,0.0000036309393,0.9792966,0.00010492288,0.020040767,0.0004499907,0.0000058730725],"about_ca_topic_score_codex":0.004200628,"about_ca_topic_score_gemma":0.0026514437,"teacher_disagreement_score":0.0052213,"about_ca_system_score_codex":0.0014473846,"about_ca_system_score_gemma":0.0011801488,"threshold_uncertainty_score":0.017467022},"labels":[],"label_agreement":null},{"id":"W1559288689","doi":"10.1007/978-3-540-76888-3_4","title":"Collaborative Data Synchronization in an Instance-Mapped P2P Data Sharing System","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Synchronizing; Computer science; Synchronization (alternating current); Data sharing; Peer-to-peer; Data synchronization; Relational database; Distributed computing; Database; Computer network","score_opus":0.062242125821386204,"score_gpt":0.3105777057470729,"score_spread":0.24833557992568667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559288689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17878689,0.00063587603,0.8035039,0.00063628634,0.0002650717,0.0003588277,0.00023756406,0.0072469297,0.008328673],"genre_scores_gemma":[0.80942625,0.00018920515,0.184711,0.0001349066,0.00007208666,0.00016642909,0.0003361601,0.00019481094,0.0047691353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784493,0.0006056279,0.00018127213,0.00044706865,0.00069718715,0.00022395821],"domain_scores_gemma":[0.9967186,0.001110498,0.00013256281,0.0012810384,0.0004178315,0.0003394058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024465886,0.0004984798,0.0013394105,0.0007972152,0.0020830184,0.0037635376,0.0035721904,0.0016464886,0.0026435433],"category_scores_gemma":[0.004656321,0.0007450517,0.0005184095,0.0016908483,0.00079992117,0.002867336,0.0035659808,0.0014418638,0.0007087016],"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.004956777,0.0016356015,0.010064191,0.00055540353,0.0005201154,0.003431675,0.003478427,0.28630397,0.097972296,0.11041134,0.027469233,0.45320114],"study_design_scores_gemma":[0.00016915258,0.00016360673,0.00063215784,0.000015679478,0.00008754423,0.0004119086,0.00033863488,0.944896,0.024572533,0.02081033,0.007847025,0.00005535137],"about_ca_topic_score_codex":0.004910119,"about_ca_topic_score_gemma":0.0040522264,"teacher_disagreement_score":0.004910119,"about_ca_system_score_codex":0.00080294424,"about_ca_system_score_gemma":0.0017049155,"threshold_uncertainty_score":0.012938976},"labels":[],"label_agreement":null},{"id":"W1559347819","doi":"10.1007/978-3-642-12297-2_22","title":"Human Action Recognition Using Non-separable Oriented 3D Dual-Tree Complex Wavelets","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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 Windsor","funders":"","keywords":"Complex wavelet transform; Computer science; Artificial intelligence; Pattern recognition (psychology); Classifier (UML); Computer vision; Wavelet transform; Pixel; Categorization; Wavelet; Discrete wavelet transform","score_opus":0.07964072100341703,"score_gpt":0.3331938573939116,"score_spread":0.2535531363904946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559347819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03954294,0.00042718512,0.95796704,0.00006839455,0.000058904192,0.000028320415,0.0001671806,0.0003726707,0.0013673614],"genre_scores_gemma":[0.44529736,0.001427536,0.54893506,0.00010197319,0.000097123,0.00006711647,0.0006915784,0.00014324121,0.0032390284],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999795,0.00002947872,0.000012615211,0.000054554934,0.000080419784,0.000027846401],"domain_scores_gemma":[0.9997286,0.00008762978,0.000028902166,0.000053664513,0.00007947069,0.000021643666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032649242,0.00047278748,0.00065555354,0.0008695178,0.00013517619,0.00075900415,0.0004423753,0.0005723919,0.0016256968],"category_scores_gemma":[0.0008712258,0.00028907982,0.0006490515,0.0010646087,0.00030305833,0.0007279068,0.0004716325,0.0005009321,0.0009862916],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038412792,0.00011489523,0.0017584502,0.00017506804,0.00007919908,0.00016957095,0.0001036602,0.027799167,0.12733893,0.006107067,0.0031017116,0.83286816],"study_design_scores_gemma":[0.000021338377,0.000120573175,0.0062925355,0.00003199368,0.00005016636,0.00050921994,0.0000622713,0.9596052,0.024553077,0.0061193286,0.00260695,0.000027300635],"about_ca_topic_score_codex":0.0006832031,"about_ca_topic_score_gemma":0.00103773,"teacher_disagreement_score":0.0016256968,"about_ca_system_score_codex":0.0001433003,"about_ca_system_score_gemma":0.00021913658,"threshold_uncertainty_score":0.005438447},"labels":[],"label_agreement":null},{"id":"W1559440724","doi":"10.1007/978-3-540-78913-0_6","title":"Latest News about Demonic Algebra with Domain","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Université Laval","funders":"","keywords":"Axiom; Algebra over a field; Domain (mathematical analysis); Kleene algebra; Conjecture; Independence (probability theory); Computer science; Term algebra; Mathematics; Filtered algebra; Pure mathematics; Two-element Boolean algebra; Discrete mathematics","score_opus":0.014775582373397139,"score_gpt":0.22185743919322476,"score_spread":0.20708185681982763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559440724","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013902178,0.12195801,0.01691161,0.20262222,0.09514467,0.000031757067,0.0009704016,0.0015856789,0.5593855],"genre_scores_gemma":[0.031238897,0.11427813,0.009852103,0.06312354,0.06613379,0.000070495946,0.0018207307,0.0016936332,0.7117887],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994715,0.00011291404,0.000032371616,0.000052668034,0.0002569403,0.000073587325],"domain_scores_gemma":[0.99907196,0.0003691651,0.000045712753,0.000141886,0.00022387142,0.0001472884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635039,0.0003960317,0.0005217653,0.0013500456,0.0010825957,0.003089758,0.0007094168,0.0013748922,0.067940585],"category_scores_gemma":[0.0022648436,0.00035552995,0.0005233854,0.001827488,0.0014378772,0.009897418,0.0011763973,0.0038370283,0.020074584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029661773,0.000009171969,0.00002946529,0.00016898262,0.0000041017984,0.000029472032,0.00006229788,0.00007720469,0.00020079243,0.17253637,0.744088,0.08276455],"study_design_scores_gemma":[0.000003131078,0.0000027359747,0.000031620835,0.000050559644,0.0000015849049,0.000047143447,0.000015166576,0.0000316253,0.000085709435,0.025729181,0.97399795,0.000003587437],"about_ca_topic_score_codex":0.0009907335,"about_ca_topic_score_gemma":0.0024107392,"teacher_disagreement_score":0.067940585,"about_ca_system_score_codex":0.0013382591,"about_ca_system_score_gemma":0.00091782096,"threshold_uncertainty_score":0.22728395},"labels":[],"label_agreement":null},{"id":"W1559445291","doi":"10.1007/11691372_14","title":"Why Waste a Perfectly Good Abstraction?","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Abstraction; Model checking; Programming language; Construct (python library); Negation; Theoretical computer science; Software; Overhead (engineering)","score_opus":0.01894644267695774,"score_gpt":0.2649961078419883,"score_spread":0.24604966516503055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559445291","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.036108147,0.0104014585,0.6615169,0.12933584,0.0076511786,0.00014139125,0.00046355277,0.0053849663,0.14899655],"genre_scores_gemma":[0.6462508,0.0070698387,0.20855162,0.028822757,0.0025685001,0.0003711776,0.00034130694,0.0036987972,0.10232522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99389786,0.0014377203,0.00027787944,0.0006310116,0.0027466824,0.0010089694],"domain_scores_gemma":[0.98668647,0.0038598457,0.000651646,0.0062742964,0.0017091885,0.0008186023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007952931,0.0010375585,0.0015593568,0.0012606219,0.0024996758,0.0042962106,0.0024745304,0.0029268542,0.01414541],"category_scores_gemma":[0.02824795,0.0010908102,0.001226202,0.0009777057,0.0122482935,0.023111982,0.0075601097,0.0086281495,0.0060175974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091868686,0.000038573155,0.00033779748,0.0002435951,0.00005249788,0.00014428432,0.0008136884,0.0015442469,0.0010491669,0.9266786,0.028079772,0.040925972],"study_design_scores_gemma":[0.000020587902,0.000029495646,0.00008570836,0.00011303808,0.00002987722,0.00013054191,0.0003015795,0.0009160094,0.0011183639,0.9283428,0.068892635,0.000019220568],"about_ca_topic_score_codex":0.0011303966,"about_ca_topic_score_gemma":0.0013076414,"teacher_disagreement_score":0.01414541,"about_ca_system_score_codex":0.0017042187,"about_ca_system_score_gemma":0.0025032167,"threshold_uncertainty_score":0.04732108},"labels":[],"label_agreement":null},{"id":"W1559493324","doi":"10.1007/978-3-540-39724-3_21","title":"On the Correctness of an Intrusion-Tolerant Group Communication Protocol","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Intrusion tolerance; Correctness; Byzantine fault tolerance; Computer science; Fault tolerance; Robustness (evolution); Quantum Byzantine agreement; Intrusion; Distributed computing; Protocol (science); Theoretical computer science; Computer security; Algorithm; Intrusion detection system","score_opus":0.016371806604547744,"score_gpt":0.2594534385205328,"score_spread":0.24308163191598509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559493324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047637634,0.0012687725,0.90666455,0.0048440224,0.0009585755,0.0002627494,0.0001801517,0.0013951848,0.036788363],"genre_scores_gemma":[0.82527447,0.0020208245,0.15581055,0.0010810918,0.0008843408,0.00053017325,0.0005321173,0.00060681213,0.013259585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931786,0.0018100945,0.00047537094,0.00054235064,0.0033419007,0.00065171666],"domain_scores_gemma":[0.97925997,0.013400905,0.000881866,0.003713062,0.0024019945,0.00034230054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005410686,0.0009648974,0.0015048254,0.0010862486,0.0022241974,0.004147723,0.0030154726,0.0029878644,0.0032204234],"category_scores_gemma":[0.026960036,0.0011592568,0.0009920468,0.0015067324,0.0067461687,0.008965117,0.0050193896,0.0053517194,0.0011122015],"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.0005053005,0.00007499559,0.00077988696,0.0002436977,0.000054291115,0.00036444448,0.0008422397,0.04780936,0.004445584,0.89670545,0.0058719637,0.042302743],"study_design_scores_gemma":[0.00020972414,0.00013342554,0.0002356681,0.000087728535,0.0000776942,0.0002303635,0.00013937795,0.15163723,0.0055705323,0.8286699,0.012966897,0.000041465013],"about_ca_topic_score_codex":0.0017667734,"about_ca_topic_score_gemma":0.000827566,"teacher_disagreement_score":0.005410686,"about_ca_system_score_codex":0.0014431896,"about_ca_system_score_gemma":0.0018365434,"threshold_uncertainty_score":0.02861476},"labels":[],"label_agreement":null},{"id":"W1559495379","doi":"10.1007/978-3-540-73681-3_6","title":"Using Cognitive Archetypes and Conceptual Graphs to Model Dynamic Phenomena in Spatial Environments","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université Laval","funders":"","keywords":"Computer science; Archetype; Context (archaeology); Domain (mathematical analysis); Conceptual model; Spatial intelligence; Spatial cognition; Space (punctuation); Artificial intelligence; Cognitive model; Qualitative reasoning; Cognition; Cognitive map; Mathematics","score_opus":0.047276882362646114,"score_gpt":0.2856866817575561,"score_spread":0.23840979939491003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559495379","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.02345176,0.00039936844,0.959366,0.00093201775,0.00008345113,0.00010799151,0.0005334415,0.0006980284,0.014428032],"genre_scores_gemma":[0.36631152,0.0008346639,0.62563103,0.00021252826,0.000036939553,0.0003903902,0.0011569075,0.00023652092,0.0051894584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999483,0.00023351549,0.00004723276,0.000108860346,0.00008580197,0.000041642237],"domain_scores_gemma":[0.9984586,0.0010045343,0.00010915045,0.00023251279,0.00012745899,0.00006773093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095054886,0.00088056264,0.00043054725,0.0018843873,0.0008912401,0.0035239877,0.0016940662,0.0012748793,0.0035578776],"category_scores_gemma":[0.0041854586,0.0007452768,0.001766886,0.002204534,0.0031776738,0.008076827,0.0020442535,0.0023348627,0.00052644446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024163766,0.000038872928,0.0005903581,0.00010246449,0.000039297895,0.00014458259,0.0013677251,0.07794594,0.0005754333,0.89947104,0.0012068814,0.018493287],"study_design_scores_gemma":[0.000017909142,0.000011296447,0.00018954388,0.000042945903,0.00003703754,0.000067843874,0.00036064457,0.16034068,0.00044367954,0.8260282,0.012438513,0.000021629183],"about_ca_topic_score_codex":0.018764397,"about_ca_topic_score_gemma":0.020202637,"teacher_disagreement_score":0.018764397,"about_ca_system_score_codex":0.0018930455,"about_ca_system_score_gemma":0.0015279577,"threshold_uncertainty_score":0.03731036},"labels":[],"label_agreement":null},{"id":"W1559568018","doi":"10.1007/3-540-47884-1_11","title":"Formalization of Cadence SPW Fixed-Point Arithmetic in HOL","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","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":"Concordia University","funders":"","keywords":"Rounding; Computer science; HOL; Fixed-point arithmetic; Saturation arithmetic; Correctness; Arithmetic; Division (mathematics); Fixed point; Multiplication (music); Algorithm; Floating point; Arbitrary-precision arithmetic; Mathematics; Programming language","score_opus":0.02162370347798586,"score_gpt":0.26451962028958237,"score_spread":0.2428959168115965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559568018","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.04724219,0.001332456,0.709346,0.0013321174,0.00050649507,0.0001254102,0.00044683708,0.0012862529,0.23838228],"genre_scores_gemma":[0.78084356,0.001296515,0.16900477,0.0008846044,0.0006402036,0.0002576106,0.00071247725,0.0007092334,0.04565093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993375,0.000118963646,0.000049685914,0.0001222183,0.0002647219,0.00010696915],"domain_scores_gemma":[0.9996635,0.00011511377,0.000026342579,0.00008048953,0.000088002584,0.000026640595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237856,0.00067463465,0.00066892285,0.0018806205,0.0012245366,0.0030497946,0.0015236572,0.0007709501,0.011661768],"category_scores_gemma":[0.0012657559,0.00044357456,0.0010491972,0.0016833271,0.0038952797,0.004131837,0.0019893139,0.0030941218,0.0017271108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005963854,0.0000051716765,0.000023106075,0.000018468807,0.0000022441002,0.000023633502,0.00007984885,0.000356504,0.00022429152,0.9937674,0.00049567624,0.004997733],"study_design_scores_gemma":[0.000010047932,0.000011868072,0.00008068357,0.00001872727,0.00000697332,0.00006561517,0.000053083902,0.0026316787,0.00056071975,0.98427564,0.012276392,0.000008596107],"about_ca_topic_score_codex":0.001315017,"about_ca_topic_score_gemma":0.0013337974,"teacher_disagreement_score":0.011661768,"about_ca_system_score_codex":0.0017032146,"about_ca_system_score_gemma":0.0006516851,"threshold_uncertainty_score":0.03901249},"labels":[],"label_agreement":null},{"id":"W1559642835","doi":"10.1007/3-540-39205-x_116","title":"A Non-local Coarsening Result in Granular Probabilistic Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Correctness; Probabilistic logic; Computer science; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.021518882699299514,"score_gpt":0.2476620153898545,"score_spread":0.22614313269055497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559642835","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.10027179,0.0026798805,0.87376547,0.001270045,0.00020002328,0.000054489145,0.00018493342,0.00031898782,0.02125442],"genre_scores_gemma":[0.84315276,0.0020132172,0.1370252,0.0005192027,0.0005621143,0.00013181925,0.00035035805,0.0003238453,0.015921349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890554,0.00028627977,0.00006157283,0.00033906483,0.0002866647,0.000120884724],"domain_scores_gemma":[0.98842156,0.007822086,0.0009401315,0.0013761265,0.0007308691,0.0007091539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027812622,0.00083911006,0.0023293144,0.002330874,0.001996742,0.0035318565,0.0024134298,0.0019807967,0.00461342],"category_scores_gemma":[0.014010436,0.0013847406,0.0018175929,0.0025462639,0.0034685174,0.0068806815,0.004154024,0.0048096315,0.0003745006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012132864,0.00003856502,0.00083820656,0.00022689537,0.00009357729,0.00017039491,0.00037172055,0.13169137,0.0021606707,0.8457635,0.0018659056,0.016657809],"study_design_scores_gemma":[0.000009435758,0.000022561477,0.0005856354,0.00002092638,0.00003567541,0.00006011892,0.000050843122,0.28013054,0.00046298516,0.7175189,0.0010847015,0.000017561868],"about_ca_topic_score_codex":0.0031815534,"about_ca_topic_score_gemma":0.0027174773,"teacher_disagreement_score":0.00461342,"about_ca_system_score_codex":0.0019079635,"about_ca_system_score_gemma":0.0006276823,"threshold_uncertainty_score":0.015433431},"labels":[],"label_agreement":null},{"id":"W1559758043","doi":"10.1007/3-540-45111-0_7","title":"Building Intensional Communities Using Shared Contexts","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Victoria","funders":"","keywords":"Computer science; Daemon; Scripting language; Context (archaeology); World Wide Web; Programming language; Class (philosophy); Process (computing); Aether; Operating system; Artificial intelligence","score_opus":0.08053486976977622,"score_gpt":0.377568706953451,"score_spread":0.2970338371836748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559758043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16045932,0.0001318443,0.8204783,0.00020384487,0.00004715961,0.00026912705,0.00005930798,0.0011241618,0.01722699],"genre_scores_gemma":[0.59976166,0.00009690369,0.38914937,0.00006613907,0.00002580364,0.00033502936,0.00021824405,0.00021985019,0.010127013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.00053009856,0.00005321165,0.0003362344,0.000207896,0.00012563699],"domain_scores_gemma":[0.9953447,0.0020074295,0.0002590522,0.0014879387,0.00034962248,0.00055124797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017523726,0.0004987928,0.0004996072,0.00077031663,0.0021391527,0.0020486435,0.0017965947,0.0008247085,0.006520346],"category_scores_gemma":[0.005365253,0.00056883716,0.0006430785,0.0007299293,0.0018108089,0.007000735,0.009763824,0.0013047279,0.0011581149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032572894,0.0009432293,0.0062233554,0.0004670954,0.00013634894,0.00063551747,0.01574575,0.02971007,0.034748513,0.569689,0.004439073,0.33693632],"study_design_scores_gemma":[0.00019238293,0.00049683277,0.0025027667,0.00018742256,0.00016510919,0.00067782524,0.010025981,0.24840835,0.028098984,0.65203303,0.057126414,0.000084925785],"about_ca_topic_score_codex":0.00056306185,"about_ca_topic_score_gemma":0.0016866432,"teacher_disagreement_score":0.006520346,"about_ca_system_score_codex":0.00033865205,"about_ca_system_score_gemma":0.00068827835,"threshold_uncertainty_score":0.021812797},"labels":[],"label_agreement":null},{"id":"W1559767587","doi":"10.1007/978-3-642-04031-3_32","title":"Bayesian Optimization Algorithm for the Non-unique Oligonucleotide Probe Selection Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Windsor","funders":"","keywords":"Computer science; Heuristics; Selection (genetic algorithm); Oligomer restriction; Algorithm; Bayesian optimization; Set (abstract data type); Bayesian probability; DNA microarray; Oligonucleotide; Data mining; Artificial intelligence; DNA; Biology","score_opus":0.008356079021076617,"score_gpt":0.2409992823675801,"score_spread":0.23264320334650346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559767587","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.0016802173,0.00016688168,0.9968612,0.00018321062,0.000019192097,0.00004288018,0.00005700629,0.00028202042,0.0007073176],"genre_scores_gemma":[0.045227695,0.0002802273,0.9479884,0.00033489504,0.000087852175,0.0006324157,0.00048315263,0.0002757179,0.004689692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808216,0.0009174743,0.000088540764,0.00035082098,0.0003986062,0.00016247506],"domain_scores_gemma":[0.99367046,0.0053042695,0.00018827294,0.0001637167,0.00054042466,0.00013286283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00405459,0.0013978792,0.003225601,0.0012643207,0.0008478945,0.001432727,0.0035674467,0.0029519924,0.007844102],"category_scores_gemma":[0.009268713,0.0017192087,0.0014219412,0.0020536762,0.0013988487,0.002081324,0.002511197,0.0033943257,0.0023818735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045249824,0.00018355274,0.0007017341,0.00022820199,0.00016054767,0.0000890569,0.00013271946,0.6598725,0.00260698,0.031369742,0.00839891,0.2958036],"study_design_scores_gemma":[0.000072088245,0.000032218406,0.00010830535,0.000015358095,0.000017525132,0.000026523223,0.00000912766,0.98293084,0.00040821245,0.015533582,0.00083244214,0.000013766512],"about_ca_topic_score_codex":0.0072254953,"about_ca_topic_score_gemma":0.0074506924,"teacher_disagreement_score":0.007844102,"about_ca_system_score_codex":0.0015971502,"about_ca_system_score_gemma":0.0035159676,"threshold_uncertainty_score":0.026241124},"labels":[],"label_agreement":null},{"id":"W1559883676","doi":"10.1007/978-3-540-73400-0_74","title":"Liknon Feature Selection for Microarrays","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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":"National Research Council Canada; National Research Council Institute for Biodiagnostics","funders":"","keywords":"Feature selection; Robustness (evolution); Computer science; Artificial intelligence; Regularization (linguistics); Data mining; Support vector machine; Pattern recognition (psychology); Machine learning; Feature vector","score_opus":0.018389812580658933,"score_gpt":0.27547869175975376,"score_spread":0.25708887917909484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559883676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060350704,0.0006644547,0.98181283,0.0001529679,0.000113072776,0.00007188399,0.0012972293,0.00809846,0.0017540376],"genre_scores_gemma":[0.08409545,0.0003469465,0.8839315,0.00021956394,0.00012131349,0.00074826466,0.009711878,0.0015284497,0.019296579],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930894,0.0002286289,0.000037127178,0.00017066322,0.00019730219,0.00005734384],"domain_scores_gemma":[0.9988906,0.0005842423,0.000038027018,0.0002543665,0.00020228582,0.00003059233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872047,0.0008017951,0.0009835272,0.00076281565,0.00044857292,0.0007541103,0.0015161855,0.00063271704,0.010385629],"category_scores_gemma":[0.0028173379,0.0005098542,0.00068718614,0.0010199298,0.00022704856,0.00071522634,0.0008073663,0.000986308,0.004841192],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032446024,0.00011173261,0.0013116556,0.00022843262,0.00007993261,0.00007978699,0.000029659946,0.015326366,0.019958733,0.0077685164,0.045133363,0.9096473],"study_design_scores_gemma":[0.00008453312,0.00022455161,0.004613609,0.000039107796,0.000056534773,0.0002213263,0.00003670493,0.8791615,0.03240298,0.03952732,0.0435782,0.00005369333],"about_ca_topic_score_codex":0.001439278,"about_ca_topic_score_gemma":0.004978992,"teacher_disagreement_score":0.010385629,"about_ca_system_score_codex":0.00036393132,"about_ca_system_score_gemma":0.0006010257,"threshold_uncertainty_score":0.03474343},"labels":[],"label_agreement":null},{"id":"W1559950581","doi":"10.1007/11494683_24","title":"Cluster-Based Cumulative Ensembles","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jaccard index; Cluster (spacecraft); Computer science; Cluster analysis; Granularity; Similarity (geometry); Data mining; Hierarchical clustering; Computation; Measure (data warehouse); Single-linkage clustering; Pattern recognition (psychology); Algorithm; Artificial intelligence; Fuzzy clustering; CURE data clustering algorithm","score_opus":0.02871685949556528,"score_gpt":0.3041407387586494,"score_spread":0.2754238792630841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559950581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01768848,0.0005944172,0.9640229,0.00016630469,0.00018949098,0.00002861612,0.00008818009,0.00032040145,0.016901176],"genre_scores_gemma":[0.59013665,0.0015191761,0.3662959,0.00025648472,0.00062228,0.00018653645,0.0006884616,0.0006263632,0.039668128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989705,0.00035855453,0.0000363565,0.00017232895,0.0003903849,0.000071877],"domain_scores_gemma":[0.99661094,0.0014665716,0.0001434914,0.0007875067,0.0007938527,0.00019758822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015872031,0.0006382625,0.0013148478,0.0014253238,0.000991795,0.0015317036,0.0015566954,0.00095723144,0.005678073],"category_scores_gemma":[0.006462424,0.00055989047,0.00085573556,0.0015322785,0.0009816296,0.0016976115,0.0025638628,0.0016933478,0.0012864377],"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.00010101675,0.000048160207,0.00082686124,0.000118213444,0.00009773563,0.00006860238,0.00016481873,0.26665586,0.0039922805,0.58109486,0.008331903,0.13849977],"study_design_scores_gemma":[0.000006515274,0.000024753455,0.00045287848,0.00001885843,0.000021690526,0.000103991275,0.000027714865,0.73662925,0.0013235005,0.25607607,0.005291846,0.00002289181],"about_ca_topic_score_codex":0.0007174029,"about_ca_topic_score_gemma":0.001495248,"teacher_disagreement_score":0.005678073,"about_ca_system_score_codex":0.00066727534,"about_ca_system_score_gemma":0.00039116282,"threshold_uncertainty_score":0.018995106},"labels":[],"label_agreement":null},{"id":"W1559991472","doi":"10.1007/11407522_16","title":"LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Windsor","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Workload; Schedule; Distributed computing; Context switch; Queue; Gang scheduling; Operating system; Computer network; Dynamic priority scheduling; Rate-monotonic scheduling; Mathematical optimization","score_opus":0.033239715042144825,"score_gpt":0.29211456991881357,"score_spread":0.2588748548766687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559991472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023635687,0.0011276545,0.9414021,0.00037050783,0.0007702985,0.00022751106,0.0003571212,0.010338148,0.021770991],"genre_scores_gemma":[0.55485576,0.00042779572,0.41763848,0.0005236329,0.00025193894,0.00024762802,0.0007384887,0.00093433604,0.024381856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.00016175155,0.0000612195,0.00020359828,0.0002668005,0.00021483682],"domain_scores_gemma":[0.9990752,0.00027199974,0.000059275597,0.00033541746,0.00017456675,0.00008342872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012347614,0.00090980594,0.0013035684,0.0007958289,0.0012576645,0.001784744,0.00261421,0.0009352971,0.015576019],"category_scores_gemma":[0.0027132663,0.00052676944,0.0005081299,0.0012205795,0.0006029917,0.0020172978,0.0018337885,0.0015987098,0.0027355044],"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.0022127575,0.0004304368,0.0005289351,0.00038691613,0.00010806587,0.00020078858,0.00012846659,0.13085905,0.022737738,0.0715828,0.03876233,0.7320617],"study_design_scores_gemma":[0.00012262669,0.00019203739,0.00020980062,0.000029650115,0.000042457857,0.00012845382,0.000041713072,0.9073715,0.0223452,0.05179661,0.017667707,0.000052226747],"about_ca_topic_score_codex":0.00370312,"about_ca_topic_score_gemma":0.004836664,"teacher_disagreement_score":0.015576019,"about_ca_system_score_codex":0.0011160981,"about_ca_system_score_gemma":0.0020096581,"threshold_uncertainty_score":0.052106917},"labels":[],"label_agreement":null},{"id":"W1560023304","doi":"10.1007/978-3-540-39903-2_120","title":"Two Bone Fragment Manipulation in Computer-Assisted Preoperative Planning: Restoration of the Radial Bow","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Orthopedic Surgery and Rehabilitation","field":"Medicine","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Malunion; Ulna; Wrist; Forearm; Medicine; RADIUS; Intramedullary rod; Fixation (population genetics); Surgery; Osteotomy; Orthodontics; Computer science; Population","score_opus":0.028276836699033362,"score_gpt":0.2820069795908897,"score_spread":0.25373014289185636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560023304","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.08639655,0.0075424765,0.8476896,0.00083601585,0.0009776363,0.0001824739,0.00015410337,0.003607566,0.05261355],"genre_scores_gemma":[0.40023956,0.004476421,0.52640337,0.0002354769,0.00025930797,0.000095834206,0.00018749075,0.0006588301,0.06744371],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996724,0.000038664974,0.000020552581,0.000053659656,0.00017648975,0.000038330614],"domain_scores_gemma":[0.9997503,0.00012505832,0.000017849663,0.000053242922,0.000026360853,0.000027180211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056118047,0.00081527163,0.0004418382,0.0007371588,0.0004350699,0.00087345595,0.0011545714,0.0010442024,0.00915888],"category_scores_gemma":[0.00073200196,0.0005666515,0.00060639635,0.0005153106,0.00093628676,0.0009507762,0.00092147716,0.0013735454,0.0013824926],"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.0010935409,0.00020471115,0.00086667755,0.0005882575,0.000043176937,0.0020602327,0.00073621306,0.013790904,0.15752989,0.01587829,0.009315446,0.7978927],"study_design_scores_gemma":[0.00040531383,0.0037972257,0.018625038,0.0007105462,0.00045572247,0.12840186,0.0009039295,0.16511528,0.32949087,0.029889964,0.32155177,0.0006525362],"about_ca_topic_score_codex":0.0010093537,"about_ca_topic_score_gemma":0.0023404388,"teacher_disagreement_score":0.00915888,"about_ca_system_score_codex":0.00029334068,"about_ca_system_score_gemma":0.0006864651,"threshold_uncertainty_score":0.03063953},"labels":[],"label_agreement":null},{"id":"W1560064828","doi":"10.1007/978-3-642-12304-7_39","title":"Efficient Human Action Detection Using a Transferable Distance Function","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Weighting; Computer vision; Cascade; Function (biology); Action recognition; Pattern recognition (psychology); Action (physics)","score_opus":0.028476020717194458,"score_gpt":0.2585356592903455,"score_spread":0.23005963857315104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560064828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008678583,0.00013884052,0.98850656,0.000045889086,0.000043851483,0.000034198045,0.00007485228,0.0013364762,0.0011408447],"genre_scores_gemma":[0.24499878,0.00039479468,0.73919755,0.0001462789,0.00008999683,0.00017840746,0.00072803674,0.00030681543,0.013959306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993761,0.00006670994,0.000023939385,0.00016696907,0.00029777695,0.000068539324],"domain_scores_gemma":[0.9995789,0.00014052965,0.000025238407,0.000097420416,0.00012891888,0.000029018409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046936603,0.00085796526,0.0012591718,0.0009014288,0.00028549889,0.0008948615,0.001502086,0.0010393977,0.0067826807],"category_scores_gemma":[0.0010642639,0.00038732693,0.0007023477,0.00081641244,0.00037989125,0.0013214105,0.0014222716,0.0008818141,0.0036297764],"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.00029464273,0.00015501413,0.00037813903,0.00009729721,0.00006196678,0.00008310994,0.000036972848,0.03257367,0.09440897,0.004688834,0.0038434172,0.86337805],"study_design_scores_gemma":[0.000020097417,0.0001723484,0.0015911327,0.000011950715,0.0000249369,0.0003287022,0.00002771997,0.9360874,0.052976202,0.0049485,0.003780638,0.000030322095],"about_ca_topic_score_codex":0.0025608721,"about_ca_topic_score_gemma":0.0030383538,"teacher_disagreement_score":0.0067826807,"about_ca_system_score_codex":0.00050350954,"about_ca_system_score_gemma":0.00076583464,"threshold_uncertainty_score":0.022690356},"labels":[],"label_agreement":null},{"id":"W1560125408","doi":"10.1007/3-540-45672-4_49","title":"Empirical Evaluation of Agile Processes","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; SAIT Polytechnic","funders":"","keywords":"Agile software development; Computer science; Waterfall; Waterfall model; Extreme programming practices; User story; Empirical research; Key (lock); Agile usability engineering; Extreme programming; Knowledge management; Software engineering; Process management; Software; Engineering management; Software development; Software development process; Engineering; Computer security","score_opus":0.06184688523139632,"score_gpt":0.32307070045003056,"score_spread":0.26122381521863425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560125408","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.98774326,0.00026861214,0.0026385295,0.00012878052,0.000018242888,0.00029925726,0.0001352519,0.000017858165,0.00875021],"genre_scores_gemma":[0.9963463,0.000120388766,0.0019670054,0.00003032454,0.000010913962,0.00027225094,0.00020321894,0.000010237896,0.001039435],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.95321095,0.033996727,0.002882583,0.0014357334,0.0073070363,0.0011668645],"domain_scores_gemma":[0.61923826,0.30055085,0.017531825,0.018359525,0.040226158,0.0040932894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038847335,0.0004680969,0.00035397086,0.0030426567,0.0011449896,0.0019290091,0.0013878385,0.0008204819,0.0040625446],"category_scores_gemma":[0.16759375,0.00043368587,0.00038060156,0.0028023806,0.0017531068,0.0030140223,0.0024379175,0.0013327834,0.0008744848],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00940829,0.023871997,0.4839859,0.0016081915,0.0004460096,0.00047349057,0.054387327,0.0048403475,0.006050957,0.022035372,0.004033192,0.38885897],"study_design_scores_gemma":[0.0016326776,0.03704563,0.8345048,0.0014444044,0.00067564234,0.0008542235,0.051047698,0.019155068,0.020649081,0.00924884,0.023534806,0.00020707714],"about_ca_topic_score_codex":0.0025642249,"about_ca_topic_score_gemma":0.002468381,"teacher_disagreement_score":0.038847335,"about_ca_system_score_codex":0.0023559052,"about_ca_system_score_gemma":0.0025562127,"threshold_uncertainty_score":0.20544684},"labels":[],"label_agreement":null},{"id":"W1560152839","doi":"10.1007/978-3-540-31832-3_10","title":"Structure and Algorithm for Implementing OpenMP Workshares","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"IBM (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Block (permutation group theory); Key (lock); Data structure; Parallel computing; Set (abstract data type); Queue; Control (management); Programming language; Operating system; Mathematics; Artificial intelligence","score_opus":0.02009921622608112,"score_gpt":0.2656745022839901,"score_spread":0.24557528605790896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560152839","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.0041619036,0.00004284845,0.9761313,0.0001046487,0.00009196877,0.00024695965,0.0003575378,0.01150111,0.0073616505],"genre_scores_gemma":[0.035169333,0.0000714005,0.9433986,0.00012592033,0.000061186576,0.00077411614,0.002042521,0.0026587276,0.015698165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991141,0.00011737888,0.00007989383,0.00013092712,0.00042708815,0.00013061035],"domain_scores_gemma":[0.9986626,0.0003422902,0.00007157765,0.00043510884,0.00040519531,0.00008322885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084400765,0.0009831777,0.0008694217,0.0012706696,0.0017959235,0.0025746822,0.0046976004,0.0012871131,0.0429446],"category_scores_gemma":[0.0035422088,0.0011368283,0.0009094757,0.001706252,0.0008621234,0.0022771475,0.0036069995,0.0022728625,0.016378364],"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.0008318432,0.00052105327,0.001751536,0.00045921747,0.00007704896,0.0003871176,0.0006920355,0.03514688,0.019519705,0.14813787,0.061822332,0.73065335],"study_design_scores_gemma":[0.0006393033,0.00045540323,0.0012185932,0.00013607847,0.00010781213,0.0005490897,0.0004405864,0.46612132,0.05923572,0.27511087,0.19582042,0.00016485309],"about_ca_topic_score_codex":0.00157599,"about_ca_topic_score_gemma":0.0021201689,"teacher_disagreement_score":0.0429446,"about_ca_system_score_codex":0.00068475,"about_ca_system_score_gemma":0.001290973,"threshold_uncertainty_score":0.14366406},"labels":[],"label_agreement":null},{"id":"W1560168699","doi":"10.1007/978-3-540-72530-5_57","title":"Image Pattern Recognition Using Near Sets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Classifier (UML); Edge detection; Computer vision; Feature vector; Feature extraction; Image (mathematics); Image processing","score_opus":0.05093454857302787,"score_gpt":0.27933958631774275,"score_spread":0.22840503774471488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560168699","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.007607736,0.00071915233,0.9885401,0.000055932192,0.000094638184,0.000030473966,0.00004482293,0.0004989348,0.0024082193],"genre_scores_gemma":[0.15666483,0.0015669261,0.83352,0.00010364896,0.00012641169,0.00012570336,0.00029133764,0.00011065905,0.0074903592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994624,0.00007745314,0.000047675283,0.00012689826,0.00026085225,0.000024781259],"domain_scores_gemma":[0.99957114,0.00013482316,0.000036516038,0.00011376073,0.0001229287,0.000020780966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005677284,0.00047946748,0.0013542713,0.0018392105,0.00036960127,0.0015065351,0.0008822603,0.00062042405,0.0028519225],"category_scores_gemma":[0.0016672474,0.0004195525,0.0010479535,0.0019237412,0.0006251038,0.0022010647,0.0010605252,0.0005997139,0.0015305694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014280029,0.000051069474,0.00037500646,0.00032776152,0.00008672732,0.000112375936,0.00009692291,0.03229095,0.039556917,0.040811908,0.0030683796,0.88307923],"study_design_scores_gemma":[0.000018606408,0.0001812674,0.0009795612,0.00007153588,0.00010051644,0.0005429632,0.000067333436,0.8528931,0.034186214,0.09501402,0.015893973,0.000050877687],"about_ca_topic_score_codex":0.00053978286,"about_ca_topic_score_gemma":0.00051188964,"teacher_disagreement_score":0.0028519225,"about_ca_system_score_codex":0.00035535966,"about_ca_system_score_gemma":0.00028796907,"threshold_uncertainty_score":0.009540677},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W1560238639","doi":"10.1007/11816171_12","title":"A Study of Product Development Time Based on Fuzzy Timed Workflow Net","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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 Ottawa","funders":"","keywords":"Computer science; Time constraint; Workflow; Task (project management); Fuzzy logic; Constraint (computer-aided design); Product (mathematics); New product development; Workflow management system; Tree (set theory); Process (computing); Development (topology); Data mining; Database; Artificial intelligence; Systems engineering; Operating system; Mathematics","score_opus":0.009718482997607933,"score_gpt":0.19858972876986034,"score_spread":0.1888712457722524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560238639","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.5099902,0.004101745,0.4712776,0.00036002722,0.00012900923,0.00005747397,0.000199649,0.00014105228,0.013743246],"genre_scores_gemma":[0.9707333,0.0009344191,0.026011074,0.00001702659,0.000042039337,0.0000169688,0.00007959509,0.000034696433,0.002130948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00018639037,0.000037140606,0.00014304997,0.000201642,0.000070087095],"domain_scores_gemma":[0.9914684,0.0073265317,0.00042369927,0.00017219699,0.00045364938,0.00015553438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015871215,0.00043356555,0.00046110476,0.0015924817,0.00044697596,0.0012346697,0.0011473551,0.0004491484,0.0020883626],"category_scores_gemma":[0.008124663,0.00032237163,0.00088688213,0.0023136672,0.0006087762,0.0022527496,0.00029272353,0.0006114516,0.000098656834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085378287,0.000160288,0.014470105,0.00039769086,0.00018860497,0.000855501,0.0006378261,0.6200481,0.008301991,0.28164387,0.0009740887,0.07146811],"study_design_scores_gemma":[0.000010814606,0.000086891465,0.00222209,0.000021524567,0.00006973161,0.00014219471,0.00009805901,0.97462726,0.0011943887,0.020600699,0.000908208,0.000018094554],"about_ca_topic_score_codex":0.0053200466,"about_ca_topic_score_gemma":0.0023469108,"teacher_disagreement_score":0.0053200466,"about_ca_system_score_codex":0.001606137,"about_ca_system_score_gemma":0.00076372665,"threshold_uncertainty_score":0.011653364},"labels":[],"label_agreement":null},{"id":"W1560259023","doi":"10.1007/978-3-642-04431-1_1","title":"Supraliminal Audio Steganography: Audio Files Tricking Audiophiles","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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 Calgary","funders":"","keywords":"Computer science; Steganography; Embedding; Cover (algebra); Channel (broadcasting); Object (grammar); Computer security; Theoretical computer science; Speech recognition; Computer network; Artificial intelligence; Engineering","score_opus":0.016386098960485818,"score_gpt":0.24646434849497145,"score_spread":0.23007824953448563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560259023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2149508,0.023063311,0.50573975,0.0018901482,0.0016443832,0.0001610728,0.00016033869,0.004198851,0.24819139],"genre_scores_gemma":[0.7470373,0.0072416863,0.08470815,0.0006350815,0.0004898589,0.00006562958,0.00012552107,0.00048558254,0.15921117],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998995,0.000013529081,0.000002810308,0.000021769241,0.000042950574,0.000019421606],"domain_scores_gemma":[0.99986815,0.000054559343,0.000011941036,0.00003093281,0.000021187632,0.00001314133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010510103,0.00047157516,0.00024159807,0.00027558714,0.0002337319,0.0006245617,0.00046146486,0.00063524576,0.00751292],"category_scores_gemma":[0.00034710896,0.00015539685,0.0001667879,0.00016396174,0.0005708005,0.0010096662,0.00069048716,0.00060844666,0.0024892823],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034132795,0.000086482156,0.00018193918,0.00041292416,0.000018619752,0.00045513717,0.00036962252,0.001402559,0.5671466,0.024378356,0.007092226,0.39811423],"study_design_scores_gemma":[0.00008080088,0.00066707534,0.0015637829,0.00017885065,0.00009826084,0.005927721,0.00038273394,0.036759883,0.7867438,0.028129848,0.13940878,0.00005837785],"about_ca_topic_score_codex":0.000101910395,"about_ca_topic_score_gemma":0.00021338218,"teacher_disagreement_score":0.00751292,"about_ca_system_score_codex":0.00015916424,"about_ca_system_score_gemma":0.000107372296,"threshold_uncertainty_score":0.025133252},"labels":[],"label_agreement":null},{"id":"W1560306350","doi":"10.1007/978-3-540-68125-0_44","title":"On Discrete Data Clustering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Automatic summarization; Robustness (evolution); Mixture model; Computer science; Cluster analysis; Dirichlet distribution; Data mining; Flexibility (engineering); Multinomial distribution; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.04302979265660046,"score_gpt":0.28263569571705777,"score_spread":0.23960590306045731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560306350","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.0018730349,0.0019236085,0.9898052,0.00050369476,0.00031335963,0.00004032062,0.0001463998,0.00035212722,0.005042268],"genre_scores_gemma":[0.11816101,0.0043546855,0.842281,0.00075768377,0.0010394022,0.000279944,0.0018801965,0.0006441752,0.030601913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974203,0.0007705639,0.00015901317,0.00061177963,0.00092694577,0.00011143039],"domain_scores_gemma":[0.996305,0.0015330439,0.000107186075,0.001449552,0.00050160143,0.00010369657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019480009,0.0011760304,0.0025088307,0.0027334848,0.0013905255,0.00251178,0.0028199165,0.0014724355,0.0073447484],"category_scores_gemma":[0.00773399,0.0009711134,0.0014503339,0.005990972,0.0024687804,0.003562323,0.0043075546,0.0032703127,0.0028888518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012348023,0.000073938674,0.00066509855,0.0003025778,0.00013651223,0.00006866499,0.00020964791,0.078900315,0.0020375533,0.44401658,0.025541257,0.4479244],"study_design_scores_gemma":[0.000014677833,0.000035899004,0.00046300897,0.000053137017,0.000028408795,0.00015347153,0.000070486465,0.3433484,0.0014727821,0.6250822,0.029254619,0.000022797783],"about_ca_topic_score_codex":0.0027239749,"about_ca_topic_score_gemma":0.002748052,"teacher_disagreement_score":0.0073447484,"about_ca_system_score_codex":0.0017612535,"about_ca_system_score_gemma":0.00091074436,"threshold_uncertainty_score":0.024570644},"labels":[],"label_agreement":null},{"id":"W1560461490","doi":"10.1007/978-3-642-13059-5_17","title":"Semi-supervised Probability Propagation on Instance-Attribute Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Discriminative model; Graph; Theoretical computer science; Nonparametric statistics; Artificial intelligence; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.024539000935987827,"score_gpt":0.24331539554980702,"score_spread":0.2187763946138192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560461490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010896548,0.00026013327,0.9859094,0.00024365861,0.000041943797,0.00009489899,0.0003959389,0.0012118989,0.00094558275],"genre_scores_gemma":[0.44015265,0.0008038959,0.54683435,0.0004180482,0.00040955326,0.00045476962,0.003906064,0.000629445,0.006391272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963683,0.0014085127,0.00021957078,0.0009627929,0.0008959073,0.0001448763],"domain_scores_gemma":[0.9773752,0.017182322,0.0009587561,0.0025745407,0.0016593514,0.0002498527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033046757,0.001171332,0.0016142435,0.003152239,0.00079126004,0.002124922,0.0038622462,0.0021806827,0.0023014892],"category_scores_gemma":[0.016623504,0.0012716085,0.0018454198,0.0033083274,0.001280482,0.005134026,0.0021506054,0.0027346236,0.0012276927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004768209,0.00046747792,0.003787659,0.0006081945,0.000538399,0.00038374227,0.0003182737,0.48058388,0.0069745244,0.039640866,0.014951447,0.45126876],"study_design_scores_gemma":[0.000010194395,0.000017737817,0.0003075341,0.000018697634,0.000030733958,0.00008081673,0.0000088739125,0.9659096,0.0013772362,0.031642597,0.000586323,0.0000097640595],"about_ca_topic_score_codex":0.0028820252,"about_ca_topic_score_gemma":0.0061473786,"teacher_disagreement_score":0.0038622462,"about_ca_system_score_codex":0.0010931961,"about_ca_system_score_gemma":0.0011139244,"threshold_uncertainty_score":0.017476976},"labels":[],"label_agreement":null},{"id":"W1560491838","doi":"10.1007/978-3-642-24500-8_5","title":"GrabApple: The Design of a Casual Exergame","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Health and mHealth Applications","field":"Health Professions","cited_by":60,"is_retracted":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":"Casual; Physical activity; Computer science; Simulation; Physical therapy; Psychology; Multimedia; Medicine","score_opus":0.08897619286389462,"score_gpt":0.3818352468949643,"score_spread":0.29285905403106965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560491838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056789253,0.0011172771,0.84960294,0.0004737335,0.00034204317,0.0017073274,0.0007819115,0.00873308,0.080452435],"genre_scores_gemma":[0.25350434,0.0011843693,0.59947616,0.00066026126,0.000059497765,0.0016657927,0.0014944385,0.0023526798,0.13960238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.000027571894,0.000008573749,0.0000424515,0.00009453606,0.000027193788],"domain_scores_gemma":[0.9999255,0.00001794262,0.0000035746907,0.000008665726,0.000020984693,0.000023345909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026279697,0.0009116013,0.00035552672,0.00036795877,0.00036031858,0.0010379505,0.0016620258,0.0008342818,0.02356038],"category_scores_gemma":[0.0005408878,0.0004623087,0.00038717684,0.00013807978,0.00030777272,0.0008743635,0.0018670148,0.00050639815,0.0051057762],"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.0010473987,0.00070551096,0.0016980242,0.0023331018,0.00010642723,0.00073809014,0.0023023156,0.011842375,0.1770829,0.018671526,0.04523809,0.7382342],"study_design_scores_gemma":[0.0004312508,0.0028149555,0.015486221,0.00091814535,0.00032786737,0.0040280637,0.0015411025,0.112433515,0.08437529,0.018862417,0.7584893,0.00029181546],"about_ca_topic_score_codex":0.00094012846,"about_ca_topic_score_gemma":0.0021294986,"teacher_disagreement_score":0.02356038,"about_ca_system_score_codex":0.00015081972,"about_ca_system_score_gemma":0.00047872803,"threshold_uncertainty_score":0.07881731},"labels":[],"label_agreement":null},{"id":"W1560541823","doi":"10.1007/978-3-540-24741-8_9","title":"LIMBO: Scalable Clustering of Categorical Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":260,"is_retracted":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":"Categorical variable; Cluster analysis; Computer science; Data mining; Tuple; Data stream clustering; Hierarchical clustering; Bottleneck; Scalability; Measure (data warehouse); CURE data clustering algorithm; Correlation clustering; Clustering high-dimensional data; Artificial intelligence; Machine learning; Database; Mathematics","score_opus":0.047484930229229186,"score_gpt":0.3097387021538155,"score_spread":0.2622537719245863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560541823","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.0049286853,0.00055552984,0.9234459,0.00026835297,0.0002638773,0.00029759482,0.005706437,0.060987864,0.003545901],"genre_scores_gemma":[0.030527797,0.0003678072,0.9360351,0.00023914345,0.000099734134,0.00060860824,0.02082241,0.0039336355,0.0073657925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983224,0.0003099332,0.00012155138,0.00027268898,0.00081742194,0.000155941],"domain_scores_gemma":[0.9978982,0.00044532676,0.00009649377,0.0009617906,0.00042930502,0.00016890652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014816469,0.0014468796,0.002048129,0.0032568611,0.001583504,0.002625802,0.004145035,0.0009237397,0.01694855],"category_scores_gemma":[0.006111883,0.0013795405,0.0023952527,0.006372483,0.000685823,0.0029283338,0.004924891,0.0021473833,0.011295347],"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.00068073923,0.00022011917,0.0014646152,0.0006858487,0.00025457703,0.00019312384,0.00023665233,0.022781406,0.010761541,0.015642282,0.24374706,0.70333195],"study_design_scores_gemma":[0.0004898231,0.0002014556,0.0028556162,0.00015214818,0.00018688219,0.0005725932,0.0002563499,0.7180532,0.018633453,0.14802624,0.11042363,0.0001486605],"about_ca_topic_score_codex":0.0073229,"about_ca_topic_score_gemma":0.0141377775,"teacher_disagreement_score":0.01694855,"about_ca_system_score_codex":0.001009359,"about_ca_system_score_gemma":0.002159623,"threshold_uncertainty_score":0.05669856},"labels":[],"label_agreement":null},{"id":"W1560603637","doi":"10.1007/978-3-540-45228-7_37","title":"Non-recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Association rule learning; Data mining; Tree (set theory); Tree structure; Dependency (UML); Process (computing); Data structure; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.0323483048558167,"score_gpt":0.27265920035138413,"score_spread":0.24031089549556744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560603637","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.06004988,0.00028046762,0.9299806,0.00025908163,0.00009171476,0.0005378673,0.0015704724,0.0053216354,0.0019082604],"genre_scores_gemma":[0.15630223,0.00012460299,0.8346214,0.00008568503,0.000047725298,0.00034578983,0.0061740275,0.0003486804,0.0019497852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987343,0.00026955202,0.00017005458,0.00023153464,0.00046629345,0.00012826348],"domain_scores_gemma":[0.99128485,0.005751005,0.0003184098,0.00089397543,0.0015908917,0.00016089954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011757403,0.0005065553,0.0011100041,0.0021483644,0.0006744813,0.0014725619,0.0021204029,0.00092439837,0.0049533085],"category_scores_gemma":[0.012726231,0.000594521,0.0014979687,0.002453448,0.00039656818,0.0019804868,0.0015339062,0.0011595048,0.003168796],"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.00067850674,0.00039094343,0.0068355356,0.0007093706,0.00015831104,0.0014390602,0.00074129825,0.020844681,0.031080974,0.016460888,0.013248106,0.90741235],"study_design_scores_gemma":[0.00020862202,0.0003978154,0.004583714,0.00018254947,0.00018269803,0.0027289472,0.0005572281,0.8765431,0.034249973,0.0664465,0.01383946,0.00007946018],"about_ca_topic_score_codex":0.0009071672,"about_ca_topic_score_gemma":0.002500513,"teacher_disagreement_score":0.0049533085,"about_ca_system_score_codex":0.00040832037,"about_ca_system_score_gemma":0.001020231,"threshold_uncertainty_score":0.016570449},"labels":[],"label_agreement":null},{"id":"W1560640562","doi":"10.1007/978-3-540-28633-2_41","title":"Using Evolutionary Learning of Behavior to Find Weaknesses in Operating Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Immune Systems Applications","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 Calgary","funders":"","keywords":"Computer science; Randomness; Strengths and weaknesses; Reboot; Hacker; Process (computing); Creativity; Software engineering; Software; Simple (philosophy); Computer security; Operating system","score_opus":0.026607517451610677,"score_gpt":0.265059100459082,"score_spread":0.23845158300747132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560640562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22105907,0.00030074062,0.77265775,0.00036889038,0.000057640576,0.00005919597,0.000035733032,0.0007159964,0.004744954],"genre_scores_gemma":[0.8189844,0.000099343306,0.17802523,0.00008613984,0.000019210225,0.000044396038,0.000052013937,0.00008446448,0.002604759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966586,0.000094328716,0.000024584268,0.00007096348,0.00010238933,0.000041886746],"domain_scores_gemma":[0.99745995,0.0017753566,0.00016012798,0.00018020989,0.00036263652,0.00006162555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264119,0.0005215617,0.0004508746,0.00079332263,0.00032794612,0.00073942036,0.0011664329,0.00092920294,0.0014199783],"category_scores_gemma":[0.0067782495,0.0004095735,0.00042623267,0.00045487084,0.0008281084,0.0017583652,0.0007533255,0.0010965155,0.00015146828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010717372,0.00019538152,0.01113527,0.00008442711,0.00011495618,0.000142742,0.0003022635,0.6406507,0.0081636645,0.013787502,0.0010242211,0.32429177],"study_design_scores_gemma":[0.000005288319,0.000025353884,0.00049142406,0.0000056394238,0.00001127937,0.000028635834,0.000019237605,0.99083275,0.0012660583,0.0071568093,0.00015321425,0.0000042907877],"about_ca_topic_score_codex":0.0017725722,"about_ca_topic_score_gemma":0.0021997008,"teacher_disagreement_score":0.0017725722,"about_ca_system_score_codex":0.0005100809,"about_ca_system_score_gemma":0.00040230283,"threshold_uncertainty_score":0.006685436},"labels":[],"label_agreement":null},{"id":"W1560658160","doi":"10.1007/978-3-540-75694-1_3","title":"Market-Based Hierarchical Resource Management Using Machine Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Toronto","funders":"","keywords":"Negotiation; Service provider; Service (business); Computer science; Virtualization; Revenue; Resource management (computing); Service delivery framework; Knowledge management; Resource (disambiguation); Resource allocation; Business; Process management; Cloud computing; Distributed computing; Marketing; Computer network","score_opus":0.024081711282399366,"score_gpt":0.2593539574834455,"score_spread":0.23527224620104611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560658160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030899182,0.00035974168,0.9592542,0.0003328095,0.00012543095,0.00014490906,0.0001361974,0.0018037967,0.0069436496],"genre_scores_gemma":[0.8438023,0.00016439306,0.14830202,0.00015778949,0.00009777136,0.00015634998,0.00018958299,0.00019732774,0.0069324896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892586,0.00030466833,0.000061794206,0.00022734457,0.00025020234,0.00023013524],"domain_scores_gemma":[0.9968532,0.0019963686,0.00022019297,0.00032392333,0.00040696468,0.00019937905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025399306,0.00066650065,0.0021819056,0.00096652634,0.0010347585,0.0019987929,0.0031926606,0.0012733618,0.00869052],"category_scores_gemma":[0.0053903423,0.0005988374,0.0007010919,0.001531065,0.0009692832,0.0032190704,0.0017160779,0.0013770361,0.0008920205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024447145,0.00027790465,0.00061827066,0.00008469351,0.00007166681,0.00009675864,0.00007088735,0.8338827,0.0022582158,0.036186263,0.0065425136,0.11966559],"study_design_scores_gemma":[0.000005844214,0.000008422372,0.000030965406,0.000001377316,0.00000316927,0.0000051334905,0.000004040894,0.99358433,0.00018425327,0.006037498,0.00013181582,0.0000031023264],"about_ca_topic_score_codex":0.006026326,"about_ca_topic_score_gemma":0.007320602,"teacher_disagreement_score":0.00869052,"about_ca_system_score_codex":0.0018431864,"about_ca_system_score_gemma":0.0018128201,"threshold_uncertainty_score":0.029072642},"labels":[],"label_agreement":null},{"id":"W1560677248","doi":"10.1007/978-3-642-15384-6_57","title":"Prognosis of Breast Cancer Using Genetic Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Breast cancer; Genetic programming; Computer science; Cancer; Lung cancer; Machine learning; Artificial intelligence; Medicine; Oncology; Internal medicine","score_opus":0.017524650858758692,"score_gpt":0.26155643782471866,"score_spread":0.24403178696595995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560677248","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.51112366,0.024736501,0.42575988,0.006514821,0.00062063267,0.00025132112,0.0027563637,0.0013611425,0.026875742],"genre_scores_gemma":[0.925993,0.0049099396,0.06166147,0.00017199639,0.000108368506,0.00007518683,0.0011397866,0.0000672434,0.005872958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983835,0.0000725615,0.000011994413,0.000020506475,0.000044513086,0.000012072438],"domain_scores_gemma":[0.99972814,0.00017754575,0.000032082753,0.00001651636,0.000035431185,0.00001026669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565381,0.0003313579,0.00041136332,0.00062225066,0.000089615394,0.0005377823,0.000420259,0.00040507247,0.00144771],"category_scores_gemma":[0.0024048875,0.00007519276,0.0004897756,0.0005723302,0.00012919263,0.00021594448,0.00017263145,0.0003544862,0.00035207425],"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.00073523074,0.00012179583,0.08912218,0.00018543808,0.00034813868,0.00071464665,0.00007963545,0.14569291,0.004315818,0.004246311,0.0074839527,0.74695396],"study_design_scores_gemma":[0.00014436601,0.0010767471,0.09886676,0.00043100677,0.00080760656,0.0055526025,0.00027328404,0.82275736,0.010922576,0.042567637,0.016512863,0.00008719435],"about_ca_topic_score_codex":0.0017511535,"about_ca_topic_score_gemma":0.0018196729,"teacher_disagreement_score":0.0017511535,"about_ca_system_score_codex":0.00036374643,"about_ca_system_score_gemma":0.00032272036,"threshold_uncertainty_score":0.004843056},"labels":[],"label_agreement":null},{"id":"W1560709708","doi":"10.1007/3-540-45153-6_4","title":"A Statistical Corpus-Based Term Extractor","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":107,"is_retracted":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":"Computer science; Perplexity; Extractor; Term (time); Natural language processing; Artificial intelligence; Lexicography; Language model; Linguistics","score_opus":0.016066060833879844,"score_gpt":0.27804188393684853,"score_spread":0.2619758231029687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560709708","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.010592877,0.0017740999,0.8878135,0.0003614252,0.00060139835,0.0006038201,0.021011546,0.07293578,0.0043055783],"genre_scores_gemma":[0.028672155,0.0009324369,0.9095166,0.00018206009,0.0003373313,0.0007560346,0.047115292,0.0024196394,0.010068475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983918,0.0002030962,0.0002278886,0.0004284651,0.00064835954,0.00010028231],"domain_scores_gemma":[0.9960024,0.0013742084,0.00022929873,0.0005838537,0.0016541108,0.00015615461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019924613,0.0017678958,0.0021032628,0.009937399,0.0012618888,0.0022138823,0.0020910546,0.0011740196,0.016856384],"category_scores_gemma":[0.006690515,0.0009914383,0.0017332103,0.009513778,0.00049372896,0.0033580528,0.0022505578,0.001983907,0.02526328],"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.0003968746,0.00014190705,0.0012922009,0.0006241666,0.00018291564,0.00022861293,0.00009974767,0.002513322,0.052097507,0.0030598403,0.057555854,0.881807],"study_design_scores_gemma":[0.00050145586,0.0007514829,0.011345171,0.00032604163,0.0010652127,0.002554473,0.0006176247,0.49368042,0.1835856,0.024592534,0.28051835,0.00046154222],"about_ca_topic_score_codex":0.005511184,"about_ca_topic_score_gemma":0.010467046,"teacher_disagreement_score":0.016856384,"about_ca_system_score_codex":0.00055817794,"about_ca_system_score_gemma":0.0031465418,"threshold_uncertainty_score":0.056390166},"labels":[],"label_agreement":null},{"id":"W1560728783","doi":"10.1007/978-3-642-15364-8_19","title":"A Disk-Based, Adaptive Approach to Memory-Limited Computation of Windowed Stream Joins","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Sliding window protocol; Window (computing); Data stream mining; Parallel computing; Data stream; Hash function; Partition (number theory); Auxiliary memory; Hard disk drive performance characteristics; Algorithm; Real-time computing; Distributed computing; Computer hardware; Data mining; Operating system","score_opus":0.020618991022628864,"score_gpt":0.2453739940352483,"score_spread":0.22475500301261941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560728783","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.018343067,0.00039044552,0.9785648,0.00008683014,0.0000811226,0.000052128427,0.00006169111,0.0011668332,0.0012529676],"genre_scores_gemma":[0.27089366,0.0004411538,0.7229147,0.00014176851,0.00025697707,0.00019404605,0.00025075805,0.00042955443,0.004477439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989666,0.00018674703,0.00008751639,0.00020443363,0.00044198407,0.00011279748],"domain_scores_gemma":[0.9973168,0.0012305654,0.00012723992,0.00076108857,0.0004084607,0.00015581705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010903858,0.0007311525,0.0012773782,0.00090547634,0.00085827155,0.0019167373,0.0037857974,0.00076533493,0.003982291],"category_scores_gemma":[0.0055424217,0.0006963156,0.000613965,0.0017217989,0.0007547914,0.003042956,0.002208455,0.0016290636,0.0008843914],"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.0022886414,0.00036509446,0.0022688126,0.00034427125,0.00017407745,0.00025977244,0.00065142324,0.26625317,0.07668928,0.07039358,0.011770711,0.56854117],"study_design_scores_gemma":[0.000037420592,0.00005894355,0.00013465357,0.000006953203,0.000017991773,0.00003361822,0.000027764501,0.9797538,0.00508265,0.013346371,0.0014879094,0.000011817559],"about_ca_topic_score_codex":0.002757474,"about_ca_topic_score_gemma":0.0043877535,"teacher_disagreement_score":0.003982291,"about_ca_system_score_codex":0.00074294704,"about_ca_system_score_gemma":0.001078829,"threshold_uncertainty_score":0.013322115},"labels":[],"label_agreement":null},{"id":"W1560744624","doi":"10.1007/978-3-642-13078-6_5","title":"Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 New Brunswick","funders":"","keywords":"Pedigree chart; Computer science; Algorithm; Recombination; Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Artificial intelligence; Genetics; Biology","score_opus":0.024338078797069902,"score_gpt":0.274277897785305,"score_spread":0.24993981898823509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560744624","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.016104724,0.0002385739,0.97383386,0.00034612435,0.00009797349,0.000301796,0.00052396994,0.0032385166,0.0053144596],"genre_scores_gemma":[0.09259618,0.00013429878,0.8970784,0.00015391133,0.000059748723,0.0006289909,0.0014258636,0.0007137887,0.0072088866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772054,0.00065071974,0.00015806755,0.0008330063,0.00034321522,0.00029435812],"domain_scores_gemma":[0.9919641,0.003428775,0.0002432409,0.003436661,0.000689035,0.00023819454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026694401,0.0014298455,0.0020710682,0.0017235769,0.0018931538,0.0025559731,0.007361925,0.0035457301,0.022812957],"category_scores_gemma":[0.012139509,0.001110863,0.0018722177,0.003292103,0.0015356599,0.0069790166,0.0039012877,0.0026624682,0.007708647],"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.0015158043,0.00063601416,0.0025798427,0.0005434849,0.0003374021,0.0003398289,0.0006830533,0.15213509,0.007285835,0.09531415,0.029461037,0.7091684],"study_design_scores_gemma":[0.0010139906,0.00019865776,0.0007410534,0.00009345418,0.00020819373,0.00055143674,0.00023748493,0.60380703,0.006201791,0.37146524,0.01535631,0.00012539205],"about_ca_topic_score_codex":0.0036946973,"about_ca_topic_score_gemma":0.005965334,"teacher_disagreement_score":0.022812957,"about_ca_system_score_codex":0.0019982308,"about_ca_system_score_gemma":0.0041568596,"threshold_uncertainty_score":0.07631695},"labels":[],"label_agreement":null},{"id":"W1560755324","doi":"10.1007/11569510_18","title":"Mobile Agents for Testing Web Services in Next Generation Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Web service; Interfacing; Service-oriented architecture; Architecture; Fault management; The Internet; World Wide Web; Engineering","score_opus":0.04071395318639771,"score_gpt":0.256408332396514,"score_spread":0.2156943792101163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560755324","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.15132685,0.005403216,0.76605964,0.0014866712,0.00071250834,0.0008768976,0.00055149023,0.008855199,0.06472758],"genre_scores_gemma":[0.5049219,0.0014259329,0.46123114,0.00026151465,0.00009255916,0.00051988964,0.000584954,0.0007531867,0.030208766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984585,0.00060100254,0.00006862441,0.000095265015,0.0006749454,0.00010151832],"domain_scores_gemma":[0.9976064,0.0015149895,0.00010550295,0.00035672047,0.00030667716,0.000109634384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257961,0.00072819437,0.000495979,0.0008553202,0.00050564954,0.0012461523,0.0017201016,0.0014220021,0.004738894],"category_scores_gemma":[0.004573845,0.00040605562,0.00030876315,0.0005052554,0.0005338381,0.0023166707,0.0008303346,0.0011147637,0.0010264257],"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.00080062175,0.0009172846,0.0048353206,0.00065649656,0.00014808106,0.00085281266,0.0009087291,0.094653,0.062481333,0.13412502,0.026700325,0.67292094],"study_design_scores_gemma":[0.00019078926,0.00058121746,0.0018818018,0.00023539834,0.00012126657,0.00080143736,0.00046920325,0.7442118,0.090296514,0.069246806,0.091879584,0.000084139996],"about_ca_topic_score_codex":0.0015818478,"about_ca_topic_score_gemma":0.0024045887,"teacher_disagreement_score":0.004738894,"about_ca_system_score_codex":0.00060284865,"about_ca_system_score_gemma":0.00045826854,"threshold_uncertainty_score":0.015853167},"labels":[],"label_agreement":null},{"id":"W1560789270","doi":"10.1007/978-3-540-85654-2_54","title":"Classifying Evolving Data Streams Using Dynamic Streaming Random Forests","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Streaming data; Concept drift; Data stream mining; Data stream; Data mining; Entropy (arrow of time); Class (philosophy); STREAMS; Random forest; Dynamic data; Artificial intelligence; Machine learning; Database","score_opus":0.047673854524984724,"score_gpt":0.29821004705387644,"score_spread":0.2505361925288917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560789270","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.122001834,0.0009279434,0.8721975,0.00021077416,0.00017727818,0.00020262049,0.00063722685,0.0026053945,0.0010394495],"genre_scores_gemma":[0.60909534,0.0006524932,0.38387096,0.000129471,0.0003033516,0.00016683122,0.0032533524,0.0002184095,0.0023097899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990578,0.00014932152,0.00009115838,0.00029698058,0.00029085117,0.00011395894],"domain_scores_gemma":[0.99747556,0.0014903707,0.00018040359,0.0002757137,0.00046449617,0.00011346508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134826,0.0009620397,0.0012742474,0.002893696,0.00048120483,0.0011910253,0.0015636969,0.0010007375,0.0009753393],"category_scores_gemma":[0.00372433,0.00046317367,0.0015825221,0.0020918925,0.00030758878,0.001969533,0.00060827995,0.0011641085,0.0006675607],"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.00038257072,0.00045066676,0.018363353,0.00013777762,0.0002067378,0.0003328689,0.00010828882,0.20595543,0.009013912,0.0022662221,0.004941077,0.75784105],"study_design_scores_gemma":[0.000006710119,0.000033256816,0.00074007676,0.0000065914937,0.000022402477,0.00008600763,0.000016753354,0.9951367,0.0012311562,0.0023447322,0.0003701851,0.0000054132784],"about_ca_topic_score_codex":0.0024717154,"about_ca_topic_score_gemma":0.0035194212,"teacher_disagreement_score":0.002893696,"about_ca_system_score_codex":0.00047523648,"about_ca_system_score_gemma":0.00048756402,"threshold_uncertainty_score":0.011290193},"labels":[],"label_agreement":null},{"id":"W1560891889","doi":"10.1007/3-540-45391-1_5","title":"Mobile Network Domain Agency for Managing Network Resources","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reservation; Computer network; Quality of service; Domain (mathematical analysis); Resource (disambiguation); Inter-domain; The Internet; Agency (philosophy); Distributed computing; World Wide Web","score_opus":0.00876589319801255,"score_gpt":0.2184261824410833,"score_spread":0.20966028924307076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560891889","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076310616,0.0075365775,0.27948797,0.0035126791,0.0017363528,0.00019841414,0.00031266676,0.0028120454,0.69677234],"genre_scores_gemma":[0.12142456,0.008017787,0.14227472,0.00080370554,0.0007029448,0.00021593258,0.0004541387,0.00034877335,0.72575736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983096,0.000029259294,0.0000071641944,0.00003416751,0.000070536655,0.000027902166],"domain_scores_gemma":[0.99979585,0.000034127854,0.00001555542,0.000040630533,0.00007730141,0.000036419446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000368372,0.000435083,0.00023062543,0.00086476153,0.00072112936,0.0019043076,0.0005971848,0.0008765295,0.015970659],"category_scores_gemma":[0.00066864945,0.00022234618,0.000185745,0.0010108617,0.0004360446,0.001998808,0.0008605214,0.00094148505,0.006744683],"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.000069509646,0.000053826625,0.00040995696,0.00012461685,0.000011702133,0.00017517731,0.0003123107,0.0027011037,0.0059017874,0.49977106,0.13384667,0.35662237],"study_design_scores_gemma":[0.000008942544,0.00003268795,0.00029539483,0.00004834395,0.000012879646,0.00034111345,0.000098006785,0.011169576,0.0020092768,0.015348782,0.9706232,0.000011751793],"about_ca_topic_score_codex":0.0023766896,"about_ca_topic_score_gemma":0.0044141137,"teacher_disagreement_score":0.015970659,"about_ca_system_score_codex":0.0009367406,"about_ca_system_score_gemma":0.0009710426,"threshold_uncertainty_score":0.05342716},"labels":[],"label_agreement":null},{"id":"W1560917027","doi":"10.1007/978-3-540-74960-8_7","title":"Learning Gene Regulatory Networks via Globally Regularized Risk Minimization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Computer science; Cluster analysis; Gene regulatory network; Exploit; Minification; Gene; Computational biology; Expression (computer science); Regulation of gene expression; Data mining; Machine learning; Artificial intelligence; Gene expression; Biology; Genetics","score_opus":0.006672609672264448,"score_gpt":0.21841664766811095,"score_spread":0.2117440379958465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560917027","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.006437222,0.000163872,0.992358,0.00014285144,0.00001636367,0.000016260068,0.000036291374,0.00041584962,0.00041311648],"genre_scores_gemma":[0.4578124,0.000540646,0.528663,0.00044585156,0.00020428999,0.00052883255,0.0008167093,0.00061481126,0.010373609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937963,0.00025481818,0.000025418214,0.00020234605,0.00009579697,0.000042023374],"domain_scores_gemma":[0.9973279,0.0020988027,0.00013442313,0.00019646162,0.00017796185,0.00006437414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017886703,0.0012517197,0.0018706208,0.00062334706,0.00031327998,0.0009163351,0.0018607449,0.0017231044,0.0023440688],"category_scores_gemma":[0.005197025,0.0009938731,0.0011455008,0.00064922904,0.0015103711,0.0015580041,0.0019211685,0.002341092,0.00069296523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062554274,0.000033985725,0.00030922247,0.00005670117,0.000060981103,0.000039406463,0.000035261295,0.9373244,0.0014528739,0.011935212,0.0014512287,0.047238253],"study_design_scores_gemma":[0.0000054619813,0.00001274924,0.000024701616,0.0000022506192,0.000004534131,0.000007184263,0.0000019053546,0.98865116,0.00023048176,0.010948474,0.000108602886,0.0000025039492],"about_ca_topic_score_codex":0.002556012,"about_ca_topic_score_gemma":0.0026777352,"teacher_disagreement_score":0.002556012,"about_ca_system_score_codex":0.0008998454,"about_ca_system_score_gemma":0.0008401149,"threshold_uncertainty_score":0.009459555},"labels":[],"label_agreement":null},{"id":"W1561051430","doi":"10.1007/11599289_14","title":"Adaptive Path Finding for Moving Objects","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Path (computing); Computer vision; Artificial intelligence; Computer graphics (images); Programming language","score_opus":0.02642836210097145,"score_gpt":0.2506438747937748,"score_spread":0.22421551269280338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561051430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051914826,0.00053199194,0.9919551,0.00003869185,0.000051372404,0.000015462056,0.000026753743,0.0005069767,0.0016822763],"genre_scores_gemma":[0.1043752,0.0012101829,0.88309056,0.000039154023,0.000058556372,0.00007599614,0.00024575644,0.00020610077,0.01069861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997987,0.000019837124,0.000007740354,0.000053336822,0.00010212479,0.00001822704],"domain_scores_gemma":[0.9996706,0.00017017491,0.000022267468,0.00005661291,0.00006738445,0.000012927959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023128848,0.0006557148,0.00059593766,0.0009242852,0.00038819673,0.00045617044,0.0019094034,0.0008794969,0.003137777],"category_scores_gemma":[0.0014925885,0.0004980464,0.00044240398,0.0014752313,0.00047336446,0.0011644801,0.0010814231,0.0010399568,0.00081171206],"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.00011018593,0.000043551645,0.00041661414,0.0002520125,0.00005124698,0.00014954634,0.00017680858,0.21251386,0.027108448,0.03709782,0.007822919,0.71425694],"study_design_scores_gemma":[0.000017096125,0.000047586982,0.0003320571,0.000017581899,0.000023353308,0.00023205772,0.000029940293,0.95007896,0.0068178736,0.034756094,0.0076252357,0.000022123715],"about_ca_topic_score_codex":0.0031957305,"about_ca_topic_score_gemma":0.0029472527,"teacher_disagreement_score":0.0031957305,"about_ca_system_score_codex":0.00035269893,"about_ca_system_score_gemma":0.00037206497,"threshold_uncertainty_score":0.010496855},"labels":[],"label_agreement":null},{"id":"W1561051808","doi":"10.1007/978-3-642-10871-6_27","title":"SHARE: A Semantic Web Query Engine for Bioinformatics","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Paul's Hospital; University of British Columbia","funders":"","keywords":"SPARQL; Computer science; RDF; Semantic Web; World Wide Web; Scripting language; Workflow; Information retrieval; Web service; Pipeline (software); Linked data; Database; Programming language","score_opus":0.01929409123835608,"score_gpt":0.2444637696803717,"score_spread":0.22516967844201563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561051808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006908932,0.0015435586,0.7024519,0.0011697686,0.00023647658,0.00045312903,0.02466204,0.25517422,0.0073999646],"genre_scores_gemma":[0.09467878,0.0031008478,0.6921281,0.0040447176,0.0003360723,0.0016246329,0.12837584,0.056057252,0.019653795],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984073,0.00028674284,0.00019547266,0.00024557195,0.0007545077,0.00011046048],"domain_scores_gemma":[0.99832124,0.00082699425,0.00010173687,0.000371962,0.0002370993,0.00014092836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029741868,0.001844458,0.0018489371,0.0028722219,0.000936289,0.003034025,0.0030667884,0.001729911,0.013357411],"category_scores_gemma":[0.0056214062,0.0013436845,0.0016549283,0.0030053928,0.0011040006,0.006241156,0.004529857,0.0016839964,0.0093939835],"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.00254722,0.000312663,0.0041974755,0.003310245,0.0008933976,0.0009509025,0.0013857629,0.015087232,0.053403955,0.072918415,0.5479822,0.29701048],"study_design_scores_gemma":[0.0011732791,0.0002723099,0.003555603,0.00045618336,0.0007327102,0.0018371623,0.0005932109,0.1609191,0.07164319,0.17978829,0.578628,0.00040089307],"about_ca_topic_score_codex":0.0035826305,"about_ca_topic_score_gemma":0.0050080456,"teacher_disagreement_score":0.013357411,"about_ca_system_score_codex":0.00094833213,"about_ca_system_score_gemma":0.0014846108,"threshold_uncertainty_score":0.044684947},"labels":[],"label_agreement":null},{"id":"W1561228940","doi":"10.1007/978-3-540-24847-7_30","title":"Algorithmic Aspects of Cubic Function Fields","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Extension (predicate logic); Computer science; Signature (topology); Function (biology); Perspective (graphical); Field (mathematics); Finite field; Theoretical computer science; Key (lock); Function field; Algorithm; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics; Artificial intelligence; Programming language; Geometry","score_opus":0.019447846055928787,"score_gpt":0.2538558146163479,"score_spread":0.2344079685604191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561228940","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06396771,0.01612321,0.14432448,0.0054882234,0.000730832,0.00007367744,0.00046329128,0.00029890402,0.76852965],"genre_scores_gemma":[0.7060997,0.01674852,0.10938791,0.0008532833,0.0017704249,0.00013594287,0.0011204812,0.0002483994,0.16363542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996476,0.00006814455,0.000012595392,0.000041083393,0.00017950925,0.000051009003],"domain_scores_gemma":[0.9995085,0.0002541307,0.000028854412,0.000078537945,0.00009982918,0.000030132851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039171174,0.0004897086,0.0004269085,0.0012868005,0.0012878556,0.0031934376,0.0009562287,0.0006125082,0.0076567205],"category_scores_gemma":[0.001686228,0.00038482164,0.00040770893,0.0025704303,0.002644559,0.004115924,0.0009773127,0.0029210043,0.0010102931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005020559,0.0000062490262,0.00006557314,0.00003096614,0.0000012725111,0.000012316328,0.000086396634,0.00085561804,0.00011306082,0.98497343,0.0028704267,0.010979645],"study_design_scores_gemma":[0.0000033161266,0.0000025009438,0.00013953622,0.000015946247,0.000001945229,0.00004803864,0.00004205048,0.0019949307,0.00009899914,0.97259766,0.025051482,0.0000036598133],"about_ca_topic_score_codex":0.0038195509,"about_ca_topic_score_gemma":0.004435064,"teacher_disagreement_score":0.0076567205,"about_ca_system_score_codex":0.0020182042,"about_ca_system_score_gemma":0.0010230376,"threshold_uncertainty_score":0.025614262},"labels":[],"label_agreement":null},{"id":"W1561229603","doi":"10.1007/11564751_30","title":"Maximum Constraint Satisfaction on Diamonds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Computer science; Constraint satisfaction dual problem; Lattice (music); Constraint satisfaction; Domain (mathematical analysis); Mathematical optimization; Combinatorics; Mathematics; Local consistency; Artificial intelligence; Geometry","score_opus":0.020528245553279045,"score_gpt":0.2781065930185123,"score_spread":0.2575783474652333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561229603","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.06128198,0.0015408453,0.78859586,0.0017911162,0.00030940087,0.0001999823,0.0017545754,0.0005982217,0.14392804],"genre_scores_gemma":[0.4583171,0.0017736858,0.48027307,0.0005713163,0.00023492613,0.00038741817,0.0034284126,0.0005045865,0.054509547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989415,0.00033212098,0.00006630716,0.00015268162,0.0003928901,0.00011459539],"domain_scores_gemma":[0.99741864,0.001761561,0.00011890678,0.00022755316,0.00035643403,0.00011689195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260796,0.0006709951,0.0011392187,0.0009843596,0.0010415834,0.0017843838,0.0017510651,0.0008764284,0.012442602],"category_scores_gemma":[0.0048770765,0.00091457355,0.0009882108,0.00302813,0.0010441168,0.0027389314,0.0020362525,0.0026470704,0.0011221953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001240224,0.000059256174,0.0002546061,0.0006388892,0.000036498248,0.00012847285,0.0003209072,0.030433293,0.0037386573,0.84597886,0.02034495,0.097941555],"study_design_scores_gemma":[0.000040135445,0.000021726613,0.00013044996,0.000053952856,0.000009161725,0.0000682162,0.00008319549,0.04468253,0.0011633557,0.9409331,0.012801753,0.000012385745],"about_ca_topic_score_codex":0.0026171608,"about_ca_topic_score_gemma":0.00389167,"teacher_disagreement_score":0.012442602,"about_ca_system_score_codex":0.00089448143,"about_ca_system_score_gemma":0.0007846611,"threshold_uncertainty_score":0.041624606},"labels":[],"label_agreement":null},{"id":"W1561252389","doi":"10.1007/11424918_8","title":"A Decision Theoretic Meta-reasoner for Constraint Optimization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Saskatchewan","funders":"","keywords":"Semantic reasoner; Computer science; Solver; Mathematical optimization; Constraint (computer-aided design); Quality (philosophy); Mathematics; Artificial intelligence; Programming language","score_opus":0.020380474342966415,"score_gpt":0.25497678958834696,"score_spread":0.23459631524538055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561252389","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.000549322,0.00011451256,0.9945629,0.0001191309,0.000030058538,0.000060504997,0.00021410029,0.0027283041,0.0016211391],"genre_scores_gemma":[0.009140021,0.00012371408,0.98816234,0.000131554,0.000024957526,0.00011548964,0.0004426237,0.00034256422,0.0015167954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823135,0.00040251357,0.00020839536,0.00030531865,0.00075893244,0.0000934967],"domain_scores_gemma":[0.99864036,0.000748753,0.00006196619,0.0003360692,0.00016417503,0.000048628077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022833343,0.0012066207,0.0013243165,0.0013410802,0.00071458454,0.0026714965,0.003884589,0.0014102559,0.010503528],"category_scores_gemma":[0.0037237036,0.0014729601,0.0036697865,0.001435433,0.0012785541,0.003241428,0.0024625068,0.004731806,0.003859171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025174196,0.0002754454,0.0005116683,0.0008819774,0.0002902387,0.00026054808,0.00030574985,0.11418663,0.008301423,0.3211941,0.027993187,0.52554727],"study_design_scores_gemma":[0.00012738044,0.00005850044,0.00016886998,0.00016255626,0.00015445275,0.00019683964,0.000042086973,0.57728213,0.008327509,0.35514426,0.058284532,0.0000508601],"about_ca_topic_score_codex":0.0023655929,"about_ca_topic_score_gemma":0.004870966,"teacher_disagreement_score":0.010503528,"about_ca_system_score_codex":0.00085462205,"about_ca_system_score_gemma":0.0016017077,"threshold_uncertainty_score":0.035137832},"labels":[],"label_agreement":null},{"id":"W1561255266","doi":"10.1007/978-3-540-28633-2_13","title":"An Hierarchical Terrain Representation for Approximately Shortest Paths","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Terrain; Preprocessor; Shortest path problem; Representation (politics); Logarithm; Algorithm; Line segment; Grid; Path (computing); Line (geometry); Graph; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03130798972528696,"score_gpt":0.29764935541929666,"score_spread":0.2663413656940097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561255266","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.0047652335,0.0001854944,0.9907747,0.000046408288,0.000023437187,0.00003867036,0.0006746313,0.0016237199,0.0018677026],"genre_scores_gemma":[0.15335274,0.0005490737,0.8389132,0.000059973052,0.000031729993,0.00019139267,0.0032765449,0.00043382955,0.0031915137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973434,0.00003514434,0.000018281638,0.000053583917,0.00012298887,0.00003568767],"domain_scores_gemma":[0.9997868,0.0000704219,0.000016994692,0.000058718117,0.00005386253,0.000013207325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021746955,0.00069426745,0.0009532234,0.00137018,0.00041772454,0.0011628767,0.0017770665,0.0007611187,0.0062894966],"category_scores_gemma":[0.0012185785,0.0005977659,0.00090163783,0.0026106117,0.00033453075,0.0019550603,0.0011981084,0.0011533437,0.0014178711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016481137,0.00007695539,0.00040845433,0.0002474855,0.000039426755,0.000106526066,0.00015078318,0.5496064,0.008043607,0.06249407,0.012919571,0.36574188],"study_design_scores_gemma":[0.000011802669,0.000012801868,0.00009204976,0.000011629274,0.000009546267,0.00002452462,0.000018205765,0.9784259,0.0007391756,0.017445404,0.0032008702,0.00000799067],"about_ca_topic_score_codex":0.014162343,"about_ca_topic_score_gemma":0.018441034,"teacher_disagreement_score":0.014162343,"about_ca_system_score_codex":0.0006939119,"about_ca_system_score_gemma":0.00069366954,"threshold_uncertainty_score":0.028159797},"labels":[],"label_agreement":null},{"id":"W1561259622","doi":"10.1007/11871842_62","title":"Right of Inference: Nearest Rectangle Learning Revisited","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rectangle; Inference; Benchmark (surveying); Class (philosophy); Artificial intelligence; Computer science; Machine learning; Pattern recognition (psychology); Decision tree; Mathematics; Geography; Cartography; Geometry","score_opus":0.013525339371429823,"score_gpt":0.2584907581373493,"score_spread":0.24496541876591946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561259622","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.004967457,0.0029638868,0.95993096,0.009920542,0.0008862238,0.000028654944,0.00016866454,0.0005356705,0.020597996],"genre_scores_gemma":[0.41350487,0.0058420138,0.53280616,0.006265005,0.0061626537,0.00021101494,0.00090411026,0.001528725,0.032775454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890652,0.0058235475,0.00041008994,0.0022165542,0.0020535681,0.00043102764],"domain_scores_gemma":[0.94349027,0.04227739,0.0012803009,0.008654353,0.0035428589,0.0007547672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018658908,0.0012496766,0.0036080317,0.0022049765,0.0027966988,0.0057697827,0.0068348288,0.0052785063,0.019420115],"category_scores_gemma":[0.097934045,0.0017511544,0.0018848348,0.0032509982,0.008830754,0.019457081,0.0065529747,0.012951493,0.004167113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022772966,0.000044509485,0.00074072235,0.0001731209,0.00006664826,0.000121791476,0.000326866,0.011845626,0.00032875454,0.8478426,0.017313495,0.12096815],"study_design_scores_gemma":[0.000026946649,0.000015346082,0.0001259808,0.00004362792,0.000015156826,0.00007044886,0.000053020052,0.057112407,0.00035499924,0.9374681,0.004695015,0.000018970406],"about_ca_topic_score_codex":0.0069625857,"about_ca_topic_score_gemma":0.005337813,"teacher_disagreement_score":0.019420115,"about_ca_system_score_codex":0.0017502233,"about_ca_system_score_gemma":0.002162074,"threshold_uncertainty_score":0.09867889},"labels":[],"label_agreement":null},{"id":"W1561354838","doi":"10.1007/978-3-642-02713-0_33","title":"Impact of Gaze Analysis on the Design of a Caption Production Software","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Task (project management); Workload; Gaze; Software; Process (computing); Eye tracking; Human–computer interaction; Production (economics); Artificial intelligence; Computer vision; Programming language","score_opus":0.026873953807412136,"score_gpt":0.2654193647077874,"score_spread":0.23854541090037523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561354838","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.5409588,0.0015176584,0.41505417,0.0007780061,0.00033320588,0.00071379147,0.00064617704,0.018249035,0.021749096],"genre_scores_gemma":[0.8973274,0.00027976395,0.09478868,0.00011290836,0.00004621697,0.000099653545,0.00033640084,0.0015339482,0.005475008],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983354,0.00061744166,0.00008018652,0.00027930198,0.0005728074,0.00011484501],"domain_scores_gemma":[0.9860195,0.01085283,0.00046835424,0.00059253705,0.001878496,0.0001882699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016437257,0.0010417501,0.00046156778,0.0011506496,0.00058730727,0.0016268834,0.0008001049,0.00091991597,0.010493794],"category_scores_gemma":[0.018183405,0.00061248423,0.0006363941,0.00034975455,0.00026797727,0.0017882753,0.000780883,0.00091218116,0.0014882832],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029233033,0.0003568843,0.006614076,0.0005642544,0.00014530873,0.00042088117,0.0014094373,0.03385916,0.4249548,0.0012129606,0.0042997324,0.52323925],"study_design_scores_gemma":[0.000209773,0.0026060415,0.032505546,0.00020358225,0.0007926208,0.00060082803,0.00097548345,0.55408716,0.39347902,0.0018699556,0.012477694,0.00019234439],"about_ca_topic_score_codex":0.008608322,"about_ca_topic_score_gemma":0.0074827266,"teacher_disagreement_score":0.010493794,"about_ca_system_score_codex":0.00095465704,"about_ca_system_score_gemma":0.0008046278,"threshold_uncertainty_score":0.03510523},"labels":[],"label_agreement":null},{"id":"W1561364077","doi":"10.1007/978-3-540-30480-7_70","title":"A Graphical XQuery Language Using Nested Windows","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"XQuery; Computer science; Programming language; World Wide Web; XML; XML database","score_opus":0.016472987807269614,"score_gpt":0.2572567745422869,"score_spread":0.2407837867350173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561364077","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.0021861834,0.00017522021,0.9129628,0.00019573119,0.00012660395,0.00019204721,0.0011799785,0.07566825,0.0073131695],"genre_scores_gemma":[0.06356012,0.0011181573,0.76123655,0.0009844524,0.00022662623,0.0011492567,0.01094734,0.10147491,0.059302572],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812716,0.0002844815,0.00028757888,0.0003402777,0.0007688876,0.00019159241],"domain_scores_gemma":[0.9980538,0.001079287,0.000096781456,0.0003408454,0.00030711503,0.00012231196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020157152,0.002026608,0.0015559884,0.0010559784,0.00095249846,0.0039412472,0.003647534,0.0016248649,0.039810713],"category_scores_gemma":[0.004243805,0.002223277,0.0018934447,0.0013546248,0.0015756643,0.0053163012,0.0032127043,0.0035564022,0.018417459],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014730265,0.00026925406,0.0011053875,0.0020241633,0.00016633583,0.0010467699,0.0028909342,0.0067358282,0.077364236,0.24701469,0.23110878,0.42880055],"study_design_scores_gemma":[0.0006607729,0.00026975013,0.00058380194,0.00057372573,0.0002436714,0.0015402298,0.00035119246,0.072045535,0.09791572,0.11241416,0.71308345,0.0003179775],"about_ca_topic_score_codex":0.0022970953,"about_ca_topic_score_gemma":0.001978496,"teacher_disagreement_score":0.039810713,"about_ca_system_score_codex":0.0006556876,"about_ca_system_score_gemma":0.0010245529,"threshold_uncertainty_score":0.13318014},"labels":[],"label_agreement":null},{"id":"W1561524127","doi":"10.1007/3-540-44983-3_3","title":"Cryptanalysis of the “Augmented Family of Cryptographic Parity Circuits” Proposed at ISW’97","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer science; Cryptanalysis; Parity (physics); Theoretical computer science; Computer network; Computer security; Physics; Atomic physics","score_opus":0.02339848208814529,"score_gpt":0.2542922281309676,"score_spread":0.23089374604282228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561524127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23245935,0.0015528672,0.7025688,0.0030669488,0.0008793163,0.00023266046,0.00034009953,0.0011285198,0.05777134],"genre_scores_gemma":[0.8919153,0.0004581889,0.095177576,0.0004717889,0.00018554658,0.00009242822,0.00024755675,0.00008893738,0.01136266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998858,0.00048788806,0.00004565069,0.00014147327,0.0003210563,0.00014608804],"domain_scores_gemma":[0.9989849,0.00035228572,0.00006893372,0.00037459406,0.0001650601,0.000054171804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015407732,0.00056581234,0.0005734114,0.00058448274,0.0007055431,0.0015533919,0.0010344185,0.00091707706,0.0038445573],"category_scores_gemma":[0.00272112,0.00035444496,0.0007859325,0.0006441621,0.0014477748,0.002370926,0.0019610603,0.0017208871,0.0005985273],"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.0012147358,0.000077328215,0.0009797878,0.00015126765,0.0000975172,0.00034425716,0.00020666435,0.022842277,0.021062018,0.81828016,0.009557234,0.12518673],"study_design_scores_gemma":[0.00023473092,0.0004989992,0.00086527073,0.00010254742,0.00013166547,0.0012541431,0.000074214615,0.32624638,0.06120767,0.57526755,0.03401219,0.000104630635],"about_ca_topic_score_codex":0.00027078285,"about_ca_topic_score_gemma":0.00029713917,"teacher_disagreement_score":0.0038445573,"about_ca_system_score_codex":0.0007645011,"about_ca_system_score_gemma":0.00083751563,"threshold_uncertainty_score":0.012861311},"labels":[],"label_agreement":null},{"id":"W1561564981","doi":"10.1007/978-3-540-70583-3_57","title":"Password Mistyping in Two-Factor-Authenticated Key Exchange","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Authenticated Key Exchange; Password; Credential; Computer security; Key exchange; Authentication (law); Biometrics; Cryptography; Theoretical computer science; Public-key cryptography; Encryption","score_opus":0.029712305033010908,"score_gpt":0.26410673256722145,"score_spread":0.23439442753421053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561564981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025679996,0.00071493536,0.9604462,0.0004579714,0.0002513048,0.00014164776,0.00005692131,0.0015138517,0.010737161],"genre_scores_gemma":[0.68348306,0.0009026825,0.29624188,0.0001968582,0.00015781957,0.00017381208,0.00019007977,0.00038588714,0.018267902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945747,0.0018281296,0.00048827432,0.00074018183,0.0015108135,0.0008578872],"domain_scores_gemma":[0.99507785,0.0023586461,0.00020013665,0.0019682378,0.00030572162,0.000089447945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003001184,0.00088974554,0.0014406445,0.00072929275,0.0012254308,0.0025619282,0.0018184823,0.0031152363,0.005945791],"category_scores_gemma":[0.0099039115,0.000877947,0.0009686074,0.0013711922,0.0028072244,0.0077853487,0.004650594,0.0031346898,0.0032773067],"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.0013953794,0.00019660078,0.0007588926,0.00035755805,0.000042760992,0.001016763,0.0010648023,0.022349177,0.013271944,0.5996661,0.010434674,0.34944537],"study_design_scores_gemma":[0.00014608214,0.00021120314,0.00034125507,0.00011520923,0.00004710926,0.0016508809,0.00015912874,0.2957587,0.029245503,0.6544854,0.017716069,0.00012344832],"about_ca_topic_score_codex":0.00051170104,"about_ca_topic_score_gemma":0.0004507328,"teacher_disagreement_score":0.005945791,"about_ca_system_score_codex":0.0010104505,"about_ca_system_score_gemma":0.00088228256,"threshold_uncertainty_score":0.019890666},"labels":[],"label_agreement":null},{"id":"W1561620206","doi":"10.1007/978-3-642-13059-5_19","title":"Automatic Parameter Settings for the PROAFTN Classifier Using Hybrid Particle Swarm Optimization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Computer science; Metaheuristic; Classifier (UML); Artificial intelligence; Machine learning; Mathematical optimization; Data mining; Mathematics","score_opus":0.03951532335552556,"score_gpt":0.2955625530182069,"score_spread":0.25604722966268134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561620206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018186495,0.0005024247,0.9733459,0.00024257449,0.00023560034,0.00019619809,0.00013989935,0.0032063697,0.0039445227],"genre_scores_gemma":[0.28806555,0.0002718339,0.7046282,0.00029764115,0.000111796224,0.0004790052,0.00069971493,0.0007145101,0.0047317594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930143,0.0001396243,0.000061168605,0.00018822149,0.00022997029,0.00007967253],"domain_scores_gemma":[0.9988298,0.00046413293,0.00008644397,0.00012575963,0.0004533398,0.00004062605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021029485,0.0013562049,0.0015050382,0.0011924119,0.00094019104,0.002218506,0.0017825884,0.002103312,0.0046726414],"category_scores_gemma":[0.006465073,0.00074849324,0.00064044085,0.0007720285,0.00042982286,0.0018273375,0.0012269077,0.002244354,0.0027322748],"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.00038088328,0.00015752304,0.0014533261,0.00015140467,0.000057101908,0.000074137475,0.000091707996,0.1415279,0.01295955,0.0034544119,0.010140401,0.82955176],"study_design_scores_gemma":[0.000021337579,0.000024975654,0.00028637119,0.000018536271,0.000011939268,0.000028366838,0.00001602844,0.9927598,0.0039164834,0.0014817581,0.0014254728,0.000008939387],"about_ca_topic_score_codex":0.00414814,"about_ca_topic_score_gemma":0.005203354,"teacher_disagreement_score":0.0046726414,"about_ca_system_score_codex":0.0009588201,"about_ca_system_score_gemma":0.0012417944,"threshold_uncertainty_score":0.015631557},"labels":[],"label_agreement":null},{"id":"W1561631292","doi":"10.1007/bfb0019426","title":"Upward drawings to fit surfaces","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Piecewise linear function; Construct (python library); Mathematics; Piecewise; Geometry; Computer science; Mathematical analysis","score_opus":0.020190934232303445,"score_gpt":0.2590255466711827,"score_spread":0.23883461243887927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561631292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011251285,0.00071585854,0.9059884,0.00022582528,0.0003755045,0.00012586608,0.0003947085,0.0059687574,0.07495375],"genre_scores_gemma":[0.14311804,0.0017494974,0.7388786,0.00025758753,0.00015088421,0.00020909398,0.0016443826,0.0051144636,0.108877406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999501,0.000060439794,0.000020691392,0.00007452862,0.0002955963,0.00004767817],"domain_scores_gemma":[0.9994529,0.00014354615,0.00002648546,0.00022175667,0.00012074904,0.000034671706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026955135,0.0014849704,0.0007325075,0.0012168469,0.0006503695,0.001608988,0.0014048999,0.0011295144,0.05795723],"category_scores_gemma":[0.0017609047,0.0009896802,0.00097543537,0.0011323905,0.0006131898,0.0016741818,0.0024101003,0.002771444,0.015533005],"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.00009216251,0.00010614316,0.00034611832,0.0004143982,0.000036095968,0.00025933946,0.00045775005,0.026661858,0.0413328,0.1940565,0.04702119,0.6892156],"study_design_scores_gemma":[0.00007290131,0.00022038049,0.00071398955,0.00025589098,0.00009147737,0.0016946128,0.00037104596,0.21643911,0.06716697,0.20466998,0.50821596,0.00008765528],"about_ca_topic_score_codex":0.0008699002,"about_ca_topic_score_gemma":0.0018118514,"teacher_disagreement_score":0.05795723,"about_ca_system_score_codex":0.00036883377,"about_ca_system_score_gemma":0.00024113116,"threshold_uncertainty_score":0.19388628},"labels":[],"label_agreement":null},{"id":"W1561697759","doi":"10.1007/978-3-642-12139-5_11","title":"Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Heuristics; Greedy algorithm; Computer science; Vertex (graph theory); Matching (statistics); Algorithm; Similarity (geometry); Similarity measure; Exploit; Combinatorics; Graph; Mathematics; Mathematical optimization; Theoretical computer science; Artificial intelligence","score_opus":0.017381246323120266,"score_gpt":0.24699092596909517,"score_spread":0.2296096796459749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561697759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013357901,0.0004146497,0.98020566,0.000116224575,0.0001453582,0.00011913018,0.00014054995,0.0025635944,0.002936851],"genre_scores_gemma":[0.08563712,0.00020315437,0.9084787,0.00013391518,0.00008675163,0.00018239579,0.0005776858,0.00055618904,0.0041441377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977204,0.00062997866,0.00013800655,0.0003715223,0.0009672759,0.000172781],"domain_scores_gemma":[0.9962031,0.0014579671,0.00017358073,0.0011547679,0.0009206832,0.00008977715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540625,0.00095337006,0.0019940492,0.00341832,0.0012924493,0.0020650122,0.0031827984,0.0022294172,0.011571978],"category_scores_gemma":[0.009677489,0.00065519725,0.0011646692,0.006161982,0.0008181152,0.0042698095,0.0021022472,0.0013336481,0.0041477266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005349739,0.00032795448,0.0008174171,0.00023025885,0.00011010075,0.000069905254,0.000112980655,0.09734602,0.010706944,0.031421177,0.01166385,0.84665847],"study_design_scores_gemma":[0.000063667554,0.00013085392,0.00023041679,0.000019036652,0.00003900149,0.00016719385,0.00005643258,0.955079,0.008488601,0.03003213,0.005670391,0.000023154584],"about_ca_topic_score_codex":0.0035384023,"about_ca_topic_score_gemma":0.0044462853,"teacher_disagreement_score":0.011571978,"about_ca_system_score_codex":0.001163557,"about_ca_system_score_gemma":0.0015611672,"threshold_uncertainty_score":0.038712084},"labels":[],"label_agreement":null},{"id":"W156176094","doi":"10.1007/978-3-642-25486-4_24","title":"Inverse Kinematics Solution of a Class of Hybrid Manipulators","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kinematics; Inverse kinematics; Computer science; Serial manipulator; Inverse; Kinematic chain; Parallel manipulator; Manipulator (device); Forward kinematics; Degrees of freedom (physics and chemistry); Class (philosophy); Control theory (sociology); Control engineering; Artificial intelligence; Mathematics; Robot; Geometry; Engineering; Classical mechanics; Physics","score_opus":0.019404732936198096,"score_gpt":0.20318754155004343,"score_spread":0.18378280861384533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156176094","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.039255884,0.00042802427,0.9498051,0.00008954421,0.000050998184,0.000025794145,0.000038039703,0.00018463423,0.010121932],"genre_scores_gemma":[0.75458914,0.0007304767,0.21650608,0.00005799965,0.00009343637,0.00014429746,0.00019747553,0.00008041372,0.027600678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999,0.0000193185,0.000004280586,0.00002278717,0.000042649084,0.000010973391],"domain_scores_gemma":[0.9999014,0.000046178797,0.000012531175,0.0000131652,0.00002031593,0.0000064222545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997539,0.00048250234,0.00055001705,0.000246941,0.00028318889,0.0006451879,0.00053123897,0.00078129204,0.002796287],"category_scores_gemma":[0.0003974415,0.00028392667,0.0004478385,0.0002397241,0.00036652177,0.00047468138,0.00056576595,0.00062049803,0.00043666377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018043797,0.00011523892,0.00065466296,0.00033608716,0.00009768325,0.0004290906,0.00038070703,0.55802494,0.051839918,0.1589994,0.0034384355,0.22550344],"study_design_scores_gemma":[0.0000309364,0.00012455674,0.00047104858,0.000015591295,0.000015585421,0.00026944184,0.00006431713,0.95672643,0.0027474198,0.034669954,0.0048485408,0.000016124275],"about_ca_topic_score_codex":0.0005522304,"about_ca_topic_score_gemma":0.0006866905,"teacher_disagreement_score":0.002796287,"about_ca_system_score_codex":0.00013760896,"about_ca_system_score_gemma":0.0001942663,"threshold_uncertainty_score":0.009354532},"labels":[],"label_agreement":null},{"id":"W1561788061","doi":"10.1007/3-540-36456-0_25","title":"Automatic Sense Disambiguation of the Near-Synonyms in a Dictionary Entry","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Toronto","funders":"","keywords":"WordNet; Computer science; Natural language processing; Artificial intelligence; Word-sense disambiguation; Information retrieval","score_opus":0.009501691656527785,"score_gpt":0.24101613695380883,"score_spread":0.23151444529728105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561788061","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.38631043,0.016825363,0.5122096,0.0026906887,0.006130012,0.0009630228,0.02850136,0.015913118,0.030456388],"genre_scores_gemma":[0.40718132,0.0037344364,0.5437044,0.0006618622,0.00054911297,0.00021433592,0.033860736,0.0019560964,0.008137676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972625,0.00045969448,0.0006184851,0.0007557972,0.000751977,0.00015167358],"domain_scores_gemma":[0.9934875,0.0028489362,0.0006822426,0.00066790124,0.0019491415,0.00036418575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014618308,0.0014182789,0.001992376,0.0105204955,0.0022418438,0.004066187,0.0014603045,0.0016513254,0.006823438],"category_scores_gemma":[0.008673685,0.0009431703,0.0013519382,0.008533072,0.000981242,0.00568169,0.0041430886,0.0017048481,0.005191961],"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.0019385337,0.00050972146,0.020975634,0.004466492,0.0005543993,0.009238262,0.006383492,0.0028204864,0.17553543,0.038522817,0.08685992,0.6521948],"study_design_scores_gemma":[0.00056945,0.0009342155,0.043818284,0.0024568497,0.0018935137,0.026893517,0.015919164,0.10402392,0.19270499,0.13427685,0.4756446,0.00086469314],"about_ca_topic_score_codex":0.002536158,"about_ca_topic_score_gemma":0.0063407356,"teacher_disagreement_score":0.0105204955,"about_ca_system_score_codex":0.00071088475,"about_ca_system_score_gemma":0.0024251437,"threshold_uncertainty_score":0.022826731},"labels":[],"label_agreement":null},{"id":"W1561803476","doi":"10.1007/11415770_26","title":"A Hidden Markov Model Based Scoring Function for Mass Spectrometry Database Search","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of General Medical Sciences; National Institutes of Health; Canadian Institute for Theoretical Astrophysics","keywords":"Hidden Markov model; Computer science; Tandem mass spectrometry; Database search engine; Mascot; Function (biology); Markov chain; Identification (biology); Pattern recognition (psychology); Mass spectrometry; Artificial intelligence; Search engine; Machine learning; Chemistry; Information retrieval; Chromatography","score_opus":0.025235097463041357,"score_gpt":0.2860759256920249,"score_spread":0.2608408282289835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561803476","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.0053898464,0.0002750681,0.98656255,0.00011198412,0.000062476734,0.00009719621,0.0005217568,0.006420149,0.0005590832],"genre_scores_gemma":[0.078226455,0.00030689314,0.91303754,0.00020747833,0.000067362394,0.00032156083,0.0030335044,0.0008366401,0.003962507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981224,0.0006396355,0.00015994335,0.00022274314,0.0007385013,0.00011672258],"domain_scores_gemma":[0.9963373,0.002076611,0.00017103963,0.0004915498,0.0008119441,0.00011162192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039458377,0.001229527,0.002186655,0.0017583527,0.00095861097,0.0015016062,0.0033447568,0.0019839006,0.0058162306],"category_scores_gemma":[0.008275702,0.00078636507,0.0015658304,0.0026151564,0.00049338577,0.0021687474,0.0018772038,0.0016957129,0.004892683],"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.00083534635,0.00058531057,0.0021937615,0.00038729582,0.0003813288,0.00026181687,0.00009468725,0.13150312,0.018508855,0.015415363,0.032554757,0.79727834],"study_design_scores_gemma":[0.00004528907,0.00006593639,0.00050773186,0.000016189564,0.000048343663,0.00012983514,0.000014611608,0.9745883,0.005145472,0.01720594,0.0021933806,0.00003903644],"about_ca_topic_score_codex":0.004595198,"about_ca_topic_score_gemma":0.006416923,"teacher_disagreement_score":0.0058162306,"about_ca_system_score_codex":0.0009238938,"about_ca_system_score_gemma":0.0018356862,"threshold_uncertainty_score":0.020867884},"labels":[],"label_agreement":null},{"id":"W1561859406","doi":"10.1007/978-3-540-27836-8_96","title":"Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Toronto","funders":"","keywords":"PSPACE; Equivalence (formal languages); True quantified Boolean formula; Mathematics; Discrete mathematics; Two-element Boolean algebra; Boolean expression; Characterization (materials science); Boolean circuit; Boolean function; Algebra over a field; Computational complexity theory; Algorithm; Pure mathematics","score_opus":0.021019765403745044,"score_gpt":0.24657812451281902,"score_spread":0.22555835910907399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561859406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016678626,0.0043865913,0.9031752,0.0044794953,0.00041129038,0.00007853254,0.00030981764,0.0007633695,0.06971702],"genre_scores_gemma":[0.51339245,0.006358547,0.44465637,0.00176684,0.0010058692,0.00021949499,0.0016453273,0.0004462185,0.030508978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741083,0.0008708813,0.00019586172,0.00040467296,0.00087721634,0.00024053753],"domain_scores_gemma":[0.9954294,0.0036919978,0.00016274059,0.0003574769,0.00025560628,0.00010284212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024091501,0.0010556037,0.00093986647,0.0013626375,0.0011681942,0.005161824,0.002659578,0.0016850422,0.009276252],"category_scores_gemma":[0.009345691,0.0009773732,0.0017615712,0.0026150942,0.0035859651,0.011869233,0.0027186791,0.005116935,0.0012283155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006634527,0.000053321004,0.00017215186,0.00031397934,0.000041179785,0.0001246866,0.00029716452,0.008970316,0.0008982728,0.9338908,0.006811502,0.048360296],"study_design_scores_gemma":[0.00001861514,0.0000097283255,0.000050529918,0.00006629135,0.000023141167,0.00006857587,0.00006488214,0.017387984,0.0012882224,0.97512937,0.0058841533,0.00000839495],"about_ca_topic_score_codex":0.0016756506,"about_ca_topic_score_gemma":0.001979402,"teacher_disagreement_score":0.009276252,"about_ca_system_score_codex":0.0020160165,"about_ca_system_score_gemma":0.0010015554,"threshold_uncertainty_score":0.031032145},"labels":[],"label_agreement":null},{"id":"W1561886765","doi":"10.1007/978-3-540-30076-2_22","title":"Novel Clustering Approach that Employs Genetic Algorithm with New Representation Scheme and Multiple Objectives","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cluster analysis; Partition (number theory); Scheme (mathematics); Encoding (memory); Algorithm; Graph partition; Graph; Set (abstract data type); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.03641534816727335,"score_gpt":0.2810127521842175,"score_spread":0.24459740401694416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561886765","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.0087873135,0.00021303612,0.987665,0.00008741735,0.000136,0.000047929767,0.000038635702,0.00053470413,0.002490026],"genre_scores_gemma":[0.09956707,0.00019230963,0.89397854,0.00010360742,0.00007088534,0.00014495237,0.00021686447,0.00012028898,0.0056055197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.00009348009,0.00003025904,0.00017400109,0.00031820397,0.00005194874],"domain_scores_gemma":[0.9996755,0.00004817812,0.000029593777,0.000045140787,0.00017640683,0.00002520116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005374034,0.0008373927,0.0012451108,0.0014739921,0.00096322654,0.0009932054,0.0020465895,0.0014514896,0.0013086507],"category_scores_gemma":[0.0007096535,0.00039289743,0.0010731422,0.0021490024,0.00037836708,0.0009734283,0.0009264577,0.00080944074,0.0005169991],"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.00014610619,0.00033897828,0.0014430432,0.00024617746,0.0003201617,0.00022063017,0.00018352439,0.33811224,0.06638648,0.032047376,0.008879343,0.55167603],"study_design_scores_gemma":[0.000023356448,0.00006539773,0.00051014055,0.000009482207,0.00005274899,0.00018700141,0.00003125751,0.98266184,0.0076265293,0.0045952364,0.004198275,0.00003877393],"about_ca_topic_score_codex":0.004681225,"about_ca_topic_score_gemma":0.005676563,"teacher_disagreement_score":0.004681225,"about_ca_system_score_codex":0.0007951894,"about_ca_system_score_gemma":0.0010868354,"threshold_uncertainty_score":0.009307981},"labels":[],"label_agreement":null},{"id":"W1561982800","doi":"10.1007/978-3-642-40104-6_10","title":"On the Stretch Factor of the Theta-4 Graph","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Graph; Path graph; Wheel graph; Euclidean geometry; Bounded function; Distance; Computer science; Mathematics; Discrete mathematics; Graph power; Line graph; Shortest path problem; Geometry; Mathematical analysis","score_opus":0.020635952046383035,"score_gpt":0.2295789757623995,"score_spread":0.20894302371601647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561982800","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.49112445,0.0054539978,0.20194559,0.0042420058,0.0012406631,0.0001249157,0.0006717687,0.00097549136,0.294221],"genre_scores_gemma":[0.90037245,0.003782196,0.03458129,0.00076579826,0.00088832545,0.0001255703,0.0005646341,0.0009564321,0.057963368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.000075720214,0.000013109651,0.00008195392,0.00012511422,0.00007125857],"domain_scores_gemma":[0.9987979,0.0006179422,0.00014658138,0.00016768945,0.000120981145,0.000148909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814626,0.0008776986,0.00070653384,0.0016723736,0.0009905343,0.0014407542,0.0010280953,0.00086499675,0.018366508],"category_scores_gemma":[0.0035169171,0.0004717474,0.0006400284,0.0016019592,0.0020786093,0.003154993,0.001446717,0.0027490621,0.002092652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002603665,0.000053297248,0.0008420619,0.00019087225,0.000021255713,0.0001567236,0.00038085307,0.013317472,0.0048325052,0.9126704,0.008675532,0.05859868],"study_design_scores_gemma":[0.000032852044,0.000055994286,0.000733329,0.00004460381,0.000021266982,0.00015620729,0.00013989705,0.019403836,0.00128843,0.9677826,0.010319228,0.000021777669],"about_ca_topic_score_codex":0.0023446153,"about_ca_topic_score_gemma":0.0022840241,"teacher_disagreement_score":0.018366508,"about_ca_system_score_codex":0.0012027732,"about_ca_system_score_gemma":0.0004609731,"threshold_uncertainty_score":0.061442137},"labels":[],"label_agreement":null},{"id":"W1561988317","doi":"10.1007/11764298_13","title":"Faster Adaptive Set Intersections for Text Searching","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":74,"is_retracted":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":"Intersection (aeronautics); Computer science; Binary search algorithm; Set (abstract data type); Context (archaeology); Task (project management); Binary number; Search algorithm; Interpolation (computer graphics); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Arithmetic; Programming language","score_opus":0.02964560611851291,"score_gpt":0.27309941166129553,"score_spread":0.24345380554278262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561988317","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.057758782,0.002868926,0.8953728,0.00041644037,0.00067177287,0.00046608408,0.0016374061,0.025553899,0.0152539],"genre_scores_gemma":[0.13285825,0.0005506891,0.8465598,0.00016662461,0.00023898437,0.00036230308,0.0028723346,0.0017348912,0.014656159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708945,0.00042004936,0.00023336921,0.0005050001,0.0014991632,0.00025295533],"domain_scores_gemma":[0.99449867,0.0027296725,0.00019645509,0.0014588148,0.0009348647,0.00018152533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940942,0.0014291689,0.003037903,0.0041416707,0.0017184877,0.0024726747,0.0038159383,0.0015127374,0.03846127],"category_scores_gemma":[0.007385764,0.0009734858,0.001259732,0.0073169162,0.0009362534,0.0059198793,0.004312773,0.002015442,0.008882645],"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.0011814565,0.0002632176,0.00063925755,0.00039255645,0.000068292895,0.000087924025,0.000275643,0.013443124,0.017783673,0.024801828,0.028269066,0.91279393],"study_design_scores_gemma":[0.00040715016,0.00078536995,0.0012440118,0.00015693952,0.0001645076,0.00075759285,0.0005404292,0.76402974,0.07147676,0.10336283,0.056931186,0.00014356355],"about_ca_topic_score_codex":0.0038291623,"about_ca_topic_score_gemma":0.0063252016,"teacher_disagreement_score":0.03846127,"about_ca_system_score_codex":0.0011210701,"about_ca_system_score_gemma":0.0013873264,"threshold_uncertainty_score":0.12866575},"labels":[],"label_agreement":null},{"id":"W1562018356","doi":"10.1007/978-3-540-30539-2_36","title":"Strong Conditional Oblivious Transfer and Computing on Intervals","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":130,"is_retracted":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":"Oblivious transfer; Predicate (mathematical logic); Computer science; Generalization; Simple (philosophy); Theoretical computer science; Modular design; Modular construction; Transfer (computing); Algorithm; Discrete mathematics; Mathematics; Cryptography; Programming language; Parallel computing","score_opus":0.017407361961557514,"score_gpt":0.2486044370477504,"score_spread":0.2311970750861929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562018356","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.093389384,0.0013370363,0.8303856,0.0013524725,0.00026905644,0.000083658546,0.00026426365,0.0010053434,0.0719131],"genre_scores_gemma":[0.8935573,0.0009927419,0.075256184,0.0002677055,0.00040635178,0.00019796885,0.00025554042,0.000327468,0.028738653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876106,0.00029076592,0.00006606028,0.0002133687,0.0004249993,0.00024363914],"domain_scores_gemma":[0.9963566,0.002133902,0.00017639571,0.0009924847,0.00020402341,0.00013659772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010150872,0.0005691498,0.001085435,0.00090561516,0.0012125785,0.0026480188,0.0015080753,0.00072168215,0.0073152403],"category_scores_gemma":[0.0049479553,0.00045736475,0.0009282446,0.0023239332,0.0029890295,0.0075121806,0.002754714,0.0037675502,0.0011695576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006007701,0.000011950161,0.000045397403,0.000033989447,0.0000046803534,0.00001902483,0.000085354004,0.0029659006,0.00056228606,0.9846267,0.0009435932,0.010641073],"study_design_scores_gemma":[0.000011535098,0.000018816805,0.000054675515,0.000009924198,0.0000075337484,0.000030579937,0.00001374775,0.013354373,0.0010685617,0.9833836,0.002039378,0.0000073054493],"about_ca_topic_score_codex":0.0004357801,"about_ca_topic_score_gemma":0.00024805975,"teacher_disagreement_score":0.0073152403,"about_ca_system_score_codex":0.001529564,"about_ca_system_score_gemma":0.0007425075,"threshold_uncertainty_score":0.024471939},"labels":[],"label_agreement":null},{"id":"W1562085846","doi":"10.1007/978-3-540-88682-2_35","title":"ASN: Image Keypoint Detection from Adaptive Shape Neighborhood","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Université Laval","funders":"","keywords":"Detector; Position (finance); Artificial intelligence; Computer vision; Image (mathematics); Change detection; Stability (learning theory); Computer science; Pattern recognition (psychology); Mathematics","score_opus":0.017761036977667448,"score_gpt":0.248715569613341,"score_spread":0.23095453263567353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562085846","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.010942529,0.00087616354,0.9795024,0.0000668654,0.00026238448,0.000095039606,0.00031937688,0.0050932416,0.0028421627],"genre_scores_gemma":[0.12410142,0.0012023725,0.8551012,0.00012356474,0.00018675077,0.00013083252,0.0017847697,0.0007170757,0.016651915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996152,0.00003455664,0.00001587122,0.00007238111,0.00023504478,0.000026957281],"domain_scores_gemma":[0.99964154,0.000059619626,0.000018634439,0.00010953207,0.00014466867,0.000026043452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041519266,0.0007663198,0.0010573812,0.001154698,0.00029364036,0.00071490876,0.0014562287,0.0006374795,0.0046239467],"category_scores_gemma":[0.0012041974,0.00027127643,0.0004893258,0.0014747974,0.00034905106,0.0012085664,0.0011090476,0.0005929685,0.0033095477],"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.0003923405,0.00005438606,0.0004609639,0.00016436925,0.000034951576,0.00010153166,0.0000412402,0.011200024,0.054722875,0.0068503623,0.012575591,0.91340137],"study_design_scores_gemma":[0.000064609856,0.00022485599,0.002220839,0.000037006837,0.000081704195,0.00083655916,0.000049889124,0.8396842,0.09729792,0.018494882,0.040967364,0.00004015342],"about_ca_topic_score_codex":0.0032053678,"about_ca_topic_score_gemma":0.0037606999,"teacher_disagreement_score":0.0046239467,"about_ca_system_score_codex":0.00036022617,"about_ca_system_score_gemma":0.00052799756,"threshold_uncertainty_score":0.015468657},"labels":[],"label_agreement":null},{"id":"W1562161535","doi":"10.1007/978-3-540-74788-8_15","title":"Degradation in Spatial Knowledge Acquisition When Using Automatic Navigation Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":155,"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":"Degradation (telecommunications); Computer science; Telecommunications","score_opus":0.028474233482514953,"score_gpt":0.2657090372264151,"score_spread":0.23723480374390013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562161535","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.9915622,0.00024669516,0.0051652477,0.00012805812,0.000021671827,0.000025477173,0.00014532836,0.00015501876,0.0025504888],"genre_scores_gemma":[0.99640036,0.000075790274,0.002331274,0.00003031693,0.00000630083,0.000011321687,0.00022908846,0.000032886128,0.0008827174],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985556,0.00025209936,0.00018796803,0.0002434332,0.0005756508,0.0001852465],"domain_scores_gemma":[0.97231096,0.01786566,0.0020235102,0.0035808121,0.003404358,0.0008147233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016490074,0.00030268036,0.0004901591,0.0006477562,0.0003154778,0.0013546757,0.00043217724,0.00086396176,0.0041124066],"category_scores_gemma":[0.041917328,0.0003634426,0.00027929508,0.0007491605,0.0005881265,0.0020582755,0.0008741249,0.0008944878,0.0005842987],"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.007930896,0.0013243572,0.2089548,0.0009698606,0.00032895227,0.0015684855,0.0052380543,0.03780304,0.2201025,0.0040049106,0.0037376469,0.5080365],"study_design_scores_gemma":[0.00016176555,0.002817058,0.6708525,0.0001708953,0.00038041366,0.0031009293,0.0040711765,0.19971736,0.09554567,0.017997082,0.005057093,0.00012802104],"about_ca_topic_score_codex":0.0061743148,"about_ca_topic_score_gemma":0.004002437,"teacher_disagreement_score":0.0061743148,"about_ca_system_score_codex":0.0006202698,"about_ca_system_score_gemma":0.00080614234,"threshold_uncertainty_score":0.013757348},"labels":[],"label_agreement":null},{"id":"W1562252382","doi":"10.1007/11795490_19","title":"Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":40,"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; Concordia University; Carleton University; Natural Sciences and Engineering Research Council of Canada; University of Ottawa","funders":"","keywords":"Combinatorics; Computer science; Graph factorization; Spanner; Bounded function; Distance-hereditary graph; Graph; Vertex (graph theory); Unit disk graph; Discrete mathematics; Mathematics; Line graph; Graph power","score_opus":0.018312498157106685,"score_gpt":0.24878007551033507,"score_spread":0.23046757735322837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562252382","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.18801045,0.00020032673,0.801929,0.0002938312,0.00007045898,0.00013174447,0.00039851564,0.0008873872,0.008078189],"genre_scores_gemma":[0.75918126,0.00018540426,0.2321814,0.00018056491,0.00013258397,0.00018160384,0.0011873053,0.00052384794,0.006246051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993661,0.00017404187,0.000025695965,0.00017302441,0.00018356627,0.00007758185],"domain_scores_gemma":[0.99721056,0.0014347517,0.00019261535,0.00039331094,0.00034123837,0.0004274479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093619135,0.0007790539,0.0012139498,0.002234745,0.000761726,0.0014085727,0.0018531124,0.0014590223,0.0079764705],"category_scores_gemma":[0.006727188,0.00043212864,0.0006711582,0.001345392,0.0021064458,0.003398858,0.003163837,0.0017927089,0.0012053112],"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.0022804542,0.00039017986,0.0076439534,0.00080926984,0.00014507625,0.001130664,0.001027869,0.09664226,0.101537086,0.46443868,0.011332743,0.31262177],"study_design_scores_gemma":[0.00009535008,0.0006203522,0.0023268112,0.000060670023,0.000055133845,0.00048426696,0.00045955562,0.6668144,0.023805173,0.30057633,0.0046328814,0.00006912327],"about_ca_topic_score_codex":0.0005415458,"about_ca_topic_score_gemma":0.00055196596,"teacher_disagreement_score":0.0079764705,"about_ca_system_score_codex":0.00048666252,"about_ca_system_score_gemma":0.00052223227,"threshold_uncertainty_score":0.026683986},"labels":[],"label_agreement":null},{"id":"W1562306439","doi":"10.1007/978-3-540-72952-5_3","title":"Verifying Distributed, Event-Based Middleware Applications Using Domain-Specific Software Model Checking","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Queen's University","funders":"","keywords":"Computer science; Middleware (distributed applications); Java; Event (particle physics); Distributed computing; Pipeline (software); Software engineering; Domain (mathematical analysis); Programming language","score_opus":0.042282162621130624,"score_gpt":0.27899353478229455,"score_spread":0.23671137216116392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562306439","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.050186206,0.00008785796,0.9441656,0.00008857947,0.000035352354,0.00007161737,0.000077324454,0.0040129116,0.0012745741],"genre_scores_gemma":[0.81374764,0.00016592772,0.18346077,0.000084117346,0.000025470237,0.000117979704,0.00031119015,0.00055972254,0.0015270424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945614,0.001799521,0.00040543376,0.0006816686,0.0020398363,0.0005120927],"domain_scores_gemma":[0.988559,0.0058136326,0.0009341933,0.0036063187,0.00096294825,0.00012404697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003937045,0.001301845,0.001260685,0.0008420018,0.0007619301,0.0019004344,0.0034046327,0.0015055478,0.0015216505],"category_scores_gemma":[0.01413884,0.0012974056,0.0026352622,0.00081757165,0.0020515097,0.003244583,0.0022186073,0.0020734014,0.0003720343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038744786,0.00020153355,0.0026706269,0.0003535206,0.00021665418,0.00033916734,0.00025413668,0.8563829,0.043901734,0.0483452,0.0011051882,0.045841865],"study_design_scores_gemma":[0.00005971282,0.000074231706,0.00022358753,0.000017977201,0.00005689643,0.000098991135,0.00002468094,0.94348097,0.03425311,0.020805163,0.00088953215,0.000015252107],"about_ca_topic_score_codex":0.0039875633,"about_ca_topic_score_gemma":0.004193989,"teacher_disagreement_score":0.0039875633,"about_ca_system_score_codex":0.0012663829,"about_ca_system_score_gemma":0.0026278857,"threshold_uncertainty_score":0.020821393},"labels":[],"label_agreement":null},{"id":"W1562372552","doi":"10.1007/978-3-642-04244-7_43","title":"Efficient Generic Search Heuristics within the EMBP Framework","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Computer science; Constraint satisfaction problem; Consistency (knowledge bases); Local consistency; Constraint satisfaction; Theoretical computer science; Constraint (computer-aided design); Domain (mathematical analysis); Maximization; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.0179897506217118,"score_gpt":0.251340114659847,"score_spread":0.23335036403813522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562372552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055269366,0.00042002648,0.98449785,0.00013609162,0.00004993875,0.00010964383,0.00019788,0.0015901031,0.0074714147],"genre_scores_gemma":[0.071678184,0.00031166393,0.9236391,0.00011457267,0.000046341807,0.0001952405,0.00051222334,0.00047797657,0.0030246926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.0004314007,0.00007480794,0.00017893847,0.00032280362,0.00022439226],"domain_scores_gemma":[0.9985636,0.0007532633,0.000068578374,0.0004107414,0.00015332938,0.000050492887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015378109,0.0011982642,0.002128346,0.0012368666,0.0008387135,0.0019414314,0.0034171802,0.0021291878,0.011184853],"category_scores_gemma":[0.005299356,0.00091792893,0.0017240668,0.003174481,0.0010097486,0.0029625387,0.0031344348,0.0024437238,0.002438233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020267119,0.00015200519,0.00034717174,0.0004966285,0.000074240554,0.00016434498,0.00011492726,0.46935156,0.0024647915,0.18828788,0.014773453,0.3235703],"study_design_scores_gemma":[0.00006658238,0.000038611226,0.00011252814,0.00003919518,0.000034479297,0.000075628624,0.000032119733,0.88189185,0.0011500983,0.108885825,0.007655741,0.000017331758],"about_ca_topic_score_codex":0.0031555595,"about_ca_topic_score_gemma":0.0059676194,"teacher_disagreement_score":0.011184853,"about_ca_system_score_codex":0.0013084025,"about_ca_system_score_gemma":0.0017545987,"threshold_uncertainty_score":0.037416995},"labels":[],"label_agreement":null},{"id":"W1562414633","doi":"10.1007/978-3-540-30073-1_12","title":"A Classifier-Based Approach to User-Role Assignment for Web Applications","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Role-based access control; Classifier (UML); Graph; Access control; Theoretical computer science; Artificial intelligence; Human–computer interaction; Machine learning; Computer security","score_opus":0.027855699868208312,"score_gpt":0.2875634546303065,"score_spread":0.25970775476209823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562414633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077333217,0.00016007402,0.98864913,0.00029239923,0.000075590106,0.00014764383,0.000171064,0.0014326879,0.0013380847],"genre_scores_gemma":[0.23833871,0.00025051818,0.7519748,0.00021712757,0.00017802745,0.00035152838,0.00075375097,0.0002953536,0.0076401257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968611,0.0008777829,0.0002027444,0.00059384864,0.0012145515,0.0002500512],"domain_scores_gemma":[0.9954405,0.00223952,0.00020181584,0.00051687326,0.0013971973,0.00020413152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029514788,0.0006892965,0.001468791,0.0019271299,0.001932498,0.0026766479,0.0037593942,0.0020525956,0.005448058],"category_scores_gemma":[0.010924177,0.00061913044,0.0012553481,0.0016196187,0.0008367036,0.004462021,0.0014689176,0.0029395488,0.0020637116],"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.00040008486,0.00081437087,0.0046487646,0.00019681123,0.00014530688,0.0003004664,0.00058366626,0.09727623,0.012337551,0.054646023,0.023786318,0.80486447],"study_design_scores_gemma":[0.000008634314,0.000026319323,0.00031236096,0.000009101355,0.000015583768,0.00005910164,0.00004633736,0.9758387,0.0019377748,0.019932708,0.0018005001,0.000012922921],"about_ca_topic_score_codex":0.012574702,"about_ca_topic_score_gemma":0.02110375,"teacher_disagreement_score":0.012574702,"about_ca_system_score_codex":0.0019032266,"about_ca_system_score_gemma":0.002258337,"threshold_uncertainty_score":0.025003016},"labels":[],"label_agreement":null},{"id":"W1562418542","doi":"10.1007/11564096_20","title":"Learning and Classifying Under Hard Budgets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":62,"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":"Computer science; Classifier (UML); Purchasing; Feature (linguistics); Artificial intelligence; Machine learning; Variety (cybernetics)","score_opus":0.01588892784920567,"score_gpt":0.2573441023372715,"score_spread":0.24145517448806583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562418542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15656196,0.0026997873,0.80215746,0.008726089,0.00049320346,0.00013829613,0.0013873173,0.0009095009,0.026926436],"genre_scores_gemma":[0.75831944,0.0033801207,0.18147126,0.0011788349,0.002307347,0.00046368325,0.00334631,0.0005586478,0.04897433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816054,0.000646745,0.000115654424,0.00046123753,0.00035606223,0.00025981158],"domain_scores_gemma":[0.9882641,0.008604867,0.00084376574,0.0013113432,0.0005156882,0.0004603252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030022513,0.00093225704,0.0017710009,0.0013955714,0.0007181512,0.0035553426,0.0019900629,0.0018746913,0.008150267],"category_scores_gemma":[0.022042532,0.00061983184,0.000745573,0.0021311184,0.0019215286,0.010241751,0.002302049,0.0030427433,0.0012832577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005828316,0.000184175,0.006089951,0.00040142902,0.00010568447,0.00015457558,0.00034901078,0.10479706,0.0015241954,0.47401488,0.037623793,0.37417242],"study_design_scores_gemma":[0.000024488309,0.000038248207,0.0006230632,0.000044960852,0.000016255239,0.000059619313,0.00008081785,0.2541636,0.00074768974,0.74071467,0.0034754856,0.000011166321],"about_ca_topic_score_codex":0.0012916907,"about_ca_topic_score_gemma":0.0009909633,"teacher_disagreement_score":0.008150267,"about_ca_system_score_codex":0.0012790309,"about_ca_system_score_gemma":0.00096441485,"threshold_uncertainty_score":0.02726543},"labels":[],"label_agreement":null},{"id":"W1562453349","doi":"10.1007/978-3-540-71703-4_57","title":"Capture Inference Attacks for K-Anonymity with Privacy Inference Logic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Western University","funders":"","keywords":"Microdata (statistics); Inference; Computer science; Anonymity; Probabilistic logic; Data mining; Computer security; Artificial intelligence","score_opus":0.05997853628192107,"score_gpt":0.31555370202550437,"score_spread":0.2555751657435833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562453349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023455225,0.00072621845,0.9310241,0.0056340466,0.0003073972,0.00020658858,0.00030004245,0.0013859924,0.03696048],"genre_scores_gemma":[0.8700572,0.000839482,0.10754832,0.0019010962,0.0003845568,0.00026883296,0.00038277218,0.00032817016,0.01828952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9849637,0.0049736667,0.0007340344,0.0019615304,0.0054439795,0.0019230134],"domain_scores_gemma":[0.98627543,0.007318696,0.0005294754,0.004879733,0.0006834202,0.00031321292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065158405,0.0012193548,0.001768107,0.0015510937,0.004065289,0.00914927,0.003879992,0.0043132748,0.0050429227],"category_scores_gemma":[0.014515996,0.0014728633,0.00365006,0.0023356215,0.006521575,0.019078985,0.01227638,0.012234203,0.0013351458],"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.00022491654,0.00006435989,0.00025415144,0.00009849763,0.00008824834,0.00013175851,0.00038646878,0.009271891,0.0012593389,0.9641003,0.0046434538,0.019476589],"study_design_scores_gemma":[0.000032418266,0.000025675476,0.000083040475,0.000028585782,0.00006862986,0.00018469268,0.00007170705,0.05564638,0.003498451,0.9352579,0.005064698,0.000037731326],"about_ca_topic_score_codex":0.0010853197,"about_ca_topic_score_gemma":0.00081186055,"teacher_disagreement_score":0.00914927,"about_ca_system_score_codex":0.004635479,"about_ca_system_score_gemma":0.0022384226,"threshold_uncertainty_score":0.03445947},"labels":[],"label_agreement":null},{"id":"W1562601581","doi":"10.1007/11494621_34","title":"Assessment of Separation of Functional Components with ICA from Dynamic Cardiac Perfusion PET Phantom Images for Volume Extraction with Deformable Surface Models","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Imaging phantom; Torso; Independent component analysis; Computer science; Perfusion scanning; Artificial intelligence; Nuclear medicine; Ventricle; Computer vision; Perfusion; Biomedical engineering; Physics; Medicine; Radiology; Anatomy","score_opus":0.017513574660568153,"score_gpt":0.31179329962269087,"score_spread":0.29427972496212274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562601581","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.13205068,0.002294128,0.8573264,0.00042428038,0.000107128275,0.00023282105,0.00071192783,0.0037669744,0.003085674],"genre_scores_gemma":[0.4648087,0.0018604202,0.52720886,0.00012129415,0.000059164417,0.00015243336,0.001776084,0.0010171577,0.0029958775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952126,0.00013741016,0.00003135166,0.000075910146,0.00017371449,0.00006037799],"domain_scores_gemma":[0.99772745,0.0014624336,0.00010815581,0.00017526346,0.00047570362,0.00005094969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024648365,0.0015042509,0.0007188072,0.001666427,0.00037479668,0.0016008111,0.00079019764,0.0012927423,0.001930157],"category_scores_gemma":[0.005911209,0.00045611715,0.0009861998,0.00094720017,0.00046930718,0.0009987592,0.00063709344,0.00081835146,0.001036648],"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.0019928417,0.00021221439,0.0035637477,0.00064457546,0.0004516677,0.00030322405,0.00026836776,0.08799888,0.27073732,0.002029483,0.0037881653,0.6280095],"study_design_scores_gemma":[0.0000535168,0.00035539095,0.010938208,0.00006654159,0.00037392025,0.0007405069,0.00012525523,0.7837856,0.19732971,0.0024173185,0.003731083,0.00008291256],"about_ca_topic_score_codex":0.0030292058,"about_ca_topic_score_gemma":0.0038806093,"teacher_disagreement_score":0.0030292058,"about_ca_system_score_codex":0.00043782557,"about_ca_system_score_gemma":0.0007819952,"threshold_uncertainty_score":0.013035417},"labels":[],"label_agreement":null},{"id":"W1562696372","doi":"10.1007/978-3-540-85836-2_3","title":"An MDA Approach for the Development of Spatial Data Warehouses","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":39,"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":"Ontario Council on Graduate Studies, Council of Ontario Universities; Universidad de Alicante","keywords":"Computer science; Data warehouse; Logical data model; Representation (politics); Extension (predicate logic); Transformation (genetics); Spatial analysis; Eclipse; Set (abstract data type); Online analytical processing; Development (topology); Logical framework; Data transformation; Architecture; Data mining; Theoretical computer science; Data modeling; Database; Programming language","score_opus":0.06150636132431073,"score_gpt":0.28362894861120874,"score_spread":0.22212258728689802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562696372","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.0040070843,0.0002438179,0.9898317,0.00031553314,0.000033051525,0.00011855886,0.0001569934,0.0027189623,0.002574366],"genre_scores_gemma":[0.036534153,0.00034082326,0.96012145,0.00010592452,0.00001300444,0.00011948878,0.0006004565,0.00037691675,0.0017878148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974733,0.00085340656,0.00036906562,0.00027506152,0.00086857355,0.00016055125],"domain_scores_gemma":[0.9968304,0.0008563941,0.00018193966,0.001041711,0.00093691185,0.00015273895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039855624,0.0005613945,0.00052395,0.0013196083,0.0010084108,0.004569982,0.0023661375,0.0010405796,0.0019868303],"category_scores_gemma":[0.007261774,0.001195614,0.0014499313,0.0013439185,0.00090114656,0.0034766973,0.0027177485,0.0022904703,0.0008888532],"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.00015018805,0.00032073868,0.0044866204,0.00096970965,0.00036463395,0.0011692034,0.0048491354,0.050903674,0.03070465,0.34511432,0.02261009,0.5383571],"study_design_scores_gemma":[0.00007552457,0.00018622479,0.0017190856,0.0007358347,0.0004546916,0.0016675174,0.0012317896,0.40518188,0.044743825,0.17665787,0.36717817,0.00016754294],"about_ca_topic_score_codex":0.0059469016,"about_ca_topic_score_gemma":0.008543895,"teacher_disagreement_score":0.0059469016,"about_ca_system_score_codex":0.0010541069,"about_ca_system_score_gemma":0.003344685,"threshold_uncertainty_score":0.02107793},"labels":[],"label_agreement":null},{"id":"W1562779169","doi":"10.1007/978-3-540-77010-7_8","title":"How Do Users Express Goals on the Web? - An Exploration of Intentional Structures in Web Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Tree traversal; Computer science; Exploratory search; Construct (python library); World Wide Web; Plan (archaeology); Search engine; Product (mathematics); Data science; Information retrieval; Mathematics","score_opus":0.07230656730095389,"score_gpt":0.31049553891594944,"score_spread":0.23818897161499555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562779169","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.7690275,0.0028635382,0.1028959,0.007935614,0.000038865885,0.00009597361,0.0003583019,0.00037445655,0.11640988],"genre_scores_gemma":[0.9901985,0.00040683587,0.0076060537,0.00010227633,0.000010001668,0.00002259709,0.00009980016,0.000053658387,0.0015003462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978878,0.0012940625,0.000105255705,0.00015080879,0.0004069283,0.00015516253],"domain_scores_gemma":[0.9862601,0.011214749,0.00089581317,0.0007006962,0.0006109492,0.0003177589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029173363,0.00025467452,0.00036086465,0.0014915038,0.0013863761,0.0076998505,0.00078625383,0.001440473,0.0023045067],"category_scores_gemma":[0.021443864,0.0005407721,0.0004939677,0.0026600764,0.0037447303,0.018719345,0.0022400068,0.001482383,0.00046221615],"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.00031146282,0.00025647492,0.052330464,0.0004874729,0.000100946534,0.0003699803,0.08527634,0.0037880505,0.0034518382,0.7315994,0.004657154,0.11737038],"study_design_scores_gemma":[0.000047203775,0.00010498265,0.025039196,0.00025957325,0.00010807093,0.00054005743,0.051532406,0.048848506,0.0026174975,0.8495896,0.02123361,0.000079235084],"about_ca_topic_score_codex":0.006987588,"about_ca_topic_score_gemma":0.006951586,"teacher_disagreement_score":0.0076998505,"about_ca_system_score_codex":0.0013271031,"about_ca_system_score_gemma":0.0012364156,"threshold_uncertainty_score":0.015428543},"labels":[],"label_agreement":null},{"id":"W1562845089","doi":"10.1007/978-3-540-77026-8_12","title":"A Graph Theoretic Analysis of Double Base Number Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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 Calgary","funders":"","keywords":"Mathematical proof; Base (topology); Integer (computer science); Mathematics; Representation (politics); Combinatorial proof; Discrete mathematics; Combinatorics; Graph; Integer sequence; Theoretical computer science; Computer science","score_opus":0.0200028941033581,"score_gpt":0.2568944548547386,"score_spread":0.23689156075138051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562845089","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.3539763,0.0061715306,0.35209364,0.00503454,0.00087068847,0.00012910737,0.0008772772,0.0005214711,0.28032538],"genre_scores_gemma":[0.92686504,0.002374534,0.034909748,0.00044536186,0.000866636,0.00008481584,0.00038921152,0.00017646533,0.033888105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996879,0.00006953023,0.000011573239,0.00005688221,0.00012052614,0.000053640226],"domain_scores_gemma":[0.99877435,0.00058276235,0.0001663799,0.00015563192,0.00016276335,0.00015815935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038071148,0.0006059853,0.000567917,0.0029340687,0.0016058268,0.002522966,0.001181708,0.0008909086,0.008957841],"category_scores_gemma":[0.002418675,0.00035642044,0.0005164475,0.0026639844,0.0020662467,0.004032455,0.0011401464,0.002028585,0.0010138955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001200796,0.000009182673,0.000088137655,0.00002201093,0.0000028475174,0.000033969205,0.00007572521,0.002063475,0.00041445842,0.9919872,0.0013446521,0.0039463188],"study_design_scores_gemma":[0.0000040575205,0.000006803796,0.00012738089,0.000012408566,0.0000041013927,0.00006399745,0.000046952868,0.008486569,0.0002107901,0.9873563,0.0036745043,0.000006090444],"about_ca_topic_score_codex":0.00091564,"about_ca_topic_score_gemma":0.0007447529,"teacher_disagreement_score":0.008957841,"about_ca_system_score_codex":0.001365173,"about_ca_system_score_gemma":0.00049125875,"threshold_uncertainty_score":0.02996695},"labels":[],"label_agreement":null},{"id":"W1562861155","doi":"10.1007/3-540-36440-4_20","title":"Stochastic Local Search Algorithms for DNA Word Design","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":88,"is_retracted":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":"Alphabet; Computer science; Word (group theory); Algorithm; Search algorithm; Theoretical computer science; Mathematics","score_opus":0.025905859945256637,"score_gpt":0.29104400505060385,"score_spread":0.2651381451053472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562861155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038539115,0.00042686015,0.9936939,0.00009193136,0.00003748371,0.00005841791,0.000059103477,0.00056272047,0.0012156479],"genre_scores_gemma":[0.11489679,0.0005141855,0.8762363,0.00018547654,0.000081294194,0.00081669015,0.0004343307,0.00037962125,0.0064553497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986041,0.00063054694,0.00008038959,0.0002157038,0.00036002972,0.00010934121],"domain_scores_gemma":[0.9948225,0.004169858,0.0001611367,0.00025113966,0.0004982332,0.00009716104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022077467,0.0011532207,0.002107727,0.0016700617,0.0007086263,0.0009655199,0.002212002,0.0021451705,0.007920635],"category_scores_gemma":[0.00798359,0.0011376847,0.0011107827,0.0023729987,0.0013738745,0.0017862178,0.0017443176,0.0018169632,0.0016749415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013719783,0.00007421114,0.00018671968,0.000140875,0.000041339277,0.0000324658,0.00007244739,0.8012271,0.0012005785,0.026643667,0.004147987,0.16609533],"study_design_scores_gemma":[0.00003663922,0.00003305866,0.000020755086,0.00000973679,0.000006211052,0.000008866032,0.000008119208,0.982144,0.00030822746,0.016671065,0.0007479727,0.0000052802984],"about_ca_topic_score_codex":0.0046935296,"about_ca_topic_score_gemma":0.0052144113,"teacher_disagreement_score":0.007920635,"about_ca_system_score_codex":0.0011779963,"about_ca_system_score_gemma":0.0018030582,"threshold_uncertainty_score":0.026497126},"labels":[],"label_agreement":null},{"id":"W1562877720","doi":"10.1007/978-3-540-25955-8_9","title":"Approaches to Identify the Amount of Publishable Information in Business Surveys through Waivers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Census and Population Estimation","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":"Statistics Canada","funders":"","keywords":"Agency (philosophy); Computer science; Publication; Identification (biology); Heuristic; Value (mathematics); Operations research; Business; Artificial intelligence; Machine learning; Advertising; Engineering; Sociology","score_opus":0.12075799854197342,"score_gpt":0.30529252526634143,"score_spread":0.18453452672436801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562877720","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.06859456,0.005406608,0.8977558,0.0036686982,0.0002056475,0.0005671696,0.0044725537,0.0006779068,0.018651126],"genre_scores_gemma":[0.48184037,0.0040025124,0.4943127,0.00052674,0.0003677431,0.0014909599,0.0042940765,0.00015977681,0.013005112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97214454,0.017547723,0.001803062,0.0035444803,0.004098374,0.0008618001],"domain_scores_gemma":[0.788836,0.17678672,0.013741427,0.012605176,0.0069596465,0.001070966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03604927,0.0010016079,0.0021121528,0.014821584,0.0015480149,0.007573441,0.005238874,0.0029180758,0.0055807247],"category_scores_gemma":[0.17304093,0.0020500391,0.002176664,0.026919262,0.0023391952,0.011448321,0.005393508,0.003136696,0.0014696703],"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.0003040986,0.0005095224,0.12738033,0.0013997469,0.0014760584,0.00020203562,0.004736504,0.03245476,0.0012418083,0.28587836,0.008831975,0.5355848],"study_design_scores_gemma":[0.00011114347,0.00040172064,0.07344319,0.0011467466,0.0007937992,0.0003893673,0.00701038,0.18725134,0.0050930413,0.6585084,0.06564317,0.0002076974],"about_ca_topic_score_codex":0.0091397995,"about_ca_topic_score_gemma":0.015022465,"teacher_disagreement_score":0.03604927,"about_ca_system_score_codex":0.002541169,"about_ca_system_score_gemma":0.0031893493,"threshold_uncertainty_score":0.19064897},"labels":[],"label_agreement":null},{"id":"W1562915588","doi":"10.1007/3-540-45253-2_24","title":"Minimizing a Convex Cost Closure Set","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mining Techniques and Economics","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":"University of British Columbia","funders":"","keywords":"Isotonic regression; Closure (psychology); Generalization; Isotonic; Mathematics; Time complexity; Mathematical optimization; Computational complexity theory; Convex function; Quadratic equation; Interval (graph theory); Combinatorics; Regular polygon; Computer science; Algorithm; Statistics","score_opus":0.019473133009928114,"score_gpt":0.22313684554128305,"score_spread":0.20366371253135493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562915588","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.016029973,0.0004727435,0.9652154,0.0006778594,0.00012107041,0.000067007095,0.00020825994,0.0001837551,0.017023897],"genre_scores_gemma":[0.3690233,0.0014573281,0.5711129,0.00039200176,0.000585841,0.00064528204,0.00095747935,0.0012565034,0.054569386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987386,0.00044482044,0.000054533994,0.00029147734,0.0003709242,0.00009967915],"domain_scores_gemma":[0.99801826,0.0012515605,0.00013294241,0.00023198906,0.00022294006,0.00014237851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019506884,0.0018150839,0.0024359075,0.0011475311,0.00073239335,0.0026243061,0.0021538886,0.0023864065,0.007059706],"category_scores_gemma":[0.0065366076,0.00084768,0.0013009153,0.00137494,0.0014715694,0.0033574528,0.0026572533,0.0031308702,0.0009398498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017950413,0.00026175348,0.00048078768,0.00061599154,0.00014245765,0.00025105648,0.0001923168,0.40761593,0.007575303,0.3985577,0.020674188,0.16345301],"study_design_scores_gemma":[0.000021670972,0.00013634806,0.00024572792,0.000069528025,0.00003417063,0.00020586902,0.000045744633,0.7376347,0.002851425,0.25191376,0.0068181995,0.00002280035],"about_ca_topic_score_codex":0.0008805526,"about_ca_topic_score_gemma":0.0008472868,"teacher_disagreement_score":0.007059706,"about_ca_system_score_codex":0.0016882705,"about_ca_system_score_gemma":0.0010336358,"threshold_uncertainty_score":0.02361703},"labels":[],"label_agreement":null},{"id":"W1562951537","doi":"10.1007/978-3-642-02085-8_25","title":"Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Unit disk graph; Wireless sensor network; Vertex (graph theory); Distributed algorithm; Unit disk; Upper and lower bounds; Graph; Maximization; Euclidean geometry; Combinatorics; Joins; Wireless network; Wireless; Theoretical computer science; Mathematics; Distributed computing; Computer network; Mathematical optimization; Telecommunications","score_opus":0.019944535697190766,"score_gpt":0.24428013515843816,"score_spread":0.2243355994612474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562951537","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.03700147,0.0004293455,0.95850945,0.0001760569,0.00009242258,0.00012042136,0.00006804748,0.00015537234,0.0034474446],"genre_scores_gemma":[0.6496675,0.0006450947,0.34113637,0.0001244293,0.00009076422,0.00054282544,0.00024632114,0.000119317774,0.0074273427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925476,0.00033552412,0.000035006087,0.00014534978,0.00018259657,0.000046757224],"domain_scores_gemma":[0.99801874,0.0012523289,0.00010705154,0.00022811344,0.00029821965,0.0000954886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835651,0.00064627535,0.00086207496,0.0007135944,0.0007530284,0.0007104997,0.0015808407,0.00080343534,0.0016216788],"category_scores_gemma":[0.004518222,0.0005197062,0.000785225,0.0008134119,0.00071046175,0.0011025219,0.0012965081,0.00083031284,0.00023092004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014024485,0.00008366747,0.0007057212,0.00018329654,0.00008041336,0.00020349187,0.0003354438,0.7996859,0.009191122,0.08889292,0.00362184,0.096876],"study_design_scores_gemma":[0.000017817974,0.00006056496,0.00009592109,0.000010155212,0.000013938898,0.00009694429,0.00002586356,0.9668053,0.001052228,0.030479578,0.0013341757,0.000007480104],"about_ca_topic_score_codex":0.00047336632,"about_ca_topic_score_gemma":0.0005590466,"teacher_disagreement_score":0.0016216788,"about_ca_system_score_codex":0.000665394,"about_ca_system_score_gemma":0.00048203507,"threshold_uncertainty_score":0.008374751},"labels":[],"label_agreement":null},{"id":"W1562979930","doi":"10.1007/978-3-540-68847-1_20","title":"Pareto-Optimal Offensive Player Positioning in Simulated Soccer","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Simon Fraser University","funders":"","keywords":"Offensive; Computer science; Ball (mathematics); Pareto principle; Scope (computer science); Pareto optimal; Task (project management); Operations research; Mathematical optimization; Multi-objective optimization; Machine learning; Mathematics; Engineering","score_opus":0.02619631633091009,"score_gpt":0.21946634941737997,"score_spread":0.1932700330864699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562979930","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.9040662,0.00017375084,0.07620969,0.00028779038,0.00004470013,0.000053639487,0.00017551184,0.000118597665,0.018870112],"genre_scores_gemma":[0.9947519,0.00003145956,0.0028893405,0.000016143757,0.0000037967875,0.000014111242,0.00005529545,0.000015853084,0.0022221452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954873,0.00018884997,0.000014916633,0.000056163783,0.00006720963,0.00012407356],"domain_scores_gemma":[0.9980186,0.0014556736,0.00010459143,0.00007901295,0.00017246151,0.00016955847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012749631,0.000561775,0.00088849256,0.0005344885,0.00054002344,0.0012157473,0.0007456907,0.0013245235,0.003612615],"category_scores_gemma":[0.005313173,0.00067049783,0.00043975218,0.00039343716,0.0007373225,0.0007445329,0.0011383296,0.00060109986,0.00040532002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027947733,0.0000703207,0.0018555733,0.000022240509,0.000026663018,0.00007275141,0.00007562714,0.98423105,0.0006181998,0.005990078,0.00038452627,0.0063735205],"study_design_scores_gemma":[0.000021484488,0.00008546325,0.0011677444,0.000009173587,0.000007953917,0.000015609472,0.00008631619,0.99293935,0.0002831389,0.0052577476,0.00011647869,0.000009562796],"about_ca_topic_score_codex":0.008073661,"about_ca_topic_score_gemma":0.008419372,"teacher_disagreement_score":0.008073661,"about_ca_system_score_codex":0.00087800727,"about_ca_system_score_gemma":0.0011308236,"threshold_uncertainty_score":0.016053319},"labels":[],"label_agreement":null},{"id":"W1562997953","doi":"10.1007/978-3-540-74767-3_54","title":"A Hybrid Location-Semantic Approach to Routing Assisted by Agents in a Virtual Network","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Windsor","funders":"","keywords":"Computer science; Distributed computing; Geographic routing; Hierarchical routing; Computer network; Static routing; Policy-based routing; Dynamic Source Routing; Routing (electronic design automation); Multipath routing; Link-state routing protocol; Routing protocol","score_opus":0.02622195692525024,"score_gpt":0.25085664723184814,"score_spread":0.2246346903065979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562997953","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.0051462417,0.00009679364,0.9912753,0.00012187788,0.000060056023,0.000021653657,0.000021709755,0.0003023765,0.0029538616],"genre_scores_gemma":[0.37437508,0.00030763962,0.6184494,0.000101308455,0.00008342463,0.00010298472,0.00012957548,0.00016589781,0.0062846886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918956,0.00030266252,0.00005509792,0.00014381454,0.00022564329,0.000083236795],"domain_scores_gemma":[0.9993691,0.00022656086,0.00004309626,0.00019189557,0.00010712362,0.0000622743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010321622,0.000595824,0.00082844886,0.0006692191,0.0010777931,0.0025372042,0.002422546,0.0012862306,0.0022549692],"category_scores_gemma":[0.0020586986,0.00046819996,0.00087875215,0.0009371963,0.0012723318,0.003309793,0.0030067249,0.0010825811,0.0004948107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022263116,0.000121255216,0.0005853995,0.0001357779,0.00008443709,0.0002832938,0.0004297645,0.4494131,0.010077614,0.4159881,0.0032265908,0.119432144],"study_design_scores_gemma":[0.000013700856,0.00003428706,0.000071495684,0.000010881395,0.000032718533,0.000084854815,0.00007470885,0.91915214,0.0021108997,0.07262813,0.0057684546,0.000017676333],"about_ca_topic_score_codex":0.0023980536,"about_ca_topic_score_gemma":0.0036780317,"teacher_disagreement_score":0.0025372042,"about_ca_system_score_codex":0.0006772107,"about_ca_system_score_gemma":0.001016415,"threshold_uncertainty_score":0.0075436234},"labels":[],"label_agreement":null},{"id":"W1563032148","doi":"10.1007/978-3-540-76856-2_79","title":"Hardware-Accelerated Volume Rendering for Real-Time Medical Data Visualization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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 Alberta","funders":"","keywords":"Volume rendering; Rendering (computer graphics); Computer science; Ray casting; Voxel; Real-time rendering; Visualization; Computer graphics (images); Parallel rendering; 3D rendering; Software rendering; Computation; Tiled rendering; Texture memory; Data visualization; Artificial intelligence; Computer graphics; Algorithm; 3D computer graphics","score_opus":0.07045274795581895,"score_gpt":0.3506188148425425,"score_spread":0.2801660668867235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563032148","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.0042538946,0.00068857474,0.98747444,0.00014077358,0.00017149677,0.00003708089,0.00008464313,0.0036384254,0.0035106798],"genre_scores_gemma":[0.09874604,0.0016384078,0.88684505,0.0001074268,0.00016643571,0.00008190437,0.00035715982,0.0015016303,0.010556024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.000046225614,0.0000097644415,0.0000195553,0.00016410707,0.000028115706],"domain_scores_gemma":[0.99956924,0.00020556919,0.00002376391,0.00006820052,0.000104891384,0.000028386125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003630146,0.0009985993,0.0005661022,0.00047694801,0.00024357239,0.0012975557,0.0012170828,0.0006223764,0.013524118],"category_scores_gemma":[0.0013571979,0.00053014106,0.0005766532,0.00064880657,0.00028453884,0.0006794873,0.00084263546,0.0013593995,0.0020981908],"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.00045051807,0.0000961233,0.00033566056,0.00057244423,0.000085655665,0.0004519054,0.0003405705,0.0706504,0.22777587,0.032941934,0.040358946,0.6259399],"study_design_scores_gemma":[0.00009945109,0.00012848526,0.0005474757,0.00007109937,0.000042641375,0.0012380889,0.000054083666,0.8111708,0.11726193,0.016944299,0.052384596,0.00005707342],"about_ca_topic_score_codex":0.0012378178,"about_ca_topic_score_gemma":0.0016533431,"teacher_disagreement_score":0.013524118,"about_ca_system_score_codex":0.00032033463,"about_ca_system_score_gemma":0.00047038365,"threshold_uncertainty_score":0.045242667},"labels":[],"label_agreement":null},{"id":"W1563058589","doi":"10.1007/978-3-642-14165-2_46","title":"Finding Is as Easy as Detecting for Quantum Walks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":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":"Quantum walk; Random walk; Mathematics; Quadratic growth; Graph; Quantum; Discrete mathematics; Combinatorics; Statistical physics; Quantum algorithm; Quantum mechanics; Algorithm; Physics; Statistics","score_opus":0.017008136227171566,"score_gpt":0.2652777477026309,"score_spread":0.24826961147545934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563058589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22836524,0.0019005497,0.6809602,0.013607176,0.0018477968,0.00035150952,0.0011206887,0.0042411247,0.06760569],"genre_scores_gemma":[0.7184883,0.0012276267,0.24328882,0.0021184387,0.0011641972,0.00024162087,0.0013262952,0.0012608254,0.030883975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971807,0.00058021565,0.00020528285,0.0009861215,0.0006340067,0.00041378717],"domain_scores_gemma":[0.9852798,0.008045799,0.0008574008,0.0042351964,0.0010076896,0.0005741607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017696932,0.0011940559,0.00162469,0.0013228285,0.0025911916,0.004845798,0.0020570476,0.0034566415,0.01101955],"category_scores_gemma":[0.012239085,0.0009938367,0.0017141894,0.001478259,0.0044657676,0.019564066,0.0041609854,0.0049732663,0.0031398616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064803625,0.00026659903,0.0028450633,0.00081370067,0.00016481854,0.00025830648,0.0006460752,0.006233224,0.016994553,0.75135726,0.022755481,0.19701691],"study_design_scores_gemma":[0.000024335039,0.00007704684,0.00031795359,0.000048666476,0.000043496315,0.00021982075,0.00021923224,0.010807546,0.0066198246,0.97470313,0.0068880725,0.000030883653],"about_ca_topic_score_codex":0.0003513026,"about_ca_topic_score_gemma":0.0004466729,"teacher_disagreement_score":0.01101955,"about_ca_system_score_codex":0.000572944,"about_ca_system_score_gemma":0.0009931969,"threshold_uncertainty_score":0.036864102},"labels":[],"label_agreement":null},{"id":"W1563069349","doi":"10.1007/10722777_16","title":"ACL as a Joint Project between Participants: A Preliminary Report","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Joint (building); Psychology; Aeronautics; Medicine; Physical therapy; Engineering; Civil engineering","score_opus":0.06405100347037411,"score_gpt":0.3010792961811838,"score_spread":0.23702829271080966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563069349","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.4809435,0.001276127,0.17099462,0.015381532,0.0029215184,0.005568073,0.009447187,0.009610218,0.30385724],"genre_scores_gemma":[0.7768012,0.00066636386,0.07780503,0.001071737,0.00039273986,0.0024745343,0.014469984,0.0018240148,0.12449435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97156173,0.018190047,0.001418313,0.0016128195,0.0053071827,0.0019098624],"domain_scores_gemma":[0.93704575,0.023560701,0.0011981659,0.009446426,0.01732814,0.011420746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029851433,0.00088121736,0.00087646424,0.001541937,0.0035559796,0.010408662,0.003032573,0.0027841097,0.048555125],"category_scores_gemma":[0.048097786,0.0008892649,0.0008313899,0.0019921903,0.0015521573,0.009269923,0.007413775,0.0030395298,0.017924419],"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.014146345,0.016878558,0.059297618,0.0016671058,0.00032144313,0.0022291231,0.037577905,0.0109849395,0.014974046,0.0681123,0.2042003,0.5696103],"study_design_scores_gemma":[0.0028112861,0.008916564,0.037980676,0.0005523068,0.00058924104,0.0030423962,0.055124216,0.06277242,0.05076888,0.0379362,0.73903626,0.00046942965],"about_ca_topic_score_codex":0.011041366,"about_ca_topic_score_gemma":0.00596862,"teacher_disagreement_score":0.048555125,"about_ca_system_score_codex":0.0016913506,"about_ca_system_score_gemma":0.008592026,"threshold_uncertainty_score":0.16243309},"labels":[],"label_agreement":null},{"id":"W1563085466","doi":"10.1007/978-3-540-73888-6_10","title":"Efficient, Effective and Flexible XML Retrieval Using Summaries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information retrieval; XML; Flexibility (engineering); World Wide Web","score_opus":0.024579848016829275,"score_gpt":0.2814022573163169,"score_spread":0.25682240929948763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563085466","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.04190648,0.004327977,0.9225274,0.0004781047,0.00020815142,0.00026962292,0.0017204885,0.02308343,0.0054783355],"genre_scores_gemma":[0.24252738,0.0034117233,0.72815514,0.00024355213,0.00034262915,0.00017689822,0.00574357,0.0019973265,0.017401764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841285,0.00036302276,0.00027061306,0.0002301105,0.0005961155,0.00012718396],"domain_scores_gemma":[0.996376,0.0015824854,0.00024774036,0.0012370031,0.00044711563,0.00010971219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326433,0.000997475,0.0016098766,0.0023757515,0.00075268943,0.0034032837,0.0017258542,0.0010661386,0.0049404344],"category_scores_gemma":[0.0071081743,0.0007394232,0.0007941051,0.0026499638,0.00040055855,0.0060224654,0.0021642859,0.00078578014,0.0046063988],"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.00075380417,0.00013291065,0.0009941356,0.0009524998,0.00009241797,0.00042356545,0.0005817053,0.007861411,0.0658986,0.012626481,0.039002467,0.87068],"study_design_scores_gemma":[0.0005320887,0.0013356102,0.0029822832,0.00029955746,0.00079472235,0.0042248038,0.0015618582,0.4233466,0.32876834,0.060300738,0.17550862,0.00034477146],"about_ca_topic_score_codex":0.0009896439,"about_ca_topic_score_gemma":0.0015835048,"teacher_disagreement_score":0.0049404344,"about_ca_system_score_codex":0.00033965198,"about_ca_system_score_gemma":0.000739351,"threshold_uncertainty_score":0.016527355},"labels":[],"label_agreement":null},{"id":"W1563090870","doi":"10.1007/11951148_12","title":"Evaluation of Development Tools for Domain-Specific Modeling Languages","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Development (topology); Programming language; Domain (mathematical analysis); Domain-specific language; Software engineering; Artificial intelligence; Natural language processing; Mathematics","score_opus":0.09871004003921996,"score_gpt":0.32498300401244823,"score_spread":0.22627296397322827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563090870","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.9157792,0.0006073393,0.06900861,0.00025770956,0.00004798762,0.00071712804,0.0006895938,0.0038311677,0.009061177],"genre_scores_gemma":[0.88059115,0.00045082017,0.11312657,0.000061865496,0.000013024801,0.0003923235,0.0026067034,0.00077095436,0.0019866647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911315,0.004848704,0.0007046694,0.0005366146,0.002339399,0.00043914127],"domain_scores_gemma":[0.9472871,0.038032927,0.0022155368,0.0047497856,0.0069080503,0.0008066303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010545896,0.0012205017,0.0005308365,0.0019105452,0.0005223908,0.0015664181,0.0021054337,0.0010699461,0.002609661],"category_scores_gemma":[0.04516684,0.00054269115,0.00066178513,0.001258483,0.0005611171,0.0024027913,0.0016920972,0.00089874177,0.0004930901],"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.011349133,0.008816176,0.028345143,0.0032146533,0.0006556642,0.0006848901,0.0051240674,0.16032703,0.06691242,0.016624192,0.008326035,0.6896207],"study_design_scores_gemma":[0.0030419065,0.00921375,0.023549916,0.0005515119,0.001380491,0.00054319773,0.0026541941,0.7703713,0.15696064,0.008171237,0.02336011,0.00020175113],"about_ca_topic_score_codex":0.002228411,"about_ca_topic_score_gemma":0.002437108,"teacher_disagreement_score":0.010545896,"about_ca_system_score_codex":0.0014338912,"about_ca_system_score_gemma":0.0016332328,"threshold_uncertainty_score":0.055772662},"labels":[],"label_agreement":null},{"id":"W1563147155","doi":"10.1007/978-3-642-16023-3_4","title":"Systematic Correct Construction of Self-stabilizing Systems: A Case Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Atomicity; Computer science; Distributed computing; Scheduling (production processes); Synchronization (alternating current); Self-stabilization; Set (abstract data type); Component (thermodynamics); Theoretical computer science; Algorithm; Distributed algorithm; Mathematical optimization; Programming language; Mathematics","score_opus":0.012459667894372297,"score_gpt":0.24065144332217722,"score_spread":0.22819177542780492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563147155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46354678,0.00022860743,0.51632684,0.00045744824,0.000032866865,0.00033105488,0.00013974658,0.000980187,0.017956482],"genre_scores_gemma":[0.8890859,0.000114026705,0.10757621,0.000028000984,0.000007687116,0.00011018317,0.000083909,0.00009596308,0.002898131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.9984738,0.000656287,0.000069037305,0.00009014644,0.00055139617,0.00015918902],"domain_scores_gemma":[0.9929503,0.004062493,0.00027139182,0.0017538315,0.0008441533,0.000117798176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018863094,0.00035584398,0.00042333436,0.0005294391,0.0011156587,0.00091399427,0.00070752774,0.0016133339,0.0018567035],"category_scores_gemma":[0.008536434,0.00026573476,0.0006426892,0.0006952878,0.0016192002,0.0008067991,0.001172459,0.0008356491,0.00024450867],"study_design_candidate":"case_report","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005773774,0.00068041775,0.011474613,0.0007095842,0.000094855335,0.006653069,0.0036078403,0.40640867,0.02267996,0.3492415,0.0037870666,0.19408517],"study_design_scores_gemma":[0.00032275522,0.00083318574,0.002383517,0.00008134182,0.00012859429,0.001949836,0.0009940461,0.7667521,0.04649287,0.1660382,0.013972963,0.000050521652],"about_ca_topic_score_codex":0.0017560851,"about_ca_topic_score_gemma":0.0025991066,"teacher_disagreement_score":0.0018863094,"about_ca_system_score_codex":0.00045655936,"about_ca_system_score_gemma":0.0012114698,"threshold_uncertainty_score":0.009975851},"labels":[],"label_agreement":null},{"id":"W1563247514","doi":"10.1007/978-3-540-73951-7_35","title":"Cauchy’s Theorem and Edge Lengths of Convex Polyhedra","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Mathematics; Combinatorics; Dihedral angle; Integer points in convex polyhedra; Cauchy distribution; Point (geometry); Enhanced Data Rates for GSM Evolution; Linear programming; Computer science; Convex set; Geometry; Algorithm; Convex optimization; Mathematical analysis; Artificial intelligence","score_opus":0.018727453099209833,"score_gpt":0.257643107700777,"score_spread":0.23891565460156713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563247514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09000847,0.004179609,0.79011416,0.0013717226,0.0006428236,0.00006010085,0.00041998047,0.00017868569,0.113024525],"genre_scores_gemma":[0.6535954,0.0065512457,0.28150758,0.0005260024,0.0013374025,0.00019821996,0.0010649746,0.00077182153,0.054447375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913114,0.00018992259,0.000049231432,0.00015770878,0.0003972643,0.00007477752],"domain_scores_gemma":[0.99619824,0.0023643237,0.00020939964,0.00023578444,0.00073316845,0.0002590519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011547161,0.0008865965,0.00082082604,0.0033908547,0.001226024,0.0020530499,0.0020680635,0.0011247377,0.006278194],"category_scores_gemma":[0.008766379,0.000787395,0.00093537336,0.0028177584,0.003075149,0.0051420475,0.0019629223,0.004684832,0.0010392363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035613957,0.00001699756,0.00028469207,0.00008013424,0.000009739109,0.000053104333,0.00013531753,0.012381417,0.0014872565,0.9494558,0.002518157,0.033541895],"study_design_scores_gemma":[0.000005934734,0.00001680646,0.00036405426,0.000026144526,0.0000061960027,0.00008084276,0.00006373853,0.042814434,0.0009121491,0.947506,0.008190425,0.000013179748],"about_ca_topic_score_codex":0.0014431841,"about_ca_topic_score_gemma":0.0012859011,"teacher_disagreement_score":0.006278194,"about_ca_system_score_codex":0.0014235697,"about_ca_system_score_gemma":0.0005119777,"threshold_uncertainty_score":0.02100265},"labels":[],"label_agreement":null},{"id":"W1563292672","doi":"10.1007/3-540-47979-1_48","title":"Learning Montages of Transformed Latent Images as Representations of Objects That Change in Appearance","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Toronto; University of Waterloo","funders":"","keywords":"Artificial intelligence; Computer science; Face (sociological concept); Computer vision; Object (grammar); Grid; Image (mathematics); Probabilistic logic; Transformation (genetics); Tree (set theory); Pattern recognition (psychology); Set (abstract data type); Mathematics","score_opus":0.028671184230646587,"score_gpt":0.25838737401608225,"score_spread":0.22971618978543568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563292672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04611613,0.00021306107,0.9509764,0.00025918268,0.00006890178,0.000035740766,0.00022622751,0.00080574217,0.0012986761],"genre_scores_gemma":[0.725616,0.0007900864,0.2615992,0.00023989128,0.00014719549,0.00012496096,0.0012152167,0.00045138827,0.009816112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997807,0.000053733987,0.0000079668525,0.00008319952,0.00004572298,0.000028651211],"domain_scores_gemma":[0.99921346,0.0003864151,0.00010239045,0.0001829596,0.00006856582,0.000046071127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056255335,0.00053389557,0.0005813692,0.00073106855,0.00017392896,0.0009685253,0.0008923354,0.0010680534,0.0032015047],"category_scores_gemma":[0.0025069378,0.00064264814,0.00089337205,0.0008204913,0.0007861602,0.0022455512,0.0012169634,0.0017605502,0.0008355623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009175455,0.00024212924,0.001816094,0.00023437821,0.00019895537,0.00029815314,0.00030976866,0.5069414,0.0881752,0.0945509,0.005302093,0.30101338],"study_design_scores_gemma":[0.000015300942,0.000049361344,0.00041988207,0.000009846374,0.000020509047,0.00007712681,0.000020895966,0.96518475,0.005763257,0.027627282,0.0007978782,0.000014027765],"about_ca_topic_score_codex":0.0009633463,"about_ca_topic_score_gemma":0.0014715532,"teacher_disagreement_score":0.0032015047,"about_ca_system_score_codex":0.0004637321,"about_ca_system_score_gemma":0.0002553088,"threshold_uncertainty_score":0.01071012},"labels":[],"label_agreement":null},{"id":"W1563424464","doi":"10.1007/978-3-642-37487-6_17","title":"Indexing Reverse Top-k Queries in Two Dimensions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Search engine indexing; Computer science; Polygon (computer graphics); Tuple; Information retrieval; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.01701251877270165,"score_gpt":0.25371234571853657,"score_spread":0.2366998269458349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563424464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17681763,0.008115676,0.6967491,0.0039855167,0.0017786977,0.0007020928,0.01171433,0.023344213,0.0767928],"genre_scores_gemma":[0.4623479,0.0023687957,0.4835871,0.0010436542,0.00054180383,0.0003258609,0.017499322,0.002480191,0.029805422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958931,0.0005366727,0.0006503526,0.00059553015,0.0016953793,0.00062890886],"domain_scores_gemma":[0.9916276,0.0020062653,0.0002968487,0.004639693,0.0012308363,0.00019885188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015492338,0.0009257274,0.002801881,0.0024436996,0.0016937105,0.005217125,0.002977571,0.0019271215,0.014577138],"category_scores_gemma":[0.010197073,0.0008479992,0.0012415366,0.0074289665,0.0017968417,0.010231238,0.0045107156,0.002638755,0.0070841787],"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.0018093972,0.00072335795,0.00416368,0.0021501023,0.00020552815,0.0006423996,0.00096507353,0.02855754,0.03690728,0.15492941,0.13717794,0.63176835],"study_design_scores_gemma":[0.00041405155,0.00040241494,0.0019241364,0.00028187825,0.00025791227,0.0038213485,0.0013610172,0.33532646,0.0502053,0.47855988,0.1272098,0.00023576396],"about_ca_topic_score_codex":0.0023436474,"about_ca_topic_score_gemma":0.0042358795,"teacher_disagreement_score":0.014577138,"about_ca_system_score_codex":0.001525259,"about_ca_system_score_gemma":0.0022592011,"threshold_uncertainty_score":0.04876542},"labels":[],"label_agreement":null},{"id":"W1563601331","doi":"10.1007/3-540-48196-6_8","title":"QFD Matrix for Incremental Construction of a Warehouse via Data Marts","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Winnipeg","funders":"","keywords":"Data warehouse; Computer science; Quality function deployment; Construct (python library); Warehouse; Process (computing); Database; Software deployment; Data mining; Software engineering; Programming language; Operations management; Engineering","score_opus":0.028118667682933966,"score_gpt":0.2798995513708967,"score_spread":0.25178088368796275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563601331","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.008148134,0.00010987038,0.9827571,0.00021737849,0.00005631385,0.00020448881,0.0017653188,0.005125352,0.0016161401],"genre_scores_gemma":[0.072230175,0.00011868223,0.92104614,0.000060592043,0.000022854236,0.00019254073,0.0038446959,0.0002817734,0.0022026203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989936,0.00012758201,0.00009156514,0.00017872684,0.00052111084,0.00008740574],"domain_scores_gemma":[0.9983191,0.000522946,0.00009633444,0.0003960148,0.00058144104,0.000084215084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091107114,0.0006640469,0.0006763844,0.0022776905,0.00072647125,0.0017881792,0.0015455892,0.0004394517,0.009173415],"category_scores_gemma":[0.005001945,0.0006360988,0.0011577625,0.0024024656,0.00036530208,0.002250667,0.0018147529,0.0010591132,0.002311742],"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.0003519546,0.0002510682,0.0025746287,0.00042218404,0.00009734763,0.0004148918,0.00035467243,0.057367414,0.01736886,0.034352522,0.034704577,0.85173976],"study_design_scores_gemma":[0.00009395259,0.00013751062,0.0012706664,0.00006206423,0.000067058434,0.0004380744,0.00032905987,0.87859637,0.017738238,0.06517665,0.03602247,0.000067886045],"about_ca_topic_score_codex":0.009300662,"about_ca_topic_score_gemma":0.013362998,"teacher_disagreement_score":0.009300662,"about_ca_system_score_codex":0.00072173297,"about_ca_system_score_gemma":0.0016850837,"threshold_uncertainty_score":0.030688167},"labels":[],"label_agreement":null},{"id":"W1563609259","doi":"10.1007/11425274_53","title":"Interactive SOM-Based Gene Grouping: An Approach to Gene Expression Data Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Regina","funders":"","keywords":"Computer science; Self-organizing map; Cluster analysis; Visualization; Graphical user interface; Expression (computer science); Process (computing); Data visualization; Data mining; Interface (matter); Microarray analysis techniques; Artificial intelligence; Information retrieval; Gene; Gene expression; Programming language","score_opus":0.03518437312976001,"score_gpt":0.2955642942964955,"score_spread":0.2603799211667355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563609259","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.0015206783,0.00024464593,0.9938432,0.000051420437,0.000049072463,0.000038050744,0.00031344334,0.002948574,0.0009908165],"genre_scores_gemma":[0.016433906,0.00037982722,0.9796678,0.000041595267,0.000053232066,0.0001766716,0.00075907185,0.0006700878,0.0018178596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992955,0.00013341095,0.000048213205,0.00014007906,0.00032181383,0.000060981856],"domain_scores_gemma":[0.99923,0.00034672295,0.000033713346,0.00011334252,0.00021688119,0.00005924567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013390873,0.00120988,0.0017405901,0.0026262251,0.0008076467,0.0025214374,0.003056661,0.00091375824,0.0065510753],"category_scores_gemma":[0.0018606511,0.0008263348,0.0020622665,0.0049316585,0.00079460203,0.0011243267,0.002194804,0.0014041268,0.0021753523],"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.00036381607,0.00022494415,0.0014588522,0.00086695,0.0004550363,0.00025784093,0.0005964376,0.06653617,0.03528254,0.022311127,0.02181535,0.84983087],"study_design_scores_gemma":[0.00006569703,0.000065294094,0.0020935668,0.000072819224,0.00015725802,0.00036298495,0.00026092838,0.8667793,0.020817917,0.079665035,0.029570695,0.00008846945],"about_ca_topic_score_codex":0.0032298567,"about_ca_topic_score_gemma":0.0069513586,"teacher_disagreement_score":0.0065510753,"about_ca_system_score_codex":0.00062384654,"about_ca_system_score_gemma":0.0008531742,"threshold_uncertainty_score":0.021915555},"labels":[],"label_agreement":null},{"id":"W1563653749","doi":"10.1007/11816171_79","title":"Intelligent Process Trend Recognition Fault Diagnosis and Industrial Application","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Hidden Markov model; Process (computing); Artificial intelligence; Fault (geology); Representation (politics); Pattern recognition (psychology); Fault detection and isolation; Wavelet transform; Intelligent decision support system; Wavelet; Machine learning; Data mining","score_opus":0.021872149112018815,"score_gpt":0.2357066637488149,"score_spread":0.2138345146367961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563653749","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.018608166,0.005074942,0.95788246,0.00033944656,0.00033005566,0.000051076335,0.00010839973,0.004177584,0.013427805],"genre_scores_gemma":[0.42407468,0.0085833585,0.5056784,0.00021257857,0.00041712634,0.00008448674,0.00055863865,0.00044027372,0.059950467],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998111,0.000012525898,0.000012820764,0.000044549543,0.00010158685,0.000017402432],"domain_scores_gemma":[0.9997129,0.00009325886,0.000029148228,0.00003792542,0.00011889387,0.000007824913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027418163,0.0005604145,0.0006946904,0.001010595,0.00020183784,0.0007498537,0.0007567717,0.0008104742,0.0040621087],"category_scores_gemma":[0.0007070431,0.000399254,0.00047830364,0.0013108567,0.00033425025,0.0009838463,0.00027947273,0.0005884475,0.0018224934],"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.00013721004,0.000044424924,0.0005422931,0.0002324687,0.000027061942,0.00013353577,0.0000722569,0.014409064,0.04683771,0.006881346,0.006401995,0.9242806],"study_design_scores_gemma":[0.00003505033,0.00049088517,0.0045252335,0.000099685254,0.00019256883,0.0013433422,0.000079779464,0.70959777,0.17657384,0.02798039,0.079016484,0.0000649095],"about_ca_topic_score_codex":0.00077558646,"about_ca_topic_score_gemma":0.00078351866,"teacher_disagreement_score":0.0040621087,"about_ca_system_score_codex":0.00028179915,"about_ca_system_score_gemma":0.00021612595,"threshold_uncertainty_score":0.013589144},"labels":[],"label_agreement":null},{"id":"W1563658387","doi":"10.1007/11559573_119","title":"A New Approach to Automatically Detecting Grids in DNA Microarray Images","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Windsor","funders":"","keywords":"Computer science; Row; Grid; Hot spot (computer programming); Data mining; Artificial intelligence; Pattern recognition (psychology); Energy (signal processing); Database; Mathematics; Statistics","score_opus":0.013105747302859995,"score_gpt":0.25273027293640793,"score_spread":0.23962452563354794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563658387","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.00576457,0.00014206592,0.98916185,0.000082666156,0.000047219863,0.00006795692,0.00016630556,0.0039682286,0.00059919036],"genre_scores_gemma":[0.022275144,0.00014653878,0.97411853,0.00007922365,0.00003356576,0.00011343678,0.00039276274,0.00035800782,0.0024828315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992561,0.000062063555,0.000038633058,0.00019651263,0.0003872674,0.000059496066],"domain_scores_gemma":[0.9990257,0.00033513,0.00006424029,0.0002137707,0.00029775177,0.00006345361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585092,0.0009597135,0.0013294828,0.0026107335,0.00057067897,0.0012891742,0.0018223554,0.0009892107,0.0042214347],"category_scores_gemma":[0.00117457,0.0007390956,0.0011523756,0.0023330164,0.00069633586,0.0012998657,0.0015753366,0.0009041766,0.0021730815],"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.00019507275,0.00010671709,0.0013137779,0.00025795578,0.00010430306,0.00019803403,0.00014080814,0.00858141,0.23552242,0.0053953086,0.008392412,0.73979175],"study_design_scores_gemma":[0.00009078465,0.0001993387,0.005238327,0.00003654292,0.00012395554,0.0016957005,0.00019573723,0.75979763,0.1836284,0.018610373,0.030299207,0.00008392901],"about_ca_topic_score_codex":0.0031900848,"about_ca_topic_score_gemma":0.0053899586,"teacher_disagreement_score":0.0042214347,"about_ca_system_score_codex":0.00051799626,"about_ca_system_score_gemma":0.00060714124,"threshold_uncertainty_score":0.0141221285},"labels":[],"label_agreement":null},{"id":"W1563779111","doi":"10.1007/978-3-642-21260-4_11","title":"Component-Based Matching for Multiple Interacting RNA Sequences","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Backtracking; Set (abstract data type); Matching (statistics); Algorithm; Pattern matching; RNA; Theoretical computer science; Artificial intelligence; Mathematics; Gene","score_opus":0.025722562575936005,"score_gpt":0.25557864957714355,"score_spread":0.22985608700120755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563779111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030295376,0.00018847756,0.95969594,0.000070088136,0.000060934926,0.00016683797,0.00030881603,0.005604902,0.003608685],"genre_scores_gemma":[0.25306165,0.00020615479,0.73582935,0.000098397235,0.000035446286,0.00017496546,0.00197972,0.0009917169,0.0076226518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999054,0.00013081366,0.000077022705,0.00021987686,0.00038201126,0.00013619562],"domain_scores_gemma":[0.9988205,0.0005321839,0.00006539824,0.00027795302,0.00026083665,0.00004316175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075553375,0.00082375255,0.0011003866,0.002307785,0.0008412239,0.0013245896,0.0023945929,0.0012727403,0.009459491],"category_scores_gemma":[0.0031137012,0.00057241943,0.0013468612,0.002529684,0.00058543193,0.0020908834,0.0018476378,0.00076036656,0.0027805376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009818706,0.00025290967,0.0014264303,0.00040207212,0.00013882274,0.00032263037,0.00021523076,0.09015016,0.059328075,0.07249146,0.010421029,0.7638694],"study_design_scores_gemma":[0.000049901566,0.000077273435,0.0006218745,0.000023090925,0.00006738636,0.00022421926,0.00007292654,0.87795913,0.039733954,0.07482868,0.006304264,0.00003734875],"about_ca_topic_score_codex":0.004730625,"about_ca_topic_score_gemma":0.0055846185,"teacher_disagreement_score":0.009459491,"about_ca_system_score_codex":0.0010106739,"about_ca_system_score_gemma":0.0008430853,"threshold_uncertainty_score":0.03164518},"labels":[],"label_agreement":null},{"id":"W1563844626","doi":"10.1007/3-540-45391-1_2","title":"Mobile Code, Adaptive Mobile Applications, and Network Architectures","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Computer science; Computer network; Radio access network; Scalability; Mobile computing; UMTS frequency bands; Distributed computing; Wireless network; Mobile device; Wireless; Mobile station; Telecommunications; Operating system; Base station","score_opus":0.008485359471921337,"score_gpt":0.23324339917680184,"score_spread":0.2247580397048805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563844626","genre_codex":"review","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.023770364,0.43031347,0.1253692,0.010184023,0.0041987323,0.00006766707,0.00019329866,0.00054775033,0.40535545],"genre_scores_gemma":[0.30756283,0.28487083,0.06267322,0.0024875142,0.01052633,0.0002252444,0.0003514483,0.00025831565,0.33104432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998591,0.000025920952,0.000004459633,0.000025261834,0.00007141589,0.000013883287],"domain_scores_gemma":[0.99968505,0.00017176448,0.0000316711,0.00003675854,0.000054514563,0.000020341036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018097149,0.000842566,0.0003763985,0.0009668031,0.00043409824,0.0017347968,0.00050210743,0.0011787557,0.007428074],"category_scores_gemma":[0.0012170858,0.00034883746,0.00018916414,0.001604329,0.0016166121,0.002591174,0.00057439815,0.0014152917,0.0013837611],"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.00005103545,0.00005180173,0.00045045995,0.00032396035,0.000021223308,0.00010544549,0.00023549162,0.010031935,0.0026327006,0.7385712,0.05081257,0.19671209],"study_design_scores_gemma":[0.00001469065,0.000064056134,0.0012291619,0.00021471888,0.000020528272,0.00042330564,0.00017319617,0.017543415,0.0006842696,0.6876994,0.29191327,0.000020012463],"about_ca_topic_score_codex":0.0016829754,"about_ca_topic_score_gemma":0.0029348095,"teacher_disagreement_score":0.007428074,"about_ca_system_score_codex":0.00068528036,"about_ca_system_score_gemma":0.00041042536,"threshold_uncertainty_score":0.024849415},"labels":[],"label_agreement":null},{"id":"W1563857976","doi":"10.1007/3-540-39799-x_18","title":"A Layered Approach to the Design of Private Key Cryptosystems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Queen's University","funders":"","keywords":"Computer science; Cryptosystem; Cryptography; Key (lock); Encryption; Key space; Key encapsulation; Theoretical computer science; Hybrid cryptosystem; Simple (philosophy); Algorithm; Symmetric-key algorithm; Public-key cryptography; Computer security","score_opus":0.04022197994180138,"score_gpt":0.2519787673323826,"score_spread":0.21175678739058124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563857976","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.0027366208,0.00039709956,0.9891834,0.00046580666,0.00006392838,0.000059369646,0.000035225305,0.0006196397,0.006438823],"genre_scores_gemma":[0.13595022,0.0018531191,0.8503231,0.00031330492,0.00015784054,0.00027935547,0.00015982162,0.00034904087,0.010614254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971449,0.00087183976,0.00026578203,0.00022905506,0.0011659721,0.00032245062],"domain_scores_gemma":[0.9967974,0.0010589309,0.00019743928,0.0012060828,0.00054695486,0.00019316563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959716,0.0011764539,0.0007617689,0.0012172096,0.001298841,0.0056521636,0.002930866,0.0016785373,0.0051361746],"category_scores_gemma":[0.0070949197,0.0017728,0.0014754892,0.00131072,0.003001047,0.00837357,0.0041332007,0.0046329317,0.0022828758],"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.00008896807,0.000046150606,0.00023332241,0.00018871091,0.000057812842,0.000092093665,0.00037202644,0.02689428,0.0062516434,0.89783096,0.0033988138,0.06454529],"study_design_scores_gemma":[0.000041920746,0.00006805279,0.00008560987,0.00013918534,0.00008049393,0.00016480534,0.000078140554,0.1359629,0.011972923,0.8138766,0.037472297,0.000057018467],"about_ca_topic_score_codex":0.0008983381,"about_ca_topic_score_gemma":0.0014224992,"teacher_disagreement_score":0.0056521636,"about_ca_system_score_codex":0.0017975688,"about_ca_system_score_gemma":0.0018169224,"threshold_uncertainty_score":0.017182171},"labels":[],"label_agreement":null},{"id":"W1563889237","doi":"10.1007/978-3-540-73133-7_14","title":"Age and Geographic Inferences of the LiveJournal Social Network","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Residence; Internet privacy; The Internet; Social network (sociolinguistics); Social media; Product (mathematics); World Wide Web; Computer science; Personally identifiable information; Internet users; Advertising; Business; Sociology; Demography; Computer security; Mathematics","score_opus":0.02070342223034028,"score_gpt":0.26225668396126467,"score_spread":0.2415532617309244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563889237","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.93641794,0.0012637482,0.033794977,0.0009032294,0.0001171971,0.000031176958,0.005209282,0.00021852265,0.022043932],"genre_scores_gemma":[0.9914484,0.0004297102,0.0042581493,0.000041111452,0.00014512529,0.00001299245,0.0017809175,0.000040070314,0.001843552],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99948835,0.00023595279,0.0000262499,0.000129042,0.00008651408,0.000033930326],"domain_scores_gemma":[0.9883207,0.008641138,0.0010680994,0.0008437413,0.00088599534,0.0002403735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001538977,0.00021222705,0.00027718346,0.0029417719,0.00033665018,0.0010644854,0.00053299183,0.00058218016,0.003970293],"category_scores_gemma":[0.022524418,0.00024469336,0.00028718356,0.0020892175,0.0003142405,0.0032241421,0.0006553855,0.0006163101,0.0013067318],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000856863,0.0001697109,0.7495324,0.00025151792,0.00043146466,0.00039395923,0.0038542638,0.027587576,0.0039357217,0.042191472,0.013047104,0.15774798],"study_design_scores_gemma":[0.00003749434,0.00013497738,0.6926381,0.00011927023,0.0004152912,0.00097231736,0.0039823763,0.18931969,0.0041993936,0.09113437,0.016955333,0.00009139464],"about_ca_topic_score_codex":0.005777203,"about_ca_topic_score_gemma":0.008499348,"teacher_disagreement_score":0.005777203,"about_ca_system_score_codex":0.00031692028,"about_ca_system_score_gemma":0.000128969,"threshold_uncertainty_score":0.013281941},"labels":[],"label_agreement":null},{"id":"W1563914202","doi":"10.1007/11947950_1","title":"Distributed Security Algorithms by Mobile Agents","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Mobile agent; Distributed computing; Natural computing; Theoretical computer science; Mobile computing; Computer network","score_opus":0.013383201721492401,"score_gpt":0.2554056648301265,"score_spread":0.2420224631086341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563914202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064440207,0.0010236447,0.9730809,0.00068868,0.00022465548,0.000078129306,0.00002265301,0.0005059851,0.017931342],"genre_scores_gemma":[0.37731197,0.0018472888,0.56578225,0.00038230946,0.00030271505,0.00053054676,0.00013711954,0.00031866963,0.053387176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991394,0.0003410439,0.000040178293,0.00012528714,0.00028164135,0.00007238849],"domain_scores_gemma":[0.9980646,0.0011256571,0.00009276121,0.00046574793,0.00017864341,0.00007266711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011506436,0.0008519499,0.00076582225,0.0005944454,0.00077107974,0.001837422,0.0013941971,0.001407144,0.00631458],"category_scores_gemma":[0.0048661213,0.00054762594,0.0005639997,0.0007011112,0.0015868662,0.0029739551,0.0021319806,0.0027274627,0.001784174],"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.00017818867,0.00006289231,0.00019404665,0.00019261443,0.00004625013,0.00007843364,0.00022456092,0.08175967,0.0053109135,0.75140715,0.009693186,0.15085208],"study_design_scores_gemma":[0.00010380719,0.00007388046,0.00007121859,0.00005656546,0.000026201202,0.00015174037,0.000048373637,0.40199363,0.0050714454,0.55862707,0.03376056,0.000015470656],"about_ca_topic_score_codex":0.00028484038,"about_ca_topic_score_gemma":0.00029513377,"teacher_disagreement_score":0.00631458,"about_ca_system_score_codex":0.0007562188,"about_ca_system_score_gemma":0.00055069034,"threshold_uncertainty_score":0.021124363},"labels":[],"label_agreement":null},{"id":"W1563997662","doi":"10.1007/11513575_12","title":"Optimal Weighted Recombination","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Recombination; Computer science; Truncation (statistics); Selection (genetic algorithm); Mathematical optimization; Algorithm; Adaptation (eye); Mathematics; Artificial intelligence; Physics; Genetics; Machine learning; Biology; Gene","score_opus":0.02024485215873753,"score_gpt":0.27399965642453433,"score_spread":0.2537548042657968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563997662","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.009809604,0.001899777,0.8564956,0.00030966857,0.0004996594,0.000100866135,0.00017533766,0.00067320414,0.13003623],"genre_scores_gemma":[0.23448001,0.0018795605,0.56912434,0.00045400663,0.00028992843,0.0003010845,0.00089545676,0.0012238497,0.19135185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.00012417127,0.00001485847,0.00013328533,0.00017682646,0.00006458412],"domain_scores_gemma":[0.99973875,0.0000772102,0.000021388054,0.000084926774,0.000054831118,0.000022903314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953756,0.00083440426,0.000987306,0.0009476267,0.0007083522,0.0015232387,0.0014124446,0.0012906262,0.027928641],"category_scores_gemma":[0.0016476389,0.00046862548,0.0008092321,0.0011321607,0.0006738087,0.0014931756,0.0017008367,0.0014540504,0.005946679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002112915,0.00016869677,0.00020496463,0.0002756268,0.00008794262,0.000091592665,0.00010438307,0.08642157,0.01612505,0.44300538,0.02923318,0.42407042],"study_design_scores_gemma":[0.00007764794,0.00014479841,0.00041431808,0.00013434516,0.000083317274,0.00042756475,0.00006394751,0.4782429,0.015118039,0.39815193,0.10709481,0.000046401885],"about_ca_topic_score_codex":0.00034654833,"about_ca_topic_score_gemma":0.0004782061,"teacher_disagreement_score":0.027928641,"about_ca_system_score_codex":0.000553854,"about_ca_system_score_gemma":0.00050468725,"threshold_uncertainty_score":0.09343064},"labels":[],"label_agreement":null},{"id":"W1564046250","doi":"10.1007/978-3-642-02979-0_8","title":"A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic control and management","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Cellular automaton; Automaton; Deterministic automaton; Artificial intelligence","score_opus":0.0077810266290201,"score_gpt":0.18907263969909746,"score_spread":0.18129161307007735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564046250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13807747,0.0016366903,0.8041278,0.0012472837,0.00054751954,0.00014940584,0.0019020183,0.000940939,0.051370855],"genre_scores_gemma":[0.9392765,0.0007027,0.031978384,0.00012734444,0.000089347304,0.00016531901,0.0005165911,0.00009457976,0.027049242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996712,0.000073826,0.000016522383,0.00010002804,0.00006671576,0.00007162173],"domain_scores_gemma":[0.99945325,0.00023931291,0.00004988221,0.00005094678,0.00016769355,0.00003892251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029804112,0.0006955854,0.0013694696,0.00060671696,0.0008955226,0.0018213348,0.0022192502,0.002006221,0.005449479],"category_scores_gemma":[0.0012438998,0.00051245495,0.0011081446,0.0009947754,0.0009671477,0.0008764948,0.00070115767,0.0011558699,0.0011828898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000528627,0.00003410395,0.0004263845,0.000041364205,0.000027399448,0.0001805183,0.00008352739,0.9322529,0.0016290818,0.058273632,0.001251497,0.005746683],"study_design_scores_gemma":[0.000008998132,0.000012746673,0.000056835022,0.000004218156,0.000011361597,0.000021022484,0.000010838882,0.9899595,0.00011355579,0.009149762,0.0006431579,0.000008084757],"about_ca_topic_score_codex":0.03161914,"about_ca_topic_score_gemma":0.020196356,"teacher_disagreement_score":0.03161914,"about_ca_system_score_codex":0.0015190156,"about_ca_system_score_gemma":0.0014878453,"threshold_uncertainty_score":0.062870204},"labels":[],"label_agreement":null},{"id":"W1564075136","doi":"10.1007/978-3-642-04241-6_4","title":"Quantifying Systemic Evolutionary Changes by Color Coding Confidence-Scored PPI Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Probabilistic logic; Multicellular organism; Coding (social sciences); Binary number; Color-coding; Enhanced Data Rates for GSM Evolution; Confidence interval; Artificial intelligence; Theoretical computer science; Mathematics; Statistics; Biology; Genetics; Arithmetic","score_opus":0.01744083770156633,"score_gpt":0.23828598208012577,"score_spread":0.22084514437855945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564075136","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.5901578,0.0006645812,0.40105137,0.00018580047,0.00006879832,0.000043113985,0.0015507438,0.0013300912,0.0049477406],"genre_scores_gemma":[0.91027445,0.00021412336,0.08669946,0.00004273007,0.000034009143,0.000031602634,0.0014044308,0.00020856565,0.0010907006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909115,0.00017997088,0.000035946938,0.00027188816,0.0003348539,0.00008615455],"domain_scores_gemma":[0.9954092,0.002442997,0.0007750553,0.00050085376,0.00066407287,0.00020783453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013451935,0.0005407868,0.00053261296,0.0029464986,0.0003415831,0.0015633561,0.0010339505,0.0009191818,0.0019842698],"category_scores_gemma":[0.0073403767,0.00036551247,0.0004854748,0.003497145,0.0007001137,0.0013482801,0.0008946003,0.0009581535,0.00044754238],"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.0008566143,0.00017798814,0.107885726,0.00050415326,0.0005872682,0.0004595554,0.00028798808,0.18878305,0.27943462,0.022435803,0.0038241798,0.39476296],"study_design_scores_gemma":[0.000027934035,0.00012950067,0.09387401,0.000031119336,0.000126309,0.00067059137,0.0001015969,0.83895004,0.03634496,0.027972562,0.0016767832,0.00009457346],"about_ca_topic_score_codex":0.0012852547,"about_ca_topic_score_gemma":0.0025706172,"teacher_disagreement_score":0.0029464986,"about_ca_system_score_codex":0.0006616567,"about_ca_system_score_gemma":0.00025967666,"threshold_uncertainty_score":0.0071141124},"labels":[],"label_agreement":null},{"id":"W1564075183","doi":"10.1007/3-540-44886-1_68","title":"Multi-agent System Architecture for Tracking Moving Objects","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Acadia University","funders":"","keywords":"Global Positioning System; Computer science; Architecture; Tracking (education); Tracking system; Real-time computing; Track (disk drive); Object (grammar); Video tracking; Systems architecture; Embedded system; Computer vision; Artificial intelligence; Geography; Operating system; Kalman filter","score_opus":0.03178542660409157,"score_gpt":0.25694479311847856,"score_spread":0.225159366514387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564075183","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.015131665,0.00059024536,0.97273546,0.00022759101,0.00015290275,0.00010038468,0.00007036374,0.0038537772,0.0071375943],"genre_scores_gemma":[0.37307292,0.00066571904,0.60516,0.00014419548,0.000058934795,0.00031539312,0.00033136888,0.00015273511,0.020098781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997192,0.00006400313,0.000024893756,0.00006427226,0.000094579846,0.00003302803],"domain_scores_gemma":[0.9996611,0.000069343616,0.000024773895,0.000059048936,0.00014551682,0.00004028927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073979463,0.00046913637,0.0005860352,0.0005901316,0.0008878439,0.001407071,0.0021832492,0.0015380658,0.0047163297],"category_scores_gemma":[0.0010241527,0.0004207984,0.0003650848,0.00059895386,0.00035967334,0.0013266266,0.001054369,0.0008488031,0.0016717105],"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.00065249973,0.00032119165,0.0020834322,0.00041796116,0.00020985302,0.0006264666,0.0006579354,0.37449932,0.08133209,0.07406189,0.01568896,0.44944838],"study_design_scores_gemma":[0.00004219511,0.00011026727,0.0003548053,0.000023988618,0.00006498136,0.00013589556,0.00004029063,0.95941955,0.013542407,0.008839239,0.017400598,0.000025862593],"about_ca_topic_score_codex":0.003721537,"about_ca_topic_score_gemma":0.0049910215,"teacher_disagreement_score":0.0047163297,"about_ca_system_score_codex":0.0006702547,"about_ca_system_score_gemma":0.00091858604,"threshold_uncertainty_score":0.015777707},"labels":[],"label_agreement":null},{"id":"W1564080049","doi":"10.1007/978-3-642-17274-8_47","title":"Organizing and Browsing Image Search Results Based on Conceptual and Visual Similarities","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Zoom; Information retrieval; Image (mathematics); Image retrieval; Artificial intelligence; Computer vision","score_opus":0.021562733636307296,"score_gpt":0.2698872657749047,"score_spread":0.2483245321385974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564080049","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.53617454,0.012505041,0.41117746,0.0009777956,0.0003669593,0.0014612665,0.00392811,0.00690236,0.02650656],"genre_scores_gemma":[0.60273564,0.003899693,0.3803895,0.00018809843,0.00031041272,0.00035840017,0.0041300324,0.00074003625,0.007248159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993917,0.000057776608,0.00005800274,0.00010755374,0.00030142508,0.00008360324],"domain_scores_gemma":[0.9983967,0.00063656486,0.00012987391,0.00013419321,0.0005568826,0.00014584107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278809,0.0008461976,0.0014025323,0.013171554,0.0008044476,0.003060312,0.0010124713,0.0009215157,0.007629621],"category_scores_gemma":[0.0042900164,0.00040923027,0.00090834126,0.010721554,0.0005679151,0.004571494,0.0014246235,0.0005583123,0.0023507075],"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.0016589413,0.00059666263,0.020191105,0.0016004986,0.00026055818,0.0005314647,0.0016811814,0.0031281048,0.1160238,0.0082965605,0.022420293,0.8236109],"study_design_scores_gemma":[0.00062415755,0.0029148506,0.1145673,0.0009864678,0.002444418,0.005585745,0.010588303,0.47465006,0.20182985,0.101417676,0.08378048,0.0006107657],"about_ca_topic_score_codex":0.0039641224,"about_ca_topic_score_gemma":0.008560168,"teacher_disagreement_score":0.013171554,"about_ca_system_score_codex":0.000624049,"about_ca_system_score_gemma":0.0008463815,"threshold_uncertainty_score":0.025523663},"labels":[],"label_agreement":null},{"id":"W1564137013","doi":"10.1007/978-3-642-15120-0_10","title":"Algorithm for Grounding Mutation Mentions from Text to Protein Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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 New Brunswick","funders":"","keywords":"Computer science; Mutation; Context (archaeology); Identifier; Task (project management); Annotation; Precision and recall; Natural language processing; Computational biology; Information retrieval; Artificial intelligence; Data mining; Genetics; Biology; Programming language; Gene","score_opus":0.018840528726906752,"score_gpt":0.2836457604943696,"score_spread":0.26480523176746285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564137013","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.037987035,0.00054633257,0.91767496,0.00096568844,0.00038545384,0.0010133676,0.006955683,0.03164828,0.0028231486],"genre_scores_gemma":[0.060595192,0.0001392999,0.9242714,0.00025866585,0.000057730736,0.00032818125,0.009944337,0.0005013228,0.003903887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998988,0.00009947667,0.00011363528,0.00040449225,0.00030575963,0.00008868783],"domain_scores_gemma":[0.9966695,0.0018927914,0.00019649563,0.00038678947,0.0007529563,0.000101495236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015180606,0.0016045009,0.0014025578,0.005003571,0.0013064202,0.002177071,0.0028530376,0.00263438,0.010885854],"category_scores_gemma":[0.005564632,0.0008900363,0.0022054017,0.00315165,0.00085381255,0.0027587938,0.0022230367,0.001650289,0.004544198],"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.0004750435,0.00035614075,0.0052412343,0.00039329246,0.00024230451,0.0003819896,0.00024883766,0.020528965,0.010825191,0.006287958,0.028643986,0.9263752],"study_design_scores_gemma":[0.00038148556,0.000342647,0.0029560674,0.00022672594,0.00054007897,0.0008120406,0.0005068784,0.87637365,0.032512896,0.05268551,0.032594174,0.00006784514],"about_ca_topic_score_codex":0.006574345,"about_ca_topic_score_gemma":0.014607926,"teacher_disagreement_score":0.010885854,"about_ca_system_score_codex":0.0010690327,"about_ca_system_score_gemma":0.0028561403,"threshold_uncertainty_score":0.03641683},"labels":[],"label_agreement":null},{"id":"W1564201006","doi":"10.1007/978-3-642-02138-1_5","title":"On Model-Checking Optimistic Replication Algorithms","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Convergence (economics); Exploit; Model checking; Counterexample; Collaborative editing; Replication (statistics); Algorithm; Property (philosophy); Theoretical computer science; Distributed computing; Computer security; World Wide Web","score_opus":0.02399841025047516,"score_gpt":0.2661182656709419,"score_spread":0.2421198554204667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564201006","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.017336057,0.0006642812,0.9682548,0.0010172311,0.00026943587,0.0001824858,0.00018707433,0.0038482184,0.008240343],"genre_scores_gemma":[0.5488449,0.0009066702,0.43637103,0.0010550882,0.00051097566,0.00045853652,0.0010475395,0.0019217707,0.008883535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98880285,0.004079986,0.00064841047,0.0013745117,0.0040241894,0.0010699396],"domain_scores_gemma":[0.9512408,0.034240272,0.0014004558,0.0103006475,0.0022940973,0.00052375125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008821981,0.0023085987,0.0025151812,0.0019473102,0.0023579167,0.004786909,0.0076484755,0.0029410154,0.008481577],"category_scores_gemma":[0.043477148,0.0025471044,0.0034827674,0.0033168287,0.005341125,0.014095326,0.0077725486,0.0074020186,0.0013959063],"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.0012094154,0.0003471552,0.0016819822,0.00042434596,0.00025193702,0.00019753803,0.00043435165,0.39598945,0.004197825,0.4459903,0.009242329,0.14003335],"study_design_scores_gemma":[0.000101960846,0.000056970566,0.00010950137,0.00006087449,0.00006666609,0.000055829398,0.000044430875,0.48933512,0.0024538166,0.505612,0.0020684747,0.000034416396],"about_ca_topic_score_codex":0.0070677195,"about_ca_topic_score_gemma":0.007850784,"teacher_disagreement_score":0.008821981,"about_ca_system_score_codex":0.003857078,"about_ca_system_score_gemma":0.0038966693,"threshold_uncertainty_score":0.046655655},"labels":[],"label_agreement":null},{"id":"W1564203653","doi":"10.1007/978-3-642-04409-0_33","title":"Recommending Improvements to Web Applications Using Quality-Driven Heuristic Search","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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":"Université de Montréal","funders":"","keywords":"Computer science; Heuristic; Task (project management); Quality (philosophy); Navigability; Meta heuristic; Sequence (biology); Data mining; Machine learning; Information retrieval; Artificial intelligence; Algorithm","score_opus":0.05279766122977468,"score_gpt":0.33443998158726257,"score_spread":0.2816423203574879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564203653","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.3135391,0.0033914717,0.6655418,0.0010898745,0.00025047912,0.0009637413,0.00082465244,0.004980327,0.00941859],"genre_scores_gemma":[0.63842225,0.00063030893,0.35603738,0.0002875944,0.00012022378,0.0002314516,0.0011528024,0.00019657961,0.0029213657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876285,0.00028271283,0.000096681884,0.00024582457,0.0004949357,0.0001170381],"domain_scores_gemma":[0.9957858,0.0027893442,0.00030292151,0.00027634317,0.0007191872,0.00012628443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015848926,0.0011067733,0.0015222788,0.0043996326,0.00049999164,0.0010197986,0.0018011471,0.0020367266,0.0029023644],"category_scores_gemma":[0.008112886,0.0006257971,0.0014267531,0.0029651623,0.00048988423,0.0016742775,0.0006411258,0.0009077983,0.00050998176],"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.00061604043,0.0010322985,0.010662075,0.00058821734,0.00038024518,0.00032019184,0.00018757414,0.3949466,0.008190172,0.003980247,0.012479906,0.5666165],"study_design_scores_gemma":[0.000077995704,0.0002352411,0.0010007056,0.000024536354,0.000104459,0.00008223185,0.00005024738,0.9939813,0.0015947248,0.0021217896,0.00071295176,0.000013746462],"about_ca_topic_score_codex":0.0076287724,"about_ca_topic_score_gemma":0.015138384,"teacher_disagreement_score":0.0076287724,"about_ca_system_score_codex":0.0009272308,"about_ca_system_score_gemma":0.0015218498,"threshold_uncertainty_score":0.015168726},"labels":[],"label_agreement":null},{"id":"W1564203760","doi":"10.1007/978-3-642-12659-8_2","title":"Parallel Computations of Unsteady Three-Dimensional Flows in a High Pressure Turbine","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Combustion and flame dynamics","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 Ottawa","funders":"","keywords":"Transonic; Reynolds-averaged Navier–Stokes equations; Turbine; Stator; Computation; Mechanics; Rotor (electric); Computational fluid dynamics; Flow (mathematics); Computer science; Marine engineering; Aerospace engineering; Aerodynamics; Physics; Mechanical engineering; Engineering; Algorithm","score_opus":0.008595840351874917,"score_gpt":0.20880589059477694,"score_spread":0.20021005024290203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564203760","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.7984566,0.000501704,0.17446135,0.00083660486,0.00026681213,0.00006565381,0.00033567994,0.0018818834,0.023193736],"genre_scores_gemma":[0.95094454,0.00013745135,0.04349032,0.000067506306,0.00006753979,0.00004981188,0.00019266039,0.00023032539,0.0048197536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984646,0.00002954004,0.000009980604,0.000027600228,0.00005558167,0.000030777217],"domain_scores_gemma":[0.99929845,0.0003882403,0.000058474845,0.00006360085,0.00010257508,0.00008857987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037472433,0.00080632133,0.0010159318,0.00040851388,0.001322737,0.001269006,0.0012189774,0.0010221788,0.0041696997],"category_scores_gemma":[0.0013618979,0.00071231637,0.00060509105,0.0008314656,0.0012945696,0.0011270505,0.0010124395,0.000995092,0.00037545597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040977294,0.00013308348,0.001209108,0.000059250277,0.000033771415,0.00027435826,0.0001207997,0.96999604,0.0045905462,0.0052330075,0.0014202293,0.016520025],"study_design_scores_gemma":[0.00003398818,0.000025353389,0.0002888874,0.0000018769098,0.000004427932,0.000022305134,0.000018521961,0.9967092,0.0010556057,0.0016405904,0.00019439647,0.00000483578],"about_ca_topic_score_codex":0.008942171,"about_ca_topic_score_gemma":0.009171741,"teacher_disagreement_score":0.008942171,"about_ca_system_score_codex":0.00080921437,"about_ca_system_score_gemma":0.0010691533,"threshold_uncertainty_score":0.017780244},"labels":[],"label_agreement":null},{"id":"W156428143","doi":"10.1007/978-3-319-11379-1_13","title":"A Comparative Evaluation of Implicit Authentication Schemes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Benchmarking; Leverage (statistics); Overhead (engineering); Biometrics; Authentication (law); Mobile device; Data mining; Machine learning; Artificial intelligence; Computer security; World Wide Web; Operating system","score_opus":0.0476163768411037,"score_gpt":0.3147589231129773,"score_spread":0.2671425462718736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156428143","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.4971694,0.028926332,0.32887024,0.0032417395,0.001484439,0.0013117807,0.0015986458,0.0027889763,0.13460848],"genre_scores_gemma":[0.93710345,0.003241266,0.044537418,0.00014798994,0.00024699507,0.00016996021,0.0007159005,0.00020267331,0.013634337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9729327,0.012918903,0.0012897765,0.0012011632,0.00992883,0.0017286907],"domain_scores_gemma":[0.89979386,0.06571249,0.0031652644,0.01924509,0.010898476,0.0011848768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016861442,0.0012800687,0.0017858299,0.0030000214,0.001740382,0.0037253916,0.0036557796,0.0023110523,0.020490823],"category_scores_gemma":[0.05525112,0.00042193194,0.00081971136,0.0033569883,0.0024828517,0.010991311,0.0036306803,0.001969192,0.0024981033],"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.026595922,0.0020545593,0.0043242704,0.0031322087,0.00045593755,0.0001900935,0.0009058801,0.06508028,0.018562479,0.29596668,0.016514903,0.56621677],"study_design_scores_gemma":[0.0026511946,0.014494781,0.006399425,0.0010069975,0.0011209528,0.0015203911,0.0016700061,0.7108721,0.045665376,0.16672802,0.047510788,0.0003599943],"about_ca_topic_score_codex":0.001209304,"about_ca_topic_score_gemma":0.0012047539,"teacher_disagreement_score":0.020490823,"about_ca_system_score_codex":0.004367233,"about_ca_system_score_gemma":0.0024421492,"threshold_uncertainty_score":0.0891729},"labels":[],"label_agreement":null},{"id":"W1564293150","doi":"10.1007/11566489_8","title":"Effects of Latency on Telesurgery: An Experimental Study","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","cited_by":44,"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; Canadian Institute for Advanced Research","funders":"","keywords":"Testbed; Latency (audio); Computer science; Computer network; Communications satellite; Satellite; Real-time computing; Telecommunications; Engineering; Aerospace engineering","score_opus":0.009571371881037705,"score_gpt":0.24712763517853983,"score_spread":0.23755626329750212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564293150","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.99435884,0.00032728218,0.003708922,0.000048088445,0.000121083904,0.00018032557,0.0001855357,0.0000618662,0.0010081684],"genre_scores_gemma":[0.9938637,0.0006287446,0.002381547,0.000058068043,0.000143614,0.00032367156,0.00019919407,0.00012565205,0.0022759167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988398,0.00026383036,0.00014919245,0.00018756304,0.0002730859,0.00028665675],"domain_scores_gemma":[0.98540616,0.0110242115,0.00084714754,0.001155438,0.0008164875,0.00075050927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010086991,0.0014203766,0.0010166019,0.0006998772,0.00064185396,0.00075758965,0.0010183811,0.0010402635,0.012664908],"category_scores_gemma":[0.009040737,0.00055300473,0.00064350007,0.0005278222,0.0014909847,0.001447743,0.0010308527,0.0010330073,0.0008867249],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.120885365,0.023179257,0.004181526,0.0013083991,0.00010736912,0.0011264442,0.0021358195,0.0021667068,0.80911714,0.0016015088,0.00044335698,0.033747092],"study_design_scores_gemma":[0.009008968,0.39872882,0.041376323,0.0003164835,0.0012486266,0.002579122,0.002855457,0.010848407,0.5247041,0.0041560046,0.0039658896,0.00021179921],"about_ca_topic_score_codex":0.0007634574,"about_ca_topic_score_gemma":0.00043443043,"teacher_disagreement_score":0.012664908,"about_ca_system_score_codex":0.0002637503,"about_ca_system_score_gemma":0.00089739024,"threshold_uncertainty_score":0.042368352},"labels":[],"label_agreement":null},{"id":"W1564359292","doi":"10.1007/3-540-45251-6_10","title":"A Rigorous Approach to Modeling and Analyzing E-Commerce Architectures","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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":"Concordia University","funders":"","keywords":"Computer science; Context (archaeology); Architecture; Software engineering; Formal methods; Agent architecture; Formal specification; Formal verification; Artificial intelligence; Multi-agent system; Theoretical computer science","score_opus":0.02460994832111146,"score_gpt":0.2318171080734734,"score_spread":0.20720715975236192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564359292","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.0014445065,0.00029850635,0.99498296,0.00045889834,0.000028147226,0.00006262017,0.00006792437,0.00013855938,0.0025177686],"genre_scores_gemma":[0.083450116,0.0012170107,0.90985286,0.00028851235,0.00022175907,0.000482744,0.00030706488,0.00018983876,0.003990008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933049,0.0019578647,0.00065466645,0.00040553816,0.0032607964,0.00041616586],"domain_scores_gemma":[0.99125856,0.0048686396,0.0004777013,0.0017814545,0.0014135599,0.00020001372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060587022,0.0016443313,0.0018914362,0.0027117173,0.0017391051,0.005322402,0.0056964275,0.003062357,0.0036365776],"category_scores_gemma":[0.01792462,0.002665348,0.003673774,0.0027061752,0.005466163,0.008781122,0.0038948765,0.0077370717,0.0011046339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062395216,0.00006136157,0.00016470908,0.0000982487,0.000049909915,0.00007783371,0.000116734765,0.07993603,0.0006869201,0.905892,0.0011741411,0.011735792],"study_design_scores_gemma":[0.0000099593735,0.000014168522,0.000071352224,0.000029769119,0.000035784113,0.00003852719,0.000032856522,0.23735984,0.00046505823,0.75650877,0.0054193772,0.000014542248],"about_ca_topic_score_codex":0.00784677,"about_ca_topic_score_gemma":0.0091460245,"teacher_disagreement_score":0.00784677,"about_ca_system_score_codex":0.003262209,"about_ca_system_score_gemma":0.004725211,"threshold_uncertainty_score":0.032041907},"labels":[],"label_agreement":null},{"id":"W1564382958","doi":"10.1007/11546207_21","title":"Lookahead in Smodels Compared to Local Consistencies in CSP","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Local consistency; Solver; Set (abstract data type); Answer set programming; Constraint satisfaction problem; Consistency (knowledge bases); Constraint (computer-aided design); Constraint programming; Theoretical computer science; Algorithm; Mathematical optimization; Programming language; Artificial intelligence; Mathematics","score_opus":0.02586779464168893,"score_gpt":0.25176848063844814,"score_spread":0.22590068599675922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564382958","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.4104766,0.002291751,0.56053734,0.0014404905,0.0002754963,0.00016018034,0.0003885623,0.004821114,0.019608464],"genre_scores_gemma":[0.91206557,0.00034149634,0.08243979,0.00014676682,0.00007677959,0.00008730138,0.0003198521,0.0004502798,0.004072238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718446,0.001458769,0.0001332348,0.00032019542,0.000530721,0.0003725342],"domain_scores_gemma":[0.9800869,0.015585426,0.0006486958,0.0020485823,0.00095440255,0.0006759677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051887557,0.0007366455,0.0019024486,0.00091058516,0.00112928,0.0022627434,0.0021040956,0.0012523303,0.011089618],"category_scores_gemma":[0.014193379,0.0007316599,0.0007222914,0.0016907791,0.0018139172,0.007572796,0.0023306778,0.002798814,0.0008550203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005766552,0.000567706,0.002184178,0.00044832856,0.00012368335,0.00010494648,0.00038140014,0.6337645,0.0030481839,0.19422153,0.008258479,0.15113042],"study_design_scores_gemma":[0.00011246339,0.00027998904,0.00019852075,0.00002571617,0.000046838497,0.000019623625,0.00006003627,0.9166924,0.0012836106,0.08060863,0.0006567246,0.000015470863],"about_ca_topic_score_codex":0.0033573362,"about_ca_topic_score_gemma":0.005579047,"teacher_disagreement_score":0.011089618,"about_ca_system_score_codex":0.0013370846,"about_ca_system_score_gemma":0.002143806,"threshold_uncertainty_score":0.037098467},"labels":[],"label_agreement":null},{"id":"W1564397736","doi":"10.1007/11814948_6","title":"Minimum Witnesses for Unsatisfiable 2CNFs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Resolution (logic); Characterization (materials science); Time complexity; Computer science; Combinatorics; Tree (set theory); Graph; Dynamic programming; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence","score_opus":0.0248006996301742,"score_gpt":0.2767819911094897,"score_spread":0.2519812914793155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564397736","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.19177066,0.0012908347,0.7341655,0.0042370823,0.00080873526,0.0005589938,0.0038497078,0.003670918,0.05964765],"genre_scores_gemma":[0.6837462,0.0007844786,0.28862178,0.0006827821,0.00032938493,0.00048371637,0.0051685674,0.0009695936,0.019213533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764377,0.00039859948,0.00022005932,0.00046868977,0.0009384847,0.0003304591],"domain_scores_gemma":[0.9878154,0.008407206,0.0004490964,0.0017474078,0.0012408532,0.00034012608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023514973,0.0008324835,0.0011081509,0.0013295315,0.0014720367,0.0028736645,0.002018211,0.0021782978,0.018414827],"category_scores_gemma":[0.018454062,0.0010760593,0.0014358254,0.0012762764,0.0016316894,0.0065922635,0.0033994124,0.003859684,0.0013887514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010330804,0.00022388448,0.0030582973,0.0013344558,0.00014752828,0.00086433446,0.0013135578,0.021479499,0.016076948,0.7336506,0.020952793,0.19986497],"study_design_scores_gemma":[0.00013224526,0.00008335659,0.00087512966,0.00020817327,0.00009008037,0.00047504684,0.00033422332,0.052636217,0.012535247,0.9135988,0.018982196,0.000049284947],"about_ca_topic_score_codex":0.0016893655,"about_ca_topic_score_gemma":0.0046003945,"teacher_disagreement_score":0.018414827,"about_ca_system_score_codex":0.0015427411,"about_ca_system_score_gemma":0.0014668697,"threshold_uncertainty_score":0.061603725},"labels":[],"label_agreement":null},{"id":"W1564407722","doi":"10.1007/978-3-540-30134-9_67","title":"Analyzing the Temporal Sequences for Text Categorization","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Dalhousie University","funders":"","keywords":"Categorization; Computer science; Artificial intelligence; Classifier (UML); Text categorization; Cluster analysis; Pattern recognition (psychology); Representation (politics); Natural language processing","score_opus":0.025440861889619294,"score_gpt":0.2649863272172401,"score_spread":0.23954546532762078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564407722","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.20029831,0.010205283,0.76851106,0.0006460959,0.00044275686,0.00044468313,0.007364692,0.0050597633,0.0070273452],"genre_scores_gemma":[0.54998606,0.0028470214,0.42763326,0.00013078113,0.00039253544,0.00039192775,0.01300453,0.00033245335,0.0052814162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993036,0.00013941013,0.00007834412,0.00018622038,0.00021390524,0.000078451034],"domain_scores_gemma":[0.99758434,0.0013143114,0.00026787628,0.00021589162,0.0004794769,0.0001379681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011412873,0.0006785224,0.0006165578,0.006003106,0.0006475047,0.0010695232,0.0008043326,0.0007000894,0.0040501812],"category_scores_gemma":[0.0039369795,0.00024416717,0.0007661588,0.0058087194,0.00032629858,0.0018220744,0.0004766274,0.00066718826,0.002472015],"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.0006756896,0.00028936847,0.009252417,0.00045148612,0.00008939221,0.0002154078,0.00023055007,0.010399849,0.04174957,0.005160416,0.009442469,0.9220434],"study_design_scores_gemma":[0.000077004326,0.0005132425,0.01646645,0.0001970698,0.0002706817,0.001154215,0.00070672756,0.87617254,0.03653916,0.04028339,0.027534792,0.00008474888],"about_ca_topic_score_codex":0.0039422056,"about_ca_topic_score_gemma":0.004812853,"teacher_disagreement_score":0.006003106,"about_ca_system_score_codex":0.00054080563,"about_ca_system_score_gemma":0.000842788,"threshold_uncertainty_score":0.013549268},"labels":[],"label_agreement":null},{"id":"W1564556533","doi":"10.1007/978-3-540-88458-3_102","title":"Constrained Phase–Based Personalized Facial Feature Tracking","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Face (sociological concept); Feature (linguistics); Tracking (education); Similarity (geometry); Computer vision; Pattern recognition (psychology); Measure (data warehouse); Set (abstract data type); Similarity measure; Data mining; Image (mathematics)","score_opus":0.030474052203640474,"score_gpt":0.28284492132753064,"score_spread":0.2523708691238902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564556533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012108397,0.000249547,0.9832448,0.00005707377,0.00007804512,0.000045747798,0.00013059507,0.0009526912,0.0031331703],"genre_scores_gemma":[0.40708226,0.0006148172,0.5733185,0.00029760064,0.00011574349,0.00015950589,0.00088712096,0.0004767106,0.017047806],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950004,0.00007429041,0.0000149842135,0.0001550767,0.0001996385,0.000055880984],"domain_scores_gemma":[0.99968255,0.00008537202,0.000027024635,0.00011103456,0.00007517683,0.00001879627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038984368,0.0005858735,0.0009815014,0.0005793325,0.00037337092,0.0005585265,0.0013007054,0.0007149922,0.00493],"category_scores_gemma":[0.0010782214,0.0005047724,0.00045854034,0.0010601535,0.00030392464,0.0009360139,0.0011347525,0.00054744614,0.002330097],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005520651,0.00013945444,0.00073477975,0.00009242745,0.000074364005,0.000083442734,0.000072254035,0.06475623,0.109220564,0.004428699,0.00805084,0.8117948],"study_design_scores_gemma":[0.000028468865,0.0001000576,0.0019175286,0.000011430638,0.000034331948,0.00036969245,0.000024250225,0.9516912,0.036007904,0.003969506,0.0058161234,0.000029543033],"about_ca_topic_score_codex":0.0031143334,"about_ca_topic_score_gemma":0.0055412077,"teacher_disagreement_score":0.00493,"about_ca_system_score_codex":0.00034626716,"about_ca_system_score_gemma":0.0005141611,"threshold_uncertainty_score":0.016492486},"labels":[],"label_agreement":null},{"id":"W1564589071","doi":"10.1007/978-3-540-69828-9_9","title":"An Entity Resolution Framework for Deduplicating Proteins","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","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 Toronto","funders":"","keywords":"Computer science; Schema (genetic algorithms); Information retrieval; Data mining; Resolution (logic); Similarity (geometry); Database; Artificial intelligence; Image (mathematics)","score_opus":0.013616818637217733,"score_gpt":0.25511920573765245,"score_spread":0.24150238710043473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564589071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025104745,0.0005798861,0.9797691,0.00034636783,0.00012952686,0.00014681628,0.0010070055,0.01424278,0.001267871],"genre_scores_gemma":[0.031074954,0.0005664616,0.95892733,0.00021352964,0.00008030909,0.00015075025,0.0037192388,0.001172675,0.00409476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711466,0.00056352495,0.0004543822,0.00046723278,0.0012066782,0.00019343528],"domain_scores_gemma":[0.99381095,0.0020724896,0.00029907888,0.0026547848,0.0009736445,0.00018915052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064262813,0.0012710056,0.0017730109,0.002571373,0.0016197822,0.005336711,0.005450565,0.0020839593,0.0058874898],"category_scores_gemma":[0.009652432,0.0012331047,0.0021801922,0.0040858807,0.0010886405,0.007479455,0.004486597,0.002863995,0.0028964174],"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.0006028975,0.00031045987,0.002031941,0.0007807752,0.00020742317,0.000748649,0.00073532714,0.049611323,0.008767749,0.1409927,0.07677922,0.7184315],"study_design_scores_gemma":[0.00014289822,0.0001288712,0.00060152926,0.00018680612,0.00030215742,0.0011178014,0.00029521174,0.60973346,0.055530917,0.1946366,0.13712105,0.00020280686],"about_ca_topic_score_codex":0.0040728003,"about_ca_topic_score_gemma":0.005778438,"teacher_disagreement_score":0.0064262813,"about_ca_system_score_codex":0.001015376,"about_ca_system_score_gemma":0.0019217831,"threshold_uncertainty_score":0.033985794},"labels":[],"label_agreement":null},{"id":"W1564604309","doi":"10.1007/978-3-642-11615-5_2","title":"Characterization of Suction and CUSA Interaction with Brain Tissue","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automotive and Human Injury Biomechanics","field":"Medicine","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":"National Research Council Canada","funders":"","keywords":"Aspirator; Brain tissue; Computer science; Suction; Ultrasonic sensor; White matter; Biomedical engineering; Radiology; Medicine; Magnetic resonance imaging","score_opus":0.01225414633217089,"score_gpt":0.2676377849761778,"score_spread":0.2553836386440069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564604309","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.96903306,0.00247304,0.023766879,0.00009704164,0.000069356494,0.0000714206,0.00030021428,0.00019705176,0.003992095],"genre_scores_gemma":[0.9913879,0.00048527343,0.0054378794,0.000038926737,0.000019335113,0.000048655453,0.00020070252,0.000031736618,0.002349445],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998473,0.000016885006,0.0000091914235,0.000025502215,0.00007778949,0.000023260123],"domain_scores_gemma":[0.9995654,0.00015427316,0.000055875473,0.000043357333,0.00013835935,0.000042659503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021502466,0.00024629742,0.00025019536,0.0006482339,0.0004142225,0.00049657,0.00030327713,0.00043905413,0.0024278148],"category_scores_gemma":[0.00050380215,0.00019816398,0.00020711348,0.0003412643,0.00042023777,0.00038020336,0.0002948615,0.00019040442,0.0004349084],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012997584,0.000016148697,0.001179491,0.000057925652,0.0000052146806,0.00010693868,0.00010457518,0.00020475431,0.9892713,0.00010275516,0.00013342588,0.00868749],"study_design_scores_gemma":[0.000010091546,0.00060735014,0.05586485,0.000022845032,0.00004377961,0.0013879252,0.0004960206,0.008120219,0.92973775,0.00020223824,0.0034802642,0.000026615993],"about_ca_topic_score_codex":0.0007823664,"about_ca_topic_score_gemma":0.0010358385,"teacher_disagreement_score":0.0024278148,"about_ca_system_score_codex":0.00022512658,"about_ca_system_score_gemma":0.00026883784,"threshold_uncertainty_score":0.008121848},"labels":[],"label_agreement":null},{"id":"W1564629930","doi":"10.1007/978-3-642-19394-1_3","title":"Configuration Decision Making Using Simulation-Generated Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Variety (cybernetics); Distributed computing; Adaptation (eye); Set (abstract data type); Cloud computing; Service (business); Server; Operating system; Artificial intelligence","score_opus":0.06120402880399738,"score_gpt":0.30537277844754734,"score_spread":0.24416874964354995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564629930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.220599,0.00020686127,0.7581483,0.0005841062,0.00012524164,0.000435263,0.000459229,0.0038550163,0.015586924],"genre_scores_gemma":[0.9382325,0.00006527966,0.06006454,0.00003394632,0.000012774513,0.00010394639,0.00025343293,0.00008177315,0.0011517985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988587,0.00051526516,0.0000726719,0.0001795173,0.0002645749,0.00010934759],"domain_scores_gemma":[0.99297994,0.0055356133,0.00021821122,0.00048915506,0.00058780645,0.00018929648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022318985,0.00094898423,0.0009717131,0.0016078892,0.00062720326,0.0022602268,0.0013199546,0.0010065511,0.006983605],"category_scores_gemma":[0.008596459,0.00061283575,0.00068588444,0.0011660369,0.0007095112,0.0014987605,0.00064308103,0.00072756765,0.0006504771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041763438,0.00010583739,0.0012853958,0.0000473186,0.000040455263,0.00008066079,0.000045407927,0.9652398,0.0013175678,0.0031853318,0.000716451,0.027517987],"study_design_scores_gemma":[0.00001571786,0.00002057279,0.00011503102,0.000006661686,0.000008375179,0.00001024317,0.000011281681,0.9964814,0.0010023424,0.0021143192,0.000206863,0.000007072875],"about_ca_topic_score_codex":0.0050588534,"about_ca_topic_score_gemma":0.005232248,"teacher_disagreement_score":0.006983605,"about_ca_system_score_codex":0.0013429744,"about_ca_system_score_gemma":0.001397267,"threshold_uncertainty_score":0.023362517},"labels":[],"label_agreement":null},{"id":"W1564634725","doi":"10.1007/11776420_31","title":"Online Learning with Variable Stage Duration","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Stochastic game; Hindsight bias; Regret; Repeated game; Computer science; Minimax; Mathematical economics; Variable (mathematics); Duration (music); Term (time); Game theory; Mathematics; Machine learning; Psychology","score_opus":0.048767061172971984,"score_gpt":0.3533309066974802,"score_spread":0.3045638455245082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564634725","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.03115441,0.0007100815,0.9611899,0.0005264779,0.00012823388,0.00007693574,0.00014886202,0.0005940954,0.0054710065],"genre_scores_gemma":[0.7549266,0.0007935175,0.2041131,0.00037149887,0.00051464065,0.00042718463,0.00045887378,0.00021848167,0.03817601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986731,0.0004941798,0.000079162615,0.00031896055,0.000218161,0.00021654584],"domain_scores_gemma":[0.9843776,0.012832772,0.00040971275,0.001523027,0.00047792998,0.00037893842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040118727,0.00084800395,0.0020930464,0.00056143996,0.0006130113,0.0012645032,0.0032839538,0.0019973153,0.013737462],"category_scores_gemma":[0.013087016,0.00081673305,0.000911062,0.001262485,0.0011330502,0.005044631,0.002542355,0.0028947638,0.0015783114],"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.001479693,0.00069202826,0.0019251409,0.0003532341,0.00012716038,0.00015012684,0.00020065095,0.3704389,0.002328018,0.19807912,0.00960673,0.41461915],"study_design_scores_gemma":[0.00011260342,0.00017773689,0.00025229726,0.000024612433,0.00003476806,0.000038946815,0.000013981623,0.89552104,0.0009192282,0.10130216,0.0015878923,0.000014643982],"about_ca_topic_score_codex":0.0013832045,"about_ca_topic_score_gemma":0.0018999078,"teacher_disagreement_score":0.013737462,"about_ca_system_score_codex":0.0009860467,"about_ca_system_score_gemma":0.0012951696,"threshold_uncertainty_score":0.045956433},"labels":[],"label_agreement":null},{"id":"W1564649749","doi":"10.1007/11424918_40","title":"Voting Between Multiple Data Representations for Text Chunking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Voting; Computer science; Phrase; Chunking (psychology); Identification (biology); Focus (optics); Artificial intelligence; Natural language processing; Set (abstract data type); Training set; Condorcet method","score_opus":0.051626273531095314,"score_gpt":0.32918940770071725,"score_spread":0.2775631341696219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564649749","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.03453257,0.00095462566,0.9572948,0.00041292486,0.0003464568,0.00026784465,0.00072291994,0.0039525237,0.0015153204],"genre_scores_gemma":[0.36859682,0.00036571102,0.61971486,0.00027797936,0.00025468928,0.00042248322,0.004138767,0.0005524758,0.005676281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597067,0.0012303374,0.00049442786,0.0009672541,0.0009388177,0.000398552],"domain_scores_gemma":[0.99083066,0.004768164,0.00034164876,0.0021508595,0.0016131606,0.00029568945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052053714,0.0012047901,0.002270459,0.0027513718,0.000990405,0.0018909825,0.0030866528,0.0022351982,0.0050480547],"category_scores_gemma":[0.012611844,0.0007315093,0.0012922832,0.002581146,0.0007461154,0.0047154366,0.003164405,0.0021488501,0.0023508272],"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.0010187313,0.00022872943,0.0021638824,0.0002510104,0.00018599474,0.00013089296,0.00017238225,0.028207406,0.019379808,0.007153439,0.014717565,0.92639023],"study_design_scores_gemma":[0.00007886834,0.00019634476,0.0009098617,0.00006595116,0.00013198542,0.00013352849,0.00016917213,0.9305814,0.029349877,0.03278021,0.0055635097,0.000039200586],"about_ca_topic_score_codex":0.0020518582,"about_ca_topic_score_gemma":0.0042187776,"teacher_disagreement_score":0.0052053714,"about_ca_system_score_codex":0.00076672446,"about_ca_system_score_gemma":0.0015033116,"threshold_uncertainty_score":0.027529001},"labels":[],"label_agreement":null},{"id":"W1564691600","doi":"10.1007/3-540-45306-7_16","title":"Directly-Executable Earley Parsing","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Executable; Parsing; Programming language; LR parser; Parsing expression grammar; Grammar; Top-down parsing; Rule-based machine translation; Parser combinator; Artificial intelligence; Natural language processing; Bottom-up parsing; L-attributed grammar; Context-free grammar","score_opus":0.022598969185831437,"score_gpt":0.2428745586378418,"score_spread":0.22027558945201037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564691600","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.019251559,0.00091861497,0.8116718,0.0010208766,0.0006249635,0.00010647825,0.0017766714,0.045083188,0.11954576],"genre_scores_gemma":[0.31679577,0.0012125336,0.5782094,0.0007469501,0.00034443548,0.00009646371,0.005310047,0.016388621,0.08089581],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890935,0.00019714412,0.00009928839,0.000292356,0.00033246077,0.00016933538],"domain_scores_gemma":[0.9980902,0.00078175415,0.000044980017,0.00076592766,0.00027410896,0.000042924446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011326596,0.0011023318,0.0010056036,0.0011004866,0.000990187,0.0032956458,0.0018391686,0.0011979184,0.032358006],"category_scores_gemma":[0.0039307466,0.0011340372,0.0010107948,0.0016770182,0.001200712,0.007592722,0.0026224037,0.0025532623,0.012782158],"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.00022535239,0.00014058524,0.00073018944,0.00042630156,0.000038968803,0.00045331768,0.0006642376,0.0035576597,0.012888798,0.44916803,0.057708163,0.47399837],"study_design_scores_gemma":[0.00007265991,0.000039898197,0.00062701094,0.00014825759,0.00011279747,0.0009142579,0.00020516034,0.036766715,0.053082664,0.7338865,0.17404409,0.00010001692],"about_ca_topic_score_codex":0.0013595873,"about_ca_topic_score_gemma":0.0024463022,"teacher_disagreement_score":0.032358006,"about_ca_system_score_codex":0.0006946867,"about_ca_system_score_gemma":0.0012754003,"threshold_uncertainty_score":0.10824835},"labels":[],"label_agreement":null},{"id":"W1564715305","doi":"10.1007/3-540-46117-5_52","title":"Implementing the Discrete Cosine Transform Using the Xilinx Virtex FPGA","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Analog and Mixed-Signal Circuit Design","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":"University of Calgary","funders":"","keywords":"Discrete cosine transform; Virtex; Field-programmable gate array; Computer science; Quantization (signal processing); Power consumption; Mean squared error; Computer hardware; Algorithm; Power (physics); Mathematics; Artificial intelligence","score_opus":0.022066894634289177,"score_gpt":0.23379352920208457,"score_spread":0.2117266345677954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564715305","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.044194397,0.0016274013,0.87969613,0.0003449668,0.0009197939,0.0002761554,0.00040723072,0.016992072,0.055542007],"genre_scores_gemma":[0.29048726,0.0011032914,0.66965675,0.00031138258,0.00013553184,0.00013548906,0.0010734936,0.00085108145,0.036245696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982846,0.000021636044,0.000014894094,0.00002771,0.00007856076,0.000028736318],"domain_scores_gemma":[0.9998473,0.000043159587,0.000009130678,0.00003322695,0.00005610116,0.000011021201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002619934,0.0007001881,0.00037500632,0.00062940636,0.00024255109,0.0011684463,0.00067926326,0.00039349924,0.014500349],"category_scores_gemma":[0.0007010758,0.00025632785,0.0002603944,0.00047792972,0.0001375161,0.0005953543,0.00026304915,0.00048510538,0.0056796586],"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.00060178956,0.000105263854,0.001139747,0.00050783454,0.00010686005,0.00051256246,0.00016897454,0.010828773,0.21202776,0.02636299,0.023398321,0.7242391],"study_design_scores_gemma":[0.00041048852,0.00090099126,0.0032389364,0.00018787458,0.00016543642,0.0026116846,0.00017028843,0.21253553,0.59088683,0.011143376,0.17764714,0.000101297],"about_ca_topic_score_codex":0.0008968812,"about_ca_topic_score_gemma":0.0012426097,"teacher_disagreement_score":0.014500349,"about_ca_system_score_codex":0.00025865296,"about_ca_system_score_gemma":0.0003517785,"threshold_uncertainty_score":0.048508525},"labels":[],"label_agreement":null},{"id":"W1564746094","doi":"10.1007/978-3-642-04180-8_58","title":"Kernel-Based Copula Processes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Copula (linguistics); Computer science; Gaussian process; Gaussian; Kernel (algebra); Interdependence; Heteroscedasticity; Series (stratigraphy); Algorithm; Machine learning; Econometrics; Mathematics; Discrete mathematics","score_opus":0.013563922369210826,"score_gpt":0.2391933064908747,"score_spread":0.22562938412166386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564746094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012519124,0.00093046686,0.9753857,0.00021880055,0.00010523093,0.000017058015,0.000052425457,0.000279131,0.010492065],"genre_scores_gemma":[0.76945746,0.0030983577,0.17429599,0.000190503,0.0004412656,0.000091111484,0.00038271555,0.0006348792,0.05140766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993555,0.00020213713,0.000033453405,0.00013765557,0.00020569308,0.00006546249],"domain_scores_gemma":[0.99772674,0.0011297256,0.00020249555,0.00035885954,0.0004478984,0.00013422908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014057537,0.00076652464,0.0011276513,0.0009885931,0.00048317362,0.002298921,0.0015639032,0.001621885,0.006264744],"category_scores_gemma":[0.0075999014,0.0006005115,0.0011236571,0.0011944962,0.0012998675,0.003711447,0.0015154298,0.0021300095,0.0018772591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003487782,0.000036823214,0.00027214747,0.000069389294,0.00003758109,0.000081985745,0.00011974995,0.05426316,0.0017155468,0.9133099,0.0021979278,0.027860915],"study_design_scores_gemma":[0.0000074261916,0.000013933275,0.00033059117,0.000013961008,0.000015932526,0.00010884449,0.000018067834,0.58843505,0.000575081,0.4070619,0.0033944347,0.000024776244],"about_ca_topic_score_codex":0.0010822486,"about_ca_topic_score_gemma":0.00069645036,"teacher_disagreement_score":0.006264744,"about_ca_system_score_codex":0.0008188562,"about_ca_system_score_gemma":0.00046210247,"threshold_uncertainty_score":0.020957649},"labels":[],"label_agreement":null},{"id":"W156479812","doi":"10.1007/978-3-540-24672-5_3","title":"Decision Theoretic Modeling of Human Facial Displays","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Computer science; Artificial intelligence; Maximum a posteriori estimation; Machine learning; Context (archaeology); Markov decision process; Dynamic Bayesian network; Bayesian probability; Markov process; Markov chain; Markov model","score_opus":0.03276595637319037,"score_gpt":0.31267392093540414,"score_spread":0.2799079645622138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156479812","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.03053247,0.0005668514,0.9600174,0.00056834077,0.000047572044,0.00003044056,0.00016216373,0.00013464119,0.007940044],"genre_scores_gemma":[0.92159706,0.00091530575,0.061743412,0.00013098982,0.00008275429,0.0001722985,0.00026410047,0.00009052966,0.015003493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961984,0.00017975831,0.000010787926,0.00005641386,0.000077822915,0.000055304045],"domain_scores_gemma":[0.9988207,0.00094095885,0.000060892457,0.000039308303,0.000094475385,0.000043724383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100178,0.0006033651,0.00096801465,0.0004217363,0.00031193942,0.0012035881,0.0016635276,0.0011441567,0.004662692],"category_scores_gemma":[0.003365499,0.0006795213,0.0008647755,0.00055137236,0.00079604046,0.0011685175,0.0007436784,0.00109078,0.00044998198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002139894,0.0000145698095,0.00014721695,0.000020247207,0.00001391602,0.000018520033,0.00003413012,0.9430166,0.00044234932,0.05033303,0.0004871157,0.005450923],"study_design_scores_gemma":[0.0000014074689,0.0000025878182,0.000036955287,0.0000013670202,0.0000017496349,0.0000034007307,0.0000026621738,0.9885638,0.000031075873,0.011288222,0.0000648244,0.0000019885701],"about_ca_topic_score_codex":0.009275784,"about_ca_topic_score_gemma":0.005642995,"teacher_disagreement_score":0.009275784,"about_ca_system_score_codex":0.001204236,"about_ca_system_score_gemma":0.0007428752,"threshold_uncertainty_score":0.018443584},"labels":[],"label_agreement":null},{"id":"W1564831987","doi":"10.1007/11888116_22","title":"Composition of Use Cases Using Synchronization and Model Checking","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Composition (language); Synchronization (alternating current); Model checking; Property (philosophy); Theoretical computer science; Product (mathematics); Formal methods; Join (topology); Programming language; Mathematics","score_opus":0.05686202042845917,"score_gpt":0.28819831772173743,"score_spread":0.23133629729327826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564831987","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.014207433,0.000055229593,0.97630024,0.00009396581,0.000051091447,0.0005126513,0.000069038506,0.0038909696,0.0048194006],"genre_scores_gemma":[0.15912154,0.00017506571,0.83036286,0.00007975565,0.00003602587,0.00046241688,0.00047629632,0.0018338867,0.007452141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98652875,0.0030670166,0.0011836835,0.0018222857,0.0063712997,0.0010269374],"domain_scores_gemma":[0.98247355,0.008671026,0.00091791904,0.0052952063,0.002216885,0.0004254333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007065742,0.0017394205,0.0016245912,0.0030824419,0.0018606457,0.0038334955,0.003187352,0.002010724,0.011087788],"category_scores_gemma":[0.024636395,0.002684152,0.0035096866,0.0017129781,0.0027160873,0.006391475,0.0052481988,0.0033955006,0.002505816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011709534,0.0014351945,0.0071345633,0.0011884584,0.0004704359,0.0034885306,0.0033390746,0.112952955,0.07460277,0.24310884,0.0061733075,0.5449349],"study_design_scores_gemma":[0.00022293,0.00027510154,0.00092797016,0.00026287787,0.00054799346,0.001071056,0.0003793951,0.6603691,0.13974914,0.16015913,0.03587667,0.00015857919],"about_ca_topic_score_codex":0.003293067,"about_ca_topic_score_gemma":0.0047536544,"teacher_disagreement_score":0.011087788,"about_ca_system_score_codex":0.0010873543,"about_ca_system_score_gemma":0.0034656674,"threshold_uncertainty_score":0.037367642},"labels":[],"label_agreement":null},{"id":"W1564896067","doi":"10.1007/978-3-540-73599-1_37","title":"Categorical Representation of Evolving Structure of an Ontology for Clinical Fungus","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mycorrhizal Fungi and Plant Interactions","field":"Agricultural and Biological Sciences","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":"Computer science; Ontology; Ontology components; Knowledge representation and reasoning; Open Biomedical Ontologies; Notation; Process ontology; Description logic; Taxonomy (biology); Categorical variable; Information retrieval; Representation (politics); Ontology alignment; Semantic Web; Domain (mathematical analysis); Upper ontology; Data science; Artificial intelligence; Ecology; Linguistics; Machine learning","score_opus":0.058117749920304496,"score_gpt":0.33241106775218704,"score_spread":0.27429331783188254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564896067","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.111797735,0.00062505127,0.82540894,0.0024754591,0.00035374655,0.0003307027,0.02181484,0.0055010044,0.03169241],"genre_scores_gemma":[0.55002326,0.000503478,0.41993442,0.0002715335,0.000090619425,0.00028498072,0.020592172,0.00038426652,0.007915248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936014,0.00010629065,0.00008263648,0.00017664339,0.00018490435,0.00008930329],"domain_scores_gemma":[0.99843365,0.00061620143,0.00013774347,0.00023048955,0.0004576372,0.00012430744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007637328,0.0002889751,0.00022478384,0.003035967,0.0007459835,0.0018460654,0.00091827713,0.0009987334,0.005005328],"category_scores_gemma":[0.0030922163,0.00020534827,0.0011540651,0.0018675383,0.00068250677,0.0025175894,0.0010559864,0.0007996289,0.00069543824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021069194,0.00013169146,0.02047718,0.00056687644,0.00009392896,0.0014532977,0.00417605,0.021798197,0.017250221,0.7789934,0.019106176,0.13574222],"study_design_scores_gemma":[0.00003728488,0.000092833885,0.014243455,0.00023772773,0.00022070589,0.0012281702,0.001711003,0.22998455,0.0092049455,0.5481386,0.1947949,0.00010581225],"about_ca_topic_score_codex":0.020283509,"about_ca_topic_score_gemma":0.023508841,"teacher_disagreement_score":0.020283509,"about_ca_system_score_codex":0.0017080585,"about_ca_system_score_gemma":0.0016553742,"threshold_uncertainty_score":0.040330887},"labels":[],"label_agreement":null},{"id":"W1564896476","doi":"10.1007/978-3-642-15745-5_12","title":"An Anthropomorphic Polyvinyl Alcohol Triple-Modality Brain Phantom Based on Colin27","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Imaging phantom; Modality (human–computer interaction); Biomedical engineering; Inflatable; Computer science; Polyvinyl alcohol; Artificial intelligence; Magnetic resonance imaging; Segmentation; Computer vision; Medical imaging; Image processing; Materials science; Nuclear medicine; Medicine; Radiology; Image (mathematics)","score_opus":0.0204274157942088,"score_gpt":0.36472512341060204,"score_spread":0.3442977076163932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564896476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23236382,0.0027206466,0.72165704,0.0018574371,0.00043226965,0.00056365307,0.0013554399,0.0036798657,0.035369787],"genre_scores_gemma":[0.58327407,0.0016073064,0.39978036,0.00073195755,0.000055560664,0.00023765427,0.00071465585,0.00078379596,0.012814638],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985135,0.000043349806,0.000011558509,0.000023995693,0.000052342184,0.000017416447],"domain_scores_gemma":[0.9994622,0.00025524056,0.00006189387,0.00009874647,0.00007745239,0.00004457211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006270252,0.0005903654,0.0003296938,0.00061605586,0.00029912544,0.00097014976,0.000782982,0.0012831693,0.0066594207],"category_scores_gemma":[0.0010932622,0.0004664077,0.00025233923,0.00067413494,0.00039673626,0.00084510806,0.0007899827,0.00067175686,0.0014728121],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025164713,0.00030301537,0.0024261465,0.0009867367,0.00007900215,0.00561683,0.00067899673,0.015880905,0.821343,0.00856181,0.006991038,0.13461605],"study_design_scores_gemma":[0.0003158403,0.0023853101,0.008747505,0.000518257,0.00046278446,0.037931915,0.00041486268,0.084501736,0.7647544,0.0038033049,0.09582972,0.00033447592],"about_ca_topic_score_codex":0.0010056131,"about_ca_topic_score_gemma":0.0011491211,"teacher_disagreement_score":0.0066594207,"about_ca_system_score_codex":0.00023289146,"about_ca_system_score_gemma":0.0009952296,"threshold_uncertainty_score":0.022277951},"labels":[],"label_agreement":null},{"id":"W1564906636","doi":"10.1007/978-3-540-74260-9_96","title":"Scale-Adaptive Segmentation and Recognition of Individual Trees Based on LiDAR Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Université du Québec en Outaouais","funders":"","keywords":"Tree (set theory); Computer science; Segmentation; Lidar; Artificial intelligence; Scale (ratio); Pattern recognition (psychology); Feature (linguistics); Image segmentation; Decision tree; Pixel; Mathematical morphology; Computer vision; Image (mathematics); Remote sensing; Image processing; Mathematics; Geography; Cartography","score_opus":0.04432060095249486,"score_gpt":0.26728532063747684,"score_spread":0.222964719684982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564906636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045790486,0.00059782737,0.9479179,0.00007180359,0.000058204078,0.00007221508,0.0002972622,0.0027195087,0.0024748354],"genre_scores_gemma":[0.18559533,0.0006801717,0.80947024,0.00007191547,0.000053796073,0.00008089067,0.0009607522,0.0004174157,0.00266954],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974996,0.000015418522,0.000014085862,0.00008171899,0.00010080522,0.0000379846],"domain_scores_gemma":[0.99969685,0.000088439585,0.000028685745,0.00006579007,0.000101650534,0.000018542592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002744089,0.00050732313,0.0008256449,0.0013557238,0.0003393799,0.0010846525,0.00122261,0.00081074913,0.0020455448],"category_scores_gemma":[0.0006391698,0.0006426206,0.00072066876,0.0019126548,0.00036691173,0.0011153341,0.0006084313,0.0005431012,0.0017320442],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102483835,0.000068404246,0.0018055717,0.00015276151,0.00004477127,0.00010292312,0.00017715049,0.020461101,0.2521203,0.002061606,0.00294104,0.7199618],"study_design_scores_gemma":[0.000022295197,0.00012062491,0.015247476,0.000050149465,0.00010143579,0.0008891936,0.00020607394,0.7771808,0.18032065,0.011305933,0.014477336,0.0000780215],"about_ca_topic_score_codex":0.0018942686,"about_ca_topic_score_gemma":0.0045382315,"teacher_disagreement_score":0.0020455448,"about_ca_system_score_codex":0.00023068833,"about_ca_system_score_gemma":0.00044443822,"threshold_uncertainty_score":0.0068430305},"labels":[],"label_agreement":null},{"id":"W1565005275","doi":"10.1007/11744078_18","title":"Oriented Visibility for Multiview Reconstruction","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Visibility; Computer science; Computer vision; Computer graphics (images); Artificial intelligence; Optics","score_opus":0.017159648095561468,"score_gpt":0.28123073437187124,"score_spread":0.26407108627630976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565005275","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.0015723073,0.0009876788,0.9925976,0.000045045937,0.00007563658,0.000009170063,0.000033686374,0.00034987577,0.004329032],"genre_scores_gemma":[0.08712378,0.004361033,0.8865751,0.00012671556,0.00023333202,0.00006077028,0.00038667003,0.00062726875,0.02050531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998217,0.000029635557,0.000008190474,0.00003825074,0.00008504543,0.000017151942],"domain_scores_gemma":[0.99985373,0.000050326642,0.000013208095,0.0000427212,0.000031373995,0.000008634179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001727347,0.00069884444,0.00052363693,0.0006035592,0.00018299892,0.0008920391,0.00066161325,0.0005156226,0.0064154514],"category_scores_gemma":[0.00068616064,0.00037963782,0.00046420153,0.000825711,0.0003893102,0.0011357891,0.0010321853,0.0010555218,0.002187499],"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.00007934781,0.000030045858,0.00012541383,0.00030362813,0.00003815331,0.00012405418,0.00010927902,0.014870861,0.047497615,0.2008898,0.012655807,0.7232761],"study_design_scores_gemma":[0.000033303193,0.00008867961,0.0005094538,0.000116965355,0.000067701076,0.0011138429,0.00008508624,0.4539925,0.055080365,0.35056275,0.13829428,0.000055127995],"about_ca_topic_score_codex":0.0005632744,"about_ca_topic_score_gemma":0.00076988444,"teacher_disagreement_score":0.0064154514,"about_ca_system_score_codex":0.0002160936,"about_ca_system_score_gemma":0.00019854073,"threshold_uncertainty_score":0.021461844},"labels":[],"label_agreement":null},{"id":"W1565072834","doi":"10.1007/11557654_57","title":"Improving Scheduling Decisions by Using Knowledge About Parallel Applications Resource Usage","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scheduling (production processes); Processor scheduling; Resource (disambiguation); Operations research; Distributed computing; Mathematical optimization; Computer network","score_opus":0.02509042822681309,"score_gpt":0.27414571661052395,"score_spread":0.24905528838371085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565072834","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.15932514,0.001841498,0.8248939,0.0010642837,0.00020903644,0.00009232426,0.0004092442,0.003005442,0.009159134],"genre_scores_gemma":[0.8387925,0.0008330728,0.15754338,0.00018832643,0.00020149273,0.00004663523,0.00056064915,0.0002798757,0.0015540266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939835,0.00011102587,0.00004553977,0.00018118108,0.00019958771,0.000064373075],"domain_scores_gemma":[0.99566394,0.002829807,0.0004319315,0.00047470344,0.00046162435,0.0001379983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010439596,0.0010739216,0.0011103568,0.0011119441,0.00046550628,0.0012727802,0.0012453734,0.0008471459,0.0021146045],"category_scores_gemma":[0.008526342,0.0007635789,0.00060430175,0.0012318317,0.00034401307,0.003099887,0.00061703153,0.0015846866,0.00068227237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005246829,0.00046863456,0.0064908345,0.00020733532,0.0001351345,0.00010284522,0.00010649257,0.54336655,0.020951042,0.0029762855,0.003887252,0.42078295],"study_design_scores_gemma":[0.000016863325,0.000037139158,0.0011343348,0.000012755962,0.000041800824,0.000028453132,0.000015534126,0.9857765,0.004324065,0.007970755,0.0006279794,0.000013974376],"about_ca_topic_score_codex":0.004538815,"about_ca_topic_score_gemma":0.007894662,"teacher_disagreement_score":0.004538815,"about_ca_system_score_codex":0.0007800537,"about_ca_system_score_gemma":0.0014933015,"threshold_uncertainty_score":0.009024799},"labels":[],"label_agreement":null},{"id":"W1565096062","doi":"10.1007/11729976_1","title":"802.11 De-authentication Attack Detection Using Genetic Programming","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Intrusion detection system; Authentication (law); Protocol (science); Genetic algorithm; Fitness function; Set (abstract data type); Feature (linguistics); Focus (optics); Wireless; Wireless network; Computer network; Computer security; Artificial intelligence; Machine learning; Operating system; Programming language","score_opus":0.020709829520390997,"score_gpt":0.2517279949210712,"score_spread":0.23101816540068018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565096062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10705244,0.00022973906,0.88355833,0.00033015606,0.00006763256,0.000075782154,0.00004426772,0.0015996906,0.007042012],"genre_scores_gemma":[0.69326437,0.00023070206,0.29974878,0.00013312152,0.000030268193,0.00012827603,0.00011491255,0.00013264439,0.006216838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969614,0.00007720426,0.000012304817,0.000059646707,0.0001056268,0.00004916761],"domain_scores_gemma":[0.99937326,0.00038345339,0.00005798408,0.000045154047,0.00012491283,0.000015123629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005664479,0.0005525766,0.00039718868,0.0005386059,0.00029403283,0.00066369487,0.00080696744,0.0007668227,0.0011631087],"category_scores_gemma":[0.0017055625,0.000242032,0.00039958258,0.00041505933,0.0004437894,0.0004966228,0.0003686434,0.00081286294,0.00025977127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017765517,0.00021662873,0.002673448,0.000058198108,0.000079498925,0.000106882755,0.00010662986,0.6780756,0.025525399,0.01490799,0.0016897576,0.27638227],"study_design_scores_gemma":[0.000010747241,0.000032961034,0.00031205793,0.0000060887464,0.000015371064,0.000028005801,0.000007860149,0.9912374,0.0049579097,0.0029174606,0.0004677484,0.000006413396],"about_ca_topic_score_codex":0.003249208,"about_ca_topic_score_gemma":0.002032629,"teacher_disagreement_score":0.003249208,"about_ca_system_score_codex":0.0005402821,"about_ca_system_score_gemma":0.0004954323,"threshold_uncertainty_score":0.0064605474},"labels":[],"label_agreement":null},{"id":"W1565098934","doi":"10.1007/978-3-540-24749-4_16","title":"On Minimizing the Total Weighted Tardiness on a Single Machine","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University","funders":"","keywords":"Tardiness; Computer science; Scheduling (production processes); Bounded function; Mathematical optimization; Due date; Schedule; Set (abstract data type); Single-machine scheduling; Value (mathematics); Algorithm; Randomized algorithm; Job shop scheduling; Mathematics; Machine learning","score_opus":0.010607506777611143,"score_gpt":0.20728305795002172,"score_spread":0.1966755511724106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565098934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053384673,0.0012856298,0.93470365,0.00054294313,0.00040045037,0.00016029298,0.0001931293,0.00033038776,0.008998939],"genre_scores_gemma":[0.43695477,0.004317657,0.52424437,0.00040384955,0.0009870947,0.00051137054,0.0006855256,0.0014134774,0.03048192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993635,0.00023407729,0.00003008983,0.0001099674,0.00017619626,0.000086137195],"domain_scores_gemma":[0.9984603,0.0011033365,0.00009724831,0.00010807073,0.00015346565,0.00007762841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330007,0.0022815696,0.0025326468,0.00090983324,0.0007155184,0.001155055,0.0022236377,0.001288642,0.00490346],"category_scores_gemma":[0.0029706822,0.00077747006,0.00094266987,0.0024944618,0.0010181991,0.0022239583,0.0011551451,0.0015262556,0.00076561765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040704702,0.0001261833,0.00027369862,0.0004891305,0.0000761922,0.00011472324,0.00009303179,0.89087915,0.0067114104,0.01907923,0.004993241,0.07675693],"study_design_scores_gemma":[0.000050180268,0.00028338865,0.0004145897,0.00003452479,0.00003132215,0.00006598022,0.000038978294,0.9464942,0.0017030444,0.049249686,0.0016133436,0.000020717767],"about_ca_topic_score_codex":0.002754904,"about_ca_topic_score_gemma":0.0026095777,"teacher_disagreement_score":0.00490346,"about_ca_system_score_codex":0.0010128012,"about_ca_system_score_gemma":0.0011535337,"threshold_uncertainty_score":0.016403735},"labels":[],"label_agreement":null},{"id":"W1565104422","doi":"10.1007/978-3-540-75759-7_30","title":"Detecting Mechanical Abnormalities in Prostate Tissue Using FE-Based Image Registration","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Western University","funders":"","keywords":"Imaging phantom; Elastography; Prostate; Stiffness; Biomedical engineering; Image registration; Ultrasound elastography; Ultrasound; Deformation (meteorology); Finite element method; Materials science; Nuclear medicine; Computer science; Computer vision; Medicine; Image (mathematics); Radiology; Structural engineering; Engineering; Cancer; Composite material","score_opus":0.014439606689357983,"score_gpt":0.289370724499811,"score_spread":0.274931117810453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565104422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1881807,0.000791237,0.8056253,0.00024374196,0.00007060199,0.00013875224,0.00011997039,0.002427277,0.00240246],"genre_scores_gemma":[0.7045645,0.0004275227,0.29238042,0.00009868796,0.000050908508,0.00007176711,0.000273244,0.00036826622,0.001764614],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995359,0.000091459726,0.00003519404,0.000086203334,0.00020321882,0.000047965746],"domain_scores_gemma":[0.9988667,0.0004342401,0.00015286803,0.00021667666,0.00028795088,0.000041609932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977422,0.00063363125,0.0007486851,0.0021234248,0.00037310334,0.0011537123,0.0008222896,0.0014638528,0.0014486678],"category_scores_gemma":[0.0039659603,0.00057494314,0.00060814316,0.00088377943,0.00044492568,0.0010064873,0.000638546,0.00071825396,0.0007547389],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009487682,0.0004003945,0.012242198,0.00039237185,0.00020982041,0.000605856,0.00028640838,0.07234257,0.49239907,0.0018890267,0.0013760759,0.41690746],"study_design_scores_gemma":[0.000051755225,0.00031418406,0.023185328,0.00003954822,0.00014080797,0.0028084593,0.00014384462,0.83403075,0.13527422,0.001832705,0.0021012577,0.00007713824],"about_ca_topic_score_codex":0.0010128606,"about_ca_topic_score_gemma":0.0013962415,"teacher_disagreement_score":0.0021234248,"about_ca_system_score_codex":0.0002196139,"about_ca_system_score_gemma":0.00039379645,"threshold_uncertainty_score":0.004846275},"labels":[],"label_agreement":null},{"id":"W1565192079","doi":"10.1007/978-3-540-49823-0_22","title":"Logarithmic Keying of Communication Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","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 Alberta","funders":"","keywords":"Computer science; Logarithm; Computer network; Keying; Process (computing); Scheme (mathematics); Encryption; Telecommunications network; Distributed computing; Theoretical computer science; Telecommunications; Mathematics","score_opus":0.013361628019444363,"score_gpt":0.23051941136705068,"score_spread":0.21715778334760633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565192079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027127273,0.027813468,0.637094,0.0053560683,0.0024788065,0.000113534414,0.0005173894,0.0009682136,0.29853135],"genre_scores_gemma":[0.7395467,0.024590075,0.077441685,0.0011063954,0.0030997135,0.00034330666,0.000523158,0.00044233582,0.15290663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952996,0.00014683102,0.000025841271,0.000080822276,0.00015675086,0.000059701615],"domain_scores_gemma":[0.9991291,0.00044203887,0.00006412146,0.00021409093,0.00010455085,0.0000461265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005716888,0.0009338768,0.00068398914,0.0008634269,0.0005602762,0.0020310122,0.0007364471,0.00063653116,0.010902867],"category_scores_gemma":[0.002996381,0.00029719048,0.0003134084,0.0016773336,0.0018596126,0.0040977043,0.0012523553,0.0024518813,0.0029682766],"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.00006007723,0.00001388941,0.000044301003,0.00013578024,0.0000060979414,0.00002937955,0.000067417226,0.0040667583,0.0018690994,0.93155026,0.010070984,0.052085932],"study_design_scores_gemma":[0.000017658285,0.000020955418,0.000070233684,0.000031032752,0.000005730581,0.000080069825,0.000019560466,0.010359464,0.0008067354,0.96281207,0.025767861,0.000008580572],"about_ca_topic_score_codex":0.00029979605,"about_ca_topic_score_gemma":0.00021878355,"teacher_disagreement_score":0.010902867,"about_ca_system_score_codex":0.001572841,"about_ca_system_score_gemma":0.0005531773,"threshold_uncertainty_score":0.03647369},"labels":[],"label_agreement":null},{"id":"W1565251572","doi":"10.1007/11925941_5","title":"Handling Free Riders in Peer-to-Peer Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Upload; Computer science; Peer-to-peer; Incentive; Service (business); Download; Free rider problem; Internet privacy; Free riding; Computer security; Reputation system; World Wide Web; Business; Marketing; Microeconomics","score_opus":0.016673515596702937,"score_gpt":0.23895828816817266,"score_spread":0.22228477257146972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565251572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08807965,0.006509557,0.8562113,0.0018004692,0.0011320558,0.0007998751,0.00024653485,0.003148026,0.042072557],"genre_scores_gemma":[0.81339985,0.0031169085,0.12439629,0.0002947761,0.0007325182,0.0003886094,0.00031929088,0.0005040945,0.05684777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981324,0.00045266523,0.000110073626,0.00029042334,0.0006583402,0.00035606726],"domain_scores_gemma":[0.99512637,0.0028611447,0.00023120391,0.0007066869,0.000720856,0.00035366998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025531761,0.0009340722,0.0022861417,0.0010110977,0.0033686147,0.0033457184,0.0040019164,0.003061294,0.010662617],"category_scores_gemma":[0.0099774925,0.0009024466,0.0006239191,0.0013113037,0.001365474,0.007896907,0.003981773,0.0020409808,0.0021952048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012945285,0.0005587458,0.002451028,0.0016503892,0.00024586727,0.0022377835,0.0031302148,0.25140744,0.011849172,0.28153107,0.05630997,0.38733384],"study_design_scores_gemma":[0.00016476204,0.00028529344,0.0005954578,0.00011694536,0.0001365618,0.0010123544,0.0010314421,0.66785145,0.0068862494,0.27403632,0.04777885,0.000104415085],"about_ca_topic_score_codex":0.0028036588,"about_ca_topic_score_gemma":0.0028320341,"teacher_disagreement_score":0.010662617,"about_ca_system_score_codex":0.00086710934,"about_ca_system_score_gemma":0.0010491102,"threshold_uncertainty_score":0.035669982},"labels":[],"label_agreement":null},{"id":"W1565319486","doi":"10.1007/978-3-540-45135-8_11","title":"Adaptive Synchronisation for a RoboCup Agent","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"University of British Columbia","funders":"","keywords":"Correctness; Computer science; Action (physics); Deliberation; Coherence (philosophical gambling strategy); Artificial intelligence; Outcome (game theory); Measure (data warehouse); Distributed computing; Algorithm; Data mining","score_opus":0.02581134598750506,"score_gpt":0.23455609555549842,"score_spread":0.20874474956799335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565319486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052944686,0.00024526264,0.9219138,0.0002597389,0.00020517256,0.00008110557,0.00003555582,0.0018097645,0.02250496],"genre_scores_gemma":[0.85571235,0.00014096446,0.12340238,0.00007687207,0.000056305045,0.00012867365,0.00007160306,0.00015233013,0.020258514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998975,0.000015638116,0.000006500337,0.000028143562,0.000035484525,0.000016641927],"domain_scores_gemma":[0.99988484,0.000042427957,0.000011199731,0.00002221558,0.000025250705,0.000014017498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019101104,0.00032085483,0.00032704818,0.00027298674,0.0004431251,0.0005732663,0.00076420896,0.00064324035,0.0037624456],"category_scores_gemma":[0.0006305129,0.00017834321,0.00022599715,0.0001622089,0.00036550986,0.0005653064,0.00085708854,0.00056856155,0.0007233415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090680446,0.0002140224,0.0009218139,0.0002997606,0.00007500139,0.0007281102,0.0008167098,0.36662003,0.15572162,0.15038702,0.0064776023,0.3168316],"study_design_scores_gemma":[0.00009872519,0.00017671095,0.0002661775,0.000013124211,0.000026259877,0.00015849032,0.00004601172,0.95429575,0.017271345,0.016959222,0.0106666135,0.000021590735],"about_ca_topic_score_codex":0.00089365593,"about_ca_topic_score_gemma":0.0011434479,"teacher_disagreement_score":0.0037624456,"about_ca_system_score_codex":0.00023317165,"about_ca_system_score_gemma":0.00023218023,"threshold_uncertainty_score":0.012586653},"labels":[],"label_agreement":null},{"id":"W1565327656","doi":"10.1007/11560326_7","title":"A Passive External Web Surveillance Technique for Private Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Session (web analytics); World Wide Web; Chaining; Web navigation; The Internet; Web page; Gateway (web page); Hyperlink; Host (biology); Botnet","score_opus":0.009920886109777077,"score_gpt":0.2345043287330145,"score_spread":0.22458344262323743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565327656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054254968,0.00041810833,0.93092316,0.00009436388,0.00011303403,0.000096070544,0.00004876141,0.0016707826,0.012380789],"genre_scores_gemma":[0.62216175,0.0005175756,0.34954652,0.00017049366,0.00013326609,0.00008731731,0.00020586203,0.00032915722,0.026848057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940205,0.00010396278,0.000022351513,0.000107356864,0.0003054908,0.00005878341],"domain_scores_gemma":[0.9991905,0.00018523705,0.00005277841,0.00036030918,0.00017284839,0.00003833582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036051063,0.00043083276,0.000503439,0.0006213126,0.00054038025,0.0007134954,0.00084502803,0.0005372948,0.0032848248],"category_scores_gemma":[0.0009130934,0.0002715098,0.0003779008,0.00043588996,0.00043189863,0.001686591,0.0014199412,0.00080973154,0.0010134407],"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.00059024733,0.00033798814,0.0012330512,0.0001151516,0.000042947628,0.00027377717,0.00018344492,0.0028349017,0.39414486,0.014277969,0.003608734,0.5823569],"study_design_scores_gemma":[0.00008866343,0.00082470383,0.0041753165,0.00006010308,0.00019176246,0.0049010026,0.0001673354,0.35577145,0.5908089,0.009200951,0.033738513,0.00007120964],"about_ca_topic_score_codex":0.00021759876,"about_ca_topic_score_gemma":0.0004522641,"teacher_disagreement_score":0.0032848248,"about_ca_system_score_codex":0.00018204607,"about_ca_system_score_gemma":0.000208351,"threshold_uncertainty_score":0.010988772},"labels":[],"label_agreement":null},{"id":"W1565358148","doi":"10.1007/978-3-540-39903-2_92","title":"Exploring Symmetries in Breast MRI Scan","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wavelet; Breast MRI; Similarity (geometry); Invariant (physics); Pattern recognition (psychology); Homogeneous space; Artificial intelligence; Computer science; Representation (politics); Feature (linguistics); Symmetry (geometry); Mathematics; Mammography; Medicine; Breast cancer; Image (mathematics); Geometry","score_opus":0.05127180138303926,"score_gpt":0.26538176338531316,"score_spread":0.2141099620022739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565358148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10558853,0.0006215694,0.8876294,0.00044487527,0.00003363006,0.000038496357,0.00040692673,0.00054315623,0.004693488],"genre_scores_gemma":[0.6300133,0.0016037284,0.3606265,0.00014209973,0.00009865902,0.000039162303,0.0010304259,0.0004155114,0.0060305456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985766,0.000043571366,0.0000064428914,0.00003174831,0.000043094642,0.000017463726],"domain_scores_gemma":[0.999451,0.0002542969,0.00008516499,0.0001153473,0.000054452754,0.00003971569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045527637,0.0003499393,0.0004598027,0.000659187,0.00017724115,0.00072793075,0.00054896565,0.0003941647,0.0031240229],"category_scores_gemma":[0.0019115945,0.0005731152,0.00050345337,0.0005754207,0.00050786283,0.0009994574,0.00080276333,0.0005800337,0.0005943442],"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.0007368148,0.0001026142,0.009491833,0.0005105897,0.00014858134,0.0017966211,0.0007317065,0.12770315,0.1200403,0.1334413,0.009622399,0.59567404],"study_design_scores_gemma":[0.000031465035,0.000119567456,0.0058289343,0.000038536145,0.00004676318,0.0020668164,0.00036474972,0.7629627,0.015124574,0.20646054,0.006916323,0.00003902488],"about_ca_topic_score_codex":0.00087083067,"about_ca_topic_score_gemma":0.0012680346,"teacher_disagreement_score":0.0031240229,"about_ca_system_score_codex":0.00021294378,"about_ca_system_score_gemma":0.00034313902,"threshold_uncertainty_score":0.0104509},"labels":[],"label_agreement":null},{"id":"W1565384686","doi":"10.1007/11830924_2","title":"Analysis of Algorithms on the Cores of Random Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random graph; Combinatorics; Mathematics; Random regular graph; Degree (music); Vertex (graph theory); Induced subgraph; Discrete mathematics; Graph; Algorithm; Line graph; 1-planar graph","score_opus":0.013823140652413484,"score_gpt":0.23618294035192283,"score_spread":0.22235979969950934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565384686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34008262,0.001908601,0.617679,0.0022382776,0.00014481918,0.0002952976,0.00050373666,0.0009096959,0.036237925],"genre_scores_gemma":[0.90605044,0.0013166087,0.07355495,0.000327777,0.00042558138,0.000425456,0.0008418006,0.00068268843,0.016374804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772197,0.00087058323,0.000084246865,0.00034089186,0.0005817259,0.0004006014],"domain_scores_gemma":[0.9731828,0.020781336,0.0015439732,0.0016260785,0.0016567495,0.0012090502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002845509,0.0016300264,0.0020908515,0.0030756593,0.0010293748,0.00345429,0.0041006203,0.0019638408,0.008230526],"category_scores_gemma":[0.027023967,0.0012963822,0.0016617577,0.0020517295,0.0038837276,0.007400057,0.0027621316,0.0031409469,0.000585807],"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.00019060589,0.00012364214,0.0013786077,0.00019877894,0.000053242926,0.00006522041,0.00019435801,0.13771117,0.0012920067,0.8393258,0.0039684046,0.015498137],"study_design_scores_gemma":[0.000029891326,0.00003597106,0.00039197266,0.000029793428,0.000017331875,0.000038231297,0.000049762923,0.49401742,0.0004647126,0.5041568,0.00075667875,0.000011452142],"about_ca_topic_score_codex":0.0020027806,"about_ca_topic_score_gemma":0.002378272,"teacher_disagreement_score":0.008230526,"about_ca_system_score_codex":0.0033189782,"about_ca_system_score_gemma":0.0018841353,"threshold_uncertainty_score":0.027533889},"labels":[],"label_agreement":null},{"id":"W1565405003","doi":"10.1007/978-3-540-68825-9_13","title":"Point-Based Planning for Predictive State Representations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Observability; Computer science; Partially observable Markov decision process; Representation (politics); Observable; Markov decision process; Automated planning and scheduling; State (computer science); Point (geometry); Mathematical optimization; Artificial intelligence; Markov chain; Algorithm; Theoretical computer science; Markov process; Machine learning; Markov model; Mathematics; Applied mathematics","score_opus":0.02775704980736581,"score_gpt":0.2808852751791834,"score_spread":0.25312822537181756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565405003","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.0032672782,0.00032577218,0.9935814,0.00004055578,0.00002559224,0.000020878617,0.000042682484,0.0003549167,0.0023408693],"genre_scores_gemma":[0.4335136,0.0013867959,0.5544614,0.000085625434,0.000059201142,0.000368449,0.00044758187,0.00026207388,0.009415178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.000072775954,0.000023128094,0.00006708343,0.00011833044,0.000032480755],"domain_scores_gemma":[0.999438,0.0003896409,0.000027026375,0.00006793872,0.00005924297,0.000018154724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006596077,0.0007568788,0.0011873551,0.0005259905,0.00040290595,0.00092607155,0.0017455302,0.001048721,0.005281249],"category_scores_gemma":[0.0021244679,0.00086985674,0.00080515206,0.0010932877,0.0009535367,0.0015668925,0.001251586,0.0017539631,0.0008728281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061790866,0.00002347082,0.00009396184,0.000109710556,0.000024483701,0.0000522758,0.00006720454,0.8385354,0.0013078626,0.064186305,0.0015134333,0.09402411],"study_design_scores_gemma":[0.0000047303683,0.000011252805,0.000020753743,0.000008387549,0.000004105859,0.0000089590185,0.000004332476,0.96398586,0.00038366302,0.03496114,0.00060222397,0.0000046101813],"about_ca_topic_score_codex":0.0060825017,"about_ca_topic_score_gemma":0.006154992,"teacher_disagreement_score":0.0060825017,"about_ca_system_score_codex":0.0008395631,"about_ca_system_score_gemma":0.0007012503,"threshold_uncertainty_score":0.017667532},"labels":[],"label_agreement":null},{"id":"W1565483410","doi":"10.1007/11907503_12","title":"Auditing and Inference Control for Privacy Preservation in Uncertain Environments","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Inference; Context (archaeology); Ubiquitous computing; Audit; Control (management); Point (geometry); Bayesian network; Context management; Data science; Human–computer interaction; Computer security; Internet privacy; Artificial intelligence","score_opus":0.03143484862959922,"score_gpt":0.2632148215243259,"score_spread":0.23177997289472668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565483410","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.008848744,0.0003737585,0.9884688,0.0003722158,0.000068007954,0.000047581816,0.00007868623,0.00036601833,0.0013760694],"genre_scores_gemma":[0.7181225,0.0006417473,0.2750675,0.0002221174,0.00026170307,0.0001652087,0.00028574388,0.00014370015,0.0050897934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917475,0.0025789172,0.0008570642,0.0014852338,0.0025293499,0.0008020358],"domain_scores_gemma":[0.96866566,0.01840881,0.0014890056,0.00904687,0.001990415,0.00039917938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007822699,0.0008112936,0.0017275581,0.0010119119,0.001418566,0.004170971,0.0030675933,0.0015810777,0.0025673308],"category_scores_gemma":[0.027904022,0.001026394,0.0016536982,0.0013134973,0.0038381272,0.00853586,0.0041788355,0.0050597754,0.00038175928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010642497,0.00017467863,0.002107355,0.00031733152,0.00019689596,0.00035001454,0.0008158675,0.31570914,0.0049339677,0.46876544,0.0041393456,0.20142567],"study_design_scores_gemma":[0.000025467289,0.00004283592,0.00023696786,0.000030454286,0.000042917825,0.00011191446,0.000061907085,0.73323596,0.004415299,0.26017618,0.0015950273,0.000025081683],"about_ca_topic_score_codex":0.0025559282,"about_ca_topic_score_gemma":0.0019687552,"teacher_disagreement_score":0.007822699,"about_ca_system_score_codex":0.0017435496,"about_ca_system_score_gemma":0.0027814924,"threshold_uncertainty_score":0.04137087},"labels":[],"label_agreement":null},{"id":"W1565485206","doi":"10.1007/11755494_10","title":"Feeling Strangely Fine: The Well-Being Economy in Popular Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Feeling; Computer science; Artificial intelligence; Psychology; Social psychology","score_opus":0.01240782655795096,"score_gpt":0.24680632166006466,"score_spread":0.2343984951021137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565485206","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.32303488,0.0031611978,0.005231617,0.017460614,0.00022508361,0.00003284526,0.00010389092,0.000028918552,0.65072095],"genre_scores_gemma":[0.9912117,0.0003965126,0.0003288694,0.0003921933,0.000049557384,0.00001585338,0.000017701888,0.000014768183,0.007572882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99944204,0.00030150783,0.000010224362,0.000055532964,0.00007635848,0.00011434684],"domain_scores_gemma":[0.9988556,0.0005252318,0.00014087046,0.00006725108,0.00008215098,0.00032888798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008592514,0.00025244005,0.0002806797,0.0005611016,0.0020813737,0.0065169586,0.00060278777,0.0015020324,0.011794488],"category_scores_gemma":[0.0026217876,0.00023113524,0.00026496264,0.00090552936,0.006121821,0.005633106,0.0025556558,0.0025281324,0.0004802984],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023369344,0.00022432151,0.00891668,0.000065701744,0.0000319469,0.0003271219,0.018586222,0.0007938862,0.0005291196,0.9211513,0.010972803,0.038167104],"study_design_scores_gemma":[0.000058388578,0.00009060034,0.04224,0.00012378179,0.000032272277,0.00032354356,0.03644395,0.002938727,0.00026026106,0.8581429,0.059293706,0.000051770076],"about_ca_topic_score_codex":0.0025454464,"about_ca_topic_score_gemma":0.005335216,"teacher_disagreement_score":0.011794488,"about_ca_system_score_codex":0.0012940684,"about_ca_system_score_gemma":0.00056002656,"threshold_uncertainty_score":0.039456487},"labels":[],"label_agreement":null},{"id":"W1565539145","doi":"10.1007/978-3-642-04138-9_26","title":"The State-of-the-Art in IC Reverse Engineering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":331,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Chipworks (Canada)","funders":"","keywords":"Schematic; Reverse engineering; Computer science; Encryption; Embedded system; Chip; Transistor; Semiconductor industry; Integrated circuit; Process (computing); Software; State (computer science); Computer hardware; Manufacturing engineering; Electrical engineering; Operating system; Engineering; Telecommunications","score_opus":0.007553501657843944,"score_gpt":0.20242767453984997,"score_spread":0.19487417288200604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565539145","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052414513,0.39585787,0.39341006,0.0042140773,0.0030315223,0.00010860813,0.00023077347,0.0011428028,0.19676293],"genre_scores_gemma":[0.09434593,0.49586022,0.26695475,0.0028796345,0.004108093,0.00021648027,0.00074230455,0.0007528284,0.1341399],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985001,0.00022362768,0.000090529094,0.00023789109,0.00083555706,0.00011219244],"domain_scores_gemma":[0.9967451,0.0020733562,0.000073091556,0.0006717171,0.0003886144,0.000048039918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020855505,0.0012293736,0.0012200832,0.001625761,0.0006622081,0.005283037,0.0022859287,0.002939458,0.016838448],"category_scores_gemma":[0.0038226799,0.00094292895,0.000873781,0.0019645314,0.0030421258,0.010678232,0.0020805686,0.00398892,0.010014393],"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.000053649055,0.0000974259,0.00017856246,0.0018325035,0.00002381085,0.00011909557,0.00022594756,0.0036743125,0.0058755204,0.3034117,0.015473778,0.66903365],"study_design_scores_gemma":[0.000017947421,0.00018562672,0.0002500489,0.0013393327,0.000038105693,0.0016791412,0.00015475473,0.017153215,0.018812967,0.2991897,0.6610903,0.0000887804],"about_ca_topic_score_codex":0.00038319113,"about_ca_topic_score_gemma":0.0005216619,"teacher_disagreement_score":0.016838448,"about_ca_system_score_codex":0.0009074931,"about_ca_system_score_gemma":0.000897651,"threshold_uncertainty_score":0.056330264},"labels":[],"label_agreement":null},{"id":"W1565548452","doi":"10.1007/978-3-642-15705-9_16","title":"Measurement Selection in Untracked Freehand 3D Ultrasound","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","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":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decorrelation; Computer science; Speckle pattern; Computer vision; Artificial intelligence; Probabilistic logic; 3D ultrasound; Selection (genetic algorithm); Position (finance); Tracking (education); Ultrasound; Acoustics","score_opus":0.011057769840112081,"score_gpt":0.23418485016773516,"score_spread":0.22312708032762307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565548452","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.016596317,0.00032492355,0.98182213,0.00015461394,0.000025995874,0.000019779296,0.000061477884,0.0004858779,0.0005088964],"genre_scores_gemma":[0.47695163,0.0007834589,0.5169607,0.00033052533,0.00012718946,0.00012040114,0.00049825804,0.00080212066,0.0034257923],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99678326,0.0012923934,0.00015276989,0.0004908542,0.0010380064,0.00024255543],"domain_scores_gemma":[0.99062514,0.0073860665,0.00051737844,0.0006229816,0.0006366935,0.00021172648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026762355,0.0008022457,0.0020422158,0.0009202329,0.00054614164,0.0020878422,0.0017193748,0.0022590484,0.0025025583],"category_scores_gemma":[0.01582745,0.0020244361,0.0009671361,0.001301639,0.001180277,0.002650637,0.0030835748,0.0016295105,0.0009686249],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012903706,0.00017642573,0.0044027013,0.0008346098,0.00021825526,0.0005971776,0.0006150228,0.3920428,0.069111,0.02471656,0.0030993994,0.50289565],"study_design_scores_gemma":[0.0000354054,0.00006559432,0.0022429076,0.00003220257,0.000029719462,0.00027103492,0.00004287291,0.97060376,0.014502827,0.010915849,0.0012002763,0.000057588626],"about_ca_topic_score_codex":0.0031427613,"about_ca_topic_score_gemma":0.004031446,"teacher_disagreement_score":0.0031427613,"about_ca_system_score_codex":0.000549542,"about_ca_system_score_gemma":0.001065768,"threshold_uncertainty_score":0.014153421},"labels":[],"label_agreement":null},{"id":"W1565573698","doi":"10.1007/978-3-642-10643-9_23","title":"Exaggerated Claims for Interactive Stories","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer graphics (images); Human–computer interaction","score_opus":0.02334382610796774,"score_gpt":0.30213541638790825,"score_spread":0.2787915902799405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565573698","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016800016,0.0027026825,0.021338882,0.038677447,0.0016067168,0.00003894918,0.00013861632,0.00013985188,0.9185568],"genre_scores_gemma":[0.88050157,0.0014243325,0.0062143058,0.006129543,0.0026904095,0.00013973717,0.00017888445,0.00041348618,0.10230778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99038917,0.0039045129,0.00044802803,0.0014408377,0.0028283251,0.000989101],"domain_scores_gemma":[0.9741252,0.01817425,0.0010867362,0.0038060616,0.0021693807,0.0006385145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065855808,0.0007928915,0.0006132743,0.0021985737,0.0068034576,0.013492708,0.0032908344,0.011056743,0.028360946],"category_scores_gemma":[0.03769357,0.00065197836,0.00060551043,0.0016629614,0.03136316,0.020546606,0.009123339,0.011469695,0.0038999561],"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.000015125121,0.0000040101736,0.000044553195,0.000026312371,0.0000032760627,0.00010901079,0.008284623,0.00003772518,0.000078320096,0.9812794,0.0070304545,0.0030872182],"study_design_scores_gemma":[0.000016878475,0.000009465178,0.00021669573,0.00024069933,0.000017089831,0.00038048258,0.0065157246,0.00044754316,0.00056520617,0.69065744,0.30091307,0.000019752424],"about_ca_topic_score_codex":0.0017302065,"about_ca_topic_score_gemma":0.0018747465,"teacher_disagreement_score":0.028360946,"about_ca_system_score_codex":0.0033667453,"about_ca_system_score_gemma":0.000909903,"threshold_uncertainty_score":0.094876766},"labels":[],"label_agreement":null},{"id":"W1565643413","doi":"10.1007/978-3-540-74913-4_86","title":"The Problems with Counting Ancestors in a Simple Genetic Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph","funders":"","keywords":"Simple (philosophy); Ancestor; Lineage (genetic); Convergence (economics); Computer science; Tree (set theory); Inbreeding; Series (stratigraphy); Coalescent theory; Population; Theoretical computer science; Evolutionary biology; Phylogenetic tree; Mathematics; Biology; Geography; Genetics; Combinatorics; Sociology; Epistemology; Gene","score_opus":0.010425608782037368,"score_gpt":0.24168966129190136,"score_spread":0.23126405250986398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565643413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03384747,0.0026502903,0.94598126,0.003989176,0.0004331304,0.00007894958,0.00016160254,0.0005408776,0.012317194],"genre_scores_gemma":[0.18740964,0.0017562432,0.7982994,0.000776039,0.0006488564,0.00022923901,0.00023497533,0.00045579427,0.010189868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945909,0.0024935415,0.00046340426,0.00079451123,0.0014268031,0.00023089557],"domain_scores_gemma":[0.95914483,0.034456864,0.00085353944,0.0031453387,0.0018904248,0.00050897925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011298728,0.00096489454,0.0023652697,0.0019257959,0.0023365614,0.0037410958,0.0055456893,0.004315198,0.0054361084],"category_scores_gemma":[0.06902043,0.0014432844,0.0016924227,0.004896657,0.0048732897,0.0145224845,0.0035085296,0.00615454,0.0009997388],"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.00023087904,0.00011355667,0.0017541276,0.00030626214,0.00009803846,0.00018211943,0.00048671983,0.1336068,0.0008505818,0.6513045,0.009508515,0.20155786],"study_design_scores_gemma":[0.00005448145,0.000022413755,0.00018372662,0.000041772895,0.000033809207,0.00011290929,0.000037283386,0.20168382,0.00053530885,0.79460645,0.0026616105,0.000026334357],"about_ca_topic_score_codex":0.0034420385,"about_ca_topic_score_gemma":0.0042118724,"teacher_disagreement_score":0.011298728,"about_ca_system_score_codex":0.0021900493,"about_ca_system_score_gemma":0.0018323306,"threshold_uncertainty_score":0.059754133},"labels":[],"label_agreement":null},{"id":"W1565696930","doi":"10.1007/978-3-540-30184-4_18","title":"A Reputation Management and Selection Advisor Schemes for Peer-to-Peer Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Computer science; Upload; Scheme (mathematics); Peer-to-peer; Selection (genetic algorithm); Download; Reputation system; Computer security; Distributed computing; World Wide Web; Artificial intelligence","score_opus":0.015760585277747294,"score_gpt":0.2546115449137687,"score_spread":0.2388509596360214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565696930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032386005,0.002699443,0.94400203,0.0022497363,0.00083419017,0.00039893237,0.0002131504,0.0016902536,0.015526327],"genre_scores_gemma":[0.5930781,0.0016170597,0.36739248,0.00034639423,0.0011830688,0.00030668874,0.00029678075,0.00027014915,0.03550933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972308,0.0009751992,0.00016208368,0.00047413848,0.0008811754,0.0002767054],"domain_scores_gemma":[0.9932041,0.0027788626,0.0003667557,0.0022299679,0.00093412166,0.0004860201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039657173,0.000637742,0.0017856193,0.00097319274,0.0023385466,0.003091793,0.003385551,0.0022593322,0.00695502],"category_scores_gemma":[0.01224071,0.0005031166,0.000923386,0.001829373,0.0014703871,0.005739045,0.002445247,0.0032606218,0.0019207663],"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.0012813704,0.0005359301,0.0011916085,0.00038154385,0.00019578518,0.00029688337,0.00059906347,0.08092194,0.015952958,0.49273705,0.0428873,0.36301854],"study_design_scores_gemma":[0.00035145177,0.0004856746,0.0008519958,0.00006272136,0.00016045215,0.0005430869,0.0001153608,0.7833983,0.0069510583,0.17568254,0.031247094,0.0001502571],"about_ca_topic_score_codex":0.0015409543,"about_ca_topic_score_gemma":0.0015195735,"teacher_disagreement_score":0.00695502,"about_ca_system_score_codex":0.0019823443,"about_ca_system_score_gemma":0.0016408048,"threshold_uncertainty_score":0.023266912},"labels":[],"label_agreement":null},{"id":"W1565703976","doi":"10.1007/978-3-540-95891-8_58","title":"A Formal Model of Business Application Integration from Web Services (Position Paper)","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Concordia University","funders":"","keywords":"Computer science; Web service; WS-Policy; Business Process Execution Language; Service-oriented architecture; Business process; World Wide Web; Services computing; Web standards; Service (business); Web modeling; Notation; Process management; Software engineering; Web development; Web application security; Business; Work in process","score_opus":0.007598605428704341,"score_gpt":0.20996435376647482,"score_spread":0.2023657483377705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565703976","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008004087,0.00040981997,0.9668004,0.0013103011,0.000137906,0.00014526614,0.00015883935,0.00075268024,0.022280755],"genre_scores_gemma":[0.36157978,0.0011278576,0.6017519,0.0006351497,0.0002652606,0.000654464,0.0007585011,0.0005448237,0.03268225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989807,0.00021417635,0.00008519574,0.00014764917,0.00046457906,0.000107705],"domain_scores_gemma":[0.9993661,0.0002987123,0.00005439576,0.000109735956,0.00012891405,0.00004215534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013868879,0.0006404204,0.0004668888,0.0008372759,0.0010112961,0.003995171,0.001983436,0.0016641159,0.00656082],"category_scores_gemma":[0.0025239368,0.00094311906,0.0013448341,0.0010055907,0.00276228,0.0048457384,0.0019336251,0.0025282274,0.0016105958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026410708,0.00007524334,0.00012364911,0.0000862484,0.000015115767,0.0002091393,0.00041294386,0.02193324,0.0026883087,0.95583457,0.0019608026,0.016634444],"study_design_scores_gemma":[0.000060138424,0.000049159014,0.00016869439,0.00010617933,0.000051948125,0.00026378743,0.00011231116,0.25333917,0.004463339,0.6855101,0.055838153,0.000037080288],"about_ca_topic_score_codex":0.0065133874,"about_ca_topic_score_gemma":0.0045952876,"teacher_disagreement_score":0.00656082,"about_ca_system_score_codex":0.0016291102,"about_ca_system_score_gemma":0.0019170127,"threshold_uncertainty_score":0.021948159},"labels":[],"label_agreement":null},{"id":"W1565737137","doi":"10.1007/978-3-319-06880-0","title":"Horizons of the Mind. A Tribute to Prakash Panangaden","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Tribute; Computer science; Computer graphics (images); Artificial intelligence; Cognitive science; Art history; Art; Psychology","score_opus":0.01281223973820065,"score_gpt":0.2435674027424812,"score_spread":0.23075516300428056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565737137","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000655034,0.2720371,0.002759347,0.51925826,0.079338625,0.00002316692,0.0002396009,0.0002958964,0.12539302],"genre_scores_gemma":[0.015997382,0.13232836,0.0033451908,0.15032023,0.055018175,0.00006772006,0.00023891147,0.000693667,0.6419904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940014,0.00015674216,0.000031520893,0.00012898177,0.00024156977,0.00004097338],"domain_scores_gemma":[0.9974044,0.0013128391,0.000092686954,0.00020085346,0.0005507905,0.00043836303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114957,0.00087413494,0.0010407552,0.0009627728,0.00228081,0.004470147,0.0011218382,0.0017753452,0.02776228],"category_scores_gemma":[0.0043160217,0.00061842095,0.00044184134,0.0009662874,0.0030483708,0.011730154,0.0021739306,0.011983157,0.021371072],"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.00001116782,0.0000131859915,0.000024050938,0.00006155854,0.0000050256244,0.000024630212,0.00021925304,0.000030558866,0.00006981293,0.0382145,0.9455478,0.015778467],"study_design_scores_gemma":[0.0000029653695,0.0000075790695,0.000046448335,0.00011313732,0.0000019737558,0.00013568466,0.00014444052,0.000029383069,0.000047003745,0.0137562305,0.9857094,0.0000057724765],"about_ca_topic_score_codex":0.0015228274,"about_ca_topic_score_gemma":0.00298347,"teacher_disagreement_score":0.02776228,"about_ca_system_score_codex":0.001155461,"about_ca_system_score_gemma":0.0016155381,"threshold_uncertainty_score":0.09287411},"labels":[],"label_agreement":null},{"id":"W1565737841","doi":"10.1007/11788911_21","title":"Analyzing the Genetic Operations of an Evolutionary Query Optimizer","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"IBM (Canada)","funders":"","keywords":"Crossover; Computer science; Genetic programming; Genetic algorithm; Plan (archaeology); Mutation; Operations research; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.011676907347618563,"score_gpt":0.23831243456395643,"score_spread":0.22663552721633787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565737841","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.55749136,0.00026002672,0.43433538,0.00030638927,0.00003229039,0.00009345129,0.00006702175,0.00048364018,0.006930552],"genre_scores_gemma":[0.86379087,0.00014907212,0.13229191,0.00006726368,0.00001757696,0.00005335238,0.00013300008,0.00014232296,0.0033546267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995061,0.00011603686,0.000018935,0.000063870226,0.00021445683,0.00008061443],"domain_scores_gemma":[0.99845016,0.0010215214,0.000113657865,0.00012527035,0.0002524784,0.00003685078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007968708,0.00038532107,0.0004251056,0.00058356125,0.0004375444,0.0009597931,0.0009376121,0.0008700449,0.001808053],"category_scores_gemma":[0.0044323066,0.00029515065,0.00047966518,0.000751846,0.00068839977,0.000936621,0.0003719497,0.0007269616,0.00020443885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003437848,0.00016784904,0.007890174,0.00008557191,0.000073382376,0.0002832831,0.00025038738,0.81770813,0.03404511,0.046228062,0.0007736139,0.09215063],"study_design_scores_gemma":[0.000009783567,0.00005136132,0.0006495909,0.0000029794746,0.00001875569,0.000040144158,0.000036661604,0.9897371,0.0030895479,0.0061146165,0.00024380763,0.000005600096],"about_ca_topic_score_codex":0.0063830507,"about_ca_topic_score_gemma":0.0031996747,"teacher_disagreement_score":0.0063830507,"about_ca_system_score_codex":0.00079132715,"about_ca_system_score_gemma":0.00073391414,"threshold_uncertainty_score":0.012691796},"labels":[],"label_agreement":null},{"id":"W1565752952","doi":"10.1007/3-540-45486-1_11","title":"Collocation Discovery for Optimal Bilingual Lexicon Development","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Lexicon; Collocation (remote sensing); Natural language processing; Artificial intelligence; Variety (cybernetics); Lexicography; Machine translation; Linguistics; Machine learning","score_opus":0.015497514024833485,"score_gpt":0.27019197902969894,"score_spread":0.2546944650048655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565752952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021421345,0.0007104059,0.9523187,0.0004650359,0.00023168116,0.00028761505,0.0018387738,0.013921234,0.00880524],"genre_scores_gemma":[0.16827138,0.0005220936,0.81292784,0.00019241199,0.00013991157,0.00037798574,0.008730462,0.0023360997,0.0065017478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807465,0.00062329945,0.00024682895,0.00048987643,0.00033261089,0.00023261984],"domain_scores_gemma":[0.9960387,0.0018490923,0.0001314955,0.00059424946,0.0012535616,0.00013299695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016268194,0.0013552022,0.0019003619,0.004508838,0.0017042551,0.0027142484,0.0020177537,0.0013881121,0.03151518],"category_scores_gemma":[0.008414167,0.0013541966,0.0014335548,0.0039912886,0.0008208401,0.005445015,0.0041769627,0.0016256983,0.014757891],"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.00047789465,0.00013760812,0.000995499,0.0006232984,0.00008586523,0.0004958764,0.00037635938,0.008845214,0.02006585,0.022966087,0.03213138,0.91279906],"study_design_scores_gemma":[0.0004029474,0.00026610473,0.0014081653,0.00021556129,0.00033103878,0.0016237014,0.001633942,0.723914,0.06576204,0.14754955,0.056730423,0.00016248655],"about_ca_topic_score_codex":0.004395818,"about_ca_topic_score_gemma":0.010231691,"teacher_disagreement_score":0.03151518,"about_ca_system_score_codex":0.000879011,"about_ca_system_score_gemma":0.0038156775,"threshold_uncertainty_score":0.105428755},"labels":[],"label_agreement":null},{"id":"W1565785024","doi":"10.1007/11751540_14","title":"Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Saskatchewan","funders":"","keywords":"Delaunay triangulation; Computer science; Wireless ad hoc network; Triangulation; Routing (electronic design automation); Computer network; Wireless; Algorithm; Mathematics; Geometry; Telecommunications","score_opus":0.015167069041129527,"score_gpt":0.21973038752294646,"score_spread":0.20456331848181694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565785024","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.5543017,0.0028363925,0.41928452,0.00073582766,0.00007839646,0.000084500665,0.000265469,0.00027686916,0.022136306],"genre_scores_gemma":[0.98755264,0.0006651624,0.009960116,0.000031440115,0.00004922235,0.000035144498,0.00010419895,0.000050198058,0.0015518026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957377,0.00014876724,0.000019695013,0.00006130799,0.00015784489,0.00003863937],"domain_scores_gemma":[0.99480504,0.0035883214,0.0005837302,0.0003194232,0.0005583046,0.00014514966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009101662,0.00030962302,0.0005868406,0.0010026834,0.0005065765,0.000923167,0.00070265844,0.0005126836,0.0015278879],"category_scores_gemma":[0.007401511,0.0003670431,0.00022415549,0.0009401735,0.000820907,0.0014276094,0.00077779393,0.00048488448,0.00023347774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038518413,0.00006740955,0.0049958467,0.00026740952,0.000058231388,0.0005330768,0.0006746503,0.7692206,0.02626166,0.14231038,0.0029794401,0.052246116],"study_design_scores_gemma":[0.000016639015,0.00009186094,0.0014076118,0.000017483979,0.000026317844,0.00025713426,0.00019784273,0.96022433,0.0022639527,0.03454667,0.0009269445,0.000023191908],"about_ca_topic_score_codex":0.0013141325,"about_ca_topic_score_gemma":0.0008518257,"teacher_disagreement_score":0.0015278879,"about_ca_system_score_codex":0.00056366564,"about_ca_system_score_gemma":0.00026030678,"threshold_uncertainty_score":0.005111277},"labels":[],"label_agreement":null},{"id":"W1565845290","doi":"10.1007/978-3-540-75853-2_1","title":"A Novel Peer-to-Peer Naming Infrastructure for Next Generation Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Computer science; Peer-to-peer; Robustness (evolution); Flexibility (engineering); Distributed computing; File sharing; Computer network; Data science; World Wide Web; The Internet; Database","score_opus":0.045662277938152696,"score_gpt":0.27834998033560016,"score_spread":0.23268770239744746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565845290","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.012295327,0.0014467319,0.95684594,0.00087001035,0.0013197692,0.0003109205,0.00018886646,0.008395246,0.018327232],"genre_scores_gemma":[0.27961132,0.0017948769,0.68224645,0.00055770983,0.0009195598,0.00045414147,0.0011094252,0.00080625736,0.032500308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893326,0.00018461062,0.00007135118,0.00015227002,0.0005273632,0.0001310743],"domain_scores_gemma":[0.9987043,0.00021683241,0.00007891694,0.0004244628,0.00043576656,0.00013967881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014756698,0.00051653216,0.0008134301,0.00091508264,0.001575509,0.0020452286,0.0032471146,0.0013907374,0.0041242465],"category_scores_gemma":[0.0023072998,0.00041062635,0.0004252189,0.0010369172,0.00061653624,0.004310343,0.002481756,0.0016448442,0.0021019562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005870221,0.00033810388,0.00077475613,0.00049491273,0.00010918214,0.00057237037,0.00054344384,0.037421856,0.06426586,0.22665231,0.085469216,0.58277094],"study_design_scores_gemma":[0.00016484536,0.0003992674,0.00062213675,0.00008432559,0.00017436664,0.0012138272,0.00019860969,0.5905956,0.038941305,0.08448763,0.28292307,0.00019497694],"about_ca_topic_score_codex":0.0023641044,"about_ca_topic_score_gemma":0.0040900656,"teacher_disagreement_score":0.0041242465,"about_ca_system_score_codex":0.000978063,"about_ca_system_score_gemma":0.0013716728,"threshold_uncertainty_score":0.013796985},"labels":[],"label_agreement":null},{"id":"W1565854236","doi":"10.1007/978-3-540-88425-5_23","title":"Probabilistic Granule Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Brock University","funders":"","keywords":"Determinacy; Computer science; Probabilistic logic; Rough set; Random variable; Parametric statistics; Latent variable; Artificial intelligence; Reliability (semiconductor); Variable (mathematics); Algorithm; Machine learning; Mathematics; Statistics","score_opus":0.019334300948162825,"score_gpt":0.2319598732817459,"score_spread":0.21262557233358306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565854236","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.00609399,0.0017800598,0.96188307,0.0004926648,0.00023806989,0.000055710938,0.00039564807,0.000759742,0.028301133],"genre_scores_gemma":[0.43620282,0.005040073,0.46072838,0.0003838965,0.0009615493,0.00032588953,0.0029430029,0.0014835695,0.091930725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928206,0.00013468767,0.000042188556,0.00019710016,0.00028815388,0.000055804045],"domain_scores_gemma":[0.9989121,0.0003911581,0.000090354995,0.00033160672,0.00022558407,0.000049255155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010667818,0.0008021031,0.0012224121,0.0024009508,0.00069428165,0.0036223582,0.001087718,0.00095432106,0.0150388],"category_scores_gemma":[0.00441953,0.00064394885,0.0011949798,0.0024120146,0.0013016193,0.003565173,0.002036771,0.0018042385,0.0040459135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084214706,0.00003387982,0.00058813696,0.0001571411,0.000068957605,0.00009992459,0.00011342049,0.026718026,0.0028918984,0.77138186,0.01577921,0.18208338],"study_design_scores_gemma":[0.000009535334,0.000021035203,0.0006756305,0.000044259286,0.000040997726,0.00017156689,0.000051953502,0.20816201,0.003073037,0.7626418,0.025084343,0.000023965884],"about_ca_topic_score_codex":0.0007532441,"about_ca_topic_score_gemma":0.00049968314,"teacher_disagreement_score":0.0150388,"about_ca_system_score_codex":0.0007538114,"about_ca_system_score_gemma":0.000503679,"threshold_uncertainty_score":0.050309777},"labels":[],"label_agreement":null},{"id":"W1565903223","doi":"10.1007/3-540-44886-1_38","title":"Methods for Mining Frequent Sequential Patterns","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Regina","funders":"","keywords":"Trie; Prefix; Computer science; Heuristic; Algorithm; Data structure; Artificial intelligence","score_opus":0.042910758152290146,"score_gpt":0.33626521198040726,"score_spread":0.2933544538281171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565903223","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.0018980583,0.0017452564,0.9939797,0.00010014897,0.00010359465,0.00012614256,0.0003708093,0.00085545256,0.00082098425],"genre_scores_gemma":[0.031157386,0.0025324423,0.9586687,0.00012273794,0.00029564797,0.000722292,0.0018828482,0.00018092984,0.0044370615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975509,0.0004364554,0.0002781801,0.000470815,0.0011857189,0.00007801645],"domain_scores_gemma":[0.9935142,0.0043593138,0.0003736794,0.0008016108,0.0008403911,0.00011079919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025084943,0.0013714874,0.001937909,0.004534786,0.000707895,0.0017270879,0.0027409731,0.0009705229,0.005594496],"category_scores_gemma":[0.011816188,0.0009423654,0.0015078291,0.0054708333,0.00071803184,0.0032125055,0.0014719057,0.0014916792,0.0035959117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020589934,0.00013710072,0.0019448794,0.0011587965,0.00028051037,0.00018426133,0.00016658947,0.01800297,0.0033582351,0.026626572,0.011728396,0.9362058],"study_design_scores_gemma":[0.00023005734,0.00022597089,0.0017300997,0.00030217174,0.00032220015,0.0015109386,0.0001827162,0.6781288,0.006869597,0.27074137,0.03968295,0.000073175375],"about_ca_topic_score_codex":0.0010538242,"about_ca_topic_score_gemma":0.0017103301,"teacher_disagreement_score":0.005594496,"about_ca_system_score_codex":0.00036592752,"about_ca_system_score_gemma":0.0008846548,"threshold_uncertainty_score":0.018715441},"labels":[],"label_agreement":null},{"id":"W1565927860","doi":"10.1007/978-3-540-87875-9_49","title":"Semantically Configurable Code Generation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Waterloo","funders":"","keywords":"Computer science; Code generation; Programming language; Notation; Model-driven architecture; Generator (circuit theory); Semantics (computer science); Java; Code (set theory); Software; Software engineering; Software development; Set (abstract data type); Operating system; Key (lock)","score_opus":0.04989967081414697,"score_gpt":0.27785875087406103,"score_spread":0.22795908005991405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565927860","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.018317442,0.0002758859,0.9306379,0.00021899093,0.00014374491,0.0001114903,0.000478096,0.027981266,0.021835223],"genre_scores_gemma":[0.3485832,0.0003344818,0.62733924,0.00025151315,0.00006608704,0.00020466225,0.0028761947,0.007669003,0.012675621],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989592,0.0002506736,0.00006240948,0.00024691105,0.00038818474,0.00009256181],"domain_scores_gemma":[0.9980683,0.00055433315,0.000069361726,0.0011149072,0.00016018149,0.000033037508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079027255,0.0009167368,0.00047636486,0.00080545945,0.00041728077,0.0012691377,0.0017899002,0.0009242425,0.009765608],"category_scores_gemma":[0.0032645778,0.00059719104,0.0007878551,0.0010391264,0.0012368148,0.0021864718,0.0024057992,0.0015452949,0.0034663195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037530996,0.00015798915,0.0010005173,0.000498736,0.00005538996,0.0005556445,0.00037711373,0.054636225,0.06292696,0.30607247,0.024112836,0.5492308],"study_design_scores_gemma":[0.00009458972,0.00011234317,0.0006568217,0.0001757684,0.00007549502,0.00071642856,0.000091063695,0.435465,0.12906063,0.34272477,0.09075719,0.000069919704],"about_ca_topic_score_codex":0.00043875645,"about_ca_topic_score_gemma":0.0007958967,"teacher_disagreement_score":0.009765608,"about_ca_system_score_codex":0.000612554,"about_ca_system_score_gemma":0.00052028213,"threshold_uncertainty_score":0.032669187},"labels":[],"label_agreement":null},{"id":"W1565989234","doi":"10.1007/978-3-642-16638-9_35","title":"Automated Storytelling in Sports: A Rich Domain to Be Explored","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Storytelling; Domain (mathematical analysis); Psychology; Computer science; Art; Narrative; Literature; Mathematics","score_opus":0.015744733898622864,"score_gpt":0.2390232506472739,"score_spread":0.22327851674865104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565989234","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100944474,0.013322648,0.8031288,0.0025403535,0.00028152487,0.0006204615,0.007205741,0.011034566,0.06092152],"genre_scores_gemma":[0.42199656,0.008348388,0.51645863,0.00033767647,0.0003879907,0.00031794567,0.020846542,0.0012411684,0.030065093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992644,0.0003853207,0.000034516328,0.00014265627,0.0001283257,0.00004476045],"domain_scores_gemma":[0.99651945,0.0025695176,0.00015608898,0.00037085186,0.0002931202,0.00009103504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067064096,0.0010129571,0.00051268045,0.0012481457,0.0005091895,0.0023631735,0.0014869041,0.0010106676,0.011350858],"category_scores_gemma":[0.0034952194,0.0002647394,0.0005146234,0.0014076044,0.00046255637,0.0022495238,0.0007720558,0.00063381187,0.004427062],"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.00023854185,0.00025831317,0.002269912,0.002051615,0.00008811146,0.0004727414,0.0023457175,0.00935399,0.023877263,0.013236777,0.030884027,0.914923],"study_design_scores_gemma":[0.000109784254,0.00064737606,0.021661824,0.0010813443,0.00020166839,0.0041265558,0.010128457,0.32563883,0.09260106,0.10439881,0.4392529,0.0001514003],"about_ca_topic_score_codex":0.0010077793,"about_ca_topic_score_gemma":0.0018736209,"teacher_disagreement_score":0.011350858,"about_ca_system_score_codex":0.00030602244,"about_ca_system_score_gemma":0.00038362847,"threshold_uncertainty_score":0.03797245},"labels":[],"label_agreement":null},{"id":"W1566010097","doi":"10.1007/11422778_19","title":"Modeling a Beacon Enabled 802.15.4 Cluster with Bidirectional Traffic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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 Manitoba","funders":"","keywords":"Telecommunications link; Computer network; Network packet; Computer science; Queue; Beacon; Markov chain; Real-time computing","score_opus":0.016378734408408334,"score_gpt":0.23710597794128582,"score_spread":0.22072724353287748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566010097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40355954,0.001973405,0.51929665,0.0026623225,0.0005531944,0.0003393341,0.0015592341,0.0026391742,0.06741722],"genre_scores_gemma":[0.9496762,0.0008866312,0.02556992,0.00013649004,0.00009102511,0.00021696754,0.00035393634,0.0002713217,0.022797482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963844,0.00010213531,0.000011506001,0.00006912251,0.00007926847,0.00009946287],"domain_scores_gemma":[0.9994154,0.00023536451,0.00006758152,0.000038106256,0.00016378758,0.00007981996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063065987,0.0008551874,0.00083111116,0.0006462954,0.0010033805,0.0016617259,0.0028123537,0.0019313499,0.005682522],"category_scores_gemma":[0.0013568476,0.000723122,0.0006951712,0.00088216324,0.0010229158,0.0020412197,0.001102345,0.0010346308,0.0008709191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067070185,0.000025572115,0.00032303884,0.0000272153,0.000007927554,0.000054340588,0.000049011276,0.98688126,0.0008966595,0.009010279,0.0007914226,0.001866116],"study_design_scores_gemma":[0.000008657011,0.000017302327,0.00008674544,0.0000037412553,0.0000054543657,0.000009342669,0.000017054626,0.9977221,0.00010710161,0.0017037411,0.00031271853,0.000006042386],"about_ca_topic_score_codex":0.026131503,"about_ca_topic_score_gemma":0.012691744,"teacher_disagreement_score":0.026131503,"about_ca_system_score_codex":0.0022831191,"about_ca_system_score_gemma":0.0015763217,"threshold_uncertainty_score":0.0519588},"labels":[],"label_agreement":null},{"id":"W1566150287","doi":"10.1007/978-3-642-04244-7_28","title":"Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer programming; Mathematical optimization; Tabu search; Computer science; Benders' decomposition; Constraint programming; Decomposition; Truck; Integer (computer science); Set (abstract data type); Facility location problem; Constraint (computer-aided design); Stochastic programming; Mathematics; Programming language; Engineering","score_opus":0.015102974138954636,"score_gpt":0.2520780912799707,"score_spread":0.23697511714101607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566150287","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.0071098236,0.00006131938,0.9876494,0.00013765556,0.000029485125,0.000050135895,0.00006345657,0.00013736836,0.004761348],"genre_scores_gemma":[0.16525082,0.00018626271,0.8270737,0.00015844617,0.000051923595,0.00020496012,0.00025495733,0.00016649305,0.0066524385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.0002311684,0.00002885327,0.00011873955,0.00014598711,0.00009887538],"domain_scores_gemma":[0.99930656,0.0004873994,0.000045251083,0.000048328136,0.000086312604,0.000026101798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013967302,0.0013383172,0.0013731774,0.00079873414,0.00063549035,0.0015252823,0.001315337,0.0016280753,0.008715083],"category_scores_gemma":[0.0025537836,0.0011435584,0.0017737318,0.0010829299,0.0009105153,0.0016258268,0.0012488407,0.002157885,0.0011096124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100713056,0.00010865776,0.00021001916,0.0001805814,0.000045404366,0.00006254048,0.000071854905,0.91117454,0.0029338968,0.034578722,0.0019191769,0.048613906],"study_design_scores_gemma":[0.000035789348,0.000047102123,0.000059150556,0.000015348216,0.000018631516,0.000026321497,0.00003490552,0.9644474,0.00088914856,0.033340935,0.0010759654,0.000009254062],"about_ca_topic_score_codex":0.0034202975,"about_ca_topic_score_gemma":0.0038747045,"teacher_disagreement_score":0.008715083,"about_ca_system_score_codex":0.0009544261,"about_ca_system_score_gemma":0.0014849756,"threshold_uncertainty_score":0.029154897},"labels":[],"label_agreement":null},{"id":"W1566185172","doi":"10.1007/978-3-540-74260-9_46","title":"High Accuracy Optical Flow Method Based on a Theory for Warping: Implementation and Qualitative/Quantitative Evaluation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Western University","funders":"","keywords":"Optical flow; Computer science; Image warping; Constraint (computer-aided design); Brightness; Flow (mathematics); Smoothness; Point (geometry); Measure (data warehouse); Algorithm; Image (mathematics); Computer vision; Artificial intelligence; Optics; Data mining; Mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.09916307079752028,"score_gpt":0.4740393405406595,"score_spread":0.3748762697431392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566185172","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.011114931,0.00008049801,0.9862411,0.0000594989,0.000037068567,0.00021573101,0.000057120415,0.0010752735,0.0011186829],"genre_scores_gemma":[0.12322186,0.00012542825,0.8749184,0.00002999357,0.000014781095,0.00024050743,0.00011590473,0.00024713023,0.0010859906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997552,0.0007142394,0.000109014116,0.00027293677,0.0012390692,0.000112741145],"domain_scores_gemma":[0.9941262,0.0026441615,0.00029296894,0.000823895,0.0019786675,0.00013417879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048354827,0.0011388465,0.00086804765,0.0026145282,0.00089347415,0.002243252,0.0016490975,0.0015118956,0.0073391395],"category_scores_gemma":[0.008941081,0.0007899642,0.00063413545,0.001548004,0.0014739113,0.0024965925,0.0014181992,0.0014293193,0.0010600974],"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.0005847349,0.00047857003,0.001832013,0.00063024514,0.000114044364,0.000091286056,0.00055676914,0.091745816,0.08727554,0.023153715,0.0033978706,0.79013944],"study_design_scores_gemma":[0.00006422369,0.00036746552,0.0012840609,0.00006570057,0.000052629326,0.00021218014,0.00012753149,0.8932902,0.09491456,0.006587606,0.0029630281,0.0000707997],"about_ca_topic_score_codex":0.0033535871,"about_ca_topic_score_gemma":0.0021095632,"teacher_disagreement_score":0.0073391395,"about_ca_system_score_codex":0.0012410324,"about_ca_system_score_gemma":0.0016778503,"threshold_uncertainty_score":0.025572777},"labels":[],"label_agreement":null},{"id":"W1566194850","doi":"10.1007/978-3-642-13059-5_55","title":"On Sketch Based Anonymization That Satisfies Differential Privacy Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Differential privacy; Sketch; Computer science; Multiplicative function; Randomized response; Data mining; Theoretical computer science; Algorithm; Mathematics; Statistics","score_opus":0.028226510965011005,"score_gpt":0.2550996753790757,"score_spread":0.2268731644140647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566194850","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.03117932,0.0008945654,0.95046324,0.0011825303,0.00020376162,0.00018467374,0.00057459984,0.0012439264,0.014073342],"genre_scores_gemma":[0.7553819,0.0017720053,0.21217212,0.00079898123,0.00042347,0.00035756905,0.0014107592,0.00041432914,0.027268887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996358,0.00082918286,0.00020935896,0.0008968503,0.0012528086,0.00045378265],"domain_scores_gemma":[0.9920393,0.0028223263,0.00038567834,0.004048313,0.00046836975,0.00023604481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018517078,0.0009680087,0.0019656068,0.0013277365,0.0017266448,0.0033824022,0.002744851,0.0022496649,0.006067294],"category_scores_gemma":[0.010251896,0.0006925054,0.0014051495,0.0035365717,0.0026294084,0.011934765,0.0068886103,0.0039471723,0.0013550371],"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.00044390262,0.0001113793,0.00053735374,0.00025996775,0.00007849564,0.00024117838,0.0004896923,0.07368279,0.004757307,0.83222747,0.0085946275,0.07857575],"study_design_scores_gemma":[0.000040808343,0.000071679984,0.00017490238,0.00003483373,0.00005582597,0.00038543495,0.000096205076,0.21086392,0.0035198727,0.77610105,0.008616582,0.000038802544],"about_ca_topic_score_codex":0.0009772028,"about_ca_topic_score_gemma":0.0005726822,"teacher_disagreement_score":0.006067294,"about_ca_system_score_codex":0.0015810702,"about_ca_system_score_gemma":0.0014020215,"threshold_uncertainty_score":0.02029717},"labels":[],"label_agreement":null},{"id":"W1566240944","doi":"10.1007/11891321_7","title":"Adaptive Web Usage Profiling","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Personalization; Profiling (computer programming); Cluster analysis; Data mining; Information retrieval; World Wide Web; Machine learning; Programming language","score_opus":0.023743310542771758,"score_gpt":0.24716575374035846,"score_spread":0.2234224431975867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566240944","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.19160797,0.0020255556,0.7576898,0.00057275535,0.0002629274,0.0003161988,0.0026033737,0.015237137,0.029684242],"genre_scores_gemma":[0.8002289,0.0007011947,0.17524745,0.0001498114,0.00015402277,0.00017134554,0.0029246553,0.0005665023,0.019856103],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879956,0.0002817107,0.000055782635,0.00034037753,0.00043250405,0.000090095826],"domain_scores_gemma":[0.9977847,0.0006951377,0.0001733677,0.0007706462,0.00045478923,0.00012135853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008536974,0.00064139254,0.00088910904,0.002155535,0.00041938157,0.0014684617,0.00086364406,0.0005984275,0.0030961551],"category_scores_gemma":[0.005528415,0.0004105655,0.00040541298,0.0024229921,0.00015147202,0.001910477,0.0009846212,0.00085087615,0.0038571495],"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.00028015595,0.0005478678,0.025318053,0.0001358539,0.00010860448,0.00011395096,0.00021090041,0.013678429,0.025083588,0.0041398066,0.0143048465,0.9160779],"study_design_scores_gemma":[0.000020842506,0.00022541336,0.04041296,0.00006726048,0.00011402223,0.0010670538,0.00022950416,0.87201905,0.046470392,0.0126110045,0.026671713,0.00009076646],"about_ca_topic_score_codex":0.0011086932,"about_ca_topic_score_gemma":0.0022593883,"teacher_disagreement_score":0.0030961551,"about_ca_system_score_codex":0.00029827195,"about_ca_system_score_gemma":0.00029838344,"threshold_uncertainty_score":0.010357678},"labels":[],"label_agreement":null},{"id":"W1566277354","doi":"10.1007/11526018_11","title":"Qualitative Reasoning Model for Tradeoff Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Calgary","funders":"","keywords":"Computer science; Qualitative reasoning; Artificial intelligence","score_opus":0.04359065886211399,"score_gpt":0.3191653627257502,"score_spread":0.2755747038636362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566277354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015809252,0.00012857966,0.99005216,0.000493907,0.000039465165,0.00008335483,0.0003396124,0.00015949436,0.007122398],"genre_scores_gemma":[0.28570354,0.0005143352,0.6964257,0.00040822325,0.00012902453,0.0008277916,0.0012379369,0.00014121816,0.014612349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997465,0.0011791094,0.00014045168,0.00033777268,0.0007019732,0.00017559022],"domain_scores_gemma":[0.99409664,0.004243839,0.0002689954,0.00044758813,0.0007793055,0.0001636854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041424907,0.001008985,0.00095182844,0.0014324643,0.0007580746,0.0029030018,0.0031690865,0.0015966067,0.01724593],"category_scores_gemma":[0.01282154,0.0006809183,0.0017321208,0.001529053,0.001827587,0.0038627507,0.0015835771,0.002270755,0.0019201484],"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.00006220368,0.000053440574,0.00019187786,0.00012408537,0.000038650487,0.00011479874,0.00018030638,0.12963909,0.00046363097,0.8416882,0.0028811367,0.024562603],"study_design_scores_gemma":[0.000028096125,0.000013542817,0.000038966115,0.000023517005,0.000020716194,0.000029803417,0.000039816623,0.36493096,0.00029145402,0.6302734,0.004298107,0.000011573516],"about_ca_topic_score_codex":0.0063495054,"about_ca_topic_score_gemma":0.003959636,"teacher_disagreement_score":0.01724593,"about_ca_system_score_codex":0.0029760357,"about_ca_system_score_gemma":0.002211906,"threshold_uncertainty_score":0.057693362},"labels":[],"label_agreement":null},{"id":"W1566323412","doi":"10.1007/11431879_24","title":"The Software Design Board: A Tool Supporting Workstyle Transitions in Collaborative Software Design","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Queen's University","funders":"","keywords":"Software engineering; Software; Software design; Computer science; Engineering; Software development; Operating system","score_opus":0.02516014212673632,"score_gpt":0.2610675294988439,"score_spread":0.23590738737210756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566323412","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.009466363,0.0003226469,0.92183673,0.00033900523,0.00028081078,0.00040887823,0.0007273758,0.049989574,0.016628686],"genre_scores_gemma":[0.07845991,0.0004726248,0.84630287,0.0002524358,0.00008135383,0.0018517425,0.0027499506,0.024212215,0.045616876],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983418,0.0006080916,0.000145541,0.00025328418,0.00052857166,0.0001227508],"domain_scores_gemma":[0.99317,0.004491012,0.00024741777,0.0009924384,0.00046842243,0.0006307134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183497,0.0017015298,0.0009579696,0.0022758695,0.0011094577,0.0044473135,0.0025029262,0.0017673749,0.04374746],"category_scores_gemma":[0.011763317,0.0017485954,0.00089555373,0.0013800892,0.0010104115,0.0058849896,0.0054571936,0.0028617163,0.01286063],"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.0008040572,0.0004701002,0.0014635251,0.0009954337,0.00006363183,0.0006123608,0.008472261,0.0059066773,0.030080492,0.03179699,0.12298841,0.796346],"study_design_scores_gemma":[0.0011199107,0.00059640006,0.0038706511,0.0010271235,0.00015332749,0.0012294641,0.0015620086,0.075467005,0.042072494,0.054434516,0.81810325,0.00036393874],"about_ca_topic_score_codex":0.0008406462,"about_ca_topic_score_gemma":0.0013589433,"teacher_disagreement_score":0.04374746,"about_ca_system_score_codex":0.00059494784,"about_ca_system_score_gemma":0.0008922062,"threshold_uncertainty_score":0.14634979},"labels":[],"label_agreement":null},{"id":"W1566323608","doi":"10.1007/978-3-540-25929-9_69","title":"Utilizing Rough Sets and Multi-objective Genetic Algorithms for Automated Clustering","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Sorting; Heuristic; Data mining; A priori and a posteriori; Genetic algorithm; Domain (mathematical analysis); Algorithm; Correlation clustering; Machine learning; Artificial intelligence; Mathematics","score_opus":0.03542779956530555,"score_gpt":0.28250928898511984,"score_spread":0.24708148941981428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566323608","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.0061972025,0.0002622318,0.99205995,0.000060111357,0.000021374453,0.0000415455,0.000018736027,0.00024530123,0.0010936224],"genre_scores_gemma":[0.08426705,0.00031246094,0.9143466,0.000034853667,0.00003220905,0.000122045865,0.00009065303,0.00007320437,0.00072085916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866545,0.00048526106,0.00007372965,0.00016160174,0.0005408795,0.0000731452],"domain_scores_gemma":[0.9986815,0.0007842284,0.000110336136,0.00018750828,0.00021156584,0.000024851413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025250763,0.0011344629,0.0018587373,0.002375695,0.00081172667,0.002085486,0.001916003,0.0014493549,0.0013188481],"category_scores_gemma":[0.0053684544,0.0008540827,0.0017245084,0.0028403439,0.0009519949,0.0025011376,0.0016806497,0.001382018,0.00057087996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093577946,0.000108318614,0.00048074938,0.00019749033,0.00021032782,0.00007803504,0.00023313462,0.6761375,0.006735078,0.032171443,0.0013412677,0.28221312],"study_design_scores_gemma":[0.000012149083,0.000027547414,0.00017205022,0.00001699361,0.000027889126,0.00002779505,0.00002821763,0.9752587,0.0015466308,0.022155298,0.00070840475,0.000018402181],"about_ca_topic_score_codex":0.002812645,"about_ca_topic_score_gemma":0.003560551,"teacher_disagreement_score":0.002812645,"about_ca_system_score_codex":0.0008700868,"about_ca_system_score_gemma":0.0011273539,"threshold_uncertainty_score":0.013354063},"labels":[],"label_agreement":null},{"id":"W1566359724","doi":"10.1007/978-3-540-87361-7_3","title":"Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Breakpoint; Computer science; Speedup; Combinatorics; Vertex (graph theory); Matching (statistics); Genome; Class (philosophy); Graph; Algorithm; Theoretical computer science; Mathematics; Biology; Parallel computing; Artificial intelligence; Genetics","score_opus":0.012956138607874562,"score_gpt":0.22348722683795594,"score_spread":0.21053108823008138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566359724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037646294,0.00068669027,0.94373167,0.000589783,0.00015053485,0.0001218357,0.00046024556,0.0007188389,0.015894122],"genre_scores_gemma":[0.20618844,0.0010884416,0.77127814,0.00032697027,0.0001609328,0.0003770022,0.0015724597,0.00083328097,0.018174322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.00012466358,0.000022016542,0.00013146747,0.0001402117,0.00008466212],"domain_scores_gemma":[0.9979849,0.0012317903,0.00019711893,0.00027048675,0.00017632375,0.00013940723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086310477,0.0012738876,0.0013323753,0.0015227259,0.00084912387,0.001794236,0.0019764155,0.0012319279,0.014841818],"category_scores_gemma":[0.0076897065,0.0011482195,0.0012578652,0.0020626376,0.0009197403,0.0033040014,0.00282197,0.0030362008,0.0021580637],"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.00051437074,0.00021798821,0.0007429649,0.0004494301,0.00009326535,0.00018644676,0.0005557814,0.31009513,0.007812405,0.37110433,0.035008207,0.27321962],"study_design_scores_gemma":[0.00006770624,0.000039822567,0.00018290205,0.000039375667,0.000020785565,0.0000821093,0.00014297041,0.37825832,0.0011396422,0.61372715,0.006282971,0.00001626103],"about_ca_topic_score_codex":0.0017368062,"about_ca_topic_score_gemma":0.0026512747,"teacher_disagreement_score":0.014841818,"about_ca_system_score_codex":0.0010573554,"about_ca_system_score_gemma":0.0007855424,"threshold_uncertainty_score":0.049650848},"labels":[],"label_agreement":null},{"id":"W1566386223","doi":"10.1007/978-3-540-73289-1_21","title":"Usability Challenges in Designing Foreign Language Keypads for Handheld Devices","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Blackberry (Canada)","funders":"","keywords":"Usability; Mobile device; Computer science; Human–computer interaction; Context (archaeology); Arabic; Foreign language; Point (geometry); Key (lock); Multimedia; World Wide Web; Computer security; Linguistics","score_opus":0.09294590834621078,"score_gpt":0.30733647744137704,"score_spread":0.21439056909516627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566386223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33811897,0.03508423,0.58699113,0.0052990513,0.0009183494,0.0009003036,0.00026368804,0.0030103135,0.029414028],"genre_scores_gemma":[0.5928546,0.0090282,0.38064405,0.001361665,0.00028611417,0.00051607046,0.00024849025,0.0011001158,0.013960744],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941256,0.0026698255,0.00057818095,0.00047760294,0.0018206263,0.0003280312],"domain_scores_gemma":[0.9672599,0.025323536,0.00077700784,0.0014660056,0.0047483025,0.00042515938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008383874,0.0012017981,0.0010054192,0.00082455244,0.00084762677,0.0056774807,0.0024142887,0.0018748973,0.003750541],"category_scores_gemma":[0.030391267,0.0008833409,0.00063413207,0.0006174139,0.0008093034,0.0049204556,0.0017149305,0.0012442755,0.0015071111],"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.00051088963,0.00031871,0.006318411,0.0066722007,0.00020559048,0.0016204659,0.014823781,0.0031787178,0.082474224,0.010120898,0.011999921,0.8617561],"study_design_scores_gemma":[0.0004002439,0.007757035,0.038137183,0.008012592,0.002033087,0.028632864,0.069629684,0.07715678,0.29913002,0.060265813,0.40799487,0.0008497606],"about_ca_topic_score_codex":0.0012263294,"about_ca_topic_score_gemma":0.002119486,"teacher_disagreement_score":0.008383874,"about_ca_system_score_codex":0.00058003614,"about_ca_system_score_gemma":0.0006433661,"threshold_uncertainty_score":0.044338644},"labels":[],"label_agreement":null},{"id":"W1566391339","doi":"10.1007/978-3-540-24654-1_5","title":"On Randomizing Private Keys to Counteract DPA Attacks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptosystem; Scalar multiplication; Computer science; Integer (computer science); Theoretical computer science; Cryptanalysis; Binary number; Public-key cryptography; Power analysis; Discrete mathematics; Scalar (mathematics); Cryptography; Algorithm; Arithmetic; Mathematics; Computer security; Encryption; Programming language","score_opus":0.010846529898640055,"score_gpt":0.24557133814475468,"score_spread":0.23472480824611464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566391339","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.026709042,0.0023365628,0.9335625,0.0017504211,0.00057902973,0.00026794305,0.00014570312,0.0029053937,0.031743497],"genre_scores_gemma":[0.69344175,0.0022410287,0.27461764,0.0015257499,0.0006799664,0.0005589851,0.00044039698,0.00070617406,0.02578813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587053,0.0013849154,0.00018749638,0.00063731323,0.0013903158,0.0005294271],"domain_scores_gemma":[0.9914506,0.0043284544,0.000513391,0.0029061574,0.00060593634,0.00019539907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024616567,0.0017000238,0.0016912831,0.0020256042,0.0011651098,0.00234763,0.0024013002,0.0026789068,0.0049297726],"category_scores_gemma":[0.010208823,0.00086330634,0.0010671467,0.0017394834,0.003814996,0.0066913865,0.004954636,0.0035322122,0.0022382021],"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.0007677954,0.00015963994,0.00073351286,0.00030925972,0.00012234159,0.000191301,0.00027905722,0.06386027,0.019401383,0.67320085,0.0151428655,0.22583175],"study_design_scores_gemma":[0.00013869048,0.00022636983,0.00031374465,0.00009867866,0.000096722535,0.0005261748,0.000086282744,0.32977796,0.023724193,0.6241906,0.020727746,0.000092931936],"about_ca_topic_score_codex":0.0004657102,"about_ca_topic_score_gemma":0.00045514686,"teacher_disagreement_score":0.0049297726,"about_ca_system_score_codex":0.001114743,"about_ca_system_score_gemma":0.0011044971,"threshold_uncertainty_score":0.01649177},"labels":[],"label_agreement":null},{"id":"W1566430846","doi":"10.1007/3-540-45632-5_19","title":"On Implicit Meanings","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Parsing; Symbol (formal); Computation; Natural language processing; Contiguity; Word (group theory); Artificial intelligence; Blocking (statistics); Meaning (existential); State (computer science); Theoretical computer science; Algorithm; Programming language; Linguistics","score_opus":0.013202452917125313,"score_gpt":0.25065263438594015,"score_spread":0.23745018146881483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566430846","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.017697306,0.004079468,0.47577858,0.009163362,0.0017810704,0.000105449726,0.00084896205,0.0007446219,0.48980123],"genre_scores_gemma":[0.6309874,0.005218803,0.1507547,0.0022425626,0.0023594727,0.0005306281,0.0027467504,0.0016858059,0.20347378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772376,0.00078621984,0.0001723453,0.00048152663,0.00062923867,0.00020701111],"domain_scores_gemma":[0.99718696,0.0012838839,0.00011070764,0.0009481883,0.0004033426,0.00006693698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018592231,0.0011880492,0.0011504649,0.0020412218,0.0032845999,0.004577945,0.001958694,0.0021099357,0.036360856],"category_scores_gemma":[0.008628901,0.0011625866,0.0012155952,0.0027795858,0.0066650817,0.03000979,0.0069327755,0.005874699,0.006037707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069844073,0.0000035754806,0.000027792163,0.000026714746,0.0000023163593,0.0000147445635,0.00022531014,0.000081001344,0.00008656982,0.9915658,0.0017031399,0.006256077],"study_design_scores_gemma":[0.0000035868634,0.0000024525264,0.00002987621,0.00001806209,0.0000046984374,0.00002843539,0.000058330832,0.00045678028,0.00012046602,0.9857859,0.01348758,0.000003826949],"about_ca_topic_score_codex":0.00092368387,"about_ca_topic_score_gemma":0.0011124542,"teacher_disagreement_score":0.036360856,"about_ca_system_score_codex":0.0015461986,"about_ca_system_score_gemma":0.000783528,"threshold_uncertainty_score":0.12163919},"labels":[],"label_agreement":null},{"id":"W1566553893","doi":"10.1007/3-540-45253-2_7","title":"Online Algorithms for Caching Multimedia Streams","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Bell (Canada)","funders":"","keywords":"Computer science; Cache; Cache algorithms; False sharing; Competitive analysis; CPU cache; The Internet; Computer network; Online algorithm; Metric (unit); Smart Cache; Algorithm; Parallel computing; Operating system; Upper and lower bounds","score_opus":0.029720099908789127,"score_gpt":0.2885864229711798,"score_spread":0.25886632306239066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566553893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018275797,0.0014790944,0.9696527,0.0005505889,0.00024992443,0.00017990432,0.00030212896,0.0031597854,0.0061500734],"genre_scores_gemma":[0.28955942,0.0014799273,0.691951,0.00031751473,0.0004790241,0.00054270006,0.0010049604,0.0005976685,0.014067871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819654,0.00042266396,0.0001335296,0.00033690958,0.0005617503,0.0003485799],"domain_scores_gemma":[0.99250257,0.00437257,0.00040214483,0.0017137501,0.0007386058,0.000270249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024353515,0.0019525421,0.0027498205,0.0017446887,0.0014631881,0.0038165583,0.0051951245,0.0025739989,0.012060032],"category_scores_gemma":[0.012911694,0.0010380786,0.0008624935,0.004661851,0.0014502703,0.0072519425,0.002800638,0.002435012,0.002097066],"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.0014848553,0.00066845963,0.0009791722,0.00040955338,0.00012631342,0.00011106966,0.00017752402,0.34086117,0.00518277,0.11567574,0.034533076,0.49979022],"study_design_scores_gemma":[0.00012889931,0.000058858484,0.00008981569,0.000018755407,0.000031359024,0.00006912226,0.000035488203,0.9192309,0.0015401691,0.07665592,0.0021267706,0.000014050125],"about_ca_topic_score_codex":0.0047120047,"about_ca_topic_score_gemma":0.0058427714,"teacher_disagreement_score":0.012060032,"about_ca_system_score_codex":0.0027122549,"about_ca_system_score_gemma":0.0022955507,"threshold_uncertainty_score":0.040344894},"labels":[],"label_agreement":null},{"id":"W1566614593","doi":"10.1007/978-3-642-15615-1_17","title":"A New Microphone Array Speech Enhancement Method Based on AR Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","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":"Grace (Canada)","funders":"","keywords":"Computer science; Speech enhancement; Microphone; Autoregressive model; Speech recognition; Microphone array; Speech processing; Noise (video); Linear prediction; Channel (broadcasting); Artificial intelligence; Noise reduction; Mathematics; Telecommunications","score_opus":0.0160747252750402,"score_gpt":0.2657513431590596,"score_spread":0.24967661788401943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566614593","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.0030636827,0.00062233204,0.9932806,0.00004402437,0.00023106247,0.000027785347,0.00004692027,0.0011447556,0.001538965],"genre_scores_gemma":[0.05314402,0.0013963053,0.92995244,0.00019197322,0.00028074736,0.00009228605,0.0003583537,0.00025624014,0.014327567],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959236,0.00005904809,0.000019768411,0.00010072821,0.00020473715,0.000023398345],"domain_scores_gemma":[0.9997396,0.00006929801,0.000014427714,0.00003709779,0.00012394242,0.00001568517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035362953,0.0009780471,0.00076419726,0.00045290156,0.0002053573,0.0004908726,0.00066883647,0.00082764565,0.0046592588],"category_scores_gemma":[0.00045993662,0.0004530987,0.0009474791,0.00044146623,0.0001914512,0.0010537043,0.00047882323,0.0008952002,0.004013014],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028411715,0.00007144367,0.0002211193,0.00022679711,0.00007493904,0.0001566506,0.00006114083,0.0051109763,0.46841195,0.0020717536,0.0034595,0.5198496],"study_design_scores_gemma":[0.00010461163,0.0006699315,0.0024913335,0.00004965937,0.0003696553,0.0032741996,0.00006253829,0.5022334,0.42278862,0.0015937524,0.06620815,0.00015411428],"about_ca_topic_score_codex":0.0004402104,"about_ca_topic_score_gemma":0.00082830596,"teacher_disagreement_score":0.0046592588,"about_ca_system_score_codex":0.00011040117,"about_ca_system_score_gemma":0.00022794743,"threshold_uncertainty_score":0.015586793},"labels":[],"label_agreement":null},{"id":"W1566644791","doi":"10.1007/11814771_52","title":"On Keys and Functional Dependencies as First-Class Citizens in Description Logics","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":44,"is_retracted":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":"Decidability; Negation; Identification (biology); Dependency theory (database theory); Scope (computer science); Computer science; Class (philosophy); Monotone polygon; Functional dependency; Theoretical computer science; Logical consequence; Mathematics; Programming language; Artificial intelligence; Data mining","score_opus":0.025352472396076017,"score_gpt":0.2213176776993242,"score_spread":0.19596520530324818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566644791","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.01825588,0.0025199673,0.93913066,0.0034213145,0.00030820872,0.00009206797,0.00044395134,0.0006050309,0.03522291],"genre_scores_gemma":[0.50981075,0.0055720187,0.45221132,0.0018489342,0.00070284226,0.00043219415,0.0015738147,0.0008402347,0.027007846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995981,0.0016801086,0.00038085258,0.00071492343,0.00080414925,0.00043898323],"domain_scores_gemma":[0.991771,0.006045138,0.0002378658,0.0012896484,0.00039649836,0.00025987404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062840274,0.00117797,0.0015275177,0.0022608861,0.0026446949,0.007036426,0.0030207024,0.0028840934,0.0051740594],"category_scores_gemma":[0.009940195,0.0020311843,0.0030061675,0.0045499112,0.010092569,0.039133444,0.0045558736,0.007904808,0.0011100279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015170001,0.000009174041,0.0000771909,0.000034145167,0.0000054062816,0.000031366882,0.00030793226,0.0007374896,0.00011647712,0.9906426,0.0007070656,0.007315924],"study_design_scores_gemma":[0.0000055769133,0.0000036908352,0.0000220166,0.000020111027,0.000011569957,0.000023219814,0.000057827998,0.0026744956,0.0002314594,0.9935049,0.0034384131,0.000006751593],"about_ca_topic_score_codex":0.0056470255,"about_ca_topic_score_gemma":0.0046814694,"teacher_disagreement_score":0.007036426,"about_ca_system_score_codex":0.0041978145,"about_ca_system_score_gemma":0.0016224742,"threshold_uncertainty_score":0.033233523},"labels":[],"label_agreement":null},{"id":"W1566659289","doi":"10.1007/978-3-540-24854-5_9","title":"Bluenome: A Novel Developmental Model of Artificial Morphogenesis","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"Concordia University","funders":"","keywords":"Computer science; Cellular automaton; Artificial life; Component (thermodynamics); Morphogenesis; Feature (linguistics); Relation (database); Automaton; Development (topology); Theoretical computer science; Artificial intelligence; Biology; Mathematics; Data mining","score_opus":0.02916209321312204,"score_gpt":0.2340792648274338,"score_spread":0.20491717161431175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566659289","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.03593755,0.0005010355,0.92488104,0.0007942285,0.00017075299,0.000049158807,0.0002489137,0.00094696414,0.03647033],"genre_scores_gemma":[0.54512537,0.0011811572,0.4040681,0.00039971835,0.000120389195,0.00027980463,0.00038190014,0.0006347935,0.047808748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990416,0.000022046148,0.00000362063,0.000025802006,0.00003354056,0.0000108644845],"domain_scores_gemma":[0.9998838,0.000044334458,0.00001364459,0.00002238672,0.000014076131,0.000021882548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017758792,0.0003268113,0.0004385704,0.00038633624,0.00052553095,0.0011730923,0.0011453567,0.0010922727,0.003807671],"category_scores_gemma":[0.0005396054,0.0002950415,0.0005504314,0.00034819372,0.0011964445,0.0012714711,0.0011537408,0.0010098933,0.00069316145],"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.000033311622,0.000016392403,0.00021616348,0.00005589047,0.00000901415,0.00015885192,0.0001396198,0.08347132,0.010952323,0.88834226,0.001907697,0.014697167],"study_design_scores_gemma":[0.00003067453,0.00002647363,0.00014715087,0.000013046762,0.0000111516565,0.00021174956,0.000026840953,0.5557472,0.0034818584,0.4156711,0.024616292,0.000016407686],"about_ca_topic_score_codex":0.0012583805,"about_ca_topic_score_gemma":0.0013154335,"teacher_disagreement_score":0.003807671,"about_ca_system_score_codex":0.0005034241,"about_ca_system_score_gemma":0.00049338577,"threshold_uncertainty_score":0.01273793},"labels":[],"label_agreement":null},{"id":"W1566692580","doi":"10.1007/bfb0038192","title":"Object-oriented distributed artificial intelligence","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Calgary","funders":"","keywords":"Maintainability; Object-oriented programming; Computer science; Modularity (biology); Distributed object; Field (mathematics); Artificial intelligence; Software; Object (grammar); Distributed computing; Distributed design patterns; Software engineering; Distributed algorithm; Programming language","score_opus":0.024204096992465163,"score_gpt":0.2540244815868124,"score_spread":0.22982038459434723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566692580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031446654,0.003953941,0.9214273,0.00087221625,0.000881976,0.00018444023,0.00009830754,0.0026788067,0.066758275],"genre_scores_gemma":[0.0908852,0.008117301,0.75233614,0.0009814834,0.0008371423,0.0006305766,0.001246494,0.001618231,0.14334737],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991093,0.00021212085,0.0000715322,0.00010474728,0.00044920205,0.000052894342],"domain_scores_gemma":[0.9992812,0.0002489402,0.000029232473,0.00028951108,0.000110246365,0.000040962645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013392556,0.0009400715,0.0011643842,0.00071141403,0.00068825146,0.003508291,0.0020464251,0.0011285938,0.011170444],"category_scores_gemma":[0.0018732081,0.0007918899,0.0005254854,0.0015671282,0.0011642305,0.0032840318,0.0016587141,0.0019439916,0.0044335313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009439995,0.00017667958,0.00029880236,0.00046441585,0.000082708575,0.00016327067,0.00043999226,0.008263966,0.00378166,0.43577617,0.046878077,0.50357985],"study_design_scores_gemma":[0.00010332885,0.00005265466,0.0003420054,0.00016239703,0.00010428696,0.00037027846,0.00008226389,0.061754584,0.004241993,0.5844839,0.3482715,0.00003077999],"about_ca_topic_score_codex":0.0006355682,"about_ca_topic_score_gemma":0.00068503385,"teacher_disagreement_score":0.011170444,"about_ca_system_score_codex":0.00048800177,"about_ca_system_score_gemma":0.0006869442,"threshold_uncertainty_score":0.037368894},"labels":[],"label_agreement":null},{"id":"W1566700068","doi":"10.1007/978-3-540-74827-4_125","title":"Estimation of Initial Contour Based on Edge Background Subtraction for Self-affine Mapping System","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Affine transformation; Computer science; Artificial intelligence; Background subtraction; Computer vision; Subtraction; Interpolation (computer graphics); Similarity (geometry); Pattern recognition (psychology); Algorithm; Pixel; Mathematics; Image (mathematics); Geometry; Arithmetic","score_opus":0.030272959619495308,"score_gpt":0.2958687282389586,"score_spread":0.26559576861946327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566700068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055555366,0.00040243537,0.9395332,0.00006220988,0.000063882355,0.00005954587,0.000079271435,0.0014730748,0.0027709499],"genre_scores_gemma":[0.4429259,0.0007734195,0.5486781,0.000060852723,0.000038418184,0.00006521842,0.0005024134,0.00022069822,0.006735025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998185,0.000017654742,0.000008542863,0.000049123475,0.00007996807,0.000026177759],"domain_scores_gemma":[0.99982375,0.000031412932,0.000016623979,0.00002782334,0.000088533176,0.000011931411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002167254,0.0005401786,0.0005348333,0.00074535183,0.00028589982,0.0006968145,0.0006750221,0.0006133605,0.0023305735],"category_scores_gemma":[0.0005080628,0.00034592414,0.0004335292,0.0005346269,0.0001809375,0.00066325406,0.0004065438,0.00050744426,0.0013418754],"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.0004747988,0.000091358575,0.0022678575,0.00015035215,0.000047086607,0.00020867164,0.00013568516,0.02682226,0.2522284,0.0023320345,0.0020484605,0.71319306],"study_design_scores_gemma":[0.000023984685,0.00016601788,0.0071004224,0.000026154134,0.00006080763,0.00044002503,0.000056719062,0.79612446,0.19033614,0.0014389048,0.0041855476,0.000040811],"about_ca_topic_score_codex":0.0015776182,"about_ca_topic_score_gemma":0.0016137095,"teacher_disagreement_score":0.0023305735,"about_ca_system_score_codex":0.00024328877,"about_ca_system_score_gemma":0.00044799477,"threshold_uncertainty_score":0.007796526},"labels":[],"label_agreement":null},{"id":"W1566836766","doi":"10.1007/978-3-642-03767-2_39","title":"A Spatio-Temporal Isotropic Operator for the Attention-Point Extraction","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Operator (biology); Artificial intelligence; Computer vision; Homogeneity (statistics); Change detection; Maxima and minima; Pattern recognition (psychology); Point (geometry); Contrast (vision); Object detection; Isotropy; Mathematics; Optics; Physics; Geometry","score_opus":0.0217535282432012,"score_gpt":0.2837620918691948,"score_spread":0.2620085636259936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566836766","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.0022941383,0.00012620853,0.99643433,0.00004779831,0.00004268189,0.000036118614,0.000078360776,0.0004119499,0.0005283666],"genre_scores_gemma":[0.041568514,0.00031523648,0.95475173,0.00007917131,0.000099721394,0.00013374034,0.00029856208,0.00022893581,0.002524428],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995783,0.00005447314,0.000033684115,0.00009787798,0.00018117618,0.000054531305],"domain_scores_gemma":[0.9994137,0.00017916763,0.000042100823,0.00009427884,0.00020561642,0.0000651381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007734056,0.0007054718,0.0009700019,0.001457115,0.00041248204,0.001091439,0.0011496164,0.0008836308,0.00618319],"category_scores_gemma":[0.0018218412,0.00037103068,0.0010850669,0.0017214556,0.00054404134,0.001141806,0.0012715601,0.001223161,0.0018632484],"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.0002837396,0.00009486771,0.00027464997,0.00023350157,0.00005097116,0.00012975167,0.00009151119,0.005952135,0.17065918,0.029448157,0.00605275,0.7867287],"study_design_scores_gemma":[0.000079171834,0.00028364928,0.0030503068,0.00005733256,0.00012027768,0.0007716252,0.00010295422,0.8166946,0.114101194,0.03766073,0.02697893,0.00009922667],"about_ca_topic_score_codex":0.0030438835,"about_ca_topic_score_gemma":0.004731934,"teacher_disagreement_score":0.00618319,"about_ca_system_score_codex":0.00043436437,"about_ca_system_score_gemma":0.0012380466,"threshold_uncertainty_score":0.020684779},"labels":[],"label_agreement":null},{"id":"W1566867090","doi":"10.1007/11605300_3","title":"ScoPred–Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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 Windsor","funders":"","keywords":"Computer science; Scalability; Data mining; Database","score_opus":0.07674258913131232,"score_gpt":0.25628334832459787,"score_spread":0.17954075919328555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566867090","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.06250524,0.0005368118,0.92182314,0.0002508127,0.0001364687,0.00012895917,0.0005932746,0.011608711,0.0024166715],"genre_scores_gemma":[0.74532026,0.00033000033,0.25012812,0.00011186212,0.000121681835,0.0001449547,0.0011493108,0.0005178671,0.002175922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994253,0.000100188714,0.000041426654,0.00014366079,0.00022959971,0.00005988478],"domain_scores_gemma":[0.9976432,0.0009996549,0.00018097466,0.00073358027,0.00032955472,0.000113029324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010028974,0.0013662935,0.001510343,0.00095109735,0.00047355087,0.0011199927,0.002101741,0.00062270096,0.0015640924],"category_scores_gemma":[0.0037418122,0.00060582685,0.0006514113,0.0011466531,0.0005036929,0.0023732586,0.0012413261,0.0012566911,0.0005667174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019092814,0.00014984036,0.0027320376,0.000065686276,0.00010160126,0.00008039114,0.00005053084,0.7811041,0.003233232,0.003739019,0.0064325216,0.20212017],"study_design_scores_gemma":[0.0000034332556,0.000007606013,0.000108266104,0.000001073141,0.0000021810242,0.0000070567266,0.0000013866448,0.99745804,0.00064780965,0.0015795672,0.00018064195,0.0000029482926],"about_ca_topic_score_codex":0.009045718,"about_ca_topic_score_gemma":0.007446205,"teacher_disagreement_score":0.009045718,"about_ca_system_score_codex":0.00082557293,"about_ca_system_score_gemma":0.0010866103,"threshold_uncertainty_score":0.017986119},"labels":[],"label_agreement":null},{"id":"W1566904115","doi":"10.1007/3-540-46423-9_8","title":"Simple Generation of Static Single-Assignment Form","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Simple (philosophy); Compiler; Compile time; Simplicity; Control flow graph; Algorithm; Control flow; Data-flow analysis; Data flow diagram; Parallel computing; Theoretical computer science; Programming language","score_opus":0.031647111147874996,"score_gpt":0.25784048052322434,"score_spread":0.22619336937534934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566904115","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.019235745,0.00014187863,0.88795054,0.00034212208,0.0008344812,0.0005180631,0.001702051,0.013526766,0.07574834],"genre_scores_gemma":[0.22791003,0.000229665,0.6832977,0.00033801384,0.0002817784,0.0006915483,0.0035772282,0.008789258,0.07488487],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989832,0.00018337138,0.000066895045,0.00023285847,0.00038767298,0.00014603755],"domain_scores_gemma":[0.9985525,0.00033044448,0.00005037526,0.000570076,0.0004443683,0.00005227299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715794,0.0012497813,0.0009935123,0.001231614,0.0013287301,0.0016753721,0.0016433039,0.000855191,0.069021046],"category_scores_gemma":[0.004391309,0.00081697165,0.0011551243,0.0014303671,0.00089125667,0.0023816389,0.0028335415,0.0013059623,0.022502009],"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.00035908708,0.00016004167,0.0007484514,0.0005303419,0.000052501746,0.0006279886,0.0005303114,0.010602055,0.018570907,0.37473965,0.08114853,0.51193005],"study_design_scores_gemma":[0.00013976762,0.00016134755,0.00048003747,0.00012600656,0.00010580341,0.0008921784,0.00027762796,0.09967492,0.045850206,0.6248734,0.22730789,0.00011078905],"about_ca_topic_score_codex":0.0004638837,"about_ca_topic_score_gemma":0.0010919976,"teacher_disagreement_score":0.069021046,"about_ca_system_score_codex":0.0005767195,"about_ca_system_score_gemma":0.001034692,"threshold_uncertainty_score":0.23089838},"labels":[],"label_agreement":null},{"id":"W1566915699","doi":"10.1007/978-3-540-73078-1_54","title":"Multiple Evidence Combination in Web Site Search Based on Users’ Access Histories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"IBM (Canada); Toronto Metropolitan University","funders":"","keywords":"Computer science; Web site; Information retrieval; Search engine; World Wide Web; Baseline (sea); Web server; Data mining; The Internet","score_opus":0.06809082929141408,"score_gpt":0.3126195281885981,"score_spread":0.24452869889718404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566915699","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.5571485,0.016964268,0.41430026,0.0018556628,0.00029178642,0.00053539296,0.002232512,0.0014635307,0.005208123],"genre_scores_gemma":[0.9035941,0.0011269666,0.09145001,0.00011477553,0.0002568462,0.00015278069,0.0013810161,0.00006162034,0.0018620228],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98958033,0.0038698595,0.0012707193,0.0010608165,0.0036474366,0.00057086605],"domain_scores_gemma":[0.91091037,0.08102784,0.002021165,0.002108688,0.003034403,0.00089756004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010117514,0.001245727,0.00400758,0.016131222,0.0013620963,0.0043342174,0.0032388775,0.004718398,0.0025036049],"category_scores_gemma":[0.045516644,0.0015578542,0.0025874462,0.010948057,0.001222447,0.0081770085,0.0023273006,0.002571729,0.0008247171],"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.0068802168,0.0018279853,0.14373368,0.0019394987,0.0029321928,0.0024548501,0.00085529,0.11719844,0.008617589,0.0071038157,0.005514776,0.7009417],"study_design_scores_gemma":[0.00016225674,0.0003762965,0.017550053,0.00018494463,0.0013486694,0.0012537829,0.00032223584,0.9580959,0.005070043,0.01415076,0.0013701392,0.00011485575],"about_ca_topic_score_codex":0.0050131753,"about_ca_topic_score_gemma":0.008970338,"teacher_disagreement_score":0.016131222,"about_ca_system_score_codex":0.0010544393,"about_ca_system_score_gemma":0.0017335668,"threshold_uncertainty_score":0.05350715},"labels":[],"label_agreement":null},{"id":"W1567002736","doi":"10.1007/11915034_4","title":"A Unified Model for Information Integration","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Dimension (graph theory); Basis (linear algebra); Domain (mathematical analysis); Object (grammar); Theoretical computer science; Relational model; Space (punctuation); Relational database; Information integration; Algebra over a field; Algorithm; Data mining; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.023671685892037685,"score_gpt":0.24627911365108357,"score_spread":0.22260742775904588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567002736","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.0013515691,0.0010100884,0.977625,0.0013157388,0.00018676731,0.00016956516,0.00035095887,0.0015634898,0.016426899],"genre_scores_gemma":[0.063351005,0.0019065714,0.9163099,0.00075175555,0.00030006154,0.0007672661,0.0016407227,0.0006408792,0.014331896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510634,0.0013030316,0.00069220783,0.0008229623,0.0017005817,0.00037489482],"domain_scores_gemma":[0.9973194,0.0006692017,0.00013656968,0.0010617475,0.0006523308,0.00016068915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004215776,0.0013923229,0.0021478992,0.0042818724,0.0027199115,0.012128525,0.005278148,0.004297006,0.012050248],"category_scores_gemma":[0.007808305,0.0017738163,0.0039132955,0.0067743952,0.004123704,0.023979416,0.0072284406,0.0047136825,0.0062601888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020901114,0.000033958164,0.0001388679,0.00011438561,0.000039810304,0.00011140591,0.00033355082,0.0042887186,0.0003932015,0.9589131,0.0055008344,0.030111274],"study_design_scores_gemma":[0.00002429384,0.000022172804,0.00006521923,0.00011321883,0.0000877342,0.00017825485,0.00012509052,0.0452889,0.000692412,0.88700795,0.06636165,0.000033061086],"about_ca_topic_score_codex":0.0069330153,"about_ca_topic_score_gemma":0.0059681796,"teacher_disagreement_score":0.012128525,"about_ca_system_score_codex":0.0028261235,"about_ca_system_score_gemma":0.0035145201,"threshold_uncertainty_score":0.04031205},"labels":[],"label_agreement":null},{"id":"W1567074120","doi":"10.1007/978-3-540-72665-4_43","title":"Rethinking the Semantics of Complex Nominals","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Windsor","funders":"","keywords":"Computer science; Adjective; Natural language processing; Noun; Noun phrase; Artificial intelligence; Principle of compositionality; Semantics (computer science); Intersection (aeronautics); Head (geology); Set (abstract data type); Semantic property; Linguistics; Programming language; Philosophy","score_opus":0.04568903296887927,"score_gpt":0.3024490970901756,"score_spread":0.2567600641212963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567074120","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.030943992,0.0027796142,0.90100193,0.0070488215,0.0015485918,0.00007581416,0.00046369448,0.002426973,0.05371056],"genre_scores_gemma":[0.53510654,0.002773944,0.4324648,0.0022642906,0.0012971986,0.0001126606,0.0008819322,0.0032765884,0.021822039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966949,0.0011950536,0.0003087176,0.0006474853,0.00091750454,0.00023638348],"domain_scores_gemma":[0.99358577,0.0032909454,0.00025994048,0.0017542962,0.0009469759,0.00016202962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042680134,0.0010180149,0.0011348617,0.001744986,0.0023914932,0.009070316,0.0042061266,0.0026730301,0.009168665],"category_scores_gemma":[0.011989308,0.0014686112,0.001888067,0.0020024069,0.010575611,0.030085208,0.0070111346,0.0054566343,0.0021791614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032247262,0.000009950317,0.00012835771,0.00007847413,0.000010945118,0.00005941121,0.00089834834,0.0010533803,0.0009674923,0.97664136,0.0021827526,0.017937329],"study_design_scores_gemma":[0.000009637068,0.000008576366,0.000065033804,0.00003688461,0.000014582935,0.000068292,0.00021765604,0.004999531,0.0008400544,0.9653863,0.02833481,0.00001877378],"about_ca_topic_score_codex":0.003937159,"about_ca_topic_score_gemma":0.0055203494,"teacher_disagreement_score":0.009168665,"about_ca_system_score_codex":0.0027357605,"about_ca_system_score_gemma":0.0015593434,"threshold_uncertainty_score":0.030672193},"labels":[],"label_agreement":null},{"id":"W1567114901","doi":"10.1007/978-3-540-77704-5_47","title":"Reducing Energy in Instruction Caches by Using Multiple Line Buffers with Prediction","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"York University; Queen's University","funders":"","keywords":"Cache; Computer science; Cache algorithms; Cache pollution; Smart Cache; Cache coloring; Cache invalidation; Page cache; MESI protocol; CPU cache; Parallel computing; Energy consumption; Embedded system; Engineering","score_opus":0.018008657117691205,"score_gpt":0.2263887488838319,"score_spread":0.2083800917661407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567114901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39086047,0.010210522,0.56306595,0.0013115203,0.00092349085,0.00012737198,0.00060870755,0.013253025,0.01963889],"genre_scores_gemma":[0.86150014,0.0009754364,0.12515634,0.00032916534,0.00017322702,0.000086849366,0.00041770452,0.0003864364,0.010974576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.000024868898,0.000014365874,0.000042790038,0.0000655077,0.000047031306],"domain_scores_gemma":[0.9993599,0.0002780477,0.00006963959,0.00013297306,0.00012806054,0.00003128788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020046844,0.000945157,0.00056242547,0.00053398847,0.0005601747,0.000961983,0.0021545752,0.0004846559,0.0069405898],"category_scores_gemma":[0.0009467843,0.00051027373,0.00033410336,0.0012891239,0.00022865662,0.0022940342,0.0006076362,0.00082498114,0.0007385478],"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.0016753491,0.0006033768,0.0038972225,0.00048709312,0.0001607766,0.0003165443,0.00015608035,0.17279236,0.2113859,0.014303293,0.021350391,0.5728716],"study_design_scores_gemma":[0.00014392762,0.0009927163,0.0017482965,0.0000703355,0.00023408596,0.00032354426,0.000078110585,0.7839583,0.1847299,0.012899062,0.0147487605,0.00007296784],"about_ca_topic_score_codex":0.0019402131,"about_ca_topic_score_gemma":0.006260141,"teacher_disagreement_score":0.0069405898,"about_ca_system_score_codex":0.00068916415,"about_ca_system_score_gemma":0.00095808686,"threshold_uncertainty_score":0.023218632},"labels":[],"label_agreement":null},{"id":"W1567210728","doi":"10.1007/978-3-642-15705-9_50","title":"Regional Heart Motion Abnormality Detection via Information Measures and Unscented Kalman Filtering","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","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":"Western University; London Health Sciences Centre; St Joseph's Health Care; CARE Canada","funders":"","keywords":"Kalman filter; Computer science; Abnormality; Artificial intelligence; Motion (physics); Computer vision; Medicine; Psychiatry","score_opus":0.014791458887987014,"score_gpt":0.2822918963882326,"score_spread":0.2675004375002456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567210728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013365477,0.00029987225,0.9857977,0.000059790902,0.000024347248,0.000011816552,0.00003394142,0.00016190275,0.0002451424],"genre_scores_gemma":[0.48185524,0.0006980923,0.51510274,0.00009313846,0.0001250514,0.00007973806,0.00024411647,0.00008282081,0.0017190152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932206,0.00013932909,0.00006338612,0.0001876563,0.00023741125,0.00005018527],"domain_scores_gemma":[0.99842227,0.00087570323,0.00021295912,0.00012936372,0.00032637152,0.00003338661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011150999,0.00059885683,0.0010969673,0.0013208707,0.0002710538,0.0009411102,0.00068153406,0.00073527434,0.0006601347],"category_scores_gemma":[0.0053046267,0.00044573945,0.00091239024,0.00079776463,0.0004549673,0.001429868,0.0007745369,0.00069372676,0.0002722823],"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.00059795816,0.0001676087,0.006990753,0.00029063426,0.000297035,0.00022366257,0.00023319013,0.15431605,0.05019891,0.011212342,0.0013430727,0.77412885],"study_design_scores_gemma":[0.000021074338,0.00015458178,0.0061056307,0.000019399227,0.00010180234,0.00019167819,0.000024342458,0.97511756,0.012665495,0.004743696,0.0008147267,0.00003998238],"about_ca_topic_score_codex":0.0019781177,"about_ca_topic_score_gemma":0.0021045613,"teacher_disagreement_score":0.0019781177,"about_ca_system_score_codex":0.00034174533,"about_ca_system_score_gemma":0.0005810036,"threshold_uncertainty_score":0.0058972836},"labels":[],"label_agreement":null},{"id":"W1567226471","doi":"10.1007/978-3-642-23623-5_33","title":"Automatic Trajectory Planning of DBS Neurosurgery from Multi-modal MRI Datasets","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deep brain stimulation; Trajectory; Neurosurgery; Computer science; Subthalamic nucleus; Modal; Surgical planning; Identification (biology); Artificial intelligence; Medicine; Radiology; Physics; Pathology","score_opus":0.049036291623237575,"score_gpt":0.29075886756932107,"score_spread":0.24172257594608348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567226471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21319109,0.002310227,0.764715,0.00088276685,0.00016928364,0.00035439426,0.004973433,0.010086471,0.0033172194],"genre_scores_gemma":[0.6205119,0.00092842506,0.37027773,0.00009932122,0.000047073292,0.00018499901,0.0052729365,0.0005788979,0.002098738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975246,0.000042242078,0.000018510847,0.00006422709,0.00008473724,0.000037887516],"domain_scores_gemma":[0.99945277,0.00025347658,0.000058624933,0.00005988357,0.00013406563,0.000041203286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060317,0.0009725884,0.0007480084,0.0016107138,0.00052685506,0.0011383404,0.00086216326,0.0010109392,0.0015475309],"category_scores_gemma":[0.0019534419,0.0008792786,0.00082522014,0.0015672611,0.0003327026,0.0005250511,0.0007122277,0.0009199458,0.00062025024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008975708,0.0001342367,0.0036323133,0.00036428156,0.00015601519,0.0005422585,0.0002413665,0.5562692,0.019345064,0.0028957254,0.014721227,0.40080068],"study_design_scores_gemma":[0.000022136674,0.000047926656,0.0011472687,0.000023733563,0.000022064487,0.00014675279,0.000066321445,0.9871056,0.006375931,0.0034650562,0.0015569386,0.000020281524],"about_ca_topic_score_codex":0.025958015,"about_ca_topic_score_gemma":0.048958134,"teacher_disagreement_score":0.025958015,"about_ca_system_score_codex":0.0008535388,"about_ca_system_score_gemma":0.0028224129,"threshold_uncertainty_score":0.051613808},"labels":[],"label_agreement":null},{"id":"W1567303590","doi":"10.1007/978-3-642-13529-3_73","title":"Application of Fuzzy Preference Based Rough Set Model to Condition Monitoring","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Alberta","funders":"","keywords":"Computer science; Condition monitoring; Fuzzy logic; Rough set; Impeller; Monotonic function; Preference; Data mining; Set (abstract data type); Artificial intelligence; Fault detection and isolation; Pattern recognition (psychology); Machine learning; Mathematics; Statistics; Engineering","score_opus":0.04541831802623707,"score_gpt":0.2731261469822349,"score_spread":0.22770782895599784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567303590","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.008541515,0.00039553252,0.9895253,0.00007976865,0.000034224347,0.00003129809,0.000028634207,0.00016355247,0.0012001247],"genre_scores_gemma":[0.63615376,0.0007412171,0.3611221,0.000049478156,0.00006487334,0.0000953449,0.00009223589,0.000036824134,0.0016442096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986028,0.00051448756,0.000105456755,0.00018566842,0.0005155162,0.00007602759],"domain_scores_gemma":[0.9989274,0.0006012295,0.00010621423,0.00012637803,0.00020856674,0.000030194706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015714555,0.0005869899,0.001471956,0.0010518574,0.0004335292,0.0014504375,0.001367402,0.0007129541,0.0012746425],"category_scores_gemma":[0.003943546,0.0003786978,0.0014445446,0.0015139442,0.0005563473,0.0018534668,0.0007829313,0.00081516907,0.00019420723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026207426,0.00011188949,0.0009519226,0.00034796481,0.0002084854,0.0003321572,0.00027411594,0.7050931,0.00874683,0.06117553,0.0018889538,0.22060707],"study_design_scores_gemma":[0.00000996035,0.00006292158,0.0002392354,0.000009948418,0.00003754955,0.00008112413,0.000022246526,0.9786896,0.0015671416,0.018547291,0.00071093865,0.00002211445],"about_ca_topic_score_codex":0.0027307798,"about_ca_topic_score_gemma":0.0017275139,"teacher_disagreement_score":0.0027307798,"about_ca_system_score_codex":0.0007645867,"about_ca_system_score_gemma":0.0008021814,"threshold_uncertainty_score":0.008310795},"labels":[],"label_agreement":null},{"id":"W1567305107","doi":"10.1007/978-3-540-87989-3_12","title":"Perfect DCJ Rearrangement","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Simon Fraser University","funders":"","keywords":"Sorting; Computer science; Combinatorics; Separable space; Join (topology); Mathematics; Algorithm","score_opus":0.01316899368788779,"score_gpt":0.23074670507428532,"score_spread":0.21757771138639753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567305107","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085666195,0.0016016387,0.21890178,0.0012123854,0.0031513593,0.00025467895,0.0025579084,0.003871528,0.68278265],"genre_scores_gemma":[0.6210827,0.0012273547,0.088508785,0.0013012777,0.000658693,0.00024776792,0.004897992,0.002178536,0.2798968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993043,0.00004515235,0.00003098683,0.0002428894,0.00021526833,0.00016137435],"domain_scores_gemma":[0.99922884,0.00009683258,0.00006873934,0.00034758466,0.00014443486,0.00011355975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003313156,0.00051951775,0.0006689273,0.0013605024,0.0016675727,0.0021734217,0.0010925713,0.0008860704,0.060474146],"category_scores_gemma":[0.0017827649,0.000446486,0.00053858565,0.0012715124,0.0014516348,0.00228352,0.001993812,0.0014148363,0.012232646],"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.00015007136,0.00005377258,0.00048026958,0.00026617217,0.000023540031,0.0002132222,0.0001471405,0.0038369896,0.016621806,0.7861577,0.049392734,0.14265649],"study_design_scores_gemma":[0.00007212055,0.0001165449,0.0011580088,0.00009535623,0.000055279448,0.0012239121,0.00025378919,0.014712922,0.02708749,0.69491875,0.26022577,0.00008009105],"about_ca_topic_score_codex":0.0007302803,"about_ca_topic_score_gemma":0.0011839669,"teacher_disagreement_score":0.060474146,"about_ca_system_score_codex":0.00057000347,"about_ca_system_score_gemma":0.00092620123,"threshold_uncertainty_score":0.20230615},"labels":[],"label_agreement":null},{"id":"W1567342171","doi":"10.1007/978-3-540-28629-5_58","title":"Angles and Lengths in Reconfigurations of Polygons and Polyhedra","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monotone polygon; Polyhedron; Regular polygon; Polygon (computer graphics); Enhanced Data Rates for GSM Evolution; Control reconfiguration; Rectilinear polygon; Combinatorics; Morphing; Simple (philosophy); Point in polygon; Computer science; Monotonic function; Convex polygon; Mathematics; Simple polygon; Geometry; Computer graphics (images); Artificial intelligence","score_opus":0.007313359913286071,"score_gpt":0.1983564366959829,"score_spread":0.19104307678269683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567342171","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.25300917,0.007959777,0.5351097,0.0007528705,0.0018393411,0.000078601355,0.00056628283,0.00075373106,0.19993052],"genre_scores_gemma":[0.8171408,0.0046591964,0.1294592,0.00016672879,0.0007772288,0.00011022414,0.0006508629,0.0004982618,0.046537433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942183,0.00013392488,0.000040874238,0.000114585775,0.00021752545,0.000071276016],"domain_scores_gemma":[0.9993432,0.00028337692,0.00012102769,0.00007847869,0.00007940831,0.00009441264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031680637,0.00065809756,0.00052632176,0.0015595744,0.00060601655,0.00196894,0.00088231463,0.00049389846,0.006068899],"category_scores_gemma":[0.0021152887,0.00060285407,0.0005157278,0.0020479544,0.0020114149,0.0021868278,0.0010456677,0.0013357506,0.001091267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015521326,0.000037949216,0.00076649914,0.00014907708,0.000010697649,0.0001779629,0.0004533257,0.04643949,0.00633806,0.7864207,0.005007568,0.15404353],"study_design_scores_gemma":[0.00002137535,0.00007683075,0.0008887235,0.00004351648,0.00001134138,0.00029062203,0.00032545545,0.04365133,0.0019902873,0.92856693,0.024100387,0.000033213015],"about_ca_topic_score_codex":0.00075408514,"about_ca_topic_score_gemma":0.0010822332,"teacher_disagreement_score":0.006068899,"about_ca_system_score_codex":0.00051234703,"about_ca_system_score_gemma":0.00018584385,"threshold_uncertainty_score":0.020302415},"labels":[],"label_agreement":null},{"id":"W1567356114","doi":"10.1007/978-3-642-00867-2_11","title":"DREP: A Requirements Engineering Process for Dependable Reactive Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Interrupt; Process (computing); Context (archaeology); Requirements engineering; Reliability (semiconductor); Software engineering; Quality (philosophy); Risk analysis (engineering); Systems engineering; Engineering; Programming language; Embedded system","score_opus":0.030033471474984044,"score_gpt":0.2976352152486902,"score_spread":0.26760174377370616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567356114","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.0009429174,0.000027196125,0.9910453,0.00008488361,0.000015937754,0.0001366538,0.0001689122,0.0039477656,0.003630408],"genre_scores_gemma":[0.024681825,0.00017993535,0.964131,0.00011026072,0.0000189155,0.00029680697,0.0009717968,0.0026279474,0.006981617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808985,0.0005605376,0.00012511604,0.00024417392,0.0008694785,0.00011075801],"domain_scores_gemma":[0.997317,0.0015757723,0.0001388611,0.00055182877,0.00035281054,0.000063598585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026734893,0.0015660557,0.0006304183,0.0010739763,0.0006154927,0.0018855131,0.001697239,0.0011252359,0.0144784385],"category_scores_gemma":[0.008863811,0.0013714717,0.0013636351,0.0007445741,0.00085960515,0.0027155327,0.0025536935,0.0024375175,0.0076644267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014828047,0.00018816748,0.00039507553,0.0009926341,0.00006913198,0.0010322544,0.0015202756,0.09573122,0.034304332,0.17693955,0.040190395,0.64848864],"study_design_scores_gemma":[0.00011672917,0.0001750769,0.0005441833,0.0003729622,0.00008010905,0.0012851089,0.00043161117,0.4566741,0.062138587,0.20058458,0.27745417,0.00014292453],"about_ca_topic_score_codex":0.001157068,"about_ca_topic_score_gemma":0.0019165601,"teacher_disagreement_score":0.0144784385,"about_ca_system_score_codex":0.0004860948,"about_ca_system_score_gemma":0.0011901871,"threshold_uncertainty_score":0.04843521},"labels":[],"label_agreement":null},{"id":"W1567360982","doi":"10.1007/978-3-642-17746-0_45","title":"Preference-Based Web Service Composition: A Middle Ground between Execution and Search","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Task (project management); Composition (language); Web service; Context (archaeology); Preference; Service (business); Quality (philosophy); Quality of service; World Wide Web; Database; Computer network","score_opus":0.04006455000870542,"score_gpt":0.24138159680400562,"score_spread":0.2013170467953002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567360982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009870958,0.0005250626,0.9767694,0.0005164299,0.00007463275,0.00011800707,0.00006425792,0.0011029522,0.010958269],"genre_scores_gemma":[0.25328672,0.0013586982,0.72896534,0.0002475779,0.00016358588,0.00017437623,0.00044186006,0.0006316768,0.014730099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973247,0.00072751293,0.00018254777,0.00029344158,0.0012558458,0.00021597854],"domain_scores_gemma":[0.9973448,0.0011921129,0.0001101875,0.0007164146,0.00044001447,0.00019648613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032944102,0.0008085438,0.0012431653,0.0012986201,0.001216417,0.0029408461,0.002309439,0.0012436961,0.0049765473],"category_scores_gemma":[0.0055513065,0.0008430503,0.00097623596,0.0024952996,0.001999766,0.00554695,0.0019037004,0.00179468,0.0023453615],"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.0003354153,0.0002981691,0.0010156044,0.00042386015,0.00011591891,0.000269681,0.00077108265,0.04097115,0.018240022,0.5971937,0.007378152,0.33298725],"study_design_scores_gemma":[0.00004518713,0.000095628864,0.00032622408,0.00007042225,0.00010458996,0.00037931252,0.0002140531,0.42148173,0.01747254,0.5276839,0.032065373,0.0000610211],"about_ca_topic_score_codex":0.0038113135,"about_ca_topic_score_gemma":0.0031894948,"teacher_disagreement_score":0.0049765473,"about_ca_system_score_codex":0.0010231535,"about_ca_system_score_gemma":0.002587673,"threshold_uncertainty_score":0.017422676},"labels":[],"label_agreement":null},{"id":"W156738824","doi":"10.1007/978-3-319-08171-7_23","title":"Identification of Essential Proteins by Using Complexes and Interaction Network","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Centrality; Computational biology; Identification (biology); Computer science; Drug target; Genome; Biology; Gene; Genetics; Biochemistry; Mathematics","score_opus":0.008669544097961366,"score_gpt":0.24012686265299124,"score_spread":0.23145731855502988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156738824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30811962,0.009078731,0.66904616,0.00031323903,0.00011621682,0.00031686987,0.0046468265,0.0022043511,0.0061579],"genre_scores_gemma":[0.55209744,0.0053462293,0.42796898,0.00010271267,0.00008093787,0.00027974302,0.010644813,0.00034708364,0.003132019],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996965,0.00003643417,0.00002871042,0.00012513269,0.00008382028,0.000029428908],"domain_scores_gemma":[0.99952984,0.00021964764,0.0000816876,0.00005764677,0.000064882835,0.00004614993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037045617,0.0011508826,0.00097242167,0.0037286845,0.0003789797,0.0011808989,0.00079187105,0.0005418262,0.0019227298],"category_scores_gemma":[0.0010869566,0.00036888054,0.0011364217,0.0025320998,0.00032654783,0.0014410979,0.00071510905,0.00062647683,0.0010051271],"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.0013971287,0.0004252836,0.026976071,0.0017716695,0.0007036436,0.0010677668,0.00019494673,0.03621065,0.5762786,0.024575353,0.006559217,0.3238396],"study_design_scores_gemma":[0.000086934604,0.00032629728,0.03459272,0.00011067931,0.0007693379,0.0031121362,0.00019828508,0.65895116,0.20950879,0.06728666,0.02490188,0.00015499823],"about_ca_topic_score_codex":0.00062876905,"about_ca_topic_score_gemma":0.0005898505,"teacher_disagreement_score":0.0037286845,"about_ca_system_score_codex":0.00047034555,"about_ca_system_score_gemma":0.0002810452,"threshold_uncertainty_score":0.0064321756},"labels":[],"label_agreement":null},{"id":"W1567390000","doi":"10.1007/978-3-642-15699-1_36","title":"Three-Dimensional Ultrasound Probe Pose Estimation from Single-Perspective X-Rays for Image-Guided Interventions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"London Health Sciences Centre; Robarts Clinical Trials; Western University","funders":"","keywords":"Fluoroscopy; Imaging phantom; Computer vision; Artificial intelligence; Tracking (education); Perspective (graphical); Computer science; Image registration; Visualization; Image fusion; Medicine; Radiology; Image (mathematics); Psychology","score_opus":0.030583384467071362,"score_gpt":0.3402167332899786,"score_spread":0.3096333488229072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567390000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052654264,0.00093398103,0.99180156,0.00008004324,0.00003994488,0.000025956067,0.000108244705,0.0010586608,0.0006861155],"genre_scores_gemma":[0.16152179,0.0033847073,0.82973486,0.00015723133,0.000112531714,0.00009954471,0.000665042,0.00043857438,0.0038857148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996445,0.00007473614,0.00002168188,0.000069214155,0.00015961281,0.000030216324],"domain_scores_gemma":[0.9995869,0.00020809346,0.00004058839,0.000051009018,0.00009315928,0.00002021929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845937,0.001134611,0.0008378253,0.00066068326,0.00017034505,0.0009914761,0.00088287005,0.0010819981,0.0037612303],"category_scores_gemma":[0.0015071435,0.0009450773,0.0009029627,0.0006913102,0.0002688922,0.00070072146,0.0009799051,0.0008810339,0.0022478257],"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.00029971916,0.000058822883,0.00090322224,0.00027644305,0.0000828086,0.00015628106,0.00011394363,0.041594885,0.13551758,0.0011003163,0.0050910776,0.81480485],"study_design_scores_gemma":[0.000028745451,0.00020557178,0.0053263376,0.000099500314,0.00010762633,0.0013489593,0.00008222311,0.9180336,0.06567683,0.002764189,0.0062396065,0.00008681245],"about_ca_topic_score_codex":0.0010743748,"about_ca_topic_score_gemma":0.002049332,"teacher_disagreement_score":0.0037612303,"about_ca_system_score_codex":0.000174309,"about_ca_system_score_gemma":0.00043830124,"threshold_uncertainty_score":0.0125826},"labels":[],"label_agreement":null},{"id":"W156741778","doi":"10.1007/978-3-319-06483-3_38","title":"Effects of Frequency-Based Inter-frame Dependencies on Automatic Speech Recognition","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Université Laval","funders":"","keywords":"Hidden Markov model; Computer science; Speech recognition; Concatenation (mathematics); Independence (probability theory); Frame (networking); Artificial intelligence; Pattern recognition (psychology); State (computer science); Conditional independence; Natural language processing; Algorithm; Mathematics","score_opus":0.01700488331830339,"score_gpt":0.23309256416691512,"score_spread":0.21608768084861174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156741778","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.6553122,0.005152289,0.3154952,0.00050051,0.00083467865,0.00011301826,0.0016789897,0.0035598914,0.017353194],"genre_scores_gemma":[0.91372424,0.0037242097,0.06830089,0.00022866785,0.00037819537,0.000079716265,0.0025667544,0.001809185,0.009188225],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990681,0.00023151575,0.00005546202,0.00019484204,0.00034410314,0.00010606519],"domain_scores_gemma":[0.98538893,0.012735271,0.00037336544,0.0005562044,0.0007757834,0.00017049519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009350405,0.0012492564,0.00075423927,0.00068083033,0.0005158097,0.0008092387,0.0005187107,0.0009810171,0.008199954],"category_scores_gemma":[0.010042029,0.00068390503,0.0004682089,0.0008312157,0.0004620113,0.0015329812,0.000653529,0.0012601201,0.0024646441],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004923979,0.0002822726,0.0022734257,0.0005019115,0.00011821718,0.000934824,0.00024960836,0.039539535,0.6656958,0.0020196743,0.0023368439,0.2811239],"study_design_scores_gemma":[0.00011406528,0.0010316031,0.053663783,0.0001630712,0.00085639645,0.0022690948,0.00019984135,0.37093875,0.56062376,0.003086153,0.006911023,0.00014243196],"about_ca_topic_score_codex":0.0029493535,"about_ca_topic_score_gemma":0.005307642,"teacher_disagreement_score":0.008199954,"about_ca_system_score_codex":0.00037032197,"about_ca_system_score_gemma":0.00060626114,"threshold_uncertainty_score":0.027431607},"labels":[],"label_agreement":null},{"id":"W1567458826","doi":"10.1007/978-3-540-85412-8_4","title":"Intelligent Mouse-Based Object Group Selection","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","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":"York University","funders":"","keywords":"Gestalt psychology; Computer science; Selection (genetic algorithm); Object (grammar); Exploit; Group (periodic table); Rectangle; Artificial intelligence; Perception; Pattern recognition (psychology); Theoretical computer science; Computer vision; Mathematics","score_opus":0.015609135200803604,"score_gpt":0.22100695723033079,"score_spread":0.2053978220295272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567458826","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.02446641,0.00050247693,0.95586795,0.000051199353,0.00012015869,0.00007551368,0.0001662034,0.012150867,0.0065991147],"genre_scores_gemma":[0.2448527,0.00057310687,0.728473,0.00015285044,0.00006574103,0.00016037664,0.00070009497,0.0011293268,0.02389281],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974126,0.00002826835,0.000012785633,0.00006230843,0.00012099856,0.000034492048],"domain_scores_gemma":[0.9996393,0.00013306325,0.000019645502,0.00008985951,0.00008058804,0.000037533864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036229292,0.00091546815,0.0012634365,0.0007205832,0.00039563607,0.00080517045,0.002240335,0.00068862876,0.013880027],"category_scores_gemma":[0.0007221995,0.0003259354,0.00045563525,0.00090798346,0.0002850928,0.00096389535,0.0013726995,0.000496682,0.0031980705],"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.0009465025,0.00017778398,0.0007828637,0.00024175852,0.000075259224,0.00019815502,0.00018208366,0.007736461,0.18816987,0.0073974715,0.015979378,0.7781124],"study_design_scores_gemma":[0.00031591108,0.0005598213,0.0036916472,0.00008588888,0.00023431973,0.0013656713,0.00016602015,0.6929654,0.22830218,0.016864048,0.055336088,0.00011300384],"about_ca_topic_score_codex":0.0010986709,"about_ca_topic_score_gemma":0.0020591228,"teacher_disagreement_score":0.013880027,"about_ca_system_score_codex":0.00017604914,"about_ca_system_score_gemma":0.00024435905,"threshold_uncertainty_score":0.04643327},"labels":[],"label_agreement":null},{"id":"W1567491386","doi":"10.1007/978-3-540-74024-7_27","title":"Balancing Gains, Risks, Costs, and Real-Time Constraints in the Ball Passing Algorithm for the Robotic Soccer","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"Computer science; Ball (mathematics); Scalability; Pareto optimal; Pareto principle; Mathematical optimization; Multi-objective optimization; Machine learning; Mathematics","score_opus":0.05249506086985522,"score_gpt":0.3503909607492842,"score_spread":0.297895899879429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567491386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015560619,0.0014787022,0.96992457,0.00032287,0.00009047831,0.000044675337,0.00001797672,0.00011284966,0.012447301],"genre_scores_gemma":[0.38387632,0.0024033089,0.5732727,0.00014829934,0.00018744933,0.00023986961,0.000089796915,0.00040329612,0.039379023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.00011170463,0.000016708931,0.000052916,0.00012498519,0.00003510962],"domain_scores_gemma":[0.9995915,0.000300805,0.00001992781,0.000021674985,0.000045583554,0.000020483412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107394,0.0011921041,0.0013183685,0.00033838436,0.00053259876,0.0013834975,0.0015779517,0.0013190825,0.0062631853],"category_scores_gemma":[0.002562635,0.0006117087,0.00050547824,0.0008219911,0.001364889,0.0022920836,0.0011496521,0.0024625058,0.00081627705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001155389,0.000061727675,0.00041963012,0.00016860792,0.0000385605,0.000080078724,0.00021594825,0.54453874,0.0018767136,0.25163537,0.0037488982,0.19710015],"study_design_scores_gemma":[0.000021770615,0.00005516547,0.00018592071,0.000038818904,0.00002048238,0.00007442528,0.00003517563,0.89380485,0.00047150598,0.10106599,0.004205015,0.000020860121],"about_ca_topic_score_codex":0.0044325446,"about_ca_topic_score_gemma":0.00516384,"teacher_disagreement_score":0.0062631853,"about_ca_system_score_codex":0.0007303624,"about_ca_system_score_gemma":0.001010478,"threshold_uncertainty_score":0.020952463},"labels":[],"label_agreement":null},{"id":"W1567514408","doi":"10.1007/978-3-642-01818-3_19","title":"Improving Document Search Using Social Bookmarking","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bookmarking; Computer science; World Wide Web; Search engine; Information retrieval; Search analytics; Data science; Web search query","score_opus":0.0323896235554021,"score_gpt":0.2877981275000508,"score_spread":0.2554085039446487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567514408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44127408,0.019404018,0.48604032,0.0010023534,0.0009808377,0.0004933984,0.0018801996,0.010253422,0.038671218],"genre_scores_gemma":[0.7574458,0.0028575656,0.2044287,0.00020681667,0.0007399054,0.00015169653,0.0016496436,0.00037007144,0.03214983],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998787,0.0002849262,0.00007365568,0.00019578359,0.0005680611,0.000090583264],"domain_scores_gemma":[0.99619377,0.0021047837,0.00022129423,0.0005629511,0.0007846415,0.00013269762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009561158,0.0008752759,0.0017368029,0.0039030674,0.0007857172,0.0016962327,0.0012350196,0.0014156718,0.006992592],"category_scores_gemma":[0.006326907,0.0004325587,0.000747853,0.0050278315,0.00034474029,0.003912582,0.0010173528,0.0006824245,0.0037906275],"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.00082822173,0.0011871391,0.007453199,0.0005320491,0.0002702671,0.00013211368,0.00015346313,0.021614023,0.03408743,0.0036199775,0.017698592,0.9124235],"study_design_scores_gemma":[0.0002549399,0.0012821436,0.010438001,0.00009072164,0.0007200259,0.00082163577,0.00023761671,0.906702,0.046935853,0.011586463,0.020781428,0.0001491919],"about_ca_topic_score_codex":0.0044853897,"about_ca_topic_score_gemma":0.011887507,"teacher_disagreement_score":0.006992592,"about_ca_system_score_codex":0.0005661006,"about_ca_system_score_gemma":0.00067979266,"threshold_uncertainty_score":0.023392498},"labels":[],"label_agreement":null},{"id":"W1567542872","doi":"10.1007/11508069_16","title":"Mining Job Logs Using Incremental Attribute-Oriented Approach","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Calgary","funders":"","keywords":"Computer science; Grid computing; Grid; Task (project management); Data mining; Resource (disambiguation); Power grid; Job scheduler; Distributed computing; Power (physics); Cloud computing; Operating system","score_opus":0.035586783335390317,"score_gpt":0.26928252533885655,"score_spread":0.23369574200346624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567542872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25781414,0.0021356228,0.7120733,0.00061637524,0.0005414055,0.0012779572,0.0073524876,0.01341625,0.004772425],"genre_scores_gemma":[0.4562028,0.0006995108,0.52923584,0.00024209147,0.00021923997,0.0004619139,0.00998966,0.00025053017,0.0026983868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815375,0.00017373824,0.00023560692,0.00040010456,0.0008752324,0.0001614872],"domain_scores_gemma":[0.9950895,0.002284869,0.00031766965,0.00071333756,0.0013228349,0.00027174965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017080089,0.0010815468,0.0014278521,0.006241827,0.0009634886,0.0022827522,0.0026481887,0.00072520995,0.0010863935],"category_scores_gemma":[0.005141123,0.00056467013,0.0015346345,0.005536501,0.00035822674,0.0020550634,0.0010507591,0.0009893469,0.0008838132],"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.00078878796,0.001987874,0.05923875,0.00062509486,0.0004307856,0.0006918547,0.00046883084,0.02592926,0.018362053,0.0022761167,0.010513979,0.87868667],"study_design_scores_gemma":[0.00015694465,0.00052561826,0.028415423,0.00014199525,0.0007180363,0.0012769334,0.00073077803,0.902793,0.027966678,0.022677029,0.014458599,0.00013900216],"about_ca_topic_score_codex":0.0043994132,"about_ca_topic_score_gemma":0.008101658,"teacher_disagreement_score":0.006241827,"about_ca_system_score_codex":0.00039436953,"about_ca_system_score_gemma":0.0016079955,"threshold_uncertainty_score":0.009032965},"labels":[],"label_agreement":null},{"id":"W1567575593","doi":"10.1007/978-3-642-16687-7_26","title":"Comments on Matrix-Based Secret Sharing Scheme for Images","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Secret sharing; Computer science; Scheme (mathematics); Image sharing; Image (mathematics); Matrix (chemical analysis); Simple (philosophy); Binary number; Rank (graph theory); Theoretical computer science; Shamir's Secret Sharing; Algorithm; Homomorphic secret sharing; Computer vision; Cryptography; Arithmetic; Mathematics; Combinatorics","score_opus":0.01871240888981219,"score_gpt":0.2827193778288634,"score_spread":0.26400696893905123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567575593","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009602839,0.028742071,0.05387104,0.43303892,0.14808229,0.0003441105,0.0025268933,0.00090314914,0.32288864],"genre_scores_gemma":[0.086987466,0.015874669,0.015441102,0.09694173,0.047956318,0.00033138608,0.0011152258,0.00056459743,0.7347875],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991153,0.00016194703,0.000044508397,0.00012450111,0.0004531287,0.000100609504],"domain_scores_gemma":[0.9979341,0.0007846551,0.00006326483,0.00012718423,0.0010329927,0.000057887002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876457,0.0005931705,0.0004085051,0.00067127304,0.0011924589,0.00080234586,0.0010032816,0.002701599,0.0383724],"category_scores_gemma":[0.004731245,0.00018299071,0.0005038172,0.00093896326,0.0010823527,0.0026718355,0.0006420467,0.0032722529,0.012710094],"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.00015938148,0.000023672597,0.00011920318,0.000473615,0.000016924463,0.00059108087,0.00031573427,0.0010735441,0.0038059591,0.12204278,0.83220506,0.039172933],"study_design_scores_gemma":[0.00001872245,0.000048980946,0.00038342716,0.0001021057,0.000008697884,0.00035418326,0.000080253514,0.00084347744,0.0020145096,0.0420794,0.9540382,0.000028028637],"about_ca_topic_score_codex":0.005292797,"about_ca_topic_score_gemma":0.0029496243,"teacher_disagreement_score":0.0383724,"about_ca_system_score_codex":0.0020348236,"about_ca_system_score_gemma":0.0006018345,"threshold_uncertainty_score":0.12836844},"labels":[],"label_agreement":null},{"id":"W1567578637","doi":"10.1007/978-3-540-72200-7_30","title":"On the Effectiveness of Looking Ahead in Search for Answer Sets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"DPLL algorithm; Overhead (engineering); Computer science; Constraint (computer-aided design); Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Programming language; Phase-locked loop","score_opus":0.03066738780843587,"score_gpt":0.2926294402534919,"score_spread":0.26196205244505605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567578637","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.70668846,0.023938375,0.18071373,0.011006911,0.00086647883,0.0004342168,0.0019173047,0.004233037,0.070201606],"genre_scores_gemma":[0.9160301,0.0026077079,0.073116,0.0011124035,0.0004906729,0.00011004023,0.001809435,0.00058021257,0.0041435068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98699784,0.0068854312,0.0008179654,0.0012830059,0.0032075013,0.0008083109],"domain_scores_gemma":[0.647219,0.33596665,0.0033100524,0.008334258,0.003162118,0.0020078837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018811157,0.0014817219,0.0030105237,0.0037112741,0.0018829206,0.0044686957,0.0037868351,0.005934633,0.011856249],"category_scores_gemma":[0.14524159,0.0010098134,0.0015514473,0.0047650966,0.0031794824,0.018542191,0.0037822598,0.004287599,0.0016818679],"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.018068738,0.0025681937,0.028914696,0.0013449285,0.00052956346,0.00026579868,0.0011891823,0.15429099,0.0045002424,0.05939284,0.030421564,0.69851315],"study_design_scores_gemma":[0.0011984044,0.0020760205,0.0069480306,0.00035258805,0.0006022009,0.00038240507,0.00080811797,0.8174619,0.0043010954,0.16284996,0.002898973,0.00012020574],"about_ca_topic_score_codex":0.009137252,"about_ca_topic_score_gemma":0.0059695374,"teacher_disagreement_score":0.018811157,"about_ca_system_score_codex":0.0019245461,"about_ca_system_score_gemma":0.0021062244,"threshold_uncertainty_score":0.099484086},"labels":[],"label_agreement":null},{"id":"W1567588475","doi":"10.1007/978-3-540-73287-7_8","title":"The Challenge of Dealing with Cultural Differences in Industrial Design in Emerging Countries: Latin-American Case Studies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","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":"Université de Montréal","funders":"","keywords":"Latin Americans; China; Emerging markets; Ethnography; Business; Economy; Political science; Economics; Geography; Finance","score_opus":0.11027989673688388,"score_gpt":0.3223546515742957,"score_spread":0.21207475483741184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567588475","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.9477621,0.0043847016,0.001672321,0.0052071707,0.00003071306,0.000040855826,0.00002788475,0.0000041108087,0.040870205],"genre_scores_gemma":[0.99412423,0.0026139326,0.0012929427,0.0005680875,0.0000087200915,0.000044304004,0.000017428287,0.000007240111,0.00132319],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9954922,0.0034967812,0.000090317604,0.00012090108,0.00026620404,0.0005335963],"domain_scores_gemma":[0.98979926,0.008275366,0.0006664239,0.00041423424,0.00059137517,0.00025336895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008608415,0.00038137042,0.00050131715,0.0015671693,0.006834929,0.005900551,0.0015947022,0.0017181861,0.0023972327],"category_scores_gemma":[0.0073683956,0.0003132238,0.00038256863,0.004436833,0.006305479,0.004274832,0.0047448687,0.002429097,0.00012967794],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015937828,0.00073505833,0.10094689,0.00051795907,0.00010068912,0.006837875,0.6862606,0.0011869832,0.00081181404,0.096515015,0.0022895755,0.10363816],"study_design_scores_gemma":[0.000020248202,0.000060551403,0.016568428,0.00058708945,0.00004535043,0.0008589998,0.96256703,0.00030049065,0.00031223355,0.005992383,0.012674858,0.000012331916],"about_ca_topic_score_codex":0.037167087,"about_ca_topic_score_gemma":0.109584555,"teacher_disagreement_score":0.037167087,"about_ca_system_score_codex":0.0043853107,"about_ca_system_score_gemma":0.0048090452,"threshold_uncertainty_score":0.073901474},"labels":[],"label_agreement":null},{"id":"W1567604534","doi":"10.1007/11788713_163","title":"Helping People with Visual Impairments Gain Access to Graphical Information Through Natural Language: The iGraph System","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Comprehension; Human–computer interaction; Process (computing); Natural language; Graph; Natural (archaeology); Visualization; Program comprehension; Artificial intelligence; Natural language processing; Programming language; Theoretical computer science; Software","score_opus":0.009990331072652335,"score_gpt":0.29289086220500465,"score_spread":0.2829005311323523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567604534","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.7882945,0.0020206168,0.075695276,0.0017816089,0.00034004904,0.00092863495,0.003929479,0.031565186,0.09544469],"genre_scores_gemma":[0.6995519,0.0019660124,0.21210359,0.0023121564,0.000071876166,0.0010603353,0.0069296826,0.0008835774,0.07512089],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998764,0.00004694529,0.000008349542,0.000026165295,0.000025343785,0.000016763652],"domain_scores_gemma":[0.99977463,0.00014652043,0.000008035692,0.000020886418,0.000022070491,0.000027890539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003587327,0.0004917711,0.00031349808,0.0002914512,0.00026272456,0.0007121562,0.0006383832,0.000624057,0.008539848],"category_scores_gemma":[0.001064554,0.00013021646,0.00022388976,0.00017698866,0.00030262122,0.0013305106,0.0012112465,0.00038139443,0.0027251795],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019117846,0.0012701172,0.0052158753,0.00054091605,0.00006997554,0.00041261362,0.004209827,0.0006491806,0.031355698,0.001555141,0.08162018,0.87118876],"study_design_scores_gemma":[0.004947025,0.010485888,0.12210092,0.0011062173,0.0019934361,0.007645897,0.02308163,0.082763,0.10939121,0.025456421,0.6102199,0.00080852123],"about_ca_topic_score_codex":0.004005059,"about_ca_topic_score_gemma":0.010112143,"teacher_disagreement_score":0.008539848,"about_ca_system_score_codex":0.00020222583,"about_ca_system_score_gemma":0.00051487266,"threshold_uncertainty_score":0.028568685},"labels":[],"label_agreement":null},{"id":"W1567614759","doi":"10.1007/978-3-540-75496-1_2","title":"Features vs. Attacks: A Comprehensive Feature Selection Model for Network Based Intrusion Detection Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Intrusion detection system; Feature selection; Data mining; Ranking (information retrieval); Network packet; Artificial intelligence; Anomaly-based intrusion detection system; Machine learning; Set (abstract data type); Feature (linguistics); Selection (genetic algorithm); Process (computing); Network security; Pattern recognition (psychology); Computer security","score_opus":0.023116339095094515,"score_gpt":0.2567103653207557,"score_spread":0.23359402622566117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567614759","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.039175175,0.0008146409,0.95737493,0.00028334523,0.000062515865,0.000096961936,0.0003477099,0.001182213,0.0006624642],"genre_scores_gemma":[0.721998,0.0011514514,0.26924646,0.0002557923,0.0002804318,0.0003374984,0.0014970539,0.0003207816,0.0049124933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991172,0.0002603045,0.00006457912,0.00013581137,0.00036111416,0.000061027815],"domain_scores_gemma":[0.99854714,0.0009597206,0.00008747005,0.00013531756,0.0002311092,0.000039131566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002154848,0.0011830415,0.0016897122,0.0012880015,0.00033592514,0.00095323427,0.0015508247,0.0007077668,0.00093519065],"category_scores_gemma":[0.00337547,0.0003809798,0.0011192338,0.0016114716,0.00035856053,0.0017930381,0.0007841334,0.001073918,0.00044810754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007236984,0.00026615994,0.0045623137,0.00010490184,0.0003796942,0.00010435942,0.000056848534,0.5269372,0.0049530864,0.0036870553,0.005567991,0.45265663],"study_design_scores_gemma":[0.000011841816,0.000075166034,0.000795191,0.0000045193865,0.0000404453,0.000035119083,0.0000046132636,0.995046,0.0006218912,0.0030032468,0.00035340912,0.000008490289],"about_ca_topic_score_codex":0.0030116201,"about_ca_topic_score_gemma":0.0031052805,"teacher_disagreement_score":0.0030116201,"about_ca_system_score_codex":0.00043490258,"about_ca_system_score_gemma":0.0005119109,"threshold_uncertainty_score":0.01139605},"labels":[],"label_agreement":null},{"id":"W1567693403","doi":"","title":"Web Services, E-Business, and the Semantic Web, CAiSE 2002 International Workshop, WES 2002. Toronto, Canada, May 27-28, 2002, Revised Papers","year":2002,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Banking Systems and Strategies","field":"Business, Management and Accounting","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":"Computer science; World Wide Web; Web service; Web standards; WS-I Basic Profile; WS-Policy; Semantic Web Stack; Semantic Web; Data Web; Social Semantic Web; Web modeling; Service-oriented architecture; Web development; Business Process Execution Language; Services computing; Web intelligence; Web application security","score_opus":0.008664760142079599,"score_gpt":0.19940048689236003,"score_spread":0.19073572675028044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567693403","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01347314,0.5545267,0.12546669,0.08394627,0.011531278,0.0001558164,0.0025007264,0.001764935,0.20663445],"genre_scores_gemma":[0.10774694,0.50610423,0.08900539,0.005187305,0.0045151114,0.0001848364,0.0062475796,0.0011615776,0.27984694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899465,0.0001997462,0.0000915586,0.00010079345,0.00052365905,0.00008959968],"domain_scores_gemma":[0.998755,0.00048659663,0.00006519457,0.00009878893,0.00043493626,0.0001594869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027889488,0.0012611216,0.00072311884,0.0034988585,0.0018138818,0.008536848,0.0010090811,0.0022522449,0.011176871],"category_scores_gemma":[0.0034449906,0.0011564113,0.00043885852,0.0078997575,0.0031299163,0.013723127,0.0016976884,0.0019723133,0.0028118065],"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.0002091254,0.0001236528,0.0014767257,0.0011508503,0.00007395747,0.00044163203,0.0017345648,0.002759399,0.002756248,0.25507763,0.47547552,0.2587207],"study_design_scores_gemma":[0.00003963735,0.000019965308,0.0025216695,0.0012373349,0.00006025575,0.0004506625,0.0016522481,0.004496944,0.0023215946,0.10429674,0.8828705,0.000032405474],"about_ca_topic_score_codex":0.10243252,"about_ca_topic_score_gemma":0.19667643,"teacher_disagreement_score":0.10243252,"about_ca_system_score_codex":0.005144348,"about_ca_system_score_gemma":0.007172891,"threshold_uncertainty_score":0.20367259},"labels":[],"label_agreement":null},{"id":"W1567821529","doi":"10.1007/978-3-540-69731-2_11","title":"Nonlinear Function Learning Using Radial Basis Function Networks: Convergence and Rates","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Radial basis function; Empirical risk minimization; Computer science; Nonlinear system; Convergence (economics); Regularization (linguistics); Minification; Radial basis function network; Mathematical optimization; Function (biology); Rate of convergence; Applied mathematics; Artificial intelligence; Artificial neural network; Algorithm; Mathematics","score_opus":0.020294905977010565,"score_gpt":0.2370871132192182,"score_spread":0.21679220724220763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567821529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018737618,0.009165187,0.96197623,0.00066997117,0.0002827297,0.00007231756,0.00007811842,0.0004467254,0.008571028],"genre_scores_gemma":[0.39488623,0.014751722,0.557443,0.00036842984,0.00064827927,0.00043697338,0.000445495,0.0015448595,0.029475043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830073,0.00076248054,0.00010082145,0.00025178085,0.0004885966,0.000095542535],"domain_scores_gemma":[0.98124254,0.013631759,0.00063234946,0.001009795,0.0032708156,0.00021270993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083936,0.001724482,0.0018561514,0.0012806101,0.0006291395,0.002090796,0.0022809003,0.0032902528,0.0034687205],"category_scores_gemma":[0.03846896,0.0009268607,0.0012955465,0.0017293436,0.0018951163,0.005683608,0.003172594,0.0042032436,0.002035407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045417342,0.00014596604,0.0015858123,0.0010273447,0.00014864693,0.0001459325,0.00041431596,0.47492167,0.005525688,0.14872225,0.008999476,0.35790876],"study_design_scores_gemma":[0.00000795929,0.000034061726,0.00019313335,0.00007054059,0.000023484521,0.0000869639,0.000026319305,0.97549653,0.0018600601,0.020877972,0.0013055475,0.00001732598],"about_ca_topic_score_codex":0.0024154717,"about_ca_topic_score_gemma":0.0013085296,"teacher_disagreement_score":0.0083936,"about_ca_system_score_codex":0.0013068309,"about_ca_system_score_gemma":0.0008672027,"threshold_uncertainty_score":0.044390142},"labels":[],"label_agreement":null},{"id":"W1567910696","doi":"10.1007/3-540-44968-x_33","title":"Generating Necklaces and Strings with Forbidden Substrings","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Victoria","funders":"","keywords":"Substring; Computer science; Algorithm; Artificial intelligence; Programming language; Data structure","score_opus":0.01017285368743673,"score_gpt":0.21926727264293366,"score_spread":0.20909441895549694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567910696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103304654,0.00020656515,0.87625843,0.00021523626,0.0001608636,0.00017569821,0.00026223584,0.0018188044,0.01759747],"genre_scores_gemma":[0.34548157,0.00027177023,0.62346125,0.00011193089,0.000051989144,0.0002788531,0.0010849526,0.0010989719,0.028158773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994209,0.00010694533,0.000047031877,0.00013227818,0.00022300462,0.0000698539],"domain_scores_gemma":[0.99762195,0.00151283,0.00013305803,0.00043813803,0.0002142805,0.000079731915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008074528,0.00077387295,0.00077110727,0.0010312585,0.0008504243,0.0009449953,0.0016030739,0.0014390156,0.008073187],"category_scores_gemma":[0.005612149,0.00072889775,0.0010337166,0.0013160119,0.001305028,0.002106011,0.0027150617,0.0012051866,0.0018863766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064399303,0.00022386143,0.0013834154,0.00073525525,0.00006759614,0.0011637056,0.0011103123,0.071487725,0.05331092,0.43914488,0.0115424385,0.41918585],"study_design_scores_gemma":[0.0001548158,0.00022901174,0.0004323051,0.00012219265,0.000102964565,0.00077936164,0.00022914707,0.34402582,0.08896682,0.54135406,0.023525883,0.00007753095],"about_ca_topic_score_codex":0.00044746898,"about_ca_topic_score_gemma":0.00073657767,"teacher_disagreement_score":0.008073187,"about_ca_system_score_codex":0.00057767174,"about_ca_system_score_gemma":0.00040864918,"threshold_uncertainty_score":0.02700746},"labels":[],"label_agreement":null},{"id":"W1567939684","doi":"10.1007/978-3-540-24617-6_16","title":"A Use Case Driven Testing Process: Towards a Formal Approach Based on UML Collaboration Diagrams","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Unified Modeling Language; Use Case Diagram; Process (computing); Class diagram; Software engineering; Activity diagram; Programming language; Applications of UML; Realization (probability); Test case; Software","score_opus":0.060879721790476876,"score_gpt":0.29351581892684153,"score_spread":0.23263609713636466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567939684","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.0025471493,0.000031702017,0.9951279,0.00015609548,0.00001030529,0.00024471513,0.000024655203,0.00074826356,0.0011090885],"genre_scores_gemma":[0.062950775,0.000109978006,0.93389225,0.00012459775,0.000016271058,0.00047006694,0.00021589089,0.00037708765,0.0018430412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9803631,0.008943096,0.0012040077,0.0012348348,0.007778474,0.00047649702],"domain_scores_gemma":[0.96411604,0.022893596,0.0022736639,0.0049067554,0.0050424007,0.00076748856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01383474,0.0017746262,0.0011554544,0.0033985837,0.0013117053,0.005865903,0.004534362,0.0035227991,0.003618146],"category_scores_gemma":[0.033806045,0.0016519208,0.0017569738,0.0016232028,0.003286066,0.006480338,0.0045272624,0.003251918,0.0013672913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028079454,0.0012606198,0.0056735124,0.0011645383,0.00024388244,0.0019383305,0.0070395735,0.08751606,0.051189363,0.3088046,0.005867039,0.52902174],"study_design_scores_gemma":[0.00014064096,0.00035913073,0.001238346,0.00089197775,0.00019392485,0.0018540411,0.00089319586,0.7208438,0.04933355,0.18750359,0.036568757,0.00017910128],"about_ca_topic_score_codex":0.0022518346,"about_ca_topic_score_gemma":0.0028049292,"teacher_disagreement_score":0.01383474,"about_ca_system_score_codex":0.0014626203,"about_ca_system_score_gemma":0.0041043023,"threshold_uncertainty_score":0.07316601},"labels":[],"label_agreement":null},{"id":"W1567964559","doi":"10.1007/978-3-540-89689-0_90","title":"Local Metric Learning on Manifolds with Application to Query–Based Operations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Metric (unit); Euclidean distance; Benchmark (surveying); Curse of dimensionality; Manifold (fluid mechanics); Context (archaeology); Computer science; Mathematics; Nonlinear dimensionality reduction; Metric space; Artificial intelligence; Euclidean geometry; Algorithm; Dimensionality reduction; Pattern recognition (psychology); Discrete mathematics; Geometry","score_opus":0.012450119396712218,"score_gpt":0.23524443593604058,"score_spread":0.22279431653932835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567964559","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.009831725,0.0002512626,0.9885882,0.00011223888,0.000020634961,0.000023747163,0.00004480135,0.00045593356,0.0006714524],"genre_scores_gemma":[0.3109259,0.00077899575,0.6827354,0.00008135906,0.00014979772,0.00014021328,0.00045381126,0.00046600855,0.0042685913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917275,0.00023537311,0.00006117262,0.00020434542,0.00026766286,0.00005861544],"domain_scores_gemma":[0.99816376,0.00068653113,0.00016245796,0.0004634151,0.0004237139,0.00010011036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010382249,0.0006850499,0.0014341616,0.0011839827,0.00052275794,0.0012485334,0.0017012035,0.00080301694,0.0031588254],"category_scores_gemma":[0.004949502,0.00043822225,0.00069404586,0.0024306828,0.0014202205,0.0032033192,0.002683048,0.0015254305,0.00080203125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023737695,0.00014173146,0.00082991284,0.00022080391,0.00005520916,0.0000808221,0.00028169283,0.18372256,0.019043997,0.14785416,0.0073670303,0.6401647],"study_design_scores_gemma":[0.0000054148672,0.000077855395,0.00021907025,0.0000045004726,0.000007288947,0.000059543527,0.000029140001,0.94234794,0.0031607412,0.052290585,0.0017852125,0.000012692598],"about_ca_topic_score_codex":0.0026135587,"about_ca_topic_score_gemma":0.0019933917,"teacher_disagreement_score":0.0031588254,"about_ca_system_score_codex":0.0007039785,"about_ca_system_score_gemma":0.00050284143,"threshold_uncertainty_score":0.010567367},"labels":[],"label_agreement":null},{"id":"W1567965530","doi":"10.1007/978-3-540-85502-6_20","title":"Cases, Predictions, and Accuracy Learning and Its Application to Effort Estimation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Calgary","funders":"","keywords":"Computer science; Analogy; Estimation; Set (abstract data type); Similarity (geometry); Quality (philosophy); Reliability (semiconductor); Machine learning; Process (computing); Artificial intelligence; Data mining; Software quality; Software; Software development","score_opus":0.01468652076736102,"score_gpt":0.27523563037040866,"score_spread":0.2605491096030476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567965530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043543085,0.0020139604,0.9460202,0.0014414816,0.00013475025,0.000083897736,0.00023118517,0.0006329652,0.005898464],"genre_scores_gemma":[0.7264241,0.001606666,0.26382414,0.00023628525,0.00051555084,0.00029023088,0.00060080027,0.00016893697,0.006333421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952251,0.0025576046,0.00027609803,0.00076373015,0.00096421735,0.00021325072],"domain_scores_gemma":[0.91691786,0.074833915,0.0018535048,0.0032685758,0.0026134443,0.0005126819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010652044,0.0012701935,0.0017635091,0.0036489847,0.0009685046,0.0029869215,0.0033587518,0.0020605323,0.004435982],"category_scores_gemma":[0.087453686,0.0008861041,0.0013741683,0.0036814304,0.00301676,0.007624366,0.0026497797,0.0034973158,0.0005621189],"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.0004461357,0.00033718863,0.023259655,0.00026074014,0.00019849766,0.00017787988,0.0007822373,0.25710607,0.00051562383,0.23796296,0.0092681395,0.46968496],"study_design_scores_gemma":[0.000013664372,0.000037370763,0.0016110879,0.000029091421,0.000033426208,0.00006160257,0.0000625144,0.76048225,0.000337177,0.23644586,0.00086222123,0.000023733855],"about_ca_topic_score_codex":0.007545709,"about_ca_topic_score_gemma":0.0061674546,"teacher_disagreement_score":0.010652044,"about_ca_system_score_codex":0.001619181,"about_ca_system_score_gemma":0.0011605655,"threshold_uncertainty_score":0.05633408},"labels":[],"label_agreement":null},{"id":"W1568020571","doi":"10.1007/11766247_7","title":"How Artificial Intelligent Agents Do Shopping in a Virtual Mall: A ‘Believable’ and ‘Usable’ Multiagent-Based Simulation of Customers’ Shopping Behavior in a Mall","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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é Laval","funders":"","keywords":"USable; Shopping mall; Computer science; Usability; Set (abstract data type); Process (computing); Software; Human–computer interaction; Multimedia; Advertising","score_opus":0.026549545207952198,"score_gpt":0.25589354837372447,"score_spread":0.22934400316577228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568020571","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.68994296,0.00020064384,0.25071722,0.0025089737,0.00015577042,0.00012699941,0.00026334435,0.0006424225,0.05544163],"genre_scores_gemma":[0.95790297,0.00010578393,0.035866417,0.00017374946,0.000014787914,0.000057674,0.000080687656,0.00008569356,0.0057123057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.00008965665,0.000006639194,0.00003635826,0.0000320703,0.000030045454],"domain_scores_gemma":[0.99955195,0.00022376292,0.00003303082,0.00006153023,0.000034814046,0.000094931784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034091363,0.00042376856,0.0004439963,0.00023723573,0.0010446446,0.002401683,0.0015352564,0.0030978143,0.0044786115],"category_scores_gemma":[0.0013368777,0.000792359,0.0007782755,0.00029411414,0.002337104,0.0029089265,0.0013758118,0.0013722046,0.00045107558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011014325,0.00008964264,0.0015205959,0.00004851813,0.00005826109,0.00018676183,0.0014481917,0.95136064,0.0024371021,0.038691625,0.0008472189,0.003201293],"study_design_scores_gemma":[0.000033173696,0.000032625703,0.00041918948,0.000006732142,0.0000145704535,0.00003967964,0.00021314902,0.98380935,0.00057828566,0.013458425,0.0013698351,0.000024925836],"about_ca_topic_score_codex":0.012427372,"about_ca_topic_score_gemma":0.00807452,"teacher_disagreement_score":0.012427372,"about_ca_system_score_codex":0.0006969626,"about_ca_system_score_gemma":0.00096252566,"threshold_uncertainty_score":0.02471006},"labels":[],"label_agreement":null},{"id":"W1568033296","doi":"10.1007/978-3-642-01818-3_44","title":"Modeling and Inference with Relational Dynamic Bayesian Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Dynamic Bayesian network; Computer science; Inference; Particle filter; Context (archaeology); Domain (mathematical analysis); Bayesian network; Artificial intelligence; Bayesian inference; Bayesian probability; Filter (signal processing); Machine learning; Data mining; Theoretical computer science; Kalman filter; Computer vision","score_opus":0.016261755639270046,"score_gpt":0.23925682509445656,"score_spread":0.22299506945518652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568033296","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.0015890712,0.00081524084,0.9947878,0.0003814549,0.000031681393,0.000017550388,0.00014418071,0.00013600582,0.002096945],"genre_scores_gemma":[0.18562162,0.0055969157,0.7972822,0.00033250925,0.00038389946,0.0003183467,0.0012749908,0.00017980878,0.009009705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657285,0.0019787373,0.00020359921,0.0005271095,0.0006157464,0.00010196687],"domain_scores_gemma":[0.98581684,0.01236421,0.0004738852,0.00078523444,0.00044281821,0.00011714165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046617803,0.0011854351,0.0015821334,0.0016815868,0.00062978256,0.0032432151,0.0029583278,0.0017589745,0.007301561],"category_scores_gemma":[0.028654885,0.0015718881,0.0018902041,0.003064662,0.0017370898,0.006648547,0.0021892835,0.0032444734,0.0012924223],"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.000046118552,0.000040897525,0.0007091579,0.00025347227,0.00018042441,0.00013760949,0.00021336679,0.29291558,0.0002673969,0.6185676,0.003587159,0.083081216],"study_design_scores_gemma":[0.000010501956,0.000005844885,0.00008720201,0.000026912508,0.0000358758,0.000056263907,0.000017093993,0.43928906,0.00015589058,0.5571512,0.0031515686,0.000012634261],"about_ca_topic_score_codex":0.0059759268,"about_ca_topic_score_gemma":0.0054942803,"teacher_disagreement_score":0.007301561,"about_ca_system_score_codex":0.0014383148,"about_ca_system_score_gemma":0.0010307339,"threshold_uncertainty_score":0.02465415},"labels":[],"label_agreement":null},{"id":"W1568058438","doi":"10.1007/3-540-44522-6_60","title":"The Foundational Theory of Optimal Bayesian Pairwise Linear Classifiers","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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":"Pairwise comparison; Covariance; Classifier (UML); Computer science; Linear discriminant analysis; Artificial intelligence; Linear classifier; Pattern recognition (psychology); Perceptron; Linear programming; Applied mathematics; Covariance function; Bayes' theorem; Linear model; Mathematics; Algorithm; Mathematical optimization; Bayesian probability; Covariance matrix; Machine learning; Artificial neural network; Statistics","score_opus":0.018231131688461674,"score_gpt":0.25830180362382926,"score_spread":0.24007067193536757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568058438","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.00088738906,0.0010275731,0.9892987,0.0005221369,0.000113633774,0.000017427834,0.00009278412,0.00007213537,0.007968136],"genre_scores_gemma":[0.16388091,0.008149218,0.80432284,0.0017701394,0.0026659854,0.0007052015,0.0008069984,0.00038029728,0.017318327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487525,0.0019323116,0.00028448587,0.0008238237,0.0018005199,0.00028354814],"domain_scores_gemma":[0.9912935,0.006386114,0.00034566916,0.0009074424,0.00091916847,0.00014818381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057372246,0.0015179291,0.002305747,0.0018819745,0.001422013,0.004194346,0.0052207992,0.0036408736,0.007206966],"category_scores_gemma":[0.022544783,0.0023048017,0.0018810396,0.003543901,0.005345073,0.009100559,0.0040633185,0.0064924452,0.002480715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018232262,0.000014842032,0.000060235445,0.000088521796,0.000026520778,0.000018552522,0.000059950333,0.01719667,0.00022862612,0.95111984,0.003099229,0.028068706],"study_design_scores_gemma":[0.000006423561,0.000007655941,0.0000339486,0.000023819923,0.000008628255,0.00002703337,0.000005760981,0.036587905,0.00010721342,0.9604632,0.0027181567,0.000010258204],"about_ca_topic_score_codex":0.001540743,"about_ca_topic_score_gemma":0.0013781525,"teacher_disagreement_score":0.007206966,"about_ca_system_score_codex":0.0023341386,"about_ca_system_score_gemma":0.0020640437,"threshold_uncertainty_score":0.030341744},"labels":[],"label_agreement":null},{"id":"W1568082953","doi":"10.1007/978-3-540-87875-9_39","title":"A Pattern Language Verifier for Web-Based Enterprise Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Compiler; Programming language; Software engineering; Process (computing); Software design pattern; Software","score_opus":0.011157297332290017,"score_gpt":0.24139121745132558,"score_spread":0.23023392011903557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568082953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011467089,0.0002615667,0.93908703,0.00040157352,0.00012281243,0.00022187828,0.00040821804,0.045894302,0.0021354652],"genre_scores_gemma":[0.21607144,0.00061512936,0.7545045,0.0008032246,0.00018199768,0.0005492995,0.0022245052,0.0075711547,0.017478734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666804,0.00085122586,0.0004029547,0.000476645,0.0012885662,0.00031262153],"domain_scores_gemma":[0.99054027,0.0053130947,0.00068136404,0.0024753565,0.0008043428,0.00018564232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049320795,0.00097107264,0.0010192891,0.0012875416,0.0007742982,0.0024240988,0.0027998483,0.0023281577,0.013231182],"category_scores_gemma":[0.011863435,0.0012863035,0.0012274384,0.00091561244,0.0011827648,0.007352738,0.0038343498,0.0028127667,0.0044766134],"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.0015822259,0.00047532775,0.0029190115,0.0006864697,0.00017516257,0.0008915528,0.00043051297,0.010047341,0.06443647,0.072381124,0.03864884,0.8073259],"study_design_scores_gemma":[0.00080499257,0.00065099774,0.001662625,0.00037019278,0.00039876255,0.0020109334,0.00015066394,0.5005323,0.28357956,0.122193076,0.08742668,0.0002191765],"about_ca_topic_score_codex":0.0015694825,"about_ca_topic_score_gemma":0.0018683564,"teacher_disagreement_score":0.013231182,"about_ca_system_score_codex":0.0007125818,"about_ca_system_score_gemma":0.001894145,"threshold_uncertainty_score":0.044262707},"labels":[],"label_agreement":null},{"id":"W1568095739","doi":"10.1007/11832225_2","title":"Efficient Implementation of Polynomial Arithmetic in a Multiple-Level Programming Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Computer science; Programming language; Polynomial; Lisp; Axiom; Implementation; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.018652021940444356,"score_gpt":0.24290524641353445,"score_spread":0.2242532244730901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568095739","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.026281122,0.00023284428,0.9483084,0.00021862204,0.0000751024,0.000079837206,0.00016846549,0.012781948,0.0118537005],"genre_scores_gemma":[0.23973724,0.0001893098,0.7499859,0.00014197767,0.0000509008,0.0001308229,0.00053954497,0.0015237655,0.007700517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987437,0.00023067903,0.00010627352,0.00019865115,0.00043741465,0.00028330038],"domain_scores_gemma":[0.99883586,0.00037314242,0.00006989388,0.00047711036,0.00017911,0.00006492547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007648774,0.0008589865,0.0009500346,0.00068171666,0.0009188421,0.0026515396,0.0031973606,0.00078238756,0.011011068],"category_scores_gemma":[0.0024193886,0.0007890836,0.0010562475,0.0012661748,0.0006031527,0.0040606814,0.0023265125,0.0018961636,0.0036174378],"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.001103204,0.0004689974,0.0015391163,0.00072315324,0.000121164,0.00043516434,0.0005278131,0.035969354,0.060363073,0.2871622,0.025157092,0.5864297],"study_design_scores_gemma":[0.0003276871,0.00035907383,0.0007608429,0.0001221082,0.00017656611,0.00054630777,0.00019533986,0.6049756,0.11414914,0.2157514,0.062523715,0.00011230773],"about_ca_topic_score_codex":0.0009826752,"about_ca_topic_score_gemma":0.0026435945,"teacher_disagreement_score":0.011011068,"about_ca_system_score_codex":0.0009939196,"about_ca_system_score_gemma":0.0013258638,"threshold_uncertainty_score":0.03683567},"labels":[],"label_agreement":null},{"id":"W1568102860","doi":"10.1007/978-3-540-73545-8_37","title":"Linear Algorithm for Broadcasting in Unicyclic Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Broadcasting (networking); Graph; Time complexity; Graph algorithms; Algorithm; Upper and lower bounds; Connectivity; Theoretical computer science; Combinatorics; Discrete mathematics; Computer network; Mathematics","score_opus":0.03335498008116616,"score_gpt":0.27878679155807135,"score_spread":0.24543181147690518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568102860","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.03612116,0.0013436492,0.89703363,0.0013810763,0.00025900095,0.0004130011,0.0011739585,0.0073372796,0.05493728],"genre_scores_gemma":[0.3043991,0.001402937,0.6338205,0.0008189461,0.0002868426,0.0012966479,0.0033894365,0.0009809562,0.05360459],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989974,0.00019774487,0.000053439533,0.00020881361,0.00027080663,0.00027182788],"domain_scores_gemma":[0.99778205,0.0011706682,0.00013337313,0.00041926056,0.00038210404,0.00011265138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061795255,0.0009381925,0.0011042457,0.0012851811,0.0012696256,0.0020674467,0.0030251113,0.0011063615,0.018085523],"category_scores_gemma":[0.0038218684,0.0005676424,0.00058672903,0.0030436506,0.0009868437,0.0028814618,0.0028149798,0.0018604888,0.0045236577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009877859,0.0004846135,0.0005150671,0.0011511155,0.00009094344,0.0001105473,0.0005196412,0.07480906,0.010920814,0.1318923,0.065546446,0.7129716],"study_design_scores_gemma":[0.0008765024,0.0004215614,0.00062795484,0.00016591625,0.00014181476,0.00032058728,0.00035418206,0.67583215,0.017496705,0.2729448,0.030726802,0.000091045884],"about_ca_topic_score_codex":0.0057280306,"about_ca_topic_score_gemma":0.007548845,"teacher_disagreement_score":0.018085523,"about_ca_system_score_codex":0.002779886,"about_ca_system_score_gemma":0.0023847476,"threshold_uncertainty_score":0.060502052},"labels":[],"label_agreement":null},{"id":"W1568104991","doi":"10.1007/11758525_16","title":"Numerical Simulation of Phase Transformations in Shape Memory Alloy Thin Films","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Shape Memory Alloy Transformations","field":"Materials 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":"Wilfrid Laurier University","funders":"","keywords":"Nucleation; Computer science; Finite element method; Alloy; Shape-memory alloy; Transformation (genetics); Lattice (music); Phase (matter); Thin film; Computational complexity theory; Statistical physics; Applied mathematics; Materials science; Thermodynamics; Algorithm; Mathematics; Artificial intelligence; Physics; Composite material; Nanotechnology; Chemistry","score_opus":0.02076408733230162,"score_gpt":0.27819177727453936,"score_spread":0.25742768994223775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568104991","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.88913345,0.00091354694,0.05801568,0.0010027969,0.00024961983,0.00009434045,0.0005460712,0.000530473,0.049514018],"genre_scores_gemma":[0.97877204,0.00018662427,0.016041305,0.00007414641,0.000024028786,0.000059370494,0.00015399858,0.00006885233,0.004619521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993217,0.00001175758,0.0000024900542,0.0000067304595,0.000031331936,0.000015523914],"domain_scores_gemma":[0.9996666,0.0002116217,0.000029339812,0.000020382819,0.000050217124,0.00002190671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016281805,0.00029243427,0.00055757735,0.00031040833,0.0005100967,0.00065529684,0.0008205535,0.0010553015,0.003665035],"category_scores_gemma":[0.0010526212,0.00036718397,0.00030293586,0.00042161893,0.00059298537,0.000429478,0.00030207785,0.0006028299,0.00021893672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009065286,0.00005372587,0.000437734,0.0000653899,0.000014920842,0.0000966742,0.000050920167,0.97411263,0.009492386,0.011571536,0.0005505552,0.0034628669],"study_design_scores_gemma":[0.000013504861,0.000010093685,0.00008570196,0.000002518877,0.0000014913511,0.0000071046675,0.0000086984055,0.9978515,0.001041209,0.0007695469,0.00020604956,0.0000025481534],"about_ca_topic_score_codex":0.0064843697,"about_ca_topic_score_gemma":0.004365336,"teacher_disagreement_score":0.0064843697,"about_ca_system_score_codex":0.00077658787,"about_ca_system_score_gemma":0.00055496977,"threshold_uncertainty_score":0.0128932595},"labels":[],"label_agreement":null},{"id":"W1568110710","doi":"10.1007/978-3-642-15314-3_29","title":"The Effect of Sequence Complexity on the Construction of Protein-Protein Interaction Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","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":"York University","funders":"","keywords":"Bottleneck; Computer science; Modularity (biology); Entropy (arrow of time); Protein Interaction Networks; Sequence (biology); Theoretical computer science; Node (physics); Computational complexity theory; Distributed computing; Algorithm; Biology; Protein–protein interaction; Genetics","score_opus":0.01262572519221599,"score_gpt":0.24038772465263947,"score_spread":0.22776199946042347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568110710","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.75164723,0.0016915649,0.2354611,0.0011389217,0.000102704274,0.00010308334,0.00046883395,0.000746719,0.008639788],"genre_scores_gemma":[0.9121206,0.0012418135,0.08368578,0.00013553587,0.00015087625,0.00010172954,0.00082443026,0.00030878212,0.0014303616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864966,0.000625653,0.00007755759,0.00020622325,0.0003537386,0.00008732616],"domain_scores_gemma":[0.94730216,0.047481105,0.0014248502,0.0020747222,0.0010581154,0.00065901753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030757512,0.0005891336,0.0010747146,0.0010889361,0.00073066284,0.0017711839,0.0010747039,0.0010405728,0.001733957],"category_scores_gemma":[0.024324927,0.00079499744,0.0009813817,0.0010965624,0.0013532232,0.0039813262,0.0013142057,0.0016883131,0.00033300725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011719473,0.00025799,0.011967207,0.00064944156,0.00019476892,0.00040054513,0.00030541912,0.7875159,0.041110847,0.061679266,0.0023356644,0.09241108],"study_design_scores_gemma":[0.00004314805,0.00014207722,0.0023783066,0.00002125413,0.00006656485,0.00017557802,0.000028069426,0.9186599,0.009050921,0.06865382,0.0007580266,0.000022317428],"about_ca_topic_score_codex":0.0005880738,"about_ca_topic_score_gemma":0.0011740772,"teacher_disagreement_score":0.0030757512,"about_ca_system_score_codex":0.0009051778,"about_ca_system_score_gemma":0.0005499049,"threshold_uncertainty_score":0.016266286},"labels":[],"label_agreement":null},{"id":"W1568146547","doi":"10.1007/3-540-44957-4_68","title":"Reasoning about Duplicate Elimination with Description Logic","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"University of Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Relational database; Object (grammar); Description logic; Semantics (computer science); P; Programming language; Logic program; Theoretical computer science; Relational calculus; Relational model; Data mining; Information retrieval; Logic programming; Artificial intelligence; Algorithm; Time complexity","score_opus":0.017021833721029687,"score_gpt":0.23640277011123365,"score_spread":0.21938093639020395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568146547","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.018289533,0.0010388306,0.9657768,0.0023925104,0.00016386666,0.00014943696,0.00079730124,0.0014285665,0.009963234],"genre_scores_gemma":[0.4035636,0.0020852198,0.57810783,0.001260251,0.00031921925,0.00024884564,0.0037049986,0.00048985827,0.010220253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99075586,0.0032882951,0.0007581388,0.0012059087,0.0033235978,0.0006683231],"domain_scores_gemma":[0.97900885,0.016404405,0.00063907786,0.00240722,0.0012910872,0.00024928892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008110695,0.0016125775,0.0015712775,0.0030358112,0.0019980227,0.0052843536,0.0056639565,0.0023207865,0.0067717875],"category_scores_gemma":[0.027097171,0.002429849,0.0042858813,0.003652355,0.0039967457,0.023013987,0.007745185,0.004641507,0.0008290396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039845146,0.00018733338,0.0022494043,0.0012282162,0.00047271818,0.0019263519,0.0009696662,0.058963265,0.0021824231,0.7927681,0.016396785,0.1222572],"study_design_scores_gemma":[0.00010046473,0.00002206128,0.00013891912,0.00009173704,0.00021162425,0.0005756486,0.0002561357,0.12123276,0.0053638625,0.8617571,0.010202415,0.000047267014],"about_ca_topic_score_codex":0.004356525,"about_ca_topic_score_gemma":0.004193356,"teacher_disagreement_score":0.008110695,"about_ca_system_score_codex":0.0024534445,"about_ca_system_score_gemma":0.0018545251,"threshold_uncertainty_score":0.042893946},"labels":[],"label_agreement":null},{"id":"W1568228276","doi":"10.1007/978-3-642-12133-3_7","title":"Application-Specific Signatures for Transactional Memory in Soft Processors","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transactional memory; Field-programmable gate array; Scalability; Overhead (engineering); Signature (topology); Throughput; Synchronization (alternating current); Network packet; Embedded system; Parallel computing; Computer hardware; Computer network; Operating system; Channel (broadcasting); Database transaction","score_opus":0.0110799913782468,"score_gpt":0.2366334224644085,"score_spread":0.2255534310861617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568228276","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.032955233,0.0020138365,0.9416964,0.00043798436,0.000561982,0.00017415234,0.00029452727,0.005043273,0.016822634],"genre_scores_gemma":[0.55733544,0.0018023376,0.40535685,0.0005788866,0.00038586516,0.00037299635,0.0010342766,0.0016729767,0.03146029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840933,0.00035612364,0.00021812813,0.00016558918,0.00064550387,0.00020531108],"domain_scores_gemma":[0.99623704,0.000889142,0.00026649926,0.0019938042,0.00048274183,0.0001306901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013735214,0.0006009907,0.00093759823,0.00077877473,0.00090024254,0.0032543144,0.002177135,0.0013743732,0.004372021],"category_scores_gemma":[0.0048897006,0.00066493417,0.00051511417,0.0017184232,0.0013399777,0.004774776,0.0023192733,0.0032053066,0.0023349149],"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.0006393903,0.0001721193,0.000804906,0.00070912356,0.000049659026,0.00029757633,0.00080748816,0.01755526,0.02888704,0.5550114,0.013734953,0.38133106],"study_design_scores_gemma":[0.00009608109,0.00026872914,0.0004181253,0.00021774795,0.00009121272,0.0010159293,0.00035471725,0.16404432,0.106488906,0.60318476,0.12370781,0.000111674126],"about_ca_topic_score_codex":0.00016304907,"about_ca_topic_score_gemma":0.00031963483,"teacher_disagreement_score":0.004372021,"about_ca_system_score_codex":0.0006963295,"about_ca_system_score_gemma":0.0011546083,"threshold_uncertainty_score":0.014625907},"labels":[],"label_agreement":null},{"id":"W1568373463","doi":"10.1007/978-3-642-04425-0_27","title":"An Incremental Algorithm for High-Performance Runtime Model Consistency","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Computer science; Graph rewriting; Distributed computing; Rewriting; Consistency (knowledge bases); Model transformation; Runtime system; Transformation (genetics); Graph; Theoretical computer science; Algorithm; Programming language; Artificial intelligence","score_opus":0.013332848844189987,"score_gpt":0.23624660742557332,"score_spread":0.22291375858138335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568373463","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.0045662955,0.00007475231,0.98805934,0.00011966764,0.00007204555,0.000110271176,0.00008264444,0.0056731296,0.0012417735],"genre_scores_gemma":[0.07295644,0.000058647063,0.923148,0.00012028308,0.000048038288,0.00017792408,0.0005899376,0.0013332221,0.0015673994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636453,0.00065175415,0.00026399127,0.0007542404,0.0015744927,0.00039092064],"domain_scores_gemma":[0.9899663,0.0035309994,0.0003998375,0.0039477814,0.0018935864,0.0002615087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030322904,0.0017938807,0.0016819094,0.002607129,0.001685695,0.0028015492,0.006334568,0.0019544314,0.011293002],"category_scores_gemma":[0.016890477,0.0015911645,0.0022639418,0.0030270217,0.0016282472,0.006161673,0.008497869,0.004265791,0.0025068962],"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.0007237927,0.00044236673,0.0015473223,0.00040212256,0.00020479548,0.0002805211,0.00036665582,0.0769949,0.020670248,0.055392336,0.021584753,0.8213901],"study_design_scores_gemma":[0.00021379613,0.00010394154,0.00044839326,0.00003614336,0.0001650575,0.00023808389,0.00015981864,0.90314174,0.023141026,0.06519529,0.0070981854,0.00005851548],"about_ca_topic_score_codex":0.0037508458,"about_ca_topic_score_gemma":0.0066462075,"teacher_disagreement_score":0.011293002,"about_ca_system_score_codex":0.0015258437,"about_ca_system_score_gemma":0.00345135,"threshold_uncertainty_score":0.037778854},"labels":[],"label_agreement":null},{"id":"W1568409091","doi":"10.1007/978-3-540-68825-9_31","title":"A Stochastic Point-Based Algorithm for POMDPs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Benchmark (surveying); Operator (biology); Bellman equation; Markov decision process; Mathematical optimization; Markov process; Mathematics","score_opus":0.022704779862040107,"score_gpt":0.25775837026379134,"score_spread":0.23505359040175122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568409091","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.0015117148,0.000057023448,0.9965062,0.000054558008,0.00003587808,0.0000604476,0.000038843842,0.00046468028,0.0012706796],"genre_scores_gemma":[0.0762539,0.0001301159,0.9203716,0.000099070814,0.000052507738,0.00043700173,0.00022948199,0.00025969863,0.002166646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987379,0.00031115048,0.00008591366,0.0002463667,0.0004885629,0.000130042],"domain_scores_gemma":[0.99792445,0.001405826,0.000086208776,0.00015449227,0.00032703206,0.00010189486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024120524,0.001596229,0.0025644384,0.001119067,0.0010990953,0.0017654897,0.003255142,0.0027689135,0.008718968],"category_scores_gemma":[0.005850554,0.0014168695,0.0019687507,0.0017177999,0.0015375664,0.0018700432,0.0035702274,0.0033189668,0.0016618605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015122956,0.00009151697,0.00024166738,0.00014747844,0.000071328366,0.000052294952,0.00007866552,0.81873125,0.0010074421,0.046911452,0.0026531506,0.12986253],"study_design_scores_gemma":[0.00004047205,0.000019738463,0.000020806878,0.000010320308,0.000008476828,0.000010275868,0.0000057628217,0.9857655,0.00021181724,0.013247465,0.00065273,0.0000065926747],"about_ca_topic_score_codex":0.0087594455,"about_ca_topic_score_gemma":0.0087524885,"teacher_disagreement_score":0.0087594455,"about_ca_system_score_codex":0.0017694134,"about_ca_system_score_gemma":0.0031131492,"threshold_uncertainty_score":0.029167831},"labels":[],"label_agreement":null},{"id":"W1568489636","doi":"10.1007/978-3-540-24595-7_48","title":"GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph drawing; Visualization; Computer graphics (images); Graph; Engineering drawing; Theoretical computer science; Artificial intelligence","score_opus":0.012635708927529249,"score_gpt":0.24246090299937778,"score_spread":0.22982519407184854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568489636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008452957,0.0005460551,0.9260325,0.0003621896,0.00018908325,0.00010946973,0.0027732211,0.05475288,0.0067815585],"genre_scores_gemma":[0.07046709,0.0015535438,0.89900833,0.000227888,0.00007146951,0.00041642427,0.0044600605,0.01450539,0.009289746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965906,0.00007612768,0.000026730899,0.000057254347,0.00013902456,0.00004183037],"domain_scores_gemma":[0.99906296,0.00047914786,0.000045088957,0.00020143011,0.00013899745,0.0000723287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004678453,0.0021711034,0.0010933012,0.001908204,0.0006481048,0.002879253,0.0020556757,0.00093532127,0.042510528],"category_scores_gemma":[0.0018183602,0.001059089,0.0013400293,0.0018887727,0.0005491846,0.0022190223,0.0026982478,0.0018905579,0.007628274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005043642,0.00013557001,0.0008998602,0.0018576697,0.0001778586,0.0008248475,0.0016599705,0.031258836,0.06188199,0.051418595,0.17133714,0.6780432],"study_design_scores_gemma":[0.0004226831,0.00014226515,0.0018985211,0.000474437,0.00015087811,0.0015082452,0.0007000827,0.42911044,0.097267404,0.1421107,0.32590702,0.0003072394],"about_ca_topic_score_codex":0.0019486137,"about_ca_topic_score_gemma":0.002915255,"teacher_disagreement_score":0.042510528,"about_ca_system_score_codex":0.0003946702,"about_ca_system_score_gemma":0.0006551461,"threshold_uncertainty_score":0.14221191},"labels":[],"label_agreement":null},{"id":"W1568552330","doi":"10.1007/978-3-642-15246-7_47","title":"An Adaptive Bidding Strategy for Combinatorial Auction-Based Resource Allocation in Dynamic Markets","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Bidding; Combinatorial auction; Computer science; Profit (economics); Common value auction; Operations research; Ebidding; Resource allocation; Resource (disambiguation); Mathematical optimization; Margin (machine learning); Adaptive strategies; Microeconomics; Economics; Machine learning; Mathematics","score_opus":0.04461076059919705,"score_gpt":0.3420991646893079,"score_spread":0.29748840409011085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568552330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017646087,0.00014740223,0.9724983,0.0001624669,0.000080042904,0.00014620576,0.000028321747,0.00021321863,0.009077976],"genre_scores_gemma":[0.71737164,0.00024664245,0.27206588,0.00018191028,0.00009746532,0.00038841477,0.00009191743,0.00010322034,0.009452955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.0003350676,0.00004814459,0.00008703986,0.00020610853,0.00007232855],"domain_scores_gemma":[0.99926585,0.00038250975,0.000046071174,0.0000636058,0.00018417559,0.00005775446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015391617,0.00070675777,0.0011749616,0.00038534586,0.0003955535,0.0015286264,0.0022724355,0.0012524053,0.003312977],"category_scores_gemma":[0.0034711391,0.00043330403,0.0005625509,0.00066368125,0.0006850646,0.00135822,0.0010797277,0.0009942643,0.00056677876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038367414,0.0003939559,0.0004975426,0.00024712802,0.00013489014,0.00021568996,0.00020109069,0.5246458,0.0148119945,0.22888108,0.008202243,0.22138493],"study_design_scores_gemma":[0.0000294702,0.000045784633,0.000051519284,0.0000047876497,0.000010118331,0.00003473912,0.0000075387347,0.97951597,0.00031613064,0.019437613,0.0005384178,0.000007909619],"about_ca_topic_score_codex":0.0009315135,"about_ca_topic_score_gemma":0.0009766383,"teacher_disagreement_score":0.003312977,"about_ca_system_score_codex":0.0007234904,"about_ca_system_score_gemma":0.00095171155,"threshold_uncertainty_score":0.011083007},"labels":[],"label_agreement":null},{"id":"W1568642505","doi":"10.1007/3-540-44987-6_26","title":"New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Bounding overwatch; Combinatorics; Linear cryptanalysis; Mathematics; Discrete mathematics; Cryptanalysis; Computer science; Algorithm; Cryptography","score_opus":0.03831357667032488,"score_gpt":0.3279951763168643,"score_spread":0.28968159964653944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568642505","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.001093676,0.0004416594,0.9927492,0.0001332204,0.00014099182,0.000029643395,0.000083687184,0.00046405816,0.0048639025],"genre_scores_gemma":[0.12516285,0.0020871088,0.8437418,0.0006490177,0.0015556057,0.00064836413,0.0006422041,0.001336137,0.02417693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99533385,0.0010529198,0.00023055496,0.00082347746,0.0022146376,0.00034455513],"domain_scores_gemma":[0.9866818,0.008433373,0.0005023984,0.0022316822,0.0017702337,0.00038057618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004132773,0.0029361048,0.0025281059,0.004579669,0.0014223089,0.004058233,0.0043694624,0.0024164452,0.011815008],"category_scores_gemma":[0.018112434,0.0015501722,0.0022795182,0.0033804064,0.003048461,0.009282851,0.0053439047,0.008238996,0.0034204714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021980327,0.0001405203,0.00080479484,0.0005750556,0.0001922453,0.00021822508,0.00027304632,0.15709537,0.015482026,0.623079,0.018775139,0.18314478],"study_design_scores_gemma":[0.000012893775,0.000046169367,0.0002592878,0.00005406442,0.00004966267,0.00017850068,0.000020196561,0.7654323,0.005569147,0.21821381,0.0101171555,0.00004682698],"about_ca_topic_score_codex":0.0013873219,"about_ca_topic_score_gemma":0.002594759,"teacher_disagreement_score":0.011815008,"about_ca_system_score_codex":0.0033140287,"about_ca_system_score_gemma":0.0016381525,"threshold_uncertainty_score":0.03952515},"labels":[],"label_agreement":null},{"id":"W1568647029","doi":"10.1007/978-3-642-14600-8_5","title":"The Graduate Student Symposium of Diagrams 2010","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Computer science; Graduate students; Mathematics education; Library science; Psychology; Pedagogy","score_opus":0.027098211573725137,"score_gpt":0.2937318296303837,"score_spread":0.26663361805665853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568647029","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075444872,0.09075488,0.19014281,0.06942897,0.22104903,0.00026496776,0.0023288806,0.0041423435,0.41434363],"genre_scores_gemma":[0.018965373,0.030911421,0.029326623,0.0022328258,0.013837659,0.00011958712,0.0015444799,0.0019269008,0.9011352],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991391,0.00021235204,0.000036879224,0.00019088486,0.00033850965,0.00008220871],"domain_scores_gemma":[0.99809057,0.00037018082,0.00005293114,0.00017810064,0.00074587204,0.0005622433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022691265,0.0012511344,0.0009074247,0.002858466,0.0012604628,0.005514996,0.0014526726,0.0014398161,0.09172861],"category_scores_gemma":[0.0038815332,0.00054454146,0.0009898621,0.0025894234,0.0007674324,0.0038264133,0.0024779106,0.00254499,0.03062582],"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.000050758186,0.00003320895,0.00018312137,0.00016978459,0.000009206091,0.000044631055,0.00013102355,0.00038352842,0.0007018907,0.02357071,0.81043637,0.1642858],"study_design_scores_gemma":[0.000004290256,0.00002286238,0.00013148978,0.00011402456,0.000008069848,0.00007556067,0.00006837192,0.0004269414,0.000309807,0.008450007,0.9903813,0.0000072173034],"about_ca_topic_score_codex":0.0014541646,"about_ca_topic_score_gemma":0.0052417796,"teacher_disagreement_score":0.09172861,"about_ca_system_score_codex":0.0017231585,"about_ca_system_score_gemma":0.0021145712,"threshold_uncertainty_score":0.30686277},"labels":[],"label_agreement":null},{"id":"W1568737819","doi":"10.1007/978-3-540-27868-9_11","title":"Extraction of Skeletal Shape Features Using a Visual Attention Operator","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"Université du Québec","funders":"","keywords":"Computer science; Operator (biology); Artificial intelligence; Computer vision; Invariant (physics); Salient; Pattern recognition (psychology); Piecewise; Piecewise linear function; Representation (politics); Mathematics; Geometry","score_opus":0.020409177589147495,"score_gpt":0.3030401216980375,"score_spread":0.28263094410889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568737819","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.029377304,0.00030904196,0.96468675,0.000103338156,0.00008333751,0.0001060789,0.00027328864,0.0029767563,0.0020842],"genre_scores_gemma":[0.16941391,0.000600908,0.8209419,0.0001833269,0.00013114922,0.000102688704,0.0012974645,0.0007125004,0.006616121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974626,0.00001320077,0.000011875737,0.00007774559,0.00010111671,0.000049751194],"domain_scores_gemma":[0.99966776,0.00007586272,0.00002948132,0.00004568395,0.00013660357,0.000044670054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030554287,0.0011002073,0.0013512103,0.002986663,0.00032995892,0.0008060218,0.0010290998,0.0008247335,0.0055677146],"category_scores_gemma":[0.00069764635,0.0005797758,0.001100851,0.0019554463,0.00035623106,0.0007829093,0.0009182132,0.0007132449,0.0023644147],"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.00017555167,0.000062497835,0.00050698785,0.00013167689,0.0000318835,0.0001240663,0.00003188134,0.0027018024,0.3204214,0.0012279788,0.003460309,0.6711239],"study_design_scores_gemma":[0.0000831755,0.0005104217,0.013218628,0.000053784457,0.00021803322,0.001468254,0.0001385285,0.714027,0.24905694,0.008290736,0.012849763,0.00008480661],"about_ca_topic_score_codex":0.0029239322,"about_ca_topic_score_gemma":0.005497791,"teacher_disagreement_score":0.0055677146,"about_ca_system_score_codex":0.00030968973,"about_ca_system_score_gemma":0.000795653,"threshold_uncertainty_score":0.018625796},"labels":[],"label_agreement":null},{"id":"W1568747565","doi":"10.1007/978-3-540-68155-7_17","title":"Counting Solutions of Knapsack Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Knapsack problem; Heuristics; Constraint (computer-aided design); Mathematical optimization; Simple (philosophy); Computer science; Domain (mathematical analysis); Variable (mathematics); Mathematics; Algorithm; Theoretical computer science","score_opus":0.022115423294935013,"score_gpt":0.2339985973885273,"score_spread":0.21188317409359228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568747565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012792704,0.0023523874,0.92226046,0.00086752395,0.0007762068,0.00024598226,0.00077752187,0.0009037664,0.059023462],"genre_scores_gemma":[0.074845865,0.0022062613,0.88720834,0.00032098262,0.00039048961,0.0005367996,0.002551243,0.0009081404,0.031031907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964605,0.000932518,0.0002759256,0.0006583692,0.0013483516,0.00032435328],"domain_scores_gemma":[0.99290353,0.0043235384,0.0004476956,0.0009060568,0.001189323,0.00022993433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022858123,0.002071906,0.0018969047,0.0035658488,0.0013899601,0.0036382987,0.0046162936,0.0019973277,0.02453661],"category_scores_gemma":[0.021337729,0.0012920875,0.0013744531,0.008242874,0.0013042067,0.0061873114,0.0026593616,0.0036330738,0.004694173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001481115,0.00012346264,0.0006590994,0.001131762,0.000081577135,0.000096878844,0.00018635583,0.05563673,0.0027540084,0.3722903,0.03880331,0.52808833],"study_design_scores_gemma":[0.000044790188,0.000078802055,0.0004248904,0.00039461162,0.00007772631,0.00025587552,0.00012455539,0.23365271,0.0041521136,0.7218235,0.03891649,0.00005387298],"about_ca_topic_score_codex":0.001615575,"about_ca_topic_score_gemma":0.002782388,"teacher_disagreement_score":0.02453661,"about_ca_system_score_codex":0.0016106425,"about_ca_system_score_gemma":0.0015113637,"threshold_uncertainty_score":0.082083166},"labels":[],"label_agreement":null},{"id":"W1568757735","doi":"10.1007/978-3-642-12200-2_32","title":"Finding the Best CAFE Is NP-Hard","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Ottawa","funders":"","keywords":"Clique; Binary number; Computer science; Reduction (mathematics); Time complexity; Enhanced Data Rates for GSM Evolution; Computational complexity theory; Polynomial; Hardness of approximation; Theoretical computer science; Discrete mathematics; Combinatorics; Algorithm; Approximation algorithm; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.03334229128567038,"score_gpt":0.2729033384576659,"score_spread":0.23956104717199553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568757735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19798718,0.006891035,0.54884803,0.022939669,0.0010042919,0.00051564706,0.0065258755,0.012701029,0.20258717],"genre_scores_gemma":[0.4254665,0.0021970482,0.51530933,0.001298106,0.00037756152,0.00025991802,0.0037592475,0.0026726576,0.048659593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984458,0.0002495249,0.00009615226,0.00057686184,0.00031774386,0.00031382704],"domain_scores_gemma":[0.9929046,0.004829609,0.00031258786,0.0011783269,0.0005229692,0.00025189944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135371,0.0015984388,0.0026152434,0.0012355684,0.003123313,0.0043120566,0.0021462261,0.0035255789,0.029222695],"category_scores_gemma":[0.008008618,0.0017119094,0.002644218,0.0025394089,0.0024812345,0.01465689,0.0024863759,0.0051291524,0.0052227285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009288542,0.0006383796,0.0030938105,0.0023132036,0.00027555483,0.0006356777,0.00074495375,0.033835996,0.009761241,0.3119076,0.18734579,0.4485189],"study_design_scores_gemma":[0.00030044,0.00016323864,0.0009123042,0.0003089744,0.00025754696,0.0011087372,0.0006588283,0.06499899,0.007851515,0.8402494,0.08310343,0.000086581946],"about_ca_topic_score_codex":0.0033085758,"about_ca_topic_score_gemma":0.0063905967,"teacher_disagreement_score":0.029222695,"about_ca_system_score_codex":0.0017396532,"about_ca_system_score_gemma":0.0016655362,"threshold_uncertainty_score":0.097759664},"labels":[],"label_agreement":null},{"id":"W1568806324","doi":"10.1007/3-540-45683-x_46","title":"Efficiently Clustering Documents with Committees","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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 Alberta","funders":"","keywords":"Cluster analysis; Computer science; Similarity (geometry); Set (abstract data type); Data mining; Task (project management); Group (periodic table); Cluster (spacecraft); Space (punctuation); Document clustering; Correlation clustering; Single-linkage clustering; CURE data clustering algorithm; Information retrieval; Artificial intelligence; Image (mathematics)","score_opus":0.018519313587672916,"score_gpt":0.269153790340296,"score_spread":0.2506344767526231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568806324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010480861,0.0008877034,0.9777827,0.0002442684,0.00013065596,0.00020884957,0.00069334375,0.0064889584,0.00308279],"genre_scores_gemma":[0.06185454,0.0005124663,0.9210721,0.00015636733,0.00021298735,0.00028106503,0.00489845,0.00093529304,0.01007676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963154,0.0012754695,0.00028796747,0.00072039256,0.0011567936,0.00024388773],"domain_scores_gemma":[0.9955687,0.0014312738,0.00021689729,0.0015393007,0.0010286226,0.00021520774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026857085,0.0017153273,0.0027241171,0.0037891583,0.0019459483,0.0031556468,0.0030639018,0.001808059,0.0068686786],"category_scores_gemma":[0.009371942,0.0015782635,0.0023427901,0.0063566905,0.0008368842,0.0037295371,0.0033813126,0.0020917093,0.0084011555],"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.0006312073,0.00022958321,0.0009432637,0.00033837234,0.00024460597,0.00010537261,0.00016568904,0.048817456,0.018056806,0.012518083,0.04411806,0.87383145],"study_design_scores_gemma":[0.00017580552,0.0002090296,0.00085337163,0.000058988193,0.00017735663,0.0004228434,0.00015661388,0.8676834,0.030533655,0.07318313,0.026482513,0.00006330356],"about_ca_topic_score_codex":0.0029278968,"about_ca_topic_score_gemma":0.0065086894,"teacher_disagreement_score":0.0068686786,"about_ca_system_score_codex":0.00096733886,"about_ca_system_score_gemma":0.0018428242,"threshold_uncertainty_score":0.022978067},"labels":[],"label_agreement":null},{"id":"W1568828078","doi":"10.1007/11915072_3","title":"Issues for Robust Consensus Building in P2P Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Carleton University","funders":"","keywords":"Computer science; Interoperability; Semantic interoperability; Semantic mapping; Focus (optics); Peer-to-peer; Semantic technology; World Wide Web; Semantic computing; Data science; Semantic Web; Knowledge management; Information retrieval","score_opus":0.027463023292753626,"score_gpt":0.2663569618980504,"score_spread":0.23889393860529679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568828078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006541691,0.00082029315,0.9812407,0.0032432072,0.00017568421,0.00009333838,0.00007910692,0.00022373188,0.0075823017],"genre_scores_gemma":[0.6670171,0.0021157928,0.31716245,0.00078571547,0.0010935651,0.0007262153,0.00051481056,0.0004759308,0.010108361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98904735,0.0043315417,0.000809455,0.0021678342,0.0028767602,0.00076709175],"domain_scores_gemma":[0.93677765,0.048892893,0.0020612958,0.0068297563,0.0044719377,0.00096651213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0151229855,0.0009645444,0.002319625,0.0011948268,0.0029930181,0.007302872,0.0059922924,0.0061649587,0.0077392464],"category_scores_gemma":[0.07930663,0.0015261554,0.001646208,0.0023262138,0.00538785,0.017916791,0.00578638,0.006182721,0.0015649452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014314734,0.00007335961,0.00034602382,0.00032854144,0.00009234525,0.00022124963,0.00045877052,0.1776446,0.0014596434,0.759098,0.006609453,0.053524803],"study_design_scores_gemma":[0.000025971234,0.000025406995,0.00009252309,0.00003955943,0.00002108432,0.00005803065,0.00014071203,0.24481417,0.0010456137,0.75055873,0.0031547756,0.000023350036],"about_ca_topic_score_codex":0.0020898967,"about_ca_topic_score_gemma":0.001221517,"teacher_disagreement_score":0.0151229855,"about_ca_system_score_codex":0.0030731924,"about_ca_system_score_gemma":0.0021193277,"threshold_uncertainty_score":0.07997894},"labels":[],"label_agreement":null},{"id":"W1568878473","doi":"10.1007/978-3-642-04636-0_15","title":"Can Educators Develop Ontologies Using Ontology Extraction Tools: An End-User Study","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Athabasca University; Simon Fraser University","funders":"","keywords":"Ontology; Computer science; Domain (mathematical analysis); Upper ontology; Process ontology; Ontology components; Ontology learning; Information retrieval; Ontology-based data integration; Data science; Ontology alignment; Semantic Web; World Wide Web; Software engineering; Knowledge management; Suggested Upper Merged Ontology","score_opus":0.057303713443894594,"score_gpt":0.31792628776065956,"score_spread":0.26062257431676494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568878473","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.95860416,0.00017469442,0.014553683,0.0013700151,0.00003784891,0.00044594,0.0005411164,0.0008956342,0.02337706],"genre_scores_gemma":[0.95665365,0.00036680317,0.028330425,0.0008950077,0.000012285424,0.000359933,0.0012319309,0.0004457726,0.011704208],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9947684,0.003241127,0.00030570323,0.00048020954,0.0007012668,0.00050324714],"domain_scores_gemma":[0.91297126,0.06731156,0.0016117848,0.0060706544,0.010307599,0.0017272363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013477948,0.0006875965,0.0007836643,0.0014364744,0.0014693317,0.0061509334,0.0015427293,0.0020861023,0.008515135],"category_scores_gemma":[0.08307388,0.0006307717,0.00054971647,0.0013335472,0.00086055906,0.01234244,0.0033711656,0.001796539,0.003872583],"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.003041732,0.014516696,0.13707042,0.0011591015,0.00014252306,0.0018815495,0.30378398,0.0015485125,0.0077133668,0.00835803,0.026532697,0.4942514],"study_design_scores_gemma":[0.0015068202,0.005198213,0.09824102,0.0014104235,0.0006213041,0.0025333352,0.5766178,0.029934468,0.036104415,0.023622798,0.22365348,0.0005560097],"about_ca_topic_score_codex":0.003827766,"about_ca_topic_score_gemma":0.0068309745,"teacher_disagreement_score":0.013477948,"about_ca_system_score_codex":0.0010923294,"about_ca_system_score_gemma":0.0014844248,"threshold_uncertainty_score":0.07127905},"labels":[],"label_agreement":null},{"id":"W1568909511","doi":"10.1007/3-540-45486-1_37","title":"The Learnability of Naive Bayes","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Western University","funders":"","keywords":"Learnability; Computer science; Separable space; Naive Bayes classifier; Bayes' theorem; Domain (mathematical analysis); Binary number; Bayesian programming; Representation (politics); Artificial intelligence; Simple (philosophy); Binary classification; Machine learning; Algorithm; Theoretical computer science; Mathematics; Bayesian probability; Bayes factor; Support vector machine; Arithmetic","score_opus":0.017819031482865146,"score_gpt":0.24791755622933942,"score_spread":0.23009852474647427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568909511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02408148,0.009207246,0.88437,0.013541999,0.00055399403,0.00006862964,0.00049682346,0.0005006905,0.06717908],"genre_scores_gemma":[0.7629655,0.007805589,0.2003474,0.0036685923,0.003921544,0.00036199158,0.0008740374,0.0003899446,0.01966543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875897,0.0074440786,0.00045981872,0.0014885154,0.002686912,0.00033082583],"domain_scores_gemma":[0.879399,0.106428005,0.0020339533,0.008488852,0.0029548258,0.00069537124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012646729,0.0010591772,0.002087262,0.0024006949,0.001746151,0.0057555484,0.0028115097,0.002642119,0.008195999],"category_scores_gemma":[0.111451305,0.0015145333,0.0014502164,0.002144966,0.009275967,0.019183308,0.0032658174,0.006941635,0.0012343251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054568274,0.000019642612,0.00043431815,0.00013278447,0.00005238929,0.000034700595,0.00017622214,0.006272665,0.00010004456,0.9557307,0.003572377,0.033419617],"study_design_scores_gemma":[0.000006336085,0.0000029791431,0.00004862961,0.0000149264615,0.000005926706,0.000016487553,0.000007708525,0.0084399525,0.00003397407,0.9906034,0.000815118,0.000004504116],"about_ca_topic_score_codex":0.0027126756,"about_ca_topic_score_gemma":0.0016111104,"teacher_disagreement_score":0.012646729,"about_ca_system_score_codex":0.0023454397,"about_ca_system_score_gemma":0.0015372861,"threshold_uncertainty_score":0.06688315},"labels":[],"label_agreement":null},{"id":"W1568931959","doi":"10.1007/978-3-642-11970-5_4","title":"Optimizing Matlab through Just-In-Time Specialization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":65,"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":"Computer science; MATLAB; Compiler; Interpreter; Octave (electronics); Just-in-time compilation; Implementation; Key (lock); Programming language; Computer engineering; Operating system","score_opus":0.019961239747998134,"score_gpt":0.26419405974444704,"score_spread":0.2442328199964489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568931959","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.012026718,0.00035877916,0.94484234,0.0002650831,0.00023502488,0.000042591677,0.0001654992,0.010509226,0.031554747],"genre_scores_gemma":[0.26223165,0.0005120447,0.6870057,0.00050124375,0.00020015676,0.00014941236,0.00079892384,0.0066566295,0.0419443],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915516,0.00015966054,0.00005417773,0.00017106581,0.00029515015,0.0001647911],"domain_scores_gemma":[0.99884003,0.0004855401,0.00005054238,0.00036375833,0.00021329259,0.000046979894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444475,0.0015897516,0.00086542586,0.0005071104,0.0005730076,0.0014002182,0.0013767148,0.00058337575,0.02812581],"category_scores_gemma":[0.0035871372,0.00049397,0.0008900228,0.00068586937,0.00086158916,0.0021134336,0.0017658712,0.0015804854,0.013102299],"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.0006278517,0.0001865382,0.0010706474,0.00049583975,0.00011034267,0.0003811095,0.0002677812,0.063307114,0.026684167,0.08997504,0.043894295,0.7729992],"study_design_scores_gemma":[0.0002836649,0.0003371982,0.0010964731,0.000111230846,0.00013688703,0.0008730556,0.0001748284,0.6884505,0.06932895,0.14120668,0.09792044,0.00008010504],"about_ca_topic_score_codex":0.0019967488,"about_ca_topic_score_gemma":0.0044710236,"teacher_disagreement_score":0.02812581,"about_ca_system_score_codex":0.0005506334,"about_ca_system_score_gemma":0.0010787566,"threshold_uncertainty_score":0.09409022},"labels":[],"label_agreement":null},{"id":"W1568948840","doi":"10.1007/978-3-642-13059-5_29","title":"Word Reordering Approaches for Bangla-English Statistical Machine Translation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bengali; Computer science; Natural language processing; Phrase; Machine translation; Artificial intelligence; Word (group theory); Evaluation of machine translation; Set (abstract data type); BLEU; Test set; Translation (biology); Speech recognition; Machine translation software usability; Example-based machine translation; Linguistics; Programming language","score_opus":0.02836534934894377,"score_gpt":0.2629976114513641,"score_spread":0.2346322621024203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568948840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015671855,0.0039173807,0.9609963,0.00062924816,0.000642402,0.00019470058,0.001691721,0.0060984516,0.010157991],"genre_scores_gemma":[0.15997566,0.0036468513,0.807627,0.00036209376,0.00041594682,0.0002705868,0.0076962644,0.002440921,0.017564615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984988,0.0006302316,0.00023524486,0.000237139,0.00027979398,0.00011876409],"domain_scores_gemma":[0.99762374,0.0010026764,0.00014381157,0.00049925776,0.0006752857,0.000055281795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014041502,0.0011163849,0.0009951054,0.0019386671,0.0011527593,0.002524531,0.0011533524,0.00075014634,0.00867811],"category_scores_gemma":[0.0030413407,0.00067428243,0.0011948592,0.0037894282,0.0005006837,0.0021100752,0.0014490804,0.0015638974,0.008367972],"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.00029551474,0.00017360903,0.0009772469,0.00074934226,0.00020238502,0.00048474877,0.00070052576,0.018285293,0.0320001,0.030244103,0.028657679,0.88722944],"study_design_scores_gemma":[0.00015795894,0.00044648076,0.0036443598,0.00025121693,0.00046383525,0.001577646,0.0018683453,0.5857523,0.0886832,0.17066301,0.14628386,0.00020777575],"about_ca_topic_score_codex":0.0038712383,"about_ca_topic_score_gemma":0.010687216,"teacher_disagreement_score":0.00867811,"about_ca_system_score_codex":0.00070987875,"about_ca_system_score_gemma":0.0016693559,"threshold_uncertainty_score":0.029031157},"labels":[],"label_agreement":null},{"id":"W1568987606","doi":"10.1007/978-3-540-68891-4_7","title":"A Polynomial Algorithm for Weighted Abstract Flow","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Path (computing); Generalization; Flow (mathematics); Constructive; Oracle; Mathematics; Flow network; Minimum-cost flow problem; sort; Mathematical optimization; Maximum flow problem; Polynomial; Computer science; Algorithm; Arithmetic","score_opus":0.02192116302009429,"score_gpt":0.24524403444849918,"score_spread":0.2233228714284049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568987606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010987143,0.00019048386,0.96843195,0.0005218392,0.00017116225,0.00028471719,0.00053583377,0.0041186656,0.01475824],"genre_scores_gemma":[0.082338355,0.00034653445,0.892857,0.00026105982,0.00016009422,0.0005617243,0.0022535594,0.0013063016,0.019915288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982443,0.00023107193,0.0001339283,0.0005909918,0.00050610286,0.00029367374],"domain_scores_gemma":[0.9980959,0.0007736181,0.00009426019,0.00062294665,0.00029119893,0.00012216602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629743,0.0020520058,0.0016658661,0.0020156463,0.0016069326,0.0036186462,0.0044835974,0.0021447234,0.02593422],"category_scores_gemma":[0.005015381,0.0012583259,0.0028936546,0.0039006951,0.0015547607,0.01002142,0.005158375,0.004482433,0.0072679943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005113806,0.00048906996,0.00038310754,0.0005240671,0.00008626322,0.000067281435,0.00029170158,0.03296163,0.007844025,0.32318386,0.03260053,0.6010572],"study_design_scores_gemma":[0.00026581844,0.00009907017,0.00027638845,0.00007470823,0.000106129766,0.0001009262,0.00010080529,0.24255334,0.0054889694,0.7289006,0.021981468,0.000051761264],"about_ca_topic_score_codex":0.0038578364,"about_ca_topic_score_gemma":0.0039618355,"teacher_disagreement_score":0.02593422,"about_ca_system_score_codex":0.0028543428,"about_ca_system_score_gemma":0.0028096668,"threshold_uncertainty_score":0.08675861},"labels":[],"label_agreement":null},{"id":"W1569118488","doi":"10.1007/11607380_9","title":"Monitoring for Hierarchical Web Services Compositions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Snapshot (computer storage); Computer science; Composability; Web service; Services computing; World Wide Web; Distributed computing; Database","score_opus":0.010553596995686603,"score_gpt":0.24317603098806662,"score_spread":0.23262243399238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569118488","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.08011463,0.0004512849,0.9055669,0.00021992043,0.00005817566,0.00021420878,0.00014546767,0.009120288,0.004109092],"genre_scores_gemma":[0.7477726,0.00019938695,0.24714857,0.00006811104,0.000045315002,0.00012413961,0.0003330375,0.00030659206,0.0040022875],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814427,0.0004097248,0.0001672189,0.00036349805,0.00071809924,0.00019728321],"domain_scores_gemma":[0.99634546,0.0017410949,0.00050332875,0.0008373147,0.0004179887,0.00015482494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025361448,0.00061778305,0.0007613044,0.0012790918,0.0007791819,0.0013876673,0.001345588,0.00064549636,0.0023292203],"category_scores_gemma":[0.0063698455,0.00057926576,0.00044926532,0.0007360279,0.0007310159,0.0021303208,0.0013993698,0.0009071892,0.00045177506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021128135,0.0004638963,0.010419809,0.00047809913,0.00013160234,0.0006131016,0.00083625055,0.17765993,0.058755234,0.08032842,0.006775571,0.6614253],"study_design_scores_gemma":[0.00004633792,0.00009417338,0.0012419091,0.000032783788,0.000055048476,0.00016447264,0.000051954983,0.93869346,0.025794491,0.030364012,0.0034386127,0.000022718936],"about_ca_topic_score_codex":0.0035678584,"about_ca_topic_score_gemma":0.00416468,"teacher_disagreement_score":0.0035678584,"about_ca_system_score_codex":0.0012346221,"about_ca_system_score_gemma":0.00095887267,"threshold_uncertainty_score":0.013412595},"labels":[],"label_agreement":null},{"id":"W1569248516","doi":"10.1007/978-3-540-30194-3_18","title":"Weather Report Translation Using a Translation Memory","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Translation (biology); Machine translation; Landmark; Transfer-based machine translation; Context (archaeology); Natural language processing; Artificial intelligence; Example-based machine translation; History","score_opus":0.029810146427275832,"score_gpt":0.284141609649421,"score_spread":0.25433146322214517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569248516","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.0354859,0.0011343686,0.71856785,0.0017475039,0.0038972048,0.00058649713,0.01079826,0.085031666,0.14275065],"genre_scores_gemma":[0.32499394,0.0015950314,0.49565282,0.00095353695,0.0013087466,0.00043153338,0.021453416,0.014621443,0.1389896],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920136,0.000196905,0.00012762196,0.00024322387,0.00016091928,0.00007006804],"domain_scores_gemma":[0.99669373,0.00083664333,0.00015272267,0.0013961693,0.00085492345,0.000065877415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527779,0.001040004,0.00079810683,0.0020271835,0.0009390595,0.0029753805,0.0011074581,0.000897103,0.06535399],"category_scores_gemma":[0.004344467,0.00071476505,0.0008475726,0.0027417436,0.0005311797,0.003745077,0.0018186026,0.0010404167,0.036297034],"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.0011190956,0.00023929689,0.0010476218,0.00067562255,0.0001170099,0.0010721495,0.0011973007,0.004856297,0.0316822,0.048459522,0.17242381,0.73711],"study_design_scores_gemma":[0.00032037412,0.0004264034,0.0015880056,0.0002555739,0.00045882852,0.0013407484,0.0012327346,0.08428544,0.13820142,0.06140011,0.7103065,0.00018388942],"about_ca_topic_score_codex":0.0018536751,"about_ca_topic_score_gemma":0.0015030669,"teacher_disagreement_score":0.06535399,"about_ca_system_score_codex":0.00045638072,"about_ca_system_score_gemma":0.000988693,"threshold_uncertainty_score":0.21863085},"labels":[],"label_agreement":null},{"id":"W1569329269","doi":"10.1007/3-540-44704-0_17","title":"QF2D: A Different Way to Measure Software Quality","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Université du Québec à Montréal","funders":"","keywords":"Quality function deployment; Computer science; Dimension (graph theory); Software quality; Context (archaeology); Quality (philosophy); Viewpoints; Benchmarking; Software engineering; Software; Software development; New product development; Mathematics; Programming language","score_opus":0.039982336861006204,"score_gpt":0.2895074407310006,"score_spread":0.24952510386999438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569329269","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.044227403,0.0012149842,0.9180805,0.001045111,0.0006512695,0.00023166763,0.0043781414,0.006690844,0.02347995],"genre_scores_gemma":[0.3855243,0.00058544363,0.5864264,0.0009111981,0.00021598284,0.0006415,0.0036923292,0.0016642767,0.020338576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904861,0.0016057706,0.00061131077,0.00096692884,0.0059268153,0.00040315912],"domain_scores_gemma":[0.9852937,0.0069633787,0.0011623248,0.0021147605,0.0040428806,0.000422967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042021223,0.0011827535,0.00094401446,0.007986007,0.0005723136,0.0034615132,0.0014481554,0.0019329387,0.008181244],"category_scores_gemma":[0.024741758,0.00038367382,0.0010475856,0.005702408,0.0010042536,0.0052526486,0.0018140898,0.0014567717,0.002261894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043571298,0.0002918608,0.049343567,0.0010205064,0.00037889514,0.00012673522,0.00096926786,0.00928229,0.015250974,0.050521765,0.04148763,0.83089083],"study_design_scores_gemma":[0.00035975312,0.0018691479,0.11909786,0.0007321214,0.00059155794,0.0023240978,0.0013414907,0.29150862,0.1347923,0.16131933,0.28514573,0.0009180473],"about_ca_topic_score_codex":0.003385189,"about_ca_topic_score_gemma":0.004076825,"teacher_disagreement_score":0.008181244,"about_ca_system_score_codex":0.0013354174,"about_ca_system_score_gemma":0.0007423472,"threshold_uncertainty_score":0.027368963},"labels":[],"label_agreement":null},{"id":"W1569343159","doi":"10.1007/3-540-45554-x_9","title":"Interpreting Fuzzy Membership Functions in the Theory of Rough Sets","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":28,"is_retracted":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":"Rough set; Fuzzy set; Salient; Membership function; Computer science; Fuzzy logic; Interpretation (philosophy); Partition (number theory); Type-2 fuzzy sets and systems; Mathematics; Feature (linguistics); Defuzzification; Artificial intelligence; Set theory; Fuzzy number; Set (abstract data type); Data mining; Combinatorics","score_opus":0.028365371544062334,"score_gpt":0.2523536145240872,"score_spread":0.2239882429800249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569343159","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.009847424,0.009626426,0.95097,0.0020066563,0.0007165326,0.00006248918,0.00012488847,0.000239977,0.026405528],"genre_scores_gemma":[0.35580504,0.009785878,0.6208312,0.0006292129,0.0015152914,0.00029135935,0.00036553518,0.0001879425,0.010588496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584275,0.0021199235,0.00031584644,0.0002920904,0.001219781,0.00020953824],"domain_scores_gemma":[0.99659425,0.0022017476,0.00023157545,0.0005080814,0.00036295122,0.00010139713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065150135,0.0016280472,0.0022070874,0.0039359624,0.0015868421,0.009039117,0.0025077346,0.0022880253,0.0027682513],"category_scores_gemma":[0.01161814,0.001373197,0.0024986106,0.003930976,0.006116627,0.011448623,0.0028261032,0.004435001,0.0010711934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018659823,0.000013242968,0.000056158467,0.00010002845,0.000026555297,0.00008171859,0.000657798,0.0064374213,0.00042246937,0.9763642,0.0009539926,0.014867697],"study_design_scores_gemma":[0.000006151024,0.000010805116,0.000046560224,0.00003833923,0.000012740018,0.00004221371,0.00011116063,0.011312058,0.00017699887,0.9840374,0.0041913292,0.000014201284],"about_ca_topic_score_codex":0.0015770909,"about_ca_topic_score_gemma":0.0011659857,"teacher_disagreement_score":0.009039117,"about_ca_system_score_codex":0.0018358583,"about_ca_system_score_gemma":0.00095623283,"threshold_uncertainty_score":0.03445506},"labels":[],"label_agreement":null},{"id":"W1569388719","doi":"10.1007/978-3-540-88643-3_1","title":"Design Space of Heterogeneous Synchronization","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Synchronization (alternating current); Artifact (error); Cardinality (data modeling); Consistency (knowledge bases); Set (abstract data type); Representation (politics); Distributed computing; Theoretical computer science; Programming language; Data mining; Artificial intelligence","score_opus":0.014079498993797382,"score_gpt":0.21956015564295012,"score_spread":0.20548065664915274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569388719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03239012,0.0004747797,0.9288103,0.0005254633,0.000071838214,0.00008303811,0.00007217291,0.00074350386,0.036828727],"genre_scores_gemma":[0.7295823,0.0006599154,0.24039121,0.00021574587,0.000089330104,0.00039216978,0.00036102973,0.00044228864,0.027866043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987734,0.0004917911,0.00008380297,0.0002037921,0.00030467848,0.00014255501],"domain_scores_gemma":[0.99893576,0.00041758252,0.00008353227,0.00031971303,0.0001642482,0.000079296646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019081887,0.0005760866,0.00049245945,0.0006273343,0.0011550918,0.0036880684,0.0010387419,0.00094784395,0.011913422],"category_scores_gemma":[0.002739304,0.0007332143,0.0006977328,0.000778666,0.0015831225,0.0031427417,0.00216447,0.0012091041,0.0014416663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088096094,0.00003081392,0.00027070296,0.0000656834,0.000022221013,0.00011745088,0.00028623472,0.024237804,0.0030004834,0.9390276,0.0011482,0.03170473],"study_design_scores_gemma":[0.000096330696,0.00012266812,0.00022960211,0.000072221614,0.00008795368,0.00015296345,0.00021019761,0.23126677,0.007642227,0.72383803,0.036252394,0.000028662233],"about_ca_topic_score_codex":0.0009338867,"about_ca_topic_score_gemma":0.00087890035,"teacher_disagreement_score":0.011913422,"about_ca_system_score_codex":0.0008677577,"about_ca_system_score_gemma":0.0010831882,"threshold_uncertainty_score":0.039854348},"labels":[],"label_agreement":null},{"id":"W1569422795","doi":"10.1007/3-540-45439-x_10","title":"An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crosslight Software (Canada)","funders":"","keywords":"Computer science; Obfuscation; Control flow; Theoretical computer science; Property (philosophy); Programming language; Bounded function; Program analysis; Turing; Key (lock); Software; Algorithm; Mathematics; Operating system; Computer security","score_opus":0.01826524549787394,"score_gpt":0.258011945190141,"score_spread":0.23974669969226703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569422795","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.006173978,0.00080146006,0.9844008,0.000339205,0.000111280926,0.000065101405,0.000029312565,0.00082700327,0.0072518005],"genre_scores_gemma":[0.19729248,0.0030713766,0.7788412,0.00047769028,0.0003838038,0.00022398759,0.00015838961,0.0004663392,0.019084757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896336,0.00020246925,0.0000653222,0.00018790568,0.00047134224,0.00010958205],"domain_scores_gemma":[0.9980584,0.0010077646,0.000095005234,0.00066551584,0.00012495744,0.00004835508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097062637,0.0012554282,0.0008521654,0.0015489868,0.0011290153,0.0017285172,0.0019844898,0.0016215036,0.0036996892],"category_scores_gemma":[0.002833738,0.00094377476,0.0020636604,0.0011951734,0.0034740055,0.00364616,0.0030624135,0.0038868557,0.000762158],"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.00018174296,0.00015115581,0.0004064015,0.00043602326,0.00008542698,0.0003008527,0.00070521305,0.033493355,0.022305293,0.6447686,0.005355,0.29181096],"study_design_scores_gemma":[0.000049317227,0.00011843467,0.0002762018,0.0001176267,0.00010868053,0.0005630993,0.00007428769,0.18717192,0.019357445,0.7652329,0.026882656,0.000047358306],"about_ca_topic_score_codex":0.0010794217,"about_ca_topic_score_gemma":0.001406341,"teacher_disagreement_score":0.0036996892,"about_ca_system_score_codex":0.0008748927,"about_ca_system_score_gemma":0.0009742452,"threshold_uncertainty_score":0.012376726},"labels":[],"label_agreement":null},{"id":"W1569436757","doi":"10.1007/3-540-44681-8_8","title":"Self-Organizing Hierarchical Cluster Timestamps","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Computer science; Scalability; Locality; Cluster (spacecraft); Data mining; Theoretical computer science; Distributed computing; Algorithm; Database; Real-time computing","score_opus":0.010887172364410783,"score_gpt":0.22895458117689022,"score_spread":0.21806740881247944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569436757","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.032096844,0.0008647135,0.9539472,0.00021861651,0.00033022612,0.00013873178,0.00036810408,0.0031476829,0.008887864],"genre_scores_gemma":[0.6075442,0.0009585157,0.37585548,0.00011424928,0.00031631635,0.00017871363,0.0011531684,0.00042194524,0.01345731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918014,0.00014123469,0.00007946656,0.00014938995,0.00036452516,0.00008530886],"domain_scores_gemma":[0.9961081,0.0007278843,0.00036333717,0.0016224427,0.0009233695,0.00025483343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012571537,0.0003485104,0.0006292408,0.0016625222,0.0009985104,0.0016261014,0.0017197267,0.000481593,0.0033079172],"category_scores_gemma":[0.005137135,0.00045702024,0.00023503003,0.0025329262,0.0005519768,0.0024735546,0.0016284775,0.0007823164,0.0011927714],"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.0010677977,0.00017837594,0.0033274726,0.0004021447,0.00008774677,0.00018701484,0.0006909082,0.1233843,0.03285426,0.21593206,0.01913047,0.60275745],"study_design_scores_gemma":[0.00014203029,0.000316185,0.0019775317,0.00008550998,0.00011097995,0.00044277057,0.00032365735,0.7539304,0.045099646,0.12234733,0.075121574,0.00010241419],"about_ca_topic_score_codex":0.00096624455,"about_ca_topic_score_gemma":0.0015108731,"teacher_disagreement_score":0.0033079172,"about_ca_system_score_codex":0.0007459945,"about_ca_system_score_gemma":0.001056926,"threshold_uncertainty_score":0.011066079},"labels":[],"label_agreement":null},{"id":"W1569513695","doi":"10.1007/978-3-540-24840-8_30","title":"Multi-attribute Decision Making in a Complex Multiagent Environment Using Reinforcement Learning with Selective Perception","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Université Laval","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Perception; Artificial intelligence; Machine learning; Human–computer interaction","score_opus":0.03624636363657711,"score_gpt":0.27589725601734344,"score_spread":0.23965089238076634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569513695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0777959,0.0001437408,0.91966414,0.00019932109,0.00003884814,0.00005764701,0.000016890408,0.00020762712,0.0018758917],"genre_scores_gemma":[0.8469521,0.00010523712,0.15151465,0.0000594824,0.000026223284,0.00011298298,0.000025861606,0.000028283968,0.0011751448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.00027417988,0.00004123724,0.00012702873,0.00015363253,0.00006380995],"domain_scores_gemma":[0.9971909,0.0020248457,0.00019912598,0.00016607369,0.0002442734,0.00017482492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019404561,0.0006290954,0.0010566018,0.00027831263,0.00047299554,0.0011181707,0.0012734678,0.00093716464,0.0014924564],"category_scores_gemma":[0.004299837,0.000471988,0.00067780144,0.00039629856,0.0010764658,0.001540647,0.0013533004,0.0015909184,0.00015611017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019661535,0.00020493622,0.0013210817,0.000071105394,0.00013115891,0.00014606252,0.00020399655,0.915617,0.0041968334,0.016084233,0.0006060134,0.061220873],"study_design_scores_gemma":[0.000012609304,0.000028384113,0.00010512259,0.0000031130903,0.000009525411,0.000011194345,0.00000823925,0.993067,0.00043862735,0.006236064,0.00007498507,0.000005133167],"about_ca_topic_score_codex":0.0027289274,"about_ca_topic_score_gemma":0.0025117944,"teacher_disagreement_score":0.0027289274,"about_ca_system_score_codex":0.0007486199,"about_ca_system_score_gemma":0.0007400093,"threshold_uncertainty_score":0.010262251},"labels":[],"label_agreement":null},{"id":"W1569514021","doi":"10.1007/978-3-642-13953-6_10","title":"Late Binding of AspectJ Advice","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"AspectJ; Computer science; Bytecode; Programming language; Compiler; Class (philosophy); Advice (programming); Compile time; Debugging; Rewriting; Implementation; Granularity; Interpreter; Operating system; Parallel computing; Virtual machine; Aspect-oriented programming; Software; Artificial intelligence","score_opus":0.025759206668290978,"score_gpt":0.2743680089093969,"score_spread":0.2486088022411059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569514021","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.023103701,0.0012983697,0.9092823,0.0006121792,0.00072296045,0.00010628487,0.00022421527,0.01711508,0.04753481],"genre_scores_gemma":[0.35491273,0.0017686717,0.46797547,0.001323718,0.00061890035,0.0001726997,0.0016734527,0.020934435,0.15062009],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975224,0.00041702332,0.00015564093,0.00031027792,0.001245871,0.0003487442],"domain_scores_gemma":[0.99547464,0.0015405047,0.00019507216,0.001860239,0.00078354205,0.00014598308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025369036,0.0009431855,0.0009929432,0.0011840499,0.0009380821,0.0026777505,0.0025016514,0.0016728672,0.009708807],"category_scores_gemma":[0.00917285,0.0014180925,0.0010504423,0.0010875693,0.0010597944,0.0043588937,0.0024065892,0.0045053675,0.0052149454],"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.0005048471,0.0001630065,0.0017082413,0.00068645284,0.000083230334,0.00061990984,0.0019535427,0.004943474,0.06258259,0.34144512,0.033255998,0.5520536],"study_design_scores_gemma":[0.00010014101,0.00023660524,0.0021379692,0.0004230045,0.00034782165,0.0018059926,0.0002786405,0.08560288,0.14241037,0.3121039,0.4543965,0.00015626515],"about_ca_topic_score_codex":0.0012945234,"about_ca_topic_score_gemma":0.0025075066,"teacher_disagreement_score":0.009708807,"about_ca_system_score_codex":0.00090536196,"about_ca_system_score_gemma":0.0012459115,"threshold_uncertainty_score":0.032479167},"labels":[],"label_agreement":null},{"id":"W1569526680","doi":"10.1007/978-3-540-30115-8_27","title":"An Efficient Method to Estimate Labelled Sample Size for Transductive LDA(QDA/MDA) Based on Bayes Risk","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Artificial intelligence; Machine learning; Gaussian; Linear discriminant analysis; Bayes' theorem; Supervised learning; Bayesian probability; Sample size determination; Semi-supervised learning; Pattern recognition (psychology); Sample (material); Mathematics; Statistics; Artificial neural network","score_opus":0.017771599480654515,"score_gpt":0.3131416018898215,"score_spread":0.295370002409167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569526680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014255382,0.000090894006,0.9977702,0.000042388525,0.000030026218,0.000051819585,0.000026883134,0.0004268726,0.00013542715],"genre_scores_gemma":[0.051827088,0.00012356846,0.94606364,0.000096302596,0.00010049781,0.00045062852,0.00025442406,0.00027188653,0.0008120036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933078,0.0031248122,0.00043124772,0.0010650433,0.0018673607,0.00020372157],"domain_scores_gemma":[0.9828388,0.011601579,0.00050347956,0.001975585,0.0028183316,0.00026220776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009699789,0.0013646251,0.0031492559,0.0020878888,0.0014223116,0.0022190022,0.002849228,0.002109974,0.0037515874],"category_scores_gemma":[0.036501102,0.0011975185,0.0017287312,0.0012005521,0.0013207746,0.0036606397,0.003175874,0.003817026,0.001901064],"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.00040333832,0.00027280176,0.0028117343,0.0003075149,0.00027671934,0.000084195264,0.00035475736,0.11063493,0.016725898,0.04214327,0.006920399,0.8190645],"study_design_scores_gemma":[0.000040422106,0.00006653009,0.00073594577,0.000034195295,0.000049570946,0.00010886899,0.000029723582,0.95232934,0.004105156,0.040460672,0.001991976,0.00004770443],"about_ca_topic_score_codex":0.002569643,"about_ca_topic_score_gemma":0.004214403,"teacher_disagreement_score":0.009699789,"about_ca_system_score_codex":0.001637299,"about_ca_system_score_gemma":0.0021816378,"threshold_uncertainty_score":0.051298022},"labels":[],"label_agreement":null},{"id":"W1569529439","doi":"10.1007/978-3-540-39923-0_11","title":"MAGS Project: Multi-agent GeoSimulation and Crowd Simulation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Crowd simulation; Human–computer interaction; Geographic information system; Perception; Software; Cognitive map; Software agent; Software engineering; Cognition; Artificial intelligence; Cartography; Crowds; Geography; Computer security","score_opus":0.022350316792264326,"score_gpt":0.2638252062989984,"score_spread":0.2414748895067341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569529439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009573391,0.0010666184,0.9648487,0.00053163164,0.00056515366,0.00011126094,0.0007391396,0.0071880147,0.015376115],"genre_scores_gemma":[0.20971645,0.002142521,0.7468584,0.00025702713,0.0003896589,0.0006900782,0.003437539,0.0033107393,0.033197526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999683,0.00010821649,0.000011165436,0.000050909435,0.00012347226,0.000023213735],"domain_scores_gemma":[0.9995578,0.00017020796,0.000014967113,0.0000845594,0.000111600304,0.000060714297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009346558,0.0010101632,0.0011137823,0.000512927,0.00037138566,0.000841914,0.0018211016,0.0012456635,0.0072757816],"category_scores_gemma":[0.0015675842,0.0005413409,0.0006161289,0.00070975395,0.0005009438,0.0013429513,0.0016168685,0.0010860137,0.002280875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026421528,0.00018586763,0.0005547057,0.0003093898,0.00014717031,0.00012600492,0.00023033774,0.6300112,0.0064763743,0.0717982,0.06291486,0.22698164],"study_design_scores_gemma":[0.00006519018,0.000028286298,0.000120303055,0.000016847614,0.000015113876,0.000032501954,0.00001271356,0.94041085,0.0033726045,0.022045754,0.03386818,0.000011663504],"about_ca_topic_score_codex":0.002968,"about_ca_topic_score_gemma":0.0016919007,"teacher_disagreement_score":0.0072757816,"about_ca_system_score_codex":0.00042319013,"about_ca_system_score_gemma":0.0006632519,"threshold_uncertainty_score":0.024339914},"labels":[],"label_agreement":null},{"id":"W1569559301","doi":"10.1007/978-3-540-27819-1_46","title":"The Budgeted Multi-armed Bandit Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":44,"is_retracted":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":"Computer science; Abstraction; Set (abstract data type); Mathematical optimization; Multi-armed bandit; Artificial intelligence; Operations research; Machine learning; Mathematics; Programming language","score_opus":0.07238701070652422,"score_gpt":0.3767942946054017,"score_spread":0.3044072838988775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569559301","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.029044507,0.003939719,0.928767,0.004748536,0.00054131524,0.00017321821,0.0009256622,0.00031321944,0.03154671],"genre_scores_gemma":[0.7191,0.006860525,0.20503126,0.0012880898,0.0014568031,0.0010246874,0.001541207,0.000396917,0.06330045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996908,0.0017719248,0.00011573468,0.0005320534,0.00032051542,0.0003517242],"domain_scores_gemma":[0.9905612,0.007725172,0.00054967415,0.0004374557,0.00036562904,0.0003609378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047004423,0.0017155218,0.003939035,0.0009772601,0.0010247281,0.0053033913,0.0029902502,0.005443001,0.011820064],"category_scores_gemma":[0.019613141,0.0014698985,0.0009585078,0.0025157328,0.0025216173,0.005158297,0.0024157856,0.004058734,0.0019129051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066790165,0.00017786547,0.0007590573,0.00047935962,0.00017412174,0.00019995673,0.00012298195,0.5955771,0.0005989898,0.3205072,0.020642402,0.060093008],"study_design_scores_gemma":[0.00012966919,0.00006778799,0.00019707845,0.00007036195,0.00003851188,0.00006783429,0.000045652672,0.68704903,0.00021008281,0.30786273,0.0042301705,0.000031153802],"about_ca_topic_score_codex":0.0025620281,"about_ca_topic_score_gemma":0.0017700638,"teacher_disagreement_score":0.011820064,"about_ca_system_score_codex":0.0018399417,"about_ca_system_score_gemma":0.0017862243,"threshold_uncertainty_score":0.03954208},"labels":[],"label_agreement":null},{"id":"W1569585172","doi":"10.1007/978-3-642-12200-2_3","title":"The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rectangle; Hypercube; Square (algebra); Plane (geometry); Time complexity; Combinatorics; Volume (thermodynamics); Set (abstract data type); Computer science; Mathematics; Discrete mathematics; Algorithm; Geometry; Physics","score_opus":0.018634980358884442,"score_gpt":0.2455453835371479,"score_spread":0.22691040317826344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569585172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05956268,0.014001576,0.7739555,0.003917886,0.0020112512,0.00010753856,0.0005019674,0.00036134842,0.14558022],"genre_scores_gemma":[0.29473615,0.008788959,0.5832585,0.0011563869,0.002125533,0.00033391413,0.00089236017,0.00065100665,0.108057104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992022,0.00026050198,0.000041701227,0.00020251147,0.00020625256,0.00008683776],"domain_scores_gemma":[0.9987889,0.00073629734,0.000086183936,0.00019143878,0.00010689422,0.00009024956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010035884,0.0010758677,0.0015664188,0.0007688935,0.0010888873,0.0019838307,0.0020003095,0.0019088901,0.009477441],"category_scores_gemma":[0.003887219,0.00079946476,0.00093011174,0.0016286738,0.002489198,0.0043515367,0.0023136826,0.0030650366,0.0014168418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014034401,0.000063535634,0.00021724224,0.00044110423,0.00003432659,0.00010775912,0.00020198208,0.035654005,0.0010099928,0.82698107,0.031194372,0.103954315],"study_design_scores_gemma":[0.000036672864,0.000032230382,0.00021748613,0.00006222412,0.000014425774,0.00019216984,0.00014708271,0.07314105,0.0005776149,0.9038081,0.02174561,0.0000252847],"about_ca_topic_score_codex":0.0012899842,"about_ca_topic_score_gemma":0.0015497104,"teacher_disagreement_score":0.009477441,"about_ca_system_score_codex":0.00046807659,"about_ca_system_score_gemma":0.0007190038,"threshold_uncertainty_score":0.0317052},"labels":[],"label_agreement":null},{"id":"W1569594456","doi":"10.1007/978-3-540-79232-1_6","title":"Evaluation of VoIP Quality over WiBro","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"","keywords":"WiBro; Voice over IP; Computer network; Computer science; Quality of service; Telecommunications link; Handover; Throughput; Mobile telephony; Telecommunications; Mobile radio; Wireless network; Wireless; The Internet","score_opus":0.031315511870130666,"score_gpt":0.2827215142987769,"score_spread":0.25140600242864625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569594456","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.93034416,0.0015007404,0.056051664,0.00012867565,0.00007804676,0.000101281956,0.00037783317,0.0007858208,0.010631699],"genre_scores_gemma":[0.99303997,0.00020438948,0.005012744,0.000019459683,0.000023831271,0.000009789974,0.0002006914,0.000033761928,0.001455369],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988532,0.0002842473,0.000047731184,0.00013817403,0.0005418789,0.00013468855],"domain_scores_gemma":[0.9977952,0.0011680055,0.00016045135,0.00015703028,0.00062412466,0.000095243595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015515574,0.00044092853,0.0004711658,0.0006138354,0.00026453403,0.00078642915,0.00048335694,0.00073603215,0.0021746163],"category_scores_gemma":[0.004990036,0.0001794171,0.0001738696,0.0005766016,0.0003315946,0.0007402146,0.00048623662,0.0003913034,0.00033083203],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010858144,0.0008901639,0.047282606,0.00053730025,0.00036774334,0.0006740419,0.00032102747,0.156622,0.32239544,0.0029260805,0.0018252534,0.4553002],"study_design_scores_gemma":[0.00017874807,0.005396672,0.085597396,0.00007750328,0.00032318852,0.0010405348,0.00031638876,0.74356276,0.1597265,0.0017709972,0.0019027261,0.00010664418],"about_ca_topic_score_codex":0.0022846046,"about_ca_topic_score_gemma":0.001931392,"teacher_disagreement_score":0.0022846046,"about_ca_system_score_codex":0.00045028402,"about_ca_system_score_gemma":0.0001766097,"threshold_uncertainty_score":0.008205473},"labels":[],"label_agreement":null},{"id":"W1569632079","doi":"10.1007/11801412_18","title":"Panel: Authentication in Constrained Environments","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security 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":"Carleton University","funders":"","keywords":"Computer science; Authentication (law); Computer security","score_opus":0.020137053328696124,"score_gpt":0.23173751978860718,"score_spread":0.21160046645991107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569632079","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044593117,0.04573366,0.048611093,0.13802838,0.13392879,0.0019685344,0.004800633,0.0033925078,0.619077],"genre_scores_gemma":[0.00972602,0.014270345,0.0037168008,0.008939693,0.01795075,0.00042344764,0.0024497095,0.00041972264,0.94210345],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993875,0.00007562355,0.000031159037,0.00013009332,0.0002555193,0.0001199426],"domain_scores_gemma":[0.9977563,0.00044707925,0.00006689999,0.00012288784,0.0010327834,0.0005740901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847886,0.0015672282,0.0011446379,0.0012794634,0.0023143971,0.0025965343,0.0017030038,0.006874265,0.11625299],"category_scores_gemma":[0.0018586676,0.00062325434,0.0006744723,0.0017158673,0.00058798,0.00436788,0.001742054,0.0046075685,0.09722768],"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.00003592699,0.000036581474,0.00003697691,0.0001026127,0.0000025496286,0.000022866572,0.00003113394,0.00012486528,0.00047086918,0.0010824818,0.96338564,0.034667533],"study_design_scores_gemma":[0.00002374067,0.00008731942,0.0006340422,0.0002744725,0.000011817535,0.00007739017,0.000103559585,0.00046757696,0.0011008464,0.0029950235,0.9942054,0.000018821132],"about_ca_topic_score_codex":0.002369388,"about_ca_topic_score_gemma":0.008218803,"teacher_disagreement_score":0.11625299,"about_ca_system_score_codex":0.0010420574,"about_ca_system_score_gemma":0.0016579499,"threshold_uncertainty_score":0.388905},"labels":[],"label_agreement":null},{"id":"W1569639046","doi":"10.1007/11538363_35","title":"A Propositional Proof System for Log Space","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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 Toronto","funders":"","keywords":"Soundness; Proof complexity; Mathematical proof; Mathematics; Bounded function; Space (punctuation); Discrete mathematics; Combinatorics; Polynomial; Computer science; Mathematical analysis","score_opus":0.018359863302965046,"score_gpt":0.24173375000794178,"score_spread":0.22337388670497674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569639046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053255367,0.00054479355,0.9659286,0.0010932676,0.00031431697,0.00019729346,0.0012461145,0.011141953,0.01420811],"genre_scores_gemma":[0.18867911,0.0009886904,0.77520037,0.0011050316,0.00042764633,0.00046494405,0.0027700241,0.0022784434,0.028085802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990539,0.00026065792,0.00010260711,0.0001708209,0.00030622075,0.00010576128],"domain_scores_gemma":[0.99812466,0.0011292552,0.00007231703,0.00032872535,0.00024676105,0.000098200544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015182644,0.0006956921,0.0008493654,0.0014880338,0.0015335389,0.004150083,0.0018263184,0.0011976075,0.022550521],"category_scores_gemma":[0.0034385566,0.0011367936,0.0012500297,0.0013423753,0.0015879408,0.0061088772,0.0039617037,0.0036065266,0.005953027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018653208,0.00015489898,0.0003940076,0.00046916213,0.000051335668,0.00030197846,0.00065402535,0.0052590594,0.0071070394,0.7609545,0.039821304,0.1846461],"study_design_scores_gemma":[0.00019456439,0.00006740016,0.00024227927,0.0001318607,0.00008815117,0.00034755413,0.00012000306,0.041611962,0.008247674,0.84760433,0.101276234,0.000067881316],"about_ca_topic_score_codex":0.001247874,"about_ca_topic_score_gemma":0.0018687353,"teacher_disagreement_score":0.022550521,"about_ca_system_score_codex":0.0013797494,"about_ca_system_score_gemma":0.001997189,"threshold_uncertainty_score":0.075439036},"labels":[],"label_agreement":null},{"id":"W1569660209","doi":"10.1007/11867586_46","title":"Fractal Image Coding as Projections Onto Convex Sets","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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 Waterloo","funders":"","keywords":"Fractal; Regular polygon; Computer science; Fractal transform; Decoding methods; Image (mathematics); Coding (social sciences); Fractal compression; Algorithm; Fractal analysis; Image processing; Artificial intelligence; Computer vision; Theoretical computer science; Mathematics; Image compression; Fractal dimension; Geometry; Mathematical analysis","score_opus":0.027543450344209106,"score_gpt":0.3030167432837639,"score_spread":0.27547329293955475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569660209","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.09302561,0.0024932923,0.8173695,0.00066402945,0.00032592725,0.00006802907,0.00023047763,0.00046058372,0.08536266],"genre_scores_gemma":[0.76901746,0.0050138626,0.18498695,0.0002528593,0.00053770014,0.00013754841,0.00032861522,0.00042850312,0.03929654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974114,0.000051297222,0.000010561155,0.00003568366,0.00013645395,0.000024758589],"domain_scores_gemma":[0.9992774,0.00036996522,0.000066511384,0.00009438437,0.00014056028,0.000051254654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027773954,0.0005432229,0.00047331283,0.0012374888,0.000279339,0.0017826927,0.00043092333,0.00049515656,0.0036155377],"category_scores_gemma":[0.0016189627,0.00036899783,0.00045698037,0.00092143443,0.001196685,0.0017745425,0.0009162491,0.0014170673,0.0005700915],"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.000024058247,0.000007588789,0.000043158478,0.000052150444,0.0000062811714,0.00005595598,0.00009303909,0.010198407,0.0053668404,0.9510351,0.0014578947,0.031659365],"study_design_scores_gemma":[0.000012261815,0.000048019123,0.00021606762,0.000029957864,0.000008672626,0.00037327158,0.00004114342,0.14726613,0.0054741018,0.83741826,0.009089035,0.000023104407],"about_ca_topic_score_codex":0.00030946542,"about_ca_topic_score_gemma":0.00018588586,"teacher_disagreement_score":0.0036155377,"about_ca_system_score_codex":0.00046018217,"about_ca_system_score_gemma":0.00024175202,"threshold_uncertainty_score":0.012095153},"labels":[],"label_agreement":null},{"id":"W1569729202","doi":"10.1007/3-540-45571-x_47","title":"Mining Access Patterns Efficiently from Web Logs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":498,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Web mining; Data mining; Web mapping; Tree (set theory); Web modeling; World Wide Web; Information retrieval; Web service","score_opus":0.023285159835867267,"score_gpt":0.26845831841934226,"score_spread":0.245173158583475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569729202","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.35423136,0.0023034785,0.6025456,0.0011093827,0.00015475306,0.0006563626,0.012211707,0.022411613,0.004375703],"genre_scores_gemma":[0.5739632,0.0013723872,0.39532092,0.00017641345,0.00024415774,0.0003279865,0.021286568,0.0004650252,0.0068433955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894303,0.00009156775,0.00013485967,0.00021436648,0.00050143537,0.000114733346],"domain_scores_gemma":[0.9969393,0.0015960383,0.0003211331,0.000519199,0.00049630605,0.0001280244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053517445,0.0010539949,0.0015903723,0.0048647067,0.0006777162,0.002148615,0.0012235495,0.00080373086,0.0014783294],"category_scores_gemma":[0.0047109136,0.00067491375,0.0011038902,0.0054544695,0.00031793254,0.0038288645,0.0009420459,0.0010602787,0.0020803309],"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.00046885284,0.00073716673,0.044472534,0.0005716355,0.00022969923,0.0007373516,0.00034058752,0.017854584,0.033914175,0.0037422427,0.018934103,0.8779971],"study_design_scores_gemma":[0.00011336037,0.00025643743,0.016046304,0.000093706,0.0002887953,0.0023093526,0.0007513207,0.8928275,0.029174807,0.044102855,0.013976589,0.00005894445],"about_ca_topic_score_codex":0.004068955,"about_ca_topic_score_gemma":0.010935389,"teacher_disagreement_score":0.0048647067,"about_ca_system_score_codex":0.00039899166,"about_ca_system_score_gemma":0.0013077292,"threshold_uncertainty_score":0.008090496},"labels":[],"label_agreement":null},{"id":"W1569763258","doi":"10.1007/3-540-45841-7_24","title":"Improved Quantum Communication Complexity Bounds for Disjointness and Equality","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Bounded function; Communication complexity; Protocol (science); Omega; Discrete mathematics; Class (philosophy); Combinatorics; Qubit; Binary logarithm; Quantum; Mathematics; Computer science; Physics; Quantum mechanics","score_opus":0.039517654476778234,"score_gpt":0.27676003651978087,"score_spread":0.23724238204300263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569763258","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.042493694,0.008434429,0.7627477,0.01113977,0.0024296897,0.0003156689,0.0012701818,0.0017884767,0.16938035],"genre_scores_gemma":[0.6444231,0.008195275,0.26507494,0.004784191,0.0061992356,0.0017220139,0.0017447103,0.0027594625,0.065097034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876211,0.002421195,0.0004487108,0.0021168955,0.005348928,0.0020432635],"domain_scores_gemma":[0.94705576,0.040070247,0.0011936352,0.0073958035,0.0028123274,0.0014722752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008347272,0.0035561826,0.0049225525,0.0054909172,0.0049497304,0.00838634,0.010302907,0.004804474,0.03565061],"category_scores_gemma":[0.04000022,0.0024774333,0.0044450783,0.008225522,0.010512631,0.035178784,0.017886687,0.023062203,0.005480018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028590366,0.00011803067,0.00021179028,0.00024156319,0.00004350305,0.000049672562,0.0002962518,0.013042125,0.0017637152,0.9474307,0.009771682,0.026745101],"study_design_scores_gemma":[0.00003572345,0.000027012657,0.00019992626,0.00006575626,0.000052887957,0.00005281558,0.00005383545,0.0388573,0.0017973591,0.9532299,0.0055771023,0.000050300274],"about_ca_topic_score_codex":0.0025962824,"about_ca_topic_score_gemma":0.0033565369,"teacher_disagreement_score":0.03565061,"about_ca_system_score_codex":0.009109612,"about_ca_system_score_gemma":0.0037750725,"threshold_uncertainty_score":0.11926317},"labels":[],"label_agreement":null},{"id":"W1569787238","doi":"10.1007/11919476_22","title":"Iterative Estimation of 3D Transformations for Object Alignment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Iterative method; Iterative closest point; Rotation (mathematics); Transformation (genetics); Algorithm; Noise (video); Matrix (chemical analysis); Object (grammar); Polynomial; Time complexity; Point (geometry); Transformation matrix; Feature (linguistics); Heuristic; Artificial intelligence; Point cloud; Mathematics; Image (mathematics)","score_opus":0.010024982320507622,"score_gpt":0.2216947983696086,"score_spread":0.21166981604910096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569787238","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.00074138056,0.00010458562,0.99818015,0.0000146149605,0.0000132686255,0.000010502183,0.00002472144,0.0005603783,0.00035048687],"genre_scores_gemma":[0.031361766,0.0003161633,0.9655403,0.000038797858,0.000021795426,0.00007422225,0.0003704157,0.00031854786,0.0019580927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868506,0.00024141236,0.000076099284,0.00026939507,0.0006301273,0.000097952536],"domain_scores_gemma":[0.9987569,0.0003502465,0.00009149361,0.00038479987,0.00037978948,0.000036812773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008186709,0.0012859453,0.0013786587,0.001597669,0.0006096253,0.0014857796,0.0020662881,0.0013816461,0.0063686315],"category_scores_gemma":[0.0040135668,0.0011354522,0.0014909308,0.00263848,0.00066632597,0.0018457156,0.0025291508,0.0016985687,0.0049135545],"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.000134701,0.000067227775,0.00043484336,0.0001715934,0.00012536993,0.000059896298,0.0001556007,0.05921404,0.0432291,0.0117492005,0.005915675,0.8787427],"study_design_scores_gemma":[0.000032115673,0.000088003624,0.0010433407,0.00004571881,0.000062045714,0.0002783846,0.00006905995,0.9099048,0.052075647,0.02008735,0.016261695,0.00005194566],"about_ca_topic_score_codex":0.0045654485,"about_ca_topic_score_gemma":0.008150267,"teacher_disagreement_score":0.0063686315,"about_ca_system_score_codex":0.00059959386,"about_ca_system_score_gemma":0.001447335,"threshold_uncertainty_score":0.021305203},"labels":[],"label_agreement":null},{"id":"W1569796140","doi":"10.1007/978-3-642-00672-2_18","title":"Rank Aggregation to Combine QoS in Web Search","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ranking (information retrieval); Rank (graph theory); Information retrieval; Quality (philosophy); Process (computing); Learning to rank; Web page; Data mining; World Wide Web; Mathematics; Programming language","score_opus":0.018621470445311105,"score_gpt":0.2562007237998797,"score_spread":0.2375792533545686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569796140","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.05868839,0.0048687984,0.9246965,0.00056925253,0.00053498975,0.00014500435,0.0005758056,0.0039288616,0.005992261],"genre_scores_gemma":[0.6798478,0.0011709682,0.31019202,0.00017010032,0.00085413625,0.00010351007,0.00069355965,0.00030908413,0.0066588074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756193,0.0007249396,0.00016087145,0.00020597367,0.001078736,0.00026758813],"domain_scores_gemma":[0.99581957,0.0020577803,0.00026952612,0.0007302874,0.0009234137,0.00019939279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030911388,0.000837506,0.0018352895,0.0025279159,0.000732457,0.0020021468,0.0011527714,0.00072493806,0.002959332],"category_scores_gemma":[0.008957732,0.00037545292,0.0005931629,0.0043984856,0.0004288408,0.0029224535,0.0010449318,0.0011756982,0.0009963566],"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.00068892544,0.00036139978,0.0037580119,0.00030253414,0.00019927809,0.00009988294,0.00021531199,0.1402035,0.010281801,0.024595983,0.016285617,0.8030078],"study_design_scores_gemma":[0.000047448564,0.00018909019,0.0014727372,0.000025377025,0.000100493926,0.00012091839,0.000067723195,0.9592419,0.0052952464,0.0289612,0.0044321227,0.00004579488],"about_ca_topic_score_codex":0.003872136,"about_ca_topic_score_gemma":0.006893336,"teacher_disagreement_score":0.003872136,"about_ca_system_score_codex":0.0008777702,"about_ca_system_score_gemma":0.0008390097,"threshold_uncertainty_score":0.016347706},"labels":[],"label_agreement":null},{"id":"W1569851992","doi":"10.1007/978-3-540-73540-3_7","title":"Efficiently Mining Regional Outliers in Spatial Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Simon Fraser University","funders":"","keywords":"Outlier; Computer science; Data mining; Spatial analysis; Statistic; Cluster analysis; Object (grammar); Anomaly detection; Pattern recognition (psychology); Artificial intelligence; Mathematics; Statistics","score_opus":0.05377628463019086,"score_gpt":0.2965726735091381,"score_spread":0.24279638887894722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569851992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099902555,0.0006710763,0.8941203,0.00018783548,0.00008231185,0.00006610954,0.00063068455,0.0036427188,0.0006964587],"genre_scores_gemma":[0.43774152,0.00053383404,0.55479884,0.00005495329,0.000164428,0.00008436418,0.0039239763,0.00044040452,0.0022577103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987779,0.00011702871,0.000117984484,0.0002626189,0.0005826767,0.00014176201],"domain_scores_gemma":[0.99768627,0.0009336562,0.00037708983,0.0003735253,0.000541363,0.000087988745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010675474,0.0011605014,0.0019894312,0.002862326,0.0005907859,0.0017573937,0.00243974,0.0010723098,0.0009547445],"category_scores_gemma":[0.0044479193,0.0006232867,0.0012860603,0.004072537,0.00057386706,0.0017527296,0.0017679527,0.0011895201,0.0009821487],"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.0006658121,0.0002666663,0.026946839,0.0003484744,0.00029783518,0.00080423633,0.00027899176,0.2361158,0.033665445,0.0065769916,0.00886354,0.6851694],"study_design_scores_gemma":[0.0000140197735,0.000061076054,0.0022787384,0.000010938351,0.000047152906,0.00034661355,0.00012399392,0.9787555,0.009472815,0.0066909804,0.0021845305,0.0000137289535],"about_ca_topic_score_codex":0.003790121,"about_ca_topic_score_gemma":0.0045818193,"teacher_disagreement_score":0.003790121,"about_ca_system_score_codex":0.00049684325,"about_ca_system_score_gemma":0.00084469107,"threshold_uncertainty_score":0.0075361133},"labels":[],"label_agreement":null},{"id":"W1569927945","doi":"10.1007/3-540-47922-8_27","title":"Extraction of Text Phrases Using Hierarchical Grammar","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bigram; Computer science; Artificial intelligence; Natural language processing; Classifier (UML); Grammar; Pattern recognition (psychology); Linguistics","score_opus":0.024417248599950623,"score_gpt":0.2858280265384344,"score_spread":0.2614107779384838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569927945","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.025974026,0.0020370889,0.90841603,0.0008763616,0.00044566474,0.0011771498,0.017737523,0.033564847,0.0097712455],"genre_scores_gemma":[0.07091778,0.0013862222,0.8714584,0.00026703114,0.00020835016,0.00055404083,0.044902302,0.0032573738,0.0070484327],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914324,0.00015399726,0.0001610363,0.00021246434,0.00024062717,0.00008859501],"domain_scores_gemma":[0.9980428,0.0009505818,0.00016736238,0.00019101758,0.00057713845,0.00007102809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006835,0.0019638399,0.0019687917,0.005692181,0.0011675623,0.0019961055,0.0015680119,0.0011807582,0.01347843],"category_scores_gemma":[0.002752107,0.001216037,0.002478295,0.0061626486,0.00072888524,0.002916102,0.001926158,0.0016319164,0.014383343],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003043038,0.00014326176,0.0019940855,0.0026693866,0.0001910256,0.0022083274,0.0010863452,0.0042436775,0.096540764,0.018170532,0.061929226,0.81051904],"study_design_scores_gemma":[0.00049030344,0.0007434549,0.01091171,0.001288452,0.0015348726,0.005137413,0.003101804,0.22647637,0.24688414,0.14763492,0.35541022,0.00038638338],"about_ca_topic_score_codex":0.0025464334,"about_ca_topic_score_gemma":0.003642737,"teacher_disagreement_score":0.01347843,"about_ca_system_score_codex":0.00065691414,"about_ca_system_score_gemma":0.0022345018,"threshold_uncertainty_score":0.04508984},"labels":[],"label_agreement":null},{"id":"W1570018751","doi":"10.1007/3-540-47922-8_13","title":"Mining Incremental Association Rules with Generalized FP-Tree","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Association rule learning; Computer science; Database transaction; Apriori algorithm; Data mining; Tree (set theory); Database; A priori and a posteriori; Algorithm; Mathematics","score_opus":0.018521937659330405,"score_gpt":0.23551222168731673,"score_spread":0.2169902840279863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570018751","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.080237,0.0033592107,0.9057315,0.00042953235,0.0002483047,0.0005116306,0.0026574659,0.004654859,0.002170417],"genre_scores_gemma":[0.1682047,0.0010085397,0.822373,0.00019602964,0.00013373044,0.00026925583,0.0065241125,0.00014593438,0.0011447931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979054,0.00037795922,0.00029877503,0.0004887659,0.00079390506,0.00013510954],"domain_scores_gemma":[0.9928906,0.0046972847,0.0003197286,0.00090593356,0.0010518087,0.0001347831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023845455,0.0012472479,0.002216315,0.005078129,0.0008273587,0.001739818,0.0028020325,0.0012929173,0.0017248433],"category_scores_gemma":[0.010843675,0.0009354869,0.0021222217,0.0050626732,0.00060192513,0.0034577865,0.0013512411,0.0016118484,0.0010389022],"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.0006097951,0.00035636258,0.010250087,0.0008176311,0.0005892541,0.0021616041,0.00020256538,0.049579423,0.005977791,0.005628843,0.0105402395,0.91328645],"study_design_scores_gemma":[0.00020517275,0.0004538116,0.003991761,0.00023855697,0.00094365317,0.0044521815,0.00020374621,0.89686364,0.008019477,0.07427053,0.010282841,0.00007458091],"about_ca_topic_score_codex":0.0021224713,"about_ca_topic_score_gemma":0.0034876044,"teacher_disagreement_score":0.005078129,"about_ca_system_score_codex":0.00034985377,"about_ca_system_score_gemma":0.0012568544,"threshold_uncertainty_score":0.012610793},"labels":[],"label_agreement":null},{"id":"W1570029409","doi":"10.1007/978-3-540-24653-4_55","title":"Evolutionary Bayesian Network Dynamic Planner for Game RISK","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Planner; Dynamic Bayesian network; Bayesian network; Variety (cybernetics); Artificial intelligence; Bayesian game; Sequential game; Machine learning; Game theory","score_opus":0.01424545189315369,"score_gpt":0.25754386432445603,"score_spread":0.24329841243130235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570029409","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.012458639,0.00021964825,0.96628433,0.0006242807,0.0000620296,0.00006932432,0.000072621966,0.00021007049,0.019999081],"genre_scores_gemma":[0.66954917,0.0005645758,0.29204583,0.00021375422,0.000109104825,0.0004581185,0.00017868234,0.00019330451,0.036687467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994,0.00024734958,0.000022587976,0.00009443808,0.0001575974,0.00007798119],"domain_scores_gemma":[0.9987864,0.0008833941,0.000067667796,0.000055739358,0.000114518385,0.000092327966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013339098,0.00086241384,0.0013494978,0.0008636235,0.0006045509,0.001297028,0.0019587267,0.0022410322,0.009325158],"category_scores_gemma":[0.005734557,0.0007363685,0.0006321589,0.00084354565,0.0010972363,0.002331587,0.0016220594,0.002230701,0.0006299282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004173743,0.000035895875,0.000093232724,0.000035318168,0.000016647187,0.000037471822,0.000042471947,0.8322691,0.00024455844,0.14923368,0.0016854354,0.016264515],"study_design_scores_gemma":[0.00001571139,0.000010697504,0.000024203628,0.000006533898,0.0000044629696,0.000010033507,0.0000057400725,0.9328605,0.000073544994,0.06630416,0.00067927706,0.000005198043],"about_ca_topic_score_codex":0.0057458347,"about_ca_topic_score_gemma":0.006257306,"teacher_disagreement_score":0.009325158,"about_ca_system_score_codex":0.0027252068,"about_ca_system_score_gemma":0.0019173741,"threshold_uncertainty_score":0.0311957},"labels":[],"label_agreement":null},{"id":"W1570066695","doi":"10.1007/978-3-540-72788-0_18","title":"Formalizing Dangerous SAT Encodings","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Computer science; Programming language","score_opus":0.04845076869967927,"score_gpt":0.30244246149739196,"score_spread":0.25399169279771266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570066695","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.03472856,0.00028059076,0.9026905,0.0013406896,0.000407071,0.00013454907,0.0005925554,0.004948628,0.054876763],"genre_scores_gemma":[0.6911499,0.0006333942,0.2751688,0.00063275546,0.00022173263,0.00024548013,0.0017356847,0.0026583835,0.027553886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973341,0.000786773,0.0001687914,0.00030213737,0.0009951767,0.00041301298],"domain_scores_gemma":[0.9938651,0.00413232,0.00022960256,0.0010494606,0.0005587071,0.0001647742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018055041,0.0011976201,0.0006985861,0.0017980823,0.0011656831,0.0033569564,0.002237393,0.0014353339,0.013883115],"category_scores_gemma":[0.011982226,0.0012149088,0.0017268164,0.0016120326,0.0035752316,0.0064774216,0.0052231005,0.0061250823,0.0025790047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050471073,0.000026366193,0.00015811375,0.000096969496,0.000011741969,0.00013218612,0.0003011072,0.012017757,0.0014650346,0.9658797,0.0023404686,0.017520169],"study_design_scores_gemma":[0.000018531506,0.000011430723,0.000048293638,0.00006194465,0.000022739276,0.000101124235,0.00008045706,0.047953077,0.0043775123,0.93788314,0.009425065,0.000016732929],"about_ca_topic_score_codex":0.0011478831,"about_ca_topic_score_gemma":0.0020488035,"teacher_disagreement_score":0.013883115,"about_ca_system_score_codex":0.0017891556,"about_ca_system_score_gemma":0.001262992,"threshold_uncertainty_score":0.04644364},"labels":[],"label_agreement":null},{"id":"W1570118157","doi":"10.1007/3-540-44685-0_30","title":"Efficient Multiple-Valued Model-Checking Using Lattice Representations","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Implementation; Computer science; Lattice (music); Model checking; Theoretical computer science; Reuse; Binary decision diagram; Distributive lattice; Representation (politics); Distributive property; Software implementation; Symbolic trajectory evaluation; Algorithm; Algebra over a field; Software; Mathematics; Programming language; Pure mathematics","score_opus":0.07621353515016023,"score_gpt":0.33717616008605045,"score_spread":0.26096262493589023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570118157","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.023084482,0.00012332946,0.97094125,0.0001825969,0.000057083143,0.00006352472,0.00013194776,0.003286254,0.0021295738],"genre_scores_gemma":[0.46435517,0.00012268072,0.53287727,0.000092738876,0.00003066673,0.00015927355,0.00030151784,0.0005461386,0.0015145993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935622,0.0023614522,0.00039117262,0.00072677137,0.0024173094,0.00054105645],"domain_scores_gemma":[0.98882246,0.0075636175,0.0005492087,0.0020369396,0.0008323213,0.00019546275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003489098,0.0011924976,0.002162281,0.0016136381,0.0010611027,0.004368853,0.003336555,0.0013090688,0.004760863],"category_scores_gemma":[0.0143233845,0.0013267783,0.0025054466,0.0017753036,0.0024152363,0.008095108,0.0034988238,0.0035546538,0.0008767312],"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.00105423,0.0003552783,0.0013143586,0.0006331331,0.00020789333,0.00045363753,0.00038653056,0.36973968,0.024887158,0.37437814,0.003912473,0.2226774],"study_design_scores_gemma":[0.000099130004,0.000048865513,0.000051907646,0.000045597033,0.0000369324,0.00006266562,0.000052966378,0.7773232,0.015398235,0.2056405,0.0012043101,0.00003574228],"about_ca_topic_score_codex":0.0019507702,"about_ca_topic_score_gemma":0.004894592,"teacher_disagreement_score":0.004760863,"about_ca_system_score_codex":0.0017169325,"about_ca_system_score_gemma":0.0021576684,"threshold_uncertainty_score":0.018452287},"labels":[],"label_agreement":null},{"id":"W1570135339","doi":"10.1007/3-540-44795-4_50","title":"Geometric Properties of Naive Bayes in Nominal Domains","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Naive Bayes classifier; Learnability; Bayesian programming; Artificial intelligence; Bayesian probability; Pattern recognition (psychology); Nonlinear system; Classifier (UML); Binary number; Binary classification; Computer science; Machine learning; Mathematics; Bayes classifier; Bayesian inference; Bayesian statistics; Support vector machine","score_opus":0.029973652368249674,"score_gpt":0.2398037591079624,"score_spread":0.20983010673971272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570135339","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.030462354,0.0028253493,0.9014369,0.0040640975,0.00019953088,0.00007598362,0.0005789329,0.00039060402,0.059966244],"genre_scores_gemma":[0.6412075,0.0041868254,0.3303315,0.001308846,0.0016472447,0.000476119,0.0014468067,0.0005958081,0.018799337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949569,0.0020119064,0.00033642122,0.0007554315,0.001670605,0.00026876002],"domain_scores_gemma":[0.973684,0.01982106,0.0017543174,0.0022526288,0.0019197305,0.0005682929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005685295,0.0008919643,0.001996325,0.0035202608,0.0026729703,0.0062246686,0.0024574061,0.0025096114,0.010209006],"category_scores_gemma":[0.038357735,0.0016390495,0.0019585178,0.0041322075,0.006586205,0.018597074,0.0034830668,0.005418935,0.0012734436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009354931,0.0000042577417,0.000083277475,0.000024499486,0.0000054924776,0.0000142270965,0.000056994908,0.0016890303,0.00004519456,0.99351525,0.0007535061,0.0037989358],"study_design_scores_gemma":[0.0000030053352,0.000002415624,0.00003747396,0.0000058366886,0.0000027834888,0.000025586238,0.000010144351,0.0047977814,0.00003050775,0.99434257,0.00073858025,0.0000032892017],"about_ca_topic_score_codex":0.002628667,"about_ca_topic_score_gemma":0.0017105296,"teacher_disagreement_score":0.010209006,"about_ca_system_score_codex":0.003118751,"about_ca_system_score_gemma":0.001357395,"threshold_uncertainty_score":0.034152508},"labels":[],"label_agreement":null},{"id":"W1570152307","doi":"10.1007/3-540-46513-8_6","title":"Modeling Linear Characteristics of Substitution-Permutation Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Queen's University","funders":"","keywords":"Linear cryptanalysis; Cryptanalysis; Bounding overwatch; Computer science; Permutation (music); Upper and lower bounds; Substitution (logic); Algorithm; Function (biology); Cryptography; Mathematics; Artificial intelligence","score_opus":0.014875678054176064,"score_gpt":0.23005850344491102,"score_spread":0.21518282539073497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570152307","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.23602049,0.00044116305,0.7398199,0.00097074657,0.000061864026,0.00008330417,0.0004891866,0.00034861578,0.02176471],"genre_scores_gemma":[0.9546663,0.00059319293,0.029258976,0.00010193108,0.00009488408,0.000096538155,0.0003270976,0.000093548544,0.01476762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996049,0.00014837344,0.00001127103,0.00009035404,0.00007007228,0.00007501201],"domain_scores_gemma":[0.99504787,0.0033681537,0.0006349715,0.00035760395,0.00038093107,0.0002104797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077902636,0.00047232036,0.0005248034,0.0009145213,0.00036006395,0.0014224247,0.001460872,0.001272984,0.004669533],"category_scores_gemma":[0.006795562,0.00047302057,0.00049446325,0.0012923498,0.0010656309,0.003410725,0.0009087923,0.0012378969,0.0006306881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006237468,0.000051410138,0.0016686849,0.000037561917,0.00002072041,0.000088338005,0.00011341603,0.5603258,0.0009995747,0.42385146,0.0011636706,0.011617075],"study_design_scores_gemma":[0.0000056996737,0.000013025052,0.00016401213,0.000004079018,0.0000058181345,0.000023517627,0.000022123231,0.8405073,0.00017195045,0.15860894,0.00046831268,0.0000051329584],"about_ca_topic_score_codex":0.003491458,"about_ca_topic_score_gemma":0.0033670173,"teacher_disagreement_score":0.004669533,"about_ca_system_score_codex":0.0015395933,"about_ca_system_score_gemma":0.0007880605,"threshold_uncertainty_score":0.015621185},"labels":[],"label_agreement":null},{"id":"W1570173564","doi":"10.1007/978-3-540-28630-1_17","title":"Staged Configuration Using Feature Models","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":427,"is_retracted":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":"Cardinality (data modeling); Computer science; Feature (linguistics); Notation; Feature model; Semantics (computer science); Product (mathematics); Process (computing); Theoretical computer science; Artificial intelligence; Programming language; Data mining; Mathematics; Arithmetic","score_opus":0.05681029222051876,"score_gpt":0.290329064332653,"score_spread":0.23351877211213423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570173564","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.0071234293,0.00008546146,0.9761273,0.000035781788,0.000035431152,0.0000383802,0.00010687228,0.004802126,0.011645243],"genre_scores_gemma":[0.38694677,0.00031273896,0.58579355,0.00005304825,0.000024340778,0.00013527343,0.0007357246,0.0015314599,0.024467085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959713,0.000044419583,0.000025589325,0.000099344805,0.000192704,0.00004077628],"domain_scores_gemma":[0.99936396,0.00014521339,0.000038967573,0.00036205174,0.00006480658,0.000025042944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030426905,0.00082895113,0.0006379106,0.0007766108,0.00043233918,0.0013400046,0.0016817789,0.0008034169,0.017551614],"category_scores_gemma":[0.0012973202,0.00080157927,0.00086893636,0.0009742336,0.00065878284,0.0026545322,0.0016290288,0.00079808896,0.0032930092],"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.00031827093,0.00010359859,0.0010146826,0.00027620682,0.000063635256,0.0005844817,0.00033871623,0.2438667,0.043670382,0.11674405,0.009414964,0.5836043],"study_design_scores_gemma":[0.00003439999,0.00019078974,0.00050512777,0.000064109096,0.00006157068,0.0006510302,0.00006700716,0.8424324,0.030224867,0.08503667,0.040655423,0.000076548014],"about_ca_topic_score_codex":0.0011037599,"about_ca_topic_score_gemma":0.0018587171,"teacher_disagreement_score":0.017551614,"about_ca_system_score_codex":0.000387468,"about_ca_system_score_gemma":0.0004254407,"threshold_uncertainty_score":0.05871594},"labels":[],"label_agreement":null},{"id":"W1570211220","doi":"10.1007/978-3-642-13681-8_23","title":"A Cry-Based Babies Identification System","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infant Health and Development","field":"Health Professions","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crying; Computer science; Identification (biology); Infant crying; Speech recognition; State (computer science); Artificial intelligence; Human–computer interaction; Psychology; Social psychology; Biology","score_opus":0.03333357861752183,"score_gpt":0.3474755422867986,"score_spread":0.31414196366927677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570211220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30567545,0.004096895,0.6036957,0.0006197192,0.0013152134,0.00067132135,0.0076407925,0.06284668,0.013438244],"genre_scores_gemma":[0.70434785,0.0013877626,0.2497896,0.0007680961,0.0003814468,0.0005028049,0.008559384,0.00045160155,0.033811506],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998331,0.000016870476,0.000013837891,0.00004603099,0.00006868802,0.00002143087],"domain_scores_gemma":[0.99976844,0.000048557264,0.00002141692,0.000022698981,0.0001061354,0.00003265768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029572978,0.00047015617,0.0008531709,0.0009027954,0.0003047228,0.00033053412,0.0007253008,0.00059677823,0.0064312494],"category_scores_gemma":[0.00044600255,0.00017272943,0.0002520997,0.00047404406,0.00007629408,0.00042314312,0.0007367149,0.000311605,0.0031679103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021143227,0.00029481683,0.0074976846,0.00030638243,0.00009570023,0.00045588939,0.00006998568,0.0018801807,0.2251686,0.00047477905,0.022803437,0.7388382],"study_design_scores_gemma":[0.0006560518,0.00219265,0.08066557,0.0001649815,0.00055583107,0.004424072,0.0003180599,0.50004536,0.37187892,0.001528271,0.037337042,0.00023317366],"about_ca_topic_score_codex":0.0012223904,"about_ca_topic_score_gemma":0.0020506235,"teacher_disagreement_score":0.0064312494,"about_ca_system_score_codex":0.00022808788,"about_ca_system_score_gemma":0.00028650422,"threshold_uncertainty_score":0.021514654},"labels":[],"label_agreement":null},{"id":"W1570328450","doi":"10.1007/11505730_52","title":"Unified Statistical Approach to Cortical Thickness Analysis","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":45,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Smoothing; Geodesic; Computer science; Surface (topology); Statistical inference; Euclidean distance; Kernel (algebra); Population; Artificial intelligence; Euclidean geometry; Computer vision; Algorithm; Pattern recognition (psychology); Mathematics; Geometry; Statistics; Discrete mathematics","score_opus":0.018312749511144318,"score_gpt":0.3035165372907087,"score_spread":0.2852037877795644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570328450","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.0010979439,0.00017000576,0.9983076,0.000036930716,0.000011595714,0.000007888179,0.00004092203,0.00012875148,0.00019834503],"genre_scores_gemma":[0.10310367,0.0012164883,0.89030683,0.00013140198,0.00033632427,0.00026437468,0.0005797083,0.00054797344,0.003513248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824524,0.0005703062,0.0001370119,0.00028416995,0.00063441636,0.00012899551],"domain_scores_gemma":[0.99645007,0.001498715,0.00029528313,0.00067617995,0.0009612508,0.00011847498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031712472,0.00096824346,0.0022471456,0.0042232336,0.00082856376,0.0025474243,0.0035535758,0.0011604213,0.0022537755],"category_scores_gemma":[0.0072387857,0.0012010736,0.0025336768,0.002995733,0.001137768,0.0020018239,0.0025376917,0.0018149188,0.00079744967],"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.000104834464,0.00012762447,0.0018114783,0.00029030832,0.0005391917,0.00032708343,0.0001921957,0.31745574,0.017644681,0.37477407,0.0041801305,0.28255263],"study_design_scores_gemma":[0.0000069456555,0.000027518243,0.000861451,0.000012238065,0.0000654915,0.000106116015,0.000015002172,0.89684534,0.0013378402,0.09874101,0.0019516688,0.000029337578],"about_ca_topic_score_codex":0.005680836,"about_ca_topic_score_gemma":0.007911804,"teacher_disagreement_score":0.005680836,"about_ca_system_score_codex":0.0010980457,"about_ca_system_score_gemma":0.0023361682,"threshold_uncertainty_score":0.016771376},"labels":[],"label_agreement":null},{"id":"W1570344394","doi":"10.1007/978-3-642-14518-6_12","title":"Visualizing Elements of Sha[3] in Genus 2 Jacobians","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Mathematics; Elliptic curve; Abelian group; Order (exchange); Genus field; Group (periodic table); Kernel (algebra); Field (mathematics); Surface (topology); Jacobian matrix and determinant; Pure mathematics; Combinatorics; Geometry; Elementary abelian group; Physics; Zoology; Biology","score_opus":0.028356072380430527,"score_gpt":0.30168246479747207,"score_spread":0.27332639241704154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570344394","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.68894434,0.0006120977,0.08106326,0.0008068793,0.00034702668,0.000067133864,0.0008555786,0.0044650566,0.22283858],"genre_scores_gemma":[0.94143474,0.00032618167,0.030469954,0.000106048086,0.00011436717,0.000019245846,0.0005467101,0.0018129346,0.025169853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999032,0.00001235273,0.0000027456833,0.00001898372,0.00004260938,0.000020113086],"domain_scores_gemma":[0.99981505,0.000044044344,0.000022174512,0.000023523047,0.000036066624,0.00005909341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011712567,0.00057457504,0.00032147238,0.0015855053,0.000704365,0.0014176833,0.00039245328,0.0004358856,0.01891094],"category_scores_gemma":[0.0005036833,0.0002889608,0.00024632865,0.0010151201,0.00072110567,0.0020664267,0.0010249467,0.00093615527,0.0016673545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041066113,0.00014709344,0.003234678,0.0003207885,0.000036117748,0.00172464,0.005980971,0.015529794,0.08906812,0.77445567,0.027133025,0.08195846],"study_design_scores_gemma":[0.00016341903,0.0002501594,0.015713602,0.00016753613,0.000055139117,0.0020786289,0.0044052606,0.083454184,0.020141963,0.63268226,0.24073969,0.00014811811],"about_ca_topic_score_codex":0.0014352847,"about_ca_topic_score_gemma":0.0025984515,"teacher_disagreement_score":0.01891094,"about_ca_system_score_codex":0.00040158516,"about_ca_system_score_gemma":0.00024844558,"threshold_uncertainty_score":0.06326342},"labels":[],"label_agreement":null},{"id":"W1570431431","doi":"10.1007/11735106_21","title":"A Hybrid Approach to Index Maintenance in Dynamic Text Retrieval Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Merge (version control); Computer science; Search engine indexing; Information retrieval; Data mining; Inverted index","score_opus":0.009936672657317182,"score_gpt":0.2235050912192837,"score_spread":0.2135684185619665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570431431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014650985,0.000935377,0.9792236,0.00022647352,0.00011485232,0.00017096846,0.00020185471,0.0029411546,0.0015348148],"genre_scores_gemma":[0.21304724,0.0005557114,0.7770634,0.00023484511,0.00026889236,0.00037248063,0.0008068879,0.0006669528,0.0069835624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972984,0.00055878016,0.0003120303,0.00043365487,0.001216348,0.00018071831],"domain_scores_gemma":[0.9933129,0.002378964,0.00026555997,0.0023950448,0.0014902512,0.00015726512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025743013,0.0007212816,0.0021289121,0.0031004206,0.001536945,0.0032853195,0.004552845,0.0017181631,0.004820659],"category_scores_gemma":[0.0075302804,0.0009805762,0.0010047824,0.004514755,0.0012446062,0.006353538,0.002850709,0.0014638848,0.0017115029],"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.0007231503,0.00037983005,0.0012151873,0.00043551115,0.0002000437,0.00020024335,0.00047876628,0.067685015,0.030817872,0.02814749,0.010282589,0.8594343],"study_design_scores_gemma":[0.00011356461,0.00029568886,0.00063901173,0.00003062105,0.00018771375,0.00046862138,0.00012572997,0.9293322,0.017277177,0.040117636,0.011335708,0.00007630659],"about_ca_topic_score_codex":0.0031311975,"about_ca_topic_score_gemma":0.004733203,"teacher_disagreement_score":0.004820659,"about_ca_system_score_codex":0.0009561882,"about_ca_system_score_gemma":0.0012977226,"threshold_uncertainty_score":0.016126692},"labels":[],"label_agreement":null},{"id":"W1570469335","doi":"10.1007/11766247_45","title":"Probabilistic Inference Trees for Classification and Ranking","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"","keywords":"Computer science; Ranking (information retrieval); Decision tree; Machine learning; Artificial intelligence; Ranking SVM; Probabilistic logic; Inference; Decision tree learning; Learning to rank; Data mining; Pattern recognition (psychology)","score_opus":0.032984000878324087,"score_gpt":0.27474496987325336,"score_spread":0.24176096899492927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570469335","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.00070206635,0.0020274986,0.9939958,0.00035274166,0.00015816813,0.00003484145,0.0004077267,0.00092625665,0.0013949301],"genre_scores_gemma":[0.053490035,0.0037591355,0.9252295,0.00046851576,0.0008740127,0.00043150294,0.0036835065,0.0006489937,0.011414765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952846,0.001806668,0.00036399672,0.0007403923,0.001585198,0.00021912312],"domain_scores_gemma":[0.9897138,0.0072453553,0.00036405795,0.0015608076,0.00096875883,0.00014718954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004248309,0.0013194977,0.0031252778,0.0026483776,0.0011943397,0.0034148782,0.0042371447,0.0023857686,0.011017487],"category_scores_gemma":[0.01897067,0.0012628891,0.0024239027,0.005544004,0.0014377567,0.0065993997,0.001930473,0.005002702,0.006467662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010273562,0.00011901208,0.0005886086,0.000542899,0.00017414395,0.00010739631,0.00018034584,0.079852104,0.00075605046,0.2732399,0.05128323,0.5930536],"study_design_scores_gemma":[0.000020012674,0.000018919813,0.00019569963,0.00005265527,0.000034816818,0.000082783874,0.0000222044,0.31661555,0.00041111204,0.67099476,0.011530231,0.000021243572],"about_ca_topic_score_codex":0.003743076,"about_ca_topic_score_gemma":0.0050312444,"teacher_disagreement_score":0.011017487,"about_ca_system_score_codex":0.0018395232,"about_ca_system_score_gemma":0.0016650733,"threshold_uncertainty_score":0.036857188},"labels":[],"label_agreement":null},{"id":"W1570473992","doi":"10.1007/3-540-45153-6_15","title":"Local Score Computation in Learning Belief networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Computation; Artificial intelligence; Belief propagation; Theoretical computer science; Machine learning; Belief revision; Algorithm","score_opus":0.023064670008884517,"score_gpt":0.251182115202841,"score_spread":0.2281174451939565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570473992","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.0049629873,0.0005594306,0.99301803,0.00014924687,0.000026763033,0.000016303782,0.00002678545,0.00024336283,0.000997221],"genre_scores_gemma":[0.38812643,0.0015017772,0.6017298,0.00014353918,0.00033737082,0.00039344924,0.00046896265,0.000337689,0.0069609554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700886,0.0016786706,0.00014770596,0.0004132494,0.0006026475,0.00014875375],"domain_scores_gemma":[0.9904322,0.0076208035,0.00033488235,0.0007529376,0.000629553,0.00022965444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004781154,0.001111288,0.0031120614,0.0017360044,0.000809285,0.00284293,0.0034202782,0.0017848646,0.0047160275],"category_scores_gemma":[0.020330677,0.001062651,0.0010937565,0.0031629074,0.0027942357,0.0053851884,0.0036394638,0.0032395488,0.0009114441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016162952,0.00007547944,0.00066043774,0.00027318014,0.00011138513,0.00004399227,0.00017391608,0.46690404,0.0006895364,0.32048815,0.003353513,0.20706487],"study_design_scores_gemma":[0.000015766886,0.00002036349,0.00009131358,0.000015064436,0.000013523971,0.000010238313,0.000010214973,0.73773676,0.00023589184,0.26137045,0.0004705812,0.000009741963],"about_ca_topic_score_codex":0.0029456292,"about_ca_topic_score_gemma":0.00335342,"teacher_disagreement_score":0.004781154,"about_ca_system_score_codex":0.0019719359,"about_ca_system_score_gemma":0.0009910299,"threshold_uncertainty_score":0.025285482},"labels":[],"label_agreement":null},{"id":"W1570515303","doi":"10.1007/3-540-39568-7_8","title":"Computing Logarithms in GF (2n)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Base (topology); Integer (computer science); Mathematics; Finite field; Discrete mathematics; Generator (circuit theory); Combinatorics; Element (criminal law); Binary logarithm; Field (mathematics); Iterated logarithm; Pure mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.022858732874635253,"score_gpt":0.25914947474430594,"score_spread":0.2362907418696707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570515303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1255072,0.0054339096,0.6558136,0.004463512,0.0015892875,0.00027422493,0.0026800744,0.00766777,0.19657041],"genre_scores_gemma":[0.6499387,0.0028488704,0.27563733,0.0009464566,0.0009245735,0.00025948772,0.0033225452,0.0008988911,0.06522316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.0002715624,0.00009584377,0.00023518695,0.0006983694,0.00022711471],"domain_scores_gemma":[0.9982014,0.0007768296,0.0001150982,0.0005794869,0.00024206571,0.000085200416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011340178,0.0008765975,0.00087900297,0.0015445247,0.0010402452,0.0036074403,0.0009238176,0.0005337824,0.022279574],"category_scores_gemma":[0.006182343,0.00037419493,0.00058334076,0.0023368762,0.0012974988,0.005571719,0.002151761,0.0015939297,0.00948906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095826254,0.00026459838,0.002137014,0.00080305606,0.000089613306,0.0004277961,0.0007039745,0.021318309,0.020253407,0.31076536,0.060147587,0.582131],"study_design_scores_gemma":[0.00026422742,0.00027349728,0.0013640706,0.00042015107,0.00005837074,0.00094364845,0.00034139625,0.07011655,0.041437235,0.7830634,0.10162377,0.00009366366],"about_ca_topic_score_codex":0.00078119815,"about_ca_topic_score_gemma":0.0017956131,"teacher_disagreement_score":0.022279574,"about_ca_system_score_codex":0.00142403,"about_ca_system_score_gemma":0.0013662752,"threshold_uncertainty_score":0.07453257},"labels":[],"label_agreement":null},{"id":"W1570532020","doi":"10.1007/978-3-642-03816-7_21","title":"Self-indexed Text Compression Using Straight-Line Programs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":48,"is_retracted":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":"Substring; Computer science; Grammar; Representation (politics); Natural language processing; Line (geometry); Artificial intelligence; Context (archaeology); Compression (physics); Programming language; Mathematics; Data structure; Linguistics","score_opus":0.026033658037124936,"score_gpt":0.26681504136117684,"score_spread":0.2407813833240519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570532020","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.04340924,0.0009397328,0.92074,0.00016019275,0.00027012487,0.00020971945,0.00044068406,0.016985895,0.016844386],"genre_scores_gemma":[0.25800076,0.00092427485,0.6991137,0.0002016984,0.00022135893,0.00029992993,0.0019198125,0.0018072252,0.037511166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996432,0.000045953482,0.000038296686,0.00006416278,0.00016928629,0.00003904197],"domain_scores_gemma":[0.9990108,0.00033889562,0.00007271097,0.00025226915,0.0002954474,0.00002972736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029491834,0.0007333642,0.0004676705,0.0013946474,0.0004411423,0.0010317301,0.0008986725,0.0005152173,0.013630206],"category_scores_gemma":[0.0013943937,0.00025349355,0.00033785877,0.0020011056,0.0004319857,0.001576555,0.0009169098,0.0005755013,0.0060245437],"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.0005172482,0.00016670316,0.00037883344,0.00031318612,0.000031069834,0.00029936014,0.00016501371,0.006123492,0.08919684,0.024853198,0.013475531,0.86447954],"study_design_scores_gemma":[0.00016424607,0.0007231398,0.0010942332,0.00013433337,0.00009583011,0.0021875326,0.00017879858,0.31300545,0.577936,0.03030629,0.074091725,0.00008248933],"about_ca_topic_score_codex":0.00040342944,"about_ca_topic_score_gemma":0.0005941089,"teacher_disagreement_score":0.013630206,"about_ca_system_score_codex":0.00028164123,"about_ca_system_score_gemma":0.0004363107,"threshold_uncertainty_score":0.045597613},"labels":[],"label_agreement":null},{"id":"W1570577635","doi":"10.1007/978-3-642-00887-0_33","title":"Multi-level Frequent Pattern Mining","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Exploit; Apriori algorithm; Data mining; Association rule learning; Focus (optics); Set (abstract data type); A priori and a posteriori; Tree (set theory); Raw data; Machine learning; Artificial intelligence; Computer security","score_opus":0.04595928257508384,"score_gpt":0.27563883082251656,"score_spread":0.22967954824743272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570577635","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.05468008,0.0038643763,0.9259507,0.00055103714,0.0003259551,0.00030007152,0.004691683,0.0029525189,0.0066835224],"genre_scores_gemma":[0.18743972,0.0020105406,0.792054,0.00019770655,0.00022562867,0.00020448104,0.009826929,0.0002038325,0.007837099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875,0.00014132878,0.00024532122,0.0002831547,0.0005016298,0.00007864781],"domain_scores_gemma":[0.99677855,0.0015151433,0.0003211383,0.0006916242,0.0005901845,0.00010336712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090919976,0.0006546314,0.0011920547,0.003421221,0.0005676334,0.0015140099,0.0016221605,0.0007758589,0.006483046],"category_scores_gemma":[0.0047954377,0.0005160612,0.0013765948,0.0051640137,0.0002492083,0.0024053266,0.0011117486,0.0009562219,0.0037584284],"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.0002756302,0.0001710084,0.0071360446,0.00090609107,0.00022324047,0.0010658208,0.00011576008,0.0055170697,0.013923958,0.0076132286,0.0116016,0.9514505],"study_design_scores_gemma":[0.00015292194,0.00093226257,0.019233136,0.00048747545,0.00090988795,0.020034513,0.0004393105,0.6660996,0.054691177,0.13210687,0.104745336,0.00016748485],"about_ca_topic_score_codex":0.00020967149,"about_ca_topic_score_gemma":0.0005383937,"teacher_disagreement_score":0.006483046,"about_ca_system_score_codex":0.00020931712,"about_ca_system_score_gemma":0.00041728796,"threshold_uncertainty_score":0.021687984},"labels":[],"label_agreement":null},{"id":"W1570621944","doi":"10.1007/978-3-540-32033-3_22","title":"The Finite Variant Property: How to Get Rid of Some Algebraic Properties","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":143,"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":"Association of Canadian Universities for Northern Studies","keywords":"Commutative property; Homomorphism; Modular exponentiation; Abelian group; Substitution (logic); Sigma; Associative property; Discrete mathematics; Combinatorics; Mathematics; Algebra over a field; Physics; Pure mathematics; Computer science","score_opus":0.021931929215358355,"score_gpt":0.24413912505084012,"score_spread":0.22220719583548176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570621944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005033761,0.00096775946,0.95047307,0.0036441085,0.00096290326,0.00006462231,0.00020224706,0.0015594251,0.03709216],"genre_scores_gemma":[0.2604093,0.0032805675,0.6952493,0.0021387273,0.0014998382,0.00025273277,0.00078692427,0.0032076426,0.033174843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809736,0.0004621479,0.00015872192,0.00043641016,0.00068116747,0.00016424138],"domain_scores_gemma":[0.9949639,0.001716075,0.0001284091,0.0024688079,0.000572922,0.00014992188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023053368,0.00095859496,0.0014004817,0.001105682,0.0019979447,0.0041279322,0.0026989088,0.001635662,0.0140333],"category_scores_gemma":[0.012627707,0.00084686215,0.0017996174,0.0018000168,0.0066029644,0.026326383,0.0048703654,0.008110112,0.0055086627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046521454,0.000020156791,0.00021005582,0.00015361738,0.000017740987,0.00011799729,0.00026246638,0.00094621576,0.0011718977,0.8917775,0.013178107,0.09209769],"study_design_scores_gemma":[0.000010308013,0.00001063983,0.000044939083,0.000024779432,0.000015670637,0.00019266712,0.00006344309,0.0037879844,0.0015281781,0.9664945,0.027808346,0.000018605704],"about_ca_topic_score_codex":0.0010892516,"about_ca_topic_score_gemma":0.00095922814,"teacher_disagreement_score":0.0140333,"about_ca_system_score_codex":0.00074339606,"about_ca_system_score_gemma":0.0010762617,"threshold_uncertainty_score":0.04694605},"labels":[],"label_agreement":null},{"id":"W1570636420","doi":"10.1007/978-3-642-04595-0_44","title":"Learning Automata Based Intelligent Tutorial-like System","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Carleton University","funders":"","keywords":"Computer science; Automaton; Learning automata; Artificial intelligence; Programming language; Software engineering; Theoretical computer science","score_opus":0.016974586197893972,"score_gpt":0.23692705453716056,"score_spread":0.2199524683392666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570636420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11859423,0.00026645086,0.8351675,0.00030546702,0.00023475311,0.00022667457,0.000718635,0.027937563,0.016548758],"genre_scores_gemma":[0.74926645,0.00015826066,0.22746214,0.00021162433,0.00004824786,0.00029467078,0.001099772,0.00029550324,0.021163303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985695,0.000033332257,0.000014498183,0.000051065348,0.00002658648,0.000017565435],"domain_scores_gemma":[0.9995921,0.00012819661,0.000021564936,0.00008048432,0.00012748888,0.00005007709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002483958,0.00029431918,0.00046510977,0.0003324071,0.00036073892,0.00065337046,0.001059909,0.00080770254,0.010902472],"category_scores_gemma":[0.0010550965,0.00016586599,0.00033084687,0.00020486386,0.00021552897,0.00092363235,0.0006856116,0.0004443031,0.0029319937],"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.001485822,0.0009895567,0.0049166875,0.00050601485,0.00013597577,0.0008505646,0.0005378523,0.12002707,0.14884421,0.043116007,0.028866628,0.64972365],"study_design_scores_gemma":[0.00009302279,0.00032228106,0.0008912232,0.000019267958,0.0000740727,0.0002922873,0.000033605298,0.9435453,0.03515075,0.008115705,0.0114319865,0.000030401055],"about_ca_topic_score_codex":0.0013200582,"about_ca_topic_score_gemma":0.0014984837,"teacher_disagreement_score":0.010902472,"about_ca_system_score_codex":0.00035287585,"about_ca_system_score_gemma":0.0004476302,"threshold_uncertainty_score":0.03647238},"labels":[],"label_agreement":null},{"id":"W1570640940","doi":"10.1007/978-3-642-15461-4_1","title":"A Graph-Based Developmental Swarm Representation and Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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 Calgary","funders":"","keywords":"Computer science; Rule-based machine translation; Theoretical computer science; Representation (politics); Graph; Generative grammar; Swarm behaviour; Multi-agent system; Property (philosophy); Artificial intelligence","score_opus":0.014235389900059207,"score_gpt":0.25003949765511296,"score_spread":0.23580410775505375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570640940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004942714,0.00008977218,0.99189353,0.000120829216,0.000041024847,0.000059379887,0.00011675707,0.0006403867,0.002095738],"genre_scores_gemma":[0.15335295,0.00022603347,0.8404706,0.000111755304,0.000037905014,0.00033952974,0.0005445189,0.00022299355,0.0046936707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982375,0.000041649124,0.000010977913,0.00004670931,0.000058099915,0.000018866833],"domain_scores_gemma":[0.99961483,0.00017630884,0.000022843893,0.000053316337,0.000104198945,0.000028522016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004446242,0.00071333494,0.0010534734,0.0011016289,0.0006690896,0.0010690475,0.0022944382,0.0015381858,0.00453535],"category_scores_gemma":[0.0014731403,0.00044039317,0.00095040933,0.0012946966,0.00063204323,0.00093462947,0.0014598832,0.0010654954,0.0009260486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049684662,0.00003975133,0.00032576045,0.000059432947,0.000028447303,0.00004196664,0.000060151535,0.8374919,0.001937935,0.028529054,0.0031652295,0.1282707],"study_design_scores_gemma":[0.0000047437034,0.0000057285943,0.000020998257,0.0000027186504,0.0000033797064,0.000005989573,0.0000034822708,0.9955823,0.00016920392,0.0037808581,0.00041803333,0.0000025098152],"about_ca_topic_score_codex":0.01396205,"about_ca_topic_score_gemma":0.010144963,"teacher_disagreement_score":0.01396205,"about_ca_system_score_codex":0.0010613328,"about_ca_system_score_gemma":0.0010888957,"threshold_uncertainty_score":0.027761579},"labels":[],"label_agreement":null},{"id":"W1570680318","doi":"10.1007/978-3-642-19309-5_10","title":"Object Class Segmentation Using Reliable Regions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Western University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Pattern recognition (psychology); Classifier (UML); Image segmentation; Segmentation-based object categorization; Scale-space segmentation; Object (grammar); Feature (linguistics); Class (philosophy); Computer vision","score_opus":0.04037155054508742,"score_gpt":0.29356278573137673,"score_spread":0.25319123518628933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570680318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010708194,0.0010304851,0.9836209,0.000077320656,0.000053742446,0.000092508766,0.0001458759,0.0026014026,0.00166967],"genre_scores_gemma":[0.14927447,0.00088809367,0.8436009,0.000097668926,0.00011678308,0.000113616035,0.0007628802,0.0012629543,0.0038825697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987552,0.000109750894,0.00005971681,0.00045170644,0.00045372028,0.00016978868],"domain_scores_gemma":[0.9981218,0.0005049077,0.00020891787,0.00065335893,0.00044643634,0.00006459962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216208,0.0014999777,0.001925542,0.003773425,0.0007292722,0.0022167726,0.0027289623,0.0019788416,0.004777883],"category_scores_gemma":[0.0029117907,0.0014312475,0.0015508521,0.002629467,0.0011961324,0.0027173364,0.0017750874,0.0013454278,0.0038180924],"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.00057410175,0.00008077619,0.0010141508,0.00046904347,0.00016508433,0.0002813712,0.00023190146,0.031404864,0.13384882,0.0077660037,0.0047518765,0.819412],"study_design_scores_gemma":[0.000051438703,0.00023621759,0.0028282818,0.00009621175,0.00027159584,0.001138666,0.00011279831,0.795338,0.16559118,0.017874358,0.016386326,0.000074935],"about_ca_topic_score_codex":0.0031634849,"about_ca_topic_score_gemma":0.0041061565,"teacher_disagreement_score":0.004777883,"about_ca_system_score_codex":0.0006912098,"about_ca_system_score_gemma":0.00095004,"threshold_uncertainty_score":0.015983582},"labels":[],"label_agreement":null},{"id":"W1570736868","doi":"10.1007/978-3-642-13657-3_20","title":"Anonymizing Transaction Data by Integrating Suppression and Generalization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Generalization; Scalability; Database transaction; Property (philosophy); Key (lock); Transaction data; Data mining; Information loss; Transaction processing; Database; Artificial intelligence; Computer security","score_opus":0.029596427280106332,"score_gpt":0.27195356380107905,"score_spread":0.2423571365209727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570736868","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.023850394,0.0002759862,0.9722395,0.000297004,0.000075657874,0.00015904818,0.00013835501,0.0009910661,0.0019729037],"genre_scores_gemma":[0.49627483,0.00059051835,0.49589604,0.00036113587,0.0003786816,0.00028551408,0.0009768684,0.00037567143,0.004860618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99364364,0.0021351748,0.0005917711,0.0011041483,0.0020895621,0.00043559106],"domain_scores_gemma":[0.98185617,0.0047375695,0.0010735736,0.010872784,0.001288636,0.00017120948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607802,0.0008909409,0.0024695366,0.0019074887,0.0015097463,0.0031198629,0.0025388363,0.0009797725,0.0012730549],"category_scores_gemma":[0.0126050105,0.000682713,0.0017107918,0.0028402319,0.0026158753,0.0059215995,0.004624364,0.0024962006,0.0007611521],"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.0011749075,0.0004888287,0.0047603073,0.0003493128,0.0003178743,0.00042782535,0.0015505533,0.17886129,0.033319715,0.25644267,0.009816008,0.5124907],"study_design_scores_gemma":[0.000048546215,0.00014271887,0.00066141516,0.000042948206,0.00012109541,0.0005229753,0.000288809,0.74281,0.03554063,0.2115955,0.008170582,0.000054750264],"about_ca_topic_score_codex":0.0012320012,"about_ca_topic_score_gemma":0.0016403478,"teacher_disagreement_score":0.00607802,"about_ca_system_score_codex":0.00093406014,"about_ca_system_score_gemma":0.0022355183,"threshold_uncertainty_score":0.03214401},"labels":[],"label_agreement":null},{"id":"W1570779175","doi":"10.1007/978-3-642-13681-8_41","title":"Error-Resilient and Error Concealment 3-D SPIHT Video Coding with Added Redundancy","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set partitioning in hierarchical trees; Redundancy (engineering); Computer science; Coding (social sciences); Novelty; Error concealment; Artificial intelligence; Algorithm; Pattern recognition (psychology); Decoding methods; Wavelet; Mathematics; Wavelet transform; Statistics; Psychology","score_opus":0.017991407094862154,"score_gpt":0.2760827457279089,"score_spread":0.2580913386330468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570779175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032343987,0.00062987773,0.9614154,0.0001596525,0.000103919476,0.000032119795,0.00011817266,0.0005780783,0.004618811],"genre_scores_gemma":[0.4484234,0.0015389718,0.5308899,0.00016543613,0.00011954252,0.000074876676,0.00034724837,0.00020808552,0.01823251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.000040169172,0.00001479899,0.000019654264,0.00017219657,0.000020925485],"domain_scores_gemma":[0.9994254,0.00020318202,0.00007198535,0.00015932706,0.00012877633,0.000011317062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003533291,0.00069428695,0.0003716305,0.00066081865,0.00020584425,0.00052800385,0.0007192351,0.00080265396,0.0021561987],"category_scores_gemma":[0.0012072725,0.00030559298,0.00048001966,0.00063391734,0.00043387274,0.0009956089,0.00061728596,0.0006813399,0.0006480199],"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.0004949117,0.000082562874,0.00051043055,0.0003570414,0.000087953966,0.0006257293,0.00032579474,0.22233815,0.32261243,0.08388991,0.0039888285,0.36468622],"study_design_scores_gemma":[0.000018621431,0.0001614388,0.0004669173,0.00006750037,0.00004180479,0.0011895937,0.000024935225,0.8079015,0.17411588,0.010443451,0.00552502,0.00004326092],"about_ca_topic_score_codex":0.00066311343,"about_ca_topic_score_gemma":0.0010528313,"teacher_disagreement_score":0.0021561987,"about_ca_system_score_codex":0.00039971728,"about_ca_system_score_gemma":0.00032092212,"threshold_uncertainty_score":0.0072131753},"labels":[],"label_agreement":null},{"id":"W1570786161","doi":"10.1007/978-3-642-17688-3_20","title":"An Edge-Sensing Universal Demosaicing Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer vision; Demosaicing; Artificial intelligence; Algorithm; Image (mathematics); Image processing","score_opus":0.011281766795614876,"score_gpt":0.2601436021866487,"score_spread":0.24886183539103385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570786161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036724487,0.00015887697,0.9941567,0.000038141818,0.000043767526,0.000016273267,0.000036909765,0.0005403782,0.0013365201],"genre_scores_gemma":[0.03797071,0.00022496053,0.9580237,0.00008638364,0.00003356167,0.000028332792,0.00018075173,0.00010400496,0.0033475512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999683,0.000030764437,0.000018558136,0.00009107199,0.00014374197,0.00003290049],"domain_scores_gemma":[0.99971265,0.00005726572,0.00001806411,0.00009431739,0.000094619914,0.000023013787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046141667,0.00066194154,0.000737236,0.00083794707,0.00034223747,0.00059189956,0.0009728159,0.0008095329,0.003351551],"category_scores_gemma":[0.0009433442,0.00045151435,0.0005351469,0.0011186599,0.0004774145,0.0010489199,0.0014093805,0.00073129154,0.0016325488],"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.00015183762,0.00003659604,0.00031816532,0.0001113425,0.00003915447,0.000063135514,0.00006320823,0.020771079,0.090195596,0.015539493,0.004429528,0.8682808],"study_design_scores_gemma":[0.000033663964,0.000098914454,0.001449601,0.000038702077,0.000065331216,0.0007534785,0.00004676168,0.84990007,0.10689639,0.018855488,0.021804616,0.000056897377],"about_ca_topic_score_codex":0.0012023677,"about_ca_topic_score_gemma":0.0024034623,"teacher_disagreement_score":0.003351551,"about_ca_system_score_codex":0.00029618604,"about_ca_system_score_gemma":0.00061733567,"threshold_uncertainty_score":0.011211991},"labels":[],"label_agreement":null},{"id":"W1570791335","doi":"10.1007/978-3-540-39903-2_33","title":"Comparison of Correction Protocols for Image-Guided Radiation Therapy","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"Princess Margaret Cancer Centre","funders":"","keywords":"Computer science; Protocol (science); Line (geometry); Residual; Radiation therapy; Volume (thermodynamics); Medical physics; Computer vision; Nuclear medicine; Artificial intelligence; Algorithm; Medicine; Radiology; Mathematics; Pathology","score_opus":0.030390661125725707,"score_gpt":0.3600006110199978,"score_spread":0.3296099498942721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570791335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35710236,0.024391908,0.5960188,0.00063285447,0.00080768974,0.0012634103,0.001288467,0.0061522573,0.012342265],"genre_scores_gemma":[0.74307233,0.005246289,0.24232443,0.00024739373,0.000068453446,0.0004339267,0.0011362771,0.0027418265,0.004729096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861264,0.0004840771,0.00012712016,0.000121493984,0.00057835423,0.000076255696],"domain_scores_gemma":[0.9908529,0.006297907,0.0006775881,0.00088410726,0.0011713736,0.000116236595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024367361,0.00080935826,0.0007153163,0.0015354019,0.0003974667,0.0013391689,0.0012617242,0.00081569236,0.0033681025],"category_scores_gemma":[0.014874804,0.00062582723,0.0006664431,0.0014717656,0.0003447567,0.00090720213,0.0006876594,0.0007176286,0.0005199929],"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.017242303,0.00084689824,0.00798842,0.0024160873,0.000996244,0.00013231619,0.00084706943,0.11923077,0.10093814,0.0046586893,0.00636288,0.7383402],"study_design_scores_gemma":[0.0023386416,0.009417803,0.060282256,0.0009355731,0.004707864,0.0035638676,0.0010058028,0.4735802,0.4018757,0.011358469,0.030260043,0.000673715],"about_ca_topic_score_codex":0.0034305558,"about_ca_topic_score_gemma":0.0023739631,"teacher_disagreement_score":0.0034305558,"about_ca_system_score_codex":0.0009012939,"about_ca_system_score_gemma":0.0011798576,"threshold_uncertainty_score":0.012886882},"labels":[],"label_agreement":null},{"id":"W1570814494","doi":"10.1007/978-3-642-14455-4_39","title":"Pseudo-power Avoidance","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Computer science; Repetition (rhetorical device); Property (philosophy); Complementarity (molecular biology); Power (physics); Theoretical computer science; Algorithm; Physics; Biology","score_opus":0.010077664795226577,"score_gpt":0.23729925388807835,"score_spread":0.22722158909285178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570814494","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11374545,0.00079474604,0.42169654,0.0014406805,0.0008642153,0.0001528779,0.000357566,0.0013933576,0.45955452],"genre_scores_gemma":[0.76036245,0.00064010883,0.044161383,0.000674352,0.00024919247,0.00013445091,0.000484727,0.00054447405,0.19274887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997205,0.000038057668,0.0000096859585,0.000052355503,0.00011665643,0.000062673644],"domain_scores_gemma":[0.99941194,0.0001703036,0.000040903742,0.00016715015,0.0001249683,0.00008474645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023182033,0.00053651485,0.00051589054,0.00074640056,0.0012212732,0.0013205952,0.0008761407,0.00079800416,0.021900937],"category_scores_gemma":[0.0015233366,0.00023208461,0.00050847384,0.0005556274,0.0011728023,0.0016889933,0.0019164198,0.0015141707,0.0032547957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007579627,0.000037409005,0.00017569262,0.000061219995,0.0000146030025,0.00009393401,0.00010064077,0.0054568946,0.0049302205,0.9389059,0.00972536,0.0404224],"study_design_scores_gemma":[0.000017869195,0.00003783331,0.00019393898,0.000016921522,0.000010031544,0.00020635249,0.00004859561,0.034397356,0.0027353824,0.9485117,0.013808278,0.000015786965],"about_ca_topic_score_codex":0.0003949815,"about_ca_topic_score_gemma":0.0004763637,"teacher_disagreement_score":0.021900937,"about_ca_system_score_codex":0.0004210213,"about_ca_system_score_gemma":0.00047387488,"threshold_uncertainty_score":0.07326591},"labels":[],"label_agreement":null},{"id":"W1570839833","doi":"10.1007/978-3-540-85261-2_23","title":"Using ZBDDs in Points-to Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Computer science; Binary decision diagram; Context (archaeology); Model checking; Overhead (engineering); Compiler; Algorithm; Metric (unit); Domain (mathematical analysis); Programming language; Theoretical computer science; Mathematics","score_opus":0.05614161932072937,"score_gpt":0.31930579602932746,"score_spread":0.2631641767085981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570839833","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.0016813178,0.0001846082,0.9926543,0.0000934699,0.000071309296,0.000050902905,0.00006924003,0.0011223204,0.004072574],"genre_scores_gemma":[0.12874873,0.0014489038,0.8511529,0.00034206884,0.00015579553,0.00033357457,0.00054358854,0.0017872492,0.015487272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645555,0.0009990792,0.00030847045,0.000512898,0.0014462807,0.00027779356],"domain_scores_gemma":[0.9978048,0.0011564795,0.00012948854,0.000557839,0.0003152632,0.00003609414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002174725,0.001872241,0.0014019348,0.0026821615,0.0012197369,0.0036784513,0.0022619576,0.0012992548,0.012693859],"category_scores_gemma":[0.0053380434,0.001570947,0.0027421347,0.0030250812,0.0031972604,0.0071032057,0.0029981493,0.003536881,0.0039445693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008853122,0.000031378884,0.0002855104,0.00034743498,0.000057558005,0.00008071583,0.00024710255,0.015970564,0.002146892,0.86790246,0.0025860146,0.11025586],"study_design_scores_gemma":[0.000036140853,0.000024694198,0.00007874549,0.0001284227,0.00006969342,0.00008106729,0.00008835071,0.047222193,0.0085048815,0.91641486,0.027318573,0.0000324213],"about_ca_topic_score_codex":0.0028346907,"about_ca_topic_score_gemma":0.0025438173,"teacher_disagreement_score":0.012693859,"about_ca_system_score_codex":0.0020206019,"about_ca_system_score_gemma":0.0014061173,"threshold_uncertainty_score":0.04246515},"labels":[],"label_agreement":null},{"id":"W157085335","doi":"10.1007/978-3-642-21538-4_2","title":"Small Tree Probabilistic Roadmap Planner for Hyper-Redundant Manipulators","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Royal Military College of Canada","funders":"","keywords":"Planner; Computer science; Probabilistic logic; Path (computing); Probabilistic roadmap; Motion planning; Tree (set theory); Configuration space; Connection (principal bundle); Process (computing); Robot; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.05787342181088051,"score_gpt":0.24626404230854404,"score_spread":0.18839062049766353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157085335","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.009143753,0.0002698093,0.98632264,0.000044338143,0.00002082809,0.000038979477,0.0001319576,0.0011103379,0.0029173868],"genre_scores_gemma":[0.31645522,0.0005115356,0.67471576,0.000047863028,0.000027370646,0.00021192404,0.0006675768,0.00040135506,0.0069613545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972457,0.000043224474,0.000013866772,0.000057943264,0.00013807094,0.000022326083],"domain_scores_gemma":[0.9996804,0.00014697178,0.000030614334,0.00006139311,0.0000595788,0.00002101808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037315724,0.00060959044,0.0007029793,0.0006376268,0.00037653864,0.00051965396,0.0013019807,0.00066701625,0.0046859775],"category_scores_gemma":[0.0010372506,0.0005418228,0.0004635416,0.00089636137,0.00047337508,0.0012616767,0.0012829022,0.0008924,0.0009239387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019186322,0.000051619983,0.00021243036,0.00029982947,0.0000328638,0.00016711769,0.00011354344,0.61277467,0.01646149,0.02811879,0.0050617177,0.33651406],"study_design_scores_gemma":[0.000017392951,0.000060655566,0.0001407554,0.000013199882,0.000009282629,0.00007793998,0.0000114005725,0.96917266,0.0030463345,0.024073457,0.0033622873,0.00001460059],"about_ca_topic_score_codex":0.0012598946,"about_ca_topic_score_gemma":0.00287798,"teacher_disagreement_score":0.0046859775,"about_ca_system_score_codex":0.00037881985,"about_ca_system_score_gemma":0.0006841169,"threshold_uncertainty_score":0.01567614},"labels":[],"label_agreement":null},{"id":"W1570916732","doi":"10.1007/978-3-642-04052-8_9","title":"MiniDiver: A Novel Mobile Media Playback Interface for Rich Video Content on an iPhoneTM","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interface (matter); Multimedia; Content (measure theory); Computer graphics (images); Operating system","score_opus":0.06571326980188408,"score_gpt":0.3293228411772038,"score_spread":0.2636095713753197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570916732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1268217,0.004577807,0.7558038,0.00056784076,0.0011929402,0.0008401551,0.0024060144,0.050281994,0.0575077],"genre_scores_gemma":[0.34760293,0.0031792137,0.35224116,0.0022883243,0.0007520082,0.0010697019,0.0031615589,0.0060651302,0.28364],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998497,0.000015515885,0.000008132933,0.000034942685,0.00007217184,0.000019563793],"domain_scores_gemma":[0.99982065,0.000069655216,0.000010184259,0.00001819647,0.00004632583,0.00003505585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025921484,0.00093963544,0.0006052514,0.00081297604,0.00035211467,0.0007384972,0.0015760837,0.0007495686,0.04296011],"category_scores_gemma":[0.0005040779,0.00040303828,0.00032631538,0.00032351576,0.00020533595,0.0011802162,0.00105617,0.00059397984,0.00650524],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011992843,0.0002078815,0.0006365629,0.0005698236,0.00006285322,0.00067901105,0.00051619054,0.00024970394,0.52618164,0.0028297764,0.03480423,0.43206313],"study_design_scores_gemma":[0.0004973196,0.0023462444,0.01168756,0.00041291816,0.00054923573,0.012669421,0.0005997362,0.051657196,0.49732095,0.0034575257,0.4184786,0.00032325304],"about_ca_topic_score_codex":0.00053384673,"about_ca_topic_score_gemma":0.0015519868,"teacher_disagreement_score":0.04296011,"about_ca_system_score_codex":0.00016924688,"about_ca_system_score_gemma":0.00017451703,"threshold_uncertainty_score":0.14371586},"labels":[],"label_agreement":null},{"id":"W1571001643","doi":"10.1007/11424918_17","title":"Fast Protein Superfamily Classification Using Principal Component Null Space Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Principal component analysis; Artificial intelligence; Curse of dimensionality; Classifier (UML); Artificial neural network; Machine learning; Pattern recognition (psychology); Support vector machine; Data mining","score_opus":0.017151535646473075,"score_gpt":0.26300295531413836,"score_spread":0.2458514196676653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571001643","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.008290672,0.0005614288,0.97379565,0.00013025157,0.00012223441,0.00010748528,0.0009615573,0.0147264395,0.0013042995],"genre_scores_gemma":[0.051965587,0.00040086632,0.93798774,0.00006841971,0.0000657977,0.00025688056,0.004320287,0.0008564731,0.0040779947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.00017421435,0.00006221616,0.0001911563,0.00045136988,0.00008683757],"domain_scores_gemma":[0.99804974,0.00063050014,0.00009375619,0.00045625804,0.00067650824,0.00009328688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013832301,0.001592779,0.0017251273,0.0038853881,0.0010919954,0.0020866306,0.0023159082,0.0012072392,0.010678352],"category_scores_gemma":[0.0035205702,0.00071366574,0.0016470678,0.003165171,0.00045752001,0.002067799,0.0023022417,0.0018091627,0.011047617],"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.0002683489,0.00009094135,0.00072506873,0.00017784459,0.000083505336,0.00005517913,0.00006955288,0.0072406377,0.014228545,0.00601918,0.018910492,0.95213073],"study_design_scores_gemma":[0.00010051141,0.000103661245,0.0026812514,0.000052920448,0.00008144523,0.00034735663,0.00012898857,0.9038341,0.02671131,0.047034908,0.018847572,0.00007606836],"about_ca_topic_score_codex":0.002277684,"about_ca_topic_score_gemma":0.002763142,"teacher_disagreement_score":0.010678352,"about_ca_system_score_codex":0.00052080216,"about_ca_system_score_gemma":0.0012394276,"threshold_uncertainty_score":0.035722613},"labels":[],"label_agreement":null},{"id":"W1571002167","doi":"10.1007/11548669_22","title":"Feature Selection with Adjustable Criteria","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Parameterized complexity; Heuristic; Rough set; Set (abstract data type); Feature selection; Feature (linguistics); Artificial intelligence; Selection (genetic algorithm); Data mining; Pattern recognition (psychology); Machine learning; Algorithm","score_opus":0.013408701999536922,"score_gpt":0.2352870181455787,"score_spread":0.22187831614604178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571002167","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.015551478,0.0005814502,0.9810674,0.00007246226,0.000068194146,0.000062671046,0.00008297641,0.00048286776,0.0020305195],"genre_scores_gemma":[0.45664686,0.00044425728,0.5353283,0.000106831205,0.00018355943,0.0003014162,0.0006399709,0.00028194956,0.0060668304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869835,0.00043362568,0.00010545206,0.00021787419,0.0004507837,0.00009390333],"domain_scores_gemma":[0.9985253,0.0008338929,0.00006645195,0.00024647688,0.0002884689,0.000039446117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002044997,0.0007982475,0.0015887923,0.0014398579,0.00043545538,0.0012160422,0.0014805413,0.0008895488,0.0029704846],"category_scores_gemma":[0.00464403,0.00036812402,0.0011560434,0.0023960639,0.0004252396,0.0011580191,0.0013032858,0.0007958653,0.0008138659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061716395,0.00012494042,0.000927673,0.00029180935,0.0002559019,0.00020059799,0.00006103761,0.12163221,0.01591028,0.013804384,0.0069874395,0.83918655],"study_design_scores_gemma":[0.000057623554,0.00013858746,0.0008652486,0.000023814553,0.000061945044,0.0001518022,0.000012359989,0.978079,0.005932688,0.012086753,0.0025662435,0.000024033261],"about_ca_topic_score_codex":0.00047509064,"about_ca_topic_score_gemma":0.00046788366,"teacher_disagreement_score":0.0029704846,"about_ca_system_score_codex":0.0002905207,"about_ca_system_score_gemma":0.00031966102,"threshold_uncertainty_score":0.010815084},"labels":[],"label_agreement":null},{"id":"W1571003205","doi":"10.1007/978-3-540-30126-4_24","title":"Novel Adaptive Filtering for Salt-and-Pepper Noise Removal from Binary Document Images","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Western University","funders":"","keywords":"Pepper; Salt-and-pepper noise; Noise (video); Salt (chemistry); Binary number; Computer science; Artificial intelligence; Median filter; Horticulture; Mathematics; Biology; Chemistry; Image processing; Image (mathematics); Arithmetic","score_opus":0.025758846434136024,"score_gpt":0.2742788127858854,"score_spread":0.24851996635174936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571003205","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.011983758,0.00080544845,0.98478556,0.00009922669,0.00015305913,0.000035065314,0.00004728888,0.0006349705,0.0014556232],"genre_scores_gemma":[0.059265524,0.0012084587,0.9306454,0.00014304617,0.00016935004,0.0000585315,0.0002241041,0.000113943504,0.008171621],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955803,0.000042694635,0.000029256888,0.00007971709,0.00025774693,0.000032540636],"domain_scores_gemma":[0.9994041,0.00020054876,0.000045803023,0.000082172664,0.0002381353,0.000029350353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129223,0.0009218433,0.0007438,0.0006989717,0.00034804438,0.0007341064,0.0011194347,0.0011835442,0.0027360262],"category_scores_gemma":[0.00094546814,0.00039119,0.00078156864,0.0008769054,0.00040550478,0.00093726104,0.00063836103,0.000846154,0.0018086996],"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.00036332133,0.0001340515,0.0002934487,0.000261394,0.000073038056,0.00017426998,0.00006292342,0.006786811,0.49386626,0.003259029,0.003021726,0.49170372],"study_design_scores_gemma":[0.00005499181,0.00031342925,0.00199095,0.000044144323,0.00018431318,0.0016354289,0.000038838705,0.5281556,0.44901487,0.0024225835,0.016072487,0.00007241108],"about_ca_topic_score_codex":0.0010654579,"about_ca_topic_score_gemma":0.0027007216,"teacher_disagreement_score":0.0027360262,"about_ca_system_score_codex":0.00028587884,"about_ca_system_score_gemma":0.0004014979,"threshold_uncertainty_score":0.009152949},"labels":[],"label_agreement":null},{"id":"W1571024671","doi":"10.1007/978-3-642-29863-9_6","title":"Using Design Science Research to Develop a Modeling Technique for Service Design","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service and Product Innovation","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 Toronto","funders":"","keywords":"Computer science; Service (business); Software engineering; Service design; Systems engineering; Service delivery framework; Engineering","score_opus":0.2769027820723556,"score_gpt":0.36321651615132317,"score_spread":0.08631373407896759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571024671","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.0015731152,0.00015808568,0.9894572,0.00041750702,0.000037073016,0.0001426621,0.00004871706,0.00011685657,0.008048799],"genre_scores_gemma":[0.077953845,0.0005949779,0.9151603,0.00020818254,0.000033839104,0.0009206194,0.00012780649,0.000116488605,0.0048839506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535733,0.0028346744,0.0002776992,0.00032045724,0.0010585831,0.00015133836],"domain_scores_gemma":[0.9935515,0.0050804904,0.00020735586,0.000485622,0.00059208315,0.0000829552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056579844,0.0016249717,0.0008387711,0.003034459,0.0013457187,0.0032014195,0.0016607224,0.0017484449,0.006586707],"category_scores_gemma":[0.009004905,0.0010374844,0.0026875534,0.0021246457,0.0031355957,0.0033355402,0.0016205282,0.0032681713,0.0011554599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016010967,0.000075342396,0.00044033356,0.00044939536,0.000056818997,0.000105034684,0.0012583613,0.041051667,0.0010591297,0.90881157,0.0018384993,0.04483781],"study_design_scores_gemma":[0.000059241545,0.00016110939,0.00030093975,0.00037251433,0.00013082483,0.00030774978,0.0007078603,0.20618959,0.0030284352,0.70081824,0.08787664,0.00004686615],"about_ca_topic_score_codex":0.00442271,"about_ca_topic_score_gemma":0.004991059,"teacher_disagreement_score":0.006586707,"about_ca_system_score_codex":0.0039191735,"about_ca_system_score_gemma":0.0030740702,"threshold_uncertainty_score":0.029922664},"labels":[],"label_agreement":null},{"id":"W1571203384","doi":"10.1007/3-540-45661-9_21","title":"Compression and Information Leakage of Plaintext","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Plaintext; Byte; Computer science; Cryptosystem; Ciphertext; Information leakage; Encryption; Cryptography; Side channel attack; Computer security; Theoretical computer science; Arithmetic; Algorithm; Computer hardware; Mathematics","score_opus":0.01465318112726333,"score_gpt":0.24424403187736862,"score_spread":0.2295908507501053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571203384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078038216,0.027703688,0.69166,0.00519197,0.0013923999,0.00020173755,0.00037592612,0.0009895347,0.19444656],"genre_scores_gemma":[0.8352965,0.018113298,0.069150634,0.0008203833,0.0014213307,0.00017982586,0.0004011304,0.00032424516,0.074292555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984688,0.00036857315,0.000072478004,0.00015284184,0.0007876554,0.0001496809],"domain_scores_gemma":[0.996967,0.0016852432,0.00015929145,0.0009596733,0.00018911024,0.000039704584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096226303,0.0008567317,0.000849344,0.0014290478,0.00055926753,0.0024876439,0.0008689418,0.001505403,0.0069164853],"category_scores_gemma":[0.0054695704,0.0005852696,0.0006452239,0.0018962801,0.0029512083,0.0061804154,0.0018592832,0.0024464047,0.0016683693],"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.00017458032,0.000044954188,0.00028365926,0.00027604515,0.000030100848,0.00039491893,0.00031655055,0.009716859,0.0062653944,0.8828456,0.005143045,0.09450839],"study_design_scores_gemma":[0.000020063579,0.00008301027,0.00028730693,0.00011507559,0.00003028369,0.0014162427,0.0000637691,0.029818011,0.021513341,0.9296047,0.01701263,0.000035466488],"about_ca_topic_score_codex":0.00013544042,"about_ca_topic_score_gemma":0.000087092514,"teacher_disagreement_score":0.0069164853,"about_ca_system_score_codex":0.0007990196,"about_ca_system_score_gemma":0.00046466835,"threshold_uncertainty_score":0.023137987},"labels":[],"label_agreement":null},{"id":"W1571268740","doi":"10.1007/978-3-642-04271-3_46","title":"Heart Motion Abnormality Detection via an Information Measure and Bayesian Filtering","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiovascular Health and Disease Prevention","field":"Medicine","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":"Western University; St Joseph's Health Care; London Health Sciences Centre; CARE Canada","funders":"","keywords":"Abnormality; Artificial intelligence; Computer science; Entropy (arrow of time); Pattern recognition (psychology); Kalman filter; Segmentation; Measure (data warehouse); Bayesian probability; Computer vision; Data mining; Physics","score_opus":0.009356055117545675,"score_gpt":0.26123788394640074,"score_spread":0.25188182882885507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571268740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011320955,0.0003872115,0.9872525,0.00023999075,0.000032424126,0.000025299109,0.000076162956,0.00015030359,0.000515224],"genre_scores_gemma":[0.43130282,0.00088164705,0.5633853,0.0003070807,0.0003613445,0.00017640316,0.0005602463,0.000088749235,0.0029363472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789584,0.0005522343,0.00018736471,0.000513267,0.0007064832,0.00014478808],"domain_scores_gemma":[0.994932,0.0037696965,0.00030959258,0.0002669224,0.0006144627,0.00010735793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036998843,0.00076377287,0.002437092,0.0032480315,0.0007621606,0.0019990536,0.0014474867,0.001810854,0.001377961],"category_scores_gemma":[0.012505382,0.00081242196,0.0017939814,0.0017914984,0.0009520135,0.002712238,0.001547875,0.0013271,0.00047083653],"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.00085354765,0.00047666283,0.007654429,0.00039769016,0.0005651611,0.00021674749,0.00017618202,0.19973405,0.01709818,0.053496987,0.0035980812,0.7157322],"study_design_scores_gemma":[0.00003200741,0.00012630426,0.0032232616,0.00002733137,0.000103653685,0.00014886382,0.0000114218265,0.97570246,0.0033226022,0.01645826,0.0007957965,0.00004788276],"about_ca_topic_score_codex":0.005235843,"about_ca_topic_score_gemma":0.004784041,"teacher_disagreement_score":0.005235843,"about_ca_system_score_codex":0.0010951739,"about_ca_system_score_gemma":0.0014809121,"threshold_uncertainty_score":0.019567072},"labels":[],"label_agreement":null},{"id":"W1571310638","doi":"10.1007/11423355_10","title":"Modelling Flexible Social Commitments and Their Enforcement","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Enforcement; Business; Political science; Law","score_opus":0.04182271812560895,"score_gpt":0.26026735609082924,"score_spread":0.2184446379652203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571310638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053889297,0.00043557285,0.8943946,0.0020058586,0.0002044811,0.00011179354,0.00021611499,0.000415682,0.04832658],"genre_scores_gemma":[0.8350794,0.0005068382,0.13160717,0.00016383709,0.00013218589,0.00034165737,0.0003171543,0.00028633984,0.031565353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977223,0.0009833125,0.0001749221,0.0003314984,0.00047196593,0.00031589018],"domain_scores_gemma":[0.9896443,0.0071456074,0.0008665824,0.0012910655,0.0006093843,0.00044315797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040927804,0.0008037086,0.0009787458,0.0010067885,0.001649191,0.0053788754,0.0038282569,0.0028858974,0.011184933],"category_scores_gemma":[0.02082244,0.001436841,0.001254656,0.0017703688,0.0044311034,0.007868834,0.0039653876,0.0044677607,0.0010433681],"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.0000351629,0.000027077878,0.00017213858,0.000030035775,0.0000140086595,0.000119021955,0.00027149727,0.08873445,0.0002369315,0.9031361,0.0007163213,0.006507253],"study_design_scores_gemma":[0.000020168536,0.0000092431765,0.00005192283,0.000012225243,0.0000076209576,0.000025592568,0.00010076779,0.30784792,0.00015261522,0.68989396,0.0018648749,0.000013191299],"about_ca_topic_score_codex":0.005649632,"about_ca_topic_score_gemma":0.0048583946,"teacher_disagreement_score":0.011184933,"about_ca_system_score_codex":0.0021629024,"about_ca_system_score_gemma":0.0015295569,"threshold_uncertainty_score":0.037417293},"labels":[],"label_agreement":null},{"id":"W1571329508","doi":"10.1007/978-3-540-89197-0_71","title":"Probabilistic Nogood Store as a Heuristic","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Probabilistic logic; Computer science; Heuristic; Binary number; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics","score_opus":0.018029281322692662,"score_gpt":0.23571535280376482,"score_spread":0.21768607148107216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571329508","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.025003316,0.00077968714,0.9402479,0.0010199976,0.00038260588,0.00017338224,0.00040166063,0.0025761584,0.02941534],"genre_scores_gemma":[0.32756218,0.0005745837,0.644803,0.00031602633,0.00020626136,0.00021115111,0.00056874164,0.0008773007,0.024880702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986904,0.00034913307,0.000075814074,0.00022482684,0.00048122273,0.00017857943],"domain_scores_gemma":[0.99624455,0.001946291,0.0001162679,0.0011295028,0.00040350054,0.00015982674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017625735,0.00077277276,0.0016788298,0.001485158,0.0020849332,0.0030661456,0.004514404,0.0017531934,0.019072842],"category_scores_gemma":[0.0075759897,0.0008442928,0.001415647,0.0025874095,0.0014541473,0.0057323496,0.002287331,0.0024423967,0.0019169654],"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.000676064,0.00032015078,0.0004142352,0.00031791136,0.00010171126,0.00013066114,0.00018226444,0.18378387,0.0025839393,0.5564587,0.023485128,0.23154539],"study_design_scores_gemma":[0.000067763336,0.000065314205,0.00007868801,0.00003509242,0.00008076472,0.00015112816,0.000051987972,0.47817472,0.002221224,0.5097593,0.009269498,0.00004450806],"about_ca_topic_score_codex":0.0043614334,"about_ca_topic_score_gemma":0.009804672,"teacher_disagreement_score":0.019072842,"about_ca_system_score_codex":0.0019081478,"about_ca_system_score_gemma":0.003648508,"threshold_uncertainty_score":0.063804984},"labels":[],"label_agreement":null},{"id":"W1571429055","doi":"10.1007/978-3-540-73208-2_22","title":"State Complexity of Union and Intersection of Finite Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Intersection (aeronautics); Alphabet; Finite-state machine; Regular language; Upper and lower bounds; Deterministic finite automaton; Automaton; State (computer science); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.02657055417739969,"score_gpt":0.26644678083795076,"score_spread":0.23987622666055108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571429055","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.7577622,0.0011733868,0.18726012,0.00346378,0.000101451995,0.00009751771,0.0017717131,0.00061531196,0.047754433],"genre_scores_gemma":[0.98185235,0.00035912605,0.011014953,0.00008533962,0.00014049743,0.00010619715,0.00082993356,0.00015414505,0.0054573463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961314,0.0008860928,0.00025580582,0.0006677388,0.0014352342,0.00062373135],"domain_scores_gemma":[0.9529844,0.039934322,0.0015905746,0.0026111482,0.0016059724,0.0012734832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025974086,0.0005703116,0.0016283588,0.0020049529,0.002435721,0.010253842,0.0027312122,0.0021226793,0.01140567],"category_scores_gemma":[0.023015281,0.0012647706,0.0020810696,0.0029577578,0.0046492214,0.021116111,0.0036328614,0.005658312,0.0006503022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003297972,0.00009237944,0.0023823746,0.000120471144,0.00004037911,0.00009596309,0.0009806431,0.027092727,0.0015105037,0.9525838,0.0020841379,0.012686824],"study_design_scores_gemma":[0.000023331637,0.000019118715,0.00078539003,0.000014559713,0.000026254487,0.00006590716,0.0001474661,0.09440851,0.001322983,0.9024247,0.00073498604,0.000026637612],"about_ca_topic_score_codex":0.0035626446,"about_ca_topic_score_gemma":0.0028998991,"teacher_disagreement_score":0.01140567,"about_ca_system_score_codex":0.00431187,"about_ca_system_score_gemma":0.0025396647,"threshold_uncertainty_score":0.038155794},"labels":[],"label_agreement":null},{"id":"W1571431008","doi":"10.1007/978-3-540-77129-6_26","title":"Measuring Linearity of Ordered Point Sets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linearity; Monotonic function; Mathematics; Measure (data warehouse); Point (geometry); Set (abstract data type); Invariant (physics); Translation (biology); Binary number; Algorithm; Scaling; Statistics; Mathematical analysis; Geometry; Computer science; Data mining; Arithmetic","score_opus":0.05293067006736547,"score_gpt":0.28534508847323603,"score_spread":0.23241441840587057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571431008","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.44084308,0.0007336039,0.5447699,0.0002042352,0.000047325273,0.00009313706,0.00044628512,0.00072066317,0.012141743],"genre_scores_gemma":[0.91769344,0.0003542609,0.07868461,0.000045887442,0.00006434158,0.000089826375,0.0007791943,0.00009736985,0.0021911568],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99566096,0.0009931255,0.0002906351,0.00083940726,0.0018927875,0.00032305284],"domain_scores_gemma":[0.9790492,0.013617006,0.0013989906,0.0026122765,0.0025499305,0.0007726034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021223794,0.00062308245,0.00094456057,0.0034374094,0.0006915557,0.0026893253,0.0015880149,0.0007245271,0.0035011102],"category_scores_gemma":[0.015056213,0.000732666,0.000786292,0.0025286123,0.0032310495,0.005496967,0.003343042,0.0016694162,0.0008655657],"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.0019242212,0.0005525566,0.08791831,0.0011341433,0.0004520538,0.0006538734,0.004247756,0.07523644,0.10718138,0.33192974,0.0030063335,0.3857633],"study_design_scores_gemma":[0.00009146459,0.0018779017,0.053595535,0.00024214279,0.00029900216,0.001784699,0.004759186,0.39516753,0.098355986,0.4361808,0.0073802904,0.00026545735],"about_ca_topic_score_codex":0.00119957,"about_ca_topic_score_gemma":0.0010087447,"teacher_disagreement_score":0.0035011102,"about_ca_system_score_codex":0.0010039241,"about_ca_system_score_gemma":0.0007183689,"threshold_uncertainty_score":0.011712432},"labels":[],"label_agreement":null},{"id":"W1571472016","doi":"10.1007/978-3-642-13520-0_23","title":"Automated Configuration of Mixed Integer Programming Solvers","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":152,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parameterized complexity; Integer programming; Domain (mathematical analysis); Integer (computer science); Process (computing); Linear programming; Mathematical optimization; Algorithm; Programming language; Mathematics","score_opus":0.010024461372100958,"score_gpt":0.22529298347494742,"score_spread":0.21526852210284647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571472016","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.018030154,0.0004420224,0.9265728,0.00034749354,0.000276349,0.0002191555,0.00057122955,0.025844004,0.027696824],"genre_scores_gemma":[0.20035236,0.00024274662,0.784394,0.00022437915,0.000080573605,0.00046951644,0.0023516896,0.0036644281,0.008220248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720216,0.0011607091,0.00019913886,0.00040530445,0.0007137595,0.0003189452],"domain_scores_gemma":[0.9948026,0.0022790036,0.00020536594,0.0018747484,0.000681008,0.0001572223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002098224,0.0015442976,0.0012723635,0.0013724602,0.0011785177,0.003827026,0.0038550007,0.0011463473,0.025943726],"category_scores_gemma":[0.009614418,0.0018782117,0.0010173692,0.001391144,0.00086209463,0.0038888406,0.0037870817,0.0024017813,0.0072743627],"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.0012993946,0.00047395175,0.0017846439,0.0005193201,0.000166475,0.0005153991,0.00042326958,0.2043079,0.021352887,0.07176457,0.04366113,0.6537311],"study_design_scores_gemma":[0.00010808587,0.000059974333,0.00027784082,0.00007010827,0.000034312863,0.00010767218,0.00009783928,0.9037703,0.019455742,0.05204313,0.023938568,0.000036358964],"about_ca_topic_score_codex":0.0013513165,"about_ca_topic_score_gemma":0.0020103748,"teacher_disagreement_score":0.025943726,"about_ca_system_score_codex":0.0009501006,"about_ca_system_score_gemma":0.0018178793,"threshold_uncertainty_score":0.08679038},"labels":[],"label_agreement":null},{"id":"W1571491801","doi":"10.1007/11734680_9","title":"Agent-Based Geo-simulation to Support Human Planning and Spatial Cognition","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Complementarity (molecular biology); Strengths and weaknesses; Cognition; Spatial cognition; Space (punctuation); Software; Human–computer interaction; Software agent; Artificial intelligence; Data science; Epistemology","score_opus":0.03590709385002249,"score_gpt":0.311467009854992,"score_spread":0.2755599160049695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571491801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047272135,0.00029508982,0.9297147,0.00039273573,0.00016565782,0.00009706533,0.00042938712,0.003739398,0.017893858],"genre_scores_gemma":[0.71727,0.00042118417,0.27207288,0.000089130685,0.000026862164,0.00018056238,0.0006089013,0.00027347356,0.009056973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999201,0.00002632769,0.0000060743455,0.000014362852,0.000026776872,0.0000062417744],"domain_scores_gemma":[0.9996679,0.0001906885,0.000013658698,0.00004011812,0.000059093618,0.000028504306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022760256,0.0004789433,0.00045333238,0.00025281362,0.00038401468,0.00086913514,0.0012687927,0.0007521764,0.005411189],"category_scores_gemma":[0.0009890986,0.00035901836,0.00040205094,0.00028724517,0.00041020004,0.00079812855,0.00079918676,0.0007938694,0.0006801906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087539425,0.000078791236,0.0005430859,0.00006845292,0.000048844922,0.00011410653,0.00017422083,0.94657403,0.0034118085,0.023548609,0.002694719,0.02265585],"study_design_scores_gemma":[0.000013136585,0.000009767785,0.000058772326,0.000005025494,0.0000096076965,0.000015833857,0.000011334395,0.98872304,0.0010718681,0.006895293,0.0031823725,0.0000039879556],"about_ca_topic_score_codex":0.009063667,"about_ca_topic_score_gemma":0.010564969,"teacher_disagreement_score":0.009063667,"about_ca_system_score_codex":0.00048438922,"about_ca_system_score_gemma":0.0006769897,"threshold_uncertainty_score":0.018102169},"labels":[],"label_agreement":null},{"id":"W1571515433","doi":"10.1007/3-540-45417-9_47","title":"Parallelization of Characteristics Solvers for 3D Neutron Transport","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nuclear reactor physics and engineering","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Neutron transport; Acceleration; Computational science; Tracing; Parallel computing; Software; Context (archaeology); Ray tracing (physics); Neutron; Decomposition; Implementation; Track (disk drive); Algorithm; Distributed computing; Programming language; Operating system; Nuclear physics; Physics; Geology; Optics","score_opus":0.010163035224272027,"score_gpt":0.1961070721266246,"score_spread":0.18594403690235256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571515433","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.046998065,0.00039044372,0.9221559,0.0004132636,0.00018058687,0.00012389639,0.000454388,0.007493485,0.021790076],"genre_scores_gemma":[0.4007295,0.0003007219,0.58348256,0.00025018502,0.00010511631,0.0003114351,0.0010961335,0.0031830214,0.0105412975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962115,0.00008991523,0.000023966046,0.000051704,0.00015910862,0.000054131815],"domain_scores_gemma":[0.99906653,0.00044058517,0.00007268834,0.00015573818,0.00020714861,0.000057429468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000477539,0.0010645732,0.001020006,0.000582755,0.0008776673,0.001247641,0.0020897158,0.0010932377,0.010351242],"category_scores_gemma":[0.0018813064,0.0008470442,0.0010288424,0.0009525056,0.00064911984,0.0012008018,0.0015287494,0.001264996,0.0018158642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042814616,0.00020117039,0.0012791724,0.00030685414,0.00013141453,0.00022913967,0.000334106,0.76274824,0.015882466,0.0392261,0.015920643,0.16331261],"study_design_scores_gemma":[0.000052796233,0.00001234959,0.000083603394,0.0000050628028,0.000005792427,0.000026580903,0.000018984887,0.98788595,0.002945635,0.0066317883,0.0023247844,0.0000066625744],"about_ca_topic_score_codex":0.0062534614,"about_ca_topic_score_gemma":0.011405191,"teacher_disagreement_score":0.010351242,"about_ca_system_score_codex":0.00094572536,"about_ca_system_score_gemma":0.0011915596,"threshold_uncertainty_score":0.03462833},"labels":[],"label_agreement":null},{"id":"W1571586323","doi":"10.1007/978-3-642-04342-0_27","title":"Traffic Behaviour Characterization Using NetMate","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Interactivity; Insider threat; Intrusion detection system; Process (computing); Insider; Computer security; Intrusion; Simple (philosophy); Data science; World Wide Web","score_opus":0.01689774544999082,"score_gpt":0.24060151551238232,"score_spread":0.2237037700623915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571586323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3390948,0.0002650131,0.5879392,0.00010743186,0.000100641664,0.00025481955,0.0100923665,0.038577557,0.023568189],"genre_scores_gemma":[0.84786177,0.00015150514,0.13016167,0.000035791832,0.000027241409,0.00018160066,0.008358996,0.0009519496,0.012269437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980825,0.000027216984,0.000019966625,0.000041886917,0.000078277604,0.000024326426],"domain_scores_gemma":[0.99937963,0.00021824664,0.00007904505,0.0001044462,0.00018608222,0.000032580287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026661588,0.0004443323,0.00038129083,0.003017503,0.00028395752,0.0009070794,0.0004161413,0.0002822011,0.010000476],"category_scores_gemma":[0.0009616562,0.00019419205,0.0002805272,0.0015395735,0.00015358129,0.000830021,0.0003073487,0.000245671,0.001889802],"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.0012079254,0.00056265265,0.04805162,0.0004814891,0.0001741179,0.0004908194,0.00043994837,0.1299066,0.11868265,0.0156060355,0.016680866,0.6677154],"study_design_scores_gemma":[0.000016334841,0.0001468541,0.019605359,0.000023740005,0.00003743599,0.0004612745,0.00009161395,0.9092235,0.05544434,0.002947321,0.011947687,0.000054477776],"about_ca_topic_score_codex":0.0016370635,"about_ca_topic_score_gemma":0.00216484,"teacher_disagreement_score":0.010000476,"about_ca_system_score_codex":0.00034940627,"about_ca_system_score_gemma":0.00019395092,"threshold_uncertainty_score":0.033454895},"labels":[],"label_agreement":null},{"id":"W157162546","doi":"10.1007/978-3-642-33509-9_12","title":"Application of Driver-in-the-Loop Real-Time Simulations to the Design of SUV Differential Braking Controllers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Dynamics and Control Systems","field":"Engineering","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":"Ontario Tech University","funders":"","keywords":"Computer science; Controller (irrigation); Control theory (sociology); Differential (mechanical device); Vehicle dynamics; Braking system; Simulation; Automotive engineering; Control (management); Brake; Engineering; Artificial intelligence","score_opus":0.009166689482237983,"score_gpt":0.2103289406139812,"score_spread":0.2011622511317432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157162546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18303457,0.0003685722,0.7842875,0.00018395028,0.00009568878,0.00015488705,0.0001497402,0.0018733455,0.029851822],"genre_scores_gemma":[0.9385279,0.0001629672,0.058032587,0.000023087403,0.000007720579,0.000089066045,0.000095633135,0.00013284908,0.0029282821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998716,0.000048115064,0.0000073994793,0.000012156173,0.000047414982,0.000013236994],"domain_scores_gemma":[0.999303,0.00044788036,0.00003372851,0.00005258629,0.0001448209,0.000017985229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038300798,0.0005428096,0.00043068168,0.0002204844,0.00030389597,0.0005362194,0.00075435895,0.00062326685,0.0030906056],"category_scores_gemma":[0.001227819,0.00034740177,0.000345002,0.00015828582,0.00022551027,0.0003143921,0.00030728042,0.0005784175,0.0002987569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046555895,0.000048821574,0.00034450725,0.000066301225,0.000013624727,0.00004151867,0.000080837424,0.97888625,0.004122746,0.0016697058,0.0002556385,0.014423453],"study_design_scores_gemma":[0.0000061291084,0.000021229329,0.000055603636,0.0000035119892,0.000002485526,0.000005940275,0.0000073123374,0.99765223,0.0014192192,0.00034921546,0.00047469433,0.000002382703],"about_ca_topic_score_codex":0.0047493814,"about_ca_topic_score_gemma":0.003706374,"teacher_disagreement_score":0.0047493814,"about_ca_system_score_codex":0.00031186594,"about_ca_system_score_gemma":0.0005165105,"threshold_uncertainty_score":0.010339141},"labels":[],"label_agreement":null},{"id":"W1571653778","doi":"10.1007/978-3-642-16561-0_32","title":"Design Choices for High-Confidence Distributed Real-Time Software","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Control reconfiguration; Resource (disambiguation); Reservation; Predictability; Distributed computing; Dependency (UML); Architecture; Systems design; Software engineering; Embedded system; Computer network","score_opus":0.01856621854428506,"score_gpt":0.24723183415086622,"score_spread":0.22866561560658116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571653778","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.012161713,0.0006013578,0.977485,0.00027327446,0.00007089211,0.000038751798,0.00003083799,0.0007553752,0.008582766],"genre_scores_gemma":[0.5121217,0.0005987082,0.4753576,0.00024060329,0.000067661385,0.00014473176,0.00009714838,0.00050653866,0.010865455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800295,0.00046985783,0.00013512946,0.0002441969,0.00097863,0.00016913122],"domain_scores_gemma":[0.9977709,0.0010076588,0.0001817156,0.00045465506,0.0004960147,0.00008905318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002297328,0.00089689065,0.00047989728,0.0005457896,0.00052536547,0.0019092808,0.0016000132,0.0012203808,0.0072941445],"category_scores_gemma":[0.007078348,0.0007863449,0.0005488273,0.00043641886,0.00073112984,0.0020465478,0.0010918493,0.001634356,0.0020060255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006531983,0.00014131037,0.0012764509,0.0007771352,0.000116720505,0.00041578134,0.0006841826,0.12785372,0.06280434,0.43085238,0.005896803,0.36852792],"study_design_scores_gemma":[0.00021747823,0.00048078096,0.00043417793,0.00021153949,0.00016685849,0.0006889553,0.00019488097,0.5232601,0.059244707,0.36816874,0.046853427,0.00007831134],"about_ca_topic_score_codex":0.00021593933,"about_ca_topic_score_gemma":0.00058178965,"teacher_disagreement_score":0.0072941445,"about_ca_system_score_codex":0.0005818997,"about_ca_system_score_gemma":0.00040398305,"threshold_uncertainty_score":0.024401367},"labels":[],"label_agreement":null},{"id":"W1571679273","doi":"10.1007/978-3-642-02611-9_85","title":"A New Fuzzy Hierarchical Classification Based on SVM for Text Categorization","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Artificial intelligence; Support vector machine; Machine learning; Categorization; Preprocessor; Fuzzy logic; Classifier (UML); Data mining; Pattern recognition (psychology); Text categorization","score_opus":0.02621470035049042,"score_gpt":0.2659694151321511,"score_spread":0.2397547147816607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571679273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020003222,0.0010852205,0.9725782,0.00015235392,0.00042688556,0.00015334792,0.00044475327,0.0026270517,0.002528855],"genre_scores_gemma":[0.21190517,0.00058608974,0.7752225,0.0002209041,0.0003290178,0.00027792997,0.0015132797,0.0001592974,0.009785757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988391,0.0001529478,0.000094192925,0.00024428568,0.0005780679,0.000091374],"domain_scores_gemma":[0.9992156,0.00019161082,0.00003851444,0.000081279184,0.00042559762,0.00004738329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084956904,0.0005268762,0.0012232979,0.0016599788,0.0007214476,0.0009539957,0.0012236388,0.00080240465,0.004125255],"category_scores_gemma":[0.001298583,0.00026180138,0.0009214582,0.0014855278,0.00023509815,0.0016542013,0.00074527046,0.00076455896,0.001979306],"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.00028568474,0.00017745812,0.0011651131,0.00018536221,0.00012071266,0.00006365619,0.000053872427,0.007425471,0.033341188,0.0031057445,0.009460842,0.94461477],"study_design_scores_gemma":[0.000059301306,0.00025772926,0.0040140697,0.00004449424,0.00014220625,0.00029488365,0.000059526647,0.94917357,0.026195187,0.006139986,0.01355906,0.000059921644],"about_ca_topic_score_codex":0.0034912291,"about_ca_topic_score_gemma":0.0041205566,"teacher_disagreement_score":0.004125255,"about_ca_system_score_codex":0.00061585737,"about_ca_system_score_gemma":0.0007420675,"threshold_uncertainty_score":0.013800383},"labels":[],"label_agreement":null},{"id":"W1571758526","doi":"10.1007/3-540-44651-6_19","title":"Using Mobile Agents for Managing Control and Alarms in Urban Infrastructures","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Sewerage; Context (archaeology); Process (computing); Control (management); Set (abstract data type); Real-time computing; Process management; Artificial intelligence; Engineering","score_opus":0.024309469549534665,"score_gpt":0.2717681657430072,"score_spread":0.24745869619347255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571758526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099108666,0.0066539682,0.818193,0.0013796915,0.00067988987,0.00013236287,0.0000779302,0.0021682496,0.071606204],"genre_scores_gemma":[0.830783,0.0024678854,0.13937424,0.0001826911,0.00016441768,0.00009076181,0.000091776434,0.00013918076,0.026706021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997205,0.00008815714,0.000015915562,0.000036916386,0.000101880134,0.000036575657],"domain_scores_gemma":[0.99961424,0.00022028567,0.000047291607,0.000039676972,0.00004899639,0.000029532926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004502613,0.00047575636,0.00029173616,0.00050865783,0.00060337916,0.0019804556,0.0008010566,0.00124976,0.0019543187],"category_scores_gemma":[0.0010814442,0.0003692554,0.00028303263,0.000549531,0.00048495422,0.0015158795,0.00072881783,0.00075075385,0.00047587723],"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.00040718057,0.00017509129,0.0021625154,0.0005369358,0.00012858139,0.0015982758,0.0024711394,0.14126042,0.04839942,0.16341548,0.017378157,0.62206674],"study_design_scores_gemma":[0.000098506105,0.000382288,0.0019046136,0.00019680029,0.00024689938,0.0012356406,0.0012321022,0.61681134,0.045102265,0.086239524,0.24642769,0.00012222941],"about_ca_topic_score_codex":0.0010265406,"about_ca_topic_score_gemma":0.0017054237,"teacher_disagreement_score":0.0019804556,"about_ca_system_score_codex":0.00035843393,"about_ca_system_score_gemma":0.00025305984,"threshold_uncertainty_score":0.0065378547},"labels":[],"label_agreement":null},{"id":"W1571803718","doi":"10.1007/11671299_9","title":"Automatically Determining Allowable Combinations of a Class of Flexible Multiword Expressions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Toronto","funders":"","keywords":"Computer science; Measure (data warehouse); Class (philosophy); Collocation (remote sensing); Natural language processing; Simple (philosophy); Artificial intelligence; Noun; Machine learning; Data mining","score_opus":0.01519254296208463,"score_gpt":0.27374078839029903,"score_spread":0.2585482454282144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571803718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31558606,0.0009078958,0.6453988,0.0006536074,0.00025474408,0.00048051303,0.005097212,0.014615454,0.017005742],"genre_scores_gemma":[0.51948637,0.00035969884,0.46357092,0.0002190418,0.000113836475,0.0003710081,0.0076303887,0.0033002628,0.004948497],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773717,0.00035609095,0.00029957053,0.00083744497,0.0005324383,0.00023723487],"domain_scores_gemma":[0.99445254,0.003432993,0.00040689026,0.00062564475,0.00085297256,0.00022902818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157923,0.0015585879,0.0012587917,0.0027873327,0.0015571624,0.0021419944,0.001823065,0.0015947432,0.008983289],"category_scores_gemma":[0.0061357445,0.0013825762,0.0017951893,0.0020082921,0.00096528075,0.0053605903,0.002617142,0.0021430005,0.002755495],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015652353,0.00045448038,0.014860729,0.0014187142,0.0003380178,0.0052213413,0.0018022467,0.0105659785,0.17102955,0.06507118,0.02366299,0.7040095],"study_design_scores_gemma":[0.00024670572,0.0007251834,0.012027149,0.000618289,0.0007536103,0.009747488,0.0039775507,0.4159729,0.19367313,0.2690987,0.092737146,0.00042223476],"about_ca_topic_score_codex":0.0011472098,"about_ca_topic_score_gemma":0.002374111,"teacher_disagreement_score":0.008983289,"about_ca_system_score_codex":0.00052001217,"about_ca_system_score_gemma":0.0010876625,"threshold_uncertainty_score":0.030052066},"labels":[],"label_agreement":null},{"id":"W1571835199","doi":"10.1007/978-3-540-68123-6_33","title":"Effectiveness of Fuzzy Discretization for Class Association Rule-Based Classification","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Calgary","funders":"","keywords":"Association rule learning; Classifier (UML); Data mining; Artificial intelligence; Fuzzy logic; Computer science; Machine learning; Discretization; Pattern recognition (psychology); Support vector machine; Fuzzy set; Feature vector; Fuzzy rule; Fuzzy classification; Mathematics","score_opus":0.019167794810366085,"score_gpt":0.2594617264196813,"score_spread":0.2402939316093152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571835199","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.14603533,0.004038007,0.83701384,0.0007583891,0.00037013987,0.0001233539,0.0005164421,0.00083847606,0.010306054],"genre_scores_gemma":[0.68955415,0.0009422242,0.30704588,0.00016798267,0.00014400377,0.00006558939,0.0004752109,0.000054600205,0.0015503267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996932,0.00119806,0.00020951213,0.00031968454,0.0012364724,0.00010422518],"domain_scores_gemma":[0.98482186,0.012158605,0.0002710491,0.0013255137,0.0012608351,0.00016211203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003902969,0.00044230997,0.001067349,0.0013384082,0.0005583631,0.0018912058,0.0010073123,0.00091109244,0.0016782377],"category_scores_gemma":[0.014895598,0.00024196923,0.0005249467,0.0012012286,0.0005433526,0.0017135964,0.0007567966,0.0008199704,0.00037784895],"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.0015639116,0.00032308523,0.005924676,0.0003678692,0.00021294311,0.00020765491,0.00028522397,0.15365218,0.009975153,0.030247,0.0051005534,0.79213977],"study_design_scores_gemma":[0.000056615456,0.000113693546,0.0014289868,0.00003676264,0.00007931422,0.0002276402,0.00009604125,0.9699358,0.004686109,0.022037638,0.0012836447,0.000017795486],"about_ca_topic_score_codex":0.0029779759,"about_ca_topic_score_gemma":0.0021110042,"teacher_disagreement_score":0.003902969,"about_ca_system_score_codex":0.00075563387,"about_ca_system_score_gemma":0.00074539473,"threshold_uncertainty_score":0.020641148},"labels":[],"label_agreement":null},{"id":"W1571851487","doi":"10.1007/978-3-540-73580-9_5","title":"Partial Pattern Databases","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Reduction (mathematics); Abstraction; Heuristic; Database; Table (database); Parallel computing; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.044547099493549944,"score_gpt":0.28028210286874966,"score_spread":0.2357350033751997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571851487","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.011178528,0.0054691536,0.7656687,0.0016229141,0.0007188385,0.00034744348,0.014256194,0.014907502,0.18583077],"genre_scores_gemma":[0.13339649,0.008008982,0.54648983,0.0010258578,0.00036536317,0.00048208813,0.05364828,0.003139972,0.25344318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931765,0.000074120464,0.00008923377,0.00018382538,0.00029549416,0.000039729635],"domain_scores_gemma":[0.999087,0.00014383474,0.000028497714,0.0005372931,0.00016298704,0.000040443436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564958,0.00072782603,0.0009721984,0.0016361418,0.0006956062,0.003691648,0.0016912612,0.0006103293,0.047419816],"category_scores_gemma":[0.0023530426,0.0006984643,0.0007926785,0.0038040064,0.00046880307,0.0053261495,0.0017231093,0.0009999222,0.023072883],"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.00013724987,0.00007132922,0.0004824414,0.00038445205,0.00004927316,0.00012483927,0.00013381666,0.0021924572,0.0031438852,0.16794837,0.0951968,0.73013514],"study_design_scores_gemma":[0.000036857386,0.000059974253,0.00044771584,0.00014601172,0.00007082441,0.0010842057,0.00014184085,0.01378457,0.009620814,0.28904706,0.68553144,0.000028724851],"about_ca_topic_score_codex":0.0010852339,"about_ca_topic_score_gemma":0.0014310163,"teacher_disagreement_score":0.047419816,"about_ca_system_score_codex":0.00051067007,"about_ca_system_score_gemma":0.00085177337,"threshold_uncertainty_score":0.15863508},"labels":[],"label_agreement":null},{"id":"W1571885698","doi":"10.1007/11502593_31","title":"Wireless Technologies for Condition-Based Maintenance (CBM) in Petroleum Plants","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power Line Communications and Noise","field":"Engineering","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":"Cape Breton University; National Research Council Canada","funders":"","keywords":"Wireless; Computer science; Scalability; Petroleum; Petroleum industry; Wireless network; Telecommunications; Systems engineering; Engineering","score_opus":0.012325653223802321,"score_gpt":0.23434580698055368,"score_spread":0.22202015375675135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571885698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06939758,0.049508,0.73987347,0.0025671546,0.0012086247,0.00012521846,0.00026847224,0.0016939407,0.13535753],"genre_scores_gemma":[0.7454154,0.03464142,0.0957554,0.0004165081,0.00096780376,0.00010854378,0.0002870828,0.00017668975,0.12223114],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989045,0.000015132437,0.000005899985,0.00001562116,0.00006208649,0.00001079412],"domain_scores_gemma":[0.99981076,0.000105765226,0.000020096808,0.000019935394,0.00003612051,0.0000073177944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017976882,0.00038418878,0.00019415464,0.00045262274,0.00021794034,0.0006068121,0.0008017657,0.0006698048,0.007484445],"category_scores_gemma":[0.0004168796,0.00019001433,0.00021845776,0.00079878053,0.00026515598,0.0009892847,0.0003383734,0.0004863085,0.0014570631],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112369074,0.000080279606,0.00079618825,0.00048602943,0.000015583466,0.00024741163,0.00017639066,0.010838875,0.057206694,0.022975031,0.015564679,0.8915004],"study_design_scores_gemma":[0.00009746095,0.0017200462,0.011498643,0.00093152345,0.00026760757,0.005396298,0.00071336224,0.15901387,0.13786322,0.053797804,0.62859017,0.00011004484],"about_ca_topic_score_codex":0.00072919787,"about_ca_topic_score_gemma":0.0010160644,"teacher_disagreement_score":0.007484445,"about_ca_system_score_codex":0.0002794895,"about_ca_system_score_gemma":0.00020684529,"threshold_uncertainty_score":0.025037944},"labels":[],"label_agreement":null},{"id":"W1571885823","doi":"10.1007/11864127_13","title":"Intron Loss Dynamics in Mammals","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA Research and Splicing","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":"McGill University","funders":"","keywords":"Intron; Biology; Genome; Gene; Genetics; Lineage (genetic); Germline; Housekeeping gene; Gene expression","score_opus":0.007299203223643547,"score_gpt":0.2483853952547422,"score_spread":0.24108619203109866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571885823","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.98611826,0.0015061311,0.0045474544,0.000117057854,0.0000066139673,0.0000029127682,0.00034419968,0.000090232745,0.0072672237],"genre_scores_gemma":[0.9951593,0.00044500816,0.0012915713,0.00002369872,0.0000064932324,0.0000042964534,0.00042026222,0.00004081197,0.0026084327],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998715,0.00001321681,0.000007533815,0.000059834376,0.00003083169,0.000017106562],"domain_scores_gemma":[0.99969435,0.000116673174,0.0000795296,0.000035174453,0.000028431537,0.000045868434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026957525,0.000097352306,0.00028237415,0.00047358338,0.00030736628,0.0007450904,0.00026107454,0.00029169026,0.0022802264],"category_scores_gemma":[0.0006090448,0.0002319251,0.00015087366,0.00059838186,0.0003507819,0.00052096223,0.000317838,0.00042545528,0.000638229],"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.0008223411,0.00010598197,0.102337874,0.00018124178,0.00014627367,0.0010050803,0.001132947,0.03369558,0.68815124,0.06609255,0.002749704,0.10357918],"study_design_scores_gemma":[0.000045759625,0.000436732,0.5840725,0.00006525306,0.00017621182,0.005895053,0.000987486,0.1531893,0.14222285,0.07738933,0.035420984,0.00009855399],"about_ca_topic_score_codex":0.00055089354,"about_ca_topic_score_gemma":0.0009504841,"teacher_disagreement_score":0.0022802264,"about_ca_system_score_codex":0.0003745613,"about_ca_system_score_gemma":0.00012187741,"threshold_uncertainty_score":0.007628143},"labels":[],"label_agreement":null},{"id":"W1571887931","doi":"10.1007/978-3-642-30870-3_12","title":"An Undecidable Nested Recurrence Relation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Victoria","funders":"","keywords":"Undecidable problem; Mathematics; Combinatorics; Relation (database); Recurrence relation; Turing; Left and right; Discrete mathematics; Computer science; Decidability","score_opus":0.01961635530253146,"score_gpt":0.2509982774693665,"score_spread":0.231381922166835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571887931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24251804,0.001779049,0.6091771,0.0028016984,0.0005915122,0.000270872,0.0011110137,0.0033408776,0.13840984],"genre_scores_gemma":[0.79328704,0.0008288986,0.15531957,0.0006440114,0.0002855134,0.00023013326,0.0012358424,0.0006506233,0.047518387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998857,0.00022377737,0.00009073712,0.00030966479,0.00035458067,0.00016425608],"domain_scores_gemma":[0.99616027,0.0027257886,0.00019699363,0.00043612183,0.00038481597,0.00009592209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091894926,0.0005968408,0.00063910155,0.0005161249,0.0015161255,0.0020435262,0.0013638176,0.00109124,0.006577587],"category_scores_gemma":[0.004977563,0.0007387397,0.0011534381,0.0006706515,0.0022420827,0.005337526,0.001639368,0.0031036348,0.0012400936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060265276,0.000051950672,0.00021567628,0.00015057606,0.000011098691,0.00024090208,0.000527182,0.0040272176,0.00451255,0.9623094,0.003556791,0.02433642],"study_design_scores_gemma":[0.00003267127,0.000018743507,0.00011995208,0.000027733251,0.000026343947,0.00018537906,0.000092306385,0.016221099,0.0035045126,0.96821654,0.011536637,0.0000180741],"about_ca_topic_score_codex":0.0025340747,"about_ca_topic_score_gemma":0.0036034558,"teacher_disagreement_score":0.006577587,"about_ca_system_score_codex":0.0013586915,"about_ca_system_score_gemma":0.0011886928,"threshold_uncertainty_score":0.022004187},"labels":[],"label_agreement":null},{"id":"W1571909284","doi":"10.1007/3-540-45465-9_20","title":"On the Complexity of Resolution with Bounded Conjunctions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Hierarchy; Proof complexity; Bounded function; Space (punctuation); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; Algorithm; Combinatorics; Mathematical proof; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.03747163055043265,"score_gpt":0.22937757133314626,"score_spread":0.1919059407827136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571909284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2383176,0.009822821,0.53388166,0.02466399,0.00085133436,0.0003290338,0.0024680535,0.0020873463,0.1875781],"genre_scores_gemma":[0.86676437,0.004535774,0.09950968,0.001557539,0.0015791499,0.00036638105,0.002010696,0.0007790418,0.022897458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870788,0.0044879727,0.0008207566,0.001867726,0.0043774373,0.0013673909],"domain_scores_gemma":[0.88819486,0.099285744,0.0026033819,0.0062283883,0.0022275008,0.001460071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006805233,0.0016405768,0.0032174308,0.00341813,0.004151086,0.012121689,0.005989495,0.003791499,0.022578022],"category_scores_gemma":[0.05143768,0.0027932462,0.00441031,0.0067029586,0.008644517,0.049575426,0.010522149,0.011691401,0.00217457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033374678,0.00012372147,0.0009861497,0.0003800789,0.00011065927,0.00024055505,0.0007392195,0.01678671,0.0009227593,0.9448597,0.006623199,0.027893502],"study_design_scores_gemma":[0.00003373512,0.000013155995,0.00018009255,0.000028327686,0.000041672414,0.00011351473,0.00009062353,0.018790543,0.0004686741,0.9782402,0.001974509,0.00002500496],"about_ca_topic_score_codex":0.0029539792,"about_ca_topic_score_gemma":0.0024241519,"teacher_disagreement_score":0.022578022,"about_ca_system_score_codex":0.0047416408,"about_ca_system_score_gemma":0.0024200308,"threshold_uncertainty_score":0.075531065},"labels":[],"label_agreement":null},{"id":"W1571925205","doi":"10.1007/978-3-642-10631-6_91","title":"Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Planar graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Planar; Graph; Plane (geometry); Line (geometry); Mathematics; Geometry; Artificial intelligence; Computer graphics (images)","score_opus":0.02326946534439766,"score_gpt":0.26775811750917106,"score_spread":0.2444886521647734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571925205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09382858,0.00052945374,0.8258468,0.00031688716,0.00020603828,0.00020263666,0.0006274151,0.0031352316,0.075307],"genre_scores_gemma":[0.45518887,0.0008466994,0.51208913,0.00018978538,0.00012928274,0.00032089095,0.0015346387,0.0007193644,0.028981362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997887,0.000037862446,0.000011244048,0.000052836505,0.00008014151,0.000029297818],"domain_scores_gemma":[0.99936527,0.00019640615,0.00006534025,0.00021553168,0.000095907664,0.00006160163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018801726,0.0006190735,0.000528255,0.0009143,0.00047329703,0.00075142307,0.0012467924,0.00059490476,0.0124482345],"category_scores_gemma":[0.0010962674,0.00042173447,0.00057174574,0.000936567,0.0006735547,0.001523882,0.0017329495,0.0016288976,0.002571334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039476372,0.00035918353,0.0009104363,0.0007058812,0.000051621926,0.00045270243,0.00042511764,0.103957504,0.052630972,0.26476675,0.026432252,0.54891294],"study_design_scores_gemma":[0.00007140516,0.0003420023,0.001046048,0.00014167349,0.000070526774,0.0009987677,0.0002811429,0.5607693,0.029304355,0.354891,0.05203294,0.000050814953],"about_ca_topic_score_codex":0.000529454,"about_ca_topic_score_gemma":0.000747899,"teacher_disagreement_score":0.0124482345,"about_ca_system_score_codex":0.0002616644,"about_ca_system_score_gemma":0.00024141204,"threshold_uncertainty_score":0.04164344},"labels":[],"label_agreement":null},{"id":"W157198660","doi":"10.1007/978-3-540-68155-7_31","title":"The Weighted Cfg Constraint","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.014062009062723467,"score_gpt":0.24066382845883094,"score_spread":0.22660181939610746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157198660","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.02035123,0.0011120224,0.8170055,0.004450958,0.0011573277,0.00022276322,0.0022852106,0.0011415766,0.15227354],"genre_scores_gemma":[0.45469356,0.0016783027,0.46636447,0.004070048,0.001034977,0.0005685318,0.0045538386,0.0023126863,0.06472362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965752,0.0008339646,0.00022758765,0.00077621,0.0011805961,0.0004063721],"domain_scores_gemma":[0.9931948,0.0025474518,0.0002263718,0.0026101293,0.001247032,0.00017411719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001942048,0.00080503925,0.0009419701,0.001468349,0.0015291563,0.0027943514,0.0024400405,0.0025275538,0.028322302],"category_scores_gemma":[0.015234521,0.00069268525,0.0009649948,0.0031075056,0.0018531274,0.0075378492,0.0031057706,0.0039067473,0.0044613113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008918069,0.000032754007,0.00023373091,0.00017902473,0.000028782186,0.00029548493,0.000104820814,0.0040670796,0.0025486755,0.90041894,0.017668242,0.07433328],"study_design_scores_gemma":[0.000025473422,0.000019079549,0.000121794925,0.00007269656,0.00003141399,0.00036025024,0.000058153975,0.022644652,0.0032999772,0.9226503,0.05069465,0.00002165975],"about_ca_topic_score_codex":0.0033688643,"about_ca_topic_score_gemma":0.004191793,"teacher_disagreement_score":0.028322302,"about_ca_system_score_codex":0.00091934996,"about_ca_system_score_gemma":0.0019813671,"threshold_uncertainty_score":0.09474754},"labels":[],"label_agreement":null},{"id":"W1572009591","doi":"10.1007/11527770_51","title":"Clinical Reasoning Learning with Simulated Patients","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Automaton; Cognition; Artificial intelligence; Process (computing); Encoding (memory); Model-based reasoning; Cognitive science; State (computer science); Cognitive model; Machine learning; Knowledge representation and reasoning; Programming language; Psychology","score_opus":0.018795112621489654,"score_gpt":0.2696518411835635,"score_spread":0.25085672856207386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572009591","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.9519597,0.00019970995,0.025722582,0.0020974693,0.00013217557,0.00057181856,0.0005378138,0.00031251556,0.018466242],"genre_scores_gemma":[0.97052985,0.0001825232,0.022395886,0.00030523652,0.000033641005,0.0003738688,0.0006524534,0.00001883181,0.005507769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858534,0.0009416608,0.00006751445,0.00016665632,0.00013072486,0.00010814685],"domain_scores_gemma":[0.9846586,0.011848568,0.00041198853,0.00093421165,0.00061821507,0.0015283833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031627647,0.0007428922,0.00058218127,0.00047760527,0.00074772007,0.0017109907,0.0017197889,0.002544961,0.010724514],"category_scores_gemma":[0.018808598,0.0003903139,0.0005784588,0.00035967835,0.0010462961,0.0012851561,0.0017420589,0.0019363777,0.0018504056],"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.019951416,0.06723449,0.057246223,0.0009875881,0.0004552637,0.009436551,0.02425517,0.32899046,0.005828034,0.034952667,0.040860634,0.4098015],"study_design_scores_gemma":[0.009710133,0.038870696,0.0186463,0.0006621861,0.0002832311,0.0066381874,0.010669027,0.7362458,0.01988607,0.11700457,0.04093289,0.00045095608],"about_ca_topic_score_codex":0.0010350208,"about_ca_topic_score_gemma":0.0013424725,"teacher_disagreement_score":0.010724514,"about_ca_system_score_codex":0.00086358853,"about_ca_system_score_gemma":0.0014462122,"threshold_uncertainty_score":0.03587705},"labels":[],"label_agreement":null},{"id":"W1572018399","doi":"10.1007/978-3-540-73101-6_8","title":"Job Satisfaction and Motivation in a Large Agile Team","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":68,"is_retracted":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":"Agile software development; Scrum; Knowledge management; Autonomy; Variety (cybernetics); Software development; Team software process; Agile usability engineering; Job satisfaction; Computer science; Software; Process management; Engineering; Engineering management; Software engineering; Software development process; Psychology; Political science","score_opus":0.019322790949704256,"score_gpt":0.2636909671427683,"score_spread":0.24436817619306403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572018399","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.9994361,0.000017674769,0.000048395144,0.000048474456,0.000004247879,0.0000033646081,0.000009010591,0.000001880543,0.00043084973],"genre_scores_gemma":[0.99939156,0.000009951149,0.000058239468,0.000012808102,0.0000032727835,0.000006913078,0.000013798222,0.0000017485299,0.0005017419],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99929726,0.0003330377,0.00002244137,0.000046528836,0.000109887456,0.00019089924],"domain_scores_gemma":[0.99433386,0.0014722281,0.0005105533,0.00010144113,0.0004907733,0.003091214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018074585,0.00022025286,0.0002801474,0.0006164523,0.0015357622,0.0013800609,0.0005243609,0.00066077895,0.0015687025],"category_scores_gemma":[0.0041294023,0.0002558315,0.00027459575,0.00048060613,0.00079069927,0.00043874537,0.0007811159,0.0012469954,0.00037894212],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002116987,0.0069460412,0.92094254,0.000042402455,0.00010071643,0.0023266256,0.022835925,0.0016806368,0.0037074692,0.0010969439,0.0022882742,0.035915416],"study_design_scores_gemma":[0.000060303424,0.0022582442,0.97961706,0.00001314156,0.000024484607,0.000381447,0.012559692,0.0036643208,0.00029605348,0.0004966746,0.00058783067,0.00004066202],"about_ca_topic_score_codex":0.008003433,"about_ca_topic_score_gemma":0.009381908,"teacher_disagreement_score":0.008003433,"about_ca_system_score_codex":0.0007668655,"about_ca_system_score_gemma":0.00082328334,"threshold_uncertainty_score":0.015913725},"labels":[],"label_agreement":null},{"id":"W1572041619","doi":"10.1007/11815921_91","title":"On Optimizing Kernel-Based Fisher Discriminant Analysis Using Prototype Reduction Schemes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Kernel Fisher discriminant analysis; Dimensionality reduction; Linear discriminant analysis; Kernel (algebra); Computer science; Computation; Reduction (mathematics); Pattern recognition (psychology); Kernel method; Artificial intelligence; Fisher kernel; Data set; Discriminant; Algorithm; Mathematics; Support vector machine; Discrete mathematics","score_opus":0.02490450889626933,"score_gpt":0.2629764465489416,"score_spread":0.23807193765267226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572041619","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.010527098,0.00013134748,0.98801315,0.0000458769,0.0000194919,0.000019519952,0.000020207883,0.0005980487,0.00062527735],"genre_scores_gemma":[0.13669948,0.00018531893,0.85887754,0.000060495535,0.000032870408,0.000081235725,0.00021978746,0.00032856714,0.00351467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938023,0.00019592977,0.0000336489,0.00009756096,0.00023989273,0.000052733787],"domain_scores_gemma":[0.99883014,0.0006203213,0.000059015612,0.0002015413,0.00026262485,0.00002629543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010652443,0.00082366867,0.0012325993,0.0005783877,0.00033380665,0.0007445861,0.0011283256,0.00076708075,0.0033093167],"category_scores_gemma":[0.0041059614,0.0005010687,0.0006329302,0.0008653818,0.00043262015,0.0015549703,0.001147946,0.00095807126,0.0012881506],"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.0002754964,0.0001285717,0.00042459165,0.000100063386,0.000050598264,0.00003180437,0.00006796511,0.19929555,0.024010317,0.014067553,0.003965325,0.75758207],"study_design_scores_gemma":[0.000008618095,0.00002502448,0.00014427768,0.0000031648342,0.000008274404,0.000018589148,0.0000070541178,0.9927408,0.0029065942,0.0036069064,0.00052293204,0.0000077164395],"about_ca_topic_score_codex":0.0033289304,"about_ca_topic_score_gemma":0.0036962437,"teacher_disagreement_score":0.0033289304,"about_ca_system_score_codex":0.00043462683,"about_ca_system_score_gemma":0.0007090529,"threshold_uncertainty_score":0.011070728},"labels":[],"label_agreement":null},{"id":"W1572051620","doi":"10.1007/11550518_55","title":"Robust Head Detection and Tracking in Cluttered Workshop Environments Using GMM","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"York University","funders":"","keywords":"Mixture model; Artificial intelligence; Computer vision; Computer science; Tracking (education); Head (geology); Robustness (evolution); Pattern recognition (psychology)","score_opus":0.06337742730003773,"score_gpt":0.29753083688292525,"score_spread":0.23415340958288752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572051620","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.013590224,0.00034336,0.9828981,0.000047000296,0.00007234583,0.000018168714,0.000068481095,0.002087932,0.0008744368],"genre_scores_gemma":[0.33140877,0.00096127746,0.65835905,0.00014392613,0.00014263322,0.00007058891,0.00046756174,0.00070725323,0.007738969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995554,0.00009877216,0.000020006935,0.00012117594,0.00012719467,0.00007743693],"domain_scores_gemma":[0.9996126,0.00015992174,0.000028083565,0.00007811606,0.00009894545,0.00002236537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055565865,0.00079860166,0.0011755623,0.00078901026,0.00031166206,0.0007358522,0.00089171575,0.00081419665,0.0015702045],"category_scores_gemma":[0.0015442792,0.00070042507,0.00069315446,0.00082946074,0.0003586708,0.0008439529,0.0011838446,0.00065962377,0.001812954],"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.00059970934,0.000079439444,0.0014777778,0.00013240015,0.00018239395,0.0002156945,0.00018715377,0.055462543,0.15458237,0.002805615,0.0064894552,0.7777855],"study_design_scores_gemma":[0.000031876123,0.00013428337,0.005710269,0.000018182,0.000121367,0.0007621367,0.00009237474,0.88740253,0.09588127,0.004867252,0.0049109356,0.00006752534],"about_ca_topic_score_codex":0.003621961,"about_ca_topic_score_gemma":0.0047458373,"teacher_disagreement_score":0.003621961,"about_ca_system_score_codex":0.00030880937,"about_ca_system_score_gemma":0.0004088951,"threshold_uncertainty_score":0.007201791},"labels":[],"label_agreement":null},{"id":"W1572080216","doi":"10.1007/978-3-540-24709-8_107","title":"An Exploratory Spatial Data Analysis (ESDA) Toolkit for the Analysis of Activity/Travel Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Exploratory analysis; Geographic information system; Visualization; Exploratory data analysis; Sample (material); Data science; Data visualization; Data exploration; Spatial analysis; Data mining; Geography; Cartography; Remote sensing","score_opus":0.08359665489999547,"score_gpt":0.3476217796709555,"score_spread":0.26402512477096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572080216","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.0012502142,0.00021490263,0.87026495,0.00016774295,0.000074315976,0.00029938342,0.014075827,0.11220649,0.0014461037],"genre_scores_gemma":[0.0059805987,0.0001959412,0.97290707,0.00007600759,0.000014931625,0.0009940581,0.010414987,0.0076296893,0.0017867392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981256,0.00049104064,0.00035284073,0.00027969692,0.0006459435,0.000104928855],"domain_scores_gemma":[0.99282527,0.0046284795,0.00029371667,0.0010108165,0.0010142792,0.00022742295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049635232,0.002153122,0.0017737994,0.0042547,0.001254763,0.0035834103,0.0028447502,0.0009029175,0.029038984],"category_scores_gemma":[0.013134318,0.0021615545,0.0032502196,0.0042704903,0.00066602626,0.0026420173,0.0048267776,0.0032540963,0.016216498],"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.00040770596,0.00028778284,0.004998077,0.0029343087,0.00085124036,0.00090500206,0.002911653,0.010672905,0.017286934,0.027067624,0.314804,0.6168728],"study_design_scores_gemma":[0.0004977376,0.00018397307,0.010533619,0.0009510765,0.0005501984,0.0022521955,0.0012431815,0.23334017,0.025487488,0.11722509,0.6072972,0.00043817915],"about_ca_topic_score_codex":0.006334718,"about_ca_topic_score_gemma":0.015571114,"teacher_disagreement_score":0.029038984,"about_ca_system_score_codex":0.00061398663,"about_ca_system_score_gemma":0.002749793,"threshold_uncertainty_score":0.09714514},"labels":[],"label_agreement":null},{"id":"W1572080313","doi":"10.1007/978-3-540-74260-9_10","title":"Image Decomposition and Reconstruction Using Single Sided Complex Gabor Wavelets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Manitoba","funders":"","keywords":"Gabor wavelet; Gabor transform; Artificial intelligence; Computer science; Gabor filter; Pattern recognition (psychology); Computer vision; Wavelet; Iterative reconstruction; Wavelet transform; Image (mathematics); Time–frequency analysis; Discrete wavelet transform; Filter (signal processing)","score_opus":0.05113753655416242,"score_gpt":0.31308260230732365,"score_spread":0.26194506575316123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572080313","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.007069692,0.00040127273,0.98977333,0.00006605004,0.0000717069,0.000013207197,0.000037330126,0.00022865774,0.0023388148],"genre_scores_gemma":[0.09237835,0.0018515143,0.8907406,0.00009451539,0.00009689702,0.000040826435,0.00024174165,0.0002550288,0.014300574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984753,0.00001651871,0.000009369038,0.000027813201,0.000083853585,0.000014778667],"domain_scores_gemma":[0.99979895,0.000058432594,0.000016445134,0.00006386768,0.0000512729,0.000011095533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027358573,0.00047195068,0.00057907443,0.0005773891,0.00013397279,0.0010476949,0.00035694003,0.0006879843,0.003692223],"category_scores_gemma":[0.0006111795,0.00035713284,0.0005973516,0.00075551757,0.0003545479,0.0008507748,0.00045816746,0.00080529135,0.0025231685],"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.00023465093,0.00008175345,0.00031957444,0.0002684914,0.000059365208,0.00025765414,0.00012524937,0.029911987,0.34879416,0.063749194,0.005002109,0.55119586],"study_design_scores_gemma":[0.000034800865,0.00013783174,0.001155031,0.00005305466,0.00006716549,0.0011335881,0.000067793975,0.7759243,0.17028165,0.026188048,0.02490854,0.000048171103],"about_ca_topic_score_codex":0.00022939428,"about_ca_topic_score_gemma":0.000307697,"teacher_disagreement_score":0.003692223,"about_ca_system_score_codex":0.00013008651,"about_ca_system_score_gemma":0.00018211726,"threshold_uncertainty_score":0.012351692},"labels":[],"label_agreement":null},{"id":"W1572155026","doi":"10.1007/978-3-540-32128-6_3","title":"Specifying DIMA Multi-agents Models Using Maude","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science","score_opus":0.09054473493819953,"score_gpt":0.29464312313564456,"score_spread":0.20409838819744502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572155026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006163012,0.00015779518,0.9727241,0.00024931174,0.00006106221,0.00013953866,0.0006260963,0.0035320928,0.016347105],"genre_scores_gemma":[0.1394598,0.00039948043,0.8442002,0.00020309909,0.000026639811,0.00073261483,0.0015030681,0.0023642073,0.011110811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984554,0.0005868658,0.00017116574,0.00019311917,0.00042871703,0.00016474936],"domain_scores_gemma":[0.998458,0.00079764915,0.00010586678,0.00040881406,0.00016677355,0.00006288865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019899653,0.0013004112,0.001076611,0.0010995531,0.0014838319,0.0051719174,0.0031346139,0.0018104136,0.010340189],"category_scores_gemma":[0.005865572,0.002044028,0.0031605978,0.0008466891,0.0012133694,0.004301428,0.0046190005,0.003755995,0.003122884],"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.00007140489,0.00007159192,0.0007749047,0.00031340198,0.00009405763,0.00044188928,0.0012333824,0.10498541,0.003273327,0.85544145,0.0045397715,0.02875935],"study_design_scores_gemma":[0.000080707374,0.000035933008,0.00013136343,0.00017754927,0.00012267209,0.00034371248,0.00042834083,0.4892234,0.009209407,0.3484238,0.15173636,0.000086798434],"about_ca_topic_score_codex":0.0045411685,"about_ca_topic_score_gemma":0.009084256,"teacher_disagreement_score":0.010340189,"about_ca_system_score_codex":0.0015285544,"about_ca_system_score_gemma":0.0014678801,"threshold_uncertainty_score":0.034591377},"labels":[],"label_agreement":null},{"id":"W1572177269","doi":"10.1007/978-3-540-76928-6_16","title":"An Adaptive Approach for QoS-Aware Web Service Composition Using Cultural Algorithms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Windsor","funders":"","keywords":"Web service; Computer science; Service design; Service provider; Differentiated service; Service level objective; Service delivery framework; Service (business); Quality of service; WS-Policy; World Wide Web; Web modeling; Database; Web development; Web application security; Computer network; Business; Marketing","score_opus":0.04442491900601301,"score_gpt":0.2922748588051863,"score_spread":0.24784993979917327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572177269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027047517,0.00010459643,0.96725386,0.00012860722,0.000058862264,0.00008009246,0.000012771176,0.0005287327,0.0047848085],"genre_scores_gemma":[0.3159733,0.00015306732,0.6785182,0.00012106601,0.000038464812,0.0002068928,0.00007368672,0.00014913885,0.0047661853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942493,0.000198923,0.00003439096,0.00010702361,0.00018355343,0.00005112693],"domain_scores_gemma":[0.9992962,0.00027718858,0.000033543995,0.00014061172,0.00020748135,0.000044882163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009478502,0.0004987702,0.0005430533,0.00066487235,0.0011142084,0.0013286474,0.0015804447,0.0008500767,0.0019791496],"category_scores_gemma":[0.0028866862,0.0002906304,0.0007750386,0.0007816021,0.00105909,0.0014704907,0.0014099281,0.0010342638,0.00038816468],"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.00029264684,0.00046336788,0.0020542608,0.00017563331,0.00017175698,0.00032673747,0.001245877,0.25720882,0.05859769,0.17953664,0.0034318932,0.49649465],"study_design_scores_gemma":[0.000028245848,0.000043667616,0.00023602077,0.0000109106795,0.00003649216,0.00012166434,0.0001231269,0.9633718,0.007866174,0.024676306,0.0034652832,0.000020292015],"about_ca_topic_score_codex":0.0029473128,"about_ca_topic_score_gemma":0.0025824942,"teacher_disagreement_score":0.0029473128,"about_ca_system_score_codex":0.0007652751,"about_ca_system_score_gemma":0.0008356352,"threshold_uncertainty_score":0.006620884},"labels":[],"label_agreement":null},{"id":"W1572189866","doi":"10.1007/978-3-540-24633-6_5","title":"Mutual Irreducibility of Certain Polynomials","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Irreducibility; Word (group theory); Transformation (genetics); Computer science; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics; Genetics; Biology; Geometry","score_opus":0.018336448441338263,"score_gpt":0.2478270258690636,"score_spread":0.22949057742772533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572189866","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.43899444,0.0020409664,0.19081125,0.0033311364,0.00035767557,0.00008639667,0.00040002697,0.00048644986,0.36349162],"genre_scores_gemma":[0.9710183,0.0006478262,0.00873361,0.00019480806,0.00028889338,0.000048235022,0.00012519018,0.00008315219,0.018859845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874437,0.00030317347,0.00004941229,0.00021696111,0.00038439655,0.00030155777],"domain_scores_gemma":[0.99657875,0.0020954097,0.00029220455,0.00061901816,0.0002024013,0.00021208904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014584804,0.0004068755,0.0006338155,0.0011885416,0.0020587964,0.0021524807,0.00072181766,0.00074263953,0.0061447658],"category_scores_gemma":[0.004442298,0.00042839054,0.0008953068,0.001198593,0.0044547934,0.005626046,0.002977043,0.0037504165,0.000564654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019861947,0.00000605008,0.000044496523,0.00001520104,0.0000018905673,0.000027442442,0.00018405325,0.00019154123,0.00038520907,0.99654335,0.0002687779,0.002312166],"study_design_scores_gemma":[0.000008906616,0.000018689976,0.00012192766,0.000010129238,0.000006419645,0.00014557343,0.00004857645,0.00096387987,0.0014889265,0.9927059,0.0044721626,0.000008902728],"about_ca_topic_score_codex":0.00020580244,"about_ca_topic_score_gemma":0.00022067198,"teacher_disagreement_score":0.0061447658,"about_ca_system_score_codex":0.001020759,"about_ca_system_score_gemma":0.00057999353,"threshold_uncertainty_score":0.020556271},"labels":[],"label_agreement":null},{"id":"W157231795","doi":"10.1007/978-3-642-38457-8_25","title":"Sensory Updates to Combat Path-Integration Drift","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Path integration; Computer science; Sensory system; Path (computing); Process (computing); Entorhinal cortex; Artificial intelligence; Hippocampus; Neuroscience","score_opus":0.052735764631172605,"score_gpt":0.2782056199092413,"score_spread":0.2254698552780687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157231795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22482656,0.004243403,0.69985986,0.0009683893,0.00152352,0.000097618125,0.0002842149,0.0020342437,0.06616213],"genre_scores_gemma":[0.92629826,0.0011644898,0.054509737,0.00025430685,0.00018037234,0.000029882152,0.00013588225,0.00021695149,0.017210167],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999238,0.000007476141,0.000003973973,0.000018966595,0.00003143388,0.000014321461],"domain_scores_gemma":[0.99972194,0.00010940452,0.000034186338,0.000043627733,0.000063657186,0.000027168555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023019816,0.00051564304,0.00030725318,0.00023156783,0.00025755836,0.000703004,0.00059591886,0.00045279946,0.008248859],"category_scores_gemma":[0.0016775595,0.00014878939,0.00018291571,0.00029806953,0.0002833142,0.0012107516,0.0008441938,0.0009912688,0.00074632943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074721425,0.0002376249,0.00091378763,0.00028943352,0.00007873688,0.00025619435,0.00021881808,0.1229648,0.08260138,0.057750504,0.010207074,0.72373444],"study_design_scores_gemma":[0.00008853373,0.00048354306,0.0031609142,0.00014399044,0.000103297745,0.00045432095,0.0001763609,0.81717056,0.038657922,0.120663404,0.018847246,0.00004982602],"about_ca_topic_score_codex":0.00049763714,"about_ca_topic_score_gemma":0.0008907185,"teacher_disagreement_score":0.008248859,"about_ca_system_score_codex":0.00018159427,"about_ca_system_score_gemma":0.00028785653,"threshold_uncertainty_score":0.027595222},"labels":[],"label_agreement":null},{"id":"W1572330878","doi":"10.1007/3-540-47721-7_17","title":"All-or-Nothing Disclosure of Secrets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":296,"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":"Nothing; Internet privacy; Computer science; Business; Philosophy; Epistemology","score_opus":0.03114779796906828,"score_gpt":0.27812935078081497,"score_spread":0.2469815528117467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572330878","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.0879606,0.00841593,0.38359523,0.014648026,0.0024051254,0.0001825221,0.001035502,0.0015955414,0.50016147],"genre_scores_gemma":[0.83163726,0.005051919,0.026834836,0.0014620065,0.0009136748,0.00008760631,0.0004663698,0.00022428649,0.1333221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980457,0.00047478644,0.00012995025,0.00031450944,0.00072233944,0.00031275823],"domain_scores_gemma":[0.9952043,0.0012442846,0.0003334154,0.0027986434,0.00029781178,0.00012162499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014878686,0.00058908865,0.00051689957,0.00056596735,0.0009892767,0.003256106,0.0013142087,0.0014457406,0.009966053],"category_scores_gemma":[0.00653929,0.00042955618,0.0005853441,0.00088966155,0.002800164,0.008403857,0.0027847902,0.0020373168,0.0033400278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018065612,0.0000636289,0.00078384136,0.00023674846,0.00004571842,0.0002644404,0.0005955072,0.002004507,0.0044079875,0.8331001,0.017335853,0.14098099],"study_design_scores_gemma":[0.000028736898,0.000090153306,0.0005550782,0.00020321459,0.00007709309,0.0016535628,0.00026193395,0.008003752,0.021703018,0.839554,0.12781653,0.00005284769],"about_ca_topic_score_codex":0.00012050833,"about_ca_topic_score_gemma":0.0001478527,"teacher_disagreement_score":0.009966053,"about_ca_system_score_codex":0.0006076417,"about_ca_system_score_gemma":0.00084610004,"threshold_uncertainty_score":0.03333974},"labels":[],"label_agreement":null},{"id":"W1572415040","doi":"10.1007/978-3-540-77442-6_12","title":"Parser Combinators for Ambiguous Left-Recursive Grammars","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Combinatory logic; Computer science; Programming language; Rule-based machine translation; Parsing; Haskell; Executable; Parsing expression grammar; L-attributed grammar; Context-free grammar; Natural language processing; Functional programming","score_opus":0.027709497850435347,"score_gpt":0.26298405010279174,"score_spread":0.23527455225235638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572415040","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.011254716,0.00094676,0.94914466,0.0006708095,0.0003673894,0.000088734465,0.00062667916,0.010287246,0.026612913],"genre_scores_gemma":[0.3219194,0.0024313412,0.6057033,0.0008737441,0.00048304987,0.0003623515,0.0024826748,0.013102869,0.052641336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802244,0.00038859912,0.0002731405,0.00038403666,0.0006741448,0.0002577238],"domain_scores_gemma":[0.9953543,0.0027392947,0.00021646896,0.0011001674,0.0004388472,0.00015106867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026442334,0.0011817282,0.0022107656,0.001990758,0.0019959158,0.0065569403,0.002784405,0.0021941983,0.019169193],"category_scores_gemma":[0.008215745,0.0021382703,0.0024461788,0.0029099705,0.003524115,0.009621294,0.0045469664,0.0046235695,0.007156552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079972255,0.000038068618,0.0003563811,0.00022227103,0.000023422237,0.0005106248,0.00076521956,0.0027064318,0.0027585747,0.90352345,0.011359432,0.077656195],"study_design_scores_gemma":[0.000032447537,0.0000110811725,0.00012289584,0.0000967174,0.000037400205,0.00041727937,0.00009955428,0.017237166,0.0052589583,0.9407525,0.035870384,0.00006361613],"about_ca_topic_score_codex":0.0011427216,"about_ca_topic_score_gemma":0.0022141226,"teacher_disagreement_score":0.019169193,"about_ca_system_score_codex":0.0018745745,"about_ca_system_score_gemma":0.0018041667,"threshold_uncertainty_score":0.064127326},"labels":[],"label_agreement":null},{"id":"W1572418368","doi":"10.1007/978-3-540-68825-9_6","title":"A Frequency Mining-Based Algorithm for Re-ranking Web Search Engine Retrievals","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 New Brunswick","funders":"","keywords":"Computer science; Rank (graph theory); Ranking (information retrieval); Search engine; Information retrieval; Learning to rank; Web page; Data mining; Domain (mathematical analysis); Matrix (chemical analysis); Algorithm; Web search engine; Web search query; World Wide Web; Mathematics","score_opus":0.029718555459894772,"score_gpt":0.26621425775055235,"score_spread":0.23649570229065758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572418368","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.032809064,0.0015288113,0.9569057,0.00027829257,0.00033347597,0.00038914336,0.0006744094,0.0048469203,0.0022341553],"genre_scores_gemma":[0.11855945,0.00042170117,0.87335455,0.00015108586,0.00031939882,0.00027977634,0.0014844935,0.00023805346,0.0051915064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637645,0.0005158933,0.0003792297,0.00051333854,0.0019750842,0.0002399773],"domain_scores_gemma":[0.9940891,0.0023694674,0.0003679903,0.00075295655,0.0022465982,0.00017393741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030043584,0.0011976006,0.002607253,0.009788599,0.0014019522,0.0023125273,0.0031010895,0.0018516302,0.004214421],"category_scores_gemma":[0.011337232,0.00063044345,0.0012907924,0.007722753,0.00057262357,0.0028558848,0.0013119833,0.0014306356,0.0030872517],"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.0003118562,0.00033915957,0.0034433142,0.00012513108,0.00015121928,0.000057465433,0.00007178036,0.01456372,0.010686674,0.0024304867,0.009052509,0.95876676],"study_design_scores_gemma":[0.00018264646,0.000437458,0.004546467,0.000044136206,0.00022062928,0.00081804954,0.00011118085,0.9558686,0.017114421,0.011126848,0.009426187,0.00010347069],"about_ca_topic_score_codex":0.0063614873,"about_ca_topic_score_gemma":0.0114718955,"teacher_disagreement_score":0.009788599,"about_ca_system_score_codex":0.0009965673,"about_ca_system_score_gemma":0.0021291988,"threshold_uncertainty_score":0.01588875},"labels":[],"label_agreement":null},{"id":"W1572447925","doi":"10.1007/978-3-540-69057-3_81","title":"DIBHR: Depth Image-Based Haptic Rendering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Rendering (computer graphics); Computer vision; Haptic technology; Computation; Artificial intelligence; Computer graphics (images); Image-based modeling and rendering; Algorithm","score_opus":0.01796282370944507,"score_gpt":0.21785786824139355,"score_spread":0.19989504453194848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572447925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019037848,0.00085257535,0.9556195,0.0001343761,0.0002917621,0.00008249086,0.0007334856,0.022820627,0.017561216],"genre_scores_gemma":[0.10092289,0.002521796,0.7957635,0.000533758,0.000249891,0.0002743147,0.0039977985,0.010648089,0.08508798],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995214,0.000031259056,0.000016663387,0.000045561057,0.00033988646,0.000045170425],"domain_scores_gemma":[0.9997614,0.0000767665,0.0000134401835,0.00007288415,0.00005461458,0.000020877738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003189052,0.0011766198,0.0008207838,0.0006784031,0.00022603726,0.0011298519,0.0020135506,0.000788775,0.049840312],"category_scores_gemma":[0.00089820503,0.0007448991,0.0005950048,0.0005896841,0.00043350132,0.0012009254,0.0015371427,0.0017163279,0.013478252],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035407185,0.00008302692,0.00013275916,0.0008403686,0.0000489258,0.00026686108,0.00025801282,0.01065156,0.1595595,0.03027619,0.1021428,0.6953859],"study_design_scores_gemma":[0.00026565013,0.00015665946,0.00075030857,0.00019112598,0.000054896856,0.0015838306,0.00007649286,0.34014094,0.23215918,0.024767533,0.39968538,0.00016794722],"about_ca_topic_score_codex":0.0007828794,"about_ca_topic_score_gemma":0.00097432325,"teacher_disagreement_score":0.049840312,"about_ca_system_score_codex":0.00032493236,"about_ca_system_score_gemma":0.00025167534,"threshold_uncertainty_score":0.16673249},"labels":[],"label_agreement":null},{"id":"W1572464954","doi":"10.1007/11866763_66","title":"Ultrasound-Guided Percutaneous Scaphoid Pinning: Operator Variability and Comparison with Traditional Fluoroscopic Procedure","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Orthopedic Surgery and Rehabilitation","field":"Medicine","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":"Kingston General Hospital; Queen's University","funders":"","keywords":"Fluoroscopy; Ultrasound; Operator (biology); Drill; Percutaneous; Percutaneous pinning; Computer science; 3D ultrasound; Medicine; Computer vision; Radiology; Artificial intelligence; Surgery; Materials science","score_opus":0.014149135892934012,"score_gpt":0.25840125458041735,"score_spread":0.24425211868748334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572464954","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.99305904,0.00046904213,0.0057798526,0.000013942946,0.000025597648,0.000028850753,0.000106336745,0.00007062752,0.00044683047],"genre_scores_gemma":[0.9968828,0.00017646883,0.002584738,0.000029378898,0.00005099095,0.000023126953,0.00008635959,0.00005486869,0.00011131321],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9945399,0.0026240957,0.0005330665,0.0009014649,0.0012773292,0.00012410247],"domain_scores_gemma":[0.9292716,0.05878138,0.004410767,0.0037152232,0.0031072658,0.00071379036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056987917,0.00044284007,0.0010747587,0.0010721766,0.00022956559,0.00067634706,0.00065231306,0.00064691657,0.0009463865],"category_scores_gemma":[0.027560685,0.00029255138,0.00046986988,0.0007541774,0.0005567632,0.0007163498,0.00047657156,0.00044012227,0.00021469011],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.08498735,0.0021783581,0.49625304,0.0011322657,0.0017061869,0.001414932,0.0035939978,0.007419145,0.09690062,0.00039564,0.0006793225,0.30333906],"study_design_scores_gemma":[0.0007348926,0.023723025,0.92534715,0.000057837857,0.001237992,0.005672228,0.0006956373,0.021727534,0.019350667,0.00027756134,0.0010068767,0.00016849932],"about_ca_topic_score_codex":0.0006119268,"about_ca_topic_score_gemma":0.0008033779,"teacher_disagreement_score":0.0056987917,"about_ca_system_score_codex":0.00027464548,"about_ca_system_score_gemma":0.00025040083,"threshold_uncertainty_score":0.030138433},"labels":[],"label_agreement":null},{"id":"W1572518769","doi":"10.1007/978-3-642-03007-9_9","title":"Secure Method Calls by Instrumenting Bytecode with Aspects","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bytecode; Computer science; Java bytecode; Java; Source code; Instrumentation (computer programming); Operating system; Programming language; Mobile device; Statement (logic); Code (set theory); Java applet; Embedded system; Java annotation","score_opus":0.008466234220574645,"score_gpt":0.25348609344880124,"score_spread":0.2450198592282266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572518769","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.08805967,0.00060154765,0.8585313,0.00024047168,0.00017011582,0.00021953697,0.00015090642,0.029771365,0.022255097],"genre_scores_gemma":[0.69772553,0.0009424496,0.27310947,0.00034191154,0.00011847301,0.00021612865,0.00034154608,0.007952131,0.019252388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987937,0.000121813275,0.000093669,0.00020289797,0.00061921263,0.00016862317],"domain_scores_gemma":[0.9967776,0.0009532884,0.00030583557,0.0016752948,0.00021828896,0.00006974839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008006716,0.0010235299,0.0005854716,0.0009999222,0.0003908156,0.0015040017,0.0010031435,0.00068238424,0.003979914],"category_scores_gemma":[0.004262084,0.00087944657,0.0008510379,0.000718052,0.0012832609,0.0034267823,0.0022449573,0.0020583193,0.002158351],"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.00074991846,0.00020546502,0.007398921,0.0005152593,0.00010114022,0.00070585037,0.00139138,0.008310905,0.1823646,0.10464247,0.008753096,0.684861],"study_design_scores_gemma":[0.00008436511,0.00060522277,0.005532271,0.0003387324,0.00041975247,0.0032521987,0.00022325586,0.14443108,0.58637816,0.12125947,0.13733329,0.00014215821],"about_ca_topic_score_codex":0.00020109254,"about_ca_topic_score_gemma":0.00035746765,"teacher_disagreement_score":0.003979914,"about_ca_system_score_codex":0.00036709773,"about_ca_system_score_gemma":0.00053738826,"threshold_uncertainty_score":0.0133141875},"labels":[],"label_agreement":null},{"id":"W1572571127","doi":"10.1007/978-3-540-30139-4_68","title":"Discovering Intelligent Agent: A Tool for Helping Students Searching a Library","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Task (project management); Subject (documents); Ranking (information retrieval); World Wide Web; The Internet; Pyramid (geometry); Intelligent agent; Information retrieval; Artificial intelligence; Management","score_opus":0.029482905504043116,"score_gpt":0.28990872508410664,"score_spread":0.2604258195800635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572571127","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.02464715,0.0025624393,0.9175294,0.0015736037,0.00025095113,0.000225521,0.0010128446,0.023666207,0.028531896],"genre_scores_gemma":[0.054755494,0.0013933113,0.91090786,0.00020242373,0.0000704914,0.00012340456,0.0012333139,0.0005298297,0.030783787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956626,0.00011285777,0.000031225183,0.00009841368,0.00017244059,0.000018840741],"domain_scores_gemma":[0.9991749,0.00040979113,0.000055566215,0.00015882918,0.0001247346,0.00007612899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008494096,0.00083186186,0.00074400945,0.001697833,0.00094472984,0.0018640378,0.001901778,0.001730789,0.008991117],"category_scores_gemma":[0.0027611193,0.00064082677,0.0005403707,0.0015780936,0.00037792945,0.0025524623,0.0010043225,0.0013348351,0.0066148103],"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.0002890605,0.00043585998,0.004265143,0.0006614348,0.000189138,0.0002883405,0.0010949867,0.007361204,0.012366154,0.027782952,0.091983385,0.8532822],"study_design_scores_gemma":[0.00016895136,0.0005016874,0.005160077,0.0003087242,0.00066867995,0.0024420372,0.00072545593,0.37333643,0.050591297,0.050322086,0.515542,0.00023261782],"about_ca_topic_score_codex":0.002018845,"about_ca_topic_score_gemma":0.0054919566,"teacher_disagreement_score":0.008991117,"about_ca_system_score_codex":0.00032987932,"about_ca_system_score_gemma":0.0006756886,"threshold_uncertainty_score":0.030078292},"labels":[],"label_agreement":null},{"id":"W1572614461","doi":"10.1007/978-3-540-31843-9_27","title":"Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Planar graph; Planar; Combinatorics; Outerplanar graph; Vertex (graph theory); Graph; Hamiltonian (control theory); Hamiltonian path; Planar straight-line graph; Book embedding; Mathematics; Computer science; 1-planar graph; Discrete mathematics; Line graph; Pathwidth; Computer graphics (images)","score_opus":0.008726890628925375,"score_gpt":0.22043576840891785,"score_spread":0.21170887777999248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572614461","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.3989308,0.0014986634,0.36856169,0.0047144387,0.00045754385,0.00022108585,0.0013917717,0.0007604626,0.22346349],"genre_scores_gemma":[0.8686254,0.0016223807,0.063170396,0.0005762298,0.0003988745,0.00021833695,0.0017686853,0.0004485394,0.06317112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949753,0.00010234535,0.000025408272,0.00013663738,0.00013185189,0.00010621062],"domain_scores_gemma":[0.9976828,0.0013168488,0.0002431898,0.00033784175,0.0001666663,0.00025264767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051143457,0.0007032037,0.0010400797,0.0010708694,0.0024259884,0.0030170928,0.0029203645,0.0034951414,0.020981481],"category_scores_gemma":[0.004799791,0.00082396687,0.0011257693,0.002101086,0.0023938902,0.005666659,0.002594385,0.0026650147,0.0018640901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000740731,0.000076744036,0.00038279474,0.00013230168,0.000019214738,0.00021547692,0.00029427302,0.013323231,0.0014908956,0.9512373,0.006326187,0.026427507],"study_design_scores_gemma":[0.000022046966,0.000008722916,0.00017136896,0.000015443311,0.000008752992,0.00007887496,0.00011983853,0.012400231,0.0004626234,0.9835527,0.0031504806,0.000008879383],"about_ca_topic_score_codex":0.0016547596,"about_ca_topic_score_gemma":0.0017730447,"teacher_disagreement_score":0.020981481,"about_ca_system_score_codex":0.0010042288,"about_ca_system_score_gemma":0.00052211335,"threshold_uncertainty_score":0.07019007},"labels":[],"label_agreement":null},{"id":"W1572687114","doi":"10.1007/978-3-642-17928-0_1","title":"Solving Hex: Beyond Humans","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Milestone; Computer science; Programming language; Computational science; Geography; Cartography","score_opus":0.0371784039329341,"score_gpt":0.2685304265615198,"score_spread":0.23135202262858573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572687114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017720796,0.0019057976,0.6064783,0.003605474,0.0004986411,0.00012107102,0.0003704946,0.0024138922,0.36688548],"genre_scores_gemma":[0.22741358,0.0028935669,0.57534266,0.0012164766,0.00019784259,0.0002816137,0.0015969527,0.0011015931,0.18995568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950147,0.00017338317,0.000024725758,0.00013751494,0.00010547669,0.000057443398],"domain_scores_gemma":[0.9994887,0.00023851845,0.00002693573,0.00013610283,0.00005851527,0.000051249215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049358874,0.001068806,0.00051783386,0.00032025337,0.0009713082,0.0029918617,0.0016702532,0.0012689534,0.03479639],"category_scores_gemma":[0.0017855298,0.00045072293,0.00058577186,0.0004671786,0.0023720597,0.0064241905,0.0028524448,0.001929921,0.0063949283],"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.00012744748,0.00007735464,0.00045251308,0.0005504238,0.00004398783,0.00010561294,0.0016315486,0.010421984,0.0026243047,0.6652813,0.0416479,0.27703568],"study_design_scores_gemma":[0.000029482433,0.000047063393,0.00021550922,0.00024102099,0.000017931077,0.00016058215,0.0010270653,0.01984078,0.0036929406,0.75663495,0.21807274,0.0000199502],"about_ca_topic_score_codex":0.0018898248,"about_ca_topic_score_gemma":0.0028036681,"teacher_disagreement_score":0.03479639,"about_ca_system_score_codex":0.0006343367,"about_ca_system_score_gemma":0.0011067733,"threshold_uncertainty_score":0.11640549},"labels":[],"label_agreement":null},{"id":"W1572771042","doi":"10.1007/978-3-540-30586-6_89","title":"Automatic Language Identification Using Multivariate Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"BC Research (Canada)","funders":"","keywords":"Computer science; Identification (biology); Multivariate statistics; Character (mathematics); Artificial intelligence; Language identification; Curse of dimensionality; Dimensionality reduction; Natural language processing; Natural language; Machine learning; Mathematics","score_opus":0.01789968486689885,"score_gpt":0.28437675549080843,"score_spread":0.2664770706239096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572771042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0103255715,0.0003574234,0.9779273,0.00017426057,0.000108353874,0.000040788702,0.0005396325,0.0071897223,0.0033368915],"genre_scores_gemma":[0.18571785,0.00083962333,0.78914267,0.00016942048,0.00024262973,0.00020066886,0.0035237412,0.0021500816,0.018013353],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912363,0.00021370828,0.000059826412,0.0002204137,0.00025587025,0.00012657535],"domain_scores_gemma":[0.99882704,0.0005005172,0.00009510497,0.00022322714,0.00030069592,0.0000534736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071993907,0.0010387701,0.000986871,0.0025475684,0.00081316865,0.0017895211,0.00093053817,0.00061899563,0.012524841],"category_scores_gemma":[0.0025118697,0.0004292682,0.0012511809,0.0022740243,0.0005480771,0.0022447158,0.0018028078,0.0013676194,0.011029917],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020931987,0.000070115115,0.0008728939,0.00014749757,0.000050248174,0.00014527663,0.00014293229,0.0042598085,0.053296126,0.013543964,0.010302628,0.9169591],"study_design_scores_gemma":[0.00005160396,0.0001680306,0.005603171,0.00009756979,0.00017564288,0.0013838247,0.00050053326,0.73263216,0.12262271,0.08641984,0.05017269,0.00017234373],"about_ca_topic_score_codex":0.0010235538,"about_ca_topic_score_gemma":0.0014353961,"teacher_disagreement_score":0.012524841,"about_ca_system_score_codex":0.00032603208,"about_ca_system_score_gemma":0.0007606547,"threshold_uncertainty_score":0.0418998},"labels":[],"label_agreement":null},{"id":"W1572811950","doi":"10.1007/978-3-642-13122-6_35","title":"O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Victoria","funders":"","keywords":"Substring; Lexicographical order; Prefix; Combinatorics; Computer science; Data structure; Time complexity; Sequence (biology); Algorithm; Integer (computer science); Mathematics; Discrete mathematics","score_opus":0.00744540385288891,"score_gpt":0.22579290033619848,"score_spread":0.21834749648330956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572811950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1615032,0.0017713903,0.7497161,0.0033967325,0.0007395942,0.0008256162,0.005072498,0.02218521,0.054789715],"genre_scores_gemma":[0.24763761,0.00068184285,0.7025075,0.0009282737,0.00029203887,0.0005903414,0.0055086515,0.0032614497,0.038592335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645585,0.00066174887,0.00035530957,0.0008791904,0.0008071919,0.0008407864],"domain_scores_gemma":[0.9911719,0.004927934,0.00036621437,0.0025792252,0.0006363722,0.00031836896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023937307,0.0015505627,0.0023582827,0.0020909263,0.0036100617,0.00641727,0.0058716587,0.0025331671,0.037448887],"category_scores_gemma":[0.0083102,0.0012451938,0.003175249,0.0059949798,0.00209821,0.012470066,0.0044226428,0.0028060058,0.008159871],"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.0023433547,0.00086293573,0.0021244786,0.0011927676,0.00027167285,0.00041254296,0.00085239677,0.056471568,0.01648254,0.23374073,0.06556904,0.6196759],"study_design_scores_gemma":[0.00041051948,0.00027682493,0.00064723624,0.00022422626,0.00037735642,0.00050249614,0.00038097816,0.21260701,0.02004406,0.73763937,0.026725605,0.00016434654],"about_ca_topic_score_codex":0.005480486,"about_ca_topic_score_gemma":0.010631911,"teacher_disagreement_score":0.037448887,"about_ca_system_score_codex":0.003559357,"about_ca_system_score_gemma":0.005049231,"threshold_uncertainty_score":0.12527901},"labels":[],"label_agreement":null},{"id":"W1572882980","doi":"10.1007/3-540-45579-5_6","title":"Awari Retrograde Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Computer science; Chess endgame; Algorithm; Parallel computing; Artificial intelligence","score_opus":0.028662821462548678,"score_gpt":0.28063687768884416,"score_spread":0.2519740562262955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572882980","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.016317982,0.0012549694,0.27485502,0.001638038,0.0007414799,0.00012049367,0.00066757994,0.0013356354,0.7030688],"genre_scores_gemma":[0.30501428,0.0023874163,0.11080562,0.0011415808,0.0007050875,0.00025119327,0.0022689581,0.002526062,0.5748998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.000114615155,0.000032441694,0.0002131861,0.00028255553,0.00013671744],"domain_scores_gemma":[0.9992449,0.00011771544,0.000045613273,0.00029605994,0.00023811805,0.000057541154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006884995,0.0013308477,0.0010133673,0.0036940253,0.0025512327,0.0032684589,0.0019401661,0.0015715976,0.049235802],"category_scores_gemma":[0.0028678132,0.00056929875,0.0018549017,0.0018286653,0.0020047838,0.005253444,0.0037824863,0.003335767,0.017901333],"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.000032179945,0.000020067393,0.00019689345,0.000059373855,0.000011182849,0.000060584814,0.00011224568,0.00064353744,0.0010123514,0.9644088,0.007194337,0.026248438],"study_design_scores_gemma":[0.000010329082,0.00002326971,0.00039381481,0.000072990035,0.00003509251,0.0002065527,0.00014151983,0.009368367,0.0024513132,0.91274464,0.07452647,0.000025661893],"about_ca_topic_score_codex":0.002045251,"about_ca_topic_score_gemma":0.0022606796,"teacher_disagreement_score":0.049235802,"about_ca_system_score_codex":0.0013887468,"about_ca_system_score_gemma":0.0013115897,"threshold_uncertainty_score":0.16471016},"labels":[],"label_agreement":null},{"id":"W1572996656","doi":"10.1007/978-3-540-72665-4_12","title":"ICS: An Interactive Classification System","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Process (computing); Architecture; Human–computer interaction; Data mining; Operating system","score_opus":0.04069659745817585,"score_gpt":0.29741765279124693,"score_spread":0.2567210553330711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572996656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01798188,0.00046948856,0.71201634,0.0005556058,0.00046373464,0.0006200471,0.0109768445,0.23166747,0.025248423],"genre_scores_gemma":[0.13949208,0.0005889024,0.7302491,0.0010892341,0.0005526296,0.0016443252,0.032460447,0.008631974,0.085291326],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992873,0.00009884969,0.000048251357,0.00019299088,0.00030290784,0.0000696791],"domain_scores_gemma":[0.9989982,0.00036330143,0.000041598032,0.00023463774,0.00026820914,0.00009407173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096272427,0.0014421097,0.00089318346,0.003481796,0.0008462081,0.0021250148,0.00192843,0.0011129274,0.053997625],"category_scores_gemma":[0.0024340844,0.00058284414,0.0010538162,0.0022607236,0.00038426608,0.0020101995,0.0024694367,0.0010368604,0.02777249],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009741717,0.0001925176,0.0032799249,0.00026840024,0.00013414847,0.00021200055,0.00015814982,0.0044017825,0.01729656,0.007798987,0.23234937,0.732934],"study_design_scores_gemma":[0.00024495122,0.00041378866,0.0044894093,0.00013297093,0.0002730284,0.0007819866,0.00017950674,0.47503862,0.06265553,0.031752698,0.42390633,0.0001311352],"about_ca_topic_score_codex":0.0040007853,"about_ca_topic_score_gemma":0.005560132,"teacher_disagreement_score":0.053997625,"about_ca_system_score_codex":0.00072432373,"about_ca_system_score_gemma":0.0010068858,"threshold_uncertainty_score":0.18064004},"labels":[],"label_agreement":null},{"id":"W1573036177","doi":"10.1007/3-540-45294-x_21","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Combinatorics; sort; Set (abstract data type); Point (geometry); Mathematics; Plane (geometry); Range (aeronautics); Left and right; Binary logarithm; Algorithm; Discrete mathematics; Computer science; Geometry; Arithmetic","score_opus":0.02337606576316631,"score_gpt":0.2532877619939588,"score_spread":0.2299116962307925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573036177","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.011599295,0.00082287565,0.9755434,0.00039256096,0.00022119618,0.00008734161,0.00022696338,0.0022554137,0.008850828],"genre_scores_gemma":[0.17870748,0.0006919495,0.8050887,0.00026136864,0.0005086837,0.0003080941,0.0005898113,0.0009855918,0.012858249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975533,0.00050420885,0.00017191618,0.0004917715,0.0009264799,0.00035233723],"domain_scores_gemma":[0.99175256,0.0043894635,0.00046028188,0.0023509818,0.00066707586,0.00037975863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021849202,0.0017353172,0.0025571452,0.00202844,0.0012489597,0.002731919,0.005672401,0.0014637413,0.009475343],"category_scores_gemma":[0.01345039,0.0009740517,0.0013750363,0.0051227496,0.0015696969,0.005260633,0.0048618056,0.0030524444,0.0019572284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011351355,0.00058701687,0.0015075029,0.0004504146,0.000087719745,0.00018291765,0.00034303142,0.2128759,0.016617877,0.1554217,0.027845647,0.5829453],"study_design_scores_gemma":[0.000067557325,0.00007099344,0.000304297,0.000022624185,0.000029348597,0.000111025576,0.000040807387,0.8891761,0.0059227454,0.10011949,0.00410078,0.000034306428],"about_ca_topic_score_codex":0.0045086946,"about_ca_topic_score_gemma":0.004681909,"teacher_disagreement_score":0.009475343,"about_ca_system_score_codex":0.0014350367,"about_ca_system_score_gemma":0.0015173611,"threshold_uncertainty_score":0.031698227},"labels":[],"label_agreement":null},{"id":"W1573072008","doi":"10.1007/978-3-540-68746-7_18","title":"Modelling Concurrency with Quotient Monoids","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McMaster University","funders":"","keywords":"Quotient; Concurrency; Computer science; Algebra over a field; Programming language; Mathematics; Combinatorics; Pure mathematics","score_opus":0.018538662174425805,"score_gpt":0.2175353934230081,"score_spread":0.1989967312485823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573072008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038033415,0.0010131152,0.9347005,0.00030198862,0.00016941836,0.00009547641,0.000106159634,0.0008793728,0.024700446],"genre_scores_gemma":[0.74923736,0.0011087924,0.23149525,0.00009750075,0.00017576852,0.00024093773,0.0002668806,0.00036380024,0.017013688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985682,0.0005763793,0.00013460878,0.00022422186,0.00034289603,0.00015359148],"domain_scores_gemma":[0.997741,0.001331483,0.00012514472,0.00046227552,0.00019869409,0.00014141052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019072408,0.0008231308,0.0008177415,0.00079780916,0.0007779555,0.0031693894,0.001614368,0.00083669805,0.005450761],"category_scores_gemma":[0.0045644497,0.00089092506,0.0014666015,0.000728098,0.003458156,0.0073587373,0.0030233169,0.0019291681,0.0008751925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058226167,0.000024591294,0.00024092062,0.000083420644,0.000014814158,0.0001702734,0.00070539326,0.016400171,0.0029151826,0.96623313,0.0005109756,0.012643012],"study_design_scores_gemma":[0.000027043552,0.000030297397,0.000065451175,0.000037978258,0.000023582003,0.00013010911,0.00011643367,0.0780909,0.0025610207,0.90673643,0.01215855,0.000022142638],"about_ca_topic_score_codex":0.0016840043,"about_ca_topic_score_gemma":0.0014958412,"teacher_disagreement_score":0.005450761,"about_ca_system_score_codex":0.0011332073,"about_ca_system_score_gemma":0.0008426833,"threshold_uncertainty_score":0.01823461},"labels":[],"label_agreement":null},{"id":"W1573082841","doi":"10.1007/11424918_24","title":"Probability and Equality: A Probabilistic Model of Identity Uncertainty","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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 British Columbia","funders":"","keywords":"Identity (music); Computer science; Probabilistic logic; Task (project management); Context (archaeology); Similarity (geometry); Representation (politics); Object (grammar); Artificial intelligence; Theoretical computer science; Image (mathematics)","score_opus":0.1747452922368207,"score_gpt":0.36920874559150796,"score_spread":0.19446345335468726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573082841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009947936,0.0008561483,0.9648439,0.0033934948,0.00015888207,0.00003493186,0.00020000132,0.000082982675,0.020481594],"genre_scores_gemma":[0.78518367,0.0021472417,0.192972,0.0011105487,0.0013109926,0.0003103276,0.00049808284,0.00017279401,0.016294265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908674,0.0041584084,0.0005089044,0.001239582,0.0025575233,0.00066825486],"domain_scores_gemma":[0.9776964,0.016448751,0.0012936156,0.0024518901,0.001535915,0.00057339505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007754543,0.0009101441,0.001521412,0.0024740137,0.0020858352,0.0067585777,0.0047935518,0.0031842508,0.0071107754],"category_scores_gemma":[0.042207368,0.0011189588,0.0020537428,0.0037138332,0.008153167,0.017532285,0.0055631255,0.0054073664,0.0010033131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013202536,0.000008075999,0.00015876812,0.000020798712,0.000009206085,0.000034141336,0.00016433228,0.0064122677,0.00005536874,0.9869257,0.0008396086,0.005358509],"study_design_scores_gemma":[0.0000030936556,0.0000038934872,0.000051439907,0.000009098692,0.00000579895,0.000038936563,0.000025063951,0.023949252,0.000043713848,0.974957,0.0009047701,0.000007901727],"about_ca_topic_score_codex":0.0032062193,"about_ca_topic_score_gemma":0.0014906959,"teacher_disagreement_score":0.007754543,"about_ca_system_score_codex":0.002133112,"about_ca_system_score_gemma":0.0013879555,"threshold_uncertainty_score":0.04101044},"labels":[],"label_agreement":null},{"id":"W1573155476","doi":"10.1007/978-3-642-15105-7_22","title":"An Occurrence Based Approach to Mine Emerging Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Alberta","funders":"","keywords":"Discriminative model; Constraint (computer-aided design); Computer science; Sequence (biology); Uniqueness; Contrast (vision); Selection (genetic algorithm); Data mining; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.022220720251300223,"score_gpt":0.26902535060711463,"score_spread":0.2468046303558144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573155476","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.025200013,0.0009481518,0.9658337,0.00019153091,0.00010887612,0.0002702655,0.002232991,0.002823566,0.002390893],"genre_scores_gemma":[0.13665523,0.0009889071,0.8499744,0.00015185731,0.00017989939,0.00024374717,0.006069327,0.00021768139,0.005518938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987966,0.00009995386,0.00015307643,0.0002956963,0.000546605,0.00010802912],"domain_scores_gemma":[0.9970457,0.0014554395,0.00025550957,0.00029456886,0.0007978886,0.00015091422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085671,0.0010252891,0.0010722593,0.007896981,0.0010551547,0.0015914282,0.0019056386,0.0013669586,0.0035755984],"category_scores_gemma":[0.0035019207,0.00043804516,0.0013475745,0.007909241,0.00056397496,0.0020316686,0.0013713398,0.0012938597,0.002857447],"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.00044424995,0.00041054658,0.011221778,0.0005322782,0.00020836464,0.0011959209,0.00037887658,0.010815796,0.030399013,0.010099012,0.010613916,0.92368025],"study_design_scores_gemma":[0.00009903378,0.0005082587,0.012690126,0.00020177435,0.00048598478,0.0058460785,0.0010033972,0.84705514,0.038760945,0.057638805,0.03558045,0.00013002161],"about_ca_topic_score_codex":0.0043310765,"about_ca_topic_score_gemma":0.00796664,"teacher_disagreement_score":0.007896981,"about_ca_system_score_codex":0.00031759054,"about_ca_system_score_gemma":0.0011300021,"threshold_uncertainty_score":0.011961579},"labels":[],"label_agreement":null},{"id":"W1573169217","doi":"10.1007/978-3-540-30500-2_11","title":"Concatenation State Machines and Simple Functions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université du Québec en Outaouais","funders":"","keywords":"Concatenation (mathematics); Computer science; Simple (philosophy); Class (philosophy); State (computer science); Domain (mathematical analysis); Theoretical computer science; Algorithm; Finite-state machine; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.010849468625131165,"score_gpt":0.23140519608087287,"score_spread":0.2205557274557417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573169217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043810524,0.008138578,0.7466536,0.0012571787,0.0011595344,0.00011189158,0.0004968695,0.0013908377,0.19698097],"genre_scores_gemma":[0.60988504,0.0075083044,0.17119193,0.00054377737,0.0013311504,0.00046229825,0.001119202,0.00058772136,0.2073705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995999,0.000095825664,0.000033116245,0.000090323614,0.00012881431,0.00005208446],"domain_scores_gemma":[0.9992762,0.0004262329,0.000052057767,0.00013151957,0.00007842734,0.000035641056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044156009,0.00081728265,0.000831695,0.00093693874,0.0012205486,0.0024083091,0.00079367426,0.0010734561,0.010986103],"category_scores_gemma":[0.0013720499,0.00061214226,0.00079809385,0.0018046646,0.0031780982,0.0057201223,0.0013688175,0.0018572146,0.0026730862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014387852,0.000008323239,0.00003759728,0.000045380788,0.00000364685,0.000047963396,0.0001706884,0.00090710865,0.00076002977,0.98261654,0.0015920184,0.013796403],"study_design_scores_gemma":[0.0000033572028,0.000009873628,0.00004632076,0.0000116574765,0.0000054015063,0.000067051595,0.000021445105,0.0025729735,0.00090661866,0.9827153,0.01363262,0.00000754547],"about_ca_topic_score_codex":0.0004330482,"about_ca_topic_score_gemma":0.0004490487,"teacher_disagreement_score":0.010986103,"about_ca_system_score_codex":0.00094881706,"about_ca_system_score_gemma":0.0005859595,"threshold_uncertainty_score":0.036752105},"labels":[],"label_agreement":null},{"id":"W1573260248","doi":"10.1007/3-540-45103-x_67","title":"A Comparison of Viewing Geometries for Augmented Reality","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Affine transformation; Homography; Computer vision; Computer science; Artificial intelligence; Euclidean geometry; Overlay; Pixel; Computer graphics (images); Augmented reality; Similarity (geometry); Object (grammar); Affine shape adaptation; Projective test; Mathematics; Image (mathematics); Geometry; Projective space; Affine combination; Pure mathematics","score_opus":0.04248452834891944,"score_gpt":0.28810099067718425,"score_spread":0.2456164623282648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573260248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06457844,0.005090628,0.86306363,0.0003590435,0.00042040378,0.00020573655,0.0020158137,0.004257869,0.060008433],"genre_scores_gemma":[0.5041467,0.0060560396,0.47558233,0.0001085508,0.00010754399,0.00010868734,0.0034915188,0.0025631469,0.007835592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961941,0.0013355877,0.00016157137,0.00040214095,0.001687401,0.00021911533],"domain_scores_gemma":[0.99184376,0.0040622265,0.00038643798,0.0017375577,0.0017828981,0.00018713599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020169502,0.0013525455,0.0009500142,0.00263439,0.0005549388,0.0044199093,0.0015185253,0.0008558534,0.021585967],"category_scores_gemma":[0.014633536,0.0009943055,0.0011882257,0.0029985628,0.0006999483,0.0038121408,0.0025250257,0.0008032997,0.004894692],"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.0022438243,0.00015243873,0.0043980596,0.0007795821,0.00015185977,0.00024372444,0.0016340031,0.02953617,0.03711778,0.056370933,0.008656292,0.85871524],"study_design_scores_gemma":[0.00046592686,0.0029726229,0.05545369,0.0012767181,0.0011543497,0.008740235,0.008705222,0.45286995,0.15714571,0.096711226,0.21371612,0.00078819937],"about_ca_topic_score_codex":0.001555273,"about_ca_topic_score_gemma":0.0019042713,"teacher_disagreement_score":0.021585967,"about_ca_system_score_codex":0.00042846362,"about_ca_system_score_gemma":0.0005017608,"threshold_uncertainty_score":0.07221228},"labels":[],"label_agreement":null},{"id":"W1573292081","doi":"10.1007/3-540-45490-x_37","title":"A Theory and Approach to Improving Relevance Ranking in Web Retrieval","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Regina","funders":"","keywords":"Computer science; Information retrieval; Web page; Relevance (law); Ranking (information retrieval); Web search engine; World Wide Web; Search engine; Web search query","score_opus":0.013714645609097818,"score_gpt":0.23169170124991165,"score_spread":0.21797705564081382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573292081","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.0025244665,0.0022174993,0.99189466,0.00065536716,0.00019287293,0.0000987352,0.000093787254,0.0006715345,0.0016509738],"genre_scores_gemma":[0.08021548,0.0024951005,0.90854245,0.00067378255,0.001429063,0.00034448828,0.00034111887,0.00026221733,0.0056962096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98686856,0.0052352594,0.00072736933,0.001472364,0.0051690703,0.0005273952],"domain_scores_gemma":[0.98079556,0.011847514,0.00072359125,0.002925955,0.0034312694,0.00027609794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010936647,0.0016370884,0.0039075394,0.0075061317,0.002150585,0.0043171714,0.005808554,0.0036118065,0.0061267084],"category_scores_gemma":[0.035248186,0.001334444,0.0025464308,0.008750809,0.0036401006,0.009865131,0.0032496466,0.0040528807,0.003119949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024288047,0.00047194646,0.0014035566,0.00097139034,0.00034519154,0.00011075291,0.00044188838,0.06955767,0.0063879513,0.24413195,0.028252572,0.6476823],"study_design_scores_gemma":[0.000106142455,0.0003505453,0.0007608413,0.0001035013,0.00032165178,0.00039671428,0.00012121075,0.6071695,0.0056366534,0.36862668,0.016297683,0.000108883505],"about_ca_topic_score_codex":0.0054264134,"about_ca_topic_score_gemma":0.005951298,"teacher_disagreement_score":0.010936647,"about_ca_system_score_codex":0.0022948573,"about_ca_system_score_gemma":0.0030581132,"threshold_uncertainty_score":0.057839215},"labels":[],"label_agreement":null},{"id":"W1573325973","doi":"10.1007/978-3-540-27859-7_37","title":"Crossing Boundaries with Web-Based Tools for Learning Object Evaluation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"British Columbia Institute of Technology; Simon Fraser University","funders":"","keywords":"Computer science; Learning object; World Wide Web; Object (grammar); Human–computer interaction; Data science; Artificial intelligence","score_opus":0.0312623967102079,"score_gpt":0.2974553689623518,"score_spread":0.2661929722521439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573325973","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.03382543,0.0004927343,0.9471802,0.00018244161,0.000083095714,0.00017055354,0.00006410322,0.0062538753,0.01174753],"genre_scores_gemma":[0.36527786,0.00030024853,0.624815,0.0001074874,0.000041842126,0.00029766193,0.00033707666,0.0015642189,0.0072586704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99226344,0.003031226,0.0005368208,0.00042768198,0.0034176845,0.00032322534],"domain_scores_gemma":[0.98662543,0.008755946,0.00052075414,0.0014493222,0.002227228,0.00042123778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005421914,0.0006772978,0.0007520209,0.002298639,0.0007490601,0.0051044077,0.0014929012,0.0016358241,0.0053960388],"category_scores_gemma":[0.025276184,0.00057252555,0.0004940467,0.0016216333,0.0009461165,0.0076349946,0.004067054,0.0015489853,0.001960047],"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.00046012102,0.00028218923,0.0021174368,0.0002044949,0.000036072368,0.0001927155,0.0020423513,0.006086316,0.013023689,0.032971937,0.0059437677,0.9366391],"study_design_scores_gemma":[0.00018048214,0.00066496833,0.0076263286,0.0008424224,0.00019079607,0.0011875649,0.002816092,0.5028383,0.12734678,0.2525722,0.103507146,0.00022688191],"about_ca_topic_score_codex":0.0010861664,"about_ca_topic_score_gemma":0.0013046999,"teacher_disagreement_score":0.005421914,"about_ca_system_score_codex":0.0006618756,"about_ca_system_score_gemma":0.0007076194,"threshold_uncertainty_score":0.028674185},"labels":[],"label_agreement":null},{"id":"W1573484378","doi":"10.1007/3-540-44828-4_16","title":"Unitary Error Bases: Constructions, Equivalence, and Applications","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unitary state; Mutually unbiased bases; Equivalence (formal languages); Mathematics; Algebra over a field; Counterexample; Hadamard transform; Algebraic number; Dimension (graph theory); Pure mathematics; Discrete mathematics","score_opus":0.013437660593218029,"score_gpt":0.2417368057881924,"score_spread":0.22829914519497438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573484378","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.0257151,0.014322888,0.8155844,0.0025005133,0.0012667526,0.00012807627,0.00031827376,0.0005297432,0.13963416],"genre_scores_gemma":[0.5818978,0.016168041,0.34541798,0.001047799,0.00154952,0.00051294855,0.00071645016,0.0005094608,0.052180056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983536,0.00052442844,0.000119398406,0.00024885024,0.0005701511,0.00018359395],"domain_scores_gemma":[0.9980866,0.0009313508,0.00012770736,0.00044205884,0.00032946636,0.00008295016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020257593,0.00082021224,0.0009804378,0.0018556727,0.0017477666,0.0038745166,0.0015168064,0.0020261854,0.007907209],"category_scores_gemma":[0.006091964,0.00054158684,0.00064343656,0.0029256775,0.0043338942,0.006286088,0.003322237,0.004453861,0.0017969024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013065998,0.000012180824,0.00002907393,0.00004089697,0.0000031605398,0.000010685964,0.00010921858,0.00045347703,0.0003208958,0.97850364,0.0009839102,0.019519797],"study_design_scores_gemma":[0.0000072713287,0.000015492047,0.00003800284,0.00004501828,0.0000044118783,0.00007501884,0.00006152085,0.0025226732,0.0012330564,0.9874802,0.008505064,0.000012152845],"about_ca_topic_score_codex":0.0003346692,"about_ca_topic_score_gemma":0.00028799704,"teacher_disagreement_score":0.007907209,"about_ca_system_score_codex":0.0007656862,"about_ca_system_score_gemma":0.00066531065,"threshold_uncertainty_score":0.026452243},"labels":[],"label_agreement":null},{"id":"W1573509053","doi":"10.1007/978-3-540-27800-9_13","title":"The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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 Calgary","funders":"","keywords":"Cryptosystem; The Imaginary; Quadratic equation; Class (philosophy); Mathematics; Arithmetic; Computer science; Discrete mathematics; Cryptography; Algorithm; Psychology; Artificial intelligence","score_opus":0.00688559336694569,"score_gpt":0.21907603396931785,"score_spread":0.21219044060237216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573509053","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.5529053,0.004793994,0.2653692,0.009792406,0.0011492196,0.00020683861,0.0005079042,0.0010375247,0.16423765],"genre_scores_gemma":[0.977113,0.0007825611,0.011514641,0.00021146072,0.00036040865,0.00006871203,0.00011430885,0.00008245066,0.009752383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807703,0.000612432,0.00009512741,0.00026441526,0.0005913158,0.00035954537],"domain_scores_gemma":[0.99103725,0.0064466125,0.00044049052,0.0012927821,0.0003936483,0.00038916085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024853165,0.0007518127,0.0008771694,0.0013616185,0.0016056203,0.0054221917,0.0009247415,0.001627817,0.0062075923],"category_scores_gemma":[0.006719131,0.0006604468,0.0008855015,0.0007582801,0.0053820577,0.0091549,0.0020496342,0.0037681765,0.0009434444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018516759,0.000025402493,0.00013791466,0.000047010042,0.000011439346,0.000035508227,0.00020212124,0.002573983,0.002239068,0.9882258,0.0010634239,0.005253191],"study_design_scores_gemma":[0.000065011474,0.000053580407,0.00012612638,0.00003053394,0.000010723758,0.000092800066,0.000054860287,0.019873893,0.002607436,0.9735146,0.0035461073,0.0000242128],"about_ca_topic_score_codex":0.00032441082,"about_ca_topic_score_gemma":0.0001840771,"teacher_disagreement_score":0.0062075923,"about_ca_system_score_codex":0.0019677437,"about_ca_system_score_gemma":0.0008621669,"threshold_uncertainty_score":0.020766437},"labels":[],"label_agreement":null},{"id":"W1573535660","doi":"10.1007/978-3-540-45233-1_14","title":"Aligning Work Practices and Mobile Technologies: Groupware Design for Loosely Coupled Mobile Groups","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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 Saskatchewan","funders":"","keywords":"Computer science; Collaborative software; Computer-supported cooperative work; Human–computer interaction; Work (physics); Mobile computing; Mobile technology; World Wide Web; Telecommunications; Engineering","score_opus":0.04171152767882411,"score_gpt":0.27915504704131605,"score_spread":0.23744351936249194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573535660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09391613,0.0003067927,0.89898056,0.00042972947,0.000033440007,0.00022293477,0.000011642588,0.000432867,0.005665842],"genre_scores_gemma":[0.4657805,0.00024256355,0.53021073,0.000070310256,0.000012985021,0.0004663436,0.000063302075,0.00014348161,0.003009805],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99757034,0.0014803241,0.00011563819,0.00023107257,0.00045794842,0.00014464247],"domain_scores_gemma":[0.996594,0.0020731734,0.0002372853,0.0005132201,0.00037500777,0.00020728946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031779138,0.00055266666,0.0003347381,0.0004933411,0.0012019526,0.0025853873,0.0016219675,0.0010833963,0.0022023302],"category_scores_gemma":[0.007673576,0.00051042164,0.00035255455,0.0006574387,0.0014386429,0.0029181854,0.002434309,0.0009574166,0.00040900894],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003230763,0.0006313413,0.005865276,0.00078292924,0.000080171485,0.0003640487,0.06570295,0.02540874,0.03575262,0.09660018,0.003437213,0.7650514],"study_design_scores_gemma":[0.00037434042,0.0026170048,0.0136246225,0.001026949,0.00041614502,0.0013296369,0.058838993,0.36724845,0.048564628,0.38457286,0.12117756,0.0002087679],"about_ca_topic_score_codex":0.0007908499,"about_ca_topic_score_gemma":0.0015034025,"teacher_disagreement_score":0.0031779138,"about_ca_system_score_codex":0.00068187615,"about_ca_system_score_gemma":0.0010604771,"threshold_uncertainty_score":0.016806602},"labels":[],"label_agreement":null},{"id":"W1573576464","doi":"10.1007/3-540-44914-0_18","title":"Experiments with Automatically Created Memory-Based Heuristics","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":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":"Heuristics; Heuristic; Computer science; Set (abstract data type); Lookup table; Table (database); State (computer science); Conjecture; Space (punctuation); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Data mining; Programming language; Discrete mathematics","score_opus":0.014799633559551965,"score_gpt":0.23872508286784513,"score_spread":0.22392544930829317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573576464","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.9501998,0.0015842038,0.030978648,0.0003893983,0.00048275047,0.00062515645,0.001497143,0.0032165032,0.011026268],"genre_scores_gemma":[0.9358093,0.00061524723,0.054370336,0.00019363934,0.00006583763,0.0006214811,0.002571313,0.00077310466,0.0049796714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784696,0.0009417805,0.0002959442,0.00042835914,0.00031639548,0.00017055369],"domain_scores_gemma":[0.92419386,0.0672711,0.0011669853,0.0042142123,0.0024008676,0.00075300934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029824406,0.001763322,0.0014445405,0.0008748036,0.0006359093,0.0015871358,0.0038751608,0.0024754463,0.009647606],"category_scores_gemma":[0.04466337,0.001228872,0.0005869477,0.0013494093,0.0010414629,0.0031850063,0.0012760315,0.0022108825,0.0019864417],"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.04166374,0.027625702,0.0060559288,0.005476539,0.00097077206,0.001144562,0.0042925524,0.3651699,0.04937829,0.0056884736,0.016267708,0.47626582],"study_design_scores_gemma":[0.00868026,0.012325917,0.005341061,0.00036752256,0.0009777771,0.0005320337,0.0013516145,0.8802572,0.07009092,0.009762816,0.010024887,0.00028803287],"about_ca_topic_score_codex":0.0069008507,"about_ca_topic_score_gemma":0.0036902505,"teacher_disagreement_score":0.009647606,"about_ca_system_score_codex":0.0010014762,"about_ca_system_score_gemma":0.0009916447,"threshold_uncertainty_score":0.032274485},"labels":[],"label_agreement":null},{"id":"W1573675828","doi":"10.1007/3-540-46029-2_23","title":"Hierarchical Workload Characterization for a Busy Web Server","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Workload; Computer science; Web server; Hierarchy; The Internet; Server; World Wide Web; Client–server model; Clickstream; Web traffic; AppleShare; Server farm; Computer network; Web API; Operating system","score_opus":0.016480720878969023,"score_gpt":0.22515881075645033,"score_spread":0.20867808987748132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573675828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3604933,0.0004065796,0.63202393,0.00011887596,0.000041287658,0.0001501216,0.0005407585,0.0026616924,0.0035634383],"genre_scores_gemma":[0.96589124,0.00008094401,0.032407913,0.000027659467,0.000046956116,0.000059921626,0.00043634945,0.00017087738,0.00087808736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992312,0.0001235242,0.00007188068,0.00013021224,0.00024704638,0.00019617128],"domain_scores_gemma":[0.99728525,0.0011968272,0.00025058023,0.00038832356,0.000591819,0.00028714704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068756414,0.0008440981,0.00068558287,0.0021062132,0.0006017241,0.0012085595,0.0011983236,0.00052682194,0.0021205936],"category_scores_gemma":[0.0037265294,0.00036420915,0.00039618468,0.0015037261,0.0004118889,0.0011569087,0.0007301373,0.0005728042,0.00059123116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003379114,0.00053656485,0.037165754,0.00035826655,0.0001105121,0.0013785383,0.0008373415,0.423091,0.25639075,0.022011472,0.00624344,0.24849728],"study_design_scores_gemma":[0.0000053846775,0.000052420917,0.002890765,0.0000040771934,0.000009846602,0.0001327133,0.000042501135,0.9894901,0.005127645,0.002029081,0.00020539165,0.000010169229],"about_ca_topic_score_codex":0.0032689653,"about_ca_topic_score_gemma":0.0022354864,"teacher_disagreement_score":0.0032689653,"about_ca_system_score_codex":0.00075591396,"about_ca_system_score_gemma":0.0005881601,"threshold_uncertainty_score":0.007094085},"labels":[],"label_agreement":null},{"id":"W1573698156","doi":"10.1007/3-540-45754-2_13","title":"Immersed Visual Data Mining: Walking the Walk","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data warehouse; Architecture; Visualization; XML; Human–computer interaction; Interactive visual analysis; Data visualization; Data mining; World Wide Web","score_opus":0.039145002991682026,"score_gpt":0.2825056599917915,"score_spread":0.24336065700010948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573698156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073757605,0.006248656,0.94974506,0.0051131905,0.0010276656,0.00010782493,0.0005216836,0.0041742353,0.025685841],"genre_scores_gemma":[0.1684822,0.0088782925,0.7812586,0.0017226315,0.0006438412,0.00023086523,0.0015575306,0.0022648303,0.034961175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.00023573889,0.000039452207,0.00021629522,0.0002115051,0.000051556268],"domain_scores_gemma":[0.9978115,0.001058705,0.000073710864,0.0004523864,0.00038541082,0.00021830022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012597488,0.0008866911,0.00090021204,0.0015684933,0.0009692559,0.004380446,0.0022394634,0.001913252,0.019418621],"category_scores_gemma":[0.007999421,0.00089476653,0.00092657725,0.0016292413,0.0016314689,0.007606196,0.004488203,0.0018351951,0.007874847],"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.00031586143,0.00010765077,0.00097457005,0.0005702383,0.000090053385,0.00016049725,0.001011609,0.0062102275,0.0044728983,0.05893969,0.06402132,0.8631254],"study_design_scores_gemma":[0.00008316784,0.00016535912,0.0012012774,0.00064216286,0.00008760934,0.0007551248,0.0022308382,0.13966584,0.0077139684,0.593432,0.25390276,0.000119940574],"about_ca_topic_score_codex":0.002405202,"about_ca_topic_score_gemma":0.0028201912,"teacher_disagreement_score":0.019418621,"about_ca_system_score_codex":0.0005530938,"about_ca_system_score_gemma":0.0007481185,"threshold_uncertainty_score":0.06496179},"labels":[],"label_agreement":null},{"id":"W1573704087","doi":"10.1007/11866763_94","title":"Fast and Robust Clinical Triple-Region Image Segmentation Using One Level Set Function","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; CARE Canada; General Electric (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Image segmentation; Level set (data structures); Level set method; Scale-space segmentation; Pattern recognition (psychology); Computer vision; Image processing; Image (mathematics)","score_opus":0.08333183951679882,"score_gpt":0.3384066075782218,"score_spread":0.25507476806142293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573704087","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.007194853,0.00026545295,0.98983324,0.00013722852,0.00003099571,0.000069710695,0.0000905694,0.0017587392,0.0006192132],"genre_scores_gemma":[0.09731591,0.0003476976,0.89852774,0.00013812569,0.00004989183,0.00015950714,0.00034235537,0.0010511882,0.0020676178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991134,0.00015794032,0.00006893148,0.00015614554,0.00042769455,0.00007587113],"domain_scores_gemma":[0.9986638,0.0005240581,0.00015518372,0.00029889634,0.0002724502,0.00008552962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014721538,0.0012915117,0.0016627461,0.0018742388,0.0004687334,0.0021530236,0.0013881637,0.001789389,0.0042374283],"category_scores_gemma":[0.0032820783,0.0015304295,0.0014147365,0.001090908,0.0004970443,0.001285303,0.0022707519,0.0017940182,0.002859733],"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.00091308414,0.00014183637,0.0023736625,0.00045905664,0.00021596979,0.0003570237,0.00018657236,0.04131055,0.14505602,0.0047460985,0.006121908,0.7981182],"study_design_scores_gemma":[0.000081880375,0.0003803864,0.0048864433,0.00007884361,0.00022756157,0.00450018,0.00009240662,0.84948134,0.123242944,0.0067532156,0.010108549,0.00016626705],"about_ca_topic_score_codex":0.0018816154,"about_ca_topic_score_gemma":0.002534741,"teacher_disagreement_score":0.0042374283,"about_ca_system_score_codex":0.0005139342,"about_ca_system_score_gemma":0.0017672655,"threshold_uncertainty_score":0.014175653},"labels":[],"label_agreement":null},{"id":"W1573717476","doi":"10.1007/3-540-47922-8_10","title":"Generalized Arc Consistency with Application to MaxCSP","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Generalization; Heuristics; Computer science; Consistency (knowledge bases); Formalism (music); Local consistency; Algorithm; Mathematical optimization; Theoretical computer science; Applied mathematics; Mathematics; Artificial intelligence; Constraint satisfaction; Probabilistic logic","score_opus":0.013145859269060213,"score_gpt":0.2248003671819673,"score_spread":0.2116545079129071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573717476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030319286,0.0003131248,0.9865398,0.00029153615,0.000162658,0.00008957259,0.00019433055,0.001306666,0.008070452],"genre_scores_gemma":[0.10328606,0.00053192157,0.8851456,0.00023970395,0.00034802692,0.00030720577,0.00051907566,0.0011910332,0.008431402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676204,0.0012787542,0.00017900081,0.00057390594,0.0010316917,0.0001746421],"domain_scores_gemma":[0.9941151,0.0032001047,0.0002523714,0.0013639217,0.00095105806,0.00011744072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037859431,0.0011389425,0.0021867508,0.0018297953,0.0014740721,0.0026550286,0.0042480165,0.0013564128,0.011817168],"category_scores_gemma":[0.013969386,0.0012732181,0.0021644745,0.0063114725,0.0020690872,0.0045605125,0.0040079285,0.004714781,0.0016584188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000207073,0.00011114917,0.0003686578,0.00054872234,0.000089344096,0.00021683727,0.00030136158,0.13606194,0.0020350122,0.56740284,0.017720236,0.2749369],"study_design_scores_gemma":[0.000050988885,0.000030715928,0.00012617128,0.000048470352,0.00005809823,0.000118912336,0.000050300834,0.32328644,0.002710511,0.6584938,0.014997363,0.000028209699],"about_ca_topic_score_codex":0.0050319196,"about_ca_topic_score_gemma":0.005800929,"teacher_disagreement_score":0.011817168,"about_ca_system_score_codex":0.001765409,"about_ca_system_score_gemma":0.0024044286,"threshold_uncertainty_score":0.039532304},"labels":[],"label_agreement":null},{"id":"W1573750717","doi":"10.1007/978-3-540-45236-2_28","title":"Generating Counterexamples for Multi-valued Model-Checking","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Counterexample; Model checking; Extension (predicate logic); Abstraction model checking; Temporal logic; Computer science; Symbolic trajectory evaluation; Theoretical computer science; Property (philosophy); Algorithm; Computation tree logic; Algebra over a field; Programming language; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.10573797888699787,"score_gpt":0.33211877481230756,"score_spread":0.22638079592530969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573750717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17949443,0.0002459599,0.8095605,0.0006006584,0.00018059573,0.000197848,0.0001773131,0.0037583662,0.0057843067],"genre_scores_gemma":[0.74045,0.00009202138,0.25678393,0.00018414627,0.000029247385,0.00019087868,0.00026648585,0.0004454264,0.0015578506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449486,0.002137,0.0003510761,0.0007929767,0.0017042697,0.00051984447],"domain_scores_gemma":[0.9676444,0.027531367,0.0009754573,0.002627884,0.0009163079,0.00030461096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033761454,0.0012473934,0.0013420404,0.0019740916,0.0009390586,0.0027997259,0.0024029,0.0024152615,0.0035421618],"category_scores_gemma":[0.026237639,0.0010707976,0.0020788813,0.0013403299,0.0025679267,0.0037530595,0.0037403263,0.002629097,0.0004564795],"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.0023422732,0.0009164333,0.007745075,0.0010268305,0.00038608312,0.0015424154,0.0013575598,0.32931134,0.04507749,0.41921127,0.004926505,0.18615681],"study_design_scores_gemma":[0.00014307779,0.000104986866,0.00025159307,0.00008132712,0.00009361069,0.00022008763,0.000081124315,0.80895656,0.029586652,0.15912151,0.0013211041,0.00003825221],"about_ca_topic_score_codex":0.00083711033,"about_ca_topic_score_gemma":0.0019248383,"teacher_disagreement_score":0.0035421618,"about_ca_system_score_codex":0.0014071574,"about_ca_system_score_gemma":0.0010611947,"threshold_uncertainty_score":0.017854929},"labels":[],"label_agreement":null},{"id":"W1573815472","doi":"10.1007/978-3-540-45076-4_20","title":"A Bi-initiation-Based Path Restoration Mechanism for Wavelength-Routed WDM Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Ottawa","funders":"","keywords":"Wavelength-division multiplexing; Mechanism (biology); Computer network; Path (computing); Computer science; Wavelength; Distributed computing; Optoelectronics; Materials science; Physics","score_opus":0.013998316967847093,"score_gpt":0.2209292735401757,"score_spread":0.2069309565723286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573815472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05361905,0.00086800667,0.9260426,0.0004204736,0.00046321246,0.00035214736,0.00014002666,0.007582368,0.010512152],"genre_scores_gemma":[0.5757847,0.0005704319,0.405082,0.00019116006,0.00021261358,0.00031995217,0.00032505207,0.00035643682,0.01715771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923086,0.00013388907,0.00005772474,0.00010756935,0.00035776658,0.000112218346],"domain_scores_gemma":[0.9982992,0.00033745347,0.00012850297,0.0006415101,0.00047120723,0.00012205034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016775826,0.0005431434,0.0007924515,0.00125999,0.0013061141,0.0016229068,0.0031300501,0.0011161561,0.0041559697],"category_scores_gemma":[0.0019896168,0.0005629006,0.0004304756,0.0007999737,0.0006832894,0.001886269,0.0017434908,0.0019100796,0.0015894626],"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.0018979664,0.0010682344,0.00090353296,0.0004425596,0.00011698246,0.00032509046,0.0005577478,0.04832996,0.25509772,0.14381321,0.015358142,0.5320888],"study_design_scores_gemma":[0.00020281634,0.0006155312,0.00077268615,0.000053267166,0.00013109627,0.0004704051,0.00008917849,0.799905,0.13141257,0.044297412,0.021889133,0.0001609491],"about_ca_topic_score_codex":0.0010398746,"about_ca_topic_score_gemma":0.0013864097,"teacher_disagreement_score":0.0041559697,"about_ca_system_score_codex":0.00076368265,"about_ca_system_score_gemma":0.0009926141,"threshold_uncertainty_score":0.013903081},"labels":[],"label_agreement":null},{"id":"W1573865009","doi":"10.1007/3-540-45351-2_8","title":"Optimal Paths in Weighted Timed Automata","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Timed automaton; Reachability; Computer science; Automaton; Deterministic automaton; Reachability problem; Shortest path problem; Floyd–Warshall algorithm; Directed graph; Algorithm; Graph; Dijkstra's algorithm; Theoretical computer science","score_opus":0.021872259693656554,"score_gpt":0.27347287509335083,"score_spread":0.25160061539969425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573865009","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.06334856,0.0004934103,0.919227,0.00021504884,0.00009746654,0.00010176,0.00024277717,0.00056115777,0.01571282],"genre_scores_gemma":[0.5349347,0.0013308186,0.44259557,0.0001109617,0.00007873565,0.00037024997,0.000622239,0.0005700698,0.019386657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990619,0.00019500274,0.000090322974,0.00023024187,0.0002952034,0.00012733717],"domain_scores_gemma":[0.9980153,0.0013287922,0.00015370887,0.00018575661,0.00022011944,0.00009639776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089920656,0.00075243914,0.00091411144,0.0010717981,0.00084190554,0.001867206,0.001288993,0.00080434297,0.006131408],"category_scores_gemma":[0.0047245175,0.0010653762,0.0010102335,0.0018109934,0.0014358152,0.003852244,0.0015970537,0.0018189844,0.00057731755],"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.00016114938,0.000051405394,0.00031977642,0.00025260908,0.000037163954,0.00010853408,0.00023533792,0.119369514,0.0045827245,0.8139658,0.0012312869,0.059684657],"study_design_scores_gemma":[0.000022090755,0.000026409183,0.00006695866,0.000027802827,0.00002498936,0.00003869107,0.00004343057,0.11998321,0.001991208,0.87542796,0.0023367929,0.000010458366],"about_ca_topic_score_codex":0.0020294308,"about_ca_topic_score_gemma":0.002926448,"teacher_disagreement_score":0.006131408,"about_ca_system_score_codex":0.0014536489,"about_ca_system_score_gemma":0.0012402188,"threshold_uncertainty_score":0.020511627},"labels":[],"label_agreement":null},{"id":"W1573866825","doi":"10.1007/11554714_11","title":"Power Boosts for Cluster Tests","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Adjacency list; Computer science; Cluster (spacecraft); Genome; Component (thermodynamics); Similarity (geometry); Adjacency matrix; Theoretical computer science; Data mining; Algorithm; Artificial intelligence; Gene; Biology; Genetics; Physics; Graph","score_opus":0.010156003267830276,"score_gpt":0.24898815828261486,"score_spread":0.23883215501478458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573866825","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.011182804,0.0011282227,0.963944,0.001154164,0.0005968617,0.00020203328,0.00042843987,0.006676595,0.014686856],"genre_scores_gemma":[0.3445652,0.0005624772,0.6232464,0.0011570058,0.0016055149,0.0010519809,0.0016544632,0.003496143,0.0226608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98930115,0.005498368,0.0004046978,0.0012156343,0.002695028,0.0008851206],"domain_scores_gemma":[0.951668,0.03247414,0.0008770696,0.010250214,0.0036488483,0.0010817522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0100576235,0.0018908655,0.0030104122,0.002222562,0.0015912835,0.0026625555,0.0054304083,0.001965085,0.0325903],"category_scores_gemma":[0.06954664,0.0010866864,0.0018561461,0.0030269844,0.0024106735,0.005184895,0.005087019,0.0041834796,0.0068852906],"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.0025997495,0.00036317518,0.002671276,0.00046293397,0.00022147714,0.00022378094,0.00021933294,0.089736365,0.0042480845,0.20604749,0.058681127,0.6345252],"study_design_scores_gemma":[0.00023052307,0.00017115661,0.00068075594,0.000046317098,0.00008222505,0.00013643088,0.00004645007,0.5676666,0.0044499007,0.4172893,0.009166961,0.000033335127],"about_ca_topic_score_codex":0.0017407159,"about_ca_topic_score_gemma":0.002996673,"teacher_disagreement_score":0.0325903,"about_ca_system_score_codex":0.0015351739,"about_ca_system_score_gemma":0.0024612783,"threshold_uncertainty_score":0.10902542},"labels":[],"label_agreement":null},{"id":"W1573908636","doi":"10.1007/978-3-540-30112-7_7","title":"A Framework for Asynchronous Change Awareness in Collaboratively-Constructed Documents","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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 Calgary","funders":"","keywords":"Artifact (error); Computer science; Asynchronous communication; Workspace; Human–computer interaction; World Wide Web; Knowledge management; Multimedia; Artificial intelligence; Telecommunications","score_opus":0.04349868224823743,"score_gpt":0.30441918006261237,"score_spread":0.26092049781437493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573908636","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.0015568292,0.00007073423,0.9933187,0.0000901547,0.00003018883,0.00010029171,0.000034987006,0.0028349536,0.0019631884],"genre_scores_gemma":[0.07968255,0.00013272102,0.9150319,0.00007332257,0.000041820316,0.0003560722,0.00020301293,0.00055725867,0.003921339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949092,0.0016277542,0.0005029786,0.0010795104,0.0015126843,0.00036780964],"domain_scores_gemma":[0.9926771,0.0036490152,0.00042514165,0.0019779685,0.00082864135,0.00044215997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064717075,0.0011349726,0.001056309,0.002112224,0.002227099,0.007818567,0.0043126275,0.0031996807,0.007440273],"category_scores_gemma":[0.012797854,0.0013521578,0.0018159618,0.0016792165,0.0038524617,0.010346827,0.006615471,0.0037074555,0.0019947486],"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.0002010809,0.0002603054,0.0010326764,0.00034875257,0.000071299124,0.00048269247,0.0070903106,0.01843596,0.00831545,0.7611921,0.0051361057,0.19743325],"study_design_scores_gemma":[0.00013583728,0.00017312657,0.00054218376,0.0002510524,0.00019594062,0.0005464948,0.0014597897,0.36901298,0.018519185,0.49602312,0.1129681,0.00017214761],"about_ca_topic_score_codex":0.005842744,"about_ca_topic_score_gemma":0.0052114017,"teacher_disagreement_score":0.007818567,"about_ca_system_score_codex":0.0013117135,"about_ca_system_score_gemma":0.0020329887,"threshold_uncertainty_score":0.03422606},"labels":[],"label_agreement":null},{"id":"W1573954828","doi":"10.1007/11561071_29","title":"Cache-Oblivious Comparison-Based Algorithms on Multisets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Cache; Cache algorithms; Block (permutation group theory); CPU cache; Randomized algorithm; Context (archaeology); Cache-oblivious algorithm; Factor (programming language); Block size; Constant (computer programming); Algorithm; Upper and lower bounds; Parallel computing; Mathematics; Key (lock); Combinatorics","score_opus":0.03047518635121663,"score_gpt":0.28839035740204444,"score_spread":0.2579151710508278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573954828","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.049328584,0.002798893,0.9255091,0.0007661694,0.0003617494,0.0002132412,0.00044025487,0.005820585,0.014761465],"genre_scores_gemma":[0.34850067,0.0007911558,0.6328394,0.00041702017,0.00025008628,0.00048450884,0.00087605545,0.0010961341,0.014744959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970018,0.0007195842,0.00022290082,0.0005427295,0.001103945,0.00040913158],"domain_scores_gemma":[0.991916,0.0037255227,0.0003547241,0.0031115396,0.000690133,0.00020209084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021763367,0.0012644309,0.0028268704,0.0022455256,0.0025855186,0.003044814,0.0052888896,0.0019024705,0.011032934],"category_scores_gemma":[0.0099349925,0.001259179,0.001386872,0.0065315994,0.001940493,0.009925185,0.005566577,0.0034310191,0.0024263784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023539835,0.00041488223,0.00094310666,0.000705571,0.0002070561,0.00014757329,0.00051308447,0.16800582,0.011797851,0.23115622,0.029515177,0.5542397],"study_design_scores_gemma":[0.00021434123,0.00026894925,0.0003168552,0.0000969964,0.000098123666,0.00024118987,0.000098754346,0.5061718,0.011436254,0.4710662,0.009936133,0.000054370474],"about_ca_topic_score_codex":0.0016507651,"about_ca_topic_score_gemma":0.0027592685,"teacher_disagreement_score":0.011032934,"about_ca_system_score_codex":0.002574633,"about_ca_system_score_gemma":0.002288966,"threshold_uncertainty_score":0.036908865},"labels":[],"label_agreement":null},{"id":"W1574009922","doi":"10.1007/978-3-540-30121-9_104","title":"A Context-Sensitive Middleware for Managing Embedded Pervasive Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Profiling (computer programming); Ubiquitous computing; Middleware (distributed applications); Distributed computing; Operating system","score_opus":0.026751731254138912,"score_gpt":0.24458951667692874,"score_spread":0.21783778542278984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574009922","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.013315111,0.002455235,0.9528964,0.0003178342,0.00042570764,0.00019711921,0.00012630459,0.023631843,0.006634488],"genre_scores_gemma":[0.3030801,0.0032787067,0.655236,0.00087952387,0.0003702074,0.000390321,0.0010044258,0.0022223548,0.033538304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991967,0.00011639921,0.00011284371,0.00013911446,0.00032994294,0.0001050648],"domain_scores_gemma":[0.9992459,0.00015537608,0.000058524878,0.0002815129,0.0001111442,0.00014767569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011890518,0.0009131843,0.0010571978,0.00077223015,0.0008169576,0.0026896093,0.0031414006,0.0015446049,0.002609388],"category_scores_gemma":[0.00206213,0.0009143501,0.00059420575,0.0007782443,0.0007304365,0.0028846515,0.0030209895,0.0025813521,0.0016237283],"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.0008171484,0.00066507456,0.0020166405,0.0010810875,0.00027890044,0.0013702299,0.002621818,0.031267293,0.18617508,0.08615101,0.03811014,0.64944553],"study_design_scores_gemma":[0.00020715139,0.00066334644,0.0028535686,0.0003503501,0.00066848757,0.002565086,0.0006089581,0.3703636,0.17982216,0.074563436,0.3670127,0.00032120149],"about_ca_topic_score_codex":0.0012899229,"about_ca_topic_score_gemma":0.0016625181,"teacher_disagreement_score":0.0031414006,"about_ca_system_score_codex":0.0004669193,"about_ca_system_score_gemma":0.0007889791,"threshold_uncertainty_score":0.008729339},"labels":[],"label_agreement":null},{"id":"W1574040800","doi":"10.1007/978-3-540-72951-8_18","title":"Location Oblivious Distributed Unit Disk Graph Coloring","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Carleton University","funders":"","keywords":"Graph coloring; Computer science; List coloring; Edge coloring; Graph; Greedy coloring; Upper and lower bounds; Fractional coloring; Unit disk; Combinatorics; Chromatic scale; Algorithm; Unit disk graph; Mathematics; Theoretical computer science; Graph power; Line graph","score_opus":0.03679719369105777,"score_gpt":0.30106360173470526,"score_spread":0.2642664080436475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574040800","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.071218945,0.0005850236,0.8710026,0.00120725,0.0004144974,0.00027250085,0.0011067662,0.011676417,0.042516068],"genre_scores_gemma":[0.6777484,0.0003494385,0.27924123,0.00045372845,0.00015333289,0.0003038042,0.0010416687,0.0012248799,0.039483577],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903476,0.00024704047,0.000029571594,0.00020389131,0.00026492376,0.00021989863],"domain_scores_gemma":[0.99684626,0.0007538886,0.00013673812,0.0018382762,0.00026532362,0.00015942106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776665,0.000734224,0.0012645435,0.0005343507,0.0014261894,0.0017290193,0.003149364,0.00087752007,0.016602369],"category_scores_gemma":[0.0029546393,0.0005687496,0.0004051748,0.0019513023,0.00076960603,0.0027386723,0.0032438736,0.0015405503,0.0035700507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022220502,0.0007712425,0.0010116891,0.0008376262,0.000115548275,0.00024194668,0.00049291825,0.28659055,0.036454342,0.21994075,0.08405377,0.36726758],"study_design_scores_gemma":[0.00032481924,0.00016079059,0.00045479217,0.00003772814,0.00006418446,0.00020212443,0.00018548335,0.79600394,0.0203126,0.16611886,0.016098289,0.000036408866],"about_ca_topic_score_codex":0.0021324302,"about_ca_topic_score_gemma":0.00548852,"teacher_disagreement_score":0.016602369,"about_ca_system_score_codex":0.0019924631,"about_ca_system_score_gemma":0.0022296433,"threshold_uncertainty_score":0.055540442},"labels":[],"label_agreement":null},{"id":"W1574082713","doi":"10.1007/3-540-44634-6","title":"Algorithms and Data Structures","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":626,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.030087856308124047,"score_gpt":0.28947257153670514,"score_spread":0.2593847152285811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574082713","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.0017101808,0.010076211,0.9336457,0.0020909498,0.0010340365,0.00011598637,0.0008927943,0.0029905248,0.04744351],"genre_scores_gemma":[0.045326456,0.0131050665,0.83149135,0.001457127,0.0019606946,0.00076355314,0.005023324,0.0022335253,0.09863888],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807966,0.00036687663,0.00019673104,0.00049544027,0.00078319875,0.000078113364],"domain_scores_gemma":[0.99754745,0.0008912673,0.0000723185,0.0011448191,0.00029067998,0.000053464355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398621,0.0014618608,0.0018539593,0.0020187448,0.0011087413,0.0051519508,0.0020917153,0.0015752699,0.030891253],"category_scores_gemma":[0.0066411253,0.0010660737,0.0011957899,0.0048497226,0.0020409334,0.0068693613,0.0028915836,0.0035266057,0.026168715],"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.00003943349,0.000044187003,0.0001881236,0.0003807618,0.00004402254,0.00003943364,0.00011376232,0.004293122,0.0009982031,0.42656606,0.06745116,0.49984187],"study_design_scores_gemma":[0.000018158153,0.000022852315,0.00012491674,0.00011113483,0.000025753823,0.00019265275,0.000033293774,0.020270586,0.0015917766,0.8036885,0.17390424,0.000016128908],"about_ca_topic_score_codex":0.0005720347,"about_ca_topic_score_gemma":0.0005422638,"teacher_disagreement_score":0.030891253,"about_ca_system_score_codex":0.0009797567,"about_ca_system_score_gemma":0.0012739265,"threshold_uncertainty_score":0.10334152},"labels":[],"label_agreement":null},{"id":"W1574085630","doi":"10.1007/978-3-642-15461-4_43","title":"Inverse Modeling in Geoenvironmental Engineering Using a Novel Particle Swarm Optimization Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Particle swarm optimization; Computer science; Algorithm; Mathematical optimization; Inverse; Convergence (economics); Multi-swarm optimization; Inverse problem; Premature convergence; Population; Mathematics","score_opus":0.021452649873980066,"score_gpt":0.23416118009005418,"score_spread":0.2127085302160741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574085630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015040672,0.000070636605,0.99722916,0.00003585477,0.00003650358,0.000010696578,0.0000072867006,0.00006812805,0.0010376578],"genre_scores_gemma":[0.15695113,0.0004412857,0.8363163,0.00009537376,0.00011836032,0.00021135455,0.000092086855,0.00011042996,0.0056635546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.000043611144,0.000009725283,0.000030721545,0.000075111515,0.000008986341],"domain_scores_gemma":[0.99976414,0.00012563106,0.000022595816,0.000023671408,0.000055055996,0.000008852591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004172903,0.000661369,0.000951155,0.0003808242,0.00043985466,0.0008423698,0.0009846705,0.0016814315,0.0016069892],"category_scores_gemma":[0.00089861336,0.0005111702,0.00086658524,0.0007532409,0.00046267983,0.0010867522,0.0007461755,0.0009476416,0.0004970969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019813428,0.000044325094,0.0002150679,0.00005718625,0.000029211918,0.00005265271,0.000043267097,0.93712825,0.003045796,0.011575106,0.00087472226,0.046914678],"study_design_scores_gemma":[0.000001933361,0.000003539086,0.000019000276,0.0000013275547,0.000002274136,0.0000065774184,0.000001741427,0.9986519,0.00016091658,0.00076735043,0.00038147916,0.0000018386872],"about_ca_topic_score_codex":0.0035368034,"about_ca_topic_score_gemma":0.0029424322,"teacher_disagreement_score":0.0035368034,"about_ca_system_score_codex":0.00029642985,"about_ca_system_score_gemma":0.00053905713,"threshold_uncertainty_score":0.0070323944},"labels":[],"label_agreement":null},{"id":"W1574120770","doi":"10.1007/978-3-540-73275-4_5","title":"Key Establishment in Heterogeneous Self-organized Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Key (lock); Wireless ad hoc network; Protocol (science); Computer security; Computer network; Key management; Mobile ad hoc network; Distributed computing; Vehicular ad hoc network; Cryptography; Telecommunications; Wireless","score_opus":0.0132632660495542,"score_gpt":0.23338506173699966,"score_spread":0.22012179568744547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574120770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10689717,0.0028142964,0.87991786,0.00036219135,0.00017219181,0.00011428234,0.00008310119,0.00045421132,0.009184789],"genre_scores_gemma":[0.9484406,0.0011187436,0.04498491,0.00007412671,0.000072858566,0.000100586345,0.000116526506,0.000038579925,0.0050530694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995271,0.0001318246,0.00003620571,0.00008301207,0.00013143772,0.00009045228],"domain_scores_gemma":[0.9984933,0.0009215883,0.0001257077,0.00025892322,0.00014040379,0.000060033894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587247,0.00026342663,0.000648921,0.00044609906,0.0005592595,0.0011174562,0.0011504414,0.00055690674,0.001214863],"category_scores_gemma":[0.0026971984,0.00028228585,0.00019690488,0.00068824855,0.00061054085,0.00241055,0.0015518323,0.0006631779,0.00031647252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001017149,0.00016267113,0.0013471738,0.0006600256,0.0001315407,0.0008091793,0.0006869734,0.34227005,0.05738885,0.33896676,0.007179109,0.24938056],"study_design_scores_gemma":[0.00006724156,0.00012272026,0.00037303826,0.000031558735,0.000037458703,0.0003156537,0.000120568926,0.8609487,0.011412178,0.121236995,0.005309325,0.00002462184],"about_ca_topic_score_codex":0.0002510192,"about_ca_topic_score_gemma":0.00023689351,"teacher_disagreement_score":0.001214863,"about_ca_system_score_codex":0.00045608415,"about_ca_system_score_gemma":0.00028568401,"threshold_uncertainty_score":0.004541397},"labels":[],"label_agreement":null},{"id":"W1574123004","doi":"10.1007/11559573_62","title":"Cylinder Rotational Orientation Based on Circle Detection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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 Manitoba","funders":"","keywords":"Ellipse; Hough transform; Orientation (vector space); Cylinder; Perpendicular; Computer science; Computer vision; Artificial intelligence; Robotic arm; Geometry; Mathematics; Image (mathematics)","score_opus":0.01017719444257982,"score_gpt":0.24339495990568255,"score_spread":0.23321776546310274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574123004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033691578,0.0004526934,0.9523476,0.00009496375,0.00020867183,0.00008648048,0.00017195941,0.0053938976,0.007552111],"genre_scores_gemma":[0.36155525,0.00077472185,0.6285508,0.00008191321,0.00011825744,0.00007694322,0.0009433176,0.0005401536,0.0073586856],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993592,0.0000743467,0.000016377313,0.00013549518,0.00033965844,0.000074968186],"domain_scores_gemma":[0.99912435,0.0001530341,0.000067382825,0.00014411927,0.00045852427,0.00005257523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043668973,0.0010454202,0.001238421,0.0022292763,0.00046744608,0.00086669705,0.0011308312,0.00070184557,0.0049361675],"category_scores_gemma":[0.0013141774,0.0004510661,0.0004440234,0.0017493464,0.00040955536,0.0009109904,0.0007849184,0.00048793058,0.0039730696],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007005535,0.000090987705,0.0020440093,0.00017920088,0.00004448894,0.00014896381,0.000067888344,0.0070163463,0.164923,0.004777075,0.007889165,0.8121183],"study_design_scores_gemma":[0.00007413355,0.00038773642,0.0112687405,0.0000589155,0.0001743958,0.0014850784,0.00010020574,0.63397104,0.32946232,0.0030747482,0.019789726,0.00015298331],"about_ca_topic_score_codex":0.0026964443,"about_ca_topic_score_gemma":0.0041273595,"teacher_disagreement_score":0.0049361675,"about_ca_system_score_codex":0.00036065502,"about_ca_system_score_gemma":0.0007352645,"threshold_uncertainty_score":0.01651311},"labels":[],"label_agreement":null},{"id":"W1574178290","doi":"10.1007/978-3-540-70525-3_4","title":"A Tableaux System for Deontic Action Logic","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Action (physics); Computer science; Epistemology; Programming language; Philosophy; Physics","score_opus":0.03535596432300425,"score_gpt":0.25830683493351886,"score_spread":0.2229508706105146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574178290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038624264,0.00035201464,0.9600575,0.0003091773,0.0002594811,0.0002120426,0.0023067812,0.016784338,0.015856229],"genre_scores_gemma":[0.10548648,0.00062398816,0.85605633,0.00040617978,0.00023130185,0.00043863844,0.0054039317,0.0029877916,0.028365338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989041,0.0002356195,0.00012531142,0.00029316638,0.00034713614,0.00009466528],"domain_scores_gemma":[0.99899274,0.0005502902,0.000036563604,0.00020497644,0.00015228198,0.000063133484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862424,0.0009943045,0.0014211161,0.0013157016,0.0014544402,0.005002968,0.0028607708,0.001306338,0.02938062],"category_scores_gemma":[0.0027089498,0.0012428713,0.0017107535,0.0015363562,0.0018314046,0.004224296,0.0025556353,0.002391392,0.009433682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025939348,0.00012538055,0.00030611892,0.00032874965,0.00005192616,0.0003212351,0.0006570336,0.008828968,0.00851559,0.78962296,0.029896325,0.16108625],"study_design_scores_gemma":[0.00021055435,0.00007843792,0.00017823189,0.00009373172,0.00010313874,0.0002703569,0.0001356478,0.093982175,0.012517766,0.74172103,0.15062751,0.000081395476],"about_ca_topic_score_codex":0.004146063,"about_ca_topic_score_gemma":0.0056227897,"teacher_disagreement_score":0.02938062,"about_ca_system_score_codex":0.0016259792,"about_ca_system_score_gemma":0.0018483654,"threshold_uncertainty_score":0.09828794},"labels":[],"label_agreement":null},{"id":"W1574226371","doi":"10.1007/978-3-540-88643-3_8","title":"Model-Driven Engineering of Rules for Web Services","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Athabasca University","funders":"","keywords":"Computer science; Business Process Execution Language; Web service; Web modeling; WS-Policy; Unified Modeling Language; Web engineering; Business rule; Modeling language; Services computing; Business logic; Web standards; Software engineering; World Wide Web; Service-oriented architecture; WS-I Basic Profile; Metamodeling; Business process; Web development; Web application security; Programming language; Web intelligence; Engineering","score_opus":0.012488143249495015,"score_gpt":0.21736783495625026,"score_spread":0.20487969170675524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574226371","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.006495467,0.00015974518,0.9875408,0.0001684779,0.00007068546,0.00023126221,0.00016272572,0.0014292882,0.0037415153],"genre_scores_gemma":[0.13650551,0.0004628796,0.85661745,0.0001738019,0.0000386913,0.0003614561,0.0009215135,0.0005776118,0.004341115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968129,0.00076045597,0.0002909192,0.00031919914,0.0015384974,0.00027807796],"domain_scores_gemma":[0.9953778,0.00263016,0.00019806343,0.00086190697,0.00082390074,0.000108294065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031580296,0.00069225533,0.00078745093,0.0009500305,0.000741254,0.0030953148,0.002588617,0.0012774117,0.0026424723],"category_scores_gemma":[0.00989045,0.0010250323,0.002255348,0.00075267866,0.0014794801,0.0019454234,0.0017407002,0.0025792622,0.0008302321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021381059,0.0004382935,0.0011570038,0.00068285817,0.0001985696,0.00060539495,0.0008214775,0.30384797,0.017183604,0.41064206,0.008684037,0.25552505],"study_design_scores_gemma":[0.00008707491,0.000069299866,0.00017238106,0.00014690144,0.00012523204,0.00022534009,0.000087031665,0.7049297,0.02339115,0.23759559,0.03312449,0.000045797555],"about_ca_topic_score_codex":0.004384984,"about_ca_topic_score_gemma":0.0072405883,"teacher_disagreement_score":0.004384984,"about_ca_system_score_codex":0.0011008946,"about_ca_system_score_gemma":0.0024100866,"threshold_uncertainty_score":0.01670146},"labels":[],"label_agreement":null},{"id":"W1574255914","doi":"10.1007/11566489_22","title":"Dynamic 3D Ultrasound and MR Image Registration of the Beating Heart","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"London Health Sciences Centre; Robarts Clinical Trials; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Ontario Innovation Trust","keywords":"Computer science; Image registration; Fiducial marker; Artificial intelligence; Computer vision; Image fusion; Magnetic resonance imaging; Image (mathematics); Medicine; Radiology","score_opus":0.00819657113339678,"score_gpt":0.3001377959525404,"score_spread":0.29194122481914364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574255914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20243277,0.0034881867,0.7811846,0.00073954253,0.00039086243,0.0001458984,0.00048412144,0.0016010387,0.009532903],"genre_scores_gemma":[0.72250676,0.0030058643,0.26411417,0.00035522075,0.00040259003,0.00014017796,0.0005847704,0.0007681158,0.008122365],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995528,0.00013288272,0.000029079818,0.00009213667,0.00015461189,0.000038475886],"domain_scores_gemma":[0.9995166,0.00019118312,0.00006414394,0.000116930336,0.000069846064,0.000041366642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775651,0.00029332278,0.0005607698,0.001400691,0.00025169287,0.0016111163,0.0005707812,0.0011500968,0.0029066287],"category_scores_gemma":[0.0029992457,0.0005816771,0.00052598125,0.0011014605,0.00037853,0.00087243825,0.000820776,0.0008250751,0.001206638],"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.0012240193,0.00016097234,0.0060614184,0.0004478784,0.000111737325,0.0013275344,0.0007213785,0.023158524,0.51937276,0.0077875,0.0041266475,0.4354996],"study_design_scores_gemma":[0.00020408332,0.0012089467,0.08741983,0.0002035585,0.00035289247,0.0236038,0.0010725403,0.43885717,0.37890324,0.017091228,0.050794847,0.00028788322],"about_ca_topic_score_codex":0.00097242213,"about_ca_topic_score_gemma":0.0010959123,"teacher_disagreement_score":0.0029066287,"about_ca_system_score_codex":0.00019530619,"about_ca_system_score_gemma":0.00047481895,"threshold_uncertainty_score":0.009723604},"labels":[],"label_agreement":null},{"id":"W1574266679","doi":"10.1007/978-3-642-05434-1_24","title":"Gossiping in Jail","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gossip; Computer science; RADIUS; Set (abstract data type); Transmission (telecommunications); Interference (communication); Upper and lower bounds; Broadcasting (networking); Algorithm; Computer network; Combinatorics; Telecommunications; Mathematics; Law; Programming language","score_opus":0.014837868749372431,"score_gpt":0.24138704546160036,"score_spread":0.22654917671222793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574266679","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.10467505,0.008529006,0.2051506,0.0054762596,0.0028577473,0.00015795042,0.00038196563,0.0031227171,0.66964865],"genre_scores_gemma":[0.8452146,0.002295769,0.035665844,0.00053153344,0.00070383004,0.0001424685,0.0002686309,0.00061407324,0.11456334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.00020096902,0.0000368348,0.000058147903,0.00012013875,0.00012460291],"domain_scores_gemma":[0.99842703,0.0008164671,0.00012594773,0.0002781635,0.00017280842,0.00017960118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078083016,0.0004034729,0.00047659306,0.00089474866,0.0022308868,0.003497281,0.00074267027,0.0007529982,0.010599677],"category_scores_gemma":[0.0030980029,0.00030379425,0.00034643602,0.0009154249,0.0019519532,0.00393683,0.0015154463,0.0018198052,0.001986476],"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.00017164134,0.000051159015,0.0003999193,0.00020014346,0.000017915943,0.00020159743,0.0014692859,0.003693145,0.0013218285,0.90417945,0.018654266,0.06963971],"study_design_scores_gemma":[0.000048392165,0.000117916214,0.0006747646,0.000240533,0.000048226586,0.0005684917,0.001121722,0.036146976,0.0044079917,0.7751817,0.18137003,0.00007326292],"about_ca_topic_score_codex":0.00086792477,"about_ca_topic_score_gemma":0.0011616987,"teacher_disagreement_score":0.010599677,"about_ca_system_score_codex":0.0007792884,"about_ca_system_score_gemma":0.0005402466,"threshold_uncertainty_score":0.03545946},"labels":[],"label_agreement":null},{"id":"W1574299633","doi":"10.1007/978-3-642-01957-9_5","title":"Novel Precomputation Schemes for Elliptic Curve Cryptosystems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Precomputation; Scalar multiplication; Elliptic curve point multiplication; Hessian form of an elliptic curve; Elliptic curve; Computer science; Elliptic curve cryptography; Tripling-oriented Doche–Icart–Kohel curve; Edwards curve; Scalar (mathematics); Cryptosystem; Schoof's algorithm; Curve25519; Supersingular elliptic curve; Algorithm; Arithmetic; Mathematics; Cryptography; Public-key cryptography; Pure mathematics; Computation; Encryption; Geometry; Operating system; Quarter period","score_opus":0.01812452495670169,"score_gpt":0.25107168928246587,"score_spread":0.23294716432576418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574299633","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.105725735,0.004767605,0.82051104,0.0017757727,0.00116288,0.00042876537,0.00027463117,0.0024338237,0.06291976],"genre_scores_gemma":[0.54681426,0.0029496555,0.4033537,0.0005627503,0.00092706754,0.00030827822,0.00056864315,0.00036169915,0.04415402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988973,0.00021385272,0.000092361384,0.00017619638,0.0004831579,0.0001371456],"domain_scores_gemma":[0.99878734,0.00027990475,0.000088356755,0.0005988639,0.00017905977,0.000066469125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008807766,0.0008994036,0.0007324503,0.00076907745,0.0012077717,0.0024293754,0.0012584709,0.0010608562,0.009470868],"category_scores_gemma":[0.0023841553,0.00050310727,0.0004922879,0.0012224307,0.0011014438,0.0046193115,0.002396936,0.0025698852,0.002948175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007140853,0.00026326336,0.0002559723,0.00034176835,0.00003382024,0.0002377901,0.0003404739,0.005168046,0.0550682,0.6479838,0.009254154,0.2803387],"study_design_scores_gemma":[0.0004131709,0.00073358027,0.0005695669,0.00018537938,0.000117142874,0.0037386827,0.00018418444,0.11505434,0.12202635,0.6354994,0.121320575,0.00015762019],"about_ca_topic_score_codex":0.00008065923,"about_ca_topic_score_gemma":0.00019239748,"teacher_disagreement_score":0.009470868,"about_ca_system_score_codex":0.00083511736,"about_ca_system_score_gemma":0.0007060859,"threshold_uncertainty_score":0.031683266},"labels":[],"label_agreement":null},{"id":"W1574320314","doi":"10.1007/978-3-540-77050-3_33","title":"Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Polygon (computer graphics); Star-shaped polygon; Rectilinear polygon; Polygon covering; Combinatorics; Convex polygon; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Construct (python library); Computer science; Mathematics; Convex polytope; Convex set; Geometry; Convex optimization; Artificial intelligence; Simple polygon","score_opus":0.026459950766963926,"score_gpt":0.2642927247373306,"score_spread":0.2378327739703667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574320314","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.02855884,0.00011042598,0.9694986,0.000048199043,0.000021650512,0.00003397662,0.0001542246,0.00056389614,0.001010161],"genre_scores_gemma":[0.17156547,0.00036296263,0.82424915,0.000037419602,0.00004502938,0.00009400426,0.0011428884,0.0005463588,0.001956741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873215,0.0002590699,0.00005867369,0.00019216834,0.00062035245,0.00013764728],"domain_scores_gemma":[0.99690825,0.0015988053,0.00021599687,0.0005175086,0.0006048889,0.00015454998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159889,0.0014001502,0.0019530617,0.002011681,0.00049216993,0.0024837803,0.0021307587,0.0014794897,0.0028949592],"category_scores_gemma":[0.006083666,0.0021342786,0.001342294,0.0025702422,0.0014546287,0.0024696728,0.002983924,0.0029396203,0.0012931654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045421973,0.00022576636,0.0049016546,0.00038375286,0.00008906894,0.00038590143,0.00035515663,0.3281291,0.02350668,0.06683186,0.006507828,0.568229],"study_design_scores_gemma":[0.000010241004,0.000024685232,0.0004227697,0.00001667296,0.000010027076,0.00013665197,0.000071190385,0.9743751,0.0050079427,0.01901611,0.0008932559,0.000015223556],"about_ca_topic_score_codex":0.0033294302,"about_ca_topic_score_gemma":0.005184381,"teacher_disagreement_score":0.0033294302,"about_ca_system_score_codex":0.00047960458,"about_ca_system_score_gemma":0.00091450167,"threshold_uncertainty_score":0.009684622},"labels":[],"label_agreement":null},{"id":"W1574334008","doi":"10.1007/978-3-642-13036-6_27","title":"On Column-Restricted and Priority Covering Integer Programs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Column (typography); Cover (algebra); Computer science; Column generation; Omega; Tree (set theory); Approximation algorithm; Combinatorics; Logical matrix; Matrix (chemical analysis); Constraint (computer-aided design); Type (biology); Discrete mathematics; Mathematics; Mathematical optimization; Group (periodic table); Programming language","score_opus":0.013578718181496757,"score_gpt":0.2464335359269424,"score_spread":0.23285481774544564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574334008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015975593,0.0035329792,0.86612976,0.0015535626,0.0006021806,0.000107715314,0.00034636064,0.0003875324,0.11136416],"genre_scores_gemma":[0.32557303,0.008467102,0.56390643,0.001239464,0.002253341,0.00054037984,0.0018127199,0.001009352,0.09519821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893636,0.0003704991,0.000047053116,0.00012666186,0.00040130632,0.000118165466],"domain_scores_gemma":[0.99806637,0.0013450001,0.00009391427,0.0002350356,0.00018609272,0.00007359292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014299463,0.0013627406,0.0010194635,0.00079222844,0.00055981014,0.0022211254,0.0013317062,0.0009892461,0.010338793],"category_scores_gemma":[0.00631321,0.00083688856,0.0011046886,0.002472643,0.0014337698,0.0040737153,0.0017432402,0.0048013083,0.0017353303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010328013,0.00013945816,0.0002327005,0.00031015655,0.00003368071,0.00012084565,0.00016114175,0.09188569,0.0016511588,0.78050405,0.01863852,0.106219254],"study_design_scores_gemma":[0.000016853368,0.000029304436,0.00013611339,0.000055883414,0.0000119654715,0.00008132307,0.000027715765,0.1298418,0.0004892056,0.85439897,0.014898209,0.000012722415],"about_ca_topic_score_codex":0.0014534066,"about_ca_topic_score_gemma":0.0015073488,"teacher_disagreement_score":0.010338793,"about_ca_system_score_codex":0.0011994118,"about_ca_system_score_gemma":0.00085201,"threshold_uncertainty_score":0.034586668},"labels":[],"label_agreement":null},{"id":"W1574397275","doi":"10.1007/978-3-642-02478-8_60","title":"A Hyprolog Parsing Methodology for Property Grammars","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Simon Fraser University","funders":"","keywords":"Computer science; Parsing; Rule-based machine translation; L-attributed grammar; Rotation formalisms in three dimensions; S-attributed grammar; Extension (predicate logic); Natural language processing; Prolog; Artificial intelligence; Programming language; Property (philosophy); Top-down parsing; Constraint (computer-aided design); Top-down parsing language; Domain (mathematical analysis); Constraint satisfaction problem; Grammar; Parsing expression grammar; Bottom-up parsing; Context-free grammar; Linguistics; Mathematics","score_opus":0.07909329693105215,"score_gpt":0.2956107236285233,"score_spread":0.21651742669747115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574397275","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.001711668,0.00009309839,0.9876101,0.00013184913,0.000049512415,0.00005992751,0.00017920283,0.0056042457,0.004560421],"genre_scores_gemma":[0.06602536,0.00029248142,0.9171419,0.0002698976,0.000112093025,0.00015531541,0.00120114,0.0045528724,0.010248937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759185,0.0006146039,0.00021482464,0.0005509947,0.0008580559,0.00016975561],"domain_scores_gemma":[0.99774736,0.0009918703,0.000086946,0.00080616033,0.00031566533,0.000052027914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019338791,0.00072430406,0.00093342486,0.0016718195,0.001132591,0.0028651187,0.002405012,0.0013253714,0.015299779],"category_scores_gemma":[0.0045149205,0.0015069031,0.0017807287,0.0014582166,0.0020307174,0.005735286,0.0037475436,0.0034090802,0.006142294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007791772,0.00009358691,0.0006773985,0.0004065548,0.00006140671,0.00048647774,0.0009486792,0.004572525,0.011701995,0.6330754,0.017860219,0.33003786],"study_design_scores_gemma":[0.000048599155,0.00006180872,0.0005720461,0.00017260289,0.000092481285,0.0011460178,0.0002330738,0.09081551,0.030696709,0.75613177,0.11992428,0.00010507824],"about_ca_topic_score_codex":0.000799127,"about_ca_topic_score_gemma":0.0014108589,"teacher_disagreement_score":0.015299779,"about_ca_system_score_codex":0.0005391442,"about_ca_system_score_gemma":0.0013416351,"threshold_uncertainty_score":0.051182806},"labels":[],"label_agreement":null},{"id":"W1574404229","doi":"10.1007/3-540-45429-2_14","title":"Process-Algebraic Foundations of Aspect-Oriented Programming","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":65,"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":"Correctness; Computer science; Equivalence (formal languages); Weaving; Process calculus; Aspect-oriented programming; Programming language; Process (computing); Algebra over a field; Simple (philosophy); Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.03215982808662111,"score_gpt":0.30347071429616523,"score_spread":0.27131088620954413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574404229","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.008648444,0.0039149276,0.90934753,0.0022376548,0.00028295265,0.000052896878,0.00008831938,0.0003748099,0.07505247],"genre_scores_gemma":[0.5471034,0.010892357,0.41401553,0.0006294572,0.0013026918,0.00031408586,0.00036897347,0.00029045288,0.025083033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00019524166,0.00008306805,0.000116658644,0.00045819642,0.00007840357],"domain_scores_gemma":[0.9988147,0.0006571565,0.00009255071,0.00018098427,0.0001955207,0.000059199025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011295016,0.0006929976,0.0006440922,0.0009215587,0.0011855017,0.0038096828,0.0010796799,0.0009735512,0.0029659208],"category_scores_gemma":[0.0028634393,0.0007526076,0.0011624581,0.0015039473,0.0043356046,0.0066211014,0.0014940553,0.0042108707,0.0008874865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039722877,0.0000058376268,0.000030013742,0.000030336449,0.0000032955993,0.000021217817,0.000112640715,0.00079560623,0.00022730994,0.9932863,0.00041548847,0.0050679287],"study_design_scores_gemma":[0.0000047044427,0.0000046061355,0.000028112107,0.000013062726,0.000004329532,0.000039306924,0.000016239423,0.0025505184,0.00018648224,0.98874646,0.008403081,0.000003106548],"about_ca_topic_score_codex":0.0010880507,"about_ca_topic_score_gemma":0.0009349585,"teacher_disagreement_score":0.0038096828,"about_ca_system_score_codex":0.0010895038,"about_ca_system_score_gemma":0.0009982664,"threshold_uncertainty_score":0.009922028},"labels":[],"label_agreement":null},{"id":"W1574428622","doi":"10.1007/3-540-48035-8_76","title":"Collective Intelligence and Priority Routing in Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Computer science; Swarm intelligence; Routing (electronic design automation); Ant colony; Distributed computing; Foraging; Swarm behaviour; Simplicity; Action (physics); Adaptation (eye); Artificial intelligence; Ant colony optimization algorithms; Computer network; Machine learning; Ecology; Particle swarm optimization","score_opus":0.02006697533973757,"score_gpt":0.2434654478876814,"score_spread":0.22339847254794384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574428622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044503644,0.019974919,0.7724794,0.005103649,0.0022511838,0.00008544126,0.0001045274,0.00037038466,0.15512688],"genre_scores_gemma":[0.7239412,0.013555307,0.16602735,0.0006253646,0.002011689,0.0001854111,0.00017262992,0.00011969694,0.0933614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998192,0.000056470166,0.000007265605,0.00002752425,0.000064233034,0.000025315476],"domain_scores_gemma":[0.99957806,0.00026244958,0.00003186554,0.00005123938,0.00004826282,0.000028127892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004753522,0.00032346515,0.00038862493,0.00042186232,0.00056097005,0.0015329943,0.000589765,0.000917459,0.0041478053],"category_scores_gemma":[0.0018044371,0.00022663978,0.00021724575,0.0007589871,0.00097526074,0.002080425,0.0005269555,0.0012411057,0.00048861734],"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.000020151077,0.000019684541,0.000108531494,0.00009460743,0.000011104544,0.000040594954,0.00014409823,0.024617646,0.0010858948,0.9091458,0.006472361,0.058239486],"study_design_scores_gemma":[0.000012683195,0.000022745455,0.00014123156,0.000023573166,0.00000898259,0.00006538535,0.0000561467,0.052989516,0.0005356363,0.9243848,0.02174958,0.000009772441],"about_ca_topic_score_codex":0.0005168725,"about_ca_topic_score_gemma":0.0006732634,"teacher_disagreement_score":0.0041478053,"about_ca_system_score_codex":0.00051371526,"about_ca_system_score_gemma":0.0003189,"threshold_uncertainty_score":0.0138757825},"labels":[],"label_agreement":null},{"id":"W1574451148","doi":"10.1007/978-3-540-27835-1_22","title":"Anatomy and Physiology of an Artificial Vision Matrix","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","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":"Carleton University","funders":"","keywords":"Computer science; Snapshot (computer storage); Artificial vision; Image processing; Artificial intelligence; Computer vision; Visual processing; Information processing; Vision science; Machine vision; Neuroscience; Image (mathematics); Biology; Perception","score_opus":0.033314214060010325,"score_gpt":0.33633310347689427,"score_spread":0.30301888941688393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574451148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060930904,0.0053369957,0.6608462,0.0031635114,0.0005555287,0.00006173742,0.0003924084,0.0009206058,0.26779214],"genre_scores_gemma":[0.6560255,0.0039418642,0.241291,0.00038814102,0.000313811,0.000107139014,0.00025744588,0.00019657229,0.097478576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986863,0.000018701203,0.0000056089966,0.00002968529,0.000066013126,0.000011346986],"domain_scores_gemma":[0.99976474,0.00007934005,0.00002284052,0.000030376797,0.00006984782,0.000032795386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013458444,0.00021193264,0.00016149836,0.0006416631,0.0004593937,0.0018781278,0.0007283627,0.00072661834,0.009222022],"category_scores_gemma":[0.0006950784,0.0002673709,0.00020379604,0.00047497152,0.0012247728,0.0020256697,0.00065042306,0.0009161958,0.0019342399],"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.000025558847,0.000007892551,0.00015066547,0.00005569346,0.000004935986,0.00020461365,0.00018164677,0.0020374025,0.03411642,0.9297364,0.0024550268,0.031023717],"study_design_scores_gemma":[0.000022886506,0.00011338306,0.0031702807,0.000054384254,0.000014233532,0.0033100727,0.0002624468,0.043247275,0.017208353,0.8005146,0.1320302,0.0000520045],"about_ca_topic_score_codex":0.00090946496,"about_ca_topic_score_gemma":0.0006587382,"teacher_disagreement_score":0.009222022,"about_ca_system_score_codex":0.0003651076,"about_ca_system_score_gemma":0.000560069,"threshold_uncertainty_score":0.030850768},"labels":[],"label_agreement":null},{"id":"W1574521024","doi":"10.1007/978-3-540-76928-6_33","title":"Constraint-Based Mining of Web Page Associations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Heuristics; Association rule learning; Computer science; Data mining; Identification (biology); Process (computing); Key (lock); Ranking (information retrieval); Focus (optics); Resource (disambiguation); Constraint (computer-aided design); Machine learning; Data science; Artificial intelligence; Engineering","score_opus":0.03154203859856059,"score_gpt":0.27618510481201874,"score_spread":0.24464306621345816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574521024","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.13352984,0.002507367,0.8415077,0.0009210511,0.00015535246,0.0008113993,0.008933062,0.0034763273,0.008157878],"genre_scores_gemma":[0.34142005,0.001050763,0.6352097,0.00032681547,0.0001515256,0.00050444895,0.016799826,0.00036549586,0.0041713556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967411,0.0005310725,0.0003276123,0.0006476003,0.0014981265,0.0002544886],"domain_scores_gemma":[0.98627234,0.008919791,0.0010839092,0.0012647167,0.0020869647,0.0003723276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017819876,0.00092018826,0.0019326701,0.0059860847,0.001457426,0.0026593846,0.0045296573,0.001329672,0.0046355953],"category_scores_gemma":[0.016268652,0.00069672853,0.0017779099,0.011798768,0.0009521487,0.002955675,0.0017132122,0.0014699796,0.0015884792],"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.0012019314,0.0010698312,0.03778205,0.0019123284,0.0008667113,0.0019234708,0.00053264067,0.124591835,0.014886057,0.031183457,0.031039895,0.7530098],"study_design_scores_gemma":[0.00011674821,0.00012691379,0.007470944,0.00013353398,0.0002531735,0.0010708902,0.00025175177,0.9368503,0.007499545,0.036301505,0.009862658,0.0000620142],"about_ca_topic_score_codex":0.017026553,"about_ca_topic_score_gemma":0.03693156,"teacher_disagreement_score":0.017026553,"about_ca_system_score_codex":0.0009437739,"about_ca_system_score_gemma":0.0037604568,"threshold_uncertainty_score":0.0338549},"labels":[],"label_agreement":null},{"id":"W1574548479","doi":"10.1007/3-540-45691-0_11","title":"Using Statistical Translation Models for Bilingual IR","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":28,"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":"Computer science; Machine translation; Natural language processing; Clef; Artificial intelligence; Translation (biology); Set (abstract data type); Machine translation software usability; Example-based machine translation; Quality (philosophy); Information retrieval; Programming language","score_opus":0.06355541360915397,"score_gpt":0.31854023540942916,"score_spread":0.2549848218002752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574548479","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.005924042,0.00084751105,0.9828607,0.00032163967,0.00019514533,0.00006948221,0.00035384615,0.005076033,0.0043515917],"genre_scores_gemma":[0.1987424,0.001381904,0.78320456,0.0003241936,0.0004309046,0.00042133074,0.0037834626,0.0027174663,0.008993796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963785,0.002435336,0.00017471015,0.00044003376,0.00042732715,0.00014412055],"domain_scores_gemma":[0.9942654,0.0037050543,0.0002375969,0.0010354278,0.0006739373,0.0000826121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041709812,0.0014167365,0.0014548226,0.0018102507,0.001118656,0.0027172924,0.0014231855,0.0016074766,0.010370682],"category_scores_gemma":[0.011556537,0.0011725834,0.0018637788,0.0027964835,0.0006748289,0.0051723686,0.0020430884,0.002144911,0.008628183],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008913658,0.0003137057,0.00097292266,0.0007701463,0.00043576537,0.00034517076,0.00037994212,0.0863739,0.014390795,0.06742334,0.02893366,0.79876924],"study_design_scores_gemma":[0.00010656147,0.00013656313,0.00033948303,0.00006785343,0.0001313083,0.0002306074,0.00011636334,0.8272452,0.010122163,0.15063697,0.01079776,0.00006919568],"about_ca_topic_score_codex":0.0015675499,"about_ca_topic_score_gemma":0.0033420888,"teacher_disagreement_score":0.010370682,"about_ca_system_score_codex":0.00072550785,"about_ca_system_score_gemma":0.00118966,"threshold_uncertainty_score":0.03469336},"labels":[],"label_agreement":null},{"id":"W1574558803","doi":"10.1007/978-3-540-74742-0_5","title":"Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Upper and lower bounds; Parallel computing; Schedule; Scheduling (production processes); Heuristic; Processor scheduling; Branch and bound; Time complexity; Set (abstract data type); Job shop scheduling; Worst-case execution time; Execution time; Mathematical optimization; Algorithm; Mathematics","score_opus":0.018093016656547056,"score_gpt":0.27380501085789943,"score_spread":0.2557119942013524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574558803","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.27104658,0.052715257,0.61558664,0.0019940333,0.0011116931,0.0005018967,0.001828858,0.0038999175,0.051315136],"genre_scores_gemma":[0.84139705,0.0040980703,0.14745165,0.00030310586,0.00046271973,0.00030841923,0.0014030505,0.000492317,0.004083663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99441767,0.0015557599,0.0002728278,0.00073853106,0.0021502136,0.0008650301],"domain_scores_gemma":[0.96526515,0.029744465,0.00095138856,0.0018272174,0.0017986969,0.0004130555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072828177,0.0021440643,0.0028256893,0.005109374,0.0011014033,0.0031184664,0.005098851,0.0024605258,0.007020902],"category_scores_gemma":[0.027675051,0.0006918128,0.0014704654,0.004151165,0.0013878471,0.0057410747,0.0016799426,0.0012729955,0.0007472624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009212777,0.0007472119,0.0045551932,0.001774861,0.0004700721,0.00027295266,0.00016161133,0.5557484,0.011005349,0.03189901,0.006809385,0.3773432],"study_design_scores_gemma":[0.00019349188,0.00049193733,0.0017685686,0.0001200344,0.0002059508,0.0002875143,0.00009888198,0.9694809,0.008290688,0.01766225,0.0013477132,0.000052045605],"about_ca_topic_score_codex":0.0034531332,"about_ca_topic_score_gemma":0.0029532954,"teacher_disagreement_score":0.0072828177,"about_ca_system_score_codex":0.0044141747,"about_ca_system_score_gemma":0.0024687333,"threshold_uncertainty_score":0.038515687},"labels":[],"label_agreement":null},{"id":"W1574574070","doi":"10.1007/978-3-642-12275-0_8","title":"Improving Medical Information Retrieval with PICO Element Detection","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Computer science; Information retrieval; Task (project management); Process (computing); Element (criminal law); Population; Data mining","score_opus":0.006390804664680461,"score_gpt":0.227661113417714,"score_spread":0.22127030875303355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574574070","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.09165611,0.006484125,0.88083285,0.00062430045,0.0005521999,0.00036693487,0.0026354387,0.00990063,0.006947394],"genre_scores_gemma":[0.192165,0.0014898431,0.79223484,0.0003715492,0.0004100487,0.00023440634,0.005177119,0.00038000653,0.007537252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.00013934732,0.00009055094,0.0001653161,0.0004623961,0.00006991231],"domain_scores_gemma":[0.9981394,0.0010091637,0.000089079615,0.00019893388,0.00050171243,0.000061560226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665502,0.0007182097,0.0013178606,0.0052687535,0.0005132271,0.0014531479,0.0010253253,0.00086044346,0.0039370954],"category_scores_gemma":[0.0039618677,0.00037210167,0.00080478424,0.0034096956,0.0003027531,0.0018797365,0.0014387238,0.000541663,0.0025175847],"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.00047927353,0.00016622394,0.0037023528,0.0003309117,0.00010207637,0.00012964399,0.000091917675,0.0023280191,0.043889035,0.0019618878,0.011091571,0.93572706],"study_design_scores_gemma":[0.00018526119,0.0006481259,0.011992573,0.00017867917,0.00062242785,0.0028880977,0.0003988495,0.7234717,0.19121641,0.015187168,0.05307995,0.00013069954],"about_ca_topic_score_codex":0.002235651,"about_ca_topic_score_gemma":0.0031369317,"teacher_disagreement_score":0.0052687535,"about_ca_system_score_codex":0.0003332143,"about_ca_system_score_gemma":0.0006667617,"threshold_uncertainty_score":0.013170898},"labels":[],"label_agreement":null},{"id":"W1574599818","doi":"10.1007/978-3-540-30126-4_4","title":"A Spatially Adaptive Filter Reducing Arc Stripe Noise for Sector Scan Medical Ultrasound Imaging","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasonics and Acoustic Wave Propagation","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":"Adaptive filter; Kernel adaptive filter; Filter (signal processing); Computer science; Gaussian filter; Gaussian noise; Noise (video); Root-raised-cosine filter; Computer vision; Arc (geometry); Gaussian; Acoustics; Filter design; Artificial intelligence; Optics; Algorithm; Physics; Mathematics; Image (mathematics)","score_opus":0.01089689454442283,"score_gpt":0.2141487529193765,"score_spread":0.20325185837495366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574599818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006599937,0.00028206818,0.9916505,0.000054784297,0.000049159866,0.0000215291,0.000038620812,0.0004896371,0.0008135934],"genre_scores_gemma":[0.061884128,0.00060376537,0.9311826,0.00015333697,0.00008123947,0.000055834804,0.00020138068,0.00015962096,0.005678148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996458,0.00006629585,0.000020154599,0.00004766894,0.00020047584,0.000019640798],"domain_scores_gemma":[0.9994993,0.00021626067,0.000032660228,0.00007140169,0.00015823658,0.000022095935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039279653,0.0004998106,0.0005338793,0.00038712373,0.00020241855,0.00047570688,0.0006201746,0.0009181127,0.0043817894],"category_scores_gemma":[0.00092240336,0.00032211852,0.0005572105,0.00067191664,0.0002410415,0.00046799495,0.0004297581,0.0004953246,0.0016098446],"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.00057562935,0.0001474749,0.00035111626,0.00019829953,0.000086176704,0.00011507394,0.00007298693,0.020773271,0.42623857,0.004433819,0.003179429,0.5438281],"study_design_scores_gemma":[0.000057029734,0.00034941695,0.0017857316,0.00002908222,0.00014688572,0.0009321816,0.00003268583,0.7860496,0.1934388,0.0021773668,0.014950853,0.000050354054],"about_ca_topic_score_codex":0.0010602635,"about_ca_topic_score_gemma":0.001922404,"teacher_disagreement_score":0.0043817894,"about_ca_system_score_codex":0.00023181459,"about_ca_system_score_gemma":0.0004833031,"threshold_uncertainty_score":0.014658511},"labels":[],"label_agreement":null},{"id":"W1574619705","doi":"10.1007/978-3-540-85363-3_19","title":"A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Approximation algorithm; Mathematics; Vertex connectivity; Minimum spanning tree; Metric (unit); Graph; Steiner tree problem; Enhanced Data Rates for GSM Evolution; Constant (computer programming); Graph factorization; Discrete mathematics; Computer science; Line graph; Graph power","score_opus":0.024936180216039577,"score_gpt":0.23986739243886984,"score_spread":0.21493121222283026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574619705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20823196,0.0036307657,0.70954674,0.0067775957,0.00074131606,0.0011130976,0.006643191,0.011857233,0.051458154],"genre_scores_gemma":[0.38483906,0.0014111776,0.5856543,0.0012383629,0.0004968515,0.0009349459,0.0069649913,0.0020446107,0.016415667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743515,0.0004957211,0.00011538316,0.00074338284,0.0007864678,0.00042394883],"domain_scores_gemma":[0.99410444,0.0030520598,0.00040560824,0.0015492899,0.00043721235,0.00045141717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017592316,0.003733795,0.0038466654,0.002222916,0.0015229934,0.003797238,0.0073847566,0.0036316637,0.02348296],"category_scores_gemma":[0.012653607,0.0014518056,0.0028533726,0.006524823,0.0017541243,0.008728427,0.0041081617,0.004167554,0.005701521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004087763,0.001676694,0.003226466,0.002708789,0.0004685434,0.00042316155,0.00092747185,0.31705642,0.020578971,0.108391084,0.10257905,0.43787557],"study_design_scores_gemma":[0.0007153144,0.00033532825,0.0014045892,0.00016141318,0.00030001655,0.0006658097,0.00038312734,0.74807274,0.006262299,0.23107408,0.0105498675,0.00007537127],"about_ca_topic_score_codex":0.006848586,"about_ca_topic_score_gemma":0.009749984,"teacher_disagreement_score":0.02348296,"about_ca_system_score_codex":0.0052137985,"about_ca_system_score_gemma":0.0038157788,"threshold_uncertainty_score":0.078558266},"labels":[],"label_agreement":null},{"id":"W1574628199","doi":"10.1007/978-3-540-24767-8_25","title":"Incremental Adaptive Loop Subdivision","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Subdivision; Computer science; Subdivision surface; Aliasing; Loop (graph theory); Surface (topology); Algorithm; Computer vision; Mathematics; Computer graphics (images); Polygon mesh; Filter (signal processing); Geometry","score_opus":0.011415495580650876,"score_gpt":0.23593310500938153,"score_spread":0.22451760942873064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574628199","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.011025063,0.00031470758,0.94979614,0.00006622441,0.00013105683,0.000037335914,0.00006513437,0.0017778707,0.036786538],"genre_scores_gemma":[0.28891057,0.00061395887,0.64438057,0.0001037434,0.000085207605,0.00009209564,0.00042036595,0.0005816295,0.06481184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982053,0.0000111076,0.000004900891,0.000033992983,0.00011200875,0.000017429802],"domain_scores_gemma":[0.99982953,0.000041711533,0.000007002452,0.00006421097,0.000046658242,0.0000109069315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013676834,0.00035908972,0.00038300964,0.0005036115,0.00026042992,0.00061463856,0.0010144071,0.00035057578,0.012997029],"category_scores_gemma":[0.00058370945,0.00024353196,0.00029834532,0.0005390967,0.00035997422,0.0007007605,0.0011079884,0.0008134073,0.0021346116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013970133,0.00006461057,0.0003537932,0.0000932004,0.000016590548,0.000038533406,0.00008726383,0.04190806,0.041689016,0.068204276,0.010188719,0.8372162],"study_design_scores_gemma":[0.000030291158,0.00007930159,0.00074668124,0.00003520175,0.00003208798,0.0003034035,0.00003625045,0.8416163,0.033150826,0.053202964,0.07074251,0.000024314804],"about_ca_topic_score_codex":0.0010751504,"about_ca_topic_score_gemma":0.0020967976,"teacher_disagreement_score":0.012997029,"about_ca_system_score_codex":0.00027973662,"about_ca_system_score_gemma":0.00028976332,"threshold_uncertainty_score":0.043479383},"labels":[],"label_agreement":null},{"id":"W1574700824","doi":"10.1007/978-3-540-74260-9_11","title":"Solving the Inverse Problem of Image Zooming Using “Self-Examples”","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":78,"is_retracted":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":"Zoom; Computer science; Artificial intelligence; Computer vision; Image (mathematics); Image processing; Noise reduction; Frame (networking); Algorithm","score_opus":0.0424930032318826,"score_gpt":0.2909187513991744,"score_spread":0.2484257481672918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574700824","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.013205026,0.0001551629,0.9815446,0.0001236379,0.00005586632,0.000022175533,0.0000152236025,0.00028266982,0.0045956005],"genre_scores_gemma":[0.1332776,0.000283294,0.8567685,0.00008961078,0.000064378306,0.000044426346,0.00007000646,0.000196426,0.009205868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983203,0.000039232542,0.000007632088,0.000035246427,0.00007501332,0.000010908187],"domain_scores_gemma":[0.99957556,0.00022483626,0.000029913796,0.00007398428,0.000072799616,0.000022938284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051343377,0.0005366581,0.00056530023,0.0005031305,0.0002907931,0.0005448296,0.0008285058,0.0009821834,0.0047737723],"category_scores_gemma":[0.0017411611,0.00034626367,0.0005057474,0.0003074736,0.0007351499,0.0015658716,0.0010970227,0.0011444286,0.0006847382],"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.000226162,0.00012376587,0.00057477906,0.00094633177,0.00010594174,0.00039523482,0.0007293077,0.17236713,0.10514207,0.25969642,0.011529716,0.44816318],"study_design_scores_gemma":[0.000022413586,0.00006940905,0.00020465424,0.000035655128,0.000015869122,0.0005526207,0.00006978759,0.9021296,0.0263232,0.060359467,0.010197199,0.000020169293],"about_ca_topic_score_codex":0.00035909365,"about_ca_topic_score_gemma":0.00061969156,"teacher_disagreement_score":0.0047737723,"about_ca_system_score_codex":0.00016053357,"about_ca_system_score_gemma":0.00023619099,"threshold_uncertainty_score":0.015969813},"labels":[],"label_agreement":null},{"id":"W1574759554","doi":"10.1007/3-540-40996-3_3","title":"Strategies for Hotlink Assignments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"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 en Outaouais; Carleton University","funders":"","keywords":"Computer science; Directed acyclic graph; Zipf's law; Web page; Constant (computer programming); Combinatorics; Set (abstract data type); Binary tree; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; World Wide Web; Programming language; Statistics","score_opus":0.02947728663966838,"score_gpt":0.3013976377944786,"score_spread":0.2719203511548102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574759554","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.06326354,0.00044013083,0.55654925,0.0019988497,0.0005858667,0.00043490733,0.0005505131,0.002665603,0.3735113],"genre_scores_gemma":[0.5212088,0.0006323281,0.19419204,0.0010036645,0.00036595506,0.000686789,0.0012249048,0.0026940235,0.27799147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978294,0.00067676214,0.00011792449,0.0004389808,0.00044275384,0.0004942541],"domain_scores_gemma":[0.9935673,0.002899337,0.00025521015,0.0016492046,0.00089785154,0.0007311451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017097008,0.001202988,0.0010739216,0.0024865177,0.0047402866,0.006237034,0.003251482,0.002794745,0.067862056],"category_scores_gemma":[0.011405928,0.0011977147,0.0011511928,0.0028405318,0.001980625,0.0130425375,0.006868688,0.0033551017,0.014090405],"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.00013764003,0.00012612998,0.00029684973,0.00014275222,0.000019558984,0.00013131037,0.000938607,0.001370784,0.0015199714,0.90864325,0.014578936,0.07209439],"study_design_scores_gemma":[0.000022774708,0.000027481185,0.00010352199,0.000037928046,0.000027228605,0.00010924742,0.00053806545,0.0087282,0.00189438,0.96644163,0.022049641,0.000019903404],"about_ca_topic_score_codex":0.00071443064,"about_ca_topic_score_gemma":0.001396244,"teacher_disagreement_score":0.067862056,"about_ca_system_score_codex":0.0011060517,"about_ca_system_score_gemma":0.0010196354,"threshold_uncertainty_score":0.22702122},"labels":[],"label_agreement":null},{"id":"W1574826636","doi":"10.1007/978-3-642-15745-5_10","title":"Automatic Prostate Segmentation Using Fused Ultrasound B-Mode and Elastography Images","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"BC Cancer Agency; University of British Columbia","funders":"National Cancer Institute; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Elastography; Segmentation; Artificial intelligence; Computer vision; Ultrasound; Computer science; Ultrasound elastography; 3D ultrasound; Image segmentation; Pattern recognition (psychology); Radiology; Medicine","score_opus":0.008557780598168781,"score_gpt":0.28763591601341926,"score_spread":0.27907813541525045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574826636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107018605,0.0023840622,0.8846049,0.00025288083,0.0001394958,0.00012975607,0.0003686971,0.0028969687,0.002204651],"genre_scores_gemma":[0.41074908,0.0015098293,0.58375585,0.00023982754,0.000112715505,0.00008637147,0.0005606046,0.00038189482,0.0026038322],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965227,0.00005700856,0.000027897924,0.000073763156,0.00013935428,0.000049786388],"domain_scores_gemma":[0.99939966,0.00022740944,0.000067430716,0.00008761047,0.00018343715,0.00003436727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006669448,0.0006681224,0.0007812469,0.0021859757,0.00034247478,0.0011700223,0.000567763,0.0016603811,0.0014278996],"category_scores_gemma":[0.0017825102,0.0007120252,0.00089102227,0.0010695537,0.00033378878,0.0009492058,0.00064226973,0.0006645933,0.001028964],"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.0008463091,0.00015198332,0.00280599,0.0005161219,0.0001757868,0.00058571936,0.00016407149,0.018333506,0.61611956,0.0010821976,0.0016807216,0.35753813],"study_design_scores_gemma":[0.00014699347,0.00034156212,0.028318247,0.00019336083,0.00046500674,0.005012972,0.00019245624,0.6109966,0.34236103,0.006166913,0.005633667,0.00017125103],"about_ca_topic_score_codex":0.0019500295,"about_ca_topic_score_gemma":0.0023584003,"teacher_disagreement_score":0.0021859757,"about_ca_system_score_codex":0.00024772837,"about_ca_system_score_gemma":0.00079073315,"threshold_uncertainty_score":0.004776776},"labels":[],"label_agreement":null},{"id":"W1574865981","doi":"10.1007/978-3-642-11829-6_6","title":"Conjunctive Queries with Constraints: Homomorphism, Containment and Rewriting","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Homomorphism; Rewriting; Containment (computer programming); Computer science; Conjunctive query; Algebra homomorphism; Programming language; Mathematics; Discrete mathematics; Database; Relational database","score_opus":0.008694925432390636,"score_gpt":0.21714104901340864,"score_spread":0.208446123581018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574865981","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.008906833,0.0058898283,0.96072614,0.0011994916,0.0002794418,0.00012434626,0.0002675413,0.0010114559,0.021594897],"genre_scores_gemma":[0.21464801,0.0076408884,0.75595915,0.00077582354,0.0012942979,0.00040886988,0.0017861912,0.0009901879,0.01649653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99387205,0.0021919382,0.000634471,0.0010539033,0.0019605581,0.00028707174],"domain_scores_gemma":[0.99302715,0.0049234172,0.00023451132,0.0011756739,0.0005038435,0.00013538008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004440921,0.0010019052,0.0016684016,0.0016130459,0.0012893074,0.0054046465,0.002862545,0.001817905,0.003929998],"category_scores_gemma":[0.013370078,0.0015272704,0.0021890106,0.00458756,0.00488272,0.012687933,0.0035417713,0.004044273,0.0015732455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007367336,0.000098518365,0.0002739645,0.0004020132,0.0000584561,0.00031447114,0.0011789817,0.0060893144,0.0030559031,0.8549685,0.0108661745,0.122620046],"study_design_scores_gemma":[0.000030110477,0.000035973106,0.00019288973,0.00007087176,0.00005575344,0.00071157166,0.00022365336,0.030898271,0.0041160816,0.9387195,0.024900094,0.000045219243],"about_ca_topic_score_codex":0.0019068533,"about_ca_topic_score_gemma":0.0013907724,"teacher_disagreement_score":0.0054046465,"about_ca_system_score_codex":0.0020407808,"about_ca_system_score_gemma":0.0012463862,"threshold_uncertainty_score":0.023486078},"labels":[],"label_agreement":null},{"id":"W1574891691","doi":"10.1007/978-3-540-40899-4_113","title":"A Strain-Energy Model of Passive Knee Kinematics for the Study of Surgical Implantation Strategies","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kinematics; Knee Joint; Prosthesis; Computer science; Condyle; Total knee replacement; Joint (building); Orthodontics; Biomedical engineering; Simulation; Surgery; Medicine; Artificial intelligence; Engineering; Physics; Structural engineering","score_opus":0.0231991403416234,"score_gpt":0.27853691067659914,"score_spread":0.25533777033497573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574891691","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.0060598166,0.00127493,0.9796806,0.00027348293,0.00014071401,0.000039656534,0.0002830844,0.00020494747,0.012042762],"genre_scores_gemma":[0.56445855,0.007868441,0.28783816,0.00044239723,0.00044482478,0.0009648102,0.0015987133,0.00095629913,0.13542782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983585,0.00004615895,0.000013230918,0.000029830751,0.000056342593,0.000018539073],"domain_scores_gemma":[0.9995758,0.00026097443,0.000051603376,0.000030882828,0.000060538812,0.000020212663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048079446,0.0011466296,0.0013577207,0.0007935571,0.000344725,0.0012434851,0.0018031141,0.0020793986,0.009642173],"category_scores_gemma":[0.0016277924,0.0008416942,0.0011878817,0.0011024845,0.00057652546,0.0013720563,0.0005713143,0.0014173372,0.0028413178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027894648,0.000081133665,0.0004307206,0.00012556813,0.0000444241,0.0001203088,0.00008430502,0.9084895,0.003417116,0.056294277,0.0028598504,0.028024893],"study_design_scores_gemma":[0.000004693728,0.000028979266,0.00038756934,0.000017349204,0.000014401856,0.00007711336,0.00001580008,0.97706974,0.00017736774,0.01981818,0.0023750558,0.000013780774],"about_ca_topic_score_codex":0.0043855812,"about_ca_topic_score_gemma":0.004492462,"teacher_disagreement_score":0.009642173,"about_ca_system_score_codex":0.0004246797,"about_ca_system_score_gemma":0.00066438527,"threshold_uncertainty_score":0.032256305},"labels":[],"label_agreement":null},{"id":"W1574973644","doi":"10.1007/11554714_12","title":"Reversals of Fortune","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Heuristics; Genome; Computer science; Identification (biology); Function (biology); Genetic algorithm; Algorithm; Theoretical computer science; Computational biology; Genetics; Gene; Biology; Machine learning","score_opus":0.012446387697355045,"score_gpt":0.2390927382497082,"score_spread":0.22664635055235316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574973644","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.13114062,0.0020731532,0.10799465,0.0074103638,0.0018788701,0.000080368154,0.0005973494,0.0012595913,0.7475651],"genre_scores_gemma":[0.8924076,0.0003745168,0.021840436,0.0009494007,0.00022804728,0.000069060596,0.00029422762,0.0005616833,0.083275065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910635,0.00024470995,0.000040813393,0.00024574736,0.00017020703,0.00019217105],"domain_scores_gemma":[0.9972088,0.0009149138,0.00019576117,0.0010173602,0.000430536,0.00023258434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008499228,0.0003972665,0.0005654411,0.0008758686,0.0022229722,0.0026833264,0.00082865305,0.0010804428,0.029279374],"category_scores_gemma":[0.009966924,0.00035712228,0.00053522625,0.00076483627,0.0039552553,0.0038777497,0.0016411697,0.0027290299,0.0029059185],"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.000054104203,0.0000075441135,0.0002227192,0.000017241397,0.000005812408,0.00007508767,0.00024857427,0.00040488533,0.0003945903,0.97677326,0.0048161726,0.016979868],"study_design_scores_gemma":[0.00001592366,0.000011164795,0.00026826066,0.00001552173,0.000006287113,0.00017800496,0.0001704081,0.0011853368,0.0003729849,0.9717288,0.026037658,0.000009629035],"about_ca_topic_score_codex":0.0020679631,"about_ca_topic_score_gemma":0.0024176592,"teacher_disagreement_score":0.029279374,"about_ca_system_score_codex":0.0010320718,"about_ca_system_score_gemma":0.000706648,"threshold_uncertainty_score":0.09794927},"labels":[],"label_agreement":null},{"id":"W1575117743","doi":"10.1007/978-3-642-13509-5_1","title":"Algorithms for Forest Pattern Matching","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Matching (statistics); Computer science; Order (exchange); Tree (set theory); Sequence (biology); Pattern matching; Forest inventory; Combinatorics; Algorithm; Forestry; Artificial intelligence; Mathematics; Geography; Forest management; Biology; Statistics","score_opus":0.014582286446193686,"score_gpt":0.24932494139087802,"score_spread":0.23474265494468433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575117743","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.008867638,0.000743329,0.9806599,0.000300455,0.000117701384,0.00017565241,0.00071649917,0.0038307132,0.00458814],"genre_scores_gemma":[0.06594394,0.00048342676,0.92229676,0.00018796214,0.0001082007,0.0003379362,0.0035141432,0.0006589103,0.0064687803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804085,0.0003082325,0.00017930448,0.00070132286,0.0005527899,0.00021761325],"domain_scores_gemma":[0.99669516,0.0015321663,0.0001600458,0.001049498,0.00045148784,0.00011162092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016493582,0.0014502924,0.002142515,0.0035369985,0.001474864,0.002900644,0.004293941,0.0023152772,0.018515946],"category_scores_gemma":[0.008307584,0.0013515063,0.0023422807,0.006012697,0.0013267999,0.007778608,0.003488014,0.0026212141,0.0062237126],"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.00035787182,0.00021753999,0.00086096674,0.00028126698,0.00012830477,0.00006615671,0.00010098465,0.058453687,0.0030395284,0.056825027,0.026023574,0.8536451],"study_design_scores_gemma":[0.00012959757,0.00006261074,0.00037017025,0.000047513964,0.00007634518,0.00021346699,0.00006791531,0.64301854,0.0034517304,0.3405372,0.012000531,0.000024498011],"about_ca_topic_score_codex":0.0033688052,"about_ca_topic_score_gemma":0.004126031,"teacher_disagreement_score":0.018515946,"about_ca_system_score_codex":0.0013169979,"about_ca_system_score_gemma":0.001418699,"threshold_uncertainty_score":0.06194198},"labels":[],"label_agreement":null},{"id":"W1575122976","doi":"10.1007/978-3-540-74628-7_4","title":"Recent Advances in Spoken Language Understanding","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue 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":"McGill University","funders":"","keywords":"Computer science; Spoken language; Parsing; Presentation (obstetrics); Natural language processing; Interpretation (philosophy); Rule-based machine translation; Artificial intelligence; Linguistics; Programming language","score_opus":0.038917850272569415,"score_gpt":0.28210917439765437,"score_spread":0.24319132412508496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575122976","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008679454,0.5331864,0.3343961,0.01308936,0.0031273402,0.00012754127,0.00087283825,0.0039623757,0.102558576],"genre_scores_gemma":[0.13218859,0.45404282,0.27909845,0.0046709543,0.009130645,0.00032488932,0.004185032,0.0018012769,0.11455737],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988716,0.00025605052,0.00012352002,0.00025343985,0.00043699556,0.000058327194],"domain_scores_gemma":[0.99162185,0.0065315375,0.0001705366,0.00049218,0.001080235,0.000103637205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021110063,0.00068293366,0.0012542605,0.0018089742,0.00046199036,0.0037376652,0.0016325396,0.0015212297,0.022833075],"category_scores_gemma":[0.008093868,0.00048299268,0.00056402007,0.0025716876,0.0015608573,0.007435052,0.001824191,0.001835507,0.006920443],"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.000045879788,0.00003662516,0.00017280935,0.0015577832,0.000024196786,0.000042774045,0.0004780727,0.00090577494,0.002907333,0.026793592,0.013842671,0.95319253],"study_design_scores_gemma":[0.00003299531,0.00014800171,0.0012223832,0.0011414943,0.00015687039,0.00074092095,0.0010436954,0.020678293,0.012021822,0.12677523,0.83595234,0.000085954525],"about_ca_topic_score_codex":0.0017173364,"about_ca_topic_score_gemma":0.0017102374,"teacher_disagreement_score":0.022833075,"about_ca_system_score_codex":0.000792139,"about_ca_system_score_gemma":0.0016690119,"threshold_uncertainty_score":0.07638425},"labels":[],"label_agreement":null},{"id":"W1575238410","doi":"10.1007/3-540-44520-x_13","title":"Generating Parallel Program Frameworks from Parallel Design Patterns","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Template; Abstraction; Programmer; Parallel computing; Parallel programming model; Programming language; Domain (mathematical analysis); Object-oriented programming; Software design pattern; Abstraction layer; Programming paradigm; Software","score_opus":0.02416137622409316,"score_gpt":0.25648408222906266,"score_spread":0.23232270600496951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575238410","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.020742593,0.0001554628,0.9628588,0.00027995103,0.000079369536,0.00027146362,0.0005360643,0.008857852,0.006218438],"genre_scores_gemma":[0.12036506,0.0003577756,0.86850405,0.00010006815,0.000032146814,0.0004145928,0.0024900334,0.002911755,0.0048246263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994129,0.00010538159,0.00003838013,0.000120161465,0.00025154266,0.000071679606],"domain_scores_gemma":[0.99861896,0.00065676996,0.0001070518,0.0003316694,0.00024061973,0.00004502789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071640237,0.0010571484,0.0005813794,0.0011000632,0.00065277854,0.0012433833,0.0016318735,0.0009111514,0.005630556],"category_scores_gemma":[0.004264177,0.0010757165,0.0019160121,0.0011620617,0.0008637021,0.0021647154,0.0018742594,0.0017943349,0.0018085178],"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.00025648047,0.0002615713,0.003658974,0.0010610644,0.00010055497,0.00089638727,0.00089325116,0.12545525,0.024552234,0.20499845,0.030035492,0.60783035],"study_design_scores_gemma":[0.00014427613,0.00013007812,0.00055993785,0.00015717164,0.00013833056,0.0006242547,0.00033859056,0.67941946,0.035155755,0.21787637,0.06540086,0.000054970704],"about_ca_topic_score_codex":0.0012132971,"about_ca_topic_score_gemma":0.0029519193,"teacher_disagreement_score":0.005630556,"about_ca_system_score_codex":0.0005555575,"about_ca_system_score_gemma":0.0011603583,"threshold_uncertainty_score":0.018836081},"labels":[],"label_agreement":null},{"id":"W1575324322","doi":"10.1007/11566465_103","title":"Development and Application of Functional Databases for Planning Deep-Brain Neurosurgical Procedures","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Western University; Robarts Clinical Trials; London Health Sciences Centre","funders":"Canadian Institutes of Health Research; Ontario Innovation Trust","keywords":"Computer science; Visualization; Surgical planning; Deep brain stimulation; Subthalamic nucleus; Brain atlas; Artificial intelligence; Medical physics; Medicine; Parkinson's disease; Surgery","score_opus":0.031591412788843865,"score_gpt":0.30199320331574414,"score_spread":0.2704017905269003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575324322","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.024202058,0.00043476545,0.9606784,0.00029767308,0.000064331514,0.00034098586,0.0024210298,0.0097731035,0.0017877434],"genre_scores_gemma":[0.2182896,0.00066430576,0.7731203,0.00009560554,0.000037319176,0.00055850286,0.0052862656,0.00065888534,0.0012892558],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993011,0.00010629806,0.00011581352,0.00014247344,0.0002955583,0.000038809398],"domain_scores_gemma":[0.99720544,0.0010758181,0.00018723757,0.00051986333,0.0008698069,0.0001417536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017219301,0.0008275865,0.0010383595,0.002629776,0.0005533029,0.0024454936,0.0031237404,0.00092661916,0.004153957],"category_scores_gemma":[0.006659396,0.0010023434,0.00091433397,0.0017830585,0.0003877993,0.0016919078,0.0011612307,0.0007548911,0.0013051901],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005783218,0.00022191963,0.0067086667,0.0003314693,0.00018042489,0.00043592844,0.00027398035,0.13647921,0.01236022,0.0103640435,0.011917018,0.8201489],"study_design_scores_gemma":[0.00008098699,0.00019184113,0.0024257875,0.00006764329,0.00009467084,0.00055391085,0.0001698403,0.93858814,0.035812527,0.009547284,0.012416857,0.000050464394],"about_ca_topic_score_codex":0.010536247,"about_ca_topic_score_gemma":0.010891823,"teacher_disagreement_score":0.010536247,"about_ca_system_score_codex":0.0009201917,"about_ca_system_score_gemma":0.0020036278,"threshold_uncertainty_score":0.02094984},"labels":[],"label_agreement":null},{"id":"W1575361522","doi":"10.1007/978-3-540-24840-8_62","title":"Genetic Algorithm Based OSPF Network Routing Using LEDA","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Open Shortest Path First; Quality of service; Genetic algorithm; Context (archaeology); Routing protocol; Routing (electronic design automation); Shortest path problem; Distributed computing; Computer network; Routing algorithm; Algorithm; Link-state routing protocol; Theoretical computer science; Machine learning","score_opus":0.013615546472580403,"score_gpt":0.2233515970803785,"score_spread":0.2097360506077981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575361522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04899691,0.0003133872,0.9377146,0.00023211443,0.00018893315,0.00011302928,0.000070140195,0.0012731309,0.011097898],"genre_scores_gemma":[0.49821776,0.00023799438,0.49306554,0.00015526694,0.000044221928,0.00024240688,0.0001591729,0.00010335653,0.0077741127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999747,0.00008000171,0.000010381014,0.000042497628,0.00008796043,0.000032236396],"domain_scores_gemma":[0.99963427,0.00015097753,0.000023857445,0.000043441152,0.00012915,0.0000183502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005357693,0.0003617052,0.0006243465,0.0007378458,0.0005772153,0.0007935888,0.0010515492,0.00085234124,0.0017823805],"category_scores_gemma":[0.0011621885,0.0002554045,0.000435609,0.000671322,0.00036580669,0.00048391244,0.0005272148,0.0006319203,0.00029880193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066140194,0.0001108519,0.00087066804,0.00004609265,0.000055389355,0.000073213734,0.0000658924,0.7910558,0.006298947,0.018190268,0.0020421701,0.18112458],"study_design_scores_gemma":[0.000013394915,0.000023891409,0.000119294935,0.0000052502833,0.000013210445,0.000020973093,0.0000074745863,0.99563134,0.0010650102,0.002106431,0.0009864022,0.000007343252],"about_ca_topic_score_codex":0.0070259264,"about_ca_topic_score_gemma":0.0048108664,"teacher_disagreement_score":0.0070259264,"about_ca_system_score_codex":0.00081403024,"about_ca_system_score_gemma":0.0009309634,"threshold_uncertainty_score":0.013970077},"labels":[],"label_agreement":null},{"id":"W1575579476","doi":"10.1007/978-3-540-28634-9_20","title":"Efficient Data Collection Trees in Sensor Networks with Redundancy Removal","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Redundancy (engineering); Wireless sensor network; Data collection; Computer network; Operating system; Mathematics","score_opus":0.016407159048410922,"score_gpt":0.22943714441017568,"score_spread":0.21302998536176476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575579476","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.016827129,0.0014460421,0.9792422,0.00023012595,0.00006730553,0.00007776575,0.00013836128,0.00060081284,0.0013702838],"genre_scores_gemma":[0.21147214,0.0019015736,0.7814269,0.00014585363,0.00014215735,0.00027118775,0.00052276644,0.00025939578,0.0038579167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991042,0.00023294776,0.00007632598,0.0001276967,0.00037169392,0.00008706747],"domain_scores_gemma":[0.9974591,0.001414419,0.00019950252,0.00053114846,0.00032978656,0.00006611904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012841523,0.00068883353,0.0012823958,0.0009687767,0.0007046215,0.0008880397,0.0017115347,0.0007202822,0.0011943254],"category_scores_gemma":[0.0039787064,0.0007731465,0.0006138854,0.0026358827,0.00063000503,0.0025506115,0.0013363168,0.0012268994,0.00046532616],"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.0004888041,0.00023517749,0.0011247207,0.0008870103,0.00012892311,0.00019457657,0.0004550447,0.31154567,0.03825445,0.07584212,0.01166081,0.5591827],"study_design_scores_gemma":[0.000056021843,0.00022291209,0.00055609184,0.000064356034,0.00007983615,0.00040515268,0.000094577124,0.8983912,0.018994188,0.07237194,0.008730991,0.000032821736],"about_ca_topic_score_codex":0.00058093993,"about_ca_topic_score_gemma":0.0010530264,"teacher_disagreement_score":0.0017115347,"about_ca_system_score_codex":0.00050463143,"about_ca_system_score_gemma":0.00079374574,"threshold_uncertainty_score":0.006791353},"labels":[],"label_agreement":null},{"id":"W1575591740","doi":"10.1007/11527800_6","title":"A New Programming Paradigm Inspired by Artificial Chemistries","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Origins and Evolution of Life","field":"Physics and Astronomy","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Cognitive science; Artificial intelligence; Psychology","score_opus":0.013052638924555203,"score_gpt":0.23999927189284398,"score_spread":0.22694663296828876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575591740","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.009106055,0.000593851,0.95490277,0.0014647489,0.0003270259,0.0000822523,0.00008316173,0.0009817119,0.03245839],"genre_scores_gemma":[0.12759063,0.00085264625,0.8496735,0.00092102797,0.00022938993,0.00037596578,0.00015140191,0.00067054917,0.019534862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993691,0.0001877788,0.000045682067,0.00014539955,0.00019618188,0.00005588544],"domain_scores_gemma":[0.9989949,0.00049775647,0.000052307125,0.00024277088,0.00013376595,0.0000786272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008376621,0.00044932574,0.00045486473,0.00047976506,0.00087266223,0.002207728,0.0022627392,0.0011692625,0.0056548384],"category_scores_gemma":[0.0025104315,0.00048847485,0.0008520672,0.00061566517,0.0024533384,0.005270651,0.001812305,0.0029835396,0.001181234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023516763,0.000025929148,0.00008229398,0.00009306508,0.0000094583165,0.000034218745,0.00014984625,0.00523292,0.0023641645,0.95818424,0.0030677859,0.030732496],"study_design_scores_gemma":[0.000035617086,0.000030249974,0.000035831585,0.00003503772,0.00001685755,0.0001164213,0.000028947372,0.06750547,0.0034903598,0.8704491,0.058240376,0.000015633937],"about_ca_topic_score_codex":0.00059851905,"about_ca_topic_score_gemma":0.00097322883,"teacher_disagreement_score":0.0056548384,"about_ca_system_score_codex":0.00062725233,"about_ca_system_score_gemma":0.0011414868,"threshold_uncertainty_score":0.018917322},"labels":[],"label_agreement":null},{"id":"W1575604185","doi":"10.1007/3-540-45786-0_41","title":"Affine Transformations and Atlases: Assessing a New Navigation Tool for Knee Arthroplasty","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Arthroplasty; Total knee arthroplasty; Computer science; Transformation (genetics); Artificial intelligence; Population; Atlas (anatomy); Computer vision; Medicine; Physical medicine and rehabilitation; Radiology; Surgery; Mathematics; Anatomy","score_opus":0.01907669394703529,"score_gpt":0.26748812210314316,"score_spread":0.24841142815610787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575604185","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.6158648,0.0069731562,0.3390046,0.0010750724,0.0006028968,0.00069441425,0.0034666534,0.0024271833,0.029891212],"genre_scores_gemma":[0.83002895,0.002983845,0.1597607,0.0001241935,0.00008862193,0.00024762575,0.0013494919,0.000376892,0.005039586],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99688303,0.0011948997,0.00029366818,0.00022571877,0.0013206118,0.00008209384],"domain_scores_gemma":[0.9872177,0.008925196,0.0011183483,0.0006107328,0.0019041471,0.0002238819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037147931,0.0008160174,0.00056224107,0.0022509925,0.0002993668,0.002115799,0.00082551077,0.0007726501,0.0039856965],"category_scores_gemma":[0.035624895,0.0003811496,0.0006257721,0.0020519646,0.00064973446,0.0025715772,0.001456982,0.0005057334,0.00088431855],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012490869,0.00018552746,0.081396304,0.00048379984,0.00021183738,0.00019668436,0.0014231132,0.010767747,0.005131454,0.0038455932,0.0061768983,0.88893205],"study_design_scores_gemma":[0.00042755436,0.008632377,0.5904622,0.0011072512,0.0021135896,0.007658956,0.008918118,0.26269874,0.036598865,0.039390557,0.041423973,0.0005678389],"about_ca_topic_score_codex":0.0029479535,"about_ca_topic_score_gemma":0.0056644212,"teacher_disagreement_score":0.0039856965,"about_ca_system_score_codex":0.0005856856,"about_ca_system_score_gemma":0.0010906138,"threshold_uncertainty_score":0.019645989},"labels":[],"label_agreement":null},{"id":"W1575688757","doi":"10.1007/978-3-540-45087-0_14","title":"Object-Based Strategy for Morphometry of the Cerebral Cortex","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","field":"Mathematics","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Sulcus; Artificial intelligence; Central sulcus; Computer science; Computer vision; Voxel; Object (grammar); Gyrus; Pattern recognition (psychology); Neuroscience; Psychology; Motor cortex","score_opus":0.04016791977058799,"score_gpt":0.29700899998298147,"score_spread":0.2568410802123935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575688757","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.0750072,0.00017634947,0.9214073,0.00013565873,0.000056042754,0.000029974277,0.000057470013,0.00031760952,0.0028124158],"genre_scores_gemma":[0.6082922,0.00037127687,0.38604692,0.00008967744,0.000045450004,0.000057860037,0.0001530892,0.0002871673,0.0046563623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999124,0.000014411147,0.0000058460655,0.00002882467,0.000023891364,0.000014683515],"domain_scores_gemma":[0.99986815,0.000028613276,0.00001472478,0.000035560995,0.000033206667,0.000019653467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031991678,0.000313594,0.00046877787,0.00062876364,0.00035195897,0.0010194941,0.00074779027,0.0005558682,0.0016715132],"category_scores_gemma":[0.0005894478,0.0002519255,0.00069064973,0.0006010265,0.0005430963,0.0009951295,0.0007604749,0.00044541198,0.0003844709],"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.00014452176,0.00004842558,0.0016643392,0.0001795874,0.000109658606,0.00033911015,0.00031580788,0.03459565,0.34161475,0.24892835,0.0016563184,0.3704035],"study_design_scores_gemma":[0.00003478101,0.00021006702,0.0074556237,0.00002230196,0.00011010467,0.0008637094,0.0001858526,0.66225976,0.06969756,0.2527256,0.00636581,0.0000687186],"about_ca_topic_score_codex":0.0012005445,"about_ca_topic_score_gemma":0.0015441175,"teacher_disagreement_score":0.0016715132,"about_ca_system_score_codex":0.00036817684,"about_ca_system_score_gemma":0.00043714084,"threshold_uncertainty_score":0.0055918097},"labels":[],"label_agreement":null},{"id":"W1575691175","doi":"10.1007/978-3-540-24840-8_56","title":"Performance Evaluation of Agent Toolkits","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Acadia University","funders":"","keywords":"JADE (particle detector); Java; ZEUS (particle detector); Computer science; Multi-agent system; Software engineering; Systems engineering; Engineering; World Wide Web; Programming language; Artificial intelligence","score_opus":0.04342798871984285,"score_gpt":0.2751487778920355,"score_spread":0.23172078917219266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575691175","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.82361543,0.0038523555,0.12748872,0.000753592,0.00044656,0.00056615187,0.0010310062,0.014539332,0.027706794],"genre_scores_gemma":[0.96266675,0.00035620143,0.032189205,0.000033016764,0.000031318545,0.0001287004,0.0010007157,0.00084325863,0.0027507467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.97039086,0.014527597,0.0018975361,0.0016507657,0.009837075,0.0016962442],"domain_scores_gemma":[0.9243529,0.04736264,0.00334391,0.009565714,0.012234373,0.003140522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015757294,0.0017421038,0.001800495,0.0030609479,0.0012406246,0.0045351065,0.0035953242,0.0019535497,0.00519508],"category_scores_gemma":[0.05919416,0.0007976522,0.000730385,0.0029753875,0.001542319,0.003883687,0.0035177376,0.0015573499,0.001827896],"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.01758488,0.002554804,0.016625667,0.0018095422,0.00073353865,0.00042331926,0.0015063479,0.5411046,0.023181492,0.026645022,0.012590836,0.35524],"study_design_scores_gemma":[0.00044333594,0.0018873231,0.0043484922,0.00008795159,0.00022746345,0.00021376956,0.00049944624,0.9575981,0.022910954,0.006393561,0.0052788095,0.00011073489],"about_ca_topic_score_codex":0.0051490064,"about_ca_topic_score_gemma":0.002767343,"teacher_disagreement_score":0.015757294,"about_ca_system_score_codex":0.002782413,"about_ca_system_score_gemma":0.0024859668,"threshold_uncertainty_score":0.08333355},"labels":[],"label_agreement":null},{"id":"W1575733405","doi":"10.1007/11844662_8","title":"Conflict of Interest in the Administrative Role Graph Model","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Operations research; Distributed computing; Mathematics","score_opus":0.08733322850227022,"score_gpt":0.3249995060533201,"score_spread":0.2376662775510499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575733405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12523879,0.0011457918,0.74072254,0.011569132,0.000289803,0.00028549045,0.0012458247,0.00029432322,0.11920828],"genre_scores_gemma":[0.94033426,0.00074576697,0.03460454,0.0005350047,0.000260522,0.00031490953,0.00045219512,0.00008706244,0.02266565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496293,0.0030243504,0.00017835373,0.0005518325,0.00070326874,0.0005793367],"domain_scores_gemma":[0.9813099,0.014643583,0.0012126766,0.0010974054,0.00083843665,0.0008980438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056273346,0.0011065487,0.001619513,0.0017384083,0.0018634798,0.0051073404,0.003900506,0.003988179,0.012023721],"category_scores_gemma":[0.017417472,0.0009512265,0.0013910943,0.0027980716,0.0041785655,0.010183308,0.001980122,0.0042346986,0.0013258713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043721742,0.000047817364,0.00031018397,0.00002647769,0.000023152712,0.00013964243,0.0001529966,0.02947243,0.00010486671,0.96541536,0.0014061384,0.0028573102],"study_design_scores_gemma":[0.00004946182,0.000018229179,0.00012512677,0.000010586826,0.000027873928,0.00011823073,0.00009165127,0.18604557,0.000052950938,0.81172377,0.0017180084,0.000018621327],"about_ca_topic_score_codex":0.0070563243,"about_ca_topic_score_gemma":0.0053600185,"teacher_disagreement_score":0.012023721,"about_ca_system_score_codex":0.0029202893,"about_ca_system_score_gemma":0.0018961348,"threshold_uncertainty_score":0.04022336},"labels":[],"label_agreement":null},{"id":"W1575868721","doi":"10.1007/11527886_7","title":"Data-Driven Refinement of a Probabilistic Model of User Affect","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Dynamic Bayesian network; Bayesian network; Affect (linguistics); Statistical model; User modeling; Machine learning; Bayesian probability; Data mining; Artificial intelligence; User interface","score_opus":0.06132362445214597,"score_gpt":0.28689843495035483,"score_spread":0.22557481049820888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575868721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02317395,0.00008561555,0.9745395,0.00026501517,0.000048567716,0.0000677092,0.00024096282,0.0004673,0.00111145],"genre_scores_gemma":[0.6472065,0.00014787712,0.34856537,0.00014132673,0.00005658293,0.0002462147,0.0007758644,0.00031455595,0.0025457512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973738,0.0009989014,0.00013413708,0.0006265283,0.00073832896,0.0001282621],"domain_scores_gemma":[0.97441846,0.018482827,0.00083368865,0.0034404867,0.0024445215,0.00038004707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005658127,0.0006771678,0.001199505,0.0009811579,0.0005287983,0.0018285774,0.003421374,0.0012928457,0.0036757246],"category_scores_gemma":[0.040550888,0.0013620413,0.0011989858,0.0011120442,0.0012255622,0.0039550355,0.0020215241,0.0035351536,0.00078901596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008701269,0.00027507165,0.005658901,0.00029045928,0.00019990618,0.00025516335,0.0009922123,0.7266056,0.014196778,0.120805256,0.0036167556,0.12623379],"study_design_scores_gemma":[0.000013208202,0.000015403402,0.00031622,0.0000047961285,0.000009276918,0.00002067856,0.000009743819,0.9779593,0.00095924863,0.020391036,0.0002916146,0.000009553571],"about_ca_topic_score_codex":0.008529806,"about_ca_topic_score_gemma":0.010743739,"teacher_disagreement_score":0.008529806,"about_ca_system_score_codex":0.0016182938,"about_ca_system_score_gemma":0.0016900074,"threshold_uncertainty_score":0.02992338},"labels":[],"label_agreement":null},{"id":"W1575989225","doi":"10.1007/978-3-642-23771-3_12","title":"Moving Target Selection in 2D Graphical User Interfaces","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Selection (genetic algorithm); Target acquisition; Artificial intelligence; Human–computer interaction; Computer vision; Machine learning","score_opus":0.014502936938266802,"score_gpt":0.24368667522207194,"score_spread":0.22918373828380514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575989225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02463085,0.003399002,0.9562563,0.00008312242,0.0001470388,0.000053280797,0.00012629997,0.0032493814,0.012054761],"genre_scores_gemma":[0.33545777,0.004490199,0.6085869,0.00034387922,0.00016795128,0.00024361376,0.00065125886,0.0016052049,0.048453238],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995459,0.00014964317,0.000020321724,0.00006886234,0.0001723483,0.000042919462],"domain_scores_gemma":[0.99964774,0.00024343349,0.000017096228,0.00003345256,0.00004669267,0.000011583331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077039,0.00095373025,0.00072022516,0.00046422388,0.000250984,0.0011943238,0.0008999801,0.0010305012,0.014118889],"category_scores_gemma":[0.0010234134,0.0007146645,0.0003952704,0.00082007627,0.00029165074,0.0013574925,0.0009501052,0.00048791614,0.0028485737],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065096,0.00007696591,0.0006735685,0.0008849953,0.00006219452,0.00044918852,0.00064278394,0.02651617,0.22478658,0.01936837,0.016189976,0.7096982],"study_design_scores_gemma":[0.00016043545,0.000632405,0.0055111893,0.0003216376,0.000108701715,0.0025660617,0.0003601219,0.71367794,0.14957854,0.0288932,0.097979955,0.00020988043],"about_ca_topic_score_codex":0.00058616506,"about_ca_topic_score_gemma":0.0010811373,"teacher_disagreement_score":0.014118889,"about_ca_system_score_codex":0.00018264104,"about_ca_system_score_gemma":0.000105095125,"threshold_uncertainty_score":0.04723233},"labels":[],"label_agreement":null},{"id":"W1575996043","doi":"10.1007/978-3-540-77120-3_28","title":"Approximability of Packing Disjoint Cycles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Packing problems; Mathematics; Undirected graph; Binary logarithm; Upper and lower bounds; Omega; Vertex (graph theory); Approximation algorithm; Graph; Log-log plot; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Physics","score_opus":0.02392553823466615,"score_gpt":0.24292505205181883,"score_spread":0.21899951381715269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575996043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17288269,0.003642654,0.72369915,0.0013124876,0.0003846967,0.00019078024,0.0007933901,0.0018646677,0.095229596],"genre_scores_gemma":[0.6839581,0.003363496,0.27689844,0.00042217656,0.0004483015,0.0003683796,0.0022785014,0.0010891311,0.031173421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985359,0.00027388218,0.00008491913,0.00034315354,0.0005619233,0.00020022766],"domain_scores_gemma":[0.9950872,0.003282801,0.00020278488,0.001005635,0.00026743519,0.00015429387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481656,0.0014345482,0.0016818807,0.0013965219,0.0008556087,0.0032300104,0.0031202324,0.0014115389,0.010777621],"category_scores_gemma":[0.010053223,0.001106604,0.0022577376,0.0027268804,0.0017764566,0.006095337,0.0029231913,0.004166351,0.0011495563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054408883,0.00019643354,0.0010329256,0.0008001845,0.000121170364,0.00018770545,0.0005921764,0.19440332,0.005116321,0.5944208,0.0120328395,0.19055216],"study_design_scores_gemma":[0.00005213787,0.000049371996,0.00033216976,0.000086838256,0.000064107066,0.00020347825,0.00007958245,0.22619674,0.0024743944,0.7621113,0.008331803,0.000018109635],"about_ca_topic_score_codex":0.0024336793,"about_ca_topic_score_gemma":0.0020009808,"teacher_disagreement_score":0.010777621,"about_ca_system_score_codex":0.0025219868,"about_ca_system_score_gemma":0.0008846957,"threshold_uncertainty_score":0.03605473},"labels":[],"label_agreement":null},{"id":"W1576063399","doi":"10.1007/11750321_22","title":"Alternative Measures of Computational Complexity with Applications to Agnostic Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computational complexity theory; Bounded function; Task (project management); Hierarchy; Structural complexity theory; Measure (data warehouse); Time complexity; Asymptotic computational complexity; Theoretical computer science; Polynomial hierarchy; Perspective (graphical); Set (abstract data type); Quantum complexity theory; Worst-case complexity; Computational resource; Probably approximately correct learning; Descriptive complexity theory; Artificial intelligence; Computational learning theory; Complexity class; Algorithm; Mathematics; Data mining; Active learning (machine learning)","score_opus":0.028155274433189915,"score_gpt":0.27320665951605355,"score_spread":0.24505138508286364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576063399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0242592,0.0023696553,0.9586481,0.002471803,0.0003190977,0.00009542605,0.00029980054,0.00025278114,0.011284214],"genre_scores_gemma":[0.5609161,0.0033818001,0.42091134,0.0011475624,0.0024973813,0.00082158035,0.0007975551,0.0003472378,0.009179388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99010974,0.004700926,0.0006306175,0.0013178147,0.0027870864,0.0004538606],"domain_scores_gemma":[0.871739,0.0987377,0.0069695823,0.013160955,0.0067514023,0.0026414162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012702055,0.0022003592,0.0022152406,0.007578496,0.0012538657,0.0070549245,0.0052801166,0.0048817373,0.006550768],"category_scores_gemma":[0.08675927,0.0009957606,0.0021196886,0.008511138,0.008360517,0.022862272,0.0066372985,0.008175636,0.00068817934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004769135,0.00006094241,0.0008149332,0.000078387384,0.00003995866,0.000020143281,0.00007695214,0.01240517,0.00018088853,0.96600115,0.001385288,0.018888503],"study_design_scores_gemma":[0.0000104769,0.000034588535,0.0005665496,0.000032288368,0.00002139176,0.00005094071,0.000044078493,0.09499764,0.00015798082,0.9028852,0.0011643961,0.000034606546],"about_ca_topic_score_codex":0.00066861283,"about_ca_topic_score_gemma":0.00076525216,"teacher_disagreement_score":0.012702055,"about_ca_system_score_codex":0.0038427534,"about_ca_system_score_gemma":0.0014939159,"threshold_uncertainty_score":0.067175746},"labels":[],"label_agreement":null},{"id":"W1576096982","doi":"10.1007/3-540-44842-x_94","title":"On the Reliability of Triangle Intersection in 3D","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"McGill University","funders":"","keywords":"Intersection (aeronautics); Point (geometry); Reliability (semiconductor); Code (set theory); Space (punctuation); Mathematics; Computer science; Algorithm; Arithmetic; Geometry; Set (abstract data type); Geography; Physics; Programming language; Cartography","score_opus":0.017198452708866083,"score_gpt":0.24117718722042622,"score_spread":0.22397873451156014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576096982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21746132,0.004901457,0.746082,0.0018754484,0.00040683884,0.00013069279,0.000913502,0.0010136601,0.027215064],"genre_scores_gemma":[0.9269432,0.0018581083,0.06519863,0.00020052295,0.00046494638,0.00016778176,0.0007867985,0.0007033257,0.0036766645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918846,0.003006143,0.00046437926,0.000924117,0.0031233926,0.00059740123],"domain_scores_gemma":[0.80970794,0.1534137,0.008779845,0.015374517,0.010822438,0.0019015818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008286412,0.0010118965,0.0026671588,0.0044929506,0.0015175324,0.0029553655,0.0046622274,0.0025248218,0.007509138],"category_scores_gemma":[0.104497224,0.0017151217,0.0013282432,0.004572499,0.006508394,0.008665976,0.005041428,0.0041285986,0.00112195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015370122,0.00013592023,0.017646803,0.0006934223,0.0001428739,0.0004524556,0.0012607743,0.44428724,0.00394812,0.4248761,0.009281549,0.0957377],"study_design_scores_gemma":[0.000049667797,0.00012256246,0.0025604244,0.00011773169,0.00006389494,0.00031694048,0.00023731464,0.6756232,0.002396592,0.3164019,0.002053751,0.000056104567],"about_ca_topic_score_codex":0.0044108797,"about_ca_topic_score_gemma":0.0027182552,"teacher_disagreement_score":0.008286412,"about_ca_system_score_codex":0.0018950513,"about_ca_system_score_gemma":0.0010198987,"threshold_uncertainty_score":0.0438233},"labels":[],"label_agreement":null},{"id":"W1576164625","doi":"10.1007/3-540-44693-1_8","title":"Star-Free Open Languages and Aperiodic Loops","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McGill University; Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Aperiodic graph; Mathematics; Wreath product; Closure (psychology); Class (philosophy); Context (archaeology); Star (game theory); Star product; Discrete mathematics; Pure mathematics; Product (mathematics); Computer science; Combinatorics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.01792938583660957,"score_gpt":0.2759212597018551,"score_spread":0.2579918738652455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576164625","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.45242754,0.0025102878,0.35286862,0.0011617293,0.0005439279,0.000104263985,0.0002796497,0.0007097019,0.18939435],"genre_scores_gemma":[0.92608035,0.0007787872,0.025682712,0.00017860095,0.00022044055,0.0001007505,0.00019995721,0.00015839988,0.04659992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996123,0.00007700308,0.000036154004,0.00008572228,0.00011656061,0.00007236585],"domain_scores_gemma":[0.99864763,0.00078212284,0.00011986352,0.00012591117,0.00018191934,0.00014255583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046610704,0.00042358745,0.0004964444,0.0008738259,0.0011400448,0.002089822,0.00056212186,0.0006533313,0.0045009023],"category_scores_gemma":[0.0017619628,0.00041260634,0.0005792489,0.000906497,0.00222255,0.003936441,0.0015267513,0.0013428542,0.0006449328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029853565,0.000013078813,0.000085536914,0.000033660566,0.00000265194,0.00008486802,0.00040071137,0.0005167042,0.0016766574,0.9913747,0.00046379364,0.0053177755],"study_design_scores_gemma":[0.000008998117,0.000014885188,0.000048676917,0.0000055514515,0.0000032277428,0.00010157513,0.00009647594,0.0013661521,0.00076113123,0.9933076,0.004279498,0.0000061226683],"about_ca_topic_score_codex":0.00025290088,"about_ca_topic_score_gemma":0.00030650714,"teacher_disagreement_score":0.0045009023,"about_ca_system_score_codex":0.00057553913,"about_ca_system_score_gemma":0.0004533959,"threshold_uncertainty_score":0.015056968},"labels":[],"label_agreement":null},{"id":"W1576186752","doi":"10.1007/978-3-642-02085-8_13","title":"Compressed RF Tomography for Wireless Sensor Networks: Centralized and Decentralized Approaches","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":123,"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":"Computer science; Compressed sensing; Wireless sensor network; Inference; Radio frequency; Wireless; Key distribution in wireless sensor networks; Process (computing); Set (abstract data type); Wireless network; Real-time computing; Artificial intelligence; Computer network; Telecommunications","score_opus":0.017398818205520274,"score_gpt":0.2086868378523487,"score_spread":0.19128801964682843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576186752","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.0025490623,0.0010880724,0.99344796,0.00029563365,0.000049703165,0.000017369206,0.00003117148,0.00013815168,0.0023828791],"genre_scores_gemma":[0.5422471,0.0071202493,0.43958366,0.00030640754,0.0009997089,0.00021781708,0.00027681023,0.00024760913,0.009000638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991829,0.00030878535,0.000026818057,0.000111499205,0.00033002964,0.000039954368],"domain_scores_gemma":[0.9982864,0.0011108165,0.00013037775,0.00027330712,0.00017314368,0.000025793643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010915986,0.00073370605,0.0010912967,0.00052084954,0.00033795784,0.0009839527,0.0011889203,0.0010893771,0.0019483467],"category_scores_gemma":[0.0038397212,0.00051185547,0.00043471318,0.0012541077,0.0013826545,0.0024599372,0.001309317,0.0013547312,0.00031417367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017655763,0.00006730488,0.00040156383,0.00041117857,0.00007011647,0.00015476528,0.00018441826,0.54538804,0.013880918,0.17010501,0.008202624,0.26095748],"study_design_scores_gemma":[0.000018715204,0.000040257106,0.00022400288,0.000021241778,0.000018783418,0.00016038731,0.000026635766,0.9299946,0.0028512974,0.06388034,0.0027458444,0.000017920016],"about_ca_topic_score_codex":0.00066459394,"about_ca_topic_score_gemma":0.00097543735,"teacher_disagreement_score":0.0019483467,"about_ca_system_score_codex":0.00077433954,"about_ca_system_score_gemma":0.0006365269,"threshold_uncertainty_score":0.006517887},"labels":[],"label_agreement":null},{"id":"W1576323019","doi":"10.1007/11902140_88","title":"Trustworthy Distributed Algorithm Design to Defend Distance Cheating in Link-Weighted ALM","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cheating; Computer science; Trustworthiness; Multicast; Tree (set theory); Algorithm; Theoretical computer science; Computer network; Distributed computing; Computer security; Mathematics","score_opus":0.01588297952493769,"score_gpt":0.23404073209127085,"score_spread":0.21815775256633316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576323019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010627474,0.000121822384,0.9877445,0.000114357215,0.000043767148,0.00006327257,0.000009374138,0.00021280735,0.0010625735],"genre_scores_gemma":[0.56635284,0.00019469035,0.4282237,0.00016236826,0.00010430519,0.00024724673,0.000054388995,0.00013289612,0.004527565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962417,0.0013240572,0.0002583403,0.00057164097,0.001279892,0.00032444418],"domain_scores_gemma":[0.992078,0.003931404,0.0005608919,0.0016370058,0.0015369229,0.00025565864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004906991,0.0007372156,0.0016013517,0.0009130273,0.0013042805,0.0021976002,0.0039217467,0.0018669368,0.0021267394],"category_scores_gemma":[0.016643861,0.00063048373,0.0006019455,0.0012008116,0.0014546424,0.0034610939,0.0031676043,0.0021708328,0.0005829997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006502456,0.00023190487,0.00106633,0.0002853198,0.00014794695,0.00015193572,0.00047237249,0.6269634,0.013476558,0.16518599,0.004275457,0.18709257],"study_design_scores_gemma":[0.000023282362,0.00005577739,0.000037437883,0.0000068147924,0.000016899347,0.000038986935,0.000021311902,0.9767278,0.0018032932,0.020609073,0.0006517208,0.0000075453445],"about_ca_topic_score_codex":0.00077934976,"about_ca_topic_score_gemma":0.0012022754,"teacher_disagreement_score":0.004906991,"about_ca_system_score_codex":0.0016333986,"about_ca_system_score_gemma":0.0015740875,"threshold_uncertainty_score":0.025950968},"labels":[],"label_agreement":null},{"id":"W1576391018","doi":"10.1007/3-540-46428-x_17","title":"A Model for Describing Object-Oriented Systems from Multiple Perspectives","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Unified Modeling Language; Programming language; Object-oriented programming; Formal specification; Object (grammar); Object Constraint Language; Theoretical computer science; Software engineering; Artificial intelligence; Applications of UML; Software","score_opus":0.06792613572311325,"score_gpt":0.27523287996250084,"score_spread":0.2073067442393876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576391018","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.0022422753,0.0004807583,0.98787796,0.0006061564,0.00015276957,0.00012913336,0.00032024735,0.00093738316,0.0072533446],"genre_scores_gemma":[0.07232158,0.0013762015,0.91180295,0.0005036757,0.00022892877,0.001008189,0.0012893231,0.0005794091,0.010889693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837106,0.00040433407,0.00027082118,0.00023585833,0.0005687464,0.00014915514],"domain_scores_gemma":[0.9984376,0.0005359386,0.00023306422,0.00035442537,0.00029911174,0.00013985741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019241744,0.001955949,0.0010943484,0.0025432184,0.0013363964,0.0058196094,0.0028816056,0.0029677362,0.004576896],"category_scores_gemma":[0.0033059148,0.0012621694,0.0027058867,0.0031322902,0.0023898964,0.009009353,0.0030604794,0.0035398754,0.0023443755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003238714,0.000044455475,0.0003171681,0.00025634572,0.000045835244,0.00042845105,0.00085781247,0.009392905,0.00315335,0.94930565,0.0048274808,0.03133809],"study_design_scores_gemma":[0.0000705414,0.000084123516,0.00024057252,0.00029623028,0.00023633422,0.00069404417,0.000376553,0.092848696,0.0033795363,0.7412599,0.16043134,0.0000822321],"about_ca_topic_score_codex":0.0037930605,"about_ca_topic_score_gemma":0.0041180956,"teacher_disagreement_score":0.0058196094,"about_ca_system_score_codex":0.001579998,"about_ca_system_score_gemma":0.0021205966,"threshold_uncertainty_score":0.015311241},"labels":[],"label_agreement":null},{"id":"W1576470535","doi":"10.1007/978-3-540-72530-5_14","title":"Evolution of Fuzzy System Models: An Overview and New Directions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fuzzy logic; Soft computing; Fuzzy set; Neuro-fuzzy; Artificial intelligence; Fuzzy control system; Schema (genetic algorithms); Data mining; Machine learning; Theoretical computer science","score_opus":0.05524635328397992,"score_gpt":0.2618767501520619,"score_spread":0.206630396868082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576470535","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007876808,0.11022251,0.86368066,0.0017941571,0.00051586225,0.000034384073,0.00012688273,0.00024019969,0.015508629],"genre_scores_gemma":[0.3228869,0.18551835,0.46605605,0.0006634777,0.0024331543,0.00020306869,0.00057612313,0.00031553078,0.021347288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994261,0.0001894679,0.000041290063,0.00011023144,0.00020411867,0.00002882093],"domain_scores_gemma":[0.9991078,0.00055005576,0.000055537635,0.00011337362,0.00014010887,0.00003320744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336511,0.00087567547,0.0017226632,0.0009018239,0.0003391724,0.002174966,0.002103459,0.0015080796,0.002412811],"category_scores_gemma":[0.0026336221,0.00069247803,0.0013445844,0.0021727486,0.0010241737,0.0034039095,0.0010975265,0.0018904958,0.00063745456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057381225,0.000085549975,0.0010838842,0.0009728344,0.00018403909,0.00017761582,0.00033695242,0.14263296,0.0019841036,0.5496875,0.007103982,0.2956932],"study_design_scores_gemma":[0.000016512737,0.00006534951,0.00052181486,0.00020319586,0.000058210757,0.000341897,0.00008212204,0.5229014,0.0007621041,0.43095264,0.044048753,0.000046106816],"about_ca_topic_score_codex":0.0021164403,"about_ca_topic_score_gemma":0.0015549243,"teacher_disagreement_score":0.002412811,"about_ca_system_score_codex":0.0010197763,"about_ca_system_score_gemma":0.00062296656,"threshold_uncertainty_score":0.008071721},"labels":[],"label_agreement":null},{"id":"W1576481657","doi":"10.1007/978-3-540-74260-9_21","title":"Image Segmentation Using Level Set and Local Linear Approximations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Segmentation; Image segmentation; Image (mathematics); Scale-space segmentation; Artificial intelligence; Set (abstract data type); Segmentation-based object categorization; Linear approximation; Computer vision; Scope (computer science); Algorithm; Pattern recognition (psychology); Nonlinear system","score_opus":0.06645478620908808,"score_gpt":0.3354902658013269,"score_spread":0.26903547959223884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576481657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010610303,0.00019543187,0.99777836,0.00003857457,0.000012415625,0.000016278962,0.000020997306,0.00037711943,0.00049973355],"genre_scores_gemma":[0.04753367,0.00065446115,0.9481383,0.000047644968,0.00004132363,0.00009462682,0.00016652152,0.00048150195,0.0028419672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992545,0.00015937017,0.00005105006,0.00013097773,0.00035423297,0.00004975628],"domain_scores_gemma":[0.9988631,0.000625378,0.00009621134,0.00018701016,0.0001920453,0.000036241538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608287,0.0009071304,0.002075569,0.0021592316,0.00048250996,0.0027812093,0.0019299871,0.0016663078,0.0037129074],"category_scores_gemma":[0.0037416413,0.0015575538,0.0016278551,0.002458026,0.0010646472,0.002234271,0.0014420198,0.002139353,0.0018829494],"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.00021532652,0.00007699091,0.00038060872,0.0004914829,0.00013997166,0.00010862431,0.00020207232,0.41359958,0.031006115,0.060845025,0.0043246746,0.48860955],"study_design_scores_gemma":[0.000006593616,0.000015907694,0.00009783604,0.000015977861,0.000018910376,0.00006576977,0.000010376973,0.9774001,0.005416506,0.01520504,0.0017331018,0.000013892282],"about_ca_topic_score_codex":0.0032178406,"about_ca_topic_score_gemma":0.0039842715,"teacher_disagreement_score":0.0037129074,"about_ca_system_score_codex":0.0014200304,"about_ca_system_score_gemma":0.0010017075,"threshold_uncertainty_score":0.012420952},"labels":[],"label_agreement":null},{"id":"W1576493106","doi":"10.1007/978-3-540-85097-7_35","title":"Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Homomorphism; Digraph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.029438573931049136,"score_gpt":0.27957456160883376,"score_spread":0.2501359876777846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576493106","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.548394,0.0014663477,0.28388393,0.0093149515,0.00040662815,0.00018063713,0.0015771664,0.0010941577,0.15368219],"genre_scores_gemma":[0.9271478,0.00082546764,0.040186904,0.0007374161,0.0003734613,0.00025477321,0.001113841,0.00029399767,0.0290663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999116,0.00020641618,0.000039048104,0.00020873167,0.00026226047,0.00016751935],"domain_scores_gemma":[0.9957675,0.0029252926,0.00019563414,0.00036937557,0.0002478402,0.0004944093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010100858,0.00072690897,0.0019679824,0.001444231,0.002360177,0.0042848154,0.0023077982,0.0024153132,0.015518792],"category_scores_gemma":[0.0051612095,0.000819968,0.0012876869,0.001634619,0.0021768762,0.007855146,0.0031559933,0.0067721657,0.0010192421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008867965,0.00007117188,0.00024438204,0.0001414561,0.000018206738,0.00007467632,0.00024835434,0.004219238,0.0011324995,0.98052406,0.0036531375,0.009584168],"study_design_scores_gemma":[0.000028677114,0.00001595125,0.0001465731,0.0000143402185,0.000011560112,0.000050172428,0.000069982525,0.014233,0.00039913415,0.98397696,0.0010455002,0.000008173429],"about_ca_topic_score_codex":0.000834318,"about_ca_topic_score_gemma":0.0012351114,"teacher_disagreement_score":0.015518792,"about_ca_system_score_codex":0.0028819551,"about_ca_system_score_gemma":0.0010908544,"threshold_uncertainty_score":0.051915526},"labels":[],"label_agreement":null},{"id":"W1576672192","doi":"10.1007/978-3-540-27824-5_166","title":"Performance Analysis of Multi-pattern Frequency Hopping Wireless LANs","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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":"Concordia University","funders":"","keywords":"Computer science; Frequency-hopping spread spectrum; Computer network; Throughput; Network packet; Local area network; Physical layer; Transmission (telecommunications); Wireless; Interference (communication); IEEE 802.11; Wireless network; Telecommunications; Channel (broadcasting)","score_opus":0.02187378422752464,"score_gpt":0.25726080483541575,"score_spread":0.2353870206078911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576672192","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.7438502,0.0034073577,0.23914404,0.00031143514,0.0000739206,0.000058970454,0.00013632837,0.00060836494,0.012409347],"genre_scores_gemma":[0.99309903,0.0003307669,0.0051929536,0.00001882324,0.00004973392,0.000013729467,0.00004091079,0.000030563075,0.0012235832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990251,0.0003247096,0.000029145625,0.00010074318,0.00035084476,0.00016940152],"domain_scores_gemma":[0.99589217,0.0029395337,0.00025148955,0.00028462245,0.0005578566,0.0000743786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011652873,0.0005626415,0.0006019538,0.0012484881,0.00038457592,0.0007647357,0.00067187013,0.00050847774,0.0022201838],"category_scores_gemma":[0.0040987786,0.0002199668,0.00027467194,0.0009049463,0.0004837481,0.00087572675,0.000532399,0.0003860301,0.0002587092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009225102,0.00013458508,0.003459648,0.0002063379,0.0001088287,0.00018408164,0.00009817612,0.8672512,0.035906754,0.016127426,0.0008456288,0.074754804],"study_design_scores_gemma":[0.0000074700083,0.00017690414,0.000979707,0.000006187789,0.000020402174,0.0001371071,0.000021943184,0.9931009,0.0033713458,0.0019880463,0.00018097534,0.00000906516],"about_ca_topic_score_codex":0.0008078969,"about_ca_topic_score_gemma":0.0006382357,"teacher_disagreement_score":0.0022201838,"about_ca_system_score_codex":0.00085084373,"about_ca_system_score_gemma":0.00022441187,"threshold_uncertainty_score":0.007427275},"labels":[],"label_agreement":null},{"id":"W1576704038","doi":"10.1007/11519645_66","title":"Toward Cross-Language and Cross-Media Image Retrieval","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Focus (optics); Image retrieval; Information retrieval; Visual Word; Image (mathematics); Artificial intelligence; Texture (cosmology)","score_opus":0.019312706629056722,"score_gpt":0.29010561331831514,"score_spread":0.27079290668925843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576704038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010160794,0.0030368087,0.9763307,0.0004511184,0.00027147797,0.00008473144,0.00019400065,0.0024603968,0.0070098946],"genre_scores_gemma":[0.10017294,0.004379104,0.8581646,0.000880292,0.00051079475,0.00014796025,0.00212425,0.0006234432,0.032996614],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838436,0.00036638888,0.00012466693,0.00035735546,0.0005531453,0.00021407768],"domain_scores_gemma":[0.99765825,0.0005309032,0.00009162545,0.00060771813,0.0010108743,0.0001006805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028753101,0.0012007407,0.001409116,0.003131784,0.000864056,0.003983566,0.0021193973,0.0017728582,0.008202122],"category_scores_gemma":[0.004762214,0.00072812435,0.0015811439,0.0028285768,0.001108971,0.0064822724,0.0046818824,0.0017200214,0.009371646],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023934265,0.00029166302,0.00084182597,0.0003847836,0.00014266529,0.00024463443,0.00025660926,0.0059339907,0.06600787,0.03479904,0.024592577,0.866265],"study_design_scores_gemma":[0.00007884654,0.0003262095,0.0025552737,0.00014819158,0.00036626385,0.0021411178,0.0011037008,0.62499946,0.17067394,0.0942759,0.10316339,0.0001676966],"about_ca_topic_score_codex":0.0038380108,"about_ca_topic_score_gemma":0.0053973515,"teacher_disagreement_score":0.008202122,"about_ca_system_score_codex":0.0006099985,"about_ca_system_score_gemma":0.0010745924,"threshold_uncertainty_score":0.027438879},"labels":[],"label_agreement":null},{"id":"W1576722195","doi":"10.1007/978-3-540-39867-7_48","title":"A QoS Control Scheme for Voice and Data Services in cdma2000 System","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"CDMA2000; Computer science; Quality of service; Computer network; Network packet; Scheme (mathematics); Scheduling (production processes); Exploit; Data as a service; Service (business); Real-time computing; Distributed computing; Code division multiple access; Computer security","score_opus":0.034057109175474234,"score_gpt":0.2960617537514396,"score_spread":0.2620046445759654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576722195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23732819,0.0018010855,0.74023116,0.0006687736,0.0005598222,0.00045010977,0.00017191956,0.0035368558,0.015252183],"genre_scores_gemma":[0.9278875,0.00025595736,0.063845135,0.0001865825,0.00016682678,0.00009993901,0.00010779521,0.000067944886,0.0073823393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.000090725516,0.00003704016,0.000063493135,0.00013459481,0.00006427988],"domain_scores_gemma":[0.9991135,0.00024872448,0.0000545347,0.00012570064,0.00037235307,0.00008515808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080160296,0.0004029106,0.00034717334,0.0006531,0.00079571025,0.0009445416,0.000870513,0.00060673803,0.002502142],"category_scores_gemma":[0.0013551635,0.00017732194,0.00014982784,0.00035084807,0.00043516507,0.0005430554,0.00045202125,0.00067663303,0.00051356107],"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.0018733616,0.0005081824,0.0015045005,0.00023186037,0.00004769247,0.00044716444,0.00055371714,0.035082523,0.37318593,0.043218836,0.007799736,0.53554636],"study_design_scores_gemma":[0.00025941554,0.00089098397,0.0028643506,0.00006029484,0.00015912078,0.0008231019,0.00014607483,0.8410851,0.123418935,0.010666861,0.019517105,0.000108791755],"about_ca_topic_score_codex":0.0028487362,"about_ca_topic_score_gemma":0.0026886682,"teacher_disagreement_score":0.0028487362,"about_ca_system_score_codex":0.0008793682,"about_ca_system_score_gemma":0.00050979486,"threshold_uncertainty_score":0.008370519},"labels":[],"label_agreement":null},{"id":"W1576760750","doi":"10.1007/978-3-642-12659-8_7","title":"The Implementation of Polarizable and Flexible Models in Molecular Dynamics Simulations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy and Quantum Chemical Studies","field":"Physics and Astronomy","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":"Intramolecular force; Molecular dynamics; Computer science; Polarizability; Charge (physics); Force field (fiction); Field (mathematics); Ab initio; Electrostatics; Energy minimization; Statistical physics; Molecule; Computational chemistry; Physics; Chemistry; Quantum mechanics; Artificial intelligence","score_opus":0.00905310901576182,"score_gpt":0.2756688124301616,"score_spread":0.2666157034143998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576760750","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.07924794,0.0006243509,0.8982457,0.00086915307,0.00030017857,0.00014303254,0.00033951132,0.005015186,0.015214819],"genre_scores_gemma":[0.5759774,0.0007170495,0.41602445,0.00028279482,0.000078580786,0.00040920198,0.00046931213,0.0016317605,0.0044094464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999398,0.00025530133,0.00003211954,0.000047079895,0.00020843864,0.000058970487],"domain_scores_gemma":[0.9983228,0.00086674164,0.00006909667,0.00039587318,0.00023638488,0.000109106884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011123116,0.0006665749,0.00077613845,0.00034111875,0.00079651247,0.0015979009,0.0023845013,0.0015334535,0.0039731055],"category_scores_gemma":[0.0056687766,0.0007693509,0.0006107265,0.00079645327,0.0007879734,0.0018573321,0.0014324377,0.002098161,0.0009859847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028133922,0.00017849238,0.0007067153,0.0001323057,0.000060324463,0.00012861768,0.00016860748,0.880595,0.00475992,0.053212084,0.002675857,0.057100765],"study_design_scores_gemma":[0.000034729514,0.000019758525,0.000045346176,0.0000073827214,0.0000061090086,0.000008495605,0.000009147403,0.9867513,0.0019534514,0.009671472,0.0014845253,0.000008153182],"about_ca_topic_score_codex":0.0031280853,"about_ca_topic_score_gemma":0.002807326,"teacher_disagreement_score":0.0039731055,"about_ca_system_score_codex":0.00061816786,"about_ca_system_score_gemma":0.0009773262,"threshold_uncertainty_score":0.013291359},"labels":[],"label_agreement":null},{"id":"W1576877349","doi":"10.1007/11556992_3","title":"Time-Based Release of Confidential Information in Hierarchical Settings","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Confidentiality; Computer security","score_opus":0.005998236118238785,"score_gpt":0.21739923651093762,"score_spread":0.21140100039269882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576877349","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.10482962,0.000874462,0.87102056,0.0007541181,0.00023195134,0.00027307984,0.00030058215,0.0014612055,0.020254405],"genre_scores_gemma":[0.9029436,0.0005250206,0.082908906,0.00015799105,0.00019339753,0.00017440082,0.00024411254,0.00022424344,0.012628193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99284923,0.0023805723,0.00054941117,0.000779895,0.0020682295,0.00137257],"domain_scores_gemma":[0.9604034,0.022007268,0.0033176944,0.010926894,0.0016169923,0.0017277345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060346257,0.00095825025,0.0017076221,0.0013502487,0.0012400197,0.003641071,0.0034310124,0.001670324,0.007549745],"category_scores_gemma":[0.02993789,0.0009981138,0.0009263195,0.0019186721,0.0027432877,0.01064353,0.0055775996,0.0027440758,0.0014195193],"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.0027994935,0.00027030805,0.0014944831,0.0003640394,0.00011156845,0.0005180047,0.0011585733,0.17214912,0.014436319,0.6947994,0.008053505,0.10384518],"study_design_scores_gemma":[0.00013441026,0.000445759,0.00062477204,0.000060108494,0.000070256385,0.00056193914,0.00028323263,0.60768056,0.008089181,0.3777201,0.0042359,0.00009366773],"about_ca_topic_score_codex":0.0005919393,"about_ca_topic_score_gemma":0.00049958815,"teacher_disagreement_score":0.007549745,"about_ca_system_score_codex":0.0014811215,"about_ca_system_score_gemma":0.0013859465,"threshold_uncertainty_score":0.031914532},"labels":[],"label_agreement":null},{"id":"W1576896492","doi":"10.1007/978-3-540-85303-9_14","title":"Support of Interviewing Techniques in Physical Access Control Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Biometrics; Computer science; Interrogation; Software deployment; Access control; Interview; Computer security; Focus (optics); Human–computer interaction; Control (management); Artificial intelligence; Multimedia; Software engineering","score_opus":0.03260425272714892,"score_gpt":0.29216966358465857,"score_spread":0.25956541085750967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576896492","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021544782,0.0005273145,0.951962,0.00063247513,0.00007145548,0.00022745827,0.00012442046,0.0021335543,0.022776607],"genre_scores_gemma":[0.3907167,0.00068230456,0.5930983,0.0002732045,0.00010004023,0.0005654972,0.00042753495,0.0002998199,0.013836599],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99409556,0.0045902394,0.00017598316,0.00027622373,0.0006642017,0.00019780471],"domain_scores_gemma":[0.96270674,0.032296743,0.00053154986,0.0027257442,0.0014000614,0.0003390964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004952881,0.00044942208,0.0004841139,0.0006499779,0.0010242196,0.0018049704,0.001871849,0.0009881341,0.010615096],"category_scores_gemma":[0.0230565,0.0003278802,0.00033192005,0.0007024555,0.0007886167,0.0032484974,0.002129053,0.0012855638,0.0028551777],"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.00073234586,0.0003949877,0.0016354246,0.0007585004,0.00003596481,0.0003109436,0.010799506,0.0045806575,0.047519065,0.12019099,0.008971892,0.8040697],"study_design_scores_gemma":[0.00026253794,0.0011358509,0.004575249,0.00080700434,0.00016640862,0.0025259287,0.01029676,0.30435687,0.124458194,0.22468038,0.3265483,0.00018655483],"about_ca_topic_score_codex":0.00036810717,"about_ca_topic_score_gemma":0.00047813318,"teacher_disagreement_score":0.010615096,"about_ca_system_score_codex":0.00043335298,"about_ca_system_score_gemma":0.00074779347,"threshold_uncertainty_score":0.035511076},"labels":[],"label_agreement":null},{"id":"W1576925383","doi":"10.1007/11559573_55","title":"Image Deformation Using Velocity Fields: An Exact Solution","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pixel; Image (mathematics); Deformation (meteorology); Partition (number theory); Mathematics; Vector field; Algorithm; Mathematical analysis; Exact solutions in general relativity; Topology (electrical circuits); Geometry; Computer vision; Computer science; Physics","score_opus":0.02507439322246595,"score_gpt":0.2887119837660861,"score_spread":0.2636375905436201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576925383","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.0043493207,0.0005235472,0.98630226,0.00035909063,0.00021680392,0.00006606618,0.00006851803,0.00020909167,0.007905345],"genre_scores_gemma":[0.25151122,0.002502644,0.6756077,0.0006939439,0.0005975599,0.00032329268,0.0003198939,0.000816704,0.067626975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997638,0.000036067526,0.000014982795,0.00005884076,0.00009931875,0.000027005268],"domain_scores_gemma":[0.99963546,0.00016235557,0.00003745259,0.000050078976,0.00008216543,0.000032487496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048494292,0.0009049347,0.0015261503,0.00089016143,0.0005407631,0.0015425774,0.0013669084,0.0033792323,0.0065942216],"category_scores_gemma":[0.0022138467,0.0010213917,0.0010812691,0.0013134268,0.001393083,0.0022026415,0.0021185412,0.0020265703,0.0015077515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059481063,0.00009385713,0.00032580143,0.00032573123,0.000057072037,0.0002926041,0.00020284725,0.6328902,0.005718138,0.19692625,0.008553646,0.15455441],"study_design_scores_gemma":[0.000014877648,0.000009514234,0.000052944157,0.0000140353495,0.000009014324,0.000072160095,0.000023893588,0.9633114,0.0005213288,0.03317098,0.0027882534,0.000011672812],"about_ca_topic_score_codex":0.0061370595,"about_ca_topic_score_gemma":0.005288335,"teacher_disagreement_score":0.0065942216,"about_ca_system_score_codex":0.00089780753,"about_ca_system_score_gemma":0.0015801559,"threshold_uncertainty_score":0.022059858},"labels":[],"label_agreement":null},{"id":"W157693642","doi":"10.1007/978-3-540-28634-9_28","title":"Realistic Mobility for Mobile Ad Hoc Network Simulation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mobility model; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Wireless ad hoc network; Computer network; Distributed computing; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Routing protocol; Link-state routing protocol; Wireless; Telecommunications","score_opus":0.018211977544636535,"score_gpt":0.26802322593256395,"score_spread":0.2498112483879274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157693642","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.009811739,0.0012000278,0.97142166,0.00042202763,0.00021566277,0.00009049619,0.0002737112,0.0009050211,0.015659539],"genre_scores_gemma":[0.5202558,0.0032139414,0.4527548,0.00024240052,0.00027742577,0.0006449325,0.0012309204,0.0007273416,0.020652417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965763,0.00014423595,0.00001643853,0.000032970107,0.0001240395,0.000024627478],"domain_scores_gemma":[0.9992167,0.00045807383,0.000046489735,0.00011961724,0.000121273355,0.000037865622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043301744,0.00062587316,0.0008526963,0.0004955818,0.0004932534,0.0009074239,0.0016491156,0.0013010628,0.0051919287],"category_scores_gemma":[0.003810727,0.0006505207,0.0004938561,0.0007965132,0.000430585,0.0013923356,0.0011239365,0.001127595,0.0012695452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023189848,0.000025202826,0.00013195278,0.00005987004,0.000015628164,0.000048278267,0.000038920225,0.95171744,0.0010264528,0.030532395,0.0022382194,0.014142366],"study_design_scores_gemma":[0.000005895937,0.0000068948307,0.000021507578,0.0000063734537,0.0000031717202,0.000015639234,0.000004668992,0.9893506,0.00017036585,0.008119391,0.0022920223,0.0000034584948],"about_ca_topic_score_codex":0.00275057,"about_ca_topic_score_gemma":0.0017637812,"teacher_disagreement_score":0.0051919287,"about_ca_system_score_codex":0.000610987,"about_ca_system_score_gemma":0.00039343396,"threshold_uncertainty_score":0.017368734},"labels":[],"label_agreement":null},{"id":"W1576968470","doi":"10.1007/978-3-642-16901-4_14","title":"API Conformance Verification for Java Programs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Alberta","funders":"","keywords":"Computer science; Programming language; Executable; Java; Control flow; Operating system; Concurrency; Conformance testing; Application programming interface; Software engineering","score_opus":0.02692841412498071,"score_gpt":0.2677013130703781,"score_spread":0.24077289894539738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576968470","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.024446469,0.00051134627,0.96036077,0.00020648398,0.00010332684,0.00012116754,0.00009971952,0.008208456,0.0059423363],"genre_scores_gemma":[0.60158354,0.00076845096,0.38312536,0.0002678202,0.00011361524,0.00019050122,0.00072033936,0.0031685107,0.010061871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951207,0.0010572035,0.0003339154,0.0006127887,0.0024432582,0.0004320836],"domain_scores_gemma":[0.99297357,0.0034278727,0.00046002324,0.0018345175,0.0012307069,0.0000733425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823163,0.0008711021,0.00085859746,0.0013021481,0.0007749064,0.0014733942,0.0019867793,0.0011283632,0.004593685],"category_scores_gemma":[0.011043658,0.00095103297,0.0018852026,0.00078116095,0.001329308,0.0024650253,0.0015407673,0.0026580605,0.0011767698],"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.0006349717,0.0003028476,0.0035681243,0.0009153818,0.00017876242,0.0010320457,0.0009318325,0.04559821,0.0942329,0.10188306,0.00955407,0.7411678],"study_design_scores_gemma":[0.00018256961,0.000457389,0.0037549753,0.0004811688,0.0002777643,0.0018050242,0.00023949805,0.5282024,0.225104,0.21233171,0.027000071,0.00016334622],"about_ca_topic_score_codex":0.0024584408,"about_ca_topic_score_gemma":0.0022387933,"teacher_disagreement_score":0.004593685,"about_ca_system_score_codex":0.0007535564,"about_ca_system_score_gemma":0.001100003,"threshold_uncertainty_score":0.015367329},"labels":[],"label_agreement":null},{"id":"W1576985424","doi":"10.1007/978-3-642-18452-9_2","title":"Beyond Standards: Unleashing Accessibility on a Learning Content Management System","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Inclusion (mineral); Archetype; The Internet; Learning Management; Order (exchange); Management science; Knowledge management; Process management; World Wide Web; Engineering","score_opus":0.044647219095305425,"score_gpt":0.2973486111818673,"score_spread":0.25270139208656184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576985424","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.0713638,0.0056196176,0.6045391,0.023043392,0.0033318477,0.0003738602,0.00020314917,0.0091616865,0.28236353],"genre_scores_gemma":[0.5268616,0.008932224,0.23123616,0.005214301,0.0017703979,0.00034195842,0.0008595424,0.0026915509,0.22209226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735415,0.0006436135,0.00018378117,0.00016706837,0.0013706551,0.00028079675],"domain_scores_gemma":[0.9951885,0.001707197,0.00017318346,0.0010459371,0.0014150501,0.00047005937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003411475,0.00037484744,0.00035851082,0.0013829778,0.0015475405,0.0068787793,0.001732195,0.0025500476,0.00759214],"category_scores_gemma":[0.0085531045,0.0004670477,0.00053614704,0.0013762501,0.0020855435,0.012689682,0.003922084,0.003221838,0.0024408405],"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.00012791711,0.0002600942,0.0018179569,0.00026363588,0.000021057598,0.00031175074,0.005859159,0.0019486243,0.0073161516,0.24851477,0.04151271,0.6920462],"study_design_scores_gemma":[0.000038703227,0.0003244595,0.0025818506,0.00064557535,0.00010498007,0.0007625261,0.0019922,0.018390587,0.015226515,0.16245508,0.7973808,0.00009665658],"about_ca_topic_score_codex":0.0060405293,"about_ca_topic_score_gemma":0.005863748,"teacher_disagreement_score":0.00759214,"about_ca_system_score_codex":0.0015263334,"about_ca_system_score_gemma":0.0031109096,"threshold_uncertainty_score":0.025398254},"labels":[],"label_agreement":null},{"id":"W1577028143","doi":"10.1007/978-3-540-87730-1_52","title":"The Relationship between Graph Comprehension and Spatial Imagery: Support for an Integrative Theory of Graph Cognition","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","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":"University of New Brunswick","funders":"","keywords":"Comprehension; Graph; Cognition; Computer science; Program comprehension; Spatial cognition; Cognitive psychology; Psychology; Theoretical computer science; Software; Programming language","score_opus":0.03323191873830789,"score_gpt":0.26299225602358656,"score_spread":0.22976033728527867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577028143","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.58524555,0.0029916624,0.24710906,0.0056311116,0.00014238815,0.00019799003,0.0007563523,0.0006969928,0.15722889],"genre_scores_gemma":[0.96429884,0.0008537898,0.030910145,0.00033088028,0.00008087957,0.00015775098,0.00057331723,0.0001581289,0.0026362734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994037,0.00016288612,0.00003335352,0.00022124239,0.00014075286,0.000038058162],"domain_scores_gemma":[0.963883,0.030071622,0.0025067935,0.0018115797,0.0011671399,0.0005599449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015785084,0.00058153353,0.0004913922,0.0011698026,0.00029581014,0.0032150198,0.0013785699,0.001215744,0.011972441],"category_scores_gemma":[0.02880141,0.00057531206,0.00074289646,0.0013887798,0.0022090098,0.010440301,0.0017081926,0.0023232433,0.0006948907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009432177,0.0010454836,0.057671826,0.0019830847,0.00049041084,0.000568604,0.020716373,0.009927061,0.015090668,0.6610636,0.0085840635,0.22191562],"study_design_scores_gemma":[0.000119411474,0.00021895977,0.050491173,0.00011905398,0.00018301266,0.0005384949,0.0018174549,0.020338533,0.0021689262,0.92087686,0.003076956,0.000051159375],"about_ca_topic_score_codex":0.0013161653,"about_ca_topic_score_gemma":0.001307276,"teacher_disagreement_score":0.011972441,"about_ca_system_score_codex":0.0005573539,"about_ca_system_score_gemma":0.00074730767,"threshold_uncertainty_score":0.04005176},"labels":[],"label_agreement":null},{"id":"W1577063765","doi":"10.1007/11493853_12","title":"Constraint Programming Based Column Generation for Employee Timetabling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Column generation; Mathematical optimization; Solver; Set cover problem; Constraint (computer-aided design); Set (abstract data type); Integer programming; Cover (algebra); Constraint satisfaction; Linear programming; Integer (computer science); Work (physics); Constraint satisfaction problem; Function (biology); Constraint programming; Algorithm; Mathematics; Stochastic programming; Artificial intelligence","score_opus":0.1225710071208142,"score_gpt":0.3584828721173177,"score_spread":0.23591186499650352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577063765","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.0078035137,0.00017604332,0.98378766,0.00012546453,0.00006175926,0.0003150273,0.0006399049,0.0022348063,0.004855806],"genre_scores_gemma":[0.062116068,0.00013388715,0.93251425,0.00013812321,0.0000323753,0.00044914288,0.001239181,0.0003944334,0.002982641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892336,0.00036749645,0.000052203115,0.00015762396,0.00036682552,0.00013250744],"domain_scores_gemma":[0.99745136,0.0017821037,0.00010717184,0.0002446562,0.00034926104,0.000065485096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881122,0.001048325,0.0012007556,0.0012943125,0.00077186275,0.0012932227,0.0024416535,0.0011962975,0.0142639335],"category_scores_gemma":[0.0041842544,0.00096679805,0.0014868964,0.0026388364,0.0005118028,0.0013581314,0.0010142173,0.0020046465,0.0018368232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002186894,0.0003402331,0.00043893573,0.00036319156,0.00006898251,0.00016047206,0.00011245272,0.50435394,0.008673092,0.020208493,0.020831946,0.4442296],"study_design_scores_gemma":[0.000038069622,0.000040199797,0.00011259881,0.000015568754,0.000015909012,0.000032145887,0.000018658504,0.98654467,0.0025585454,0.008120893,0.002487722,0.000015008635],"about_ca_topic_score_codex":0.013462891,"about_ca_topic_score_gemma":0.016448352,"teacher_disagreement_score":0.0142639335,"about_ca_system_score_codex":0.001127812,"about_ca_system_score_gemma":0.002061474,"threshold_uncertainty_score":0.04771757},"labels":[],"label_agreement":null},{"id":"W1577104190","doi":"10.1007/3-540-45075-0_14","title":"Refining Timed MSCs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Refining (metallurgy); Focus (optics); Process (computing); Programming language","score_opus":0.03271706940843839,"score_gpt":0.28072903234959096,"score_spread":0.24801196294115258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577104190","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.0259696,0.00031104666,0.921961,0.00019750638,0.00027523536,0.00018262626,0.00018371543,0.0028329212,0.048086256],"genre_scores_gemma":[0.4546049,0.0010748187,0.46822035,0.00015613147,0.0001622749,0.00020830806,0.0011760985,0.0025037553,0.07189335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988883,0.00017211605,0.00007350063,0.00019967067,0.00055492646,0.00011149184],"domain_scores_gemma":[0.9982508,0.00059747335,0.000076192155,0.00058238074,0.00043151886,0.00006164054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084624346,0.00090443686,0.00055073155,0.0012785388,0.00073433627,0.0016487789,0.0009414976,0.00056939694,0.01730607],"category_scores_gemma":[0.0040335427,0.00074256165,0.001349942,0.0009065558,0.0012284385,0.0025949478,0.0022989232,0.0017212286,0.004318574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027952337,0.00009546533,0.00047621093,0.00032526892,0.00004274265,0.00048245105,0.00090747484,0.03019565,0.06448586,0.6250569,0.005299191,0.27235326],"study_design_scores_gemma":[0.00007539108,0.0001495375,0.00032977393,0.00016760732,0.0001423431,0.0004442751,0.00045410972,0.123356365,0.10639507,0.6568683,0.111561224,0.000055961966],"about_ca_topic_score_codex":0.0018146253,"about_ca_topic_score_gemma":0.0024991527,"teacher_disagreement_score":0.01730607,"about_ca_system_score_codex":0.0009212344,"about_ca_system_score_gemma":0.00090789265,"threshold_uncertainty_score":0.057894528},"labels":[],"label_agreement":null},{"id":"W1577122732","doi":"10.1007/3-540-45486-1_12","title":"The Power of the TSNLP: Lessons from a Diagnostic Evaluation of a Broad-Coverage Parser","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Suite; Parsing; Test suite; Natural language processing; Artificial intelligence; Test (biology); Programming language; Test case; Machine learning","score_opus":0.018868433627276485,"score_gpt":0.2853218196749292,"score_spread":0.26645338604765273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577122732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36915615,0.0039808215,0.4728022,0.036854435,0.0011244363,0.00053828466,0.006170626,0.037469853,0.071903184],"genre_scores_gemma":[0.7659086,0.00082738866,0.21163243,0.0031605025,0.00033744128,0.000115243776,0.0027989342,0.00830852,0.00691086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9776398,0.011904741,0.0011951526,0.0018180436,0.0067666536,0.00067556533],"domain_scores_gemma":[0.7917615,0.17584802,0.0029799615,0.014256816,0.013691171,0.0014625686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019316204,0.0013208123,0.0010419864,0.0029544074,0.0015753516,0.006705353,0.0043596798,0.0035990756,0.008141326],"category_scores_gemma":[0.15913358,0.0010600691,0.00074826967,0.0031884038,0.0047902176,0.017283436,0.0044361884,0.0044805678,0.002743404],"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.0029224497,0.00087943673,0.017406804,0.0016706827,0.00022984971,0.0028557654,0.012644672,0.032021213,0.027592089,0.14581321,0.10794761,0.6480163],"study_design_scores_gemma":[0.0007950081,0.00089225045,0.0064186854,0.00076838676,0.0005833143,0.0037652447,0.0067740544,0.43788216,0.12902527,0.29659516,0.116058655,0.00044194254],"about_ca_topic_score_codex":0.013456218,"about_ca_topic_score_gemma":0.011145002,"teacher_disagreement_score":0.019316204,"about_ca_system_score_codex":0.0035268608,"about_ca_system_score_gemma":0.0042231972,"threshold_uncertainty_score":0.10215509},"labels":[],"label_agreement":null},{"id":"W1577198689","doi":"10.1007/978-3-540-87536-9_86","title":"A Statistical Model for Histogram Refinement","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Histogram; Artificial intelligence; Statistical model; Bernoulli's principle; Spatial analysis; Image (mathematics); Color histogram; Pattern recognition (psychology); Computer vision; Image processing; Data mining; Color image; Mathematics; Statistics","score_opus":0.0364496824678937,"score_gpt":0.2803380005678652,"score_spread":0.24388831809997147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577198689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010453366,0.00014615456,0.9980478,0.00006496755,0.000023085435,0.000017739252,0.000072320014,0.0002461148,0.00033643542],"genre_scores_gemma":[0.23340303,0.0016331379,0.7420206,0.0005011684,0.00043935803,0.00046322285,0.001947457,0.0011835027,0.018408552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984876,0.0004795519,0.000084247775,0.00036673405,0.0004518277,0.00012993057],"domain_scores_gemma":[0.99511635,0.0025804986,0.00037278706,0.0010395643,0.00075468764,0.00013601416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027417098,0.0007984491,0.0015607487,0.0015377012,0.0005877407,0.0015926742,0.004509726,0.0020065724,0.0067083132],"category_scores_gemma":[0.01179152,0.0013101789,0.0019843027,0.0028938747,0.0016360825,0.0036010528,0.0018570209,0.002796663,0.0029991928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001410208,0.00009492697,0.001091493,0.00019697237,0.00011130159,0.00013224527,0.00015260438,0.5177872,0.0062891496,0.26970488,0.0065548,0.19774331],"study_design_scores_gemma":[0.000008182379,0.000015804062,0.00020706453,0.000008956938,0.000014689006,0.000047382742,0.0000056895765,0.94537264,0.00059085444,0.052393105,0.0013175543,0.000018039049],"about_ca_topic_score_codex":0.009673354,"about_ca_topic_score_gemma":0.008475824,"teacher_disagreement_score":0.009673354,"about_ca_system_score_codex":0.0012110723,"about_ca_system_score_gemma":0.0012431288,"threshold_uncertainty_score":0.022441566},"labels":[],"label_agreement":null},{"id":"W1577221574","doi":"10.1007/978-3-540-45209-6_142","title":"Support for Personal and Service Mobility in Ubiquitous Computing Environments","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bluetooth and Wireless Communication Technologies","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 Ottawa","funders":"","keywords":"Computer science; Service discovery; Bluetooth; Ubiquitous computing; Personal mobility; Computer network; Session (web analytics); Service (business); Quality of service; Personal area network; Software architecture; Wireless; Software; World Wide Web; Human–computer interaction; Web service; Telecommunications; Operating system","score_opus":0.020451137095771357,"score_gpt":0.24600124701806297,"score_spread":0.22555010992229163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577221574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102974,0.005225089,0.7621088,0.0029116927,0.0006139521,0.00010710874,0.00013343825,0.00390056,0.12202536],"genre_scores_gemma":[0.86894965,0.0024617794,0.08992565,0.00036455103,0.00046641997,0.00011300266,0.00019024071,0.0002511345,0.037277505],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996228,0.000074429525,0.000028963117,0.000042579562,0.00014648422,0.00008473176],"domain_scores_gemma":[0.99924123,0.00024585956,0.00006314732,0.00021975706,0.00013898102,0.000091007096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395233,0.00034940394,0.00035698104,0.00030129898,0.0005166602,0.0014172333,0.0009935432,0.0011154409,0.0050158594],"category_scores_gemma":[0.0023457555,0.00028652253,0.00029283378,0.00047508153,0.00044866488,0.0025800404,0.0019009192,0.0010187493,0.0017935759],"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.00028814768,0.00014278895,0.0023328548,0.00045434962,0.000043617874,0.00070871453,0.003079514,0.0068560434,0.077605,0.28497714,0.01748224,0.60602957],"study_design_scores_gemma":[0.00012529451,0.00063623005,0.004725282,0.00047170083,0.00022926289,0.0055580763,0.001761687,0.122185744,0.056474756,0.20968927,0.5979991,0.00014357101],"about_ca_topic_score_codex":0.0003390866,"about_ca_topic_score_gemma":0.0005336427,"teacher_disagreement_score":0.0050158594,"about_ca_system_score_codex":0.00016462816,"about_ca_system_score_gemma":0.00022842476,"threshold_uncertainty_score":0.016779661},"labels":[],"label_agreement":null},{"id":"W1577290713","doi":"10.1007/bfb0038197","title":"Face traverses and a volume algorithm for polyhedra","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Polyhedron; Traverse; Volume (thermodynamics); Face (sociological concept); Algorithm; Computation; Computer science; Geometry; Combinatorics; Mathematics; Geology; Physics","score_opus":0.012855334095978856,"score_gpt":0.2363724245625477,"score_spread":0.22351709046656884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577290713","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.003052112,0.0001309137,0.99121654,0.00005791172,0.00007442185,0.000046108635,0.000058594145,0.0011894109,0.004173971],"genre_scores_gemma":[0.046247933,0.00022151587,0.94421464,0.00006487974,0.00007006161,0.0001227925,0.00034603124,0.0009857899,0.0077264113],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999212,0.000103621045,0.000034668774,0.00012487349,0.000451815,0.00007302085],"domain_scores_gemma":[0.99928635,0.00029046639,0.000026696252,0.0001698754,0.00018527778,0.000041352298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047434215,0.00080122956,0.001091894,0.0014244547,0.0009563294,0.0018530126,0.002329014,0.0010631356,0.013194102],"category_scores_gemma":[0.0025530949,0.00076110935,0.001364217,0.0016926386,0.0012327337,0.0019572936,0.0022646163,0.0022829073,0.0029700159],"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.00024594966,0.0001075272,0.00038901548,0.00021529131,0.000051620165,0.00013554317,0.00023673633,0.096736096,0.011779306,0.2098066,0.014536838,0.6657595],"study_design_scores_gemma":[0.000066681394,0.00009343796,0.00023301052,0.000045143242,0.000028232684,0.0002569028,0.00007769318,0.81157255,0.0092349425,0.14176172,0.036594305,0.000035346802],"about_ca_topic_score_codex":0.0031239232,"about_ca_topic_score_gemma":0.0048625995,"teacher_disagreement_score":0.013194102,"about_ca_system_score_codex":0.00072330254,"about_ca_system_score_gemma":0.0008614057,"threshold_uncertainty_score":0.04413873},"labels":[],"label_agreement":null},{"id":"W15772922","doi":"10.1007/978-3-319-08016-1_1","title":"Broadcast Problem in Hypercube of Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Hypercube; Vertex (graph theory); Broadcasting (networking); Time complexity; Tree (set theory); Theoretical computer science; Node (physics); Spanning tree; K-ary tree; Graph; Discrete mathematics; Binary tree; Combinatorics; Algorithm; Computer network; Tree structure; Mathematics; Parallel computing","score_opus":0.014625453950197983,"score_gpt":0.22499183869136916,"score_spread":0.21036638474117117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15772922","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.29667807,0.0121944295,0.5476876,0.009305223,0.0011490571,0.00035769423,0.0022296784,0.0008627796,0.12953545],"genre_scores_gemma":[0.81776166,0.007966996,0.10972858,0.0006667116,0.0010895904,0.0004184318,0.002223099,0.00033512714,0.059809715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995259,0.00016784159,0.000024232206,0.00009201899,0.00009827521,0.000091814574],"domain_scores_gemma":[0.9987205,0.00089039083,0.00008625278,0.000086727305,0.00011324757,0.00010291208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610848,0.00037920088,0.0011134403,0.0006085226,0.0010288085,0.0020205546,0.0011889996,0.0014978031,0.0054220245],"category_scores_gemma":[0.0028293908,0.00041558192,0.0004622754,0.0014297924,0.00080647506,0.0030201052,0.0011522416,0.001692541,0.00056889706],"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.0007896114,0.00016699256,0.0006467131,0.001610064,0.000097627235,0.000410108,0.0006047828,0.21914579,0.0068630218,0.61763287,0.054515153,0.09751727],"study_design_scores_gemma":[0.00016791305,0.00008226998,0.00041504143,0.000117708834,0.000039956856,0.00025585937,0.0004167354,0.31276298,0.002694855,0.6676077,0.015411762,0.000027185524],"about_ca_topic_score_codex":0.0018732081,"about_ca_topic_score_gemma":0.0012844818,"teacher_disagreement_score":0.0054220245,"about_ca_system_score_codex":0.0012859373,"about_ca_system_score_gemma":0.0007633167,"threshold_uncertainty_score":0.018138468},"labels":[],"label_agreement":null},{"id":"W1577356920","doi":"10.1007/978-3-540-73545-8_38","title":"An Improved Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Competitive analysis; Cluster analysis; Computer science; Partition (number theory); Online algorithm; Dimension (graph theory); Upper and lower bounds; Algorithm; Randomized algorithm; Sequence (biology); Unit (ring theory); Combinatorics; Mathematics; Artificial intelligence","score_opus":0.04442696935424467,"score_gpt":0.3146518800575907,"score_spread":0.27022491070334603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577356920","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.0047022686,0.00021042603,0.9885882,0.00012786328,0.00021294504,0.00014935734,0.00019131937,0.0029996822,0.0028179085],"genre_scores_gemma":[0.032201797,0.00010056554,0.95914584,0.00011811957,0.00009334247,0.0002714229,0.0005740491,0.00041952214,0.0070752213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820876,0.0003518402,0.00011593687,0.00042740515,0.0006546615,0.00024132851],"domain_scores_gemma":[0.99792993,0.00057356065,0.00009465498,0.00064891245,0.0006108544,0.00014205535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013991245,0.0017147706,0.0029275587,0.0022737137,0.0019183935,0.0020772645,0.005533118,0.0026209634,0.017262958],"category_scores_gemma":[0.0051686727,0.00094490714,0.001572216,0.0044882633,0.0008610693,0.003122207,0.0041727345,0.0023024105,0.0075187106],"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.00059740775,0.00030891586,0.00045909977,0.00019205337,0.00008763025,0.00008435714,0.00014384477,0.12913162,0.006050168,0.02076457,0.024660883,0.81751937],"study_design_scores_gemma":[0.00010919886,0.00007247201,0.00023404806,0.0000144710175,0.000033354372,0.00009687723,0.000046518475,0.9738338,0.0032664915,0.015600451,0.00666471,0.000027625545],"about_ca_topic_score_codex":0.008805747,"about_ca_topic_score_gemma":0.012624195,"teacher_disagreement_score":0.017262958,"about_ca_system_score_codex":0.0019306935,"about_ca_system_score_gemma":0.0030247907,"threshold_uncertainty_score":0.057750344},"labels":[],"label_agreement":null},{"id":"W1577418030","doi":"10.1007/11533719_58","title":"Generating Combinations by Prefix Shifts","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Victoria","funders":"","keywords":"Prefix; Gray code; Computer science; Simple (philosophy); Algorithm; Code (set theory); String (physics); Combinatorics; Discrete mathematics; Arithmetic; Mathematics; Set (abstract data type); Programming language","score_opus":0.013827903776525437,"score_gpt":0.2439113502292458,"score_spread":0.23008344645272036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577418030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07056472,0.00047403225,0.86527413,0.0003824232,0.00046696482,0.00022920012,0.0004326601,0.0026554484,0.059520304],"genre_scores_gemma":[0.3808615,0.0006431002,0.5830444,0.00031738757,0.00025954173,0.0003716434,0.0012024929,0.0018763945,0.031423606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887806,0.0002286945,0.000071224946,0.0002529894,0.0004421565,0.00012686264],"domain_scores_gemma":[0.99866843,0.0006702347,0.000059927377,0.00038156094,0.00015669464,0.000063215215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067554566,0.00092263764,0.00095678377,0.0014568064,0.0010336998,0.0013767869,0.0010870482,0.00091408007,0.018175578],"category_scores_gemma":[0.0027178067,0.00083277945,0.0011782848,0.0018221117,0.0013543261,0.002788934,0.0034534892,0.0017152285,0.0056087603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041366587,0.00013166523,0.0007320375,0.00037835026,0.0000664071,0.00077808613,0.0006973336,0.009312184,0.03385447,0.37443513,0.014541291,0.56465936],"study_design_scores_gemma":[0.000087341476,0.00023713363,0.00033791413,0.00012142712,0.00012716814,0.001471916,0.0002480096,0.08532166,0.054491423,0.794165,0.063323304,0.00006767221],"about_ca_topic_score_codex":0.00013637636,"about_ca_topic_score_gemma":0.00029594556,"teacher_disagreement_score":0.018175578,"about_ca_system_score_codex":0.00035003724,"about_ca_system_score_gemma":0.00031737168,"threshold_uncertainty_score":0.060803354},"labels":[],"label_agreement":null},{"id":"W1577419414","doi":"10.1007/978-3-540-27821-4_17","title":"Convergence Issues in Competitive Games","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":109,"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":"Submodular set function; Nash equilibrium; Computer science; Convergence (economics); Mathematical economics; Outcome (game theory); Shapley value; Best response; Function (biology); Mathematical optimization; Graph; Game theory; Mathematics; Theoretical computer science; Economics","score_opus":0.04630530986479416,"score_gpt":0.3445192531479084,"score_spread":0.29821394328311424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577419414","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.054230273,0.009382865,0.3439991,0.007747493,0.0008084522,0.00013227305,0.0001376052,0.00017186746,0.58339],"genre_scores_gemma":[0.82773244,0.007048011,0.0535215,0.0014309202,0.0017261371,0.00070933066,0.00026312325,0.00039447646,0.10717416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974541,0.0013164772,0.000103284685,0.00027466935,0.0005876798,0.00026373158],"domain_scores_gemma":[0.9877145,0.009305862,0.00033728353,0.0005255062,0.0014708699,0.0006459674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040022964,0.0012513013,0.0018166716,0.0020465234,0.0027094833,0.0047976915,0.0025414906,0.003229714,0.013321958],"category_scores_gemma":[0.019157266,0.0007964813,0.0013223755,0.0027646217,0.0047988,0.00897286,0.0031852468,0.006725566,0.0018106926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020466923,0.000018062236,0.0000612408,0.00004293532,0.0000071151658,0.000023136392,0.00014759686,0.001980016,0.00008638915,0.9899014,0.002431424,0.0052801627],"study_design_scores_gemma":[0.000010865087,0.000009903459,0.00004812755,0.00002254108,0.000005073782,0.000035306533,0.00006500384,0.0072233654,0.00005588125,0.9900699,0.002449431,0.000004628489],"about_ca_topic_score_codex":0.0014889189,"about_ca_topic_score_gemma":0.00086112425,"teacher_disagreement_score":0.013321958,"about_ca_system_score_codex":0.0026287592,"about_ca_system_score_gemma":0.0014615825,"threshold_uncertainty_score":0.044566393},"labels":[],"label_agreement":null},{"id":"W1577423246","doi":"10.1007/11596370_4","title":"Database and Information Retrieval Techniques for XML","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Toronto","funders":"","keywords":"Computer science; Viewpoints; Information retrieval; XML; XML database; Focus (optics); XML Schema Editor; Variety (cybernetics); Relational database; Efficient XML Interchange; Document Structure Description; Human–computer information retrieval; Database; Data retrieval; World Wide Web; Search engine; Artificial intelligence","score_opus":0.01337730080614261,"score_gpt":0.25478786221655575,"score_spread":0.24141056141041314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577423246","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.0029165754,0.03733307,0.93029666,0.0018495502,0.00085875107,0.0001332179,0.00053979806,0.003002577,0.023069832],"genre_scores_gemma":[0.040626608,0.032577127,0.8763978,0.0010809302,0.0015334529,0.00024025058,0.0023534917,0.000789209,0.04440115],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979347,0.00046545823,0.0002689961,0.00025355106,0.000970611,0.00010666325],"domain_scores_gemma":[0.99867177,0.0005681147,0.00006577716,0.00041478706,0.00024750878,0.000032054108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020860904,0.00092525664,0.0013406441,0.004743475,0.001093233,0.0045495224,0.0027825043,0.0014140031,0.014846698],"category_scores_gemma":[0.004859905,0.0008927601,0.001599845,0.007928961,0.0014740258,0.008741999,0.001865916,0.0026233154,0.009060777],"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.000090428366,0.00007552072,0.00036890252,0.0012275332,0.00009477633,0.00031566122,0.0006089594,0.0030400718,0.0073245647,0.32432657,0.06266078,0.5998662],"study_design_scores_gemma":[0.00007961972,0.00009926966,0.0008184239,0.0005413841,0.00017653982,0.0025919622,0.0004076823,0.04137905,0.013752152,0.48078865,0.45926693,0.0000983056],"about_ca_topic_score_codex":0.0014874033,"about_ca_topic_score_gemma":0.0016186469,"teacher_disagreement_score":0.014846698,"about_ca_system_score_codex":0.0010343253,"about_ca_system_score_gemma":0.0007273379,"threshold_uncertainty_score":0.04966718},"labels":[],"label_agreement":null},{"id":"W157747340","doi":"10.1007/978-3-642-31522-0_40","title":"Enhancing Audio Description: A Value Added Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Revenue; Incentive; Product (mathematics); Commission; Production (economics); Value (mathematics); Multimedia; Telecommunications; Advertising; Business","score_opus":0.049641060100379754,"score_gpt":0.23651605471555162,"score_spread":0.18687499461517187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157747340","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.022517558,0.0012080166,0.849583,0.0018980834,0.00032182242,0.00035134426,0.00056528155,0.003817383,0.11973756],"genre_scores_gemma":[0.4440712,0.0028007403,0.4247353,0.00072818215,0.00037776187,0.0003208057,0.0016716315,0.0014590675,0.12383534],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982297,0.0003303824,0.00006184709,0.00014745138,0.0010961802,0.00013446296],"domain_scores_gemma":[0.99685055,0.0011406754,0.0001452819,0.00065328204,0.0010374276,0.00017272853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011513628,0.0010069425,0.00043705082,0.0018907135,0.0005673089,0.0041136313,0.0028444836,0.0011964052,0.022528015],"category_scores_gemma":[0.0044933944,0.00045955423,0.0005984939,0.0016143927,0.00084191887,0.0061363005,0.004047001,0.0010619108,0.0047349264],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045273534,0.0005841084,0.0009985586,0.00075320905,0.000056735902,0.00049479306,0.0011588162,0.008378425,0.050976407,0.08266055,0.017005363,0.8364802],"study_design_scores_gemma":[0.00017187036,0.00041326415,0.0017585094,0.00059083564,0.00038636863,0.002082693,0.0037543536,0.19124135,0.18659301,0.12843306,0.48437372,0.0002008911],"about_ca_topic_score_codex":0.0016161527,"about_ca_topic_score_gemma":0.0021475244,"teacher_disagreement_score":0.022528015,"about_ca_system_score_codex":0.0010494861,"about_ca_system_score_gemma":0.001161056,"threshold_uncertainty_score":0.075363755},"labels":[],"label_agreement":null},{"id":"W1577487455","doi":"10.1007/978-3-540-72990-7_73","title":"Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Quality of service; Time division multiple access; Schedule; File transfer; Frame (networking); Transfer (computing)","score_opus":0.059683573086619625,"score_gpt":0.32025947677863353,"score_spread":0.2605759036920139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577487455","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.03789709,0.006440123,0.92747736,0.0010500862,0.00071090955,0.00013884972,0.00021804478,0.0019751932,0.024092354],"genre_scores_gemma":[0.7852161,0.005918299,0.19290419,0.00027175664,0.00063767843,0.00014359763,0.0004800833,0.0002860452,0.0141422795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.000083373765,0.000027921573,0.00006612021,0.0002704532,0.000091098154],"domain_scores_gemma":[0.9993875,0.00023141314,0.000052415988,0.00011272229,0.00017111521,0.000044865847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086024875,0.00041983495,0.00042909043,0.0007362577,0.00060841127,0.0014713928,0.0015027906,0.00062105176,0.0035722486],"category_scores_gemma":[0.0019683319,0.00032779423,0.00023874489,0.0010645868,0.0003299916,0.0015793121,0.0008302104,0.000982445,0.00077002676],"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.00029056947,0.0001648231,0.0010153116,0.0004536969,0.000059799415,0.000254461,0.00026385067,0.1206407,0.049806077,0.08972598,0.023284197,0.7140406],"study_design_scores_gemma":[0.00002177082,0.0001281688,0.0010615353,0.00008454363,0.000037334976,0.0006158143,0.00009351346,0.88606215,0.012768842,0.048508503,0.05057942,0.000038357066],"about_ca_topic_score_codex":0.00094946136,"about_ca_topic_score_gemma":0.0013572599,"teacher_disagreement_score":0.0035722486,"about_ca_system_score_codex":0.0010614733,"about_ca_system_score_gemma":0.000437309,"threshold_uncertainty_score":0.011950374},"labels":[],"label_agreement":null},{"id":"W1577489686","doi":"10.1007/978-3-540-77404-4_4","title":"The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Autocorrelation; Complementary sequences; Sequence (biology); Pseudorandom binary sequence; Legendre polynomials; Binary number; Mathematics; Periodic sequence; Product (mathematics); Combinatorics; Statistics; Mathematical analysis; Arithmetic; Chemistry","score_opus":0.023019069819535592,"score_gpt":0.2633508461847912,"score_spread":0.24033177636525563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577489686","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.5706676,0.004704751,0.24503908,0.0019298226,0.0013818593,0.00011528526,0.0005561516,0.0008579938,0.17474745],"genre_scores_gemma":[0.9315258,0.00087926467,0.037880536,0.00030770895,0.0004028136,0.00007015148,0.00023891559,0.00015895914,0.028535794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998066,0.00004113015,0.000013276284,0.00003693372,0.000061687875,0.00004043198],"domain_scores_gemma":[0.99929535,0.00030959508,0.00010795399,0.00011367946,0.00008421123,0.00008917563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035880227,0.00048676392,0.0004794919,0.0013216989,0.0006860907,0.0013475323,0.0004909872,0.0010966642,0.0058896784],"category_scores_gemma":[0.0027651202,0.00029038612,0.00026034203,0.0007702532,0.0012765779,0.0011045292,0.0007768535,0.0008856922,0.00095608574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022093124,0.000021194708,0.00033314415,0.00013301012,0.0000075254393,0.0004970901,0.00019156381,0.0045903027,0.016437698,0.9422797,0.0028481975,0.03243972],"study_design_scores_gemma":[0.00004949257,0.00011465807,0.0010384026,0.00009645513,0.000019252413,0.0012148009,0.0001079371,0.029525103,0.008810889,0.940755,0.018206846,0.00006121193],"about_ca_topic_score_codex":0.00046789012,"about_ca_topic_score_gemma":0.00047953712,"teacher_disagreement_score":0.0058896784,"about_ca_system_score_codex":0.0006303272,"about_ca_system_score_gemma":0.0006159883,"threshold_uncertainty_score":0.019702971},"labels":[],"label_agreement":null},{"id":"W1577506113","doi":"10.1007/978-3-540-68880-8_6","title":"New Upper Bounds on Continuous Tree Edge-Partition Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; University of Lethbridge","funders":"","keywords":"Partition (number theory); Combinatorics; Tree (set theory); Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.019245519122859895,"score_gpt":0.2659052201453175,"score_spread":0.24665970102245757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577506113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03406784,0.02698122,0.7765784,0.011884622,0.0038100944,0.00051678973,0.003378461,0.0024295456,0.14035301],"genre_scores_gemma":[0.36356494,0.02325006,0.5246913,0.006158402,0.010324789,0.0025008887,0.008344537,0.0038973966,0.057267677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927618,0.0016125287,0.0002630179,0.0013781611,0.0026460986,0.0013383736],"domain_scores_gemma":[0.9606264,0.029597586,0.0011522663,0.0034202668,0.0023720614,0.0028313259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007071384,0.005059019,0.005279716,0.0058300775,0.0035100852,0.010964474,0.015607946,0.0059709265,0.03528636],"category_scores_gemma":[0.04158605,0.0022895497,0.0036111923,0.012116316,0.004806225,0.025239361,0.010190025,0.02137154,0.0060895626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00121511,0.001039931,0.0014526632,0.0022103305,0.00023783163,0.000256253,0.0006026766,0.10364741,0.0046892636,0.5871701,0.12459845,0.17288001],"study_design_scores_gemma":[0.00014934788,0.00015866644,0.0008158185,0.00042549145,0.0002249975,0.00032157224,0.0002028268,0.30422136,0.0019462768,0.6678003,0.023647208,0.00008622631],"about_ca_topic_score_codex":0.0025598125,"about_ca_topic_score_gemma":0.003394442,"teacher_disagreement_score":0.03528636,"about_ca_system_score_codex":0.006414008,"about_ca_system_score_gemma":0.0033367896,"threshold_uncertainty_score":0.118044674},"labels":[],"label_agreement":null},{"id":"W1577547142","doi":"10.1007/11430919_86","title":"The TIMERS II Algorithm for the Discovery of Causality","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Causality (physics); Computer science; Algorithm; Artificial intelligence; Data mining; Theoretical computer science","score_opus":0.08055751605725435,"score_gpt":0.3605419344042727,"score_spread":0.2799844183470183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577547142","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.0014886615,0.00022822832,0.995194,0.00019287388,0.000111379915,0.00012098688,0.0001461885,0.0014489779,0.0010686758],"genre_scores_gemma":[0.035904206,0.00025191126,0.9591157,0.00017578059,0.00018174812,0.00055745104,0.0006564154,0.00042842602,0.0027284161],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515224,0.002347127,0.00048352123,0.00070243515,0.0010662904,0.0002483479],"domain_scores_gemma":[0.9793193,0.0150027275,0.0007156688,0.0027150437,0.0017197612,0.0005275139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0091990335,0.0015358515,0.0025198164,0.004331171,0.0014873687,0.0037863837,0.004495086,0.0020920169,0.01832262],"category_scores_gemma":[0.04328125,0.0013966424,0.0024195288,0.0033366152,0.0017632489,0.0046289186,0.0037733046,0.0053083994,0.006017244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010908042,0.00023904341,0.0027995824,0.0004751086,0.0003264125,0.00021019817,0.00027884866,0.06688188,0.0032837999,0.21559437,0.023966633,0.6848533],"study_design_scores_gemma":[0.00038393927,0.00014179699,0.00040102945,0.00009826215,0.00009557705,0.00023349204,0.000072143215,0.71813536,0.0032450352,0.26679698,0.010335843,0.00006065892],"about_ca_topic_score_codex":0.002192753,"about_ca_topic_score_gemma":0.002314372,"teacher_disagreement_score":0.01832262,"about_ca_system_score_codex":0.0010216185,"about_ca_system_score_gemma":0.0048855934,"threshold_uncertainty_score":0.06129527},"labels":[],"label_agreement":null},{"id":"W1577720392","doi":"10.1007/978-3-540-27868-9_109","title":"Recognition of Handwritten Numerals Using a Combined Classifier with Hybrid Features","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Numeral system; Pattern recognition (psychology); Computer science; Classifier (UML); Artificial intelligence; Artificial neural network; Feature extraction; Speech recognition","score_opus":0.024374849944460066,"score_gpt":0.25110632167619323,"score_spread":0.22673147173173316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577720392","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.09683637,0.001991294,0.88073784,0.00021260553,0.00092785124,0.00028396037,0.0007288468,0.008051684,0.010229498],"genre_scores_gemma":[0.2853616,0.0009142571,0.6795975,0.00034519203,0.0004027633,0.0004176527,0.0021619312,0.0003927561,0.03040637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00006600048,0.000058084137,0.00019678903,0.0004011044,0.00008800655],"domain_scores_gemma":[0.99885535,0.00033020033,0.00004382254,0.00011983884,0.00057439925,0.000076330405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006816254,0.0009605935,0.0014728388,0.0017874499,0.00039720628,0.0014990731,0.0010869422,0.0013066181,0.005616291],"category_scores_gemma":[0.0010212307,0.00058204867,0.000889487,0.0013927991,0.00022498755,0.0018455127,0.00085775275,0.0008259452,0.0058729476],"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.00047539262,0.00024803542,0.0017759778,0.00015300165,0.00015318838,0.0001249367,0.000037061553,0.0029781044,0.17436254,0.00035782816,0.0048216847,0.81451225],"study_design_scores_gemma":[0.00015158932,0.0012546444,0.017624201,0.00012450575,0.0007283119,0.0016932838,0.00015842095,0.6037599,0.34948748,0.0017944385,0.023017049,0.0002061833],"about_ca_topic_score_codex":0.0012030813,"about_ca_topic_score_gemma":0.0029743637,"teacher_disagreement_score":0.005616291,"about_ca_system_score_codex":0.00028872507,"about_ca_system_score_gemma":0.0005054084,"threshold_uncertainty_score":0.018788338},"labels":[],"label_agreement":null},{"id":"W1577738218","doi":"10.1007/3-540-45535-3_3","title":"Edge Covers of Setpairs and the Iterative Rounding Method","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Computer science; Enhanced Data Rates for GSM Evolution; Iterative method; Algorithm; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.02282914659477234,"score_gpt":0.2737104800340561,"score_spread":0.25088133343928376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577738218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05318736,0.0012109358,0.8989344,0.00039897044,0.0001762033,0.000098965975,0.0002308391,0.00048383855,0.04527844],"genre_scores_gemma":[0.5071747,0.0017404167,0.46395957,0.00020242127,0.0002470896,0.00034238969,0.00055725634,0.0004759085,0.025300218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981219,0.00069097435,0.0000726539,0.00020839715,0.00065981416,0.00024620653],"domain_scores_gemma":[0.9968041,0.0020654858,0.00012967044,0.0006422542,0.0002680451,0.00009042619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135463,0.00076947844,0.0011648578,0.0017250142,0.0014970973,0.002786128,0.0019763883,0.0011844571,0.008930592],"category_scores_gemma":[0.0066248723,0.00078081083,0.0013015486,0.0023312066,0.0016051992,0.004086478,0.0031983047,0.003286274,0.0013514007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024299056,0.000060392395,0.00035560888,0.00020065036,0.000042505177,0.00010930604,0.00022276748,0.1083696,0.0028367015,0.7668904,0.0054246304,0.11524427],"study_design_scores_gemma":[0.000026227444,0.000047291236,0.00019743975,0.000050128543,0.00003062596,0.00014284489,0.00008019822,0.22762388,0.0030538905,0.7608172,0.007899979,0.000030337824],"about_ca_topic_score_codex":0.0014225717,"about_ca_topic_score_gemma":0.0015231748,"teacher_disagreement_score":0.008930592,"about_ca_system_score_codex":0.0011107494,"about_ca_system_score_gemma":0.00063449907,"threshold_uncertainty_score":0.029875815},"labels":[],"label_agreement":null},{"id":"W1577752457","doi":"10.1007/978-3-642-15470-6_38","title":"Enhanced Intra Coding of H.264/AVC Advanced Video Coding Standard with Adaptive Number of Modes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Coding and Compression Technologies","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 Windsor","funders":"","keywords":"Computer science; Encoder; Coding (social sciences); Coding tree unit; Pixel; Context-adaptive variable-length coding; Algorithmic efficiency; Bit rate; Algorithm; Computation; Scalable Video Coding; Context-adaptive binary arithmetic coding; Real-time computing; Decoding methods; Artificial intelligence; Data compression; Mathematics; Motion compensation; Statistics","score_opus":0.01425627476502804,"score_gpt":0.25361547284505837,"score_spread":0.2393591980800303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577752457","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.09741264,0.0039139725,0.84072757,0.00049545686,0.0005744682,0.00016179038,0.0012492264,0.0028226206,0.05264231],"genre_scores_gemma":[0.37232333,0.0030618394,0.52171147,0.0004251233,0.00031638643,0.00016451586,0.0035195677,0.0005684052,0.09790931],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988544,0.000015269732,0.0000051894913,0.000012584807,0.00006829974,0.00001309513],"domain_scores_gemma":[0.99983025,0.000030192325,0.000009707664,0.000025886335,0.00009809284,0.000005866696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016655207,0.00035564404,0.00019072367,0.00048475133,0.00011306466,0.00026850795,0.0003887674,0.0003632736,0.0036143009],"category_scores_gemma":[0.00038327553,0.00012581602,0.00016430134,0.00027193932,0.00013307962,0.00041325425,0.00022434129,0.0006681494,0.0011037515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038941123,0.000095537864,0.0004394905,0.00023172426,0.000018967936,0.0003250864,0.00009368088,0.01655126,0.46245673,0.0146009205,0.015357959,0.48943907],"study_design_scores_gemma":[0.00009019283,0.00070226676,0.0061420267,0.00018511151,0.000120521574,0.0021864732,0.00008092193,0.46163633,0.42564276,0.012307283,0.09082266,0.00008337775],"about_ca_topic_score_codex":0.0012587563,"about_ca_topic_score_gemma":0.0028692286,"teacher_disagreement_score":0.0036143009,"about_ca_system_score_codex":0.00017249177,"about_ca_system_score_gemma":0.00032542838,"threshold_uncertainty_score":0.012091041},"labels":[],"label_agreement":null},{"id":"W1577759813","doi":"10.1007/3-540-44886-1_59","title":"On the Applicability of L-systems and Iterated Function Systems for Grammatical Synthesis of 3D Models","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Elegance; Complement (music); Representation (politics); Simplicity; Function (biology); Iterated function; Graphics; Process (computing); Computer graphics; Theoretical computer science; Artificial intelligence; Human–computer interaction; Programming language; Computer graphics (images); Mathematics","score_opus":0.023321317334446645,"score_gpt":0.20322603215375207,"score_spread":0.17990471481930542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577759813","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.02676891,0.0016472415,0.9372226,0.00091749796,0.00011369001,0.000047872698,0.00006476972,0.00020802273,0.033009358],"genre_scores_gemma":[0.6410044,0.0022131696,0.34433693,0.00034217504,0.00032908565,0.00022895777,0.0001885082,0.0003767021,0.010980209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904746,0.0004959753,0.00007791645,0.00013781225,0.00017294449,0.0000679026],"domain_scores_gemma":[0.9947714,0.004312707,0.00016386558,0.000440671,0.00023520929,0.00007611828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020875281,0.000580584,0.00087783585,0.0009811331,0.0011894703,0.0020359007,0.0013023955,0.0017578454,0.0056745852],"category_scores_gemma":[0.010188193,0.0007151346,0.0017910601,0.00068699586,0.0034557774,0.0039478773,0.0025604495,0.0022163824,0.00069941115],"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.000021712636,0.000017969123,0.00017811314,0.00006375396,0.000017380862,0.00009070171,0.00033443517,0.050416317,0.0013258918,0.9165666,0.0007588783,0.030208347],"study_design_scores_gemma":[0.000008800021,0.000015042167,0.000067213456,0.000022151246,0.000005869608,0.000031326956,0.000034118755,0.1523215,0.0004785445,0.8454305,0.0015728654,0.00001211161],"about_ca_topic_score_codex":0.002749334,"about_ca_topic_score_gemma":0.0022128187,"teacher_disagreement_score":0.0056745852,"about_ca_system_score_codex":0.0015058847,"about_ca_system_score_gemma":0.0006519032,"threshold_uncertainty_score":0.018983305},"labels":[],"label_agreement":null},{"id":"W1577812203","doi":"10.1007/978-3-540-27859-7_3","title":"Activity Theory as Tool for Analyzing Asynchronous Learning Networks (ALN)","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"Computer science; Asynchronous communication; Grading (engineering); Asynchronous learning; Process (computing); Human–computer interaction; Software engineering; Multimedia; Mathematics education; Computer network; Cooperative learning; Programming language; Teaching method; Synchronous learning","score_opus":0.025135244253924213,"score_gpt":0.3386214878264086,"score_spread":0.3134862435724844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577812203","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.0065206294,0.00022119124,0.9892239,0.000035603087,0.000030549738,0.00006641118,0.0003308538,0.0008985664,0.0026721435],"genre_scores_gemma":[0.20162041,0.00044049625,0.7922105,0.00003570336,0.000061017698,0.0005550408,0.001061518,0.00038655673,0.0036287215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900085,0.00043555125,0.00007601692,0.00018907416,0.00024459965,0.000053977223],"domain_scores_gemma":[0.99533504,0.0036373758,0.00023760494,0.00040777447,0.00029577152,0.00008629873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018300941,0.00078998564,0.00065992214,0.0033410517,0.00052400987,0.0018213365,0.0010337894,0.0006380034,0.005246573],"category_scores_gemma":[0.0064361203,0.00039637848,0.0009532551,0.0034589777,0.00076723134,0.0025251242,0.0009272007,0.0012043449,0.0011425035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015264173,0.00025455919,0.010345878,0.0004874042,0.00016354608,0.0001599426,0.0007975401,0.11825412,0.004617783,0.28279603,0.006383617,0.57558703],"study_design_scores_gemma":[0.000018643621,0.00009006018,0.0030360683,0.00008916745,0.00007920091,0.0001763767,0.00024118832,0.7185075,0.0041463454,0.2578672,0.015717145,0.000031004634],"about_ca_topic_score_codex":0.0017575183,"about_ca_topic_score_gemma":0.0014834286,"teacher_disagreement_score":0.005246573,"about_ca_system_score_codex":0.000552162,"about_ca_system_score_gemma":0.00059268,"threshold_uncertainty_score":0.017551541},"labels":[],"label_agreement":null},{"id":"W1577851669","doi":"10.1007/978-3-642-34106-9_25","title":"Partial Monitoring with Side Information","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":69,"is_retracted":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":"Computer science","score_opus":0.07038242003984675,"score_gpt":0.3665795994389151,"score_spread":0.29619717939906837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577851669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023369879,0.0012228672,0.95128673,0.0005648054,0.00017982005,0.000055678403,0.0002591988,0.0011511073,0.021909816],"genre_scores_gemma":[0.8388509,0.0011130956,0.1309347,0.00037366882,0.00048622445,0.00013840945,0.0004996423,0.00029337185,0.027309956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987142,0.00041164143,0.00006903364,0.0002906278,0.00036165075,0.00015273264],"domain_scores_gemma":[0.9960461,0.001926235,0.00028112845,0.001278021,0.00035143772,0.00011697113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483065,0.0009542878,0.0011563496,0.00049368077,0.00042645924,0.0017771841,0.0009943462,0.00093148416,0.0049832435],"category_scores_gemma":[0.005173446,0.00042459473,0.00045832514,0.00068699295,0.0008754348,0.0028449423,0.0015271817,0.001517557,0.0012889827],"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.0013588119,0.00013080414,0.001814558,0.0004534155,0.0001523722,0.00044106675,0.0001936265,0.12294293,0.023034202,0.35145676,0.017059373,0.48096216],"study_design_scores_gemma":[0.000048037764,0.0001878523,0.0006321073,0.000064351196,0.000085557724,0.0005259472,0.00002466945,0.6662532,0.016456556,0.3063781,0.009312445,0.00003120724],"about_ca_topic_score_codex":0.00027221118,"about_ca_topic_score_gemma":0.00032676302,"teacher_disagreement_score":0.0049832435,"about_ca_system_score_codex":0.0005329654,"about_ca_system_score_gemma":0.0005500378,"threshold_uncertainty_score":0.016670644},"labels":[],"label_agreement":null},{"id":"W1577869871","doi":"10.1007/978-3-642-04346-8_5","title":"wikiSearch – From Access to Use","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diverse Research and Applications","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":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.06337111549590503,"score_gpt":0.3290790664701675,"score_spread":0.2657079509742625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577869871","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010309882,0.0068138707,0.15766385,0.0054516653,0.0030643619,0.00014368218,0.007653548,0.0494923,0.7594068],"genre_scores_gemma":[0.041000526,0.009502623,0.059761256,0.0014125688,0.00088639464,0.00021698244,0.0218985,0.03612612,0.82919496],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989643,0.0001264513,0.00008625449,0.00012801813,0.0005816438,0.00011340817],"domain_scores_gemma":[0.99789894,0.00040859645,0.00005416899,0.0010114711,0.0003603249,0.00026656044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009971965,0.0008233473,0.0007490291,0.0027297568,0.0012301655,0.008385662,0.001591038,0.0013936762,0.053388078],"category_scores_gemma":[0.0040521706,0.0009107938,0.0006881462,0.003519851,0.0013003926,0.025268001,0.008667308,0.0026956366,0.044104602],"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.000096403404,0.00006158524,0.0003773097,0.00058094633,0.000021513562,0.0001387792,0.0017969403,0.0004995434,0.0035813104,0.11347294,0.41014394,0.4692287],"study_design_scores_gemma":[0.000004369798,0.000006464885,0.00016189626,0.00010955869,0.0000045475385,0.00013440846,0.00016724675,0.00026218154,0.0008468309,0.0136835715,0.9846053,0.00001357463],"about_ca_topic_score_codex":0.0033269436,"about_ca_topic_score_gemma":0.0056158677,"teacher_disagreement_score":0.053388078,"about_ca_system_score_codex":0.0007472688,"about_ca_system_score_gemma":0.0017378671,"threshold_uncertainty_score":0.1786009},"labels":[],"label_agreement":null},{"id":"W1577913170","doi":"10.1007/11566465_95","title":"Ligament Strains Predict Knee Motion After Total Joint Replacement","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","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":"Queen's University","funders":"","keywords":"Kinematics; Knee Joint; Ligament; Prosthesis; Posterior cruciate ligament; Joint (building); Computer science; Anterior cruciate ligament; Orthodontics; Anatomy; Medicine; Surgery; Physics; Artificial intelligence; Structural engineering; Engineering","score_opus":0.011526846508643633,"score_gpt":0.25042783741703817,"score_spread":0.23890099090839453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577913170","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.99952483,0.00012908733,0.00006830502,0.000030326617,0.0000095381165,0.0000017613229,0.000044248267,0.0000020804027,0.00018975859],"genre_scores_gemma":[0.9995301,0.000061582774,0.000047629794,0.000011736935,0.00001422224,0.0000020504385,0.00010866072,0.0000012741227,0.00022281235],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997218,0.00005606775,0.000056008426,0.000029490284,0.00006054107,0.000076054515],"domain_scores_gemma":[0.99542,0.0013022167,0.0020799264,0.00014360751,0.00029903447,0.00075530756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059330964,0.00032493484,0.0003496309,0.0005191885,0.00027984896,0.0006313057,0.00033820118,0.00073704607,0.0019421543],"category_scores_gemma":[0.0060196174,0.0002087071,0.0004149584,0.00052136637,0.00029100722,0.0005393611,0.00054357323,0.0006145926,0.00038510826],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008211607,0.00015981933,0.9921669,0.00001549305,0.000057415084,0.00010785243,0.00006332686,0.00021608794,0.00079978665,0.000017589105,0.000080910664,0.005493798],"study_design_scores_gemma":[0.000012132879,0.0005574595,0.99794227,0.00000693966,0.000038655962,0.000328623,0.00013266013,0.0005963766,0.00025119958,0.000040491752,0.0000872514,0.0000060802154],"about_ca_topic_score_codex":0.0016028769,"about_ca_topic_score_gemma":0.0032954877,"teacher_disagreement_score":0.0019421543,"about_ca_system_score_codex":0.00022583088,"about_ca_system_score_gemma":0.0002808837,"threshold_uncertainty_score":0.0064971447},"labels":[],"label_agreement":null},{"id":"W1577995630","doi":"10.1007/11691792_14","title":"A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Theoretical computer science; Automaton; Tree automaton; Fragment (logic); Decidability; Set (abstract data type); Property (philosophy); Model checking; Protocol (science); Communications protocol; Temporal logic; Tree (set theory); Translation (biology); Algorithm; Programming language; Mathematics","score_opus":0.06704504113088224,"score_gpt":0.3596336718118863,"score_spread":0.2925886306810041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577995630","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.0013688225,0.00004652967,0.9946913,0.000066282584,0.000047681533,0.00011899377,0.0001247358,0.0021958507,0.0013398275],"genre_scores_gemma":[0.11032583,0.00017072272,0.8805496,0.00016633654,0.00007898495,0.0005865679,0.00051305036,0.0011589908,0.0064498913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959687,0.0013445036,0.00038899734,0.00077992055,0.0011904266,0.0003275992],"domain_scores_gemma":[0.99189997,0.005698107,0.00025284808,0.0010881496,0.0008890026,0.0001720524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036702435,0.0015313188,0.0018266218,0.0015641564,0.001775318,0.0036564642,0.0032394626,0.001958257,0.013268274],"category_scores_gemma":[0.0110698845,0.001528973,0.0027346003,0.0012930356,0.0032277682,0.005300683,0.0023129454,0.0033383553,0.0035603684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005000031,0.00018529383,0.00074181537,0.0007890019,0.0001923285,0.0006127104,0.0012573937,0.044952266,0.017543813,0.7218541,0.011795075,0.19957623],"study_design_scores_gemma":[0.0002808221,0.00023309093,0.00027141522,0.00021637694,0.0002475808,0.00038258458,0.00021633062,0.36253348,0.030429464,0.56722355,0.03780531,0.00016003706],"about_ca_topic_score_codex":0.0065478766,"about_ca_topic_score_gemma":0.0050667915,"teacher_disagreement_score":0.013268274,"about_ca_system_score_codex":0.0021528075,"about_ca_system_score_gemma":0.0036627564,"threshold_uncertainty_score":0.044386744},"labels":[],"label_agreement":null},{"id":"W1578000835","doi":"10.1007/3-540-46521-9_14","title":"Triangulations without Minimum-Weight Drawing","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Triangulation; Pitteway triangulation; Minimum-weight triangulation; Minimum weight; Point set triangulation; Bowyer–Watson algorithm; Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.01725744111328664,"score_gpt":0.25364691851734766,"score_spread":0.23638947740406102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578000835","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.009298573,0.00039777282,0.94973224,0.00021441338,0.00025394533,0.00011173879,0.00038208012,0.0022863313,0.037322942],"genre_scores_gemma":[0.1288349,0.00075641955,0.8375282,0.00016870872,0.0001363215,0.00017147193,0.0010809974,0.0017387,0.029584302],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992101,0.0001168539,0.00005143742,0.00016280454,0.00038535852,0.00007334622],"domain_scores_gemma":[0.99887437,0.00030942334,0.000061026418,0.0005630868,0.0001385451,0.000053420266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037353503,0.001271373,0.001581046,0.001616917,0.00082546356,0.0020377035,0.0029131393,0.0016550369,0.035108984],"category_scores_gemma":[0.0034736688,0.0015009299,0.0011586087,0.0023049596,0.0008651418,0.0034243471,0.0035529938,0.0029179717,0.008132471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002761899,0.00010222643,0.00026455606,0.0006138917,0.00006703649,0.0001890284,0.00020054054,0.049691837,0.016635992,0.2393994,0.02426431,0.66829497],"study_design_scores_gemma":[0.00012571873,0.00008809604,0.000367167,0.0001627722,0.00006926809,0.0005954988,0.00013634723,0.36569434,0.016276801,0.5456775,0.07075318,0.000053318472],"about_ca_topic_score_codex":0.0008794822,"about_ca_topic_score_gemma":0.0019184767,"teacher_disagreement_score":0.035108984,"about_ca_system_score_codex":0.0005874708,"about_ca_system_score_gemma":0.00040241997,"threshold_uncertainty_score":0.11745125},"labels":[],"label_agreement":null},{"id":"W1578004953","doi":"10.1007/11428831_84","title":"A Cost-Effective Private-Key Cryptosystem for Color Image Encryption","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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 Toronto","funders":"","keywords":"Cryptosystem; Color image; Encryption; RGB color model; Computer science; Secret sharing; Computer vision; Artificial intelligence; Image (mathematics); Key (lock); High color; Color depth; Binary image; Cryptography; Mathematics; Algorithm; Image processing; Computer security","score_opus":0.017624151798138803,"score_gpt":0.2726624774898546,"score_spread":0.2550383256917158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578004953","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.025102222,0.0020474542,0.9518249,0.0007814827,0.00036543133,0.00023110301,0.00015628237,0.0013997637,0.018091384],"genre_scores_gemma":[0.36748934,0.0027009614,0.5830218,0.0003495141,0.0003967908,0.00022996125,0.0003599574,0.0002960706,0.045155704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999595,0.000054915225,0.000016923557,0.000032888212,0.00026065682,0.00003968953],"domain_scores_gemma":[0.99977523,0.00006524984,0.000018729976,0.00007065127,0.000056970624,0.0000131384295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002578156,0.0005446712,0.00047245863,0.00050252397,0.00044545444,0.0008142301,0.0008060303,0.00060388923,0.005912815],"category_scores_gemma":[0.0007047226,0.00026546026,0.00028556204,0.00055358297,0.00044660372,0.0019362891,0.00077338563,0.00091374613,0.0018395878],"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.00058862893,0.00025141097,0.00016758332,0.00036596795,0.00005404471,0.00028865715,0.00008315209,0.023693677,0.17353493,0.22142135,0.018174851,0.56137574],"study_design_scores_gemma":[0.00038759882,0.00073423045,0.00077775645,0.00008989465,0.00014953215,0.0024613645,0.000059884464,0.51661766,0.20331638,0.14713962,0.12815045,0.00011575332],"about_ca_topic_score_codex":0.00032620682,"about_ca_topic_score_gemma":0.00068881875,"teacher_disagreement_score":0.005912815,"about_ca_system_score_codex":0.0004798682,"about_ca_system_score_gemma":0.0006120008,"threshold_uncertainty_score":0.019780338},"labels":[],"label_agreement":null},{"id":"W1578028529","doi":"10.1007/978-3-642-13688-7_5","title":"From State- to Delta-Based Bidirectional Model Transformations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"University of Waterloo","funders":"","keywords":"Computer science; Transformation (genetics); Model transformation; State (computer science); Theoretical computer science; Programming language; Algorithm; Artificial intelligence","score_opus":0.014344859371036018,"score_gpt":0.23792028584789998,"score_spread":0.22357542647686396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578028529","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.0051242625,0.00011816534,0.98457426,0.00014425903,0.00006826817,0.000037448634,0.00012658781,0.0021320838,0.0076746633],"genre_scores_gemma":[0.37395945,0.00083789043,0.60530573,0.00027718383,0.00006084123,0.00025097738,0.00097377726,0.0022873401,0.016046852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902785,0.00023470446,0.00008585652,0.00018602062,0.00036479227,0.0001007993],"domain_scores_gemma":[0.99836856,0.000434615,0.00006743583,0.0008497886,0.00023205012,0.000047498914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010783739,0.00073532824,0.0004992799,0.0007862834,0.00055551436,0.0016819423,0.001286763,0.00080377184,0.0076119187],"category_scores_gemma":[0.00392885,0.0006319944,0.0011879897,0.0010200489,0.0014878248,0.0041147238,0.0036765502,0.0024216566,0.0020844333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013415754,0.00006697889,0.00027763133,0.00021352903,0.000036468966,0.00018641891,0.00041166844,0.036514767,0.0064858305,0.752385,0.003827173,0.19946034],"study_design_scores_gemma":[0.000026595855,0.000031402735,0.0000776974,0.000065599204,0.000044621902,0.000109823435,0.00008202764,0.15598243,0.016978128,0.8022742,0.024305442,0.000022085798],"about_ca_topic_score_codex":0.0015943424,"about_ca_topic_score_gemma":0.0020774049,"teacher_disagreement_score":0.0076119187,"about_ca_system_score_codex":0.0007462615,"about_ca_system_score_gemma":0.001085739,"threshold_uncertainty_score":0.025464416},"labels":[],"label_agreement":null},{"id":"W1578134569","doi":"10.1007/3-540-44886-1_53","title":"Probabilistic Reasoning for Meal Planning in Intelligent Fridges","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Probabilistic logic; Preference; Plan (archaeology); Representation (politics); Artificial intelligence; Operations research; Space (punctuation); Bayesian network; Microeconomics; Mathematics; Economics","score_opus":0.042097388539681736,"score_gpt":0.2845913898915125,"score_spread":0.24249400135183077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578134569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008602793,0.0006553004,0.9756284,0.00065939146,0.000056899527,0.000061227765,0.0003652045,0.00061693776,0.013353875],"genre_scores_gemma":[0.3390014,0.0009541619,0.64862293,0.00015429969,0.00010332296,0.00016479765,0.0010890898,0.0002315235,0.009678513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987972,0.00045571142,0.00011552419,0.00025805796,0.00024918554,0.00012433063],"domain_scores_gemma":[0.9979342,0.001471665,0.000106347914,0.00024422925,0.0001607649,0.000082791776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019647016,0.00075698266,0.0011102981,0.0013409103,0.0015222563,0.0037638345,0.0035915868,0.0018235849,0.01536822],"category_scores_gemma":[0.0072675576,0.0013816627,0.002375472,0.0015195141,0.002011973,0.0068737473,0.002026008,0.002474381,0.001405379],"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.0002154612,0.00010060925,0.0008883356,0.00029991896,0.00009550943,0.0002644352,0.00067095127,0.23274083,0.00096472073,0.6728151,0.0060940543,0.08485012],"study_design_scores_gemma":[0.00003451536,0.000013237785,0.00019492987,0.00004323638,0.000040233495,0.000052368192,0.000115143404,0.38444132,0.00061454426,0.60951227,0.0049114544,0.000026710883],"about_ca_topic_score_codex":0.016734539,"about_ca_topic_score_gemma":0.020898543,"teacher_disagreement_score":0.016734539,"about_ca_system_score_codex":0.0022151964,"about_ca_system_score_gemma":0.001498396,"threshold_uncertainty_score":0.051411808},"labels":[],"label_agreement":null},{"id":"W1578162563","doi":"10.1007/978-3-540-73451-2_38","title":"Web-Based Support Systems with Rough Set Analysis","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":65,"is_retracted":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":"Rough set; Computer science; Decision support system; Web application; Set (abstract data type); Focus (optics); Data science; Data mining; Web intelligence; World Wide Web; Web service; Web modeling","score_opus":0.02544276853778077,"score_gpt":0.25326891958608944,"score_spread":0.22782615104830867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578162563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018558158,0.0004937271,0.97369576,0.00018428502,0.000055952718,0.00016069623,0.00016853081,0.0017190044,0.0049638636],"genre_scores_gemma":[0.5241988,0.0005871461,0.4700457,0.00007817125,0.00009888917,0.00029373655,0.00046806902,0.000099689874,0.004129897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983815,0.00038703877,0.00016036491,0.00014741588,0.00083924417,0.00008438589],"domain_scores_gemma":[0.9985024,0.0007126483,0.00010128305,0.0002822542,0.0003564426,0.000044997607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014097616,0.00049939984,0.0015404079,0.001309854,0.00065488013,0.0035468673,0.0013060987,0.0009553991,0.003487174],"category_scores_gemma":[0.004475198,0.0004164806,0.0011175424,0.001832022,0.0004511689,0.0026578116,0.0015308507,0.000957871,0.0013710434],"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.00053303037,0.0004041418,0.0014894028,0.00043845127,0.0003589748,0.0004802448,0.0003839834,0.29101133,0.007398799,0.080362044,0.007580829,0.6095587],"study_design_scores_gemma":[0.00005573977,0.0001113506,0.00046105895,0.0000378335,0.00012702408,0.00014567673,0.00008754532,0.93708515,0.0038909547,0.052711073,0.0052520856,0.000034595916],"about_ca_topic_score_codex":0.001792767,"about_ca_topic_score_gemma":0.001304475,"teacher_disagreement_score":0.0035468673,"about_ca_system_score_codex":0.0006277553,"about_ca_system_score_gemma":0.00076315773,"threshold_uncertainty_score":0.0116657615},"labels":[],"label_agreement":null},{"id":"W1578197944","doi":"10.1007/11744023_27","title":"Learning and Incorporating Top-Down Cues in Image Segmentation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Conditional random field; Segmentation; Image segmentation; Classifier (UML); Pattern recognition (psychology); Image (mathematics); Object (grammar); Segmentation-based object categorization; Modular design; Exploit; Computer vision; Scale-space segmentation","score_opus":0.010123840886042717,"score_gpt":0.2721488084768841,"score_spread":0.2620249675908414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578197944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06320506,0.0016993057,0.9265707,0.00024953214,0.00018769882,0.00009914141,0.00038960922,0.0054977047,0.002101222],"genre_scores_gemma":[0.33931336,0.001316095,0.65079314,0.00034597388,0.0002481283,0.00009504012,0.0014499525,0.0010858845,0.00535243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993057,0.0001032753,0.00003813534,0.00024346904,0.00016255978,0.0001468111],"domain_scores_gemma":[0.9984377,0.00080134836,0.00010923595,0.00021357299,0.000323019,0.00011506267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010745898,0.0017825374,0.0021742077,0.0021004674,0.0006652641,0.0019764917,0.0020760994,0.0022583897,0.003526296],"category_scores_gemma":[0.0034036476,0.0013328849,0.0012331042,0.0025826073,0.0008818766,0.0028416084,0.0021554527,0.002171128,0.0015855386],"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.00082073006,0.00025906676,0.0008930565,0.0002475892,0.000106155436,0.00014627978,0.000095419375,0.07077435,0.10013429,0.0018976047,0.0046528983,0.8199726],"study_design_scores_gemma":[0.000023873992,0.00011598556,0.000671792,0.00001805277,0.00006491431,0.00008742751,0.000037242404,0.9508749,0.042488307,0.004140877,0.0014541433,0.000022510894],"about_ca_topic_score_codex":0.009237463,"about_ca_topic_score_gemma":0.018732825,"teacher_disagreement_score":0.009237463,"about_ca_system_score_codex":0.0006825878,"about_ca_system_score_gemma":0.0013307229,"threshold_uncertainty_score":0.01836741},"labels":[],"label_agreement":null},{"id":"W1578200831","doi":"10.1007/978-3-642-16023-3_15","title":"On Applicability of Random Graphs for Modeling Random Key Predistribution for Wireless Sensor Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","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 Calgary","funders":"","keywords":"Random graph; Computer science; Wireless sensor network; Random geometric graph; Theoretical computer science; Graph theory; Key (lock); Random function; Graph; Random variable; Mathematics; Computer network; Line graph; Computer security; Voltage graph; Combinatorics","score_opus":0.013853016860318623,"score_gpt":0.24107941586438034,"score_spread":0.22722639900406172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578200831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006533513,0.0013781341,0.985338,0.00058031763,0.00015602542,0.000070290764,0.00015791414,0.00024173871,0.0055440455],"genre_scores_gemma":[0.65881765,0.012659244,0.30136222,0.001137798,0.0010777083,0.000734252,0.00085176167,0.0010661065,0.022293277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985726,0.0008383316,0.000059158207,0.00019157756,0.00022926253,0.00010904607],"domain_scores_gemma":[0.99208987,0.0065317014,0.00039065556,0.0004563982,0.00040364446,0.00012780786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029483961,0.0021644784,0.0017892997,0.0014421495,0.0006359845,0.0015138901,0.0029747495,0.0021811125,0.0032562409],"category_scores_gemma":[0.013132638,0.0009417484,0.0018584677,0.0015931354,0.001878379,0.0031199001,0.0014017532,0.0027518624,0.00073844823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002220346,0.000024138364,0.00017648262,0.000071892304,0.0000358514,0.00006372792,0.000049037837,0.82199734,0.00047475312,0.16775885,0.0017380527,0.0075876615],"study_design_scores_gemma":[0.0000033405724,0.0000055930186,0.000027244332,0.000008613498,0.000007449152,0.000012721175,0.000005599584,0.94368273,0.000059444705,0.055739965,0.00043963984,0.000007707877],"about_ca_topic_score_codex":0.007344485,"about_ca_topic_score_gemma":0.006238001,"teacher_disagreement_score":0.007344485,"about_ca_system_score_codex":0.0016228603,"about_ca_system_score_gemma":0.0008225223,"threshold_uncertainty_score":0.0155928135},"labels":[],"label_agreement":null},{"id":"W1578253793","doi":"10.1007/978-3-540-68123-6_28","title":"Hybrid Unsupervised/Supervised Virtual Reality Spaces for Visualizing Gastric and Liver Cancer Databases: An Evolutionary Computation Approach","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Data mining; Machine learning; Cluster analysis; Pattern recognition (psychology)","score_opus":0.047448569717176245,"score_gpt":0.30546356919975776,"score_spread":0.2580149994825815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578253793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023665909,0.00021272905,0.97404975,0.00012622762,0.00001535071,0.000045693378,0.000089801186,0.00052600005,0.0012685248],"genre_scores_gemma":[0.27255043,0.00029566922,0.7245207,0.00008863342,0.000026520709,0.00011396916,0.00021924473,0.0002307978,0.0019540743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996226,0.0001254647,0.000021530494,0.00007108808,0.00011751099,0.00004179328],"domain_scores_gemma":[0.999456,0.00026951768,0.00004700779,0.00006744911,0.00012356517,0.000036463287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091608893,0.0008165545,0.0009376607,0.001423521,0.0004639768,0.002358084,0.0016765496,0.0010799833,0.0019918082],"category_scores_gemma":[0.0016144227,0.00063782587,0.0013483616,0.0014091361,0.00056336756,0.0012895789,0.0014001856,0.00080285553,0.00038049615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028747434,0.00017503256,0.0015643697,0.00018606888,0.00017741664,0.00022185923,0.000369337,0.6038239,0.026763976,0.02493572,0.0026508027,0.33884403],"study_design_scores_gemma":[0.000005304919,0.000015318235,0.00023054409,0.000007665669,0.000009894262,0.000058870453,0.00003410509,0.9930494,0.002853624,0.0031827085,0.00054295565,0.000009672882],"about_ca_topic_score_codex":0.003159378,"about_ca_topic_score_gemma":0.005448006,"teacher_disagreement_score":0.003159378,"about_ca_system_score_codex":0.0005856887,"about_ca_system_score_gemma":0.0005577812,"threshold_uncertainty_score":0.006663263},"labels":[],"label_agreement":null},{"id":"W1578264776","doi":"10.1007/978-3-642-13681-8_4","title":"Resolution Scalable Image Coding with Dyadic Complementary Rational Wavelet Transforms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wavelet; Computer science; Wavelet packet decomposition; Wavelet transform; Image resolution; Dilation (metric space); Coding (social sciences); Multiresolution analysis; Algorithm; Artificial intelligence; Set (abstract data type); Second-generation wavelet transform; Scalability; Set partitioning in hierarchical trees; Resolution (logic); Discrete wavelet transform; Pattern recognition (psychology); Mathematics","score_opus":0.018957944384724274,"score_gpt":0.2605487704588764,"score_spread":0.24159082607415214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578264776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130660115,0.0011125513,0.9753889,0.00012596276,0.00010931276,0.000017307784,0.000061926854,0.0004113093,0.00970659],"genre_scores_gemma":[0.28360733,0.0033655996,0.69419277,0.000186587,0.00020863878,0.00007623502,0.00039030935,0.00028055263,0.017692043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987113,0.000018675497,0.000006537049,0.000016317465,0.00007237285,0.0000148942745],"domain_scores_gemma":[0.99982494,0.000063037834,0.000014036269,0.00004474065,0.000042355274,0.000010905093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021522383,0.0004949829,0.0004198732,0.00054853753,0.0001198318,0.0007986706,0.00037723978,0.00042510175,0.0029358256],"category_scores_gemma":[0.0006586052,0.000199629,0.00028006488,0.00075207395,0.00036362492,0.00087828137,0.00058242877,0.0009656427,0.0010322531],"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.00020431669,0.000046438574,0.00016847889,0.00021079878,0.000036946778,0.00025222934,0.0000855137,0.05328885,0.20536847,0.31272456,0.0068801795,0.42073324],"study_design_scores_gemma":[0.000031180607,0.00008797122,0.00035086047,0.00004788466,0.00003185872,0.0006600261,0.00004092696,0.816023,0.086494006,0.07678946,0.019405723,0.000037069294],"about_ca_topic_score_codex":0.00025169167,"about_ca_topic_score_gemma":0.0004277511,"teacher_disagreement_score":0.0029358256,"about_ca_system_score_codex":0.00024518333,"about_ca_system_score_gemma":0.00019171479,"threshold_uncertainty_score":0.009821296},"labels":[],"label_agreement":null},{"id":"W1578279521","doi":"10.1007/3-540-45820-4_5","title":"Text Prediction with Fuzzy Alignments","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Simple (philosophy); Machine translation; Translation (biology); Fuzzy logic; Artificial intelligence; Relation (database); Productivity; Machine learning; Data mining; Natural language processing","score_opus":0.011356779240361856,"score_gpt":0.23144922996641834,"score_spread":0.2200924507260565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578279521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09589299,0.0017379447,0.86548644,0.00083862373,0.00041476617,0.00033838316,0.004312467,0.016947921,0.014030436],"genre_scores_gemma":[0.42141965,0.00069097587,0.5503241,0.00021830198,0.00030646313,0.0002637399,0.011311548,0.0006459537,0.014819316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992372,0.00012589482,0.00005940304,0.0003102264,0.00019220484,0.00007503027],"domain_scores_gemma":[0.9981384,0.0008708894,0.00012225084,0.0003304332,0.0004620845,0.000075991295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009230421,0.0008174727,0.00092804217,0.0026096832,0.00087697135,0.0012248199,0.0011864654,0.0010295523,0.011100751],"category_scores_gemma":[0.003988969,0.00043392714,0.00084324635,0.0024557563,0.00040832948,0.0024057627,0.0011851257,0.0010275807,0.007449719],"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.00084014673,0.00017227909,0.0032294248,0.00021979718,0.00010196088,0.00019554274,0.00008864523,0.02232752,0.015818058,0.006941752,0.019888898,0.930176],"study_design_scores_gemma":[0.00007637408,0.0001994473,0.0026250102,0.00007281796,0.000109000925,0.00024703212,0.00014127443,0.91337425,0.030293722,0.042716276,0.010109291,0.000035545643],"about_ca_topic_score_codex":0.0032434345,"about_ca_topic_score_gemma":0.004896427,"teacher_disagreement_score":0.011100751,"about_ca_system_score_codex":0.00039761674,"about_ca_system_score_gemma":0.0007775541,"threshold_uncertainty_score":0.03713566},"labels":[],"label_agreement":null},{"id":"W1578303271","doi":"10.1007/978-3-540-69733-6_26","title":"Quasi-bicliques: Complexity and Binding Pairs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Heuristic; Combinatorics; Greedy algorithm; Benchmark (surveying); Algorithm; Theoretical computer science; Graph; Mathematics; Artificial intelligence","score_opus":0.020104671740001575,"score_gpt":0.23924737839484103,"score_spread":0.21914270665483945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578303271","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.14497551,0.005052837,0.6397597,0.0059213424,0.0008776103,0.00013991422,0.0011643234,0.0007954366,0.20131336],"genre_scores_gemma":[0.71216846,0.0042385464,0.20424815,0.002480528,0.0016168279,0.0007844442,0.0018492186,0.0007275153,0.071886264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986639,0.00039435358,0.00006985866,0.0002880138,0.000429283,0.00015460851],"domain_scores_gemma":[0.9968575,0.0020617764,0.00020166975,0.00032894456,0.00031939647,0.00023059716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011660124,0.0008852476,0.0016294887,0.0023837981,0.0026855795,0.004405585,0.0023678334,0.002228641,0.016576987],"category_scores_gemma":[0.004183694,0.001241924,0.0012209789,0.002750596,0.0041485084,0.0071465163,0.0025343047,0.0052211015,0.003032991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017194716,0.000009775526,0.000083690415,0.000036123933,0.0000049227756,0.00002168268,0.00008111027,0.000978694,0.000285888,0.98942834,0.0028957329,0.0061568427],"study_design_scores_gemma":[0.000004093029,0.0000040916275,0.000060923954,0.000005080888,0.0000024096603,0.000060897295,0.000028233497,0.0037415922,0.00012029857,0.993266,0.0027001346,0.0000062228064],"about_ca_topic_score_codex":0.0008344615,"about_ca_topic_score_gemma":0.0007986561,"teacher_disagreement_score":0.016576987,"about_ca_system_score_codex":0.001096484,"about_ca_system_score_gemma":0.00058948796,"threshold_uncertainty_score":0.055455506},"labels":[],"label_agreement":null},{"id":"W1578349861","doi":"10.1007/11805816_40","title":"The PwC Connection Machine: An Adaptive Expertise Provider","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Computer science; Connection (principal bundle); Workflow; Core (optical fiber); Artificial intelligence; World Wide Web; Information retrieval; Machine learning; Database; Telecommunications","score_opus":0.019949996699366125,"score_gpt":0.25037310141245317,"score_spread":0.23042310471308705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578349861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01854174,0.00066197163,0.95259273,0.0012605445,0.0006062333,0.00041759704,0.0005926042,0.01364211,0.011684344],"genre_scores_gemma":[0.29491007,0.00055905426,0.66937876,0.0006745994,0.0006279714,0.0004604867,0.0012058788,0.0008181072,0.03136507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985108,0.00047138846,0.00006266972,0.0003563793,0.00048586543,0.00011293725],"domain_scores_gemma":[0.99673885,0.0011244848,0.000079624035,0.0011420359,0.00069529546,0.00021968869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023524784,0.00070669246,0.0014319058,0.0014877355,0.0011541481,0.0017359441,0.0035167397,0.0028166024,0.016478319],"category_scores_gemma":[0.011263253,0.0008022457,0.0005775911,0.0020822464,0.0006162399,0.0043457435,0.0025820178,0.002824126,0.009496104],"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.0005844514,0.00048305985,0.0017915922,0.00013734642,0.000104988074,0.0001529159,0.000102560334,0.02478026,0.00412724,0.01832627,0.06797947,0.8814298],"study_design_scores_gemma":[0.00009362229,0.00007506258,0.0005411843,0.000018586416,0.00004537349,0.00028087798,0.000032528376,0.9638936,0.0038810153,0.01754169,0.013560105,0.000036381098],"about_ca_topic_score_codex":0.0054215053,"about_ca_topic_score_gemma":0.008050529,"teacher_disagreement_score":0.016478319,"about_ca_system_score_codex":0.0007068584,"about_ca_system_score_gemma":0.0014221896,"threshold_uncertainty_score":0.055125535},"labels":[],"label_agreement":null},{"id":"W1578414987","doi":"10.1007/3-540-36103-0_46","title":"Formal Verification of a SONET Telecom System Block","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Synchronous optical networking; Computer science; Telecommunications; Block (permutation group theory); Computer network","score_opus":0.024159776704707186,"score_gpt":0.25018488207580136,"score_spread":0.2260251053710942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578414987","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.14363794,0.0002960252,0.8235304,0.0003928086,0.00016290155,0.00046675967,0.00058858725,0.004990588,0.025934068],"genre_scores_gemma":[0.837107,0.00021499634,0.14006162,0.000093099145,0.000034170895,0.00021816515,0.0003894139,0.0003517263,0.021529905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993789,0.00015196097,0.000028784028,0.00009490711,0.0002613531,0.000083990635],"domain_scores_gemma":[0.9991586,0.00054472196,0.000062991734,0.000103326485,0.0001108948,0.0000193811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775209,0.00054890127,0.00035753995,0.0003213946,0.00051534624,0.0008884061,0.0006725291,0.00073497865,0.010339159],"category_scores_gemma":[0.0012671612,0.00040588842,0.0005532923,0.00013615261,0.0009079791,0.0008235466,0.0006183962,0.00055515603,0.001467124],"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.0018070447,0.00025566018,0.0019263355,0.0011214869,0.0001157331,0.0026471154,0.000848654,0.3244669,0.2531292,0.26490685,0.0059547117,0.14282028],"study_design_scores_gemma":[0.00048087217,0.0008017048,0.0012173698,0.00016643525,0.00015804097,0.00064529956,0.0000896117,0.6725915,0.22029361,0.046546098,0.05694134,0.000068069945],"about_ca_topic_score_codex":0.0060255746,"about_ca_topic_score_gemma":0.005258475,"teacher_disagreement_score":0.010339159,"about_ca_system_score_codex":0.0007930317,"about_ca_system_score_gemma":0.0013175029,"threshold_uncertainty_score":0.03458798},"labels":[],"label_agreement":null},{"id":"W1578450297","doi":"10.1007/978-3-642-23774-4_27","title":"Supporting Window Switching with Spatially Consistent Thumbnail Zones: Design and Evaluation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"Thumbnail; Window (computing); Computer science; Predictability; Sliding window protocol; Key (lock); Interface (matter); Human–computer interaction; Operating system; Artificial intelligence","score_opus":0.21468405620800965,"score_gpt":0.3862218470545488,"score_spread":0.17153779084653917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578450297","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.7115856,0.0018893594,0.27296335,0.0001523944,0.00017631116,0.000893536,0.0003702857,0.00923768,0.0027315489],"genre_scores_gemma":[0.88654494,0.0004138449,0.11090554,0.000060628932,0.00002766587,0.00031340183,0.000137763,0.00032697825,0.0012691655],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872214,0.00044508788,0.00010249716,0.00022994155,0.00031975747,0.0001805498],"domain_scores_gemma":[0.98878646,0.0072736987,0.0007000857,0.0012646709,0.0013265036,0.00064858806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002247813,0.0015520864,0.00095483084,0.0009003583,0.0004158742,0.0019204436,0.004807094,0.0010260381,0.004684694],"category_scores_gemma":[0.009848294,0.00063772954,0.00051619107,0.00075272354,0.00057670765,0.0023649447,0.0012537494,0.00072902936,0.0004576024],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02576324,0.0053418046,0.011965983,0.003198376,0.0005832469,0.0005611594,0.0018561161,0.07324935,0.18490902,0.0055133225,0.004491414,0.682567],"study_design_scores_gemma":[0.0037579695,0.019416893,0.010323306,0.0002890408,0.0020524797,0.0008338696,0.0013983172,0.6688103,0.27834782,0.004194264,0.010243507,0.00033221656],"about_ca_topic_score_codex":0.0026161328,"about_ca_topic_score_gemma":0.0018141952,"teacher_disagreement_score":0.004807094,"about_ca_system_score_codex":0.00060052326,"about_ca_system_score_gemma":0.0007035174,"threshold_uncertainty_score":0.01567185},"labels":[],"label_agreement":null},{"id":"W1578468222","doi":"10.1007/11566465_57","title":"Computer–Assisted Deformity Correction Using the Ilizarov Method","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Bone fractures and treatments","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Frame (networking); Fixation (population genetics); Flexibility (engineering); Rotation (mathematics); Imaging phantom; Computer vision; Orthodontics; Artificial intelligence; Medicine; Mathematics; Nuclear medicine","score_opus":0.029444773556736432,"score_gpt":0.3323693397904917,"score_spread":0.3029245662337553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578468222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11707116,0.0024404856,0.8675351,0.000392881,0.00044480944,0.0001335385,0.00018106207,0.0034552612,0.008345716],"genre_scores_gemma":[0.6280928,0.0011943688,0.3619265,0.00018167499,0.00018745787,0.00007462193,0.00022117277,0.0006447071,0.007476683],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992428,0.00007655711,0.00008333123,0.00016566247,0.00034017416,0.00009143804],"domain_scores_gemma":[0.99947935,0.00014037032,0.000089734254,0.00016313224,0.000075738484,0.000051675863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082869676,0.0008014422,0.00067413464,0.0017485081,0.000493822,0.0008397327,0.0011024477,0.0008273997,0.008309022],"category_scores_gemma":[0.0009129385,0.0005675777,0.0009789229,0.0009586955,0.0006949685,0.00071540626,0.0011331238,0.0013996904,0.0013674456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017853349,0.0003932594,0.0057248957,0.0004167449,0.00024412909,0.0011198918,0.00021591256,0.012260881,0.13523896,0.002257741,0.004667001,0.8356752],"study_design_scores_gemma":[0.0025187617,0.0065330868,0.09883344,0.0008775054,0.0015495266,0.18693905,0.0005097565,0.33389726,0.24166031,0.0054964623,0.11955905,0.0016257719],"about_ca_topic_score_codex":0.0023310715,"about_ca_topic_score_gemma":0.003364706,"teacher_disagreement_score":0.008309022,"about_ca_system_score_codex":0.00023208548,"about_ca_system_score_gemma":0.00087267015,"threshold_uncertainty_score":0.027796507},"labels":[],"label_agreement":null},{"id":"W1578557524","doi":"10.1007/11866763_48","title":"Towards a Multi-modal Atlas for Neurosurgical Planning","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Subthalamic nucleus; Magnetic resonance imaging; Atlas (anatomy); Computer science; Deep brain stimulation; Neurosurgery; Basal ganglia; Stereotaxy; Brain atlas; Thalamus; Medicine; Artificial intelligence; Radiology; Parkinson's disease; Anatomy; Central nervous system","score_opus":0.029003122491863778,"score_gpt":0.30901939286206204,"score_spread":0.2800162703701983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578557524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016070141,0.00011714133,0.9955206,0.00011779938,0.000025381834,0.000027075956,0.00017192587,0.0010561206,0.0013569188],"genre_scores_gemma":[0.039715882,0.00029953656,0.9576322,0.00010278262,0.000026123687,0.00007878528,0.00036201987,0.00040435005,0.0013784103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995752,0.000083216764,0.000032543987,0.0000826716,0.00018879681,0.000037597267],"domain_scores_gemma":[0.9994216,0.00018592755,0.00004453605,0.00012400099,0.00017175394,0.000052135794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006724656,0.00077850913,0.00070489384,0.0015153548,0.0008076783,0.0024513248,0.0017960567,0.0015852675,0.005282131],"category_scores_gemma":[0.0024094675,0.0010208222,0.0013095838,0.00185944,0.00057211344,0.0015348903,0.0028337408,0.002342331,0.0029469025],"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.0002665185,0.000058460424,0.0012754508,0.0004681602,0.00012714589,0.00067784725,0.00055300543,0.2572505,0.060010925,0.08764046,0.016670499,0.57500106],"study_design_scores_gemma":[0.000020813093,0.00007522523,0.00070804544,0.000085745705,0.000062174826,0.0010864495,0.00015215491,0.8656903,0.025439596,0.07037619,0.03623459,0.000068705056],"about_ca_topic_score_codex":0.0060624937,"about_ca_topic_score_gemma":0.009602253,"teacher_disagreement_score":0.0060624937,"about_ca_system_score_codex":0.0009914964,"about_ca_system_score_gemma":0.0015802116,"threshold_uncertainty_score":0.017670512},"labels":[],"label_agreement":null},{"id":"W1578564517","doi":"10.1007/978-3-642-30353-1_12","title":"Exploiting the Probability of Observation for Efficient Bayesian Network Inference","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Lethbridge","funders":"","keywords":"Computer science; Variable elimination; Inference; Heuristics; Bayesian network; Benchmark (surveying); Variable (mathematics); Set (abstract data type); Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.05854167354042346,"score_gpt":0.2719923224785183,"score_spread":0.21345064893809484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578564517","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.0008712097,0.00022024628,0.9981914,0.00008308652,0.000013862709,0.000013377307,0.00004825787,0.00010717345,0.00045132122],"genre_scores_gemma":[0.12486966,0.0017358623,0.8693251,0.00016626225,0.00024557632,0.00027201054,0.0006715364,0.00024371475,0.0024702987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966619,0.0017167585,0.00020212188,0.0005210915,0.00075047166,0.00014774429],"domain_scores_gemma":[0.97442394,0.022316592,0.00071143697,0.0017872616,0.0005697931,0.00019093727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055566845,0.0016673052,0.0027302904,0.0025222374,0.0009523142,0.0026802474,0.0038261935,0.0020872888,0.0058925883],"category_scores_gemma":[0.036476348,0.0020892494,0.0020935724,0.0038496526,0.0017369847,0.0065750075,0.0037487175,0.0047942065,0.0014918618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020748538,0.00011022713,0.0011531981,0.00043732344,0.00031023566,0.00017168709,0.00020019816,0.4716527,0.0019023331,0.28177562,0.0042075217,0.23787145],"study_design_scores_gemma":[0.000014616128,0.00000907138,0.00011162655,0.00002009344,0.000032437936,0.00004501638,0.000008773462,0.77548033,0.0004816708,0.2225909,0.0011912641,0.000014236104],"about_ca_topic_score_codex":0.005986964,"about_ca_topic_score_gemma":0.008461295,"teacher_disagreement_score":0.005986964,"about_ca_system_score_codex":0.0014934714,"about_ca_system_score_gemma":0.0019438742,"threshold_uncertainty_score":0.029386938},"labels":[],"label_agreement":null},{"id":"W1578592833","doi":"10.1007/978-3-540-72079-9_13","title":"Adaptive Content Presentation for the Web","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":61,"is_retracted":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":"Presentation (obstetrics); Content (measure theory); Web content; Computer science; Context (archaeology); World Wide Web; The Internet; Mathematics; Biology; Medicine","score_opus":0.13110473540959716,"score_gpt":0.3598790303687918,"score_spread":0.22877429495919466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578592833","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.032793704,0.0059228907,0.8196391,0.0012657371,0.0013694838,0.00026754377,0.00063131296,0.026864111,0.11124613],"genre_scores_gemma":[0.41368237,0.0060675056,0.32366377,0.000627953,0.0013220593,0.0003585271,0.0021028135,0.004088647,0.24808632],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973327,0.00005786988,0.000012325357,0.00004049245,0.00012945061,0.000026620408],"domain_scores_gemma":[0.99945,0.0002531285,0.000019273451,0.00009387386,0.0001283352,0.000055302666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037654868,0.00057439436,0.00037868973,0.00061941997,0.0003401453,0.0017337102,0.001015421,0.0010509548,0.028548514],"category_scores_gemma":[0.0017962612,0.00023932835,0.00029161907,0.00063522515,0.00024163148,0.0020833435,0.0012232006,0.0009888164,0.0074658603],"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.00034561797,0.0002031194,0.0003555432,0.00040866024,0.00003997336,0.00032870093,0.0004038464,0.0072718253,0.06009521,0.02134674,0.07249087,0.83671],"study_design_scores_gemma":[0.00022113383,0.0004423674,0.0035394118,0.00034449247,0.00018276979,0.0019686252,0.0006061818,0.3483179,0.08232516,0.09988794,0.46201354,0.00015056055],"about_ca_topic_score_codex":0.0005478097,"about_ca_topic_score_gemma":0.00050521333,"teacher_disagreement_score":0.028548514,"about_ca_system_score_codex":0.00031921698,"about_ca_system_score_gemma":0.00019445014,"threshold_uncertainty_score":0.095504284},"labels":[],"label_agreement":null},{"id":"W1578792929","doi":"10.1007/978-3-540-27775-0_22","title":"Arc-Consistency + Unit Propagation = Lookahead","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Consistency (knowledge bases); Local consistency; Arc (geometry); Algorithm; Artificial intelligence; Mathematics; Geometry","score_opus":0.022267474842993674,"score_gpt":0.24346801506990604,"score_spread":0.22120054022691235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578792929","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.010752548,0.0015529505,0.8767301,0.0034342438,0.0017192808,0.0005220757,0.0028691692,0.028082447,0.07433714],"genre_scores_gemma":[0.21168649,0.001796917,0.7049178,0.0020093466,0.00073322875,0.00036538747,0.003629559,0.012033692,0.06282755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718094,0.0006980873,0.00019564726,0.0006363484,0.00089234795,0.00039657264],"domain_scores_gemma":[0.9900866,0.0035418067,0.00036733778,0.0048315288,0.0010170606,0.00015572977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863141,0.0017657671,0.0014341255,0.001235183,0.0013579517,0.0033398725,0.0041631986,0.0019668776,0.06486081],"category_scores_gemma":[0.010491254,0.0016308818,0.0023162751,0.002270768,0.0019906075,0.011420207,0.0036388503,0.0043091155,0.013481835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093279115,0.00034838796,0.0011304306,0.0023051007,0.00019389443,0.0002395904,0.00022192665,0.035560474,0.010235123,0.27669325,0.11660733,0.5555318],"study_design_scores_gemma":[0.00031937534,0.00013223285,0.0006152775,0.00025300233,0.00037809965,0.0006526366,0.00014048863,0.11647085,0.038666353,0.76161236,0.08060396,0.00015548406],"about_ca_topic_score_codex":0.004989698,"about_ca_topic_score_gemma":0.007244411,"teacher_disagreement_score":0.06486081,"about_ca_system_score_codex":0.0012466434,"about_ca_system_score_gemma":0.0026356822,"threshold_uncertainty_score":0.21698105},"labels":[],"label_agreement":null},{"id":"W1578823017","doi":"10.1007/978-3-540-30125-7_31","title":"Significance Test for Feature Subset Selection on Image Recognition","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Waterloo","funders":"","keywords":"Computer science; Feature selection; Artificial intelligence; Pattern recognition (psychology); Selection (genetic algorithm); Feature (linguistics); Image (mathematics); Computer vision","score_opus":0.019712254924873725,"score_gpt":0.2487813713266538,"score_spread":0.22906911640178007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578823017","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.13688554,0.00079303485,0.8567711,0.00058764196,0.00036139096,0.00021767919,0.000588346,0.0022669306,0.0015283589],"genre_scores_gemma":[0.80826783,0.00017431944,0.1857222,0.00024504337,0.00043906106,0.0003345933,0.0022229545,0.00043253324,0.002161432],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9893618,0.005513285,0.0006626439,0.0014462767,0.0024086537,0.0006072805],"domain_scores_gemma":[0.939649,0.05192521,0.00087294955,0.0034979894,0.0033202227,0.0007346445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012347579,0.0010883253,0.0031781902,0.0030355195,0.0015079697,0.0016450572,0.0023611416,0.0017568233,0.0044655325],"category_scores_gemma":[0.043662637,0.0005190401,0.0020671515,0.0021539172,0.0016159681,0.0014621997,0.0014834484,0.002561782,0.0008836637],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006130141,0.00061979046,0.040776808,0.0005256277,0.0016269705,0.0008618053,0.00019644007,0.032674704,0.028968595,0.008510898,0.010615051,0.8684931],"study_design_scores_gemma":[0.00071287877,0.004705417,0.048963178,0.00007084551,0.001039279,0.0013830676,0.00043705286,0.86162406,0.032229997,0.044236273,0.0044832677,0.00011475457],"about_ca_topic_score_codex":0.0008050604,"about_ca_topic_score_gemma":0.0006350157,"teacher_disagreement_score":0.012347579,"about_ca_system_score_codex":0.0004675711,"about_ca_system_score_gemma":0.0018084784,"threshold_uncertainty_score":0.065301},"labels":[],"label_agreement":null},{"id":"W1578845481","doi":"10.1007/978-3-642-01307-2_92","title":"Cross-Channel Query Recommendation on Commercial Mobile Search Engine: Why, How and Empirical Evaluation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Search engine; Channel (broadcasting); Information retrieval; Web search query; Service (business); Query expansion; Computer network","score_opus":0.058995116411767565,"score_gpt":0.34840265799762066,"score_spread":0.2894075415858531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578845481","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.9788902,0.0041640094,0.0069539486,0.0004065617,0.000064210886,0.0002506343,0.0022166558,0.0008691922,0.0061845835],"genre_scores_gemma":[0.9767953,0.0012123497,0.013297633,0.0001385729,0.00008763771,0.00007831557,0.003282444,0.00011798084,0.0049896953],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9960885,0.0018974699,0.000219609,0.00044526736,0.0010506007,0.00029855574],"domain_scores_gemma":[0.9544928,0.03566608,0.001037168,0.0026689162,0.0054062647,0.00072873465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00689841,0.0009892182,0.001336082,0.0026894673,0.0008222794,0.0019132866,0.0012957829,0.0016399926,0.006141051],"category_scores_gemma":[0.02994167,0.0005660129,0.00091722084,0.003875693,0.0004884462,0.0044944542,0.0007669206,0.00096375484,0.0024095238],"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.0150710475,0.006951122,0.3114299,0.0032844876,0.0016843998,0.000346111,0.0014796308,0.035166718,0.011100509,0.0031248415,0.0367385,0.57362276],"study_design_scores_gemma":[0.0008205478,0.007616422,0.20506093,0.0002682171,0.003565188,0.0007396324,0.0025098827,0.74535,0.024311822,0.0016289636,0.007707654,0.0004207098],"about_ca_topic_score_codex":0.0584171,"about_ca_topic_score_gemma":0.059771065,"teacher_disagreement_score":0.0584171,"about_ca_system_score_codex":0.0015790788,"about_ca_system_score_gemma":0.0013875399,"threshold_uncertainty_score":0.116154194},"labels":[],"label_agreement":null},{"id":"W1578863054","doi":"10.1007/3-540-39568-7_38","title":"Sequence Complexity as a Test for Cryptographic Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Plaintext; Ciphertext; Mathematics; Computational complexity theory; Algorithm; Encryption; Cryptography; Sequence (biology); Theoretical computer science; Computer science","score_opus":0.07686619966551514,"score_gpt":0.3052293521594427,"score_spread":0.22836315249392755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578863054","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.43124893,0.0009863238,0.45125756,0.004315117,0.0005448229,0.00026873665,0.0008760732,0.0011563307,0.109345995],"genre_scores_gemma":[0.96747464,0.00024120233,0.02507851,0.0002860846,0.0003451313,0.00019484006,0.0005000325,0.00011712359,0.005762335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504447,0.001789172,0.00026963378,0.0005685226,0.0018798918,0.00044830254],"domain_scores_gemma":[0.94305754,0.04718626,0.0021339413,0.003569347,0.0023154903,0.0017373275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003738722,0.0007721294,0.0009803828,0.0047152643,0.0015539082,0.0038779005,0.001552249,0.0026831208,0.008186485],"category_scores_gemma":[0.030891024,0.0004527054,0.0011126344,0.0020392013,0.007472909,0.012422779,0.0039343643,0.0043266267,0.0009872664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023179312,0.00006345737,0.0017498166,0.00008398169,0.000022604208,0.00008406647,0.00015292811,0.006920533,0.0021327368,0.970679,0.001992546,0.015886465],"study_design_scores_gemma":[0.00003920986,0.00015768396,0.0007329321,0.000033990375,0.000015860749,0.0001858804,0.00007902222,0.06092348,0.0038786405,0.9316327,0.0022862514,0.00003433952],"about_ca_topic_score_codex":0.00044705157,"about_ca_topic_score_gemma":0.00024444386,"teacher_disagreement_score":0.008186485,"about_ca_system_score_codex":0.0020304208,"about_ca_system_score_gemma":0.0013250988,"threshold_uncertainty_score":0.027386546},"labels":[],"label_agreement":null},{"id":"W1578906478","doi":"10.1007/bfb0032847","title":"A comparison of algorithms for the symbolic computation of Padé approximants","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Euclidean algorithm; Algorithm; Computation; Euclidean geometry; Mathematics; Series (stratigraphy); Representation (politics); Symbolic computation; Divide and conquer algorithms; Function (biology); Power series; Computer science","score_opus":0.06748206602746254,"score_gpt":0.34202931954160865,"score_spread":0.2745472535141461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578906478","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.0116459085,0.0015958676,0.975195,0.00016520073,0.00023932307,0.00011112481,0.00013898313,0.0029581205,0.007950383],"genre_scores_gemma":[0.10526364,0.0015635799,0.88630843,0.00010218346,0.00015287184,0.0002788003,0.0005959413,0.0008487156,0.0048859403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975172,0.0007288757,0.00020268194,0.00021829912,0.001125993,0.00020694733],"domain_scores_gemma":[0.9912633,0.005772202,0.00020003221,0.0012809298,0.0012905706,0.00019296995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022784662,0.0017713095,0.0021755975,0.0027675694,0.0010092364,0.0030234149,0.0036041664,0.0018580836,0.015215591],"category_scores_gemma":[0.016531464,0.00064350094,0.0013129985,0.0035519828,0.0009909421,0.0035561672,0.0020505395,0.00225773,0.004243799],"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.001344859,0.00028505237,0.0007645943,0.0007056322,0.00015747223,0.00010696144,0.00028901547,0.09282971,0.0060507962,0.12981917,0.006915542,0.7607312],"study_design_scores_gemma":[0.00028637255,0.00027470355,0.00049672887,0.0001497995,0.00007795553,0.00030563583,0.00022042819,0.9033408,0.01199305,0.06986408,0.012925217,0.00006528272],"about_ca_topic_score_codex":0.0022252938,"about_ca_topic_score_gemma":0.003813467,"teacher_disagreement_score":0.015215591,"about_ca_system_score_codex":0.0012516684,"about_ca_system_score_gemma":0.0020004287,"threshold_uncertainty_score":0.050901294},"labels":[],"label_agreement":null},{"id":"W1578961922","doi":"10.1007/11559573_91","title":"Rotation-Invariant Texture Classification Using Steerable Gabor Filter Bank","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Gabor filter; Invariant (physics); Pattern recognition (psychology); Artificial intelligence; Computation; Gabor wavelet; Gabor transform; Texture (cosmology); Filter bank; Computer vision; Feature extraction; Filter (signal processing); Channel (broadcasting); Mathematics; Computer science; Rotation (mathematics); Texture filtering; Image texture; Image processing; Algorithm; Image (mathematics); Time–frequency analysis; Wavelet transform","score_opus":0.03358112371472086,"score_gpt":0.27102094291562706,"score_spread":0.2374398192009062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578961922","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.040881757,0.0009434538,0.95173043,0.00011005468,0.0001509526,0.00006181856,0.0002950451,0.0021198965,0.0037065805],"genre_scores_gemma":[0.3186717,0.002411888,0.6662137,0.00015885537,0.0001498356,0.00009767606,0.0013929455,0.000337256,0.010566166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997687,0.000023539282,0.000011402822,0.000041699965,0.00011830081,0.000036357036],"domain_scores_gemma":[0.9997454,0.00005145815,0.00002402736,0.000054943448,0.00010940938,0.000014691526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002662173,0.00038038898,0.0008298083,0.0012459619,0.00020111534,0.0007591607,0.00043114586,0.00046570422,0.0032198844],"category_scores_gemma":[0.0005818653,0.00025493253,0.0006131784,0.0011266002,0.0002636563,0.00073111587,0.0003179183,0.0003725688,0.0026881131],"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.0002197179,0.000064549706,0.0006093318,0.000116627874,0.00003680103,0.00007467623,0.000027291588,0.007017969,0.26507986,0.0017970104,0.0035322655,0.7214239],"study_design_scores_gemma":[0.000045610934,0.0003068454,0.013666113,0.00005633789,0.00018638805,0.0010652546,0.00012423868,0.639148,0.3234455,0.004888148,0.016971976,0.00009562381],"about_ca_topic_score_codex":0.0012174996,"about_ca_topic_score_gemma":0.0012747615,"teacher_disagreement_score":0.0032198844,"about_ca_system_score_codex":0.00018640733,"about_ca_system_score_gemma":0.00030396925,"threshold_uncertainty_score":0.010771573},"labels":[],"label_agreement":null},{"id":"W1578979560","doi":"10.1007/11536482_9","title":"Negotiating Gestalt: Artistic Expression by Coalition Formation Between Agents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Negotiation; Computer science; Gestalt psychology; Representation (politics); Expression (computer science); Painting; Space (punctuation); Autonomous agent; Control (management); Join (topology); Human–computer interaction; Artificial intelligence; Visual arts; Art; Epistemology; Programming language; Law; Politics; Political science; Philosophy","score_opus":0.026061148566813654,"score_gpt":0.28940768054350996,"score_spread":0.26334653197669633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578979560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08530608,0.0003382457,0.8310782,0.00094350433,0.00017720248,0.000107503234,0.000065006134,0.0008386373,0.0811456],"genre_scores_gemma":[0.83993447,0.00020233472,0.13854259,0.000083653045,0.000035619538,0.00014941268,0.00010604851,0.00020075668,0.020745156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992762,0.00034696027,0.00002571439,0.00009335904,0.00018372173,0.00007404427],"domain_scores_gemma":[0.99890375,0.00060647435,0.00006619018,0.00023213113,0.00006832705,0.00012312434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011857812,0.0005001134,0.0003960929,0.0003915465,0.0013364512,0.0025474122,0.0011901594,0.001023605,0.010984622],"category_scores_gemma":[0.0044804276,0.00041287937,0.00046277032,0.0005672032,0.0021390081,0.0029805398,0.004176735,0.0010391275,0.0010315336],"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.00052698166,0.00014107637,0.0009108237,0.00033301394,0.00007826768,0.0006943202,0.010385083,0.07449209,0.05155798,0.7021373,0.0079904515,0.15075266],"study_design_scores_gemma":[0.00013803155,0.00014227834,0.00081030617,0.00009578909,0.000052214342,0.0005317195,0.002944086,0.37808353,0.01721212,0.5525822,0.047323555,0.00008413385],"about_ca_topic_score_codex":0.0005039568,"about_ca_topic_score_gemma":0.00065342215,"teacher_disagreement_score":0.010984622,"about_ca_system_score_codex":0.0003988251,"about_ca_system_score_gemma":0.00041215797,"threshold_uncertainty_score":0.036747217},"labels":[],"label_agreement":null},{"id":"W1579101463","doi":"10.1007/978-3-642-13193-6_26","title":"New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Constraint (computer-aided design); Constructive; Bin packing problem; Mathematical optimization; Computer science; Packing problems; Algorithm; Mathematics; Geometry; Programming language","score_opus":0.013193319874155925,"score_gpt":0.21468690292949866,"score_spread":0.20149358305534273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579101463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024121836,0.0032190064,0.95202994,0.0003994511,0.000584163,0.0002452531,0.0006192457,0.0022557743,0.016525317],"genre_scores_gemma":[0.075992145,0.001309604,0.91172,0.00023086305,0.00021584326,0.0003985606,0.0013129867,0.00056315534,0.00825688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993579,0.00014601015,0.000029569142,0.000099009136,0.0002153651,0.00015211754],"domain_scores_gemma":[0.9983954,0.0009959089,0.0001173721,0.00019225109,0.00020791442,0.000091158414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000753811,0.002015301,0.0018599196,0.0016833456,0.0009129768,0.0019823196,0.0030396278,0.0016952374,0.010403443],"category_scores_gemma":[0.0023609293,0.0014745278,0.0012814068,0.0042564115,0.00058024627,0.0024908728,0.0017601254,0.0022637998,0.0020913698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000766413,0.0003328627,0.0005108455,0.00093622325,0.00012630683,0.0003323217,0.0002477906,0.4244621,0.008766397,0.040826153,0.053242162,0.46945044],"study_design_scores_gemma":[0.00025491093,0.0001623536,0.00036297346,0.00007269188,0.000041624735,0.00018007774,0.000078998906,0.9460381,0.002413971,0.031843964,0.01849613,0.00005423714],"about_ca_topic_score_codex":0.0050591268,"about_ca_topic_score_gemma":0.008888625,"teacher_disagreement_score":0.010403443,"about_ca_system_score_codex":0.0013990379,"about_ca_system_score_gemma":0.0014673978,"threshold_uncertainty_score":0.034803033},"labels":[],"label_agreement":null},{"id":"W1579171921","doi":"10.1007/bfb0028264","title":"Immobilizing a polytope","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Polytope; Polygon (computer graphics); Mathematics; Boundary (topology); Regular polygon; Convex polytope; General position; Polygon covering; Polyhedron; Convex polygon; Position (finance); Point (geometry); Simple polygon; Convex set; Geometry; Computer science; Mathematical analysis; Convex optimization","score_opus":0.016677696001507487,"score_gpt":0.249318264119708,"score_spread":0.23264056811820052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579171921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09390578,0.00068475655,0.77177274,0.00036419556,0.0007407067,0.00016923073,0.000522122,0.0006960602,0.13114443],"genre_scores_gemma":[0.4912161,0.00275385,0.28069407,0.0002830683,0.00017443708,0.00034122358,0.001556248,0.00088111346,0.22209993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998666,0.000012697601,0.000006321917,0.00004466991,0.000045095283,0.000024641697],"domain_scores_gemma":[0.9999223,0.000021837983,0.000007656771,0.000023436934,0.000011269697,0.000013467251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011428672,0.0009813724,0.0007190668,0.0006245569,0.0007286112,0.00094295776,0.0009858175,0.0008130292,0.016656242],"category_scores_gemma":[0.0003149252,0.0005153637,0.0006264091,0.00045758756,0.0010016952,0.0010333054,0.003162706,0.0015079187,0.00359173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020709916,0.00014813179,0.0003748265,0.0007640519,0.00006350783,0.00070200325,0.00050594995,0.16230907,0.075403444,0.56455266,0.014069751,0.18089953],"study_design_scores_gemma":[0.00010359339,0.0006407553,0.00073729246,0.0003253684,0.00009225164,0.0012283678,0.000771859,0.41639733,0.032446068,0.39993304,0.14722313,0.00010102019],"about_ca_topic_score_codex":0.00081220834,"about_ca_topic_score_gemma":0.0008612867,"teacher_disagreement_score":0.016656242,"about_ca_system_score_codex":0.00032503274,"about_ca_system_score_gemma":0.00030898253,"threshold_uncertainty_score":0.055720687},"labels":[],"label_agreement":null},{"id":"W1579209552","doi":"10.1007/11512073_4","title":"Hierarchical Resource Usage Coordination for Large-Scale Multi-agent Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing 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":"University of Saskatchewan","funders":"","keywords":"Computer science; Distributed computing; Scalability; Resource (disambiguation); Hierarchical control system; Control (management); Artificial intelligence; Computer network; Database","score_opus":0.022420861427758752,"score_gpt":0.2615508643080066,"score_spread":0.23913000288024786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579209552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026477853,0.0009114802,0.9583745,0.0004507342,0.00009993306,0.000104834464,0.00004739033,0.0012425282,0.012290699],"genre_scores_gemma":[0.7774228,0.0005413524,0.21358715,0.00008771987,0.000106275875,0.00022999434,0.000108706525,0.00018929847,0.007726755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990977,0.00031045388,0.00006379131,0.00015060924,0.00025230096,0.00012519688],"domain_scores_gemma":[0.99876297,0.0005678998,0.00011554139,0.00028761555,0.0001361618,0.00012989131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015342743,0.0005859634,0.0008857446,0.0004551048,0.0010066848,0.0016887271,0.0019108733,0.00072068867,0.0031862843],"category_scores_gemma":[0.0025532842,0.0005033579,0.00036043694,0.0008693968,0.0009307985,0.0017927754,0.0015649616,0.0010706797,0.0005391758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019516914,0.00013342066,0.0006176597,0.00019336723,0.000078697245,0.00017728982,0.0003650796,0.69655985,0.014805038,0.15409328,0.007563068,0.12521812],"study_design_scores_gemma":[0.000025762472,0.000032454765,0.00023728829,0.000007972899,0.000014859371,0.000037905924,0.000047851678,0.93894964,0.0019782542,0.055004213,0.0036512883,0.000012522907],"about_ca_topic_score_codex":0.0024205267,"about_ca_topic_score_gemma":0.0035884108,"teacher_disagreement_score":0.0031862843,"about_ca_system_score_codex":0.0010775446,"about_ca_system_score_gemma":0.0009724086,"threshold_uncertainty_score":0.010659158},"labels":[],"label_agreement":null},{"id":"W15793533","doi":"10.1007/978-3-642-29946-9_6","title":"Goal-Directed Online Learning of Predictive Models","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"McGill University","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Personalization; Online learning; Variety (cybernetics); Domain (mathematical analysis); Function (biology); Predictive value; Multimedia","score_opus":0.02166947854869292,"score_gpt":0.2582736648932754,"score_spread":0.2366041863445825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15793533","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.011923134,0.000526944,0.98366815,0.00040308636,0.00005302307,0.000061453014,0.00017150484,0.0008024154,0.0023902506],"genre_scores_gemma":[0.6336219,0.0010619981,0.3527675,0.0006712728,0.0002729547,0.0005726444,0.001995111,0.0004094486,0.008627156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984719,0.00062892307,0.00009715415,0.00036915508,0.00028470653,0.0001481794],"domain_scores_gemma":[0.98604834,0.011815112,0.00036389232,0.0007610471,0.0007422147,0.00026937717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004116598,0.0014650242,0.0025685544,0.0013611724,0.0006453887,0.0017536384,0.0040629036,0.0024380335,0.0050566867],"category_scores_gemma":[0.014423538,0.0013126445,0.0013539024,0.0019518639,0.0013696756,0.0032913366,0.0033588635,0.004000732,0.001302034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029261998,0.00039739936,0.0013286361,0.00030960166,0.00015220682,0.00013159042,0.0001773868,0.7318275,0.0007036891,0.04502657,0.008662065,0.2109907],"study_design_scores_gemma":[0.000012384986,0.000019548324,0.000037351336,0.000011782814,0.000009680435,0.000010995492,0.000005446087,0.9806049,0.00016776849,0.018872011,0.00024441455,0.0000037868265],"about_ca_topic_score_codex":0.004067417,"about_ca_topic_score_gemma":0.0049414984,"teacher_disagreement_score":0.0050566867,"about_ca_system_score_codex":0.0014383325,"about_ca_system_score_gemma":0.0016912654,"threshold_uncertainty_score":0.021770895},"labels":[],"label_agreement":null},{"id":"W1579357699","doi":"10.1007/978-3-540-30551-4_77","title":"Sweeping Graphs with Large Clique Number","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Regina","funders":"","keywords":"Computer science; Clique; Clique problem; Theoretical computer science; Combinatorics; Graph; Chordal graph; Mathematics; 1-planar graph","score_opus":0.015019955904187065,"score_gpt":0.27993704221590104,"score_spread":0.26491708631171396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579357699","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.40747014,0.0018666667,0.3672603,0.0023061857,0.00032943755,0.00028878212,0.0013554838,0.0015596361,0.21756342],"genre_scores_gemma":[0.7441762,0.0021457109,0.1543544,0.00044663766,0.00041493707,0.00023798105,0.0018945233,0.0007302492,0.095599405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997061,0.00005710555,0.000010387541,0.00008134988,0.00008999331,0.000055062406],"domain_scores_gemma":[0.9973411,0.0017831578,0.000147008,0.0003759052,0.00012554934,0.00022729256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034009604,0.0005031797,0.00056717865,0.001159418,0.0010444655,0.0012507705,0.0009655967,0.0008736565,0.011610181],"category_scores_gemma":[0.0024330877,0.00074296404,0.0005823033,0.0018081245,0.00089164905,0.002569494,0.0013236488,0.0016665816,0.0009922619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023756125,0.00011315038,0.0012423483,0.00048929587,0.00007838632,0.00069620076,0.0005068848,0.03650208,0.025205577,0.8008368,0.024120547,0.10997112],"study_design_scores_gemma":[0.00005962321,0.000056973826,0.0015012629,0.000045442943,0.000045864133,0.0007844468,0.00019724085,0.068181865,0.007014319,0.8963404,0.025749229,0.000023402241],"about_ca_topic_score_codex":0.0005061161,"about_ca_topic_score_gemma":0.0011026779,"teacher_disagreement_score":0.011610181,"about_ca_system_score_codex":0.0004621278,"about_ca_system_score_gemma":0.00027869205,"threshold_uncertainty_score":0.038839936},"labels":[],"label_agreement":null},{"id":"W1579416261","doi":"10.1007/978-3-642-04268-3_64","title":"Image Guidance for Spinal Facet Injections Using Tracked Ultrasound","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Anesthesia and Pain Management","field":"Medicine","cited_by":43,"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; Robarts Clinical Trials","funders":"London Health Sciences Centre","keywords":"Guidance system; Medicine; Facet (psychology); Ultrasound; Augmented reality; Lumbar; Medical physics; Computer science; Radiology; Computer vision","score_opus":0.02802233730128719,"score_gpt":0.32096720860688116,"score_spread":0.292944871305594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579416261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21595392,0.018637002,0.7484072,0.001032427,0.00052110467,0.00034337994,0.0002580088,0.002225013,0.012621965],"genre_scores_gemma":[0.7814877,0.007153829,0.2059738,0.0007348839,0.00025617442,0.00015007702,0.000118320335,0.0002858823,0.0038393638],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996729,0.000068176436,0.00003273213,0.000046646484,0.00013039197,0.000049203853],"domain_scores_gemma":[0.9991154,0.0005230568,0.000117273405,0.000063347696,0.00013597247,0.000044867917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006901681,0.00041285696,0.00042570865,0.0009430297,0.00043140876,0.0012571322,0.0005258118,0.0009981666,0.0024152054],"category_scores_gemma":[0.003303524,0.00048017205,0.00049036986,0.00053405896,0.0004980146,0.0017036103,0.00068311975,0.00079446874,0.000731519],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001871384,0.00015304433,0.0066861096,0.00088894507,0.00009557423,0.002303605,0.00079297775,0.0067312694,0.3522,0.0015936325,0.0040975674,0.6225859],"study_design_scores_gemma":[0.0009951371,0.007033991,0.06616519,0.0013941707,0.0014420429,0.042303365,0.00078079506,0.28099042,0.53398335,0.00585422,0.05851236,0.0005449577],"about_ca_topic_score_codex":0.0077993996,"about_ca_topic_score_gemma":0.0078123994,"teacher_disagreement_score":0.0077993996,"about_ca_system_score_codex":0.0005589515,"about_ca_system_score_gemma":0.0014676438,"threshold_uncertainty_score":0.015507996},"labels":[],"label_agreement":null},{"id":"W1579420825","doi":"10.1007/11551201_15","title":"Time, Ownership and Awareness: The Value of Contextual Locations in the Home","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Knowledge management; Function (biology); Value (mathematics); Resource (disambiguation); Internet privacy; Human–computer interaction","score_opus":0.02997142164818655,"score_gpt":0.25902347540428117,"score_spread":0.2290520537560946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579420825","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.67462814,0.025263159,0.08127633,0.006113589,0.00048867747,0.000033937635,0.0006414863,0.00028776703,0.21126701],"genre_scores_gemma":[0.99147403,0.002084435,0.0034520235,0.00007869427,0.00007740171,0.000010065854,0.000055605502,0.000022637098,0.002745185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972266,0.00012147844,0.000009360438,0.00005223672,0.000054507927,0.000039766594],"domain_scores_gemma":[0.9988061,0.0007515818,0.00013651824,0.00012945566,0.00008320637,0.00009306699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034318154,0.0003230408,0.00025461745,0.00041888034,0.00050011894,0.0037938554,0.000635412,0.00077056815,0.003908254],"category_scores_gemma":[0.0030403214,0.00028541262,0.0002518064,0.00087701314,0.0017091946,0.0060137687,0.0013353531,0.00075881503,0.0002587943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017851491,0.00026064386,0.040437695,0.00045803198,0.0002173356,0.001664645,0.015310302,0.019537117,0.007136498,0.3478478,0.014251736,0.55109316],"study_design_scores_gemma":[0.000093504685,0.00046246682,0.0824483,0.0005697978,0.0005778498,0.0028376493,0.02954901,0.050971135,0.008009157,0.7504463,0.07382918,0.00020561078],"about_ca_topic_score_codex":0.0037510844,"about_ca_topic_score_gemma":0.0043414524,"teacher_disagreement_score":0.003908254,"about_ca_system_score_codex":0.00051339634,"about_ca_system_score_gemma":0.00035306546,"threshold_uncertainty_score":0.013074398},"labels":[],"label_agreement":null},{"id":"W1579425092","doi":"10.1007/11566489_49","title":"Anatomical and Electrophysiological Validation of an Atlas for Neurosurgical Planning","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Atlas (anatomy); Image warping; Computer science; Brain atlas; Artificial intelligence; Magnetic resonance imaging; Voxel; Surgical planning; Computer vision; Transformation (genetics); Medical physics; Radiology; Medicine; Anatomy","score_opus":0.021005771668629686,"score_gpt":0.3385896972668099,"score_spread":0.31758392559818016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579425092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35529923,0.0013674938,0.6256645,0.00064191566,0.0006197363,0.000299598,0.0025058016,0.0030658888,0.0105357515],"genre_scores_gemma":[0.8960709,0.0003264666,0.10072275,0.00010295118,0.00006756953,0.00009431002,0.0009467399,0.00036179973,0.0013065552],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999321,0.00022535509,0.00007140475,0.00008900357,0.00024030346,0.00005308537],"domain_scores_gemma":[0.9961689,0.0015868788,0.00020654582,0.00050057535,0.0013726645,0.00016449249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015257428,0.00051823974,0.0003578035,0.00093832077,0.0004939048,0.0015293347,0.00068272895,0.0007777702,0.0036016053],"category_scores_gemma":[0.009181167,0.00022693363,0.00041862766,0.00056303636,0.00062962115,0.00072931213,0.00064908987,0.0004880832,0.0010813407],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028951094,0.00022006428,0.056344636,0.0010505796,0.0004930548,0.003895888,0.0019007297,0.08059008,0.39631006,0.015006866,0.010037644,0.43125534],"study_design_scores_gemma":[0.00040387327,0.0014952514,0.11126859,0.00047189888,0.00090277725,0.017821897,0.0015136173,0.44611114,0.3580007,0.026082361,0.035625245,0.00030268737],"about_ca_topic_score_codex":0.0028499544,"about_ca_topic_score_gemma":0.0031008169,"teacher_disagreement_score":0.0036016053,"about_ca_system_score_codex":0.00048354454,"about_ca_system_score_gemma":0.0012626282,"threshold_uncertainty_score":0.012048602},"labels":[],"label_agreement":null},{"id":"W157944048","doi":"10.1007/978-3-319-07308-8_4","title":"Towards the Development of an Inter-cultural Scale to Measure Trust in Automation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automation; Computer science; Measure (data warehouse); Perception; Scale (ratio); Knowledge management; Curse of dimensionality; Data science; Human–computer interaction; Artificial intelligence; Psychology; Data mining; Engineering","score_opus":0.04151490881327523,"score_gpt":0.3328072765463854,"score_spread":0.2912923677331102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157944048","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.6643136,0.0012265535,0.279495,0.0020288483,0.00053856417,0.0024516205,0.0010076832,0.00042658154,0.04851149],"genre_scores_gemma":[0.7617974,0.00045052622,0.23104072,0.00031238826,0.000050314666,0.0018161618,0.0010774671,0.000086898646,0.0033680515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99421483,0.002875189,0.0006269127,0.00032248147,0.0017540415,0.00020648462],"domain_scores_gemma":[0.9770231,0.010907283,0.0017712425,0.0013765525,0.008101516,0.00082017836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010304862,0.0006906017,0.0004448135,0.0016956346,0.00090369344,0.003091768,0.001117047,0.00095408066,0.001477827],"category_scores_gemma":[0.02884553,0.0004308291,0.0011148588,0.0013961544,0.0010522623,0.0022665681,0.0024176924,0.0021619578,0.0006626636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033824472,0.00092458003,0.4087576,0.0003993224,0.0004742297,0.0002673045,0.013332102,0.0042693866,0.010873378,0.028778028,0.007376543,0.5242094],"study_design_scores_gemma":[0.00014308101,0.0020326488,0.79341245,0.0017426014,0.00044812303,0.0009927661,0.02071769,0.068966396,0.013023103,0.051252156,0.046905745,0.00036324802],"about_ca_topic_score_codex":0.0050739096,"about_ca_topic_score_gemma":0.008094312,"teacher_disagreement_score":0.010304862,"about_ca_system_score_codex":0.0014750529,"about_ca_system_score_gemma":0.0021236127,"threshold_uncertainty_score":0.054498017},"labels":[],"label_agreement":null},{"id":"W1579494035","doi":"10.1007/978-3-642-02882-3_24","title":"An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University","funders":"","keywords":"Tardiness; Due date; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Computer science; Retard; Mathematics; Medicine; Schedule; Operating system","score_opus":0.008460572796893736,"score_gpt":0.22713091961174045,"score_spread":0.2186703468148467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579494035","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.03933342,0.0011723695,0.9304324,0.0016306033,0.00044764255,0.0003092229,0.0010792199,0.0009793722,0.024615776],"genre_scores_gemma":[0.28610036,0.0013569649,0.6928146,0.0004841103,0.00034161902,0.00074770034,0.0012438139,0.00041795033,0.016492916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991406,0.00018166025,0.000038626753,0.0002135854,0.00022827667,0.00019714556],"domain_scores_gemma":[0.9985247,0.0010632452,0.00008094292,0.0001185126,0.00012482997,0.000087718865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580667,0.0015971839,0.002049367,0.0006879629,0.00070064067,0.002040005,0.0033795247,0.0024519628,0.006456435],"category_scores_gemma":[0.0037858044,0.0010103355,0.001868496,0.0013734337,0.0007336162,0.003094516,0.001515559,0.0041402527,0.000640988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005143833,0.00040522942,0.00043257995,0.00048864173,0.00014735264,0.00030314716,0.0001781789,0.73962826,0.0039958586,0.10628096,0.019190926,0.12843446],"study_design_scores_gemma":[0.0001830777,0.00011671771,0.000152918,0.000055613997,0.000059196725,0.00013678726,0.000045571996,0.9326455,0.0006391083,0.06198393,0.003958577,0.000022997136],"about_ca_topic_score_codex":0.0073981523,"about_ca_topic_score_gemma":0.0073810206,"teacher_disagreement_score":0.0073981523,"about_ca_system_score_codex":0.0026892805,"about_ca_system_score_gemma":0.0027784572,"threshold_uncertainty_score":0.021598935},"labels":[],"label_agreement":null},{"id":"W1579524345","doi":"10.1007/978-3-642-40131-2_18","title":"Stream Mining of Frequent Patterns from Delayed Batches of Uncertain Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Data stream mining; Computer science; STREAMS; Sliding window protocol; Data mining; Data stream; Fading; Scheme (mathematics); Real-time computing; Window (computing); Telecommunications; Channel (broadcasting); Computer network; World Wide Web","score_opus":0.04259723588468572,"score_gpt":0.2723441762423638,"score_spread":0.22974694035767806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579524345","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.22250852,0.002072148,0.76949203,0.0004762319,0.0002587959,0.00029600156,0.0027931533,0.0009635638,0.0011395299],"genre_scores_gemma":[0.6716497,0.0014192986,0.31872168,0.000080817386,0.00037716713,0.00022449788,0.0052645276,0.00008683043,0.0021753954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906546,0.000099428806,0.00012177869,0.0002234683,0.00040840654,0.000081482554],"domain_scores_gemma":[0.9950977,0.0031303326,0.00050493644,0.00042144084,0.0006909639,0.00015450163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015757948,0.00068860245,0.0012975131,0.0018384317,0.00046934257,0.0013471082,0.0015504254,0.0006724688,0.0009748877],"category_scores_gemma":[0.0071285022,0.0005041223,0.00096665113,0.0028983087,0.00029713212,0.001856709,0.00064389757,0.0010408469,0.00042196992],"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.002474084,0.00066669064,0.039736543,0.0010676755,0.0004916973,0.002329055,0.00055783516,0.13668597,0.02617373,0.012405188,0.008512135,0.7688995],"study_design_scores_gemma":[0.0000483171,0.00025033054,0.004088849,0.00005343693,0.0001133706,0.00068752223,0.0001413689,0.96779424,0.0073577072,0.017099572,0.0023441466,0.0000212419],"about_ca_topic_score_codex":0.0011759128,"about_ca_topic_score_gemma":0.0015898916,"teacher_disagreement_score":0.0018384317,"about_ca_system_score_codex":0.00037603354,"about_ca_system_score_gemma":0.0006872421,"threshold_uncertainty_score":0.008333743},"labels":[],"label_agreement":null},{"id":"W1579585272","doi":"10.1007/11935230_19","title":"Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":69,"is_retracted":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":"Ministry of Education and Human Resources Development","keywords":"Random oracle; Hash function; Padding; Computer science; MDC-2; Prefix; Ideal (ethics); Block cipher; Theoretical computer science; Double hashing; Cryptographic hash function; Discrete mathematics; Algorithm; Mathematics; Cryptography; Encryption; Computer security; Public-key cryptography; Philosophy","score_opus":0.012792181382167284,"score_gpt":0.2376381325575098,"score_spread":0.2248459511753425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579585272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.284655,0.0017217149,0.65914166,0.0026858065,0.00018227393,0.00018093361,0.00038597957,0.00057420525,0.05047244],"genre_scores_gemma":[0.9520333,0.00093032303,0.035373066,0.00034602912,0.0003872734,0.00015124392,0.0003044984,0.00015090966,0.010323352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933849,0.0016588907,0.0003066226,0.00070019066,0.0028679096,0.0010815598],"domain_scores_gemma":[0.97269934,0.018370086,0.0013849369,0.0045478977,0.0020825628,0.0009151821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007203586,0.0013236823,0.0013847201,0.0031316262,0.0022038699,0.0044813827,0.003928173,0.0026078383,0.008549373],"category_scores_gemma":[0.022782013,0.001053384,0.0018352335,0.0028457933,0.007107945,0.017347062,0.007468016,0.008403619,0.0015160578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028055612,0.000057500012,0.00052087446,0.00007805718,0.000021735581,0.00009300068,0.00026570045,0.010350917,0.0017656609,0.9760212,0.00087158213,0.009673322],"study_design_scores_gemma":[0.000030706586,0.00008000835,0.0002253059,0.00003424254,0.000030532545,0.00014857041,0.00007900168,0.08331714,0.0026352901,0.911951,0.0014362354,0.000031894368],"about_ca_topic_score_codex":0.00043578155,"about_ca_topic_score_gemma":0.00032146627,"teacher_disagreement_score":0.008549373,"about_ca_system_score_codex":0.0037952994,"about_ca_system_score_gemma":0.0019498653,"threshold_uncertainty_score":0.038096607},"labels":[],"label_agreement":null},{"id":"W1579661625","doi":"10.1007/11754008_8","title":"Towards the Testing of Composed Web Services in 3rd Generation Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Web service; Computer science; Web modeling; WS-Policy; Service-oriented architecture; Services computing; WS-Addressing; Business Process Execution Language; World Wide Web; Web development; Distributed computing; Web application security; Web intelligence","score_opus":0.019119923559747877,"score_gpt":0.22528332469462373,"score_spread":0.20616340113487586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579661625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122036375,0.00037052963,0.8677638,0.00050345383,0.00008328266,0.00022529917,0.00009625956,0.004151174,0.00476967],"genre_scores_gemma":[0.530581,0.0002665975,0.46319467,0.0002338645,0.00005227317,0.00017903179,0.00049685256,0.00091905723,0.0040767775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99068797,0.00415331,0.00056145876,0.0007935292,0.0031108037,0.0006928391],"domain_scores_gemma":[0.9763457,0.015852923,0.0007907558,0.0040300074,0.002428308,0.00055228826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005409311,0.0011256798,0.001142696,0.0012376433,0.00080439245,0.002794641,0.004243817,0.0030150153,0.0027698418],"category_scores_gemma":[0.027504062,0.0011747349,0.0017452063,0.00080882816,0.0029140217,0.0063521084,0.0031372341,0.0025102738,0.0006722516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016552898,0.0012887629,0.014036041,0.0009551136,0.0004084485,0.001532596,0.002226497,0.41135994,0.07670813,0.13126788,0.0065151574,0.3520461],"study_design_scores_gemma":[0.000067309964,0.00016822011,0.00069524813,0.00008157924,0.000060702987,0.0002697189,0.00018681797,0.8901116,0.03754615,0.06786306,0.00292121,0.000028357463],"about_ca_topic_score_codex":0.0045055,"about_ca_topic_score_gemma":0.004324534,"teacher_disagreement_score":0.005409311,"about_ca_system_score_codex":0.0014540858,"about_ca_system_score_gemma":0.0019490673,"threshold_uncertainty_score":0.028607547},"labels":[],"label_agreement":null},{"id":"W1579704031","doi":"10.1007/11552338_5","title":"User-Managed Access Control for Health Care Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Waterloo","funders":"","keywords":"Computer science; Access control; Health care; Control (management); Human–computer interaction; Computer security; Artificial intelligence","score_opus":0.022177127079510903,"score_gpt":0.3235539874301723,"score_spread":0.30137686035066136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579704031","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.012024076,0.007151994,0.92348176,0.002120673,0.00031082565,0.00015836173,0.000117671894,0.0017462166,0.052888446],"genre_scores_gemma":[0.68088204,0.007177521,0.2402795,0.0005492592,0.0007484813,0.0003517106,0.0003992688,0.00036465653,0.06924773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731344,0.00093457074,0.00018111407,0.00021146855,0.0011430944,0.00021633395],"domain_scores_gemma":[0.9972626,0.0014910446,0.0001638888,0.0006263763,0.00035183624,0.000104118946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070504,0.0005435738,0.00053645304,0.0007142809,0.000639854,0.00415561,0.001640223,0.0014004123,0.006467585],"category_scores_gemma":[0.005639119,0.0004537301,0.0005309132,0.0011421279,0.0014224926,0.004631219,0.0014016317,0.0018388308,0.0009895765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008806458,0.000085161926,0.0005295084,0.00027025823,0.000059617774,0.00016926428,0.001008064,0.0183673,0.0037415316,0.6987083,0.016791284,0.26018175],"study_design_scores_gemma":[0.00004386857,0.00018828372,0.0008426365,0.00023298967,0.00007566376,0.00064621854,0.00031386653,0.30485827,0.00848775,0.5358922,0.14834331,0.00007492109],"about_ca_topic_score_codex":0.0023642145,"about_ca_topic_score_gemma":0.0015987578,"teacher_disagreement_score":0.006467585,"about_ca_system_score_codex":0.0011299789,"about_ca_system_score_gemma":0.0010537113,"threshold_uncertainty_score":0.021636188},"labels":[],"label_agreement":null},{"id":"W1579705726","doi":"10.1007/3-540-47922-8_8","title":"The Task Rehearsal Method of Life-Long Learning: Overcoming Impoverished Data","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":127,"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; Acadia University","funders":"","keywords":"Computer science; Task (project management); Inductive bias; Multi-task learning; Artificial intelligence; Representation (politics); Artificial neural network; Domain knowledge; Recall; Inductive transfer; Machine learning; Domain (mathematical analysis); Cognitive psychology; Robot learning","score_opus":0.03726599607242419,"score_gpt":0.2864126542421482,"score_spread":0.24914665816972398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579705726","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.018740438,0.0002885208,0.97644037,0.00017111583,0.00008916249,0.00009427247,0.00005946462,0.0025862902,0.0015303816],"genre_scores_gemma":[0.30826747,0.0002823102,0.68195504,0.0003105562,0.00009215829,0.00031575662,0.00048169337,0.00073050515,0.007564501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897504,0.00045025971,0.00004789314,0.00024892256,0.00020667363,0.00007125903],"domain_scores_gemma":[0.99508554,0.0026932685,0.00018520953,0.0012406562,0.00059585215,0.00019954663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028980398,0.0006787058,0.00080467,0.0004158946,0.00045901968,0.0009229194,0.002655008,0.0009301002,0.0038128274],"category_scores_gemma":[0.009788445,0.00040778978,0.00037616532,0.00049209816,0.0006761366,0.002439862,0.0023664245,0.0021874176,0.0016632631],"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.00028822513,0.00031752783,0.00065542234,0.00014434344,0.00006135994,0.0000598193,0.00043621293,0.008297484,0.02089103,0.004080453,0.004765369,0.9600028],"study_design_scores_gemma":[0.0001284129,0.00065016287,0.0020539088,0.00005886621,0.00012037463,0.00041428595,0.00033951266,0.8884831,0.056774825,0.037561174,0.013333048,0.00008221089],"about_ca_topic_score_codex":0.001239908,"about_ca_topic_score_gemma":0.002281254,"teacher_disagreement_score":0.0038128274,"about_ca_system_score_codex":0.00025233056,"about_ca_system_score_gemma":0.0007408882,"threshold_uncertainty_score":0.01532644},"labels":[],"label_agreement":null},{"id":"W1579846797","doi":"10.1007/978-3-540-30184-4_7","title":"A Case-Based Reasoning Approach for Automated Management in Policy-Based Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Adaptation (eye); Network management; Software engineering; Quality of service; Architecture; Case-based reasoning; Distributed computing; Process management; Artificial intelligence; Computer network","score_opus":0.020454155679468837,"score_gpt":0.2897232766870883,"score_spread":0.26926912100761946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579846797","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.0020530461,0.00015636395,0.9902598,0.0007529508,0.00005005095,0.0003002232,0.0002361631,0.0008843676,0.0053068763],"genre_scores_gemma":[0.03893848,0.00021316626,0.95799136,0.00014910255,0.000039827984,0.00025341584,0.0004361084,0.00007180854,0.0019066961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942694,0.0020581912,0.0007990706,0.00072603015,0.001816633,0.00033059754],"domain_scores_gemma":[0.9909763,0.0067056217,0.00038609043,0.0010061418,0.0006763534,0.00024962318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063236672,0.001605618,0.0015139824,0.0042848294,0.0027030911,0.0073628766,0.006718212,0.0033688964,0.014043265],"category_scores_gemma":[0.015088309,0.0016054438,0.003369255,0.0030911681,0.003624703,0.009468408,0.004508643,0.0033010934,0.0017617581],"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.00021413488,0.000670586,0.0013336996,0.0005660056,0.0002718121,0.0018654953,0.0015894787,0.15467499,0.0034628327,0.611545,0.015698498,0.2081074],"study_design_scores_gemma":[0.00008560476,0.00003450594,0.00018138973,0.00013549041,0.00014109412,0.00050049834,0.00034312563,0.5316123,0.0028271973,0.44457364,0.019501656,0.00006363996],"about_ca_topic_score_codex":0.01314723,"about_ca_topic_score_gemma":0.014145869,"teacher_disagreement_score":0.014043265,"about_ca_system_score_codex":0.002304214,"about_ca_system_score_gemma":0.0026626165,"threshold_uncertainty_score":0.046979427},"labels":[],"label_agreement":null},{"id":"W1579890920","doi":"10.1007/978-3-540-39611-6_27","title":"Cartesian Ad Hoc Routing Protocols","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Dalhousie University","funders":"","keywords":"Connectionless communication; Computer science; Computer network; Wireless ad hoc network; Flooding (psychology); Bandwidth (computing); Routing protocol; Power consumption; Distributed computing; Optimized Link State Routing Protocol; Routing (electronic design automation); Power (physics); Wireless; Network packet; Telecommunications","score_opus":0.018302680160935895,"score_gpt":0.2591549466044496,"score_spread":0.2408522664435137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579890920","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.008741451,0.016393358,0.69812214,0.0009169857,0.0022650065,0.00032359647,0.0005784139,0.004122709,0.26853633],"genre_scores_gemma":[0.18161012,0.026225984,0.46756387,0.0004806326,0.0009036484,0.0004791845,0.002737579,0.0006803438,0.31931865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972314,0.000044832574,0.000023331902,0.00005242774,0.00013354889,0.000022689037],"domain_scores_gemma":[0.99958175,0.000085384345,0.000026199677,0.00016877714,0.00011601919,0.000021788304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018115,0.00066064385,0.00044093566,0.00086416054,0.0006567089,0.0013072422,0.0007139539,0.00044489576,0.013336444],"category_scores_gemma":[0.00089864805,0.00038165067,0.00019974589,0.0015053126,0.00067302916,0.0015145944,0.0012541972,0.0007687935,0.0066169566],"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.00007084668,0.00003949229,0.00016481586,0.00051635166,0.000019986634,0.00010049791,0.0002921098,0.005917797,0.0062938593,0.53157043,0.052497633,0.40251622],"study_design_scores_gemma":[0.000024822197,0.00012857148,0.00027915652,0.0001689291,0.00004698128,0.0007405636,0.00012636263,0.020971732,0.0058927643,0.2126924,0.7588932,0.00003440412],"about_ca_topic_score_codex":0.00046974313,"about_ca_topic_score_gemma":0.0008940967,"teacher_disagreement_score":0.013336444,"about_ca_system_score_codex":0.00043054108,"about_ca_system_score_gemma":0.00057270785,"threshold_uncertainty_score":0.04461485},"labels":[],"label_agreement":null},{"id":"W1579900930","doi":"10.1007/11676959_9","title":"A Generative Model of Dense Optical Flow in Layers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Toronto","funders":"","keywords":"Computer science; Generative model; Representation (politics); Optical flow; Interpolation (computer graphics); Inference; Generative grammar; Probabilistic logic; Flow (mathematics); Frame (networking); Algorithm; Inverse; Artificial intelligence; Motion (physics); Motion interpolation; Inverse problem; Computer vision; Image (mathematics); Mathematics; Geometry; Object (grammar); Mathematical analysis; Block-matching algorithm","score_opus":0.020434828096519878,"score_gpt":0.26478872301202155,"score_spread":0.2443538949155017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579900930","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.008379277,0.00029023486,0.9879023,0.00031718018,0.00005859806,0.000032687254,0.00028592822,0.0005250049,0.0022088974],"genre_scores_gemma":[0.61829567,0.0015282449,0.3524109,0.0005240777,0.00031119457,0.00035702751,0.0011053595,0.0010561178,0.024411423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954647,0.00014499619,0.000019886267,0.00012895282,0.00009710698,0.00006256993],"domain_scores_gemma":[0.99808633,0.001185589,0.00017268358,0.00024789528,0.00019419983,0.00011342936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012665048,0.0009179053,0.0011343262,0.001435282,0.000735467,0.002114865,0.0029364172,0.0026049998,0.0054966803],"category_scores_gemma":[0.0051042913,0.002336694,0.0019756067,0.0020268317,0.0016576706,0.0029816478,0.002116643,0.002857811,0.0012154978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061478306,0.000031672374,0.00059403636,0.000075899574,0.000055321478,0.00012247695,0.00018537525,0.77956605,0.0017358714,0.19213389,0.0022891737,0.023148715],"study_design_scores_gemma":[0.000008268581,0.0000058731516,0.00006995801,0.000010114505,0.000010287973,0.000032394113,0.00000650812,0.9539276,0.00021037491,0.04510084,0.0006071097,0.000010805058],"about_ca_topic_score_codex":0.015333327,"about_ca_topic_score_gemma":0.01798621,"teacher_disagreement_score":0.015333327,"about_ca_system_score_codex":0.001795162,"about_ca_system_score_gemma":0.0012119152,"threshold_uncertainty_score":0.030488133},"labels":[],"label_agreement":null},{"id":"W1579920339","doi":"10.1007/978-3-540-24840-8_50","title":"An Algorithm for Anaphora Resolution in Aviation Safety Reports","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Anaphora (linguistics); Aviation; Resolution (logic); Computer science; Aviation safety; Algorithm; Engineering; Artificial intelligence; Aerospace engineering","score_opus":0.010734819343064098,"score_gpt":0.2697041559693742,"score_spread":0.2589693366263101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579920339","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.0077831554,0.00029332953,0.98053163,0.00037839738,0.000095212534,0.00031751802,0.00044113857,0.006650356,0.0035092437],"genre_scores_gemma":[0.03433599,0.00012384783,0.9608998,0.000092793845,0.000041111256,0.00016923665,0.0007973027,0.00030923614,0.0032308025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981224,0.00041458855,0.0002455836,0.00048124974,0.0005850498,0.00015113209],"domain_scores_gemma":[0.9968645,0.0017139163,0.00014317385,0.00039711292,0.0008089411,0.00007235023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023077882,0.0011096372,0.0015538578,0.0035496356,0.0023484218,0.005032514,0.0028179865,0.0030629407,0.018096497],"category_scores_gemma":[0.0069045178,0.0010337392,0.0014882081,0.0031562587,0.0009277452,0.0050233873,0.0027647507,0.001746249,0.006592017],"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.0005140981,0.00023108286,0.00084784016,0.00035642422,0.00008465208,0.00012558463,0.00033552258,0.014131155,0.009366044,0.030607175,0.0172578,0.9261427],"study_design_scores_gemma":[0.00039237193,0.0001842776,0.0010214755,0.00014572554,0.00025703953,0.00060903165,0.000510103,0.82028425,0.032807805,0.10685967,0.03684357,0.00008474939],"about_ca_topic_score_codex":0.0031497707,"about_ca_topic_score_gemma":0.004154551,"teacher_disagreement_score":0.018096497,"about_ca_system_score_codex":0.0015575456,"about_ca_system_score_gemma":0.0025139004,"threshold_uncertainty_score":0.06053883},"labels":[],"label_agreement":null},{"id":"W1579947540","doi":"10.1007/978-3-540-30198-1_46","title":"Multi-objective Genetic Algorithm Based Clustering Approach and Its Application to Gene Expression Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Calgary","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Determining the number of clusters in a data set; Set (abstract data type); Ranking (information retrieval); A priori and a posteriori; Multi-objective optimization; Correlation clustering; Clustering high-dimensional data; Genetic algorithm; Algorithm; CURE data clustering algorithm; Artificial intelligence; Machine learning","score_opus":0.025049579483503354,"score_gpt":0.2714660126126339,"score_spread":0.24641643312913056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579947540","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.011640931,0.0003769973,0.98632216,0.00009699327,0.000038888676,0.000044489585,0.00007646349,0.0006716453,0.00073144754],"genre_scores_gemma":[0.071655765,0.00040566223,0.9250979,0.000046378274,0.000025279043,0.00017017146,0.0002385154,0.00018808531,0.0021721695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994592,0.00018018697,0.000034131233,0.0001096471,0.00018901215,0.000027973252],"domain_scores_gemma":[0.99900275,0.0005413566,0.00005723335,0.00006046027,0.00031332334,0.000024859979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014294725,0.00095818995,0.0012207313,0.0019914052,0.0008559219,0.00094931334,0.0013997743,0.0013557504,0.0013435821],"category_scores_gemma":[0.0024806338,0.00055184896,0.0013203745,0.0034430628,0.00045729787,0.00068990537,0.0006941305,0.001150203,0.00056294777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013113375,0.0001434085,0.0010427645,0.00020140155,0.00019672539,0.00016136035,0.00020547885,0.5888147,0.011243099,0.0067233643,0.00258915,0.38854745],"study_design_scores_gemma":[0.000005311757,0.000019792455,0.0004911345,0.000005778133,0.00001651186,0.000044881705,0.00001619436,0.99575764,0.001330894,0.0017430322,0.0005547306,0.000014069876],"about_ca_topic_score_codex":0.011064383,"about_ca_topic_score_gemma":0.008946748,"teacher_disagreement_score":0.011064383,"about_ca_system_score_codex":0.00081750774,"about_ca_system_score_gemma":0.0009327679,"threshold_uncertainty_score":0.021999955},"labels":[],"label_agreement":null},{"id":"W158006909","doi":"10.1007/978-3-642-31537-4_45","title":"Machine Learning-Based Classification of Encrypted Internet Traffic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; The Internet; Artificial intelligence; Traffic classification; Internet traffic; World Wide Web; Computer network","score_opus":0.018783819368302316,"score_gpt":0.23667923364446491,"score_spread":0.2178954142761626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158006909","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.6076751,0.00048268927,0.38607505,0.00025991027,0.0001805752,0.00010278116,0.00030149426,0.000878249,0.004044135],"genre_scores_gemma":[0.9578536,0.00017162584,0.038707525,0.00002578839,0.00006894378,0.000027535712,0.00051925116,0.000027760041,0.002597903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00012813312,0.0000413774,0.00007314018,0.00016280895,0.00008781854],"domain_scores_gemma":[0.9985421,0.0007191874,0.000116080584,0.00014165125,0.00044241245,0.000038551814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010148687,0.00041538765,0.00054152956,0.0013304955,0.00026742136,0.00088915817,0.00062163954,0.0005727761,0.0008936789],"category_scores_gemma":[0.0029506343,0.00015064079,0.00043083672,0.0007606742,0.00025418136,0.00091352157,0.00038142153,0.00059366034,0.00052677526],"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.0008806591,0.0005449681,0.017887918,0.00009642496,0.00011277499,0.00017337169,0.000094368675,0.2949525,0.020548165,0.0062655527,0.0029026186,0.6555407],"study_design_scores_gemma":[0.0000029067337,0.000024063094,0.0010656099,0.0000026924638,0.000006614884,0.000033747958,0.000008762077,0.99409264,0.0035406642,0.0010509411,0.00016760717,0.000003828153],"about_ca_topic_score_codex":0.0011784672,"about_ca_topic_score_gemma":0.0008622499,"teacher_disagreement_score":0.0013304955,"about_ca_system_score_codex":0.0005724451,"about_ca_system_score_gemma":0.00034337348,"threshold_uncertainty_score":0.0053672194},"labels":[],"label_agreement":null},{"id":"W1580081356","doi":"10.1007/11783596_3","title":"Aspects and Data Refinement","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Programming language; Compiler; Data structure; Compile time; Theoretical computer science","score_opus":0.05386307499404696,"score_gpt":0.29983322223533115,"score_spread":0.2459701472412842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580081356","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.0065683336,0.0042082677,0.9203383,0.0025863438,0.00036790466,0.00012218443,0.00028448724,0.0019808752,0.06354333],"genre_scores_gemma":[0.20334531,0.007173342,0.7072369,0.0015914094,0.0005991326,0.00034594588,0.0016394001,0.0030496356,0.075018995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960204,0.0010476353,0.00046926126,0.0006706989,0.0015761614,0.00021587449],"domain_scores_gemma":[0.99406415,0.002296316,0.00016057912,0.0026514719,0.00073621445,0.00009127665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004093906,0.0008893234,0.001020862,0.0019014549,0.0012863968,0.003837947,0.0019162091,0.00092762086,0.009366954],"category_scores_gemma":[0.01236421,0.0013517947,0.0017287971,0.0030419438,0.004665282,0.009747632,0.0050919564,0.004442127,0.002694874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003358217,0.000013749417,0.00045508033,0.00018366017,0.000023170249,0.000091794755,0.0010346227,0.000937528,0.0009979561,0.8457886,0.0077289576,0.14271145],"study_design_scores_gemma":[0.000013581569,0.000015312107,0.00018538142,0.000101460486,0.00004410882,0.00027884397,0.00020970296,0.0038626713,0.0029500157,0.82492,0.1674036,0.000015272482],"about_ca_topic_score_codex":0.0023802232,"about_ca_topic_score_gemma":0.0018839622,"teacher_disagreement_score":0.009366954,"about_ca_system_score_codex":0.0011925686,"about_ca_system_score_gemma":0.001132911,"threshold_uncertainty_score":0.031335592},"labels":[],"label_agreement":null},{"id":"W1580093937","doi":"10.1007/3-540-44593-5_53","title":"Mining High-Quality Cases for Hypertext Prediction and Prefetching","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Hypertext; Quality (philosophy); Parallel computing; Data mining; Operating system","score_opus":0.04131834674854457,"score_gpt":0.28565945320756153,"score_spread":0.24434110645901697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580093937","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.6434335,0.0031052365,0.31273043,0.0025032214,0.00033751203,0.0009097043,0.015427266,0.014040837,0.0075123115],"genre_scores_gemma":[0.77054787,0.00066320953,0.20808081,0.00020049963,0.00031202481,0.00022105455,0.0156104695,0.00054721965,0.0038168316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976146,0.00025734297,0.00028317963,0.00042091074,0.0011629224,0.00026099302],"domain_scores_gemma":[0.9887404,0.0055770855,0.0009787539,0.0019997896,0.0021619573,0.0005420402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434627,0.0011709655,0.0011617739,0.007682374,0.0011274215,0.0023062804,0.002238197,0.0019171943,0.004666166],"category_scores_gemma":[0.018989155,0.00077311264,0.0011254648,0.005735299,0.0007857288,0.0037206747,0.0011626441,0.0013515423,0.002477853],"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.0015647208,0.0010321137,0.20330647,0.000695204,0.00025091905,0.004114007,0.00054954085,0.044124298,0.030179529,0.005608153,0.052261923,0.65631306],"study_design_scores_gemma":[0.00015542768,0.00030572244,0.022493687,0.00014241113,0.000348733,0.0033775321,0.0006299743,0.88757133,0.043854777,0.029831516,0.01121757,0.00007122169],"about_ca_topic_score_codex":0.0043449453,"about_ca_topic_score_gemma":0.009242094,"teacher_disagreement_score":0.007682374,"about_ca_system_score_codex":0.00055217464,"about_ca_system_score_gemma":0.000957741,"threshold_uncertainty_score":0.01560992},"labels":[],"label_agreement":null},{"id":"W1580114946","doi":"10.1007/978-3-642-05445-7_13","title":"Differential Fault Analysis of Rabbit","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Stream cipher; Initialization; Parallel computing; Cipher; Algorithm; Byte; Fault (geology); Cryptography; Computer hardware; Computer network; Programming language; Encryption","score_opus":0.01620402093800464,"score_gpt":0.27131964388447216,"score_spread":0.2551156229464675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580114946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3988309,0.0015770611,0.57051915,0.00086075795,0.00029327234,0.00006789369,0.00021743828,0.0016822923,0.025951339],"genre_scores_gemma":[0.9715748,0.00017315912,0.021815164,0.00009196473,0.000061262246,0.000019042316,0.00010858282,0.00009371241,0.006062288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987985,0.00019267255,0.00007014808,0.000209354,0.0005450433,0.00018430411],"domain_scores_gemma":[0.99730587,0.0009987771,0.00030791303,0.00079888577,0.00051167316,0.00007685737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007087016,0.00039521937,0.00076009275,0.0012562601,0.0005432529,0.0011044156,0.00095157954,0.0007822273,0.0026888254],"category_scores_gemma":[0.0052319705,0.00024280259,0.00059438165,0.0009369981,0.0012758633,0.0022765303,0.0013470338,0.0008969051,0.0004827793],"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.00073006086,0.00007578227,0.006016343,0.00025749535,0.00009833898,0.000773295,0.0005482466,0.08751251,0.040471394,0.7367429,0.0045097386,0.122263834],"study_design_scores_gemma":[0.000028452123,0.00022953318,0.002059117,0.00006282675,0.000074588264,0.00088392093,0.00008868479,0.43094873,0.03422872,0.52531284,0.006033433,0.00004918759],"about_ca_topic_score_codex":0.0005105892,"about_ca_topic_score_gemma":0.0005221922,"teacher_disagreement_score":0.0026888254,"about_ca_system_score_codex":0.0011125369,"about_ca_system_score_gemma":0.0005361721,"threshold_uncertainty_score":0.008994997},"labels":[],"label_agreement":null},{"id":"W1580125762","doi":"10.1007/978-3-540-69733-6_65","title":"A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 New Brunswick","funders":"","keywords":"Job shop scheduling; Upper and lower bounds; Norm (philosophy); Scheduling (production processes); Computer science; Regular polygon; Mathematical optimization; Competitive analysis; Combinatorics; Algorithm; Discrete mathematics; Mathematics","score_opus":0.01794009135289408,"score_gpt":0.23399008508269104,"score_spread":0.21604999372979694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580125762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01121356,0.0044304724,0.9527542,0.0025753386,0.0010206358,0.0001740305,0.0004501472,0.00092243793,0.026459321],"genre_scores_gemma":[0.3707432,0.0062258733,0.57489884,0.0026231448,0.0032107963,0.0015667337,0.0016967448,0.0021896178,0.03684498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929147,0.0024008215,0.00023270302,0.00077925355,0.0025592928,0.0011133045],"domain_scores_gemma":[0.9757001,0.01723081,0.0009715425,0.001875057,0.00278476,0.0014376868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077393013,0.0048010414,0.004081141,0.0027854089,0.0017713459,0.0060694017,0.0077607855,0.004144714,0.011239176],"category_scores_gemma":[0.027885316,0.0013013856,0.0020310527,0.0034160241,0.0031416842,0.0070715956,0.0050515337,0.011927479,0.002615792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015589484,0.0008028339,0.00069895445,0.0011426479,0.00022357873,0.00023924424,0.00035256386,0.5033678,0.010630579,0.2882888,0.036900196,0.15579383],"study_design_scores_gemma":[0.00003162701,0.00016836407,0.0002250772,0.000092406204,0.000042892014,0.00008335143,0.00004049804,0.91402245,0.001750272,0.08029907,0.0032162035,0.000027892005],"about_ca_topic_score_codex":0.0025109332,"about_ca_topic_score_gemma":0.0025749002,"teacher_disagreement_score":0.011239176,"about_ca_system_score_codex":0.004960249,"about_ca_system_score_gemma":0.0042615477,"threshold_uncertainty_score":0.040929854},"labels":[],"label_agreement":null},{"id":"W1580134275","doi":"10.1007/978-3-540-78743-3_20","title":"A Domain Analysis to Specify Design Defects and Generate Detection Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Domain (mathematical analysis); Template; Process (computing); Algorithm; Precision and recall; Domain analysis; Quality (philosophy); Software; Programming language; Data mining; Artificial intelligence; Software system; Software construction","score_opus":0.02386372752955233,"score_gpt":0.24852376944357105,"score_spread":0.22466004191401873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580134275","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.0010695393,0.00003229053,0.9958752,0.0000448493,0.000011407808,0.00007501281,0.00013299388,0.0016437588,0.0011149357],"genre_scores_gemma":[0.035955474,0.0001897031,0.95941967,0.00011638063,0.000027329532,0.00023303057,0.0008910474,0.0008303021,0.0023370893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998016,0.0004780349,0.00020512159,0.00031348466,0.00082867884,0.00015867931],"domain_scores_gemma":[0.9945437,0.0030483077,0.00026489867,0.0009675277,0.0011100994,0.00006551732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020005552,0.0022325772,0.0011451402,0.0031300026,0.0009768179,0.002389151,0.0018753409,0.0017048424,0.0069089727],"category_scores_gemma":[0.007890726,0.0013620328,0.0038625617,0.0014061307,0.0011112817,0.002676737,0.0017431041,0.003106007,0.0037485694],"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.00017074974,0.00041264063,0.0027416763,0.0011440447,0.00019854851,0.0008204226,0.00056528347,0.23859233,0.040127523,0.20954928,0.019917423,0.48576],"study_design_scores_gemma":[0.00004482862,0.000095619514,0.00037465928,0.00024125601,0.00013470014,0.00057508436,0.00015439384,0.81350696,0.0329066,0.12647463,0.025437897,0.000053350464],"about_ca_topic_score_codex":0.0022226782,"about_ca_topic_score_gemma":0.002777432,"teacher_disagreement_score":0.0069089727,"about_ca_system_score_codex":0.0009467436,"about_ca_system_score_gemma":0.0019620836,"threshold_uncertainty_score":0.023112833},"labels":[],"label_agreement":null},{"id":"W1580157616","doi":"10.1007/978-3-540-27821-4_16","title":"Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Binary logarithm; Radio networks; Graph; Computer science; Time complexity; Scheme (mathematics); Radio broadcasting; Log-log plot; Node (physics); Algorithm; Approximation algorithm; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Computer network; Wireless network; Telecommunications; Wireless; Physics","score_opus":0.03979449247252133,"score_gpt":0.27990688521995233,"score_spread":0.240112392747431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580157616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0435704,0.0013793056,0.9433092,0.00047480615,0.0000920033,0.00005897776,0.00017090049,0.0005463066,0.010398099],"genre_scores_gemma":[0.8950964,0.0020505914,0.090781696,0.0001498934,0.00017637185,0.00022912257,0.00029055652,0.00018373822,0.011041585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986504,0.00045332732,0.00005654138,0.0002757711,0.0003675777,0.00019634185],"domain_scores_gemma":[0.99413884,0.0043836697,0.0003721145,0.0005757978,0.000378456,0.00015122691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331902,0.000591734,0.0015657904,0.000709854,0.00092277036,0.0016613932,0.0023738085,0.0011590801,0.0017128518],"category_scores_gemma":[0.0068588844,0.0009769412,0.0005413412,0.0016274685,0.0014235413,0.0017322255,0.0013775784,0.0012121606,0.00040070142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016170948,0.000040444764,0.00033493823,0.00020546872,0.000034917342,0.000079350975,0.00010743754,0.84859073,0.0030092022,0.1166396,0.0030157077,0.027780475],"study_design_scores_gemma":[0.000030935826,0.000023169308,0.00014347836,0.000011317489,0.000018862582,0.000038522,0.00002086906,0.92355484,0.0007486427,0.07433668,0.0010588858,0.000013766995],"about_ca_topic_score_codex":0.0029006647,"about_ca_topic_score_gemma":0.004955645,"teacher_disagreement_score":0.0029006647,"about_ca_system_score_codex":0.0023237648,"about_ca_system_score_gemma":0.0015685435,"threshold_uncertainty_score":0.016860127},"labels":[],"label_agreement":null},{"id":"W1580192808","doi":"10.1007/978-3-642-05151-7_5","title":"A Synergy between Static and Dynamic Analysis for the Detection of Software Security Vulnerabilities","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Static analysis; Vulnerability (computing); Software security assurance; Vulnerability management; Vulnerability assessment; Control flow graph; Symbolic execution; Software; Computer security; Security analysis; Secure coding; Key (lock); Generator (circuit theory); Security testing; Information security; Programming language; Security information and event management; Security service; Operating system; Cloud computing; Cloud computing security","score_opus":0.014835437827803308,"score_gpt":0.2724506335372322,"score_spread":0.25761519570942887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580192808","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.015667226,0.0018137894,0.96636003,0.00042912457,0.00011722252,0.00009849507,0.00018240645,0.005415357,0.009916388],"genre_scores_gemma":[0.265664,0.0014763756,0.72593087,0.000274275,0.0001506798,0.00010274048,0.00040454083,0.00071389246,0.005282594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721897,0.0005783813,0.0001277344,0.00045975027,0.0014255737,0.0001895217],"domain_scores_gemma":[0.9950895,0.0027665726,0.00029367034,0.0010028351,0.00071662077,0.00013083745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223905,0.0013015425,0.0014131792,0.0050009936,0.00060226116,0.0025144888,0.0014724911,0.0010566823,0.003761216],"category_scores_gemma":[0.005699078,0.0010585326,0.001250964,0.0027262592,0.0012314469,0.0038842626,0.003079182,0.0017607388,0.0020224631],"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.00028694887,0.00028892953,0.003689312,0.00036500682,0.00021097956,0.00027246648,0.00027182075,0.02336415,0.06117972,0.03382515,0.0063364105,0.86990917],"study_design_scores_gemma":[0.000052716103,0.00035925797,0.0046378425,0.00023134798,0.00036851907,0.0014176972,0.00018982259,0.78246224,0.043378357,0.14662409,0.020112041,0.00016596854],"about_ca_topic_score_codex":0.0011600207,"about_ca_topic_score_gemma":0.002029281,"teacher_disagreement_score":0.0050009936,"about_ca_system_score_codex":0.0005942842,"about_ca_system_score_gemma":0.0010025372,"threshold_uncertainty_score":0.012582481},"labels":[],"label_agreement":null},{"id":"W1580193011","doi":"10.1007/978-3-540-45087-0_45","title":"Localization Estimation Algorithm (LEA): A Supervised Prior-Based Approach for Solving the EEG/MEG Inverse Problem","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Université de Montréal","funders":"","keywords":"Prior probability; Magnetoencephalography; Inverse problem; Computer science; Regularization (linguistics); Algorithm; Inverse; Electroencephalography; Norm (philosophy); Consistency (knowledge bases); Artificial intelligence; Mathematical optimization; Applied mathematics; Pattern recognition (psychology); Mathematics; Bayesian probability","score_opus":0.019426433916703897,"score_gpt":0.28965966826605033,"score_spread":0.27023323434934643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580193011","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.00074208394,0.00006955906,0.9984119,0.000044302138,0.0000088450115,0.000010703893,0.000016491862,0.0005403336,0.00015580855],"genre_scores_gemma":[0.035375826,0.00018438307,0.9616883,0.00015194662,0.000050110117,0.00016841348,0.00020392574,0.0002156703,0.001961416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940693,0.00018885938,0.000028917013,0.00014969743,0.00018142987,0.000044156972],"domain_scores_gemma":[0.9991334,0.00039383603,0.00009911933,0.000106195825,0.00022541037,0.00004197265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126383,0.0010530134,0.0012783691,0.0010807635,0.00063128496,0.00093788235,0.0016542083,0.0018154979,0.0034372692],"category_scores_gemma":[0.0031224876,0.00072453264,0.0010363533,0.0008485921,0.0006257405,0.0014799103,0.001652826,0.0022599977,0.0027892855],"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.00017668633,0.00015290374,0.00070431095,0.00017844525,0.00013927805,0.00011905667,0.00013568552,0.13057527,0.025512626,0.01090567,0.008416177,0.82298386],"study_design_scores_gemma":[0.000049605555,0.00006383904,0.00053542457,0.000026293881,0.00003619787,0.00015656318,0.000026136577,0.97567946,0.0087242285,0.0074551105,0.0072140777,0.000033001812],"about_ca_topic_score_codex":0.002659568,"about_ca_topic_score_gemma":0.00473752,"teacher_disagreement_score":0.0034372692,"about_ca_system_score_codex":0.00035945533,"about_ca_system_score_gemma":0.0014915208,"threshold_uncertainty_score":0.011498868},"labels":[],"label_agreement":null},{"id":"W1580342420","doi":"10.1007/978-3-642-15696-0_57","title":"Curvelet Entropy for Facial Expression Recognition","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Curvelet; Artificial intelligence; Computer science; Pattern recognition (psychology); Facial expression; Entropy (arrow of time); Wavelet; Face (sociological concept); Computer vision; Facial recognition system; Orientation (vector space); Gabor wavelet; Wavelet transform; Mathematics; Discrete wavelet transform; Physics","score_opus":0.02358156096880048,"score_gpt":0.2545956949735735,"score_spread":0.231014134004773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580342420","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.0082398895,0.0023770363,0.9834237,0.00016329644,0.00020018741,0.000030059673,0.00023990161,0.0008828051,0.004443123],"genre_scores_gemma":[0.38683414,0.008697383,0.56142646,0.00020365314,0.0011375934,0.00021795141,0.0020238159,0.00088076503,0.038578223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999734,0.00004882854,0.000013446122,0.00003579404,0.00015140887,0.000016515922],"domain_scores_gemma":[0.9995763,0.00021489877,0.000019967265,0.00008202035,0.00009193828,0.000014789628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047411522,0.00048884284,0.000721382,0.000875675,0.00019864299,0.00064101303,0.0005037961,0.0004200988,0.005054415],"category_scores_gemma":[0.0013108824,0.00019961527,0.0002678521,0.0012254845,0.00041039052,0.0011236266,0.0005471363,0.0008642335,0.0018080642],"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.00009436012,0.000053447664,0.00038431483,0.00014125969,0.000027114076,0.000074310396,0.00005070477,0.05991469,0.029213138,0.05273989,0.011852523,0.84545416],"study_design_scores_gemma":[0.0000066588423,0.000052194002,0.0014895918,0.000029942466,0.000015386597,0.00018871417,0.000016799326,0.92085177,0.023822289,0.04108948,0.01240526,0.00003191435],"about_ca_topic_score_codex":0.0005641615,"about_ca_topic_score_gemma":0.00048068652,"teacher_disagreement_score":0.005054415,"about_ca_system_score_codex":0.00040600318,"about_ca_system_score_gemma":0.00026913508,"threshold_uncertainty_score":0.016908705},"labels":[],"label_agreement":null},{"id":"W1580566120","doi":"10.1007/978-3-540-30474-6_29","title":"Leveraging Public Resource Pools to Improve the Service Compliances of Computing Utilities","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"McGill University","funders":"","keywords":"Computer science; Service-level agreement; Revenue; Service level; Profit (economics); Outsourcing; Utility computing; Service (business); Cloud computing; Environmental economics; Operations research; Business; Finance; Operating system; Microeconomics; Marketing","score_opus":0.034363803558299814,"score_gpt":0.2527512782961401,"score_spread":0.21838747473784026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580566120","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.51429987,0.00039307232,0.46369934,0.0016448798,0.00014226066,0.00031881247,0.00015252607,0.0036919268,0.01565727],"genre_scores_gemma":[0.9694873,0.000067790665,0.028190723,0.000103989165,0.00004372872,0.000085641834,0.000103862694,0.00025263164,0.0016644312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98657155,0.0056608613,0.00083166227,0.0016940719,0.0031689932,0.0020728884],"domain_scores_gemma":[0.95968956,0.016270282,0.0038091363,0.014101806,0.0048956154,0.0012335366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016889384,0.0007999727,0.0018390233,0.0016078103,0.0025267187,0.0047496967,0.0027995969,0.001622984,0.005150878],"category_scores_gemma":[0.06143635,0.0010217354,0.00087017834,0.0025930838,0.0016793316,0.009881255,0.0052521457,0.0030807687,0.0010543896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023049344,0.0019779962,0.020905087,0.00029573397,0.00024782657,0.0005353685,0.0018558291,0.3853391,0.041104015,0.16370504,0.008703636,0.37302545],"study_design_scores_gemma":[0.000120237535,0.00048100424,0.003256847,0.000048409052,0.00012595211,0.00018075768,0.0006002765,0.84956014,0.02820134,0.11079759,0.006559678,0.00006774872],"about_ca_topic_score_codex":0.0022592098,"about_ca_topic_score_gemma":0.002319015,"teacher_disagreement_score":0.016889384,"about_ca_system_score_codex":0.0022719447,"about_ca_system_score_gemma":0.005508221,"threshold_uncertainty_score":0.08932066},"labels":[],"label_agreement":null},{"id":"W1580645447","doi":"10.1007/978-3-642-15384-6_44","title":"Improving Communication Using 3D Animation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Animation; XML; Lift (data mining); Process (computing); Set (abstract data type); Pipeline (software); Multimedia; Database; Computer graphics (images); World Wide Web; Programming language; Data mining","score_opus":0.01759901403166653,"score_gpt":0.2481093351883181,"score_spread":0.23051032115665157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580645447","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.015370357,0.00069205073,0.94013864,0.000421336,0.0005098074,0.00007345767,0.00019857723,0.00866925,0.033926543],"genre_scores_gemma":[0.38506755,0.0018424094,0.54356194,0.0003254129,0.00038814894,0.00033313732,0.0009193011,0.0026071032,0.064954974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991418,0.00023738496,0.000043498214,0.00010025051,0.00037166255,0.000105403444],"domain_scores_gemma":[0.99724567,0.001489089,0.00009441919,0.00068703707,0.00038141877,0.00010244523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007032295,0.001662499,0.00097145484,0.0010411781,0.0008354835,0.0014272655,0.001711248,0.0014412723,0.045787703],"category_scores_gemma":[0.0042726463,0.0005224016,0.0005919512,0.0012645898,0.0005490156,0.00282715,0.0025301834,0.0015695705,0.0061253523],"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.00054619263,0.0002982991,0.00047916485,0.00047972405,0.000068923284,0.0002777056,0.00056688045,0.098957345,0.060356624,0.054259833,0.033864,0.7498453],"study_design_scores_gemma":[0.00012736702,0.00028035327,0.00056540314,0.00016351644,0.0001163311,0.00050629483,0.00023261194,0.78335696,0.07139438,0.059591398,0.08358444,0.00008087206],"about_ca_topic_score_codex":0.001315728,"about_ca_topic_score_gemma":0.0013634844,"teacher_disagreement_score":0.045787703,"about_ca_system_score_codex":0.000414203,"about_ca_system_score_gemma":0.0004283932,"threshold_uncertainty_score":0.15317512},"labels":[],"label_agreement":null},{"id":"W1580663027","doi":"10.1007/978-3-540-24687-9_37","title":"Simulation of Deformable Objects Using Sliding Mode Control with Application to Cloth Animation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dynamics and Control of Mechanical Systems","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":"Concordia University","funders":"","keywords":"Computer science; Robustness (evolution); Animation; Algorithm; Computer graphics (images)","score_opus":0.007437509076791295,"score_gpt":0.21746093010830328,"score_spread":0.21002342103151198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580663027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.373316,0.0003321779,0.60355633,0.00031395705,0.0002154158,0.00023022483,0.00034146663,0.0044242074,0.01727018],"genre_scores_gemma":[0.92002445,0.00015269654,0.07533341,0.000041570744,0.000013556388,0.000116227675,0.00017028843,0.00027457735,0.003873183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998609,0.0000374037,0.000009523642,0.000018562641,0.00005443219,0.000019146293],"domain_scores_gemma":[0.9993766,0.00039139966,0.000029270943,0.00006616325,0.00008197457,0.000054578828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003397156,0.000606804,0.0007268172,0.0005457675,0.00039995703,0.00072567625,0.0010353175,0.0013957815,0.006737308],"category_scores_gemma":[0.001283523,0.0004839773,0.000558369,0.0004541674,0.00053720444,0.00041054218,0.0007244912,0.00056462415,0.00031313216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009908079,0.00005093913,0.00036970017,0.0000526998,0.000019270197,0.00010719094,0.00008162267,0.97981787,0.0054863025,0.0019776872,0.0003482954,0.011589283],"study_design_scores_gemma":[0.0000063418856,0.0000096232,0.000040361312,0.000001390413,0.0000015764342,0.0000043783575,0.0000035682224,0.99897707,0.0006328063,0.0002047302,0.00011664485,0.0000014855016],"about_ca_topic_score_codex":0.006088033,"about_ca_topic_score_gemma":0.0034016394,"teacher_disagreement_score":0.006737308,"about_ca_system_score_codex":0.00044980526,"about_ca_system_score_gemma":0.00039770207,"threshold_uncertainty_score":0.022538602},"labels":[],"label_agreement":null},{"id":"W1580688485","doi":"10.1007/978-3-540-39611-6_25","title":"Routing Update in Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Computer network; Wireless ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Vehicular ad hoc network; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Network packet; Distributed computing; Routing protocol; Dynamic Source Routing; Wireless; Telecommunications","score_opus":0.011253472871701272,"score_gpt":0.22602086561876983,"score_spread":0.21476739274706855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580688485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016026909,0.08986087,0.764935,0.0022771612,0.00950675,0.00023966316,0.00037786952,0.0040001883,0.11277549],"genre_scores_gemma":[0.2440924,0.10116631,0.34732962,0.0011276581,0.0066671777,0.00040745657,0.0017350536,0.0010714651,0.2964029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995968,0.00007649189,0.0000319472,0.000059185855,0.00020534894,0.000030268091],"domain_scores_gemma":[0.9992955,0.00029774438,0.000036587422,0.00016039726,0.00018402653,0.000025768108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064555724,0.000702793,0.00073871005,0.0009009247,0.00039576454,0.0016722176,0.001279422,0.0006938841,0.0064380225],"category_scores_gemma":[0.002285808,0.00042561063,0.00021765314,0.0018455489,0.00039192464,0.002982276,0.0006218517,0.001127857,0.0022595925],"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.000100250065,0.000073052855,0.00032117273,0.0005671088,0.000026459607,0.00014250498,0.000121335215,0.013309092,0.003143337,0.05927089,0.04966295,0.87326175],"study_design_scores_gemma":[0.00006260679,0.00027022508,0.00095796253,0.00035075383,0.00017922008,0.0014008927,0.00017736942,0.20852025,0.008175763,0.10119115,0.67865527,0.000058547597],"about_ca_topic_score_codex":0.0005520599,"about_ca_topic_score_gemma":0.0007473472,"teacher_disagreement_score":0.0064380225,"about_ca_system_score_codex":0.00040881307,"about_ca_system_score_gemma":0.00037722033,"threshold_uncertainty_score":0.021537304},"labels":[],"label_agreement":null},{"id":"W1580701341","doi":"10.1007/978-3-540-68880-8_7","title":"A Meeting Scheduling Problem Respecting Time and Space","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Carleton University","funders":"","keywords":"Schedule; Computer science; Scheduling (production processes); Interval (graph theory); Subject (documents); Duration (music); Running time; Operations research; Job shop scheduling; Mathematical optimization; Theoretical computer science; Mathematics; Combinatorics; World Wide Web","score_opus":0.012875045313961527,"score_gpt":0.22634619211664286,"score_spread":0.21347114680268134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580701341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060819853,0.0009683748,0.9044856,0.001401864,0.00039255345,0.00030599424,0.00090822997,0.0008091742,0.029908445],"genre_scores_gemma":[0.36790508,0.0010901781,0.6063788,0.00026573704,0.00058888824,0.0002959816,0.0012238416,0.000504389,0.02174707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878365,0.0003093805,0.00009132232,0.00028962397,0.0003490974,0.00017693489],"domain_scores_gemma":[0.99785006,0.0012108982,0.0002283918,0.00020650272,0.00019416331,0.00031000527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013207487,0.0013987634,0.0018925655,0.00093229575,0.0012635238,0.002668633,0.00238444,0.0019893309,0.008128752],"category_scores_gemma":[0.0047200443,0.00075039227,0.0017417431,0.0026837282,0.0009247749,0.0035145478,0.0017825791,0.002512173,0.0012461417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010759899,0.0004160218,0.000672715,0.0011293427,0.0002037981,0.00052393624,0.00048679198,0.4682398,0.029814085,0.26613784,0.018895984,0.21240373],"study_design_scores_gemma":[0.00027634244,0.0006213855,0.00055598293,0.000071046794,0.0001261802,0.0006655393,0.00033858878,0.7382255,0.006179921,0.22724101,0.025633596,0.00006480808],"about_ca_topic_score_codex":0.001832942,"about_ca_topic_score_gemma":0.00148141,"teacher_disagreement_score":0.008128752,"about_ca_system_score_codex":0.00130647,"about_ca_system_score_gemma":0.0015372927,"threshold_uncertainty_score":0.027193427},"labels":[],"label_agreement":null},{"id":"W1580726254","doi":"10.1007/3-540-36440-4_19","title":"From RNA Secondary Structure to Coding Theory: A Combinatorial Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"University of British Columbia","funders":"","keywords":"RNA; Nucleic acid secondary structure; Computational biology; Nucleic acid structure; Base pair; Computer science; DNA; Non-coding RNA; Coding (social sciences); Protein secondary structure; Function (biology); Theoretical computer science; Algorithm; Biology; Mathematics; Genetics; Gene; Biochemistry","score_opus":0.009426483538773985,"score_gpt":0.21995969704776755,"score_spread":0.21053321350899357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580726254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014896435,0.0089299325,0.9008143,0.002227238,0.0004670348,0.000051928597,0.00024988488,0.0002921729,0.07207101],"genre_scores_gemma":[0.44197673,0.02200528,0.49489477,0.0020670318,0.004009886,0.0004818983,0.0010361355,0.00079147285,0.03273679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993874,0.00021901877,0.00003374233,0.00013537887,0.00017142374,0.00005301958],"domain_scores_gemma":[0.99819416,0.0013255386,0.000090323214,0.00018428237,0.00013674826,0.00006896533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091533375,0.0014441169,0.0017289937,0.002408812,0.0011099359,0.0034832142,0.0026389079,0.001698382,0.006752092],"category_scores_gemma":[0.0025402738,0.0010004754,0.0018816843,0.0025403074,0.0038680588,0.0065248385,0.0016673846,0.0032103367,0.0014897323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000835233,0.00001530308,0.00004758195,0.00009611387,0.000011653132,0.000039745744,0.000039926388,0.0063587707,0.0005516406,0.9804379,0.0014988041,0.010894324],"study_design_scores_gemma":[0.0000023029393,0.0000039877496,0.00001779963,0.000008827674,0.000002930598,0.000029764544,0.0000077357645,0.0070423894,0.00009287704,0.9915454,0.0012414958,0.0000044901926],"about_ca_topic_score_codex":0.000538941,"about_ca_topic_score_gemma":0.0006244896,"teacher_disagreement_score":0.006752092,"about_ca_system_score_codex":0.0015173359,"about_ca_system_score_gemma":0.00067435694,"threshold_uncertainty_score":0.022588015},"labels":[],"label_agreement":null},{"id":"W1580766708","doi":"10.1007/978-3-540-39611-6_13","title":"Preventing Replay Attacks for Secure Routing in Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Wireless ad hoc network; Ad hoc wireless distribution service; Destination-Sequenced Distance Vector routing; Mobile ad hoc network; Distributed computing; Distance-vector routing protocol; Routing protocol; Routing (electronic design automation); Network packet; Wireless; Telecommunications","score_opus":0.014634027727399732,"score_gpt":0.25173493103590255,"score_spread":0.2371009033085028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580766708","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.06503516,0.007467252,0.9070515,0.0011065676,0.00049831,0.00025915494,0.00008881951,0.003415661,0.015077668],"genre_scores_gemma":[0.7676385,0.0052503683,0.20822941,0.00027128076,0.0005463524,0.00020474925,0.00029920414,0.0003915387,0.017168567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986773,0.00028951967,0.00011646048,0.00013298681,0.00060504215,0.00017876127],"domain_scores_gemma":[0.9969144,0.0014721013,0.00032348296,0.00090702745,0.00030001168,0.00008305701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620406,0.0014366412,0.0012136712,0.0010360843,0.00078548404,0.0015376293,0.0016937476,0.0015938621,0.0035706903],"category_scores_gemma":[0.004095644,0.0007115398,0.00061951444,0.00064447836,0.0011495425,0.004112313,0.002361447,0.002020444,0.0017165166],"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.0011817687,0.0003680979,0.0012435858,0.0012453649,0.00029484252,0.00073044887,0.00082334713,0.16205637,0.081490934,0.11235655,0.025896879,0.61231184],"study_design_scores_gemma":[0.00018062656,0.0008563797,0.00057602505,0.00020042143,0.00021111063,0.0017657755,0.00027267763,0.7426303,0.06747315,0.15259199,0.0331593,0.00008229234],"about_ca_topic_score_codex":0.0002257762,"about_ca_topic_score_gemma":0.0002515993,"teacher_disagreement_score":0.0035706903,"about_ca_system_score_codex":0.00045520853,"about_ca_system_score_gemma":0.00038496347,"threshold_uncertainty_score":0.011945128},"labels":[],"label_agreement":null},{"id":"W1580817027","doi":"10.1007/978-3-642-11615-5_1","title":"LASTIC: A Light Aspiration Device for in vivo Soft TIssue Characterization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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 British Columbia","funders":"","keywords":"Biomedical engineering; Soft tissue; Finite element method; Materials science; Compartment (ship); Computer science; Surgery; Medicine; Physics; Geology","score_opus":0.02602594726870053,"score_gpt":0.28982739226468957,"score_spread":0.263801444995989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580817027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045413326,0.010716333,0.9017392,0.0005820005,0.0009207822,0.0004385167,0.0014261816,0.008071928,0.03069187],"genre_scores_gemma":[0.17476031,0.007976428,0.6720024,0.0016925574,0.00031720882,0.00059137243,0.0024587666,0.0016491172,0.13855185],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996458,0.000020109883,0.000020443193,0.000064147156,0.00022339479,0.000025961483],"domain_scores_gemma":[0.99966276,0.00012326775,0.000027360285,0.000050746796,0.00008787095,0.000047953905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056382926,0.00058348145,0.0004565267,0.0010804995,0.0004477358,0.00087687775,0.0009944197,0.0010901063,0.007516712],"category_scores_gemma":[0.00043450706,0.00057412806,0.00039993587,0.00040685612,0.00040709454,0.000879029,0.00087859645,0.0009375236,0.0036729819],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011440979,0.00006000625,0.00029061656,0.0002697153,0.000011792988,0.00017543831,0.00014014587,0.00030703176,0.8530757,0.0013245754,0.007083764,0.13714682],"study_design_scores_gemma":[0.000054628337,0.00048316238,0.00361614,0.00012764052,0.00008207116,0.0042961817,0.00011208835,0.011412831,0.7998702,0.0012176165,0.1786247,0.000102685364],"about_ca_topic_score_codex":0.0005608249,"about_ca_topic_score_gemma":0.0015470786,"teacher_disagreement_score":0.007516712,"about_ca_system_score_codex":0.0003118508,"about_ca_system_score_gemma":0.0006003378,"threshold_uncertainty_score":0.025145888},"labels":[],"label_agreement":null},{"id":"W1580893043","doi":"10.1007/978-3-642-16599-3_17","title":"Monitoring and Recovery of Web Service Applications","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Business Process Execution Language; Web service; Automaton; Model checking; Finite-state machine; Distributed computing; Process (computing); Software engineering; Service (business); The Internet; Programming language; Service-oriented architecture; World Wide Web; Theoretical computer science","score_opus":0.010254783043622456,"score_gpt":0.23157066423675174,"score_spread":0.22131588119312928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580893043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1959538,0.0027261549,0.77053565,0.0007308508,0.00023943456,0.00022306583,0.00018559291,0.016966484,0.012439028],"genre_scores_gemma":[0.9161924,0.000817418,0.0710524,0.00010947998,0.000086242646,0.00007950351,0.00032821714,0.00038096576,0.010953278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990902,0.0001406522,0.00005214018,0.00014684859,0.00046392376,0.0001062125],"domain_scores_gemma":[0.99890685,0.00039164463,0.00013504988,0.00031692433,0.00019146339,0.000058109334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157997,0.000576295,0.0005921368,0.00090744335,0.00038728022,0.0010269079,0.0014199892,0.0006325449,0.0015405919],"category_scores_gemma":[0.00300904,0.00033407722,0.0002598706,0.0005585095,0.00046232936,0.001204583,0.0007385292,0.00086228485,0.00056809705],"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.0010158924,0.00039391793,0.0042256815,0.00031033834,0.000060489925,0.00052458694,0.000429997,0.08558765,0.09360244,0.015197279,0.010199375,0.7884524],"study_design_scores_gemma":[0.000040538835,0.00017378836,0.0033531394,0.00006010956,0.000058075515,0.00044569906,0.00008181326,0.85768205,0.10932927,0.015800549,0.012942345,0.000032629552],"about_ca_topic_score_codex":0.001662625,"about_ca_topic_score_gemma":0.0011288691,"teacher_disagreement_score":0.001662625,"about_ca_system_score_codex":0.0004734861,"about_ca_system_score_gemma":0.00055664673,"threshold_uncertainty_score":0.005153835},"labels":[],"label_agreement":null},{"id":"W1581000938","doi":"10.1007/978-3-540-30081-6_6","title":"Information Preservation in XML-to-Relational Mappings","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"XML; Computer science; Information retrieval; World Wide Web","score_opus":0.01635513214985388,"score_gpt":0.23342142095960067,"score_spread":0.2170662888097468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581000938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033107795,0.0022900563,0.94729894,0.0009834602,0.00021646198,0.000084946245,0.00028586065,0.0020596832,0.013672817],"genre_scores_gemma":[0.5284092,0.003871849,0.44394815,0.0007509652,0.00051211624,0.00017391506,0.0014290488,0.0010728743,0.01983194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99485517,0.0017710032,0.0007332771,0.00063718855,0.0016055013,0.00039782774],"domain_scores_gemma":[0.9840502,0.0065289205,0.00060768105,0.0073382165,0.0013021926,0.00017269858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059432182,0.0004623234,0.00089232513,0.0018891438,0.0011913469,0.004616204,0.002249329,0.0012376957,0.0039566546],"category_scores_gemma":[0.017106928,0.0009264713,0.0011242877,0.0043274094,0.0022880351,0.014299156,0.0039328136,0.001833318,0.0011933806],"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.0003699455,0.000116610754,0.0018147709,0.000556643,0.00008127089,0.00054749777,0.0013022716,0.017254703,0.0069622067,0.6606428,0.007958312,0.3023929],"study_design_scores_gemma":[0.00005435411,0.00014862897,0.000902112,0.00019236917,0.00023964509,0.0015232341,0.00066564244,0.07556876,0.060251165,0.81802535,0.04236626,0.0000625108],"about_ca_topic_score_codex":0.000878391,"about_ca_topic_score_gemma":0.00068045186,"teacher_disagreement_score":0.0059432182,"about_ca_system_score_codex":0.0007725993,"about_ca_system_score_gemma":0.0010032243,"threshold_uncertainty_score":0.03143114},"labels":[],"label_agreement":null},{"id":"W1581024742","doi":"10.1007/978-3-642-03240-0_12","title":"Formal Verification of the Implementability of Timing Requirements","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Mathematical proof; Jitter; Component (thermodynamics); Operator (biology); Property (philosophy); Static timing analysis; Software; Simple (philosophy); Formal verification; Software engineering; Theoretical computer science; Programming language; Embedded system; Mathematics","score_opus":0.05685859907238569,"score_gpt":0.3245546435799199,"score_spread":0.26769604450753426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581024742","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.016865542,0.00008372754,0.97295785,0.00015119328,0.00007160811,0.00009531767,0.00006487795,0.001197066,0.008512868],"genre_scores_gemma":[0.67392725,0.00027249756,0.31778526,0.00012917694,0.0000798912,0.00029335136,0.00029746475,0.00043241796,0.0067826738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518096,0.0013787015,0.0003059581,0.0003464664,0.0022908812,0.00049711345],"domain_scores_gemma":[0.9880233,0.008385887,0.0006652199,0.0019044399,0.0009119668,0.00010917983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041621095,0.0007292791,0.00053103745,0.00076368736,0.00050290587,0.0017596654,0.0018744352,0.0011081521,0.004374251],"category_scores_gemma":[0.015038567,0.00079017313,0.0012514538,0.00039911055,0.002723326,0.0021893608,0.0014135842,0.0017621004,0.0008132081],"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.00028190366,0.00014348746,0.0004891788,0.0004441636,0.00006410446,0.00045873312,0.0005431219,0.08919694,0.042258646,0.77554584,0.0018362227,0.08873764],"study_design_scores_gemma":[0.00036179996,0.00027499377,0.0004688163,0.00019405337,0.00010863066,0.00040571272,0.00010107256,0.43222496,0.1194558,0.42051265,0.025818737,0.000072796916],"about_ca_topic_score_codex":0.0013225179,"about_ca_topic_score_gemma":0.0010954186,"teacher_disagreement_score":0.004374251,"about_ca_system_score_codex":0.0009944907,"about_ca_system_score_gemma":0.0017273938,"threshold_uncertainty_score":0.022011578},"labels":[],"label_agreement":null},{"id":"W1581032865","doi":"10.1007/978-3-540-77048-0_10","title":"A Novel Method for Micro-Aggregation in Secure Statistical Databases Using Association and Interaction","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cardinality (data modeling); Transitive closure; Mutual information; Association (psychology); Data mining; Set (abstract data type); Closure (psychology); Theoretical computer science; Transitive relation; Algorithm; Database; Artificial intelligence; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.05896747598940669,"score_gpt":0.35839489233444605,"score_spread":0.29942741634503933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581032865","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.0012519453,0.000082752995,0.99742293,0.000074902404,0.000055393088,0.00003840346,0.000043927073,0.00067390373,0.0003558546],"genre_scores_gemma":[0.05985659,0.00016807568,0.9356696,0.00015198962,0.00026313093,0.00021512383,0.0002702687,0.00022814385,0.0031770645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99236906,0.001702833,0.0006370502,0.00119161,0.0037801543,0.00031928255],"domain_scores_gemma":[0.9903666,0.0033387227,0.0006082951,0.003723698,0.0016611215,0.00030159464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035736149,0.0009263494,0.0019849318,0.0025708007,0.0016413046,0.0032259799,0.0025388568,0.0011351861,0.0037709267],"category_scores_gemma":[0.010739696,0.0008426002,0.001686961,0.0037113181,0.0012400817,0.0037836563,0.0043952568,0.0026550966,0.0021990591],"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.0005771889,0.00032403204,0.0031820044,0.00021950627,0.00034171244,0.00042057814,0.0005431201,0.035868436,0.018484307,0.1707082,0.016141828,0.75318915],"study_design_scores_gemma":[0.00006664174,0.00017561612,0.0009174682,0.0000333874,0.00013373031,0.001107729,0.00012056976,0.827796,0.017116793,0.12687333,0.025561545,0.000097207405],"about_ca_topic_score_codex":0.0011988893,"about_ca_topic_score_gemma":0.0018168273,"teacher_disagreement_score":0.0037709267,"about_ca_system_score_codex":0.00086782017,"about_ca_system_score_gemma":0.0020944292,"threshold_uncertainty_score":0.018899262},"labels":[],"label_agreement":null},{"id":"W1581044618","doi":"10.1007/3-540-45925-1_6","title":"Region-Based Image Retrieval Using Multiple-Features","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Image retrieval; Segmentation; Computer vision; Invariant (physics); Pattern recognition (psychology); Translation (biology); Computation; Image segmentation; Rotation (mathematics); Representation (politics); Image (mathematics); Mathematics; Algorithm","score_opus":0.032314198706046814,"score_gpt":0.26254222927255244,"score_spread":0.23022803056650562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581044618","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.022659771,0.0041690473,0.96742934,0.00008041715,0.00015441849,0.000128249,0.00021938025,0.0031074719,0.002051988],"genre_scores_gemma":[0.17310454,0.0026832898,0.81397986,0.00013286315,0.00020645866,0.00016350864,0.0010311598,0.00043622518,0.008262046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994686,0.00006556537,0.00003823453,0.00010389576,0.00026421886,0.000059393966],"domain_scores_gemma":[0.9995609,0.00012618219,0.00004352239,0.00011371108,0.00013761483,0.00001802908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054681225,0.00084781536,0.002136455,0.0021283582,0.0003762695,0.0010206511,0.0015532922,0.00096555986,0.004263246],"category_scores_gemma":[0.0011084487,0.0004914946,0.0011583335,0.0028791297,0.0003286673,0.0021725376,0.0009728256,0.00047831028,0.0036176236],"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.00044739107,0.000114704984,0.0002855806,0.00038838296,0.0001482569,0.00020616736,0.000039140836,0.0077100885,0.30409476,0.0016515399,0.005239286,0.6796747],"study_design_scores_gemma":[0.00010923289,0.00065583066,0.0038251309,0.00005145654,0.0005041306,0.0032128138,0.00007400576,0.54712564,0.4215908,0.0048703537,0.017865622,0.00011497038],"about_ca_topic_score_codex":0.0013400888,"about_ca_topic_score_gemma":0.0018465084,"teacher_disagreement_score":0.004263246,"about_ca_system_score_codex":0.00036086136,"about_ca_system_score_gemma":0.00029323637,"threshold_uncertainty_score":0.014262021},"labels":[],"label_agreement":null},{"id":"W1581178003","doi":"10.1007/3-540-45622-8_27","title":"Using Abstraction for Heuristic Search and Planning","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Alberta","funders":"","keywords":"Computer science; Heuristic; Incremental heuristic search; Abstraction; Null-move heuristic; Consistent heuristic; Beam search; Estimator; Factor (programming language); Search algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Algorithm; Programming language; Mathematics","score_opus":0.07126629346759994,"score_gpt":0.302729903603125,"score_spread":0.23146361013552508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581178003","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.0026609395,0.00101347,0.9883819,0.0001987198,0.00006914403,0.000034647554,0.000058672824,0.00048646095,0.0070959465],"genre_scores_gemma":[0.15448195,0.001822609,0.8365712,0.00015584641,0.00011741488,0.00023623105,0.0003332126,0.00031487082,0.0059667025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986576,0.0005905268,0.00009429677,0.00015900574,0.00038057796,0.00011800807],"domain_scores_gemma":[0.9980888,0.0012355901,0.00006117297,0.0004804533,0.00008753251,0.000046484045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014925835,0.0012323222,0.0015334169,0.0012894523,0.0007638737,0.0023464598,0.0020465965,0.0011050949,0.00800861],"category_scores_gemma":[0.0053255227,0.001328865,0.0024530385,0.0021460617,0.002800947,0.0055065393,0.0035704768,0.0037778101,0.0012038064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016146156,0.00004901478,0.00023737388,0.0004950936,0.00011947057,0.00014909204,0.00047544323,0.13520825,0.0016352928,0.67009264,0.004905598,0.18647134],"study_design_scores_gemma":[0.0000350238,0.000034122673,0.00007890989,0.00007258748,0.00006493384,0.00007076028,0.00005392412,0.19930317,0.0011365323,0.7844718,0.014652918,0.000025304746],"about_ca_topic_score_codex":0.0028606607,"about_ca_topic_score_gemma":0.003264621,"teacher_disagreement_score":0.00800861,"about_ca_system_score_codex":0.0011882348,"about_ca_system_score_gemma":0.000994866,"threshold_uncertainty_score":0.026791453},"labels":[],"label_agreement":null},{"id":"W1581209726","doi":"10.1007/3-540-44830-6_16","title":"A Guided Method for Testing Timed Input Output Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Executable; Automaton; Timed automaton; Conformance testing; Test case; State space; Model-based testing; Algorithm; Theoretical computer science; Programming language; Operating system; Mathematics","score_opus":0.07589610818888788,"score_gpt":0.33648147847699716,"score_spread":0.2605853702881093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581209726","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.010901576,0.000033880668,0.98219,0.000032270727,0.000022987091,0.0000930482,0.00008285678,0.005022631,0.0016205931],"genre_scores_gemma":[0.24615702,0.000055950382,0.74667966,0.000110454515,0.000017200526,0.00045616843,0.00035670018,0.0010101291,0.005156643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826604,0.0005015612,0.00008686543,0.00031766482,0.0006831746,0.00014471146],"domain_scores_gemma":[0.99627566,0.0022057213,0.00018321216,0.0007744556,0.0004411507,0.00011977856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052611,0.0011514121,0.00081008347,0.00074965425,0.00039365664,0.0008213103,0.0021141344,0.0010435033,0.005056804],"category_scores_gemma":[0.0036213894,0.00058487424,0.0007674632,0.00058320316,0.0013555618,0.0012301462,0.0013321317,0.0009115531,0.001118768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012390402,0.000549149,0.0026536945,0.0007687002,0.00018323051,0.00091170834,0.00071757555,0.062214866,0.15867332,0.087247476,0.009275616,0.6755657],"study_design_scores_gemma":[0.00048812985,0.0009361868,0.001215093,0.00015128509,0.00023601671,0.0010281991,0.0001780491,0.6223069,0.21842894,0.13054577,0.024354538,0.00013089686],"about_ca_topic_score_codex":0.0016300861,"about_ca_topic_score_gemma":0.0023145988,"teacher_disagreement_score":0.005056804,"about_ca_system_score_codex":0.00051411305,"about_ca_system_score_gemma":0.0012372467,"threshold_uncertainty_score":0.016916692},"labels":[],"label_agreement":null},{"id":"W1581215714","doi":"10.1007/11548706_72","title":"Uncertainty Handling in Tabular-Based Requirements Using Rough Sets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Software requirements; Software requirements specification; Requirements analysis; Benchmark (surveying); Software; System requirements; Process (computing); Set (abstract data type); Rough set; Non-functional requirement; Functional requirement; Software engineering; Software system; Software development; Data mining; Software design; Software construction; Programming language","score_opus":0.04633546405805297,"score_gpt":0.287017514761333,"score_spread":0.24068205070328005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581215714","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.008865508,0.00015031944,0.9891728,0.000080602906,0.000013437674,0.00005782584,0.00007213761,0.0002564977,0.001330772],"genre_scores_gemma":[0.3465783,0.00038084952,0.65130216,0.000067517685,0.00003420103,0.0002080056,0.00035916793,0.00014593921,0.0009237084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99314207,0.0025174257,0.00058865646,0.00040765593,0.003001564,0.00034269292],"domain_scores_gemma":[0.9886679,0.0075965603,0.00085342885,0.0012849759,0.0014645051,0.00013262074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051624556,0.00089689705,0.0019952243,0.0016989246,0.0008320933,0.0036215081,0.0019603465,0.00081658975,0.0023169222],"category_scores_gemma":[0.020595383,0.0009934646,0.0023774111,0.0024629978,0.0010222567,0.004975865,0.002205858,0.0019446374,0.00044882123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025817528,0.00008883312,0.0007596216,0.0004196011,0.00013499727,0.00031148343,0.0007891052,0.6960049,0.00571877,0.07702653,0.0018894622,0.21659845],"study_design_scores_gemma":[0.000017398468,0.000055166223,0.00018522631,0.000057475398,0.000039907492,0.00008403097,0.00012242734,0.93968904,0.0027305018,0.055647537,0.001337909,0.00003336222],"about_ca_topic_score_codex":0.00314283,"about_ca_topic_score_gemma":0.0029487284,"teacher_disagreement_score":0.0051624556,"about_ca_system_score_codex":0.001186475,"about_ca_system_score_gemma":0.0012469883,"threshold_uncertainty_score":0.027302027},"labels":[],"label_agreement":null},{"id":"W1581291502","doi":"10.1007/978-3-540-25983-1_10","title":"Tool Support for Inter-team Learning in Agile Software Organizations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Calgary","funders":"","keywords":"Computer science; Agile software development; Knowledge management; Tacit knowledge; Suite; Software development; Flexibility (engineering); Knowledge sharing; Software engineering; Software; Organizational learning; Personal software process; Lean software development; Team software process; Software development process; Software construction; Management","score_opus":0.01174206129276435,"score_gpt":0.25198221013987887,"score_spread":0.24024014884711453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581291502","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062007114,0.00045878536,0.914604,0.00041357207,0.0000848428,0.00010994176,0.00008527134,0.006418396,0.01581812],"genre_scores_gemma":[0.45803282,0.0006113178,0.52592885,0.00010152925,0.000054343294,0.0002497885,0.00043171563,0.0011465643,0.013443068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982949,0.00060545857,0.00013469314,0.0001542504,0.00064195844,0.0001687231],"domain_scores_gemma":[0.9942368,0.0036763228,0.00027507756,0.001198838,0.00041007646,0.00020277243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019185115,0.00076200266,0.00042846877,0.0009860054,0.0005160979,0.0027278014,0.002146033,0.0013679503,0.0056247767],"category_scores_gemma":[0.0074846353,0.0007078498,0.0005135099,0.0011134847,0.0004006143,0.0035348027,0.0021487456,0.002251633,0.0015938734],"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.0002719498,0.00041715777,0.0016246263,0.0003782219,0.00005839066,0.0006933265,0.0034833355,0.012836045,0.03569857,0.033886336,0.006719375,0.90393263],"study_design_scores_gemma":[0.00040762266,0.0014766437,0.006012867,0.0013861066,0.0002916362,0.003678948,0.0024950954,0.4461665,0.12123117,0.15988192,0.256692,0.0002795576],"about_ca_topic_score_codex":0.0003131447,"about_ca_topic_score_gemma":0.00041884402,"teacher_disagreement_score":0.0056247767,"about_ca_system_score_codex":0.00024729487,"about_ca_system_score_gemma":0.00063004554,"threshold_uncertainty_score":0.01881671},"labels":[],"label_agreement":null},{"id":"W1581306068","doi":"10.1007/3-540-44732-6_22","title":"A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Computer science; Line segment; Tree (set theory); Sorting; Data structure; Tree structure; Process (computing); Segment tree; Image processing; Algorithm; Line (geometry); Path (computing); Time complexity; Scheme (mathematics); Image (mathematics); Artificial intelligence; Binary tree; Interval tree; Mathematics","score_opus":0.027390248709639648,"score_gpt":0.2532196908368677,"score_spread":0.22582944212722803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581306068","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.00096029526,0.00010996722,0.99533194,0.000032264114,0.000058538542,0.00002092013,0.00005339366,0.0026372522,0.0007953718],"genre_scores_gemma":[0.01141455,0.00016737294,0.98493665,0.00003996839,0.000040961382,0.00006013416,0.00024982914,0.0006666413,0.0024238853],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933016,0.00006544047,0.000061437895,0.00017828972,0.00031115694,0.000053542488],"domain_scores_gemma":[0.9991142,0.00026575537,0.000083233615,0.00024866036,0.00022987546,0.000058258855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054351625,0.0015597593,0.0012232553,0.0018265967,0.00067421334,0.0020576231,0.0027278843,0.0011209084,0.0126104355],"category_scores_gemma":[0.0023602017,0.001046133,0.0010500421,0.002564819,0.0010562022,0.003741151,0.0018291048,0.002297291,0.0063947923],"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.00018429113,0.00005254296,0.00032774117,0.00029707322,0.000037610647,0.00014805343,0.00020054737,0.014641029,0.052405044,0.04993524,0.014299019,0.8674718],"study_design_scores_gemma":[0.00010066932,0.00038919394,0.00080881553,0.00013055773,0.0001344381,0.0016907959,0.00014829967,0.6470065,0.107964806,0.09475314,0.14671734,0.00015542516],"about_ca_topic_score_codex":0.001061714,"about_ca_topic_score_gemma":0.001372604,"teacher_disagreement_score":0.0126104355,"about_ca_system_score_codex":0.00058282167,"about_ca_system_score_gemma":0.00063525327,"threshold_uncertainty_score":0.04218608},"labels":[],"label_agreement":null},{"id":"W1581327827","doi":"10.1007/11562436_27","title":"Abstract Operational Semantics for Use Case Maps","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Computer science; Operational semantics; Semantics (computer science); Programming language","score_opus":0.05901399295091442,"score_gpt":0.3033734993339051,"score_spread":0.2443595063829907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581327827","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.007179505,0.0008229734,0.9543424,0.0010111284,0.00027157448,0.00021276603,0.00090629054,0.0020511085,0.03320219],"genre_scores_gemma":[0.4469565,0.001953048,0.5203827,0.000637091,0.0006196365,0.0010123895,0.0032966363,0.0011358379,0.024006171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954306,0.001198184,0.0006664575,0.0007883249,0.0013704194,0.00054602436],"domain_scores_gemma":[0.99698406,0.0009986567,0.00023074787,0.0006655474,0.00097210763,0.00014880311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026376897,0.0017917353,0.0009372543,0.0043417593,0.0019213632,0.00875196,0.0027005507,0.002440535,0.010827638],"category_scores_gemma":[0.005111032,0.0012505929,0.0018431805,0.0047542905,0.0049997955,0.014951032,0.004558846,0.004042412,0.002289053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018155199,0.000020596877,0.00011273092,0.00009203296,0.0000124960925,0.00013292872,0.00052703667,0.0011833434,0.0007983085,0.9816275,0.0020073706,0.013467502],"study_design_scores_gemma":[0.000016789172,0.000015192769,0.00012351687,0.00009835592,0.000034043158,0.00027241476,0.0003310494,0.01092233,0.0016918505,0.9391985,0.047269534,0.000026414436],"about_ca_topic_score_codex":0.0026825506,"about_ca_topic_score_gemma":0.0017324218,"teacher_disagreement_score":0.010827638,"about_ca_system_score_codex":0.0019525106,"about_ca_system_score_gemma":0.0014983054,"threshold_uncertainty_score":0.03622204},"labels":[],"label_agreement":null},{"id":"W1581337359","doi":"10.1007/3-540-45068-8_22","title":"Engineering a Future for Web-Based Learning Objects","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Learning object; Computer science; Object (grammar); World Wide Web; Human–computer interaction; Artificial intelligence; Data science","score_opus":0.010790477564513205,"score_gpt":0.23433650010902174,"score_spread":0.22354602254450853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581337359","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049097367,0.018178828,0.4301269,0.045323092,0.0033704685,0.00012461585,0.000116895855,0.001539108,0.45212278],"genre_scores_gemma":[0.38178602,0.015739284,0.23337317,0.0029490711,0.00145233,0.00020261625,0.00030127834,0.00073483837,0.36346143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917823,0.00020151312,0.000047632195,0.0000992726,0.0003544972,0.00011883606],"domain_scores_gemma":[0.99866176,0.00029284242,0.00006387168,0.00033345053,0.00040648147,0.00024156562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020505767,0.00035334175,0.00021480763,0.0005965749,0.0012679663,0.00662873,0.0010985553,0.0031133327,0.015166212],"category_scores_gemma":[0.0027986984,0.00034561002,0.00037840498,0.0005787279,0.0028616579,0.01805555,0.0026533522,0.0018622084,0.0041898172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015969496,0.000038398444,0.00020953135,0.00008813976,0.000004074725,0.00007948598,0.0006949145,0.0008396891,0.0012618402,0.90820026,0.011927391,0.0766402],"study_design_scores_gemma":[0.0000070041187,0.000032146574,0.00015206916,0.00014238324,0.000005768309,0.00022464764,0.0007647987,0.002652204,0.001256085,0.513365,0.48138362,0.000014353549],"about_ca_topic_score_codex":0.0011563094,"about_ca_topic_score_gemma":0.0011658652,"teacher_disagreement_score":0.015166212,"about_ca_system_score_codex":0.0011178529,"about_ca_system_score_gemma":0.00116425,"threshold_uncertainty_score":0.05073607},"labels":[],"label_agreement":null},{"id":"W1581431267","doi":"10.1007/978-3-540-24840-8_2","title":"Balancing Robotic Teleoperation and Autonomy for Urban Search and Rescue Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","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 Manitoba","funders":"","keywords":"Teleoperation; Traverse; Computer science; Search and rescue; Robot; Rescue robot; Domain (mathematical analysis); Controller (irrigation); Human–computer interaction; Urban search and rescue; Artificial intelligence; Mobile robot; Simulation","score_opus":0.010342964354524291,"score_gpt":0.20763006168278647,"score_spread":0.1972870973282622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581431267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043037325,0.0066528926,0.8736636,0.0005902497,0.0003726726,0.000033743843,0.00004775457,0.000886857,0.074714854],"genre_scores_gemma":[0.81557184,0.0032926034,0.12116872,0.00015154181,0.00023805772,0.00006189861,0.00016577414,0.00021220413,0.05913736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986935,0.00001214559,0.000003977552,0.000019005975,0.0000796343,0.00001597874],"domain_scores_gemma":[0.9999404,0.00002295377,0.00000789468,0.000009761009,0.000013237551,0.0000058035444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012717018,0.00032750124,0.00026630238,0.0002474024,0.00024039153,0.000648822,0.0006767084,0.000569953,0.005167373],"category_scores_gemma":[0.00032482675,0.00022131803,0.0001503525,0.0003588281,0.00039457617,0.001274458,0.00075412495,0.0004307086,0.0010903645],"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.00020390995,0.000065522465,0.00044473723,0.00024199093,0.000026302672,0.00014040292,0.00031905144,0.06994088,0.086779416,0.089502275,0.0092168,0.7431187],"study_design_scores_gemma":[0.000057759433,0.000345917,0.0025992875,0.00009705642,0.00004460027,0.00096427125,0.0004309246,0.6198741,0.03433581,0.19730443,0.14388964,0.000056101173],"about_ca_topic_score_codex":0.00043640408,"about_ca_topic_score_gemma":0.000820713,"teacher_disagreement_score":0.005167373,"about_ca_system_score_codex":0.00013820308,"about_ca_system_score_gemma":0.00016154534,"threshold_uncertainty_score":0.01728654},"labels":[],"label_agreement":null},{"id":"W1581459791","doi":"10.1007/978-3-642-28872-2_12","title":"Intermodeling, Queries, and Kleisli Categories","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":30,"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; University of Waterloo","funders":"","keywords":"Computer science; Merge (version control); Metamodeling; Programming language; Algebraic number; Class (philosophy); Algebraic specification; Theoretical computer science; Formal specification; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.017547488329851868,"score_gpt":0.24208348275103417,"score_spread":0.2245359944211823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581459791","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.03509612,0.03925299,0.4995351,0.013169363,0.0015535249,0.00017050884,0.0019684727,0.002038886,0.407215],"genre_scores_gemma":[0.6701704,0.0270966,0.18388987,0.0027294669,0.0026300824,0.00054533663,0.005565638,0.0012695604,0.106102966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750406,0.00052539125,0.00030817074,0.0005399057,0.0008110759,0.00031139268],"domain_scores_gemma":[0.9985501,0.0006296865,0.00011438958,0.00036381825,0.00024687633,0.00009508423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020703508,0.0012324513,0.0013186906,0.0034883043,0.0027459462,0.008505494,0.002225998,0.0017229476,0.010071776],"category_scores_gemma":[0.003908744,0.0009341127,0.0014529271,0.0057210033,0.006097681,0.02562764,0.003697029,0.005604868,0.0032964726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009400722,0.0000065902695,0.00005467906,0.000039296432,0.0000021389453,0.000014811344,0.00018871267,0.00014518823,0.00010947233,0.9881443,0.0025000677,0.008785308],"study_design_scores_gemma":[0.0000035032272,0.0000067701153,0.00004543327,0.000026646636,0.000004914169,0.0000741942,0.0001067824,0.00067927834,0.00014087831,0.9724171,0.026486145,0.000008408824],"about_ca_topic_score_codex":0.0022232535,"about_ca_topic_score_gemma":0.0015596324,"teacher_disagreement_score":0.010071776,"about_ca_system_score_codex":0.0036749244,"about_ca_system_score_gemma":0.0014419265,"threshold_uncertainty_score":0.033693492},"labels":[],"label_agreement":null},{"id":"W1581468894","doi":"10.1007/978-3-540-30116-5_6","title":"Mining Positive and Negative Association Rules: An Approach for Confined Rules","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":197,"is_retracted":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":"Association rule learning; Association (psychology); Associative property; Computer science; Process (computing); Data mining; Correlation; Complement (music); Affinity analysis; Space (punctuation); Artificial intelligence; Mathematics; Psychology","score_opus":0.01876755616653307,"score_gpt":0.25501796535937665,"score_spread":0.23625040919284357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581468894","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.021106115,0.0014564752,0.97303087,0.0003195213,0.00007942766,0.0004466411,0.0007816427,0.0015695549,0.0012097333],"genre_scores_gemma":[0.10292187,0.00067955226,0.89088887,0.0004308728,0.00016955797,0.00054342335,0.00217965,0.00019645858,0.0019897192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900087,0.0016066972,0.0015171728,0.0021553535,0.0043792217,0.00033292745],"domain_scores_gemma":[0.9742613,0.016846707,0.0012943991,0.004173562,0.0027530848,0.0006708881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008058853,0.0014685567,0.0047906362,0.0063657206,0.0024597966,0.0046566017,0.0059726927,0.0025633627,0.0026413952],"category_scores_gemma":[0.03196687,0.0015184971,0.004310071,0.0068081478,0.0022778767,0.006290877,0.0061673196,0.0033334517,0.0012548496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009668858,0.0008562336,0.014710819,0.001998806,0.0010955333,0.0022888642,0.0019943933,0.019157482,0.017050734,0.036254123,0.008521005,0.8951052],"study_design_scores_gemma":[0.00028822155,0.0008048496,0.006561678,0.00080940255,0.0018487396,0.0064410293,0.0017779036,0.62162215,0.01842772,0.30684838,0.034280974,0.00028905945],"about_ca_topic_score_codex":0.0022787254,"about_ca_topic_score_gemma":0.004185705,"teacher_disagreement_score":0.008058853,"about_ca_system_score_codex":0.0006402401,"about_ca_system_score_gemma":0.0023091766,"threshold_uncertainty_score":0.042619824},"labels":[],"label_agreement":null},{"id":"W1581556037","doi":"10.1007/978-3-540-88313-5_17","title":"RFID Privacy Models Revisited","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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 Calgary","funders":"","keywords":"Computer science; Impossibility; Computer security; Privacy software; Privacy protection; Information privacy; Internet privacy; Law","score_opus":0.04144119673069961,"score_gpt":0.3008881490764771,"score_spread":0.25944695234577747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581556037","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.03333994,0.0083053885,0.5919447,0.11455962,0.0013063132,0.00007504635,0.000534434,0.00028271595,0.24965185],"genre_scores_gemma":[0.894829,0.004827391,0.04179355,0.009399559,0.0016716599,0.00019383809,0.00028829725,0.0001566384,0.04684006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933529,0.0033002994,0.00023110154,0.000974225,0.0014796742,0.0006617569],"domain_scores_gemma":[0.98549193,0.0089759715,0.00079595903,0.0031185504,0.0012349212,0.00038262497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067315185,0.00093980285,0.0012650887,0.0015737563,0.0025653264,0.008356339,0.0033216577,0.0072524194,0.00901428],"category_scores_gemma":[0.017387962,0.0009724555,0.002391311,0.0025688182,0.0067252796,0.0226738,0.0040865988,0.011032986,0.002057538],"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.0000050707763,0.0000059952,0.00004524066,0.000009473403,0.000005666492,0.000024618981,0.00006654469,0.0010050862,0.00003077355,0.99633706,0.0011593169,0.001305276],"study_design_scores_gemma":[0.000005649163,0.0000062652307,0.000040232786,0.000018571482,0.0000088871775,0.00007502694,0.00007977686,0.0066937055,0.00006381461,0.9878242,0.0051765414,0.000007314298],"about_ca_topic_score_codex":0.0021782564,"about_ca_topic_score_gemma":0.0015866061,"teacher_disagreement_score":0.00901428,"about_ca_system_score_codex":0.0037791277,"about_ca_system_score_gemma":0.0016044222,"threshold_uncertainty_score":0.035600126},"labels":[],"label_agreement":null},{"id":"W1581589916","doi":"10.1007/978-3-540-30572-9_12","title":"TarzaNN : A General Purpose Neural Network Simulator for Visual Attention Modeling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"Computer science; Generality; Computer architecture simulator; Implementation; Artificial neural network; General purpose; Simulation; Programming language; Human–computer interaction; Artificial intelligence; Computer architecture","score_opus":0.024677784234726684,"score_gpt":0.2880587385753808,"score_spread":0.2633809543406541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581589916","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.034561384,0.00028218853,0.91959155,0.00029241949,0.00024923196,0.00020986036,0.002962493,0.032917593,0.008933227],"genre_scores_gemma":[0.4825863,0.00044788083,0.48774466,0.00036940636,0.00006139915,0.0010994166,0.0040861224,0.0053211544,0.018283796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990034,0.000022283868,0.0000074772124,0.000025370317,0.00002882886,0.000015628142],"domain_scores_gemma":[0.99966,0.00015923033,0.000019383097,0.000050626197,0.00008627984,0.000024424373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037254655,0.0007611822,0.00058855966,0.00044666097,0.00039686623,0.0006342421,0.0025672708,0.0012985163,0.0147168],"category_scores_gemma":[0.001797781,0.0005680494,0.000664611,0.0005170331,0.00022846354,0.0010712326,0.000530504,0.0014775996,0.0025909683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002979707,0.00010115777,0.00084378617,0.00020258344,0.00012385932,0.00011669868,0.00007034171,0.90234977,0.008539877,0.010229853,0.018610643,0.058513425],"study_design_scores_gemma":[0.000016353166,0.000007964175,0.000040851835,0.00000206974,0.000005106579,0.000008707069,0.0000015872548,0.99615234,0.0013209558,0.0014187973,0.0010218689,0.0000034000675],"about_ca_topic_score_codex":0.0130108055,"about_ca_topic_score_gemma":0.015788583,"teacher_disagreement_score":0.0147168,"about_ca_system_score_codex":0.0008856159,"about_ca_system_score_gemma":0.0009640216,"threshold_uncertainty_score":0.049232602},"labels":[],"label_agreement":null},{"id":"W1581603834","doi":"10.1007/978-3-540-24688-6_133","title":"Need for a Prescriptive Taxonomy of Interaction for Mathematical Cognitive Tools","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics Education and Teaching Techniques","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Taxonomy (biology); Cognitive science; Cognition; Artificial intelligence; Human–computer interaction; Management science; Psychology; Neuroscience; Ecology","score_opus":0.09634124548933949,"score_gpt":0.3600885756018747,"score_spread":0.2637473301125352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581603834","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.0072962893,0.0027920005,0.86849356,0.016038414,0.0005735507,0.00036030714,0.0003458668,0.0009527946,0.103147246],"genre_scores_gemma":[0.29139897,0.0023168689,0.6852203,0.003193156,0.00069829356,0.0023949563,0.0007354948,0.00063727447,0.0134047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99110717,0.0033655323,0.0012814469,0.0011217563,0.0025445311,0.0005794845],"domain_scores_gemma":[0.9773996,0.008756302,0.0010563295,0.0038649838,0.0070749293,0.0018478977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008551592,0.0021888763,0.0018335205,0.006871177,0.005747955,0.013621496,0.0055002556,0.006810025,0.00883183],"category_scores_gemma":[0.019742455,0.0018487701,0.0026027693,0.0030544053,0.01806429,0.0306522,0.0048998664,0.016715406,0.0037810022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000848962,0.00003123533,0.00032650746,0.00013855514,0.000007874854,0.000045312245,0.0014050092,0.0004773112,0.00029055105,0.9828069,0.0020554268,0.012406631],"study_design_scores_gemma":[0.00001733912,0.000033770877,0.00045652292,0.00024278837,0.000017339216,0.00042390722,0.001361322,0.006323911,0.00031439684,0.96518767,0.025578192,0.000042894724],"about_ca_topic_score_codex":0.0034089212,"about_ca_topic_score_gemma":0.0049536778,"teacher_disagreement_score":0.013621496,"about_ca_system_score_codex":0.0062589906,"about_ca_system_score_gemma":0.00608364,"threshold_uncertainty_score":0.04541242},"labels":[],"label_agreement":null},{"id":"W1581645353","doi":"10.1007/978-3-642-10331-5_100","title":"Optimal Weights for Convex Functionals in Medical Image Segmentation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Simon Fraser University","funders":"","keywords":"Initialization; Energy functional; Computer science; Segmentation; Image segmentation; Regular polygon; Minification; Energy (signal processing); Image (mathematics); Artificial intelligence; Set (abstract data type); Energy minimization; Convex optimization; Mathematical optimization; Algorithm; Pattern recognition (psychology); Computer vision; Mathematics","score_opus":0.016648513566191462,"score_gpt":0.2960550388763512,"score_spread":0.27940652531015975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581645353","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.002885138,0.0005176779,0.99568653,0.00011440885,0.000028421853,0.000016391992,0.000012166284,0.00007518502,0.0006639894],"genre_scores_gemma":[0.12494541,0.0020773727,0.8642429,0.00013577995,0.00021330608,0.00019054774,0.00014876403,0.0008000401,0.0072459006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988458,0.0005411895,0.00007845258,0.0001669897,0.00029137742,0.00007614616],"domain_scores_gemma":[0.9980294,0.0013353102,0.00012217618,0.00015481368,0.00027423343,0.0000839868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117112,0.0014114408,0.0019896738,0.0014397606,0.00052004145,0.0019036261,0.0018776656,0.0024000017,0.002429269],"category_scores_gemma":[0.009423849,0.001637044,0.0010428985,0.0019550165,0.0019290643,0.0031048597,0.0025733698,0.0024849512,0.00070713233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021308646,0.0000867885,0.00027992675,0.0005709566,0.00009627292,0.00010066864,0.00020492646,0.45921433,0.019426422,0.27192202,0.0036188387,0.24426576],"study_design_scores_gemma":[0.000011453437,0.000025259045,0.00009439071,0.000040392566,0.000018593033,0.000058385824,0.00001574756,0.89493656,0.0023035295,0.100575276,0.0019043614,0.000016110967],"about_ca_topic_score_codex":0.0017106428,"about_ca_topic_score_gemma":0.0015752787,"teacher_disagreement_score":0.003117112,"about_ca_system_score_codex":0.001398268,"about_ca_system_score_gemma":0.0009211702,"threshold_uncertainty_score":0.016485095},"labels":[],"label_agreement":null},{"id":"W1581659377","doi":"10.1007/11768012_8","title":"An Adaptive Personalized Recommendation Strategy Featuring Context Sensitive Content Adaptation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Collaborative filtering; Computer science; Adaptation (eye); Content adaptation; Recommender system; Context (archaeology); Quality (philosophy); Information retrieval; Human–computer interaction; Ubiquitous computing; Psychology","score_opus":0.060119864411862074,"score_gpt":0.26789896197307983,"score_spread":0.20777909756121776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581659377","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.061417278,0.0010955132,0.9227,0.00032387354,0.0005102173,0.00035766378,0.00027653275,0.006228111,0.0070908163],"genre_scores_gemma":[0.5555237,0.00045728427,0.42827868,0.000504895,0.00031747043,0.00024970697,0.0004987105,0.00021959182,0.013949968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992514,0.00014772934,0.000040364772,0.00023094998,0.00025323828,0.00007627064],"domain_scores_gemma":[0.9990195,0.00028864716,0.000034693447,0.00025726878,0.00031075365,0.00008915033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059410697,0.00093422615,0.0016245787,0.0012776636,0.0006812493,0.0010548236,0.0020347037,0.0017587176,0.0031969245],"category_scores_gemma":[0.0021882837,0.00047205304,0.0007570837,0.0016258894,0.0003188602,0.0014181647,0.0009857776,0.0010960444,0.0019401477],"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.0010226136,0.0015623412,0.0033243408,0.00018349136,0.00046843605,0.00046264048,0.00017936304,0.040326476,0.07716077,0.004766037,0.020749785,0.84979373],"study_design_scores_gemma":[0.00013496431,0.00028383953,0.0024016309,0.000011189323,0.00029006644,0.00067287893,0.00006949323,0.9681824,0.018224008,0.0035946562,0.0060446905,0.00009023443],"about_ca_topic_score_codex":0.005596457,"about_ca_topic_score_gemma":0.011452417,"teacher_disagreement_score":0.005596457,"about_ca_system_score_codex":0.00034869733,"about_ca_system_score_gemma":0.00058761914,"threshold_uncertainty_score":0.01112777},"labels":[],"label_agreement":null},{"id":"W1581663072","doi":"10.1007/3-540-39568-7_7","title":"Some Public-Key Crypto-Functions as Intractable as Factorization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Manitoba","funders":"","keywords":"Cryptosystem; Public-key cryptography; Computer science; Digital signature; Factorization; Factoring; Plaintext-aware encryption; Encryption; Theoretical computer science; Cryptography; Key (lock); Integer factorization; Mathematics; Deterministic encryption; Computer security; Algorithm; Hash function","score_opus":0.023529506798401458,"score_gpt":0.25717308456722276,"score_spread":0.2336435777688213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581663072","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.09751128,0.0106245065,0.52640516,0.030135857,0.0013546637,0.0002877822,0.0011107798,0.0009529578,0.33161703],"genre_scores_gemma":[0.83424765,0.0069937506,0.06958218,0.0024909936,0.0019622466,0.00038134996,0.0007671655,0.0005288777,0.083045654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751186,0.0007953444,0.00013901903,0.00030883422,0.0008931729,0.00035176493],"domain_scores_gemma":[0.9929068,0.0049423096,0.00029208625,0.0013464303,0.00033933303,0.00017301792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030505224,0.0014603386,0.0016059743,0.0015352125,0.0027990565,0.006859342,0.001384703,0.0027023198,0.009210223],"category_scores_gemma":[0.01597993,0.00095781026,0.0014820216,0.003468961,0.008224464,0.017700091,0.0031212694,0.008971004,0.0023302832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035158282,0.000008673047,0.00003332108,0.000040700586,0.0000042254383,0.000018860268,0.000067174355,0.0010290407,0.00009035032,0.99181706,0.002365813,0.0044895583],"study_design_scores_gemma":[0.000012413499,0.000004122104,0.000019632816,0.0000109490675,0.0000044056264,0.00003871345,0.0000102835975,0.003033935,0.0001781996,0.9941049,0.0025772885,0.0000050641465],"about_ca_topic_score_codex":0.0006331662,"about_ca_topic_score_gemma":0.00051036227,"teacher_disagreement_score":0.009210223,"about_ca_system_score_codex":0.003642711,"about_ca_system_score_gemma":0.0016850388,"threshold_uncertainty_score":0.03081131},"labels":[],"label_agreement":null},{"id":"W1581688077","doi":"10.1007/3-540-48035-8_56","title":"Dynamic CSPs for Interval-Based Temporal Reasoning","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Lethbridge","funders":"","keywords":"Computer science; Interval (graph theory); Metric (unit); Consistency (knowledge bases); Theoretical computer science; Temporal logic; Temporal database; Algorithm; Artificial intelligence; Data mining; Mathematics","score_opus":0.01543977918840671,"score_gpt":0.24701533140564233,"score_spread":0.2315755522172356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581688077","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.0016221211,0.0013345877,0.9875546,0.00026442445,0.00014651475,0.00008253357,0.00036581093,0.00061171176,0.008017674],"genre_scores_gemma":[0.06989194,0.0024891258,0.9161802,0.00021479095,0.00031834934,0.00037014054,0.0014173012,0.000295268,0.008822841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998626,0.000333583,0.00018494058,0.00022378472,0.0005490253,0.0000825768],"domain_scores_gemma":[0.9982493,0.0010065727,0.00011046101,0.00028787227,0.00026496325,0.00008089018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706551,0.0010161109,0.0011263201,0.0012745077,0.00089120405,0.002907921,0.0028671068,0.00093887653,0.013906471],"category_scores_gemma":[0.0046720114,0.0010962683,0.0020610578,0.0035843584,0.0016835788,0.0060394984,0.0019068433,0.003977195,0.002670056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007143123,0.000044089207,0.00008153782,0.00030462575,0.000036977788,0.00012399878,0.00021287164,0.019552434,0.0014898718,0.87669337,0.0080650505,0.0933238],"study_design_scores_gemma":[0.0000365435,0.000019553294,0.000068117006,0.000092040216,0.00003291885,0.00011857801,0.00005148488,0.112523936,0.0010071368,0.85348386,0.03254127,0.0000245755],"about_ca_topic_score_codex":0.0032738894,"about_ca_topic_score_gemma":0.0034727147,"teacher_disagreement_score":0.013906471,"about_ca_system_score_codex":0.0015525824,"about_ca_system_score_gemma":0.0010327853,"threshold_uncertainty_score":0.046521783},"labels":[],"label_agreement":null},{"id":"W1581738587","doi":"10.1007/978-3-540-85097-7_34","title":"Magic Labelings on Cycles and Wheels","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension 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":"University of Guelph","funders":"","keywords":"MAGIC (telescope); Enumeration; Vertex (graph theory); Computer science; Combinatorics; Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Graph; Physics; Astronomy","score_opus":0.017068912504524556,"score_gpt":0.2276480715780396,"score_spread":0.21057915907351504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581738587","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.11578711,0.004032377,0.4402804,0.0031870194,0.0015011432,0.00015847893,0.001269377,0.0010088758,0.4327752],"genre_scores_gemma":[0.6417189,0.00454665,0.20068917,0.0011643005,0.0008192908,0.00035799813,0.0014728864,0.00088724407,0.1483435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964356,0.00006836207,0.000019155335,0.00008616741,0.00010896904,0.00007374465],"domain_scores_gemma":[0.9993357,0.00026069337,0.000052986157,0.00011948167,0.00012320872,0.00010795742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032270528,0.00059562415,0.00076805725,0.0020353168,0.0016728744,0.0022214074,0.001104466,0.0010699526,0.015737457],"category_scores_gemma":[0.0014976249,0.0007784119,0.0007696625,0.002514766,0.0020145655,0.0042874874,0.0017890783,0.0027172961,0.0021565282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012810982,0.0000047598273,0.000035697925,0.000028441606,0.0000017325085,0.000011730585,0.000076560165,0.00038991,0.00029966197,0.9847534,0.0031131597,0.011272064],"study_design_scores_gemma":[0.0000056313856,0.0000037700725,0.000053123083,0.000016856315,0.0000035906621,0.000029529518,0.00003972805,0.0014078653,0.0002223961,0.9855057,0.01270579,0.000006132085],"about_ca_topic_score_codex":0.0023294662,"about_ca_topic_score_gemma":0.003186902,"teacher_disagreement_score":0.015737457,"about_ca_system_score_codex":0.0011371439,"about_ca_system_score_gemma":0.00060074305,"threshold_uncertainty_score":0.052646995},"labels":[],"label_agreement":null},{"id":"W1581750636","doi":"10.1007/11422778_18","title":"Queue Analysis for Wireless Packet Data Traffic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Queue; Network packet; Wireless; Telecommunications","score_opus":0.027092587922567874,"score_gpt":0.25898707987688974,"score_spread":0.23189449195432185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581750636","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.010370934,0.0020254282,0.984089,0.00026211454,0.00025856003,0.00005010555,0.00019802584,0.00051755295,0.002228274],"genre_scores_gemma":[0.6965901,0.0069306213,0.262392,0.00043828195,0.0012921263,0.00030658994,0.0014033224,0.0010037676,0.029643157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994562,0.00010339581,0.000030463783,0.00008439797,0.00021889436,0.000106649975],"domain_scores_gemma":[0.99898547,0.00050554756,0.000043933414,0.00009094424,0.000323909,0.000050126182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014027428,0.0009776126,0.0010867966,0.0017300196,0.00064159645,0.0014859255,0.0022415963,0.00064064265,0.0034866284],"category_scores_gemma":[0.0041703274,0.0004446194,0.0010275955,0.0016834299,0.0005957763,0.0023290871,0.0009770297,0.0017354725,0.0007590992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033887272,0.00030232573,0.002529617,0.00038206714,0.00018922969,0.00016545512,0.0002570516,0.5259039,0.014757543,0.2547139,0.025992803,0.17446715],"study_design_scores_gemma":[0.0000045943275,0.00000975204,0.00016803583,0.000005324063,0.000009015525,0.000010338796,0.000009162714,0.9783393,0.0004523456,0.02027231,0.00071300694,0.0000068619997],"about_ca_topic_score_codex":0.011100777,"about_ca_topic_score_gemma":0.0066846805,"teacher_disagreement_score":0.011100777,"about_ca_system_score_codex":0.001639977,"about_ca_system_score_gemma":0.0013038167,"threshold_uncertainty_score":0.022072315},"labels":[],"label_agreement":null},{"id":"W1581766213","doi":"10.1007/978-3-642-01818-3_37","title":"Belief Rough Set Classifier","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University","funders":"","keywords":"Rough set; Computer science; Classifier (UML); Artificial intelligence; Dominance-based rough set approach; Decision rule; Decision system; Decision process; Data mining; Machine learning; Pattern recognition (psychology); Mathematics; Operations research; Management science","score_opus":0.02750798398112032,"score_gpt":0.2510728954218307,"score_spread":0.2235649114407104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581766213","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.013209079,0.0035080628,0.95416266,0.0009183992,0.00077028037,0.00014193257,0.0006167693,0.0016580471,0.025014866],"genre_scores_gemma":[0.3676964,0.0038277602,0.5774121,0.00056043634,0.0011710281,0.00025128238,0.0026831676,0.00029278387,0.046104886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875736,0.0001711008,0.00008155708,0.00022238928,0.0006703481,0.0000972676],"domain_scores_gemma":[0.99908876,0.00029130967,0.00004888193,0.00017523384,0.00035888294,0.00003701514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012882819,0.00056968525,0.0014474612,0.0017123619,0.00081495236,0.0026652934,0.0013092365,0.0012390097,0.006330398],"category_scores_gemma":[0.0042541367,0.0003452004,0.0010573448,0.0013010516,0.00040361713,0.001759848,0.0008357052,0.001552702,0.004492066],"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.00027900448,0.0001235704,0.00080828543,0.00021818743,0.0001392621,0.000108921406,0.0000709685,0.023367133,0.005326408,0.059235964,0.029191304,0.88113093],"study_design_scores_gemma":[0.00003856272,0.00015179184,0.0014450063,0.00009525507,0.00018312664,0.0005321842,0.00007541579,0.8612148,0.012900702,0.08535184,0.03794382,0.00006743975],"about_ca_topic_score_codex":0.0013235682,"about_ca_topic_score_gemma":0.0013636786,"teacher_disagreement_score":0.006330398,"about_ca_system_score_codex":0.00064441207,"about_ca_system_score_gemma":0.0010473516,"threshold_uncertainty_score":0.021177292},"labels":[],"label_agreement":null},{"id":"W1581788834","doi":"10.1007/978-3-642-02998-1_12","title":"An Active Approach to Automatic Case Generation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Carleton University","funders":"","keywords":"Computer science; Sequence (biology); Domain (mathematical analysis); Artificial intelligence; Knowledge base; Base (topology); Expert system; Active learning (machine learning); Machine learning; Mathematics","score_opus":0.044316280826807705,"score_gpt":0.2948771930240831,"score_spread":0.2505609121972754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581788834","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.0021946544,0.000067341476,0.99193,0.00011138865,0.000032322627,0.00022801083,0.00011647953,0.0011286273,0.004191222],"genre_scores_gemma":[0.063872576,0.00009546327,0.9281555,0.00011696047,0.000045685556,0.0004636415,0.0006711558,0.00023323987,0.0063457945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976489,0.0007860214,0.00018058848,0.00042638823,0.00084532145,0.00011278242],"domain_scores_gemma":[0.99342877,0.0047087446,0.00016682873,0.0007679502,0.0007947527,0.00013291692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003452685,0.0008583802,0.0007325431,0.0025162129,0.0009951077,0.0026850393,0.004463186,0.0015176674,0.020790966],"category_scores_gemma":[0.010366132,0.0008320842,0.001179306,0.0015615283,0.0011969255,0.0032003773,0.0037451766,0.0016904749,0.0033120778],"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.00025338444,0.0003366774,0.0007397662,0.00025273982,0.000065294436,0.00022935121,0.0005138213,0.018031158,0.0075023505,0.08785381,0.01119673,0.873025],"study_design_scores_gemma":[0.00012929227,0.00011819804,0.0004958851,0.00013804997,0.00009354042,0.00049830927,0.00022451897,0.75052625,0.016026562,0.1971165,0.034590974,0.00004199844],"about_ca_topic_score_codex":0.001270424,"about_ca_topic_score_gemma":0.0020117287,"teacher_disagreement_score":0.020790966,"about_ca_system_score_codex":0.00060134626,"about_ca_system_score_gemma":0.0011075584,"threshold_uncertainty_score":0.06955272},"labels":[],"label_agreement":null},{"id":"W1581807827","doi":"10.1007/978-3-540-75755-9_6","title":"Averaged Configurations from Molecular Dynamics Simulations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; University of Calgary","funders":"","keywords":"Trajectory; Molecular dynamics; Computer science; Visualization; Nanosecond; Dynamics (music); Statistical physics; Scale (ratio); Physics; Data mining; Optics","score_opus":0.009315339215487958,"score_gpt":0.24894183387894694,"score_spread":0.23962649466345898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581807827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4253269,0.003989101,0.515322,0.0010819302,0.0011159641,0.00031429774,0.0045285015,0.004399301,0.04392184],"genre_scores_gemma":[0.85214186,0.001660456,0.13465074,0.00027564427,0.00037134573,0.0007093779,0.003981712,0.0022650703,0.003943816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.00017158585,0.000025978576,0.000075993295,0.00012834664,0.000046508732],"domain_scores_gemma":[0.9981523,0.0009917034,0.00012803625,0.00034573217,0.00022358027,0.00015860143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619419,0.00094062794,0.0020147017,0.0020195954,0.001167425,0.0014628606,0.0032529735,0.0015733391,0.009049831],"category_scores_gemma":[0.0050163087,0.0014760062,0.0010124168,0.0020390607,0.0012182246,0.0028705662,0.0012327108,0.0020309978,0.0012805626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009290052,0.0000589676,0.00051826896,0.00019035228,0.00009144933,0.00014118152,0.00007488346,0.9365069,0.0012772233,0.045574464,0.0027161476,0.012757267],"study_design_scores_gemma":[0.000017633425,0.000011626764,0.00017996732,0.000016889855,0.000011870245,0.000019036555,0.000008425021,0.973824,0.00036934877,0.025043609,0.00048125116,0.000016266655],"about_ca_topic_score_codex":0.0033241336,"about_ca_topic_score_gemma":0.004282505,"teacher_disagreement_score":0.009049831,"about_ca_system_score_codex":0.0012843834,"about_ca_system_score_gemma":0.00087662303,"threshold_uncertainty_score":0.03027469},"labels":[],"label_agreement":null},{"id":"W1581900214","doi":"10.1007/11814948_33","title":"Binary Clause Reasoning in QBF","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"DPLL algorithm; Computer science; Binary number; Binary decision diagram; Boolean satisfiability problem; Fragment (logic); True quantified Boolean formula; Resolution (logic); Context (archaeology); Inference; Binary tree; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.02207398825870749,"score_gpt":0.2750306988911787,"score_spread":0.2529567106324712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581900214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005491211,0.0008727485,0.9597837,0.0012707798,0.0001506824,0.00011699477,0.00021520683,0.000958517,0.03114018],"genre_scores_gemma":[0.24647361,0.0019880298,0.72215205,0.00075280754,0.00026648052,0.00030790854,0.001264618,0.00064239174,0.026152018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669087,0.001313805,0.00022695209,0.00037122742,0.0011478995,0.00024928947],"domain_scores_gemma":[0.99619114,0.0029886256,0.00008405746,0.00037298404,0.00031083636,0.00005238285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039960397,0.00075868267,0.0008475617,0.0014599584,0.001272884,0.0035227875,0.0026830826,0.0016584994,0.016638523],"category_scores_gemma":[0.008727079,0.0011687941,0.001788627,0.0023208172,0.003645767,0.010304171,0.0023582298,0.0043276623,0.002566891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004672317,0.000037954997,0.00007739541,0.00018264743,0.000015774418,0.00006272216,0.00021374166,0.0077903746,0.0007980014,0.93611866,0.004138512,0.050517548],"study_design_scores_gemma":[0.000028443272,0.000006737673,0.000032452892,0.00005234972,0.000016665932,0.00003667133,0.000039629955,0.028668426,0.0014707017,0.96072173,0.00891555,0.000010636271],"about_ca_topic_score_codex":0.005917649,"about_ca_topic_score_gemma":0.0048632873,"teacher_disagreement_score":0.016638523,"about_ca_system_score_codex":0.0027248934,"about_ca_system_score_gemma":0.0014490513,"threshold_uncertainty_score":0.05566138},"labels":[],"label_agreement":null},{"id":"W1581905079","doi":"10.1007/11546924_73","title":"Control-Based Quality Adaptation in Data Stream Management Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"","keywords":"Computer science; Adaptation (eye); Leverage (statistics); Data quality; Quality (philosophy); Distributed computing; Snapshot (computer storage); Database; Real-time computing; Data mining; Artificial intelligence; Operations management","score_opus":0.044759512239752566,"score_gpt":0.2916343012536584,"score_spread":0.24687478901390586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581905079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032275174,0.0019053924,0.95989746,0.00035183952,0.00020404997,0.00008747535,0.000045453166,0.0022084026,0.0030247993],"genre_scores_gemma":[0.8771872,0.0009685137,0.116238445,0.000219364,0.00031229752,0.00007374626,0.00014589554,0.0002624117,0.004592112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894017,0.00019437209,0.000092270784,0.00017664528,0.00050193776,0.00009457034],"domain_scores_gemma":[0.99814034,0.0007363018,0.00014929341,0.00025968146,0.0006435839,0.00007076624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270378,0.0004770933,0.00072674826,0.00063233933,0.00037907166,0.001761843,0.0015932407,0.00054290635,0.001697479],"category_scores_gemma":[0.0054545,0.0003218944,0.00026068676,0.0006971057,0.00058817526,0.001206923,0.00069194136,0.00095183705,0.0003436954],"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.000811552,0.0003758697,0.0021100824,0.0001891959,0.000084332,0.00016894356,0.00034920228,0.16625418,0.062433224,0.019153744,0.007591557,0.74047816],"study_design_scores_gemma":[0.000039824128,0.00010936507,0.00067585096,0.00001348973,0.00003075422,0.00008002044,0.00002479542,0.97501194,0.014497523,0.00640428,0.0030902135,0.000022010472],"about_ca_topic_score_codex":0.0032233528,"about_ca_topic_score_gemma":0.0019732811,"teacher_disagreement_score":0.0032233528,"about_ca_system_score_codex":0.0006921016,"about_ca_system_score_gemma":0.00041387457,"threshold_uncertainty_score":0.011249006},"labels":[],"label_agreement":null},{"id":"W1581922034","doi":"10.1007/978-3-642-04238-6_30","title":"A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Programming language; Executable; Protocol (science); Cryptographic protocol; Compiler; Theoretical computer science; Set (abstract data type); Modular design; Cryptography; Logic programming; Answer set programming; Algorithm","score_opus":0.043648287231606804,"score_gpt":0.28828919690571825,"score_spread":0.24464090967411145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581922034","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.0008638671,0.0001909484,0.99332654,0.0005385678,0.00008522176,0.00019340978,0.00008667542,0.0006873209,0.004027431],"genre_scores_gemma":[0.058497537,0.0008777577,0.929908,0.000869186,0.00042824086,0.0006851363,0.000583962,0.00039559527,0.0077545363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880619,0.0030187252,0.0011152935,0.0019142563,0.0048513846,0.0010384035],"domain_scores_gemma":[0.9924406,0.0043320167,0.0002499396,0.002056091,0.00073691196,0.00018438953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008492078,0.0024659648,0.0030212454,0.003506875,0.0027669535,0.007867151,0.010547552,0.00535614,0.012199056],"category_scores_gemma":[0.012983713,0.002175936,0.009252198,0.0037522395,0.008666939,0.014525582,0.009901915,0.011351007,0.0034999528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055892986,0.00008439129,0.00009849326,0.00033539438,0.00008879399,0.00010635127,0.00027024615,0.014139712,0.0019485865,0.94449097,0.0027558338,0.035625257],"study_design_scores_gemma":[0.000043728687,0.000032419386,0.000044055523,0.00006435773,0.000073959105,0.000080069665,0.000035355675,0.05373698,0.0023262636,0.9326965,0.0108357305,0.000030491177],"about_ca_topic_score_codex":0.0019447644,"about_ca_topic_score_gemma":0.0019532915,"teacher_disagreement_score":0.012199056,"about_ca_system_score_codex":0.0029237666,"about_ca_system_score_gemma":0.003575794,"threshold_uncertainty_score":0.044910967},"labels":[],"label_agreement":null},{"id":"W1581952794","doi":"10.1007/11424918_49","title":"Real-Time Decision Making for Large POMDPs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence; Time complexity; Machine learning; Algorithm","score_opus":0.020460163069960756,"score_gpt":0.2921280880127875,"score_spread":0.27166792494282677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581952794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017493322,0.0005503492,0.9735796,0.0004693787,0.00009039128,0.00009612023,0.00014515963,0.000453145,0.0071224924],"genre_scores_gemma":[0.5943746,0.0009662194,0.39356133,0.00018599915,0.00016507585,0.00046555782,0.00053516513,0.00034835585,0.009397615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857426,0.00046562374,0.00010678281,0.00032903877,0.00032224652,0.0002020685],"domain_scores_gemma":[0.9919321,0.0069545163,0.00029275753,0.00033704573,0.0002446062,0.00023896132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003559905,0.0012692248,0.002014533,0.00050828926,0.0011354235,0.002684978,0.0021310607,0.0016356271,0.009692225],"category_scores_gemma":[0.009661964,0.0015040705,0.0016058183,0.0009892833,0.0017911966,0.0043769847,0.0023386145,0.00394673,0.0008054521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018440376,0.00008340631,0.00022144747,0.0002918135,0.000063553074,0.00012957805,0.00017004652,0.86695457,0.0013233087,0.08476146,0.0024043012,0.04341225],"study_design_scores_gemma":[0.000027046859,0.00002161247,0.000042086645,0.000011968104,0.000011817171,0.000019974661,0.00002656823,0.91639745,0.00037455477,0.08223492,0.00082288065,0.000009067645],"about_ca_topic_score_codex":0.004458925,"about_ca_topic_score_gemma":0.0054581147,"teacher_disagreement_score":0.009692225,"about_ca_system_score_codex":0.0018796212,"about_ca_system_score_gemma":0.0018004228,"threshold_uncertainty_score":0.032423735},"labels":[],"label_agreement":null},{"id":"W1581988586","doi":"10.1007/3-540-44860-8_10","title":"Dynamic Mean Semi-variance Portfolio Selection","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Efficient frontier; Portfolio optimization; Portfolio; Variance (accounting); Downside risk; Selection (genetic algorithm); Computer science; Mathematical optimization; Modern portfolio theory; Optimization problem; Mathematics; Economics; Artificial intelligence; Finance","score_opus":0.0261651060344557,"score_gpt":0.30451822766717684,"score_spread":0.27835312163272113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581988586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008250875,0.0009781715,0.97678876,0.0003142593,0.00013978085,0.000017456445,0.00003463563,0.00027064583,0.013205461],"genre_scores_gemma":[0.58268297,0.0029941644,0.34150672,0.00037631075,0.0006518017,0.00019156355,0.00043127788,0.00039097865,0.070774086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947363,0.00014776191,0.000020576224,0.00007515538,0.0002529091,0.000029871038],"domain_scores_gemma":[0.9991799,0.00045205237,0.000059774346,0.000115911076,0.00015318453,0.000039174178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011202007,0.0005721331,0.0008584665,0.00043839126,0.00018548343,0.0010717303,0.000735651,0.0007010525,0.0046986574],"category_scores_gemma":[0.0029238944,0.0004236725,0.00052274327,0.00084621523,0.0004700607,0.0010002452,0.0009508985,0.0009820448,0.0013737371],"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.0001200117,0.000081296566,0.000736871,0.00014135643,0.00014418471,0.00011833117,0.00003980344,0.37032032,0.004700963,0.18800648,0.01424493,0.42134544],"study_design_scores_gemma":[0.000022555862,0.00007881122,0.00032558612,0.00002395044,0.000024058998,0.00017350519,0.000004488244,0.86165345,0.0016956801,0.12880395,0.007177528,0.000016453128],"about_ca_topic_score_codex":0.0001869734,"about_ca_topic_score_gemma":0.0002353074,"teacher_disagreement_score":0.0046986574,"about_ca_system_score_codex":0.0003910791,"about_ca_system_score_gemma":0.0004351282,"threshold_uncertainty_score":0.01571858},"labels":[],"label_agreement":null},{"id":"W1582032698","doi":"10.1007/978-3-540-89350-9_23","title":"Adaptivity and Personalization in Ubiquitous Learning Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Learning in Education","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Personalization; Computer science; Ubiquitous computing; Field (mathematics); Human–computer interaction; Multimedia; Personalized learning; Adaptive system; Adaptive learning; World Wide Web; Artificial intelligence; Teaching method; Open learning; Mathematics education","score_opus":0.016474142292446377,"score_gpt":0.23743739470964217,"score_spread":0.2209632524171958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582032698","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11273258,0.014018012,0.8012557,0.0012070835,0.0003440035,0.00007693175,0.00007398101,0.0012320614,0.06905958],"genre_scores_gemma":[0.9310405,0.0033683504,0.043725166,0.00013447419,0.00019904005,0.000062514,0.00006413101,0.00011019166,0.021295728],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946374,0.00016894449,0.00003657938,0.00011985147,0.00015547697,0.000055431312],"domain_scores_gemma":[0.999215,0.0004642539,0.00003685889,0.00018758501,0.000064001964,0.0000323037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257369,0.0003216496,0.00044788758,0.00027052843,0.00034831776,0.0019031534,0.00059303915,0.0008620761,0.0030579038],"category_scores_gemma":[0.0023023875,0.00033977488,0.00032716763,0.0005505867,0.0008167867,0.0034166684,0.0011754615,0.00097215304,0.00051462685],"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.0003212518,0.00015913494,0.0037013781,0.00043425153,0.00009545833,0.00057705224,0.0026485964,0.05504977,0.019899629,0.2453356,0.0059950207,0.6657829],"study_design_scores_gemma":[0.000054842196,0.00044123188,0.010790299,0.0002829753,0.00017920467,0.0028153479,0.0014534716,0.3908501,0.022019468,0.47933775,0.09163221,0.00014316822],"about_ca_topic_score_codex":0.0006878905,"about_ca_topic_score_gemma":0.0005523052,"teacher_disagreement_score":0.0030579038,"about_ca_system_score_codex":0.0003230639,"about_ca_system_score_gemma":0.0001535949,"threshold_uncertainty_score":0.010229707},"labels":[],"label_agreement":null},{"id":"W1582070848","doi":"10.1007/978-3-642-17461-2_32","title":"Approximate Ellipsoid in the Streaming Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Ellipsoid; Computation; Ball (mathematics); Bounded function; Computer science; Approximation algorithm; Factor (programming language); Algorithm; Mathematics; Mathematical analysis; Physics","score_opus":0.019580363951233283,"score_gpt":0.23865807748270756,"score_spread":0.2190777135314743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582070848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017726753,0.001415673,0.9704216,0.00066864316,0.000113184666,0.000029488894,0.00033965698,0.0001601542,0.009124807],"genre_scores_gemma":[0.57138205,0.0051220157,0.38195333,0.00048085576,0.00078467414,0.00027296488,0.0017856777,0.00053227803,0.037686143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927956,0.00029176593,0.000028274382,0.00009902838,0.00023598359,0.00006549378],"domain_scores_gemma":[0.9961438,0.002635389,0.00021024903,0.00034333378,0.00043090465,0.00023622798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647922,0.00076645525,0.0015670297,0.000996395,0.00048485975,0.0016470781,0.0023949826,0.0017553446,0.006124798],"category_scores_gemma":[0.0117377285,0.00061524456,0.000658565,0.0016742813,0.0010671803,0.0037946287,0.0021712035,0.0025068126,0.0008807976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013084091,0.000042567037,0.0005346274,0.00020208307,0.00003524391,0.000086668224,0.00008139483,0.40845174,0.00090442883,0.5425852,0.010631491,0.03631377],"study_design_scores_gemma":[0.000005843842,0.000008804722,0.00008029726,0.000010775124,0.0000035875878,0.000043262913,0.000011254411,0.8208404,0.00011345617,0.17751342,0.0013614767,0.0000073824554],"about_ca_topic_score_codex":0.004818575,"about_ca_topic_score_gemma":0.0032415155,"teacher_disagreement_score":0.006124798,"about_ca_system_score_codex":0.0013486833,"about_ca_system_score_gemma":0.0007466026,"threshold_uncertainty_score":0.020489454},"labels":[],"label_agreement":null},{"id":"W1582076997","doi":"10.1007/11732990_11","title":"Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"MicroRNA in disease regulation","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Microsoft","keywords":"microRNA; Computational biology; Gene; Gene expression; Biology; Regulation of gene expression; Genetics; Computer science","score_opus":0.016826481698970414,"score_gpt":0.2507421171134429,"score_spread":0.2339156354144725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582076997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3500252,0.0025293936,0.62483066,0.00031133593,0.00013182338,0.00033915008,0.007228957,0.009090702,0.005512701],"genre_scores_gemma":[0.3719829,0.0014797968,0.60681224,0.00027818748,0.00011373465,0.00047346542,0.01516829,0.0004734135,0.0032180115],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00012819638,0.00005536689,0.00020023694,0.00025524452,0.000052733852],"domain_scores_gemma":[0.9988796,0.0007229361,0.00013865872,0.0000894242,0.00013092287,0.00003852926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011451184,0.0008167739,0.0009642274,0.002656524,0.00023152147,0.0011238412,0.00059997145,0.00090306334,0.0014499106],"category_scores_gemma":[0.002593307,0.0005164209,0.00089655013,0.0022520283,0.0002965084,0.0009374093,0.00070047105,0.00055864814,0.00238749],"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.00077057676,0.0003269326,0.025468769,0.0007055036,0.0002684234,0.0004758343,0.00012236413,0.012498907,0.680334,0.0012241998,0.0023198253,0.27548468],"study_design_scores_gemma":[0.00010802204,0.0007600253,0.03781418,0.00010718918,0.00049640593,0.0025274088,0.0002500613,0.30226874,0.63254297,0.010854029,0.01213523,0.00013571748],"about_ca_topic_score_codex":0.0004076479,"about_ca_topic_score_gemma":0.0009480336,"teacher_disagreement_score":0.002656524,"about_ca_system_score_codex":0.00021074257,"about_ca_system_score_gemma":0.0003031034,"threshold_uncertainty_score":0.0060560703},"labels":[],"label_agreement":null},{"id":"W1582180905","doi":"10.1007/978-3-642-15769-1_16","title":"Compositional Bitvector Analysis for Concurrent Programs with Nested Locks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Computer science; Reachability; Synchronization (alternating current); Parallel computing; Algorithm; Concurrent data structure; Concurrency; Nested loop join; Data-flow analysis; Data flow diagram; Theoretical computer science; Distributed computing; Database","score_opus":0.015812295680514437,"score_gpt":0.24675884321214553,"score_spread":0.2309465475316311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582180905","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.016601453,0.00014099987,0.9788392,0.00009496013,0.000041808467,0.000048235426,0.00006587464,0.0010481809,0.0031192817],"genre_scores_gemma":[0.4859473,0.0004030205,0.5009245,0.0002150548,0.00014091725,0.0002250927,0.0004938749,0.0013914162,0.010258697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980312,0.00037710907,0.0001294915,0.00022300461,0.0009458107,0.00029342432],"domain_scores_gemma":[0.9973604,0.0012337269,0.00018758324,0.0006194667,0.0005146409,0.00008407911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031008,0.0008058513,0.00083832716,0.001552717,0.0009012114,0.0022682382,0.002007158,0.0007727304,0.0055640615],"category_scores_gemma":[0.0054112454,0.000660118,0.0014893487,0.0016699551,0.002131576,0.005218115,0.0027249698,0.0019101513,0.0010384416],"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.0002705458,0.00008387338,0.0010668574,0.00024848303,0.00004495614,0.00014985923,0.00049267913,0.030061916,0.015466187,0.85321385,0.002050479,0.09685034],"study_design_scores_gemma":[0.000028263421,0.000038248796,0.00020403259,0.000045761495,0.000050863924,0.0000878296,0.0000962393,0.24670248,0.014266778,0.733443,0.0050026528,0.000033788518],"about_ca_topic_score_codex":0.0016858132,"about_ca_topic_score_gemma":0.002456858,"teacher_disagreement_score":0.0055640615,"about_ca_system_score_codex":0.0011333935,"about_ca_system_score_gemma":0.0014326308,"threshold_uncertainty_score":0.018613636},"labels":[],"label_agreement":null},{"id":"W1582188219","doi":"10.1007/978-3-540-32290-0_9","title":"Estimators of Translocations and Inversions in Comparative Maps","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"Kempe Foundation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Estimator; Divergence (linguistics); Chromosome; Chromosomal translocation; Genome; Evolutionary biology; Biology; Genetics; Mathematics; Statistics; Gene","score_opus":0.01789364534163833,"score_gpt":0.2580672836086085,"score_spread":0.24017363826697014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582188219","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.01620848,0.0006977073,0.98175013,0.00011805,0.000025560772,0.000028902978,0.00012356923,0.00042061548,0.0006270586],"genre_scores_gemma":[0.27900565,0.0009367218,0.7143124,0.00013553274,0.00021009306,0.0003508522,0.0012010547,0.0005837076,0.0032640472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577314,0.0025349963,0.0001856919,0.00062284083,0.00072784594,0.00015544565],"domain_scores_gemma":[0.92941314,0.0631146,0.0017866713,0.0032192732,0.0018634087,0.0006027974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01254329,0.00087473483,0.0015568971,0.0032306858,0.00060075935,0.0016804273,0.0037715293,0.0023149247,0.0036982638],"category_scores_gemma":[0.08582938,0.0015614801,0.00082167826,0.0029506988,0.0025743858,0.0042932294,0.0023814396,0.0020930166,0.0009496038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000508686,0.00011488959,0.01554778,0.0004794914,0.000231718,0.00010503473,0.00036978922,0.30221817,0.005994386,0.2930179,0.0045629903,0.37684923],"study_design_scores_gemma":[0.000095295916,0.00013587013,0.004947062,0.000113108865,0.00006145607,0.00034368568,0.00010888263,0.63314694,0.0057055615,0.3515594,0.0037138418,0.00006884748],"about_ca_topic_score_codex":0.0008766798,"about_ca_topic_score_gemma":0.0011990886,"teacher_disagreement_score":0.01254329,"about_ca_system_score_codex":0.0012036304,"about_ca_system_score_gemma":0.0008918155,"threshold_uncertainty_score":0.066336036},"labels":[],"label_agreement":null},{"id":"W1582196312","doi":"10.1007/978-3-540-74260-9_91","title":"Towards Segmentation of Pedicles on Posteroanterior X-Ray Views of Scoliotic Patients","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Polytechnique Montréal; Centre Hospitalier Universitaire Sainte-Justine; École de Technologie Supérieure","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Computer vision; Rotation (mathematics); Active shape model; Orientation (vector space); Radiography; Pattern recognition (psychology); Medicine; Mathematics; Radiology; Geometry","score_opus":0.02087491148829941,"score_gpt":0.26426329965088563,"score_spread":0.24338838816258623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582196312","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.077373765,0.0051385965,0.9056779,0.0006688811,0.00014256765,0.00020159039,0.00076126517,0.0041733114,0.0058620735],"genre_scores_gemma":[0.11739086,0.003467933,0.87046766,0.00022879282,0.00016796053,0.000076893615,0.0019320232,0.0011043411,0.0051635383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00006098457,0.000033859385,0.00007965896,0.00013595387,0.00004835995],"domain_scores_gemma":[0.9992397,0.00033356203,0.000051417115,0.000074077085,0.00024094616,0.000060259867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994141,0.0008496742,0.0009032561,0.0021482601,0.00041079216,0.002611532,0.0013193438,0.0019863795,0.0034054434],"category_scores_gemma":[0.0022131389,0.00090258,0.0009312521,0.0012801265,0.00042216628,0.0008049107,0.001149871,0.0011991218,0.0026894175],"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.00032461004,0.00005777202,0.004507764,0.0005562946,0.000094454204,0.0010653598,0.0006115204,0.014442969,0.20314078,0.0026715095,0.010562014,0.761965],"study_design_scores_gemma":[0.00014114262,0.0003756599,0.04331603,0.00074010453,0.0004208708,0.015887551,0.0011394256,0.64464885,0.21286134,0.01767786,0.0626305,0.00016060132],"about_ca_topic_score_codex":0.0033082124,"about_ca_topic_score_gemma":0.0047912365,"teacher_disagreement_score":0.0034054434,"about_ca_system_score_codex":0.00035184107,"about_ca_system_score_gemma":0.0009838861,"threshold_uncertainty_score":0.011392355},"labels":[],"label_agreement":null},{"id":"W1582226505","doi":"10.1007/978-3-540-24595-7_46","title":"Degree Navigator TM : The Journey of a Visualization Software","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Visualization; Scope (computer science); Computer science; Software; Software visualization; Degree (music); Data science; Software engineering; Software development; Artificial intelligence; Software construction; Programming language","score_opus":0.03565101307521272,"score_gpt":0.3002408994293612,"score_spread":0.2645898863541485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582226505","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010622013,0.005315248,0.77372634,0.018978806,0.0014700376,0.00013681932,0.002024236,0.056418806,0.13130777],"genre_scores_gemma":[0.042189606,0.0059057507,0.6923612,0.0030219164,0.00059543835,0.00016205886,0.00314275,0.03989098,0.21273041],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893075,0.0002527722,0.00005835313,0.00018023755,0.00048605612,0.00009179666],"domain_scores_gemma":[0.99674904,0.0011847629,0.00009119002,0.0005458086,0.0007756483,0.0006535576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029087963,0.00063331943,0.00044873866,0.001475433,0.0008187758,0.0049898187,0.0017158116,0.0017076187,0.035379186],"category_scores_gemma":[0.007994081,0.0008283921,0.0005303649,0.0016794933,0.00094100565,0.007367824,0.0032937794,0.0044337823,0.016296484],"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.00009109635,0.00005530292,0.0006765376,0.00022403985,0.000019132127,0.00015367242,0.0028511218,0.001163083,0.007281772,0.08274252,0.32586035,0.57888144],"study_design_scores_gemma":[0.000022665534,0.000066171946,0.0004660098,0.00016800866,0.0000144939795,0.0004960175,0.00037427162,0.0046089063,0.0047942917,0.044660103,0.944275,0.00005395309],"about_ca_topic_score_codex":0.0030457333,"about_ca_topic_score_gemma":0.004226443,"teacher_disagreement_score":0.035379186,"about_ca_system_score_codex":0.0008762392,"about_ca_system_score_gemma":0.0021580409,"threshold_uncertainty_score":0.118355215},"labels":[],"label_agreement":null},{"id":"W1582259633","doi":"10.1007/11424918_4","title":"Adjusting the Autonomy of Collections of Agents in Multiagent Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Delegation; Autonomy; Computer science; Multi-agent system; Order (exchange); Resource (disambiguation); Control (management); Autonomous agent; Operations research; Management science; Risk analysis (engineering); Knowledge management; Artificial intelligence; Business; Engineering; Political science; Law","score_opus":0.03974433030557314,"score_gpt":0.26711807308597807,"score_spread":0.22737374278040492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582259633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17416401,0.0014288132,0.804753,0.00074106274,0.00026436703,0.00015686023,0.00005462894,0.0010461131,0.017391117],"genre_scores_gemma":[0.87931484,0.00044704287,0.11477212,0.000095753036,0.00010922448,0.00014434924,0.00009615182,0.00021362772,0.0048069884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981262,0.0007486074,0.0001232192,0.00036253527,0.00047562327,0.00016373677],"domain_scores_gemma":[0.9943036,0.0029359462,0.00037534066,0.001438736,0.00041453535,0.00053192227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027459594,0.00046636412,0.00097487704,0.0006289884,0.0013770511,0.0026325563,0.003037789,0.0011337746,0.00269131],"category_scores_gemma":[0.0121815605,0.00076774583,0.00065748073,0.00081329216,0.0021423409,0.007260605,0.004861372,0.0022600074,0.0006083895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009243433,0.00041396313,0.0044000703,0.00040499851,0.00020774461,0.00044963133,0.0035239856,0.46551546,0.024828944,0.23315668,0.005403888,0.26077026],"study_design_scores_gemma":[0.000110215246,0.0001901688,0.001127626,0.00004290679,0.00007000458,0.00020056637,0.00080177607,0.7072125,0.0090024285,0.2679128,0.013258333,0.00007065025],"about_ca_topic_score_codex":0.0007293764,"about_ca_topic_score_gemma":0.0009847812,"teacher_disagreement_score":0.003037789,"about_ca_system_score_codex":0.00071747025,"about_ca_system_score_gemma":0.000525517,"threshold_uncertainty_score":0.014522195},"labels":[],"label_agreement":null},{"id":"W1582266017","doi":"10.1007/978-3-540-89796-5_112","title":"Recognizing Human Action from Videos Using Histograms of Visual Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Histogram; Representation (politics); Bag-of-words model; Frame (networking); Artificial intelligence; Word (group theory); Feature (linguistics); Action (physics); Bag-of-words model in computer vision; Pattern recognition (psychology); Visual Word; Natural language processing; Action recognition; Computer vision; Image (mathematics); Mathematics; Image retrieval; Linguistics","score_opus":0.06096985200373099,"score_gpt":0.30199104100254454,"score_spread":0.24102118899881353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582266017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16906108,0.0049946145,0.8021495,0.00025161714,0.00047571506,0.00031651853,0.0050996076,0.006936346,0.010715049],"genre_scores_gemma":[0.6296005,0.005403882,0.34419772,0.00028951318,0.0003028149,0.00020454942,0.007796423,0.0003514517,0.011853106],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984777,0.000009615985,0.0000068392696,0.00006130544,0.000043292304,0.000031242915],"domain_scores_gemma":[0.99983764,0.000049638722,0.000025196476,0.00001859935,0.000045243105,0.000023710518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014971643,0.00075461133,0.00062746875,0.0015159559,0.00012562385,0.00060647185,0.00044130193,0.0004752743,0.0038302215],"category_scores_gemma":[0.0005899528,0.00020754324,0.00041847365,0.0014385517,0.00023453755,0.0008260144,0.0003723898,0.0003625524,0.002879784],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025282675,0.000086453554,0.002266985,0.00019685061,0.00005617111,0.00010970795,0.00004752595,0.0029555752,0.11862753,0.0006749384,0.006082298,0.86864316],"study_design_scores_gemma":[0.0001338874,0.001262566,0.10133232,0.00034961523,0.00043174188,0.003801063,0.0008653522,0.56667936,0.2758936,0.019201271,0.029847417,0.00020185666],"about_ca_topic_score_codex":0.0033684608,"about_ca_topic_score_gemma":0.0056785443,"teacher_disagreement_score":0.0038302215,"about_ca_system_score_codex":0.00021334027,"about_ca_system_score_gemma":0.000267787,"threshold_uncertainty_score":0.012813389},"labels":[],"label_agreement":null},{"id":"W1582270156","doi":"10.1007/3-540-45007-6_20","title":"On Enumeration of Müller Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Enumeration; Automaton; Combinatorics; Discrete mathematics; Set (abstract data type); Function (biology); Mathematics; Computer science; Theoretical computer science","score_opus":0.012557795738976621,"score_gpt":0.2317412304424569,"score_spread":0.21918343470348028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582270156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07663628,0.00552522,0.6049019,0.0028154915,0.0009924173,0.00016309935,0.0006119747,0.0012127869,0.30714077],"genre_scores_gemma":[0.61905795,0.0047343792,0.2529771,0.0011332458,0.0010486809,0.00051927974,0.0016091162,0.0008283937,0.11809183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985965,0.00057285256,0.00010291932,0.00019409556,0.00035804958,0.00017550665],"domain_scores_gemma":[0.99727494,0.0018323913,0.0000974158,0.00038830435,0.00030210792,0.00010492395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010620605,0.0009185742,0.0011525754,0.0019197774,0.0018802385,0.003441512,0.0014558412,0.0011509571,0.012472169],"category_scores_gemma":[0.0054316297,0.00087284896,0.0014937524,0.0026188442,0.0025040812,0.008331294,0.0032617315,0.0033637467,0.0023872172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002863443,0.000017192697,0.0001247672,0.00006600672,0.0000057189336,0.000038139806,0.00019683318,0.0012781633,0.0005522537,0.9726626,0.002630174,0.022399597],"study_design_scores_gemma":[0.0000037133298,0.0000070450897,0.00004732952,0.00002286919,0.0000045679612,0.000038986516,0.000035136538,0.0040758518,0.00041143666,0.9900747,0.005272266,0.0000061663277],"about_ca_topic_score_codex":0.0010130116,"about_ca_topic_score_gemma":0.0016440409,"teacher_disagreement_score":0.012472169,"about_ca_system_score_codex":0.0017163402,"about_ca_system_score_gemma":0.00087326654,"threshold_uncertainty_score":0.04172361},"labels":[],"label_agreement":null},{"id":"W1582286409","doi":"10.1007/3-540-45111-0_6","title":"An Evaluation of Formalisms for Negotiations in E-commerce","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":28,"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":"Rotation formalisms in three dimensions; Computer science; Serialization; Executable; Negotiation; Formalism (music); Software engineering; Formal specification; Programming language; Knowledge management","score_opus":0.0476265135963873,"score_gpt":0.3091787339130547,"score_spread":0.2615522203166674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582286409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08652003,0.005059415,0.8029109,0.006019942,0.00089034496,0.001431576,0.0011298845,0.0028435378,0.09319426],"genre_scores_gemma":[0.5084787,0.0028505647,0.47790855,0.0005552695,0.00027028887,0.000592638,0.0012312367,0.00071127986,0.0074014636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9787362,0.01258542,0.0014319314,0.00089739426,0.0056942357,0.00065485615],"domain_scores_gemma":[0.9356463,0.051281445,0.0014149267,0.005890936,0.004746135,0.0010201827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021450914,0.0012631508,0.0013766774,0.0028684242,0.0028932584,0.01008078,0.0036512427,0.0030186037,0.011190356],"category_scores_gemma":[0.06625288,0.00092190213,0.0019052703,0.004806061,0.004826347,0.017259011,0.005145154,0.0038266168,0.0013910991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048774938,0.00032803923,0.0006697452,0.0005465905,0.00006143469,0.00009120386,0.001163029,0.023559075,0.0008005109,0.8919537,0.0041288617,0.07621006],"study_design_scores_gemma":[0.00027988126,0.00026708812,0.00039527277,0.00041717163,0.0001228541,0.00012295137,0.0014786654,0.24730805,0.0021330516,0.7192404,0.028179869,0.000054743006],"about_ca_topic_score_codex":0.005414195,"about_ca_topic_score_gemma":0.003944556,"teacher_disagreement_score":0.021450914,"about_ca_system_score_codex":0.004127573,"about_ca_system_score_gemma":0.0034962043,"threshold_uncertainty_score":0.113444686},"labels":[],"label_agreement":null},{"id":"W1582311982","doi":"10.1007/978-3-540-70521-5_18","title":"Estimation of the Fracture Toughness of Soft Tissue from Needle Insertion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","cited_by":102,"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":"Fracture toughness; Fracture mechanics; Materials science; Penetration (warfare); Soft tissue; Work (physics); Fracture (geology); Toughness; Computer science; Biomedical engineering; Mechanics; Composite material; Mechanical engineering; Surgery; Engineering; Physics","score_opus":0.010643507686504926,"score_gpt":0.22012240560824914,"score_spread":0.2094788979217442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582311982","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.6122351,0.0029787046,0.38038552,0.00010134571,0.000071321316,0.000072619056,0.00087323517,0.0008400232,0.002442159],"genre_scores_gemma":[0.93103224,0.0011869153,0.06472803,0.000036337413,0.000042092925,0.00003438848,0.0006026518,0.00013555068,0.0022018065],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997074,0.000022471744,0.000012715937,0.00007173204,0.0001628011,0.000022879543],"domain_scores_gemma":[0.9987054,0.0007012309,0.00020155149,0.00009208596,0.0002450465,0.000054731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032540417,0.0005262789,0.0006261894,0.0012217328,0.0001734391,0.00049275905,0.0008757535,0.0011517627,0.001534557],"category_scores_gemma":[0.002036898,0.0005637785,0.0005314258,0.00071162457,0.00033908384,0.0006152619,0.0004832706,0.0005515802,0.00077666406],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064744835,0.000072375085,0.01736423,0.0005874978,0.00009421719,0.0003829493,0.00021825059,0.036420487,0.75934947,0.0003550874,0.00045254818,0.18405546],"study_design_scores_gemma":[0.000024046365,0.0007040842,0.15271527,0.00008496972,0.00016728252,0.0031285693,0.00028523174,0.51685,0.32225683,0.0019275208,0.00167422,0.00018201603],"about_ca_topic_score_codex":0.0013902991,"about_ca_topic_score_gemma":0.0028182704,"teacher_disagreement_score":0.001534557,"about_ca_system_score_codex":0.00024246112,"about_ca_system_score_gemma":0.00022937109,"threshold_uncertainty_score":0.0051335692},"labels":[],"label_agreement":null},{"id":"W1582332289","doi":"10.1007/978-3-540-74208-1_26","title":"Derandomization of Euclidean Random Walks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","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 Toronto","funders":"","keywords":"Random walk; Euclidean space; Corollary; Combinatorics; Euclidean geometry; Binary logarithm; Space (punctuation); Dirichlet distribution; Euclidean distance; Mathematics; Computer science; Discrete mathematics; Statistics; Mathematical analysis; Geometry","score_opus":0.05354793019906154,"score_gpt":0.33273044431317816,"score_spread":0.27918251411411665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582332289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0365921,0.0024236385,0.9107105,0.0023241458,0.00036173634,0.0001216482,0.0004051168,0.0005396771,0.046521377],"genre_scores_gemma":[0.7519406,0.0048421263,0.17007749,0.0018430864,0.0012978229,0.0012614707,0.0018322337,0.0018847142,0.06502053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99339974,0.003684096,0.00024668514,0.0009605096,0.0012309168,0.00047812043],"domain_scores_gemma":[0.96955824,0.023065323,0.000968059,0.0040719607,0.0015653643,0.0007709631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071064173,0.0013399574,0.0019864861,0.0020275696,0.0012855588,0.0030324545,0.0032554837,0.0021452438,0.011601025],"category_scores_gemma":[0.039315768,0.00092970335,0.0016969797,0.0017161155,0.005214624,0.0059337346,0.0042967373,0.0061701355,0.002116354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051870175,0.00001535625,0.00018677564,0.00006954202,0.000022463631,0.000029296925,0.000063840474,0.021196611,0.0003946551,0.96787304,0.0024319885,0.007664527],"study_design_scores_gemma":[0.000023056826,0.000016207874,0.00014474067,0.000034814137,0.000010843237,0.000046149966,0.000015154094,0.104406826,0.0004471996,0.8921809,0.0026587239,0.000015438945],"about_ca_topic_score_codex":0.0012636738,"about_ca_topic_score_gemma":0.0011931122,"teacher_disagreement_score":0.011601025,"about_ca_system_score_codex":0.003053408,"about_ca_system_score_gemma":0.001961426,"threshold_uncertainty_score":0.0388093},"labels":[],"label_agreement":null},{"id":"W158237656","doi":"10.1007/978-3-642-33509-9_47","title":"Experimental Test of an Interacting Multiple Model Filtering Algorithm for Actuator Fault Detection and Diagnosis of an Unmanned Quadrotor Helicopter","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Testbed; Actuator; Computer science; Fault (geology); Control theory (sociology); Fault detection and isolation; Control engineering; Algorithm; Control (management); Engineering; Artificial intelligence","score_opus":0.015400101618774607,"score_gpt":0.25137579180903713,"score_spread":0.23597569019026252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158237656","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.7998885,0.00020280133,0.195119,0.0001466811,0.00015442914,0.00013386707,0.00016782961,0.0014919944,0.0026948724],"genre_scores_gemma":[0.97800964,0.000031645995,0.020801142,0.000025302048,0.000006348907,0.000025915017,0.0000958378,0.000016162145,0.0009880405],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998006,0.00003731011,0.000016053826,0.000050774514,0.000069907364,0.000025279756],"domain_scores_gemma":[0.9990268,0.0004396604,0.000081974795,0.00015123858,0.00025500575,0.00004543696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038968856,0.000411789,0.00030841096,0.00034031254,0.00029855617,0.00029266212,0.00062039273,0.0009638536,0.0019869513],"category_scores_gemma":[0.0009578573,0.00015769408,0.00020491172,0.00013355914,0.0002440815,0.0004347204,0.0002091683,0.00025834166,0.00028569493],"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.0058528227,0.0021569682,0.0058382507,0.0006304941,0.000176161,0.0005415749,0.00038104682,0.09350291,0.6757887,0.0023814053,0.0016592632,0.21109037],"study_design_scores_gemma":[0.00026641972,0.003959651,0.008528969,0.000020932204,0.000075350225,0.00026324292,0.00008597964,0.7550619,0.23018686,0.00052303623,0.0009971127,0.000030528558],"about_ca_topic_score_codex":0.0021566625,"about_ca_topic_score_gemma":0.001531027,"teacher_disagreement_score":0.0021566625,"about_ca_system_score_codex":0.00019040932,"about_ca_system_score_gemma":0.00026074046,"threshold_uncertainty_score":0.006646991},"labels":[],"label_agreement":null},{"id":"W1582403093","doi":"10.1007/978-3-642-13059-5_37","title":"A Model for Reasoning about Interaction with Users in Dynamic, Time Critical Environments for the Application of Hospital Decision Making","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Ask price; Human–computer interaction; Operations research","score_opus":0.01016602136726443,"score_gpt":0.2696577078625749,"score_spread":0.2594916864953105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582403093","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.005746611,0.00024381485,0.98596025,0.0010218724,0.000069444824,0.00019700715,0.00069448166,0.0009367451,0.0051296316],"genre_scores_gemma":[0.2239809,0.00053875,0.76576394,0.0005174965,0.000119406664,0.0009070877,0.002073068,0.00019828146,0.0059009846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977418,0.00083886646,0.00028679366,0.0003984395,0.00049519486,0.00023901935],"domain_scores_gemma":[0.99616915,0.0028323787,0.00021576285,0.00028645826,0.00029111587,0.0002051736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002726691,0.0014930875,0.0014171468,0.0014023561,0.0020766754,0.00580911,0.0046874788,0.0045918473,0.009835947],"category_scores_gemma":[0.0084826285,0.0011981371,0.0031552298,0.0017389023,0.0022699363,0.00696877,0.0029244926,0.0037374455,0.0016304308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028268987,0.00029134372,0.0016388781,0.00047021345,0.00020292397,0.0015075865,0.0022100466,0.26439667,0.0023133673,0.67993265,0.007946393,0.03880721],"study_design_scores_gemma":[0.00009311209,0.000046482466,0.00019856848,0.000073919924,0.00010526248,0.00020878795,0.00028577368,0.7076034,0.000791714,0.2806887,0.009857062,0.00004723563],"about_ca_topic_score_codex":0.020143837,"about_ca_topic_score_gemma":0.018233793,"teacher_disagreement_score":0.020143837,"about_ca_system_score_codex":0.0024551724,"about_ca_system_score_gemma":0.002767268,"threshold_uncertainty_score":0.04005319},"labels":[],"label_agreement":null},{"id":"W1582415383","doi":"10.1007/978-3-540-27824-5_82","title":"Throughput Maximization of ARQ Transmission Protocol Employing Adaptive Modulation and Coding","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Link adaptation; Automatic repeat request; Hybrid automatic repeat request; Selective Repeat ARQ; Throughput; Network packet; Computer network; Go-Back-N ARQ; Coding (social sciences); Linear network coding; Wireless; Channel (broadcasting); Fading; Telecommunications link; Telecommunications","score_opus":0.015527983320410084,"score_gpt":0.23864518623648084,"score_spread":0.22311720291607076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582415383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12199726,0.0019942482,0.8359045,0.0013093413,0.00020374646,0.00020175334,0.00027930172,0.0006782041,0.037431717],"genre_scores_gemma":[0.95629245,0.0012645994,0.0352464,0.00013747778,0.00018325045,0.00017952107,0.00010996857,0.00010203685,0.0064844224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865663,0.0006311571,0.000042884876,0.00014302364,0.0002945626,0.00023179168],"domain_scores_gemma":[0.99742055,0.0018271572,0.00012726324,0.00012530228,0.00044023906,0.000059428083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025239235,0.0012615974,0.0012741375,0.0007509127,0.00089694525,0.0017351139,0.0014315499,0.0011222974,0.0028056817],"category_scores_gemma":[0.0039008507,0.0006291431,0.0005265747,0.0013093549,0.0012779331,0.0012658366,0.0011229465,0.0008091319,0.0004398555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081692456,0.00019717157,0.0010969761,0.0006108938,0.00013471449,0.00059848704,0.00060790684,0.661929,0.060535546,0.21467279,0.0065735364,0.05222593],"study_design_scores_gemma":[0.000021161475,0.00012178318,0.0003159879,0.000020232435,0.000039076964,0.00012538626,0.000045656547,0.9766267,0.0045771645,0.017554635,0.000533177,0.000019165625],"about_ca_topic_score_codex":0.0019300091,"about_ca_topic_score_gemma":0.0016228503,"teacher_disagreement_score":0.0028056817,"about_ca_system_score_codex":0.001953717,"about_ca_system_score_gemma":0.001262746,"threshold_uncertainty_score":0.014175296},"labels":[],"label_agreement":null},{"id":"W1582462262","doi":"10.1007/11951148_7","title":"Timed Use Case Maps","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.03311866584520364,"score_gpt":0.27314880959548915,"score_spread":0.2400301437502855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582462262","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.015086365,0.0006553028,0.6161645,0.00052869983,0.00055065105,0.00029145225,0.000518161,0.0031018774,0.36310306],"genre_scores_gemma":[0.44927132,0.0018758514,0.2287682,0.00030707708,0.00032058964,0.0006152214,0.0012063948,0.0015257372,0.3161096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991345,0.00012399234,0.000052916665,0.00016281614,0.00040628974,0.00011956692],"domain_scores_gemma":[0.998865,0.0004164436,0.00006486009,0.00032703078,0.00023667571,0.00008991871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509778,0.0007541774,0.00033364497,0.0012904247,0.0009493686,0.0029097549,0.00097203767,0.00081514067,0.031092001],"category_scores_gemma":[0.0027869404,0.00049720024,0.0005773316,0.0012355568,0.0011973822,0.0033627606,0.0018232993,0.0012705565,0.0067108395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009707489,0.000051527386,0.00027261573,0.00013219987,0.000015300066,0.0008047842,0.0005577752,0.0035354274,0.0081337355,0.8554781,0.010762831,0.12015858],"study_design_scores_gemma":[0.000027408132,0.00006384419,0.00030554805,0.00009647517,0.0000470886,0.0013139696,0.00032881857,0.023269612,0.022862986,0.63977444,0.31187376,0.00003610143],"about_ca_topic_score_codex":0.0008140594,"about_ca_topic_score_gemma":0.0009371784,"teacher_disagreement_score":0.031092001,"about_ca_system_score_codex":0.0006528759,"about_ca_system_score_gemma":0.00073928403,"threshold_uncertainty_score":0.104013085},"labels":[],"label_agreement":null},{"id":"W1582485370","doi":"10.1007/11532378_25","title":"Experiments with Auto-Parallelizing SPEC2000FP Benchmarks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Parallel computing; Scalability; Thread (computing); Fortran; IBM; Software; Multi-core processor; Optimizing compiler; Programming language; Automatic parallelization; Simple (philosophy); Operating system","score_opus":0.016209437256597296,"score_gpt":0.25819420733706244,"score_spread":0.24198477008046515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582485370","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.9757817,0.00070868834,0.0063665695,0.0002761543,0.0002444716,0.00009518168,0.00097138557,0.0062668226,0.009289057],"genre_scores_gemma":[0.9559796,0.00047009587,0.030358749,0.00018920723,0.00008506647,0.00011921217,0.0045152297,0.0016167607,0.006666144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833006,0.00035738936,0.00015201734,0.000374207,0.0005020399,0.00028438793],"domain_scores_gemma":[0.993929,0.0025210707,0.0002823151,0.0014298311,0.0015046879,0.00033311677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001457281,0.0019083632,0.0009807331,0.0012416762,0.0010011537,0.00068285875,0.0024504915,0.0009970987,0.0038588154],"category_scores_gemma":[0.005345499,0.00075635535,0.0007010879,0.0027908697,0.0007666817,0.0013937976,0.00086692016,0.0012062237,0.0011735315],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0091042835,0.006856386,0.008100754,0.0019286905,0.00063796464,0.000978587,0.0007778662,0.43065968,0.19519562,0.0023184936,0.051830396,0.29161134],"study_design_scores_gemma":[0.0018055054,0.0055199824,0.011060414,0.000056623943,0.0003219737,0.00036417795,0.0005686191,0.7255497,0.242503,0.0020106363,0.010110862,0.00012851643],"about_ca_topic_score_codex":0.012322688,"about_ca_topic_score_gemma":0.010034244,"teacher_disagreement_score":0.012322688,"about_ca_system_score_codex":0.00069612317,"about_ca_system_score_gemma":0.0008831734,"threshold_uncertainty_score":0.02450192},"labels":[],"label_agreement":null},{"id":"W1582546973","doi":"10.1007/11559573_70","title":"Content-Based Image Retrieval Using Perceptual Shape Features","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Dalhousie University","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Computer vision; Image retrieval; Similarity (geometry); Perception; Histogram; Content-based image retrieval; Feature (linguistics); Image (mathematics); Enhanced Data Rates for GSM Evolution; Image texture; Image processing","score_opus":0.04326116863449117,"score_gpt":0.2777295950031737,"score_spread":0.2344684263686825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582546973","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.08148485,0.0038099908,0.90363145,0.00019206374,0.0002649762,0.0002515769,0.0005200024,0.002725422,0.0071196863],"genre_scores_gemma":[0.37012622,0.0033406431,0.61009073,0.00024870565,0.00032926362,0.00018367513,0.0020190666,0.00045646835,0.013205207],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997162,0.000028832073,0.000014995633,0.00004681876,0.00015968713,0.00003340222],"domain_scores_gemma":[0.99958354,0.0001114835,0.000029634544,0.00007679084,0.00017424766,0.000024311243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027140888,0.0006921468,0.0012493078,0.0021295485,0.00028288423,0.00090943807,0.00083494786,0.00064571016,0.00408563],"category_scores_gemma":[0.0010152482,0.00028092894,0.00072930247,0.0025867622,0.00036798223,0.0014618768,0.0006744804,0.00040164753,0.0030805038],"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.00048315024,0.00012235715,0.00036790676,0.0002568641,0.000047812446,0.00010778782,0.0000378338,0.0048541864,0.4119043,0.001564918,0.0049417885,0.57531106],"study_design_scores_gemma":[0.00015568465,0.00079895294,0.00752657,0.00005193536,0.0003074607,0.0019139207,0.00015950008,0.58379644,0.38732973,0.005731728,0.012123954,0.00010407632],"about_ca_topic_score_codex":0.0013149312,"about_ca_topic_score_gemma":0.0019110688,"teacher_disagreement_score":0.00408563,"about_ca_system_score_codex":0.0003319688,"about_ca_system_score_gemma":0.00029373696,"threshold_uncertainty_score":0.013667822},"labels":[],"label_agreement":null},{"id":"W1582612001","doi":"10.1007/11889663_18","title":"Conditional Encrypted Mapping and Comparing Encrypted Numbers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Encryption; Extension (predicate logic); Theoretical computer science; Common value auction; Variety (cybernetics); Cryptography; Computer security; Artificial intelligence; Mathematics; Programming language","score_opus":0.01629565653645883,"score_gpt":0.22689966167781167,"score_spread":0.21060400514135283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582612001","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.05623675,0.00035755255,0.9255813,0.00031447166,0.00029072017,0.000106291795,0.00029812485,0.001154736,0.015660064],"genre_scores_gemma":[0.53444415,0.00043965311,0.4461133,0.00013602873,0.00015762838,0.00013878083,0.0009485795,0.0005189807,0.01710285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695814,0.00080650195,0.0002610009,0.00050869375,0.0012023159,0.00026331656],"domain_scores_gemma":[0.9931687,0.0032354554,0.0004222961,0.001997446,0.0010346498,0.00014143746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212565,0.00044541986,0.0007658588,0.0015764995,0.00072240323,0.0028624088,0.0016958581,0.00076495507,0.0070883026],"category_scores_gemma":[0.017149676,0.00036204088,0.00056959834,0.002265282,0.0015854826,0.00790792,0.002791171,0.00138962,0.0015943546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005738761,0.000053026066,0.0017039585,0.00016123411,0.000036110046,0.00030605076,0.00032549584,0.017413514,0.006809299,0.7012845,0.005031472,0.2663014],"study_design_scores_gemma":[0.000024708408,0.00013120129,0.0011489048,0.00007632138,0.00005040967,0.0009573116,0.00019113664,0.1817361,0.02961484,0.76899606,0.017019827,0.000053228803],"about_ca_topic_score_codex":0.0004710208,"about_ca_topic_score_gemma":0.000409603,"teacher_disagreement_score":0.0070883026,"about_ca_system_score_codex":0.0009234111,"about_ca_system_score_gemma":0.0011329051,"threshold_uncertainty_score":0.023712754},"labels":[],"label_agreement":null},{"id":"W1582613544","doi":"10.1007/978-3-642-13193-6_13","title":"Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":53,"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":"Intuition; Algorithm; Phylogenetic tree; Computer science; Branching (polymer chemistry); Tree (set theory); Combinatorics; Running time; Mathematics; Chemistry","score_opus":0.016008449975772172,"score_gpt":0.29301237441610245,"score_spread":0.2770039244403303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582613544","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.32882142,0.0094005605,0.58189416,0.003474923,0.0019270622,0.0008426591,0.006153489,0.025164513,0.042321138],"genre_scores_gemma":[0.47746676,0.0013246787,0.50595546,0.00047218663,0.00035679722,0.00045010753,0.0054362654,0.0020504103,0.0064873183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918339,0.0019996068,0.0005402026,0.0016707341,0.0028031038,0.0011524357],"domain_scores_gemma":[0.9312489,0.04920665,0.0015916472,0.010653274,0.005656128,0.0016434586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008767871,0.002297585,0.0026631055,0.00271687,0.0034836626,0.0045333914,0.0045227087,0.0036056307,0.01574115],"category_scores_gemma":[0.034460865,0.00096395635,0.0025138024,0.005654799,0.0022353758,0.015713941,0.0031141883,0.0050654123,0.0039902823],"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.009425295,0.003076727,0.0053397524,0.0017167847,0.0003990401,0.00018555833,0.00080140744,0.1828876,0.011751732,0.07520239,0.07401741,0.63519627],"study_design_scores_gemma":[0.0014797312,0.00082864054,0.0012448963,0.00013035147,0.00023441768,0.0003058561,0.00051147485,0.7991072,0.013581995,0.17612782,0.0063629034,0.0000846781],"about_ca_topic_score_codex":0.010272369,"about_ca_topic_score_gemma":0.01024236,"teacher_disagreement_score":0.01574115,"about_ca_system_score_codex":0.00575572,"about_ca_system_score_gemma":0.0063741803,"threshold_uncertainty_score":0.052659333},"labels":[],"label_agreement":null},{"id":"W1582798159","doi":"10.1007/978-3-540-77006-0_5","title":"Fine Tuning the Persuasion in Persuasive Games","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":50,"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":"Persuasion; Computer science; Persuasive technology; Perspective (graphical); Set (abstract data type); Identity (music); Human–computer interaction; Control (management); Point (geometry); Psychology; Social psychology; Aesthetics; Artificial intelligence","score_opus":0.03136172887889315,"score_gpt":0.2888871802117687,"score_spread":0.2575254513328755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582798159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4234848,0.0020465588,0.54052585,0.0008572304,0.00045463972,0.00029173834,0.00005759071,0.0023356213,0.029945832],"genre_scores_gemma":[0.9725203,0.000106595624,0.02471663,0.00007852758,0.00004115467,0.0000685429,0.000017949009,0.000091041824,0.0023592168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998279,0.00082874065,0.00009533568,0.0002878114,0.00037349656,0.00013556161],"domain_scores_gemma":[0.98649395,0.011248956,0.00043470267,0.0008373434,0.0007087517,0.00027632332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021046093,0.0008568555,0.0007936988,0.0005838227,0.0003876361,0.0021680684,0.0011445256,0.0016706565,0.0061257444],"category_scores_gemma":[0.024186319,0.00049947866,0.0002910863,0.0002515139,0.0005288384,0.0025250367,0.001217135,0.0020092393,0.0012159669],"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.0025865599,0.0023308937,0.0039345613,0.0010776751,0.00027858303,0.00027102194,0.0013379231,0.11279931,0.15514942,0.075144365,0.00426304,0.64082664],"study_design_scores_gemma":[0.00028711226,0.001333091,0.0035160675,0.000095679214,0.00019617334,0.00035870008,0.00032594716,0.82617795,0.042816278,0.11982276,0.0049922736,0.00007791331],"about_ca_topic_score_codex":0.0001920289,"about_ca_topic_score_gemma":0.00021841632,"teacher_disagreement_score":0.0061257444,"about_ca_system_score_codex":0.00027270577,"about_ca_system_score_gemma":0.00034996736,"threshold_uncertainty_score":0.020492673},"labels":[],"label_agreement":null},{"id":"W1582856601","doi":"10.1007/3-540-44839-x_49","title":"Neural Based Approach to Keyword Extraction from Documents","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Ottawa","funders":"","keywords":"Keyword extraction; Computer science; Information retrieval; Extraction (chemistry); Natural language processing; Keyword search; Artificial intelligence; Chromatography; Chemistry","score_opus":0.02153317523767367,"score_gpt":0.25587242617168504,"score_spread":0.23433925093401137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582856601","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.0432989,0.0045565907,0.9338999,0.0004433976,0.00031303463,0.0003382935,0.0021148012,0.007737278,0.007297842],"genre_scores_gemma":[0.21496964,0.002918022,0.7466512,0.00028885234,0.00025847234,0.00031685538,0.0047628838,0.00026075795,0.029573297],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994342,0.00008667051,0.00008584206,0.000121675825,0.00021188144,0.000059702154],"domain_scores_gemma":[0.9988965,0.00041416407,0.00006136241,0.00009510741,0.0005047609,0.000028125443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055599696,0.00062613125,0.0007997391,0.0023742963,0.0005555506,0.0011735808,0.0011740056,0.00089168904,0.0035570562],"category_scores_gemma":[0.0018723041,0.00035724454,0.0006931165,0.0029221727,0.00032293765,0.0014254242,0.0006966949,0.00071197056,0.002709523],"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.00036637366,0.00017627417,0.0008534014,0.00045446944,0.00009627337,0.0001945807,0.00011337925,0.013929198,0.05267707,0.0030700588,0.007608178,0.92046064],"study_design_scores_gemma":[0.000084322266,0.00028613015,0.003454647,0.000097147305,0.00032359592,0.00086166756,0.00023672232,0.8605529,0.09453886,0.0155343395,0.023938105,0.000091580034],"about_ca_topic_score_codex":0.008194011,"about_ca_topic_score_gemma":0.014645993,"teacher_disagreement_score":0.008194011,"about_ca_system_score_codex":0.0007014631,"about_ca_system_score_gemma":0.0010966825,"threshold_uncertainty_score":0.016292632},"labels":[],"label_agreement":null},{"id":"W158287491","doi":"10.1007/bfb0023872","title":"A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Constructive; Constructive proof; Mathematical proof; Mathematics; Lemma (botany); Discrete mathematics; Combinatorics; Tree (set theory); Minor (academic); Computer science","score_opus":0.025305504328420197,"score_gpt":0.27296282240515024,"score_spread":0.24765731807673005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158287491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030689787,0.0016892417,0.795251,0.005347607,0.0020643896,0.00021073445,0.0009937759,0.0017982451,0.1619552],"genre_scores_gemma":[0.45296356,0.002246101,0.44793692,0.002866422,0.0016967949,0.0003839589,0.0012782223,0.0012567155,0.0893712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.0001702256,0.000036518253,0.00014955172,0.0002206173,0.000078129335],"domain_scores_gemma":[0.9979387,0.0011052542,0.000085253734,0.00025257972,0.0004432282,0.00017492265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013113705,0.00077375426,0.0005568696,0.0009795196,0.001376368,0.0022618403,0.001069808,0.0007028991,0.010803936],"category_scores_gemma":[0.0026985302,0.001181866,0.0017770284,0.0011667763,0.0026557788,0.005586287,0.002274563,0.003949016,0.0027658606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040113588,0.00003999395,0.00017093004,0.00012838613,0.000014574599,0.00014560406,0.0005056852,0.00054444786,0.004971931,0.9644792,0.012241178,0.016718062],"study_design_scores_gemma":[0.000026997326,0.000037543825,0.0004391581,0.000037384936,0.000036308647,0.00040636465,0.00013537519,0.0025340463,0.003784572,0.94736165,0.04517492,0.000025673497],"about_ca_topic_score_codex":0.0015784875,"about_ca_topic_score_gemma":0.0025323625,"teacher_disagreement_score":0.010803936,"about_ca_system_score_codex":0.0011901287,"about_ca_system_score_gemma":0.0007467221,"threshold_uncertainty_score":0.036142766},"labels":[],"label_agreement":null},{"id":"W1582875974","doi":"10.1007/978-3-642-21073-0_39","title":"An Entropy-Based Technique for Nonrigid Medical Image Alignment","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision","score_opus":0.017956009144947563,"score_gpt":0.29223853256918547,"score_spread":0.2742825234242379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582875974","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.0040305457,0.00029626547,0.9941413,0.000055474415,0.00005865544,0.000027675602,0.000039597824,0.0004365769,0.0009140081],"genre_scores_gemma":[0.081724904,0.00062141044,0.91213864,0.000110837296,0.00013430667,0.00006661533,0.00024735095,0.00037751422,0.0045783203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993049,0.00009056267,0.000038812508,0.00009196681,0.00043318328,0.000040548508],"domain_scores_gemma":[0.99937147,0.00026724266,0.000064873355,0.00013653065,0.00013329925,0.000026484113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070130435,0.0005758006,0.00068860245,0.001282292,0.00042358483,0.0008484033,0.0009102686,0.0007037843,0.0036602307],"category_scores_gemma":[0.001759993,0.00052071526,0.00064025534,0.0012458266,0.0005442187,0.001348754,0.0015811259,0.0010274163,0.0012187643],"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.00023358574,0.0000794112,0.0004350499,0.0002090551,0.000071494585,0.00018225088,0.00010838056,0.022142828,0.25651228,0.01253924,0.0028516036,0.70463485],"study_design_scores_gemma":[0.000028524068,0.00020912454,0.0042425054,0.000053457745,0.00009047803,0.0024040071,0.000053909396,0.70149446,0.2612464,0.014450902,0.01563692,0.00008934099],"about_ca_topic_score_codex":0.00043931205,"about_ca_topic_score_gemma":0.0010724135,"teacher_disagreement_score":0.0036602307,"about_ca_system_score_codex":0.0002600731,"about_ca_system_score_gemma":0.00054007076,"threshold_uncertainty_score":0.012244701},"labels":[],"label_agreement":null},{"id":"W1582956184","doi":"10.1007/978-3-642-03832-7_13","title":"SeaTouch: A Haptic and Auditory Maritime Environment for Non Visual Cognitive Mapping of Blind Sailors","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Haptic technology; Modalities; Human–computer interaction; Graphics; Virtual reality; Virtual machine; Artificial intelligence; Computer vision; Computer graphics (images)","score_opus":0.014263541872554268,"score_gpt":0.23010928242282416,"score_spread":0.2158457405502699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582956184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2698159,0.0016333694,0.61421204,0.0008557497,0.0005327846,0.00029390346,0.0016812611,0.03212243,0.07885258],"genre_scores_gemma":[0.6986152,0.0010710146,0.22322246,0.00029643776,0.00013831457,0.00028601667,0.0013724193,0.0020728428,0.07292518],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998869,0.000029199213,0.0000045752113,0.000015928354,0.000035871588,0.000027632714],"domain_scores_gemma":[0.9997484,0.000087777626,0.000009508541,0.000036127632,0.00004568729,0.00007248111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024758623,0.00081173825,0.00036676068,0.00028466963,0.00063673593,0.0010873786,0.0011185549,0.00070506916,0.022984453],"category_scores_gemma":[0.0006617848,0.00027665147,0.00038395208,0.0002156334,0.000518802,0.0011613767,0.0028680626,0.0005177988,0.0028402223],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034998523,0.0004792459,0.0019942718,0.0011595805,0.00008150681,0.0015981141,0.0052650175,0.016415378,0.32201666,0.022496069,0.04448826,0.580506],"study_design_scores_gemma":[0.0005721202,0.003363759,0.01966401,0.00058878073,0.00032492154,0.0045340583,0.005750042,0.11503733,0.19287227,0.036648553,0.6200806,0.00056343834],"about_ca_topic_score_codex":0.0018469802,"about_ca_topic_score_gemma":0.0033897867,"teacher_disagreement_score":0.022984453,"about_ca_system_score_codex":0.0001974985,"about_ca_system_score_gemma":0.00063995825,"threshold_uncertainty_score":0.07689065},"labels":[],"label_agreement":null},{"id":"W1582956995","doi":"10.1007/978-3-540-69905-7_34","title":"Chirplet Transform Applied to Simulated and Real Blue Whale (Balaenoptera musculus) Calls","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Underwater Acoustics Research","field":"Earth and Planetary Sciences","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":"Université du Québec à Rimouski","funders":"","keywords":"Whale; Chirp; Computer science; Noise (video); Speech recognition; Acoustics; Window function; Artificial intelligence; Pattern recognition (psychology); Time–frequency analysis; Computer vision; Telecommunications; Radar; Physics","score_opus":0.015909605613184098,"score_gpt":0.23278628845053698,"score_spread":0.21687668283735287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582956995","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.96254337,0.00011044203,0.031776857,0.000114475006,0.00006568645,0.00001671077,0.00029819633,0.0005177042,0.0045564356],"genre_scores_gemma":[0.9883952,0.00009751356,0.008517589,0.00002023699,0.000011861289,0.0000074440486,0.00037942117,0.00010147603,0.0024692104],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995625,0.0000064507944,0.0000016917078,0.000007444672,0.000019891195,0.000008252085],"domain_scores_gemma":[0.9998222,0.000103752085,0.000010441938,0.000010799704,0.000041940064,0.00001085297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011178391,0.00020466415,0.00012543496,0.0003036275,0.00016450357,0.0002611074,0.0002351302,0.00049935223,0.0028167753],"category_scores_gemma":[0.0006747404,0.00009046395,0.00021363074,0.00039468493,0.0001956342,0.0002068368,0.00013844669,0.00025037263,0.00034786444],"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.0016564785,0.00021076419,0.0072005936,0.00040312513,0.000079256664,0.0019504243,0.0006927105,0.36347294,0.41652372,0.003863979,0.003951691,0.1999943],"study_design_scores_gemma":[0.000023048737,0.000085290296,0.020405933,0.000011391133,0.00002002446,0.00029484663,0.00019202034,0.9474113,0.029920224,0.00044938296,0.0011629891,0.000023534802],"about_ca_topic_score_codex":0.0053511634,"about_ca_topic_score_gemma":0.004911878,"teacher_disagreement_score":0.0053511634,"about_ca_system_score_codex":0.00015559865,"about_ca_system_score_gemma":0.00013476447,"threshold_uncertainty_score":0.010640025},"labels":[],"label_agreement":null},{"id":"W1582969422","doi":"10.1007/978-3-642-20807-2_6","title":"TSP on Cubic and Subcubic Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.027594923748835116,"score_gpt":0.27232444643889603,"score_spread":0.2447295226900609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582969422","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.13352998,0.009352405,0.09067818,0.002783535,0.0009938047,0.00014736153,0.0012631468,0.00048110427,0.7607706],"genre_scores_gemma":[0.5464774,0.01439012,0.09015881,0.0006536414,0.0011989331,0.0002402483,0.0031669298,0.00061996875,0.34309402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999759,0.00003241751,0.000009173038,0.000051921394,0.000102571285,0.000044902517],"domain_scores_gemma":[0.9996252,0.00016748968,0.000029643923,0.000057715206,0.000073622505,0.00004620674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012844236,0.0005732611,0.00061343476,0.001158366,0.001180318,0.0017102447,0.0012128667,0.00063375087,0.012764654],"category_scores_gemma":[0.0011076302,0.00043630402,0.0005192992,0.00460785,0.00080000923,0.002467457,0.0010148813,0.0019578002,0.0017909928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052501568,0.000056322788,0.0002459344,0.00038431524,0.000013329177,0.00019695179,0.00036639333,0.019397046,0.0013495676,0.80960786,0.050986532,0.11734313],"study_design_scores_gemma":[0.000018089306,0.000018810078,0.0005033238,0.000049323156,0.000013571721,0.00026170697,0.00015176513,0.031400654,0.0005837991,0.891597,0.07538819,0.0000138333435],"about_ca_topic_score_codex":0.011964169,"about_ca_topic_score_gemma":0.017451959,"teacher_disagreement_score":0.012764654,"about_ca_system_score_codex":0.0017152888,"about_ca_system_score_gemma":0.0010027139,"threshold_uncertainty_score":0.04270208},"labels":[],"label_agreement":null},{"id":"W1583055368","doi":"10.1007/978-3-540-24644-2_26","title":"To Inline or Not to Inline? Enhanced Inlining Decisions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Institute of Computing Technology, Chinese Academy of Sciences","keywords":"Heuristics; Computer science; Compiler; Suite; Adaptation (eye); Parallel computing; Speedup; Programming language; Operating system","score_opus":0.033876834559299136,"score_gpt":0.3127567003453888,"score_spread":0.2788798657860897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583055368","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.27841398,0.0014529668,0.49562192,0.007182518,0.0017857504,0.00023361837,0.00066595705,0.009749017,0.20489426],"genre_scores_gemma":[0.80063564,0.0004398778,0.15527754,0.0009079802,0.00042525056,0.00007653434,0.00042120996,0.0026093193,0.039206654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851304,0.000523987,0.00009373935,0.000270854,0.0003586799,0.00023964113],"domain_scores_gemma":[0.99322915,0.0036279373,0.00043592267,0.0015797946,0.0007894176,0.00033773115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001758915,0.0008199504,0.00057494536,0.00053679466,0.0007579416,0.0022064426,0.0009383373,0.00089768437,0.027977258],"category_scores_gemma":[0.015553955,0.00038691933,0.00035799798,0.0005564688,0.00046285058,0.0047135325,0.00091852434,0.0011151709,0.004216939],"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.0024093431,0.00037615286,0.004091752,0.00026579073,0.000054950855,0.00054947374,0.0006194229,0.02810546,0.018421141,0.120582074,0.06710583,0.7574185],"study_design_scores_gemma":[0.00038273918,0.0011138596,0.0034514677,0.0003161134,0.00020784198,0.0010225972,0.000816462,0.45513546,0.068198286,0.29582536,0.17339517,0.000134654],"about_ca_topic_score_codex":0.00049064524,"about_ca_topic_score_gemma":0.0015073767,"teacher_disagreement_score":0.027977258,"about_ca_system_score_codex":0.00041559522,"about_ca_system_score_gemma":0.00057480065,"threshold_uncertainty_score":0.09359324},"labels":[],"label_agreement":null},{"id":"W1583070323","doi":"10.1007/978-3-642-45278-9_13","title":"Domino Tatami Covering Is NP-Complete","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Domino; NP-complete; Algorithm; Computational complexity theory; Biology","score_opus":0.03364847834741935,"score_gpt":0.2691571672147257,"score_spread":0.23550868886730636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583070323","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.2927091,0.007853806,0.25505874,0.017094327,0.0015138857,0.00056037516,0.005557983,0.0024362898,0.4172155],"genre_scores_gemma":[0.8188723,0.005068814,0.07090632,0.0022325336,0.00071684,0.0006803326,0.0047641736,0.0007634864,0.095995255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950016,0.000055936605,0.000020833582,0.00014256978,0.00014823202,0.00013222762],"domain_scores_gemma":[0.9983559,0.0012243903,0.000059163256,0.00015426366,0.00012725643,0.00007903159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588601,0.00071081327,0.0012344468,0.0007317056,0.0019438325,0.0028747825,0.0008974308,0.0012721646,0.011693373],"category_scores_gemma":[0.0026839809,0.0007495633,0.0014191511,0.0017687146,0.001337303,0.0040602265,0.001909028,0.0026184295,0.0020016723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072390813,0.0002347108,0.0022144974,0.0016442669,0.00018779952,0.00078226195,0.00091265613,0.058919724,0.013626142,0.5956564,0.11646289,0.20863481],"study_design_scores_gemma":[0.00013574547,0.00005891964,0.0009014757,0.00014235354,0.00010779516,0.0005101422,0.00035003125,0.07388899,0.0055010803,0.8389927,0.07937029,0.000040556057],"about_ca_topic_score_codex":0.0025685776,"about_ca_topic_score_gemma":0.0028986186,"teacher_disagreement_score":0.011693373,"about_ca_system_score_codex":0.0016692869,"about_ca_system_score_gemma":0.0013245486,"threshold_uncertainty_score":0.03911829},"labels":[],"label_agreement":null},{"id":"W1583090871","doi":"10.1007/11545262_19","title":"EM Analysis of Rijndael and ECC on a Wireless Java-Based PDA","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Advanced Encryption Standard; Power analysis; Cryptography; Wireless; Elliptic curve cryptography; Embedded system; Encryption; Public-key cryptography; Computer network; Algorithm; Operating system","score_opus":0.01569831564602385,"score_gpt":0.2671285648309102,"score_spread":0.2514302491848863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583090871","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.5921205,0.0009053103,0.37082022,0.0006523336,0.00011036407,0.00009386667,0.00036738356,0.0021478543,0.032782007],"genre_scores_gemma":[0.972495,0.00016784032,0.015462547,0.000058357895,0.0000203936,0.000018005168,0.000107327694,0.00015165482,0.0115187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936694,0.00009864792,0.000025878584,0.00008217337,0.00029213424,0.00013428008],"domain_scores_gemma":[0.99829024,0.00096156175,0.00009416603,0.00033571196,0.00028762862,0.000030720694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000453996,0.00038267384,0.0007047662,0.0005301372,0.00042904567,0.00082459924,0.00089812843,0.0005219919,0.007358664],"category_scores_gemma":[0.0026702578,0.0001892132,0.00055365474,0.0006532774,0.0005181629,0.001669576,0.00062853325,0.00055801513,0.0008234999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018121277,0.00025585407,0.006081288,0.00047489133,0.00015822542,0.0012451442,0.00040767237,0.60956335,0.070213586,0.1960926,0.0065100146,0.10718514],"study_design_scores_gemma":[0.000033345586,0.00017217931,0.0017556151,0.000021647891,0.000059147253,0.00048305048,0.000073105824,0.9499166,0.031660844,0.013534275,0.0022657735,0.000024430608],"about_ca_topic_score_codex":0.001619056,"about_ca_topic_score_gemma":0.0012646164,"teacher_disagreement_score":0.007358664,"about_ca_system_score_codex":0.0009086057,"about_ca_system_score_gemma":0.0007437387,"threshold_uncertainty_score":0.024617195},"labels":[],"label_agreement":null},{"id":"W1583095495","doi":"10.1007/11499145_26","title":"Joint Spatial-Temporal Color Demosaicking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"McMaster University","funders":"Microsoft Research Asia","keywords":"Demosaicing; Artificial intelligence; Computer science; Computer vision; Bayer filter; Joint (building); Color filter array; Color image; Pattern recognition (psychology); Color gel; Image (mathematics); Image processing","score_opus":0.02982015481288668,"score_gpt":0.27006509705124593,"score_spread":0.24024494223835924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583095495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028940144,0.00022812527,0.99223,0.000054084034,0.00008812593,0.000010981281,0.00011534571,0.0005604102,0.003818855],"genre_scores_gemma":[0.06554714,0.0009869296,0.9145362,0.00008390654,0.000057421217,0.000024247192,0.00058913627,0.00032955167,0.01784541],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997489,0.000019167166,0.000011900099,0.000040749852,0.00015205595,0.000027238037],"domain_scores_gemma":[0.9996606,0.00004552831,0.000020099464,0.000109238514,0.0001462431,0.000018212844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040829272,0.0008166828,0.0005360296,0.00072324876,0.0002513552,0.0008672849,0.0006164608,0.0005293062,0.005372673],"category_scores_gemma":[0.0008638934,0.0003717239,0.0006835034,0.001209702,0.00034066424,0.00083563,0.0008190809,0.000604744,0.0032919499],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023218576,0.000080994396,0.0006809015,0.00021686821,0.00010468337,0.00012395161,0.000059889655,0.050601434,0.22284089,0.01851126,0.009681907,0.696865],"study_design_scores_gemma":[0.000016240629,0.00006383678,0.0021332507,0.00003299756,0.00010157065,0.0010047721,0.000057737157,0.7319155,0.21945821,0.016190551,0.02897185,0.000053558488],"about_ca_topic_score_codex":0.0019094169,"about_ca_topic_score_gemma":0.005832612,"teacher_disagreement_score":0.005372673,"about_ca_system_score_codex":0.00025041157,"about_ca_system_score_gemma":0.0006809417,"threshold_uncertainty_score":0.017973363},"labels":[],"label_agreement":null},{"id":"W1583108239","doi":"10.1007/11562931_18","title":"Reducing Inductive Definitions to Propositional Satisfiability","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Computer science; Propositional calculus; Satisfiability; Answer set programming; Reduction (mathematics); Programming language; Theoretical computer science; Well-formed formula; Semantics (computer science); Boolean satisfiability problem; Logic programming; Extension (predicate logic); Inductive logic programming; Class (philosophy); Knowledge representation and reasoning; Intermediate logic; Propositional variable; Mathematics; Description logic; Artificial intelligence","score_opus":0.029715358049574044,"score_gpt":0.2555019588503248,"score_spread":0.22578660080075075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583108239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015553373,0.0015525497,0.91495115,0.0037032997,0.0007176394,0.000120547076,0.000267698,0.0010010352,0.06213274],"genre_scores_gemma":[0.3606683,0.0034959917,0.5941016,0.0029473559,0.0017721158,0.0006177905,0.0021325168,0.0016437955,0.032620545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946727,0.0022590805,0.00036367442,0.0005644161,0.0016046222,0.00053543824],"domain_scores_gemma":[0.98498267,0.011577663,0.00033885278,0.0015412502,0.001341589,0.00021786494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00408326,0.001039321,0.0011503401,0.002484124,0.0019933034,0.0050182324,0.0055033625,0.0017329702,0.009748966],"category_scores_gemma":[0.022498136,0.0017918719,0.0030854484,0.0030750379,0.0067621437,0.012698215,0.010358459,0.01191372,0.002245436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002579143,0.000054984313,0.00015743365,0.00014951832,0.00002223142,0.000109748566,0.0006949204,0.0022164767,0.0005075961,0.9599374,0.0063965186,0.029727474],"study_design_scores_gemma":[0.0000119387105,0.0000065201234,0.00005207945,0.00003833526,0.000018190352,0.000046797737,0.00014265325,0.005450592,0.0008387772,0.9835687,0.009815329,0.000010002219],"about_ca_topic_score_codex":0.0020207951,"about_ca_topic_score_gemma":0.0025453654,"teacher_disagreement_score":0.009748966,"about_ca_system_score_codex":0.0027174475,"about_ca_system_score_gemma":0.0013826558,"threshold_uncertainty_score":0.032613516},"labels":[],"label_agreement":null},{"id":"W1583185913","doi":"10.1007/978-3-540-45193-8_70","title":"Unrestricted Nogood Recording in CSP Search","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Backtracking; Algorithm; Artificial intelligence","score_opus":0.021603511987683177,"score_gpt":0.25252858205326423,"score_spread":0.23092507006558105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583185913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016375644,0.0013146894,0.9423921,0.0003880829,0.00015537594,0.00012733889,0.00041691342,0.0022544512,0.036575437],"genre_scores_gemma":[0.38121322,0.001981093,0.5818794,0.00022416453,0.00022756749,0.00029790145,0.0012100408,0.0016537473,0.031312954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765956,0.00089947216,0.00015940423,0.00025157977,0.0007989561,0.00023099496],"domain_scores_gemma":[0.9950192,0.0030554668,0.00011427331,0.0013685459,0.00031446884,0.00012808823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022027357,0.0006525441,0.0015035936,0.0010218857,0.0012781054,0.0024852643,0.0025397167,0.000923167,0.010333213],"category_scores_gemma":[0.008359746,0.0008863701,0.00082684006,0.0034618701,0.0020110789,0.0058007035,0.0023243995,0.0032721036,0.0020809171],"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.0007587545,0.00016194643,0.0003506441,0.0005942829,0.000043017284,0.0001568431,0.00035095072,0.050676,0.003949533,0.59309256,0.014800071,0.3350654],"study_design_scores_gemma":[0.000093633156,0.00009044633,0.000139689,0.00008633907,0.000046404628,0.00024095089,0.00009132452,0.18347387,0.006040193,0.7928589,0.01679105,0.000047250884],"about_ca_topic_score_codex":0.003506578,"about_ca_topic_score_gemma":0.0053753513,"teacher_disagreement_score":0.010333213,"about_ca_system_score_codex":0.0011871962,"about_ca_system_score_gemma":0.002044712,"threshold_uncertainty_score":0.03456801},"labels":[],"label_agreement":null},{"id":"W158321033","doi":"10.1007/978-3-540-75853-2_8","title":"Availability-Aware Multiple Working-Paths Capacity Provisioning in GMPLS Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Backup; Computer network; Multiprotocol Label Switching; Computer science; Provisioning; Distributed computing; Quality of service","score_opus":0.023654736126362524,"score_gpt":0.23276949708620923,"score_spread":0.2091147609598467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158321033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12277759,0.0025809123,0.86308557,0.0004977819,0.00016893639,0.00004509967,0.00013841782,0.0013308636,0.00937496],"genre_scores_gemma":[0.9581773,0.00037731565,0.0399589,0.0000386871,0.000059850816,0.000016022463,0.00005135644,0.000056348257,0.0012641101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996008,0.00010768813,0.000016961596,0.0000621876,0.00014649761,0.00006598054],"domain_scores_gemma":[0.9992563,0.00043115302,0.0000738619,0.00009165598,0.00011640449,0.00003068481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006604204,0.00044887062,0.00048233222,0.00041620276,0.0004799181,0.0007887535,0.0011549828,0.00037416603,0.0011365998],"category_scores_gemma":[0.0013368019,0.00037285232,0.00023320211,0.0005742933,0.0003253105,0.0011129525,0.0006934732,0.0005885067,0.00014728212],"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.00025066233,0.00007379931,0.00068879017,0.0001883281,0.000050799223,0.00016190522,0.00013544649,0.76815015,0.039371002,0.016458511,0.0027241192,0.17174658],"study_design_scores_gemma":[0.000004079864,0.000025332729,0.00033508748,0.000010647454,0.00001228134,0.00008753559,0.000022742897,0.9855597,0.0047717076,0.00825537,0.00090421573,0.000011290625],"about_ca_topic_score_codex":0.0012149441,"about_ca_topic_score_gemma":0.0026833569,"teacher_disagreement_score":0.0012149441,"about_ca_system_score_codex":0.00072637846,"about_ca_system_score_gemma":0.000434377,"threshold_uncertainty_score":0.0052702427},"labels":[],"label_agreement":null},{"id":"W1583242700","doi":"10.1007/11827405_55","title":"Cleaning Web Pages for Effective Web Content Mining","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Windsor","funders":"","keywords":"Web page; Computer science; Information retrieval; World Wide Web; Static web page; Web mining; Block (permutation group theory); Categorization; Web content; Web navigation; Artificial intelligence; Mathematics","score_opus":0.026986326645245234,"score_gpt":0.24499266289061916,"score_spread":0.21800633624537394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583242700","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.06692807,0.002955519,0.8995692,0.00089857745,0.0003916332,0.0008805329,0.005184369,0.019418675,0.0037734504],"genre_scores_gemma":[0.16771983,0.0015021251,0.8063968,0.00033277713,0.00033039594,0.00047317985,0.014416713,0.0016499,0.0071782554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971148,0.00052920886,0.00022640688,0.00046747038,0.0014121541,0.00025001419],"domain_scores_gemma":[0.99512756,0.0018154366,0.00028473992,0.0011486537,0.0014843051,0.0001393919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014393815,0.0013950771,0.0020960483,0.009524599,0.001661125,0.0027820559,0.0017995259,0.0017995044,0.0039369944],"category_scores_gemma":[0.010589147,0.0009448144,0.0016994317,0.00625577,0.0006825191,0.003704962,0.0016820224,0.0017797153,0.0059640193],"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.00022132066,0.00050290435,0.009100696,0.00069179235,0.00019269573,0.00032730759,0.00032408262,0.005603604,0.052916616,0.003366489,0.041435424,0.885317],"study_design_scores_gemma":[0.00011170345,0.00037514174,0.020404227,0.0003853069,0.00084720284,0.0025166771,0.0015712809,0.5818275,0.23868094,0.058660235,0.09445935,0.00016035212],"about_ca_topic_score_codex":0.003173473,"about_ca_topic_score_gemma":0.0049421526,"teacher_disagreement_score":0.009524599,"about_ca_system_score_codex":0.0005431152,"about_ca_system_score_gemma":0.0015867935,"threshold_uncertainty_score":0.0131706},"labels":[],"label_agreement":null},{"id":"W1583270413","doi":"10.1007/978-3-662-45803-7_25","title":"Morphing Schnyder Drawings of Planar Triangulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Morphing; Planar; Computer science; Computer graphics (images); Mathematics; Engineering drawing; Engineering","score_opus":0.01733986488737967,"score_gpt":0.2449281265707318,"score_spread":0.2275882616833521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583270413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06903517,0.00043431015,0.8873601,0.00017465414,0.00020360647,0.00012223083,0.000449205,0.0022270698,0.03999357],"genre_scores_gemma":[0.36917582,0.0010572566,0.5923158,0.00008394644,0.00005653954,0.00008945304,0.0014055802,0.0017310331,0.034084536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995382,0.000060145336,0.000024452067,0.000082588325,0.0002473135,0.00004735241],"domain_scores_gemma":[0.99956924,0.0001238157,0.00003627588,0.00015422683,0.000084940635,0.000031508018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002650238,0.0007189147,0.00050941744,0.0012331988,0.0004911087,0.0012649826,0.0011568383,0.00072525727,0.010767976],"category_scores_gemma":[0.0016033134,0.00088675955,0.0006363801,0.0011291298,0.00084944273,0.0014342319,0.0019567842,0.0018619532,0.002101605],"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.00013700858,0.00004702364,0.0007371054,0.00033705315,0.00005165241,0.0004013633,0.0009663437,0.1153316,0.04083321,0.34919065,0.0143207805,0.4776462],"study_design_scores_gemma":[0.000057781235,0.00014234266,0.001109266,0.00017569531,0.00006997861,0.001153405,0.00080782856,0.41422012,0.03860627,0.431575,0.11197937,0.000102887294],"about_ca_topic_score_codex":0.0017439655,"about_ca_topic_score_gemma":0.0049664425,"teacher_disagreement_score":0.010767976,"about_ca_system_score_codex":0.0005486873,"about_ca_system_score_gemma":0.00030695045,"threshold_uncertainty_score":0.036022425},"labels":[],"label_agreement":null},{"id":"W1583311479","doi":"10.1007/3-540-46506-5_10","title":"Parallel Job Scheduling: A Performance Perspective","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Carleton University","funders":"","keywords":"Computer science; Multiprocessing; Scheduling (production processes); Parallel computing; Distributed computing; Perspective (graphical); Range (aeronautics); Software; Multiprocessor scheduling; Dynamic priority scheduling; Two-level scheduling; Operating system; Mathematical optimization; Artificial intelligence","score_opus":0.02235564977128326,"score_gpt":0.26122483651582196,"score_spread":0.2388691867445387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583311479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024140073,0.058912173,0.6624368,0.021170313,0.0044476525,0.0001187948,0.0005647388,0.0023598608,0.22584964],"genre_scores_gemma":[0.60423046,0.073095396,0.1633358,0.0028478687,0.021812411,0.0002831483,0.0006201739,0.0026932706,0.13108148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982285,0.00033158972,0.00007501037,0.00021004766,0.0008934848,0.00026145217],"domain_scores_gemma":[0.9967757,0.0019256963,0.00017469097,0.0003530406,0.0005774817,0.00019338242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024651121,0.002516671,0.0017514427,0.0014261879,0.0010889475,0.00493591,0.004149878,0.0023485883,0.01189159],"category_scores_gemma":[0.006287637,0.0011895281,0.0005766593,0.0034910766,0.0021869878,0.009147994,0.0015759659,0.0041276733,0.0043990244],"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.000474941,0.00027116106,0.00039188896,0.0012261437,0.0000634697,0.0001983904,0.00013378855,0.14097033,0.011957257,0.67219764,0.027990246,0.14412467],"study_design_scores_gemma":[0.000053936943,0.00037654003,0.0007433435,0.00022586466,0.000092246766,0.0004810216,0.0001815933,0.35811982,0.014935555,0.53669167,0.088035256,0.00006320865],"about_ca_topic_score_codex":0.0010302071,"about_ca_topic_score_gemma":0.0008091439,"teacher_disagreement_score":0.01189159,"about_ca_system_score_codex":0.001958709,"about_ca_system_score_gemma":0.0009147396,"threshold_uncertainty_score":0.03978139},"labels":[],"label_agreement":null},{"id":"W1583372918","doi":"10.1007/978-3-642-10631-6_15","title":"New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Point processes and geometric inequalities","field":"Mathematics","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 Calgary","funders":"","keywords":"Fermat's Last Theorem; Combinatorics; Conjecture; Convex body; Center (category theory); Regular polygon; Mathematics; Upper and lower bounds; Planar; Plane (geometry); Physics; Geometry; Mathematical analysis; Convex hull; Crystallography; Computer science","score_opus":0.03305366420456969,"score_gpt":0.26808498231555083,"score_spread":0.23503131811098116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583372918","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.05506188,0.015859375,0.846616,0.0018700658,0.0012762457,0.00007771733,0.0007201102,0.00084632327,0.077672265],"genre_scores_gemma":[0.657769,0.014413967,0.27670044,0.0011093279,0.004537699,0.00058073236,0.0015817361,0.0017092568,0.041597802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981152,0.00025371643,0.00010218762,0.00060641475,0.00068527216,0.0002373055],"domain_scores_gemma":[0.98341495,0.0113334,0.001249607,0.0014419897,0.001543242,0.001016803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030967204,0.0028894108,0.002264431,0.0068810107,0.0020997708,0.0042992984,0.006278438,0.0024718,0.011537674],"category_scores_gemma":[0.01968646,0.0013545977,0.0022430995,0.004279643,0.00430172,0.010820041,0.00639083,0.008776329,0.0024749448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035309457,0.000102657155,0.0012898714,0.0006080736,0.00012421493,0.00020396528,0.00035195102,0.05394612,0.009400051,0.84611326,0.008178562,0.07932818],"study_design_scores_gemma":[0.000025040803,0.00018004671,0.0021954647,0.00020336948,0.00015742549,0.0004914462,0.00016196858,0.26090872,0.008134108,0.70604616,0.021325229,0.00017100049],"about_ca_topic_score_codex":0.0009186871,"about_ca_topic_score_gemma":0.0012882156,"teacher_disagreement_score":0.011537674,"about_ca_system_score_codex":0.0036870101,"about_ca_system_score_gemma":0.00089627167,"threshold_uncertainty_score":0.038597345},"labels":[],"label_agreement":null},{"id":"W1583374146","doi":"10.1007/978-3-319-23267-6_5","title":"Simplifying Layered Queuing Network Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Computer science; Bottleneck; Queueing theory; Queue; Process (computing); Distributed computing; Message queue; Theoretical computer science; Parallel computing; Programming language; Computer network; Embedded system","score_opus":0.041189868702196895,"score_gpt":0.2651238267813384,"score_spread":0.2239339580791415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583374146","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.016858475,0.00062512193,0.9439431,0.000797159,0.0002499422,0.000059095848,0.00022134995,0.00064350845,0.0366023],"genre_scores_gemma":[0.65869963,0.0027655286,0.26146084,0.00070245,0.00059122045,0.00049630285,0.00083514757,0.0010473604,0.07340151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859506,0.00053317624,0.000046881287,0.00013642275,0.00045613982,0.00023228124],"domain_scores_gemma":[0.9974141,0.001150985,0.00022986541,0.00055180694,0.00047353894,0.00017964035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020339545,0.0011963282,0.0011328431,0.0011681253,0.0009625619,0.0024743138,0.003346986,0.0013610421,0.008387621],"category_scores_gemma":[0.0093409065,0.0010874968,0.0014354145,0.001594,0.0012158556,0.0043582274,0.002995565,0.003745175,0.0027862964],"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.00004104033,0.00005406419,0.00027105535,0.000050544346,0.00002637158,0.00007476691,0.00009388028,0.33528236,0.00095142616,0.65007776,0.0042450465,0.008831676],"study_design_scores_gemma":[0.0000083097675,0.0000065272775,0.000057470428,0.0000120602035,0.000010880119,0.000018769404,0.00001454042,0.78219074,0.00018586036,0.215262,0.0022210497,0.000011843553],"about_ca_topic_score_codex":0.008603256,"about_ca_topic_score_gemma":0.006872397,"teacher_disagreement_score":0.008603256,"about_ca_system_score_codex":0.0031016055,"about_ca_system_score_gemma":0.0022485275,"threshold_uncertainty_score":0.028059423},"labels":[],"label_agreement":null},{"id":"W1583400091","doi":"10.1007/3-540-44839-x_12","title":"Spatial Enhancement of Digital Terrain Model Using Shape from Shading with Single Satellite Imagery","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multispectral image; Remote sensing; Terrain; Satellite; Satellite imagery; Computer science; Image resolution; Multispectral pattern recognition; Digital elevation model; Geology; Computer vision; Geography; Cartography","score_opus":0.018304472881927915,"score_gpt":0.22269101672010352,"score_spread":0.20438654383817562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583400091","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.15182836,0.0002890711,0.8363606,0.00015720914,0.00008505542,0.00005424414,0.00060321175,0.0036788108,0.006943455],"genre_scores_gemma":[0.6884004,0.00046194842,0.30454582,0.00006170174,0.000032618107,0.000036701935,0.0013273647,0.00072461285,0.0044088573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999242,0.000009498339,0.0000023831988,0.000011075853,0.000043694607,0.000009139648],"domain_scores_gemma":[0.99986994,0.000026312313,0.000009735844,0.00003975205,0.000045576035,0.0000086572245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001102889,0.00040993775,0.00030818523,0.00052754476,0.00011834399,0.00036870668,0.0003862484,0.00021098342,0.0021814187],"category_scores_gemma":[0.0003264389,0.00028351767,0.00052218104,0.0006013491,0.00013763914,0.00042187882,0.00046963434,0.00032747813,0.0006178834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026299362,0.00012881075,0.0021407062,0.00022229833,0.00008190957,0.00020181273,0.0001983494,0.41893137,0.15442559,0.003960093,0.005137197,0.41430888],"study_design_scores_gemma":[0.000015707217,0.00003066298,0.0019263967,0.000007366594,0.000026719821,0.00012733729,0.00003398141,0.97297364,0.020492285,0.0012399923,0.0031103618,0.000015575102],"about_ca_topic_score_codex":0.0028194846,"about_ca_topic_score_gemma":0.005263378,"teacher_disagreement_score":0.0028194846,"about_ca_system_score_codex":0.00019733794,"about_ca_system_score_gemma":0.0002835031,"threshold_uncertainty_score":0.0072975755},"labels":[],"label_agreement":null},{"id":"W1583419483","doi":"10.1007/978-3-642-05006-0_4","title":"Achieving High-Level Directives Using Strategy-Trees","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Western University","funders":"","keywords":"Computer science; Tree (set theory); Operations research; Management strategy","score_opus":0.0690954671932154,"score_gpt":0.3021116071020777,"score_spread":0.23301613990886227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583419483","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.0078305,0.000032934553,0.9800969,0.000103498314,0.000023766637,0.00005994651,0.00006747872,0.0041113934,0.00767356],"genre_scores_gemma":[0.22153543,0.00015262282,0.7640336,0.00022759805,0.000026324033,0.0001793202,0.00045997294,0.0024697701,0.010915355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805236,0.00050920056,0.00015352471,0.00022376199,0.0007846381,0.0002765955],"domain_scores_gemma":[0.99720097,0.0015255163,0.00012782836,0.0006577271,0.00038450613,0.00010345422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017460414,0.0010475782,0.0006515268,0.00067996635,0.0006896037,0.0021835451,0.0014747026,0.0013003071,0.008101076],"category_scores_gemma":[0.0066881203,0.00085753214,0.0010726659,0.00076916395,0.0014252831,0.0028866632,0.002594928,0.0030964392,0.0049085165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019192135,0.00019863244,0.0013258344,0.00036583623,0.00006769578,0.0003950824,0.0013950482,0.027978513,0.03260524,0.64508116,0.009163504,0.28123143],"study_design_scores_gemma":[0.00008294657,0.00011890706,0.00034704217,0.00010570731,0.0000882507,0.0003590391,0.00032817738,0.24784178,0.053876013,0.65244377,0.044342462,0.00006589576],"about_ca_topic_score_codex":0.0012609811,"about_ca_topic_score_gemma":0.0025176243,"teacher_disagreement_score":0.008101076,"about_ca_system_score_codex":0.00060936075,"about_ca_system_score_gemma":0.0013653206,"threshold_uncertainty_score":0.027100801},"labels":[],"label_agreement":null},{"id":"W1583453694","doi":"10.1007/978-3-540-45160-0_50","title":"SQL-Relay: An Event-Driven Rule-Based Database Gateway","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"York University","funders":"","keywords":"Computer science; SQL; Gateway (web page); Database; Relay; Data Transformation Services; Event (particle physics); World Wide Web; Query by Example; Physics","score_opus":0.018743500526425153,"score_gpt":0.26022921578115416,"score_spread":0.241485715254729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583453694","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.008121047,0.0002663167,0.585946,0.00025134912,0.00019746313,0.00063742796,0.003248414,0.39434138,0.0069905855],"genre_scores_gemma":[0.25099483,0.001221316,0.64275706,0.0025867766,0.00029684138,0.0010974075,0.025385283,0.036672022,0.038988493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975139,0.00032896848,0.00038496125,0.0005219504,0.0011226328,0.00012758358],"domain_scores_gemma":[0.9964819,0.0013636459,0.00021614306,0.0011436595,0.00049217936,0.0003024671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030735796,0.0011466837,0.001841679,0.0017501808,0.00035866155,0.0037227534,0.005452307,0.0016882786,0.014414064],"category_scores_gemma":[0.0073472275,0.0011616666,0.0010103085,0.0010325487,0.0008192722,0.0032833575,0.0024945152,0.002206492,0.01098759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006643657,0.001934236,0.004175112,0.0015154255,0.00057673873,0.002721866,0.0010932509,0.025705649,0.12226556,0.041150227,0.24438116,0.54783714],"study_design_scores_gemma":[0.0014286833,0.0008593393,0.0025102524,0.00022401572,0.00043918937,0.0016131079,0.00020554879,0.5458131,0.2133716,0.040787514,0.19239318,0.0003544893],"about_ca_topic_score_codex":0.0016073626,"about_ca_topic_score_gemma":0.00088963954,"teacher_disagreement_score":0.014414064,"about_ca_system_score_codex":0.00048779344,"about_ca_system_score_gemma":0.0010727057,"threshold_uncertainty_score":0.04821986},"labels":[],"label_agreement":null},{"id":"W1583482412","doi":"10.1007/11527954_2","title":"The Efficiency of Optimal Taxes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.01814614317667962,"score_gpt":0.20680846448734597,"score_spread":0.18866232131066635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583482412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2408533,0.005109766,0.47602972,0.010595702,0.0003658417,0.00008398069,0.00059371826,0.00063547783,0.26573256],"genre_scores_gemma":[0.95693403,0.0012424687,0.014541615,0.00035942887,0.00023844934,0.000059392845,0.00014701832,0.00022107498,0.026256641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970246,0.0012742684,0.00014374111,0.00043483145,0.0007554306,0.00036721022],"domain_scores_gemma":[0.9817115,0.012330488,0.0013252231,0.0030292133,0.0012894447,0.0003141563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004214353,0.0005942695,0.0014337964,0.0011677514,0.0006978033,0.004948258,0.0018021762,0.0021368575,0.01473658],"category_scores_gemma":[0.03304861,0.00087224616,0.00076368917,0.0015668814,0.0029437013,0.006090763,0.0013266519,0.0026007202,0.0015788429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007121515,0.00003924575,0.00049396453,0.000045813893,0.000030084046,0.000028243861,0.00007656047,0.02309545,0.00032353672,0.9559617,0.0027620934,0.017072048],"study_design_scores_gemma":[0.000019785837,0.00000893602,0.00048725633,0.000015356132,0.000012811419,0.000047046356,0.000038554288,0.044094443,0.00041550925,0.95317835,0.0016748825,0.0000071174622],"about_ca_topic_score_codex":0.0013015157,"about_ca_topic_score_gemma":0.0007935166,"teacher_disagreement_score":0.01473658,"about_ca_system_score_codex":0.0028019873,"about_ca_system_score_gemma":0.0015904495,"threshold_uncertainty_score":0.049298823},"labels":[],"label_agreement":null},{"id":"W1583532098","doi":"10.1007/3-540-36126-x_8","title":"Relating Multi-step and Single-Step Microprocessor Correctness Statements","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Computer science; Programming language; Implementation; Microprocessor; Embedded system","score_opus":0.05686852769521183,"score_gpt":0.309988211319619,"score_spread":0.2531196836244072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583532098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04100046,0.0002608455,0.94586134,0.00020659961,0.00013229021,0.00020438434,0.00015782923,0.0016045914,0.010571632],"genre_scores_gemma":[0.6563847,0.00059141073,0.33220667,0.00028512152,0.0001117223,0.00028807117,0.0006133053,0.00086977193,0.008649297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595743,0.0009695732,0.00026182158,0.0005898629,0.0016968459,0.0005244601],"domain_scores_gemma":[0.97813237,0.015628548,0.0012467344,0.0030851266,0.0017476347,0.00015958397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036593806,0.00074027776,0.0006053172,0.0018144638,0.0007614288,0.001753807,0.0021734352,0.0015385726,0.007143526],"category_scores_gemma":[0.021609737,0.0007454899,0.001607312,0.0012664607,0.0027221218,0.0058076177,0.0034231904,0.0024673222,0.0011949888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060877734,0.00025262748,0.0036540157,0.0009264134,0.00011163631,0.0013328164,0.0013012814,0.0754465,0.021944977,0.70443153,0.003565261,0.1864241],"study_design_scores_gemma":[0.0000585623,0.00023712486,0.0022378652,0.00019574419,0.00016425173,0.00073744374,0.0002884564,0.23037325,0.084672965,0.6724763,0.008482303,0.000075756056],"about_ca_topic_score_codex":0.0008357271,"about_ca_topic_score_gemma":0.0011419337,"teacher_disagreement_score":0.007143526,"about_ca_system_score_codex":0.00066672836,"about_ca_system_score_gemma":0.0014274496,"threshold_uncertainty_score":0.023897469},"labels":[],"label_agreement":null},{"id":"W1583644050","doi":"10.1007/3-540-45656-2_3","title":"Resolving Minsky’s Paradox : The d-Dimensional Normal Distribution Case","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Statistical Process Monitoring","field":"Decision 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":"Carleton University","funders":"","keywords":"Classifier (UML); Pairwise comparison; Covariance; Linear discriminant analysis; Pattern recognition (psychology); Bayes' theorem; Bayes classifier; Artificial intelligence; Linear classifier; Mathematics; Quadratic classifier; Perceptron; Naive Bayes classifier; Computer science; Linearity; Algorithm; Mathematical optimization; Statistics; Bayesian probability; Support vector machine; Artificial neural network; Engineering","score_opus":0.06029501419615856,"score_gpt":0.351773974706829,"score_spread":0.2914789605106704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583644050","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.20707992,0.011753498,0.42491555,0.14073206,0.0023522996,0.000048660615,0.0006621593,0.00035440907,0.2121015],"genre_scores_gemma":[0.95087576,0.0035045922,0.028950745,0.0053194505,0.0019220007,0.000056151708,0.00012588131,0.00013734143,0.0091080135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964275,0.0016291209,0.00018577014,0.00052775233,0.00086357084,0.00036629132],"domain_scores_gemma":[0.9779975,0.016395455,0.0011355083,0.0023556096,0.0011320299,0.0009839064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008058678,0.00057853985,0.0020166978,0.0015913752,0.0026586875,0.005555731,0.0021470503,0.0053685796,0.0048343786],"category_scores_gemma":[0.04833585,0.0006807555,0.00095227436,0.0025514355,0.0061660456,0.016022606,0.0054967427,0.006768892,0.0007726696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030901505,0.000011435857,0.00016994077,0.00002102674,0.000009273714,0.00009461128,0.00008397,0.001007249,0.00005252013,0.99076825,0.002953621,0.0047972095],"study_design_scores_gemma":[0.000007219605,0.0000014706693,0.000026828971,0.000004203065,0.0000012560181,0.00005361204,0.000022717875,0.0027524203,0.000018592127,0.9964126,0.0006951451,0.0000040583095],"about_ca_topic_score_codex":0.0015509378,"about_ca_topic_score_gemma":0.0009394233,"teacher_disagreement_score":0.008058678,"about_ca_system_score_codex":0.001583755,"about_ca_system_score_gemma":0.0013439953,"threshold_uncertainty_score":0.04261887},"labels":[],"label_agreement":null},{"id":"W1583668165","doi":"10.1007/978-3-540-75162-5_3","title":"Analysis of Early Aspects in Requirements Goal Models: A Concept-Driven Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":30,"is_retracted":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":"Stakeholder; Computer science; Process management; Requirements analysis; Domain (mathematical analysis); TRACE (psycholinguistics); Management science; Goal modeling; Repertory grid; Prioritization; Risk analysis (engineering); Systems engineering; Software; Engineering; Business; Psychology; Political science","score_opus":0.08607470470527344,"score_gpt":0.3155356689842053,"score_spread":0.22946096427893187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583668165","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.021323487,0.0001713025,0.9748013,0.00019201719,0.0000150595815,0.0004404305,0.00016325375,0.00034859267,0.0025445328],"genre_scores_gemma":[0.19020641,0.0003077364,0.8065025,0.00010462678,0.000020692161,0.000549149,0.0005945335,0.00021283998,0.0015013766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905393,0.00333264,0.00041043278,0.0006839032,0.004564661,0.0004690746],"domain_scores_gemma":[0.97343427,0.01985033,0.0014614112,0.0015915269,0.003382474,0.0002799078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010155906,0.0017484115,0.0010095715,0.0033686562,0.0008731222,0.0035825416,0.0030661647,0.0015704788,0.0025138382],"category_scores_gemma":[0.023111992,0.0017561193,0.003589488,0.002313084,0.0018196824,0.005832062,0.002098911,0.0031586136,0.0005440076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005218072,0.0006388202,0.007316971,0.0016285876,0.0004111924,0.0010881216,0.0041335486,0.33329827,0.022816101,0.37045372,0.0027563379,0.25493655],"study_design_scores_gemma":[0.00008002333,0.00031594504,0.0016403657,0.0003534909,0.00039526552,0.00038518463,0.00079771545,0.83715683,0.017573306,0.13027787,0.010933639,0.000090271744],"about_ca_topic_score_codex":0.0037344692,"about_ca_topic_score_gemma":0.004447111,"teacher_disagreement_score":0.010155906,"about_ca_system_score_codex":0.002267086,"about_ca_system_score_gemma":0.004257129,"threshold_uncertainty_score":0.053710163},"labels":[],"label_agreement":null},{"id":"W1583687157","doi":"10.1007/3-540-45452-7_23","title":"Constructing NFAs by Optimal Use of Positions in Regular Expressions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Regular expression; Nondeterministic finite automaton; Computer science; Automaton; Quotient; Nondeterministic algorithm; Expression (computer science); Finite-state machine; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics; Automata theory; Programming language","score_opus":0.01848285626588725,"score_gpt":0.22802256862829434,"score_spread":0.2095397123624071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583687157","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.1016439,0.0002096102,0.88194644,0.0002742544,0.000121921286,0.00014728031,0.00020312301,0.004936777,0.01051674],"genre_scores_gemma":[0.37366048,0.0003117919,0.61775005,0.00010658341,0.000049656253,0.00017152178,0.00045300258,0.0013618238,0.006135107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835145,0.00039500924,0.00017029706,0.00039862934,0.00036134635,0.0003233116],"domain_scores_gemma":[0.9961939,0.0020501956,0.00017711056,0.0011602291,0.0002940636,0.00012457423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013143984,0.0009671255,0.0014466193,0.0011263672,0.001319587,0.0026156513,0.0019965256,0.0013721093,0.0051139523],"category_scores_gemma":[0.0063292966,0.0014019435,0.0021010514,0.0014675572,0.0023245146,0.0066406187,0.0030953414,0.0023769338,0.0020236224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006043198,0.00034058845,0.0032424647,0.0006935016,0.000099014294,0.0006425988,0.0020084574,0.02721324,0.048314784,0.51362413,0.0043418445,0.398875],"study_design_scores_gemma":[0.00015270968,0.00019068786,0.00053606014,0.00016297461,0.00027620982,0.00057475106,0.00081958517,0.11527729,0.064581715,0.7926239,0.024682734,0.000121384866],"about_ca_topic_score_codex":0.001159798,"about_ca_topic_score_gemma":0.002126547,"teacher_disagreement_score":0.0051139523,"about_ca_system_score_codex":0.00090928556,"about_ca_system_score_gemma":0.0010188887,"threshold_uncertainty_score":0.017107904},"labels":[],"label_agreement":null},{"id":"W158370897","doi":"10.1007/978-3-642-29517-1_7","title":"Transforming MCT Circuits to NCVW Circuits","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Electronic circuit; Computer science; Benchmark (surveying); Square root; Boolean function; Quantum gate; Quantum circuit; Logic gate; Key (lock); Quantum; Boolean circuit; Quantum computer; Topology (electrical circuits); Algorithm; Computer engineering; Mathematics; Electrical engineering; Quantum error correction; Physics; Quantum mechanics; Engineering","score_opus":0.01853989326118558,"score_gpt":0.242190142292005,"score_spread":0.22365024903081943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158370897","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.07407829,0.0005954446,0.563591,0.0013057231,0.00061920227,0.0001562711,0.00042291958,0.0012844125,0.35794675],"genre_scores_gemma":[0.8171186,0.0006509286,0.102479994,0.0007951315,0.00019432294,0.00016803046,0.0005026778,0.0007102664,0.077379994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983,0.000025881911,0.000006500122,0.000025386658,0.0000797222,0.00003235751],"domain_scores_gemma":[0.9997763,0.000089798246,0.00001608531,0.00005459857,0.000047975453,0.000015160594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001634245,0.00024801717,0.00020597519,0.00046123264,0.00034419727,0.00092939247,0.0007021349,0.0005500291,0.015238164],"category_scores_gemma":[0.001290981,0.00019215402,0.00028837705,0.0005689163,0.0008583348,0.0013390151,0.0007131575,0.0012698506,0.0017936861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016657954,0.0000136046965,0.00004770247,0.00004251973,0.0000029579126,0.00004949031,0.00005603101,0.0028610148,0.0041826647,0.95405555,0.0033147195,0.03535701],"study_design_scores_gemma":[0.000016481154,0.000018886763,0.00012692889,0.000022246704,0.00000595617,0.00012985383,0.000035927154,0.033996042,0.0067100707,0.9304979,0.028430663,0.000009013564],"about_ca_topic_score_codex":0.0007173472,"about_ca_topic_score_gemma":0.0009691797,"teacher_disagreement_score":0.015238164,"about_ca_system_score_codex":0.0006614389,"about_ca_system_score_gemma":0.00029795023,"threshold_uncertainty_score":0.050976753},"labels":[],"label_agreement":null},{"id":"W1583737440","doi":"10.1007/11866763_64","title":"4D Shape Registration for Dynamic Electrophysiological Cardiac Mapping","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Iterative closest point; Computer science; Rotation (mathematics); Translation (biology); Artificial intelligence; Computer vision; Point (geometry); Algorithm; Range (aeronautics); Mathematics; Point cloud","score_opus":0.01240216626173031,"score_gpt":0.27333396378410113,"score_spread":0.26093179752237083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583737440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013258963,0.00034329,0.98400325,0.00010347383,0.00004507776,0.000042121967,0.000093294584,0.0010525784,0.0010579993],"genre_scores_gemma":[0.25538796,0.00090986537,0.7381728,0.00015203745,0.00007653356,0.00012891725,0.00044263527,0.0009016821,0.0038275176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.000098179196,0.000028269864,0.000057535817,0.00018525186,0.00003049172],"domain_scores_gemma":[0.99948895,0.00017339093,0.00004619595,0.00017842707,0.000089778085,0.000023239087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005565902,0.0005578753,0.0006019699,0.0012805717,0.0003786444,0.0010697392,0.0008135844,0.0010299997,0.0037680229],"category_scores_gemma":[0.0022387977,0.00065560197,0.00074974215,0.0011924539,0.00039873444,0.00090237136,0.0012999455,0.00089448906,0.001774106],"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.00046033072,0.00007294939,0.0010221595,0.00019300994,0.00007673005,0.00030141228,0.00023472926,0.05620859,0.18650086,0.0064937286,0.0034829255,0.7449526],"study_design_scores_gemma":[0.0000486585,0.00019164372,0.0033747798,0.00005038055,0.00007870107,0.0023222587,0.0001276922,0.8250187,0.13683833,0.013586648,0.018273408,0.00008877677],"about_ca_topic_score_codex":0.0013421931,"about_ca_topic_score_gemma":0.0019140699,"teacher_disagreement_score":0.0037680229,"about_ca_system_score_codex":0.00028625087,"about_ca_system_score_gemma":0.0006315663,"threshold_uncertainty_score":0.0126053095},"labels":[],"label_agreement":null},{"id":"W1583751262","doi":"10.1007/978-3-642-10628-6_4","title":"A Study of Two-Party Certificateless Authenticated Key-Agreement Protocols","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Ephemeral key; Authenticated Key Exchange; Key (lock); Flexibility (engineering); Adversary; Key exchange; Public-key cryptography; Mathematics; Encryption","score_opus":0.04438229916738024,"score_gpt":0.3045518653909579,"score_spread":0.2601695662235777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583751262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09075554,0.008146276,0.77309215,0.0055481824,0.000600956,0.0004199488,0.00023526278,0.00021778223,0.12098388],"genre_scores_gemma":[0.8848935,0.006184277,0.080815405,0.00052199996,0.000716192,0.00039189777,0.00023288766,0.00015800916,0.026085889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932875,0.0026276584,0.00033863698,0.0008085275,0.0023141308,0.00062348467],"domain_scores_gemma":[0.9801896,0.015454805,0.0008165563,0.0021190927,0.0010493117,0.0003705919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005326685,0.0010141714,0.0014724524,0.0016854625,0.0032006467,0.006976539,0.0034889372,0.0033288465,0.0070221187],"category_scores_gemma":[0.024005529,0.0011063442,0.0015046899,0.0047904635,0.006055966,0.01727772,0.0036390424,0.005994448,0.0011238786],"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.00003295612,0.000028753337,0.00008773442,0.000057184472,0.0000087675735,0.00009006081,0.0002228733,0.0046183662,0.00033667826,0.9890926,0.0006205579,0.0048034354],"study_design_scores_gemma":[0.000030438488,0.000047118843,0.00009741738,0.000054729284,0.00002092326,0.00022599127,0.00015819914,0.076540045,0.0005902665,0.9162015,0.006011065,0.000022484704],"about_ca_topic_score_codex":0.0010766509,"about_ca_topic_score_gemma":0.0005363853,"teacher_disagreement_score":0.0070221187,"about_ca_system_score_codex":0.0029440834,"about_ca_system_score_gemma":0.0028762359,"threshold_uncertainty_score":0.028170586},"labels":[],"label_agreement":null},{"id":"W1583755464","doi":"10.1007/978-3-540-72685-2_31","title":"Visualization of GML Map Using 3-Layer POI on Mobile Device","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile and Web Applications","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Shapefile; Visualization; Interoperability; Geographic information system; Flexibility (engineering); Information retrieval; Mobile device; Database; Spatial analysis; Data mining; Distributed GIS; GIS file format; Data visualization; Layer (electronics); World Wide Web; GIS applications; AM/FM/GIS; Metadata; Cartography; Geography","score_opus":0.03927944882282318,"score_gpt":0.3168686500149714,"score_spread":0.2775892011921482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583755464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27984506,0.00075139286,0.44651753,0.0027554934,0.0016271867,0.0005681626,0.021211287,0.10705241,0.13967149],"genre_scores_gemma":[0.7370805,0.00067428045,0.21824646,0.00039316856,0.00019077759,0.000337334,0.006973125,0.004471049,0.031633288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994147,0.000006229282,0.0000019865527,0.000009105797,0.00002364386,0.000017606586],"domain_scores_gemma":[0.9998807,0.000023777706,0.000008693273,0.000018429953,0.00004362239,0.000024815661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008896098,0.00074872083,0.00029181124,0.0013234799,0.00036290442,0.00081034517,0.00037234367,0.0004573713,0.023396464],"category_scores_gemma":[0.0002836204,0.00019786398,0.000394648,0.00090519805,0.0001767893,0.00047493097,0.0006001259,0.0005643422,0.0018673268],"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.0021014318,0.00052325765,0.009237884,0.0018165958,0.00012207543,0.0030521436,0.0039223037,0.06382201,0.20550251,0.017542511,0.18990113,0.50245607],"study_design_scores_gemma":[0.00044784643,0.00038963452,0.0487982,0.0005653982,0.00024296425,0.0013844069,0.0027574776,0.49003413,0.1375701,0.0132727325,0.3040754,0.00046181944],"about_ca_topic_score_codex":0.0052730986,"about_ca_topic_score_gemma":0.005933808,"teacher_disagreement_score":0.023396464,"about_ca_system_score_codex":0.00022982006,"about_ca_system_score_gemma":0.0005274882,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1583784647","doi":"10.1007/978-3-540-30198-1_24","title":"On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"","keywords":"Computer science; Entropy encoding; Adaptive coding; Algorithm; Decoding methods; Coding (social sciences); Entropy (arrow of time); Data compression; Encoding (memory); Theoretical computer science; Artificial intelligence; Lossless compression; Mathematics; Statistics","score_opus":0.03784189393798354,"score_gpt":0.27284935411761757,"score_spread":0.23500746017963403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583784647","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.011239442,0.0022623884,0.9802484,0.0002247121,0.00015986577,0.000072790994,0.00009761696,0.00029453967,0.0054003657],"genre_scores_gemma":[0.1695051,0.008969335,0.8035424,0.0005794438,0.00090760493,0.0006768605,0.00089189963,0.0006848012,0.014242522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864084,0.00039913677,0.000100807534,0.00022385934,0.0005253919,0.000109995555],"domain_scores_gemma":[0.9907218,0.006908814,0.00046294488,0.000865295,0.000853175,0.0001879466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031197353,0.0018826213,0.0010047259,0.0018530752,0.00078414043,0.001642187,0.0016299146,0.0015649705,0.0035093084],"category_scores_gemma":[0.014981231,0.0006456391,0.0013961855,0.0024246983,0.001749558,0.0033028116,0.002152827,0.0029231748,0.00094746373],"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.00042005698,0.00011501941,0.0009969609,0.00045116126,0.00011403456,0.00037468414,0.00032141973,0.0990718,0.019103616,0.5570528,0.011499818,0.31047872],"study_design_scores_gemma":[0.00006287183,0.00014790057,0.00049347285,0.00011463901,0.000055649907,0.0010848169,0.000057223788,0.74396694,0.0077779945,0.23385745,0.012310606,0.00007046161],"about_ca_topic_score_codex":0.000530706,"about_ca_topic_score_gemma":0.00059267523,"teacher_disagreement_score":0.0035093084,"about_ca_system_score_codex":0.0009331106,"about_ca_system_score_gemma":0.0006466688,"threshold_uncertainty_score":0.016498923},"labels":[],"label_agreement":null},{"id":"W1583821184","doi":"10.1007/978-3-540-75551-7_5","title":"Louis, Lester and Pierre: Three Protocols for Location Privacy","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":180,"is_retracted":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":"Service provider; Service (business); Internet privacy; Computer science; Computer security; Key (lock); Property (philosophy); Location-based service; Business; Computer network","score_opus":0.06178885672446187,"score_gpt":0.318781999019554,"score_spread":0.2569931422950921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583821184","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.013463758,0.0040425276,0.87232184,0.04064972,0.0016392237,0.0003828327,0.00037870157,0.0020616902,0.065059684],"genre_scores_gemma":[0.3472228,0.005053839,0.47264424,0.00897276,0.0009929928,0.0011101781,0.00072305306,0.0013816678,0.16189839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99460196,0.0020513008,0.00024252047,0.00049118453,0.0019084483,0.00070472865],"domain_scores_gemma":[0.99163014,0.0035167215,0.0002726201,0.0027764563,0.0013950496,0.0004091057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004879454,0.0015421008,0.0014461096,0.0013801254,0.005609169,0.008239931,0.0035154,0.008322171,0.010744718],"category_scores_gemma":[0.01859613,0.0015283652,0.0016014345,0.002582811,0.0072541297,0.023571856,0.012382,0.009146746,0.00574715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030698054,0.00006226471,0.000319517,0.00012075351,0.000034129185,0.00028169662,0.0017369884,0.0035000704,0.0025157882,0.89153546,0.04932035,0.050265897],"study_design_scores_gemma":[0.0001365487,0.00008518507,0.00023455347,0.00013315653,0.00013091759,0.0005232305,0.0011658319,0.022980336,0.016755693,0.77640796,0.18126087,0.00018576291],"about_ca_topic_score_codex":0.0035271186,"about_ca_topic_score_gemma":0.0029775952,"teacher_disagreement_score":0.010744718,"about_ca_system_score_codex":0.0038178696,"about_ca_system_score_gemma":0.0034498954,"threshold_uncertainty_score":0.0359447},"labels":[],"label_agreement":null},{"id":"W1583828021","doi":"10.1007/3-540-45415-2_12","title":"A Methodology and Implementation for Analytic Modeling in Electronic Commerce Applications","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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":"IBM (Canada); Western University","funders":"","keywords":"Computer science; Queueing theory; Range (aeronautics); Industrial engineering; Data science","score_opus":0.05011165933830061,"score_gpt":0.32376789374088366,"score_spread":0.273656234402583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583828021","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.00037571654,0.000014167188,0.99838233,0.00005025253,0.00001242102,0.00003151758,0.000027661663,0.0004212375,0.0006848035],"genre_scores_gemma":[0.023379061,0.000088108216,0.9740423,0.000046473844,0.000030201132,0.0002896875,0.00010828693,0.00021763363,0.0017982905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.000490427,0.00011846995,0.00012921456,0.0004786573,0.00008273029],"domain_scores_gemma":[0.99768484,0.0011752443,0.000092429094,0.0004469869,0.0005350327,0.00006544823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026706185,0.0008395127,0.00085105456,0.0012234901,0.0014595148,0.0026894533,0.0024201572,0.0016103726,0.010765884],"category_scores_gemma":[0.009536402,0.000878445,0.0014858277,0.0017533354,0.000957417,0.0025529624,0.0019026225,0.0024118035,0.0036045844],"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.000051551906,0.0002224161,0.00079205475,0.00016191103,0.000060483555,0.00017711599,0.00035101356,0.09522213,0.0033033486,0.67854184,0.009536889,0.21157926],"study_design_scores_gemma":[0.000028075765,0.000025613765,0.00010716696,0.00003148084,0.000027853104,0.00009788253,0.00006692792,0.7767346,0.0018387907,0.20420656,0.016817397,0.000017692426],"about_ca_topic_score_codex":0.0048454627,"about_ca_topic_score_gemma":0.0036084207,"teacher_disagreement_score":0.010765884,"about_ca_system_score_codex":0.00091249583,"about_ca_system_score_gemma":0.0022286887,"threshold_uncertainty_score":0.03601545},"labels":[],"label_agreement":null},{"id":"W1583922594","doi":"10.1007/978-3-540-74553-2_25","title":"An Efficient Algorithm for Identifying the Most Contributory Substring","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Substring; Set (abstract data type); Algorithm; Computer science; Running time; Mathematics; Combinatorics","score_opus":0.030714934167529826,"score_gpt":0.2923358769748553,"score_spread":0.26162094280732545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583922594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031831793,0.0010708194,0.9510003,0.00047005014,0.00048857165,0.0005406075,0.0014302933,0.008544171,0.004623492],"genre_scores_gemma":[0.041202746,0.00032794772,0.94642097,0.0001154785,0.00011549525,0.00023571143,0.0024336807,0.00036704558,0.00878092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988757,0.00008110336,0.00012056922,0.00032445212,0.00047865295,0.00011945265],"domain_scores_gemma":[0.9974795,0.00081550796,0.00018710301,0.0005916352,0.0007836943,0.00014259276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098014,0.0016165184,0.001739949,0.005295099,0.0018258056,0.002206536,0.0022779233,0.0018772805,0.011300987],"category_scores_gemma":[0.005066859,0.0006693473,0.00096220244,0.0049838894,0.0008160181,0.002796046,0.0029752518,0.0012824807,0.008766914],"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.0003977911,0.0001674335,0.0014408303,0.00022444042,0.000043786826,0.0001940315,0.00018241833,0.0043098023,0.038878527,0.006762168,0.01583201,0.9315668],"study_design_scores_gemma":[0.0005018092,0.0008976626,0.0063879127,0.00025027094,0.00040916452,0.004307051,0.0011752172,0.58574224,0.18488194,0.09033475,0.12489884,0.00021317617],"about_ca_topic_score_codex":0.0019403691,"about_ca_topic_score_gemma":0.0049134823,"teacher_disagreement_score":0.011300987,"about_ca_system_score_codex":0.00077716116,"about_ca_system_score_gemma":0.002818899,"threshold_uncertainty_score":0.037805557},"labels":[],"label_agreement":null},{"id":"W1583943159","doi":"10.1007/3-540-44732-6_9","title":"Invariant Face Detection in Color Images Using Orthogonal Fourier-Mellin Moments and Support Vector Machines","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Université Laval","funders":"","keywords":"Chrominance; Artificial intelligence; Computer science; Pattern recognition (psychology); Support vector machine; Face detection; Segmentation; Computer vision; Invariant (physics); Feature extraction; Robustness (evolution); Facial recognition system; Mathematics; Luminance","score_opus":0.020419657892194156,"score_gpt":0.2537845137343033,"score_spread":0.23336485584210911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583943159","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.029919056,0.0006650866,0.9659681,0.0000736954,0.00006953772,0.000028877044,0.00010152087,0.0012272282,0.0019468004],"genre_scores_gemma":[0.24296047,0.0009378975,0.75089115,0.00007251544,0.00009377932,0.00006831771,0.00032592376,0.00017634609,0.0044736825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997706,0.000028977343,0.000009319911,0.000038952025,0.00011242929,0.0000397713],"domain_scores_gemma":[0.9997012,0.000097785225,0.000040582076,0.000045529854,0.00009966338,0.000015213288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029280028,0.0004516334,0.00072208565,0.0010675474,0.00020501667,0.00060147635,0.0006065441,0.0004125627,0.0020168014],"category_scores_gemma":[0.00089094037,0.00026724092,0.00054490933,0.0009572679,0.00030408925,0.00079958927,0.0003421484,0.00045072654,0.0010405524],"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.00016104504,0.00007446743,0.000740411,0.000101600155,0.00003855612,0.000053624706,0.000029384584,0.012459138,0.09483203,0.0037261676,0.0029123651,0.8848712],"study_design_scores_gemma":[0.00002461394,0.0001267928,0.006261202,0.000025101608,0.000072552015,0.0004782988,0.000055437376,0.85694104,0.12352268,0.008136855,0.00430017,0.00005520503],"about_ca_topic_score_codex":0.0009844416,"about_ca_topic_score_gemma":0.0017203924,"teacher_disagreement_score":0.0020168014,"about_ca_system_score_codex":0.00025537502,"about_ca_system_score_gemma":0.0002824404,"threshold_uncertainty_score":0.006746888},"labels":[],"label_agreement":null},{"id":"W1583951675","doi":"10.1007/978-3-540-73545-8_54","title":"Approximation Algorithms for the Black and White Traveling Salesman Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Combinatorics; Triangle inequality; Bounded function; Approximation algorithm; Mathematics; Undirected graph; Hamiltonian (control theory); Hamiltonian path; Graph; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.03269764042657921,"score_gpt":0.27462067247672894,"score_spread":0.24192303205014973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583951675","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.012534924,0.0018218587,0.96878004,0.0008750123,0.00027284506,0.00008798114,0.0002087012,0.0009022175,0.014516497],"genre_scores_gemma":[0.24877883,0.0025940444,0.71756613,0.00060454686,0.00048054926,0.00043778948,0.0011752323,0.0007606374,0.027602157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877363,0.0003749591,0.00004219332,0.0002469368,0.0003295052,0.00023280607],"domain_scores_gemma":[0.99765575,0.0015477478,0.0001465466,0.00026364104,0.00024270106,0.00014362323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021005846,0.0017385929,0.0022203266,0.0013300267,0.0011917992,0.0027907381,0.004158433,0.0024355692,0.010651154],"category_scores_gemma":[0.0075139944,0.0011404195,0.0013936032,0.0033735123,0.0012438555,0.005107198,0.0020977168,0.0039143995,0.0022439684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042856467,0.00040568126,0.00049020234,0.0002785077,0.00012786033,0.00007297208,0.00016941132,0.5438083,0.0009031106,0.18734583,0.028996529,0.23697309],"study_design_scores_gemma":[0.000065662796,0.000029584184,0.00006481832,0.00002082208,0.000022673075,0.00002682284,0.000034171553,0.89588124,0.00024818582,0.10071168,0.0028855826,0.000008747296],"about_ca_topic_score_codex":0.007474968,"about_ca_topic_score_gemma":0.006833023,"teacher_disagreement_score":0.010651154,"about_ca_system_score_codex":0.0024644088,"about_ca_system_score_gemma":0.0020122027,"threshold_uncertainty_score":0.035631597},"labels":[],"label_agreement":null},{"id":"W1584019768","doi":"10.1007/978-3-540-30126-4_41","title":"Textures and Wavelet-Domain Joint Statistics","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Computer science; Pattern recognition (psychology); Independence (probability theory); Artificial intelligence; Wavelet transform; Joint (building); Cascade algorithm; Histogram; Scale (ratio); Domain (mathematical analysis); Markov chain; Discrete wavelet transform; Algorithm; Mathematics; Statistics; Machine learning; Image (mathematics); Cartography; Geography","score_opus":0.020213591661223513,"score_gpt":0.26103382655943713,"score_spread":0.2408202348982136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584019768","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.012147011,0.0029854185,0.9781179,0.00046396474,0.00019950936,0.00000978761,0.00013739605,0.00021435341,0.005724784],"genre_scores_gemma":[0.58998036,0.015831182,0.3469186,0.0004944307,0.0019363784,0.00014449727,0.0013872458,0.00056962494,0.04273761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.000095373485,0.000022221244,0.00007177813,0.00013508846,0.00003157643],"domain_scores_gemma":[0.998075,0.0012328452,0.00021761883,0.00021710827,0.0001956306,0.00006186316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096699654,0.00058005966,0.000805416,0.0010930789,0.00023880135,0.0015929458,0.00060721446,0.0008882551,0.0024033617],"category_scores_gemma":[0.005706676,0.0004769303,0.0005176623,0.0016895634,0.0015254595,0.0018207481,0.00075083826,0.0014849813,0.0006807635],"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.00008952531,0.000022916458,0.0006218207,0.0001573685,0.000052636093,0.00013482128,0.00010078251,0.050246987,0.00550293,0.8254062,0.0045953803,0.11306869],"study_design_scores_gemma":[0.000010580967,0.000027048785,0.00083407265,0.000018367133,0.000018715109,0.0001946636,0.000024504448,0.28082415,0.0016885914,0.71186906,0.004468429,0.000021836924],"about_ca_topic_score_codex":0.00070020475,"about_ca_topic_score_gemma":0.00074584916,"teacher_disagreement_score":0.0024033617,"about_ca_system_score_codex":0.00033354358,"about_ca_system_score_gemma":0.00040772118,"threshold_uncertainty_score":0.008040011},"labels":[],"label_agreement":null},{"id":"W1584031041","doi":"10.1007/978-3-540-85988-8_121","title":"Discovering Structure in the Space of Activation Profiles in fMRI","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institutes of Health; National Science Foundation","keywords":"Computer science; Context (archaeology); Artificial intelligence; Space (punctuation); Functional magnetic resonance imaging; Visual cortex; Pattern recognition (psychology); Neuroscience; Psychology","score_opus":0.028092516583206398,"score_gpt":0.25678910940325944,"score_spread":0.22869659282005306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584031041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3940562,0.0009895812,0.6008085,0.0009564824,0.000030846022,0.00005942427,0.0012176678,0.0007809352,0.0011002972],"genre_scores_gemma":[0.8924959,0.0008696529,0.103719674,0.00011265386,0.0001326539,0.00007302783,0.0015979364,0.00015716966,0.0008413473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995765,0.00016906318,0.000026219686,0.000106856045,0.000059132075,0.00006223201],"domain_scores_gemma":[0.9967638,0.0023671666,0.000305801,0.0002493453,0.00017665404,0.00013708363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012762363,0.00054178666,0.0006963547,0.0031078248,0.00052420923,0.0015833352,0.0006199636,0.0008419517,0.0013270887],"category_scores_gemma":[0.006869908,0.0005030418,0.0008920022,0.001958435,0.0008231037,0.001641522,0.0007756918,0.0013991238,0.00049213966],"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.0019752001,0.0007639923,0.04945964,0.0006492575,0.0004420725,0.001392886,0.0012199891,0.12517264,0.14046644,0.039392672,0.009778076,0.6292872],"study_design_scores_gemma":[0.00005305636,0.0002669726,0.035399962,0.00008298821,0.00009521653,0.00094716926,0.00045271387,0.8048989,0.0108972145,0.14492287,0.0019086924,0.000074246986],"about_ca_topic_score_codex":0.0018533433,"about_ca_topic_score_gemma":0.002602148,"teacher_disagreement_score":0.0031078248,"about_ca_system_score_codex":0.00026526445,"about_ca_system_score_gemma":0.0007260688,"threshold_uncertainty_score":0.0067495108},"labels":[],"label_agreement":null},{"id":"W1584094645","doi":"10.1007/11424918_11","title":"SWAMI: Searching the Web Using Agents with Mobility and Intelligence","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Swami; Computer science; World Wide Web; Artificial intelligence; Philosophy; Theology","score_opus":0.03859558952410785,"score_gpt":0.26702390421465516,"score_spread":0.2284283146905473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584094645","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.031295627,0.0025542278,0.9003136,0.0012146474,0.0004206794,0.00019600321,0.0004781205,0.020384988,0.04314214],"genre_scores_gemma":[0.21732225,0.0029263168,0.71223575,0.00045329455,0.00016151943,0.0003621052,0.0017100527,0.0017985053,0.0630302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980897,0.000043116543,0.00001564753,0.0000316963,0.000078630204,0.000021972393],"domain_scores_gemma":[0.9995858,0.00018650084,0.000024084775,0.000095952804,0.000046294812,0.00006131382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035706203,0.00082211214,0.0006757743,0.000693735,0.0007273296,0.0021225954,0.0018124656,0.0012227423,0.0070868395],"category_scores_gemma":[0.0016878325,0.0005072844,0.00041746956,0.0008989049,0.0006877391,0.0032255978,0.0019073281,0.0014595594,0.0029836062],"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.00058352854,0.0003483787,0.0019505484,0.0007062619,0.00016959736,0.0006240679,0.0014831765,0.035864636,0.027779974,0.19263275,0.0983313,0.6395258],"study_design_scores_gemma":[0.00015475276,0.00017115103,0.00096306985,0.0001578259,0.00015705866,0.0008592487,0.0005165426,0.50314575,0.028552648,0.18231969,0.28290924,0.00009309119],"about_ca_topic_score_codex":0.0024256539,"about_ca_topic_score_gemma":0.0029792406,"teacher_disagreement_score":0.0070868395,"about_ca_system_score_codex":0.00026471342,"about_ca_system_score_gemma":0.000504878,"threshold_uncertainty_score":0.023707867},"labels":[],"label_agreement":null},{"id":"W1584181579","doi":"10.1007/978-3-642-16599-3","title":"The Smart Internet","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":33,"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); Queen's University; University of Toronto","funders":"","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.018768788561032018,"score_gpt":0.3012294966021132,"score_spread":0.28246070804108114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584181579","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001142535,0.023862716,0.0065437644,0.006425513,0.0027516468,0.000032716747,0.00013776892,0.00039247386,0.9587108],"genre_scores_gemma":[0.018135384,0.022331825,0.0039507253,0.0030344706,0.001709348,0.00006021428,0.00028031084,0.00021168964,0.95028615],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997706,0.000040723382,0.000006775189,0.000043352542,0.00010859983,0.000030035388],"domain_scores_gemma":[0.99975854,0.000059325925,0.000013987393,0.00006434513,0.000046733086,0.000057139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032396975,0.00064091344,0.00032921106,0.0011431583,0.0010447422,0.004123324,0.0005044292,0.0014431298,0.05907944],"category_scores_gemma":[0.00084668957,0.00029645866,0.00027865087,0.001465606,0.0015078634,0.007620575,0.0021293547,0.0022471661,0.027443564],"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.000017277162,0.000026082189,0.00015194372,0.000105712985,0.0000064252254,0.00007981515,0.00034976317,0.00020687563,0.00055055623,0.30241606,0.452985,0.24310455],"study_design_scores_gemma":[0.0000017532742,0.0000061236383,0.00012958472,0.000065447624,0.0000021326166,0.00007887876,0.000093670846,0.00013421339,0.00009389283,0.029802132,0.9695892,0.0000030843019],"about_ca_topic_score_codex":0.0009883973,"about_ca_topic_score_gemma":0.0020083648,"teacher_disagreement_score":0.05907944,"about_ca_system_score_codex":0.0007775783,"about_ca_system_score_gemma":0.0008317894,"threshold_uncertainty_score":0.19764042},"labels":[],"label_agreement":null},{"id":"W1584221260","doi":"10.1007/978-3-642-16599-3_2","title":"Smarter Healthcare: An Emergency Physician View of the Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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":"IBM (Canada); University of Toronto","funders":"","keywords":"Computer science; Health care; Emergency rooms; Emergency physician; Range (aeronautics); State (computer science); Emergency department; Operations research; Management science; Data science; Medical emergency; Medicine; Nursing; Algorithm; Engineering","score_opus":0.043804009086000344,"score_gpt":0.3769298425473218,"score_spread":0.33312583346132146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584221260","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002541228,0.14233275,0.04120045,0.6037377,0.007229922,0.000044280634,0.00023443451,0.00033451774,0.2023447],"genre_scores_gemma":[0.13917065,0.27647656,0.0580895,0.26976284,0.030002529,0.00016922288,0.000476919,0.00039582193,0.22545597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986958,0.00053146546,0.000043655335,0.00013952318,0.00046762434,0.00012190069],"domain_scores_gemma":[0.9973355,0.0017180335,0.0001268154,0.00012189276,0.00040568196,0.0002919853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021855836,0.00069222593,0.0007060213,0.0019392282,0.0011989436,0.006311322,0.0017800328,0.007730061,0.01801227],"category_scores_gemma":[0.0033528348,0.0004009318,0.0005397108,0.0024125606,0.005137508,0.011357318,0.0032034058,0.008891788,0.00325255],"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.000029404042,0.000070345035,0.00034926904,0.00042456394,0.000012986861,0.00027544072,0.0008605742,0.0010292266,0.00025881466,0.6246221,0.2644013,0.10766602],"study_design_scores_gemma":[0.000021193202,0.000043412867,0.00045065652,0.0006554669,0.000012172344,0.0010793916,0.001412571,0.0023536296,0.00022943667,0.27254206,0.7211702,0.000029822175],"about_ca_topic_score_codex":0.0023809217,"about_ca_topic_score_gemma":0.003578423,"teacher_disagreement_score":0.01801227,"about_ca_system_score_codex":0.0018753445,"about_ca_system_score_gemma":0.0025750396,"threshold_uncertainty_score":0.060257018},"labels":[],"label_agreement":null},{"id":"W1584249400","doi":"10.1007/978-3-540-30135-6_69","title":"Surface-Based Registration with a Particle Filter","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":43,"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":"Particle filter; Computer science; Computer vision; Artificial intelligence; Surface (topology); Image registration; Filter (signal processing); Particle (ecology); Mathematics; Geometry; Image (mathematics)","score_opus":0.014584305909741281,"score_gpt":0.2038785513651429,"score_spread":0.18929424545540163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584249400","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.0012011303,0.000054724103,0.9969771,0.000026751506,0.00004855945,0.000021949352,0.000023448829,0.0010151751,0.00063117663],"genre_scores_gemma":[0.057527818,0.00020607692,0.93590933,0.00006638159,0.000047097237,0.00010261614,0.000276276,0.00041426028,0.0054501262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991068,0.00012828759,0.000047716898,0.00023165878,0.00042388253,0.00006150828],"domain_scores_gemma":[0.9994723,0.0001135048,0.00003251322,0.000204379,0.0001594344,0.000017838913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009214173,0.0010036869,0.0014232037,0.0015131457,0.00063300325,0.0015489858,0.0013383636,0.0018576892,0.005114302],"category_scores_gemma":[0.0019436976,0.0009806827,0.0014167696,0.002854632,0.0006403475,0.0016873386,0.002118869,0.0013367224,0.0056674434],"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.00029284114,0.00011096664,0.00065330573,0.00017995402,0.00016397709,0.00012655444,0.00014910178,0.07981198,0.062275324,0.012357437,0.0070966654,0.8367819],"study_design_scores_gemma":[0.000042723765,0.00010333853,0.0009857664,0.000019473184,0.00007978943,0.00027004821,0.000039692877,0.932536,0.0448096,0.0070800707,0.013981929,0.00005170276],"about_ca_topic_score_codex":0.0038167343,"about_ca_topic_score_gemma":0.003888074,"teacher_disagreement_score":0.005114302,"about_ca_system_score_codex":0.00043066463,"about_ca_system_score_gemma":0.0011415206,"threshold_uncertainty_score":0.017108977},"labels":[],"label_agreement":null},{"id":"W1584325974","doi":"10.1007/978-3-642-13769-3_1","title":"Y-Means: An Autonomous Clustering Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Cluster analysis; Computer science; Robustness (evolution); Dependency (UML); Canopy clustering algorithm; CURE data clustering algorithm; Outlier; Centroid; Data mining; Algorithm; Pattern recognition (psychology); Correlation clustering; Artificial intelligence","score_opus":0.013655174058695428,"score_gpt":0.25067947409963837,"score_spread":0.23702430004094294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584325974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018245451,0.00017275623,0.9937697,0.00006594123,0.00009258375,0.00004107968,0.00009828411,0.0030284754,0.0009064944],"genre_scores_gemma":[0.018689817,0.00025266502,0.97512937,0.00009638531,0.00006648003,0.00017261558,0.00048123836,0.0005876092,0.0045237895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991485,0.00012570046,0.00003746549,0.00025183443,0.00038341654,0.000053082233],"domain_scores_gemma":[0.9994708,0.00011863348,0.00003516129,0.000107636646,0.00023757842,0.000030219544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792235,0.001021489,0.0013343157,0.0013147703,0.0011029021,0.0013911898,0.0023547,0.0014728465,0.0036231447],"category_scores_gemma":[0.0017498054,0.00075438624,0.00091708015,0.0020539742,0.00070364913,0.001560919,0.002013174,0.0012933563,0.004315071],"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.00025500957,0.000082132996,0.00092000247,0.00024833446,0.00018489866,0.000094468254,0.00021468224,0.0822016,0.025749639,0.021372186,0.043032397,0.82564473],"study_design_scores_gemma":[0.00006274068,0.0000647776,0.00069770025,0.000030327896,0.000048200825,0.0002211553,0.000072835166,0.89785874,0.020540392,0.030018013,0.05031822,0.00006689342],"about_ca_topic_score_codex":0.0042370763,"about_ca_topic_score_gemma":0.005467983,"teacher_disagreement_score":0.0042370763,"about_ca_system_score_codex":0.0005287913,"about_ca_system_score_gemma":0.001313809,"threshold_uncertainty_score":0.012120664},"labels":[],"label_agreement":null},{"id":"W1584362086","doi":"10.1007/978-3-540-69134-1_34","title":"Learning to Generalize through Predictive Representations: A Computational Model of Mediated Conditioning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","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":"Computer science; Generalization; Conditioning; Artificial intelligence; Reinforcement learning; Classical conditioning; Predictive coding; Stimulus (psychology); Computational model; Fear conditioning; Machine learning; Cognitive psychology; Psychology; Mathematics","score_opus":0.0857717424198853,"score_gpt":0.3170828072206318,"score_spread":0.2313110648007465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584362086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07283507,0.00040747604,0.9088016,0.0011348097,0.00012192124,0.000039164486,0.00014665515,0.00040338415,0.01610982],"genre_scores_gemma":[0.9082259,0.0005095945,0.08438979,0.00017969155,0.000103979735,0.00010797776,0.00012095405,0.00011370201,0.006248431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997415,0.00008266399,0.000013408051,0.000065965025,0.000057309167,0.00003905355],"domain_scores_gemma":[0.9986118,0.0009667179,0.00011540541,0.00015424892,0.0000827687,0.00006913487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078188523,0.00047786886,0.0007251965,0.00036474355,0.00043360295,0.0019155563,0.002849334,0.00138523,0.006362036],"category_scores_gemma":[0.0042757452,0.00047332453,0.00097026443,0.00055193045,0.0016161543,0.0033474315,0.0010585523,0.002276138,0.0005213239],"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.00009930888,0.000089944784,0.00059534836,0.00008917727,0.000104551735,0.00014088629,0.00025625035,0.27429292,0.0034645814,0.6833223,0.0016281593,0.035916567],"study_design_scores_gemma":[0.000010222066,0.000018011307,0.00010570288,0.000007552057,0.000013786575,0.00004265092,0.000011888478,0.67410535,0.00041753304,0.3249745,0.00028303207,0.000009738683],"about_ca_topic_score_codex":0.0017352353,"about_ca_topic_score_gemma":0.0013183539,"teacher_disagreement_score":0.006362036,"about_ca_system_score_codex":0.0005788129,"about_ca_system_score_gemma":0.0006357551,"threshold_uncertainty_score":0.02128321},"labels":[],"label_agreement":null},{"id":"W1584520372","doi":"10.1007/978-3-642-02097-1_9","title":"Dyna: A Tool for Dynamic Knowledge Modeling","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Ontology; Knowledge representation and reasoning; Domain knowledge; Task (project management); Software engineering; Component (thermodynamics); Artificial intelligence; Systems engineering","score_opus":0.023421474834691206,"score_gpt":0.2747454965368339,"score_spread":0.2513240217021427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584520372","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.0012563022,0.00023629748,0.9361407,0.00023601887,0.000103203056,0.000114355156,0.005489391,0.048981506,0.0074421167],"genre_scores_gemma":[0.044307522,0.00095834024,0.904086,0.00028834175,0.00004771527,0.00064105284,0.021404855,0.012233856,0.016032284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990445,0.00015979563,0.00016361005,0.00024495446,0.0003175186,0.000069649344],"domain_scores_gemma":[0.99803156,0.0010578992,0.00009661109,0.00047310782,0.00024298127,0.00009781632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016827455,0.0013754979,0.0010524457,0.003090106,0.0015304565,0.0056588696,0.0029592982,0.0013772231,0.030700512],"category_scores_gemma":[0.005299396,0.00226961,0.002625054,0.0028310781,0.0009806033,0.0079194615,0.0041334443,0.002558543,0.010899576],"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.00035680758,0.00014648843,0.0019998425,0.0018083325,0.00029622533,0.0006556452,0.0012985293,0.04734073,0.00457494,0.37602773,0.1449036,0.42059118],"study_design_scores_gemma":[0.00008182996,0.000023351473,0.0002463021,0.00029016737,0.00015033518,0.0004168537,0.00019367757,0.24098721,0.008679216,0.19975466,0.5490903,0.00008605036],"about_ca_topic_score_codex":0.008056289,"about_ca_topic_score_gemma":0.011768517,"teacher_disagreement_score":0.030700512,"about_ca_system_score_codex":0.0016368219,"about_ca_system_score_gemma":0.0024636548,"threshold_uncertainty_score":0.10270339},"labels":[],"label_agreement":null},{"id":"W1584559404","doi":"10.1007/978-3-540-72665-4_39","title":"Query-Based Summarization of Customer Reviews","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Université de Montréal","funders":"","keywords":"Computer science; Automatic summarization; sort; Information retrieval; Context (archaeology); Information extraction; Architecture; Natural language processing; Product (mathematics); World Wide Web; Artificial intelligence","score_opus":0.03991587832786806,"score_gpt":0.29241929730605815,"score_spread":0.25250341897819006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584559404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34089482,0.018284936,0.57990086,0.0025854013,0.0016848182,0.0019011503,0.022598963,0.020757433,0.011391688],"genre_scores_gemma":[0.5701742,0.004221227,0.3511545,0.00044950028,0.0019804277,0.00070401264,0.05704249,0.00083241187,0.013441194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985122,0.0004123612,0.00017072764,0.00025920733,0.0005031775,0.00014239262],"domain_scores_gemma":[0.9957826,0.001347476,0.0003669083,0.00023610404,0.0021447944,0.00012212897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306291,0.0012417046,0.001927751,0.0039081615,0.0004904374,0.0016247596,0.0010219851,0.0006969635,0.0033139845],"category_scores_gemma":[0.0057727154,0.0003969349,0.00084398274,0.0033058801,0.00015890964,0.0013838144,0.000619165,0.0006007751,0.003060593],"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.0017671228,0.00038482854,0.004349058,0.0011928887,0.00039354106,0.00038781977,0.00044366525,0.0106506115,0.06461773,0.0010110224,0.071108535,0.84369314],"study_design_scores_gemma":[0.00029747057,0.0020201048,0.033662602,0.00016527546,0.0014925186,0.0012548182,0.001086501,0.81308824,0.086013526,0.00473105,0.05599735,0.0001905152],"about_ca_topic_score_codex":0.0027068818,"about_ca_topic_score_gemma":0.0058122175,"teacher_disagreement_score":0.0039081615,"about_ca_system_score_codex":0.00045461356,"about_ca_system_score_gemma":0.0009360648,"threshold_uncertainty_score":0.011086404},"labels":[],"label_agreement":null},{"id":"W1584634559","doi":"10.1007/978-3-540-30479-1_62","title":"Modeling the Effect of Leadership on Crowd Flow Dynamics","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":57,"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":"Crowds; Factoring; Computer science; Dynamics (music); Computer security; Crowd psychology; Crowd simulation; Control (management); Artificial intelligence; Business; Sociology","score_opus":0.0185810886753449,"score_gpt":0.22715248780107414,"score_spread":0.20857139912572925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584634559","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.49802184,0.0011197606,0.44463435,0.0033117933,0.00058935385,0.000103969425,0.00039056115,0.0005441222,0.051284324],"genre_scores_gemma":[0.98190814,0.00032822008,0.006130716,0.00008546118,0.00008893332,0.00004412682,0.00007237539,0.00004738891,0.011294591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998542,0.0000477797,0.000003508136,0.00002300829,0.000019482257,0.00005212624],"domain_scores_gemma":[0.9991472,0.0005329943,0.00007825406,0.000024106048,0.000084673346,0.00013274027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499343,0.00062784745,0.0006885874,0.00048339178,0.0005857543,0.0010870224,0.0010553127,0.0015282219,0.0047337376],"category_scores_gemma":[0.0026178255,0.0005020751,0.0005790137,0.00034367267,0.000859624,0.0012546207,0.00092266966,0.0009351817,0.00039632973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003460885,0.000039777184,0.00058848626,0.000019906873,0.000009599309,0.000048871,0.000041241154,0.98243713,0.0006832093,0.01240346,0.0009603504,0.002733366],"study_design_scores_gemma":[0.0000054075053,0.00000773888,0.00008295646,0.0000014303138,0.0000019459617,0.0000037678037,0.00001040834,0.9975133,0.00005969479,0.0021783814,0.00013274443,0.0000022924746],"about_ca_topic_score_codex":0.013852388,"about_ca_topic_score_gemma":0.008336231,"teacher_disagreement_score":0.013852388,"about_ca_system_score_codex":0.00089940615,"about_ca_system_score_gemma":0.00092888076,"threshold_uncertainty_score":0.027543545},"labels":[],"label_agreement":null},{"id":"W1584661532","doi":"10.1007/978-3-540-39903-2_55","title":"The Potential for Image Guided Radiation Therapy with Cobalt-60 Tomotherapy","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Kingston Health Sciences Centre; Queen's University","funders":"Canadian Institutes of Health Research; Cancer Care Ontario","keywords":"Tomotherapy; Medical physics; Radiation; Radiation therapy; Nuclear medicine; Image-guided radiation therapy; Computer science; Medicine; Radiology; Physics; Optics","score_opus":0.00840625513485806,"score_gpt":0.2665606174113467,"score_spread":0.25815436227648864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584661532","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06187785,0.31393364,0.29795083,0.01648168,0.0022875569,0.00013590434,0.00046141527,0.003194011,0.30367723],"genre_scores_gemma":[0.73799217,0.091899514,0.08053831,0.004066529,0.0012745674,0.00016231312,0.00035239643,0.00072300225,0.082991175],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987113,0.000030142748,0.000003240493,0.000015036567,0.00006433998,0.000016128773],"domain_scores_gemma":[0.99978215,0.00015073325,0.000012375759,0.000022137143,0.000017688277,0.000014921809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031465688,0.00031956655,0.00037988217,0.0004173331,0.00023035402,0.0013259522,0.00095153425,0.0012099763,0.012573814],"category_scores_gemma":[0.0011015765,0.0002192833,0.00047242802,0.00042587303,0.00067752186,0.00088943186,0.0006287064,0.0007808878,0.0016029708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017672258,0.00022322884,0.0017363481,0.0015727072,0.00020359943,0.000956948,0.00025700944,0.030593013,0.13464959,0.13410479,0.02769579,0.66623974],"study_design_scores_gemma":[0.00040040095,0.0013595384,0.008297245,0.0009867746,0.00052925205,0.011453125,0.00027496464,0.043528106,0.11533958,0.23452874,0.58308756,0.0002146564],"about_ca_topic_score_codex":0.0009380186,"about_ca_topic_score_gemma":0.00084713136,"teacher_disagreement_score":0.012573814,"about_ca_system_score_codex":0.0004857958,"about_ca_system_score_gemma":0.00044158258,"threshold_uncertainty_score":0.042063594},"labels":[],"label_agreement":null},{"id":"W1584671667","doi":"10.1007/3-540-47987-2_51","title":"ASIMIL: Overview of a Distance Learning Flight-Training System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université de Montréal","funders":"","keywords":"Computer science; Distance education; Architecture; Training (meteorology); Software; Artificial intelligence; Human–computer interaction; Virtual reality; Real-time computing; Software engineering; Operating system","score_opus":0.042945078398434894,"score_gpt":0.2523435746889854,"score_spread":0.2093984962905505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584671667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036659148,0.0020363939,0.7009662,0.00079609704,0.00041953844,0.0007527767,0.004268984,0.15444873,0.09965212],"genre_scores_gemma":[0.21909541,0.001721652,0.6531437,0.00086989155,0.00021455043,0.0007856638,0.008338547,0.0030696392,0.11276089],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997795,0.000028055807,0.000011840577,0.00004869181,0.00009902088,0.000032870266],"domain_scores_gemma":[0.99983644,0.000031146465,0.000008929674,0.000023989342,0.000053300344,0.000046132973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865911,0.00061927,0.00041713403,0.0006468358,0.0004209918,0.0009637961,0.001683477,0.0007297846,0.03102224],"category_scores_gemma":[0.000449529,0.00029959664,0.00023418046,0.000522604,0.00019336393,0.0011299358,0.0010879624,0.0006602187,0.009470528],"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.00093093526,0.00037317825,0.0016774319,0.00042658835,0.000048600166,0.00012935053,0.00023990929,0.013213913,0.027012961,0.007777885,0.10840957,0.83975977],"study_design_scores_gemma":[0.0004994652,0.0010128404,0.0043927426,0.00016293327,0.00014571784,0.0008134754,0.00022542203,0.24467435,0.05839892,0.011258048,0.67826396,0.0001521799],"about_ca_topic_score_codex":0.0037865941,"about_ca_topic_score_gemma":0.0044472585,"teacher_disagreement_score":0.03102224,"about_ca_system_score_codex":0.00051262084,"about_ca_system_score_gemma":0.0008486172,"threshold_uncertainty_score":0.10377979},"labels":[],"label_agreement":null},{"id":"W1584684886","doi":"10.1007/978-3-642-19751-2_12","title":"Corrective Enforcement of Security Policies","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Security policy; Computer security; Intuition; Sequence (biology); Computer security model; Bounded function; Property (philosophy); Key (lock); Information security standards; Semantics (computer science); Information security; Network security policy; Security service; Programming language","score_opus":0.015942225461558567,"score_gpt":0.2563675430050766,"score_spread":0.240425317543518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584684886","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.059250854,0.0021629613,0.8321617,0.0035733972,0.0010153889,0.00026094873,0.00016425276,0.011361404,0.09004913],"genre_scores_gemma":[0.7840445,0.001340039,0.17774948,0.0008461891,0.00022631603,0.00007499676,0.00025554685,0.00072744174,0.03473559],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751556,0.00052891794,0.00011315409,0.00033882316,0.0012361989,0.0002672903],"domain_scores_gemma":[0.9933304,0.0018865247,0.00057773665,0.003168495,0.0008909264,0.00014586897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019997756,0.00081766746,0.00042371548,0.0010686355,0.0006616101,0.001812223,0.0014027393,0.0012650742,0.004648182],"category_scores_gemma":[0.008996365,0.00042207172,0.00050513557,0.0004948716,0.0011374581,0.0018783181,0.0013545475,0.0032042083,0.0012554342],"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.00022556819,0.0004334159,0.0018160999,0.00031905764,0.000070344875,0.00053489156,0.0005749274,0.027246151,0.041461326,0.1798972,0.01733257,0.7300884],"study_design_scores_gemma":[0.000082644576,0.0003079096,0.0032670621,0.0004363496,0.00015444678,0.0016061817,0.0003392825,0.39243245,0.122304745,0.34573185,0.13323145,0.000105609404],"about_ca_topic_score_codex":0.00091688306,"about_ca_topic_score_gemma":0.0016415118,"teacher_disagreement_score":0.004648182,"about_ca_system_score_codex":0.00080628105,"about_ca_system_score_gemma":0.0018145355,"threshold_uncertainty_score":0.015549719},"labels":[],"label_agreement":null},{"id":"W1584704873","doi":"10.1007/3-540-45357-1_62","title":"An Improved Learning Algorithm for Augmented Naive Bayes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Naive Bayes classifier; Computer science; Machine learning; Artificial intelligence; Dependency (UML); Bayes' theorem; Bayes classifier; Classifier (UML); Bayesian programming; Bayes error rate; Data mining; Algorithm; Bayesian probability; Support vector machine; Bayes factor","score_opus":0.019100544455930187,"score_gpt":0.2661626872550232,"score_spread":0.247062142799093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584704873","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.0018257229,0.0003118666,0.99506,0.00011123776,0.00014751963,0.000073349554,0.00011431931,0.0009963437,0.0013595052],"genre_scores_gemma":[0.027991304,0.00021701287,0.96664923,0.00015765768,0.0002308665,0.00019676001,0.00047260313,0.00023297897,0.0038516154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584585,0.0014596072,0.00030452682,0.0007213129,0.0014173535,0.00025137165],"domain_scores_gemma":[0.9938585,0.0032332453,0.0001593941,0.0010258807,0.0015891704,0.00013384926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041131317,0.0013543759,0.0032910393,0.0022901022,0.0013624051,0.0032295296,0.004297602,0.0022053218,0.013557863],"category_scores_gemma":[0.01686809,0.0014243299,0.0018410307,0.0029642363,0.001231427,0.0049462677,0.003062105,0.0034058094,0.0050147246],"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.00044372023,0.00016138535,0.0008756561,0.00023663027,0.00019358746,0.00010606867,0.00013234785,0.120558724,0.0019243822,0.06186514,0.014833555,0.7986688],"study_design_scores_gemma":[0.000088979636,0.00004565038,0.00020395126,0.00003786066,0.00007117326,0.00012677374,0.000017528184,0.9121963,0.0009878008,0.07954622,0.0066464986,0.00003131422],"about_ca_topic_score_codex":0.008566038,"about_ca_topic_score_gemma":0.010977729,"teacher_disagreement_score":0.013557863,"about_ca_system_score_codex":0.001158425,"about_ca_system_score_gemma":0.0027377713,"threshold_uncertainty_score":0.04535556},"labels":[],"label_agreement":null},{"id":"W1584722190","doi":"10.1007/978-3-642-04380-2_2","title":"Intelligent Expression-Based Character Agent Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Expression (computer science); Character (mathematics); Parameterized complexity; Creativity; Human–computer interaction; Realism; Computational creativity; Virtual actor; Artificial intelligence; Cognitive science; Virtual reality; Programming language; Epistemology; Algorithm; Psychology","score_opus":0.03437540564366268,"score_gpt":0.2738935967231103,"score_spread":0.23951819107944763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584722190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057808585,0.00043450083,0.88826174,0.0004646884,0.00013100103,0.00016641569,0.00009533046,0.0022197934,0.050417922],"genre_scores_gemma":[0.7220889,0.0003775728,0.2287658,0.00012990422,0.00003570115,0.0002471632,0.00025594543,0.00018718878,0.047911853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997316,0.000085196945,0.00001907071,0.000059941194,0.00007410586,0.000030011539],"domain_scores_gemma":[0.9997323,0.000104083265,0.000019211318,0.00005256785,0.00007124099,0.000020602718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048566598,0.00043040115,0.00048681864,0.00020529171,0.0006059735,0.0015556085,0.0014039704,0.0007105122,0.006781711],"category_scores_gemma":[0.0013307229,0.00023200428,0.00027756745,0.00024472884,0.00083215395,0.0014657311,0.001537879,0.0006766949,0.0012861327],"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.00032072354,0.0003058504,0.0009141797,0.00022201924,0.00007413334,0.00033565122,0.0014809641,0.17320584,0.03762806,0.46617705,0.010180367,0.3091552],"study_design_scores_gemma":[0.000048184636,0.00010094555,0.00030745592,0.000026190337,0.000038483096,0.00012822612,0.00017781528,0.87133545,0.011579261,0.095335215,0.020900767,0.000022026772],"about_ca_topic_score_codex":0.0009459759,"about_ca_topic_score_gemma":0.0010306062,"teacher_disagreement_score":0.006781711,"about_ca_system_score_codex":0.00043970963,"about_ca_system_score_gemma":0.00030620047,"threshold_uncertainty_score":0.022687018},"labels":[],"label_agreement":null},{"id":"W1584777468","doi":"10.1007/11811305_30","title":"A Fuzzy Subspace Algorithm for Clustering High Dimensional Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":57,"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":"Cluster analysis; Fuzzy clustering; Computer science; FLAME clustering; Subspace topology; Dimension (graph theory); k-medians clustering; Cluster (spacecraft); Fuzzy logic; Clustering high-dimensional data; Data mining; Correlation clustering; Pattern recognition (psychology); Single-linkage clustering; Algorithm; CURE data clustering algorithm; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.03486772328265359,"score_gpt":0.3000635860296849,"score_spread":0.26519586274703133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584777468","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.0017675045,0.00021281575,0.9972517,0.000031750777,0.000039985716,0.000024714753,0.00004288311,0.0002628761,0.0003658338],"genre_scores_gemma":[0.019739883,0.00026662086,0.9778641,0.000041304556,0.00005801071,0.000096121825,0.00020819854,0.00006894937,0.0016568094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.00035233962,0.000086810534,0.00022781927,0.00077047123,0.00007650796],"domain_scores_gemma":[0.99913114,0.00023630525,0.000040117047,0.00017590365,0.00036983573,0.000046755675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015168152,0.0008224557,0.0017832291,0.0015478912,0.0012437257,0.0012760594,0.0017732735,0.0011730108,0.0037064971],"category_scores_gemma":[0.0026183734,0.0004793171,0.0012618036,0.0035805237,0.0008781232,0.0018425129,0.0016357306,0.0014005277,0.0019539273],"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.0002025711,0.00008207828,0.00032351853,0.00016243396,0.0001358277,0.00005614708,0.00014321027,0.07365577,0.01387736,0.025153048,0.005893388,0.88031465],"study_design_scores_gemma":[0.000037587262,0.00014092904,0.0005516906,0.000023788743,0.000047111997,0.00027652446,0.00008000887,0.94546306,0.007377995,0.034610163,0.011317792,0.000073357965],"about_ca_topic_score_codex":0.004351097,"about_ca_topic_score_gemma":0.0043022446,"teacher_disagreement_score":0.004351097,"about_ca_system_score_codex":0.0004441468,"about_ca_system_score_gemma":0.0012042027,"threshold_uncertainty_score":0.012399435},"labels":[],"label_agreement":null},{"id":"W1584808909","doi":"10.1007/11851561_22","title":"On the Complexity of the Crossing Contact Map Pattern Matching Problem","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA Research and Splicing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Time complexity; Computer science; Matching (statistics); Interval (graph theory); Algorithm; Pattern matching; Set (abstract data type); Substructure; Polynomial; Computational complexity theory; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.023052542881402214,"score_gpt":0.2653243336359522,"score_spread":0.24227179075455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584808909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40586567,0.004275942,0.46161866,0.014143362,0.00059243524,0.00042737895,0.004523084,0.0013041695,0.10724942],"genre_scores_gemma":[0.8425642,0.0037136797,0.12252529,0.0010432764,0.0012022584,0.0005262742,0.005668864,0.00056034746,0.022195771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725276,0.0007339985,0.00016728541,0.0006322423,0.00082406367,0.00038966938],"domain_scores_gemma":[0.97666794,0.0195155,0.0010747163,0.0013349956,0.00076009554,0.0006467547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020254017,0.0011434201,0.0031888236,0.0018596806,0.002378892,0.0068479017,0.00432841,0.0039217337,0.022515927],"category_scores_gemma":[0.024291242,0.0010421268,0.0017931312,0.00498222,0.0027179786,0.013539458,0.0043259882,0.0049894373,0.0019420553],"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.0007792829,0.00047511025,0.0032561582,0.00080470653,0.00019555767,0.0005752667,0.000585556,0.17289293,0.0025452194,0.69132066,0.034555398,0.092014164],"study_design_scores_gemma":[0.00006910972,0.000034383484,0.00050450803,0.000030425204,0.000037149694,0.00017842483,0.0001179188,0.21652143,0.00045755648,0.77982706,0.002196244,0.000025848365],"about_ca_topic_score_codex":0.0036081858,"about_ca_topic_score_gemma":0.0023501709,"teacher_disagreement_score":0.022515927,"about_ca_system_score_codex":0.0022380946,"about_ca_system_score_gemma":0.0018238297,"threshold_uncertainty_score":0.07532328},"labels":[],"label_agreement":null},{"id":"W1584874716","doi":"10.1007/978-3-642-13059-5_52","title":"On Multi-robot Area Coverage","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Robot; Task (project management); Computer science; Mobile robot; Path (computing); Point (geometry); Actuator; Motion planning; Robot kinematics; Robot control; Human–computer interaction; Artificial intelligence; Real-time computing; Engineering; Computer network","score_opus":0.0200022003704376,"score_gpt":0.26741553969595916,"score_spread":0.24741333932552156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584874716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058250627,0.0113740815,0.965887,0.0007560687,0.0003566963,0.00010259852,0.00022453559,0.0004071677,0.015066737],"genre_scores_gemma":[0.5926585,0.02465678,0.35733423,0.0012220544,0.0018468229,0.0007670809,0.0013511128,0.00053975184,0.01962372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717146,0.0008609354,0.0001001755,0.0006253969,0.0009247123,0.00031737096],"domain_scores_gemma":[0.9967854,0.0018979628,0.00027036038,0.00048301838,0.00037956412,0.00018381426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00146446,0.0017886934,0.0019125675,0.0018929663,0.0010937226,0.0019505352,0.0028065532,0.0018882046,0.004858851],"category_scores_gemma":[0.006248933,0.00065591163,0.0009416985,0.0046686623,0.0020626916,0.0035940465,0.004304347,0.0020114542,0.0012611353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029323826,0.000053301967,0.0011161916,0.0006661358,0.00019172017,0.00051996566,0.00026054613,0.6454696,0.0038478693,0.16521175,0.016788373,0.16558133],"study_design_scores_gemma":[0.000058392845,0.00014180296,0.00069499225,0.00017107085,0.00006591966,0.00051221775,0.00010322969,0.74653697,0.00210906,0.20246308,0.047095966,0.000047346355],"about_ca_topic_score_codex":0.00461469,"about_ca_topic_score_gemma":0.0023366218,"teacher_disagreement_score":0.004858851,"about_ca_system_score_codex":0.0014264502,"about_ca_system_score_gemma":0.0006422018,"threshold_uncertainty_score":0.016254485},"labels":[],"label_agreement":null},{"id":"W1584907464","doi":"10.1007/978-3-642-10470-1_17","title":"Use of High Dynamic Range Images for Improved Medical Simulations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Carleton University","funders":"","keywords":"Computer science; Rendering (computer graphics); OpenGL; Shader; Computer graphics (images); High dynamic range; Computer vision; Real-time rendering; Artificial intelligence; Image-based lighting; Dynamic range; Image-based modeling and rendering; Visualization","score_opus":0.021895168025801413,"score_gpt":0.29986855891769876,"score_spread":0.2779733908918973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584907464","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.036204193,0.0024269188,0.9430833,0.0005766161,0.00017594898,0.0000802219,0.0001376003,0.0031582671,0.014156889],"genre_scores_gemma":[0.4074196,0.0030418455,0.57940406,0.00038978123,0.0001235641,0.00008310207,0.00022322519,0.0013864553,0.007928358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999648,0.000114972645,0.000020601216,0.000034425153,0.0001605204,0.000021431642],"domain_scores_gemma":[0.99836856,0.0011147768,0.00008620405,0.00020296736,0.00017860514,0.000048854665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006386997,0.0007079003,0.000384293,0.0006699986,0.00017852901,0.0013699731,0.0007372129,0.0007362924,0.010640115],"category_scores_gemma":[0.0039134272,0.0005466096,0.00043303875,0.00045642006,0.00027111196,0.0010221263,0.0010678372,0.00094525475,0.0011778454],"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.0009848546,0.00019373822,0.0012350477,0.00071062427,0.00013673476,0.0008345648,0.00034003708,0.11936396,0.3513719,0.01466577,0.006101121,0.5040617],"study_design_scores_gemma":[0.0001684659,0.0004088762,0.0019953223,0.00021019953,0.0002168538,0.0035525714,0.00009604254,0.6218236,0.326344,0.0072863,0.037759475,0.00013837605],"about_ca_topic_score_codex":0.00035362178,"about_ca_topic_score_gemma":0.00043643234,"teacher_disagreement_score":0.010640115,"about_ca_system_score_codex":0.00023826327,"about_ca_system_score_gemma":0.00021129988,"threshold_uncertainty_score":0.0355947},"labels":[],"label_agreement":null},{"id":"W1584915927","doi":"10.1007/3-540-44886-1_27","title":"DIAGAL: A Tool for Analyzing and Modelling Commitment-Based Dialogues between Agents","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Delegate; Computer science; Conversation; Action (physics); Point (geometry); Human–computer interaction; Dialectic; Artificial intelligence; Epistemology; Communication; Psychology; Programming language","score_opus":0.0633611029621405,"score_gpt":0.27332563222349454,"score_spread":0.20996452926135406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584915927","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.0043179444,0.00008432242,0.97034174,0.000063031286,0.000050247698,0.00019574369,0.0019687673,0.019750899,0.0032273189],"genre_scores_gemma":[0.14361888,0.00031551183,0.8331866,0.00016364433,0.000040580286,0.0008430926,0.008109339,0.0037533494,0.009968946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989849,0.00031958547,0.000127391,0.00021087844,0.00027836752,0.00007892903],"domain_scores_gemma":[0.99819046,0.0011245738,0.00013539843,0.00027134296,0.00020104779,0.00007709966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196073,0.0015808663,0.00080833427,0.0014796251,0.000972707,0.0029583697,0.0027198417,0.0011869293,0.014760756],"category_scores_gemma":[0.0040601376,0.001403765,0.0016450173,0.00091455225,0.0010420807,0.0028354456,0.0019949917,0.0018678948,0.0035286457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010416759,0.00051485025,0.005655956,0.002378145,0.00031901343,0.0011917672,0.0022183617,0.39322793,0.020853292,0.26794147,0.048097894,0.25655958],"study_design_scores_gemma":[0.000088998255,0.000061081744,0.00036515354,0.00007190203,0.00005871317,0.0002035994,0.00018214156,0.8783316,0.011400487,0.057339154,0.051825687,0.00007139463],"about_ca_topic_score_codex":0.0056733363,"about_ca_topic_score_gemma":0.007546862,"teacher_disagreement_score":0.014760756,"about_ca_system_score_codex":0.00085914735,"about_ca_system_score_gemma":0.0015572114,"threshold_uncertainty_score":0.049379647},"labels":[],"label_agreement":null},{"id":"W1585059879","doi":"10.1007/978-3-642-15561-1_37","title":"Visual Tracking Using a Pixelwise Spatiotemporal Oriented Energy Representation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Representation (politics); Image warping; Artificial intelligence; Pattern recognition (psychology); Inter frame; Computer vision; Tracking (education); Motion estimation; Frame (networking); Reference frame","score_opus":0.038147052986569716,"score_gpt":0.32599792736978356,"score_spread":0.28785087438321383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585059879","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.0027016439,0.00008783924,0.9964395,0.000031226573,0.000027466522,0.000010399199,0.00002889066,0.00008935773,0.0005836825],"genre_scores_gemma":[0.21309842,0.000686611,0.77877057,0.00012711168,0.00009842853,0.00010027151,0.0004052991,0.0002356649,0.0064775944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982387,0.0000292841,0.000013758389,0.000050141083,0.000067976296,0.000015107104],"domain_scores_gemma":[0.9998455,0.000038573253,0.00002055224,0.000037834427,0.0000477909,0.000009760242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041363577,0.0005019976,0.0005641564,0.00086862297,0.00021634428,0.0010555584,0.0008132244,0.0007852094,0.001759112],"category_scores_gemma":[0.0009213177,0.00034785928,0.0007364117,0.0014303385,0.00026909506,0.0013711936,0.0007790958,0.00062843587,0.0006507942],"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.00020980694,0.00011857661,0.00066879764,0.0001387105,0.00014005823,0.00014081615,0.00007784524,0.23792139,0.09550933,0.065483384,0.003272087,0.5963192],"study_design_scores_gemma":[0.0000052097075,0.000030090874,0.0003917708,0.000008771052,0.00002416111,0.00010104469,0.000007537427,0.9832624,0.005487819,0.009045607,0.0016221112,0.0000135371765],"about_ca_topic_score_codex":0.0011517715,"about_ca_topic_score_gemma":0.001438699,"teacher_disagreement_score":0.001759112,"about_ca_system_score_codex":0.000334689,"about_ca_system_score_gemma":0.00029177868,"threshold_uncertainty_score":0.005884826},"labels":[],"label_agreement":null},{"id":"W1585060786","doi":"10.1007/11559573_58","title":"Object Shape Extraction Based on the Piecewise Linear Skeletal Representation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Université du Québec en Outaouais","funders":"","keywords":"Piecewise linear function; Computer science; Segmentation; Piecewise; Artificial intelligence; Pixel; Vertex (graph theory); Computer vision; Image segmentation; Planar; Pattern recognition (psychology); Algorithm; Mathematics; Geometry; Computer graphics (images); Theoretical computer science; Graph","score_opus":0.026489472866013927,"score_gpt":0.3070585636167025,"score_spread":0.28056909075068853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585060786","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.010736365,0.00024951462,0.98552877,0.00005464303,0.000028192975,0.000042781678,0.00016471917,0.0014629184,0.0017321681],"genre_scores_gemma":[0.13609627,0.00085828034,0.8526199,0.00007369947,0.000050538598,0.00007103382,0.001358509,0.000597453,0.008274339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996629,0.000028033544,0.000017668886,0.00007457667,0.00017776882,0.000039058858],"domain_scores_gemma":[0.9996772,0.00006993888,0.00003349744,0.00009038395,0.000111637266,0.000017332397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026852638,0.00062897854,0.00095827447,0.0022307574,0.00026544332,0.0008635375,0.0011840808,0.00082597503,0.0044377493],"category_scores_gemma":[0.00082964415,0.00068244763,0.0010236879,0.0024856,0.000339533,0.0010733749,0.0007298673,0.00085132703,0.003039222],"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.00012617919,0.000037176866,0.00044557624,0.00016199736,0.000045863017,0.00013142414,0.00004209442,0.019229922,0.13438192,0.0038255216,0.0028512285,0.83872116],"study_design_scores_gemma":[0.000019398725,0.00014948168,0.0029976103,0.00004402606,0.00010385999,0.00093093235,0.000047225098,0.9041311,0.07531621,0.0073323264,0.008882867,0.000045023236],"about_ca_topic_score_codex":0.0017557188,"about_ca_topic_score_gemma":0.0028330577,"teacher_disagreement_score":0.0044377493,"about_ca_system_score_codex":0.00023296187,"about_ca_system_score_gemma":0.0005221223,"threshold_uncertainty_score":0.014845729},"labels":[],"label_agreement":null},{"id":"W1585142714","doi":"10.1007/978-3-540-88871-0_56","title":"A Two Level Approach for Managing Resource and Data Intensive Tasks in Grids","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Distributed computing; Grid computing; Grid; Scheduling (production processes); Workload; Architecture; Data grid; Job scheduler; Cloud computing; Operating system","score_opus":0.0731301546216732,"score_gpt":0.2875217492566456,"score_spread":0.21439159463497237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585142714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009333367,0.0005031996,0.973459,0.0013985886,0.00027490905,0.00018086442,0.00008989569,0.0016976937,0.013062513],"genre_scores_gemma":[0.13896614,0.0005325229,0.83400446,0.00080086367,0.00017142908,0.00038264264,0.00018559535,0.00031065784,0.024645623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871516,0.00025455744,0.00009535277,0.00014927344,0.0005791411,0.00020660608],"domain_scores_gemma":[0.99902284,0.00023559178,0.000055193374,0.0003709003,0.00014618046,0.00016934525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135818,0.000653443,0.00074669014,0.0007713421,0.001543839,0.0036151044,0.0028309207,0.0018541993,0.006416105],"category_scores_gemma":[0.0021603599,0.00081539515,0.0012210499,0.001108511,0.0016177754,0.0034228896,0.00413421,0.0031447771,0.0016071995],"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.00047090527,0.00045934579,0.001905205,0.00064912514,0.00018631903,0.0007895168,0.0017078668,0.10127134,0.040503502,0.5433608,0.030300796,0.27839518],"study_design_scores_gemma":[0.00019473034,0.00036800993,0.0010615553,0.00013326282,0.00016838191,0.00069003046,0.00043476056,0.5412854,0.017009875,0.31930903,0.11917386,0.00017111203],"about_ca_topic_score_codex":0.0034169136,"about_ca_topic_score_gemma":0.0059265364,"teacher_disagreement_score":0.006416105,"about_ca_system_score_codex":0.0011743238,"about_ca_system_score_gemma":0.0021162974,"threshold_uncertainty_score":0.02146405},"labels":[],"label_agreement":null},{"id":"W1585202549","doi":"10.1007/978-3-540-69149-5_37","title":"Model-Checking Software Using Precise Abstractions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency; Compiler; Software; Exploit; Software engineering; Software quality; Software construction; Software verification; Programming language; Software development; Software framework; Operating system; Distributed computing; Computer security","score_opus":0.08131206888019911,"score_gpt":0.31204394156780363,"score_spread":0.23073187268760453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585202549","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.00712478,0.000141496,0.9893364,0.000066523455,0.000040150146,0.00002939423,0.000024555748,0.0018999422,0.0013367176],"genre_scores_gemma":[0.31079924,0.00065650546,0.68082273,0.00011880972,0.00006512993,0.00015336473,0.00018481033,0.0010834552,0.006115982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646795,0.0006840291,0.00022458575,0.00044994836,0.0019080832,0.00026529224],"domain_scores_gemma":[0.994759,0.0025300055,0.0002925672,0.0020609926,0.0003030866,0.000054303026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031636339,0.0015987746,0.0012677291,0.0011334686,0.0006616423,0.0019623674,0.0024502082,0.0015015333,0.00250466],"category_scores_gemma":[0.009040331,0.0019868237,0.002342848,0.0011180472,0.0027224775,0.0054491404,0.003235371,0.0045445194,0.0006089584],"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.00019147775,0.000063214844,0.0008639221,0.00055811624,0.00014688447,0.0002928767,0.0006913948,0.25323716,0.02731112,0.5764749,0.0021699094,0.13799903],"study_design_scores_gemma":[0.000069074005,0.000101346275,0.00023899914,0.00013187602,0.00017261562,0.00023281819,0.00005114102,0.45263463,0.049851812,0.4825387,0.013918241,0.000058745467],"about_ca_topic_score_codex":0.0010563723,"about_ca_topic_score_gemma":0.0014964816,"teacher_disagreement_score":0.0031636339,"about_ca_system_score_codex":0.0010176479,"about_ca_system_score_gemma":0.0013472107,"threshold_uncertainty_score":0.016731083},"labels":[],"label_agreement":null},{"id":"W1585210950","doi":"10.1007/11919476_37","title":"An Improved Representation of Junctions Through Asymmetric Tensor Diffusion","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Robustness (evolution); Asymmetry; Representation (politics); Diffusion MRI; Structure tensor; Tensor (intrinsic definition); Diffusion; Artificial intelligence; Convolutional neural network; Algorithm; Pattern recognition (psychology); Image (mathematics); Mathematics; Physics; Geometry","score_opus":0.019795122062193558,"score_gpt":0.2940108031782403,"score_spread":0.2742156811160467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585210950","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.011198749,0.0002229866,0.98518467,0.0001009916,0.000102526246,0.000024849429,0.00013237841,0.00037430972,0.00265865],"genre_scores_gemma":[0.23092191,0.0009260997,0.751323,0.00013080379,0.00022047907,0.00009516414,0.0006054207,0.0007350024,0.015042142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976057,0.000057496225,0.000016458089,0.000049061124,0.000088016764,0.000028326382],"domain_scores_gemma":[0.99954444,0.0001062545,0.00005030944,0.00010409715,0.0001384919,0.00005647985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065045437,0.00084760494,0.00096468127,0.0013910936,0.0004547091,0.0017625198,0.0017331558,0.0014259673,0.00423303],"category_scores_gemma":[0.0012999474,0.0005031487,0.00069854484,0.0015274631,0.0006222975,0.0027297698,0.0010058638,0.0015544891,0.0014456724],"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.000209827,0.000121462814,0.0003524377,0.00023165296,0.00005232218,0.00021140846,0.00022045849,0.17448312,0.052097883,0.5553279,0.007917139,0.20877436],"study_design_scores_gemma":[0.000008220638,0.000024268233,0.00007129927,0.000008003921,0.000012928069,0.000070754795,0.000015756228,0.9485158,0.0031487152,0.043882847,0.0042221146,0.00001937844],"about_ca_topic_score_codex":0.0020369038,"about_ca_topic_score_gemma":0.0027206605,"teacher_disagreement_score":0.00423303,"about_ca_system_score_codex":0.0004450937,"about_ca_system_score_gemma":0.0005174103,"threshold_uncertainty_score":0.014160931},"labels":[],"label_agreement":null},{"id":"W1585249113","doi":"10.1007/978-3-540-69744-2_20","title":"Making the Real World as a Game World to Learners by Applying Game-Based Learning Scenes into Ubiquitous Learning Environment","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Athabasca University","funders":"","keywords":"Computer science; Learning environment; Personalized learning; Synchronous learning; Construct (python library); Experiential learning; Context (archaeology); Active learning (machine learning); Multimedia; Artificial intelligence; Human–computer interaction; Cooperative learning; Open learning; Teaching method; Mathematics education; Psychology","score_opus":0.030901227792169375,"score_gpt":0.3119680687042202,"score_spread":0.28106684091205086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585249113","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.067046724,0.0024599181,0.70430547,0.0020852431,0.00071876834,0.00032399682,0.00007648888,0.00284424,0.22013912],"genre_scores_gemma":[0.48206446,0.004615547,0.3975736,0.0008456649,0.000114800845,0.00037386807,0.00020848558,0.0005241017,0.113679476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997584,0.00007150634,0.000010036324,0.000046021978,0.00007404398,0.000039972692],"domain_scores_gemma":[0.9998728,0.000042797943,0.0000074517925,0.000015551484,0.00001899055,0.00004238688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886345,0.0007508959,0.0002697429,0.00029404685,0.00060755946,0.0031316783,0.0008034548,0.00076520076,0.004868974],"category_scores_gemma":[0.000754383,0.0002810798,0.00053609343,0.00021275037,0.00118372,0.0041556773,0.0026670457,0.0012624249,0.0010726593],"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.00010562216,0.0004997783,0.0017272941,0.0008815603,0.00007535399,0.00075010734,0.027871652,0.0074917227,0.06569552,0.36548665,0.026540326,0.5028744],"study_design_scores_gemma":[0.000045120112,0.0003483805,0.0037173808,0.0005145005,0.000138834,0.0017511034,0.013532299,0.027570505,0.026613945,0.15180527,0.7738369,0.00012577978],"about_ca_topic_score_codex":0.00077871536,"about_ca_topic_score_gemma":0.0016155989,"teacher_disagreement_score":0.004868974,"about_ca_system_score_codex":0.00025503535,"about_ca_system_score_gemma":0.0005087192,"threshold_uncertainty_score":0.0162884},"labels":[],"label_agreement":null},{"id":"W1585341798","doi":"10.1007/11553939_171","title":"Leximancer Concept Mapping of Patient Case Studies","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Semantic mapping; Information retrieval; Semantic analysis (machine learning); Natural language; Natural language processing; Data science","score_opus":0.028233692346901887,"score_gpt":0.2895871211396911,"score_spread":0.2613534287927892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585341798","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.097972706,0.0030800013,0.8652375,0.00159626,0.00034055475,0.00090498605,0.011951867,0.0058703893,0.013045845],"genre_scores_gemma":[0.34115717,0.0010727571,0.6302251,0.00032326317,0.000107790154,0.00064216624,0.021668231,0.0004887619,0.0043147635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947225,0.0020541581,0.00078281795,0.000980753,0.0011999803,0.00025975538],"domain_scores_gemma":[0.9871896,0.008878678,0.00045038803,0.0018165878,0.0014606455,0.00020412693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064390814,0.00079606817,0.00088138523,0.008387775,0.0010516845,0.002706713,0.0023891542,0.0010949684,0.008059079],"category_scores_gemma":[0.023237986,0.0004154532,0.0015883197,0.0056847157,0.0007919427,0.0029110154,0.0035163707,0.0013228272,0.0015325338],"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.0006211378,0.00032901694,0.015989492,0.0011429398,0.00039142402,0.0014498397,0.0010556064,0.023714893,0.0037270575,0.027066799,0.024101637,0.90041023],"study_design_scores_gemma":[0.00023470749,0.00040093125,0.014428295,0.00082972826,0.00077003066,0.006040018,0.0027923407,0.5858267,0.03256536,0.26819155,0.08778766,0.0001327212],"about_ca_topic_score_codex":0.003497552,"about_ca_topic_score_gemma":0.006123042,"teacher_disagreement_score":0.008387775,"about_ca_system_score_codex":0.0011362719,"about_ca_system_score_gemma":0.0028352488,"threshold_uncertainty_score":0.034053504},"labels":[],"label_agreement":null},{"id":"W1585405399","doi":"10.1007/3-540-36580-x_34","title":"On the Optimal Control of Hybrid Systems: Optimization of Trajectories, Switching Times, and Location Schedules","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":94,"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":"Computer science; Convergence (economics); Mathematical optimization; Class (philosophy); Optimal control; Maximum principle; Hybrid system; Function (biology); Penalty method; Trajectory; Set (abstract data type); Mathematics; Artificial intelligence","score_opus":0.005677807527069072,"score_gpt":0.18854642484054235,"score_spread":0.1828686173134733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585405399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093025435,0.0054533845,0.968133,0.00062858046,0.00023002396,0.000033253487,0.00010356963,0.00012395722,0.015991759],"genre_scores_gemma":[0.7107773,0.016625896,0.23649321,0.00037276917,0.0010896743,0.00035948248,0.00051021035,0.00041673545,0.03335471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996797,0.00013478727,0.000014512058,0.00005601082,0.000086356784,0.000028552988],"domain_scores_gemma":[0.99918574,0.00062400283,0.000058320114,0.00003543655,0.00006713001,0.000029313509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010357443,0.0015428109,0.0016520717,0.00053449924,0.0003111081,0.0015661347,0.00115723,0.0013054296,0.003691537],"category_scores_gemma":[0.002662762,0.00081535196,0.00075975095,0.0014943,0.0013413095,0.0015404028,0.0009431918,0.0016981305,0.00041196766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059163027,0.000033032946,0.00012001458,0.00013908597,0.000034489185,0.000020524652,0.000056975696,0.86760587,0.00066035124,0.09298101,0.0043033157,0.033986185],"study_design_scores_gemma":[0.00001508753,0.000037340036,0.00013936908,0.00002437247,0.000012499428,0.0000134576,0.000016516718,0.89328337,0.00022510356,0.103932194,0.0022884358,0.000012267877],"about_ca_topic_score_codex":0.003637158,"about_ca_topic_score_gemma":0.0031690488,"teacher_disagreement_score":0.003691537,"about_ca_system_score_codex":0.0009550456,"about_ca_system_score_gemma":0.0009446182,"threshold_uncertainty_score":0.012349367},"labels":[],"label_agreement":null},{"id":"W158542629","doi":"10.1007/978-3-642-40763-5_61","title":"Joint Statistics on Cardiac Shape and Fiber Architecture","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Elasticity and Material Modeling","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":"McGill University","funders":"","keywords":"Computer science; Architecture; Joint (building); Fiber; Joint probability distribution; Artificial intelligence; Statistics; Mathematics; Structural engineering; Materials science; Engineering","score_opus":0.009494021028624651,"score_gpt":0.200036311877419,"score_spread":0.19054229084879434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158542629","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.29282725,0.00083305937,0.70019674,0.000906755,0.00017882635,0.00004000229,0.0023895984,0.0008044643,0.001823281],"genre_scores_gemma":[0.9679996,0.0014255474,0.020393407,0.00017686987,0.0005209398,0.00007693989,0.004021576,0.00030600035,0.0050792485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863845,0.0004062472,0.00007783739,0.00035888632,0.00037601404,0.00014244838],"domain_scores_gemma":[0.9770428,0.014221222,0.0022295243,0.004050909,0.0017312219,0.00072426343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00496011,0.0007552851,0.00142984,0.0019420442,0.00035770048,0.0014733248,0.0011206976,0.0012173378,0.002658531],"category_scores_gemma":[0.021507926,0.0007652358,0.0011237737,0.0023835984,0.0014127977,0.0024026542,0.0014481568,0.0015921565,0.0013117478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013574976,0.00030171417,0.12286449,0.00032295941,0.0007560045,0.00076422363,0.00042889142,0.50280046,0.027401535,0.10828597,0.010844289,0.22387198],"study_design_scores_gemma":[0.000023872397,0.00014189411,0.049946204,0.000032368825,0.000114610455,0.0005976911,0.000077261786,0.88549,0.0028290218,0.059024457,0.0016377697,0.000084894156],"about_ca_topic_score_codex":0.0018874543,"about_ca_topic_score_gemma":0.003400046,"teacher_disagreement_score":0.00496011,"about_ca_system_score_codex":0.00046274095,"about_ca_system_score_gemma":0.0010365859,"threshold_uncertainty_score":0.026231825},"labels":[],"label_agreement":null},{"id":"W1585459043","doi":"10.1007/11518655_21","title":"Causality, Simpson’s Paradox, and Context-Specific Independence","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Saskatchewan","funders":"","keywords":"Computer science; Inference; Generalization; Causal inference; Causality (physics); Context (archaeology); Relevance (law); Independence (probability theory); Causal model; Artificial intelligence; Focus (optics); Simple (philosophy); Interpretation (philosophy); Machine learning; Epistemology; Econometrics; Mathematics; Statistics","score_opus":0.03052516151553545,"score_gpt":0.25896413396859896,"score_spread":0.22843897245306352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585459043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06067158,0.016227275,0.55126405,0.036940556,0.0017498435,0.00007739388,0.0004979447,0.00021022356,0.3323612],"genre_scores_gemma":[0.8911447,0.00900915,0.066540964,0.0045002233,0.002300646,0.00015949307,0.0003469538,0.00014549804,0.025852315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957557,0.0016669517,0.00031357244,0.0007368412,0.0012634764,0.0002634362],"domain_scores_gemma":[0.98132515,0.014446515,0.00089372514,0.0019680967,0.00086289376,0.00050357304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007630491,0.00057843066,0.0015033697,0.0021466713,0.0025148762,0.0040295008,0.0017285716,0.0036622868,0.0075210705],"category_scores_gemma":[0.03077057,0.00082148256,0.0012467026,0.0028510604,0.011171366,0.014072483,0.0040418706,0.0073586158,0.00076690677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005727674,0.000004714759,0.000094835115,0.000020980331,0.0000074139416,0.000037400874,0.00009199268,0.00027588347,0.000027328539,0.9954906,0.0008963371,0.0030467976],"study_design_scores_gemma":[0.0000022343693,5.991638e-7,0.000021874168,0.0000037317861,0.0000017049896,0.000026897962,0.000010548653,0.00021791349,0.000008735471,0.999132,0.00057209755,0.0000017105058],"about_ca_topic_score_codex":0.001629032,"about_ca_topic_score_gemma":0.0021073832,"teacher_disagreement_score":0.007630491,"about_ca_system_score_codex":0.0016891476,"about_ca_system_score_gemma":0.0015679507,"threshold_uncertainty_score":0.04035443},"labels":[],"label_agreement":null},{"id":"W1585558740","doi":"10.1007/978-3-540-69132-7_119","title":"Decision Tree for Tracking Learner’s Emotional State Predicted from His Electrical Brain Activity","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Decision tree; Artificial intelligence; Classifier (UML); Influence diagram; Machine learning; International Affective Picture System; Decision tree learning; Intelligent tutoring system; Tree (set theory); Task (project management); Transition (genetics); Human–computer interaction; Psychology","score_opus":0.029282299237930912,"score_gpt":0.2612958016464753,"score_spread":0.2320135024085444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585558740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111352995,0.0014897682,0.8765099,0.00055644655,0.00034944856,0.0003231039,0.0019007297,0.004865739,0.0026519226],"genre_scores_gemma":[0.61155635,0.0004825052,0.37663898,0.00039392005,0.00013146889,0.00039499972,0.0038785194,0.00018625717,0.0063370666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.00009913732,0.000049522667,0.00015252469,0.00007347909,0.00007416671],"domain_scores_gemma":[0.9985684,0.0010275687,0.000041221985,0.000043740274,0.00025858337,0.000060563565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691837,0.0007776068,0.0013056279,0.0009238493,0.00057686516,0.00068003434,0.0010804551,0.00146082,0.003697038],"category_scores_gemma":[0.002187599,0.000354195,0.0007943549,0.00078265823,0.00016571881,0.0007108841,0.0006134254,0.0011045818,0.0012864573],"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.0009772143,0.00050043146,0.0048669945,0.00016830096,0.00019339609,0.00021873221,0.00008126435,0.164344,0.0072350428,0.0017672179,0.010699972,0.80894756],"study_design_scores_gemma":[0.000023777506,0.00006746568,0.0007195972,0.000016024964,0.000029337229,0.000029756426,0.0000125033175,0.9965593,0.0012056659,0.00095003506,0.0003802172,0.0000062990293],"about_ca_topic_score_codex":0.011029408,"about_ca_topic_score_gemma":0.009890976,"teacher_disagreement_score":0.011029408,"about_ca_system_score_codex":0.00065768126,"about_ca_system_score_gemma":0.000949926,"threshold_uncertainty_score":0.021930456},"labels":[],"label_agreement":null},{"id":"W1585579633","doi":"10.1007/978-3-540-74466-5_65","title":"A Decentralized Solution for Locating Mobile Agents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Tree traversal; Mobile agent; Distributed computing; Path (computing); Tracking (education); Task (project management); Computer network; Artificial intelligence; Algorithm","score_opus":0.049261638637743486,"score_gpt":0.31638860147827047,"score_spread":0.267126962840527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585579633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052559017,0.00010096441,0.9897092,0.00015877903,0.00005782277,0.0000659638,0.000042611937,0.00029181136,0.004316902],"genre_scores_gemma":[0.23983851,0.00031589714,0.7411439,0.0001323244,0.00011684628,0.0006189019,0.00019304013,0.00013140851,0.017509185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957556,0.000112987946,0.000019324909,0.00010256762,0.00013147494,0.000058156664],"domain_scores_gemma":[0.99960107,0.00019292136,0.000037986116,0.00005552205,0.00008128565,0.000031253618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071892916,0.0008016763,0.0013009921,0.0007135556,0.0010808449,0.0007758082,0.0020770263,0.002368934,0.0064117415],"category_scores_gemma":[0.0022593332,0.00058791274,0.0006736677,0.0011186113,0.00078690186,0.0012462877,0.0024089187,0.0009181529,0.0010491912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021271114,0.00011271885,0.00023005457,0.00025079088,0.0000479917,0.00016486588,0.00017707511,0.724361,0.00678829,0.071964845,0.008717384,0.18697226],"study_design_scores_gemma":[0.000102606675,0.00008109506,0.000075040734,0.0000141665205,0.000018731525,0.00007830233,0.000044377517,0.968073,0.00094841653,0.026663592,0.0038896091,0.000011090771],"about_ca_topic_score_codex":0.0021401371,"about_ca_topic_score_gemma":0.0034054986,"teacher_disagreement_score":0.0064117415,"about_ca_system_score_codex":0.0006716736,"about_ca_system_score_gemma":0.0012424155,"threshold_uncertainty_score":0.021449387},"labels":[],"label_agreement":null},{"id":"W1585628008","doi":"10.1007/978-3-540-45234-8_63","title":"The Bank Nth Chance Replacement Policy for FPGA-Based CAMs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","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 Alberta","funders":"","keywords":"Computer science; Cache; Cache algorithms; Page cache; CPU cache; Field-programmable gate array; Smart Cache; Embedded system; Content-addressable memory; Parallel computing","score_opus":0.014346994644272202,"score_gpt":0.25611510585889974,"score_spread":0.24176811121462755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585628008","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.17322843,0.0028980302,0.7878641,0.0008782111,0.0006145565,0.00011776051,0.00021590653,0.0024600262,0.03172298],"genre_scores_gemma":[0.9408386,0.00030351002,0.05091134,0.00010346874,0.00009083696,0.000028361927,0.000062818275,0.00006464925,0.0075964145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996995,0.0000648933,0.000019455127,0.000044038246,0.0000949066,0.00007728659],"domain_scores_gemma":[0.9994771,0.00023104993,0.000045141038,0.000111219866,0.00010200086,0.00003350003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040710656,0.00038469047,0.0006016449,0.00034279667,0.00045848853,0.00086567004,0.0007598802,0.0004484013,0.007344853],"category_scores_gemma":[0.0019868664,0.00021265932,0.00019604409,0.0003451912,0.00028071206,0.0006319203,0.00030718817,0.0005237011,0.0006844309],"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.0014352561,0.0001367645,0.0023174013,0.00020717793,0.00005539884,0.00036022597,0.00008075487,0.39159447,0.022199761,0.05170093,0.015805969,0.5141059],"study_design_scores_gemma":[0.000044417095,0.0001775351,0.00084420166,0.00002604993,0.000027037853,0.00034452885,0.000024200292,0.97405803,0.008281206,0.011245787,0.004911562,0.0000154646],"about_ca_topic_score_codex":0.002273518,"about_ca_topic_score_gemma":0.004443458,"teacher_disagreement_score":0.007344853,"about_ca_system_score_codex":0.0005616043,"about_ca_system_score_gemma":0.0011298481,"threshold_uncertainty_score":0.024570942},"labels":[],"label_agreement":null},{"id":"W1585793187","doi":"10.1007/978-3-642-21881-1_35","title":"Incorporating Game Theory in Feature Selection for Text Categorization","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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 Regina","funders":"","keywords":"Categorization; Feature selection; Text categorization; Computer science; Selection (genetic algorithm); Feature (linguistics); Artificial intelligence; Demonstrative; Game theory; Machine learning; Natural language processing; Information retrieval; Mathematics; Linguistics; Mathematical economics","score_opus":0.02111208103021165,"score_gpt":0.24479334971361844,"score_spread":0.2236812686834068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585793187","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.011610569,0.00025906164,0.9858591,0.00030378468,0.00006967982,0.00011658052,0.000050874332,0.00014915668,0.0015812013],"genre_scores_gemma":[0.6273198,0.0003933043,0.36576018,0.0003602533,0.00018260544,0.00048176703,0.00019685621,0.00010700274,0.005198273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683076,0.002085851,0.000121036865,0.000281519,0.00044444457,0.00023637399],"domain_scores_gemma":[0.9842248,0.0143360505,0.00027759388,0.00032536502,0.00060503086,0.00023114694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054547694,0.0010461207,0.0022636047,0.0016395639,0.00091859524,0.001972931,0.0023639875,0.0014615135,0.0031030935],"category_scores_gemma":[0.014436646,0.00065809477,0.001452445,0.0012357492,0.0011913015,0.004131464,0.0016243529,0.0020256543,0.00053347286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039064576,0.0006523414,0.0020351568,0.00033947953,0.00041334654,0.00018585187,0.00027666677,0.636544,0.0030349828,0.14129825,0.006864156,0.20796508],"study_design_scores_gemma":[0.00002041182,0.00004168712,0.00011129793,0.00000861038,0.000016894985,0.000015318352,0.000013199679,0.9413783,0.00020267324,0.05785289,0.000325861,0.000012860581],"about_ca_topic_score_codex":0.0049733114,"about_ca_topic_score_gemma":0.0068567027,"teacher_disagreement_score":0.0054547694,"about_ca_system_score_codex":0.0021490187,"about_ca_system_score_gemma":0.0015342779,"threshold_uncertainty_score":0.028847873},"labels":[],"label_agreement":null},{"id":"W1585878362","doi":"10.1007/11816171_97","title":"Analyzing Livestock Farm Odour Using a Neuro-fuzzy Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Chemical Sensor Technologies","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":"University of Guelph","funders":"","keywords":"Computer science; Livestock; Fuzzy logic; Artificial neural network; Function (biology); Artificial intelligence; Data mining; Machine learning; Geography; Forestry","score_opus":0.023712956485647658,"score_gpt":0.22583755235353714,"score_spread":0.20212459586788947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585878362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46929568,0.0007724016,0.5240818,0.000093021365,0.000054570246,0.000073475014,0.00015748752,0.00030100893,0.0051705134],"genre_scores_gemma":[0.9480892,0.000195485,0.050377104,0.000015290105,0.00001380919,0.00002556075,0.000076476914,0.000010951246,0.0011961149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999093,0.000009737417,0.000005867904,0.000020609883,0.000036043442,0.000018493038],"domain_scores_gemma":[0.9998512,0.000067367575,0.000017000246,0.0000072285366,0.000049851413,0.000007333223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021927683,0.00042764697,0.00048757053,0.00064660376,0.00039518168,0.00065594073,0.00041555002,0.0005603515,0.0005386993],"category_scores_gemma":[0.00045030826,0.0002550334,0.0005922325,0.0005160312,0.0001786155,0.00039581757,0.00022325922,0.0002461061,0.0001220081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003918879,0.0001813135,0.0100156,0.00015250841,0.00020679775,0.00027074426,0.00011056088,0.73556924,0.06179708,0.0009226152,0.00041003083,0.18997161],"study_design_scores_gemma":[0.0000033034328,0.0000306753,0.0026667996,0.00000423415,0.00002311257,0.00002338283,0.000035409328,0.9938392,0.0028661967,0.00038843538,0.00011101263,0.000008178538],"about_ca_topic_score_codex":0.013095622,"about_ca_topic_score_gemma":0.015206191,"teacher_disagreement_score":0.013095622,"about_ca_system_score_codex":0.00042372418,"about_ca_system_score_gemma":0.00035471708,"threshold_uncertainty_score":0.026038766},"labels":[],"label_agreement":null},{"id":"W1585941015","doi":"10.1007/978-3-540-27776-7_9","title":"CoDeL: Automatically Synthesizing Network Interface Controllers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and 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 Victoria","funders":"","keywords":"Computer science; Interface (matter); Routing (electronic design automation); Embedded system; Computer architecture; Interconnection; Controller (irrigation); Distributed computing; Programming language; Operating system; Computer network","score_opus":0.01329805670161898,"score_gpt":0.2348273460073907,"score_spread":0.2215292893057717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585941015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009554453,0.00017601503,0.94076896,0.00009383566,0.00016327566,0.00012756599,0.00056454306,0.04140603,0.0071453094],"genre_scores_gemma":[0.17772382,0.00019001533,0.805305,0.00027367673,0.000074853924,0.00044984545,0.0016725969,0.006275855,0.008034281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994842,0.00009339789,0.000028974762,0.00010340038,0.00023121713,0.000058718317],"domain_scores_gemma":[0.99933666,0.00036067268,0.00005140446,0.0000966266,0.00013467178,0.000020042387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042238084,0.0019540119,0.0007775097,0.0009555148,0.0005300665,0.0013107492,0.0017202375,0.0010324144,0.015543364],"category_scores_gemma":[0.0018609051,0.0011001371,0.0007949629,0.0004752829,0.00060089794,0.0010665506,0.0010063958,0.0012422233,0.0035635233],"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.00045731806,0.00019900412,0.0012436043,0.0011024335,0.00011606633,0.00037206052,0.00025300065,0.20557943,0.085058756,0.020443277,0.047250904,0.6379241],"study_design_scores_gemma":[0.00017521353,0.0001413985,0.0002421071,0.000086436165,0.000063061234,0.00012856064,0.00004532174,0.89014274,0.07159383,0.010120299,0.027229285,0.000031724212],"about_ca_topic_score_codex":0.004628892,"about_ca_topic_score_gemma":0.008834273,"teacher_disagreement_score":0.015543364,"about_ca_system_score_codex":0.0008149306,"about_ca_system_score_gemma":0.0012383206,"threshold_uncertainty_score":0.05199778},"labels":[],"label_agreement":null},{"id":"W1585951407","doi":"10.1007/978-3-642-11808-1_8","title":"Semantic Web-Based Modeling of Clinical Pathways Using the UML Activity Diagrams and OWL-S","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Dalhousie University","funders":"","keywords":"Computer science; Workflow; Unified Modeling Language; Ontology; Activity diagram; Petri net; Web Ontology Language; Semantic Web; OWL-S; Programming language; Semantics (computer science); Workflow management system; Software engineering; Web service; Information retrieval; Database; Semantic Web Stack; Software","score_opus":0.06236054260084994,"score_gpt":0.28465256009832335,"score_spread":0.2222920174974734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585951407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009043774,0.00047586378,0.9727561,0.00083190895,0.00009866621,0.00035706445,0.003094342,0.004078855,0.00926347],"genre_scores_gemma":[0.15809456,0.0014300921,0.82823896,0.0003390889,0.00005638475,0.00055918866,0.006116481,0.0006120693,0.004553253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853337,0.0005185188,0.00029984306,0.00014675484,0.00041061267,0.00009084052],"domain_scores_gemma":[0.9983014,0.0010071914,0.00016405154,0.00019396827,0.00025061602,0.00008262675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024048416,0.0006824034,0.0007552106,0.0024554061,0.0007527403,0.004577715,0.0018338672,0.0014096636,0.0045968783],"category_scores_gemma":[0.0041939453,0.00090598763,0.0024580644,0.00197532,0.00079225027,0.0031549388,0.0017878406,0.0014005002,0.0011716265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022799865,0.00028894894,0.0033561226,0.0010564674,0.00037480926,0.0015881233,0.0017267775,0.45478117,0.0052762902,0.40156215,0.010308005,0.119453065],"study_design_scores_gemma":[0.000070179885,0.000031804426,0.0006328387,0.0002877464,0.00014340048,0.00039542143,0.00018016665,0.8107934,0.0035499139,0.11911585,0.06475721,0.000042180214],"about_ca_topic_score_codex":0.019914614,"about_ca_topic_score_gemma":0.022297302,"teacher_disagreement_score":0.019914614,"about_ca_system_score_codex":0.0015821115,"about_ca_system_score_gemma":0.0032482678,"threshold_uncertainty_score":0.03959745},"labels":[],"label_agreement":null},{"id":"W1585955818","doi":"10.1007/978-3-642-13036-6_23","title":"Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Quadratic equation; Semidefinite programming; Mathematics; Combinatorics; Quadratic programming; Value (mathematics); Discrete mathematics; Mathematical optimization; Statistics; Geometry; Law; Political science","score_opus":0.02057281308764426,"score_gpt":0.271971755758368,"score_spread":0.25139894267072377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585955818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04532507,0.0013551353,0.8535431,0.0022594107,0.0007064188,0.000070816954,0.00017151807,0.00090869266,0.09565981],"genre_scores_gemma":[0.62670994,0.0016756541,0.3176761,0.0008004614,0.001069112,0.0002128714,0.0003581608,0.0010279118,0.05046978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988574,0.00025620344,0.00005038718,0.00025273196,0.00041964158,0.00016373518],"domain_scores_gemma":[0.99750453,0.0012996448,0.0001574304,0.00040188388,0.00038949095,0.00024713064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019506448,0.000989247,0.0014525993,0.0018457894,0.0014880593,0.0024529696,0.00215177,0.0011374354,0.010817372],"category_scores_gemma":[0.00851111,0.00061689835,0.0014964117,0.0026406744,0.0024910376,0.0064021344,0.0053261337,0.005952748,0.0015524515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004646444,0.000064943735,0.00018608564,0.000074168776,0.000007105364,0.000034314224,0.00018297578,0.008392898,0.0007919497,0.938315,0.0037980373,0.04810609],"study_design_scores_gemma":[0.00001072706,0.000024890143,0.00011672937,0.000024132201,0.000009879441,0.00004898046,0.000051978324,0.05578697,0.0008176492,0.93324137,0.009855145,0.000011506677],"about_ca_topic_score_codex":0.0014436996,"about_ca_topic_score_gemma":0.0015680193,"teacher_disagreement_score":0.010817372,"about_ca_system_score_codex":0.002089832,"about_ca_system_score_gemma":0.0010768238,"threshold_uncertainty_score":0.03618771},"labels":[],"label_agreement":null},{"id":"W1585992480","doi":"10.1007/978-3-642-04271-3_96","title":"A New Approach for Creating Customizable Cytoarchitectonic Probabilistic Maps without a Template","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Queen's University","funders":"National Institute of Biomedical Imaging and Bioengineering; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; National Institutes of Health","keywords":"Computer science; Probabilistic logic; Pairwise comparison; Artificial intelligence; Pattern recognition (psychology); Computer vision; Image registration; Image (mathematics)","score_opus":0.04725669324274098,"score_gpt":0.3433014189683457,"score_spread":0.2960447257256047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585992480","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.0012475667,0.000015960888,0.99518496,0.00002625254,0.000027093945,0.000023396013,0.00008272155,0.0028644418,0.0005277048],"genre_scores_gemma":[0.039735533,0.000084207044,0.9555033,0.00007401054,0.000022061973,0.0001518224,0.00034273794,0.0017221131,0.0023641929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00004911031,0.00003484588,0.00017052548,0.00027488987,0.000038383478],"domain_scores_gemma":[0.9985067,0.00038676886,0.00008004523,0.0006946288,0.00024067919,0.00009117058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076113833,0.001029516,0.0008259841,0.0011609088,0.00053798355,0.0021116955,0.0035918565,0.0011333115,0.007861577],"category_scores_gemma":[0.003368847,0.0010344298,0.0017028416,0.0015896502,0.0006275896,0.0021019862,0.0029437656,0.0017675438,0.0028140685],"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.0001861573,0.00015987485,0.001346712,0.0003018276,0.00032675566,0.00053745636,0.000525213,0.081860766,0.12123088,0.04954009,0.017469138,0.7265152],"study_design_scores_gemma":[0.000053561926,0.00008579406,0.0009957047,0.00003332641,0.00012546049,0.0013540509,0.000099351775,0.77776086,0.11356329,0.058056936,0.047750313,0.000121279896],"about_ca_topic_score_codex":0.0027066553,"about_ca_topic_score_gemma":0.004602847,"teacher_disagreement_score":0.007861577,"about_ca_system_score_codex":0.00048421795,"about_ca_system_score_gemma":0.0009795602,"threshold_uncertainty_score":0.026299596},"labels":[],"label_agreement":null},{"id":"W1586125175","doi":"10.1007/978-3-540-30125-7_50","title":"Contour Description Through Set Operations on Dynamic Reference Shapes","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","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":"Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Feature (linguistics); Set (abstract data type); Pattern recognition (psychology); Artificial intelligence; Simple (philosophy); Simplicity; Data mining","score_opus":0.04254482368783489,"score_gpt":0.2626204485023634,"score_spread":0.2200756248145285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586125175","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.004380802,0.00009834787,0.9934257,0.000029789042,0.000016296497,0.0000120722325,0.00006437637,0.00038748165,0.0015851008],"genre_scores_gemma":[0.19057335,0.00068130274,0.7977435,0.00006963876,0.000053228097,0.00008888011,0.0008902169,0.00092286774,0.00897707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995864,0.000061000304,0.00003190655,0.00008955534,0.00019749216,0.00003363742],"domain_scores_gemma":[0.9995173,0.00014391096,0.000037899237,0.00016705177,0.000112304915,0.000021487922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907045,0.0006263732,0.00082235073,0.0016144563,0.00042991075,0.0021556069,0.001596441,0.0007975146,0.005300095],"category_scores_gemma":[0.0016104225,0.0006746282,0.0010155907,0.0018962601,0.0008498029,0.003455881,0.0019337714,0.001520402,0.0015954312],"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.00012868263,0.00003884147,0.00023054161,0.00019621497,0.000033210163,0.00011015556,0.00025977433,0.15210114,0.024221456,0.39912516,0.005549907,0.41800496],"study_design_scores_gemma":[0.000009913422,0.00004270101,0.00010426165,0.000027008604,0.000014507476,0.00009966969,0.00004591848,0.85769695,0.00907489,0.12461959,0.008243082,0.000021561907],"about_ca_topic_score_codex":0.001713638,"about_ca_topic_score_gemma":0.0014586888,"teacher_disagreement_score":0.005300095,"about_ca_system_score_codex":0.00059568265,"about_ca_system_score_gemma":0.00031323667,"threshold_uncertainty_score":0.017730594},"labels":[],"label_agreement":null},{"id":"W1586127808","doi":"10.1007/11899402_3","title":"Mission-Based Navigational Behaviour Modeling for Web Recommender Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Recommender system; Web navigation; World Wide Web; Intrusiveness; Web page; Web modeling; Information retrieval","score_opus":0.036251474259247005,"score_gpt":0.27694363769310304,"score_spread":0.24069216343385602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586127808","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.034898724,0.0003095548,0.96106017,0.00020206878,0.00003876103,0.00004606768,0.00019644102,0.00051834027,0.0027298545],"genre_scores_gemma":[0.8824282,0.0004520977,0.10886785,0.00006994687,0.000062462976,0.00019757771,0.0005247958,0.00012405791,0.007272975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995053,0.00020785653,0.000026040372,0.00009543058,0.000106953856,0.000058356905],"domain_scores_gemma":[0.9990344,0.0005285286,0.00009228064,0.00009904678,0.0001905844,0.00005523893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096146984,0.00075051776,0.0010963033,0.00067462726,0.0006176708,0.0009777034,0.0018272471,0.0012802418,0.0020177884],"category_scores_gemma":[0.0031858876,0.00074394426,0.0012704429,0.00079464255,0.00042061534,0.001220192,0.00073562854,0.0012709699,0.00082122895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035174755,0.00005772157,0.00094866025,0.000032300773,0.000044431144,0.000026345655,0.00006109813,0.9757573,0.000591415,0.006713166,0.00063155993,0.015100814],"study_design_scores_gemma":[0.0000010656304,0.0000045686024,0.0000647411,0.0000013042812,0.0000031384875,0.0000047001995,0.0000024754283,0.9987531,0.00004098897,0.0010335762,0.000087844,0.0000025041015],"about_ca_topic_score_codex":0.032738186,"about_ca_topic_score_gemma":0.02437804,"teacher_disagreement_score":0.032738186,"about_ca_system_score_codex":0.0010167932,"about_ca_system_score_gemma":0.00092460186,"threshold_uncertainty_score":0.065095246},"labels":[],"label_agreement":null},{"id":"W1586168340","doi":"10.1007/978-3-540-72665-4_20","title":"Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Guelph","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Computer science; Constraint satisfaction; Breakout; Local consistency; Constraint graph; Bounded function; Constraint satisfaction dual problem; Graph; Mathematical optimization; Constraint (computer-aided design); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.017393515892519733,"score_gpt":0.23947411819081743,"score_spread":0.2220806022982977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586168340","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.009585167,0.0001736333,0.98207873,0.00018894202,0.00003530203,0.000054177734,0.000044673,0.00012091932,0.0077184155],"genre_scores_gemma":[0.31497097,0.00043747207,0.67210424,0.00016751267,0.00008720066,0.00032384947,0.00026473586,0.000114247676,0.011529801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.0004311962,0.00005362192,0.00018292207,0.0003297163,0.00007500523],"domain_scores_gemma":[0.99751854,0.0016836735,0.00019297402,0.00022612193,0.0002812574,0.00009747844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013221514,0.0008213863,0.0006972628,0.00054760795,0.0007180921,0.0015177485,0.0015941452,0.0010206437,0.004936952],"category_scores_gemma":[0.0054690256,0.0008937045,0.0007576863,0.0011144249,0.00096115016,0.0023057822,0.0021466366,0.002383222,0.00047186587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009804707,0.0000663802,0.00032936552,0.00014492546,0.0000890726,0.00020733103,0.0001906325,0.7350479,0.0034248726,0.1778105,0.003367466,0.07922357],"study_design_scores_gemma":[0.00001518918,0.000019222487,0.000049958053,0.000013961309,0.000012300948,0.00004440066,0.00002538777,0.91745526,0.0012847534,0.07823364,0.0028376963,0.000008242823],"about_ca_topic_score_codex":0.0021955308,"about_ca_topic_score_gemma":0.0034668518,"teacher_disagreement_score":0.004936952,"about_ca_system_score_codex":0.0009018677,"about_ca_system_score_gemma":0.00090947445,"threshold_uncertainty_score":0.016515791},"labels":[],"label_agreement":null},{"id":"W158626325","doi":"10.1007/978-3-642-24571-8_52","title":"Audio-Based Emotion Recognition from Natural Conversations Based on Co-Occurrence Matrix and Frequency Domain Energy Distribution Features","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Emotion recognition; Speech recognition; Frequency domain; Domain (mathematical analysis); Benchmark (surveying); Spectrogram; Set (abstract data type); Arousal; Artificial intelligence; Computer vision","score_opus":0.02269135040330552,"score_gpt":0.2741853117140611,"score_spread":0.2514939613107556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158626325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24617594,0.0019356407,0.7371706,0.00020147092,0.0003239009,0.00027869595,0.003303764,0.0030238198,0.0075862175],"genre_scores_gemma":[0.63125205,0.0015942386,0.35386357,0.000101710124,0.00035600268,0.00038569793,0.004596329,0.00027682,0.0075736255],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998062,0.00003067629,0.000008923181,0.000058327347,0.00006637329,0.000029453196],"domain_scores_gemma":[0.9996853,0.00014355445,0.000030047522,0.000021031014,0.00009280717,0.000027252361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024167087,0.00056688976,0.00046257977,0.00088732626,0.00021022136,0.0005627694,0.0003274772,0.00040967992,0.0035486491],"category_scores_gemma":[0.00084426417,0.00013826371,0.00046047597,0.00087867054,0.00016141462,0.0005047334,0.00042229006,0.00039631766,0.0025202455],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007788966,0.00012740081,0.003322278,0.00027323334,0.00006320212,0.00019225907,0.00016230835,0.0017588625,0.44337755,0.0004526382,0.0030740323,0.5464173],"study_design_scores_gemma":[0.0001330257,0.0010315316,0.2131955,0.0001575873,0.0004081883,0.0030466614,0.0010696119,0.4772121,0.2817015,0.005100169,0.016741361,0.000202716],"about_ca_topic_score_codex":0.0005876555,"about_ca_topic_score_gemma":0.0015135774,"teacher_disagreement_score":0.0035486491,"about_ca_system_score_codex":0.000114418115,"about_ca_system_score_gemma":0.00012899887,"threshold_uncertainty_score":0.0118713975},"labels":[],"label_agreement":null},{"id":"W1586267643","doi":"10.1007/11847465_4","title":"Matching 2D Image Segments with Genetic Algorithms and Approximation Spaces","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Matching (statistics); Partition (number theory); Computer science; Rough set; Image (mathematics); Pattern recognition (psychology); Algorithm; Approximation algorithm; Mathematics; Set (abstract data type); Image segmentation; Artificial intelligence; Combinatorics","score_opus":0.010003675611458783,"score_gpt":0.2180423285000516,"score_spread":0.2080386528885928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586267643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064478763,0.000118896955,0.9921934,0.00003684935,0.00002154639,0.00004535881,0.000030915744,0.00049772917,0.0006075883],"genre_scores_gemma":[0.09850102,0.00021758766,0.89922863,0.00006740802,0.000028687886,0.00015071426,0.00020010144,0.00018938955,0.0014164987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.00018428046,0.00006854177,0.00028565797,0.00040271672,0.000094969524],"domain_scores_gemma":[0.9991774,0.0003677945,0.00009048827,0.00017899754,0.00015665297,0.000028600001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492238,0.0011497763,0.0021447171,0.0035205185,0.0007132959,0.0024266255,0.002247489,0.0028096174,0.0029544227],"category_scores_gemma":[0.0037404206,0.0011324665,0.0020287808,0.0046480782,0.0012530365,0.002488715,0.0019329744,0.0013356266,0.0010438026],"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.00022731956,0.000111550675,0.00073143747,0.00013504701,0.0001209018,0.000110319,0.00023524939,0.48079818,0.013830438,0.017377239,0.0018595308,0.48446286],"study_design_scores_gemma":[0.000010146463,0.000025061774,0.0001412355,0.000011702097,0.000015420803,0.00004525011,0.000027647677,0.98551196,0.0031688942,0.010184578,0.0008438381,0.000014214225],"about_ca_topic_score_codex":0.008082219,"about_ca_topic_score_gemma":0.0051427595,"teacher_disagreement_score":0.008082219,"about_ca_system_score_codex":0.0015049687,"about_ca_system_score_gemma":0.0010241946,"threshold_uncertainty_score":0.016070306},"labels":[],"label_agreement":null},{"id":"W1586323358","doi":"10.1007/978-3-540-39899-8_27","title":"Measurement-Based Deep Venous Thrombosis Screening System","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Photoacoustic and Ultrasonic Imaging","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":"Vancouver Hospital and Health Sciences Centre; University of British Columbia","funders":"","keywords":"Imaging phantom; Computer science; Computer vision; Artificial intelligence; Venous thrombosis; Interface (matter); Kalman filter; Ultrasound; Radiology; Biomedical engineering; Thrombosis; Medicine; Surgery","score_opus":0.01980681758483871,"score_gpt":0.20875630959474734,"score_spread":0.18894949200990863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586323358","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.17052467,0.003429828,0.7741912,0.0008969086,0.00082494493,0.0007586649,0.003305273,0.031163264,0.014905149],"genre_scores_gemma":[0.8021297,0.0010932285,0.17382444,0.0014976087,0.0003352059,0.00071446714,0.0023429168,0.0002277672,0.017834624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962914,0.00005856475,0.00002338843,0.000111405265,0.00014891344,0.000028602371],"domain_scores_gemma":[0.9996494,0.000089385714,0.000022188373,0.00003413561,0.00017566004,0.000029288234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043406762,0.000577894,0.0009991889,0.0007729325,0.00038669308,0.00073384726,0.0010826307,0.0008541193,0.005096846],"category_scores_gemma":[0.0005788479,0.0003367492,0.00023193572,0.0005072107,0.00012671879,0.000432163,0.0006389347,0.0003258034,0.002208476],"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.0019075077,0.0005671333,0.017807467,0.0004240812,0.00022563298,0.00044471034,0.000120567034,0.0040941727,0.2740519,0.0012286864,0.026864547,0.67226356],"study_design_scores_gemma":[0.00086869,0.0027302396,0.08361452,0.00012218703,0.0009801432,0.0048025646,0.00014114378,0.60328674,0.2649389,0.002379049,0.035820946,0.0003149516],"about_ca_topic_score_codex":0.0015464092,"about_ca_topic_score_gemma":0.002179268,"teacher_disagreement_score":0.005096846,"about_ca_system_score_codex":0.00036354674,"about_ca_system_score_gemma":0.0004427645,"threshold_uncertainty_score":0.017050683},"labels":[],"label_agreement":null},{"id":"W1586348459","doi":"10.1007/3-540-45452-7_21","title":"Statistical Identification of Uniformly Mutated Segments within Repeats","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"String (physics); Random permutation; Combinatorics; Algorithm; Binary number; Computer science; Mathematics; Permutation (music); Set (abstract data type); Discrete mathematics; Block (permutation group theory); Arithmetic; Physics","score_opus":0.017599046285431325,"score_gpt":0.2543448751767846,"score_spread":0.2367458288913533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586348459","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.5651189,0.0007753081,0.42859474,0.00013642586,0.00006743421,0.00006135312,0.0007917859,0.0014856976,0.0029684086],"genre_scores_gemma":[0.8820889,0.0002833364,0.11185696,0.00007500103,0.0000580566,0.000069464775,0.0022525664,0.00039585138,0.0029198776],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992355,0.00016545047,0.00004447904,0.00028594804,0.00020428693,0.00006438861],"domain_scores_gemma":[0.9953701,0.0023849756,0.0007082696,0.00085678,0.00049644255,0.00018338356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081850507,0.0003154456,0.000599072,0.001726819,0.00042457023,0.0008017474,0.001128174,0.0008965643,0.0018921762],"category_scores_gemma":[0.00584797,0.00032429886,0.00040653086,0.0014206492,0.00062325556,0.0009170159,0.00066306005,0.00064912543,0.0010848877],"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.002076367,0.00023628776,0.042451523,0.00046124877,0.00018735536,0.0011787041,0.0005753262,0.06122775,0.53345996,0.035841446,0.0032528045,0.31905118],"study_design_scores_gemma":[0.000045393586,0.00026123776,0.027412355,0.000054214055,0.00014781035,0.0019918159,0.00019599065,0.7469764,0.19218609,0.026085183,0.004567642,0.000075890726],"about_ca_topic_score_codex":0.00051168667,"about_ca_topic_score_gemma":0.0011068023,"teacher_disagreement_score":0.0018921762,"about_ca_system_score_codex":0.00034537405,"about_ca_system_score_gemma":0.00035305403,"threshold_uncertainty_score":0.0063299537},"labels":[],"label_agreement":null},{"id":"W1586348830","doi":"10.1007/3-540-45813-1_44","title":"Acquisition Methods for Contextual Weak Independence","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Independence (probability theory); Computer science; Probabilistic logic; Inference; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics; Statistics","score_opus":0.043356975641859814,"score_gpt":0.3200428536234447,"score_spread":0.2766858779815849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586348830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014700232,0.00029656553,0.9950656,0.00014397073,0.000025734516,0.00001911639,0.000039181887,0.00014996366,0.0027899037],"genre_scores_gemma":[0.1857508,0.0017404275,0.789523,0.0004108006,0.00054242625,0.00046141373,0.0008226895,0.00090154086,0.019846875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982357,0.00076426903,0.000097969176,0.00035273161,0.00042901383,0.00012039342],"domain_scores_gemma":[0.9919709,0.005613547,0.0002728592,0.0012080817,0.00072813337,0.00020661001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039077215,0.0011359703,0.001546454,0.002089145,0.0010319385,0.0020385813,0.0029457705,0.0013883335,0.012880264],"category_scores_gemma":[0.017568676,0.0013190586,0.0017101209,0.0021296912,0.0023637647,0.007850621,0.0051548257,0.0049470044,0.0023031465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005521605,0.000042101572,0.00030182023,0.0001379527,0.000046421614,0.000043477598,0.00019891631,0.014562755,0.0007827244,0.8773576,0.004523978,0.10194702],"study_design_scores_gemma":[0.000013583382,0.000014262519,0.000149037,0.000027306156,0.000022994966,0.000044605353,0.000030887444,0.16404614,0.00042058813,0.8312678,0.0039493158,0.000013561427],"about_ca_topic_score_codex":0.0016016839,"about_ca_topic_score_gemma":0.0019587518,"teacher_disagreement_score":0.012880264,"about_ca_system_score_codex":0.0009966333,"about_ca_system_score_gemma":0.0009975876,"threshold_uncertainty_score":0.043088794},"labels":[],"label_agreement":null},{"id":"W1586356312","doi":"10.1007/978-3-319-12691-3_22","title":"Algorithms for Cut Problems on Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Regina; University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Running time; Time complexity; Tree (set theory); Mathematics; Constant (computer programming); Polynomial; Computer science; Discrete mathematics; Algorithm","score_opus":0.034287847710399014,"score_gpt":0.2979919124767282,"score_spread":0.2637040647663292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586356312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009382899,0.006011954,0.912936,0.0017834783,0.00065999787,0.00022964513,0.000769139,0.0019186153,0.06630833],"genre_scores_gemma":[0.07601245,0.0069154366,0.8694923,0.0007061566,0.00076732156,0.0005988572,0.0031921952,0.0013265457,0.04098878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988709,0.00019953452,0.00006832904,0.000240925,0.0004941405,0.00012604988],"domain_scores_gemma":[0.99762064,0.0015611236,0.00007476993,0.00038314468,0.00026778234,0.00009250039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085157494,0.0017830984,0.0012405342,0.0018269644,0.0010491518,0.003847327,0.0032016144,0.0018323777,0.020959398],"category_scores_gemma":[0.0060532545,0.0011154616,0.0016526405,0.0046276925,0.0013913163,0.007658681,0.002709469,0.006437096,0.005828566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010774012,0.00016032316,0.00027237216,0.0009063993,0.00006270913,0.000059015096,0.00027236308,0.019556647,0.002335816,0.5146697,0.061015904,0.400581],"study_design_scores_gemma":[0.000073118834,0.000025905538,0.00018553845,0.00014129849,0.00003976073,0.00016169052,0.00008486035,0.055625696,0.0014341593,0.8977687,0.044442076,0.000017156106],"about_ca_topic_score_codex":0.0014191241,"about_ca_topic_score_gemma":0.0021227712,"teacher_disagreement_score":0.020959398,"about_ca_system_score_codex":0.0017819742,"about_ca_system_score_gemma":0.0011462829,"threshold_uncertainty_score":0.07011622},"labels":[],"label_agreement":null},{"id":"W1586356343","doi":"10.1007/11768012_55","title":"An Adaptive Hypermedia System Using a Constraint Satisfaction Approach for Information Personalization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Personalization; Computer science; Adaptive hypermedia; Viewpoints; Adaptation (eye); Constraint satisfaction problem; Constraint (computer-aided design); Relevance (law); Information retrieval; Constraint satisfaction; Hypermedia; Information filtering system; World Wide Web; Artificial intelligence","score_opus":0.019589103544622382,"score_gpt":0.22975649540253446,"score_spread":0.21016739185791208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586356343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017269067,0.00007402241,0.96681374,0.00014843664,0.000026556281,0.00023203425,0.0002537712,0.011768112,0.0034142428],"genre_scores_gemma":[0.15746878,0.0001561484,0.83112067,0.00017742325,0.00004203828,0.00040046943,0.0010883417,0.0007191109,0.008827052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991561,0.00019129817,0.00008590916,0.00019250144,0.00032328966,0.000050928185],"domain_scores_gemma":[0.99843186,0.0007112258,0.00006960007,0.00030851917,0.0003728016,0.00010596187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893903,0.00070276315,0.00084241154,0.000851059,0.00094243954,0.0020617915,0.0024512762,0.0011213019,0.008210198],"category_scores_gemma":[0.0029831508,0.00053000916,0.00072507036,0.0013529178,0.0005073376,0.002392054,0.0019476375,0.0012353696,0.001576089],"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.001036329,0.0010372505,0.0017933091,0.0005265109,0.00028554493,0.0006645868,0.0013933745,0.057132818,0.114984445,0.022183826,0.02582398,0.773138],"study_design_scores_gemma":[0.00014925111,0.00012493026,0.00068905065,0.000025823461,0.00014716944,0.00021366964,0.0001994551,0.9238871,0.04454592,0.0087120375,0.02121965,0.00008597507],"about_ca_topic_score_codex":0.009004259,"about_ca_topic_score_gemma":0.010223833,"teacher_disagreement_score":0.009004259,"about_ca_system_score_codex":0.00054878305,"about_ca_system_score_gemma":0.0010542957,"threshold_uncertainty_score":0.02746588},"labels":[],"label_agreement":null},{"id":"W1586393325","doi":"10.1007/978-3-642-32355-3_5","title":"NOVA Workflow: A Workflow Management Tool Targeting Health Services Delivery","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Japan Society for the Promotion of Science","keywords":"Workflow; Workflow management system; Computer science; Workflow engine; Workflow technology; XPDL; Windows Workflow Foundation; Software engineering; Process management; Database; Engineering","score_opus":0.016917121716897104,"score_gpt":0.2296106786216829,"score_spread":0.2126935569047858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586393325","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009559241,0.0010063746,0.86330503,0.0010790452,0.0005311284,0.0002707252,0.0043813274,0.09660575,0.023261389],"genre_scores_gemma":[0.055662684,0.0016796296,0.867838,0.0006090698,0.00009174608,0.00035493707,0.013936821,0.008291429,0.051535662],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992465,0.00012023773,0.00011214296,0.00012008532,0.00035133088,0.00004985049],"domain_scores_gemma":[0.99880254,0.0005905455,0.00009318407,0.00018922873,0.00020850047,0.00011598802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021264732,0.0011432834,0.0006183302,0.0020521434,0.00068760145,0.0021718815,0.0018370819,0.0010793647,0.00993141],"category_scores_gemma":[0.003825294,0.0009750178,0.0011601279,0.0012508545,0.00044353504,0.0024798668,0.0019589616,0.0013305437,0.004198],"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.00035954404,0.0002975757,0.0021328889,0.0011281244,0.00012302921,0.00054150616,0.0008864842,0.014219287,0.016573293,0.044067565,0.17683473,0.74283594],"study_design_scores_gemma":[0.00020719919,0.00019021792,0.003343576,0.000667965,0.00019630887,0.0022140064,0.00023739946,0.21732143,0.03212226,0.05596013,0.6872249,0.0003146478],"about_ca_topic_score_codex":0.0041017462,"about_ca_topic_score_gemma":0.005377412,"teacher_disagreement_score":0.00993141,"about_ca_system_score_codex":0.0007963041,"about_ca_system_score_gemma":0.0019929241,"threshold_uncertainty_score":0.033223867},"labels":[],"label_agreement":null},{"id":"W1586407478","doi":"10.1007/3-540-44816-0_24","title":"Self-Supervised Chinese Word Segmentation","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":57,"is_retracted":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":"Natural language processing; Artificial intelligence; Computer science; Word (group theory); Text segmentation; Segmentation; Linguistics; Philosophy","score_opus":0.012281914268320614,"score_gpt":0.23242988318296978,"score_spread":0.22014796891464916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586407478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13225597,0.0037968946,0.80496293,0.00060642674,0.0011013964,0.000508241,0.00445264,0.02768412,0.02463151],"genre_scores_gemma":[0.4598994,0.0010751992,0.46980828,0.00043448352,0.00060519244,0.00039340794,0.020576496,0.002583153,0.044624414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903667,0.00014794373,0.00008302144,0.00046313283,0.00014553856,0.00012369911],"domain_scores_gemma":[0.9987148,0.0003944952,0.00006509106,0.00024157776,0.0005088053,0.00007521214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007945267,0.0014483581,0.0013502943,0.0025268195,0.0010180052,0.0014165599,0.0012959829,0.0010863929,0.011087359],"category_scores_gemma":[0.0018022414,0.0004963162,0.0010554439,0.002737464,0.00068122114,0.0020303098,0.0012921034,0.00095208245,0.009870516],"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.00040081854,0.00011868293,0.0015161439,0.00031459262,0.00009252851,0.00020144835,0.00017482333,0.006502296,0.044639792,0.0027022015,0.023037482,0.92029905],"study_design_scores_gemma":[0.00009335087,0.0003180761,0.007968628,0.00008823175,0.00027731212,0.00085821527,0.00046546658,0.81891364,0.11905281,0.013185227,0.038687397,0.00009166516],"about_ca_topic_score_codex":0.004779294,"about_ca_topic_score_gemma":0.008878561,"teacher_disagreement_score":0.011087359,"about_ca_system_score_codex":0.0005312663,"about_ca_system_score_gemma":0.001604646,"threshold_uncertainty_score":0.037090898},"labels":[],"label_agreement":null},{"id":"W1586468330","doi":"10.1007/11424918_45","title":"Producing Headline Summaries for Newspaper Articles","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Lethbridge","funders":"","keywords":"Headline; Newspaper; Computer science; Natural language processing; Compression (physics); Artificial intelligence; Information retrieval; Linguistics; Advertising","score_opus":0.018022642072488673,"score_gpt":0.2686828907352826,"score_spread":0.25066024866279396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586468330","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036192764,0.00957139,0.2461937,0.0075009116,0.015015875,0.004861868,0.23815566,0.17436872,0.26813912],"genre_scores_gemma":[0.06844776,0.008801331,0.42704666,0.0009819645,0.0077188527,0.0017173565,0.21458267,0.030356348,0.24034712],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863726,0.00035835252,0.00021702496,0.00018161235,0.0005366362,0.000069052025],"domain_scores_gemma":[0.98025274,0.0071228305,0.001775571,0.0015399867,0.008551465,0.0007573551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019000127,0.0021347092,0.0011119838,0.00994294,0.0012949173,0.003956589,0.0010176159,0.0010255342,0.15810688],"category_scores_gemma":[0.014908941,0.0011952599,0.000813465,0.008333504,0.00023659127,0.0027729175,0.0013677243,0.00093510293,0.16146842],"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.0002481774,0.000068872425,0.00060459,0.0011607612,0.000049614664,0.00025445232,0.00044264842,0.00040181476,0.006177389,0.00080780115,0.7239147,0.26586926],"study_design_scores_gemma":[0.00013830086,0.00032390287,0.0028358814,0.00033492217,0.00025063145,0.0004012121,0.0011401328,0.0029360037,0.01603981,0.0019762283,0.97354263,0.00008021831],"about_ca_topic_score_codex":0.0015336425,"about_ca_topic_score_gemma":0.0037413978,"teacher_disagreement_score":0.15810688,"about_ca_system_score_codex":0.00061164773,"about_ca_system_score_gemma":0.0010888708,"threshold_uncertainty_score":0.5289202},"labels":[],"label_agreement":null},{"id":"W1586507268","doi":"10.1007/978-3-642-12450-1_10","title":"Parameterized Analysis of Paging and List Update Algorithms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Parameterized complexity; Locality; Cache; Locality of reference; Algorithm; Online algorithm; Set (abstract data type); Cache algorithms; Working set; Memory hierarchy; CPU cache; Theoretical computer science; Parallel computing","score_opus":0.017475784857701803,"score_gpt":0.2632109931213892,"score_spread":0.2457352082636874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586507268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054928366,0.0028416193,0.90383947,0.0024381063,0.00026182603,0.00025181295,0.0010618852,0.0023357898,0.03204125],"genre_scores_gemma":[0.7057191,0.002919869,0.24997286,0.00074071577,0.0012272286,0.0008025451,0.0029372121,0.002825219,0.032855168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930862,0.0023471133,0.00029829697,0.00084394444,0.0021518057,0.0012726942],"domain_scores_gemma":[0.96496624,0.023877822,0.0018739933,0.005883382,0.0024258655,0.00097278436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005112497,0.0021815856,0.002685541,0.0027093429,0.0018935429,0.0076258094,0.007190526,0.0028488445,0.022014517],"category_scores_gemma":[0.04667685,0.0018316192,0.0024480566,0.0058274274,0.0026443917,0.013979813,0.003592102,0.005427893,0.0028455441],"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.0006404231,0.00034403012,0.0021467935,0.00038034137,0.0001471996,0.00011886801,0.0003294152,0.34889975,0.0029928407,0.5374619,0.02242359,0.08411489],"study_design_scores_gemma":[0.00004333493,0.000038874754,0.00044338993,0.00003526359,0.000061283754,0.00006409015,0.000044038563,0.75207126,0.00094671466,0.24344876,0.0027773755,0.000025575584],"about_ca_topic_score_codex":0.004756529,"about_ca_topic_score_gemma":0.0041046883,"teacher_disagreement_score":0.022014517,"about_ca_system_score_codex":0.0068757175,"about_ca_system_score_gemma":0.0049037975,"threshold_uncertainty_score":0.07364595},"labels":[],"label_agreement":null},{"id":"W1586523483","doi":"10.1007/11533719_67","title":"On Approximate Balanced Bi-clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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":"McMaster University","funders":"","keywords":"Cluster analysis; Computer science; Heuristic; Bounded function; Mathematical optimization; Cluster (spacecraft); Set (abstract data type); Quadratic programming; Quadratic equation; Constrained clustering; Heuristics; Algorithm; Correlation clustering; Theoretical computer science; Mathematics; CURE data clustering algorithm; Artificial intelligence","score_opus":0.021576937168322402,"score_gpt":0.28273569928771697,"score_spread":0.2611587621193946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586523483","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.006847898,0.0027552655,0.975459,0.00073412625,0.00036147799,0.000116327916,0.00049857993,0.0008303783,0.0123969205],"genre_scores_gemma":[0.11567022,0.0031359387,0.8499073,0.0007492708,0.00055403623,0.00047049107,0.0027887241,0.0009422178,0.025781743],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748373,0.0008483875,0.00012298193,0.00035425313,0.0009912925,0.00019924658],"domain_scores_gemma":[0.9957802,0.001511471,0.00016555937,0.0015007085,0.0008766672,0.00016536495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028164606,0.0018653371,0.0029124927,0.0023743596,0.0019655423,0.0024854324,0.004219633,0.0020248909,0.012657778],"category_scores_gemma":[0.012119804,0.00096735405,0.0010803337,0.0081394045,0.0012548412,0.0066671884,0.0049754777,0.0030108641,0.005000431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058925786,0.00016916775,0.00080202246,0.0005185973,0.00013342983,0.00008272853,0.0002542191,0.15501676,0.0038014809,0.2808426,0.054229546,0.5035602],"study_design_scores_gemma":[0.000044816104,0.00008162953,0.00044483689,0.00007464697,0.000050356484,0.00024212596,0.0001351834,0.55049527,0.002101779,0.41646355,0.029829765,0.000036047273],"about_ca_topic_score_codex":0.0041500176,"about_ca_topic_score_gemma":0.0064614015,"teacher_disagreement_score":0.012657778,"about_ca_system_score_codex":0.002396927,"about_ca_system_score_gemma":0.001537458,"threshold_uncertainty_score":0.04234451},"labels":[],"label_agreement":null},{"id":"W1586644070","doi":"10.1007/bfb0038676","title":"Loop storage optimization for dataflow machines","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Dataflow; Dataflow architecture; Computer science; Parallel computing; Computation; Exploit; FIFO (computing and electronics); Graph; Loop (graph theory); FIFO and LIFO accounting; Data flow diagram; Queue; Model of computation; Overhead (engineering); Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.015998272213382656,"score_gpt":0.256564949369787,"score_spread":0.24056667715640437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586644070","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.04416691,0.001053919,0.9420222,0.00041593538,0.00011211438,0.000053051335,0.00019308347,0.0017346666,0.010248231],"genre_scores_gemma":[0.73254,0.0005957305,0.25118425,0.00010388183,0.00011413584,0.00016967116,0.00042032558,0.000811811,0.0140602365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974877,0.000046467358,0.000013433824,0.00003639218,0.000094466806,0.00006033929],"domain_scores_gemma":[0.99944407,0.00029427838,0.00003605311,0.000098362805,0.000101296144,0.000025862051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054550305,0.0005601526,0.0008187349,0.0004714713,0.0005251802,0.0008013914,0.0012255885,0.00042396176,0.006108779],"category_scores_gemma":[0.0018655085,0.0003392654,0.00043522363,0.0010013707,0.00047026397,0.0016536533,0.0008180189,0.00063510804,0.00038563157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003842226,0.00010231372,0.00033471338,0.00020649933,0.000029535111,0.000033533863,0.000074107236,0.70941395,0.010408508,0.05770556,0.00828249,0.21302454],"study_design_scores_gemma":[0.000015743552,0.000026701116,0.0000821626,0.0000067515894,0.0000053180747,0.000009767528,0.000008231864,0.96104014,0.0040710787,0.03348072,0.001247944,0.0000054355773],"about_ca_topic_score_codex":0.0024989103,"about_ca_topic_score_gemma":0.0032178082,"teacher_disagreement_score":0.006108779,"about_ca_system_score_codex":0.0010200891,"about_ca_system_score_gemma":0.0010873703,"threshold_uncertainty_score":0.02043593},"labels":[],"label_agreement":null},{"id":"W1586645253","doi":"10.1007/978-3-540-89740-8_15","title":"P-OPT: Program-Directed Optimal Cache Management","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"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":"Computer science; Cache; Parallel computing; Operating system","score_opus":0.017494910414269694,"score_gpt":0.25765740619138233,"score_spread":0.24016249577711263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586645253","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.008116753,0.0006504804,0.96219486,0.00036169327,0.00029884608,0.00007989032,0.0003860369,0.0114070745,0.016504353],"genre_scores_gemma":[0.21682939,0.0007018558,0.7587204,0.00051142677,0.00013843062,0.00027089342,0.0010282184,0.002075508,0.01972378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.00005092516,0.00001264317,0.000050697894,0.00010884235,0.000048352744],"domain_scores_gemma":[0.9997019,0.0000975663,0.000023859084,0.000083931525,0.00006602711,0.000026735182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039350544,0.0007924745,0.0006611115,0.00047465265,0.00049509096,0.0008609216,0.0017264738,0.0007368511,0.0073269494],"category_scores_gemma":[0.0011232798,0.0003591433,0.00045536476,0.00086021883,0.0004967523,0.000897651,0.001052563,0.0013273079,0.0016667219],"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.00051758485,0.00021320964,0.0004349265,0.00035994386,0.00006402661,0.0000937436,0.000055441706,0.28012842,0.014345388,0.0674662,0.09829082,0.53803027],"study_design_scores_gemma":[0.00006705423,0.00005911745,0.000089190566,0.000020481613,0.00001912898,0.00008000849,0.0000142685985,0.9288755,0.008460801,0.047714934,0.0145856785,0.000013725445],"about_ca_topic_score_codex":0.0019296802,"about_ca_topic_score_gemma":0.003864496,"teacher_disagreement_score":0.0073269494,"about_ca_system_score_codex":0.00049515493,"about_ca_system_score_gemma":0.0012138422,"threshold_uncertainty_score":0.024511099},"labels":[],"label_agreement":null},{"id":"W1586783524","doi":"10.1007/978-3-540-30500-2_10","title":"Viral Gene Compression: Complexity and Verification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Saskatchewan; Western University","funders":"University of Saskatchewan","keywords":"Genome; Computer science; Metric (unit); Set (abstract data type); Gene; Computational biology; Compression (physics); Point (geometry); Theoretical computer science; Biology; Genetics; Programming language; Mathematics; Physics","score_opus":0.027882458544481046,"score_gpt":0.2581603538261157,"score_spread":0.23027789528163464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586783524","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.079210944,0.0029341737,0.84951174,0.0025588658,0.00040065008,0.00019852523,0.0005560672,0.0011381503,0.06349085],"genre_scores_gemma":[0.76205677,0.0024157339,0.20817593,0.00045479205,0.00056094024,0.00028093526,0.0010615771,0.0004499791,0.024543388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981654,0.00026941288,0.00008010056,0.00023217112,0.0010931846,0.0001598066],"domain_scores_gemma":[0.9924149,0.0050590103,0.0004034949,0.0013445586,0.0006892206,0.00008878641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012235047,0.00052216207,0.0010386821,0.0009566479,0.00091369956,0.002892341,0.0017082763,0.0015697739,0.0067309802],"category_scores_gemma":[0.010237155,0.000565671,0.00089780934,0.0011407151,0.0027468787,0.005066068,0.0019047057,0.0022780772,0.0014364867],"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.00016915912,0.00004870426,0.0007102087,0.00016471489,0.00001750887,0.0001736295,0.00015166521,0.037560385,0.0071990564,0.83647984,0.0071906676,0.11013453],"study_design_scores_gemma":[0.000022817278,0.000043335687,0.00032819016,0.000042965494,0.000012467235,0.00041401634,0.00005580015,0.23464696,0.01571641,0.74146736,0.0072190855,0.000030641637],"about_ca_topic_score_codex":0.00084270816,"about_ca_topic_score_gemma":0.00063016836,"teacher_disagreement_score":0.0067309802,"about_ca_system_score_codex":0.0014452691,"about_ca_system_score_gemma":0.0012405544,"threshold_uncertainty_score":0.022517323},"labels":[],"label_agreement":null},{"id":"W1586864325","doi":"10.1007/978-3-540-24663-3_5","title":"Modeling and Simulation of Mesh Networks with Path Protection and Restoration","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"University of Ottawa","funders":"","keywords":"Computer science; Path (computing); Unified Modeling Language; Path protection; Notation; Class diagram; Distributed computing; Routing (electronic design automation); Mesh networking; Computer network; Programming language; Telecommunications","score_opus":0.01213868143170906,"score_gpt":0.21263596679079463,"score_spread":0.20049728535908556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586864325","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.48788738,0.0012648287,0.45664465,0.0014641407,0.00035242105,0.00024384761,0.0017103425,0.0020698893,0.048362546],"genre_scores_gemma":[0.95061326,0.0005287664,0.0390619,0.00009128453,0.000050157367,0.00017574774,0.0004942818,0.000159073,0.008825483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977475,0.00006930455,0.000011573142,0.00003446217,0.000060968523,0.000048932157],"domain_scores_gemma":[0.9992988,0.00044215508,0.00006146105,0.000056507073,0.00009907262,0.00004190912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004002725,0.0006715773,0.00086150505,0.00063695747,0.00057313516,0.0009600249,0.0019306284,0.0016349979,0.0038324909],"category_scores_gemma":[0.0017353708,0.0006406228,0.00082026847,0.00078799366,0.00066054787,0.0011366161,0.0005498496,0.00063824694,0.00040066207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111884665,0.0000100969355,0.000106942025,0.0000064113588,0.000003774914,0.000010332051,0.000006399025,0.99783957,0.00020269776,0.0010329863,0.00011064674,0.00065893494],"study_design_scores_gemma":[0.0000030454764,0.0000046319524,0.00002834291,0.0000010781188,0.0000017043038,0.0000031646089,0.000002883534,0.99924374,0.00011373703,0.0004753437,0.00012090029,0.0000014514178],"about_ca_topic_score_codex":0.02005894,"about_ca_topic_score_gemma":0.010251509,"teacher_disagreement_score":0.02005894,"about_ca_system_score_codex":0.0013788063,"about_ca_system_score_gemma":0.0009923719,"threshold_uncertainty_score":0.03988433},"labels":[],"label_agreement":null},{"id":"W1586903287","doi":"10.1007/978-3-642-12127-2_27","title":"A Multi-Classifier System for Off-Line Signature Verification Based on Dissimilarity Representation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Pattern recognition (psychology); Signature (topology); Representation (politics); Data mining; Machine learning; Mathematics","score_opus":0.037513046173295254,"score_gpt":0.2953351542035944,"score_spread":0.25782210803029915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586903287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032432,0.00047065064,0.95557696,0.00009799669,0.00025296284,0.00021656857,0.00025530622,0.00868372,0.0020137995],"genre_scores_gemma":[0.24938819,0.00032811693,0.7384731,0.00022681756,0.00016201126,0.00024191715,0.0010208105,0.00032874368,0.009830197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902534,0.00008756804,0.000074242584,0.0002474491,0.00046254895,0.000102947226],"domain_scores_gemma":[0.9991129,0.00013580328,0.00007112614,0.00018556796,0.00042479442,0.00006974252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081867434,0.00066556403,0.001745517,0.001570084,0.00081446365,0.0011639429,0.0017784609,0.0012241673,0.005610821],"category_scores_gemma":[0.0011702903,0.00041854865,0.0005124982,0.0010481222,0.00020394007,0.0014632808,0.0012162587,0.000843213,0.0044653625],"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.0006475948,0.0002482095,0.0011742754,0.00009514401,0.000070833536,0.00013013641,0.000047202455,0.00245956,0.2130259,0.0011458389,0.0049889833,0.77596635],"study_design_scores_gemma":[0.00015037626,0.00084761035,0.0075682406,0.00003825954,0.00021730788,0.0018275117,0.00007600898,0.65008855,0.3151892,0.0022521769,0.02160623,0.00013852268],"about_ca_topic_score_codex":0.0016525199,"about_ca_topic_score_gemma":0.0024683727,"teacher_disagreement_score":0.005610821,"about_ca_system_score_codex":0.00044443397,"about_ca_system_score_gemma":0.00082406186,"threshold_uncertainty_score":0.018770099},"labels":[],"label_agreement":null},{"id":"W1586918438","doi":"10.1007/978-3-642-17274-8_40","title":"A Workflow Based Process Visual Analyzer (ProVisZer) for Teaching and Learning","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Workflow; Visualization; Curriculum; Process (computing); Multimedia; Comprehension; Human–computer interaction; Artificial intelligence; Programming language; Pedagogy","score_opus":0.009036931582839008,"score_gpt":0.2818331685919557,"score_spread":0.27279623700911665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586918438","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044040424,0.00007644339,0.859065,0.00012573204,0.00004466164,0.00034259193,0.0010858899,0.13127637,0.0035792335],"genre_scores_gemma":[0.07243887,0.00022617297,0.9037404,0.00021678318,0.000031010157,0.0005338369,0.0028863298,0.011449619,0.0084770145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879587,0.00027862054,0.00010707157,0.00028321685,0.0004499978,0.00008525782],"domain_scores_gemma":[0.99625057,0.0022747351,0.00018376173,0.00054009596,0.0005084427,0.00024249194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029595697,0.0014068607,0.0006732711,0.0017612996,0.00044668207,0.0029834784,0.0015430731,0.00074987864,0.014741268],"category_scores_gemma":[0.0051628994,0.0008222798,0.00077193003,0.0010568344,0.000452954,0.0028054174,0.0014617508,0.0018789958,0.0042667184],"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.0018233836,0.0005288588,0.0030929868,0.00088026124,0.0000888477,0.0003392947,0.0013078589,0.008309468,0.07126882,0.026235748,0.04263765,0.84348685],"study_design_scores_gemma":[0.0006251186,0.000584558,0.0042820117,0.00048293857,0.00022409778,0.00091027754,0.00056450366,0.4623237,0.2928178,0.05119964,0.18575008,0.0002352766],"about_ca_topic_score_codex":0.0024137385,"about_ca_topic_score_gemma":0.0020607186,"teacher_disagreement_score":0.014741268,"about_ca_system_score_codex":0.0008655244,"about_ca_system_score_gemma":0.002537677,"threshold_uncertainty_score":0.04931444},"labels":[],"label_agreement":null},{"id":"W1586942805","doi":"10.1007/978-3-540-72665-4_45","title":"Planning in Multiagent Expedition with Collaborative Design Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Guelph","funders":"","keywords":"Computer science; Representation (politics); Multi-agent system; Class (philosophy); Artificial intelligence; Greedy algorithm; Distributed computing; Theoretical computer science; Human–computer interaction; Algorithm","score_opus":0.02785952644953354,"score_gpt":0.26357435191088735,"score_spread":0.2357148254613538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586942805","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.011093461,0.0002731471,0.9761838,0.00016525156,0.000030882613,0.00005717628,0.000022776798,0.00013802547,0.012035455],"genre_scores_gemma":[0.48353598,0.0006441215,0.4961666,0.00008936314,0.000049789138,0.0003930032,0.000121388584,0.000104793806,0.01889492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916506,0.00042692243,0.00003509018,0.00016192839,0.00014156522,0.000069367125],"domain_scores_gemma":[0.99878997,0.0008556367,0.00008013272,0.0001376865,0.00007296362,0.00006360159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013119471,0.0007220711,0.0008411334,0.00059953274,0.0009740772,0.0014771369,0.001628431,0.0014061012,0.0047719446],"category_scores_gemma":[0.0030830076,0.0008101341,0.00081964966,0.0009953092,0.0014214937,0.002064522,0.0021704321,0.0012484851,0.00043523975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066264736,0.000046914454,0.0002213088,0.0000800042,0.000025761261,0.00011083052,0.00015072101,0.8770085,0.00066954637,0.08484648,0.000883663,0.03588998],"study_design_scores_gemma":[0.000014864615,0.00002954141,0.000057357982,0.000016010674,0.000010770834,0.00003262274,0.000044269415,0.93352646,0.00057658146,0.062808804,0.0028754799,0.00000723735],"about_ca_topic_score_codex":0.004234721,"about_ca_topic_score_gemma":0.004429221,"teacher_disagreement_score":0.0047719446,"about_ca_system_score_codex":0.0010896584,"about_ca_system_score_gemma":0.00095822883,"threshold_uncertainty_score":0.015963733},"labels":[],"label_agreement":null},{"id":"W1586963669","doi":"10.1007/978-3-540-76725-1_28","title":"Smooth Image Surface Approximation by Piecewise Cubic Polynomials","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"","keywords":"Piecewise; Subdivision surface; Triangulation; Surface (topology); Computer science; Computer graphics; Algorithm; Data point; Image (mathematics); Artificial intelligence; Mathematics; Geometry; Computer graphics (images); Mathematical analysis; Polygon mesh","score_opus":0.010880713112987791,"score_gpt":0.2483717229047413,"score_spread":0.2374910097917535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586963669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017880326,0.0007411213,0.9665258,0.00010839842,0.00009321457,0.000018192371,0.00005936878,0.00064487016,0.013928744],"genre_scores_gemma":[0.4386678,0.0030970331,0.52378255,0.00008577748,0.00014164302,0.000044567536,0.00031553287,0.00083946047,0.033025637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998672,0.000016180229,0.0000038083783,0.000017241777,0.00007922742,0.00001632797],"domain_scores_gemma":[0.9998555,0.0000508789,0.000010083389,0.000033814038,0.000037610644,0.00001195075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015893811,0.00054300675,0.0006188662,0.00071322994,0.0001782317,0.0011474092,0.0005794396,0.00045113664,0.0035517025],"category_scores_gemma":[0.0008890328,0.0003417113,0.000484652,0.0008870744,0.000505805,0.00085044943,0.0008208198,0.001507249,0.0012997165],"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.00018972959,0.00005101406,0.0003831711,0.00033173792,0.000041554707,0.00017919682,0.00020334845,0.22474658,0.05806795,0.29186663,0.010685188,0.4132538],"study_design_scores_gemma":[0.00000993303,0.000032563126,0.0001579078,0.000020884669,0.00001237181,0.00022054768,0.000031627733,0.93102294,0.00743811,0.046412494,0.014626289,0.0000142814815],"about_ca_topic_score_codex":0.0014897911,"about_ca_topic_score_gemma":0.0010581082,"teacher_disagreement_score":0.0035517025,"about_ca_system_score_codex":0.000475036,"about_ca_system_score_gemma":0.0002498847,"threshold_uncertainty_score":0.01188159},"labels":[],"label_agreement":null},{"id":"W1587016308","doi":"10.1007/978-3-540-32258-0_13","title":"Dialogization and Implicit Information in an Agent Communicational Model","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Computer science; Conversation; Negotiation; Literal (mathematical logic); Process (computing); Set (abstract data type); Agent-based social simulation; Multi-agent system; Artificial intelligence; Human–computer interaction; Theoretical computer science; Algorithm; Programming language; Communication; Sociology","score_opus":0.02937598770213662,"score_gpt":0.26267419463931485,"score_spread":0.23329820693717823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587016308","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.026732402,0.00045283395,0.9003855,0.0027220156,0.00016028006,0.00009568459,0.0002366081,0.00031820187,0.06889653],"genre_scores_gemma":[0.7881439,0.0005237871,0.17554836,0.0003283234,0.00020790104,0.0004619596,0.00029591558,0.00016274405,0.034327123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978934,0.0011735421,0.00013009495,0.00024684623,0.00041396133,0.00014207452],"domain_scores_gemma":[0.9960509,0.00277794,0.00017845615,0.0005598449,0.00028985582,0.00014300284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002170464,0.0007575268,0.00076415285,0.000829356,0.0018138386,0.004364354,0.0020355452,0.002763837,0.008399912],"category_scores_gemma":[0.00781047,0.00095273304,0.0009966025,0.0011473414,0.002764275,0.0107154315,0.0028470478,0.003465345,0.001189464],"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.000038420883,0.000019404246,0.000065706976,0.000036485744,0.000009013396,0.00004982869,0.00053133594,0.012934147,0.00036952546,0.9799897,0.0005385955,0.0054177637],"study_design_scores_gemma":[0.000036148544,0.000036943617,0.00006909622,0.000028898929,0.000029238881,0.000062467545,0.00011746996,0.1848932,0.00073602126,0.8088622,0.005099459,0.0000288148],"about_ca_topic_score_codex":0.0022613334,"about_ca_topic_score_gemma":0.0018868615,"teacher_disagreement_score":0.008399912,"about_ca_system_score_codex":0.0015186173,"about_ca_system_score_gemma":0.0013529583,"threshold_uncertainty_score":0.02810049},"labels":[],"label_agreement":null},{"id":"W1587029679","doi":"10.1007/978-3-540-45209-6_14","title":"Why Not Use a Pattern-Based Parallel Programming System?","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; Parallel computing; Usability; Set (abstract data type); Parallelism (grammar); Shared memory; Programming paradigm; Concurrent computing; Code (set theory); Programming language; Distributed computing; Operating system","score_opus":0.025577959751837097,"score_gpt":0.2375461967641925,"score_spread":0.2119682370123554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587029679","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.10392502,0.001833569,0.6691817,0.09929394,0.003674386,0.00033473765,0.000409122,0.013403904,0.10794367],"genre_scores_gemma":[0.36546344,0.0013518399,0.5494321,0.021672782,0.00076013006,0.00046180698,0.00052158243,0.0042251,0.056111302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954982,0.00095923507,0.00032949686,0.0006349381,0.002149914,0.00042819203],"domain_scores_gemma":[0.98601913,0.003987853,0.00077383954,0.0045711976,0.003684192,0.0009638951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042818584,0.00041439157,0.0005637452,0.00049950293,0.0011156906,0.0028451898,0.002398711,0.0019451864,0.007586472],"category_scores_gemma":[0.026821576,0.00065889774,0.0005354153,0.001116109,0.0013237718,0.009060413,0.0019723359,0.0033794523,0.009099842],"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.00049444137,0.00055649166,0.015458719,0.00070828927,0.00019056648,0.0007024025,0.0015147967,0.0034930217,0.013607785,0.08633296,0.1556044,0.7213361],"study_design_scores_gemma":[0.00036174303,0.0005913665,0.008426285,0.00045771713,0.00022470605,0.00543552,0.0026911227,0.043859515,0.030478863,0.40990254,0.49743024,0.00014040213],"about_ca_topic_score_codex":0.0015078124,"about_ca_topic_score_gemma":0.0017287708,"teacher_disagreement_score":0.007586472,"about_ca_system_score_codex":0.0005410438,"about_ca_system_score_gemma":0.0018127193,"threshold_uncertainty_score":0.0253793},"labels":[],"label_agreement":null},{"id":"W1587070143","doi":"10.1007/978-3-642-04388-8_22","title":"Towards Effective Elicitation of NIN-AND Tree Causal Models","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Bayesian network; Tree (set theory); Causal model; Theoretical computer science; Artificial intelligence; Node (physics); Bayes' theorem; Machine learning; Algorithm; Mathematics; Bayesian probability; Statistics","score_opus":0.020713915979552674,"score_gpt":0.2586935516609931,"score_spread":0.23797963568144043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587070143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003422294,0.00008500337,0.99358374,0.00036225014,0.000014798359,0.00011456511,0.00028297488,0.00043784978,0.0016964971],"genre_scores_gemma":[0.067171775,0.00023821018,0.92858773,0.00027247402,0.00002744135,0.0003930749,0.0012475335,0.00016692195,0.001894894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822636,0.01077235,0.001227659,0.001560218,0.0037636792,0.00041257218],"domain_scores_gemma":[0.9132019,0.07047742,0.0024196585,0.00783234,0.005421083,0.000647562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011705476,0.0012498838,0.0015855989,0.0014977284,0.0010597117,0.0035174917,0.0024174603,0.0026218886,0.0075521967],"category_scores_gemma":[0.0731991,0.0015360869,0.002071632,0.0018774923,0.0014480292,0.0077789975,0.008432256,0.0042724395,0.0020773099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005079434,0.00032306896,0.0023426407,0.0018779923,0.0002642866,0.00043021445,0.0047831866,0.06901444,0.016891023,0.47818074,0.012233833,0.41315058],"study_design_scores_gemma":[0.000080882026,0.00006142597,0.0004415741,0.00024171842,0.00008396456,0.0001986593,0.00082566723,0.44470364,0.009308745,0.52693075,0.017073875,0.000049128546],"about_ca_topic_score_codex":0.0026222167,"about_ca_topic_score_gemma":0.007279092,"teacher_disagreement_score":0.011705476,"about_ca_system_score_codex":0.0018758167,"about_ca_system_score_gemma":0.0039266227,"threshold_uncertainty_score":0.061905205},"labels":[],"label_agreement":null},{"id":"W1587070286","doi":"10.1007/11510888_5","title":"MML-Based Approach for Finite Dirichlet Mixture Estimation and Selection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Minimum description length; Automatic summarization; Computer science; Dirichlet distribution; Artificial intelligence; Selection (genetic algorithm); Model selection; Unsupervised learning; Pattern recognition (psychology); Bayesian probability; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.0185513968506605,"score_gpt":0.2607570820387777,"score_spread":0.24220568518811716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587070286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001653424,0.000099961835,0.9990896,0.000038339993,0.000024706802,0.000012307628,0.000029100764,0.00023074218,0.00030989642],"genre_scores_gemma":[0.01517425,0.00031790958,0.97833407,0.00021293934,0.00018838825,0.0003475521,0.0005533322,0.0005051267,0.004366466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955166,0.0025440988,0.00024796734,0.00046911606,0.0010645823,0.00015760244],"domain_scores_gemma":[0.9917903,0.005957407,0.00017067719,0.0008315679,0.001102626,0.000147342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895261,0.0015087223,0.002723516,0.0021962423,0.0011709271,0.0027863428,0.0053112456,0.0030150872,0.013433588],"category_scores_gemma":[0.01889276,0.0017155412,0.002442866,0.0032405313,0.0012136087,0.0030856042,0.0040532923,0.004484666,0.008925811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027551723,0.00017418964,0.0007189796,0.00044118904,0.0003485225,0.00024766196,0.00032834322,0.21751282,0.005458473,0.19900896,0.017547943,0.55793744],"study_design_scores_gemma":[0.000018958219,0.00001521528,0.000086682114,0.000020420168,0.00003153726,0.00008342365,0.000014772056,0.9352305,0.0013601974,0.056958295,0.0061534448,0.000026508958],"about_ca_topic_score_codex":0.0047980035,"about_ca_topic_score_gemma":0.007281608,"teacher_disagreement_score":0.013433588,"about_ca_system_score_codex":0.0013770051,"about_ca_system_score_gemma":0.0016785319,"threshold_uncertainty_score":0.044939816},"labels":[],"label_agreement":null},{"id":"W1587116172","doi":"10.1007/978-3-642-13059-5_32","title":"Automatic Text Segmentation for Movie Subtitles","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Text segmentation; Natural language processing; Information retrieval; Order (exchange); Image segmentation; Computer vision; Computer graphics (images)","score_opus":0.01334097530898132,"score_gpt":0.2748172718560952,"score_spread":0.2614762965471139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587116172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18010128,0.011733111,0.590209,0.0011625416,0.001797243,0.0017835883,0.06491974,0.10624768,0.042045787],"genre_scores_gemma":[0.20871416,0.0023844375,0.6434066,0.00029023582,0.00068954343,0.00073201273,0.10077464,0.0046653864,0.038342983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996253,0.000028067829,0.000032306027,0.00015227935,0.000088299086,0.00007376273],"domain_scores_gemma":[0.9990362,0.00026874398,0.000085670756,0.000085845124,0.00043482642,0.000088820176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028212255,0.0018181284,0.0012280863,0.0052292314,0.0012113831,0.001451728,0.0010358632,0.0009718362,0.019568209],"category_scores_gemma":[0.0011357507,0.000546383,0.0011412764,0.0031793388,0.0003094002,0.0013789377,0.0007756375,0.00083686865,0.01476731],"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.0007274895,0.00011973684,0.0016696315,0.00094145926,0.00006912616,0.00035876993,0.00025414833,0.0010518244,0.16750528,0.0013845123,0.077488,0.7484301],"study_design_scores_gemma":[0.00022628543,0.00082910067,0.04423294,0.00056855177,0.0006121955,0.002601357,0.001806497,0.32574037,0.39376783,0.008491863,0.22090138,0.00022159336],"about_ca_topic_score_codex":0.009670514,"about_ca_topic_score_gemma":0.018932525,"teacher_disagreement_score":0.019568209,"about_ca_system_score_codex":0.00066352973,"about_ca_system_score_gemma":0.0009570326,"threshold_uncertainty_score":0.06546217},"labels":[],"label_agreement":null},{"id":"W1587123803","doi":"10.1007/978-3-540-92182-0_13","title":"Succinct and I/O Efficient Data Structures for Traversal in Trees","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Tree traversal; Tree (set theory); Path (computing); Binary tree; Binary logarithm; Node (physics); Combinatorics; Graph traversal; Computer science; Data structure; Constant (computer programming); Root (linguistics); B-tree; Discrete mathematics; Asymptotically optimal algorithm; Binary number; Binary search tree; Mathematics; Algorithm; Arithmetic; Physics; Computer network; Operating system","score_opus":0.028592262608921098,"score_gpt":0.2633235455582299,"score_spread":0.2347312829493088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587123803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0373994,0.0019189394,0.9395187,0.0008377791,0.00028760917,0.00021206851,0.0026296002,0.0054742815,0.011721637],"genre_scores_gemma":[0.24041344,0.0018968366,0.72617906,0.0004802536,0.00020109808,0.0004982986,0.00800948,0.0024374803,0.019884005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987804,0.00014309105,0.00017527552,0.00012584041,0.00063800765,0.00013736989],"domain_scores_gemma":[0.99661654,0.0011745861,0.00026417416,0.0013274563,0.0005049255,0.00011225356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007074127,0.0010187611,0.0008747381,0.001362154,0.00081445783,0.0025871708,0.002091794,0.0009989666,0.008292759],"category_scores_gemma":[0.0052013453,0.0009237961,0.0009126881,0.0044574123,0.001180213,0.0062026936,0.002225045,0.0023162102,0.0027685552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007573222,0.00035581435,0.0017753838,0.0011276854,0.00006330932,0.00026357587,0.0008952178,0.046498876,0.038820222,0.29774582,0.060894582,0.5508022],"study_design_scores_gemma":[0.00024577935,0.00039689612,0.0010733777,0.00047878647,0.0001380958,0.00065443787,0.000522439,0.27995822,0.07225783,0.5636604,0.080471985,0.00014170351],"about_ca_topic_score_codex":0.001408195,"about_ca_topic_score_gemma":0.003174902,"teacher_disagreement_score":0.008292759,"about_ca_system_score_codex":0.0012887028,"about_ca_system_score_gemma":0.0015131653,"threshold_uncertainty_score":0.027742088},"labels":[],"label_agreement":null},{"id":"W1587284021","doi":"10.1007/978-3-642-29834-9_6","title":"Toward Design, Modelling and Analysis of Dynamic Workflow Reconfigurations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Polytechnique Montréal","funders":"","keywords":"Control reconfiguration; Rotation formalisms in three dimensions; Computer science; Workflow; Asynchronous communication; Workflow technology; XPDL; Workflow management system; Software engineering; Business Process Execution Language; Business Process Model and Notation; Distributed computing; Systems engineering; Business process; Database; Programming language; Web service; Embedded system; Service-oriented architecture; Business process modeling; Work in process; Engineering","score_opus":0.029485272332111043,"score_gpt":0.24282602823441538,"score_spread":0.21334075590230434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587284021","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.0048346836,0.00031123505,0.9923728,0.00015249131,0.000018878736,0.0000775222,0.00007029363,0.0007290017,0.0014330008],"genre_scores_gemma":[0.1387748,0.0010013065,0.85644954,0.00008869202,0.00003514995,0.00027947774,0.000507902,0.0004150387,0.0024480012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834776,0.0004764494,0.00018778449,0.00030512892,0.00054180506,0.00014103913],"domain_scores_gemma":[0.9975293,0.0012123772,0.00024349631,0.0005318534,0.00042220822,0.000060659073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025973273,0.0010609147,0.0011145916,0.0013518487,0.0007112473,0.0041766297,0.0032194513,0.0015520717,0.0018194295],"category_scores_gemma":[0.006448716,0.0016308049,0.0024668092,0.0013468048,0.0017029098,0.0036511351,0.0016543855,0.0022780057,0.0006266234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006220497,0.000110388195,0.000962772,0.0003570561,0.00009803198,0.00019859363,0.00046614572,0.7596957,0.0075734574,0.16673528,0.0013583634,0.06238207],"study_design_scores_gemma":[0.000010529558,0.000012245864,0.00012837368,0.000040754745,0.000028206305,0.000039729835,0.00004866887,0.9319679,0.0029008554,0.059472088,0.0053378334,0.000012836922],"about_ca_topic_score_codex":0.009595974,"about_ca_topic_score_gemma":0.009487044,"teacher_disagreement_score":0.009595974,"about_ca_system_score_codex":0.0021125125,"about_ca_system_score_gemma":0.0031053247,"threshold_uncertainty_score":0.019080222},"labels":[],"label_agreement":null},{"id":"W1587611405","doi":"10.1007/3-540-44886-1_28","title":"Situation Event Logic for Early Validation of Multi-Agent Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Computer science; Scope (computer science); Event (particle physics); Set (abstract data type); Modal logic; Modal; Multi-agent system; Modal operator; Theoretical computer science; Programming language; Artificial intelligence; Multimodal logic; Description logic","score_opus":0.047150229291792294,"score_gpt":0.2791518063589417,"score_spread":0.2320015770671494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587611405","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.004049809,0.00059698155,0.9841329,0.00058538123,0.00012662256,0.00012077975,0.00018899303,0.0011335711,0.009064988],"genre_scores_gemma":[0.34385327,0.0010015637,0.636113,0.0008873812,0.0003940636,0.00046623594,0.0012925538,0.0006337819,0.015358209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926367,0.0029489417,0.00072137336,0.0008627511,0.002252881,0.0005773365],"domain_scores_gemma":[0.9868342,0.009003437,0.000463206,0.0016718736,0.001741859,0.00028539606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008781851,0.001306131,0.0013013999,0.0019184338,0.0013638898,0.0057412353,0.0041002682,0.0021433604,0.008331814],"category_scores_gemma":[0.01630999,0.0011826606,0.0025118864,0.0016529062,0.0037711472,0.010675885,0.0034915758,0.006840288,0.0017407774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020521018,0.00007367226,0.0002357193,0.0002285862,0.000047202073,0.00023688575,0.00040393713,0.013869388,0.0015603045,0.934064,0.0033119859,0.04576325],"study_design_scores_gemma":[0.00006788621,0.000041749005,0.00008431673,0.00008691255,0.00005365471,0.00008578865,0.00007585781,0.088079,0.0026717465,0.8982527,0.010466851,0.000033523655],"about_ca_topic_score_codex":0.003367008,"about_ca_topic_score_gemma":0.0020337114,"teacher_disagreement_score":0.008781851,"about_ca_system_score_codex":0.0028314928,"about_ca_system_score_gemma":0.0021497654,"threshold_uncertainty_score":0.046443403},"labels":[],"label_agreement":null},{"id":"W1587643749","doi":"10.1007/978-3-642-04271-3_67","title":"Robust Atlas-Based Brain Segmentation Using Multi-structure Confidence-Weighted Registration","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Segmentation; Atlas (anatomy); Computer science; Artificial intelligence; Image registration; Pattern recognition (psychology); Image segmentation; Computer vision; Image (mathematics); Medicine","score_opus":0.038143309534800676,"score_gpt":0.3132261708070502,"score_spread":0.2750828612722495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587643749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058274497,0.00023507219,0.99255085,0.00007086705,0.000022687265,0.000032681128,0.00004824415,0.00083756656,0.00037454453],"genre_scores_gemma":[0.15257515,0.00047172504,0.84370875,0.00009916583,0.000047121135,0.00012125941,0.00038160768,0.0010532738,0.001541919],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979259,0.00046613286,0.00014570002,0.00042678858,0.00088573265,0.000149673],"domain_scores_gemma":[0.99712974,0.00097475736,0.00045428445,0.00067093386,0.0006820268,0.00008823233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032500592,0.0014990411,0.0022584929,0.003317147,0.0008298137,0.0029842714,0.0027686304,0.0027529881,0.0016374189],"category_scores_gemma":[0.010118475,0.0016013904,0.0022229627,0.0031408556,0.0011063811,0.0026128253,0.0033182066,0.0026232966,0.0014526194],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010573447,0.00022019772,0.0021743223,0.0006436958,0.00060471526,0.0005101293,0.00045948254,0.21277806,0.16431323,0.018973215,0.0054034074,0.59286225],"study_design_scores_gemma":[0.000039209783,0.000110045024,0.0013422014,0.000033650613,0.00014163506,0.00076813623,0.00004820563,0.93306416,0.049713418,0.0119288135,0.0027244226,0.00008601184],"about_ca_topic_score_codex":0.003321948,"about_ca_topic_score_gemma":0.00407868,"teacher_disagreement_score":0.003321948,"about_ca_system_score_codex":0.0007967151,"about_ca_system_score_gemma":0.002317158,"threshold_uncertainty_score":0.017188191},"labels":[],"label_agreement":null},{"id":"W1587680137","doi":"10.1007/978-3-540-74126-8_7","title":"Two Birds, One Stone: Selecting Functionally Informative Tag SNPs for Disease Association Studies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Single-nucleotide polymorphism; Selection (genetic algorithm); SNP; Computer science; Genetic association; Heuristic; SNP genotyping; Tag SNP; Computational biology; Genotype; Biology; Genetics; Artificial intelligence; Gene","score_opus":0.02934475569747874,"score_gpt":0.29120328465781814,"score_spread":0.2618585289603394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587680137","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.034317527,0.02015945,0.9274053,0.006358859,0.0010354939,0.00014008567,0.0011116847,0.0018900279,0.007581748],"genre_scores_gemma":[0.078778684,0.0054681227,0.89614165,0.0030447312,0.00073012535,0.0002067077,0.0014450493,0.0006608291,0.013524148],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988617,0.0004918196,0.0000599941,0.0002757298,0.00026627362,0.000044538276],"domain_scores_gemma":[0.9966628,0.0027094346,0.00008789923,0.0002099185,0.0001743199,0.00015561377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036031955,0.00081902277,0.0016629518,0.001792887,0.0006602212,0.0017286077,0.0014312944,0.0014792222,0.005114074],"category_scores_gemma":[0.0073378785,0.00087653945,0.00081042823,0.001413624,0.001069238,0.0013795005,0.0009250706,0.0016639614,0.0023445897],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006848797,0.00012822123,0.012363887,0.0005383743,0.0005817129,0.0009791938,0.0004631727,0.0035704195,0.037136223,0.016308967,0.0444234,0.8828215],"study_design_scores_gemma":[0.0007276361,0.0016461615,0.06347365,0.0007496098,0.0022108871,0.014278901,0.0012734983,0.11282514,0.05547355,0.47065938,0.27606648,0.0006151004],"about_ca_topic_score_codex":0.0006337714,"about_ca_topic_score_gemma":0.0019829727,"teacher_disagreement_score":0.005114074,"about_ca_system_score_codex":0.0002538181,"about_ca_system_score_gemma":0.0003201792,"threshold_uncertainty_score":0.019055724},"labels":[],"label_agreement":null},{"id":"W1587701049","doi":"10.1007/3-540-45311-3_19","title":"Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic curve; Hessian form of an elliptic curve; Mathematics; Schoof's algorithm; Supersingular elliptic curve; Degree (music); Finite field; Tripling-oriented Doche–Icart–Kohel curve; Modular elliptic curve; Twists of curves; Discrete logarithm; Descent (aeronautics); Elliptic curve point multiplication; Discrete mathematics; Pure mathematics; Computer science; Physics; Public-key cryptography; Quarter period","score_opus":0.03161947789062102,"score_gpt":0.26082458541528575,"score_spread":0.22920510752466472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587701049","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.8121303,0.00055648637,0.070633754,0.0016798057,0.00021562743,0.00007266181,0.00022683475,0.00028957587,0.11419501],"genre_scores_gemma":[0.9854193,0.00017926391,0.0025034996,0.00005862691,0.00011535371,0.000020945077,0.00009099203,0.000043931097,0.011568223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993874,0.0001164433,0.000017997489,0.000056154608,0.00022080098,0.0002012121],"domain_scores_gemma":[0.9990983,0.0003505579,0.000115747185,0.00015060673,0.00013228202,0.00015247885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006473859,0.0006970881,0.0008143954,0.0015060583,0.001082803,0.0016930946,0.0006448388,0.0007679837,0.007968268],"category_scores_gemma":[0.0021680663,0.00025443378,0.0005487203,0.0008553157,0.0025349462,0.0028524094,0.0016535737,0.0015520421,0.0009051654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032404865,0.000065910244,0.001471159,0.000059896396,0.000018804723,0.0004180952,0.00023348787,0.018323502,0.0037829182,0.9621994,0.0026805345,0.010422206],"study_design_scores_gemma":[0.000054979755,0.00012485388,0.001907914,0.000034961326,0.000023435734,0.00048551246,0.00016143662,0.13926256,0.0035649755,0.85010064,0.004241064,0.000037620877],"about_ca_topic_score_codex":0.0008476494,"about_ca_topic_score_gemma":0.00062234525,"teacher_disagreement_score":0.007968268,"about_ca_system_score_codex":0.0010981251,"about_ca_system_score_gemma":0.00074732513,"threshold_uncertainty_score":0.026656568},"labels":[],"label_agreement":null},{"id":"W1587803272","doi":"10.1007/978-3-540-85990-1_123","title":"Deformable Ultrasound Registration without Reconstruction","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Modality (human–computer interaction); Artificial intelligence; Data set; Computer vision; Imaging phantom; Similarity (geometry); Volume (thermodynamics); Set (abstract data type); Task (project management); Adaptability; Pattern recognition (psychology); Image (mathematics); Radiology; Medicine","score_opus":0.0171317479272489,"score_gpt":0.2671213998095198,"score_spread":0.24998965188227093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587803272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055903937,0.00017063304,0.9881683,0.00013014147,0.00009880503,0.000078078214,0.00014618419,0.0024150384,0.003202547],"genre_scores_gemma":[0.14033368,0.00046779893,0.8285904,0.00031416028,0.0001082921,0.00015966468,0.0011020573,0.002278871,0.026645053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987777,0.000188806,0.000089307265,0.0002934255,0.0005502767,0.000100498415],"domain_scores_gemma":[0.99864775,0.00020750142,0.00008148198,0.00090861885,0.00012249776,0.000032247604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097474887,0.0010199128,0.0012948785,0.0011276476,0.0005321426,0.0018527022,0.0014712997,0.0020445648,0.015907004],"category_scores_gemma":[0.0034587563,0.0014850858,0.0014416807,0.0012763645,0.0007611423,0.0015584722,0.0028665126,0.001913608,0.01274217],"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.0007350697,0.00020059584,0.0011652174,0.00030870063,0.00020115945,0.0005553724,0.00020889842,0.042004414,0.17550369,0.027728612,0.010570779,0.74081737],"study_design_scores_gemma":[0.000090725305,0.00033773537,0.0030279455,0.00007166122,0.00018638575,0.0057568364,0.0001078541,0.6014171,0.30304903,0.017192809,0.0686346,0.00012733236],"about_ca_topic_score_codex":0.0014732351,"about_ca_topic_score_gemma":0.0020552755,"teacher_disagreement_score":0.015907004,"about_ca_system_score_codex":0.00035244887,"about_ca_system_score_gemma":0.0011544197,"threshold_uncertainty_score":0.053214252},"labels":[],"label_agreement":null},{"id":"W1587851455","doi":"10.1007/978-3-642-22218-4_41","title":"A Token Centric Part-of-Speech Tagger for Biomedical Text","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Victoria","funders":"","keywords":"Computer science; Security token; Natural language processing; Artificial intelligence; Speech recognition; Computer network","score_opus":0.02049503366701117,"score_gpt":0.26729686620843934,"score_spread":0.24680183254142818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587851455","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.016215969,0.002251346,0.87915677,0.00066444516,0.001454748,0.0004203652,0.03168801,0.06369331,0.0044550453],"genre_scores_gemma":[0.10563456,0.0010329208,0.82657117,0.0010609952,0.00048984063,0.00081429305,0.047537647,0.0022602864,0.01459835],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989384,0.00016939828,0.00016490798,0.00036100115,0.0002696696,0.00009652409],"domain_scores_gemma":[0.99690187,0.0015073029,0.00029351807,0.00046293365,0.00065884675,0.00017551721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416892,0.0012606748,0.0014891664,0.003414372,0.00072320714,0.0014844927,0.0018577998,0.0022002158,0.008989043],"category_scores_gemma":[0.003253343,0.00069038523,0.00109055,0.0025671646,0.0005483865,0.0020120926,0.0017768583,0.0015397297,0.02185405],"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.0012949174,0.0002233581,0.002196839,0.0012309237,0.00024041753,0.001104166,0.00023675137,0.0046351044,0.18374328,0.0052318396,0.07411997,0.72574246],"study_design_scores_gemma":[0.00043399024,0.0009789303,0.015225164,0.0004810688,0.00089853245,0.006179836,0.00055190193,0.26327,0.4274494,0.058571406,0.22546765,0.00049208716],"about_ca_topic_score_codex":0.0011101718,"about_ca_topic_score_gemma":0.0029222853,"teacher_disagreement_score":0.008989043,"about_ca_system_score_codex":0.00055455865,"about_ca_system_score_gemma":0.0019032547,"threshold_uncertainty_score":0.030071318},"labels":[],"label_agreement":null},{"id":"W1587885651","doi":"10.1007/978-3-540-46515-7_5","title":"On the Existente of a Point Subset with 4 or 5 Interior Points","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convex hull; Integer (computer science); Combinatorics; Point (geometry); Interior point method; Set (abstract data type); Plane (geometry); Boundary (topology); Planar; Regular polygon; Mathematics; Hull; Geometry; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Computer graphics (images)","score_opus":0.020578748559304545,"score_gpt":0.24123237248837337,"score_spread":0.22065362392906882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587885651","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.51132685,0.0025780045,0.28585765,0.0027786836,0.0004330972,0.00019000267,0.0012504755,0.00037951625,0.19520572],"genre_scores_gemma":[0.7961816,0.0026357311,0.15244575,0.0005137895,0.00051398744,0.00029472445,0.0028131802,0.00033349232,0.04426769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919933,0.00014478833,0.000066910354,0.00023012755,0.00023255528,0.00012634193],"domain_scores_gemma":[0.99394035,0.004279733,0.00034890382,0.00054813665,0.00051812024,0.00036468793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449358,0.00073926605,0.001461181,0.0024069815,0.0025104436,0.002889239,0.001492769,0.0020457443,0.01102843],"category_scores_gemma":[0.00785256,0.0010787166,0.0018503089,0.0020043002,0.0042337477,0.0058809626,0.0046366514,0.0036804092,0.0014029111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013121923,0.00015744453,0.005978437,0.0005130828,0.00008263728,0.0012629753,0.0014144222,0.014091941,0.0103921285,0.89196503,0.008386698,0.064443044],"study_design_scores_gemma":[0.000085543084,0.00029729898,0.0036629704,0.00030667553,0.00016082216,0.0020999853,0.0014374697,0.06750149,0.008577043,0.8951385,0.02066701,0.000065186825],"about_ca_topic_score_codex":0.000921338,"about_ca_topic_score_gemma":0.0009366535,"teacher_disagreement_score":0.01102843,"about_ca_system_score_codex":0.00062577386,"about_ca_system_score_gemma":0.0004897843,"threshold_uncertainty_score":0.036893785},"labels":[],"label_agreement":null},{"id":"W1587917166","doi":"10.1007/978-3-642-01399-7_17","title":"Dimensioning and Location Planning for Wireless Networks under Multi-level Cooperative Relaying","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimensioning; Computer science; Relay; Software deployment; Wireless; Computer network; Wireless network; Computation; Throughput; Distributed computing; Key (lock); Mathematical optimization; Algorithm; Telecommunications; Engineering","score_opus":0.07174315380968027,"score_gpt":0.3039273096781059,"score_spread":0.2321841558684256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587917166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011944358,0.00044646484,0.98425114,0.00012656148,0.000025412286,0.00002153147,0.00005745817,0.00007067584,0.0030563616],"genre_scores_gemma":[0.74798524,0.0014888297,0.24282886,0.000055779143,0.00009194602,0.00017197218,0.0002091384,0.00006463906,0.0071036895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.000121098434,0.000017449776,0.00008330033,0.00008975135,0.000046267854],"domain_scores_gemma":[0.99927276,0.0004527917,0.00008477401,0.00006881583,0.000091306676,0.000029576833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006075499,0.00069609267,0.00091896247,0.00052298274,0.00043355505,0.0010414732,0.0011643831,0.0007854477,0.0013246754],"category_scores_gemma":[0.0023455212,0.00069948414,0.0005909771,0.001285235,0.00091138505,0.0016234461,0.0013189015,0.0008302456,0.00024465116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021184367,0.000007406658,0.00013470634,0.000028863598,0.0000088649385,0.00003460086,0.000046360008,0.9638513,0.0009641903,0.016337285,0.00047022913,0.01809496],"study_design_scores_gemma":[0.0000034757707,0.000016729044,0.00006602717,0.0000045079532,0.000004327833,0.000017595958,0.000011326704,0.98667175,0.00026457786,0.012497595,0.00043596953,0.0000062373174],"about_ca_topic_score_codex":0.0040140394,"about_ca_topic_score_gemma":0.0045212577,"teacher_disagreement_score":0.0040140394,"about_ca_system_score_codex":0.00091654423,"about_ca_system_score_gemma":0.00069518044,"threshold_uncertainty_score":0.00798136},"labels":[],"label_agreement":null},{"id":"W1587953952","doi":"10.1007/978-3-642-16901-4_10","title":"Compensable WorkFlow Nets","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Workflow; Computer science; Workflow management system; Business process; Software engineering; Workflow technology; Petri net; Business process management; Workflow engine; Business process modeling; Windows Workflow Foundation; Robustness (evolution); Programming language; Database; Work in process; Operations management; Engineering","score_opus":0.017299077412191322,"score_gpt":0.21997466632517476,"score_spread":0.20267558891298343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587953952","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.012618186,0.00052718195,0.9228081,0.00060875504,0.00033168422,0.00011344281,0.00051938323,0.0019685337,0.06050477],"genre_scores_gemma":[0.42298737,0.0013644563,0.45058593,0.00043747292,0.00026065364,0.00030818087,0.0040475726,0.0009392579,0.119069174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988041,0.000214352,0.00011128954,0.00032902413,0.00038572872,0.00015544445],"domain_scores_gemma":[0.99850863,0.0004282673,0.00008948865,0.00058270263,0.00028883404,0.00010202201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014693303,0.0007859171,0.00062747806,0.0011597367,0.0012378425,0.0021145248,0.0017736244,0.0008938126,0.015856594],"category_scores_gemma":[0.003433557,0.0005595205,0.0010365859,0.0011430465,0.0012709305,0.0038606117,0.0019995929,0.0023367272,0.0027450402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010094137,0.00003958534,0.00026564492,0.00007709571,0.000015240739,0.00011514989,0.00010214116,0.010949822,0.001707924,0.90762943,0.0056509534,0.07334611],"study_design_scores_gemma":[0.000027521397,0.000025824143,0.00013800901,0.00003419776,0.000026258245,0.00012620736,0.00003900456,0.05050597,0.002640437,0.90226126,0.04415978,0.000015578282],"about_ca_topic_score_codex":0.0031381918,"about_ca_topic_score_gemma":0.0033163903,"teacher_disagreement_score":0.015856594,"about_ca_system_score_codex":0.0017701742,"about_ca_system_score_gemma":0.0019495599,"threshold_uncertainty_score":0.05304557},"labels":[],"label_agreement":null},{"id":"W1587984077","doi":"10.1007/978-3-642-02979-0_32","title":"Are Statecharts Finite Automata?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Western University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Finite-state machine; Automaton; Unified Modeling Language; Expressive power; Programming language; Computation; Theoretical computer science; Mathematical proof; Mathematics; Software","score_opus":0.03141868547614888,"score_gpt":0.28195436048397315,"score_spread":0.25053567500782425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587984077","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.026810208,0.01228887,0.72001576,0.01081712,0.0022523687,0.000106870895,0.001013189,0.0023091831,0.22438642],"genre_scores_gemma":[0.7778254,0.012007507,0.11742536,0.0022486844,0.0014682835,0.0004479124,0.0015209102,0.00054892775,0.08650704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987839,0.00031889466,0.00008735106,0.00033938634,0.00034909617,0.0001213807],"domain_scores_gemma":[0.99699485,0.0019589646,0.00016397769,0.0004581548,0.00036421523,0.000059814287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012942603,0.00064473087,0.00070950773,0.0010770449,0.0008143301,0.0046636527,0.0010607707,0.0018999858,0.011795921],"category_scores_gemma":[0.006510472,0.0008435626,0.000770345,0.0015332695,0.005324644,0.012763387,0.00094962644,0.0025187656,0.0031434365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050654767,0.000003346438,0.000052975265,0.000028523038,0.000003562292,0.000013084142,0.00015018857,0.00038889897,0.00013002982,0.9881561,0.0014057955,0.009662508],"study_design_scores_gemma":[0.00000342632,0.0000029561581,0.000040157018,0.00002287622,0.0000051060592,0.000021757562,0.000040308267,0.0009853228,0.00026589993,0.9766402,0.021967614,0.000004367944],"about_ca_topic_score_codex":0.0018186434,"about_ca_topic_score_gemma":0.0008373161,"teacher_disagreement_score":0.011795921,"about_ca_system_score_codex":0.0014005703,"about_ca_system_score_gemma":0.0007766226,"threshold_uncertainty_score":0.039461255},"labels":[],"label_agreement":null},{"id":"W1587992356","doi":"10.1007/978-3-642-35749-7_14","title":"Retrieving Actions in Group Contexts","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Novelty; Artificial intelligence; Ranking (information retrieval); Representation (politics); Action (physics); Context (archaeology); Support vector machine; Video retrieval; Feature (linguistics); Rank (graph theory); Task (project management); Information retrieval; Machine learning; Learning to rank; Feature vector; Pattern recognition (psychology); Mathematics","score_opus":0.03091439648126068,"score_gpt":0.26394567662772267,"score_spread":0.233031280146462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587992356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29710278,0.009894224,0.5716053,0.00088220485,0.0008044717,0.00057696126,0.006532567,0.016578844,0.09602264],"genre_scores_gemma":[0.6670201,0.0045931027,0.27051452,0.00030496795,0.00034741455,0.0001883257,0.014843459,0.0010543783,0.041133747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.000048332644,0.00002885689,0.00018042936,0.00012510415,0.00008300934],"domain_scores_gemma":[0.9996574,0.000104360806,0.000019849742,0.00011391103,0.000049252478,0.00005524813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026538738,0.0015573358,0.0012252051,0.0018942442,0.00075143593,0.001607958,0.0014412963,0.001235865,0.01595555],"category_scores_gemma":[0.0013788956,0.0004111422,0.0009473635,0.0027941933,0.0005051303,0.0034609656,0.0017859217,0.00076202414,0.009002153],"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.00058124063,0.00020293766,0.0028858047,0.00047556803,0.00012791198,0.0006808427,0.0007458063,0.0043016556,0.058922805,0.007398867,0.02208309,0.90159357],"study_design_scores_gemma":[0.00021817419,0.0014087661,0.031678773,0.00072081067,0.0009862222,0.007067533,0.0078091165,0.36529347,0.1847806,0.21728437,0.18243404,0.0003181608],"about_ca_topic_score_codex":0.005018392,"about_ca_topic_score_gemma":0.008982974,"teacher_disagreement_score":0.01595555,"about_ca_system_score_codex":0.00035870087,"about_ca_system_score_gemma":0.0005229845,"threshold_uncertainty_score":0.053376615},"labels":[],"label_agreement":null},{"id":"W1588033623","doi":"10.1007/978-3-642-02611-9_38","title":"VizDraw: A Platform to Convert Online Hand-Drawn Graphics into Computer Graphics","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graphics; Computer graphics; Engineering drawing; Block diagram; Component (thermodynamics); Computer graphics (images); Data flow diagram; Invariant (physics); Process (computing); Programming language; Engineering; Database","score_opus":0.02199473258638248,"score_gpt":0.28732777400840176,"score_spread":0.2653330414220193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588033623","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.0025684352,0.00042082364,0.6949265,0.0001312146,0.00035194476,0.00031455353,0.0055744033,0.25615695,0.039555132],"genre_scores_gemma":[0.047996674,0.0016760458,0.64493805,0.000536047,0.00017517526,0.0008951229,0.02463601,0.14778739,0.13135944],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994286,0.000036364152,0.00003823435,0.00007248958,0.00036271778,0.00006159826],"domain_scores_gemma":[0.99915946,0.00031676152,0.000029428475,0.00022045418,0.00018929454,0.00008469054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049838505,0.002296372,0.0010670349,0.0026275783,0.00042193034,0.0025854756,0.0042787082,0.0013197309,0.23426516],"category_scores_gemma":[0.0023884089,0.0019812002,0.0014922753,0.0018040506,0.00042398094,0.0020236098,0.0028544066,0.0023435715,0.081331],"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.00040928408,0.00014923044,0.00037325564,0.0009471974,0.00011062548,0.00052433845,0.00028966396,0.0049099294,0.03705032,0.015021707,0.4526062,0.48760828],"study_design_scores_gemma":[0.0004824056,0.0001240659,0.0013395952,0.00027240778,0.00012015768,0.0016185129,0.00010775857,0.062531605,0.10779181,0.023107696,0.8022662,0.00023781536],"about_ca_topic_score_codex":0.0018028729,"about_ca_topic_score_gemma":0.0025923094,"teacher_disagreement_score":0.23426516,"about_ca_system_score_codex":0.00049994496,"about_ca_system_score_gemma":0.0006119518,"threshold_uncertainty_score":0.78369504},"labels":[],"label_agreement":null},{"id":"W1588039295","doi":"10.1007/11925903_9","title":"Viral Genome Compression","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Superstring theory; Genome; Upper and lower bounds; Computer science; Algorithm; Combinatorics; Gene; Mathematics; Biology; Genetics","score_opus":0.012140324300758176,"score_gpt":0.23265016003624933,"score_spread":0.22050983573549116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588039295","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.0918749,0.022187466,0.6864956,0.002826398,0.0042107743,0.00059366797,0.002713668,0.007423303,0.18167421],"genre_scores_gemma":[0.5176057,0.011728223,0.2951278,0.001168848,0.0010817338,0.00038907447,0.008323096,0.0010273608,0.16354802],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997414,0.00002760246,0.000010575985,0.00004309382,0.00014285996,0.000034397974],"domain_scores_gemma":[0.9997149,0.00006976312,0.000014828317,0.00009452516,0.000086577194,0.000019466264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002771145,0.0005669922,0.00051483244,0.0010856278,0.0006183328,0.0010238561,0.0007888998,0.0007820443,0.012528486],"category_scores_gemma":[0.0009611744,0.00024833495,0.00040847083,0.0014212074,0.000437893,0.0010708562,0.00092651235,0.00087094354,0.004801935],"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.0004548419,0.00014708382,0.0004080697,0.00034635,0.00004710766,0.00036699575,0.00009888198,0.018553566,0.16415603,0.056567598,0.033619955,0.72523355],"study_design_scores_gemma":[0.00008768379,0.00033427236,0.0011860573,0.00015154142,0.000065891625,0.0026326594,0.00014106152,0.2574776,0.48191038,0.06791944,0.188013,0.00008044076],"about_ca_topic_score_codex":0.0005824846,"about_ca_topic_score_gemma":0.0005750681,"teacher_disagreement_score":0.012528486,"about_ca_system_score_codex":0.0004988135,"about_ca_system_score_gemma":0.00036023837,"threshold_uncertainty_score":0.04191196},"labels":[],"label_agreement":null},{"id":"W1588113243","doi":"10.1007/978-3-642-11615-5_3","title":"Evaluation of a Technique to Estimate the Compliance of Atherosclerotic Intima","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiovascular Health and Disease Prevention","field":"Medicine","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":"McGill University; National Research Council Canada","funders":"","keywords":"Computer science; Compliance (psychology); Psychology","score_opus":0.04667566547035567,"score_gpt":0.3655536124569754,"score_spread":0.3188779469866197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588113243","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.062168766,0.0008343918,0.9333342,0.00014060958,0.00016326965,0.00014317244,0.0002217314,0.0016005242,0.0013932926],"genre_scores_gemma":[0.25743824,0.0006891307,0.7381248,0.00008814772,0.00010331492,0.00016335798,0.00026424552,0.00020343457,0.002925305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988563,0.00035547192,0.000039823783,0.0001907948,0.0005004866,0.00005720739],"domain_scores_gemma":[0.9943184,0.0035747832,0.00037235676,0.00038701587,0.0012419968,0.00010545611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022050561,0.00070185994,0.0005558655,0.0015011437,0.00037101106,0.0008892734,0.0009095359,0.0014418798,0.0015530902],"category_scores_gemma":[0.0065602274,0.00028625006,0.0005397481,0.0010099309,0.00032968156,0.00087705866,0.0005538669,0.00068243395,0.0007241274],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011916352,0.00030581912,0.016408809,0.0004595876,0.00020127857,0.00023441605,0.00037209367,0.012374825,0.29157537,0.0034586838,0.0023239923,0.67109346],"study_design_scores_gemma":[0.00020518259,0.0030266237,0.04424254,0.00009715803,0.00046363482,0.003666713,0.00038670734,0.6682276,0.26713288,0.0034855902,0.008870154,0.00019529223],"about_ca_topic_score_codex":0.0015857437,"about_ca_topic_score_gemma":0.0018571289,"teacher_disagreement_score":0.0022050561,"about_ca_system_score_codex":0.00027570382,"about_ca_system_score_gemma":0.00057331903,"threshold_uncertainty_score":0.011661589},"labels":[],"label_agreement":null},{"id":"W1588123286","doi":"10.1007/11560319_17","title":"On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Queen's University","funders":"","keywords":"Computer science; Impossibility; Parallelism (grammar); Quantum computer; Computation; Theoretical computer science; Data parallelism; Quantum; Parallel computing; Algorithm; Quantum mechanics","score_opus":0.013125438298593748,"score_gpt":0.244658928697455,"score_spread":0.23153349039886126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588123286","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06371538,0.043046016,0.4374081,0.023920652,0.003649996,0.00016660297,0.00030015214,0.00049480144,0.4272983],"genre_scores_gemma":[0.8443493,0.015984273,0.10168539,0.003007922,0.004095091,0.00030816632,0.00015526358,0.0002779636,0.030136531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898905,0.00029816903,0.000048322872,0.00020399498,0.00031430426,0.00014611],"domain_scores_gemma":[0.9969997,0.002185223,0.000092852606,0.000467309,0.00017200012,0.000082958664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017427083,0.0006898669,0.0011501242,0.00089608686,0.0022192101,0.003144124,0.0015294832,0.0021857272,0.0047937566],"category_scores_gemma":[0.0050312704,0.0006970785,0.0010433557,0.0013310804,0.013667586,0.014089808,0.0027013123,0.0061657913,0.0006336911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007871118,0.0000034793893,0.000013972081,0.00002265219,0.0000023121345,0.000011545358,0.000059584745,0.00047793338,0.00011843085,0.9962547,0.0006752177,0.0023523134],"study_design_scores_gemma":[0.0000031225,0.0000034186653,0.000015150017,0.000008148174,0.0000016712567,0.000014281178,0.0000071608606,0.0009000312,0.00008783838,0.9963917,0.002564662,0.0000027417273],"about_ca_topic_score_codex":0.000922029,"about_ca_topic_score_gemma":0.00079834944,"teacher_disagreement_score":0.0047937566,"about_ca_system_score_codex":0.0013019831,"about_ca_system_score_gemma":0.000857069,"threshold_uncertainty_score":0.016036749},"labels":[],"label_agreement":null},{"id":"W1588132789","doi":"10.1007/3-540-38093-0_15","title":"Building Test Constraints for Testing Middleware-Based Distributed Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Windsor","funders":"","keywords":"Computer science; Constraint (computer-aided design); Test harness; System under test; Middleware (distributed applications); Test case; Test (biology); Test Management Approach; Distributed computing; Model-based testing; Programming language; Software; Software development; Machine learning","score_opus":0.03461666272034649,"score_gpt":0.24977118570043283,"score_spread":0.21515452298008633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588132789","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.017749228,0.00028118852,0.9749894,0.0002826309,0.0000551637,0.00027893405,0.00045743567,0.0029486974,0.0029573063],"genre_scores_gemma":[0.25367314,0.0003307887,0.74051136,0.00027238938,0.000099603254,0.00061864563,0.002105377,0.0009850928,0.0014036489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98976713,0.0035632052,0.0010651485,0.0012228775,0.003306594,0.0010751942],"domain_scores_gemma":[0.95747185,0.03335495,0.0020071133,0.0028022574,0.0035344756,0.0008293951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006187909,0.0023225911,0.0021798841,0.00336278,0.0010560357,0.0034160013,0.005715335,0.0022283134,0.005004803],"category_scores_gemma":[0.03567148,0.0021314593,0.0022664939,0.002356669,0.0028204084,0.006614723,0.0046105417,0.0038405163,0.0010064658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005206436,0.00051467115,0.004908767,0.0010569545,0.00024969058,0.0012621962,0.0006322792,0.5705659,0.01554689,0.16923374,0.0103831375,0.22512513],"study_design_scores_gemma":[0.00010870264,0.00010230442,0.00034950272,0.00012817906,0.0000702601,0.00018251722,0.00011881958,0.8565694,0.01089187,0.12705018,0.0043788096,0.000049415587],"about_ca_topic_score_codex":0.01008305,"about_ca_topic_score_gemma":0.011072102,"teacher_disagreement_score":0.01008305,"about_ca_system_score_codex":0.0019747778,"about_ca_system_score_gemma":0.0028362873,"threshold_uncertainty_score":0.032725215},"labels":[],"label_agreement":null},{"id":"W1588166307","doi":"10.1007/978-3-540-24840-8_61","title":"An Investigation of Grammar Design in Natural-Language Speech Recognition","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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 Windsor","funders":"","keywords":"Computer science; Robustness (evolution); Speech recognition; Natural language; Natural language processing; Grammar; Artificial intelligence; Linguistics","score_opus":0.02942735014565632,"score_gpt":0.2518051128363049,"score_spread":0.2223777626906486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588166307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051267732,0.0009865143,0.93316597,0.00087648316,0.000069738686,0.00013656764,0.000082114435,0.00078211294,0.012632718],"genre_scores_gemma":[0.507715,0.00089485483,0.48435837,0.00027972754,0.000081531514,0.0001301283,0.00022056044,0.0005285927,0.0057912488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717283,0.001499978,0.00019325553,0.00042878513,0.0005566441,0.0001483526],"domain_scores_gemma":[0.98444194,0.012740632,0.00055735785,0.0010387267,0.0010854373,0.00013601604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032443795,0.00033865173,0.00065840624,0.00071490393,0.00076911115,0.0026183682,0.0013965985,0.0012140804,0.0034971035],"category_scores_gemma":[0.019576741,0.0009587375,0.0008843161,0.0009658834,0.0029263312,0.004811065,0.00092114136,0.0014909201,0.0008339504],"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.00018384945,0.00016489401,0.0035658388,0.0005577282,0.000046285535,0.00045063466,0.0024896152,0.04361534,0.019076679,0.63211346,0.0025506513,0.295185],"study_design_scores_gemma":[0.00006313404,0.00019986287,0.0010911054,0.0001135441,0.00007591069,0.00061052147,0.0007899485,0.31241438,0.017735438,0.65247566,0.014385044,0.000045456745],"about_ca_topic_score_codex":0.0018985312,"about_ca_topic_score_gemma":0.002065995,"teacher_disagreement_score":0.0034971035,"about_ca_system_score_codex":0.00118238,"about_ca_system_score_gemma":0.0014356688,"threshold_uncertainty_score":0.01715815},"labels":[],"label_agreement":null},{"id":"W1588326396","doi":"10.1007/978-3-540-75757-3_18","title":"Medical and Technical Protocol for Automatic Navigation of a Wireless Device in the Carotid Artery of a Living Swine Using a Standard Clinical MRI System","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Micro and Nano Robotics","field":"Physics and Astronomy","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":"Hôpital Notre-Dame; Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Protocol (science); Carotid arteries; Propulsion; Tracking (education); Trajectory; Software; Catheter; Magnetic resonance imaging; Computer science; Biomedical engineering; Simulation; Engineering; Medicine; Radiology; Physics; Surgery; Aerospace engineering; Biology; Pathology","score_opus":0.02284208788017464,"score_gpt":0.3512777621231422,"score_spread":0.3284356742429676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588326396","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3773436,0.0010775336,0.5798176,0.0031354937,0.0010706149,0.008514418,0.0021671148,0.004191707,0.022681892],"genre_scores_gemma":[0.7066012,0.0010526604,0.25647098,0.0020911035,0.00041362215,0.0075363196,0.0028127953,0.00052239385,0.022498906],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974734,0.00007561241,0.000042115716,0.000042477543,0.000070536946,0.00002198175],"domain_scores_gemma":[0.9991273,0.00024966736,0.000096279386,0.0001604939,0.00027479103,0.00009156962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013145774,0.00040345712,0.0003008136,0.0005162824,0.00049711135,0.00045658502,0.000585857,0.0011782101,0.0068639307],"category_scores_gemma":[0.0016503887,0.0002471063,0.00017226447,0.00020996296,0.0005311838,0.00044884134,0.00036313626,0.00070499897,0.0018827725],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040187165,0.0009975272,0.007994626,0.0006766021,0.000083299994,0.0044262153,0.00069080875,0.0066953977,0.8263915,0.0065542487,0.017687095,0.12378381],"study_design_scores_gemma":[0.0018076276,0.016065836,0.072549514,0.00031567324,0.0006223066,0.019085608,0.0007054698,0.062859915,0.6750487,0.004191858,0.1463716,0.0003759263],"about_ca_topic_score_codex":0.0006459841,"about_ca_topic_score_gemma":0.0011861468,"teacher_disagreement_score":0.0068639307,"about_ca_system_score_codex":0.00030615318,"about_ca_system_score_gemma":0.0009189003,"threshold_uncertainty_score":0.022962093},"labels":[],"label_agreement":null},{"id":"W1588326449","doi":"10.1007/978-3-540-27814-6_51","title":"Extraction of Salient Features for Image Retrieval Using Multi-scale Image Relevance Function","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université du Québec","funders":"","keywords":"Image retrieval; Computer science; Salient; Artificial intelligence; Pattern recognition (psychology); Feature extraction; Feature detection (computer vision); Scale space; Automatic image annotation; Computer vision; Visual Word; Image (mathematics); Relevance (law); Image processing","score_opus":0.02540452358785483,"score_gpt":0.2942470428648285,"score_spread":0.26884251927697367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588326449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03738472,0.001725163,0.9580014,0.000112064714,0.00011872705,0.00014044983,0.0001751743,0.001366945,0.0009753085],"genre_scores_gemma":[0.22252166,0.0014761941,0.77171326,0.00008231186,0.000189217,0.0001736603,0.0007608694,0.00026765917,0.0028151434],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997235,0.000029092245,0.00002180137,0.000050576036,0.00013388241,0.000041185605],"domain_scores_gemma":[0.9994777,0.00013492141,0.00006236523,0.00007498595,0.00022013883,0.000029990015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247291,0.0007142723,0.0016721173,0.002918127,0.00035926007,0.0007949114,0.00077962864,0.0007729436,0.002468294],"category_scores_gemma":[0.0017747857,0.00044640215,0.0010062337,0.002113161,0.00026681754,0.0013479847,0.00067531364,0.0006414537,0.0019023148],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003230977,0.00013519259,0.0004422795,0.0003951707,0.000054580774,0.0002132083,0.00005442515,0.0048628575,0.40189317,0.0017844145,0.0034436516,0.5863979],"study_design_scores_gemma":[0.00012917566,0.0006750294,0.014699821,0.00006638426,0.0004164117,0.0016638148,0.00013214581,0.6481983,0.3143887,0.0069819684,0.012531911,0.00011630928],"about_ca_topic_score_codex":0.0007771479,"about_ca_topic_score_gemma":0.0012651978,"teacher_disagreement_score":0.002918127,"about_ca_system_score_codex":0.00028483142,"about_ca_system_score_gemma":0.0004868423,"threshold_uncertainty_score":0.00825727},"labels":[],"label_agreement":null},{"id":"W1588331535","doi":"10.1007/3-540-45491-8_59","title":"Accessible Digital Media","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Animation; Computer graphics (images); Multimedia; Graphics; Computer animation; Digital media; World Wide Web","score_opus":0.047148472043185084,"score_gpt":0.24244409597983482,"score_spread":0.19529562393664973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588331535","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007060643,0.002062885,0.0026755957,0.0008567407,0.00065422134,0.000025684345,0.0004998482,0.00070324045,0.99181575],"genre_scores_gemma":[0.0049832277,0.002602051,0.000870569,0.00030511696,0.00028276112,0.000022433884,0.0005120777,0.00023534792,0.99018645],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996804,0.00003092904,0.000011320339,0.00005232814,0.00017926894,0.00004575844],"domain_scores_gemma":[0.9996044,0.000062128194,0.000016607055,0.00011413617,0.00008929036,0.00011355845],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000327392,0.00071002723,0.0003628956,0.0024583943,0.0012719424,0.0070674615,0.0008472738,0.0011844215,0.41736752],"category_scores_gemma":[0.0010033126,0.00030193245,0.00035602515,0.0023625845,0.0008126225,0.0065850755,0.0043642544,0.0012429162,0.20557004],"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.000043236418,0.00008329938,0.00024194513,0.00028155427,0.000006051175,0.00016257104,0.00060488906,0.00012340308,0.0020860874,0.10512746,0.46093816,0.43030137],"study_design_scores_gemma":[0.0000018799656,0.0000063816287,0.00024840835,0.00008896205,0.000002576381,0.000089583635,0.00014841431,0.000056291556,0.0002997903,0.006534856,0.9925194,0.0000035083615],"about_ca_topic_score_codex":0.00097084604,"about_ca_topic_score_gemma":0.0026854442,"teacher_disagreement_score":0.41736752,"about_ca_system_score_codex":0.00063548493,"about_ca_system_score_gemma":0.00066384283,"threshold_uncertainty_score":0.8310545},"labels":[],"label_agreement":null},{"id":"W1588360024","doi":"10.1007/11888116_15","title":"Generalizing the Submodule Construction Techniques for Extended State Machine Models","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Parameterized complexity; Negation; Automaton; Theoretical computer science; State (computer science); Algorithm; Finite-state machine; Simple (philosophy); Programming language","score_opus":0.02887363968412839,"score_gpt":0.2771440362517523,"score_spread":0.24827039656762392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588360024","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.001179897,0.00005907012,0.99500257,0.000057301997,0.000041098137,0.00004084124,0.000050730407,0.0006375757,0.0029307802],"genre_scores_gemma":[0.09570634,0.0006353075,0.8883446,0.00023717165,0.00014886705,0.00041116803,0.0007465426,0.0012924256,0.012477503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985877,0.00034985205,0.00012400559,0.00031266856,0.00049941475,0.00012632638],"domain_scores_gemma":[0.9976204,0.000800208,0.000075694355,0.0012334324,0.00022197815,0.000048315796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016181676,0.0011947282,0.0011114051,0.0010726736,0.00097227853,0.0017924092,0.0024197935,0.0011917226,0.009071238],"category_scores_gemma":[0.0048733754,0.0011064142,0.0038730777,0.0012752241,0.002159777,0.0062583527,0.0048645586,0.0050081788,0.0036169172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057762703,0.0000768228,0.0003053759,0.0004085267,0.00008321185,0.00024977286,0.0005155955,0.025931748,0.009052193,0.80716884,0.004213102,0.15193708],"study_design_scores_gemma":[0.000019910798,0.00005257416,0.00013161784,0.00011237191,0.000071957744,0.00023016114,0.000050823015,0.08430908,0.010635749,0.86971956,0.034627266,0.000038903378],"about_ca_topic_score_codex":0.0009503455,"about_ca_topic_score_gemma":0.0014855673,"teacher_disagreement_score":0.009071238,"about_ca_system_score_codex":0.00068784395,"about_ca_system_score_gemma":0.0013000817,"threshold_uncertainty_score":0.030346274},"labels":[],"label_agreement":null},{"id":"W1588391170","doi":"10.1007/11590354_82","title":"Replica Placement in Data Grid: A Multi-objective Approach","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing 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":"University of Calgary","funders":"","keywords":"Replica; Grid; Replication (statistics); Computer science; Response time; Data center; Host (biology); Distributed computing; Grid cell; Mathematics; Statistics; Geography; Computer network; Operating system; Biology","score_opus":0.045863144413226295,"score_gpt":0.280233288855603,"score_spread":0.2343701444423767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588391170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011512837,0.0006591523,0.98384273,0.00022118984,0.00006996503,0.000069397,0.00004199245,0.00017564147,0.0034071612],"genre_scores_gemma":[0.38512266,0.0010232889,0.60559344,0.00012291688,0.00014985778,0.00026177068,0.0000972195,0.0002940496,0.0073347627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994462,0.0002553677,0.00002521771,0.000066984925,0.00014499921,0.00006122317],"domain_scores_gemma":[0.9993967,0.00035650982,0.00006166117,0.00004920006,0.00009265376,0.000043240518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012552358,0.0009702912,0.001818955,0.00074884674,0.0007376848,0.0013155676,0.0021221542,0.0013566823,0.0030592168],"category_scores_gemma":[0.0018160639,0.00071113446,0.00091834017,0.0015804876,0.00064782257,0.0011603533,0.0010463952,0.0008779241,0.00032434217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003615711,0.00002892605,0.0001169208,0.00010816676,0.000037227244,0.00004152065,0.000024812623,0.96720695,0.0010873151,0.008425394,0.0007766431,0.022109954],"study_design_scores_gemma":[0.0000071261006,0.000014937726,0.000029920971,0.0000041509647,0.000007362404,0.000011018411,0.000006875276,0.9957104,0.00020377463,0.0037247587,0.0002765838,0.0000030835527],"about_ca_topic_score_codex":0.002961674,"about_ca_topic_score_gemma":0.0035172342,"teacher_disagreement_score":0.0030592168,"about_ca_system_score_codex":0.0009778161,"about_ca_system_score_gemma":0.0008724856,"threshold_uncertainty_score":0.010234058},"labels":[],"label_agreement":null},{"id":"W1588404442","doi":"10.1007/978-3-540-73580-9_27","title":"An Analysis of Map-Based Abstraction and Refinement","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Testbed; Abstraction; Variety (cybernetics); Computer science; Pathfinding; Theoretical computer science; Programming language; Artificial intelligence; World Wide Web; Graph","score_opus":0.02182059924059719,"score_gpt":0.2736472474865811,"score_spread":0.2518266482459839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588404442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02720521,0.00038353674,0.95884895,0.00035011137,0.00005867443,0.00012627087,0.0001319597,0.0009617863,0.011933607],"genre_scores_gemma":[0.5455446,0.0009232669,0.43749645,0.0002610316,0.00016229658,0.00028968332,0.00047686565,0.0010968334,0.013749046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549955,0.0007813239,0.00023691918,0.00041282177,0.0023373496,0.0007320914],"domain_scores_gemma":[0.9846933,0.00803943,0.00076633075,0.003944981,0.002201655,0.00035439132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045278,0.0008391092,0.0011727588,0.0026362776,0.0018354912,0.0027733739,0.0039176326,0.0014093051,0.010280065],"category_scores_gemma":[0.028492108,0.0012232809,0.0025850344,0.0038105657,0.003526688,0.0077031883,0.005128624,0.0030721757,0.0011278243],"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.00019401162,0.0000624315,0.0019495819,0.00023841795,0.000074523945,0.0002030132,0.00079523784,0.060906146,0.0031764258,0.8574531,0.0031728847,0.071774095],"study_design_scores_gemma":[0.00003656686,0.00006804475,0.00093761215,0.0000591465,0.00012017125,0.0001875972,0.00025135835,0.35738674,0.005079012,0.628233,0.007601293,0.000039454208],"about_ca_topic_score_codex":0.011223332,"about_ca_topic_score_gemma":0.0071224472,"teacher_disagreement_score":0.011223332,"about_ca_system_score_codex":0.0021845035,"about_ca_system_score_gemma":0.0024841535,"threshold_uncertainty_score":0.03439027},"labels":[],"label_agreement":null},{"id":"W1588477125","doi":"10.1007/978-3-642-17298-4_31","title":"Supplanting Neural Networks with ODEs in Evolutionary Robotics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Genetic programming; Computer science; Ode; Artificial intelligence; Symbolic regression; Artificial neural network; Evolutionary robotics; Robotics; Robot; Ordinary differential equation; Evolutionary algorithm; Genetic algorithm; Controller (irrigation); Differential equation; Machine learning; Mathematics; Applied mathematics","score_opus":0.010432609770204194,"score_gpt":0.22117974172815705,"score_spread":0.21074713195795286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588477125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015531309,0.002710353,0.95838785,0.0006016861,0.0003651083,0.000019374636,0.000031176813,0.0001565003,0.022196572],"genre_scores_gemma":[0.5999565,0.004863583,0.34385327,0.00037064415,0.00041865793,0.000112133865,0.00009631236,0.00029634906,0.050032414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982566,0.0000698193,0.000012083169,0.000025675829,0.000053324326,0.000013560723],"domain_scores_gemma":[0.999744,0.00015324894,0.0000208952,0.000034663157,0.000032385196,0.000014777276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057227403,0.00042419985,0.00056551525,0.0003443118,0.00031631082,0.0008268227,0.000864119,0.0012287626,0.00251878],"category_scores_gemma":[0.0021507598,0.00046876085,0.0005982145,0.00041285166,0.0010788029,0.0017952808,0.0015013881,0.0013048459,0.0005505657],"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.000033115288,0.000019467214,0.00019238332,0.0001606033,0.000039520917,0.00008280737,0.00011413008,0.38397142,0.0036553089,0.54586333,0.001401352,0.06446651],"study_design_scores_gemma":[0.000005638937,0.000018123292,0.00005796732,0.00002114433,0.000008579913,0.000037718117,0.000010870963,0.76799226,0.0006785306,0.22572222,0.005435785,0.000011115331],"about_ca_topic_score_codex":0.0013153784,"about_ca_topic_score_gemma":0.001528502,"teacher_disagreement_score":0.00251878,"about_ca_system_score_codex":0.0005317727,"about_ca_system_score_gemma":0.00029466368,"threshold_uncertainty_score":0.00842613},"labels":[],"label_agreement":null},{"id":"W1588490314","doi":"10.1007/978-3-540-77255-2_91","title":"Content Based Image Hashing Via Wavelet and Radon Transform","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":30,"is_retracted":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":"Hash function; Artificial intelligence; Pattern recognition (psychology); Feature hashing; Computer science; Discrete wavelet transform; Wavelet transform; Computer vision; Quantization (signal processing); Radon transform; Wavelet; Double hashing; Cryptographic hash function","score_opus":0.03461147329791651,"score_gpt":0.2787386896735639,"score_spread":0.2441272163756474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588490314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02260975,0.00071459415,0.97352296,0.00007432378,0.000091357324,0.00005138105,0.00008154047,0.0008498694,0.0020041422],"genre_scores_gemma":[0.31773412,0.0008501459,0.6719102,0.000100401536,0.00016541198,0.000099278295,0.0005103946,0.00021864662,0.008411337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994368,0.00009775405,0.000027227146,0.00008623952,0.0003029355,0.00004890722],"domain_scores_gemma":[0.99940765,0.00013475804,0.00006399636,0.00024814156,0.0001185803,0.000026940354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109259,0.0004168353,0.00097326783,0.0011663202,0.0003293181,0.0008909425,0.0009553951,0.00069674844,0.00353483],"category_scores_gemma":[0.0020882525,0.00034322654,0.0004950256,0.0014802451,0.00055548653,0.0019864417,0.0015087597,0.0005512452,0.0021377413],"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.0004723892,0.00012067292,0.00090881536,0.00021840501,0.00007184568,0.00016220023,0.00011567433,0.030799862,0.1420983,0.056572456,0.0068937694,0.76156557],"study_design_scores_gemma":[0.000074244104,0.0004219851,0.0017910379,0.000033649027,0.00008685563,0.0018449554,0.00013105219,0.822918,0.11871528,0.041330263,0.012561661,0.00009099502],"about_ca_topic_score_codex":0.00036937706,"about_ca_topic_score_gemma":0.00046956295,"teacher_disagreement_score":0.00353483,"about_ca_system_score_codex":0.00033399923,"about_ca_system_score_gemma":0.00030251275,"threshold_uncertainty_score":0.011825144},"labels":[],"label_agreement":null},{"id":"W1588532374","doi":"10.1007/3-540-44696-6_13","title":"Experiments in Computing Sequences of Reversals","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science","score_opus":0.01973155574191111,"score_gpt":0.27214244194327114,"score_spread":0.25241088620136004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588532374","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.8371778,0.0012793851,0.13592225,0.0011795715,0.00042611305,0.00026142932,0.0022798327,0.0039387094,0.017534874],"genre_scores_gemma":[0.85052955,0.00032030666,0.1396921,0.00026546884,0.00009575672,0.00017829722,0.003598879,0.0006142089,0.004705501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950937,0.0019453808,0.00045957442,0.0010476282,0.001061917,0.00039182903],"domain_scores_gemma":[0.90687764,0.076308906,0.0017391436,0.01045269,0.0033056946,0.0013158962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051304153,0.0011421813,0.00127766,0.0012897255,0.0015929147,0.0022193992,0.0031780968,0.0020513681,0.014810456],"category_scores_gemma":[0.04289457,0.0007588135,0.0009660287,0.0030572324,0.0022915702,0.007315548,0.0012276067,0.0019543178,0.0015085139],"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.018490052,0.0045530093,0.025693998,0.0025654864,0.0006337165,0.0005069104,0.0009886979,0.24544789,0.11218105,0.23138149,0.02585442,0.33170322],"study_design_scores_gemma":[0.0014125374,0.0021365315,0.0042741797,0.00012457132,0.00025693045,0.00044425426,0.0005259534,0.65751123,0.13773084,0.18641108,0.009035349,0.00013651623],"about_ca_topic_score_codex":0.002502387,"about_ca_topic_score_gemma":0.002569307,"teacher_disagreement_score":0.014810456,"about_ca_system_score_codex":0.0015823315,"about_ca_system_score_gemma":0.0013005134,"threshold_uncertainty_score":0.049545884},"labels":[],"label_agreement":null},{"id":"W1588596779","doi":"10.1007/3-540-44745-8_42","title":"3D Flux Maximizing Flows","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"McGill University","funders":"","keywords":"Vector flow; Computer science; Segmentation; Balanced flow; Active contour model; Flow (mathematics); Image segmentation; Level set (data structures); Algorithm; Contrast (vision); Vector field; Energy functional; Set (abstract data type); Energy (signal processing); Artificial intelligence; Geometry; Mathematics; Mathematical analysis","score_opus":0.02112393225142152,"score_gpt":0.2695281358672332,"score_spread":0.24840420361581167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588596779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006941895,0.0010715958,0.9657618,0.00031059489,0.00013646645,0.000033915618,0.000130917,0.00044986996,0.02516294],"genre_scores_gemma":[0.20012036,0.0031576806,0.7357697,0.0002525294,0.00032573176,0.00019876029,0.0004924049,0.0009457307,0.058737133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999019,0.000025520614,0.000005181224,0.000024014651,0.000034351044,0.000009158928],"domain_scores_gemma":[0.9998332,0.00006637901,0.000017354521,0.000025962212,0.00003647486,0.000020527992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039480912,0.0007762386,0.0007774141,0.00096660835,0.00044624836,0.0014100826,0.000642428,0.0011796255,0.0075923847],"category_scores_gemma":[0.00088142935,0.0005164522,0.00051478064,0.0006102665,0.00062944327,0.0013629197,0.0014525591,0.0009551858,0.0018911724],"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.00009692321,0.00004445126,0.00019929615,0.0002468237,0.000031673408,0.00008013146,0.00013367254,0.116784014,0.015928576,0.6172742,0.013424519,0.23575573],"study_design_scores_gemma":[0.000021944412,0.000037551537,0.00020983253,0.000075705735,0.000018047605,0.00029204713,0.0000213459,0.60710204,0.00841517,0.3448198,0.03896104,0.000025382169],"about_ca_topic_score_codex":0.00041164047,"about_ca_topic_score_gemma":0.00046464553,"teacher_disagreement_score":0.0075923847,"about_ca_system_score_codex":0.0006042199,"about_ca_system_score_gemma":0.00035144316,"threshold_uncertainty_score":0.02539903},"labels":[],"label_agreement":null},{"id":"W1588617094","doi":"10.1007/978-3-642-15760-8_27","title":"Coverage-Based Methods for Distributional Stopword Selection in Text Segmentation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Guelph","funders":"","keywords":"Computer science; Selection (genetic algorithm); Segmentation; Measure (data warehouse); Representation (politics); Word (group theory); Artificial intelligence; Natural language processing; Information retrieval; Data mining; Mathematics","score_opus":0.024365051874352766,"score_gpt":0.31662918369622595,"score_spread":0.29226413182187316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588617094","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.022495681,0.0018387784,0.9679394,0.00018032198,0.00013542226,0.00014813346,0.00069262006,0.005327701,0.0012418845],"genre_scores_gemma":[0.28240082,0.0011981353,0.6954201,0.00030141766,0.000706482,0.00073314836,0.009569204,0.0038390823,0.005831536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949956,0.0017128767,0.0005421738,0.0010389856,0.0013231175,0.00038725027],"domain_scores_gemma":[0.97731555,0.017281674,0.00067447295,0.0014710427,0.0028321,0.0004251769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050143483,0.0019902675,0.0039537563,0.0077508707,0.0018922925,0.0029517596,0.0033343516,0.0031466342,0.0055112573],"category_scores_gemma":[0.017302478,0.0012300378,0.0019243931,0.007033762,0.0012733708,0.0040393933,0.003456311,0.002921167,0.0045527173],"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.0012022702,0.0003023549,0.004019498,0.00072360516,0.0004654418,0.000325033,0.00063264405,0.040960487,0.025701055,0.008029514,0.014660847,0.9029772],"study_design_scores_gemma":[0.00008636521,0.00012794421,0.0022035681,0.000057584224,0.00016372133,0.00028199164,0.00020042021,0.96624535,0.009802453,0.016193934,0.0045740847,0.000062572326],"about_ca_topic_score_codex":0.0054921205,"about_ca_topic_score_gemma":0.011418797,"teacher_disagreement_score":0.0077508707,"about_ca_system_score_codex":0.000800426,"about_ca_system_score_gemma":0.0017380714,"threshold_uncertainty_score":0.026518703},"labels":[],"label_agreement":null},{"id":"W1588637626","doi":"10.1007/978-3-540-24581-0_67","title":"On Using Prototype Reduction Schemes and Classifier Fusion Strategies to Optimize Kernel-Based Nonlinear Subspace Methods","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Carleton University","funders":"","keywords":"Computer science; Subspace topology; Classifier (UML); Kernel method; Kernel (algebra); Artificial intelligence; Computation; Pattern recognition (psychology); Dimensionality reduction; Algorithm; Support vector machine; Mathematics","score_opus":0.040077387975911045,"score_gpt":0.32467688606166084,"score_spread":0.2845994980857498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588637626","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.004883485,0.00012949712,0.994189,0.000060850554,0.000022957567,0.000028623517,0.000012511762,0.00022760074,0.00044538776],"genre_scores_gemma":[0.12361992,0.00025959205,0.8727098,0.00010658779,0.00004831387,0.00015309668,0.00014028966,0.00023240541,0.0027300972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00029709795,0.000051681876,0.00011014904,0.00028645844,0.000045911518],"domain_scores_gemma":[0.9981135,0.0008683208,0.000095798685,0.0002869993,0.0005961448,0.000039310828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002303002,0.0010253027,0.0013842408,0.00066952495,0.0005460211,0.0009610142,0.0014676368,0.0015295743,0.002202125],"category_scores_gemma":[0.0071501005,0.00068132207,0.0007361075,0.001034341,0.0009147331,0.0026647104,0.0016019944,0.0014204957,0.0007911556],"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.00021563852,0.00013304137,0.00042142617,0.00012623219,0.000086622196,0.000032570115,0.00012817691,0.42770115,0.013631063,0.029522652,0.0040636566,0.52393776],"study_design_scores_gemma":[0.000008018564,0.000027083981,0.00009745618,0.0000049406544,0.000010458039,0.000014010641,0.000007239237,0.99136305,0.0017426211,0.0062537,0.00046056905,0.000010780982],"about_ca_topic_score_codex":0.0033622268,"about_ca_topic_score_gemma":0.0037955535,"teacher_disagreement_score":0.0033622268,"about_ca_system_score_codex":0.00051858515,"about_ca_system_score_gemma":0.000785773,"threshold_uncertainty_score":0.012179613},"labels":[],"label_agreement":null},{"id":"W1588662652","doi":"10.1007/978-3-540-45231-7_38","title":"Study of Canada/US Dollar Exchange Rate Movements Using Recurrent Neural Network Model of FX-Market","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Exchange rate; Computer science; Currency; Foreign exchange market; Artificial neural network; Liberian dollar; Econometrics; Artificial intelligence; Economics; Monetary economics; Finance","score_opus":0.13837638420220727,"score_gpt":0.3590223381309064,"score_spread":0.22064595392869912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588662652","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.9867697,0.0008346041,0.0060711703,0.0003079395,0.000042871954,0.000013749917,0.00036476072,0.00012688157,0.0054684426],"genre_scores_gemma":[0.9966653,0.00021210765,0.00087246735,0.000012395107,0.000010503631,0.0000031916677,0.00024209783,0.000017814787,0.0019641602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999467,0.000008527409,0.000002330186,0.00001247333,0.00001261597,0.0000173179],"domain_scores_gemma":[0.9996275,0.00019575671,0.000027523933,0.000014074133,0.00010599775,0.000029077664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029188025,0.00038160646,0.00042835542,0.0005384427,0.0004800798,0.0005814354,0.0005331513,0.00045997236,0.0017941993],"category_scores_gemma":[0.0012123793,0.00019349507,0.00045738896,0.0005621998,0.0002628704,0.0004293118,0.00012851233,0.0005069173,0.00011641272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032724903,0.00010776383,0.021300664,0.00013185607,0.00014041121,0.0010199732,0.00019047124,0.94040644,0.0058347317,0.010986681,0.0041946536,0.015359078],"study_design_scores_gemma":[0.000005443814,0.000011063266,0.0072392565,0.000003133498,0.00001884513,0.00002068525,0.00004730401,0.9916809,0.00042785896,0.00036213855,0.00017726229,0.0000061215437],"about_ca_topic_score_codex":0.5355581,"about_ca_topic_score_gemma":0.3536192,"teacher_disagreement_score":0.4644419,"about_ca_system_score_codex":0.0017292259,"about_ca_system_score_gemma":0.0013723536,"threshold_uncertainty_score":0.9343542},"labels":[],"label_agreement":null},{"id":"W1588666206","doi":"10.1007/11600930_22","title":"A Delay Pricing Scheme for Real-Time Delivery in Deadline-Based Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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 Manitoba","funders":"","keywords":"Computer science; Scheme (mathematics); Real-time computing; Control (management); Computer network; Mathematical optimization; Distributed computing; Operations research; Artificial intelligence","score_opus":0.01042588080052049,"score_gpt":0.22309381725762623,"score_spread":0.21266793645710574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588666206","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.03214569,0.0011575521,0.95771235,0.0005975429,0.0006638742,0.00017521398,0.00009457226,0.00084238854,0.0066109337],"genre_scores_gemma":[0.7152813,0.0011360267,0.2697326,0.00024772424,0.00037467148,0.00018700009,0.0001255567,0.00020427207,0.012710849],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989492,0.00025697163,0.00007474629,0.00010769863,0.0004410387,0.00017021825],"domain_scores_gemma":[0.99823403,0.00077048055,0.00008843474,0.0003454217,0.00038111614,0.00018049616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024031275,0.00064698164,0.0013528997,0.0007803403,0.0010152676,0.0018252097,0.0031208938,0.0009899206,0.0044067837],"category_scores_gemma":[0.006018642,0.0004133738,0.0006214636,0.0012634806,0.00077487325,0.0024517134,0.0013939363,0.0016413054,0.0006208843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081179244,0.000617302,0.0005453618,0.00030712548,0.00007906003,0.00026091715,0.00028595538,0.20021462,0.019060997,0.2866375,0.013842312,0.477337],"study_design_scores_gemma":[0.00011522937,0.00023865154,0.00020961296,0.000024803327,0.000045916586,0.00027708785,0.000037488928,0.9261901,0.0041100136,0.06040133,0.008300777,0.00004902949],"about_ca_topic_score_codex":0.0011458746,"about_ca_topic_score_gemma":0.0010921344,"teacher_disagreement_score":0.0044067837,"about_ca_system_score_codex":0.0018727195,"about_ca_system_score_gemma":0.0012120098,"threshold_uncertainty_score":0.014742136},"labels":[],"label_agreement":null},{"id":"W1588707965","doi":"10.1007/978-3-540-72788-0_29","title":"Minimum 2CNF Resolution Refutations in Polynomial Time","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Resolution (logic); Mathematics; Polynomial; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.08836979546489511,"score_gpt":0.3619736445370634,"score_spread":0.2736038490721683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588707965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11422159,0.0029386717,0.73932445,0.003376269,0.00096688914,0.00076453685,0.004285701,0.011245152,0.12287675],"genre_scores_gemma":[0.26692435,0.0008221874,0.6846609,0.00083447865,0.00031693978,0.00037696733,0.006615983,0.0026423126,0.03680589],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996711,0.00066213874,0.00020367523,0.0006315849,0.0011948075,0.00059673894],"domain_scores_gemma":[0.9891158,0.006238542,0.0005716262,0.0026427868,0.0012135337,0.00021765078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016004712,0.0017027038,0.0021171062,0.0024264927,0.0021200932,0.0029076834,0.0037888165,0.0027588354,0.039766025],"category_scores_gemma":[0.011878912,0.0013478423,0.0024255223,0.0041693137,0.0012271268,0.0063953525,0.0024436635,0.0034228975,0.006174956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006750862,0.00063696026,0.0012301875,0.001459959,0.00013985983,0.0002875913,0.00044610834,0.056456544,0.014301541,0.11370589,0.055400398,0.7552598],"study_design_scores_gemma":[0.0004748903,0.00027505375,0.0019580754,0.00033117388,0.0002584232,0.0012916307,0.0004601052,0.24114333,0.038493283,0.6521214,0.06305231,0.00014034532],"about_ca_topic_score_codex":0.0031055978,"about_ca_topic_score_gemma":0.011944997,"teacher_disagreement_score":0.039766025,"about_ca_system_score_codex":0.0017186579,"about_ca_system_score_gemma":0.0023098213,"threshold_uncertainty_score":0.1330306},"labels":[],"label_agreement":null},{"id":"W1588719833","doi":"10.1007/978-3-540-71496-5_37","title":"Ad Hoc Retrieval of Documents with Topical Opinion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Information retrieval; Computer science; Query expansion; Term (time); Document retrieval; Post hoc; Domain (mathematical analysis); Web query classification; Search engine; Web search query; World Wide Web; Mathematics","score_opus":0.025819386245428934,"score_gpt":0.28641662074595575,"score_spread":0.2605972345005268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588719833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23724905,0.012771611,0.6855689,0.0026426194,0.0035492976,0.002020263,0.009081325,0.009193385,0.037923526],"genre_scores_gemma":[0.44993994,0.005964368,0.46291482,0.0009496098,0.0039131287,0.0009007657,0.022351624,0.0006901308,0.052375574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877304,0.00019766766,0.00015334765,0.00020869683,0.00051375246,0.0001535266],"domain_scores_gemma":[0.9982761,0.0004893787,0.00015576463,0.0002345679,0.0007526595,0.00009150854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108512,0.0013759119,0.002022569,0.0055691903,0.0009487166,0.0026429384,0.001227874,0.0013008497,0.008253101],"category_scores_gemma":[0.003683801,0.00042254172,0.0011252398,0.005811735,0.00056163955,0.002982629,0.0013958185,0.00073552306,0.007865703],"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.0011356593,0.00055886875,0.0016796974,0.0011958744,0.0002412391,0.00040358782,0.0003074476,0.0030594233,0.11431606,0.0039055813,0.06082575,0.8123708],"study_design_scores_gemma":[0.0006505676,0.0035446994,0.011190342,0.00043613897,0.0020091669,0.004002826,0.0024530373,0.51380354,0.29009682,0.03381645,0.13773836,0.0002581801],"about_ca_topic_score_codex":0.00090770144,"about_ca_topic_score_gemma":0.0021519216,"teacher_disagreement_score":0.008253101,"about_ca_system_score_codex":0.0006199421,"about_ca_system_score_gemma":0.0011311738,"threshold_uncertainty_score":0.027609348},"labels":[],"label_agreement":null},{"id":"W1588731899","doi":"10.1007/978-3-540-27818-4_26","title":"An Architecture for Distributed Mathematical Web Services","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Western University","funders":"","keywords":"Computer science; Web service; Mathematical software; Java; Problem solving environment; Set (abstract data type); Software engineering; Server; Service-oriented architecture; Service (business); Architecture; Computation; Software; World Wide Web; Distributed computing; Programming language; Operating system","score_opus":0.013374813574525645,"score_gpt":0.25237071602450195,"score_spread":0.23899590244997632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588731899","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.009595385,0.0003245609,0.95630556,0.0007896882,0.0001870977,0.00013954692,0.00013732817,0.014183433,0.018337287],"genre_scores_gemma":[0.21315,0.0009495785,0.74060005,0.00041406596,0.00020022206,0.00037486063,0.0009956873,0.0021983688,0.04111718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993144,0.00014990613,0.000068734735,0.00007167233,0.00030292067,0.000092365066],"domain_scores_gemma":[0.9992773,0.0001674563,0.0000335975,0.00025956825,0.00015921734,0.000102804515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012512864,0.0004952828,0.00061494036,0.0010327494,0.0014277445,0.0035815635,0.0024195656,0.001506698,0.010363656],"category_scores_gemma":[0.0023290364,0.00081637705,0.0009030789,0.001460005,0.0012943242,0.0047454746,0.0033064256,0.0018467184,0.0037740364],"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.0002859849,0.0001917995,0.00055029563,0.00020198301,0.000056122844,0.00022706356,0.00048809318,0.020365767,0.0114084715,0.78719926,0.022216666,0.15680835],"study_design_scores_gemma":[0.00015375954,0.0000943749,0.0002840116,0.000070977236,0.000077428675,0.0003308521,0.00013321005,0.34225634,0.012778864,0.45582443,0.18793465,0.000061060986],"about_ca_topic_score_codex":0.0032202825,"about_ca_topic_score_gemma":0.0039196033,"teacher_disagreement_score":0.010363656,"about_ca_system_score_codex":0.0013654038,"about_ca_system_score_gemma":0.0015108652,"threshold_uncertainty_score":0.034669936},"labels":[],"label_agreement":null},{"id":"W1588849791","doi":"10.1007/11751540_11","title":"Fast Intersections for Subdivision Surfaces","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"University of Calgary","funders":"","keywords":"Subdivision; Computer science; Convex hull; Polygon mesh; Intersection (aeronautics); Subdivision surface; Property (philosophy); Hull; Bipartite graph; Graph; Algorithm; Regular polygon; Theoretical computer science; Computer graphics (images); Mathematics; Geometry; Cartography","score_opus":0.009627191011221174,"score_gpt":0.242175293476117,"score_spread":0.23254810246489582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588849791","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.030503493,0.0027291628,0.8784062,0.00023365037,0.00038913757,0.0000805671,0.00021954026,0.0027166193,0.08472155],"genre_scores_gemma":[0.30592296,0.0031549651,0.5759145,0.0001220345,0.0002253389,0.00019910654,0.0013350194,0.002202467,0.11092364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990631,0.00011111147,0.000027411914,0.000103129176,0.0006081184,0.00008715061],"domain_scores_gemma":[0.99922144,0.00034676064,0.00003269143,0.00017770728,0.00017260022,0.000048893602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181595,0.0009399156,0.0011668758,0.0016086425,0.0010523079,0.0024003626,0.00138146,0.0009315486,0.022541564],"category_scores_gemma":[0.002467834,0.00081077387,0.00082190224,0.0018483794,0.00092227105,0.0029000218,0.0030815585,0.0028653857,0.004994032],"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.00018720147,0.000066052744,0.00041377248,0.00021553949,0.000028715367,0.00009640984,0.0003414823,0.019285677,0.010770323,0.6161199,0.017802339,0.3346726],"study_design_scores_gemma":[0.000053688058,0.00011786589,0.00052456907,0.00010728876,0.0000397528,0.0005586715,0.00022485845,0.20115113,0.014981468,0.64773023,0.13446143,0.000049066904],"about_ca_topic_score_codex":0.0009431869,"about_ca_topic_score_gemma":0.0012266752,"teacher_disagreement_score":0.022541564,"about_ca_system_score_codex":0.00102323,"about_ca_system_score_gemma":0.00042576808,"threshold_uncertainty_score":0.075408995},"labels":[],"label_agreement":null},{"id":"W1588905512","doi":"10.1007/3-540-46429-8_2","title":"Layered Modeling of Hardware and Software, with Application to a LAN Extension Router","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Router; Software; Hardware architecture; Tracing; Embedded system; Queueing theory; Operating system; Computer architecture; Distributed computing; Computer network","score_opus":0.011254308787191433,"score_gpt":0.22622348761918207,"score_spread":0.21496917883199063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588905512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017171802,0.0003169196,0.9733455,0.00017406135,0.00004542225,0.000036524547,0.000059250597,0.00085970736,0.007990829],"genre_scores_gemma":[0.4505456,0.0013882017,0.5205194,0.00013519499,0.00007984587,0.00023788125,0.0002096103,0.0004525538,0.026431661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960834,0.000119837605,0.000026367718,0.000044266737,0.00014990292,0.000051370935],"domain_scores_gemma":[0.99934584,0.00025452828,0.00007039702,0.000105803985,0.00017114381,0.000052211846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077335915,0.0007723803,0.00065794645,0.0006409303,0.0006736189,0.0027423904,0.002172178,0.0013103724,0.0032040742],"category_scores_gemma":[0.0020250182,0.00096606737,0.0010506945,0.00093002757,0.0007398863,0.0022855795,0.0012624249,0.0014957088,0.0007502686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007705711,0.000083606814,0.00067302864,0.000055553413,0.00003813316,0.00019156508,0.00019732809,0.8434321,0.005629694,0.12845422,0.0009956,0.020172058],"study_design_scores_gemma":[0.00000498541,0.00000968353,0.00005947998,0.000004707823,0.0000150368705,0.000020912854,0.000011982861,0.990537,0.00046350452,0.007871631,0.0009942122,0.0000068475556],"about_ca_topic_score_codex":0.008947561,"about_ca_topic_score_gemma":0.010321034,"teacher_disagreement_score":0.008947561,"about_ca_system_score_codex":0.00094723137,"about_ca_system_score_gemma":0.0011453105,"threshold_uncertainty_score":0.017790914},"labels":[],"label_agreement":null},{"id":"W1588912065","doi":"10.1007/978-3-540-69132-7_108","title":"Using an Emotional Intelligent Agent to Reduce Resistance to Change","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Terrorism, Counterterrorism, and Political Violence","field":"Social Sciences","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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intelligent agent; Multi-agent system; Human–computer interaction; Artificial intelligence","score_opus":0.12043187335625631,"score_gpt":0.3595248876243088,"score_spread":0.23909301426805246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588912065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42665145,0.000555039,0.4476583,0.0035953012,0.0008127349,0.0005579582,0.00009796561,0.0040008714,0.11607031],"genre_scores_gemma":[0.9072387,0.00010863588,0.080789804,0.0005268747,0.00006925861,0.0001855418,0.00007237669,0.00008049072,0.010928264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00019644923,0.000025768728,0.00008151021,0.00011343411,0.000056529105],"domain_scores_gemma":[0.99914503,0.00045766722,0.00010570477,0.0001100173,0.00011487086,0.0000667649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139807,0.00046709267,0.00027741506,0.0003597716,0.000527307,0.0012831362,0.00086534506,0.0009303188,0.0053474363],"category_scores_gemma":[0.0033465375,0.00016573192,0.00029861394,0.000177517,0.00053364044,0.0010671898,0.0011330016,0.0008740557,0.00069523806],"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.0013247728,0.003526956,0.01068826,0.0005769454,0.00045201165,0.00096085365,0.005003592,0.08556798,0.06026423,0.06579068,0.023548383,0.74229527],"study_design_scores_gemma":[0.00043208903,0.0016601558,0.008319224,0.00013349684,0.00054591853,0.0005523289,0.00242747,0.8497368,0.028465472,0.05218318,0.05544572,0.00009811986],"about_ca_topic_score_codex":0.00040531464,"about_ca_topic_score_gemma":0.00071830966,"teacher_disagreement_score":0.0053474363,"about_ca_system_score_codex":0.00023105483,"about_ca_system_score_gemma":0.00027222364,"threshold_uncertainty_score":0.017888963},"labels":[],"label_agreement":null},{"id":"W1588921741","doi":"10.1007/978-3-642-37453-1_2","title":"PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":61,"is_retracted":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":"Tree (set theory); Computer science; Data mining; Tree structure; Uncertain data; K-ary tree; Algorithm; Mathematics; Binary tree","score_opus":0.04921570632610776,"score_gpt":0.29198430866385533,"score_spread":0.24276860233774758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588921741","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.013303653,0.0015503913,0.9644827,0.0004028047,0.00016737201,0.00024722773,0.009932318,0.008544936,0.0013685131],"genre_scores_gemma":[0.07486285,0.0013239054,0.90614223,0.00017123028,0.00013408704,0.00036556483,0.01470696,0.00057868205,0.0017143722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910456,0.00016007354,0.00013930342,0.00015187825,0.00039286583,0.000051185027],"domain_scores_gemma":[0.9967796,0.001610283,0.00031135118,0.0005626605,0.00058924145,0.00014686388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354448,0.00066210714,0.0013098371,0.0028312383,0.0007792064,0.0015708131,0.001719761,0.0010562646,0.00530022],"category_scores_gemma":[0.010958595,0.0005336254,0.0010341041,0.0050884094,0.00037951424,0.0037789533,0.0014325859,0.001165284,0.0023855576],"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.0008031389,0.00018287935,0.004160464,0.00140193,0.00021296614,0.00081308745,0.00053615327,0.028889913,0.009929457,0.031126445,0.05994149,0.862002],"study_design_scores_gemma":[0.00025368363,0.0004682561,0.002555156,0.00039923133,0.00023774849,0.002525632,0.00032978342,0.6675365,0.010467316,0.2111973,0.103906386,0.00012300094],"about_ca_topic_score_codex":0.0013633079,"about_ca_topic_score_gemma":0.0022781477,"teacher_disagreement_score":0.00530022,"about_ca_system_score_codex":0.0003915648,"about_ca_system_score_gemma":0.0013679992,"threshold_uncertainty_score":0.01773101},"labels":[],"label_agreement":null},{"id":"W1588928324","doi":"10.1007/3-540-44533-1_48","title":"Consistency in General CSPs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina; National Research Council Canada","funders":"","keywords":"Consistency (knowledge bases); Pairwise comparison; Local consistency; Constraint satisfaction problem; Tuple; Computer science; Weak consistency; Consistency model; Sequential consistency; Strong consistency; Constraint satisfaction; Representation (politics); Constraint (computer-aided design); Binary number; Eventual consistency; Theoretical computer science; Causal consistency; Algorithm; Mathematics; Artificial intelligence; Discrete mathematics; Statistics","score_opus":0.013041121607784405,"score_gpt":0.2299882166618353,"score_spread":0.2169470950540509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588928324","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.024232745,0.010036871,0.80349976,0.0037515778,0.00075362873,0.00020081371,0.00080992316,0.000875694,0.15583907],"genre_scores_gemma":[0.54153675,0.010654296,0.35667568,0.00153143,0.0019316047,0.0006946488,0.0035586513,0.0013680889,0.08204888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964084,0.0010346369,0.00029563258,0.0007348017,0.0012719006,0.00025456966],"domain_scores_gemma":[0.99473757,0.0029260737,0.00020613303,0.0012902129,0.0006862607,0.00015376614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003386151,0.00085245824,0.0017418467,0.0019847949,0.0021244131,0.0039947517,0.0024657806,0.0014691058,0.008522872],"category_scores_gemma":[0.009412581,0.001877831,0.001926367,0.0054944726,0.0046150256,0.013367042,0.003397936,0.006575615,0.0016298246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002663283,0.000017198448,0.000106459214,0.00015125987,0.00001659104,0.00004491272,0.00019825117,0.0035997864,0.00039265226,0.9698439,0.005039212,0.020563139],"study_design_scores_gemma":[0.000007529687,0.0000049521714,0.00005641086,0.00001969493,0.000008628769,0.000051959498,0.000027753385,0.0050385185,0.00028679153,0.98470914,0.009782001,0.000006634363],"about_ca_topic_score_codex":0.0019718702,"about_ca_topic_score_gemma":0.001641672,"teacher_disagreement_score":0.008522872,"about_ca_system_score_codex":0.0023983114,"about_ca_system_score_gemma":0.001638105,"threshold_uncertainty_score":0.028511822},"labels":[],"label_agreement":null},{"id":"W1588955337","doi":"10.1007/978-3-540-89447-6_22","title":"Ontology-Based Expertise Finding","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Ontology; Software deployment; Process (computing); Knowledge management; Software engineering; Process management; Engineering","score_opus":0.03454142542400076,"score_gpt":0.2621708452833169,"score_spread":0.22762941985931615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588955337","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.014932354,0.000977081,0.9672006,0.00029821234,0.00009503663,0.00013718556,0.00047775186,0.001612422,0.014269296],"genre_scores_gemma":[0.21560171,0.00084468874,0.77056956,0.000116781266,0.00006919431,0.00010767655,0.0022396105,0.00026032428,0.010190489],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790096,0.0003969608,0.00017929953,0.0005250179,0.0008490885,0.00014868422],"domain_scores_gemma":[0.99745756,0.0012290712,0.00010884549,0.0005207928,0.0005906345,0.000093228424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018031253,0.0006788766,0.001274305,0.005043325,0.0011074118,0.0028286318,0.0028104847,0.0014239671,0.009085128],"category_scores_gemma":[0.008720052,0.00054573704,0.0014586346,0.004316038,0.000841058,0.005406736,0.003481604,0.0013556909,0.0030466802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017232558,0.00025047318,0.0017274213,0.0003029896,0.00015685322,0.00022311311,0.00046743656,0.02282701,0.009470725,0.051856827,0.014578524,0.8979664],"study_design_scores_gemma":[0.00005117531,0.000071831746,0.0023922792,0.00015107634,0.00020138815,0.0007186433,0.00058436906,0.7508746,0.016574595,0.19352528,0.034784637,0.00007011546],"about_ca_topic_score_codex":0.006397486,"about_ca_topic_score_gemma":0.0079083275,"teacher_disagreement_score":0.009085128,"about_ca_system_score_codex":0.0010527009,"about_ca_system_score_gemma":0.0013898575,"threshold_uncertainty_score":0.030392766},"labels":[],"label_agreement":null},{"id":"W1589176872","doi":"10.1007/3-540-46766-1_35","title":"Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1043,"is_retracted":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":"Zero-knowledge proof; Ciphertext; Computer science; Computer security; Encryption; Cryptography","score_opus":0.024331450237070083,"score_gpt":0.2923114647678343,"score_spread":0.26798001453076425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589176872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024751702,0.0016671222,0.90748036,0.0040886644,0.00035500663,0.0002549809,0.0004975306,0.0010015945,0.059903007],"genre_scores_gemma":[0.8509163,0.0016706261,0.1117787,0.00084080343,0.00046575314,0.00041563963,0.0004507945,0.00025725798,0.033203986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995274,0.0031143024,0.00048410584,0.0011710207,0.0040295664,0.0012482188],"domain_scores_gemma":[0.9689214,0.023715345,0.0010563413,0.0047141565,0.0011327674,0.00046006113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049652806,0.001211224,0.0021739057,0.0013112469,0.0020901773,0.0067484793,0.0034483974,0.00349213,0.0075162556],"category_scores_gemma":[0.020506477,0.0014536689,0.0020323792,0.0020704968,0.006039407,0.013765522,0.00841188,0.0069244653,0.0024181665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033967884,0.000088998495,0.0002692504,0.00030499828,0.000074553034,0.0002848579,0.0005051927,0.014098136,0.0026934617,0.95155853,0.0047856104,0.024996633],"study_design_scores_gemma":[0.00006533627,0.000028956407,0.000093690716,0.000062697945,0.000034969657,0.00024545108,0.000031783893,0.045485668,0.0046645976,0.9451277,0.0041223112,0.00003675979],"about_ca_topic_score_codex":0.0007068241,"about_ca_topic_score_gemma":0.0004754313,"teacher_disagreement_score":0.0075162556,"about_ca_system_score_codex":0.0031047475,"about_ca_system_score_gemma":0.0031864827,"threshold_uncertainty_score":0.026259184},"labels":[],"label_agreement":null},{"id":"W1589180502","doi":"10.1007/11559573_113","title":"Automated Snake Initialization for the Segmentation of the Prostate in Ultrasound Images","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Computer science; Segmentation; Artificial intelligence; Image segmentation; Computer vision; Automation; Active contour model; Pattern recognition (psychology)","score_opus":0.015494784296847513,"score_gpt":0.2889345879727446,"score_spread":0.2734398036758971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589180502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011078791,0.00072442583,0.98306113,0.000090793845,0.000048658825,0.000066661196,0.00014024471,0.0033879464,0.0014013607],"genre_scores_gemma":[0.078659914,0.0007962353,0.9143378,0.00007984872,0.000036068468,0.00007851106,0.0004749657,0.0014025654,0.004133981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996853,0.00007477091,0.000016467746,0.00006351247,0.00012051249,0.00003952159],"domain_scores_gemma":[0.9994717,0.00025882077,0.00004000687,0.00009988845,0.000099470555,0.000030059817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074061676,0.0007533176,0.0008571,0.0012536704,0.00045489921,0.001128496,0.0011851658,0.0013721557,0.004127403],"category_scores_gemma":[0.0017781681,0.001204224,0.0009957218,0.0012547792,0.00048226374,0.00075605523,0.00088028365,0.0012531733,0.0022578398],"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.00046921967,0.00009293841,0.0008631751,0.00041489603,0.00010132656,0.00018782652,0.000282719,0.089330904,0.14447679,0.0071238615,0.011912046,0.74474436],"study_design_scores_gemma":[0.00004868736,0.00013418829,0.0024831193,0.00009827129,0.00007274313,0.000620961,0.000058437592,0.8801703,0.0935245,0.01002314,0.012699562,0.000066148095],"about_ca_topic_score_codex":0.0026498619,"about_ca_topic_score_gemma":0.005496164,"teacher_disagreement_score":0.004127403,"about_ca_system_score_codex":0.0005926772,"about_ca_system_score_gemma":0.0011331971,"threshold_uncertainty_score":0.013807595},"labels":[],"label_agreement":null},{"id":"W1589264773","doi":"10.1007/978-3-642-35551-6_4","title":"Abstracting Context in Event-Based Software","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Event (particle physics); Ubiquitous computing; Software deployment; Context (archaeology); Communications protocol; Software system; Software; Mobile device; Distributed computing; Software engineering; Human–computer interaction; Computer network; Operating system","score_opus":0.01853502410088839,"score_gpt":0.25120466252222323,"score_spread":0.23266963842133484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589264773","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.010041559,0.002781722,0.9741088,0.00031352564,0.000239057,0.000037804617,0.00004209606,0.0007186494,0.011716771],"genre_scores_gemma":[0.50557536,0.0066607725,0.46278203,0.0002946907,0.0005665234,0.00017190976,0.00032815483,0.00040383215,0.023216773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991708,0.00023127117,0.00009202088,0.00016507572,0.0002602085,0.00008053907],"domain_scores_gemma":[0.9987735,0.00074281904,0.000064565706,0.00025534726,0.00009716922,0.00006662083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010335344,0.0009505248,0.0006517569,0.0006098267,0.0006380788,0.00295461,0.0013193231,0.0008868162,0.0033936277],"category_scores_gemma":[0.0034693205,0.00055870356,0.0008293778,0.0010756539,0.0019182722,0.005262769,0.0022156064,0.0025857105,0.00070213364],"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.00009082208,0.00003980575,0.0002851042,0.00024976896,0.000032564505,0.0002496511,0.0008656842,0.024085393,0.003331633,0.85462713,0.0016644858,0.114478],"study_design_scores_gemma":[0.000025993033,0.00004117516,0.00012874168,0.000095480915,0.000057748857,0.00015722816,0.00011956157,0.06108645,0.0033717698,0.8987294,0.03616135,0.000025075378],"about_ca_topic_score_codex":0.0010114406,"about_ca_topic_score_gemma":0.00094865565,"teacher_disagreement_score":0.0033936277,"about_ca_system_score_codex":0.0005321928,"about_ca_system_score_gemma":0.00045641098,"threshold_uncertainty_score":0.0113527775},"labels":[],"label_agreement":null},{"id":"W1589331835","doi":"10.1007/11424918_9","title":"Heuristic Search Applied to Abstract Combat Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":63,"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":"Computer science; Heuristic; Adversarial system; Tournament; Artificial intelligence; Mathematical optimization; Theoretical computer science; Operations research; Mathematics","score_opus":0.03450216205097408,"score_gpt":0.29190051913592235,"score_spread":0.2573983570849483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589331835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029855495,0.0012637858,0.9155656,0.00031689488,0.00025973064,0.00018256635,0.0001262937,0.0006835953,0.05174613],"genre_scores_gemma":[0.5191609,0.0012133255,0.45034465,0.00014260519,0.00015859285,0.00042993526,0.00030646313,0.00032794423,0.027915526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.0002233347,0.000023069928,0.000046715737,0.000113873866,0.000057788213],"domain_scores_gemma":[0.99897563,0.0007732747,0.000037465186,0.00006740011,0.00010291698,0.000043312208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075908046,0.0008415679,0.0012482628,0.0009730551,0.00072116824,0.0012901605,0.001325956,0.0010630175,0.007682535],"category_scores_gemma":[0.00412795,0.00045881802,0.0006725438,0.0015565293,0.0009983925,0.0010375506,0.0010202996,0.0013294765,0.0006067161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013462872,0.00008338514,0.00023287017,0.00019213685,0.000047425052,0.000077791796,0.00015157385,0.6765925,0.00068985444,0.18466225,0.006019976,0.13111554],"study_design_scores_gemma":[0.000038454855,0.00003130394,0.00007324739,0.000021909578,0.000012213814,0.000015756726,0.000023191587,0.918103,0.00023656616,0.07917517,0.0022609916,0.000008236741],"about_ca_topic_score_codex":0.008775077,"about_ca_topic_score_gemma":0.007777463,"teacher_disagreement_score":0.008775077,"about_ca_system_score_codex":0.0011471836,"about_ca_system_score_gemma":0.0014330981,"threshold_uncertainty_score":0.025700629},"labels":[],"label_agreement":null},{"id":"W1589457235","doi":"10.1007/978-3-540-39903-2_16","title":"3D Reconstruction from Truncated Rotational Angiograms Using Linear Prediction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Robarts Clinical Trials","funders":"Canadian Institutes of Health Research; Heart and Stroke Foundation of Canada","keywords":"Extrapolation; Truncation (statistics); Computer science; Computer vision; Iterative reconstruction; Artificial intelligence; Imaging phantom; Visualization; 3D reconstruction; Field of view; Algorithm; Mathematics; Optics; Physics","score_opus":0.030587785094602218,"score_gpt":0.28838442718793245,"score_spread":0.25779664209333025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589457235","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.010801237,0.00023853483,0.9853462,0.00009926234,0.000033452467,0.000028262422,0.00020670122,0.0021370472,0.0011092693],"genre_scores_gemma":[0.12732904,0.00092469866,0.86741585,0.0000904377,0.000053999163,0.000060227205,0.0007804776,0.00072356645,0.0026216614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974245,0.0000607627,0.000016830507,0.0000347597,0.00012092107,0.000024267662],"domain_scores_gemma":[0.99918586,0.00038588865,0.00007057045,0.00019478938,0.0001279446,0.00003497958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057633454,0.0009270903,0.00083779416,0.0008823453,0.00021541638,0.0016279342,0.00078725367,0.0009980106,0.00499361],"category_scores_gemma":[0.0019821932,0.0011820288,0.0008689629,0.0010755156,0.00036654764,0.0009171011,0.0010335594,0.0013193632,0.002314634],"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.0007869296,0.00013775908,0.0019256788,0.00043093934,0.00014836897,0.0008987738,0.00022540223,0.23480076,0.104926996,0.012900095,0.0127862,0.63003206],"study_design_scores_gemma":[0.000019866024,0.0000416044,0.00059251074,0.000023728428,0.0000307262,0.0007664106,0.000017275233,0.9738766,0.018337777,0.0037804276,0.002480574,0.00003243873],"about_ca_topic_score_codex":0.0017459241,"about_ca_topic_score_gemma":0.002437776,"teacher_disagreement_score":0.00499361,"about_ca_system_score_codex":0.00031477748,"about_ca_system_score_gemma":0.00069820805,"threshold_uncertainty_score":0.016705334},"labels":[],"label_agreement":null},{"id":"W1589468053","doi":"10.1007/978-3-540-30136-3_85","title":"Temporal Lobe Epilepsy Surgical Outcome Prediction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Epilepsy research and treatment","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Temporal lobe; Voxel; Epilepsy; White matter; Voxel-based morphometry; Magnetic resonance imaging; Medicine; Radiology; Neuroscience; Psychology","score_opus":0.030338037188395256,"score_gpt":0.3064175191935052,"score_spread":0.2760794820051099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589468053","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25647724,0.04060229,0.30169708,0.014401204,0.002286905,0.00013596917,0.008879669,0.0029553233,0.37256432],"genre_scores_gemma":[0.8118062,0.020202557,0.04300819,0.00079717895,0.0011869688,0.000084765714,0.007256622,0.0002261704,0.1154313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999474,0.000010982737,0.0000034265097,0.000007308653,0.000022967288,0.0000078534185],"domain_scores_gemma":[0.9997948,0.00014283572,0.000016433622,0.000010344093,0.000021448224,0.000014142908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026303536,0.00026300477,0.00017282052,0.0003796648,0.000053399486,0.00034548188,0.00028885502,0.00018994548,0.005789431],"category_scores_gemma":[0.0009589219,0.00007837733,0.00017488119,0.00028842626,0.00007784074,0.00026259935,0.00017237947,0.0003126939,0.0017662866],"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.00007603926,0.00003692357,0.023803448,0.000066262626,0.000025678,0.0002604567,0.000029392619,0.0057523544,0.0008370244,0.0037404536,0.061118077,0.90425384],"study_design_scores_gemma":[0.000106726664,0.000645862,0.2742208,0.0011536813,0.00039685375,0.015160477,0.0004965997,0.24095581,0.018974356,0.15370722,0.29402074,0.00016096966],"about_ca_topic_score_codex":0.0012290722,"about_ca_topic_score_gemma":0.0029134566,"teacher_disagreement_score":0.005789431,"about_ca_system_score_codex":0.0001296139,"about_ca_system_score_gemma":0.00021949435,"threshold_uncertainty_score":0.019367576},"labels":[],"label_agreement":null},{"id":"W1589541268","doi":"10.1007/978-3-540-74260-9_92","title":"Adaptive Mesh Generation of MRI Images for 3D Reconstruction of Human Trunk","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Laurentian University; Polytechnique Montréal","funders":"","keywords":"Metric (unit); Mesh generation; Triangulation; Laplacian smoothing; Computer science; Mathematics; Algorithm; Artificial intelligence; Computer vision; Finite element method; Geometry; Engineering; Structural engineering","score_opus":0.03575206624247193,"score_gpt":0.25545876448845445,"score_spread":0.21970669824598252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589541268","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.014612482,0.00030382167,0.98145264,0.00009157081,0.00005412533,0.00005415662,0.00013701487,0.0010433418,0.0022508646],"genre_scores_gemma":[0.20681438,0.00072103617,0.78613997,0.000105705185,0.000046779078,0.00010855372,0.00052906177,0.00062807754,0.004906505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998909,0.000021255793,0.0000069475036,0.000015855989,0.00005420098,0.000010753539],"domain_scores_gemma":[0.9997863,0.00010548743,0.0000130657045,0.000044568922,0.000041932162,0.000008602636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002588286,0.0003800729,0.00037579416,0.000714764,0.00013836064,0.00050768687,0.0007116836,0.0007137281,0.003941206],"category_scores_gemma":[0.00075204275,0.00040396687,0.0006524284,0.00058579893,0.00016661957,0.00031521954,0.0004660475,0.0004983159,0.00097331696],"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.00024876546,0.00007700722,0.0012847659,0.00041096943,0.000079925456,0.00043608964,0.00029505978,0.20964131,0.21161126,0.006957146,0.008639518,0.5603181],"study_design_scores_gemma":[0.000018610624,0.00005487062,0.0010234269,0.000032233867,0.000031685315,0.00071618037,0.000034880515,0.94740254,0.041205987,0.0037909271,0.005665583,0.000023154429],"about_ca_topic_score_codex":0.0010115568,"about_ca_topic_score_gemma":0.0016076082,"teacher_disagreement_score":0.003941206,"about_ca_system_score_codex":0.00017217857,"about_ca_system_score_gemma":0.00027971744,"threshold_uncertainty_score":0.013184667},"labels":[],"label_agreement":null},{"id":"W1589632079","doi":"10.1007/978-3-540-24593-3_22","title":"Supporting Dynamic Changes in Web Service Environments","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":37,"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":"Canadian Institute of Steel Construction; National Science Foundation","keywords":"Web service; WS-Policy; WS-I Basic Profile; World Wide Web; SOAP; Web standards; WS-Addressing; Web modeling; Computer science; Web development; Services computing; Devices Profile for Web Services; Service-oriented architecture; Data Web; XML; Web application security","score_opus":0.009031780908115308,"score_gpt":0.23700051891030863,"score_spread":0.2279687380021933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589632079","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14731537,0.0013301865,0.781452,0.000976588,0.00040332883,0.00019507617,0.00012682317,0.014178782,0.054021925],"genre_scores_gemma":[0.84496176,0.0011126959,0.13094154,0.00021011797,0.00015917953,0.00012914916,0.0003715492,0.0012802472,0.020833695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992694,0.00012998281,0.000047110392,0.000089240355,0.00031377634,0.00015052053],"domain_scores_gemma":[0.99825555,0.00087135454,0.00008784856,0.0004206429,0.0002091233,0.00015555404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092615443,0.00044533794,0.00050603796,0.0005144677,0.0006882768,0.0023933437,0.0015448137,0.0011164551,0.0037590582],"category_scores_gemma":[0.0043846173,0.00057344855,0.0003446351,0.00068119937,0.0009285896,0.004521153,0.0024676144,0.0017470405,0.0012399247],"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.0009813141,0.0004528483,0.0024327235,0.0004176886,0.000053262705,0.001427447,0.0025581368,0.069950335,0.063574485,0.16444907,0.016564898,0.67713785],"study_design_scores_gemma":[0.00018019516,0.00027406894,0.001442755,0.00013074056,0.00009887467,0.00116284,0.0008003187,0.61318326,0.06629886,0.17730603,0.13902192,0.00010018235],"about_ca_topic_score_codex":0.0010750905,"about_ca_topic_score_gemma":0.0012511178,"teacher_disagreement_score":0.0037590582,"about_ca_system_score_codex":0.0004846423,"about_ca_system_score_gemma":0.00047180086,"threshold_uncertainty_score":0.012575269},"labels":[],"label_agreement":null},{"id":"W1589644135","doi":"10.1007/978-3-642-38457-8_16","title":"Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Guelph","funders":"","keywords":"Computer science; Hyperbolic tree; Set (abstract data type); Constraint (computer-aided design); Probabilistic logic; Tree (set theory); Boundary (topology); Multi-agent system; Theoretical computer science; Inference; Artificial intelligence; Mathematics; Programming language","score_opus":0.02377325258255158,"score_gpt":0.2171652799582494,"score_spread":0.19339202737569783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589644135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03840782,0.00014063301,0.95344466,0.00008497127,0.00003152359,0.0000892719,0.00016787177,0.0011776399,0.006455701],"genre_scores_gemma":[0.24469693,0.00013022305,0.7509599,0.000036109803,0.000011562771,0.00013762561,0.0007709888,0.0002938339,0.002962827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995097,0.00006824661,0.00004263943,0.00017060996,0.00013847889,0.00007033501],"domain_scores_gemma":[0.9993,0.00014582399,0.000058571157,0.00020926546,0.00019944916,0.00008686705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041803106,0.00044073188,0.000850419,0.0018624264,0.0011900017,0.0022696143,0.0017484266,0.0010753784,0.005225014],"category_scores_gemma":[0.001786761,0.0007418091,0.0010784818,0.0012863354,0.0011635171,0.0028284367,0.0024744514,0.0012099526,0.001564035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026539477,0.00020915057,0.004990312,0.00045922797,0.00007529816,0.0005282114,0.0018713777,0.08760484,0.07551597,0.23471893,0.008486042,0.5852752],"study_design_scores_gemma":[0.00001516576,0.000058108417,0.0014178857,0.000077776196,0.00005021532,0.0002963867,0.0006563246,0.8680304,0.023971982,0.094640836,0.010744258,0.000040646064],"about_ca_topic_score_codex":0.0025168543,"about_ca_topic_score_gemma":0.003576032,"teacher_disagreement_score":0.005225014,"about_ca_system_score_codex":0.00070841017,"about_ca_system_score_gemma":0.0009633932,"threshold_uncertainty_score":0.01747936},"labels":[],"label_agreement":null},{"id":"W1589704098","doi":"10.1007/11569510_36","title":"A Novel Approach Towards Autonomic Management in Context-Aware Communication Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ontology; Context management; Context (archaeology); Abstraction; Hierarchy; Event (particle physics); Autonomic computing; Software engineering; Knowledge management; World Wide Web; Human–computer interaction; Ubiquitous computing","score_opus":0.01878265761439453,"score_gpt":0.2371735395389163,"score_spread":0.21839088192452177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589704098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005770203,0.0012565628,0.97132677,0.0010613088,0.0004422601,0.00008259004,0.000021164384,0.0006305464,0.019408608],"genre_scores_gemma":[0.3141319,0.002454391,0.6595824,0.00083955616,0.0009629654,0.00038682244,0.000095840966,0.0001957204,0.021350509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908936,0.00020157207,0.000058753812,0.0001698236,0.00038927936,0.000091255446],"domain_scores_gemma":[0.999529,0.000137511,0.000033500495,0.00014976483,0.00008258653,0.000067650915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077738747,0.00051116385,0.0007172019,0.00057103316,0.001255705,0.0033024268,0.0016542958,0.0013466201,0.002407938],"category_scores_gemma":[0.0012594867,0.00040615766,0.0007629403,0.00068530254,0.001313889,0.0035715236,0.0026773405,0.002499551,0.00065091794],"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.00008081534,0.00015782395,0.0003342156,0.00020802248,0.000088366556,0.0004529209,0.0007269511,0.020897055,0.018087244,0.77813405,0.007140174,0.17369232],"study_design_scores_gemma":[0.000048874077,0.00016239464,0.0003869436,0.00010049737,0.00012625984,0.001182817,0.0002484529,0.39976317,0.009418397,0.47266963,0.115826726,0.00006576262],"about_ca_topic_score_codex":0.0006173948,"about_ca_topic_score_gemma":0.0010538071,"teacher_disagreement_score":0.0033024268,"about_ca_system_score_codex":0.00057662,"about_ca_system_score_gemma":0.00070583663,"threshold_uncertainty_score":0.008055329},"labels":[],"label_agreement":null},{"id":"W1589766746","doi":"10.1007/11734628_11","title":"Defender Personality Traits","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personality Traits and Psychology","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Computer science; Big Five personality traits; Personality; Artificial intelligence; Psychology; Social psychology","score_opus":0.044893809333161616,"score_gpt":0.31372683286287967,"score_spread":0.26883302352971805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589766746","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28935847,0.009718394,0.011575892,0.0030122206,0.00050266384,0.000067248424,0.00077829865,0.00036803214,0.68461883],"genre_scores_gemma":[0.6704037,0.0039643464,0.0030445862,0.00030985728,0.00020556709,0.000036169597,0.0004885278,0.000058662987,0.32148862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99988174,0.00001828259,0.000003974666,0.000022686512,0.0000536884,0.000019690639],"domain_scores_gemma":[0.9997055,0.00008888858,0.000055971956,0.000040174,0.00004167042,0.00006770637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033822036,0.00046108518,0.00021721964,0.0008040407,0.0003359392,0.0008254345,0.00020833651,0.00030167663,0.024329724],"category_scores_gemma":[0.0014976242,0.00013714132,0.00010473427,0.00052079296,0.0002717859,0.00048751268,0.0004884341,0.00097033696,0.0064978055],"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.00012019019,0.00021603866,0.067927875,0.00013312256,0.000055863522,0.00029849436,0.0032835302,0.00070227,0.0071443724,0.05892549,0.05192786,0.80926484],"study_design_scores_gemma":[0.000023701159,0.00044222648,0.5814031,0.0002862986,0.000067317655,0.004592014,0.0015583112,0.0013184174,0.002507341,0.057025146,0.35072723,0.00004884538],"about_ca_topic_score_codex":0.00025007062,"about_ca_topic_score_gemma":0.0005379282,"teacher_disagreement_score":0.024329724,"about_ca_system_score_codex":0.00016926236,"about_ca_system_score_gemma":0.00009838982,"threshold_uncertainty_score":0.08139104},"labels":[],"label_agreement":null},{"id":"W1589775371","doi":"10.1007/978-3-540-87559-8_11","title":"Mimicking Go Experts with Convolutional Neural Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Machine learning; State (computer science); Artificial neural network; Algorithm","score_opus":0.028881556222992683,"score_gpt":0.25203080996713795,"score_spread":0.22314925374414527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589775371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13428372,0.00047695293,0.7557844,0.0014269567,0.00022570758,0.00007615717,0.00013633845,0.0007223035,0.106867515],"genre_scores_gemma":[0.9117844,0.00039500443,0.047898233,0.00025660053,0.000057867663,0.000072898714,0.0001010561,0.000088517896,0.039345354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998036,0.000070245675,0.000005984118,0.000038365088,0.000041176103,0.000040684976],"domain_scores_gemma":[0.99920636,0.00055146636,0.000064050626,0.00007714363,0.00003727474,0.00006371385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046806026,0.0005716583,0.0004186029,0.00026781735,0.00028435225,0.00073875446,0.00085940654,0.0013741114,0.006808908],"category_scores_gemma":[0.0033077316,0.00033462295,0.0004304026,0.00024866572,0.0008395687,0.0016470632,0.0012467994,0.0013932734,0.00057414855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018853274,0.0000692957,0.00072462327,0.00010588929,0.000058944916,0.000123706,0.0001438166,0.58294326,0.0035128307,0.36059356,0.004631494,0.04690404],"study_design_scores_gemma":[0.000015164716,0.0000232276,0.000121802026,0.000012679965,0.000008650382,0.000029548284,0.000020000083,0.846444,0.00066868315,0.15148364,0.001163467,0.000009123739],"about_ca_topic_score_codex":0.0017876576,"about_ca_topic_score_gemma":0.0025341457,"teacher_disagreement_score":0.006808908,"about_ca_system_score_codex":0.0005623027,"about_ca_system_score_gemma":0.0003738416,"threshold_uncertainty_score":0.022778034},"labels":[],"label_agreement":null},{"id":"W1589843944","doi":"10.1007/11687238_86","title":"Querying Mediated Geographic Data Sources","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Saint Paul University","funders":"","keywords":"Computer science; Geographic information system; The Internet; Publication; World Wide Web; Data science; Database; Geography; Remote sensing; Business","score_opus":0.022745212040741536,"score_gpt":0.2476046827282162,"score_spread":0.22485947068747467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589843944","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.030175265,0.0020483804,0.9109677,0.0014116246,0.00025800325,0.0002181331,0.0029349755,0.011490275,0.040495522],"genre_scores_gemma":[0.37804106,0.0044383914,0.52840585,0.00065929285,0.00031454497,0.00030616813,0.016613951,0.0019939952,0.06922682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779296,0.0003966991,0.00016836444,0.00030521333,0.0012405032,0.000096355965],"domain_scores_gemma":[0.99829084,0.00065636483,0.0000593491,0.0006637678,0.00027615522,0.000053400516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018218359,0.00080949825,0.0012404432,0.0027603174,0.0009492253,0.007108356,0.0032460252,0.0017535007,0.012113754],"category_scores_gemma":[0.0068717655,0.000792643,0.0010351796,0.0050685857,0.0012119903,0.0073391325,0.0047608786,0.0012356091,0.0047202483],"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.00032080276,0.00019384715,0.004164084,0.0011118056,0.00036199254,0.0015040735,0.0033061407,0.024772696,0.024790162,0.41929758,0.05440097,0.46577573],"study_design_scores_gemma":[0.00008438266,0.00009299796,0.00156361,0.00027935876,0.00025650734,0.002053485,0.0017952747,0.23005742,0.05290432,0.3137391,0.39702564,0.00014790733],"about_ca_topic_score_codex":0.0038568398,"about_ca_topic_score_gemma":0.0057444316,"teacher_disagreement_score":0.012113754,"about_ca_system_score_codex":0.0011404179,"about_ca_system_score_gemma":0.0008190548,"threshold_uncertainty_score":0.040524542},"labels":[],"label_agreement":null},{"id":"W1589846406","doi":"10.1007/978-3-662-45472-5_31","title":"Mixcoin: Anonymity for Bitcoin with Accountable Mixes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":416,"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":"Anonymity; Computer science; Cryptocurrency; Computer security; Scheme (mathematics); Property (philosophy); Protocol (science); Incentive; Payment; World Wide Web; Microeconomics","score_opus":0.012348257259306019,"score_gpt":0.22776764371248767,"score_spread":0.21541938645318165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589846406","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.016096441,0.0013665003,0.91394466,0.0018337223,0.0006348541,0.00019247994,0.000441401,0.0035116023,0.061978415],"genre_scores_gemma":[0.70569795,0.0024852802,0.17298786,0.0009915164,0.0010094892,0.00059779896,0.0010259371,0.0025515563,0.112652645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640995,0.0011490803,0.00018276442,0.00045045477,0.0013923019,0.0004153739],"domain_scores_gemma":[0.9972626,0.0011065556,0.000162455,0.0009243771,0.00035143847,0.00019251503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020915084,0.0010477878,0.0010291885,0.0011711417,0.0023477827,0.0064674593,0.0012289236,0.0018662314,0.012824136],"category_scores_gemma":[0.0063527552,0.00062678475,0.0007646031,0.0021378056,0.0026514512,0.01032899,0.0055142036,0.0045186616,0.005500884],"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.00040903373,0.00007304931,0.00034958727,0.00018903133,0.00004102696,0.00016750202,0.0005498474,0.0071639386,0.0046891007,0.8536244,0.022945078,0.10979836],"study_design_scores_gemma":[0.000040588115,0.000047211674,0.00018456217,0.000093222465,0.000030003528,0.00044482813,0.00013930167,0.054943945,0.009546166,0.8431995,0.09126374,0.000066998946],"about_ca_topic_score_codex":0.0003850974,"about_ca_topic_score_gemma":0.0004390761,"teacher_disagreement_score":0.012824136,"about_ca_system_score_codex":0.0014575912,"about_ca_system_score_gemma":0.00117153,"threshold_uncertainty_score":0.04290104},"labels":[],"label_agreement":null},{"id":"W1589918475","doi":"10.1007/978-3-540-27772-9_54","title":"Mining Web Sequential Patterns Incrementally with Revised PLWAP Tree","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Data mining; Tree (set theory); Web mining; Web page; Data stream mining; Point (geometry); Information retrieval; Database; World Wide Web","score_opus":0.019759765246205315,"score_gpt":0.24710461450956425,"score_spread":0.22734484926335893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589918475","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.11610786,0.0011258734,0.86186475,0.00055759493,0.0002348831,0.00078433973,0.0068354914,0.0094344765,0.0030548251],"genre_scores_gemma":[0.20926714,0.00045008303,0.7742953,0.00013497985,0.00010711269,0.0003238931,0.011667348,0.00032503367,0.0034291525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989492,0.000103164835,0.00013962275,0.0002536629,0.00046261383,0.00009175127],"domain_scores_gemma":[0.9978777,0.0007059289,0.00015874601,0.0004402993,0.0007026823,0.000114656694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007166588,0.00055899465,0.0009673214,0.0039877756,0.000642865,0.0012939742,0.0015832018,0.0006453441,0.0022090457],"category_scores_gemma":[0.004872772,0.0005944584,0.0011952417,0.0041562007,0.0002644778,0.0024100968,0.0010230503,0.0008141277,0.0013038799],"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.0005740265,0.00035789824,0.016301641,0.0005633505,0.00022752672,0.0009652485,0.0002133176,0.020074349,0.020734621,0.004042442,0.017531402,0.9184141],"study_design_scores_gemma":[0.0001251879,0.0003823242,0.00733787,0.000108686945,0.00042824526,0.0023093356,0.00027338255,0.9129747,0.022094028,0.030316005,0.02360146,0.000048803362],"about_ca_topic_score_codex":0.002639169,"about_ca_topic_score_gemma":0.0063349074,"teacher_disagreement_score":0.0039877756,"about_ca_system_score_codex":0.0002729253,"about_ca_system_score_gemma":0.0011588284,"threshold_uncertainty_score":0.0073899627},"labels":[],"label_agreement":null},{"id":"W1589928829","doi":"10.1007/978-3-642-12275-0_43","title":"Promoting Ranking Diversity for Biomedical Information Retrieval Using Wikipedia","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","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":"York University","funders":"","keywords":"Ranking (information retrieval); Computer science; Information retrieval; Relevance (law); Diversity (politics); Query expansion; Filter (signal processing); Relevance feedback; Learning to rank; Artificial intelligence; Image retrieval","score_opus":0.024774347551125512,"score_gpt":0.30268912652996066,"score_spread":0.27791477897883515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589928829","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.1936061,0.012110898,0.7529176,0.0023937742,0.0011812807,0.00045531965,0.0020585365,0.010704769,0.024571808],"genre_scores_gemma":[0.5310697,0.0028634702,0.44461688,0.0007129213,0.00120074,0.00030642163,0.006070005,0.0010456702,0.012114162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973248,0.001134441,0.00020258024,0.0003605069,0.00078196893,0.00019564359],"domain_scores_gemma":[0.99077225,0.0049446123,0.0003886969,0.001008654,0.002438415,0.00044745734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031214817,0.0009282809,0.0013990327,0.0065906956,0.0016676307,0.0025049509,0.0013160468,0.00097036985,0.003394087],"category_scores_gemma":[0.0136217335,0.00061137526,0.0008244492,0.0050814087,0.0005392933,0.005249027,0.002967403,0.0013155375,0.0023600145],"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.00063518586,0.00085074984,0.0051305853,0.0010985609,0.0004184721,0.0002642953,0.00084351416,0.014783606,0.058714427,0.015313376,0.06270889,0.8392383],"study_design_scores_gemma":[0.00043276153,0.0011768362,0.0116997715,0.0004162216,0.0011355135,0.0021168576,0.0015786522,0.62322485,0.12604098,0.12437776,0.10731771,0.00048207553],"about_ca_topic_score_codex":0.0020047524,"about_ca_topic_score_gemma":0.0068234676,"teacher_disagreement_score":0.0065906956,"about_ca_system_score_codex":0.0005756173,"about_ca_system_score_gemma":0.00124991,"threshold_uncertainty_score":0.016508162},"labels":[],"label_agreement":null},{"id":"W1590192012","doi":"10.1007/978-3-540-45242-3_29","title":"Refactoring the Scenario Specification: A Message Sequence Chart Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Computer science; Code refactoring; Programming language; Chart; Sequence (biology); Software engineering; Software","score_opus":0.0835306875495944,"score_gpt":0.28856179294357504,"score_spread":0.20503110539398062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590192012","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.0036535147,0.00006150073,0.9859897,0.0002966906,0.00004138042,0.0005698407,0.00048062572,0.0055537764,0.0033529447],"genre_scores_gemma":[0.06832686,0.0002761047,0.9214658,0.00020286972,0.000045553083,0.0006375585,0.002225791,0.0017663852,0.0050529772],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920202,0.0030298156,0.00093590707,0.00086013664,0.0027435846,0.00041037155],"domain_scores_gemma":[0.9800143,0.011914664,0.0016337472,0.00316489,0.002885771,0.00038662736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010178095,0.0018946426,0.001234344,0.0038746381,0.0014357085,0.005291218,0.003949648,0.003084139,0.01270056],"category_scores_gemma":[0.027012102,0.0016499809,0.0021007874,0.0021063285,0.001838696,0.006180676,0.002653967,0.0031641074,0.0037981975],"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.00082295534,0.0006089431,0.0036477125,0.001684241,0.0002186444,0.0035937054,0.0058313715,0.1253097,0.037797127,0.34823385,0.021402055,0.4508497],"study_design_scores_gemma":[0.00021571301,0.00035473314,0.00078838354,0.0009702898,0.00033055767,0.0009418382,0.0008889423,0.6127417,0.08739526,0.15965377,0.13539651,0.0003223068],"about_ca_topic_score_codex":0.0059326915,"about_ca_topic_score_gemma":0.0047234283,"teacher_disagreement_score":0.01270056,"about_ca_system_score_codex":0.001695657,"about_ca_system_score_gemma":0.003989486,"threshold_uncertainty_score":0.053827524},"labels":[],"label_agreement":null},{"id":"W1590193760","doi":"10.1007/3-540-45740-2_7","title":"Petri Net Based Design and Implementation Methodology for Discrete Event Control Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Western University","funders":"","keywords":"Petri net; Computer science; Executable; Programmable logic controller; Event (particle physics); Controller (irrigation); Embedded system; Programming language; Operating system","score_opus":0.07024340178231814,"score_gpt":0.33464791476291417,"score_spread":0.26440451298059603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590193760","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.00036623873,0.00005438194,0.99803895,0.000026005418,0.00003124921,0.000055864257,0.00001216947,0.00028895517,0.0011261803],"genre_scores_gemma":[0.049100116,0.00037826094,0.9434384,0.00008938293,0.00003352154,0.0004959471,0.00012443792,0.00017311607,0.0061668395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987196,0.00036461258,0.00011969509,0.00015689016,0.00054767885,0.0000916583],"domain_scores_gemma":[0.99940526,0.00024410037,0.00003911376,0.000099539386,0.00017830872,0.00003367054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017917652,0.0011001748,0.0007254059,0.0007230679,0.00058558065,0.0018863094,0.0025903534,0.001114209,0.0067373146],"category_scores_gemma":[0.0016563595,0.0008646103,0.001165686,0.0005760737,0.00090135826,0.0015473954,0.0007684727,0.0017948766,0.0015116947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015954924,0.0002289722,0.00030924325,0.000874307,0.00016243654,0.00033984496,0.00027501988,0.23540694,0.026180672,0.47954336,0.004139989,0.2523797],"study_design_scores_gemma":[0.00010892845,0.00022707727,0.00016459818,0.00018157484,0.0001685314,0.00025637922,0.000055997276,0.79172283,0.029602418,0.11959761,0.057865024,0.000049082533],"about_ca_topic_score_codex":0.00236759,"about_ca_topic_score_gemma":0.003228999,"teacher_disagreement_score":0.0067373146,"about_ca_system_score_codex":0.0009224306,"about_ca_system_score_gemma":0.0019988318,"threshold_uncertainty_score":0.022538602},"labels":[],"label_agreement":null},{"id":"W1590216518","doi":"10.1007/978-3-642-02611-9_5","title":"Enhancement of the Quality of Images through Complex Mosaic Configurations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Pixel; Rendering (computer graphics); Cichlid; Mosaic; Subpixel rendering; Biology; Fish <Actinopterygii>","score_opus":0.06270008420162468,"score_gpt":0.3472903328194275,"score_spread":0.2845902486178028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590216518","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.2507923,0.0018393429,0.7319644,0.0001499323,0.00008972448,0.00007816711,0.00012918489,0.0010711397,0.013885762],"genre_scores_gemma":[0.77158237,0.001914284,0.22076434,0.00004739353,0.000079898025,0.000028727183,0.00012926168,0.00029912783,0.005154572],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998534,0.000025517307,0.000004990001,0.000022660375,0.00007089696,0.00002245842],"domain_scores_gemma":[0.9994722,0.00020610652,0.000060419956,0.00010515883,0.00012164286,0.000034490597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032660546,0.0005329405,0.0003426743,0.00045590635,0.00014177265,0.0007619732,0.00034484614,0.0002711029,0.0042908452],"category_scores_gemma":[0.001032319,0.00023019924,0.00024785855,0.00051884796,0.00042057398,0.00085721794,0.0006574096,0.00039792582,0.0004616331],"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.0005329467,0.00006334626,0.00068341976,0.00024170864,0.000046906716,0.00012859913,0.00012419841,0.019493338,0.7558426,0.009924775,0.0010551984,0.21186295],"study_design_scores_gemma":[0.00013094443,0.000880637,0.008893308,0.00010073502,0.00014163954,0.0021634402,0.00009876044,0.31109384,0.65162367,0.012286932,0.012504775,0.00008137414],"about_ca_topic_score_codex":0.00020526274,"about_ca_topic_score_gemma":0.00024729228,"teacher_disagreement_score":0.0042908452,"about_ca_system_score_codex":0.00018999836,"about_ca_system_score_gemma":0.0001127219,"threshold_uncertainty_score":0.014354348},"labels":[],"label_agreement":null},{"id":"W1590261675","doi":"10.1007/11603771_21","title":"On the Implementation of Links in Multi-mesh Networks Using WDM Optical Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Windsor","funders":"","keywords":"Computer science; Wavelength-division multiplexing; Interconnection; Telecommunications network; Block (permutation group theory); Multiplexing; Computer network; Optical fiber; Optical communication; Wavelength; Electronic engineering; Telecommunications; Optoelectronics; Engineering; Materials science","score_opus":0.020451358838421883,"score_gpt":0.27326054190263677,"score_spread":0.2528091830642149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590261675","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.08666937,0.004894669,0.8285851,0.0012293456,0.0005562654,0.00016685664,0.000087155284,0.00094609096,0.076865256],"genre_scores_gemma":[0.6799208,0.0044293054,0.2888706,0.00025008293,0.00021270623,0.00016161063,0.0001753081,0.0001732348,0.02580635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962926,0.0001280053,0.000017528408,0.000030333487,0.00014022799,0.000054578257],"domain_scores_gemma":[0.99941134,0.00032470847,0.00002840092,0.00012765486,0.00009127755,0.000016685215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067605963,0.00039189734,0.00028912228,0.00038891236,0.00052152417,0.0012246788,0.0012926765,0.0005202184,0.0043688715],"category_scores_gemma":[0.0016736264,0.00033072356,0.0003098935,0.00052883715,0.00047402486,0.0021213877,0.0009047717,0.0009409636,0.0004993641],"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.00033012766,0.00015350911,0.00080684404,0.0004717042,0.00008191519,0.00021037812,0.0002864242,0.11972034,0.034212884,0.4610535,0.007384221,0.3752882],"study_design_scores_gemma":[0.000055482793,0.00027078541,0.00073912845,0.00018388197,0.000077493765,0.00030003983,0.00014223697,0.71055347,0.035104033,0.19720459,0.055334672,0.000034158787],"about_ca_topic_score_codex":0.0008709793,"about_ca_topic_score_gemma":0.0018287,"teacher_disagreement_score":0.0043688715,"about_ca_system_score_codex":0.0006701784,"about_ca_system_score_gemma":0.00031806141,"threshold_uncertainty_score":0.014615357},"labels":[],"label_agreement":null},{"id":"W1590327753","doi":"10.1007/978-3-540-69497-7_35","title":"Scalable Ubiquitous Data Access in Clustered Sensor Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Checksum; Wireless sensor network; Cluster analysis; Distributed computing; Computer network; Distributed data store; Database","score_opus":0.03780668082195944,"score_gpt":0.26835412653423474,"score_spread":0.2305474457122753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590327753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04132069,0.008669642,0.9388461,0.00059695577,0.0003274442,0.00008177537,0.00014178774,0.0014635149,0.008552102],"genre_scores_gemma":[0.8534184,0.0047361422,0.13226536,0.00014201795,0.00032012968,0.00012855703,0.00028616766,0.00016139557,0.008541829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999361,0.00011887163,0.000038642793,0.00012431091,0.0002579457,0.000099378754],"domain_scores_gemma":[0.99930954,0.00029580417,0.000046688,0.00015882893,0.00013760896,0.00005153952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062029494,0.00049268815,0.000988911,0.00046969322,0.00050073594,0.0009018668,0.001538604,0.00060630625,0.0022011506],"category_scores_gemma":[0.0021549494,0.0003272765,0.00027323747,0.0016287179,0.0004745009,0.002188087,0.0017375207,0.0008124769,0.00037089593],"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.0003630762,0.00014649228,0.0007844731,0.0006099507,0.000091423346,0.00028392527,0.00026353425,0.42017832,0.024376852,0.08112711,0.019606657,0.45216823],"study_design_scores_gemma":[0.000018448913,0.00011193017,0.00038043936,0.000022604034,0.000025326113,0.00020227733,0.000113956805,0.95323706,0.0047315503,0.03249412,0.008648787,0.000013561858],"about_ca_topic_score_codex":0.001249588,"about_ca_topic_score_gemma":0.001536779,"teacher_disagreement_score":0.0022011506,"about_ca_system_score_codex":0.00061913487,"about_ca_system_score_gemma":0.0003749575,"threshold_uncertainty_score":0.007363558},"labels":[],"label_agreement":null},{"id":"W1590344984","doi":"10.1007/11751540_8","title":"Two Map Labeling Algorithms for GIS Applications","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Inscribed figure; Rectangle; Orientation (vector space); Computer science; Regular polygon; Set (abstract data type); Algorithm; Center (category theory); Geographic information system; Mathematics; Geometry; Cartography","score_opus":0.021555197416907045,"score_gpt":0.27809002219823087,"score_spread":0.25653482478132383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590344984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036285631,0.00012982107,0.98998636,0.00018416805,0.000104409126,0.00006714232,0.00015245662,0.0016772347,0.0040698405],"genre_scores_gemma":[0.029354833,0.00019342647,0.9591319,0.00008215319,0.00005864033,0.00013588165,0.000634329,0.000536106,0.009872732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.000090675756,0.00004043585,0.00017023786,0.0002384454,0.00009004505],"domain_scores_gemma":[0.99882466,0.0003624957,0.000040149243,0.00036643338,0.00032710674,0.00007921006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804767,0.0012193373,0.0010232901,0.00174622,0.0012322724,0.0021880984,0.002386753,0.0015093704,0.01755033],"category_scores_gemma":[0.002803917,0.0007422744,0.0012667986,0.0025793961,0.0008035693,0.0034200377,0.002334435,0.0023836552,0.004417137],"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.00021092645,0.00019832686,0.00047725873,0.00013648522,0.000023317334,0.00006893666,0.00020313541,0.02481572,0.006907694,0.089208946,0.021159202,0.85659],"study_design_scores_gemma":[0.0001140317,0.000115396244,0.00085752056,0.000051680196,0.000054279986,0.0003219068,0.00030307862,0.71413153,0.018757293,0.18878146,0.07644745,0.00006441937],"about_ca_topic_score_codex":0.004455451,"about_ca_topic_score_gemma":0.0055001406,"teacher_disagreement_score":0.01755033,"about_ca_system_score_codex":0.0010795076,"about_ca_system_score_gemma":0.0011934441,"threshold_uncertainty_score":0.058711648},"labels":[],"label_agreement":null},{"id":"W1590413836","doi":"10.1007/978-3-642-10268-4_95","title":"Fuzzy Feature-Based Upper Body Tracking with IP PTZ Camera Control","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Diagonal; Fuzzy logic; Frame (networking); Frame rate; Classifier (UML); Feature (linguistics); Mathematics","score_opus":0.01435036323617115,"score_gpt":0.2581544733446371,"score_spread":0.24380411010846595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590413836","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018969906,0.00022883754,0.9769372,0.00003120552,0.000052121093,0.00003694395,0.000024700741,0.0003298329,0.0033892435],"genre_scores_gemma":[0.8850652,0.00022878486,0.11138449,0.000045219098,0.000033740427,0.00008683586,0.00005699018,0.000028231027,0.0030705119],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976665,0.000021937338,0.000014635201,0.00007573013,0.00009753763,0.00002350899],"domain_scores_gemma":[0.9998456,0.000038242317,0.00002512469,0.00002065995,0.00006205554,0.00000819442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003008136,0.00037837666,0.0006137696,0.00032816196,0.00025645862,0.0005742211,0.0005656416,0.00045553167,0.0014469995],"category_scores_gemma":[0.0006019822,0.00019187025,0.00039873712,0.00038683394,0.00027357895,0.000411066,0.00038762263,0.00036176763,0.00035755205],"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.000721531,0.00010852313,0.0010202893,0.00032610248,0.00007308334,0.00015572968,0.00018161157,0.18061443,0.12150622,0.0061603417,0.0018961892,0.6872359],"study_design_scores_gemma":[0.00002478716,0.00023138295,0.0020123934,0.000021649184,0.00004127202,0.0001441559,0.000016464162,0.9801513,0.014627418,0.001334178,0.0013760037,0.000019000678],"about_ca_topic_score_codex":0.0025322433,"about_ca_topic_score_gemma":0.0019990155,"teacher_disagreement_score":0.0025322433,"about_ca_system_score_codex":0.00030848978,"about_ca_system_score_gemma":0.00022614849,"threshold_uncertainty_score":0.005034983},"labels":[],"label_agreement":null},{"id":"W1590422503","doi":"10.1007/978-3-642-17458-2_9","title":"Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Correlation clustering; CURE data clustering algorithm; Sample (material); Set (abstract data type); Pattern recognition (psychology); Exploit; Cluster (spacecraft); Clustering high-dimensional data; Artificial intelligence; Algorithm; Physics","score_opus":0.01375284560573944,"score_gpt":0.2509536036106145,"score_spread":0.23720075800487503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590422503","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.0031003389,0.00018943335,0.9956084,0.00011723839,0.000022801425,0.000045962734,0.00010081524,0.0005287343,0.0002863358],"genre_scores_gemma":[0.053878486,0.0002151564,0.9416859,0.00024296621,0.000099679855,0.00032831784,0.0009760181,0.00028592293,0.0022875394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931166,0.0029428268,0.00029234224,0.0012729868,0.0019536563,0.00042163776],"domain_scores_gemma":[0.98932976,0.0066566644,0.00045187742,0.0018175318,0.0015221513,0.00022203392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071638497,0.0017630577,0.0032674493,0.0030193399,0.0016490184,0.0030222568,0.0062259873,0.0027627216,0.0030179133],"category_scores_gemma":[0.01606396,0.0020953543,0.0032018744,0.005273544,0.0020040027,0.0029322365,0.0071471897,0.0028038851,0.0022553094],"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.00097200496,0.0003289237,0.0034944443,0.0005560704,0.0011155417,0.00023288242,0.0005959899,0.20316763,0.028853908,0.055392105,0.014005838,0.6912847],"study_design_scores_gemma":[0.00003629409,0.00005155042,0.0005479991,0.0000122119845,0.000057124438,0.00006809797,0.000035324956,0.961404,0.0040143756,0.032108106,0.001630293,0.00003455813],"about_ca_topic_score_codex":0.003549138,"about_ca_topic_score_gemma":0.006715476,"teacher_disagreement_score":0.0071638497,"about_ca_system_score_codex":0.001298465,"about_ca_system_score_gemma":0.0022640668,"threshold_uncertainty_score":0.0378865},"labels":[],"label_agreement":null},{"id":"W1590453572","doi":"10.1007/978-3-642-40084-1_30","title":"How to Run Turing Machines on Encrypted Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Encryption; Homomorphic encryption; Cryptography; Theoretical computer science; Turing machine; Functional encryption; Algorithm; Computer security; Ciphertext; Computation","score_opus":0.02802479393924267,"score_gpt":0.251666548258778,"score_spread":0.2236417543195353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590453572","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.014992552,0.00088262325,0.91179144,0.003702413,0.0011782739,0.00017816595,0.0004905029,0.008702374,0.0580816],"genre_scores_gemma":[0.24328873,0.0014246706,0.6764625,0.001133174,0.00036649508,0.00041778124,0.0011400984,0.0045968345,0.07116974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00020015375,0.00006688925,0.00011540202,0.00028922694,0.00010765579],"domain_scores_gemma":[0.9986659,0.00054793595,0.00003939828,0.0005204845,0.0001735948,0.000052671774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068780105,0.0006832012,0.00061533373,0.0004124335,0.00088955095,0.002670748,0.0008894577,0.0013643464,0.017962726],"category_scores_gemma":[0.0053497474,0.0006972396,0.0010197127,0.0005103778,0.0016412875,0.0067076334,0.0020671475,0.0027346069,0.009015583],"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.00013041806,0.00007837029,0.00055895303,0.0006571605,0.000117560485,0.0002894682,0.00075129035,0.01806531,0.0144072715,0.6177181,0.05743376,0.2897924],"study_design_scores_gemma":[0.000030187997,0.000027641183,0.00016518823,0.000119853205,0.000039936232,0.00028186722,0.00014173836,0.045502,0.023316605,0.82565904,0.10467538,0.00004051897],"about_ca_topic_score_codex":0.0005804042,"about_ca_topic_score_gemma":0.0006466617,"teacher_disagreement_score":0.017962726,"about_ca_system_score_codex":0.0005119548,"about_ca_system_score_gemma":0.00077883893,"threshold_uncertainty_score":0.060091317},"labels":[],"label_agreement":null},{"id":"W1590505239","doi":"10.1007/978-3-540-74472-6_7","title":"Shortest Path Queries Between Geometric Objects on Surfaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Surface (topology); Path (computing); Euclidean geometry; Face (sociological concept); Mathematics; Genus; Computer science; Geometry","score_opus":0.03260386802131227,"score_gpt":0.2616404646236558,"score_spread":0.22903659660234355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590505239","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.2248439,0.0030142877,0.71708745,0.0012501103,0.00030859842,0.00027204317,0.004552682,0.0062508383,0.04242015],"genre_scores_gemma":[0.5177777,0.002681158,0.4458062,0.00015307439,0.00018957804,0.00022496424,0.01087128,0.0010012882,0.021294774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906725,0.00009456704,0.00006093549,0.00016476166,0.00052014797,0.00009242221],"domain_scores_gemma":[0.99905723,0.0005873554,0.000046529727,0.00016209277,0.00009576296,0.000051014384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339898,0.00091150176,0.0015577207,0.0012885487,0.0007925017,0.0018125017,0.0018435743,0.0018658343,0.0071936115],"category_scores_gemma":[0.0028102922,0.0005529135,0.00069866533,0.0039991573,0.00073152187,0.0046887733,0.002987728,0.0012922942,0.0015583565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006925777,0.00021527425,0.0016282424,0.0014119061,0.00011247656,0.0007377494,0.0011058877,0.22606172,0.045311797,0.21188183,0.043619502,0.46722105],"study_design_scores_gemma":[0.00012369825,0.00019673436,0.0009764023,0.00009649187,0.000051082643,0.00075088337,0.00071593415,0.5525301,0.022439325,0.35281736,0.06923999,0.00006205328],"about_ca_topic_score_codex":0.002118751,"about_ca_topic_score_gemma":0.0019887516,"teacher_disagreement_score":0.0071936115,"about_ca_system_score_codex":0.00082305586,"about_ca_system_score_gemma":0.00040506723,"threshold_uncertainty_score":0.024065077},"labels":[],"label_agreement":null},{"id":"W1590704835","doi":"10.1007/978-3-540-72665-4_33","title":"Path Propagation for Inference in Bayesian Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Windsor","funders":"","keywords":"Computer science; Bayesian network; Inference; Path (computing); Bayesian inference; Artificial intelligence; Bayesian probability; Variable-order Bayesian network; Approximate inference; Probabilistic logic; Dynamic Bayesian network; Machine learning; Graphical model; Computer network","score_opus":0.03187275958269007,"score_gpt":0.28045645419713716,"score_spread":0.2485836946144471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590704835","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.0002471514,0.0015205422,0.9964265,0.00019054755,0.000070116446,0.000017302518,0.000104503684,0.00021367437,0.001209587],"genre_scores_gemma":[0.037346624,0.007616157,0.9442225,0.0002665386,0.00050477765,0.00051279104,0.0011374761,0.0005535506,0.007839458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731785,0.0014735549,0.00016277573,0.00040948007,0.000539277,0.000097046846],"domain_scores_gemma":[0.9887701,0.009747257,0.00022953967,0.0006339326,0.0005190041,0.00010019033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004586249,0.0020196098,0.0024302711,0.0026454017,0.0009154912,0.0027656027,0.0042449054,0.0033976166,0.011737441],"category_scores_gemma":[0.02439931,0.0017845079,0.0023068266,0.0055643492,0.002380444,0.006301796,0.0023723217,0.006263592,0.0037166183],"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.00004405307,0.000045690016,0.0003044829,0.0005958298,0.00014967342,0.0001009394,0.00016340907,0.1650082,0.00033901134,0.6745796,0.0129702445,0.1456989],"study_design_scores_gemma":[0.000013295919,0.00000678205,0.00006292362,0.00006114974,0.000031842672,0.000037001184,0.000010687525,0.28842345,0.00016602625,0.70343006,0.0077413097,0.000015497404],"about_ca_topic_score_codex":0.008450004,"about_ca_topic_score_gemma":0.005548909,"teacher_disagreement_score":0.011737441,"about_ca_system_score_codex":0.0023233504,"about_ca_system_score_gemma":0.0017027687,"threshold_uncertainty_score":0.039265633},"labels":[],"label_agreement":null},{"id":"W1590719333","doi":"10.1007/978-3-642-16265-7_18","title":"Systematic Translation Rules from astd to Event-B","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Translation (biology); Event (particle physics); Transfer-based machine translation; Programming language; Process calculus; Process (computing); Natural language processing; Mathematical proof; Set (abstract data type); Animation; Software engineering; Artificial intelligence; Machine translation; Example-based machine translation; Computer graphics (images); Mathematics","score_opus":0.025712222896877673,"score_gpt":0.2800246125856278,"score_spread":0.2543123896887501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590719333","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.00470407,0.0001280848,0.96372896,0.00029590022,0.00034509212,0.00041838182,0.0018372479,0.017563934,0.0109784],"genre_scores_gemma":[0.117442094,0.0004570949,0.85136783,0.0005205999,0.0001307619,0.00065174425,0.00580442,0.009137893,0.014487447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965737,0.000830594,0.0005134921,0.00070758583,0.00097053224,0.00040416038],"domain_scores_gemma":[0.99380684,0.0027394334,0.00020591955,0.0017541329,0.0013592052,0.0001344828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026611355,0.0013499124,0.0010080525,0.0019456208,0.0010403278,0.0028574157,0.0015596494,0.0014138833,0.017499808],"category_scores_gemma":[0.00875794,0.0016271686,0.002056022,0.0014807697,0.0020068104,0.0028995837,0.004360036,0.0033331031,0.012458821],"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.0008080467,0.00032321867,0.001589508,0.0017980336,0.0001640489,0.001034801,0.0013258563,0.011310018,0.03702522,0.41008684,0.06703231,0.467502],"study_design_scores_gemma":[0.00029870126,0.00015499981,0.0006134549,0.0004763452,0.0003222332,0.0008080009,0.0004946597,0.05845281,0.1194074,0.568384,0.25043124,0.00015613342],"about_ca_topic_score_codex":0.002972386,"about_ca_topic_score_gemma":0.0034316026,"teacher_disagreement_score":0.017499808,"about_ca_system_score_codex":0.00082662265,"about_ca_system_score_gemma":0.0028528895,"threshold_uncertainty_score":0.05854267},"labels":[],"label_agreement":null},{"id":"W1590732297","doi":"10.1007/11766247_28","title":"Beyond the Bag of Words: A Text Representation for Sentence Selection","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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 Ottawa","funders":"","keywords":"Selection (genetic algorithm); Sentence; Natural language processing; Representation (politics); Artificial intelligence; Computer science; Linguistics; Psychology; Political science; Philosophy","score_opus":0.020344372462501047,"score_gpt":0.26771300048168784,"score_spread":0.2473686280191868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590732297","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.011095362,0.0016194928,0.9731184,0.00042868318,0.0003471216,0.00025624657,0.0042449716,0.0069032027,0.0019864137],"genre_scores_gemma":[0.09605204,0.0013524146,0.8809522,0.00031767593,0.00058181834,0.00064912124,0.013965798,0.0009614574,0.0051675024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983241,0.0006303431,0.00019986396,0.00033318557,0.0004203239,0.00009215217],"domain_scores_gemma":[0.99667346,0.0018745179,0.00023375709,0.0004469138,0.0006406414,0.00013071032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015695,0.0013363098,0.0014570964,0.0035648833,0.00072116713,0.0020183616,0.0018797365,0.0011965563,0.0067927944],"category_scores_gemma":[0.006214448,0.00038391273,0.0012012899,0.0043652514,0.00039837274,0.004217742,0.0013605503,0.001391926,0.005460388],"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.00056594016,0.00017372423,0.00068904937,0.0004990665,0.00011284966,0.00015500603,0.0002259516,0.005545797,0.022935722,0.0054420307,0.030486338,0.9331686],"study_design_scores_gemma":[0.00018552541,0.0008695738,0.0032445989,0.0003249394,0.0005966049,0.0009647599,0.00046111597,0.7904113,0.04917656,0.07716543,0.07638138,0.00021830008],"about_ca_topic_score_codex":0.0014666734,"about_ca_topic_score_gemma":0.0016795772,"teacher_disagreement_score":0.0067927944,"about_ca_system_score_codex":0.00041943195,"about_ca_system_score_gemma":0.000965681,"threshold_uncertainty_score":0.022724152},"labels":[],"label_agreement":null},{"id":"W1590796097","doi":"10.1007/11552451_21","title":"Swarm Intelligence and the Holonic Paradigm: A Promising Symbiosis for a Medical Diagnostic System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","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 New Brunswick","funders":"","keywords":"Mirroring; Swarm intelligence; Computer science; Task (project management); Swarm behaviour; Set (abstract data type); Artificial intelligence; Simple (philosophy); Ant colony; Architecture; Swarm robotics; Distributed computing; Engineering; Ant colony optimization algorithms; Machine learning; Systems engineering; Communication","score_opus":0.018134357750293824,"score_gpt":0.25364758184005026,"score_spread":0.23551322408975645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590796097","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.012743777,0.0068537155,0.8953213,0.0088672135,0.001256234,0.00010247917,0.00009221107,0.000499421,0.074263625],"genre_scores_gemma":[0.4674825,0.007725297,0.48565903,0.0017570975,0.0014780351,0.00022548265,0.00021674717,0.00017231607,0.035283484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.000183582,0.000028620978,0.00007292595,0.00020765519,0.000037397454],"domain_scores_gemma":[0.99925596,0.00035876027,0.000057818863,0.0001067786,0.000115502546,0.00010519135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011112991,0.0007027277,0.000643036,0.0007902703,0.0006317896,0.0035211476,0.0013627413,0.0015772659,0.0047984994],"category_scores_gemma":[0.0018031149,0.00029620665,0.0005137593,0.00069526595,0.0023938196,0.0031079578,0.0020240364,0.0016496747,0.00096114463],"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.000110394154,0.000073053045,0.0006192117,0.0003482282,0.00010199825,0.00024961217,0.0004469313,0.02445348,0.0062079695,0.7710946,0.012791971,0.1835026],"study_design_scores_gemma":[0.000043797303,0.00014037958,0.00034478732,0.00012463014,0.000032555152,0.00033759137,0.0002295108,0.12034633,0.0018161567,0.810398,0.06614691,0.000039426428],"about_ca_topic_score_codex":0.0005765898,"about_ca_topic_score_gemma":0.00054391637,"teacher_disagreement_score":0.0047984994,"about_ca_system_score_codex":0.000533791,"about_ca_system_score_gemma":0.000623736,"threshold_uncertainty_score":0.016052604},"labels":[],"label_agreement":null},{"id":"W1590923996","doi":"10.1007/11943952_36","title":"A Secure Architecture for Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Single point of failure; Computer network; Scalability; Certificate authority; Mobile ad hoc network; Wireless ad hoc network; Node (physics); Public key infrastructure; Distributed computing; Architecture; Authentication (law); Vehicular ad hoc network; Cluster analysis; Routing (electronic design automation); Computer security; Wireless; Engineering; Public-key cryptography; Geography; Database; Operating system","score_opus":0.008543906233223712,"score_gpt":0.22644598181302858,"score_spread":0.21790207557980487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590923996","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.0066191126,0.0022053295,0.9710154,0.00068673666,0.00039185653,0.00018012004,0.000050112496,0.0030917982,0.015759474],"genre_scores_gemma":[0.269845,0.006616009,0.6615376,0.00045299588,0.0006492565,0.000649037,0.00034336073,0.0008975822,0.05900925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992186,0.0001305148,0.000065625085,0.00007380657,0.0004197677,0.00009167795],"domain_scores_gemma":[0.99928373,0.00016504664,0.000043643307,0.00032638814,0.00013649733,0.000044701974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076005684,0.0010782054,0.00060402305,0.0008593549,0.0011084481,0.0021309785,0.001493406,0.0014805752,0.005579359],"category_scores_gemma":[0.0015369334,0.0008846784,0.00058686046,0.000768204,0.0014819328,0.0038466856,0.0027547507,0.00259517,0.0030512172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020510751,0.00008802789,0.00031695468,0.00039374354,0.000058663056,0.0003355845,0.00042067352,0.028121809,0.02875263,0.6631857,0.016522363,0.26159877],"study_design_scores_gemma":[0.000108879874,0.00033868803,0.00029543828,0.00020995532,0.00014376735,0.0010968868,0.00011536597,0.23519939,0.034532677,0.5051063,0.222773,0.00007970023],"about_ca_topic_score_codex":0.00038172962,"about_ca_topic_score_gemma":0.0005541991,"teacher_disagreement_score":0.005579359,"about_ca_system_score_codex":0.000660035,"about_ca_system_score_gemma":0.00078685535,"threshold_uncertainty_score":0.018664777},"labels":[],"label_agreement":null},{"id":"W1590926312","doi":"10.1007/3-540-45813-1_67","title":"PagePrompter: An Intelligent Web Agent Created Using Data Mining Techniques","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Web mining; World Wide Web; Web modeling; Intelligent agent; Web page; Web development; Data Web; Web intelligence; Web design; Web navigation; Artificial intelligence","score_opus":0.08952862322531616,"score_gpt":0.3028358999741696,"score_spread":0.21330727674885344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590926312","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.027220001,0.0007014347,0.75308645,0.0004925542,0.00035642978,0.00063792884,0.003687091,0.1868628,0.02695536],"genre_scores_gemma":[0.12045279,0.0009954427,0.75008416,0.0005539723,0.00015827526,0.0005296592,0.0092130285,0.013467512,0.10454518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969494,0.00004131606,0.00002655691,0.000065018256,0.00015222431,0.000020040512],"domain_scores_gemma":[0.9993326,0.0002537252,0.00005505055,0.0001504745,0.00012193783,0.00008609748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087001873,0.000671866,0.0008294173,0.0010552121,0.0004972239,0.001451149,0.001286252,0.00093413313,0.013074845],"category_scores_gemma":[0.0024290518,0.0005743237,0.000556464,0.00080370094,0.00027761274,0.0026061744,0.0009823467,0.0010360536,0.0071783937],"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.0012309352,0.00062805926,0.003625375,0.00090013485,0.0001972787,0.0009388458,0.00081249117,0.005568629,0.04321657,0.0157189,0.17092143,0.75624126],"study_design_scores_gemma":[0.0003145272,0.00045987352,0.005042452,0.0002255454,0.00042260534,0.00295417,0.00018927407,0.20858714,0.13583767,0.019731391,0.62602806,0.00020718282],"about_ca_topic_score_codex":0.0007420279,"about_ca_topic_score_gemma":0.0015021133,"teacher_disagreement_score":0.013074845,"about_ca_system_score_codex":0.00024328365,"about_ca_system_score_gemma":0.00045876508,"threshold_uncertainty_score":0.043739736},"labels":[],"label_agreement":null},{"id":"W1590938412","doi":"10.1007/3-540-44687-7_49","title":"Reconfigurable Breakpoints for Co-debug","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"Xilinx (Canada)","funders":"","keywords":"Debugging; Computer science; Field-programmable gate array; Embedded system; Computer hardware; Software; Digital clock manager; Synchronization (alternating current); Clock synchronization; Synchronous circuit; Clock signal; Operating system; Channel (broadcasting)","score_opus":0.02793450416272618,"score_gpt":0.2777546043234521,"score_spread":0.24982010016072592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590938412","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.0190634,0.0015480523,0.9428478,0.00016208408,0.00031073982,0.00008970772,0.00013778085,0.014602998,0.021237453],"genre_scores_gemma":[0.54513097,0.0013534749,0.38151428,0.00033415164,0.00014096186,0.00026069276,0.0005922607,0.003837895,0.06683531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950814,0.00008735365,0.00003191428,0.00011807468,0.00016628158,0.00008813445],"domain_scores_gemma":[0.9989028,0.00037627685,0.00009356165,0.00049049966,0.000099514684,0.00003723748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038489024,0.0017360128,0.00062634813,0.0010873771,0.00053248426,0.0012901329,0.0026354138,0.0010731851,0.025368316],"category_scores_gemma":[0.0016283116,0.00065066054,0.00052291394,0.00081542425,0.00072304683,0.0024694696,0.0016385433,0.0021567794,0.0043070125],"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.0012012521,0.00014618888,0.00078014337,0.0006142919,0.00009281552,0.00049005594,0.00043396617,0.02849515,0.061739687,0.11303766,0.01890822,0.77406055],"study_design_scores_gemma":[0.00032796583,0.0011802042,0.0011792434,0.0004278656,0.00032057264,0.0020951584,0.000245982,0.21833523,0.30836397,0.19116051,0.27617565,0.00018760606],"about_ca_topic_score_codex":0.00038626624,"about_ca_topic_score_gemma":0.0007860164,"teacher_disagreement_score":0.025368316,"about_ca_system_score_codex":0.0004553656,"about_ca_system_score_gemma":0.0002655053,"threshold_uncertainty_score":0.08486545},"labels":[],"label_agreement":null},{"id":"W1590984588","doi":"10.1007/3-540-44938-8_1","title":"Data Dependence in Combining Classifiers","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Categorization; Classifier (UML); Artificial intelligence; Variety (cybernetics); Machine learning; Data mining; Text categorization; Pattern recognition (psychology)","score_opus":0.042709517163155734,"score_gpt":0.27603447508627005,"score_spread":0.2333249579231143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590984588","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.017179951,0.002086338,0.97573674,0.0004324861,0.000085111904,0.00009016603,0.000106581116,0.0005757996,0.0037069148],"genre_scores_gemma":[0.51968604,0.0024485297,0.46093404,0.00073687185,0.0005034234,0.000458405,0.0010535911,0.00071954005,0.013459509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99249023,0.0032489144,0.00055178395,0.0010317581,0.0023652825,0.00031195156],"domain_scores_gemma":[0.93538225,0.049991634,0.0014771742,0.007984344,0.0047610947,0.00040352475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013257871,0.0009980686,0.0021113618,0.0021022283,0.00091826625,0.002902839,0.0030576917,0.0025381867,0.0035570222],"category_scores_gemma":[0.054711003,0.0016427368,0.0013722504,0.003218867,0.0016556358,0.009888349,0.0041851443,0.0038144342,0.0015645212],"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.0007373627,0.00017930847,0.0063398066,0.00044479055,0.00027453707,0.00030456664,0.0003761409,0.12092021,0.0071129515,0.08848147,0.006278025,0.76855093],"study_design_scores_gemma":[0.000027898954,0.00012097853,0.001571338,0.000087334985,0.00018700602,0.0003495269,0.00005691701,0.8340617,0.01242216,0.1450572,0.0060160826,0.00004178351],"about_ca_topic_score_codex":0.0012879464,"about_ca_topic_score_gemma":0.0018357281,"teacher_disagreement_score":0.013257871,"about_ca_system_score_codex":0.0010275822,"about_ca_system_score_gemma":0.0008915412,"threshold_uncertainty_score":0.07011521},"labels":[],"label_agreement":null},{"id":"W1590993614","doi":"10.1007/978-3-642-12566-9_13","title":"On Software Certification: We Need Product-Focused Approaches","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"McMaster University","funders":"","keywords":"Computer science; Certification; Software engineering; Product (mathematics); Software; Programming language; Management; Mathematics","score_opus":0.05594045579544545,"score_gpt":0.2496989663611623,"score_spread":0.19375851056571683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590993614","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.0034760318,0.014316144,0.8147446,0.03487379,0.0013839247,0.00007172459,0.000054031316,0.00068141054,0.13039836],"genre_scores_gemma":[0.2803537,0.04047457,0.55344546,0.017828748,0.0038095736,0.00034781732,0.000362394,0.0014208178,0.10195694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996705,0.001074846,0.00014830081,0.00036360638,0.0015123495,0.0001960459],"domain_scores_gemma":[0.98689044,0.006418233,0.00041014055,0.0027146123,0.0030904328,0.0004761967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005333131,0.0013937359,0.0011934248,0.0023519201,0.0012992938,0.00473378,0.002525601,0.0039262627,0.012294756],"category_scores_gemma":[0.010349727,0.001017613,0.0010243967,0.001848748,0.007813109,0.028378462,0.0033972678,0.009295151,0.0036693122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109550965,0.00005789048,0.00019550545,0.00025229063,0.000015076465,0.00008400962,0.00035641287,0.0015850288,0.0005283129,0.89441013,0.0145972725,0.08790712],"study_design_scores_gemma":[0.000006276933,0.000026954322,0.0001289566,0.00026581023,0.000011991048,0.00016282346,0.00015732912,0.0041393405,0.00043247157,0.92681885,0.0678327,0.00001642518],"about_ca_topic_score_codex":0.0011238385,"about_ca_topic_score_gemma":0.0015767862,"teacher_disagreement_score":0.012294756,"about_ca_system_score_codex":0.001794944,"about_ca_system_score_gemma":0.0016678132,"threshold_uncertainty_score":0.041130126},"labels":[],"label_agreement":null},{"id":"W1591028018","doi":"10.1007/11556121_43","title":"Separable Linear Classifiers for Online Learning in Appearance Based Object Detection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"York University","funders":"","keywords":"Computer science; Artificial intelligence; Object detection; Object (grammar); Separable space; Sample (material); Computer vision; Video tracking; Online learning; Tracking (education); Learning object; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.02158265548830392,"score_gpt":0.292838951005111,"score_spread":0.2712562955168071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591028018","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.0037975004,0.00055129826,0.9940936,0.00008003702,0.00006575188,0.00003107093,0.00006121173,0.00094207283,0.00037741123],"genre_scores_gemma":[0.13982718,0.0008675253,0.84449023,0.00019653716,0.00025794833,0.00041057525,0.0006864972,0.00048231948,0.012781175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987949,0.00032243764,0.00009955585,0.00026017462,0.00038015196,0.00014276544],"domain_scores_gemma":[0.99639904,0.0021781852,0.00016535114,0.0005410704,0.00062052434,0.0000958253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021295007,0.0010097399,0.002252279,0.00095467706,0.0005763546,0.0012289832,0.002923992,0.0019393648,0.0067617726],"category_scores_gemma":[0.0064181816,0.0011064633,0.0010047805,0.0018241171,0.0007335026,0.0027583174,0.0022046524,0.0031426284,0.0039151045],"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.00027160728,0.00022852112,0.0003568035,0.00021582653,0.00006379114,0.000060099417,0.0000595834,0.09633629,0.012075113,0.010472298,0.0069482313,0.87291175],"study_design_scores_gemma":[0.000008973235,0.000037056438,0.00012399993,0.0000082505985,0.000014502585,0.000026039857,0.000009617553,0.9883839,0.0045059226,0.005771306,0.0011030167,0.0000074654763],"about_ca_topic_score_codex":0.0032272786,"about_ca_topic_score_gemma":0.004373165,"teacher_disagreement_score":0.0067617726,"about_ca_system_score_codex":0.00092307065,"about_ca_system_score_gemma":0.0009349042,"threshold_uncertainty_score":0.02262032},"labels":[],"label_agreement":null},{"id":"W1591032459","doi":"10.1007/978-3-540-30121-9_36","title":"Desirable Mobile Networking Method for Formulating an Efficient Mobile Conferencing Application","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Korea Science and Engineering Foundation; Federation for the Humanities and Social Sciences","keywords":"Bluetooth; Computer network; Computer science; Network packet; Mobile technology; Delay-tolerant networking; Mobile device; Mobile computing; Telecommunications; Wireless; Optimized Link State Routing Protocol; World Wide Web; Routing protocol","score_opus":0.022755648315774143,"score_gpt":0.2868335239951681,"score_spread":0.26407787567939395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591032459","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.0051025394,0.000036517467,0.9893495,0.000076493,0.000042804626,0.0000725747,0.000042828713,0.0006972772,0.004579504],"genre_scores_gemma":[0.13402355,0.00009289851,0.85687244,0.00008580825,0.00006555485,0.00029527335,0.00020278693,0.0002786303,0.008083118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989932,0.00019173195,0.000071796014,0.00018482025,0.00045391737,0.000104491875],"domain_scores_gemma":[0.99921834,0.0002960656,0.000046505997,0.00015818923,0.000249071,0.000031867687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070736086,0.0007343367,0.00047861197,0.00064970716,0.00069273514,0.0010507617,0.0014840495,0.00073817914,0.0054194024],"category_scores_gemma":[0.002141441,0.0004278557,0.0008513843,0.00048833847,0.000614231,0.001125898,0.0010493896,0.0012773972,0.0014951627],"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.0003530774,0.00027985513,0.0009732402,0.00046181647,0.00006932339,0.000549311,0.00037895393,0.07267386,0.11747115,0.48543224,0.009736321,0.3116209],"study_design_scores_gemma":[0.000104053455,0.0003188758,0.00041888622,0.00007476008,0.00012261767,0.0006639316,0.00009068636,0.75032085,0.085307054,0.11783443,0.044693626,0.000050277777],"about_ca_topic_score_codex":0.0010390175,"about_ca_topic_score_gemma":0.0020595521,"teacher_disagreement_score":0.0054194024,"about_ca_system_score_codex":0.0006972077,"about_ca_system_score_gemma":0.0011035112,"threshold_uncertainty_score":0.018129706},"labels":[],"label_agreement":null},{"id":"W1591060977","doi":"10.1007/978-3-642-34487-9_79","title":"Managing Qualitative Preferences with Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Computer science; Local consistency; Constraint satisfaction problem; Formalism (music); Preference; Consistency (knowledge bases); Constraint satisfaction; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02849950941814939,"score_gpt":0.2770167262743363,"score_spread":0.24851721685618694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591060977","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.011270545,0.000452995,0.9514696,0.00069924805,0.000097019656,0.00008748102,0.00020719231,0.00026234207,0.035453476],"genre_scores_gemma":[0.42577282,0.0016575058,0.5287348,0.00044112667,0.00018374424,0.00043615146,0.0007868899,0.00029725605,0.041689683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982095,0.000629536,0.00009916859,0.0002001498,0.00071513344,0.00014659578],"domain_scores_gemma":[0.9976793,0.001309619,0.00013665948,0.00042159893,0.00031459946,0.0001383052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023055892,0.0006816598,0.00044789957,0.0006660469,0.0006225244,0.002251917,0.0015111731,0.0005324175,0.009979753],"category_scores_gemma":[0.007218999,0.00048093332,0.0008997567,0.0016454285,0.001146617,0.0046194894,0.0026029465,0.0019565774,0.0014075522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071860144,0.000071383656,0.0002571858,0.00024418137,0.000041501346,0.00014342298,0.0005287671,0.024874689,0.0048567723,0.8167431,0.005733826,0.14643331],"study_design_scores_gemma":[0.000021900878,0.00003620513,0.000126909,0.000060215443,0.00002692182,0.00015802836,0.00029639193,0.07402328,0.0062343194,0.8837797,0.03520484,0.00003121283],"about_ca_topic_score_codex":0.0007742108,"about_ca_topic_score_gemma":0.0010215592,"teacher_disagreement_score":0.009979753,"about_ca_system_score_codex":0.0010029309,"about_ca_system_score_gemma":0.00080068456,"threshold_uncertainty_score":0.033385634},"labels":[],"label_agreement":null},{"id":"W1591089445","doi":"10.1007/11866565_38","title":"A Comparison of Needle Bending Models","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Deflection (physics); Cantilever; Computer science; Finite element method; Bent molecular geometry; Linearity; Structural engineering; Optics; Physics; Engineering","score_opus":0.02134474514377461,"score_gpt":0.2699841780500472,"score_spread":0.2486394329062726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591089445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112334415,0.0022855252,0.8415251,0.0004052021,0.00028333347,0.00017408139,0.00071267976,0.002288773,0.039990928],"genre_scores_gemma":[0.8540045,0.0021015187,0.13141395,0.00014613768,0.000051479405,0.00013722356,0.0014517637,0.00091587444,0.009777528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931705,0.0001494231,0.000042155767,0.0000928013,0.00034741647,0.00005123196],"domain_scores_gemma":[0.9980205,0.0009833889,0.00012446828,0.00035895032,0.00042485696,0.0000877989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012229361,0.0008550558,0.0010011628,0.00095502875,0.00040924372,0.0013835819,0.0016632717,0.0017955303,0.009147675],"category_scores_gemma":[0.0034697852,0.0004881011,0.0014080703,0.00090974965,0.00038818782,0.0016420222,0.0006364238,0.0007308011,0.002109703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053326593,0.00019392291,0.0014677106,0.00039211518,0.0000973229,0.000095888725,0.00015163448,0.8155306,0.008805516,0.023374889,0.0022563885,0.14710075],"study_design_scores_gemma":[0.000015490947,0.0001328268,0.0004163709,0.00004123511,0.000025860172,0.00006245566,0.00003305217,0.9917351,0.0020241342,0.00300425,0.0024849405,0.00002441222],"about_ca_topic_score_codex":0.0029383947,"about_ca_topic_score_gemma":0.002696166,"teacher_disagreement_score":0.009147675,"about_ca_system_score_codex":0.00069824996,"about_ca_system_score_gemma":0.000627209,"threshold_uncertainty_score":0.030602038},"labels":[],"label_agreement":null},{"id":"W1591135906","doi":"10.1007/978-3-540-77891-2_19","title":"On Certain New Models for Paging with Locality of Reference","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Locality; Paging; Computer science; Locality of reference; Competitive analysis; Context (archaeology); Metric (unit); Reference model; Algorithm; Theoretical computer science; Mathematics; Upper and lower bounds; Engineering","score_opus":0.05689773143409504,"score_gpt":0.2729436992893933,"score_spread":0.21604596785529828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591135906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04993362,0.001689469,0.873934,0.0074205277,0.00045263764,0.00019452577,0.0009842395,0.0015079047,0.06388316],"genre_scores_gemma":[0.7529076,0.0030382536,0.16059047,0.0027521711,0.0018343382,0.0007049607,0.0014711361,0.0015305269,0.075170614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603856,0.001306356,0.0003011906,0.00072830357,0.0008791807,0.0007464135],"domain_scores_gemma":[0.97767794,0.011190647,0.0019785413,0.0059817447,0.0017893605,0.0013816892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037402073,0.0014097953,0.0029928929,0.0025474923,0.003983108,0.008147967,0.00716053,0.0066432115,0.020661015],"category_scores_gemma":[0.028589772,0.001781734,0.0033729798,0.0054411534,0.006320959,0.024381852,0.0056336457,0.008384631,0.0028463698],"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.000040422125,0.000029198913,0.00013662806,0.000041017433,0.000009318979,0.00005705535,0.00014258949,0.008820505,0.00016143074,0.98413557,0.0032070293,0.0032193004],"study_design_scores_gemma":[0.00002284804,0.000012348559,0.00004244306,0.000017061908,0.000014695231,0.00008209108,0.00004480055,0.056450464,0.000120646386,0.94050884,0.0026645774,0.00001920916],"about_ca_topic_score_codex":0.004434666,"about_ca_topic_score_gemma":0.0041890773,"teacher_disagreement_score":0.020661015,"about_ca_system_score_codex":0.004849403,"about_ca_system_score_gemma":0.0024269256,"threshold_uncertainty_score":0.06911802},"labels":[],"label_agreement":null},{"id":"W1591163814","doi":"10.1007/11866763_8","title":"Symmetric Atlasing and Model Based Segmentation: An Application to the Hippocampus in Older Adults","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":603,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Segmentation; Computer science; Tracing; Artificial intelligence; Computer vision; Extension (predicate logic); Pattern recognition (psychology)","score_opus":0.02170383164047134,"score_gpt":0.2782831723838239,"score_spread":0.25657934074335254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591163814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2311915,0.0013487983,0.75850785,0.0007972488,0.00012426951,0.0002542366,0.0016668132,0.004082316,0.0020270562],"genre_scores_gemma":[0.5846563,0.0011464581,0.4107033,0.00012238341,0.000073904506,0.00011671938,0.00066523254,0.0009082503,0.0016075209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969006,0.000101489044,0.000027740298,0.00007681946,0.000075188145,0.000028728806],"domain_scores_gemma":[0.9985044,0.00081868627,0.00012275792,0.0002519646,0.00019833326,0.00010396692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517646,0.0006188508,0.000911418,0.0014320511,0.0004805422,0.0014960555,0.00090901525,0.0013854556,0.0030794542],"category_scores_gemma":[0.0054656314,0.00063078216,0.0008390285,0.0016703146,0.0005410348,0.00074108515,0.0010872548,0.00073829666,0.00064028276],"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.0022738557,0.00018110813,0.017875856,0.00069998554,0.00034233002,0.0015790199,0.0013786925,0.115879305,0.061284952,0.0064692125,0.0068440423,0.7851918],"study_design_scores_gemma":[0.00020823919,0.00031271137,0.018390497,0.00006834926,0.00021715944,0.0034318697,0.0005791479,0.9024566,0.039939445,0.029332194,0.004953946,0.00010990159],"about_ca_topic_score_codex":0.013951184,"about_ca_topic_score_gemma":0.017003872,"teacher_disagreement_score":0.013951184,"about_ca_system_score_codex":0.00066272775,"about_ca_system_score_gemma":0.0015825077,"threshold_uncertainty_score":0.027739942},"labels":[],"label_agreement":null},{"id":"W1591174700","doi":"10.1007/978-3-540-39404-4_18","title":"New Management Methods for Feature and Preference Interactions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université de Sherbrooke","funders":"","keywords":"Telephony; Computer science; Context (archaeology); Telecommunications Management Network; Service provider; Feature (linguistics); Service (business); Order (exchange); Telecommunications; Computer security; Business; Element management system; Network architecture","score_opus":0.05067887664366095,"score_gpt":0.327783903042081,"score_spread":0.27710502639842005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591174700","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.0009955785,0.00009214429,0.9947188,0.00010938608,0.00006533841,0.000054752298,0.000028646007,0.00028223862,0.0036531205],"genre_scores_gemma":[0.05853956,0.00023900236,0.9212553,0.00014761851,0.0002066705,0.0004690917,0.0001543252,0.0003462263,0.018642249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672455,0.00087675656,0.00023450886,0.00052454154,0.0014440955,0.00019547809],"domain_scores_gemma":[0.9960782,0.0019148184,0.00025740528,0.00087713444,0.0007217661,0.00015076302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032596192,0.0009970554,0.00088796276,0.0017600249,0.0013901335,0.002608647,0.003020325,0.0013570549,0.012642961],"category_scores_gemma":[0.009768754,0.00072262733,0.0011325707,0.0018820578,0.0014218728,0.00860257,0.0027165287,0.0030567863,0.002310338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069719405,0.00019533274,0.0003324617,0.00014493776,0.000041764375,0.00007017012,0.0004491025,0.0110675115,0.0025772797,0.558263,0.009754574,0.41703418],"study_design_scores_gemma":[0.00005902739,0.00006149584,0.00024987358,0.000059851587,0.00005881033,0.00021990901,0.00017972224,0.4050594,0.0030267339,0.5534566,0.03751267,0.000055923916],"about_ca_topic_score_codex":0.0012595154,"about_ca_topic_score_gemma":0.0023518195,"teacher_disagreement_score":0.012642961,"about_ca_system_score_codex":0.0010213202,"about_ca_system_score_gemma":0.001020233,"threshold_uncertainty_score":0.04229486},"labels":[],"label_agreement":null},{"id":"W1591206524","doi":"10.1007/3-540-44527-7_2","title":"Activating Case-Based Reasoning with Active Databases","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Active database; Computer science; Case-based reasoning; Construct (python library); Property (philosophy); Layer (electronics); Database; Event (particle physics); Action (physics); Reasoning system; Feature (linguistics); Data mining; Architecture; Artificial intelligence; Programming language","score_opus":0.021696966210591983,"score_gpt":0.248133013810236,"score_spread":0.22643604759964403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591206524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020496706,0.00042072323,0.9528285,0.0007049192,0.00011276314,0.0003383583,0.00039341897,0.0032744466,0.0214301],"genre_scores_gemma":[0.30989057,0.0006563263,0.6797035,0.0003210659,0.00007239373,0.00029834476,0.0012136406,0.00027034257,0.0075738328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616724,0.0012959767,0.00034804313,0.0005709323,0.0013736208,0.0002441735],"domain_scores_gemma":[0.9890749,0.007985289,0.00029330113,0.0017456991,0.0006603396,0.00024040762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040318193,0.0009820912,0.001005515,0.0022109773,0.00090839533,0.0059257695,0.005149202,0.002085483,0.014085351],"category_scores_gemma":[0.015779555,0.0012595113,0.0014475053,0.0020669037,0.0014239752,0.007647687,0.004664352,0.0022442236,0.002812815],"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.0013270491,0.0012361102,0.0033527773,0.0010237272,0.00029337496,0.0013442287,0.0029221976,0.046853784,0.017075792,0.2498747,0.013767521,0.6609287],"study_design_scores_gemma":[0.00026987548,0.00014684963,0.0005537335,0.00028101937,0.00036237095,0.0008725976,0.00090064335,0.4513246,0.049620856,0.45070705,0.04486032,0.00010008948],"about_ca_topic_score_codex":0.0019334789,"about_ca_topic_score_gemma":0.0023213408,"teacher_disagreement_score":0.014085351,"about_ca_system_score_codex":0.00075214956,"about_ca_system_score_gemma":0.0010659137,"threshold_uncertainty_score":0.047120214},"labels":[],"label_agreement":null},{"id":"W1591220197","doi":"10.1007/978-3-642-29023-7_19","title":"Mining Social Networks for Significant Friend Groups","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Friendship; Computer science; Interdependence; World Wide Web; Social network (sociolinguistics); Social group; Tree (set theory); Internet privacy; Social network analysis; Data science; Social media; Sociology; Social science","score_opus":0.026763849917572108,"score_gpt":0.26129530314848376,"score_spread":0.23453145323091165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591220197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4620562,0.0064281155,0.49111912,0.0018278802,0.00033799713,0.00075776345,0.017071772,0.0026161943,0.017785003],"genre_scores_gemma":[0.8239718,0.001491768,0.14908428,0.00012182727,0.00051105313,0.00037824444,0.017176418,0.0001604246,0.0071041435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992687,0.00014091891,0.000048796923,0.00027770142,0.00019160144,0.00007231436],"domain_scores_gemma":[0.99749506,0.0014283365,0.00032500076,0.00032645828,0.00027714297,0.00014807085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057984906,0.0009874603,0.0007147954,0.0054875384,0.0011582164,0.001305358,0.0013352202,0.0011320781,0.0034588678],"category_scores_gemma":[0.0068476647,0.00047544987,0.001481678,0.0030345598,0.00042562096,0.002734776,0.0011383529,0.00090471003,0.0018810334],"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.00093973835,0.00088998437,0.14393693,0.0014392099,0.0011286958,0.0012468081,0.0015797685,0.049242143,0.0148265865,0.032046504,0.050753184,0.70197046],"study_design_scores_gemma":[0.00009397088,0.00032758297,0.04535734,0.00025641292,0.0005865204,0.0023087554,0.0016023143,0.8019473,0.007769185,0.116182044,0.023488669,0.000079831945],"about_ca_topic_score_codex":0.0018281083,"about_ca_topic_score_gemma":0.0052526165,"teacher_disagreement_score":0.0054875384,"about_ca_system_score_codex":0.0005142466,"about_ca_system_score_gemma":0.00044920668,"threshold_uncertainty_score":0.01157105},"labels":[],"label_agreement":null},{"id":"W1591335477","doi":"10.1007/978-3-540-45063-4_21","title":"Surface Recovery from 3D Point Data Using a Combined Parametric and Geometric Flow Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Classification of discontinuities; Algorithm; Geometric modeling; Parametric statistics; Geometric primitive; Parametric surface; Curvature; Flow (mathematics); Surface (topology); Surface reconstruction; Parametric equation; Point cloud; Generality; Artificial intelligence; Mathematics; Geometry","score_opus":0.03810010864543562,"score_gpt":0.22908603310630926,"score_spread":0.19098592446087365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591335477","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.002105123,0.00004600849,0.9971396,0.000028945497,0.000010322607,0.000024185581,0.000026010099,0.00041880686,0.00020105882],"genre_scores_gemma":[0.04764162,0.00028816197,0.95011985,0.000044857366,0.000040815765,0.00009629636,0.00029347913,0.0002505066,0.0012244413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991854,0.00009120827,0.000046176458,0.00014234845,0.00045552413,0.00007937639],"domain_scores_gemma":[0.9988568,0.00044745437,0.00007689097,0.0002792049,0.0003091775,0.000030430245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289934,0.0012251625,0.0018947138,0.003737465,0.0006639561,0.0019471017,0.002062709,0.0023206451,0.0030082546],"category_scores_gemma":[0.0026467284,0.0011582391,0.0020275444,0.002656572,0.001078039,0.0036721043,0.0024124794,0.001861947,0.0019314876],"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.00012697412,0.00013595884,0.0006189039,0.00022667598,0.00008017052,0.00016372482,0.00018317607,0.123831466,0.08240507,0.009273162,0.0024618402,0.78049296],"study_design_scores_gemma":[0.00001178001,0.000055184453,0.00036029526,0.000018998517,0.000025945687,0.00021327741,0.00004527093,0.9731013,0.015224483,0.008392634,0.0025184923,0.000032243894],"about_ca_topic_score_codex":0.0019137374,"about_ca_topic_score_gemma":0.0020519863,"teacher_disagreement_score":0.003737465,"about_ca_system_score_codex":0.000346608,"about_ca_system_score_gemma":0.0010586623,"threshold_uncertainty_score":0.010063589},"labels":[],"label_agreement":null},{"id":"W1591464522","doi":"10.1007/11795018_23","title":"NEAR: Visualizing Information Relations in a Multimedia Repository","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science; Exhibition; World Wide Web; Similarity (geometry); Process (computing); Information retrieval; Multimedia; Human–computer interaction; Image (mathematics); Artificial intelligence","score_opus":0.016376814634667662,"score_gpt":0.29129255877808896,"score_spread":0.2749157441434213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591464522","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.14210713,0.0046338327,0.6842584,0.0018392795,0.0003541636,0.00059395353,0.035484385,0.10852664,0.022202188],"genre_scores_gemma":[0.33697423,0.003559909,0.6124287,0.00031457716,0.00022010213,0.00051201443,0.020761592,0.006022861,0.019205973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996803,0.000070070746,0.000023027882,0.00006454715,0.00013473234,0.000027341124],"domain_scores_gemma":[0.99908674,0.0004559794,0.00009674507,0.00013774382,0.000090014604,0.00013283089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051326863,0.00122954,0.0007978445,0.006132437,0.001038446,0.004396192,0.001201596,0.0013336004,0.020498268],"category_scores_gemma":[0.0022712888,0.0005314937,0.0006343389,0.005883177,0.00042828053,0.006048488,0.002984517,0.0006796845,0.003211527],"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.00186003,0.00048501015,0.011373336,0.0027138772,0.00029911654,0.00201525,0.008327924,0.018744228,0.05397586,0.038627923,0.16231333,0.6992641],"study_design_scores_gemma":[0.00034524646,0.00051350624,0.021424936,0.0008077197,0.0005733118,0.0033812658,0.00918101,0.41586122,0.05280929,0.15179825,0.3429445,0.000359788],"about_ca_topic_score_codex":0.006190097,"about_ca_topic_score_gemma":0.011630571,"teacher_disagreement_score":0.020498268,"about_ca_system_score_codex":0.0004940187,"about_ca_system_score_gemma":0.0005595088,"threshold_uncertainty_score":0.068573534},"labels":[],"label_agreement":null},{"id":"W1591490220","doi":"10.1007/978-3-540-75757-3_112","title":"Probabilistic Speckle Decorrelation for 3D Ultrasound","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; McGill University Health Centre","funders":"","keywords":"Decorrelation; Speckle pattern; Artificial intelligence; Computer science; Probabilistic logic; Computer vision; Imaging phantom; Speckle noise; Entropy (arrow of time); Calibration; Mathematics; Statistics; Optics; Physics","score_opus":0.010764873034401426,"score_gpt":0.2712122468617391,"score_spread":0.2604473738273377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591490220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003233387,0.00019204835,0.9959805,0.000064095555,0.0000146206585,0.000007937501,0.000034885063,0.00016864511,0.00030377088],"genre_scores_gemma":[0.2336643,0.0016629676,0.759178,0.00021496575,0.00014263258,0.00015563269,0.00047285474,0.00043239183,0.0040762164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898344,0.00035333162,0.000048171773,0.00011718837,0.00043412874,0.00006369107],"domain_scores_gemma":[0.9976373,0.0015486884,0.00018914662,0.00035241342,0.00021677,0.000055716926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121763,0.0007424881,0.0011661546,0.0007217636,0.00037956054,0.0010683439,0.0008810423,0.001328085,0.0021099327],"category_scores_gemma":[0.0048558135,0.0012336245,0.0012583954,0.00092301477,0.0010770392,0.0013126213,0.0023978986,0.0011632362,0.0008072128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003094565,0.00008252547,0.0009276938,0.00032113426,0.00014382818,0.00018894431,0.00020348317,0.6310858,0.03719449,0.056416158,0.003400451,0.26972604],"study_design_scores_gemma":[0.000006326551,0.000014974696,0.00025888628,0.000007309521,0.000010852896,0.0000613503,0.0000056739236,0.9838351,0.0031102817,0.011842554,0.00083104265,0.000015503414],"about_ca_topic_score_codex":0.0014047213,"about_ca_topic_score_gemma":0.0023856256,"teacher_disagreement_score":0.0021099327,"about_ca_system_score_codex":0.00039715026,"about_ca_system_score_gemma":0.0007379558,"threshold_uncertainty_score":0.0070584416},"labels":[],"label_agreement":null},{"id":"W1591499220","doi":"10.1007/3-540-36390-4_18","title":"Crystal Lattice Automata","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geometric and Algebraic Topology","field":"Mathematics","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":"Western University","funders":"","keywords":"Automaton; Lattice (music); Crystal (programming language); Computer science; Quantum finite automata; Automata theory; Theoretical computer science; Programming language; Physics","score_opus":0.03743746530185504,"score_gpt":0.2754160176575586,"score_spread":0.23797855235570353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591499220","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.042414125,0.002449524,0.17521161,0.0025477856,0.0013493586,0.00011957602,0.0008661199,0.0014694915,0.77357244],"genre_scores_gemma":[0.5941741,0.0025309473,0.08644389,0.00084970496,0.00048350732,0.0003738825,0.0015787104,0.00087056885,0.31269467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.00007187588,0.000020989111,0.00007265901,0.00015502717,0.000054593944],"domain_scores_gemma":[0.99960834,0.00011546518,0.000017179218,0.00010434375,0.00010409775,0.000050532224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025972372,0.00047948162,0.000732703,0.0009773513,0.0020190177,0.0031493832,0.0008781993,0.00082104973,0.024732102],"category_scores_gemma":[0.0011045391,0.00044408735,0.00067179755,0.001251697,0.0016782992,0.003854199,0.0016697438,0.0019021012,0.0050654747],"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.000011110406,0.000011160978,0.000032260577,0.000021357067,0.0000025637562,0.000015340946,0.00007554615,0.00069489307,0.0003449505,0.9823607,0.0061877607,0.010242375],"study_design_scores_gemma":[0.0000068491254,0.000005230634,0.000028880837,0.000012432906,0.0000041196363,0.000041868287,0.00006290715,0.0047299773,0.0006325655,0.95988405,0.03458377,0.000007380655],"about_ca_topic_score_codex":0.001827188,"about_ca_topic_score_gemma":0.002542326,"teacher_disagreement_score":0.024732102,"about_ca_system_score_codex":0.0015602487,"about_ca_system_score_gemma":0.0010203768,"threshold_uncertainty_score":0.08273715},"labels":[],"label_agreement":null},{"id":"W1591513817","doi":"10.1007/11670834_6","title":"Developing AMIE: An Adaptive Multimedia Integrated Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Concordia University","funders":"","keywords":"Computer science; Multimedia; Search engine indexing; Presentation (obstetrics); World Wide Web; Information retrieval","score_opus":0.01901763583519407,"score_gpt":0.22649627293544589,"score_spread":0.20747863710025183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591513817","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.009810828,0.000090860216,0.95744485,0.00006746346,0.00005786067,0.00016693243,0.00017130769,0.027323218,0.004866657],"genre_scores_gemma":[0.084678575,0.00018845215,0.89382344,0.00019406616,0.000055355922,0.0002523989,0.0013525662,0.0029066983,0.016548535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960774,0.000045523862,0.000026568905,0.00010187924,0.00017397458,0.0000442994],"domain_scores_gemma":[0.9996238,0.00010560808,0.000020663289,0.00007210724,0.000119637676,0.000058242505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069299166,0.0008146732,0.00052222656,0.00041681324,0.00026658233,0.0010637367,0.002250332,0.00090704917,0.009273856],"category_scores_gemma":[0.0013426738,0.00051791454,0.0005185617,0.00028514606,0.0002613126,0.001741035,0.0016004476,0.001139326,0.0038602434],"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.0010133986,0.00061092945,0.0018668037,0.00041076023,0.00020831052,0.0007728128,0.0007135074,0.019954251,0.28792647,0.01493301,0.02882699,0.6427628],"study_design_scores_gemma":[0.00035286695,0.0010662947,0.0023300603,0.00011311028,0.00026388973,0.001791837,0.000310762,0.38197947,0.3799659,0.010434528,0.22123536,0.00015592643],"about_ca_topic_score_codex":0.00056117185,"about_ca_topic_score_gemma":0.0007586321,"teacher_disagreement_score":0.009273856,"about_ca_system_score_codex":0.00017995095,"about_ca_system_score_gemma":0.000338804,"threshold_uncertainty_score":0.031024158},"labels":[],"label_agreement":null},{"id":"W1591612907","doi":"10.1007/978-3-642-02050-6_20","title":"Does Requirements Clustering Lead to Modular Design?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Western University","funders":"","keywords":"Computer science; Cluster analysis; Modular design; Modularity (biology); Context (archaeology); Principal (computer security); Requirements analysis; Software engineering; Software requirements; Software; Data mining; Software design; Systems engineering; Software development; Artificial intelligence; Programming language; Engineering","score_opus":0.036375245390722226,"score_gpt":0.28345310454249434,"score_spread":0.2470778591517721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591612907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119162835,0.00038273697,0.8327262,0.001431693,0.000081005295,0.00015322267,0.00008568725,0.0016377498,0.04433883],"genre_scores_gemma":[0.6357508,0.00041380586,0.34980258,0.000395951,0.000060852875,0.00014336812,0.00026648733,0.0007804664,0.012385799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974075,0.000973635,0.0001265445,0.0005135273,0.0007219023,0.0002569377],"domain_scores_gemma":[0.9846966,0.007737173,0.0015148292,0.0044755153,0.0012629189,0.00031282424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003719543,0.00074740767,0.0004965968,0.0008589677,0.00078004407,0.0013766282,0.0010987829,0.0011140232,0.009337152],"category_scores_gemma":[0.018358111,0.0010734551,0.0012512346,0.0010268551,0.0013507947,0.004276131,0.0015670313,0.0013010139,0.0022433964],"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.00038679206,0.0002802539,0.0072901268,0.0006736724,0.00016431986,0.00057391176,0.0017735073,0.035790276,0.026553351,0.42563114,0.009253541,0.49162912],"study_design_scores_gemma":[0.00016807961,0.00042342744,0.006753713,0.00038424414,0.00026897367,0.0019264111,0.0012981517,0.21185634,0.040361088,0.69102806,0.045443505,0.00008801364],"about_ca_topic_score_codex":0.00059329043,"about_ca_topic_score_gemma":0.0008972098,"teacher_disagreement_score":0.009337152,"about_ca_system_score_codex":0.000691026,"about_ca_system_score_gemma":0.00088101916,"threshold_uncertainty_score":0.031235874},"labels":[],"label_agreement":null},{"id":"W1591669617","doi":"10.1007/978-3-642-15745-5_3","title":"Evaluation of Inter-session 3D-TRUS to 3D-TRUS Image Registration for Repeat Prostate Biopsies","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Fiducial marker; Prostate biopsy; Computer science; 3D ultrasound; Image registration; Prostate; Repeatability; Artificial intelligence; Prostate gland; Computer vision; Biopsy; Session (web analytics); Medicine; Radiology; Image (mathematics); Ultrasound; Mathematics","score_opus":0.02620276113077361,"score_gpt":0.340567721632468,"score_spread":0.3143649605016944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591669617","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.9082042,0.0036112876,0.08304441,0.0001452408,0.00011742748,0.00020638628,0.00038679058,0.0017302642,0.002553977],"genre_scores_gemma":[0.97399884,0.00035977294,0.02424578,0.000041499094,0.00001924972,0.00004638928,0.00029813853,0.00031771656,0.0006724989],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979728,0.0009725057,0.0001635181,0.00021226442,0.0005749901,0.00010401191],"domain_scores_gemma":[0.99177504,0.0051143663,0.00063293125,0.00072015764,0.0015577332,0.00019973202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004181577,0.00051257195,0.0007022976,0.0009869603,0.00035034958,0.0013669573,0.00080504536,0.00083834596,0.001544691],"category_scores_gemma":[0.016340649,0.00039343775,0.00057343184,0.00051152916,0.00021073993,0.0007791455,0.0005804863,0.00039570528,0.00050499063],"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.020856861,0.00060887035,0.0764936,0.0011578486,0.0010747862,0.0004189808,0.00096426957,0.026276367,0.27427652,0.00074155896,0.001709683,0.59542066],"study_design_scores_gemma":[0.0003210724,0.010027862,0.40489146,0.00013990169,0.0026025113,0.0050312076,0.0007346835,0.30625132,0.26397997,0.0005014265,0.005255145,0.00026337654],"about_ca_topic_score_codex":0.0013478987,"about_ca_topic_score_gemma":0.0023028003,"teacher_disagreement_score":0.004181577,"about_ca_system_score_codex":0.00032188027,"about_ca_system_score_gemma":0.00065141567,"threshold_uncertainty_score":0.022114575},"labels":[],"label_agreement":null},{"id":"W1591713534","doi":"10.1007/978-3-540-76414-4_22","title":"Cumulative Global Distance for Dimension Reduction in Handwritten Digits Database","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Mahalanobis distance; Bhattacharyya distance; Principal component analysis; Computer science; Pattern recognition (psychology); Dimension (graph theory); Eigenvalues and eigenvectors; Dimensionality reduction; Mathematics; Statistics; Artificial intelligence; Combinatorics","score_opus":0.033194525331946764,"score_gpt":0.29639471992671335,"score_spread":0.26320019459476657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591713534","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.16940437,0.0066723656,0.81210715,0.0004425992,0.00043637902,0.00013783573,0.002683361,0.0040274933,0.004088452],"genre_scores_gemma":[0.48147818,0.0023875877,0.493216,0.00012380847,0.00022961828,0.0002053639,0.010631542,0.00033503148,0.011392879],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921656,0.000116051815,0.00006960516,0.00017065478,0.00033991295,0.00008715369],"domain_scores_gemma":[0.99932754,0.00015870338,0.000033696353,0.00017903895,0.00026729083,0.00003371882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005505573,0.00064343197,0.0011348077,0.0016427429,0.0004655074,0.000871967,0.0009791184,0.00044180197,0.0027940765],"category_scores_gemma":[0.0016151667,0.00019946117,0.00070140127,0.0017407608,0.0002794842,0.00086084486,0.00083646836,0.00065316685,0.0009771367],"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.00056343444,0.00011527351,0.0016064154,0.00016084274,0.000070665024,0.00006601684,0.000051969837,0.021713678,0.01799826,0.0034606156,0.017252475,0.93694025],"study_design_scores_gemma":[0.00007490194,0.0004527369,0.011376184,0.000047872545,0.00013378066,0.00043380502,0.00019515473,0.89512974,0.060884867,0.0125154555,0.01867678,0.00007882588],"about_ca_topic_score_codex":0.0047771805,"about_ca_topic_score_gemma":0.005663444,"teacher_disagreement_score":0.0047771805,"about_ca_system_score_codex":0.00047693352,"about_ca_system_score_gemma":0.0010239873,"threshold_uncertainty_score":0.009498775},"labels":[],"label_agreement":null},{"id":"W1591802374","doi":"10.1007/978-3-540-24605-3_26","title":"Effective Preprocessing with Hyper-Resolution and Equality Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":122,"is_retracted":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":"Backtracking; Computer science; DPLL algorithm; Reduction (mathematics); Search tree; Preprocessor; Pruning; Solver; Boolean satisfiability problem; Tree (set theory); Algorithm; Node (physics); Benchmark (surveying); Theoretical computer science; Mathematical optimization; Search algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.01220269376855133,"score_gpt":0.24193617084643781,"score_spread":0.2297334770778865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591802374","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.0063321586,0.0010380283,0.9628072,0.00092232187,0.00036115406,0.00013244456,0.0006123307,0.003907974,0.023886386],"genre_scores_gemma":[0.11074769,0.0009536268,0.85448873,0.0007113818,0.00034438894,0.00023450294,0.0026715915,0.0025927012,0.027255427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961002,0.0010031081,0.00027743453,0.0008097251,0.0012913347,0.00051826506],"domain_scores_gemma":[0.99553394,0.0015580804,0.000111637484,0.002060574,0.00065126613,0.00008436384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015579329,0.001429883,0.0016859439,0.0019902939,0.002035425,0.0041736676,0.004031321,0.0015205026,0.02573397],"category_scores_gemma":[0.0068422384,0.0014296066,0.002437391,0.0038193893,0.0018027725,0.008513758,0.005658505,0.0056232885,0.010281229],"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.00042374694,0.00028011246,0.00046181813,0.0010137294,0.00015708405,0.00039326146,0.0004602037,0.016321914,0.021084458,0.3425202,0.04672917,0.57015437],"study_design_scores_gemma":[0.000083524064,0.00004974828,0.0004123886,0.00014767732,0.0001454237,0.0004162323,0.0002803582,0.073765606,0.05392029,0.7980861,0.072611794,0.00008077554],"about_ca_topic_score_codex":0.0013738007,"about_ca_topic_score_gemma":0.0030298147,"teacher_disagreement_score":0.02573397,"about_ca_system_score_codex":0.0010695542,"about_ca_system_score_gemma":0.0019346745,"threshold_uncertainty_score":0.08608872},"labels":[],"label_agreement":null},{"id":"W1591816673","doi":"10.1007/978-3-540-39658-1_40","title":"I/O-Efficient Undirected Shortest Paths","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.012924077728041194,"score_gpt":0.23852948296908064,"score_spread":0.22560540524103945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591816673","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.26134124,0.00131009,0.6428105,0.0014462607,0.00038923204,0.00062222034,0.0034595283,0.0064529,0.08216801],"genre_scores_gemma":[0.6285536,0.00064709893,0.3415829,0.00025723758,0.00010557174,0.00025614366,0.002895448,0.00088487845,0.02481716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937326,0.00009456289,0.000030928823,0.00016632162,0.00015946894,0.00017533757],"domain_scores_gemma":[0.99842095,0.00063052116,0.00018116603,0.0004155566,0.00019682085,0.0001549573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036352404,0.0011761318,0.0009890622,0.0011833238,0.0009630233,0.0013679855,0.0022034235,0.00085673906,0.010738313],"category_scores_gemma":[0.003311669,0.00042297153,0.0005852696,0.0024957957,0.00051639776,0.0020012541,0.0019835324,0.0010072538,0.0017140125],"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.0015020969,0.00071343506,0.0017695692,0.0008288645,0.00007459879,0.0003096121,0.00031388944,0.35791913,0.031587128,0.048989564,0.044976275,0.5110158],"study_design_scores_gemma":[0.00024317058,0.00031529006,0.0008946966,0.000058266232,0.000088052155,0.00022522571,0.0002970324,0.86854047,0.016717907,0.10062054,0.011961254,0.000038123915],"about_ca_topic_score_codex":0.0033136036,"about_ca_topic_score_gemma":0.0075074364,"teacher_disagreement_score":0.010738313,"about_ca_system_score_codex":0.0009816113,"about_ca_system_score_gemma":0.0015970629,"threshold_uncertainty_score":0.035923243},"labels":[],"label_agreement":null},{"id":"W1591826096","doi":"10.1007/978-3-540-71805-5_2","title":"Evolving Buffer Overflow Attacks with Detector Feedback","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"","keywords":"Buffer overflow; Buffer (optical fiber); Computer science; Detector; Computer security; Computer network; Telecommunications","score_opus":0.016236492360174683,"score_gpt":0.23631259191638795,"score_spread":0.22007609955621327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591826096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25067016,0.000502318,0.73264664,0.0009252202,0.00025611266,0.00013704279,0.00016185561,0.003939268,0.010761286],"genre_scores_gemma":[0.9485414,0.00010697269,0.04665049,0.00013571556,0.000059553982,0.000039031318,0.000074795156,0.000102767954,0.0042892327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989563,0.00022575224,0.00004105318,0.00016735909,0.00044260715,0.00016683736],"domain_scores_gemma":[0.99399066,0.0037358007,0.00043558466,0.00078894955,0.0007524348,0.00029660756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917185,0.0008268365,0.0009548799,0.000754296,0.00045167364,0.0010779703,0.0014370873,0.0014594961,0.0026070261],"category_scores_gemma":[0.012020702,0.00041168087,0.0004004925,0.0005183541,0.0008358908,0.0020535463,0.0017019964,0.0015210855,0.0003985469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078739057,0.00029075664,0.002761586,0.00010227759,0.00008458314,0.00043480357,0.00017094836,0.7245034,0.02531942,0.04054914,0.005092318,0.19990343],"study_design_scores_gemma":[0.000013175639,0.000038809838,0.000116071256,0.0000032397668,0.000008041059,0.00006259915,0.000005527066,0.9891472,0.0029075504,0.00737319,0.00031888913,0.0000057854754],"about_ca_topic_score_codex":0.0010810035,"about_ca_topic_score_gemma":0.0011320695,"teacher_disagreement_score":0.0026070261,"about_ca_system_score_codex":0.0009724369,"about_ca_system_score_gemma":0.00065287127,"threshold_uncertainty_score":0.008721352},"labels":[],"label_agreement":null},{"id":"W1591837821","doi":"10.1007/978-3-540-24709-8_63","title":"GTVIS: Fast and Efficient Rendering System for Real-Time Terrain Visualization","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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 Calgary","funders":"","keywords":"Computer graphics (images); Terrain; Rendering (computer graphics); Computer science; Visualization; Real-time rendering; Artificial intelligence; Geography; Cartography","score_opus":0.014138335486424212,"score_gpt":0.2706324590604643,"score_spread":0.25649412357404006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591837821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072586117,0.00033413759,0.6686058,0.00018328243,0.0003020837,0.00017554838,0.0044537825,0.3067448,0.011941913],"genre_scores_gemma":[0.13357908,0.001292266,0.71506125,0.0006311418,0.00023398953,0.00065224763,0.022099527,0.08042254,0.04602804],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972004,0.000026418391,0.000016551137,0.000037966078,0.00015079204,0.00004820964],"domain_scores_gemma":[0.9996191,0.0000811734,0.000016580143,0.00009413783,0.00012330373,0.000065657216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003977153,0.0016729151,0.0011270231,0.0012219731,0.0005540795,0.0016958201,0.0022783754,0.0010867915,0.04132421],"category_scores_gemma":[0.0010593589,0.001069135,0.0010798208,0.0010090523,0.00035734824,0.0014745536,0.0014584083,0.0017387443,0.0127482535],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012990228,0.00018625645,0.0011485033,0.0005555195,0.00021337652,0.00060345046,0.000668789,0.019125262,0.10193776,0.012813439,0.46639207,0.39505664],"study_design_scores_gemma":[0.00095456676,0.00021473206,0.0022952545,0.00015597572,0.00023527228,0.0010622346,0.00019125878,0.45368075,0.16269785,0.022465827,0.35576203,0.00028420668],"about_ca_topic_score_codex":0.004062616,"about_ca_topic_score_gemma":0.004581693,"teacher_disagreement_score":0.04132421,"about_ca_system_score_codex":0.00046731826,"about_ca_system_score_gemma":0.0007110291,"threshold_uncertainty_score":0.1382432},"labels":[],"label_agreement":null},{"id":"W1591856724","doi":"10.1007/978-3-540-30570-5_23","title":"First-Order Query Rewriting for Inconsistent Databases","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Rewriting; Class (philosophy); Conjunctive query; Query language; Query optimization; Boolean conjunctive query; Database query; Database; Sargable; Data integrity; Order (exchange); Information retrieval; Web search query; Programming language; Relational database; Search engine; Artificial intelligence","score_opus":0.033056032078094426,"score_gpt":0.2629440349701871,"score_spread":0.22988800289209266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591856724","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.011958516,0.0013729982,0.97559774,0.0006793591,0.00020536753,0.000106401516,0.00023363897,0.0019566382,0.007889336],"genre_scores_gemma":[0.25287434,0.0014736161,0.7261115,0.0005555591,0.00033812074,0.00017275455,0.0014168122,0.0016569283,0.015400369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920723,0.0019529767,0.0008758521,0.0007466297,0.0037970995,0.0005551292],"domain_scores_gemma":[0.98784876,0.0060209236,0.00041585453,0.003850318,0.0016531497,0.00021110891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059215017,0.00074455206,0.0017895655,0.001330097,0.0013231364,0.0035151746,0.0033943001,0.001434812,0.0040169763],"category_scores_gemma":[0.015396532,0.001267993,0.0020144063,0.002306728,0.002560346,0.0066677216,0.0028142785,0.0041837534,0.0011344618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017547703,0.00012536008,0.000925652,0.000668268,0.000118921365,0.0006620092,0.0017893229,0.016187672,0.009927501,0.786996,0.016156185,0.16626765],"study_design_scores_gemma":[0.000059019712,0.000071357616,0.00026573575,0.000072652205,0.00014066305,0.0008742398,0.0002786029,0.0903557,0.015347556,0.85718054,0.0352814,0.0000724982],"about_ca_topic_score_codex":0.0022701328,"about_ca_topic_score_gemma":0.0020446603,"teacher_disagreement_score":0.0059215017,"about_ca_system_score_codex":0.0016680292,"about_ca_system_score_gemma":0.0015149789,"threshold_uncertainty_score":0.03131622},"labels":[],"label_agreement":null},{"id":"W1592093873","doi":"10.1007/11840541_25","title":"Use Your Illusion: Sensorimotor Self-simulation Allows Complex Agents to Plan with Incomplete Self-knowledge","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embodied and Extended Cognition","field":"Neuroscience","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Illusion; Plan (archaeology); Self-knowledge; Human–computer interaction; Artificial intelligence; Cognitive psychology; Psychology; Social psychology","score_opus":0.08480308325208709,"score_gpt":0.2903913817498182,"score_spread":0.20558829849773114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592093873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08696416,0.0002975598,0.87625134,0.0010523516,0.00016361427,0.000036954207,0.00009383873,0.0021939878,0.032946248],"genre_scores_gemma":[0.81121147,0.00036690605,0.17414033,0.00025246045,0.000028047602,0.00007010734,0.00013578718,0.00035723776,0.01343756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991894,0.000018224744,0.0000043682817,0.000020520256,0.000027863083,0.000010041191],"domain_scores_gemma":[0.99958736,0.00021309502,0.000030009272,0.00010556013,0.000022985658,0.00004098461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027819033,0.00040780145,0.00022383555,0.000106864536,0.00019412594,0.00091851427,0.0006692934,0.0007464365,0.004951654],"category_scores_gemma":[0.0013355731,0.00023811952,0.00030874636,0.00012286317,0.0012621334,0.0026753258,0.0014396104,0.0012240934,0.00049387466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061163714,0.00016530835,0.0014036978,0.00022938276,0.000085477346,0.00062857947,0.0018917673,0.061591957,0.11327571,0.57716537,0.00951233,0.23343873],"study_design_scores_gemma":[0.000099219906,0.00021169457,0.00083754613,0.00004579046,0.00005635025,0.000612057,0.00020511978,0.44485247,0.045854416,0.4821208,0.025058186,0.000046352583],"about_ca_topic_score_codex":0.0002630529,"about_ca_topic_score_gemma":0.00027041676,"teacher_disagreement_score":0.004951654,"about_ca_system_score_codex":0.0001281292,"about_ca_system_score_gemma":0.00023874626,"threshold_uncertainty_score":0.016564965},"labels":[],"label_agreement":null},{"id":"W1592173722","doi":"10.1007/978-3-540-44400-8_9","title":"On the Minimum Perimeter Triangle Enclosing a Convex Polygon","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Windsor; Simon Fraser University","funders":"","keywords":"Perimeter; Polygon (computer graphics); Regular polygon; Property (philosophy); Star-shaped polygon; Polygon covering; Rectilinear polygon; Combinatorics; Convex polygon; Computer science; Mathematics; Simple polygon; Convex set; Geometry; Convex optimization","score_opus":0.022989547071437112,"score_gpt":0.246375315216998,"score_spread":0.22338576814556088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592173722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0879021,0.0012580681,0.82242376,0.00083878,0.00041004206,0.00011554841,0.00039002392,0.00032797578,0.08633372],"genre_scores_gemma":[0.5426019,0.002337945,0.4082457,0.0003210552,0.0004432252,0.00016324014,0.0012173516,0.0010805172,0.043589063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997079,0.00007421082,0.000013699608,0.00005111571,0.00012495989,0.000028080294],"domain_scores_gemma":[0.9992756,0.0004570762,0.000049793452,0.0000776772,0.00008905081,0.00005073759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039940895,0.0006061664,0.0010824662,0.0010029619,0.0006110997,0.0011824257,0.0014991352,0.0010789586,0.009133255],"category_scores_gemma":[0.0036090463,0.0005795714,0.00058251014,0.0012029856,0.0016467504,0.001703221,0.0021589613,0.0021584455,0.0015641631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052408694,0.000049656024,0.0010155394,0.0005267451,0.000026019941,0.0005652387,0.00070731534,0.11851497,0.011915582,0.63646793,0.018349517,0.21133736],"study_design_scores_gemma":[0.000053359134,0.00010880427,0.00056921784,0.00009317695,0.000021394611,0.00051604654,0.00025604546,0.38898966,0.002255622,0.58322,0.023891551,0.00002514452],"about_ca_topic_score_codex":0.0017920067,"about_ca_topic_score_gemma":0.0016830852,"teacher_disagreement_score":0.009133255,"about_ca_system_score_codex":0.00047196617,"about_ca_system_score_gemma":0.0002463728,"threshold_uncertainty_score":0.030553758},"labels":[],"label_agreement":null},{"id":"W1592178743","doi":"10.1007/978-3-540-25957-2_33","title":"Flexible User Interface for Converting Relational Data into XML","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Calgary","funders":"","keywords":"Computer science; XML validation; XML Schema Editor; XML database; Document Structure Description; Efficient XML Interchange; Streaming XML; XML Encryption; XML; XML Schema (W3C); Information retrieval; RELAX NG; Relational database; Database; Programming language; World Wide Web","score_opus":0.045171638871911175,"score_gpt":0.3006949604193496,"score_spread":0.25552332154743845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592178743","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.0042419764,0.00027123856,0.72501117,0.0002687925,0.00023600971,0.0002781342,0.0041081524,0.2554377,0.010146842],"genre_scores_gemma":[0.11013229,0.00070442795,0.6836963,0.0020694972,0.00023279978,0.0017017799,0.026443532,0.077562205,0.09745707],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989483,0.00016883321,0.00014335988,0.0001882052,0.00044765134,0.000103705],"domain_scores_gemma":[0.9971214,0.0014065874,0.000076105076,0.0007675932,0.0004789949,0.00014925883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002236865,0.0018746662,0.0011736512,0.0018247518,0.00073012756,0.0026650387,0.0030928424,0.001857037,0.07259313],"category_scores_gemma":[0.006053848,0.0013377041,0.0010983177,0.0016160941,0.00054780446,0.0035550792,0.003672483,0.0018631571,0.023786604],"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.0021848704,0.00031336036,0.0017807853,0.00085966144,0.0001367285,0.0016115125,0.0014093238,0.0021836685,0.061098814,0.020441985,0.36324766,0.54473174],"study_design_scores_gemma":[0.00075778936,0.00039119224,0.0032549885,0.0004565348,0.00026751336,0.003091929,0.0004313457,0.11329623,0.20009437,0.024942134,0.6525533,0.00046272445],"about_ca_topic_score_codex":0.0016661255,"about_ca_topic_score_gemma":0.0020851495,"teacher_disagreement_score":0.07259313,"about_ca_system_score_codex":0.00053240685,"about_ca_system_score_gemma":0.0005323338,"threshold_uncertainty_score":0.24284822},"labels":[],"label_agreement":null},{"id":"W1592201811","doi":"10.1007/978-3-642-10331-5_88","title":"Automatic Data-Driven Parameterization for Phase-Based Bone Localization in US Using Log-Gabor Filters","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Phase congruency; Hessian matrix; Artificial intelligence; Feature extraction; Pattern recognition (psychology); Filter (signal processing); Gabor filter; Curvature; Computer vision; Invariant (physics); Algorithm; Mathematics","score_opus":0.05062558824357933,"score_gpt":0.333652538710691,"score_spread":0.2830269504671117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592201811","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.0059894556,0.00017084375,0.9919897,0.00005249433,0.000022522285,0.000022114022,0.00010957037,0.0012757585,0.00036754334],"genre_scores_gemma":[0.10536108,0.0005005897,0.8911184,0.000097017284,0.000027494678,0.00014186378,0.00061747,0.0006298143,0.0015062006],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977714,0.000033502707,0.000018550045,0.000050075283,0.000096699434,0.000024002702],"domain_scores_gemma":[0.9995635,0.00018882827,0.00004224699,0.000074779986,0.00011703143,0.000013532109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045963787,0.0006318505,0.0007047988,0.00092077546,0.00023720087,0.0011520474,0.000810823,0.0008061397,0.00272186],"category_scores_gemma":[0.0016530999,0.00060229126,0.0005005873,0.001217543,0.00030978036,0.0010297274,0.0008010917,0.0008869455,0.0019587527],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029438385,0.000066612614,0.0007032997,0.00025046416,0.000038413586,0.000084349296,0.00011965175,0.024261516,0.30550185,0.0033497901,0.003309086,0.66202056],"study_design_scores_gemma":[0.0000387404,0.00008849898,0.003590992,0.00006674007,0.00007850773,0.00070710987,0.00009846117,0.7192427,0.25521407,0.006810756,0.013973182,0.00009024662],"about_ca_topic_score_codex":0.00104252,"about_ca_topic_score_gemma":0.002029958,"teacher_disagreement_score":0.00272186,"about_ca_system_score_codex":0.00034385404,"about_ca_system_score_gemma":0.00065759226,"threshold_uncertainty_score":0.009105504},"labels":[],"label_agreement":null},{"id":"W1592242929","doi":"10.1007/978-3-642-15399-0_18","title":"The Video Cube Puzzle: On Investigating Temporal Coordination","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","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 British Columbia","funders":"","keywords":"Cube (algebra); Computer science; Timeline; Representation (politics); Segmentation; Set (abstract data type); Artificial intelligence; Simple (philosophy); Computer vision; Mathematics; Combinatorics","score_opus":0.014667466300239965,"score_gpt":0.23267376391739675,"score_spread":0.21800629761715679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592242929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13310795,0.006932689,0.7321123,0.004226798,0.0004497713,0.00015874062,0.00090641883,0.00038417373,0.121721126],"genre_scores_gemma":[0.6154527,0.0044486956,0.35647485,0.0006534863,0.00045304542,0.00036125202,0.0013918033,0.0004935705,0.020270597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994649,0.00019917791,0.00003424659,0.00015858117,0.00009638718,0.000046778343],"domain_scores_gemma":[0.9966967,0.0021670414,0.00040889505,0.00039612723,0.00019452495,0.00013676101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444904,0.001093955,0.00085418165,0.0010405781,0.00093765487,0.0025444333,0.0022944098,0.001787489,0.011356568],"category_scores_gemma":[0.010417217,0.00047094718,0.0006754439,0.0024762587,0.0024497292,0.008489148,0.0027291584,0.0013882377,0.0012106899],"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.00067872554,0.00011669908,0.0037574894,0.00066577934,0.00007306491,0.00051411684,0.0040467028,0.020587595,0.008990388,0.75188184,0.012092446,0.1965951],"study_design_scores_gemma":[0.000095001524,0.0001286489,0.0031690937,0.00017156516,0.000040658604,0.00037934387,0.0014608086,0.09280129,0.0022825648,0.88200396,0.017418128,0.00004893329],"about_ca_topic_score_codex":0.003121833,"about_ca_topic_score_gemma":0.0024467027,"teacher_disagreement_score":0.011356568,"about_ca_system_score_codex":0.00043379192,"about_ca_system_score_gemma":0.0008178638,"threshold_uncertainty_score":0.037991464},"labels":[],"label_agreement":null},{"id":"W1592266906","doi":"10.1007/978-3-642-14162-1_42","title":"Tell Me Where I Am So I Can Meet You Sooner","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":44,"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; Université du Québec à Montréal","funders":"","keywords":"Rendezvous; Computer science; Asynchronous communication; Visibility; Bounded function; Plane (geometry); Multi-agent system; Position (finance); Algorithm; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.01581950816149603,"score_gpt":0.24394778007968862,"score_spread":0.2281282719181926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592266906","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018226133,0.0077909953,0.012108505,0.029217754,0.017136386,0.000097464785,0.00040384664,0.0009951971,0.9304273],"genre_scores_gemma":[0.0028723378,0.002189962,0.001221624,0.0040073236,0.00084396184,0.00003283787,0.000071578,0.0001911202,0.98856914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985147,0.00002293895,0.000004160528,0.000026673291,0.00007106328,0.000023638662],"domain_scores_gemma":[0.9995735,0.000066679095,0.00002601904,0.00003740023,0.00012581379,0.00017063582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002906631,0.0008547255,0.0006033812,0.0004974327,0.001706529,0.0027477462,0.0006010922,0.0012548752,0.2515537],"category_scores_gemma":[0.0016467371,0.00032439598,0.00047905336,0.00047743745,0.0005357455,0.0036475912,0.0019630522,0.003740419,0.2632955],"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.000018578494,0.000027811828,0.00011485664,0.000052638887,0.00000568474,0.000064546686,0.00037782983,0.000053873926,0.00040994622,0.008129718,0.9061352,0.08460932],"study_design_scores_gemma":[0.000004555624,0.000013298592,0.00017083135,0.00007343659,0.000004181787,0.00020609044,0.00037723785,0.000055987726,0.000108777305,0.0035082633,0.9954704,0.0000069318653],"about_ca_topic_score_codex":0.0008120988,"about_ca_topic_score_gemma":0.0019563157,"teacher_disagreement_score":0.2515537,"about_ca_system_score_codex":0.00043707978,"about_ca_system_score_gemma":0.0004910626,"threshold_uncertainty_score":0.84153104},"labels":[],"label_agreement":null},{"id":"W1592291313","doi":"10.1007/11430919_30","title":"Considering Re-occurring Features in Associative Classifiers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Associative property; Computer science; Association rule learning; Artificial intelligence; Repetition (rhetorical device); Class (philosophy); Binary classification; Binary number; Association (psychology); Pattern recognition (psychology); Machine learning; Data mining; Support vector machine; Mathematics; Arithmetic","score_opus":0.024903828036657423,"score_gpt":0.27236170801453186,"score_spread":0.24745787997787444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592291313","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.21304835,0.0032830886,0.77072036,0.00076132966,0.0011583036,0.00027135236,0.000662411,0.0018873862,0.008207471],"genre_scores_gemma":[0.8138164,0.001250153,0.17322008,0.0003267691,0.00092136505,0.0001981471,0.0016105858,0.0003683905,0.008288124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968856,0.0006503696,0.00034194515,0.0006554593,0.0011815056,0.00028516186],"domain_scores_gemma":[0.98538905,0.007808312,0.00061611214,0.0029292367,0.0029867347,0.00027061356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037145214,0.0009901333,0.0019802784,0.0027616117,0.0014080516,0.0026252177,0.0021718019,0.0021217775,0.004293056],"category_scores_gemma":[0.019770794,0.00054619653,0.0010657466,0.0034810167,0.0007524732,0.0070124003,0.0015885533,0.0021415998,0.0020152282],"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.0011497756,0.0005034238,0.013784662,0.0005083617,0.00029200863,0.0008760255,0.0003004195,0.03324409,0.014756872,0.013168878,0.011152614,0.91026294],"study_design_scores_gemma":[0.000062073326,0.00040055445,0.0055318787,0.00019090668,0.000586458,0.0015583585,0.00035171662,0.88039094,0.021232048,0.08077689,0.008838256,0.00007984775],"about_ca_topic_score_codex":0.0015900672,"about_ca_topic_score_gemma":0.002919927,"teacher_disagreement_score":0.004293056,"about_ca_system_score_codex":0.00043460066,"about_ca_system_score_gemma":0.000939793,"threshold_uncertainty_score":0.019644499},"labels":[],"label_agreement":null},{"id":"W1592309636","doi":"10.1007/11867586_64","title":"IntelliSearch: Intelligent Search for Images and Text on the Web","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Dalhousie University","funders":"","keywords":"Computer science; Information retrieval; Web page; Search engine indexing; Image retrieval; World Wide Web; The Internet; Static web page; Web search engine; Ranking (information retrieval); HITS algorithm; Data Web; Semantic Web Stack; Semantic Web; Web navigation; Image (mathematics); Artificial intelligence","score_opus":0.04585512301277724,"score_gpt":0.2911071042946635,"score_spread":0.24525198128188627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592309636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06722018,0.02803046,0.629145,0.0027361473,0.00076527946,0.000733828,0.028161759,0.16561952,0.077587746],"genre_scores_gemma":[0.19530137,0.011336062,0.5945141,0.0012977332,0.0005430596,0.00041893517,0.05262085,0.005637405,0.13833049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.000039438753,0.000023389384,0.000065148524,0.00017646978,0.00003801997],"domain_scores_gemma":[0.9996517,0.0001631386,0.00002507269,0.00005271638,0.00006463037,0.000042917618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004456003,0.00096907123,0.001282063,0.0034546102,0.0004637385,0.0020509984,0.0015791346,0.00075650704,0.021507801],"category_scores_gemma":[0.0012956434,0.00037595668,0.00044287022,0.0028580625,0.0003865112,0.0037509848,0.0014225547,0.0006017754,0.013960652],"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.00039334758,0.00017244324,0.0015248402,0.0005357887,0.00007460276,0.00022694813,0.00018812492,0.0008174451,0.022027325,0.005643939,0.2170582,0.75133705],"study_design_scores_gemma":[0.00032931063,0.0006445579,0.015129182,0.00037527483,0.0003469798,0.0040646717,0.00081741955,0.1945265,0.13571349,0.058991082,0.58884424,0.00021731487],"about_ca_topic_score_codex":0.0025031609,"about_ca_topic_score_gemma":0.0055240337,"teacher_disagreement_score":0.021507801,"about_ca_system_score_codex":0.0004218147,"about_ca_system_score_gemma":0.00047907385,"threshold_uncertainty_score":0.07195073},"labels":[],"label_agreement":null},{"id":"W1592318583","doi":"10.1007/978-3-540-79576-6_11","title":"Evaluation and Analysis of a Common Model for Ubiquitous Systems Interoperability","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interoperability; Computer science; World Wide Web","score_opus":0.06617068599187466,"score_gpt":0.30554078752513125,"score_spread":0.2393701015332566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592318583","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.5995666,0.00053722627,0.36400142,0.0018512994,0.0001302643,0.0016453482,0.0006913539,0.0014660313,0.030110355],"genre_scores_gemma":[0.9206639,0.00014903754,0.07664532,0.00008660721,0.000020300682,0.0005075324,0.00074433855,0.00020200174,0.0009809129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95786774,0.015980523,0.0029380587,0.00345994,0.01736967,0.0023841823],"domain_scores_gemma":[0.872924,0.07066743,0.005926738,0.027186032,0.021371419,0.0019243356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035401482,0.0010431916,0.0012616905,0.0036383248,0.001776904,0.009656622,0.0036908237,0.0026727736,0.0049582887],"category_scores_gemma":[0.13322194,0.0005521594,0.0020427823,0.0034753727,0.004623598,0.018665213,0.006768578,0.0029418657,0.0007377315],"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.005148158,0.002948334,0.04790517,0.0015475539,0.0007911281,0.00036279185,0.006520406,0.15980169,0.01267056,0.43269607,0.005263505,0.3243447],"study_design_scores_gemma":[0.00031770777,0.0029006978,0.013955733,0.00047141872,0.00091684196,0.0002682313,0.0057251365,0.83347213,0.017688192,0.11392896,0.01021443,0.00014039465],"about_ca_topic_score_codex":0.0076275747,"about_ca_topic_score_gemma":0.0046546706,"teacher_disagreement_score":0.035401482,"about_ca_system_score_codex":0.006594905,"about_ca_system_score_gemma":0.0058929427,"threshold_uncertainty_score":0.18722314},"labels":[],"label_agreement":null},{"id":"W1592347616","doi":"10.1007/11866565_39","title":"An Inverse Kinematics Model For Post-operative Knee","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Kinematics; Ligament; Inverse kinematics; Total knee replacement; Computer science; Kalman filter; Mathematics; Anatomy; Physics; Medicine; Artificial intelligence; Surgery","score_opus":0.015140746347533407,"score_gpt":0.28931640190048713,"score_spread":0.2741756555529537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592347616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019675545,0.00021652627,0.9721501,0.00023664902,0.00009481903,0.00007143888,0.00057089364,0.0010740597,0.005910045],"genre_scores_gemma":[0.9036617,0.00066699635,0.072865434,0.0001238412,0.00004697806,0.00036610896,0.0012568163,0.00017861249,0.02083349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976236,0.00004211017,0.000017507718,0.000055429788,0.000092037866,0.00003055923],"domain_scores_gemma":[0.9997632,0.00007979384,0.00003788919,0.000026638272,0.000080028265,0.000012471302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033768424,0.00082371494,0.00094463886,0.0005580843,0.00032203743,0.0010811873,0.00095210335,0.00190881,0.0061050886],"category_scores_gemma":[0.0011640348,0.0006946268,0.0010637399,0.00048257966,0.0003314375,0.000750265,0.0006515529,0.0009899277,0.003433229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007488071,0.000048047896,0.0008061655,0.00010094998,0.000031847096,0.00020271193,0.000075542666,0.9545202,0.0036577445,0.0025836346,0.0008265068,0.03707162],"study_design_scores_gemma":[0.000014132531,0.00007784717,0.00074050407,0.000014633622,0.000022439877,0.0001233331,0.000021359867,0.9949916,0.0008383652,0.0014436161,0.0016991578,0.0000129952095],"about_ca_topic_score_codex":0.015562103,"about_ca_topic_score_gemma":0.011719003,"teacher_disagreement_score":0.015562103,"about_ca_system_score_codex":0.00038206656,"about_ca_system_score_gemma":0.001184935,"threshold_uncertainty_score":0.030943096},"labels":[],"label_agreement":null},{"id":"W1592359484","doi":"10.1007/3-540-45251-6_5","title":"Model-Checking Over Multi-Valued Logics","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":69,"is_retracted":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":"Correctness; Computer science; Model checking; Extension (predicate logic); Semantics (computer science); Theoretical computer science; Computation tree logic; Temporal logic; CTL*; Programming language","score_opus":0.08175201863392131,"score_gpt":0.3215951428315679,"score_spread":0.2398431241976466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592359484","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.029653331,0.00056149624,0.9621446,0.00043048538,0.00009828591,0.00008844201,0.00023154193,0.0027280485,0.0040637394],"genre_scores_gemma":[0.66868734,0.00063669536,0.32466257,0.0002963143,0.00009803573,0.00017425849,0.00057838246,0.0005841553,0.0042821905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934603,0.0021043497,0.0005196069,0.0010137778,0.002379651,0.000522412],"domain_scores_gemma":[0.9848914,0.011743268,0.000743792,0.0017338195,0.0006854662,0.00020227338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048341905,0.0014322305,0.0014426378,0.0018247867,0.0010942353,0.0042894194,0.0031903728,0.0014420211,0.003946953],"category_scores_gemma":[0.016175888,0.001850485,0.0033079344,0.0019389245,0.0030951325,0.010743612,0.003930584,0.003981693,0.00052464363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069085316,0.00016735945,0.0017234258,0.0008673669,0.000306723,0.00041156725,0.00044373915,0.21791294,0.014977847,0.6273283,0.0028217763,0.13234806],"study_design_scores_gemma":[0.00011806574,0.00005237882,0.00017208651,0.00011482023,0.00012473998,0.00012145685,0.00005883613,0.3771989,0.020460399,0.59873,0.0028087876,0.00003948941],"about_ca_topic_score_codex":0.0030051416,"about_ca_topic_score_gemma":0.004097455,"teacher_disagreement_score":0.0048341905,"about_ca_system_score_codex":0.0032574714,"about_ca_system_score_gemma":0.001975806,"threshold_uncertainty_score":0.025565922},"labels":[],"label_agreement":null},{"id":"W1592391206","doi":"10.1007/3-540-45724-0_4","title":"An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Glycosylation and Glycoproteins Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":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":"Ant colony optimization algorithms; Computer science; Protein structure prediction; Benchmark (surveying); Focus (optics); Protein folding; Algorithm; Folding (DSP implementation); Ant colony; Structural bioinformatics; Sequence (biology); Protein structure; Chemistry","score_opus":0.017265262392067788,"score_gpt":0.27181126025580815,"score_spread":0.2545459978637404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592391206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028468195,0.0004060323,0.9614792,0.00036574758,0.00014705697,0.00015013915,0.000086894615,0.00087798625,0.008018723],"genre_scores_gemma":[0.20013866,0.00026022716,0.7927835,0.00020566177,0.000073274896,0.0004404117,0.00020199729,0.0002171134,0.0056792106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997675,0.000077692166,0.000011280092,0.00004106501,0.00007244746,0.00002996837],"domain_scores_gemma":[0.9994873,0.00031197607,0.000034515204,0.000037468508,0.00009293793,0.000035785273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005887998,0.00087242824,0.001320728,0.00051686337,0.0006508612,0.00064383686,0.0014847894,0.0016479675,0.0040450413],"category_scores_gemma":[0.0013387576,0.0005592579,0.00063839875,0.00072556006,0.0006081455,0.0006630875,0.0012615522,0.0010063425,0.0006458545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084683415,0.00007010439,0.0002864885,0.00006475303,0.000029217337,0.000068662746,0.00005131824,0.8954595,0.0014622712,0.004356585,0.0022798786,0.09578659],"study_design_scores_gemma":[0.000017683085,0.000016630616,0.000032834923,0.0000027482145,0.000003663215,0.000010590316,0.0000057465268,0.99788195,0.00011714482,0.0015464732,0.00036218998,0.0000023458442],"about_ca_topic_score_codex":0.0057377336,"about_ca_topic_score_gemma":0.004832922,"teacher_disagreement_score":0.0057377336,"about_ca_system_score_codex":0.00049206975,"about_ca_system_score_gemma":0.00093093055,"threshold_uncertainty_score":0.013531983},"labels":[],"label_agreement":null},{"id":"W1592463758","doi":"10.1007/11566489_25","title":"A Novel Incremental Technique for Ultrasound to CT Bone Surface Registration Using Unscented Kalman Filtering","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Queen's University","funders":"","keywords":"Kalman filter; Computer science; Iterative closest point; Computer vision; Artificial intelligence; Image registration; Data set; Algorithm; Surface (topology); Image (mathematics); Mathematics","score_opus":0.01910207158663086,"score_gpt":0.255544393252656,"score_spread":0.23644232166602513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592463758","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.0027732078,0.000073114206,0.99628204,0.000024802632,0.000041531366,0.00002053549,0.000014117189,0.00051831023,0.0002524198],"genre_scores_gemma":[0.035332046,0.00015036976,0.9624502,0.00004725755,0.00005306918,0.00006463784,0.0001103447,0.00015194216,0.0016401097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991947,0.00008014998,0.00004644608,0.00014839221,0.00048178146,0.000048469727],"domain_scores_gemma":[0.99899775,0.00031973957,0.000080445905,0.00018573175,0.00037458423,0.000041757354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836835,0.00067569566,0.00090963085,0.0010156614,0.00044058153,0.0008407331,0.0018638169,0.00085977186,0.0033542088],"category_scores_gemma":[0.0021755476,0.00084633054,0.00086326274,0.0010179819,0.00040156697,0.0012259131,0.0013747017,0.0010618122,0.0015645437],"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.0002011226,0.00009474726,0.0007465744,0.00015244192,0.00008582924,0.00013619867,0.00016036407,0.017023211,0.09580885,0.0044425423,0.0028275345,0.8783206],"study_design_scores_gemma":[0.000039637984,0.00025695274,0.00193028,0.000019518417,0.00012470034,0.0009027742,0.000056396922,0.9082611,0.0723504,0.0023141003,0.013669857,0.000074218515],"about_ca_topic_score_codex":0.0030493597,"about_ca_topic_score_gemma":0.007023997,"teacher_disagreement_score":0.0033542088,"about_ca_system_score_codex":0.00031484652,"about_ca_system_score_gemma":0.0010235787,"threshold_uncertainty_score":0.011220992},"labels":[],"label_agreement":null},{"id":"W1592583067","doi":"10.1007/11566465_111","title":"Kinematic Geometry of Osteotomies","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Hip disorders and treatments","field":"Medicine","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Osteotomy; Kinematics; Computer science; Malunion; Orthodontics; Artificial intelligence; Medicine; Physics","score_opus":0.010968487510271133,"score_gpt":0.27773567963095713,"score_spread":0.266767192120686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592583067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42313942,0.0015804607,0.5253553,0.00088472944,0.00019854009,0.00015172399,0.0016660991,0.00044001188,0.046583746],"genre_scores_gemma":[0.9540685,0.00080607296,0.03434761,0.000034205605,0.00006759618,0.000074000665,0.0007906936,0.00009805796,0.0097132865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995116,0.000093581984,0.000027935313,0.0000948912,0.00022500292,0.000047075682],"domain_scores_gemma":[0.999385,0.00014294639,0.00018229097,0.000048871207,0.00017946088,0.00006141888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024777942,0.00039418068,0.00047798207,0.0017055398,0.00046848142,0.001564093,0.0008081421,0.0004776956,0.007658801],"category_scores_gemma":[0.0017990428,0.00059178704,0.00043839272,0.0009814977,0.0010026337,0.00082510227,0.0008951937,0.000696838,0.0012005052],"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.0003011102,0.0001038436,0.007978132,0.00021508422,0.000051691837,0.0007491185,0.000504581,0.19169322,0.015325685,0.6202921,0.0052818297,0.15750358],"study_design_scores_gemma":[0.00011696106,0.0006828225,0.02746395,0.0001622452,0.0000494835,0.0032522155,0.0011166865,0.4243807,0.008751716,0.4966264,0.037259188,0.00013764542],"about_ca_topic_score_codex":0.002067362,"about_ca_topic_score_gemma":0.0022583853,"teacher_disagreement_score":0.007658801,"about_ca_system_score_codex":0.0004936784,"about_ca_system_score_gemma":0.0005413216,"threshold_uncertainty_score":0.025621295},"labels":[],"label_agreement":null},{"id":"W1592629156","doi":"10.1007/978-3-540-77120-3_29","title":"Succinct Representation of Labeled Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University; University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Planar graph; Adjacency list; Representation (politics); Computer science; Graph; Mathematics; Discrete mathematics","score_opus":0.026763144151920562,"score_gpt":0.28531081786383844,"score_spread":0.2585476737119179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592629156","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.010987321,0.00037727307,0.96735716,0.0005815262,0.0001632123,0.00014883513,0.004377609,0.00269493,0.013312118],"genre_scores_gemma":[0.18826135,0.0012522092,0.76873434,0.00043907782,0.00017293567,0.0005737905,0.018580213,0.0013318667,0.020654123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991726,0.00023229329,0.00007109248,0.00015353295,0.00029563732,0.000074825984],"domain_scores_gemma":[0.9975178,0.00095540984,0.00015813313,0.00083553634,0.00045404755,0.00007911577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056534196,0.00086070347,0.0006950801,0.0014865239,0.0005443855,0.0025501044,0.0019502317,0.0010485008,0.012646342],"category_scores_gemma":[0.004115884,0.00059346884,0.00070579024,0.002691608,0.0007083599,0.004698343,0.0017442668,0.0020189756,0.0035157187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027351,0.0001438521,0.00031209958,0.0005402246,0.00003344239,0.00028787236,0.00046381346,0.085153274,0.007349837,0.58457834,0.034775782,0.286088],"study_design_scores_gemma":[0.000035090434,0.00003349729,0.00011837195,0.00012696683,0.000025281466,0.00016319666,0.000092377035,0.18727593,0.0053582736,0.7720475,0.034697715,0.000025889836],"about_ca_topic_score_codex":0.0016258701,"about_ca_topic_score_gemma":0.0035875312,"teacher_disagreement_score":0.012646342,"about_ca_system_score_codex":0.00097650615,"about_ca_system_score_gemma":0.0009776535,"threshold_uncertainty_score":0.042306244},"labels":[],"label_agreement":null},{"id":"W1592672079","doi":"10.1007/978-3-540-39966-7_43","title":"A Representation for Abstract Simplicial Complexes: An Analysis and a Comparison","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Simplicial manifold; Simplicial approximation theorem; Abstract simplicial complex; Simplicial complex; Representation (politics); Simplicial homology; Decomposition; Manifold (fluid mechanics); Mathematics; Computer science; Theoretical computer science; Pure mathematics; Simplicial set; Engineering; Chemistry","score_opus":0.04157078764983528,"score_gpt":0.3388258945761861,"score_spread":0.2972551069263508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592672079","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.08505416,0.010425464,0.8015031,0.003384761,0.0014430501,0.00012737101,0.0005351913,0.00034560778,0.097181275],"genre_scores_gemma":[0.71683276,0.009143649,0.22482884,0.0009847255,0.0016125283,0.00025496414,0.0010861246,0.0005695547,0.044686925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989649,0.00027333433,0.000095619056,0.00020116022,0.00036505394,0.000099917714],"domain_scores_gemma":[0.99837637,0.00056443526,0.00018980067,0.00029862425,0.0003543543,0.00021639564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015634246,0.0010799159,0.0010485222,0.0035174717,0.0016560678,0.0062120333,0.0019041989,0.0020955617,0.010461299],"category_scores_gemma":[0.004137507,0.00046529176,0.0013182542,0.0049083326,0.0029940559,0.009605069,0.0031969731,0.0027863453,0.0014257216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011938332,0.000011284977,0.00005109644,0.000037984762,0.0000041995427,0.00001895251,0.00011725039,0.0006702529,0.0002877223,0.98827165,0.0012055985,0.009312105],"study_design_scores_gemma":[0.0000076538945,0.00003459816,0.00011772146,0.00003216659,0.0000116438705,0.0001609221,0.00014904751,0.010735382,0.00020811884,0.97910005,0.009425678,0.000017032842],"about_ca_topic_score_codex":0.0006410653,"about_ca_topic_score_gemma":0.0004509421,"teacher_disagreement_score":0.010461299,"about_ca_system_score_codex":0.0013725922,"about_ca_system_score_gemma":0.00051852904,"threshold_uncertainty_score":0.03499651},"labels":[],"label_agreement":null},{"id":"W1592675203","doi":"10.1007/978-3-540-85988-8_10","title":"Prostate Cancer Probability Maps Based on Ultrasound RF Time Series and SVM Classifiers","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Spectroscopy Techniques in Biomedical and Chemical Research","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Computer science; Support vector machine; Ultrasound; Artificial intelligence; Series (stratigraphy); Prostate cancer; Pattern recognition (psychology); Probabilistic logic; Radio frequency; Tissue typing; Cancer; Medicine; Radiology; Internal medicine; Telecommunications","score_opus":0.010354437451267549,"score_gpt":0.28002076747450266,"score_spread":0.2696663300232351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592675203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18184641,0.0011247306,0.812344,0.00038167185,0.0001148312,0.0000434585,0.00036299252,0.0010314033,0.0027505294],"genre_scores_gemma":[0.92279816,0.0006557583,0.07364014,0.00006270219,0.0001431888,0.00003359908,0.00030366392,0.000085723674,0.0022769854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998362,0.00003699238,0.0000088048555,0.00003611268,0.000059132097,0.000022748412],"domain_scores_gemma":[0.9991322,0.0005258635,0.000079218655,0.000043446344,0.0001895985,0.00002964055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773012,0.00038667742,0.0004168901,0.0013815351,0.00015775289,0.00067352195,0.00034615377,0.00061522407,0.0013911228],"category_scores_gemma":[0.0031556874,0.00021477754,0.0005335067,0.0007970846,0.00017992812,0.0008177801,0.00023784698,0.00039028694,0.0005596157],"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.0010801015,0.00014151858,0.014525791,0.00023168212,0.00012958133,0.00042160854,0.0001474408,0.18928674,0.04606708,0.004899561,0.0036479977,0.739421],"study_design_scores_gemma":[0.000007654042,0.00004497981,0.00808292,0.000011919689,0.00004177289,0.00028010394,0.000018729766,0.98261917,0.0066986494,0.0016634264,0.00051353837,0.000017088161],"about_ca_topic_score_codex":0.0014847252,"about_ca_topic_score_gemma":0.0012508985,"teacher_disagreement_score":0.0014847252,"about_ca_system_score_codex":0.00027174002,"about_ca_system_score_gemma":0.00024155846,"threshold_uncertainty_score":0.004653752},"labels":[],"label_agreement":null},{"id":"W1592716016","doi":"10.1007/bfb0027525","title":"Database management systems for statistical and scientific applications: Are commercially available DBMS good enough?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Statistics Canada","funders":"","keywords":"Computer science; Database; Relation (database); Relational database; Data science; Set (abstract data type); Information system; Relational database management system; Engineering","score_opus":0.023796753880219425,"score_gpt":0.2627817110291686,"score_spread":0.23898495714894916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592716016","genre_codex":"commentary","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.011741832,0.35429484,0.08716561,0.38693437,0.016538462,0.0001748537,0.0011618629,0.005051086,0.13693707],"genre_scores_gemma":[0.17327839,0.3770371,0.2138473,0.070889816,0.024928091,0.00033203317,0.0023783841,0.003292434,0.13401647],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949765,0.001203805,0.00035343633,0.00037844686,0.0027017335,0.00038608277],"domain_scores_gemma":[0.9784555,0.011738777,0.0011533238,0.0022342568,0.0049587497,0.0014594153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015378787,0.0007251536,0.0012326027,0.001611896,0.0008190856,0.010062581,0.0025220672,0.0039301324,0.017016955],"category_scores_gemma":[0.02498741,0.0006991013,0.0007490983,0.0029225894,0.0027267248,0.02662312,0.0019150586,0.004071814,0.011554837],"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.00011124635,0.00014642843,0.0011906285,0.0015764228,0.0000802416,0.00012908407,0.0004537632,0.00043110317,0.0017947386,0.10504876,0.33551276,0.55352485],"study_design_scores_gemma":[0.00005270842,0.00014905572,0.0014665795,0.001338662,0.00008102466,0.00046634965,0.0005266531,0.001421278,0.0018117586,0.10406494,0.8885684,0.000052653806],"about_ca_topic_score_codex":0.0009073128,"about_ca_topic_score_gemma":0.001186223,"teacher_disagreement_score":0.017016955,"about_ca_system_score_codex":0.0013307692,"about_ca_system_score_gemma":0.002384329,"threshold_uncertainty_score":0.08133179},"labels":[],"label_agreement":null},{"id":"W1592740260","doi":"10.1007/3-540-44651-6_20","title":"The Spider Model of Agents","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Spider; Locality; Java; Distributed computing; Programming language; Theoretical computer science; Ecology","score_opus":0.028246311021758175,"score_gpt":0.24686059510431857,"score_spread":0.2186142840825604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592740260","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.034566965,0.004452623,0.66980714,0.0040701665,0.0005287633,0.00013978161,0.00026148933,0.0005473047,0.2856257],"genre_scores_gemma":[0.72614175,0.0043893484,0.1456239,0.0007681577,0.0006097649,0.00047128642,0.00045811266,0.00022341216,0.12131432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946016,0.0002085403,0.00002908073,0.00009139541,0.00014402314,0.00006677296],"domain_scores_gemma":[0.99942136,0.00018260839,0.000050651583,0.00013729336,0.00010005445,0.000108064014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060951145,0.00074943714,0.000716487,0.00089298736,0.0013721603,0.004110714,0.0012426198,0.0019491202,0.0075365403],"category_scores_gemma":[0.0024651869,0.0005409028,0.0007949288,0.0012921761,0.0031960085,0.005642947,0.0021176946,0.0022482825,0.00166556],"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.000004301995,0.0000042744805,0.000029567364,0.000009571045,0.000002896951,0.000019876104,0.00007066496,0.0024705685,0.000088941684,0.9941221,0.00074848963,0.0024287193],"study_design_scores_gemma":[0.000005816761,0.0000047659646,0.000014914201,0.0000059859253,0.0000025645386,0.000025326204,0.000022848526,0.013023077,0.000047879388,0.97776026,0.009083335,0.000003320371],"about_ca_topic_score_codex":0.002180662,"about_ca_topic_score_gemma":0.001284551,"teacher_disagreement_score":0.0075365403,"about_ca_system_score_codex":0.0011582373,"about_ca_system_score_gemma":0.0010257507,"threshold_uncertainty_score":0.025212228},"labels":[],"label_agreement":null},{"id":"W1592748842","doi":"10.1007/11605805_6","title":"Another Look at Small RSA Exponents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Computer science; Public-key cryptography; Key (lock); Critical exponent; Discrete mathematics; Theoretical computer science; Mathematics; Computer security; Encryption; Scaling; Geometry","score_opus":0.019956215077243548,"score_gpt":0.22758990769814297,"score_spread":0.20763369262089942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592748842","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.019129245,0.041221656,0.11831702,0.036888003,0.0102678025,0.00007887581,0.00027549197,0.0013545345,0.7724674],"genre_scores_gemma":[0.22204179,0.029053295,0.07439112,0.012504309,0.008018885,0.000112078385,0.00024401434,0.0022760532,0.6513585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999597,0.000085166794,0.000017509998,0.000064092295,0.00019051504,0.000045653673],"domain_scores_gemma":[0.99886596,0.0006160234,0.000049057722,0.00024195974,0.00016068376,0.000066437155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046637192,0.001227781,0.00094562443,0.0016817541,0.0014886977,0.0023951328,0.0008010414,0.0010863929,0.040017236],"category_scores_gemma":[0.0031759571,0.0005184433,0.00059248914,0.0012056746,0.002521019,0.012617111,0.0015550569,0.005255009,0.011929812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010439034,0.000040536273,0.0001027004,0.00020749336,0.0000101943315,0.00014492888,0.0002844861,0.00035856865,0.004367342,0.89538294,0.039617937,0.059378523],"study_design_scores_gemma":[0.000033801192,0.0000853056,0.00013236655,0.00014425108,0.000017910841,0.0006125128,0.0001313153,0.00090362615,0.0030095691,0.6753876,0.31951475,0.000026921995],"about_ca_topic_score_codex":0.00021519302,"about_ca_topic_score_gemma":0.00043914327,"teacher_disagreement_score":0.040017236,"about_ca_system_score_codex":0.0009001871,"about_ca_system_score_gemma":0.00031116803,"threshold_uncertainty_score":0.13387102},"labels":[],"label_agreement":null},{"id":"W1592823304","doi":"10.1007/978-3-642-04766-4_20","title":"Generating In-Line Monitors for Rabin Automata","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Automaton; Line (geometry); Theoretical computer science; Mathematics","score_opus":0.036755691033083425,"score_gpt":0.30750734246625006,"score_spread":0.27075165143316665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592823304","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03626476,0.000054763343,0.94635767,0.00013542119,0.000045688896,0.00014649045,0.00014624157,0.012161761,0.004687263],"genre_scores_gemma":[0.58328027,0.000078630525,0.40632084,0.00013915326,0.000039145387,0.00035280138,0.0004906459,0.0026527392,0.0066457354],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984561,0.00053873734,0.0000787036,0.0002854505,0.0004562767,0.00018477709],"domain_scores_gemma":[0.9941697,0.0033995844,0.00043056573,0.0013585181,0.00051964633,0.00012192278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011689266,0.0009432188,0.0007684189,0.00062692154,0.0005531911,0.0016147001,0.0017277532,0.0013220041,0.008566957],"category_scores_gemma":[0.006380571,0.0008218529,0.00090740353,0.00040410357,0.00095933594,0.0021581736,0.0023853693,0.0013611899,0.0024651086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001968305,0.00072112604,0.0048188493,0.00093853293,0.0001939273,0.0012017329,0.0018784214,0.13482091,0.19726844,0.26147583,0.018071728,0.3766422],"study_design_scores_gemma":[0.00021613674,0.00022378998,0.00041373915,0.000047496058,0.00011479768,0.0002796352,0.00011701386,0.6840869,0.18384953,0.120530166,0.010079413,0.000041413132],"about_ca_topic_score_codex":0.00029125868,"about_ca_topic_score_gemma":0.000648767,"teacher_disagreement_score":0.008566957,"about_ca_system_score_codex":0.0006322291,"about_ca_system_score_gemma":0.00043963984,"threshold_uncertainty_score":0.028659284},"labels":[],"label_agreement":null},{"id":"W1592853329","doi":"10.1007/978-3-540-69057-3_18","title":"Extending the Z-Width of a Haptic Device Using Acceleration Feedback","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","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 Victoria","funders":"","keywords":"Haptic technology; Passivity; Acceleration; Computer science; Controller (irrigation); Control theory (sociology); Domain (mathematical analysis); Simulation; Control (management); Artificial intelligence; Physics; Mathematics; Engineering","score_opus":0.0381700115295248,"score_gpt":0.2483211462758163,"score_spread":0.2101511347462915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592853329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08221987,0.0023475348,0.8959165,0.0002375039,0.00039858188,0.00007422118,0.00014260643,0.002678232,0.015984893],"genre_scores_gemma":[0.72361785,0.0016871623,0.26007912,0.00026676865,0.00024203266,0.00010271792,0.00019359012,0.00042146526,0.013389236],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966836,0.000030713007,0.000033538287,0.000088752546,0.00013339406,0.000045312125],"domain_scores_gemma":[0.9990694,0.00035868166,0.00010014951,0.00021658777,0.00017492472,0.00008019673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599456,0.0010921968,0.0005397605,0.000677294,0.00030732935,0.0010656305,0.0012624959,0.0010599858,0.0063724318],"category_scores_gemma":[0.0017352897,0.0004602425,0.0005789257,0.0004358509,0.000536133,0.0029098613,0.0018115211,0.0011867869,0.0017125027],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008823064,0.00012459702,0.00040566805,0.0005537041,0.000027844448,0.00023544746,0.00026090458,0.005251635,0.7007054,0.011951286,0.0012457,0.27835548],"study_design_scores_gemma":[0.0004961375,0.0038620993,0.0050255004,0.00047321996,0.00029392174,0.004747714,0.0004055888,0.18427432,0.64907676,0.036264755,0.11470577,0.00037425838],"about_ca_topic_score_codex":0.00018105486,"about_ca_topic_score_gemma":0.00013571256,"teacher_disagreement_score":0.0063724318,"about_ca_system_score_codex":0.00013081706,"about_ca_system_score_gemma":0.00020204714,"threshold_uncertainty_score":0.0213179},"labels":[],"label_agreement":null},{"id":"W1592876209","doi":"10.1007/11602613_86","title":"On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Colored; Domino; Rectangle; Combinatorics; Polygon (computer graphics); Simple (philosophy); Mathematics; Set (abstract data type); Orthogonal basis; Computer science; Frame (networking); Geometry","score_opus":0.014355166049815501,"score_gpt":0.2509207220027706,"score_spread":0.2365655559529551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592876209","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.49758345,0.00032812028,0.45862427,0.00017591109,0.00015831333,0.000109924615,0.00061569223,0.0019226772,0.04048162],"genre_scores_gemma":[0.76708996,0.00015645467,0.22245355,0.0000772728,0.0000269069,0.00008925816,0.0010156186,0.00053206284,0.008559036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982774,0.000023821114,0.000009382909,0.000032558917,0.00005777691,0.00004862585],"domain_scores_gemma":[0.9993519,0.00039439654,0.00003560642,0.00008377669,0.00007786092,0.00005631602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027869898,0.0004859468,0.0008748774,0.000735351,0.0006615943,0.0013730256,0.0010586153,0.00057098496,0.010361657],"category_scores_gemma":[0.002029875,0.00042635578,0.00065058924,0.0009770422,0.0008110467,0.0016269998,0.0016008065,0.0005928679,0.0006834271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078671303,0.000117744006,0.0051776352,0.00045640508,0.00008478268,0.00036846873,0.000719092,0.44120088,0.016287368,0.291282,0.0099445,0.23357442],"study_design_scores_gemma":[0.000076511,0.000050585248,0.0005301094,0.000031755128,0.000016405595,0.00006383266,0.00018491321,0.84121037,0.004461218,0.1491908,0.0041635362,0.000019951818],"about_ca_topic_score_codex":0.0031859751,"about_ca_topic_score_gemma":0.009127367,"teacher_disagreement_score":0.010361657,"about_ca_system_score_codex":0.000652126,"about_ca_system_score_gemma":0.00045697734,"threshold_uncertainty_score":0.03466314},"labels":[],"label_agreement":null},{"id":"W1592959639","doi":"10.1007/978-3-540-77096-1_24","title":"Secretive Birds: Privacy in Population Protocols","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"York University","funders":"","keywords":"Computer science; Obfuscation; Population; Adversary; Theoretical computer science; Exploit; Protocol (science); Computation; Secure multi-party computation; Computer security; Algorithm","score_opus":0.023627836335923417,"score_gpt":0.27587543418574706,"score_spread":0.25224759784982365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592959639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008261818,0.003082812,0.9466918,0.0039502066,0.00034254295,0.00007542006,0.0001119917,0.00037300406,0.037110403],"genre_scores_gemma":[0.6029965,0.008025027,0.30313596,0.0021279966,0.0015223275,0.00056606875,0.00032598953,0.00043377915,0.08086625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981875,0.0007565873,0.000086570646,0.00020570698,0.0006403663,0.00012313103],"domain_scores_gemma":[0.99596715,0.002569897,0.00014800868,0.0010510779,0.00017476914,0.00008901927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023378113,0.00045445774,0.0007801574,0.00056553923,0.0010840223,0.003417612,0.0016848304,0.0020925824,0.0043260003],"category_scores_gemma":[0.0071043354,0.0006291593,0.0006525774,0.0010935492,0.004633602,0.008267316,0.0024109157,0.0046186084,0.0010750925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027409606,0.00001525295,0.00011178773,0.00006395025,0.000010194841,0.000045052886,0.00026182047,0.0051469826,0.00063021446,0.9573722,0.0044976794,0.03181743],"study_design_scores_gemma":[0.00001362873,0.000017719261,0.00006393542,0.000030868858,0.000010248208,0.000148373,0.00005011877,0.029761713,0.0014661266,0.94639695,0.022029024,0.000011330445],"about_ca_topic_score_codex":0.00037969448,"about_ca_topic_score_gemma":0.00034615194,"teacher_disagreement_score":0.0043260003,"about_ca_system_score_codex":0.001059899,"about_ca_system_score_gemma":0.00072802574,"threshold_uncertainty_score":0.014471889},"labels":[],"label_agreement":null},{"id":"W1593046698","doi":"10.1007/978-3-642-18098-9_11","title":"State Complexity of Catenation Combined with Union and Intersection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Computer science; Combined operations; Composition (language); Algorithm; Engineering; Law; Political science","score_opus":0.021888749043671447,"score_gpt":0.2190697652432465,"score_spread":0.19718101619957507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593046698","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.47656566,0.0018244016,0.42317387,0.0037909718,0.00034404648,0.00019279962,0.0016076795,0.0012355978,0.09126496],"genre_scores_gemma":[0.9626786,0.00041231004,0.026274787,0.0001437358,0.00025084472,0.00012090017,0.00070167676,0.00026279705,0.009154267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958425,0.00083098887,0.00029585263,0.0007310324,0.0015958919,0.00070370483],"domain_scores_gemma":[0.97389674,0.019914534,0.0009050696,0.003271855,0.0013564462,0.00065526867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023099005,0.0007079115,0.0022310577,0.0020793334,0.002169662,0.0077054887,0.00298428,0.0023956173,0.015946897],"category_scores_gemma":[0.017053803,0.0012192305,0.0032610544,0.0031150708,0.003673842,0.02045587,0.0047097625,0.005493949,0.0009991442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030212657,0.00008007512,0.0010098093,0.00020937817,0.0000441826,0.00010709085,0.0004058979,0.025730869,0.002044622,0.9484161,0.0027851644,0.01886466],"study_design_scores_gemma":[0.00002402141,0.00002995929,0.00035266587,0.000018901756,0.00004010216,0.00006970748,0.00006708058,0.09386206,0.0018880931,0.902489,0.0011270577,0.000031473814],"about_ca_topic_score_codex":0.0026808965,"about_ca_topic_score_gemma":0.002525571,"teacher_disagreement_score":0.015946897,"about_ca_system_score_codex":0.0031389168,"about_ca_system_score_gemma":0.002251632,"threshold_uncertainty_score":0.053347707},"labels":[],"label_agreement":null},{"id":"W1593056590","doi":"10.1007/978-3-540-72530-5_54","title":"Task-Based Image Annotation and Retrieval","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Image retrieval; Task (project management); Automatic image annotation; Context (archaeology); Domain (mathematical analysis); Information retrieval; Annotation; Reuse; Human–computer interaction; Image (mathematics); Artificial intelligence","score_opus":0.02052649889575118,"score_gpt":0.2712624571485665,"score_spread":0.2507359582528153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593056590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01631151,0.0024216983,0.9537924,0.00037634707,0.00045571235,0.00046844478,0.0015823247,0.0107851885,0.013806285],"genre_scores_gemma":[0.21008956,0.0032503128,0.7255024,0.00046715006,0.0004187294,0.00066292903,0.010308202,0.0017987521,0.047502074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990019,0.00016049609,0.00006824754,0.00026040408,0.00036137563,0.0001476878],"domain_scores_gemma":[0.9985744,0.00034517454,0.000065679356,0.00041919595,0.00051246176,0.00008308034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013050764,0.0013737732,0.0014714643,0.0019536112,0.00075006165,0.0017747934,0.0025373069,0.0014735674,0.010537425],"category_scores_gemma":[0.0031457476,0.00041581492,0.0012074957,0.0025558078,0.00052463514,0.0021161395,0.0014946801,0.0009559569,0.010433721],"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.0004067154,0.0002566169,0.0006053861,0.0004553967,0.0000588737,0.000113732836,0.000104441504,0.005265513,0.08832312,0.0034034513,0.031371634,0.869635],"study_design_scores_gemma":[0.000072108356,0.00061780895,0.007239656,0.00016851327,0.0003045686,0.0015577814,0.00040069813,0.5942514,0.2527347,0.036081932,0.10637851,0.00019231903],"about_ca_topic_score_codex":0.004953842,"about_ca_topic_score_gemma":0.0067702006,"teacher_disagreement_score":0.010537425,"about_ca_system_score_codex":0.000574197,"about_ca_system_score_gemma":0.0011165858,"threshold_uncertainty_score":0.03525114},"labels":[],"label_agreement":null},{"id":"W159307972","doi":"10.1007/11847083_23","title":"Gate-Level Dual-Threshold Static Power Optimization Methodology (GDSPOM) Using Path-Based Static Timing Analysis (STA) Technique","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Low-power high-performance VLSI design","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":"","keywords":"Computer science; Leakage power; Threshold voltage; Static timing analysis; Power consumption; Power (physics); Power optimization; Multiplier (economics); Path (computing); Standby power; Electronic engineering; Low-power electronics; Dual (grammatical number); Dynamic demand; Critical path method; Voltage; Embedded system; Electrical engineering; Transistor; Engineering; Physics","score_opus":0.05226681441261249,"score_gpt":0.27237742729897463,"score_spread":0.22011061288636213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159307972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020268042,0.0003672124,0.96892154,0.00010971865,0.00007570301,0.00007810817,0.000114186434,0.0016922116,0.008373189],"genre_scores_gemma":[0.4157984,0.00047302223,0.5722776,0.0002919805,0.000048371687,0.00013475283,0.0003327524,0.00048378308,0.010159249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980956,0.000027155342,0.00000927178,0.000036919537,0.00009045964,0.000026672657],"domain_scores_gemma":[0.9998673,0.000030382525,0.000022627995,0.00003095102,0.000042587217,0.0000061862443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001892051,0.0006002383,0.00040244588,0.0005387386,0.00027757857,0.00043058337,0.001204506,0.0003108626,0.004071479],"category_scores_gemma":[0.00033383525,0.00027915876,0.00068105845,0.00059800385,0.00020563259,0.0004749903,0.0004372996,0.0005365318,0.00063166773],"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.00014592026,0.00018089228,0.0011849061,0.000507862,0.00018881775,0.0002274398,0.0001045139,0.26584372,0.21704869,0.04916766,0.0076819896,0.45771757],"study_design_scores_gemma":[0.000039680148,0.00034234868,0.0005633384,0.000034306035,0.0001318899,0.00040633747,0.000025938734,0.90000844,0.07168121,0.013082517,0.013662524,0.000021463356],"about_ca_topic_score_codex":0.0009070319,"about_ca_topic_score_gemma":0.0031934923,"teacher_disagreement_score":0.004071479,"about_ca_system_score_codex":0.00041457548,"about_ca_system_score_gemma":0.0011260804,"threshold_uncertainty_score":0.013620436},"labels":[],"label_agreement":null},{"id":"W1593132192","doi":"10.1007/11779568_91","title":"Elaborating the Context of Interactions in a Tutorial Dialog","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université du Québec à Montréal","funders":"","keywords":"Dialog box; TUTOR; Computer science; Socratic method; Context (archaeology); Artificial intelligence; Action (physics); Dialog system; Human–computer interaction; Programming language; Epistemology; World Wide Web","score_opus":0.021275427884117213,"score_gpt":0.2615785664477439,"score_spread":0.2403031385636267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593132192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12106583,0.0032182378,0.565021,0.006431604,0.00094056793,0.0005037004,0.0003619813,0.0034487196,0.29900843],"genre_scores_gemma":[0.82021976,0.0009394967,0.13794774,0.00048850453,0.00024268974,0.00025715955,0.0004471809,0.0007558743,0.03870163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970487,0.0019749922,0.00009421446,0.00035875794,0.00027463702,0.00024863664],"domain_scores_gemma":[0.99662256,0.0021986899,0.00019366237,0.0002558436,0.00039182112,0.0003373648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024280376,0.0010003782,0.0005284514,0.0009569323,0.0043342686,0.009349616,0.0014607705,0.0031010734,0.018237045],"category_scores_gemma":[0.012808715,0.000824457,0.0005841745,0.000687361,0.0023033612,0.013891004,0.004801686,0.0032647187,0.0035324036],"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.00065936084,0.00015983338,0.0025314768,0.0005948404,0.00003740656,0.0029757353,0.16107264,0.0031231574,0.019490413,0.69878536,0.01693097,0.093638785],"study_design_scores_gemma":[0.00011788165,0.00040255993,0.0035640337,0.0013524089,0.00019676315,0.0024171663,0.06544327,0.045568638,0.018376924,0.35003388,0.5123006,0.00022589364],"about_ca_topic_score_codex":0.0026029227,"about_ca_topic_score_gemma":0.0033508535,"teacher_disagreement_score":0.018237045,"about_ca_system_score_codex":0.0016891798,"about_ca_system_score_gemma":0.0013609217,"threshold_uncertainty_score":0.06100905},"labels":[],"label_agreement":null},{"id":"W1593161808","doi":"10.1007/978-3-540-69554-7_20","title":"Toward Quality-Driven Development of 3D Computer Games","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Queen's University","funders":"","keywords":"Quality (philosophy); Computer science; Video game development; Perspective (graphical); Implementation; Game Developer; Video game; Multimedia; Multidisciplinary approach; Development (topology); Game design; Human–computer interaction; Software engineering; Artificial intelligence","score_opus":0.0699017961035294,"score_gpt":0.33359984271226234,"score_spread":0.26369804660873297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593161808","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.013996637,0.00025360443,0.97329766,0.00022198936,0.000033145014,0.0001566555,0.00008708505,0.0013589571,0.010594218],"genre_scores_gemma":[0.18355983,0.0005333164,0.80728585,0.000095714255,0.000012180242,0.00022481303,0.00038108445,0.00080696814,0.0071002473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980369,0.0003455215,0.0000806387,0.00015781441,0.0012374899,0.00014164009],"domain_scores_gemma":[0.997877,0.0005940016,0.0001655721,0.0003174284,0.00095574383,0.00009029693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001962881,0.00086416805,0.00042143563,0.0009708974,0.0003680191,0.002334945,0.002208578,0.0009144817,0.005247808],"category_scores_gemma":[0.005903262,0.00083524507,0.0007519216,0.0005630823,0.00072666095,0.001536269,0.0022579655,0.0012865412,0.0012797852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013966108,0.0003124597,0.0034940992,0.0005371554,0.000091931695,0.00026546197,0.0012684595,0.3229792,0.050340235,0.16844311,0.009760307,0.44236794],"study_design_scores_gemma":[0.00003268054,0.00011038753,0.0006120228,0.000083557,0.000034517398,0.00012799757,0.00020998498,0.8926295,0.032054663,0.042721894,0.031359218,0.000023641498],"about_ca_topic_score_codex":0.0032102875,"about_ca_topic_score_gemma":0.005341305,"teacher_disagreement_score":0.005247808,"about_ca_system_score_codex":0.0009934811,"about_ca_system_score_gemma":0.0014258518,"threshold_uncertainty_score":0.017555654},"labels":[],"label_agreement":null},{"id":"W1593181307","doi":"10.1007/3-540-45581-7_27","title":"Towards Ontologically Based Semantics for UML Constructs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Unified Modeling Language; Applications of UML; Ontology; Class diagram; UML tool; Programming language; Semantics (computer science); Software engineering; Software","score_opus":0.01838859176251966,"score_gpt":0.24897524511124614,"score_spread":0.23058665334872647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593181307","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.0017896821,0.00019274578,0.9938438,0.00039631303,0.000088092755,0.00009942058,0.0001781786,0.0012868396,0.0021249747],"genre_scores_gemma":[0.04821861,0.00051103445,0.9457517,0.00039532525,0.00013348738,0.0003408204,0.0013199305,0.0011669794,0.002162144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99059707,0.003420042,0.0016300539,0.0008447762,0.0029318077,0.00057623157],"domain_scores_gemma":[0.9874078,0.004894857,0.0009713269,0.0026246393,0.0036319364,0.0004694491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010600514,0.0017465492,0.0016035753,0.0047791237,0.002324697,0.010556569,0.005563408,0.003525127,0.0038637272],"category_scores_gemma":[0.019531704,0.0035571218,0.0033616405,0.0036590067,0.004653513,0.015180635,0.007112621,0.009607919,0.0028064556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051507643,0.0000750511,0.00021305674,0.00022425232,0.000040948187,0.0001526166,0.0019079996,0.004873805,0.0038019998,0.93404764,0.0033935963,0.051217567],"study_design_scores_gemma":[0.0000459956,0.0000288969,0.00013928705,0.00030238167,0.00008379045,0.00014061692,0.000533251,0.05236925,0.006015703,0.86867124,0.07160293,0.000066601795],"about_ca_topic_score_codex":0.0063233585,"about_ca_topic_score_gemma":0.008001669,"teacher_disagreement_score":0.010600514,"about_ca_system_score_codex":0.003543837,"about_ca_system_score_gemma":0.0041455682,"threshold_uncertainty_score":0.056061506},"labels":[],"label_agreement":null},{"id":"W1593242347","doi":"10.1007/978-3-540-68825-9_5","title":"A Belief-Theoretic Reputation Estimation Model for Multi-context Communities","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Reputation; Computer science; Context (archaeology); Face (sociological concept); Artificial intelligence; Perspective (graphical); Identity (music); Process (computing); Sociology; Geography","score_opus":0.05534543783450741,"score_gpt":0.3154394081747574,"score_spread":0.26009397034025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593242347","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.01373576,0.00040502858,0.9826796,0.0006522401,0.00005785536,0.000057985442,0.00019047939,0.00023547997,0.0019856766],"genre_scores_gemma":[0.7586876,0.00086202036,0.2267441,0.00024892564,0.00033492263,0.00035331995,0.00061032904,0.00017665431,0.011982078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712,0.0012081749,0.00013459788,0.0007641017,0.000492287,0.0002808208],"domain_scores_gemma":[0.9886994,0.008036815,0.0007197719,0.0008821269,0.00128181,0.00037999317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005553068,0.00097435294,0.0027431117,0.0016523516,0.001365576,0.00364559,0.0062808185,0.0038471369,0.004410065],"category_scores_gemma":[0.024254061,0.001384984,0.0016780787,0.0027810584,0.0021320414,0.00810877,0.0029573783,0.0036590153,0.001324825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000246759,0.00014628998,0.0015522897,0.0001905141,0.00019064423,0.00018872671,0.00047241748,0.7037343,0.0013101668,0.23293865,0.0050856867,0.053943694],"study_design_scores_gemma":[0.0000096043905,0.000014610714,0.00011603202,0.000009215891,0.000018359684,0.00002512086,0.000014706235,0.9617422,0.00007652394,0.037651535,0.00030741247,0.000014609613],"about_ca_topic_score_codex":0.011224423,"about_ca_topic_score_gemma":0.011230696,"teacher_disagreement_score":0.011224423,"about_ca_system_score_codex":0.0023771194,"about_ca_system_score_gemma":0.0014427108,"threshold_uncertainty_score":0.029367805},"labels":[],"label_agreement":null},{"id":"W1593244833","doi":"10.1007/11603771_22","title":"Distributed Dynamic Lightpath Allocation in Survivable WDM Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Windsor","funders":"","keywords":"Computer science; Scalability; Wavelength-division multiplexing; Path protection; Path (computing); Distributed computing; Resource allocation; Computer network; Wavelength","score_opus":0.006462171370454955,"score_gpt":0.21000406610133288,"score_spread":0.20354189473087791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593244833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0552869,0.0010015409,0.9352369,0.00017215306,0.00011017175,0.00004296109,0.000046095352,0.0006146481,0.0074886614],"genre_scores_gemma":[0.8146554,0.00075051456,0.1694329,0.000070542286,0.00012304835,0.00009661547,0.00011603911,0.00009499946,0.014659929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979657,0.00005005467,0.0000070451774,0.00004216055,0.00007033238,0.00003390048],"domain_scores_gemma":[0.99979013,0.000099396595,0.0000144176865,0.000049375423,0.000034150835,0.000012493661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034999673,0.0003646966,0.0005102387,0.00028521946,0.00035830526,0.0005440193,0.001117659,0.00034995252,0.0025157006],"category_scores_gemma":[0.0006508143,0.0002622168,0.00014987397,0.0006163759,0.00035194404,0.00085730944,0.000505053,0.00047815935,0.00029711964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027868236,0.000106693944,0.00026486276,0.0000878932,0.000024228211,0.00006973783,0.00007719731,0.5211729,0.02562003,0.041657954,0.0039443723,0.4066954],"study_design_scores_gemma":[0.000020495627,0.000051896906,0.00016815127,0.0000054935595,0.000007913057,0.000058465837,0.000017159395,0.95485723,0.004581937,0.037248943,0.0029751002,0.0000071411864],"about_ca_topic_score_codex":0.0006265434,"about_ca_topic_score_gemma":0.0013891417,"teacher_disagreement_score":0.0025157006,"about_ca_system_score_codex":0.0006436997,"about_ca_system_score_gemma":0.0003391616,"threshold_uncertainty_score":0.008415878},"labels":[],"label_agreement":null},{"id":"W1593294079","doi":"10.1007/11424918_33","title":"A Document Browsing Tool: Using Lexical Classes to Convey Information","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Digital library; Field (mathematics); Information retrieval; World Wide Web; Linguistics","score_opus":0.019211746900202824,"score_gpt":0.29090359449865594,"score_spread":0.2716918475984531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593294079","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.020622317,0.0010621373,0.82814664,0.0006959346,0.00032401792,0.0002812154,0.00755731,0.12230306,0.019007375],"genre_scores_gemma":[0.1211603,0.0014141611,0.8151801,0.0007805964,0.00023927526,0.0005170386,0.011404336,0.018422488,0.030881772],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996835,0.000051011615,0.00004620309,0.000078671415,0.00011337785,0.000027253871],"domain_scores_gemma":[0.9973465,0.0017793556,0.00013342494,0.0002931364,0.00025696878,0.00019058856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820494,0.0012270316,0.0009228003,0.0036742578,0.00084700505,0.0034673973,0.0014038326,0.0013454651,0.02520404],"category_scores_gemma":[0.003928807,0.0006433053,0.0006252388,0.0026539278,0.0005770626,0.005354751,0.0020346872,0.0014447882,0.009345377],"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.00070278003,0.00018203753,0.0014269982,0.0009132239,0.000058033624,0.0005743921,0.0019543632,0.0009507489,0.04599346,0.024965731,0.14565344,0.77662474],"study_design_scores_gemma":[0.00048751774,0.00033000787,0.0039281845,0.0010259935,0.00033372472,0.002697434,0.0013648138,0.093301155,0.10833787,0.063739605,0.72411245,0.00034122652],"about_ca_topic_score_codex":0.0021740848,"about_ca_topic_score_gemma":0.003089229,"teacher_disagreement_score":0.02520404,"about_ca_system_score_codex":0.0004721124,"about_ca_system_score_gemma":0.00057660654,"threshold_uncertainty_score":0.084315896},"labels":[],"label_agreement":null},{"id":"W1593304353","doi":"10.1007/3-540-45104-8_31","title":"An L-System-Based Plant Modeling Language","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Programming language; Natural language processing","score_opus":0.013738716962651854,"score_gpt":0.20812284463365455,"score_spread":0.1943841276710027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593304353","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.00045147966,0.000040299085,0.98803574,0.000078021076,0.000033762335,0.000034813245,0.0005957753,0.008106006,0.0026241527],"genre_scores_gemma":[0.07528453,0.0003149779,0.90483564,0.00055429526,0.00010349463,0.0005038308,0.003282347,0.004375411,0.010745433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995384,0.00013921566,0.00007138521,0.00009556033,0.00012083702,0.000034664095],"domain_scores_gemma":[0.99925274,0.00035912095,0.00006558334,0.00014276605,0.00014967832,0.000029984409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934516,0.0009745149,0.00067595753,0.00045199192,0.00046572107,0.0018926394,0.0020455585,0.001126525,0.015529777],"category_scores_gemma":[0.0017519337,0.0007059473,0.0014040058,0.00047764916,0.00070341484,0.0019479971,0.0012782131,0.0023922815,0.009380087],"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.0002398939,0.00014708028,0.0008226261,0.0015953198,0.00013802848,0.00061631127,0.0007962504,0.17197475,0.02471677,0.5288971,0.06488317,0.20517272],"study_design_scores_gemma":[0.000075428296,0.000079716185,0.00011451632,0.0001358147,0.00008330167,0.0002456195,0.00004065661,0.68688345,0.012275057,0.10379964,0.19621374,0.00005311529],"about_ca_topic_score_codex":0.002793091,"about_ca_topic_score_gemma":0.0033276062,"teacher_disagreement_score":0.015529777,"about_ca_system_score_codex":0.00056029164,"about_ca_system_score_gemma":0.000893389,"threshold_uncertainty_score":0.051952302},"labels":[],"label_agreement":null},{"id":"W1593308833","doi":"10.1007/978-3-642-13036-6_13","title":"Secretary Problems via Linear Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"McGill University","funders":"","keywords":"Computer science; Secretary problem; Linear programming; Context (archaeology); Set (abstract data type); Polytope; Order (exchange); Mathematical optimization; Common value auction; Operations research; Algorithm; Programming language; Mathematics; Optimal stopping","score_opus":0.018958559996648274,"score_gpt":0.25072657685951816,"score_spread":0.23176801686286988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593308833","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.018180193,0.0043216436,0.41391745,0.006916281,0.0009828805,0.00012689587,0.00063098496,0.00062951085,0.55429417],"genre_scores_gemma":[0.4425639,0.008862992,0.14159323,0.0017379171,0.0024823532,0.00087628677,0.0019282863,0.00095845404,0.39899665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993262,0.0002765049,0.000027272155,0.00011341961,0.00017217327,0.000084497486],"domain_scores_gemma":[0.9994373,0.00034908723,0.00004107122,0.0000712748,0.00004715733,0.00005403944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079978403,0.0009901182,0.0011543939,0.00092108344,0.0010879372,0.0040639997,0.0012137954,0.0013477106,0.027977692],"category_scores_gemma":[0.002803328,0.00059280545,0.0012710036,0.0016279481,0.0019192201,0.004788884,0.0022351034,0.006518743,0.0053845523],"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.000014379131,0.000023438493,0.000028368477,0.00006486695,0.000007051485,0.000010436936,0.000060342605,0.0018293373,0.00017414463,0.96567565,0.0111295525,0.02098238],"study_design_scores_gemma":[0.00001339949,0.000009289578,0.000029759383,0.000020446421,0.0000058266232,0.00002628915,0.000035381854,0.0075474894,0.0002153229,0.9768063,0.015284444,0.0000060700713],"about_ca_topic_score_codex":0.00050314324,"about_ca_topic_score_gemma":0.00050289655,"teacher_disagreement_score":0.027977692,"about_ca_system_score_codex":0.0013401111,"about_ca_system_score_gemma":0.0007585135,"threshold_uncertainty_score":0.09359473},"labels":[],"label_agreement":null},{"id":"W1593374164","doi":"10.1007/11533719_13","title":"Rapid Homology Search with Two-Stage Extension and Daughter Seeds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Glycosylation and Glycoproteins Research","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University; Université de Montréal","funders":"","keywords":"Extension (predicate logic); Daughter; Computer science; Flexibility (engineering); Independence (probability theory); Speedup; Parallel computing; Biology; Mathematics; Programming language; Statistics","score_opus":0.01773601396821899,"score_gpt":0.2753243218730596,"score_spread":0.2575883079048406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593374164","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.08636248,0.00039339656,0.8944841,0.00016236045,0.00008816918,0.0003946475,0.00095495046,0.012686964,0.004472874],"genre_scores_gemma":[0.16300867,0.00015945431,0.8272533,0.00007292578,0.000020663367,0.0002527125,0.003507955,0.0013851775,0.004339121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995714,0.00009744486,0.000037173708,0.00013885403,0.000103317725,0.00005185059],"domain_scores_gemma":[0.9986638,0.00073973776,0.00006665602,0.00030620748,0.00014707542,0.000076565884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424729,0.0010167331,0.0011460825,0.00087700604,0.0006174495,0.0009860172,0.0015575227,0.0008682283,0.011273624],"category_scores_gemma":[0.0024770282,0.00086546346,0.00098409,0.0013281235,0.00044947397,0.0016532865,0.0018813118,0.0009319711,0.005717969],"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.0033963218,0.00041329683,0.0025060002,0.0006191128,0.00012862193,0.0010207269,0.00034125507,0.009646264,0.41769573,0.018823829,0.013907301,0.5315015],"study_design_scores_gemma":[0.0009991386,0.0014266416,0.0033711265,0.000071364804,0.00020656966,0.0026973372,0.00025251796,0.4570006,0.45399588,0.03933145,0.040482465,0.0001649457],"about_ca_topic_score_codex":0.0004433987,"about_ca_topic_score_gemma":0.0009287432,"teacher_disagreement_score":0.011273624,"about_ca_system_score_codex":0.0003799646,"about_ca_system_score_gemma":0.00061253505,"threshold_uncertainty_score":0.037714005},"labels":[],"label_agreement":null},{"id":"W1593374505","doi":"10.1007/978-3-642-04268-3_7","title":"A Computer Model of Soft Tissue Interaction with a Surgical Aspirator","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","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":"National Research Council Canada","funders":"","keywords":"Aspirator; Computer science; Surgical simulation; Haptic technology; Imaging phantom; Soft tissue; Rendering (computer graphics); Surgical procedures; Simulation; Virtual reality; Biomedical engineering; Computer graphics (images); Surgery; Human–computer interaction; Medicine; Radiology","score_opus":0.013009659969664139,"score_gpt":0.25010738793453957,"score_spread":0.23709772796487544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593374505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2691361,0.0013956396,0.6559971,0.002027307,0.00028383793,0.00028414666,0.002060127,0.0015599367,0.06725585],"genre_scores_gemma":[0.93201524,0.00085609057,0.027996708,0.0002215712,0.00004573523,0.00024061925,0.00046537205,0.00016259949,0.037996016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998179,0.00003280232,0.00001099173,0.000042433654,0.00007143126,0.000024506704],"domain_scores_gemma":[0.9997297,0.00014051251,0.000030073828,0.00002393895,0.00004482368,0.00003099798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014727679,0.00058048713,0.00065468036,0.00050076575,0.0005826195,0.0014539827,0.0013761309,0.003205491,0.00855505],"category_scores_gemma":[0.00069999864,0.0006758496,0.00068606745,0.0006737936,0.0009399031,0.0009874438,0.0008385554,0.0005739628,0.0013866937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007419931,0.000043917637,0.0004917039,0.000051278614,0.000016657194,0.0006718014,0.00013360207,0.98032355,0.0069560697,0.0059125996,0.000544755,0.004779843],"study_design_scores_gemma":[0.000038335696,0.000071883274,0.0005841676,0.000007550553,0.000014748554,0.00034116986,0.00005073731,0.9935819,0.0009687524,0.0022417065,0.0020744698,0.000024601854],"about_ca_topic_score_codex":0.012949525,"about_ca_topic_score_gemma":0.0055809836,"teacher_disagreement_score":0.012949525,"about_ca_system_score_codex":0.0006023194,"about_ca_system_score_gemma":0.0012218945,"threshold_uncertainty_score":0.028619528},"labels":[],"label_agreement":null},{"id":"W1593375236","doi":"10.1007/11423461_22","title":"New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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 Waterloo","funders":"","keywords":"Finite field; TRACE (psycholinguistics); Discrete logarithm; Cryptosystem; Computer science; Linear feedback shift register; Cryptography; Algorithm; Tuple; Theoretical computer science; Logarithm; Arithmetic; Mathematics; Discrete mathematics; Public-key cryptography; Shift register; Encryption","score_opus":0.010743690716865094,"score_gpt":0.22239090092781358,"score_spread":0.21164721021094848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593375236","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.030097255,0.0123896655,0.8601089,0.0077123474,0.0015401464,0.00012629054,0.00023482794,0.0011400036,0.08665053],"genre_scores_gemma":[0.5588539,0.0122132385,0.36574966,0.002033573,0.002759181,0.00027190955,0.00047263462,0.00037423402,0.05727167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.0002497198,0.00006983846,0.0001801344,0.0005466886,0.00009275486],"domain_scores_gemma":[0.99842644,0.00083771424,0.00011631935,0.0003831555,0.00017594731,0.0000604594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012958692,0.000607325,0.0006953401,0.0012265508,0.0007969387,0.0029922086,0.0013430013,0.0019511145,0.005773167],"category_scores_gemma":[0.004031367,0.00051747984,0.0005253632,0.0015994947,0.0029351765,0.0090256855,0.0024159108,0.0052584796,0.0013562869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008291579,0.0000730684,0.0000743029,0.00014041291,0.000011361353,0.00007574218,0.00008625669,0.0051084133,0.0029154674,0.87605447,0.005167683,0.11020986],"study_design_scores_gemma":[0.000030098581,0.00004109338,0.000037167003,0.00003555729,0.000006032964,0.00022876373,0.000018147954,0.026555268,0.0030117093,0.95702124,0.012998294,0.00001665882],"about_ca_topic_score_codex":0.0001347208,"about_ca_topic_score_gemma":0.0002387706,"teacher_disagreement_score":0.005773167,"about_ca_system_score_codex":0.0012466315,"about_ca_system_score_gemma":0.0007077246,"threshold_uncertainty_score":0.019313157},"labels":[],"label_agreement":null},{"id":"W1593426800","doi":"10.1007/978-3-642-05148-7_42","title":"A Solution to Resource Underutilization for Web Services Hosted in the Cloud","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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 Saskatchewan","funders":"","keywords":"Computer science; Cloud computing; Web service; Resource (disambiguation); World Wide Web; Database; Operating system; Computer network","score_opus":0.017303640868846656,"score_gpt":0.24494119928320499,"score_spread":0.22763755841435834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593426800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10947469,0.0039155656,0.7731284,0.019354237,0.0023453983,0.0010262044,0.00042549783,0.009738641,0.080591395],"genre_scores_gemma":[0.5852058,0.0019018998,0.35467657,0.0027127424,0.0006440772,0.00031892146,0.00038163533,0.00074313686,0.053415246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.00014998227,0.000034406687,0.00013473973,0.00027637862,0.0002755651],"domain_scores_gemma":[0.99901235,0.00023740399,0.00007915757,0.0001730577,0.00027214194,0.00022581809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011644302,0.0006267757,0.00056753523,0.000840482,0.0020309861,0.002386495,0.0020813379,0.0020304054,0.008680474],"category_scores_gemma":[0.0022784849,0.00028904868,0.00070984056,0.001077499,0.00067790836,0.002779521,0.002681117,0.002109768,0.0015312997],"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.00067998766,0.0009841436,0.002116127,0.00051897427,0.00016653446,0.0014188531,0.0008779396,0.022631869,0.036258977,0.12842354,0.0970693,0.7088538],"study_design_scores_gemma":[0.0005029645,0.0006937204,0.0037002284,0.00029511595,0.00036010443,0.0032743337,0.0022532707,0.56850773,0.0390743,0.1563428,0.22480996,0.00018543305],"about_ca_topic_score_codex":0.0037964368,"about_ca_topic_score_gemma":0.004814137,"teacher_disagreement_score":0.008680474,"about_ca_system_score_codex":0.00087619416,"about_ca_system_score_gemma":0.0023451608,"threshold_uncertainty_score":0.029039025},"labels":[],"label_agreement":null},{"id":"W1593464237","doi":"10.1007/3-540-45311-3_4","title":"A Parallel Algorithm for Extending Cryptographic Hash Functions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Cryptographic hash function; Secure Hash Algorithm; SHA-2; Cryptography; Algorithm; Theoretical computer science; Domain (mathematical analysis); Double hashing; Function (biology); Parallel computing; Mathematics; Programming language","score_opus":0.027292006795435312,"score_gpt":0.2818817744945382,"score_spread":0.2545897676991029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593464237","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.008716553,0.00030954526,0.97470593,0.00017582608,0.0003113017,0.00020862129,0.00016947613,0.0054799183,0.009922638],"genre_scores_gemma":[0.08653068,0.00029013504,0.89341277,0.00021253392,0.00022334197,0.00040626666,0.00069116795,0.00063904666,0.017593944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998654,0.00019264505,0.00011153833,0.00027420648,0.00061047793,0.00015707419],"domain_scores_gemma":[0.99808073,0.00033284677,0.000072868985,0.0010895532,0.00035009254,0.00007402533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011164938,0.0015407644,0.0012462615,0.0012584182,0.0017109099,0.0017145844,0.0023109908,0.001191898,0.013850252],"category_scores_gemma":[0.00270314,0.00091854576,0.0013378699,0.0021727516,0.0011452045,0.004375642,0.0042733746,0.0017514137,0.007196499],"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.0008321923,0.0002158381,0.0005814627,0.00030581903,0.00008348628,0.00023684434,0.00023163644,0.011302747,0.024704047,0.15235509,0.021045705,0.788105],"study_design_scores_gemma":[0.0005104224,0.0005394609,0.0007650385,0.00010563346,0.00025993772,0.0015478805,0.00017330603,0.22140045,0.07613783,0.58518165,0.11322945,0.0001489422],"about_ca_topic_score_codex":0.000882685,"about_ca_topic_score_gemma":0.0013243884,"teacher_disagreement_score":0.013850252,"about_ca_system_score_codex":0.0008833994,"about_ca_system_score_gemma":0.001179206,"threshold_uncertainty_score":0.04633367},"labels":[],"label_agreement":null},{"id":"W1593594285","doi":"10.1007/978-3-642-17458-2_21","title":"PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Polynomial-time approximation scheme; Routing (electronic design automation); Approximation algorithm; Constraint (computer-aided design); Shortest path problem; Mathematical optimization; Set (abstract data type); Connected dominating set; Wireless sensor network; Computer network; Algorithm; Mathematics; Theoretical computer science","score_opus":0.014696845990418905,"score_gpt":0.24213470204740828,"score_spread":0.22743785605698938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593594285","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.0055227596,0.0014602336,0.9841569,0.000702936,0.00060535735,0.00018993614,0.00031975596,0.00036557246,0.00667666],"genre_scores_gemma":[0.2954335,0.004599074,0.6760424,0.00091443,0.0010054194,0.0015549549,0.0008637926,0.0005252748,0.019061293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886477,0.00037347007,0.00006638433,0.0002879734,0.00033193114,0.000075425145],"domain_scores_gemma":[0.99872714,0.0007746085,0.00010878839,0.00014151572,0.00018117424,0.00006673214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012605614,0.0014081434,0.0015850662,0.0007263965,0.00067752186,0.0015550184,0.003132125,0.0012869199,0.005850055],"category_scores_gemma":[0.004324973,0.0005039873,0.0013217882,0.002417289,0.00090486434,0.0026768374,0.001588126,0.0028324465,0.00097079476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023857811,0.00011670767,0.00023057213,0.0012409678,0.00013267813,0.00016904116,0.00018777499,0.517748,0.006067972,0.2691133,0.023203243,0.18155116],"study_design_scores_gemma":[0.000028212413,0.00013808445,0.0001078124,0.000054053715,0.000040910672,0.00019805657,0.00003902011,0.84116197,0.0012577666,0.14734472,0.009610081,0.000019267287],"about_ca_topic_score_codex":0.0011848046,"about_ca_topic_score_gemma":0.0013412399,"teacher_disagreement_score":0.005850055,"about_ca_system_score_codex":0.0014251026,"about_ca_system_score_gemma":0.0014043722,"threshold_uncertainty_score":0.01957035},"labels":[],"label_agreement":null},{"id":"W1593611082","doi":"10.1007/11924661_20","title":"A Localized Tracing Scheme Applied to Garbage Collection","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Western University","funders":"","keywords":"Computer science; Garbage collection; Uniprocessor system; Tracing; Heap (data structure); Garbage; Memory hierarchy; Queue; Virtual memory; Locality of reference; TRACE (psycholinguistics); Parallel computing; Locality; Real-time computing; Multiprocessing; Operating system; Algorithm; Memory management; Computer network; Programming language; Cache; Overlay","score_opus":0.011332127949011558,"score_gpt":0.22935500544950735,"score_spread":0.2180228775004958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593611082","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.01848911,0.00021529997,0.97093123,0.00010969549,0.00011119026,0.00011564472,0.000078922436,0.0071136355,0.002835219],"genre_scores_gemma":[0.39038405,0.0004026253,0.5923187,0.00013486322,0.0000914486,0.00025533242,0.0002605973,0.0012587886,0.014893506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992519,0.00016844814,0.00006494916,0.00013345476,0.00025750932,0.00012376824],"domain_scores_gemma":[0.9975164,0.00044673588,0.00009336811,0.0014902413,0.00034168595,0.00011166549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427269,0.000757799,0.001346279,0.0013854766,0.0018386994,0.0016541468,0.0019605937,0.0010092013,0.0068789776],"category_scores_gemma":[0.0029582318,0.00060842896,0.0006695572,0.0018093024,0.001493293,0.0018457404,0.002950731,0.0012551736,0.001626179],"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.0013523952,0.0002604756,0.001053587,0.00045436108,0.00007679469,0.00031827512,0.0012811756,0.035304435,0.13574593,0.11875794,0.009096126,0.69629854],"study_design_scores_gemma":[0.00034453723,0.00075318146,0.0010259296,0.00016286975,0.00033414672,0.0006965956,0.0002773601,0.64789265,0.20173562,0.10472634,0.04187129,0.0001795421],"about_ca_topic_score_codex":0.0025018428,"about_ca_topic_score_gemma":0.0025308018,"teacher_disagreement_score":0.0068789776,"about_ca_system_score_codex":0.0011843838,"about_ca_system_score_gemma":0.0019284217,"threshold_uncertainty_score":0.02301246},"labels":[],"label_agreement":null},{"id":"W1593612435","doi":"10.1007/978-3-540-45076-4_31","title":"Base Station Joint Scheduling for Downlink Throughput Maximization in CDMA Packet Data Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Telecommunications link; Network packet; Scheduling (production processes); Base station; Computer network; Power control; Cellular network; Optimization problem; Transmitter power output; W-CDMA; Throughput; Code division multiple access; Power (physics); Mathematical optimization; Wireless; Telecommunications","score_opus":0.03134926825858737,"score_gpt":0.24892862627122206,"score_spread":0.21757935801263467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593612435","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.034771632,0.001074526,0.95785075,0.00019835561,0.00012393284,0.0000449905,0.00008494426,0.000329922,0.0055209585],"genre_scores_gemma":[0.85432875,0.0011168328,0.13719238,0.000117257965,0.00031210607,0.00017166515,0.00013933402,0.00019670396,0.0064249467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938774,0.00023773477,0.00002430546,0.000066826215,0.00016714452,0.000116187985],"domain_scores_gemma":[0.99905485,0.0006246844,0.000053685348,0.00008056021,0.00013418618,0.00005197253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012279775,0.0008811963,0.0011162291,0.00046343464,0.0006088478,0.0012532144,0.00091328396,0.0005769941,0.0020399594],"category_scores_gemma":[0.0030638683,0.00063559035,0.0003001358,0.0013795584,0.00056909473,0.00093246007,0.0009178266,0.0009035871,0.000440326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024508924,0.00009277156,0.00029735634,0.000092921284,0.00005216395,0.000055473192,0.00008374899,0.8970813,0.0074380105,0.021035489,0.0033953006,0.070130326],"study_design_scores_gemma":[0.000010557319,0.000022558566,0.0000487843,0.0000029497055,0.000008635217,0.000008754161,0.000007959232,0.9936777,0.0009636422,0.00489504,0.00035019687,0.0000032948108],"about_ca_topic_score_codex":0.0028032935,"about_ca_topic_score_gemma":0.0037940268,"teacher_disagreement_score":0.0028032935,"about_ca_system_score_codex":0.0010602989,"about_ca_system_score_gemma":0.0014968807,"threshold_uncertainty_score":0.0076929927},"labels":[],"label_agreement":null},{"id":"W1593632102","doi":"10.1007/978-3-540-25968-8_22","title":"Image-Guided Analysis of Shoulder Pathologies: Modelling the 3D Deformation of the Subacromial Space during Arm Flexion and Abduction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Shoulder Injury and Treatment","field":"Medicine","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":"Université Laval","funders":"","keywords":"Computer science; Segmentation; Morphing; Artificial intelligence; Computer vision; Extrapolation; Deformation (meteorology); Motion (physics); Pattern recognition (psychology); Mathematics; Geology","score_opus":0.03010215802792854,"score_gpt":0.2893131927306882,"score_spread":0.25921103470275964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593632102","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.06909581,0.0030955346,0.91919774,0.00023712644,0.00010674121,0.0000882406,0.00056164054,0.0019270561,0.005689969],"genre_scores_gemma":[0.6407791,0.0062697907,0.31901407,0.00024840533,0.00009884745,0.00019483226,0.00093119894,0.0009306227,0.03153319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998981,0.000011902657,0.000004323327,0.000023345712,0.000051931536,0.0000104222745],"domain_scores_gemma":[0.9998559,0.000078446275,0.000019750969,0.000016900005,0.000020966807,0.000008038277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018263722,0.0007314413,0.000569978,0.00038700286,0.00014121488,0.00091364037,0.0008254974,0.0012791582,0.0034394849],"category_scores_gemma":[0.0005248594,0.0006305066,0.0008021447,0.0003718568,0.0003095569,0.00040698008,0.00039840385,0.00043215128,0.0011890777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022182218,0.000091974136,0.0014843236,0.0005190746,0.00008440504,0.00047163136,0.0004608511,0.42221108,0.21858296,0.0020378206,0.0041057724,0.3497282],"study_design_scores_gemma":[0.00002548198,0.00018059034,0.0076628025,0.00009522307,0.00007546405,0.0017255148,0.00011348716,0.94110656,0.035566047,0.0037983835,0.00958129,0.000069118076],"about_ca_topic_score_codex":0.002495531,"about_ca_topic_score_gemma":0.004944878,"teacher_disagreement_score":0.0034394849,"about_ca_system_score_codex":0.00026531832,"about_ca_system_score_gemma":0.00041274537,"threshold_uncertainty_score":0.0115062},"labels":[],"label_agreement":null},{"id":"W1593694652","doi":"10.1007/978-3-642-16248-0_97","title":"Naive Bayesian Rough Sets","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":105,"is_retracted":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":"Naive Bayes classifier; Probabilistic classification; Bayesian programming; Mathematics; Rough set; Artificial intelligence; Conditional independence; Machine learning; Conditional probability; Probabilistic logic; Pattern recognition (psychology); Bayesian probability; Dominance-based rough set approach; Computer science; Bayesian statistics; Bayesian inference; Statistics; Support vector machine","score_opus":0.014600211036576362,"score_gpt":0.24021081442484715,"score_spread":0.2256106033882708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593694652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071216826,0.0052521336,0.8849025,0.002440712,0.0005946349,0.00009787235,0.00043768532,0.0005258132,0.09862709],"genre_scores_gemma":[0.41717845,0.007930244,0.49363053,0.0012120688,0.0013400153,0.0002759831,0.0012786771,0.00028786346,0.07686617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972172,0.0010354607,0.0001337655,0.00031786505,0.001168781,0.00012692666],"domain_scores_gemma":[0.9971136,0.0014284645,0.00014962937,0.0006995689,0.0005222732,0.00008639656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028110123,0.00080829306,0.0014665191,0.0016488933,0.0009978447,0.0036581724,0.0013809983,0.0014546564,0.01049998],"category_scores_gemma":[0.013989282,0.0007471186,0.0010308964,0.0017163296,0.0014256279,0.0036260828,0.0013500288,0.0024531842,0.0029128238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075476004,0.000037638205,0.00019910478,0.00016107704,0.00006838668,0.000058107584,0.0001109403,0.014168354,0.00036869425,0.81288385,0.015395994,0.15647237],"study_design_scores_gemma":[0.000010498021,0.000015585421,0.00014162953,0.000032630134,0.00002367553,0.000087120716,0.000023632783,0.03781483,0.00023692867,0.94604474,0.01555129,0.000017420436],"about_ca_topic_score_codex":0.0014624109,"about_ca_topic_score_gemma":0.0017742764,"teacher_disagreement_score":0.01049998,"about_ca_system_score_codex":0.0012992684,"about_ca_system_score_gemma":0.0010265122,"threshold_uncertainty_score":0.03512597},"labels":[],"label_agreement":null},{"id":"W1593793911","doi":"10.1007/11427995_7","title":"Private Mining of Association Rules","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Ottawa","funders":"","keywords":"Homomorphic encryption; Computer science; Association rule learning; Encryption; Confidentiality; Protocol (science); Computer security; Data sharing; Secure multi-party computation; Private information retrieval; Focus (optics); Set (abstract data type); Task (project management); Data mining; Cryptography","score_opus":0.012836411530273345,"score_gpt":0.23525049561436948,"score_spread":0.22241408408409613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593793911","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.062019948,0.0012864204,0.92790437,0.001274722,0.0001381005,0.00017927351,0.0012015195,0.0014180222,0.004577663],"genre_scores_gemma":[0.5124819,0.001592075,0.46257517,0.00036512237,0.00042896566,0.00021853851,0.0072282623,0.00026456403,0.014845316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954367,0.00096027047,0.00045284542,0.0011230854,0.00176892,0.0002581749],"domain_scores_gemma":[0.9887649,0.005561508,0.0006993525,0.0039152205,0.0008361178,0.00022294442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032363061,0.00065585633,0.0014963975,0.0027639277,0.0011512109,0.0032549547,0.002506529,0.0011682682,0.0031950804],"category_scores_gemma":[0.014081159,0.00087640085,0.0018931708,0.0027046287,0.0011406326,0.005075373,0.003072177,0.0021119819,0.0019595453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065439695,0.0006550038,0.010996341,0.000443451,0.00041662957,0.0005609463,0.00044909224,0.032187253,0.013232053,0.073773585,0.011427555,0.8552036],"study_design_scores_gemma":[0.000101465674,0.00022351675,0.0035228767,0.000117769836,0.0002326161,0.0016899096,0.00021218725,0.5831899,0.020355597,0.37393457,0.016376007,0.000043640714],"about_ca_topic_score_codex":0.0004925179,"about_ca_topic_score_gemma":0.0009652637,"teacher_disagreement_score":0.0032549547,"about_ca_system_score_codex":0.00075764843,"about_ca_system_score_gemma":0.0017218245,"threshold_uncertainty_score":0.017115414},"labels":[],"label_agreement":null},{"id":"W1593795664","doi":"10.1007/978-3-540-30077-9_32","title":"Towards a Multidimensional Model for Web-Based Applications Quality Assessment","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université de Montréal","funders":"","keywords":"Computer science; Dimension (graph theory); Reliability (semiconductor); Field (mathematics); Quality (philosophy); Web application; Software engineering; Software quality; Data mining; Reliability engineering; Software; World Wide Web; Software development; Programming language","score_opus":0.04486501813205816,"score_gpt":0.32380002035920297,"score_spread":0.2789350022271448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593795664","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.004710509,0.00025037682,0.991622,0.00036381715,0.000021222259,0.00010693304,0.00016584793,0.00041032414,0.0023491338],"genre_scores_gemma":[0.12553164,0.00046570614,0.8711967,0.00013037362,0.00004107501,0.0004603584,0.00065825647,0.0001182009,0.0013977342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99249035,0.0021416596,0.0012312335,0.000922212,0.0029542393,0.00026039637],"domain_scores_gemma":[0.9891957,0.0038248086,0.0013770375,0.0014303678,0.0037751016,0.00039695567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005421333,0.0011817778,0.00095559674,0.005830614,0.0008505632,0.0073301094,0.0020875132,0.0016914948,0.0022839515],"category_scores_gemma":[0.020547235,0.0007452495,0.0021838497,0.0043567563,0.0016489901,0.007393605,0.0039043576,0.002592096,0.0010833023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001368774,0.00037814945,0.020532439,0.0007475862,0.00040941886,0.00030708933,0.0029523314,0.09213657,0.010317644,0.4638643,0.008588974,0.39962867],"study_design_scores_gemma":[0.000022735754,0.00011995862,0.005893086,0.00032754167,0.00017517478,0.0003899621,0.0009317456,0.7316984,0.0029398769,0.2375749,0.019825261,0.00010141395],"about_ca_topic_score_codex":0.004761803,"about_ca_topic_score_gemma":0.0037131875,"teacher_disagreement_score":0.0073301094,"about_ca_system_score_codex":0.002284524,"about_ca_system_score_gemma":0.0018983932,"threshold_uncertainty_score":0.028671026},"labels":[],"label_agreement":null},{"id":"W1593858405","doi":"10.1007/11914853_54","title":"Reducing the Cost of Validating Mapping Compositions by Exploiting Semantic Relationships","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Composition (language); Semantic mapping; Metadata; Semantic integration; Schema (genetic algorithms); Morphism; Binary number; Data warehouse; Semantics (computer science); Data mapping; Theoretical computer science; Data mining; Information retrieval; Programming language; Semantic Web; Semantic computing; Mathematics","score_opus":0.044615983162791,"score_gpt":0.25431132525704,"score_spread":0.20969534209424898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593858405","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.09955831,0.00053506484,0.87197757,0.001588906,0.00026975258,0.0004984804,0.0009045344,0.016144985,0.008522409],"genre_scores_gemma":[0.3608366,0.00040827648,0.62692857,0.000533904,0.000090024754,0.00018363543,0.0023613968,0.0038663025,0.004791317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9667935,0.011613741,0.0016415067,0.0031462437,0.014996195,0.0018087596],"domain_scores_gemma":[0.85904706,0.089017116,0.0053503383,0.032128938,0.013470133,0.0009864254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0116819,0.0021445458,0.0021869526,0.003630185,0.0026552787,0.005462299,0.006025743,0.003915614,0.009883625],"category_scores_gemma":[0.09375358,0.0023192402,0.0035827446,0.0042126486,0.0030292517,0.014751702,0.0076120016,0.0030683444,0.0029717106],"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.0018671453,0.0007431436,0.017361348,0.0013960754,0.0006747419,0.0022437582,0.0017355775,0.14545587,0.049204115,0.085073836,0.017895222,0.67634916],"study_design_scores_gemma":[0.00020308765,0.0002678107,0.00316127,0.0003465811,0.0006789444,0.0016713161,0.001538768,0.732214,0.09188974,0.1493987,0.018443037,0.0001868565],"about_ca_topic_score_codex":0.010576884,"about_ca_topic_score_gemma":0.02108391,"teacher_disagreement_score":0.0116819,"about_ca_system_score_codex":0.0025063118,"about_ca_system_score_gemma":0.0071712676,"threshold_uncertainty_score":0.061780512},"labels":[],"label_agreement":null},{"id":"W1593893784","doi":"10.1007/978-3-540-73333-1_44","title":"Evaluation of Guiard’s Theory of Bimanual Control for Navigation and Selection","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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 Manitoba","funders":"","keywords":"Computer science; Popularity; Selection (genetic algorithm); Control (management); Human–computer interaction; Movement control; Artificial intelligence; Psychology; Physical medicine and rehabilitation","score_opus":0.031172141959251585,"score_gpt":0.31111511546099757,"score_spread":0.27994297350174596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593893784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08721977,0.0011089109,0.7851102,0.0016395121,0.00027964235,0.00037020634,0.0001600438,0.00065411767,0.123457626],"genre_scores_gemma":[0.83060986,0.00049659214,0.15729856,0.00024217104,0.00007169363,0.00024344296,0.00014956237,0.00014479474,0.010743309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958385,0.0016760903,0.000117879266,0.0004666628,0.001642816,0.00025802825],"domain_scores_gemma":[0.99148893,0.005841319,0.00015885218,0.00092885346,0.0014364758,0.00014562605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056347223,0.0009224609,0.00091539306,0.0016757414,0.0010365038,0.0022576335,0.002291558,0.0015485281,0.01175573],"category_scores_gemma":[0.016870202,0.0004736802,0.00082742254,0.001094104,0.0037376534,0.0045967777,0.0020871041,0.0013531536,0.0009258492],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006428376,0.00021626907,0.0017229563,0.00016054473,0.00008487201,0.00009995922,0.0009972772,0.05300463,0.0017619765,0.77316517,0.0030484346,0.16509508],"study_design_scores_gemma":[0.00016568965,0.0005459633,0.002483325,0.000085338295,0.000083234416,0.00017661744,0.0006026489,0.71708375,0.004488379,0.26212293,0.012100164,0.000061926396],"about_ca_topic_score_codex":0.016112767,"about_ca_topic_score_gemma":0.008236756,"teacher_disagreement_score":0.016112767,"about_ca_system_score_codex":0.0024020805,"about_ca_system_score_gemma":0.0025039932,"threshold_uncertainty_score":0.039326847},"labels":[],"label_agreement":null},{"id":"W1593901098","doi":"10.1007/978-3-540-30217-9_81","title":"Multi-objective Optimization of a Composite Material Spring Design Using an Evolutionary Algorithm","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mechanical Engineering and Vibrations Research","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Spring (device); Evolutionary algorithm; Algorithm; Optimization algorithm; Composite number; Mathematical optimization; Artificial intelligence; Mechanical engineering; Mathematics; Engineering","score_opus":0.028440249301830985,"score_gpt":0.25797370309810946,"score_spread":0.22953345379627849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593901098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041293144,0.00027154136,0.9501859,0.000084157065,0.000069380105,0.0000964572,0.00003084413,0.00015388627,0.007814725],"genre_scores_gemma":[0.44669962,0.00026741732,0.5442515,0.000072025585,0.000055768687,0.0004971742,0.000077161334,0.00012462554,0.007954799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997124,0.00007725104,0.00001205057,0.000043305565,0.0001259547,0.00002898616],"domain_scores_gemma":[0.9994373,0.00031358012,0.00006302914,0.00003063282,0.00012366165,0.000031837724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290826,0.0009461977,0.0012355638,0.0010794449,0.0006182657,0.000880965,0.0012347784,0.0022021679,0.003655721],"category_scores_gemma":[0.0015210841,0.0008044534,0.0011080054,0.0008657707,0.0005579239,0.00067355565,0.0008438954,0.0008187782,0.0004257155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031925298,0.00004203543,0.00011024153,0.000046076457,0.00002106213,0.000038452083,0.000016635493,0.98071355,0.0028974023,0.0016613607,0.000138823,0.014282474],"study_design_scores_gemma":[0.000007969265,0.000035251694,0.000056489294,0.0000035460628,0.0000072756247,0.000009217026,0.0000036632005,0.99900156,0.00036988407,0.0003090808,0.00019340178,0.0000026366279],"about_ca_topic_score_codex":0.0013806289,"about_ca_topic_score_gemma":0.0019488113,"teacher_disagreement_score":0.003655721,"about_ca_system_score_codex":0.0005561416,"about_ca_system_score_gemma":0.0007507636,"threshold_uncertainty_score":0.012229621},"labels":[],"label_agreement":null},{"id":"W1593942753","doi":"10.1007/978-3-642-16612-9_15","title":"Clara: A Framework for Partially Evaluating Finite-State Runtime Monitors Ahead of Time","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science; Runtime verification; AspectJ; Compile time; Compiler; Residual; Static analysis; State (computer science); Runtime system; Property (philosophy); Programming language; Distributed computing; Aspect-oriented programming; Formal verification; Software; Algorithm","score_opus":0.034323428866062475,"score_gpt":0.3122384992071882,"score_spread":0.2779150703411257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593942753","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.0018187603,0.00027650042,0.92629665,0.000098186174,0.000105258245,0.000091903006,0.00028736197,0.069302596,0.0017228175],"genre_scores_gemma":[0.079304166,0.000272128,0.9026127,0.00023197604,0.00015012076,0.00032486118,0.0010349673,0.011655738,0.004413326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936178,0.0016537253,0.00053252827,0.0013241641,0.0022843704,0.00058743847],"domain_scores_gemma":[0.9878181,0.006296372,0.0008797426,0.0032732133,0.001337213,0.00039528002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060761115,0.0033824826,0.0027289118,0.002335398,0.0013473044,0.005276554,0.008252964,0.0029149225,0.018549997],"category_scores_gemma":[0.01941569,0.0039264397,0.003742582,0.0014915976,0.002784384,0.008338798,0.0042709424,0.005356034,0.0056493366],"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.002824418,0.00035374705,0.0033924547,0.0022115116,0.0005482401,0.00070880895,0.0008782167,0.11622047,0.037632335,0.17535704,0.060111266,0.5997615],"study_design_scores_gemma":[0.00044368513,0.00027203685,0.00054819795,0.0002936956,0.0003618995,0.0004578771,0.000090468835,0.7648379,0.05481756,0.110288836,0.06733685,0.00025102854],"about_ca_topic_score_codex":0.006154794,"about_ca_topic_score_gemma":0.008816345,"teacher_disagreement_score":0.018549997,"about_ca_system_score_codex":0.002127454,"about_ca_system_score_gemma":0.0039740494,"threshold_uncertainty_score":0.062055945},"labels":[],"label_agreement":null},{"id":"W1593995188","doi":"10.1007/11533962_24","title":"Lineage Tracing in Mediator-Based Information Integration Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Computer science; Tracing; Metadata; Context (archaeology); Schema (genetic algorithms); Lineage (genetic); Information retrieval; Theoretical computer science; Distributed computing; Programming language; World Wide Web","score_opus":0.06659882761350404,"score_gpt":0.334403244244845,"score_spread":0.26780441663134097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593995188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025460375,0.0014740279,0.9657122,0.00072476664,0.00006954655,0.00018356708,0.00010909606,0.0016319221,0.0046344013],"genre_scores_gemma":[0.316261,0.001208905,0.6720295,0.00021100543,0.00006655023,0.0002536556,0.00055865175,0.0005435343,0.008867249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956964,0.0018423026,0.00033297,0.0005050854,0.0013255107,0.00029774714],"domain_scores_gemma":[0.98932517,0.0064327144,0.00052459456,0.0024927026,0.000984093,0.0002407119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009682654,0.00053496583,0.0012270852,0.0016605549,0.0023450481,0.0057749986,0.0036100033,0.0028761413,0.0042114407],"category_scores_gemma":[0.021306476,0.0011672316,0.0007927782,0.00296216,0.0020856338,0.008608061,0.004996523,0.0027801835,0.0009856293],"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.00085537025,0.00029186392,0.005623419,0.00039962714,0.00013910994,0.0008984616,0.0052968557,0.10677562,0.010535113,0.42455456,0.006753646,0.43787634],"study_design_scores_gemma":[0.000096194664,0.00014555467,0.0007135051,0.0001746996,0.00014029624,0.0005421076,0.00076540106,0.61377585,0.024197409,0.32882103,0.030556727,0.00007126444],"about_ca_topic_score_codex":0.003043681,"about_ca_topic_score_gemma":0.002605069,"teacher_disagreement_score":0.009682654,"about_ca_system_score_codex":0.0014111948,"about_ca_system_score_gemma":0.0019441221,"threshold_uncertainty_score":0.051207364},"labels":[],"label_agreement":null},{"id":"W1594085708","doi":"10.1007/11875604_56","title":"Mining and Modeling Database User Access Patterns","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"York University","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Database; Focus (optics); Data mining; Database design; Database model; Data modeling; Information retrieval","score_opus":0.041311983235184625,"score_gpt":0.28974080619172327,"score_spread":0.24842882295653865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594085708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45249742,0.0015369783,0.5360138,0.0010637812,0.00007523131,0.0002688156,0.003182311,0.0022988291,0.0030628922],"genre_scores_gemma":[0.8069661,0.0012211287,0.18404835,0.00011039114,0.00010473934,0.0002120111,0.00407878,0.00012515554,0.0031333365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865353,0.00024826426,0.00015444789,0.00034165653,0.0004812912,0.00012081021],"domain_scores_gemma":[0.9948919,0.0029584148,0.00059929903,0.00067001244,0.0007303809,0.0001500479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013930259,0.00062495645,0.0007928254,0.0040181363,0.0005584025,0.00221503,0.0015257319,0.0009375625,0.00097396126],"category_scores_gemma":[0.009024393,0.00059171655,0.0011814823,0.004627451,0.00049460016,0.0044612987,0.00076765544,0.0010244709,0.00051303994],"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.0004936,0.00094253954,0.20472878,0.0006385051,0.0004054605,0.0009986857,0.0010198964,0.1187224,0.009857314,0.042582188,0.010280505,0.6093302],"study_design_scores_gemma":[0.000013073278,0.00006525583,0.0103901215,0.000037746904,0.00008731737,0.0004997714,0.00020843267,0.94959915,0.0033087428,0.033161335,0.0026095638,0.00001950941],"about_ca_topic_score_codex":0.0059928154,"about_ca_topic_score_gemma":0.010007479,"teacher_disagreement_score":0.0059928154,"about_ca_system_score_codex":0.00074061466,"about_ca_system_score_gemma":0.0009329573,"threshold_uncertainty_score":0.011915922},"labels":[],"label_agreement":null},{"id":"W1594101221","doi":"10.1007/978-3-540-77024-4_4","title":"Localized Mobility Control Routing in Robotic Sensor Wireless Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Ottawa","funders":"","keywords":"Computer network; Computer science; Routing (electronic design automation); Wireless sensor network; Geographic routing; Key distribution in wireless sensor networks; Wireless; Transmission (telecommunications); Dynamic Source Routing; Node (physics); Destination-Sequenced Distance Vector routing; Distributed computing; Power control; Path (computing); Routing protocol; Wireless network; Power (physics); Engineering; Telecommunications","score_opus":0.015108765047132348,"score_gpt":0.23982893479733638,"score_spread":0.22472016975020404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594101221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121267345,0.013530382,0.96053416,0.00061314274,0.0004617797,0.000048328355,0.000045659333,0.0008910958,0.011748641],"genre_scores_gemma":[0.6597079,0.01790421,0.27099505,0.00030211013,0.0009704505,0.00036393476,0.00030406,0.00029654606,0.049155764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998029,0.000056279034,0.0000092136315,0.000043632346,0.000070628106,0.000017412714],"domain_scores_gemma":[0.9998141,0.00008914759,0.000023427741,0.000038825547,0.000025520465,0.000008979175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034294408,0.00056902017,0.0005875374,0.00042557516,0.00026398152,0.00066653173,0.0011393358,0.0006340379,0.0014442166],"category_scores_gemma":[0.00073561666,0.00030094097,0.00026196943,0.0007535327,0.0006315491,0.0011360656,0.0006500184,0.0006760374,0.0005291077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007672678,0.00007102201,0.00021716376,0.00036927735,0.000040574087,0.00011700464,0.00013808858,0.42905903,0.015166568,0.12715857,0.014688611,0.41289738],"study_design_scores_gemma":[0.000020920006,0.00012725605,0.0003749853,0.00005870782,0.000027158092,0.0001886388,0.00005385725,0.85649675,0.005188107,0.097672366,0.039763644,0.000027583774],"about_ca_topic_score_codex":0.00069245393,"about_ca_topic_score_gemma":0.0006881649,"teacher_disagreement_score":0.0014442166,"about_ca_system_score_codex":0.0004752555,"about_ca_system_score_gemma":0.00026064875,"threshold_uncertainty_score":0.0048313737},"labels":[],"label_agreement":null},{"id":"W1594111124","doi":"10.1007/11946441_68","title":"A Software Architecture Framework for On-Line Option Pricing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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 Manitoba","funders":"","keywords":"Computer science; Architecture; Valuation of options; Mobile device; Operating system; Finance","score_opus":0.0961320830616527,"score_gpt":0.38388602323757964,"score_spread":0.2877539401759269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594111124","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.0024347554,0.000080070065,0.9740249,0.0000874576,0.00003251101,0.0000896955,0.00012116894,0.021557922,0.0015714619],"genre_scores_gemma":[0.09892152,0.000391289,0.8832543,0.0002862019,0.00006430709,0.0005838914,0.0018585696,0.0067864293,0.007853461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986117,0.00029348276,0.00018157446,0.00017377254,0.00056650885,0.00017294062],"domain_scores_gemma":[0.99783903,0.0007382431,0.00012739764,0.000740162,0.00043259983,0.00012251594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002322843,0.0016251898,0.0009907,0.0014199114,0.0007221675,0.0040958095,0.004217426,0.00256075,0.009789596],"category_scores_gemma":[0.005467397,0.0017786463,0.0018720485,0.0012572267,0.00089472136,0.0044654156,0.0023149874,0.0032687976,0.004318703],"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.0005514319,0.00056936993,0.003268586,0.00051993626,0.0003296772,0.0008618294,0.0008398836,0.2010221,0.02278553,0.15368663,0.044682063,0.5708829],"study_design_scores_gemma":[0.00014884779,0.00009710654,0.000414404,0.0001128434,0.00012640104,0.0002838509,0.00005398189,0.8624877,0.0137338275,0.07849012,0.04398096,0.00007000201],"about_ca_topic_score_codex":0.0063530174,"about_ca_topic_score_gemma":0.0049840123,"teacher_disagreement_score":0.009789596,"about_ca_system_score_codex":0.0010782382,"about_ca_system_score_gemma":0.0014889281,"threshold_uncertainty_score":0.032749414},"labels":[],"label_agreement":null},{"id":"W1594158026","doi":"10.1007/978-3-540-73770-4_2","title":"Testable Requirements and Specifications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Computer science; Eiffel; System requirements specification; Artifact (error); Formal specification; Software requirements specification; Programming language; Requirements analysis; Software engineering; Software design; Software development; Object-oriented programming; Artificial intelligence; Software","score_opus":0.10731488702487334,"score_gpt":0.3223114675278867,"score_spread":0.21499658050301335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594158026","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.0032621871,0.0037684974,0.68287575,0.0024746154,0.0004967462,0.00024611637,0.00029130955,0.000885065,0.30569965],"genre_scores_gemma":[0.2230541,0.014653913,0.41391113,0.0022092694,0.0007525763,0.0014979661,0.0024181355,0.0014899307,0.3400129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975738,0.0006677045,0.00018225933,0.00020242203,0.0012779065,0.00009588815],"domain_scores_gemma":[0.99736613,0.0017160114,0.00009660922,0.00053398573,0.00024921252,0.000038051847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001785202,0.0012694086,0.0006926909,0.0013883964,0.0004690033,0.002947945,0.0016194144,0.0018347176,0.017897395],"category_scores_gemma":[0.0055738455,0.0010002228,0.0008188955,0.0013040756,0.0033197654,0.0045178016,0.0015691962,0.0029847042,0.005482651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012158136,0.000019665991,0.00002422398,0.00020466399,0.000006135292,0.0000890242,0.00022771076,0.002208977,0.0011351289,0.928355,0.007124701,0.060592595],"study_design_scores_gemma":[0.000020114596,0.0000330859,0.000052226154,0.00021520675,0.000010640951,0.00023078933,0.000090810565,0.0055213664,0.0035116759,0.8392841,0.15101534,0.000014524425],"about_ca_topic_score_codex":0.0006209293,"about_ca_topic_score_gemma":0.0006088835,"teacher_disagreement_score":0.017897395,"about_ca_system_score_codex":0.0012096697,"about_ca_system_score_gemma":0.00088025985,"threshold_uncertainty_score":0.059872746},"labels":[],"label_agreement":null},{"id":"W1594194724","doi":"10.1007/978-3-642-03767-2_33","title":"Incorporating Shape Features in an Appearance-Based Object Detection System","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Computer science; Artificial intelligence; Pascal (unit); Scale-invariant feature transform; Computer vision; Object (grammar); Object detection; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Exploit; Active shape model; Feature extraction; Segmentation","score_opus":0.014883667523210376,"score_gpt":0.262392703677368,"score_spread":0.24750903615415762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594194724","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.061191265,0.0008005501,0.92850393,0.00016902998,0.00019855436,0.00011716832,0.0001411746,0.006703195,0.0021751486],"genre_scores_gemma":[0.30856135,0.00072619464,0.68194675,0.00036276242,0.00012743418,0.00011117644,0.0003923181,0.00032123484,0.0074507673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995882,0.000036286467,0.000025498306,0.00008885798,0.00021682738,0.00004426876],"domain_scores_gemma":[0.9992281,0.00022933888,0.00004794686,0.00009066459,0.00035192937,0.000051951705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006593,0.00057693745,0.0010987347,0.001115767,0.00036110485,0.0009423789,0.0015592856,0.0013586754,0.0027574953],"category_scores_gemma":[0.0015863887,0.0007312117,0.0006206553,0.0011757112,0.0002827028,0.0013272592,0.00078075577,0.00065427244,0.0026244186],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004161144,0.00019052452,0.0013372137,0.00010850843,0.00006237256,0.00015095851,0.000025437375,0.009343914,0.2890489,0.00044660293,0.0017339449,0.69713545],"study_design_scores_gemma":[0.000060286256,0.000492061,0.0061385487,0.000028135242,0.0002157886,0.0008039617,0.000027548882,0.8123165,0.17483433,0.001046318,0.00397087,0.00006555667],"about_ca_topic_score_codex":0.002687565,"about_ca_topic_score_gemma":0.0042971554,"teacher_disagreement_score":0.0027574953,"about_ca_system_score_codex":0.0003761673,"about_ca_system_score_gemma":0.00043938446,"threshold_uncertainty_score":0.009224713},"labels":[],"label_agreement":null},{"id":"W1594197141","doi":"10.1007/978-3-642-02583-9_47","title":"New Health Information Systems (HIS) Quality-in-Use Model Based on the GQM Approach and HCI Principles","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Concordia University","funders":"","keywords":"Computer science; Viewpoints; Human–computer interaction; Affordance; Quality (philosophy); Constructive; Metric (unit); User interface; Usability; Knowledge management; Management science","score_opus":0.06832763550228955,"score_gpt":0.27777671473716786,"score_spread":0.20944907923487832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594197141","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.019002935,0.0014767126,0.9154248,0.011135772,0.00025560654,0.0005861408,0.00054026925,0.00064619415,0.050931506],"genre_scores_gemma":[0.37346363,0.0015859107,0.6118323,0.0012612182,0.00013079746,0.0009826542,0.0007587551,0.00012222397,0.0098625235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99314207,0.0032594597,0.00058184005,0.00052148366,0.0022690638,0.000226028],"domain_scores_gemma":[0.9950127,0.0026124208,0.0003880181,0.0003698362,0.001434785,0.00018227349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007122626,0.00064885855,0.0006976102,0.002607692,0.0006662993,0.003520627,0.0015660408,0.0015773477,0.003510274],"category_scores_gemma":[0.009731953,0.00039253224,0.001044071,0.0036850912,0.0023361181,0.005507106,0.002232799,0.0018207957,0.00049336464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006807656,0.00013432308,0.0036804983,0.00071247556,0.00011145677,0.00016704906,0.0034760742,0.017137019,0.0015742248,0.7978177,0.010300441,0.16482067],"study_design_scores_gemma":[0.00010884082,0.00054730667,0.008600084,0.0007906156,0.00025272812,0.00057543314,0.0029762792,0.18117684,0.0025237165,0.679315,0.12301983,0.000113299546],"about_ca_topic_score_codex":0.006542413,"about_ca_topic_score_gemma":0.005729948,"teacher_disagreement_score":0.007122626,"about_ca_system_score_codex":0.004265238,"about_ca_system_score_gemma":0.0044166646,"threshold_uncertainty_score":0.037668467},"labels":[],"label_agreement":null},{"id":"W1594223073","doi":"10.1007/978-3-540-72990-7_64","title":"A Performance Analysis of Tandem Networks with Markovian Sources","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","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":"Concordia University","funders":"","keywords":"Multiplexer; Queueing theory; Queue; Computer science; Markov process; Tandem; Network packet; Generating function; Boundary (topology); Function (biology); Topology (electrical circuits); Mathematics; Computer network; Multiplexing; Discrete mathematics; Statistics; Telecommunications; Combinatorics; Mathematical analysis; Engineering","score_opus":0.011232009522713169,"score_gpt":0.2180560618710221,"score_spread":0.20682405234830895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594223073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17652763,0.0054116556,0.7929742,0.002060173,0.00030906426,0.00015205417,0.00040139144,0.000699124,0.02146481],"genre_scores_gemma":[0.96658987,0.0022087793,0.020631384,0.00019169382,0.00039803082,0.00008711748,0.00018370974,0.00015159618,0.009557979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842346,0.00050346635,0.00004709601,0.00022654084,0.00046397152,0.00033544388],"domain_scores_gemma":[0.98832357,0.008974781,0.0007274119,0.00035782927,0.0012159873,0.00040040613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004159142,0.0014983367,0.0017624468,0.002169825,0.0010589532,0.0025187966,0.0027221995,0.0019453105,0.004914044],"category_scores_gemma":[0.014721468,0.0010388225,0.0009824885,0.0028825237,0.0020600273,0.003516668,0.0018983262,0.0019487082,0.00061876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014534673,0.000055618166,0.00042885958,0.00007495999,0.000047498434,0.00007872607,0.00006748565,0.9230841,0.0016870302,0.064098574,0.0014708829,0.0087609],"study_design_scores_gemma":[0.0000039755064,0.000027678667,0.00009495339,0.000005949037,0.000012052138,0.000022381568,0.000010262471,0.989183,0.00016682314,0.0103345355,0.00013040984,0.00000801856],"about_ca_topic_score_codex":0.006826641,"about_ca_topic_score_gemma":0.00300112,"teacher_disagreement_score":0.006826641,"about_ca_system_score_codex":0.004358223,"about_ca_system_score_gemma":0.00201254,"threshold_uncertainty_score":0.031621218},"labels":[],"label_agreement":null},{"id":"W1594227063","doi":"10.1007/978-3-540-27814-6_41","title":"An Effective Approach Towards Content-Based Image Retrieval","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université du Québec en Outaouais","funders":"","keywords":"Similarity (geometry); Computer science; Similarity measure; Image retrieval; Pattern recognition (psychology); Artificial intelligence; Histogram; Euclidean distance; Measure (data warehouse); Content-based image retrieval; Image (mathematics); Dirichlet distribution; Mathematics; Data mining","score_opus":0.024424010274689434,"score_gpt":0.2649049521861039,"score_spread":0.24048094191141445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594227063","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.002338694,0.0010778566,0.99065137,0.00023647648,0.00018456245,0.00017573357,0.00010498245,0.0015759929,0.0036543123],"genre_scores_gemma":[0.036504693,0.0018088548,0.9418695,0.00037011123,0.00032811356,0.0002901145,0.00048487273,0.00032168566,0.018022088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859744,0.00022286104,0.000077880526,0.00016478066,0.0008513151,0.00008578999],"domain_scores_gemma":[0.99925655,0.00020920168,0.00002733506,0.00020856303,0.0002667297,0.000031670963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079783006,0.0009950077,0.0014843767,0.002545001,0.0008419116,0.0019208649,0.0020423662,0.0016624675,0.008488846],"category_scores_gemma":[0.001930632,0.0005314134,0.0010828809,0.0026408702,0.0008840974,0.0029853273,0.0018073004,0.0011268615,0.007568046],"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.00017637298,0.00020041352,0.00012609317,0.0004545829,0.00008007795,0.0002100506,0.00014782442,0.0059659495,0.15544961,0.03252523,0.024690459,0.7799733],"study_design_scores_gemma":[0.00012831313,0.00042285968,0.0011004434,0.0001146479,0.00039885627,0.0030865865,0.00023712126,0.52851903,0.24956417,0.07543547,0.14084558,0.00014679584],"about_ca_topic_score_codex":0.0016903839,"about_ca_topic_score_gemma":0.002338926,"teacher_disagreement_score":0.008488846,"about_ca_system_score_codex":0.0005718207,"about_ca_system_score_gemma":0.0007458961,"threshold_uncertainty_score":0.028397977},"labels":[],"label_agreement":null},{"id":"W1594239811","doi":"10.1007/3-540-40992-0_16","title":"Self-duality of Bounded Monotone Boolean Functions and Related Problems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Monotone polygon; Duality (order theory); Mathematics; Boolean function; Combinatorics; Discrete mathematics; Constant (computer programming); Polynomial; Time complexity; Domain (mathematical analysis); Computer science; Mathematical analysis","score_opus":0.009432030036658372,"score_gpt":0.2288723471613917,"score_spread":0.21944031712473333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594239811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22046779,0.014697414,0.5272895,0.0074409954,0.0008895201,0.000088710185,0.0004045506,0.00021612256,0.22850542],"genre_scores_gemma":[0.89074653,0.0063937954,0.05991661,0.0012124979,0.0016517602,0.00018079646,0.0004139486,0.0001395027,0.03934463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989066,0.00044364858,0.000049472186,0.00017156168,0.00028579967,0.00014292187],"domain_scores_gemma":[0.99656725,0.0024795777,0.00021963495,0.00018939315,0.00033213297,0.00021188502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001887846,0.00058517174,0.0012300877,0.0015741519,0.0013818337,0.0034402937,0.0013908804,0.001524393,0.0051083853],"category_scores_gemma":[0.0061763166,0.00062222604,0.0011883157,0.0020371547,0.0032510213,0.0065407488,0.0018449454,0.003567706,0.00046942444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019395515,0.000020177455,0.00005160106,0.000035104225,0.000003825743,0.000016323722,0.000053021176,0.0007499494,0.00014578439,0.99437296,0.0009442146,0.0035876401],"study_design_scores_gemma":[0.000008483322,0.0000068360055,0.00004167275,0.000008197012,0.0000030572594,0.000041867384,0.000025475936,0.0049241497,0.00011488891,0.99360025,0.0012217549,0.000003454583],"about_ca_topic_score_codex":0.00056804914,"about_ca_topic_score_gemma":0.00037964,"teacher_disagreement_score":0.0051083853,"about_ca_system_score_codex":0.0020621342,"about_ca_system_score_gemma":0.00073778565,"threshold_uncertainty_score":0.017089248},"labels":[],"label_agreement":null},{"id":"W1594260854","doi":"10.1007/978-3-540-24677-0_26","title":"Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Yen's algorithm; Algorithm; Widest path problem; Floyd–Warshall algorithm; Learning automata; Graph; Euclidean shortest path; Constrained Shortest Path First; Automaton; Dijkstra's algorithm; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.017924304915619162,"score_gpt":0.2598657693234213,"score_spread":0.24194146440780215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594260854","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.014123517,0.0005362633,0.97961926,0.0003459559,0.00009874822,0.000056751396,0.000117127485,0.00053420773,0.004568217],"genre_scores_gemma":[0.5124037,0.0012036411,0.47454324,0.00023380783,0.0001719523,0.0005198743,0.00063251954,0.0003880208,0.009903135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923813,0.0002214774,0.000051069725,0.00020375472,0.00019212035,0.000093437884],"domain_scores_gemma":[0.9960014,0.0031212983,0.00017845683,0.00020928463,0.00036194883,0.00012766062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011935203,0.0010533108,0.0019345004,0.0011399563,0.0008883186,0.0015334929,0.00282793,0.0018148187,0.0050301673],"category_scores_gemma":[0.0062521845,0.00077997154,0.0010626384,0.0017317836,0.0015586488,0.0026276195,0.0021323257,0.0029393225,0.00076326577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006298119,0.000045746918,0.00018855378,0.00006866948,0.000026917653,0.000018115245,0.000050509414,0.9107169,0.0003972676,0.04029357,0.0017542365,0.046376508],"study_design_scores_gemma":[0.0000108088325,0.0000091995935,0.000018775978,0.0000046390905,0.0000041443877,0.000006297099,0.0000046281802,0.97413945,0.000086931585,0.025406139,0.00030482627,0.0000041655594],"about_ca_topic_score_codex":0.008943189,"about_ca_topic_score_gemma":0.009102129,"teacher_disagreement_score":0.008943189,"about_ca_system_score_codex":0.0019074125,"about_ca_system_score_gemma":0.001985629,"threshold_uncertainty_score":0.01778227},"labels":[],"label_agreement":null},{"id":"W1594309940","doi":"10.1007/978-3-642-00904-4_16","title":"Performance Characterization for the Implementation of Content Addressable Memories Based on Parallel Hashing Memories","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Packet Processing and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Architecture; Latency (audio); Hash function; Set (abstract data type); Computer architecture; Very-large-scale integration; Parallel computing; Embedded system; Computer engineering; Programming language; Telecommunications","score_opus":0.031753346613989784,"score_gpt":0.26444498644813563,"score_spread":0.23269163983414584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594309940","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.88896793,0.002396166,0.09609887,0.00023334364,0.000107433676,0.0001391915,0.00034388775,0.0018442435,0.009868983],"genre_scores_gemma":[0.986239,0.00018118236,0.011157787,0.000030988253,0.00004041491,0.000043084023,0.00023269645,0.00006491827,0.0020097946],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995623,0.00008215339,0.00003095941,0.000058728507,0.000157345,0.00010853911],"domain_scores_gemma":[0.9985684,0.00065578916,0.00013718806,0.00026639103,0.00033134944,0.000040821382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000519671,0.0004611234,0.0004776102,0.000611045,0.0003288588,0.0008458799,0.0012671165,0.00046156143,0.004806104],"category_scores_gemma":[0.0019075812,0.0002291538,0.00022818336,0.00069604424,0.00029997906,0.0013339053,0.00033520663,0.00037695453,0.0005804645],"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.00665583,0.0007337035,0.011030354,0.0010661246,0.00031198398,0.0005421079,0.00037632132,0.19517803,0.472865,0.05341979,0.011424952,0.2463959],"study_design_scores_gemma":[0.000112556256,0.0014952614,0.002582979,0.000028220253,0.00013160791,0.0004071178,0.00008821693,0.79230404,0.19299795,0.006598003,0.0032141586,0.0000397736],"about_ca_topic_score_codex":0.00071123004,"about_ca_topic_score_gemma":0.000800754,"teacher_disagreement_score":0.004806104,"about_ca_system_score_codex":0.0007945502,"about_ca_system_score_gemma":0.00054645014,"threshold_uncertainty_score":0.016077995},"labels":[],"label_agreement":null},{"id":"W1594313070","doi":"10.1007/978-3-540-25946-6_18","title":"Laying Down the Foundations of an Agent Modelling Methodology for Fault-Tolerant Multi-agent Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Computer science; Fault tolerance; Multi-agent system; Distributed computing; Artificial intelligence","score_opus":0.1456276495732891,"score_gpt":0.33440750461791036,"score_spread":0.18877985504462125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594313070","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.0005654342,0.00023131105,0.99627316,0.0004599599,0.000067487876,0.00003064208,0.000017283528,0.0001634995,0.0021912188],"genre_scores_gemma":[0.07237248,0.0011596483,0.9181876,0.00043423736,0.00018576042,0.00023270243,0.0001424674,0.00028750842,0.006997527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998464,0.00048104158,0.00018549236,0.00018993937,0.0005627315,0.00011683403],"domain_scores_gemma":[0.9982486,0.00083730463,0.000114018105,0.0003792656,0.00033434472,0.00008648203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000442,0.0011793453,0.0010067842,0.0009965812,0.0014577231,0.004050206,0.0038745184,0.003127745,0.004777943],"category_scores_gemma":[0.0045454795,0.0013344581,0.0021150985,0.0010748499,0.0026358238,0.008918069,0.0030436143,0.0056675943,0.0018811264],"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.000014911055,0.00003146343,0.000114107475,0.00017657242,0.000032937976,0.00014067003,0.000506573,0.043079913,0.0018823544,0.9195346,0.0021774315,0.03230852],"study_design_scores_gemma":[0.000009659489,0.000021183627,0.00004537069,0.00010512054,0.000032299882,0.00012026801,0.000072527815,0.20032544,0.0019844053,0.75973,0.037528142,0.000025627398],"about_ca_topic_score_codex":0.002659654,"about_ca_topic_score_gemma":0.002838794,"teacher_disagreement_score":0.004777943,"about_ca_system_score_codex":0.0013448354,"about_ca_system_score_gemma":0.0018551516,"threshold_uncertainty_score":0.01598382},"labels":[],"label_agreement":null},{"id":"W1594349942","doi":"10.1007/978-3-642-19668-3_12","title":"Uncertainty in Rank Join","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Join (topology); Ranking (information retrieval); Rank (graph theory); Result set; sort; Operator (biology); Set (abstract data type); Information retrieval; Domain (mathematical analysis); Aggregate (composite); Sort-merge join; Semantics (computer science); Theoretical computer science; Core (optical fiber); Learning to rank; Query optimization; Data mining; Programming language","score_opus":0.024074171957326612,"score_gpt":0.23653624849568025,"score_spread":0.21246207653835364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594349942","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.020843,0.004574351,0.9430518,0.0020245723,0.00045155603,0.00010640687,0.00043098276,0.0008535274,0.02766382],"genre_scores_gemma":[0.61237884,0.003626996,0.31989977,0.00088175345,0.0034629737,0.00043682754,0.0019495228,0.0011218109,0.056241624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99147195,0.0029783212,0.00036214048,0.0010150317,0.003629814,0.00054274546],"domain_scores_gemma":[0.9854798,0.010369197,0.0006576406,0.002038977,0.00095060724,0.00050369796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064208186,0.00093928806,0.0030673412,0.0019822933,0.0021632728,0.004763858,0.0025648386,0.0023181161,0.0129744895],"category_scores_gemma":[0.024050698,0.0009445403,0.0011194828,0.0033798346,0.0028986256,0.0077425647,0.0050026476,0.0050436384,0.0029901923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046812167,0.00009640367,0.0007294141,0.00023169616,0.000076313816,0.00010190921,0.00028196274,0.07300659,0.0010965986,0.78708065,0.016142199,0.120688125],"study_design_scores_gemma":[0.00003077683,0.00007089443,0.0001896913,0.000032272117,0.000026046675,0.00009472123,0.00005368122,0.22018436,0.00078248716,0.770118,0.008394102,0.000022999444],"about_ca_topic_score_codex":0.001207548,"about_ca_topic_score_gemma":0.0013380857,"teacher_disagreement_score":0.0129744895,"about_ca_system_score_codex":0.0018655085,"about_ca_system_score_gemma":0.0012512977,"threshold_uncertainty_score":0.043404043},"labels":[],"label_agreement":null},{"id":"W1594442179","doi":"10.1007/978-3-642-04554-7_9","title":"A UML Profile for Goal-Oriented Modeling","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Unified Modeling Language; Computer science; Software engineering; Programming language; Applications of UML; UML tool; Notation; Eclipse; Software","score_opus":0.034446792029044514,"score_gpt":0.29000344918527354,"score_spread":0.25555665715622905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594442179","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.0018176993,0.0002683108,0.97073036,0.0006671852,0.00010989685,0.0006258292,0.002156445,0.011434311,0.012190063],"genre_scores_gemma":[0.027505456,0.0010650691,0.9411335,0.00062265625,0.00006363455,0.0010380015,0.010862928,0.004166911,0.013541842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736303,0.000694794,0.00059570506,0.00024556834,0.0009042199,0.00019675204],"domain_scores_gemma":[0.996716,0.0011979894,0.0002629625,0.000640695,0.0009497591,0.00023267834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031349997,0.0019706367,0.001010425,0.0029633415,0.0011112981,0.0052009434,0.002294161,0.0024932448,0.008004054],"category_scores_gemma":[0.007805701,0.0018467042,0.0018522852,0.0023604857,0.0007662365,0.0046558147,0.0021674032,0.0042295787,0.0109603265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002596744,0.0005422939,0.0023010825,0.0017146881,0.00010021876,0.0019206103,0.0041337246,0.024835467,0.028300246,0.39924264,0.11965397,0.41699544],"study_design_scores_gemma":[0.00010631846,0.0001124594,0.0008620802,0.0015600635,0.00013880566,0.002096305,0.0005990337,0.101216,0.01851655,0.13271165,0.74192685,0.00015384004],"about_ca_topic_score_codex":0.0056444425,"about_ca_topic_score_gemma":0.0067577767,"teacher_disagreement_score":0.008004054,"about_ca_system_score_codex":0.0015415575,"about_ca_system_score_gemma":0.0044341167,"threshold_uncertainty_score":0.026776195},"labels":[],"label_agreement":null},{"id":"W1594483674","doi":"10.1007/11888598_51","title":"Computer Assistance for Sustainable Building Design","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Human–computer interaction; Software engineering","score_opus":0.010738023757151702,"score_gpt":0.21309709940650653,"score_spread":0.20235907564935485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594483674","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.008943035,0.007831119,0.7342159,0.00074837747,0.00048794708,0.000071299175,0.00024093117,0.0047519347,0.24270937],"genre_scores_gemma":[0.18453892,0.011011315,0.40821669,0.00039297104,0.00030538984,0.00020957824,0.0009811616,0.00091434264,0.3934297],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998566,0.000031592004,0.0000046215473,0.000017742257,0.000078236684,0.000011259449],"domain_scores_gemma":[0.9998565,0.00006307777,0.0000040154914,0.000028317401,0.000041858268,0.0000062664085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016614886,0.0006122242,0.0003565494,0.0005106204,0.000298874,0.00075449154,0.0006694758,0.0006865083,0.047751576],"category_scores_gemma":[0.00045382814,0.00020865777,0.00020454884,0.00072850497,0.00028259822,0.0008283866,0.00091894536,0.00047013597,0.008215903],"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.000050289127,0.000046949066,0.00017123294,0.00029178316,0.000013375405,0.00013019722,0.00020147041,0.014882546,0.0118613215,0.04350991,0.078925095,0.8499158],"study_design_scores_gemma":[0.000020633102,0.00007151813,0.0006923382,0.00024039052,0.00002190005,0.0005021867,0.00018311977,0.08162742,0.013818936,0.04799211,0.8548051,0.000024351531],"about_ca_topic_score_codex":0.0008393955,"about_ca_topic_score_gemma":0.0014552188,"teacher_disagreement_score":0.047751576,"about_ca_system_score_codex":0.00019864277,"about_ca_system_score_gemma":0.00026752925,"threshold_uncertainty_score":0.15974492},"labels":[],"label_agreement":null},{"id":"W1594494575","doi":"10.1007/3-540-39963-1_47","title":"Automatic Semantic Header Generator","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Search engine indexing; Computer science; Header; Information retrieval; Automatic indexing; Resource (disambiguation); Information extraction; The Internet; Context (archaeology); Generator (circuit theory); Data mining; World Wide Web","score_opus":0.02005951519168582,"score_gpt":0.2453746573692003,"score_spread":0.22531514217751447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594494575","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.013085961,0.00037000817,0.7585823,0.0004309953,0.00066514005,0.00043868818,0.0058702435,0.20726578,0.01329083],"genre_scores_gemma":[0.121117525,0.0005162199,0.78389776,0.00066985725,0.00025188955,0.0005431024,0.036806766,0.028656863,0.027540006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992654,0.000110461835,0.0000679257,0.00020768837,0.00026868514,0.000079840414],"domain_scores_gemma":[0.99810284,0.0007135973,0.000085070955,0.00055873516,0.00046052874,0.00007924504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011152145,0.0017655063,0.0011376684,0.0036823766,0.00089059613,0.0021401697,0.0017097644,0.0013210978,0.041025594],"category_scores_gemma":[0.004048554,0.0010642583,0.0013748116,0.0021716808,0.0006129807,0.0037542006,0.002820245,0.0016473798,0.018386997],"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.00092100987,0.00032589,0.0015580026,0.00074140966,0.00009473815,0.001050967,0.00027839703,0.004946862,0.052248776,0.04468542,0.19291545,0.700233],"study_design_scores_gemma":[0.00033476847,0.00018673389,0.0013931019,0.0002871589,0.00028921495,0.0015281192,0.00031090973,0.2634449,0.36573055,0.097361974,0.26896784,0.00016483341],"about_ca_topic_score_codex":0.0008739978,"about_ca_topic_score_gemma":0.00089681544,"teacher_disagreement_score":0.041025594,"about_ca_system_score_codex":0.0008664907,"about_ca_system_score_gemma":0.0013343615,"threshold_uncertainty_score":0.13724434},"labels":[],"label_agreement":null},{"id":"W1594511349","doi":"10.1007/3-540-44886-1_58","title":"Agent-Based Online Trading System","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Acadia University","funders":"","keywords":"Computer science; Negotiation; Architecture; Peer-to-peer; Systems architecture; Software architecture; Software agent; Software; Multi-agent system; Distributed computing; Software engineering; Human–computer interaction; World Wide Web; Operating system; Artificial intelligence","score_opus":0.03045454828022802,"score_gpt":0.24922801582203927,"score_spread":0.21877346754181126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594511349","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.2465665,0.0010731155,0.69259393,0.00083364005,0.00064415176,0.0004827714,0.0004299029,0.007555021,0.049820963],"genre_scores_gemma":[0.9352986,0.00020685655,0.04968373,0.0001349867,0.00006407458,0.00015215279,0.00026468158,0.000051233998,0.014143693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995989,0.000119712764,0.00003291489,0.000079082536,0.0001138568,0.000055613447],"domain_scores_gemma":[0.9994789,0.00016384533,0.000029697445,0.00009779864,0.00013879205,0.00009101711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070951355,0.000347886,0.00096546015,0.00046955977,0.0010446904,0.001511545,0.001618535,0.0009594346,0.0080047585],"category_scores_gemma":[0.0009879576,0.00024539218,0.00027933152,0.0005660129,0.00035865456,0.001404805,0.0011616655,0.00057202484,0.0015401138],"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.0031918162,0.0036214837,0.0054842923,0.0003114524,0.00030076798,0.0020561644,0.00040251773,0.3443769,0.04575442,0.07046221,0.03532968,0.48870832],"study_design_scores_gemma":[0.0001655147,0.00016704768,0.00046612986,0.0000059628637,0.000043757726,0.00019633083,0.000028827088,0.9776273,0.0033865732,0.012118096,0.005775315,0.000019195893],"about_ca_topic_score_codex":0.0013662786,"about_ca_topic_score_gemma":0.0010835696,"teacher_disagreement_score":0.0080047585,"about_ca_system_score_codex":0.0003634033,"about_ca_system_score_gemma":0.0006762729,"threshold_uncertainty_score":0.026778579},"labels":[],"label_agreement":null},{"id":"W1594537107","doi":"10.1007/3-540-45841-7_26","title":"A Quantum Goldreich-Levin Theorem with Cryptographic Applications","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Qubit; Quantum; Quantum algorithm; Reduction (mathematics); Quantum computer; Permutation (music); Discrete mathematics; Theoretical computer science; Mathematics; Quantum mechanics; Physics","score_opus":0.010395302736202714,"score_gpt":0.21846412816962701,"score_spread":0.2080688254334243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594537107","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.052385524,0.008560444,0.50659287,0.014640795,0.0026738062,0.000111769245,0.00041048107,0.00067970995,0.41394463],"genre_scores_gemma":[0.7877442,0.005447515,0.09146794,0.0034764209,0.0032413183,0.00024626008,0.0003009695,0.00032156895,0.10775375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991756,0.00025551533,0.000035634304,0.00014089275,0.0002938967,0.00009850665],"domain_scores_gemma":[0.99855953,0.0008446629,0.00008651938,0.00026972778,0.00017690547,0.00006269562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011455199,0.00095947034,0.0010331932,0.0016064369,0.00203756,0.0030655917,0.0013009921,0.002702988,0.0096980985],"category_scores_gemma":[0.0051778997,0.000606,0.00093711854,0.0022618435,0.0049027875,0.00649904,0.0031094917,0.004042871,0.0029968496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010095772,0.0000066515368,0.000023143924,0.000018368357,0.0000022462634,0.000020552363,0.000022387941,0.00064909883,0.00016239221,0.99305797,0.0017283175,0.004298765],"study_design_scores_gemma":[0.000003870906,0.000003893408,0.00001734368,0.0000060899224,0.0000020855498,0.000031517648,0.0000055291016,0.0018094293,0.00013018731,0.9950046,0.0029810206,0.000004320762],"about_ca_topic_score_codex":0.0003764141,"about_ca_topic_score_gemma":0.00028999738,"teacher_disagreement_score":0.0096980985,"about_ca_system_score_codex":0.0015303706,"about_ca_system_score_gemma":0.0009458858,"threshold_uncertainty_score":0.032443345},"labels":[],"label_agreement":null},{"id":"W1594587694","doi":"10.1007/3-540-45624-4_13","title":"Optimal Double Circulant Z4-Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Computer science; Theoretical computer science; Algorithm","score_opus":0.019987837981299827,"score_gpt":0.2410516356966528,"score_spread":0.22106379771535298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594587694","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.24223074,0.0059362715,0.48654246,0.0028476578,0.0014226984,0.00023936627,0.0013031997,0.0014855838,0.25799206],"genre_scores_gemma":[0.7433921,0.0034933176,0.1727652,0.0009435759,0.00047005282,0.0003194077,0.00086456444,0.00064796564,0.07710385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922013,0.00014630432,0.000038775433,0.000099838166,0.00029539602,0.00019947372],"domain_scores_gemma":[0.9990575,0.0003317518,0.00010648661,0.00021692317,0.00018801911,0.00009929259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059381995,0.0010551262,0.00081200677,0.0013749753,0.0009094658,0.0017530425,0.00079465803,0.0011276916,0.010803875],"category_scores_gemma":[0.0028214387,0.0004946843,0.0005013587,0.001593394,0.0011493586,0.0017930816,0.0017609944,0.001439777,0.0024070505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003496566,0.000045223383,0.00018521669,0.00017926992,0.000021266742,0.00007699113,0.00006873209,0.018443577,0.008796438,0.883272,0.008242756,0.08031902],"study_design_scores_gemma":[0.00012972062,0.00011024648,0.00026070204,0.00012418997,0.000034637203,0.00024156155,0.000056054698,0.054754198,0.01406963,0.9041523,0.02600976,0.000057116144],"about_ca_topic_score_codex":0.00069425453,"about_ca_topic_score_gemma":0.0012629823,"teacher_disagreement_score":0.010803875,"about_ca_system_score_codex":0.0014675175,"about_ca_system_score_gemma":0.0016590204,"threshold_uncertainty_score":0.036142588},"labels":[],"label_agreement":null},{"id":"W1594588516","doi":"10.1007/3-540-45105-6_106","title":"On the Treewidth of NK Landscapes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Alberta","funders":"","keywords":"Treewidth; Computer science; Theoretical computer science; Graph; Pathwidth","score_opus":0.020274896276776408,"score_gpt":0.2661022176563283,"score_spread":0.24582732137955188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594588516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2283918,0.019938745,0.42625776,0.0066829207,0.0006894011,0.00008645727,0.0015600366,0.0005368907,0.31585598],"genre_scores_gemma":[0.80985576,0.014537161,0.12949894,0.0011191585,0.00089534593,0.000210787,0.0011913634,0.00066221366,0.042029366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996126,0.00009365278,0.000024326979,0.00007840101,0.0001236284,0.00006742392],"domain_scores_gemma":[0.99672556,0.002502591,0.00017906066,0.0002372173,0.0002082138,0.0001473649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056712807,0.0005203506,0.0009860585,0.0016225228,0.0009400696,0.0026784572,0.0016072264,0.0010706271,0.010919623],"category_scores_gemma":[0.006539476,0.0006108883,0.0005607271,0.0028612632,0.0018153932,0.0080983555,0.0017286211,0.0036231107,0.0011060849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092488815,0.000030864627,0.00081024726,0.0002683764,0.000019285177,0.000094028655,0.00042139855,0.019775363,0.0022162434,0.89606494,0.01071621,0.069490544],"study_design_scores_gemma":[0.000009407247,0.000009231982,0.00042751728,0.00005863006,0.000010884969,0.00016258178,0.00010979704,0.022351505,0.00029914262,0.96956944,0.006984092,0.000007722487],"about_ca_topic_score_codex":0.001490625,"about_ca_topic_score_gemma":0.0017707488,"teacher_disagreement_score":0.010919623,"about_ca_system_score_codex":0.0011470726,"about_ca_system_score_gemma":0.0003065922,"threshold_uncertainty_score":0.03652978},"labels":[],"label_agreement":null},{"id":"W1594634494","doi":"10.1007/978-3-642-04468-7_19","title":"Towards Model-Based Automatic Testing of Attack Scenarios","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.043578089789563096,"score_gpt":0.28380566725869855,"score_spread":0.24022757746913545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594634494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076409094,0.0001133475,0.98380697,0.00008513058,0.000022691542,0.00007962423,0.00009647396,0.006898087,0.0012567058],"genre_scores_gemma":[0.19868837,0.0001796068,0.79796636,0.00012377225,0.000029773717,0.00013220408,0.000607888,0.0008484853,0.0014235309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965796,0.0010999996,0.00021603957,0.0004834744,0.0013702477,0.00025068154],"domain_scores_gemma":[0.9898003,0.005958881,0.00061386597,0.002273312,0.0011864417,0.00016721134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020417648,0.0015334885,0.0012107498,0.0022709656,0.00043897732,0.0022837438,0.0028117038,0.0018481119,0.0036734166],"category_scores_gemma":[0.0112462845,0.0012992023,0.0018290848,0.0010194756,0.0011884595,0.003609633,0.0025932589,0.0024470738,0.0016668974],"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.00047623247,0.000499154,0.0034917304,0.0007201684,0.00027193868,0.0006080821,0.00043284404,0.36896867,0.059932265,0.059977103,0.012306421,0.49231532],"study_design_scores_gemma":[0.000030520663,0.0000450901,0.00020425644,0.000040069714,0.000033984805,0.0001647356,0.000025806981,0.9538096,0.009988752,0.03369315,0.001948816,0.000015190048],"about_ca_topic_score_codex":0.0021348738,"about_ca_topic_score_gemma":0.0035847877,"teacher_disagreement_score":0.0036734166,"about_ca_system_score_codex":0.00089661207,"about_ca_system_score_gemma":0.0010577585,"threshold_uncertainty_score":0.012288749},"labels":[],"label_agreement":null},{"id":"W1594759092","doi":"10.1007/978-3-642-01877-0_19","title":"Unconditionally Secure Approximate Message Authentication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Authentication (law); Message authentication code; Computer security; Computer network; Theoretical computer science; Cryptography","score_opus":0.011421626811558484,"score_gpt":0.2365785533538097,"score_spread":0.22515692654225122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594759092","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.038722858,0.0005931453,0.9341473,0.0005257314,0.00019822798,0.00009114065,0.0001314051,0.001598988,0.023991227],"genre_scores_gemma":[0.8719912,0.00053052534,0.09648942,0.00021682783,0.00019339696,0.0001399161,0.00025150983,0.00016050196,0.030026596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983854,0.00031249464,0.00009673987,0.00017437905,0.0007529523,0.00027801484],"domain_scores_gemma":[0.99814415,0.0005191465,0.00013688351,0.00088369823,0.00026479588,0.00005140475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007090461,0.00061116583,0.00089525984,0.00061912247,0.00081539515,0.0019560421,0.00081322016,0.0010668661,0.0056913714],"category_scores_gemma":[0.003250705,0.00033721246,0.00043132325,0.00079542893,0.0012654237,0.0035289745,0.0034069943,0.0019664257,0.003575332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011079354,0.00010958383,0.00028648754,0.00020662471,0.00004012225,0.000227898,0.00032495102,0.02946332,0.04765337,0.725039,0.0057383743,0.18980226],"study_design_scores_gemma":[0.000086296226,0.00042242394,0.0005578794,0.000083060346,0.00007048399,0.0012753988,0.00013048733,0.33368924,0.1011356,0.52913725,0.03331671,0.00009512023],"about_ca_topic_score_codex":0.00016707265,"about_ca_topic_score_gemma":0.00017080079,"teacher_disagreement_score":0.0056913714,"about_ca_system_score_codex":0.00065919326,"about_ca_system_score_gemma":0.0006906274,"threshold_uncertainty_score":0.019039571},"labels":[],"label_agreement":null},{"id":"W1594764932","doi":"10.1007/978-3-540-70569-7","title":"Interactive Systems. Design, Specification, and Verification","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Queen's University","funders":"","keywords":"Computer science; Programming language; Software engineering","score_opus":0.036282794376147905,"score_gpt":0.25399254514045216,"score_spread":0.21770975076430427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594764932","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033386943,0.037516903,0.759095,0.0015611105,0.0009579898,0.0005179118,0.0014107298,0.0076860115,0.18791567],"genre_scores_gemma":[0.13847312,0.04071092,0.58794713,0.0013176487,0.0010995563,0.0020253554,0.004142551,0.002339419,0.22194435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983729,0.00034587723,0.00010570471,0.00017508374,0.000930469,0.000069985246],"domain_scores_gemma":[0.99866164,0.00074449956,0.000051320763,0.00028908227,0.00021967903,0.000033825978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009499423,0.0016795445,0.0008679595,0.0011800848,0.00068136206,0.0030439545,0.0015133389,0.0016149429,0.022502042],"category_scores_gemma":[0.0033603308,0.0012798967,0.00063091447,0.00188096,0.0017286785,0.003113969,0.0016999237,0.0024067515,0.012084145],"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.00006792207,0.00007505959,0.00030947366,0.0014244736,0.0000387365,0.00016915567,0.00063423096,0.009846115,0.0044079283,0.38728914,0.0859646,0.5097731],"study_design_scores_gemma":[0.00009290438,0.00011561531,0.0007755353,0.00066118763,0.00009042225,0.0007941363,0.0002809052,0.03649276,0.006785845,0.28199428,0.6718683,0.000048087695],"about_ca_topic_score_codex":0.0042111706,"about_ca_topic_score_gemma":0.004280602,"teacher_disagreement_score":0.022502042,"about_ca_system_score_codex":0.0011781023,"about_ca_system_score_gemma":0.0015121368,"threshold_uncertainty_score":0.07527679},"labels":[],"label_agreement":null},{"id":"W1594807353","doi":"10.1007/978-3-540-69338-3_18","title":"Evaluation of Offset Assignment Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","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":"Heuristics; Computer science; Offset (computer science); Partition (number theory); Parallel computing; Computation; Heuristic; Overhead (engineering); Algorithm; Optimization problem; Permutation (music); Mathematics; Artificial intelligence","score_opus":0.046179339151198893,"score_gpt":0.27764341996179565,"score_spread":0.23146408081059675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594807353","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.73319024,0.008642058,0.12871242,0.0013179128,0.0014999766,0.0010139636,0.0037918102,0.0138770295,0.10795448],"genre_scores_gemma":[0.7148678,0.0011348589,0.2647822,0.00036312352,0.0001670412,0.00031347806,0.0055067167,0.0017280703,0.01113676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963665,0.0012429182,0.00016340258,0.00060100557,0.0009466865,0.00067943457],"domain_scores_gemma":[0.9871257,0.009313375,0.00039762552,0.00117837,0.0015192918,0.0004656738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032226543,0.00281862,0.0023666755,0.0026535264,0.0016670092,0.0027032734,0.0037076438,0.0023614876,0.018144494],"category_scores_gemma":[0.010956957,0.00090637396,0.0010620579,0.0041032326,0.0009915167,0.0026311984,0.0017012602,0.0014258499,0.0019616392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005623592,0.002352781,0.0025848204,0.00097138603,0.00026441837,0.00015099577,0.0001612442,0.58063257,0.0044354843,0.010825414,0.027140621,0.3648566],"study_design_scores_gemma":[0.00061194866,0.00056966336,0.00075081026,0.0000624488,0.000114166905,0.00005704261,0.00016317183,0.9857519,0.0043063196,0.0043825647,0.003204644,0.000025358047],"about_ca_topic_score_codex":0.014809085,"about_ca_topic_score_gemma":0.015231876,"teacher_disagreement_score":0.018144494,"about_ca_system_score_codex":0.0044373553,"about_ca_system_score_gemma":0.003998481,"threshold_uncertainty_score":0.060699344},"labels":[],"label_agreement":null},{"id":"W1594829400","doi":"10.1007/978-3-540-87527-7_17","title":"What Hides in Dimension X? A Quest for Visualizing Particle Swarms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Visualization; Particle swarm optimization; Cluster analysis; Representation (politics); Data visualization; Dimension (graph theory); Population; Range (aeronautics); Theoretical computer science; Data mining; Artificial intelligence; Machine learning; Mathematics","score_opus":0.026032629025926197,"score_gpt":0.28392369610236484,"score_spread":0.25789106707643866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594829400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07552901,0.004951048,0.88791,0.009516117,0.0005691048,0.00005002802,0.00024040072,0.0016729321,0.01956136],"genre_scores_gemma":[0.6324574,0.0036141507,0.35243803,0.00081958494,0.00041686645,0.000107292275,0.00017352871,0.0007137715,0.0092594065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976605,0.000102138794,0.000015952606,0.00004953511,0.00004366271,0.000022714325],"domain_scores_gemma":[0.99825794,0.0009263839,0.0001707154,0.00033755938,0.00017741592,0.0001299148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001447,0.000698973,0.00087617204,0.00068219955,0.0009734297,0.0041886293,0.0008044741,0.0013603055,0.0036189025],"category_scores_gemma":[0.0074594785,0.0005824804,0.00055155944,0.00093491224,0.002355939,0.0075718644,0.00167797,0.0026387975,0.00057984487],"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.00028433243,0.000042851283,0.002885233,0.00045769234,0.000080311154,0.00032534957,0.004204199,0.056519758,0.011218342,0.7728888,0.013172875,0.13792038],"study_design_scores_gemma":[0.00004881245,0.00007182195,0.0010375748,0.00020032255,0.00004639067,0.00031835606,0.0014151364,0.28728262,0.0051515484,0.67971987,0.024635421,0.000072128845],"about_ca_topic_score_codex":0.0014174775,"about_ca_topic_score_gemma":0.00082200713,"teacher_disagreement_score":0.0041886293,"about_ca_system_score_codex":0.00052770926,"about_ca_system_score_gemma":0.00041985736,"threshold_uncertainty_score":0.012106419},"labels":[],"label_agreement":null},{"id":"W1594874717","doi":"10.1007/11559573_17","title":"Edge Detection Models","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"Piecewise; Constant (computer programming); Laplace operator; Linear approximation; Contrast (vision); Piecewise linear function; Computer science; Approximation algorithm; Image (mathematics); Edge detection; Algorithm; Segmentation; Image segmentation; Enhanced Data Rates for GSM Evolution; Applied mathematics; Artificial intelligence; Mathematics; Image processing; Mathematical analysis; Nonlinear system; Physics","score_opus":0.02259402804802146,"score_gpt":0.2675673996897302,"score_spread":0.24497337164170874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594874717","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.0053963484,0.0016197932,0.9656243,0.000302844,0.0002661598,0.00007653868,0.000715171,0.0025082547,0.023490613],"genre_scores_gemma":[0.27762216,0.006143294,0.49276543,0.00061788614,0.00040922748,0.00034493746,0.0077757146,0.0016631314,0.21265824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996786,0.000029062157,0.000010596309,0.00013829455,0.00010798695,0.000035474186],"domain_scores_gemma":[0.9995732,0.00009767168,0.000033220884,0.00012971656,0.00014714155,0.0000189772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040788623,0.0013409287,0.0008688106,0.0013371361,0.00045501112,0.001908463,0.002298534,0.0017719453,0.01686337],"category_scores_gemma":[0.0016208406,0.00073086197,0.0011445595,0.0014258858,0.0004064245,0.0022506851,0.00080780254,0.0014225921,0.015836425],"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.00017764245,0.00018465835,0.0010184579,0.0002866095,0.00010680296,0.00017624356,0.000079098325,0.19521724,0.017510641,0.10083993,0.03867371,0.64572906],"study_design_scores_gemma":[0.000010696847,0.00004831189,0.0005312737,0.00004390164,0.000047826514,0.0002329817,0.000018375042,0.9156349,0.009893916,0.039413866,0.034094483,0.000029509773],"about_ca_topic_score_codex":0.003010853,"about_ca_topic_score_gemma":0.0030902633,"teacher_disagreement_score":0.01686337,"about_ca_system_score_codex":0.00050901575,"about_ca_system_score_gemma":0.00046330172,"threshold_uncertainty_score":0.05641359},"labels":[],"label_agreement":null},{"id":"W1594879786","doi":"10.1007/978-3-642-23605-1_14","title":"Modeling and Analyzing Agents’ Collective Options in Collaborative Decision Making","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Group decision-making; Operations research; Management science; Human–computer interaction; Engineering","score_opus":0.05565910376562111,"score_gpt":0.3135785518456265,"score_spread":0.2579194480800054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594879786","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.16667536,0.0009609664,0.8198965,0.00080331264,0.0000649227,0.00005737396,0.00006169515,0.00007361933,0.011406318],"genre_scores_gemma":[0.91118956,0.0004545284,0.08342207,0.000039783616,0.000050767347,0.00012985637,0.000051595394,0.000028729268,0.0046331026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856514,0.0008547139,0.000060813396,0.00017940755,0.00020399496,0.00013591275],"domain_scores_gemma":[0.99046105,0.008506597,0.00039117355,0.0002418046,0.00019944116,0.0001999752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028303028,0.00088148145,0.0011124203,0.00074189075,0.0009167905,0.0027975806,0.0017492531,0.0023152626,0.0027429576],"category_scores_gemma":[0.009644313,0.00078498607,0.001294725,0.0013536143,0.0018376698,0.0044931853,0.0016677737,0.0018417457,0.00022869435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055496625,0.000065695414,0.0010614656,0.000052540545,0.00006354115,0.00010489982,0.0002585091,0.8497389,0.0003442397,0.13611096,0.0003281422,0.011815582],"study_design_scores_gemma":[0.000004243394,0.000011944043,0.00011000698,0.00000584073,0.0000094733905,0.000011969734,0.00004316489,0.92171484,0.00009270401,0.07779023,0.00019777252,0.000007740235],"about_ca_topic_score_codex":0.0048176586,"about_ca_topic_score_gemma":0.00394515,"teacher_disagreement_score":0.0048176586,"about_ca_system_score_codex":0.0011740229,"about_ca_system_score_gemma":0.00095971435,"threshold_uncertainty_score":0.014968216},"labels":[],"label_agreement":null},{"id":"W1594881282","doi":"10.1007/11577935_9","title":"Scaling Down Candidate Sets Based on the Temporal Feature of Items for Improved Hybrid Recommendations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Saskatchewan","funders":"","keywords":"MovieLens; Computer science; Recommender system; Context (archaeology); Scalability; Feature (linguistics); Information overload; The Internet; Data mining; Information retrieval; Scale (ratio); Artificial intelligence; Data science; World Wide Web; Collaborative filtering; Database","score_opus":0.020385847374846135,"score_gpt":0.2658168610156339,"score_spread":0.24543101364078776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594881282","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.13353378,0.0047182287,0.8522383,0.0005413047,0.00082397077,0.00045819918,0.0011208914,0.0020787965,0.0044865315],"genre_scores_gemma":[0.41735756,0.0010939136,0.5710676,0.00029121357,0.0005709912,0.00043844365,0.0021282763,0.00024521974,0.0068068057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717844,0.0007290925,0.00026760902,0.0004975126,0.0011581598,0.00016917643],"domain_scores_gemma":[0.99041045,0.005351823,0.00038789754,0.0014520407,0.00215437,0.00024345149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034025123,0.0015672536,0.003742539,0.0038017696,0.0010580961,0.0020967328,0.00264055,0.002017269,0.005648627],"category_scores_gemma":[0.015010474,0.0011033992,0.002030908,0.0044304007,0.00047044555,0.0028238639,0.001570111,0.0019180031,0.0024520198],"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.0014289789,0.0009778918,0.0069676386,0.0004899677,0.00088605256,0.00025993105,0.00032667458,0.09240169,0.019305948,0.0035262892,0.016372519,0.8570564],"study_design_scores_gemma":[0.00013740236,0.00042131782,0.0042112274,0.00008858166,0.00043448422,0.00034653567,0.00012409562,0.9794388,0.005423297,0.005225591,0.004051567,0.00009720334],"about_ca_topic_score_codex":0.005584282,"about_ca_topic_score_gemma":0.013927976,"teacher_disagreement_score":0.005648627,"about_ca_system_score_codex":0.0005158945,"about_ca_system_score_gemma":0.0010340238,"threshold_uncertainty_score":0.01889652},"labels":[],"label_agreement":null},{"id":"W1594897592","doi":"10.1007/978-3-540-39404-4_26","title":"Administrative Policies to Regulate Quality of Service Management in Distributed Multimedia Applications","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Western University","funders":"","keywords":"Computer science; Flexibility (engineering); Quality of service; Variety (cybernetics); Quality (philosophy); Service (business); Distributed management; Distributed computing; Telecommunications; Business; Artificial intelligence","score_opus":0.03950604118548619,"score_gpt":0.31600142178864893,"score_spread":0.27649538060316275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594897592","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.040852617,0.0021312975,0.91432905,0.003428593,0.0010074192,0.00040802773,0.000124821,0.003725733,0.033992536],"genre_scores_gemma":[0.84076625,0.001325133,0.14132546,0.0017457192,0.001097273,0.0006069164,0.00023531255,0.0006717116,0.012226263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923711,0.002278382,0.00075170473,0.0005768403,0.0031287072,0.000893346],"domain_scores_gemma":[0.9784711,0.010648734,0.0022906433,0.0044744103,0.003191068,0.0009240413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013732559,0.00059186795,0.00083256245,0.0012672528,0.0019969512,0.007021387,0.0031645512,0.0021334116,0.0019665847],"category_scores_gemma":[0.0251438,0.0007527497,0.0005991914,0.001284795,0.0027772645,0.005486019,0.0025129032,0.0047741528,0.0009681397],"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.0002558905,0.00037545108,0.0020883891,0.00017018987,0.000062465144,0.00016315415,0.0010320928,0.030640516,0.009997312,0.82625294,0.012539228,0.11642244],"study_design_scores_gemma":[0.00017800498,0.00018315681,0.0023088993,0.00027233528,0.0001844374,0.00041453587,0.0004187039,0.4823918,0.028924253,0.38297415,0.10159484,0.00015487289],"about_ca_topic_score_codex":0.001447426,"about_ca_topic_score_gemma":0.0015200394,"teacher_disagreement_score":0.013732559,"about_ca_system_score_codex":0.0022058233,"about_ca_system_score_gemma":0.00281995,"threshold_uncertainty_score":0.07262552},"labels":[],"label_agreement":null},{"id":"W1594907937","doi":"10.1007/978-3-540-74823-6_9","title":"The Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc 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":"University of Ottawa","funders":"","keywords":"Timeout; Broadcasting (networking); Computer science; Computer network; Node (physics); Retransmission; Network packet; Engineering","score_opus":0.018059251252865505,"score_gpt":0.27659316954191404,"score_spread":0.25853391828904854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594907937","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.43175235,0.052612014,0.4657101,0.0030250088,0.0022314284,0.00019341988,0.00044818857,0.0005793854,0.043448173],"genre_scores_gemma":[0.95074654,0.010492662,0.028954424,0.000146829,0.00040876569,0.00006296575,0.00011464297,0.00018235354,0.008890691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979668,0.00066591694,0.00006997774,0.0001929262,0.0007972605,0.00030703616],"domain_scores_gemma":[0.962826,0.033418432,0.0007229276,0.00078360806,0.0017714795,0.00047757127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030749796,0.0009422887,0.0013623831,0.0010809463,0.0010224115,0.0015875455,0.0020584047,0.000991734,0.0022981525],"category_scores_gemma":[0.0200628,0.00057545357,0.0004634422,0.0020306702,0.0013996935,0.003508678,0.0010609551,0.00097495975,0.00024256126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001972124,0.0002821043,0.0038392772,0.0009861557,0.00016158304,0.0003421796,0.00047057148,0.69363654,0.015997322,0.1215021,0.0043946835,0.15641536],"study_design_scores_gemma":[0.00014111081,0.0009804133,0.002016766,0.00008718833,0.0003479311,0.00086061563,0.00046809544,0.9083593,0.013463725,0.06575998,0.007448107,0.00006684178],"about_ca_topic_score_codex":0.0034449613,"about_ca_topic_score_gemma":0.0037870405,"teacher_disagreement_score":0.0034449613,"about_ca_system_score_codex":0.0028935804,"about_ca_system_score_gemma":0.0013602602,"threshold_uncertainty_score":0.020994484},"labels":[],"label_agreement":null},{"id":"W1594958309","doi":"10.1007/11581062_20","title":"Binding and Execution of Web Service Compositions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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","funders":"","keywords":"Computer science; Compatibility (geochemistry); Web service; Service composition; Software deployment; Service provider; Formalism (music); Software engineering; Distributed computing; World Wide Web; Service (business); Chemical engineering","score_opus":0.010936594171263853,"score_gpt":0.230308305622378,"score_spread":0.21937171145111414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594958309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03889377,0.0003227409,0.9356734,0.00021181031,0.00011518399,0.0002884895,0.00012786429,0.0073366584,0.017030073],"genre_scores_gemma":[0.3373344,0.0007267802,0.6269437,0.00016516644,0.000070255875,0.0003971981,0.0011407336,0.0022045088,0.031017274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973355,0.0006638217,0.00017469809,0.00025797094,0.0011632902,0.0004047834],"domain_scores_gemma":[0.9979964,0.001022712,0.00008633256,0.00047799404,0.00029490204,0.000121604884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003202538,0.00070304726,0.0010573812,0.0010168105,0.001998475,0.0028985513,0.0024097348,0.0016588096,0.0063784067],"category_scores_gemma":[0.0057632457,0.0016055767,0.0009506738,0.0015069519,0.0020434968,0.0027024213,0.0026045612,0.002035519,0.0026858463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001195317,0.00056255015,0.0019973922,0.00042219253,0.000083783634,0.0008190038,0.0017425969,0.14912575,0.04606059,0.4665656,0.009151809,0.32227352],"study_design_scores_gemma":[0.00011191661,0.000107302,0.0006387915,0.00009262528,0.00007520242,0.00024572428,0.00026717276,0.6222674,0.07876666,0.25828972,0.039061915,0.00007553456],"about_ca_topic_score_codex":0.008519056,"about_ca_topic_score_gemma":0.006999565,"teacher_disagreement_score":0.008519056,"about_ca_system_score_codex":0.0013035142,"about_ca_system_score_gemma":0.0023736807,"threshold_uncertainty_score":0.021337926},"labels":[],"label_agreement":null},{"id":"W1594982746","doi":"10.1007/11532378_15","title":"A Practical MHP Information Analysis for Concurrent Java Programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"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":"Computer science; Java; Variety (cybernetics); Programming language; Range (aeronautics); Distributed computing; Software engineering; Artificial intelligence","score_opus":0.03244970569755555,"score_gpt":0.3090443089362728,"score_spread":0.27659460323871726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594982746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00844816,0.00016809457,0.98013294,0.00029991975,0.000053655338,0.00015443935,0.00036123412,0.0056224097,0.004759039],"genre_scores_gemma":[0.24154745,0.00025064463,0.7477272,0.00024258308,0.00020804434,0.00024433676,0.001108593,0.001235414,0.0074357814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966576,0.0005230417,0.00023279699,0.0004597913,0.0017681024,0.00035861382],"domain_scores_gemma":[0.9955628,0.0019723384,0.0002090112,0.0012865445,0.0008630025,0.000106241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019001467,0.0010870032,0.0011945427,0.0031724686,0.0017207888,0.0031227001,0.0022463342,0.001006135,0.012027663],"category_scores_gemma":[0.01091295,0.00087419734,0.0021262586,0.0025010412,0.0011005156,0.0051429546,0.003336114,0.0023547781,0.0024454577],"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.00077151216,0.00023655269,0.0030325921,0.0004268204,0.00014200169,0.0003259537,0.00041402676,0.03635926,0.022153322,0.15734866,0.0183653,0.7604241],"study_design_scores_gemma":[0.00008632818,0.0001303988,0.0011828705,0.00008242295,0.00012817678,0.0003044114,0.00019871538,0.6610182,0.026941227,0.2947503,0.015101893,0.00007501668],"about_ca_topic_score_codex":0.003484199,"about_ca_topic_score_gemma":0.003679619,"teacher_disagreement_score":0.012027663,"about_ca_system_score_codex":0.0013270077,"about_ca_system_score_gemma":0.0022464488,"threshold_uncertainty_score":0.040236473},"labels":[],"label_agreement":null},{"id":"W1595006955","doi":"10.1007/978-3-540-74472-6_41","title":"Modeling of the Role-Based Access Control Policy with Constraints Using Description Logic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Access control; Computer science; Role-based access control; Object (grammar); Control (management); Discretionary access control; Security policy; Physical access; Object model; Description logic; Distributed computing; Theoretical computer science; Computer security; Artificial intelligence","score_opus":0.05807940181903773,"score_gpt":0.3190782545567271,"score_spread":0.2609988527376894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595006955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008785717,0.0002762228,0.9800252,0.0006260366,0.000057640722,0.00015438614,0.00042198133,0.00066421524,0.008988594],"genre_scores_gemma":[0.41926193,0.0010187525,0.56315994,0.00030133873,0.0000936441,0.00058253366,0.0013741123,0.00029827884,0.013909458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767846,0.0007408807,0.00023929041,0.00033962494,0.00070078747,0.00030101513],"domain_scores_gemma":[0.99757034,0.0013537421,0.00019873514,0.00034743585,0.00038336916,0.0001463038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031058914,0.000801826,0.00082133105,0.0010237157,0.0008359792,0.0057376926,0.0033950584,0.0016809299,0.0056170714],"category_scores_gemma":[0.004653873,0.000894354,0.0017000766,0.0011415135,0.0016324399,0.005155158,0.0016068324,0.0024505195,0.0010377908],"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.00009204494,0.00009878917,0.0004814653,0.00017553159,0.000053852767,0.00031456092,0.00035485995,0.21352552,0.0030193229,0.7604308,0.0019739324,0.0194793],"study_design_scores_gemma":[0.000039227074,0.000021397269,0.00008106711,0.00004795744,0.000049812475,0.00009922212,0.00005262325,0.8183505,0.0025163288,0.16761908,0.011097059,0.000025710195],"about_ca_topic_score_codex":0.014052946,"about_ca_topic_score_gemma":0.009044176,"teacher_disagreement_score":0.014052946,"about_ca_system_score_codex":0.0027551043,"about_ca_system_score_gemma":0.0034895756,"threshold_uncertainty_score":0.0279423},"labels":[],"label_agreement":null},{"id":"W1595035399","doi":"10.1007/11863649_1","title":"Automated Social Network Analysis for Collaborative Work","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Collaborative software; Work (physics); Computer-supported cooperative work; Human–computer interaction; Social network analysis; Software; World Wide Web; Social network (sociolinguistics); Collaborative network; Data science; Software engineering; Knowledge management; Engineering; Social media","score_opus":0.012876603803281652,"score_gpt":0.26792996552671655,"score_spread":0.2550533617234349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595035399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014473184,0.00045470695,0.9774265,0.00025053084,0.00005344731,0.00018910084,0.001504942,0.0029968773,0.0026505669],"genre_scores_gemma":[0.2622248,0.00045236672,0.72449404,0.00005220434,0.00013863869,0.00044838004,0.0051516616,0.00034707834,0.0066908887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802965,0.00074488536,0.00010465724,0.00046658787,0.0005235668,0.00013051275],"domain_scores_gemma":[0.9956976,0.0025414315,0.0002582591,0.0009071995,0.0004840495,0.00011141843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00129585,0.00115516,0.0012447111,0.003956369,0.0015802303,0.001910426,0.0019118821,0.001211551,0.006830794],"category_scores_gemma":[0.008265932,0.0005612821,0.0016082298,0.0027383598,0.000723678,0.0032929168,0.0021345853,0.0014006278,0.0032904092],"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.0002476956,0.0004780752,0.006606854,0.0004708337,0.00026366074,0.00021361654,0.00051221915,0.1248692,0.008547178,0.06592794,0.024524268,0.76733845],"study_design_scores_gemma":[0.000012112552,0.000020184401,0.00129778,0.000021498317,0.000024234358,0.00006615251,0.00011442311,0.9227537,0.0021725323,0.06938718,0.0041151764,0.000015049895],"about_ca_topic_score_codex":0.006492937,"about_ca_topic_score_gemma":0.008885197,"teacher_disagreement_score":0.006830794,"about_ca_system_score_codex":0.0009703694,"about_ca_system_score_gemma":0.0013846628,"threshold_uncertainty_score":0.022851229},"labels":[],"label_agreement":null},{"id":"W1595054451","doi":"10.1007/978-3-642-04146-4_58","title":"A New Large Urdu Database for Off-Line Handwriting Recognition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":60,"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":"Urdu; Computer science; Handwriting; Numeral system; Artificial intelligence; Handwriting recognition; Pattern recognition (psychology); Character recognition; Arabic; Speech recognition; Feature extraction; Natural language processing; Image (mathematics); Linguistics","score_opus":0.03112518242818602,"score_gpt":0.2809702338494022,"score_spread":0.24984505142121616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595054451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11508772,0.009828082,0.49916312,0.0007092423,0.0019315054,0.002385787,0.15046692,0.17701481,0.0434128],"genre_scores_gemma":[0.1760602,0.003218942,0.43507558,0.00069937704,0.000358003,0.0016996774,0.33072707,0.0055071707,0.046653993],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910873,0.00007969068,0.00012602675,0.00020010021,0.00042109596,0.00006425329],"domain_scores_gemma":[0.99826884,0.00012666646,0.000062720894,0.0005958834,0.00083488965,0.000110978246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585209,0.0012859551,0.0017106468,0.0026650552,0.00064338534,0.0012234463,0.0022992657,0.00069533783,0.022076987],"category_scores_gemma":[0.0019025374,0.00050132954,0.00049455656,0.002835404,0.00016515046,0.0022762094,0.0013493727,0.0006181912,0.020211974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001250071,0.0004293629,0.0013322161,0.0005551967,0.000053211497,0.00039452157,0.000081766106,0.0018154546,0.041713376,0.00085725944,0.14610742,0.80541],"study_design_scores_gemma":[0.0005702706,0.0011873689,0.017494375,0.0003432944,0.00034572056,0.0030921302,0.0003583754,0.14265075,0.28594732,0.0045361584,0.5431609,0.0003132674],"about_ca_topic_score_codex":0.0036323315,"about_ca_topic_score_gemma":0.005523379,"teacher_disagreement_score":0.022076987,"about_ca_system_score_codex":0.00039200662,"about_ca_system_score_gemma":0.0007814357,"threshold_uncertainty_score":0.07385492},"labels":[],"label_agreement":null},{"id":"W1595266361","doi":"10.1007/978-3-540-30564-4_20","title":"Product Construction of Key Distribution Schemes for Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Resilience (materials science); Key (lock); Distributed computing; Scheme (mathematics); Key distribution in wireless sensor networks; Computer network; Wireless; Topology (electrical circuits); Wireless network; Computer security; Telecommunications; Mathematics","score_opus":0.012087056394414063,"score_gpt":0.2311671063067042,"score_spread":0.21908004991229013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595266361","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.023325019,0.00050739653,0.9675724,0.00035986508,0.00009728693,0.0001353247,0.00016773597,0.0004194909,0.007415479],"genre_scores_gemma":[0.48119092,0.00113844,0.49574357,0.00025731666,0.00023423227,0.0005448352,0.000974319,0.0004164685,0.019499943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731004,0.0009602718,0.00018735367,0.0003980529,0.0008698583,0.00027439144],"domain_scores_gemma":[0.99475116,0.002454666,0.00028710326,0.0017730437,0.0005366039,0.0001974284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029305278,0.00094847626,0.0012688973,0.000821789,0.00087013317,0.002080244,0.0016836774,0.0010114821,0.0055145775],"category_scores_gemma":[0.005584806,0.0009126163,0.0011591221,0.0016891033,0.001700262,0.0061978134,0.0040955506,0.0027108209,0.0015583824],"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.00048477532,0.00012976684,0.00036894964,0.00028978166,0.00006438091,0.00009365321,0.00029922722,0.0241682,0.00905931,0.8410239,0.00807402,0.11594405],"study_design_scores_gemma":[0.000108765205,0.00028821494,0.00024128245,0.000057359528,0.00006262877,0.0004083204,0.00005936867,0.14852728,0.01595694,0.81637937,0.017862037,0.000048432288],"about_ca_topic_score_codex":0.00018505627,"about_ca_topic_score_gemma":0.00019346904,"teacher_disagreement_score":0.0055145775,"about_ca_system_score_codex":0.0010388483,"about_ca_system_score_gemma":0.0011128273,"threshold_uncertainty_score":0.018448174},"labels":[],"label_agreement":null},{"id":"W1595275443","doi":"10.1007/11780519_18","title":"An Online POMDP Algorithm Used by the PoliceForce Agents in the RoboCupRescue Simulation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Université Laval","funders":"","keywords":"Partially observable Markov decision process; Computer science; Action (physics); Algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Markov chain; Markov model; Mathematics","score_opus":0.02001175732201941,"score_gpt":0.256155839688626,"score_spread":0.23614408236660658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595275443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024955248,0.00010157993,0.9601844,0.0002102945,0.000118726464,0.00014463175,0.00015529808,0.001259131,0.012870601],"genre_scores_gemma":[0.5106756,0.00011329226,0.48334268,0.00007630945,0.000021414775,0.00032105303,0.00024688625,0.00018124678,0.0050213747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997589,0.000074603326,0.000012126944,0.000051767965,0.000054767992,0.000047736434],"domain_scores_gemma":[0.9996737,0.00016121185,0.000017647673,0.000045814766,0.00006848642,0.000033109154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053336,0.0007017797,0.0010000636,0.00035077083,0.0010187615,0.00086059107,0.0012693384,0.0010468588,0.005437986],"category_scores_gemma":[0.0013231252,0.0004436099,0.00056640315,0.00035112363,0.00053516496,0.0007411403,0.0012148671,0.0009634812,0.00056788424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009919539,0.000050474326,0.00022106156,0.000039686463,0.00001825371,0.000058392714,0.000043435677,0.9521343,0.0007548162,0.01720273,0.0010239985,0.028353564],"study_design_scores_gemma":[0.000023779401,0.000013378502,0.000021376809,0.0000040134055,0.000004000894,0.00000552461,0.0000065123004,0.99620074,0.00037168746,0.0027294802,0.0006161452,0.000003365006],"about_ca_topic_score_codex":0.012721282,"about_ca_topic_score_gemma":0.014255817,"teacher_disagreement_score":0.012721282,"about_ca_system_score_codex":0.00078946,"about_ca_system_score_gemma":0.0017519847,"threshold_uncertainty_score":0.025294423},"labels":[],"label_agreement":null},{"id":"W1595285848","doi":"10.1007/11674399_2","title":"Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversary; Computer science; Predictability; Exploit; Perfect information; Game tree; Imperfect; Tree (set theory); Adaptation (eye); Evaluation function; Strengths and weaknesses; Function (biology); Game theory; Sequential game; Theoretical computer science; Artificial intelligence; Mathematical economics; Computer security; Mathematics","score_opus":0.02015158814965948,"score_gpt":0.2538248566446211,"score_spread":0.23367326849496164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595285848","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.06575914,0.00082856254,0.9203934,0.000803294,0.000109636174,0.00014744188,0.00012831515,0.00032523155,0.011504987],"genre_scores_gemma":[0.8932854,0.00061445235,0.09580708,0.00028404524,0.000120770455,0.0003131363,0.00017480069,0.00014200088,0.009258234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811965,0.0012190563,0.00006338156,0.00019175657,0.00019601865,0.00021011328],"domain_scores_gemma":[0.9881231,0.0104867285,0.0003686802,0.00035449982,0.00032563138,0.00034139075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034272107,0.0010401575,0.0032667073,0.0008291008,0.0007271462,0.0015179174,0.0026873949,0.002739037,0.004050418],"category_scores_gemma":[0.019307887,0.0008751195,0.0010407126,0.001497103,0.002038983,0.0034582447,0.0021615534,0.0026883625,0.0005395241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015549427,0.00008831124,0.00035286412,0.00010934339,0.000066368644,0.000077079705,0.00010311788,0.85307676,0.00033108646,0.12886338,0.0025390692,0.014237177],"study_design_scores_gemma":[0.000024022267,0.000018694096,0.00004215231,0.000005997159,0.0000067559117,0.000011415206,0.0000061840487,0.9460487,0.00003517094,0.05360995,0.00018545265,0.000005456254],"about_ca_topic_score_codex":0.0045179264,"about_ca_topic_score_gemma":0.003808293,"teacher_disagreement_score":0.0045179264,"about_ca_system_score_codex":0.0014314811,"about_ca_system_score_gemma":0.0016543934,"threshold_uncertainty_score":0.018124998},"labels":[],"label_agreement":null},{"id":"W1595337508","doi":"10.1007/3-540-45813-1_46","title":"Properties of Weak Conditional Independence","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Conditional independence; Dependency (UML); Independence (probability theory); Bayesian network; Computer science; Consistency (knowledge bases); Conditional probability; Bayesian probability; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.037038493546760816,"score_gpt":0.23647192227201175,"score_spread":0.19943342872525094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595337508","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.04919607,0.0015032985,0.8423571,0.002373601,0.00028231184,0.00009006137,0.0008437515,0.00035894473,0.10299486],"genre_scores_gemma":[0.8286749,0.002795483,0.13002965,0.0016552866,0.0020384544,0.00070400577,0.0019040897,0.00065122684,0.03154689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968436,0.0010384256,0.0002567613,0.0006088699,0.0010337895,0.0002185457],"domain_scores_gemma":[0.97236425,0.020267151,0.0013999166,0.002935115,0.0021696086,0.00086402363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043956344,0.0008708843,0.0015557699,0.0029200008,0.0024077434,0.0039981813,0.0018689744,0.0015362706,0.009109947],"category_scores_gemma":[0.032784734,0.0013938302,0.0019053719,0.0037368739,0.0039268485,0.009896363,0.0035175502,0.005918272,0.001743358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027339862,0.0000114661,0.00021427678,0.000030141007,0.000013078524,0.000038647268,0.00012483334,0.00090092403,0.00022977496,0.9912894,0.0013034415,0.005816778],"study_design_scores_gemma":[0.000005142778,0.0000041929243,0.00009687981,0.0000060969696,0.000008480164,0.00006681912,0.000011543013,0.0051671895,0.00011993939,0.99348336,0.0010246425,0.000005711738],"about_ca_topic_score_codex":0.00072957284,"about_ca_topic_score_gemma":0.00051587063,"teacher_disagreement_score":0.009109947,"about_ca_system_score_codex":0.0009269892,"about_ca_system_score_gemma":0.00086113403,"threshold_uncertainty_score":0.030475795},"labels":[],"label_agreement":null},{"id":"W1595423374","doi":"10.1007/978-3-642-41347-6_6","title":"Providing Awareness, Understanding and Control of Personalized Stream Filtering in a P2P Social Network","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Control (management); Computer science; Social network (sociolinguistics); Internet privacy; Psychology; World Wide Web; Artificial intelligence; Social media","score_opus":0.040055138569488564,"score_gpt":0.2595635334204604,"score_spread":0.21950839485097184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595423374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106336705,0.00041807315,0.8821946,0.001221773,0.000050650546,0.00008399762,0.00010420955,0.0013906352,0.008199385],"genre_scores_gemma":[0.9192716,0.00031115668,0.077604584,0.000092555936,0.00005626708,0.000047952493,0.00013383703,0.000077450284,0.0024045906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918014,0.00026602295,0.00004427534,0.00024850754,0.00018982145,0.00007113289],"domain_scores_gemma":[0.99528766,0.0032507346,0.00032814976,0.00061042985,0.000347331,0.00017569284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015465145,0.00053417834,0.00052060856,0.00039972187,0.0005375514,0.0025519961,0.0008611497,0.0012226833,0.0014607267],"category_scores_gemma":[0.010733305,0.00055441726,0.00030959467,0.00056204334,0.00063357153,0.005406502,0.0017329769,0.0018110028,0.000333186],"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.00082130625,0.0009318679,0.021873018,0.00046197244,0.00025103198,0.00088862923,0.0066590332,0.13842742,0.078402855,0.1506291,0.012006653,0.5886471],"study_design_scores_gemma":[0.000020661202,0.000082291444,0.002814574,0.00002090824,0.00005748201,0.00016666618,0.00044683818,0.8939983,0.0104089705,0.08744229,0.004505754,0.000035218025],"about_ca_topic_score_codex":0.0034893383,"about_ca_topic_score_gemma":0.002528558,"teacher_disagreement_score":0.0034893383,"about_ca_system_score_codex":0.0004892794,"about_ca_system_score_gemma":0.0007656745,"threshold_uncertainty_score":0.00817889},"labels":[],"label_agreement":null},{"id":"W1595456792","doi":"10.1007/11823285_103","title":"A Client-Server Approach to Enhance Interactive Virtual Environments on Mobile Devices over Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Ottawa","funders":"","keywords":"Computer science; Rendering (computer graphics); Mobile device; Thin client; Wireless ad hoc network; Bandwidth (computing); Mobile computing; Computer graphics; Wireless; Computer network; Computer graphics (images); Operating system","score_opus":0.008184851168654948,"score_gpt":0.26081283608766254,"score_spread":0.25262798491900756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595456792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021066178,0.0002055844,0.9598103,0.00010213647,0.00013127021,0.00016797308,0.000069933296,0.010103043,0.008343545],"genre_scores_gemma":[0.3489839,0.00042152914,0.5990921,0.00018461289,0.00012806775,0.00035375668,0.00038676916,0.0022782185,0.048170984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00009677858,0.000022982413,0.00005281689,0.00026319793,0.00005317553],"domain_scores_gemma":[0.9993137,0.0001777986,0.000017697568,0.00014814544,0.00023602678,0.00010663812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189043,0.0009380718,0.0006645562,0.00045784502,0.0007368276,0.0012436286,0.002308064,0.0008596027,0.010119477],"category_scores_gemma":[0.0011820304,0.00049896946,0.0003723137,0.0004973919,0.0003624489,0.0016868092,0.0017013712,0.0010945685,0.002641639],"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.0011993619,0.001057989,0.0009057485,0.000466903,0.00017339025,0.0010074704,0.0010458427,0.051273584,0.31190267,0.027911073,0.033923227,0.5691327],"study_design_scores_gemma":[0.00013715471,0.00038355181,0.0008311309,0.000040602597,0.00013901292,0.00084540126,0.00026011313,0.81045955,0.11848338,0.0125532225,0.055758648,0.00010828526],"about_ca_topic_score_codex":0.0013674969,"about_ca_topic_score_gemma":0.0026345693,"teacher_disagreement_score":0.010119477,"about_ca_system_score_codex":0.0003658679,"about_ca_system_score_gemma":0.00042771603,"threshold_uncertainty_score":0.033852994},"labels":[],"label_agreement":null},{"id":"W1595500906","doi":"10.1007/11880592_5","title":"A Supervised Learning Approach to Entity Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Key (lock); Baseline (sea); Artificial intelligence; Search engine; Supervised learning; Machine learning; Web search query; Data mining; Artificial neural network","score_opus":0.024429425519479422,"score_gpt":0.2428645211463592,"score_spread":0.2184350956268798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595500906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029904493,0.00042261914,0.99304634,0.00021721379,0.00005032786,0.000064324355,0.00045324332,0.0012745475,0.0014808407],"genre_scores_gemma":[0.08657357,0.0006573657,0.8991507,0.00025019483,0.00021426764,0.00022401796,0.0033089796,0.00030405456,0.009316829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980787,0.000633231,0.00016189663,0.00047507414,0.000559941,0.00009113054],"domain_scores_gemma":[0.99611425,0.0020873554,0.00017184671,0.00090059446,0.0006323214,0.00009368662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020969103,0.0007410284,0.001430658,0.0029277217,0.001321118,0.0016876712,0.0037030599,0.0016353194,0.0047100107],"category_scores_gemma":[0.006794982,0.00065031805,0.0013120407,0.004632846,0.0009220154,0.004496584,0.002179399,0.0020822424,0.0023859208],"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.00020168832,0.00048898015,0.0019957647,0.0002833913,0.00022459656,0.00019323711,0.00023201037,0.09615974,0.003631642,0.08912649,0.04111355,0.7663489],"study_design_scores_gemma":[0.000021439615,0.000034245186,0.00039210866,0.000023398197,0.000045363995,0.00014948014,0.000048643546,0.8878868,0.0020496014,0.101158015,0.008169504,0.00002137765],"about_ca_topic_score_codex":0.006330049,"about_ca_topic_score_gemma":0.014165759,"teacher_disagreement_score":0.006330049,"about_ca_system_score_codex":0.00087472977,"about_ca_system_score_gemma":0.0015669999,"threshold_uncertainty_score":0.015756607},"labels":[],"label_agreement":null},{"id":"W1595525475","doi":"10.1007/978-3-642-10631-6_97","title":"Lower Bounds on Fast Searching","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Computer science; Time complexity; Graph; Combinatorics; Quadratic equation; Jump; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.01611362933346579,"score_gpt":0.2583661912551287,"score_spread":0.24225256192166292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595525475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028373023,0.02144092,0.6093898,0.010694816,0.0025987425,0.00034801094,0.0032178613,0.004604497,0.31933242],"genre_scores_gemma":[0.44219145,0.024278652,0.3156098,0.005616356,0.008035413,0.002586054,0.0067551383,0.008731334,0.18619578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98756963,0.0020638665,0.00052406464,0.0018771497,0.005293812,0.0026713894],"domain_scores_gemma":[0.9336351,0.04856205,0.0015798927,0.0108937975,0.0032444126,0.0020847297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006233899,0.0057335594,0.006411007,0.008129491,0.0048603043,0.010588761,0.012691612,0.005427193,0.05678498],"category_scores_gemma":[0.055390496,0.0029931762,0.003686928,0.014606518,0.007695243,0.028343685,0.012313224,0.017170375,0.012938169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090938964,0.00025004186,0.0005155132,0.0009029204,0.000102379236,0.00009084053,0.00033918352,0.032897566,0.0020298841,0.7868465,0.058326814,0.116788924],"study_design_scores_gemma":[0.00009229937,0.000066001776,0.00026393056,0.00018715159,0.00011327321,0.00015618932,0.00006935348,0.074237615,0.0012393233,0.9091506,0.014371461,0.00005282005],"about_ca_topic_score_codex":0.0041291513,"about_ca_topic_score_gemma":0.004721969,"teacher_disagreement_score":0.05678498,"about_ca_system_score_codex":0.007873871,"about_ca_system_score_gemma":0.0053948793,"threshold_uncertainty_score":0.18996471},"labels":[],"label_agreement":null},{"id":"W1595627082","doi":"10.1007/978-3-642-02982-0_26","title":"Efficient Evaluation of Static and Dynamic Optimal Route Queries","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph; Shortest path problem; Dynamic problem; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Algorithm; Path (computing); Dynamic programming; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.01677437801556516,"score_gpt":0.2665094323699007,"score_spread":0.24973505435433555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595627082","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.2813674,0.003487812,0.66507214,0.0008246684,0.0003438449,0.00042731874,0.0018007492,0.020880492,0.025795583],"genre_scores_gemma":[0.76588196,0.00048195128,0.22231361,0.00012318851,0.0001284726,0.00011762109,0.0022870712,0.0011316938,0.007534412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543446,0.0008657705,0.0002491698,0.000527062,0.0023045018,0.00061900035],"domain_scores_gemma":[0.99461055,0.003101874,0.00020027939,0.0008627092,0.0010102795,0.00021436144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020378209,0.001241474,0.0021767386,0.0013710303,0.0008219449,0.0035562092,0.0026454583,0.0011139442,0.008590837],"category_scores_gemma":[0.009171225,0.00065832713,0.00066938874,0.002019015,0.00085486105,0.0037836367,0.0018120274,0.0008136236,0.0016839163],"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.0057963687,0.00048151318,0.005336454,0.0005632228,0.0001945786,0.0003464775,0.00038220335,0.21716966,0.037496034,0.029821392,0.029054323,0.6733577],"study_design_scores_gemma":[0.00014442347,0.00015527791,0.0009787752,0.000013834847,0.000053204094,0.00013362287,0.00014555869,0.972705,0.012829644,0.0097054215,0.00311059,0.000024718734],"about_ca_topic_score_codex":0.00889954,"about_ca_topic_score_gemma":0.011370973,"teacher_disagreement_score":0.00889954,"about_ca_system_score_codex":0.0023133624,"about_ca_system_score_gemma":0.002380966,"threshold_uncertainty_score":0.028739274},"labels":[],"label_agreement":null},{"id":"W1595646723","doi":"10.1007/978-3-642-13025-0_46","title":"The Combination of a Causal and Emotional Learning Mechanism for an Improved Cognitive Tutoring Agent","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université du Québec à Montréal","funders":"","keywords":"Mechanism (biology); Computer science; Cognition; Intervention (counseling); Artificial intelligence; Human–computer interaction; Machine learning; Psychology","score_opus":0.02229955982514014,"score_gpt":0.25968203680954316,"score_spread":0.237382476984403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595646723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04954797,0.00026078362,0.9292758,0.00094635313,0.00028439166,0.00015119507,0.000047900197,0.0030638708,0.016421776],"genre_scores_gemma":[0.740202,0.00014385264,0.2516876,0.0002533856,0.00015360993,0.0001317342,0.00005651452,0.00008579976,0.007285496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999423,0.0001629744,0.000051108265,0.00012828292,0.00017974518,0.000054819662],"domain_scores_gemma":[0.9979844,0.0008784251,0.00016758642,0.00033030217,0.00044921006,0.00018997892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014203272,0.00046735545,0.0004237377,0.00046472176,0.0004315698,0.0013132473,0.0018155592,0.0013634325,0.006532766],"category_scores_gemma":[0.006030366,0.00031840426,0.00037196954,0.00022630444,0.00056058733,0.0021918975,0.0013420761,0.0012216961,0.0010426607],"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.00075352576,0.001178218,0.0028606749,0.0004332062,0.00024061391,0.0004987405,0.00076053117,0.10332378,0.079963125,0.18803589,0.0062299324,0.61572176],"study_design_scores_gemma":[0.00018063064,0.0004233208,0.001295096,0.00003465354,0.0002445534,0.000397391,0.000061325976,0.8936769,0.02880632,0.061827853,0.012981626,0.000070290196],"about_ca_topic_score_codex":0.0005282774,"about_ca_topic_score_gemma":0.00068183715,"teacher_disagreement_score":0.006532766,"about_ca_system_score_codex":0.00040142974,"about_ca_system_score_gemma":0.0005317656,"threshold_uncertainty_score":0.021854281},"labels":[],"label_agreement":null},{"id":"W1595683926","doi":"10.1007/978-3-540-30126-4_39","title":"A New Gabor Filter Based Kernel for Texture Classification with SVM","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Computer science; Kernel (algebra); Support vector machine; Radial basis function kernel; Gabor filter; Polynomial kernel; Texture (cosmology); Filter (signal processing); Kernel method; Feature extraction; Computer vision; Mathematics; Image (mathematics)","score_opus":0.02332239862753438,"score_gpt":0.2564754688296641,"score_spread":0.23315307020212972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595683926","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.004813963,0.00031078982,0.9930146,0.00004658192,0.00011510087,0.000027161952,0.000060001763,0.001007573,0.0006042567],"genre_scores_gemma":[0.12016634,0.00048627765,0.87173325,0.0001081068,0.00014980257,0.00011399747,0.0005406853,0.00031764628,0.006383964],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901474,0.000141604,0.000076168486,0.00016201338,0.0005334822,0.000071864495],"domain_scores_gemma":[0.9989318,0.0002391769,0.00007548289,0.0001833359,0.00050822925,0.00006190127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076964963,0.0006043464,0.0013121626,0.0008329457,0.00032105463,0.0011165242,0.0013125226,0.00086852006,0.0029722927],"category_scores_gemma":[0.0019471658,0.0004143343,0.0009072549,0.0012958267,0.00032134433,0.001614919,0.0010335393,0.0012526988,0.0024965557],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040039181,0.00022373651,0.0007638042,0.0002343661,0.00013669711,0.00007258676,0.00004358743,0.023864297,0.08842494,0.0080481805,0.008027756,0.8697596],"study_design_scores_gemma":[0.000027305587,0.00012079372,0.0013092771,0.000018590026,0.00006124096,0.00023114699,0.000016465689,0.9560621,0.028122777,0.003689742,0.010303405,0.000037253434],"about_ca_topic_score_codex":0.0012825785,"about_ca_topic_score_gemma":0.0013660787,"teacher_disagreement_score":0.0029722927,"about_ca_system_score_codex":0.00040551965,"about_ca_system_score_gemma":0.0005208299,"threshold_uncertainty_score":0.009943366},"labels":[],"label_agreement":null},{"id":"W1595702613","doi":"10.1007/978-3-540-77115-9_20","title":"A Multiple Tree Approach for Fault Tolerance in MPLS Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"Concordia University","funders":"","keywords":"Computer network; Fault tolerance; Computer science; Multiprotocol Label Switching; Multicast; Distributed computing; Network packet; Disjoint sets; Tree (set theory); Node (physics); Quality of service; Engineering; Mathematics","score_opus":0.019453435807994187,"score_gpt":0.2379145142129217,"score_spread":0.2184610784049275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595702613","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.0075603193,0.0011130205,0.98621434,0.0002454166,0.00015956927,0.00003242959,0.0000425403,0.00048546586,0.004146848],"genre_scores_gemma":[0.2803451,0.0022061104,0.7029993,0.00024102704,0.00026683716,0.00010939973,0.00016022426,0.0002184518,0.0134535115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969554,0.000059474736,0.000014009445,0.00003945436,0.000159505,0.000031986816],"domain_scores_gemma":[0.9996798,0.00011435682,0.000024040797,0.00007135502,0.000088366076,0.000021958203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133669,0.00036263224,0.00060171343,0.0005974717,0.00067848753,0.00077119103,0.0013415094,0.0008448416,0.0041456018],"category_scores_gemma":[0.0009580521,0.00022980955,0.00041371697,0.00097470154,0.00035568676,0.0014010238,0.0007514542,0.0009904645,0.00066297915],"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.00016575646,0.00012219958,0.00019770268,0.00035391518,0.000069582355,0.00019096963,0.00016230305,0.27275476,0.032211073,0.1748228,0.00962682,0.50932217],"study_design_scores_gemma":[0.000017494844,0.00010707564,0.0001145164,0.000034514585,0.000032392298,0.00019225977,0.000031400665,0.8610642,0.0075866664,0.116475485,0.014320941,0.000023077035],"about_ca_topic_score_codex":0.0006982317,"about_ca_topic_score_gemma":0.0014509457,"teacher_disagreement_score":0.0041456018,"about_ca_system_score_codex":0.00055134005,"about_ca_system_score_gemma":0.00035712958,"threshold_uncertainty_score":0.0138683915},"labels":[],"label_agreement":null},{"id":"W1595723506","doi":"10.1007/3-540-37620-8_25","title":"A Contribution to the Theory and Practice of Cognitive Prostheses","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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":"University of Saskatchewan","funders":"","keywords":"Computer science; Perspective (graphical); General partnership; Human–computer interaction; Cognitive science; Cognition; Artificial intelligence; Data science; Psychology","score_opus":0.015915036301392824,"score_gpt":0.2573008494705452,"score_spread":0.2413858131691524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595723506","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.0054703425,0.090939336,0.6102411,0.02694591,0.0059651653,0.00007971227,0.00022524902,0.0005492295,0.25958404],"genre_scores_gemma":[0.25283772,0.12420555,0.47603092,0.00785251,0.009317852,0.00037113077,0.00032408937,0.0003366816,0.12872368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999037,0.00026435123,0.00007067267,0.00017178546,0.0003891723,0.00006701813],"domain_scores_gemma":[0.9971733,0.002081698,0.00008438946,0.00029446388,0.00027767968,0.0000884345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010608834,0.00089444645,0.0006268128,0.0014106286,0.0012651447,0.0042720092,0.0024588678,0.0040231906,0.014127454],"category_scores_gemma":[0.0048800167,0.0005204143,0.0007519636,0.0012303308,0.005706654,0.0065247826,0.002848005,0.003053951,0.0034236654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019870544,0.0000471563,0.00018103168,0.00041469085,0.000014721399,0.00013632173,0.00073391426,0.0017918053,0.00045325307,0.86696684,0.014299755,0.11494064],"study_design_scores_gemma":[0.000007711173,0.000024730785,0.00016703417,0.00020815294,0.000009627281,0.00035902343,0.0001740258,0.003559118,0.00035944753,0.82419384,0.1709167,0.000020565636],"about_ca_topic_score_codex":0.0014782386,"about_ca_topic_score_gemma":0.0021146536,"teacher_disagreement_score":0.014127454,"about_ca_system_score_codex":0.0008707643,"about_ca_system_score_gemma":0.0014311397,"threshold_uncertainty_score":0.04726106},"labels":[],"label_agreement":null},{"id":"W1595781181","doi":"10.1007/978-3-642-02818-2_21","title":"Script InSight: Using Models to Explore JavaScript Code from the Browser View","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 British Columbia","funders":"","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Java; Rich Internet application; Tracing; World Wide Web; Scripting language; Context (archaeology); Programming language; Web application; Source code; Code (set theory); Software engineering","score_opus":0.11687458812616955,"score_gpt":0.2886179972318393,"score_spread":0.17174340910566974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595781181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009729181,0.00023644482,0.9309135,0.00032786606,0.000068552006,0.00008145529,0.000793206,0.0386804,0.019169329],"genre_scores_gemma":[0.21877813,0.0010502021,0.7277928,0.0003110496,0.00004932322,0.00037717077,0.0029038158,0.02280953,0.025928011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999816,0.000042829277,0.0000103162965,0.000038683324,0.000069448004,0.00002270255],"domain_scores_gemma":[0.9991848,0.00047395518,0.000032564556,0.00015112625,0.000073493284,0.00008415486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003746647,0.0011151136,0.00047606617,0.000837714,0.0005204235,0.002653515,0.0015664353,0.001108057,0.022343643],"category_scores_gemma":[0.0025525896,0.00089910027,0.001145198,0.00055072864,0.00082892703,0.00489784,0.001901663,0.0019792242,0.004929097],"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.0009847726,0.00030538594,0.0034758954,0.0010457364,0.00011429109,0.0012836448,0.0060724844,0.062246185,0.06056334,0.33315882,0.09316071,0.43758875],"study_design_scores_gemma":[0.00015055483,0.00012735561,0.0008832049,0.00035158833,0.00008279012,0.0006842158,0.00056584174,0.5284106,0.02798321,0.2396735,0.20095965,0.00012743629],"about_ca_topic_score_codex":0.0023535285,"about_ca_topic_score_gemma":0.0040800017,"teacher_disagreement_score":0.022343643,"about_ca_system_score_codex":0.00048876664,"about_ca_system_score_gemma":0.0005999108,"threshold_uncertainty_score":0.07474691},"labels":[],"label_agreement":null},{"id":"W1595825122","doi":"10.1007/978-3-540-73210-5_18","title":"Verification of Probabilistic Properties in HOL Using the Cumulative Distribution Function","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"HOL; Probabilistic logic; Computer science; Random variable; Automated theorem proving; Theoretical computer science; Cumulative distribution function; Complement (music); Variable (mathematics); Probabilistic analysis of algorithms; Function (biology); Algorithm; Probability density function; Mathematics; Programming language; Artificial intelligence; Statistics","score_opus":0.08845228833344676,"score_gpt":0.3074550213640024,"score_spread":0.21900273303055562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595825122","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.008870086,0.000047689453,0.98808926,0.000057013913,0.000025806736,0.000028908458,0.000038556725,0.0016697698,0.0011730301],"genre_scores_gemma":[0.7782592,0.00023552049,0.2169844,0.000118019685,0.00009542798,0.00015481042,0.00021011913,0.00091638864,0.0030259492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955831,0.001211793,0.0003007837,0.0006755977,0.0017297618,0.0004989173],"domain_scores_gemma":[0.9825303,0.012694572,0.0009343534,0.0025658505,0.0011179626,0.00015702388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048586186,0.000984263,0.0013135661,0.001438321,0.00094486616,0.0027751524,0.0018723041,0.00097137527,0.0036312754],"category_scores_gemma":[0.01466626,0.0007333296,0.002132772,0.00087595836,0.0033172038,0.0045759664,0.002417135,0.0021188608,0.0007371356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054185576,0.00016606555,0.0023489525,0.0005345559,0.00017392289,0.0006564479,0.0003961233,0.23394446,0.022937832,0.60355735,0.0022825405,0.1324599],"study_design_scores_gemma":[0.00008149832,0.00008618033,0.00042559282,0.000056797355,0.00007009606,0.00023834534,0.000034386117,0.6782641,0.036826354,0.28087696,0.0029853506,0.00005445286],"about_ca_topic_score_codex":0.0015500741,"about_ca_topic_score_gemma":0.0014358965,"teacher_disagreement_score":0.0048586186,"about_ca_system_score_codex":0.001567441,"about_ca_system_score_gemma":0.002027038,"threshold_uncertainty_score":0.025695086},"labels":[],"label_agreement":null},{"id":"W1595833556","doi":"10.1007/978-3-540-71605-1_21","title":"Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Pareto principle; Artificial intelligence; Computer science; Coevolution; Machine learning; Genetic programming; Random subspace method; Multi-objective optimization; Binary classification; Scheme (mathematics); Mathematical optimization; Support vector machine; Mathematics","score_opus":0.04805478791578602,"score_gpt":0.27049104154648856,"score_spread":0.22243625363070255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595833556","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.031241061,0.00031337602,0.9615916,0.00035018785,0.000036208545,0.00010522581,0.000029535759,0.00034872448,0.005983988],"genre_scores_gemma":[0.35887462,0.0003695671,0.6336124,0.00040358127,0.000083409,0.00040994515,0.0001808279,0.00021341875,0.005852232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885786,0.00040640816,0.000065583255,0.00014243199,0.00040531298,0.00012237349],"domain_scores_gemma":[0.99725085,0.0019179212,0.000089655754,0.00025372405,0.00043283205,0.000055059074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024755665,0.0010047901,0.001902292,0.0012799943,0.00075290824,0.0016214355,0.0024053745,0.002541608,0.0035222315],"category_scores_gemma":[0.009453095,0.0008661481,0.001055998,0.0015974445,0.0011123986,0.0022793293,0.0020697953,0.002134243,0.0009036198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010686845,0.0001577118,0.0010844124,0.000103481325,0.000103712904,0.000108405824,0.00013953062,0.6349695,0.0040460886,0.025779417,0.0023239518,0.3310769],"study_design_scores_gemma":[0.000011457868,0.000017838956,0.00008295542,0.000008351205,0.00001273963,0.000027727236,0.000010346643,0.9925029,0.00042183255,0.006623725,0.0002765215,0.0000035092803],"about_ca_topic_score_codex":0.0029859988,"about_ca_topic_score_gemma":0.0030193024,"teacher_disagreement_score":0.0035222315,"about_ca_system_score_codex":0.00092542364,"about_ca_system_score_gemma":0.0010710944,"threshold_uncertainty_score":0.01309216},"labels":[],"label_agreement":null},{"id":"W1595923625","doi":"10.1007/978-3-642-03641-5_9","title":"A PDE Approach to Coupled Super-Resolution with Non-parametric Motion","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Regularization (linguistics); Parametric statistics; Affine transformation; Motion (physics); Computer science; Motion estimation; Algorithm; Computer vision; Resolution (logic); Artificial intelligence; Superresolution; Mathematics; Image (mathematics); Mathematical optimization; Geometry","score_opus":0.014953453176964646,"score_gpt":0.24881150795617837,"score_spread":0.23385805477921373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595923625","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.0013282716,0.00048486984,0.99568486,0.0001838477,0.00008623888,0.000015658934,0.00002308399,0.000064206026,0.0021290523],"genre_scores_gemma":[0.13986972,0.0029290114,0.834666,0.0005444724,0.00041065516,0.00016996812,0.00017604798,0.00029670313,0.020937398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997416,0.00006173353,0.000017934635,0.000049809165,0.00011218655,0.00001678489],"domain_scores_gemma":[0.9996141,0.0002161088,0.000035317265,0.000047205358,0.00006011814,0.000027077787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052361796,0.0007294912,0.0010615061,0.0006022275,0.00038262244,0.001256104,0.001852033,0.0018102195,0.0028409678],"category_scores_gemma":[0.0015980661,0.00083863846,0.0010468718,0.0007682399,0.0012076516,0.0018638587,0.0023800014,0.0022593967,0.0005399169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060957103,0.000072009796,0.00017935215,0.00031948625,0.00013746096,0.00036334005,0.00020073054,0.34999686,0.024972096,0.5593857,0.0039895563,0.0603224],"study_design_scores_gemma":[0.000007119367,0.00001180718,0.000050081955,0.000008578666,0.000010652737,0.000094912764,0.000008537588,0.93290824,0.0011329204,0.06276711,0.0029855475,0.0000144092755],"about_ca_topic_score_codex":0.0019514775,"about_ca_topic_score_gemma":0.0019881725,"teacher_disagreement_score":0.0028409678,"about_ca_system_score_codex":0.0006040895,"about_ca_system_score_gemma":0.00053104426,"threshold_uncertainty_score":0.009503961},"labels":[],"label_agreement":null},{"id":"W1595936530","doi":"10.1007/978-3-540-39646-8_22","title":"An Evidence-Based Mobility Prediction Agent Architecture","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Dempster–Shafer theory; Quality of service; Architecture; Mobility model; A priori and a posteriori; Key (lock); Wireless network; Wireless; Quality (philosophy); Artificial intelligence; Data mining; Distributed computing; Computer network; Computer security; Telecommunications","score_opus":0.0341941035728734,"score_gpt":0.2973947169804392,"score_spread":0.2632006134075658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595936530","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.019452378,0.00037682903,0.9739594,0.0009974012,0.000080478516,0.00020701766,0.00030877886,0.0018183672,0.0027993491],"genre_scores_gemma":[0.42284325,0.00044748213,0.56894237,0.0002777048,0.00008193815,0.00039615278,0.00065702456,0.000087437424,0.006266607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00012987689,0.00006943302,0.00014972367,0.00017845936,0.000048630693],"domain_scores_gemma":[0.9982064,0.00079242035,0.000119234704,0.00018244832,0.00060334604,0.000096208256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019995312,0.00065296714,0.001220139,0.0012674424,0.00078248634,0.0014880125,0.004242955,0.0019049747,0.0048100194],"category_scores_gemma":[0.0059269266,0.0006947708,0.000688823,0.0009835833,0.0006500252,0.0024948593,0.0021015692,0.0013514857,0.001052534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006394736,0.00044120714,0.006672241,0.00023888367,0.000367216,0.00035468087,0.00022522625,0.5076412,0.0040702755,0.03250651,0.0064528403,0.4403902],"study_design_scores_gemma":[0.000028608818,0.00004693548,0.00026852734,0.000015429017,0.00008046975,0.000050264654,0.000013934037,0.98771393,0.0010759687,0.009500907,0.0011939881,0.00001107961],"about_ca_topic_score_codex":0.010488824,"about_ca_topic_score_gemma":0.01348238,"teacher_disagreement_score":0.010488824,"about_ca_system_score_codex":0.0009709496,"about_ca_system_score_gemma":0.0019553292,"threshold_uncertainty_score":0.020855546},"labels":[],"label_agreement":null},{"id":"W1596039687","doi":"10.1007/3-540-36390-4_2","title":"Cascade Decompositions are Bit-Vector Algorithms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"","keywords":"Automaton; Computer science; Algorithm; Bit array; Cascade; Computation; Bounded function; Theoretical computer science; Mathematics; Type (biology)","score_opus":0.01628224680208691,"score_gpt":0.23745818173092115,"score_spread":0.22117593492883425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596039687","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.015716923,0.0008394282,0.9299316,0.0006188865,0.0003720719,0.00023607402,0.00052143907,0.0031937417,0.048569832],"genre_scores_gemma":[0.3114696,0.0019586517,0.60685843,0.0010511868,0.00059298985,0.0007952517,0.0021007934,0.0019731843,0.07319994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990734,0.00018053649,0.000070109665,0.00022682,0.0003327263,0.00011636209],"domain_scores_gemma":[0.9987595,0.0004822109,0.00008031764,0.0003805406,0.00022329082,0.00007417436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008194181,0.0011995181,0.0009862244,0.0016876992,0.0011015792,0.0025617944,0.0014030454,0.001183358,0.029421143],"category_scores_gemma":[0.003258391,0.0008400021,0.0011495458,0.0024470005,0.0011312314,0.0060296543,0.0019468535,0.0025163083,0.008559213],"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.00032809336,0.00013277805,0.00025460453,0.00023840931,0.000036954,0.00005390679,0.0001230789,0.009251929,0.0059139687,0.71300584,0.022216931,0.24844356],"study_design_scores_gemma":[0.000050510724,0.000064190885,0.0001259621,0.000055672495,0.000034164652,0.00010720321,0.00003084492,0.08321226,0.006115349,0.89215046,0.018029174,0.000024163743],"about_ca_topic_score_codex":0.00054315664,"about_ca_topic_score_gemma":0.0010209623,"teacher_disagreement_score":0.029421143,"about_ca_system_score_codex":0.000994701,"about_ca_system_score_gemma":0.0008627607,"threshold_uncertainty_score":0.09842354},"labels":[],"label_agreement":null},{"id":"W1596095404","doi":"10.1007/978-3-540-72990-7_6","title":"Video-on-Demand Server Selection and Placement","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replica; Computer science; Heuristics; Software deployment; Server; Video on demand; Computer network; Distributed computing; Data striping; Bandwidth (computing); Operating system","score_opus":0.020882600255908247,"score_gpt":0.2420162405165629,"score_spread":0.22113364026065466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596095404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072047725,0.0011527541,0.8888587,0.0005436658,0.000501125,0.000610162,0.0008801202,0.007258517,0.028147263],"genre_scores_gemma":[0.7448564,0.000760069,0.22630267,0.00015953326,0.0004983169,0.00015400712,0.0012896679,0.0005014867,0.025477812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.000118739474,0.000029081826,0.000104667975,0.0002906859,0.00014954353],"domain_scores_gemma":[0.99894303,0.0003259596,0.000048231097,0.0002497368,0.00030844286,0.00012463858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056367693,0.0011412237,0.0017034627,0.0010518378,0.00092839944,0.0018015904,0.0024206731,0.00089162355,0.009954162],"category_scores_gemma":[0.0023367829,0.000530504,0.0003682988,0.0020423343,0.00028355498,0.0009839962,0.0009199126,0.00068469805,0.0031212824],"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.0015851556,0.00063992804,0.0025177156,0.00024973377,0.00007733233,0.00047065856,0.00012502828,0.18572366,0.06685943,0.012058947,0.045129437,0.68456304],"study_design_scores_gemma":[0.000058052174,0.00010716828,0.001032522,0.000007855623,0.00001929996,0.00029760395,0.00006958115,0.9710089,0.017906895,0.005553368,0.003913257,0.000025436886],"about_ca_topic_score_codex":0.0040136334,"about_ca_topic_score_gemma":0.009685737,"teacher_disagreement_score":0.009954162,"about_ca_system_score_codex":0.0011111314,"about_ca_system_score_gemma":0.0011950994,"threshold_uncertainty_score":0.033299983},"labels":[],"label_agreement":null},{"id":"W1596155997","doi":"10.1007/11767718_40","title":"Ad Hoc Versus Systematic Planning of Software Releases – A Three-Staged Experiment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Intuition; Post hoc; Scope (computer science); Software; Operations research; Software engineering; Engineering","score_opus":0.030732153343814097,"score_gpt":0.2770940612941766,"score_spread":0.24636190795036247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596155997","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.98667854,0.0001322373,0.006321475,0.0001304153,0.0001375747,0.003086665,0.00030154313,0.0002110222,0.0030003602],"genre_scores_gemma":[0.9610951,0.00017499777,0.021000292,0.0003080059,0.0000980637,0.010420655,0.0005220481,0.00019018992,0.0061906516],"study_design_codex":"randomized_trial","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.991268,0.0035363254,0.0012614556,0.0016746632,0.0015243845,0.00073527935],"domain_scores_gemma":[0.8516881,0.12155902,0.0072725727,0.011257388,0.00347597,0.004747096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013153214,0.0019895306,0.002351137,0.0005804382,0.001314327,0.0027384588,0.0043409574,0.0048475,0.009592177],"category_scores_gemma":[0.081270084,0.0019314032,0.0012357516,0.0006465498,0.0022842775,0.0045991824,0.0021474191,0.0045084828,0.0022485596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.37205487,0.25508034,0.015347056,0.0036983958,0.0011126747,0.0008259354,0.017247345,0.057305254,0.09917089,0.01368398,0.0036909468,0.1607823],"study_design_scores_gemma":[0.11424395,0.57608134,0.033146422,0.00045452893,0.0015983733,0.0004684682,0.003669152,0.16724417,0.052781433,0.03754712,0.011412434,0.0013525418],"about_ca_topic_score_codex":0.0021683045,"about_ca_topic_score_gemma":0.0015017892,"teacher_disagreement_score":0.013153214,"about_ca_system_score_codex":0.0012699062,"about_ca_system_score_gemma":0.004130132,"threshold_uncertainty_score":0.06956166},"labels":[],"label_agreement":null},{"id":"W1596200616","doi":"10.1007/978-3-540-31839-2_2","title":"Data Semantics Revisited","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Toronto","funders":"","keywords":"Computer science; Sketch; Semantics (computer science); Semantic Web; Subject (documents); Contrast (vision); Information retrieval; Open research; Data science; Artificial intelligence; World Wide Web; Programming language; Algorithm","score_opus":0.044875381329592706,"score_gpt":0.2834047300473074,"score_spread":0.23852934871771467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596200616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009920898,0.03523674,0.5723546,0.1076601,0.0060350844,0.00009855843,0.001279967,0.00071527873,0.26669875],"genre_scores_gemma":[0.5529215,0.03780821,0.22558314,0.028256854,0.008361277,0.00063523557,0.00248224,0.0017311055,0.14222053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960199,0.0015187343,0.00034585947,0.00070669746,0.001251142,0.00015770002],"domain_scores_gemma":[0.99503434,0.002350639,0.00013030398,0.0012025427,0.0011262409,0.00015592013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053572888,0.00082706386,0.0014601988,0.005175238,0.002922709,0.009222458,0.0023296026,0.0025803705,0.009713828],"category_scores_gemma":[0.012548637,0.00080811937,0.0013102662,0.00633277,0.013062993,0.031252068,0.005909268,0.006111478,0.0025715858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019726006,0.0000020839743,0.000023497292,0.000023416602,0.0000028373584,0.000011448444,0.00014976875,0.0000611008,0.000027032196,0.9902407,0.003346353,0.0061098356],"study_design_scores_gemma":[0.000002878014,0.0000021648198,0.000027969854,0.000051738367,0.0000065484464,0.00005953141,0.00015821781,0.00049996487,0.000107326116,0.92577845,0.07330109,0.0000042335023],"about_ca_topic_score_codex":0.004373657,"about_ca_topic_score_gemma":0.002378599,"teacher_disagreement_score":0.009713828,"about_ca_system_score_codex":0.0035905477,"about_ca_system_score_gemma":0.002315764,"threshold_uncertainty_score":0.032495975},"labels":[],"label_agreement":null},{"id":"W1596277605","doi":"10.1007/978-3-540-30227-8_36","title":"Two Approaches to Merging Knowledge Bases","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Merge (version control); Computer science; Knowledge base; Consistency (knowledge bases); Logical consequence; Operator (biology); Theoretical computer science; Algorithm; Artificial intelligence; Information retrieval","score_opus":0.05988864282738988,"score_gpt":0.26055056243839625,"score_spread":0.20066191961100638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596277605","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.0030547916,0.0012968787,0.9851665,0.0009992548,0.00018985085,0.00038205128,0.00033340335,0.0021457598,0.0064315484],"genre_scores_gemma":[0.020317664,0.0006783711,0.9720088,0.00032400535,0.000104963365,0.00024943604,0.0010557375,0.00044067667,0.00482047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98846775,0.0031283582,0.0012462656,0.0018982016,0.0044917814,0.0007676614],"domain_scores_gemma":[0.97259575,0.010431552,0.0009429943,0.010264088,0.0049579954,0.0008076041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01088605,0.0016876566,0.0022571965,0.010202917,0.0031012811,0.012674899,0.010058145,0.0049569667,0.015429101],"category_scores_gemma":[0.04459657,0.0033407947,0.003906404,0.012328729,0.0047031823,0.023977922,0.016805569,0.006236452,0.0043215496],"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.00037041504,0.00031501212,0.0009777517,0.00089605787,0.00032279376,0.00034632915,0.003660029,0.0061374996,0.0046795453,0.30935115,0.01575737,0.65718603],"study_design_scores_gemma":[0.0002661565,0.0002462231,0.0012407801,0.00071577664,0.0009732482,0.0014287402,0.0019907537,0.09337257,0.025150917,0.71052593,0.1638117,0.0002771615],"about_ca_topic_score_codex":0.0054305634,"about_ca_topic_score_gemma":0.011951269,"teacher_disagreement_score":0.015429101,"about_ca_system_score_codex":0.0018939009,"about_ca_system_score_gemma":0.0035931908,"threshold_uncertainty_score":0.05757159},"labels":[],"label_agreement":null},{"id":"W1596291969","doi":"10.1007/978-3-642-17650-0_31","title":"IDS Alert Visualization and Monitoring through Heuristic Host Selection","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Visualization; Heuristic; Intrusion detection system; Visual analytics; Metric (unit); Animation; Data mining; Heuristics; Task (project management); Human–computer interaction; Artificial intelligence; Computer graphics (images)","score_opus":0.021991865317523954,"score_gpt":0.3004483520345478,"score_spread":0.27845648671702383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596291969","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.090248935,0.001328791,0.88017994,0.00063437095,0.00031228064,0.00017720938,0.0008235958,0.01982668,0.006468184],"genre_scores_gemma":[0.6438224,0.00058884925,0.35032827,0.00015213547,0.00012647403,0.00008996956,0.0007859519,0.0005418888,0.0035640642],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994386,0.00010912471,0.000033335156,0.00010974359,0.00024156824,0.000067492394],"domain_scores_gemma":[0.9984536,0.00071302545,0.00017226853,0.00020132089,0.0003411763,0.000118641896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008598886,0.0008920697,0.0009798981,0.0022702678,0.00038800508,0.002282372,0.00094701117,0.0005451683,0.003314851],"category_scores_gemma":[0.003722978,0.00032958444,0.0002482604,0.0014586318,0.00022611355,0.0009549032,0.0009958972,0.0008120644,0.0008363513],"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.0013056769,0.00025840427,0.011456464,0.00028140773,0.00009010704,0.00027789964,0.0002853999,0.06212264,0.046519943,0.005612943,0.023088112,0.8487012],"study_design_scores_gemma":[0.00005469745,0.00014494674,0.0044469247,0.00003682928,0.000057497142,0.00027104083,0.000125581,0.9505026,0.031587187,0.0058600013,0.006871592,0.00004119706],"about_ca_topic_score_codex":0.002276309,"about_ca_topic_score_gemma":0.0035814904,"teacher_disagreement_score":0.003314851,"about_ca_system_score_codex":0.0004747364,"about_ca_system_score_gemma":0.0007136104,"threshold_uncertainty_score":0.011089265},"labels":[],"label_agreement":null},{"id":"W1596339028","doi":"10.1007/11550822_94","title":"Chord Classifications by Artificial Neural Networks Revisited: Internal Representations of Circles of Major Thirds and Minor Thirds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chord (peer-to-peer); Computer science; Artificial neural network; Musical; Minor (academic); Inversion (geology); Artificial intelligence; Musical form; Set (abstract data type); Humanities; Visual arts; Art; Programming language","score_opus":0.01981338990698291,"score_gpt":0.26708927233024266,"score_spread":0.24727588242325974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596339028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18417706,0.004384146,0.7783057,0.0038525208,0.0006085653,0.000106675965,0.0011090488,0.0012576499,0.026198639],"genre_scores_gemma":[0.858275,0.0014092053,0.1345784,0.00015385181,0.00022197231,0.000050436804,0.0006194583,0.00012534094,0.0045662974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956197,0.00015249015,0.000030194069,0.00013047789,0.000081502374,0.000043391396],"domain_scores_gemma":[0.997844,0.00087021326,0.00025638004,0.00035816658,0.00055208453,0.00011923246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259732,0.0005914572,0.00077759457,0.001141973,0.0004601129,0.004163849,0.002213379,0.0011615647,0.004217075],"category_scores_gemma":[0.0075810286,0.00050125073,0.0006257903,0.0019296786,0.0009937235,0.0048330873,0.00085543835,0.0020352374,0.001098404],"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.000368999,0.00012753905,0.00789256,0.00035564616,0.00015411577,0.00009228459,0.00065416645,0.12922564,0.011884609,0.11333119,0.011477312,0.72443587],"study_design_scores_gemma":[0.000009061539,0.000018618442,0.0022331546,0.00007832216,0.000025090292,0.000028940727,0.00014892659,0.9377567,0.001757028,0.056516826,0.0014011136,0.000026192538],"about_ca_topic_score_codex":0.007333466,"about_ca_topic_score_gemma":0.0050638528,"teacher_disagreement_score":0.007333466,"about_ca_system_score_codex":0.0010990739,"about_ca_system_score_gemma":0.0006203863,"threshold_uncertainty_score":0.014581561},"labels":[],"label_agreement":null},{"id":"W1596342849","doi":"10.1007/11575771_28","title":"Containment of Conjunctive Queries with Arithmetic Expressions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Containment (computer programming); Conjunctive query; Rewriting; Computer science; Boolean conjunctive query; Theoretical computer science; Arithmetic; Database; Mathematics; Sargable; Information retrieval; Programming language; Web search query; Relational database; Search engine","score_opus":0.01088078553244383,"score_gpt":0.23339617650563524,"score_spread":0.2225153909731914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596342849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056073427,0.0021556069,0.892833,0.0018166725,0.0002731542,0.0002503343,0.0011580718,0.004805534,0.040634133],"genre_scores_gemma":[0.49774948,0.0024458517,0.46845278,0.0012326532,0.0012992149,0.0005339463,0.0075984886,0.0021262132,0.018561356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9813417,0.0047228253,0.001704942,0.0020447618,0.008904805,0.0012809896],"domain_scores_gemma":[0.9486814,0.042507295,0.001708114,0.003187117,0.00341339,0.00050266425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007480474,0.0013721538,0.0024671096,0.0033935292,0.0023612215,0.008918568,0.004479083,0.0020668309,0.0085561825],"category_scores_gemma":[0.033531774,0.003023445,0.0021132694,0.0057352097,0.0058138077,0.019233143,0.0064143334,0.0044892966,0.0024167579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046761532,0.00017624904,0.0013703302,0.0007110305,0.00008249251,0.0009862849,0.0034931328,0.008836596,0.00925374,0.8684285,0.014355988,0.091838114],"study_design_scores_gemma":[0.00014184,0.00009424194,0.0007080738,0.0001695598,0.00017357782,0.0010408849,0.0009050721,0.082156,0.020178743,0.8717153,0.022620017,0.00009658085],"about_ca_topic_score_codex":0.0032015473,"about_ca_topic_score_gemma":0.0017881027,"teacher_disagreement_score":0.008918568,"about_ca_system_score_codex":0.0023957666,"about_ca_system_score_gemma":0.0021058565,"threshold_uncertainty_score":0.039560974},"labels":[],"label_agreement":null},{"id":"W1596383814","doi":"10.1007/978-3-540-24688-6_127","title":"Using Indexed-Sequential Geometric Glyphs to Explore Visual Patterns","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Western University","funders":"","keywords":"Glyph (data visualization); Computer science; Visualization; Computer graphics (images); Artificial intelligence","score_opus":0.05475019017388018,"score_gpt":0.3188520851153255,"score_spread":0.2641018949414453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596383814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11292734,0.0003990463,0.8653257,0.00017417819,0.00011428289,0.00013502594,0.00052194117,0.0055833133,0.01481928],"genre_scores_gemma":[0.28956574,0.00047884503,0.70231354,0.000080099846,0.000027535214,0.00017958913,0.00082434405,0.0010372177,0.0054930574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999884,0.000023355182,0.0000059944073,0.000032557862,0.00003797216,0.00001612108],"domain_scores_gemma":[0.9996679,0.00016452979,0.00001636554,0.00006766721,0.000040427065,0.000043155713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001626182,0.00075266534,0.00047231856,0.00078769564,0.00040351,0.0012277307,0.0008026169,0.00041022018,0.0118486695],"category_scores_gemma":[0.0010327952,0.0003835564,0.00058557146,0.0010343662,0.0005248362,0.0019098434,0.0019428625,0.0006168331,0.0013889419],"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.0011461516,0.00019655391,0.0014669823,0.0009002572,0.0001053933,0.00058443664,0.0029132955,0.017934954,0.33905694,0.05799841,0.014143216,0.5635534],"study_design_scores_gemma":[0.00053442427,0.0008248539,0.0057253726,0.0002622777,0.00021147104,0.0020426277,0.0032428063,0.53098685,0.17386116,0.17539872,0.10670216,0.00020726652],"about_ca_topic_score_codex":0.0007821032,"about_ca_topic_score_gemma":0.0018328766,"teacher_disagreement_score":0.0118486695,"about_ca_system_score_codex":0.00019410004,"about_ca_system_score_gemma":0.00021065054,"threshold_uncertainty_score":0.039637685},"labels":[],"label_agreement":null},{"id":"W1596400712","doi":"10.1007/978-3-540-25929-9_71","title":"K-means Indiscernibility Relation over Pixels","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Pixel; Cluster analysis; Relation (database); Equivalence relation; Computer science; Rough set; Insulator (electricity); Ceramic; Set (abstract data type); Artificial intelligence; Algorithm; Data mining; Mathematics; Discrete mathematics; Electrical engineering; Programming language; Materials science; Engineering","score_opus":0.018943738178767582,"score_gpt":0.24383249968275858,"score_spread":0.224888761503991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596400712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07513909,0.002393476,0.8922585,0.00057328277,0.00020237495,0.000062461826,0.00063288637,0.0009243451,0.027813487],"genre_scores_gemma":[0.56519186,0.0018876332,0.41190365,0.00022545704,0.0003407233,0.00015974663,0.0010044628,0.0002651925,0.019021198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886405,0.00010925854,0.00010178946,0.00050559914,0.0003301793,0.000089050045],"domain_scores_gemma":[0.9989478,0.0003851211,0.0001158067,0.0002789309,0.00022154718,0.000050912033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065694796,0.00052159006,0.000731349,0.0020316918,0.0008960919,0.0028404521,0.0011778212,0.0008653557,0.004585964],"category_scores_gemma":[0.0025242346,0.00045127622,0.0009704165,0.0020944553,0.0015950995,0.004316661,0.001278218,0.0014092012,0.0010819632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004784783,0.000052247455,0.0013299407,0.0006431142,0.00009867509,0.00037888758,0.0006635605,0.019466901,0.036166478,0.65631825,0.004530131,0.27987328],"study_design_scores_gemma":[0.000035017238,0.000116652234,0.002813097,0.00017001393,0.00012903522,0.0013453437,0.00028182782,0.16568947,0.03626331,0.7578592,0.0352203,0.00007691419],"about_ca_topic_score_codex":0.00081101694,"about_ca_topic_score_gemma":0.0008599374,"teacher_disagreement_score":0.004585964,"about_ca_system_score_codex":0.000863477,"about_ca_system_score_gemma":0.0004142012,"threshold_uncertainty_score":0.01534152},"labels":[],"label_agreement":null},{"id":"W1596422927","doi":"10.1007/978-3-540-75759-7_54","title":"Live-Vessel: Extending Livewire for Simultaneous Extraction of Optimal Medial and Boundary Paths in Vascular Images","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Medial axis; Boundary (topology); Similarity (geometry); Curvature; Segmentation; Scale (ratio); Computer science; Graph; Artificial intelligence; Computer vision; Mathematics; Image (mathematics); Geometry; Combinatorics; Mathematical analysis; Cartography; Geography","score_opus":0.00913787649248238,"score_gpt":0.3009809690903435,"score_spread":0.2918430925978611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596422927","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.008503532,0.00013634337,0.9797341,0.00004936744,0.00003179911,0.000043556272,0.00022483767,0.010894809,0.0003815934],"genre_scores_gemma":[0.032722898,0.00013761975,0.96341175,0.000056972236,0.000045875542,0.00007968383,0.00047005573,0.0019599027,0.0011153516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947983,0.000062804414,0.000026365133,0.0001071264,0.00027161444,0.000052307365],"domain_scores_gemma":[0.9987997,0.00055710954,0.0001000338,0.00024412911,0.00019434975,0.000104708226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010093297,0.0015359517,0.0011196688,0.0021044891,0.00047300025,0.0014749216,0.0020637321,0.0022611797,0.009201473],"category_scores_gemma":[0.0024056002,0.0011704046,0.00078803004,0.0012010994,0.00050125003,0.0020956635,0.002186089,0.001181955,0.00239973],"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.00071406004,0.00016085368,0.0009578781,0.0003201692,0.000106990614,0.0003370376,0.00024256007,0.008509614,0.13542353,0.0031256569,0.011124666,0.8389771],"study_design_scores_gemma":[0.0002002813,0.0003261143,0.0022252004,0.000056274326,0.000101758924,0.0015275417,0.00010525698,0.7390882,0.22621034,0.008675156,0.021351751,0.00013218132],"about_ca_topic_score_codex":0.0014250434,"about_ca_topic_score_gemma":0.003588204,"teacher_disagreement_score":0.009201473,"about_ca_system_score_codex":0.000319168,"about_ca_system_score_gemma":0.00070756243,"threshold_uncertainty_score":0.030781984},"labels":[],"label_agreement":null},{"id":"W1596527724","doi":"10.1007/978-3-540-24571-1_73","title":"Similarity Search and Dimensionality Reduction: Not All Dimensions Are Equally Useful","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dimensionality reduction; Search engine indexing; Computer science; Curse of dimensionality; Reduction (mathematics); Speedup; Nearest neighbor search; Similarity (geometry); Overhead (engineering); Diffusion map; Space (punctuation); Range query (database); Range (aeronautics); Process (computing); Similitude; Data mining; Algorithm; Theoretical computer science; Nonlinear dimensionality reduction; Artificial intelligence; Mathematics; Information retrieval; Search engine; Parallel computing; Web search query","score_opus":0.04871447997598213,"score_gpt":0.27806901145447543,"score_spread":0.2293545314784933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596527724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028443448,0.052863922,0.8274187,0.017471693,0.002516205,0.00012803056,0.00079288334,0.0012103537,0.069154836],"genre_scores_gemma":[0.30203247,0.044415843,0.59881383,0.003262569,0.003626733,0.0003380448,0.0013337102,0.00047011266,0.045706723],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984163,0.0004362591,0.000114747236,0.0002450847,0.0007231854,0.000064495674],"domain_scores_gemma":[0.99769104,0.0009843785,0.00015414668,0.000671202,0.0004121164,0.00008718586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111989,0.0007648271,0.0016693487,0.0013827448,0.00082296843,0.0031836093,0.0007825665,0.0010151211,0.005935682],"category_scores_gemma":[0.00725139,0.00041199828,0.0007196001,0.004253793,0.001820969,0.006664381,0.0020600792,0.001704613,0.0028402412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009622244,0.000059899165,0.0009573297,0.00069577846,0.00013025725,0.00008749563,0.00034151462,0.0044642566,0.0034005735,0.19931348,0.05726461,0.7331886],"study_design_scores_gemma":[0.00003243571,0.00017684698,0.0018582642,0.00029614265,0.0001492891,0.0012800923,0.00048656957,0.043182615,0.0052274927,0.8257591,0.12146496,0.00008618185],"about_ca_topic_score_codex":0.00072589,"about_ca_topic_score_gemma":0.0008710494,"teacher_disagreement_score":0.005935682,"about_ca_system_score_codex":0.0005423119,"about_ca_system_score_gemma":0.0008327461,"threshold_uncertainty_score":0.01985681},"labels":[],"label_agreement":null},{"id":"W1596588646","doi":"10.1007/978-3-642-38562-9_55","title":"Probabilistic Graph Summarization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Automatic summarization; Computer science; Scalability; Probabilistic logic; Graph; Theoretical computer science; Algorithm; Data mining; Artificial intelligence; Database","score_opus":0.014928164622190572,"score_gpt":0.2209521364385043,"score_spread":0.20602397181631374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596588646","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.004246234,0.0018941725,0.958844,0.0008292445,0.00031970209,0.00021644734,0.002672824,0.0097176405,0.021259679],"genre_scores_gemma":[0.092855476,0.0027957456,0.8237064,0.00046510788,0.0005440294,0.00030646104,0.021727929,0.0031705322,0.054428257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911267,0.00016956766,0.00006110761,0.000323639,0.0002813938,0.0000515746],"domain_scores_gemma":[0.9986904,0.00033740545,0.00008628992,0.00046956708,0.00037054744,0.000045789697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006964682,0.0011111822,0.0009523877,0.0028642484,0.00082672224,0.0016649615,0.0019210011,0.0010323053,0.021032326],"category_scores_gemma":[0.002994111,0.0006683249,0.0011489125,0.003529263,0.00053065264,0.0034292422,0.0016119827,0.0015521271,0.010934285],"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.000110766174,0.00008336737,0.00023177995,0.0006167839,0.0001063902,0.00014517235,0.00016078312,0.026010172,0.011440855,0.0520801,0.090070866,0.8189429],"study_design_scores_gemma":[0.00005034638,0.0001630337,0.0010879975,0.0002270926,0.0002493531,0.0006936016,0.00025701692,0.3191159,0.03797718,0.35190713,0.28818145,0.00008995058],"about_ca_topic_score_codex":0.0012119602,"about_ca_topic_score_gemma":0.0027094535,"teacher_disagreement_score":0.021032326,"about_ca_system_score_codex":0.0006588958,"about_ca_system_score_gemma":0.0007319734,"threshold_uncertainty_score":0.07036018},"labels":[],"label_agreement":null},{"id":"W1596696432","doi":"10.1007/978-3-540-39611-6_19","title":"On the Interaction of Bandwidth Constraints and Energy Efficiency in All-Wireless Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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 Alberta","funders":"","keywords":"Computer science; Unicast; Computer network; Energy consumption; Bandwidth (computing); Node (physics); Base station; Wireless network; Wireless; Blocking (statistics); Distributed computing; Telecommunications; Multicast","score_opus":0.013574245459270648,"score_gpt":0.23210249757652754,"score_spread":0.2185282521172569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596696432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054040488,0.040556718,0.75932944,0.012804418,0.0014741034,0.00008777707,0.00035417097,0.00022915068,0.13112375],"genre_scores_gemma":[0.8573931,0.039850056,0.06705316,0.0015954588,0.0028894823,0.00015203458,0.00021877889,0.00041592593,0.03043194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989197,0.0005107237,0.000046064793,0.00011691256,0.00025593588,0.00015071199],"domain_scores_gemma":[0.9868471,0.011859268,0.00034519006,0.00033862307,0.00045099802,0.00015879756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025483586,0.0014227871,0.0018682193,0.0009393055,0.0010087221,0.0035768696,0.002519487,0.0020296895,0.007830749],"category_scores_gemma":[0.013087731,0.0010067113,0.0005903978,0.0028452682,0.00316664,0.011271551,0.0019755014,0.0035032157,0.00075152656],"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.000101735495,0.00004175511,0.0004526179,0.00024569785,0.0000498364,0.00012137862,0.0001570726,0.11950339,0.0007519233,0.836927,0.007533229,0.034114286],"study_design_scores_gemma":[0.0000144859,0.000025528163,0.0002804366,0.00006765796,0.000025330684,0.00011539043,0.00009199113,0.13708587,0.00026263704,0.8565724,0.005435335,0.00002288609],"about_ca_topic_score_codex":0.002447246,"about_ca_topic_score_gemma":0.0027800566,"teacher_disagreement_score":0.007830749,"about_ca_system_score_codex":0.0017162308,"about_ca_system_score_gemma":0.000635826,"threshold_uncertainty_score":0.02619642},"labels":[],"label_agreement":null},{"id":"W1596711214","doi":"10.1007/11596448_44","title":"A Software Architecture for Multi-agent Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Concordia University","funders":"","keywords":"Computer science; Agent architecture; Software engineering; Architecture; Software; Software architecture; Multilayered architecture; Software architecture description; Software agent; Software system; Resource-oriented architecture; Programming language; Reference architecture; Multi-agent system; Software construction; Operating system; Artificial intelligence","score_opus":0.037681240876615084,"score_gpt":0.26985296697732586,"score_spread":0.23217172610071077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596711214","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.002017028,0.0013544939,0.97939175,0.0008014568,0.00020701652,0.00011652133,0.000046988673,0.0019961237,0.014068621],"genre_scores_gemma":[0.06749181,0.0028797272,0.904328,0.0002729066,0.00016693187,0.0005345323,0.00030649346,0.0005477391,0.023471909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908674,0.0002711963,0.00010672652,0.0001225382,0.0003218927,0.00009089276],"domain_scores_gemma":[0.9993407,0.000197405,0.00003774244,0.00018428583,0.00016515386,0.00007473801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013329376,0.0012207783,0.0009069636,0.00083241845,0.0015901158,0.004140166,0.002676578,0.0030320566,0.008548097],"category_scores_gemma":[0.0022439503,0.0015661765,0.0012917755,0.0013064955,0.0018053589,0.005309938,0.0028861114,0.0038871323,0.003714929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005116175,0.00007152729,0.0001847064,0.00037707208,0.000054095894,0.00024406578,0.0006187359,0.04228873,0.00496095,0.8313058,0.009747207,0.11009585],"study_design_scores_gemma":[0.00007159047,0.00008924154,0.00012793444,0.00023578545,0.00007756753,0.00038201382,0.0001355272,0.19548339,0.004579645,0.56932306,0.22944352,0.000050706163],"about_ca_topic_score_codex":0.002372192,"about_ca_topic_score_gemma":0.0026145568,"teacher_disagreement_score":0.008548097,"about_ca_system_score_codex":0.0010104221,"about_ca_system_score_gemma":0.0016602847,"threshold_uncertainty_score":0.028596282},"labels":[],"label_agreement":null},{"id":"W1596849507","doi":"10.1007/3-540-45408-x_3","title":"Ontology Design and Its Application in the Petroleum Remediation Domain","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Ontology; Computer science; Domain (mathematical analysis); Focus (optics); Process ontology; Knowledge representation and reasoning; Representation (politics); Software engineering; Ontology-based data integration; Task (project management); Process (computing); Upper ontology; Domain knowledge; Information retrieval; Systems engineering; Artificial intelligence; Programming language","score_opus":0.022334961610171466,"score_gpt":0.24795132337434195,"score_spread":0.2256163617641705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596849507","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.008993221,0.00092030707,0.97197187,0.001874125,0.00013052816,0.00015055428,0.00017866115,0.00074998033,0.015030773],"genre_scores_gemma":[0.07970942,0.0019014695,0.9082408,0.00028615101,0.00007723812,0.00019322083,0.00044591626,0.00029060149,0.0088551575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884546,0.00040191974,0.00015701159,0.00014457923,0.00039144285,0.00005955851],"domain_scores_gemma":[0.9987079,0.0007317095,0.00008247762,0.00017186781,0.00023011726,0.00007591712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00289094,0.00041875336,0.0005234964,0.0017004651,0.00166483,0.0038211187,0.0012014621,0.0016042069,0.0039277305],"category_scores_gemma":[0.0046049273,0.00065273815,0.0012354336,0.0027907197,0.0016651588,0.0050478517,0.0027253635,0.0019588042,0.0009331209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000653122,0.0001983963,0.0010644357,0.00044290136,0.000056573794,0.0006046503,0.0024352563,0.013055368,0.005831692,0.6307076,0.01051504,0.33502275],"study_design_scores_gemma":[0.000039914583,0.000056470104,0.0009036346,0.0002532816,0.00012172443,0.0012550504,0.0015166798,0.17794369,0.01004715,0.51698416,0.29079562,0.00008258695],"about_ca_topic_score_codex":0.007707089,"about_ca_topic_score_gemma":0.010287423,"teacher_disagreement_score":0.007707089,"about_ca_system_score_codex":0.0012311871,"about_ca_system_score_gemma":0.0017451041,"threshold_uncertainty_score":0.015324473},"labels":[],"label_agreement":null},{"id":"W1596854893","doi":"10.1007/11908029_50","title":"Optimization of Information Granulation-Oriented Fuzzy Set Model Using Hierarchical Fair Competition-Based Parallel Genetic Algorithms","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","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 Alberta","funders":"","keywords":"Computer science; Algorithm; Cluster analysis; Meta-optimization; Granulation; Genetic algorithm; Mathematical optimization; Fuzzy logic; Optimization problem; Set (abstract data type); Data mining; Artificial intelligence; Mathematics; Machine learning","score_opus":0.013646487547032968,"score_gpt":0.2225460882893663,"score_spread":0.20889960074233335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596854893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045962278,0.00028565933,0.9473363,0.0002042376,0.000058420595,0.00008309364,0.000050407445,0.00012447867,0.005895153],"genre_scores_gemma":[0.87370557,0.00018746007,0.12288027,0.00007009248,0.000032365446,0.00021517195,0.0000665063,0.00003849357,0.0028040041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996308,0.00011510506,0.0000146932325,0.000063818654,0.00011168586,0.00006396171],"domain_scores_gemma":[0.99935836,0.0003815101,0.000063032814,0.000038437815,0.00012544614,0.000033213742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011982968,0.00057917763,0.0018512222,0.0006628983,0.000845886,0.0015099044,0.0018693223,0.0014083801,0.0020110903],"category_scores_gemma":[0.0017095626,0.00048298418,0.0009869899,0.0009964767,0.001080866,0.0012299189,0.000893238,0.0007817209,0.00012261073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020109701,0.000016560176,0.000056380984,0.000015997539,0.000011450275,0.000015491247,0.000012058143,0.99076086,0.00036824023,0.0056858854,0.00012794865,0.0029089972],"study_design_scores_gemma":[0.0000040082928,0.000004950318,0.000012935376,8.731499e-7,0.0000020756252,0.0000017405858,0.0000013349928,0.9988391,0.000054017346,0.001052895,0.00002477818,0.0000013010416],"about_ca_topic_score_codex":0.010250682,"about_ca_topic_score_gemma":0.0062757405,"teacher_disagreement_score":0.010250682,"about_ca_system_score_codex":0.001724427,"about_ca_system_score_gemma":0.0015515775,"threshold_uncertainty_score":0.020382047},"labels":[],"label_agreement":null},{"id":"W1596927786","doi":"10.1007/978-3-540-77360-3_11","title":"Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"Hyperelliptic curve cryptography; Scalar multiplication; Mathematics; Hyperelliptic curve; Prime (order theory); Genus; Inversion (geology); Field (mathematics); Finite field; Arithmetic; Scalar (mathematics); Elliptic curve; Divisor (algebraic geometry); Algebra over a field; Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Geometry; Public-key cryptography; Elliptic curve cryptography","score_opus":0.023933025065771857,"score_gpt":0.2753110897530602,"score_spread":0.2513780646872883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596927786","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.10467006,0.0013214474,0.8137861,0.0010309065,0.00043981816,0.00022571131,0.0006027205,0.0033344592,0.074588776],"genre_scores_gemma":[0.56281596,0.0012964247,0.39677408,0.0004535701,0.00041085662,0.0004068468,0.0011135526,0.0018612163,0.03486742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985746,0.0002197812,0.00011179974,0.00017240414,0.0006462458,0.00027511848],"domain_scores_gemma":[0.9979614,0.0011297899,0.000117548094,0.00043822444,0.0002696174,0.00008346011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834964,0.0012128946,0.00152063,0.0013978652,0.0013906673,0.005710798,0.0028541556,0.0018161652,0.018555341],"category_scores_gemma":[0.0070733773,0.0010074946,0.0010896568,0.002951201,0.0018946455,0.008120498,0.0032235365,0.0029150846,0.0034921898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002076491,0.00012461554,0.0004345289,0.00024480367,0.000024316874,0.00015001388,0.0005176073,0.0103491405,0.0038928133,0.86780655,0.006375735,0.10987222],"study_design_scores_gemma":[0.00012410035,0.000060902305,0.00021212985,0.000108493594,0.000047726237,0.00015672711,0.00016408047,0.05673265,0.0065514557,0.92138654,0.014403159,0.000052062598],"about_ca_topic_score_codex":0.00065314857,"about_ca_topic_score_gemma":0.0018119436,"teacher_disagreement_score":0.018555341,"about_ca_system_score_codex":0.0021495179,"about_ca_system_score_gemma":0.0012500981,"threshold_uncertainty_score":0.062073827},"labels":[],"label_agreement":null},{"id":"W1596946737","doi":"10.1007/11864127_10","title":"Ordering Partially Assembled Genomes Using Gene Arrangements","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"McGill University","funders":"","keywords":"Contig; Genome; Impossibility; Breakpoint; Set (abstract data type); Computational biology; Graph; Biology; Bacterial genome size; Combinatorics; Computer science; Genetics; Theoretical computer science; Gene; Mathematics; Chromosome","score_opus":0.01878770852273043,"score_gpt":0.24987256945730052,"score_spread":0.2310848609345701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596946737","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.097765654,0.00068000477,0.88733137,0.00022952052,0.0001504977,0.00017589208,0.001776166,0.006634674,0.0052562333],"genre_scores_gemma":[0.13005167,0.0005534443,0.86183953,0.000058865342,0.000041276802,0.00014037143,0.0038795294,0.0009936639,0.0024416987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996706,0.000078849545,0.000028786444,0.00009248826,0.00008747874,0.00004170371],"domain_scores_gemma":[0.998672,0.0007775335,0.00009079397,0.00025833954,0.00013704225,0.0000643188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004010851,0.0008298703,0.0011892284,0.0015336485,0.0008799302,0.0015441468,0.0012787142,0.00058483076,0.006673036],"category_scores_gemma":[0.0026739978,0.00093512074,0.0010382789,0.0032625904,0.0005965542,0.0023107096,0.00096747995,0.0010311499,0.0014255322],"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.0009163018,0.00020474958,0.004129948,0.0012258047,0.000121183744,0.0006408645,0.000889776,0.18441431,0.067016646,0.08568174,0.011304496,0.6434542],"study_design_scores_gemma":[0.00011479978,0.0002884693,0.0014307939,0.00014469142,0.00012316242,0.00039003848,0.0004232332,0.6891086,0.046645135,0.23248383,0.02875959,0.00008764696],"about_ca_topic_score_codex":0.0019840505,"about_ca_topic_score_gemma":0.0067829476,"teacher_disagreement_score":0.006673036,"about_ca_system_score_codex":0.0006647989,"about_ca_system_score_gemma":0.0008111359,"threshold_uncertainty_score":0.022323549},"labels":[],"label_agreement":null},{"id":"W1597017957","doi":"10.1007/978-3-540-45232-4_11","title":"Heuristic Optimization of Scheduling and Allocation for Distributed Systems with Soft Deadlines","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"Carleton University","funders":"","keywords":"Computer science; Software deployment; Scheduling (production processes); Distributed computing; Queueing theory; Heuristic; Mathematical optimization; Computer network","score_opus":0.014440682492985886,"score_gpt":0.2322584779265558,"score_spread":0.2178177954335699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597017957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06857564,0.0016527107,0.9185428,0.00042279117,0.0002392749,0.00016885324,0.00014913628,0.00057588005,0.009672874],"genre_scores_gemma":[0.73075294,0.00081113225,0.2606234,0.00015962357,0.00017102048,0.00036871055,0.00021613593,0.00023207623,0.0066650244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923706,0.00032489686,0.000024903686,0.00007916081,0.00016253341,0.00017156245],"domain_scores_gemma":[0.9982376,0.0013203201,0.00013478062,0.00007577015,0.00012496296,0.00010649373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520273,0.0013713517,0.0020126894,0.0012203744,0.0007769557,0.0016029037,0.0018737814,0.0015336213,0.0033402452],"category_scores_gemma":[0.0039678765,0.0011840955,0.00079035794,0.0017172276,0.0013345884,0.0012575357,0.0011072072,0.0012341082,0.0003515366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007542955,0.00003030003,0.00005689232,0.000032434855,0.000015803853,0.000013685093,0.000012498026,0.9860488,0.00026213855,0.003891841,0.00056909176,0.008991073],"study_design_scores_gemma":[0.000029800009,0.000019797977,0.000027210488,0.0000037698644,0.000005760946,0.000004081213,0.0000072493544,0.9964706,0.00011204942,0.0031180354,0.00019852439,0.0000031092145],"about_ca_topic_score_codex":0.007903529,"about_ca_topic_score_gemma":0.008281374,"teacher_disagreement_score":0.007903529,"about_ca_system_score_codex":0.0023261607,"about_ca_system_score_gemma":0.002353411,"threshold_uncertainty_score":0.016877532},"labels":[],"label_agreement":null},{"id":"W1597023098","doi":"10.1007/978-3-642-01129-0_69","title":"Evolving Indirectly Represented Melodies with Corpus-Based Fitness Evaluation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"Dalhousie University","funders":"","keywords":"Computer science; Melody; Artificial intelligence; Natural language processing; Art; Literature","score_opus":0.02309530956806172,"score_gpt":0.2617142705082484,"score_spread":0.2386189609401867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597023098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33859017,0.000873341,0.6387231,0.00032418536,0.00039069474,0.00041216583,0.0010895965,0.0063614245,0.013235316],"genre_scores_gemma":[0.668729,0.00021474331,0.3193334,0.00013766724,0.000082937586,0.00031927286,0.0031581153,0.00093587296,0.007089051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992009,0.00020376734,0.000053752883,0.0002586046,0.00021026247,0.00007284691],"domain_scores_gemma":[0.997993,0.0009460956,0.000057422167,0.00022563436,0.00068771787,0.000090017136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575848,0.0013742999,0.0013251934,0.0017914369,0.000587999,0.0016818991,0.0018138947,0.0014517854,0.010006784],"category_scores_gemma":[0.006242868,0.0005170085,0.00088733766,0.0012991262,0.0004463392,0.001529428,0.002002671,0.0009319462,0.0019318791],"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.0011512876,0.00059913483,0.0045818915,0.00037469022,0.00025861492,0.00038435278,0.00038428168,0.20559216,0.061457455,0.0029573252,0.006194444,0.7160644],"study_design_scores_gemma":[0.000057447243,0.00012493838,0.0011027147,0.000023978517,0.00008106237,0.000057116686,0.00008197669,0.98887026,0.007021039,0.0012191687,0.0013426943,0.000017587936],"about_ca_topic_score_codex":0.0046411892,"about_ca_topic_score_gemma":0.00762961,"teacher_disagreement_score":0.010006784,"about_ca_system_score_codex":0.0006498459,"about_ca_system_score_gemma":0.0006961026,"threshold_uncertainty_score":0.033476055},"labels":[],"label_agreement":null},{"id":"W1597044112","doi":"10.1007/978-3-540-68143-4_9","title":"Practical Issues in Detecting Broken Social Commitments","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Crime, Illicit Activities, and Governance","field":"Social Sciences","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 Calgary","funders":"","keywords":"Action (physics); Social system; Computer science; Risk analysis (engineering); Computer security; Law and economics; Business; Sociology; Artificial intelligence","score_opus":0.03157450121272223,"score_gpt":0.35162259691692693,"score_spread":0.3200480957042047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597044112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1461226,0.0028648921,0.7800281,0.03684031,0.0008639064,0.00096777716,0.001251016,0.001258384,0.029802918],"genre_scores_gemma":[0.6188388,0.00073328416,0.37139606,0.0010128407,0.00054352556,0.0006118746,0.00091801636,0.00015455608,0.0057910657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9659575,0.021891264,0.002041623,0.004036204,0.004825827,0.00124747],"domain_scores_gemma":[0.62219876,0.3209797,0.0080169095,0.027397923,0.018701605,0.0027050632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03791985,0.0012675842,0.0020348702,0.005205808,0.004595231,0.009449915,0.0066417768,0.0078005916,0.013365557],"category_scores_gemma":[0.31781814,0.0016877828,0.00094101514,0.005867352,0.006825448,0.0173225,0.007201826,0.0062120655,0.0028031562],"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.00096379657,0.0007432767,0.09727563,0.0010010712,0.00024712752,0.0013158199,0.006710045,0.044343244,0.0048928102,0.32099152,0.03572499,0.48579073],"study_design_scores_gemma":[0.0001828324,0.00024884124,0.014462603,0.0003340476,0.00008948743,0.0020589724,0.009219854,0.26110142,0.004468981,0.6914038,0.016296867,0.00013225661],"about_ca_topic_score_codex":0.010059423,"about_ca_topic_score_gemma":0.012312309,"teacher_disagreement_score":0.03791985,"about_ca_system_score_codex":0.0018991486,"about_ca_system_score_gemma":0.0032259906,"threshold_uncertainty_score":0.20054173},"labels":[],"label_agreement":null},{"id":"W1597075322","doi":"10.1007/978-3-642-14186-7_29","title":"Exploiting Circuit Representations in QBF Solving","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Computer science; Solver; Set (abstract data type); Representation (politics); Simple (philosophy); Algorithm; Dual (grammatical number); Theoretical computer science; Parallel computing; Programming language","score_opus":0.04800651739617787,"score_gpt":0.3027290508360599,"score_spread":0.25472253343988205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597075322","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.009339961,0.00021376908,0.97407293,0.0003491843,0.00005607163,0.00008697117,0.00008896683,0.0010315507,0.0147605715],"genre_scores_gemma":[0.3713945,0.0008376831,0.61062455,0.00028162138,0.00008408971,0.00021174685,0.0005232532,0.00063602166,0.015406592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990778,0.0004018009,0.000044639815,0.00011145962,0.0002616581,0.000102546765],"domain_scores_gemma":[0.9983498,0.0012273581,0.00005265656,0.00025904702,0.000086509855,0.000024677349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009693487,0.0006994304,0.0005083055,0.0005925758,0.00056396256,0.0016933639,0.0014366214,0.0009866162,0.011146452],"category_scores_gemma":[0.0047587035,0.0005965198,0.001024324,0.0012847296,0.0012384387,0.0043435283,0.0016081624,0.002193189,0.0015163183],"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.00014562828,0.00009812601,0.00014747043,0.00034757185,0.00003015979,0.000111713845,0.00027673712,0.06213902,0.0070696995,0.6777314,0.0046468643,0.24725562],"study_design_scores_gemma":[0.00004519503,0.00004140832,0.000048322938,0.00007288305,0.00003451957,0.00008237603,0.000068773945,0.1805874,0.006646737,0.7986978,0.013656075,0.000018496316],"about_ca_topic_score_codex":0.0014498926,"about_ca_topic_score_gemma":0.002243866,"teacher_disagreement_score":0.011146452,"about_ca_system_score_codex":0.00090382044,"about_ca_system_score_gemma":0.0008667137,"threshold_uncertainty_score":0.037288606},"labels":[],"label_agreement":null},{"id":"W1597080302","doi":"10.1007/11796435_10","title":"Efficient Automated Clock Gating Using CoDeL","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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 Victoria","funders":"","keywords":"Computer science; Clock gating; Embedded system; Power gating; Netlist; Computer hardware; Computer architecture; Clock signal; Clock skew; Engineering; Electrical engineering; Telecommunications","score_opus":0.020655920233807492,"score_gpt":0.28586468687680583,"score_spread":0.26520876664299836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597080302","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.030947806,0.00076334586,0.90417796,0.00036379858,0.0004107156,0.00024083279,0.00053241616,0.045212362,0.017350681],"genre_scores_gemma":[0.4400695,0.00030919007,0.5388038,0.000635826,0.00015537339,0.00033943704,0.0011997762,0.0035348907,0.01495219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921227,0.00013890771,0.00004466814,0.00011938741,0.00033379157,0.0001509777],"domain_scores_gemma":[0.99876165,0.00051035103,0.00009872912,0.00031641743,0.00026091214,0.00005201642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281366,0.0012506506,0.00067145604,0.0012343551,0.00070819695,0.0016658319,0.0017305014,0.00058314117,0.012342458],"category_scores_gemma":[0.0017910115,0.0004629671,0.00038543163,0.0010815077,0.0005197414,0.0013760332,0.0012784787,0.0008902967,0.0035209584],"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.00095567614,0.00021630096,0.0010835618,0.00039759028,0.000057942932,0.00035235315,0.00020315681,0.01835693,0.13540395,0.027796064,0.03937633,0.77580017],"study_design_scores_gemma":[0.00030026675,0.0004607689,0.00081675424,0.00013990326,0.00011718419,0.0005556225,0.00014528447,0.5218041,0.35959768,0.03248333,0.08347378,0.00010529107],"about_ca_topic_score_codex":0.0018406853,"about_ca_topic_score_gemma":0.0043769055,"teacher_disagreement_score":0.012342458,"about_ca_system_score_codex":0.0009331995,"about_ca_system_score_gemma":0.0016049303,"threshold_uncertainty_score":0.041289628},"labels":[],"label_agreement":null},{"id":"W1597092345","doi":"10.1007/978-3-642-02097-1_8","title":"A Knowledge Representation Tool for Autonomous Machine Learning Based on Concept Algebra","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Knowledge representation and reasoning; Set (abstract data type); Representation (politics); Algebra over a field; Associative property; Relational algebra; Theoretical computer science; Artificial intelligence; Programming language; Mathematics; Relational database; Information retrieval","score_opus":0.0218660125939764,"score_gpt":0.2767050047679933,"score_spread":0.2548389921740169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597092345","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.00077800633,0.000103403,0.9912991,0.00012400871,0.00004403362,0.000059747603,0.00032511126,0.0046842573,0.0025823733],"genre_scores_gemma":[0.023233257,0.0002741884,0.9707333,0.00013963766,0.000045333196,0.00024443312,0.001237494,0.00056874746,0.0035236522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993451,0.00013023974,0.00009954773,0.00013442014,0.0002524272,0.000038166276],"domain_scores_gemma":[0.9990337,0.00051260996,0.000051327792,0.00021859325,0.00012871985,0.000055028202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012758765,0.00076393853,0.0009197237,0.00163913,0.0008213968,0.0036852395,0.0023123524,0.001027105,0.0150294155],"category_scores_gemma":[0.00349838,0.00070247625,0.0018400623,0.0018232152,0.0011621558,0.005446518,0.0028018928,0.0026157447,0.005661175],"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.00011436324,0.00012528153,0.0003040092,0.00046442865,0.000082494764,0.0002877072,0.00068644946,0.010059679,0.005803615,0.50135875,0.028916283,0.45179695],"study_design_scores_gemma":[0.00006224414,0.0000559536,0.00017615156,0.00019161284,0.00007779086,0.00042035538,0.0001439632,0.17200963,0.0086178845,0.6676371,0.15055203,0.00005520903],"about_ca_topic_score_codex":0.0013180645,"about_ca_topic_score_gemma":0.001853166,"teacher_disagreement_score":0.0150294155,"about_ca_system_score_codex":0.00053807226,"about_ca_system_score_gemma":0.0009492017,"threshold_uncertainty_score":0.050278366},"labels":[],"label_agreement":null},{"id":"W1597169801","doi":"10.1007/978-3-642-15711-0_64","title":"Under-Determined Non-cartesian MR Reconstruction with Non-convex Sparsity Promoting Analysis Prior","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wavelet; Mathematics; Norm (philosophy); Regular polygon; Cartesian coordinate system; Convex optimization; Inverse problem; Image (mathematics); Iterative reconstruction; Algorithm; Metric (unit); Mathematical optimization; Applied mathematics; Computer science; Artificial intelligence; Mathematical analysis; Geometry","score_opus":0.007623799627371663,"score_gpt":0.21731722032938958,"score_spread":0.2096934207020179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597169801","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.005379258,0.00010070451,0.99248827,0.00016957405,0.000020628735,0.000011232295,0.00006881205,0.000099724624,0.0016617917],"genre_scores_gemma":[0.26463315,0.0009970181,0.7250484,0.00029475774,0.00017325493,0.00010153777,0.0005843092,0.0002858123,0.007881802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927944,0.00024881915,0.000034638062,0.00014396675,0.0002459874,0.00004714493],"domain_scores_gemma":[0.9984865,0.0006513846,0.00019758099,0.00033711642,0.00024953388,0.00007788435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096141984,0.000939378,0.000956916,0.0004894746,0.00023614145,0.0013720492,0.0006814211,0.00096586766,0.002279862],"category_scores_gemma":[0.005002567,0.00064482953,0.00051577843,0.0005548566,0.0011182986,0.0016406088,0.0018971593,0.0016794117,0.0012655419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012032253,0.00013945275,0.002187218,0.00089968345,0.00017819006,0.00072885404,0.00049428514,0.44324493,0.092281654,0.22447509,0.009972597,0.22419482],"study_design_scores_gemma":[0.000028253477,0.00007281766,0.0005695069,0.000034819117,0.000037546895,0.00052412116,0.00004972647,0.9396198,0.014477987,0.039578434,0.004969741,0.00003730768],"about_ca_topic_score_codex":0.00066519657,"about_ca_topic_score_gemma":0.0009477983,"teacher_disagreement_score":0.002279862,"about_ca_system_score_codex":0.00026950228,"about_ca_system_score_gemma":0.000964708,"threshold_uncertainty_score":0.0076268315},"labels":[],"label_agreement":null},{"id":"W1597201390","doi":"10.1007/978-3-540-39718-2_10","title":"Interoperability on XML Data","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Semantic interoperability; Interoperability; RDF; XML; Semantics (computer science); Information retrieval; XQuery; Vocabulary; World Wide Web; Semantic Web; Linked data; XML Schema Editor; Programming language","score_opus":0.05365193814757863,"score_gpt":0.2827741698466934,"score_spread":0.22912223169911478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597201390","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.0129439095,0.0017278646,0.91540307,0.0023651978,0.00030521987,0.00013781144,0.0006962029,0.0038228517,0.06259794],"genre_scores_gemma":[0.26621908,0.0066155195,0.63580257,0.0012823924,0.00041661784,0.0006731252,0.011799367,0.003389123,0.07380219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622834,0.0010865068,0.0005303515,0.00043902878,0.0015306062,0.00018517273],"domain_scores_gemma":[0.99588555,0.00163193,0.00013713236,0.0019182689,0.00037006254,0.000057120636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045056907,0.000647368,0.00070962537,0.002929044,0.0010060291,0.005517214,0.0017418674,0.0017356673,0.006654763],"category_scores_gemma":[0.0076659974,0.0008635778,0.0013320176,0.005205376,0.0017725932,0.01472622,0.0041659772,0.0025984948,0.0028468352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049226866,0.000075928714,0.0005388167,0.00023245908,0.000050894178,0.00030122205,0.0007948728,0.0055144494,0.004074792,0.7553353,0.011794349,0.22123776],"study_design_scores_gemma":[0.000025620007,0.000035443012,0.0006517579,0.00037223496,0.00009100144,0.00054256857,0.00041027876,0.04546501,0.023825282,0.7003431,0.22818653,0.00005109268],"about_ca_topic_score_codex":0.0014344116,"about_ca_topic_score_gemma":0.0008419939,"teacher_disagreement_score":0.006654763,"about_ca_system_score_codex":0.00090206624,"about_ca_system_score_gemma":0.0008693505,"threshold_uncertainty_score":0.023828685},"labels":[],"label_agreement":null},{"id":"W159720989","doi":"10.1007/978-3-642-25324-9_25","title":"Modular Natural Language Processing Using Declarative Attribute Grammars","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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 Windsor","funders":"","keywords":"Computer science; L-attributed grammar; Programming language; Executable; Context-free grammar; Extended Affix Grammar; Unification; Rule-based machine translation; S-attributed grammar; Parsing; Natural language processing; Parsing expression grammar; Syntax; Definite clause grammar; Artificial intelligence; Abstract syntax; Metalanguage; Modular design; Semantics (computer science)","score_opus":0.03464108760745817,"score_gpt":0.26535465809792746,"score_spread":0.2307135704904693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159720989","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.009567636,0.00013764644,0.9786573,0.000114638766,0.00004675941,0.000065261665,0.0001961598,0.008181105,0.0030335488],"genre_scores_gemma":[0.1799792,0.00039266804,0.8070173,0.00018319962,0.00010670196,0.00015919801,0.0020295724,0.0022671584,0.007864942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916863,0.0001512403,0.000093268194,0.00020878785,0.0002884822,0.0000896064],"domain_scores_gemma":[0.9985447,0.0007184212,0.00006850269,0.00046554024,0.00015867497,0.000044245367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012129385,0.00061125786,0.0007824628,0.0008440337,0.0006141622,0.0023726309,0.002136226,0.00058515277,0.0063831257],"category_scores_gemma":[0.0023745447,0.0007248883,0.0021203423,0.0010151593,0.0012965834,0.0044912873,0.0024451495,0.0016486807,0.002535659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002445268,0.00023717343,0.0009183364,0.0005317123,0.00011784056,0.0005052472,0.0010883177,0.028974384,0.049986687,0.45458376,0.015358853,0.4474532],"study_design_scores_gemma":[0.00009054769,0.000088462475,0.00043895154,0.0000880342,0.00012482791,0.00046787012,0.0001574317,0.191754,0.06253589,0.6923565,0.051820695,0.00007679519],"about_ca_topic_score_codex":0.000809049,"about_ca_topic_score_gemma":0.0013688972,"teacher_disagreement_score":0.0063831257,"about_ca_system_score_codex":0.00044429462,"about_ca_system_score_gemma":0.00067097275,"threshold_uncertainty_score":0.021353662},"labels":[],"label_agreement":null},{"id":"W1597221361","doi":"10.1007/978-3-642-13681-8_68","title":"A New Preprocessing Filter for Digital Mammograms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":28,"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; Carleton University","funders":"","keywords":"Adaptive histogram equalization; Computer science; Preprocessor; Artificial intelligence; Computer vision; Filter (signal processing); Histogram equalization; Segmentation; Adaptive filter; Median filter; Noise (video); Pattern recognition (psychology); Histogram; Image segmentation; Edge-preserving smoothing; Bilateral filter; Image processing; Image (mathematics); Algorithm","score_opus":0.01623168453621582,"score_gpt":0.24816024041653767,"score_spread":0.23192855588032185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597221361","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.006693172,0.0011531068,0.98819065,0.00016183486,0.0002822065,0.000051338175,0.00015391932,0.0017060298,0.0016076977],"genre_scores_gemma":[0.03124317,0.0018136975,0.9523097,0.00029772238,0.00033633533,0.000083893196,0.0006922331,0.00038080377,0.012842419],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995921,0.00002966268,0.000029824534,0.00009887654,0.00021389333,0.00003570231],"domain_scores_gemma":[0.9992481,0.00023968378,0.000042960808,0.00010723044,0.00031864093,0.00004331989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046945107,0.0007802195,0.0007617126,0.0012224388,0.0004435568,0.001108831,0.00080377184,0.0010984458,0.00822999],"category_scores_gemma":[0.001147136,0.0004319629,0.0011143172,0.0010860147,0.00035766745,0.0010089157,0.0006899616,0.0009097804,0.0038980297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003570524,0.00006872111,0.0004899025,0.00036434125,0.0000806955,0.00024269943,0.00007778957,0.0022977982,0.30521643,0.0043622637,0.00835513,0.67808723],"study_design_scores_gemma":[0.00010295471,0.0005764155,0.0089106215,0.0001465474,0.00076347345,0.005378699,0.00013676092,0.25845245,0.5307374,0.008056661,0.18658492,0.0001532015],"about_ca_topic_score_codex":0.0011524387,"about_ca_topic_score_gemma":0.0021114824,"teacher_disagreement_score":0.00822999,"about_ca_system_score_codex":0.00035034723,"about_ca_system_score_gemma":0.0006124968,"threshold_uncertainty_score":0.0275321},"labels":[],"label_agreement":null},{"id":"W1597226433","doi":"10.1007/978-3-642-12805-9_1","title":"Burden of Proof in Deliberation Dialogs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Windsor","funders":"","keywords":"Dialog box; Argumentation theory; Deliberation; Persuasion; Computer science; Dialog system; Epistemology; Artificial intelligence; Linguistics; Political science; Philosophy; Law; World Wide Web","score_opus":0.017243462750683634,"score_gpt":0.24166963356062623,"score_spread":0.2244261708099426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597226433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040620033,0.0058995183,0.78128994,0.0150439,0.00092286244,0.00025361293,0.00038165276,0.0013384444,0.15425],"genre_scores_gemma":[0.8325561,0.0030958264,0.1301694,0.0009669803,0.0012643329,0.00037485553,0.00050080236,0.0007023539,0.030369401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9735598,0.014382765,0.0015485963,0.0019818111,0.0069181006,0.0016089792],"domain_scores_gemma":[0.78944194,0.1759767,0.0042580124,0.020860076,0.0069865338,0.0024766943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02112476,0.0013093163,0.0025306528,0.0032654172,0.0047721704,0.010338217,0.0037219066,0.0051921927,0.033525612],"category_scores_gemma":[0.13803178,0.0021387516,0.0016422794,0.002826001,0.007517835,0.03792385,0.010161051,0.006587918,0.005112691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047469928,0.0000663209,0.00043456812,0.00030458285,0.000033659933,0.00026287072,0.0012358365,0.0031029088,0.00083648483,0.9366834,0.0056463163,0.050918367],"study_design_scores_gemma":[0.000082469254,0.000038858467,0.00016802322,0.00015257091,0.000045522662,0.00029274242,0.00024035391,0.018912693,0.0015109116,0.96116877,0.017357929,0.000029165023],"about_ca_topic_score_codex":0.00083091075,"about_ca_topic_score_gemma":0.0006557698,"teacher_disagreement_score":0.033525612,"about_ca_system_score_codex":0.0029984957,"about_ca_system_score_gemma":0.0031618509,"threshold_uncertainty_score":0.112154365},"labels":[],"label_agreement":null},{"id":"W1597317312","doi":"10.1007/978-3-540-75538-8_11","title":"Feature Construction for Reinforcement Learning in Hearts","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Temporal difference learning; Artificial intelligence; Variety (cybernetics); Set (abstract data type); Representation (politics); Monte Carlo tree search; Machine learning; Mathematics","score_opus":0.034101187640759104,"score_gpt":0.2915072131869799,"score_spread":0.25740602554622083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597317312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01063268,0.00010229102,0.9852989,0.00009194667,0.000036604706,0.0000236242,0.000032115062,0.00039803344,0.0033838812],"genre_scores_gemma":[0.5572715,0.0001563428,0.4340591,0.00007467804,0.000054065156,0.00017562477,0.00018525204,0.00023835506,0.007785164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.000087203574,0.000017396775,0.000073128205,0.000057152258,0.00004063821],"domain_scores_gemma":[0.9992824,0.00046539618,0.00003090673,0.000099780234,0.00007655963,0.000045004508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073970685,0.0003036967,0.00058196514,0.00028506233,0.0003700947,0.0007387703,0.0011721501,0.00068996195,0.007835563],"category_scores_gemma":[0.0028499314,0.0002481849,0.0004855856,0.0002739206,0.0008181523,0.0015834981,0.0013503658,0.001356737,0.0007151493],"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.00022708684,0.00010308194,0.00092257035,0.00016580394,0.00003503419,0.000101614554,0.00023242085,0.17685357,0.006300105,0.33555767,0.0062522003,0.47324887],"study_design_scores_gemma":[0.000028629938,0.0000507419,0.00019269402,0.000021505151,0.000009448077,0.00003426179,0.00002144633,0.78400314,0.0019259498,0.21105081,0.0026511163,0.000010230667],"about_ca_topic_score_codex":0.0011320572,"about_ca_topic_score_gemma":0.0014297598,"teacher_disagreement_score":0.007835563,"about_ca_system_score_codex":0.0006459607,"about_ca_system_score_gemma":0.00038591272,"threshold_uncertainty_score":0.026212573},"labels":[],"label_agreement":null},{"id":"W1597340042","doi":"10.1007/11603023_7","title":"JQuery: A Generic Code Browser with a Declarative Configuration Language","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Plug-in; Programming language; Personalization; Code (set theory); Interface (matter); Software engineering; Scheme (mathematics); Operating system; Declarative programming; Set (abstract data type); Programming paradigm; World Wide Web; Inductive programming","score_opus":0.017328488391410782,"score_gpt":0.2570951167206205,"score_spread":0.23976662832920975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597340042","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044988007,0.00026325366,0.56001574,0.00033086896,0.0001534641,0.00021468554,0.0029366012,0.42091408,0.010672563],"genre_scores_gemma":[0.1073693,0.0010090084,0.41965795,0.0023638455,0.00022144732,0.0007654515,0.024506591,0.39095542,0.053151045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840766,0.00018928727,0.00016664842,0.00030303572,0.00076272734,0.00017067851],"domain_scores_gemma":[0.997255,0.0012120582,0.00014678015,0.0007033108,0.00042889145,0.0002538725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019428272,0.0020652816,0.0014310429,0.001730344,0.00080628024,0.0036929776,0.00427176,0.0031033221,0.029008312],"category_scores_gemma":[0.005598642,0.0029266262,0.0016475596,0.0014385668,0.0015123902,0.005186907,0.004185832,0.0037355265,0.020892875],"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.0019641283,0.0005464446,0.0034966434,0.0014539514,0.00021975866,0.0014051677,0.0018392187,0.008162612,0.07534355,0.065120235,0.55507725,0.285371],"study_design_scores_gemma":[0.0010770098,0.00029238744,0.002526748,0.0004947635,0.00027398608,0.0027426805,0.00030599715,0.13251226,0.11802208,0.058699284,0.6825006,0.00055229606],"about_ca_topic_score_codex":0.0035792342,"about_ca_topic_score_gemma":0.0034587595,"teacher_disagreement_score":0.029008312,"about_ca_system_score_codex":0.0007473069,"about_ca_system_score_gemma":0.0013268915,"threshold_uncertainty_score":0.09704244},"labels":[],"label_agreement":null},{"id":"W1597362548","doi":"10.1007/978-3-642-02498-6_7","title":"Discovering Sparse Functional Brain Networks Using Group Replicator Dynamics (GRD)","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Replicator equation; Dynamics (music); Group (periodic table); Theoretical computer science; Artificial intelligence; Psychology","score_opus":0.02399443027616046,"score_gpt":0.25371331129001856,"score_spread":0.2297188810138581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597362548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064328134,0.00044968261,0.93349904,0.00037567192,0.00003868151,0.00005148559,0.00015123222,0.00038500715,0.00072113605],"genre_scores_gemma":[0.7265099,0.00042891334,0.27104202,0.00012469062,0.00009352424,0.00017024521,0.00040835887,0.000102675745,0.0011196308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997776,0.000093668146,0.000011082428,0.00006340165,0.000034132045,0.000020176027],"domain_scores_gemma":[0.99614835,0.0030510605,0.00031659275,0.0002503755,0.00014384533,0.00008980732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092741713,0.0008086871,0.0011821616,0.0012287386,0.00041787207,0.0007894563,0.0012016773,0.0015076682,0.0013167377],"category_scores_gemma":[0.007869805,0.00093261554,0.0011415188,0.0008527873,0.0007957504,0.0014713536,0.0011003216,0.0011635099,0.00026174923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096860174,0.000050174738,0.002824815,0.00017018535,0.00018191047,0.00021880091,0.00015770344,0.909697,0.0035152372,0.013291758,0.0013849628,0.06841056],"study_design_scores_gemma":[0.000004652138,0.000006160467,0.000098918244,0.0000028581235,0.0000052981236,0.000017399287,0.0000065190793,0.9902379,0.00013575252,0.0094131455,0.0000686629,0.0000028000718],"about_ca_topic_score_codex":0.0028185463,"about_ca_topic_score_gemma":0.0033458394,"teacher_disagreement_score":0.0028185463,"about_ca_system_score_codex":0.00040120154,"about_ca_system_score_gemma":0.00039052474,"threshold_uncertainty_score":0.005604267},"labels":[],"label_agreement":null},{"id":"W1597404817","doi":"10.1007/978-3-540-25939-8_12","title":"Dependability Modeling of Self-healing Client-Server Applications","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Dependability; Control reconfiguration; Computer science; Fault management; Software fault tolerance; Embedded system; Distributed computing; Fault tolerance; Reliability engineering; Software engineering; Engineering","score_opus":0.015307371350152064,"score_gpt":0.24916051499980607,"score_spread":0.233853143649654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597404817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13435,0.00095817616,0.850666,0.00043686433,0.000052606047,0.00006165732,0.00012852084,0.00049587886,0.012850264],"genre_scores_gemma":[0.9745175,0.0005297275,0.01647604,0.000039306902,0.000042539825,0.00005689852,0.00012353323,0.00010413837,0.008110374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999678,0.000069559916,0.00001618641,0.000045245415,0.00014633032,0.000044586326],"domain_scores_gemma":[0.99930096,0.00037421726,0.00006616814,0.00008402911,0.00015246733,0.000022205315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047984233,0.00052036846,0.0004540793,0.00071584305,0.00028943946,0.0007107029,0.0016842962,0.0007164788,0.0016805665],"category_scores_gemma":[0.0015615536,0.0003480452,0.00062902883,0.00041052673,0.0005009684,0.0010976995,0.0003895708,0.0007322678,0.00029808033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003862685,0.00004572983,0.00037977856,0.000040636238,0.00001688604,0.00009683341,0.00009262672,0.9519898,0.0059719896,0.030523859,0.00042896994,0.010374156],"study_design_scores_gemma":[0.0000011143094,0.0000048044394,0.00007402407,0.0000013478722,0.0000026732675,0.000009298694,0.0000030632127,0.99419916,0.0003652504,0.0052116625,0.00012618558,0.0000013771672],"about_ca_topic_score_codex":0.0056455582,"about_ca_topic_score_gemma":0.0023946897,"teacher_disagreement_score":0.0056455582,"about_ca_system_score_codex":0.00086538953,"about_ca_system_score_gemma":0.00045938868,"threshold_uncertainty_score":0.011225402},"labels":[],"label_agreement":null},{"id":"W1597421340","doi":"10.1007/978-3-642-15555-0_12","title":"A Discriminative Latent Model of Object Classes and Attributes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":221,"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":"Discriminative model; Computer science; Object (grammar); Artificial intelligence; Pattern recognition (psychology)","score_opus":0.03255496440562197,"score_gpt":0.25531685308170515,"score_spread":0.22276188867608318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597421340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061227377,0.00037959445,0.9908285,0.0001808056,0.00007296496,0.000027871605,0.0008862779,0.0009173763,0.0005838858],"genre_scores_gemma":[0.44587308,0.0018599277,0.5228948,0.0008002986,0.0004277878,0.00039754625,0.01185328,0.0006120442,0.015281281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989064,0.00023261861,0.000055382276,0.00042543386,0.000250419,0.0001297886],"domain_scores_gemma":[0.9984586,0.00051591074,0.00014570552,0.00058628176,0.00021517437,0.00007831282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014574946,0.00078546756,0.0015034033,0.0011355121,0.00038892124,0.0014228426,0.0028190531,0.0014174553,0.0032777165],"category_scores_gemma":[0.003305712,0.00091835065,0.001666419,0.0021657022,0.000949142,0.0025237903,0.001802612,0.0031530512,0.0032592255],"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.00071546715,0.0005460212,0.0044881534,0.00040217311,0.00028727436,0.00022547875,0.0002897073,0.11502977,0.03549171,0.0907994,0.026244255,0.7254806],"study_design_scores_gemma":[0.000040317613,0.000071002694,0.0016782682,0.000043155185,0.00009030514,0.00024832814,0.0000327798,0.93702847,0.003603709,0.05272588,0.0044039786,0.000033806995],"about_ca_topic_score_codex":0.005412406,"about_ca_topic_score_gemma":0.009716258,"teacher_disagreement_score":0.005412406,"about_ca_system_score_codex":0.0008366904,"about_ca_system_score_gemma":0.0012819585,"threshold_uncertainty_score":0.010965049},"labels":[],"label_agreement":null},{"id":"W1597468572","doi":"10.1007/978-3-642-02927-1_38","title":"Universal Succinct Representations of Trees?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Programming language","score_opus":0.014718702996058803,"score_gpt":0.25614461260910765,"score_spread":0.24142590961304886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597468572","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.052470427,0.0054081767,0.8395491,0.0058273333,0.0011740173,0.00009998255,0.0018165736,0.0018934193,0.09176086],"genre_scores_gemma":[0.6811872,0.007379437,0.25675777,0.0024342085,0.001221575,0.00033454254,0.003972327,0.0014871196,0.045225795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991041,0.00020050826,0.00007781378,0.00015673295,0.0003223597,0.0001384845],"domain_scores_gemma":[0.9975968,0.0011093343,0.00015834137,0.0008336945,0.00020467947,0.00009717459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085837493,0.00060298917,0.00078012137,0.00083739957,0.0005459709,0.0031394735,0.0013014204,0.0012206871,0.01473615],"category_scores_gemma":[0.007248002,0.00065439846,0.00054774916,0.0017673749,0.0016559432,0.010617832,0.002613269,0.003127745,0.0030301274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055540455,0.000020770287,0.00007201617,0.00009869227,0.00000749278,0.000032109576,0.0002269616,0.0029893448,0.0008788795,0.9334584,0.007874736,0.054284997],"study_design_scores_gemma":[0.000011491328,0.0000080753725,0.000032770826,0.00005072969,0.0000064513642,0.00005257675,0.000051593077,0.0055819186,0.00078760996,0.9814973,0.011910756,0.000008802242],"about_ca_topic_score_codex":0.00047545874,"about_ca_topic_score_gemma":0.0006295401,"teacher_disagreement_score":0.01473615,"about_ca_system_score_codex":0.00078266836,"about_ca_system_score_gemma":0.00055380724,"threshold_uncertainty_score":0.049297333},"labels":[],"label_agreement":null},{"id":"W1597495308","doi":"10.1007/978-3-540-72667-8_5","title":"Empowering Software Maintainers with Semantic Web Technologies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Software maintenance; Software engineering; Traceability; Source code; Static program analysis; Semantic Web; Ontology; Software; Semantic technology; Software development; World Wide Web; Information retrieval; Social Semantic Web; Programming language","score_opus":0.015698393594489428,"score_gpt":0.2682209223338169,"score_spread":0.25252252873932746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597495308","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.064688474,0.0010299721,0.8759766,0.005590979,0.00022820561,0.00010665061,0.00009352534,0.010988359,0.041297216],"genre_scores_gemma":[0.4610306,0.0022511887,0.47698525,0.0011205731,0.0003794773,0.00016933378,0.0007062364,0.0026081703,0.05474915],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997928,0.00050256425,0.00013284093,0.00021311085,0.0010598191,0.00016354398],"domain_scores_gemma":[0.995773,0.0022769046,0.0002763478,0.0009603063,0.000521878,0.00019158253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003811529,0.00053768855,0.00030152712,0.000963132,0.0006692264,0.0034011123,0.0013993471,0.0014433566,0.0030858433],"category_scores_gemma":[0.008963117,0.00068983727,0.0004801489,0.0010208553,0.00098548,0.016984697,0.0029285664,0.0024509437,0.0012786849],"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.00013831106,0.00044728754,0.0032217316,0.0004692729,0.00005638819,0.00065573846,0.012051798,0.0038610483,0.044294283,0.16138563,0.027709402,0.7457091],"study_design_scores_gemma":[0.000087616616,0.00023780885,0.0024242292,0.00041015903,0.00024481394,0.0019506034,0.0037774201,0.08240968,0.0826505,0.25069553,0.5749986,0.00011305953],"about_ca_topic_score_codex":0.00054733135,"about_ca_topic_score_gemma":0.0013595977,"teacher_disagreement_score":0.003811529,"about_ca_system_score_codex":0.00037949815,"about_ca_system_score_gemma":0.0011217486,"threshold_uncertainty_score":0.020157516},"labels":[],"label_agreement":null},{"id":"W1597605992","doi":"10.1007/978-3-642-15745-5_19","title":"A Generative Model for Brain Tumor Segmentation in Multi-Modal Images","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":201,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Institute of Biomedical Imaging and Bioengineering; National Center for Research Resources; National Institute of Neurological Disorders and Stroke; Institut national de recherche en informatique et en automatique (INRIA); National Institutes of Health; National Science Foundation","keywords":"Computer science; Segmentation; Artificial intelligence; Atlas (anatomy); Prior probability; Probabilistic logic; Generative model; Image segmentation; Pattern recognition (psychology); Modal; Generative grammar; Bayesian probability; Medicine","score_opus":0.023990697327000043,"score_gpt":0.32836743723209866,"score_spread":0.3043767399050986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597605992","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.009278088,0.00040242492,0.9881864,0.00033634412,0.00004627959,0.00004017008,0.00026640296,0.00079100486,0.00065290154],"genre_scores_gemma":[0.6571843,0.0014784269,0.32354274,0.00074834406,0.00034896014,0.0005695382,0.0014651831,0.0013136616,0.013348847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994092,0.00016889613,0.00003082158,0.00018763328,0.00013551385,0.00006791384],"domain_scores_gemma":[0.99808806,0.0013777415,0.00015656669,0.00014894872,0.00015565213,0.000073025985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014766298,0.0009665968,0.0015943424,0.0015800957,0.00070384,0.0014275734,0.0030239394,0.0035749786,0.003226604],"category_scores_gemma":[0.0035730544,0.002260442,0.0030305625,0.0016616803,0.001453698,0.0013305602,0.0018098026,0.0024417925,0.0014479851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001367591,0.000053437063,0.0010303609,0.00014778077,0.00013815018,0.0003196924,0.00022497287,0.921062,0.005353222,0.025514513,0.0019142042,0.044104874],"study_design_scores_gemma":[0.000007603002,0.00000787909,0.0001523322,0.000007962287,0.000022416134,0.00007889938,0.0000057564343,0.9918064,0.00041048307,0.007183079,0.00030570416,0.000011518903],"about_ca_topic_score_codex":0.011990809,"about_ca_topic_score_gemma":0.020423178,"teacher_disagreement_score":0.011990809,"about_ca_system_score_codex":0.0016056807,"about_ca_system_score_gemma":0.0010162726,"threshold_uncertainty_score":0.023842037},"labels":[],"label_agreement":null},{"id":"W1597684374","doi":"10.1007/978-3-642-27901-0_10","title":"Preventing the Cluster Formation Attack against the Hierarchical OLSR Protocol","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Carleton University","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Scalability; Mobile ad hoc network; Node (physics); Routing protocol; Wireless ad hoc network; Distributed computing; Ad hoc wireless distribution service; Routing (electronic design automation); Network packet; Wireless; Engineering","score_opus":0.023231472797339725,"score_gpt":0.27414175126845264,"score_spread":0.2509102784711129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597684374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31099108,0.002549836,0.6420021,0.0014464945,0.0004436904,0.00040322717,0.00011383605,0.004190533,0.03785928],"genre_scores_gemma":[0.9453821,0.0005779971,0.04617132,0.00017193376,0.00008500995,0.00007168175,0.0000869398,0.000073336225,0.007379661],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874437,0.00030218196,0.00004866446,0.00007977626,0.00061391783,0.00021105741],"domain_scores_gemma":[0.99808466,0.0006493046,0.0002874564,0.0006166623,0.0002919865,0.00006991636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010056099,0.0004966607,0.00049474445,0.00074212626,0.00075773365,0.0006760387,0.0010607206,0.00080302777,0.0011005014],"category_scores_gemma":[0.002755394,0.00029103248,0.0003090597,0.00041535537,0.0006403405,0.0011890716,0.0022199252,0.0011950977,0.00059053616],"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.0012987806,0.00040150285,0.0036844555,0.0006189217,0.00027897014,0.0010846523,0.0011183468,0.14451154,0.18456376,0.11650835,0.022682734,0.52324796],"study_design_scores_gemma":[0.00012387084,0.0008201519,0.003019803,0.00007759375,0.00019774352,0.0014063813,0.00037974198,0.8386631,0.100994505,0.031861827,0.022363108,0.000092154354],"about_ca_topic_score_codex":0.00097401463,"about_ca_topic_score_gemma":0.00088444276,"teacher_disagreement_score":0.0011005014,"about_ca_system_score_codex":0.0003951892,"about_ca_system_score_gemma":0.0008314268,"threshold_uncertainty_score":0.0053182244},"labels":[],"label_agreement":null},{"id":"W1597703390","doi":"10.1007/11604686_18","title":"Ultimate Generalizations of LexBFS and LEX M","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Chordal graph; Graph; Combinatorics; Set (abstract data type); Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.023247366250803928,"score_gpt":0.2896899513063959,"score_spread":0.266442585055592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597703390","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.07171588,0.0050783427,0.4823138,0.007279193,0.0011894538,0.00007339944,0.0015075827,0.0024558175,0.42838648],"genre_scores_gemma":[0.7686783,0.0034476568,0.10242814,0.002394156,0.0018918824,0.00019584922,0.0021483907,0.00083165657,0.11798396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991141,0.0002444982,0.0000825048,0.00023110924,0.00018984148,0.00013787154],"domain_scores_gemma":[0.99891865,0.00048557206,0.00008961064,0.00021804946,0.00019817178,0.00008987681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010769048,0.00074538763,0.0007912155,0.002095836,0.0026899944,0.002978694,0.0012081458,0.0012493435,0.011330215],"category_scores_gemma":[0.0031623514,0.0007421393,0.0016757207,0.0025958205,0.0029685264,0.0109795,0.0033258672,0.0040811934,0.0024811092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001828589,0.0000071821682,0.00008638298,0.000033352586,0.0000041573026,0.000034483222,0.00015160974,0.0002549589,0.0002360808,0.9864411,0.0034078215,0.009324652],"study_design_scores_gemma":[0.0000033642411,0.0000044827275,0.000057680776,0.000008997254,0.0000050776534,0.00003924888,0.000040120976,0.00052546326,0.00019036137,0.9898837,0.009236048,0.00000542673],"about_ca_topic_score_codex":0.0020983107,"about_ca_topic_score_gemma":0.002247179,"teacher_disagreement_score":0.011330215,"about_ca_system_score_codex":0.0017553195,"about_ca_system_score_gemma":0.0008354473,"threshold_uncertainty_score":0.03790337},"labels":[],"label_agreement":null},{"id":"W1597806222","doi":"10.1007/3-540-45655-4_35","title":"Repetition Complexity of Words","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Repetition (rhetorical device); De Bruijn sequence; Word (group theory); Iterated function; Computational complexity theory; Morphism; Logarithm; Time complexity; Complexity class; Combinatorics on words; Combinatorics; Discrete mathematics; Mathematics; Prefix; Computer science; Arithmetic; Algorithm","score_opus":0.035674482716048415,"score_gpt":0.2534903773255783,"score_spread":0.21781589460952985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597806222","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.5074577,0.0030728194,0.15520489,0.004359839,0.00042845268,0.00012079232,0.0014359143,0.0008497254,0.32706988],"genre_scores_gemma":[0.928985,0.0011238392,0.019686004,0.00035816187,0.0005729057,0.0001798543,0.0009839771,0.00032804997,0.04778223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838006,0.00027680217,0.00009991208,0.000312051,0.00068446505,0.00024672982],"domain_scores_gemma":[0.99500483,0.003228099,0.0003750191,0.0006922752,0.00041936905,0.0002803705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235865,0.0005851396,0.0010756518,0.0027063373,0.0016794477,0.0035525362,0.0016256844,0.0011650076,0.017907789],"category_scores_gemma":[0.0058970866,0.0005950437,0.0011096785,0.0031347852,0.0026929395,0.007981815,0.0027317333,0.003177512,0.0022133864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007092689,0.000018958144,0.0004402164,0.00007662154,0.000013325522,0.00010771797,0.0003986367,0.0023252484,0.0012205718,0.97631425,0.0036583003,0.015355271],"study_design_scores_gemma":[0.000008116544,0.000014370334,0.00030197614,0.00000951012,0.000011385141,0.00014748334,0.00005085027,0.0047122533,0.00070806185,0.9904522,0.003570442,0.000013317257],"about_ca_topic_score_codex":0.0010682055,"about_ca_topic_score_gemma":0.0009807574,"teacher_disagreement_score":0.017907789,"about_ca_system_score_codex":0.0017332697,"about_ca_system_score_gemma":0.0008248971,"threshold_uncertainty_score":0.059907556},"labels":[],"label_agreement":null},{"id":"W1597907781","doi":"10.1007/11783183_33","title":"Perceiving Relationships: A Physiological Examination of the Perception of Scatterplots","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bivariate analysis; Readability; Computer science; Perception; Cognitive psychology; Artificial intelligence; Pattern recognition (psychology); Psychology; Machine learning; Neuroscience","score_opus":0.03916538226403094,"score_gpt":0.2784495025827133,"score_spread":0.23928412031868235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597907781","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.9345374,0.0014880514,0.045789015,0.0005438487,0.00015880467,0.00011839485,0.0005584495,0.00027363206,0.016532384],"genre_scores_gemma":[0.9766526,0.00091235177,0.019844426,0.00018674317,0.000066631066,0.000058762413,0.00018389027,0.00015781284,0.0019368117],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99967813,0.00008431019,0.000011615587,0.0000844871,0.00011802361,0.000023495524],"domain_scores_gemma":[0.9985039,0.0008783452,0.00023399286,0.0000991514,0.00017840498,0.00010615422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004853304,0.00024853038,0.00022944457,0.0004682591,0.00029459232,0.0016937412,0.00036166143,0.0006190416,0.0032238446],"category_scores_gemma":[0.006968925,0.00028903518,0.00022881388,0.00053793815,0.0006502086,0.0015856706,0.0007680287,0.000863456,0.00026775763],"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.00090624654,0.00021657239,0.025213202,0.00079618115,0.0002041933,0.0006962061,0.038095124,0.0017024028,0.80076885,0.0111582335,0.004108506,0.116134174],"study_design_scores_gemma":[0.0000780433,0.0013656819,0.88143325,0.00033629508,0.00018651434,0.0025423937,0.018381482,0.016823426,0.039073374,0.024674501,0.014890491,0.00021456288],"about_ca_topic_score_codex":0.0012371805,"about_ca_topic_score_gemma":0.00092868257,"teacher_disagreement_score":0.0032238446,"about_ca_system_score_codex":0.00013729518,"about_ca_system_score_gemma":0.00021192415,"threshold_uncertainty_score":0.010784805},"labels":[],"label_agreement":null},{"id":"W1597913417","doi":"10.1007/11496137_8","title":"Mitigating Network Denial-of-Service Through Diversity-Based Traffic Management","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network traffic control; Computer network; Denial-of-service attack; Network packet; Bandwidth (computing); Bandwidth management; Traffic shaping; Distributed computing; The Internet; World Wide Web","score_opus":0.016453718965851193,"score_gpt":0.22388204763876293,"score_spread":0.20742832867291175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597913417","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.11816901,0.0028403546,0.8638327,0.0007879392,0.0003094871,0.000061408435,0.000042391483,0.0013250612,0.012631523],"genre_scores_gemma":[0.9507477,0.00081333495,0.045593992,0.00017445613,0.00032223412,0.000029041383,0.000039488026,0.00004532457,0.0022343528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993375,0.000116165975,0.000020113825,0.00009068299,0.00024872588,0.00018675065],"domain_scores_gemma":[0.9983619,0.00075771427,0.00017106225,0.00017764179,0.00043323697,0.00009849629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084183697,0.00075687014,0.0009726088,0.0010684361,0.0010542796,0.001115867,0.0015440396,0.00080378674,0.0013535932],"category_scores_gemma":[0.0021390386,0.00025772344,0.0003238234,0.00086517935,0.0009109231,0.0016836486,0.0015318358,0.0012915572,0.0003901469],"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.00055300735,0.00033804582,0.0018981994,0.0002155003,0.00017562608,0.00025793558,0.0003515678,0.24683622,0.17320608,0.050471187,0.005404147,0.5202925],"study_design_scores_gemma":[0.000051858362,0.0003767335,0.0011596668,0.00005495742,0.00013932295,0.0008632542,0.00011608662,0.8908468,0.045641262,0.053654883,0.0070317695,0.0000634037],"about_ca_topic_score_codex":0.0005597912,"about_ca_topic_score_gemma":0.0010409267,"teacher_disagreement_score":0.0015440396,"about_ca_system_score_codex":0.0008263427,"about_ca_system_score_gemma":0.00044902472,"threshold_uncertainty_score":0.0059955716},"labels":[],"label_agreement":null},{"id":"W1598101953","doi":"10.1007/978-3-642-39931-2_14","title":"Summarization of Legal Texts with High Cohesion and Automatic Compression Rate","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Alberta","funders":"","keywords":"Automatic summarization; Computer science; Exploit; Centroid; Artificial intelligence; Cohesion (chemistry); Cluster analysis; Weighting; Natural language processing; Graph; Sentence; Theoretical computer science; Data mining","score_opus":0.006764947891861104,"score_gpt":0.2258325785188064,"score_spread":0.2190676306269453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598101953","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.25117704,0.004758748,0.70326334,0.0013926345,0.0008839595,0.00082380587,0.0071063954,0.016295563,0.01429851],"genre_scores_gemma":[0.42560202,0.0015906825,0.52618617,0.00022463196,0.0010460493,0.0005148808,0.026953904,0.0013931345,0.016488502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993231,0.00021994238,0.0000781318,0.00010952558,0.00021376707,0.000055598954],"domain_scores_gemma":[0.99733764,0.0010924832,0.00021997899,0.00029158997,0.0009827254,0.00007551502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059722946,0.00093339605,0.0008359386,0.0025457127,0.00059157045,0.0009719285,0.0005920821,0.00076187996,0.007418735],"category_scores_gemma":[0.003948125,0.0003099591,0.000550919,0.0019499339,0.00024844747,0.0011164746,0.00060624554,0.00059359387,0.0038645584],"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.00089192815,0.00019991619,0.000956039,0.0012180457,0.00013918626,0.0008856883,0.00060426496,0.010040648,0.14288786,0.004155998,0.03521524,0.8028051],"study_design_scores_gemma":[0.00042531668,0.001404615,0.011744222,0.00027988985,0.00095543877,0.0019274008,0.0012298711,0.52924687,0.33907074,0.017359952,0.09621031,0.00014550032],"about_ca_topic_score_codex":0.0008718491,"about_ca_topic_score_gemma":0.0015523363,"teacher_disagreement_score":0.007418735,"about_ca_system_score_codex":0.00027733337,"about_ca_system_score_gemma":0.0005575327,"threshold_uncertainty_score":0.024818122},"labels":[],"label_agreement":null},{"id":"W1598137424","doi":"10.1007/3-540-45517-5_99","title":"Deciding on a Pattern","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering and Design Patterns","field":"Social 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":"Carleton University","funders":"","keywords":"Computer science; Software design pattern; Context (archaeology); Software; Design pattern; Software engineering; Software development; Decision support system; Behavioral pattern; Artificial intelligence; Data mining; Human–computer interaction; Programming language","score_opus":0.02857065262442213,"score_gpt":0.27703308321480286,"score_spread":0.24846243059038073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598137424","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.1571247,0.0004982452,0.67206687,0.013143866,0.0012190192,0.0015013716,0.0028314097,0.0036401278,0.14797446],"genre_scores_gemma":[0.46997663,0.0006202244,0.45194128,0.0018510178,0.00048283645,0.0006644373,0.0058984873,0.0016002291,0.06696493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626356,0.00059206726,0.00036652703,0.0012663556,0.0010780885,0.00043336995],"domain_scores_gemma":[0.99275947,0.0040068207,0.00024731265,0.0016126658,0.0009531007,0.00042068696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111416,0.0007148086,0.0008190196,0.0017094446,0.0015193044,0.003426084,0.0016431864,0.0018404346,0.038461097],"category_scores_gemma":[0.013048131,0.00076646253,0.0020671634,0.001201877,0.0017468284,0.0111309895,0.0033314072,0.00293785,0.0069177467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007932966,0.00055886625,0.008015906,0.0007884056,0.0001922728,0.0008616649,0.0009560009,0.0036204436,0.029616578,0.36143085,0.043558974,0.54960674],"study_design_scores_gemma":[0.00013832164,0.00038304503,0.0026720292,0.00026399412,0.00028586344,0.00095151603,0.001923385,0.04291414,0.026909485,0.8170136,0.1064539,0.00009068094],"about_ca_topic_score_codex":0.0013737704,"about_ca_topic_score_gemma":0.0024414675,"teacher_disagreement_score":0.038461097,"about_ca_system_score_codex":0.000825678,"about_ca_system_score_gemma":0.0017723857,"threshold_uncertainty_score":0.12866515},"labels":[],"label_agreement":null},{"id":"W1598187630","doi":"10.1007/978-3-540-78913-0_21","title":"Cardinality in Allegories","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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":"Brock University","funders":"","keywords":"Allegory; Cardinality (data modeling); Injective function; Mathematics; Axiom; Surjective function; Context (archaeology); Uniqueness; Function (biology); Discrete mathematics; Combinatorics; Computer science; Geometry; Geography; Mathematical analysis","score_opus":0.020434325466337083,"score_gpt":0.24559236156755584,"score_spread":0.22515803610121876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598187630","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.070200555,0.0043937196,0.19510762,0.008211125,0.001401807,0.00012690475,0.0012528418,0.0007079704,0.7185974],"genre_scores_gemma":[0.79802406,0.0040170276,0.05716429,0.0009470155,0.0016461379,0.0003432227,0.0014719308,0.000664228,0.13572201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979126,0.00064494775,0.00019526143,0.00039010428,0.00058756204,0.0002695924],"domain_scores_gemma":[0.9972433,0.0016094104,0.00014561105,0.0005864696,0.00026415303,0.00015100474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606622,0.0007682172,0.00132483,0.0025595534,0.004300617,0.006706792,0.0014268387,0.0017597325,0.018692615],"category_scores_gemma":[0.0052380688,0.0011874252,0.0011873381,0.0039489237,0.00795526,0.019773893,0.0047829016,0.006160339,0.0029751982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005951386,0.0000044844573,0.00004743911,0.000017477321,0.0000019334298,0.000012552526,0.00021954898,0.00012274577,0.00006275414,0.99418503,0.0013067465,0.0040132594],"study_design_scores_gemma":[0.0000034257412,0.0000030671645,0.0000716098,0.000020805188,0.0000051454676,0.000050752034,0.00009117915,0.00027820523,0.00012333256,0.9810947,0.018250903,0.0000068736454],"about_ca_topic_score_codex":0.0010409446,"about_ca_topic_score_gemma":0.001234732,"teacher_disagreement_score":0.018692615,"about_ca_system_score_codex":0.002662386,"about_ca_system_score_gemma":0.0010092763,"threshold_uncertainty_score":0.06253302},"labels":[],"label_agreement":null},{"id":"W1598203455","doi":"10.1007/978-3-540-27812-2_14","title":"Substitution on Trajectories","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Saint Mary's University; Western University","funders":"","keywords":"Substitution (logic); Computer science; Closure (psychology); Cryptanalysis; Word (group theory); Theoretical computer science; Class (philosophy); Binary number; Algorithm; Artificial intelligence; Programming language; Arithmetic; Cryptography; Mathematics","score_opus":0.01619292755635701,"score_gpt":0.24390310888693942,"score_spread":0.2277101813305824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598203455","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10103148,0.0025124731,0.38271955,0.0037788644,0.0022423721,0.00014518756,0.0009465482,0.0012143811,0.5054091],"genre_scores_gemma":[0.6434976,0.002142904,0.07689377,0.00078576896,0.00069960154,0.0002056358,0.0012149047,0.0013628214,0.27319705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996207,0.000092794355,0.000016765774,0.000077105724,0.00012708172,0.00006557471],"domain_scores_gemma":[0.9995819,0.0001454817,0.000030370924,0.0001086477,0.00007806287,0.00005551299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033996816,0.00074281817,0.00084138947,0.0012029284,0.0013448212,0.0015083158,0.00074827106,0.001180869,0.027022118],"category_scores_gemma":[0.0019162109,0.00034984425,0.0007942262,0.0010389284,0.0014828058,0.0023802095,0.0016096836,0.0017885342,0.0038325307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015810414,0.000006107887,0.00004272323,0.000018940787,0.000003951895,0.000032005177,0.00003822774,0.001466818,0.00043057246,0.98763204,0.0023814803,0.007931305],"study_design_scores_gemma":[0.000008665308,0.0000075636335,0.00005395522,0.000011085043,0.0000027353958,0.000054087053,0.000023121573,0.008799304,0.00047899995,0.9796901,0.010864924,0.0000054994703],"about_ca_topic_score_codex":0.0016411594,"about_ca_topic_score_gemma":0.0010968978,"teacher_disagreement_score":0.027022118,"about_ca_system_score_codex":0.0011474327,"about_ca_system_score_gemma":0.00063391705,"threshold_uncertainty_score":0.09039801},"labels":[],"label_agreement":null},{"id":"W1598367376","doi":"10.1007/978-3-642-01818-3_34","title":"A Procedural Planning System for Goal Oriented Agents in Games","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning 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":"Concordia University","funders":"","keywords":"Computer science; Animation; Control (management); Order (exchange); Human–computer interaction; Artificial intelligence; Computer graphics (images)","score_opus":0.027415890295474032,"score_gpt":0.27957412465738435,"score_spread":0.2521582343619103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598367376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031007244,0.000039494797,0.9774909,0.000060840048,0.000030266294,0.00011185791,0.00017567686,0.01470252,0.004287647],"genre_scores_gemma":[0.077512525,0.00012305944,0.91292655,0.00010364225,0.000016932998,0.00043643548,0.00075475447,0.0011334658,0.006992714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997056,0.00005821673,0.00003443633,0.000057589205,0.00010806444,0.00003597124],"domain_scores_gemma":[0.99971634,0.00012119776,0.000015996084,0.00006664692,0.000043985012,0.00003588785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059172726,0.00067242206,0.00056845724,0.00045355267,0.00071272446,0.0014094261,0.0024286567,0.0009951527,0.011614083],"category_scores_gemma":[0.0013810818,0.0007011146,0.00079920737,0.00042996503,0.0006810796,0.0010481996,0.0019590287,0.0014141472,0.003058273],"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.0007217519,0.0004509459,0.00084452797,0.0005552577,0.0001180531,0.00050721376,0.0012546205,0.16123095,0.04308555,0.24504694,0.041721188,0.50446296],"study_design_scores_gemma":[0.00025176487,0.00014065536,0.00027785773,0.0000710815,0.00009331234,0.00018594116,0.00007781859,0.8182322,0.019241726,0.08321264,0.07816041,0.00005454443],"about_ca_topic_score_codex":0.0040190523,"about_ca_topic_score_gemma":0.004786787,"teacher_disagreement_score":0.011614083,"about_ca_system_score_codex":0.00045657912,"about_ca_system_score_gemma":0.0012107949,"threshold_uncertainty_score":0.03885299},"labels":[],"label_agreement":null},{"id":"W1598379535","doi":"10.1007/978-3-540-76336-9_11","title":"Deterministic Caterpillar Expressions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University; Queen's University","funders":"","keywords":"Caterpillar; Determinism; Expression (computer science); Regular expression; Automaton; Markup language; Tree (set theory); Computer science; Programming language; Mathematics; Algebra over a field; Theoretical computer science; Combinatorics; Pure mathematics; Biology; World Wide Web; Physics; XML; Botany","score_opus":0.022281807377359526,"score_gpt":0.2639599130271646,"score_spread":0.24167810564980508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598379535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04931977,0.0009311656,0.66556144,0.0009893177,0.0004937231,0.00011222048,0.0006527563,0.0023316192,0.27960798],"genre_scores_gemma":[0.6824521,0.0013862858,0.13703011,0.0004861473,0.00022958916,0.00019277926,0.0010269934,0.00082957663,0.17636652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995696,0.00006626614,0.00002741049,0.0000981671,0.00014621139,0.00009234073],"domain_scores_gemma":[0.99959415,0.00016871472,0.000027760687,0.00009787066,0.0000891415,0.00002241114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034644592,0.00046474612,0.00036343292,0.000417805,0.00082529255,0.0014434061,0.0007749866,0.0006004754,0.01256027],"category_scores_gemma":[0.0012509843,0.00036278352,0.00048658974,0.00084520876,0.0011829298,0.0019719359,0.0011038003,0.00089848967,0.0035067964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044178683,0.000009216303,0.000044991295,0.000051155097,0.0000038857393,0.000063371095,0.00012261176,0.0020223844,0.0033677937,0.96274346,0.004291644,0.02723531],"study_design_scores_gemma":[0.000024961859,0.00003646116,0.000111519774,0.000042413147,0.000021825943,0.00024586127,0.00008280304,0.013683432,0.012400662,0.89111155,0.08220508,0.000033434942],"about_ca_topic_score_codex":0.00039461773,"about_ca_topic_score_gemma":0.00054770004,"teacher_disagreement_score":0.01256027,"about_ca_system_score_codex":0.0009205876,"about_ca_system_score_gemma":0.00048353092,"threshold_uncertainty_score":0.042018294},"labels":[],"label_agreement":null},{"id":"W1598382901","doi":"10.1007/3-540-47977-5_50","title":"On the Representation and Matching of Qualitative Shape at Multiple Scales","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Similarity (geometry); Pattern recognition (psychology); Directed acyclic graph; Matching (statistics); Similitude; Node (physics); Artificial intelligence; ENCODE; Graph; Theoretical computer science; Feature (linguistics); Representation (politics); Set (abstract data type); Algorithm; Mathematics; Image (mathematics)","score_opus":0.05896304604264026,"score_gpt":0.34020805643383883,"score_spread":0.2812450103911986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598382901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042907163,0.00031779235,0.99357116,0.00011556575,0.000035642188,0.00005087321,0.00006820851,0.0004976737,0.0010523238],"genre_scores_gemma":[0.11530593,0.0014496751,0.8770377,0.00026850632,0.00012272278,0.00012668943,0.00058508635,0.0005480368,0.004555697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845195,0.0003778546,0.000118890195,0.0002987577,0.0006299051,0.00012259938],"domain_scores_gemma":[0.9967879,0.0014191712,0.00019516658,0.00097042427,0.0005173533,0.0001100315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023438458,0.0010090811,0.001950459,0.002627002,0.00070114696,0.002836001,0.003622797,0.0025345122,0.005249789],"category_scores_gemma":[0.009340165,0.0012772202,0.0014857316,0.0042514107,0.0026386431,0.004600316,0.0041122995,0.0018830424,0.0017945656],"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.0003093331,0.00008992513,0.00062531355,0.0002400507,0.00008593426,0.00013878752,0.00033025295,0.09673972,0.02768057,0.068015136,0.006097355,0.7996477],"study_design_scores_gemma":[0.000025676154,0.00007135428,0.0009189922,0.0000388166,0.0000405059,0.00023473165,0.00012541699,0.8943717,0.008573325,0.08984299,0.0057098567,0.000046739224],"about_ca_topic_score_codex":0.010304399,"about_ca_topic_score_gemma":0.007027048,"teacher_disagreement_score":0.010304399,"about_ca_system_score_codex":0.0008706233,"about_ca_system_score_gemma":0.00081089564,"threshold_uncertainty_score":0.020488799},"labels":[],"label_agreement":null},{"id":"W1598414359","doi":"10.1007/978-3-540-24647-3_9","title":"A Structural Computing Model for Dynamic Service-Based Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Distributed computing; Service (business); Extensibility; Hypermedia; Architecture; Object (grammar); Information system; Object-oriented programming; Dynamic data; Service-oriented architecture; Software engineering; Database; Web service; World Wide Web; Programming language; Artificial intelligence; Engineering","score_opus":0.016184045200951555,"score_gpt":0.2452880802473638,"score_spread":0.22910403504641225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598414359","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.0077509964,0.0010026713,0.864293,0.0034377668,0.00021743473,0.00021952683,0.00028516454,0.00078408926,0.12200932],"genre_scores_gemma":[0.3657263,0.003728129,0.5276155,0.0011932139,0.00048862083,0.0012084685,0.0012471535,0.0005209287,0.09827161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994072,0.00013024647,0.00004455678,0.00009899787,0.00024240249,0.00007663757],"domain_scores_gemma":[0.9994754,0.00016731308,0.000041787283,0.00012110282,0.00012801563,0.00006639122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559001,0.0005866636,0.0004097793,0.0012295493,0.0016047057,0.004375192,0.0017292406,0.0017403092,0.008804536],"category_scores_gemma":[0.0014754744,0.00045823684,0.00083474896,0.0022816034,0.0033916864,0.0058671236,0.0017024842,0.0025052857,0.002894552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039444994,0.000007613176,0.00005340586,0.000021808362,0.0000017300677,0.00004120687,0.0001555548,0.0044276114,0.00038715478,0.9898582,0.0012790835,0.0037625204],"study_design_scores_gemma":[0.0000141377295,0.000023745708,0.00010831512,0.00005074865,0.000009569178,0.00016113576,0.00017948396,0.07101954,0.00070107216,0.79881203,0.1289049,0.000015442787],"about_ca_topic_score_codex":0.0063903974,"about_ca_topic_score_gemma":0.0060411566,"teacher_disagreement_score":0.008804536,"about_ca_system_score_codex":0.0032450473,"about_ca_system_score_gemma":0.0026383095,"threshold_uncertainty_score":0.029454112},"labels":[],"label_agreement":null},{"id":"W159855645","doi":"10.1007/978-3-642-33826-7_8","title":"Verification of Aspectual Composition in Feature-Modeling","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"McMaster University","funders":"","keywords":"Aspect-oriented programming; Computer science; Weaving; Feature (linguistics); Context (archaeology); Software engineering; Programming language; Set (abstract data type); Separation of concerns; Formal methods; Formal verification; Software; Theoretical computer science; Engineering","score_opus":0.03961761202041255,"score_gpt":0.28358494643059523,"score_spread":0.24396733441018267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159855645","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.016587507,0.00006687793,0.97874933,0.00008364024,0.00003205413,0.000120751785,0.000062029896,0.0024820184,0.0018157588],"genre_scores_gemma":[0.4620047,0.00022105729,0.5333043,0.00013494043,0.000055451474,0.00022845689,0.0004668799,0.0010343217,0.0025498546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918656,0.00253457,0.0005843744,0.0009667222,0.0033980333,0.0006507334],"domain_scores_gemma":[0.98772556,0.0069053452,0.0007875956,0.002988223,0.0014303315,0.00016283782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006404,0.0012039819,0.0012266238,0.0009125168,0.0009805084,0.0023421329,0.00337581,0.0017034506,0.0041770083],"category_scores_gemma":[0.01786938,0.0015262528,0.0033858344,0.0007036666,0.0027375892,0.004038626,0.0037463675,0.0025116568,0.0011198614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096600957,0.00047139253,0.006614941,0.0013986119,0.00045968208,0.0014832396,0.0011159128,0.2934837,0.05669298,0.35472924,0.0034887611,0.2790956],"study_design_scores_gemma":[0.00011317307,0.0001473359,0.0007635522,0.00015758624,0.00020816943,0.0003925238,0.00010571478,0.81062317,0.057289813,0.12254245,0.0076050363,0.000051533756],"about_ca_topic_score_codex":0.0036349539,"about_ca_topic_score_gemma":0.0035594127,"teacher_disagreement_score":0.006404,"about_ca_system_score_codex":0.0010966961,"about_ca_system_score_gemma":0.002595412,"threshold_uncertainty_score":0.033867955},"labels":[],"label_agreement":null},{"id":"W1598558921","doi":"10.1007/978-3-540-71289-3_27","title":"Finding Environment Guarantees","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Component (thermodynamics); Computer science; Property (philosophy); Model checking; Distributed computing; Theoretical computer science; Programming language","score_opus":0.04373042902772654,"score_gpt":0.2901269383810395,"score_spread":0.24639650935331295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598558921","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.037317064,0.0013505152,0.84553766,0.002901311,0.00048463236,0.0001527856,0.0009337133,0.0036188082,0.10770353],"genre_scores_gemma":[0.5366481,0.0017030672,0.3875841,0.00092558714,0.00046376334,0.00027519974,0.002918768,0.0031539486,0.066327535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617946,0.0005985837,0.00019321645,0.0010545452,0.0014143711,0.0005598656],"domain_scores_gemma":[0.9909642,0.00506399,0.00034642196,0.0027315,0.0006448814,0.00024912716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022530463,0.0013272214,0.0015346089,0.0021514497,0.0018908799,0.0042550457,0.0032573703,0.0021694954,0.025963483],"category_scores_gemma":[0.016336542,0.0017632776,0.0021837584,0.0018821043,0.003209943,0.013323587,0.00649414,0.0067237252,0.005527574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002846109,0.0001236762,0.0010741963,0.00031847163,0.00006707986,0.00026116366,0.00050617516,0.013388909,0.003639786,0.8055191,0.016630853,0.15818599],"study_design_scores_gemma":[0.000023869006,0.00003686339,0.00026640669,0.00007870123,0.000051559855,0.00013290458,0.00020723349,0.029140636,0.0041836672,0.94493663,0.020917859,0.00002367657],"about_ca_topic_score_codex":0.0010100597,"about_ca_topic_score_gemma":0.0014963875,"teacher_disagreement_score":0.025963483,"about_ca_system_score_codex":0.0013909691,"about_ca_system_score_gemma":0.0015485672,"threshold_uncertainty_score":0.086856484},"labels":[],"label_agreement":null},{"id":"W1598641709","doi":"10.1007/978-3-540-73066-8_23","title":"An EFSM-Based Passive Fault Detection Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Government of Ontario","keywords":"Computer science; Extended finite-state machine; Fault detection and isolation; Fault (geology); Finite-state machine; Artificial intelligence; Algorithm","score_opus":0.027082481015822873,"score_gpt":0.2738637657798862,"score_spread":0.24678128476406333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598641709","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.008460193,0.00017912549,0.98598516,0.00008329291,0.000062271814,0.00004564201,0.00004065389,0.0016363133,0.003507331],"genre_scores_gemma":[0.4011794,0.00025668446,0.58786076,0.0002916346,0.00007539215,0.000101832855,0.00022806769,0.00021598225,0.0097902715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992105,0.00015985053,0.000044204156,0.00015748503,0.00034688215,0.00008115941],"domain_scores_gemma":[0.9983664,0.000529454,0.00010391013,0.0004114753,0.00054803054,0.000040745734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008261923,0.00096671376,0.0008577789,0.0013179453,0.00048413582,0.0008297212,0.0022512947,0.0010827777,0.003560766],"category_scores_gemma":[0.0020211095,0.00035418253,0.0005789845,0.0005921318,0.00063475006,0.0018860203,0.0011611322,0.0009839596,0.0010343322],"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.0004816421,0.0004401293,0.001506659,0.00043316363,0.000106472304,0.0003795214,0.00021452236,0.06450698,0.08724889,0.057296928,0.004902532,0.78248245],"study_design_scores_gemma":[0.000057521615,0.0003483757,0.0007612854,0.00008196399,0.0001324087,0.0006643913,0.000060421185,0.8831551,0.04523773,0.05772356,0.011737185,0.00004009663],"about_ca_topic_score_codex":0.0009517274,"about_ca_topic_score_gemma":0.0017876261,"teacher_disagreement_score":0.003560766,"about_ca_system_score_codex":0.00038142662,"about_ca_system_score_gemma":0.0007036113,"threshold_uncertainty_score":0.011911929},"labels":[],"label_agreement":null},{"id":"W1598706676","doi":"10.1007/3-540-44674-5_23","title":"State Complexity and Jacobsthal’s Function","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Alphabet; State (computer science); Connection (principal bundle); Function (biology); Theoretical computer science; Algorithm; Mathematics","score_opus":0.023085554994154576,"score_gpt":0.23324748797773917,"score_spread":0.2101619329835846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598706676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24230728,0.003743506,0.40836346,0.012612646,0.0006925645,0.0001636871,0.00063489896,0.0007201072,0.33076176],"genre_scores_gemma":[0.93191826,0.0012077601,0.023076734,0.000507885,0.00053820544,0.00018225584,0.00023039232,0.00023984807,0.042098645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835265,0.00035100538,0.00012602052,0.0003619072,0.0004833404,0.0003251679],"domain_scores_gemma":[0.9926479,0.005530125,0.00023440097,0.00083063694,0.0004770317,0.00027996523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637337,0.00077804667,0.0016331868,0.0025778238,0.0028801728,0.0045112036,0.0015863094,0.0019378719,0.012366826],"category_scores_gemma":[0.008227409,0.0007343426,0.0019563418,0.0029486753,0.005992125,0.01629394,0.0037308445,0.005066698,0.0013481978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016451933,0.0000084519315,0.00006099585,0.000020127422,0.0000037882594,0.000013906018,0.00013367491,0.0008745101,0.0001601566,0.99443144,0.0007439715,0.0035325333],"study_design_scores_gemma":[0.0000052517375,0.0000061565315,0.000069343536,0.0000054128723,0.000005978262,0.000024684276,0.000024228364,0.00390683,0.0002583415,0.993979,0.0017064253,0.000008427438],"about_ca_topic_score_codex":0.0015770985,"about_ca_topic_score_gemma":0.000854401,"teacher_disagreement_score":0.012366826,"about_ca_system_score_codex":0.003949325,"about_ca_system_score_gemma":0.0013212954,"threshold_uncertainty_score":0.041371167},"labels":[],"label_agreement":null},{"id":"W1598768215","doi":"10.1007/3-540-70659-3_90","title":"Hierarchical Multiscale Modeling of Wavelet-Based Correlations","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Bayesian probability; Computer science; Statistical model; Context (archaeology); Multilevel model; Mathematics; Pattern recognition (psychology); Artificial intelligence; Statistical physics; Machine learning; Geology; Physics","score_opus":0.0332423490373789,"score_gpt":0.2697400059003011,"score_spread":0.2364976568629222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598768215","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.02536666,0.00040230632,0.9724091,0.0000935566,0.000033131153,0.000014353924,0.000097134674,0.00016161769,0.0014220648],"genre_scores_gemma":[0.7724426,0.0018805615,0.21929322,0.000101773054,0.00014291768,0.00009600814,0.00043410974,0.00022424936,0.0053846217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997844,0.00005486443,0.000011839629,0.000049202914,0.00006795618,0.000031837273],"domain_scores_gemma":[0.99925524,0.00031704092,0.0001298379,0.00012661653,0.00012796326,0.000043326232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071694364,0.0005260487,0.000710006,0.0008616097,0.00027295604,0.0010591071,0.0011927935,0.0008419132,0.0015106479],"category_scores_gemma":[0.0030565422,0.0005882285,0.0007761232,0.001188129,0.00052057434,0.0014508595,0.00073839055,0.00092939025,0.00035500329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097767836,0.00005816472,0.0010304197,0.00015618728,0.000110278976,0.00020941684,0.00016663143,0.66331506,0.023027921,0.22866836,0.0021229044,0.08103685],"study_design_scores_gemma":[0.000002344032,0.000007592622,0.00025515843,0.0000041564085,0.000010005503,0.00002146467,0.000005037117,0.9859702,0.00040352874,0.013046681,0.0002676017,0.0000061465416],"about_ca_topic_score_codex":0.0023221415,"about_ca_topic_score_gemma":0.003382007,"teacher_disagreement_score":0.0023221415,"about_ca_system_score_codex":0.00041594834,"about_ca_system_score_gemma":0.00051249063,"threshold_uncertainty_score":0.0050536394},"labels":[],"label_agreement":null},{"id":"W1598811766","doi":"10.1007/978-3-642-04474-8_12","title":"Iris Recognition in Nonideal Situations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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":"Concordia University","funders":"","keywords":"Computer science; Iris recognition; IRIS (biosensor); Artificial intelligence; Motion blur; Biometrics; Feature (linguistics); Process (computing); Computer vision; Set (abstract data type); Pattern recognition (psychology); Gaze; Genetic algorithm; Algorithm; Image (mathematics); Machine learning","score_opus":0.03253299032054413,"score_gpt":0.26267220089363635,"score_spread":0.23013921057309222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598811766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09110206,0.0048291213,0.82880825,0.0007134297,0.00034204428,0.00005351447,0.00016028527,0.0009088382,0.073082455],"genre_scores_gemma":[0.8567904,0.0038462207,0.10625233,0.000111758876,0.00027640944,0.000039739934,0.000222632,0.00014062277,0.032319993],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924845,0.00019799177,0.00003265816,0.0001368298,0.00028978885,0.0000941884],"domain_scores_gemma":[0.99902797,0.0005330605,0.00006920037,0.00022061341,0.00011691252,0.00003224558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857011,0.0003547602,0.00067198067,0.0003803148,0.00045215935,0.0010337319,0.0006140071,0.00068296684,0.005316649],"category_scores_gemma":[0.0029949169,0.00033201565,0.00029982065,0.00047585004,0.0011321057,0.0018448498,0.0016004483,0.000680292,0.0025907664],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012284459,0.000105060564,0.004816264,0.0009266908,0.00006536424,0.0021919685,0.00071134843,0.08887704,0.116072014,0.12874575,0.012688071,0.643572],"study_design_scores_gemma":[0.00003206217,0.00034084546,0.00675495,0.00019254224,0.0000723661,0.007655022,0.0006923497,0.72845894,0.122458965,0.10021857,0.03301684,0.00010665946],"about_ca_topic_score_codex":0.00035562215,"about_ca_topic_score_gemma":0.00041713082,"teacher_disagreement_score":0.005316649,"about_ca_system_score_codex":0.00023326614,"about_ca_system_score_gemma":0.00017273454,"threshold_uncertainty_score":0.017785966},"labels":[],"label_agreement":null},{"id":"W1598811966","doi":"10.1007/978-3-540-39762-5_48","title":"Power-Aware Branch Predictor Update for High-Performance Processors","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Branch predictor; Computer science; Spec#; Energy consumption; Power consumption; Predictive power; Power (physics); Parallel computing","score_opus":0.01035047317748304,"score_gpt":0.23566915186015308,"score_spread":0.22531867868267005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598811966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15711655,0.005443187,0.81451756,0.00071978965,0.00067771954,0.00008353366,0.00025756424,0.009575538,0.011608499],"genre_scores_gemma":[0.74159646,0.0012124992,0.23944059,0.0002105481,0.00020618392,0.00006343403,0.00044594804,0.00043715932,0.016387252],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975234,0.000043465763,0.000012385071,0.000030207884,0.00012708368,0.000034551267],"domain_scores_gemma":[0.9991142,0.0003455804,0.00006958263,0.0001613835,0.00027192684,0.000037385038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028379867,0.00054543646,0.00054758525,0.00059500936,0.00041934798,0.0005552563,0.0011184515,0.00034462954,0.0042975126],"category_scores_gemma":[0.001936127,0.0003821795,0.00017570236,0.0008944661,0.00014379896,0.00086363335,0.00041330312,0.0009585927,0.0006167879],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000633552,0.000190546,0.003062435,0.00016256521,0.000069983806,0.00009230182,0.00008005759,0.0963016,0.032658372,0.003013085,0.011912682,0.8518228],"study_design_scores_gemma":[0.000058103044,0.00014554472,0.0018638058,0.000030348607,0.000063527164,0.000108049135,0.000026619633,0.95475614,0.034987994,0.0034909935,0.0044517787,0.000017073486],"about_ca_topic_score_codex":0.0024762824,"about_ca_topic_score_gemma":0.0143035315,"teacher_disagreement_score":0.0042975126,"about_ca_system_score_codex":0.0003082167,"about_ca_system_score_gemma":0.00086794,"threshold_uncertainty_score":0.01437664},"labels":[],"label_agreement":null},{"id":"W1598867843","doi":"10.1007/978-3-642-03816-7_18","title":"DP-Complete Problems Derived from Extremal NP-Complete Properties","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Alberta","funders":"","keywords":"NP-complete; Implicant; Combinatorics; Computer science; Mathematics; Contrast (vision); Degree (music); Discrete mathematics; Time complexity; Artificial intelligence; Physics; Boolean function","score_opus":0.05478918288468504,"score_gpt":0.2595776014824834,"score_spread":0.20478841859779834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598867843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07554825,0.003358731,0.5110561,0.007808073,0.0009325511,0.0003710274,0.002017163,0.0008862691,0.39802194],"genre_scores_gemma":[0.68091017,0.0039011089,0.24264397,0.0017797147,0.0016486543,0.0007417919,0.0052835536,0.0010564114,0.062034696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987796,0.00026668733,0.00008496035,0.00028773557,0.0004048509,0.00017612036],"domain_scores_gemma":[0.99586785,0.0030243294,0.00018395198,0.0004380859,0.00032648823,0.00015927706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615282,0.00092469336,0.0012111305,0.0015139356,0.0018514548,0.0034893437,0.002519094,0.0018160744,0.010734909],"category_scores_gemma":[0.0069107665,0.0009063183,0.0018733381,0.0025132475,0.0024072519,0.007642282,0.0029487244,0.011370384,0.001496426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006023476,0.00006952789,0.00013647985,0.0002904999,0.000021653266,0.000076789096,0.00014248004,0.0066497494,0.00095717906,0.9547614,0.0102692135,0.02656485],"study_design_scores_gemma":[0.000021003087,0.000012891367,0.00013061283,0.000044342345,0.000018638963,0.00014845736,0.000067884204,0.012125204,0.0009333993,0.9767443,0.0097422125,0.000011059366],"about_ca_topic_score_codex":0.00051245716,"about_ca_topic_score_gemma":0.000889001,"teacher_disagreement_score":0.010734909,"about_ca_system_score_codex":0.0019405475,"about_ca_system_score_gemma":0.00088948774,"threshold_uncertainty_score":0.035911858},"labels":[],"label_agreement":null},{"id":"W1598886122","doi":"10.1007/978-3-540-40012-7_15","title":"Performance Evaluation of the Preemptive Bandwidth Allocation Protocol","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Bandwidth (computing); Quality of service; Distributed computing; Bandwidth allocation; Dynamic bandwidth allocation; Protocol (science)","score_opus":0.020606869172635763,"score_gpt":0.25865110612478387,"score_spread":0.2380442369521481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598886122","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.92277825,0.0027608254,0.05791444,0.0005494475,0.00024128471,0.00023088061,0.00028004363,0.0013195704,0.013925298],"genre_scores_gemma":[0.99011725,0.00028206533,0.008146403,0.000033539964,0.00003553614,0.00004372584,0.00015287541,0.000053601252,0.0011350428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956827,0.0016859656,0.0001860522,0.0003164025,0.0015795702,0.00054932956],"domain_scores_gemma":[0.9865797,0.009570938,0.0006065612,0.0009600415,0.0019062712,0.00037655508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005381014,0.001149841,0.0011244933,0.0012599454,0.0009144725,0.001743075,0.0017925772,0.0009074706,0.002464052],"category_scores_gemma":[0.012905029,0.00033933495,0.00026947967,0.001315914,0.0010979908,0.0020502713,0.0009601755,0.0010341346,0.0003030404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0147856735,0.0022590677,0.009203952,0.0006620377,0.00032572652,0.00044452405,0.0003648597,0.6637798,0.0667402,0.026119074,0.0066558756,0.2086593],"study_design_scores_gemma":[0.0001837795,0.0010580904,0.0010599326,0.000010610096,0.00006953465,0.0001230534,0.000065160544,0.98215896,0.01270084,0.0020708358,0.00047928467,0.00001995662],"about_ca_topic_score_codex":0.004459374,"about_ca_topic_score_gemma":0.0022803987,"teacher_disagreement_score":0.005381014,"about_ca_system_score_codex":0.0019957959,"about_ca_system_score_gemma":0.0016374041,"threshold_uncertainty_score":0.02845788},"labels":[],"label_agreement":null},{"id":"W1598901422","doi":"10.1007/978-3-540-69330-7_21","title":"Software Thread Level Speculation for the Java Language and Virtual Machine Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"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":"Computer science; Programming language; Java; strictfp; Bytecode; Java concurrency; Real time Java; Concurrency; Java annotation; Operating system; Virtual machine; Implementation; Java bytecode; Generics in Java","score_opus":0.01826517896625244,"score_gpt":0.24234614684980424,"score_spread":0.2240809678835518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598901422","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.013918512,0.0020036101,0.95821196,0.0005184393,0.00043917663,0.00005153286,0.00013051752,0.014577901,0.010148313],"genre_scores_gemma":[0.3350038,0.0018917854,0.62833095,0.00051631953,0.00042227705,0.00019808194,0.00055501476,0.0075559034,0.025525799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920267,0.00017275392,0.00007924087,0.00011110803,0.0003183925,0.00011585602],"domain_scores_gemma":[0.99850166,0.0005619989,0.00011128068,0.00054530916,0.00019983717,0.000079946796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127962,0.0007892802,0.00066257274,0.0005886677,0.00072221155,0.0018942549,0.0022514712,0.0009156412,0.006213326],"category_scores_gemma":[0.0040238537,0.0009752059,0.0009598296,0.0008565709,0.0010475572,0.0035074577,0.0015006169,0.0026638769,0.001589092],"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.00090379175,0.00015198915,0.002363075,0.0005728729,0.0001035019,0.00038027833,0.00065452844,0.03582021,0.02977189,0.43539143,0.046732932,0.44715348],"study_design_scores_gemma":[0.00014330997,0.00019631349,0.0009483947,0.00015673105,0.00016206826,0.0006034248,0.00007346838,0.43680826,0.036686905,0.4153146,0.10877593,0.00013066613],"about_ca_topic_score_codex":0.0016136796,"about_ca_topic_score_gemma":0.0029714832,"teacher_disagreement_score":0.006213326,"about_ca_system_score_codex":0.00082169037,"about_ca_system_score_gemma":0.001472238,"threshold_uncertainty_score":0.02078569},"labels":[],"label_agreement":null},{"id":"W1598903884","doi":"10.1007/978-3-642-03767-2_20","title":"A New Approach for Segmentation and Recognition of Arabic Handwritten Touching Numeral Pairs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Numeral system; Computer science; Artificial intelligence; Pattern recognition (psychology); Arabic numerals; Segmentation; Speech recognition; Set (abstract data type); Image segmentation; Arabic; Connected component; Linguistics","score_opus":0.024528157741548356,"score_gpt":0.2580449394556602,"score_spread":0.23351678171411186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598903884","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.011875198,0.0007299962,0.9780572,0.0000740544,0.00031480513,0.00014118475,0.000232352,0.004070089,0.0045050904],"genre_scores_gemma":[0.03993712,0.00064870383,0.94180363,0.00016300396,0.00012487605,0.00015736977,0.00092015904,0.00039192365,0.015853237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999387,0.000038648144,0.000038287053,0.00023491158,0.00023931875,0.00006184278],"domain_scores_gemma":[0.9995834,0.00007195938,0.000018716599,0.00007388559,0.00021218407,0.000039865125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033691764,0.0011128517,0.0010421998,0.0015926658,0.00071390317,0.001403594,0.001703998,0.0011224716,0.009959364],"category_scores_gemma":[0.00047170554,0.0005877802,0.00087211654,0.0016071736,0.00048590952,0.0013724073,0.0012179711,0.0009199529,0.006204867],"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.00015382723,0.000091734764,0.00033448057,0.00020730951,0.00005966728,0.00017856699,0.00013771703,0.0019720856,0.3018715,0.0020762857,0.00499675,0.68792003],"study_design_scores_gemma":[0.00007504025,0.00053087546,0.0057803253,0.00009527155,0.00031008068,0.0030002722,0.0004460012,0.38028002,0.4867578,0.007229573,0.115338385,0.00015631424],"about_ca_topic_score_codex":0.002593751,"about_ca_topic_score_gemma":0.005068383,"teacher_disagreement_score":0.009959364,"about_ca_system_score_codex":0.00039210217,"about_ca_system_score_gemma":0.00071335403,"threshold_uncertainty_score":0.033317387},"labels":[],"label_agreement":null},{"id":"W1598932427","doi":"10.1007/978-3-540-27778-1_15","title":"Semantics of Fuzzy Sets in Rough Set Theory","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Semantics (computer science); Rough set; Fuzzy set; Fuzzy logic; Set (abstract data type); Artificial intelligence; Set theory; Theoretical computer science; Programming language","score_opus":0.020636695426364645,"score_gpt":0.25186987459430665,"score_spread":0.231233179167942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598932427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01156618,0.044122722,0.85705656,0.005502752,0.0017889652,0.0001351055,0.0004699864,0.00039936553,0.078958414],"genre_scores_gemma":[0.42281374,0.02513859,0.5271322,0.0018689588,0.0033593422,0.0005956814,0.0009376896,0.00021259375,0.017941097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972161,0.0011598092,0.00031903453,0.00026139556,0.0009114687,0.00013216583],"domain_scores_gemma":[0.9980311,0.001166714,0.00017864474,0.00025947258,0.0002721595,0.000091770504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038487527,0.001158254,0.0018922971,0.0033381726,0.0015601403,0.007008533,0.0017819343,0.0017720804,0.0033409342],"category_scores_gemma":[0.0054995874,0.00084647414,0.0017376265,0.004151989,0.0051665716,0.008516419,0.0018329099,0.004136839,0.0011150775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061424967,0.0000068414934,0.000022975448,0.000085250154,0.000010874195,0.00003084269,0.0002682642,0.00083553256,0.00017457949,0.9914908,0.0009861122,0.0060817394],"study_design_scores_gemma":[0.0000066160237,0.000011173814,0.00005580283,0.0000537181,0.000012797702,0.000073092364,0.00008022605,0.0019763012,0.0001254453,0.98390883,0.013686051,0.000009977597],"about_ca_topic_score_codex":0.00087941514,"about_ca_topic_score_gemma":0.0007795971,"teacher_disagreement_score":0.007008533,"about_ca_system_score_codex":0.00176513,"about_ca_system_score_gemma":0.0009617639,"threshold_uncertainty_score":0.02035433},"labels":[],"label_agreement":null},{"id":"W1598953775","doi":"10.1007/11429760_12","title":"Modeling Social and Individual Trust in Requirements Engineering Methodologies","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Focus (optics); Computational trust; Computer security; Datalog; Organizational structure; Software engineering; Knowledge management; Database","score_opus":0.1216406307163706,"score_gpt":0.3493053676988545,"score_spread":0.2276647369824839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598953775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022784522,0.00013837223,0.97282606,0.00036647913,0.0000140132015,0.00006147649,0.000032266977,0.00006502779,0.0037118015],"genre_scores_gemma":[0.59762126,0.0002484931,0.39914185,0.00009083784,0.0000445222,0.00026028405,0.00011836228,0.000052585092,0.0024218136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924251,0.0054817726,0.00032234393,0.00037017727,0.0011160298,0.0002845815],"domain_scores_gemma":[0.97107744,0.025135722,0.0010548788,0.0012161564,0.0012370411,0.00027869988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00722869,0.0006018847,0.00058857177,0.0009015142,0.0006915385,0.0018872917,0.0013994784,0.001154253,0.0018669029],"category_scores_gemma":[0.02370986,0.00091120007,0.001405911,0.00094642444,0.0014673223,0.0046331757,0.0017170968,0.0018391099,0.0002494869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078273006,0.0001859647,0.0028634,0.00019108977,0.00017887488,0.00027171118,0.0013834572,0.5063475,0.0013623931,0.4133455,0.001060251,0.072731584],"study_design_scores_gemma":[0.000012575482,0.000033084114,0.00036526204,0.000032045376,0.0000368493,0.00004637762,0.00015095768,0.8468671,0.0004774367,0.15025534,0.0017083999,0.000014627254],"about_ca_topic_score_codex":0.0036275818,"about_ca_topic_score_gemma":0.005934416,"teacher_disagreement_score":0.00722869,"about_ca_system_score_codex":0.0015778946,"about_ca_system_score_gemma":0.0012247046,"threshold_uncertainty_score":0.038229406},"labels":[],"label_agreement":null},{"id":"W1599004321","doi":"10.1007/11428817_45","title":"Automatic Transition of Natural Language Software Requirements Specification into Formal Presentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":91,"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; Software requirements specification; Natural language; Specification language; Formal specification; Software engineering; Programming language; Ambiguity; Software requirements; Object language; Contradiction; Requirements analysis; Formal methods; Programming language specification; Software; Software development; Natural language processing; Software design; Linguistics","score_opus":0.016440878384865253,"score_gpt":0.28118810877321737,"score_spread":0.26474723038835213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599004321","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.020171093,0.000042896456,0.95742023,0.0001603756,0.0000633171,0.00024924337,0.00019848897,0.017554913,0.004139444],"genre_scores_gemma":[0.40469843,0.00011733031,0.58347714,0.000248167,0.000039076305,0.00041226108,0.0013628895,0.0038042585,0.005840552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997375,0.0009535046,0.0002313342,0.00040882186,0.0007902125,0.00024112094],"domain_scores_gemma":[0.99162066,0.005699863,0.0003735237,0.0012917952,0.00090001064,0.00011412067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025200383,0.00052015076,0.00052342785,0.0008806142,0.000421418,0.0018908108,0.0010267313,0.0006784694,0.009583556],"category_scores_gemma":[0.009592513,0.00082998414,0.001224852,0.0005304931,0.0011969974,0.0023366716,0.0024349669,0.001634086,0.0030524936],"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.0011817523,0.000559822,0.0024255116,0.0010525222,0.00009902237,0.0010071724,0.004323872,0.04118022,0.14011453,0.21841994,0.01970196,0.5699337],"study_design_scores_gemma":[0.0003481993,0.00037824948,0.0011376394,0.00027625964,0.00013522536,0.00056782993,0.00059326296,0.48283693,0.27272126,0.18253486,0.058335327,0.00013491635],"about_ca_topic_score_codex":0.0014691519,"about_ca_topic_score_gemma":0.0012438252,"teacher_disagreement_score":0.009583556,"about_ca_system_score_codex":0.00076945865,"about_ca_system_score_gemma":0.0012988248,"threshold_uncertainty_score":0.032060206},"labels":[],"label_agreement":null},{"id":"W1599062058","doi":"10.1007/11428831_85","title":"On a Generalized Demosaicking Procedure: A Taxonomy of Single-Sensor Imaging Solutions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer vision; Demosaicing; Artificial intelligence; Computer science; Image sensor; Image (mathematics); Image processing; Color image","score_opus":0.0438991196364152,"score_gpt":0.26627252376391686,"score_spread":0.22237340412750167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599062058","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.0007057456,0.0038850973,0.99195635,0.000112731854,0.0000616033,0.000039292518,0.000034974095,0.0001790454,0.003025023],"genre_scores_gemma":[0.014948546,0.015176011,0.9648918,0.00024504648,0.00022341951,0.00009143612,0.00019075397,0.00020297561,0.004030088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863595,0.00028432783,0.00011958695,0.00030643583,0.0005883128,0.00006533941],"domain_scores_gemma":[0.99864465,0.0004605551,0.00009166419,0.00038020755,0.00038382868,0.00003913897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954328,0.0017398115,0.0019194513,0.0023050704,0.00065575854,0.0025108508,0.0028847998,0.002527489,0.0023397205],"category_scores_gemma":[0.0031050574,0.0012087574,0.001691684,0.0053065545,0.0022804304,0.003317855,0.0026123482,0.003018888,0.0024477327],"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.00005182364,0.0000877707,0.00045148417,0.0012063179,0.00012449357,0.00014485813,0.00029909177,0.04401329,0.010604564,0.2414193,0.008103988,0.693493],"study_design_scores_gemma":[0.000033967808,0.00023907407,0.0009278501,0.00054955005,0.00014495895,0.0018127605,0.00016436876,0.3453709,0.0204592,0.5077535,0.12234273,0.00020109979],"about_ca_topic_score_codex":0.0012866503,"about_ca_topic_score_gemma":0.0014107864,"teacher_disagreement_score":0.0028847998,"about_ca_system_score_codex":0.00060026284,"about_ca_system_score_gemma":0.00089424493,"threshold_uncertainty_score":0.010335624},"labels":[],"label_agreement":null},{"id":"W1599133695","doi":"10.1007/3-540-40006-0_26","title":"A Compilation of Brewka and Eiter’s Approach to Prioritization","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Logic programming; Encoding (memory); Logic program; Programming language; Circumscription; Prioritization; Prolog; Theoretical computer science; Software engineering; Artificial intelligence","score_opus":0.01558282523001391,"score_gpt":0.23094744911761309,"score_spread":0.21536462388759917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599133695","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.0019303237,0.00076175266,0.94867647,0.00091918086,0.00080005,0.00018608647,0.0003016791,0.0024227782,0.04400165],"genre_scores_gemma":[0.04215841,0.0016625549,0.91775143,0.00090466137,0.00054293324,0.00027661564,0.0006259681,0.00233725,0.033740174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970402,0.0005370225,0.00023684363,0.00058087404,0.0013313203,0.00027364385],"domain_scores_gemma":[0.9970516,0.0007715664,0.000065625994,0.001094376,0.00089355855,0.00012320704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023248729,0.0013083584,0.0015225245,0.0034348934,0.0017202123,0.0037329297,0.0036219505,0.0010438134,0.020934705],"category_scores_gemma":[0.008629198,0.0013341366,0.0026930727,0.004538093,0.0025558067,0.006232523,0.004728652,0.004203158,0.0073939404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007725431,0.00020277967,0.0002730461,0.00037214675,0.00010441659,0.00023905707,0.0009294353,0.0087548,0.0027070728,0.6712152,0.030215433,0.2849095],"study_design_scores_gemma":[0.00005154122,0.00003854601,0.0003397448,0.00015721186,0.00013969225,0.00036703615,0.00019090224,0.027756719,0.0032269396,0.7539348,0.21370545,0.0000913844],"about_ca_topic_score_codex":0.010403502,"about_ca_topic_score_gemma":0.012825644,"teacher_disagreement_score":0.020934705,"about_ca_system_score_codex":0.0022787948,"about_ca_system_score_gemma":0.0031634083,"threshold_uncertainty_score":0.07003355},"labels":[],"label_agreement":null},{"id":"W1599149671","doi":"10.1007/978-3-642-00843-6_30","title":"Ranking Attack Graphs with Graph Neural Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Ranking (information retrieval); Ranking SVM; Graph; Artificial neural network; Artificial intelligence; Theoretical computer science; Machine learning","score_opus":0.012558286631790767,"score_gpt":0.2272115015810535,"score_spread":0.21465321494926273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599149671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042846136,0.002760672,0.93797857,0.00084422,0.00028335163,0.00019854597,0.0014742806,0.005159784,0.008454362],"genre_scores_gemma":[0.5826075,0.0023366818,0.3895987,0.00047758291,0.0005363304,0.00024687283,0.0063277483,0.0007968864,0.017071858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992974,0.00022713606,0.000035061978,0.00015672708,0.00020222041,0.00008140561],"domain_scores_gemma":[0.99773324,0.0014198218,0.00016996954,0.00030605085,0.0002802872,0.000090557965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007789247,0.001332331,0.0013844715,0.0033820597,0.00035601328,0.0013894261,0.00139036,0.0013887098,0.004555063],"category_scores_gemma":[0.0042928034,0.0006146567,0.0009887828,0.0024668984,0.00050295575,0.002492474,0.00084457884,0.0017557609,0.0011754368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018682651,0.00017907146,0.0014063707,0.00021982662,0.00018162362,0.000057279398,0.000030073641,0.53988725,0.0014750027,0.01251098,0.023607204,0.42025852],"study_design_scores_gemma":[0.0000075907974,0.000027133132,0.00023795174,0.000015746251,0.000018320596,0.00001663886,0.0000069088105,0.9730549,0.00045813568,0.025312295,0.0008369781,0.0000074158193],"about_ca_topic_score_codex":0.005371577,"about_ca_topic_score_gemma":0.010026375,"teacher_disagreement_score":0.005371577,"about_ca_system_score_codex":0.0010487804,"about_ca_system_score_gemma":0.0006016791,"threshold_uncertainty_score":0.015238225},"labels":[],"label_agreement":null},{"id":"W1599213198","doi":"10.1007/978-3-540-27816-0_15","title":"A Multi-scale Geometric Flow for Segmenting Vasculature in MRI","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Computer science; Scale (ratio); Market segmentation; Artificial intelligence; Computer vision; Flow (mathematics); Segmentation; Cartography; Geometry; Mathematics; Geography","score_opus":0.018881183917839064,"score_gpt":0.27646564371463733,"score_spread":0.2575844597967983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599213198","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.0032548923,0.00031399057,0.9948219,0.00008013248,0.00005147765,0.000055144727,0.000056945417,0.001022152,0.00034335864],"genre_scores_gemma":[0.023452975,0.0006133175,0.97401613,0.00006954289,0.0000861382,0.00007130499,0.00014121659,0.00027890498,0.0012704872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970645,0.00004522953,0.000021526203,0.000067720706,0.00012863478,0.000030424024],"domain_scores_gemma":[0.99946266,0.00019851187,0.000050874434,0.0000870679,0.00015068337,0.00005021665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232525,0.0010884731,0.0010237318,0.0022900465,0.0005019265,0.0011938881,0.0014283179,0.0016247721,0.0039028486],"category_scores_gemma":[0.0016121154,0.00076617737,0.0012659988,0.0018603525,0.0006415534,0.0015641967,0.0011705785,0.0011802539,0.0012571064],"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.00020115564,0.00012233271,0.00053942966,0.00028833043,0.00007622014,0.00014120372,0.00009348301,0.054471314,0.087902345,0.008095428,0.0045069554,0.8435619],"study_design_scores_gemma":[0.00004343597,0.00018022365,0.0011687891,0.00004147528,0.00008173516,0.0005901278,0.000029133484,0.9472752,0.03467972,0.008324486,0.007532536,0.00005318446],"about_ca_topic_score_codex":0.003023813,"about_ca_topic_score_gemma":0.0033410266,"teacher_disagreement_score":0.0039028486,"about_ca_system_score_codex":0.0005086818,"about_ca_system_score_gemma":0.00090945495,"threshold_uncertainty_score":0.013056338},"labels":[],"label_agreement":null},{"id":"W1599238524","doi":"10.1007/3-540-45749-6_48","title":"Wide-Sense Nonblocking WDM Cross-Connects","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Waterloo","funders":"","keywords":"Wavelength-division multiplexing; Wavelength; Computer science; Enhanced Data Rates for GSM Evolution; Graph; Constant (computer programming); Topology (electrical circuits); Optics; Mathematics; Telecommunications; Physics; Theoretical computer science; Combinatorics","score_opus":0.013459231167147449,"score_gpt":0.23071161552050964,"score_spread":0.2172523843533622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599238524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17981544,0.0047718193,0.70267147,0.00044411846,0.0009253443,0.00012558742,0.00023389855,0.0033796981,0.10763273],"genre_scores_gemma":[0.85098964,0.0024508988,0.079331726,0.00028631606,0.00029592775,0.000076410055,0.00036836442,0.00020154958,0.06599919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997739,0.000029847371,0.000011113894,0.00006018868,0.00008912029,0.000035815174],"domain_scores_gemma":[0.9996222,0.00010913061,0.00003774429,0.00009988187,0.00010973822,0.00002116675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859092,0.0005055047,0.00024423396,0.00051569217,0.0004975852,0.0010595375,0.0010672996,0.0004321033,0.0055305916],"category_scores_gemma":[0.0004208602,0.00024825637,0.00017647873,0.00058477727,0.0002893641,0.0011682087,0.00062011136,0.00041101035,0.0015199546],"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.00038318452,0.00028247223,0.0014009279,0.00046957366,0.000091473135,0.00032096638,0.00027022383,0.017647745,0.35808834,0.10377583,0.013859405,0.5034098],"study_design_scores_gemma":[0.00013523836,0.0012383822,0.0034770262,0.00015086627,0.00023406146,0.002810163,0.00026106174,0.25132975,0.46444017,0.108713865,0.16708758,0.00012178599],"about_ca_topic_score_codex":0.00019744728,"about_ca_topic_score_gemma":0.00094040885,"teacher_disagreement_score":0.0055305916,"about_ca_system_score_codex":0.00026384564,"about_ca_system_score_gemma":0.00018763043,"threshold_uncertainty_score":0.018501699},"labels":[],"label_agreement":null},{"id":"W1599294059","doi":"10.1007/978-3-540-68825-9_8","title":"Use of Fuzzy Histograms to Model the Spatial Distribution of Objects in Case-Based Reasoning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Carleton University","funders":"","keywords":"Computer science; Jaccard index; Histogram; Artificial intelligence; Representation (politics); Partition (number theory); Fuzzy logic; Granularity; Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.030985713196758934,"score_gpt":0.2376545933230285,"score_spread":0.20666888012626955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599294059","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.008485925,0.00020355248,0.9892714,0.000089500034,0.000024313427,0.00003487939,0.00011534623,0.0005077948,0.0012672046],"genre_scores_gemma":[0.38407195,0.00040134435,0.61334354,0.00006153918,0.000037437334,0.0001170097,0.0003038551,0.00010862915,0.0015546555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00024406164,0.000069420654,0.000118679316,0.0002485805,0.00005147253],"domain_scores_gemma":[0.9967855,0.0021517826,0.00019364862,0.00041880828,0.00034204344,0.000108061424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020255877,0.00048050535,0.00071298226,0.0018117178,0.00043684716,0.0020814994,0.0019752588,0.000849274,0.0031102365],"category_scores_gemma":[0.007862336,0.00059524504,0.0008412216,0.002186087,0.0011485202,0.003807781,0.0010962088,0.0010380113,0.00041624877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024161742,0.00017478263,0.0025733178,0.00013647076,0.0001181466,0.00027056655,0.00047192164,0.54478604,0.003627567,0.1454716,0.0024474813,0.29968047],"study_design_scores_gemma":[0.000016048452,0.00001642162,0.00032436408,0.000013134728,0.000022980257,0.00007726314,0.000035828456,0.93493783,0.0011080251,0.062179107,0.0012518367,0.000017199489],"about_ca_topic_score_codex":0.014377301,"about_ca_topic_score_gemma":0.010327319,"teacher_disagreement_score":0.014377301,"about_ca_system_score_codex":0.001266647,"about_ca_system_score_gemma":0.00077902415,"threshold_uncertainty_score":0.028587222},"labels":[],"label_agreement":null},{"id":"W1599317246","doi":"10.1007/978-3-540-87744-8_33","title":"Succinct Representations of Arbitrary Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Combinatorics; Vertex (graph theory); Constant (computer programming); Discrete mathematics; Mathematics; Multiplicative function; Graph; Computer science","score_opus":0.017594277416723068,"score_gpt":0.25533276676203776,"score_spread":0.2377384893453147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599317246","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.03579318,0.001395187,0.91068864,0.001402571,0.00037662164,0.0001702393,0.004886398,0.0030230742,0.04226413],"genre_scores_gemma":[0.42405066,0.003704271,0.50819474,0.0006850513,0.00034396237,0.0005664522,0.0167478,0.0019467989,0.04376013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993487,0.0001728807,0.000054258555,0.000103189355,0.00025354177,0.000067472945],"domain_scores_gemma":[0.99790394,0.0008753388,0.00013170583,0.0007789599,0.00024512273,0.000064956635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048311584,0.0009388801,0.00067367667,0.0012600013,0.00048376495,0.0024254657,0.0015204512,0.0010202208,0.014132634],"category_scores_gemma":[0.003920905,0.0005790165,0.00056033704,0.002527708,0.00083318626,0.006188648,0.002036708,0.0023055528,0.0028659878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025606932,0.00008424338,0.00020879987,0.00038134702,0.000022141992,0.00024039537,0.0004205468,0.05183286,0.0046220156,0.7157811,0.028344408,0.1978061],"study_design_scores_gemma":[0.000029997622,0.000028151737,0.00009446884,0.000094012015,0.00001784619,0.00018194053,0.000106759624,0.0852118,0.0037962815,0.879272,0.03114834,0.000018397996],"about_ca_topic_score_codex":0.000693051,"about_ca_topic_score_gemma":0.0015491231,"teacher_disagreement_score":0.014132634,"about_ca_system_score_codex":0.00064279913,"about_ca_system_score_gemma":0.000526314,"threshold_uncertainty_score":0.047278404},"labels":[],"label_agreement":null},{"id":"W1599321600","doi":"10.1007/978-3-642-11876-0_38","title":"Heuristic Formation Control in Multi-robot Systems Using Local Communication and Limited Identification","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","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 Manitoba","funders":"","keywords":"Computer science; Identification (biology); Heuristic; Robot; Control (management); Artificial intelligence; Human–computer interaction; Distributed computing","score_opus":0.031096290953244756,"score_gpt":0.2609575250829146,"score_spread":0.22986123412966983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599321600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016827077,0.00052292034,0.9782059,0.00008368202,0.000054196997,0.000026775422,0.000008464732,0.0001680416,0.0041028094],"genre_scores_gemma":[0.90615535,0.0002931919,0.088968694,0.000049207963,0.00004459527,0.00013215761,0.000026296282,0.000042939886,0.004287503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997811,0.00007927539,0.000009525643,0.000038975548,0.000064032545,0.000027185893],"domain_scores_gemma":[0.9994803,0.00031429724,0.00006297009,0.00005934693,0.00006013922,0.000022929427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006105324,0.00051077886,0.000839944,0.00030655653,0.000528188,0.0007240443,0.0008590663,0.0005754662,0.0012888606],"category_scores_gemma":[0.0013303872,0.0003784847,0.0003946755,0.00030523658,0.0011402299,0.0009219825,0.0010834143,0.00065333536,0.00020647248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008228553,0.000028651571,0.000106246705,0.00006973559,0.000021705862,0.000035449004,0.000084826264,0.9420671,0.0023298478,0.012710544,0.0005187756,0.041944865],"study_design_scores_gemma":[0.000012943726,0.000043009153,0.000055236487,0.000005195655,0.0000043485866,0.000012303212,0.000008603184,0.99419725,0.0004963816,0.004856819,0.00030312059,0.0000049269834],"about_ca_topic_score_codex":0.0020201365,"about_ca_topic_score_gemma":0.0022376156,"teacher_disagreement_score":0.0020201365,"about_ca_system_score_codex":0.00048179433,"about_ca_system_score_gemma":0.0005277193,"threshold_uncertainty_score":0.004311681},"labels":[],"label_agreement":null},{"id":"W1599332826","doi":"10.1007/3-540-36261-4_17","title":"Distributed Transaction Management in a Peer-to-Peer Process-Oriented Environment","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Dalhousie University","funders":"","keywords":"Computer science; Personalization; Database transaction; Population; Process (computing); Domain (mathematical analysis); Knowledge management; World Wide Web; Internet privacy","score_opus":0.0119713758978158,"score_gpt":0.23188803591684357,"score_spread":0.21991666001902777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599332826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025830247,0.0023024245,0.9469119,0.0005768882,0.00029950525,0.00021024108,0.00008864586,0.0028227335,0.020957477],"genre_scores_gemma":[0.4754888,0.0032036044,0.47444788,0.00027431425,0.00042381787,0.00038631272,0.0005409504,0.00057088933,0.044663496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870074,0.0002672386,0.00012429693,0.00016682092,0.00063804135,0.00010285608],"domain_scores_gemma":[0.99881196,0.00047933933,0.000060718015,0.00031276443,0.00023541786,0.00009981928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112466,0.00045300237,0.00094150746,0.0005452987,0.0011452695,0.002707846,0.0024927787,0.0013904864,0.0032913256],"category_scores_gemma":[0.0025761654,0.0006194297,0.00036471747,0.0016911203,0.0008616282,0.00325727,0.0012148473,0.0012497702,0.0018400731],"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.00087306416,0.00043753735,0.0013196114,0.0006796312,0.00014049247,0.0017391791,0.0015451984,0.07236599,0.0488667,0.21322118,0.024165554,0.6346459],"study_design_scores_gemma":[0.00035322504,0.00055710285,0.0009593479,0.00012886304,0.00022317303,0.0024107653,0.00034615793,0.55773056,0.042157732,0.2608446,0.13416734,0.00012111649],"about_ca_topic_score_codex":0.0007189257,"about_ca_topic_score_gemma":0.00067521865,"teacher_disagreement_score":0.0032913256,"about_ca_system_score_codex":0.00046611193,"about_ca_system_score_gemma":0.0007194963,"threshold_uncertainty_score":0.011010647},"labels":[],"label_agreement":null},{"id":"W1599379570","doi":"10.1007/978-3-540-30494-4_22","title":"Extending Extended Vacuity","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.03123223046150592,"score_gpt":0.29548026011345296,"score_spread":0.26424802965194705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599379570","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.051606305,0.0010998338,0.511961,0.0025437772,0.0014759316,0.00017764997,0.0007373224,0.0039183167,0.42647985],"genre_scores_gemma":[0.6956959,0.0017080794,0.17145573,0.0012905445,0.0006831711,0.00024432226,0.0018212546,0.0030001567,0.124100745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982967,0.00045086676,0.000109040164,0.00037064767,0.0005212359,0.00025160555],"domain_scores_gemma":[0.9978598,0.0005822326,0.00006656769,0.0010229324,0.00035416486,0.000114287715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017875088,0.0008593824,0.0011532607,0.0017199371,0.002144357,0.0029488588,0.0020619202,0.0013050578,0.02248015],"category_scores_gemma":[0.004595988,0.0009747754,0.0019057193,0.0014952124,0.0041204668,0.011031093,0.008919882,0.00466061,0.0042103287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003105833,0.000023313472,0.0000811983,0.000060004877,0.000008540226,0.00011191256,0.00039076371,0.00048451714,0.00083719776,0.9805124,0.0026842472,0.01477489],"study_design_scores_gemma":[0.00001590723,0.000016700438,0.00007208926,0.00005426471,0.000023650357,0.0002051913,0.0001543907,0.0027695715,0.0015787197,0.9386374,0.056452397,0.000019683179],"about_ca_topic_score_codex":0.00068100425,"about_ca_topic_score_gemma":0.0008817843,"teacher_disagreement_score":0.02248015,"about_ca_system_score_codex":0.0011912561,"about_ca_system_score_gemma":0.0006965306,"threshold_uncertainty_score":0.0752036},"labels":[],"label_agreement":null},{"id":"W1599436623","doi":"10.1007/978-3-540-24840-8_58","title":"Constraint Directed Dynamic Backtracking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Windsor","funders":"","keywords":"Backtracking; Thrashing; Computer science; Constraint learning; Look-ahead; Constraint satisfaction problem; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Algorithm; Theoretical computer science; Mathematics; Constraint logic programming; Parallel computing; Artificial intelligence","score_opus":0.010880262137369453,"score_gpt":0.23579805044388305,"score_spread":0.2249177883065136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599436623","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.0049680984,0.0008277965,0.8561333,0.00051499985,0.00030458902,0.00023504526,0.0008376038,0.0029536944,0.13322487],"genre_scores_gemma":[0.14180031,0.0017877837,0.72309756,0.0006760103,0.00011237885,0.0004062043,0.0033218483,0.002036023,0.12676188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.00021507434,0.00005651286,0.00022632648,0.00049777277,0.00013482467],"domain_scores_gemma":[0.99862456,0.00056931906,0.000058693335,0.00035131117,0.00034470073,0.00005138576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075668696,0.0011123155,0.00075393997,0.0013951343,0.0012831943,0.002005385,0.0026451943,0.0012859949,0.029273711],"category_scores_gemma":[0.0030553902,0.00087278656,0.000929071,0.0024654404,0.0013377997,0.0021250157,0.0027018494,0.0020664071,0.006394935],"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.00023651459,0.00019864437,0.0003423106,0.00075588556,0.000068616966,0.0003887916,0.00038192823,0.049393333,0.010689298,0.34859866,0.06932122,0.5196248],"study_design_scores_gemma":[0.000092334674,0.000055133238,0.0002442649,0.00028538608,0.000097140466,0.00045492864,0.00014936927,0.24973716,0.026961228,0.5051072,0.2167543,0.00006148932],"about_ca_topic_score_codex":0.005718007,"about_ca_topic_score_gemma":0.010132162,"teacher_disagreement_score":0.029273711,"about_ca_system_score_codex":0.0013560066,"about_ca_system_score_gemma":0.0017520081,"threshold_uncertainty_score":0.09793037},"labels":[],"label_agreement":null},{"id":"W1599447066","doi":"10.1007/11546849_22","title":"Flexible Query Answering in Data Cubes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Université du Québec en Outaouais","funders":"","keywords":"Online analytical processing; Computer science; Data warehouse; Data cube; Data mining; Tuple; Set (abstract data type); Cube (algebra); Matching (statistics); Materialized view; Information retrieval; Query optimization; Database; View; Database design","score_opus":0.044023982889082484,"score_gpt":0.27483633734342383,"score_spread":0.23081235445434134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599447066","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.016331263,0.0011501936,0.9751179,0.00085894536,0.000091778544,0.00017965015,0.0007067041,0.003319092,0.0022443926],"genre_scores_gemma":[0.21668981,0.0012035796,0.7725411,0.00048723433,0.0001873298,0.00039335704,0.0041848626,0.0007468796,0.0035658777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895588,0.0027623116,0.0013319694,0.0013285467,0.0042145615,0.0008038655],"domain_scores_gemma":[0.98588157,0.0077426233,0.0004457491,0.0044743116,0.0011523785,0.0003034042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073251114,0.00107607,0.0034396597,0.0019255173,0.0016877779,0.0054616057,0.004696435,0.0020927358,0.004135955],"category_scores_gemma":[0.020276366,0.0015347346,0.0030370122,0.006072665,0.002464882,0.012952098,0.008410046,0.0038727298,0.0013409148],"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.0013607045,0.00040221636,0.0026002326,0.0013133113,0.00037199399,0.0006897053,0.0018822751,0.13311447,0.016412932,0.32999346,0.034664527,0.47719425],"study_design_scores_gemma":[0.000092089635,0.00010378523,0.00032998167,0.000086449014,0.00008629531,0.00039269045,0.0004430351,0.5037817,0.010498526,0.47090152,0.013232671,0.000051345523],"about_ca_topic_score_codex":0.0035959731,"about_ca_topic_score_gemma":0.0033427768,"teacher_disagreement_score":0.0073251114,"about_ca_system_score_codex":0.0014403324,"about_ca_system_score_gemma":0.0014045963,"threshold_uncertainty_score":0.038739383},"labels":[],"label_agreement":null},{"id":"W1599455934","doi":"10.1007/3-540-45816-6_26","title":"Extracting Conceptual Relationships from Specialized Documents","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Conceptual model; Representation (politics); Data science; Simple (philosophy); Information extraction; Management science; Information retrieval; Data mining; Knowledge management; Database","score_opus":0.05834076580857787,"score_gpt":0.2705808808188997,"score_spread":0.21224011501032183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599455934","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.113958046,0.0037305853,0.833704,0.0008628086,0.00030260248,0.000799899,0.014247608,0.013034447,0.019360043],"genre_scores_gemma":[0.1457706,0.0029350976,0.7898953,0.00017407093,0.00012837829,0.0002698709,0.05220785,0.001101558,0.0075174123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.000094333715,0.000116305,0.00018806878,0.00023779609,0.000055413377],"domain_scores_gemma":[0.9976787,0.0011155931,0.00017062612,0.00045775212,0.0004931593,0.00008410538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888532,0.0012055477,0.0011790813,0.0075274874,0.0011810552,0.0025461572,0.001421359,0.0012355673,0.0070581883],"category_scores_gemma":[0.0052443836,0.0008830026,0.0016278202,0.009421677,0.00053557096,0.0050926907,0.001758679,0.0013981741,0.0048763803],"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.00020957476,0.0002526908,0.003617739,0.0015898406,0.00016084677,0.0019370589,0.0013721571,0.0033024517,0.03480691,0.030876417,0.02914561,0.89272875],"study_design_scores_gemma":[0.00025115247,0.00047478202,0.018142808,0.0015201917,0.0019909884,0.0090088835,0.004883308,0.19148573,0.1321231,0.1688775,0.47100624,0.00023537061],"about_ca_topic_score_codex":0.0032963913,"about_ca_topic_score_gemma":0.0052777105,"teacher_disagreement_score":0.0075274874,"about_ca_system_score_codex":0.0007574023,"about_ca_system_score_gemma":0.0017597979,"threshold_uncertainty_score":0.023611963},"labels":[],"label_agreement":null},{"id":"W1599511149","doi":"10.1007/978-3-642-18098-9_14","title":"On Lazy Representations and Sturmian Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph; Representation (politics); Set (abstract data type); Computer science; Integer (computer science); Path (computing); Mathematics; Discrete mathematics","score_opus":0.018536103187688852,"score_gpt":0.2464878192117674,"score_spread":0.22795171602407854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599511149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17290276,0.018401688,0.42416325,0.00894913,0.0018246712,0.00011784986,0.000663351,0.0012173033,0.37175998],"genre_scores_gemma":[0.8431089,0.007889444,0.07275101,0.0013233607,0.0017837296,0.00021355189,0.0008910572,0.00053856574,0.07150049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937266,0.00021352032,0.00003921811,0.00010486106,0.00018253001,0.00008727079],"domain_scores_gemma":[0.9991228,0.0004918672,0.0000657252,0.00015291729,0.000107245316,0.000059527174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082444795,0.00076390605,0.0009963927,0.0023436071,0.0022983,0.003293424,0.0011288981,0.0017251783,0.0077354717],"category_scores_gemma":[0.002274101,0.0007961513,0.0011612157,0.0036160182,0.0049163364,0.0088082105,0.0021859352,0.0037413589,0.0013526833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070015367,0.0000061111014,0.000029140178,0.000022176795,0.0000023818282,0.000020894098,0.00018250567,0.0003766379,0.00015725952,0.9937503,0.0010733197,0.0043722047],"study_design_scores_gemma":[0.0000023175048,0.0000024115043,0.000022482229,0.0000065083054,0.0000019291595,0.000017870323,0.000023421913,0.00042547385,0.00004318076,0.9975465,0.0019047704,0.0000030928709],"about_ca_topic_score_codex":0.0012174404,"about_ca_topic_score_gemma":0.0015918767,"teacher_disagreement_score":0.0077354717,"about_ca_system_score_codex":0.0016487482,"about_ca_system_score_gemma":0.00055375346,"threshold_uncertainty_score":0.025877714},"labels":[],"label_agreement":null},{"id":"W1599512452","doi":"10.1007/978-3-319-07557-0_1","title":"The Cycling Property for the Clutter of Odd st-Walks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Joins; Bipartite graph; Clutter; Combinatorics; Computer science; Eulerian path; Matroid; Electronic circuit; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Telecommunications; Physics; Pure mathematics; Radar","score_opus":0.028923743418956042,"score_gpt":0.2878754024216047,"score_spread":0.25895165900264866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599512452","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.48685342,0.003450107,0.2382476,0.001249854,0.00082074513,0.00008766946,0.0011311537,0.0009594137,0.26720005],"genre_scores_gemma":[0.906768,0.0017929921,0.026455881,0.0006000773,0.0005470205,0.000090622925,0.0010119997,0.0006958533,0.06203756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995715,0.00006326918,0.000026951066,0.00013376049,0.00010981473,0.0000947222],"domain_scores_gemma":[0.997948,0.0009597857,0.0001577316,0.00037966704,0.00023938883,0.0003154134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045754178,0.00062510057,0.0007880417,0.0015179833,0.0018912248,0.0032892379,0.0009139011,0.0010287914,0.01291012],"category_scores_gemma":[0.003694078,0.00060908456,0.0008864783,0.0022551075,0.0020542333,0.0037286526,0.0016605272,0.0017605729,0.0017339975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011899233,0.000018637209,0.0006655954,0.000087897315,0.00000997091,0.00016940194,0.00025787638,0.0017049311,0.0024504599,0.9737925,0.004127538,0.016596185],"study_design_scores_gemma":[0.00001108377,0.000020185922,0.00042449858,0.000025906187,0.000011430503,0.00027335822,0.00006512629,0.005356305,0.0010049198,0.9843874,0.0084013175,0.000018544588],"about_ca_topic_score_codex":0.0019289514,"about_ca_topic_score_gemma":0.0018665537,"teacher_disagreement_score":0.01291012,"about_ca_system_score_codex":0.0007172741,"about_ca_system_score_gemma":0.0006389618,"threshold_uncertainty_score":0.04318869},"labels":[],"label_agreement":null},{"id":"W1599513353","doi":"10.1007/11566465_47","title":"Segmentation of Focal Cortical Dysplasia Lesions Using a Feature-Based Level Set","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Cortical dysplasia; Computer science; Segmentation; Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Set (abstract data type); Epilepsy; Cortex (anatomy); Level set (data structures); Similarity (geometry); Magnetic resonance imaging; Medicine; Radiology; Neuroscience; Image (mathematics); Psychology","score_opus":0.04695083398903657,"score_gpt":0.3218166831586094,"score_spread":0.2748658491695728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599513353","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.30983275,0.0008500011,0.68332,0.0004838239,0.0000530156,0.00036281502,0.00070480944,0.0022392657,0.0021536634],"genre_scores_gemma":[0.5707687,0.0004192998,0.42655393,0.000071430026,0.000026869922,0.000115441675,0.00045351562,0.00031674022,0.0012740144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980015,0.000025511787,0.000020716107,0.00003208843,0.00008426429,0.00003726834],"domain_scores_gemma":[0.9996363,0.00014415201,0.000040977044,0.000051666924,0.000098729484,0.000028054035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656619,0.00054064713,0.00076024013,0.0026328734,0.00035149857,0.001475622,0.0006879885,0.0012207226,0.0013775188],"category_scores_gemma":[0.0013467271,0.0005082459,0.0008313884,0.0010808303,0.0003409069,0.0005119323,0.00051307277,0.0005317111,0.00031430667],"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.001462115,0.00023258408,0.0104011595,0.00069992855,0.00026072486,0.0015529608,0.00047031287,0.10131041,0.3333937,0.0056721414,0.0038406597,0.54070336],"study_design_scores_gemma":[0.0000891196,0.00029575147,0.020987555,0.00007923,0.00018607611,0.0032148971,0.00014840998,0.84260243,0.12388458,0.005405524,0.0030013425,0.000104987615],"about_ca_topic_score_codex":0.0053338595,"about_ca_topic_score_gemma":0.004464992,"teacher_disagreement_score":0.0053338595,"about_ca_system_score_codex":0.00068310054,"about_ca_system_score_gemma":0.0013892567,"threshold_uncertainty_score":0.010605633},"labels":[],"label_agreement":null},{"id":"W1599534523","doi":"10.1007/978-3-642-17226-7_2","title":"Efficient Decision Tree Re-alignment for Clustering Time-Changing Data Streams","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Data mining; Tuple; Data stream mining; Decision tree; Cluster analysis; Incremental decision tree; Tree (set theory); Data stream; Exploit; Set (abstract data type); Decision tree learning; Machine learning","score_opus":0.030761451499208704,"score_gpt":0.28511332962556735,"score_spread":0.2543518781263586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599534523","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.021556567,0.0005463218,0.9723069,0.00014936476,0.00015655784,0.00013055897,0.00059782603,0.003658622,0.00089726684],"genre_scores_gemma":[0.15413408,0.000332387,0.83787966,0.00011331169,0.00011478063,0.00015913084,0.0043057743,0.0004818276,0.0024791455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984138,0.00027255897,0.00016127438,0.0004418524,0.0005377402,0.00017275965],"domain_scores_gemma":[0.99743,0.00082354224,0.00019520479,0.0005216595,0.0009104044,0.00011912834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013619297,0.00088449375,0.001631148,0.0023570668,0.0009707647,0.0012705832,0.0020225372,0.0011128263,0.0035033105],"category_scores_gemma":[0.005766952,0.00057016866,0.0009985414,0.0041947938,0.00032513004,0.001761785,0.0013475156,0.0017482868,0.0029936514],"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.0003833548,0.0002534698,0.0021929946,0.00016005147,0.00009805822,0.0001325999,0.00020911568,0.034918223,0.02297953,0.0035665324,0.013960403,0.9211456],"study_design_scores_gemma":[0.000049114,0.00014427508,0.0017275858,0.00002637245,0.0000708988,0.0002735803,0.00017656769,0.9559896,0.019406566,0.013216064,0.008886954,0.00003237704],"about_ca_topic_score_codex":0.0033198583,"about_ca_topic_score_gemma":0.005585013,"teacher_disagreement_score":0.0035033105,"about_ca_system_score_codex":0.0004980908,"about_ca_system_score_gemma":0.0013982088,"threshold_uncertainty_score":0.011719763},"labels":[],"label_agreement":null},{"id":"W1599579342","doi":"10.1007/bfb0024361","title":"Temporal extensions to a uniform behavioral object model","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Construct (python library); Inheritance (genetic algorithm); Set (abstract data type); Semantics (computer science); Object (grammar); Behavioral modeling; Extensibility; Programming language; Behavioral pattern; Theoretical computer science; Temporal logic; Artificial intelligence","score_opus":0.030477589399131148,"score_gpt":0.2854319055532071,"score_spread":0.25495431615407593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599579342","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.018862974,0.00016963226,0.96682703,0.00031974414,0.000108353226,0.00005485348,0.00019370635,0.0009652869,0.012498372],"genre_scores_gemma":[0.44603166,0.0005998986,0.5192158,0.0004824883,0.00032222053,0.0004033977,0.00085838663,0.00067360763,0.031412546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983139,0.0004333517,0.00024631896,0.00035652675,0.00043700216,0.00021291326],"domain_scores_gemma":[0.99542737,0.0011924707,0.00033263885,0.0021459078,0.0006716347,0.00022994659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028946951,0.00071143813,0.0005017158,0.0008354859,0.000924968,0.0022454038,0.0019200833,0.0010470833,0.0060365056],"category_scores_gemma":[0.005954009,0.0008350095,0.0016516187,0.0011735052,0.001910235,0.0079334965,0.002749031,0.0026225122,0.0009821234],"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.000042725882,0.000026737376,0.00012806052,0.000027438158,0.000007028467,0.000057461068,0.00014383341,0.0037451051,0.0013051104,0.9840567,0.0006733418,0.009786415],"study_design_scores_gemma":[0.000044414865,0.00006357562,0.00014658843,0.000042734548,0.00006141755,0.00014379072,0.000074097276,0.07926924,0.0028915848,0.8973711,0.019868806,0.000022717151],"about_ca_topic_score_codex":0.0021002847,"about_ca_topic_score_gemma":0.0021009254,"teacher_disagreement_score":0.0060365056,"about_ca_system_score_codex":0.0011701199,"about_ca_system_score_gemma":0.0009579485,"threshold_uncertainty_score":0.020194173},"labels":[],"label_agreement":null},{"id":"W1599590132","doi":"10.1007/11499145_74","title":"A Novel Algorithm for Fitting 3-D Active Appearance Models: Applications to Cardiac MRI Segmentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"York University","funders":"","keywords":"Segmentation; Computer science; Gauss; Algorithm; Artificial intelligence; Image segmentation; Inverse; Scale-space segmentation; Pattern recognition (psychology); Computer vision; Mathematics; Geometry; Physics","score_opus":0.02522099139093822,"score_gpt":0.2740831438198071,"score_spread":0.24886215242886886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599590132","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.0004381113,0.00005385188,0.99850106,0.000028797358,0.000032623964,0.000019249901,0.000020191277,0.0007258961,0.00018022963],"genre_scores_gemma":[0.0071730195,0.00015021555,0.9905813,0.00006325816,0.00003652383,0.000082333005,0.00011619875,0.0003113064,0.0014858511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999171,0.00008969776,0.000049906703,0.0001788882,0.00045967553,0.0000508592],"domain_scores_gemma":[0.99882525,0.00038915547,0.00010293544,0.00019841117,0.00041509184,0.00006913237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012184236,0.0015164628,0.0016234546,0.0014495323,0.0007051435,0.002171591,0.003222518,0.002632942,0.005204638],"category_scores_gemma":[0.0027684618,0.0016066503,0.0014978709,0.0022628338,0.0006958227,0.0016350414,0.002165993,0.0026218,0.0045124455],"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.000107088235,0.00010811141,0.0002686727,0.00014721924,0.00008375933,0.0000901917,0.00011964514,0.044597473,0.043100707,0.005619894,0.008481353,0.89727587],"study_design_scores_gemma":[0.000024633111,0.00004789053,0.00032298578,0.000019559602,0.000040097813,0.000385138,0.000025919924,0.9603092,0.021174388,0.004262386,0.0133418115,0.000045984383],"about_ca_topic_score_codex":0.0029994068,"about_ca_topic_score_gemma":0.006417033,"teacher_disagreement_score":0.005204638,"about_ca_system_score_codex":0.0006145021,"about_ca_system_score_gemma":0.0011826397,"threshold_uncertainty_score":0.017411292},"labels":[],"label_agreement":null},{"id":"W1599651736","doi":"10.1007/978-3-642-16773-7_18","title":"On the Structure of Elimination Trees for Bayesian Network Inference","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Lethbridge","funders":"","keywords":"Variable elimination; Computer science; Inference; Bayesian network; Tree (set theory); Bayesian inference; Computation; Artificial intelligence; Bayesian probability; Graphical model; Machine learning; Algorithm; Data mining; Mathematics","score_opus":0.019592468556647893,"score_gpt":0.25708964398419726,"score_spread":0.23749717542754936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599651736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018806189,0.0007731912,0.9936352,0.00044974432,0.000045465815,0.00003852522,0.00019771235,0.00016289047,0.0028167318],"genre_scores_gemma":[0.10431793,0.0034254526,0.88027084,0.00083854067,0.00067596044,0.0005247546,0.001887883,0.00066390604,0.007394766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418265,0.003744047,0.00027138524,0.0005474377,0.0009971482,0.0002572869],"domain_scores_gemma":[0.92467314,0.06813326,0.0013674326,0.0030404595,0.0022938142,0.000491958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00937602,0.0014055562,0.0027558974,0.0034350452,0.0019039405,0.0030901239,0.004393521,0.002906456,0.009402382],"category_scores_gemma":[0.06078383,0.0021976596,0.0025255207,0.0061085825,0.0036688645,0.008542348,0.0034429333,0.008666812,0.0022526006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096518765,0.00006669001,0.00081460824,0.00028115968,0.00008628921,0.00010457707,0.00042011833,0.09126911,0.00038315973,0.8059049,0.010254703,0.09031804],"study_design_scores_gemma":[0.000015645395,0.000008020984,0.00009228835,0.000038737795,0.00001721606,0.00003035361,0.000011308143,0.10756237,0.00008204797,0.89006037,0.0020718423,0.0000097459415],"about_ca_topic_score_codex":0.00537358,"about_ca_topic_score_gemma":0.0066757575,"teacher_disagreement_score":0.009402382,"about_ca_system_score_codex":0.002147554,"about_ca_system_score_gemma":0.0019085312,"threshold_uncertainty_score":0.0495857},"labels":[],"label_agreement":null},{"id":"W1599752459","doi":"10.1007/3-540-45545-0_99","title":"Implementation of Symmetric Nonstationary Phase-Shift Wavefield Extrapolator on an Alpha Cluster","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary 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 Calgary","funders":"","keywords":"Computer science; Extrapolation; Computational science; Workstation; Computation; Fourier transform; Fast Fourier transform; Algorithm; Message Passing Interface; Domain (mathematical analysis); Fortran; Frequency domain; Parallel computing; Interface (matter); Computer cluster; Message passing; Computer vision; Distributed computing; Physics","score_opus":0.02073198273852439,"score_gpt":0.27928875339115994,"score_spread":0.25855677065263555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599752459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062468354,0.00008735173,0.9215903,0.00009179972,0.000073476556,0.00005794205,0.00020695181,0.0099965185,0.0054272255],"genre_scores_gemma":[0.30926922,0.00008705007,0.68044376,0.0000741077,0.00003386226,0.000102382706,0.00079628505,0.0005960536,0.008597321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997973,0.000028707402,0.000014410065,0.000036923448,0.00007923579,0.00004343726],"domain_scores_gemma":[0.9996232,0.000059502425,0.000017861099,0.00010708385,0.00015473695,0.000037484075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032438702,0.00053279096,0.00048515975,0.00038650367,0.0005606058,0.0006046036,0.0018502929,0.0003749173,0.0073355976],"category_scores_gemma":[0.00074273854,0.00028669878,0.00039747314,0.0006061531,0.00018426044,0.0007019389,0.0008456704,0.00055434357,0.0021641972],"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.0026307874,0.00033929932,0.0046489225,0.00026414066,0.00019340898,0.00065628364,0.0005235355,0.13325755,0.13683261,0.02169305,0.019025201,0.6799352],"study_design_scores_gemma":[0.00010297462,0.0001786911,0.0010592481,0.000010865479,0.00004366624,0.00016028096,0.00009674281,0.9100134,0.07436846,0.0048385477,0.009099308,0.000027810374],"about_ca_topic_score_codex":0.0035774051,"about_ca_topic_score_gemma":0.0048624426,"teacher_disagreement_score":0.0073355976,"about_ca_system_score_codex":0.0004225091,"about_ca_system_score_gemma":0.0007754398,"threshold_uncertainty_score":0.024540067},"labels":[],"label_agreement":null},{"id":"W1599857818","doi":"10.1007/978-3-642-04268-3_10","title":"Prediction of the Repair Surface over Cartilage Defects: A Comparison of Three Methods in a Sheep Model","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Osteoarthritis Treatment and Mechanisms","field":"Medicine","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 Guelph; Queen's University","funders":"","keywords":"Articular cartilage; Cartilage; Articular surface; Atlas (anatomy); Biomedical engineering; Computer science; Arthroplasty; Transplantation; Spline (mechanical); Materials science; Bearing surface; Anatomy; Surgery; Structural engineering; Medicine; Composite material; Osteoarthritis; Engineering; Pathology","score_opus":0.033987330097088896,"score_gpt":0.32513334133901434,"score_spread":0.29114601124192546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599857818","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.5243464,0.0022878286,0.46936083,0.00028670495,0.00013788597,0.00012668523,0.00043788573,0.0017012191,0.0013146003],"genre_scores_gemma":[0.9214515,0.00062111986,0.075804435,0.000050898634,0.000028800681,0.00007024956,0.00033358452,0.00020961347,0.0014297172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994456,0.00017466165,0.00005563717,0.00012984678,0.00014085128,0.000053398082],"domain_scores_gemma":[0.99556714,0.0030865,0.00030237506,0.00021343879,0.0006424367,0.00018814865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025968368,0.0010116247,0.0016075438,0.0014351207,0.00028561542,0.001166334,0.0012302481,0.0022678594,0.00087180425],"category_scores_gemma":[0.0032451877,0.0005272595,0.00078238867,0.00055251893,0.00037064552,0.00067766296,0.00056201447,0.0005919622,0.00028324994],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034491776,0.000669507,0.023957998,0.00040835165,0.00046803465,0.00019565779,0.00019488511,0.6861368,0.028676607,0.0006535213,0.0010641448,0.2541254],"study_design_scores_gemma":[0.00002477297,0.00025967706,0.003360692,0.000009887914,0.000046156332,0.000062810934,0.000030260218,0.99281174,0.0030976934,0.0001381629,0.0001324958,0.00002560995],"about_ca_topic_score_codex":0.008240048,"about_ca_topic_score_gemma":0.004549149,"teacher_disagreement_score":0.008240048,"about_ca_system_score_codex":0.00045404123,"about_ca_system_score_gemma":0.0007984728,"threshold_uncertainty_score":0.016384184},"labels":[],"label_agreement":null},{"id":"W1599903895","doi":"10.1007/3-540-45813-1_43","title":"Induction of Classification Rules by Granular Computing","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":110,"is_retracted":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":"Granular computing; Heuristics; Granule (geology); Partition (number theory); Computer science; Rule induction; Selection (genetic algorithm); Artificial intelligence; Machine learning; Data mining; Mathematics; Rough set; Combinatorics; Biology","score_opus":0.03048382481616365,"score_gpt":0.24031875502354544,"score_spread":0.20983493020738178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599903895","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.016400728,0.0005083324,0.9777665,0.0002087782,0.00014925715,0.0002445086,0.00028607197,0.0012074983,0.0032283098],"genre_scores_gemma":[0.21591951,0.0008149919,0.7781728,0.00015225567,0.0001313316,0.0003619327,0.0018370104,0.00014398035,0.0024662104],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976683,0.00044732512,0.00035718843,0.00049981603,0.00082756026,0.00019988301],"domain_scores_gemma":[0.9948566,0.0031618173,0.00026020544,0.0008886758,0.0007075769,0.00012510562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024830832,0.0008726244,0.0025433975,0.0027811301,0.0008759938,0.0029590493,0.0019901432,0.0007790824,0.0038627652],"category_scores_gemma":[0.009601042,0.0008561144,0.0022703607,0.0030840116,0.0010668305,0.00284059,0.0019941689,0.0021046074,0.0015068428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034272988,0.00029759688,0.0020064039,0.00063397666,0.0002815195,0.0004660611,0.00027845494,0.07690025,0.007815348,0.05378651,0.007812912,0.8493783],"study_design_scores_gemma":[0.00007599296,0.000081493956,0.0007803781,0.00015974607,0.00023638316,0.00018481222,0.00008687761,0.80550146,0.007404946,0.1801109,0.005337239,0.00003981532],"about_ca_topic_score_codex":0.0019894606,"about_ca_topic_score_gemma":0.0023833027,"teacher_disagreement_score":0.0038627652,"about_ca_system_score_codex":0.00060442183,"about_ca_system_score_gemma":0.0012379504,"threshold_uncertainty_score":0.013131976},"labels":[],"label_agreement":null},{"id":"W1599908556","doi":"10.1007/978-3-642-04633-9_13","title":"Job Scheduling with Lookahead Group Matchmaking for Time/Space Sharing on Multi-core Parallel Machines","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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 Windsor","funders":"","keywords":"Computer science; Scheduling (production processes); Queue; Distributed computing; Heuristics; Cache; Processor sharing; Shared resource; Job queue; Time-sharing; Workload; Job scheduler; Parallel computing; Computer network; Mathematical optimization; Operating system","score_opus":0.023511393298654048,"score_gpt":0.2581085317392102,"score_spread":0.23459713844055619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599908556","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.10033423,0.0011821975,0.88676333,0.00032261465,0.00059455395,0.00021146612,0.0001134408,0.0020691166,0.008409084],"genre_scores_gemma":[0.7597734,0.00020629923,0.23459195,0.00008477766,0.00013722322,0.000109066474,0.00011092738,0.0001467997,0.004839505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995447,0.0000898667,0.000027101738,0.00009388642,0.00012876751,0.000115710915],"domain_scores_gemma":[0.99959534,0.0001461772,0.000030326326,0.00010479914,0.000059204514,0.00006419116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007746373,0.00053286634,0.0011734131,0.0003826133,0.0012400333,0.00093845435,0.0019566463,0.0005252458,0.00356061],"category_scores_gemma":[0.0010582836,0.00043820197,0.0005127645,0.0009397392,0.00046860403,0.0009697155,0.0010043326,0.001042819,0.0005159407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003183654,0.0006386523,0.0007741638,0.00032289818,0.00015768145,0.00026452448,0.00036620614,0.5508642,0.05961123,0.03259999,0.011797531,0.33941916],"study_design_scores_gemma":[0.00007573074,0.00020712157,0.0002528143,0.0000063518846,0.000022992885,0.000043665674,0.000042141302,0.9710187,0.007828425,0.018324222,0.0021559543,0.000021911608],"about_ca_topic_score_codex":0.0024361936,"about_ca_topic_score_gemma":0.003328005,"teacher_disagreement_score":0.00356061,"about_ca_system_score_codex":0.00071050884,"about_ca_system_score_gemma":0.0011548542,"threshold_uncertainty_score":0.011911392},"labels":[],"label_agreement":null},{"id":"W1599981114","doi":"10.1007/978-3-540-39899-8_49","title":"Exploring RSA Ultimate Accuracy by Using Computer Synthetic Images","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","field":"Engineering","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":"Robarts Clinical Trials; London Health Sciences Centre","funders":"","keywords":"Computer science; Imaging phantom; Artificial intelligence; Computer vision; Noise (video); Correlation; Image (mathematics); Pattern recognition (psychology); Mathematics; Nuclear medicine; Medicine","score_opus":0.03429263872147648,"score_gpt":0.24697063324702617,"score_spread":0.2126779945255497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599981114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34357285,0.0010846829,0.6349722,0.0006015159,0.00012179105,0.00006209246,0.0005364984,0.0018444788,0.017203832],"genre_scores_gemma":[0.87896746,0.00022543252,0.118798934,0.000045401306,0.000021844782,0.000017738288,0.00030226825,0.0002917525,0.0013292177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990903,0.00027012735,0.000056290868,0.00013138428,0.0003933142,0.00005861027],"domain_scores_gemma":[0.9912243,0.006378912,0.00037915495,0.000985913,0.0009803661,0.00005135904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018827997,0.00061784656,0.00045688305,0.0007892239,0.00037732846,0.0014503718,0.00083568215,0.0011394406,0.003322867],"category_scores_gemma":[0.017229224,0.00036357483,0.00040180227,0.00072649174,0.0007824744,0.00201308,0.0007455841,0.00072528457,0.0005662355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009423489,0.00010737802,0.0050566536,0.00047165298,0.000077068624,0.00027381006,0.0004842241,0.7420346,0.05203677,0.027797868,0.0023339556,0.16838358],"study_design_scores_gemma":[0.000017134891,0.00012988118,0.0010974576,0.000029044266,0.000023022712,0.00031078796,0.000089977475,0.950262,0.038512163,0.0068896837,0.002609003,0.000029861105],"about_ca_topic_score_codex":0.0015764431,"about_ca_topic_score_gemma":0.0015247043,"teacher_disagreement_score":0.003322867,"about_ca_system_score_codex":0.0006177609,"about_ca_system_score_gemma":0.0003596595,"threshold_uncertainty_score":0.011116087},"labels":[],"label_agreement":null},{"id":"W1600002932","doi":"10.1007/978-3-540-79719-7_24","title":"Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"York University","funders":"","keywords":"Heuristics; Satisfiability; DPLL algorithm; Computer science; Propositional variable; Local search (optimization); Boolean satisfiability problem; Propositional formula; Propositional calculus; Variable (mathematics); Artificial intelligence; Algorithm; Mathematics; Programming language","score_opus":0.026870882627841385,"score_gpt":0.2654654149341441,"score_spread":0.23859453230630273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600002932","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.04405872,0.0008141505,0.93462145,0.00074022217,0.00016071742,0.0003939581,0.00050108513,0.010269674,0.008439978],"genre_scores_gemma":[0.31425473,0.0001811868,0.6752873,0.00062718056,0.00010873432,0.0004194937,0.001485892,0.0015604994,0.0060749566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977253,0.0009009119,0.00013799197,0.00036811715,0.00060158473,0.00026606052],"domain_scores_gemma":[0.9865371,0.011190362,0.00023870017,0.0012369716,0.00060916564,0.00018759552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026218463,0.0015368215,0.0023544424,0.002097087,0.001131502,0.0015158945,0.005575069,0.0024239386,0.025712471],"category_scores_gemma":[0.015264992,0.0013985265,0.0019598196,0.0024837232,0.0017143396,0.006545904,0.004367849,0.0043397127,0.0026261865],"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.0010427154,0.00085592805,0.0011146471,0.0007937782,0.00019474071,0.00020742281,0.00041216466,0.24318528,0.004866773,0.05878221,0.027412007,0.6611323],"study_design_scores_gemma":[0.00012366317,0.00005718534,0.000080107005,0.000026180407,0.00003708749,0.000031372805,0.00005779159,0.95405906,0.0014687742,0.043192744,0.0008548728,0.000011172501],"about_ca_topic_score_codex":0.0058188615,"about_ca_topic_score_gemma":0.017414957,"teacher_disagreement_score":0.025712471,"about_ca_system_score_codex":0.0015633611,"about_ca_system_score_gemma":0.0024367603,"threshold_uncertainty_score":0.086016774},"labels":[],"label_agreement":null},{"id":"W1600018470","doi":"10.1007/11590316_124","title":"Collaborative Rough Clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cluster analysis; Data mining; Rough set; Correlation clustering; Fuzzy clustering; Artificial intelligence","score_opus":0.014942842808003929,"score_gpt":0.24479222183994698,"score_spread":0.22984937903194305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600018470","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.004513723,0.000755707,0.98042816,0.00022547852,0.00019041233,0.00012880602,0.00023540293,0.00090996583,0.012612408],"genre_scores_gemma":[0.13693559,0.0008479695,0.82510346,0.00019128287,0.00023451091,0.0002937232,0.0017636135,0.0004841795,0.034145713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968041,0.00074685185,0.00018493179,0.0007818335,0.0012729411,0.00020938159],"domain_scores_gemma":[0.9973537,0.00058754557,0.00011481033,0.001176057,0.00066464965,0.00010329615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026040445,0.0013916085,0.002989436,0.0029683302,0.0022046743,0.0033828267,0.0031546524,0.002268891,0.013090879],"category_scores_gemma":[0.0057233796,0.0010714597,0.0027292594,0.0035003703,0.00086851546,0.0024946267,0.003286844,0.0016297952,0.006017635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036150255,0.00020016741,0.00065013923,0.00031600773,0.00040801178,0.0001856867,0.00029667403,0.15946345,0.0076429145,0.08950236,0.03990958,0.7010635],"study_design_scores_gemma":[0.00004222124,0.00010636489,0.0006502467,0.000047766072,0.00014988387,0.0003278504,0.00016673747,0.84668493,0.009763879,0.1041947,0.03779295,0.00007250924],"about_ca_topic_score_codex":0.0031590192,"about_ca_topic_score_gemma":0.0051576286,"teacher_disagreement_score":0.013090879,"about_ca_system_score_codex":0.0010650144,"about_ca_system_score_gemma":0.0014763838,"threshold_uncertainty_score":0.04379338},"labels":[],"label_agreement":null},{"id":"W1600049415","doi":"10.1007/978-3-642-13775-4_25","title":"Application of Wave Atoms Decomposition and Extreme Learning Machine for Fingerprint Classification","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Extreme learning machine; Pattern recognition (psychology); Fingerprint (computing); Artificial intelligence; Dimensionality reduction; Principal component analysis; Decomposition; Curse of dimensionality; Feature (linguistics); Fingerprint recognition; Algorithm; Artificial neural network","score_opus":0.03020231767106469,"score_gpt":0.2689959792688525,"score_spread":0.2387936615977878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600049415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062191286,0.00013565287,0.9926916,0.00004809745,0.000021749524,0.000008808283,0.000019444435,0.00012395962,0.00073163427],"genre_scores_gemma":[0.24040608,0.00054954324,0.7538119,0.000061388346,0.00008098936,0.000055101365,0.00017492117,0.00010577731,0.004754256],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997018,0.0000891857,0.000016243936,0.000050171697,0.00012136335,0.000021312784],"domain_scores_gemma":[0.9996147,0.00015951233,0.0000272389,0.000073011404,0.000108699984,0.000016812059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056916825,0.00039836287,0.00055666536,0.0007428614,0.00026244944,0.00062950235,0.0005323198,0.00057648343,0.0019275673],"category_scores_gemma":[0.0012477362,0.00024253859,0.0005604121,0.0010569728,0.00041581216,0.0008047662,0.00087363104,0.00093687174,0.0005866787],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019530645,0.00010320665,0.0011475623,0.0001301838,0.000070758986,0.00009857068,0.000090795096,0.15259932,0.041426953,0.03712329,0.0025474788,0.7644665],"study_design_scores_gemma":[0.0000044348403,0.00002858313,0.0004158964,0.0000048514385,0.000009974147,0.000054711418,0.000008535018,0.9837535,0.0037558258,0.010819409,0.0011360913,0.000008181164],"about_ca_topic_score_codex":0.000517654,"about_ca_topic_score_gemma":0.0005847572,"teacher_disagreement_score":0.0019275673,"about_ca_system_score_codex":0.00016869554,"about_ca_system_score_gemma":0.00028009558,"threshold_uncertainty_score":0.0064483285},"labels":[],"label_agreement":null},{"id":"W1600126388","doi":"10.1007/978-3-540-28634-9_24","title":"Application of Eigenspace Analysis Techniques to Ad-Hoc Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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 Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Artificial intelligence; Computer network; Telecommunications; Wireless","score_opus":0.008112222466846942,"score_gpt":0.24191984303835792,"score_spread":0.23380762057151097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600126388","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.002657326,0.0022544197,0.990006,0.0001207284,0.00013816362,0.0000109840785,0.000018866394,0.0002831456,0.004510297],"genre_scores_gemma":[0.18785468,0.012952458,0.7766515,0.00017394664,0.00068622467,0.00011890071,0.00019323248,0.00033441657,0.021034753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999635,0.0001134009,0.000018748864,0.000047361555,0.00016001762,0.000025485788],"domain_scores_gemma":[0.9993617,0.00040336695,0.000030235386,0.00008079518,0.00010591864,0.000018019491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036779584,0.0009155339,0.0007944169,0.0013733389,0.00045390212,0.0011827445,0.0006569273,0.0006466361,0.0036826492],"category_scores_gemma":[0.0014356395,0.00046670102,0.0006107224,0.0017478133,0.00079602795,0.001416462,0.0008644702,0.0013726243,0.0013650313],"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.00007169457,0.00011137745,0.0005824963,0.00037549078,0.0001318597,0.00025697154,0.00031168252,0.13263868,0.026557175,0.21808067,0.008723682,0.61215824],"study_design_scores_gemma":[0.000013643978,0.000057035086,0.0005280115,0.00007365868,0.000032924454,0.00048644323,0.00009610056,0.66286033,0.0073067765,0.30055192,0.027952168,0.000040984643],"about_ca_topic_score_codex":0.00050692284,"about_ca_topic_score_gemma":0.00046496792,"teacher_disagreement_score":0.0036826492,"about_ca_system_score_codex":0.00023620045,"about_ca_system_score_gemma":0.00021851732,"threshold_uncertainty_score":0.012319684},"labels":[],"label_agreement":null},{"id":"W1600160158","doi":"10.1007/3-540-45061-0_17","title":"Approximating Steiner k-Cuts","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Rounding; Steiner tree problem; Linear programming relaxation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Discrete mathematics; Maximum cut; Minimum weight; Relaxation (psychology); Minimum cut; Linear programming; Graph; Computer science; Algorithm","score_opus":0.0220167658478086,"score_gpt":0.23985756490570773,"score_spread":0.21784079905789913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600160158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24610655,0.0021032982,0.6192592,0.0013990991,0.00043834237,0.00028779428,0.0020273493,0.0024965198,0.12588191],"genre_scores_gemma":[0.4954385,0.0016500736,0.4580839,0.00029421056,0.00020458939,0.0002612352,0.004504153,0.0009827917,0.03858056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.00020794777,0.00006131444,0.00024900457,0.00042599966,0.00017437649],"domain_scores_gemma":[0.99751735,0.0010932293,0.00020703461,0.00066315866,0.00031721412,0.00020204548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007759192,0.0015863088,0.0018881586,0.001683009,0.00080274005,0.0030455783,0.002679683,0.0014917211,0.023214046],"category_scores_gemma":[0.0061517125,0.0011028979,0.0012736911,0.0041286866,0.0010430188,0.004272827,0.002894304,0.0027960276,0.004220094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010390353,0.0003475246,0.0029639895,0.0009963519,0.00020646682,0.0003527032,0.00047444977,0.2709857,0.01136607,0.30975184,0.04298609,0.35852978],"study_design_scores_gemma":[0.00011718568,0.00015338419,0.0011260629,0.00011416952,0.00010240611,0.0006286925,0.00029776848,0.59282255,0.0048350715,0.38432065,0.015450731,0.000031305994],"about_ca_topic_score_codex":0.0017204062,"about_ca_topic_score_gemma":0.003396635,"teacher_disagreement_score":0.023214046,"about_ca_system_score_codex":0.0020418959,"about_ca_system_score_gemma":0.00083915243,"threshold_uncertainty_score":0.07765871},"labels":[],"label_agreement":null},{"id":"W1600331948","doi":"10.1007/11795018_18","title":"Smart Sticky Widgets: Pseudo-haptic Enhancements for Multi-Monitor Displays","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Dalhousie University","funders":"","keywords":"Haptic technology; Computer science; Computer graphics (images); Human–computer interaction; Simulation","score_opus":0.04326856182357072,"score_gpt":0.30309031670075953,"score_spread":0.25982175487718884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600331948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044989463,0.0061366004,0.9105456,0.00033623053,0.0008229588,0.00015080112,0.0006768952,0.013617395,0.02272403],"genre_scores_gemma":[0.34476045,0.00612883,0.53291744,0.00069057883,0.00036370324,0.0002569328,0.0010396217,0.002310537,0.11153184],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998142,0.000026124624,0.000010456174,0.000025185362,0.00009929212,0.000024674855],"domain_scores_gemma":[0.99965155,0.0001648159,0.000021402799,0.000070284106,0.00005473632,0.00003716804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026095184,0.0008577405,0.00039500787,0.00034491767,0.00013966284,0.00083368976,0.0015170022,0.0007610886,0.026734427],"category_scores_gemma":[0.0010337672,0.00049427757,0.0004624581,0.00034028705,0.00020891217,0.0014720522,0.0012172497,0.00080496754,0.004111347],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009874534,0.00012220842,0.00031860234,0.00093381095,0.000068266374,0.00049521565,0.00023622792,0.0014256057,0.4699036,0.009335512,0.018828249,0.4973453],"study_design_scores_gemma":[0.00040374894,0.002194944,0.007211637,0.00045653988,0.00039906186,0.00801606,0.00025539668,0.09161282,0.47626713,0.02292949,0.38999978,0.0002534193],"about_ca_topic_score_codex":0.000101362704,"about_ca_topic_score_gemma":0.0002274841,"teacher_disagreement_score":0.026734427,"about_ca_system_score_codex":0.00009277681,"about_ca_system_score_gemma":0.000060671366,"threshold_uncertainty_score":0.08943564},"labels":[],"label_agreement":null},{"id":"W1600402038","doi":"10.1007/978-3-540-68504-3_13","title":"Persuasion for Stronger Passwords: Motivation and Pilot Study","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Password; Persuasion; Computer science; Cognitive password; Authentication (law); Password policy; Persuasive technology; Computer security; Internet privacy; Password strength; One-time password; World Wide Web; Human–computer interaction; Psychology","score_opus":0.04670647491066098,"score_gpt":0.26247433650565244,"score_spread":0.21576786159499145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600402038","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.9938514,0.000059088667,0.0012038888,0.00020026704,0.00005391811,0.0007972738,0.000042006526,0.00004043293,0.0037516246],"genre_scores_gemma":[0.99133086,0.00006752736,0.00328451,0.00029317613,0.000052584142,0.0007098386,0.000066115244,0.000040803494,0.00415459],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99491656,0.0021841556,0.0002874381,0.00074268936,0.0013302811,0.00053888024],"domain_scores_gemma":[0.90244955,0.08277146,0.0024427546,0.0039731013,0.004938431,0.0034247008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011327972,0.0009629641,0.0009869824,0.0008268979,0.0016664602,0.0025775956,0.0016054813,0.0026078196,0.012932027],"category_scores_gemma":[0.06364886,0.00088031765,0.0005622737,0.000356932,0.0010598323,0.00236139,0.0015447778,0.003587543,0.002641434],"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.039030626,0.2683801,0.13159265,0.0034224344,0.00046011014,0.0030710527,0.115870506,0.002752236,0.121932805,0.01504907,0.012162396,0.286276],"study_design_scores_gemma":[0.025716424,0.30264348,0.39962608,0.00072953466,0.0020726451,0.006002296,0.06208989,0.047024604,0.10083132,0.016370906,0.036067463,0.000825341],"about_ca_topic_score_codex":0.0007723891,"about_ca_topic_score_gemma":0.00048851117,"teacher_disagreement_score":0.012932027,"about_ca_system_score_codex":0.00066929974,"about_ca_system_score_gemma":0.0013034579,"threshold_uncertainty_score":0.059908748},"labels":[],"label_agreement":null},{"id":"W1600429586","doi":"10.1007/978-3-540-30586-6_34","title":"Customisable Semantic Analysis of Texts","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Parsing; Natural language processing; Artificial intelligence; Syntactic predicate; Relation (database); Semantic analysis (machine learning); Semantic relation; Information retrieval; Database","score_opus":0.010644060282955066,"score_gpt":0.2613522510840163,"score_spread":0.2507081908010612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600429586","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.009472642,0.00030967637,0.95968616,0.00028076468,0.00011231856,0.00015704356,0.0015312969,0.019540992,0.0089091305],"genre_scores_gemma":[0.16449921,0.00064952933,0.8088804,0.00019669806,0.00018144539,0.00021580611,0.007719936,0.0051684226,0.012488478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975204,0.0004806855,0.00034036464,0.0007527154,0.0007729671,0.00013296888],"domain_scores_gemma":[0.9951983,0.0016658686,0.00022177439,0.0021189132,0.00070098805,0.000094134724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024236043,0.0009343868,0.0007436231,0.0046446095,0.0009194591,0.0035228643,0.0020062726,0.0007671253,0.010486765],"category_scores_gemma":[0.0069754915,0.0007801853,0.002149441,0.0039515505,0.0020979424,0.007061612,0.004040554,0.0018150451,0.0042124786],"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.00028723862,0.0001184142,0.0017327843,0.000795615,0.00015204714,0.00035308115,0.001729006,0.004969674,0.024743177,0.35498223,0.018304016,0.59183264],"study_design_scores_gemma":[0.00003657818,0.000066082226,0.0018186952,0.0003302996,0.00024635767,0.0007046781,0.00071014534,0.09105992,0.06628958,0.64233285,0.19631825,0.00008654164],"about_ca_topic_score_codex":0.0011439577,"about_ca_topic_score_gemma":0.0017536852,"teacher_disagreement_score":0.010486765,"about_ca_system_score_codex":0.0012483983,"about_ca_system_score_gemma":0.0011805203,"threshold_uncertainty_score":0.035081685},"labels":[],"label_agreement":null},{"id":"W1600470352","doi":"10.1007/11795131_70","title":"Relevant Attribute Discovery in High Dimensional Data: Application to Breast Cancer Gene Expressions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"National Research Council Canada","funders":"","keywords":"Computer science; Cluster analysis; Data mining; Rough set; Genetic programming; Set (abstract data type); Process (computing); Knowledge extraction; Data set; Machine learning; Artificial intelligence; Programming language","score_opus":0.01952987273357598,"score_gpt":0.2575000815303934,"score_spread":0.2379702087968174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600470352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0890968,0.0043724957,0.9010202,0.0012926164,0.00018746947,0.00013741615,0.0010489236,0.001301033,0.0015429845],"genre_scores_gemma":[0.26001027,0.002646814,0.7340776,0.00020124648,0.0002181462,0.00014987437,0.0011678981,0.00012614694,0.0014021649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977574,0.00081820326,0.00018859352,0.00027596133,0.000883157,0.00007673349],"domain_scores_gemma":[0.9887638,0.0093275,0.0003007398,0.00064410525,0.00081084605,0.00015300898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060259774,0.000715392,0.002230403,0.0026346343,0.0010898266,0.0024739983,0.0013289036,0.0011578574,0.0011565109],"category_scores_gemma":[0.012920254,0.00043750933,0.0016182167,0.006403196,0.00084474345,0.0010181381,0.0016154681,0.0018695784,0.00049882464],"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.0005702166,0.00061118894,0.012863082,0.0010551253,0.00033345606,0.0013148093,0.0013308802,0.09447208,0.019319553,0.020246815,0.010427979,0.8374548],"study_design_scores_gemma":[0.00007134378,0.00014717576,0.0054115467,0.00006202819,0.00020486928,0.00097517663,0.00047136517,0.8992077,0.0143547375,0.072208814,0.006806227,0.00007900471],"about_ca_topic_score_codex":0.001164144,"about_ca_topic_score_gemma":0.0015582014,"teacher_disagreement_score":0.0060259774,"about_ca_system_score_codex":0.0005172816,"about_ca_system_score_gemma":0.0008777844,"threshold_uncertainty_score":0.031868815},"labels":[],"label_agreement":null},{"id":"W1600470703","doi":"10.1007/3-540-44886-1_65","title":"Accent Classification Using Support Vector Machine and Hidden Markov Model","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 New Brunswick","funders":"","keywords":"Hidden Markov model; Computer science; Stress (linguistics); Support vector machine; Artificial intelligence; Markov model; Maximum-entropy Markov model; Speech recognition; Natural language processing; Machine learning; Pattern recognition (psychology); Markov chain; Variable-order Markov model","score_opus":0.03799489310180855,"score_gpt":0.268994810596097,"score_spread":0.23099991749428844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600470703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075555146,0.0011813093,0.9147455,0.00016263766,0.0002594297,0.00009538035,0.0005504512,0.0044787102,0.0029714007],"genre_scores_gemma":[0.6427634,0.0008431231,0.34432092,0.000097183736,0.00024729606,0.00010808203,0.0022561166,0.0002757185,0.009088232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948406,0.00011921529,0.000042567885,0.00014006862,0.00012373693,0.00009031478],"domain_scores_gemma":[0.9989158,0.0005416346,0.00006860949,0.000107530715,0.0003104631,0.00005605498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012451219,0.0008193721,0.0013042178,0.0019220344,0.00047186765,0.0011530196,0.00081453775,0.0007289206,0.003817456],"category_scores_gemma":[0.0016218254,0.00033359986,0.0010533505,0.0011640071,0.00025344666,0.0013212457,0.0005943187,0.000986097,0.0033059823],"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.0005692175,0.00018327119,0.0039548785,0.00008699493,0.000094875315,0.00010034745,0.0000472149,0.024688581,0.015478846,0.000988149,0.004672195,0.9491353],"study_design_scores_gemma":[0.000029754348,0.00012655038,0.006142893,0.000017264763,0.000083766514,0.00014884598,0.000073626565,0.97388804,0.014912048,0.0028834548,0.0016516644,0.000042102336],"about_ca_topic_score_codex":0.0020983007,"about_ca_topic_score_gemma":0.0023791613,"teacher_disagreement_score":0.003817456,"about_ca_system_score_codex":0.00026795143,"about_ca_system_score_gemma":0.00034538508,"threshold_uncertainty_score":0.012770712},"labels":[],"label_agreement":null},{"id":"W1600530438","doi":"10.1007/978-3-642-03658-3_110","title":"Using Avatars for Improving Speaker Identification in Captioning","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Closed captioning; Computer science; Avatar; Identification (biology); Speaker identification; Multimedia; Speech recognition; Citizen journalism; Human–computer interaction; Natural language processing; World Wide Web; Artificial intelligence; Speaker recognition; Image (mathematics)","score_opus":0.06586589965452995,"score_gpt":0.27964319868474724,"score_spread":0.2137772990302173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600530438","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.08644617,0.0016855125,0.8759754,0.0004801713,0.0017862634,0.00034195877,0.0007666796,0.011971638,0.020546243],"genre_scores_gemma":[0.3739478,0.0013447668,0.59816575,0.00034517157,0.0006752458,0.00037170167,0.0021995308,0.0021699856,0.020780083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988495,0.00048682187,0.00004877506,0.00027679713,0.00024917317,0.00008882518],"domain_scores_gemma":[0.99704736,0.0012996563,0.00012671614,0.00031462006,0.0010789192,0.00013277814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012081739,0.0015204779,0.0009413729,0.0006706515,0.00056635047,0.0015894535,0.0009895383,0.00151565,0.022776188],"category_scores_gemma":[0.006527464,0.00046806765,0.00057903526,0.00045024586,0.0003714642,0.00267318,0.0016800362,0.0014336298,0.010604779],"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.0016277897,0.00019099453,0.0006712309,0.00079584896,0.00005868507,0.0004169779,0.00075980177,0.006261088,0.30693132,0.0027604487,0.013873033,0.6656528],"study_design_scores_gemma":[0.00013524038,0.0013393632,0.0030691458,0.00028586067,0.0003122502,0.0022137896,0.0013094149,0.4628929,0.4750546,0.0054803,0.047771815,0.00013532849],"about_ca_topic_score_codex":0.00033706077,"about_ca_topic_score_gemma":0.00046137822,"teacher_disagreement_score":0.022776188,"about_ca_system_score_codex":0.00019531476,"about_ca_system_score_gemma":0.00018099547,"threshold_uncertainty_score":0.07619393},"labels":[],"label_agreement":null},{"id":"W1600547396","doi":"10.1007/3-540-36265-7_9","title":"Exploiting Web Document Structure to Improve Storage Management in Proxy Caches","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","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":"Computer science; Cache; Storage management; Proxy (statistics); Latency (audio); Operating system; Database; Page cache; CPU cache; Cache algorithms","score_opus":0.014632604881526238,"score_gpt":0.24249495038007163,"score_spread":0.2278623454985454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600547396","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.6788053,0.0056949463,0.27963597,0.0010454605,0.00046656377,0.00023040989,0.00068565714,0.026061153,0.0073744804],"genre_scores_gemma":[0.9149334,0.0007078351,0.07832246,0.00014664425,0.00013499134,0.00006382788,0.00081488217,0.00064136315,0.0042346143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992488,0.0001349079,0.0001001971,0.00008714163,0.00028485875,0.00014414368],"domain_scores_gemma":[0.9929804,0.0021121113,0.0006148637,0.0023763645,0.0015825336,0.00033378004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011203325,0.00062992756,0.0008251384,0.00125711,0.0012412996,0.002948629,0.0022423558,0.0011494363,0.0026578647],"category_scores_gemma":[0.0074759624,0.0006731665,0.0003583179,0.002542048,0.0005510639,0.00487803,0.0012147208,0.0010064787,0.0007953842],"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.0029913557,0.0009829839,0.014131782,0.00069693226,0.00015562441,0.00051327585,0.00083957514,0.09353489,0.3153861,0.014231146,0.0201536,0.5363828],"study_design_scores_gemma":[0.0003516804,0.0010922217,0.0043658842,0.00007864963,0.00039678594,0.00070164504,0.0004347492,0.56434125,0.40032196,0.012942776,0.014830414,0.0001419441],"about_ca_topic_score_codex":0.0031017489,"about_ca_topic_score_gemma":0.0054845805,"teacher_disagreement_score":0.0031017489,"about_ca_system_score_codex":0.0011940736,"about_ca_system_score_gemma":0.001648906,"threshold_uncertainty_score":0.008891404},"labels":[],"label_agreement":null},{"id":"W1600547859","doi":"10.1007/11867661_36","title":"A Fast Algorithm for Template Matching","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Template matching; Computer science; Enhanced Data Rates for GSM Evolution; Pixel; Matching (statistics); Algorithm; Energy (signal processing); Orientation (vector space); Image processing; Image (mathematics); Computation; Artificial intelligence; Computer vision; Mathematics","score_opus":0.010544372936268177,"score_gpt":0.24312577053284054,"score_spread":0.23258139759657237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600547859","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.0005033736,0.00032691626,0.99436826,0.000035000405,0.0001265399,0.000058504625,0.00011290427,0.0033137465,0.0011547457],"genre_scores_gemma":[0.007085847,0.00032168243,0.9862601,0.00007644687,0.00007584407,0.0001627014,0.0006257155,0.00047523176,0.004916393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848384,0.000141108,0.000090100235,0.00033274,0.0008261478,0.00012600284],"domain_scores_gemma":[0.9987866,0.0003024822,0.000053878426,0.00038989598,0.00041383706,0.00005322433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008679413,0.002134437,0.0021450927,0.0032138254,0.0013506371,0.0022502204,0.004104544,0.002464011,0.024729168],"category_scores_gemma":[0.0029627457,0.0013922009,0.0017888355,0.0049076057,0.00073674053,0.003133146,0.003054889,0.002263091,0.024372298],"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.00013959859,0.000054983764,0.00014841017,0.00015344983,0.000077201374,0.0000963487,0.00004351528,0.0060120965,0.033380903,0.010995636,0.019483099,0.9294148],"study_design_scores_gemma":[0.00027051108,0.00035539165,0.0014987353,0.00013496299,0.00029153007,0.0033323178,0.0001169144,0.60426813,0.14206152,0.07712254,0.17027967,0.00026774828],"about_ca_topic_score_codex":0.003350121,"about_ca_topic_score_gemma":0.0037108331,"teacher_disagreement_score":0.024729168,"about_ca_system_score_codex":0.00068823935,"about_ca_system_score_gemma":0.0013771338,"threshold_uncertainty_score":0.08272731},"labels":[],"label_agreement":null},{"id":"W1600549686","doi":"10.1007/11564751_110","title":"Scheduling with Uncertain Start Dates","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Tuple; Mathematical optimization; Schedule; Job shop scheduling; Sample (material); Operations research; Mathematics","score_opus":0.02581523720451846,"score_gpt":0.2610899292324612,"score_spread":0.23527469202794277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600549686","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.04009816,0.0020713639,0.9159019,0.00091556244,0.000787194,0.00022746138,0.0008195926,0.0008981926,0.038280576],"genre_scores_gemma":[0.6886258,0.0028372577,0.24890482,0.00028110304,0.0010274549,0.0003538788,0.0012609643,0.00053060916,0.05617822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928904,0.00019692887,0.00003961658,0.00016427384,0.00018546567,0.00012457193],"domain_scores_gemma":[0.9984977,0.0008550162,0.00013777321,0.00022846596,0.00012561405,0.00015549564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629807,0.0012451836,0.0018064256,0.0005674195,0.00084353087,0.0019942143,0.002000559,0.0010941144,0.010487992],"category_scores_gemma":[0.0035910015,0.0010652676,0.00078750384,0.0017238666,0.0006942807,0.0018352842,0.0009917388,0.001612539,0.0019952937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008080056,0.0001279718,0.00024742342,0.00047252112,0.000080002406,0.00020824614,0.00010884031,0.7572469,0.0046503767,0.13591316,0.01451967,0.08561689],"study_design_scores_gemma":[0.0000976203,0.00014334086,0.00021042794,0.000034603512,0.000033928718,0.00008218329,0.000036134432,0.7988553,0.0020177276,0.18652594,0.011934097,0.000028626617],"about_ca_topic_score_codex":0.0019752665,"about_ca_topic_score_gemma":0.0019178989,"teacher_disagreement_score":0.010487992,"about_ca_system_score_codex":0.0013533321,"about_ca_system_score_gemma":0.001442653,"threshold_uncertainty_score":0.035085857},"labels":[],"label_agreement":null},{"id":"W1600592838","doi":"10.1007/978-3-540-24855-2_123","title":"An Island-Based GA Implementation for VLSI Standard-Cell Placement","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Speedup; Computer science; Asynchronous communication; Parallel computing; Very-large-scale integration; Scheme (mathematics); Convergence (economics); Computation; Algorithm; Embedded system; Mathematics; Telecommunications","score_opus":0.011983564087182179,"score_gpt":0.26375240782384834,"score_spread":0.2517688437366662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600592838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04061378,0.00024102934,0.9440368,0.00011216572,0.00013349627,0.00008351363,0.000065984495,0.0027301772,0.011983088],"genre_scores_gemma":[0.31998143,0.00013951986,0.6717407,0.00010657097,0.00001699878,0.000122038065,0.0001473691,0.00015643898,0.007588939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993026,0.000014491726,0.0000035667497,0.000010376047,0.000028811994,0.000012454938],"domain_scores_gemma":[0.99985874,0.000037641552,0.000007433071,0.000032027325,0.000053619777,0.000010593044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013056384,0.0003088547,0.00034914305,0.00035542998,0.00030290466,0.00036194664,0.0015684263,0.00052245805,0.005199017],"category_scores_gemma":[0.00037901962,0.00018615316,0.0002555884,0.00040665525,0.00016728467,0.0003259513,0.0003703854,0.0005460987,0.0009443761],"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.00025066154,0.00027402822,0.0007954977,0.0001753769,0.00009630686,0.00021286702,0.00013400335,0.34126174,0.104523204,0.020198496,0.0075677317,0.5245101],"study_design_scores_gemma":[0.000040864452,0.00013110177,0.0002359753,0.000011611334,0.00002953025,0.00009358329,0.000016947433,0.981205,0.011955398,0.0029539082,0.0033146518,0.000011424397],"about_ca_topic_score_codex":0.003416029,"about_ca_topic_score_gemma":0.010097639,"teacher_disagreement_score":0.005199017,"about_ca_system_score_codex":0.0003069098,"about_ca_system_score_gemma":0.0004727296,"threshold_uncertainty_score":0.017392457},"labels":[],"label_agreement":null},{"id":"W1600640230","doi":"10.1007/978-3-540-73099-6_7","title":"Bounded Model Checking with Description Logic Reasoning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Model checking; Bounded function; Computer science; Abstraction model checking; Rotation formalisms in three dimensions; Representation (politics); Theoretical computer science; Consistency (knowledge bases); Solver; Non-monotonic logic; Algorithm; Knowledge representation and reasoning; Programming language; Mathematics; Artificial intelligence","score_opus":0.06949350271629555,"score_gpt":0.29908093031899025,"score_spread":0.22958742760269468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600640230","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.0033201778,0.000284552,0.98871744,0.00027880992,0.000054388547,0.000083243256,0.00013078279,0.00169378,0.0054367553],"genre_scores_gemma":[0.31503132,0.0008194641,0.67207885,0.0004649428,0.000095562915,0.0005195108,0.0011197617,0.0012182669,0.008652287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892691,0.004415555,0.0005254426,0.0010494811,0.00402298,0.0007174713],"domain_scores_gemma":[0.983083,0.012394439,0.0003751541,0.0032401276,0.0007685647,0.00013874455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005734821,0.0018132405,0.0021075516,0.00218173,0.0012239686,0.004276539,0.0061654644,0.0019277703,0.009838826],"category_scores_gemma":[0.01821029,0.0021541344,0.003971679,0.002176583,0.004751178,0.009680035,0.0064010546,0.0049284934,0.0018447654],"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.00025210812,0.0001507974,0.00030054164,0.000532316,0.00014345725,0.00022492479,0.00022266291,0.14000513,0.0037059772,0.74276185,0.0049070152,0.106793255],"study_design_scores_gemma":[0.000071049566,0.000018402834,0.000041411196,0.000082751925,0.00005330458,0.000054025222,0.000027025222,0.3151806,0.008027051,0.6718184,0.004602846,0.000022965842],"about_ca_topic_score_codex":0.0032190108,"about_ca_topic_score_gemma":0.0033538581,"teacher_disagreement_score":0.009838826,"about_ca_system_score_codex":0.0029502558,"about_ca_system_score_gemma":0.0025953713,"threshold_uncertainty_score":0.032914102},"labels":[],"label_agreement":null},{"id":"W1600658344","doi":"10.1007/978-3-540-87744-8_4","title":"On Dominance Reporting in 3D","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pointer (user interface); Linear space; Algorithm; Running time; Time complexity; Preprocessor; Data structure; Grid; Range (aeronautics); Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence; Programming language","score_opus":0.02422402868927025,"score_gpt":0.2632892819544189,"score_spread":0.23906525326514866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600658344","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.02450139,0.0034684062,0.92178464,0.0027589223,0.0011505578,0.00013172383,0.0008353153,0.0009980882,0.044370882],"genre_scores_gemma":[0.53590435,0.00811003,0.3948332,0.0022374569,0.0033934354,0.00046758447,0.0026256908,0.0010930424,0.051335163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949528,0.001822341,0.0003758921,0.0005442016,0.0016713351,0.00063349673],"domain_scores_gemma":[0.9802312,0.012697351,0.0010746539,0.0027772298,0.0024873368,0.00073214684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004702564,0.0012997115,0.0017913977,0.0027935063,0.0017596134,0.004537531,0.0030236347,0.0016429495,0.0118123805],"category_scores_gemma":[0.027343322,0.0007258837,0.001170331,0.0040978934,0.0024693026,0.0080985585,0.0059743156,0.0036868453,0.0022892612],"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.00017186544,0.00008947386,0.0010665401,0.00019761623,0.000035161687,0.00013580332,0.00039421045,0.032757863,0.0015648438,0.79122645,0.032938875,0.13942131],"study_design_scores_gemma":[0.000019025807,0.000043335855,0.00031667703,0.00007261578,0.000021695354,0.00013507545,0.00012723773,0.14817321,0.0010010242,0.83636403,0.0136907,0.000035340392],"about_ca_topic_score_codex":0.004455129,"about_ca_topic_score_gemma":0.0034245995,"teacher_disagreement_score":0.0118123805,"about_ca_system_score_codex":0.0015548555,"about_ca_system_score_gemma":0.0015331805,"threshold_uncertainty_score":0.03951639},"labels":[],"label_agreement":null},{"id":"W1600691621","doi":"10.1007/11581772_46","title":"Camera Motion Detection in Video Sequences Using Motion Cooccurrences","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer vision; Artificial intelligence; Computer science; Motion field; Quarter-pixel motion; Zoom; Motion estimation; Motion (physics); Structure from motion; Motion compensation; Camera auto-calibration; Block-matching algorithm; Match moving; Tilt (camera); Motion analysis; Computer graphics (images); Camera resectioning; Video tracking; Mathematics; Video processing; Optics; Physics","score_opus":0.02662637726319658,"score_gpt":0.2887000507135169,"score_spread":0.26207367345032034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600691621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1004195,0.0020937312,0.891417,0.00008884065,0.00015014775,0.00012650873,0.00037139855,0.0013250797,0.0040076864],"genre_scores_gemma":[0.47118703,0.0023394034,0.5213465,0.00008817994,0.00019560207,0.00011415936,0.00092209264,0.00016157345,0.003645431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968123,0.000029619641,0.00002012132,0.0000954523,0.00013146625,0.000042073352],"domain_scores_gemma":[0.99947673,0.00021411906,0.000083370454,0.000048114827,0.00013434133,0.000043225133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028041756,0.0006036326,0.00067387125,0.0033104082,0.00029251736,0.0005951018,0.00049579155,0.00063739624,0.0016141383],"category_scores_gemma":[0.0011442063,0.00035980006,0.0004717494,0.002913814,0.00025091774,0.0008062088,0.0004750553,0.00039513383,0.0010752318],"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.00031539498,0.000114938724,0.002501243,0.00022836354,0.000086093096,0.00023285563,0.000055580367,0.0050152643,0.2234481,0.0010225169,0.001216565,0.76576304],"study_design_scores_gemma":[0.000054522086,0.0004200843,0.03752821,0.00012586081,0.00032779737,0.003008114,0.00017888547,0.6612089,0.2839252,0.0040908926,0.009051014,0.00008047152],"about_ca_topic_score_codex":0.0017700451,"about_ca_topic_score_gemma":0.0035822578,"teacher_disagreement_score":0.0033104082,"about_ca_system_score_codex":0.00021472349,"about_ca_system_score_gemma":0.0002869066,"threshold_uncertainty_score":0.0053997636},"labels":[],"label_agreement":null},{"id":"W1600715255","doi":"10.1007/bfb0095026","title":"The introduction and evaluation of object orientation in a company developing real-time embedded systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Terrafix Geosynthetics (Canada)","funders":"Staffordshire University","keywords":"Computer science; Object-orientation; Suite; Process (computing); Adaptation (eye); Context (archaeology); Object (grammar); Product (mathematics); Orientation (vector space); Quality (philosophy); New product development; Process management; Software engineering; Software; Object-oriented programming; Work (physics); Selection (genetic algorithm); Engineering management; Systems engineering; Artificial intelligence; Engineering; Business; Marketing; Programming language","score_opus":0.021293736115135235,"score_gpt":0.28610480164444474,"score_spread":0.2648110655293095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600715255","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.9583771,0.0007766737,0.007064536,0.00057993946,0.00006997794,0.00018227029,0.00020506905,0.0001550349,0.03258927],"genre_scores_gemma":[0.9653817,0.0009171793,0.014978896,0.00029977754,0.000037368358,0.000105997904,0.00044998014,0.0000928038,0.017736329],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99784553,0.0011079512,0.00010425664,0.00013397928,0.0006151579,0.00019320968],"domain_scores_gemma":[0.9930443,0.004303635,0.0004985635,0.00027317324,0.001311925,0.0005683332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002816975,0.00036110965,0.00019436209,0.00072862965,0.0007249999,0.0011046387,0.00046711514,0.0008983476,0.0019606703],"category_scores_gemma":[0.007774594,0.00024014802,0.00020813617,0.0013760095,0.0006978169,0.0010485346,0.0007166813,0.0006502322,0.0005184292],"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.0034700516,0.0074967165,0.14182921,0.00093445554,0.000041267638,0.0028369327,0.0409711,0.009814323,0.03486361,0.017591128,0.010325508,0.7298257],"study_design_scores_gemma":[0.0005676704,0.022831619,0.7119114,0.00056172285,0.0002323309,0.003117073,0.042870123,0.026881102,0.07486428,0.008330145,0.1074819,0.0003505706],"about_ca_topic_score_codex":0.010424559,"about_ca_topic_score_gemma":0.014728912,"teacher_disagreement_score":0.010424559,"about_ca_system_score_codex":0.001753297,"about_ca_system_score_gemma":0.0010629436,"threshold_uncertainty_score":0.020727754},"labels":[],"label_agreement":null},{"id":"W1600793452","doi":"10.1007/11428831_98","title":"Genetically Dynamic Optimization Based Fuzzy Polynomial Neural Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Computer science; Artificial neural network; Fuzzy logic; Neuro-fuzzy; Genetic algorithm; Parametric statistics; Polynomial; Exploit; Artificial intelligence; Mathematical optimization; Fuzzy control system; Machine learning; Mathematics","score_opus":0.007827843154844501,"score_gpt":0.2094691200591741,"score_spread":0.2016412769043296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600793452","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.067538604,0.00055127864,0.91697454,0.0002576407,0.00011544711,0.000040941322,0.000030003574,0.0003113287,0.0141802225],"genre_scores_gemma":[0.832169,0.00044771464,0.15762833,0.00007318855,0.000042936295,0.00009336253,0.000053595344,0.000066562774,0.009425322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998957,0.00002311715,0.0000033116426,0.000026806954,0.000036522353,0.0000145631],"domain_scores_gemma":[0.99976236,0.00011755757,0.000032137563,0.000018481785,0.000056840352,0.0000126237765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029486997,0.00037452026,0.0005077447,0.00032078754,0.0003844106,0.0005127904,0.0006846544,0.0007354848,0.0019756462],"category_scores_gemma":[0.0010479524,0.00024586666,0.00037619777,0.00049595063,0.00057313405,0.0005239682,0.00053400506,0.0005967797,0.00024375775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021750826,0.000016514648,0.0001335473,0.000023487944,0.000010151002,0.000019948831,0.000022933915,0.9419592,0.0031296276,0.015865853,0.00032690758,0.038470056],"study_design_scores_gemma":[0.000004091921,0.000015764548,0.000056100365,0.0000023516084,0.0000034934692,0.000008444788,0.000002830744,0.99704427,0.00047493153,0.0020762177,0.00030831143,0.0000032926357],"about_ca_topic_score_codex":0.00467063,"about_ca_topic_score_gemma":0.003969358,"teacher_disagreement_score":0.00467063,"about_ca_system_score_codex":0.00091592007,"about_ca_system_score_gemma":0.0004939891,"threshold_uncertainty_score":0.0092868805},"labels":[],"label_agreement":null},{"id":"W1600794427","doi":"10.1007/978-3-540-85920-8_13","title":"Measuring the Related Properties of Linearity and Elongation of Point Sets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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 Ottawa","funders":"","keywords":"Elongation; Linearity; Measure (data warehouse); Pixel; Computer science; Boundary (topology); Algorithm; Mathematics; Artificial intelligence; Mathematical analysis; Data mining; Physics; Materials science","score_opus":0.024291125174129055,"score_gpt":0.2173621441674168,"score_spread":0.19307101899328777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600794427","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.5709004,0.0011034989,0.41877198,0.0001699576,0.000054220058,0.00008957493,0.0005535121,0.00067852036,0.0076783043],"genre_scores_gemma":[0.947957,0.00041242153,0.049677774,0.000035345314,0.00006952546,0.000058589478,0.00061050267,0.0001292036,0.0010497273],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99685824,0.000600051,0.00024008944,0.00086137076,0.001206039,0.00023427785],"domain_scores_gemma":[0.9571185,0.028723527,0.0062769777,0.0036724631,0.0031207527,0.0010877169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023802095,0.0007984096,0.0009319133,0.0029410056,0.00045601392,0.0024421422,0.0013666695,0.0011493136,0.001872028],"category_scores_gemma":[0.026635244,0.0006762881,0.00056702865,0.0025073206,0.0027769066,0.0051450706,0.0020065915,0.0012073186,0.00078036974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022059125,0.00041725964,0.26149833,0.00097598176,0.00035633938,0.0006429718,0.001954936,0.107543,0.1999579,0.05794395,0.0016728344,0.36483052],"study_design_scores_gemma":[0.00010696791,0.0019747515,0.2514257,0.00019689518,0.0002935843,0.003687867,0.0024360626,0.50755304,0.15360413,0.07442398,0.0039193244,0.0003777409],"about_ca_topic_score_codex":0.00084012613,"about_ca_topic_score_gemma":0.0007589372,"teacher_disagreement_score":0.0029410056,"about_ca_system_score_codex":0.0008195247,"about_ca_system_score_gemma":0.00044497426,"threshold_uncertainty_score":0.012587905},"labels":[],"label_agreement":null},{"id":"W1600862691","doi":"10.1007/978-3-642-31753-8_9","title":"Recovering Role-Based Access Control Security Models from Dynamic Web Applications","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Queen's University","funders":"","keywords":"Computer science; Access control; Role-based access control; Control (management); Computer security; World Wide Web; Artificial intelligence","score_opus":0.010410136082550363,"score_gpt":0.23705014347480832,"score_spread":0.22664000739225795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600862691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06671585,0.00020131047,0.9288458,0.00023727525,0.000035583325,0.00010677864,0.00022095045,0.0024819926,0.0011544953],"genre_scores_gemma":[0.8287396,0.00025563317,0.16770312,0.000083601706,0.000037932394,0.00013470011,0.00075726263,0.00034152152,0.0019465944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969324,0.0006788908,0.00016760289,0.000415849,0.001456728,0.00034845032],"domain_scores_gemma":[0.9920982,0.003904307,0.0005809558,0.002420832,0.00083061564,0.00016507843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022515699,0.0013315623,0.0010785342,0.0013943618,0.00058682775,0.002343314,0.0023287018,0.0017551065,0.0012128236],"category_scores_gemma":[0.014002732,0.0011304758,0.0018943506,0.0008984246,0.0014740111,0.004026867,0.0026998946,0.003372177,0.0005907774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049422734,0.0002995573,0.0029148655,0.0001435625,0.00011212179,0.000676901,0.00040885236,0.8194946,0.014380814,0.06657346,0.001903079,0.09259784],"study_design_scores_gemma":[0.0000070868828,0.000010932252,0.000085401545,0.000006351611,0.000008621755,0.000027037233,0.00002017691,0.9760292,0.0017818692,0.021758597,0.00025838442,0.0000063133834],"about_ca_topic_score_codex":0.004418569,"about_ca_topic_score_gemma":0.0049785147,"teacher_disagreement_score":0.004418569,"about_ca_system_score_codex":0.0014261147,"about_ca_system_score_gemma":0.0014275475,"threshold_uncertainty_score":0.0119075775},"labels":[],"label_agreement":null},{"id":"W1600987055","doi":"10.1007/978-3-540-73437-6_15","title":"A New and Faster Method of Sorting by Transpositions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Transposition (logic); Sorting; Computer science; Computation; Algorithm; Time complexity; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.01470070926883479,"score_gpt":0.27258271131568046,"score_spread":0.2578820020468457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600987055","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.0036354351,0.00053295185,0.98141646,0.00021456924,0.00069194275,0.00011286857,0.00018759233,0.006418029,0.0067902515],"genre_scores_gemma":[0.025401322,0.00064435875,0.9461806,0.00026932175,0.00027781955,0.0002557337,0.0007697628,0.0017249444,0.024476042],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798155,0.00021686197,0.00015316842,0.0005239431,0.00095432834,0.00017010917],"domain_scores_gemma":[0.9986382,0.00032003934,0.00005795017,0.00059215695,0.00031577516,0.00007576124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086038443,0.0020143182,0.0026025602,0.0027058574,0.0018146434,0.003029194,0.003653294,0.0017100087,0.02229506],"category_scores_gemma":[0.0021486855,0.001150035,0.0022841536,0.0042622294,0.0015667432,0.0053182933,0.0030987482,0.0032916572,0.012719648],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003695136,0.0001911367,0.0002530245,0.00043866766,0.00010827944,0.00012889858,0.00020965628,0.007707824,0.06213419,0.101759255,0.028798357,0.7979011],"study_design_scores_gemma":[0.00049529865,0.00050403347,0.000839904,0.00016002158,0.0003348151,0.0021850632,0.00020020254,0.24051623,0.14726935,0.2817408,0.32538214,0.000372164],"about_ca_topic_score_codex":0.0021060167,"about_ca_topic_score_gemma":0.0022754506,"teacher_disagreement_score":0.02229506,"about_ca_system_score_codex":0.0011730426,"about_ca_system_score_gemma":0.001670631,"threshold_uncertainty_score":0.074584424},"labels":[],"label_agreement":null},{"id":"W1601009504","doi":"10.1007/978-3-540-74320-0_3","title":"Comparing Anomaly Detection Techniques for HTTP","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Defense Advanced Research Projects Agency; Mitacs; National Science Foundation","keywords":"Computer science; Anomaly detection; Exploit; Anomaly (physics); Protocol (science); Data mining; Server; Web server; Hypertext Transfer Protocol; Computer security; The Internet; Computer network; World Wide Web","score_opus":0.028606219867413848,"score_gpt":0.26178611537624463,"score_spread":0.23317989550883078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601009504","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.5814047,0.0028632707,0.4029587,0.00041875904,0.0005471049,0.00013654288,0.0005677319,0.0073348265,0.0037684145],"genre_scores_gemma":[0.8541939,0.0005999433,0.14134395,0.00006140253,0.00013900442,0.0000491342,0.0012213552,0.00034431872,0.0020469362],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957064,0.00093640626,0.00033780845,0.000495993,0.0021519635,0.00037147096],"domain_scores_gemma":[0.97378564,0.018191455,0.0008115939,0.0021639252,0.004691451,0.00035601575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003832968,0.00096911786,0.0011038859,0.0037356333,0.0006266578,0.0012542199,0.0019651328,0.0015162858,0.0014633273],"category_scores_gemma":[0.018968632,0.00028557045,0.0009447933,0.0024846026,0.0005109466,0.0029166264,0.0010866703,0.001289235,0.00065035676],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004048692,0.0007340423,0.037847996,0.00038515317,0.00054377964,0.00025858305,0.00023839719,0.07405865,0.028495694,0.0040521147,0.005533365,0.8438035],"study_design_scores_gemma":[0.000085873944,0.0010048739,0.014897551,0.000029003924,0.00029027768,0.0008183931,0.00030835255,0.930651,0.041359086,0.00781792,0.0026764304,0.00006119934],"about_ca_topic_score_codex":0.002431453,"about_ca_topic_score_gemma":0.0021949606,"teacher_disagreement_score":0.003832968,"about_ca_system_score_codex":0.00072352454,"about_ca_system_score_gemma":0.0006225891,"threshold_uncertainty_score":0.020270884},"labels":[],"label_agreement":null},{"id":"W1601013115","doi":"10.1007/3-540-44522-6_33","title":"Parallel Techniques for Rule-Based Scene Interpretation","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Unary operation; Artificial intelligence; Consistency (knowledge bases); Extension (predicate logic); Interpretation (philosophy); Pattern recognition (psychology); Isolation (microbiology); Programming language; Mathematics","score_opus":0.015346595561618465,"score_gpt":0.2624215813510269,"score_spread":0.24707498578940842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601013115","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.0017998319,0.00018479566,0.9901613,0.000038773047,0.000063374,0.00006680522,0.00012808519,0.005370153,0.002186852],"genre_scores_gemma":[0.033924803,0.0003251249,0.9592248,0.00009300441,0.000047694743,0.00014674828,0.00082307495,0.0007142544,0.0047005154],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990214,0.00008513983,0.00009602803,0.00030467543,0.00041674267,0.00007610641],"domain_scores_gemma":[0.99875474,0.00031807987,0.000040250325,0.00051476655,0.00034092332,0.000031333115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641883,0.001703868,0.0017157659,0.0017320565,0.00096613594,0.0023884599,0.0035078197,0.0013672971,0.020651182],"category_scores_gemma":[0.0021878018,0.0012574783,0.0023828312,0.0022794497,0.0009784544,0.0030133403,0.002064359,0.002142409,0.008405347],"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.00019229481,0.0001510062,0.00023875193,0.00021591422,0.00010376288,0.00018630833,0.00013075118,0.022013212,0.024106976,0.020550111,0.009743722,0.9223672],"study_design_scores_gemma":[0.000101146135,0.000120664634,0.0006108508,0.00007046203,0.00018124137,0.000502281,0.00014316823,0.78824854,0.05385808,0.11668023,0.039421238,0.00006212954],"about_ca_topic_score_codex":0.007000165,"about_ca_topic_score_gemma":0.010234608,"teacher_disagreement_score":0.020651182,"about_ca_system_score_codex":0.0006640969,"about_ca_system_score_gemma":0.0010869633,"threshold_uncertainty_score":0.06908512},"labels":[],"label_agreement":null},{"id":"W1601014517","doi":"10.1007/978-3-642-18098-9_2","title":"A Summary of Some Discrete-Event System Control Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Queen's University","funders":"","keywords":"Decidability; Computer science; Automaton; Event (particle physics); Process (computing); Control (management); Formal language; Key (lock); Regular language; Discrete event dynamic system; Theoretical computer science; Distributed computing; Algorithm; Programming language; Discrete system; Artificial intelligence; Computer security","score_opus":0.019745244773207507,"score_gpt":0.22936283912565325,"score_spread":0.20961759435244576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601014517","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035959182,0.044609215,0.8680175,0.0039126095,0.0015419937,0.00015951903,0.0006104784,0.00027828416,0.077274404],"genre_scores_gemma":[0.25765693,0.1229396,0.45873168,0.0031023233,0.006479084,0.0008718236,0.0032829968,0.0003572798,0.14657827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994499,0.00010403521,0.000067633635,0.00011962805,0.00022126568,0.00003747286],"domain_scores_gemma":[0.99949527,0.00031524422,0.000032128213,0.000049930808,0.00008835195,0.00001895176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921947,0.0014351276,0.0012324395,0.0009996783,0.0007431248,0.0027873549,0.0014190321,0.0016765696,0.01457666],"category_scores_gemma":[0.0017861233,0.00058122905,0.0014509239,0.001966131,0.00081505213,0.0024419646,0.0009985156,0.002107727,0.002706834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010096688,0.00017219619,0.00027645906,0.001862171,0.00007897344,0.0003094136,0.00013620101,0.1091447,0.0015182407,0.5668955,0.02696206,0.29254308],"study_design_scores_gemma":[0.00004818919,0.00009871461,0.00041769375,0.00027767537,0.000058520174,0.00028732087,0.000081373146,0.16526242,0.0010805954,0.71417904,0.118164755,0.000043723878],"about_ca_topic_score_codex":0.0023648276,"about_ca_topic_score_gemma":0.0015549384,"teacher_disagreement_score":0.01457666,"about_ca_system_score_codex":0.0009574873,"about_ca_system_score_gemma":0.0007833642,"threshold_uncertainty_score":0.04876381},"labels":[],"label_agreement":null},{"id":"W1601136399","doi":"10.1007/978-3-540-39406-8_11","title":"L-ToPSS – Push-Oriented Location-Based Services","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01013617173920688,"score_gpt":0.22494480688487498,"score_spread":0.2148086351456681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601136399","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.01462919,0.0012027947,0.889795,0.0011759005,0.0011425263,0.00028578006,0.00059086474,0.02301902,0.068159014],"genre_scores_gemma":[0.45699382,0.003773134,0.39193928,0.00214935,0.001059544,0.00042307738,0.0024767008,0.00260254,0.13858253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993259,0.00009356888,0.00005371062,0.00009855802,0.00031518567,0.000113048096],"domain_scores_gemma":[0.9992416,0.00009910474,0.00005425201,0.0003131727,0.00020335185,0.000088623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006338312,0.00071430777,0.00060804666,0.0009544584,0.0007159635,0.0027378597,0.0017273411,0.0012277506,0.006773924],"category_scores_gemma":[0.0015016705,0.0004896643,0.0005683727,0.0013608484,0.00089673896,0.0029467777,0.0028755043,0.0014623746,0.009715052],"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.00047177932,0.00018225732,0.0012412067,0.0006979412,0.00008074749,0.0007304696,0.000572184,0.008960593,0.049544744,0.19849114,0.069842756,0.6691842],"study_design_scores_gemma":[0.00010039087,0.00032710907,0.0008819767,0.000175638,0.00012565218,0.0021647867,0.00037533778,0.11553234,0.07183571,0.10086708,0.70747274,0.0001412519],"about_ca_topic_score_codex":0.0018920305,"about_ca_topic_score_gemma":0.0013490828,"teacher_disagreement_score":0.006773924,"about_ca_system_score_codex":0.0006968586,"about_ca_system_score_gemma":0.0010287719,"threshold_uncertainty_score":0.02266103},"labels":[],"label_agreement":null},{"id":"W1601188317","doi":"10.1007/978-3-540-39893-6_13","title":"Modeling SystemC Fixed-Point Arithmetic in HOL","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"Concordia University","funders":"","keywords":"SystemC; Fixed-point arithmetic; HOL; Computer science; Netlist; Fixed point; Rounding; Arithmetic; Floating point; Theoretical computer science; Algorithm; Programming language; Embedded system; Mathematics","score_opus":0.023627698849976793,"score_gpt":0.2517938118826556,"score_spread":0.2281661130326788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601188317","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.035182595,0.0003611264,0.91107625,0.00023532154,0.00013889508,0.00007118335,0.00017798512,0.0018429878,0.050913636],"genre_scores_gemma":[0.7635674,0.0006815157,0.19997314,0.00017200444,0.00014733746,0.00017321072,0.0004387084,0.00067973824,0.034167003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997031,0.000061086495,0.000016662063,0.000043853917,0.00012479053,0.00005045683],"domain_scores_gemma":[0.9997447,0.00007912394,0.000025758804,0.000080303005,0.000058191254,0.000011917015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004373957,0.00059135654,0.00041581038,0.000759478,0.00054203696,0.0018105824,0.0011603218,0.0006762375,0.008940028],"category_scores_gemma":[0.0009948157,0.0003124689,0.0006870797,0.00073721533,0.0012056251,0.002396562,0.00090461574,0.0012190604,0.0016311319],"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.000037444195,0.000022629718,0.0002272259,0.000079575366,0.00001181789,0.00008195484,0.00014408908,0.05336834,0.0023120702,0.91920775,0.0012933386,0.023213647],"study_design_scores_gemma":[0.000031882497,0.0000512254,0.00013705398,0.00003587101,0.000027423373,0.00009067168,0.000056452176,0.32224286,0.004376834,0.65535295,0.017576063,0.000020670404],"about_ca_topic_score_codex":0.001739256,"about_ca_topic_score_gemma":0.0019615327,"teacher_disagreement_score":0.008940028,"about_ca_system_score_codex":0.00084344205,"about_ca_system_score_gemma":0.0006541297,"threshold_uncertainty_score":0.029907405},"labels":[],"label_agreement":null},{"id":"W1601201751","doi":"10.1007/11510888_33","title":"Prediction of Secondary Protein Structure Content from Primary Sequence Alone – A Feature Selection Based Approach","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Feature selection; Computer science; Representation (politics); Artificial intelligence; Set (abstract data type); Pattern recognition (psychology); Feature (linguistics); Protein function prediction; Selection (genetic algorithm); Sequence (biology); Protein secondary structure; Function (biology); Data mining; Machine learning; Protein function; Biology","score_opus":0.015563524884517468,"score_gpt":0.2160696792375443,"score_spread":0.20050615435302682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601201751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43724996,0.0013470975,0.55501634,0.000111696085,0.00006105266,0.00014807521,0.0011225422,0.0031398218,0.001803422],"genre_scores_gemma":[0.7631457,0.0006180109,0.22936623,0.000077835386,0.00009511077,0.00013418385,0.0037698187,0.0001953675,0.0025978144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998217,0.00002717479,0.000016388207,0.000050109044,0.000058480364,0.000026213791],"domain_scores_gemma":[0.999453,0.00028351133,0.000051483938,0.00003934692,0.0001401891,0.00003244513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005506599,0.00077192555,0.0012678148,0.0017336368,0.00030326325,0.00044483642,0.00051955687,0.0005354066,0.0011229535],"category_scores_gemma":[0.0005480946,0.00026093496,0.0010383223,0.0011424795,0.00019080352,0.00043019073,0.00031583835,0.00043199127,0.0009069844],"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.0009256864,0.00043236234,0.010612956,0.00019320405,0.00024019492,0.00045492302,0.00004622847,0.030594535,0.3238327,0.00040007234,0.0026922575,0.6295749],"study_design_scores_gemma":[0.0000927009,0.00076704466,0.03209224,0.000023090137,0.0003650792,0.0007521477,0.00005513423,0.8923807,0.06957815,0.002078164,0.001755026,0.00006048453],"about_ca_topic_score_codex":0.0009768021,"about_ca_topic_score_gemma":0.0011877669,"teacher_disagreement_score":0.0017336368,"about_ca_system_score_codex":0.00019563868,"about_ca_system_score_gemma":0.00027462246,"threshold_uncertainty_score":0.0037566423},"labels":[],"label_agreement":null},{"id":"W1601278558","doi":"10.1007/978-3-642-30353-1_1","title":"Applying Latent Semantic Analysis to Tag-Based Community Recommendations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Latent semantic analysis; Space (punctuation); World Wide Web; Probabilistic latent semantic analysis; Information retrieval; Semantic Web; Semantic analysis (machine learning); Recommender system; Quality (philosophy); Semantics (computer science); Topic model; Data science; Artificial intelligence","score_opus":0.04423245239012577,"score_gpt":0.2869917305249352,"score_spread":0.24275927813480944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601278558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01874873,0.0008661792,0.9770229,0.00018955312,0.00010438907,0.00010777713,0.00050152105,0.0012278352,0.0012311339],"genre_scores_gemma":[0.3628032,0.0008477137,0.6287226,0.00012009058,0.00026506657,0.000242996,0.0026840693,0.00022050596,0.0040937434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701643,0.0010744028,0.00021734925,0.00051967584,0.0010031838,0.00016896307],"domain_scores_gemma":[0.9939196,0.003922091,0.00028242284,0.0007664521,0.0009901895,0.000119186865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025946256,0.0009489331,0.0013508036,0.0052128704,0.001153547,0.0020746922,0.001576534,0.0012749078,0.0023635263],"category_scores_gemma":[0.012367338,0.0006632854,0.0017893984,0.0058332095,0.000579192,0.0035194978,0.0018128348,0.0017199568,0.0014085606],"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.00053355476,0.00076813786,0.007878845,0.00046879533,0.0007870207,0.0001401511,0.00059092254,0.07811247,0.012276571,0.0170201,0.011730457,0.869693],"study_design_scores_gemma":[0.000043523156,0.000071361595,0.0015536149,0.00003807796,0.00012452462,0.00009545959,0.000121126744,0.96290004,0.0029610638,0.029729147,0.0023152004,0.000046886653],"about_ca_topic_score_codex":0.012358493,"about_ca_topic_score_gemma":0.023923824,"teacher_disagreement_score":0.012358493,"about_ca_system_score_codex":0.00083230744,"about_ca_system_score_gemma":0.0010937366,"threshold_uncertainty_score":0.024573088},"labels":[],"label_agreement":null},{"id":"W1601284508","doi":"10.1007/978-3-540-69057-3_44","title":"Adaptation to Force in the Haptic Rendering of Virtual Environments","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Haptic technology; Kinesthetic learning; Computer science; Adaptation (eye); Virtual reality; Rendering (computer graphics); Human–computer interaction; Stereotaxy; Virtual machine; Simulation; Artificial intelligence; Psychology","score_opus":0.033540654814635154,"score_gpt":0.2533130581526792,"score_spread":0.21977240333804404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601284508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13853025,0.0033375963,0.8339048,0.00038118561,0.00030653027,0.00004816545,0.00005889429,0.0013232708,0.02210928],"genre_scores_gemma":[0.9315634,0.0015303094,0.05144347,0.00006863651,0.00012739858,0.00003189588,0.00004460738,0.00037060323,0.014819771],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974674,0.00006268628,0.000009079278,0.000029915323,0.00012129349,0.000030301604],"domain_scores_gemma":[0.99965084,0.00022505163,0.000025664438,0.000053202144,0.000029077455,0.000016198666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032334,0.00036434285,0.0003880504,0.00019184372,0.00021367271,0.0009752617,0.00069437333,0.0006641561,0.0030674096],"category_scores_gemma":[0.0019038345,0.0003318998,0.00030093838,0.00032640624,0.0006378998,0.0010716848,0.0008940482,0.0007585898,0.0005372812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008665349,0.00014128051,0.0007555108,0.00029780463,0.00003934327,0.0007106446,0.0010310952,0.22063597,0.32568017,0.06441729,0.004181413,0.38124305],"study_design_scores_gemma":[0.000051993284,0.00015735178,0.0023939833,0.000036385954,0.000019324583,0.0009103944,0.00016511427,0.9289142,0.034255944,0.02327111,0.009744749,0.00007945218],"about_ca_topic_score_codex":0.00087491603,"about_ca_topic_score_gemma":0.0005134837,"teacher_disagreement_score":0.0030674096,"about_ca_system_score_codex":0.00019365731,"about_ca_system_score_gemma":0.00009936209,"threshold_uncertainty_score":0.010261476},"labels":[],"label_agreement":null},{"id":"W1601291018","doi":"10.1007/11758525_106","title":"Rearrangement of Noisy Genomes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robustness (evolution); Computer science; Genome; Noise (video); Suite; Artificial intelligence; Algorithm; Data mining; Computational biology; Gene; Genetics; Biology; Image (mathematics)","score_opus":0.009750910708447025,"score_gpt":0.22532813072869187,"score_spread":0.21557722002024485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601291018","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.0935617,0.0013846874,0.8846797,0.00055993185,0.00031825496,0.000092735274,0.0004515285,0.0014944152,0.017457074],"genre_scores_gemma":[0.68524224,0.0016004946,0.27935117,0.00034165964,0.00029455064,0.00027573164,0.0027510559,0.0011005494,0.029042525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00018282015,0.00002814568,0.00020985573,0.00015296244,0.00006273234],"domain_scores_gemma":[0.9984108,0.0009158537,0.00014399354,0.0003511504,0.00008843799,0.00008973762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007558114,0.00046418558,0.00088516745,0.00095375796,0.00073584943,0.0013032249,0.0013838671,0.00086738606,0.010161026],"category_scores_gemma":[0.005517196,0.0006617955,0.00096779515,0.0011372057,0.0011230503,0.0019172006,0.0019527086,0.0011443186,0.0017436751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075381337,0.00008026957,0.0022308526,0.00057537487,0.00012780164,0.0005427425,0.0005576134,0.280896,0.041616898,0.46105278,0.01046514,0.20110075],"study_design_scores_gemma":[0.00004502793,0.00011745728,0.0010087957,0.000056712353,0.000038950962,0.0005156954,0.00014253515,0.5314744,0.016745487,0.4362096,0.01360425,0.000041059906],"about_ca_topic_score_codex":0.0004433372,"about_ca_topic_score_gemma":0.0005738477,"teacher_disagreement_score":0.010161026,"about_ca_system_score_codex":0.00058745785,"about_ca_system_score_gemma":0.00027483358,"threshold_uncertainty_score":0.033991992},"labels":[],"label_agreement":null},{"id":"W1601292091","doi":"10.1007/978-3-540-92273-5_8","title":"An Evolutionary Approach to the Non-unique Oligonucleotide Probe Selection Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Windsor","funders":"","keywords":"Selection (genetic algorithm); Greedy algorithm; Computer science; Oligomer restriction; Heuristics; Benchmark (surveying); Heuristic; Set (abstract data type); Algorithm; Artificial intelligence; Oligonucleotide; Gene; Biology; Genetics","score_opus":0.011927914713732366,"score_gpt":0.23848694087823277,"score_spread":0.2265590261645004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601292091","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.0097015025,0.00037395168,0.98671454,0.00032941237,0.000059329777,0.00005019144,0.000031737232,0.00008597908,0.0026533857],"genre_scores_gemma":[0.13665535,0.00065762684,0.85233945,0.00056586706,0.00022987254,0.00046935922,0.00022691407,0.00016363175,0.0086919535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984785,0.00072650367,0.00006349463,0.00028301994,0.00031362698,0.00013487063],"domain_scores_gemma":[0.9960025,0.0033276868,0.000111634654,0.00015753522,0.00030368808,0.00009692829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025559124,0.0010480314,0.0019399594,0.0012147808,0.0009234868,0.0010561388,0.0029538358,0.0025273124,0.003656513],"category_scores_gemma":[0.0070871077,0.0008744489,0.0015248873,0.0018175539,0.0017404327,0.00143097,0.0018483335,0.0021604009,0.00045255653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112461115,0.00019434244,0.0011927236,0.00022431054,0.00017195946,0.00028097763,0.00028906335,0.67951614,0.0063011167,0.12448113,0.0040653762,0.18317044],"study_design_scores_gemma":[0.000047094312,0.00008356313,0.00023806487,0.000017303579,0.000033413344,0.00012171368,0.00003319388,0.9236304,0.00073787785,0.07292625,0.0021142208,0.000016993174],"about_ca_topic_score_codex":0.0017727072,"about_ca_topic_score_gemma":0.001606742,"teacher_disagreement_score":0.003656513,"about_ca_system_score_codex":0.0010981387,"about_ca_system_score_gemma":0.0010292717,"threshold_uncertainty_score":0.013517082},"labels":[],"label_agreement":null},{"id":"W1601303234","doi":"10.1007/11566465_107","title":"Photo-Realistic Tissue Reflectance Modelling for Minimally Invasive Surgical Simulation","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Specular reflection; Computer science; Computer vision; Artificial intelligence; Computer graphics; Orientation (vector space); Noise (video); Computer graphics (images); Fidelity; Graphics; Pixel; Image (mathematics); Optics; Mathematics","score_opus":0.03656122771101257,"score_gpt":0.3417214178699752,"score_spread":0.3051601901589626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601303234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030193955,0.00045933388,0.96335506,0.0002660309,0.000054532007,0.00006362021,0.00012895983,0.0007323148,0.0047462056],"genre_scores_gemma":[0.7575731,0.001368721,0.23116559,0.00017342954,0.000045847264,0.00016561266,0.00026460184,0.00064012856,0.008602887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973947,0.00008636079,0.000012148019,0.00002541956,0.00011908859,0.000017529337],"domain_scores_gemma":[0.99955505,0.00025131874,0.00004724283,0.00006673678,0.00005915957,0.000020612506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671693,0.0006420066,0.0004876944,0.0003775222,0.00024344097,0.0009599156,0.0009295957,0.0014543226,0.002718277],"category_scores_gemma":[0.0020180312,0.000829249,0.00086061,0.00047104506,0.00039121855,0.00075449696,0.0006208056,0.0007980966,0.000815823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005397171,0.000026399459,0.00021460715,0.00008381973,0.000015363741,0.00014149012,0.00008316197,0.9681401,0.013697258,0.0033517887,0.0005001324,0.0136918705],"study_design_scores_gemma":[0.0000065706786,0.000015368076,0.00010335536,0.000006537383,0.000005368583,0.000107901964,0.000009082291,0.9955889,0.0022999465,0.0010263652,0.0008203688,0.000010171015],"about_ca_topic_score_codex":0.002577679,"about_ca_topic_score_gemma":0.0018688365,"teacher_disagreement_score":0.002718277,"about_ca_system_score_codex":0.00043801364,"about_ca_system_score_gemma":0.0004425396,"threshold_uncertainty_score":0.009093523},"labels":[],"label_agreement":null},{"id":"W1601355487","doi":"10.1007/11866763_13","title":"A Fast Method of Generating Pharmacokinetic Maps from Dynamic Contrast-Enhanced Images of the Breast","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"MRI in cancer diagnosis","field":"Medicine","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 Toronto; Ontario Institute for Cancer Research","funders":"Canadian Institutes of Health Research; Canadian Breast Cancer Research Alliance","keywords":"Computer science; Basis (linear algebra); Algorithm; Contrast (vision); Basis function; Curve fitting; Artificial intelligence; Mathematics; Machine learning","score_opus":0.0071007888244172595,"score_gpt":0.28877888124466883,"score_spread":0.28167809242025155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601355487","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.0008528736,0.00009222892,0.99749327,0.000040293136,0.000025345762,0.000026676214,0.00007252868,0.0011451883,0.00025172238],"genre_scores_gemma":[0.013304368,0.00025063977,0.9844662,0.000044660606,0.00003221545,0.000094578245,0.00020065339,0.000378655,0.0012279986],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974245,0.000038276245,0.00001199077,0.000036311172,0.00015253689,0.000018395433],"domain_scores_gemma":[0.9992067,0.00042496764,0.000050840503,0.00011665965,0.0001604537,0.000040387687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005878418,0.0010610531,0.00075592875,0.0011393896,0.00049210025,0.0012252214,0.0014380025,0.0012979624,0.00724862],"category_scores_gemma":[0.0024813006,0.0010125595,0.0010150978,0.0012529125,0.00034864814,0.0007676245,0.0013558096,0.0014111801,0.002633343],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003109873,0.00007148274,0.00042273782,0.0004295604,0.00021285923,0.00038490677,0.00013481418,0.06366596,0.09817606,0.009975124,0.009043526,0.81717193],"study_design_scores_gemma":[0.00013809245,0.00010491443,0.0007776061,0.00003918672,0.00011520255,0.001655035,0.000038288057,0.911111,0.05787483,0.01142826,0.01661694,0.00010060265],"about_ca_topic_score_codex":0.0027319046,"about_ca_topic_score_gemma":0.004712725,"teacher_disagreement_score":0.00724862,"about_ca_system_score_codex":0.00029879622,"about_ca_system_score_gemma":0.0011233354,"threshold_uncertainty_score":0.024249017},"labels":[],"label_agreement":null},{"id":"W1601371090","doi":"10.1007/978-3-642-15470-6_21","title":"The Influence of Ubiquity on Screen-Based Interfaces","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Merge (version control); Human–computer interaction; Data science; Set (abstract data type); Software; Ubiquitous computing; User interface; Identification (biology); Information retrieval; Programming language","score_opus":0.016020911119418127,"score_gpt":0.27921041893252574,"score_spread":0.2631895078131076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601371090","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772739,0.004555583,0.0071813613,0.0015735336,0.00014094684,0.0000388202,0.00024458888,0.00018428324,0.108806945],"genre_scores_gemma":[0.9968426,0.00037914523,0.0006663284,0.000051210092,0.0000671066,0.000006078766,0.000033818123,0.000073629955,0.0018801145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99672264,0.0011689445,0.00019700297,0.0006408416,0.00091090036,0.00035970384],"domain_scores_gemma":[0.93055457,0.055696826,0.0035565288,0.0042936066,0.004317109,0.0015813746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023789238,0.00055989716,0.000569909,0.0013243651,0.0013309568,0.0076897256,0.0008205926,0.00162821,0.02262592],"category_scores_gemma":[0.052734923,0.0005875312,0.00047239833,0.0012267961,0.0019825962,0.009663401,0.0031006667,0.0013951868,0.0021572507],"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.0064413305,0.0016390458,0.27098265,0.0023464335,0.00059622526,0.002730717,0.021195522,0.0113763735,0.07930514,0.13200626,0.0108641,0.46051618],"study_design_scores_gemma":[0.00030011788,0.002106363,0.7779491,0.0008591838,0.0016877374,0.005049038,0.021018814,0.03646264,0.026469491,0.090238966,0.03753683,0.00032170297],"about_ca_topic_score_codex":0.002526709,"about_ca_topic_score_gemma":0.0020051673,"teacher_disagreement_score":0.02262592,"about_ca_system_score_codex":0.0007337725,"about_ca_system_score_gemma":0.00034270503,"threshold_uncertainty_score":0.07569128},"labels":[],"label_agreement":null},{"id":"W1601379450","doi":"10.1007/3-540-44450-5_13","title":"Arithmetic Circuits and Polynomial Replacement Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generalization; Polynomial; Electronic circuit; Scope (computer science); Arithmetic; Natural number; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Programming language; Electrical engineering","score_opus":0.019089426504118573,"score_gpt":0.2632402137323563,"score_spread":0.24415078722823771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601379450","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.042311717,0.032059688,0.09708233,0.005836177,0.0014526992,0.000050723338,0.00029785358,0.0006238684,0.82028496],"genre_scores_gemma":[0.6703743,0.023089916,0.02980849,0.0010678144,0.0023106348,0.00011556424,0.00060924364,0.00024382726,0.27238014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984336,0.000033040385,0.000005597873,0.000026584039,0.00006439436,0.00002706303],"domain_scores_gemma":[0.9997423,0.0001517474,0.000015931779,0.000043145345,0.000036130128,0.000010646864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000199261,0.00051086285,0.0004400608,0.00073417113,0.0007671096,0.001508249,0.0006379873,0.00060524157,0.013169534],"category_scores_gemma":[0.0007771479,0.00033339954,0.0003596053,0.0015190793,0.0014748401,0.002954493,0.00053904735,0.0021058253,0.0022651076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011771037,0.000008108304,0.000027065757,0.00006386234,0.0000025502798,0.000016095837,0.0000765408,0.0007022198,0.0005364325,0.9675684,0.007309389,0.023677543],"study_design_scores_gemma":[0.00000789816,0.000009851981,0.000087359374,0.00001748344,0.000006251631,0.00008339523,0.000026930646,0.0009505251,0.000469486,0.93764603,0.06069026,0.0000045224706],"about_ca_topic_score_codex":0.00054257555,"about_ca_topic_score_gemma":0.0006167344,"teacher_disagreement_score":0.013169534,"about_ca_system_score_codex":0.0014364587,"about_ca_system_score_gemma":0.000396947,"threshold_uncertainty_score":0.044056475},"labels":[],"label_agreement":null},{"id":"W1601393362","doi":"10.1007/978-3-642-02611-9_46","title":"A Novel Bayesian Logistic Discriminant Model with Dirichlet Distributions: An Application to Face Recognition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Linear discriminant analysis; Pattern recognition (psychology); Artificial intelligence; Computer science; Dirichlet distribution; Latent Dirichlet allocation; Support vector machine; Bayesian probability; Classifier (UML); Heteroscedasticity; Machine learning; Mathematics; Topic model","score_opus":0.03573526822977385,"score_gpt":0.2719943367381998,"score_spread":0.23625906850842593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601393362","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.0033394725,0.00039464913,0.9949019,0.00021523492,0.000070414055,0.000028251532,0.00009391742,0.00039723833,0.00055882585],"genre_scores_gemma":[0.12773691,0.0012642632,0.859745,0.00036499748,0.0004451015,0.00034623093,0.0008110498,0.00046625314,0.0088202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979621,0.0010130059,0.000091535694,0.0003779391,0.00044000286,0.00011539492],"domain_scores_gemma":[0.99712855,0.0019277647,0.00012911666,0.00024692394,0.00046229368,0.000105384854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004886852,0.0011323477,0.0023810295,0.001291198,0.0010407348,0.0019752344,0.0037351486,0.0019104914,0.0036920214],"category_scores_gemma":[0.01055512,0.0009800717,0.001505993,0.002666796,0.0010491348,0.0031698083,0.0027839164,0.003078304,0.002800409],"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.0005321579,0.00025416576,0.0016696018,0.00032362985,0.00019767002,0.00016025906,0.00029498173,0.2531075,0.0034787552,0.08002942,0.019999916,0.6399519],"study_design_scores_gemma":[0.000017476938,0.000014117221,0.00013825693,0.000012088085,0.000018264322,0.000052273816,0.000019257697,0.97222126,0.0004925955,0.025294036,0.0016988928,0.00002147784],"about_ca_topic_score_codex":0.005117901,"about_ca_topic_score_gemma":0.005703833,"teacher_disagreement_score":0.005117901,"about_ca_system_score_codex":0.0011246407,"about_ca_system_score_gemma":0.0015338712,"threshold_uncertainty_score":0.025844455},"labels":[],"label_agreement":null},{"id":"W1601407566","doi":"10.1007/978-3-540-75496-1_26","title":"Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scalar multiplication; Elliptic curve point multiplication; Scalar (mathematics); Elliptic curve; Elliptic curve cryptography; Mathematics; Multiplication algorithm; Computer science; Algorithm; Arithmetic; Pure mathematics; Public-key cryptography; Geometry","score_opus":0.029956378640333604,"score_gpt":0.3021222506696207,"score_spread":0.27216587202928705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601407566","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.05581111,0.0029426338,0.8418705,0.000820844,0.00094212475,0.000115782685,0.0002745783,0.0011591917,0.09606328],"genre_scores_gemma":[0.58322334,0.0035106777,0.36038452,0.00054296193,0.00073829433,0.00024356373,0.0006512486,0.0010450884,0.049660295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992987,0.00015572713,0.00006104367,0.00009587896,0.00030153734,0.000087143075],"domain_scores_gemma":[0.9995407,0.00014680513,0.00003284399,0.00013338643,0.00011391219,0.000032400414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092157285,0.001121795,0.0011273781,0.0015984405,0.0008526024,0.0033450508,0.001225739,0.0007142305,0.009765405],"category_scores_gemma":[0.0021027206,0.00042040003,0.00072783814,0.0021687627,0.0012037307,0.0052705905,0.001858479,0.0021334582,0.003713459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055789238,0.000033080585,0.00011662637,0.00008926146,0.000008297544,0.0000956078,0.00017273975,0.0018217658,0.002961885,0.91072106,0.0047186674,0.0792051],"study_design_scores_gemma":[0.000022880882,0.000047137943,0.000105714906,0.000041595278,0.000017194763,0.00027297836,0.00007260935,0.014140581,0.005554853,0.9554912,0.024203412,0.000029764817],"about_ca_topic_score_codex":0.00021325548,"about_ca_topic_score_gemma":0.00037648567,"teacher_disagreement_score":0.009765405,"about_ca_system_score_codex":0.00088360556,"about_ca_system_score_gemma":0.0004390288,"threshold_uncertainty_score":0.03266859},"labels":[],"label_agreement":null},{"id":"W1601419553","doi":"10.1007/978-3-540-30219-3_36","title":"The Most Probable Labeling Problem in HMMs and Its Application to Bioinformatics","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Hidden Markov model; Computer science; Sequence labeling; Heuristics; Sequence (biology); Annotation; Path (computing); Artificial intelligence; Algorithm; Pattern recognition (psychology); Theoretical computer science; Biology; Genetics; Programming language","score_opus":0.010959327423742858,"score_gpt":0.23299681353526347,"score_spread":0.2220374861115206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601419553","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.0021887796,0.0015122022,0.99422234,0.0007279776,0.000113392234,0.000017257296,0.00012859982,0.00044704683,0.0006423363],"genre_scores_gemma":[0.07402998,0.004062102,0.91143537,0.0005875922,0.0010864488,0.000274548,0.0013020126,0.0007597594,0.0064622113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963491,0.001884646,0.00026125222,0.0007055748,0.00067024166,0.00012910618],"domain_scores_gemma":[0.96505827,0.030470109,0.00062768214,0.002341233,0.0011446624,0.00035802848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006995272,0.0011937022,0.0031796107,0.002407024,0.0023158279,0.003598412,0.0046814936,0.0063514193,0.0051090736],"category_scores_gemma":[0.042076502,0.002632374,0.0017676449,0.007160297,0.0037292195,0.008029165,0.0035017729,0.0072313743,0.0028501917],"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.00027974712,0.00016271493,0.0017594065,0.0006452874,0.000118922806,0.00037747773,0.00071879034,0.32855707,0.0023457725,0.2557829,0.022162773,0.38708907],"study_design_scores_gemma":[0.000019221246,0.000012684166,0.00017134733,0.00002677661,0.00001842319,0.00013699749,0.000044441,0.53704184,0.0006610075,0.45833445,0.0035032497,0.000029533901],"about_ca_topic_score_codex":0.0042524277,"about_ca_topic_score_gemma":0.0035788657,"teacher_disagreement_score":0.006995272,"about_ca_system_score_codex":0.0015474298,"about_ca_system_score_gemma":0.0015474056,"threshold_uncertainty_score":0.036994994},"labels":[],"label_agreement":null},{"id":"W1601453863","doi":"10.1007/978-3-642-02868-7_32","title":"A Ubiquitous Computing Environment to Support the Mobility of Users with Special Needs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Ubiquitous computing; Point (geometry); Human–computer interaction; Context-aware pervasive systems; Mobile device; Mobile computing; World Wide Web; Multimedia; Operating system","score_opus":0.020151878985721686,"score_gpt":0.234499890427985,"score_spread":0.21434801144226331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601453863","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06857334,0.008258439,0.7985686,0.0035084058,0.0021089194,0.00044369252,0.0009417067,0.016857157,0.1007398],"genre_scores_gemma":[0.38546404,0.0077123377,0.5265481,0.0021257356,0.00083395065,0.00042587184,0.0015815946,0.00062559184,0.074682735],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998467,0.00003251715,0.000010470595,0.000027789185,0.00005293439,0.000029567527],"domain_scores_gemma":[0.99983454,0.000031519383,0.000009501274,0.00002170715,0.00003330946,0.00006942857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025490043,0.00040067735,0.0003604005,0.00030716884,0.0005157079,0.00086496293,0.0006913794,0.0008173033,0.0042559365],"category_scores_gemma":[0.0006201025,0.00021426109,0.00027597102,0.0004999502,0.00020371015,0.0012733944,0.002026845,0.00078569626,0.0020960784],"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.00023123279,0.0002555889,0.002099743,0.0003831319,0.00004615192,0.0012381079,0.0016200324,0.0030502172,0.04557781,0.042656045,0.11594978,0.78689224],"study_design_scores_gemma":[0.0001051076,0.0008388697,0.007136705,0.00035149156,0.00016972983,0.0061550974,0.0013621063,0.04693477,0.025694946,0.030325076,0.88077873,0.00014736583],"about_ca_topic_score_codex":0.0007708678,"about_ca_topic_score_gemma":0.0017704463,"teacher_disagreement_score":0.0042559365,"about_ca_system_score_codex":0.00011908874,"about_ca_system_score_gemma":0.00043646712,"threshold_uncertainty_score":0.014237583},"labels":[],"label_agreement":null},{"id":"W1601465492","doi":"10.1007/978-3-642-04268-3_88","title":"A Combined Surface And VOlumetric Registration (SAVOR) Framework to Study Cortical Biomarkers and Volumetric Imaging Data","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Optical Imaging and Spectroscopy Techniques","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Michael Smith Health Research BC","keywords":"Computer science; Neuroimaging; Image registration; Computer vision; Artificial intelligence; Bijection; Surface (topology); Pattern recognition (psychology); Image (mathematics); Medicine; Mathematics","score_opus":0.021373640859912415,"score_gpt":0.3403177181799005,"score_spread":0.3189440773199881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601465492","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.003927355,0.00021203479,0.9944206,0.000063487896,0.000021297727,0.000033502994,0.00007478869,0.0009908611,0.0002561394],"genre_scores_gemma":[0.101165324,0.0005199081,0.8938587,0.00011138218,0.000096512274,0.00016134059,0.00047100155,0.0006989686,0.0029168986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916327,0.00023630429,0.00004420038,0.0001440331,0.00034742182,0.000064814834],"domain_scores_gemma":[0.99934,0.00021313048,0.000088041845,0.00011725771,0.00020057436,0.000040998508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015582102,0.0011497292,0.001632855,0.0023029135,0.00045386903,0.0019194375,0.0017395241,0.0013680017,0.0019807988],"category_scores_gemma":[0.0022747568,0.0008052257,0.0022962037,0.002113702,0.0005788554,0.0012532179,0.0017988621,0.00096863694,0.0010842027],"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.00036112982,0.00018164447,0.0017984294,0.00034558043,0.0005179546,0.00031892944,0.00016557032,0.15957351,0.09860783,0.019495562,0.0056228456,0.713011],"study_design_scores_gemma":[0.00002831303,0.00016316099,0.00087873946,0.000014161315,0.00009260309,0.00036183334,0.0000403737,0.96997356,0.014280139,0.009910108,0.0042095925,0.00004740889],"about_ca_topic_score_codex":0.0023214193,"about_ca_topic_score_gemma":0.0055817803,"teacher_disagreement_score":0.0023214193,"about_ca_system_score_codex":0.00033269054,"about_ca_system_score_gemma":0.0014033454,"threshold_uncertainty_score":0.0082407},"labels":[],"label_agreement":null},{"id":"W160147681","doi":"10.1007/978-3-642-21043-3_30","title":"Improving Phenotype Name Recognition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Computer science; Unified Medical Language System; Natural language processing; Ontology; Named-entity recognition; Recall; Artificial intelligence; Precision and recall; Information retrieval; Biomedical text mining; Text mining; Linguistics; Task (project management)","score_opus":0.024681606249192467,"score_gpt":0.24380072161456437,"score_spread":0.2191191153653719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160147681","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.11299655,0.0014963123,0.81525254,0.00091096235,0.0010142889,0.00013663016,0.005657131,0.050923754,0.011611786],"genre_scores_gemma":[0.32313508,0.00085891056,0.6302443,0.00068967044,0.00030897817,0.0001333643,0.019847116,0.0030407265,0.02174186],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992083,0.00012411577,0.000059793318,0.0002785918,0.00025011203,0.000079154444],"domain_scores_gemma":[0.9977411,0.0007500082,0.00012661099,0.0006839833,0.0006146431,0.00008372082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069029507,0.0011007105,0.0012683172,0.0017317359,0.0005351288,0.0014163838,0.0014175713,0.0010243532,0.0079951165],"category_scores_gemma":[0.002896007,0.00029177425,0.0011865976,0.0014221484,0.00027083888,0.001896149,0.0012768668,0.0011923237,0.0076525705],"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.00029853356,0.0002540287,0.00666264,0.0001859253,0.00009346147,0.00032834904,0.000054942695,0.007298222,0.0762682,0.0026229888,0.022674154,0.8832586],"study_design_scores_gemma":[0.000100641104,0.00033863162,0.016583215,0.00008886477,0.0003949472,0.002066372,0.00023437869,0.68574756,0.21576546,0.024801854,0.053755146,0.00012297336],"about_ca_topic_score_codex":0.0016623487,"about_ca_topic_score_gemma":0.0028754072,"teacher_disagreement_score":0.0079951165,"about_ca_system_score_codex":0.00035726052,"about_ca_system_score_gemma":0.00052511215,"threshold_uncertainty_score":0.026746392},"labels":[],"label_agreement":null},{"id":"W1601544768","doi":"10.1007/978-3-540-27868-9_34","title":"A Comparison of Least Squares and Spectral Methods for Attributed Graph Matching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Least-squares function approximation; Graph; Matching (statistics); Computer science; Algorithm; Non-linear least squares; Permutation (music); Mathematics; Theoretical computer science; Statistics; Estimation theory","score_opus":0.031221583596837552,"score_gpt":0.33534794986363287,"score_spread":0.3041263662667953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601544768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006984071,0.00059244124,0.9900737,0.00016572674,0.00007502845,0.000041571675,0.000059721115,0.00083307456,0.0011747937],"genre_scores_gemma":[0.13039346,0.00080784614,0.8629963,0.00018497452,0.00017866268,0.00009953564,0.0004812139,0.00065637066,0.0042016357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99367934,0.003273252,0.00023347688,0.00079102407,0.0018148532,0.00020808603],"domain_scores_gemma":[0.974482,0.018078543,0.0007261475,0.0029261468,0.0034240822,0.00036316848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005920775,0.0012380058,0.0022653835,0.0033287073,0.00091530755,0.0025373346,0.0040824027,0.0020836142,0.005472097],"category_scores_gemma":[0.02563606,0.00086322654,0.0013352005,0.0050709522,0.0015187127,0.0065008164,0.0032804643,0.0019774993,0.0021208853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086925057,0.0005111026,0.001965882,0.00044645788,0.00035245632,0.000040752533,0.0002381875,0.20967959,0.0040502534,0.052042328,0.006711305,0.72309256],"study_design_scores_gemma":[0.000043854234,0.00006547062,0.00041982328,0.000020201238,0.000039387312,0.00006224496,0.00010504184,0.9523068,0.0018853614,0.042930048,0.0020991026,0.000022543052],"about_ca_topic_score_codex":0.003825625,"about_ca_topic_score_gemma":0.0055379947,"teacher_disagreement_score":0.005920775,"about_ca_system_score_codex":0.0010067415,"about_ca_system_score_gemma":0.0019393575,"threshold_uncertainty_score":0.031312406},"labels":[],"label_agreement":null},{"id":"W1601589757","doi":"10.1007/978-3-540-24723-4_19","title":"Integrating the Soot Compiler Infrastructure into an IDE","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"McGill University","funders":"","keywords":"Compiler; Computer science; Debugging; Eclipse; Software engineering; Programming language; Byte; Development environment","score_opus":0.015372989434315964,"score_gpt":0.2634255679722774,"score_spread":0.24805257853796142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601589757","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.006374908,0.00022406189,0.9512067,0.00016847576,0.00034053522,0.00010118031,0.00013278342,0.027051438,0.014399978],"genre_scores_gemma":[0.089490555,0.0005852708,0.87064636,0.00033180168,0.00012313749,0.00012300018,0.0010481562,0.012752101,0.024899608],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871373,0.00018962703,0.000110763,0.00018664173,0.00060866686,0.00019070083],"domain_scores_gemma":[0.99773586,0.00074080215,0.00011042705,0.0007084998,0.00055199524,0.00015248425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018624292,0.0006593456,0.00070594193,0.00091664545,0.00048670382,0.003026052,0.0017236228,0.0007751135,0.0075830882],"category_scores_gemma":[0.0042338506,0.0009648201,0.0009387374,0.00054413103,0.0006034382,0.0033444725,0.0022041805,0.002352794,0.006020496],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006281284,0.00036739017,0.0028010583,0.000541095,0.00009528835,0.0007256394,0.00072547473,0.008949635,0.051239885,0.086487405,0.034943003,0.812496],"study_design_scores_gemma":[0.00031025757,0.00035438171,0.0018994653,0.00044297968,0.00023267465,0.0019189611,0.0002551046,0.14294682,0.14795332,0.09237025,0.61113864,0.0001772288],"about_ca_topic_score_codex":0.00074812566,"about_ca_topic_score_gemma":0.0013217649,"teacher_disagreement_score":0.0075830882,"about_ca_system_score_codex":0.00039501465,"about_ca_system_score_gemma":0.0016191939,"threshold_uncertainty_score":0.025367916},"labels":[],"label_agreement":null},{"id":"W1601597042","doi":"10.1007/11893028_32","title":"Connectionist Approaches for Predicting Mouse Gene Function from Gene Expression","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Toronto","funders":"","keywords":"Gene; Function (biology); Gene expression; Computational biology; Regulation of gene expression; Gene prediction; Preprocessor; Computer science; Gene regulatory network; Biology; Genetics; Genome; Artificial intelligence","score_opus":0.025862459098957766,"score_gpt":0.2313482283102513,"score_spread":0.20548576921129355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601597042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051081054,0.0023733566,0.93792564,0.0004317546,0.000084571584,0.00008404599,0.0005394419,0.0019272944,0.005552858],"genre_scores_gemma":[0.5966192,0.0022202113,0.38910833,0.00020397162,0.00022493955,0.00027209966,0.0016026675,0.0002558975,0.009492643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974304,0.000066147244,0.00001964488,0.000077258264,0.000071533694,0.000022420529],"domain_scores_gemma":[0.99897635,0.000783726,0.000045460496,0.000084085244,0.000080299236,0.000030094185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007311281,0.001344904,0.0007550911,0.0013697115,0.00043612876,0.0008285914,0.0017964339,0.0011591696,0.002867254],"category_scores_gemma":[0.001937659,0.00066346495,0.001022341,0.001300727,0.0004628521,0.001114141,0.0006615228,0.001217989,0.00059670914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027071984,0.00017775527,0.0044496795,0.0001769998,0.00038866335,0.0003261737,0.00010676628,0.4960139,0.0076567177,0.020718617,0.0047872313,0.4649267],"study_design_scores_gemma":[0.000014786115,0.000036783847,0.0012806779,0.000011826826,0.00004862553,0.00007770982,0.000014948186,0.9481783,0.0014875375,0.04776099,0.0010754825,0.0000124140815],"about_ca_topic_score_codex":0.007228109,"about_ca_topic_score_gemma":0.011910526,"teacher_disagreement_score":0.007228109,"about_ca_system_score_codex":0.00091724924,"about_ca_system_score_gemma":0.00055375346,"threshold_uncertainty_score":0.014372051},"labels":[],"label_agreement":null},{"id":"W16016350","doi":"10.1007/978-3-642-23783-6_41","title":"Higher Order Contractive Auto-Encoder","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":380,"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":"Hessian matrix; Jacobian matrix and determinant; Initialization; Computer science; Robustness (evolution); Manifold (fluid mechanics); Encoder; Norm (philosophy); Autoencoder; Artificial intelligence; Regularization (linguistics); Feature vector; Algorithm; Mathematical optimization; Mathematics; Applied mathematics; Deep learning","score_opus":0.020430625937921373,"score_gpt":0.23109404550762624,"score_spread":0.21066341956970486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16016350","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.0065677995,0.0004886507,0.9810761,0.00021299922,0.00012985326,0.000025404071,0.00013667942,0.00059360417,0.010768828],"genre_scores_gemma":[0.51657736,0.001177082,0.4049021,0.0005533001,0.00028653356,0.00014452178,0.00060721865,0.0006049006,0.075146966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995258,0.000098934404,0.000024603947,0.00008799945,0.00020329488,0.00005947689],"domain_scores_gemma":[0.9985561,0.00073952076,0.00006694876,0.00041701418,0.00016124168,0.000059227736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656616,0.00070051645,0.00070077425,0.0003996163,0.00033194158,0.0009847826,0.0010687781,0.0013788326,0.010143258],"category_scores_gemma":[0.0023125922,0.00052114355,0.0004929843,0.00045607393,0.0009921801,0.0015643738,0.0015098203,0.0022590659,0.00283406],"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.00014944373,0.00007843157,0.0003040725,0.00015356873,0.000042485735,0.00020558138,0.00008111333,0.28532314,0.015382104,0.5197228,0.0072489074,0.17130838],"study_design_scores_gemma":[0.0000106771995,0.000043527692,0.00010627183,0.00002290642,0.000010342471,0.00016604642,0.000006891562,0.8980381,0.006228832,0.08963077,0.005718746,0.000016968292],"about_ca_topic_score_codex":0.0012431549,"about_ca_topic_score_gemma":0.002224173,"teacher_disagreement_score":0.010143258,"about_ca_system_score_codex":0.0007985998,"about_ca_system_score_gemma":0.0007463451,"threshold_uncertainty_score":0.033932567},"labels":[],"label_agreement":null},{"id":"W1601669868","doi":"10.1007/978-3-642-12098-5_52","title":"Adaptive Recommendation for Preferred Information and Browsing Action Based on Web-Browsing Behavior","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Victoria","funders":"","keywords":"Computer science; Recommender system; Web navigation; Information retrieval; Preference; Premise; World Wide Web; Inference; Similarity (geometry); Action (physics); Web page; Human–computer interaction; Artificial intelligence","score_opus":0.04379597129769392,"score_gpt":0.28264065804867,"score_spread":0.2388446867509761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601669868","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.60942537,0.0029810183,0.35934266,0.0005979688,0.00027014533,0.000523061,0.0026414918,0.0071513974,0.017066931],"genre_scores_gemma":[0.9043715,0.00054573664,0.086037606,0.00009779014,0.00008997156,0.00012135689,0.0015992145,0.000144799,0.006992024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995097,0.00007080516,0.000035012512,0.00015586223,0.00017027119,0.0000582972],"domain_scores_gemma":[0.9980786,0.0008802313,0.00011104677,0.00021799412,0.00060007046,0.00011212935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552789,0.0006202562,0.0010579999,0.0019036072,0.00033349427,0.0009896745,0.0011807639,0.0009380414,0.0038418865],"category_scores_gemma":[0.0040940302,0.00033941554,0.0006982587,0.0014192383,0.0001973639,0.0011489629,0.00033329116,0.00096137915,0.0021648235],"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.0019482847,0.0019641644,0.111218706,0.0004239269,0.0007146262,0.000244199,0.00029469733,0.024571342,0.040557306,0.0020742724,0.015256624,0.8007318],"study_design_scores_gemma":[0.00009557065,0.00036551256,0.10851124,0.00006280804,0.000432043,0.0005387399,0.0001270382,0.8728621,0.011054337,0.0027479604,0.0030927276,0.00011004278],"about_ca_topic_score_codex":0.012568102,"about_ca_topic_score_gemma":0.02668903,"teacher_disagreement_score":0.012568102,"about_ca_system_score_codex":0.0005992665,"about_ca_system_score_gemma":0.00057319144,"threshold_uncertainty_score":0.024989903},"labels":[],"label_agreement":null},{"id":"W1601677373","doi":"10.1007/11912873_1","title":"Internet-Scale Data Distribution: Some Research Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Variety (cybernetics); Scale (ratio); Data science; World Wide Web; Artificial intelligence","score_opus":0.07702466352739512,"score_gpt":0.30899549422970196,"score_spread":0.23197083070230684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601677373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045474827,0.061097477,0.7925838,0.039082635,0.0016645713,0.00018708935,0.0005654142,0.0012690062,0.05807521],"genre_scores_gemma":[0.6939591,0.06122294,0.19082423,0.0035760023,0.01038218,0.0005142589,0.0009483852,0.0010347974,0.037538156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513644,0.0013230185,0.00031524818,0.0013368538,0.0014652512,0.00042336286],"domain_scores_gemma":[0.94541085,0.03999986,0.0018466656,0.006171505,0.0056937556,0.0008773267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007737756,0.0013618338,0.0031071394,0.0034856994,0.0031383901,0.008086839,0.0062634973,0.006074069,0.0110944975],"category_scores_gemma":[0.04541884,0.0017050221,0.0014345291,0.012354066,0.006163005,0.023172358,0.0042377664,0.0045198244,0.0021761556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011982405,0.0002984536,0.0026927653,0.0006046565,0.00008557071,0.00034176686,0.0004686211,0.03672872,0.0007033729,0.720439,0.036808793,0.2007085],"study_design_scores_gemma":[0.00004475807,0.000025969337,0.0005338518,0.000088034954,0.00003459259,0.0005753815,0.0003736495,0.1358371,0.0008277414,0.84665716,0.014960654,0.000041124793],"about_ca_topic_score_codex":0.0038251756,"about_ca_topic_score_gemma":0.00205451,"teacher_disagreement_score":0.0110944975,"about_ca_system_score_codex":0.00377018,"about_ca_system_score_gemma":0.001318955,"threshold_uncertainty_score":0.04092163},"labels":[],"label_agreement":null},{"id":"W1601684738","doi":"10.1007/978-3-540-32258-0_16","title":"A Model of Rational Agency for Communicating Agents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"York University","funders":"","keywords":"Computer science; Agency (philosophy); Context (archaeology); Plan (archaeology); Simple (philosophy); Rational agent; Programming language; Multi-agent system; Artificial intelligence; Human–computer interaction; Software engineering","score_opus":0.07304309503259925,"score_gpt":0.29765520081352964,"score_spread":0.22461210578093038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601684738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024888955,0.00083949463,0.6197303,0.009304184,0.000300349,0.00019584404,0.0003283413,0.00035689035,0.34405562],"genre_scores_gemma":[0.76436317,0.0008425392,0.16633971,0.0010569396,0.00029133068,0.00066703814,0.00030493076,0.00010965317,0.0660248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980355,0.0009321374,0.000103863706,0.00026215706,0.0004309418,0.00023543394],"domain_scores_gemma":[0.9979132,0.0010819766,0.00016263696,0.00035897247,0.000287622,0.00019559143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020395692,0.0008644661,0.0007216226,0.00087198574,0.0022134674,0.0066484055,0.0029563913,0.0044588894,0.01064382],"category_scores_gemma":[0.0059213834,0.0007047911,0.001382276,0.0014737739,0.005606569,0.008483189,0.0029039723,0.0030029037,0.0016732544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046030973,0.000004752699,0.000022311886,0.000007156071,0.0000026017449,0.000025827796,0.00012487893,0.001524665,0.00004660052,0.9970053,0.00044764514,0.00078368146],"study_design_scores_gemma":[0.00001439514,0.0000068325903,0.00001863511,0.0000063001644,0.000004254879,0.000036362388,0.00006882723,0.010746074,0.000046155696,0.9845479,0.0044986214,0.0000056127724],"about_ca_topic_score_codex":0.0035742857,"about_ca_topic_score_gemma":0.0023874738,"teacher_disagreement_score":0.01064382,"about_ca_system_score_codex":0.0028052789,"about_ca_system_score_gemma":0.0022898396,"threshold_uncertainty_score":0.0356071},"labels":[],"label_agreement":null},{"id":"W1601777908","doi":"10.1007/3-540-36755-1_33","title":"Characterizing Markov Decision Processes","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Reinforcement learning; Markov decision process; Computer science; Randomness; Artificial intelligence; Markov chain; Machine learning; Markov process; Measure (data warehouse); Quality (philosophy); Mathematical optimization; Decision problem; Algorithm; Data mining; Mathematics; Statistics","score_opus":0.019528231396003598,"score_gpt":0.243811645501996,"score_spread":0.2242834141059924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601777908","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.046600644,0.0006436036,0.9331105,0.00066349,0.00007489733,0.000077471625,0.00048049647,0.0002958258,0.018052999],"genre_scores_gemma":[0.88033664,0.00138192,0.092585325,0.0003022968,0.00027753148,0.0003822469,0.0018100054,0.00027580853,0.022648226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874425,0.00048839854,0.00006617873,0.00026678803,0.00029634705,0.00013795764],"domain_scores_gemma":[0.98886,0.0088866735,0.0006867629,0.00058422156,0.00064882834,0.0003335259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017844662,0.0010365774,0.0012691161,0.0012172619,0.0006365254,0.0026088506,0.001100591,0.0012483597,0.0070390524],"category_scores_gemma":[0.015178638,0.00075222296,0.0010522262,0.0013798861,0.001130226,0.002566985,0.0016770437,0.0021537042,0.00086732995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048798127,0.00006620615,0.0013062457,0.00007258035,0.0000426594,0.000095605435,0.00016227523,0.091476694,0.0008396939,0.88324857,0.0023433636,0.020297334],"study_design_scores_gemma":[0.000007279023,0.000012347861,0.00019064314,0.000012653696,0.00000985703,0.000028382981,0.000018028353,0.3178175,0.00024621974,0.6806193,0.0010301864,0.000007557935],"about_ca_topic_score_codex":0.0017220876,"about_ca_topic_score_gemma":0.0012901741,"teacher_disagreement_score":0.0070390524,"about_ca_system_score_codex":0.0016898183,"about_ca_system_score_gemma":0.0010379624,"threshold_uncertainty_score":0.023547947},"labels":[],"label_agreement":null},{"id":"W1601793508","doi":"10.1007/978-3-642-37574-3_8","title":"Discovering Frequent Patterns from Uncertain Data Streams with Time-Fading and Landmark Models","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":60,"is_retracted":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":"Landmark; Computer science; Data stream mining; Fading; STREAMS; Sliding window protocol; Data mining; Data stream; Window (computing); Artificial intelligence; Real-time computing; Telecommunications; Channel (broadcasting); Computer network; World Wide Web","score_opus":0.02964745347581408,"score_gpt":0.24281240655154315,"score_spread":0.21316495307572908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601793508","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.08656219,0.0012926064,0.9104338,0.00030478218,0.00006796706,0.000058178244,0.0004732752,0.0003730034,0.00043414687],"genre_scores_gemma":[0.8044301,0.001823619,0.18961827,0.00009020915,0.00032364964,0.00017296939,0.0019744043,0.00008556353,0.0014812391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982527,0.00034163083,0.0001914145,0.0005442267,0.00048156673,0.00018834807],"domain_scores_gemma":[0.98526126,0.011092277,0.0015873209,0.0010471593,0.00076843926,0.00024347522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002953739,0.0010451553,0.001894834,0.002180018,0.0004907652,0.0019041055,0.0025210658,0.0013400492,0.00091478793],"category_scores_gemma":[0.017871782,0.0007398764,0.0019587527,0.0032430473,0.00094580697,0.004503809,0.0013294055,0.0020494792,0.00039669205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009136292,0.00021781199,0.029085698,0.0005664384,0.0005816434,0.0018004507,0.00065487734,0.69857126,0.0037012307,0.039947428,0.0033594198,0.22060013],"study_design_scores_gemma":[0.000014065094,0.00005159282,0.0011195614,0.000018212784,0.000051662588,0.00021089806,0.00006749623,0.9690027,0.00043278362,0.028520217,0.0004954132,0.00001538924],"about_ca_topic_score_codex":0.0025300991,"about_ca_topic_score_gemma":0.002139125,"teacher_disagreement_score":0.002953739,"about_ca_system_score_codex":0.0007071563,"about_ca_system_score_gemma":0.00060524675,"threshold_uncertainty_score":0.015621066},"labels":[],"label_agreement":null},{"id":"W1601799968","doi":"10.1007/978-3-540-39924-7_20","title":"CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Implementation; Bipartite graph; Graph; Graph algorithms; Parallel computing; Algorithm; Theoretical computer science; Programming language","score_opus":0.021437050904723785,"score_gpt":0.24369033423032746,"score_spread":0.22225328332560368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601799968","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28639048,0.0005150558,0.4421528,0.0012306824,0.0004362971,0.0005261217,0.0040674014,0.21636105,0.0483201],"genre_scores_gemma":[0.5510786,0.00012584837,0.4234983,0.00027509188,0.000044129352,0.0002452116,0.003989307,0.011988866,0.008754582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970535,0.0009008653,0.00013990054,0.0006147816,0.00094335986,0.00034754974],"domain_scores_gemma":[0.99106205,0.003972409,0.00029580956,0.0031778147,0.0011422129,0.00034969783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001968506,0.001747029,0.0005984272,0.0013485819,0.0009378801,0.0012096933,0.0047067436,0.0018821644,0.013906727],"category_scores_gemma":[0.010088344,0.0011045729,0.0007482796,0.001517065,0.0013810232,0.0036378996,0.0016744017,0.0014518988,0.0032363923],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032008162,0.0015261114,0.0145751275,0.0010474989,0.00017146654,0.0005047414,0.0011482384,0.1436755,0.045884203,0.025477728,0.15048307,0.6123054],"study_design_scores_gemma":[0.0007289313,0.0007533456,0.0032454447,0.000095376,0.0000990128,0.00028292698,0.0004867624,0.81209016,0.12728968,0.02412753,0.030718308,0.000082571045],"about_ca_topic_score_codex":0.010625358,"about_ca_topic_score_gemma":0.011614324,"teacher_disagreement_score":0.013906727,"about_ca_system_score_codex":0.0014235121,"about_ca_system_score_gemma":0.0017610649,"threshold_uncertainty_score":0.046522617},"labels":[],"label_agreement":null},{"id":"W1601807516","doi":"10.1007/978-3-642-17514-5_17","title":"Approximation Algorithms for the Multi-Vehicle Scheduling Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Algorithm; Mathematical optimization; Mathematics","score_opus":0.029951197751429275,"score_gpt":0.2773958598174451,"score_spread":0.2474446620660158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601807516","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.005128119,0.0022180525,0.9847948,0.0005205401,0.00020136459,0.00004661713,0.00011145826,0.00038879647,0.00659022],"genre_scores_gemma":[0.23353003,0.004226608,0.74731827,0.00037921502,0.0005408103,0.00036062184,0.000842283,0.00048620132,0.012315889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876094,0.00047335066,0.00004837546,0.00018717175,0.00034518237,0.00018508662],"domain_scores_gemma":[0.99737203,0.0018744173,0.0001447292,0.00026743184,0.00022425741,0.000117233445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021606816,0.0017340322,0.0019687393,0.0011271155,0.0007872799,0.0022470152,0.0034103894,0.002212184,0.005860883],"category_scores_gemma":[0.0072462494,0.0009103588,0.0014164068,0.003062792,0.0009666778,0.003370205,0.0017559981,0.0040213205,0.0013694278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028158032,0.00018772593,0.00034160318,0.00023255878,0.000073419105,0.00004568079,0.000083609775,0.73504734,0.00059977156,0.09029766,0.01213536,0.16067365],"study_design_scores_gemma":[0.000038953396,0.000020177942,0.000053671727,0.000020833515,0.000012628094,0.000024075467,0.000017434666,0.94219476,0.00016578696,0.055304285,0.0021418035,0.000005609099],"about_ca_topic_score_codex":0.005778394,"about_ca_topic_score_gemma":0.0049330206,"teacher_disagreement_score":0.005860883,"about_ca_system_score_codex":0.0026762495,"about_ca_system_score_gemma":0.0018046817,"threshold_uncertainty_score":0.01960665},"labels":[],"label_agreement":null},{"id":"W1601835699","doi":"10.1007/978-3-642-01307-2_31","title":"Variational Bayesian Approach for Long-Term Relevance Feedback","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Term (time); Relevance (law); Relevance feedback; Bayesian probability; Artificial intelligence; Machine learning; Physics","score_opus":0.01575308813296563,"score_gpt":0.24331032627635701,"score_spread":0.22755723814339138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601835699","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.0020704628,0.0008615718,0.99504095,0.0004440294,0.0000714791,0.000027298225,0.000074790114,0.00012783999,0.0012814509],"genre_scores_gemma":[0.40985706,0.003325339,0.55079097,0.0008659126,0.0010851504,0.0006734952,0.0010025158,0.0006227487,0.031776864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675214,0.0015055165,0.0001551257,0.0005115654,0.00082157645,0.00025407065],"domain_scores_gemma":[0.98873925,0.009260973,0.0002661748,0.0005065176,0.0010174043,0.00020975248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060178544,0.0013623241,0.0035464715,0.0012777268,0.0010247485,0.0026795708,0.006368128,0.0042891344,0.008048222],"category_scores_gemma":[0.022166185,0.0019051579,0.0016624753,0.0020289526,0.0023584869,0.00548059,0.0032898446,0.0043678135,0.0016395326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014365844,0.000105090934,0.00032596447,0.0003725758,0.00018904069,0.00017293384,0.00025558163,0.51154906,0.0013730207,0.40166336,0.0072717215,0.07657789],"study_design_scores_gemma":[0.000016524707,0.000014157265,0.00006024471,0.000013475297,0.000018339653,0.000031185264,0.000008394048,0.870667,0.00016379288,0.12792745,0.0010583207,0.00002108457],"about_ca_topic_score_codex":0.01255103,"about_ca_topic_score_gemma":0.011778514,"teacher_disagreement_score":0.01255103,"about_ca_system_score_codex":0.0032620945,"about_ca_system_score_gemma":0.0029294174,"threshold_uncertainty_score":0.03182578},"labels":[],"label_agreement":null},{"id":"W1601871518","doi":"10.1007/978-3-642-12993-3_6","title":"A Study of UCT and Its Enhancements in an Artificial Game","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Heuristics; Tournament; Monte Carlo method; Simple (philosophy); Tree (set theory); Theoretical computer science; Game tree; Ideal (ethics); Artificial intelligence; Mathematical optimization; Game theory; Sequential game; Mathematical economics; Mathematics","score_opus":0.049971045049201926,"score_gpt":0.31555412988650605,"score_spread":0.26558308483730414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601871518","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.51762414,0.0017375379,0.1421049,0.0013749658,0.00017211355,0.0002436648,0.00012956056,0.00036180034,0.33625138],"genre_scores_gemma":[0.96140397,0.00027226645,0.025989735,0.000079105994,0.000029781306,0.000056296485,0.000038412367,0.00006495141,0.012065544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989605,0.0005171269,0.000042220014,0.00011251435,0.00025442895,0.000113119866],"domain_scores_gemma":[0.9930292,0.0053060255,0.00040935483,0.00047395323,0.0004910342,0.00029049456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011383394,0.00036267217,0.00036422792,0.00048522797,0.00075613055,0.0021286712,0.0010424902,0.0007788775,0.00676093],"category_scores_gemma":[0.014733868,0.00022337334,0.0003527985,0.00087557203,0.001408299,0.0032015017,0.00076144,0.0013735507,0.00030072415],"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.00044551792,0.0003476086,0.00279334,0.00023728282,0.000032722408,0.00027966825,0.0020295004,0.028437084,0.0037175762,0.87192804,0.0031012732,0.086650304],"study_design_scores_gemma":[0.00013791166,0.0009928219,0.007785539,0.00015388298,0.00014543957,0.0009895555,0.0025899692,0.6152101,0.005480876,0.3235342,0.04292035,0.00005937596],"about_ca_topic_score_codex":0.0067913504,"about_ca_topic_score_gemma":0.005027231,"teacher_disagreement_score":0.0067913504,"about_ca_system_score_codex":0.0013543855,"about_ca_system_score_gemma":0.0009723994,"threshold_uncertainty_score":0.022617519},"labels":[],"label_agreement":null},{"id":"W1601871730","doi":"10.1007/11878773_76","title":"Supervised Machine Learning Based Medical Image Annotation and Retrieval in ImageCLEFmed 2005","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bhattacharyya distance; Computer science; Image retrieval; Automatic image annotation; Artificial intelligence; Pattern recognition (psychology); Feature vector; Support vector machine; Annotation; Classifier (UML); Local binary patterns; Pairwise comparison; Semantic gap; Visual Word; Image (mathematics); Histogram","score_opus":0.010806904939080153,"score_gpt":0.24410533044839436,"score_spread":0.2332984255093142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601871730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061870415,0.013546904,0.87773645,0.0040878407,0.0020844885,0.00087909756,0.004827584,0.021533066,0.013434072],"genre_scores_gemma":[0.1586121,0.0037755037,0.77689016,0.0012867587,0.0006442085,0.0005887413,0.025467133,0.0015186222,0.031216767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979961,0.00068582164,0.00018196127,0.00038271068,0.000651163,0.00010240662],"domain_scores_gemma":[0.9979055,0.000552891,0.00009853918,0.00057804334,0.00080249005,0.0000625487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035789402,0.00081756857,0.0013189078,0.0022080692,0.0006908663,0.0012353767,0.0025852188,0.0015153626,0.004193065],"category_scores_gemma":[0.0044973767,0.00066304265,0.00079427083,0.0016840661,0.0008377419,0.0017974423,0.0011320943,0.0018047857,0.0024445131],"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.0003414094,0.00031942333,0.0011445871,0.0005067472,0.00016023587,0.00020839408,0.00011621776,0.008947674,0.03058041,0.005557128,0.15320465,0.7989131],"study_design_scores_gemma":[0.00020454102,0.0006050002,0.013324005,0.00027804606,0.00040801117,0.0035798016,0.00016632867,0.43177325,0.2856344,0.020619221,0.24321854,0.00018881165],"about_ca_topic_score_codex":0.0059308503,"about_ca_topic_score_gemma":0.010099755,"teacher_disagreement_score":0.0059308503,"about_ca_system_score_codex":0.0012008339,"about_ca_system_score_gemma":0.0017207717,"threshold_uncertainty_score":0.018927515},"labels":[],"label_agreement":null},{"id":"W1601900113","doi":"10.1007/978-3-642-45005-1_9","title":"Detection of SOA Patterns","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.015391891169625232,"score_gpt":0.2412983806696382,"score_spread":0.225906489500013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601900113","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.7542784,0.0013283378,0.21215092,0.000345794,0.00020313878,0.00035388084,0.004015062,0.0074918615,0.019832643],"genre_scores_gemma":[0.90915257,0.0005689474,0.0806669,0.00006553383,0.000046438414,0.00008535778,0.0036840746,0.0001845211,0.005545784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994778,0.000032483273,0.000028937657,0.00012960873,0.00023982236,0.000091298854],"domain_scores_gemma":[0.9986802,0.00032679475,0.00019838216,0.0002027047,0.0004626833,0.00012938221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339209,0.0004973159,0.00045284393,0.0035350984,0.0004843758,0.0008623214,0.00053536834,0.00046052752,0.0025549848],"category_scores_gemma":[0.0018830918,0.00020548598,0.00054708624,0.0024767064,0.00024747013,0.00068113866,0.0006686963,0.00037669193,0.0013972624],"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.0009072765,0.00031812474,0.091557175,0.00058415247,0.00015479297,0.0022326494,0.0004896483,0.004238065,0.3359108,0.0062909853,0.007840637,0.54947567],"study_design_scores_gemma":[0.00008121342,0.00078780425,0.1867976,0.00018035984,0.00028014206,0.008278639,0.0014733722,0.39022154,0.352715,0.02278111,0.036252994,0.00015021891],"about_ca_topic_score_codex":0.0027547507,"about_ca_topic_score_gemma":0.0048150048,"teacher_disagreement_score":0.0035350984,"about_ca_system_score_codex":0.00034922812,"about_ca_system_score_gemma":0.0007019677,"threshold_uncertainty_score":0.008547246},"labels":[],"label_agreement":null},{"id":"W1601919219","doi":"10.1007/3-540-44679-6_30","title":"A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Computer science; Closure (psychology); Algorithm; Path (computing); Shortest path problem; Space (punctuation); Transitive relation; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Graph; Computer network","score_opus":0.012451451834332068,"score_gpt":0.2454966569590938,"score_spread":0.23304520512476173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601919219","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.0038950804,0.0006257383,0.9771985,0.0007706746,0.0004898804,0.00008771453,0.00026752276,0.0016744244,0.014990374],"genre_scores_gemma":[0.09961508,0.0013858157,0.8748246,0.00062997895,0.0005398307,0.0003793076,0.0008509787,0.0022877466,0.019486707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981164,0.00043301354,0.00015796295,0.00044557007,0.0006852181,0.00016186491],"domain_scores_gemma":[0.99608,0.0017271898,0.00012301984,0.0016618391,0.00030500774,0.00010295311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013606373,0.0018425392,0.0014470841,0.0019445652,0.0018094572,0.0026591506,0.002846471,0.0012909559,0.016499236],"category_scores_gemma":[0.009080548,0.0009182526,0.0018844168,0.0039044097,0.002503151,0.011736081,0.003968306,0.006477428,0.0061769607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022433276,0.00019783726,0.00025305676,0.0004056091,0.00006177817,0.00023296347,0.00043447083,0.013637502,0.006793215,0.53671515,0.04420033,0.39684376],"study_design_scores_gemma":[0.000073616495,0.00006274172,0.00013646655,0.000073884396,0.00005405049,0.00038387495,0.00010777862,0.061438143,0.0052782157,0.8808827,0.051453274,0.000055266817],"about_ca_topic_score_codex":0.0011617922,"about_ca_topic_score_gemma":0.001704629,"teacher_disagreement_score":0.016499236,"about_ca_system_score_codex":0.00091083115,"about_ca_system_score_gemma":0.0008859493,"threshold_uncertainty_score":0.05519551},"labels":[],"label_agreement":null},{"id":"W1601919490","doi":"10.1007/978-3-540-76650-6_11","title":"Reducing Test Sequence Length Using Invertible Sequences","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Windsor","funders":"","keywords":"Invertible matrix; Sequence (biology); Computer science; Finite-state machine; Conformance testing; Context (archaeology); Test (biology); Algorithm; Fault coverage; State (computer science); Mathematics; Engineering","score_opus":0.08039159151183822,"score_gpt":0.312587205035642,"score_spread":0.2321956135238038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601919490","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.051667564,0.00028161416,0.937378,0.00021562928,0.00011309199,0.00013967475,0.00008669725,0.0047208816,0.005396874],"genre_scores_gemma":[0.3451596,0.0002753502,0.6467239,0.0002102078,0.0001034944,0.00016342782,0.000342423,0.0007167928,0.00630481],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997673,0.0005739658,0.00021301392,0.00035534886,0.0009924446,0.00019218875],"domain_scores_gemma":[0.98668087,0.007788742,0.0010484091,0.0024674875,0.0017062449,0.00030830872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013782858,0.0010330392,0.00069522945,0.0014364847,0.0003824787,0.0006010589,0.0014454466,0.0007623258,0.007066689],"category_scores_gemma":[0.009956163,0.00053436705,0.0006932869,0.000939459,0.0007294877,0.0020498382,0.0014865693,0.0015032322,0.001345797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007398464,0.00039315922,0.0015840072,0.0004306531,0.000053320317,0.00034343568,0.00022523856,0.042455114,0.098858,0.039735645,0.0033670154,0.8118146],"study_design_scores_gemma":[0.00026366557,0.0015252321,0.0015653665,0.00023885895,0.00020642146,0.0014747219,0.00015629389,0.57070655,0.26283196,0.14056526,0.020371662,0.000093979506],"about_ca_topic_score_codex":0.0007606561,"about_ca_topic_score_gemma":0.0014593711,"teacher_disagreement_score":0.007066689,"about_ca_system_score_codex":0.0005489544,"about_ca_system_score_gemma":0.0012303612,"threshold_uncertainty_score":0.023640454},"labels":[],"label_agreement":null},{"id":"W1601989522","doi":"10.1007/978-3-540-75288-2_4","title":"Fast Answering of XPath Query Workloads on Web Collections","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Toronto","funders":"","keywords":"XPath; Computer science; XML; Information retrieval; RSS; World Wide Web; XML database; XSLT; Web application; Database","score_opus":0.02087373953241594,"score_gpt":0.2583137001842508,"score_spread":0.23743996065183487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601989522","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.7419427,0.0030350517,0.20044774,0.0014849128,0.00057544623,0.000472258,0.005607248,0.039136834,0.00729778],"genre_scores_gemma":[0.802028,0.0010254899,0.17208269,0.00040253584,0.0004976244,0.000268508,0.012986009,0.0017252881,0.008983803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955205,0.0007183523,0.00038853538,0.00084726216,0.0019602173,0.00056524685],"domain_scores_gemma":[0.9869571,0.0073768813,0.0005455961,0.0023743305,0.0020446214,0.0007015362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029691672,0.001619015,0.0023495995,0.0021462587,0.0013140129,0.0028113946,0.0033080336,0.0013837913,0.005166263],"category_scores_gemma":[0.0121139195,0.0012049021,0.00092353206,0.0041398164,0.0005218693,0.005280317,0.0020538177,0.001503064,0.002144505],"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.005897687,0.0010546788,0.019780053,0.0013141823,0.00038357405,0.00095830025,0.0012982028,0.066397,0.097385995,0.0065609836,0.08612283,0.7128466],"study_design_scores_gemma":[0.0002944349,0.00049768074,0.005942699,0.000034907847,0.00014332322,0.00054352614,0.00091368426,0.9397558,0.034584012,0.01121267,0.0060245222,0.00005271923],"about_ca_topic_score_codex":0.0073395283,"about_ca_topic_score_gemma":0.011941537,"teacher_disagreement_score":0.0073395283,"about_ca_system_score_codex":0.0012807692,"about_ca_system_score_gemma":0.0019762698,"threshold_uncertainty_score":0.017282844},"labels":[],"label_agreement":null},{"id":"W1602007820","doi":"10.1007/978-3-642-04639-1_4","title":"Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Kleene algebra; Computer science; Decidability; Pushdown automaton; Formalism (music); Kleene's recursion theorem; Programming language; Algebra over a field; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Finite-state machine; Pure mathematics","score_opus":0.026144226047980043,"score_gpt":0.2798615489949663,"score_spread":0.25371732294698623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602007820","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.027987061,0.0023778034,0.9297296,0.00042777913,0.00010627974,0.00006183642,0.0001234709,0.0006702017,0.03851596],"genre_scores_gemma":[0.6586854,0.0035431804,0.3177631,0.00022275535,0.00024982414,0.00017065552,0.000337065,0.00047383519,0.018554185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867684,0.00040930512,0.000096375945,0.0002036566,0.00047199908,0.00014165901],"domain_scores_gemma":[0.9985453,0.00093262293,0.00007507291,0.00025759925,0.00012938016,0.000060011833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015241615,0.00068449124,0.00072110904,0.0021981648,0.0017435845,0.0038534172,0.0014414075,0.00083794986,0.0037779862],"category_scores_gemma":[0.0036639106,0.0007444485,0.0019250088,0.0029364843,0.0037950343,0.006891126,0.0019338646,0.0037076967,0.0009334458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026284299,0.000016622766,0.00013472154,0.000043907734,0.000016283493,0.000091593734,0.00032254652,0.0025337422,0.0018277407,0.97857547,0.00030249133,0.016108628],"study_design_scores_gemma":[0.0000034726597,0.000014212006,0.0001404739,0.000023048,0.000018745006,0.00005916702,0.00006293439,0.011341125,0.002658198,0.97996956,0.005689988,0.000019173214],"about_ca_topic_score_codex":0.0014709773,"about_ca_topic_score_gemma":0.001452324,"teacher_disagreement_score":0.0038534172,"about_ca_system_score_codex":0.0012932387,"about_ca_system_score_gemma":0.0008461549,"threshold_uncertainty_score":0.0126386285},"labels":[],"label_agreement":null},{"id":"W1602008100","doi":"10.1007/11564751_27","title":"2 -Way vs.d -Way Branching for CSP","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backtracking; Branching (polymer chemistry); Mathematics; Exponential function; Search tree; Tree (set theory); Branching process; Computer science; Combinatorics; Algorithm; Discrete mathematics; Search algorithm; Chemistry","score_opus":0.017049597193305812,"score_gpt":0.24662395629981837,"score_spread":0.22957435910651255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602008100","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.022364495,0.0043449877,0.9073576,0.0022699789,0.00030912246,0.00011239213,0.00051702996,0.002278117,0.06044629],"genre_scores_gemma":[0.51386034,0.0043748384,0.45627275,0.0009496054,0.00051297987,0.00027967195,0.00092604646,0.0013077749,0.021515984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983688,0.0005438251,0.00015726776,0.00028575864,0.00037324656,0.0002711687],"domain_scores_gemma":[0.9963446,0.0023521928,0.00016564039,0.0007842403,0.00014174232,0.00021150483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021126703,0.00086939015,0.0009477869,0.0010118166,0.0011069999,0.0040721213,0.0015284088,0.002203218,0.014954305],"category_scores_gemma":[0.0045470507,0.0007548383,0.0014575036,0.0028173313,0.0028172627,0.009579936,0.0028247973,0.004158366,0.0029039308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002475251,0.00004037955,0.0002469093,0.00023259397,0.000013984573,0.000070618284,0.00026845545,0.01000142,0.002164082,0.9034062,0.004392568,0.07891526],"study_design_scores_gemma":[0.00004411557,0.00003279742,0.00009602208,0.00004180632,0.000016692837,0.0001102281,0.000040684874,0.026961448,0.0013352073,0.96214044,0.009159188,0.000021354554],"about_ca_topic_score_codex":0.0019825688,"about_ca_topic_score_gemma":0.0026500786,"teacher_disagreement_score":0.014954305,"about_ca_system_score_codex":0.0014799132,"about_ca_system_score_gemma":0.0012641299,"threshold_uncertainty_score":0.050027132},"labels":[],"label_agreement":null},{"id":"W1602071642","doi":"10.1007/978-3-642-25878-7_3","title":"Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rectangle; Planar graph; Combinatorics; Planar; Mathematics; Vertex (graph theory); Graph; Planar straight-line graph; Geometry; Graph drawing; Line graph; Computer graphics (images); Computer science; 1-planar graph","score_opus":0.016513601780573657,"score_gpt":0.24355095371958468,"score_spread":0.22703735193901103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602071642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014095976,0.00020511626,0.9455117,0.00007954294,0.00012327492,0.000110903675,0.00024362734,0.0009275438,0.03870237],"genre_scores_gemma":[0.2163651,0.0006136915,0.75329274,0.00006719029,0.00008768716,0.00020318701,0.0008850066,0.0010110443,0.027474314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990607,0.00018254283,0.0000425656,0.00019802313,0.00040566115,0.00011059003],"domain_scores_gemma":[0.9991153,0.0002599909,0.000081727965,0.00027945274,0.0001975761,0.00006599882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054919405,0.0011863806,0.0010517711,0.0012556207,0.0007836183,0.001934529,0.0020044672,0.0012895807,0.018955935],"category_scores_gemma":[0.0030278768,0.0011754732,0.0008471996,0.001705492,0.00091990206,0.0020379287,0.0019350632,0.0020573295,0.004835285],"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.00024730797,0.000087768334,0.00030665877,0.00034026388,0.000040984538,0.00052568025,0.0004381605,0.07423665,0.016176036,0.6634094,0.015549729,0.2286413],"study_design_scores_gemma":[0.00011085138,0.00017795902,0.0004463687,0.00013349467,0.000068708054,0.0009655894,0.00024693547,0.43648982,0.02344993,0.43904862,0.09876761,0.00009415527],"about_ca_topic_score_codex":0.0011240537,"about_ca_topic_score_gemma":0.0021736203,"teacher_disagreement_score":0.018955935,"about_ca_system_score_codex":0.0005389855,"about_ca_system_score_gemma":0.0004745726,"threshold_uncertainty_score":0.06341398},"labels":[],"label_agreement":null},{"id":"W1602087275","doi":"10.1007/978-3-642-01399-7_22","title":"Why Are Peers Less Stable in Unpopular P2P Streaming Channels?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Streaming current; Computer network; Computer security; Nanotechnology; Materials science","score_opus":0.02177463811474751,"score_gpt":0.23862801566885924,"score_spread":0.21685337755411174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602087275","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.90225524,0.0027217062,0.038472783,0.011128843,0.0005239783,0.00010211835,0.0007840042,0.000994209,0.04301709],"genre_scores_gemma":[0.9897488,0.0005109579,0.0042722207,0.0005407881,0.0002069339,0.000026809452,0.00023204756,0.000112932416,0.0043484857],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985833,0.00022710345,0.00005845808,0.00032915035,0.00056092074,0.00024105603],"domain_scores_gemma":[0.9876385,0.0045718527,0.0015799333,0.0011220679,0.0033127675,0.0017749808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017732396,0.0002519279,0.0006573945,0.0008056152,0.0011593655,0.0026093717,0.0014022266,0.0018046098,0.007776319],"category_scores_gemma":[0.019760694,0.00030971513,0.00026111215,0.0011370016,0.0014681519,0.005361417,0.0011043698,0.0010985689,0.002245955],"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.002494166,0.00063627824,0.14051153,0.0014994073,0.00043923972,0.0026140905,0.0087779565,0.012658902,0.087396584,0.1488261,0.057285987,0.5368597],"study_design_scores_gemma":[0.0005807832,0.0013322079,0.21948658,0.00033568338,0.0006000256,0.0063267504,0.029328793,0.09211739,0.05506014,0.49763304,0.096845545,0.0003530828],"about_ca_topic_score_codex":0.0027387517,"about_ca_topic_score_gemma":0.0026133833,"teacher_disagreement_score":0.007776319,"about_ca_system_score_codex":0.0006716672,"about_ca_system_score_gemma":0.00063603086,"threshold_uncertainty_score":0.026014388},"labels":[],"label_agreement":null},{"id":"W1602142010","doi":"10.1007/3-540-45336-9_41","title":"On the Elaboration of Hand-Drawn Sketches","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Sketch; Set (abstract data type); Scale (ratio); Graphics; Computer graphics (images); Computer graphics; Markov chain; Artificial intelligence; Algorithm; Machine learning; Programming language","score_opus":0.02074617296667083,"score_gpt":0.2705439296468537,"score_spread":0.24979775668018286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602142010","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.00932951,0.0015971508,0.9486919,0.0001868818,0.0002080521,0.00010106131,0.00017054983,0.0024441718,0.03727063],"genre_scores_gemma":[0.18150155,0.0031337026,0.75670797,0.00007203911,0.0000852018,0.00008395217,0.0009049295,0.0016296695,0.055880994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932516,0.00016183485,0.00004478576,0.00011431298,0.00031207007,0.000041847597],"domain_scores_gemma":[0.9982021,0.0010781805,0.00005272278,0.00044454675,0.00018753986,0.00003492348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073120365,0.0009335264,0.0005792801,0.0009784778,0.0006440673,0.0022242449,0.0013708704,0.00086315704,0.029125523],"category_scores_gemma":[0.0066839587,0.0008822045,0.000948389,0.0009851941,0.0017852709,0.00293534,0.0025231624,0.0015970058,0.005011461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020844117,0.000032129272,0.00038819094,0.00077766454,0.000050918068,0.0005380623,0.0017596117,0.040433627,0.024394076,0.33061063,0.011996476,0.5888102],"study_design_scores_gemma":[0.00007890556,0.00013952938,0.00085588184,0.00055097573,0.00009744493,0.001067714,0.0005988926,0.21896192,0.042863354,0.41733745,0.31734282,0.00010511641],"about_ca_topic_score_codex":0.0010141844,"about_ca_topic_score_gemma":0.0017456864,"teacher_disagreement_score":0.029125523,"about_ca_system_score_codex":0.0003715983,"about_ca_system_score_gemma":0.00037666445,"threshold_uncertainty_score":0.09743452},"labels":[],"label_agreement":null},{"id":"W1602145753","doi":"10.1007/978-3-642-00975-4_13","title":"Data Gathering in Optical Networks with the TL1 Toolkit","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 British Columbia","funders":"","keywords":"Computer science; Simple Network Management Protocol; Computer network; Quality of service; Network management; Data collection; Network monitoring","score_opus":0.016128619172727707,"score_gpt":0.22497149996268584,"score_spread":0.20884288078995814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602145753","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.0055828025,0.000597519,0.8644919,0.00019406668,0.00009755857,0.00020625004,0.0011950374,0.11597166,0.011663246],"genre_scores_gemma":[0.16479498,0.0012910133,0.78221154,0.0003385514,0.00008991648,0.0006314408,0.006149308,0.016016392,0.028476823],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986872,0.0002915652,0.00012088793,0.00017864135,0.0005327614,0.00018893604],"domain_scores_gemma":[0.99799865,0.0008082874,0.00008961242,0.0007815863,0.00021181775,0.000110123554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019831285,0.0011731392,0.0011609714,0.0013823524,0.0009124594,0.0035745762,0.003146033,0.0009882324,0.01681471],"category_scores_gemma":[0.0037577515,0.0013404161,0.001386293,0.0018434733,0.0008328005,0.004136303,0.0034882394,0.0022064142,0.007129319],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015525942,0.00030754972,0.002209367,0.0016868075,0.00031397142,0.0005373736,0.001610095,0.042146884,0.03645736,0.09475547,0.13894455,0.679478],"study_design_scores_gemma":[0.00036735574,0.00017266403,0.0013469659,0.00047776478,0.00014523376,0.0006705551,0.0003794384,0.49904695,0.08913789,0.10261558,0.30538625,0.00025336756],"about_ca_topic_score_codex":0.003061402,"about_ca_topic_score_gemma":0.0027599458,"teacher_disagreement_score":0.01681471,"about_ca_system_score_codex":0.00094617106,"about_ca_system_score_gemma":0.0011305016,"threshold_uncertainty_score":0.05625081},"labels":[],"label_agreement":null},{"id":"W1602165982","doi":"10.1007/978-3-540-24631-2_2","title":"The Key Establishment Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Presentation (obstetrics); Key (lock); Variety (cybernetics); Simple (philosophy); Cryptography; Subject (documents); Software engineering; Computer security; Artificial intelligence; World Wide Web; Epistemology; Mathematics; Philosophy","score_opus":0.015418231642717065,"score_gpt":0.25408909726074824,"score_spread":0.2386708656180312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602165982","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050454505,0.013660698,0.5576507,0.04550322,0.002603255,0.00036531757,0.0013923128,0.00067969377,0.32769036],"genre_scores_gemma":[0.7720917,0.013238617,0.09331448,0.0036359474,0.0034870158,0.00075405824,0.0021261068,0.0003672991,0.11098475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605113,0.0012415819,0.00021939269,0.0011010721,0.0008999746,0.0004869167],"domain_scores_gemma":[0.9924378,0.0048079174,0.0004633433,0.0017261324,0.00039405594,0.00017084971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027900152,0.0011094903,0.0016914239,0.0010075811,0.0030819054,0.007507535,0.0020978365,0.004856288,0.018384103],"category_scores_gemma":[0.013344867,0.0011648868,0.0011883293,0.002672631,0.0056323693,0.021880094,0.0050059715,0.009109267,0.0056859395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009891964,0.00003714627,0.00010435977,0.00016273047,0.000020691505,0.00006523161,0.0001377369,0.0017167174,0.00041404582,0.9545728,0.012230695,0.030439012],"study_design_scores_gemma":[0.00002480071,0.000008999183,0.000045818662,0.000030040617,0.000011289656,0.00013083578,0.00004031062,0.004322554,0.00045861502,0.9839229,0.010994125,0.0000097368875],"about_ca_topic_score_codex":0.00034556177,"about_ca_topic_score_gemma":0.00020860645,"teacher_disagreement_score":0.018384103,"about_ca_system_score_codex":0.0020718686,"about_ca_system_score_gemma":0.0016063949,"threshold_uncertainty_score":0.061500967},"labels":[],"label_agreement":null},{"id":"W1602205142","doi":"10.1007/11513988_24","title":"Improved Probabilistic Models for 802.11 Protocol Verification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Probabilistic logic; Reachability; Exponential backoff; Model checking; Abstraction; Protocol (science); Probabilistic CTL; Divergence-from-randomness model; Computer network; Distributed computing; Wireless; Theoretical computer science; Probabilistic analysis of algorithms; Throughput; Artificial intelligence","score_opus":0.04303138857095064,"score_gpt":0.3083600198162897,"score_spread":0.26532863124533906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602205142","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.0024739092,0.00016371085,0.9927995,0.00024121813,0.00006782659,0.000090932,0.00016145797,0.0010149282,0.002986611],"genre_scores_gemma":[0.36535993,0.0008390315,0.6137418,0.0004250938,0.00042980287,0.0011791405,0.0010574982,0.00081695494,0.0161507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901335,0.0029710247,0.00070521265,0.0009984383,0.004536052,0.0006557348],"domain_scores_gemma":[0.98454607,0.008496937,0.0008130924,0.004125105,0.0017782213,0.00024055503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053568697,0.0018467184,0.0018383801,0.0017670745,0.0012044768,0.0036809773,0.005185446,0.0022775256,0.0105598755],"category_scores_gemma":[0.02205306,0.0020257805,0.0029679579,0.0015881956,0.0024872157,0.009074668,0.004351942,0.0061319633,0.003123797],"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.00030455773,0.00012634847,0.00036559792,0.0002585887,0.00009439879,0.0002113974,0.00026531983,0.3599655,0.003581362,0.5810908,0.0047064666,0.049029693],"study_design_scores_gemma":[0.00004896333,0.00003947973,0.000063874664,0.000031108924,0.000051925766,0.000055878543,0.000013121017,0.7587367,0.0017846132,0.23525411,0.0038933617,0.000026854626],"about_ca_topic_score_codex":0.0036757085,"about_ca_topic_score_gemma":0.005251015,"teacher_disagreement_score":0.0105598755,"about_ca_system_score_codex":0.0029806008,"about_ca_system_score_gemma":0.0027876587,"threshold_uncertainty_score":0.03532636},"labels":[],"label_agreement":null},{"id":"W1602213077","doi":"10.1007/978-3-642-22306-8_6","title":"Randomized Backtracking in State Space Traversal","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree traversal; Backtracking; Computer science; Concurrency; State space; Context (archaeology); Java; Model checking; Programming language; State (computer science); Theoretical computer science; Bounded function; Algorithm; Mathematics","score_opus":0.03326182238659969,"score_gpt":0.27367207296261903,"score_spread":0.24041025057601934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602213077","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.0071777604,0.00033053802,0.9806637,0.00028201513,0.00009899624,0.00014412001,0.00019649412,0.0038182053,0.007288097],"genre_scores_gemma":[0.23176652,0.00046764984,0.7491809,0.0003363609,0.000057131583,0.0005062121,0.0009543295,0.0015789664,0.015151934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99394083,0.0024604925,0.00034708,0.0009266441,0.00160699,0.00071798137],"domain_scores_gemma":[0.989489,0.006948429,0.0002846866,0.0026116103,0.00052916014,0.00013715726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033018072,0.0011655883,0.0019908226,0.0014104579,0.0015582994,0.0029705833,0.00315995,0.0020569789,0.012894652],"category_scores_gemma":[0.013662168,0.0015591385,0.0019846966,0.0025303673,0.0032152217,0.006364397,0.0045096795,0.0042488696,0.0029409048],"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.0009942098,0.00032130466,0.0005388284,0.0006595985,0.00010275015,0.00017944397,0.00043382336,0.15344802,0.008950033,0.42033276,0.013367652,0.4006716],"study_design_scores_gemma":[0.00014214433,0.00008107726,0.000125214,0.00009355977,0.00007182279,0.00008918525,0.000065906104,0.5686444,0.0092626875,0.41308454,0.008291471,0.000048064274],"about_ca_topic_score_codex":0.0056389105,"about_ca_topic_score_gemma":0.009452273,"teacher_disagreement_score":0.012894652,"about_ca_system_score_codex":0.002591258,"about_ca_system_score_gemma":0.0044041816,"threshold_uncertainty_score":0.043136954},"labels":[],"label_agreement":null},{"id":"W1602247128","doi":"10.1007/978-3-642-02577-8_36","title":"Emotions and Messages in Simple Robot Gestures","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gesture; Computer science; Context (archaeology); Robot; Human–computer interaction; Interpretation (philosophy); Social robot; Simple (philosophy); Artificial intelligence; Mobile robot; Robot control; Programming language","score_opus":0.03325184061239308,"score_gpt":0.3415749390688754,"score_spread":0.30832309845648237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602247128","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.5391742,0.0069930498,0.113184586,0.00091789884,0.00049832696,0.00016732783,0.00051569735,0.00063633407,0.3379126],"genre_scores_gemma":[0.95883197,0.0008634845,0.012186088,0.000081151025,0.000083430685,0.00009568003,0.0001529963,0.00013155754,0.027573712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997298,0.00008905892,0.000010965331,0.00005359446,0.00007109015,0.00004538727],"domain_scores_gemma":[0.9995988,0.00026202036,0.00004714174,0.000026399974,0.000031589643,0.000034060522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024298392,0.0004564366,0.0002656993,0.00022488332,0.0005284441,0.0019328641,0.00036763406,0.0007308393,0.009669285],"category_scores_gemma":[0.002209852,0.00032728838,0.00031094058,0.00034957568,0.0010242601,0.002010674,0.00074979966,0.00069058785,0.0009847878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014969389,0.00013472849,0.0057888003,0.0013129748,0.00009349527,0.0020350097,0.02781756,0.009825181,0.24802944,0.36884433,0.008987156,0.32563442],"study_design_scores_gemma":[0.00025665757,0.0009440171,0.16302419,0.0010553924,0.0002773405,0.0029180686,0.01757232,0.09570132,0.05857432,0.59740764,0.061872255,0.0003964567],"about_ca_topic_score_codex":0.00077205134,"about_ca_topic_score_gemma":0.0009213635,"teacher_disagreement_score":0.009669285,"about_ca_system_score_codex":0.00031299697,"about_ca_system_score_gemma":0.00015357557,"threshold_uncertainty_score":0.032346964},"labels":[],"label_agreement":null},{"id":"W1602279527","doi":"10.1007/11902140_106","title":"Test Suite Reduction Based on Dependence Analysis","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Test suite; Computer science; Java; Test case; Suite; Equivalence (formal languages); Programming language; Test (biology); Algorithm; Mathematics; Machine learning; Discrete mathematics","score_opus":0.01573036673521473,"score_gpt":0.24977390180548278,"score_spread":0.23404353507026807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602279527","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.061051544,0.0005930676,0.9117873,0.00042520382,0.00014904636,0.0002332023,0.00033368342,0.01040047,0.015026543],"genre_scores_gemma":[0.52780944,0.00040321058,0.4562683,0.0003299842,0.0001236599,0.00031339875,0.001631689,0.0018053186,0.011315015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845016,0.00035892508,0.00008058919,0.00016775963,0.0007485094,0.00019399641],"domain_scores_gemma":[0.996405,0.0019853204,0.00017472479,0.00078707223,0.0005485356,0.00009932189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053307,0.0012819867,0.0012245761,0.0036557193,0.00048210996,0.0007421969,0.0017585761,0.0005990726,0.0060132556],"category_scores_gemma":[0.0044075553,0.0005535867,0.0017255314,0.0018485385,0.0007766115,0.0012543483,0.0013302554,0.0018719381,0.0011650831],"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.0005037093,0.00075441273,0.0019018878,0.00036730236,0.00014128353,0.00041580023,0.00013690902,0.049869657,0.061814707,0.035323936,0.013914939,0.8348555],"study_design_scores_gemma":[0.00020854121,0.0004894437,0.0034128947,0.00009669061,0.00035259614,0.0011326545,0.0000693444,0.79849577,0.078056484,0.10789404,0.009702823,0.00008876341],"about_ca_topic_score_codex":0.001616987,"about_ca_topic_score_gemma":0.002492794,"teacher_disagreement_score":0.0060132556,"about_ca_system_score_codex":0.00067417923,"about_ca_system_score_gemma":0.0011135096,"threshold_uncertainty_score":0.02011633},"labels":[],"label_agreement":null},{"id":"W1602311394","doi":"10.1007/11564126_52","title":"Dynamic Ensemble Re-Construction for Better Ranking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Western University","funders":"","keywords":"Computer science; Ranking (information retrieval); Ensemble learning; Construct (python library); Machine learning; AdaBoost; Artificial intelligence; Task (project management); Learning to rank; Data mining; Ensemble forecasting; Support vector machine","score_opus":0.016400313872440946,"score_gpt":0.26007662780684343,"score_spread":0.24367631393440248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602311394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02802529,0.00062773714,0.96108395,0.00035155754,0.00066668354,0.00012573542,0.0005892076,0.0053414423,0.0031882925],"genre_scores_gemma":[0.2707842,0.00044685524,0.70315695,0.00041723286,0.00078925653,0.00032340802,0.0054647634,0.0021099753,0.016507432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976004,0.0008936633,0.00015106054,0.00046602418,0.0005788357,0.00031009625],"domain_scores_gemma":[0.99348336,0.0015210095,0.00015060767,0.0025039224,0.002146463,0.00019459768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00296315,0.0016535675,0.0029358536,0.0029548148,0.0013002533,0.0016139392,0.0020036842,0.0018106669,0.011018698],"category_scores_gemma":[0.0091434615,0.00077545195,0.0018167945,0.002757456,0.0004579166,0.0035393944,0.0022244607,0.0028043706,0.005494658],"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.00038588097,0.00042966675,0.0025242541,0.00012586027,0.0003022642,0.00012164803,0.00013503789,0.092245236,0.016434746,0.008927414,0.0491563,0.8292118],"study_design_scores_gemma":[0.000045483655,0.000109237175,0.000836486,0.000020609143,0.00010655782,0.00011895469,0.000059889808,0.9675609,0.0098407585,0.013800855,0.0074643297,0.000035906425],"about_ca_topic_score_codex":0.0026097752,"about_ca_topic_score_gemma":0.0072579314,"teacher_disagreement_score":0.011018698,"about_ca_system_score_codex":0.0005078459,"about_ca_system_score_gemma":0.0011231872,"threshold_uncertainty_score":0.03686118},"labels":[],"label_agreement":null},{"id":"W1602329079","doi":"10.1007/978-3-642-04554-7_8","title":"Extending the User Requirements Notation with Aspect-Oriented Concepts","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Computer science; Standardization; Extension (predicate logic); Software engineering; Aspect-oriented programming; Programming language; Software; Linguistics","score_opus":0.035067915717097706,"score_gpt":0.3088058052858306,"score_spread":0.2737378895687329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602329079","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.0010513202,0.00020489978,0.9864222,0.0003953824,0.00015660803,0.00005553817,0.00007879877,0.0017833293,0.00985196],"genre_scores_gemma":[0.031879175,0.00085162424,0.9547474,0.00049427606,0.00016764438,0.00023846689,0.00047846517,0.001111053,0.010031821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956899,0.0019487641,0.0005964222,0.0003897257,0.0011837156,0.00019141825],"domain_scores_gemma":[0.9942563,0.0031721834,0.00041791098,0.0012833701,0.000691695,0.00017849174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00624496,0.0015789653,0.00090329227,0.0014602419,0.0008246365,0.0049259895,0.0025314183,0.0018214813,0.0055228653],"category_scores_gemma":[0.0091869375,0.0012746996,0.0019093206,0.0014885844,0.0017085245,0.007107693,0.002979317,0.0051392624,0.0034193262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008334641,0.00011384208,0.00035632934,0.0006096646,0.000047018293,0.000737313,0.0022553257,0.0057338136,0.008199304,0.79095554,0.016944055,0.17396446],"study_design_scores_gemma":[0.00007458145,0.000116331095,0.000260436,0.0005611326,0.00010547071,0.002030028,0.0002807131,0.043664645,0.01126302,0.29573542,0.6458225,0.00008575149],"about_ca_topic_score_codex":0.0009901588,"about_ca_topic_score_gemma":0.0016286698,"teacher_disagreement_score":0.00624496,"about_ca_system_score_codex":0.00047954696,"about_ca_system_score_gemma":0.0012249529,"threshold_uncertainty_score":0.033026874},"labels":[],"label_agreement":null},{"id":"W1602338941","doi":"10.1007/3-540-45490-x_59","title":"Implementation Issues and Paradigms of Visual KDD Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Visualization; Knowledge extraction; Data mining; Data science; Artificial intelligence; Information retrieval","score_opus":0.02427486315615486,"score_gpt":0.334340150202316,"score_spread":0.31006528704616115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602338941","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.007881962,0.001274751,0.9720477,0.0035863882,0.0002510562,0.000116850446,0.00015453059,0.0010133962,0.0136732925],"genre_scores_gemma":[0.14216551,0.0020858306,0.8455535,0.00045402173,0.0002189986,0.0003624893,0.00036801357,0.0005195263,0.008272084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99277085,0.002462596,0.0009120107,0.0007165523,0.002695089,0.00044284406],"domain_scores_gemma":[0.9851226,0.0064125396,0.00037313235,0.0045097526,0.002871639,0.00071033876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010053313,0.0006390462,0.00093481597,0.0017677105,0.002019107,0.01631824,0.0064880173,0.0023905823,0.009055953],"category_scores_gemma":[0.030361593,0.0017176725,0.0010957433,0.0040670307,0.0041454383,0.017393649,0.004101487,0.0043427693,0.00242769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007929262,0.00011214732,0.0005475132,0.00029125693,0.00003247739,0.000037908983,0.0006022387,0.0046567414,0.0011124525,0.8933512,0.0050438223,0.09413304],"study_design_scores_gemma":[0.00006457714,0.000048484548,0.00025952046,0.00013747715,0.000046939986,0.0001650429,0.00037210307,0.064498134,0.004112416,0.87831545,0.051932257,0.00004764918],"about_ca_topic_score_codex":0.004016053,"about_ca_topic_score_gemma":0.003606525,"teacher_disagreement_score":0.01631824,"about_ca_system_score_codex":0.0024527013,"about_ca_system_score_gemma":0.0027120886,"threshold_uncertainty_score":0.05316758},"labels":[],"label_agreement":null},{"id":"W1602389753","doi":"10.1007/bfb0017413","title":"Double-wall cellwork systems for plant meristems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Plant Molecular Biology Research","field":"Agricultural and Biological Sciences","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":"Cegep de Saint Jerome","funders":"","keywords":"Division (mathematics); Cell wall; Cell division; Boundary (topology); Meristem; Mathematics; Geometry; Biology; Mathematical analysis; Botany; Arithmetic; Cell","score_opus":0.034605610249706716,"score_gpt":0.24621628107963414,"score_spread":0.21161067082992743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602389753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22138931,0.0072827595,0.74293405,0.0003178298,0.00048595856,0.000103428756,0.00037682478,0.0031496107,0.0239603],"genre_scores_gemma":[0.6938359,0.0036121935,0.2572394,0.000073434356,0.00012030716,0.00020337943,0.0012092168,0.0004015738,0.043304496],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999243,0.0000061277024,0.0000039640313,0.000028615294,0.000023051238,0.000013987617],"domain_scores_gemma":[0.9998944,0.000028904917,0.000009121526,0.00003524355,0.00001410493,0.000018229372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115703995,0.00048075043,0.00041094198,0.00026281326,0.0004595875,0.0010132596,0.00072684,0.0005291672,0.0052714683],"category_scores_gemma":[0.00019728715,0.0003761173,0.0003550322,0.00025771558,0.00032252475,0.0011221226,0.00072201644,0.00064626365,0.0016260884],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107386586,0.000038640264,0.0002274079,0.0002626676,0.000015380783,0.00012617481,0.00021796413,0.007821633,0.8120854,0.10396238,0.002803219,0.07233174],"study_design_scores_gemma":[0.00009648506,0.00029389557,0.0014219882,0.000065913155,0.00005123316,0.0008005048,0.00018138703,0.12716296,0.66594934,0.07791749,0.12597716,0.00008174615],"about_ca_topic_score_codex":0.00029966404,"about_ca_topic_score_gemma":0.0006563125,"teacher_disagreement_score":0.0052714683,"about_ca_system_score_codex":0.00033220244,"about_ca_system_score_gemma":0.00012838005,"threshold_uncertainty_score":0.017634809},"labels":[],"label_agreement":null},{"id":"W1602467868","doi":"10.1007/978-3-540-74960-8_13","title":"Parts of the Problem of Polyploids in Rearrangement Phylogeny","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Genome; Phylogenetics; Genetic algorithm; Set (abstract data type); Event (particle physics); Evolutionary biology; Biology; Genomics; Computer science; Computational biology; Genetics; Gene; Physics","score_opus":0.015478037939288045,"score_gpt":0.24257665979103657,"score_spread":0.22709862185174853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602467868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05201231,0.016596457,0.85607386,0.01190039,0.0008987139,0.00009605132,0.0007218037,0.0005200688,0.061180364],"genre_scores_gemma":[0.5550757,0.02063264,0.34314513,0.0027868077,0.0042192987,0.0002942396,0.0035284471,0.0012840795,0.069033764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999356,0.00022136352,0.00003908692,0.00020692505,0.00012766106,0.00004900803],"domain_scores_gemma":[0.9960406,0.0031325456,0.00017171932,0.00037776757,0.0001273287,0.00015008684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012961747,0.00088158314,0.0016673909,0.0013185053,0.0018894991,0.0034426276,0.0024094193,0.0028322022,0.014591284],"category_scores_gemma":[0.0077918605,0.0009884646,0.0017481077,0.0042836843,0.0038404984,0.009362049,0.0027307123,0.0050114635,0.0017813136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007595219,0.00004124069,0.00070072577,0.00037744368,0.000047287693,0.00017671763,0.00057223486,0.045416225,0.00081077777,0.83025116,0.019181179,0.10234899],"study_design_scores_gemma":[0.000008711756,0.0000075655275,0.00031230281,0.000032946155,0.000009431241,0.00009044787,0.000054034495,0.02041867,0.00014934038,0.9703226,0.008584439,0.0000095275645],"about_ca_topic_score_codex":0.0020327284,"about_ca_topic_score_gemma":0.0013111713,"teacher_disagreement_score":0.014591284,"about_ca_system_score_codex":0.0013107163,"about_ca_system_score_gemma":0.000538828,"threshold_uncertainty_score":0.048812687},"labels":[],"label_agreement":null},{"id":"W1602539916","doi":"10.1007/978-3-540-32261-0_2","title":"Towards a Formal and Implemented Model of Argumentation Schemes in Agent Communication","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Winnipeg","funders":"Leverhulme Trust","keywords":"Argumentation theory; Scope (computer science); Computer science; Flexibility (engineering); Process (computing); Artificial intelligence; Defeasible reasoning; Theoretical computer science; Programming language; Mathematics; Epistemology","score_opus":0.035457156392077395,"score_gpt":0.2882841212521585,"score_spread":0.2528269648600811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602539916","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.0014228346,0.00009817469,0.99415743,0.00033025406,0.00006925638,0.00013639647,0.000062225474,0.000557299,0.0031662134],"genre_scores_gemma":[0.08264514,0.00026758853,0.90993303,0.00022161305,0.00010721711,0.00068660156,0.00027217728,0.0002855466,0.0055811103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992814,0.0033447382,0.0008786893,0.0007995294,0.0017412673,0.00042179922],"domain_scores_gemma":[0.99227965,0.0035750382,0.00045134634,0.0016720684,0.0016139828,0.00040794726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073578986,0.0013659247,0.0016003448,0.0018052574,0.0023619684,0.011382478,0.008981897,0.0062634526,0.008747273],"category_scores_gemma":[0.016366845,0.0019443386,0.002771693,0.0021692272,0.005670411,0.012724355,0.0045911125,0.007225659,0.0029833424],"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.00003900073,0.000063270636,0.00012413393,0.00013037765,0.00002817773,0.00008939233,0.0005474719,0.022190182,0.0010541677,0.96250516,0.0011602754,0.012068431],"study_design_scores_gemma":[0.00007168137,0.000042671538,0.000054637203,0.00011160677,0.000053586555,0.000112744594,0.000120925586,0.29744843,0.0027249285,0.6820416,0.017171752,0.000045476103],"about_ca_topic_score_codex":0.0037069286,"about_ca_topic_score_gemma":0.0031753003,"teacher_disagreement_score":0.011382478,"about_ca_system_score_codex":0.0033743894,"about_ca_system_score_gemma":0.0037693062,"threshold_uncertainty_score":0.038912714},"labels":[],"label_agreement":null},{"id":"W1602643602","doi":"10.1007/3-540-44651-6_17","title":"SITA: Protecting Internet Trade Agents from Malicious Hosts","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Western University","funders":"","keywords":"Anonymity; Computer security; The Internet; Vulnerability (computing); Key (lock); Computer science; Internet privacy; World Wide Web","score_opus":0.021069616268206914,"score_gpt":0.2367932079690144,"score_spread":0.2157235917008075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602643602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07696923,0.004087723,0.764615,0.002279802,0.0014133409,0.00038334937,0.0006523468,0.042619057,0.106980085],"genre_scores_gemma":[0.5936097,0.0026251636,0.22765845,0.0012324986,0.0005245062,0.0002883911,0.0022244167,0.0029848423,0.16885212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944085,0.00008804956,0.00003178684,0.00007154215,0.00028233125,0.00008535277],"domain_scores_gemma":[0.9985833,0.0002835603,0.00019860787,0.0005982694,0.00022281731,0.00011352113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067854964,0.0010750566,0.0006366737,0.0011307272,0.00092531345,0.0021068938,0.0016863662,0.0013510623,0.006167916],"category_scores_gemma":[0.0015419445,0.0006059019,0.0005699416,0.0006394711,0.0011603682,0.00326235,0.0020999117,0.002685936,0.005486969],"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.0011164731,0.0006127603,0.0032005692,0.0005065748,0.00019510159,0.000730982,0.0007102097,0.021509847,0.068678685,0.08809802,0.15329081,0.6613501],"study_design_scores_gemma":[0.0003067373,0.0010267934,0.0037263238,0.00024416944,0.0004019863,0.0039793532,0.00053594186,0.35107145,0.19934316,0.15384135,0.28537244,0.00015033642],"about_ca_topic_score_codex":0.00042934186,"about_ca_topic_score_gemma":0.00067839277,"teacher_disagreement_score":0.006167916,"about_ca_system_score_codex":0.00036443473,"about_ca_system_score_gemma":0.0008031827,"threshold_uncertainty_score":0.020633757},"labels":[],"label_agreement":null},{"id":"W1602644698","doi":"10.1007/11536482_2","title":"Visualizing Emotion in Musical Performance Using a Virtual Character","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroscience and Music Perception","field":"Neuroscience","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","funders":"","keywords":"Character (mathematics); Musical; Computer science; Animation; Meaning (existential); Perception; Visualization; Cognition; Human–computer interaction; Musical form; Music and emotion; Cognitive science; Artificial intelligence; Psychology; Art; Visual arts; Computer graphics (images); Music history","score_opus":0.05218162607017932,"score_gpt":0.2961292060591842,"score_spread":0.24394757998900488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602644698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4254193,0.002355067,0.4955397,0.0011244802,0.00058597606,0.0001932823,0.0008829556,0.0045227767,0.06937633],"genre_scores_gemma":[0.8372184,0.0012888266,0.13398747,0.00023338827,0.00015417168,0.00016957268,0.00034496855,0.0006607929,0.02594227],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999335,0.000022220791,0.0000030112087,0.000015124143,0.000013955594,0.000012254097],"domain_scores_gemma":[0.99984384,0.000086259744,0.000007769547,0.0000106290845,0.000014874961,0.000036572845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015273163,0.00063100434,0.00028564918,0.00032136453,0.0003558855,0.0017016869,0.00051571673,0.00060758926,0.01539888],"category_scores_gemma":[0.00053002225,0.00021734352,0.00037201692,0.0002894698,0.00045179832,0.0012309485,0.0010708526,0.0005371845,0.00089357933],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017776174,0.00021525908,0.00319693,0.0015333793,0.00018314958,0.0027445727,0.013184412,0.030044602,0.539979,0.030064005,0.023752417,0.3533248],"study_design_scores_gemma":[0.00039607522,0.0016218948,0.055867735,0.0009662764,0.0005556929,0.009771251,0.016556444,0.5105522,0.13721675,0.06707836,0.19888298,0.00053430523],"about_ca_topic_score_codex":0.00067912764,"about_ca_topic_score_gemma":0.0011993165,"teacher_disagreement_score":0.01539888,"about_ca_system_score_codex":0.0001946633,"about_ca_system_score_gemma":0.00010908408,"threshold_uncertainty_score":0.051514447},"labels":[],"label_agreement":null},{"id":"W1602672367","doi":"10.1007/11581741_13","title":"Control Flow Analysis of UML 2.0 Sequence Diagrams","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":67,"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":"Metamodeling; Sequence diagram; Computer science; Unified Modeling Language; Applications of UML; Flowchart; UML tool; Communication diagram; Programming language; Control flow; Activity diagram; Theoretical computer science; Data mining; Software","score_opus":0.032778836282624735,"score_gpt":0.2849920416730981,"score_spread":0.25221320539047337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602672367","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.12507604,0.00047676376,0.8614718,0.00012121153,0.0000300562,0.00025274773,0.0007144347,0.005249784,0.006607139],"genre_scores_gemma":[0.6374128,0.00042534719,0.35203215,0.00006165337,0.00003511885,0.00023487698,0.0027350392,0.00081859966,0.0062443996],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990715,0.00027495105,0.000060964583,0.00012706546,0.00038679817,0.000078707875],"domain_scores_gemma":[0.99685514,0.0022802337,0.00019448057,0.0001334606,0.00050489954,0.00003173742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011202508,0.0005467205,0.00027330234,0.0034352639,0.00041435048,0.0008635391,0.00047076243,0.0004592339,0.002991526],"category_scores_gemma":[0.0037251792,0.00035173458,0.0006703617,0.0010026499,0.00035417118,0.0009262312,0.00025531003,0.00041346133,0.00034494247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007216647,0.0002707482,0.01072213,0.0008610582,0.00008604322,0.0005070626,0.0018391326,0.14648995,0.0672996,0.071542926,0.005690069,0.69396967],"study_design_scores_gemma":[0.00006108005,0.00019849135,0.0069983364,0.00022386454,0.00010462902,0.00026886785,0.00020320677,0.86272424,0.071846746,0.039845247,0.017460572,0.00006473298],"about_ca_topic_score_codex":0.009636583,"about_ca_topic_score_gemma":0.006328592,"teacher_disagreement_score":0.009636583,"about_ca_system_score_codex":0.00082890096,"about_ca_system_score_gemma":0.0010477209,"threshold_uncertainty_score":0.019160986},"labels":[],"label_agreement":null},{"id":"W1602680134","doi":"10.1007/978-3-642-29116-6_13","title":"A New Perspective on List Update: Probabilistic Locality and Working Set","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Locality; Working set; Property (philosophy); Set (abstract data type); Perspective (graphical); Probabilistic logic; Context (archaeology); Theoretical computer science; Algorithm; Locality of reference; Data mining; Artificial intelligence; Parallel computing","score_opus":0.03294439704847021,"score_gpt":0.2807151596800382,"score_spread":0.24777076263156797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602680134","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.011598312,0.010013911,0.92529196,0.013464085,0.0010062791,0.00005815719,0.0003778693,0.00051218,0.03767721],"genre_scores_gemma":[0.5958213,0.015364644,0.3232796,0.0045123813,0.010945732,0.0005194722,0.0006613364,0.0011362677,0.047759216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954797,0.00171742,0.00023254936,0.0008695409,0.0013523314,0.00034830463],"domain_scores_gemma":[0.982173,0.011295052,0.0008815525,0.0039397315,0.0011672166,0.0005434393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004437901,0.0008242167,0.0025128722,0.002329464,0.0028353704,0.0069478406,0.0068733445,0.0046792105,0.013477174],"category_scores_gemma":[0.023369214,0.0012679851,0.0015816138,0.00637267,0.007611422,0.028645823,0.0051543904,0.0071703717,0.0017596756],"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.000031242656,0.000022349888,0.00013440354,0.00008118153,0.000011828487,0.000034319888,0.00015707134,0.0051381686,0.00014936554,0.9733085,0.0047819065,0.016149668],"study_design_scores_gemma":[0.000010891402,0.000014598649,0.000054057753,0.000020621921,0.00001360047,0.00007372229,0.000043646327,0.031340618,0.00018162743,0.9614275,0.006803278,0.000015890237],"about_ca_topic_score_codex":0.0029610125,"about_ca_topic_score_gemma":0.0020893428,"teacher_disagreement_score":0.013477174,"about_ca_system_score_codex":0.003114172,"about_ca_system_score_gemma":0.0018859528,"threshold_uncertainty_score":0.04508567},"labels":[],"label_agreement":null},{"id":"W1602715715","doi":"10.1007/978-3-540-89900-6_7","title":"Computational Modeling of Criminal Activity","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Simon Fraser University","funders":"","keywords":"Computer science; Computational model; Criminal behaviour; Management science; Range (aeronautics); Criminal investigation; Data science; Operations research; Computer security; Criminology; Artificial intelligence; Engineering","score_opus":0.04812752710449014,"score_gpt":0.30185778814895503,"score_spread":0.2537302610444649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602715715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14106731,0.0036209836,0.77311116,0.009089835,0.00042049895,0.000065243126,0.002254164,0.00044887135,0.06992187],"genre_scores_gemma":[0.9039793,0.0029649213,0.05234937,0.00025202899,0.00037442602,0.00015776805,0.0013372941,0.00011616646,0.03846873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997781,0.000095211966,0.00000910682,0.000045092536,0.000041181964,0.000031318654],"domain_scores_gemma":[0.9987508,0.0009136475,0.0000939543,0.000081773534,0.00008659885,0.00007325072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006468355,0.00042825134,0.0007812753,0.0008535144,0.00047581238,0.001803417,0.0019412865,0.0013724923,0.007511925],"category_scores_gemma":[0.004069647,0.0005778119,0.00080328673,0.0012046645,0.0009840567,0.0017753519,0.00079988845,0.0017195008,0.00066763506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014275454,0.000033136992,0.001142154,0.000028083712,0.000031226617,0.000048111982,0.000059776597,0.7607796,0.00006741347,0.22539228,0.0034470665,0.008956884],"study_design_scores_gemma":[0.0000022184947,0.0000022035429,0.00018176257,0.000006210931,0.0000034136563,0.000014399893,0.000014757694,0.9127961,0.000018481298,0.086100005,0.0008577587,0.000002765275],"about_ca_topic_score_codex":0.019531243,"about_ca_topic_score_gemma":0.021843636,"teacher_disagreement_score":0.019531243,"about_ca_system_score_codex":0.0011201873,"about_ca_system_score_gemma":0.0011785614,"threshold_uncertainty_score":0.03883511},"labels":[],"label_agreement":null},{"id":"W1602826933","doi":"10.1007/978-3-540-76858-6_53","title":"SketchSurfaces: Sketch-Line Initialized Deformable Surfaces for Efficient and Controllable Interactive 3D Medical Image Segmentation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Sketch; Computer science; Initialization; Computer vision; Artificial intelligence; Segmentation; Computer graphics (images); Object (grammar); Line segment; Image segmentation; Line (geometry); Surface (topology); Visualization; Boundary (topology); Algorithm; Mathematics; Geometry","score_opus":0.02191816393019007,"score_gpt":0.3225186820506851,"score_spread":0.30060051812049504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602826933","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.0020677876,0.00016949074,0.98917234,0.000065076536,0.000041667292,0.000056758,0.00018420309,0.007343154,0.00089941936],"genre_scores_gemma":[0.06504667,0.00064387574,0.92302316,0.00013524425,0.00004960093,0.0002142371,0.0008129802,0.005337011,0.0047371225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994861,0.00007254541,0.000029640869,0.00006503096,0.0003117393,0.000034969144],"domain_scores_gemma":[0.99922764,0.0003851406,0.000045340774,0.00018923148,0.000096807635,0.000055722943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000719278,0.0015304106,0.0009907514,0.0010140506,0.00027205734,0.0016288916,0.0025241722,0.0015199786,0.013977237],"category_scores_gemma":[0.0030825858,0.0013292574,0.0008535519,0.0009414447,0.00074517744,0.0012915295,0.0026699482,0.0017497403,0.0033998017],"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.00037647638,0.00009291982,0.00051307055,0.0006181303,0.000109151864,0.00042630985,0.00044158637,0.11487226,0.099585384,0.029596863,0.03589745,0.71747035],"study_design_scores_gemma":[0.00010191579,0.00006034949,0.00021079836,0.000060652517,0.000020646708,0.0004594084,0.000037912614,0.8886611,0.05951054,0.018692842,0.032124877,0.000058963305],"about_ca_topic_score_codex":0.0011184238,"about_ca_topic_score_gemma":0.0017125388,"teacher_disagreement_score":0.013977237,"about_ca_system_score_codex":0.00042709635,"about_ca_system_score_gemma":0.0005796929,"threshold_uncertainty_score":0.046758473},"labels":[],"label_agreement":null},{"id":"W1602847274","doi":"10.1007/978-3-642-04397-0_7","title":"Christoffel and Fibonacci Tiles","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":40,"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 à Montréal","funders":"","keywords":"Polyomino; Fibonacci number; Tile; Plane (geometry); Combinatorics; Mathematics; Computer science; Arithmetic; Geometry; Art","score_opus":0.011391689286614373,"score_gpt":0.22979759057103807,"score_spread":0.2184059012844237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602847274","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.107219376,0.00602061,0.108768925,0.0012121617,0.0024480238,0.00008112653,0.00023410286,0.00026466037,0.773751],"genre_scores_gemma":[0.68776923,0.004003073,0.059615195,0.00073553703,0.0012496201,0.00017722689,0.00034466595,0.00028388732,0.24582154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967754,0.00005012906,0.000017040074,0.00005996814,0.00011649488,0.000078755926],"domain_scores_gemma":[0.9997551,0.00009854893,0.00001883284,0.00004305867,0.000055233406,0.000029314831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032760337,0.0006747346,0.0007841894,0.0020384116,0.0020130053,0.0021784802,0.0006103602,0.0010188323,0.010841804],"category_scores_gemma":[0.0011901469,0.0003929774,0.000642416,0.0013178292,0.0025009115,0.001608278,0.0010559527,0.0014541876,0.002187604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006874776,0.0000020535595,0.000016107593,0.000011188028,0.0000013021737,0.00004153714,0.000051292063,0.00024597754,0.00032167824,0.99372935,0.001099367,0.0044732867],"study_design_scores_gemma":[0.000007327426,0.0000093540175,0.000074249474,0.000011726101,0.0000036323686,0.00018036782,0.00005669877,0.0011995676,0.00060389325,0.97893494,0.018907746,0.000010368677],"about_ca_topic_score_codex":0.0015282001,"about_ca_topic_score_gemma":0.001640476,"teacher_disagreement_score":0.010841804,"about_ca_system_score_codex":0.0011457485,"about_ca_system_score_gemma":0.00061178475,"threshold_uncertainty_score":0.036269486},"labels":[],"label_agreement":null},{"id":"W160292340","doi":"10.1007/978-3-642-22438-6_22","title":"Automated Reasoning in $\\mathcal{ALCQ}$ via SMT","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Satisfiability; Benchmark (surveying); Modulo; Ontology; Satisfiability modulo theories; Automated reasoning; Set (abstract data type); Description logic; Exploit; Theoretical computer science; Boolean satisfiability problem; Programming language; Algorithm; Discrete mathematics; Mathematics","score_opus":0.02240339351393327,"score_gpt":0.2508628583995092,"score_spread":0.22845946488557595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160292340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011732219,0.00022516827,0.9439141,0.0014973308,0.00023635336,0.00015129095,0.002001579,0.01016794,0.030074103],"genre_scores_gemma":[0.2188393,0.00027738497,0.7534454,0.0007414346,0.00024705625,0.00023378505,0.0056013702,0.0022023204,0.018411914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961772,0.0012319722,0.00028146163,0.0006033588,0.0013807439,0.00032522887],"domain_scores_gemma":[0.9950505,0.0028928882,0.00016479431,0.0009418656,0.0008435163,0.00010643208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021644805,0.0011293956,0.0011443922,0.0016044435,0.0015826675,0.0053957645,0.0032723695,0.0013283297,0.03904773],"category_scores_gemma":[0.011042638,0.00082498975,0.0042581256,0.001808671,0.0019444375,0.008207116,0.0059199156,0.003000351,0.009281503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030409428,0.00018252234,0.00060142577,0.00067882054,0.00014903818,0.0003302123,0.0004345255,0.036984578,0.00446777,0.6872047,0.043092832,0.22556953],"study_design_scores_gemma":[0.000061975916,0.000019298408,0.0001728077,0.00007934888,0.000062714,0.00010544932,0.00013323664,0.21811874,0.005576402,0.7448497,0.030790538,0.000029769171],"about_ca_topic_score_codex":0.009409148,"about_ca_topic_score_gemma":0.01735107,"teacher_disagreement_score":0.03904773,"about_ca_system_score_codex":0.0023835702,"about_ca_system_score_gemma":0.0022492134,"threshold_uncertainty_score":0.13062763},"labels":[],"label_agreement":null},{"id":"W1602935914","doi":"10.1007/978-3-540-27780-4_44","title":"Location-Aware Adaptive Interfaces for Information Access with Handheld Computers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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 Saskatchewan","funders":"","keywords":"Computer science; Mobile device; Human–computer interaction; Adaptation (eye); User interface; Domain (mathematical analysis); Task (project management); Context (archaeology); User interface design; Interface (matter); World Wide Web; User experience design; Programming language; Operating system","score_opus":0.02986888661160942,"score_gpt":0.26273188016897303,"score_spread":0.23286299355736362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602935914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03611316,0.008650103,0.9097613,0.0003267009,0.00044885726,0.00016120542,0.00020208335,0.011660272,0.0326763],"genre_scores_gemma":[0.48844993,0.007233793,0.3659763,0.0005333447,0.00024046161,0.00029309254,0.00060870446,0.0008256225,0.1358387],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998036,0.000042868753,0.000013654351,0.000035335856,0.00008281266,0.00002172064],"domain_scores_gemma":[0.9996761,0.00017640356,0.000016085785,0.000060901493,0.00005726723,0.000013248271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019355152,0.00068300555,0.0004267746,0.0003502365,0.00023198329,0.00093380525,0.0013743581,0.0010268982,0.017501216],"category_scores_gemma":[0.00105656,0.00029357232,0.0002695848,0.00056968525,0.0001964005,0.0016403837,0.0007947902,0.00066388876,0.0035148922],"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.0004225684,0.00012359353,0.0005434648,0.00095918035,0.0000535999,0.00047520563,0.00094464293,0.0036796713,0.16480766,0.015682662,0.027648775,0.7846591],"study_design_scores_gemma":[0.00020467401,0.0014494923,0.0087680435,0.0007900065,0.0005270586,0.006347917,0.0012558062,0.18887861,0.22936778,0.042699367,0.51946104,0.00025028826],"about_ca_topic_score_codex":0.0005544445,"about_ca_topic_score_gemma":0.00081740104,"teacher_disagreement_score":0.017501216,"about_ca_system_score_codex":0.000156687,"about_ca_system_score_gemma":0.00010139286,"threshold_uncertainty_score":0.058547378},"labels":[],"label_agreement":null},{"id":"W1602957389","doi":"10.1007/11693383_6","title":"An Attack on CFB Mode Encryption as Used by OpenPGP","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Entrust (Canada)","funders":"","keywords":"Computer science; Encryption; Mode (computer interface); Computer security; Operating system","score_opus":0.029212092405749367,"score_gpt":0.3191329677446313,"score_spread":0.28992087533888194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602957389","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.4338327,0.001213126,0.4056673,0.008684376,0.0011437834,0.0004192753,0.0008940245,0.0067995093,0.14134589],"genre_scores_gemma":[0.95973504,0.00025802417,0.024778115,0.0005233849,0.00007814333,0.00011066567,0.00013352343,0.0002629557,0.014120191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971668,0.0005449854,0.000099111494,0.00019618688,0.0014580839,0.0005347396],"domain_scores_gemma":[0.9969523,0.00092502934,0.00011464052,0.0016123232,0.00031219635,0.00008339607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013135911,0.00067699095,0.00061908585,0.00085542735,0.001703963,0.0018103169,0.0007986557,0.0034942778,0.0033337623],"category_scores_gemma":[0.005448564,0.00049084425,0.0008071482,0.0009683768,0.0015487035,0.00451287,0.0031453706,0.0025828297,0.0014486691],"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.0017233815,0.00017887233,0.0035001584,0.00023754351,0.00010849476,0.0037791494,0.0017166192,0.012024442,0.07362634,0.6995583,0.03624464,0.16730206],"study_design_scores_gemma":[0.00023450008,0.0004936195,0.0029596318,0.00025503925,0.00020794546,0.007507178,0.00051793596,0.22979765,0.22167349,0.45665237,0.07949537,0.00020526994],"about_ca_topic_score_codex":0.0012242864,"about_ca_topic_score_gemma":0.0007604546,"teacher_disagreement_score":0.0034942778,"about_ca_system_score_codex":0.0011401143,"about_ca_system_score_gemma":0.00079430983,"threshold_uncertainty_score":0.011152625},"labels":[],"label_agreement":null},{"id":"W1602966341","doi":"10.1007/11424918_12","title":"Queuing Local Solutions in Distributed Constraint Satisfaction Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Backtracking; Queue; Local search (optimization); Constraint satisfaction problem; Queueing theory; Distributed computing; Mathematical optimization; Order (exchange); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Artificial intelligence; Computer network; Mathematics","score_opus":0.016444252347478778,"score_gpt":0.23277720445889494,"score_spread":0.21633295211141615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602966341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013162617,0.0005737188,0.9801625,0.00043853236,0.00009903692,0.000109296525,0.000046474684,0.00043816952,0.004969581],"genre_scores_gemma":[0.53407115,0.0012623512,0.43697226,0.00047078662,0.0003124708,0.0007626052,0.0003552725,0.00048354993,0.025309563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687696,0.0012719127,0.00018194348,0.00045764234,0.0008634464,0.00034805434],"domain_scores_gemma":[0.99358577,0.0046222988,0.00027558435,0.0005564256,0.00064012007,0.00031987467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047170324,0.000755321,0.0019868163,0.0007646297,0.0018122316,0.0030694737,0.0032167214,0.0017213541,0.0071191364],"category_scores_gemma":[0.011146079,0.0011140413,0.0006672375,0.0030707081,0.0020104914,0.0034340986,0.0033838558,0.0032321403,0.00082765275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030390063,0.00020290245,0.00049944286,0.0002591576,0.00006904501,0.00010222308,0.0004884207,0.581738,0.0019176417,0.3060938,0.00807472,0.100250766],"study_design_scores_gemma":[0.00005595646,0.000040572533,0.000055721142,0.000014324888,0.000014916452,0.000015548421,0.00005721093,0.907948,0.0005842495,0.088783346,0.002417309,0.000012789612],"about_ca_topic_score_codex":0.006431146,"about_ca_topic_score_gemma":0.011479711,"teacher_disagreement_score":0.0071191364,"about_ca_system_score_codex":0.003008186,"about_ca_system_score_gemma":0.002707747,"threshold_uncertainty_score":0.024946392},"labels":[],"label_agreement":null},{"id":"W1602982398","doi":"10.1007/3-540-45129-3_42","title":"On the Learning of Complex Movement Sequences","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Movement (music); Heuristic; Artificial intelligence; Construct (python library); Event (particle physics); Machine learning","score_opus":0.03650490253193118,"score_gpt":0.2655433063203154,"score_spread":0.22903840378838425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602982398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01694036,0.00083113404,0.97865343,0.00025784422,0.0000667542,0.000029082124,0.00009579604,0.00044118066,0.00268446],"genre_scores_gemma":[0.5421119,0.0034369943,0.4296547,0.00039313614,0.00030205728,0.000273273,0.0013839382,0.00036308388,0.022080949],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966466,0.00008808699,0.000029878769,0.000110049536,0.00007388855,0.000033413304],"domain_scores_gemma":[0.9970112,0.00227281,0.0001661911,0.00025687306,0.00020595422,0.00008700705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088163,0.0009457741,0.0012684755,0.00073870516,0.00035521758,0.0012203354,0.0017696981,0.001301902,0.0066402447],"category_scores_gemma":[0.006554375,0.0006523743,0.0006418408,0.0013747398,0.0011498212,0.0026718418,0.00219957,0.0015206583,0.0008170923],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001430625,0.000050369123,0.0008355143,0.00016860051,0.00006145102,0.00005783358,0.00013488965,0.4128123,0.001884879,0.049219612,0.0041645644,0.530467],"study_design_scores_gemma":[0.0000117224445,0.000031228,0.00028002492,0.0000218587,0.0000068124195,0.000026469465,0.000012387817,0.9419759,0.0005162812,0.055990472,0.0011198904,0.000006895221],"about_ca_topic_score_codex":0.006695581,"about_ca_topic_score_gemma":0.0057640574,"teacher_disagreement_score":0.006695581,"about_ca_system_score_codex":0.0005980121,"about_ca_system_score_gemma":0.000595179,"threshold_uncertainty_score":0.022213876},"labels":[],"label_agreement":null},{"id":"W1603025100","doi":"10.1007/978-3-540-39597-3_22","title":"Patterns for Motivating an Agent-Based Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Carleton University","funders":"","keywords":"Computer science; Psychology","score_opus":0.04235994161910448,"score_gpt":0.2630926411299749,"score_spread":0.2207326995108704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603025100","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.011462181,0.00023884166,0.8679833,0.015228495,0.0003479387,0.00040298558,0.00010348617,0.0005887,0.10364411],"genre_scores_gemma":[0.26260972,0.0003784434,0.699133,0.0013752832,0.00015497189,0.001078582,0.00019877446,0.00023802147,0.034833193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541324,0.0025694796,0.00025890555,0.0005109038,0.0009987007,0.00024882608],"domain_scores_gemma":[0.99452764,0.003041523,0.00030997596,0.00082359597,0.00072449143,0.0005727238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036420864,0.0008853277,0.0005492951,0.0012777719,0.003147852,0.0043097045,0.0020307987,0.0037801617,0.013583614],"category_scores_gemma":[0.011353072,0.00077942736,0.00077804556,0.0013345153,0.004978012,0.009972077,0.0060134353,0.0032776962,0.0024202897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030512525,0.000056904417,0.00041227954,0.0001008239,0.000009349944,0.00025086585,0.0024262182,0.0009327449,0.00076670345,0.96590215,0.005314192,0.023797182],"study_design_scores_gemma":[0.000052542226,0.000039493974,0.00013514998,0.00010708244,0.000015923457,0.0004526664,0.0022423,0.011738973,0.0011434105,0.8430165,0.14103697,0.00001890714],"about_ca_topic_score_codex":0.0017455526,"about_ca_topic_score_gemma":0.002622582,"teacher_disagreement_score":0.013583614,"about_ca_system_score_codex":0.0011756871,"about_ca_system_score_gemma":0.0016861663,"threshold_uncertainty_score":0.045441687},"labels":[],"label_agreement":null},{"id":"W1603082394","doi":"10.1007/3-540-45628-7_1","title":"A Portrait of a Scientist as a Computational Logician","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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","funders":"","keywords":"Portrait; Cognitive science; Computer science; Epistemology; Artificial intelligence; Psychology; Philosophy; Art history; Art","score_opus":0.018014468622178856,"score_gpt":0.24421494223212478,"score_spread":0.22620047360994594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603082394","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047478573,0.014509292,0.048467945,0.109449536,0.0022952217,0.000051819254,0.00019389394,0.00021836997,0.82006603],"genre_scores_gemma":[0.54484874,0.022968361,0.058448114,0.044763386,0.0069596614,0.00047073644,0.00030904595,0.0010091454,0.32022285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802303,0.0010784548,0.000054612396,0.0002959284,0.00040749882,0.00014050533],"domain_scores_gemma":[0.99779797,0.0013146793,0.00010283104,0.000239346,0.0002917343,0.00025342422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765566,0.00063113635,0.00052247825,0.0026570219,0.0056780674,0.0107207345,0.0016740598,0.004820858,0.009436098],"category_scores_gemma":[0.004130328,0.000501734,0.0005159122,0.0019666306,0.02835359,0.01649605,0.0030275183,0.009906876,0.0030498842],"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.0000042566053,0.0000037907087,0.000029228604,0.000011702324,0.0000011900486,0.000019015026,0.0016058619,0.00007346879,0.000031606884,0.991384,0.005095596,0.0017402773],"study_design_scores_gemma":[0.000007738468,0.00000635267,0.000048042162,0.000036594556,0.0000021164835,0.000056028257,0.0007410062,0.00027791364,0.000041698935,0.8185142,0.18026255,0.0000057072293],"about_ca_topic_score_codex":0.0034460612,"about_ca_topic_score_gemma":0.0045454274,"teacher_disagreement_score":0.0107207345,"about_ca_system_score_codex":0.0032987485,"about_ca_system_score_gemma":0.00317317,"threshold_uncertainty_score":0.031566918},"labels":[],"label_agreement":null},{"id":"W1603086150","doi":"10.1007/978-3-642-17322-6_19","title":"Techniques for Merging Views of Software Processes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of New Brunswick","funders":"","keywords":"Computer science; Merge (version control); Workflow; Software; Software engineering; Process (computing); Software development; Software development process; Theoretical computer science; Artificial intelligence; Programming language; Information retrieval; Database","score_opus":0.025445491348069515,"score_gpt":0.25602295533675923,"score_spread":0.23057746398868972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603086150","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.0029012875,0.00019988701,0.9936878,0.000067761415,0.000027611819,0.00006240152,0.000081838974,0.0020393492,0.00093207316],"genre_scores_gemma":[0.039073627,0.00036298798,0.95789105,0.00005709217,0.00003722126,0.00009099381,0.0006884046,0.0008486835,0.0009499227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924029,0.0015992865,0.00074804586,0.0011224288,0.0036387043,0.0004886324],"domain_scores_gemma":[0.98154044,0.009941049,0.0009463126,0.005259065,0.0019139262,0.00039917824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062870565,0.0017841918,0.0017488428,0.004151618,0.0015354647,0.0043903496,0.0049630925,0.0024127099,0.0068007065],"category_scores_gemma":[0.024093216,0.0033868335,0.004721902,0.0056431848,0.0020677575,0.013615154,0.00808547,0.005254523,0.0018876994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044614347,0.00017818759,0.0018570664,0.0010042997,0.00038069003,0.000623887,0.0041416483,0.02808104,0.020218682,0.19663712,0.008602171,0.737829],"study_design_scores_gemma":[0.00016148033,0.00020908809,0.0011937073,0.00039109297,0.00063055794,0.0009470044,0.0015200729,0.43041104,0.04209664,0.4579786,0.06426408,0.00019665062],"about_ca_topic_score_codex":0.0027733648,"about_ca_topic_score_gemma":0.004465477,"teacher_disagreement_score":0.0068007065,"about_ca_system_score_codex":0.0009915342,"about_ca_system_score_gemma":0.0013806117,"threshold_uncertainty_score":0.033249497},"labels":[],"label_agreement":null},{"id":"W1603097445","doi":"10.1007/978-3-540-70500-0_30","title":"Enhancing Micro-Aggregation Technique by Utilizing Dependence-Based Information in Secure Statistical Databases","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Carleton University","funders":"","keywords":"Computer science; Partition (number theory); Data mining; Heuristic; Process (computing); Set (abstract data type); Database; Artificial intelligence; Mathematics","score_opus":0.023537386320893732,"score_gpt":0.26526910023364275,"score_spread":0.24173171391274903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603097445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029914333,0.00039028926,0.9682124,0.00016780339,0.00003055784,0.000026841346,0.00008700479,0.00045374932,0.00071703043],"genre_scores_gemma":[0.7294197,0.0005679477,0.26761767,0.0001228832,0.00014841226,0.000049731894,0.00028135485,0.00008198911,0.0017102859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774605,0.00061611924,0.00019671275,0.0002985527,0.0010206087,0.00012191317],"domain_scores_gemma":[0.99518895,0.0016375077,0.00036853272,0.002006191,0.00071238703,0.00008647504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015379179,0.0004057685,0.0009514549,0.0010325585,0.00061018014,0.0012929948,0.0010352841,0.00044390574,0.00097550417],"category_scores_gemma":[0.0044440483,0.000390489,0.00063990394,0.0025475381,0.0005555215,0.002704081,0.0014408024,0.0010700474,0.00039012864],"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.0011279562,0.00039772555,0.0094493255,0.00022833905,0.0002412979,0.00045942207,0.00047259603,0.15444407,0.070036255,0.1597167,0.005711548,0.59771466],"study_design_scores_gemma":[0.000015294241,0.00011038846,0.0011652176,0.000010579896,0.00006795655,0.00045308325,0.000042855412,0.92748946,0.026359145,0.04125989,0.0029960915,0.000030127656],"about_ca_topic_score_codex":0.00077442033,"about_ca_topic_score_gemma":0.001193239,"teacher_disagreement_score":0.0015379179,"about_ca_system_score_codex":0.00050086173,"about_ca_system_score_gemma":0.0011170433,"threshold_uncertainty_score":0.008133411},"labels":[],"label_agreement":null},{"id":"W1603156618","doi":"10.1007/978-3-642-01181-8_26","title":"Beneficial Preadaptation in the Evolution of a 2D Agent Control System with Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Computer science; Task (project management); Genetic algorithm; Control (management); Artificial intelligence; Simple (philosophy); Machine learning; Engineering","score_opus":0.009963257023095237,"score_gpt":0.21687443676763277,"score_spread":0.20691117974453754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603156618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24817385,0.00040126662,0.73518676,0.00036000914,0.00013894243,0.00006839771,0.000013879164,0.00028349442,0.015373521],"genre_scores_gemma":[0.94393533,0.000100709025,0.0523379,0.00007238161,0.000022391878,0.00008229788,0.000009861097,0.000038338632,0.0034007037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998672,0.00004604538,0.0000052421515,0.000023414377,0.00003441789,0.000023644472],"domain_scores_gemma":[0.999762,0.00013247142,0.000029088234,0.000020231471,0.000034925095,0.000021288106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039871887,0.00045364408,0.00049663486,0.00025686852,0.00045239882,0.00060950447,0.0007004241,0.0009994236,0.0012889476],"category_scores_gemma":[0.001117395,0.00029018353,0.00036315896,0.00020020617,0.0008454488,0.0004069085,0.000880592,0.0007482155,0.00014207592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046851295,0.000027111106,0.00034103464,0.000025367832,0.000018239087,0.00009561092,0.00012391747,0.9592448,0.007079873,0.0134006245,0.00020136016,0.019395176],"study_design_scores_gemma":[0.000009151045,0.00003912353,0.000098254925,0.0000032845383,0.000005745439,0.000021995342,0.000009449385,0.9958204,0.0005015036,0.0032679287,0.0002177971,0.0000053686435],"about_ca_topic_score_codex":0.001953388,"about_ca_topic_score_gemma":0.001539435,"teacher_disagreement_score":0.001953388,"about_ca_system_score_codex":0.0003897218,"about_ca_system_score_gemma":0.0003782205,"threshold_uncertainty_score":0.004311979},"labels":[],"label_agreement":null},{"id":"W1603208670","doi":"10.1007/978-3-642-15883-4_11","title":"Learning with Randomized Majority Votes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Margin (machine learning); AdaBoost; Computer science; Empirical evidence; Majority rule; Weighted Majority Algorithm; Empirical research; Randomized experiment; Randomized controlled trial; Mathematics; Artificial intelligence; Machine learning; Algorithm; Statistics; Generalization error; Stability (learning theory); Medicine; Support vector machine","score_opus":0.005866368125662548,"score_gpt":0.2232179220996483,"score_spread":0.21735155397398576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603208670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005188914,0.0012473748,0.9783716,0.0011807935,0.00044590252,0.00012658119,0.00032079624,0.0015871678,0.011530782],"genre_scores_gemma":[0.32744586,0.0012676087,0.60933954,0.0017197604,0.0015952579,0.00097566756,0.0025096305,0.0009957468,0.054150958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942386,0.0029532432,0.0002957609,0.0011728038,0.00096629333,0.0003732599],"domain_scores_gemma":[0.99301237,0.0041652704,0.00022406704,0.0019314212,0.0005033241,0.00016352872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005241163,0.0016026977,0.0029376992,0.0012751526,0.0015402128,0.0031679554,0.0045149205,0.0032151085,0.016408127],"category_scores_gemma":[0.017300226,0.0013571151,0.0018793598,0.0018209361,0.0021570658,0.007436185,0.0059064305,0.0037583034,0.007543314],"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.00077733747,0.00021302469,0.0007944506,0.00047150778,0.00026398903,0.00008548412,0.00018426064,0.11917103,0.0015590497,0.25482452,0.0505123,0.571143],"study_design_scores_gemma":[0.00012732108,0.00007781274,0.00013231144,0.00006675574,0.0000489235,0.00007139559,0.000032301352,0.5610761,0.001841818,0.42732173,0.009175086,0.00002839043],"about_ca_topic_score_codex":0.0009920672,"about_ca_topic_score_gemma":0.0016306171,"teacher_disagreement_score":0.016408127,"about_ca_system_score_codex":0.0010946316,"about_ca_system_score_gemma":0.0015495103,"threshold_uncertainty_score":0.054890633},"labels":[],"label_agreement":null},{"id":"W1603213950","doi":"10.1007/3-540-45108-0_39","title":"Theoretical and Practical Considerations for Web-Based Intelligent Language Tutoring Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Simon Fraser University","funders":"","keywords":"Computer science; Intelligent tutoring system; Web application; World Wide Web; Human–computer interaction; Programming language; Software engineering; Natural language processing; Artificial intelligence","score_opus":0.02581875084520446,"score_gpt":0.28341035708608614,"score_spread":0.2575916062408817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603213950","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.022005862,0.014445961,0.41212133,0.08622012,0.0013328692,0.00023025258,0.0003053847,0.0008026272,0.46253562],"genre_scores_gemma":[0.8075675,0.006856278,0.12178084,0.0031623256,0.0026040962,0.0010669607,0.00037390855,0.000246047,0.056342084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734324,0.0013041125,0.0001232238,0.00023293625,0.00078206125,0.00021444794],"domain_scores_gemma":[0.99154097,0.006406547,0.00016858507,0.0004881098,0.001059458,0.00033640585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031689147,0.00089406606,0.0008044043,0.0011150552,0.0027514661,0.008671472,0.0035643445,0.00605394,0.037260804],"category_scores_gemma":[0.014740686,0.00088377146,0.0005747366,0.00096796534,0.005427214,0.012759769,0.002707676,0.0042942674,0.0051330887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039554587,0.00007062236,0.00016154215,0.00011978787,0.000005612928,0.00009985417,0.00027094426,0.0075919856,0.00028226967,0.9723532,0.004473929,0.014530714],"study_design_scores_gemma":[0.000029916624,0.000039622162,0.00012969067,0.000098994264,0.000009437872,0.00020359295,0.0005155347,0.03328839,0.0004310063,0.94533193,0.01990508,0.000016818154],"about_ca_topic_score_codex":0.0030916708,"about_ca_topic_score_gemma":0.0026760816,"teacher_disagreement_score":0.037260804,"about_ca_system_score_codex":0.0029735565,"about_ca_system_score_gemma":0.0019012993,"threshold_uncertainty_score":0.12464982},"labels":[],"label_agreement":null},{"id":"W1603253244","doi":"10.1007/978-3-642-11769-5_9","title":"Knowledge-Based Discrimination in Alzheimer’s Disease","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Alzheimer's disease research and treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence; Discriminative model; Categorical variable; Context (archaeology); Machine learning; Neuroimaging; Binary classification; Similarity (geometry); Pattern recognition (psychology); Identification (biology); Natural language processing; Support vector machine; Psychology","score_opus":0.04227280601305022,"score_gpt":0.3292990235498906,"score_spread":0.2870262175368404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603253244","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29673597,0.13614683,0.05292931,0.02864956,0.003023412,0.000101341946,0.00096656545,0.0002262241,0.48122078],"genre_scores_gemma":[0.9350174,0.023573413,0.008120035,0.0015478357,0.0005680363,0.000030053716,0.00054965756,0.000018319226,0.030575193],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997749,0.00007283955,0.000013226451,0.000031334628,0.00008139078,0.000026321557],"domain_scores_gemma":[0.9988073,0.00094803725,0.00004880217,0.000040397274,0.00010274166,0.000052740004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009632568,0.00027437147,0.0003500054,0.000695955,0.0002292493,0.0009611071,0.0005114368,0.0005793593,0.0058255023],"category_scores_gemma":[0.0035883235,0.00007747802,0.0002807533,0.0007658456,0.00063301745,0.0014148807,0.00044270733,0.00088210154,0.00058357016],"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.0002658894,0.00044705524,0.015757348,0.00033177843,0.00007564143,0.0005125038,0.00081354124,0.0020004811,0.00088984234,0.08194037,0.02437444,0.8725911],"study_design_scores_gemma":[0.00004884088,0.00027312714,0.059424434,0.0006740077,0.000086942404,0.0027768542,0.0012998114,0.008892443,0.0015504771,0.87605107,0.04887172,0.000050311304],"about_ca_topic_score_codex":0.0027488323,"about_ca_topic_score_gemma":0.0026495617,"teacher_disagreement_score":0.0058255023,"about_ca_system_score_codex":0.00077550847,"about_ca_system_score_gemma":0.00060711696,"threshold_uncertainty_score":0.019488215},"labels":[],"label_agreement":null},{"id":"W1603271854","doi":"10.1007/978-3-642-13059-5_26","title":"Exploiting Frame Information for Prepositional Phrase Semantic Role Labeling","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Athabasca University","funders":"","keywords":"Computer science; Semantic role labeling; Natural language processing; Predicate (mathematical logic); Artificial intelligence; Phrase; Frame (networking); Argument (complex analysis); Noun phrase; FrameNet; Task (project management); Word-sense disambiguation; Parsing; Noun; Sentence; WordNet","score_opus":0.009039467467741818,"score_gpt":0.24888950526273548,"score_spread":0.23985003779499367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603271854","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.015019912,0.0006765668,0.9668179,0.00035378014,0.00021329436,0.00013498828,0.0018627247,0.00458926,0.010331549],"genre_scores_gemma":[0.21402694,0.0009159482,0.7695678,0.00019772661,0.00018775502,0.00020645688,0.007973503,0.0011492842,0.005774643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992674,0.00018773662,0.000056463712,0.00020202623,0.0001833144,0.00010303228],"domain_scores_gemma":[0.9986688,0.00061386405,0.00007087012,0.00038010397,0.00022031904,0.000046005633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011041116,0.0011179104,0.0009860825,0.0024538182,0.0009802043,0.001795302,0.001997608,0.001297683,0.0104868645],"category_scores_gemma":[0.0028549943,0.000997935,0.0014540711,0.0026330547,0.00067246245,0.0058260877,0.0017563652,0.001739621,0.004392912],"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.0007457794,0.00032704213,0.0009480396,0.00060460524,0.00008928062,0.00042949087,0.0006094948,0.013473871,0.04427093,0.11686119,0.028654505,0.7929857],"study_design_scores_gemma":[0.00010472424,0.00012427881,0.0010626805,0.00020078303,0.00021235163,0.0003763831,0.00042342232,0.5090587,0.06268909,0.37115508,0.05447373,0.000118690856],"about_ca_topic_score_codex":0.0060227737,"about_ca_topic_score_gemma":0.011245775,"teacher_disagreement_score":0.0104868645,"about_ca_system_score_codex":0.0010344993,"about_ca_system_score_gemma":0.0011774551,"threshold_uncertainty_score":0.0350821},"labels":[],"label_agreement":null},{"id":"W1603315213","doi":"10.1007/978-3-540-85990-1_59","title":"Quantification of Edematic Effects in Prostate Brachytherapy Interventions","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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":"Queen's University","funders":"National Cancer Institute","keywords":"Ground truth; Imaging phantom; Brachytherapy; Ultrasound; Computer science; Prostate brachytherapy; Implant; Metric (unit); Volume (thermodynamics); Biomedical engineering; Medicine; Nuclear medicine; Radiology; Computer vision; Radiation therapy; Surgery; Physics","score_opus":0.03113780588946549,"score_gpt":0.3213745802921923,"score_spread":0.2902367744027268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603315213","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.8972751,0.010312208,0.08930707,0.000099964505,0.00004758933,0.00008413769,0.00021428632,0.0004219952,0.0022377025],"genre_scores_gemma":[0.9867784,0.0010717865,0.010623394,0.000033134293,0.00001708223,0.000026563992,0.000102445214,0.00007513401,0.0012722197],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970883,0.00009100766,0.000012076551,0.00003396394,0.00012528301,0.000028883793],"domain_scores_gemma":[0.99930143,0.00039571858,0.00010770619,0.00003939182,0.000108281914,0.000047422487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053338136,0.00030816672,0.0003729065,0.00090244185,0.00017782718,0.000722792,0.0003556233,0.00046281592,0.00086215336],"category_scores_gemma":[0.0017493638,0.00027858713,0.00023805481,0.00047006903,0.00023314363,0.0005180111,0.0003682851,0.0003875489,0.00013878148],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028802801,0.00020781196,0.020700494,0.0005327419,0.00011355294,0.00032351338,0.0002822221,0.027501062,0.82288295,0.000739459,0.00043721925,0.12339868],"study_design_scores_gemma":[0.00007378589,0.001983561,0.1407219,0.00008537531,0.00036753007,0.0022219357,0.00019135009,0.16878815,0.6824094,0.00064575946,0.0024125471,0.000098641096],"about_ca_topic_score_codex":0.0010035861,"about_ca_topic_score_gemma":0.00096902275,"teacher_disagreement_score":0.0010035861,"about_ca_system_score_codex":0.0003022167,"about_ca_system_score_gemma":0.00031505252,"threshold_uncertainty_score":0.0028842092},"labels":[],"label_agreement":null},{"id":"W1603317060","doi":"10.1007/3-540-36573-7_14","title":"An Extension for MSC-2000 and Its Application","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Extension (predicate logic); Computer science; Construct (python library); Programming language; Semantics (computer science); Sequence (biology); Theoretical computer science; Software engineering","score_opus":0.02859867938223091,"score_gpt":0.2967071656373684,"score_spread":0.26810848625513745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603317060","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.056103446,0.0010159139,0.68158853,0.0013766135,0.001343186,0.00041792545,0.0026912338,0.03507442,0.22038871],"genre_scores_gemma":[0.3118629,0.0013902672,0.46833545,0.00083249254,0.00095377956,0.00063763134,0.00970332,0.008848074,0.19743617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935395,0.00010597854,0.00005714688,0.000100596306,0.00031320401,0.0000691443],"domain_scores_gemma":[0.99909115,0.00021650844,0.00007067528,0.00021442177,0.00032021257,0.00008705704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064320606,0.0005727032,0.00030365007,0.00093765487,0.0004300788,0.0011968696,0.0007479485,0.00067124394,0.017457714],"category_scores_gemma":[0.0020550124,0.00024081938,0.000471443,0.0009266964,0.00044684706,0.001159887,0.0012648616,0.0010223142,0.007838229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009906632,0.00048807767,0.0014091728,0.0004945728,0.000033526616,0.00052830804,0.0006648283,0.008815338,0.03132619,0.27628338,0.08790134,0.5910646],"study_design_scores_gemma":[0.0001577494,0.0002685264,0.0008536176,0.00017611717,0.000059538062,0.0010079612,0.000097108954,0.03146809,0.028992023,0.053256404,0.8836124,0.00005040724],"about_ca_topic_score_codex":0.001399549,"about_ca_topic_score_gemma":0.0013811134,"teacher_disagreement_score":0.017457714,"about_ca_system_score_codex":0.0005268056,"about_ca_system_score_gemma":0.0009072769,"threshold_uncertainty_score":0.058401883},"labels":[],"label_agreement":null},{"id":"W1603321854","doi":"10.1007/3-540-44651-6_2","title":"Use of agents for resolving feature interactions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Feature (linguistics); Computer science; Forcing (mathematics); Set (abstract data type); Distributed computing; Theoretical computer science; Mathematics; Programming language","score_opus":0.06322423509768117,"score_gpt":0.29662941016486055,"score_spread":0.2334051750671794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603321854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020011244,0.0004427495,0.94225574,0.00032951144,0.00021784073,0.0002270144,0.000081296166,0.013639466,0.02279514],"genre_scores_gemma":[0.27431446,0.00038945393,0.70127696,0.00022430951,0.00009117738,0.000193508,0.00033367545,0.0017530184,0.021423493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997759,0.0006033353,0.00019685061,0.0004036007,0.00083241257,0.0002048862],"domain_scores_gemma":[0.9947084,0.0022542593,0.00045639562,0.0017774471,0.0005917277,0.00021179258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002080425,0.001111862,0.00072534016,0.0012889925,0.0016366272,0.0036204914,0.0026316566,0.001858786,0.006248515],"category_scores_gemma":[0.010633105,0.00083630945,0.0008509946,0.00088533957,0.0013449148,0.0050978153,0.0041279634,0.0021362456,0.0021158573],"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.00074382516,0.000495311,0.003377016,0.000551192,0.00020027209,0.0015499142,0.0035745627,0.015671628,0.048223842,0.14538364,0.019784972,0.7604438],"study_design_scores_gemma":[0.00022468144,0.00027062677,0.0012165749,0.000257246,0.00045697048,0.002093795,0.00085324154,0.45614174,0.13911198,0.11656796,0.2826117,0.00019354846],"about_ca_topic_score_codex":0.001467701,"about_ca_topic_score_gemma":0.0025157498,"teacher_disagreement_score":0.006248515,"about_ca_system_score_codex":0.0005189194,"about_ca_system_score_gemma":0.000809359,"threshold_uncertainty_score":0.020903349},"labels":[],"label_agreement":null},{"id":"W1603323476","doi":"10.1007/11527954_15","title":"Algorithmic Foundations of the Internet:Foreword","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.013083527159608725,"score_gpt":0.259365659742581,"score_spread":0.2462821325829723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603323476","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005065175,0.37421778,0.19616833,0.09052256,0.042985756,0.00009441114,0.0008747927,0.0005190954,0.28955206],"genre_scores_gemma":[0.12823936,0.4382373,0.07982011,0.018165441,0.10491044,0.00035613062,0.001339474,0.0007525393,0.22817922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970204,0.000059487604,0.000015355448,0.00007298228,0.00012128309,0.00002879608],"domain_scores_gemma":[0.9991499,0.00052574347,0.000041590025,0.00007673359,0.00014842249,0.000057659272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556394,0.0007978487,0.00062853534,0.0015731781,0.0007947134,0.0033881841,0.0012031599,0.0023106115,0.014993452],"category_scores_gemma":[0.002427929,0.00054034754,0.00049354264,0.0023648704,0.0018003304,0.006516344,0.0011706348,0.0033857299,0.00624715],"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.000013784275,0.00003384297,0.00012246428,0.0003506889,0.000017675373,0.00005078194,0.00007230479,0.0020913468,0.00026852783,0.70634854,0.20847397,0.0821561],"study_design_scores_gemma":[0.0000044028548,0.00000772283,0.00012431311,0.0002275574,0.000007579729,0.000117364834,0.000034883313,0.0014109587,0.00009516884,0.69578373,0.30217728,0.00000900401],"about_ca_topic_score_codex":0.00081508554,"about_ca_topic_score_gemma":0.00088884734,"teacher_disagreement_score":0.014993452,"about_ca_system_score_codex":0.0013668214,"about_ca_system_score_gemma":0.0008754644,"threshold_uncertainty_score":0.050158143},"labels":[],"label_agreement":null},{"id":"W1603401893","doi":"10.1007/978-3-540-24840-8_63","title":"A Multi-agent System for Semantic Information Retrieval","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Acadia University","funders":"","keywords":"Computer science; Ontology; World Wide Web; Information retrieval; Semantic Web; Semantics (computer science); Knowledge base; Semantic Web Stack; Dissemination; OWL-S; Social Semantic Web; Interface (matter); Programming language","score_opus":0.023507794615168078,"score_gpt":0.25019533023600776,"score_spread":0.22668753562083968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603401893","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.008895542,0.0006922858,0.96627176,0.0006176902,0.00026194242,0.0003330248,0.00029403382,0.013253446,0.009380236],"genre_scores_gemma":[0.10666689,0.0005460797,0.8763455,0.00036062597,0.00016444142,0.00045420017,0.000896476,0.0005848772,0.013980927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.00027775523,0.00010301977,0.00013533197,0.00027736084,0.000054724766],"domain_scores_gemma":[0.9992424,0.00030362277,0.00003705792,0.00015619802,0.00018241121,0.000078352925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016240668,0.0005617145,0.0011863456,0.0013940486,0.0018258892,0.0032006374,0.0022873408,0.0022778702,0.008380112],"category_scores_gemma":[0.0029046491,0.00062415906,0.0007210287,0.0014377048,0.0006950029,0.003875378,0.0023853453,0.0013338646,0.004448754],"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.0012810214,0.00084330793,0.0013715196,0.0007779549,0.0003839161,0.0014176688,0.0010501074,0.049550988,0.053402957,0.11168538,0.06911203,0.7091232],"study_design_scores_gemma":[0.00027056684,0.00018792992,0.00053033937,0.000077975026,0.00030020936,0.00064935704,0.00018459935,0.774815,0.026762502,0.07717184,0.11893462,0.00011494251],"about_ca_topic_score_codex":0.0031178927,"about_ca_topic_score_gemma":0.0043162717,"teacher_disagreement_score":0.008380112,"about_ca_system_score_codex":0.00068337866,"about_ca_system_score_gemma":0.0011853798,"threshold_uncertainty_score":0.02803427},"labels":[],"label_agreement":null},{"id":"W1603421361","doi":"10.1007/978-3-642-16242-8_43","title":"PBINT, A Logic for Modelling Search Problems Involving Arithmetic","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Arithmetic function; Computer science; Disjoint sets; Presburger arithmetic; Binary number; Theoretical computer science; Constraint (computer-aided design); Arithmetic; Algorithm; Mathematics; Discrete mathematics; Decidability","score_opus":0.04708642937666076,"score_gpt":0.2631873979677397,"score_spread":0.21610096859107897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603421361","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.003209996,0.0011577313,0.9585852,0.0009401478,0.0002576732,0.00015407312,0.0011614902,0.0021361832,0.03239751],"genre_scores_gemma":[0.1595352,0.0027684753,0.7922582,0.0013670591,0.00045875585,0.00072770397,0.003033216,0.0009342193,0.038917147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990305,0.00023460729,0.00010660911,0.00019905697,0.00031788016,0.00011142034],"domain_scores_gemma":[0.9992607,0.0003648058,0.000065771776,0.00013800991,0.00011078256,0.000059918446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011512784,0.0012867956,0.0007388266,0.0016914329,0.0014755445,0.0050968025,0.0031775893,0.0015912107,0.01156458],"category_scores_gemma":[0.0044540255,0.0009811013,0.0018540166,0.002302579,0.0027037517,0.010631797,0.0029861531,0.004136621,0.0026271683],"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.00007111083,0.0000247018,0.00021862189,0.00030087042,0.000019019639,0.00015097525,0.00023525629,0.0065452075,0.0010959994,0.93638325,0.009079186,0.04587581],"study_design_scores_gemma":[0.000026552934,0.000022253445,0.0001019936,0.00007841472,0.00003913386,0.00023786296,0.00008810378,0.03079154,0.0014728506,0.902926,0.06419115,0.000024083338],"about_ca_topic_score_codex":0.0044885804,"about_ca_topic_score_gemma":0.0060711685,"teacher_disagreement_score":0.01156458,"about_ca_system_score_codex":0.00166264,"about_ca_system_score_gemma":0.0016974153,"threshold_uncertainty_score":0.038687408},"labels":[],"label_agreement":null},{"id":"W1603617425","doi":"10.1007/978-3-642-16478-1_1","title":"PICOBIT: A Compact Scheme System for Microcontrollers","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Compiler; Scheme (mathematics); Microcontroller; Bytecode; Programming language; Virtual machine; Embedded system; Computer hardware; Parallel computing","score_opus":0.014473035750432165,"score_gpt":0.25149342639898403,"score_spread":0.23702039064855188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603617425","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013393899,0.0011383094,0.94056726,0.00021150534,0.00038717798,0.00023954695,0.0005173247,0.021473939,0.022071],"genre_scores_gemma":[0.27927214,0.0010465698,0.6519145,0.0003626039,0.00017150382,0.0005918767,0.0014600734,0.0032908062,0.061889898],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966335,0.000058815724,0.000024305811,0.000037495447,0.00018243707,0.000033533863],"domain_scores_gemma":[0.9996979,0.00006130824,0.00002378919,0.00009093926,0.000089536385,0.00003651102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025319232,0.00065410754,0.00074873224,0.00063084293,0.0004659078,0.0009123173,0.0016999277,0.00050969113,0.028945606],"category_scores_gemma":[0.00095480814,0.00047096758,0.00027014024,0.0007491644,0.00029352363,0.0013899218,0.0010232764,0.00088182243,0.006407527],"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.0014847998,0.00012361698,0.00081772247,0.0013368776,0.000108498425,0.00023906116,0.00042386385,0.023502164,0.15817899,0.08654116,0.07357152,0.6536717],"study_design_scores_gemma":[0.00041781642,0.001060631,0.001288088,0.00015792003,0.00016090086,0.0014915231,0.000094156654,0.2984502,0.23287335,0.019202637,0.44464543,0.00015732311],"about_ca_topic_score_codex":0.00041103933,"about_ca_topic_score_gemma":0.0007207188,"teacher_disagreement_score":0.028945606,"about_ca_system_score_codex":0.00044767035,"about_ca_system_score_gemma":0.0005363408,"threshold_uncertainty_score":0.09683263},"labels":[],"label_agreement":null},{"id":"W1603781187","doi":"10.1007/978-3-642-12242-2_11","title":"Using Code Bloat to Obfuscate Evolved Network Traffic","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Intrusion detection system; Code (set theory); Process (computing); Network packet; Port (circuit theory); Intrusion; Real-time computing; Computer security; Artificial intelligence; Programming language","score_opus":0.028522077278252726,"score_gpt":0.26617275926615164,"score_spread":0.2376506819878989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603781187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33709934,0.0003348219,0.640614,0.0003816933,0.00030001713,0.000072584,0.00011155245,0.008250365,0.012835594],"genre_scores_gemma":[0.8723599,0.00014358603,0.117000975,0.00019695183,0.000037689675,0.000044925015,0.00014681122,0.0010268833,0.00904234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996661,0.00005827386,0.000014291319,0.000062768326,0.00012080003,0.000077735276],"domain_scores_gemma":[0.99838436,0.00056800974,0.0001440113,0.00070525316,0.00015207376,0.000046272165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904094,0.0005158527,0.0003256326,0.00057583844,0.00044604338,0.00056824135,0.00069775444,0.000815795,0.0027502992],"category_scores_gemma":[0.0031534606,0.00029622586,0.00041315675,0.00035915786,0.0008897429,0.0008405785,0.0011836265,0.001344533,0.00054798566],"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.0010551822,0.00026106744,0.005155715,0.00023015362,0.00018723012,0.00092082476,0.00058003515,0.22336692,0.3280343,0.09192083,0.0064220214,0.34186572],"study_design_scores_gemma":[0.000053506643,0.00023532756,0.0012903725,0.00005781327,0.000078121535,0.00048608368,0.0000411127,0.7619217,0.19886725,0.02699177,0.009933427,0.000043487318],"about_ca_topic_score_codex":0.00066473236,"about_ca_topic_score_gemma":0.0011056125,"teacher_disagreement_score":0.0027502992,"about_ca_system_score_codex":0.00049128523,"about_ca_system_score_gemma":0.00037476863,"threshold_uncertainty_score":0.009200692},"labels":[],"label_agreement":null},{"id":"W1603801129","doi":"10.1007/978-3-642-31540-4_6","title":"Privacy Consensus in Anonymization Systems via Game Theory","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Theoretical computer science; Game theory; Information privacy; Computer security; Mathematical economics; Mathematics","score_opus":0.02485830246769921,"score_gpt":0.2537430722393827,"score_spread":0.22888476977168348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603801129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020587578,0.00042008623,0.9554001,0.001485284,0.00007558159,0.0002692462,0.00013592653,0.0002318908,0.021394271],"genre_scores_gemma":[0.75263375,0.0011674656,0.23076992,0.0005191483,0.00019661288,0.00090122316,0.0003187579,0.00015468229,0.0133385435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989647,0.0057061384,0.00046472077,0.0016230631,0.0016794475,0.00087962346],"domain_scores_gemma":[0.9896209,0.0074127726,0.00078114105,0.0010691981,0.0007257762,0.00039024453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007493213,0.0012149973,0.001665136,0.0011405917,0.002280517,0.005406518,0.0028555335,0.002752216,0.0045248605],"category_scores_gemma":[0.016213128,0.000671818,0.001673103,0.0017966031,0.0053758356,0.00785535,0.004439646,0.004043347,0.00072106236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006181143,0.000043743636,0.00023712535,0.00011424597,0.000058666563,0.00008564286,0.00055954163,0.13535227,0.0007416643,0.84829116,0.0016738389,0.012780211],"study_design_scores_gemma":[0.000028645429,0.000027845028,0.00007135285,0.000024832716,0.000015428075,0.000036482244,0.00011321127,0.26353782,0.0003679274,0.7326779,0.003077202,0.00002131309],"about_ca_topic_score_codex":0.002671608,"about_ca_topic_score_gemma":0.0015921891,"teacher_disagreement_score":0.007493213,"about_ca_system_score_codex":0.004471259,"about_ca_system_score_gemma":0.0029853045,"threshold_uncertainty_score":0.039628386},"labels":[],"label_agreement":null},{"id":"W1603830235","doi":"10.1007/978-3-540-39611-6_9","title":"A Uniform Continuum Model for Scaling of Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Network packet; Scalability; Packet forwarding; Overhead (engineering); Routing (electronic design automation); Scaling; Distributed computing; Telecommunications; Wireless; Mathematics","score_opus":0.017138113934079,"score_gpt":0.23753708255443076,"score_spread":0.22039896862035177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603830235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024165059,0.0034005935,0.9087912,0.0025469852,0.00072091556,0.00009799589,0.00022782643,0.00048487925,0.059564605],"genre_scores_gemma":[0.82101536,0.0059352405,0.113797516,0.0013978078,0.0017754801,0.00042276856,0.00033657125,0.00040655895,0.05491268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893624,0.00036894868,0.000045313627,0.0001636499,0.00034362686,0.00014212335],"domain_scores_gemma":[0.998293,0.00066770654,0.00016900121,0.00028922723,0.00031965907,0.0002615007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015004849,0.0009719409,0.0014044511,0.0014652817,0.0012214023,0.0030001597,0.0033065213,0.0023493527,0.0069590756],"category_scores_gemma":[0.0066615753,0.00058917515,0.001038033,0.0017850931,0.0024336863,0.00468388,0.0024013014,0.0025165884,0.0014154036],"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.000025013751,0.000040001298,0.00013657456,0.000062680876,0.000013619091,0.00008001736,0.000087541426,0.057713524,0.00072585716,0.9299412,0.0044156,0.0067583458],"study_design_scores_gemma":[0.000024764546,0.000037725502,0.000117393894,0.000026983193,0.000015627342,0.00012068143,0.00005276492,0.5053255,0.00016224368,0.4879109,0.006186448,0.000018994717],"about_ca_topic_score_codex":0.0016750556,"about_ca_topic_score_gemma":0.00083676504,"teacher_disagreement_score":0.0069590756,"about_ca_system_score_codex":0.0015719637,"about_ca_system_score_gemma":0.00075941905,"threshold_uncertainty_score":0.023280442},"labels":[],"label_agreement":null},{"id":"W1603835434","doi":"10.1007/978-3-540-28637-0_14","title":"Mobile Note Taking: Investigating the Efficacy of Mobile Text Entry","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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","funders":"","keywords":"Computer science; Text entry; Handwriting; Focus (optics); Mobile device; Multimedia; Human–computer interaction; Resource (disambiguation); World Wide Web; Artificial intelligence; Computer network","score_opus":0.01646284009825869,"score_gpt":0.27298736246521277,"score_spread":0.25652452236695406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603835434","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.9934388,0.0001963957,0.0005003717,0.000110654146,0.00003172363,0.00011661066,0.00012018498,0.000036893878,0.005448321],"genre_scores_gemma":[0.9934918,0.00030195835,0.0015040656,0.00012805942,0.00004423391,0.00019217377,0.00016650742,0.00003429416,0.004136932],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998973,0.00043128777,0.00006473134,0.0001649711,0.00029206392,0.00007386561],"domain_scores_gemma":[0.9704179,0.024535108,0.0024120456,0.0010370172,0.000772408,0.00082540704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017900076,0.00046291546,0.00030617038,0.00045974768,0.00042814823,0.0014229823,0.0008591699,0.0010229469,0.0069609964],"category_scores_gemma":[0.03939637,0.0003075055,0.00016811393,0.00024140468,0.00050603406,0.0011645522,0.0006671056,0.0006138924,0.001315577],"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.04800043,0.027342904,0.17472619,0.0032214848,0.0007179704,0.0014382702,0.04118737,0.0016166518,0.13036327,0.0030431545,0.008253649,0.5600887],"study_design_scores_gemma":[0.0051061683,0.06716174,0.8363888,0.000863726,0.0013251702,0.0018539545,0.02256071,0.010744397,0.034601048,0.004567357,0.014536251,0.00029061805],"about_ca_topic_score_codex":0.0014899217,"about_ca_topic_score_gemma":0.0014909968,"teacher_disagreement_score":0.0069609964,"about_ca_system_score_codex":0.00023166055,"about_ca_system_score_gemma":0.00044045591,"threshold_uncertainty_score":0.02328682},"labels":[],"label_agreement":null},{"id":"W1603884869","doi":"10.1007/978-3-540-77990-2_7","title":"On the Evaluation of Agent-Oriented Software Engineering Methodologies: A Statistical Approach","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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; University of Alberta","funders":"","keywords":"Agent-oriented software engineering; Computer science; Software engineering; Software; Set (abstract data type); Software development; Systems engineering; Artificial intelligence; Engineering","score_opus":0.11464269775468779,"score_gpt":0.31703499288972753,"score_spread":0.20239229513503976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603884869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041550536,0.002848851,0.94254,0.0013471671,0.00012577418,0.00027807843,0.00016794194,0.00036944394,0.010772081],"genre_scores_gemma":[0.69164073,0.0022261892,0.30168027,0.0003168847,0.0004218361,0.0009834147,0.0005051889,0.00030493602,0.0019206294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9294867,0.04985958,0.0022293981,0.002394173,0.015139953,0.00089024624],"domain_scores_gemma":[0.5472104,0.41709244,0.009261895,0.012709389,0.012445385,0.0012804205],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06484749,0.0014056305,0.002515284,0.0069688857,0.001174354,0.0058719814,0.002961522,0.0020658458,0.0025482762],"category_scores_gemma":[0.26657724,0.0007356054,0.0014779634,0.0052587017,0.0045787515,0.007318638,0.0032657944,0.0023956855,0.0003362345],"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.00040397802,0.00037497288,0.015395954,0.00061076565,0.0006235822,0.00013852568,0.0007327022,0.24778584,0.0014120713,0.4988366,0.0036114599,0.2300736],"study_design_scores_gemma":[0.00004579076,0.00031876186,0.003941578,0.00018771704,0.000104265855,0.00007625497,0.00025199863,0.641906,0.0012825463,0.34948534,0.0023558727,0.00004387306],"about_ca_topic_score_codex":0.0024034784,"about_ca_topic_score_gemma":0.0018996982,"teacher_disagreement_score":0.93515253,"about_ca_system_score_codex":0.003122452,"about_ca_system_score_gemma":0.0037090972,"threshold_uncertainty_score":0.3429504},"labels":[],"label_agreement":null},{"id":"W1603944439","doi":"10.1007/11693017_11","title":"Automated Support for Building Behavioral Models of Event-Driven Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Event (particle physics); Dependency (UML); Lift (data mining); Elevator; Witness; Software engineering; Modelica; Software; Artificial intelligence; Human–computer interaction; Programming language; Machine learning","score_opus":0.053033261871030926,"score_gpt":0.32295636817251516,"score_spread":0.26992310630148425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603944439","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.011894742,0.00003959544,0.9700271,0.00009657274,0.000022084007,0.000100226396,0.00041681764,0.016300023,0.001102756],"genre_scores_gemma":[0.41355866,0.00015275249,0.57987225,0.00010692632,0.000045271478,0.00033153399,0.0024168,0.0013525097,0.002163315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981193,0.00050928036,0.00018945146,0.00024629373,0.0007725996,0.0001631494],"domain_scores_gemma":[0.990271,0.00633247,0.0005708318,0.00189581,0.00078223244,0.00014767238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019412523,0.0012408037,0.00080300745,0.0010272479,0.000574716,0.0021471414,0.003273986,0.0011406254,0.0063612885],"category_scores_gemma":[0.0123718865,0.0013208707,0.0015193108,0.00064028736,0.00062001974,0.003252638,0.0017834726,0.0017781394,0.0016100346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006159071,0.00056736375,0.005998213,0.00068135024,0.00029374385,0.00069996127,0.0007404209,0.57390666,0.026762597,0.1024205,0.0116078425,0.27570546],"study_design_scores_gemma":[0.000029476994,0.000018252202,0.00012863167,0.000016125186,0.000029658138,0.00004630841,0.000020396496,0.9714622,0.0059248945,0.01973239,0.0025805605,0.000011178681],"about_ca_topic_score_codex":0.0035401413,"about_ca_topic_score_gemma":0.007308453,"teacher_disagreement_score":0.0063612885,"about_ca_system_score_codex":0.0006659704,"about_ca_system_score_gemma":0.0013338012,"threshold_uncertainty_score":0.021280587},"labels":[],"label_agreement":null},{"id":"W160396381","doi":"10.1007/978-3-642-35632-2_8","title":"Detecting Unread Memory Using Dynamic Binary Translation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary translation; Static analysis; Memory address; Set (abstract data type); Parallel computing; Binary number; C dynamic memory allocation; Benchmark (surveying); Theoretical computer science; Algorithm; Programming language; Memory management; Operating system; Arithmetic; Semiconductor memory; Software","score_opus":0.02727075868484898,"score_gpt":0.27035162757210657,"score_spread":0.24308086888725758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160396381","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.51526767,0.006631027,0.41194472,0.0012752417,0.0014203413,0.00031140915,0.0024470994,0.035397954,0.025304569],"genre_scores_gemma":[0.8338275,0.00073685526,0.14699088,0.0006409133,0.00024557218,0.00019064703,0.0022586985,0.0017681584,0.013340736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989491,0.00011287385,0.00008221323,0.00022624178,0.00042600583,0.00020370318],"domain_scores_gemma":[0.99692243,0.0009296002,0.00035210096,0.00093995815,0.00076070207,0.00009513115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043157744,0.0011398607,0.0010410993,0.0023442896,0.0011053617,0.0017718989,0.0017199412,0.0009663933,0.0074513135],"category_scores_gemma":[0.0036319483,0.00054726435,0.00048228857,0.0025037907,0.000822832,0.002969691,0.001705112,0.0009475166,0.0026878498],"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.002706141,0.00039822163,0.0105637945,0.0006149006,0.00012111715,0.0012649966,0.0005233551,0.011216792,0.11326183,0.014829659,0.025400614,0.81909865],"study_design_scores_gemma":[0.00022760846,0.00095190154,0.0066920216,0.0002336381,0.00033688912,0.002121857,0.0010954058,0.37337044,0.5110758,0.058155112,0.045549802,0.00018946239],"about_ca_topic_score_codex":0.0017070164,"about_ca_topic_score_gemma":0.0034287046,"teacher_disagreement_score":0.0074513135,"about_ca_system_score_codex":0.0006611437,"about_ca_system_score_gemma":0.0011631995,"threshold_uncertainty_score":0.02492714},"labels":[],"label_agreement":null},{"id":"W1603965113","doi":"10.1007/11559573_94","title":"Mapping Local Image Deformations into Depth","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Computer vision; Computer science; Artificial intelligence; Collision; Frame (networking); Mobile robot; Image (mathematics); Motion (physics); Set (abstract data type); Sequence (biology); Robot; Reference frame; Computer graphics (images)","score_opus":0.013289508286131785,"score_gpt":0.26545210582091333,"score_spread":0.25216259753478154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603965113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012872084,0.00034076904,0.9801373,0.000056116565,0.000044191092,0.00003275411,0.00011609162,0.0014789838,0.0049216687],"genre_scores_gemma":[0.29937524,0.0021562665,0.6750436,0.0001204186,0.000058140624,0.000069387206,0.00060085923,0.0010371703,0.021538854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998425,0.000009386314,0.000005197956,0.000058018835,0.000067666006,0.000017065951],"domain_scores_gemma":[0.99988186,0.000027009102,0.000017717088,0.000043511132,0.000020335983,0.00000946172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019507857,0.0007794474,0.0005017158,0.00060240924,0.00016303617,0.00076108973,0.00068105035,0.0004379642,0.008007038],"category_scores_gemma":[0.0006822314,0.0005079875,0.00053975557,0.0009980962,0.0003969958,0.0013348057,0.0011383845,0.0007711709,0.0026176996],"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.00011471693,0.000037589616,0.0004182228,0.00019870535,0.000038884053,0.00006459058,0.00012347325,0.05529356,0.22585848,0.013406663,0.0032987443,0.70114636],"study_design_scores_gemma":[0.00003687196,0.00028545098,0.0034598336,0.00008208309,0.00010009236,0.0012181978,0.00019519425,0.62055373,0.29148492,0.04535476,0.037138194,0.000090729365],"about_ca_topic_score_codex":0.0013357957,"about_ca_topic_score_gemma":0.0017763586,"teacher_disagreement_score":0.008007038,"about_ca_system_score_codex":0.0002654929,"about_ca_system_score_gemma":0.00025235148,"threshold_uncertainty_score":0.026786268},"labels":[],"label_agreement":null},{"id":"W1604092420","doi":"10.1007/3-540-39805-8_11","title":"Two New Secret Key Cryptosystems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"Queen's University","funders":"","keywords":"Encryption; Cryptosystem; Computer science; Computer security; Probabilistic encryption; Key (lock); Set (abstract data type); Multiple encryption; 40-bit encryption; Hybrid cryptosystem; 56-bit encryption; Plaintext-aware encryption; Theoretical computer science; Attribute-based encryption; Deterministic encryption; Public-key cryptography; Programming language","score_opus":0.02530587345808209,"score_gpt":0.26796617619549057,"score_spread":0.2426603027374085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604092420","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.21049468,0.00548566,0.5711484,0.009195175,0.0071242517,0.00043734635,0.0004903398,0.0022068375,0.19341734],"genre_scores_gemma":[0.6301566,0.0024519886,0.19646925,0.0013409029,0.0011250381,0.0003197072,0.00038505724,0.00032825785,0.1674233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995521,0.00006165899,0.00002808288,0.00007367253,0.0001966588,0.00008786549],"domain_scores_gemma":[0.9996138,0.000119016964,0.000040926174,0.00009627145,0.00005903725,0.00007111445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036151338,0.00055777456,0.00040102488,0.00074162066,0.0006095753,0.0015665672,0.00071452867,0.0014815609,0.007301876],"category_scores_gemma":[0.001055567,0.0003149381,0.00038598815,0.0006049486,0.0009813986,0.0034412292,0.0013452389,0.0015627608,0.0021278104],"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.00081566244,0.00021803792,0.00026061138,0.0002520454,0.000029267198,0.00064609863,0.00043539828,0.0024897875,0.113926955,0.7026075,0.0136295315,0.16468914],"study_design_scores_gemma":[0.0007757702,0.00090273895,0.001087708,0.0001177202,0.0001125765,0.006590627,0.00022931004,0.07324434,0.20227043,0.42674494,0.28769702,0.00022690231],"about_ca_topic_score_codex":0.000055338645,"about_ca_topic_score_gemma":0.0000992724,"teacher_disagreement_score":0.007301876,"about_ca_system_score_codex":0.0005583397,"about_ca_system_score_gemma":0.00040100675,"threshold_uncertainty_score":0.024427176},"labels":[],"label_agreement":null},{"id":"W1604105029","doi":"10.1007/11558651_29","title":"The MUSICtable: A Map-Based Ubiquitous System for Social Interaction with a Digital Music Collection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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 British Columbia","funders":"","keywords":"Computer science; Ubiquitous computing; Human–computer interaction; Computer graphics (images); Multimedia","score_opus":0.02000524468220527,"score_gpt":0.2500291211153338,"score_spread":0.23002387643312855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604105029","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.13442652,0.002448679,0.6071685,0.00075332966,0.0008010584,0.0011579804,0.007790619,0.18737653,0.05807673],"genre_scores_gemma":[0.5360144,0.0019524376,0.34081653,0.0011960439,0.00048120713,0.0013718719,0.00982573,0.005524288,0.102817506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974805,0.000034690813,0.000012151866,0.000057672005,0.00011347971,0.000033950957],"domain_scores_gemma":[0.9997155,0.000075699754,0.00001140215,0.000045593166,0.000050664457,0.00010103282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034392046,0.0008842975,0.0009420607,0.00084983086,0.0007183388,0.0012554348,0.001933612,0.0010204639,0.030255748],"category_scores_gemma":[0.000779956,0.0004179761,0.00049102376,0.0009215184,0.0002555733,0.0017455843,0.0024792806,0.0005833102,0.006454044],"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.0031670898,0.0005619618,0.0037130832,0.0010447834,0.00033722818,0.0013598459,0.003073757,0.0026165198,0.14497997,0.0040766476,0.19201118,0.643058],"study_design_scores_gemma":[0.0013263759,0.002274373,0.0318732,0.00030772923,0.0014032733,0.004579292,0.003374352,0.17163308,0.11730202,0.010937051,0.6542532,0.00073603087],"about_ca_topic_score_codex":0.004501836,"about_ca_topic_score_gemma":0.008704786,"teacher_disagreement_score":0.030255748,"about_ca_system_score_codex":0.0003099473,"about_ca_system_score_gemma":0.00040466624,"threshold_uncertainty_score":0.10121554},"labels":[],"label_agreement":null},{"id":"W1604172527","doi":"10.1007/3-540-45129-3_3","title":"On Learning the Shape of Complex Actions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing and 3D Reconstruction","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 Alberta","funders":"","keywords":"Computer science; Curvature; Invariant (physics); Artificial intelligence; Dynamical systems theory; Bayesian network; Bayesian probability; Machine learning; Theoretical computer science; Algorithm; Mathematics; Geometry","score_opus":0.030882264565303363,"score_gpt":0.2646452744809921,"score_spread":0.23376300991568877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604172527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032400355,0.0007942994,0.9620099,0.00037827305,0.000058919642,0.000037385016,0.00014288058,0.00076254556,0.0034154137],"genre_scores_gemma":[0.5009093,0.0022137382,0.4806755,0.00048458454,0.00016108197,0.00014757375,0.0012028668,0.0005302094,0.0136751095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995976,0.000096034775,0.000024544406,0.0001355734,0.00010761263,0.000038671078],"domain_scores_gemma":[0.9970053,0.0020258895,0.00016463753,0.00043306893,0.00024237773,0.00012884855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010143124,0.0011759105,0.001650923,0.0007305315,0.0004238791,0.0013436492,0.0019707708,0.0016974839,0.0047829105],"category_scores_gemma":[0.006501093,0.0008864466,0.0008617407,0.0013285492,0.0018754372,0.0033635756,0.0020998348,0.001956555,0.00078382855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024959169,0.00007066161,0.0023332592,0.0001525582,0.00005711611,0.00006427202,0.00024259316,0.3458668,0.0047848173,0.049570076,0.005009954,0.5915983],"study_design_scores_gemma":[0.000017104981,0.00005519413,0.0005133213,0.00002430612,0.0000090564035,0.000044987944,0.000044121585,0.9189155,0.0013036416,0.07775782,0.0013035676,0.000011390583],"about_ca_topic_score_codex":0.007941942,"about_ca_topic_score_gemma":0.008759525,"teacher_disagreement_score":0.007941942,"about_ca_system_score_codex":0.00080550276,"about_ca_system_score_gemma":0.0006031564,"threshold_uncertainty_score":0.01600045},"labels":[],"label_agreement":null},{"id":"W1604178018","doi":"10.1007/3-540-45508-6_5","title":"Is It Worth Involving Several Cooperating Agents for Multimedia User’s Admission in Cellular Networks?","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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 Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Mobile agent; Distributed computing; Process (computing); Computer network; Order (exchange); Cellular network; Resource (disambiguation); Multimedia; Operating system","score_opus":0.055948635524869346,"score_gpt":0.3119010046888973,"score_spread":0.25595236916402797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604178018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34313208,0.004711328,0.58090824,0.015796764,0.0016822004,0.0002228786,0.00003390282,0.0009832786,0.052529328],"genre_scores_gemma":[0.9414122,0.00067026814,0.050100103,0.00053379196,0.00053154817,0.000057029756,0.000018112709,0.00004602845,0.006630983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982332,0.0007240064,0.000073131116,0.00020477235,0.00038126775,0.00038355184],"domain_scores_gemma":[0.99413246,0.003257072,0.00042274361,0.0009035679,0.00054558314,0.00073859567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027245576,0.00064959604,0.0010027684,0.00026495784,0.0018166128,0.0022759724,0.0025807323,0.003181886,0.0057039596],"category_scores_gemma":[0.010531044,0.00044507903,0.00058951153,0.00044093566,0.0016582791,0.0070366203,0.0017665941,0.0016680841,0.00088441547],"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.0019871965,0.0009215311,0.015097003,0.0004932356,0.00038381736,0.0019264739,0.0017240965,0.10303275,0.021804182,0.25280637,0.010956932,0.5888664],"study_design_scores_gemma":[0.0002797555,0.0008412578,0.0054422966,0.00018090851,0.00049682683,0.0027762726,0.003966269,0.6252825,0.011601936,0.31688395,0.032115836,0.00013212369],"about_ca_topic_score_codex":0.0016182916,"about_ca_topic_score_gemma":0.002473697,"teacher_disagreement_score":0.0057039596,"about_ca_system_score_codex":0.00067384524,"about_ca_system_score_gemma":0.0010047422,"threshold_uncertainty_score":0.019081652},"labels":[],"label_agreement":null},{"id":"W1604197828","doi":"10.1007/11866763_18","title":"Automated Analysis of Multi Site MRI Phantom Data for the NIHPD Project","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Imaging phantom; Scanner; Nuclear medicine; Mean difference; Physics; Materials science; Mathematics; Medicine; Optics; Statistics","score_opus":0.04284762514580249,"score_gpt":0.3847862409746628,"score_spread":0.3419386158288603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604197828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2085928,0.0012163452,0.7360224,0.00055800885,0.000168096,0.00042689792,0.015031122,0.0356492,0.0023350765],"genre_scores_gemma":[0.2875595,0.00039834908,0.6801504,0.000115155315,0.000056087225,0.000331647,0.025131265,0.003968023,0.0022896882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903536,0.00028204126,0.00007922125,0.00015603674,0.0003618873,0.00008548298],"domain_scores_gemma":[0.99730504,0.0010044795,0.0001910474,0.00051652454,0.0008837148,0.00009918964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019700048,0.0012847944,0.00092896615,0.0034024427,0.00053987495,0.0010715119,0.0010262135,0.00091245206,0.0044073234],"category_scores_gemma":[0.0041267895,0.00067842257,0.0008312616,0.0021890034,0.00031677922,0.0007366872,0.0008523307,0.00055727374,0.001703509],"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.0022161854,0.0005988956,0.009493489,0.0007510652,0.00036161608,0.0010399304,0.00038601525,0.04501547,0.29113963,0.0019891285,0.042328242,0.6046804],"study_design_scores_gemma":[0.0003797825,0.00051537226,0.043211818,0.00007386892,0.00026341953,0.002886476,0.00032242163,0.6971774,0.2165131,0.0050474587,0.033395663,0.00021315379],"about_ca_topic_score_codex":0.0051055676,"about_ca_topic_score_gemma":0.010670703,"teacher_disagreement_score":0.0051055676,"about_ca_system_score_codex":0.0004166261,"about_ca_system_score_gemma":0.0011636596,"threshold_uncertainty_score":0.014743924},"labels":[],"label_agreement":null},{"id":"W1604243478","doi":"10.1007/978-3-540-24837-8_5","title":"A Vision-Based Gestural Guidance Interface for Mobile Robotic Platforms","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Gesture","score_opus":0.018607334491236808,"score_gpt":0.27550978532548265,"score_spread":0.25690245083424584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604243478","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.019474696,0.0007202865,0.959691,0.0001395402,0.00025095997,0.0001229965,0.00013558251,0.012507982,0.0069570774],"genre_scores_gemma":[0.25098082,0.0009513396,0.691734,0.0005603715,0.00014827368,0.0003848737,0.0006458829,0.00091613457,0.053678207],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981874,0.000014591338,0.000009016509,0.000035568533,0.000106901825,0.000015156684],"domain_scores_gemma":[0.9998852,0.000029214372,0.000009341466,0.000013109522,0.000045108634,0.00001816025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015144184,0.00056853145,0.00046971,0.00031619446,0.00025322975,0.0005656244,0.0010867101,0.0012412694,0.010300893],"category_scores_gemma":[0.00047781537,0.00032831528,0.00031662433,0.00020305955,0.00020896757,0.0006556938,0.0007427067,0.0005943377,0.0031761006],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037204367,0.00011944035,0.00013499211,0.00019748374,0.000028292323,0.0002420533,0.00015528729,0.0045416667,0.5095369,0.0020593237,0.011611823,0.47100064],"study_design_scores_gemma":[0.00029455684,0.001699461,0.0049476055,0.00017410581,0.00016162649,0.0032138973,0.00014896248,0.52496874,0.3407634,0.0061388956,0.11731365,0.000175066],"about_ca_topic_score_codex":0.0016219367,"about_ca_topic_score_gemma":0.0019264347,"teacher_disagreement_score":0.010300893,"about_ca_system_score_codex":0.0001628713,"about_ca_system_score_gemma":0.000260927,"threshold_uncertainty_score":0.03445995},"labels":[],"label_agreement":null},{"id":"W1604255716","doi":"10.1007/978-3-540-85990-1_105","title":"Localization of Pelvic Anatomical Coordinate System Using US/Atlas Registration for Total Hip Replacement","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Orthopaedic implants and arthroplasty","field":"Medicine","cited_by":33,"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":"National Science Foundation","keywords":"Coordinate system; Computer science; Fiducial marker; Atlas (anatomy); Pelvis; Fluoroscopy; Cadaver; Computer vision; Artificial intelligence; Anatomy; Radiology; Medicine","score_opus":0.022185740603178634,"score_gpt":0.2747795941045329,"score_spread":0.25259385350135427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604255716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13696732,0.00203404,0.8489264,0.00028305556,0.00016379547,0.00018467817,0.0007790159,0.004962489,0.005699101],"genre_scores_gemma":[0.66137433,0.0012690697,0.33215913,0.0000758009,0.000058068756,0.00013269778,0.00074764056,0.0004617907,0.0037214297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996075,0.00012247117,0.000036320263,0.00006767649,0.00012259388,0.000043396805],"domain_scores_gemma":[0.9995078,0.0001244262,0.00006903765,0.0001047457,0.00016797593,0.000026041556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078039797,0.0004994336,0.0005199547,0.0015936345,0.00033848616,0.001008492,0.00059258373,0.0003474528,0.0049010273],"category_scores_gemma":[0.0026085405,0.00049903936,0.0005565152,0.0015228209,0.0002587124,0.00056450925,0.0008069586,0.00046983318,0.0017360622],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001484316,0.000088147644,0.010770961,0.00040110273,0.00009006657,0.00049653254,0.0004443022,0.013956983,0.089404464,0.0027717068,0.008208538,0.87188286],"study_design_scores_gemma":[0.00039502984,0.0015086832,0.09371856,0.00024651768,0.0009361598,0.0108011225,0.0008619823,0.50988233,0.3246542,0.0066810856,0.04995883,0.0003554911],"about_ca_topic_score_codex":0.0049095135,"about_ca_topic_score_gemma":0.004655594,"teacher_disagreement_score":0.0049095135,"about_ca_system_score_codex":0.0003200727,"about_ca_system_score_gemma":0.0015468193,"threshold_uncertainty_score":0.016395569},"labels":[],"label_agreement":null},{"id":"W1604272107","doi":"10.1007/3-540-45319-9_28","title":"Implementing a Multi-valued Symbolic Model Checker","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":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":"Model checking; Computation tree logic; Computer science; Binary decision diagram; Symbolic trajectory evaluation; Temporal logic; Theoretical computer science; Linear temporal logic; Extension (predicate logic); Semantics (computer science); Truth value; Algorithm; Programming language","score_opus":0.05691785324811449,"score_gpt":0.32355564029692313,"score_spread":0.26663778704880864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604272107","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.036684543,0.000106893654,0.9365343,0.00026012282,0.00016401203,0.00010774631,0.00018928073,0.018401984,0.00755119],"genre_scores_gemma":[0.5678627,0.00014262917,0.42212418,0.00027846982,0.000037416343,0.00011998377,0.0005222789,0.0013176182,0.007594737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801135,0.00049492135,0.00014072441,0.0003234963,0.0007556225,0.00027392397],"domain_scores_gemma":[0.99612135,0.0022066492,0.0001939081,0.0009172118,0.0004578335,0.00010299668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018030145,0.00080206443,0.0009508667,0.0010983256,0.00065972185,0.0031850534,0.002845478,0.0014780648,0.0069938176],"category_scores_gemma":[0.006505333,0.00082772225,0.0008997546,0.00078381365,0.0012157816,0.0040097255,0.0024995308,0.0015200018,0.0014384894],"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.0017451744,0.0008313669,0.0055107703,0.0008677934,0.00034020765,0.001557221,0.0008864287,0.24620514,0.09628108,0.19888917,0.015326682,0.43155897],"study_design_scores_gemma":[0.00017984127,0.00014288086,0.00027330432,0.0000692714,0.00013354959,0.00018925968,0.000070393544,0.8657433,0.08081751,0.043944996,0.00838903,0.000046740945],"about_ca_topic_score_codex":0.0027304823,"about_ca_topic_score_gemma":0.004671455,"teacher_disagreement_score":0.0069938176,"about_ca_system_score_codex":0.000914401,"about_ca_system_score_gemma":0.0025047306,"threshold_uncertainty_score":0.02339667},"labels":[],"label_agreement":null},{"id":"W1604317340","doi":"10.1007/11915034_117","title":"Cultural Interface Design: Global Colors Study","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color perception and design","field":"Psychology","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":"National Research Council Canada","funders":"","keywords":"Palette (painting); Computer science; World Wide Web; Interface (matter); User interface; Crawling; Web design; Web page; Multimedia; Human–computer interaction","score_opus":0.05389473187320074,"score_gpt":0.349188979071097,"score_spread":0.29529424719789626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604317340","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.6679065,0.0046427534,0.025358545,0.0007862577,0.000107240674,0.000115545714,0.00005317731,0.00009719575,0.30093277],"genre_scores_gemma":[0.9786945,0.0013233074,0.005042908,0.00019236222,0.00001648865,0.000046155266,0.000026881798,0.000080453014,0.014577053],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992532,0.0004422051,0.000016708113,0.000100542435,0.00011425603,0.00007304753],"domain_scores_gemma":[0.9972851,0.0017800156,0.00012379412,0.0003258012,0.00030764623,0.00017757277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013876065,0.00069481024,0.000310195,0.0008634235,0.00089806726,0.00386068,0.0005907155,0.00063527026,0.014115359],"category_scores_gemma":[0.0062304437,0.00025484286,0.00028125723,0.001358489,0.0025988445,0.003288871,0.0015483518,0.0013128314,0.0008051616],"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.0008121482,0.00081162207,0.031263646,0.0014244172,0.00010659945,0.0009455486,0.16044126,0.0021326563,0.01918624,0.24757728,0.013539857,0.52175874],"study_design_scores_gemma":[0.00030929837,0.0029116406,0.1744566,0.0021877575,0.00047921174,0.0038109312,0.3503293,0.014532804,0.03009606,0.16853425,0.25217348,0.00017869133],"about_ca_topic_score_codex":0.0019540593,"about_ca_topic_score_gemma":0.0022132264,"teacher_disagreement_score":0.014115359,"about_ca_system_score_codex":0.00079663657,"about_ca_system_score_gemma":0.0005337201,"threshold_uncertainty_score":0.047220588},"labels":[],"label_agreement":null},{"id":"W1604352127","doi":"10.1007/978-3-642-02868-7_3","title":"Design Challenges for Mobile Assistive Technologies Applied to People with Cognitive Impairments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Sherbrooke","funders":"","keywords":"Cognitive disabilities; Computer science; Assistive technology; Mobile device; Cognition; Human–computer interaction; Context (archaeology); Independence (probability theory); Multimedia; Mobile computing; Software; Mobile technology; World Wide Web; Telecommunications; Psychology","score_opus":0.03202064616972515,"score_gpt":0.260306896436448,"score_spread":0.22828625026672283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604352127","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06633833,0.037218742,0.8050667,0.016278736,0.0011938098,0.0004035076,0.0002199892,0.0010319044,0.07224837],"genre_scores_gemma":[0.48408008,0.021499705,0.452384,0.0024067126,0.0007171921,0.0008536167,0.00025026855,0.00034252703,0.03746588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984981,0.00044091666,0.000119687036,0.00013818657,0.0006566592,0.0001464291],"domain_scores_gemma":[0.99743843,0.0014477494,0.00013514502,0.00014607477,0.0006843623,0.00014814889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582649,0.00068257377,0.00065464637,0.0004911281,0.0008215573,0.0035179649,0.0017532504,0.0019023925,0.0051091416],"category_scores_gemma":[0.0052372194,0.00062725326,0.0004381709,0.00035401405,0.0008552733,0.0026470302,0.0014610799,0.0013814798,0.0017073423],"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.000130323,0.00018797195,0.0026769466,0.0024465914,0.000118719414,0.0020411606,0.004711482,0.029665267,0.040561527,0.17255618,0.033756986,0.7111468],"study_design_scores_gemma":[0.000099480625,0.0009291642,0.0030395987,0.0017315942,0.00035975847,0.006849189,0.009808353,0.16369697,0.019759526,0.21042153,0.58312684,0.00017798724],"about_ca_topic_score_codex":0.0010952939,"about_ca_topic_score_gemma":0.002642648,"teacher_disagreement_score":0.0051091416,"about_ca_system_score_codex":0.0006769703,"about_ca_system_score_gemma":0.00090480223,"threshold_uncertainty_score":0.017091751},"labels":[],"label_agreement":null},{"id":"W1604396124","doi":"10.1007/978-3-540-30125-7_92","title":"Robust Shape Retrieval Using Maximum Likelihood Theory","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Security token; Metric (unit); Computer science; Measure (data warehouse); Pattern recognition (psychology); Similarity measure; Histogram; Similarity (geometry); Invariant (physics); Heuristics; Matching (statistics); Artificial intelligence; Mathematics; Algorithm; Mathematical optimization; Statistics; Data mining; Image (mathematics)","score_opus":0.031619990818699796,"score_gpt":0.2533416677264038,"score_spread":0.22172167690770403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604396124","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.0011609915,0.0003490786,0.99689037,0.000072363015,0.00002036127,0.000016021528,0.000047603506,0.0006053472,0.0008378745],"genre_scores_gemma":[0.08674057,0.0011157078,0.9006807,0.00029982912,0.00017880017,0.00013791515,0.000965736,0.0010127459,0.008867882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889356,0.0002287602,0.00005129725,0.0001697691,0.0005894126,0.00006715834],"domain_scores_gemma":[0.9987446,0.00047580092,0.00012566955,0.00039371956,0.00022697318,0.00003314615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010851186,0.0009299598,0.0021098827,0.0019788728,0.00049157895,0.0019973733,0.0018478286,0.0018121491,0.00590467],"category_scores_gemma":[0.005002453,0.0010264604,0.001643915,0.0023100665,0.0011182101,0.0033644936,0.0024811635,0.0014090945,0.006067182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000283484,0.00007388355,0.0002793747,0.00034473016,0.00016692159,0.00018698326,0.00009028856,0.1400867,0.07219409,0.0369162,0.009634307,0.73974305],"study_design_scores_gemma":[0.00003623617,0.00005834687,0.00040411283,0.00003566118,0.00006297188,0.00044132548,0.000029434945,0.90688515,0.02369351,0.061818507,0.006476871,0.00005780785],"about_ca_topic_score_codex":0.00077452254,"about_ca_topic_score_gemma":0.0009948398,"teacher_disagreement_score":0.00590467,"about_ca_system_score_codex":0.00056561385,"about_ca_system_score_gemma":0.000530575,"threshold_uncertainty_score":0.019753098},"labels":[],"label_agreement":null},{"id":"W1604437072","doi":"10.1007/3-540-45111-0_19","title":"Intensional High Performance Computing","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Université Laval","funders":"","keywords":"Computer science; Metacomputing; Exploit; Distributed computing; Adaptation (eye); Execution model; Supercomputer; Context (archaeology); Programming paradigm; Programming language; Parallel computing","score_opus":0.013861955521975632,"score_gpt":0.22361253232105127,"score_spread":0.20975057679907563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604437072","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00863854,0.011026535,0.20883468,0.004328435,0.0034970748,0.00006542539,0.00032921223,0.0025139658,0.7607661],"genre_scores_gemma":[0.33530164,0.0124702295,0.16307014,0.0020340856,0.004192582,0.00023815343,0.0012117878,0.0012353966,0.480246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961555,0.000062197825,0.000012960106,0.00006737514,0.00019047497,0.000051469335],"domain_scores_gemma":[0.99950767,0.00010755729,0.00002121173,0.00021747507,0.00009442826,0.000051639192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057633896,0.00062356296,0.00046635768,0.0006409073,0.0008192983,0.0025835976,0.0011000925,0.00054986397,0.029575732],"category_scores_gemma":[0.0013078457,0.00034675095,0.0002494522,0.0009535958,0.0014659914,0.0033073951,0.0020391527,0.002621906,0.0052309306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042449108,0.000020498057,0.00009281523,0.000099508616,0.000009139095,0.000029650877,0.00006602053,0.0010601014,0.002159188,0.87838507,0.044457123,0.07357845],"study_design_scores_gemma":[0.00001777611,0.00002349447,0.000369711,0.00007378047,0.000013652493,0.0001623549,0.000032737982,0.014245344,0.0031786894,0.555826,0.42603958,0.000016845015],"about_ca_topic_score_codex":0.0002802243,"about_ca_topic_score_gemma":0.00046605236,"teacher_disagreement_score":0.029575732,"about_ca_system_score_codex":0.0007742587,"about_ca_system_score_gemma":0.00042281955,"threshold_uncertainty_score":0.09894067},"labels":[],"label_agreement":null},{"id":"W1604477342","doi":"10.1007/978-3-540-30222-3_53","title":"Quantum, a French/English Cross-Language Question Answering System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Question answering; Natural language processing; Set (abstract data type); Artificial intelligence; Machine translation; Translation system; Information retrieval; Programming language","score_opus":0.00858013613596664,"score_gpt":0.26370821633179237,"score_spread":0.2551280801958257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604477342","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.10550315,0.0030841022,0.58151776,0.003753522,0.0008106536,0.0007717443,0.020463178,0.22816758,0.05592821],"genre_scores_gemma":[0.47114196,0.0009990414,0.442595,0.002144912,0.00032689446,0.00054179534,0.030634305,0.0069537484,0.044662483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991972,0.00021649673,0.00006594515,0.00022538478,0.00021053298,0.00008443027],"domain_scores_gemma":[0.99862504,0.00059249485,0.000051781004,0.00021146897,0.00041250535,0.00010668879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927171,0.0007526094,0.0011651742,0.0015904459,0.0016808866,0.001741757,0.0014866472,0.001207394,0.021673238],"category_scores_gemma":[0.0044522816,0.00055068225,0.0006698087,0.0014006991,0.00078824104,0.0045824847,0.002223861,0.0008425942,0.0070125926],"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.0019189598,0.00062882475,0.0034256608,0.0013382421,0.00020272062,0.00068977056,0.0015144541,0.0061104023,0.058005184,0.07173902,0.32167783,0.53274894],"study_design_scores_gemma":[0.0010454053,0.00089221564,0.011589993,0.00019765054,0.00049820775,0.0011168448,0.0021140093,0.31881437,0.074897535,0.12799309,0.46050423,0.00033643458],"about_ca_topic_score_codex":0.022832144,"about_ca_topic_score_gemma":0.021725804,"teacher_disagreement_score":0.022832144,"about_ca_system_score_codex":0.0012211173,"about_ca_system_score_gemma":0.0018240467,"threshold_uncertainty_score":0.07250416},"labels":[],"label_agreement":null},{"id":"W1604604413","doi":"10.1007/11687238_16","title":"Authorization-Transparent Access Control for XML Under the Non-Truman Model","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XPath; Access control; XML; XML Schema (W3C); Authorization; Role-based access control; Transparency (behavior); Parameterized complexity; Database; Computer security; Programming language; XML Signature; XML database; Document Structure Description; World Wide Web; Algorithm","score_opus":0.030968736806513852,"score_gpt":0.28291570672809674,"score_spread":0.2519469699215829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604604413","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.016894279,0.00067657256,0.94224274,0.0019112228,0.000337092,0.00014090182,0.00016994172,0.0020617833,0.035565417],"genre_scores_gemma":[0.7215934,0.0012604635,0.23864526,0.0010358613,0.0006694226,0.0004653363,0.0005339037,0.0006505292,0.035145853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912315,0.0025054307,0.00094509614,0.0009613181,0.0033234658,0.0010331941],"domain_scores_gemma":[0.9930032,0.0027179108,0.0005453642,0.002704512,0.0007863193,0.00024270813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005323848,0.000534366,0.0010240503,0.0010173765,0.0019552137,0.0062426375,0.002401869,0.002499029,0.005096633],"category_scores_gemma":[0.007855391,0.00073346903,0.0017072205,0.0015007149,0.0054414063,0.014399562,0.003993192,0.00550865,0.0016075561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009113784,0.00003313722,0.00011780185,0.000058224454,0.000015916921,0.000115735194,0.00029474558,0.0024541505,0.0020340255,0.976029,0.0024739823,0.01628218],"study_design_scores_gemma":[0.000055138757,0.0000484698,0.000113649316,0.00004309283,0.000033439137,0.0002920885,0.00009285284,0.047722753,0.00524119,0.9312236,0.015080902,0.000052864394],"about_ca_topic_score_codex":0.0027240005,"about_ca_topic_score_gemma":0.0020736982,"teacher_disagreement_score":0.0062426375,"about_ca_system_score_codex":0.0019299163,"about_ca_system_score_gemma":0.0027156505,"threshold_uncertainty_score":0.028155506},"labels":[],"label_agreement":null},{"id":"W1604628950","doi":"10.1007/11589440_17","title":"Single-Vertex Origami and Spherical Expansive Motions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Vertex (graph theory); Euclidean geometry; Mathematical proof; Conical surface; Simple (philosophy); Computer science; Euclidean space; Mathematics; Topology (electrical circuits); Combinatorics; Geometry; Graph","score_opus":0.012462611043038623,"score_gpt":0.21350869997141542,"score_spread":0.2010460889283768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604628950","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.1643069,0.023736442,0.3928386,0.001425357,0.0025594914,0.00007196439,0.00019561706,0.00045061402,0.41441512],"genre_scores_gemma":[0.8261061,0.008899624,0.0422866,0.00024934512,0.00049518823,0.00006315957,0.00017403826,0.00015445676,0.12157161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991,0.000010211351,0.0000042266,0.000022839702,0.000038012568,0.000014689671],"domain_scores_gemma":[0.9999213,0.000030680905,0.000009358833,0.000016020753,0.00001301625,0.000009547016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009887052,0.0006447196,0.0005178733,0.00047011828,0.0004648726,0.0011888762,0.0005923708,0.0009875825,0.0064670644],"category_scores_gemma":[0.00050683564,0.00032772488,0.0004085612,0.00042875105,0.00096076477,0.0015736695,0.000739869,0.0010795858,0.0010418553],"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.000035938087,0.000023087112,0.000049686492,0.000108721484,0.0000068843633,0.00013792778,0.00021295444,0.011644063,0.018129677,0.899902,0.0023406176,0.06740852],"study_design_scores_gemma":[0.000010186863,0.00005481151,0.00023936186,0.000038585647,0.000005749658,0.00032611552,0.00010117739,0.039765287,0.0060642757,0.9333264,0.020045888,0.000022172817],"about_ca_topic_score_codex":0.00023874854,"about_ca_topic_score_gemma":0.00034873886,"teacher_disagreement_score":0.0064670644,"about_ca_system_score_codex":0.0003027649,"about_ca_system_score_gemma":0.00013220399,"threshold_uncertainty_score":0.02163452},"labels":[],"label_agreement":null},{"id":"W1604695990","doi":"10.1007/3-540-45624-4_12","title":"On Senary Simplex Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Simplex; Weight distribution; Orthogonality; Computer science; Block code; Linear code; Hierarchy; Binary number; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Arithmetic; Decoding methods; Physics; Geometry","score_opus":0.01759614767029209,"score_gpt":0.24465608818497314,"score_spread":0.22705994051468106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604695990","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.065078974,0.0033377893,0.22842902,0.0017230068,0.0013900012,0.00010854984,0.00049177866,0.0004099614,0.6990309],"genre_scores_gemma":[0.5702847,0.0069122016,0.08106422,0.0013982371,0.0009718114,0.00034716728,0.000839587,0.0008580795,0.33732402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995333,0.00012624393,0.000022273649,0.000052090774,0.00019600184,0.00007014635],"domain_scores_gemma":[0.9994906,0.00019382557,0.000038169066,0.000098086355,0.00012458091,0.00005465631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036554906,0.0008157709,0.00072484306,0.001597437,0.0015534001,0.0019794605,0.0006556792,0.0007801095,0.013413949],"category_scores_gemma":[0.0018386968,0.00040083416,0.0005912757,0.002398963,0.0019364064,0.002379828,0.0025051797,0.002938015,0.004276584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014316658,0.0000046831956,0.000034786543,0.000018860179,0.0000023122184,0.00001774178,0.0000630391,0.001052929,0.0002623785,0.9821655,0.0025346216,0.013828723],"study_design_scores_gemma":[0.0000043352493,0.000007635451,0.000041384777,0.000026530599,0.0000029056785,0.000065655215,0.00003455401,0.0032048314,0.00044030117,0.9794195,0.016743997,0.000008345779],"about_ca_topic_score_codex":0.0012758529,"about_ca_topic_score_gemma":0.0013245664,"teacher_disagreement_score":0.013413949,"about_ca_system_score_codex":0.0011515839,"about_ca_system_score_gemma":0.0008074486,"threshold_uncertainty_score":0.044874072},"labels":[],"label_agreement":null},{"id":"W1604763789","doi":"10.1007/978-3-540-24581-0_56","title":"Towards Automated Creation of Image Interpretation Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Alberta","funders":"","keywords":"Computer science; Software portability; Artificial intelligence; Robustness (evolution); Domain (mathematical analysis); Task (project management); Process (computing); Software engineering; Systems engineering; Programming language; Engineering","score_opus":0.011157792632082442,"score_gpt":0.2512012808586639,"score_spread":0.24004348822658145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604763789","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.0039530545,0.00020372786,0.98266876,0.00008898455,0.000029594252,0.00010505239,0.00012631476,0.0107400725,0.0020843863],"genre_scores_gemma":[0.04082382,0.00020388115,0.955131,0.00006731935,0.000016062713,0.000086418746,0.00053298706,0.0010815058,0.00205707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987099,0.00030420913,0.00009317667,0.000306681,0.000470092,0.00011588418],"domain_scores_gemma":[0.9977696,0.00082703476,0.0001139182,0.00075833034,0.0004573459,0.00007380181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026826,0.0010791817,0.0013246761,0.0014968365,0.00081126735,0.0040894016,0.0030377773,0.0018003098,0.010526557],"category_scores_gemma":[0.004734353,0.0015045732,0.0017560992,0.0011504496,0.0015369648,0.0030922338,0.0036164238,0.002348871,0.004364485],"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.0002685982,0.00017360953,0.0009790028,0.0005646124,0.00010770853,0.0004672207,0.0009838088,0.04047441,0.044219818,0.05510763,0.017417537,0.839236],"study_design_scores_gemma":[0.000106774976,0.00009805859,0.0007259369,0.00015933583,0.00010184469,0.00047631626,0.00040710747,0.74183327,0.084363624,0.0943874,0.07728017,0.00006025116],"about_ca_topic_score_codex":0.002237639,"about_ca_topic_score_gemma":0.0039339624,"teacher_disagreement_score":0.010526557,"about_ca_system_score_codex":0.0008298102,"about_ca_system_score_gemma":0.001289464,"threshold_uncertainty_score":0.0352149},"labels":[],"label_agreement":null},{"id":"W1604784155","doi":"10.1007/978-3-540-27775-0_28","title":"Adding Domain Dependent Knowledge into Answer Set Programs for Planning","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Domain knowledge; Benchmark (surveying); Coding (social sciences); Set (abstract data type); Scheme (mathematics); Class (philosophy); Answer set programming; Artificial intelligence; Theoretical computer science; Programming language; Mathematics","score_opus":0.028130201251539526,"score_gpt":0.28244283631865824,"score_spread":0.2543126350671187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604784155","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.0063483054,0.0001635859,0.9844248,0.0003254886,0.000043298758,0.00009664333,0.00015058472,0.0026422255,0.0058050905],"genre_scores_gemma":[0.1479455,0.0003209492,0.8443224,0.00028412338,0.00006413997,0.00024559943,0.00074636133,0.0006358092,0.005435153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852955,0.00044428775,0.00012486058,0.0002211197,0.00055878103,0.0001214388],"domain_scores_gemma":[0.99661475,0.0025981886,0.00009879341,0.00042557006,0.00019928784,0.00006339926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021222045,0.00078669714,0.00063539227,0.0010220595,0.00069677725,0.0016261627,0.0027496323,0.0014996814,0.006431048],"category_scores_gemma":[0.007229471,0.0010690353,0.0016259406,0.0011139474,0.0018499531,0.0047291433,0.0034317672,0.0041027553,0.001365727],"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.00035524013,0.00034437983,0.000931902,0.00077865476,0.00015827722,0.00033796733,0.0015489137,0.15006644,0.010375047,0.34121186,0.012034464,0.48185688],"study_design_scores_gemma":[0.00006880211,0.00009248205,0.0002247465,0.00014444355,0.00015274216,0.00009968748,0.00011847307,0.4268799,0.015690595,0.53403574,0.02244774,0.00004462375],"about_ca_topic_score_codex":0.0021534704,"about_ca_topic_score_gemma":0.0051384433,"teacher_disagreement_score":0.006431048,"about_ca_system_score_codex":0.0009195681,"about_ca_system_score_gemma":0.0007483927,"threshold_uncertainty_score":0.021513999},"labels":[],"label_agreement":null},{"id":"W1604814605","doi":"10.1007/978-3-642-02777-2_25","title":"Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"York University","funders":"","keywords":"Computer science; Satisfiability; Local search (optimization); Truth value; Selection (genetic algorithm); Beam search; Process (computing); Variable (mathematics); Search algorithm; Value (mathematics); Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","score_opus":0.010489421663472087,"score_gpt":0.2510907163993639,"score_spread":0.24060129473589184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604814605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026047563,0.00041852385,0.9711601,0.00016279276,0.000052231804,0.00006511434,0.000040221552,0.0005587168,0.0014947333],"genre_scores_gemma":[0.4543568,0.0004592098,0.5374663,0.00029375093,0.00017494035,0.0004306301,0.00035019833,0.00049832306,0.0059698364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978643,0.0010221141,0.00010413517,0.0003061935,0.0004949193,0.00020836442],"domain_scores_gemma":[0.99332434,0.0052710916,0.0002452487,0.00040132354,0.0005722458,0.0001857215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034118043,0.0007582765,0.0019380235,0.0010986757,0.0007949148,0.001051936,0.0023723543,0.00143945,0.004544338],"category_scores_gemma":[0.009398488,0.0007052251,0.0011772667,0.0016843941,0.0011978801,0.0020529435,0.0023253418,0.002054635,0.00063809945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004958023,0.00025836044,0.0013966761,0.00025682716,0.00011628931,0.0001336594,0.00021045671,0.76657736,0.0050152666,0.048132386,0.0045935893,0.17281327],"study_design_scores_gemma":[0.000016983086,0.00003002572,0.000065464475,0.00000568167,0.000011016399,0.000010125397,0.0000062162694,0.99311525,0.00043668505,0.0061083185,0.0001907691,0.0000034862928],"about_ca_topic_score_codex":0.002817209,"about_ca_topic_score_gemma":0.0035258855,"teacher_disagreement_score":0.004544338,"about_ca_system_score_codex":0.0010119843,"about_ca_system_score_gemma":0.0014423892,"threshold_uncertainty_score":0.018043518},"labels":[],"label_agreement":null},{"id":"W1604896632","doi":"10.1007/3-540-44886-1_15","title":"Discovering Temporal/Causal Rules: A Comparison of Methods","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Preprocessor; Data mining; Artificial intelligence; Domain (mathematical analysis); Tetrad; Data pre-processing; Machine learning; Mathematics","score_opus":0.04298376201132736,"score_gpt":0.3364625450889709,"score_spread":0.2934787830776435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604896632","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.024914676,0.036331005,0.9193707,0.001360982,0.00036169722,0.0009148038,0.0013359928,0.005547357,0.009862813],"genre_scores_gemma":[0.07977392,0.019909728,0.89338726,0.00043997628,0.0002541191,0.00061917567,0.0018282718,0.0009963944,0.002791148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98412955,0.0055524725,0.0019284945,0.0021204785,0.005834968,0.00043404225],"domain_scores_gemma":[0.88884926,0.0985634,0.0016164707,0.0047367862,0.0051930877,0.0010410064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022482986,0.0025681516,0.004532789,0.011431787,0.0011854074,0.0074298987,0.006343242,0.0030528668,0.006689967],"category_scores_gemma":[0.05410697,0.001679263,0.003117764,0.007337511,0.0015558923,0.008702614,0.003159402,0.003402045,0.002491905],"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.0015463788,0.00040846074,0.0060791676,0.0026387882,0.0013020363,0.00007642609,0.0006456162,0.011811103,0.0011378189,0.011375607,0.004051221,0.95892733],"study_design_scores_gemma":[0.0016180562,0.0015734184,0.021025253,0.002561628,0.004594373,0.0019995149,0.0029287734,0.7453388,0.011243695,0.15685615,0.049683575,0.0005766618],"about_ca_topic_score_codex":0.008706576,"about_ca_topic_score_gemma":0.014019081,"teacher_disagreement_score":0.022482986,"about_ca_system_score_codex":0.0016083001,"about_ca_system_score_gemma":0.003926662,"threshold_uncertainty_score":0.11890286},"labels":[],"label_agreement":null},{"id":"W1604958690","doi":"10.1007/bfb0035833","title":"Functional equations for data structures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Binary tree; Context (archaeology); Tree (set theory); Enumerative combinatorics; Mathematics; Data structure; Computer science; Algebra over a field; Theoretical computer science; Combinatorics; Pure mathematics; Biology","score_opus":0.10392689272916454,"score_gpt":0.3327648643379035,"score_spread":0.22883797160873892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604958690","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.018783242,0.0050166673,0.66167814,0.00743279,0.0010348045,0.00008647026,0.0009370389,0.00039874445,0.30463204],"genre_scores_gemma":[0.4312012,0.009617352,0.19282876,0.0019090152,0.0017533818,0.0005661873,0.002090621,0.0009316666,0.3591018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994562,0.00011421408,0.00005684582,0.000091095804,0.00022842828,0.00005325544],"domain_scores_gemma":[0.9994442,0.00026632834,0.000028872484,0.000086816464,0.0001469791,0.000026787438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694563,0.0008406394,0.0006839145,0.0012720973,0.0009831107,0.0021764,0.00097154785,0.0010263269,0.013122217],"category_scores_gemma":[0.0021414878,0.0006509087,0.0011385758,0.0017977323,0.001909347,0.006745648,0.0014981184,0.003096766,0.0017719024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.556805e-7,0.000002697561,0.000019662219,0.000015131752,0.0000019604765,0.000008787839,0.00006058724,0.00021667805,0.00010770788,0.99257725,0.0022397153,0.0047487696],"study_design_scores_gemma":[0.0000030809001,0.0000023871964,0.000036882782,0.0000138880105,0.0000032888752,0.000053080515,0.000023699355,0.002339406,0.000119766955,0.97869986,0.018700311,0.0000043756195],"about_ca_topic_score_codex":0.0018831734,"about_ca_topic_score_gemma":0.0016012165,"teacher_disagreement_score":0.013122217,"about_ca_system_score_codex":0.0022568153,"about_ca_system_score_gemma":0.0007333929,"threshold_uncertainty_score":0.043898225},"labels":[],"label_agreement":null},{"id":"W1605010755","doi":"10.1007/978-3-642-19318-7_4","title":"Automating Snakes for Multiple Objects Detection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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 Alberta","funders":"","keywords":"Computer science; Boosting (machine learning); Artificial intelligence; Active contour model; AdaBoost; Segmentation; Image segmentation; Outlier; Pattern recognition (psychology); Computer vision; Probabilistic logic; Object detection; Machine learning; Support vector machine","score_opus":0.020923896833551205,"score_gpt":0.23634535753716324,"score_spread":0.21542146070361204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605010755","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.0054405713,0.00028214653,0.9894091,0.0000621499,0.00006507368,0.00004370044,0.00007708633,0.0038734672,0.00074668793],"genre_scores_gemma":[0.054958183,0.00032849892,0.9399858,0.000084787425,0.000028462593,0.00005908558,0.00035315967,0.0007323852,0.0034696716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941826,0.00007576903,0.000031381394,0.00018992065,0.00021309839,0.00007156162],"domain_scores_gemma":[0.99933165,0.00024392392,0.00004007634,0.00017239305,0.0001812208,0.000030757794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092882063,0.0015515471,0.0013264752,0.0016714798,0.0005560266,0.0012397681,0.002085466,0.0019247805,0.0067824502],"category_scores_gemma":[0.0018607795,0.0015556552,0.0017641246,0.0015121109,0.00047277394,0.001450166,0.0019569742,0.0016728762,0.004148737],"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.00020534884,0.000091812726,0.00049829466,0.00019099808,0.00014656948,0.00015068369,0.00008106966,0.033439454,0.08549932,0.0039895363,0.007599375,0.86810744],"study_design_scores_gemma":[0.000020379384,0.00010175146,0.0009427917,0.00003754947,0.000058407328,0.00053215865,0.000033596465,0.9153517,0.06445048,0.009066155,0.009364229,0.000040780138],"about_ca_topic_score_codex":0.0016350182,"about_ca_topic_score_gemma":0.002470776,"teacher_disagreement_score":0.0067824502,"about_ca_system_score_codex":0.00044328396,"about_ca_system_score_gemma":0.0006026392,"threshold_uncertainty_score":0.022689521},"labels":[],"label_agreement":null},{"id":"W1605083655","doi":"10.1007/11779360_29","title":"Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Autocorrelation; Decimation; Mathematics; Complementary sequences; Binary number; Pseudorandom binary sequence; Autocorrelation matrix; Sequence (biology); Quadratic residue; Autocorrelation technique; Discrete mathematics; Algorithm; Combinatorics; Computer science; Arithmetic; Statistics; Telecommunications; Mathematical analysis","score_opus":0.023116194565001393,"score_gpt":0.24891497706386684,"score_spread":0.22579878249886545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605083655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43543383,0.0013133524,0.4973445,0.0007927224,0.00033921844,0.00006039226,0.0003731026,0.00038103617,0.06396192],"genre_scores_gemma":[0.9463226,0.00046768534,0.041385446,0.0001459117,0.00023620558,0.000063314365,0.0003665548,0.00011818555,0.010894027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996044,0.000091646725,0.000025474921,0.00005687681,0.00013951422,0.0000820956],"domain_scores_gemma":[0.999046,0.00042094247,0.00011947279,0.00018259081,0.0001277598,0.000103145714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060189073,0.00053327356,0.00058107614,0.0008888036,0.00065532024,0.0015433576,0.00048203047,0.0011489678,0.0040522013],"category_scores_gemma":[0.0019997396,0.00035291808,0.00067486387,0.00060535205,0.0010416151,0.0012343933,0.00071557914,0.0014990881,0.0006827143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116048286,0.000022548536,0.00030031448,0.000061966304,0.000011666464,0.00038608076,0.00017642611,0.0059629106,0.013138669,0.96985763,0.00077257847,0.009193216],"study_design_scores_gemma":[0.00005421498,0.00007905358,0.001156836,0.000037907106,0.000017957935,0.0012185087,0.00008828658,0.14089094,0.010506622,0.84089863,0.0049751056,0.00007589932],"about_ca_topic_score_codex":0.00026609376,"about_ca_topic_score_gemma":0.00027378224,"teacher_disagreement_score":0.0040522013,"about_ca_system_score_codex":0.0005453019,"about_ca_system_score_gemma":0.00041185025,"threshold_uncertainty_score":0.013555944},"labels":[],"label_agreement":null},{"id":"W1605119935","doi":"10.1007/978-3-540-88808-6_17","title":"Personal Agents in the Rule Responder Architecture","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 New Brunswick","funders":"","keywords":"Computer science; RuleML; Rule-based system; Architecture; Enterprise service bus; Reuse; Inference engine; Service (business); Rule of inference; Software engineering; Knowledge base; Web service; Service-oriented architecture; World Wide Web; Artificial intelligence; XML; Markup language; XHTML; Engineering","score_opus":0.038322697096029805,"score_gpt":0.2686674008060349,"score_spread":0.2303447037100051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605119935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019729137,0.0004268864,0.9043584,0.001477537,0.00021611474,0.0001654008,0.00014061407,0.007208498,0.0662775],"genre_scores_gemma":[0.2818187,0.00071409735,0.5972465,0.00061413436,0.00013933088,0.0002544299,0.0005578941,0.00075810816,0.11789679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.00028520921,0.000053524458,0.00017084334,0.0002092901,0.00009216421],"domain_scores_gemma":[0.9991835,0.00027894325,0.000030332629,0.00031910196,0.00010870481,0.00007939834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017387897,0.0003363839,0.0006302176,0.00039838965,0.0012153283,0.0035579994,0.00247019,0.0022799973,0.01946497],"category_scores_gemma":[0.0025938498,0.00074156385,0.00065817346,0.0006168534,0.0013394533,0.00584504,0.0020614462,0.002203821,0.006816529],"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.00042032343,0.00023826017,0.0007124805,0.00013728661,0.00006086087,0.00039637895,0.0010314649,0.028295593,0.0063006207,0.7786661,0.017914997,0.16582562],"study_design_scores_gemma":[0.00011482774,0.00010849538,0.00025351509,0.00007074696,0.000120533696,0.0003998254,0.00031540144,0.3801863,0.013842966,0.4779116,0.12661998,0.00005586403],"about_ca_topic_score_codex":0.0028227444,"about_ca_topic_score_gemma":0.0038201534,"teacher_disagreement_score":0.01946497,"about_ca_system_score_codex":0.00062406034,"about_ca_system_score_gemma":0.0009980339,"threshold_uncertainty_score":0.06511682},"labels":[],"label_agreement":null},{"id":"W1605180730","doi":"10.1007/3-540-36271-1_17","title":"Opening Statistical Translation Engines to Terminological Resources","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Terminology; Computer science; Machine translation; Natural language processing; Field (mathematics); Word (group theory); Word error rate; Artificial intelligence; Translation (biology); Work (physics); Reduction (mathematics); Information retrieval; Linguistics; Mechanical engineering","score_opus":0.029075296226176665,"score_gpt":0.27788428607011967,"score_spread":0.248808989843943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605180730","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.0048908535,0.001116384,0.9537859,0.0010859099,0.00058429356,0.000119182965,0.0011018655,0.025968788,0.011346746],"genre_scores_gemma":[0.12476864,0.003657254,0.8136613,0.0010854879,0.0012116095,0.00043303706,0.010105064,0.018488627,0.026588982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974759,0.00069779856,0.00037430372,0.00034595456,0.000953326,0.00015276035],"domain_scores_gemma":[0.992,0.0045182565,0.00025758383,0.002179679,0.00090957124,0.00013492547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032095935,0.00094416377,0.0015923346,0.00267355,0.001102012,0.005521661,0.0023310934,0.001668185,0.019681428],"category_scores_gemma":[0.01314603,0.0018852423,0.0015083913,0.004434601,0.0021279813,0.009788621,0.0045243385,0.0031689976,0.014962265],"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.00030338796,0.00012754637,0.00033959118,0.0007307255,0.000110018555,0.0005298131,0.0008108443,0.010115696,0.016090725,0.3514775,0.09215479,0.52720934],"study_design_scores_gemma":[0.00008788904,0.000059289414,0.00022965907,0.00019828515,0.00011497884,0.0004460974,0.0002230167,0.11813589,0.03734104,0.61339957,0.22967997,0.00008425753],"about_ca_topic_score_codex":0.0007401423,"about_ca_topic_score_gemma":0.0011516134,"teacher_disagreement_score":0.019681428,"about_ca_system_score_codex":0.00091443065,"about_ca_system_score_gemma":0.001451755,"threshold_uncertainty_score":0.0658409},"labels":[],"label_agreement":null},{"id":"W1605201204","doi":"10.1007/978-3-319-08596-8_18","title":"Accessibility of E-Commerce Websites for Vision-Impaired Persons","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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":"Western University","funders":"","keywords":"JavaScript; Animation; Visually impaired; Computer science; Web accessibility; Low vision; World Wide Web; Internet privacy; Multimedia; Web page; Human–computer interaction; Computer graphics (images); Optometry; Medicine; Web standards","score_opus":0.030900121228870536,"score_gpt":0.32544909024453794,"score_spread":0.2945489690156674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605201204","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.88741827,0.006877188,0.0022190849,0.0009004963,0.00006621881,0.00005137824,0.00073934026,0.00016149445,0.101566546],"genre_scores_gemma":[0.98391265,0.0029875701,0.0010254245,0.00010256921,0.0000248828,0.000011294342,0.00042999326,0.000023281966,0.011482251],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958926,0.000107108805,0.000036494697,0.00004171973,0.00014610495,0.00007939356],"domain_scores_gemma":[0.9984641,0.0008135772,0.00022093112,0.00007064407,0.0003043838,0.00012648155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000402425,0.00019467183,0.00017752105,0.0013807681,0.0005009572,0.0018220189,0.00043171895,0.0005909199,0.01325655],"category_scores_gemma":[0.004022669,0.00010908649,0.00042563255,0.00079498143,0.00022947103,0.0014670157,0.0009449035,0.00038243242,0.0015952437],"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.0006206873,0.00094143004,0.24975084,0.0012098326,0.00008738843,0.0025249103,0.019409789,0.0005740841,0.0069445306,0.005651654,0.02123642,0.69104844],"study_design_scores_gemma":[0.000033361062,0.0011859575,0.83841896,0.002134865,0.00030472636,0.016106833,0.040973753,0.0035538147,0.012689791,0.009113696,0.07537069,0.000113636845],"about_ca_topic_score_codex":0.0042909696,"about_ca_topic_score_gemma":0.0052383696,"teacher_disagreement_score":0.01325655,"about_ca_system_score_codex":0.00038463992,"about_ca_system_score_gemma":0.00035076065,"threshold_uncertainty_score":0.044347584},"labels":[],"label_agreement":null},{"id":"W1605220802","doi":"10.1007/11496656_1","title":"Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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 Waterloo","funders":"","keywords":"Upper and lower bounds; Simple (philosophy); Computer science; Scheme (mathematics); Abstraction; Approximation algorithm; Polynomial-time approximation scheme; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.02308233954582812,"score_gpt":0.2727705525386923,"score_spread":0.2496882129928642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605220802","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.021910148,0.0017091399,0.9555437,0.0033055847,0.00045115183,0.00037505652,0.00045797793,0.0014343784,0.014812809],"genre_scores_gemma":[0.3465168,0.0021398892,0.611724,0.0027842266,0.001153319,0.0020425587,0.0014129903,0.0016473302,0.030578913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98522687,0.003834825,0.00092531776,0.0027180952,0.005000079,0.0022946685],"domain_scores_gemma":[0.9115184,0.060816903,0.0025411912,0.016636599,0.0048417337,0.0036451844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018145923,0.004521724,0.0053639016,0.0038686744,0.00419424,0.009241347,0.014660781,0.009249314,0.020505331],"category_scores_gemma":[0.082148276,0.002775915,0.004930016,0.0059425025,0.009210601,0.022797108,0.0190384,0.022971034,0.004516299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022530737,0.000524641,0.0011970481,0.0007815839,0.0002372765,0.00014384833,0.0011150833,0.21290463,0.0101797525,0.63495535,0.020667326,0.11504045],"study_design_scores_gemma":[0.00016310542,0.00019230781,0.00023177225,0.000098321405,0.00013249303,0.00011889927,0.00012418292,0.5852174,0.0034390588,0.40656534,0.003639518,0.000077615245],"about_ca_topic_score_codex":0.0033515415,"about_ca_topic_score_gemma":0.0039634504,"teacher_disagreement_score":0.020505331,"about_ca_system_score_codex":0.011293515,"about_ca_system_score_gemma":0.0055811186,"threshold_uncertainty_score":0.09596592},"labels":[],"label_agreement":null},{"id":"W1605222863","doi":"10.1007/3-540-45153-6_30","title":"Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Travelling salesman problem; Computer science; Extension (predicate logic); Genetic algorithm; Graph; Constraint (computer-aided design); Constraint satisfaction problem; Algorithm; Mathematical optimization; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics","score_opus":0.0795154929231639,"score_gpt":0.33581237656569446,"score_spread":0.25629688364253056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605222863","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.06678326,0.00070036255,0.9192631,0.00020983342,0.00010340461,0.00007019731,0.00005604367,0.0005080607,0.012305703],"genre_scores_gemma":[0.31116143,0.00087371713,0.68038195,0.000084219544,0.00005816274,0.00009955336,0.00017978765,0.00010459283,0.0070565096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998573,0.000038026737,0.0000061805918,0.00002192799,0.000050387764,0.000026144144],"domain_scores_gemma":[0.9998388,0.00007922495,0.000015124082,0.000021227785,0.000036715348,0.000008853083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031404282,0.0004275269,0.00057332363,0.00038720324,0.00026277718,0.00061297073,0.00091224123,0.0008692494,0.0025228085],"category_scores_gemma":[0.00096848235,0.00022603899,0.00062232156,0.000653053,0.00022505126,0.00076851813,0.00043993685,0.00084048277,0.00041080918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008157915,0.00011441765,0.00045929098,0.00016511139,0.000073564384,0.00013983986,0.00007480536,0.75974035,0.011552975,0.026633408,0.0026113382,0.19835328],"study_design_scores_gemma":[0.000023295706,0.000037772224,0.00016185113,0.000011914179,0.000025695757,0.000061707324,0.0000142127155,0.98699677,0.0022295523,0.007867064,0.0025641806,0.000005955263],"about_ca_topic_score_codex":0.0031075294,"about_ca_topic_score_gemma":0.0026493275,"teacher_disagreement_score":0.0031075294,"about_ca_system_score_codex":0.00029041825,"about_ca_system_score_gemma":0.0008479814,"threshold_uncertainty_score":0.0084396005},"labels":[],"label_agreement":null},{"id":"W1605301763","doi":"10.1007/978-3-540-79721-0_89","title":"VisoLink: A User-Centric Social Relationship Mining","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Popularity; Computer science; World Wide Web; Visualization; Social network (sociolinguistics); Ranking (information retrieval); Social network service; Enhanced Data Rates for GSM Evolution; Data science; Service (business); Order (exchange); Social media; Information retrieval; Data mining; Artificial intelligence; Psychology; Social psychology","score_opus":0.02499464992974731,"score_gpt":0.2676699473180763,"score_spread":0.242675297388329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605301763","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.07391597,0.0022088478,0.7513816,0.00088650844,0.00049710355,0.0022170437,0.0856987,0.07405681,0.009137455],"genre_scores_gemma":[0.15334466,0.0008437542,0.76307625,0.00029825946,0.00015862081,0.0012604916,0.070296496,0.0012922336,0.009429201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984499,0.00030378843,0.00013355358,0.0004234263,0.00059996464,0.000089276255],"domain_scores_gemma":[0.9986162,0.00058465224,0.00016842286,0.0003543191,0.00017303957,0.000103239676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012710395,0.0016453085,0.0015063221,0.00619397,0.001108961,0.0017308574,0.0020897824,0.0010782029,0.0040280833],"category_scores_gemma":[0.004623227,0.00082757784,0.0016376068,0.004887374,0.00032073553,0.0025168853,0.002702448,0.0011604528,0.0034413897],"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.0006795275,0.0009943928,0.024390744,0.0015266176,0.0008900607,0.00048496726,0.00044596518,0.021922559,0.016814534,0.009486884,0.12935771,0.793006],"study_design_scores_gemma":[0.000147418,0.00039870222,0.017328601,0.00016067184,0.00036880223,0.0012811576,0.0003623539,0.83814543,0.022788258,0.025987478,0.09289641,0.00013468725],"about_ca_topic_score_codex":0.0041106613,"about_ca_topic_score_gemma":0.011591356,"teacher_disagreement_score":0.00619397,"about_ca_system_score_codex":0.0005245561,"about_ca_system_score_gemma":0.0012845424,"threshold_uncertainty_score":0.013475299},"labels":[],"label_agreement":null},{"id":"W1605316729","doi":"10.1007/11674399_3","title":"Rediscovering *-Minimax Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Class (philosophy); Computer science; Algorithm; Sampling (signal processing); Minimax approximation algorithm; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.03260848473576083,"score_gpt":0.2832781244515413,"score_spread":0.2506696397157805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605316729","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.016451437,0.001458288,0.9285676,0.00072972866,0.0005819944,0.00015310013,0.00017990555,0.0021262977,0.04975178],"genre_scores_gemma":[0.31489703,0.001095484,0.5907533,0.0010896403,0.00025444533,0.0005610456,0.0006722724,0.0017634153,0.08891339],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923825,0.0002878913,0.000037259044,0.00014114568,0.00020031347,0.00009506377],"domain_scores_gemma":[0.99904317,0.00042639163,0.000042930293,0.000332675,0.000108401764,0.000046451747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014416366,0.0009641153,0.0019316798,0.0009520756,0.00078332046,0.0012026993,0.0028300835,0.0017803726,0.018173791],"category_scores_gemma":[0.0042441073,0.0005752029,0.0011635998,0.0014741584,0.0011364726,0.0019515416,0.002680055,0.0024480668,0.0038596622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003872427,0.0001746173,0.00029257484,0.00042989725,0.00011746955,0.000093704024,0.00011134836,0.16650937,0.0031058476,0.25527674,0.028193392,0.54530776],"study_design_scores_gemma":[0.00011113938,0.00024941223,0.000175048,0.00011232309,0.000058701153,0.00020151975,0.00003707691,0.7202074,0.003204733,0.25237584,0.023230825,0.00003597808],"about_ca_topic_score_codex":0.0011327104,"about_ca_topic_score_gemma":0.0015173792,"teacher_disagreement_score":0.018173791,"about_ca_system_score_codex":0.00068496173,"about_ca_system_score_gemma":0.0011609885,"threshold_uncertainty_score":0.060797393},"labels":[],"label_agreement":null},{"id":"W1605343822","doi":"10.1007/3-540-45517-5_33","title":"Time Delay Neural Networks Designed Using Genetic Algorithms for Short Term Inter-City Traffic Forecasting","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":69,"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":"Computer science; Traffic volume; Term (time); Artificial neural network; Genetic algorithm; Volume (thermodynamics); Intelligent transportation system; Traffic generation model; Algorithm; Estimation; Real-time computing; Data mining; Artificial intelligence; Machine learning; Transport engineering; Engineering","score_opus":0.031703404339962396,"score_gpt":0.2422868373167687,"score_spread":0.21058343297680632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605343822","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.062556304,0.0010199612,0.93087333,0.00017190928,0.00025786762,0.000084559884,0.00006974591,0.00056489184,0.004401354],"genre_scores_gemma":[0.73653007,0.0007753824,0.25464812,0.00015079931,0.00008546545,0.00030020814,0.00016138863,0.00007557723,0.0072729993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998585,0.000034356366,0.000010435278,0.000034024564,0.000036819056,0.000025770112],"domain_scores_gemma":[0.9992999,0.0003656451,0.00005091866,0.000026026753,0.00023870116,0.000018887416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073817663,0.0005791456,0.00061692216,0.0006044394,0.00038093785,0.00073274353,0.0012314891,0.0014099389,0.0017858563],"category_scores_gemma":[0.0020509094,0.0005197295,0.0004172161,0.0008636181,0.00040765142,0.00077813974,0.00029258456,0.0011323796,0.00029508423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034483306,0.000023922958,0.00022567534,0.000016903907,0.000022005888,0.000018791749,0.00001745094,0.9609359,0.00082604407,0.001407492,0.00031074157,0.036160607],"study_design_scores_gemma":[0.00000522243,0.000009904432,0.000040670293,0.0000024836877,0.00000617843,0.0000034408874,0.000002565497,0.9990539,0.0003273332,0.0004547413,0.000091394,0.000002109606],"about_ca_topic_score_codex":0.017288523,"about_ca_topic_score_gemma":0.016078295,"teacher_disagreement_score":0.017288523,"about_ca_system_score_codex":0.0011512185,"about_ca_system_score_gemma":0.000795855,"threshold_uncertainty_score":0.034375787},"labels":[],"label_agreement":null},{"id":"W1605425408","doi":"10.1007/978-3-540-72667-8_24","title":"Measuring Inconsistencies in Ontologies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Axiom; Ontology; Measure (data warehouse); Shapley value; Quality (philosophy); Theoretical computer science; Description logic; Game theory; Data mining; Mathematical economics; Mathematics","score_opus":0.07339363877268658,"score_gpt":0.2671452974660866,"score_spread":0.19375165869340005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605425408","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.4281877,0.0032282602,0.5519562,0.0010750691,0.0002851127,0.0005339749,0.004076449,0.0034969852,0.007160313],"genre_scores_gemma":[0.74094355,0.0006200974,0.24933486,0.00015334925,0.00007792483,0.00018596287,0.0071218945,0.00041502496,0.0011473374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96413034,0.008868108,0.0041752392,0.0051849,0.01646996,0.0011713478],"domain_scores_gemma":[0.91480076,0.053487733,0.0076370877,0.010734893,0.01245851,0.0008810082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013323374,0.0011949344,0.001813836,0.012678832,0.0020402526,0.005657523,0.0034654124,0.0022816479,0.002389719],"category_scores_gemma":[0.09884311,0.0011837087,0.0019804686,0.011943388,0.0020194568,0.013293256,0.0047435425,0.001943357,0.0004996913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015545312,0.0006887446,0.21931544,0.0018578325,0.0022842393,0.0015434586,0.0033610312,0.093133755,0.014800283,0.115990475,0.008354834,0.5371154],"study_design_scores_gemma":[0.00013896733,0.00050243037,0.032700006,0.0006175846,0.0021490015,0.0024785502,0.005283169,0.57170844,0.05692566,0.30728874,0.02000055,0.0002068963],"about_ca_topic_score_codex":0.0051489724,"about_ca_topic_score_gemma":0.005818043,"teacher_disagreement_score":0.013323374,"about_ca_system_score_codex":0.0024593147,"about_ca_system_score_gemma":0.0027963505,"threshold_uncertainty_score":0.07046163},"labels":[],"label_agreement":null},{"id":"W1605445186","doi":"10.1007/978-3-642-19315-6_36","title":"Multiple Viewpoint Recognition and Localization","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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 British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Object (grammar); Cognitive neuroscience of visual object recognition; Set (abstract data type); Matching (statistics); Viewpoints; Pattern recognition (psychology); Image (mathematics); Robotics; Data set; Robot; Mathematics","score_opus":0.02602132370616378,"score_gpt":0.2012294951291249,"score_spread":0.17520817142296113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605445186","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.001899423,0.012189631,0.9486187,0.00028752457,0.000786899,0.000039147013,0.00023057488,0.0023585008,0.03358956],"genre_scores_gemma":[0.080768086,0.022232937,0.68592244,0.00039114273,0.0006241128,0.00013974664,0.0022800115,0.00081090425,0.20683064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995546,0.000031941945,0.000019707732,0.00017018858,0.00018834871,0.00003517101],"domain_scores_gemma":[0.9997973,0.000040261843,0.000012415122,0.00007909725,0.000059661907,0.000011304724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026299548,0.0009124311,0.0010541104,0.0009972041,0.00032389595,0.0017774072,0.0013996337,0.0011648013,0.017847944],"category_scores_gemma":[0.00070709735,0.00059434253,0.000691191,0.0021366186,0.00061768346,0.0018759454,0.0013053115,0.0009680802,0.017081138],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035737972,0.000013315772,0.00010982517,0.00022787618,0.00001981966,0.00006856114,0.00004951393,0.0036212113,0.014315018,0.019678127,0.017319886,0.944541],"study_design_scores_gemma":[0.000025102212,0.00017811418,0.002332046,0.00028263728,0.000101962636,0.0026008505,0.0001753409,0.13683952,0.09263209,0.10664461,0.65805864,0.0001290552],"about_ca_topic_score_codex":0.0014117291,"about_ca_topic_score_gemma":0.0017595724,"teacher_disagreement_score":0.017847944,"about_ca_system_score_codex":0.00044530607,"about_ca_system_score_gemma":0.00040683575,"threshold_uncertainty_score":0.059707344},"labels":[],"label_agreement":null},{"id":"W1605446001","doi":"10.1007/978-3-642-12659-8_13","title":"Parallelizing Power Systems Simulation for Multi-core Clusters: Design for an SME","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-time simulation and control systems","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 Manitoba","funders":"","keywords":"Computer science; Exploit; Interconnection; Key (lock); Latency (audio); Multi-core processor; Core (optical fiber); Many core; Distributed computing; Set (abstract data type); Low latency (capital markets); Power (physics); Parallel computing; Operating system; Telecommunications; Computer network; Computer security","score_opus":0.06671300084920967,"score_gpt":0.2947207436148001,"score_spread":0.22800774276559044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605446001","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.012768451,0.00019151314,0.978974,0.00021411444,0.000036603215,0.00009074168,0.000038431754,0.0014378446,0.0062483246],"genre_scores_gemma":[0.30997488,0.00044147586,0.6764042,0.00020518096,0.000042969605,0.000344881,0.00019999816,0.00082982477,0.011556701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996549,0.00010212919,0.000022072838,0.000052889623,0.00014126218,0.000026800064],"domain_scores_gemma":[0.99954396,0.00011176193,0.000028054706,0.000096830605,0.00018253188,0.000036826048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239616,0.0003982389,0.00044083415,0.00018345471,0.00039483188,0.00059599726,0.0013231006,0.0004777778,0.004337025],"category_scores_gemma":[0.0013414455,0.00055899384,0.00047730896,0.00033590608,0.00028774538,0.00069195783,0.0007077958,0.0009699136,0.0011824421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029594728,0.00018653754,0.002499475,0.00040329437,0.00013981225,0.0001927515,0.00029188357,0.6160862,0.07016516,0.040556323,0.009830054,0.25935262],"study_design_scores_gemma":[0.000024375398,0.000066572735,0.0002710918,0.000012816411,0.000016462514,0.00005079441,0.000022058814,0.97666806,0.010495139,0.004471974,0.007893056,0.000007576956],"about_ca_topic_score_codex":0.0012207754,"about_ca_topic_score_gemma":0.002186889,"teacher_disagreement_score":0.004337025,"about_ca_system_score_codex":0.0004286908,"about_ca_system_score_gemma":0.00086805667,"threshold_uncertainty_score":0.014508724},"labels":[],"label_agreement":null},{"id":"W1605500262","doi":"10.1007/3-540-45049-1_34","title":"Linguistic Approximation and Semantic Adjustment in the Modeling Process","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Institut Universitaire de Gériatrie de Montréal","funders":"","keywords":"Computer science; Representation (politics); Meaning (existential); Expression (computer science); Set (abstract data type); Context (archaeology); Fuzzy set; Natural language processing; Fuzzy logic; Artificial intelligence; Algorithm; Theoretical computer science; Linguistics; Epistemology; Programming language","score_opus":0.01676775487820814,"score_gpt":0.23417194917042727,"score_spread":0.21740419429221913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605500262","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.0056867693,0.00028552877,0.9899047,0.00041498183,0.000058958,0.000027280927,0.000031355325,0.000118802134,0.0034715727],"genre_scores_gemma":[0.4055795,0.0008356569,0.5861708,0.00019616076,0.00018876274,0.0001609729,0.00023281907,0.00018017658,0.006455135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727136,0.0014332492,0.00019315392,0.00045272033,0.00053911505,0.00011030535],"domain_scores_gemma":[0.9976432,0.0015037929,0.00015872021,0.00036132906,0.00027416076,0.00005875382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036958524,0.0006125067,0.0008946288,0.0009732864,0.00074146135,0.0028493311,0.0015743476,0.0012205807,0.0031860815],"category_scores_gemma":[0.011184537,0.00061508047,0.0015573365,0.0014058361,0.0023152947,0.0051693423,0.0018797545,0.0019690122,0.00062064285],"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.00013072239,0.00004671824,0.0003192976,0.0001396603,0.00005778282,0.00015207814,0.0007040651,0.11645052,0.0019273785,0.8191211,0.00095635426,0.059994392],"study_design_scores_gemma":[0.000015094311,0.00003226098,0.00013896669,0.000028446224,0.000046133824,0.000056298984,0.00008940785,0.42948672,0.001118409,0.5648109,0.004152264,0.000025103895],"about_ca_topic_score_codex":0.0030336962,"about_ca_topic_score_gemma":0.0020203104,"teacher_disagreement_score":0.0036958524,"about_ca_system_score_codex":0.001251436,"about_ca_system_score_gemma":0.0009815351,"threshold_uncertainty_score":0.019545734},"labels":[],"label_agreement":null},{"id":"W1605516979","doi":"10.1007/978-3-642-14165-2_16","title":"Faster Algorithms for Semi-matching Problems (Extended Abstract)","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Matching (statistics); Theoretical computer science; Mathematics","score_opus":0.028262169147844112,"score_gpt":0.27737858354945577,"score_spread":0.24911641440161167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605516979","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.011755497,0.0015130374,0.9682484,0.00063695566,0.0006645829,0.00017136367,0.00041250626,0.0028619084,0.013735707],"genre_scores_gemma":[0.067944065,0.0006812875,0.91250515,0.00043258956,0.00035026408,0.00038040028,0.0015843378,0.0011572646,0.014964703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793434,0.00041313644,0.00013346602,0.0005355982,0.0007186866,0.00026475615],"domain_scores_gemma":[0.9960924,0.0017283063,0.00020637659,0.0012703324,0.00055780914,0.00014470736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356819,0.0020252485,0.0024148065,0.0018770582,0.0011128173,0.0027507334,0.0037104646,0.0024973906,0.04017836],"category_scores_gemma":[0.00881612,0.0012273799,0.0029054887,0.004779119,0.0010973278,0.0082845595,0.0037416576,0.004425604,0.010944779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000912419,0.000613401,0.0006077563,0.0010659967,0.00020001199,0.00010580517,0.00024647405,0.078805685,0.008907556,0.14512046,0.056737617,0.70667684],"study_design_scores_gemma":[0.00038754448,0.00016688013,0.0006925896,0.00011798391,0.0001037155,0.0002576873,0.0000900808,0.55623186,0.006621837,0.4083936,0.026886303,0.000049918148],"about_ca_topic_score_codex":0.0035359734,"about_ca_topic_score_gemma":0.0044688405,"teacher_disagreement_score":0.04017836,"about_ca_system_score_codex":0.0017061105,"about_ca_system_score_gemma":0.0017557982,"threshold_uncertainty_score":0.13441002},"labels":[],"label_agreement":null},{"id":"W1605527696","doi":"10.1007/978-3-642-12239-2_14","title":"Towards a Generic Framework for Automated Video Game Level Creation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Encoding (memory); Video game; Genetic algorithm; Generative grammar; Game design; Human–computer interaction; Artificial intelligence; Multimedia; Machine learning","score_opus":0.05360482209948655,"score_gpt":0.3185226923221993,"score_spread":0.2649178702227128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605527696","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.0008466088,0.000047732436,0.98920816,0.000042918964,0.000018419913,0.00014711898,0.00013415534,0.008147494,0.0014073888],"genre_scores_gemma":[0.04034992,0.00017253906,0.95330137,0.000079024954,0.000022965707,0.0002799352,0.00092748355,0.0012033865,0.0036633743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986695,0.00018048451,0.00014013785,0.00033563955,0.00048732958,0.0001870456],"domain_scores_gemma":[0.9991278,0.00020749112,0.000058526894,0.0002996778,0.00022641546,0.000080112906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016273081,0.0012134776,0.0011934725,0.0018396132,0.001000523,0.004617696,0.0039936607,0.0020130007,0.008266776],"category_scores_gemma":[0.0032066645,0.0011945519,0.0024488613,0.001072951,0.0014106097,0.0037753722,0.004332726,0.0025940274,0.0046948683],"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.00028765397,0.00050245255,0.00265998,0.00087629625,0.00022514121,0.00067178544,0.0011176842,0.078253284,0.024708327,0.41742662,0.034290638,0.43898007],"study_design_scores_gemma":[0.00004563172,0.000060656115,0.00056185224,0.00015905936,0.00010614945,0.00039779083,0.00020036448,0.7702995,0.019480843,0.123743795,0.08487236,0.00007195533],"about_ca_topic_score_codex":0.0060383026,"about_ca_topic_score_gemma":0.009443504,"teacher_disagreement_score":0.008266776,"about_ca_system_score_codex":0.0011363757,"about_ca_system_score_gemma":0.0018992499,"threshold_uncertainty_score":0.027655125},"labels":[],"label_agreement":null},{"id":"W1605562353","doi":"10.1007/11510888_46","title":"An Approach to Mining Picture Objects Based on Textual Cues","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Semantics (computer science); Domain (mathematical analysis); Information retrieval; Task (project management); Natural language processing; Process (computing); Text processing; Artificial intelligence; Meaning (existential); Programming language","score_opus":0.02463087384928613,"score_gpt":0.2521876456404516,"score_spread":0.22755677179116546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605562353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031551093,0.0034444032,0.9470038,0.00067579263,0.00020256935,0.00077088305,0.0038480323,0.0075269714,0.00497641],"genre_scores_gemma":[0.081223875,0.0011947502,0.9019855,0.0002506638,0.00021515955,0.00060018373,0.0074045896,0.000422313,0.006702903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985923,0.00013663995,0.000110437555,0.000510849,0.0005097693,0.00014000053],"domain_scores_gemma":[0.9984518,0.00056236575,0.00012870059,0.00022195454,0.0005330738,0.00010209933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009207662,0.0016549126,0.001785762,0.00823132,0.0013469722,0.0026552824,0.0035832892,0.0023918597,0.0051894668],"category_scores_gemma":[0.0029566824,0.00088166416,0.0021582465,0.008665461,0.00088777655,0.004167942,0.0027000743,0.0015706829,0.0049480232],"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.00043626645,0.00033659147,0.0035956202,0.0006512892,0.00016863515,0.00031783117,0.00056102726,0.0024383885,0.05220749,0.0052136285,0.015756585,0.91831666],"study_design_scores_gemma":[0.00030774015,0.0007709454,0.019184835,0.00035486813,0.0009860935,0.0030595558,0.0039106514,0.7245668,0.09712819,0.05429109,0.09512318,0.00031599836],"about_ca_topic_score_codex":0.008137692,"about_ca_topic_score_gemma":0.015079631,"teacher_disagreement_score":0.00823132,"about_ca_system_score_codex":0.0008247167,"about_ca_system_score_gemma":0.0013590506,"threshold_uncertainty_score":0.017360508},"labels":[],"label_agreement":null},{"id":"W1605574215","doi":"10.1007/978-3-540-78157-8_5","title":"Fast Line-Segment Extraction for Semi-dense Stereo Matching","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Manitoba","funders":"","keywords":"Computer vision; Artificial intelligence; Computer science; Line segment; Noise (video); Line (geometry); Perspective (graphical); Matching (statistics); Distortion (music); Point (geometry); Hough transform; Stereopsis; Monocular; Image (mathematics); Mathematics","score_opus":0.024480981156889067,"score_gpt":0.2931241951902923,"score_spread":0.26864321403340324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605574215","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.007824739,0.00018465203,0.98605436,0.000036101483,0.000032831766,0.00005387109,0.0002810475,0.004096073,0.001436231],"genre_scores_gemma":[0.087008655,0.000250854,0.90605336,0.00007477787,0.000043820095,0.00011239135,0.0016497474,0.0005192215,0.004287107],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944395,0.00004793623,0.000024698697,0.000095037285,0.0003143029,0.00007406553],"domain_scores_gemma":[0.9994856,0.00012157236,0.000048435497,0.00014349842,0.00017335464,0.000027392613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034557114,0.0009990352,0.0010881444,0.0021287876,0.0003894919,0.00093454,0.001471196,0.0010735143,0.011666874],"category_scores_gemma":[0.0009947977,0.000874549,0.00067945523,0.0021061923,0.0002381372,0.0013443962,0.0014884626,0.0007934334,0.0061792354],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026305494,0.000091057045,0.00036817943,0.00017116316,0.00004802581,0.00007155634,0.00006200875,0.010995057,0.16826124,0.0023188023,0.008186452,0.8091634],"study_design_scores_gemma":[0.00005568504,0.0001507489,0.0021948777,0.000035787638,0.000051411967,0.0005063346,0.00006763178,0.79926896,0.1753386,0.0068696504,0.015417678,0.00004258691],"about_ca_topic_score_codex":0.002213497,"about_ca_topic_score_gemma":0.0044308086,"teacher_disagreement_score":0.011666874,"about_ca_system_score_codex":0.0004097043,"about_ca_system_score_gemma":0.00076090184,"threshold_uncertainty_score":0.03902954},"labels":[],"label_agreement":null},{"id":"W1605624010","doi":"10.1007/11912873_42","title":"Monitoring Interactivity in a Web-Based Community","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Lethbridge","funders":"","keywords":"Interactivity; Computer science; Enabling; Virtual community; Correctness; World Wide Web; Online community; Knowledge management; Multimedia; The Internet","score_opus":0.02430883515320604,"score_gpt":0.26567681363458484,"score_spread":0.2413679784813788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605624010","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.9603781,0.00016820985,0.03618138,0.00011527458,0.000023568404,0.00016860494,0.0002437242,0.0008831951,0.0018379966],"genre_scores_gemma":[0.9830146,0.00003774903,0.015796846,0.000012967977,0.00001898544,0.000057401532,0.0003037071,0.00004849901,0.0007091419],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968388,0.00095666025,0.0001707021,0.0006865931,0.0011306336,0.00021656656],"domain_scores_gemma":[0.9746192,0.014619516,0.0025086352,0.0016791179,0.00351749,0.003056079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760455,0.00045334257,0.0009046169,0.0030247848,0.0014333772,0.0020979694,0.0019897001,0.001285565,0.0012411217],"category_scores_gemma":[0.0144827245,0.00041199868,0.00036795205,0.0022666706,0.00092864677,0.0034343272,0.0026739254,0.0011092151,0.000503654],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009354535,0.00492316,0.44741198,0.0007455781,0.0007583469,0.002158512,0.009878637,0.09998533,0.108336836,0.013431193,0.0046305805,0.29838532],"study_design_scores_gemma":[0.0002050508,0.00096822344,0.06628006,0.000040431496,0.00019690905,0.0005786441,0.0018587284,0.90108484,0.016640538,0.010046619,0.002011238,0.00008864744],"about_ca_topic_score_codex":0.00399552,"about_ca_topic_score_gemma":0.0041196425,"teacher_disagreement_score":0.00399552,"about_ca_system_score_codex":0.00062080944,"about_ca_system_score_gemma":0.00065153267,"threshold_uncertainty_score":0.014598846},"labels":[],"label_agreement":null},{"id":"W1605625785","doi":"10.1007/3-540-44566-8_6","title":"A User Modeling Approach to Determining System Initiative in Mixed-Initiative AI Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Computer science; User modeling; Task (project management); Scheduling (production processes); User requirements document; Human–computer interaction; Computer user satisfaction; User interface; Data science; Software engineering; Engineering; Systems engineering","score_opus":0.03553027460153694,"score_gpt":0.24646962246735465,"score_spread":0.21093934786581772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605625785","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.015569159,0.0001095752,0.9819656,0.00021299074,0.000013650066,0.00009052788,0.000056868827,0.00036433537,0.0016173152],"genre_scores_gemma":[0.6449825,0.00019694438,0.34960863,0.00019024422,0.000052994168,0.00056448515,0.00017957385,0.00019409286,0.0040305345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949321,0.0029579606,0.00021569601,0.00071417185,0.0008471313,0.00033288894],"domain_scores_gemma":[0.98192155,0.015610258,0.00050219044,0.0005820319,0.001049406,0.00033459446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057010534,0.0013159321,0.0014866649,0.001746416,0.0013788857,0.002499262,0.0028401793,0.0017836484,0.0023040003],"category_scores_gemma":[0.020169355,0.0013632333,0.0017662866,0.001294137,0.0017816934,0.0043367613,0.0021936053,0.0023453026,0.000543459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007129647,0.0006690559,0.011738253,0.00032034158,0.0005114379,0.00044430027,0.0049280403,0.6013906,0.0071858913,0.19293903,0.0033211114,0.17583899],"study_design_scores_gemma":[0.000008441775,0.00004168178,0.00038441314,0.000008089309,0.0000314229,0.000046669047,0.00009284559,0.98011863,0.0006222186,0.018201707,0.00042083734,0.00002309023],"about_ca_topic_score_codex":0.019426849,"about_ca_topic_score_gemma":0.021382648,"teacher_disagreement_score":0.019426849,"about_ca_system_score_codex":0.0020036595,"about_ca_system_score_gemma":0.001991826,"threshold_uncertainty_score":0.038627565},"labels":[],"label_agreement":null},{"id":"W1605680918","doi":"10.1007/11815921_2","title":"On the Theory and Applications of Sequence Based Estimation of Independent Binomial Random Variables","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Sequence (biology); Cardinality (data modeling); Estimation; Set (abstract data type); Convergence (economics); Markov chain; Mathematics; Binomial (polynomial); Statistics; Maximum likelihood; Random variable; Binomial distribution; Computer science; Algorithm; Econometrics; Data mining","score_opus":0.011239497373828096,"score_gpt":0.23598331258427305,"score_spread":0.22474381521044495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605680918","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.0009916426,0.0013336412,0.9962219,0.00014056374,0.00009496201,0.00001732201,0.000025943125,0.00005035229,0.0011237729],"genre_scores_gemma":[0.12272723,0.0138708465,0.85224885,0.0009232607,0.0019236075,0.0005199608,0.00057328533,0.0002511481,0.006961774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99205583,0.0050729928,0.00037527457,0.0006148416,0.0016488486,0.00023221257],"domain_scores_gemma":[0.93846184,0.05585007,0.0012599824,0.0020852168,0.0020352139,0.00030765455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010991079,0.0018603614,0.0028910558,0.0030204884,0.00088788953,0.0028907175,0.0035598595,0.0032150198,0.004202106],"category_scores_gemma":[0.05890411,0.0016111387,0.001849563,0.005905109,0.004055603,0.0058012228,0.004123743,0.0043049357,0.0011462725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009245426,0.00004385707,0.00089499186,0.00030863294,0.0001222043,0.00016233843,0.00023647214,0.20069827,0.0013771134,0.7008228,0.0030057067,0.092235245],"study_design_scores_gemma":[0.000015580134,0.000044416785,0.00029098266,0.00011677469,0.000033109078,0.00025786567,0.000027097423,0.6402145,0.0006269819,0.35444874,0.0038742598,0.000049785296],"about_ca_topic_score_codex":0.0022578936,"about_ca_topic_score_gemma":0.0016924742,"teacher_disagreement_score":0.010991079,"about_ca_system_score_codex":0.0012808033,"about_ca_system_score_gemma":0.0015287808,"threshold_uncertainty_score":0.058127105},"labels":[],"label_agreement":null},{"id":"W1605751028","doi":"10.1007/3-540-44963-9_10","title":"Learning a Model of a Web User’s Interests","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Web page; World Wide Web; Information retrieval; Task (project management); Set (abstract data type); Web navigation; Static web page; Recommender system; Web mining","score_opus":0.029678299107728876,"score_gpt":0.2599366141041065,"score_spread":0.23025831499637764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605751028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21521524,0.0008260781,0.7750025,0.002172436,0.00008557462,0.000114802344,0.0015957106,0.0011739772,0.0038137182],"genre_scores_gemma":[0.9289245,0.00058604573,0.06310005,0.00028382012,0.00016647398,0.00015909983,0.002247924,0.0000594414,0.004472591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.00020261078,0.00002923401,0.00020437835,0.0000909129,0.00005426183],"domain_scores_gemma":[0.994753,0.0042990353,0.00019579506,0.00036874384,0.00026317043,0.00012028913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016243189,0.0006898929,0.00087712676,0.0015942772,0.00031681062,0.0014234761,0.001430807,0.0016147308,0.002553136],"category_scores_gemma":[0.007925057,0.0006058609,0.001085782,0.0015411957,0.00050726125,0.00342891,0.000744091,0.0022344824,0.0013538948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011073861,0.0014960353,0.045225717,0.00035495157,0.000715148,0.00032492573,0.0008821214,0.49242687,0.004904254,0.029492198,0.018581986,0.40448844],"study_design_scores_gemma":[0.000027058208,0.00005456648,0.0013502932,0.000014058098,0.000041191925,0.000051039977,0.000030605137,0.98676354,0.00041126434,0.010881055,0.0003651892,0.0000101716605],"about_ca_topic_score_codex":0.008748803,"about_ca_topic_score_gemma":0.0134571865,"teacher_disagreement_score":0.008748803,"about_ca_system_score_codex":0.001076733,"about_ca_system_score_gemma":0.000606366,"threshold_uncertainty_score":0.017395735},"labels":[],"label_agreement":null},{"id":"W160585330","doi":"10.1007/978-3-642-33486-3_23","title":"Semi-supervised Multi-label Classification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":33,"is_retracted":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":"Computer science; Artificial intelligence; Semi-supervised learning; Machine learning; Subspace topology; Margin (machine learning); Supervised learning; Classifier (UML); Exploit; Pattern recognition (psychology); Labeled data; Unsupervised learning; Artificial neural network","score_opus":0.0571843465909377,"score_gpt":0.28266592207948016,"score_spread":0.22548157548854247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160585330","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.012098642,0.0008525261,0.9781055,0.00028025254,0.00027056312,0.00023336415,0.0008924859,0.0041073817,0.0031593912],"genre_scores_gemma":[0.2026156,0.00055098097,0.7694378,0.00047200252,0.00043254608,0.0006722781,0.0090604825,0.0008256786,0.01593255],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942274,0.0018422866,0.00048577168,0.0016551027,0.0014774614,0.00031189018],"domain_scores_gemma":[0.9892265,0.004197069,0.0006902558,0.002591437,0.003007493,0.00028736243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044231,0.0017518097,0.0027190582,0.0023322883,0.0013239408,0.0026961006,0.0037433626,0.0024476561,0.004359585],"category_scores_gemma":[0.006894827,0.00082258857,0.0021220904,0.0021594584,0.0009893351,0.003016459,0.0029560232,0.0021108838,0.0071130283],"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.00044862548,0.0004147531,0.0020498168,0.00058096217,0.0003233039,0.00016752836,0.00019276567,0.022053774,0.017079484,0.0036546378,0.02599479,0.9270396],"study_design_scores_gemma":[0.00003869928,0.00019801213,0.0016860937,0.00013468556,0.00014698687,0.0005329966,0.00017089453,0.9432368,0.021237757,0.020922769,0.011625667,0.00006866507],"about_ca_topic_score_codex":0.0012834338,"about_ca_topic_score_gemma":0.003816212,"teacher_disagreement_score":0.0044231,"about_ca_system_score_codex":0.00067162624,"about_ca_system_score_gemma":0.0015804861,"threshold_uncertainty_score":0.023391843},"labels":[],"label_agreement":null},{"id":"W1605990238","doi":"10.1007/978-3-540-76336-9_22","title":"Efficient Enumeration of Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Domain (mathematical analysis); Mathematics; Computer science; Section (typography); Computation; Algorithm; Combinatorics","score_opus":0.01162829050439511,"score_gpt":0.24877875866560786,"score_spread":0.23715046816121274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605990238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059687734,0.00070919696,0.85999113,0.00081733154,0.00017890347,0.00016550695,0.0009678092,0.004960171,0.07252219],"genre_scores_gemma":[0.3766871,0.0009342914,0.54209656,0.00045762496,0.00019491311,0.00046830435,0.005203563,0.0020295444,0.071928106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983234,0.00044660785,0.00012188963,0.00027874243,0.0005872963,0.00024212738],"domain_scores_gemma":[0.99703777,0.0016144363,0.000120753895,0.0007936559,0.00034200275,0.00009144063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075107976,0.00076864887,0.0011472611,0.0011441583,0.0010383149,0.0030876396,0.0019242073,0.0007589712,0.0137309],"category_scores_gemma":[0.0037994916,0.0009004814,0.001169894,0.0021206995,0.0010735742,0.004767605,0.0030617963,0.002284722,0.0048946757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029369237,0.0002231085,0.00050041004,0.0004700066,0.00004144087,0.00015746133,0.00042529605,0.016636178,0.0173267,0.6229413,0.021721497,0.31926295],"study_design_scores_gemma":[0.000047583893,0.00003976037,0.0001919867,0.00005180278,0.00003091522,0.00018975868,0.00009392948,0.069628686,0.011327249,0.895241,0.02312946,0.000027779008],"about_ca_topic_score_codex":0.0005404068,"about_ca_topic_score_gemma":0.001489509,"teacher_disagreement_score":0.0137309,"about_ca_system_score_codex":0.0010497526,"about_ca_system_score_gemma":0.0010813762,"threshold_uncertainty_score":0.0459345},"labels":[],"label_agreement":null},{"id":"W1606004093","doi":"10.1007/978-3-540-69073-3_27","title":"Domain-Specific Model Editors with Model Completion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Computer science; Prolog; Programming language; Program synthesis; Domain (mathematical analysis); Domain-specific language; Constraint satisfaction; Model transformation; Code generation; Theoretical computer science; Artificial intelligence","score_opus":0.018651229399499217,"score_gpt":0.21661197660870057,"score_spread":0.19796074720920137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606004093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062420627,0.00005565498,0.98157907,0.00013497187,0.00012586966,0.000077596575,0.00037710657,0.012204151,0.004821402],"genre_scores_gemma":[0.03618719,0.00035298784,0.9281957,0.00028641277,0.00015070957,0.00032619853,0.0032926695,0.009974818,0.021233276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965563,0.0008919625,0.0004145808,0.0005444554,0.0014400022,0.00015276279],"domain_scores_gemma":[0.99230933,0.0031658253,0.0002928541,0.002856992,0.0012035436,0.00017140005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004070217,0.0017873353,0.0013103373,0.0016309315,0.0007215872,0.003836946,0.003253357,0.0015002849,0.034316946],"category_scores_gemma":[0.016870392,0.0020713028,0.0026474218,0.0014023955,0.0009662271,0.0061367047,0.0048031835,0.005785299,0.0150719695],"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.00028576594,0.00027610804,0.00049093855,0.0012625081,0.00018160474,0.0007275998,0.0010194134,0.049719278,0.010204572,0.3783458,0.11374876,0.44373763],"study_design_scores_gemma":[0.00013680244,0.000057011475,0.00008616288,0.00023843802,0.00017868541,0.00054467755,0.00013471645,0.2842265,0.03631518,0.27556917,0.40243524,0.00007751941],"about_ca_topic_score_codex":0.00091225764,"about_ca_topic_score_gemma":0.0017490983,"teacher_disagreement_score":0.034316946,"about_ca_system_score_codex":0.0007317523,"about_ca_system_score_gemma":0.0016403494,"threshold_uncertainty_score":0.114801645},"labels":[],"label_agreement":null},{"id":"W1606016218","doi":"10.1007/978-3-540-72586-2_38","title":"Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Computer science; Maple; Computation; Parallel computing; Algorithm; Theoretical computer science; Computational science","score_opus":0.013314481299846938,"score_gpt":0.23673112374223088,"score_spread":0.22341664244238393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606016218","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.051522564,0.0005413835,0.83821076,0.00039081828,0.00029346292,0.00022111219,0.0017329742,0.010012187,0.0970747],"genre_scores_gemma":[0.3739045,0.00061568007,0.5611076,0.0002766183,0.00026321813,0.00030836053,0.0055866763,0.0031899977,0.05474746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910384,0.00017401046,0.000051141178,0.00014263454,0.0003540313,0.00017441467],"domain_scores_gemma":[0.9990345,0.0002761083,0.00004731415,0.00035244875,0.00020973785,0.00007993928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567908,0.001019496,0.001252425,0.0014674425,0.001622108,0.0029830246,0.0021584898,0.00060877844,0.04668291],"category_scores_gemma":[0.0023538892,0.0007338707,0.0013895624,0.002708503,0.00097008416,0.004675767,0.00241457,0.0017746371,0.014610939],"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.0005124768,0.0002359387,0.0006503979,0.0005296949,0.000069099704,0.00020017593,0.00043253796,0.017785648,0.009327182,0.46516284,0.06786403,0.43722996],"study_design_scores_gemma":[0.00012655312,0.00009643486,0.0002214068,0.00009419053,0.000045649456,0.00015664138,0.00017599172,0.103241764,0.01920547,0.82745206,0.0491295,0.000054369222],"about_ca_topic_score_codex":0.0017196211,"about_ca_topic_score_gemma":0.0058293757,"teacher_disagreement_score":0.04668291,"about_ca_system_score_codex":0.0011608563,"about_ca_system_score_gemma":0.0012223875,"threshold_uncertainty_score":0.15616995},"labels":[],"label_agreement":null},{"id":"W1606052289","doi":"10.1007/978-3-642-36976-6_14","title":"The Duality of State and Observation in Probabilistic Transition Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Observable; Probabilistic logic; Computer science; Duality (order theory); State (computer science); Dual (grammatical number); Transition system; Theoretical computer science; Markov chain; Observer (physics); Markov decision process; Representation (politics); Markov process; Artificial intelligence; Algorithm; Mathematics; Discrete mathematics; Machine learning; Physics","score_opus":0.03755661636585351,"score_gpt":0.26722489577164094,"score_spread":0.22966827940578743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606052289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009416035,0.002980779,0.9644564,0.0012781314,0.00036351918,0.000028475413,0.00012553055,0.00018771598,0.021163488],"genre_scores_gemma":[0.73790425,0.005340333,0.23542212,0.0006727487,0.0013321047,0.0002697368,0.00028923718,0.0002624431,0.018506873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973115,0.0011196333,0.00020937232,0.0005376101,0.0006422833,0.00017968201],"domain_scores_gemma":[0.9927027,0.0058542676,0.0003174634,0.000685768,0.0003002128,0.00013946767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028796855,0.0006814181,0.00092881924,0.000881704,0.00079470803,0.003548735,0.0014134484,0.0016474718,0.0032627736],"category_scores_gemma":[0.01015441,0.00094709604,0.0013920392,0.0011890619,0.0059291273,0.009609175,0.0026564924,0.0051530236,0.0006047379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017184071,0.000005498323,0.00008391649,0.00003856977,0.0000050657954,0.000032081854,0.00015030161,0.0028389655,0.0002858492,0.9886452,0.00029464162,0.0076027126],"study_design_scores_gemma":[0.000004803418,0.000010946294,0.00004953313,0.00001781724,0.000008184295,0.00004524108,0.000016710506,0.014521477,0.00030932296,0.98214334,0.0028648556,0.000007806121],"about_ca_topic_score_codex":0.00085719506,"about_ca_topic_score_gemma":0.0004820771,"teacher_disagreement_score":0.003548735,"about_ca_system_score_codex":0.001297864,"about_ca_system_score_gemma":0.00104683,"threshold_uncertainty_score":0.015229404},"labels":[],"label_agreement":null},{"id":"W1606069290","doi":"10.1007/978-3-540-92957-4_26","title":"A Self-governing Hybrid Model for Noise Removal","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Solver; Smoothing; Noise reduction; Convergence (economics); Nonlinear system; Filter (signal processing); Noise (video); Computer science; Algorithm; Stability (learning theory); Mathematical optimization; Rate of convergence; Image (mathematics); Image denoising; Mathematics; Control theory (sociology); Applied mathematics; Artificial intelligence; Computer vision; Machine learning","score_opus":0.02450594759376404,"score_gpt":0.2700781098056551,"score_spread":0.24557216221189107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606069290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014059012,0.00045077543,0.97558844,0.00027265478,0.00016778609,0.000027337692,0.00007690471,0.00020067066,0.009156478],"genre_scores_gemma":[0.8106751,0.0013325978,0.105620734,0.0005421101,0.0002368955,0.000257909,0.00034014165,0.00032084287,0.080673665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983037,0.00003771109,0.000008747114,0.000050289964,0.000053857377,0.000019041336],"domain_scores_gemma":[0.999741,0.000096209624,0.000040585513,0.000029059067,0.00007133591,0.000021695745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003658782,0.00061452435,0.0008910304,0.00036954417,0.00039912388,0.0011856395,0.001755637,0.0021958463,0.0029614123],"category_scores_gemma":[0.0008851017,0.0005476421,0.0008700192,0.00042533444,0.0009682651,0.0012847314,0.0012766649,0.0012404191,0.0009386574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004881793,0.00006115035,0.0002882672,0.00009957623,0.00006116878,0.00011739999,0.00009742152,0.89249957,0.008683268,0.08337639,0.0016155066,0.013051511],"study_design_scores_gemma":[0.0000031286415,0.000008688807,0.000033442015,0.0000026733344,0.00000619708,0.000015046839,0.000004051003,0.9948007,0.00024070809,0.004436069,0.0004426626,0.0000066553603],"about_ca_topic_score_codex":0.0027509308,"about_ca_topic_score_gemma":0.0025659585,"teacher_disagreement_score":0.0029614123,"about_ca_system_score_codex":0.00045496275,"about_ca_system_score_gemma":0.00049209676,"threshold_uncertainty_score":0.009906948},"labels":[],"label_agreement":null},{"id":"W1606075350","doi":"10.1007/978-3-540-30139-4_121","title":"Workshop on Analyzing Student-Tutor Interaction Logs to Improve Educational Outcomes","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Learning Partnership","funders":"","keywords":"TUTOR; Computer science; Educational software; Software; Human–computer interaction; Multimedia; Data science; Programming language","score_opus":0.01670808459773686,"score_gpt":0.3226592891766489,"score_spread":0.305951204578912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606075350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42953932,0.00460494,0.48123878,0.01073758,0.0035180487,0.002130171,0.008844356,0.020061499,0.039325375],"genre_scores_gemma":[0.68002003,0.0013113847,0.25148466,0.0015013894,0.0005578277,0.0008826734,0.006114914,0.00092898647,0.05719817],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997804,0.0009393665,0.00015660992,0.00034774138,0.0005949832,0.00015724027],"domain_scores_gemma":[0.990166,0.003901915,0.00045836222,0.0015780707,0.0031053305,0.0007903884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005251346,0.0010718125,0.0008661823,0.0013837445,0.00063853106,0.0024494322,0.0018759096,0.0013132072,0.004261947],"category_scores_gemma":[0.009132667,0.00028542755,0.0008857867,0.0011385964,0.00040766675,0.0014473654,0.0018093651,0.0012665289,0.0024388663],"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.00111389,0.0039216536,0.021682777,0.0002956398,0.0002453894,0.0002058375,0.0018693049,0.003451661,0.02429321,0.0014166433,0.052764095,0.88874],"study_design_scores_gemma":[0.000996309,0.0107633695,0.24090824,0.0013581665,0.0021001718,0.00082452805,0.0072503653,0.21106146,0.29454127,0.017486885,0.21225466,0.00045457922],"about_ca_topic_score_codex":0.005041282,"about_ca_topic_score_gemma":0.0069501773,"teacher_disagreement_score":0.005251346,"about_ca_system_score_codex":0.00055492984,"about_ca_system_score_gemma":0.0014454735,"threshold_uncertainty_score":0.027772129},"labels":[],"label_agreement":null},{"id":"W1606102547","doi":"10.1007/978-3-540-88030-1_37","title":"Visualizing Software Architectural Design Decisions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Visualization; Computer science; Listing (finance); Software; Information visualization; Software engineering; Set (abstract data type); Software visualization; Architecture; Software architecture; Data science; Software development; Data mining; Software construction; Programming language","score_opus":0.04639195948408347,"score_gpt":0.2914299093787881,"score_spread":0.24503794989470462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606102547","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.13088162,0.0023125152,0.7825639,0.0015295859,0.00019318223,0.0001339384,0.0035286658,0.029856153,0.04900041],"genre_scores_gemma":[0.43049878,0.0022036994,0.5399114,0.00011149665,0.00007364786,0.0001300445,0.0047066757,0.004245213,0.018119024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996606,0.00010462722,0.000023044762,0.00006538805,0.00011554491,0.000030739408],"domain_scores_gemma":[0.99858,0.00074615446,0.00014442878,0.00022021648,0.00021387167,0.000095394615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060220575,0.0012551217,0.00042282316,0.0024447355,0.0005525608,0.0036725944,0.0007571295,0.0008534636,0.01589191],"category_scores_gemma":[0.0031628474,0.00078087556,0.0006461897,0.0021235612,0.00031988844,0.0029167149,0.0011297147,0.0012081336,0.0022142355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038805965,0.00018580494,0.00873447,0.0008471663,0.00009075987,0.0007310416,0.0055665285,0.066957474,0.045553874,0.114374734,0.05420122,0.70236886],"study_design_scores_gemma":[0.000088084664,0.00016716088,0.008065704,0.00051678723,0.00015139017,0.00087538233,0.0026285825,0.57720476,0.03229142,0.1400696,0.2377798,0.00016130423],"about_ca_topic_score_codex":0.0036905904,"about_ca_topic_score_gemma":0.007979543,"teacher_disagreement_score":0.01589191,"about_ca_system_score_codex":0.000615366,"about_ca_system_score_gemma":0.00062237727,"threshold_uncertainty_score":0.053163707},"labels":[],"label_agreement":null},{"id":"W1606166759","doi":"10.1007/978-3-642-04138-9_22","title":"Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Base (topology); Binary number; Elliptic curve; Scalar (mathematics); Mathematics; Representation (politics); Integer (computer science); Point (geometry); Algorithm; Multiplication (music); Multiplication algorithm; Set (abstract data type); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.01392801273236698,"score_gpt":0.23830948094146565,"score_spread":0.22438146820909866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606166759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026032353,0.0016818034,0.92728144,0.0008387717,0.0006420126,0.00017438184,0.00009037205,0.001961751,0.041296992],"genre_scores_gemma":[0.30862466,0.0023262114,0.65164673,0.0002538071,0.00084575906,0.0002271236,0.00045046175,0.00071021327,0.034915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986688,0.00033131073,0.00008543393,0.00019412108,0.0005627581,0.00015754429],"domain_scores_gemma":[0.99942744,0.00011251125,0.000034269546,0.00021074785,0.0001739334,0.000041110514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739122,0.001223097,0.0014470519,0.002245234,0.00094147294,0.0019363473,0.000965766,0.0010579071,0.006998667],"category_scores_gemma":[0.002596659,0.0005470875,0.0008158731,0.0028269903,0.001202027,0.005361755,0.0028170752,0.00214123,0.004531343],"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.00045787258,0.00017144272,0.0005784862,0.0002915663,0.00008174516,0.00025449158,0.00021585468,0.006696356,0.026241174,0.44469932,0.013001244,0.5073104],"study_design_scores_gemma":[0.00033966493,0.00056500983,0.0005879063,0.00022419223,0.00014665286,0.0019887495,0.00013125145,0.07905382,0.07547348,0.68387306,0.15742907,0.00018703223],"about_ca_topic_score_codex":0.00015294178,"about_ca_topic_score_gemma":0.00016994661,"teacher_disagreement_score":0.006998667,"about_ca_system_score_codex":0.00062959234,"about_ca_system_score_gemma":0.0009157713,"threshold_uncertainty_score":0.023412824},"labels":[],"label_agreement":null},{"id":"W1606170621","doi":"10.1007/11751113_12","title":"Aspects-Classes Integration Testing Strategy: An Incremental Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Unit testing; Integration testing; Object-oriented programming; Software engineering; Programming language; Aspect-oriented programming; Software testing; White-box testing; Software; Test strategy; Test case; Software development; Software construction; Machine learning","score_opus":0.06751752389846226,"score_gpt":0.2935742514626894,"score_spread":0.22605672756422712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606170621","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.057906725,0.00019294843,0.91617525,0.00049512205,0.00007731392,0.00077472057,0.00018707589,0.00887791,0.015312859],"genre_scores_gemma":[0.33522943,0.00015555733,0.65429014,0.00034468123,0.0000477354,0.0003305634,0.0007240952,0.0014398417,0.00743794],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99597496,0.00096045167,0.0002532864,0.0006310556,0.0018571039,0.00032319876],"domain_scores_gemma":[0.99100035,0.00334673,0.0004815416,0.0028910232,0.0019355842,0.00034482626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002887745,0.0015152559,0.0008998428,0.0024512142,0.00082409603,0.0020224806,0.0039104675,0.001447701,0.0060846894],"category_scores_gemma":[0.011342272,0.0009896683,0.0013108454,0.0011754647,0.0010707709,0.0036563464,0.0030663991,0.0019970702,0.0016909675],"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.0005498774,0.0015364119,0.010732055,0.00042218,0.00017784497,0.00085148687,0.0013312665,0.013578127,0.07365419,0.033584647,0.008477577,0.85510427],"study_design_scores_gemma":[0.00041351913,0.0018403851,0.014146475,0.00040746157,0.0014555727,0.0038048457,0.001457968,0.6326322,0.19624239,0.094516024,0.05274225,0.00034094366],"about_ca_topic_score_codex":0.0023114053,"about_ca_topic_score_gemma":0.004658381,"teacher_disagreement_score":0.0060846894,"about_ca_system_score_codex":0.0006404784,"about_ca_system_score_gemma":0.0028142277,"threshold_uncertainty_score":0.020355284},"labels":[],"label_agreement":null},{"id":"W160618764","doi":"10.1007/978-3-642-21484-4_15","title":"Using Diffusive Load Balancing to Improve Performance of Peer-to-Peer Systems for Hosting Services","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Overlay; Peer-to-peer; Load balancing (electrical power); Distributed computing; Variance (accounting); Overlay network; Computer network; Node (physics); Resource (disambiguation); Service (business); Homogeneous; Shared resource; The Internet; World Wide Web; Operating system","score_opus":0.023627826973048383,"score_gpt":0.25378689960163825,"score_spread":0.23015907262858987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160618764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1341211,0.004523376,0.84237534,0.0010796993,0.00089420285,0.00022111007,0.00011307842,0.0058224946,0.010849604],"genre_scores_gemma":[0.8872489,0.0012470589,0.10473543,0.00019407515,0.0003371014,0.0000961585,0.00015314297,0.00029329638,0.005694832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993012,0.00015231331,0.00004358455,0.00011762825,0.00027428425,0.00011098088],"domain_scores_gemma":[0.99814355,0.0008998056,0.00009125266,0.00029826633,0.00043616196,0.00013094534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011417555,0.0009608622,0.0010074726,0.0008557282,0.0014358656,0.0018578618,0.0023698988,0.0008964117,0.0026958496],"category_scores_gemma":[0.004908549,0.00042466473,0.00027459417,0.0011973531,0.0006354486,0.0022698909,0.0016596224,0.0016336443,0.0008571375],"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.001218117,0.00053249655,0.0017476832,0.00058361614,0.00016492984,0.0003216965,0.0008625769,0.3017319,0.17395236,0.046272904,0.020204514,0.45240718],"study_design_scores_gemma":[0.00007445193,0.0001928199,0.00033363703,0.000018816876,0.000059068843,0.00015287446,0.00008402536,0.95243204,0.02246262,0.017257731,0.0068969927,0.000035004075],"about_ca_topic_score_codex":0.0019994997,"about_ca_topic_score_gemma":0.0031712865,"teacher_disagreement_score":0.0026958496,"about_ca_system_score_codex":0.0012153815,"about_ca_system_score_gemma":0.00087734207,"threshold_uncertainty_score":0.00901854},"labels":[],"label_agreement":null},{"id":"W1606355240","doi":"10.1007/11548706_59","title":"A Scheme for Inference Problems Using Rough Sets and Entropy","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Lakehead University","funders":"","keywords":"Computer science; Rough set; Inference; Entropy (arrow of time); Scheme (mathematics); Data mining; Compromise; Information security; Artificial intelligence; Computer security; Mathematics","score_opus":0.03951176256862548,"score_gpt":0.2779196420016781,"score_spread":0.23840787943305264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606355240","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.0009261633,0.00010206157,0.99732614,0.00018369434,0.00006472034,0.00005382176,0.000050777835,0.00012239623,0.0011702102],"genre_scores_gemma":[0.036591858,0.00024836714,0.95972675,0.00010209282,0.000158501,0.00023699741,0.00016075016,0.00005691829,0.0027178072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957904,0.0014991633,0.0005723943,0.0006834065,0.0012863467,0.0001682658],"domain_scores_gemma":[0.9953135,0.0026516288,0.00016679603,0.0011551295,0.00056596193,0.00014692589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007740635,0.0008722911,0.0021651757,0.0025327129,0.0021594975,0.0046624443,0.0039328677,0.0023981004,0.008207822],"category_scores_gemma":[0.013164094,0.00093004666,0.0036239056,0.0029761458,0.0035584436,0.009850028,0.0049597495,0.004185808,0.0019237193],"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.000049754224,0.000027518221,0.00010491655,0.00012337093,0.000052011164,0.00008109542,0.0002504785,0.015375579,0.0008587689,0.9227078,0.0017666509,0.05860206],"study_design_scores_gemma":[0.000025612686,0.00003068362,0.000058735022,0.000031195425,0.000048833677,0.000052407326,0.000033084452,0.106893614,0.00066351023,0.8864794,0.0056544263,0.000028528255],"about_ca_topic_score_codex":0.0015951517,"about_ca_topic_score_gemma":0.0016360157,"teacher_disagreement_score":0.008207822,"about_ca_system_score_codex":0.0015929594,"about_ca_system_score_gemma":0.0015403918,"threshold_uncertainty_score":0.040936887},"labels":[],"label_agreement":null},{"id":"W1606363966","doi":"10.1007/978-3-540-79456-1_6","title":"On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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 Waterloo","funders":"","keywords":"Elliptic curve; Prime (order theory); Embedding; Order (exchange); Diophantine equation; Mathematics; Discriminant; Schoof's algorithm; Heuristic; Edwards curve; Discrete mathematics; Computer science; Pure mathematics; Combinatorics; Mathematical optimization; Quarter period; Artificial intelligence","score_opus":0.011372701910279307,"score_gpt":0.22806061472064015,"score_spread":0.21668791281036084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606363966","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26130772,0.012848785,0.067705356,0.003929032,0.0023283106,0.00009273071,0.00046245244,0.00032972856,0.65099597],"genre_scores_gemma":[0.72560924,0.011569447,0.014976368,0.000480764,0.0019802554,0.00008124894,0.0007011552,0.0003067941,0.24429479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995621,0.00007420806,0.000017498169,0.000090354486,0.00013996566,0.00011578645],"domain_scores_gemma":[0.9995443,0.00015901994,0.000053317457,0.00009688948,0.00006992131,0.00007658065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037605612,0.0014304734,0.0010052397,0.00173686,0.002130702,0.0029762704,0.0007972262,0.0010878496,0.012119547],"category_scores_gemma":[0.0012710692,0.00069026346,0.00081630197,0.0021512532,0.00300507,0.0046597123,0.0022771962,0.0026097577,0.003117654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008684681,0.000031037824,0.0002535886,0.00009569791,0.0000084579615,0.0002404304,0.0005610384,0.0023473029,0.0011678952,0.96706575,0.0065830895,0.021558903],"study_design_scores_gemma":[0.000012100613,0.000025754076,0.00034791636,0.000047334135,0.000007686697,0.00019671049,0.00012078345,0.001789079,0.00051593943,0.97948974,0.01743415,0.000012666443],"about_ca_topic_score_codex":0.00083293504,"about_ca_topic_score_gemma":0.0007501821,"teacher_disagreement_score":0.012119547,"about_ca_system_score_codex":0.0013483866,"about_ca_system_score_gemma":0.0006024055,"threshold_uncertainty_score":0.040543973},"labels":[],"label_agreement":null},{"id":"W1606460608","doi":"10.1007/978-3-642-04271-3_42","title":"Vibro-Elastography for Visualization of the Prostate Region: Method Evaluation","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency; University of British Columbia","funders":"National Cancer Institute; BC Cancer Agency; National Institutes of Health","keywords":"Elastography; Visualization; Computer science; Prostate; Contrast (vision); Modality (human–computer interaction); Contrast-to-noise ratio; Segmentation; Computer vision; Artificial intelligence; Contrast-enhanced ultrasound; Prostate gland; Radiology; Ultrasound; Medicine; Image (mathematics); Image quality","score_opus":0.018528980683532113,"score_gpt":0.330981888704586,"score_spread":0.3124529080210539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606460608","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.36294633,0.038736448,0.5857659,0.0007878571,0.0003135332,0.0018155959,0.0010152888,0.0012867629,0.0073322365],"genre_scores_gemma":[0.69653887,0.011230881,0.2858838,0.0002695116,0.00019134814,0.00060412916,0.00053499406,0.0010666712,0.0036797891],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9901736,0.0058493074,0.0006640761,0.00063901534,0.0024187465,0.00025526984],"domain_scores_gemma":[0.95069885,0.03701923,0.0017484049,0.0029750005,0.0067676194,0.0007909501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024581363,0.0018347165,0.0013176936,0.0050608604,0.0006714586,0.002143697,0.0014513328,0.0015971937,0.005179654],"category_scores_gemma":[0.036909893,0.0006728971,0.00093954004,0.0014817098,0.0007236024,0.001192183,0.0018802206,0.0006800295,0.001124812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011253303,0.0010424521,0.09276059,0.0028345136,0.0010861579,0.0008674459,0.001453616,0.009947673,0.0833037,0.0013170887,0.0013253468,0.7928082],"study_design_scores_gemma":[0.0020810622,0.022208923,0.2934625,0.0017709519,0.004267292,0.030117253,0.0036608938,0.35718736,0.24817216,0.007060342,0.028874177,0.0011370507],"about_ca_topic_score_codex":0.002045866,"about_ca_topic_score_gemma":0.0034615265,"teacher_disagreement_score":0.024581363,"about_ca_system_score_codex":0.0006370516,"about_ca_system_score_gemma":0.0012551222,"threshold_uncertainty_score":0.13000017},"labels":[],"label_agreement":null},{"id":"W1606497348","doi":"10.1007/11821045_52","title":"Automatic Color-Texture Image Segmentation by Using Active Contours","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Initialization; Image segmentation; Image texture; Segmentation; Scale-space segmentation; Pattern recognition (psychology); Region growing; Texture (cosmology); Boundary (topology); Segmentation-based object categorization; Color image; Image (mathematics); Image processing; Mathematics","score_opus":0.014012591133777228,"score_gpt":0.26634799199837567,"score_spread":0.25233540086459844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606497348","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.012756579,0.00048384612,0.982592,0.00006930785,0.000063460015,0.000075307755,0.000085608255,0.0021062454,0.0017675979],"genre_scores_gemma":[0.13338237,0.00067877973,0.86148345,0.000106252046,0.00006935296,0.00010426175,0.0003051868,0.0009383854,0.002931895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996051,0.000040160085,0.000017699793,0.00009287543,0.0001723942,0.000071702685],"domain_scores_gemma":[0.99951434,0.00018629606,0.000049876264,0.00008978927,0.00012965401,0.000030059951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055914413,0.0012100863,0.0014948238,0.002422538,0.00046249025,0.0018038403,0.0013733984,0.0010218988,0.0029652242],"category_scores_gemma":[0.0011160834,0.0009967207,0.0012183251,0.0021358666,0.00064010953,0.0013613714,0.000793156,0.0010029757,0.0013761728],"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.0004977323,0.00012318665,0.00059995224,0.0002860163,0.00007924462,0.00013009824,0.00011784353,0.030668715,0.31096327,0.00455933,0.0032083131,0.6487663],"study_design_scores_gemma":[0.000058939146,0.0001296056,0.0019500335,0.000046484136,0.0001064867,0.00044390856,0.00005732497,0.80394036,0.17576435,0.008492827,0.008939837,0.00006973884],"about_ca_topic_score_codex":0.0025197517,"about_ca_topic_score_gemma":0.0029866458,"teacher_disagreement_score":0.0029652242,"about_ca_system_score_codex":0.0005444353,"about_ca_system_score_gemma":0.0006548639,"threshold_uncertainty_score":0.009919643},"labels":[],"label_agreement":null},{"id":"W1606514821","doi":"10.1007/978-3-540-85553-8_15","title":"Assessment of Real-Time Software Specifications Quality Using COSMIC-FFP","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis 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":"Concordia University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Software requirements specification; Software; Software requirements; Software construction; Software system; Software development; Functional requirement; Verification and validation; Software engineering; Reliability engineering; Operating system; Engineering","score_opus":0.08012313928811668,"score_gpt":0.34996270264938456,"score_spread":0.2698395633612679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606514821","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.7680711,0.0004845145,0.21161547,0.00010735904,0.000039440798,0.00013042595,0.0018878693,0.004767149,0.01289659],"genre_scores_gemma":[0.9120253,0.000092222406,0.084801875,0.000010967386,0.000006178134,0.00006160216,0.0018123373,0.00017007798,0.0010195331],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99682033,0.000613244,0.0001616421,0.00027965952,0.0019442713,0.00018081299],"domain_scores_gemma":[0.98803294,0.0050298856,0.0010127595,0.0016642187,0.0040364955,0.0002235835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023367116,0.00074822083,0.00045767354,0.0055922847,0.0003927748,0.001033268,0.00089982396,0.0007293501,0.0025050663],"category_scores_gemma":[0.012408853,0.00023480025,0.0009171867,0.0045254235,0.00047409625,0.0010010708,0.0006136757,0.00040535908,0.00037903208],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007725243,0.00025565634,0.089172795,0.00065883005,0.00035472275,0.000705102,0.0009428354,0.35321763,0.031563267,0.013619973,0.004707847,0.50402886],"study_design_scores_gemma":[0.00002968082,0.0003604052,0.04828717,0.000055757097,0.00012778673,0.0005885488,0.0002472028,0.9220257,0.022330794,0.003398992,0.002492808,0.000055139888],"about_ca_topic_score_codex":0.0063965768,"about_ca_topic_score_gemma":0.005240795,"teacher_disagreement_score":0.0063965768,"about_ca_system_score_codex":0.0011411324,"about_ca_system_score_gemma":0.00096552353,"threshold_uncertainty_score":0.012718737},"labels":[],"label_agreement":null},{"id":"W1606540187","doi":"10.1007/978-3-540-71209-1_4","title":"A Reachability Predicate for Analyzing Low-Level Software","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Computer science; Programming language; Predicate abstraction; Pointer (user interface); Heap (data structure); Predicate (mathematical logic); Separation logic; Theoretical computer science; Artificial intelligence; Model checking","score_opus":0.0468325491981635,"score_gpt":0.2779686562504431,"score_spread":0.2311361070522796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606540187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009537532,0.00016571644,0.98469007,0.00012257608,0.000037388087,0.00009840571,0.00030613103,0.0027255332,0.0023166547],"genre_scores_gemma":[0.2568659,0.00040320045,0.7365509,0.00020353777,0.00015146371,0.00038158288,0.0019039531,0.00070366374,0.0028358514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980033,0.00035276858,0.00017021704,0.0004619779,0.00071604585,0.0002955793],"domain_scores_gemma":[0.9961643,0.0026570458,0.0002010661,0.0006612162,0.00021803382,0.00009830957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023248838,0.0012765232,0.0012789584,0.002963398,0.001410349,0.0028053108,0.002377764,0.0017756078,0.003268942],"category_scores_gemma":[0.0049521313,0.0008418458,0.0031047314,0.0024202461,0.0035505532,0.0068256743,0.0028832762,0.0033181752,0.0011048444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028943323,0.0003231834,0.0029554695,0.00068756193,0.00013112872,0.0005372653,0.0006204677,0.068807654,0.024715543,0.6738346,0.006923469,0.22017424],"study_design_scores_gemma":[0.00003882145,0.00017759735,0.00083940953,0.00010564546,0.00018340586,0.00026637013,0.00009787983,0.4046944,0.01963594,0.5660957,0.0077985716,0.00006618277],"about_ca_topic_score_codex":0.0026946766,"about_ca_topic_score_gemma":0.0024424908,"teacher_disagreement_score":0.003268942,"about_ca_system_score_codex":0.0013321171,"about_ca_system_score_gemma":0.001679044,"threshold_uncertainty_score":0.012295306},"labels":[],"label_agreement":null},{"id":"W1606543899","doi":"10.1007/978-3-540-74466-5_62","title":"A Joint Data and Computation Scheduling Algorithm for the Grid","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Queen's University","funders":"","keywords":"Computer science; Computation; Grid; Adaptability; Scheduling (production processes); Distributed computing; Grid computing; Fair-share scheduling; Dynamic priority scheduling; Algorithm; Data grid; Mathematical optimization; Schedule; Operating system","score_opus":0.06882150409163507,"score_gpt":0.30431685927870983,"score_spread":0.23549535518707476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606543899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010867764,0.00014954702,0.9839125,0.000183185,0.0001279867,0.000057451332,0.00009680432,0.0022579313,0.0023468428],"genre_scores_gemma":[0.13493705,0.00012128369,0.859127,0.00008405484,0.000055328437,0.00014705364,0.00030056117,0.00042830306,0.004799302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.000082240746,0.000028516068,0.000082202714,0.0001371323,0.00007573851],"domain_scores_gemma":[0.9993723,0.00015445355,0.000027189088,0.00022022502,0.00014465743,0.000081197875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084743055,0.0005825729,0.0009838814,0.00053249137,0.0010217845,0.0010097245,0.0019468765,0.00063157355,0.00588555],"category_scores_gemma":[0.0017901089,0.00047510854,0.0006618668,0.0014909847,0.0005799952,0.0012625349,0.0018470733,0.0011685225,0.001525535],"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.0012063441,0.00025900366,0.0010777334,0.00017703157,0.00010809262,0.00013916146,0.00019446155,0.3900327,0.015247823,0.061081428,0.024625184,0.505851],"study_design_scores_gemma":[0.00015346958,0.000056049932,0.000120949575,0.0000050439503,0.000018858322,0.000035845864,0.000026713864,0.9624311,0.0026586382,0.028859382,0.0056225755,0.000011353749],"about_ca_topic_score_codex":0.0078157885,"about_ca_topic_score_gemma":0.008632495,"teacher_disagreement_score":0.0078157885,"about_ca_system_score_codex":0.00084679766,"about_ca_system_score_gemma":0.0021790098,"threshold_uncertainty_score":0.019689083},"labels":[],"label_agreement":null},{"id":"W160657190","doi":"10.1007/978-3-540-24767-8_72","title":"Fast Fourier Transform for Option Pricing: Improved Mathematical Modeling and Design of Efficient Parallel Algorithm","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fast Fourier transform; Computer science; Computation; Algorithm; Parallel computing; Valuation of options; Prime-factor FFT algorithm; Cooley–Tukey FFT algorithm; Grid; Parallel algorithm; Selection (genetic algorithm); Fourier transform; Fourier analysis; Mathematics; Artificial intelligence","score_opus":0.030940058542374423,"score_gpt":0.23015785042656775,"score_spread":0.19921779188419333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160657190","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.0018977214,0.00009155399,0.9971854,0.00006399282,0.000017352293,0.000012629227,0.000016183745,0.00012002579,0.0005951796],"genre_scores_gemma":[0.13792442,0.0005114646,0.8579856,0.00009104162,0.000115706986,0.00022871453,0.0001457285,0.00027050014,0.0027267125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992567,0.00035530826,0.000033475815,0.000074433556,0.0002386617,0.00004140233],"domain_scores_gemma":[0.9976931,0.001391108,0.00013266914,0.0003100807,0.00041526242,0.000057786987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018473751,0.0008539435,0.0010069626,0.000583596,0.0004246188,0.0011824465,0.0013436615,0.0011892618,0.0037366573],"category_scores_gemma":[0.0073703555,0.0006338276,0.00072001654,0.0011794514,0.00065533275,0.001967667,0.0008091196,0.0019736409,0.0011360039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022779651,0.00011318484,0.0004417319,0.00012297832,0.00004718921,0.00007158773,0.00005456661,0.68145996,0.0077682077,0.1908273,0.0031510878,0.11571441],"study_design_scores_gemma":[0.000008393637,0.000008145717,0.000018421159,0.0000027193398,0.0000029263986,0.000011299054,0.00000125044,0.98943734,0.00051122886,0.009524076,0.00047077122,0.0000034154123],"about_ca_topic_score_codex":0.0012967489,"about_ca_topic_score_gemma":0.0014342226,"teacher_disagreement_score":0.0037366573,"about_ca_system_score_codex":0.00067310967,"about_ca_system_score_gemma":0.0011080907,"threshold_uncertainty_score":0.012500346},"labels":[],"label_agreement":null},{"id":"W1606605033","doi":"10.1007/978-3-642-15399-0_21","title":"Analyzing Computer Game Narratives","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Narrative; Computer science; Compiler; Computer game; Scalability; Reachability; Variety (cybernetics); Game design; Multimedia; Human–computer interaction; Theoretical computer science; Artificial intelligence; Programming language; Linguistics","score_opus":0.025797147146942364,"score_gpt":0.27898889585031966,"score_spread":0.2531917487033773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606605033","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.74382013,0.0011080593,0.14281209,0.0015175475,0.00011299224,0.00052546745,0.005965794,0.0013049039,0.102833],"genre_scores_gemma":[0.9430969,0.00030961048,0.041154783,0.0000541828,0.000013177889,0.00012774416,0.005120677,0.00020854628,0.009914552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869883,0.00061065063,0.00007599162,0.0002222079,0.00030118163,0.00009113639],"domain_scores_gemma":[0.9943538,0.0042622965,0.00037423155,0.00034944178,0.0005394117,0.00012080001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009901696,0.00043402935,0.00017899537,0.0039998507,0.000962053,0.0038235206,0.00065499113,0.00044372704,0.007159432],"category_scores_gemma":[0.011985015,0.0002746502,0.0002925793,0.0028494624,0.00090990914,0.004610075,0.0014795709,0.00073422084,0.0012926488],"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.00042623465,0.00036040085,0.09093931,0.00069060194,0.00012742996,0.001583053,0.11160356,0.007277746,0.0107494285,0.28137073,0.026381241,0.46849018],"study_design_scores_gemma":[0.00004367951,0.00013668039,0.0680381,0.00084783457,0.0001508642,0.00179289,0.21114789,0.17421526,0.017842384,0.19863853,0.32701972,0.00012616938],"about_ca_topic_score_codex":0.010647447,"about_ca_topic_score_gemma":0.015267357,"teacher_disagreement_score":0.010647447,"about_ca_system_score_codex":0.001539847,"about_ca_system_score_gemma":0.0010495931,"threshold_uncertainty_score":0.023950696},"labels":[],"label_agreement":null},{"id":"W1606639004","doi":"10.1007/11533962_17","title":"A Framework for Information Integration with Uncertainty","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Tuple; SQL; Relational algebra; Information integration; Set (abstract data type); Relational database; Relational model; Relational database management system; Function (biology); Relation (database); Rewriting; Data integration; Theoretical computer science; Data mining; Database; Programming language; Mathematics","score_opus":0.018254982024474807,"score_gpt":0.25801499436134984,"score_spread":0.23976001233687502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606639004","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.0004966519,0.0005520862,0.9919635,0.0004499,0.00007107987,0.00005906243,0.00009221757,0.00048337333,0.0058320602],"genre_scores_gemma":[0.043102533,0.0010557267,0.9496097,0.00025141053,0.00019160772,0.00030191307,0.00044698824,0.000234274,0.0048058718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564713,0.0013681538,0.00048333834,0.0006027764,0.0016625314,0.00023613767],"domain_scores_gemma":[0.99782664,0.00097606576,0.00012307007,0.0005328084,0.00045584686,0.00008557422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005170166,0.0014234154,0.0017880889,0.0037801098,0.0020609864,0.0075015053,0.003894619,0.0025948233,0.008671402],"category_scores_gemma":[0.008552821,0.001284644,0.0035388612,0.00529043,0.0035703732,0.01342079,0.006408003,0.0032880765,0.002746897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017063283,0.000018974553,0.000086308355,0.00012065705,0.000058167316,0.00013821913,0.00022041019,0.009452566,0.00032615734,0.94442004,0.0027991326,0.042342212],"study_design_scores_gemma":[0.000010445099,0.000010063902,0.00003445468,0.000069209585,0.00005588613,0.000089124886,0.00006356579,0.054718826,0.00062049786,0.91318005,0.031127878,0.000020045441],"about_ca_topic_score_codex":0.0054726005,"about_ca_topic_score_gemma":0.003954534,"teacher_disagreement_score":0.008671402,"about_ca_system_score_codex":0.0018445441,"about_ca_system_score_gemma":0.002017939,"threshold_uncertainty_score":0.029008746},"labels":[],"label_agreement":null},{"id":"W1606726465","doi":"10.1007/10722777_15","title":"Conversation Oriented Programming for Agent Interaction","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Conversation; Abstraction; Programming language; Human–computer interaction; Artificial intelligence; Linguistics","score_opus":0.0263380013958631,"score_gpt":0.27009133066383817,"score_spread":0.24375332926797508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606726465","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.0010517496,0.0008646544,0.96682703,0.00048164403,0.00016700267,0.00006145789,0.000061357685,0.00084770244,0.029637428],"genre_scores_gemma":[0.0984231,0.0019007749,0.8351444,0.00051985536,0.00027677615,0.0008284448,0.0004000174,0.0011177047,0.061388876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988256,0.00060826854,0.000060376264,0.00014499848,0.0002589185,0.0001017636],"domain_scores_gemma":[0.9993197,0.0004320903,0.00002470601,0.00010945942,0.00007963661,0.00003451643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189037,0.0012970095,0.0010126473,0.0005311741,0.0012543937,0.0029203158,0.0020803171,0.0016080339,0.017643109],"category_scores_gemma":[0.002162968,0.0009846025,0.0010546503,0.0011127499,0.0016650226,0.0038604708,0.0018566683,0.0038374,0.0048434054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002380579,0.000032878535,0.00003439052,0.00012740724,0.000013774633,0.000048395796,0.00039329936,0.004189326,0.00063038233,0.9326739,0.009376118,0.05245625],"study_design_scores_gemma":[0.00002609203,0.000015907886,0.000029211407,0.000070658345,0.000025316363,0.000083979154,0.00010873121,0.04887895,0.0012798059,0.86746484,0.08199884,0.000017669052],"about_ca_topic_score_codex":0.0018235041,"about_ca_topic_score_gemma":0.0015283019,"teacher_disagreement_score":0.017643109,"about_ca_system_score_codex":0.0010837668,"about_ca_system_score_gemma":0.0008097339,"threshold_uncertainty_score":0.05902213},"labels":[],"label_agreement":null},{"id":"W1606763436","doi":"10.1007/978-3-642-15567-3_28","title":"A Continuous Max-Flow Approach to Potts Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":163,"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":"Potts model; Computer science; Simplex; Perimeter; Regular polygon; Computation; Flow (mathematics); Mathematical optimization; Algorithm; Mathematics; Combinatorics; Geometry; Statistical physics","score_opus":0.01228348521606565,"score_gpt":0.23347144439569484,"score_spread":0.2211879591796292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606763436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004873342,0.0005505878,0.979619,0.00071014266,0.00020370234,0.0000382098,0.00017666737,0.00017549527,0.013652832],"genre_scores_gemma":[0.5567391,0.0027047608,0.36266375,0.00070712465,0.0010129093,0.00041719043,0.00086193864,0.00063863833,0.07425462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995888,0.00017160928,0.000017824854,0.00007962084,0.00010171246,0.000040335988],"domain_scores_gemma":[0.99929786,0.0004014971,0.000046107725,0.00007356795,0.000103395796,0.00007755746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011938136,0.0009363172,0.0013873932,0.0008296718,0.0007600268,0.0019247265,0.0027579556,0.0019550824,0.010923085],"category_scores_gemma":[0.0038570522,0.00064129353,0.001418518,0.0011353635,0.0012896612,0.0035830732,0.0019827054,0.0033059462,0.0014464236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035925917,0.000041720043,0.00010617013,0.00007954717,0.00002679746,0.000072946415,0.000061751445,0.2693559,0.0005130354,0.7061956,0.005210604,0.018299952],"study_design_scores_gemma":[0.0000066358725,0.00001163524,0.000023754592,0.000007633517,0.000006670923,0.000013242407,0.0000071868067,0.72389317,0.00010466295,0.27399346,0.0019238075,0.000008131946],"about_ca_topic_score_codex":0.0036261894,"about_ca_topic_score_gemma":0.002357954,"teacher_disagreement_score":0.010923085,"about_ca_system_score_codex":0.0014920514,"about_ca_system_score_gemma":0.0011978123,"threshold_uncertainty_score":0.036541343},"labels":[],"label_agreement":null},{"id":"W1606774011","doi":"10.1007/978-3-540-30178-3_20","title":"Scalability, Security Technologies and Mobile Applications","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"National Research Council Canada","funders":"","keywords":"Scalability; Computer science; Computer security; Mobile agent; JADE (particle detector); Distributed computing; Operating system","score_opus":0.008782907072657395,"score_gpt":0.23086239928436483,"score_spread":0.22207949221170745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606774011","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017594315,0.3047166,0.12071238,0.019959379,0.0022993167,0.000119797034,0.00011847795,0.00090675347,0.53357303],"genre_scores_gemma":[0.43615127,0.19467437,0.06320276,0.0034353042,0.006658895,0.00066937355,0.000301625,0.00037932178,0.2945271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996176,0.000078365374,0.000016573511,0.00005172512,0.00019124565,0.00004452877],"domain_scores_gemma":[0.9992661,0.00050202856,0.000045864006,0.00006380437,0.00008060553,0.00004156909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203407,0.00087690784,0.0006071204,0.000980245,0.00069384446,0.0032969464,0.00063379674,0.0015597229,0.008616941],"category_scores_gemma":[0.0018865733,0.0005007488,0.00025021538,0.0017466189,0.0021293266,0.0066438345,0.0010250098,0.0021813386,0.0016353085],"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.00002974313,0.00007111691,0.00026371103,0.00037455026,0.000016247886,0.00015577064,0.0003840879,0.0040477705,0.0025720317,0.8068539,0.04353913,0.14169195],"study_design_scores_gemma":[0.000023080876,0.00005210938,0.000566876,0.00023569675,0.000018607801,0.00055997126,0.00031020117,0.010281011,0.00088142266,0.73651886,0.2505347,0.000017309445],"about_ca_topic_score_codex":0.00079179404,"about_ca_topic_score_gemma":0.0008695476,"teacher_disagreement_score":0.008616941,"about_ca_system_score_codex":0.0011173461,"about_ca_system_score_gemma":0.00061206176,"threshold_uncertainty_score":0.028826594},"labels":[],"label_agreement":null},{"id":"W1606888841","doi":"10.1007/3-540-44842-x_16","title":"An Algorithm for Determining the Controllers of Supervised Entities at the First and Second Levels: A Case Study with the Brazilian Central Bank","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Backtracking; Subroutine; Computer science; Algorithm; Automation; Process (computing); Computational complexity theory; Mathematical optimization; Mathematics; Programming language","score_opus":0.022599433767272428,"score_gpt":0.2451318771842228,"score_spread":0.2225324434169504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606888841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054335173,0.0001463314,0.93710357,0.0002800712,0.000033393728,0.00034177216,0.00045871723,0.003144992,0.004156062],"genre_scores_gemma":[0.21875665,0.00006402859,0.7769377,0.000053076303,0.000012520246,0.00019595475,0.0007971287,0.00014508655,0.0030377693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.00009980124,0.000048718346,0.00021415557,0.000108385204,0.00009994898],"domain_scores_gemma":[0.99810505,0.0010505251,0.00015305974,0.0001611074,0.00044581728,0.000084476844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012704742,0.0009198898,0.0010918649,0.0018851337,0.0015717436,0.0024578471,0.0019441821,0.0021891273,0.006478539],"category_scores_gemma":[0.0049188356,0.0005360837,0.0007668345,0.0012217718,0.00087651104,0.0016047026,0.0015390972,0.00096342206,0.0010437588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028206047,0.00025378534,0.012346206,0.00024560798,0.000100075675,0.00029033265,0.00075842347,0.25456995,0.007884936,0.03458001,0.00961017,0.6790784],"study_design_scores_gemma":[0.00006826729,0.000050018578,0.0011270507,0.000024907049,0.000044275144,0.00014220976,0.00032196526,0.9746932,0.0038029132,0.01735841,0.0023496014,0.000017214956],"about_ca_topic_score_codex":0.024898479,"about_ca_topic_score_gemma":0.03340334,"teacher_disagreement_score":0.024898479,"about_ca_system_score_codex":0.0016705475,"about_ca_system_score_gemma":0.004231483,"threshold_uncertainty_score":0.04950708},"labels":[],"label_agreement":null},{"id":"W1606932326","doi":"10.1007/11539506_55","title":"Fuzzy Sets Theory Based Region Merging for Robust Image Segmentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Weighting; Computer science; Artificial intelligence; Pattern recognition (psychology); Similarity (geometry); Image segmentation; Fuzzy set; Fuzzy logic; Image (mathematics); Segmentation; Data mining","score_opus":0.024032472384366885,"score_gpt":0.28435333846001914,"score_spread":0.26032086607565225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606932326","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.0030160313,0.00039818697,0.99549896,0.000029185358,0.000025440146,0.00003245904,0.00001593705,0.00019609572,0.0007877098],"genre_scores_gemma":[0.10862208,0.00061174604,0.8879222,0.00006859301,0.000070140006,0.00011691735,0.000115496485,0.00013912497,0.0023336953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989666,0.0001493328,0.00006227059,0.00021607388,0.000539349,0.00006634235],"domain_scores_gemma":[0.9993844,0.00027499153,0.000065727996,0.00007739172,0.00018322542,0.000014147596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012589043,0.0006597863,0.0014163206,0.0017536844,0.0005547997,0.0013022504,0.0019969873,0.0012849536,0.0021900972],"category_scores_gemma":[0.0019152345,0.00078703754,0.0015642382,0.0013451031,0.0009044313,0.0015531642,0.0010711199,0.0010825369,0.0007269636],"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.00040432357,0.00009557109,0.00035923664,0.0005725861,0.00026486456,0.0002215501,0.00030989025,0.20143147,0.16291827,0.038180165,0.0036797514,0.59156233],"study_design_scores_gemma":[0.000024965397,0.00011081281,0.00053817476,0.00004219374,0.00011168534,0.00027787755,0.000042816777,0.9223542,0.054035917,0.017071048,0.0053399936,0.000050233004],"about_ca_topic_score_codex":0.0021815475,"about_ca_topic_score_gemma":0.0018841694,"teacher_disagreement_score":0.0021900972,"about_ca_system_score_codex":0.0010687088,"about_ca_system_score_gemma":0.0006985522,"threshold_uncertainty_score":0.0077540874},"labels":[],"label_agreement":null},{"id":"W1606983609","doi":"10.1007/11612704_5","title":"A Real-Time Large Disparity Range Stereo-System Using FPGAs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":58,"is_retracted":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":"Subpixel rendering; Computer science; Field-programmable gate array; Computer vision; Range (aeronautics); Artificial intelligence; Gate array; Stereopsis; Stratix; Real-time computing; Stereo cameras; Frame rate; Computer hardware; Pixel","score_opus":0.01746429774824383,"score_gpt":0.26750983000470313,"score_spread":0.2500455322564593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606983609","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.112034276,0.0021019008,0.8035334,0.0004047691,0.0008456487,0.0008022874,0.0011012086,0.031051613,0.04812498],"genre_scores_gemma":[0.58063716,0.00068016414,0.39404714,0.0006045831,0.00020940095,0.00028588896,0.0008819868,0.0004682381,0.022185415],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997274,0.00003535993,0.000018638599,0.000058160396,0.00011210282,0.000048324102],"domain_scores_gemma":[0.9997546,0.000064881155,0.000015381185,0.0000421329,0.00008785664,0.00003517245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034262842,0.0007840415,0.0007493097,0.0008318872,0.00041284497,0.0006924846,0.0010650976,0.0006014268,0.016553495],"category_scores_gemma":[0.00038661293,0.00038460983,0.00022271661,0.00056501036,0.00016276263,0.00075422344,0.00050109834,0.00047907457,0.0029345027],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014644872,0.00022015221,0.0014448356,0.00053699303,0.00010950844,0.00057117076,0.00014223791,0.0063146623,0.38452175,0.0043902136,0.021767285,0.5785166],"study_design_scores_gemma":[0.0013838504,0.0036938628,0.011560949,0.00032018655,0.0004668627,0.005445281,0.00025181295,0.25678027,0.5853256,0.006164845,0.1283096,0.00029681032],"about_ca_topic_score_codex":0.0014731671,"about_ca_topic_score_gemma":0.0021334826,"teacher_disagreement_score":0.016553495,"about_ca_system_score_codex":0.0003306085,"about_ca_system_score_gemma":0.0004452836,"threshold_uncertainty_score":0.055376947},"labels":[],"label_agreement":null},{"id":"W1607036753","doi":"10.1007/978-3-642-24580-0_3","title":"Improved Usage Model for Web Application Reliability Testing","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Component (thermodynamics); Reliability (semiconductor); Markov model; Data mining; Reliability engineering; Machine learning","score_opus":0.04299277726514847,"score_gpt":0.2840944800349134,"score_spread":0.24110170276976492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607036753","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.021619828,0.00025449463,0.9682873,0.00023877298,0.000053081843,0.000093773466,0.00030321555,0.0016890569,0.0074604047],"genre_scores_gemma":[0.7872652,0.00053214154,0.19071731,0.0001738509,0.0001335269,0.0004919344,0.0007904628,0.0007739565,0.019121654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998445,0.00047724668,0.00010394527,0.00022362555,0.0005654423,0.0001847463],"domain_scores_gemma":[0.99671245,0.0014928109,0.00021144837,0.0004992776,0.0009949605,0.00008894361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014740468,0.0010308134,0.0010754183,0.0016997172,0.00047245887,0.0013678103,0.002934133,0.0014559327,0.006350877],"category_scores_gemma":[0.005335955,0.0005199542,0.0013486646,0.0012077418,0.0006151136,0.0030004065,0.0009939569,0.0015143681,0.0015190106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014705921,0.00022234055,0.0017484245,0.0001374274,0.00006349875,0.000358776,0.00017077854,0.83573323,0.004684521,0.0620951,0.0038706644,0.09076821],"study_design_scores_gemma":[0.000003165308,0.000010996158,0.000117100666,0.0000045642378,0.000012373586,0.000033682656,0.0000039389247,0.9928847,0.0002303628,0.006267188,0.00042710945,0.0000047623653],"about_ca_topic_score_codex":0.008278963,"about_ca_topic_score_gemma":0.0065386794,"teacher_disagreement_score":0.008278963,"about_ca_system_score_codex":0.0013273036,"about_ca_system_score_gemma":0.0012794287,"threshold_uncertainty_score":0.021245778},"labels":[],"label_agreement":null},{"id":"W1607292358","doi":"10.1007/978-3-642-14192-8_15","title":"On the Perception of Software Quality Requirements during the Project Lifecycle","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":33,"is_retracted":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":"Quality (philosophy); Perception; Software quality; Computer science; Application lifecycle management; Process management; Software engineering; Systems engineering; Software; Business; Engineering; Software development; Psychology; Programming language; Neuroscience; Philosophy","score_opus":0.03876068141847252,"score_gpt":0.3105810167737776,"score_spread":0.2718203353553051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607292358","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.9912549,0.0001065086,0.0020885493,0.00024050822,0.000005626213,0.000015574018,0.000018096493,0.000009259961,0.00626087],"genre_scores_gemma":[0.99866474,0.000069208465,0.00071094715,0.000028018456,0.0000028800387,0.000009418506,0.000030568706,0.000008458933,0.00047570842],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99753463,0.001149204,0.00010433076,0.00013266856,0.0008620555,0.00021715136],"domain_scores_gemma":[0.95387757,0.034570735,0.0056730234,0.00074881443,0.0034260852,0.0017037517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043999394,0.00016946763,0.00017139544,0.00072038616,0.00043725647,0.0015979283,0.0005258895,0.00089923386,0.0023388292],"category_scores_gemma":[0.03092973,0.00034488228,0.00029797124,0.000484386,0.00068065553,0.001492065,0.00089875335,0.0012309777,0.00024800748],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001551682,0.001087383,0.67277676,0.0003379206,0.000112306494,0.0010338225,0.15690407,0.0025716054,0.025315434,0.0070568174,0.0022579338,0.12899423],"study_design_scores_gemma":[0.000028235203,0.00056070834,0.9303888,0.00011155489,0.00003657163,0.00043981257,0.054816008,0.0071260235,0.0013405617,0.0024657384,0.0026184942,0.00006749274],"about_ca_topic_score_codex":0.0043361643,"about_ca_topic_score_gemma":0.003886527,"teacher_disagreement_score":0.0043999394,"about_ca_system_score_codex":0.0006934108,"about_ca_system_score_gemma":0.0005694149,"threshold_uncertainty_score":0.023269415},"labels":[],"label_agreement":null},{"id":"W1607308244","doi":"10.1007/978-3-540-27868-9_16","title":"An Optimal Probabilistic Graphical Model for Point Set Matching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Graphical model; Computer science; Probabilistic logic; Algorithm; Graph; Pairwise comparison; Theoretical computer science; Artificial intelligence","score_opus":0.019095337313483104,"score_gpt":0.25746983457008327,"score_spread":0.23837449725660015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607308244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063782185,0.00013737481,0.9893596,0.00038413212,0.000034534984,0.00009421062,0.00043645926,0.0004948845,0.0026804893],"genre_scores_gemma":[0.2931765,0.0009744509,0.68634564,0.00057568814,0.00024039655,0.0008188349,0.0023812077,0.0007777395,0.01470962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662507,0.0010292359,0.00017615841,0.0009865764,0.0008536132,0.00032932262],"domain_scores_gemma":[0.9955882,0.0022874863,0.0003919826,0.0010317621,0.0004592055,0.00024137813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531805,0.0013726844,0.0036799756,0.0022397107,0.001204661,0.0035734859,0.0078474535,0.005095236,0.011794543],"category_scores_gemma":[0.012968024,0.0021328288,0.0031128828,0.0049622618,0.002047436,0.008727112,0.004522484,0.0038555409,0.0028114028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021617745,0.0001780484,0.00045416804,0.00022399762,0.00007786894,0.000101770056,0.00014781834,0.598474,0.0014342781,0.3254094,0.006666546,0.06661594],"study_design_scores_gemma":[0.000027580725,0.000018346827,0.000058484475,0.000014175937,0.000023176444,0.000035577992,0.000012770621,0.7451728,0.00021172837,0.25330314,0.0011079727,0.000014165652],"about_ca_topic_score_codex":0.005481286,"about_ca_topic_score_gemma":0.006285838,"teacher_disagreement_score":0.011794543,"about_ca_system_score_codex":0.0027057505,"about_ca_system_score_gemma":0.0023435706,"threshold_uncertainty_score":0.039456666},"labels":[],"label_agreement":null},{"id":"W1607320471","doi":"10.1007/978-3-642-11355-0_8","title":"Prioritized Goals and Subgoals in a Logical Account of Goal Change – A Preliminary Report","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"York University","funders":"","keywords":"Computer science; Human–computer interaction","score_opus":0.03375295063395141,"score_gpt":0.27422637870212596,"score_spread":0.24047342806817457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607320471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06251407,0.0035247547,0.7208451,0.01929113,0.0006562464,0.00023711227,0.0005000183,0.0005601729,0.19187133],"genre_scores_gemma":[0.80054075,0.0016842802,0.17233571,0.0010476022,0.00045646608,0.0003971669,0.00057927624,0.0002693421,0.022689372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997778,0.0010161466,0.0001870218,0.00033431812,0.00048928196,0.00019525965],"domain_scores_gemma":[0.99445254,0.003752546,0.0004589377,0.0005795477,0.0005692219,0.00018717104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004178399,0.0006660517,0.0004243317,0.0012824123,0.0016797596,0.0063361865,0.0024744938,0.0019047798,0.016109675],"category_scores_gemma":[0.007798522,0.0010662676,0.0014342538,0.001971873,0.00408256,0.027041966,0.0021239019,0.004972082,0.0014124507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007564884,0.00005150377,0.00020179816,0.0000787317,0.0000140096645,0.00006739014,0.0010631576,0.0025993108,0.00035564246,0.97982913,0.0026237678,0.013039908],"study_design_scores_gemma":[0.000023390963,0.000017554596,0.00039045067,0.000041200794,0.000023837867,0.000056296223,0.00047953503,0.013968315,0.0004465244,0.976843,0.00769162,0.000018296765],"about_ca_topic_score_codex":0.004297165,"about_ca_topic_score_gemma":0.0042571793,"teacher_disagreement_score":0.016109675,"about_ca_system_score_codex":0.0039492315,"about_ca_system_score_gemma":0.002474588,"threshold_uncertainty_score":0.053892255},"labels":[],"label_agreement":null},{"id":"W1607428435","doi":"10.1007/11799573_3","title":"Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"McGill University","funders":"","keywords":"Computer science; Logical framework; Programming language; Semantics (computer science); Software engineering","score_opus":0.016916926351495665,"score_gpt":0.24902804441921816,"score_spread":0.2321111180677225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607428435","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.0063357465,0.0003457378,0.98681045,0.0005543782,0.000083658015,0.00011559282,0.00008083644,0.003355099,0.0023185054],"genre_scores_gemma":[0.2701656,0.0006218659,0.72279406,0.00049811794,0.0001471816,0.00030985472,0.00037276317,0.0017191684,0.0033713782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98883003,0.003760351,0.00088302715,0.0011406963,0.0039439197,0.001441958],"domain_scores_gemma":[0.9782787,0.0129860295,0.0011475863,0.005414637,0.0018652655,0.00030786233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009413878,0.001643555,0.001321318,0.0014573331,0.0023148397,0.0051927543,0.006868209,0.0022908703,0.0088004],"category_scores_gemma":[0.03360294,0.002226213,0.0029299855,0.0016553545,0.004358697,0.018614357,0.0076185092,0.006184435,0.0021045883],"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.0006777956,0.00020590212,0.0010406021,0.0010927775,0.00017041941,0.00029965639,0.0009845174,0.050489347,0.015126464,0.6349323,0.014273967,0.2807063],"study_design_scores_gemma":[0.00021749767,0.00012765864,0.00022410942,0.00024957213,0.0002518918,0.00022422851,0.00034114302,0.2838697,0.03691249,0.65587205,0.021598684,0.00011092434],"about_ca_topic_score_codex":0.0028328963,"about_ca_topic_score_gemma":0.0044069486,"teacher_disagreement_score":0.009413878,"about_ca_system_score_codex":0.0021676477,"about_ca_system_score_gemma":0.0049688583,"threshold_uncertainty_score":0.04978597},"labels":[],"label_agreement":null},{"id":"W1607454116","doi":"10.1007/978-3-642-04747-3_29","title":"Contrasting Sequence Groups by Emerging Sequences","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Alberta","funders":"","keywords":"Computer science; Categorical variable; Classifier (UML); Suffix tree; Artificial intelligence; Sequence (biology); Contrast (vision); Suffix; Matching (statistics); Pattern recognition (psychology); Machine learning; Data structure; Mathematics; Statistics","score_opus":0.01930631283835114,"score_gpt":0.2575602706210861,"score_spread":0.23825395778273498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607454116","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.19790211,0.00073089893,0.7582725,0.00044571838,0.0002424288,0.00014738883,0.00028353505,0.0005646242,0.041410774],"genre_scores_gemma":[0.67057765,0.0006846234,0.30653423,0.00020523154,0.00023266229,0.00020892899,0.0010898398,0.00043314797,0.02003369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927324,0.00023781638,0.000040189116,0.00018419907,0.00018395753,0.000080632635],"domain_scores_gemma":[0.9956067,0.0023499988,0.0003715369,0.00066443335,0.0007161664,0.0002911777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010916844,0.00046768808,0.00043918178,0.0019691752,0.0007340071,0.002081753,0.00089102227,0.00080607407,0.010713348],"category_scores_gemma":[0.0076001887,0.00027703316,0.00047250904,0.0015979626,0.0015018437,0.003858234,0.0017010957,0.0012311707,0.0017943726],"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.00048763095,0.000046752695,0.002907959,0.0002274015,0.000025805406,0.00046076856,0.001846181,0.0062419353,0.031213608,0.78040576,0.0029913539,0.17314482],"study_design_scores_gemma":[0.000033957123,0.00018169881,0.0021447034,0.00008454816,0.00003006117,0.0006328402,0.001129009,0.04614633,0.012329435,0.9098846,0.027377509,0.000025416899],"about_ca_topic_score_codex":0.00018562534,"about_ca_topic_score_gemma":0.0002864936,"teacher_disagreement_score":0.010713348,"about_ca_system_score_codex":0.0003933027,"about_ca_system_score_gemma":0.0002676744,"threshold_uncertainty_score":0.035839677},"labels":[],"label_agreement":null},{"id":"W1607474699","doi":"10.1007/3-540-45468-3_146","title":"Repeatability and Accuracy of Ankle Centre Location Estimates Using a Biaxial Joint Model","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Repeatability; Standard deviation; Valgus; Computer science; Implant; Ankle; Population; Biomedical engineering; Orthodontics; Mathematics; Surgery; Medicine; Statistics","score_opus":0.0358363154935009,"score_gpt":0.2842912502705333,"score_spread":0.2484549347770324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607474699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38778442,0.0014494801,0.60554653,0.00014312283,0.00021104446,0.00005854829,0.000615659,0.0014797116,0.0027114223],"genre_scores_gemma":[0.9098069,0.00028585058,0.087761074,0.000040927524,0.00004973837,0.00003491511,0.0006335126,0.00027047662,0.0011165506],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99414515,0.0021617836,0.00044470138,0.0013642632,0.0016909839,0.00019311025],"domain_scores_gemma":[0.96655,0.019039676,0.0026342606,0.005035744,0.0065388745,0.00020144494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056228754,0.00063412666,0.0007810289,0.0011289051,0.00044132804,0.0014684212,0.001088627,0.0011995444,0.0009356661],"category_scores_gemma":[0.054732215,0.0007827008,0.00059582,0.0012856262,0.0006162637,0.001561698,0.0011927418,0.0007551526,0.001073809],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028063934,0.00018112242,0.15332696,0.0005559296,0.0010066662,0.00026203506,0.0015629476,0.13795039,0.07921799,0.002230096,0.0035743334,0.6173251],"study_design_scores_gemma":[0.00009416431,0.0009013014,0.3337475,0.00011893407,0.0006188971,0.002276425,0.00049275043,0.6081434,0.046886906,0.0034423317,0.0029534746,0.00032393794],"about_ca_topic_score_codex":0.009052706,"about_ca_topic_score_gemma":0.010681743,"teacher_disagreement_score":0.009052706,"about_ca_system_score_codex":0.000407618,"about_ca_system_score_gemma":0.0007778328,"threshold_uncertainty_score":0.029736996},"labels":[],"label_agreement":null},{"id":"W1607529660","doi":"10.1007/978-3-642-15745-5_77","title":"3D Ultrasound to Stereoscopic Camera Registration through an Air-Tissue Boundary","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Fiducial marker; Computer vision; Stereoscopy; Artificial intelligence; 3D ultrasound; Ultrasound; Computer science; Tracking (education); Image registration; Medicine; Radiology; Image (mathematics)","score_opus":0.02295884090933904,"score_gpt":0.32886100791696193,"score_spread":0.3059021670076229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607529660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031466994,0.00028818968,0.9577039,0.00024918126,0.00014389509,0.00017672345,0.00018194763,0.0017665564,0.008022556],"genre_scores_gemma":[0.2737711,0.00043843183,0.7166937,0.00015936885,0.00006642918,0.00015207112,0.00027128746,0.0006423833,0.007805252],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989705,0.00022196672,0.00006182526,0.00018516606,0.00046946816,0.00009112824],"domain_scores_gemma":[0.99914706,0.00029229478,0.00008730885,0.00018254467,0.00023347442,0.000057386795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009752714,0.0006494667,0.0005782427,0.0011556135,0.000510061,0.0019580128,0.0007479763,0.0011908908,0.0069327927],"category_scores_gemma":[0.0040401146,0.0008415034,0.0006929256,0.00089771516,0.0006670131,0.0014034329,0.0025997495,0.0013499003,0.0022245646],"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.0010770945,0.00017501353,0.0020815078,0.00045944544,0.00006786415,0.0011029784,0.00092205417,0.028391534,0.46956742,0.03255717,0.007899612,0.4556983],"study_design_scores_gemma":[0.00017428251,0.00056158897,0.008278613,0.00020434002,0.00012499759,0.005229887,0.00048919197,0.3895545,0.5333796,0.01500682,0.046848282,0.0001479815],"about_ca_topic_score_codex":0.0032943992,"about_ca_topic_score_gemma":0.0036725071,"teacher_disagreement_score":0.0069327927,"about_ca_system_score_codex":0.00060353044,"about_ca_system_score_gemma":0.0023541108,"threshold_uncertainty_score":0.023192525},"labels":[],"label_agreement":null},{"id":"W1607644784","doi":"10.1007/978-3-642-04428-1_26","title":"Insuring Risk-Averse Agents","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Risk aversion (psychology); Pareto optimal; Mechanism (biology); Expected utility hypothesis; Pareto principle; Mathematical optimization; Microeconomics; Mathematical economics; Economics; Multi-objective optimization; Machine learning; Mathematics","score_opus":0.02973983830224085,"score_gpt":0.21266853647902237,"score_spread":0.1829286981767815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607644784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27109024,0.0029719733,0.4701843,0.035252735,0.0014926678,0.00022211752,0.00020946008,0.000718971,0.21785754],"genre_scores_gemma":[0.9341765,0.0014684943,0.027931582,0.0022197298,0.00045685412,0.00008359196,0.00005518204,0.000055835706,0.0335523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993382,0.0002560507,0.000029131135,0.00008044546,0.00019551799,0.000100598365],"domain_scores_gemma":[0.9950911,0.0024342686,0.0008741556,0.0008991089,0.0002965355,0.00040478772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015013645,0.0006093084,0.0004342522,0.00021157488,0.0005947973,0.0016267635,0.0007351156,0.0016442124,0.005383156],"category_scores_gemma":[0.011425829,0.00021513845,0.00024505035,0.0002043537,0.001457245,0.002531405,0.0023532296,0.0020654385,0.0012258354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053786655,0.0002731926,0.0036448576,0.00017561806,0.00010505502,0.0011013552,0.0011906764,0.016962742,0.007171423,0.80989397,0.018131625,0.14081173],"study_design_scores_gemma":[0.000082005696,0.0002025281,0.00064133893,0.00006328918,0.00003715406,0.0006081556,0.00034625578,0.026043095,0.0034476053,0.94396096,0.024545852,0.00002178055],"about_ca_topic_score_codex":0.00020192891,"about_ca_topic_score_gemma":0.00022435113,"teacher_disagreement_score":0.005383156,"about_ca_system_score_codex":0.00025156452,"about_ca_system_score_gemma":0.0005510902,"threshold_uncertainty_score":0.01800847},"labels":[],"label_agreement":null},{"id":"W1607688903","doi":"10.1007/978-3-540-74591-4_13","title":"Improving the Usability of HOL Through Controlled Automation Tactics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"HOL; Rewriting; Computer science; Usability; Automation; Set (abstract data type); Simple (philosophy); Programming language; Reduction (mathematics); Theoretical computer science; Software engineering; Human–computer interaction","score_opus":0.029318592613443602,"score_gpt":0.2717093054504983,"score_spread":0.2423907128370547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607688903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08327928,0.001544601,0.8627987,0.0009964181,0.0002195569,0.00019291161,0.00012480159,0.014426212,0.036417563],"genre_scores_gemma":[0.70057076,0.0009429667,0.28065044,0.00037635036,0.000117421776,0.00012462109,0.0002801995,0.0053077457,0.011629519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251866,0.0030461205,0.0004560876,0.0006037876,0.0027258205,0.00064949045],"domain_scores_gemma":[0.9685624,0.018528707,0.00078700646,0.009650227,0.002119527,0.00035206642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238344,0.0011739788,0.0010262018,0.0015186367,0.001070075,0.0044402783,0.0030341577,0.0012036791,0.010263548],"category_scores_gemma":[0.022360684,0.0010318805,0.0009957772,0.0013202117,0.0029312132,0.010172778,0.00413472,0.00305633,0.0023196295],"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.0014963449,0.00056067924,0.004040756,0.0016760068,0.00020537851,0.00059953716,0.003409822,0.020055186,0.05131844,0.20920777,0.015399974,0.6920301],"study_design_scores_gemma":[0.0006419713,0.0009400924,0.0026132136,0.00066816586,0.00066601206,0.0012691953,0.0014946971,0.30371997,0.2001346,0.39213428,0.09537315,0.00034455984],"about_ca_topic_score_codex":0.0011231283,"about_ca_topic_score_gemma":0.0018555032,"teacher_disagreement_score":0.010263548,"about_ca_system_score_codex":0.00078596995,"about_ca_system_score_gemma":0.0013840648,"threshold_uncertainty_score":0.034335017},"labels":[],"label_agreement":null},{"id":"W1607711335","doi":"10.1007/11866763_84","title":"Piecewise-Quadrilateral Registration by Optical Flow – Applications in Contrast-Enhanced MR Imaging of the Breast","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto","funders":"Canadian Institutes of Health Research; Terry Fox Foundation; Canadian Breast Cancer Research Alliance","keywords":"Computer science; Optical flow; Quadrilateral; Contrast (vision); Interpolation (computer graphics); Computer vision; Algorithm; Piecewise; Image registration; Artificial intelligence; Consistency (knowledge bases); Grid; Image (mathematics); Mathematics; Geometry; Mathematical analysis","score_opus":0.004690790960680132,"score_gpt":0.24639316324479146,"score_spread":0.24170237228411134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607711335","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.012865694,0.0005053357,0.9853753,0.00011696788,0.000035487006,0.000032015654,0.000025195319,0.00039789427,0.00064614683],"genre_scores_gemma":[0.17727043,0.00095461303,0.81935316,0.000053519936,0.00006248474,0.00004752926,0.000082050086,0.00026975587,0.0019064486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.00016316409,0.000022014112,0.00006163391,0.000104206345,0.000025063866],"domain_scores_gemma":[0.99891996,0.0006196433,0.00010806719,0.00011618966,0.00018983791,0.000046284273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011946191,0.0005489392,0.00074405584,0.0011762908,0.00029072713,0.000792655,0.00083154405,0.0007347514,0.0017746153],"category_scores_gemma":[0.003277109,0.00061204314,0.0005593563,0.0016420361,0.0005141743,0.00084249146,0.0006701445,0.0006675111,0.00048447418],"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.0003686757,0.00014184581,0.0010885487,0.0002926583,0.00004711793,0.00012987017,0.00017155932,0.18978667,0.080008835,0.012954442,0.0016049834,0.7134049],"study_design_scores_gemma":[0.00001289308,0.00007084861,0.00047653588,0.000011049386,0.000014063864,0.00016292297,0.000020797099,0.97956264,0.014655693,0.003244846,0.0017526238,0.0000150115075],"about_ca_topic_score_codex":0.0025918542,"about_ca_topic_score_gemma":0.0023203262,"teacher_disagreement_score":0.0025918542,"about_ca_system_score_codex":0.0003658557,"about_ca_system_score_gemma":0.00055142306,"threshold_uncertainty_score":0.006317854},"labels":[],"label_agreement":null},{"id":"W1607794687","doi":"10.1007/3-540-45393-8_3","title":"From Entities and Relationships to Social Actors and Dependencies","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Software engineering; Software development; Conceptual model; Modeling language; Software; Programming language; Knowledge management; Database","score_opus":0.046808704409637865,"score_gpt":0.27080160574286544,"score_spread":0.22399290133322758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607794687","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.039977945,0.008784749,0.784461,0.013527383,0.0005452367,0.00014063744,0.0012228439,0.00060608034,0.15073419],"genre_scores_gemma":[0.6243364,0.011277435,0.2992059,0.0013101462,0.0008232806,0.0004492007,0.0020318876,0.00043179156,0.06013394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903107,0.0004571845,0.000058363163,0.00021021152,0.0001897524,0.000053501102],"domain_scores_gemma":[0.9969522,0.002188824,0.00014608589,0.0003940304,0.00021768975,0.00010115002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010000027,0.00071291294,0.0004510251,0.0024074626,0.0014767416,0.004248008,0.0010770581,0.00123804,0.009716396],"category_scores_gemma":[0.0067201178,0.0007781349,0.0007377969,0.0028133392,0.0050621424,0.016508067,0.0024930194,0.0022356128,0.0016631498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005992444,0.00000600833,0.00021948203,0.000057737012,0.0000062749027,0.00006973032,0.0008918725,0.00093749625,0.00014675275,0.97962254,0.0021349448,0.015901258],"study_design_scores_gemma":[0.000001882041,0.0000021784303,0.00009667298,0.000017427468,0.0000057499565,0.000054472606,0.0002461273,0.0017202633,0.0000828981,0.97980887,0.017960034,0.00000349695],"about_ca_topic_score_codex":0.0024893377,"about_ca_topic_score_gemma":0.002588047,"teacher_disagreement_score":0.009716396,"about_ca_system_score_codex":0.001355177,"about_ca_system_score_gemma":0.0006996465,"threshold_uncertainty_score":0.03250456},"labels":[],"label_agreement":null},{"id":"W1607834707","doi":"10.1007/11423355_11","title":"DIAGAL: A Generic ACL for Open Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.054680889803369805,"score_gpt":0.3300002215557187,"score_spread":0.27531933175234885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607834707","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.0019817862,0.0002319105,0.8370328,0.00040320394,0.0006087396,0.00045373183,0.0041456637,0.12251961,0.032622542],"genre_scores_gemma":[0.10357969,0.0010216963,0.6530466,0.0016922163,0.00047448813,0.0018110552,0.03525224,0.06460888,0.13851313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99493766,0.0009888932,0.0011849338,0.0006576583,0.0017570419,0.00047374505],"domain_scores_gemma":[0.99630105,0.00095949246,0.00016954713,0.0013166124,0.00091317,0.00034006464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035802808,0.0019967137,0.001296881,0.0025945888,0.0016494642,0.009079218,0.0041242056,0.0036046526,0.076467805],"category_scores_gemma":[0.0095280185,0.0019524614,0.001662807,0.0016984474,0.0020387007,0.009371323,0.011680128,0.004333176,0.054087576],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006469395,0.000382246,0.001198168,0.0021181502,0.00011880316,0.0006503054,0.0016752143,0.0036985858,0.008278025,0.29705945,0.31545767,0.36871633],"study_design_scores_gemma":[0.00012969524,0.00015488816,0.00028767204,0.00051446445,0.00009270376,0.0008332573,0.00038938023,0.027115818,0.014476595,0.10937158,0.84645236,0.00018152315],"about_ca_topic_score_codex":0.0019674515,"about_ca_topic_score_gemma":0.0025005152,"teacher_disagreement_score":0.076467805,"about_ca_system_score_codex":0.000982058,"about_ca_system_score_gemma":0.0023452,"threshold_uncertainty_score":0.25581032},"labels":[],"label_agreement":null},{"id":"W1607883270","doi":"10.1007/978-3-642-02118-3_4","title":"Routing and Aggregation Strategies for Contour Map Applications in Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Computer science; Data aggregator; Heuristics; Aggregate (composite); Cluster analysis; Wireless sensor network; Exploit; Routing (electronic design automation); Data mining; Representation (politics); Node (physics); Distributed computing; Artificial intelligence; Computer network; Computer security","score_opus":0.01253017617269664,"score_gpt":0.2373633505887029,"score_spread":0.22483317441600625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607883270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04992798,0.0016637278,0.9392515,0.00027162643,0.0000985845,0.00007159348,0.00005225338,0.00034526805,0.008317433],"genre_scores_gemma":[0.78071743,0.0016949632,0.20798649,0.00007367965,0.00008422894,0.000079227095,0.000091266564,0.00012057693,0.00915223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987626,0.00003171788,0.000007457008,0.000018655068,0.000046951463,0.00001890965],"domain_scores_gemma":[0.9997049,0.0001380128,0.00002272171,0.00003662825,0.000084966756,0.000012673073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003838055,0.0004766156,0.00042450242,0.00036949574,0.00042512952,0.00064362213,0.00082722306,0.00041474449,0.0017071188],"category_scores_gemma":[0.0011284063,0.00022537743,0.00020792155,0.00068904035,0.00026299775,0.000884799,0.0005147456,0.00035452878,0.00030423573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027036827,0.00014403394,0.0008540275,0.00019798325,0.00003334048,0.00014246495,0.00023343414,0.4724591,0.04904387,0.046935897,0.0060307244,0.4236548],"study_design_scores_gemma":[0.0000067569317,0.000060582002,0.00028158998,0.000007905094,0.000013280827,0.00008410946,0.00004908649,0.98213506,0.0054969783,0.00949382,0.0023622748,0.000008657574],"about_ca_topic_score_codex":0.00080271787,"about_ca_topic_score_gemma":0.0014028229,"teacher_disagreement_score":0.0017071188,"about_ca_system_score_codex":0.0003302352,"about_ca_system_score_gemma":0.00022068231,"threshold_uncertainty_score":0.00571084},"labels":[],"label_agreement":null},{"id":"W1607963120","doi":"10.1007/978-3-540-85990-1_22","title":"Human Brain Myelination from Birth to 4.5 Years","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"White matter; Internal capsule; Computer science; Neuroscience; Psychology; Medicine; Magnetic resonance imaging; Radiology","score_opus":0.04755122668089339,"score_gpt":0.3491319561679287,"score_spread":0.3015807294870353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607963120","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.9696684,0.016051458,0.000691141,0.00036862327,0.00006809812,0.000011294586,0.005264607,0.00010806985,0.007768366],"genre_scores_gemma":[0.9862432,0.003630151,0.00033612252,0.000054882534,0.000029733332,0.000018354722,0.0030697933,0.000020730147,0.0065970714],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997985,0.000028048795,0.0000132446885,0.00006284636,0.00003948515,0.000057987076],"domain_scores_gemma":[0.9986903,0.00027909127,0.0004117702,0.00010154267,0.00036131355,0.00015589807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071000867,0.00016517565,0.00024035327,0.001694075,0.00044454477,0.0006435304,0.00033455947,0.00044163145,0.003492769],"category_scores_gemma":[0.002605369,0.000115518786,0.0003692364,0.0009226759,0.0003090703,0.0005296052,0.0007777324,0.00037070204,0.00087707833],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006154907,0.00018723222,0.5838255,0.0004987225,0.0006088783,0.0057705557,0.0038598205,0.0013465198,0.031220665,0.0038748793,0.00963834,0.353014],"study_design_scores_gemma":[0.00001316023,0.00034979428,0.97386205,0.00012386017,0.00014438773,0.0027847395,0.00037357566,0.00014212413,0.0040249676,0.0010118742,0.017144963,0.000024546136],"about_ca_topic_score_codex":0.0087516485,"about_ca_topic_score_gemma":0.007203084,"teacher_disagreement_score":0.0087516485,"about_ca_system_score_codex":0.00053440675,"about_ca_system_score_gemma":0.0004363897,"threshold_uncertainty_score":0.017401457},"labels":[],"label_agreement":null},{"id":"W1608061033","doi":"10.1007/11556992_2","title":"SVision: A Network Host-Centered Anomaly Visualization Technique","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Computer science; Denial-of-service attack; Intrusion detection system; Anomaly detection; Visualization; Network security; Ping (video games); Botnet; Data mining; Host (biology); Network administrator; Internet Control Message Protocol; Anomaly (physics); Computer security; Computer network; The Internet; World Wide Web; Network packet","score_opus":0.01989551824396039,"score_gpt":0.2870438955490729,"score_spread":0.2671483773051125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608061033","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.0057947463,0.00010528304,0.9867638,0.00006290606,0.00005428895,0.000030928546,0.00015784687,0.006150941,0.0008792022],"genre_scores_gemma":[0.13947977,0.0003334407,0.8547467,0.00007665465,0.00009647529,0.000096143995,0.0007875402,0.0014357698,0.0029475233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927276,0.00012779623,0.000033347653,0.00010315594,0.00039635572,0.00006662128],"domain_scores_gemma":[0.9989428,0.0003420651,0.00011289769,0.00022775443,0.00030432272,0.000070154616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008638,0.0010186848,0.0009500898,0.0025553764,0.00056189153,0.0016377625,0.0017562087,0.0007100415,0.0034179678],"category_scores_gemma":[0.0029353201,0.0004925482,0.00084287516,0.0020335403,0.0003731946,0.0017730084,0.0019754055,0.0020332895,0.00079176726],"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.00038355208,0.00015214308,0.0041015083,0.00022598109,0.00023504344,0.00024456737,0.0004179919,0.0412285,0.06073565,0.016165353,0.017932847,0.8581768],"study_design_scores_gemma":[0.000054916243,0.00013689297,0.001894551,0.000037846723,0.00010020826,0.0006478869,0.0001497218,0.8953251,0.057137746,0.020324828,0.02411441,0.00007594163],"about_ca_topic_score_codex":0.0018955473,"about_ca_topic_score_gemma":0.0030965186,"teacher_disagreement_score":0.0034179678,"about_ca_system_score_codex":0.00034420154,"about_ca_system_score_gemma":0.00076658675,"threshold_uncertainty_score":0.011434257},"labels":[],"label_agreement":null},{"id":"W1608072211","doi":"10.1007/978-3-642-38868-2_7","title":"Tree-Space Statistics and Approximations for Large-Scale Analysis of Anatomical Trees","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"H. Lundbeck A/S; Lundbeckfonden; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Danmarks Frie Forskningsfond; Villum Fonden; Strategiske Forskningsråd; AstraZeneca","keywords":"Tree (set theory); Geodesic; Metric (unit); Computer science; Principal component analysis; Metric space; Mathematics; Algorithm; Artificial intelligence; Combinatorics; Geometry; Discrete mathematics","score_opus":0.02122944916714245,"score_gpt":0.2914429356819674,"score_spread":0.2702134865148249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608072211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067208433,0.00030468602,0.9923078,0.00009241529,0.00002005915,0.000008483914,0.00006541705,0.00023424937,0.00024608002],"genre_scores_gemma":[0.3760722,0.0019334673,0.6165835,0.00015865426,0.00030068666,0.00023376044,0.0012147456,0.0006936359,0.0028093755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869543,0.0006078364,0.00009225672,0.00017915312,0.00032568246,0.000099649566],"domain_scores_gemma":[0.97703755,0.017959684,0.0011428135,0.0019892536,0.0012924647,0.0005782393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005218866,0.00077941915,0.0017562413,0.002592932,0.0008395175,0.002624673,0.0025516464,0.001631212,0.0021216047],"category_scores_gemma":[0.03370868,0.000873975,0.0014944297,0.0035354781,0.002352031,0.0041784802,0.0023241541,0.0035075548,0.0008428062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012994866,0.00005937541,0.0022787005,0.00020198278,0.0000834733,0.00011048486,0.00023108574,0.5688397,0.0027215302,0.3328503,0.003156583,0.08933687],"study_design_scores_gemma":[0.0000030418803,0.0000065006298,0.0002397463,0.000007618373,0.0000046317627,0.000020777054,0.000011424815,0.9028001,0.00016937187,0.096279696,0.0004495306,0.0000075545313],"about_ca_topic_score_codex":0.005620383,"about_ca_topic_score_gemma":0.0050395983,"teacher_disagreement_score":0.005620383,"about_ca_system_score_codex":0.0015116329,"about_ca_system_score_gemma":0.0014427527,"threshold_uncertainty_score":0.027600288},"labels":[],"label_agreement":null},{"id":"W1608142354","doi":"10.1007/978-3-540-72163-5_14","title":"Formalization of RBAC Policy with Object Class Hierarchy","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Role-based access control; Access control; Computer science; Class (philosophy); Hierarchy; Authorization; Object (grammar); Representation (politics); Theoretical computer science; Key (lock); Feature (linguistics); Programming language; Computer security; Artificial intelligence","score_opus":0.019457387918240768,"score_gpt":0.29695306139652444,"score_spread":0.2774956734782837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608142354","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.0036809472,0.00030964287,0.98619974,0.0007694463,0.00014228997,0.00017569879,0.00028749008,0.0014359535,0.006998867],"genre_scores_gemma":[0.18512289,0.0006098588,0.80348283,0.0007340435,0.00034907518,0.000587732,0.00085414335,0.0006511106,0.0076082842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992527,0.0022860337,0.000803167,0.00094898883,0.002511082,0.0009236966],"domain_scores_gemma":[0.9927953,0.0033206984,0.0005285294,0.0018550056,0.0012394245,0.00026113124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007199198,0.0008268566,0.0009778986,0.001626642,0.0019411184,0.006961145,0.0035243277,0.0019175464,0.007559569],"category_scores_gemma":[0.010736114,0.001364479,0.0021933767,0.0019069684,0.004239306,0.0075016436,0.0028635263,0.0061717345,0.0018478814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045686105,0.00005882851,0.00021610256,0.00013648056,0.000027423574,0.00008003585,0.00039317217,0.008252489,0.0014776925,0.96673244,0.003073158,0.019506631],"study_design_scores_gemma":[0.00010835936,0.00006155023,0.00028701517,0.00021822326,0.00012811666,0.00028143913,0.00021666469,0.1517788,0.006487521,0.7760361,0.06431968,0.0000766336],"about_ca_topic_score_codex":0.01285523,"about_ca_topic_score_gemma":0.010336661,"teacher_disagreement_score":0.01285523,"about_ca_system_score_codex":0.0031609838,"about_ca_system_score_gemma":0.005540317,"threshold_uncertainty_score":0.03807348},"labels":[],"label_agreement":null},{"id":"W1608143967","doi":"10.1007/11531142_9","title":"Separation of Concerns with Procedures, Annotations, Advice and Pointcuts","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Advice (programming); Separation of concerns; Metadata; Programming language; Software engineering; Source code; Focus (optics); Aspect-oriented programming; Software; World Wide Web","score_opus":0.012840206856417485,"score_gpt":0.2771170648175793,"score_spread":0.26427685796116185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608143967","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.0027602832,0.0023308112,0.9770855,0.0003123996,0.00017331104,0.000045881796,0.00007141122,0.0020372625,0.015183274],"genre_scores_gemma":[0.08922457,0.0042229923,0.85577005,0.0003852131,0.00038027234,0.00017802841,0.00071582454,0.002068134,0.04705494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829406,0.00030683118,0.00019714447,0.0002681681,0.0008100324,0.00012366635],"domain_scores_gemma":[0.99852604,0.0006350888,0.00012791135,0.00046829364,0.00018210389,0.00006054217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016586557,0.0019807005,0.0011271208,0.0012188427,0.00078549865,0.0036954593,0.0018586895,0.0017164937,0.0062130815],"category_scores_gemma":[0.0040012035,0.0016125522,0.0019007201,0.0016726857,0.001897824,0.0042939493,0.0026954764,0.0048139542,0.0042703343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012482918,0.00008336131,0.00025591673,0.00069975253,0.00007335746,0.00026020405,0.00092581904,0.004800382,0.013736698,0.58567953,0.016555397,0.37680477],"study_design_scores_gemma":[0.00007458963,0.000088336106,0.00036894414,0.0003416565,0.00014546685,0.0012411734,0.00009393614,0.021294335,0.018623577,0.73238254,0.22527988,0.00006549812],"about_ca_topic_score_codex":0.0007152727,"about_ca_topic_score_gemma":0.0009733662,"teacher_disagreement_score":0.0062130815,"about_ca_system_score_codex":0.0006812786,"about_ca_system_score_gemma":0.0013123245,"threshold_uncertainty_score":0.020784795},"labels":[],"label_agreement":null},{"id":"W1608269966","doi":"10.1007/978-3-540-89765-1_22","title":"Uncertainty Reasoning for Ontologies with General TBoxes in Description Logic","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Description logic; Set (abstract data type); Context (archaeology); Knowledge base; Programming language; Semantics (computer science); Theoretical computer science; Base (topology); Artificial intelligence; Natural language processing; Mathematics","score_opus":0.03578601207078525,"score_gpt":0.25545102364554495,"score_spread":0.2196650115747597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608269966","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.008308949,0.0010619055,0.98527783,0.000608763,0.00008547229,0.00006115115,0.00022314533,0.00024144266,0.0041313753],"genre_scores_gemma":[0.31887072,0.0022224311,0.6712298,0.000506077,0.0002692344,0.00021961157,0.0013851211,0.00019828865,0.005098752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555016,0.0014511319,0.00050794234,0.0005637066,0.0015907014,0.00033648295],"domain_scores_gemma":[0.99516195,0.0032882805,0.00024090461,0.0007083498,0.0004579916,0.00014243144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057726717,0.0007944351,0.0014115288,0.0022907036,0.0013070897,0.00462614,0.002558335,0.0016797698,0.002990488],"category_scores_gemma":[0.012224226,0.0012106623,0.0033736373,0.0031947144,0.0030185576,0.014198698,0.0051800394,0.004622314,0.0004680625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009732877,0.00005397077,0.00037481703,0.00034395015,0.00012862797,0.00024131617,0.00052909594,0.030330578,0.0012597633,0.9085669,0.003191449,0.05488226],"study_design_scores_gemma":[0.000015347057,0.000009383267,0.00006246465,0.000048867365,0.000043997974,0.0000666192,0.00007768382,0.079616636,0.0008681647,0.9158387,0.0033361358,0.000016094365],"about_ca_topic_score_codex":0.00487486,"about_ca_topic_score_gemma":0.005249934,"teacher_disagreement_score":0.0057726717,"about_ca_system_score_codex":0.0026881758,"about_ca_system_score_gemma":0.0014545317,"threshold_uncertainty_score":0.030529141},"labels":[],"label_agreement":null},{"id":"W1608293404","doi":"10.1007/978-3-540-72665-4_3","title":"Competition and Coordination in Stochastic Games","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Competition (biology); Variety (cybernetics); Class (philosophy); Artificial intelligence; Reinforcement learning; Set (abstract data type); Hill climbing; Theoretical computer science; Mathematical optimization; Machine learning; Mathematics","score_opus":0.05803968769199988,"score_gpt":0.34314482509648364,"score_spread":0.28510513740448373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608293404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055937435,0.011954477,0.68564457,0.0054820073,0.0010259768,0.00013835427,0.0002786014,0.00018603653,0.23935257],"genre_scores_gemma":[0.83507574,0.008096895,0.07093362,0.00063037366,0.001463534,0.00047898982,0.00039281393,0.00014073333,0.082787246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987519,0.0006081496,0.00006133679,0.00016897316,0.00027029015,0.00013945186],"domain_scores_gemma":[0.9974369,0.001962766,0.00016991273,0.00011139038,0.00014927829,0.000169794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016885279,0.0009997264,0.0014550394,0.0006424865,0.000759232,0.002793679,0.0012663358,0.0017746286,0.006733872],"category_scores_gemma":[0.0053671207,0.0005782973,0.00089079817,0.0014072887,0.0024349517,0.0024003158,0.00097562,0.0021986805,0.0007403208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017435961,0.000020046291,0.000090822534,0.000063738946,0.000018123495,0.000035646073,0.00007719963,0.025610998,0.00021805216,0.9639902,0.0036250178,0.0062327194],"study_design_scores_gemma":[0.000015562702,0.000011702082,0.0000830301,0.000014438408,0.000005990911,0.000023631035,0.00002027194,0.038593013,0.00004542989,0.9576159,0.0035639321,0.00000712972],"about_ca_topic_score_codex":0.002433809,"about_ca_topic_score_gemma":0.0020810538,"teacher_disagreement_score":0.006733872,"about_ca_system_score_codex":0.0018434969,"about_ca_system_score_gemma":0.0015254827,"threshold_uncertainty_score":0.022527039},"labels":[],"label_agreement":null},{"id":"W1608515316","doi":"10.1007/11429760_33","title":"ST-Tool: A CASE Tool for Modeling and Analyzing Trust Requirements","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Consistency (knowledge bases); Software engineering; Functional requirement; Visual modeling; Systems engineering; Programming language; Unified Modeling Language; Engineering; Artificial intelligence; Software","score_opus":0.040372882562568164,"score_gpt":0.3133535601226748,"score_spread":0.27298067756010663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608515316","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.025397187,0.00014215439,0.94583875,0.0005554074,0.0000880973,0.00057655736,0.0025015234,0.014940371,0.009959886],"genre_scores_gemma":[0.17934279,0.0003415358,0.8078882,0.00015989428,0.000028339584,0.00056043686,0.0033401144,0.0018972892,0.0064413184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969343,0.0011157441,0.00039981434,0.00028042277,0.001072345,0.00019737959],"domain_scores_gemma":[0.9864659,0.010125318,0.00072963774,0.001437534,0.0010209262,0.00022059977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038910483,0.0016236594,0.0009233838,0.0034025237,0.0011705953,0.0034396397,0.0027187427,0.0022147242,0.009967803],"category_scores_gemma":[0.014580811,0.0013159065,0.0018264706,0.0018886549,0.001250397,0.00554686,0.0021353217,0.0021036973,0.0015048053],"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.00061357085,0.00082375266,0.012733727,0.0023939058,0.0003704311,0.0043368666,0.0045094364,0.32395098,0.012620018,0.33045214,0.051829625,0.25536555],"study_design_scores_gemma":[0.00010820104,0.00015248508,0.00077272987,0.00026958206,0.0001653897,0.0010592268,0.00069603417,0.8666294,0.007934471,0.06494054,0.057170946,0.00010095444],"about_ca_topic_score_codex":0.011063011,"about_ca_topic_score_gemma":0.0161368,"teacher_disagreement_score":0.011063011,"about_ca_system_score_codex":0.0014864639,"about_ca_system_score_gemma":0.0025437945,"threshold_uncertainty_score":0.03334564},"labels":[],"label_agreement":null},{"id":"W1608531804","doi":"10.1007/978-3-642-01818-3_25","title":"Evaluation Methods for Ordinal Classification","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":106,"is_retracted":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":"Computer science; Metric (unit); Class (philosophy); Mean absolute error; Ordinal regression; Mean squared error; Ordinal data; Data mining; Statistics; Artificial intelligence; Machine learning; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.08103451214580921,"score_gpt":0.38845102583694335,"score_spread":0.30741651369113415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608531804","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.005029871,0.0075624995,0.9794773,0.00066265574,0.00042949695,0.00021230316,0.000800854,0.0009762611,0.0048486292],"genre_scores_gemma":[0.20545031,0.0036635261,0.7701982,0.0004319604,0.0012943966,0.0015476187,0.0048433775,0.0007895806,0.0117809065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9701927,0.018446231,0.0019680022,0.0018685635,0.006987528,0.000537012],"domain_scores_gemma":[0.9275888,0.05548404,0.0020112568,0.006939809,0.0072199046,0.0007560898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031441245,0.0014713466,0.0023473394,0.004841222,0.0009793993,0.0038948134,0.0028406626,0.0014757224,0.010329303],"category_scores_gemma":[0.080771595,0.00050590746,0.0014350209,0.004981811,0.00135253,0.0065182643,0.0025234648,0.0035007044,0.0025248218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005968019,0.00022300755,0.004500194,0.0008482598,0.0003800214,0.000038032973,0.0001587878,0.022504887,0.00081042317,0.10257189,0.025896316,0.8414714],"study_design_scores_gemma":[0.00012494116,0.00045938088,0.0039037415,0.00048265653,0.00026868825,0.00023238843,0.0002009196,0.540796,0.0021488166,0.42758933,0.023722764,0.00007041438],"about_ca_topic_score_codex":0.000947267,"about_ca_topic_score_gemma":0.0011527911,"teacher_disagreement_score":0.031441245,"about_ca_system_score_codex":0.0017349437,"about_ca_system_score_gemma":0.0013168555,"threshold_uncertainty_score":0.16627914},"labels":[],"label_agreement":null},{"id":"W1608533151","doi":"10.1007/3-540-45049-1_40","title":"Inventiveness as Belief Revision and a Heuristic Rule of Inventive Design","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","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":"Nortel (Canada)","funders":"","keywords":"Heuristic; Computer science; Opposition (politics); Rule-based system; Artificial intelligence","score_opus":0.022995772738953583,"score_gpt":0.25869844484914156,"score_spread":0.23570267211018797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608533151","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.017692091,0.0007763261,0.9282901,0.002620553,0.00024194735,0.00016909649,0.000111765534,0.0002419628,0.049856123],"genre_scores_gemma":[0.7138954,0.00036794922,0.27816528,0.00060000963,0.00026333818,0.0005920593,0.00013818857,0.000108501976,0.005869291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856281,0.008086766,0.0012076229,0.0016454429,0.0029161598,0.000515924],"domain_scores_gemma":[0.9374586,0.047521926,0.0020211113,0.008622282,0.003742608,0.0006335743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013653765,0.001015417,0.0013211583,0.0032919922,0.0015813644,0.005587484,0.0030899474,0.0031482307,0.006704241],"category_scores_gemma":[0.05948119,0.0010816107,0.0025567987,0.0017268396,0.01390302,0.0123731345,0.002978864,0.004436397,0.00059501536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022874638,0.000016375712,0.00024369196,0.00005109069,0.000028893233,0.000030871764,0.0003166286,0.0015474529,0.00010023871,0.98708296,0.0005754004,0.009983496],"study_design_scores_gemma":[0.00001750938,0.000011647577,0.0000734669,0.00001729836,0.000013926332,0.000067972345,0.0000500919,0.00698896,0.00020276931,0.9915863,0.00096007285,0.000009836607],"about_ca_topic_score_codex":0.0010679461,"about_ca_topic_score_gemma":0.00086015987,"teacher_disagreement_score":0.013653765,"about_ca_system_score_codex":0.0023180125,"about_ca_system_score_gemma":0.0015016233,"threshold_uncertainty_score":0.07220888},"labels":[],"label_agreement":null},{"id":"W1608613055","doi":"10.1007/978-3-540-30555-2_22","title":"Hybrid-Chord: A Peer-to-Peer System Based on Chord","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Chord (peer-to-peer); Pastry; Computer science; Peer-to-peer; Distributed computing; Computer network","score_opus":0.014379405175140882,"score_gpt":0.23863130532760865,"score_spread":0.22425190015246776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608613055","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.03402986,0.0020764496,0.9102462,0.00029367468,0.0005976953,0.000535286,0.0011420832,0.031120975,0.019957794],"genre_scores_gemma":[0.3460102,0.0014726893,0.62055016,0.00022688638,0.00025439516,0.0003441159,0.003263651,0.0014900404,0.0263879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.00004819573,0.000031304666,0.000082833416,0.00018408883,0.00004361552],"domain_scores_gemma":[0.99927086,0.00013918955,0.000028496026,0.00024186652,0.00018997108,0.0001296197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779035,0.000544087,0.0010877465,0.00068910304,0.0009101948,0.001718662,0.002773274,0.0009646372,0.006901694],"category_scores_gemma":[0.001055372,0.00044363737,0.0003127589,0.001004167,0.0005014844,0.0027919582,0.0018586445,0.0009650532,0.0031741548],"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.0029330044,0.00034497675,0.0013543443,0.0017806732,0.00035051815,0.0007257937,0.00069633813,0.038859062,0.16611959,0.091482505,0.07851908,0.6168341],"study_design_scores_gemma":[0.00095523463,0.0011543221,0.001922114,0.00010508339,0.00038448352,0.0025377935,0.00028440158,0.4288212,0.116259046,0.09710232,0.35010865,0.0003653809],"about_ca_topic_score_codex":0.0012142129,"about_ca_topic_score_gemma":0.0013488316,"teacher_disagreement_score":0.006901694,"about_ca_system_score_codex":0.00047695075,"about_ca_system_score_gemma":0.00085092883,"threshold_uncertainty_score":0.023088396},"labels":[],"label_agreement":null},{"id":"W1608696406","doi":"10.1007/978-3-642-16321-0_12","title":"On the Hardness of Counting and Sampling Center Strings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Hamming distance; Center (category theory); Combinatorics; Sampling (signal processing); Discrete mathematics; Set (abstract data type); Hamming code; Mathematics; Computer science; Algorithm","score_opus":0.021761438101420977,"score_gpt":0.2469438099727687,"score_spread":0.22518237187134774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608696406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14225173,0.006247825,0.6065449,0.019240353,0.0012888241,0.00031144856,0.0029380675,0.0028714885,0.2183054],"genre_scores_gemma":[0.75248224,0.004725324,0.16377059,0.004770476,0.003365655,0.0009884726,0.004650911,0.0025540157,0.06269225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914588,0.0023577083,0.00048700318,0.0016556126,0.0029878544,0.00105306],"domain_scores_gemma":[0.94331425,0.046841033,0.0012613641,0.0059704375,0.0017281496,0.00088469015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00450258,0.0017869812,0.003829823,0.0030977598,0.0043081786,0.008103107,0.0064082006,0.00522259,0.01787349],"category_scores_gemma":[0.04369351,0.001904915,0.0030191662,0.00702565,0.008327296,0.02487689,0.007974883,0.012111791,0.0030345442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047306655,0.000115869385,0.00081495184,0.00028501407,0.00004689312,0.00008864751,0.0003603996,0.017419213,0.0010355561,0.9147546,0.018910334,0.0456954],"study_design_scores_gemma":[0.00005176504,0.000016980805,0.00019329804,0.000038564936,0.000020786334,0.000066738095,0.000049163187,0.031467043,0.00070268684,0.96411306,0.003259164,0.000020698999],"about_ca_topic_score_codex":0.002994265,"about_ca_topic_score_gemma":0.002129513,"teacher_disagreement_score":0.01787349,"about_ca_system_score_codex":0.004898502,"about_ca_system_score_gemma":0.0029864316,"threshold_uncertainty_score":0.059792817},"labels":[],"label_agreement":null},{"id":"W1608774414","doi":"10.1007/978-3-540-74742-0_56","title":"A Grid Resources Valuation Model Using Fuzzy Real Option","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","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 Manitoba","funders":"","keywords":"Computer science; Grid; Valuation (finance); Fuzzy logic; Quality of service; Grid computing; Operations research; Mathematical optimization; Distributed computing; Finance; Computer network; Artificial intelligence; Economics","score_opus":0.08401796716602038,"score_gpt":0.2687383133222067,"score_spread":0.18472034615618632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608774414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2325864,0.001047473,0.7169121,0.0019548526,0.0002422732,0.00010606494,0.0009261189,0.00052488555,0.04569979],"genre_scores_gemma":[0.97291213,0.00032696896,0.014310799,0.000057239504,0.000035228804,0.00006605578,0.00014608495,0.000029407442,0.012115928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979526,0.000082369785,0.000009982073,0.00004957597,0.000033666212,0.000029238612],"domain_scores_gemma":[0.9996575,0.00019047134,0.000037559148,0.000018325198,0.000050010447,0.000046084308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943117,0.0005312397,0.0010668164,0.0005271595,0.0006010214,0.0021656693,0.0016986609,0.0021615473,0.0058988146],"category_scores_gemma":[0.0013103843,0.00050011394,0.0007245043,0.0011430221,0.0007889002,0.0019514516,0.0007500862,0.00105288,0.0004116944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032964363,0.000017288892,0.0002680374,0.000015865846,0.000015147398,0.00016484557,0.000022668828,0.9700038,0.00028560063,0.025846617,0.0005132726,0.0028139104],"study_design_scores_gemma":[0.0000065857685,0.000005886669,0.000044259625,0.0000018811407,0.0000049645378,0.000014756917,0.0000066220514,0.9947048,0.000031207877,0.004989093,0.00018577982,0.000004253215],"about_ca_topic_score_codex":0.014694559,"about_ca_topic_score_gemma":0.006964158,"teacher_disagreement_score":0.014694559,"about_ca_system_score_codex":0.00128667,"about_ca_system_score_gemma":0.00087930326,"threshold_uncertainty_score":0.029218078},"labels":[],"label_agreement":null},{"id":"W1608823620","doi":"10.1007/978-3-642-12659-8_9","title":"A Parallel Algorithm for Computing the Spectrum of CH $_5^+$","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Atomic and Molecular Physics","field":"Physics and Astronomy","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":"Queen's University","funders":"","keywords":"Eigenfunction; Maxima and minima; Computer science; Basis (linear algebra); Scheme (mathematics); Basis function; Algorithm; Amplitude; Iterative method; Energy (signal processing); Spectrum (functional analysis); Parallel computing; Computational science; Mathematics; Physics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.009100025762887617,"score_gpt":0.2383181245494648,"score_spread":0.22921809878657717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608823620","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.028711354,0.00026702962,0.95173234,0.0003084124,0.00025746072,0.00017959777,0.00033466035,0.0038965035,0.014312572],"genre_scores_gemma":[0.10888267,0.00012315728,0.8816315,0.0001254634,0.00009029234,0.0002760754,0.00064883695,0.00044773766,0.007774213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.000038966286,0.000017759197,0.000077655866,0.00012306921,0.000048414196],"domain_scores_gemma":[0.9995912,0.00016327253,0.00001963553,0.000082357525,0.00010758792,0.000035999106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005149681,0.0013479327,0.001047614,0.0011910888,0.0013910255,0.0013755943,0.0019521669,0.0010596501,0.01355553],"category_scores_gemma":[0.0015094803,0.0005355181,0.0009223212,0.0018033655,0.00080139376,0.0018153484,0.0015035277,0.0011761748,0.0028716268],"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.0007617112,0.00035914526,0.0010221705,0.00027127037,0.00013372012,0.00025341325,0.00021403475,0.12715001,0.022081563,0.10840459,0.026782015,0.7125663],"study_design_scores_gemma":[0.00029108458,0.000091335976,0.00039546142,0.00001694346,0.00004197388,0.00016171581,0.00006457164,0.85588026,0.008901774,0.12678476,0.0073346305,0.00003549106],"about_ca_topic_score_codex":0.004367567,"about_ca_topic_score_gemma":0.008423753,"teacher_disagreement_score":0.01355553,"about_ca_system_score_codex":0.0009829459,"about_ca_system_score_gemma":0.0014423975,"threshold_uncertainty_score":0.04534775},"labels":[],"label_agreement":null},{"id":"W1608830063","doi":"10.1007/978-3-540-74742-0_42","title":"Leveraging Many Simple Statistical Models to Adaptively Monitor Software Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fault detection and isolation; Simple (philosophy); System monitoring; Software; Component (thermodynamics); Fault (geology); Data mining; Real-time computing; Reliability engineering; Distributed computing; Artificial intelligence; Programming language","score_opus":0.0425324232669908,"score_gpt":0.27449521228313645,"score_spread":0.23196278901614564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608830063","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.020931473,0.00028441142,0.9770438,0.00015878657,0.00005209592,0.000018950936,0.000030575593,0.0008750603,0.00060476665],"genre_scores_gemma":[0.7941037,0.0005396987,0.20172834,0.0002518664,0.00020688292,0.000079257064,0.0001270948,0.00019731531,0.002765916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.00029506724,0.00006663799,0.00022029149,0.0003257399,0.00007956326],"domain_scores_gemma":[0.99449724,0.0035511681,0.00046935584,0.0010750497,0.00028683734,0.000120402336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016541714,0.0011245983,0.0011242202,0.0007333607,0.00030217983,0.0013123413,0.0014052611,0.0010368791,0.0007836117],"category_scores_gemma":[0.009519064,0.000638855,0.00082376983,0.00071833807,0.00079469936,0.0031826713,0.001311566,0.0021000148,0.00037802674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020895796,0.00023708976,0.0058543608,0.00011473311,0.0002550865,0.00017600892,0.000117073585,0.7622333,0.01636952,0.028074585,0.0017781053,0.18458113],"study_design_scores_gemma":[0.0000032136925,0.000023799024,0.00023226257,0.0000017677426,0.000013505579,0.000032306223,0.0000022572476,0.98831147,0.0009659595,0.010250002,0.00015677216,0.0000066637344],"about_ca_topic_score_codex":0.0010387201,"about_ca_topic_score_gemma":0.002369635,"teacher_disagreement_score":0.0016541714,"about_ca_system_score_codex":0.00046332777,"about_ca_system_score_gemma":0.000655394,"threshold_uncertainty_score":0.008748233},"labels":[],"label_agreement":null},{"id":"W1608861503","doi":"10.1007/11940128_63","title":"Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamming distance; Upper and lower bounds; Alice and Bob; Mathematics; Discrete mathematics; Quantum; Hamming code; Protocol (science); Quantum information science; Combinatorics; Algorithm; Quantum mechanics; Physics; Quantum entanglement","score_opus":0.01821230751630273,"score_gpt":0.23208179868430612,"score_spread":0.21386949116800338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608861503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1406198,0.029494217,0.51693964,0.042348493,0.002749188,0.0005490526,0.004549272,0.0023908273,0.26035956],"genre_scores_gemma":[0.77555764,0.0165783,0.13262501,0.0036580001,0.005997441,0.0019657735,0.0037923995,0.0020422006,0.057783224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866725,0.003072555,0.00058967737,0.0017602618,0.0053720674,0.0025329622],"domain_scores_gemma":[0.8637987,0.11694365,0.002750328,0.009807321,0.0044396403,0.0022603804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008160357,0.003236406,0.0035707785,0.004298384,0.0041557583,0.011487857,0.0088268565,0.00567719,0.02519255],"category_scores_gemma":[0.06974182,0.002098854,0.0032151788,0.007688088,0.0067267283,0.02349457,0.008955801,0.016449934,0.004132082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081294985,0.0003540948,0.00091557915,0.00076603354,0.0001157144,0.00013517498,0.00053776,0.06487936,0.0025893545,0.84142375,0.021345818,0.06612442],"study_design_scores_gemma":[0.00010323221,0.000055479097,0.0006547736,0.00012782108,0.00007020141,0.00014172423,0.00013915836,0.113927424,0.0016397503,0.87709534,0.0059796926,0.00006544464],"about_ca_topic_score_codex":0.0028360768,"about_ca_topic_score_gemma":0.0041194176,"teacher_disagreement_score":0.02519255,"about_ca_system_score_codex":0.009905164,"about_ca_system_score_gemma":0.005774098,"threshold_uncertainty_score":0.08427751},"labels":[],"label_agreement":null},{"id":"W1608890541","doi":"10.1007/978-3-540-74628-7_38","title":"Appositions Versus Double Subject Sentences – What Information the Speech Analysis Brings to a Grammar Debate","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language, Discourse, Communication Strategies","field":"Arts and Humanities","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":"Compute Canada","funders":"","keywords":"Subject (documents); Linguistics; Romanian; Grammar; Apposition; Generative grammar; Phenomenon; Computer science; Presumption; Order (exchange); Philosophy; Epistemology; Political science","score_opus":0.05134677471573661,"score_gpt":0.2935987820332661,"score_spread":0.2422520073175295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608890541","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.17128803,0.021273077,0.1530794,0.13416868,0.002575592,0.00005796773,0.0005717801,0.0003830023,0.51660246],"genre_scores_gemma":[0.96995497,0.0046845637,0.010185737,0.0029311157,0.0032547223,0.000048059992,0.00022468208,0.00058533816,0.00813081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9951866,0.0031190764,0.00016033862,0.0005078828,0.00077857723,0.0002474319],"domain_scores_gemma":[0.98587704,0.011284668,0.00059459836,0.0011881011,0.000819687,0.00023583244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005672016,0.00065209833,0.0012026993,0.0023574077,0.002231823,0.010092683,0.0016332305,0.00447512,0.009817101],"category_scores_gemma":[0.016187897,0.00074105733,0.00079806044,0.002303826,0.014409817,0.030751847,0.0027238892,0.005881598,0.002187908],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070373106,0.000014496257,0.00025085593,0.00007315992,0.0000226598,0.00010910905,0.0075559514,0.00009952093,0.0008064613,0.97233534,0.0027512133,0.015910985],"study_design_scores_gemma":[0.000018297706,0.00001717452,0.00056532974,0.00014566038,0.0000265668,0.00022623036,0.004246932,0.00075662794,0.0009618247,0.97498524,0.018030597,0.000019581119],"about_ca_topic_score_codex":0.00079022965,"about_ca_topic_score_gemma":0.00067327876,"teacher_disagreement_score":0.010092683,"about_ca_system_score_codex":0.0011994484,"about_ca_system_score_gemma":0.0008685891,"threshold_uncertainty_score":0.032841444},"labels":[],"label_agreement":null},{"id":"W1608928399","doi":"10.1007/3-540-45486-1_6","title":"Using Object Influence Areas to Quantitatively Deal with Neighborhood and Perception in Route Descriptions","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Perception; Object (grammar); Orientation (vector space); Space (punctuation); Object-orientation; Natural (archaeology); Artificial intelligence; Natural language; Human–computer interaction; Theoretical computer science; Object-oriented programming; Geography; Programming language; Mathematics; Epistemology","score_opus":0.036922027060412296,"score_gpt":0.29663438360703764,"score_spread":0.25971235654662533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608928399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15807602,0.00048362414,0.83828455,0.000050374758,0.000033308796,0.000055270004,0.00021904013,0.0009137472,0.0018840474],"genre_scores_gemma":[0.7411846,0.00022647758,0.25687402,0.000016703558,0.00003910967,0.00007405909,0.00031312392,0.00023559849,0.0010362573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00016327598,0.000036161622,0.00013394452,0.00021013009,0.00004527757],"domain_scores_gemma":[0.99789363,0.0012861631,0.00020852759,0.00020185472,0.00034088903,0.000068901834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012093494,0.00082562485,0.00065634627,0.002932603,0.00039286935,0.0013508173,0.0008124828,0.0006450923,0.00088858104],"category_scores_gemma":[0.0051050032,0.00054672395,0.00067904225,0.0022500094,0.00068853097,0.0021718028,0.00094886223,0.00047628063,0.00021781611],"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.00043051637,0.00021627129,0.035408255,0.00031725917,0.00042187347,0.0002000503,0.0010855029,0.35456133,0.05301719,0.021119079,0.0016789684,0.5315436],"study_design_scores_gemma":[0.000011241781,0.00004815976,0.009089997,0.000010335586,0.000088362176,0.000121278514,0.0001088312,0.97170895,0.010293422,0.007452275,0.0010356021,0.00003147278],"about_ca_topic_score_codex":0.011111812,"about_ca_topic_score_gemma":0.014132123,"teacher_disagreement_score":0.011111812,"about_ca_system_score_codex":0.00068357924,"about_ca_system_score_gemma":0.00042583386,"threshold_uncertainty_score":0.02209431},"labels":[],"label_agreement":null},{"id":"W1609143095","doi":"10.1007/978-3-540-69295-9_26","title":"An Evaluation Study of the Effectiveness of Modeling NASA Swarm-Based Exploration Missions with ASSL","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Computer science; Swarm behaviour; Software engineering; Systems engineering; Artificial intelligence; Engineering","score_opus":0.08366728721329393,"score_gpt":0.3265659421670226,"score_spread":0.2428986549537287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609143095","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.96605575,0.00050271314,0.027289042,0.0003098352,0.00005413755,0.00006715914,0.00040353363,0.00074331835,0.004574509],"genre_scores_gemma":[0.99103713,0.00009247563,0.008189454,0.000021364904,0.000011111981,0.00001777655,0.00018173213,0.00004376546,0.0004050704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937266,0.00034014697,0.00004705096,0.000091322516,0.00009732789,0.00005145197],"domain_scores_gemma":[0.9892736,0.008498477,0.00069031236,0.0004942338,0.00080163975,0.00024163957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022593248,0.001333563,0.00077884854,0.00061637675,0.00050033873,0.0009854143,0.0010993808,0.001183897,0.0014301016],"category_scores_gemma":[0.007671905,0.00039810492,0.00059373275,0.00046967663,0.0006917877,0.0014144912,0.0006089929,0.0007354961,0.00018881618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045833923,0.00018605363,0.003582929,0.00006364812,0.000063031264,0.000031053238,0.00003586464,0.98688704,0.0008499095,0.00034993532,0.00016045543,0.007331752],"study_design_scores_gemma":[0.000022160508,0.00018740533,0.00044824707,0.0000044574194,0.000017492945,0.000006925192,0.000021507869,0.9985378,0.0005894803,0.000086516084,0.00007403854,0.0000039926035],"about_ca_topic_score_codex":0.03432376,"about_ca_topic_score_gemma":0.015861886,"teacher_disagreement_score":0.03432376,"about_ca_system_score_codex":0.001026547,"about_ca_system_score_gemma":0.00082497176,"threshold_uncertainty_score":0.068247914},"labels":[],"label_agreement":null},{"id":"W160920134","doi":"10.1007/978-3-642-22092-0_15","title":"A Convex Max-Flow Segmentation of LV Using Subject-Specific Distributions on Cardiac MRI","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"St Joseph's Health Care; CARE Canada; Robarts Clinical Trials; Western University","funders":"","keywords":"Bhattacharyya distance; Mathematics; Regular polygon; Mathematical optimization; Segmentation; Convex optimization; Algorithm; Computer science; Artificial intelligence; Geometry","score_opus":0.03459903390378626,"score_gpt":0.2852454452730724,"score_spread":0.2506464113692861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160920134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068731243,0.00018619144,0.9915685,0.00015742703,0.000013129801,0.00004654182,0.00010559831,0.0007294741,0.00032012246],"genre_scores_gemma":[0.11814488,0.0006216167,0.87743366,0.00016835054,0.00011599101,0.00015845353,0.00056997326,0.0006634216,0.0021236301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996153,0.00010705646,0.000027844266,0.000093343806,0.000102078804,0.000054220982],"domain_scores_gemma":[0.9993717,0.00030174205,0.00006799891,0.000072168856,0.00012782365,0.00005855927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015458579,0.0011893043,0.002178163,0.0017373799,0.00081865175,0.0019639838,0.0015078656,0.0020256853,0.001920447],"category_scores_gemma":[0.0025450662,0.0014061447,0.001791443,0.0012489639,0.00090457726,0.001101683,0.0017066508,0.0014745593,0.0010216555],"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.00068875327,0.00016307966,0.0016123663,0.00032652158,0.00015009053,0.00038953623,0.00020294255,0.35821265,0.05773362,0.01152058,0.0053727506,0.56362706],"study_design_scores_gemma":[0.000013015048,0.000039163497,0.00043765854,0.000016064607,0.00001953185,0.000114899645,0.0000112749785,0.9889972,0.0054812343,0.004088205,0.0007663729,0.000015285246],"about_ca_topic_score_codex":0.007475984,"about_ca_topic_score_gemma":0.007954673,"teacher_disagreement_score":0.007475984,"about_ca_system_score_codex":0.0009861196,"about_ca_system_score_gemma":0.0025471675,"threshold_uncertainty_score":0.014864922},"labels":[],"label_agreement":null},{"id":"W1609212254","doi":"10.1007/978-3-642-04103-7_6","title":"Code Generation for Polynomial Multiplication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Multiplication (music); Polynomial; Parallel computing; Arithmetic; Programming language; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.021907586001719367,"score_gpt":0.2556619763726521,"score_spread":0.2337543903709327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609212254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019151095,0.0018094559,0.92013836,0.00035827517,0.0005258442,0.00018468579,0.00035315077,0.0059391963,0.051539857],"genre_scores_gemma":[0.33627787,0.0017640892,0.5849954,0.00043050622,0.00036981425,0.00046304107,0.001960516,0.0022205738,0.07151815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995415,0.00007748129,0.000022008286,0.0000674462,0.00023382445,0.000057813053],"domain_scores_gemma":[0.99952495,0.00015749555,0.000027194306,0.0001363347,0.00013665624,0.000017364266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025805712,0.00068494445,0.00046185896,0.00089684874,0.0006003338,0.0008188402,0.0006842855,0.0005801431,0.013468756],"category_scores_gemma":[0.0014035879,0.00032738262,0.00040656765,0.0009752756,0.00048127273,0.0009847296,0.0009951328,0.00083049404,0.0047963643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015254188,0.000056611545,0.00022258471,0.00030010004,0.000021681906,0.00022427506,0.00018083864,0.009814013,0.027843783,0.24518156,0.031588487,0.6844135],"study_design_scores_gemma":[0.00011516942,0.00023387712,0.000490783,0.00028279767,0.000055621804,0.0016173451,0.00006684261,0.18864338,0.15571642,0.45535392,0.19733071,0.000093137176],"about_ca_topic_score_codex":0.00036788773,"about_ca_topic_score_gemma":0.000494731,"teacher_disagreement_score":0.013468756,"about_ca_system_score_codex":0.00046892196,"about_ca_system_score_gemma":0.0005248279,"threshold_uncertainty_score":0.045057416},"labels":[],"label_agreement":null},{"id":"W1609271133","doi":"10.1007/978-3-642-16599-3_14","title":"Event Exposure for Web Services: A Grey-Box Approach to Compose and Evolve Web Services","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Web service; Adaptability; Services computing; Service-oriented architecture; Flexibility (engineering); World Wide Web; Web modeling; Mashup; WS-Policy; Web development; Component-based software engineering; Software engineering; Service (business); Rich Internet application; The Internet; Software; Web application security; Software system; Operating system","score_opus":0.008949053594957648,"score_gpt":0.22651251773530157,"score_spread":0.21756346414034392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609271133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026011078,0.00011941743,0.9858525,0.00017985469,0.000044946006,0.00007129123,0.000024356916,0.0015192509,0.009587407],"genre_scores_gemma":[0.11951498,0.0006872219,0.83276284,0.00026629402,0.000076813594,0.00018459778,0.00020663485,0.0015730651,0.04472764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990318,0.0002440231,0.000059239228,0.00019188276,0.00039484215,0.00007831033],"domain_scores_gemma":[0.99915004,0.00042998913,0.000035116467,0.00022504467,0.00008288316,0.00007683327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016677371,0.0006754037,0.0006180306,0.0005808887,0.00072241423,0.0030806302,0.0016759512,0.0015078333,0.01444902],"category_scores_gemma":[0.0028965771,0.00064196624,0.0011512213,0.00067267235,0.0019040087,0.0049556945,0.0035543307,0.002397228,0.0027178223],"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.00020192727,0.00013652246,0.0004721567,0.00032482034,0.00005622273,0.00045449845,0.0024999871,0.020387866,0.023328388,0.6632845,0.0072167055,0.28163642],"study_design_scores_gemma":[0.00007559829,0.000153795,0.00031267665,0.00020809515,0.00011002078,0.0006808831,0.00047288914,0.30668592,0.0374339,0.42708808,0.22670418,0.000074027004],"about_ca_topic_score_codex":0.0011002456,"about_ca_topic_score_gemma":0.0011861145,"teacher_disagreement_score":0.01444902,"about_ca_system_score_codex":0.00072020944,"about_ca_system_score_gemma":0.0008170265,"threshold_uncertainty_score":0.048336804},"labels":[],"label_agreement":null},{"id":"W1609886867","doi":"10.1007/11552499_47","title":"Semantic-Based Cross-Media Image Retrieval","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Information retrieval; Image retrieval; Visual Word; Feature (linguistics); Annotation; Automatic image annotation; Artificial intelligence; Image (mathematics)","score_opus":0.017403266127068596,"score_gpt":0.27249450600114555,"score_spread":0.25509123987407695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609886867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048960015,0.007504914,0.91624093,0.00034795204,0.00072604266,0.00022091922,0.0010452274,0.004861364,0.02009261],"genre_scores_gemma":[0.35296592,0.006400523,0.59738064,0.00047808082,0.00071349146,0.00019703982,0.005148586,0.00062113954,0.036094647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939334,0.000083585364,0.000041199342,0.000095323565,0.00030579767,0.000080677324],"domain_scores_gemma":[0.9996449,0.00007343764,0.000016578104,0.000067727575,0.00018284893,0.00001458627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072238327,0.0008917871,0.0012576974,0.003242511,0.0004442626,0.0012348273,0.0011473901,0.000992754,0.007979626],"category_scores_gemma":[0.0010418186,0.000314836,0.00090365467,0.0032019995,0.0005096241,0.0024982553,0.0012266927,0.000503914,0.0039596553],"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.00064453133,0.00023048923,0.00035581502,0.00035557555,0.00013051335,0.00014312957,0.000046232828,0.0063942075,0.10881311,0.0048172316,0.014291434,0.8637777],"study_design_scores_gemma":[0.00012644578,0.00048732068,0.0051461924,0.00007917312,0.0005349346,0.0024008802,0.00029247173,0.6423748,0.2948421,0.01745316,0.03612948,0.00013296914],"about_ca_topic_score_codex":0.0020904914,"about_ca_topic_score_gemma":0.0036628034,"teacher_disagreement_score":0.007979626,"about_ca_system_score_codex":0.00038513727,"about_ca_system_score_gemma":0.00036959263,"threshold_uncertainty_score":0.026694536},"labels":[],"label_agreement":null},{"id":"W1611084195","doi":"10.1007/978-3-540-31987-0_3","title":"The ASTREÉ Analyzer","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":392,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Computer science; Correctness; Programming language; Abstract interpretation; Spectrum analyzer; Software; Computation; Interpretation (philosophy); Memory safety; Algorithm","score_opus":0.021709104061219522,"score_gpt":0.27788635020231167,"score_spread":0.25617724614109216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611084195","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.007409723,0.00070651557,0.5542204,0.00063333457,0.00047179262,0.00029986876,0.0055146497,0.33662418,0.09411953],"genre_scores_gemma":[0.13791464,0.0010798125,0.51981354,0.0019623213,0.00032409106,0.0005309393,0.03159899,0.12653081,0.1802449],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99708337,0.0005327332,0.00020504584,0.0007534972,0.0011433704,0.00028200363],"domain_scores_gemma":[0.99736845,0.000697971,0.00009515031,0.001273154,0.0004980307,0.000067234905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015101294,0.0017850746,0.0013925113,0.0022769808,0.0008792715,0.0037775554,0.0027359012,0.001386637,0.06724998],"category_scores_gemma":[0.005555473,0.0017517046,0.0018655448,0.0014924862,0.0007640185,0.006397686,0.0030142672,0.0023876058,0.061807487],"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.00090682524,0.00027395049,0.0021895992,0.0005923106,0.00015163317,0.00038892496,0.00032289693,0.0028977839,0.022743136,0.0994715,0.36989132,0.5001701],"study_design_scores_gemma":[0.00022541572,0.00013539765,0.001720369,0.00021342216,0.00022849366,0.0012048059,0.00020610933,0.06240632,0.10983448,0.11038107,0.71326363,0.00018045455],"about_ca_topic_score_codex":0.001595249,"about_ca_topic_score_gemma":0.0021383832,"teacher_disagreement_score":0.06724998,"about_ca_system_score_codex":0.0007075608,"about_ca_system_score_gemma":0.0017925747,"threshold_uncertainty_score":0.22497362},"labels":[],"label_agreement":null},{"id":"W1611222858","doi":"10.1007/978-3-642-02457-3_56","title":"On-Demand Chaotic Neural Network for Broadcast Scheduling Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Time division multiple access; Chaotic; Scheduling (production processes); Noise (video); Artificial neural network; Network packet; Mathematical optimization; Real-time computing; Computer network; Algorithm; Artificial intelligence; Mathematics","score_opus":0.019035469822240147,"score_gpt":0.25105701064078095,"score_spread":0.23202154081854082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611222858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21071298,0.0014621442,0.76630217,0.001961029,0.0002947835,0.00014659487,0.0004193616,0.0003296811,0.01837123],"genre_scores_gemma":[0.9762165,0.00035469298,0.01674377,0.00009864857,0.00010449627,0.00010601599,0.00017869593,0.000038768147,0.006158396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999775,0.0000626737,0.000010281536,0.00004986844,0.000034934943,0.00006736115],"domain_scores_gemma":[0.9989039,0.00077308825,0.00008572602,0.00003512895,0.00013650685,0.00006567954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066401745,0.00069410005,0.0013829073,0.00038957954,0.00044074046,0.00074298563,0.0013576567,0.0016614302,0.004739245],"category_scores_gemma":[0.0024978777,0.00047796685,0.0003901454,0.0005915485,0.00056231313,0.0010531523,0.00086782756,0.0011718286,0.00021634388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015948746,0.000036630583,0.00023667216,0.00009101493,0.000017903369,0.000038957038,0.000022194385,0.9804585,0.00070325425,0.0048847143,0.0015227831,0.011827899],"study_design_scores_gemma":[0.000008187898,0.000008971294,0.000031512765,0.0000017733362,0.0000024325936,0.0000029950818,0.0000031745524,0.9984156,0.000053061915,0.0014206688,0.00005019477,0.000001441165],"about_ca_topic_score_codex":0.008868152,"about_ca_topic_score_gemma":0.0064181183,"teacher_disagreement_score":0.008868152,"about_ca_system_score_codex":0.0011178954,"about_ca_system_score_gemma":0.00086616375,"threshold_uncertainty_score":0.01763308},"labels":[],"label_agreement":null},{"id":"W1612175259","doi":"10.1007/978-3-319-11755-3","title":"Image Analysis and Recognition","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":607,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.012605590466771965,"score_gpt":0.22285932852126172,"score_spread":0.21025373805448977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612175259","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022093903,0.014864199,0.76743346,0.0006609499,0.0021148138,0.00025571987,0.0017391338,0.012826377,0.19789593],"genre_scores_gemma":[0.016412005,0.012799316,0.23906282,0.00067401875,0.00073278876,0.00024200717,0.0049081575,0.001927387,0.7232415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995478,0.000019920972,0.000019009794,0.00010830406,0.00027558574,0.000029311046],"domain_scores_gemma":[0.99967504,0.00004184812,0.000012096407,0.0001117266,0.00014021515,0.00001902767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033388173,0.0014338216,0.0011212758,0.002092645,0.00043110148,0.0018723871,0.0015955324,0.00096198934,0.09915791],"category_scores_gemma":[0.00056938856,0.0006096523,0.0007421634,0.0018589338,0.0005314833,0.0013496322,0.0013108093,0.0010059534,0.12291661],"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.000037282953,0.000030667827,0.00006856024,0.00028853244,0.000024971581,0.00005133524,0.000027221467,0.00091398053,0.028515901,0.0078037083,0.12381897,0.8384188],"study_design_scores_gemma":[0.000010835538,0.00007181034,0.00089571776,0.00011420978,0.0000395366,0.00073232193,0.00003905564,0.009338535,0.04894787,0.011509384,0.92826056,0.000040117066],"about_ca_topic_score_codex":0.0008123345,"about_ca_topic_score_gemma":0.0013501946,"teacher_disagreement_score":0.09915791,"about_ca_system_score_codex":0.00035849918,"about_ca_system_score_gemma":0.0005355023,"threshold_uncertainty_score":0.33171624},"labels":[],"label_agreement":null},{"id":"W16123658","doi":"10.1007/978-3-642-39617-5_4","title":"LegalRuleML: From Metamodel to Use Cases","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"RuleML; Computer science; XML; Semantics of Business Vocabulary and Business Rules; Metamodeling; Programming language; World Wide Web; Domain (mathematical analysis); Software engineering; Information retrieval; Efficient XML Interchange; Document type definition; Business rule; Work in process; Business process; Business","score_opus":0.0454415761894465,"score_gpt":0.25864026623570807,"score_spread":0.21319869004626157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16123658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016765202,0.00041272552,0.9351197,0.00223751,0.00032052977,0.00026931788,0.004671742,0.03856924,0.01672287],"genre_scores_gemma":[0.059317935,0.0016348292,0.8779086,0.0018995991,0.00035398777,0.0007680423,0.019516097,0.020612797,0.017988065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99288905,0.0021907375,0.0009640076,0.000829352,0.0027584995,0.0003682604],"domain_scores_gemma":[0.9928363,0.003990943,0.0003731053,0.0016931479,0.0008780707,0.00022850554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00499907,0.0017210771,0.0011466307,0.00542951,0.0011899446,0.009499796,0.0045809993,0.003723021,0.018566603],"category_scores_gemma":[0.017774103,0.002486681,0.0022029644,0.0033309956,0.0038365782,0.0126760695,0.0054126084,0.0065569435,0.010190718],"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.00011438751,0.00029312103,0.0007313833,0.0010404693,0.00006596538,0.00089948083,0.0017917327,0.012028466,0.0037293662,0.6281354,0.13107911,0.22009113],"study_design_scores_gemma":[0.00008187471,0.000023076052,0.0001813316,0.00058706966,0.000054954653,0.0005929728,0.00029303168,0.063725516,0.0083297035,0.45591375,0.4701266,0.000090048605],"about_ca_topic_score_codex":0.0064832824,"about_ca_topic_score_gemma":0.0064559365,"teacher_disagreement_score":0.018566603,"about_ca_system_score_codex":0.002099925,"about_ca_system_score_gemma":0.0035139653,"threshold_uncertainty_score":0.062111497},"labels":[],"label_agreement":null},{"id":"W16126390","doi":"10.1007/978-3-642-37198-1_4","title":"A New Crossover for Solving Constraint Satisfaction Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Crossover; Constraint satisfaction problem; Computer science; Heuristic; Constraint satisfaction; Solver; Mathematical optimization; Constraint (computer-aided design); Genetic algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.017153264294315934,"score_gpt":0.23975248087480078,"score_spread":0.22259921658048484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16126390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01743654,0.0013243993,0.9673701,0.00028587316,0.0008291001,0.00021180949,0.00018322859,0.0013554553,0.011003539],"genre_scores_gemma":[0.10099298,0.00086468615,0.87769026,0.0003670832,0.00037761888,0.0004350696,0.00044139472,0.00061921193,0.018211704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922955,0.0001661197,0.000047842972,0.00015388739,0.0003271838,0.000075376665],"domain_scores_gemma":[0.9991899,0.000423978,0.000037409594,0.00014568324,0.00015302778,0.000049954313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595167,0.0009478005,0.0012075704,0.0013425612,0.0007637056,0.0010074668,0.002093968,0.0013172695,0.010689561],"category_scores_gemma":[0.002272375,0.00042340014,0.0011970224,0.0023113417,0.0007474309,0.0013850762,0.0012961945,0.0020031368,0.0009698462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036354264,0.00027228892,0.0005140852,0.00054191286,0.00016665096,0.00038192215,0.00029883476,0.07054472,0.029016625,0.07448814,0.014763411,0.80864775],"study_design_scores_gemma":[0.00083134463,0.00085211114,0.0017143508,0.00023187014,0.00040945064,0.0011445988,0.00014031309,0.78591067,0.019760003,0.11537172,0.07348316,0.0001503552],"about_ca_topic_score_codex":0.001033657,"about_ca_topic_score_gemma":0.0014957757,"teacher_disagreement_score":0.010689561,"about_ca_system_score_codex":0.00063968933,"about_ca_system_score_gemma":0.0005375781,"threshold_uncertainty_score":0.035760105},"labels":[],"label_agreement":null},{"id":"W1613559259","doi":"10.1007/978-3-642-04146-4_45","title":"On Improving the Efficiency of Eigenface Using a Novel Facial Feature Localization","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Eigenface; Computer science; Facial recognition system; Preprocessor; Robustness (evolution); Biometrics; Artificial intelligence; Pattern recognition (psychology); Feature extraction; Face (sociological concept); Computer vision","score_opus":0.018204674089456873,"score_gpt":0.24678818329599048,"score_spread":0.2285835092065336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613559259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015809959,0.00040217215,0.9807668,0.00008127011,0.00006706667,0.000027320437,0.000036334597,0.0016238374,0.0011852465],"genre_scores_gemma":[0.12537077,0.0005851785,0.86805934,0.00013833815,0.00006784271,0.000069898204,0.00024890542,0.0003494707,0.0051103183],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920696,0.00015317422,0.00003951817,0.0001550997,0.0003659271,0.000079307436],"domain_scores_gemma":[0.9990722,0.00035253362,0.00003534137,0.00026800195,0.00024593313,0.000025904701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071061216,0.0011404325,0.0011929595,0.00085033395,0.00042244187,0.0006928589,0.0011579368,0.0008165233,0.005140572],"category_scores_gemma":[0.0019276233,0.00040829624,0.0007540632,0.0010670429,0.00039955365,0.002018113,0.0011391779,0.00082947774,0.0026688816],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002476878,0.00012342808,0.00064072345,0.0000825542,0.000058262718,0.00006408515,0.000060061637,0.015320791,0.1486821,0.0048232363,0.0039084256,0.82598877],"study_design_scores_gemma":[0.00003247899,0.00017042055,0.0017795324,0.00001646255,0.00006742408,0.00053760596,0.00004681915,0.8803543,0.10898797,0.0038809387,0.0040894104,0.00003665021],"about_ca_topic_score_codex":0.0027230356,"about_ca_topic_score_gemma":0.003629946,"teacher_disagreement_score":0.005140572,"about_ca_system_score_codex":0.0002564525,"about_ca_system_score_gemma":0.0004688359,"threshold_uncertainty_score":0.017196953},"labels":[],"label_agreement":null},{"id":"W1614783246","doi":"10.1007/978-3-540-74484-9_89","title":"Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Maximization; Computer science; Scheduling (production processes); Minimax; Schedule; Minification; Job shop scheduling; Function (biology); Set (abstract data type); Mathematics","score_opus":0.0572420048960475,"score_gpt":0.283822231945605,"score_spread":0.22658022704955752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614783246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09957413,0.0014643659,0.87998277,0.0006375327,0.00018219948,0.00017608423,0.0002208334,0.0007833433,0.016978739],"genre_scores_gemma":[0.6629282,0.0005664933,0.3312206,0.00013893521,0.00015098932,0.00017334339,0.00056023477,0.0003963165,0.0038647882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943234,0.0024871123,0.00024940752,0.0005301189,0.0016825697,0.0007274329],"domain_scores_gemma":[0.987092,0.010247421,0.00053212827,0.0006499463,0.0011095002,0.0003689659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007116942,0.0017356713,0.0014750038,0.0013784505,0.0007847026,0.002667713,0.0025126343,0.0014541502,0.005737048],"category_scores_gemma":[0.022189757,0.00080826145,0.0012142337,0.0017834193,0.001455406,0.003109196,0.0016692271,0.001600149,0.00052919745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010449208,0.00018878758,0.0010366961,0.00030415074,0.000106944775,0.00019323155,0.00011482126,0.8338073,0.00435972,0.038356695,0.003636601,0.11685016],"study_design_scores_gemma":[0.000027276696,0.00009012962,0.00013228199,0.000020660813,0.000021393724,0.00004600689,0.000035456327,0.9764791,0.0017997146,0.020819321,0.0005201132,0.000008565266],"about_ca_topic_score_codex":0.0019799815,"about_ca_topic_score_gemma":0.0030511648,"teacher_disagreement_score":0.007116942,"about_ca_system_score_codex":0.001753308,"about_ca_system_score_gemma":0.0011030666,"threshold_uncertainty_score":0.037638426},"labels":[],"label_agreement":null},{"id":"W1614802925","doi":"10.1007/11428831_126","title":"The Visualization of Linear Algebra Algorithms in Apt Apprentice","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetics, Bioinformatics, and Biomedical Research","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 New Brunswick","funders":"","keywords":"Computer science; Apprenticeship; Linear programming; Linear algebra; Software; Visualization; Programming language; Algorithm; Software engineering; Overhead (engineering); Artificial intelligence; Mathematics","score_opus":0.014527517468759658,"score_gpt":0.28840057363974636,"score_spread":0.27387305617098673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614802925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008269348,0.0008453151,0.9481353,0.0006305022,0.00018113751,0.000051045623,0.00074155757,0.025254747,0.015891008],"genre_scores_gemma":[0.11712112,0.0013881549,0.85298866,0.00028750554,0.000183336,0.00019660137,0.0018376322,0.005364326,0.020632641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.00019062898,0.000027701157,0.000068068744,0.00017797525,0.000037804755],"domain_scores_gemma":[0.9982231,0.0009894578,0.000056246245,0.00031248134,0.00028700288,0.00013156766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008349614,0.0009983663,0.0006594075,0.0011059253,0.00046519024,0.0034351056,0.0011698534,0.0007129574,0.03121872],"category_scores_gemma":[0.0034719773,0.00060241006,0.00078936934,0.001118126,0.00052671076,0.0029379844,0.0017166123,0.0016403681,0.0052226842],"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.0004732092,0.00015793907,0.001149741,0.00055069616,0.000083886334,0.00031709054,0.0009262857,0.036310464,0.02039881,0.17909291,0.13010395,0.63043505],"study_design_scores_gemma":[0.00009225945,0.00008804634,0.001210415,0.00012501144,0.000033123062,0.00046300693,0.00025063276,0.5790025,0.02529669,0.2667615,0.126606,0.000070715454],"about_ca_topic_score_codex":0.0012336986,"about_ca_topic_score_gemma":0.0016449444,"teacher_disagreement_score":0.03121872,"about_ca_system_score_codex":0.0004298337,"about_ca_system_score_gemma":0.00048556735,"threshold_uncertainty_score":0.10443699},"labels":[],"label_agreement":null},{"id":"W16151075","doi":"10.1007/978-3-642-38768-5_28","title":"An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of New Brunswick","funders":"","keywords":"Rounding; Semidefinite programming; Computer science; Semidefinite embedding; Bisection method; Graph; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Quadratically constrained quadratic program","score_opus":0.02390558049323789,"score_gpt":0.27698206770268197,"score_spread":0.2530764872094441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16151075","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.018660944,0.00044839116,0.9558161,0.0006524871,0.00039385486,0.00023480791,0.0003827948,0.0026963756,0.020714207],"genre_scores_gemma":[0.109174035,0.0002855463,0.8773594,0.00041777184,0.00018298245,0.00041626458,0.0011091563,0.0006050108,0.0104497615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822694,0.0004312181,0.00008791476,0.0003643766,0.0006377486,0.0002518504],"domain_scores_gemma":[0.99763,0.0010848886,0.000130695,0.0005555456,0.0004412193,0.00015759894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014721075,0.001736206,0.0021156783,0.0012010376,0.0011630302,0.0032388638,0.0034992595,0.0017631509,0.015376953],"category_scores_gemma":[0.0051413085,0.0009439677,0.0014864971,0.0027672881,0.000752953,0.0030025356,0.002926516,0.005583424,0.0039915084],"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.0008554545,0.0010352304,0.00049529976,0.00049963477,0.000092887974,0.00014101066,0.00025055776,0.28510046,0.0073327483,0.091640055,0.045451634,0.56710505],"study_design_scores_gemma":[0.00012199235,0.00011064667,0.00011977046,0.000036636535,0.000022363345,0.000074701544,0.000056424906,0.9531086,0.0019145355,0.039437573,0.004974737,0.000021992184],"about_ca_topic_score_codex":0.0030773322,"about_ca_topic_score_gemma":0.0052333204,"teacher_disagreement_score":0.015376953,"about_ca_system_score_codex":0.0017236195,"about_ca_system_score_gemma":0.0026176996,"threshold_uncertainty_score":0.051441014},"labels":[],"label_agreement":null},{"id":"W161643058","doi":"10.1007/978-3-642-40843-4_15","title":"Towards CT Enhanced Ultrasound Guidance for Off-pump Beating Heart Mitral Valve Repair","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Context (archaeology); Image registration; Flexibility (engineering); Ultrasound; Workflow; Orientation (vector space); Medicine; Radiology; Image (mathematics)","score_opus":0.015532753459340309,"score_gpt":0.30968645536334477,"score_spread":0.29415370190400447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161643058","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.029418986,0.1609257,0.7251403,0.006399489,0.0026671584,0.00018655411,0.00027889843,0.0015122626,0.073470734],"genre_scores_gemma":[0.11934793,0.124627404,0.68051034,0.0062289513,0.0028233142,0.0001597191,0.00057316537,0.00078001496,0.06494921],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998636,0.000029821085,0.000010568677,0.000024880355,0.00006096813,0.00000998683],"domain_scores_gemma":[0.9997075,0.00015071985,0.000017888107,0.00002068525,0.00006677395,0.00003646551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005515245,0.00046469408,0.00027299608,0.0005007018,0.00013439913,0.0014301485,0.00080261263,0.001531288,0.004985469],"category_scores_gemma":[0.0010387884,0.0004115104,0.0004120309,0.0002711466,0.00046686298,0.0011764601,0.00086657406,0.002295578,0.0023080243],"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.00027047624,0.00013215542,0.00090667827,0.0018683644,0.00006035826,0.0027684856,0.00044554463,0.005642553,0.21549581,0.013617676,0.024597077,0.7341949],"study_design_scores_gemma":[0.00017893358,0.0016353602,0.010021957,0.0037516716,0.0003209737,0.07417946,0.00038812365,0.053184304,0.11147982,0.032876797,0.7116565,0.00032606575],"about_ca_topic_score_codex":0.0007187829,"about_ca_topic_score_gemma":0.0012546009,"teacher_disagreement_score":0.004985469,"about_ca_system_score_codex":0.00024198908,"about_ca_system_score_gemma":0.0004310392,"threshold_uncertainty_score":0.016678095},"labels":[],"label_agreement":null},{"id":"W1616547254","doi":"10.1007/978-3-540-75560-9_31","title":"Faster Phylogenetic Inference with MXG","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Cardinality (data modeling); Axiom; Computer science; Solver; Inference; Set (abstract data type); Task (project management); Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics; Artificial intelligence; Data mining","score_opus":0.039651879295529914,"score_gpt":0.2954027223685919,"score_spread":0.25575084307306195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616547254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013638925,0.00044271862,0.9530681,0.00064522005,0.00037633214,0.00012585153,0.00091180886,0.017373681,0.013417425],"genre_scores_gemma":[0.16572565,0.00028236018,0.8164405,0.0005807379,0.00029342575,0.00021682725,0.0021211184,0.0036558716,0.010683544],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99779713,0.00071204506,0.0001275699,0.0005746694,0.0005847284,0.00020388629],"domain_scores_gemma":[0.9927448,0.0039017322,0.00018885662,0.0026633574,0.00038036177,0.00012089302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025028086,0.0010670603,0.001973963,0.0018130203,0.0011214777,0.0022844123,0.0033751188,0.0017974122,0.04018428],"category_scores_gemma":[0.01221454,0.0012261297,0.0024057396,0.002070278,0.0015308594,0.0075951293,0.0049156556,0.0032802834,0.0082686255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007064576,0.00016031183,0.0017683594,0.0009042804,0.00021573878,0.00034369284,0.00055112527,0.02888177,0.011589391,0.323277,0.033013567,0.5985882],"study_design_scores_gemma":[0.0002100611,0.00007525264,0.00062160986,0.00011521579,0.00016835237,0.00024516488,0.00012319825,0.17107986,0.008224947,0.7826464,0.03644569,0.000044203534],"about_ca_topic_score_codex":0.0019154387,"about_ca_topic_score_gemma":0.004457357,"teacher_disagreement_score":0.04018428,"about_ca_system_score_codex":0.0012547539,"about_ca_system_score_gemma":0.0012749692,"threshold_uncertainty_score":0.13442981},"labels":[],"label_agreement":null},{"id":"W161656634","doi":"10.1007/978-3-319-11740-9_16","title":"A Web-Based Learning Support System for Rough Sets","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Personalization; Adaptation (eye); Rough set; Popularity; Schedule; Preference learning; Artificial intelligence; Machine learning; Preference; World Wide Web; Mathematics; Psychology","score_opus":0.018310758332645793,"score_gpt":0.2415516306714565,"score_spread":0.2232408723388107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161656634","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03999849,0.0004375343,0.91506004,0.00030383776,0.00017260898,0.00032230833,0.0009801897,0.03821869,0.0045062588],"genre_scores_gemma":[0.380098,0.0004125096,0.60777503,0.0003161536,0.00017734442,0.0004973401,0.0024159618,0.0005662673,0.0077414336],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993187,0.00009920071,0.00008914268,0.00009429596,0.00035849653,0.00004028788],"domain_scores_gemma":[0.998868,0.00045850175,0.00006526646,0.00019049831,0.000334994,0.00008278363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091630535,0.00045181662,0.00118349,0.0016117394,0.0005513106,0.001994632,0.0011409107,0.0010857292,0.007957439],"category_scores_gemma":[0.002714126,0.00028609097,0.00077179325,0.0012154098,0.00019278293,0.0020018066,0.0013991632,0.0009407341,0.0039042153],"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.0013423273,0.0007173362,0.0017902296,0.00030746238,0.00017057151,0.0006385945,0.0002594813,0.018032778,0.024822876,0.0059811003,0.020145567,0.92579174],"study_design_scores_gemma":[0.00032224506,0.00035011294,0.0029914577,0.00007606086,0.00023957124,0.0006529665,0.0001424976,0.9196576,0.031649955,0.01624194,0.027563851,0.00011176129],"about_ca_topic_score_codex":0.0011314442,"about_ca_topic_score_gemma":0.00086468976,"teacher_disagreement_score":0.007957439,"about_ca_system_score_codex":0.00033602573,"about_ca_system_score_gemma":0.00041934696,"threshold_uncertainty_score":0.026620269},"labels":[],"label_agreement":null},{"id":"W1616684518","doi":"10.1007/978-3-642-18348-5_4","title":"Improving User Experience by Taking Advance of Semantic Information of Microformats on Municipal Websites","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Institute on Governance","funders":"","keywords":"Computer science; World Wide Web; Semantic Web; Government (linguistics); E-Government; Information retrieval","score_opus":0.03143049114989409,"score_gpt":0.2562477501156608,"score_spread":0.2248172589657667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616684518","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.8740227,0.0006517071,0.06575861,0.00053316867,0.000058361544,0.000092985814,0.0014354638,0.0055537876,0.051893182],"genre_scores_gemma":[0.9485179,0.00043483352,0.041691083,0.000082589606,0.000027226824,0.000026708945,0.0015283932,0.0004067351,0.0072845947],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995272,0.00014205494,0.000028106562,0.000058377227,0.00019415273,0.0000501307],"domain_scores_gemma":[0.9985936,0.0005815383,0.000117941556,0.00025488355,0.00035924415,0.00009269752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043060473,0.00036863884,0.00026388414,0.00083355635,0.00029629562,0.0021113057,0.0003847646,0.00048155128,0.0060322694],"category_scores_gemma":[0.0030398981,0.00017913384,0.000322857,0.0011308548,0.00016550154,0.0043289852,0.0008310755,0.0004872302,0.0017222736],"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.0012750123,0.0011863608,0.061445523,0.00076086767,0.000114174625,0.00060936064,0.010843037,0.004000977,0.074754134,0.005416275,0.020249983,0.8193443],"study_design_scores_gemma":[0.000115392424,0.0022931767,0.35537156,0.0005782442,0.0014923841,0.0024799644,0.04075091,0.18343984,0.16359083,0.029126633,0.22028297,0.00047814284],"about_ca_topic_score_codex":0.0021273447,"about_ca_topic_score_gemma":0.004287605,"teacher_disagreement_score":0.0060322694,"about_ca_system_score_codex":0.00022265507,"about_ca_system_score_gemma":0.00029567705,"threshold_uncertainty_score":0.020179927},"labels":[],"label_agreement":null},{"id":"W1616708177","doi":"10.1007/978-3-540-24595-7_44","title":"Drawing Area-Proportional Venn and Euler Diagrams","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Census and Population Estimation","field":"Mathematics","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Computer science; Diagram; Population; Euler's formula; Theoretical computer science; Algorithm; Mathematics; Mathematical analysis; Database","score_opus":0.044242539146417854,"score_gpt":0.29340554190526097,"score_spread":0.24916300275884312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616708177","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.019921852,0.00043141053,0.95004785,0.00023151828,0.0001255408,0.00012534806,0.0005691535,0.0012252631,0.027322104],"genre_scores_gemma":[0.16647315,0.000837875,0.8135557,0.00011715803,0.00004878706,0.00012850515,0.0011555112,0.0006260817,0.01705715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993735,0.00019267468,0.000032534663,0.00015553234,0.00019426974,0.000051461826],"domain_scores_gemma":[0.9989485,0.0004935033,0.000056171717,0.00015313152,0.00026852978,0.00008008928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073397777,0.00091408484,0.0007472026,0.0025182432,0.0007592834,0.0018199345,0.0012551862,0.0010471492,0.016796518],"category_scores_gemma":[0.0054320907,0.0009297157,0.0008699836,0.0021066975,0.0006426622,0.0026451894,0.0015523171,0.0011723712,0.0021400545],"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.00018898628,0.000083569714,0.0020908455,0.0004408725,0.00005600683,0.00027674634,0.00059402984,0.15817031,0.004694699,0.40894982,0.017275678,0.40717834],"study_design_scores_gemma":[0.000056583314,0.000044329307,0.0007237886,0.00017725214,0.000059179707,0.00034487253,0.00025813445,0.4776131,0.004664955,0.4303924,0.085614294,0.0000511896],"about_ca_topic_score_codex":0.004777566,"about_ca_topic_score_gemma":0.010434007,"teacher_disagreement_score":0.016796518,"about_ca_system_score_codex":0.00090896373,"about_ca_system_score_gemma":0.00061074074,"threshold_uncertainty_score":0.056190014},"labels":[],"label_agreement":null},{"id":"W1616987857","doi":"10.1007/978-3-642-40104-6_3","title":"Smart-Grid Electricity Allocation via Strip Packing with Slicing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Rectangle; Slicing; Grid; Packing problems; Computer science; Schedule; STRIPS; Stacking; Mathematical optimization; Polynomial-time approximation scheme; Bin packing problem; Time complexity; Algorithm; Heuristic; Set (abstract data type); Electricity; Mathematics; Geometry; Bin; Electrical engineering; Computer graphics (images); Engineering","score_opus":0.009862472271955308,"score_gpt":0.19581568218619436,"score_spread":0.18595320991423905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616987857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03150383,0.0005349111,0.9505049,0.00008378421,0.00011072178,0.000056574565,0.0001364119,0.0010905943,0.015978187],"genre_scores_gemma":[0.7573846,0.00048284477,0.23673743,0.000071052986,0.00005762646,0.00006480359,0.00021820297,0.00016013779,0.0048233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.00006230102,0.000014384166,0.00004171543,0.00007568456,0.000045121487],"domain_scores_gemma":[0.9997768,0.000073821335,0.000021968879,0.00007543191,0.000034561042,0.000017529323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035463457,0.00070915965,0.0011190242,0.00035673642,0.00032796522,0.0009242873,0.0007666375,0.0003648237,0.0050817146],"category_scores_gemma":[0.00056312734,0.0004230322,0.0005236539,0.0013042464,0.000376488,0.0011086272,0.0008450513,0.0005919306,0.00066917285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031871343,0.000071834445,0.00044482638,0.00014648358,0.0000666554,0.00014634199,0.000073828865,0.77714473,0.011537325,0.023160439,0.0052121207,0.18167675],"study_design_scores_gemma":[0.000018199062,0.00006351926,0.00015944698,0.000011007257,0.00001767023,0.000055069835,0.000021115064,0.97631925,0.0033482374,0.017822279,0.0021554811,0.00000877898],"about_ca_topic_score_codex":0.0012139445,"about_ca_topic_score_gemma":0.0018980841,"teacher_disagreement_score":0.0050817146,"about_ca_system_score_codex":0.00046667634,"about_ca_system_score_gemma":0.00045340133,"threshold_uncertainty_score":0.01700002},"labels":[],"label_agreement":null},{"id":"W161702640","doi":"10.1007/978-3-642-21869-9_123","title":"Authoring Step-Based ITS with ASTUS: An Interactive Event","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Tracing; TUTOR; Task (project management); SQL; Domain (mathematical analysis); Event (particle physics); Constraint (computer-aided design); Programming language; Software engineering; Human–computer interaction","score_opus":0.030830466597035665,"score_gpt":0.26769404561365334,"score_spread":0.23686357901661767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161702640","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.012573482,0.00007702194,0.9113792,0.00018086328,0.00031631772,0.00019677133,0.0016724025,0.05155949,0.02204445],"genre_scores_gemma":[0.27287254,0.00028636208,0.65229386,0.00018578609,0.00014838683,0.0005253608,0.0066233217,0.022696137,0.04436825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999073,0.00029587635,0.000077602526,0.00013736139,0.0003351302,0.00008096372],"domain_scores_gemma":[0.9970669,0.0017229699,0.00008204018,0.00065821875,0.00024397882,0.00022590814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016741212,0.0012636725,0.0007524151,0.0008284892,0.0009551985,0.003147113,0.0019775708,0.00150389,0.04734737],"category_scores_gemma":[0.0053255153,0.0008183175,0.0015641392,0.00068333466,0.0011057204,0.0031601922,0.0045439694,0.0019002543,0.008636127],"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.002906612,0.0007284682,0.004078878,0.0020045172,0.0002988259,0.0031997624,0.0073083215,0.10650906,0.048948966,0.28613067,0.16636877,0.3715172],"study_design_scores_gemma":[0.00038444338,0.00020640851,0.0005047004,0.00022999846,0.00012355295,0.00070526067,0.0005956099,0.37594008,0.050323028,0.10270573,0.46815348,0.00012769153],"about_ca_topic_score_codex":0.00078421336,"about_ca_topic_score_gemma":0.0020451332,"teacher_disagreement_score":0.04734737,"about_ca_system_score_codex":0.00051757676,"about_ca_system_score_gemma":0.0006996752,"threshold_uncertainty_score":0.15839273},"labels":[],"label_agreement":null},{"id":"W16170269","doi":"10.1007/978-3-642-21538-4_13","title":"Nonlinear Maneuvering Control of Rigid Formations of Fixed Wing UAVs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fixed wing; Scheme (mathematics); Control theory (sociology); Wing; Nonlinear system; Control (management); Computer science; Control engineering; Engineering; Aerospace engineering; Mathematics; Artificial intelligence","score_opus":0.019222891120044622,"score_gpt":0.22937699827722838,"score_spread":0.21015410715718374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16170269","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.27009913,0.00047397727,0.70826554,0.00014976885,0.00010804527,0.00004443054,0.00006155406,0.0003022314,0.020495353],"genre_scores_gemma":[0.9861226,0.0001371649,0.009486007,0.000013116537,0.0000142358695,0.000021708063,0.000039157436,0.000014492717,0.004151562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999387,0.000008932887,0.000002237863,0.0000141217615,0.000022166301,0.000013751233],"domain_scores_gemma":[0.99993384,0.000015662445,0.000020291842,0.0000091916145,0.00001367238,0.0000073515034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012561103,0.00036583512,0.0002678199,0.00016011196,0.00025859353,0.0003679933,0.0004846855,0.00022306408,0.0007816673],"category_scores_gemma":[0.0003128302,0.00015687791,0.0002617889,0.00016600729,0.0004484712,0.00023317033,0.00055291486,0.00030875872,0.00016195576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090970076,0.000019497562,0.00043818986,0.000056715955,0.000019217297,0.00008738267,0.00015997021,0.9112691,0.02545536,0.0077007688,0.00049061317,0.054212105],"study_design_scores_gemma":[0.0000073995834,0.0000850006,0.0003591446,0.000004329756,0.0000041850294,0.000020411353,0.000020516856,0.9943362,0.0018722547,0.0024868145,0.00079904764,0.0000046989785],"about_ca_topic_score_codex":0.0048267525,"about_ca_topic_score_gemma":0.003220624,"teacher_disagreement_score":0.0048267525,"about_ca_system_score_codex":0.0002290603,"about_ca_system_score_gemma":0.00022281923,"threshold_uncertainty_score":0.0095973015},"labels":[],"label_agreement":null},{"id":"W1617540954","doi":"10.1007/978-3-540-68155-7_26","title":"Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Key (lock); Constraint (computer-aided design); Computer science; Constraint programming; Inference; Algorithm; Constraint satisfaction problem; Satisfiability; Backtracking; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.07045167649631688,"score_gpt":0.30406401827887825,"score_spread":0.23361234178256135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1617540954","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.0127701145,0.00050465734,0.9799815,0.00028316918,0.00012808637,0.00010123262,0.00009349495,0.0019791361,0.004158665],"genre_scores_gemma":[0.13542499,0.00031058886,0.855445,0.0003979738,0.00016540017,0.00034217187,0.0004669072,0.0006609007,0.0067859357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860126,0.00035697545,0.00007858048,0.00030666697,0.00043045927,0.00022610156],"domain_scores_gemma":[0.9892153,0.008901578,0.00030028517,0.00076459645,0.0006345157,0.00018371212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030065218,0.0018254529,0.0027090078,0.0021103062,0.0013715246,0.0021523251,0.0026762825,0.0027791471,0.012398267],"category_scores_gemma":[0.013841448,0.0014164378,0.0019399797,0.0026356783,0.0013293143,0.0048743696,0.0018956646,0.00355282,0.002022749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005631709,0.00045586616,0.000938007,0.0005593785,0.00019112151,0.0002481513,0.00027826533,0.47570875,0.0062766033,0.050039455,0.023187602,0.4415536],"study_design_scores_gemma":[0.00007121594,0.000050598584,0.000090008216,0.000023483495,0.00003266077,0.000046298774,0.000023595425,0.975935,0.0013738004,0.020965753,0.0013763037,0.000011296532],"about_ca_topic_score_codex":0.007994773,"about_ca_topic_score_gemma":0.011965172,"teacher_disagreement_score":0.012398267,"about_ca_system_score_codex":0.0015346294,"about_ca_system_score_gemma":0.0017485198,"threshold_uncertainty_score":0.04147637},"labels":[],"label_agreement":null},{"id":"W161788762","doi":"10.1007/978-3-642-33122-0_2","title":"Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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 Waterloo","funders":"","keywords":"Computer science; Phylogenetic tree; Locality-sensitive hashing; Locality; Tree (set theory); Hash function; Theoretical computer science; Hash table; Computer security; Mathematics; Combinatorics; Biology","score_opus":0.019761007052169093,"score_gpt":0.2380091641161625,"score_spread":0.2182481570639934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161788762","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.016718635,0.0005843705,0.9749176,0.00015827717,0.00009756009,0.000098241944,0.00046681325,0.0059090722,0.0010493167],"genre_scores_gemma":[0.1128252,0.00022507239,0.88228947,0.000090218775,0.00004855746,0.00013096917,0.002082741,0.00053945894,0.0017683109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844056,0.00040694233,0.00012334478,0.00035042086,0.0005026764,0.00017619495],"domain_scores_gemma":[0.9959008,0.001413083,0.00024742418,0.001650127,0.00062046136,0.00016816781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016015139,0.0008563824,0.0023119398,0.002071842,0.0013182987,0.0018329605,0.0034752735,0.0016185613,0.0076115835],"category_scores_gemma":[0.006776805,0.0012702491,0.0016244093,0.003500849,0.00077642134,0.003918384,0.0037649611,0.0022663118,0.004650439],"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.00061595265,0.00021869462,0.0020034956,0.00045042703,0.00020608626,0.00018986099,0.00038784568,0.05015215,0.027483815,0.020459924,0.018600794,0.87923104],"study_design_scores_gemma":[0.00016345369,0.00029255496,0.0012134402,0.00006491429,0.00008493933,0.0005563744,0.0002426356,0.89228666,0.020906659,0.07566304,0.00842867,0.000096612675],"about_ca_topic_score_codex":0.0019983307,"about_ca_topic_score_gemma":0.0037610105,"teacher_disagreement_score":0.0076115835,"about_ca_system_score_codex":0.0007902518,"about_ca_system_score_gemma":0.0014325932,"threshold_uncertainty_score":0.025463223},"labels":[],"label_agreement":null},{"id":"W1618113455","doi":"10.1007/978-3-540-88871-0_62","title":"The Grid as a Single Entity: Towards a Behavior Model of the Whole Grid","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"National Research Council Canada","funders":"","keywords":"Computer science; Grid; Grid computing; Grid system; Distributed computing","score_opus":0.02734387273751608,"score_gpt":0.24013003922667908,"score_spread":0.212786166489163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1618113455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01125154,0.00032932486,0.9731698,0.0013478337,0.000080165955,0.00006684913,0.00013807804,0.00072762265,0.012888851],"genre_scores_gemma":[0.43583092,0.001527424,0.54846257,0.0006773699,0.00020920757,0.00036988943,0.0006297477,0.0008291047,0.0114637865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.00031898482,0.000058536847,0.0001871133,0.0001962676,0.00008049984],"domain_scores_gemma":[0.99907136,0.00018331692,0.00007356158,0.00034852992,0.0001867504,0.00013643733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010617954,0.00055988383,0.0008602558,0.00062684744,0.0011350862,0.00488878,0.0030651898,0.0018800219,0.0021098764],"category_scores_gemma":[0.0021530678,0.00074376806,0.001114812,0.0012376697,0.0027375408,0.008342777,0.0026018484,0.003144668,0.0012487164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049810824,0.000046531633,0.0013151093,0.0001129454,0.000038589103,0.00018343587,0.0012538782,0.116377,0.00217929,0.85777795,0.0039795646,0.016685843],"study_design_scores_gemma":[0.000018312732,0.000022171535,0.00026495938,0.00005175617,0.000045979144,0.000103459,0.00033479807,0.5823818,0.0009285922,0.3899479,0.025880137,0.000020108997],"about_ca_topic_score_codex":0.006294374,"about_ca_topic_score_gemma":0.0035050954,"teacher_disagreement_score":0.006294374,"about_ca_system_score_codex":0.0011364775,"about_ca_system_score_gemma":0.002047862,"threshold_uncertainty_score":0.012515485},"labels":[],"label_agreement":null},{"id":"W161845448","doi":"10.1007/978-3-642-31410-0_6","title":"Bounds and Constructions for 1-Round (0,δ)-Secure Message Transmission against Generalized Adversary","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Secret sharing; Communication complexity; Theoretical computer science; Communication source; Adversary; Upper and lower bounds; Adversary model; Disjoint sets; Security parameter; Computer network; Cryptography; Discrete mathematics; Mathematics; Algorithm; Computer security","score_opus":0.015057917327216291,"score_gpt":0.243302894587604,"score_spread":0.22824497726038773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161845448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0545778,0.0068601198,0.8067283,0.0064830347,0.00088137947,0.0006897867,0.0013115855,0.004143746,0.1183242],"genre_scores_gemma":[0.72321033,0.0067169573,0.21674344,0.002220994,0.001497055,0.0022976396,0.0018218794,0.0016427771,0.043848787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888237,0.0023616552,0.00059561676,0.0018950446,0.0036660274,0.0026579758],"domain_scores_gemma":[0.9752459,0.01713671,0.0010947977,0.0046331286,0.0009671374,0.0009223368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006960677,0.0040624654,0.0036532034,0.0042690593,0.0043185656,0.009804784,0.0073039047,0.004939668,0.014799015],"category_scores_gemma":[0.021307528,0.0026772742,0.004689245,0.005060721,0.0065702503,0.024624676,0.014580146,0.015752664,0.005555773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008583881,0.00016980522,0.00042015212,0.000644021,0.00013864704,0.00025323572,0.0009208922,0.034895994,0.0070319143,0.9041627,0.011985989,0.038518324],"study_design_scores_gemma":[0.000076927296,0.00018234208,0.0003693822,0.0003344212,0.0002801128,0.00037019773,0.00013757656,0.10178628,0.0067741587,0.8789347,0.010584497,0.00016952216],"about_ca_topic_score_codex":0.001469145,"about_ca_topic_score_gemma":0.0013849384,"teacher_disagreement_score":0.014799015,"about_ca_system_score_codex":0.008477713,"about_ca_system_score_gemma":0.003925081,"threshold_uncertainty_score":0.061510444},"labels":[],"label_agreement":null},{"id":"W1618890699","doi":"10.1007/3-540-44830-6_12","title":"Generating Checking Sequences for a Distributed Test Architecture","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Controllability; Computer science; Sequence (biology); Communication source; Test (biology); Current (fluid); Sequence diagram; Algorithm; Programming language; Mathematics; Software; Unified Modeling Language; Telecommunications; Engineering","score_opus":0.02648434062110274,"score_gpt":0.26619954363372705,"score_spread":0.2397152030126243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1618890699","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.08872952,0.000047362515,0.8956545,0.00022126218,0.00004401203,0.00031124626,0.00032793495,0.010602732,0.0040614037],"genre_scores_gemma":[0.48724425,0.00004440126,0.5067226,0.00010020837,0.000021752978,0.00026766432,0.00083153066,0.0011681664,0.0035993056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848986,0.00047083947,0.000100957084,0.0003046972,0.00045440852,0.00017919073],"domain_scores_gemma":[0.9903009,0.00708763,0.0005052597,0.0010526753,0.00087608397,0.00017748366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014913568,0.0012092913,0.00062277453,0.0017101769,0.00071699184,0.0009972636,0.0014700853,0.0015721485,0.009536712],"category_scores_gemma":[0.008514616,0.0007475801,0.001077982,0.00091803307,0.0012753141,0.0014811031,0.001546865,0.0011160993,0.0014558564],"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.0017165687,0.00067516696,0.009924615,0.00072050816,0.0001387564,0.0018562233,0.000994178,0.27636746,0.07463421,0.08895928,0.0118021965,0.53221095],"study_design_scores_gemma":[0.00034729295,0.00048237504,0.0011307471,0.00009903268,0.00013847995,0.0004099963,0.00014012982,0.8376054,0.05813731,0.09614379,0.0053093606,0.0000561632],"about_ca_topic_score_codex":0.0024238105,"about_ca_topic_score_gemma":0.0044648326,"teacher_disagreement_score":0.009536712,"about_ca_system_score_codex":0.00093350007,"about_ca_system_score_gemma":0.0016774158,"threshold_uncertainty_score":0.031903505},"labels":[],"label_agreement":null},{"id":"W1619002","doi":"10.1007/978-3-642-38457-8_31","title":"Improved Arabic-French Machine Translation through Preprocessing Schemes and Language Analysis","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Fowler Kennedy Sport Medicine Clinic","funders":"","keywords":"Machine translation; Computer science; Preprocessor; Arabic; Natural language processing; BLEU; Artificial intelligence; Machine translation software usability; Evaluation of machine translation; Translation (biology); Machine translation system; Example-based machine translation; Speech recognition; Linguistics","score_opus":0.012250881863594531,"score_gpt":0.26619015813311836,"score_spread":0.25393927626952384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619002","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.052574284,0.0023611425,0.86472845,0.001265846,0.0020179981,0.0003322785,0.0047510806,0.04831756,0.023651283],"genre_scores_gemma":[0.14290549,0.0011141128,0.81663567,0.00048352615,0.000527871,0.0002411815,0.012296633,0.005260862,0.02053461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889463,0.00038044676,0.00012896338,0.00025289785,0.00022284235,0.00012028851],"domain_scores_gemma":[0.9977168,0.00053724746,0.00007966317,0.00039676984,0.0012209646,0.000048492286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280299,0.0024337627,0.0012285543,0.0021812776,0.001433552,0.0025084587,0.0008559537,0.00091204693,0.017243577],"category_scores_gemma":[0.0033698732,0.0004766401,0.0012832468,0.0021443784,0.00039121407,0.0014710305,0.0013630651,0.0013609632,0.018597987],"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.00076664274,0.00021066677,0.00093118136,0.0008319098,0.00014690413,0.0011603963,0.00056250475,0.007693347,0.096899144,0.011756736,0.05482723,0.82421327],"study_design_scores_gemma":[0.0003270225,0.00068927224,0.0044041607,0.00030414888,0.0007664386,0.0030134069,0.0011276839,0.27745768,0.39340153,0.02357567,0.2946347,0.0002981879],"about_ca_topic_score_codex":0.005826787,"about_ca_topic_score_gemma":0.008340821,"teacher_disagreement_score":0.017243577,"about_ca_system_score_codex":0.00065602263,"about_ca_system_score_gemma":0.0016108934,"threshold_uncertainty_score":0.057685494},"labels":[],"label_agreement":null},{"id":"W1619743887","doi":"10.1007/978-3-540-39432-7_92","title":"Coevolving Communication and Cooperation for Lattice Formation Tasks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cellular automaton; Automaton; Distributed computing; Theoretical computer science; Entropy (arrow of time); Lattice (music); Artificial intelligence","score_opus":0.019347911653475276,"score_gpt":0.25159275266616454,"score_spread":0.23224484101268927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619743887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17205052,0.00032587931,0.80485266,0.000509797,0.000117460804,0.00011658051,0.000070622715,0.00035735537,0.021599188],"genre_scores_gemma":[0.92664045,0.00022349384,0.06276465,0.00007424576,0.000052240714,0.00020540736,0.00009298918,0.00009893145,0.009847685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.0003166366,0.000055413984,0.00015408255,0.00019048496,0.00017489737],"domain_scores_gemma":[0.99080527,0.007125186,0.0003865469,0.00063871604,0.0004094286,0.00063485856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001554185,0.00071044796,0.0010840642,0.00060299627,0.0011230359,0.0016257826,0.0019191115,0.0016526568,0.005543978],"category_scores_gemma":[0.010742568,0.00049566134,0.0005423514,0.00081965985,0.0018076254,0.0026944114,0.0032668188,0.0019671032,0.0006977189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007167113,0.00031137318,0.0005656602,0.00021580009,0.000039520393,0.00023110233,0.0005620963,0.5069848,0.010106576,0.36279866,0.0037553061,0.11371235],"study_design_scores_gemma":[0.000041308045,0.00006312863,0.00006577128,0.000007657473,0.000008298374,0.000043867305,0.00005201126,0.8576182,0.0013493977,0.14021637,0.0005222885,0.000011642517],"about_ca_topic_score_codex":0.0013420153,"about_ca_topic_score_gemma":0.0016067221,"teacher_disagreement_score":0.005543978,"about_ca_system_score_codex":0.00071023335,"about_ca_system_score_gemma":0.000985348,"threshold_uncertainty_score":0.018546462},"labels":[],"label_agreement":null},{"id":"W1620710625","doi":"10.1007/978-3-642-39320-4_16","title":"Structural Similarity Search for Mathematics Retrieval","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics, Computing, and Information Processing","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":"Computer science; Correctness; Ranking (information retrieval); Information retrieval; Similarity (geometry); Relevance (law); Limit (mathematics); Learning to rank; Rank (graph theory); Search engine indexing; Precision and recall; Data mining; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Image (mathematics)","score_opus":0.03718940843607744,"score_gpt":0.27855917007929454,"score_spread":0.2413697616432171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620710625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05085164,0.009888971,0.9179618,0.00077309227,0.0003184192,0.00026484623,0.0010188558,0.0028152259,0.016107133],"genre_scores_gemma":[0.4239101,0.0034247425,0.5490524,0.0002445311,0.00055396184,0.00028637997,0.0042461236,0.0002519071,0.018029794],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921,0.00021059853,0.00007502458,0.0001240535,0.00031818115,0.00006210972],"domain_scores_gemma":[0.9991373,0.00033138963,0.00006396148,0.00023404951,0.00020333858,0.000029966937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000558923,0.0003904231,0.0011962411,0.0022103903,0.00060859165,0.0013417202,0.00135732,0.0008898011,0.009708738],"category_scores_gemma":[0.0038039773,0.00028972494,0.00069079915,0.0035162533,0.0005148536,0.0029771056,0.0013327549,0.0007419007,0.004052686],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037205569,0.00023504026,0.0008333417,0.0005705874,0.00008547811,0.00009045671,0.00013844014,0.018017719,0.018119616,0.096852235,0.027341103,0.8373439],"study_design_scores_gemma":[0.00011546252,0.00039038534,0.0017885683,0.00007248283,0.000103515915,0.00070841017,0.00019149332,0.72301346,0.016606946,0.22553642,0.03141166,0.00006120839],"about_ca_topic_score_codex":0.0018828901,"about_ca_topic_score_gemma":0.002809023,"teacher_disagreement_score":0.009708738,"about_ca_system_score_codex":0.0007205149,"about_ca_system_score_gemma":0.0011006591,"threshold_uncertainty_score":0.03247893},"labels":[],"label_agreement":null},{"id":"W1620773444","doi":"10.1007/3-540-45486-1","title":"Advances in Artificial Intelligence","year":2000,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.08126760821429246,"score_gpt":0.3945577618271052,"score_spread":0.31329015361281276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620773444","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012577305,0.23968764,0.044906266,0.010956184,0.011139629,0.00007600661,0.00022959801,0.00066035026,0.6910866],"genre_scores_gemma":[0.022399927,0.18427353,0.026296645,0.0041087335,0.00732432,0.0001656464,0.00051725743,0.00042331393,0.75449055],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992937,0.00011692299,0.000031931235,0.00008346902,0.00043247256,0.000041496325],"domain_scores_gemma":[0.9990609,0.00042423388,0.000041982654,0.00020921878,0.00017387194,0.00008966666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010217665,0.0013561661,0.0014004189,0.0020680989,0.00069571496,0.0037519706,0.0009768468,0.0013340426,0.039267525],"category_scores_gemma":[0.0021574292,0.0005347372,0.0004581965,0.0024193435,0.001891241,0.0048274463,0.0022450043,0.0032867985,0.024077393],"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.000023309625,0.000058606987,0.00015196437,0.0006493537,0.00003222436,0.000057589743,0.0002664701,0.00087314215,0.0006281481,0.24442793,0.33520648,0.41762483],"study_design_scores_gemma":[0.0000064997325,0.000017142489,0.00022330391,0.0003070242,0.000011383814,0.00011121725,0.000058059577,0.0008726417,0.00019915498,0.094739005,0.9034488,0.000005860578],"about_ca_topic_score_codex":0.00061908533,"about_ca_topic_score_gemma":0.0014167515,"teacher_disagreement_score":0.039267525,"about_ca_system_score_codex":0.0011060601,"about_ca_system_score_gemma":0.001142078,"threshold_uncertainty_score":0.13136292},"labels":[],"label_agreement":null},{"id":"W162246626","doi":"10.1007/978-3-642-41218-9_41","title":"Discernibility in the Analysis of Binary Card Sort Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Generality; Card sorting; sort; Sorting; Class (philosophy); Binary number; Artificial intelligence; Measure (data warehouse); Data mining; Information retrieval; Algorithm; Mathematics; Arithmetic; Task (project management)","score_opus":0.04831375958290712,"score_gpt":0.2787769367544335,"score_spread":0.23046317717152637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162246626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387855,0.004946789,0.64455384,0.0013985711,0.00015166361,0.00013283516,0.0012474242,0.0004091857,0.008374168],"genre_scores_gemma":[0.83234113,0.0015236558,0.16197424,0.00009236734,0.00022281312,0.00007403714,0.0010397448,0.00006156384,0.0026703582],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974462,0.00058986334,0.0002180651,0.00035519694,0.0012205957,0.00017020188],"domain_scores_gemma":[0.990022,0.00773007,0.00074628886,0.0007309357,0.00054835103,0.00022242163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038920525,0.0005306405,0.00095722044,0.0061148326,0.00085606787,0.0037694494,0.0010195203,0.00075762207,0.0017891694],"category_scores_gemma":[0.019351156,0.00039973197,0.0009756669,0.005158857,0.0023380793,0.0052073593,0.0012327577,0.0015828845,0.00034094026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017034434,0.00023459042,0.016453167,0.00091518543,0.00013843786,0.0007263205,0.0014959218,0.0927893,0.014972192,0.41981944,0.0039119083,0.4468401],"study_design_scores_gemma":[0.00003462025,0.00017535631,0.010772426,0.000203188,0.00007032461,0.00061259244,0.0006276937,0.52015543,0.010084941,0.451019,0.0061620236,0.000082440165],"about_ca_topic_score_codex":0.001992282,"about_ca_topic_score_gemma":0.0011846918,"teacher_disagreement_score":0.0061148326,"about_ca_system_score_codex":0.0014287002,"about_ca_system_score_gemma":0.00097350247,"threshold_uncertainty_score":0.020583391},"labels":[],"label_agreement":null},{"id":"W1622835277","doi":"10.1007/978-3-540-77120-3_37","title":"Fast Adaptive Diagnosis with a Minimum Number of Tests","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and Analog Circuit Testing","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":"Université du Québec en Outaouais","funders":"","keywords":"Disjoint sets; Upper and lower bounds; Computer science; Algorithm; Multiprocessing; Fault (geology); Exponential function; Parallel computing; Mathematics; Combinatorics","score_opus":0.02866527703052547,"score_gpt":0.2629196713843843,"score_spread":0.23425439435385886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1622835277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019648345,0.00036019614,0.97493535,0.0002069407,0.00008950305,0.00010938714,0.00009263456,0.0021617126,0.0023959193],"genre_scores_gemma":[0.38553703,0.00013421806,0.60872316,0.00027882133,0.00011139204,0.00021261441,0.00028987342,0.00018374622,0.004529078],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973755,0.0004969548,0.0001580935,0.000577846,0.0011491643,0.00024248207],"domain_scores_gemma":[0.9871296,0.009450541,0.00046763473,0.0019075248,0.0008658775,0.0001787418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773574,0.0015386502,0.0016153044,0.0015764559,0.0005703429,0.0012895935,0.0027041798,0.0018252383,0.007173288],"category_scores_gemma":[0.010258184,0.0008011139,0.001001034,0.00092849723,0.0009907179,0.0029622163,0.0019423391,0.0019935358,0.00142719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031405066,0.0002716322,0.0018129888,0.00046922377,0.00017236445,0.0003467911,0.00012785752,0.0806615,0.056920458,0.019358704,0.003943919,0.832774],"study_design_scores_gemma":[0.0003890061,0.00089085667,0.0023688895,0.00008627429,0.0002274161,0.001414932,0.000067961366,0.8875542,0.050137747,0.05209208,0.0047073197,0.00006322299],"about_ca_topic_score_codex":0.0012717714,"about_ca_topic_score_gemma":0.0028046535,"teacher_disagreement_score":0.007173288,"about_ca_system_score_codex":0.00080732245,"about_ca_system_score_gemma":0.0013944614,"threshold_uncertainty_score":0.023997068},"labels":[],"label_agreement":null},{"id":"W1623375142","doi":"10.1007/978-3-319-15168-7_43","title":"Generalized Friendship Paradox: An Analytical Approach","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Friendship; Popularity; Node (physics); Quality (philosophy); Degree (music); Social network (sociolinguistics); Distribution (mathematics); Degree distribution; Social psychology; Psychology; Computer science; Mathematics; Social media; Epistemology; Complex network; Combinatorics; Physics","score_opus":0.04538740260786307,"score_gpt":0.32308889194688756,"score_spread":0.2777014893390245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1623375142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1502753,0.004106675,0.700904,0.01361492,0.0005985343,0.00016701716,0.0003896297,0.00027301762,0.12967089],"genre_scores_gemma":[0.93512905,0.0023409142,0.040433858,0.0011130637,0.0009181265,0.00018446233,0.00011546177,0.000080318474,0.019684795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984804,0.00077279843,0.00003739298,0.00023764625,0.00031551276,0.00015621471],"domain_scores_gemma":[0.99452955,0.0035280169,0.0004142746,0.00062064646,0.0005322091,0.00037534934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025903275,0.0007851645,0.0015822938,0.0021318295,0.001479561,0.0034478055,0.0038343992,0.0026070247,0.0073325145],"category_scores_gemma":[0.013318805,0.0005810155,0.0011591343,0.0018959263,0.0034468735,0.008307784,0.002894742,0.0029821626,0.00054987706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009413689,0.000022888915,0.00012931714,0.00004252604,0.0000144924825,0.000102070626,0.00010139972,0.0042345994,0.00017582787,0.9914533,0.001665389,0.0020486864],"study_design_scores_gemma":[0.0000103267175,0.00000673428,0.000096858705,0.000015998407,0.000012180514,0.00012505552,0.00007996862,0.06654095,0.000054552744,0.9319486,0.0010989596,0.000009791968],"about_ca_topic_score_codex":0.0009961706,"about_ca_topic_score_gemma":0.0009810971,"teacher_disagreement_score":0.0073325145,"about_ca_system_score_codex":0.0015586822,"about_ca_system_score_gemma":0.0010477189,"threshold_uncertainty_score":0.024529696},"labels":[],"label_agreement":null},{"id":"W162339537","doi":"10.1007/978-3-642-22863-6_18","title":"Formalization of Entropy Measures in HOL","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; HOL; Theoretical computer science; Information theory; Entropy (arrow of time); Automated theorem proving; Cryptography; Algorithm; Mathematics; Programming language","score_opus":0.033813773591470406,"score_gpt":0.2476253939191147,"score_spread":0.21381162032764428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162339537","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.03412612,0.0012027612,0.8993258,0.0013019703,0.00033992945,0.000055728935,0.00029096275,0.0005270589,0.06282974],"genre_scores_gemma":[0.8511967,0.0010867153,0.12776433,0.0004881584,0.0008728397,0.00019332752,0.00041257756,0.0005056718,0.017479733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856645,0.0004357064,0.00012931887,0.00020552108,0.0004918984,0.00017116666],"domain_scores_gemma":[0.9973048,0.0015870527,0.00017567021,0.00045770998,0.0003330727,0.00014154105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018899802,0.0006678645,0.0006850701,0.0018915001,0.0010186723,0.003015127,0.0012047258,0.0007941849,0.00605036],"category_scores_gemma":[0.0036710505,0.00054044387,0.0013054768,0.0010707158,0.0042376253,0.0064384807,0.0023991445,0.0034589563,0.0006902615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069939847,0.00000674213,0.00004123609,0.000016312511,0.0000033465142,0.000015966818,0.00007947555,0.0009720193,0.00027117316,0.9958378,0.00027197297,0.0024769844],"study_design_scores_gemma":[0.0000055914593,0.000008289941,0.00007583313,0.0000136278195,0.0000046580785,0.000029103807,0.00002295653,0.0064878617,0.00047675148,0.99037313,0.002494583,0.000007639311],"about_ca_topic_score_codex":0.0004893151,"about_ca_topic_score_gemma":0.0006435515,"teacher_disagreement_score":0.00605036,"about_ca_system_score_codex":0.0017329637,"about_ca_system_score_gemma":0.00067420275,"threshold_uncertainty_score":0.020240426},"labels":[],"label_agreement":null},{"id":"W162367383","doi":"10.1007/978-3-642-23490-3_19","title":"Improved and Extended Sum-Capacity Computation for the Gaussian Vector Broadcast Channel via Dual Decomposition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MIMO Systems Optimization","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":"Toronto Metropolitan University","funders":"","keywords":"Gaussian; Computer science; Computation; Dual (grammatical number); Channel capacity; Convergence (economics); Channel (broadcasting); Algorithm; Duality (order theory); Mathematical optimization; Topology (electrical circuits); Mathematics; Telecommunications; Discrete mathematics; Combinatorics","score_opus":0.016309804438165196,"score_gpt":0.23397443331543588,"score_spread":0.21766462887727067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162367383","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.016370973,0.0003873743,0.9751058,0.00032520015,0.00012672688,0.000047209403,0.00031393513,0.0003686041,0.0069541833],"genre_scores_gemma":[0.4897385,0.0008016832,0.49058414,0.00035236057,0.000385999,0.00031846817,0.0013080089,0.00050209695,0.016008727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989367,0.00040568202,0.000039601557,0.000109166176,0.00033841317,0.00017039836],"domain_scores_gemma":[0.99769956,0.0013613558,0.000073424715,0.00027358936,0.0004846272,0.00010742591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020802666,0.0014081978,0.0016192388,0.0009372811,0.00051221444,0.0021840099,0.001883055,0.0009716844,0.0077044056],"category_scores_gemma":[0.0058993935,0.00063839054,0.0012519426,0.001606586,0.001235928,0.0024043599,0.0024565589,0.0023993703,0.0014248901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041351726,0.00015684153,0.00041327288,0.00028074463,0.00010516986,0.0001888022,0.00017656297,0.7142749,0.004045988,0.19071856,0.0100391265,0.079186425],"study_design_scores_gemma":[0.000009779705,0.000009816614,0.000041202333,0.00001255406,0.0000071153745,0.000021633627,0.000012175775,0.96539915,0.00066754984,0.033371266,0.00043764582,0.000010165259],"about_ca_topic_score_codex":0.0034951132,"about_ca_topic_score_gemma":0.0050692973,"teacher_disagreement_score":0.0077044056,"about_ca_system_score_codex":0.001196126,"about_ca_system_score_gemma":0.002093397,"threshold_uncertainty_score":0.025773823},"labels":[],"label_agreement":null},{"id":"W1626228617","doi":"10.1007/978-3-642-25878-7_20","title":"Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"École de Technologie Supérieure","funders":"","keywords":"Bipartite graph; Enhanced Data Rates for GSM Evolution; Computer science; Visualization; Graph drawing; Graph; Clutter; Theoretical computer science; Minification; Algorithm; Data mining; Artificial intelligence; World Wide Web; Radar","score_opus":0.03367026177666435,"score_gpt":0.2912855808593612,"score_spread":0.25761531908269686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626228617","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.022108437,0.0002149377,0.9269473,0.00030510372,0.00011037307,0.00018369121,0.0016652786,0.04364115,0.004823754],"genre_scores_gemma":[0.10875525,0.0002287905,0.880011,0.00010604737,0.00003234216,0.00019275943,0.0022486346,0.0048570046,0.0035682323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938977,0.0002057582,0.000042857468,0.00011233739,0.00017253237,0.000076731085],"domain_scores_gemma":[0.9967906,0.0017175999,0.00015867806,0.00046584642,0.000664867,0.00020245397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733921,0.0023346872,0.0010605479,0.0022377816,0.0009658837,0.0026544265,0.0019109752,0.0010260239,0.018726643],"category_scores_gemma":[0.0069283554,0.0010503788,0.0011890982,0.0019411239,0.0003734804,0.0022041858,0.0017737182,0.0014253482,0.0041504614],"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.0013651885,0.0004245343,0.0034430411,0.0009803216,0.00014793634,0.00037251643,0.00083893817,0.17356415,0.044623487,0.024400719,0.06110047,0.6887387],"study_design_scores_gemma":[0.00013400533,0.00015021203,0.0005654148,0.00009361988,0.000064330685,0.00018362372,0.00022697156,0.9281306,0.030406255,0.023067847,0.016908292,0.000068724345],"about_ca_topic_score_codex":0.005947922,"about_ca_topic_score_gemma":0.010098973,"teacher_disagreement_score":0.018726643,"about_ca_system_score_codex":0.0008841294,"about_ca_system_score_gemma":0.0011918293,"threshold_uncertainty_score":0.062646866},"labels":[],"label_agreement":null},{"id":"W162658627","doi":"10.1007/978-3-642-41527-2_4","title":"An $O(\\sqrt n)$ Space Bound for Obstruction-Free Leader Election","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Leader election; Upper and lower bounds; Combinatorics; Binary logarithm; Randomized algorithm; Mathematics; Asynchronous communication; Discrete mathematics; Time complexity; Algorithm; Computer science; Theoretical computer science; Computer network","score_opus":0.015740228830314625,"score_gpt":0.24694280037527394,"score_spread":0.23120257154495932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162658627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019202793,0.0025707965,0.86481464,0.0050224666,0.001615063,0.0002867946,0.00061387697,0.005686155,0.10018735],"genre_scores_gemma":[0.5353004,0.0018769271,0.37971225,0.0022994585,0.0014585016,0.0012794613,0.0014644488,0.0024035552,0.07420502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581534,0.00088101876,0.00016679628,0.00069119746,0.0014334016,0.0010121855],"domain_scores_gemma":[0.99188507,0.004425872,0.0002807427,0.0024997948,0.00046783246,0.00044064497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023733217,0.001953773,0.002233294,0.0015054854,0.0030175836,0.0039548627,0.00450543,0.0021781726,0.043182064],"category_scores_gemma":[0.012302959,0.0008691732,0.0017649225,0.0026363502,0.002788861,0.009845881,0.0077460385,0.00724281,0.010278279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016282011,0.00047466546,0.0006233314,0.0006959855,0.0001484325,0.0001540144,0.00051330135,0.08182092,0.010830867,0.51521313,0.10046834,0.28742886],"study_design_scores_gemma":[0.0003429272,0.00024628427,0.00046036538,0.000115996016,0.00013316992,0.00017988922,0.00014237782,0.38970548,0.0037372906,0.57670534,0.02814813,0.000082720835],"about_ca_topic_score_codex":0.0031936807,"about_ca_topic_score_gemma":0.007229388,"teacher_disagreement_score":0.043182064,"about_ca_system_score_codex":0.0029706173,"about_ca_system_score_gemma":0.0036367087,"threshold_uncertainty_score":0.14445841},"labels":[],"label_agreement":null},{"id":"W1626593357","doi":"10.1007/978-3-642-19811-3_6","title":"Semantic Quality Attributes for Big-Step Modelling Languages","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality (philosophy); Natural language processing; Artificial intelligence; Programming language; Information retrieval","score_opus":0.10638469406013269,"score_gpt":0.33125409261340855,"score_spread":0.22486939855327587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626593357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083302595,0.00028765236,0.9834419,0.00034837684,0.00009677739,0.00015622437,0.00035449158,0.001413473,0.0055707027],"genre_scores_gemma":[0.3372965,0.0006503941,0.6507885,0.00021873806,0.0001451019,0.00040148626,0.0015266321,0.0013163468,0.007656316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926622,0.0016556615,0.0010676692,0.00063833536,0.0035156915,0.00046049932],"domain_scores_gemma":[0.9901574,0.0042589447,0.00083798234,0.0024614148,0.00189875,0.00038553894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008851834,0.0011819353,0.0011376446,0.0026471512,0.0009504007,0.005526607,0.002410591,0.0017479248,0.0052620554],"category_scores_gemma":[0.016424472,0.0012273776,0.0022691307,0.0022699158,0.0030785862,0.010292336,0.0037897306,0.0038998094,0.00118914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100404584,0.000039436316,0.0004768908,0.00029195345,0.000040465267,0.00009386274,0.0005244531,0.012331004,0.0018902769,0.9458406,0.0017070936,0.036663663],"study_design_scores_gemma":[0.000040380335,0.00005752299,0.00025640722,0.00017377993,0.00008849247,0.00017536788,0.00021345008,0.079849176,0.0067882445,0.88501096,0.02729267,0.0000536453],"about_ca_topic_score_codex":0.0011561795,"about_ca_topic_score_gemma":0.0015146695,"teacher_disagreement_score":0.008851834,"about_ca_system_score_codex":0.0019417133,"about_ca_system_score_gemma":0.0013159956,"threshold_uncertainty_score":0.046813548},"labels":[],"label_agreement":null},{"id":"W162738593","doi":"10.1007/978-3-642-36092-3_6","title":"Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Computer science; Geology; Materials science; Composite material","score_opus":0.01559778449589973,"score_gpt":0.2643327690871796,"score_spread":0.24873498459127988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162738593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16018753,0.0014996796,0.8193712,0.0010110239,0.00021268967,0.00008137781,0.00028792175,0.00090130605,0.016447227],"genre_scores_gemma":[0.9058226,0.0012139094,0.07855701,0.00016737048,0.00012169914,0.00016984169,0.00026467908,0.00032764082,0.013355302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988121,0.00031644426,0.000055128075,0.0001898261,0.00034315616,0.00028343275],"domain_scores_gemma":[0.9903526,0.006296648,0.00085310754,0.0013487873,0.0006314902,0.0005174507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015975664,0.0013234201,0.0016074306,0.0011996609,0.0008080447,0.0016350945,0.003082272,0.001993349,0.00593643],"category_scores_gemma":[0.016833877,0.00082700275,0.0006817624,0.0012042652,0.0023158235,0.0037985062,0.0040342766,0.0024523223,0.00088843744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005095297,0.00005971923,0.00068635936,0.00024104475,0.000049701237,0.00026173997,0.00015443968,0.73077357,0.0051770103,0.2401182,0.0035896115,0.018379074],"study_design_scores_gemma":[0.000021558968,0.00004728974,0.00013744071,0.000025830945,0.000014983905,0.00010489997,0.000062910774,0.88628805,0.0008853054,0.11169884,0.0006950237,0.000017950138],"about_ca_topic_score_codex":0.0015570757,"about_ca_topic_score_gemma":0.0010828747,"teacher_disagreement_score":0.00593643,"about_ca_system_score_codex":0.0017191014,"about_ca_system_score_gemma":0.0007176207,"threshold_uncertainty_score":0.019859374},"labels":[],"label_agreement":null},{"id":"W1627395571","doi":"10.1007/978-3-642-37064-9_27","title":"On the Number of Unbordered Factors","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Morse code; Combinatorics; Mathematics; Discrete mathematics; Computer science; Biology; Genetics","score_opus":0.016682456486248436,"score_gpt":0.26190404839952536,"score_spread":0.24522159191327692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627395571","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.7043171,0.0043587056,0.20161536,0.004502093,0.0009767289,0.00008981861,0.0009431137,0.00065404247,0.082543045],"genre_scores_gemma":[0.96171397,0.0011539037,0.022597471,0.00033198323,0.0005879063,0.000101156314,0.0003879225,0.00025102796,0.012874633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673873,0.00070311705,0.0002533025,0.0010273604,0.00063057843,0.00064692256],"domain_scores_gemma":[0.9720737,0.020005567,0.0018153703,0.001902548,0.0016409875,0.0025618286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003613609,0.0011480914,0.0020624746,0.0033647078,0.0028814098,0.007312442,0.002909525,0.0023190514,0.013471913],"category_scores_gemma":[0.018372562,0.0010129561,0.0011672048,0.0020930574,0.0063305325,0.014478138,0.0036178161,0.0038567535,0.001493468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009338084,0.0000929496,0.003905095,0.00022678173,0.000053130563,0.00025575567,0.00068820675,0.003052957,0.004588102,0.9644662,0.0027131909,0.019023921],"study_design_scores_gemma":[0.000047485202,0.000056237182,0.0008459234,0.00006406399,0.000055163076,0.00038588286,0.00017686223,0.009073344,0.002230404,0.98368293,0.0033423402,0.00003936016],"about_ca_topic_score_codex":0.00053301896,"about_ca_topic_score_gemma":0.00057628343,"teacher_disagreement_score":0.013471913,"about_ca_system_score_codex":0.0017090654,"about_ca_system_score_gemma":0.0007389266,"threshold_uncertainty_score":0.045068026},"labels":[],"label_agreement":null},{"id":"W1628506169","doi":"10.1007/978-3-642-14455-4","title":"Developments in Language Theory","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Linguistic Variation and Morphology","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Programming language; Natural language processing; Artificial intelligence","score_opus":0.012539354066817903,"score_gpt":0.2983128898597484,"score_spread":0.2857735357929305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628506169","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045577693,0.07449675,0.11094052,0.018126437,0.0052349684,0.000024614992,0.00025397752,0.00027881845,0.786086],"genre_scores_gemma":[0.31308702,0.04887589,0.047733884,0.005365401,0.013129422,0.00019329273,0.00062050467,0.00075467105,0.57024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939716,0.00027291433,0.000024397514,0.0001181927,0.00014212425,0.000045122106],"domain_scores_gemma":[0.9994568,0.0003226873,0.000018160918,0.000086461376,0.00008418179,0.00003164374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000828582,0.00077003555,0.0008892035,0.0019722935,0.0018220813,0.003525033,0.0010213825,0.0012717127,0.017967118],"category_scores_gemma":[0.0015436683,0.00042747575,0.0006291575,0.0020058919,0.006553177,0.0063195694,0.0016816652,0.0034315197,0.0054486156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019358304,0.00000274194,0.000013721381,0.00002188916,0.000002323916,0.00000842103,0.00012522357,0.00009145298,0.000033343353,0.9823468,0.008974222,0.008377987],"study_design_scores_gemma":[0.0000018106743,0.000002592422,0.000033590168,0.000024076426,0.0000024686397,0.000029080044,0.000051522486,0.00027565547,0.000036935657,0.90304404,0.09649579,0.000002496251],"about_ca_topic_score_codex":0.0014218837,"about_ca_topic_score_gemma":0.0015263051,"teacher_disagreement_score":0.017967118,"about_ca_system_score_codex":0.0021164636,"about_ca_system_score_gemma":0.00080246426,"threshold_uncertainty_score":0.06010598},"labels":[],"label_agreement":null},{"id":"W1628543033","doi":"10.1007/978-3-642-36763-2_10","title":"Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Rectangle; Book embedding; Planar straight-line graph; Graph drawing; Combinatorics; Embedding; Planar; Outerplanar graph; Mathematics; Vertex (graph theory); Graph; Computer science; Geometry; Line graph; 1-planar graph; Pathwidth; Computer graphics (images); Artificial intelligence","score_opus":0.014440665635377773,"score_gpt":0.2529089660886954,"score_spread":0.23846830045331763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628543033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076679885,0.0009914279,0.80471236,0.0002281067,0.00021117234,0.0001821809,0.0006341055,0.001037452,0.11532333],"genre_scores_gemma":[0.50040686,0.0021856881,0.4350419,0.00012583609,0.00014466596,0.00026843263,0.0019619379,0.0011886337,0.058676038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922264,0.0001689756,0.000033992357,0.00015680476,0.00032255604,0.00009505023],"domain_scores_gemma":[0.99876285,0.0004845453,0.00013056467,0.00026195607,0.00023208841,0.00012806499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032645787,0.00084816123,0.0007486659,0.000944795,0.0007402498,0.0019824142,0.002198582,0.0009813379,0.0151516395],"category_scores_gemma":[0.0028423327,0.0009952228,0.00069700973,0.0014400685,0.0009282889,0.0017902853,0.0016457598,0.0022300028,0.003009356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016156511,0.00006348716,0.00038014055,0.00030685824,0.000026397856,0.00050147175,0.00062371325,0.05713548,0.00948783,0.79074085,0.009634857,0.13093732],"study_design_scores_gemma":[0.00007114111,0.00009256138,0.00073183636,0.00013194977,0.000046256926,0.00074581243,0.0003193081,0.23899697,0.009670081,0.67605275,0.07308484,0.000056510664],"about_ca_topic_score_codex":0.0015121232,"about_ca_topic_score_gemma":0.0029426129,"teacher_disagreement_score":0.0151516395,"about_ca_system_score_codex":0.000606817,"about_ca_system_score_gemma":0.00039276917,"threshold_uncertainty_score":0.050687313},"labels":[],"label_agreement":null},{"id":"W1628667175","doi":"10.1007/978-3-540-85990-1_99","title":"Fast Musculoskeletal Registration Based on Shape Matching","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Université de Genève; National Research Foundation","keywords":"Computer science; Matching (statistics); Context (archaeology); Image registration; Simple (philosophy); Stiffness; Algorithm; Artificial intelligence; Computer vision; Image (mathematics); Mathematics; Structural engineering","score_opus":0.016002577884301733,"score_gpt":0.28390124731188976,"score_spread":0.267898669427588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628667175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011110475,0.00046976225,0.98474205,0.000107668224,0.00008576858,0.000062564046,0.000074653464,0.001982791,0.0013642937],"genre_scores_gemma":[0.16034704,0.00071829907,0.8293455,0.00018426205,0.00012987682,0.00012797417,0.00041894577,0.0008807644,0.007847241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998923,0.00018334336,0.000053668846,0.00018002762,0.0005607028,0.00009909015],"domain_scores_gemma":[0.99893385,0.00038854431,0.00009589936,0.00026539338,0.00025894115,0.00005740695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092707435,0.00085857365,0.0015216541,0.0021480497,0.0005621958,0.0016463506,0.0014292792,0.0019534465,0.005533556],"category_scores_gemma":[0.0029233552,0.0010505789,0.0012109748,0.0021807514,0.0004350415,0.0013553106,0.0021781651,0.0012201094,0.0041573667],"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.00073768815,0.00012328936,0.0012452388,0.000229355,0.00013720433,0.0003010663,0.00012909317,0.024509367,0.15403195,0.004714925,0.0048923073,0.80894864],"study_design_scores_gemma":[0.00014294482,0.00039714848,0.0054595685,0.00005782724,0.00016002345,0.0032940863,0.00010752178,0.8580614,0.10599791,0.013359709,0.012834717,0.00012714793],"about_ca_topic_score_codex":0.0020291961,"about_ca_topic_score_gemma":0.0033039248,"teacher_disagreement_score":0.005533556,"about_ca_system_score_codex":0.00030466585,"about_ca_system_score_gemma":0.0011279199,"threshold_uncertainty_score":0.018511534},"labels":[],"label_agreement":null},{"id":"W1629406447","doi":"10.1007/978-3-319-02750-0_25","title":"Lexical-Syntactical Patterns for Subjectivity Analysis of Social Issues","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Subjectivity; Automatic summarization; Computer science; Natural language processing; Sentiment analysis; Artificial intelligence; Feeling; Object (grammar); Sentence; Task (project management); Noun; Information retrieval; Linguistics; Psychology; Social psychology; Epistemology","score_opus":0.0298964560723557,"score_gpt":0.3045912512701854,"score_spread":0.2746947951978297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629406447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.159073,0.0027067475,0.77422714,0.0016042715,0.00045915614,0.0010350125,0.028137561,0.009054731,0.023702381],"genre_scores_gemma":[0.43725464,0.001268535,0.5212939,0.00022042423,0.0003060826,0.0009357542,0.030243084,0.0011325057,0.007345159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985361,0.00035837365,0.00026944533,0.0003173174,0.0003973671,0.000121357065],"domain_scores_gemma":[0.99769896,0.0012014477,0.00024343065,0.00025530564,0.00048334626,0.00011744446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012025898,0.00082176673,0.0005759468,0.0054715835,0.00095305126,0.0024008467,0.0008183039,0.0007402047,0.008782512],"category_scores_gemma":[0.0045885355,0.0005207009,0.0013274205,0.0057740672,0.0005993279,0.0033064475,0.0014939578,0.0014870273,0.004909343],"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.0004956937,0.00041979086,0.017726937,0.0012154711,0.00024065215,0.0006892535,0.0020842873,0.0022508788,0.06703259,0.035106968,0.029412035,0.84332544],"study_design_scores_gemma":[0.00025168844,0.0005617142,0.08168079,0.001116002,0.00089242787,0.0034272792,0.0057338513,0.39835095,0.06600097,0.26602736,0.17565522,0.00030177276],"about_ca_topic_score_codex":0.001747097,"about_ca_topic_score_gemma":0.0030789785,"teacher_disagreement_score":0.008782512,"about_ca_system_score_codex":0.0006015913,"about_ca_system_score_gemma":0.0012303073,"threshold_uncertainty_score":0.029380381},"labels":[],"label_agreement":null},{"id":"W1629646379","doi":"10.1007/978-3-540-75492-3_10","title":"A BPEL Based Implementation of Online Auctions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Ottawa","funders":"","keywords":"Business Process Execution Language; Computer science; Orchestration; Common value auction; Bidding; Web service; Business process; Software engineering; Service (business); World Wide Web; Database; Service-oriented architecture; Business","score_opus":0.0981910282415169,"score_gpt":0.4192043853629856,"score_spread":0.3210133571214687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629646379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014508065,0.00009969046,0.964783,0.00021366464,0.00018684493,0.00012850166,0.00010057559,0.011568735,0.008410926],"genre_scores_gemma":[0.24108267,0.00015605646,0.7401666,0.00028598128,0.000072906376,0.000244462,0.00027614168,0.0007781351,0.016937058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983006,0.0003843916,0.00013177352,0.00020744234,0.00076153944,0.0002142793],"domain_scores_gemma":[0.9984585,0.0006798224,0.000060697053,0.00035225865,0.0003410228,0.000107687825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020001184,0.00052369904,0.0008935716,0.0004625385,0.0006927206,0.0026861771,0.0027603407,0.0015164337,0.01160372],"category_scores_gemma":[0.0045924378,0.0006418848,0.0006347912,0.0007157537,0.00070278737,0.002015607,0.0014327624,0.0020171518,0.0029536223],"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.0026844202,0.001797876,0.0013994249,0.0005278018,0.00020846706,0.0007714087,0.00043682053,0.09253131,0.04690474,0.1816652,0.018724322,0.65234816],"study_design_scores_gemma":[0.0006042786,0.00030665752,0.00029438196,0.000060506656,0.000096325086,0.00028432603,0.00005682362,0.8529619,0.041138653,0.08044886,0.023686435,0.00006086583],"about_ca_topic_score_codex":0.0014941486,"about_ca_topic_score_gemma":0.0015295933,"teacher_disagreement_score":0.01160372,"about_ca_system_score_codex":0.0005149824,"about_ca_system_score_gemma":0.0010858683,"threshold_uncertainty_score":0.0388183},"labels":[],"label_agreement":null},{"id":"W1630019606","doi":"10.1007/978-3-540-75336-0_18","title":"Anonymity Protocols as Noisy Channels","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":40,"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":"Anonymity; Converse; Computer science; Probabilistic logic; Adversary; Protocol (science); Channel (broadcasting); Identity (music); Theoretical computer science; Relation (database); Computer security; Data mining; Computer network; Mathematics; Artificial intelligence","score_opus":0.028315581008608388,"score_gpt":0.2891851985733467,"score_spread":0.2608696175647383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630019606","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.045735236,0.003681583,0.81866586,0.0055802283,0.00070798787,0.0001537351,0.00030033378,0.0007608063,0.12441426],"genre_scores_gemma":[0.8628449,0.002981306,0.07204582,0.0007539809,0.0007617058,0.00034303416,0.00017516677,0.00027331832,0.059820816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945328,0.002332269,0.00023686026,0.00054142677,0.0018674689,0.0004891145],"domain_scores_gemma":[0.99059993,0.005832181,0.00062841363,0.0020323393,0.00059259054,0.00031449806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030836128,0.00088567234,0.0011441621,0.0016143903,0.002130999,0.0074738003,0.0016672362,0.0032447744,0.005888757],"category_scores_gemma":[0.010505045,0.0012392907,0.0008898786,0.0021324302,0.006601097,0.011561865,0.004688513,0.0057988698,0.0013982821],"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.0000247387,0.000007169636,0.000024992934,0.000016710828,0.0000039318074,0.00002359127,0.00010474531,0.0035346944,0.00023183753,0.99224335,0.0007464794,0.0030377426],"study_design_scores_gemma":[0.000009227359,0.000008008647,0.000016614935,0.000011579565,0.000006739225,0.000045691355,0.000026010053,0.015978038,0.00040743628,0.97900474,0.0044747395,0.000011086335],"about_ca_topic_score_codex":0.00040058358,"about_ca_topic_score_gemma":0.00030998304,"teacher_disagreement_score":0.0074738003,"about_ca_system_score_codex":0.0020266802,"about_ca_system_score_gemma":0.0009307217,"threshold_uncertainty_score":0.019699872},"labels":[],"label_agreement":null},{"id":"W1630403277","doi":"10.1007/978-3-642-34601-9_39","title":"Mitigating the Intractability of the User Authorization Query Problem in Role-Based Access Control (RBAC)","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social 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":"University of Waterloo","funders":"","keywords":"Computer science; Role-based access control; Access control; Authorization; Satisfiability; Boolean satisfiability problem; Set (abstract data type); Reduction (mathematics); Theoretical computer science; Point (geometry); Programming language; Computer security; Mathematics","score_opus":0.016688418969822243,"score_gpt":0.2779746344618565,"score_spread":0.26128621549203424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630403277","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.057992864,0.0009059726,0.93191564,0.0024528105,0.00018345698,0.00019675608,0.00015660378,0.0013751975,0.0048206258],"genre_scores_gemma":[0.74032634,0.0008605918,0.25221616,0.0005592141,0.00049783674,0.00025323825,0.00035841667,0.00042122274,0.0045070164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9778863,0.00897985,0.0011250823,0.0025480606,0.0068718325,0.0025888854],"domain_scores_gemma":[0.88990766,0.073408484,0.0059898,0.02363809,0.0060086893,0.0010473216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013762202,0.0011395101,0.0026589774,0.0012734855,0.0034681666,0.004500755,0.004830265,0.0028348216,0.004170674],"category_scores_gemma":[0.0580327,0.0015361207,0.001890718,0.0027462258,0.0049045,0.012935088,0.007745163,0.009599065,0.0009372865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020158929,0.00058460806,0.0052451906,0.0008387936,0.0004416322,0.0007291103,0.0026279818,0.29181126,0.021839283,0.38142878,0.022369053,0.27006844],"study_design_scores_gemma":[0.00007895126,0.00015332464,0.0004993608,0.000047529385,0.00009702655,0.0003606036,0.00023696438,0.7936436,0.006001131,0.19659911,0.0022318382,0.00005060036],"about_ca_topic_score_codex":0.0044653816,"about_ca_topic_score_gemma":0.0041104155,"teacher_disagreement_score":0.013762202,"about_ca_system_score_codex":0.0021018372,"about_ca_system_score_gemma":0.0059901313,"threshold_uncertainty_score":0.0727824},"labels":[],"label_agreement":null},{"id":"W1630576121","doi":"10.1007/978-3-642-23765-2_7","title":"Emotive Expression through the Movement of Interactive Robotic Vehicles","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Emotive; Computer science; Movement (music); Expression (computer science); Human–computer interaction; Artificial intelligence; Computer vision; Computer graphics (images); Programming language; Art; Aesthetics","score_opus":0.04713361212071951,"score_gpt":0.33193420774696736,"score_spread":0.2848005956262478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630576121","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.57648706,0.0022844109,0.32264483,0.0007555268,0.00020953488,0.00020927207,0.00014781729,0.0010062865,0.096255235],"genre_scores_gemma":[0.914644,0.0008752969,0.04954925,0.00016706195,0.000038649938,0.00015545089,0.00012102971,0.00015117378,0.034298148],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974746,0.00010715192,0.0000063139646,0.0000449743,0.00006299004,0.000031027874],"domain_scores_gemma":[0.99981195,0.000111550245,0.000018683653,0.000019596611,0.000021491942,0.000016822356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027859746,0.000361015,0.00013709033,0.00019261426,0.00033906833,0.0010029194,0.00059029396,0.00048505134,0.005883327],"category_scores_gemma":[0.0007223172,0.00017522085,0.0002529286,0.00013761225,0.00091576605,0.0008733415,0.0010888216,0.00029290668,0.00066775345],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005348858,0.0002629573,0.0036101437,0.0015872949,0.00010634872,0.0014250968,0.030547833,0.015439552,0.5487751,0.05438019,0.008687769,0.33464283],"study_design_scores_gemma":[0.00018760872,0.0025011145,0.041600715,0.0007292405,0.0002759748,0.004357109,0.023054056,0.06454938,0.17967106,0.036865003,0.6458949,0.00031394558],"about_ca_topic_score_codex":0.00028977878,"about_ca_topic_score_gemma":0.00046490322,"teacher_disagreement_score":0.005883327,"about_ca_system_score_codex":0.00020776341,"about_ca_system_score_gemma":0.00009263333,"threshold_uncertainty_score":0.019681692},"labels":[],"label_agreement":null},{"id":"W1630884914","doi":"10.1007/11566465_76","title":"A Hand-Held Probe for Vibro-Elastography","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Elastography; Vibration; Transducer; Ultrasound; Acoustics; Biomedical engineering; Materials science; Ultrasound elastography; Absorption (acoustics); Physics; Engineering","score_opus":0.00958326552478384,"score_gpt":0.25915583063371794,"score_spread":0.2495725651089341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630884914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044593703,0.0036285666,0.92908233,0.000977241,0.0010496365,0.0010221683,0.0009306296,0.0055451714,0.013170529],"genre_scores_gemma":[0.27803057,0.0017952106,0.6765396,0.0017344566,0.00040781606,0.0008702797,0.0006243535,0.00056769693,0.03943002],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990802,0.00013185744,0.00005006634,0.00027496525,0.00037937963,0.000083594954],"domain_scores_gemma":[0.9989724,0.0004356099,0.000053681226,0.00018454975,0.00021324355,0.00014040098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007764739,0.000810475,0.0012131799,0.00075567747,0.000565343,0.0006904102,0.0020630872,0.002296879,0.024494551],"category_scores_gemma":[0.001572862,0.00061871985,0.000517025,0.00049581827,0.00046789568,0.0010212784,0.00146092,0.0008605296,0.005126051],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069899304,0.0001306168,0.00078017317,0.00042117122,0.0000459856,0.00065185135,0.000120542776,0.0004753717,0.7687653,0.0012052072,0.0051883115,0.22151656],"study_design_scores_gemma":[0.00078441075,0.0061281067,0.01651569,0.000454115,0.0005648643,0.02984573,0.00027446894,0.036536057,0.72818655,0.0033843897,0.17681627,0.0005094283],"about_ca_topic_score_codex":0.0006859724,"about_ca_topic_score_gemma":0.0010078687,"teacher_disagreement_score":0.024494551,"about_ca_system_score_codex":0.0003032092,"about_ca_system_score_gemma":0.0007796606,"threshold_uncertainty_score":0.08194244},"labels":[],"label_agreement":null},{"id":"W1631144379","doi":"10.1007/11536406_12","title":"The Application of a Case-Based Reasoning System to Attention-Deficit Hyperactivity Disorder","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Queen's University","funders":"","keywords":"Attention deficit hyperactivity disorder; Eye movement; Saccadic masking; Computer science; Cognitive psychology; Artificial intelligence; Attention deficit disorder; Machine learning; Psychology; Psychiatry","score_opus":0.018228878254931268,"score_gpt":0.274265233146209,"score_spread":0.25603635489127774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1631144379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13408877,0.0022496267,0.81690717,0.005100158,0.000617329,0.001770195,0.0011056995,0.009368409,0.02879275],"genre_scores_gemma":[0.26080745,0.0013660849,0.7316016,0.00044893558,0.000118375916,0.00040885538,0.0006348494,0.00016564797,0.0044482932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990513,0.0003906079,0.00014815557,0.00015414749,0.0002232564,0.000032473527],"domain_scores_gemma":[0.99337053,0.0055291736,0.00013772062,0.0003296281,0.00047050373,0.00016244226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025610987,0.0006889012,0.0005150182,0.0020895833,0.00076262123,0.0019708541,0.0020009086,0.0012039348,0.008761822],"category_scores_gemma":[0.0108542675,0.00047831435,0.0007269429,0.0009508658,0.0005563038,0.0015609859,0.0013524462,0.0010104438,0.0012028986],"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.000710011,0.0013795093,0.0078094476,0.00039794407,0.00013758968,0.0031076844,0.001223066,0.016007716,0.0060241735,0.009459901,0.0135761965,0.94016665],"study_design_scores_gemma":[0.0015553754,0.0012519553,0.017675018,0.0009952115,0.001113039,0.017815653,0.0019177919,0.77559555,0.02155554,0.10645313,0.053746052,0.00032574066],"about_ca_topic_score_codex":0.0066702045,"about_ca_topic_score_gemma":0.0058355853,"teacher_disagreement_score":0.008761822,"about_ca_system_score_codex":0.0007460407,"about_ca_system_score_gemma":0.0012412741,"threshold_uncertainty_score":0.02931124},"labels":[],"label_agreement":null},{"id":"W1632631493","doi":"10.1007/11894063_35","title":"FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Field-programmable gate array; Multiplication (music); Point (geometry); Arithmetic; Floating point; Algorithm; Computer hardware; Mathematics; Combinatorics; Geometry","score_opus":0.018609947089646493,"score_gpt":0.2810992868724549,"score_spread":0.2624893397828084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1632631493","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.5859517,0.0035701036,0.29881793,0.00042522262,0.0004890696,0.00017767203,0.00040654314,0.01246041,0.097701356],"genre_scores_gemma":[0.92545813,0.00068931194,0.060778655,0.00007690351,0.000057542016,0.000042420364,0.00028185025,0.0001366867,0.012478382],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998361,0.000028645065,0.00001245816,0.00002333189,0.000054297543,0.000045073957],"domain_scores_gemma":[0.99988484,0.000032507724,0.000013456631,0.000028653896,0.000028978639,0.000011531096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013235903,0.00062503625,0.0003985169,0.00077143,0.000368194,0.00095562683,0.00061842956,0.00031553317,0.008333453],"category_scores_gemma":[0.00033035927,0.00020246624,0.00023115949,0.0006427556,0.00022863808,0.0007374922,0.00033551356,0.000328294,0.0018785774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021545421,0.00018947996,0.0028430412,0.00083387445,0.00019143854,0.0012153073,0.000579812,0.036438305,0.21267699,0.09493675,0.016671373,0.6312691],"study_design_scores_gemma":[0.001008386,0.0024435255,0.0058293575,0.0004971828,0.00035771992,0.0028853281,0.0004421879,0.2596202,0.5539501,0.044978555,0.12774326,0.00024418352],"about_ca_topic_score_codex":0.0010870746,"about_ca_topic_score_gemma":0.0018683528,"teacher_disagreement_score":0.008333453,"about_ca_system_score_codex":0.0005915758,"about_ca_system_score_gemma":0.0003951798,"threshold_uncertainty_score":0.027878165},"labels":[],"label_agreement":null},{"id":"W163302719","doi":"10.1007/978-3-642-22218-4_39","title":"Exploiting OWL Reasoning Services to Execute Ontologically-Modeled Clinical Practice Guidelines","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Web Ontology Language; Software engineering; Data science; Programming language; Semantic Web","score_opus":0.09448496561185087,"score_gpt":0.36289163639376265,"score_spread":0.26840667078191177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163302719","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.029610256,0.00025874397,0.910281,0.002213426,0.00029220272,0.0008603334,0.0038919402,0.04098003,0.011612009],"genre_scores_gemma":[0.20167044,0.00036870642,0.7823678,0.0008648768,0.00006361642,0.0002893225,0.009034593,0.0019775808,0.0033630386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635446,0.001162636,0.00051785825,0.00033757763,0.0013465928,0.00028092114],"domain_scores_gemma":[0.992008,0.0049647903,0.0006064381,0.0012181319,0.000910133,0.00029255467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059032203,0.001054997,0.00076347817,0.0018698998,0.00088193343,0.0045453347,0.0019393233,0.0014818665,0.0037960024],"category_scores_gemma":[0.018080886,0.00087127683,0.0021818224,0.001315171,0.0010021414,0.0029444303,0.0034328178,0.0017225796,0.0015024901],"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.0019152492,0.0019831413,0.019459922,0.0016954554,0.00114399,0.004872773,0.004303838,0.24038018,0.020657673,0.22452343,0.06720218,0.4118622],"study_design_scores_gemma":[0.00028108002,0.0000848188,0.0011876499,0.00025949776,0.00024406196,0.0004079048,0.0005730623,0.7956176,0.018842172,0.11913941,0.06326699,0.00009578023],"about_ca_topic_score_codex":0.030593084,"about_ca_topic_score_gemma":0.04395209,"teacher_disagreement_score":0.030593084,"about_ca_system_score_codex":0.0018962412,"about_ca_system_score_gemma":0.0045053614,"threshold_uncertainty_score":0.060830057},"labels":[],"label_agreement":null},{"id":"W1633328346","doi":"10.1007/978-3-642-21043-3_26","title":"Comparison of Semantic Similarity for Different Languages Using the Google n-gram Corpus and Second-Order Co-occurrence Measures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":50,"is_retracted":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":"Computer science; Natural language processing; Similarity (geometry); German; Semantic similarity; Artificial intelligence; Word (group theory); n-gram; Word order; Language model; Linguistics","score_opus":0.07990233339630563,"score_gpt":0.32741458524636763,"score_spread":0.24751225185006198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633328346","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.912475,0.0033053008,0.021828847,0.00033589322,0.00038090663,0.00023869988,0.041627087,0.0038724965,0.015935743],"genre_scores_gemma":[0.815459,0.0013332709,0.05328684,0.00007514988,0.00010912919,0.0003507056,0.12556483,0.000872025,0.0029489521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978199,0.00067339826,0.00030381806,0.00033904376,0.0007038592,0.00016005475],"domain_scores_gemma":[0.9939115,0.0035022984,0.00024203544,0.000492137,0.0015957454,0.00025628821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014060878,0.001016937,0.000928979,0.011105275,0.0014125804,0.0023443364,0.0006835499,0.0008859193,0.0033713374],"category_scores_gemma":[0.00996111,0.00024952926,0.0010954103,0.010622186,0.00063937664,0.0032782648,0.0015177758,0.00094159046,0.0023794125],"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.0077606137,0.0013637854,0.09230053,0.008341644,0.0016044788,0.0024780247,0.0068240273,0.014926912,0.08588388,0.016002258,0.09216452,0.6703493],"study_design_scores_gemma":[0.0005808832,0.0019420268,0.39580077,0.0011365766,0.0018032795,0.0068636057,0.018475277,0.30768263,0.09425928,0.025739688,0.14483136,0.00088460644],"about_ca_topic_score_codex":0.008607333,"about_ca_topic_score_gemma":0.015072303,"teacher_disagreement_score":0.011105275,"about_ca_system_score_codex":0.00075162714,"about_ca_system_score_gemma":0.0012664667,"threshold_uncertainty_score":0.01711446},"labels":[],"label_agreement":null},{"id":"W1634401809","doi":"10.1007/978-3-540-75759-7_92","title":"Customised Cytoarchitectonic Probability Maps Using Deformable Registration: Primary Auditory Cortex","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neuroscience and Music Perception","field":"Neuroscience","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":"Queen's University","funders":"","keywords":"Auditory cortex; Gyrus; Artificial intelligence; Cortex (anatomy); Computer science; Pattern recognition (psychology); Percept; Cytoarchitecture; Neuroscience; Computer vision; Psychology; Perception","score_opus":0.034408726992043635,"score_gpt":0.27999896708085537,"score_spread":0.24559024008881172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634401809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042165987,0.00024079692,0.9487493,0.00018370121,0.00008686182,0.00008492488,0.0004890514,0.0065004504,0.0014988425],"genre_scores_gemma":[0.44784755,0.00058368966,0.5407102,0.00018922225,0.00006556978,0.00022212484,0.0010051031,0.0040598246,0.0053167725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978,0.000030458688,0.000013517843,0.00007622713,0.00006815436,0.00003164712],"domain_scores_gemma":[0.99922836,0.00028141457,0.00007871551,0.00025573288,0.00011616148,0.000039627932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009203548,0.0006909585,0.0006927533,0.0010204847,0.000371449,0.0015395561,0.0013027807,0.0009521423,0.0055390955],"category_scores_gemma":[0.0035031422,0.0008583205,0.0010565948,0.0014643882,0.00046686034,0.0009998513,0.0012273121,0.0012493143,0.0019165785],"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.000615594,0.00017844308,0.0024731688,0.00035244547,0.0002432775,0.00032381812,0.000400707,0.16172822,0.3496621,0.0052935267,0.0076994286,0.47102937],"study_design_scores_gemma":[0.000095002724,0.00015163247,0.013078495,0.000045966262,0.00017663841,0.000981311,0.00010094429,0.72841686,0.22908123,0.018426958,0.009288837,0.00015622067],"about_ca_topic_score_codex":0.0051336605,"about_ca_topic_score_gemma":0.008632651,"teacher_disagreement_score":0.0055390955,"about_ca_system_score_codex":0.00063622306,"about_ca_system_score_gemma":0.0010678087,"threshold_uncertainty_score":0.01853007},"labels":[],"label_agreement":null},{"id":"W1634466368","doi":"10.1007/3-540-44503-x_4","title":"On Decidability and Complexity of Description Logics with Uniqueness Constraints","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Uniqueness; Equivalence (formal languages); Computer science; Successor cardinal; Monadic predicate calculus; Path (computing); Second-order logic; Time complexity; Theoretical computer science; Discrete mathematics; Mathematics; Description logic; Algorithm; Programming language; Higher-order logic","score_opus":0.057765469693846994,"score_gpt":0.25973996442878633,"score_spread":0.20197449473493934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634466368","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.21999544,0.009434642,0.67541945,0.027661823,0.000586124,0.00046635367,0.0032048945,0.0014948943,0.061736472],"genre_scores_gemma":[0.834919,0.004536255,0.1397733,0.0028396253,0.0021355879,0.0007903989,0.0038364187,0.00086066243,0.010308721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9778371,0.007796241,0.001709531,0.0040667546,0.0061010835,0.0024892702],"domain_scores_gemma":[0.7480214,0.23456158,0.004223077,0.008071704,0.0031221579,0.002000058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018017398,0.002508807,0.004281966,0.00530363,0.0055711954,0.014800105,0.01034772,0.005489035,0.0116717145],"category_scores_gemma":[0.08377477,0.004308436,0.010108015,0.007975328,0.014136855,0.0586901,0.011481,0.021010024,0.0009154253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043525067,0.0003075983,0.0022179026,0.0006848999,0.0002943985,0.00023899965,0.0012252965,0.035232082,0.0009135104,0.9274906,0.0059765754,0.024982857],"study_design_scores_gemma":[0.000039364822,0.0000121973635,0.00015978556,0.000032453085,0.000054809807,0.000053793483,0.00007833417,0.024214549,0.0003320921,0.9744144,0.0005877809,0.000020451904],"about_ca_topic_score_codex":0.0072064544,"about_ca_topic_score_gemma":0.006458457,"teacher_disagreement_score":0.018017398,"about_ca_system_score_codex":0.011066115,"about_ca_system_score_gemma":0.005309127,"threshold_uncertainty_score":0.09528625},"labels":[],"label_agreement":null},{"id":"W163465042","doi":"10.1007/978-3-642-40760-4_59","title":"A Cross-Sectional Piecewise Constant Model for Segmenting Highly Curved Fiber Tracts in Diffusion MR Images","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta; Western Canada Research Grid; Compute Canada","keywords":"Piecewise; Segmentation; Constant (computer programming); Diffusion; Computer science; Diffusion MRI; Cross section (physics); Fiber; Artificial intelligence; Market segmentation; Image segmentation; Mathematics; Mathematical analysis; Physics; Materials science; Magnetic resonance imaging; Medicine","score_opus":0.05039745930564653,"score_gpt":0.34868536098693936,"score_spread":0.2982879016812928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163465042","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.018038547,0.00035418136,0.9804817,0.00017988708,0.000026808706,0.000028957116,0.00018250637,0.00045993066,0.00024756684],"genre_scores_gemma":[0.5718224,0.001297179,0.41857457,0.00016972485,0.00009519613,0.00025498238,0.00092903373,0.0003960914,0.0064607575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996859,0.00009131725,0.00002139088,0.000114762406,0.000050828665,0.000035888224],"domain_scores_gemma":[0.99867404,0.00075195415,0.00016455616,0.0001231423,0.00021823986,0.000068187604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012855412,0.000834922,0.0010051783,0.0010208898,0.00047847096,0.0013474528,0.0026536363,0.0029614037,0.0016786971],"category_scores_gemma":[0.003774929,0.0013001387,0.0012264485,0.001548464,0.0007690701,0.0013232782,0.0008657257,0.0018911571,0.0006929897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009822664,0.000027914346,0.00061236473,0.00007107739,0.000038763294,0.00008262682,0.00006954712,0.9595473,0.0033528686,0.004136309,0.000756643,0.031206401],"study_design_scores_gemma":[0.0000017122857,0.000008625261,0.00006384624,0.000003142382,0.0000058498067,0.0000127238445,0.0000019362349,0.9991468,0.00017603647,0.00045807371,0.00011771814,0.000003570933],"about_ca_topic_score_codex":0.020390416,"about_ca_topic_score_gemma":0.015505934,"teacher_disagreement_score":0.020390416,"about_ca_system_score_codex":0.0010424232,"about_ca_system_score_gemma":0.0012778528,"threshold_uncertainty_score":0.040543497},"labels":[],"label_agreement":null},{"id":"W163519632","doi":"10.1007/978-3-642-40760-4_17","title":"Dynamic CT Reconstruction by Smoothed Rank Minimization","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Computer science; Minification; Rank (graph theory); Algorithm; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.008310834052792204,"score_gpt":0.27199201565249886,"score_spread":0.26368118159970666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163519632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029751454,0.00013512351,0.99527967,0.00017587481,0.000022110013,0.000016692617,0.00009181106,0.00045367124,0.0008499075],"genre_scores_gemma":[0.07351619,0.0004089814,0.9193956,0.00017397215,0.000098243094,0.00008815723,0.0005474274,0.0008398166,0.0049315076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994444,0.00015442714,0.00003564668,0.00007069866,0.0002520818,0.00004265206],"domain_scores_gemma":[0.9988662,0.0005119022,0.00014164737,0.00021224322,0.00018906094,0.00007888384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008925467,0.0011122725,0.0011919412,0.0012216921,0.00040099947,0.0021654756,0.0011171205,0.0019376996,0.0062774564],"category_scores_gemma":[0.0037124942,0.0012982442,0.0011433853,0.001358674,0.0007062831,0.0015258474,0.002147603,0.0021597145,0.003123282],"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.0007744579,0.00018689496,0.001240635,0.0006824442,0.00034155973,0.00060238247,0.00024781458,0.35749757,0.087035105,0.0661188,0.018941196,0.46633115],"study_design_scores_gemma":[0.000044329317,0.00006644111,0.0002402354,0.000026401345,0.00004275654,0.0006281272,0.00002583456,0.9625436,0.013919566,0.015639767,0.006783761,0.000039200637],"about_ca_topic_score_codex":0.0019001558,"about_ca_topic_score_gemma":0.00244471,"teacher_disagreement_score":0.0062774564,"about_ca_system_score_codex":0.0003723765,"about_ca_system_score_gemma":0.0011922414,"threshold_uncertainty_score":0.021000147},"labels":[],"label_agreement":null},{"id":"W163528057","doi":"10.1007/978-3-319-11743-0_11","title":"Acceptance Test Optimization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Redundancy (engineering); Integration testing; Test (biology); Test case; System under test; Acceptance testing; Test Management Approach; Reliability engineering; Test strategy; System testing; Programming language; Software; Software engineering; Machine learning; Software system; Engineering; Operating system; Software construction","score_opus":0.01633792998939871,"score_gpt":0.24762005690595135,"score_spread":0.23128212691655264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163528057","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.014131954,0.0011072344,0.89037335,0.00074812124,0.00033496314,0.0002799826,0.00034071473,0.0063157063,0.08636796],"genre_scores_gemma":[0.5143677,0.0009864905,0.37001663,0.000855931,0.00037242722,0.0006295258,0.0020379508,0.0046520787,0.10608128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537754,0.0014093864,0.00015240845,0.00066273584,0.0019252973,0.0004726579],"domain_scores_gemma":[0.9945528,0.002493163,0.00022225028,0.0013806395,0.0012225065,0.00012864846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016266899,0.0018440859,0.001490654,0.0015463311,0.00064753124,0.0020107955,0.0022848046,0.00116167,0.031288553],"category_scores_gemma":[0.0098680705,0.00065821176,0.0014291267,0.001296113,0.0009912981,0.0018268818,0.00181977,0.002979497,0.00992616],"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.00043596982,0.00033740344,0.001108944,0.00034159364,0.00009869178,0.00021274349,0.00012617889,0.044972543,0.012412675,0.12192366,0.0402204,0.7778092],"study_design_scores_gemma":[0.0001589013,0.00047795914,0.0020227567,0.00021622426,0.00021358048,0.00090543024,0.00014214142,0.5673885,0.03901792,0.29892874,0.09042339,0.00010452243],"about_ca_topic_score_codex":0.0013129539,"about_ca_topic_score_gemma":0.0015843222,"teacher_disagreement_score":0.031288553,"about_ca_system_score_codex":0.0009204245,"about_ca_system_score_gemma":0.0014275665,"threshold_uncertainty_score":0.1046707},"labels":[],"label_agreement":null},{"id":"W1635884043","doi":"10.1007/978-3-642-33651-5_19","title":"RMR-Efficient Randomized Abortable Mutual Exclusion","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mutual exclusion; Asynchronous communication; Abort; Adversary model; Critical section; Swap (finance); Logarithm; Scheduling (production processes); Deterministic algorithm; Randomized algorithm; Theoretical computer science; Algorithm; Adversary; Operating system; Mathematics; Computer network; Computer security","score_opus":0.011702931723900205,"score_gpt":0.23608553280424469,"score_spread":0.22438260108034447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1635884043","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.030773124,0.00059631787,0.92911464,0.0006632882,0.00043038788,0.0003416064,0.00058753876,0.012894681,0.024598395],"genre_scores_gemma":[0.5399341,0.000310611,0.42332295,0.0005378295,0.00024057111,0.0006017936,0.0015129205,0.001499891,0.03203934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960085,0.0011656645,0.00016394674,0.00050228304,0.0013487325,0.0008107965],"domain_scores_gemma":[0.99533856,0.0018601026,0.0002733496,0.0018184427,0.0004983631,0.00021120966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019712725,0.0010252114,0.002104926,0.0007795577,0.0015643174,0.0020530783,0.0041675144,0.0012440095,0.012939594],"category_scores_gemma":[0.0059647034,0.0006930471,0.0008727749,0.0012166701,0.0010991085,0.002582224,0.0043223626,0.0023326022,0.003762417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003487617,0.0007684063,0.00066403946,0.0006196516,0.00011946643,0.00031466628,0.00036166646,0.1856869,0.03610229,0.23941986,0.05421736,0.47823805],"study_design_scores_gemma":[0.00050812843,0.00035165422,0.00031729857,0.00004324957,0.000058439535,0.00019735629,0.00007074597,0.85501474,0.015838541,0.11263788,0.014876167,0.00008574692],"about_ca_topic_score_codex":0.0017775206,"about_ca_topic_score_gemma":0.0038428886,"teacher_disagreement_score":0.012939594,"about_ca_system_score_codex":0.0014076874,"about_ca_system_score_gemma":0.0033569024,"threshold_uncertainty_score":0.043287277},"labels":[],"label_agreement":null},{"id":"W1636018584","doi":"10.1007/3-540-45578-7_78","title":"Building Negative Reduced Cost Paths Using Constraint Programming","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université de Montréal","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Constraint programming; Directed acyclic graph; Scheduling (production processes); Shortest path problem; Simple (philosophy); Set (abstract data type); Graph; Theoretical computer science; Algorithm; Mathematics; Stochastic programming; Programming language","score_opus":0.027500727639623777,"score_gpt":0.2770246021649901,"score_spread":0.2495238745253663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636018584","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.011179832,0.00011058548,0.97468776,0.00018308782,0.0000747413,0.000108084365,0.00027195222,0.0010520695,0.012331921],"genre_scores_gemma":[0.08542106,0.000254943,0.9000501,0.00011832332,0.000021167076,0.0002592486,0.00089781627,0.0008395951,0.012137789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00021467842,0.00003527205,0.00022522728,0.00033408302,0.00012218553],"domain_scores_gemma":[0.9982174,0.0009703296,0.00011572225,0.0003305233,0.00028935075,0.000076605626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985844,0.0017106174,0.0012900009,0.0011998655,0.0011567974,0.001325153,0.0023568065,0.0011520957,0.016664548],"category_scores_gemma":[0.0047832467,0.001259558,0.0016548494,0.0014812858,0.0014916849,0.003356443,0.0030026766,0.003136438,0.0026072618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018884387,0.00022829624,0.0004139361,0.0006343822,0.00007673049,0.00024434205,0.00023771336,0.41697288,0.006965329,0.30271277,0.016271817,0.25505295],"study_design_scores_gemma":[0.00005267859,0.00009485656,0.00011590822,0.00009796091,0.000045391524,0.00011525973,0.0000934165,0.5675419,0.004894579,0.40649784,0.020418065,0.000032199474],"about_ca_topic_score_codex":0.0034694194,"about_ca_topic_score_gemma":0.006756471,"teacher_disagreement_score":0.016664548,"about_ca_system_score_codex":0.0009864424,"about_ca_system_score_gemma":0.0017525202,"threshold_uncertainty_score":0.055748403},"labels":[],"label_agreement":null},{"id":"W1636181092","doi":"10.1007/978-3-642-25591-5_4","title":"Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Graph; Function (biology); Bounded function; Linear programming relaxation; Tree (set theory); k-minimum spanning tree; Integer (computer science); Discrete mathematics; Algorithm; K-ary tree; Computer science; Binary tree; Tree structure; Mathematical analysis; Linear programming","score_opus":0.021496381944811557,"score_gpt":0.2290866575978369,"score_spread":0.20759027565302535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636181092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082387805,0.005698785,0.8418956,0.0048793596,0.001208953,0.000695507,0.0046797846,0.009076213,0.04947808],"genre_scores_gemma":[0.25201398,0.002052975,0.7084011,0.0013640489,0.0007457461,0.0006424287,0.007000537,0.0035150358,0.024264174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960018,0.00097011315,0.00019061059,0.0007236215,0.0011940325,0.0009198885],"domain_scores_gemma":[0.98460305,0.0083687445,0.00061226607,0.004445281,0.0010925414,0.0008781835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042780116,0.0041538486,0.005075942,0.0030011968,0.002214584,0.006011092,0.009541322,0.004569585,0.04069355],"category_scores_gemma":[0.028163727,0.0020549616,0.0043662484,0.0071434854,0.002504278,0.015647115,0.0056326897,0.0076392917,0.008948022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026566666,0.0011860494,0.0025731176,0.0014397285,0.0003158402,0.00032025395,0.0007524637,0.3959551,0.004221923,0.19344589,0.113565214,0.2835677],"study_design_scores_gemma":[0.0002377027,0.00011422548,0.00043590984,0.00014211267,0.0001658978,0.00019549832,0.00025084033,0.7790907,0.0013009248,0.21047084,0.007549919,0.000045369983],"about_ca_topic_score_codex":0.011195701,"about_ca_topic_score_gemma":0.031894945,"teacher_disagreement_score":0.04069355,"about_ca_system_score_codex":0.0081831245,"about_ca_system_score_gemma":0.006620229,"threshold_uncertainty_score":0.13613349},"labels":[],"label_agreement":null},{"id":"W1636810006","doi":"10.1007/978-3-662-44196-1_21","title":"Performance Evaluation of a Surgical Telerobotic System Using Kinematic Indices of the Master Hand-Controller","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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 Calgary","funders":"","keywords":"Teleoperation; Kinematics; Computer science; Controller (irrigation); Master/slave; Haptic technology; Simulation; Robot; Control theory (sociology); Artificial intelligence; Control (management); Physics","score_opus":0.029100389862299264,"score_gpt":0.23864169127246154,"score_spread":0.20954130141016228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636810006","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.9271085,0.0006005562,0.06693584,0.00006888422,0.000044377935,0.00007543421,0.00017022982,0.0007732257,0.0042228047],"genre_scores_gemma":[0.9968556,0.000045880563,0.002285148,0.0000053053354,0.000003877304,0.000017343707,0.000072758514,0.0000118109365,0.00070215005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967,0.00007710865,0.000028528488,0.000053603362,0.00011435231,0.000056375437],"domain_scores_gemma":[0.9988319,0.00053752336,0.00010616115,0.00008517671,0.00038477982,0.000054321958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073732034,0.0005673168,0.00053821463,0.0005788987,0.0003286012,0.00048264727,0.00045004094,0.00057347014,0.0022348303],"category_scores_gemma":[0.0015764026,0.00016068244,0.0002600379,0.00029888513,0.00024707074,0.00028793723,0.00037997583,0.00021343489,0.0004504839],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008605048,0.00052378845,0.01367206,0.0010558781,0.00029824037,0.0003144219,0.0004495947,0.40223944,0.2951243,0.00075669057,0.001248627,0.2757119],"study_design_scores_gemma":[0.000105654224,0.0062255943,0.042863768,0.00004524301,0.00018927004,0.00023684309,0.00018865497,0.83502585,0.1142596,0.00017106577,0.00062061567,0.000067802604],"about_ca_topic_score_codex":0.0038359931,"about_ca_topic_score_gemma":0.0022442876,"teacher_disagreement_score":0.0038359931,"about_ca_system_score_codex":0.00033844373,"about_ca_system_score_gemma":0.00029023472,"threshold_uncertainty_score":0.007627368},"labels":[],"label_agreement":null},{"id":"W1637407644","doi":"10.1007/978-3-540-78929-1_51","title":"Level Set Methods for Computing Reachable Sets of Hybrid Systems with Differential Algebraic Equation Dynamics","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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 British Columbia","funders":"","keywords":"Reachability; Computer science; Hybrid system; Differential equation; Nonlinear system; Set (abstract data type); Algebraic number; Differential algebraic equation; Dynamical systems theory; Algebraic equation; Applied mathematics; Reset (finance); Differential (mechanical device); State (computer science); Algorithm; Mathematics; Ordinary differential equation; Mathematical analysis","score_opus":0.1324122096792108,"score_gpt":0.35314320903776925,"score_spread":0.22073099935855844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1637407644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068010725,0.00013853915,0.9912826,0.000033425116,0.000016325592,0.00002940109,0.000073616546,0.00033566423,0.0012893508],"genre_scores_gemma":[0.23453781,0.00032131883,0.76153725,0.00004950938,0.000034570206,0.00033693583,0.00043483806,0.0003554966,0.0023922345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994541,0.00015709932,0.0000403409,0.00006618403,0.00023792997,0.0000442724],"domain_scores_gemma":[0.9980013,0.0015481707,0.00007879974,0.00013024906,0.00016711222,0.00007440949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013653374,0.0009424633,0.0017629082,0.0018041802,0.0008921756,0.0019702653,0.0022137994,0.0011884074,0.004473189],"category_scores_gemma":[0.0044176965,0.0009772945,0.0017585058,0.0013058698,0.0012318833,0.002007734,0.0022387719,0.0024086654,0.0007693128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007418259,0.000046527723,0.0004747625,0.00017424708,0.00007433194,0.000047439742,0.000119035794,0.8513737,0.001670321,0.08351152,0.0009968013,0.06143721],"study_design_scores_gemma":[0.0000045972456,0.000006362734,0.000032933007,0.0000074258896,0.0000051560464,0.0000045953607,0.000006453454,0.9712219,0.00030982206,0.028111583,0.0002848583,0.000004319841],"about_ca_topic_score_codex":0.0032607133,"about_ca_topic_score_gemma":0.0038205779,"teacher_disagreement_score":0.004473189,"about_ca_system_score_codex":0.0011231407,"about_ca_system_score_gemma":0.00093099434,"threshold_uncertainty_score":0.0149642825},"labels":[],"label_agreement":null},{"id":"W1637620047","doi":"10.1007/978-3-540-95888-8_2","title":"Autonomic Computing Now You See It, Now You Don’t","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign","keywords":"Autonomic computing; Computer science; Adaptation (eye); Architecture; Perspective (graphical); End-user computing; Interactive computing; Software engineering; Utility computing; Distributed computing; Cloud computing; Human–computer interaction; Artificial intelligence; Cloud computing security","score_opus":0.028776708763651616,"score_gpt":0.2769299558859484,"score_spread":0.24815324712229675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1637620047","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007477411,0.038182765,0.13784601,0.04823001,0.02805265,0.000074875396,0.0001563882,0.0033941327,0.7365857],"genre_scores_gemma":[0.14635184,0.038699854,0.04717699,0.019648908,0.0114321895,0.00011015465,0.0002403976,0.0009990269,0.7353407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977225,0.00004009026,0.000009304686,0.000033595967,0.00011850099,0.00002630357],"domain_scores_gemma":[0.99969065,0.00008082055,0.000016493108,0.00006990955,0.00008512191,0.000057129728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040955748,0.0004135372,0.00037071688,0.0002716983,0.0006287307,0.0023725813,0.00042591686,0.0007887028,0.01278598],"category_scores_gemma":[0.0009931552,0.00025343554,0.000340278,0.00039237508,0.0006310434,0.0036132194,0.00070801703,0.0029865764,0.008470461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053438907,0.00006805807,0.0007298551,0.00022612842,0.00005917687,0.00012321844,0.00033328967,0.001838263,0.003927436,0.12688433,0.33614182,0.529615],"study_design_scores_gemma":[0.000009026843,0.000044457025,0.00053713005,0.00014241763,0.000024310033,0.00034761365,0.0001525126,0.0023382432,0.0012324309,0.07114967,0.92400163,0.000020584881],"about_ca_topic_score_codex":0.00045176927,"about_ca_topic_score_gemma":0.00089043885,"teacher_disagreement_score":0.01278598,"about_ca_system_score_codex":0.0004425681,"about_ca_system_score_gemma":0.00034660997,"threshold_uncertainty_score":0.042773306},"labels":[],"label_agreement":null},{"id":"W163770788","doi":"10.1007/978-3-642-33651-5_24","title":"Position Discovery for a System of Bouncing Robots","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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; Université du Québec en Outaouais","funders":"","keywords":"Robot; Position (finance); Bang-bang robot; Mobile robot; Computer science; Point (geometry); Algorithm; Artificial intelligence; Computer vision; Robot control; Control theory (sociology); Mathematics; Control (management); Geometry","score_opus":0.022518641598899238,"score_gpt":0.2526001113165232,"score_spread":0.23008146971762397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163770788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064122155,0.0005200835,0.9250274,0.0006181884,0.0000911202,0.00007657359,0.0001386394,0.00095200224,0.008453857],"genre_scores_gemma":[0.7144669,0.0004568372,0.26602033,0.00009689319,0.00007121824,0.00011101806,0.00026002098,0.000115920535,0.018400803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965465,0.00005108721,0.000028986533,0.000108947694,0.000098024175,0.000058243633],"domain_scores_gemma":[0.9992048,0.00045522203,0.0000714988,0.00008344241,0.00012111669,0.000063955806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890778,0.0007252386,0.0011570101,0.0007234915,0.0017458585,0.0016175206,0.002016984,0.0025646482,0.006595518],"category_scores_gemma":[0.002818206,0.0007593774,0.0007286449,0.00084414874,0.0012430121,0.0017861988,0.0021284756,0.0012092821,0.0009539147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088265014,0.00009471706,0.0020044653,0.00040896877,0.00009513458,0.00064464624,0.00051352073,0.7926477,0.014509141,0.067357644,0.002358722,0.118482724],"study_design_scores_gemma":[0.00004313749,0.00010034216,0.00028252686,0.00001392367,0.000025621226,0.00013343805,0.000045352797,0.9798663,0.0019223435,0.016361726,0.0011786125,0.000026604079],"about_ca_topic_score_codex":0.008264634,"about_ca_topic_score_gemma":0.0065286886,"teacher_disagreement_score":0.008264634,"about_ca_system_score_codex":0.00085283036,"about_ca_system_score_gemma":0.0010502512,"threshold_uncertainty_score":0.022064209},"labels":[],"label_agreement":null},{"id":"W1637847238","doi":"10.1007/11499169_4","title":"Overlay Networks with Linear Capacity Constraints","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Toronto","funders":"","keywords":"Overlay; Overlay network; Computer science; Path (computing); Node (physics); Distributed computing; Context (archaeology); Graph; Computer network; Linear programming; Theoretical computer science; Measure (data warehouse); Algorithm; The Internet; Data mining; Programming language; World Wide Web","score_opus":0.016392810266469347,"score_gpt":0.22685798031004697,"score_spread":0.21046517004357762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1637847238","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.034527365,0.0030929195,0.9110203,0.0015857433,0.00025287128,0.00015492112,0.0009842644,0.00094265176,0.04743899],"genre_scores_gemma":[0.7848968,0.0056104143,0.16741614,0.0003901191,0.0005654415,0.000521932,0.00083705137,0.00033065368,0.039431438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985642,0.00052365486,0.00006725275,0.00021405723,0.0003605957,0.00027032496],"domain_scores_gemma":[0.9946449,0.0036177938,0.00034248986,0.0005776957,0.00059249165,0.00022466283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013602497,0.0011649044,0.001312967,0.0008370426,0.0009793246,0.002435275,0.0027285833,0.0012847235,0.008213468],"category_scores_gemma":[0.008715264,0.0009328031,0.00046849684,0.0026055574,0.0009267565,0.004973356,0.002420908,0.0019371444,0.001641586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018842076,0.00009798992,0.00025042356,0.00061588746,0.000055358818,0.00029396053,0.0001429294,0.5447552,0.004329577,0.34052184,0.017911904,0.09083648],"study_design_scores_gemma":[0.000034564495,0.00005209351,0.00010461759,0.000043385226,0.00003242726,0.00018684959,0.00004903856,0.812246,0.0017028814,0.17629993,0.009219528,0.000028648083],"about_ca_topic_score_codex":0.0024208964,"about_ca_topic_score_gemma":0.0031330348,"teacher_disagreement_score":0.008213468,"about_ca_system_score_codex":0.0020974982,"about_ca_system_score_gemma":0.0013489422,"threshold_uncertainty_score":0.027476788},"labels":[],"label_agreement":null},{"id":"W1638978645","doi":"10.1007/978-3-642-13666-5_33","title":"Breast Tomosynthesis Reconstruction Using a Grid of Blobs with Projection Matrices","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Tomosynthesis; Computer science; Iterative reconstruction; Projection (relational algebra); Voxel; Computer vision; Artificial intelligence; Rotation (mathematics); Algorithm; Mammography; Breast cancer","score_opus":0.018234529406745404,"score_gpt":0.2736003343687314,"score_spread":0.25536580496198596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1638978645","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.012988677,0.0001559261,0.9833239,0.000039879087,0.000030022815,0.000034733734,0.00017451608,0.00084275217,0.0024095878],"genre_scores_gemma":[0.07093127,0.00017228299,0.92638326,0.000022706367,0.000011615087,0.000031339358,0.00025023485,0.00015886733,0.00203839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998586,0.000030511761,0.0000105788085,0.000027932358,0.000062012325,0.0000102967715],"domain_scores_gemma":[0.99975616,0.00008034904,0.000012866051,0.00007050119,0.00006584136,0.000014330071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030353921,0.00037979457,0.00044174452,0.00052116043,0.00019144884,0.00056314317,0.00051754003,0.00039059084,0.0037014524],"category_scores_gemma":[0.00082100055,0.0004768137,0.0004095989,0.0011263888,0.00016690404,0.00041275384,0.00059625745,0.00041759433,0.0013859702],"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.0006120983,0.000092798655,0.0020685752,0.00035517866,0.00014642028,0.00038499574,0.00013991828,0.20600054,0.12861636,0.013981589,0.0071877646,0.64041376],"study_design_scores_gemma":[0.00008625315,0.00022700721,0.0031394754,0.000045243938,0.00008163606,0.0018294854,0.000047719175,0.91727626,0.051464934,0.010272437,0.015485001,0.000044476954],"about_ca_topic_score_codex":0.0015511828,"about_ca_topic_score_gemma":0.0024062695,"teacher_disagreement_score":0.0037014524,"about_ca_system_score_codex":0.00014253035,"about_ca_system_score_gemma":0.0003200791,"threshold_uncertainty_score":0.012382567},"labels":[],"label_agreement":null},{"id":"W164066603","doi":"10.1007/978-3-642-21596-4_15","title":"Kernel Fusion of Audio and Visual Information for Emotion Recognition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Kernel (algebra); Hidden Markov model; Dimensionality reduction; Subspace topology; Pattern recognition (psychology); Feature (linguistics); Support vector machine; Machine learning","score_opus":0.0213127566427588,"score_gpt":0.24396099269612168,"score_spread":0.22264823605336287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164066603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04470566,0.0016104876,0.9491844,0.00017283432,0.00023323324,0.00006768696,0.00029343858,0.0013742342,0.002358039],"genre_scores_gemma":[0.70706034,0.001525872,0.27993032,0.00013120219,0.00016186791,0.00012982448,0.0011469421,0.00027027866,0.009643386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996444,0.00006231326,0.000020488444,0.00008242131,0.000116062874,0.00007430723],"domain_scores_gemma":[0.9996184,0.000101810976,0.000038296104,0.00006181724,0.00015499038,0.000024672729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005787271,0.00064617343,0.0007408829,0.0005109797,0.00018975648,0.00076356396,0.00059610006,0.00047554076,0.0034528836],"category_scores_gemma":[0.0013322363,0.00018526355,0.0008340855,0.0006857615,0.00022225863,0.0010645909,0.0009828878,0.0007864704,0.0021616318],"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.0009546047,0.0002619139,0.0007780617,0.00020146009,0.00013168715,0.00007518608,0.00007182617,0.016377931,0.16999565,0.0026566335,0.004509436,0.8039856],"study_design_scores_gemma":[0.000032689262,0.00025409972,0.0054005748,0.000036663765,0.00016374337,0.00023740172,0.00011048916,0.88398004,0.09962813,0.005399241,0.004706253,0.0000507263],"about_ca_topic_score_codex":0.0009127338,"about_ca_topic_score_gemma":0.0013625213,"teacher_disagreement_score":0.0034528836,"about_ca_system_score_codex":0.00029643436,"about_ca_system_score_gemma":0.00027679396,"threshold_uncertainty_score":0.011551082},"labels":[],"label_agreement":null},{"id":"W1641187076","doi":"10.1007/978-3-540-72397-4_26","title":"Generalizations of the Global Cardinality Constraint for Hierarchical Resources","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Cardinality (data modeling); Computer science; Constraint (computer-aided design); Theoretical computer science; Algorithm; Mathematics; Data mining; Geometry","score_opus":0.026601511951052346,"score_gpt":0.2763459400708205,"score_spread":0.24974442811976813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641187076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02071963,0.0011082697,0.9269484,0.0007671882,0.00021266169,0.00012998248,0.0011257111,0.0004207105,0.048567455],"genre_scores_gemma":[0.43781474,0.0031272413,0.5167991,0.0006866054,0.0009673473,0.00049449527,0.0029902433,0.000991097,0.036129147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970688,0.0006927909,0.00025291418,0.0006219923,0.0009674004,0.00039607298],"domain_scores_gemma":[0.9929415,0.0029673832,0.0005130805,0.0026706078,0.0005877428,0.0003197389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860511,0.0010419755,0.0013029191,0.0014697425,0.0012508539,0.0027458235,0.0030466137,0.0012044344,0.010963604],"category_scores_gemma":[0.010093393,0.0008541218,0.002042552,0.003783376,0.0019079471,0.010460524,0.0036663432,0.004237841,0.0009923455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066270324,0.000035963196,0.00052843377,0.00033010385,0.00006104852,0.00025985428,0.00024764935,0.042241685,0.0024407199,0.90414244,0.008399514,0.04124636],"study_design_scores_gemma":[0.00002116571,0.00003490431,0.00056885305,0.0000930779,0.00006790244,0.0004162374,0.000160647,0.100413665,0.0026323148,0.86426765,0.031281766,0.000041797706],"about_ca_topic_score_codex":0.003348792,"about_ca_topic_score_gemma":0.0049600373,"teacher_disagreement_score":0.010963604,"about_ca_system_score_codex":0.001327119,"about_ca_system_score_gemma":0.0012912374,"threshold_uncertainty_score":0.036676884},"labels":[],"label_agreement":null},{"id":"W1641368799","doi":"10.1007/978-3-642-36949-0_60","title":"Efficient Design Space Exploration of GPGPU Architectures","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Computer science; Design space exploration; Constraint (computer-aided design); Mathematical optimization; Space (punctuation); General-purpose computing on graphics processing units; CUDA; Resource (disambiguation); Computer engineering; Parallel computing; Embedded system; Mathematics; Graphics","score_opus":0.030547678472455448,"score_gpt":0.2550810952208534,"score_spread":0.22453341674839797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641368799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26807398,0.0051014395,0.6559928,0.0007962361,0.00011378607,0.00015717218,0.00036859474,0.0035096924,0.06588636],"genre_scores_gemma":[0.6510122,0.001313854,0.33770788,0.00018160974,0.00003420739,0.00025221493,0.000556705,0.00057008787,0.008371247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.000067072106,0.00000526935,0.000015708076,0.00007415446,0.0000389936],"domain_scores_gemma":[0.99981004,0.00010031105,0.000011283002,0.000038243506,0.000030154764,0.000009986163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021440064,0.0006001733,0.00053975097,0.00049529556,0.00042833504,0.0007540531,0.00077311485,0.00051900995,0.0037112988],"category_scores_gemma":[0.00087773585,0.00035846123,0.00046927767,0.00083925034,0.00035216255,0.0006795294,0.0009841055,0.00083242956,0.0007154943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028764002,0.00010179311,0.0011133148,0.00039041837,0.000066267865,0.00018381461,0.00025866527,0.5484744,0.015359123,0.032668028,0.011530924,0.3895657],"study_design_scores_gemma":[0.000039460403,0.00009311244,0.00026835376,0.000029604827,0.000018255816,0.000075233496,0.000054052143,0.95877784,0.0048661293,0.028886631,0.0068823225,0.000009019875],"about_ca_topic_score_codex":0.0012904044,"about_ca_topic_score_gemma":0.0026201932,"teacher_disagreement_score":0.0037112988,"about_ca_system_score_codex":0.0003471232,"about_ca_system_score_gemma":0.00061792874,"threshold_uncertainty_score":0.012415588},"labels":[],"label_agreement":null},{"id":"W1641444145","doi":"10.1007/978-3-642-45249-9_16","title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Victoria","funders":"","keywords":"Asynchronous communication; Computer science; Computation; Latency (audio); Secure multi-party computation; Theoretical computer science; Function (biology); Distributed algorithm; Field (mathematics); Distributed computing; Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.01032017751236791,"score_gpt":0.2362114292912487,"score_spread":0.22589125177888078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641444145","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.009894764,0.00042009275,0.9761505,0.00038697105,0.00032995854,0.00016255237,0.00016699288,0.0018872587,0.0106008835],"genre_scores_gemma":[0.53911155,0.000552702,0.42893106,0.0005372753,0.000399019,0.00054443703,0.00046881204,0.00074583397,0.028709264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973406,0.0008543858,0.00015896196,0.00035748028,0.0009702034,0.00031840714],"domain_scores_gemma":[0.9973748,0.0013278805,0.00009816327,0.0008694126,0.00020741961,0.00012224844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024843425,0.00073315424,0.0017207937,0.00066176715,0.0012426677,0.002825026,0.002539637,0.0017470339,0.010032041],"category_scores_gemma":[0.0053927894,0.0006201835,0.0007023879,0.0013437426,0.0012911175,0.0035699983,0.005881596,0.0025933008,0.0033282042],"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.0012046961,0.00028255646,0.00031966262,0.00035764175,0.000084456886,0.0002252425,0.00037303485,0.053128246,0.022340411,0.61486316,0.022875356,0.28394556],"study_design_scores_gemma":[0.00016741811,0.00009831825,0.00011327881,0.000027755352,0.000028431927,0.00014466711,0.000045790566,0.570711,0.009818664,0.40484157,0.01396698,0.000036058394],"about_ca_topic_score_codex":0.00030530643,"about_ca_topic_score_gemma":0.0004951903,"teacher_disagreement_score":0.010032041,"about_ca_system_score_codex":0.00077405653,"about_ca_system_score_gemma":0.0008043859,"threshold_uncertainty_score":0.033560455},"labels":[],"label_agreement":null},{"id":"W1642572343","doi":"10.1007/3-540-70734-4_18","title":"A Local Refinement Algorithm for Data Partitioning","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"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":"Computer science; Workload; Context (archaeology); Algorithm; Space partitioning; Graph partition; Parallel computing; Enhanced Data Rates for GSM Evolution; Metis; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.03256385869187683,"score_gpt":0.25787329483221677,"score_spread":0.22530943614033994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642572343","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.0021219903,0.00020181449,0.99490225,0.00004098128,0.000029552411,0.000048714952,0.000047983485,0.0011982255,0.0014083823],"genre_scores_gemma":[0.02477253,0.00016620397,0.97035295,0.000052456548,0.000020061787,0.00010664489,0.0002564113,0.00035944767,0.0039131944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995179,0.000074751406,0.00003417535,0.0000878691,0.00023891815,0.00004637739],"domain_scores_gemma":[0.9991842,0.00024820678,0.000031572054,0.0002879092,0.00022226438,0.000025912845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051025744,0.00086006394,0.0010047322,0.0010697712,0.0007924572,0.0007498111,0.0017701379,0.00060386903,0.01176773],"category_scores_gemma":[0.0019067316,0.00053717324,0.0007682373,0.0017732319,0.00066229113,0.0013394909,0.0015467044,0.0012243621,0.0035150878],"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.00026074518,0.00006298838,0.00024361766,0.00022295615,0.00004971409,0.000058949965,0.00015546926,0.038873527,0.03603309,0.020127442,0.012066023,0.8918455],"study_design_scores_gemma":[0.00020858082,0.0002632716,0.0005958107,0.00006135927,0.000105758074,0.00044006231,0.00013189096,0.85444903,0.055698633,0.039862793,0.048117172,0.00006574194],"about_ca_topic_score_codex":0.0044350764,"about_ca_topic_score_gemma":0.008928937,"teacher_disagreement_score":0.01176773,"about_ca_system_score_codex":0.0005034133,"about_ca_system_score_gemma":0.0008657883,"threshold_uncertainty_score":0.0393669},"labels":[],"label_agreement":null},{"id":"W164317220","doi":"10.1007/978-3-642-24028-7_71","title":"Real-Time Object Tracking on iPhone","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Tracking (education); Video tracking; Object (grammar); Matching (statistics); Tracking system; Computer graphics (images); Mathematics","score_opus":0.03347473561539138,"score_gpt":0.2774255847903342,"score_spread":0.2439508491749428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164317220","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.11167857,0.0016981767,0.8575646,0.000157044,0.00043079743,0.000104743245,0.00067061983,0.013221576,0.014473865],"genre_scores_gemma":[0.5583965,0.00085925974,0.4112298,0.0002413111,0.00011474598,0.000065300024,0.0014115942,0.00069117115,0.026990239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998054,0.000018678578,0.000007141072,0.000061612605,0.00008140274,0.000025778823],"domain_scores_gemma":[0.99979514,0.000060417,0.000008852858,0.00004880201,0.000068284855,0.000018602286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033551225,0.00046718173,0.0006072095,0.0005684407,0.00028040688,0.0005284459,0.0005979286,0.0006423169,0.006484308],"category_scores_gemma":[0.00053202716,0.00027822453,0.00022675694,0.0005235216,0.0001413476,0.0007122749,0.00048148562,0.00027220833,0.00216052],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006746236,0.00005845286,0.0011474832,0.00012631202,0.000045775723,0.0002066165,0.00011424625,0.0076962486,0.15224312,0.0011473896,0.011843182,0.82469666],"study_design_scores_gemma":[0.000059862934,0.00029842838,0.01244151,0.00005630187,0.000101889054,0.001447798,0.00008748375,0.7847755,0.16322827,0.0026847941,0.03474537,0.00007282446],"about_ca_topic_score_codex":0.0023278731,"about_ca_topic_score_gemma":0.0033995414,"teacher_disagreement_score":0.006484308,"about_ca_system_score_codex":0.00020389457,"about_ca_system_score_gemma":0.00018409887,"threshold_uncertainty_score":0.021692157},"labels":[],"label_agreement":null},{"id":"W164355275","doi":"10.1007/978-3-642-24500-8_19","title":"Time Balancing with Adaptive Time-Variant Minigames","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Computer science; Adaptability; Parameterized complexity; Adaptation (eye); Load balancing (electrical power); Distributed computing; Human–computer interaction; Algorithm; Mathematics","score_opus":0.019652412821435032,"score_gpt":0.25908949010563376,"score_spread":0.23943707728419872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164355275","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059274573,0.00031568028,0.91866297,0.00008448554,0.00011322948,0.00007912467,0.00004348483,0.0007036774,0.020722786],"genre_scores_gemma":[0.8708123,0.0001865231,0.10859149,0.00006523164,0.00004458409,0.00015045998,0.000073632254,0.00012667898,0.01994921],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997626,0.000058555368,0.000013434625,0.00005941852,0.000065030974,0.000040929805],"domain_scores_gemma":[0.9996184,0.00020214691,0.000036199457,0.000049822884,0.00004726151,0.000046083733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033271054,0.0008626337,0.0006074816,0.00027307365,0.00025858785,0.000731434,0.0014191536,0.0006139933,0.008955365],"category_scores_gemma":[0.0014832873,0.00029862364,0.00038801838,0.00025558038,0.00035491886,0.000865369,0.0011630224,0.0007656913,0.0009521741],"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.0023223325,0.0005709735,0.0008711771,0.00024236234,0.00013224334,0.00020337419,0.00030975122,0.39478546,0.036811452,0.100910656,0.004148764,0.4586915],"study_design_scores_gemma":[0.000084718275,0.00028592529,0.00046902048,0.000017568662,0.000031268195,0.00010343406,0.00003515135,0.9591613,0.003936665,0.032420736,0.003431895,0.000022189055],"about_ca_topic_score_codex":0.0008637243,"about_ca_topic_score_gemma":0.00094254233,"teacher_disagreement_score":0.008955365,"about_ca_system_score_codex":0.00022988165,"about_ca_system_score_gemma":0.00021285974,"threshold_uncertainty_score":0.029958665},"labels":[],"label_agreement":null},{"id":"W164388623","doi":"10.1007/978-3-540-74260-9_72","title":"Face Recognition by Curvelet Based Feature Extraction","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Canada Research Chairs","keywords":"Curvelet; Computer science; Artificial intelligence; Pattern recognition (psychology); Face (sociological concept); Feature extraction; Facial recognition system; Wavelet; Wavelet transform; Support vector machine; Feature (linguistics); Set (abstract data type); Feature vector; Image (mathematics); Computer vision","score_opus":0.028537403801803845,"score_gpt":0.27259675784773624,"score_spread":0.2440593540459324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164388623","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.023419144,0.0007719462,0.96711046,0.000109045526,0.0001450007,0.00008709236,0.00020868276,0.0025883077,0.0055602533],"genre_scores_gemma":[0.2538921,0.0020579733,0.71521914,0.00024484572,0.0002082233,0.00019858271,0.0013655116,0.00036760347,0.026445987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997632,0.000016810309,0.000008962821,0.000040759605,0.00014218038,0.00002808083],"domain_scores_gemma":[0.9997538,0.000060454386,0.000014461807,0.000049625756,0.00010951417,0.000012157094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023427316,0.00049572135,0.0008767333,0.0009797463,0.00021601822,0.00055839104,0.00072583836,0.00079508184,0.004924716],"category_scores_gemma":[0.00054151326,0.0003103607,0.00047829727,0.001105474,0.00021129627,0.00079892325,0.0004117645,0.0006327879,0.005282484],"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.0001226393,0.00007305591,0.00042212097,0.00008749261,0.000019055646,0.00008518843,0.000020074976,0.0055066925,0.22574274,0.0013061716,0.004138035,0.7624768],"study_design_scores_gemma":[0.00002791929,0.00025645396,0.006230465,0.00004203976,0.00006196883,0.0013828705,0.000033860208,0.5094901,0.4611121,0.003207548,0.018089488,0.00006526781],"about_ca_topic_score_codex":0.00063656387,"about_ca_topic_score_gemma":0.00059449265,"teacher_disagreement_score":0.004924716,"about_ca_system_score_codex":0.0002170629,"about_ca_system_score_gemma":0.00022887628,"threshold_uncertainty_score":0.016474783},"labels":[],"label_agreement":null},{"id":"W1645701135","doi":"10.1007/978-3-642-01307-2_42","title":"A Nonparametric Bayesian Learning Model: Application to Text and Image Categorization","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Université de Sherbrooke; Concordia University","funders":"","keywords":"Categorization; Computer science; Gibbs sampling; Nonparametric statistics; Artificial intelligence; Bayesian probability; Mixture model; Flexibility (engineering); Posterior probability; Machine learning; Image (mathematics); Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.009606028271420444,"score_gpt":0.2556173150931961,"score_spread":0.24601128682177564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645701135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017465395,0.00019802534,0.99688953,0.00014545822,0.000030641513,0.00003092177,0.00007664357,0.00035489025,0.00052734686],"genre_scores_gemma":[0.077206604,0.00073508656,0.9147198,0.00023455195,0.00020112771,0.0003689232,0.00058132556,0.00033831125,0.005614308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855703,0.00060549675,0.0000761044,0.0002690812,0.0004377769,0.000054496217],"domain_scores_gemma":[0.99622995,0.002607205,0.00014887402,0.00030441835,0.0006213878,0.00008807591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045092343,0.000785916,0.0019483309,0.0015927508,0.00091359246,0.0023627891,0.0030117733,0.0026069924,0.00464],"category_scores_gemma":[0.015077145,0.0009929087,0.0016449436,0.0029908263,0.00095026125,0.0034237436,0.002007669,0.0027564843,0.0022675854],"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.00016926392,0.0002617122,0.0008715429,0.0002952145,0.00014835528,0.000097094475,0.00022727954,0.32615957,0.0028245517,0.07671906,0.01582377,0.5764026],"study_design_scores_gemma":[0.000011524292,0.000015389809,0.0001485117,0.000011906111,0.00001735037,0.00004652579,0.0000120814075,0.9467,0.00030568297,0.050996162,0.0017177492,0.000017236342],"about_ca_topic_score_codex":0.0057395836,"about_ca_topic_score_gemma":0.0074057407,"teacher_disagreement_score":0.0057395836,"about_ca_system_score_codex":0.0010995032,"about_ca_system_score_gemma":0.0013961697,"threshold_uncertainty_score":0.023847401},"labels":[],"label_agreement":null},{"id":"W1646201678","doi":"10.1007/978-3-642-30615-0_29","title":"The Density of Ternary Barker Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Ternary operation; Autocorrelation; Sequence (biology); Computer science; Offset (computer science); Lattice (music); Arithmetic; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Statistics; Programming language; Physics","score_opus":0.014786015811448408,"score_gpt":0.22878428086090818,"score_spread":0.2139982650494598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646201678","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.263297,0.014655977,0.3511783,0.00432453,0.0012146616,0.00008313048,0.0010692003,0.00057440717,0.36360273],"genre_scores_gemma":[0.922459,0.007808078,0.027800962,0.0005362323,0.0018234716,0.00019201139,0.0005021919,0.00020508138,0.038672924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993192,0.00018649166,0.000031676725,0.00008386772,0.00030401148,0.00007471987],"domain_scores_gemma":[0.99642545,0.0024399192,0.00024376165,0.00030506577,0.00040012092,0.00018573257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078096817,0.00043786145,0.000681973,0.0027402851,0.0009267168,0.0021651108,0.0008819948,0.001099153,0.01050789],"category_scores_gemma":[0.008448295,0.0005361905,0.00028722902,0.0022250663,0.0019833078,0.0035088614,0.0016497383,0.0014480368,0.0016638024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022798546,0.000006466373,0.00015229885,0.000051581694,0.0000036129034,0.000026087386,0.00008493709,0.0018001858,0.0007718473,0.9831186,0.0017343203,0.012227175],"study_design_scores_gemma":[0.00000771758,0.00001219378,0.00033937139,0.00004244965,0.000006619819,0.00022710774,0.00005163356,0.01087539,0.0009326952,0.98167,0.0058135004,0.000021226211],"about_ca_topic_score_codex":0.0005091611,"about_ca_topic_score_gemma":0.0002978988,"teacher_disagreement_score":0.01050789,"about_ca_system_score_codex":0.00089080154,"about_ca_system_score_gemma":0.00047245008,"threshold_uncertainty_score":0.035152376},"labels":[],"label_agreement":null},{"id":"W1646633498","doi":"10.1007/978-3-319-22729-0_10","title":"Big Data Analytics of Social Networks for the Discovery of “Following” Patterns","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":63,"is_retracted":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":"Big data; Computer science; Data science; Interdependence; Social network (sociolinguistics); Social network analysis; Analytics; Friendship; World Wide Web; Data mining; Social media; Sociology; Social science","score_opus":0.08719827100810508,"score_gpt":0.3050975525639662,"score_spread":0.21789928155586114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646633498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111836575,0.011720605,0.82278633,0.004081416,0.0005208537,0.00044758816,0.030774008,0.004669452,0.01316318],"genre_scores_gemma":[0.46805173,0.0055599706,0.49188882,0.000513401,0.0005615606,0.0004261473,0.027321525,0.00024370622,0.0054331557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991223,0.00019480636,0.000066780565,0.0002838993,0.0002773437,0.000054763146],"domain_scores_gemma":[0.9967548,0.0019471309,0.00041335472,0.00051031134,0.0002173747,0.00015697011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000891328,0.0009744805,0.0009525052,0.0045003705,0.00059166545,0.0021557584,0.0015560064,0.0010068801,0.0035672637],"category_scores_gemma":[0.0067400625,0.000459694,0.0011587373,0.0063449764,0.000601158,0.0038503197,0.0013927447,0.0015144539,0.0026213038],"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.00039737343,0.000616602,0.055439517,0.0020919242,0.00082221243,0.00051719876,0.0013092537,0.038727667,0.014844925,0.083207294,0.07147148,0.7305546],"study_design_scores_gemma":[0.00002650371,0.00014364548,0.018254934,0.00027974456,0.0001592859,0.00062606734,0.00075555313,0.5804129,0.007898652,0.35574177,0.035628993,0.00007185963],"about_ca_topic_score_codex":0.001895193,"about_ca_topic_score_gemma":0.0036332756,"teacher_disagreement_score":0.0045003705,"about_ca_system_score_codex":0.00056849513,"about_ca_system_score_gemma":0.00054158276,"threshold_uncertainty_score":0.011933744},"labels":[],"label_agreement":null},{"id":"W164668433","doi":"10.1007/978-3-642-39718-9_19","title":"Finitary Fairness in Action Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"McMaster University","funders":"","keywords":"Finitary; Computer science; Implementation; Action (physics); Theoretical computer science; Protocol (science); Discrete mathematics; Mathematics; Programming language","score_opus":0.023403778723008355,"score_gpt":0.24568324778230813,"score_spread":0.22227946905929977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164668433","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.019138347,0.004804597,0.80722886,0.0033857846,0.00087869493,0.00007512239,0.00017598284,0.0004898832,0.16382268],"genre_scores_gemma":[0.7999531,0.0029593802,0.1215712,0.0009085629,0.0013672275,0.0003830232,0.0003023748,0.00034390244,0.07221124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996228,0.0015233856,0.00025554386,0.0005417016,0.00097484025,0.00047644952],"domain_scores_gemma":[0.9948133,0.0034485003,0.00017771132,0.00085712183,0.00050885754,0.00019441529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004798297,0.00073393964,0.00094529433,0.0008503088,0.0021569089,0.0039571268,0.001656048,0.0014780295,0.006055148],"category_scores_gemma":[0.009160854,0.0007406856,0.0009667497,0.0014966612,0.0056651626,0.0063576754,0.002162713,0.0048843324,0.0009970755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001193152,0.0000050418525,0.000037428814,0.000018909515,0.0000035020043,0.000010147805,0.000112078626,0.0014221991,0.00010651287,0.9929542,0.0006998968,0.004618125],"study_design_scores_gemma":[0.00000517291,0.000003982536,0.000026557116,0.00001203426,0.0000037417176,0.0000104038645,0.000012493713,0.004006812,0.00012057449,0.9919892,0.0038050697,0.000003906304],"about_ca_topic_score_codex":0.0025938805,"about_ca_topic_score_gemma":0.001980022,"teacher_disagreement_score":0.006055148,"about_ca_system_score_codex":0.004047639,"about_ca_system_score_gemma":0.002169382,"threshold_uncertainty_score":0.029367745},"labels":[],"label_agreement":null},{"id":"W1646828634","doi":"10.1007/978-3-642-17528-2_17","title":"Linguistic Investigations into Ellipsis in Classical Sanskrit","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"History and Theory of Mathematics","field":"Mathematics","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":"McGill University","funders":"","keywords":"Sanskrit; Ellipsis (linguistics); Computer science; Linguistics; Natural language processing; Reading (process); Artificial intelligence; Philosophy","score_opus":0.03632403302926131,"score_gpt":0.28624693792167955,"score_spread":0.24992290489241825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646828634","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.3105224,0.008545748,0.015433654,0.00800457,0.0003563517,0.00003253706,0.00016714631,0.00015643427,0.6567812],"genre_scores_gemma":[0.97654027,0.0014060815,0.002715303,0.00027274882,0.0002166803,0.00001056312,0.00007288407,0.00010087483,0.018664578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980229,0.001268122,0.00011538731,0.00017036803,0.00030620742,0.00011701175],"domain_scores_gemma":[0.9947286,0.004183297,0.00027897127,0.0002795895,0.00044167906,0.00008779611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016839011,0.0005753033,0.00044740393,0.002568006,0.005904522,0.005133059,0.00087486894,0.0016053108,0.00739568],"category_scores_gemma":[0.003764455,0.0004875354,0.00018909381,0.0035281428,0.009111209,0.00604549,0.0017650343,0.0032130326,0.0007366767],"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.00005679189,0.00003095895,0.0007181702,0.00018965597,0.000007735959,0.00058242783,0.05625957,0.00019527065,0.0017310501,0.92684644,0.0023742395,0.011007779],"study_design_scores_gemma":[0.000040771854,0.00014118133,0.012455769,0.0007501077,0.000064279564,0.0053795455,0.085851446,0.006628171,0.0075270394,0.5772176,0.30381683,0.00012724333],"about_ca_topic_score_codex":0.0068585305,"about_ca_topic_score_gemma":0.013345061,"teacher_disagreement_score":0.00739568,"about_ca_system_score_codex":0.003147574,"about_ca_system_score_gemma":0.0009308165,"threshold_uncertainty_score":0.024741054},"labels":[],"label_agreement":null},{"id":"W1647183428","doi":"10.1007/3-540-44886-1_62","title":"A Quick Look at Methods for Mining Long Subsequences","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Substring; Computer science; Sequence (biology); String (physics); Task (project management); Heuristic; String searching algorithm; Sequential Pattern Mining; Algorithm; Artificial intelligence; Data mining; Pattern matching; Data structure; Mathematics","score_opus":0.038905348153038075,"score_gpt":0.329222853790603,"score_spread":0.2903175056375649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1647183428","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.0025627355,0.03502972,0.95177466,0.00095098146,0.00089680153,0.00012314034,0.0010070062,0.004131474,0.003523457],"genre_scores_gemma":[0.011948586,0.020803256,0.9366188,0.0008928018,0.0008266068,0.00019618995,0.0035322616,0.00094124716,0.024240203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913174,0.00008826627,0.000086889784,0.00022079397,0.00044015737,0.000032066608],"domain_scores_gemma":[0.9981804,0.0010859034,0.00007419274,0.00022235133,0.00037263092,0.00006438482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011549972,0.0019293131,0.0018298903,0.003649453,0.0008015678,0.0023392988,0.0025777514,0.0018201199,0.011919722],"category_scores_gemma":[0.0052527934,0.0011045224,0.0015614086,0.006223979,0.0006404424,0.005274702,0.0012066696,0.0022481582,0.0103146555],"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.00013209034,0.00009596488,0.0008880597,0.0012382364,0.00019226492,0.00023656545,0.0000978341,0.00302673,0.01054682,0.011365391,0.043543637,0.92863643],"study_design_scores_gemma":[0.00020894383,0.00071788504,0.0057832734,0.0012219807,0.00046386864,0.006397106,0.0005222812,0.14602754,0.040826734,0.24459034,0.5528094,0.00043061722],"about_ca_topic_score_codex":0.0009759584,"about_ca_topic_score_gemma":0.0025917583,"teacher_disagreement_score":0.011919722,"about_ca_system_score_codex":0.00033985244,"about_ca_system_score_gemma":0.0005309947,"threshold_uncertainty_score":0.03987539},"labels":[],"label_agreement":null},{"id":"W164740630","doi":"10.1007/978-3-319-11623-5_3","title":"Effect of Ecological Gestures on the Immersion of the Player in a Serious Game","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Immersion (mathematics); Gesture; Serious game; Human–computer interaction; Computer science; Video game; Psychology; Multimedia; Artificial intelligence; Mathematics","score_opus":0.012940077542467792,"score_gpt":0.25635345043572566,"score_spread":0.24341337289325787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164740630","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.9944699,0.00019962601,0.0012913696,0.000046757086,0.00005250682,0.000034601253,0.00008276585,0.00012206781,0.003700404],"genre_scores_gemma":[0.9962005,0.00016068116,0.0013964224,0.000038724862,0.000019188707,0.0000645991,0.00007423224,0.000078358375,0.0019671754],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99946207,0.00016745133,0.00003540871,0.00008526394,0.00010846769,0.00014136765],"domain_scores_gemma":[0.9943123,0.004716073,0.0001582117,0.00015878367,0.00016464535,0.00049002067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045946726,0.0009869965,0.0005381648,0.00034000332,0.0004162726,0.0012397156,0.0006051637,0.00071212556,0.015416936],"category_scores_gemma":[0.01035471,0.00037654166,0.00032330112,0.00021673492,0.0006879436,0.0006482784,0.0015874843,0.00089969626,0.0007456885],"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.06869311,0.005975315,0.014418946,0.002298485,0.0003023273,0.00087536254,0.009445134,0.0063791513,0.7491974,0.0016881314,0.0019178799,0.13880874],"study_design_scores_gemma":[0.005531888,0.07494273,0.60224843,0.0013308324,0.002490607,0.0019429396,0.012685604,0.03716557,0.24381201,0.0046383464,0.012692944,0.00051809964],"about_ca_topic_score_codex":0.0013847359,"about_ca_topic_score_gemma":0.0012764017,"teacher_disagreement_score":0.015416936,"about_ca_system_score_codex":0.00015727001,"about_ca_system_score_gemma":0.00031978477,"threshold_uncertainty_score":0.051574826},"labels":[],"label_agreement":null},{"id":"W1648195614","doi":"10.1007/978-3-642-14600-8_46","title":"An Examination of Cleveland and McGill’s Hierarchy of Graphical Elements","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":true,"ca_institutions":"University of New Brunswick; Queen's University","funders":"","keywords":"Perception; Hierarchy; Computer science; Graph; Reading (process); Affect (linguistics); Graph theory; Information retrieval; Artificial intelligence; Theoretical computer science; Psychology; Mathematics; Communication; Linguistics; Combinatorics","score_opus":0.01934599227403942,"score_gpt":0.28444936085891914,"score_spread":0.2651033685848797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648195614","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.032164246,0.010176322,0.3186931,0.018960765,0.0007109271,0.00032163245,0.0006948646,0.0009230814,0.6173551],"genre_scores_gemma":[0.4593386,0.008835036,0.4491951,0.0025887096,0.00038876446,0.00026938223,0.00088732125,0.0007142345,0.077782765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981269,0.0006419202,0.00015722547,0.00026363024,0.0006785339,0.00013180851],"domain_scores_gemma":[0.9926112,0.004082687,0.0002574195,0.00063459313,0.0021031532,0.00031100394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021168836,0.00049392006,0.00037872363,0.006830176,0.004055517,0.0049987067,0.0013337396,0.0010539166,0.014850898],"category_scores_gemma":[0.013705119,0.0006329534,0.0007668878,0.0061648623,0.0058987783,0.009847623,0.0017177713,0.0027928741,0.0017626968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015772199,0.000024693443,0.0009067021,0.00012711865,0.0000072562457,0.00010416682,0.006415176,0.00029918543,0.00047389598,0.9061538,0.020797713,0.06467457],"study_design_scores_gemma":[0.0000122593665,0.000026285716,0.0033686731,0.00032198298,0.000024320098,0.00035325906,0.00445999,0.003179653,0.0004946529,0.522438,0.46527877,0.00004215928],"about_ca_topic_score_codex":0.045553766,"about_ca_topic_score_gemma":0.086408325,"teacher_disagreement_score":0.045553766,"about_ca_system_score_codex":0.0035837763,"about_ca_system_score_gemma":0.0036366396,"threshold_uncertainty_score":0.090577245},"labels":[],"label_agreement":null},{"id":"W1648355160","doi":"10.1007/978-3-540-32256-6_53","title":"Optimizing Precision of Self-Localization in the Simulated Robotics Soccer","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cartesian coordinate system; Kalman filter; Orientation (vector space); Artificial intelligence; Heuristic; Robotics; Computer vision; Robot; Mathematics","score_opus":0.017381811539460616,"score_gpt":0.2783587371033082,"score_spread":0.2609769255638476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648355160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2132506,0.00040576677,0.7786582,0.00019082792,0.0000430808,0.0000308732,0.000048057816,0.00051625253,0.0068563162],"genre_scores_gemma":[0.96854186,0.000074814554,0.029649759,0.000014327373,0.000007910991,0.00001989608,0.000023658793,0.000064119704,0.0016035548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978346,0.00006242002,0.00001015099,0.000040568586,0.00007044168,0.000033002194],"domain_scores_gemma":[0.99947053,0.0002974236,0.00005687803,0.000054669916,0.00009627197,0.000024316794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049049465,0.0005525182,0.00070320774,0.0002587837,0.00028961638,0.0006996335,0.000627418,0.0008013891,0.0015440844],"category_scores_gemma":[0.0019995226,0.000501967,0.00028988824,0.00035494068,0.00061946275,0.0005805132,0.00094562396,0.00045129706,0.0002328011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101263235,0.00001848116,0.00032205583,0.000035246907,0.000016122829,0.000017696304,0.00003942309,0.9663861,0.0040075835,0.0026394199,0.00029522885,0.026121402],"study_design_scores_gemma":[0.0000121689445,0.000062738916,0.00018702143,0.000005278078,0.000005400503,0.00001549681,0.000010062063,0.9957124,0.002309445,0.0014741595,0.00020066634,0.0000051442694],"about_ca_topic_score_codex":0.004049258,"about_ca_topic_score_gemma":0.0031539223,"teacher_disagreement_score":0.004049258,"about_ca_system_score_codex":0.00048541164,"about_ca_system_score_gemma":0.0006855204,"threshold_uncertainty_score":0.008051395},"labels":[],"label_agreement":null},{"id":"W1649360688","doi":"10.1007/978-3-642-13541-5_2","title":"Modeling and Verifying Business Interactions via Commitments and Dialogue Actions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Concordia University","funders":"","keywords":"Computer science; Variety (cybernetics); Negotiation; Protocol (science); Domain (mathematical analysis); Interaction protocol; Human–computer interaction; Model checking; Business process; Software engineering; Communications protocol; Artificial intelligence; Theoretical computer science","score_opus":0.0415160642834746,"score_gpt":0.27585907298024687,"score_spread":0.23434300869677227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1649360688","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.023243966,0.00010080227,0.9714338,0.00021526335,0.00003182195,0.00014684234,0.0001649718,0.0020516238,0.0026107535],"genre_scores_gemma":[0.5375162,0.00026398466,0.45619076,0.0000991859,0.00005282438,0.00028402617,0.00065812486,0.00089005695,0.004044834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900024,0.004055513,0.0008608875,0.0016388526,0.002713698,0.0007286044],"domain_scores_gemma":[0.9675357,0.023305727,0.0019605006,0.0052003586,0.0016274083,0.00037028795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068236324,0.001779229,0.0014259802,0.0013058883,0.001474798,0.004902711,0.005147661,0.0028393946,0.0048291716],"category_scores_gemma":[0.033890016,0.0028658474,0.0031610695,0.0010977043,0.0047395844,0.010912426,0.0046282196,0.0042500542,0.0011035242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027790794,0.00014190705,0.0021338586,0.00029416388,0.0001228198,0.00044000286,0.00087639893,0.6507869,0.003978768,0.28744882,0.0014022215,0.052096207],"study_design_scores_gemma":[0.000027729837,0.000027986558,0.00014744246,0.000028141147,0.000040067185,0.00005972641,0.00009653995,0.8843196,0.0049465117,0.10856179,0.0017217372,0.000022783202],"about_ca_topic_score_codex":0.014833189,"about_ca_topic_score_gemma":0.010547901,"teacher_disagreement_score":0.014833189,"about_ca_system_score_codex":0.0022189165,"about_ca_system_score_gemma":0.0041306303,"threshold_uncertainty_score":0.036087215},"labels":[],"label_agreement":null},{"id":"W1649866788","doi":"10.1007/978-3-642-00958-7_73","title":"Representing User Navigation in XML Retrieval with Structural Summaries","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Toronto","funders":"","keywords":"Computer science; XML; Information retrieval; Document Structure Description; XML framework; XML database; World Wide Web","score_opus":0.012522114379109937,"score_gpt":0.24998162660355874,"score_spread":0.2374595122244488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1649866788","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.078808464,0.0013942284,0.8818623,0.000555723,0.00016426889,0.00019798952,0.0033277906,0.026216729,0.00747267],"genre_scores_gemma":[0.376425,0.0013378776,0.6025212,0.00015272136,0.000101803176,0.00013952315,0.0064714476,0.0017376005,0.011112742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921393,0.00025615023,0.00011560172,0.00013997403,0.00020746014,0.00006672354],"domain_scores_gemma":[0.9983033,0.0009566104,0.0001221744,0.00031430484,0.000245869,0.000057690024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013967309,0.0007045755,0.0009388371,0.0020986553,0.0007340778,0.0036637974,0.0012269001,0.0013851917,0.007494404],"category_scores_gemma":[0.005348428,0.0005772147,0.00083537685,0.002410082,0.00065031426,0.005967571,0.0016754303,0.0006853378,0.0020486864],"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.0021466366,0.0003353306,0.0076507046,0.0014690459,0.00014662494,0.0009342781,0.003965643,0.102328286,0.023973422,0.1715947,0.038585074,0.64687026],"study_design_scores_gemma":[0.00013493195,0.0003732748,0.0012449075,0.00021298038,0.00026798286,0.00048314538,0.0009207806,0.80917853,0.037968133,0.08524865,0.06384053,0.00012618791],"about_ca_topic_score_codex":0.008229872,"about_ca_topic_score_gemma":0.010416028,"teacher_disagreement_score":0.008229872,"about_ca_system_score_codex":0.00079699454,"about_ca_system_score_gemma":0.0008660371,"threshold_uncertainty_score":0.025071204},"labels":[],"label_agreement":null},{"id":"W1650112140","doi":"10.1007/3-540-45813-1_45","title":"A Method for Detecting Context-Specific Independence in Conditional Probability Tables","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Regina","funders":"","keywords":"Computer science; Independence (probability theory); Conditional independence; Context (archaeology); Bayesian network; Inference; Artificial intelligence; Bayesian probability; Machine learning; Data mining; Algorithm; Statistics; Mathematics","score_opus":0.03918470606948292,"score_gpt":0.2806212904622083,"score_spread":0.24143658439272536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650112140","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.004071,0.000086604996,0.9928784,0.00002697079,0.000024205943,0.000065852255,0.00031783708,0.0021764284,0.0003528333],"genre_scores_gemma":[0.08405891,0.00010803086,0.9125822,0.00006985535,0.00007117845,0.0002309827,0.0014129253,0.00029688506,0.0011691125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953052,0.0009240243,0.0003682304,0.0010016806,0.002168218,0.00023261593],"domain_scores_gemma":[0.97933495,0.01464686,0.0007578232,0.0031240373,0.0017756214,0.00036074538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003267013,0.0011008799,0.0013977222,0.0036192483,0.0012210709,0.0021773395,0.0026276445,0.0016106747,0.004796637],"category_scores_gemma":[0.02245487,0.0014524464,0.0016458005,0.0033639579,0.0009849886,0.003952016,0.0026302037,0.0024300413,0.0019138304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009650444,0.00038554665,0.013551236,0.00046464754,0.000495199,0.00074175297,0.00055671623,0.039056916,0.029820802,0.073498115,0.013634575,0.8268295],"study_design_scores_gemma":[0.00017225806,0.00014865061,0.004682491,0.00007608348,0.0003198428,0.0016412943,0.00012006826,0.8123243,0.03579111,0.12896964,0.015578339,0.00017592161],"about_ca_topic_score_codex":0.0021505358,"about_ca_topic_score_gemma":0.003215561,"teacher_disagreement_score":0.004796637,"about_ca_system_score_codex":0.0004813436,"about_ca_system_score_gemma":0.0017590089,"threshold_uncertainty_score":0.017277837},"labels":[],"label_agreement":null},{"id":"W1650804014","doi":"10.1007/978-3-642-22300-6_17","title":"Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ball (mathematics); Combinatorics; Approx; Euclidean space; Upper and lower bounds; Algorithm; Mathematics; Space (punctuation); Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.018604654738011733,"score_gpt":0.2528615788993372,"score_spread":0.23425692416132546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650804014","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.015139811,0.0012543572,0.9772081,0.00045318814,0.00018125425,0.000077835386,0.00025914193,0.0008018673,0.0046244035],"genre_scores_gemma":[0.17417601,0.0015794022,0.8104031,0.00021303559,0.00045454348,0.0003879026,0.0013406259,0.0006713375,0.010774036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988457,0.00023196626,0.00008649598,0.00024362563,0.00045923213,0.00013297069],"domain_scores_gemma":[0.9955031,0.0025825459,0.00023086261,0.00091186975,0.000507528,0.00026412902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014944338,0.0016580849,0.002268835,0.0018108608,0.0011305964,0.0018351462,0.004614189,0.0017515303,0.010660605],"category_scores_gemma":[0.010603659,0.0010466035,0.0011796099,0.003604781,0.0015748964,0.0056874384,0.004372935,0.003506888,0.0018729254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008815937,0.00026889253,0.0008623534,0.0006082262,0.00008050503,0.000099063494,0.00043747225,0.29642144,0.008007562,0.27765253,0.027286224,0.38739407],"study_design_scores_gemma":[0.00008477549,0.000069065354,0.0001953176,0.000039290044,0.000016272501,0.00009731402,0.00006410459,0.8279084,0.0020104342,0.16374601,0.005748338,0.000020571879],"about_ca_topic_score_codex":0.002878745,"about_ca_topic_score_gemma":0.0029020787,"teacher_disagreement_score":0.010660605,"about_ca_system_score_codex":0.0015682381,"about_ca_system_score_gemma":0.0010012244,"threshold_uncertainty_score":0.035663307},"labels":[],"label_agreement":null},{"id":"W165089886","doi":"10.1007/978-3-642-40104-6_16","title":"On the Spanning Ratio of Theta-Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.028394435626567245,"score_gpt":0.2754427752379511,"score_spread":0.24704833961138384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165089886","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.44558012,0.019152675,0.18744381,0.0047725006,0.0010964143,0.00009357397,0.00089827937,0.00059949316,0.34036317],"genre_scores_gemma":[0.9243179,0.012134619,0.036786772,0.00068948866,0.0019887104,0.00017654552,0.00086698186,0.0005549139,0.0224841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00029607976,0.000038754744,0.0001804429,0.00024119277,0.00011181901],"domain_scores_gemma":[0.9958334,0.0031323659,0.00028234746,0.00020236065,0.00028377443,0.00026578785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359217,0.0011195105,0.0010847611,0.004280706,0.00091258634,0.0020645957,0.0017830653,0.00094637566,0.008908158],"category_scores_gemma":[0.009038301,0.00067433866,0.0006506481,0.0035660402,0.0021796643,0.0052680713,0.0016256836,0.0028730456,0.0015664987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001254645,0.000042463096,0.0007997549,0.00025459303,0.00003115422,0.00008697653,0.00029814773,0.0068583325,0.0030261897,0.93043673,0.0072504953,0.050789665],"study_design_scores_gemma":[0.000017009397,0.000034003337,0.0008690152,0.00006894432,0.000033255303,0.0003127315,0.00013405288,0.015629835,0.0008435975,0.9767849,0.0052582873,0.00001429908],"about_ca_topic_score_codex":0.00059681153,"about_ca_topic_score_gemma":0.00044876113,"teacher_disagreement_score":0.008908158,"about_ca_system_score_codex":0.0012705353,"about_ca_system_score_gemma":0.00028239354,"threshold_uncertainty_score":0.029800713},"labels":[],"label_agreement":null},{"id":"W1651438266","doi":"10.1007/11783596_25","title":"Quantum Predicative Programming","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Predicative expression; Computer science; Generality; Programming language; Theoretical computer science; Inductive programming; Probabilistic logic; Programming language theory; Programming paradigm; Artificial intelligence","score_opus":0.011072265208880029,"score_gpt":0.236761692314619,"score_spread":0.22568942710573897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651438266","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010037932,0.0018630939,0.11754277,0.0038830915,0.0006539865,0.000033866207,0.0001573207,0.0003159875,0.8655121],"genre_scores_gemma":[0.5246275,0.003343999,0.047474787,0.0014224809,0.0011357256,0.00018122056,0.00041524583,0.0005400411,0.42085892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.00008168037,0.000010713848,0.00004411266,0.000119418895,0.00002712358],"domain_scores_gemma":[0.9997861,0.0000858831,0.0000096383255,0.000053365864,0.00004942252,0.000015554453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003803101,0.00042750916,0.00045969422,0.0005599742,0.0013891323,0.0020279633,0.00066506787,0.00063486386,0.015908826],"category_scores_gemma":[0.0008665717,0.00029060215,0.000391764,0.00095529587,0.0030279888,0.0031808487,0.001040257,0.0023829432,0.0027910024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020095954,0.0000027423937,0.0000061522474,0.000009601607,0.0000010348299,0.0000031713091,0.00003526299,0.00010657878,0.0000731325,0.99367005,0.0023068401,0.0037834374],"study_design_scores_gemma":[0.000001926129,0.00000237618,0.000028423898,0.000007947075,0.0000020119523,0.000016294664,0.000016179827,0.0006274231,0.00018358894,0.97488314,0.024228144,0.0000026368546],"about_ca_topic_score_codex":0.0005254649,"about_ca_topic_score_gemma":0.0006671647,"teacher_disagreement_score":0.015908826,"about_ca_system_score_codex":0.0012805533,"about_ca_system_score_gemma":0.00054325885,"threshold_uncertainty_score":0.05322039},"labels":[],"label_agreement":null},{"id":"W1653679933","doi":"10.1007/978-3-642-01129-0_50","title":"Fractal Evolver: Interactive Evolutionary Design of Fractals with Grid Computing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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 Calgary","funders":"","keywords":"Fractal; Computer science; Grid; Theoretical computer science; Computer graphics (images); Artificial intelligence; Mathematics; Geometry","score_opus":0.013385776957813351,"score_gpt":0.24353608157132556,"score_spread":0.2301503046135122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1653679933","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.043569077,0.00035151656,0.9274739,0.0002827428,0.00018516468,0.0000735388,0.00013612675,0.0044025327,0.023525393],"genre_scores_gemma":[0.45168498,0.00040738977,0.5346422,0.00011665435,0.000042798787,0.00020338227,0.0002389343,0.0017387408,0.010924959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998716,0.00003675404,0.0000052704368,0.000015746267,0.000054853415,0.000015780482],"domain_scores_gemma":[0.99972934,0.00014035497,0.000012416339,0.000055902336,0.00003871917,0.000023247447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003712426,0.00032816196,0.00042474226,0.0003022971,0.00049855583,0.0010452913,0.0010516278,0.0006473905,0.0086297495],"category_scores_gemma":[0.0012011536,0.00029840053,0.0004848747,0.00035237495,0.00050365424,0.00078671396,0.0010635611,0.00074002205,0.000953783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023796072,0.00012188789,0.0017964924,0.00037061,0.00010942821,0.0006038145,0.000879306,0.5244574,0.044029523,0.20830181,0.01726172,0.20183003],"study_design_scores_gemma":[0.00007489623,0.000047102272,0.00024032917,0.000025645157,0.000019743435,0.00018321225,0.00006720926,0.9207143,0.008923497,0.037344534,0.03233695,0.000022560316],"about_ca_topic_score_codex":0.0007075985,"about_ca_topic_score_gemma":0.0007044563,"teacher_disagreement_score":0.0086297495,"about_ca_system_score_codex":0.00034097405,"about_ca_system_score_gemma":0.00027569357,"threshold_uncertainty_score":0.02886933},"labels":[],"label_agreement":null},{"id":"W1654262235","doi":"10.1007/3-540-45306-7_23","title":"A Framework for Optimizing Java Using Attributes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Java bytecode; Java annotation; Programming language; Compiler; Real time Java; strictfp; Generics in Java; Java concurrency; Java Modeling Language; Optimizing compiler; Operating system; Just-in-time compilation; Bytecode; Compiler correctness; Pointer (user interface); Class (philosophy); Artificial intelligence","score_opus":0.05791996299029453,"score_gpt":0.2906001351846367,"score_spread":0.23268017219434214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1654262235","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.003195741,0.0003283527,0.9575095,0.00018507573,0.000105765896,0.00007096947,0.0002594775,0.034720983,0.0036241235],"genre_scores_gemma":[0.06669068,0.00061441556,0.9075181,0.00032215874,0.00014040786,0.00032197632,0.001108819,0.015977291,0.0073062386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816114,0.00031772748,0.00021280517,0.00034175505,0.0007349109,0.0002317768],"domain_scores_gemma":[0.99796945,0.000838743,0.00013358482,0.00070179923,0.00025424463,0.00010219676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023146602,0.0014791433,0.0013061023,0.001193911,0.0010402753,0.0033096108,0.0038506673,0.0011210452,0.0075404756],"category_scores_gemma":[0.004802115,0.0018247996,0.00204424,0.0016565898,0.0013754613,0.0075436304,0.002957879,0.003289199,0.0032762322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006968065,0.0003934191,0.0029096764,0.0006887007,0.00019419489,0.00025560052,0.0006751137,0.029356131,0.015915163,0.27634993,0.05731698,0.61524826],"study_design_scores_gemma":[0.00043373846,0.00017933393,0.0012738553,0.0003276055,0.00031990287,0.00047717377,0.000177295,0.33747822,0.042821392,0.42413104,0.19212744,0.0002529689],"about_ca_topic_score_codex":0.0038299377,"about_ca_topic_score_gemma":0.0054524597,"teacher_disagreement_score":0.0075404756,"about_ca_system_score_codex":0.0010320815,"about_ca_system_score_gemma":0.001627601,"threshold_uncertainty_score":0.025225341},"labels":[],"label_agreement":null},{"id":"W165467593","doi":"10.1007/978-3-642-36694-9_17","title":"Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Matroid; Computer science; Graphic matroid; Polyhedron; Lift (data mining); Representation (politics); Time complexity; Matrix representation; Flow (mathematics); Algorithm; Matroid partitioning; Set (abstract data type); Relation (database); Combinatorics; Discrete mathematics; Mathematics; Geometry; Data mining","score_opus":0.030916162013431014,"score_gpt":0.2852821066402142,"score_spread":0.2543659446267832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165467593","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.085947014,0.0007790963,0.87954825,0.000687086,0.00034893324,0.0002447592,0.00046770734,0.0020374614,0.029939676],"genre_scores_gemma":[0.3047492,0.0008604268,0.66820204,0.00019553893,0.00024523624,0.0003523476,0.0012507006,0.0009930856,0.023151508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992781,0.00012573261,0.00003872104,0.00016674632,0.00020632449,0.00018441107],"domain_scores_gemma":[0.9980228,0.00092086283,0.00012438088,0.00054555415,0.00018248784,0.000203918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009292942,0.0015458813,0.0019120887,0.0019325598,0.0014343931,0.0030954357,0.0029121619,0.0013891615,0.015754957],"category_scores_gemma":[0.0044044703,0.0011616229,0.0023668872,0.0026535604,0.0014054466,0.004585076,0.00389424,0.004688318,0.0026608924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007017059,0.0004241325,0.000878225,0.0006765993,0.000113955204,0.00022119713,0.0004923226,0.15795727,0.0059956415,0.37754872,0.03088207,0.4241081],"study_design_scores_gemma":[0.0001257036,0.00009592877,0.00022731027,0.00006555857,0.00004523755,0.00013197027,0.000116923075,0.37903643,0.0019445596,0.611602,0.006580079,0.00002837199],"about_ca_topic_score_codex":0.0021153188,"about_ca_topic_score_gemma":0.0030818281,"teacher_disagreement_score":0.015754957,"about_ca_system_score_codex":0.0016415252,"about_ca_system_score_gemma":0.0014283778,"threshold_uncertainty_score":0.052705646},"labels":[],"label_agreement":null},{"id":"W1655324574","doi":"10.1007/978-3-319-30139-6_6","title":"Optimal Distributed Searching in the Plane with and Without Uncertainty","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Visibility; Search and rescue; Drone; Robot; Task (project management); Plane (geometry); Artificial intelligence; Search problem; Algorithm; Mathematics","score_opus":0.017686002502897518,"score_gpt":0.2565475571251601,"score_spread":0.23886155462226258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655324574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032008663,0.0020871395,0.9476651,0.0007754362,0.00009992436,0.000027403332,0.000105277366,0.000112438654,0.017118594],"genre_scores_gemma":[0.7851818,0.0019476282,0.19846277,0.00018982733,0.00021928086,0.00015889901,0.00020942492,0.00017201313,0.013458284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991716,0.00033905669,0.00003686749,0.00014775869,0.00021252366,0.000092167975],"domain_scores_gemma":[0.9978504,0.0016148072,0.00014080158,0.00015196054,0.00015264348,0.00008937433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640439,0.00081789115,0.0017466173,0.00072264223,0.00042123467,0.0017084741,0.0013886039,0.00194907,0.0033902798],"category_scores_gemma":[0.0071208016,0.0005791909,0.00065398164,0.0014357168,0.0016071849,0.0026443177,0.00206962,0.0014829914,0.0003492338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027434406,0.000038811606,0.00011994582,0.00012388745,0.000030236426,0.00003766359,0.00005250494,0.7992036,0.0010006467,0.16794334,0.0018513643,0.029323654],"study_design_scores_gemma":[0.00003658447,0.00003464961,0.000057608668,0.000015806769,0.0000057101533,0.000022406035,0.000014352477,0.8778973,0.00018619961,0.12104622,0.00067503593,0.000008114604],"about_ca_topic_score_codex":0.0012666115,"about_ca_topic_score_gemma":0.00066482957,"teacher_disagreement_score":0.0033902798,"about_ca_system_score_codex":0.0011345446,"about_ca_system_score_gemma":0.0008033629,"threshold_uncertainty_score":0.011341631},"labels":[],"label_agreement":null},{"id":"W1655733084","doi":"10.1007/11755494_15","title":"Investigating Social Software as Persuasive Technology","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cultural Differences and Values","field":"Psychology","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Persuasive technology; Software; Human–computer interaction; Software engineering; World Wide Web; Programming language; Persuasion; Psychology","score_opus":0.04817043213299175,"score_gpt":0.32686818323442707,"score_spread":0.2786977511014353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655733084","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.54739827,0.0068585556,0.01309376,0.003080313,0.00014726707,0.00006091167,0.000039729566,0.000050309263,0.42927083],"genre_scores_gemma":[0.9709075,0.0019179349,0.0037347502,0.00019274779,0.000031773965,0.000038935174,0.000029564158,0.000023683264,0.023122998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948514,0.00026573593,0.00001528869,0.00005116572,0.00013746248,0.000045241304],"domain_scores_gemma":[0.9943218,0.0049079102,0.00027292874,0.00015143357,0.00022448087,0.00012139308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039182,0.00025539185,0.00017823034,0.0008139403,0.0007046671,0.0040335446,0.00047804817,0.0011009952,0.0066218576],"category_scores_gemma":[0.0050318814,0.00017363451,0.00017888173,0.00090633036,0.0014488065,0.0033626708,0.0007359038,0.0010274481,0.0004715702],"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.0001371372,0.0005654367,0.019483127,0.000575852,0.000044975015,0.0006912366,0.06904359,0.0006758542,0.010423048,0.65023154,0.0054190713,0.2427091],"study_design_scores_gemma":[0.00007235247,0.00076840346,0.08549784,0.0012275354,0.00020051197,0.0020161858,0.121363245,0.009111665,0.02018329,0.58971006,0.16979222,0.000056625435],"about_ca_topic_score_codex":0.0008975258,"about_ca_topic_score_gemma":0.0015869546,"teacher_disagreement_score":0.0066218576,"about_ca_system_score_codex":0.0007158973,"about_ca_system_score_gemma":0.0006689943,"threshold_uncertainty_score":0.022152364},"labels":[],"label_agreement":null},{"id":"W165626823","doi":"10.1007/978-3-642-22763-9_6","title":"Evidence-Based Educational Practices and a Theoretical Framework for Hybrid Learning","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Ontario Tech University","funders":"","keywords":"Computer science; Modalities; Transtheoretical model; Hybrid learning; Hybrid system; Artificial intelligence; Knowledge management; Machine learning; Behavior change; Psychology","score_opus":0.11224223968251537,"score_gpt":0.4139824952405213,"score_spread":0.3017402555580059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165626823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023049723,0.021403393,0.56173027,0.11953737,0.0010968671,0.0013994137,0.00025273144,0.00032881388,0.27120143],"genre_scores_gemma":[0.5695701,0.0075231446,0.41001692,0.0041545583,0.00024009243,0.0018000357,0.00015863572,0.000058025846,0.006478513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9530744,0.031648155,0.0036041318,0.0024369666,0.008266893,0.00096946646],"domain_scores_gemma":[0.8822504,0.097463176,0.004512779,0.0071620257,0.0063332114,0.0022785107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0637012,0.001297694,0.0010838634,0.0065874,0.0026797839,0.01438857,0.0084917685,0.007991528,0.0068430356],"category_scores_gemma":[0.07116489,0.00091454794,0.0010386716,0.00399577,0.020925412,0.015515319,0.010851094,0.0062951497,0.0009370383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020726467,0.00016479328,0.0009545616,0.00087965006,0.00006231615,0.00017686334,0.0032444524,0.0013465796,0.00013359552,0.92543876,0.002274605,0.06530301],"study_design_scores_gemma":[0.000054116288,0.00008601919,0.0006492388,0.0028339715,0.000044203356,0.00022761938,0.0033368198,0.0018659227,0.0005081252,0.96677935,0.023585489,0.00002918734],"about_ca_topic_score_codex":0.0023278731,"about_ca_topic_score_gemma":0.0038360716,"teacher_disagreement_score":0.0637012,"about_ca_system_score_codex":0.009677461,"about_ca_system_score_gemma":0.012277421,"threshold_uncertainty_score":0.33688813},"labels":[],"label_agreement":null},{"id":"W1656270692","doi":"10.1007/978-3-642-36757-1_2","title":"Identification and Selection of Interaction Test Scenarios for Integration Testing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integration testing; Unit testing; Computer science; Interoperability; Test (biology); Context (archaeology); Test case; Test Management Approach; Identification (biology); Model-based testing; Reliability engineering; Data mining; Machine learning; Programming language; Engineering; Software; Software development; Software construction; Operating system","score_opus":0.030546618663785892,"score_gpt":0.2768479638866936,"score_spread":0.2463013452229077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656270692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30334836,0.00094299065,0.6762999,0.00041342503,0.00006947937,0.0009855295,0.0011456287,0.007055642,0.009739005],"genre_scores_gemma":[0.70156837,0.00019811235,0.29420263,0.000085685715,0.000025993475,0.00036142374,0.0023036895,0.00033937028,0.0009147082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516726,0.0019795687,0.00043244497,0.0006641059,0.0013549802,0.00040163216],"domain_scores_gemma":[0.9829488,0.011280734,0.0013177582,0.0015856983,0.0020825488,0.0007844619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002492403,0.0019710644,0.0010032271,0.0046968427,0.00047414756,0.0021269915,0.0016452327,0.0015395728,0.003968753],"category_scores_gemma":[0.020763446,0.0005426839,0.0013465586,0.0011902121,0.0005843594,0.0021238695,0.0015795842,0.0009303887,0.0010948875],"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.0033948172,0.0018728956,0.061259408,0.001034106,0.00030716375,0.0033276444,0.0008210284,0.08185403,0.11755724,0.018512301,0.008487282,0.7015721],"study_design_scores_gemma":[0.00033178562,0.0016902947,0.016437871,0.000501107,0.00044397503,0.00349446,0.00075441506,0.8562988,0.07936658,0.031304546,0.009227904,0.00014835782],"about_ca_topic_score_codex":0.0006306256,"about_ca_topic_score_gemma":0.00093526905,"teacher_disagreement_score":0.0046968427,"about_ca_system_score_codex":0.00052895787,"about_ca_system_score_gemma":0.0010060708,"threshold_uncertainty_score":0.013276756},"labels":[],"label_agreement":null},{"id":"W1657318125","doi":"10.1007/978-3-642-30353-1_26","title":"Improvements to AdaBoost Dynamic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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 Ottawa","funders":"","keywords":"Boosting (machine learning); Computer science; Overfitting; AdaBoost; Resampling; Artificial intelligence; Machine learning; Classifier (UML); Exponential function; Ensemble learning; Pattern recognition (psychology); Algorithm; Artificial neural network; Mathematics","score_opus":0.015532097009351742,"score_gpt":0.26489558991906426,"score_spread":0.24936349290971252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1657318125","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.010722065,0.0016705085,0.9612798,0.00048150122,0.0015691441,0.000112831185,0.00037968837,0.012415142,0.011369358],"genre_scores_gemma":[0.13048941,0.0008341196,0.82629377,0.0008948131,0.0006774544,0.0002673502,0.0018774405,0.0036210292,0.035044644],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806744,0.00023260395,0.00008550838,0.0005863774,0.00082729035,0.00020080611],"domain_scores_gemma":[0.9988544,0.00019374247,0.000047389698,0.00036472024,0.00046533658,0.00007438614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014440207,0.0016610404,0.0019477579,0.0014762874,0.001266594,0.0020040513,0.003477249,0.001324854,0.01732625],"category_scores_gemma":[0.0031775816,0.00086944987,0.0012871056,0.0017833961,0.0006791189,0.0030896007,0.0026345868,0.003800405,0.01098614],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028232893,0.00039767934,0.0004378146,0.00009030422,0.000095580945,0.000033234784,0.000038117098,0.027676528,0.006614773,0.0068976833,0.026452746,0.9309832],"study_design_scores_gemma":[0.000087501234,0.00012259388,0.0007387993,0.00004499382,0.00010125426,0.00021602453,0.000049468952,0.9100262,0.014184188,0.017181555,0.05720133,0.0000460084],"about_ca_topic_score_codex":0.0067870193,"about_ca_topic_score_gemma":0.008598378,"teacher_disagreement_score":0.01732625,"about_ca_system_score_codex":0.0009285078,"about_ca_system_score_gemma":0.001537344,"threshold_uncertainty_score":0.05796212},"labels":[],"label_agreement":null},{"id":"W1657711203","doi":"10.1007/978-3-319-21912-7_10","title":"Concern-Oriented Behaviour Modelling with Sequence Diagrams and Protocol Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Sequence diagram; Sequence (biology); Protocol (science); Theoretical computer science; Programming language; Unified Modeling Language","score_opus":0.12433280390001564,"score_gpt":0.3249286991305254,"score_spread":0.20059589523050977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1657711203","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.0017483543,0.00026543357,0.9918133,0.00015962103,0.000031294974,0.00008190566,0.00009382832,0.00053706695,0.0052692383],"genre_scores_gemma":[0.13223667,0.0021345294,0.8471707,0.00017858854,0.00009241931,0.00058659044,0.00078506116,0.0005533059,0.016262142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975889,0.0009471747,0.00022447822,0.00031291426,0.0007955636,0.00013094909],"domain_scores_gemma":[0.9976172,0.0013611298,0.00020431817,0.00044325026,0.00030711186,0.00006705237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025200956,0.0016704593,0.0008216172,0.0015222498,0.0007637318,0.0034654369,0.0022508898,0.0019453659,0.0049003805],"category_scores_gemma":[0.0061316495,0.001335402,0.0022935485,0.0017912373,0.0017417761,0.0049891723,0.0017563383,0.002920642,0.0019134113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006106596,0.00008488039,0.0004337235,0.00048145975,0.000065003886,0.0002682688,0.0009784709,0.10327619,0.0047779228,0.82873213,0.0027829208,0.058058053],"study_design_scores_gemma":[0.000036177473,0.000050841718,0.00015566172,0.00021094328,0.0001069681,0.00027092872,0.00012273093,0.3647284,0.0065262266,0.5764816,0.051262558,0.000046986206],"about_ca_topic_score_codex":0.0032043317,"about_ca_topic_score_gemma":0.0027722705,"teacher_disagreement_score":0.0049003805,"about_ca_system_score_codex":0.0012396903,"about_ca_system_score_gemma":0.0016699122,"threshold_uncertainty_score":0.016393363},"labels":[],"label_agreement":null},{"id":"W1658018311","doi":"10.1007/3-540-46422-0_16","title":"Examining Community in the Digital Neighborhood: Early Results from Canada’s Wired Suburb","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","cited_by":184,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"The Internet; Computer science; Internet access; Interpersonal communication; Internet privacy; Sociology; World Wide Web; Social science","score_opus":0.043046017695783236,"score_gpt":0.26411557695875143,"score_spread":0.2210695592629682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658018311","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.9829761,0.00054996816,0.00025501123,0.0010479968,0.00002558681,0.0001557659,0.0012035631,0.000014428189,0.013771632],"genre_scores_gemma":[0.9864364,0.0007048502,0.00067241816,0.00034249725,0.000010729923,0.00010165715,0.0009604583,0.00001714313,0.0107537825],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9987735,0.00019190102,0.000024416122,0.00012064154,0.0003518899,0.00053768366],"domain_scores_gemma":[0.99426585,0.00055200985,0.0002743434,0.00021372324,0.002932456,0.0017615462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014503725,0.0003357113,0.00049471407,0.002368865,0.012501656,0.003633781,0.0020202084,0.0007061068,0.0030917563],"category_scores_gemma":[0.0044689886,0.00032976453,0.00036658556,0.0076015443,0.0029144457,0.0012086441,0.0036135176,0.0014068587,0.000458065],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037896758,0.001191352,0.7826871,0.00020288446,0.00008661126,0.0005755669,0.114227,0.0007254791,0.0006028721,0.0041721854,0.017377654,0.07777234],"study_design_scores_gemma":[0.000020811816,0.000089007815,0.7203126,0.00014145678,0.000059633137,0.000040773524,0.2616486,0.00041541268,0.0003215444,0.0005539076,0.016367462,0.000028824381],"about_ca_topic_score_codex":0.9965389,"about_ca_topic_score_gemma":0.999223,"teacher_disagreement_score":0.041206624,"about_ca_system_score_codex":0.041206624,"about_ca_system_score_gemma":0.058457464,"threshold_uncertainty_score":0.29897642},"labels":[],"label_agreement":null},{"id":"W165942106","doi":"10.1007/978-3-540-27780-4_28","title":"Utilizing Artificial Learners to Help Overcome the Cold-Start Problem in a Pedagogically-Oriented Paper Recommendation System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Cold start (automotive); Artificial intelligence; Recommender system; Multimedia; Machine learning; Engineering","score_opus":0.038914880399328215,"score_gpt":0.27049653939507096,"score_spread":0.23158165899574273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165942106","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.40315735,0.0007706837,0.5680139,0.0008354093,0.00038149976,0.00091671204,0.00020355792,0.017786616,0.00793425],"genre_scores_gemma":[0.51337445,0.00041662058,0.46655583,0.0006854829,0.00016419786,0.00049377274,0.00054033665,0.0005956703,0.017173689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986412,0.0006017839,0.00015132576,0.00026220313,0.00027974715,0.000063709944],"domain_scores_gemma":[0.9903218,0.006577007,0.00042035096,0.0007884753,0.001545294,0.00034700887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028735662,0.0009946456,0.0010690225,0.00063803926,0.00056616374,0.0021586798,0.0021267242,0.0025873552,0.00316793],"category_scores_gemma":[0.013500302,0.000535489,0.00042650822,0.0006382716,0.00038667815,0.0025455821,0.0010112831,0.0017826002,0.002233972],"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.0022183827,0.0038973077,0.0098699955,0.00063882285,0.00030406596,0.00074094464,0.002481093,0.018526275,0.09426885,0.0022689498,0.010502378,0.854283],"study_design_scores_gemma":[0.0007991179,0.0035600571,0.004761512,0.000110517736,0.0007137801,0.001362815,0.000630025,0.7630538,0.19100936,0.0053046974,0.028417148,0.00027726902],"about_ca_topic_score_codex":0.0017147085,"about_ca_topic_score_gemma":0.0036143507,"teacher_disagreement_score":0.00316793,"about_ca_system_score_codex":0.00032821356,"about_ca_system_score_gemma":0.0006875955,"threshold_uncertainty_score":0.015197098},"labels":[],"label_agreement":null},{"id":"W16598393","doi":"10.1007/978-3-642-24958-7_32","title":"A Variational Statistical Framework for Object Detection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Concordia University","funders":"","keywords":"Computer science; Object (grammar); Artificial intelligence; Dirichlet distribution; Object detection; Variational method; Computer vision; Algorithm; Pattern recognition (psychology); Mathematics","score_opus":0.02755002989151602,"score_gpt":0.2839064299132923,"score_spread":0.2563564000217763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16598393","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.00024718672,0.0002892426,0.9987526,0.00005929201,0.000018949419,0.000007986084,0.00002722091,0.000090903195,0.00050650886],"genre_scores_gemma":[0.04095468,0.0013501119,0.94904375,0.00016711793,0.00021518166,0.00014175868,0.0003698518,0.0004057244,0.007351861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845624,0.00052988954,0.00007396524,0.00029466394,0.00054479134,0.0001004816],"domain_scores_gemma":[0.99843115,0.0010164051,0.00007683937,0.00017569627,0.00023794478,0.0000618614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023918834,0.0011423761,0.0020560308,0.0015037905,0.0007301028,0.002183561,0.004582115,0.002315005,0.0042139306],"category_scores_gemma":[0.005027159,0.0017486464,0.0022938694,0.0022655667,0.0018168541,0.0026461163,0.0026110427,0.0028113562,0.0016753953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000527791,0.00004513532,0.0002942954,0.00020093677,0.00013378332,0.000105815874,0.00013988852,0.2159827,0.0044603436,0.599666,0.0063653616,0.17255294],"study_design_scores_gemma":[0.000008004122,0.000011884076,0.000115636736,0.000016706015,0.000020957556,0.00008809436,0.000008422147,0.74866617,0.00069624773,0.24366632,0.0066787973,0.000022784385],"about_ca_topic_score_codex":0.0073606884,"about_ca_topic_score_gemma":0.006883171,"teacher_disagreement_score":0.0073606884,"about_ca_system_score_codex":0.001378144,"about_ca_system_score_gemma":0.0014295174,"threshold_uncertainty_score":0.014635682},"labels":[],"label_agreement":null},{"id":"W166169177","doi":"10.1007/978-3-642-40811-3_94","title":"Hierarchical Probabilistic Gabor and MRF Segmentation of Brain Tumours in MRI Volumes","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill Genome Centre; McGill University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Voxel; Pattern recognition (psychology); Multispectral image; Probabilistic logic; Markov random field; Image segmentation; Computer vision","score_opus":0.01634475156889065,"score_gpt":0.2600621501127656,"score_spread":0.24371739854387497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166169177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11077324,0.0013788447,0.88234925,0.0004486989,0.00006946513,0.00011722258,0.0006339967,0.0018304227,0.0023989105],"genre_scores_gemma":[0.6112008,0.0012060832,0.3820946,0.0001772715,0.00019844495,0.00011380855,0.0012290117,0.0005644123,0.0032155702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996356,0.000069900765,0.000021558184,0.0000692303,0.0000953244,0.0001084102],"domain_scores_gemma":[0.99942243,0.00024362361,0.00007378539,0.000086722896,0.00012973521,0.00004370418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085650483,0.0004812759,0.0007008754,0.0028630553,0.00035159962,0.0016803601,0.00058180763,0.0013598042,0.0016172834],"category_scores_gemma":[0.0018668977,0.0004735917,0.0010408226,0.0012921478,0.00054236816,0.0007713965,0.00060125545,0.0005947644,0.0012039744],"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.0010312032,0.00022146055,0.007185241,0.0004727534,0.0001031453,0.0006178651,0.0003398114,0.104399525,0.24127296,0.011383451,0.0060154283,0.62695724],"study_design_scores_gemma":[0.00003249313,0.00013190917,0.018363072,0.00008772325,0.00009843999,0.0013361466,0.00016451937,0.9101287,0.053267695,0.012391483,0.003938131,0.00005956531],"about_ca_topic_score_codex":0.0039224285,"about_ca_topic_score_gemma":0.00428508,"teacher_disagreement_score":0.0039224285,"about_ca_system_score_codex":0.00044951317,"about_ca_system_score_gemma":0.0008745514,"threshold_uncertainty_score":0.007799208},"labels":[],"label_agreement":null},{"id":"W166253295","doi":"10.1007/978-3-319-08171-7_18","title":"NovoGMET: De Novo Peptide Sequencing Using Graphs with Multiple Edge Types (GMET) for ETD/ECD Spectra","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mass Spectrometry Techniques and Applications","field":"Chemistry","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 Saskatchewan","funders":"","keywords":"Computer science; Tandem mass spectrometry; Peptide; Graph; Enhanced Data Rates for GSM Evolution; Fragment (logic); Computational biology; Mass spectrometry; Artificial intelligence; Algorithm; Chemistry; Biology; Chromatography; Theoretical computer science; Biochemistry","score_opus":0.022414178938832543,"score_gpt":0.2592186889810239,"score_spread":0.23680451004219136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166253295","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.0051854867,0.0011612674,0.86984843,0.00029282388,0.0006530538,0.00016785579,0.012929567,0.10381491,0.0059465426],"genre_scores_gemma":[0.015628653,0.0009921426,0.94130045,0.00029888737,0.000085573076,0.0002541031,0.017548734,0.017497255,0.006394347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940646,0.00008800849,0.000052462885,0.0002115178,0.00020591811,0.000035683628],"domain_scores_gemma":[0.99924767,0.00039560447,0.00005982893,0.00016700367,0.00008769084,0.000042324722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701744,0.0020838047,0.0011704012,0.002000603,0.0005836619,0.00220307,0.002185016,0.00130039,0.03274445],"category_scores_gemma":[0.0021807526,0.001454137,0.0017218115,0.0020906318,0.00047441566,0.0023358604,0.0015568028,0.002595696,0.013683195],"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.000832846,0.00020360884,0.0007912971,0.0020706654,0.00046987904,0.0007445848,0.00022280143,0.017689046,0.11824968,0.02543753,0.21866202,0.614626],"study_design_scores_gemma":[0.00028454515,0.00019961131,0.0013982767,0.00031588326,0.00017532191,0.002016149,0.000107621054,0.27277768,0.21699567,0.09257003,0.412779,0.0003802627],"about_ca_topic_score_codex":0.0005673549,"about_ca_topic_score_gemma":0.0010322148,"teacher_disagreement_score":0.03274445,"about_ca_system_score_codex":0.00040621494,"about_ca_system_score_gemma":0.0004420958,"threshold_uncertainty_score":0.10954106},"labels":[],"label_agreement":null},{"id":"W1662615465","doi":"10.1007/978-3-642-22630-4_2","title":"A Reference Model for Semantic Peer-to-Peer Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Computer science; Ambiguity; Domain (mathematical analysis); Ontology; Abstraction; Peer-to-peer; Data science; Distributed computing","score_opus":0.045616282751240474,"score_gpt":0.2670011820732449,"score_spread":0.22138489932200445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662615465","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.0014786354,0.00055119523,0.9867771,0.0005676202,0.00032106656,0.00014468636,0.0004434692,0.0016679246,0.008048326],"genre_scores_gemma":[0.10609602,0.002636726,0.8592115,0.00064092054,0.0005308024,0.00096121035,0.003907952,0.0014559343,0.024559017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439716,0.0013516055,0.0007804631,0.00092008925,0.0021988323,0.00035190576],"domain_scores_gemma":[0.99426347,0.0013893107,0.0002700096,0.0020051196,0.0018212392,0.00025077147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054883067,0.0012491381,0.0022408275,0.002836515,0.0026948215,0.007996202,0.007168196,0.004869136,0.009705598],"category_scores_gemma":[0.015902197,0.0010186859,0.0016629535,0.005582024,0.0023264394,0.016463488,0.0048406683,0.0033769752,0.0070613604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010225735,0.00005088742,0.00014423457,0.00027494028,0.00002718171,0.00021115676,0.0004278188,0.026638925,0.0011576226,0.8910264,0.013384909,0.06655364],"study_design_scores_gemma":[0.000053076885,0.000065098924,0.00006758187,0.00019160297,0.00008254892,0.00029334004,0.0001720948,0.1960959,0.0026993693,0.6597657,0.1404392,0.00007432942],"about_ca_topic_score_codex":0.0064270888,"about_ca_topic_score_gemma":0.0064113163,"teacher_disagreement_score":0.009705598,"about_ca_system_score_codex":0.0024623205,"about_ca_system_score_gemma":0.0029655683,"threshold_uncertainty_score":0.032468498},"labels":[],"label_agreement":null},{"id":"W166282841","doi":"10.1007/978-3-642-41218-9_42","title":"An Unsupervised Deep-Learning Architecture That Can Reconstruct Paired Images","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Acadia University","funders":"","keywords":"MNIST database; Computer science; Artificial intelligence; Associative property; Unsupervised learning; Pattern recognition (psychology); Restricted Boltzmann machine; Image (mathematics); Set (abstract data type); Deep learning; Digit recognition; Content-addressable memory; Channel (broadcasting); Matching (statistics); Layer (electronics); Artificial neural network; Mathematics","score_opus":0.014536088730198682,"score_gpt":0.21383681591845377,"score_spread":0.1993007271882551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166282841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006958483,0.00016147764,0.98877406,0.00012014462,0.00006850754,0.00002319452,0.00007044983,0.000730974,0.003092703],"genre_scores_gemma":[0.26009536,0.00043435,0.72164035,0.00033548044,0.0000766371,0.000094062736,0.0005978521,0.0003080108,0.01641777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986863,0.000023115443,0.0000054830216,0.00004177224,0.000044089575,0.000016892101],"domain_scores_gemma":[0.9998074,0.000068040754,0.000014586764,0.000059786336,0.000033422948,0.000016902959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003489542,0.0006606879,0.00045645796,0.00029011382,0.00020948243,0.0004762314,0.0010021366,0.0011872489,0.0036983169],"category_scores_gemma":[0.0008931324,0.0004816293,0.000589733,0.00040728977,0.0004908995,0.00086322316,0.0015035636,0.0016959204,0.0013508507],"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.0001874739,0.00014364462,0.0005535311,0.00015762063,0.00013461168,0.00023662134,0.00006405739,0.36714727,0.0767822,0.051890604,0.009682877,0.49301952],"study_design_scores_gemma":[0.0000062273166,0.000022612092,0.0000784559,0.00000789276,0.000011090863,0.00008925474,0.0000036765493,0.9792402,0.00894277,0.009540684,0.0020504014,0.00000682314],"about_ca_topic_score_codex":0.0009740105,"about_ca_topic_score_gemma":0.002211906,"teacher_disagreement_score":0.0036983169,"about_ca_system_score_codex":0.0003154411,"about_ca_system_score_gemma":0.000484942,"threshold_uncertainty_score":0.012372136},"labels":[],"label_agreement":null},{"id":"W1662946252","doi":"10.1007/3-540-44460-2_19","title":"A Multi-agent System for Resource Management in Wireless Mobile Multimedia Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mobile agent; Distributed computing; Computer network; Wireless network; Process (computing); Bandwidth (computing); Wireless; Mobile computing; Resource (disambiguation); Multimedia; Cellular network; Telecommunications; Operating system","score_opus":0.024723902141810562,"score_gpt":0.277091103797479,"score_spread":0.2523672016556684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662946252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013681467,0.0011085127,0.9743157,0.00037675953,0.0003684015,0.00024170672,0.00006269966,0.0035648616,0.006279925],"genre_scores_gemma":[0.3143585,0.00091089145,0.66954625,0.00031617362,0.0002844121,0.00071086164,0.00021809626,0.00025236543,0.013402492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00020011661,0.000048675618,0.00006887918,0.00014896841,0.00003866455],"domain_scores_gemma":[0.999385,0.000253603,0.000048429145,0.00008183521,0.00013285053,0.00009816105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709908,0.0005974413,0.0009484672,0.0004265369,0.0011304143,0.0016724947,0.0018374824,0.0016123296,0.0035864385],"category_scores_gemma":[0.001726164,0.00033014582,0.00038334713,0.000491193,0.0005348726,0.0013416115,0.0014468643,0.001266623,0.0009861684],"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.0008983125,0.000705181,0.0014156968,0.00055648136,0.00027146406,0.0012315687,0.0006964879,0.29313895,0.055037603,0.09781525,0.030842498,0.51739055],"study_design_scores_gemma":[0.00011462751,0.0001416952,0.00021638145,0.00002351034,0.000068227,0.00019612,0.000040877934,0.95960855,0.005387612,0.011613389,0.022555005,0.000034061763],"about_ca_topic_score_codex":0.0013263747,"about_ca_topic_score_gemma":0.0018420236,"teacher_disagreement_score":0.0035864385,"about_ca_system_score_codex":0.00041887775,"about_ca_system_score_gemma":0.0007337249,"threshold_uncertainty_score":0.011997819},"labels":[],"label_agreement":null},{"id":"W166300487","doi":"10.1007/978-3-319-07467-2_3","title":"Variable Ordering and Constraint Propagation for Constrained CP-Nets","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Constraint (computer-aided design); Variable (mathematics); Computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.012071528043486303,"score_gpt":0.22551783802134315,"score_spread":0.21344630997785685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166300487","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.0023607556,0.00091268605,0.9752734,0.0003281026,0.0001737313,0.000100506164,0.00030778974,0.0003676019,0.020175476],"genre_scores_gemma":[0.0679858,0.002501541,0.9023125,0.00023727576,0.00020484805,0.0003257844,0.0013297853,0.0004595506,0.024642942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986518,0.0003759004,0.000106618216,0.00024950854,0.00048762452,0.00012855338],"domain_scores_gemma":[0.9982311,0.0011309653,0.000093915354,0.00022445571,0.00026030687,0.000059381386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017238994,0.0013629235,0.0008525045,0.001387612,0.0010607783,0.0027739187,0.0026120252,0.0010689894,0.010851759],"category_scores_gemma":[0.0057370095,0.0012166672,0.0015092281,0.003930263,0.0018793815,0.0047813174,0.0024210026,0.0045478535,0.0019756593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009047612,0.00006817093,0.00019476473,0.00051431626,0.000052038973,0.0001479461,0.00015975017,0.0956003,0.0017665768,0.6742429,0.010864213,0.21629852],"study_design_scores_gemma":[0.000023012843,0.000017494796,0.00009341808,0.00014565149,0.000037843613,0.00009621579,0.00004580344,0.1891241,0.002374421,0.7731342,0.034877416,0.000030450567],"about_ca_topic_score_codex":0.0076670754,"about_ca_topic_score_gemma":0.011969621,"teacher_disagreement_score":0.010851759,"about_ca_system_score_codex":0.0017973619,"about_ca_system_score_gemma":0.0023252754,"threshold_uncertainty_score":0.036302805},"labels":[],"label_agreement":null},{"id":"W166424105","doi":"10.1007/978-3-642-31340-0_16","title":"Optimization over Random and Gradient Probabilistic Pixel Sampling for Fast, Robust Multi-resolution Image Registration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Pixel; Leverage (statistics); Artificial intelligence; Probabilistic logic; Sampling (signal processing); Computer vision; Particle swarm optimization; Image registration; Image (mathematics); Algorithm","score_opus":0.028068537090767034,"score_gpt":0.23495785022167961,"score_spread":0.20688931313091258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166424105","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.0010203068,0.00008349676,0.9985511,0.000021817585,0.000007953004,0.000010330143,0.00000898072,0.0001811328,0.000114917704],"genre_scores_gemma":[0.057086997,0.00021829517,0.9408587,0.000056890767,0.000036262674,0.000113128386,0.000127195,0.00033329762,0.0011692252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874383,0.00045758206,0.000075353186,0.00022862645,0.00042721926,0.000067403686],"domain_scores_gemma":[0.9983058,0.0010408859,0.00013683284,0.00026088356,0.00020673638,0.00004879721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026266538,0.00093309995,0.0018863973,0.0008707283,0.00037629282,0.00102874,0.0019535609,0.0016412095,0.0026725205],"category_scores_gemma":[0.0066072,0.001234742,0.0012456361,0.0016474483,0.0011814479,0.0020226124,0.002223957,0.0017890639,0.0010079425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027568117,0.00009333907,0.0003757344,0.00024824915,0.00012305677,0.000059520677,0.00010381788,0.63559884,0.012256956,0.045092873,0.0030706676,0.3027013],"study_design_scores_gemma":[0.000006647698,0.000010775708,0.000043963395,0.0000033443944,0.0000039437577,0.000016539818,0.0000022612778,0.9943,0.0011660556,0.0040141614,0.0004268607,0.000005432268],"about_ca_topic_score_codex":0.0030493669,"about_ca_topic_score_gemma":0.0038519714,"teacher_disagreement_score":0.0030493669,"about_ca_system_score_codex":0.000892258,"about_ca_system_score_gemma":0.0009652868,"threshold_uncertainty_score":0.01389128},"labels":[],"label_agreement":null},{"id":"W1664349852","doi":"10.1007/978-3-540-25929-9_8","title":"Rough Approximations under Level Fuzzy Sets","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Fuzzy set; Fuzzy logic; Computer science; Set (abstract data type); Dominance-based rough set approach; Fuzzy set operations; Fuzzy number; Approximations of π; Mathematics; Algorithm; Data mining; Artificial intelligence; Applied mathematics","score_opus":0.04588211680068622,"score_gpt":0.26300223025537833,"score_spread":0.21712011345469212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664349852","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.01784626,0.0044910805,0.9429088,0.00086798484,0.00045694486,0.000038524784,0.00013647546,0.00025380525,0.03300013],"genre_scores_gemma":[0.45174244,0.007763338,0.5118917,0.00033714922,0.0011751297,0.00017939226,0.00039890347,0.00019163406,0.026320282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855703,0.0004101547,0.000095653246,0.00012466578,0.0007435361,0.00006888035],"domain_scores_gemma":[0.9983584,0.00086855545,0.0001499265,0.00027561112,0.00026948992,0.00007803516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014986164,0.00056765974,0.0010077471,0.0016388055,0.00047612135,0.0025329527,0.00072599127,0.0006009358,0.0032122796],"category_scores_gemma":[0.005024801,0.0006116256,0.0009999007,0.0018568283,0.0015195603,0.0036784112,0.0012957352,0.0023752227,0.000993954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002680861,0.000010434242,0.000082135164,0.00009714441,0.000023358232,0.000035745546,0.00013721394,0.009175913,0.0010198182,0.9530002,0.0020207756,0.034370396],"study_design_scores_gemma":[0.000009117262,0.000032648426,0.00015316442,0.00003083807,0.00002471616,0.00007362652,0.000041054944,0.05158399,0.00082843425,0.93642914,0.010779229,0.000014106891],"about_ca_topic_score_codex":0.0005651938,"about_ca_topic_score_gemma":0.0003858206,"teacher_disagreement_score":0.0032122796,"about_ca_system_score_codex":0.001100191,"about_ca_system_score_gemma":0.00032496182,"threshold_uncertainty_score":0.010746121},"labels":[],"label_agreement":null},{"id":"W1664623720","doi":"10.1007/978-3-540-24681-7_16","title":"Extending the Rocchio Relevance Feedback Algorithm to Provide Contextual Retrieval","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"Dalhousie University","funders":"","keywords":"Computer science; Relevance feedback; Relevance (law); Information retrieval; Process (computing); Data mining; Artificial intelligence; Image retrieval","score_opus":0.01963604265658452,"score_gpt":0.26428406359480267,"score_spread":0.24464802093821814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664623720","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.0074498183,0.003369051,0.9756621,0.00044278012,0.00047048705,0.00027287542,0.00026670707,0.006169926,0.005896229],"genre_scores_gemma":[0.12861864,0.0015843047,0.8551238,0.0006411196,0.00091351033,0.00035026044,0.0008876785,0.00080697815,0.011073766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740905,0.0008118003,0.0001638088,0.00046922007,0.0009678745,0.0001782491],"domain_scores_gemma":[0.9966217,0.0013687651,0.00010848496,0.0007612214,0.0010450059,0.000094812676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003112208,0.0014017599,0.0025374214,0.004135425,0.0012065978,0.002051051,0.0018710982,0.002283745,0.010040305],"category_scores_gemma":[0.014417974,0.00055841927,0.0013589541,0.0029866232,0.0007417603,0.0029319895,0.0020562361,0.0013740243,0.0071351775],"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.00049807184,0.00020100272,0.0005759816,0.00045989626,0.00013066146,0.0001498837,0.00016982491,0.01439186,0.018052172,0.009784364,0.026400559,0.92918587],"study_design_scores_gemma":[0.00043368476,0.0005253668,0.0013129899,0.00019533085,0.0004026575,0.0012044371,0.00010030731,0.844492,0.03290011,0.038588714,0.07961946,0.00022484481],"about_ca_topic_score_codex":0.0064748754,"about_ca_topic_score_gemma":0.009465859,"teacher_disagreement_score":0.010040305,"about_ca_system_score_codex":0.00069556315,"about_ca_system_score_gemma":0.001808382,"threshold_uncertainty_score":0.03358817},"labels":[],"label_agreement":null},{"id":"W1664757612","doi":"10.1007/978-3-540-74469-6_84","title":"A Context-Based Approach for the Discovery of Complex Matches Between Database Sources","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université de Montréal","funders":"","keywords":"Computer science; Matching (statistics); Focus (optics); Context (archaeology); Task (project management); Automation; Information retrieval; Data mining; Theoretical computer science; Database","score_opus":0.08545391057205544,"score_gpt":0.29104553640375913,"score_spread":0.2055916258317037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664757612","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.01144707,0.001968418,0.9788609,0.00037917303,0.00009834635,0.00039799974,0.0008414782,0.0027031426,0.0033035844],"genre_scores_gemma":[0.06335042,0.00075418025,0.93268085,0.00015647222,0.00006607341,0.00019564253,0.0010829695,0.0001479354,0.0015655074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925136,0.0014352448,0.00081921223,0.0014682162,0.0034301754,0.00033356046],"domain_scores_gemma":[0.9912788,0.004721971,0.0005486021,0.0015812129,0.0015662751,0.0003032228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043275533,0.0012624322,0.002136393,0.012063658,0.0032926274,0.0065892884,0.004181972,0.0031318837,0.004331276],"category_scores_gemma":[0.020915216,0.0013668967,0.002252112,0.012200137,0.0014523317,0.009106599,0.006249181,0.002516117,0.0020261854],"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.0007816738,0.00060189393,0.009351678,0.0011451732,0.00070450857,0.0019578866,0.0026635155,0.014950606,0.022434888,0.14172347,0.016139463,0.7875452],"study_design_scores_gemma":[0.0001537775,0.00025741663,0.0036444128,0.0006745264,0.000992579,0.0039498038,0.0022652869,0.56967837,0.039221898,0.29744098,0.0813409,0.00038001718],"about_ca_topic_score_codex":0.0103921,"about_ca_topic_score_gemma":0.020406676,"teacher_disagreement_score":0.012063658,"about_ca_system_score_codex":0.0011495228,"about_ca_system_score_gemma":0.0028821127,"threshold_uncertainty_score":0.022886574},"labels":[],"label_agreement":null},{"id":"W166533694","doi":"10.1007/978-3-642-40273-9_3","title":"Quake Heaps: A Simple Alternative to Fibonacci Heaps","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quake (natural phenomenon); Fibonacci number; Simple (philosophy); Computer science; Geology; Mathematics; Combinatorics; Philosophy; Seismology; Epistemology","score_opus":0.020677838031343376,"score_gpt":0.26769432225350365,"score_spread":0.24701648422216027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166533694","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.0071918727,0.0014790444,0.93821234,0.0005877269,0.001396712,0.00016963296,0.00066779274,0.0122417705,0.038053118],"genre_scores_gemma":[0.108099945,0.0012489303,0.834584,0.00079835206,0.0005831863,0.00044564804,0.0011996622,0.006882908,0.04615742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829,0.0002448829,0.00016291528,0.00021256854,0.0008920753,0.00019757188],"domain_scores_gemma":[0.9973086,0.00074609125,0.00010382063,0.0012822533,0.0004517248,0.000107486485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015724001,0.0009183664,0.0015365346,0.0021182983,0.0021460066,0.004347281,0.003936729,0.0017031489,0.033425387],"category_scores_gemma":[0.0077907955,0.0011380623,0.0014268454,0.003921225,0.0019815622,0.009175182,0.005726436,0.0022781563,0.009336059],"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.0003853531,0.000057323035,0.00026267837,0.00041979348,0.00004123393,0.00012084482,0.00033451238,0.0028922767,0.0046587302,0.6604289,0.032078404,0.29832003],"study_design_scores_gemma":[0.00014645483,0.00008924465,0.00017310692,0.00015823556,0.00008080286,0.00035327923,0.000115624156,0.027146107,0.011808684,0.6733721,0.286461,0.000095388525],"about_ca_topic_score_codex":0.0011913582,"about_ca_topic_score_gemma":0.0020161537,"teacher_disagreement_score":0.033425387,"about_ca_system_score_codex":0.0008829331,"about_ca_system_score_gemma":0.0013336901,"threshold_uncertainty_score":0.11181909},"labels":[],"label_agreement":null},{"id":"W166664326","doi":"10.1007/978-3-642-38577-3_26","title":"A New GA-Based Method for Temporal Constraint Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint (computer-aided design); Computer science; Mathematical optimization; Mathematics; Geometry","score_opus":0.022641275583590956,"score_gpt":0.26634208472498494,"score_spread":0.24370080914139397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166664326","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.002876596,0.0002045712,0.9912553,0.0000667017,0.00016593434,0.000074583055,0.000051808416,0.00056641374,0.0047382135],"genre_scores_gemma":[0.03564023,0.00020917488,0.95568365,0.00013306494,0.000058978883,0.00030410045,0.00016998794,0.00026292715,0.007537948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.00011210401,0.00002446363,0.000098239856,0.0001918923,0.000054514596],"domain_scores_gemma":[0.99951196,0.00025489618,0.000024445877,0.000052177566,0.00012749141,0.00002907752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088699,0.0011480444,0.0011895944,0.001173769,0.0006933573,0.0009730138,0.002181919,0.0015105596,0.0074605374],"category_scores_gemma":[0.0015734116,0.0006574838,0.0013985616,0.0013311489,0.0006425572,0.0008031348,0.0013092059,0.0017263949,0.0012224719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115419774,0.00020963301,0.0005219505,0.0002753761,0.00016624173,0.00025072263,0.00012875075,0.50719154,0.017344696,0.033917602,0.008772351,0.4311058],"study_design_scores_gemma":[0.000030324487,0.00003401974,0.000110529225,0.000019288602,0.000029918792,0.000070600414,0.000012036645,0.98809516,0.0012802755,0.004918134,0.0053848205,0.00001480414],"about_ca_topic_score_codex":0.00683068,"about_ca_topic_score_gemma":0.010029276,"teacher_disagreement_score":0.0074605374,"about_ca_system_score_codex":0.00066820387,"about_ca_system_score_gemma":0.0013385135,"threshold_uncertainty_score":0.024957955},"labels":[],"label_agreement":null},{"id":"W1666736933","doi":"10.1007/978-3-642-01932-6_43","title":"A Software Platform for Real-Time Visualization and Manipulation of 4D Cardiac Images","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Robarts Clinical Trials","funders":"","keywords":"Computer science; Visualization; Computer graphics (images); Software; Software visualization; Real-time computing; Human–computer interaction; Artificial intelligence; Software system; Operating system; Component-based software engineering","score_opus":0.018952641815998598,"score_gpt":0.2850711672864392,"score_spread":0.2661185254704406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1666736933","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.0076264217,0.00036201792,0.8464063,0.00012401656,0.00021622665,0.00045708808,0.0018355547,0.13790181,0.005070609],"genre_scores_gemma":[0.09375925,0.0012496811,0.812489,0.000573325,0.00026304185,0.0021011233,0.009521536,0.041763026,0.038280003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946886,0.00004225717,0.000046034762,0.00009076153,0.00029313777,0.000059021142],"domain_scores_gemma":[0.99902713,0.00041449664,0.00006588565,0.00016990957,0.00020002932,0.00012257342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009572747,0.0015483467,0.0010218399,0.0017943811,0.0004889801,0.0014447683,0.0028720652,0.0011596871,0.040981125],"category_scores_gemma":[0.0018709672,0.0015556507,0.0010348739,0.00081697275,0.00043414874,0.0012698916,0.002365425,0.0014757436,0.01278734],"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.0015306318,0.00033023063,0.001645232,0.0010074923,0.00033645105,0.0012657729,0.00069522805,0.009548174,0.2687199,0.010445441,0.14642085,0.55805457],"study_design_scores_gemma":[0.0011633046,0.00056366745,0.0074995426,0.00043160032,0.0004204646,0.0044461847,0.00013385467,0.32324898,0.3715005,0.014871873,0.27510896,0.00061110704],"about_ca_topic_score_codex":0.0012109142,"about_ca_topic_score_gemma":0.0017504044,"teacher_disagreement_score":0.040981125,"about_ca_system_score_codex":0.00032031018,"about_ca_system_score_gemma":0.00074991334,"threshold_uncertainty_score":0.13709551},"labels":[],"label_agreement":null},{"id":"W1666808443","doi":"10.1007/978-3-642-16129-2","title":"Model Driven Engineering Languages and Systems","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software engineering; Series (stratigraphy); Software; Programming language; Engineering management; Engineering","score_opus":0.009375428221816246,"score_gpt":0.23511812070658078,"score_spread":0.22574269248476453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1666808443","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.0014799365,0.007348063,0.9376763,0.0009965497,0.0006484732,0.000072015304,0.00015867206,0.0019513841,0.049668558],"genre_scores_gemma":[0.077819094,0.023085125,0.6922577,0.0014380728,0.0009482536,0.00071888143,0.00157564,0.0029218646,0.19923535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991084,0.00018055763,0.000055031476,0.00009567019,0.0005228292,0.00003752964],"domain_scores_gemma":[0.99912924,0.00050632405,0.000045630353,0.00015423275,0.00013858575,0.000026004649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510777,0.001462869,0.00086263125,0.0011083358,0.00041723304,0.0026147868,0.0011559536,0.0011044003,0.009620572],"category_scores_gemma":[0.0022601085,0.0009932427,0.0009013278,0.0018714587,0.0010408999,0.00358703,0.0014357953,0.0029924945,0.0042360323],"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.00002278371,0.00006322697,0.00011309435,0.0005945016,0.000038392714,0.000091932256,0.00023410172,0.01581644,0.0031477823,0.72922903,0.036350492,0.21429822],"study_design_scores_gemma":[0.000027124217,0.00004608347,0.00010978762,0.00025724177,0.000032225984,0.0003868761,0.0000495132,0.042926237,0.0028980563,0.6159868,0.33724895,0.00003103603],"about_ca_topic_score_codex":0.00059413555,"about_ca_topic_score_gemma":0.0007369147,"teacher_disagreement_score":0.009620572,"about_ca_system_score_codex":0.0007577835,"about_ca_system_score_gemma":0.0010401362,"threshold_uncertainty_score":0.032184064},"labels":[],"label_agreement":null},{"id":"W1667884652","doi":"10.1007/978-3-642-22673-1_11","title":"Licensing the Mizar Mathematical Library","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"License; Computer science; Term (time); Library science; World Wide Web","score_opus":0.022569339107038004,"score_gpt":0.22606403173721545,"score_spread":0.20349469263017744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667884652","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067612743,0.021266496,0.06826772,0.017999742,0.0030198721,0.00011963171,0.0009854635,0.005053202,0.87652665],"genre_scores_gemma":[0.16089493,0.022279302,0.057291146,0.009081129,0.0055502835,0.000301253,0.00182375,0.0046331384,0.738145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995516,0.0011293105,0.0004994731,0.0004441046,0.0020666013,0.00034452535],"domain_scores_gemma":[0.9928161,0.0024188112,0.0005182281,0.0018895641,0.0019140879,0.0004431946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035970004,0.00053271017,0.00077441626,0.0045378157,0.005523678,0.01217712,0.001710112,0.002291808,0.05110142],"category_scores_gemma":[0.01412861,0.0007740112,0.00073076517,0.0044657784,0.0050589615,0.01420197,0.0055892225,0.0034740185,0.033922378],"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.000025584959,0.000016278944,0.00018788419,0.0002798181,0.000008900768,0.0001077244,0.001083507,0.0002249711,0.0005619943,0.810822,0.11215808,0.07452335],"study_design_scores_gemma":[0.00000436685,0.000008485356,0.00014218058,0.00008751292,0.000007995015,0.00023562848,0.000120277735,0.00033879446,0.00088073383,0.04145413,0.9566999,0.000019873109],"about_ca_topic_score_codex":0.0018655102,"about_ca_topic_score_gemma":0.002545995,"teacher_disagreement_score":0.05110142,"about_ca_system_score_codex":0.0048982836,"about_ca_system_score_gemma":0.0044777333,"threshold_uncertainty_score":0.17095125},"labels":[],"label_agreement":null},{"id":"W1669201668","doi":"10.1007/978-3-540-87353-2_13","title":"Adaptive Monitoring with Dynamic Differential Tracing-Based Diagnosis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tracing; Computer science; TRACE (psycholinguistics); Real-time computing; Overhead (engineering); Metric (unit); Software; Differential (mechanical device); Process (computing); Fault detection and isolation; Component (thermodynamics); Distributed computing; Data mining; Reliability engineering; Embedded system; Operating system; Artificial intelligence","score_opus":0.013862442110993295,"score_gpt":0.2302673175197408,"score_spread":0.2164048754087475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669201668","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.012092916,0.0001747153,0.98540246,0.00007693439,0.000050909384,0.000028969363,0.000023914237,0.0010216932,0.00112748],"genre_scores_gemma":[0.73583835,0.00016630102,0.26112586,0.00011479876,0.00006460356,0.000069370406,0.000071645125,0.00006868421,0.002480428],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993204,0.000110720095,0.000037177735,0.00018509071,0.00028415196,0.00006256903],"domain_scores_gemma":[0.9986595,0.00071137777,0.00012765643,0.00024428064,0.0002167185,0.000040589737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006189815,0.0006287561,0.0008233736,0.0009399233,0.0003577774,0.0008028345,0.0015160504,0.0007014989,0.0012805692],"category_scores_gemma":[0.00303455,0.00031807172,0.0002862989,0.0006065328,0.00054482307,0.0009753081,0.001297148,0.0007961581,0.000280722],"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.0009630415,0.00022297761,0.00351074,0.00018916972,0.000067255016,0.00030032516,0.00021076699,0.15326352,0.05747061,0.015144814,0.0030366427,0.76562005],"study_design_scores_gemma":[0.000026423544,0.00008701208,0.0005746706,0.000011845921,0.000026169328,0.00020297685,0.000009001199,0.9810698,0.010687349,0.0062333765,0.0010590198,0.000012321545],"about_ca_topic_score_codex":0.0013781413,"about_ca_topic_score_gemma":0.0015418167,"teacher_disagreement_score":0.0015160504,"about_ca_system_score_codex":0.00060170057,"about_ca_system_score_gemma":0.0005332921,"threshold_uncertainty_score":0.004365623},"labels":[],"label_agreement":null},{"id":"W1669368914","doi":"10.1007/978-3-540-24677-0_83","title":"Expertise in a Hybrid Diagnostic-Recommendation System for SMEs: A Successful Real-Life Application","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Recommender system; World Wide Web","score_opus":0.015227481876837447,"score_gpt":0.2526122738036633,"score_spread":0.23738479192682585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669368914","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90601057,0.00040750936,0.074194275,0.0009491997,0.00007565251,0.0004015582,0.0007683159,0.008508923,0.008684049],"genre_scores_gemma":[0.930857,0.00010272524,0.06364756,0.000118399854,0.000021433996,0.00007180397,0.00040846725,0.000104942184,0.0046677575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995733,0.00012805747,0.000036546113,0.00010673818,0.000105525636,0.00004977343],"domain_scores_gemma":[0.9979716,0.0010138114,0.00007649647,0.00021821138,0.00043834237,0.00028142324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011349228,0.0005204448,0.0006754266,0.0009487813,0.00083665975,0.00078534253,0.0011037035,0.0020572718,0.0061210203],"category_scores_gemma":[0.0033522854,0.00025466894,0.00030728543,0.0010347718,0.00019624119,0.0011489005,0.0008244932,0.000527759,0.0020615081],"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.0051107486,0.004409223,0.05149484,0.0009659547,0.00026093665,0.0049070646,0.0026907297,0.062665634,0.059185658,0.0019690532,0.023396568,0.7829437],"study_design_scores_gemma":[0.0011808663,0.0028485404,0.030576799,0.00009687345,0.00050698774,0.0025968442,0.0019541183,0.8886279,0.046998076,0.0026359179,0.02175748,0.00021963606],"about_ca_topic_score_codex":0.012394169,"about_ca_topic_score_gemma":0.012434038,"teacher_disagreement_score":0.012394169,"about_ca_system_score_codex":0.00065555825,"about_ca_system_score_gemma":0.0006537878,"threshold_uncertainty_score":0.024644017},"labels":[],"label_agreement":null},{"id":"W1669618825","doi":"10.1007/978-3-642-15597-0_2","title":"Modelling the Effects of Operating Conditions on Motor Power Consumption in Single Screw Extrusion","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Energy consumption; Automotive engineering; Electric motor; Process (computing); Energy (signal processing); Efficient energy use; Power (physics); Engineering; Mechanical engineering; Computer science; Electrical engineering","score_opus":0.012556419393227878,"score_gpt":0.21602690090229099,"score_spread":0.2034704815090631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669618825","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.91997135,0.00050696515,0.07333984,0.00009607841,0.00002432261,0.000023611947,0.00026268166,0.00037726908,0.0053978334],"genre_scores_gemma":[0.99706084,0.00011799165,0.0014514321,0.0000032607009,0.0000020422272,0.000007890607,0.00006234093,0.000033578202,0.0012605692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999186,0.000019245947,0.000005556662,0.000017763117,0.00002150959,0.00001733592],"domain_scores_gemma":[0.9994759,0.00041940654,0.00003811711,0.000020535143,0.00003865247,0.0000075055814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019741734,0.0005052624,0.000565881,0.00017441208,0.00016209774,0.0005473958,0.0006189366,0.0006394623,0.0020827558],"category_scores_gemma":[0.00095903024,0.00036809174,0.00045980315,0.00028717506,0.0002163284,0.0006630417,0.00018734172,0.00031210567,0.00028062993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002542888,0.00006186318,0.0009893776,0.00008991344,0.00001289517,0.00007705644,0.000044901855,0.97874737,0.011121226,0.00039208547,0.00014682244,0.008062192],"study_design_scores_gemma":[0.000006968622,0.000051762483,0.0011391419,0.000003792653,0.000010443627,0.00001420772,0.000013051111,0.9934622,0.0049433196,0.0002259308,0.00012294487,0.0000061793176],"about_ca_topic_score_codex":0.003990718,"about_ca_topic_score_gemma":0.0038538051,"teacher_disagreement_score":0.003990718,"about_ca_system_score_codex":0.0003054217,"about_ca_system_score_gemma":0.00020146467,"threshold_uncertainty_score":0.007934988},"labels":[],"label_agreement":null},{"id":"W1670558497","doi":"10.1007/3-540-39799-x_41","title":"On the Design of S-Boxes","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":713,"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":"Plaintext; Ciphertext; Mathematics; Arithmetic; Malleability; Bit (key); Function (biology); Discrete mathematics; Combinatorics; Algorithm; Computer science; Encryption; Computer network","score_opus":0.03851490802162377,"score_gpt":0.26277794189629083,"score_spread":0.22426303387466706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670558497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017559743,0.002174436,0.94742626,0.00031802923,0.00020973351,0.0001533722,0.0000968945,0.0010745941,0.030986957],"genre_scores_gemma":[0.34682015,0.0027173935,0.62472147,0.00040980367,0.00012407005,0.00036967357,0.00021843537,0.00031975008,0.024299206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923944,0.00027736588,0.000059194495,0.00011692076,0.00020635211,0.00010073886],"domain_scores_gemma":[0.99923086,0.00037880536,0.000058131172,0.00015865687,0.00014016824,0.000033335382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009902366,0.0008608707,0.000839158,0.00085267064,0.0008417965,0.00197327,0.001087519,0.00093683647,0.008345654],"category_scores_gemma":[0.0022546463,0.00058987294,0.00075845426,0.0007673523,0.0015021662,0.0021246276,0.0014105714,0.0010121034,0.0024367038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026788132,0.000029957382,0.00025891894,0.00032115454,0.00003453359,0.000088410365,0.00020112561,0.02775429,0.011143174,0.83880836,0.0050230315,0.11606917],"study_design_scores_gemma":[0.0001840049,0.0003563781,0.00017882683,0.00033540427,0.00006922851,0.000590421,0.000102850776,0.19210261,0.02987344,0.67437565,0.10176964,0.00006155632],"about_ca_topic_score_codex":0.0005509056,"about_ca_topic_score_gemma":0.0007375509,"teacher_disagreement_score":0.008345654,"about_ca_system_score_codex":0.00094653934,"about_ca_system_score_gemma":0.0007209583,"threshold_uncertainty_score":0.027919054},"labels":[],"label_agreement":null},{"id":"W1670665503","doi":"10.1007/978-3-540-74472-6_4","title":"On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Windsor","funders":"","keywords":"Convex polygon; Polygon (computer graphics); Combinatorics; Rectilinear polygon; Polygon covering; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Convex set; Mathematics; Star-shaped polygon; Line (geometry); Computer science; Geometry; Convex optimization","score_opus":0.029297630259604867,"score_gpt":0.26828259282235867,"score_spread":0.2389849625627538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670665503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09234258,0.0006286766,0.87701863,0.0005501271,0.00014259655,0.00023093559,0.00029604568,0.00025723543,0.028533202],"genre_scores_gemma":[0.33667412,0.0017749729,0.63436633,0.0002043785,0.00025061847,0.00040500806,0.0013656552,0.00074466807,0.024214253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993686,0.00016012699,0.00003433017,0.00010699421,0.000252503,0.00007759239],"domain_scores_gemma":[0.99719656,0.0020816494,0.00022027807,0.0001980376,0.00018045497,0.00012302533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077248045,0.0012066483,0.0019810118,0.0016911301,0.0012524204,0.0022828977,0.0024436587,0.0022634529,0.008811067],"category_scores_gemma":[0.0070432466,0.00108334,0.001277593,0.0025602498,0.0024878972,0.0031581228,0.0034629018,0.002747438,0.0010215616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067729957,0.00019513155,0.0020490861,0.000833308,0.000084075844,0.0006144199,0.0012222223,0.44239,0.012053739,0.36360848,0.009798843,0.1664734],"study_design_scores_gemma":[0.000056466622,0.00018272642,0.0007599887,0.00014345684,0.000034712386,0.0003780332,0.00038091518,0.64450157,0.002359398,0.3437479,0.0074132793,0.00004157763],"about_ca_topic_score_codex":0.0029506187,"about_ca_topic_score_gemma":0.0023712555,"teacher_disagreement_score":0.008811067,"about_ca_system_score_codex":0.00087002007,"about_ca_system_score_gemma":0.00045002848,"threshold_uncertainty_score":0.029475927},"labels":[],"label_agreement":null},{"id":"W167307853","doi":"10.1007/978-3-642-31401-8_44","title":"A Feasibility Study of Levels-of-Detail in Point-Based Haptic Rendering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"","keywords":"Computer science; Rendering (computer graphics); Finite element method; Computer graphics (images); Computation; Representation (politics); Haptic technology; Computer vision; Computational science; Artificial intelligence; Algorithm","score_opus":0.03716966931053727,"score_gpt":0.2772039070924904,"score_spread":0.2400342377819531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167307853","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.559988,0.001213938,0.42278486,0.00024603438,0.00009067631,0.00047581384,0.00022816063,0.00080174603,0.014170699],"genre_scores_gemma":[0.94690025,0.00019719025,0.05161384,0.000016826194,0.000011166784,0.00004195669,0.000052929186,0.00006914599,0.0010967547],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986564,0.00040158222,0.000048940943,0.00010995563,0.0006670269,0.000116039315],"domain_scores_gemma":[0.9884384,0.009616172,0.00030900762,0.00057561725,0.0009002713,0.00016066521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016317128,0.0004726697,0.0004977503,0.0004411497,0.00033378246,0.0014916508,0.0009972051,0.00084844005,0.007671898],"category_scores_gemma":[0.011940676,0.00037203712,0.00048750732,0.00042317397,0.0005746221,0.0016964305,0.0008875939,0.0006042361,0.0004676366],"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.0071441913,0.000924785,0.004083297,0.0017532272,0.00007898575,0.0012015994,0.0016017924,0.07607092,0.73948634,0.02109975,0.0011389932,0.14541619],"study_design_scores_gemma":[0.000489613,0.0048317974,0.0066247955,0.00016465079,0.00014374295,0.0016623354,0.0006643741,0.7555199,0.22062933,0.0045735706,0.004584929,0.000110952475],"about_ca_topic_score_codex":0.0010679933,"about_ca_topic_score_gemma":0.00044856698,"teacher_disagreement_score":0.007671898,"about_ca_system_score_codex":0.00032787988,"about_ca_system_score_gemma":0.000374484,"threshold_uncertainty_score":0.025665045},"labels":[],"label_agreement":null},{"id":"W167378754","doi":"10.1007/978-3-642-39112-5_96","title":"Trust-Based Recommendations for Scientific Papers Based on the Researcher’s Current Interest","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Saskatchewan","funders":"","keywords":"Computer science; Recommender system; User satisfaction; World Wide Web; Data science; Social network (sociolinguistics); Human–computer interaction; Social media","score_opus":0.1167922631929385,"score_gpt":0.3287188413986829,"score_spread":0.2119265782057444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167378754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14685182,0.055273447,0.6533156,0.031246407,0.016184954,0.0015623426,0.012435681,0.004788788,0.07834106],"genre_scores_gemma":[0.6235757,0.018184729,0.2902323,0.0020894508,0.010716526,0.00046305696,0.009086345,0.0004937527,0.04515815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947349,0.001410667,0.00060467754,0.0006425277,0.0023835981,0.00022368216],"domain_scores_gemma":[0.94744724,0.033064906,0.0036399337,0.0032473763,0.010839772,0.0017607773],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007741214,0.0010603206,0.0012211913,0.0075429343,0.0009510747,0.0048069092,0.0016077858,0.002466719,0.011876427],"category_scores_gemma":[0.06251063,0.0006454385,0.0015432818,0.005403217,0.00033535878,0.004472378,0.0010960283,0.0023249404,0.0077045993],"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.0014951311,0.00058409915,0.03384534,0.0026654177,0.0015661818,0.00068839383,0.0008117453,0.012850015,0.014224014,0.009970944,0.16982593,0.7514728],"study_design_scores_gemma":[0.0014604956,0.002256163,0.07671038,0.0024088447,0.006507954,0.0058954987,0.0019413743,0.4286005,0.037941866,0.12169517,0.31350285,0.0010789403],"about_ca_topic_score_codex":0.0022413682,"about_ca_topic_score_gemma":0.007033292,"teacher_disagreement_score":0.99519306,"about_ca_system_score_codex":0.0010715531,"about_ca_system_score_gemma":0.0013500905,"threshold_uncertainty_score":0.040939927},"labels":[],"label_agreement":null},{"id":"W1673788924","doi":"10.1007/978-3-642-21869-9_53","title":"A Simple Method of Representing Reusable Strategic Knowledge for MT Tutoring","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Formalism (music); Tracing; Simple (philosophy); Variety (cybernetics); Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.07745379817175718,"score_gpt":0.31974016195431754,"score_spread":0.24228636378256035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673788924","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.0013319977,0.00004446166,0.990218,0.000058397727,0.00005262499,0.000108941094,0.0003596936,0.004580109,0.0032456939],"genre_scores_gemma":[0.03791198,0.000107243046,0.949582,0.00005109641,0.00002732728,0.00029019953,0.0007069562,0.00078120263,0.010542014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992576,0.00012804133,0.00009057669,0.00015931962,0.00031131538,0.000053250642],"domain_scores_gemma":[0.9983197,0.0004505159,0.000080557154,0.00070699933,0.00036653221,0.000075622615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090152276,0.0009585173,0.00066427223,0.001577085,0.00089419505,0.0038055517,0.0019214583,0.0013593555,0.021163495],"category_scores_gemma":[0.0044538565,0.0005757245,0.0009820332,0.0019156777,0.0010348611,0.0043182108,0.0021979557,0.0015399891,0.005873638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033400275,0.0001410502,0.0007286186,0.0005615142,0.00006630159,0.00024688902,0.0010304314,0.009497071,0.032496195,0.1603674,0.020818919,0.77371156],"study_design_scores_gemma":[0.00018982521,0.00021762881,0.00095805735,0.00028543436,0.0002486625,0.0010868742,0.0004890162,0.2804573,0.11055621,0.2582784,0.34703988,0.00019266653],"about_ca_topic_score_codex":0.0029282214,"about_ca_topic_score_gemma":0.0049835797,"teacher_disagreement_score":0.021163495,"about_ca_system_score_codex":0.00065404805,"about_ca_system_score_gemma":0.001175045,"threshold_uncertainty_score":0.07079893},"labels":[],"label_agreement":null},{"id":"W1674032370","doi":"10.1007/11577935_13","title":"Predicting Web Information Content","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Web page; Information retrieval; Parameterized complexity; Inference; Web navigation; World Wide Web; Static web page; Artificial intelligence; Algorithm","score_opus":0.026565263889206762,"score_gpt":0.23725498422159902,"score_spread":0.21068972033239225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1674032370","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.7587854,0.007048157,0.19305958,0.00091722485,0.00025797848,0.00028290923,0.008885399,0.0048281355,0.025935272],"genre_scores_gemma":[0.9109881,0.0018350859,0.06271717,0.00009505,0.00032718419,0.00009408618,0.007679944,0.00015163257,0.016111774],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996997,0.00005993128,0.000012571399,0.00008166689,0.00011148041,0.000034756125],"domain_scores_gemma":[0.9986594,0.00084883755,0.000075371536,0.000108954606,0.0002462447,0.00006123269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044506756,0.0006713425,0.0006936927,0.004618389,0.00033927688,0.0010402625,0.0005101711,0.000725363,0.0032998996],"category_scores_gemma":[0.0032759411,0.0003385473,0.00053459045,0.0033158641,0.00018321838,0.0013016138,0.00038656575,0.00064748153,0.0030501974],"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.00042058562,0.0007863706,0.09267518,0.00021487333,0.00025780496,0.00018381841,0.00008742468,0.05162804,0.010616808,0.0033623897,0.0235575,0.81620926],"study_design_scores_gemma":[0.000016378153,0.00015941738,0.03955489,0.000043736094,0.00011464349,0.00021834247,0.000067239045,0.94060314,0.009591639,0.0052847727,0.0043186997,0.000027091275],"about_ca_topic_score_codex":0.0075733415,"about_ca_topic_score_gemma":0.013071775,"teacher_disagreement_score":0.0075733415,"about_ca_system_score_codex":0.0004543276,"about_ca_system_score_gemma":0.00022891881,"threshold_uncertainty_score":0.015058517},"labels":[],"label_agreement":null},{"id":"W167406361","doi":"10.1007/978-3-540-85093-9_8","title":"A Single Initialization Server for Multi-party Cryptography","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université de Montréal","funders":"","keywords":"Initialization; Computer science; Protocol (science); Cryptography; Computer security; Computer network; Modular design; Zero-knowledge proof; Theoretical computer science; Distributed computing; Operating system","score_opus":0.04531214121852579,"score_gpt":0.26840447495771924,"score_spread":0.22309233373919346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167406361","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.012921909,0.00092081854,0.9548878,0.00025208108,0.00048884295,0.00043624252,0.000209487,0.017598184,0.012284631],"genre_scores_gemma":[0.38940609,0.0008592826,0.5478646,0.00051532727,0.0006113226,0.0008143649,0.0014466078,0.0038611507,0.054621264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713886,0.0004901622,0.00024824307,0.00050460896,0.0011052265,0.0005129769],"domain_scores_gemma":[0.9956109,0.00041981746,0.0001613824,0.0028807619,0.00060532114,0.00032181307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017036751,0.00152352,0.0023803127,0.0015332272,0.0023462265,0.003750313,0.004103915,0.0020074283,0.020089729],"category_scores_gemma":[0.0030852184,0.0017370972,0.001091804,0.001699592,0.0013230294,0.0083564585,0.0058530257,0.00434788,0.021052321],"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.0036213158,0.00077740225,0.0017566737,0.000715728,0.00018941288,0.00056961813,0.00050767354,0.013975108,0.098918006,0.2043267,0.057951473,0.6166909],"study_design_scores_gemma":[0.00058826857,0.000982038,0.0016594356,0.00025757885,0.0003560449,0.0022750483,0.00017581423,0.37475294,0.31436878,0.14907397,0.1551197,0.00039041953],"about_ca_topic_score_codex":0.0003231147,"about_ca_topic_score_gemma":0.00041045962,"teacher_disagreement_score":0.020089729,"about_ca_system_score_codex":0.0014778234,"about_ca_system_score_gemma":0.001817784,"threshold_uncertainty_score":0.0672068},"labels":[],"label_agreement":null},{"id":"W1675886408","doi":"10.1007/978-3-642-39200-9_7","title":"Hidden-Web Induced by Client-Side Scripting: An Empirical Study","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 British Columbia","funders":"","keywords":"JavaScript; Document Object Model; Computer science; World Wide Web; Client-side; Scripting language; Web page; Interactivity; Web content; Server-side; Dynamic web page; Static web page; Web application; Web development; Operating system","score_opus":0.04070059916444162,"score_gpt":0.29631607346695177,"score_spread":0.25561547430251014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1675886408","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.99545765,0.00008462393,0.0018416211,0.000050047583,0.000009095898,0.00008167212,0.00018018049,0.00017746811,0.0021176431],"genre_scores_gemma":[0.99765813,0.00004430662,0.0009152793,0.00004040863,0.000012231903,0.000031345433,0.00041061794,0.00009191154,0.00079558394],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99621284,0.0012813644,0.0002810763,0.000567771,0.001321491,0.0003354275],"domain_scores_gemma":[0.87465346,0.08825964,0.012340984,0.014700683,0.006247698,0.0037975803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035006397,0.00042776865,0.00052240107,0.000817805,0.00086543,0.0021086931,0.0012975094,0.0010834762,0.0049111536],"category_scores_gemma":[0.06373369,0.0004372454,0.00042785102,0.001082918,0.0010371365,0.0034696104,0.0013180445,0.0025022512,0.0016414985],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047344686,0.017038386,0.8195364,0.00073160685,0.00023009573,0.0027807662,0.007443015,0.0061443564,0.01767559,0.0050604944,0.005241489,0.11338337],"study_design_scores_gemma":[0.0002081501,0.002660246,0.79151934,0.00027590265,0.00050018635,0.0044687707,0.008691181,0.15248284,0.02541411,0.009035486,0.0045755133,0.00016834884],"about_ca_topic_score_codex":0.0028424652,"about_ca_topic_score_gemma":0.0020392344,"teacher_disagreement_score":0.0049111536,"about_ca_system_score_codex":0.00072492834,"about_ca_system_score_gemma":0.00084197015,"threshold_uncertainty_score":0.018513381},"labels":[],"label_agreement":null},{"id":"W1676236699","doi":"10.1007/978-3-642-31491-9_9","title":"Model Transformations for Migrating Legacy Models: An Industrial Case Study","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"AUTOSAR; Metamodeling; Automotive industry; Computer science; Software engineering; Model transformation; Modeling language; Legacy system; Software development; Software; Systems engineering; Unified Modeling Language; Software architecture; Manufacturing engineering; Programming language; Engineering; Artificial intelligence","score_opus":0.09122904825446307,"score_gpt":0.2931293093861676,"score_spread":0.20190026113170453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1676236699","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.79166335,0.00043989805,0.1767339,0.0009968844,0.000063719875,0.0005289987,0.000443895,0.0026537394,0.026475638],"genre_scores_gemma":[0.8731699,0.00037483074,0.11837766,0.000084367966,0.00001284606,0.000133046,0.0005648158,0.0004451877,0.006837306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820626,0.0007678218,0.00009203617,0.000154469,0.00062146224,0.00015792866],"domain_scores_gemma":[0.9941684,0.0034132176,0.0002840041,0.0014269861,0.00057809695,0.00012935372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029003627,0.0005676862,0.00030483466,0.00074572547,0.001027014,0.0017216252,0.0017584112,0.0014063757,0.0027748712],"category_scores_gemma":[0.0082562165,0.00037241893,0.00059542205,0.0014080502,0.0007983144,0.0018952417,0.0010887105,0.0012420707,0.0004924754],"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.0017276467,0.004782639,0.021116404,0.0011907134,0.0001486551,0.009353257,0.010106528,0.1895783,0.051515497,0.06839699,0.012646347,0.629437],"study_design_scores_gemma":[0.00080297265,0.0020108328,0.012408838,0.00033028025,0.0004555551,0.0056068315,0.0066293506,0.7147757,0.12530158,0.0414277,0.09008745,0.00016295287],"about_ca_topic_score_codex":0.003864228,"about_ca_topic_score_gemma":0.006170629,"teacher_disagreement_score":0.003864228,"about_ca_system_score_codex":0.0008993355,"about_ca_system_score_gemma":0.0013159517,"threshold_uncertainty_score":0.0153387785},"labels":[],"label_agreement":null},{"id":"W167675073","doi":"10.1007/978-3-642-30618-1_13","title":"Fast and Robust Registration Based on Gradient Orientations: Case Study Matching Intra-operative Ultrasound to Pre-operative MRI in Neurosurgery","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Computer science; Image registration; Orientation (vector space); Neurosurgery; Matching (statistics); Magnetic resonance imaging; Context (archaeology); Artificial intelligence; Maximization; Computer vision; Ultrasound; Radiology; Medical physics; Medicine; Image (mathematics); Mathematics; Mathematical optimization","score_opus":0.023487593584918216,"score_gpt":0.30166211581189323,"score_spread":0.27817452222697503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167675073","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.77011305,0.0055905003,0.20581877,0.0022666035,0.00039161433,0.00066092715,0.0006357108,0.0010399489,0.013482912],"genre_scores_gemma":[0.90107936,0.0021897207,0.089854,0.0003672375,0.00034363975,0.000109003144,0.00027044766,0.00048781518,0.005298763],"study_design_codex":"case_report","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992353,0.00015300029,0.00012079059,0.00013228148,0.00021932967,0.00013942571],"domain_scores_gemma":[0.99828666,0.0007758741,0.00023653755,0.00046138512,0.0001267741,0.000112684604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290673,0.0010173707,0.0009342827,0.0028855172,0.0007962795,0.0015052209,0.001639721,0.0047753104,0.0031625286],"category_scores_gemma":[0.005653611,0.000954323,0.0009015365,0.0028585803,0.0014977005,0.0013672144,0.0012267716,0.0018663432,0.0021097972],"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.0018656155,0.0008722917,0.022052597,0.0007217249,0.00016425065,0.63602936,0.0013911016,0.0065887156,0.07733064,0.00239165,0.004366101,0.24622598],"study_design_scores_gemma":[0.00008745322,0.00091016735,0.014677755,0.00011044196,0.00020055215,0.8990479,0.00082458626,0.023921559,0.04915579,0.003619062,0.0073391898,0.000105593],"about_ca_topic_score_codex":0.0018601215,"about_ca_topic_score_gemma":0.0030669766,"teacher_disagreement_score":0.0047753104,"about_ca_system_score_codex":0.00044173189,"about_ca_system_score_gemma":0.00068085635,"threshold_uncertainty_score":0.010579705},"labels":[],"label_agreement":null},{"id":"W1677888577","doi":"10.1007/3-540-45821-2_8","title":"Architectural Refactoring in Framework Evolution: A Case Study","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Code refactoring; Computer science; Software engineering; Software product line; Programming language; Architecture; Object-oriented programming; Software architecture; Domain (mathematical analysis); Set (abstract data type); Process (computing); Software development; Software","score_opus":0.050587530247644966,"score_gpt":0.3035502522059936,"score_spread":0.2529627219583486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677888577","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.9752554,0.00020570781,0.015959492,0.0005289625,0.000015215122,0.00011793648,0.00006499351,0.0001766466,0.0076755933],"genre_scores_gemma":[0.9764732,0.0002021945,0.01974521,0.00008665034,0.000007348201,0.000034529043,0.00008253808,0.000056985198,0.0033112762],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9979086,0.0010800097,0.00007665771,0.0001557618,0.0005066758,0.00027245717],"domain_scores_gemma":[0.9910301,0.006469011,0.0005019291,0.0009481614,0.0006256937,0.000425084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032267647,0.00043572902,0.00032122823,0.0009194385,0.0018671348,0.0012342017,0.001677645,0.0029071164,0.0015541384],"category_scores_gemma":[0.007958598,0.0003260293,0.00054967013,0.0014598443,0.0010249253,0.0014136456,0.00087747374,0.0012622175,0.0002795316],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021208478,0.01229989,0.071792,0.0012265492,0.00021351765,0.07872011,0.053401962,0.07653588,0.046685703,0.03173239,0.008484867,0.6167863],"study_design_scores_gemma":[0.0017209997,0.009652555,0.105014004,0.0007531674,0.0010129093,0.07210919,0.06348949,0.43413073,0.16046682,0.02821017,0.12290781,0.00053221424],"about_ca_topic_score_codex":0.008256075,"about_ca_topic_score_gemma":0.021153871,"teacher_disagreement_score":0.008256075,"about_ca_system_score_codex":0.0012058659,"about_ca_system_score_gemma":0.0010977774,"threshold_uncertainty_score":0.017064989},"labels":[],"label_agreement":null},{"id":"W1678190280","doi":"10.1007/978-3-642-19858-8","title":"Requirements Engineering: Foundation for Software Quality","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Foundation (evidence); Software engineering; Software quality; Quality (philosophy); Software requirements; Requirements engineering; Software; Engineering management; Software development; Software construction; Engineering; Programming language","score_opus":0.05311507371143089,"score_gpt":0.3141976943078185,"score_spread":0.26108262059638765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678190280","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.00236276,0.014732681,0.87028885,0.00784113,0.0006906495,0.00010672278,0.00018773673,0.0010175594,0.10277192],"genre_scores_gemma":[0.17876673,0.03193404,0.7163174,0.002383646,0.0023288587,0.000602637,0.00078716455,0.0012152699,0.06566424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99676204,0.0006954814,0.00022482518,0.00031142702,0.0018552167,0.00015099708],"domain_scores_gemma":[0.9950289,0.003065812,0.0002495057,0.00074603816,0.00082544994,0.00008440142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003194001,0.0010771173,0.0008398636,0.0016648141,0.0006568096,0.003321555,0.0013798258,0.001717325,0.009018323],"category_scores_gemma":[0.010203245,0.000934296,0.0010838573,0.0017106232,0.0032151497,0.006411672,0.001851847,0.0031626339,0.003640543],"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.000011603742,0.000022960494,0.000105553925,0.0004341422,0.000018785042,0.000051697483,0.00023743632,0.004488224,0.0009783667,0.8269923,0.016817728,0.14984126],"study_design_scores_gemma":[0.000016916545,0.000023104494,0.00014753302,0.00028169595,0.000019399738,0.00013961075,0.000059641086,0.010149327,0.0010408591,0.8702019,0.1179042,0.000015690117],"about_ca_topic_score_codex":0.0013490185,"about_ca_topic_score_gemma":0.0008308716,"teacher_disagreement_score":0.009018323,"about_ca_system_score_codex":0.0014312092,"about_ca_system_score_gemma":0.0018943712,"threshold_uncertainty_score":0.030169308},"labels":[],"label_agreement":null},{"id":"W167890445","doi":"10.1007/978-3-642-31368-4_13","title":"Adaptive Fuzzy Logic Control for Time-Delayed Bilateral Teleoperation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic 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":"University of Ottawa","funders":"","keywords":"Teleoperation; Computer science; Controller (irrigation); Fuzzy logic; Context (archaeology); Fuzzy control system; Field (mathematics); Robot; Control engineering; Control theory (sociology); Simulation; Artificial intelligence; Control (management); Engineering","score_opus":0.01546785204823218,"score_gpt":0.2198095664994936,"score_spread":0.20434171445126142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167890445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019273497,0.00060622866,0.96988094,0.00012631933,0.00024082877,0.000031085277,0.000023799908,0.0001919822,0.009625332],"genre_scores_gemma":[0.92799836,0.0005304537,0.060565006,0.00012541741,0.00009364699,0.000069759844,0.000038460916,0.000020512192,0.0105583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984896,0.000016912383,0.000008387381,0.00003164888,0.00007025334,0.000023961564],"domain_scores_gemma":[0.99989057,0.000037191392,0.000016811568,0.0000078372905,0.000042487194,0.0000051818915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029793914,0.0004024816,0.00033640716,0.00017304941,0.00030284488,0.00068660517,0.0007677319,0.000557013,0.0025902241],"category_scores_gemma":[0.00051340373,0.00013866587,0.00031408682,0.00023299697,0.00030720426,0.00038933114,0.00037518906,0.00065653207,0.0002504297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050891575,0.00020722595,0.000244516,0.00038427286,0.000060835893,0.00021709276,0.00022465028,0.44077137,0.093161404,0.0425994,0.003350419,0.41826996],"study_design_scores_gemma":[0.000044184188,0.0001836636,0.00024084911,0.00001717756,0.000020353888,0.000060174163,0.000016141163,0.9833723,0.0051815473,0.008318687,0.0025310868,0.000013868582],"about_ca_topic_score_codex":0.0027463262,"about_ca_topic_score_gemma":0.0029292488,"teacher_disagreement_score":0.0027463262,"about_ca_system_score_codex":0.00042332447,"about_ca_system_score_gemma":0.00035609386,"threshold_uncertainty_score":0.008665085},"labels":[],"label_agreement":null},{"id":"W167928972","doi":"10.1007/978-3-642-28914-9_24","title":"How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":353,"is_retracted":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":"Verifiable secret sharing; Delegate; Computer science; Delegation; Theoretical computer science; Encryption; Computation; Cryptography; Scheme (mathematics); Function (biology); Cryptographic primitive; Algorithm; Computer security; Mathematics; Programming language; Cryptographic protocol; Law","score_opus":0.025312755783918294,"score_gpt":0.23655240851545864,"score_spread":0.21123965273154036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167928972","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.0041878717,0.0008426269,0.9763851,0.002475663,0.00060653134,0.00014547356,0.00023567381,0.0020102195,0.013110777],"genre_scores_gemma":[0.26484516,0.0023285812,0.69434124,0.0015406988,0.0007522654,0.00046923032,0.001213623,0.0024808533,0.032028392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943,0.0016364632,0.0005622524,0.0007520067,0.0022624042,0.0004868196],"domain_scores_gemma":[0.9938905,0.00241552,0.0001643528,0.0029495202,0.00044362983,0.00013646769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039406293,0.0011798284,0.0015048862,0.0006357251,0.0015358025,0.006820918,0.0021750925,0.002483127,0.011509652],"category_scores_gemma":[0.013561136,0.0012678952,0.0020586485,0.0011471644,0.00434872,0.020813707,0.0055906195,0.008142635,0.0059686685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018674048,0.00010278139,0.00017731228,0.0003473495,0.0000642471,0.00012625231,0.00049498625,0.007334504,0.002952109,0.81741166,0.018624322,0.15217775],"study_design_scores_gemma":[0.000024873127,0.000016432263,0.00005470603,0.000057541216,0.000022440394,0.00012649396,0.000036227273,0.015880074,0.00501396,0.9588994,0.019834364,0.000033350134],"about_ca_topic_score_codex":0.00087962043,"about_ca_topic_score_gemma":0.0008363553,"teacher_disagreement_score":0.011509652,"about_ca_system_score_codex":0.0015311007,"about_ca_system_score_gemma":0.0020395836,"threshold_uncertainty_score":0.038503647},"labels":[],"label_agreement":null},{"id":"W1680732213","doi":"10.1007/978-3-642-38016-7_21","title":"Improved Approximation Guarantees for Lower-Bounded Facility Location","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bounded function; Facility location problem; Approximation algorithm; Mathematical optimization; Algorithm; Mathematics; Mathematical analysis","score_opus":0.02392728612772597,"score_gpt":0.2318076019570564,"score_spread":0.20788031582933045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1680732213","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.019173073,0.0034633572,0.94336426,0.0035414451,0.00061566243,0.00020188747,0.0014917443,0.0030603309,0.02508827],"genre_scores_gemma":[0.5002502,0.0042669796,0.4559789,0.0031041221,0.001807007,0.0010621017,0.0046139685,0.002904025,0.026012652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858,0.0035547495,0.0006277361,0.0020383971,0.0052593215,0.002719736],"domain_scores_gemma":[0.946733,0.033578265,0.002074902,0.011880184,0.0039244406,0.0018091559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008438218,0.0054106684,0.006591667,0.00336231,0.0026502372,0.007986226,0.0155692715,0.0049110767,0.021886125],"category_scores_gemma":[0.05818425,0.0027252014,0.004195935,0.008506037,0.005043148,0.014121624,0.0119751105,0.015389022,0.006330814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002523316,0.000667526,0.001668666,0.00097124866,0.0002588532,0.0002617896,0.0005271963,0.5660465,0.003994475,0.25972506,0.046199597,0.11715582],"study_design_scores_gemma":[0.00015933749,0.000092158654,0.00023643767,0.000086466374,0.000082261344,0.000108212516,0.00007328843,0.8238368,0.0009419988,0.17088439,0.0034635318,0.00003504583],"about_ca_topic_score_codex":0.010552799,"about_ca_topic_score_gemma":0.012413662,"teacher_disagreement_score":0.021886125,"about_ca_system_score_codex":0.0089099435,"about_ca_system_score_gemma":0.0069755376,"threshold_uncertainty_score":0.07321644},"labels":[],"label_agreement":null},{"id":"W1681294000","doi":"10.1007/978-3-642-33418-4_50","title":"Multi-Object Geodesic Active Contours (MOGAC)","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Robarts Research Institute; Johns Hopkins University","keywords":"Computer science; Artificial intelligence; Pixel; Computer vision; Segmentation; Geodesic; Image segmentation; Object (grammar); Memory footprint; Graph; Dimension (graph theory); Segmentation-based object categorization; Scale-space segmentation; Pattern recognition (psychology); Theoretical computer science; Mathematics","score_opus":0.023352416777602844,"score_gpt":0.3070234742835281,"score_spread":0.28367105750592525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681294000","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.0038345726,0.00045447238,0.9935707,0.00013360799,0.000040476676,0.000043992233,0.0000387704,0.0009132192,0.0009702102],"genre_scores_gemma":[0.07505711,0.0005025906,0.92193496,0.000106019965,0.000043034197,0.000098741024,0.00019820403,0.00029060373,0.0017687901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927956,0.0001456684,0.00003504597,0.00016261399,0.0003305205,0.000046549227],"domain_scores_gemma":[0.99908376,0.00035248912,0.00013624788,0.00019986673,0.00018105582,0.00004660913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011980903,0.0013919764,0.0013676644,0.0016658147,0.00060895545,0.0015390004,0.0018512999,0.0021742564,0.0022922559],"category_scores_gemma":[0.0025963082,0.000969624,0.0012282161,0.0016131535,0.0008827392,0.0021313569,0.0017445317,0.0013555534,0.0008819061],"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.00019075887,0.000077778044,0.0009700626,0.00028568227,0.00015482194,0.00020901153,0.00021468675,0.41932124,0.020343106,0.031816658,0.00559078,0.52082545],"study_design_scores_gemma":[0.000012154195,0.000029469322,0.00017829672,0.000014764067,0.000012434215,0.00012670131,0.000016649454,0.9750933,0.0064982963,0.012379918,0.005619762,0.00001821157],"about_ca_topic_score_codex":0.0032666994,"about_ca_topic_score_gemma":0.004047526,"teacher_disagreement_score":0.0032666994,"about_ca_system_score_codex":0.000829168,"about_ca_system_score_gemma":0.001126274,"threshold_uncertainty_score":0.0076683164},"labels":[],"label_agreement":null},{"id":"W1681491849","doi":"10.1007/3-540-47969-4_19","title":"Phase-Based Local Features","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":93,"is_retracted":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":"Feature (linguistics); Computer science; Rotation (mathematics); Invariant (physics); Brightness; Artificial intelligence; Noise (video); Pattern recognition (psychology); Image (mathematics); Algorithm; Computer vision; Mathematics; Physics; Optics","score_opus":0.018214448746834696,"score_gpt":0.2795282757591516,"score_spread":0.2613138270123169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681491849","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.0072142943,0.00048896915,0.9817155,0.00010040476,0.000092239185,0.0000419454,0.00025864827,0.0015298192,0.008558061],"genre_scores_gemma":[0.25045514,0.0016326772,0.7068452,0.00020352761,0.00022415597,0.00013034415,0.0024112957,0.0010629846,0.037034623],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999806,0.00001824818,0.000007649138,0.000051014897,0.000094992145,0.000022094624],"domain_scores_gemma":[0.9997454,0.000044782468,0.000025405365,0.000097644086,0.000069994894,0.000016746631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024862375,0.0006594792,0.00058383273,0.0008654617,0.0002649192,0.00088564324,0.0007055945,0.0005479345,0.011841286],"category_scores_gemma":[0.00073068304,0.00032052587,0.00041471128,0.0012852706,0.00029250508,0.0014041101,0.0008443185,0.0006483251,0.006555849],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023214008,0.00005076925,0.00022561624,0.00013661083,0.000034340632,0.000043935284,0.000023991486,0.013963623,0.13171166,0.014578492,0.00877802,0.8302209],"study_design_scores_gemma":[0.00006185587,0.00040153557,0.0032429872,0.00007158483,0.00016061628,0.0011886967,0.000058618887,0.56040907,0.32817754,0.02859742,0.07754473,0.00008534889],"about_ca_topic_score_codex":0.0004213947,"about_ca_topic_score_gemma":0.00085792114,"teacher_disagreement_score":0.011841286,"about_ca_system_score_codex":0.00023667542,"about_ca_system_score_gemma":0.00025172887,"threshold_uncertainty_score":0.039613068},"labels":[],"label_agreement":null},{"id":"W1681620790","doi":"10.1007/978-3-642-17517-6_20","title":"Simultaneous Interval Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval graph; Combinatorics; Chordal graph; Indifference graph; Pathwidth; Split graph; Cograph; Mathematics; Bipartite graph; Discrete mathematics; Maximal independent set; Interval (graph theory); Vertex (graph theory); 1-planar graph; Graph; Line graph","score_opus":0.015983635976769894,"score_gpt":0.279561506986288,"score_spread":0.2635778710095181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681620790","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.035019666,0.0016742423,0.3647448,0.00066531944,0.00081869337,0.00013519659,0.00064863893,0.0009870336,0.5953064],"genre_scores_gemma":[0.61872494,0.003038182,0.13872783,0.00050504075,0.00085298123,0.0003399717,0.0020919505,0.0008647677,0.23485434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955565,0.00006458824,0.000021357479,0.00014644684,0.00015047262,0.000061497376],"domain_scores_gemma":[0.999255,0.0002577563,0.000057219804,0.00020274692,0.00014167899,0.00008562858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031163532,0.0007400358,0.00049454905,0.0010327322,0.000994911,0.0018961284,0.0011653068,0.0006216339,0.03138552],"category_scores_gemma":[0.0018000776,0.0005772593,0.0007405335,0.0016941709,0.00068235985,0.0032711194,0.0018424558,0.0025164534,0.005283892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054693675,0.000035348676,0.000105203566,0.000098960605,0.000010824583,0.00008640812,0.00014793965,0.001594998,0.0026633032,0.92436063,0.009698977,0.06114274],"study_design_scores_gemma":[0.000016571903,0.000046126093,0.00027000796,0.000036681547,0.000028081355,0.0003093691,0.00010519131,0.0068881717,0.0022977856,0.9211704,0.06881798,0.000013618226],"about_ca_topic_score_codex":0.00035327233,"about_ca_topic_score_gemma":0.00040182754,"teacher_disagreement_score":0.03138552,"about_ca_system_score_codex":0.00056835264,"about_ca_system_score_gemma":0.0003505584,"threshold_uncertainty_score":0.10499501},"labels":[],"label_agreement":null},{"id":"W1683159118","doi":"10.1007/978-3-642-23626-6_74","title":"Active Learning for Interactive 3D Image Segmentation","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":119,"is_retracted":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; Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Image segmentation; Artificial intelligence; Computer vision; Entropy (arrow of time); Scale-space segmentation; Classifier (UML); Machine learning","score_opus":0.02223463709765505,"score_gpt":0.31161180303477765,"score_spread":0.2893771659371226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683159118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067902883,0.00020393364,0.98970604,0.00006340227,0.000020797697,0.00004777304,0.000071605464,0.0022831708,0.0008129205],"genre_scores_gemma":[0.19289096,0.00037882174,0.79911923,0.00018269963,0.00007883897,0.00021634197,0.0004733256,0.0009264574,0.0057332516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992865,0.00015211757,0.00003364045,0.00014708588,0.00029634315,0.00008435178],"domain_scores_gemma":[0.99863714,0.00086559646,0.00006871823,0.00018630788,0.00018339178,0.000058839116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011996547,0.0011980811,0.0015505679,0.0016321796,0.00059383607,0.0015559248,0.0025010365,0.0019497204,0.0071581104],"category_scores_gemma":[0.0023719526,0.0013786979,0.0014192085,0.0014895585,0.0008903039,0.0017038365,0.0023209706,0.0019125693,0.0016524626],"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.000617071,0.00028728737,0.0005516969,0.00024508056,0.00014372062,0.00015742258,0.0002814367,0.20629172,0.06271452,0.009285688,0.005083712,0.7143406],"study_design_scores_gemma":[0.000013010565,0.00003288672,0.00013205984,0.000007669933,0.000010424903,0.000048983125,0.000013922976,0.9816852,0.013007322,0.0036501584,0.0013885933,0.000009724912],"about_ca_topic_score_codex":0.004995492,"about_ca_topic_score_gemma":0.0075347046,"teacher_disagreement_score":0.0071581104,"about_ca_system_score_codex":0.0010346078,"about_ca_system_score_gemma":0.00067830295,"threshold_uncertainty_score":0.023946226},"labels":[],"label_agreement":null},{"id":"W1684552989","doi":"10.1007/978-3-642-41924-9_4","title":"TBIM: A Language for Modeling and Reasoning about Business Plans","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Business rule; Business Process Model and Notation; Business process modeling; Business intelligence; Artifact-centric business process model; Syntax; Knowledge management; Strategic planning; Process management; Modeling language; Software engineering; Business process; Management science; Artificial intelligence; Programming language; Management; Engineering; Work in process; Operations management","score_opus":0.037115946334690675,"score_gpt":0.26412505582034146,"score_spread":0.22700910948565078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1684552989","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.0008077511,0.00025060275,0.97483677,0.00038470505,0.00008778714,0.00021651716,0.006243653,0.013196718,0.003975374],"genre_scores_gemma":[0.022563607,0.0006644359,0.9538183,0.0004034853,0.00007024259,0.00076491456,0.0138698025,0.0026223296,0.0052228547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799573,0.0005034153,0.0004756185,0.0003001006,0.00057498465,0.00015018867],"domain_scores_gemma":[0.99787235,0.0010071483,0.00019962249,0.0004940752,0.00031603288,0.00011077623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028037534,0.0021740154,0.0013223813,0.0035717594,0.0014856063,0.0066930256,0.005322384,0.002128885,0.01956819],"category_scores_gemma":[0.007051675,0.0025500306,0.004194095,0.0039109485,0.0019186501,0.010201695,0.003916391,0.0052199326,0.008011285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017546887,0.00012351573,0.0010794363,0.0015334217,0.00013414885,0.0005252856,0.0015033648,0.03840666,0.0027912986,0.7069358,0.091305695,0.1554859],"study_design_scores_gemma":[0.000094107345,0.00004247381,0.00019465438,0.00044818007,0.00011535178,0.000363343,0.00031335044,0.19636233,0.0052256864,0.42580768,0.37094358,0.00008930712],"about_ca_topic_score_codex":0.017205229,"about_ca_topic_score_gemma":0.019307964,"teacher_disagreement_score":0.01956819,"about_ca_system_score_codex":0.0023193238,"about_ca_system_score_gemma":0.0037985155,"threshold_uncertainty_score":0.06546205},"labels":[],"label_agreement":null},{"id":"W1684557515","doi":"10.1007/978-3-642-34481-7_41","title":"A Novel Hierarchical Statistical Model for Count Data Modeling and Its Application in Image Classification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Statistical model; Hierarchical database model; Dirichlet distribution; Artificial intelligence; Machine learning; Data modeling; Data mining; Hierarchical Dirichlet process; Point (geometry); Latent Dirichlet allocation; Pattern recognition (psychology); Topic model; Mathematics","score_opus":0.07714903070317498,"score_gpt":0.3176949385274694,"score_spread":0.2405459078242944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1684557515","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.002070436,0.00012981267,0.9969387,0.00010621741,0.000037167774,0.000034648467,0.00017510938,0.00028947188,0.00021854235],"genre_scores_gemma":[0.18921545,0.0011527755,0.79497766,0.00056173326,0.00057500147,0.001240708,0.0031584527,0.000625157,0.008493054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954039,0.0018061178,0.000343082,0.0009872444,0.0011554359,0.00030432665],"domain_scores_gemma":[0.98653513,0.00903678,0.0010190086,0.0016583166,0.0015162963,0.00023445055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006705619,0.0012105792,0.0026266987,0.0024144426,0.0011208566,0.0022150613,0.0070378324,0.0023887805,0.0037778337],"category_scores_gemma":[0.022984607,0.0012918771,0.0030250854,0.005245889,0.0014162706,0.003986361,0.0020437993,0.003344709,0.0020195856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022598289,0.00031818374,0.004721565,0.0003978543,0.00038095028,0.00027779173,0.0004608809,0.4903033,0.0044979476,0.23814665,0.012243953,0.24802491],"study_design_scores_gemma":[0.0000050690082,0.0000193646,0.00026003912,0.000009902532,0.000024965671,0.00004133018,0.000008763307,0.9794622,0.0002016566,0.019191934,0.0007590797,0.000015697507],"about_ca_topic_score_codex":0.013396807,"about_ca_topic_score_gemma":0.016230136,"teacher_disagreement_score":0.013396807,"about_ca_system_score_codex":0.001816669,"about_ca_system_score_gemma":0.0023880124,"threshold_uncertainty_score":0.035463095},"labels":[],"label_agreement":null},{"id":"W1684877896","doi":"10.1007/978-3-642-33826-7_18","title":"Efficient Probabilistic Abstraction for SysML Activity Diagrams","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Soundness; Systems Modeling Language; Computer science; Probabilistic logic; Activity diagram; Theoretical computer science; Probabilistic CTL; Model checking; Semantics (computer science); Abstraction; Property (philosophy); Computation tree logic; Relation (database); Programming language; Unified Modeling Language; Probabilistic analysis of algorithms; Data mining; Artificial intelligence; Software","score_opus":0.0424621177752026,"score_gpt":0.2900711261308994,"score_spread":0.24760900835569682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1684877896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018721041,0.000058980266,0.99537814,0.000026449397,0.00001040218,0.000036083427,0.0001221673,0.0020406805,0.00045495317],"genre_scores_gemma":[0.15276678,0.0003533571,0.8396179,0.0000615823,0.000047887723,0.0002409893,0.0015888413,0.0011518324,0.0041709263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956939,0.0009675794,0.00033447612,0.00047487376,0.0021877182,0.0003413718],"domain_scores_gemma":[0.9929074,0.0036695132,0.0004535433,0.0019803979,0.0008259039,0.00016316779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025416284,0.0012155239,0.0013424691,0.0019062725,0.00068059104,0.0026080678,0.0023470502,0.0008822616,0.007216371],"category_scores_gemma":[0.010606807,0.0014486043,0.002693348,0.0020228385,0.0009963443,0.0044146692,0.004287872,0.0027096688,0.0021431972],"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.00037194297,0.0001412034,0.0015291764,0.00070850254,0.00012006953,0.00025092438,0.000629938,0.20237331,0.012966211,0.2211719,0.0074634114,0.55227333],"study_design_scores_gemma":[0.000041710486,0.000042726544,0.00036843494,0.000067368455,0.00006430637,0.0001531514,0.000055922585,0.7792821,0.008132034,0.19790505,0.013849701,0.000037542784],"about_ca_topic_score_codex":0.0031893523,"about_ca_topic_score_gemma":0.007245014,"teacher_disagreement_score":0.007216371,"about_ca_system_score_codex":0.0013396326,"about_ca_system_score_gemma":0.0020953016,"threshold_uncertainty_score":0.024141133},"labels":[],"label_agreement":null},{"id":"W1685146252","doi":"10.1007/3-540-36261-4_21","title":"Noema: A Metalanguage for Scripting Versionable Hypertexts","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metalanguage; Computer science; Hypertext; Scripting language; XML; Unification; Programming language; World Wide Web; Information retrieval","score_opus":0.026938322935195845,"score_gpt":0.2380524784685929,"score_spread":0.21111415553339705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1685146252","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.0037682003,0.00017523716,0.95895046,0.00014121342,0.00012259501,0.00008540459,0.00039318606,0.028980888,0.007382874],"genre_scores_gemma":[0.1471211,0.00091839506,0.781614,0.00045189986,0.00018617304,0.0006004623,0.00253952,0.01830117,0.04826732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00017127827,0.00017489612,0.00021619993,0.00024991768,0.00009020258],"domain_scores_gemma":[0.99841285,0.00069510884,0.000106394764,0.0005679506,0.00011299275,0.000104710205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013244653,0.0011227807,0.00082101923,0.0006017723,0.00078051176,0.0031852105,0.0028256893,0.0010164536,0.012700255],"category_scores_gemma":[0.0034148605,0.0014026092,0.0013770814,0.0006468105,0.0017470579,0.0063002165,0.0037433289,0.0025101677,0.004498156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034471104,0.00013963807,0.00084752985,0.00091837376,0.00008139418,0.00068173587,0.0019125517,0.014230952,0.024899133,0.6236729,0.04328495,0.28898612],"study_design_scores_gemma":[0.00016465329,0.00010874141,0.00037269696,0.00028724398,0.00009498598,0.0012531987,0.00016601688,0.08813904,0.040019505,0.46367326,0.40558216,0.00013846936],"about_ca_topic_score_codex":0.0005943281,"about_ca_topic_score_gemma":0.00093865243,"teacher_disagreement_score":0.012700255,"about_ca_system_score_codex":0.00053579325,"about_ca_system_score_gemma":0.0007060657,"threshold_uncertainty_score":0.042486608},"labels":[],"label_agreement":null},{"id":"W1685415006","doi":"10.1007/978-3-540-30582-8_7","title":"Experience with Engineering a Network Forensics System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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 Victoria","funders":"","keywords":"Network forensics; Computer science; Network security; Field (mathematics); Digital forensics; Computer forensics; Computer security; Network packet; State (computer science); Network monitoring; Criminal investigation; Data science; Computer network","score_opus":0.00785900703950436,"score_gpt":0.21188701693488282,"score_spread":0.20402800989537845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1685415006","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.5559164,0.006395111,0.27737793,0.0062944815,0.00071007706,0.0006447931,0.00020354043,0.0026240963,0.14983347],"genre_scores_gemma":[0.73807883,0.006656136,0.17288946,0.0011403804,0.00023883779,0.00011223101,0.00042958095,0.00074084336,0.079713576],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972447,0.0010453002,0.00013086024,0.00027190355,0.0010037418,0.0003034854],"domain_scores_gemma":[0.9937882,0.002346248,0.00020862032,0.00092408527,0.0015298363,0.0012030773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054489826,0.00095382973,0.00039192665,0.0008185129,0.0022568882,0.002967753,0.0015815173,0.0016551693,0.0064896406],"category_scores_gemma":[0.009909248,0.0004155205,0.0003429763,0.0006542899,0.0015216745,0.004280919,0.0020438335,0.002286875,0.0022177799],"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.00026769398,0.0027329822,0.007992342,0.00042793696,0.000047005484,0.0017126279,0.01717566,0.0084586805,0.030205393,0.014004629,0.016608048,0.900367],"study_design_scores_gemma":[0.00016536558,0.009763113,0.012762331,0.0008627819,0.00024151056,0.015127255,0.022794621,0.03473665,0.14512248,0.029995276,0.7281699,0.0002586411],"about_ca_topic_score_codex":0.0017818139,"about_ca_topic_score_gemma":0.0034453524,"teacher_disagreement_score":0.0064896406,"about_ca_system_score_codex":0.0011871476,"about_ca_system_score_gemma":0.001855588,"threshold_uncertainty_score":0.028817296},"labels":[],"label_agreement":null},{"id":"W1688130520","doi":"10.1007/3-540-39568-7_21","title":"A Fast Pseudo Random Permutation Generator With Applications to Cryptology","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Queen's University","funders":"","keywords":"Permutation (music); Random permutation; Sequence (biology); Pseudorandom number generator; Cryptography; Random sequence; Generator (circuit theory); Random number generation; Computer science; Mathematics; Discrete mathematics; Algorithm; Combinatorics; Physics; Symmetric group","score_opus":0.015654088069899565,"score_gpt":0.25421091414589386,"score_spread":0.2385568260759943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1688130520","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.0059341276,0.0008653653,0.9756377,0.00065616175,0.00055802264,0.00016882409,0.00014043337,0.0010443446,0.014995092],"genre_scores_gemma":[0.17483805,0.0018565449,0.76995337,0.00067192805,0.0015824871,0.00063132576,0.00046275678,0.00066752074,0.049336106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991111,0.0003284812,0.000041421612,0.000098655975,0.00036494515,0.000055385124],"domain_scores_gemma":[0.9983626,0.00088550616,0.00008151264,0.0004041781,0.00019555583,0.00007068183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010036688,0.0009784419,0.0008319411,0.0012504916,0.0008009768,0.0013365835,0.001013726,0.0014091226,0.008029779],"category_scores_gemma":[0.0033155885,0.0004444532,0.00067413657,0.0016478561,0.0013817449,0.0026036631,0.001968479,0.0017986197,0.0037221522],"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.00018353458,0.00006917679,0.00018730624,0.00013881159,0.000024138062,0.0003016832,0.00008947815,0.023101876,0.0076144896,0.7164926,0.013796122,0.23800075],"study_design_scores_gemma":[0.00012029435,0.00021462629,0.0001593079,0.000059836486,0.000037530124,0.001495831,0.000022787193,0.23717569,0.011570267,0.69051,0.058558274,0.00007562021],"about_ca_topic_score_codex":0.00016190602,"about_ca_topic_score_gemma":0.00025829044,"teacher_disagreement_score":0.008029779,"about_ca_system_score_codex":0.00048244488,"about_ca_system_score_gemma":0.0007804281,"threshold_uncertainty_score":0.026862323},"labels":[],"label_agreement":null},{"id":"W168837927","doi":"10.1007/bfb0028175","title":"$$\\mathcal{R}\\mathcal{E}\\mathcal{S}$$ : A formalism for reasoning with relative-strength defaults","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Guelph","funders":"","keywords":"Formalism (music); Combinatorics; Consistency (knowledge bases); Physics; Mathematics; Discrete mathematics","score_opus":0.015698362619593356,"score_gpt":0.24448246209623148,"score_spread":0.22878409947663814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168837927","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.0017321677,0.0005487196,0.9525348,0.002105417,0.00030896754,0.000096958356,0.0011198486,0.004142162,0.037411004],"genre_scores_gemma":[0.09181888,0.0013488384,0.8679948,0.001701401,0.0004526867,0.00041896093,0.001842139,0.0028851044,0.031537198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981376,0.00070093415,0.00019213639,0.0003841251,0.0004475727,0.00013754015],"domain_scores_gemma":[0.99829775,0.00077722064,0.00013546544,0.00047149538,0.00023027473,0.00008780027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035204461,0.0015352088,0.0014158982,0.002689832,0.0025313257,0.007922276,0.0054265214,0.003572294,0.034363117],"category_scores_gemma":[0.0049406732,0.0022766676,0.0030263367,0.00272312,0.0051627057,0.019304605,0.00541266,0.006838536,0.009788122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016950498,0.000011318484,0.000043528806,0.00006875553,0.000007840937,0.000043824002,0.00019963647,0.00058109965,0.0003691965,0.97137547,0.0109473895,0.016335038],"study_design_scores_gemma":[0.00001548848,0.0000053496287,0.000034683406,0.000056573845,0.00001553601,0.0001180617,0.000059846167,0.007922849,0.0008703315,0.9373528,0.053519823,0.00002866752],"about_ca_topic_score_codex":0.0044058464,"about_ca_topic_score_gemma":0.0069348277,"teacher_disagreement_score":0.034363117,"about_ca_system_score_codex":0.0025308887,"about_ca_system_score_gemma":0.0017825817,"threshold_uncertainty_score":0.11495608},"labels":[],"label_agreement":null},{"id":"W1688446120","doi":"10.1007/978-3-540-88313-5_27","title":"Exploring User Reactions to New Browser Cues for Extended Validation Certificates","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; World Wide Web; The Internet; Web browser; User interface; Interface (matter); Rich Internet application; User interface design; Human–computer interaction; User experience design; Operating system","score_opus":0.12497874886260057,"score_gpt":0.28038317074323155,"score_spread":0.15540442188063097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1688446120","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.99251103,0.00008613664,0.0028651396,0.000090329675,0.000017058024,0.000030852938,0.00012360139,0.00036663326,0.003909205],"genre_scores_gemma":[0.9957094,0.00004503671,0.0024861428,0.00006909328,0.000008994869,0.000015937956,0.00015386853,0.00013482985,0.0013766121],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991019,0.00044866736,0.00003346099,0.000111508874,0.00021499967,0.00008946738],"domain_scores_gemma":[0.98378664,0.013710026,0.00076534733,0.0006085612,0.0005950285,0.00053442054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011179917,0.00042235487,0.00036809573,0.00045365814,0.00042607725,0.0023125075,0.00044982048,0.0011606496,0.005424586],"category_scores_gemma":[0.02208149,0.0002619969,0.00021515058,0.00027432258,0.00027409932,0.002368313,0.0012062398,0.0010226541,0.00084962766],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015844937,0.001963105,0.3038391,0.0016234517,0.00028875223,0.004894932,0.1506343,0.0047157425,0.27919707,0.0070401863,0.012563471,0.21739501],"study_design_scores_gemma":[0.0004507925,0.00475957,0.6060367,0.0007514408,0.000759269,0.0053983345,0.1012427,0.15692955,0.06620949,0.011001364,0.045774862,0.0006858648],"about_ca_topic_score_codex":0.0010387023,"about_ca_topic_score_gemma":0.0015456238,"teacher_disagreement_score":0.005424586,"about_ca_system_score_codex":0.000285796,"about_ca_system_score_gemma":0.00020104846,"threshold_uncertainty_score":0.018147051},"labels":[],"label_agreement":null},{"id":"W1689232663","doi":"10.1007/978-3-642-38164-5_7","title":"On the Theory of Composition in Physics","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Perimeter Institute","funders":"","keywords":"Axiom; Object (grammar); Notation; Composition (language); Spacetime; Context (archaeology); Independence (probability theory); Mathematics; State (computer science); Class (philosophy); Computer science; Pure mathematics; Algorithm; Physics; Artificial intelligence; Geometry; Quantum mechanics","score_opus":0.01396564624015787,"score_gpt":0.2312193308617357,"score_spread":0.21725368462157785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1689232663","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.012077153,0.036101677,0.34058622,0.0072338525,0.0048339623,0.000078469195,0.00024775046,0.0003795704,0.59846145],"genre_scores_gemma":[0.4269275,0.04769867,0.23086403,0.0042905356,0.010087617,0.0004472529,0.000862719,0.0008384701,0.27798328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994006,0.00023195751,0.000033631364,0.00008569155,0.00019170315,0.000056399927],"domain_scores_gemma":[0.9995908,0.00022409944,0.000022634944,0.000064153115,0.00006499023,0.000033417462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377443,0.0009988291,0.0010770741,0.0014777024,0.0017806692,0.0028866741,0.0012680207,0.0013440517,0.009148125],"category_scores_gemma":[0.0014563245,0.0006811452,0.0012050661,0.0019869846,0.007004007,0.007926789,0.0021420687,0.0042034253,0.002307764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023977805,0.0000029662028,0.0000109953435,0.000020539399,0.0000020404268,0.000008817439,0.00004910006,0.00014314282,0.000067224886,0.99482805,0.001210792,0.0036539014],"study_design_scores_gemma":[0.0000019711422,0.00000246511,0.000015994347,0.000012094555,0.0000014440244,0.00002148276,0.0000108904005,0.00037246305,0.000050210972,0.98879725,0.010711414,0.0000022814374],"about_ca_topic_score_codex":0.0011526067,"about_ca_topic_score_gemma":0.0012290464,"teacher_disagreement_score":0.009148125,"about_ca_system_score_codex":0.0014769862,"about_ca_system_score_gemma":0.0009370132,"threshold_uncertainty_score":0.030603528},"labels":[],"label_agreement":null},{"id":"W1689287514","doi":"10.1007/978-3-642-25873-2_34","title":"Optimal Instrumentation of Data-flow in Concurrent Data Structures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Instrumentation (computer programming); Observability; Debugging; Set (abstract data type); Data flow diagram; Programming language; Data structure; Debugger; TRACE (psycholinguistics); Algorithm; Real-time computing; Database","score_opus":0.06410625513981336,"score_gpt":0.3004619759425863,"score_spread":0.23635572080277292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1689287514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034647044,0.0003311935,0.96138364,0.00016908952,0.000052088577,0.000041123407,0.0000316575,0.0016698312,0.0016743599],"genre_scores_gemma":[0.7627129,0.00030926743,0.23521309,0.00007804694,0.000060307757,0.000089834386,0.000089053385,0.00028270006,0.0011648323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972487,0.0007008431,0.00015656576,0.00043175096,0.0009801639,0.00048189927],"domain_scores_gemma":[0.9918447,0.0049866796,0.0005108347,0.0018486858,0.00057218136,0.00023702614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020715876,0.00071791856,0.00114476,0.000736111,0.00086178456,0.0014642571,0.0016560607,0.0009881068,0.0017153494],"category_scores_gemma":[0.011050618,0.0009358998,0.0005150941,0.0008989041,0.0019310585,0.0025364114,0.0030756725,0.001974806,0.0003137552],"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.0019159948,0.00037532378,0.0028229114,0.00043747737,0.000055610755,0.00013019684,0.00047476962,0.28753448,0.08654249,0.13586828,0.0024989233,0.4813436],"study_design_scores_gemma":[0.0000873094,0.00015877865,0.000359251,0.00003983532,0.000027465134,0.000055861656,0.000053066702,0.85821235,0.041313313,0.097752295,0.0019141936,0.000026269468],"about_ca_topic_score_codex":0.0011372312,"about_ca_topic_score_gemma":0.0012993284,"teacher_disagreement_score":0.0020715876,"about_ca_system_score_codex":0.0015283825,"about_ca_system_score_gemma":0.0020255367,"threshold_uncertainty_score":0.011089265},"labels":[],"label_agreement":null},{"id":"W1690451494","doi":"10.1007/978-3-540-69132-7_76","title":"Enabling Reputation-Based Trust in Privacy-Enhanced Learning Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Saskatchewan","funders":"","keywords":"Computer science; Reputation; Computer security; Information privacy; Internet privacy; Human–computer interaction; Law","score_opus":0.0258058138966333,"score_gpt":0.2566142604271524,"score_spread":0.2308084465305191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1690451494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04660459,0.0006366503,0.9390209,0.0017097592,0.0001750124,0.00012548672,0.00007333682,0.0010402519,0.010614052],"genre_scores_gemma":[0.93204004,0.0002668123,0.061618,0.00011414429,0.00010428033,0.00005221493,0.000065944194,0.000076246055,0.0056622857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932121,0.002614875,0.00050296704,0.000966237,0.0018938562,0.0008100286],"domain_scores_gemma":[0.98122,0.00851418,0.0014199045,0.005882604,0.0020883617,0.00087487284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066162734,0.0005408548,0.0012422783,0.00055216305,0.0015566932,0.005610669,0.0032221673,0.0026587066,0.0038022213],"category_scores_gemma":[0.025111888,0.0006618892,0.0008542097,0.00077467127,0.0021793854,0.011550046,0.006832735,0.004109646,0.001302841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009865145,0.0005585133,0.0024699394,0.00039546043,0.00018872505,0.00078930566,0.0018001497,0.18223834,0.016629023,0.5888701,0.008258465,0.19681548],"study_design_scores_gemma":[0.00006667769,0.00016114878,0.00037861083,0.000036623118,0.00005344969,0.0003072537,0.00015891813,0.7220615,0.010217873,0.25923854,0.0072527365,0.00006670859],"about_ca_topic_score_codex":0.0010120036,"about_ca_topic_score_gemma":0.0009359804,"teacher_disagreement_score":0.0066162734,"about_ca_system_score_codex":0.001595944,"about_ca_system_score_gemma":0.0013929557,"threshold_uncertainty_score":0.03499067},"labels":[],"label_agreement":null},{"id":"W1690630723","doi":"10.1007/11809678_23","title":"Enumerating Non-crossing Minimally Rigid Frameworks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Structural Analysis and Optimization","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Point (geometry); Set (abstract data type); Enhanced Data Rates for GSM Evolution; Space (punctuation); Property (philosophy); Graph; Algorithm; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Artificial intelligence; Geometry; Programming language","score_opus":0.005541863286996418,"score_gpt":0.20735515293842308,"score_spread":0.20181328965142667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1690630723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14001197,0.0010523074,0.76964283,0.00072826724,0.0002027145,0.00014970267,0.0014888778,0.002065106,0.08465824],"genre_scores_gemma":[0.5181121,0.0010917004,0.4414364,0.0002911216,0.00012111573,0.000298455,0.0040752487,0.0012449889,0.033328842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988881,0.00019679597,0.00007438454,0.00020876745,0.0004194756,0.00021248341],"domain_scores_gemma":[0.9972451,0.0016608856,0.00016137159,0.0004887871,0.0002796901,0.00016422904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297715,0.0011581607,0.0013562933,0.002524213,0.0018725288,0.0024676989,0.0029310668,0.0016711736,0.01634272],"category_scores_gemma":[0.006458363,0.0010102667,0.0015705625,0.003174472,0.0017011557,0.005459096,0.0044481875,0.0038979945,0.0018907207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072764364,0.000067021014,0.00051997264,0.00030799632,0.000023541807,0.00011102035,0.00027170006,0.025627656,0.0023868836,0.8797792,0.0071552484,0.083676904],"study_design_scores_gemma":[0.000009496713,0.000020567804,0.00014663201,0.000047227855,0.000017558685,0.00014358897,0.00009446026,0.03543801,0.0010230811,0.9568611,0.0061818482,0.000016394379],"about_ca_topic_score_codex":0.0011606142,"about_ca_topic_score_gemma":0.0028973636,"teacher_disagreement_score":0.01634272,"about_ca_system_score_codex":0.0011121777,"about_ca_system_score_gemma":0.0008389078,"threshold_uncertainty_score":0.054671884},"labels":[],"label_agreement":null},{"id":"W169165923","doi":"10.1007/978-3-642-54426-2_6","title":"Mining Multiple Related Data Sources Using Object-Oriented Model","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; Class hierarchy; Joins; Data mining; Database; Object (grammar); Inheritance (genetic algorithm); Theoretical computer science; Object-oriented programming; Artificial intelligence; Programming language","score_opus":0.0452442112778649,"score_gpt":0.27486780110831577,"score_spread":0.22962358983045086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169165923","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.04199513,0.0019700206,0.94687605,0.0006811846,0.0001656117,0.0006125614,0.0019443246,0.0035943605,0.002160712],"genre_scores_gemma":[0.13896821,0.0014433557,0.8502812,0.0003168283,0.000107720385,0.00035961042,0.006191548,0.00025725062,0.0020743043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662507,0.00037898045,0.00044115377,0.0006487843,0.0017540188,0.0001519312],"domain_scores_gemma":[0.99638355,0.0016606731,0.00046002772,0.00054174097,0.00081229233,0.00014164759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028390249,0.0017150008,0.0018281197,0.010280574,0.0013246628,0.0044348324,0.003175794,0.0014343965,0.0011860004],"category_scores_gemma":[0.0066978238,0.00096835184,0.0034315474,0.012763279,0.00058371614,0.0047900407,0.0023739494,0.0012990594,0.00084179046],"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.0006781153,0.0010674419,0.041056108,0.0014890685,0.0014754726,0.00368285,0.0009956363,0.034281302,0.014258649,0.025710708,0.013570413,0.86173415],"study_design_scores_gemma":[0.00018908372,0.00030036716,0.009753327,0.0004706226,0.0017973927,0.0025169984,0.0009827152,0.8249326,0.020404158,0.10583638,0.03266045,0.00015589272],"about_ca_topic_score_codex":0.004063056,"about_ca_topic_score_gemma":0.005796151,"teacher_disagreement_score":0.010280574,"about_ca_system_score_codex":0.0008945069,"about_ca_system_score_gemma":0.0019626066,"threshold_uncertainty_score":0.01501441},"labels":[],"label_agreement":null},{"id":"W1692527761","doi":"10.1007/978-3-540-72990-7_15","title":"Stable and Robust Multipath Oblivious Routing for Traffic Engineering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Multipath routing; Robustness (evolution); Computer network; Routing (electronic design automation); Adversary; Multipath propagation; Internet service provider; Traffic engineering; The Internet; Distributed computing; Static routing; Routing protocol; Computer security; World Wide Web","score_opus":0.020784215122355485,"score_gpt":0.22999736170754526,"score_spread":0.20921314658518977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1692527761","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015462214,0.00033053127,0.9779885,0.00016951968,0.00007140009,0.000047400747,0.000050745395,0.00086728873,0.005012397],"genre_scores_gemma":[0.74843293,0.000606317,0.23462653,0.000119809156,0.00017682361,0.00016382796,0.00016456361,0.00041903794,0.015290181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924195,0.00015634073,0.000036981924,0.00012388722,0.00035537253,0.000085567044],"domain_scores_gemma":[0.99830014,0.0006871532,0.00015525271,0.0006343169,0.0001806688,0.000042474992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069053983,0.000798924,0.00070305425,0.00067337725,0.0005612203,0.0010853565,0.0011355538,0.0006776107,0.0024159923],"category_scores_gemma":[0.0035333252,0.00041753365,0.00048915,0.0007663552,0.0011934498,0.0015095538,0.0015192254,0.0017876695,0.000678078],"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.0003274789,0.00007933395,0.00032162943,0.00015640646,0.0000769603,0.00011393297,0.00014068524,0.29342604,0.041125655,0.46881735,0.0056821266,0.18973237],"study_design_scores_gemma":[0.000022318398,0.0000886545,0.00014139387,0.000014358454,0.000023360459,0.0001096048,0.0000167941,0.6557692,0.0145530095,0.32526812,0.003969188,0.00002398222],"about_ca_topic_score_codex":0.00037337412,"about_ca_topic_score_gemma":0.0004693636,"teacher_disagreement_score":0.0024159923,"about_ca_system_score_codex":0.0007848439,"about_ca_system_score_gemma":0.0006473353,"threshold_uncertainty_score":0.008082271},"labels":[],"label_agreement":null},{"id":"W1695321205","doi":"10.1007/978-3-540-89646-3_1","title":"SUNVIZ: A Real-Time Visualization Environment for Space Physics Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Solar and Space Plasma Dynamics","field":"Physics and Astronomy","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":"Computer science; Graphics processing unit; Graphics; Computer graphics (images); Visualization; CUDA; Computational science; Real-time simulation; Event (particle physics); Space time; Simulation; Real-time computing; Parallel computing; Artificial intelligence; Physics; Astrophysics","score_opus":0.0088637167153218,"score_gpt":0.23346651879964322,"score_spread":0.22460280208432143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695321205","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074631483,0.0010324619,0.5540797,0.00053883996,0.0005136663,0.00026633282,0.016582865,0.40164146,0.017881563],"genre_scores_gemma":[0.12423578,0.00374198,0.6531478,0.0013271887,0.00040242582,0.0013927985,0.039668437,0.12172066,0.054362833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999688,0.000038008988,0.000023764875,0.000048987113,0.00016065902,0.000040585495],"domain_scores_gemma":[0.99946755,0.00021832372,0.0000313232,0.00007807002,0.00011778681,0.000086903325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066935684,0.0021609704,0.00096532033,0.0014099691,0.00048507075,0.0022067619,0.0026163554,0.00090149784,0.060832273],"category_scores_gemma":[0.0015599323,0.001085679,0.0010610522,0.0009517704,0.00030232823,0.0020473015,0.0019591928,0.00203954,0.011615145],"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.0012196156,0.00018175467,0.0012719155,0.0015863033,0.00030256747,0.00058365974,0.0009162269,0.014951941,0.043683667,0.012956247,0.59929484,0.32305127],"study_design_scores_gemma":[0.0008669483,0.00014492485,0.002802881,0.00033610186,0.00026081098,0.0008845483,0.00018551927,0.20968938,0.08450103,0.026771422,0.67320526,0.0003511584],"about_ca_topic_score_codex":0.0031561537,"about_ca_topic_score_gemma":0.00523596,"teacher_disagreement_score":0.060832273,"about_ca_system_score_codex":0.00041105069,"about_ca_system_score_gemma":0.00064676,"threshold_uncertainty_score":0.20350426},"labels":[],"label_agreement":null},{"id":"W1695582736","doi":"10.1007/3-540-45537-x_18","title":"Fast Normal Basis Multiplication Using General Purpose Processors","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Normal basis; Multiplication (music); Basis (linear algebra); Finite field; Multiplication algorithm; Flexibility (engineering); Software; Cryptography; Parallel computing; Field (mathematics); Binary number; Arithmetic; Algorithm; Galois theory; Mathematics; Operating system","score_opus":0.017131413844928674,"score_gpt":0.24579148593496353,"score_spread":0.22866007209003486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695582736","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.04953779,0.0030224214,0.8449912,0.0003048335,0.0006761927,0.000107535096,0.00014335832,0.0057466263,0.09547006],"genre_scores_gemma":[0.3988314,0.003145918,0.48184493,0.00021709265,0.00037104826,0.00013678511,0.0006631236,0.00083653384,0.113953315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.000059629216,0.000014844528,0.00003753437,0.00012440224,0.000039298633],"domain_scores_gemma":[0.9996674,0.00009349522,0.000014395667,0.00011465384,0.000091794915,0.000018235964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036441025,0.0009960918,0.0006408726,0.000734993,0.00044350882,0.0010894814,0.00065606827,0.00041891847,0.012817666],"category_scores_gemma":[0.0009252791,0.00036369637,0.00037412235,0.0012175912,0.00048027388,0.0021432461,0.00084642984,0.00090471265,0.0058112503],"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.00046916085,0.00008572914,0.0003330078,0.00039272592,0.000039235587,0.00022096545,0.00023073323,0.008578398,0.04151353,0.21946022,0.02269208,0.7059842],"study_design_scores_gemma":[0.00022615807,0.000654897,0.0010606919,0.00019468676,0.00012963542,0.0023086455,0.000118042495,0.14853786,0.11964937,0.516995,0.2100169,0.00010807569],"about_ca_topic_score_codex":0.00022455808,"about_ca_topic_score_gemma":0.0004617753,"teacher_disagreement_score":0.012817666,"about_ca_system_score_codex":0.00039188616,"about_ca_system_score_gemma":0.00043571176,"threshold_uncertainty_score":0.042879343},"labels":[],"label_agreement":null},{"id":"W1695785650","doi":"10.1007/978-3-642-04383-3_18","title":"On the Trade-Off between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Privacy protection; Privacy software; Wireless sensor network; Information privacy; Computer network; Computer security; Internet privacy","score_opus":0.017104995809997643,"score_gpt":0.24103196454377052,"score_spread":0.22392696873377288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695785650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06084339,0.019478368,0.86956716,0.014131154,0.0005139272,0.00016931818,0.00036947627,0.00027105756,0.03465627],"genre_scores_gemma":[0.85794,0.014717933,0.112981424,0.0014783931,0.0012666995,0.00024571424,0.0002565337,0.0003109474,0.01080241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9843277,0.008511978,0.00073087437,0.0016528483,0.0036491165,0.0011275016],"domain_scores_gemma":[0.91873294,0.07196692,0.0016900853,0.005584382,0.0015245362,0.0005010261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015962597,0.0014794264,0.0033505396,0.0011115739,0.0019561576,0.007264961,0.0047977413,0.0048152655,0.004944996],"category_scores_gemma":[0.04937491,0.0015902102,0.0014328565,0.0036042794,0.008910798,0.027558463,0.006541889,0.0077179307,0.0006976786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076800433,0.000106480446,0.0016422753,0.00060480356,0.0001500713,0.000265912,0.0006604927,0.1471049,0.0031880958,0.76510036,0.0052402844,0.07516836],"study_design_scores_gemma":[0.000053252337,0.00012791736,0.0004712866,0.00013398365,0.00006492733,0.00040609855,0.00021149444,0.2828781,0.0016726678,0.7108792,0.003051448,0.00004956516],"about_ca_topic_score_codex":0.0011213789,"about_ca_topic_score_gemma":0.0013733938,"teacher_disagreement_score":0.015962597,"about_ca_system_score_codex":0.0042395513,"about_ca_system_score_gemma":0.0015255241,"threshold_uncertainty_score":0.08441931},"labels":[],"label_agreement":null},{"id":"W169624009","doi":"10.1007/978-3-642-31284-7_21","title":"A General Construction for 1-Round δ-RMT and (0, δ)-SMT","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Communication source; Computer science; Message authentication code; Reliability (semiconductor); Computer network; Disjoint sets; Node (physics); Transmission (telecommunications); Adversary; Authentication (law); Protocol (science); Theoretical computer science; Mathematical proof; Power (physics); Cryptography; Algorithm; Computer security; Mathematics; Discrete mathematics; Engineering; Telecommunications","score_opus":0.017436051969349727,"score_gpt":0.24401483039975455,"score_spread":0.22657877843040483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169624009","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.025044382,0.0006351291,0.8883056,0.0013998689,0.000684461,0.0005478694,0.0011013999,0.005088117,0.07719322],"genre_scores_gemma":[0.42808527,0.0006546776,0.482008,0.0010799811,0.00044158826,0.0010684995,0.001593517,0.0016674501,0.08340104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982692,0.00031952743,0.00012761334,0.00039448863,0.00047646192,0.00041271796],"domain_scores_gemma":[0.99855286,0.00031195444,0.00008101718,0.00081307394,0.0001400703,0.000100916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012803839,0.000979194,0.0010981074,0.0007416005,0.0021608039,0.0025633092,0.0021370132,0.0019919986,0.022825103],"category_scores_gemma":[0.0027159331,0.000957216,0.0017526787,0.0014418076,0.0019159293,0.0052481014,0.0053502168,0.0030529539,0.007579676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025086483,0.00006692106,0.00025943358,0.00025995343,0.000033528613,0.00021390776,0.00025415208,0.0058377045,0.014225315,0.9064261,0.014439214,0.05773293],"study_design_scores_gemma":[0.00011462677,0.00016806132,0.00046699974,0.00009651051,0.00010171866,0.0006872892,0.000095511285,0.03399096,0.020424424,0.87102234,0.0726953,0.00013614759],"about_ca_topic_score_codex":0.00051673996,"about_ca_topic_score_gemma":0.00088305847,"teacher_disagreement_score":0.022825103,"about_ca_system_score_codex":0.0015460852,"about_ca_system_score_gemma":0.0016550063,"threshold_uncertainty_score":0.07635754},"labels":[],"label_agreement":null},{"id":"W1696465846","doi":"10.1007/11940128_19","title":"Diamond Triangulations Contain Spanners of Bounded Degree","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Spanner; Delaunay triangulation; Combinatorics; Degree (music); Bounded function; Unit disk graph; Constant (computer programming); Vertex (graph theory); Upper and lower bounds; Mathematics; Point set triangulation; Minimum-weight triangulation; Graph; Triangulation; Diamond; Discrete mathematics; Constrained Delaunay triangulation; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.026387853484134163,"score_gpt":0.2528272845939513,"score_spread":0.22643943110981715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696465846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16615513,0.0018479357,0.6634383,0.00060345733,0.00066143397,0.00018595958,0.0016336773,0.0019567183,0.16351736],"genre_scores_gemma":[0.6206068,0.001256303,0.28452677,0.0002545764,0.00012225115,0.00013122527,0.0022090755,0.0011482796,0.08974476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947625,0.000059570953,0.000031643114,0.000119398115,0.00022448828,0.00008858372],"domain_scores_gemma":[0.99861264,0.00058674865,0.00011055772,0.0002903769,0.0002550856,0.00014452307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003071425,0.00070620026,0.0010762428,0.0016172287,0.0007782365,0.0016318145,0.001148611,0.0011627018,0.013450977],"category_scores_gemma":[0.0027163154,0.00093417894,0.00049962936,0.0013026351,0.00077008764,0.0022435992,0.002567526,0.0022328917,0.0034216226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048621756,0.000091749425,0.0014397284,0.0006286706,0.00004466519,0.00074579625,0.0006804912,0.021067891,0.026614403,0.7700817,0.018632995,0.15948568],"study_design_scores_gemma":[0.00012117222,0.00015814601,0.0012950095,0.00024477765,0.000047808433,0.0017123119,0.0005819068,0.11432199,0.023673084,0.780856,0.076923005,0.00006483031],"about_ca_topic_score_codex":0.00072170584,"about_ca_topic_score_gemma":0.0015434633,"teacher_disagreement_score":0.013450977,"about_ca_system_score_codex":0.0005025903,"about_ca_system_score_gemma":0.00029571482,"threshold_uncertainty_score":0.04499799},"labels":[],"label_agreement":null},{"id":"W169655853","doi":"10.1007/978-3-642-35139-6_27","title":"A Cognitive Architecture Based on Cognitive/Neurological Dual-System Theories","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Science and Mapping","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":"Université du Québec à Montréal","funders":"","keywords":"Cognitive architecture; Parallels; Cognition; Architecture; Cognitive science; Dual (grammatical number); Computer science; Reflexivity; Psychology; Artificial intelligence; Human–computer interaction; Neuroscience; Engineering; Sociology","score_opus":0.020611759808850133,"score_gpt":0.24901736432739185,"score_spread":0.22840560451854172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169655853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048926793,0.0010791922,0.78550845,0.005339992,0.00035370907,0.00009569445,0.0002197523,0.0005680809,0.15790838],"genre_scores_gemma":[0.72008616,0.00063186174,0.2606173,0.0003959725,0.00014267619,0.00015385028,0.0002474012,0.00006580512,0.017658904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999701,0.00008069985,0.000022055507,0.000073779345,0.000073127536,0.000049272665],"domain_scores_gemma":[0.9996184,0.00011270663,0.000033948985,0.0000727613,0.0000925895,0.00006950583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561506,0.00051183475,0.00041113357,0.0008179928,0.00072154176,0.0028437926,0.0015243872,0.00092618354,0.006768337],"category_scores_gemma":[0.001066862,0.0003763606,0.0011108483,0.00048952457,0.0030547103,0.004123945,0.0014784406,0.0015001248,0.0011098413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021768565,0.000018368699,0.00029686885,0.00003902697,0.000021138232,0.000052383326,0.0002761304,0.003296615,0.0007854379,0.98027027,0.0008382747,0.01408384],"study_design_scores_gemma":[0.00000984533,0.0000127452395,0.00022919333,0.000010601572,0.000012845386,0.000066908666,0.00006245442,0.013123941,0.0003120209,0.9835971,0.0025546148,0.00000768117],"about_ca_topic_score_codex":0.0015148225,"about_ca_topic_score_gemma":0.0014938576,"teacher_disagreement_score":0.006768337,"about_ca_system_score_codex":0.0009742907,"about_ca_system_score_gemma":0.0011023444,"threshold_uncertainty_score":0.022642374},"labels":[],"label_agreement":null},{"id":"W1696644198","doi":"10.1007/3-540-46430-1_31","title":"A Dynamic Bayesian Network Approach to Tracking Using Learned Switching Dynamic Models","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Dynamic Bayesian network; Computer science; Bayesian probability; Dynamic network analysis; Artificial intelligence; Bayesian network; Computer network","score_opus":0.03715798995804878,"score_gpt":0.2718394019745153,"score_spread":0.2346814120164665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696644198","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.0012390962,0.00020821705,0.99712425,0.000121890065,0.00003105739,0.000012225451,0.000038401555,0.00013667023,0.0010881748],"genre_scores_gemma":[0.27269337,0.0018229089,0.71014935,0.00029919032,0.0003880805,0.0003205801,0.0006022488,0.00034137096,0.013382962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877053,0.00043027857,0.00006742954,0.00035575696,0.0002940991,0.00008192798],"domain_scores_gemma":[0.9958839,0.0032597654,0.0001748909,0.00024220395,0.00034796438,0.00009130414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026728876,0.0010721189,0.002416307,0.0018846438,0.0009116364,0.0022611292,0.0043624714,0.0030687004,0.005747526],"category_scores_gemma":[0.011219608,0.0016635259,0.0017102568,0.003050125,0.0016506779,0.0050608986,0.002116214,0.0032204539,0.0009891278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005593305,0.00004685229,0.00025471073,0.000066039,0.000088056906,0.00005712316,0.00006791615,0.8440133,0.00036367928,0.08934949,0.0015010352,0.064135894],"study_design_scores_gemma":[0.0000055492487,0.0000039668907,0.000033500615,0.000005085109,0.00001047065,0.00001042764,0.0000027732635,0.9618784,0.000074393356,0.037569035,0.0003986232,0.000007813696],"about_ca_topic_score_codex":0.024668928,"about_ca_topic_score_gemma":0.0183777,"teacher_disagreement_score":0.024668928,"about_ca_system_score_codex":0.0023464977,"about_ca_system_score_gemma":0.0015404416,"threshold_uncertainty_score":0.04905069},"labels":[],"label_agreement":null},{"id":"W169785291","doi":"10.1007/978-3-642-33542-6_16","title":"fAARS: A Platform for Location-Aware Trans-reality Games","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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 Alberta","funders":"","keywords":"Computer science; Metaverse; Virtual world; Virtual reality; Human–computer interaction; Context (archaeology); Modalities; Multimedia; World Wide Web","score_opus":0.037947222381742536,"score_gpt":0.2837019148362225,"score_spread":0.24575469245447995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169785291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027919255,0.0010604426,0.78516495,0.0005136218,0.0006929161,0.0008996891,0.0028380298,0.114379875,0.0665313],"genre_scores_gemma":[0.33235076,0.001668515,0.4802916,0.00077496056,0.00016325768,0.0018024817,0.008073137,0.010621527,0.16425376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.000056513374,0.000019205076,0.0000601303,0.0001532928,0.00008142964],"domain_scores_gemma":[0.99968064,0.00008225978,0.000017519782,0.00006756291,0.00006388382,0.00008814278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038600454,0.0020084325,0.00069667137,0.00071613037,0.00050964986,0.0014404291,0.0028630334,0.0012753687,0.034157116],"category_scores_gemma":[0.0012086533,0.00086815923,0.00077696017,0.0002966594,0.0003676446,0.0021656312,0.0034732313,0.0015345804,0.012562032],"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.0035286604,0.0014716582,0.0018511015,0.001304498,0.00044584516,0.0015518193,0.0023801154,0.026885143,0.17776799,0.08085344,0.24211651,0.4598433],"study_design_scores_gemma":[0.00068111677,0.0010389516,0.0026700213,0.00029704924,0.0003037772,0.0019797685,0.0005582862,0.22334081,0.07581147,0.034734044,0.65816,0.00042475274],"about_ca_topic_score_codex":0.0020556892,"about_ca_topic_score_gemma":0.0029259417,"teacher_disagreement_score":0.034157116,"about_ca_system_score_codex":0.00034760902,"about_ca_system_score_gemma":0.00055327866,"threshold_uncertainty_score":0.11426699},"labels":[],"label_agreement":null},{"id":"W169878834","doi":"10.1007/978-3-642-22993-0_10","title":"Faster Coupon Collecting via Replication with Applications in Gossiping","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Replica; Sequence (biology); Replication (statistics); Coupon; Gossip; Constructive; Extension (predicate logic); Matching (statistics); Asymptotically optimal algorithm; Theoretical computer science; Algorithm; Mathematics; Process (computing); Statistics; Programming language","score_opus":0.024474695177994884,"score_gpt":0.2499125393805907,"score_spread":0.2254378442025958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169878834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08084952,0.0014161812,0.8926311,0.0004221131,0.00056644104,0.00031893747,0.00018311023,0.010083739,0.013528827],"genre_scores_gemma":[0.5361914,0.00043713895,0.4459931,0.00016669997,0.00034501203,0.00031392736,0.00029866802,0.0010618436,0.015192064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997623,0.00076379196,0.00014711829,0.00041382055,0.0008018446,0.00025045147],"domain_scores_gemma":[0.99073726,0.003763097,0.00029307324,0.0038881218,0.001034361,0.00028415525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028326658,0.0009876173,0.0020463218,0.0012015558,0.0016663539,0.0027719594,0.0027496675,0.0015238298,0.007029753],"category_scores_gemma":[0.008514892,0.0009317433,0.00075670786,0.0019265566,0.0010286268,0.004115884,0.0023406947,0.0021409316,0.001925226],"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.0034762502,0.0007704036,0.0035078677,0.0007291176,0.00024032514,0.0003787054,0.0012774112,0.11262991,0.088610396,0.19893274,0.021512304,0.5679347],"study_design_scores_gemma":[0.00023941483,0.00039273035,0.0008610016,0.00006519738,0.00016726876,0.000399924,0.00018262073,0.8320373,0.060570765,0.0877345,0.017234856,0.00011446504],"about_ca_topic_score_codex":0.0013596424,"about_ca_topic_score_gemma":0.0015627487,"teacher_disagreement_score":0.007029753,"about_ca_system_score_codex":0.0009795588,"about_ca_system_score_gemma":0.0010309755,"threshold_uncertainty_score":0.023516834},"labels":[],"label_agreement":null},{"id":"W1700149322","doi":"10.1007/978-3-642-21043-3_50","title":"Partial Evaluation for Planning in Multiagent Expedition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Guelph","funders":"","keywords":"Speedup; Testbed; Computer science; Plan (archaeology); Computation; Partial evaluation; Distributed computing; Artificial intelligence; Operations research; Theoretical computer science; Parallel computing; Algorithm; Mathematics; Computer network","score_opus":0.06982681356884493,"score_gpt":0.302490180746989,"score_spread":0.2326633671781441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700149322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012375024,0.0016830385,0.9640075,0.0004852775,0.00013434351,0.00012532131,0.00017455718,0.0006452906,0.020369671],"genre_scores_gemma":[0.49888438,0.0010299612,0.48112074,0.00015764649,0.0001698122,0.00047219856,0.0005900397,0.0003851891,0.01719013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973954,0.0012681728,0.00015702605,0.00023473136,0.00074254937,0.0002021048],"domain_scores_gemma":[0.995513,0.0032524988,0.0001369244,0.00046093416,0.0005103847,0.00012612203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033496958,0.0011355917,0.0017464958,0.0011700997,0.0010739834,0.0022734888,0.0018387581,0.0010608915,0.009289378],"category_scores_gemma":[0.010149145,0.00072179624,0.0011058484,0.001319986,0.0025130995,0.0035608876,0.002080327,0.0021836886,0.00073839445],"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.000336955,0.00006743211,0.00046288606,0.0005139922,0.00007700129,0.00013509548,0.0002624993,0.38929945,0.0008397102,0.43377435,0.0056115882,0.16861893],"study_design_scores_gemma":[0.000022671547,0.00005345987,0.00014696748,0.00007007826,0.000031437597,0.00003532868,0.000047184647,0.7842858,0.000851366,0.21064442,0.003796466,0.000014786829],"about_ca_topic_score_codex":0.009739157,"about_ca_topic_score_gemma":0.011378888,"teacher_disagreement_score":0.009739157,"about_ca_system_score_codex":0.002733898,"about_ca_system_score_gemma":0.001876574,"threshold_uncertainty_score":0.031076074},"labels":[],"label_agreement":null},{"id":"W170046012","doi":"10.1007/978-3-540-72990-7_72","title":"Self-tuning Optimal PI Rate Controller for End-to-End Congestion With LQR Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Network congestion; Router; Controller (irrigation); Transient (computer programming); Computer science; Queue; PID controller; Engineering; Computer network; Control engineering; Control (management); Network packet","score_opus":0.017690397062093754,"score_gpt":0.2337911100705686,"score_spread":0.21610071300847486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170046012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064424346,0.0002664741,0.9901759,0.00005485804,0.000081987055,0.000027122405,0.0000080637055,0.00068992336,0.00225329],"genre_scores_gemma":[0.8869625,0.00028318094,0.10772369,0.00014973621,0.000129346,0.00012418104,0.000038203838,0.0001033071,0.0044858945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957305,0.000083136634,0.000027397753,0.00010690706,0.00015363976,0.000055914283],"domain_scores_gemma":[0.9996338,0.00013845976,0.000032114862,0.000036700607,0.00014437907,0.000014587666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994149,0.0004982164,0.0008386177,0.0002805689,0.00034521305,0.0007397118,0.0010089378,0.0005926738,0.0017888712],"category_scores_gemma":[0.0010243854,0.00024527032,0.0004162734,0.00021458206,0.0003524519,0.0005066647,0.00060493854,0.0010371933,0.00042758294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003704617,0.0003381502,0.00055140967,0.00033666613,0.00013193846,0.00018353549,0.0002483724,0.57079947,0.06859151,0.021410583,0.004514346,0.33252352],"study_design_scores_gemma":[0.00001665429,0.00006952483,0.00011800334,0.0000054719007,0.000012752335,0.000030690935,0.000006614405,0.9946256,0.003102122,0.001430027,0.00057410967,0.000008415405],"about_ca_topic_score_codex":0.0014458157,"about_ca_topic_score_gemma":0.001212149,"teacher_disagreement_score":0.0017888712,"about_ca_system_score_codex":0.00039828292,"about_ca_system_score_gemma":0.00043507133,"threshold_uncertainty_score":0.0059844255},"labels":[],"label_agreement":null},{"id":"W1700872096","doi":"10.1007/3-540-47789-6_11","title":"Collision Detection Optimization in a Multi-particle System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Calgary","funders":"","keywords":"Voronoi diagram; Collision detection; Computer science; Subdivision; Collision; Particle system; Set (abstract data type); Tree (set theory); Algorithm; Event (particle physics); Optimization problem; Mathematical optimization; Theoretical computer science; Computer graphics (images); Mathematics; Geometry","score_opus":0.02299463384654872,"score_gpt":0.2389561046812457,"score_spread":0.21596147083469697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700872096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015948934,0.00024236919,0.97925,0.0002933946,0.00008294505,0.00004765233,0.000027003307,0.00014461088,0.0039630937],"genre_scores_gemma":[0.47693983,0.00032922986,0.5082606,0.0002640657,0.00015602523,0.00028646793,0.00012869977,0.00024027973,0.01339479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944776,0.00019869773,0.000026958165,0.000100952224,0.00017688812,0.000048738642],"domain_scores_gemma":[0.9989478,0.00068381266,0.00007706205,0.00007480245,0.00013557122,0.00008099358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014036648,0.00061885547,0.0016689108,0.0007793152,0.0012676126,0.0015587222,0.0022048748,0.0027685566,0.0035647983],"category_scores_gemma":[0.0030196356,0.0013698146,0.0008992948,0.0013452773,0.0014603656,0.0016266861,0.0025050987,0.0014427087,0.00048425834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008182096,0.000034210796,0.00021458314,0.000044698892,0.000026835363,0.000059107573,0.000038582457,0.9721931,0.0008870234,0.016429516,0.00047359802,0.0095169395],"study_design_scores_gemma":[0.000010879956,0.000007160901,0.000035444653,0.0000017611179,0.0000030838096,0.0000064077485,0.0000028684021,0.99670726,0.00017247062,0.0028724086,0.00017643895,0.000003828366],"about_ca_topic_score_codex":0.004577785,"about_ca_topic_score_gemma":0.0025339434,"teacher_disagreement_score":0.004577785,"about_ca_system_score_codex":0.0012135186,"about_ca_system_score_gemma":0.001065291,"threshold_uncertainty_score":0.011925459},"labels":[],"label_agreement":null},{"id":"W1701077989","doi":"10.1007/11521082_22","title":"A Scale Invariant Local Image Descriptor for Visual Homing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Image warping; Artificial intelligence; Computer science; Computer vision; Invariant (physics); Computation; Dynamic time warping; Pattern recognition (psychology); Image (mathematics); Robot vision; Scale-invariant feature transform; Robot; Mathematics; Algorithm; Mobile robot","score_opus":0.016796754733001382,"score_gpt":0.2825344665981736,"score_spread":0.2657377118651722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1701077989","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007346509,0.00058254175,0.9891171,0.00005933052,0.00012621233,0.00007887838,0.00020101541,0.0014074451,0.0010809302],"genre_scores_gemma":[0.20036499,0.0014404766,0.78243953,0.00022627422,0.00020731206,0.00024854467,0.0018851244,0.0004761073,0.012711649],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967813,0.00003488076,0.000018443256,0.000069710404,0.00015571987,0.00004301341],"domain_scores_gemma":[0.99969506,0.00004304804,0.000026864935,0.000094680625,0.000115540846,0.000024804856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004203239,0.00044990046,0.0012215112,0.0012026043,0.00033865162,0.0007401144,0.0011583241,0.0007005315,0.0041737133],"category_scores_gemma":[0.0007704224,0.00023754581,0.0007231179,0.0020376202,0.00046195294,0.0010818148,0.00090551254,0.0009236733,0.0021016572],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027245257,0.00012044516,0.0003639072,0.00016836938,0.000054357846,0.000102500846,0.000037949194,0.017176848,0.11936837,0.009147877,0.012065775,0.84112126],"study_design_scores_gemma":[0.00007873161,0.00036096267,0.0024913389,0.000031259173,0.00010013282,0.00050936925,0.00009685179,0.8993415,0.068515465,0.011545845,0.016835889,0.000092710754],"about_ca_topic_score_codex":0.0028324057,"about_ca_topic_score_gemma":0.0029537685,"teacher_disagreement_score":0.0041737133,"about_ca_system_score_codex":0.00041742955,"about_ca_system_score_gemma":0.00057563407,"threshold_uncertainty_score":0.013962507},"labels":[],"label_agreement":null},{"id":"W170123544","doi":"10.1007/978-3-642-19861-8_11","title":"Actor-Based Parallel Dataflow Analysis","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dataflow; Computer science; Scala; Distributive property; Parallel computing; Context (archaeology); Multi-core processor; Many core; Programming language; Theoretical computer science; Algorithm; Java; Mathematics","score_opus":0.027659976090365235,"score_gpt":0.2591298384465871,"score_spread":0.23146986235622186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170123544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035832366,0.000090974245,0.99423885,0.000047370926,0.000026724325,0.000024857176,0.000052980515,0.0007460211,0.0011889932],"genre_scores_gemma":[0.30629033,0.00044796374,0.6860831,0.00008745293,0.00008331553,0.00016957347,0.0006059395,0.00064602296,0.005586287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949944,0.00011550767,0.000027317075,0.000112166425,0.00018236246,0.00006317954],"domain_scores_gemma":[0.9988243,0.0006368065,0.00006250041,0.00015972249,0.00025669704,0.00005994502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010809602,0.00087761914,0.00085918914,0.0010972872,0.0007165758,0.0012434182,0.0016019745,0.0005351484,0.005203162],"category_scores_gemma":[0.0027210913,0.0006519989,0.0011825997,0.0009265587,0.0007109034,0.0015513211,0.0010323093,0.001513643,0.000688892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019422383,0.000077932,0.00092202576,0.000117858115,0.000081997016,0.000061002105,0.00008059284,0.7943613,0.0063154004,0.068379626,0.0032556618,0.12615234],"study_design_scores_gemma":[0.0000032774317,0.0000038668077,0.000039796294,0.0000037479238,0.000004729505,0.0000056281892,0.0000038815497,0.9835675,0.0009576732,0.014873273,0.00053363567,0.0000029391713],"about_ca_topic_score_codex":0.0051941387,"about_ca_topic_score_gemma":0.005030685,"teacher_disagreement_score":0.005203162,"about_ca_system_score_codex":0.0010865062,"about_ca_system_score_gemma":0.0013547144,"threshold_uncertainty_score":0.017406285},"labels":[],"label_agreement":null},{"id":"W1701639997","doi":"10.1007/978-3-642-02611-9_15","title":"Increasing Computational Redundancy of Digital Images via Multiresolutional Matching","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Redundancy (engineering); Invariant (physics); Speedup; Similarity measure; Computational complexity theory; Artificial intelligence; Histogram; Computation; Pixel; Pattern recognition (psychology); Algorithm; Computer vision; Mathematics; Image (mathematics); Parallel computing","score_opus":0.013722607824162208,"score_gpt":0.27240357447880553,"score_spread":0.25868096665464335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1701639997","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.08931329,0.0012721025,0.90449756,0.00028629307,0.00009186465,0.000052281186,0.00008543999,0.0010020486,0.0033991984],"genre_scores_gemma":[0.35842705,0.0012341304,0.6368258,0.00014055874,0.00015894815,0.000050102568,0.00019533026,0.00021171136,0.0027563996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935585,0.00011726673,0.000039500093,0.000086621236,0.00032845107,0.000072286944],"domain_scores_gemma":[0.9982827,0.0006867383,0.00016828715,0.00060262386,0.00020722942,0.000052571486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006765263,0.0006005029,0.0007855727,0.0015358931,0.00026954777,0.0007845632,0.00088128704,0.000670593,0.003849548],"category_scores_gemma":[0.004479028,0.00045990304,0.0005538268,0.0015056352,0.0005112345,0.0019426192,0.0018723658,0.00070815,0.00076580694],"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.0006464442,0.00020811408,0.0006614013,0.0003937497,0.00009259209,0.00030694477,0.00018803235,0.05310965,0.3902765,0.023682373,0.0031599612,0.5272742],"study_design_scores_gemma":[0.00010851759,0.00034458545,0.001675644,0.00005649854,0.00015181908,0.001178148,0.00008217142,0.74314827,0.2231785,0.022257088,0.007765109,0.000053658456],"about_ca_topic_score_codex":0.00044967944,"about_ca_topic_score_gemma":0.00057434477,"teacher_disagreement_score":0.003849548,"about_ca_system_score_codex":0.0003090485,"about_ca_system_score_gemma":0.00027667364,"threshold_uncertainty_score":0.012878001},"labels":[],"label_agreement":null},{"id":"W1702634582","doi":"10.1007/3-540-45453-5_142","title":"Effects of Sampling Rate and Pose Error on Volume Reconstruction by Space Carving","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Sampling (signal processing); Word error rate; Artificial intelligence; Volume (thermodynamics); Sampling distribution; Computer vision; Algorithm; Pattern recognition (psychology); Statistics; Mathematics","score_opus":0.011861182678918416,"score_gpt":0.2555732884041349,"score_spread":0.24371210572521648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1702634582","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.43361998,0.0022920743,0.5586054,0.00033006436,0.00019043453,0.0000538649,0.00019794099,0.0016811526,0.0030291036],"genre_scores_gemma":[0.859073,0.0009898454,0.13502018,0.00008625288,0.000050672683,0.000031980628,0.0002534531,0.0017384931,0.0027561586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783957,0.00076267944,0.00011680552,0.00021155548,0.00088466547,0.00018475036],"domain_scores_gemma":[0.94883835,0.045125756,0.0015454668,0.0022156693,0.0019389711,0.00033580753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004367337,0.00089369895,0.0010914603,0.00069636304,0.00049077877,0.0011508826,0.0006382172,0.0013096137,0.003351051],"category_scores_gemma":[0.03740666,0.0008816726,0.0005857445,0.0011576854,0.00090866495,0.0018030943,0.0011523206,0.0012541154,0.00045052622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004773919,0.0002678979,0.0076898597,0.000618192,0.00020967504,0.00067177264,0.0010081611,0.55293363,0.22844294,0.008667622,0.0017532527,0.1929631],"study_design_scores_gemma":[0.00005402465,0.00043528047,0.0057771592,0.000047588008,0.00016244866,0.0013736606,0.00015538288,0.7629154,0.22473009,0.0031579614,0.0010666327,0.00012439582],"about_ca_topic_score_codex":0.0022258149,"about_ca_topic_score_gemma":0.0017458743,"teacher_disagreement_score":0.004367337,"about_ca_system_score_codex":0.0005711099,"about_ca_system_score_gemma":0.000489806,"threshold_uncertainty_score":0.023096979},"labels":[],"label_agreement":null},{"id":"W1703040284","doi":"10.1007/978-3-540-75757-3_54","title":"Improved Statistical TRE Model When Using a Reference Frame","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","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":"Western University","funders":"","keywords":"Fiducial marker; Computer science; Artificial intelligence; Computer vision; Metric (unit); Reference frame; Centroid; Statistical model; Statistic; Point (geometry); Frame (networking); Isotropy; Algorithm; Mathematics; Statistics; Engineering; Physics; Optics; Geometry","score_opus":0.06232469310579558,"score_gpt":0.3489212663838111,"score_spread":0.2865965732780155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1703040284","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.006983374,0.00020133992,0.98981106,0.00020531511,0.00013742503,0.000020430909,0.0002516149,0.00089704857,0.0014924171],"genre_scores_gemma":[0.5053693,0.0009446106,0.47437406,0.00052883883,0.0005042179,0.00025321022,0.002765756,0.0012981257,0.013961965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979024,0.0006764071,0.00009939529,0.0005290423,0.0005394125,0.0002533195],"domain_scores_gemma":[0.99521,0.0017606457,0.00028371715,0.00132941,0.0012861867,0.00013018736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030870314,0.0010003877,0.0012737383,0.0010297088,0.0007048233,0.0015966584,0.002513495,0.0024945708,0.004428258],"category_scores_gemma":[0.013079461,0.00067019527,0.0012210459,0.0014370845,0.0006561883,0.0032379094,0.0013056078,0.0021224783,0.0031925316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084209046,0.00012214479,0.0017902069,0.00017056447,0.00016654933,0.00036358886,0.00017973824,0.59712285,0.01659526,0.10340638,0.009350138,0.2698905],"study_design_scores_gemma":[0.000009822449,0.0000330983,0.00025354736,0.000009924394,0.000027348275,0.00005937478,0.0000070800893,0.98697156,0.002564329,0.008418739,0.0016194334,0.000025694342],"about_ca_topic_score_codex":0.011886611,"about_ca_topic_score_gemma":0.008844642,"teacher_disagreement_score":0.011886611,"about_ca_system_score_codex":0.00091045245,"about_ca_system_score_gemma":0.0018090784,"threshold_uncertainty_score":0.023634791},"labels":[],"label_agreement":null},{"id":"W1703349895","doi":"10.1007/978-3-642-11207-2_9","title":"Visualizing Privacy Implications of Access Control Policies in Social Network Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Calgary","funders":"","keywords":"Computer science; Neighbourhood (mathematics); Compromise; Access control; Internet privacy; Dilemma; Visualization; Information visualization; Privacy software; Computer security; Privacy protection; Information privacy; Privacy by Design; Social network (sociolinguistics); Human–computer interaction; World Wide Web; Social media; Artificial intelligence; Sociology","score_opus":0.02745726307215182,"score_gpt":0.30368881463697783,"score_spread":0.27623155156482604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1703349895","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.66660047,0.0013621679,0.31010345,0.003118732,0.00013031626,0.000095097945,0.00092768995,0.0024733655,0.01518876],"genre_scores_gemma":[0.9642485,0.00023285691,0.033717755,0.000046037327,0.000021674708,0.000022876666,0.00030039353,0.000092814014,0.0013170275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885166,0.0006669169,0.000046588037,0.000106948755,0.00022309877,0.00010475802],"domain_scores_gemma":[0.990243,0.007840802,0.0005329073,0.0006257766,0.0004627361,0.0002947679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017560064,0.00045536886,0.00034838068,0.0012873968,0.00083528046,0.0030041859,0.0006689449,0.0010221502,0.002960348],"category_scores_gemma":[0.011121326,0.00031092454,0.0004155768,0.0014690651,0.00089613633,0.0035421802,0.0011294358,0.0016144487,0.00019697925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008145357,0.00025916172,0.023332478,0.00030448008,0.00011607946,0.0007947892,0.005551966,0.4206615,0.016184937,0.4019202,0.0114511,0.11860877],"study_design_scores_gemma":[0.000026989966,0.000039528302,0.003277879,0.000023473587,0.00002364682,0.000113646514,0.0008589062,0.8100232,0.0022758306,0.17901099,0.0043067597,0.000019197485],"about_ca_topic_score_codex":0.008105296,"about_ca_topic_score_gemma":0.004834583,"teacher_disagreement_score":0.008105296,"about_ca_system_score_codex":0.0012039199,"about_ca_system_score_gemma":0.0006339545,"threshold_uncertainty_score":0.016116261},"labels":[],"label_agreement":null},{"id":"W170405163","doi":"10.1007/978-3-540-69554-7_18","title":"Rapid User-Centred Evaluation for Context-Aware Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Context (archaeology); Human–computer interaction; Computer science; Ubiquitous computing; Context awareness; Mobile device; Multimedia; World Wide Web","score_opus":0.0905427230486638,"score_gpt":0.30022584590072404,"score_spread":0.20968312285206026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170405163","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.12870264,0.0018251542,0.8364645,0.00019007118,0.00032952538,0.001180642,0.0008566228,0.023546927,0.006903889],"genre_scores_gemma":[0.70588964,0.00038227302,0.28628704,0.000113862065,0.00007075886,0.0006668117,0.0010504636,0.0012487395,0.0042903917],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944512,0.0023322178,0.00033472234,0.0005892362,0.0020301868,0.0002623335],"domain_scores_gemma":[0.9914819,0.0044305874,0.00029458018,0.0010086938,0.002406662,0.0003776658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004351,0.0015158578,0.0017269038,0.0011160291,0.00046294543,0.002037216,0.001404912,0.0010981356,0.0068513015],"category_scores_gemma":[0.017959312,0.00047096758,0.000478831,0.0005508413,0.00032491406,0.0025577205,0.0020556091,0.0009069856,0.0027650716],"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.005806657,0.0006016757,0.004631707,0.0006776632,0.00020861605,0.0002786298,0.00065999903,0.019831607,0.13607675,0.0027477024,0.009018734,0.8194602],"study_design_scores_gemma":[0.0002799172,0.0025167519,0.0086148,0.000098326986,0.00023368931,0.0005978531,0.00043845698,0.7933777,0.17729102,0.004748069,0.011603404,0.00020004275],"about_ca_topic_score_codex":0.0018704018,"about_ca_topic_score_gemma":0.0020933026,"teacher_disagreement_score":0.0068513015,"about_ca_system_score_codex":0.0005173908,"about_ca_system_score_gemma":0.0006603993,"threshold_uncertainty_score":0.023010612},"labels":[],"label_agreement":null},{"id":"W170410822","doi":"10.1007/978-3-642-39137-8_47","title":"Arabic Website Design: User Evaluation from a Cultural Perspective","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Computer science; Perspective (graphical); Arabic; World Wide Web; Human–computer interaction; Artificial intelligence; Linguistics","score_opus":0.13880935116175022,"score_gpt":0.3813462258527345,"score_spread":0.24253687469098426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170410822","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.9414275,0.0014416976,0.008800533,0.00048007898,0.00006240271,0.0005612544,0.000156236,0.00011934785,0.046950858],"genre_scores_gemma":[0.9742366,0.0006557533,0.017619276,0.00014231403,0.000023278615,0.0004315159,0.00017287431,0.00007591747,0.0066425214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98683757,0.009585251,0.00052037527,0.00029840547,0.0024844878,0.00027396026],"domain_scores_gemma":[0.9619189,0.024231663,0.0014126546,0.0013043146,0.0099374745,0.0011949926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01487959,0.00059078104,0.0005671297,0.001932373,0.001554205,0.00331128,0.0005510316,0.00077276863,0.0054995953],"category_scores_gemma":[0.037609357,0.00023939225,0.00045268162,0.002070873,0.0008773078,0.002070153,0.0014121345,0.00063159433,0.0012731767],"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.006308032,0.005394406,0.08150704,0.002381669,0.00021084727,0.00043956534,0.087099805,0.0025671516,0.027966568,0.009117483,0.008123787,0.7688837],"study_design_scores_gemma":[0.0012609994,0.028526416,0.47621357,0.0032530546,0.0016014898,0.002603484,0.17815162,0.050529595,0.12767333,0.013861504,0.11549572,0.0008292272],"about_ca_topic_score_codex":0.0020087948,"about_ca_topic_score_gemma":0.0027718565,"teacher_disagreement_score":0.01487959,"about_ca_system_score_codex":0.0016356629,"about_ca_system_score_gemma":0.0014733628,"threshold_uncertainty_score":0.07869172},"labels":[],"label_agreement":null},{"id":"W1704347466","doi":"10.1007/978-3-642-12659-8_15","title":"An Evaluation of Parallel Numerical Hessian Calculations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Chemical Physics Studies","field":"Physics and Astronomy","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","funders":"","keywords":"Hessian matrix; Computer science; Hessian equation; Numerical analysis; Quasi-Newton method; Software; Matrix (chemical analysis); Constant (computer programming); Computational science; Applied mathematics; Parallel computing; Algorithm; Mathematical optimization; Newton's method; Mathematics; Mathematical analysis; Physics","score_opus":0.02237823749528742,"score_gpt":0.304906098560967,"score_spread":0.28252786106567956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704347466","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.32183892,0.0017363299,0.5680159,0.00094873697,0.000958983,0.0002578643,0.0014259182,0.010143098,0.094674245],"genre_scores_gemma":[0.66355985,0.00053447427,0.3187552,0.00015035975,0.00015783991,0.0001687882,0.0011166432,0.0017349033,0.013822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924266,0.00018624883,0.000033998094,0.000052554937,0.0004031737,0.000081428414],"domain_scores_gemma":[0.99656785,0.0016407261,0.00011784629,0.00041634802,0.0011354215,0.00012188957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229197,0.0011021385,0.0010202194,0.0008531022,0.000932656,0.001089108,0.0014611586,0.0007079938,0.015436707],"category_scores_gemma":[0.005734592,0.000357663,0.00049438124,0.0016697628,0.00048557195,0.0011280801,0.0008306424,0.0006531902,0.0014704536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013601931,0.0006270367,0.0027299672,0.00092077145,0.00017431588,0.00043006963,0.00022199501,0.62150633,0.013815887,0.045049164,0.021263327,0.291901],"study_design_scores_gemma":[0.00007877426,0.00008968676,0.00063085044,0.000019902518,0.000026378197,0.000065366585,0.000048109305,0.98526555,0.0052861706,0.0063789384,0.0020984334,0.000011823764],"about_ca_topic_score_codex":0.0063134553,"about_ca_topic_score_gemma":0.009803085,"teacher_disagreement_score":0.015436707,"about_ca_system_score_codex":0.0007498157,"about_ca_system_score_gemma":0.0013940791,"threshold_uncertainty_score":0.051640928},"labels":[],"label_agreement":null},{"id":"W1707418623","doi":"10.1007/978-3-540-73283-9_39","title":"Multimodal Technology for Municipal Inspections: An Evaluation Framework","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; National Research Council Canada","funders":"","keywords":"Computer science; Usability; TRIPS architecture; Field (mathematics); Context (archaeology); Mobile interaction; Work (physics); Focus (optics); Mobile technology; Human–computer interaction; Contextual design; Mobile device; Systems engineering; Software engineering; World Wide Web; Artificial intelligence; Engineering","score_opus":0.04761346256582205,"score_gpt":0.32762723648550207,"score_spread":0.28001377391968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1707418623","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.5689059,0.0031829015,0.33516002,0.0012116389,0.00011136935,0.006918821,0.0033103288,0.0010075829,0.08019152],"genre_scores_gemma":[0.89462566,0.0005951758,0.09713221,0.000092738446,0.000029472034,0.0030937812,0.0011040494,0.0000714513,0.003255401],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9792324,0.0142692765,0.00074469525,0.0007095659,0.0043033594,0.00074072805],"domain_scores_gemma":[0.98215574,0.01131324,0.0012288815,0.0006504855,0.0042537376,0.0003979737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022769572,0.0012930853,0.00074393256,0.004197125,0.0011296258,0.0038925866,0.0014843364,0.0017527989,0.0052339733],"category_scores_gemma":[0.028850554,0.00033086736,0.0010564729,0.0027561542,0.0012814641,0.0031822296,0.0026258044,0.0007881769,0.0005928879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077905795,0.0044048727,0.08154238,0.003320913,0.0010585213,0.00034642874,0.0050816243,0.080319285,0.028602708,0.081895806,0.0100150425,0.69562185],"study_design_scores_gemma":[0.0010107796,0.017030882,0.17177103,0.0018665339,0.0025310358,0.0006256663,0.014311834,0.6512745,0.057469543,0.04710785,0.03449098,0.0005092295],"about_ca_topic_score_codex":0.0071770996,"about_ca_topic_score_gemma":0.010476735,"teacher_disagreement_score":0.022769572,"about_ca_system_score_codex":0.0041212197,"about_ca_system_score_gemma":0.002440316,"threshold_uncertainty_score":0.12041843},"labels":[],"label_agreement":null},{"id":"W1707430766","doi":"10.1007/3-540-36181-2_58","title":"Egocentric Direction and the Visual Guidance of Robot Locomotion Background, Theory and Implementation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Heuristics; Obstacle avoidance; Robot; Artificial intelligence; Mobile robot; Perception; Obstacle; Computer vision; Human–computer interaction; Robot locomotion; Robot control; Psychology","score_opus":0.00829469979120959,"score_gpt":0.23749272461446358,"score_spread":0.229198024823254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1707430766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016477453,0.011048262,0.93433654,0.0007848431,0.00031358178,0.00003020915,0.00015404719,0.00043426504,0.036420807],"genre_scores_gemma":[0.73589844,0.018518465,0.19400278,0.00037919957,0.0007980608,0.00021898848,0.00048055957,0.00015708792,0.0495464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987566,0.000026128348,0.000004509498,0.000027643551,0.000045582165,0.000020490486],"domain_scores_gemma":[0.9998807,0.000039258743,0.000019127308,0.000014354972,0.00003591378,0.000010771432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013286888,0.00036283402,0.0005057173,0.00045837555,0.0003233184,0.001213247,0.0008657203,0.00072023005,0.0034518961],"category_scores_gemma":[0.0006322143,0.00036892784,0.00037920757,0.00083322043,0.0009411155,0.0011908987,0.0005803464,0.0008421454,0.0008095769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037771755,0.000034616056,0.00044821014,0.00017260063,0.00003029303,0.00007373955,0.00013977037,0.048817843,0.00532672,0.7684789,0.0050092093,0.17143029],"study_design_scores_gemma":[0.000031832657,0.000057503566,0.0013004423,0.000079022706,0.000026784624,0.00017326082,0.000090174326,0.26639885,0.0025017806,0.69977146,0.029516771,0.000052072613],"about_ca_topic_score_codex":0.0052195736,"about_ca_topic_score_gemma":0.0054135355,"teacher_disagreement_score":0.0052195736,"about_ca_system_score_codex":0.0005292368,"about_ca_system_score_gemma":0.0006880416,"threshold_uncertainty_score":0.011547685},"labels":[],"label_agreement":null},{"id":"W1708665","doi":"10.1007/978-3-662-43951-7_2","title":"Handling Infinitely Branching WSTS","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Decidability; Branching (polymer chemistry); Petri net; Automaton; Mathematics; Finite-state machine; Antichain; Discrete mathematics; Pure mathematics; Computer science; Theoretical computer science; Algorithm; Partially ordered set","score_opus":0.028236850503169934,"score_gpt":0.2770631855992524,"score_spread":0.24882633509608248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1708665","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.0412639,0.000497483,0.9024012,0.00054202985,0.00042819756,0.00008259137,0.00025995087,0.0047165425,0.04980818],"genre_scores_gemma":[0.62112194,0.001491274,0.29324463,0.00037148577,0.00036630308,0.00019305781,0.0014049119,0.0038997503,0.07790663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869555,0.00016175756,0.00013414842,0.00021465578,0.00055485696,0.00023894045],"domain_scores_gemma":[0.99763453,0.0010525101,0.00012828854,0.00071272656,0.00033639892,0.00013541881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589796,0.0007149741,0.0005994073,0.0010068518,0.001170307,0.0033648885,0.0016364495,0.00092741504,0.012071128],"category_scores_gemma":[0.0056319553,0.000746386,0.0012994107,0.0014824218,0.0018879324,0.00714853,0.0050112875,0.0033721977,0.0025029287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001193222,0.000044635013,0.0005669329,0.0002512884,0.000039500785,0.00083148055,0.0010798522,0.011086361,0.014315264,0.8554487,0.0053230287,0.11089355],"study_design_scores_gemma":[0.000020971516,0.00002102342,0.00015000372,0.00009532598,0.000053111977,0.00056902773,0.0002464935,0.03874075,0.016570376,0.88286155,0.060636282,0.000034996836],"about_ca_topic_score_codex":0.0011371402,"about_ca_topic_score_gemma":0.001057616,"teacher_disagreement_score":0.012071128,"about_ca_system_score_codex":0.00085308263,"about_ca_system_score_gemma":0.00080011104,"threshold_uncertainty_score":0.040381968},"labels":[],"label_agreement":null},{"id":"W17089771","doi":"10.1007/978-3-642-25486-4_38","title":"Trajectory Tracking and Vibration Control of Two Planar Rigid Manipulators Moving a Flexible Object","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dynamics and Control of Mechanical Systems","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":"Concordia University","funders":"","keywords":"Control theory (sociology); Computer science; Planar; Vibration; Singular perturbation; Trajectory; Discretization; Vibration control; Rigid body; Control (management); Mathematics; Physics; Artificial intelligence; Classical mechanics; Acoustics","score_opus":0.012878750932096861,"score_gpt":0.2069048953531101,"score_spread":0.19402614442101324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17089771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42090464,0.00043694783,0.5680597,0.0003089526,0.00008112964,0.000054783188,0.000036488043,0.00024320805,0.009874192],"genre_scores_gemma":[0.98458225,0.00009468163,0.011448249,0.000013064789,0.000007652039,0.000029809496,0.000015925438,0.000008805337,0.0037996778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998994,0.000018314047,0.0000045279544,0.000018045595,0.00004247112,0.0000173263],"domain_scores_gemma":[0.9998185,0.00007239887,0.00004747726,0.000015047768,0.000031417832,0.000015151174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002787957,0.00036595966,0.00033290786,0.000253372,0.00039928503,0.0003657,0.00054157054,0.0007930573,0.0013730818],"category_scores_gemma":[0.00068772037,0.00023750096,0.00021710347,0.0002731781,0.0006123593,0.00030346977,0.00052549446,0.0002838211,0.00014944359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000516125,0.000074301126,0.0007254672,0.00015159683,0.000041312862,0.00047145507,0.00048043128,0.78002346,0.110672496,0.014424751,0.00053308933,0.091885485],"study_design_scores_gemma":[0.000025699992,0.00023312606,0.0009980048,0.000008221814,0.000008556593,0.000047599344,0.000041537205,0.99188447,0.0037194083,0.0025607175,0.00046062635,0.00001194698],"about_ca_topic_score_codex":0.003956069,"about_ca_topic_score_gemma":0.0022949425,"teacher_disagreement_score":0.003956069,"about_ca_system_score_codex":0.00033298944,"about_ca_system_score_gemma":0.00031162403,"threshold_uncertainty_score":0.007866085},"labels":[],"label_agreement":null},{"id":"W1710084411","doi":"10.1007/978-3-540-75256-1_62","title":"A Qualitative Hidden Markov Model for Spatio-temporal Reasoning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Hidden Markov model; Construct (python library); Artificial intelligence; Representation (politics); Markov process; Markov model; Markov chain; Maximum-entropy Markov model; Machine learning; Variable-order Markov model; Hidden semi-Markov model; Theoretical computer science; Programming language; Mathematics","score_opus":0.052698351172976124,"score_gpt":0.3273504401116056,"score_spread":0.27465208893862947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710084411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029387139,0.00014823266,0.99495196,0.00024780378,0.000027832499,0.00003424151,0.00038238152,0.00021899454,0.0010498273],"genre_scores_gemma":[0.44953358,0.000743245,0.54090524,0.0003402845,0.00011338706,0.000498612,0.0017141318,0.00018561087,0.0059658578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852306,0.0005856517,0.00013693822,0.00026617068,0.00036390085,0.00012431857],"domain_scores_gemma":[0.9925045,0.0057688234,0.00040696553,0.0005894337,0.0005313073,0.00019887234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031284795,0.00069644366,0.00117599,0.0013872114,0.00079457177,0.0023744758,0.0032126997,0.001489255,0.0068491367],"category_scores_gemma":[0.011370705,0.00085928245,0.0024989934,0.0017503418,0.0020294045,0.0045161163,0.0020388472,0.0024965447,0.0010774785],"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.000114158174,0.00006122854,0.00086867134,0.00019296435,0.00008275622,0.0001978141,0.00043751684,0.32034978,0.0009783729,0.6444466,0.00198738,0.030282784],"study_design_scores_gemma":[0.000013449441,0.00000949444,0.000076019256,0.000017147835,0.000018625535,0.000027531694,0.000026261107,0.69861865,0.00019387128,0.3000888,0.0008986996,0.000011511304],"about_ca_topic_score_codex":0.015938647,"about_ca_topic_score_gemma":0.014668174,"teacher_disagreement_score":0.015938647,"about_ca_system_score_codex":0.0025956417,"about_ca_system_score_gemma":0.0021602907,"threshold_uncertainty_score":0.03169173},"labels":[],"label_agreement":null},{"id":"W1710386418","doi":"10.1007/978-3-642-35999-6_10","title":"Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Elliptic curve point multiplication; Hessian matrix; Elliptic curve; Multiplication (music); Edwards curve; Arithmetic; Schoof's algorithm; Constant (computer programming); Tripling-oriented Doche–Icart–Kohel curve; Hessian form of an elliptic curve; Point (geometry); Mathematics; Field (mathematics); Finite field; Elliptic curve cryptography; Homogeneous coordinates; Computer science; Pure mathematics; Discrete mathematics; Applied mathematics; Geometry; Combinatorics; Quarter period; Encryption","score_opus":0.011772244013764047,"score_gpt":0.22372672588842044,"score_spread":0.21195448187465638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710386418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15644339,0.009704847,0.49892527,0.0016768399,0.0005277271,0.00015833868,0.000427964,0.0016736966,0.33046186],"genre_scores_gemma":[0.7521299,0.010083699,0.124525286,0.0002461094,0.0007352874,0.00013341631,0.00073222636,0.00048477997,0.110929236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948776,0.00007968594,0.000026423791,0.00004708237,0.0002712868,0.00008767043],"domain_scores_gemma":[0.9996183,0.00014550642,0.00003268483,0.00012113468,0.000059011225,0.00002343388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004519353,0.0011192119,0.00067570375,0.0012367984,0.0005330866,0.0017156376,0.00079007866,0.0003668147,0.009990896],"category_scores_gemma":[0.0010827715,0.00038263865,0.00053244137,0.0021288432,0.0011913611,0.0032206757,0.0015717428,0.0011724824,0.00280837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113642185,0.00006759107,0.00025978347,0.00029169588,0.000022958311,0.000088079905,0.00035060817,0.008210902,0.009264977,0.76421314,0.009728535,0.20738804],"study_design_scores_gemma":[0.00006595583,0.00009282033,0.00055352546,0.00011555311,0.000028991752,0.00033711363,0.00009419962,0.01416624,0.011172953,0.9165728,0.056773957,0.000025900525],"about_ca_topic_score_codex":0.00021743412,"about_ca_topic_score_gemma":0.0003473024,"teacher_disagreement_score":0.009990896,"about_ca_system_score_codex":0.0008833665,"about_ca_system_score_gemma":0.00050884014,"threshold_uncertainty_score":0.033422887},"labels":[],"label_agreement":null},{"id":"W1711276981","doi":"10.1007/978-3-540-69738-1_27","title":"Invariant Synthesis for Combined Theories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Invariant (physics); Constraint satisfaction; Correctness; Programmer; Satisfiability; Theoretical computer science; Predicate (mathematical logic); Algorithm; Programming language; Mathematics; Artificial intelligence","score_opus":0.027323790855393455,"score_gpt":0.2526834980298743,"score_spread":0.2253597071744808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1711276981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013948586,0.0012419784,0.9001455,0.00044659013,0.00027184963,0.00008574605,0.00029452235,0.0016210173,0.081944145],"genre_scores_gemma":[0.5360349,0.0013993748,0.41185558,0.00052928954,0.0003960317,0.00039309892,0.0017706432,0.0014896453,0.046131458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982653,0.00039099765,0.00012884232,0.0003291874,0.0007173703,0.00016825342],"domain_scores_gemma":[0.9985386,0.00069962,0.00007115545,0.00044773542,0.0001932576,0.000049575887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014666127,0.00080695015,0.0011050665,0.0019612806,0.0011378998,0.0030028867,0.0016049271,0.0009824062,0.018100908],"category_scores_gemma":[0.003360021,0.0008786124,0.0022287627,0.0013847314,0.0024922297,0.0057078497,0.0031065042,0.0032375557,0.0029607152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046514306,0.000027328084,0.00011149661,0.00010444143,0.000032660773,0.000051468043,0.000113643975,0.004300552,0.0014370878,0.94225955,0.0028059506,0.048709266],"study_design_scores_gemma":[0.000015524929,0.00001484979,0.00004905792,0.000034096247,0.000030166602,0.000036852245,0.000028668497,0.016614389,0.0023260203,0.97325075,0.0075885183,0.000011000668],"about_ca_topic_score_codex":0.00062836136,"about_ca_topic_score_gemma":0.0011331642,"teacher_disagreement_score":0.018100908,"about_ca_system_score_codex":0.0017278246,"about_ca_system_score_gemma":0.0007646723,"threshold_uncertainty_score":0.06055361},"labels":[],"label_agreement":null},{"id":"W1711504524","doi":"10.1007/978-3-540-77962-9_30","title":"DNA Coding Using the Subword Closure Operation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Closure (psychology); Coding (social sciences); Computer science; Encoding (memory); Theoretical computer science; Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.028887339326133774,"score_gpt":0.26077115980651655,"score_spread":0.23188382048038278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1711504524","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.032412957,0.002995743,0.7421816,0.001591015,0.0042512664,0.00015200122,0.00057250983,0.0029900915,0.21285282],"genre_scores_gemma":[0.45093924,0.003894259,0.39533663,0.0015422712,0.0025749742,0.0004100899,0.0013298945,0.0035333713,0.14043921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999476,0.00008506598,0.000057487043,0.00014944289,0.00015956779,0.000072509814],"domain_scores_gemma":[0.9991041,0.000387538,0.000049873102,0.00020991954,0.00019637804,0.000052182546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005338289,0.0006752592,0.0006965512,0.0014393438,0.00114506,0.0024626965,0.0007552912,0.00085880444,0.012437248],"category_scores_gemma":[0.0022419058,0.00039058266,0.0010646427,0.0013119607,0.0018286904,0.0038890643,0.0011818386,0.0017408229,0.004909129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008357842,0.000017266771,0.00005807291,0.00011775751,0.000009553657,0.00018330537,0.00024678197,0.0007999275,0.0075673563,0.8716498,0.009523962,0.109742604],"study_design_scores_gemma":[0.00002232688,0.000056799377,0.00010522717,0.000080552534,0.000018019198,0.00047880804,0.00006908644,0.007080914,0.012502061,0.8732397,0.10630181,0.000044542052],"about_ca_topic_score_codex":0.00083829573,"about_ca_topic_score_gemma":0.0007323735,"teacher_disagreement_score":0.012437248,"about_ca_system_score_codex":0.00064628525,"about_ca_system_score_gemma":0.00085535116,"threshold_uncertainty_score":0.041606784},"labels":[],"label_agreement":null},{"id":"W1711687279","doi":"10.1007/978-3-540-27817-7_140","title":"Indoors Pervasive Computing and Outdoors Mobile Computing for Cognitive Assistance and Telemonitoring","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Sherbrooke","funders":"","keywords":"Cognitive computing; Cognition; Ubiquitous computing; Computer science; Mobile computing; Mobile device; Cognitive impairment; Human–computer interaction; Internet privacy; Computer security; Multimedia; World Wide Web; Telecommunications; Psychology; Psychiatry","score_opus":0.021626292607424696,"score_gpt":0.2767799929008376,"score_spread":0.2551537002934129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1711687279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095863165,0.11330243,0.43673956,0.0025435705,0.0026761869,0.000090941285,0.00020838199,0.0011675628,0.4336851],"genre_scores_gemma":[0.12315223,0.084061354,0.13805254,0.001113791,0.0019596552,0.00014973109,0.0004370779,0.000304881,0.6507687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998603,0.00002093675,0.0000069555713,0.000039801354,0.00005531729,0.000016716416],"domain_scores_gemma":[0.999899,0.000042501084,0.0000053846975,0.000019118706,0.000021580632,0.000012409661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001386282,0.00059472676,0.000394858,0.00044764343,0.00029358632,0.0013267492,0.0006913112,0.00093194895,0.014706135],"category_scores_gemma":[0.00023381347,0.00031988235,0.000349382,0.0011431407,0.0005081277,0.0020911102,0.00072186475,0.0011031474,0.0047224844],"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.00003958657,0.00007497896,0.00033627125,0.00050397945,0.000021260294,0.00023355978,0.00040652498,0.0028380558,0.009706624,0.1446186,0.042043734,0.7991769],"study_design_scores_gemma":[0.00000814247,0.00012151564,0.0014909387,0.0002921482,0.00003295047,0.001957396,0.00032990056,0.010850302,0.00638616,0.07457263,0.90392387,0.00003405575],"about_ca_topic_score_codex":0.000644918,"about_ca_topic_score_gemma":0.0016993014,"teacher_disagreement_score":0.014706135,"about_ca_system_score_codex":0.00028711045,"about_ca_system_score_gemma":0.00021734207,"threshold_uncertainty_score":0.0491969},"labels":[],"label_agreement":null},{"id":"W1711938867","doi":"10.1007/978-3-642-34026-0_23","title":"A Case for “Piggyback” Runtime Monitoring","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Operating system; Programming language; Real-time computing","score_opus":0.037853219156206104,"score_gpt":0.2680435035853245,"score_spread":0.23019028442911843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1711938867","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.06266793,0.0011544977,0.7598476,0.035521682,0.0016502466,0.00025471894,0.0002359648,0.013375497,0.12529185],"genre_scores_gemma":[0.73170847,0.00041853465,0.21924303,0.0143954735,0.00081924204,0.00033379137,0.00019242936,0.0033757642,0.02951321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99161845,0.0027577914,0.00041092595,0.0018186414,0.0019651887,0.0014289404],"domain_scores_gemma":[0.9699384,0.010315835,0.0011176624,0.016278984,0.0015199526,0.0008292844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074490006,0.00080688787,0.0009138746,0.0012075796,0.00232428,0.005471526,0.003604115,0.009433059,0.008320388],"category_scores_gemma":[0.03610959,0.0011821813,0.001108455,0.0013535074,0.008580953,0.017258532,0.0059244465,0.008672894,0.0020129327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025478107,0.000107463486,0.002802127,0.00014232364,0.000031215284,0.0023390853,0.0023647854,0.00255432,0.0037424923,0.91827816,0.016989628,0.050393578],"study_design_scores_gemma":[0.0001038192,0.00011668899,0.00095527916,0.0002533503,0.00008730671,0.004282142,0.00066457404,0.034263898,0.010202465,0.8175267,0.1314545,0.000089303525],"about_ca_topic_score_codex":0.001112893,"about_ca_topic_score_gemma":0.0010883601,"teacher_disagreement_score":0.009433059,"about_ca_system_score_codex":0.0012065632,"about_ca_system_score_gemma":0.001485508,"threshold_uncertainty_score":0.039394557},"labels":[],"label_agreement":null},{"id":"W1712310231","doi":"10.1007/3-540-48080-3_7","title":"Compressibility as a Measure of Local Coherence in Web Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Measure (data warehouse); Compressibility; Link (geometry); Space (punctuation); Coherence (philosophical gambling strategy); Theoretical computer science; Data mining; Algorithm; Information retrieval; Mathematics; Computer network; Physics","score_opus":0.020416964883758604,"score_gpt":0.24502192666209177,"score_spread":0.22460496177833317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712310231","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.87486875,0.0015015819,0.11590236,0.0007131428,0.00003182525,0.000057268622,0.0007117948,0.00038725897,0.0058260835],"genre_scores_gemma":[0.9925547,0.0003418184,0.0059810453,0.00004575582,0.00008429551,0.00003605527,0.0002660559,0.00006338515,0.00062683533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992448,0.00021579176,0.00005268492,0.00016233206,0.00021996185,0.00010442543],"domain_scores_gemma":[0.9731032,0.020645017,0.0026225944,0.0020030364,0.0008483145,0.00077779935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709959,0.00029995845,0.0007142533,0.00454219,0.000734987,0.0015313785,0.0008531587,0.00095885346,0.0023348792],"category_scores_gemma":[0.012798638,0.0005115816,0.00028813796,0.0032913645,0.0019759734,0.0049336595,0.0011207109,0.0009789589,0.00018677757],"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.0019726912,0.00037120175,0.047422152,0.000841407,0.00033323403,0.0015272239,0.004281159,0.3082203,0.06035156,0.42279547,0.0067446283,0.14513905],"study_design_scores_gemma":[0.00007466932,0.00023104897,0.026567237,0.00007872696,0.00014608935,0.00077438256,0.0010516192,0.5020616,0.016430158,0.4505876,0.0019133372,0.00008351432],"about_ca_topic_score_codex":0.0010129517,"about_ca_topic_score_gemma":0.0010522592,"teacher_disagreement_score":0.00454219,"about_ca_system_score_codex":0.00076428836,"about_ca_system_score_gemma":0.00022009268,"threshold_uncertainty_score":0.00781101},"labels":[],"label_agreement":null},{"id":"W1712321737","doi":"10.1007/978-3-540-39592-8_23","title":"Clustering Supermarket Customers Using Rough Set Based Kohonen Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University","funders":"","keywords":"Self-organizing map; Cluster analysis; Computer science; Rough set; Set (abstract data type); Data mining; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.028015726172621314,"score_gpt":0.24795005245542076,"score_spread":0.21993432628279944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712321737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28541726,0.0006433108,0.70812374,0.00026356743,0.00010561077,0.00021327332,0.0003285552,0.00071044074,0.0041942713],"genre_scores_gemma":[0.8320073,0.00030250155,0.16357332,0.00005277032,0.000048822207,0.0001181177,0.0005248547,0.000042763735,0.003329527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994561,0.00008761131,0.000047525817,0.00011081362,0.00020052039,0.00009735421],"domain_scores_gemma":[0.9994098,0.00023843414,0.00005222834,0.000056194225,0.00022041124,0.00002299793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000744996,0.00065899035,0.0010950107,0.0019137264,0.0006855071,0.0013872894,0.0015299938,0.0009897122,0.0016912168],"category_scores_gemma":[0.0017456291,0.000542062,0.0012706412,0.0024364868,0.00033847537,0.0016822786,0.0005661273,0.0006443503,0.0005329143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065802276,0.00035290042,0.008904316,0.00017349054,0.00029731996,0.00029245034,0.00047073743,0.59487706,0.007936812,0.0043071974,0.0035770258,0.37815264],"study_design_scores_gemma":[0.000006240123,0.000025877447,0.0009780433,0.000005319208,0.00002056506,0.000022238954,0.00008621087,0.99563307,0.00096629804,0.0020301847,0.00021000802,0.000015888781],"about_ca_topic_score_codex":0.00964358,"about_ca_topic_score_gemma":0.010086711,"teacher_disagreement_score":0.00964358,"about_ca_system_score_codex":0.0006638593,"about_ca_system_score_gemma":0.00057938497,"threshold_uncertainty_score":0.019174933},"labels":[],"label_agreement":null},{"id":"W1712808800","doi":"10.1007/11527503_23","title":"A Genetic k-Modes Algorithm for Clustering Categorical Data","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms 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":"York University","funders":"","keywords":"Computer science; Cluster analysis; Categorical variable; Algorithm; Genetic algorithm; Data mining; Artificial intelligence; Machine learning","score_opus":0.05120452901881751,"score_gpt":0.32311428098578854,"score_spread":0.27190975196697104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712808800","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.004053739,0.00006760198,0.9945116,0.000055959357,0.00003976663,0.000051427007,0.000037999358,0.0006468408,0.00053503254],"genre_scores_gemma":[0.036913544,0.00005415676,0.96069586,0.0000654598,0.000027779874,0.00020598398,0.00015312612,0.00015503046,0.0017289924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985702,0.0004507196,0.000089157846,0.00034562405,0.0004645516,0.000079672485],"domain_scores_gemma":[0.99834585,0.00075370946,0.00008132516,0.00026762404,0.00047674874,0.00007476914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019667803,0.00083510263,0.0012602906,0.001633145,0.0013722557,0.0010970696,0.0033046422,0.0017155078,0.0038029437],"category_scores_gemma":[0.005718213,0.00085344206,0.0015900392,0.002142035,0.0009976812,0.0010662418,0.0017472918,0.0019051714,0.001588815],"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.00023834631,0.00017669878,0.0014917187,0.00010954811,0.00017823195,0.00007624039,0.00031351674,0.22833009,0.006028495,0.018846208,0.0055291546,0.7386817],"study_design_scores_gemma":[0.000047832422,0.00006012325,0.00037487302,0.000018175893,0.000031599866,0.00008139037,0.000048441554,0.97890395,0.0017426001,0.016518127,0.0021388354,0.000033983342],"about_ca_topic_score_codex":0.008496757,"about_ca_topic_score_gemma":0.009517913,"teacher_disagreement_score":0.008496757,"about_ca_system_score_codex":0.00096236385,"about_ca_system_score_gemma":0.0017122135,"threshold_uncertainty_score":0.016894639},"labels":[],"label_agreement":null},{"id":"W1713951430","doi":"10.1007/978-3-540-27796-5_22","title":"Optimal Decision Strategies in Byzantine Environments","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Correctness; Computer science; Probability distribution; Expected value; Optimal decision; Set (abstract data type); Mathematical optimization; Markov decision process; Value (mathematics); Decision rule; Decision problem; Mathematics; Algorithm; Decision tree; Artificial intelligence; Markov process; Machine learning; Statistics","score_opus":0.010876317040672745,"score_gpt":0.23847969486264273,"score_spread":0.22760337782197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1713951430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14017221,0.00093317835,0.81841147,0.0012306994,0.00008659055,0.00014456491,0.00017668077,0.0004406461,0.03840394],"genre_scores_gemma":[0.7990749,0.0009724998,0.18200675,0.00015415235,0.00006791069,0.00018425848,0.00014739258,0.00017739071,0.017214818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857676,0.00078160135,0.00006149001,0.00014886908,0.00017938229,0.00025186344],"domain_scores_gemma":[0.9973911,0.0019985305,0.00016059972,0.00015672705,0.00014677875,0.00014622536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159408,0.00088687916,0.0011254642,0.0006298675,0.0008257208,0.0029186641,0.0011653167,0.0013480297,0.0046419343],"category_scores_gemma":[0.0063149747,0.0004986397,0.0003590103,0.001014224,0.0012344851,0.003850181,0.0016850302,0.0016488628,0.0006815617],"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.00050383026,0.00008868866,0.0002847773,0.000192597,0.000039922572,0.00010831082,0.0004088134,0.19749103,0.0022092403,0.7214961,0.004355269,0.07282143],"study_design_scores_gemma":[0.00007710985,0.0000830345,0.00008409834,0.000022784912,0.000016807271,0.000042091957,0.00009548029,0.35115528,0.0012265221,0.6441327,0.003048284,0.000015910317],"about_ca_topic_score_codex":0.0009930634,"about_ca_topic_score_gemma":0.001422907,"teacher_disagreement_score":0.0046419343,"about_ca_system_score_codex":0.000997186,"about_ca_system_score_gemma":0.00089674315,"threshold_uncertainty_score":0.015528798},"labels":[],"label_agreement":null},{"id":"W1714443387","doi":"10.1007/978-3-642-20807-2_8","title":"Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Facility location problem; Steiner tree problem; Connection (principal bundle); Metric space; Combinatorics; Metric (unit); Approximation algorithm; Tree (set theory); Generalization; Latency (audio); Path (computing); Time complexity; Computer science; Linear programming; Discrete mathematics; Mathematics; Mathematical optimization; Telecommunications; Computer network; Geometry","score_opus":0.03644245027914859,"score_gpt":0.23520942682334517,"score_spread":0.1987669765441966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714443387","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.0013556934,0.00038439178,0.995142,0.00019694885,0.000043577384,0.000033698474,0.000041143583,0.00014617248,0.0026563813],"genre_scores_gemma":[0.11376861,0.0018052699,0.8669868,0.00033517406,0.00047046525,0.0005963336,0.00030819853,0.00074794143,0.014981171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979674,0.0008208073,0.000082775114,0.00025065313,0.00060844823,0.00026984795],"domain_scores_gemma":[0.99433655,0.0043389327,0.00031794465,0.0003365682,0.00050161977,0.00016836725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002833707,0.0026212514,0.0021453,0.001450307,0.0010263533,0.0026153529,0.0050692754,0.0022462865,0.008933234],"category_scores_gemma":[0.009883458,0.001797355,0.0024086928,0.0037881793,0.0014948694,0.005409039,0.0030968897,0.007812407,0.0014139041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016497436,0.0002201972,0.00027481807,0.00057244295,0.000084657586,0.00007030996,0.00025773866,0.711974,0.0029648654,0.17299375,0.011057143,0.09936505],"study_design_scores_gemma":[0.000020365886,0.000031178963,0.000050488663,0.000030412788,0.000015997035,0.000022107257,0.000032639797,0.9155387,0.00059135235,0.08158383,0.0020715871,0.00001128421],"about_ca_topic_score_codex":0.004751847,"about_ca_topic_score_gemma":0.0047583897,"teacher_disagreement_score":0.008933234,"about_ca_system_score_codex":0.0022219096,"about_ca_system_score_gemma":0.0023553353,"threshold_uncertainty_score":0.029884696},"labels":[],"label_agreement":null},{"id":"W1714637014","doi":"10.1007/978-3-642-17511-4_4","title":"On the Equality of Probabilistic Terms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Mathematical proof; Probabilistic logic; Computer science; Formalism (music); Theoretical computer science; Cryptography; Heuristics; Concatenation (mathematics); Algebra over a field; Algorithm; Mathematics; Programming language; Pure mathematics; Arithmetic; Artificial intelligence","score_opus":0.021634481731602314,"score_gpt":0.25146973096143116,"score_spread":0.22983524922982884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714637014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016749583,0.007906266,0.7183825,0.006923152,0.0013464782,0.000054496755,0.000515406,0.00026396738,0.24785823],"genre_scores_gemma":[0.66385365,0.010868456,0.20654106,0.0037485128,0.00526963,0.00033911702,0.0014262235,0.0008811942,0.10707211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393684,0.0020213316,0.0004574503,0.0011080834,0.0019659903,0.0005102662],"domain_scores_gemma":[0.9909638,0.0065387795,0.0002887968,0.0012088238,0.0007879706,0.00021173141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052135256,0.00094375585,0.001524038,0.002282283,0.0027376318,0.005107956,0.0024684079,0.0023873264,0.012026564],"category_scores_gemma":[0.015691161,0.0014244323,0.00220586,0.0030875306,0.010525201,0.021923825,0.006547526,0.009397002,0.0027990392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006480116,0.0000024443796,0.000028565693,0.000016337248,0.0000029203075,0.000013986496,0.00008846012,0.0001971843,0.000078876394,0.99487054,0.0007217901,0.0039724307],"study_design_scores_gemma":[0.0000024429214,0.0000032056794,0.000036785645,0.0000114772965,0.0000036969102,0.00003521813,0.000012117032,0.0006910325,0.000099342644,0.9941375,0.0049623107,0.000004933637],"about_ca_topic_score_codex":0.0014719274,"about_ca_topic_score_gemma":0.00089222536,"teacher_disagreement_score":0.012026564,"about_ca_system_score_codex":0.00252513,"about_ca_system_score_gemma":0.0011933623,"threshold_uncertainty_score":0.040232897},"labels":[],"label_agreement":null},{"id":"W171500847","doi":"10.1007/978-3-642-32973-9_5","title":"Lightweight Abstraction for Mathematical Computation in Java","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Western University","funders":"","keywords":"Computer science; Programming language; Java; Type safety; Generics in Java; Abstraction; Java annotation; Real time Java; Implementation; Compiler; Java concurrency; Scala; Object-oriented programming; Java Modeling Language; Theoretical computer science","score_opus":0.029473252183647262,"score_gpt":0.2711828154590352,"score_spread":0.24170956327538795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171500847","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.0055968943,0.0004670666,0.9745555,0.00029895568,0.00015181795,0.000048123038,0.00018095989,0.007537527,0.011163176],"genre_scores_gemma":[0.22404727,0.0012803875,0.7380169,0.0005458851,0.000272029,0.00028430828,0.0010536229,0.007003417,0.027496183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889874,0.00019939341,0.00012236847,0.00014518705,0.00047762934,0.00015664425],"domain_scores_gemma":[0.9987411,0.00052128546,0.0000610945,0.00048545198,0.0001264983,0.00006468965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012912897,0.00075777626,0.0009325133,0.0009003498,0.00093803916,0.0031960872,0.002062456,0.00067334424,0.01006267],"category_scores_gemma":[0.0034556445,0.00086397206,0.001734147,0.0013469394,0.0016760055,0.0064634313,0.00395257,0.003312832,0.0033307977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016479868,0.00007146254,0.00058277155,0.00034255304,0.000041581214,0.0001262322,0.00050660275,0.0037907185,0.0070116734,0.82527274,0.014945161,0.1471438],"study_design_scores_gemma":[0.00006794687,0.000035584562,0.00041093753,0.000120570134,0.000070674534,0.00026478485,0.000076360855,0.045870017,0.0085476935,0.82669556,0.11778968,0.000050185143],"about_ca_topic_score_codex":0.0014301881,"about_ca_topic_score_gemma":0.002781798,"teacher_disagreement_score":0.01006267,"about_ca_system_score_codex":0.0011008778,"about_ca_system_score_gemma":0.0012110267,"threshold_uncertainty_score":0.033662975},"labels":[],"label_agreement":null},{"id":"W171557998","doi":"10.1007/978-3-642-34106-9_14","title":"On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Realizability; Domain adaptation; Task (project management); Domain (mathematical analysis); Matching (statistics); Generalization; Artificial intelligence; Labeled data; Class (philosophy); Sample (material); Adaptation (eye); Dimension (graph theory); Function (biology); Concept class; Test data; Machine learning; Pattern recognition (psychology); Algorithm; Mathematics; Statistics; Classifier (UML)","score_opus":0.037028903000383764,"score_gpt":0.2421709051910609,"score_spread":0.20514200219067713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171557998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028608857,0.005260432,0.947241,0.0056135333,0.00019169257,0.00012008324,0.00052294775,0.0003588321,0.012082712],"genre_scores_gemma":[0.641255,0.009979898,0.3216396,0.0036077278,0.0023799608,0.0008277284,0.002172562,0.0009401387,0.01719734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923718,0.003946234,0.00039793414,0.0016670139,0.0011643716,0.00045263534],"domain_scores_gemma":[0.8367797,0.15244494,0.0012878578,0.006576298,0.0018920824,0.001019063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013357656,0.0018887888,0.0050987825,0.0020853668,0.0019451624,0.004124695,0.005277823,0.0054390607,0.005359332],"category_scores_gemma":[0.07632598,0.0015746106,0.0026544768,0.0033264488,0.008678501,0.01696634,0.009564209,0.012202211,0.0008699185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012894627,0.00031086526,0.0029281399,0.0013492039,0.00034764945,0.0004242714,0.0009869474,0.33371943,0.002848933,0.491299,0.019323735,0.1451724],"study_design_scores_gemma":[0.00006558982,0.00006702144,0.0006491721,0.00009797435,0.0000465168,0.00020834286,0.000080712336,0.4058876,0.00076324696,0.59049124,0.0016070749,0.00003540692],"about_ca_topic_score_codex":0.0046293205,"about_ca_topic_score_gemma":0.0024728607,"teacher_disagreement_score":0.013357656,"about_ca_system_score_codex":0.0025137772,"about_ca_system_score_gemma":0.0018531326,"threshold_uncertainty_score":0.07064289},"labels":[],"label_agreement":null},{"id":"W1716671087","doi":"10.1007/11566489_3","title":"3D TRUS Guided Robot Assisted Prostate Brachytherapy","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials","funders":"","keywords":"Brachytherapy; Prostate brachytherapy; Imaging phantom; Segmentation; Computer science; 3D ultrasound; Robot; Computer vision; Radiation treatment planning; Ultrasound; Artificial intelligence; Prostate; Image segmentation; Medical physics; Medicine; Radiology; Radiation therapy; Cancer","score_opus":0.012249313971832395,"score_gpt":0.29450202732640024,"score_spread":0.28225271335456786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1716671087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13004269,0.0052938364,0.8376331,0.0006538019,0.0005873439,0.00033074725,0.00142565,0.009274692,0.014758152],"genre_scores_gemma":[0.66896033,0.001454801,0.31503814,0.0004157287,0.00011353998,0.00021143936,0.0005650829,0.0013673317,0.011873599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999613,0.00007123352,0.000028877856,0.000050338138,0.0001993758,0.00003723607],"domain_scores_gemma":[0.9997702,0.000085222426,0.000034290228,0.00006226497,0.000025972538,0.000022019874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655165,0.00077956327,0.0006452033,0.0005423501,0.000306411,0.0011056367,0.00082037406,0.0010727609,0.004679339],"category_scores_gemma":[0.00053803995,0.00087798975,0.0009783654,0.00042591745,0.00043775758,0.00036227357,0.0007312598,0.0006270464,0.00095332233],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021073765,0.0002660449,0.0021249147,0.0007756479,0.00026680971,0.0015219883,0.00047140385,0.42019865,0.34832093,0.0029342927,0.009757521,0.21125443],"study_design_scores_gemma":[0.00034422803,0.0014236037,0.011455725,0.000119249635,0.00031362934,0.009153277,0.00011575102,0.7783529,0.16265278,0.0023298932,0.033199854,0.00053920294],"about_ca_topic_score_codex":0.003016393,"about_ca_topic_score_gemma":0.004933725,"teacher_disagreement_score":0.004679339,"about_ca_system_score_codex":0.0004440465,"about_ca_system_score_gemma":0.00080586976,"threshold_uncertainty_score":0.015653968},"labels":[],"label_agreement":null},{"id":"W1716855832","doi":"10.1007/10720115_12","title":"Efficient Communication Using Message Prediction for Cluster of Multiprocessors","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Uniprocessor system; Message passing; Overhead (engineering); Cache; User space; Message broker; Computer network; Locality; Copying; Parallel computing; Multiprocessing; Operating system","score_opus":0.021304963648798747,"score_gpt":0.2709031792857305,"score_spread":0.24959821563693174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1716855832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15676126,0.0024634793,0.8218133,0.0005284096,0.00033041494,0.0001056536,0.00027091568,0.009744904,0.0079818135],"genre_scores_gemma":[0.7687551,0.0006513633,0.22273421,0.000064202475,0.00015842255,0.00013361832,0.00057631277,0.00034567786,0.006581068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995821,0.00012228507,0.000025689216,0.00005683769,0.00012944473,0.00008362228],"domain_scores_gemma":[0.9989629,0.00045547826,0.000057963865,0.00031962412,0.00015797529,0.00004594034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057230843,0.0006375903,0.0007202966,0.0008163537,0.00086704775,0.00071970373,0.0015302546,0.0005748519,0.002381589],"category_scores_gemma":[0.0019161452,0.00044906986,0.00027874892,0.001280945,0.00038837275,0.0014503043,0.0008507866,0.0007539622,0.0005384068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013453319,0.00024532745,0.0021392526,0.000271831,0.000081020844,0.0001441386,0.00020881816,0.51248753,0.03619839,0.024469197,0.022001473,0.4004077],"study_design_scores_gemma":[0.000025708101,0.00008563183,0.00028877132,0.000007824857,0.000016585516,0.0000238913,0.000016010152,0.9762412,0.011161816,0.009938489,0.0021834564,0.0000106346115],"about_ca_topic_score_codex":0.0029780779,"about_ca_topic_score_gemma":0.0033672238,"teacher_disagreement_score":0.0029780779,"about_ca_system_score_codex":0.0005333658,"about_ca_system_score_gemma":0.0006710747,"threshold_uncertainty_score":0.007967234},"labels":[],"label_agreement":null},{"id":"W1717774950","doi":"10.1007/978-3-540-79549-0_37","title":"Modeling Priority-Based Incentive Policies for Peer-Assisted Content Delivery Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Incentive; Content delivery; Peer-to-peer; Distributed computing; Computer network; Microeconomics","score_opus":0.05625852938232893,"score_gpt":0.2625402236996901,"score_spread":0.20628169431736118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717774950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060386233,0.0012082551,0.92585784,0.0014998723,0.00030525972,0.00030606074,0.00029271076,0.00043972427,0.009704039],"genre_scores_gemma":[0.91059405,0.0012026106,0.07070117,0.0001675893,0.00025762946,0.00037054232,0.00018889927,0.00015517608,0.016362367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752194,0.0008634416,0.00011609844,0.0003612328,0.00053093303,0.0006063581],"domain_scores_gemma":[0.9908103,0.006819815,0.0005908782,0.00025373226,0.0010705444,0.0004547059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048971237,0.0011446308,0.0020866701,0.0011219046,0.0009931268,0.0032383308,0.004155417,0.0029304118,0.0063042603],"category_scores_gemma":[0.015827019,0.0013648643,0.0011166369,0.0015715993,0.0013603495,0.003388247,0.0015753463,0.0022375388,0.00063296553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006632854,0.000068370035,0.0002654073,0.000054018965,0.00002008506,0.000042477557,0.00005914423,0.9491364,0.0004368746,0.043468945,0.0009053211,0.005476511],"study_design_scores_gemma":[0.000008771916,0.00000987728,0.000030356634,0.0000032587784,0.0000050961694,0.0000065531917,0.000007908299,0.99334747,0.00005044131,0.006355304,0.00017105509,0.00000389725],"about_ca_topic_score_codex":0.016001074,"about_ca_topic_score_gemma":0.008760133,"teacher_disagreement_score":0.016001074,"about_ca_system_score_codex":0.004543471,"about_ca_system_score_gemma":0.0038714113,"threshold_uncertainty_score":0.032965302},"labels":[],"label_agreement":null},{"id":"W171785542","doi":"10.1007/978-3-319-12571-8_17","title":"Fast Simultaneous Clustering and Feature Selection for Binary Data","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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 Ottawa","funders":"","keywords":"Cluster analysis; Computer science; Feature selection; Feature (linguistics); Data mining; Correlation clustering; Expectation–maximization algorithm; Context (archaeology); CURE data clustering algorithm; Canopy clustering algorithm; Selection (genetic algorithm); Artificial intelligence; Pattern recognition (psychology); Machine learning; Algorithm; Mathematics; Maximum likelihood; Statistics","score_opus":0.025987960295501118,"score_gpt":0.27931322445216256,"score_spread":0.25332526415666146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171785542","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.0023800423,0.0002020165,0.9960226,0.00004893893,0.000036023415,0.000025621865,0.00008053291,0.0009792213,0.00022504354],"genre_scores_gemma":[0.044401634,0.0002292893,0.9520902,0.0000648686,0.0000951402,0.00017067486,0.00077454955,0.00032274172,0.0018509479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977181,0.00051994197,0.0001443523,0.00049328274,0.00091577007,0.00020849549],"domain_scores_gemma":[0.99558735,0.0025833605,0.00018618224,0.00082751334,0.00066726806,0.00014829196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384634,0.0017091834,0.0030485233,0.0027093878,0.0010354137,0.0017185909,0.0033705796,0.0018104998,0.0047786636],"category_scores_gemma":[0.007814229,0.0017220688,0.0024883447,0.004303197,0.0008130764,0.0025087725,0.003576997,0.0023639875,0.0035044542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049377984,0.00009822199,0.0006646993,0.0002883273,0.00019603012,0.00012052328,0.00012478627,0.05387429,0.020057017,0.008452486,0.009990836,0.9056389],"study_design_scores_gemma":[0.00004451362,0.00006233567,0.0011133348,0.000018270586,0.00005148653,0.0002343524,0.000044219978,0.95714605,0.008882359,0.028749574,0.0036099493,0.00004358959],"about_ca_topic_score_codex":0.0043203784,"about_ca_topic_score_gemma":0.007593764,"teacher_disagreement_score":0.0047786636,"about_ca_system_score_codex":0.00072709564,"about_ca_system_score_gemma":0.00125687,"threshold_uncertainty_score":0.015986204},"labels":[],"label_agreement":null},{"id":"W1718341272","doi":"10.1007/3-540-44645-1_18","title":"Multilingual Information Retrieval Based on Parallel Texts from the Web","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Clef; Machine translation; Information retrieval; Parallel corpora; Cross-language information retrieval; Artificial intelligence; Natural language processing; Task (project management); Web page; World Wide Web","score_opus":0.018873960000008832,"score_gpt":0.2507413725531626,"score_spread":0.23186741255315377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1718341272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12825903,0.011849009,0.79962146,0.0018267389,0.0007977145,0.0004811405,0.004619722,0.011630627,0.040914547],"genre_scores_gemma":[0.4007663,0.007886554,0.545829,0.00046358985,0.0013144788,0.00044034922,0.015204636,0.0012423666,0.026852757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.0002891013,0.000112838374,0.00017535148,0.0002819242,0.00006751362],"domain_scores_gemma":[0.99845934,0.00082323333,0.00009640993,0.00018317073,0.00037192335,0.000065874905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006175537,0.0007286841,0.0011605275,0.0056511667,0.00093335164,0.0028366377,0.00080194644,0.00074497936,0.009505312],"category_scores_gemma":[0.0038229323,0.00041097685,0.00072171784,0.005264392,0.00052916363,0.0060636313,0.0018446933,0.0008480827,0.006155156],"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.0014101604,0.00035467526,0.0010655073,0.0013061531,0.00017876123,0.0009322191,0.0005064256,0.007790829,0.06377114,0.018250298,0.029253935,0.87518],"study_design_scores_gemma":[0.00047757427,0.00079499936,0.005790822,0.0004976858,0.00097212754,0.0038814112,0.0013935505,0.50492996,0.1855273,0.12630907,0.16908643,0.00033916187],"about_ca_topic_score_codex":0.0011636296,"about_ca_topic_score_gemma":0.0018027931,"teacher_disagreement_score":0.009505312,"about_ca_system_score_codex":0.0005176774,"about_ca_system_score_gemma":0.0006422042,"threshold_uncertainty_score":0.031798422},"labels":[],"label_agreement":null},{"id":"W171902450","doi":"10.1007/978-3-642-33783-3_58","title":"Disentangling Factors of Variation for Facial Expression Recognition","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":220,"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":"Computer science; Discriminative model; Artificial intelligence; Pattern recognition (psychology); Facial expression; Variation (astronomy); Facial recognition system; Identity (music); Face (sociological concept); Convolutional neural network; Feature (linguistics); Representation (politics); Expression (computer science); Computer vision","score_opus":0.03409717337005101,"score_gpt":0.25768890174365044,"score_spread":0.22359172837359942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171902450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11672602,0.0033299725,0.8703459,0.00021394856,0.0001759673,0.00008228473,0.00067870243,0.0011912376,0.0072559323],"genre_scores_gemma":[0.7088198,0.002918822,0.2756698,0.0001288658,0.00025668676,0.000189042,0.002126088,0.0010127297,0.008878128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.0003418691,0.0000368102,0.00024272063,0.00027762767,0.00012725142],"domain_scores_gemma":[0.9976731,0.001603063,0.00009455105,0.0002957733,0.00027487532,0.000058705005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012886217,0.001156906,0.0008783838,0.0010450867,0.00037509625,0.0011723181,0.00056698703,0.0005984774,0.0032240208],"category_scores_gemma":[0.004767537,0.00040349038,0.0010755095,0.0014838086,0.00038892752,0.0014119457,0.0008325232,0.0010532928,0.0017155347],"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.00062354753,0.00012419725,0.006718088,0.00019514127,0.00018171499,0.00012406147,0.00018027732,0.010710466,0.18834682,0.004155701,0.0018553552,0.78678447],"study_design_scores_gemma":[0.000057512287,0.00076869683,0.10552229,0.00015123235,0.0007841377,0.0015141584,0.0004226851,0.66181225,0.18440738,0.024583947,0.019705705,0.00026994685],"about_ca_topic_score_codex":0.0012957063,"about_ca_topic_score_gemma":0.003373304,"teacher_disagreement_score":0.0032240208,"about_ca_system_score_codex":0.00020821557,"about_ca_system_score_gemma":0.00042709976,"threshold_uncertainty_score":0.010785401},"labels":[],"label_agreement":null},{"id":"W1719300925","doi":"10.1007/3-540-46117-5_33","title":"A Flexible Power Model for FPGAs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":178,"is_retracted":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":"Field-programmable gate array; Computer science; CAD; Computer architecture; Design flow; Embedded system; Variety (cybernetics); Power (physics); Power optimization; Reconfigurable computing; Power analysis; Engineering; Engineering drawing; Artificial intelligence; Power consumption; Algorithm","score_opus":0.020180958157515288,"score_gpt":0.2200088772479058,"score_spread":0.19982791909039052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719300925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008963725,0.00073861744,0.9562639,0.00030125043,0.00011251433,0.000041248823,0.00022598168,0.00062296726,0.032729845],"genre_scores_gemma":[0.69835466,0.0020555027,0.23738423,0.00038616688,0.00015535159,0.00023978837,0.0005127529,0.00079356,0.060118023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983764,0.000032184886,0.000008798876,0.00002775744,0.00006699966,0.000026560525],"domain_scores_gemma":[0.9998499,0.000051654904,0.000009109533,0.00004804872,0.000032977958,0.000008326151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019523488,0.00067044445,0.00040877896,0.0003458706,0.00032399353,0.000984746,0.0015159335,0.0006177971,0.008839677],"category_scores_gemma":[0.0007661066,0.00033441055,0.00058794324,0.00053685124,0.00041860752,0.0017080202,0.0005801064,0.0011175467,0.0019901462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080249054,0.000030296635,0.0001542032,0.00013671564,0.00002008941,0.00017233987,0.000077210534,0.6332913,0.006952747,0.2863391,0.004309042,0.068436556],"study_design_scores_gemma":[0.000015355188,0.000033465745,0.000059321454,0.000015835003,0.000010491351,0.00009399656,0.000014025528,0.906172,0.0014292389,0.07975636,0.012392234,0.000007699558],"about_ca_topic_score_codex":0.0009202887,"about_ca_topic_score_gemma":0.0013678812,"teacher_disagreement_score":0.008839677,"about_ca_system_score_codex":0.00038837735,"about_ca_system_score_gemma":0.0002603306,"threshold_uncertainty_score":0.029571652},"labels":[],"label_agreement":null},{"id":"W1719847780","doi":"10.1007/978-3-642-38768-5_24","title":"Approximating the Minimum Independent Dominating Set in Perturbed Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Independent set; Graph; Discrete mathematics; Approximation algorithm; Running time; Time complexity; Simple (philosophy); Algorithm","score_opus":0.02306009861298433,"score_gpt":0.24525928156052923,"score_spread":0.2221991829475449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719847780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21655868,0.002112488,0.7703322,0.0009638453,0.00022522354,0.00018162109,0.00093506364,0.0009880419,0.00770288],"genre_scores_gemma":[0.71348226,0.0012511228,0.27751365,0.00024191495,0.00020251806,0.00020627164,0.0016272038,0.00040806085,0.0050670113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850637,0.000529386,0.000055484892,0.0003511636,0.00039482306,0.00016270665],"domain_scores_gemma":[0.99403024,0.004115382,0.00043798264,0.0006737388,0.000411992,0.00033073753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016262153,0.0021265857,0.0024355764,0.0017622773,0.0007666255,0.002111147,0.004102122,0.0018676025,0.002126543],"category_scores_gemma":[0.011588194,0.0012055442,0.0010627983,0.0024781607,0.0013366275,0.003219208,0.0026974434,0.0022483992,0.00060441525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050049333,0.00010168003,0.0010457693,0.00029280904,0.00008224772,0.00010574513,0.00013716161,0.93250823,0.0040650936,0.022606634,0.0036106764,0.034943458],"study_design_scores_gemma":[0.000013713074,0.000037528036,0.00016579512,0.000013271004,0.000014601697,0.00005645474,0.000028365686,0.96715015,0.00085877354,0.031218113,0.0004378379,0.0000053649674],"about_ca_topic_score_codex":0.002115627,"about_ca_topic_score_gemma":0.0020210682,"teacher_disagreement_score":0.004102122,"about_ca_system_score_codex":0.0026467938,"about_ca_system_score_gemma":0.0007541897,"threshold_uncertainty_score":0.019203901},"labels":[],"label_agreement":null},{"id":"W1720038619","doi":"10.1007/3-540-45314-8_12","title":"On the Importance of Inter-scenario Relationships in Hierarchical State Machine Design","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Dependency (UML); Computer science; GRASP; Finite-state machine; Focus (optics); State (computer science); Transition (genetics); Unified Modeling Language; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.03907731184482111,"score_gpt":0.26462271314516483,"score_spread":0.22554540130034373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1720038619","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.03573424,0.000692103,0.9453123,0.0009892577,0.000071933246,0.00010400149,0.00005823532,0.00023058803,0.016807295],"genre_scores_gemma":[0.7240149,0.0009976445,0.27149042,0.00023710048,0.00011053391,0.00018417707,0.00015096557,0.00015652072,0.0026576985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581003,0.002389057,0.00025319756,0.00031575322,0.0009921816,0.00023979695],"domain_scores_gemma":[0.9593251,0.035720855,0.0010481488,0.0025016346,0.0010463222,0.00035808762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005585752,0.0005690421,0.0005858079,0.00066372927,0.001255222,0.0022100222,0.0013029235,0.001587578,0.0047943774],"category_scores_gemma":[0.03812968,0.0010925339,0.0006809968,0.0010416489,0.0029195105,0.00969059,0.002531434,0.0036381276,0.0003991379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024705663,0.00013177627,0.002333488,0.0003060199,0.000040923067,0.0001905105,0.0007851364,0.31395575,0.0026201757,0.56666714,0.0020167155,0.11070531],"study_design_scores_gemma":[0.000025773139,0.0001007098,0.000428651,0.000067582994,0.000046356887,0.00007990281,0.00013399248,0.49867767,0.0016762762,0.4957801,0.0029609236,0.000022099537],"about_ca_topic_score_codex":0.0020642686,"about_ca_topic_score_gemma":0.0042819497,"teacher_disagreement_score":0.005585752,"about_ca_system_score_codex":0.0009554652,"about_ca_system_score_gemma":0.0009439785,"threshold_uncertainty_score":0.029540598},"labels":[],"label_agreement":null},{"id":"W1720479741","doi":"10.1007/11751069_12","title":"Evaluation of Sensors as Input Devices for Computer Music Interfaces","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Computer science; Computer music; Human–computer interaction; Musical; Interface (matter); Work (physics); Multimedia; User interface; Programming language; Visual arts","score_opus":0.037644035371040885,"score_gpt":0.28321997907847046,"score_spread":0.24557594370742958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1720479741","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.92772704,0.005937735,0.05439385,0.00034132565,0.0003454461,0.000881219,0.00071206084,0.00051085994,0.009150426],"genre_scores_gemma":[0.9646461,0.0020734256,0.026232043,0.00013553261,0.00008246735,0.00024221957,0.0006013628,0.0001305888,0.005856188],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962573,0.0014542151,0.0002400706,0.00032911854,0.0015214385,0.00019786503],"domain_scores_gemma":[0.9903206,0.006264359,0.00032817168,0.00040366134,0.0024835365,0.0001996614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033732334,0.0013047621,0.0006599762,0.0009775907,0.00037433015,0.001631249,0.0015883007,0.0014105102,0.008974718],"category_scores_gemma":[0.016133174,0.00048115666,0.00058133405,0.0005543164,0.0005756697,0.0017774657,0.00094344706,0.00031853997,0.0010278284],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04288076,0.002997616,0.014371066,0.004151113,0.0005104359,0.0004947522,0.0010155374,0.008564578,0.45890525,0.0021724612,0.0024487583,0.46148783],"study_design_scores_gemma":[0.0020167604,0.07797775,0.0595976,0.0005984865,0.0028519237,0.0022820916,0.0024315591,0.09463428,0.73710823,0.002485263,0.017817236,0.00019884181],"about_ca_topic_score_codex":0.0008426435,"about_ca_topic_score_gemma":0.00081257493,"teacher_disagreement_score":0.008974718,"about_ca_system_score_codex":0.0006040469,"about_ca_system_score_gemma":0.00036098988,"threshold_uncertainty_score":0.030023456},"labels":[],"label_agreement":null},{"id":"W1721236287","doi":"10.1007/978-3-540-27868-9_70","title":"A New Family of Weak Estimators for Training in Non-stationary Distributions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","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 Windsor; Carleton University","funders":"","keywords":"Estimator; Multinomial distribution; Computer science; Convergence (economics); Variance (accounting); Binomial distribution; Variation (astronomy); Stationary distribution; Negative binomial distribution; Algorithm; Artificial intelligence; Mathematics; Machine learning; Statistics","score_opus":0.016506037305955804,"score_gpt":0.26917458906531094,"score_spread":0.25266855175935515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1721236287","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.0008960775,0.00036540715,0.99811125,0.00007348171,0.000058755322,0.00001974989,0.00003269278,0.00013842185,0.0003041944],"genre_scores_gemma":[0.047252193,0.002304824,0.94010514,0.0005903954,0.0007912677,0.000531118,0.0007681842,0.00061290554,0.0070439926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479705,0.0025317713,0.00037092512,0.000744623,0.0013356213,0.00021996316],"domain_scores_gemma":[0.9778657,0.015156083,0.00093425263,0.0026012256,0.0028547319,0.00058817054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01586003,0.003363088,0.0027223665,0.0029060426,0.0009465551,0.0025793298,0.0045623807,0.0034241423,0.0038267553],"category_scores_gemma":[0.05464956,0.0016939492,0.0023354094,0.0026527187,0.0023662478,0.006160581,0.005847027,0.0056139985,0.0023043128],"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.00047021292,0.00020781423,0.0036276986,0.00077053683,0.000507985,0.00022234971,0.00031184856,0.09850209,0.014154415,0.2692235,0.011434144,0.6005674],"study_design_scores_gemma":[0.00005713525,0.00025596915,0.00076079555,0.0001481888,0.00014382304,0.00039013184,0.000037305945,0.8321476,0.0050231144,0.1484271,0.012545816,0.000063046646],"about_ca_topic_score_codex":0.0006910276,"about_ca_topic_score_gemma":0.00089833554,"teacher_disagreement_score":0.01586003,"about_ca_system_score_codex":0.00089420873,"about_ca_system_score_gemma":0.0012850919,"threshold_uncertainty_score":0.08387691},"labels":[],"label_agreement":null},{"id":"W1721397663","doi":"10.1007/978-3-540-31807-1_13","title":"Collaborative Computer-Aided Parameter Exploration for Music and Animation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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 Regina","funders":"","keywords":"Computer science; Animation; Sonification; Variation (astronomy); Computer animation; Visualization; Software; Interface (matter); Human–computer interaction; Computer music; Graphical user interface; Computer graphics (images); Musical; Programming language; Artificial intelligence; Visual arts; Art","score_opus":0.0279120446074879,"score_gpt":0.25622175671146286,"score_spread":0.22830971210397497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1721397663","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.015923629,0.00023080046,0.96407783,0.000041113384,0.000044428696,0.000087759836,0.000069826,0.006485484,0.013039021],"genre_scores_gemma":[0.28200528,0.0002653896,0.6933786,0.00005294475,0.000038299044,0.00024816906,0.0003368213,0.0016131814,0.022061385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993699,0.000117898024,0.000026623578,0.00012370248,0.00029181404,0.00007021962],"domain_scores_gemma":[0.9990017,0.00060333055,0.000029526316,0.00022287176,0.000094151575,0.000048404756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656295,0.0014119867,0.0014128125,0.00088008534,0.0009160587,0.0013897602,0.0023764702,0.0015282712,0.03172157],"category_scores_gemma":[0.0021556765,0.0007654779,0.0008525419,0.00080693327,0.00053544104,0.0013679947,0.0031675263,0.0009292663,0.0040466515],"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.00079343375,0.00036768982,0.0005306805,0.0003460642,0.00009359603,0.0004318626,0.0010636619,0.06829522,0.16184278,0.011546651,0.010606119,0.74408233],"study_design_scores_gemma":[0.00017627259,0.0003376482,0.000986214,0.00006902947,0.00007744305,0.00094032276,0.0003406224,0.8236118,0.110580035,0.014165293,0.04858584,0.00012948162],"about_ca_topic_score_codex":0.0015411429,"about_ca_topic_score_gemma":0.0026333705,"teacher_disagreement_score":0.03172157,"about_ca_system_score_codex":0.0003620909,"about_ca_system_score_gemma":0.00041481623,"threshold_uncertainty_score":0.106119215},"labels":[],"label_agreement":null},{"id":"W172250868","doi":"10.1007/978-3-642-30950-2_26","title":"Automating Next-Step Hints Generation Using ASTUS","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.05864968123343533,"score_gpt":0.27267474862018865,"score_spread":0.2140250673867533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172250868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03548146,0.0005755994,0.8402351,0.00016115066,0.0002873391,0.0002365991,0.0010785873,0.116677165,0.005267],"genre_scores_gemma":[0.23742203,0.00019401459,0.7506056,0.00015899807,0.000034740147,0.00018820433,0.0022491466,0.002699542,0.0064477855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919266,0.00014554992,0.00009500306,0.00018853962,0.00030323607,0.00007496778],"domain_scores_gemma":[0.99818194,0.000864378,0.00009450523,0.0002766781,0.00048079932,0.00010173596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591634,0.0015566362,0.0010391967,0.0013049329,0.0005267223,0.0014259204,0.0019130554,0.001141407,0.011523978],"category_scores_gemma":[0.004207485,0.0007665269,0.000824102,0.00072099327,0.000353581,0.0015352191,0.0020517968,0.0013311469,0.0057337764],"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.0013441158,0.00025941984,0.0026171524,0.00054070423,0.00008734484,0.00042975624,0.00039841325,0.015262992,0.05809868,0.0040304814,0.023143385,0.8937875],"study_design_scores_gemma":[0.00016324144,0.00025454132,0.0016526147,0.00012171865,0.00012929899,0.0005240943,0.00018552002,0.7830604,0.18082748,0.0068368223,0.026147865,0.00009647194],"about_ca_topic_score_codex":0.0033296533,"about_ca_topic_score_gemma":0.0040407977,"teacher_disagreement_score":0.011523978,"about_ca_system_score_codex":0.00044613093,"about_ca_system_score_gemma":0.001053204,"threshold_uncertainty_score":0.03855157},"labels":[],"label_agreement":null},{"id":"W1722563966","doi":"10.1007/11537847_12","title":"A Proxy Design Pattern to Support Real-Time Distributed Control System Benchmarking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science; Benchmarking; Java; Distributed design patterns; Distributed computing; Control (management); Real-time computing; Operating system; Embedded system; Distributed algorithm; Artificial intelligence","score_opus":0.048528312785524254,"score_gpt":0.3310015175432071,"score_spread":0.28247320475768284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722563966","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.0053245802,0.000061067454,0.97022825,0.00016802739,0.00013077952,0.0002858924,0.0001225223,0.018495597,0.0051833284],"genre_scores_gemma":[0.20800006,0.00011173924,0.76607376,0.00057904824,0.00010046796,0.00075970363,0.0007805847,0.008416361,0.015178258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440587,0.0017568682,0.00096003246,0.00063909416,0.0017662962,0.0004717995],"domain_scores_gemma":[0.9858495,0.0021829791,0.00072932057,0.007997562,0.0025319357,0.00070871296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065370006,0.0010289482,0.0009627192,0.001302529,0.00081481104,0.0032180622,0.0038365908,0.0020462507,0.010111121],"category_scores_gemma":[0.020709177,0.0010716496,0.0007983327,0.0011561409,0.0009915484,0.0036622537,0.0030238691,0.0028465132,0.0039613578],"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.0021893869,0.0010852328,0.008002498,0.0010651294,0.00026812256,0.0014330908,0.0018912741,0.060548265,0.094480075,0.17280275,0.059980147,0.59625405],"study_design_scores_gemma":[0.00053303316,0.00086732965,0.0017226553,0.0002567852,0.00017882952,0.0015757206,0.00021046246,0.5465824,0.16177557,0.059264276,0.22680415,0.0002288026],"about_ca_topic_score_codex":0.0008345859,"about_ca_topic_score_gemma":0.0016241712,"teacher_disagreement_score":0.010111121,"about_ca_system_score_codex":0.0007488043,"about_ca_system_score_gemma":0.0014074275,"threshold_uncertainty_score":0.03457141},"labels":[],"label_agreement":null},{"id":"W1724543665","doi":"10.1007/978-3-642-05031-2_3","title":"Testing k-Safe Petri Nets","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Ottawa","funders":"","keywords":"Petri net; Computer science; Conformance testing; Formal specification; Programming language; Formal methods; Process architecture; Finite-state machine; Formal verification; Theoretical computer science; Operating system","score_opus":0.03099014295615103,"score_gpt":0.2624275698264454,"score_spread":0.23143742687029434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1724543665","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.13511725,0.0005476644,0.82814246,0.00044928055,0.000189177,0.00010284728,0.00020238325,0.0039138,0.031335145],"genre_scores_gemma":[0.87103945,0.00038667527,0.117135786,0.00012582105,0.00002869973,0.000059739836,0.00045006783,0.00050106423,0.010272778],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976816,0.0004315534,0.00017101482,0.00033503614,0.0011323906,0.0002483891],"domain_scores_gemma":[0.9937337,0.004069703,0.00026341228,0.00089248444,0.0008416111,0.00019909054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061125,0.0010970666,0.00060852815,0.0007959532,0.00055783597,0.0013095477,0.002509455,0.000980351,0.0039348747],"category_scores_gemma":[0.0067770816,0.0007062575,0.00075228827,0.00066533155,0.0016932752,0.0035108426,0.0015610891,0.0014100664,0.0011837318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009947282,0.00032310918,0.0074224835,0.00084918406,0.0001711553,0.0026276219,0.0014729407,0.19492562,0.10454167,0.2043218,0.005364363,0.47698537],"study_design_scores_gemma":[0.00008735589,0.00027993042,0.0015179793,0.00024937643,0.00010036839,0.001166822,0.00048607594,0.40520856,0.12603904,0.45152736,0.013259535,0.00007749665],"about_ca_topic_score_codex":0.0018681127,"about_ca_topic_score_gemma":0.0022964834,"teacher_disagreement_score":0.0039348747,"about_ca_system_score_codex":0.000992224,"about_ca_system_score_gemma":0.0010505185,"threshold_uncertainty_score":0.013163447},"labels":[],"label_agreement":null},{"id":"W1724546534","doi":"10.1007/978-3-319-21999-8_12","title":"On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","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 British Columbia","funders":"","keywords":"Computer science; Nucleic acid; Folding (DSP implementation); Energy (signal processing); Chemistry; Biochemistry; Electrical engineering; Mathematics; Engineering","score_opus":0.017991993252679615,"score_gpt":0.2609122592176847,"score_spread":0.24292026596500507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1724546534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24198416,0.040970728,0.5466499,0.002654721,0.001657642,0.00024659475,0.0005429197,0.001510059,0.16378339],"genre_scores_gemma":[0.70057964,0.030750861,0.1475643,0.0005997282,0.00024804584,0.00030494566,0.001341857,0.0010546217,0.11755606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999082,0.000016215125,0.000004740015,0.000019901643,0.00003386901,0.000017050203],"domain_scores_gemma":[0.9998741,0.00006669202,0.0000073153064,0.000021572665,0.000018973033,0.0000113582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027120218,0.00074747787,0.0005066239,0.00043844705,0.00069957454,0.0010129831,0.00085148524,0.0006757401,0.0077264924],"category_scores_gemma":[0.0006140624,0.00040235918,0.00055298914,0.00053883594,0.00063909456,0.0020366295,0.0007630257,0.001386837,0.0019930606],"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.00015769486,0.00009037915,0.0002220749,0.0005198308,0.000023136652,0.00030810531,0.0003646866,0.044025406,0.050942298,0.78421605,0.0060400944,0.11309024],"study_design_scores_gemma":[0.000011445545,0.00006994911,0.0001816142,0.000071698785,0.0000060744183,0.00019898465,0.00007808106,0.047393106,0.015079556,0.9165153,0.02036886,0.000025320362],"about_ca_topic_score_codex":0.00037405087,"about_ca_topic_score_gemma":0.0003389562,"teacher_disagreement_score":0.0077264924,"about_ca_system_score_codex":0.00074954145,"about_ca_system_score_gemma":0.0003130032,"threshold_uncertainty_score":0.025847673},"labels":[],"label_agreement":null},{"id":"W172536852","doi":"10.1007/978-3-642-23623-5_48","title":"Monitoring of Tissue Ablation Using Time Series of Ultrasound RF Data","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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 British Columbia; Queen's University","funders":"","keywords":"Ablation; Series (stratigraphy); Rf ablation; Ultrasound; Biomedical engineering; Medicine; Radiology; Internal medicine; Geology; Radiofrequency ablation","score_opus":0.036563538485744285,"score_gpt":0.2895780272639692,"score_spread":0.2530144887782249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172536852","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.79656196,0.000831742,0.19778545,0.00021226055,0.00012908308,0.000081902755,0.00048227116,0.001164432,0.0027509006],"genre_scores_gemma":[0.97835195,0.00023959392,0.02038198,0.000055327346,0.00006741982,0.000026917558,0.00022230168,0.00005366066,0.0006007024],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997204,0.000042935102,0.000018306593,0.00006369194,0.00013030146,0.000024296074],"domain_scores_gemma":[0.99888736,0.0006161591,0.00019578125,0.00007385716,0.00016405644,0.00006279741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004055674,0.0003902631,0.0004174558,0.0011205267,0.00015833926,0.0004267441,0.00035480162,0.0005381869,0.0007742189],"category_scores_gemma":[0.0019384901,0.00011331679,0.00017584482,0.0007192365,0.00019444904,0.00041174213,0.00019693794,0.0003654325,0.00024156584],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026887709,0.00044396342,0.04672914,0.00029008265,0.00017250214,0.00088144257,0.00032430943,0.031128421,0.6074477,0.0010097936,0.0016511247,0.30723274],"study_design_scores_gemma":[0.00006413554,0.0015546592,0.119360715,0.000043353168,0.00019003455,0.0029104322,0.00017757431,0.66393113,0.20693731,0.001753087,0.0029986894,0.00007889972],"about_ca_topic_score_codex":0.0004473969,"about_ca_topic_score_gemma":0.00047342022,"teacher_disagreement_score":0.0011205267,"about_ca_system_score_codex":0.00016576433,"about_ca_system_score_gemma":0.00013057666,"threshold_uncertainty_score":0.0025900006},"labels":[],"label_agreement":null},{"id":"W1725695101","doi":"10.1007/978-3-319-22174-8_11","title":"Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Key (lock); Differential (mechanical device); Arithmetic; Slide attack; State (computer science); Enumeration; Collision attack; Computer security; Algorithm; Theoretical computer science; Differential cryptanalysis; Cryptography; Mathematics; Discrete mathematics; Engineering; Cryptographic hash function","score_opus":0.06975665820757174,"score_gpt":0.30629984052344605,"score_spread":0.23654318231587432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1725695101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1851406,0.0013432471,0.65181386,0.0054011806,0.0006680953,0.00047279682,0.00078384887,0.0048399298,0.1495364],"genre_scores_gemma":[0.9132381,0.0003656486,0.05946453,0.00067141815,0.00018376973,0.00021326507,0.00042555644,0.00041218795,0.025025552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952318,0.0014478802,0.00018198878,0.00044853406,0.0016747097,0.0010150095],"domain_scores_gemma":[0.99595803,0.0014576613,0.00018715697,0.001957914,0.00030397615,0.00013534914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245987,0.0009721205,0.001435917,0.000913875,0.0018892041,0.0029582812,0.0016879241,0.0021644249,0.012398245],"category_scores_gemma":[0.0059586535,0.0006504572,0.0012450633,0.0008669003,0.0028134997,0.00610734,0.0062225275,0.0040952414,0.0047276737],"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.0017452542,0.00021348386,0.0006363584,0.00024888554,0.00012128278,0.00023127819,0.0005190342,0.02426988,0.012399085,0.84426665,0.019104512,0.09624431],"study_design_scores_gemma":[0.00021152114,0.00021387044,0.00038300158,0.00007199252,0.00007861568,0.000348949,0.000117283904,0.13628462,0.020137997,0.8241998,0.017875992,0.00007626229],"about_ca_topic_score_codex":0.000631976,"about_ca_topic_score_gemma":0.0008757672,"teacher_disagreement_score":0.012398245,"about_ca_system_score_codex":0.0016753154,"about_ca_system_score_gemma":0.001751887,"threshold_uncertainty_score":0.04147625},"labels":[],"label_agreement":null},{"id":"W1726364168","doi":"10.1007/10721959_29","title":"Support Ordered Resolution","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 New Brunswick","funders":"","keywords":"Resolution (logic); Invertible matrix; Literal (mathematical logic); Factoring; Binary tree; Mathematics; Tree (set theory); Sequence (biology); Computer science; Combinatorics; Algorithm; Pure mathematics; Chemistry","score_opus":0.021146876982650165,"score_gpt":0.24258026550139716,"score_spread":0.221433388518747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1726364168","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.013132232,0.0014630893,0.70955324,0.0016589055,0.0011753142,0.00026019974,0.00404355,0.046568707,0.22214489],"genre_scores_gemma":[0.28432631,0.0018722997,0.44102043,0.0019148099,0.0011073075,0.0004382513,0.015116015,0.0125401355,0.24166457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981139,0.00030109883,0.00018824788,0.00040961584,0.0006915805,0.00029561797],"domain_scores_gemma":[0.9968437,0.00082236377,0.000114364775,0.0014188379,0.00061801577,0.00018274879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016978354,0.0012966199,0.0010079666,0.0015085945,0.0013548422,0.004950745,0.0030278263,0.0013621249,0.081802465],"category_scores_gemma":[0.006830677,0.0010236957,0.0011416336,0.0017162724,0.0009195874,0.011124116,0.0056444076,0.0028592218,0.03697229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035473285,0.0002481077,0.0008420587,0.00052564294,0.000058735688,0.00029644722,0.0006482998,0.0016437555,0.009274199,0.57457554,0.11576071,0.29577178],"study_design_scores_gemma":[0.00011863518,0.00005358497,0.00022873397,0.00013817062,0.00008060782,0.0004321682,0.0002229743,0.015011084,0.020341447,0.5480049,0.41531026,0.000057516027],"about_ca_topic_score_codex":0.0008336576,"about_ca_topic_score_gemma":0.0015249453,"teacher_disagreement_score":0.081802465,"about_ca_system_score_codex":0.00072415674,"about_ca_system_score_gemma":0.0009393723,"threshold_uncertainty_score":0.2736565},"labels":[],"label_agreement":null},{"id":"W1726430263","doi":"10.1007/978-3-540-89020-1_16","title":"Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; SIMD; Parallel computing; Code generation; Code (set theory); Programming language; Graph; Verifiable secret sharing; Theoretical computer science; Operating system","score_opus":0.02444258836568365,"score_gpt":0.22855661860308363,"score_spread":0.2041140302374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1726430263","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.023823205,0.00018556857,0.95096785,0.00030302352,0.000121006546,0.00020305098,0.0003539256,0.01622252,0.007819882],"genre_scores_gemma":[0.49350622,0.00032272382,0.49071273,0.00036671758,0.000090702946,0.00035316937,0.0014527052,0.0038258412,0.00936908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998711,0.0002882508,0.000056951405,0.0002264378,0.0005674764,0.00015002409],"domain_scores_gemma":[0.9972262,0.0013152058,0.00017625879,0.0009252297,0.00031832352,0.000038750684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065988186,0.00092654326,0.00039501238,0.0009800821,0.00060424936,0.00082065945,0.0013062397,0.0009058491,0.0074753608],"category_scores_gemma":[0.0031596199,0.0005631485,0.00090742344,0.0006677811,0.0014911175,0.0014180277,0.00151216,0.0016637563,0.001689256],"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.00086836325,0.00030187654,0.0011797014,0.0005151333,0.000085463435,0.0008048617,0.00038924188,0.11589831,0.10316297,0.18144761,0.020803802,0.5745427],"study_design_scores_gemma":[0.00014260135,0.00017439104,0.00047809703,0.00007757294,0.00005738967,0.00032237096,0.000053273936,0.57936627,0.22793822,0.17001936,0.021315103,0.00005545819],"about_ca_topic_score_codex":0.002363161,"about_ca_topic_score_gemma":0.0028443078,"teacher_disagreement_score":0.0074753608,"about_ca_system_score_codex":0.0008713291,"about_ca_system_score_gemma":0.001234043,"threshold_uncertainty_score":0.025007546},"labels":[],"label_agreement":null},{"id":"W1727134659","doi":"10.1007/978-3-642-28499-1_6","title":"Basis Function Discovery Using Spectral Clustering and Bisimulation Metrics","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Receptor Mechanisms and Signaling","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":"McGill University","funders":"","keywords":"Computer science; Cluster analysis; Bisimulation; Adjacency list; Basis (linear algebra); Metric (unit); Spectral clustering; Theoretical computer science; Function (biology); State (computer science); Algorithm; Artificial intelligence; Data mining; Mathematics","score_opus":0.020651039434988232,"score_gpt":0.24438730358824695,"score_spread":0.22373626415325873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727134659","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.016824804,0.00065428315,0.9796729,0.00023220951,0.000045413257,0.00008306115,0.00023091453,0.0008404182,0.0014159834],"genre_scores_gemma":[0.24652484,0.00086401124,0.745475,0.00019021504,0.00014741874,0.00043233988,0.0025207896,0.0006540953,0.00319126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973043,0.0010872033,0.0001656288,0.00040831443,0.00087082863,0.00016365731],"domain_scores_gemma":[0.9905404,0.0062248735,0.0003913635,0.001006554,0.0015467003,0.00029009054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004152924,0.0018731963,0.002997867,0.0063963677,0.0014879445,0.0028466538,0.0035033654,0.0023656387,0.0031049498],"category_scores_gemma":[0.018107658,0.00095847435,0.002879198,0.0046313424,0.0013044315,0.003521509,0.00320644,0.0025856318,0.001644967],"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.00040935384,0.00041333062,0.0033939914,0.0005594857,0.00040897302,0.00015109421,0.0002655396,0.3510305,0.00490913,0.13713148,0.01288446,0.48844266],"study_design_scores_gemma":[0.000015114513,0.000033916578,0.00017381796,0.000018574721,0.000023956898,0.000029771736,0.000027678789,0.94491047,0.00069410657,0.05325072,0.0008082192,0.000013618761],"about_ca_topic_score_codex":0.0034673756,"about_ca_topic_score_gemma":0.0029690883,"teacher_disagreement_score":0.0063963677,"about_ca_system_score_codex":0.0015922126,"about_ca_system_score_gemma":0.0019798733,"threshold_uncertainty_score":0.021963},"labels":[],"label_agreement":null},{"id":"W1727672886","doi":"10.1007/3-540-44842-x_5","title":"Assessment of Different Link Functions for Modeling Binary Data to Derive Sound Inferences and Predictions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wildlife Ecology and Conservation","field":"Environmental Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Logit; Probit; Computer science; Inference; Link (geometry); Econometrics; Data mining; Statistics; Artificial intelligence; Machine learning; Mathematics","score_opus":0.04920385194856427,"score_gpt":0.2803530767516729,"score_spread":0.23114922480310865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727672886","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.09972936,0.001011368,0.89375204,0.0009139938,0.00008963502,0.0002263776,0.0006832799,0.0012583366,0.0023357396],"genre_scores_gemma":[0.4472449,0.0008878656,0.5470945,0.00024159458,0.00011320016,0.00063313264,0.0017149234,0.0006369605,0.0014329596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98715186,0.00981818,0.0006075384,0.0007569567,0.0013385502,0.00032693386],"domain_scores_gemma":[0.6123851,0.37100545,0.0023306317,0.007631895,0.0055488497,0.0010980086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.061692838,0.0019450948,0.0012283208,0.006169462,0.0010764899,0.0035431345,0.0040223924,0.004092067,0.0024099445],"category_scores_gemma":[0.18256311,0.00085070834,0.002054507,0.0034790423,0.0015066034,0.00667504,0.0025966454,0.0031075664,0.00054747093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020427927,0.00072933384,0.024928533,0.0006512267,0.0009581784,0.00025869164,0.00057749357,0.653455,0.0019744744,0.04938578,0.0038489772,0.26118955],"study_design_scores_gemma":[0.000069385795,0.000120049466,0.0015904197,0.00007931811,0.00021015073,0.00006602937,0.0000817064,0.96782124,0.0011356742,0.028397428,0.00039216684,0.000036386413],"about_ca_topic_score_codex":0.003726117,"about_ca_topic_score_gemma":0.0029385777,"teacher_disagreement_score":0.061692838,"about_ca_system_score_codex":0.0015691568,"about_ca_system_score_gemma":0.00156537,"threshold_uncertainty_score":0.32626677},"labels":[],"label_agreement":null},{"id":"W1727854234","doi":"10.1007/978-3-540-73214-3_15","title":"Visualization of Uncertainty and Reasoning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Visualization; Data visualization; Process (computing); Data science; Visual reasoning; Cognition; Analytic reasoning; Information visualization; Visual analytics; Uncertainty analysis; Artificial intelligence; Reasoning system; Psychology; Simulation; Programming language","score_opus":0.025701768726409516,"score_gpt":0.30809851065156424,"score_spread":0.28239674192515474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727854234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008630912,0.005338898,0.9455395,0.0024164992,0.0002257949,0.000049822,0.0014395613,0.00378006,0.03257896],"genre_scores_gemma":[0.37563425,0.0079991445,0.5908748,0.00039671003,0.000304842,0.00017035042,0.0030663402,0.0013347778,0.020218762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924576,0.00024496758,0.00004102413,0.0001273027,0.00029608022,0.000044915047],"domain_scores_gemma":[0.99761224,0.0015794107,0.000121148616,0.0003022859,0.0002866151,0.00009830038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012879813,0.0011959627,0.000881578,0.0021074454,0.0006630443,0.006005107,0.0010842201,0.0011133814,0.019282676],"category_scores_gemma":[0.0066806953,0.00075692206,0.0009628632,0.0020301435,0.0012654406,0.004967397,0.0023841485,0.0022256412,0.0019595472],"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.00023150227,0.000041684303,0.00091344415,0.0006472618,0.00010395719,0.00023964429,0.0011641644,0.055694874,0.006377978,0.6443509,0.032421988,0.2578126],"study_design_scores_gemma":[0.000018147508,0.000015911384,0.00045484223,0.00017069715,0.000033197517,0.00016176655,0.0002188641,0.18503249,0.0041593276,0.7641174,0.045584016,0.00003332268],"about_ca_topic_score_codex":0.002308657,"about_ca_topic_score_gemma":0.0020546652,"teacher_disagreement_score":0.019282676,"about_ca_system_score_codex":0.00093912485,"about_ca_system_score_gemma":0.0009893011,"threshold_uncertainty_score":0.06450695},"labels":[],"label_agreement":null},{"id":"W1728992199","doi":"10.1007/978-3-642-33999-8_25","title":"Towards Advanced Goal Model Analysis with jUCMNav","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; Carleton University; JDA Software (Canada); University of Ottawa","funders":"","keywords":"Computer science; Context (archaeology); Software engineering; Domain (mathematical analysis); Domain-specific language; Modeling language; Management science; Risk analysis (engineering); Systems engineering; Programming language; Software","score_opus":0.027633703668716224,"score_gpt":0.27648945374898376,"score_spread":0.24885575008026753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1728992199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013703487,0.00009186681,0.9916476,0.00015823042,0.000040591774,0.000063811116,0.000204899,0.0038114537,0.0026111086],"genre_scores_gemma":[0.035382137,0.00022987921,0.95942324,0.0001541487,0.000026988317,0.00014479301,0.0010708487,0.0010144699,0.0025534316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697435,0.0008505634,0.00020463273,0.00043093995,0.0013252314,0.0002142041],"domain_scores_gemma":[0.99727196,0.0013041424,0.00015110328,0.0007258486,0.00047178887,0.00007522405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003491596,0.0013275519,0.0011932544,0.001997473,0.00084223296,0.004447155,0.0026646547,0.0010527746,0.0087964665],"category_scores_gemma":[0.010956745,0.001299693,0.003237817,0.0016875315,0.0012428204,0.0053643696,0.0053509376,0.00474588,0.0043881885],"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.00020740366,0.00022825676,0.0015326226,0.00075451314,0.00022775319,0.00025784274,0.00062006875,0.09598884,0.0049673743,0.41713145,0.023873663,0.45421028],"study_design_scores_gemma":[0.000036066154,0.00003981931,0.00017366289,0.00021744058,0.00007849136,0.00012041937,0.00017809325,0.5511215,0.0052247266,0.3981381,0.044637866,0.00003386186],"about_ca_topic_score_codex":0.0043632896,"about_ca_topic_score_gemma":0.008426458,"teacher_disagreement_score":0.0087964665,"about_ca_system_score_codex":0.0010376984,"about_ca_system_score_gemma":0.0026536314,"threshold_uncertainty_score":0.029427052},"labels":[],"label_agreement":null},{"id":"W1730392495","doi":"10.1007/978-3-540-73554-0_4","title":"Organic User Interfaces (Oui!): Designing Computers in Any Way Shape or Form","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Computer science; Human–computer interaction","score_opus":0.028404705670311173,"score_gpt":0.27374876857699304,"score_spread":0.24534406290668187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1730392495","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.006936322,0.017341144,0.52980447,0.0012612046,0.0027937188,0.00017031655,0.00066716666,0.006968021,0.43405765],"genre_scores_gemma":[0.06285552,0.02311283,0.19855045,0.0009159548,0.0008652483,0.00046828348,0.0015079912,0.0034278687,0.7082959],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997688,0.000027708293,0.000010300413,0.000035523368,0.00013149495,0.000026253858],"domain_scores_gemma":[0.9998419,0.00008242817,0.000008868313,0.000029071867,0.000025872396,0.000011836483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002562631,0.0012707913,0.00046660073,0.0007071131,0.00050705235,0.0025212227,0.00091303943,0.0010702815,0.053029533],"category_scores_gemma":[0.00076564495,0.0006335552,0.00067142374,0.0014276413,0.0008625778,0.0036543715,0.0015069031,0.0012119354,0.017237414],"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.00003802157,0.000050452174,0.00014443498,0.0012798903,0.000020388314,0.00010487705,0.00097733,0.00072203315,0.013394228,0.12403094,0.13069788,0.7285395],"study_design_scores_gemma":[0.000010206143,0.00006087347,0.0003055892,0.00020296188,0.000017525625,0.0004160121,0.00014666359,0.0022379325,0.0058017005,0.030108448,0.9606719,0.000020200669],"about_ca_topic_score_codex":0.00038115217,"about_ca_topic_score_gemma":0.0007741654,"teacher_disagreement_score":0.053029533,"about_ca_system_score_codex":0.00021376034,"about_ca_system_score_gemma":0.00027853376,"threshold_uncertainty_score":0.17740148},"labels":[],"label_agreement":null},{"id":"W1730856983","doi":"10.1007/978-3-642-15696-0_66","title":"Discovering Motion Patterns for Human Action Recognition","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Discriminative model; Histogram; Artificial intelligence; Representation (politics); Histogram of oriented gradients; Coherence (philosophical gambling strategy); Action recognition; Point (geometry); Optical flow; Motion (physics); Pattern recognition (psychology); Benchmark (surveying); Computer vision; Point of interest; Detector; Image (mathematics); Mathematics; Class (philosophy)","score_opus":0.046332975570037384,"score_gpt":0.284468027909171,"score_spread":0.2381350523391336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1730856983","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.03877715,0.002842616,0.94406897,0.00031584234,0.00015011146,0.0001591404,0.0029560449,0.0057840906,0.004946041],"genre_scores_gemma":[0.2586126,0.0033273287,0.7130612,0.00018041709,0.00014330952,0.00026587464,0.008352205,0.000500632,0.015556495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978334,0.000019598667,0.0000146023485,0.000104157385,0.0000483446,0.000029904097],"domain_scores_gemma":[0.9998196,0.00006185439,0.000020105188,0.000047225596,0.000038190225,0.00001310425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022226416,0.0010301159,0.0009443257,0.0012986208,0.00030915285,0.00066760357,0.0011080871,0.0007683105,0.007766347],"category_scores_gemma":[0.00075863174,0.00047888941,0.00090541417,0.0017838861,0.00035571115,0.0009633968,0.00061818527,0.0007275934,0.0036803912],"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.000081721984,0.00006262472,0.0011991516,0.0001245824,0.00004095445,0.00006340778,0.000033840643,0.009700895,0.026358938,0.0018824623,0.0063593513,0.95409214],"study_design_scores_gemma":[0.00003151614,0.00022643068,0.008706899,0.00009986336,0.00009095803,0.0006107035,0.00021904803,0.89271605,0.04319079,0.03591295,0.018151302,0.000043582742],"about_ca_topic_score_codex":0.0056851334,"about_ca_topic_score_gemma":0.0074563934,"teacher_disagreement_score":0.007766347,"about_ca_system_score_codex":0.00039469823,"about_ca_system_score_gemma":0.000432079,"threshold_uncertainty_score":0.025981009},"labels":[],"label_agreement":null},{"id":"W1731525029","doi":"10.1007/978-3-540-73451-2_10","title":"MIRAI: Multi-hierarchical, FS-Tree Based Music Information Retrieval System","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Computer science; Search engine indexing; Music information retrieval; Polyphony; Piano; Musical; Speech recognition; Tree (set theory); Artificial intelligence; Information retrieval; Tree structure; Musical instrument; Data structure","score_opus":0.03233101813665539,"score_gpt":0.25336884191441933,"score_spread":0.22103782377776393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1731525029","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.04884086,0.0038771052,0.81461966,0.00050629454,0.0003376929,0.0006258148,0.007794897,0.11054742,0.012850222],"genre_scores_gemma":[0.11328632,0.0006638717,0.8564868,0.00047085297,0.00018694476,0.00036043001,0.01194567,0.00060076214,0.015998414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948066,0.00006344233,0.00004609659,0.00010309733,0.00025479143,0.00005196226],"domain_scores_gemma":[0.9995117,0.00011090712,0.00005131104,0.000082377606,0.0001934987,0.000050104067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006567233,0.0005999917,0.0014141195,0.0025769079,0.0007955726,0.0008886652,0.0016751424,0.00086467044,0.0070482036],"category_scores_gemma":[0.0013289896,0.00034284426,0.00066812424,0.0021297592,0.00019763262,0.001843677,0.001001037,0.00072385726,0.0062764417],"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.0013691414,0.00035703657,0.0010993034,0.0004711825,0.00014827693,0.00026260855,0.00015933195,0.004501607,0.1275425,0.003366837,0.09010061,0.77062166],"study_design_scores_gemma":[0.0005624894,0.0013922451,0.0089758,0.00008509401,0.00048987934,0.0019098738,0.00025599453,0.698472,0.15472148,0.009864501,0.12292561,0.0003450435],"about_ca_topic_score_codex":0.004021061,"about_ca_topic_score_gemma":0.006359673,"teacher_disagreement_score":0.0070482036,"about_ca_system_score_codex":0.0004976296,"about_ca_system_score_gemma":0.00076546986,"threshold_uncertainty_score":0.023578525},"labels":[],"label_agreement":null},{"id":"W173210115","doi":"10.1007/978-3-642-38847-7_20","title":"Robust Hierarchical and Sparse Representation of Natural Sounds in High-Dimensional Space","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robustness (evolution); Artificial intelligence; Curse of dimensionality; Speech recognition; Pattern recognition (psychology); Sparse approximation; Feature vector; Neural coding; Noise (video); Signal processing; Digital signal processing","score_opus":0.022867881647469546,"score_gpt":0.2572222860201066,"score_spread":0.23435440437263705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173210115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008312136,0.00026514535,0.98995626,0.00006418018,0.00003432478,0.000015340278,0.00012252512,0.000295275,0.0009347944],"genre_scores_gemma":[0.21020333,0.0013165291,0.7794367,0.00016974461,0.00018701811,0.00012891192,0.0012975188,0.0001910156,0.0070692506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997476,0.000041313193,0.000012009463,0.00005108528,0.00011240997,0.00003561861],"domain_scores_gemma":[0.99958223,0.00017191037,0.00004218409,0.00008434537,0.00009333466,0.000026081549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003100868,0.00067898206,0.0005978611,0.00074959575,0.00022409714,0.00067517074,0.00076698273,0.0007000897,0.0024632013],"category_scores_gemma":[0.0013833059,0.00032316588,0.0007386302,0.0010759605,0.0005514081,0.0011536442,0.0012004834,0.0009975429,0.0009894633],"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.00032686917,0.00015363914,0.00047853155,0.00037853196,0.00009337571,0.00017827518,0.00017471235,0.19411339,0.18862036,0.030162685,0.006683774,0.5786358],"study_design_scores_gemma":[0.000019485806,0.00009383026,0.001044528,0.000020199306,0.000027730961,0.00021116823,0.0000437073,0.9617667,0.016078658,0.01778214,0.0028826715,0.000029103734],"about_ca_topic_score_codex":0.0016252456,"about_ca_topic_score_gemma":0.0029376165,"teacher_disagreement_score":0.0024632013,"about_ca_system_score_codex":0.00023550064,"about_ca_system_score_gemma":0.0005302595,"threshold_uncertainty_score":0.008240223},"labels":[],"label_agreement":null},{"id":"W173210980","doi":"10.1007/978-3-642-10631-6_96","title":"Step-Assembly with a Constant Number of Tile Types","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Tile; Monotone polygon; Constant (computer programming); Computer science; Bin; Extension (predicate logic); Class (philosophy); Tree (set theory); Scaling; Node (physics); Algorithm; Mathematics; Geometry; Combinatorics; Artificial intelligence; Physics","score_opus":0.010199613632745692,"score_gpt":0.24444731609198195,"score_spread":0.23424770245923626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173210980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05602927,0.00028999586,0.90902007,0.000090242334,0.00024653136,0.0001994953,0.0003944989,0.0038921034,0.029837769],"genre_scores_gemma":[0.25431946,0.00047749872,0.6638268,0.00013606752,0.00006622042,0.0007352119,0.0012627274,0.0011953161,0.077980705],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992907,0.000082159895,0.00005835395,0.00017474602,0.0002740385,0.00012005812],"domain_scores_gemma":[0.9987728,0.0003073483,0.000074486685,0.00058287376,0.00017261441,0.00008977649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041060188,0.0008591679,0.00076619565,0.00075604004,0.0007643135,0.0011177075,0.0017456639,0.00064862915,0.01147495],"category_scores_gemma":[0.0015066285,0.00084621087,0.0009692518,0.000842143,0.0007098909,0.0017063502,0.002431696,0.0011547123,0.0069835456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009783373,0.00031148043,0.001470562,0.0009077677,0.00012031108,0.0005594478,0.00044469806,0.027230697,0.4589332,0.21067336,0.013531587,0.28483853],"study_design_scores_gemma":[0.00021822457,0.0005347313,0.001388967,0.00012341488,0.00014565699,0.0011367657,0.00017447612,0.14795303,0.59084135,0.1585857,0.09875658,0.00014113024],"about_ca_topic_score_codex":0.0002688986,"about_ca_topic_score_gemma":0.0005817408,"teacher_disagreement_score":0.01147495,"about_ca_system_score_codex":0.00035181438,"about_ca_system_score_gemma":0.00036213253,"threshold_uncertainty_score":0.038387477},"labels":[],"label_agreement":null},{"id":"W1732358269","doi":"10.1007/978-3-540-74970-7_48","title":"On Universal Restart Strategies for Backtracking Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Constraint learning; Testbed; Look-ahead; Beam stack search; Focus (optics); Robustness (evolution); Satisfiability; Mathematical optimization; Constraint satisfaction problem; Search algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Beam search; Incremental heuristic search; Local consistency","score_opus":0.03735381381327279,"score_gpt":0.28734800913557956,"score_spread":0.24999419532230677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732358269","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.014208733,0.0020669377,0.95792145,0.0003217525,0.00015128595,0.00016396299,0.00019627882,0.0020858056,0.0228838],"genre_scores_gemma":[0.39317203,0.00210178,0.57532483,0.0005899288,0.00020046698,0.0006457449,0.0008563289,0.0024051876,0.024703672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974661,0.00080058066,0.00020148154,0.00039820612,0.0006798997,0.00045379196],"domain_scores_gemma":[0.9944617,0.0035708176,0.0001947009,0.0011963239,0.00044634176,0.00013011305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027611954,0.0017964373,0.0023502088,0.0020743436,0.0015465106,0.0029913296,0.0046624863,0.0020286457,0.011765723],"category_scores_gemma":[0.012224722,0.0010476969,0.001697669,0.0033860996,0.0025424783,0.00586043,0.004795422,0.003037513,0.0021709516],"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.0006443256,0.00018819075,0.0006036266,0.00056980044,0.00013273099,0.00018191987,0.0006938899,0.13927394,0.004399198,0.4681666,0.015183665,0.3699622],"study_design_scores_gemma":[0.00008807928,0.00009050806,0.000247379,0.00016870427,0.00011250019,0.00011292585,0.000119482946,0.5140291,0.0028718247,0.47427747,0.007833874,0.00004814674],"about_ca_topic_score_codex":0.0049143145,"about_ca_topic_score_gemma":0.0062359497,"teacher_disagreement_score":0.011765723,"about_ca_system_score_codex":0.0018978267,"about_ca_system_score_gemma":0.0014742932,"threshold_uncertainty_score":0.039360225},"labels":[],"label_agreement":null},{"id":"W1732813225","doi":"10.1007/978-3-642-33481-8_12","title":"Improved Exponentiation and Key Agreement in the Infrastructure of a Real Quadratic Field","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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 Calgary","funders":"","keywords":"Exponentiation; Computer science; Key (lock); Binary number; Quadratic equation; Protocol (science); Field (mathematics); Diffie–Hellman key exchange; Modular exponentiation; Public-key cryptography; Theoretical computer science; Algorithm; Arithmetic; Computer security; Encryption; Mathematics; Key exchange","score_opus":0.00867932684524461,"score_gpt":0.22247808840594696,"score_spread":0.21379876156070235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732813225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08780101,0.0032651077,0.8353409,0.0027729275,0.00094579585,0.0002823583,0.00040534078,0.0015977522,0.06758887],"genre_scores_gemma":[0.8340362,0.001921684,0.1358432,0.0002728283,0.0005834419,0.0001905971,0.00037862707,0.00034622985,0.026427295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662954,0.0009754285,0.00026908016,0.0005320542,0.00088779867,0.0007060535],"domain_scores_gemma":[0.9947864,0.0019159011,0.00028777652,0.002399221,0.00041259645,0.00019813102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032765702,0.0011374549,0.0012933261,0.0010306205,0.0013901482,0.003912134,0.002440657,0.0014465565,0.008350814],"category_scores_gemma":[0.008365804,0.00080101506,0.0011222808,0.0018130852,0.002981051,0.014023769,0.0065568993,0.00515122,0.0025236532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004653422,0.000085020256,0.00027610606,0.00020879775,0.000031038537,0.00021214064,0.0003601589,0.01963779,0.0041221054,0.92818576,0.0044804746,0.04193533],"study_design_scores_gemma":[0.00009711132,0.00013006684,0.00016840764,0.000059670256,0.000041423846,0.00023828937,0.000100679295,0.06969313,0.0052582514,0.91146785,0.012689825,0.000055293483],"about_ca_topic_score_codex":0.0004371156,"about_ca_topic_score_gemma":0.00042437477,"teacher_disagreement_score":0.008350814,"about_ca_system_score_codex":0.0019322683,"about_ca_system_score_gemma":0.0019139543,"threshold_uncertainty_score":0.02793628},"labels":[],"label_agreement":null},{"id":"W1733448862","doi":"10.1007/978-3-319-08311-7_8","title":"Parallelism in Ada: Status and Prospects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Compiler; Programming language; Parallelism (grammar); Notation; Parallel computing; Data parallelism; Task parallelism; Parallel programming model; Computation; Programming paradigm","score_opus":0.012497292552085653,"score_gpt":0.24030414496598188,"score_spread":0.22780685241389623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1733448862","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043905945,0.8861781,0.026575673,0.007982617,0.0032766296,0.000033798642,0.00013186267,0.00046769518,0.07096303],"genre_scores_gemma":[0.073637016,0.8177003,0.055079073,0.0023636639,0.0055571455,0.000110787805,0.00033893055,0.00028662328,0.044926334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995763,0.00008138478,0.000021422116,0.00007169323,0.00018674681,0.00006244965],"domain_scores_gemma":[0.9991301,0.00047697738,0.00003766599,0.000083187726,0.00018458732,0.0000874909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017300706,0.00065806555,0.0009189122,0.0009531294,0.00059416675,0.0029721188,0.0012322336,0.0011211429,0.008698588],"category_scores_gemma":[0.0015677812,0.0005325804,0.00049208687,0.0025719858,0.0014759395,0.004271494,0.0012869831,0.001942487,0.003643388],"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.0002117223,0.00026984815,0.00038821812,0.0020325382,0.000032010805,0.00005799007,0.00015176013,0.003581717,0.0017112122,0.15625808,0.059709862,0.77559495],"study_design_scores_gemma":[0.00006863772,0.0001751342,0.00041891524,0.0006788809,0.000028988576,0.00026409948,0.00008030135,0.0062628193,0.0015631544,0.16508195,0.8253512,0.00002591503],"about_ca_topic_score_codex":0.00065089285,"about_ca_topic_score_gemma":0.00074929505,"teacher_disagreement_score":0.008698588,"about_ca_system_score_codex":0.00089154835,"about_ca_system_score_gemma":0.0014926234,"threshold_uncertainty_score":0.029099643},"labels":[],"label_agreement":null},{"id":"W1734133568","doi":"10.1007/978-3-642-33718-5_56","title":"A Particle Filter Framework for Contour Detection","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Particle filter; Artificial intelligence; Computer science; Computer vision; Pattern recognition (psychology); Tracking (education); Segmentation; Detector; Bayesian probability; Active contour model; Filter (signal processing); Task (project management); Image segmentation; Engineering","score_opus":0.028614511097925316,"score_gpt":0.29546667637633833,"score_spread":0.26685216527841304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734133568","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.000185241,0.00015713615,0.9989889,0.00002084504,0.000031944797,0.000008463624,0.000016109536,0.0002955049,0.0002958142],"genre_scores_gemma":[0.01596904,0.0008853031,0.97669685,0.000060009545,0.000094043615,0.00007093845,0.00021152209,0.00025991275,0.005752358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966884,0.000051754316,0.000018780065,0.00007930384,0.0001516629,0.0000296023],"domain_scores_gemma":[0.99962413,0.00014643704,0.000020291052,0.00005973201,0.00012920744,0.00002021179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066024414,0.0012294416,0.0014932376,0.0011237694,0.0006009366,0.0016082381,0.0018765276,0.002295612,0.005516013],"category_scores_gemma":[0.0013020328,0.001201727,0.0014350647,0.0018570193,0.0005757245,0.0014224768,0.0010837653,0.0019166504,0.0040124953],"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.000109550485,0.000104354316,0.00025621874,0.00027629462,0.00015475755,0.00019234173,0.00008871491,0.25877184,0.02631108,0.050016608,0.014262816,0.64945537],"study_design_scores_gemma":[0.0000101148735,0.000020688232,0.000120634104,0.000013149989,0.000022404134,0.00008379965,0.0000055998316,0.9787723,0.0038825246,0.009830406,0.007218266,0.000020233849],"about_ca_topic_score_codex":0.008985964,"about_ca_topic_score_gemma":0.006705375,"teacher_disagreement_score":0.008985964,"about_ca_system_score_codex":0.00057377026,"about_ca_system_score_gemma":0.0009301942,"threshold_uncertainty_score":0.018452942},"labels":[],"label_agreement":null},{"id":"W1734881440","doi":"10.1007/3-540-44886-1_54","title":"Probabilistic Reasoning in Bayesian Networks: A Relational Database Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Probabilistic logic; Bayesian network; Computer science; Probabilistic database; Artificial intelligence; Relational database; Reasoning system; Bayesian probability; Tree (set theory); Database theory; Database; Mathematics","score_opus":0.027687836530164805,"score_gpt":0.243006900607005,"score_spread":0.2153190640768402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734881440","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.001447417,0.0027675012,0.98926735,0.00073520263,0.000089749505,0.00003864443,0.0002101449,0.0002570931,0.005186915],"genre_scores_gemma":[0.09324996,0.007917936,0.8910335,0.00046144603,0.0005269849,0.00023693728,0.0009822102,0.0002101239,0.005380885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99413484,0.0025712063,0.0006211026,0.00079732435,0.0016891096,0.00018647243],"domain_scores_gemma":[0.9916741,0.0060153343,0.00035532043,0.0010822244,0.0006778981,0.0001951345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006540991,0.0011700852,0.0022467,0.002839272,0.0012102615,0.010920777,0.005299157,0.0022672617,0.0074699814],"category_scores_gemma":[0.020282496,0.0018128107,0.002545707,0.006224689,0.0026525587,0.017327825,0.0031060276,0.0037388024,0.0018153744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004642182,0.000057570156,0.0003661838,0.0003338176,0.00012640354,0.00020152397,0.00044872795,0.034060974,0.00048017586,0.8815787,0.0059399335,0.0763596],"study_design_scores_gemma":[0.000014645736,0.000008031158,0.00009249949,0.00006518208,0.00009170257,0.00012759671,0.000095822514,0.13064215,0.000513464,0.8528397,0.015484156,0.000025135156],"about_ca_topic_score_codex":0.0058256793,"about_ca_topic_score_gemma":0.004113721,"teacher_disagreement_score":0.010920777,"about_ca_system_score_codex":0.0019086673,"about_ca_system_score_gemma":0.0013162368,"threshold_uncertainty_score":0.03459245},"labels":[],"label_agreement":null},{"id":"W1735022296","doi":"10.1007/978-3-540-45187-7_18","title":"Multi-valued Model Checking via Classical Model Checking","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":67,"is_retracted":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":"Model checking; Abstraction model checking; Computer science; Symbolic trajectory evaluation; Reuse; Extension (predicate logic); Theoretical computer science; Context (archaeology); Algorithm; Programming language","score_opus":0.0640061665801301,"score_gpt":0.3078150874879148,"score_spread":0.24380892090778472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1735022296","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.005724904,0.0002445845,0.98864436,0.00012308311,0.00006330545,0.000046637222,0.00006445402,0.0012696022,0.0038190056],"genre_scores_gemma":[0.4141171,0.00046699843,0.57836473,0.0002554506,0.000078269,0.0002303859,0.00026237004,0.0004914454,0.0057333205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946695,0.0014867805,0.0003081796,0.00082856906,0.0023318902,0.0003750878],"domain_scores_gemma":[0.99497664,0.0026864915,0.00023122512,0.001573714,0.00046307937,0.000069014575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002977377,0.0012114593,0.0015200683,0.0015859228,0.0007949512,0.0030390238,0.0035601738,0.0011637267,0.0046442635],"category_scores_gemma":[0.00803413,0.0013042713,0.002844665,0.0015759674,0.0033105735,0.0071202484,0.0036927282,0.0039614383,0.00097473915],"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.00025644575,0.0001390385,0.00038557878,0.00051090925,0.00020745778,0.00022070417,0.0002306576,0.10747322,0.011604396,0.74606293,0.0025832145,0.13032536],"study_design_scores_gemma":[0.000057837042,0.000038357153,0.00009606217,0.00006889226,0.000072923875,0.00010697394,0.000019254381,0.42364377,0.017296856,0.55556566,0.00300023,0.000033176297],"about_ca_topic_score_codex":0.001112663,"about_ca_topic_score_gemma":0.0017844212,"teacher_disagreement_score":0.0046442635,"about_ca_system_score_codex":0.0017728473,"about_ca_system_score_gemma":0.0014173796,"threshold_uncertainty_score":0.015746057},"labels":[],"label_agreement":null},{"id":"W1735360785","doi":"10.1007/978-3-642-20633-7_34","title":"Citizen Science 2.0: Data Management Principles to Harness the Power of the Crowd","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":30,"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":"Citizen science; Computer science; Scope (computer science); Data science; Context (archaeology); Domain (mathematical analysis); Crowdsourcing; Quality (philosophy); Public domain; Data quality; World Wide Web; Engineering","score_opus":0.0558467105295346,"score_gpt":0.2578544215388791,"score_spread":0.2020077110093445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1735360785","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.0013355487,0.0007647234,0.95721626,0.010192842,0.0005213059,0.00028566376,0.00046457545,0.002403316,0.026815813],"genre_scores_gemma":[0.04743334,0.0022754609,0.9077919,0.0027887719,0.0009552546,0.0011972599,0.0012252379,0.0017915783,0.0345412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991795,0.0032722957,0.00069857185,0.0009457069,0.002779143,0.00050923164],"domain_scores_gemma":[0.9873827,0.0059465235,0.00047013452,0.0038784675,0.0016032923,0.00071888504],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.016301751,0.000809698,0.0010360038,0.0026262128,0.0025110096,0.01012554,0.0043733683,0.0041736793,0.010415413],"category_scores_gemma":[0.023942426,0.0016979673,0.0015069993,0.0043194043,0.0057009854,0.019669894,0.010055222,0.006631629,0.008005818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040667128,0.00004976116,0.00039969827,0.000208456,0.000034795423,0.000100698584,0.0014088901,0.0027003635,0.0009757124,0.86278087,0.050954286,0.08034573],"study_design_scores_gemma":[0.000018286619,0.000016409896,0.00013917679,0.00014043233,0.00001727468,0.00014790644,0.00023763487,0.012630885,0.0018724481,0.64262253,0.3421236,0.000033365337],"about_ca_topic_score_codex":0.001797219,"about_ca_topic_score_gemma":0.0019666557,"teacher_disagreement_score":0.9956266,"about_ca_system_score_codex":0.0013812201,"about_ca_system_score_gemma":0.0041457457,"threshold_uncertainty_score":0.08621293},"labels":[],"label_agreement":null},{"id":"W1737214438","doi":"10.1007/bfb0020880","title":"Proactive modelling and the development of coaching strategies in geometry","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Chaining; MODELLER; Animation; Coaching; Computer science; Analogy; Mathematical proof; Brainstorming; Congruence (geometry); Geometry; Engineering drawing; Mathematics education; Computer graphics (images); Engineering; Artificial intelligence; Mathematics; Psychology; Epistemology","score_opus":0.02439921314949906,"score_gpt":0.25353911865110895,"score_spread":0.2291399055016099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1737214438","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.2046875,0.0006270785,0.6090951,0.003638307,0.000098070115,0.00022117436,0.000059611208,0.0005449709,0.18102832],"genre_scores_gemma":[0.9249146,0.00020134285,0.0658238,0.00006216371,0.0000063680354,0.00009182524,0.000051566014,0.00006398171,0.008784433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979243,0.0013355599,0.00005336289,0.00025121422,0.00026429686,0.00017111108],"domain_scores_gemma":[0.99514896,0.0029698252,0.0003994045,0.000761279,0.00037474124,0.0003458063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019933963,0.0005710247,0.0002488443,0.00046921885,0.0011279393,0.0035529144,0.0017667623,0.0019188164,0.006805085],"category_scores_gemma":[0.013387955,0.00044422157,0.00040401652,0.0005578016,0.00315317,0.004090517,0.0027459266,0.001456563,0.0008063103],"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.00021121239,0.000294581,0.004994908,0.0002183349,0.00003461789,0.00018880524,0.01968794,0.07864001,0.0035274355,0.760467,0.0027324117,0.12900275],"study_design_scores_gemma":[0.000057250207,0.00035024094,0.004512856,0.00027474726,0.000049399187,0.00026241303,0.011868255,0.2240058,0.005130564,0.713799,0.03961945,0.00006999026],"about_ca_topic_score_codex":0.0037118841,"about_ca_topic_score_gemma":0.004311909,"teacher_disagreement_score":0.006805085,"about_ca_system_score_codex":0.0017586144,"about_ca_system_score_gemma":0.0021100524,"threshold_uncertainty_score":0.022765279},"labels":[],"label_agreement":null},{"id":"W1738403920","doi":"10.1007/978-3-540-70918-3_30","title":"An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Algorithm; Graph; Computer science; Mathematics; Discrete mathematics","score_opus":0.021008694542040462,"score_gpt":0.3043820339160814,"score_spread":0.2833733393740409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738403920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10738452,0.0005477435,0.84976876,0.0011292776,0.00026229338,0.00045532684,0.0014126793,0.007650591,0.03138877],"genre_scores_gemma":[0.18444441,0.00027307917,0.7963343,0.00033949036,0.00008686718,0.00033349887,0.002813583,0.0010412005,0.014333557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.00016933041,0.00008874153,0.0005198641,0.00034050658,0.00026729805],"domain_scores_gemma":[0.9982778,0.00058943644,0.00011136761,0.0005983434,0.00022063262,0.00020247833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833815,0.0015761595,0.0014874288,0.0013552965,0.0015749593,0.0024813924,0.0041135103,0.0017932439,0.01134997],"category_scores_gemma":[0.0027693256,0.00096141116,0.0010376825,0.0023295847,0.0011607795,0.0058343243,0.0039813546,0.0017836051,0.0030076914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016625862,0.0011647183,0.0014185276,0.0006643932,0.00013819063,0.0001842388,0.00041142234,0.08308613,0.02755332,0.0804502,0.042497125,0.7607691],"study_design_scores_gemma":[0.0009062305,0.00040380773,0.0014851029,0.0001150062,0.00020819748,0.0006572927,0.0004372455,0.7124179,0.023086531,0.23660606,0.023551416,0.0001252251],"about_ca_topic_score_codex":0.0034851595,"about_ca_topic_score_gemma":0.007395313,"teacher_disagreement_score":0.01134997,"about_ca_system_score_codex":0.0021276807,"about_ca_system_score_gemma":0.0036262188,"threshold_uncertainty_score":0.03796947},"labels":[],"label_agreement":null},{"id":"W1738437109","doi":"10.1007/3-540-36494-3_17","title":"Fast Algorithms for Extended Regular Expression Matching and Searching","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Regular expression; Complement (music); Intersection (aeronautics); Computer science; Expression (computer science); Algorithm; Matching (statistics); Extension (predicate logic); Pattern matching; Word (group theory); Upper and lower bounds; Mathematics; Artificial intelligence; Programming language","score_opus":0.01678256366001422,"score_gpt":0.2586254758790411,"score_spread":0.2418429122190269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738437109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01056493,0.00076481246,0.97124445,0.00028972363,0.00013618071,0.00019644237,0.00052752456,0.010573724,0.0057022176],"genre_scores_gemma":[0.0661118,0.0004323996,0.9198132,0.00015788223,0.00009219822,0.00041207418,0.002308698,0.0014568178,0.009215049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958333,0.0007553192,0.00038774952,0.0011561112,0.0013089629,0.0005586213],"domain_scores_gemma":[0.99335724,0.0032102722,0.00026019118,0.0022945034,0.0006984759,0.00017940687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00228982,0.0023034546,0.0033709798,0.0031903274,0.0017972216,0.004158927,0.0073135053,0.002504428,0.031147959],"category_scores_gemma":[0.009689318,0.0018305208,0.0028810166,0.0080029415,0.0018030008,0.0135831535,0.006177154,0.0031240403,0.009517418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010869618,0.00029853804,0.0006576471,0.0006760163,0.00013283423,0.00012500181,0.0003723929,0.027748378,0.0069116876,0.115910426,0.027113939,0.8189662],"study_design_scores_gemma":[0.0005298741,0.0001966746,0.0004779911,0.00010786782,0.00019356266,0.00043521688,0.00032343715,0.44362056,0.017743273,0.5085296,0.027728513,0.00011343371],"about_ca_topic_score_codex":0.004182665,"about_ca_topic_score_gemma":0.0064939247,"teacher_disagreement_score":0.031147959,"about_ca_system_score_codex":0.0027585956,"about_ca_system_score_gemma":0.0027243658,"threshold_uncertainty_score":0.1042003},"labels":[],"label_agreement":null},{"id":"W1739199097","doi":"10.1007/978-3-642-02611-9_79","title":"Region, Lesion and Border-Based Multiresolution Analysis of Mammogram Lesions","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Thresholding; Wavelet; Computer science; Wavelet transform; Computer vision; Contextual image classification; Entropy (arrow of time); Principal component analysis; Image texture; Co-occurrence matrix; Segmentation; Image segmentation; Image (mathematics); Physics","score_opus":0.02490377545372607,"score_gpt":0.27942231627082936,"score_spread":0.2545185408171033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1739199097","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.19134602,0.004062847,0.7961727,0.00012119567,0.000065477376,0.000064883185,0.0004281896,0.001298409,0.0064403196],"genre_scores_gemma":[0.6409486,0.0026762956,0.3482363,0.000042356387,0.00011592979,0.000030409547,0.00058491103,0.000395105,0.006970041],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998715,0.000016924367,0.0000068271606,0.00002575028,0.000059962676,0.000019020757],"domain_scores_gemma":[0.99977463,0.00006601277,0.00003654253,0.000040181065,0.000062668245,0.000019909936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026183485,0.00027984363,0.000298532,0.0012569041,0.00010619165,0.0006266885,0.0003468187,0.00032743538,0.0020428873],"category_scores_gemma":[0.00079814484,0.0002405119,0.00062753365,0.0006032116,0.00019267378,0.00045690368,0.00032003882,0.00029147786,0.00091869454],"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.00044827367,0.000042171356,0.001850993,0.00029140888,0.00007924349,0.00036065897,0.00014959129,0.021133924,0.646948,0.0051936326,0.0013069398,0.3221951],"study_design_scores_gemma":[0.000028105143,0.00031076407,0.05208883,0.0000727625,0.00031283216,0.0040720287,0.00017372463,0.6342333,0.28889415,0.006781629,0.012935833,0.0000960771],"about_ca_topic_score_codex":0.00048525343,"about_ca_topic_score_gemma":0.0006736154,"teacher_disagreement_score":0.0020428873,"about_ca_system_score_codex":0.00013101718,"about_ca_system_score_gemma":0.00011693652,"threshold_uncertainty_score":0.0068341494},"labels":[],"label_agreement":null},{"id":"W173970821","doi":"10.1007/978-3-319-05302-8_6","title":"Enforcing Information Flow by Combining Static and Dynamic Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Computer science; Information flow; Static analysis; Flow (mathematics); Programming language; Mathematics","score_opus":0.007448577174651696,"score_gpt":0.22870924163757742,"score_spread":0.22126066446292572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173970821","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.004602123,0.00013202951,0.9875823,0.00017043836,0.00006275455,0.0000741369,0.000052158786,0.0037358447,0.0035883011],"genre_scores_gemma":[0.2843974,0.00047664414,0.7052707,0.00035139316,0.00021291275,0.00022282399,0.00039992706,0.0024994453,0.0061687627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99055696,0.0018970468,0.0005884202,0.0012641576,0.004893577,0.00079975696],"domain_scores_gemma":[0.98479176,0.0068944436,0.00085069356,0.0056005693,0.001669838,0.00019267606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006087453,0.001768356,0.0017162494,0.0031617878,0.0013173467,0.0040693395,0.0035813642,0.0014951797,0.004139952],"category_scores_gemma":[0.014945443,0.0017249074,0.0025270912,0.0021077562,0.004285312,0.008099244,0.0054088417,0.004626801,0.0014571325],"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.0003402044,0.0003424596,0.0017863233,0.00050510216,0.00019806682,0.00026330134,0.00041125104,0.17386745,0.03240494,0.35517526,0.0075289253,0.42717677],"study_design_scores_gemma":[0.000042609317,0.0000663466,0.00021891676,0.000091751135,0.000118172444,0.000110673944,0.000039229442,0.6894721,0.03124793,0.26941943,0.009112135,0.000060770875],"about_ca_topic_score_codex":0.002608457,"about_ca_topic_score_gemma":0.0032482322,"teacher_disagreement_score":0.006087453,"about_ca_system_score_codex":0.0016903712,"about_ca_system_score_gemma":0.0043128426,"threshold_uncertainty_score":0.0321939},"labels":[],"label_agreement":null},{"id":"W173992758","doi":"10.1007/978-3-642-25324-9_41","title":"An Hybrid Expert Model to Support Tutoring Services in Robotic Arm Manipulations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke; Université du Québec à Montréal","funders":"","keywords":"Computer science; Planner; Task (project management); Human–computer interaction; Domain (mathematical analysis); Key (lock); Intelligent tutoring system; Artificial intelligence; Cover (algebra); Software engineering; Systems engineering","score_opus":0.053064709753878433,"score_gpt":0.2801565801133607,"score_spread":0.22709187035948225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173992758","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.076835915,0.00026215712,0.91117436,0.00016695043,0.00008155492,0.00008605582,0.00011691432,0.0030242768,0.008251887],"genre_scores_gemma":[0.84984815,0.0002077975,0.135522,0.00010997702,0.000033378008,0.00014977629,0.0001864805,0.00014783145,0.013794637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998765,0.000018530774,0.0000089042305,0.00003294595,0.00004539666,0.000017663666],"domain_scores_gemma":[0.99979204,0.00008567722,0.000013651498,0.00002891817,0.00005680432,0.000022771177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019237473,0.00032515268,0.0003868437,0.00019735655,0.00023159786,0.0005990555,0.0012549357,0.0010076861,0.0039927787],"category_scores_gemma":[0.0008094273,0.00022516224,0.00029105856,0.00014840016,0.00019860547,0.00083059934,0.00065713545,0.00056343846,0.0007664885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035519665,0.0003766926,0.0010390813,0.00015906281,0.000059158865,0.0004495816,0.00021348834,0.7292255,0.037714966,0.01188326,0.004254167,0.21426986],"study_design_scores_gemma":[0.00000895533,0.000029513201,0.000083859726,0.0000031329082,0.000007728264,0.00003301469,0.000005656584,0.9960395,0.0018913731,0.0011432231,0.0007498174,0.0000042397864],"about_ca_topic_score_codex":0.0025819454,"about_ca_topic_score_gemma":0.0031451853,"teacher_disagreement_score":0.0039927787,"about_ca_system_score_codex":0.00024134504,"about_ca_system_score_gemma":0.00042094942,"threshold_uncertainty_score":0.0133571625},"labels":[],"label_agreement":null},{"id":"W1741741009","doi":"10.1007/978-3-642-18073-6_8","title":"Simulating Sparse Hamiltonians with Star Decompositions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Star (game theory); Astrophysics; Physics","score_opus":0.016218962655768065,"score_gpt":0.23186709502671327,"score_spread":0.2156481323709452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1741741009","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.57525647,0.0001758984,0.38822007,0.00078974705,0.00024631203,0.00013252281,0.0003741605,0.0013362904,0.03346852],"genre_scores_gemma":[0.9366214,0.000077789155,0.058504354,0.00011596177,0.000034163066,0.00009240193,0.00025348004,0.00022196023,0.0040784637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996402,0.0001529441,0.000013557743,0.00003594598,0.000096220196,0.00006115329],"domain_scores_gemma":[0.99846435,0.001021327,0.00005794682,0.00024468685,0.000092298906,0.00011941757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005808826,0.00038589488,0.0008184104,0.00037801286,0.00052208843,0.0008745147,0.0009751465,0.0011604356,0.007616098],"category_scores_gemma":[0.0031009496,0.00049798493,0.0006013483,0.0006263317,0.0012810585,0.0019951798,0.0016085131,0.001261905,0.0005153052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034115868,0.00014860576,0.00078969507,0.000087825516,0.00004382952,0.000108365566,0.00017645619,0.7265892,0.003201778,0.2513456,0.003027792,0.01413968],"study_design_scores_gemma":[0.000030758183,0.00001896383,0.000036576654,0.0000028567633,0.000002952142,0.00000990036,0.000024715957,0.929712,0.0005779556,0.06923874,0.00033980212,0.0000048203497],"about_ca_topic_score_codex":0.0012447379,"about_ca_topic_score_gemma":0.0018478286,"teacher_disagreement_score":0.007616098,"about_ca_system_score_codex":0.0005245676,"about_ca_system_score_gemma":0.00048961834,"threshold_uncertainty_score":0.025478423},"labels":[],"label_agreement":null},{"id":"W174193449","doi":"10.1007/978-3-642-14496-7_12","title":"Group Testing and Batch Verification","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Group testing; Group (periodic table); Sequential analysis; Algorithm; Theoretical computer science; Mathematics; Statistics","score_opus":0.03725402530080237,"score_gpt":0.2744197352274854,"score_spread":0.23716570992668304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174193449","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.010894613,0.0015203216,0.9513954,0.0012475455,0.00058942323,0.00013811757,0.00025423,0.0032727176,0.0306876],"genre_scores_gemma":[0.42424074,0.0012660298,0.49363428,0.0009587897,0.0010544092,0.0003692357,0.0012109308,0.0017185784,0.075546935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430895,0.0017068777,0.00023732286,0.0013394142,0.001924502,0.00048294908],"domain_scores_gemma":[0.98994243,0.004771053,0.00037196954,0.003877461,0.00086246734,0.00017461365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029071346,0.0020847546,0.002079458,0.0014536497,0.001206438,0.0029209964,0.0032957993,0.0020282518,0.014587718],"category_scores_gemma":[0.012299182,0.0009922567,0.002067414,0.0016526325,0.003952457,0.0060568303,0.003624135,0.00369848,0.0058127716],"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.0006556505,0.0001566718,0.0013012867,0.00035459563,0.00010583681,0.0003474693,0.00036066503,0.026005907,0.009576437,0.44258663,0.03171181,0.4868371],"study_design_scores_gemma":[0.00005158568,0.00013807902,0.00047892143,0.00006318801,0.000058453286,0.00047943532,0.000060177117,0.11930434,0.014891436,0.8445877,0.019843651,0.000043054697],"about_ca_topic_score_codex":0.0014377903,"about_ca_topic_score_gemma":0.0010532847,"teacher_disagreement_score":0.014587718,"about_ca_system_score_codex":0.0014125515,"about_ca_system_score_gemma":0.0013316681,"threshold_uncertainty_score":0.048800826},"labels":[],"label_agreement":null},{"id":"W17422451","doi":"10.1007/978-3-642-40358-3_7","title":"A Guide to Implement Open Data in Public Agencies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","field":"Social Sciences","cited_by":22,"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":"International Development Research Centre","keywords":"Open government; Open data; Excellence; Maturity (psychological); Capability Maturity Model; Latin Americans; Government (linguistics); Open source; Public relations; Simple (philosophy); Political science; Computer science; Business; Knowledge management; World Wide Web; Law; Software","score_opus":0.09859267444924925,"score_gpt":0.3633461925893629,"score_spread":0.26475351814011366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17422451","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.0013799602,0.0013916823,0.5192099,0.009657186,0.0010315377,0.0020034455,0.00728206,0.027058706,0.4309855],"genre_scores_gemma":[0.008718761,0.0020246992,0.68242574,0.0025613059,0.00014231926,0.0016019309,0.0047866213,0.0061699776,0.2915686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99618995,0.0011446502,0.00042262848,0.00022348955,0.0017544432,0.0002647752],"domain_scores_gemma":[0.99184895,0.0031879963,0.0002680102,0.0019286671,0.0023014718,0.00046486195],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.005552916,0.00082873553,0.0004794791,0.002574796,0.0020395361,0.0074502095,0.0024789185,0.002887687,0.13828157],"category_scores_gemma":[0.01641513,0.0015127438,0.0009520915,0.0029121384,0.0014048438,0.009770072,0.003967217,0.004529218,0.08821194],"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.000024594843,0.0002287029,0.0004489626,0.00031777762,0.00001192964,0.0001986939,0.000942024,0.0015305236,0.00117468,0.119349554,0.5022893,0.37348324],"study_design_scores_gemma":[0.00001126302,0.000011682861,0.00019888756,0.00019352586,0.000003497703,0.000082438695,0.00027227774,0.0008688559,0.0005543482,0.021884663,0.97590023,0.00001838877],"about_ca_topic_score_codex":0.00879976,"about_ca_topic_score_gemma":0.0142615745,"teacher_disagreement_score":0.9975211,"about_ca_system_score_codex":0.0022940822,"about_ca_system_score_gemma":0.0061505344,"threshold_uncertainty_score":0.4625979},"labels":[],"label_agreement":null},{"id":"W1743700406","doi":"10.1007/11531142_11","title":"Sustainable System Infrastructure and Big Bang Evolution: Can Aspects Keep Pace?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Victoria","funders":"","keywords":"Restructuring; Pace; Computer science; Modular programming; Point (geometry); Domain (mathematical analysis); Code (set theory); Software engineering; Process management; Engineering; Business; Programming language; Set (abstract data type); Mathematics; Geography","score_opus":0.012399886082880436,"score_gpt":0.2303968064392697,"score_spread":0.2179969203563893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1743700406","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16076674,0.030434636,0.12762845,0.14789048,0.0026383575,0.00008161364,0.00033696543,0.0006794819,0.52954334],"genre_scores_gemma":[0.9505162,0.011430399,0.008024551,0.0044659968,0.0006791461,0.00004330248,0.00008952157,0.00020821953,0.024542712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992949,0.00021735494,0.000025016245,0.000109066365,0.0001762208,0.0001774925],"domain_scores_gemma":[0.99758255,0.0011581144,0.00023382621,0.0003372249,0.00038152974,0.00030682137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020960344,0.0005292958,0.00072849705,0.00047219187,0.0011449859,0.0056220246,0.0012681705,0.0025740282,0.010824482],"category_scores_gemma":[0.006190009,0.00041403656,0.0004894961,0.0010368633,0.004851076,0.013344089,0.0020363224,0.0034961195,0.0010447138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009017088,0.00005615034,0.002428875,0.00027584392,0.00006957553,0.00022220303,0.0009191331,0.0047190795,0.00091497315,0.9172558,0.013118084,0.05993005],"study_design_scores_gemma":[0.00001200287,0.000040247796,0.0016453988,0.00010581556,0.00002764558,0.00013232624,0.0011084988,0.0039918576,0.0003914071,0.94583654,0.046684887,0.000023307835],"about_ca_topic_score_codex":0.002593603,"about_ca_topic_score_gemma":0.0034661782,"teacher_disagreement_score":0.010824482,"about_ca_system_score_codex":0.002014114,"about_ca_system_score_gemma":0.0020145415,"threshold_uncertainty_score":0.03621149},"labels":[],"label_agreement":null},{"id":"W174392811","doi":"10.1007/978-3-319-10470-6_43","title":"Enhanced Differential Evolution to Combine Optical Mouse Sensor with Image Structural Patches for Robust Endoscopic Navigation","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Robarts Clinical Trials; Western University","funders":"Japan Society for the Promotion of Science","keywords":"Computer vision; Computer science; Artificial intelligence; Endoscope; Tracking (education); Distortion (music); Navigation system; Imaging phantom; Physics; Optics","score_opus":0.009438246532576742,"score_gpt":0.2623319592506772,"score_spread":0.25289371271810046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174392811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05840966,0.00022563057,0.9391808,0.000051579937,0.00006074722,0.00001936721,0.000028856044,0.00031385568,0.0017095262],"genre_scores_gemma":[0.6105595,0.00020723502,0.38497388,0.0000944847,0.00002856459,0.00004118302,0.00008846421,0.00011133103,0.003895376],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998722,0.000016425929,0.0000034318898,0.000027275504,0.00007072838,0.000009889693],"domain_scores_gemma":[0.99988794,0.000032478507,0.000016724276,0.000019042469,0.000035496814,0.000008334857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013041143,0.00029567763,0.0002694681,0.00017806591,0.00007278094,0.00018046987,0.00051281776,0.0003069282,0.00085529167],"category_scores_gemma":[0.00034872975,0.0001805532,0.00026963284,0.00026710666,0.00012976032,0.00043045165,0.00043677635,0.00031280363,0.00020268797],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017170513,0.00009395028,0.0010316643,0.000081954495,0.000038492562,0.00010511962,0.00007301846,0.03920529,0.7644481,0.00454918,0.001062024,0.18913956],"study_design_scores_gemma":[0.000010195163,0.0001326185,0.0009798565,0.0000046572145,0.000017145972,0.00022346688,0.000009421371,0.8946844,0.10118717,0.0005420056,0.0021931413,0.000015879708],"about_ca_topic_score_codex":0.00045729,"about_ca_topic_score_gemma":0.0008271758,"teacher_disagreement_score":0.00085529167,"about_ca_system_score_codex":0.00017720886,"about_ca_system_score_gemma":0.00015102306,"threshold_uncertainty_score":0.0028612614},"labels":[],"label_agreement":null},{"id":"W174485529","doi":"10.1007/978-3-642-38016-7_13","title":"Minimizing Cache Usage in Paging","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Cache; Cache algorithms; Competitive analysis; Page cache; Smart Cache; Cache invalidation; Cache-oblivious algorithm; Cache coloring; CPU cache; Parallel computing; Cache pollution; Online algorithm; Algorithm; Computer network; Upper and lower bounds; Mathematics","score_opus":0.027506684045857103,"score_gpt":0.2567483282238566,"score_spread":0.22924164417799953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174485529","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.20194973,0.009596265,0.7477758,0.0011608631,0.00053845136,0.00025456818,0.0006474777,0.0038084092,0.034268487],"genre_scores_gemma":[0.815641,0.0028644346,0.16522034,0.00017426028,0.00025773852,0.00014767023,0.00038871804,0.0007900808,0.0145158265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989542,0.00029341408,0.00006500677,0.00013887156,0.0002806283,0.00026786423],"domain_scores_gemma":[0.9976732,0.0010584563,0.00017639094,0.0006122794,0.0003448252,0.0001349473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008466597,0.0013881386,0.0019155227,0.00093885005,0.0007864183,0.0022983043,0.0023311777,0.001164839,0.004510692],"category_scores_gemma":[0.005657201,0.0007473051,0.0005206954,0.003393781,0.00066592917,0.0027554964,0.001179825,0.0012413149,0.00089792523],"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.0007679644,0.00027622894,0.0019216209,0.00068083766,0.00010829171,0.00025403668,0.00020960858,0.52733254,0.014909195,0.054425165,0.01920188,0.37991267],"study_design_scores_gemma":[0.00004389945,0.0002594311,0.000808777,0.00009148453,0.00011749883,0.00044561113,0.00012266594,0.9278124,0.0067072,0.05628456,0.007277924,0.000028505308],"about_ca_topic_score_codex":0.0020456442,"about_ca_topic_score_gemma":0.0026475426,"teacher_disagreement_score":0.004510692,"about_ca_system_score_codex":0.0013707587,"about_ca_system_score_gemma":0.0013610778,"threshold_uncertainty_score":0.01508981},"labels":[],"label_agreement":null},{"id":"W1744969496","doi":"10.1007/11559573_126","title":"Rotation-Invariant Facial Feature Detection Using Gabor Wavelet and Entropy","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Gabor wavelet; Computer science; Wavelet; Computer vision; Facial recognition system; Brightness; Entropy (arrow of time); Invariant (physics); Face detection; Feature (linguistics); Wavelet transform; Mathematics; Discrete wavelet transform; Physics; Optics","score_opus":0.01470655609832851,"score_gpt":0.23727863539404956,"score_spread":0.22257207929572104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1744969496","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.057308305,0.00073935464,0.93801856,0.00008482408,0.00008349275,0.000044691944,0.00016245215,0.00074704725,0.002811244],"genre_scores_gemma":[0.49281755,0.0013473629,0.49922213,0.00006394763,0.00012882125,0.00006701322,0.00049785327,0.00019838543,0.0056568757],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978906,0.000024718394,0.000012373367,0.000037783902,0.000114935916,0.000021173615],"domain_scores_gemma":[0.99977344,0.0000943727,0.00002622538,0.000030155732,0.00006350625,0.00001225335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038678988,0.00035857863,0.00068845943,0.0011224011,0.0001574621,0.0005823416,0.0003212417,0.00026585057,0.0020737168],"category_scores_gemma":[0.00079944794,0.00026596134,0.00052550994,0.00080544746,0.00027697373,0.0008571943,0.0004408661,0.00029694266,0.0009207574],"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.0003255371,0.00006471665,0.0021721972,0.00013548638,0.00005561458,0.00010796847,0.000055668865,0.009279012,0.23164943,0.0053495676,0.0019138237,0.7488909],"study_design_scores_gemma":[0.000046339734,0.00036889155,0.024176715,0.000052727388,0.0001786182,0.0012948317,0.000090424124,0.71097416,0.24640916,0.009898908,0.0064169285,0.00009216178],"about_ca_topic_score_codex":0.0003459296,"about_ca_topic_score_gemma":0.0004186462,"teacher_disagreement_score":0.0020737168,"about_ca_system_score_codex":0.00017588421,"about_ca_system_score_gemma":0.00020267502,"threshold_uncertainty_score":0.006937206},"labels":[],"label_agreement":null},{"id":"W174591770","doi":"10.1007/978-3-642-28525-7_7","title":"A Logical Approach to Data-Aware Automated Sequence Generation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Sequence (biology); Satisfiability; Set (abstract data type); Domain (mathematical analysis); Sequence diagram; Variety (cybernetics); Theoretical computer science; Programming language; Artificial intelligence; Unified Modeling Language; Software","score_opus":0.17213255103046662,"score_gpt":0.3455552282790685,"score_spread":0.17342267724860186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174591770","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.0008809875,0.00004187163,0.9958033,0.0001608734,0.000042764266,0.000064425345,0.00007053204,0.0011384115,0.0017967637],"genre_scores_gemma":[0.05839211,0.00018807562,0.93573314,0.0003280804,0.00011548193,0.0003041209,0.00044638873,0.0005369344,0.003955622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677867,0.0008645807,0.0003079205,0.00046231088,0.0013410613,0.00024556258],"domain_scores_gemma":[0.992446,0.0044714184,0.00027513705,0.0016445667,0.001013507,0.0001493223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003366462,0.00084837334,0.00082081824,0.0022318105,0.0016167192,0.0042110267,0.00385664,0.0015330155,0.011280296],"category_scores_gemma":[0.01104096,0.001204256,0.002515259,0.001809099,0.004213667,0.006216612,0.00434961,0.0030211578,0.0032223924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017844803,0.00015315595,0.00050045695,0.0003433537,0.00005224309,0.00032540708,0.00033153413,0.030437902,0.011249099,0.7861324,0.007967659,0.16232844],"study_design_scores_gemma":[0.000058421436,0.00006860671,0.00007416682,0.00007966673,0.000078379424,0.00024246715,0.000085097585,0.2624685,0.024078447,0.68841225,0.024300197,0.000053797867],"about_ca_topic_score_codex":0.0016689515,"about_ca_topic_score_gemma":0.0022902556,"teacher_disagreement_score":0.011280296,"about_ca_system_score_codex":0.0013732447,"about_ca_system_score_gemma":0.0029840998,"threshold_uncertainty_score":0.037736356},"labels":[],"label_agreement":null},{"id":"W1746999133","doi":"10.1007/978-3-540-75759-7_111","title":"Instrumentation for Epidural Anesthesia","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Anesthesia and Pain Management","field":"Medicine","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":"B.C. Women's Hospital & Health Centre; University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Plunger; Anesthesia; Instrumentation (computer programming); Displacement (psychology); Medicine; Biomedical engineering; Saline; In vivo; Leak; Materials science; Engineering; Computer science; Biology; Composite material","score_opus":0.017117548631940024,"score_gpt":0.29044685588557356,"score_spread":0.2733293072536335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1746999133","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.43195808,0.21512881,0.18389386,0.011847779,0.009275641,0.00053968886,0.0020318415,0.0052904896,0.14003375],"genre_scores_gemma":[0.898337,0.033595387,0.039456308,0.0032369671,0.0024698612,0.00015140977,0.00085757306,0.00038682224,0.021508683],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970883,0.000026890119,0.00003885079,0.00005610136,0.0000868499,0.000082428116],"domain_scores_gemma":[0.9993788,0.00014069499,0.00019255205,0.000115099974,0.00006193517,0.00011084574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030803427,0.0005421095,0.00039177708,0.0010667666,0.0010662691,0.0009518444,0.0005161202,0.0006056874,0.009136501],"category_scores_gemma":[0.0010618697,0.00017340816,0.00068374054,0.00090329745,0.0008929895,0.0007454736,0.0006791251,0.0017954175,0.0022774336],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022689186,0.0003289282,0.0119116455,0.0013554781,0.0002175215,0.010463466,0.00049781194,0.00042469034,0.08511291,0.008284018,0.014329344,0.8648054],"study_design_scores_gemma":[0.00069108885,0.0072442093,0.15196972,0.0015230548,0.0009805422,0.2398512,0.0005742195,0.0022955567,0.1610413,0.010030197,0.42359084,0.00020803392],"about_ca_topic_score_codex":0.00075211003,"about_ca_topic_score_gemma":0.0016548472,"teacher_disagreement_score":0.009136501,"about_ca_system_score_codex":0.0004491859,"about_ca_system_score_gemma":0.0011516765,"threshold_uncertainty_score":0.030564606},"labels":[],"label_agreement":null},{"id":"W1747746640","doi":"10.1007/978-3-540-72909-9_45","title":"Safety Analysis and Performance Evaluation of Time WF-nets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Novelis (Canada)","funders":"","keywords":"Workflow; Computer science; Petri net; Workflow management system; Key (lock); Property (philosophy); Throughput; Process (computing); Distributed computing; Stochastic Petri net; Arrival time; Real-time computing; Database; Programming language; Operating system; Engineering","score_opus":0.026100381129572848,"score_gpt":0.25344357401211914,"score_spread":0.22734319288254629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747746640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1623928,0.00041867228,0.826799,0.00026259176,0.00007238512,0.00012853183,0.00026471642,0.0014868109,0.00817454],"genre_scores_gemma":[0.87860584,0.0002342763,0.116462074,0.000043721786,0.00004824915,0.00008169396,0.0005148932,0.00021436634,0.0037948578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963056,0.0011727614,0.00017932607,0.00035230047,0.0015282001,0.00046176548],"domain_scores_gemma":[0.9872968,0.008426642,0.00075555133,0.0011006513,0.0020690905,0.00035119097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056983135,0.0010189498,0.00069937087,0.0018536195,0.00092829455,0.0017822194,0.0017846591,0.0009138545,0.0045656045],"category_scores_gemma":[0.016587982,0.00034917454,0.0010577862,0.0011312427,0.0016951624,0.0029328289,0.0010243757,0.0011540854,0.00036726554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013010142,0.00018961707,0.0030299365,0.00019802287,0.00007888232,0.00010702816,0.00017070753,0.7877003,0.00839172,0.093660034,0.0010878564,0.104084894],"study_design_scores_gemma":[0.000020892443,0.00012532514,0.0003259963,0.000018319453,0.000041887128,0.000025932419,0.000040434912,0.94693184,0.008072331,0.043835327,0.0005507542,0.000010886541],"about_ca_topic_score_codex":0.006153467,"about_ca_topic_score_gemma":0.00391654,"teacher_disagreement_score":0.006153467,"about_ca_system_score_codex":0.002457577,"about_ca_system_score_gemma":0.002242963,"threshold_uncertainty_score":0.03013587},"labels":[],"label_agreement":null},{"id":"W1748273688","doi":"10.1007/978-3-642-34321-6_52","title":"Analyzing Coopetition Strategies of Services within Communities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","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":"Concordia University; McGill University","funders":"","keywords":"Coopetition; Web service; Services computing; Computer science; WS-Policy; WS-I Basic Profile; Aggregate (composite); World Wide Web; Quality (philosophy); Web standards; Knowledge management; Web development; Game theory; Web application security; Mathematics","score_opus":0.023834604096262826,"score_gpt":0.2320870691783349,"score_spread":0.20825246508207207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1748273688","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.98874086,0.000112710186,0.0056565874,0.00010568853,0.000001834831,0.000023245912,0.000037693502,0.000016056505,0.0053052716],"genre_scores_gemma":[0.9975242,0.000030834,0.0017743461,0.00000422322,0.0000012649112,0.000008982443,0.000032858792,0.000006534499,0.00061668025],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928254,0.00023271842,0.000020775364,0.00010132875,0.00014740786,0.00021539794],"domain_scores_gemma":[0.9953046,0.003104339,0.00044357224,0.00024062455,0.00041418095,0.0004926886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010361696,0.00020629223,0.00029979605,0.0015762758,0.0010790383,0.0023203748,0.00092345994,0.0009733022,0.0039800843],"category_scores_gemma":[0.0076485844,0.00020450166,0.00043647355,0.002568607,0.0010278393,0.0028352083,0.0011456842,0.00057788927,0.0003199842],"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.001235932,0.0008676691,0.37647226,0.00028701374,0.00031672203,0.0011994713,0.015949462,0.13692506,0.013296613,0.26698443,0.003133474,0.18333192],"study_design_scores_gemma":[0.00005503629,0.00024039576,0.09795369,0.000059184742,0.00011469379,0.00035337437,0.028682623,0.75636035,0.0037615702,0.10822493,0.004137905,0.000056187226],"about_ca_topic_score_codex":0.029586986,"about_ca_topic_score_gemma":0.02975443,"teacher_disagreement_score":0.029586986,"about_ca_system_score_codex":0.0022149265,"about_ca_system_score_gemma":0.0011813365,"threshold_uncertainty_score":0.058829486},"labels":[],"label_agreement":null},{"id":"W1748313197","doi":"10.1007/978-3-642-23626-6_55","title":"Robust Surface-Based Multi-template Automated Algorithm to Segment Healthy and Pathological Hippocampi","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Epilepsy research and treatment","field":"Medicine","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Segmentation; Epilepsy; Atrophy; Temporal lobe; Hippocampal formation; Epilepsy surgery; Artificial intelligence; Pattern recognition (psychology); Algorithm; Neuroscience; Medicine; Pathology; Psychology","score_opus":0.07539627118299863,"score_gpt":0.3238817349073484,"score_spread":0.24848546372434976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1748313197","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.020904034,0.0005957346,0.9735406,0.00013245529,0.00008142756,0.00010094461,0.00025390348,0.0035372379,0.00085365307],"genre_scores_gemma":[0.13003391,0.00042281515,0.86493146,0.00015644624,0.00007634462,0.00015872423,0.0007663641,0.00052115193,0.002932685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999371,0.00007139409,0.00005037349,0.00015766003,0.00026028397,0.00008931414],"domain_scores_gemma":[0.9991979,0.00020085457,0.000084576284,0.00013094347,0.00034117317,0.000044653527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009615119,0.001032326,0.0014203618,0.0027518547,0.00053958327,0.0013442847,0.0019510856,0.0019894426,0.0024343703],"category_scores_gemma":[0.0016708148,0.0006452374,0.0015182211,0.001654539,0.0004274568,0.0009123316,0.0012774185,0.0009051019,0.0018706983],"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.00049771887,0.00012145958,0.0025736105,0.00016645424,0.00023611845,0.0002797,0.000098780605,0.021706812,0.106633455,0.0017528645,0.005896438,0.8600366],"study_design_scores_gemma":[0.00009108889,0.0002111592,0.007369607,0.000030356638,0.00022891209,0.0017308326,0.00009982371,0.8899225,0.08936509,0.0036819302,0.007185204,0.000083559804],"about_ca_topic_score_codex":0.00488984,"about_ca_topic_score_gemma":0.0071744802,"teacher_disagreement_score":0.00488984,"about_ca_system_score_codex":0.00049184187,"about_ca_system_score_gemma":0.0017073553,"threshold_uncertainty_score":0.009722769},"labels":[],"label_agreement":null},{"id":"W1748363735","doi":"10.1007/978-3-642-38827-9_12","title":"Reconciling Theories with Design Choices in Design Science Research","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Systems Theories and Implementation","field":"Social Sciences","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":"Memorial University of Newfoundland","funders":"","keywords":"Design science; Computer science; Design science research; Artifact (error); Popularity; Relevance (law); Transformational leadership; Management science; Research design; Engineering ethics; Rigour; Data science; Knowledge management; Epistemology; Information system; Sociology; Artificial intelligence; Management; Political science; Social science; Engineering","score_opus":0.1095487452159362,"score_gpt":0.3770545236735321,"score_spread":0.2675057784575959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1748363735","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.016097637,0.007296607,0.89032865,0.033052076,0.0007589583,0.00025757914,0.0001582453,0.00023510287,0.05181512],"genre_scores_gemma":[0.5124153,0.00420926,0.47113603,0.003540765,0.0004181842,0.0019296574,0.00025737946,0.00039028228,0.0057030693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.85932827,0.116620935,0.004775138,0.0041947863,0.013564407,0.0015165106],"domain_scores_gemma":[0.70414746,0.2677889,0.0063117733,0.016110387,0.0044883033,0.001153143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07617478,0.0025593597,0.0026292882,0.007178098,0.0034396972,0.016450737,0.005551286,0.0069261147,0.0075604212],"category_scores_gemma":[0.12401684,0.00356116,0.0019758805,0.0072345547,0.041609485,0.029887673,0.009419007,0.011966542,0.0013020706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144162605,0.000023846771,0.00018348961,0.00026672665,0.000028757564,0.000023775649,0.0011973369,0.0015222868,0.00005496295,0.98399156,0.0006564016,0.01203647],"study_design_scores_gemma":[0.000011080701,0.000006817839,0.000020124675,0.00011768183,0.0000125297765,0.000011105139,0.00030063433,0.0015868861,0.00011867599,0.9953982,0.0024102458,0.0000060109633],"about_ca_topic_score_codex":0.0008029014,"about_ca_topic_score_gemma":0.0012103618,"teacher_disagreement_score":0.07617478,"about_ca_system_score_codex":0.0075587216,"about_ca_system_score_gemma":0.0057985038,"threshold_uncertainty_score":0.40285558},"labels":[],"label_agreement":null},{"id":"W174841153","doi":"10.1007/978-3-642-21043-3_29","title":"Evaluation and Application of Scenario Based Design on Thunderbird","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering and Design Patterns","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 Regina","funders":"","keywords":"Computer science; Engineering drawing; Engineering","score_opus":0.05306189628307804,"score_gpt":0.2940368298237677,"score_spread":0.2409749335406897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174841153","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.7112822,0.00029808583,0.24670842,0.00027025494,0.00013368271,0.0026270158,0.0013208364,0.0029390235,0.034420367],"genre_scores_gemma":[0.79996634,0.00018600054,0.19356681,0.00004434895,0.000010757491,0.0009850216,0.0011031519,0.00031138954,0.0038261993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951934,0.0036659958,0.00018300461,0.00027009903,0.00057305687,0.00011440935],"domain_scores_gemma":[0.97933084,0.015713526,0.000552006,0.0016553858,0.00217794,0.0005704543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005624651,0.0010748289,0.0005023039,0.0016131671,0.0006460986,0.0018671972,0.0017586556,0.001200209,0.012945271],"category_scores_gemma":[0.019092308,0.00055052456,0.00074149,0.0010583072,0.00072796753,0.001443191,0.0014125939,0.0006461876,0.0012155003],"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.006406761,0.0049781688,0.018946456,0.002092943,0.00037132972,0.000681787,0.008162834,0.45684168,0.027085833,0.03242679,0.0068901964,0.4351152],"study_design_scores_gemma":[0.0016067143,0.009920175,0.016497359,0.00046825592,0.0005460406,0.00041251286,0.0048593795,0.8748282,0.030600403,0.020287644,0.03977228,0.00020101664],"about_ca_topic_score_codex":0.0038280275,"about_ca_topic_score_gemma":0.0035422896,"teacher_disagreement_score":0.012945271,"about_ca_system_score_codex":0.0022513578,"about_ca_system_score_gemma":0.0012847149,"threshold_uncertainty_score":0.04330623},"labels":[],"label_agreement":null},{"id":"W1748422605","doi":"10.1007/978-3-642-21852-1_40","title":"Visual Analytics of Social Networks: Mining and Visualizing Co-authorship Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":63,"is_retracted":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":"Computer science; Visual analytics; Data science; Representation (politics); Social network analysis; Social network (sociolinguistics); Visualization; Information retrieval; World Wide Web; Data mining; Social media","score_opus":0.04011063968085067,"score_gpt":0.3133402153665318,"score_spread":0.2732295756856811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1748422605","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.086833365,0.0057564657,0.861415,0.002441695,0.00043855072,0.00023768574,0.0086704325,0.012361111,0.021845669],"genre_scores_gemma":[0.47418404,0.0048857993,0.49604148,0.000254917,0.00038216988,0.0002416919,0.008889963,0.0012154012,0.01390459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952686,0.000117145275,0.0000350717,0.0000866017,0.00018911906,0.000045341152],"domain_scores_gemma":[0.99842393,0.0008594241,0.00019532516,0.00016178006,0.00024297506,0.00011665366],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0006953742,0.00082111155,0.00045600868,0.004661141,0.00050334586,0.0032437595,0.00085339486,0.0006999896,0.0062694745],"category_scores_gemma":[0.004286539,0.0004262477,0.0006790455,0.0047220495,0.00035899613,0.0027302967,0.0014136173,0.0007781197,0.00211313],"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.00025956347,0.00020160052,0.011095959,0.0012948799,0.0001961195,0.0004121626,0.0029089157,0.034608483,0.024416512,0.04513338,0.07419483,0.8052775],"study_design_scores_gemma":[0.000043511795,0.00009920551,0.01211098,0.0004012757,0.00012768086,0.001076669,0.0021840683,0.6135445,0.030530542,0.2350603,0.10470848,0.00011279633],"about_ca_topic_score_codex":0.0018087038,"about_ca_topic_score_gemma":0.0027337982,"teacher_disagreement_score":0.99533886,"about_ca_system_score_codex":0.00041612994,"about_ca_system_score_gemma":0.00054898736,"threshold_uncertainty_score":0.020973504},"labels":[],"label_agreement":null},{"id":"W1749331913","doi":"10.1007/978-3-642-03070-3_50","title":"New Semantic Similarity Based Model for Text Clustering Using Extended Gloss Overlaps","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; WordNet; Semantic similarity; Vector space model; Ambiguity; Cluster analysis; Natural language processing; Artificial intelligence; Explicit semantic analysis; Information retrieval; Similarity (geometry); Semantic computing; Semantic Web; Semantic technology; Image (mathematics)","score_opus":0.043327171249890384,"score_gpt":0.2861407243885287,"score_spread":0.24281355313863834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749331913","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.010340524,0.00039485528,0.9837336,0.00014068262,0.00008058087,0.0001786091,0.0010554821,0.0019645214,0.002111153],"genre_scores_gemma":[0.21011506,0.0005527406,0.7714465,0.00019329459,0.00017619439,0.00077615154,0.0075682113,0.0007491472,0.008422595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664634,0.0006202864,0.00041947525,0.0007845332,0.0013754732,0.00015384435],"domain_scores_gemma":[0.9975338,0.0006565401,0.00016729666,0.00064684794,0.0009198676,0.00007564802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018272218,0.00087944826,0.0014528048,0.0045803385,0.0013750206,0.0024979478,0.0031096498,0.0016511714,0.003796825],"category_scores_gemma":[0.0058868895,0.0005598966,0.0019257546,0.0051265275,0.00080856617,0.006724368,0.0025608405,0.001339852,0.0025112447],"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.00092129566,0.0006024571,0.003856904,0.0007403235,0.0005379464,0.00048210312,0.0011481686,0.113998234,0.026113357,0.09465429,0.024503801,0.7324411],"study_design_scores_gemma":[0.000032298478,0.000087953915,0.0010905161,0.00005556083,0.00012271032,0.0002631301,0.0001517946,0.9444794,0.0068644015,0.03675791,0.01003093,0.00006345367],"about_ca_topic_score_codex":0.00836304,"about_ca_topic_score_gemma":0.011660581,"teacher_disagreement_score":0.00836304,"about_ca_system_score_codex":0.0013160099,"about_ca_system_score_gemma":0.0014502407,"threshold_uncertainty_score":0.016628742},"labels":[],"label_agreement":null},{"id":"W1749589422","doi":"10.1007/978-3-540-73354-6_2","title":"Using Social Metadata in Email Triage: Lessons from the Field","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Metadata; World Wide Web; Workflow; Computer science; Software deployment; Social media; Triage; Field (mathematics); Internet privacy; Metadata repository; Medicine; Database; Medical emergency","score_opus":0.4573348420949856,"score_gpt":0.4833673598280566,"score_spread":0.026032517733071026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749589422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2730832,0.023095641,0.44163194,0.068636514,0.0021522196,0.00081452524,0.000960802,0.002757605,0.18686746],"genre_scores_gemma":[0.79347163,0.009232145,0.1801503,0.0019685251,0.0011323188,0.0002881817,0.00046353965,0.00049028464,0.0128030935],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99456114,0.0039334875,0.00026730963,0.00030959523,0.0007525443,0.00017588903],"domain_scores_gemma":[0.9352912,0.05699993,0.0012809803,0.0030876114,0.0026072029,0.0007330623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011244614,0.0005320538,0.0004858632,0.0023381528,0.0018954815,0.007084514,0.0018600285,0.0027795197,0.006053851],"category_scores_gemma":[0.043659076,0.0005239672,0.00039234964,0.0032556232,0.0022626885,0.0123426905,0.0021066132,0.0021381339,0.0020865956],"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.00033077586,0.0007469114,0.020563187,0.00080009946,0.00007062203,0.00029815017,0.014092148,0.003682921,0.001978869,0.05989352,0.024733072,0.8728097],"study_design_scores_gemma":[0.0003757663,0.0014254784,0.034453098,0.0030509173,0.00036477737,0.0031412954,0.059582524,0.108218335,0.016918022,0.4700416,0.30183893,0.0005891581],"about_ca_topic_score_codex":0.0046397205,"about_ca_topic_score_gemma":0.0054887254,"teacher_disagreement_score":0.011244614,"about_ca_system_score_codex":0.0012149197,"about_ca_system_score_gemma":0.0020234778,"threshold_uncertainty_score":0.05946791},"labels":[],"label_agreement":null},{"id":"W1749721722","doi":"10.1007/978-3-642-03364-3_24","title":"Where Academics Meet the Real World: Difficulties Encountered When Conducting a Project for Designing a Game-Based Learning in a Company","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Athabasca University","funders":"","keywords":"Computer science; Artificial intelligence; Multimedia; Operations research; Human–computer interaction; Engineering","score_opus":0.08589179356960727,"score_gpt":0.34856364182611393,"score_spread":0.2626718482565067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749721722","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.72081757,0.0022435952,0.0940246,0.03213186,0.0023293192,0.00092552364,0.0001282798,0.0011040908,0.14629516],"genre_scores_gemma":[0.8571508,0.0015062534,0.06610866,0.0028675706,0.00014969359,0.00039794945,0.00012974224,0.00046106015,0.071228296],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9903688,0.006026464,0.00033638286,0.00059523695,0.0016213567,0.001051804],"domain_scores_gemma":[0.98495644,0.005182372,0.00075149327,0.0005705031,0.0018039063,0.006735388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011204086,0.0010575812,0.00047908165,0.0010195937,0.012349987,0.011050446,0.0025621026,0.003870893,0.0056268917],"category_scores_gemma":[0.01954366,0.0012145558,0.0005806944,0.0009584045,0.0034801401,0.006988951,0.0077155656,0.006826227,0.0024765497],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016052736,0.0015832409,0.010430345,0.00040808786,0.000045553374,0.0065304553,0.71420455,0.00082184083,0.008674895,0.01856186,0.0635554,0.17502333],"study_design_scores_gemma":[0.000028701095,0.0006660041,0.007677106,0.0004660914,0.000042131625,0.005208333,0.741549,0.00176002,0.0029827117,0.006979011,0.2325345,0.00010631764],"about_ca_topic_score_codex":0.0026876132,"about_ca_topic_score_gemma":0.013731971,"teacher_disagreement_score":0.012349987,"about_ca_system_score_codex":0.0025324684,"about_ca_system_score_gemma":0.0057887477,"threshold_uncertainty_score":0.059253514},"labels":[],"label_agreement":null},{"id":"W1749917426","doi":"10.1007/978-3-642-16023-3_22","title":"Broadcasting in Sensor Networks of Unknown Topology in the Presence of Swamping","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Broadcasting (networking); Wireless sensor network; Computer science; Granularity; Topology (electrical circuits); Network topology; Computer network; Plane (geometry); Wireless; Upper and lower bounds; Distributed computing; Telecommunications; Mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.015762162602857645,"score_gpt":0.24806053918884366,"score_spread":0.232298376585986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749917426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2412279,0.00980453,0.71947986,0.0015447863,0.00032633526,0.0000971401,0.00014905847,0.00053827267,0.026832094],"genre_scores_gemma":[0.946459,0.005730567,0.035067555,0.00010108976,0.0002970913,0.00006561621,0.00011853514,0.00012233261,0.012038207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949145,0.00017578545,0.000020408752,0.000085961925,0.00015936038,0.00006716246],"domain_scores_gemma":[0.9948361,0.004151648,0.0003353504,0.00018871289,0.00032902663,0.00015922224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305404,0.0004628248,0.0011361716,0.0009716729,0.0007664571,0.0012688839,0.001358275,0.0013553159,0.0011400525],"category_scores_gemma":[0.007702627,0.00071671925,0.000408793,0.0015239873,0.0020124153,0.0027774943,0.0011655911,0.0009985788,0.00024717514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034226576,0.000058189366,0.0019455974,0.00075875764,0.00007648294,0.0010970057,0.0013671367,0.7416553,0.01462193,0.1619064,0.0038730996,0.07229788],"study_design_scores_gemma":[0.000024538242,0.000082961626,0.0005789504,0.000032012053,0.000032884396,0.00042423804,0.00024752985,0.9218369,0.001442985,0.07272586,0.0025438338,0.000027353823],"about_ca_topic_score_codex":0.003186036,"about_ca_topic_score_gemma":0.002144846,"teacher_disagreement_score":0.003186036,"about_ca_system_score_codex":0.0009948295,"about_ca_system_score_gemma":0.0004910928,"threshold_uncertainty_score":0.007218063},"labels":[],"label_agreement":null},{"id":"W17499823","doi":"10.1007/978-3-642-39159-0_1","title":"A Fast Agglomerative Community Detection Method for Protein Complex Discovery in Protein Interaction Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","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":"University of Windsor","funders":"","keywords":"Hierarchical clustering; Vertex (graph theory); Protein Interaction Networks; Computer science; Cluster analysis; Hierarchical clustering of networks; Data mining; Theoretical computer science; Algorithm; Pattern recognition (psychology); Protein–protein interaction; Artificial intelligence; Biology; Graph; Canopy clustering algorithm; Fuzzy clustering","score_opus":0.018782463296955626,"score_gpt":0.27045963460087485,"score_spread":0.2516771713039192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17499823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008783998,0.0003937268,0.9855402,0.000106079235,0.00008974265,0.0001741312,0.00040837855,0.0040596733,0.0004440381],"genre_scores_gemma":[0.032804355,0.00017488255,0.9628092,0.00006111086,0.00006155646,0.0002568443,0.0012244555,0.0004410592,0.0021665632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980743,0.0003732023,0.00012220311,0.00037311614,0.0008966901,0.00016055211],"domain_scores_gemma":[0.9969721,0.0012610431,0.00015456107,0.00047856613,0.00094878575,0.00018500353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025088345,0.0018463131,0.0024088384,0.0053554825,0.0023824514,0.0015313071,0.0046370453,0.0019108952,0.003787231],"category_scores_gemma":[0.005250726,0.0012833207,0.002704594,0.004303742,0.0009490534,0.0019917332,0.0028349604,0.0020757467,0.0026844596],"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.0006339454,0.00046256624,0.0033087165,0.0005573187,0.0008677849,0.00039263832,0.00039904253,0.096503876,0.03099035,0.009707032,0.027128842,0.82904786],"study_design_scores_gemma":[0.000059624417,0.000045139477,0.0011068042,0.0000183471,0.00008500142,0.0002399223,0.000053012343,0.97912127,0.00641532,0.008861981,0.0039429353,0.00005063261],"about_ca_topic_score_codex":0.011958663,"about_ca_topic_score_gemma":0.020681892,"teacher_disagreement_score":0.011958663,"about_ca_system_score_codex":0.0009254475,"about_ca_system_score_gemma":0.002050483,"threshold_uncertainty_score":0.023778081},"labels":[],"label_agreement":null},{"id":"W1750858516","doi":"10.1007/978-3-319-08783-2_29","title":"Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Vertex cover; Approximation algorithm; Vertex (graph theory); Dual (grammatical number); Cover (algebra); Time complexity; Computer science; Edge cover; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Graph","score_opus":0.024143704193589348,"score_gpt":0.23782307009736783,"score_spread":0.21367936590377848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750858516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025697177,0.0037704362,0.93811095,0.001796623,0.00051678723,0.00032424167,0.0008032386,0.0014597008,0.027520752],"genre_scores_gemma":[0.23181126,0.0019015546,0.7447509,0.0007986494,0.00053025247,0.00073657127,0.0019881348,0.0010283669,0.016454253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.0004882058,0.000055562254,0.00030062033,0.0003298389,0.00029181727],"domain_scores_gemma":[0.99714833,0.0018043859,0.00016555945,0.00038879717,0.00026126142,0.00023166022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002747728,0.0026005693,0.0025628714,0.0012975242,0.0009922973,0.003961766,0.003949597,0.0027017747,0.013863427],"category_scores_gemma":[0.007863377,0.0013386403,0.0014890997,0.0031096851,0.0011846968,0.004436641,0.0027849202,0.006199147,0.0027229749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008743316,0.0012231742,0.001052068,0.00085386116,0.0001697852,0.0001282501,0.00021205329,0.45177186,0.0019024186,0.14728509,0.059573796,0.33495343],"study_design_scores_gemma":[0.00011188582,0.000057337566,0.00011684823,0.00006593392,0.000027254062,0.00007454368,0.00006114925,0.90453804,0.00050114247,0.09122707,0.0032071527,0.000011581064],"about_ca_topic_score_codex":0.0029693411,"about_ca_topic_score_gemma":0.004656007,"teacher_disagreement_score":0.013863427,"about_ca_system_score_codex":0.0030072297,"about_ca_system_score_gemma":0.0026865248,"threshold_uncertainty_score":0.04637772},"labels":[],"label_agreement":null},{"id":"W1751330240","doi":"10.1007/3-540-45314-8_2","title":"Metamodelling and Conformance Checking with PVS","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Metamodeling; Programming language; Conformance checking; Model checking; Conformance testing; Software engineering; Operating system; Work in process","score_opus":0.031308364412587185,"score_gpt":0.2639908078676263,"score_spread":0.2326824434550391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751330240","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.0057590576,0.000068303096,0.99053615,0.000077953344,0.000025306077,0.000058720118,0.000034090812,0.001658596,0.001781831],"genre_scores_gemma":[0.2604914,0.00023366066,0.7325137,0.000117617295,0.000046309156,0.00021942185,0.00033899266,0.0011139957,0.0049249227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929469,0.0028887885,0.00048562099,0.001033245,0.002222505,0.0004229659],"domain_scores_gemma":[0.9924091,0.0036811978,0.00041879134,0.002789845,0.0006292546,0.00007180862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048163855,0.0009902027,0.0010454372,0.0015423548,0.0009696789,0.002316793,0.0026706404,0.0013848158,0.004877317],"category_scores_gemma":[0.015118412,0.0015506446,0.0030505587,0.0013077429,0.0030684085,0.006224642,0.0029989649,0.0028776228,0.0010945512],"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.00027697498,0.000153634,0.0020160833,0.0005836777,0.00017880044,0.0004214418,0.00079709926,0.14040875,0.017898083,0.51377296,0.002833994,0.3206585],"study_design_scores_gemma":[0.000056038927,0.000084869615,0.00033221743,0.00013046862,0.00010760977,0.00026658323,0.00010586225,0.36885887,0.035271656,0.5809776,0.013758133,0.00005009705],"about_ca_topic_score_codex":0.0019310098,"about_ca_topic_score_gemma":0.0023891872,"teacher_disagreement_score":0.004877317,"about_ca_system_score_codex":0.0011026826,"about_ca_system_score_gemma":0.0013204638,"threshold_uncertainty_score":0.025471747},"labels":[],"label_agreement":null},{"id":"W1751675319","doi":"10.1007/978-3-642-02906-6_21","title":"Surprise-Based Qualitative Probabilistic Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Windsor","funders":"","keywords":"Surprise; Probabilistic logic; Computer science; Robustness (evolution); Bayesian network; Measure (data warehouse); Theoretical computer science; Qualitative analysis; Artificial intelligence; Data mining; Qualitative research","score_opus":0.03384888995241885,"score_gpt":0.28993642370321354,"score_spread":0.2560875337507947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751675319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010729635,0.00033071212,0.9771388,0.0005840699,0.000047314556,0.000026865446,0.00024847907,0.00024210212,0.010652092],"genre_scores_gemma":[0.71176714,0.0014711918,0.27201712,0.00033712017,0.0001511752,0.00024175915,0.0007341484,0.00021495881,0.013065337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992524,0.00028988425,0.00003994625,0.00014647726,0.00022545033,0.00004579362],"domain_scores_gemma":[0.99469143,0.0037334966,0.00040957693,0.0004209216,0.0005509379,0.00019366888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016481158,0.0005379751,0.0006641748,0.0013827836,0.0005678434,0.0017680529,0.0016860475,0.0011094825,0.0067346026],"category_scores_gemma":[0.010464498,0.00059436914,0.00092195085,0.0012314973,0.0017865194,0.0037191708,0.0015841548,0.001598827,0.0006584366],"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.000045947134,0.000014642568,0.00036709415,0.000098962366,0.000024647827,0.000104966115,0.00018252531,0.0847797,0.001172691,0.8881766,0.0015964803,0.02343576],"study_design_scores_gemma":[0.0000041190797,0.0000060627212,0.00009404937,0.000011694396,0.0000077597915,0.000049713482,0.000022527503,0.19794197,0.00031808406,0.80018365,0.0013524039,0.000007901806],"about_ca_topic_score_codex":0.0015155885,"about_ca_topic_score_gemma":0.0013151617,"teacher_disagreement_score":0.0067346026,"about_ca_system_score_codex":0.0013493809,"about_ca_system_score_gemma":0.00054192974,"threshold_uncertainty_score":0.022529542},"labels":[],"label_agreement":null},{"id":"W175185775","doi":"10.1007/978-3-319-09042-9_10","title":"Writing Generation Model for Health Care Neuromuscular System Investigation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Motor Control and Adaptation","field":"Neuroscience","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","funders":"","keywords":"Handwriting; Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.04771277604351104,"score_gpt":0.26266578277295166,"score_spread":0.21495300672944062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175185775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006783346,0.0001611325,0.98259,0.00026832797,0.00006760529,0.000063102554,0.00027539837,0.0011439291,0.008647096],"genre_scores_gemma":[0.484595,0.00052232685,0.4504667,0.00027270336,0.00014492797,0.00048222783,0.0013978739,0.00067482627,0.06144339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996928,0.00010753547,0.000020736812,0.000075118616,0.000080356054,0.000023565908],"domain_scores_gemma":[0.99900275,0.000588193,0.00004212547,0.00011503735,0.0002122431,0.00003962752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006883158,0.0005374787,0.0005624233,0.0004849025,0.00035274768,0.0010443958,0.001192651,0.0011649072,0.018089237],"category_scores_gemma":[0.0030183282,0.00025543786,0.00072226796,0.00035368465,0.0003357393,0.0011375367,0.00075359765,0.0009283796,0.0030607763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002467774,0.00016125114,0.0014104475,0.00019721736,0.000053936797,0.000527011,0.00028651644,0.6117049,0.0064088083,0.097834684,0.013496072,0.26767245],"study_design_scores_gemma":[0.000005733148,0.00001587239,0.00009694093,0.000006603308,0.0000068726567,0.000048382833,0.000008478913,0.98074496,0.00054507493,0.016980004,0.0015362614,0.00000472554],"about_ca_topic_score_codex":0.0029353076,"about_ca_topic_score_gemma":0.0027570205,"teacher_disagreement_score":0.018089237,"about_ca_system_score_codex":0.00045633287,"about_ca_system_score_gemma":0.0006863853,"threshold_uncertainty_score":0.06051451},"labels":[],"label_agreement":null},{"id":"W1751962440","doi":"10.1007/978-3-540-87361-7_7","title":"NAPX: A Polynomial Time Approximation Scheme for the Noah’s Ark Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Dalhousie University; Carleton University","funders":"","keywords":"Polynomial-time approximation scheme; Sequence (biology); Time complexity; Tree (set theory); Set (abstract data type); Mathematics; Combinatorics; Nap; Scheme (mathematics); Phylogenetic tree; Taxon; Extinction (optical mineralogy); Computer science; Discrete mathematics; Mathematical optimization; Ecology; Physics; Biology","score_opus":0.012194736099937912,"score_gpt":0.22092793859414706,"score_spread":0.20873320249420915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751962440","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.027320184,0.001636861,0.90750474,0.004361933,0.0010979209,0.00045525286,0.0024218766,0.0063935136,0.04880768],"genre_scores_gemma":[0.21196671,0.0012601012,0.7373289,0.001416424,0.0006032885,0.0008688937,0.0042363466,0.0015126904,0.04080666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.00026441936,0.00007871345,0.00038041547,0.00042468737,0.00028979036],"domain_scores_gemma":[0.9981369,0.0008929594,0.00007917205,0.00057745987,0.00017902303,0.00013442892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018487674,0.0015563485,0.0023337544,0.0010918233,0.0019159337,0.003577369,0.0044437787,0.002657483,0.023763198],"category_scores_gemma":[0.0061492,0.0008130423,0.002065661,0.0023455936,0.0016579042,0.008723647,0.0052011604,0.006869869,0.005571954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014297055,0.00040816376,0.00064379897,0.000638976,0.0001178367,0.00012574697,0.00034329935,0.098481596,0.0042972476,0.40620497,0.12249854,0.3648101],"study_design_scores_gemma":[0.0003895529,0.000110690926,0.00030205687,0.00007617687,0.00005819039,0.00015556111,0.00012763932,0.41598132,0.0026151962,0.55019903,0.02993964,0.000044845798],"about_ca_topic_score_codex":0.004990664,"about_ca_topic_score_gemma":0.005208278,"teacher_disagreement_score":0.023763198,"about_ca_system_score_codex":0.0031208596,"about_ca_system_score_gemma":0.0030651807,"threshold_uncertainty_score":0.07949585},"labels":[],"label_agreement":null},{"id":"W1752871820","doi":"10.1007/978-3-540-74742-0_51","title":"On Formal MOM Modeling","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Windsor","funders":"","keywords":"Computer science; Promela; Correctness; Model checking; Concurrency; Formal verification; Nondeterministic algorithm; Message passing; Distributed computing; Formal methods; Programming language; Theoretical computer science","score_opus":0.053126787908159646,"score_gpt":0.30598788496607143,"score_spread":0.25286109705791177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752871820","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.0018456996,0.0014062428,0.9014352,0.0006882079,0.00041276705,0.000043606182,0.000109558,0.000888844,0.093169846],"genre_scores_gemma":[0.29474297,0.0074359872,0.46995977,0.0012027083,0.0007553437,0.00043542992,0.0011997493,0.0018716904,0.22239643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994723,0.00013166574,0.000023776292,0.000078151366,0.0002397346,0.000054300468],"domain_scores_gemma":[0.9996923,0.00010576571,0.000016914315,0.00010926844,0.000060008275,0.000015682886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061235554,0.0011098032,0.00065154204,0.00092893257,0.00090866286,0.0019301055,0.0014417775,0.0009518611,0.017271437],"category_scores_gemma":[0.0014064761,0.0005377231,0.0009738211,0.0007921423,0.00153453,0.0034442537,0.0021019792,0.0017380442,0.004801588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012606843,0.00001903967,0.000060217684,0.0000889337,0.000008345999,0.00005371965,0.00013606057,0.0059727337,0.0015312255,0.9406917,0.005298553,0.046126775],"study_design_scores_gemma":[0.000007623741,0.000024965788,0.0000657899,0.00011078498,0.000016459211,0.00018875663,0.00011128276,0.04732152,0.003220961,0.7840601,0.16485816,0.00001367441],"about_ca_topic_score_codex":0.0011144159,"about_ca_topic_score_gemma":0.0010608208,"teacher_disagreement_score":0.017271437,"about_ca_system_score_codex":0.000805042,"about_ca_system_score_gemma":0.00055512926,"threshold_uncertainty_score":0.057778716},"labels":[],"label_agreement":null},{"id":"W1752875563","doi":"10.1007/978-3-540-71703-4_3","title":"Improving Quality and Convergence of Genetic Query Optimizers","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"IBM (Canada)","funders":"","keywords":"Computer science; Heuristics; Convergence (economics); Query optimization; Genetic algorithm; Mathematical optimization; Quality (philosophy); Join (topology); Population; Genetic programming; Selection (genetic algorithm); Data mining; Machine learning; Mathematics","score_opus":0.033527309144610655,"score_gpt":0.27695763267335344,"score_spread":0.24343032352874278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752875563","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.25923944,0.0019446133,0.72739923,0.00088515674,0.0002293282,0.00015574957,0.0001272467,0.0021889703,0.00783027],"genre_scores_gemma":[0.72305673,0.0004296716,0.27232096,0.0002832951,0.00015583787,0.00011931231,0.00029743087,0.0006930485,0.002643729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9943868,0.0020407895,0.00026667715,0.0005473014,0.002203565,0.0005549],"domain_scores_gemma":[0.9776513,0.015384367,0.0010057314,0.001842267,0.003707162,0.00040910073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008733372,0.0012520427,0.001687782,0.00199504,0.00084592303,0.0020093254,0.002671236,0.0026994555,0.002193641],"category_scores_gemma":[0.048730895,0.00081469695,0.00088782224,0.0017097952,0.0016325503,0.00257473,0.0017665261,0.0022757407,0.0006130855],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010353691,0.00026769625,0.0052001164,0.00012066799,0.0001318059,0.00009415637,0.0002903018,0.820679,0.008201633,0.013301808,0.003532471,0.14714491],"study_design_scores_gemma":[0.00007468724,0.00009288181,0.0005107967,0.000013080753,0.000029113173,0.000040527404,0.00004277796,0.99194825,0.0028954006,0.0040320884,0.00031166704,0.000008838631],"about_ca_topic_score_codex":0.006186326,"about_ca_topic_score_gemma":0.0036819268,"teacher_disagreement_score":0.008733372,"about_ca_system_score_codex":0.0019759396,"about_ca_system_score_gemma":0.0018592364,"threshold_uncertainty_score":0.046187043},"labels":[],"label_agreement":null},{"id":"W1752910098","doi":"10.1007/3-540-45415-2_8","title":"i-Cube: A Tool-Set for the Dynamic Extraction and Integration of Web Data Content","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; XML; Scripting language; Information retrieval; Dynamic web page; HTML element; World Wide Web; Web service; XML validation; Tree (set theory); Set (abstract data type); Document Structure Description; Document Object Model; Web page; The Internet; Well-formed document; Document type definition; Database; Programming language","score_opus":0.06870515490833315,"score_gpt":0.30172189553848433,"score_spread":0.23301674063015118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752910098","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.0039551733,0.0006323741,0.8248969,0.00034551288,0.00011919363,0.00037659757,0.016349413,0.14926551,0.004059384],"genre_scores_gemma":[0.027886894,0.0014075362,0.9066789,0.00029877896,0.00009230478,0.00084707426,0.040710423,0.017620169,0.004457878],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998055,0.0001998034,0.0003074404,0.00031880965,0.0010205145,0.000098474455],"domain_scores_gemma":[0.9955922,0.002198032,0.0002979611,0.001057519,0.0006276279,0.00022665651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023831532,0.002905063,0.002220071,0.008585737,0.0011612556,0.0053844447,0.002991725,0.0011513261,0.010439844],"category_scores_gemma":[0.009524118,0.0016035723,0.0028510345,0.0096995,0.00096137135,0.0057533197,0.0052376688,0.0022638955,0.007831165],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040105815,0.00022315115,0.0050473474,0.0022052687,0.00043273153,0.0010309723,0.0013475281,0.0093343705,0.015914379,0.021499764,0.15254751,0.79001594],"study_design_scores_gemma":[0.00032940618,0.0002566611,0.005967507,0.0010281656,0.00077126495,0.0028575086,0.0013738971,0.29374704,0.13024865,0.12331046,0.43956995,0.0005395027],"about_ca_topic_score_codex":0.00526647,"about_ca_topic_score_gemma":0.0059084045,"teacher_disagreement_score":0.010439844,"about_ca_system_score_codex":0.0008709793,"about_ca_system_score_gemma":0.0023356348,"threshold_uncertainty_score":0.034924746},"labels":[],"label_agreement":null},{"id":"W17529471","doi":"10.1007/978-3-642-38911-5_8","title":"Modeling Component Erroneous Behavior and Error Propagation for Dependability Analysis","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis 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":"Dependability; Computer science; Component (thermodynamics); Unified Modeling Language; Protocol (science); Maintainability; Software; Propagation of uncertainty; Aspect-oriented programming; Distributed computing; Programming language; Algorithm; Software engineering","score_opus":0.03251929677582509,"score_gpt":0.29283129821347936,"score_spread":0.26031200143765426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17529471","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.01436642,0.0004337923,0.9813619,0.00008179044,0.000044801993,0.000028452037,0.00007375225,0.00067176047,0.0029373602],"genre_scores_gemma":[0.6380267,0.0018527596,0.34506705,0.0000890379,0.00009030265,0.00011809392,0.0003377265,0.00061756175,0.013800797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994992,0.00011109786,0.00003143336,0.00008481239,0.00022403916,0.000049397695],"domain_scores_gemma":[0.9983485,0.0008450627,0.0001873155,0.0003025722,0.00029114183,0.000025519974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441395,0.0017019397,0.0008034391,0.0011820276,0.00036556667,0.00090952864,0.0018468659,0.0013054768,0.0025303168],"category_scores_gemma":[0.0039479034,0.00076018146,0.0010487505,0.0009418834,0.00053953467,0.0019559276,0.0007841678,0.0014313693,0.0007420764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033822093,0.00005979734,0.0008615093,0.00012362597,0.000034820325,0.0001495616,0.00011293057,0.9147918,0.0053791446,0.033537004,0.0009629179,0.043952983],"study_design_scores_gemma":[0.00000167732,0.000009632098,0.00008483951,0.000007919582,0.00001604524,0.00003266403,0.00000552044,0.98664504,0.0012514954,0.011242163,0.0006988851,0.0000042485904],"about_ca_topic_score_codex":0.0051433137,"about_ca_topic_score_gemma":0.0073460382,"teacher_disagreement_score":0.0051433137,"about_ca_system_score_codex":0.000683589,"about_ca_system_score_gemma":0.00074598845,"threshold_uncertainty_score":0.0102267265},"labels":[],"label_agreement":null},{"id":"W1753157579","doi":"10.1007/11428831_20","title":"Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"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":"Oak Ridge National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; UT-Battelle; Battelle; National Science Foundation","keywords":"Tensor contraction; Contraction (grammar); Cartesian tensor; Minification; Tensor (intrinsic definition); Associative property; Commutative property; Computer science; Mathematics; Algebra over a field; Mathematical optimization; Tensor product; Pure mathematics; Mathematical analysis; Tensor field; Tensor density; Exact solutions in general relativity","score_opus":0.010898472698423192,"score_gpt":0.2652719437438985,"score_spread":0.2543734710454753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1753157579","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.02068732,0.0003071904,0.9666417,0.00020161108,0.00012307911,0.00008349772,0.00012901066,0.001130555,0.010695998],"genre_scores_gemma":[0.15054476,0.00033068247,0.8393167,0.00008918474,0.00007863742,0.00021174437,0.00040665639,0.001181787,0.007839901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991536,0.00031546393,0.000044593628,0.00006620699,0.00035236505,0.000067860994],"domain_scores_gemma":[0.99860674,0.0006728937,0.000076004835,0.00029281483,0.00031417713,0.0000374174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179299,0.0009174061,0.0012414231,0.0008231527,0.0010566878,0.0012684248,0.0018687653,0.00070464873,0.007493893],"category_scores_gemma":[0.003772862,0.00057008094,0.0008256198,0.0014492915,0.0010239991,0.0018058118,0.0014651513,0.001674586,0.0023491648],"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.00026335425,0.00019006268,0.00041594525,0.0004093475,0.000060365255,0.00014777244,0.00032634253,0.13686086,0.013533281,0.36024335,0.01624712,0.4713022],"study_design_scores_gemma":[0.000037127324,0.000060597507,0.00016257676,0.000032044478,0.000017452781,0.00005779289,0.000065028,0.78260034,0.009143356,0.19929557,0.008508188,0.000019824063],"about_ca_topic_score_codex":0.0016110314,"about_ca_topic_score_gemma":0.0033274072,"teacher_disagreement_score":0.007493893,"about_ca_system_score_codex":0.0006362349,"about_ca_system_score_gemma":0.0012028917,"threshold_uncertainty_score":0.025069535},"labels":[],"label_agreement":null},{"id":"W1753299563","doi":"10.1007/978-3-642-17274-8_23","title":"Learning and Prediction of Soft Object Deformation Using Visual Analysis of Robot Interactions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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 Ottawa","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Object (grammar); Artificial neural network; Robot; Deformation (meteorology); Pattern recognition (psychology); Physics","score_opus":0.017250190474326167,"score_gpt":0.26286466739847475,"score_spread":0.2456144769241486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1753299563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11993313,0.00047696364,0.8765318,0.00012197158,0.000060113376,0.000043422464,0.00014021731,0.0015509587,0.0011414327],"genre_scores_gemma":[0.87851447,0.0004679334,0.11714697,0.00007275656,0.00005081862,0.000047632075,0.00031091727,0.00015124673,0.0032372333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983776,0.000016729819,0.000007010648,0.000061661915,0.000049777485,0.000026948708],"domain_scores_gemma":[0.99960655,0.0001741774,0.000068138695,0.000051841485,0.00006343017,0.000035872035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003268297,0.0007478858,0.0008495516,0.0009420607,0.00017496891,0.0006471854,0.0006634406,0.00086219364,0.0012193896],"category_scores_gemma":[0.0009318295,0.00050995353,0.0006712164,0.00066508155,0.00048616668,0.00067350565,0.0005478426,0.00073280325,0.0005750495],"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.0003707505,0.00019433895,0.0036872968,0.00010689921,0.00007452342,0.00015638584,0.00007191282,0.33236596,0.079053834,0.001240359,0.0019482374,0.5807296],"study_design_scores_gemma":[0.0000027718568,0.000024271201,0.0013684371,0.0000033049607,0.0000043102054,0.000029681312,0.0000063697676,0.99405515,0.0035496997,0.00085302535,0.00009795231,0.000004968113],"about_ca_topic_score_codex":0.0035261014,"about_ca_topic_score_gemma":0.0053859134,"teacher_disagreement_score":0.0035261014,"about_ca_system_score_codex":0.00036664374,"about_ca_system_score_gemma":0.0004177622,"threshold_uncertainty_score":0.0070111156},"labels":[],"label_agreement":null},{"id":"W1753304585","doi":"10.1007/978-3-540-76931-6_11","title":"How Different Hierarchical Relationships Impact Evolution","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","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":"Concordia University","funders":"","keywords":"Crossover; Selection (genetic algorithm); Panmixia; Population; Context (archaeology); Set (abstract data type); Convergence (economics); Computer science; Evolutionary biology; Biology; Artificial intelligence; Economics; Genetic structure; Genetic variation; Sociology; Demography","score_opus":0.03989774079800538,"score_gpt":0.30051077150570915,"score_spread":0.26061303070770375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1753304585","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.8485108,0.00090732326,0.019749241,0.0038854077,0.00013758824,0.000033826596,0.000562865,0.00015271458,0.12606032],"genre_scores_gemma":[0.99214023,0.00027410095,0.002251679,0.0002182676,0.000016140624,0.000012609339,0.00013076805,0.00006831565,0.004888004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927205,0.00037479182,0.000018443116,0.00010575018,0.00011912375,0.00010988322],"domain_scores_gemma":[0.9946912,0.0038788072,0.0002598428,0.00035434496,0.00037333494,0.0004425339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012783392,0.00019738893,0.00028076212,0.00066589366,0.0006736013,0.0031268871,0.000521306,0.00097287947,0.023913559],"category_scores_gemma":[0.015262311,0.0002606234,0.00039082288,0.0007702399,0.001287872,0.003356738,0.00076644286,0.0011684006,0.0014792532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000489425,0.00027482962,0.05831583,0.0003496252,0.0005707945,0.00045360383,0.002840808,0.0656195,0.013722708,0.70590854,0.015394894,0.13605954],"study_design_scores_gemma":[0.00013728812,0.00016221202,0.0590779,0.000077815705,0.00045762054,0.00024544867,0.0027110146,0.07276008,0.0029163251,0.8498594,0.011520526,0.00007429186],"about_ca_topic_score_codex":0.0022082985,"about_ca_topic_score_gemma":0.0037587069,"teacher_disagreement_score":0.023913559,"about_ca_system_score_codex":0.0008673721,"about_ca_system_score_gemma":0.00042686128,"threshold_uncertainty_score":0.07999885},"labels":[],"label_agreement":null},{"id":"W1753570524","doi":"10.1007/3-540-47979-1_18","title":"Active Surface Reconstruction Using the Gradient Strategy","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Computer vision; Estimator; Computer science; Kalman filter; Image (mathematics); Convergence (economics); Artificial intelligence; Frame (networking); Scheme (mathematics); Rate of convergence; Frame rate; Motion (physics); Motion estimation; Algorithm; Mathematics; Key (lock)","score_opus":0.03475758203279017,"score_gpt":0.27569823780119895,"score_spread":0.24094065576840878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1753570524","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.001691348,0.00008525391,0.99636406,0.00004706476,0.000018079323,0.000008912794,0.00001430514,0.00021411013,0.0015568535],"genre_scores_gemma":[0.07906817,0.00033452333,0.910315,0.000080155005,0.000036600468,0.00005410442,0.00014425149,0.00029104747,0.009676211],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998405,0.000027712316,0.000006084483,0.000027073589,0.00008734296,0.000011236377],"domain_scores_gemma":[0.9998822,0.00004634322,0.000008192516,0.000022864955,0.000031488464,0.000008879672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027340007,0.0005629387,0.0007508715,0.0005834303,0.0001719574,0.0009422299,0.00084626646,0.00089029205,0.0031096912],"category_scores_gemma":[0.0004948883,0.00052347797,0.000608131,0.0004929728,0.00045658633,0.0010971115,0.00088999054,0.0010594154,0.001865845],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015837252,0.00007015109,0.00027828556,0.00022353666,0.00008289873,0.00014646002,0.00015059614,0.09883124,0.12177703,0.17002162,0.0074892975,0.60077053],"study_design_scores_gemma":[0.00002244986,0.000043805132,0.00014618153,0.000018111024,0.000016371592,0.0002687249,0.00001784155,0.9264382,0.024354883,0.038006704,0.010641629,0.000025066876],"about_ca_topic_score_codex":0.0005879163,"about_ca_topic_score_gemma":0.0007454189,"teacher_disagreement_score":0.0031096912,"about_ca_system_score_codex":0.00019543976,"about_ca_system_score_gemma":0.00031309304,"threshold_uncertainty_score":0.0104029775},"labels":[],"label_agreement":null},{"id":"W1753758320","doi":"10.1007/978-3-642-20039-7_44","title":"A New Frontier in Novelty Detection: Pattern Recognition of Stochastically Episodic Events","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Carleton University","funders":"","keywords":"Computer science; Novelty; Novelty detection; Frontier; Pattern recognition (psychology); Artificial intelligence","score_opus":0.022533240776718984,"score_gpt":0.23810055349162254,"score_spread":0.21556731271490356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1753758320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068528834,0.005822618,0.98496544,0.0005667657,0.00022056715,0.00001712604,0.00012441466,0.00030488646,0.0011252309],"genre_scores_gemma":[0.32640985,0.014392668,0.6464239,0.000590406,0.0022043185,0.00013038357,0.0010026086,0.00035481906,0.008491037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991371,0.00015486627,0.000071225004,0.0003375401,0.00025313903,0.000046196117],"domain_scores_gemma":[0.9977933,0.0013601384,0.0001933164,0.00030340286,0.0002606425,0.00008930113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246061,0.0009475897,0.0019473638,0.0012678818,0.0003426405,0.0027849518,0.0023889258,0.0015233343,0.0020959927],"category_scores_gemma":[0.005087364,0.000541984,0.0010499096,0.0028110943,0.0014215554,0.004196559,0.0014340011,0.0020066346,0.00089434464],"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.00020531424,0.000115329116,0.004373999,0.00092276454,0.00027492558,0.00021241141,0.0002806412,0.036373597,0.022288332,0.09405043,0.009865649,0.8310365],"study_design_scores_gemma":[0.000023437775,0.00019573743,0.0031812345,0.00012390758,0.0000941438,0.0006796485,0.00011763206,0.6787615,0.0075827423,0.2945319,0.014618043,0.0000899911],"about_ca_topic_score_codex":0.0005775952,"about_ca_topic_score_gemma":0.00049972674,"teacher_disagreement_score":0.0027849518,"about_ca_system_score_codex":0.00039941524,"about_ca_system_score_gemma":0.0004101064,"threshold_uncertainty_score":0.007011831},"labels":[],"label_agreement":null},{"id":"W1754079618","doi":"10.1007/978-3-642-33503-7_2","title":"A Self-localization System with Global Error Reduction and Online Map-Building Capabilities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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 Windsor","funders":"","keywords":"Computer science; Landmark; Computer vision; Artificial intelligence; Path (computing); Metric (unit); Shortest path problem; Graph; Node (physics); Process (computing); Monocular; Topology (electrical circuits); Algorithm; Theoretical computer science; Mathematics","score_opus":0.00938117025147826,"score_gpt":0.21073565781950915,"score_spread":0.2013544875680309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754079618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021211287,0.0001765083,0.95665103,0.00011165667,0.00013072562,0.000089699664,0.00020222519,0.015275615,0.0061512897],"genre_scores_gemma":[0.35388955,0.00022918465,0.61657345,0.00029278532,0.00011104048,0.00030879953,0.00094440713,0.0006909404,0.026959898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979216,0.000020230153,0.000014503107,0.000058834856,0.000093488256,0.00002086417],"domain_scores_gemma":[0.99972576,0.000041768224,0.000017479717,0.00008418966,0.00010049409,0.000030223277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023167691,0.0005210802,0.00068536494,0.00044220014,0.00046101265,0.0006542063,0.0015372772,0.0008756913,0.0064368397],"category_scores_gemma":[0.0003689697,0.00044996096,0.00031132085,0.00040454685,0.00026483156,0.001138097,0.0014518953,0.00053678395,0.0038078588],"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.0005405356,0.00034860015,0.0012550857,0.00033487755,0.00009733483,0.0003656298,0.0003702268,0.029244663,0.32524547,0.011101325,0.023071127,0.60802525],"study_design_scores_gemma":[0.00021193227,0.0009282294,0.0035878904,0.000047179026,0.000176803,0.0013825739,0.00008854204,0.6518087,0.25137383,0.0081455875,0.082109876,0.00013895638],"about_ca_topic_score_codex":0.00096098665,"about_ca_topic_score_gemma":0.0010752667,"teacher_disagreement_score":0.0064368397,"about_ca_system_score_codex":0.00016457918,"about_ca_system_score_gemma":0.0003839471,"threshold_uncertainty_score":0.02153343},"labels":[],"label_agreement":null},{"id":"W1754212509","doi":"10.1007/978-3-642-41533-3_12","title":"Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Metamodeling; Computer science; Rotation formalisms in three dimensions; Set (abstract data type); Programming language; Domain (mathematical analysis); Theoretical computer science; Artificial intelligence; Software engineering; Mathematics","score_opus":0.03098259292486101,"score_gpt":0.2755012836934368,"score_spread":0.2445186907685758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754212509","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.22410385,0.00055559824,0.7529223,0.00062341115,0.000120142795,0.00045982236,0.0017626137,0.011593988,0.007858258],"genre_scores_gemma":[0.39052862,0.0002469341,0.6007766,0.00021735838,0.00003762088,0.00018581562,0.0043070694,0.0016692654,0.0020307335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946032,0.0012622843,0.0006983053,0.0010802313,0.0019944604,0.0003613656],"domain_scores_gemma":[0.95816904,0.031624053,0.0024235453,0.0030541152,0.00428375,0.0004454618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038548342,0.001324367,0.0015506609,0.0043059825,0.0010160112,0.0028496303,0.0024462314,0.0022040547,0.0058602747],"category_scores_gemma":[0.0364624,0.001456425,0.0021237857,0.0020127315,0.0012282939,0.005953462,0.0025646798,0.0017855257,0.0019860277],"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.0014380825,0.000929684,0.047775026,0.0035579,0.00060640386,0.0054998472,0.0038316073,0.04771731,0.07097129,0.089895286,0.017700665,0.7100769],"study_design_scores_gemma":[0.00020081359,0.00031125522,0.005636185,0.00085783674,0.00063242397,0.0040803086,0.0024623314,0.6868978,0.1435191,0.12304557,0.03215407,0.0002023577],"about_ca_topic_score_codex":0.0015837785,"about_ca_topic_score_gemma":0.0041351304,"teacher_disagreement_score":0.0058602747,"about_ca_system_score_codex":0.00073711417,"about_ca_system_score_gemma":0.0017458043,"threshold_uncertainty_score":0.020386577},"labels":[],"label_agreement":null},{"id":"W1754330380","doi":"10.1007/3-540-45813-1_68","title":"VPRSM Approach to WEB Searching","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; World Wide Web","score_opus":0.03324505979192183,"score_gpt":0.24471365575871107,"score_spread":0.21146859596678924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754330380","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.00712281,0.0010736147,0.9614158,0.0005972413,0.0001258997,0.00010624023,0.00023152855,0.0009903845,0.028336465],"genre_scores_gemma":[0.22900087,0.0013118373,0.72638917,0.00031072754,0.0002921881,0.0002333825,0.0006579181,0.0003880766,0.041415844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703896,0.0010808122,0.00016897495,0.00042714822,0.0010881503,0.00019594951],"domain_scores_gemma":[0.9983941,0.00069336116,0.000076825236,0.000489734,0.00028462269,0.000061444174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014788377,0.00043379955,0.0014224856,0.0031385948,0.0011340097,0.0035464596,0.003969522,0.0018769688,0.012791108],"category_scores_gemma":[0.006087768,0.0006006265,0.001736692,0.00392531,0.0014768041,0.0057284376,0.0025647958,0.0015911334,0.0030188593],"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.00006356046,0.000111148336,0.00041285218,0.0002606205,0.00006656209,0.00019200223,0.00035562328,0.025093537,0.0013202308,0.73321515,0.008475411,0.23043324],"study_design_scores_gemma":[0.000020357284,0.00006038191,0.00025767038,0.00007682714,0.00004938795,0.00044197313,0.00018797512,0.34386474,0.0017472676,0.6185193,0.034747846,0.000026311418],"about_ca_topic_score_codex":0.0038553213,"about_ca_topic_score_gemma":0.003230434,"teacher_disagreement_score":0.012791108,"about_ca_system_score_codex":0.0016408422,"about_ca_system_score_gemma":0.0012617734,"threshold_uncertainty_score":0.042790473},"labels":[],"label_agreement":null},{"id":"W1754407053","doi":"10.1007/978-3-540-24608-4_9","title":"Commitment and Argument Network: A New Formalism for Agent Communication","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre de Géomatique du Québec; Université Laval","funders":"","keywords":"Formalism (music); Argument (complex analysis); Epistemology; Computer science; Cognitive science; Psychology; Philosophy; Art; Literature; Medicine","score_opus":0.031048299904807453,"score_gpt":0.2624414691049102,"score_spread":0.23139316920010272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754407053","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.0013226467,0.00033722006,0.97490114,0.0007996993,0.00021798388,0.000066721805,0.00017890656,0.0003641329,0.021811636],"genre_scores_gemma":[0.15179342,0.0012454322,0.8023551,0.0005423512,0.00049896614,0.00095868314,0.000772419,0.0007192116,0.04111431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767977,0.0011031912,0.00019925342,0.00033323705,0.0005632502,0.000121382334],"domain_scores_gemma":[0.9971245,0.0015989784,0.0001817084,0.0006297162,0.0003148368,0.00015016577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003252411,0.001331873,0.0011747014,0.0019373816,0.00225569,0.0060169986,0.003920778,0.0030358934,0.013825993],"category_scores_gemma":[0.0071899677,0.0010547433,0.0014986491,0.0029369968,0.0043179053,0.016156329,0.0039303526,0.0058044526,0.0033737042],"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.0000108372005,0.000009006651,0.000025065092,0.000040081413,0.000005397133,0.000031356118,0.00021568518,0.0019441032,0.00020635067,0.98722094,0.001759992,0.008531112],"study_design_scores_gemma":[0.000012193445,0.000008299925,0.00002675365,0.000032382537,0.000017793074,0.000077105164,0.000066287444,0.030457558,0.00044322218,0.9337943,0.03504896,0.000015019394],"about_ca_topic_score_codex":0.0016606711,"about_ca_topic_score_gemma":0.0016918796,"teacher_disagreement_score":0.013825993,"about_ca_system_score_codex":0.0017784474,"about_ca_system_score_gemma":0.0013777529,"threshold_uncertainty_score":0.04625255},"labels":[],"label_agreement":null},{"id":"W1754491295","doi":"10.1007/978-3-662-45803-7_26","title":"Trade-Offs in Planar Polyline Drawings","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Combinatorics; Planar; Triangulation; Planar graph; Angular resolution (graph drawing); Mathematics; Graph; Degree (music); Resolution (logic); Geometry; Algorithm; Computer science; Physics; Artificial intelligence; Computer graphics (images)","score_opus":0.013701680449774139,"score_gpt":0.23683908148306182,"score_spread":0.2231374010332877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754491295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21696022,0.010149424,0.61065525,0.002854576,0.0003988847,0.00019428153,0.0007380547,0.00142752,0.15662168],"genre_scores_gemma":[0.8223919,0.0041502584,0.12728807,0.0002458111,0.00021365423,0.00019957162,0.0005630443,0.0012483378,0.04369935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789315,0.00082165614,0.000096968,0.0002370467,0.00070778246,0.00024337541],"domain_scores_gemma":[0.98758173,0.009480285,0.0007122892,0.0011060836,0.00062864757,0.0004909347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026144052,0.0012316639,0.0014812166,0.0017660267,0.0012081618,0.0039525507,0.0024589216,0.002881466,0.026529072],"category_scores_gemma":[0.022182155,0.0014601133,0.00077483885,0.0032282637,0.0017930834,0.007532929,0.0026925348,0.0025190543,0.0026239569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050138356,0.0001510273,0.0011289072,0.00039053673,0.00004767733,0.00019591188,0.00028423552,0.25306392,0.0025695025,0.56318396,0.014360304,0.16412266],"study_design_scores_gemma":[0.000041468596,0.00011276881,0.0004117091,0.00011186638,0.000038168717,0.000256341,0.00014630532,0.42477658,0.0011125548,0.5645267,0.008433032,0.000032523785],"about_ca_topic_score_codex":0.0008158941,"about_ca_topic_score_gemma":0.0013513286,"teacher_disagreement_score":0.026529072,"about_ca_system_score_codex":0.001834878,"about_ca_system_score_gemma":0.00055587396,"threshold_uncertainty_score":0.088748574},"labels":[],"label_agreement":null},{"id":"W175467639","doi":"10.1007/978-3-642-33418-4_5","title":"LBM-EP: Lattice-Boltzmann Method for Fast Cardiac Electrophysiology Simulation from 3D Images","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Lattice Boltzmann Simulation Studies","field":"Engineering","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":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"Universitat Pompeu Fabra","keywords":"Cardiac electrophysiology; Computer science; Lattice Boltzmann methods; Discretization; Grid; Set (abstract data type); Algorithm; Electrophysiology; Artificial intelligence; Mathematics; Physics; Geometry; Medicine","score_opus":0.016309912428513762,"score_gpt":0.2955100389678893,"score_spread":0.27920012653937554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175467639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011929547,0.00025416192,0.96953213,0.00037142076,0.00023165708,0.0001438286,0.0010134802,0.00966591,0.006857838],"genre_scores_gemma":[0.1906269,0.0003384624,0.79277116,0.00053535646,0.00011127073,0.000947409,0.0018299321,0.0047472427,0.008092332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997613,0.000051586623,0.00001074167,0.000020850595,0.00012504583,0.000030548592],"domain_scores_gemma":[0.99947184,0.00022883326,0.000029203798,0.000058983842,0.00013799485,0.00007320943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017311,0.0008576489,0.0011042004,0.0005774785,0.00071905216,0.0011713068,0.003104774,0.0021550632,0.014261407],"category_scores_gemma":[0.0022047467,0.0007439786,0.00070738647,0.00067942316,0.00048016882,0.00096831546,0.0014593774,0.0022229638,0.0034531183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003527762,0.00023293299,0.0011600752,0.0004816313,0.0001594273,0.00058919715,0.00027524985,0.8014026,0.01550552,0.038517173,0.030936107,0.1103873],"study_design_scores_gemma":[0.00003610139,0.000006920595,0.00004616989,0.000007312505,0.0000034576567,0.000024047265,0.000004823026,0.9942245,0.0012724032,0.002395595,0.0019698085,0.000008824781],"about_ca_topic_score_codex":0.006398153,"about_ca_topic_score_gemma":0.0060710763,"teacher_disagreement_score":0.014261407,"about_ca_system_score_codex":0.00059810415,"about_ca_system_score_gemma":0.0013894949,"threshold_uncertainty_score":0.047709107},"labels":[],"label_agreement":null},{"id":"W175486766","doi":"10.1007/978-3-642-33415-3_60","title":"Towards Computer-Assisted Deep Brain Stimulation Targeting with Multiple Active Contacts","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Deep brain stimulation; Computer science; Flexibility (engineering); Neuroscience; Subthalamic nucleus; Artificial intelligence; Medicine; Parkinson's disease; Psychology","score_opus":0.020003752885367453,"score_gpt":0.2779229850815826,"score_spread":0.25791923219621515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175486766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048644585,0.0001443555,0.99242204,0.00009214782,0.00002477756,0.000019470586,0.000013364554,0.00018431224,0.0022350617],"genre_scores_gemma":[0.40597287,0.0005037079,0.58317727,0.00032363695,0.000063040374,0.0001526748,0.000104033184,0.00009405645,0.0096086785],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997507,0.000065647764,0.00001131209,0.000038141658,0.000116236166,0.000018036373],"domain_scores_gemma":[0.9996995,0.00015833303,0.000023519095,0.000040620496,0.000058382222,0.000019731257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033523634,0.00049142126,0.00042918496,0.00018820523,0.0001952062,0.00074365997,0.00071562274,0.0009861046,0.0022165596],"category_scores_gemma":[0.00083689735,0.00027011245,0.00038158428,0.00027333622,0.0004014087,0.00078457466,0.0011151397,0.0007272814,0.00094371586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038584933,0.00018270976,0.00064122205,0.00035029225,0.00011371022,0.00023773538,0.00023330355,0.17099711,0.29234865,0.037080023,0.0044186786,0.49301073],"study_design_scores_gemma":[0.000027269469,0.00022662607,0.0004019053,0.000019858686,0.000017276923,0.00040884217,0.000027410786,0.9399346,0.036998067,0.015787741,0.006131291,0.000019094177],"about_ca_topic_score_codex":0.00051649846,"about_ca_topic_score_gemma":0.0009314846,"teacher_disagreement_score":0.0022165596,"about_ca_system_score_codex":0.00023112424,"about_ca_system_score_gemma":0.00030803133,"threshold_uncertainty_score":0.007415116},"labels":[],"label_agreement":null},{"id":"W1755042603","doi":"10.1007/3-540-46088-8_15","title":"Provably Secure Implicit Certificate Schemes","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Certificate; Public key certificate; Digital signature; Certificate authority; Computer security; Theoretical computer science; Public-key cryptography; Encryption","score_opus":0.03565530077184503,"score_gpt":0.24877883958655686,"score_spread":0.21312353881471183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1755042603","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.054587524,0.0018979189,0.73195493,0.004256571,0.001079202,0.00034710087,0.0010508884,0.0034562966,0.20136954],"genre_scores_gemma":[0.75891536,0.0019140479,0.09594471,0.0006641745,0.00062801543,0.0004109484,0.0012604798,0.0007529716,0.13950922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965215,0.00064400653,0.00021402372,0.00041508893,0.0017527338,0.00045263514],"domain_scores_gemma":[0.9942303,0.0020694875,0.0003370853,0.002580832,0.00056975667,0.00021265837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023431603,0.0010271139,0.0010196834,0.0008023324,0.0022000994,0.004746263,0.0024497223,0.0016565977,0.01678767],"category_scores_gemma":[0.008149825,0.0008939613,0.0007662701,0.0021237936,0.0029718194,0.014105687,0.0061119036,0.0066218134,0.006014775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025501623,0.00009727082,0.00012651927,0.00020631586,0.0000137645675,0.000054120526,0.00029589114,0.003120385,0.0024455795,0.93800575,0.006616053,0.048763286],"study_design_scores_gemma":[0.00014976725,0.0000794117,0.00013600785,0.000093532566,0.00004434654,0.00022489118,0.00006210383,0.0124636665,0.008826848,0.9192579,0.058622926,0.00003861664],"about_ca_topic_score_codex":0.00029738658,"about_ca_topic_score_gemma":0.00032786833,"teacher_disagreement_score":0.01678767,"about_ca_system_score_codex":0.0019915332,"about_ca_system_score_gemma":0.0020087548,"threshold_uncertainty_score":0.05616039},"labels":[],"label_agreement":null},{"id":"W1755220452","doi":"10.1007/3-540-44886-1_21","title":"Post-supervised Template Induction for Dynamic Web Sources","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Row; Exploit; Data mining; Dynamic programming; Machine learning; Information extraction; Artificial intelligence; Supervised learning; Dynamic web page; Unsupervised learning; Pattern recognition (psychology); Web page; Information retrieval; Database; Algorithm; World Wide Web; Artificial neural network","score_opus":0.016692376007182975,"score_gpt":0.24295445410656108,"score_spread":0.2262620780993781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1755220452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010100861,0.00035272466,0.9718811,0.00021104013,0.00007923044,0.00014209104,0.0016019,0.014061951,0.0015690719],"genre_scores_gemma":[0.16723523,0.00052052696,0.7983577,0.0001694138,0.00021858136,0.00032430945,0.01834847,0.003077768,0.011748052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976024,0.000502591,0.0002064824,0.0006960691,0.0007864512,0.00020607753],"domain_scores_gemma":[0.99100983,0.0048501855,0.0004381368,0.0022005453,0.0012894663,0.00021181557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026995237,0.001182807,0.001279472,0.004068785,0.0012502004,0.0019797687,0.0044627055,0.0017440352,0.007129025],"category_scores_gemma":[0.009724994,0.001072807,0.0018540501,0.003686695,0.0008671523,0.0052485894,0.0026622897,0.0024720964,0.006620565],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003627201,0.00031346024,0.0033357218,0.00035712114,0.00013783421,0.00054719317,0.00020956603,0.030193804,0.014592368,0.013246839,0.03117335,0.9055301],"study_design_scores_gemma":[0.00004721978,0.00006820392,0.0010026813,0.00005520678,0.000101764745,0.00044629787,0.000100352554,0.9038155,0.034283604,0.04676522,0.0132761,0.000037768652],"about_ca_topic_score_codex":0.0031808184,"about_ca_topic_score_gemma":0.008164774,"teacher_disagreement_score":0.007129025,"about_ca_system_score_codex":0.0009256279,"about_ca_system_score_gemma":0.0021620307,"threshold_uncertainty_score":0.02384895},"labels":[],"label_agreement":null},{"id":"W1755459541","doi":"10.1007/3-540-47922-8_38","title":"A Learning Algorithm for Buying and Selling Agents in Electronic Marketplaces","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Order (exchange); Electronic markets; Subject (documents); Intelligent agent; Artificial intelligence; World Wide Web; Business; The Internet","score_opus":0.05567478249732086,"score_gpt":0.3322672259117099,"score_spread":0.27659244341438904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1755459541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032747027,0.00018612354,0.9636195,0.00036597456,0.00006731106,0.00013996345,0.00006774402,0.00072798424,0.0020783967],"genre_scores_gemma":[0.4050547,0.0002288124,0.58605987,0.00023685573,0.0001563063,0.00038371855,0.00031568928,0.00013619204,0.007427881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990694,0.00032076583,0.000088206405,0.00021671134,0.00018593293,0.00011897812],"domain_scores_gemma":[0.9955604,0.0033914316,0.00017662511,0.0002101712,0.0005078819,0.00015353886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028255335,0.00083840115,0.0017679502,0.0009221898,0.0010864172,0.0016463381,0.0036169032,0.0031690323,0.0052630533],"category_scores_gemma":[0.009613179,0.0008958968,0.00078402954,0.0013650684,0.0015594505,0.0048804726,0.002166904,0.0019741405,0.00079866295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044757812,0.0003422668,0.0018202617,0.000119090546,0.00007612511,0.00007411189,0.00014123617,0.6427445,0.0009646477,0.03212307,0.003986571,0.31716058],"study_design_scores_gemma":[0.00004238712,0.000019631527,0.000050487968,0.000003766199,0.000006100123,0.000010341509,0.000007721852,0.98875743,0.00016385863,0.010769591,0.0001652774,0.000003465121],"about_ca_topic_score_codex":0.004020805,"about_ca_topic_score_gemma":0.0031188163,"teacher_disagreement_score":0.0052630533,"about_ca_system_score_codex":0.0014043568,"about_ca_system_score_gemma":0.0014699601,"threshold_uncertainty_score":0.017606676},"labels":[],"label_agreement":null},{"id":"W1755863839","doi":"10.1007/3-540-45105-6_28","title":"Developing an Immunity to Spam","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial immune system; Computer security; Computer virus; Immune system; Artificial intelligence; Immunology; Biology","score_opus":0.03200594326978187,"score_gpt":0.2638408140163573,"score_spread":0.2318348707465754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1755863839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15264982,0.0017076171,0.75054526,0.0074504,0.0008325905,0.00026130612,0.00011521102,0.004478061,0.08195968],"genre_scores_gemma":[0.79208726,0.00083535624,0.16235599,0.0026819406,0.0005901133,0.00020267161,0.00018885091,0.00023009152,0.040827714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991032,0.00019653035,0.0000325623,0.00024555076,0.00023305218,0.00018919654],"domain_scores_gemma":[0.9973558,0.001041548,0.00024171031,0.00078774506,0.00039408804,0.00017901846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011100158,0.0005477781,0.00079796155,0.0009801068,0.0009954438,0.0014999592,0.0010135522,0.0025646312,0.0056273267],"category_scores_gemma":[0.004440375,0.0003807937,0.00060930813,0.00027318305,0.0018500782,0.0029810045,0.0026754641,0.0023792393,0.0021812816],"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.0003446967,0.0007726195,0.0034984567,0.00033312873,0.00013295896,0.0003628895,0.0007169641,0.031920046,0.08381743,0.51291555,0.031734645,0.33345056],"study_design_scores_gemma":[0.00012654977,0.0010208572,0.0018441642,0.00012899209,0.00015615577,0.0012217333,0.00031244667,0.30260545,0.07153998,0.5355911,0.08539816,0.000054391847],"about_ca_topic_score_codex":0.000143195,"about_ca_topic_score_gemma":0.00013898849,"teacher_disagreement_score":0.0056273267,"about_ca_system_score_codex":0.00043421678,"about_ca_system_score_gemma":0.00057440635,"threshold_uncertainty_score":0.018825293},"labels":[],"label_agreement":null},{"id":"W1757017496","doi":"10.1007/978-3-642-01307-2_100","title":"Boosting Biomedical Information Retrieval Performance through Citation Graph: An Empirical Study","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"York University","funders":"","keywords":"Computer science; Information retrieval; PageRank; Linkage (software); Graph; Ranking (information retrieval); Boosting (machine learning); Hyperlink; Divergence-from-randomness model; Data mining; Citation; Artificial intelligence; Theoretical computer science; Web page; Probabilistic logic; World Wide Web","score_opus":0.03868304289903317,"score_gpt":0.29826593550915986,"score_spread":0.2595828926101267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757017496","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.9840757,0.0040824367,0.007701303,0.00046473314,0.0000973509,0.00007873858,0.00036024628,0.0004188378,0.0027207162],"genre_scores_gemma":[0.9928939,0.00067086733,0.004309663,0.000082847415,0.0001772051,0.000018008315,0.00061836507,0.000071201386,0.0011579455],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972429,0.0016356807,0.00011250797,0.00029235997,0.00055389403,0.00016273028],"domain_scores_gemma":[0.9285571,0.061606634,0.0023986883,0.0028981038,0.0034734819,0.001065891],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0076235617,0.00067775697,0.001138802,0.0027307617,0.00062033336,0.0015863917,0.0008613532,0.0013544817,0.0021160024],"category_scores_gemma":[0.05121833,0.00019770481,0.0007758429,0.0031425045,0.00057933445,0.0022718539,0.00054561044,0.0009349073,0.001407142],"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.007546391,0.0063992115,0.34825844,0.0009973617,0.0014100934,0.0002513618,0.0005155701,0.06149741,0.012238019,0.0020419033,0.013115731,0.5457285],"study_design_scores_gemma":[0.0006375945,0.009187053,0.3780763,0.00014254444,0.0033087258,0.001323804,0.0004971372,0.565262,0.019755168,0.013306533,0.008316217,0.00018696734],"about_ca_topic_score_codex":0.0016401901,"about_ca_topic_score_gemma":0.0012690423,"teacher_disagreement_score":0.9972692,"about_ca_system_score_codex":0.0005212176,"about_ca_system_score_gemma":0.00067050033,"threshold_uncertainty_score":0.040317774},"labels":[],"label_agreement":null},{"id":"W1757019592","doi":"10.1007/11823940_5","title":"The Swarming Body: Simulating the Decentralized Defenses of Immunity","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Immune Systems Applications","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Swarming (honey bee); Immune system; Swarm behaviour; Lymphatic system; Distributed computing; Key (lock); Biology; Artificial intelligence; Immunology; Ecology; Computer security","score_opus":0.014227972709710806,"score_gpt":0.2400545150884462,"score_spread":0.2258265423787354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757019592","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.6016194,0.00059549697,0.35433185,0.001332996,0.0003378443,0.000116890726,0.00024445742,0.0012486599,0.040172305],"genre_scores_gemma":[0.9526625,0.00017558709,0.04194297,0.0001526534,0.000041720865,0.00009445332,0.00007651208,0.00008487582,0.004768757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998561,0.000063122585,0.0000040158884,0.000023915301,0.000030740433,0.000021983178],"domain_scores_gemma":[0.9993175,0.00043747944,0.000045406945,0.00007814896,0.00004646956,0.00007505964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037583002,0.00030041495,0.0006455228,0.0003115845,0.00045571083,0.0009154842,0.0013104734,0.001853803,0.00386961],"category_scores_gemma":[0.0019325091,0.0003697845,0.00049072684,0.00031871858,0.0013735233,0.0009950636,0.00086384034,0.0011266989,0.00032471624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054388114,0.000042598218,0.0007998935,0.000033598677,0.000024597335,0.00008662928,0.00013553588,0.9643344,0.0035156053,0.024650468,0.0009744685,0.005347849],"study_design_scores_gemma":[0.00002341639,0.000019964336,0.00013797324,0.0000024756507,0.000004940229,0.000014248994,0.000012832788,0.99216765,0.00038379466,0.006808628,0.0004195692,0.0000044865237],"about_ca_topic_score_codex":0.0025966319,"about_ca_topic_score_gemma":0.0013308453,"teacher_disagreement_score":0.00386961,"about_ca_system_score_codex":0.00042778085,"about_ca_system_score_gemma":0.000455503,"threshold_uncertainty_score":0.012945175},"labels":[],"label_agreement":null},{"id":"W1757553993","doi":"10.1007/978-3-319-24027-5_29","title":"Is Concept Mapping Useful for Biomedical Information Retrieval?","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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é de Montréal","funders":"","keywords":"Computer science; Information retrieval; Artificial intelligence","score_opus":0.03895289143602098,"score_gpt":0.28723734228522013,"score_spread":0.24828445084919915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757553993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03693778,0.041851457,0.8411203,0.024555625,0.002789303,0.00018616236,0.0031507672,0.00398365,0.04542491],"genre_scores_gemma":[0.40420067,0.028854826,0.5474687,0.0031133194,0.0019069619,0.0002793303,0.0035573572,0.00079096685,0.009827777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997223,0.0013344035,0.00022219506,0.00042936736,0.00069011375,0.00010096072],"domain_scores_gemma":[0.98675364,0.010444243,0.0003688477,0.0012761351,0.0010085667,0.00014846669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054841926,0.000780925,0.0011896709,0.005753205,0.0007550637,0.004605594,0.0017042867,0.0017410849,0.008508615],"category_scores_gemma":[0.03181604,0.0005362411,0.0011330853,0.0072382437,0.0017003769,0.015970418,0.0017806531,0.0012602499,0.0038669782],"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.00022376639,0.00010633267,0.0022762958,0.0012029076,0.00017965565,0.00020594479,0.0005693535,0.0023226843,0.003280524,0.088213824,0.028539747,0.87287897],"study_design_scores_gemma":[0.000054217253,0.00009392528,0.0022797324,0.00049323955,0.00021344669,0.0016030823,0.0009905616,0.059831373,0.007254606,0.8391209,0.08797834,0.00008648017],"about_ca_topic_score_codex":0.001242731,"about_ca_topic_score_gemma":0.0008457107,"teacher_disagreement_score":0.008508615,"about_ca_system_score_codex":0.0006489454,"about_ca_system_score_gemma":0.0009410542,"threshold_uncertainty_score":0.02900356},"labels":[],"label_agreement":null},{"id":"W1757790950","doi":"10.1007/11548706_31","title":"Multiresolution Pitch Analysis of Talking, Singing, and the Continuum Between","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Singing; Computer science; Acoustics; Physics","score_opus":0.012923949388133628,"score_gpt":0.2436389219404158,"score_spread":0.23071497255228218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757790950","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.48685303,0.005899039,0.47551998,0.00049952377,0.00018398098,0.000028535736,0.00020658046,0.00032151912,0.03048793],"genre_scores_gemma":[0.95222574,0.0017462423,0.039325137,0.00005007168,0.00010464856,0.000015127988,0.00015927672,0.00010991933,0.0062637976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999101,0.000015952866,0.000003084716,0.000021213717,0.00003270529,0.000017006341],"domain_scores_gemma":[0.9998023,0.00009384124,0.00002365895,0.000026783699,0.0000287462,0.000024719759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023000552,0.0002754758,0.00028963186,0.000605981,0.00026501997,0.0009113103,0.00032309195,0.00031369747,0.0034109857],"category_scores_gemma":[0.0009566152,0.00020725296,0.0002682784,0.00051863334,0.00050631317,0.0011413661,0.0005213182,0.0007796049,0.00049501593],"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.0010901266,0.00014630514,0.0030196514,0.00040874546,0.000115449846,0.00077857886,0.0016063001,0.031471193,0.3266675,0.15042506,0.004021794,0.48024926],"study_design_scores_gemma":[0.00011266809,0.00044014936,0.08209121,0.00021569266,0.00018068623,0.0021243535,0.0024946008,0.64093703,0.061163954,0.18621466,0.023857966,0.00016712863],"about_ca_topic_score_codex":0.00038065598,"about_ca_topic_score_gemma":0.00042308748,"teacher_disagreement_score":0.0034109857,"about_ca_system_score_codex":0.00015240663,"about_ca_system_score_gemma":0.000084778534,"threshold_uncertainty_score":0.011410892},"labels":[],"label_agreement":null},{"id":"W1757839379","doi":"10.1007/978-3-642-23716-4_19","title":"Divide-by-Zero Exception Raising via Branch Coverage","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Testability; Hill climbing; Simulated annealing; Computer science; Genetic programming; Constraint programming; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.02637198270498408,"score_gpt":0.2512384320766876,"score_spread":0.22486644937170353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757839379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081992574,0.00079853454,0.87816167,0.00053594256,0.00023167784,0.00007445017,0.000108876906,0.007275037,0.030821279],"genre_scores_gemma":[0.8387461,0.0003652802,0.15033878,0.00030780895,0.000111597285,0.00006814223,0.0002037182,0.0009191445,0.008939502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998403,0.0003247895,0.0001007991,0.0002863372,0.0005829647,0.0003021478],"domain_scores_gemma":[0.99589455,0.0019979328,0.0001857932,0.0014372863,0.000338457,0.00014591323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959457,0.0008951541,0.000997139,0.0015832674,0.00065997115,0.0015163298,0.001578879,0.0010367937,0.0059996415],"category_scores_gemma":[0.0057897717,0.00065889774,0.00074212725,0.0012935073,0.0013248306,0.0034491906,0.0032723632,0.0023260908,0.0014390197],"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.0005654516,0.00019981273,0.0025475675,0.00033672398,0.000068625064,0.00077117264,0.00046669896,0.022585742,0.026301693,0.18772711,0.009146406,0.7492829],"study_design_scores_gemma":[0.00010518291,0.0002498314,0.0012481229,0.0002058639,0.00026812791,0.0013624674,0.00014751319,0.23928092,0.067460634,0.667592,0.02198138,0.00009793406],"about_ca_topic_score_codex":0.0003675384,"about_ca_topic_score_gemma":0.00077558716,"teacher_disagreement_score":0.0059996415,"about_ca_system_score_codex":0.0004615601,"about_ca_system_score_gemma":0.0006946659,"threshold_uncertainty_score":0.02007085},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W175807763","doi":"10.1007/978-3-642-38333-5_28","title":"Towards a Taxonomy Framework of Evolution for SOA Solution: From a Practical Point of View","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Ontario Tech University","funders":"","keywords":"Taxonomy (biology); Computer science; Evolutionary algorithm; Process (computing); Software engineering; Artificial intelligence; Ecology; Programming language","score_opus":0.02597127462303907,"score_gpt":0.2656435699769812,"score_spread":0.2396722953539421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175807763","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.0034666397,0.002354749,0.96803045,0.0034062888,0.00034179757,0.0002487631,0.00023044903,0.0007242351,0.021196648],"genre_scores_gemma":[0.049616605,0.0035426652,0.93697786,0.00045057872,0.00017565953,0.00038837775,0.00070941035,0.00025082787,0.007888018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963649,0.0011491117,0.00059962884,0.0005708786,0.0009854932,0.00033004367],"domain_scores_gemma":[0.9973596,0.00048629372,0.00023444708,0.00047098738,0.0011160105,0.00033259994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040264553,0.0012204429,0.0011748631,0.0059010354,0.0030958166,0.0091279615,0.0034879097,0.0035401694,0.0057345815],"category_scores_gemma":[0.0057745525,0.00097321405,0.0020772368,0.007107302,0.003717653,0.015568447,0.004046173,0.004388316,0.002301267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011222123,0.000035708894,0.000713102,0.00025149382,0.000023761155,0.00016311464,0.0011598086,0.0027605938,0.0010114395,0.93129635,0.005014809,0.05755864],"study_design_scores_gemma":[0.000012833991,0.000052085394,0.0004954144,0.00057895517,0.000059275786,0.00068699796,0.0013877787,0.049300823,0.001225509,0.754341,0.1918103,0.00004895219],"about_ca_topic_score_codex":0.010215382,"about_ca_topic_score_gemma":0.008956724,"teacher_disagreement_score":0.010215382,"about_ca_system_score_codex":0.0049124816,"about_ca_system_score_gemma":0.006627769,"threshold_uncertainty_score":0.035642684},"labels":[],"label_agreement":null},{"id":"W1758476776","doi":"10.1007/10722777_13","title":"A Schema-Based Approach to Specifying Conversation Policies","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":30,"is_retracted":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":"Conversation; Computer science; Schema (genetic algorithms); Petri net; Human–computer interaction; Set (abstract data type); Programming language; Artificial intelligence; Information retrieval; Linguistics","score_opus":0.035700354438470736,"score_gpt":0.2518510865981032,"score_spread":0.21615073215963243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758476776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007663288,0.00017914295,0.9913975,0.00038878678,0.00007319648,0.0002872481,0.000526021,0.002492696,0.00388906],"genre_scores_gemma":[0.02694907,0.0006287724,0.96475714,0.00042869765,0.00006768908,0.0007327059,0.0017309112,0.00078592665,0.003919128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99159884,0.0035154084,0.0017169331,0.0010065803,0.0017546611,0.00040747283],"domain_scores_gemma":[0.99050796,0.004365504,0.00055047683,0.0022665178,0.0018750674,0.00043443782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009696802,0.0016292281,0.0015765467,0.0032009722,0.0024826133,0.012373612,0.004988675,0.0036224255,0.012145997],"category_scores_gemma":[0.017128026,0.0034160241,0.0037870852,0.0039697937,0.0032323739,0.015108546,0.004664299,0.0076571885,0.0053252173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011121223,0.00011114703,0.0005796023,0.00049442396,0.00015255414,0.00039274915,0.0030292845,0.011305082,0.005103727,0.88982195,0.013986339,0.0749119],"study_design_scores_gemma":[0.000121548364,0.00010148089,0.00022328831,0.00077748013,0.0003651579,0.0009316234,0.001423562,0.17828372,0.021772899,0.4760571,0.3197285,0.00021362596],"about_ca_topic_score_codex":0.010762466,"about_ca_topic_score_gemma":0.011039529,"teacher_disagreement_score":0.012373612,"about_ca_system_score_codex":0.0028238827,"about_ca_system_score_gemma":0.005202162,"threshold_uncertainty_score":0.051282167},"labels":[],"label_agreement":null},{"id":"W1758661201","doi":"10.1007/978-3-319-24462-4_2","title":"Extended Spearman and Kendall Coefficients for Gene Annotation List Correlation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Princess Margaret Cancer Centre; University of Toronto","funders":"","keywords":"Annotation; Correlation; Spearman's rank correlation coefficient; Gene ontology; Gene Annotation; Computer science; Key (lock); Correlation coefficient; Pearson product-moment correlation coefficient; Data mining; Machine learning; Gene; Statistics; Artificial intelligence; Mathematics; Biology; Genetics; Genome","score_opus":0.02809335195549204,"score_gpt":0.26892840053091677,"score_spread":0.24083504857542473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758661201","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.009246578,0.0035860299,0.97524625,0.00043254826,0.0008780932,0.00014919337,0.0035784368,0.002354472,0.0045284717],"genre_scores_gemma":[0.1940559,0.0036071676,0.7743512,0.00048867177,0.0017863469,0.0013526931,0.010544314,0.0023181378,0.011495693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9815077,0.0082503045,0.0014512874,0.002961143,0.0051029907,0.0007264611],"domain_scores_gemma":[0.93091816,0.04488502,0.0031452253,0.010948933,0.009334072,0.0007686027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01487456,0.002313511,0.0024079608,0.0098685175,0.00146076,0.0042926976,0.004205088,0.0015345352,0.0061797565],"category_scores_gemma":[0.07686129,0.0011102146,0.0026110031,0.011684202,0.00223151,0.005630396,0.0025456487,0.00405438,0.0056315577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047096933,0.0002123392,0.030448701,0.0015317413,0.0012404963,0.0006550864,0.0009073385,0.040494464,0.0054457397,0.3132354,0.07153772,0.53382003],"study_design_scores_gemma":[0.000059178048,0.0002338023,0.017080257,0.00040646637,0.00040668232,0.0012574993,0.00035099842,0.29948118,0.0065356498,0.59487236,0.07898749,0.00032843443],"about_ca_topic_score_codex":0.003671246,"about_ca_topic_score_gemma":0.0051373807,"teacher_disagreement_score":0.01487456,"about_ca_system_score_codex":0.0016101712,"about_ca_system_score_gemma":0.0040341173,"threshold_uncertainty_score":0.07866514},"labels":[],"label_agreement":null},{"id":"W1758878976","doi":"10.1007/3-540-45065-3_12","title":"Authoring Cases from Free-Text Maintenance Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"National Research Council Canada","funders":"","keywords":"Bottleneck; Computer science; Order (exchange); Authoring system; Natural language; Text messaging; Software engineering; Natural language processing; World Wide Web; Multimedia; Embedded system","score_opus":0.06487594548208223,"score_gpt":0.28588465463466084,"score_spread":0.22100870915257861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758878976","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.044473175,0.00045971936,0.8299351,0.0015776155,0.00060104753,0.0007455807,0.023060264,0.06296937,0.03617817],"genre_scores_gemma":[0.222855,0.00056929054,0.7097478,0.00017856128,0.00023826792,0.00047934678,0.040099114,0.009644309,0.016188301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732375,0.00056361273,0.0002648565,0.00041877214,0.0013222065,0.00010672387],"domain_scores_gemma":[0.9664343,0.026160698,0.001010853,0.0046696593,0.0013910608,0.00033350196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024973596,0.001411078,0.00081886776,0.0037246551,0.0007569492,0.0033666159,0.0026048126,0.0018369954,0.033686522],"category_scores_gemma":[0.03310822,0.0011804985,0.0012248154,0.0025435272,0.00089169585,0.0055026365,0.0024314309,0.0018481242,0.008248146],"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.00094086793,0.00044346074,0.0073853442,0.0017632882,0.00011845863,0.005838662,0.0035085166,0.076751895,0.010660733,0.08754079,0.22243296,0.5826151],"study_design_scores_gemma":[0.000239007,0.00011442271,0.0011616317,0.00045559395,0.00010525342,0.002557435,0.0007385273,0.46526507,0.04177814,0.12304146,0.36442393,0.000119635944],"about_ca_topic_score_codex":0.0013341386,"about_ca_topic_score_gemma":0.004040623,"teacher_disagreement_score":0.033686522,"about_ca_system_score_codex":0.0008231347,"about_ca_system_score_gemma":0.0009917945,"threshold_uncertainty_score":0.112692654},"labels":[],"label_agreement":null},{"id":"W1759023222","doi":"10.1007/978-3-642-21043-3_33","title":"Finding Small Backdoors in SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backdoor; Computer science; Satisfiability; Boolean satisfiability problem; Theoretical computer science; Set (abstract data type); Algorithm; Time complexity; Programming language","score_opus":0.05988371030649545,"score_gpt":0.27856254880524095,"score_spread":0.2186788384987455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759023222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18110408,0.002711398,0.7436955,0.006124324,0.0008243863,0.0009489986,0.0036079418,0.006270542,0.054712817],"genre_scores_gemma":[0.70368344,0.0011425999,0.27033406,0.001481084,0.00040975382,0.00066525966,0.003718775,0.0016549748,0.01691006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470913,0.0020149697,0.00028421357,0.0011637319,0.001019792,0.0008081796],"domain_scores_gemma":[0.9707172,0.024132527,0.00082675955,0.0034642825,0.00041539985,0.0004437069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034139955,0.0024977173,0.0034480055,0.0018795246,0.0018784004,0.005358968,0.0049010133,0.0035527996,0.024044348],"category_scores_gemma":[0.026001822,0.0028991136,0.004625121,0.0031224503,0.0044271084,0.012720635,0.007824913,0.009076949,0.003330785],"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.0027600306,0.0008528583,0.0031325095,0.0026614943,0.0007913244,0.000830053,0.0011089866,0.17624632,0.008719009,0.5161903,0.03808775,0.2486194],"study_design_scores_gemma":[0.0002948457,0.00016891437,0.0003477806,0.00017266678,0.00020132134,0.00031372768,0.00025309794,0.13890633,0.004371791,0.8495186,0.0053988174,0.00005209559],"about_ca_topic_score_codex":0.0011478377,"about_ca_topic_score_gemma":0.002033906,"teacher_disagreement_score":0.024044348,"about_ca_system_score_codex":0.002103615,"about_ca_system_score_gemma":0.0019161773,"threshold_uncertainty_score":0.08043629},"labels":[],"label_agreement":null},{"id":"W1759411922","doi":"10.1007/3-540-36136-7_37","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Independent set; Combinatorics; Bounded function; Planar graph; Degree (music); Maximal independent set; Planar; Discrete mathematics; Mathematics; Graph; Set (abstract data type); Planar straight-line graph; Upper and lower bounds; 1-planar graph; Computer science; Chordal graph; Physics","score_opus":0.038105072769623306,"score_gpt":0.2821378396137072,"score_spread":0.2440327668440839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759411922","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.3508909,0.010252528,0.28318757,0.0029332014,0.0005322694,0.00019572725,0.0013265809,0.0006697616,0.35001147],"genre_scores_gemma":[0.8726935,0.007225332,0.060031198,0.0003339292,0.0005045071,0.00028829422,0.0014413131,0.00023250171,0.05724954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996094,0.00006908419,0.00001625815,0.000075317716,0.00017437569,0.000055634406],"domain_scores_gemma":[0.99834955,0.0012274105,0.00008787393,0.00013004722,0.0001038019,0.0001014369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029341393,0.0006302897,0.00086834043,0.0015732746,0.0014135056,0.0023987074,0.0015898765,0.0009672287,0.005074148],"category_scores_gemma":[0.002607666,0.00096469786,0.00076660793,0.003025616,0.0014651283,0.003528044,0.0015722886,0.0028025524,0.00082614657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059421745,0.00005135681,0.00027671902,0.0002211258,0.000018301344,0.00009737765,0.0003460608,0.010394109,0.0018867836,0.9466996,0.0065145856,0.033434488],"study_design_scores_gemma":[0.00001433876,0.000010844138,0.00033242945,0.000024707273,0.000017562905,0.0001340467,0.000081025006,0.007671097,0.0007772469,0.98442405,0.006504647,0.000008105209],"about_ca_topic_score_codex":0.00072683865,"about_ca_topic_score_gemma":0.0010415278,"teacher_disagreement_score":0.005074148,"about_ca_system_score_codex":0.0010562581,"about_ca_system_score_gemma":0.00041338507,"threshold_uncertainty_score":0.016974688},"labels":[],"label_agreement":null},{"id":"W1759566837","doi":"10.1007/978-3-540-89020-1_18","title":"Transforming Timeline Specifications into Automata for Runtime Monitoring","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Correctness; Programmer; Timeline; Programming language; Automaton; Toolchain; Runtime verification; Formalism (music); Model transformation; Software; Notation; Software engineering; Formal specification; Formal verification; Theoretical computer science; Artificial intelligence","score_opus":0.07010819227778484,"score_gpt":0.3038538854685864,"score_spread":0.23374569319080155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759566837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074762413,0.00006086967,0.9841249,0.00007985891,0.000052408417,0.00005611717,0.00021377363,0.0054319175,0.0025039155],"genre_scores_gemma":[0.27433738,0.00028486413,0.7149416,0.00019732337,0.000059039765,0.00025652358,0.0011225909,0.0028420324,0.005958627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00035705316,0.00018692044,0.00026045,0.00045852433,0.00012842187],"domain_scores_gemma":[0.99629116,0.0020700207,0.0003985692,0.0006295179,0.00055335695,0.000057432484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013253537,0.0007738493,0.0004274951,0.0006319324,0.00030972812,0.0018980318,0.0012465139,0.0010857752,0.004990529],"category_scores_gemma":[0.005593828,0.0008687592,0.0010490692,0.00062633055,0.0010873527,0.002481886,0.0011528598,0.0019262835,0.0014858213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006846358,0.00019679045,0.0015900938,0.0007044918,0.00009339219,0.00068171404,0.0017338581,0.14535524,0.06612337,0.520698,0.010600798,0.25153765],"study_design_scores_gemma":[0.00016480629,0.00016734653,0.0003041945,0.00014868745,0.00012631425,0.0003537834,0.00021955455,0.5480297,0.12499282,0.27777308,0.047634576,0.00008515324],"about_ca_topic_score_codex":0.0016074622,"about_ca_topic_score_gemma":0.0022793326,"teacher_disagreement_score":0.004990529,"about_ca_system_score_codex":0.00067849207,"about_ca_system_score_gemma":0.0009236196,"threshold_uncertainty_score":0.016694963},"labels":[],"label_agreement":null},{"id":"W1759574848","doi":"10.1007/978-3-642-31104-8_25","title":"Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Bounded function; Computer science; Node (physics); Tree (set theory); Upper and lower bounds; Randomized algorithm; Degree (music); Constant (computer programming); Tree traversal; Time complexity; Algorithm; Deterministic algorithm; Combinatorics; Mathematics","score_opus":0.015361322825506415,"score_gpt":0.24348352680076954,"score_spread":0.22812220397526312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759574848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26613104,0.0035056872,0.65732336,0.005683139,0.0007324308,0.00022263036,0.0013744019,0.0026009392,0.0624264],"genre_scores_gemma":[0.93886733,0.0009643112,0.041309703,0.00034375166,0.0005194543,0.00023091493,0.00048721486,0.00095047924,0.016326824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447244,0.0017143117,0.0003229387,0.0013637888,0.0010664182,0.001060161],"domain_scores_gemma":[0.96186835,0.027208483,0.002104344,0.005929858,0.0013129732,0.0015759923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048546316,0.00076588977,0.0020480666,0.0013200991,0.00254704,0.0055954037,0.0030732858,0.0021619217,0.012245808],"category_scores_gemma":[0.033784658,0.0011194758,0.0017484857,0.0017256868,0.0039878534,0.013125001,0.003320109,0.0039913454,0.0013335675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009069118,0.000058273887,0.000844914,0.00023228204,0.00008134255,0.00011307303,0.00046200858,0.053364426,0.002173539,0.9134886,0.0056132115,0.022661421],"study_design_scores_gemma":[0.000083533545,0.000070388196,0.00026134163,0.0000413839,0.000051465242,0.000115102936,0.00009071511,0.117162965,0.0015246976,0.8778387,0.0027185106,0.00004115704],"about_ca_topic_score_codex":0.0017335562,"about_ca_topic_score_gemma":0.0017851526,"teacher_disagreement_score":0.012245808,"about_ca_system_score_codex":0.002750965,"about_ca_system_score_gemma":0.0030459461,"threshold_uncertainty_score":0.040966272},"labels":[],"label_agreement":null},{"id":"W1759641679","doi":"10.1007/978-3-540-85762-4_16","title":"A New Approach for the Construction of Multiway Decision Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Operator (biology); First-order logic; Theoretical computer science; Representation (politics); Pruning; Product (mathematics); Programming language; Algorithm; Mathematics","score_opus":0.03805516319997952,"score_gpt":0.2848170060365708,"score_spread":0.24676184283659125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759641679","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.001550641,0.00006445471,0.994113,0.000090568705,0.000050888575,0.000073187985,0.00008522566,0.00067519775,0.0032969003],"genre_scores_gemma":[0.040572334,0.0001921869,0.950647,0.0001340196,0.000051216393,0.00023449167,0.00036152473,0.00042403612,0.007383261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772006,0.0005004266,0.00017763666,0.0006369618,0.0007881125,0.0001768058],"domain_scores_gemma":[0.9978727,0.0008975291,0.000091841044,0.00073012145,0.00028899134,0.00011885273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475456,0.0010881817,0.00087664556,0.0016484666,0.00141795,0.0026784053,0.0026623087,0.0010246412,0.010265108],"category_scores_gemma":[0.0036601597,0.0011484487,0.0025582497,0.0014492073,0.0019463402,0.004147514,0.003794115,0.0038465394,0.0034274405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009591943,0.0001595971,0.0004335734,0.00037573106,0.000091807575,0.00027239876,0.00052651425,0.014618532,0.013235248,0.73703945,0.0070607713,0.22609045],"study_design_scores_gemma":[0.000042325835,0.00008336498,0.0002373018,0.00010224695,0.00011303025,0.00036165884,0.00010966965,0.07497219,0.016964452,0.8251848,0.081762165,0.000066688925],"about_ca_topic_score_codex":0.0011466045,"about_ca_topic_score_gemma":0.0023269264,"teacher_disagreement_score":0.010265108,"about_ca_system_score_codex":0.001056851,"about_ca_system_score_gemma":0.001356737,"threshold_uncertainty_score":0.034340203},"labels":[],"label_agreement":null},{"id":"W1760299170","doi":"10.1007/978-3-540-24840-8_7","title":"Finding Interesting Summaries in GenSpace Graphs Efficiently","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Traverse; Automatic summarization; Computer science; Pruning; Graph; Data mining; Theoretical computer science; Set (abstract data type); Algorithm; Artificial intelligence","score_opus":0.023736585282035712,"score_gpt":0.25130724938362103,"score_spread":0.22757066410158533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760299170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29588455,0.0043211225,0.59979755,0.0047723027,0.00046555547,0.0012509779,0.032423876,0.029700752,0.031383365],"genre_scores_gemma":[0.37578577,0.0016152309,0.55950725,0.0004250154,0.00024274706,0.00022556064,0.03654193,0.0023744246,0.023282122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999108,0.00016398037,0.000075319,0.00021603997,0.00032518656,0.00011156615],"domain_scores_gemma":[0.9958319,0.0024310527,0.00031889416,0.00081141765,0.00044075347,0.00016602236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072034285,0.0010119139,0.0017689276,0.0037650238,0.0012133307,0.002718749,0.0011737071,0.0010894829,0.011551135],"category_scores_gemma":[0.0057613226,0.0007347433,0.0013148448,0.0054345,0.00069161865,0.006680468,0.0018572914,0.0013365096,0.002819202],"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.0011221938,0.00040546863,0.005831817,0.0020693368,0.0002792374,0.00085975503,0.0016852792,0.032918893,0.021996431,0.061782558,0.119478665,0.7515704],"study_design_scores_gemma":[0.00038320536,0.0004950845,0.0030880256,0.0002693691,0.0005812109,0.001545817,0.0030060268,0.27094376,0.0342014,0.57105666,0.1143215,0.00010788676],"about_ca_topic_score_codex":0.0024842918,"about_ca_topic_score_gemma":0.008139659,"teacher_disagreement_score":0.011551135,"about_ca_system_score_codex":0.00084008207,"about_ca_system_score_gemma":0.0012720308,"threshold_uncertainty_score":0.038642406},"labels":[],"label_agreement":null},{"id":"W1760381732","doi":"10.1007/978-3-642-17679-1_18","title":"Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Asynchronous communication; Constant (computer programming); Fraction (chemistry); Byzantine fault tolerance; Quantum Byzantine agreement; Distributed computing; Set (abstract data type); Binary logarithm; Parallel computing; Theoretical computer science; Computer network; Discrete mathematics; Fault tolerance; Mathematics","score_opus":0.01137290983214445,"score_gpt":0.2202480344864702,"score_spread":0.20887512465432576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760381732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048572082,0.00081400666,0.9353818,0.00046447315,0.00031791817,0.00036442664,0.0003703887,0.0020548138,0.011660013],"genre_scores_gemma":[0.65802914,0.00039090822,0.32392824,0.00019955968,0.00020096416,0.00046250134,0.0005033516,0.0002180102,0.016067311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868673,0.00031864145,0.00007864644,0.00024093136,0.00050097215,0.00017405745],"domain_scores_gemma":[0.99834037,0.00055819267,0.000112536654,0.0006367211,0.00027418236,0.00007795848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862336,0.00065917155,0.0015570542,0.00071968214,0.0016404698,0.0018710892,0.0020449765,0.0009996397,0.0050606346],"category_scores_gemma":[0.0026380648,0.00040072014,0.0003683757,0.0011666302,0.00078238756,0.0034873078,0.003012239,0.001147011,0.001366179],"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.0024312788,0.00052782113,0.00068383245,0.00079960393,0.00016371241,0.00035287262,0.0008881976,0.16151428,0.12058795,0.17919143,0.021433314,0.5114258],"study_design_scores_gemma":[0.00023324725,0.00032937046,0.00026418632,0.00004526692,0.0000501061,0.00015936083,0.00014493152,0.8372969,0.035360605,0.11432172,0.01174642,0.00004786144],"about_ca_topic_score_codex":0.00083732087,"about_ca_topic_score_gemma":0.0015336695,"teacher_disagreement_score":0.0050606346,"about_ca_system_score_codex":0.00067303464,"about_ca_system_score_gemma":0.0011592535,"threshold_uncertainty_score":0.016929567},"labels":[],"label_agreement":null},{"id":"W1760549314","doi":"10.1007/3-540-46146-9_70","title":"Query Optimization via Empty Joins","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Joins; Computer science; Query optimization; Tuple; Cartesian product; Join (topology); Relational database; Materialized view; Sargable; Data mining; Information retrieval; Theoretical computer science; Product (mathematics); Database; Web search query; View; Programming language; Search engine; Database design; Mathematics; Discrete mathematics","score_opus":0.017438079444344196,"score_gpt":0.22306605696522241,"score_spread":0.20562797752087822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760549314","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.01813362,0.0019824852,0.9570702,0.00069861155,0.00018705524,0.00007213548,0.0003090562,0.0038956243,0.017651279],"genre_scores_gemma":[0.37246573,0.0014250927,0.5917705,0.0005608626,0.0005601704,0.00015188177,0.0017885716,0.0026987342,0.028578322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951558,0.0012394884,0.00034857454,0.0006912698,0.0020326988,0.0005322094],"domain_scores_gemma":[0.9956683,0.0018226709,0.00019097903,0.0017514277,0.0004347933,0.00013188194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027247728,0.0010225129,0.002487728,0.0013657322,0.0012673542,0.0035908802,0.0024837826,0.0009829673,0.007988773],"category_scores_gemma":[0.008215519,0.0009183909,0.0012146832,0.002917131,0.0021276472,0.00810405,0.004518752,0.0029699649,0.0022580773],"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.001646455,0.00023507907,0.00082158635,0.0006494419,0.00017188856,0.00019491657,0.00045832118,0.031350207,0.016182842,0.47224692,0.03485975,0.44118264],"study_design_scores_gemma":[0.00009027483,0.0001513319,0.00031595823,0.00004834497,0.000107484506,0.00036150278,0.000109674715,0.2276982,0.023674382,0.7239855,0.023404451,0.000052859403],"about_ca_topic_score_codex":0.00073129113,"about_ca_topic_score_gemma":0.0008183109,"teacher_disagreement_score":0.007988773,"about_ca_system_score_codex":0.0008646981,"about_ca_system_score_gemma":0.0007791533,"threshold_uncertainty_score":0.026725113},"labels":[],"label_agreement":null},{"id":"W1760622754","doi":"10.1007/3-540-44503-x_24","title":"Reasoning about Summarizability in Heterogeneous Multidimensional Schemas","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science; Human–computer interaction","score_opus":0.01505834220825383,"score_gpt":0.2520948302424129,"score_spread":0.23703648803415908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760622754","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.15386525,0.001506169,0.8289179,0.0027184442,0.00013818202,0.00043665114,0.0020917987,0.004936888,0.0053886655],"genre_scores_gemma":[0.6280546,0.00096477993,0.36126518,0.0006093246,0.00027566197,0.00025535154,0.005637917,0.00058084825,0.0023563681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881142,0.0036317417,0.0021050365,0.001701613,0.0036891869,0.0007583213],"domain_scores_gemma":[0.95347387,0.03458663,0.0031045757,0.0051847673,0.003142235,0.00050792383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0107404655,0.0010562605,0.0016330571,0.004138244,0.0019086393,0.006411411,0.0035735825,0.003149045,0.005001829],"category_scores_gemma":[0.05076087,0.0019922622,0.002680073,0.005708074,0.0028735197,0.026672937,0.0069332025,0.0030725538,0.0004816187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012916274,0.00043804484,0.02483951,0.0028488103,0.0012808116,0.0052805175,0.009771824,0.10380298,0.019599628,0.5613454,0.021169852,0.24833101],"study_design_scores_gemma":[0.00027289733,0.00018311582,0.002577858,0.00042279524,0.0010640105,0.0012968008,0.0033737023,0.37367272,0.025579572,0.575635,0.015783777,0.00013772189],"about_ca_topic_score_codex":0.0034975787,"about_ca_topic_score_gemma":0.003378054,"teacher_disagreement_score":0.0107404655,"about_ca_system_score_codex":0.0018125994,"about_ca_system_score_gemma":0.00075055746,"threshold_uncertainty_score":0.056801677},"labels":[],"label_agreement":null},{"id":"W1761817100","doi":"10.1007/978-3-540-68825-9_16","title":"Using Dependence Diagrams to Summarize Decision Rule Sets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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; Lakehead University","funders":"","keywords":"Computer science; Set (abstract data type); Decision rule; Influence diagram; Data mining; Artificial intelligence; Machine learning; Rule-based system; Theoretical computer science; Decision tree; Programming language","score_opus":0.03946380529943017,"score_gpt":0.29260935656202497,"score_spread":0.2531455512625948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761817100","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.016564531,0.0010822456,0.9734673,0.00021421557,0.000112475755,0.00021908233,0.0028963499,0.0037448055,0.0016989447],"genre_scores_gemma":[0.21877263,0.0012099248,0.7660546,0.00015944308,0.00015897679,0.0004586848,0.010318412,0.00043368142,0.0024335885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980312,0.00047429668,0.0003150609,0.00035114342,0.0007395149,0.000088793124],"domain_scores_gemma":[0.98234934,0.01303401,0.00079036376,0.0015578043,0.0020118097,0.00025670638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002745001,0.0009957863,0.0012500111,0.0074530235,0.00078299246,0.0028631168,0.0012305311,0.0008439018,0.0041922247],"category_scores_gemma":[0.024151923,0.0008577687,0.0013593885,0.0041758046,0.0005086147,0.004995148,0.0011154052,0.0016612121,0.0011507816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043517599,0.00027786993,0.007105171,0.0007751683,0.000360744,0.0003227965,0.00056629616,0.09855598,0.0043929704,0.058237318,0.015506466,0.81346387],"study_design_scores_gemma":[0.000059464837,0.00011957981,0.0016334867,0.00021411556,0.00030649645,0.00024205665,0.00011931439,0.7467445,0.005875345,0.22677518,0.017844616,0.00006588073],"about_ca_topic_score_codex":0.0043192157,"about_ca_topic_score_gemma":0.006260871,"teacher_disagreement_score":0.0074530235,"about_ca_system_score_codex":0.0010641898,"about_ca_system_score_gemma":0.0013555199,"threshold_uncertainty_score":0.0145171285},"labels":[],"label_agreement":null},{"id":"W176182772","doi":"10.1007/978-3-642-45043-3_21","title":"Thickness and Colorability of Geometric Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Planar graph; Mathematics; Graph; Geometric graph theory; Discrete mathematics; Line graph; Graph power","score_opus":0.015853929763021368,"score_gpt":0.2369073298119856,"score_spread":0.22105340004896423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176182772","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.565537,0.0044985106,0.2718066,0.0011967398,0.00051111344,0.00007286305,0.00082093565,0.0006185806,0.15493774],"genre_scores_gemma":[0.9281444,0.0030381598,0.03454557,0.0001708322,0.0005094826,0.00008384476,0.0005624631,0.00075314986,0.03219204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945277,0.000104590596,0.000023671551,0.00014509643,0.00019365268,0.00008022245],"domain_scores_gemma":[0.9964005,0.0018924122,0.00048194418,0.00045852995,0.00036515624,0.0004015888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057558,0.0008473926,0.000571148,0.0020962579,0.0006715098,0.0022776166,0.0016835798,0.0007049006,0.008650261],"category_scores_gemma":[0.005075188,0.0010206806,0.0006539533,0.001582437,0.0026489354,0.0043813796,0.0017760524,0.002391078,0.000920553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019295936,0.00005412982,0.0021226392,0.00026436846,0.000031870815,0.00019597709,0.000645405,0.02567897,0.0129916845,0.8910086,0.00477454,0.062038902],"study_design_scores_gemma":[0.000019122623,0.00004160029,0.0019701456,0.00006075865,0.000030982417,0.0003536055,0.00022190787,0.030778246,0.0046613,0.95432764,0.007503186,0.000031482086],"about_ca_topic_score_codex":0.001033339,"about_ca_topic_score_gemma":0.0008893848,"teacher_disagreement_score":0.008650261,"about_ca_system_score_codex":0.00096184225,"about_ca_system_score_gemma":0.0003248215,"threshold_uncertainty_score":0.028938055},"labels":[],"label_agreement":null},{"id":"W1761836155","doi":"10.1007/3-540-47922-8_28","title":"An Enhanced Genetic Algorithm Approach to the Channel Assignment Problem in Mobile Cellular Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","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 Guelph","funders":"","keywords":"Computer science; Crossover; Genetic algorithm; Channel (broadcasting); Bandwidth (computing); A priori and a posteriori; Algorithm; Interference (communication); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Computer network","score_opus":0.007352250148517361,"score_gpt":0.19305332318431234,"score_spread":0.18570107303579497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761836155","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.008785532,0.00067177054,0.9836713,0.00022837277,0.00011723401,0.00003317138,0.000023648756,0.00010888309,0.0063600196],"genre_scores_gemma":[0.3729506,0.0016876757,0.61221063,0.0002897733,0.00034871663,0.00021577439,0.000116231655,0.00013092777,0.012049581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967444,0.00014393826,0.000007708204,0.000029201447,0.00011029447,0.000034281347],"domain_scores_gemma":[0.999595,0.00025381695,0.000019744328,0.000021094716,0.00009315427,0.000017112077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053739676,0.0005935715,0.00081175874,0.0005486003,0.0003576248,0.000748146,0.0012622422,0.001458525,0.0023246096],"category_scores_gemma":[0.0018377501,0.00032757805,0.00050334586,0.0011313225,0.0007132908,0.0007641988,0.0006960608,0.0012098444,0.0003877993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019573386,0.00003068032,0.00010561503,0.0000279473,0.000018781655,0.000038073664,0.000026618409,0.9384402,0.00061604736,0.027047096,0.0011892614,0.03244019],"study_design_scores_gemma":[0.000008235836,0.000009955938,0.000033527416,0.000004655129,0.000004295178,0.000011510035,0.0000043191862,0.9897063,0.00008146707,0.009380856,0.000752554,0.0000023391412],"about_ca_topic_score_codex":0.005999821,"about_ca_topic_score_gemma":0.0048906174,"teacher_disagreement_score":0.005999821,"about_ca_system_score_codex":0.00067160575,"about_ca_system_score_gemma":0.00096838095,"threshold_uncertainty_score":0.01192981},"labels":[],"label_agreement":null},{"id":"W1761976637","doi":"10.1007/978-3-540-88194-0_7","title":"An Approach to Testing with Embedded Context Using Model Checker","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Windsor","funders":"","keywords":"Computer science; Test suite; Context (archaeology); Suite; Model-based testing; Programming language; Model checking; Isolation (microbiology); Conformance testing; Test (biology); Context model; TRACE (psycholinguistics); Software engineering; Test case; Artificial intelligence; Standardization; Operating system; Machine learning","score_opus":0.09441285592710441,"score_gpt":0.3025583259518951,"score_spread":0.20814547002479067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761976637","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.0041650212,0.000093927134,0.9905785,0.00012237516,0.000043300835,0.00007202296,0.000022279797,0.0027255728,0.0021770059],"genre_scores_gemma":[0.15195256,0.0001763301,0.8435855,0.00024933732,0.000036318816,0.0001330989,0.00008492697,0.000541632,0.0032403332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942298,0.0020265384,0.00029985333,0.0009196853,0.0021142233,0.0004100036],"domain_scores_gemma":[0.99387807,0.0029291324,0.000237941,0.002285628,0.00053780916,0.00013152059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002894263,0.0015367043,0.0012062881,0.0015835334,0.0008894959,0.0028180734,0.0046180733,0.0028224343,0.0048950263],"category_scores_gemma":[0.007548552,0.0012916722,0.0020199989,0.0011009234,0.0030531033,0.0051345425,0.0035861062,0.0048830924,0.0009959893],"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.0005266819,0.0010027174,0.0020465015,0.0008298799,0.00041383243,0.0015093186,0.00093358953,0.09199634,0.08007626,0.50444263,0.0046588443,0.3115634],"study_design_scores_gemma":[0.0002180246,0.00036689063,0.00033374384,0.00017352506,0.0003820405,0.00097340735,0.00010264542,0.6159651,0.08830351,0.27865827,0.014411109,0.00011167373],"about_ca_topic_score_codex":0.0016640018,"about_ca_topic_score_gemma":0.0026758052,"teacher_disagreement_score":0.0048950263,"about_ca_system_score_codex":0.00078323344,"about_ca_system_score_gemma":0.0018932194,"threshold_uncertainty_score":0.016375482},"labels":[],"label_agreement":null},{"id":"W1761989984","doi":"10.1007/978-3-642-39521-5_18","title":"A Note on Tractability and Artificial Intelligence","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognition; Artificial intelligence; Cognitive science; Context (archaeology); Human intelligence; Artificial general intelligence; Computational intelligence; Cognitive systems; Applications of artificial intelligence; Computation; Psychology; Algorithm","score_opus":0.031625331408654235,"score_gpt":0.26973848986118804,"score_spread":0.2381131584525338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761989984","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.006135636,0.077067494,0.54968137,0.04119461,0.0039281873,0.00008285245,0.00075788435,0.0008649725,0.32028702],"genre_scores_gemma":[0.38494876,0.10285598,0.2911847,0.013841225,0.025239136,0.0010983997,0.0021385285,0.002813459,0.17587985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980781,0.00075828057,0.00015140582,0.00033445345,0.00056872156,0.00010899093],"domain_scores_gemma":[0.9887468,0.009310183,0.00022530729,0.0012448087,0.00036382303,0.00010900813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002980853,0.0017034156,0.0026570307,0.0029898796,0.0021132203,0.004740786,0.0022326557,0.0028291068,0.014254223],"category_scores_gemma":[0.01097821,0.0011197958,0.003958373,0.003483209,0.012525248,0.01814803,0.0040940554,0.010953634,0.0034966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012687175,0.000011446244,0.000066170855,0.0002054656,0.000029610432,0.00003726849,0.00008053142,0.0033054855,0.00011186345,0.97365856,0.010599886,0.011880992],"study_design_scores_gemma":[0.000002341409,0.000003460299,0.000034854093,0.00003263004,0.000005291393,0.000013949649,0.0000068431646,0.0012072563,0.000051496467,0.9853892,0.013248741,0.0000040073774],"about_ca_topic_score_codex":0.0024249258,"about_ca_topic_score_gemma":0.001835839,"teacher_disagreement_score":0.014254223,"about_ca_system_score_codex":0.0034843283,"about_ca_system_score_gemma":0.0011632816,"threshold_uncertainty_score":0.047685087},"labels":[],"label_agreement":null},{"id":"W1762042173","doi":"10.1007/11734697_10","title":"Solving Dynamic Distributed Constraint Satisfaction Problems with a Modified Weak-Commitment Search Algorithm","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Computer science; Constraint satisfaction; Constraint satisfaction problem; Asynchronous communication; Constraint (computer-aided design); Dynamic programming; Algorithm; Dynamic problem; Mathematical optimization; Distributed computing; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.012484517980597545,"score_gpt":0.2308659576215335,"score_spread":0.21838143964093595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762042173","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.010745792,0.00009574399,0.98536646,0.00015550762,0.000056332403,0.00007646258,0.00003155213,0.0003124057,0.0031597994],"genre_scores_gemma":[0.29936576,0.00010949578,0.69363075,0.00017019373,0.00007039009,0.00047968538,0.00015139164,0.00021536596,0.005806989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999047,0.0003254611,0.000056374756,0.00018485663,0.00027265016,0.00011370563],"domain_scores_gemma":[0.9983908,0.0010362193,0.00008171147,0.00022610695,0.00017514732,0.00008996255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015368287,0.0009522022,0.0018091825,0.0006072234,0.00072696054,0.0012379274,0.002898062,0.0018373794,0.0067377994],"category_scores_gemma":[0.004311428,0.00085258903,0.00077425805,0.0013021978,0.00093905994,0.0018062278,0.0027998816,0.0023542126,0.0008555211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037611712,0.00028506634,0.0002791951,0.00017070257,0.0001061876,0.00009063818,0.000109984845,0.8058292,0.0033893022,0.043763958,0.004230025,0.14136957],"study_design_scores_gemma":[0.000056282683,0.000028597984,0.000025538242,0.0000037184104,0.000007851699,0.000009452739,0.000009327165,0.99151343,0.00027585853,0.0076913643,0.00037387837,0.000004653832],"about_ca_topic_score_codex":0.0023227525,"about_ca_topic_score_gemma":0.003555824,"teacher_disagreement_score":0.0067377994,"about_ca_system_score_codex":0.00068211276,"about_ca_system_score_gemma":0.001545403,"threshold_uncertainty_score":0.022540152},"labels":[],"label_agreement":null},{"id":"W1762574855","doi":"10.1007/978-3-540-85990-1_84","title":"Software Strategy for Robotic Transperineal Prostate Therapy in Closed-Bore MRI","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","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":"Queen's University","funders":"National Center for Research Resources; National Science Foundation; National Cancer Institute; National Institutes of Health; National Institute of Biomedical Imaging and Bioengineering; Ministry of Economy, Trade and Industry; Consortia for Improving Medicine with Innovation and Technology","keywords":"Computer science; Fiducial marker; Software; Artificial intelligence; Computer vision; Workflow; Robot; Visualization","score_opus":0.02250996314295067,"score_gpt":0.2548163363150385,"score_spread":0.23230637317208785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762574855","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.027342504,0.0000884029,0.9684775,0.00009380038,0.000035157373,0.000041835465,0.000015206317,0.0011635761,0.002741985],"genre_scores_gemma":[0.59962493,0.00010239922,0.39307976,0.00012176652,0.000037650167,0.0000909296,0.00007164035,0.0003900282,0.0064808074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980205,0.000039665054,0.000012146509,0.000038160575,0.00008466342,0.000023390916],"domain_scores_gemma":[0.9997738,0.00006843543,0.000026933392,0.000036098376,0.00007035634,0.000024439736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022441272,0.0003869219,0.0003180135,0.00022633918,0.0002780506,0.0005429201,0.0007046712,0.00042585615,0.0023235802],"category_scores_gemma":[0.00062304584,0.00023472503,0.00029825434,0.00013078215,0.00022679931,0.00050177297,0.0006603858,0.00031930098,0.00057855225],"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.00063964864,0.000282243,0.0018251068,0.0002023072,0.00006985245,0.00066355045,0.00029845646,0.11581582,0.3080887,0.019193979,0.0031561328,0.5497642],"study_design_scores_gemma":[0.00006539015,0.00055149564,0.0016749037,0.00001482755,0.000041451378,0.0011066436,0.000059609938,0.9159429,0.06641635,0.0073744557,0.0067073116,0.000044726414],"about_ca_topic_score_codex":0.00078665634,"about_ca_topic_score_gemma":0.0012139,"teacher_disagreement_score":0.0023235802,"about_ca_system_score_codex":0.0002054041,"about_ca_system_score_gemma":0.00041664258,"threshold_uncertainty_score":0.0077731013},"labels":[],"label_agreement":null},{"id":"W1762825858","doi":"10.1007/978-3-540-89639-5_100","title":"Generation of Unit-Width Curve Skeletons Based on Valence Driven Spatial Median (VDSM)","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"University of Alberta","funders":"","keywords":"Skeletonization; Computer science; Medial axis; Algorithm; Artificial intelligence; Skeleton (computer programming); Representation (politics); Pattern recognition (psychology); Computer vision","score_opus":0.030401309674344828,"score_gpt":0.23136632562020623,"score_spread":0.2009650159458614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762825858","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.02385192,0.00013580055,0.9676931,0.00005982697,0.00009806238,0.00011917045,0.00030549068,0.004044927,0.0036917888],"genre_scores_gemma":[0.13104366,0.00013122728,0.8621598,0.000036360412,0.000028312548,0.00009338184,0.0011116941,0.0010034876,0.004392024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959224,0.000030273643,0.000019764431,0.00011662366,0.00019523004,0.00004594728],"domain_scores_gemma":[0.9993824,0.00014178951,0.000049146834,0.00015175324,0.00022524151,0.000049537022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042766938,0.0010766755,0.0013215598,0.001827501,0.0005073103,0.001015446,0.001332303,0.001259462,0.010620988],"category_scores_gemma":[0.0013638071,0.000775503,0.0013593769,0.0013897147,0.0005030265,0.000752513,0.0014024322,0.00094090437,0.0029706638],"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.00030167878,0.00013834049,0.0013073772,0.0003277117,0.00008870499,0.00028686432,0.00023126569,0.09917824,0.11376525,0.014745578,0.011591909,0.758037],"study_design_scores_gemma":[0.000036227604,0.00011798459,0.00063303986,0.000028471813,0.00003495693,0.00037437078,0.00007472385,0.95110023,0.032099135,0.0079695145,0.007500559,0.00003074705],"about_ca_topic_score_codex":0.0010438081,"about_ca_topic_score_gemma":0.002171962,"teacher_disagreement_score":0.010620988,"about_ca_system_score_codex":0.00034372884,"about_ca_system_score_gemma":0.00067899114,"threshold_uncertainty_score":0.035530746},"labels":[],"label_agreement":null},{"id":"W176300518","doi":"10.1007/978-3-642-35725-1_3","title":"Social Media Annotation and Tagging Based on Folksonomy Link Prediction in a Tripartite Graph","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Folksonomy; Computer science; Information retrieval; Metadata; Social media; Graph; World Wide Web; Annotation; tf–idf; Process (computing); Data mining; Artificial intelligence; Theoretical computer science; Term (time)","score_opus":0.014069718217494559,"score_gpt":0.24389403779240484,"score_spread":0.22982431957491029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176300518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20398282,0.0013499814,0.75317186,0.0008488193,0.0004467771,0.00063052255,0.014977945,0.0073891687,0.017202146],"genre_scores_gemma":[0.4851272,0.00075060787,0.47270426,0.00020300875,0.00019687807,0.00043724696,0.02387916,0.0005207641,0.016180916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.00026224382,0.00009005816,0.00044754395,0.00033195145,0.00010060981],"domain_scores_gemma":[0.9972811,0.0011212116,0.00021537773,0.00045222437,0.00078716193,0.0001428964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712656,0.000656305,0.0006173207,0.005840332,0.0011177011,0.001483269,0.0011596229,0.0009793973,0.002290052],"category_scores_gemma":[0.003427406,0.0003744394,0.0008044901,0.0052431147,0.00037750672,0.0027558135,0.001424146,0.0007670972,0.0028868825],"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.0012991052,0.0009820189,0.027171329,0.0012535563,0.0003419432,0.0011820245,0.0014386505,0.02018388,0.097560816,0.019415548,0.060076453,0.7690947],"study_design_scores_gemma":[0.000036710153,0.00013761064,0.022566346,0.00013680472,0.00027061644,0.00065558293,0.0007128495,0.8797512,0.03945115,0.026035437,0.030104842,0.00014079783],"about_ca_topic_score_codex":0.008174453,"about_ca_topic_score_gemma":0.021718225,"teacher_disagreement_score":0.008174453,"about_ca_system_score_codex":0.00064922875,"about_ca_system_score_gemma":0.00089376327,"threshold_uncertainty_score":0.01625371},"labels":[],"label_agreement":null},{"id":"W1763141270","doi":"10.1007/978-3-540-74260-9_88","title":"Prostate Tissue Texture Feature Extraction for Cancer Recognition in TRUS Images Using Wavelet Decomposition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Artificial intelligence; Computer science; Wavelet; Feature extraction; Pattern recognition (psychology); Classifier (UML); Computer vision; Feature (linguistics)","score_opus":0.03669333981086926,"score_gpt":0.36317167447875975,"score_spread":0.3264783346678905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763141270","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.06969979,0.0017619823,0.9243908,0.00014122184,0.00007192991,0.00006480434,0.00041408977,0.001294417,0.0021609527],"genre_scores_gemma":[0.32820126,0.0041936995,0.657427,0.00013178597,0.000094981275,0.000100652185,0.0011077988,0.00047368286,0.008269134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999206,0.000006824228,0.0000055716005,0.000013550944,0.000040190345,0.0000132231835],"domain_scores_gemma":[0.9998946,0.000036545032,0.000012515003,0.000012968372,0.00003534595,0.000007897344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016354655,0.00035873387,0.00041325777,0.0007489877,0.00009473992,0.00042922198,0.00030252975,0.00031959914,0.0019106868],"category_scores_gemma":[0.0003903282,0.00026809686,0.00041373534,0.00092710886,0.00012071961,0.00039810984,0.0002523238,0.00034825248,0.0012308365],"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.0001328281,0.000042481104,0.0010435163,0.00022310679,0.000023336625,0.00012457214,0.000040776024,0.003869083,0.40119645,0.0007996889,0.0021265827,0.5903776],"study_design_scores_gemma":[0.000033360502,0.00032619905,0.024213614,0.00010682276,0.00023224864,0.0032218113,0.00013365559,0.42678413,0.5266937,0.002316671,0.015873669,0.00006408769],"about_ca_topic_score_codex":0.0006015056,"about_ca_topic_score_gemma":0.0009918379,"teacher_disagreement_score":0.0019106868,"about_ca_system_score_codex":0.00010192468,"about_ca_system_score_gemma":0.00020005353,"threshold_uncertainty_score":0.006391883},"labels":[],"label_agreement":null},{"id":"W1763211909","doi":"10.1007/978-3-642-03741-2_11","title":"Approximating Labelled Markov Processes Again!","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Monad (category theory); Computer science; Probabilistic logic; State space; Construct (python library); Theoretical computer science; Markov process; Markov chain; Algebra over a field; Algorithm; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence; Programming language; Functor; Machine learning","score_opus":0.023109099672357903,"score_gpt":0.27179974507253474,"score_spread":0.24869064540017682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763211909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008868018,0.0003150498,0.9767975,0.00056047516,0.0001963847,0.000021812906,0.00009278007,0.00065252883,0.012495412],"genre_scores_gemma":[0.46548644,0.0012890028,0.48584616,0.0004480246,0.00023850455,0.00018516228,0.0007655107,0.0010528845,0.044688422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990969,0.00034877588,0.000042760654,0.00013937503,0.00027992742,0.00009234425],"domain_scores_gemma":[0.99757093,0.0013429237,0.00009731637,0.00063756085,0.00026958206,0.00008175594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479282,0.00084746606,0.0009868292,0.00059688266,0.0005685328,0.0018505766,0.0012785193,0.0011705657,0.01192039],"category_scores_gemma":[0.008903411,0.00065866165,0.0011291153,0.0009165748,0.001300208,0.00459666,0.0022375975,0.0025612665,0.0022639139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012969399,0.000042524352,0.00042666675,0.000120048266,0.000030190855,0.00007614499,0.00017653915,0.17260855,0.0021707325,0.7514043,0.0050225467,0.06779209],"study_design_scores_gemma":[0.000010412045,0.000018699957,0.000070056165,0.000025761876,0.000010884042,0.00003623001,0.000029480336,0.38146064,0.0014504025,0.6100045,0.0068715904,0.00001142456],"about_ca_topic_score_codex":0.0035368456,"about_ca_topic_score_gemma":0.003173556,"teacher_disagreement_score":0.01192039,"about_ca_system_score_codex":0.0016695441,"about_ca_system_score_gemma":0.0008124591,"threshold_uncertainty_score":0.039877713},"labels":[],"label_agreement":null},{"id":"W176329199","doi":"10.1007/978-3-319-13835-0_16","title":"Combining Static and Dynamic Impact Analysis for Large-Scale Enterprise Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"McMaster University","funders":"","keywords":"Static analysis; Computer science; Scalability; False positive paradox; Scale (ratio); Dynamic program analysis; Set (abstract data type); Work (physics); Industrial engineering; Distributed computing; Software; Machine learning; Programming language","score_opus":0.010436081523753863,"score_gpt":0.2736924838424286,"score_spread":0.26325640231867475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176329199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07775383,0.002527502,0.88793725,0.00057366246,0.00017207513,0.00018091282,0.0006030922,0.0040672733,0.026184436],"genre_scores_gemma":[0.80795395,0.0013412439,0.18353812,0.000109856875,0.00019826127,0.00013372634,0.0008054984,0.00052029337,0.005399049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985154,0.00034561596,0.000060120252,0.00013224395,0.00078163453,0.0001649344],"domain_scores_gemma":[0.9954978,0.0028505444,0.00021944194,0.00058647693,0.0007238536,0.000121899524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808312,0.0014494212,0.001021201,0.0040358384,0.0006409694,0.0023378,0.0013551752,0.00069277437,0.0050050146],"category_scores_gemma":[0.0053967806,0.00061188743,0.0013002426,0.0037531292,0.0006104716,0.0045241024,0.0016888992,0.0013558859,0.000818603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018193101,0.00031031398,0.009096655,0.0005486722,0.0004048882,0.0002330892,0.00021189351,0.5076101,0.010202929,0.05237418,0.005987271,0.41283807],"study_design_scores_gemma":[0.000008686495,0.000057702928,0.0023567684,0.00003165474,0.00009359895,0.00006145961,0.00009766922,0.92683095,0.0024280339,0.06537154,0.0026340317,0.000027804976],"about_ca_topic_score_codex":0.0050331373,"about_ca_topic_score_gemma":0.0074618473,"teacher_disagreement_score":0.0050331373,"about_ca_system_score_codex":0.0010448627,"about_ca_system_score_gemma":0.0011577234,"threshold_uncertainty_score":0.016743422},"labels":[],"label_agreement":null},{"id":"W1763401657","doi":"10.1007/3-540-45471-3_21","title":"A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":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":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Mathematics; Time complexity; Basis (linear algebra); Cycle basis; Discrete mathematics; Matrix (chemical analysis); Matrix multiplication; Oriented matroid; Graph","score_opus":0.012069325774437843,"score_gpt":0.2476371203445412,"score_spread":0.23556779457010335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763401657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16125302,0.00082279067,0.7992956,0.0014911409,0.00017120822,0.0005899672,0.0020032628,0.0056248563,0.028748278],"genre_scores_gemma":[0.23340045,0.00034157874,0.7512355,0.00018985702,0.00006696469,0.00033903532,0.0038938543,0.000691034,0.009841841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.000064377724,0.000029183188,0.00017532839,0.00012511408,0.00009343921],"domain_scores_gemma":[0.99900776,0.00046337568,0.00007685662,0.0002341748,0.0001233971,0.00009452606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045376737,0.0012530927,0.0013944886,0.0011915126,0.0009467514,0.0021784056,0.0024207423,0.0013646497,0.010744362],"category_scores_gemma":[0.0021629764,0.0008397028,0.0013366006,0.0022383386,0.0007647692,0.0029094215,0.0019090154,0.0018608778,0.0023541746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010360716,0.00062272843,0.0017565835,0.001136516,0.00017929108,0.00021495321,0.00052064046,0.07329129,0.037835304,0.08221808,0.042786486,0.75840217],"study_design_scores_gemma":[0.0008702305,0.0005193505,0.001655021,0.00011231486,0.00021768798,0.00059572863,0.0006173581,0.58066386,0.020198435,0.3725349,0.0219323,0.000082803155],"about_ca_topic_score_codex":0.0031342024,"about_ca_topic_score_gemma":0.005804029,"teacher_disagreement_score":0.010744362,"about_ca_system_score_codex":0.0016227645,"about_ca_system_score_gemma":0.0016435315,"threshold_uncertainty_score":0.03594345},"labels":[],"label_agreement":null},{"id":"W1763623545","doi":"10.1007/11424918_21","title":"Towards an Ontology-Based Spatial Clustering Framework","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cluster analysis; Computer science; Ontology; Data mining; Spatial analysis; Information retrieval; Artificial intelligence; Geography; Remote sensing","score_opus":0.02057685886093921,"score_gpt":0.2650080722306205,"score_spread":0.2444312133696813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763623545","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.0011260877,0.00013220287,0.99528044,0.00025543477,0.000040364186,0.0000725723,0.00027513504,0.00095710193,0.0018606025],"genre_scores_gemma":[0.016231515,0.0003564076,0.9795741,0.00013037966,0.00002971687,0.00017616009,0.0015303894,0.0002279442,0.0017433955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775654,0.00045570594,0.00031820897,0.0004322263,0.0008822829,0.00015501642],"domain_scores_gemma":[0.9985233,0.00026290477,0.000115631155,0.0003711209,0.0005524599,0.00017470928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028928898,0.00081071985,0.0013010752,0.0033992815,0.0022664797,0.0059579248,0.00463617,0.0017111241,0.0027664576],"category_scores_gemma":[0.0033740748,0.0009459755,0.0032298984,0.00560692,0.0019800984,0.006587278,0.005666538,0.0028077876,0.0017305146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006141329,0.00017301917,0.0010489376,0.00042448947,0.00018466162,0.0002949002,0.0013902938,0.035152555,0.004321047,0.7845882,0.013707237,0.15865323],"study_design_scores_gemma":[0.000031919793,0.000036915135,0.00067037245,0.00023045154,0.00017804805,0.00040824304,0.0010816049,0.2564082,0.0040176436,0.55990547,0.17695074,0.00008043913],"about_ca_topic_score_codex":0.02108806,"about_ca_topic_score_gemma":0.030056143,"teacher_disagreement_score":0.02108806,"about_ca_system_score_codex":0.002201023,"about_ca_system_score_gemma":0.004982277,"threshold_uncertainty_score":0.041930616},"labels":[],"label_agreement":null},{"id":"W1763657074","doi":"10.1007/11784203_15","title":"Sub-sampling for Efficient Spectral Mesh Processing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Sampling (signal processing); Measure (data warehouse); Algorithm; TRACE (psycholinguistics); Context (archaeology); Kernel (algebra); Pattern recognition (psychology); Artificial intelligence; Mathematics; Data mining; Computer vision","score_opus":0.01935876425803677,"score_gpt":0.2437447633353956,"score_spread":0.22438599907735884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763657074","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.003379813,0.00017433826,0.99309206,0.00005334829,0.00004158658,0.000013540527,0.000046167734,0.00019481473,0.0030044026],"genre_scores_gemma":[0.109691285,0.0006703426,0.88179326,0.00011623652,0.00009740567,0.00007954577,0.00027636948,0.00018161158,0.0070939767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979013,0.000055098237,0.0000085344445,0.000020323978,0.00011132379,0.000014559744],"domain_scores_gemma":[0.9996088,0.00020237337,0.00001650019,0.00010220808,0.000056744266,0.0000134615275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002618733,0.00052051456,0.00047197856,0.0004501838,0.00020049252,0.0004817895,0.0005140006,0.00053062633,0.005855615],"category_scores_gemma":[0.0011424582,0.00022407171,0.0002639284,0.0008311796,0.00033692856,0.0006869599,0.00070155907,0.0006857475,0.001563767],"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.0002526447,0.00009098246,0.0002912087,0.00021500261,0.0000373569,0.0001090077,0.00008940097,0.10113277,0.07962948,0.12274829,0.010087114,0.6853167],"study_design_scores_gemma":[0.000010593082,0.00003139342,0.00012263167,0.000014249983,0.0000073868036,0.00013669883,0.000022621884,0.94187784,0.016299287,0.032252092,0.009217462,0.000007700438],"about_ca_topic_score_codex":0.00037690313,"about_ca_topic_score_gemma":0.00096899236,"teacher_disagreement_score":0.005855615,"about_ca_system_score_codex":0.00019425168,"about_ca_system_score_gemma":0.00020656126,"threshold_uncertainty_score":0.019589007},"labels":[],"label_agreement":null},{"id":"W1763905908","doi":"10.1007/978-3-540-85988-8_43","title":"Segmenting Brain Tumors Using Pseudo–Conditional Random Fields","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":89,"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":"Conditional random field; Voxel; Discriminative model; Computer science; Artificial intelligence; Pattern recognition (psychology); Segmentation; Random forest; Support vector machine; Random field; Classifier (UML); Independent and identically distributed random variables; Random variable; Mathematics; Statistics","score_opus":0.02212737670928848,"score_gpt":0.28944609980205716,"score_spread":0.26731872309276866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763905908","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.057840973,0.0006245779,0.9391845,0.00025884592,0.000071635084,0.000057060755,0.0003043117,0.0010913254,0.0005667318],"genre_scores_gemma":[0.72598445,0.00064766844,0.26693633,0.00021487917,0.00023536701,0.00010248159,0.0024103005,0.00024331103,0.0032251417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995536,0.00010845663,0.00002620019,0.0001256656,0.00011106037,0.000074991134],"domain_scores_gemma":[0.99787235,0.0013502878,0.00018954337,0.00018770619,0.00033267768,0.00006738393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013176923,0.0006691703,0.0007531199,0.0021045643,0.0003341706,0.00080841477,0.0010024399,0.0012905895,0.0012698312],"category_scores_gemma":[0.0025134066,0.0004893848,0.0011432645,0.0010550085,0.00048327429,0.0011458047,0.0006663863,0.0008894137,0.0006657109],"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.001187083,0.00024159157,0.008123361,0.00022211125,0.00017476393,0.00052094774,0.00010375247,0.40557018,0.061804987,0.009385859,0.006564544,0.50610083],"study_design_scores_gemma":[0.000007896018,0.0000343937,0.0011636192,0.00000578255,0.000017833858,0.00012378253,0.000007951415,0.9888987,0.0064323638,0.002815623,0.00047967516,0.000012358784],"about_ca_topic_score_codex":0.00526399,"about_ca_topic_score_gemma":0.00556955,"teacher_disagreement_score":0.00526399,"about_ca_system_score_codex":0.00050147943,"about_ca_system_score_gemma":0.0008477996,"threshold_uncertainty_score":0.010466695},"labels":[],"label_agreement":null},{"id":"W1764137175","doi":"10.1007/978-3-642-13797-6_3","title":"A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplier (economics); Finite field; Arithmetic; NIST; Normal basis; Mathematics; Elliptic curve cryptography; Polynomial basis; Gaussian; GF(2); Algorithm; Computer science; Binary number; Discrete mathematics; Public-key cryptography; Galois theory; Encryption; Speech recognition","score_opus":0.03032124743674676,"score_gpt":0.2421403502562331,"score_spread":0.21181910281948635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764137175","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.08355849,0.0016115266,0.8520933,0.0007465283,0.001230759,0.00022431387,0.00037252164,0.0029711956,0.057191473],"genre_scores_gemma":[0.38988695,0.0008922485,0.5262779,0.00053018925,0.00039104966,0.00014942515,0.0005477668,0.00020712691,0.08111738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997415,0.00003796233,0.000015850188,0.000045319503,0.00012885171,0.000030533687],"domain_scores_gemma":[0.99987805,0.000020129773,0.00000976513,0.00003199317,0.000044341094,0.000015706744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018700851,0.00044446296,0.0005230543,0.0004772491,0.00035855387,0.00075037975,0.0006965569,0.00051021564,0.009820722],"category_scores_gemma":[0.00046262715,0.00016463947,0.00035840913,0.00063436,0.00028206472,0.0007616407,0.00077246124,0.000644129,0.004379346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011177172,0.00019806267,0.000535943,0.0004116258,0.000071353374,0.0008023957,0.00016159732,0.013524875,0.22381853,0.17087707,0.013035708,0.5754452],"study_design_scores_gemma":[0.00053672143,0.0022719312,0.0024248161,0.00021146424,0.00033090898,0.0076921284,0.0001448738,0.3252834,0.27797648,0.12962885,0.25325364,0.000244738],"about_ca_topic_score_codex":0.00030366456,"about_ca_topic_score_gemma":0.0007097929,"teacher_disagreement_score":0.009820722,"about_ca_system_score_codex":0.00040798768,"about_ca_system_score_gemma":0.00072379486,"threshold_uncertainty_score":0.032853603},"labels":[],"label_agreement":null},{"id":"W1764200853","doi":"10.1007/978-3-642-11245-4","title":"Transactions on Edutainment III","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Learning in Education","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":"Athabasca University","funders":"","keywords":"Computer science; Pleasure; Volume (thermodynamics); Series (stratigraphy); Multimedia; Computer graphics (images); Human–computer interaction; Psychology","score_opus":0.009058428206616197,"score_gpt":0.24980712637825478,"score_spread":0.24074869817163858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764200853","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067001916,0.01964312,0.034447595,0.0039710742,0.014532044,0.00011451367,0.0005518938,0.001450725,0.9185889],"genre_scores_gemma":[0.019393353,0.0055247056,0.0030828707,0.000384176,0.0007180704,0.000035183253,0.0005029534,0.00013246326,0.9702262],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954396,0.000057563204,0.000020187055,0.00006724149,0.00024063299,0.00007053719],"domain_scores_gemma":[0.9995486,0.000056572968,0.000013425628,0.000095353476,0.0002120274,0.00007400465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035909723,0.00080559787,0.00061496615,0.001039211,0.00059850956,0.0022987197,0.0009560407,0.0010241024,0.21329334],"category_scores_gemma":[0.0007609247,0.00018263407,0.0003329107,0.0015147474,0.00041816395,0.0009978081,0.0013805046,0.000980211,0.079039276],"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.00008321744,0.00011706209,0.0004965218,0.00025700385,0.00002427998,0.000085948675,0.00010856385,0.00118276,0.003883182,0.025032906,0.41556698,0.5531617],"study_design_scores_gemma":[0.0000065668596,0.00004872024,0.0008190863,0.00011041047,0.00001583091,0.0001075212,0.00009103025,0.0018277018,0.0010742266,0.0038273372,0.99206537,0.0000061066194],"about_ca_topic_score_codex":0.0023841201,"about_ca_topic_score_gemma":0.0046767658,"teacher_disagreement_score":0.21329334,"about_ca_system_score_codex":0.00072828325,"about_ca_system_score_gemma":0.0009612577,"threshold_uncertainty_score":0.71353734},"labels":[],"label_agreement":null},{"id":"W1764454094","doi":"10.1007/3-540-44693-1_48","title":"Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McGill University","funders":"","keywords":"Bounded function; Computer science; Order (exchange); Upper and lower bounds; Discrete mathematics; Mathematics","score_opus":0.007681388212035996,"score_gpt":0.22911991591952036,"score_spread":0.22143852770748437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764454094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150875,0.002818402,0.7292418,0.0010603712,0.0004104835,0.00018186907,0.00050445716,0.0018875959,0.048807554],"genre_scores_gemma":[0.74144274,0.001131479,0.2276588,0.0004781533,0.00022362996,0.00026829378,0.00056133076,0.00067721744,0.027558338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985461,0.00037237024,0.00011706282,0.00033014597,0.0003738205,0.00026054826],"domain_scores_gemma":[0.99808997,0.001043676,0.0001909341,0.00035125253,0.0002171664,0.00010694204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009810401,0.0010481193,0.0012149347,0.0008775653,0.00082850223,0.003979718,0.002001981,0.0012542821,0.0027416772],"category_scores_gemma":[0.0024563288,0.0010314411,0.0013295993,0.0011456923,0.0028409557,0.0067343726,0.0014629875,0.0033662573,0.00088052277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085992244,0.000021812066,0.00014559744,0.00013091847,0.000021192394,0.00024289382,0.0007389635,0.0036351993,0.008562494,0.971916,0.0009692755,0.013529808],"study_design_scores_gemma":[0.00004476611,0.000036556972,0.00016123417,0.00004595581,0.00003657176,0.00040074717,0.00018838252,0.020399017,0.0074887457,0.96012175,0.01103744,0.000038909868],"about_ca_topic_score_codex":0.00057156105,"about_ca_topic_score_gemma":0.0008951715,"teacher_disagreement_score":0.003979718,"about_ca_system_score_codex":0.00104138,"about_ca_system_score_gemma":0.0006417643,"threshold_uncertainty_score":0.009171784},"labels":[],"label_agreement":null},{"id":"W1764495584","doi":"10.1007/3-540-44886-1_7","title":"Enumerating the Preconditions of Agent Message Types","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Computer science; Set (abstract data type); Message passing; Type (biology); Theoretical computer science; Programming language","score_opus":0.022874538521153433,"score_gpt":0.24926475043281465,"score_spread":0.22639021191166123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764495584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017007194,0.0002614473,0.95668364,0.00045909375,0.00022650257,0.0005836742,0.0019650408,0.0056476663,0.017165735],"genre_scores_gemma":[0.13589528,0.00059878425,0.8381117,0.00029315203,0.00023314447,0.0008352709,0.0043120175,0.0024909095,0.017229741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994323,0.0015365136,0.0007605601,0.0008266611,0.0016787602,0.00087448856],"domain_scores_gemma":[0.97742873,0.014573514,0.0010757721,0.0034738434,0.0028931252,0.00055496587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00672844,0.0015440425,0.0015965923,0.0033632114,0.002577097,0.005249433,0.0022880265,0.0018046165,0.022427961],"category_scores_gemma":[0.020443583,0.0027397939,0.0027395946,0.0023384744,0.0028393823,0.01036688,0.003995034,0.00417237,0.005869196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070308376,0.00026716682,0.0032948286,0.0012428217,0.000093662595,0.0003744852,0.00196254,0.012668767,0.013467248,0.7287818,0.017147923,0.21999575],"study_design_scores_gemma":[0.00015927704,0.0001357324,0.0011271585,0.000429141,0.00018563888,0.0003010726,0.00051083474,0.056894198,0.034299307,0.8508431,0.05495693,0.00015775715],"about_ca_topic_score_codex":0.0043158047,"about_ca_topic_score_gemma":0.0070798504,"teacher_disagreement_score":0.022427961,"about_ca_system_score_codex":0.0020010988,"about_ca_system_score_gemma":0.004087617,"threshold_uncertainty_score":0.075028956},"labels":[],"label_agreement":null},{"id":"W1765368959","doi":"10.1007/978-3-319-08494-7_10","title":"Templates for Positive and Negative Control Toffoli Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Toffoli gate; Template; Computer science; Cube (algebra); Reduction (mathematics); Set (abstract data type); Arithmetic; Quantum gate; Electronic circuit; Quantum; Mathematics; Quantum computer; Combinatorics; Physics; Programming language; Quantum mechanics","score_opus":0.007475433881132365,"score_gpt":0.2234471548471578,"score_spread":0.21597172096602543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765368959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08664274,0.00063247426,0.74671704,0.0011138126,0.0007653234,0.00019551233,0.0004912757,0.0009412171,0.16250058],"genre_scores_gemma":[0.7950025,0.0005614712,0.13102083,0.00050818,0.00020962028,0.00045774996,0.00055703573,0.00056351,0.07111901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996475,0.00007992009,0.000018391334,0.000066968714,0.00013272736,0.000054479093],"domain_scores_gemma":[0.99930334,0.00031817448,0.000063481544,0.0001526893,0.00009526455,0.00006699279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617386,0.00045510998,0.00037671867,0.0006032194,0.00067453954,0.0013516453,0.0011023901,0.0011785323,0.011991888],"category_scores_gemma":[0.0025483416,0.00026515825,0.00038228024,0.00030563728,0.0011866869,0.0015032458,0.0008294047,0.0011076925,0.0016773662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033475568,0.0000135501405,0.00004328955,0.0000298575,0.000001965486,0.00003231846,0.000059706996,0.004309768,0.0027990863,0.97155106,0.0018492679,0.01927668],"study_design_scores_gemma":[0.000014474153,0.000021119586,0.00004346943,0.000017383602,0.0000031913366,0.00009003081,0.000028299102,0.04913278,0.005245425,0.9365619,0.008827608,0.000014324351],"about_ca_topic_score_codex":0.0003433802,"about_ca_topic_score_gemma":0.00044760076,"teacher_disagreement_score":0.011991888,"about_ca_system_score_codex":0.00079863745,"about_ca_system_score_gemma":0.00033978396,"threshold_uncertainty_score":0.040116847},"labels":[],"label_agreement":null},{"id":"W1765613701","doi":"10.1007/978-3-642-44973-4_40","title":"Identifying Key Algorithm Parameters and Instance Features Using Forward Selection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Key (lock); Salient; Set (abstract data type); Algorithm; Variety (cybernetics); Selection (genetic algorithm); Machine learning; Feature (linguistics); Artificial intelligence","score_opus":0.01973576009910112,"score_gpt":0.25015404467913993,"score_spread":0.23041828458003882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765613701","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.039786953,0.0006059936,0.949498,0.00035480343,0.00012900688,0.0002507706,0.00059287075,0.005509033,0.0032725434],"genre_scores_gemma":[0.375599,0.00036131882,0.61776805,0.00017807273,0.000103931925,0.00035076123,0.0018414978,0.0013376283,0.0024597237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973788,0.00068633637,0.0002453454,0.0007087335,0.00072874536,0.00025200096],"domain_scores_gemma":[0.99371284,0.003840507,0.0003374929,0.0011703711,0.00081736094,0.00012139615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032042633,0.0018927535,0.0023523162,0.0019813275,0.00072213926,0.0037078904,0.0030292948,0.002621527,0.0073176506],"category_scores_gemma":[0.0192435,0.0009656423,0.0016962715,0.001536948,0.0006195852,0.004807902,0.0014878155,0.0029385039,0.0034195387],"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.0014176638,0.0004028564,0.010729461,0.0006131057,0.00026855685,0.00034679016,0.0001308939,0.08401558,0.032115035,0.012121383,0.015158552,0.84268016],"study_design_scores_gemma":[0.00009885679,0.00016298325,0.0020594902,0.00008064971,0.0002476652,0.00028455025,0.00008502448,0.9430797,0.027562952,0.022540906,0.003754697,0.000042581523],"about_ca_topic_score_codex":0.0010169714,"about_ca_topic_score_gemma":0.0014221558,"teacher_disagreement_score":0.0073176506,"about_ca_system_score_codex":0.00089878764,"about_ca_system_score_gemma":0.0015756314,"threshold_uncertainty_score":0.024480045},"labels":[],"label_agreement":null},{"id":"W1765640641","doi":"10.1007/3-540-44886-1_32","title":"A Strategy for Improved Satisfaction of Selling Software Agents in E-Commerce","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Computer science; Quality (philosophy); Order (exchange); Software agent; Reinforcement learning; Value (mathematics); Business; Artificial intelligence; Machine learning","score_opus":0.10501046827372261,"score_gpt":0.3664614599028955,"score_spread":0.2614509916291729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765640641","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.27299738,0.00037379254,0.6717986,0.0038285041,0.00024304153,0.00027334888,0.00009724596,0.0006750395,0.04971303],"genre_scores_gemma":[0.9279874,0.0001131612,0.0627522,0.00029239076,0.00008068092,0.000101077814,0.000059376394,0.000066933535,0.008546757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986797,0.00064504537,0.00008356655,0.00016467168,0.00025858535,0.00016841832],"domain_scores_gemma":[0.99764156,0.0012396349,0.00014392639,0.0002735698,0.00042783396,0.0002735552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001964496,0.0006712842,0.0010653833,0.00047476942,0.00090792024,0.002112226,0.0016283339,0.0026465042,0.005903704],"category_scores_gemma":[0.0075534903,0.0003847664,0.00087641086,0.0007220832,0.001300758,0.003039268,0.0014002942,0.002210285,0.00077639695],"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.001449834,0.0010225625,0.0032335902,0.0004385422,0.00022649302,0.00074533577,0.0015178372,0.08130955,0.029854778,0.6901643,0.013400662,0.17663643],"study_design_scores_gemma":[0.0002332753,0.0005936233,0.0011874846,0.00003094517,0.00008254478,0.00036975433,0.00044700247,0.573143,0.004478202,0.41610798,0.0032845256,0.000041633695],"about_ca_topic_score_codex":0.00055574975,"about_ca_topic_score_gemma":0.00048227014,"teacher_disagreement_score":0.005903704,"about_ca_system_score_codex":0.0007516336,"about_ca_system_score_gemma":0.00083566934,"threshold_uncertainty_score":0.01974982},"labels":[],"label_agreement":null},{"id":"W1765644073","doi":"10.1007/978-3-540-69903-3_17","title":"A Uniform Approach Towards Succinct Representation of Trees","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Representation (politics); Binary tree; Theoretical computer science; Entropy (arrow of time); Set (abstract data type); Algorithm; Mathematics; Discrete mathematics","score_opus":0.02773717381977151,"score_gpt":0.2614565415251866,"score_spread":0.2337193677054151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765644073","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.0011513042,0.00036606647,0.99409074,0.00019932585,0.000115484676,0.00005763822,0.00021581922,0.00064412,0.00315954],"genre_scores_gemma":[0.03540614,0.0016244671,0.9501581,0.0004890595,0.00029847692,0.00035691375,0.0015981981,0.00081937213,0.009249158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664426,0.0006834582,0.00046631473,0.000551699,0.0014574867,0.00019689152],"domain_scores_gemma":[0.9944819,0.0012309294,0.00017080858,0.0030198195,0.0009349256,0.00016166804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017860791,0.0012214821,0.0013485015,0.0025484688,0.0009349599,0.0047877044,0.0045679067,0.0018647885,0.011439754],"category_scores_gemma":[0.009306332,0.0011213163,0.001793441,0.004698448,0.002005194,0.011152487,0.006466136,0.005786037,0.005196704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010979869,0.00007572219,0.00013663182,0.0003946502,0.00003395885,0.0001252364,0.0003072683,0.014039308,0.009153505,0.7328016,0.013044358,0.22977792],"study_design_scores_gemma":[0.000035891087,0.00007114281,0.00009903819,0.00019574267,0.000056141256,0.0004222338,0.000098991346,0.09273753,0.013127975,0.8320723,0.06103357,0.00004946078],"about_ca_topic_score_codex":0.00080296263,"about_ca_topic_score_gemma":0.0012072341,"teacher_disagreement_score":0.011439754,"about_ca_system_score_codex":0.0010619962,"about_ca_system_score_gemma":0.0011487511,"threshold_uncertainty_score":0.03826976},"labels":[],"label_agreement":null},{"id":"W1765763648","doi":"10.1007/3-540-46093-4_15","title":"View Serializable Updates of Concurrent Index Structures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Serialization; Theoretical computer science; Database transaction; Algorithm; Programming language; Transaction processing; Distributed transaction","score_opus":0.01774141678288299,"score_gpt":0.2455220773606002,"score_spread":0.2277806605777172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765763648","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.07967256,0.0014420677,0.82786006,0.00031479713,0.00062129414,0.00019484744,0.0010684057,0.010767365,0.07805868],"genre_scores_gemma":[0.67795545,0.0019054761,0.22050658,0.00023253156,0.00051676587,0.00022682025,0.0026085884,0.002692331,0.09335545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962616,0.000049236336,0.000023514656,0.000042118325,0.00022089166,0.000038010297],"domain_scores_gemma":[0.99899536,0.00027139141,0.000057211644,0.00045798288,0.00017046898,0.000047732603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189857,0.00043412636,0.0004979432,0.00070242945,0.0003822609,0.0018884372,0.0009999069,0.0003869647,0.013153764],"category_scores_gemma":[0.0018016881,0.00046508643,0.0002489309,0.0010910867,0.0005159948,0.0026501126,0.0009420876,0.0009015601,0.0016230034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012020462,0.00018763235,0.0013819865,0.00043795153,0.00006825894,0.00066838507,0.0010910644,0.02687687,0.06327014,0.4187945,0.039606534,0.44641465],"study_design_scores_gemma":[0.0003194465,0.00039404188,0.001831844,0.00009193691,0.00018070471,0.0009273533,0.00043730898,0.22816117,0.11553877,0.44392803,0.20811656,0.00007282053],"about_ca_topic_score_codex":0.0011885217,"about_ca_topic_score_gemma":0.001957301,"teacher_disagreement_score":0.013153764,"about_ca_system_score_codex":0.00040032057,"about_ca_system_score_gemma":0.00029890562,"threshold_uncertainty_score":0.044003725},"labels":[],"label_agreement":null},{"id":"W1765826407","doi":"10.1007/11780441_13","title":"Common Substrings in Random Strings","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Substring; Bernoulli's principle; Computer science; Word (group theory); Set (abstract data type); Algorithm; Bernoulli distribution; Markov chain; Theoretical computer science; Discrete mathematics; Random variable; Mathematics; Machine learning; Statistics","score_opus":0.011593716415367827,"score_gpt":0.23181203703787936,"score_spread":0.22021832062251154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765826407","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.17227864,0.0064360425,0.74497354,0.0014988298,0.00089676585,0.00022520375,0.00086458074,0.0015457082,0.07128068],"genre_scores_gemma":[0.72030336,0.0040448876,0.21262042,0.0006345839,0.0011252952,0.0003344159,0.0022724564,0.00091565977,0.057748996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765944,0.0004708478,0.00021410185,0.00048218053,0.0009805817,0.00019292068],"domain_scores_gemma":[0.99010414,0.0064466908,0.00064186275,0.0018027676,0.0007290233,0.00027543784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012910351,0.00057097897,0.0011290358,0.004047097,0.0012393107,0.00248288,0.001386623,0.0017694666,0.007897131],"category_scores_gemma":[0.012801361,0.0007579604,0.00094005,0.0055501275,0.0022681355,0.006568757,0.002556321,0.0017184732,0.0023129894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024022147,0.00005178741,0.0010713934,0.0003417627,0.00004248552,0.00078636647,0.0005991836,0.0100766225,0.005000645,0.8286694,0.0060733366,0.14704686],"study_design_scores_gemma":[0.000022381044,0.00005817382,0.00054684834,0.00009943701,0.000035638488,0.0013200655,0.00013530851,0.041445136,0.0040839706,0.93905675,0.013167513,0.00002871205],"about_ca_topic_score_codex":0.00044360608,"about_ca_topic_score_gemma":0.0005898325,"teacher_disagreement_score":0.007897131,"about_ca_system_score_codex":0.00087061257,"about_ca_system_score_gemma":0.00065362273,"threshold_uncertainty_score":0.026418567},"labels":[],"label_agreement":null},{"id":"W176591610","doi":"10.1007/978-3-642-39617-5_3","title":"Ontology Repositories Make a World of Difference","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Toronto","funders":"","keywords":"Computer science; Ontology; Interoperability; Reusability; IDEF5; Ontology components; Web Ontology Language; Upper ontology; Ontology language; Description logic; Process ontology; Open Biomedical Ontologies; Knowledge representation and reasoning; Software engineering; Ontology-based data integration; Representation (politics); Software; Information retrieval; World Wide Web; Semantic Web; Programming language; Ontology alignment; Artificial intelligence","score_opus":0.019404081602527278,"score_gpt":0.24157675978899948,"score_spread":0.2221726781864722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176591610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010206959,0.026717449,0.48408583,0.13603331,0.0070876493,0.00009841821,0.00092984264,0.0031778608,0.3316627],"genre_scores_gemma":[0.29075694,0.04468543,0.44609126,0.034429185,0.00611486,0.00044051625,0.0038842105,0.005601051,0.16799657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926795,0.0031223383,0.0005195516,0.00072366046,0.0025436534,0.00041142234],"domain_scores_gemma":[0.9844796,0.006515746,0.00053992606,0.0059181564,0.0017450314,0.00080155436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012654471,0.0008563615,0.0011281779,0.0047400906,0.0033144355,0.022698514,0.0031888508,0.005578433,0.012761525],"category_scores_gemma":[0.018999416,0.0011391176,0.0010909998,0.0057168333,0.012214602,0.096515276,0.013744655,0.009632233,0.007271846],"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.000019425406,0.000018199018,0.00013926956,0.00010047965,0.000021360978,0.00005954494,0.0013161757,0.00030395662,0.00030370918,0.93225694,0.019042097,0.04641886],"study_design_scores_gemma":[0.00000864871,0.000007949933,0.00008161743,0.00026820306,0.000018183926,0.00014345221,0.0009828474,0.00070372585,0.0003812167,0.6081129,0.38927087,0.000020360834],"about_ca_topic_score_codex":0.0017157977,"about_ca_topic_score_gemma":0.0019724774,"teacher_disagreement_score":0.022698514,"about_ca_system_score_codex":0.0018716609,"about_ca_system_score_gemma":0.0039086756,"threshold_uncertainty_score":0.066924036},"labels":[],"label_agreement":null},{"id":"W1766051081","doi":"10.1007/978-3-642-16001-1_24","title":"Sub-grid and Spot Detection in DNA Microarray Images Using Optimal Multi-level Thresholding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Windsor","funders":"","keywords":"Thresholding; Computer science; Normalization (sociology); Grid; Artificial intelligence; Cluster analysis; Pattern recognition (psychology); Affine transformation; Segmentation; Image segmentation; Transformation (genetics); Computer vision; Image (mathematics); Mathematics","score_opus":0.02740023440630657,"score_gpt":0.26907741406288566,"score_spread":0.2416771796565791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766051081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148946075,0.00030068812,0.9823638,0.0000781368,0.000031230215,0.000037765145,0.00010676053,0.0011353787,0.0010515461],"genre_scores_gemma":[0.06259313,0.0002934137,0.93425566,0.000045428224,0.000013738436,0.00008171195,0.00022358574,0.00028518753,0.002207996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963415,0.000059142927,0.000027593447,0.00007815732,0.00015216904,0.000048672195],"domain_scores_gemma":[0.9995278,0.00021313394,0.000034975867,0.00011012875,0.00009155166,0.000022352791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051547104,0.00050446886,0.00096743606,0.0010534553,0.00026415876,0.0008962537,0.0009932744,0.00074941677,0.0032499153],"category_scores_gemma":[0.0009723396,0.00063296553,0.00078854425,0.0016069273,0.00053620484,0.0008391116,0.00084779353,0.00070762687,0.0012579334],"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.00029520446,0.00007214207,0.0007630232,0.0005140456,0.000060916736,0.00015884587,0.00018521036,0.029445712,0.43393233,0.012176227,0.0031969345,0.5191994],"study_design_scores_gemma":[0.000027755119,0.000110691486,0.0043262397,0.000028355304,0.00004746818,0.0005971332,0.00006829729,0.73321384,0.23357943,0.020013232,0.007934685,0.000052851305],"about_ca_topic_score_codex":0.0008976601,"about_ca_topic_score_gemma":0.002099875,"teacher_disagreement_score":0.0032499153,"about_ca_system_score_codex":0.0005060109,"about_ca_system_score_gemma":0.0005145204,"threshold_uncertainty_score":0.010872066},"labels":[],"label_agreement":null},{"id":"W1766937764","doi":"10.1007/11503415_27","title":"Mind Change Efficient Learning","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Computer science; Class (philosophy); Order (exchange); Set (abstract data type); Point (geometry); Property (philosophy); Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Epistemology; Pure mathematics; Programming language","score_opus":0.018525096014301995,"score_gpt":0.2533129706236302,"score_spread":0.23478787460932818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766937764","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.037091587,0.0023087787,0.7379439,0.0050504887,0.0008311607,0.000079728976,0.0002221787,0.0017481727,0.21472402],"genre_scores_gemma":[0.602742,0.0017897903,0.21070878,0.0011796831,0.0005294751,0.00013157888,0.00048356465,0.00073371665,0.18170139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997247,0.000050934865,0.000009363134,0.00009014419,0.00009111575,0.000033637265],"domain_scores_gemma":[0.99910295,0.0003506465,0.000050445393,0.0003068661,0.0001285727,0.000060414226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045800567,0.00038248967,0.00034635462,0.0003685928,0.000373029,0.0011234772,0.0009244904,0.00075796765,0.01756224],"category_scores_gemma":[0.0029262018,0.0002656309,0.00036868753,0.00037440046,0.0010368881,0.0026570545,0.0011814868,0.0018566649,0.0031133636],"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.000085954714,0.00008410125,0.00042532556,0.00013788152,0.00005032645,0.00006780759,0.00019117832,0.015838074,0.005095792,0.622684,0.027469585,0.32786998],"study_design_scores_gemma":[0.000015550557,0.000039934872,0.00060325564,0.000022426013,0.000021679065,0.00011880094,0.000043232714,0.07222768,0.003759474,0.8838605,0.0392752,0.000012129141],"about_ca_topic_score_codex":0.0003697417,"about_ca_topic_score_gemma":0.00058048,"teacher_disagreement_score":0.01756224,"about_ca_system_score_codex":0.00051941525,"about_ca_system_score_gemma":0.00034796412,"threshold_uncertainty_score":0.058751523},"labels":[],"label_agreement":null},{"id":"W1767101516","doi":"10.1007/978-3-540-69355-0_1","title":"Mobile Entities Computing: Models and Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Computer science; Node (physics); Distributed computing; Context (archaeology); Artificial intelligence; Software; Grid; Robotics; Robot; Theoretical computer science; Programming language","score_opus":0.01643831299177643,"score_gpt":0.22437453166145327,"score_spread":0.20793621866967685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767101516","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0374566,0.13403486,0.6726278,0.047578525,0.0015981337,0.00017868615,0.00089310197,0.00041448182,0.10521776],"genre_scores_gemma":[0.68832535,0.11397059,0.1499127,0.0018026565,0.004288828,0.00058368256,0.0007878231,0.00023987296,0.040088497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985252,0.00056844205,0.000083437044,0.000307089,0.00033027004,0.00018549224],"domain_scores_gemma":[0.99644095,0.0026260265,0.00018275548,0.00028383464,0.00032659576,0.0001397802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021356153,0.0013164643,0.0020163571,0.0016132747,0.0021165272,0.009314526,0.003267746,0.0050627836,0.004656197],"category_scores_gemma":[0.0069565843,0.0014511973,0.0010643881,0.004933657,0.005668481,0.015682187,0.0021662053,0.004762413,0.0014893493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009622655,0.00002135696,0.00011858592,0.00008983327,0.0000065113745,0.000037627073,0.00011335864,0.010580013,0.00005036937,0.9774999,0.0037440406,0.0077289063],"study_design_scores_gemma":[0.0000049638434,0.000004309558,0.000050607545,0.0000415158,0.0000057252773,0.000051653893,0.00010858799,0.039526008,0.000054113716,0.95159405,0.008550035,0.000008510648],"about_ca_topic_score_codex":0.0046936427,"about_ca_topic_score_gemma":0.0026161964,"teacher_disagreement_score":0.009314526,"about_ca_system_score_codex":0.0038434858,"about_ca_system_score_gemma":0.0018538542,"threshold_uncertainty_score":0.02788657},"labels":[],"label_agreement":null},{"id":"W1767305221","doi":"10.1007/978-3-642-23771-3_16","title":"Balancing Act: Enabling Public Engagement with Sustainability Issues through a Multi-touch Tabletop Collaborative Game","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Sustainability; Citizen journalism; Style (visual arts); Public engagement; Participatory design; Human–computer interaction; Collaborative learning; Multimedia; Public relations; Knowledge management; World Wide Web; Political science; Visual arts","score_opus":0.03651059416254734,"score_gpt":0.29610065909289124,"score_spread":0.2595900649303439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767305221","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.6425552,0.0005301729,0.27703106,0.0009546594,0.00019161135,0.0012310648,0.0002519496,0.002826896,0.074427254],"genre_scores_gemma":[0.8467798,0.0002847861,0.13943309,0.0002077181,0.00002591483,0.0007620411,0.00021767196,0.00014307087,0.012145851],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931765,0.00034311088,0.000025069023,0.00008181088,0.00014726001,0.000085141124],"domain_scores_gemma":[0.9993647,0.0003990474,0.00003950417,0.000050128427,0.00003421374,0.00011247639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008377574,0.0010104491,0.00029366443,0.0003907726,0.0006059986,0.0023130092,0.0011268348,0.0010463648,0.004947547],"category_scores_gemma":[0.00181788,0.0002128486,0.0003921945,0.00019287044,0.0010763801,0.0016875138,0.002620506,0.0007159915,0.00073029066],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003667864,0.004269922,0.014101429,0.002313057,0.00026652295,0.0022679765,0.035869084,0.04520905,0.24762757,0.04779114,0.022393104,0.5742232],"study_design_scores_gemma":[0.0011997183,0.008009113,0.044496093,0.0011159134,0.00048110876,0.0034649547,0.021813694,0.3949615,0.13103661,0.040892508,0.35189795,0.00063081953],"about_ca_topic_score_codex":0.0013539194,"about_ca_topic_score_gemma":0.0021440743,"teacher_disagreement_score":0.004947547,"about_ca_system_score_codex":0.00033414,"about_ca_system_score_gemma":0.00038744567,"threshold_uncertainty_score":0.016551197},"labels":[],"label_agreement":null},{"id":"W1767311454","doi":"10.1007/11550518_62","title":"Object Categorization and the Need for Many-to-Many Matching","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Categorization; Computer science; Cognitive neuroscience of visual object recognition; Bridging (networking); Artificial intelligence; Object (grammar); Matching (statistics); Bridge (graph theory); Pattern recognition (psychology); Natural language processing; Computer vision; Mathematics","score_opus":0.013195913436647382,"score_gpt":0.26796850077666995,"score_spread":0.25477258734002256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767311454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030156925,0.0073088994,0.9441036,0.004160028,0.00062994484,0.00017516474,0.0002956211,0.0031819232,0.00998779],"genre_scores_gemma":[0.2709993,0.0050898218,0.7076075,0.0018383412,0.00093390816,0.00019510185,0.0011822543,0.000769698,0.011384071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994951,0.0010886866,0.00041104492,0.0014635134,0.0016773775,0.00040838757],"domain_scores_gemma":[0.9805268,0.011695162,0.00082839665,0.0045509012,0.001927629,0.00047115347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048880745,0.0009918568,0.0043881265,0.0026348324,0.0033530036,0.0062356065,0.0076316036,0.0056617926,0.014606422],"category_scores_gemma":[0.030539047,0.0019431731,0.001603686,0.0059050117,0.004131099,0.0291479,0.007124548,0.0038473618,0.007263541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006531808,0.0003111204,0.0020928145,0.0008134426,0.00014749152,0.00038977456,0.00029116138,0.016708568,0.011033012,0.11752528,0.02453375,0.8255004],"study_design_scores_gemma":[0.00008132117,0.00017086216,0.0013749626,0.00007880475,0.00009581627,0.001980817,0.0004978277,0.20795913,0.009362768,0.7639739,0.014332666,0.00009115985],"about_ca_topic_score_codex":0.0032442298,"about_ca_topic_score_gemma":0.0039106477,"teacher_disagreement_score":0.014606422,"about_ca_system_score_codex":0.0017212975,"about_ca_system_score_gemma":0.0016252146,"threshold_uncertainty_score":0.04886335},"labels":[],"label_agreement":null},{"id":"W176842924","doi":"10.1007/978-3-642-32241-9_20","title":"Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba","funders":"","keywords":"Computer science","score_opus":0.020343941132421394,"score_gpt":0.25884062245426426,"score_spread":0.23849668132184287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176842924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43993828,0.0006918538,0.53832126,0.00032681,0.000118933815,0.00023335151,0.0017293543,0.002512866,0.016127357],"genre_scores_gemma":[0.4908152,0.00029542114,0.49688455,0.00008764909,0.000035870846,0.00017999,0.004042454,0.0010092636,0.0066496357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993843,0.00011614903,0.00004361541,0.00014991633,0.00017394382,0.00013214257],"domain_scores_gemma":[0.9979504,0.0012493695,0.00015733055,0.00030958618,0.00017657563,0.00015690381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039964644,0.0012917627,0.0018414968,0.0012711878,0.0008009231,0.002368634,0.001681807,0.0012795414,0.008663675],"category_scores_gemma":[0.0036975998,0.0013700266,0.0011349212,0.0017846072,0.00090821786,0.0026107957,0.0022667935,0.0012174567,0.0014539486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002117927,0.00030463398,0.0034873455,0.00082178804,0.00012767961,0.00037383262,0.00082086964,0.6713502,0.025927791,0.049394544,0.013040881,0.23223253],"study_design_scores_gemma":[0.000106829764,0.00017658526,0.00066211744,0.000053092568,0.000026391432,0.00009939441,0.00024074804,0.9498277,0.0050419397,0.04108303,0.0026599858,0.000022171631],"about_ca_topic_score_codex":0.0041201124,"about_ca_topic_score_gemma":0.009619813,"teacher_disagreement_score":0.008663675,"about_ca_system_score_codex":0.0008099249,"about_ca_system_score_gemma":0.0008776828,"threshold_uncertainty_score":0.028982937},"labels":[],"label_agreement":null},{"id":"W1768532251","doi":"10.1007/978-3-540-25956-5_26","title":"Uncertainty in Knowledge Provenance","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Toronto","funders":"","keywords":"Provenance; Computer science; Information retrieval; Data science; Knowledge management; Data mining","score_opus":0.017935551405044225,"score_gpt":0.28713148067737193,"score_spread":0.2691959292723277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768532251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018400596,0.006391226,0.9209952,0.0070195924,0.00054674945,0.00012351973,0.000507708,0.00031017367,0.045705304],"genre_scores_gemma":[0.7643923,0.005816684,0.20344673,0.00044867117,0.00079764525,0.00022061897,0.001003268,0.00021842061,0.023655605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426395,0.0021080566,0.0005852385,0.0007903142,0.0019867436,0.00026567662],"domain_scores_gemma":[0.9698343,0.020801753,0.0011590609,0.0053004804,0.002430841,0.00047350265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006558254,0.00047205348,0.001040102,0.0025404042,0.0021536087,0.0073856236,0.0013650131,0.0019006795,0.006055578],"category_scores_gemma":[0.04667875,0.0010798286,0.0010390126,0.0033007374,0.005268991,0.021184811,0.0039301175,0.0033373288,0.0008470866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037677728,0.000012919928,0.00039231562,0.00009184753,0.000020612324,0.00010610897,0.0005526905,0.0064221225,0.00018899777,0.95005614,0.0020780698,0.040040478],"study_design_scores_gemma":[0.000003350173,0.00000499683,0.00007180748,0.000034219804,0.000011029502,0.00006778061,0.00009420229,0.012470556,0.0003410898,0.9802761,0.0066156955,0.000009049341],"about_ca_topic_score_codex":0.0033831608,"about_ca_topic_score_gemma":0.0021862846,"teacher_disagreement_score":0.0073856236,"about_ca_system_score_codex":0.0025490592,"about_ca_system_score_gemma":0.001999178,"threshold_uncertainty_score":0.034683764},"labels":[],"label_agreement":null},{"id":"W1768636550","doi":"10.1007/978-3-319-13524-3_21","title":"Reconfiguration over Tree Decompositions","year":2014,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Control reconfiguration; Vertex (graph theory); Parameterized complexity; Combinatorics; Bounded function; Feedback vertex set; Mathematics; Discrete mathematics; Cardinality (data modeling); Graph; Dominating set; Pathwidth; Computer science; Line graph","score_opus":0.020282838400060097,"score_gpt":0.31319455821428005,"score_spread":0.29291171981421993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768636550","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.3167509,0.0014982825,0.59640247,0.0010920351,0.0005061039,0.000262145,0.0013533112,0.0060083815,0.07612635],"genre_scores_gemma":[0.8250901,0.0008221197,0.15338922,0.0002882317,0.00017220688,0.00012759356,0.0018538481,0.001314206,0.01694242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993475,0.00012593214,0.00004293297,0.0001703974,0.00013029398,0.00018298031],"domain_scores_gemma":[0.9984763,0.0004509997,0.00014965991,0.00052374165,0.00017076822,0.00022852361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915452,0.0005697349,0.00071392395,0.0010787335,0.00072321395,0.0018503042,0.00079664454,0.0006659711,0.012853701],"category_scores_gemma":[0.0022911646,0.0004839053,0.0006657632,0.0015727428,0.0006881472,0.002750655,0.0019510457,0.0013911217,0.0017699172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012060042,0.00027029932,0.0017363428,0.0007335561,0.00015179977,0.0012646592,0.0009561811,0.11097065,0.061939266,0.41674837,0.03161482,0.3724079],"study_design_scores_gemma":[0.000097877135,0.00014377116,0.0011184366,0.00010308665,0.00009172905,0.00060295494,0.00046762638,0.24186338,0.01537443,0.7028801,0.03721026,0.000046452344],"about_ca_topic_score_codex":0.00087950693,"about_ca_topic_score_gemma":0.0011236035,"teacher_disagreement_score":0.012853701,"about_ca_system_score_codex":0.00067260885,"about_ca_system_score_gemma":0.00034734778,"threshold_uncertainty_score":0.042999923},"labels":[],"label_agreement":null},{"id":"W176867143","doi":"10.1007/978-3-642-33119-0_16","title":"Boosting Search Based Testing by Using Constraint Based Testing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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","funders":"","keywords":"Computer science; Population; Boosting (machine learning); Selection (genetic algorithm); Constraint (computer-aided design); Test case; Evolutionary computation; Evolutionary algorithm; Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.07689082099450231,"score_gpt":0.29115087053938743,"score_spread":0.21426004954488512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176867143","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.03188239,0.00044218323,0.95847243,0.00020080662,0.0000935416,0.00011647104,0.00010262822,0.002593767,0.0060958434],"genre_scores_gemma":[0.5416528,0.0001553286,0.45270973,0.00029771603,0.000104744475,0.00018706836,0.00042033664,0.0006460648,0.0038261448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968425,0.00089107157,0.00013806537,0.00041822475,0.0013934099,0.00031672997],"domain_scores_gemma":[0.99045765,0.006127492,0.00038434286,0.0012946163,0.0014738456,0.00026202857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023101126,0.001147723,0.0018265609,0.0017172121,0.00044362003,0.0009547781,0.0034387738,0.0015945217,0.006343013],"category_scores_gemma":[0.011800775,0.0006067962,0.0010966674,0.001931028,0.0009985213,0.0020512042,0.0017690656,0.0015838855,0.0010566784],"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.0005595218,0.00040816786,0.0038157708,0.00027943891,0.0001364375,0.00031218556,0.0000731776,0.42340484,0.01923904,0.03996909,0.0073813116,0.50442094],"study_design_scores_gemma":[0.000021226266,0.000055553533,0.00027452188,0.000009838847,0.000018817684,0.00006701572,0.0000036734912,0.9861691,0.0019994685,0.010619311,0.0007542145,0.0000071943628],"about_ca_topic_score_codex":0.002688286,"about_ca_topic_score_gemma":0.0030370366,"teacher_disagreement_score":0.006343013,"about_ca_system_score_codex":0.00083522557,"about_ca_system_score_gemma":0.0012306818,"threshold_uncertainty_score":0.021219492},"labels":[],"label_agreement":null},{"id":"W1768688475","doi":"10.1007/978-3-642-38771-5_23","title":"Subword Complexity and k-Synchronization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sequence (biology); Synchronization (alternating current); Contrast (vision); Function (biology); Algorithm; Arithmetic; Discrete mathematics; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Telecommunications; Biology","score_opus":0.019010154914770146,"score_gpt":0.22842723487517438,"score_spread":0.20941707996040423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768688475","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.29125893,0.006735676,0.35693264,0.006306646,0.001113229,0.000120940844,0.0006821757,0.0010459349,0.33580396],"genre_scores_gemma":[0.9320946,0.0017938068,0.019635528,0.00040758163,0.000730398,0.00013549495,0.00037178924,0.00022193373,0.044608798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999185,0.00017440673,0.000085646025,0.00021042566,0.0002079497,0.00013655257],"domain_scores_gemma":[0.99687,0.0020290723,0.00025803305,0.00041226528,0.00026217947,0.00016858982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004983515,0.00047516872,0.0009033336,0.0011067352,0.0014507766,0.0035755746,0.000912445,0.0013256157,0.014932995],"category_scores_gemma":[0.004246079,0.00038741942,0.00088992907,0.0018434505,0.0026239257,0.0084718065,0.002117989,0.0022341053,0.0022316289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038529957,0.000009767603,0.00008907921,0.000056443198,0.000007901594,0.00004958099,0.00020811209,0.0014370357,0.00076114974,0.98669446,0.0016307518,0.009017126],"study_design_scores_gemma":[0.0000062986305,0.000006294991,0.000058543552,0.0000067253754,0.000004661349,0.000038692826,0.000039686358,0.0026050431,0.0002987215,0.9945024,0.0024252571,0.000007639346],"about_ca_topic_score_codex":0.00064515223,"about_ca_topic_score_gemma":0.0004852155,"teacher_disagreement_score":0.014932995,"about_ca_system_score_codex":0.0015896661,"about_ca_system_score_gemma":0.00078388833,"threshold_uncertainty_score":0.049955845},"labels":[],"label_agreement":null},{"id":"W1768975796","doi":"10.1007/10968987_2","title":"TrellisDAG: A System for Structured DAG Scheduling","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.020117268101126705,"score_gpt":0.2457729496354074,"score_spread":0.2256556815342807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768975796","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008384706,0.0005955247,0.50394374,0.00018918885,0.00036744255,0.0003557984,0.005084506,0.46969956,0.01137948],"genre_scores_gemma":[0.12590225,0.0008591698,0.77978265,0.0006717131,0.00024449968,0.001087991,0.021715058,0.044430446,0.02530626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999308,0.00015500493,0.00006696774,0.0001718314,0.00018607012,0.00011218356],"domain_scores_gemma":[0.9983878,0.00044587912,0.000114195944,0.00059387967,0.00024922477,0.00020913646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016186945,0.0016698994,0.0013515358,0.0017428917,0.0010086899,0.002054646,0.0040131854,0.00095543143,0.03360483],"category_scores_gemma":[0.0034862163,0.0015476163,0.0012900892,0.0022173643,0.00059838325,0.0024502804,0.0018010802,0.002071283,0.012633184],"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.0032060998,0.0004508548,0.0016865709,0.0012597558,0.00034586719,0.00032760852,0.00038600503,0.061601277,0.043314755,0.031527616,0.35459808,0.5012954],"study_design_scores_gemma":[0.0016328832,0.0005688161,0.0011758666,0.00014037582,0.0002460923,0.00037503574,0.00009710012,0.6205874,0.06928998,0.055444416,0.25015652,0.00028554365],"about_ca_topic_score_codex":0.0067372187,"about_ca_topic_score_gemma":0.008977598,"teacher_disagreement_score":0.03360483,"about_ca_system_score_codex":0.0015003005,"about_ca_system_score_gemma":0.002558963,"threshold_uncertainty_score":0.11241937},"labels":[],"label_agreement":null},{"id":"W1769260096","doi":"10.1007/3-540-45745-3_15","title":"Towards Specification-Based Web Testing","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Windsor","funders":"","keywords":"Computer science; Web testing; Correctness; Robustness (evolution); Software engineering; Non-regression testing; Web application; Software performance testing; Web modeling; Robustness testing; White-box testing; Reliability engineering; Web service; Programming language; Web application security; Web development; World Wide Web; Software construction; Software development; Software","score_opus":0.04896644395236944,"score_gpt":0.2608482569094928,"score_spread":0.21188181295712338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769260096","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.0021853514,0.0001616004,0.99171185,0.0002491461,0.000036241534,0.000054922442,0.000021759495,0.0015520179,0.004027135],"genre_scores_gemma":[0.095374964,0.0005782383,0.89485675,0.00034456622,0.000050629023,0.00022712283,0.0003962521,0.00085983804,0.0073116072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9916721,0.0030555683,0.0005252572,0.0006466593,0.0037071572,0.00039321926],"domain_scores_gemma":[0.98382866,0.008604982,0.0004609245,0.004195971,0.002634562,0.0002749145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061841654,0.0012411937,0.0009827394,0.0019796847,0.00066840317,0.0038198193,0.003907801,0.002341529,0.0064418125],"category_scores_gemma":[0.018147595,0.0017679604,0.0013674559,0.0013745249,0.0028286388,0.0063053053,0.0040686014,0.0054405676,0.0034504724],"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.00019308753,0.00043129473,0.0015473949,0.0005219283,0.00009313625,0.0005022836,0.0009207049,0.050824657,0.017616222,0.465674,0.0117704915,0.4499047],"study_design_scores_gemma":[0.000073694406,0.00010210965,0.0003247722,0.00026613584,0.000073611656,0.00044291047,0.00019975156,0.5553068,0.02676932,0.38159478,0.034803614,0.000042529726],"about_ca_topic_score_codex":0.001971145,"about_ca_topic_score_gemma":0.0022630084,"teacher_disagreement_score":0.0064418125,"about_ca_system_score_codex":0.0010738682,"about_ca_system_score_gemma":0.0015356314,"threshold_uncertainty_score":0.032705367},"labels":[],"label_agreement":null},{"id":"W176952057","doi":"10.1007/978-3-642-23199-5_9","title":"Parameter-Free Anomaly Detection for Categorical Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Université de Sherbrooke","funders":"","keywords":"Categorical variable; Anomaly detection; Computer science; Outlier; Data mining; Preprocessor; Set (abstract data type); Similarity (geometry); Artificial intelligence; Data set; Measure (data warehouse); Similarity measure; Data pre-processing; Pattern recognition (psychology); Machine learning; Image (mathematics)","score_opus":0.050451300976941706,"score_gpt":0.2740340784227595,"score_spread":0.2235827774458178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176952057","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.007612833,0.00015856551,0.9895968,0.000098966826,0.000036544712,0.000021552272,0.00015856234,0.0020506473,0.0002655027],"genre_scores_gemma":[0.3898743,0.00030568914,0.60390997,0.00016641077,0.00019340953,0.00015930264,0.0020770652,0.00069038064,0.0026235373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454665,0.001283432,0.00047477934,0.0011755767,0.0021634581,0.00035600847],"domain_scores_gemma":[0.98253804,0.008572688,0.0009880649,0.0056078704,0.0020338097,0.00025950145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042461352,0.00087596336,0.0022213357,0.0018979984,0.00056501117,0.0018338583,0.004229306,0.0014599742,0.0016050608],"category_scores_gemma":[0.023201171,0.0007204377,0.0013959436,0.0027076064,0.0012858766,0.003969803,0.0028173712,0.0031513898,0.0010768648],"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.0007256525,0.00025884103,0.010773917,0.00031858342,0.00027970874,0.0002650168,0.00020269195,0.15669106,0.022350477,0.04117403,0.01004056,0.7569194],"study_design_scores_gemma":[0.000016041422,0.00007425406,0.0010281041,0.000014820773,0.000024105291,0.00034337444,0.000025009043,0.91150117,0.007960887,0.07698382,0.0019935574,0.000034855053],"about_ca_topic_score_codex":0.0012657733,"about_ca_topic_score_gemma":0.0012599102,"teacher_disagreement_score":0.0042461352,"about_ca_system_score_codex":0.0007829496,"about_ca_system_score_gemma":0.0010201032,"threshold_uncertainty_score":0.02245593},"labels":[],"label_agreement":null},{"id":"W1769669223","doi":"10.1007/978-3-642-01307-2_19","title":"A Statistical Approach for Binary Vectors Modeling and Clustering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Feature selection; Artificial intelligence; Binary number; Pattern recognition (psychology); Selection (genetic algorithm); Feature (linguistics); Statistical model; Data mining; Model selection; Machine learning; Mathematics","score_opus":0.031455562077756634,"score_gpt":0.27852840906590476,"score_spread":0.24707284698814813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769669223","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.00014719885,0.0001881417,0.999156,0.0000526114,0.000025072475,0.0000127030835,0.00003463613,0.00009171821,0.00029189154],"genre_scores_gemma":[0.010532489,0.0007053788,0.98503774,0.00012432817,0.0001760498,0.00028428703,0.000421483,0.00021856556,0.0024997492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945951,0.0023585432,0.00039389567,0.0008738886,0.0015957073,0.00018280704],"domain_scores_gemma":[0.9934949,0.0042589847,0.00029910126,0.00096000824,0.000839639,0.00014730923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004758297,0.0016882923,0.0025507512,0.0029381826,0.0015402781,0.0032678796,0.007348289,0.002924216,0.005752409],"category_scores_gemma":[0.015535668,0.0021276819,0.0036479481,0.0071363766,0.0024126926,0.0039451728,0.0036799647,0.0051126396,0.0033531426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005142218,0.00008539568,0.00038773156,0.00038087758,0.00020116226,0.000097858196,0.0003710421,0.13972175,0.0014742463,0.6185015,0.0114982845,0.22722869],"study_design_scores_gemma":[0.000010034148,0.000020795738,0.00018009893,0.00004770035,0.00003308108,0.00011373265,0.000031406227,0.46190333,0.0004969626,0.52768075,0.009438412,0.000043657074],"about_ca_topic_score_codex":0.0051213065,"about_ca_topic_score_gemma":0.0059558353,"teacher_disagreement_score":0.007348289,"about_ca_system_score_codex":0.0015997391,"about_ca_system_score_gemma":0.001799811,"threshold_uncertainty_score":0.025164604},"labels":[],"label_agreement":null},{"id":"W1769768582","doi":"10.1007/978-3-642-20398-5_8","title":"Towards Flight Control Verification Using Automated Theorem Proving","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Autopilot; Leverage (statistics); MATLAB; Computer science; Plot (graphics); Automated theorem proving; Controller (irrigation); Process (computing); Control engineering; Control theory (sociology); Control (management); Engineering; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.033890827422019494,"score_gpt":0.2816612213300191,"score_spread":0.2477703939079996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769768582","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.0015834996,0.0002385641,0.99017555,0.00011464369,0.00007658483,0.000048334576,0.000033909364,0.0010828755,0.006645983],"genre_scores_gemma":[0.107445665,0.0007767769,0.87996787,0.00018309816,0.00008997434,0.00013503116,0.00022386722,0.00045646308,0.0107212905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.00043648406,0.00010018913,0.00020280223,0.0009545415,0.00011863785],"domain_scores_gemma":[0.9979564,0.0011666156,0.00007009563,0.0005403267,0.00024427846,0.000022285662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802359,0.0010963707,0.00070814695,0.0009911025,0.00063705095,0.0020403487,0.0019455946,0.0013567003,0.011002067],"category_scores_gemma":[0.0037411351,0.00096589385,0.0015944828,0.0005621907,0.0018528961,0.0032706514,0.0022139563,0.0027658788,0.0035866923],"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.00013756836,0.00012923634,0.00029164163,0.0007769482,0.00010357521,0.00028979362,0.00030597567,0.080619134,0.02742447,0.47873405,0.009256573,0.4019309],"study_design_scores_gemma":[0.00007577283,0.000119889504,0.00021631377,0.00026632627,0.00008677983,0.0003652435,0.000053089552,0.46405494,0.038122326,0.43584242,0.06075385,0.000043089076],"about_ca_topic_score_codex":0.0010249511,"about_ca_topic_score_gemma":0.0008964664,"teacher_disagreement_score":0.011002067,"about_ca_system_score_codex":0.00057132496,"about_ca_system_score_gemma":0.00096695556,"threshold_uncertainty_score":0.03680557},"labels":[],"label_agreement":null},{"id":"W177008603","doi":"10.1007/978-3-642-32284-6_2","title":"Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Université de Montréal; University of Waterloo","funders":"","keywords":"Correctness; Robustness (evolution); Computer science; Computation; Theoretical computer science; Secure multi-party computation; Voting; Algorithm","score_opus":0.026432498549224772,"score_gpt":0.269511752620335,"score_spread":0.24307925407111022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177008603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081305295,0.0018925826,0.85660475,0.008115244,0.0005843319,0.00011488704,0.00014197051,0.0004922523,0.05074865],"genre_scores_gemma":[0.92139435,0.0006358505,0.067472465,0.000519698,0.0006194056,0.00013047658,0.00006578492,0.00022176615,0.008940344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98907954,0.004627707,0.00064365135,0.0015660981,0.0031500652,0.00093304197],"domain_scores_gemma":[0.96176755,0.02573107,0.0016055128,0.009330445,0.0009492539,0.00061625737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00864768,0.0010213441,0.0017635428,0.00079961173,0.0019646306,0.0062914668,0.0024173385,0.0038600892,0.0027119543],"category_scores_gemma":[0.03609864,0.00091428304,0.0021498809,0.0011369241,0.009231194,0.01457953,0.0056152977,0.0087380335,0.000748987],"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.0001665473,0.00003246163,0.00018389223,0.00006891002,0.00004132648,0.00009331201,0.00019957733,0.009682615,0.0019853204,0.9750363,0.0010951246,0.011414612],"study_design_scores_gemma":[0.000014155539,0.000020966789,0.000046819314,0.000010671463,0.000010010745,0.000038383965,0.000012580355,0.028566733,0.0011096282,0.96942073,0.00073660567,0.000012761247],"about_ca_topic_score_codex":0.00019564615,"about_ca_topic_score_gemma":0.00013280884,"teacher_disagreement_score":0.00864768,"about_ca_system_score_codex":0.0016198439,"about_ca_system_score_gemma":0.00095098093,"threshold_uncertainty_score":0.04573387},"labels":[],"label_agreement":null},{"id":"W1770582710","doi":"10.1007/978-3-662-44736-9_28","title":"The Effect of Coercive Power on Supply Chain Inventory Replenishment Decisions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Laval","keywords":"Supply chain; Power (physics); Order (exchange); Computer science; Context (archaeology); Business; Risk analysis (engineering); Reliability engineering; Marketing; Engineering","score_opus":0.013102232947927539,"score_gpt":0.22673773139464068,"score_spread":0.21363549844671315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1770582710","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.9480516,0.00045943534,0.009974351,0.0015462306,0.000083530664,0.000032724118,0.0000971431,0.000082651015,0.039672296],"genre_scores_gemma":[0.9975535,0.000102307735,0.0004685674,0.000032106585,0.00001884528,0.0000048138136,0.000008529007,0.000010034131,0.0018013504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852175,0.00079722475,0.000071504306,0.000105014165,0.00019435608,0.0003101554],"domain_scores_gemma":[0.9108712,0.08105592,0.003035089,0.002018043,0.001524425,0.0014954561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003982792,0.00039163948,0.0007177332,0.0004611773,0.00062361767,0.002805431,0.00092749274,0.0010750269,0.014761893],"category_scores_gemma":[0.04465246,0.00040936665,0.00046037763,0.0005132625,0.0022325006,0.002675257,0.0011934248,0.0025230509,0.00043398072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008345374,0.0018858815,0.03439639,0.0006324669,0.0003905804,0.0030532402,0.0024077971,0.39308354,0.013585573,0.38831896,0.0049548117,0.14894535],"study_design_scores_gemma":[0.00042467334,0.0013367764,0.027428748,0.00016708852,0.00024210372,0.0004702488,0.0018853394,0.58570987,0.006065404,0.37370315,0.0024074775,0.0001591321],"about_ca_topic_score_codex":0.003906354,"about_ca_topic_score_gemma":0.0025137558,"teacher_disagreement_score":0.014761893,"about_ca_system_score_codex":0.0013844445,"about_ca_system_score_gemma":0.001192618,"threshold_uncertainty_score":0.04938346},"labels":[],"label_agreement":null},{"id":"W1771347991","doi":"10.1007/978-3-540-85502-6_32","title":"Forgetting Reinforced Cases","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Université Laval","funders":"","keywords":"Forgetting; Computer science; Bounding overwatch; Reinforcement learning; Case-based reasoning; Artificial intelligence; Value (mathematics); Base (topology); Machine learning; Mathematics","score_opus":0.02403337914753786,"score_gpt":0.25850201668115597,"score_spread":0.2344686375336181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1771347991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16109638,0.0018196028,0.6538014,0.0038811916,0.0021246397,0.00021310388,0.0010318193,0.0053793155,0.17065248],"genre_scores_gemma":[0.7974973,0.0011121865,0.11652551,0.0006903553,0.0009245669,0.00012272035,0.0016220112,0.0010566066,0.08044882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978435,0.00037014918,0.00015776292,0.00052751915,0.0008253432,0.00027584357],"domain_scores_gemma":[0.9883681,0.0046278858,0.0006032528,0.004543387,0.0013814562,0.00047597077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017461834,0.000986253,0.00089475716,0.0018788,0.0010551165,0.0026350392,0.0024916644,0.0012813958,0.022596225],"category_scores_gemma":[0.02541256,0.0006843977,0.0013832274,0.001078823,0.0020122218,0.008833696,0.0038439876,0.0038359787,0.004617282],"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.0006399607,0.00024146371,0.0052984552,0.00033119245,0.00014412009,0.0024954127,0.000814178,0.01968408,0.0056763464,0.4349397,0.035127494,0.4946076],"study_design_scores_gemma":[0.000033120145,0.00006317285,0.0010647124,0.00011998566,0.000093596725,0.002323974,0.0001569486,0.084757246,0.008459821,0.8721888,0.030691331,0.000047152927],"about_ca_topic_score_codex":0.00085001317,"about_ca_topic_score_gemma":0.0013345166,"teacher_disagreement_score":0.022596225,"about_ca_system_score_codex":0.0008223221,"about_ca_system_score_gemma":0.0008069979,"threshold_uncertainty_score":0.07559186},"labels":[],"label_agreement":null},{"id":"W1771537750","doi":"10.1007/11942634_24","title":"Exploring Financial Applications on Many-Core-on-a-Chip Architecture: A First Experiment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Manitoba","funders":"","keywords":"IBM; Computer science; Architecture; Core (optical fiber); Multi-core processor; Focus (optics); Financial services; Monte Carlo method; Computer architecture; Finance; Parallel computing; Economics; Telecommunications","score_opus":0.062080559598835246,"score_gpt":0.23447316456574493,"score_spread":0.1723926049669097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1771537750","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.99132806,0.00014032336,0.0048859194,0.00018983903,0.000049116523,0.00008213993,0.00008919173,0.00015429448,0.003081038],"genre_scores_gemma":[0.9873624,0.00009490092,0.009376516,0.00013760256,0.000020008047,0.00010416735,0.00012537355,0.000035258163,0.0027437154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957985,0.00014792779,0.000014162757,0.00007661017,0.00007569049,0.00010576419],"domain_scores_gemma":[0.99623054,0.0026997447,0.000098792916,0.00039980348,0.00034827512,0.00022281401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010637414,0.00065399474,0.0004395866,0.00017789943,0.00042289187,0.00084279454,0.0011320723,0.0012622296,0.004657488],"category_scores_gemma":[0.0047393683,0.00027666864,0.00040559776,0.00029478225,0.0005934816,0.0013715677,0.0005573364,0.0012405821,0.00055292854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02717509,0.023915555,0.020630019,0.001940614,0.00068194955,0.0019551832,0.0015180876,0.38446155,0.21888751,0.033877607,0.020543931,0.26441294],"study_design_scores_gemma":[0.0027306706,0.026369505,0.010062398,0.00006509169,0.00041137135,0.0005093256,0.0009898798,0.8231526,0.0941785,0.032252733,0.00915219,0.0001257476],"about_ca_topic_score_codex":0.0010421402,"about_ca_topic_score_gemma":0.001138161,"teacher_disagreement_score":0.004657488,"about_ca_system_score_codex":0.00028270602,"about_ca_system_score_gemma":0.00064940297,"threshold_uncertainty_score":0.015580833},"labels":[],"label_agreement":null},{"id":"W1771749799","doi":"10.1007/11569510_19","title":"A Secure Protocol for Mobile Agents in Hostile Environment","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Protocol (science); Mobile agent; Computer security; Computer network; Architecture; Distributed computing; Fault tolerance; Mobile IP; Mobile computing","score_opus":0.02390719879806762,"score_gpt":0.27522240314889784,"score_spread":0.2513152043508302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1771749799","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.014615521,0.00063841563,0.969907,0.0007640477,0.0005566873,0.000598435,0.00011240734,0.0021485114,0.010658963],"genre_scores_gemma":[0.3754013,0.0019058158,0.5593695,0.0005874853,0.00059335807,0.0023813576,0.00063922635,0.0012668824,0.05785503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983479,0.00032990545,0.00019390702,0.00015058463,0.00079162547,0.00018614842],"domain_scores_gemma":[0.997658,0.0008070385,0.00015863737,0.0009431633,0.0003017767,0.00013136044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017999585,0.0010045498,0.00082269555,0.00093681016,0.0019084441,0.0025953786,0.0016336007,0.0023102819,0.0042823115],"category_scores_gemma":[0.003931792,0.001033048,0.0008999916,0.00086860935,0.0024448715,0.0045151003,0.0050009605,0.0043622497,0.002488443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055538415,0.00020214768,0.0004612352,0.0003867007,0.000081437734,0.0012334274,0.0014319761,0.022841722,0.042435613,0.7169414,0.018694775,0.19473417],"study_design_scores_gemma":[0.0004158399,0.0006565994,0.0005305449,0.00019532784,0.0002827289,0.0019461709,0.0004060091,0.24851489,0.07624203,0.4913744,0.17919731,0.00023826356],"about_ca_topic_score_codex":0.00057444,"about_ca_topic_score_gemma":0.0006107873,"teacher_disagreement_score":0.0042823115,"about_ca_system_score_codex":0.000678928,"about_ca_system_score_gemma":0.0015267594,"threshold_uncertainty_score":0.014325798},"labels":[],"label_agreement":null},{"id":"W177184413","doi":"10.1007/978-3-642-31368-4_8","title":"Bio-inspired Navigation of Mobile Robots","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 Guelph","funders":"","keywords":"Computer science; Mobile robot; Robot; Human–computer interaction; Artificial intelligence","score_opus":0.015308337102575464,"score_gpt":0.2313360825450499,"score_spread":0.21602774544247444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177184413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018996274,0.064588554,0.7717603,0.0014764854,0.002397546,0.000066109984,0.00015882344,0.00090067094,0.13965528],"genre_scores_gemma":[0.31939024,0.058609474,0.3734526,0.0007639147,0.0008062072,0.0002833094,0.000729307,0.0004058003,0.24555919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99995506,0.00000596516,0.0000017848081,0.000008718123,0.000024582705,0.000003912585],"domain_scores_gemma":[0.9999759,0.000007735334,0.0000028018785,0.00000400783,0.0000059971367,0.0000035562775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005687357,0.00042699455,0.00034293448,0.0003103583,0.00017390012,0.0005363898,0.0006287085,0.0006467495,0.0028665562],"category_scores_gemma":[0.00016076994,0.00020744138,0.00024879898,0.0004929465,0.00045222018,0.00048793474,0.0004982772,0.0006422673,0.0012874489],"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.000056747867,0.000052413518,0.00027145928,0.0006916939,0.000052589312,0.00012870021,0.00019854536,0.11528188,0.049940392,0.22330849,0.021389969,0.58862716],"study_design_scores_gemma":[0.00003374025,0.00013896692,0.00090766064,0.00036927947,0.00003451525,0.000497173,0.00008232332,0.30524164,0.017211014,0.21639411,0.45903814,0.00005147988],"about_ca_topic_score_codex":0.00049508834,"about_ca_topic_score_gemma":0.0006265706,"teacher_disagreement_score":0.0028665562,"about_ca_system_score_codex":0.00025327902,"about_ca_system_score_gemma":0.00025724302,"threshold_uncertainty_score":0.0095896125},"labels":[],"label_agreement":null},{"id":"W1772160656","doi":"10.1007/978-3-642-38457-8_21","title":"Pathfinding by Demand Sensitive Map Abstraction","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Windsor","funders":"","keywords":"Pathfinding; Computer science; Benchmark (surveying); Abstraction; Path (computing); Artificial intelligence; Shortest path problem; Theoretical computer science; Programming language; Cartography; Geography","score_opus":0.02022950412908025,"score_gpt":0.256685413140508,"score_spread":0.23645590901142777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772160656","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.024178471,0.00020838564,0.9470066,0.00012827055,0.000061000283,0.000050763032,0.00041210823,0.0025529056,0.025401587],"genre_scores_gemma":[0.52793914,0.0007075028,0.4352509,0.00008092259,0.00003552398,0.0001416443,0.0015531449,0.00070128276,0.033589963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.000021268614,0.000009051159,0.000047458256,0.000086209395,0.000036422156],"domain_scores_gemma":[0.9996661,0.000105857776,0.000015407542,0.0001335986,0.000057220965,0.000021858827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017475316,0.0006691655,0.00061855186,0.00080958963,0.00050878245,0.0012190575,0.0017734878,0.00058096787,0.0139229465],"category_scores_gemma":[0.0010722914,0.00049066066,0.00078824826,0.0012812469,0.0005578189,0.0024621193,0.0031527816,0.0011725164,0.0023290762],"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.00029457596,0.00011798848,0.00089388504,0.00051847746,0.00009282775,0.00028999487,0.0006411693,0.16422652,0.03030508,0.31558886,0.022699926,0.46433076],"study_design_scores_gemma":[0.000030669304,0.000047262918,0.00048294594,0.000036970963,0.000041824016,0.0002288529,0.00016935835,0.65712637,0.010500742,0.3094529,0.021846399,0.00003563974],"about_ca_topic_score_codex":0.0051895455,"about_ca_topic_score_gemma":0.007075772,"teacher_disagreement_score":0.0139229465,"about_ca_system_score_codex":0.0004935657,"about_ca_system_score_gemma":0.00056384807,"threshold_uncertainty_score":0.046576917},"labels":[],"label_agreement":null},{"id":"W1772280945","doi":"10.1007/978-3-642-01399-7_3","title":"Aggregation Protocols for High Rate, Low Delay Data Collection in Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Data collection; Computer network; Real-time computing","score_opus":0.02354550402403126,"score_gpt":0.265493210412915,"score_spread":0.24194770638888374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772280945","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.008771004,0.00549239,0.98026913,0.0004868121,0.00038230294,0.00014627405,0.00006840816,0.00074903126,0.0036346877],"genre_scores_gemma":[0.33013004,0.009062071,0.63868093,0.0004116912,0.0009513472,0.00097141805,0.0003661125,0.0004061416,0.019020166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884075,0.00029742502,0.000130726,0.0001334356,0.0005231968,0.0000745022],"domain_scores_gemma":[0.99762255,0.0013190428,0.00016659903,0.00051742763,0.00031764293,0.00005674407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026935106,0.0009600491,0.0012577304,0.0008543729,0.00094298605,0.0019355908,0.0021426538,0.0009946324,0.0014135076],"category_scores_gemma":[0.004391996,0.00068792887,0.0005210663,0.0016495482,0.001072059,0.003087441,0.0018069029,0.0020241733,0.00048924744],"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.00044692785,0.00022552557,0.0005909302,0.0009990705,0.00020574215,0.00034279388,0.0010949932,0.15740366,0.03644265,0.3425044,0.023618855,0.4361244],"study_design_scores_gemma":[0.000090455134,0.00025264948,0.00041397283,0.00013824867,0.00013060067,0.0005222264,0.00019533592,0.73013306,0.020388763,0.20980532,0.037851896,0.00007754647],"about_ca_topic_score_codex":0.00056666665,"about_ca_topic_score_gemma":0.00068992283,"teacher_disagreement_score":0.0026935106,"about_ca_system_score_codex":0.0009225778,"about_ca_system_score_gemma":0.0006560995,"threshold_uncertainty_score":0.014244795},"labels":[],"label_agreement":null},{"id":"W1772992909","doi":"10.1007/11424918_19","title":"Integrating Web Content Clustering into Web Log Association Rule Mining","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Web mining; Web log analysis software; Cluster analysis; Association rule learning; Web page; Data Web; Web analytics; Data mining; Web server; Information retrieval; Web navigation; Web modeling; World Wide Web; The Internet; Static web page; Web intelligence; Machine learning","score_opus":0.023915445733343622,"score_gpt":0.2468860429053318,"score_spread":0.2229705971719882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772992909","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.027325932,0.0003642549,0.9596194,0.00014256021,0.000064960004,0.00018890447,0.00032029278,0.010222623,0.0017509881],"genre_scores_gemma":[0.123041,0.00022142263,0.8721302,0.00009540404,0.00008400048,0.00012458683,0.0011316126,0.00036073313,0.0028111816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987582,0.00031987546,0.000106676875,0.00026723713,0.00046965902,0.000078304496],"domain_scores_gemma":[0.9957783,0.0022808288,0.00018862123,0.0006416783,0.0009951084,0.000115459865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018758775,0.0006995668,0.0013044078,0.0042171315,0.0007129054,0.0018254877,0.0017155617,0.0009048259,0.0020509104],"category_scores_gemma":[0.0066886996,0.0006305186,0.0009150613,0.0046380074,0.0002678613,0.0017390158,0.0010473197,0.0008294169,0.0023118209],"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.00017551811,0.0004963965,0.008972436,0.00015861519,0.00021146142,0.00014100345,0.00014556792,0.0247972,0.011867908,0.0016208849,0.0049391575,0.94647384],"study_design_scores_gemma":[0.000029136665,0.00009442612,0.0049111093,0.000037454523,0.0001795802,0.00029826412,0.00016029553,0.9540391,0.02449895,0.009613524,0.006099857,0.000038234102],"about_ca_topic_score_codex":0.007449881,"about_ca_topic_score_gemma":0.013994984,"teacher_disagreement_score":0.007449881,"about_ca_system_score_codex":0.00048978894,"about_ca_system_score_gemma":0.0009030926,"threshold_uncertainty_score":0.0148130655},"labels":[],"label_agreement":null},{"id":"W1773102371","doi":"10.1007/978-3-540-75759-7_12","title":"Towards Subject-Specific Models of the Dynamic Heart for Image-Guided Mitral Valve Surgery","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac and Coronary Surgery Techniques","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Mitral annulus; Intracardiac injection; Mitral valve; Orientation (vector space); Medicine; Cardiac surgery; Position (finance); Artificial intelligence; Computer science; Computer vision; Cardiology; Internal medicine","score_opus":0.025398720537039322,"score_gpt":0.2941553740492036,"score_spread":0.26875665351216427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773102371","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.008111148,0.00015921757,0.9902795,0.00018012694,0.000023127399,0.000024366536,0.00011747,0.0002870881,0.00081793236],"genre_scores_gemma":[0.5785978,0.0012692589,0.40940654,0.00041071943,0.00012560248,0.00042605808,0.0011150354,0.000533596,0.008115339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996301,0.00015803754,0.000019974264,0.00006410298,0.00009265905,0.000034964974],"domain_scores_gemma":[0.9988451,0.000619368,0.00014985475,0.00013933274,0.00017075718,0.00007556377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009222465,0.0008258341,0.0011028979,0.0006320161,0.00033499257,0.0013620018,0.0017727815,0.001858319,0.0014663537],"category_scores_gemma":[0.003632364,0.0009813294,0.0016970986,0.00052704493,0.00080858887,0.0012086976,0.0014508242,0.0016883855,0.00076560554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000297474,0.000019095047,0.00030856105,0.00003776765,0.000028846744,0.00003794264,0.00008437794,0.96373135,0.0015659073,0.021655506,0.0006617373,0.011839121],"study_design_scores_gemma":[0.0000024391693,0.0000057362563,0.000035624038,0.0000032881512,0.0000032775254,0.0000056028575,0.000004752282,0.9923504,0.00011882519,0.007107106,0.0003601845,0.0000027388091],"about_ca_topic_score_codex":0.008990908,"about_ca_topic_score_gemma":0.010370648,"teacher_disagreement_score":0.008990908,"about_ca_system_score_codex":0.0009410219,"about_ca_system_score_gemma":0.0011191651,"threshold_uncertainty_score":0.017877162},"labels":[],"label_agreement":null},{"id":"W1773343330","doi":"10.1007/978-3-642-39112-5_150","title":"Interactive Event: Enabling Vocabulary Acquisition while Providing Mobile Communication Support","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Learning in Education","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Vocabulary; Language acquisition; Population; Multimedia; Event (particle physics); Artificial intelligence; Human–computer interaction; Natural language processing; Linguistics","score_opus":0.0135491901785452,"score_gpt":0.2637423565903551,"score_spread":0.2501931664118099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773343330","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2056238,0.0012958399,0.67503005,0.00061001524,0.00073371525,0.00047148575,0.0017844395,0.032721117,0.08172953],"genre_scores_gemma":[0.63967746,0.0012516519,0.26830178,0.00043493617,0.00021532668,0.00037419112,0.0034487871,0.0018603621,0.08443553],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998061,0.00002222754,0.000011182627,0.000050554463,0.000067235334,0.000042751522],"domain_scores_gemma":[0.9996326,0.0001628656,0.00001822665,0.00005002962,0.00006724444,0.000069058915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021711673,0.0007426225,0.00033167616,0.00030697123,0.00026804447,0.0012296279,0.0012757501,0.0006523336,0.022607874],"category_scores_gemma":[0.0011642278,0.00023631485,0.00028710687,0.00027917474,0.00030984447,0.0025793775,0.0021007112,0.0006361367,0.0065665855],"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.0015925239,0.0005031751,0.0017126569,0.0007051436,0.00004549331,0.0011574179,0.0015352303,0.0010274834,0.42854887,0.012102508,0.023111705,0.5279578],"study_design_scores_gemma":[0.0004192482,0.0018529057,0.008248074,0.00030419268,0.00035980195,0.005259343,0.002579964,0.06580284,0.5396058,0.020064717,0.35527235,0.00023066327],"about_ca_topic_score_codex":0.0005964158,"about_ca_topic_score_gemma":0.0011072514,"teacher_disagreement_score":0.022607874,"about_ca_system_score_codex":0.00010857682,"about_ca_system_score_gemma":0.00029667807,"threshold_uncertainty_score":0.07563084},"labels":[],"label_agreement":null},{"id":"W1773448242","doi":"10.1007/978-3-540-85279-7_20","title":"A Case Study on the Impact of Refactoring on Quality and Productivity in an Agile Team","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":140,"is_retracted":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":"Code refactoring; Agile software development; Computer science; Productivity; Quality (philosophy); Software engineering; Technical debt; Software quality; Software development; Empirical research; Software; Process management; Programming language; Engineering","score_opus":0.08793095420036612,"score_gpt":0.3594127995506426,"score_spread":0.2714818453502765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773448242","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.994371,0.0000649945,0.002708134,0.00017508195,0.000010800428,0.00009560217,0.000029882005,0.000032809356,0.0025117572],"genre_scores_gemma":[0.9933869,0.00008775013,0.0049003856,0.000043317264,0.0000068832496,0.000052440042,0.00004096341,0.000015268899,0.0014659946],"study_design_codex":"design_other","study_design_gemma":"case_report","domain_scores_codex":[0.9962309,0.002136576,0.00016734637,0.00023055598,0.0008063303,0.00042820268],"domain_scores_gemma":[0.96320057,0.028274836,0.0018653786,0.0019475237,0.0025229692,0.002188712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386781,0.00048895,0.00038732655,0.0011143459,0.0023295938,0.001302078,0.0016262742,0.0022380212,0.0018267818],"category_scores_gemma":[0.013512615,0.00034500362,0.0006023352,0.0017353211,0.00093445013,0.0011968025,0.0010690205,0.0013161803,0.00032093006],"study_design_candidate":"case_report","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006092777,0.044520482,0.20547703,0.0021726175,0.00050242484,0.0852589,0.13217752,0.051715624,0.06388183,0.013113726,0.007708817,0.38737825],"study_design_scores_gemma":[0.003271946,0.061329495,0.4072885,0.001104136,0.0013151732,0.035734933,0.18822734,0.14813638,0.099384315,0.011918652,0.041627903,0.00066130084],"about_ca_topic_score_codex":0.005524526,"about_ca_topic_score_gemma":0.0089561995,"teacher_disagreement_score":0.005524526,"about_ca_system_score_codex":0.0016075019,"about_ca_system_score_gemma":0.0012691341,"threshold_uncertainty_score":0.023199797},"labels":[],"label_agreement":null},{"id":"W1773677394","doi":"10.1007/978-3-540-74260-9_33","title":"New Algorithm to Extract Centerline of 2D Objects Based on Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Position (finance); Point (geometry); Object (grammar); Set (abstract data type); Algorithm; Computer science; Cluster (spacecraft); Artificial intelligence; Computer vision; Mathematics; Geometry","score_opus":0.024023239073733098,"score_gpt":0.28438462488644545,"score_spread":0.26036138581271234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773677394","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.0046909605,0.00037791947,0.99052036,0.00006738,0.0001477913,0.000109923996,0.00014701029,0.0027074048,0.0012311832],"genre_scores_gemma":[0.019634124,0.00033305166,0.97567946,0.00005422255,0.000068190864,0.00014420567,0.00067461136,0.00023646784,0.003175629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889153,0.000056031873,0.000054421493,0.00038911522,0.0005225582,0.000086413456],"domain_scores_gemma":[0.9993918,0.00005988974,0.00004812657,0.00010128215,0.00036240867,0.00003644322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046319264,0.0017019169,0.0018095692,0.0041740104,0.0013053617,0.0014758243,0.0029484439,0.0016110007,0.0043948665],"category_scores_gemma":[0.00077813043,0.0009827553,0.0014166186,0.004062693,0.00060994027,0.0019386376,0.0014056856,0.0011254305,0.0031831234],"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.0002343714,0.00013059596,0.001138437,0.00030687376,0.00015628934,0.00017920951,0.00018189351,0.011700776,0.083734505,0.0049129874,0.016920155,0.8804039],"study_design_scores_gemma":[0.0001507176,0.00023297493,0.004481394,0.000063975975,0.00024160912,0.0017347249,0.00023462356,0.74851596,0.1722178,0.007421152,0.06449429,0.00021072156],"about_ca_topic_score_codex":0.0062363045,"about_ca_topic_score_gemma":0.0068182405,"teacher_disagreement_score":0.0062363045,"about_ca_system_score_codex":0.0008765775,"about_ca_system_score_gemma":0.001486384,"threshold_uncertainty_score":0.0147022605},"labels":[],"label_agreement":null},{"id":"W1774061317","doi":"10.1007/978-3-642-02574-7_38","title":"A Prototype to Validate ErgoCoIn: A Web Site Ergonomic Inspection Technique","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Task (project management); Plan (archaeology); Software engineering; Web service; Web application; Engineering management; World Wide Web; Systems engineering; Engineering","score_opus":0.01916220760500488,"score_gpt":0.25326904640616194,"score_spread":0.23410683880115707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774061317","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.35640997,0.00026001324,0.61089665,0.00044388455,0.00043022478,0.0046319957,0.0009034507,0.017415218,0.008608629],"genre_scores_gemma":[0.45797727,0.00016030058,0.52081513,0.00043073008,0.000035826375,0.0022886652,0.0008374016,0.0014310386,0.01602357],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797946,0.00073866564,0.00013144864,0.0003352957,0.00066858984,0.00014651813],"domain_scores_gemma":[0.99474216,0.0020895496,0.00013505724,0.00095429,0.0017615793,0.00031737986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027243916,0.0007562941,0.0006059376,0.0006906146,0.0007312939,0.0010639937,0.0021523016,0.0015309805,0.007607125],"category_scores_gemma":[0.007461625,0.0005496434,0.00033318409,0.0003457247,0.0007227141,0.001548245,0.0012012675,0.0008273658,0.0027512424],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015961912,0.004300159,0.01009501,0.0017973094,0.00010122103,0.0010971643,0.006386784,0.0030330247,0.5215683,0.0022820607,0.01295877,0.43478408],"study_design_scores_gemma":[0.0021619066,0.018627742,0.08508474,0.0011014551,0.0007713692,0.0063520395,0.0055389632,0.10583175,0.6247618,0.0027710642,0.1464772,0.0005200291],"about_ca_topic_score_codex":0.0021252139,"about_ca_topic_score_gemma":0.0028605952,"teacher_disagreement_score":0.007607125,"about_ca_system_score_codex":0.00041633035,"about_ca_system_score_gemma":0.0010803913,"threshold_uncertainty_score":0.025448382},"labels":[],"label_agreement":null},{"id":"W1774141782","doi":"10.1007/3-540-40057-5_5","title":"New Mechanisms for Extending PLAN Functionality in Active Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Plan (archaeology); Flexibility (engineering); Programmer; Java; Network packet; Bridge (graph theory); Software engineering; Distributed computing; Operating system; Computer network","score_opus":0.019361554675928414,"score_gpt":0.23815794488270775,"score_spread":0.21879639020677932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774141782","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.013380887,0.00028876524,0.96579736,0.00042691964,0.00024096355,0.0001411884,0.00015179624,0.012094355,0.0074778176],"genre_scores_gemma":[0.36949956,0.00058085704,0.60350096,0.0007013402,0.0005046799,0.0007680962,0.00078532787,0.0033369258,0.020322148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99635726,0.00063698983,0.00049561344,0.00053051516,0.0015002885,0.00047929972],"domain_scores_gemma":[0.9838853,0.006089131,0.0009979609,0.007061239,0.0013591981,0.00060706923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005975068,0.0013055427,0.0009915923,0.0018812885,0.0016908097,0.0048797945,0.005919767,0.0020131108,0.0121162245],"category_scores_gemma":[0.013619274,0.0015844037,0.0015888988,0.0014360838,0.0035114435,0.018082388,0.007228393,0.0052103098,0.0020160442],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007434043,0.0003359824,0.0017281667,0.00033655018,0.00008549129,0.00026792742,0.0012979354,0.007966047,0.0122946305,0.7222953,0.013316814,0.23933175],"study_design_scores_gemma":[0.00032818262,0.0003624636,0.00083390117,0.00023165382,0.00042313046,0.0007344982,0.00041856396,0.21724352,0.049687527,0.6242908,0.10522038,0.0002254409],"about_ca_topic_score_codex":0.0010171749,"about_ca_topic_score_gemma":0.0013888876,"teacher_disagreement_score":0.0121162245,"about_ca_system_score_codex":0.0010986301,"about_ca_system_score_gemma":0.0010817271,"threshold_uncertainty_score":0.040532827},"labels":[],"label_agreement":null},{"id":"W1774577175","doi":"10.1007/978-3-540-45070-2_17","title":"Java Subtype Tests in Real-Time","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":43,"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":"Defense Advanced Research Projects Agency; McGill University","keywords":"Computer science; Java; Speedup; Byte; Constant (computer programming); C dynamic memory allocation; Class (philosophy); Real time Java; Operating system; Programming language; Parallel computing; Memory management; Artificial intelligence","score_opus":0.021264871785459775,"score_gpt":0.26276019879943985,"score_spread":0.24149532701398008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774577175","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.020734191,0.00057559414,0.9269893,0.00042501834,0.00031891474,0.00010637961,0.00026526043,0.029735824,0.020849591],"genre_scores_gemma":[0.38411355,0.00042821883,0.5718042,0.0005597167,0.00017776119,0.00020949672,0.0010637164,0.008727004,0.032916285],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99331516,0.0019971947,0.00044717788,0.0008881192,0.002738769,0.00061362534],"domain_scores_gemma":[0.9807037,0.011024207,0.001155873,0.004638099,0.0020702644,0.0004078762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004107974,0.0011517649,0.0012675195,0.0012175947,0.000583764,0.0024036225,0.005376315,0.0016723282,0.015367507],"category_scores_gemma":[0.017820757,0.0010949951,0.0008710955,0.0011732973,0.001865711,0.007130092,0.0019072318,0.0025403595,0.004820519],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001258128,0.00045091292,0.004570778,0.0008152008,0.00009073366,0.00086701236,0.0010624408,0.0244166,0.022450373,0.15641588,0.04336382,0.7442382],"study_design_scores_gemma":[0.0004940392,0.00059579354,0.0029515587,0.0005276973,0.0001940779,0.002374046,0.00058133074,0.45156696,0.11653212,0.32242417,0.101544,0.00021419111],"about_ca_topic_score_codex":0.0021291007,"about_ca_topic_score_gemma":0.0028253132,"teacher_disagreement_score":0.015367507,"about_ca_system_score_codex":0.0009274477,"about_ca_system_score_gemma":0.0011417668,"threshold_uncertainty_score":0.051409423},"labels":[],"label_agreement":null},{"id":"W1775126135","doi":"10.1007/978-3-540-77442-6_8","title":"Unification of Arrays in Spreadsheets with Logic Programming","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spreadsheets and End-User Computing","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":"Dalhousie University","funders":"","keywords":"Unification; Computer science; Template; Matching (statistics); Programming language; Logic programming; Key (lock); Theoretical computer science; Generic programming; Data structure; Focus (optics); Algorithm; Mathematics","score_opus":0.03158209850135571,"score_gpt":0.26278772666480665,"score_spread":0.23120562816345094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775126135","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.0059554907,0.0007494869,0.96988845,0.0002998535,0.00018633161,0.00007710723,0.00012103906,0.004919028,0.017803146],"genre_scores_gemma":[0.09469613,0.0014142282,0.8633639,0.00044956658,0.00031332305,0.00028803805,0.0008791608,0.0036694496,0.03492615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528015,0.00088454224,0.0008515212,0.00094829453,0.0016469862,0.00038861946],"domain_scores_gemma":[0.99577576,0.0019621807,0.00022583842,0.001385793,0.00053507125,0.00011530331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036583429,0.00092722726,0.001460226,0.0017927685,0.0012506905,0.005773129,0.0033650163,0.0011686666,0.013635963],"category_scores_gemma":[0.007946177,0.0019239691,0.0033855317,0.003462818,0.002380429,0.014343824,0.0050234017,0.0050633866,0.0055224495],"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.00009757634,0.00006702309,0.00030345313,0.00028546475,0.000050604278,0.00009993757,0.00074391667,0.004342597,0.004624648,0.7591548,0.0061852117,0.22404476],"study_design_scores_gemma":[0.00006685526,0.000058296235,0.00026961614,0.0002964778,0.00014898722,0.00019796644,0.00020841355,0.04770372,0.027993679,0.77276397,0.1502224,0.00006955806],"about_ca_topic_score_codex":0.0015995245,"about_ca_topic_score_gemma":0.0015759337,"teacher_disagreement_score":0.013635963,"about_ca_system_score_codex":0.0015785617,"about_ca_system_score_gemma":0.0017795948,"threshold_uncertainty_score":0.045616865},"labels":[],"label_agreement":null},{"id":"W17752077","doi":"10.1007/978-3-642-19748-2_3","title":"Impulse-Based Dynamic Simulation of Deformable Biological Structures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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":"Impulse (physics); Computer science; Impulse response; Algorithm; Process (computing); Biological system; Physics; Classical mechanics; Mathematics; Mathematical analysis","score_opus":0.012906503660347549,"score_gpt":0.24901264265261228,"score_spread":0.23610613899226474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17752077","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.21258116,0.0006446639,0.73063344,0.0006144601,0.00036562057,0.000093503535,0.0003485628,0.0023381503,0.052380376],"genre_scores_gemma":[0.91358346,0.00031671644,0.076825306,0.00011217949,0.00005772364,0.00011900995,0.00027879846,0.00035175955,0.0083550615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998455,0.00003139026,0.000005769982,0.000013812932,0.00007941519,0.000024167937],"domain_scores_gemma":[0.9996044,0.00024444045,0.000024404202,0.000037146085,0.000048781672,0.000040911935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026628995,0.000311125,0.0006069026,0.00040724612,0.00034960004,0.00062964694,0.0012500618,0.0013992884,0.005238173],"category_scores_gemma":[0.0008833762,0.0003915243,0.00053378823,0.00039070347,0.00061478623,0.00046727635,0.0007946119,0.0007903196,0.00045141755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041973108,0.00002547233,0.00011393284,0.000027646893,0.000015368132,0.000058336056,0.00003984096,0.9849391,0.0023461436,0.006205312,0.00039463813,0.0057922336],"study_design_scores_gemma":[0.000007627773,0.0000072036028,0.000036684127,0.0000023563873,0.0000016723366,0.000010289116,0.0000032214846,0.9981029,0.00046143573,0.0010755163,0.00028818054,0.000002893716],"about_ca_topic_score_codex":0.0030027125,"about_ca_topic_score_gemma":0.0021185693,"teacher_disagreement_score":0.005238173,"about_ca_system_score_codex":0.0005919391,"about_ca_system_score_gemma":0.0003907113,"threshold_uncertainty_score":0.017523468},"labels":[],"label_agreement":null},{"id":"W1775242608","doi":"10.1007/978-3-540-27777-4_7","title":"Suitability of FIT User Acceptance Tests for Specifying Functional Requirements: Developer Perspective","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Functional requirement; Perspective (graphical); Acceptance testing; Requirements analysis; Software engineering; User requirements document; Software requirements specification; Non-functional requirement; Systems engineering; Human–computer interaction; Programming language; Software; Software development; Artificial intelligence; Software design; Engineering; Software construction","score_opus":0.068189183171956,"score_gpt":0.3171781358519184,"score_spread":0.2489889526799624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775242608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2970238,0.0008101041,0.6766231,0.0013224075,0.000083415005,0.00044597153,0.00035498076,0.001916527,0.02141967],"genre_scores_gemma":[0.9085291,0.00013531982,0.08865503,0.00018226194,0.000037557034,0.00025310766,0.00031632817,0.000385669,0.0015056075],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9627875,0.024417259,0.0016195576,0.0011985997,0.008970216,0.0010068599],"domain_scores_gemma":[0.70514804,0.2604371,0.0049295286,0.012655544,0.015782513,0.0010473205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023819882,0.0011191991,0.0010783707,0.0030343034,0.00055490184,0.0029487244,0.0020733273,0.0028175132,0.003492225],"category_scores_gemma":[0.20090869,0.00059515255,0.0011411883,0.001393483,0.0015852939,0.005044177,0.0013602744,0.0018142564,0.00096165395],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028994954,0.0011044255,0.122233264,0.0012514548,0.0004269718,0.0022532267,0.009437171,0.12361112,0.044438582,0.15541601,0.0095412815,0.52738696],"study_design_scores_gemma":[0.00037322193,0.0030176868,0.033563357,0.00057563133,0.00036184568,0.0025923157,0.0047020726,0.8020786,0.035578758,0.10704229,0.009859502,0.00025466137],"about_ca_topic_score_codex":0.0016660921,"about_ca_topic_score_gemma":0.0016351971,"teacher_disagreement_score":0.023819882,"about_ca_system_score_codex":0.00081874226,"about_ca_system_score_gemma":0.0011173243,"threshold_uncertainty_score":0.12597305},"labels":[],"label_agreement":null},{"id":"W1775440673","doi":"10.1007/3-540-45578-7_49","title":"GAC on Conjunctions of Constraints","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Computer science; Pruning; Heuristic; Simple (philosophy); Artificial intelligence; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.017093319814538988,"score_gpt":0.24099345245901407,"score_spread":0.22390013264447509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775440673","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.008732667,0.0007138833,0.9327464,0.00049334555,0.0004486675,0.00021580786,0.00060019625,0.002094717,0.05395432],"genre_scores_gemma":[0.118496895,0.00059535337,0.84753805,0.0006207805,0.00020389745,0.00043403148,0.0013552901,0.0009373748,0.029818403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979424,0.00063193415,0.00011320726,0.00040273665,0.0006717993,0.00023784349],"domain_scores_gemma":[0.9971541,0.0015929323,0.00010257122,0.00056885765,0.00048643,0.0000950894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013529886,0.0011862597,0.0013676358,0.0020974344,0.001355259,0.0017494097,0.0023635982,0.0010362017,0.018665824],"category_scores_gemma":[0.007187895,0.0009533173,0.0018690269,0.0036567857,0.001674428,0.0026760802,0.003128164,0.0035112414,0.0039030972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017764859,0.00009346009,0.0002780677,0.00035867016,0.00010466444,0.00032083265,0.00018277286,0.06506308,0.0044917976,0.5828128,0.03535059,0.31076556],"study_design_scores_gemma":[0.000067359055,0.000060714883,0.00020959813,0.00010341846,0.000072227616,0.0002472757,0.000061808256,0.34938493,0.003271328,0.6063701,0.040111523,0.000039722214],"about_ca_topic_score_codex":0.006486683,"about_ca_topic_score_gemma":0.012109766,"teacher_disagreement_score":0.018665824,"about_ca_system_score_codex":0.0015396329,"about_ca_system_score_gemma":0.0015192233,"threshold_uncertainty_score":0.062443376},"labels":[],"label_agreement":null},{"id":"W1775862243","doi":"10.1007/978-3-319-08171-7_3","title":"An Eigendecomposition Method for Protein Structure Alignment","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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 Windsor","funders":"","keywords":"Structural alignment; Computer science; Pairwise comparison; Multiple sequence alignment; Structural similarity; Similarity (geometry); Algorithm; Eigendecomposition of a matrix; Graph; Sequence alignment; Pattern recognition (psychology); Eigenvalues and eigenvectors; Artificial intelligence; Theoretical computer science; Biology","score_opus":0.00775437222800223,"score_gpt":0.2700865460532064,"score_spread":0.2623321738252042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775862243","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.0023825276,0.00014062833,0.9957551,0.000039847993,0.00004118291,0.000024528994,0.000068520625,0.0012134839,0.0003341979],"genre_scores_gemma":[0.014191708,0.00015123918,0.98267394,0.00006335247,0.000029566678,0.00013152248,0.00054952526,0.00050495047,0.0017041763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990927,0.00024063425,0.0000778774,0.00020833642,0.0003206409,0.00005988758],"domain_scores_gemma":[0.9987766,0.0005715421,0.00006499676,0.00020740017,0.0003306397,0.000048768758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011870712,0.0014134868,0.0015775003,0.0013291478,0.00070335885,0.0012555573,0.001671834,0.0011951716,0.0083673],"category_scores_gemma":[0.002361817,0.001073806,0.0012746316,0.0018635286,0.00069473335,0.0017036053,0.001930225,0.0019845965,0.005003013],"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.00028829137,0.00019156457,0.00035028034,0.00022927322,0.00013375607,0.00012422277,0.00014567378,0.042198673,0.03695368,0.012539579,0.0152594,0.8915857],"study_design_scores_gemma":[0.000052707495,0.00007776369,0.00042677543,0.000026709915,0.00003519296,0.00022365624,0.000052197815,0.95889467,0.0146677205,0.018433465,0.0070658843,0.00004326901],"about_ca_topic_score_codex":0.001402127,"about_ca_topic_score_gemma":0.0019198486,"teacher_disagreement_score":0.0083673,"about_ca_system_score_codex":0.00030893422,"about_ca_system_score_gemma":0.0009536603,"threshold_uncertainty_score":0.027991414},"labels":[],"label_agreement":null},{"id":"W177645602","doi":"10.1007/978-3-642-30217-6_29","title":"An Associative Classifier for Uncertain Datasets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Computer science; Associative property; Classifier (UML); Artificial intelligence; Machine learning; Artificial neural network; Uncertain data; Pruning; Decision tree; Pattern recognition (psychology); Data mining; Mathematics","score_opus":0.03891664597527363,"score_gpt":0.30842342463057865,"score_spread":0.26950677865530503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177645602","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.035209905,0.001867903,0.9526779,0.00064685836,0.00058602856,0.0002161223,0.00088110386,0.0027495348,0.005164696],"genre_scores_gemma":[0.31988242,0.0018261556,0.6569884,0.0005056568,0.0010202209,0.00054779655,0.004024466,0.00020160864,0.0150033645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981273,0.0002363954,0.00022347573,0.00030300755,0.0010133064,0.00009654971],"domain_scores_gemma":[0.9956377,0.002132533,0.00017798568,0.00083901436,0.0010936342,0.00011913017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028497793,0.00067630195,0.001489175,0.002289112,0.0011429089,0.0020661012,0.0019260407,0.0014445467,0.004150396],"category_scores_gemma":[0.009326048,0.00039824157,0.00081371353,0.002462043,0.0006161835,0.00484386,0.0020397312,0.0018859216,0.0026551282],"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.0003775505,0.00025092473,0.0031928471,0.0002847928,0.00012574164,0.0003400421,0.00014070865,0.021288343,0.005818082,0.022665493,0.021273071,0.9242424],"study_design_scores_gemma":[0.000039260958,0.00013842531,0.0011691405,0.00009373331,0.00012686859,0.0008123032,0.000114393995,0.8952494,0.009486816,0.07702118,0.015708068,0.00004040164],"about_ca_topic_score_codex":0.0010227141,"about_ca_topic_score_gemma":0.0020056074,"teacher_disagreement_score":0.004150396,"about_ca_system_score_codex":0.0004993234,"about_ca_system_score_gemma":0.0013109928,"threshold_uncertainty_score":0.015071213},"labels":[],"label_agreement":null},{"id":"W177655890","doi":"10.1007/978-3-642-24571-8_46","title":"Continuous Emotion Recognition Using Gabor Energy Filters","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":26,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sadness; Computer science; Emotion classification; Artificial intelligence; Facial expression; Happiness; Arousal; Valence (chemistry); Support vector machine; Pattern recognition (psychology); Gabor filter; Emotion detection; Anger; Speech recognition; Emotion recognition; Feature extraction; Psychology","score_opus":0.05450590801710817,"score_gpt":0.281326717202936,"score_spread":0.22682080918582784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177655890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0375955,0.0038848731,0.93835926,0.00016870759,0.00046168407,0.000063489766,0.0004922439,0.0017820679,0.017192315],"genre_scores_gemma":[0.42875683,0.0063700904,0.5109341,0.0003179587,0.00032859037,0.00018452844,0.0018333626,0.0005510882,0.050723407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989545,0.0000108417025,0.000005273559,0.000033511016,0.000038768685,0.000016168624],"domain_scores_gemma":[0.99990547,0.000041732525,0.0000074218506,0.00001419431,0.000024520612,0.0000066184025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020224626,0.00043102546,0.00043644191,0.00041854687,0.00010272362,0.0009473302,0.00034868537,0.00047743542,0.009000728],"category_scores_gemma":[0.00034608215,0.00016542849,0.00038830258,0.0007208405,0.00019475371,0.0008529132,0.00031814238,0.00039994865,0.0048793126],"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.000155913,0.00006275991,0.00042587574,0.00013956559,0.000031855747,0.00007639501,0.00005416923,0.0016440791,0.20569663,0.0033602668,0.0059552356,0.7823973],"study_design_scores_gemma":[0.000082101324,0.00066857133,0.0441088,0.00033111585,0.00031551617,0.0023015074,0.0004658955,0.39326394,0.44533128,0.02987213,0.08306943,0.00018967429],"about_ca_topic_score_codex":0.00022671673,"about_ca_topic_score_gemma":0.0003828594,"teacher_disagreement_score":0.009000728,"about_ca_system_score_codex":0.000106802894,"about_ca_system_score_gemma":0.00008303645,"threshold_uncertainty_score":0.030110419},"labels":[],"label_agreement":null},{"id":"W1776642447","doi":"10.1007/978-3-319-23222-5_65","title":"Nonlinear Background Filter to Improve Pedestrian Detection","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Université de Sherbrooke","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Filter (signal processing); Detector; Frame (networking); False positive paradox; Nonlinear system; Pedestrian detection; Pedestrian; Motion (physics); Image (mathematics); Frame rate; Motion detection; Physics; Geography; Telecommunications","score_opus":0.04950859430179317,"score_gpt":0.30827015369565247,"score_spread":0.2587615593938593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1776642447","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.022177117,0.0015565429,0.9697688,0.00016552075,0.0003351322,0.00004355219,0.0002152515,0.0019486098,0.003789521],"genre_scores_gemma":[0.25896415,0.0034897553,0.7022573,0.0004316645,0.0002889236,0.00007407007,0.0018259714,0.00081999635,0.0318482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996991,0.000032432577,0.000011385589,0.00009115844,0.00011508406,0.00005071719],"domain_scores_gemma":[0.99963117,0.00006887268,0.000016078713,0.00004298588,0.00021419606,0.000026761552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056655565,0.0011223818,0.0010644849,0.0012067495,0.00042928642,0.00080454774,0.00085289613,0.00077596714,0.003967792],"category_scores_gemma":[0.0009678709,0.00039749304,0.0008681042,0.00119563,0.00025408927,0.0009563121,0.00083093933,0.0010492896,0.0034440854],"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.00040563405,0.00023294536,0.0010669029,0.00018776362,0.00010788417,0.00012169844,0.000057880367,0.022855844,0.08987892,0.0032799314,0.01003861,0.871766],"study_design_scores_gemma":[0.000023809194,0.000113826,0.002288274,0.00002938773,0.00017367369,0.0003392013,0.000025780437,0.91249454,0.07192082,0.0021927042,0.010370708,0.00002730373],"about_ca_topic_score_codex":0.0069825402,"about_ca_topic_score_gemma":0.010144245,"teacher_disagreement_score":0.0069825402,"about_ca_system_score_codex":0.00054935034,"about_ca_system_score_gemma":0.000695089,"threshold_uncertainty_score":0.0138837695},"labels":[],"label_agreement":null},{"id":"W177679943","doi":"10.1007/978-3-642-40501-3_64","title":"Domain Search and Exploration with Meta-Indexes","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Index (typography); Domain (mathematical analysis); Subject (documents); Information retrieval; Digital library; Data mining; World Wide Web; Data science; Mathematics","score_opus":0.04481251404042791,"score_gpt":0.2610147273258674,"score_spread":0.21620221328543948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177679943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046664253,0.0083007105,0.9047406,0.0007527448,0.00013645184,0.00011441081,0.00066509837,0.0028505921,0.035775185],"genre_scores_gemma":[0.38881022,0.003936831,0.5866483,0.00013896314,0.00015425462,0.0001637077,0.0012934675,0.0004905433,0.018363716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991172,0.00030306083,0.00007476977,0.00012930027,0.0002978946,0.00007774307],"domain_scores_gemma":[0.99784744,0.001212563,0.00007848246,0.0006307377,0.00014988249,0.00008085045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012719835,0.00058715616,0.0010362042,0.0028120405,0.0006233616,0.002966746,0.0014484298,0.0008814667,0.008727037],"category_scores_gemma":[0.0061162096,0.00042756478,0.00090454926,0.0046680085,0.0007191244,0.006852596,0.0027245472,0.0010382304,0.002367259],"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.000519561,0.00023134777,0.0021606234,0.0006994444,0.00016027942,0.0001362338,0.0005324971,0.03857385,0.007887319,0.16865347,0.013322068,0.7671233],"study_design_scores_gemma":[0.000096999865,0.000208637,0.0011395476,0.00020016643,0.00019384817,0.0006268145,0.00029880626,0.5407916,0.016394451,0.40129235,0.03870184,0.00005497374],"about_ca_topic_score_codex":0.0008820595,"about_ca_topic_score_gemma":0.0017266638,"teacher_disagreement_score":0.008727037,"about_ca_system_score_codex":0.00055773597,"about_ca_system_score_gemma":0.0008872464,"threshold_uncertainty_score":0.029194891},"labels":[],"label_agreement":null},{"id":"W177692115","doi":"10.1007/978-3-642-36818-9_47","title":"Confidentiality-Preserving Query Execution of Fragmented Outsourced Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Confidentiality; Cloud computing; Encryption; Service provider; Cryptography; Overhead (engineering); Private information retrieval; Computer security; Database; Service (business)","score_opus":0.02900764904512085,"score_gpt":0.26388565670701075,"score_spread":0.2348780076618899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177692115","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.27528653,0.0012719681,0.7106977,0.0007149753,0.000108128,0.0002631808,0.00067237014,0.0036702566,0.0073149847],"genre_scores_gemma":[0.8989996,0.00046395638,0.09522369,0.00011876437,0.00006259219,0.00008911412,0.000778352,0.00038014606,0.003883807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956235,0.00073394284,0.00025884443,0.00036955858,0.0022023283,0.0008118152],"domain_scores_gemma":[0.99269474,0.0019183145,0.00040776972,0.004093417,0.00071411394,0.00017155496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009516,0.0006406228,0.0011586904,0.0006684723,0.0009004656,0.0020907242,0.0024822578,0.00077044626,0.002075736],"category_scores_gemma":[0.0063057262,0.00055299763,0.0006746928,0.0019125865,0.0015519623,0.0034307188,0.002866593,0.0014382087,0.000734259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061506624,0.0005471131,0.007960294,0.00080560806,0.00038552075,0.002412128,0.0034617775,0.23872718,0.15088141,0.16731296,0.019809993,0.40154532],"study_design_scores_gemma":[0.00023481133,0.00043591906,0.0016032354,0.000062874584,0.00012359934,0.0011545508,0.0006375934,0.78698474,0.10498185,0.09470899,0.009015714,0.000056042896],"about_ca_topic_score_codex":0.0019376941,"about_ca_topic_score_gemma":0.0015990166,"teacher_disagreement_score":0.003009516,"about_ca_system_score_codex":0.000987407,"about_ca_system_score_gemma":0.0017264845,"threshold_uncertainty_score":0.01591599},"labels":[],"label_agreement":null},{"id":"W1777383551","doi":"10.1007/978-3-642-24031-7_70","title":"A Comparative Evaluation of Feature Detectors on Historic Repeat Photography","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Context (archaeology); Feature (linguistics); Matching (statistics); Photography; Detector; Set (abstract data type); Variety (cybernetics); Artificial intelligence; Feature extraction; Feature matching; Computer vision; Remote sensing; Pattern recognition (psychology); Geography; Telecommunications; Archaeology; Mathematics; Linguistics","score_opus":0.05194457471539911,"score_gpt":0.30671201289467614,"score_spread":0.25476743817927705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777383551","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.904727,0.01043918,0.068469256,0.00017916206,0.0003507217,0.00025891024,0.0025268127,0.004793039,0.008255846],"genre_scores_gemma":[0.9160001,0.0032533123,0.06377822,0.00006137206,0.00013773795,0.0000536708,0.009766269,0.00040231497,0.006547003],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985815,0.00024793195,0.000093334274,0.00034794517,0.00054684223,0.00018239194],"domain_scores_gemma":[0.99626523,0.002112029,0.0001547574,0.0003734532,0.00097089645,0.00012361222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002690139,0.0008755232,0.0014846269,0.0034298976,0.00050805794,0.0014233231,0.0013218096,0.001392099,0.003827115],"category_scores_gemma":[0.0052417223,0.00031811235,0.0010519029,0.0019948673,0.00036430274,0.0015563583,0.00069334934,0.0003485531,0.0015699257],"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.008781779,0.0007805664,0.022850322,0.001400759,0.0014533022,0.00052584225,0.00016560442,0.0337375,0.059087142,0.0006868735,0.008101314,0.862429],"study_design_scores_gemma":[0.00050311955,0.005902132,0.15483297,0.00019230646,0.0027646269,0.0034899265,0.00087595114,0.6917569,0.124678925,0.0011877116,0.013629677,0.00018574159],"about_ca_topic_score_codex":0.0071163354,"about_ca_topic_score_gemma":0.0104040615,"teacher_disagreement_score":0.0071163354,"about_ca_system_score_codex":0.0006621204,"about_ca_system_score_gemma":0.00042357837,"threshold_uncertainty_score":0.014226973},"labels":[],"label_agreement":null},{"id":"W177756830","doi":"10.1007/978-3-642-21043-3_34","title":"Normal Distribution Re-Weighting for Personalized Web Search","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Weighting; Information retrieval; World Wide Web; Data mining; Artificial intelligence","score_opus":0.041239890542996774,"score_gpt":0.2730861848121755,"score_spread":0.23184629426917874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177756830","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.010706821,0.0009557773,0.9855333,0.000145968,0.00013393321,0.00008892111,0.00014314336,0.001083474,0.0012087229],"genre_scores_gemma":[0.40568453,0.001327567,0.5718856,0.00027255315,0.0005239897,0.00031364246,0.0012742497,0.0007766534,0.017941242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960672,0.0016412897,0.00022285889,0.00058454106,0.0011970263,0.00028701685],"domain_scores_gemma":[0.99238,0.0038702118,0.00022988039,0.0019149458,0.0014237387,0.00018119528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004551069,0.0010176338,0.0025959725,0.0028289547,0.0008607998,0.0013208054,0.002788881,0.0015620482,0.0055734017],"category_scores_gemma":[0.018023537,0.00083478994,0.0013723791,0.0034605055,0.00081769243,0.0039933403,0.0018211814,0.0019952653,0.0024685536],"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.000777069,0.0004391286,0.0024708996,0.00026833336,0.00025598478,0.000118002856,0.00016358154,0.16594209,0.006296661,0.039638657,0.01712673,0.76650286],"study_design_scores_gemma":[0.00003972797,0.000063931555,0.00061026233,0.000018311997,0.000053161086,0.00012717144,0.00002712591,0.9597988,0.001928573,0.03405922,0.003242464,0.000031216132],"about_ca_topic_score_codex":0.008022096,"about_ca_topic_score_gemma":0.014146234,"teacher_disagreement_score":0.008022096,"about_ca_system_score_codex":0.0012986184,"about_ca_system_score_gemma":0.001368237,"threshold_uncertainty_score":0.024068654},"labels":[],"label_agreement":null},{"id":"W1777638167","doi":"10.1007/978-3-540-75690-3_12","title":"Detecting, Localizing and Classifying Visual Traits from Arbitrary Viewpoints Using Probabilistic Local Feature Modeling","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Computer science; Viewpoints; Invariant (physics); Classifier (UML); Trait; Computer vision; Probabilistic logic; Scale-invariant feature transform; Bayesian probability; Feature extraction; Mathematics","score_opus":0.047537938998108036,"score_gpt":0.2865872323069171,"score_spread":0.23904929330880903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777638167","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.028708162,0.00014111848,0.9699645,0.000032956967,0.00000809424,0.00002448752,0.000043451615,0.0005870507,0.0004901361],"genre_scores_gemma":[0.4461112,0.00041642785,0.5505815,0.00006310063,0.00003370275,0.00006957586,0.00035408384,0.00025293435,0.0021174892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994615,0.00006139185,0.000015200446,0.00020705171,0.00018429247,0.00007051678],"domain_scores_gemma":[0.99939,0.00020247017,0.00011159232,0.00015735599,0.00010417839,0.000034398545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060293626,0.0006811854,0.001306758,0.0010926708,0.0002457811,0.0009973794,0.0013625193,0.000694461,0.00082185713],"category_scores_gemma":[0.0011693988,0.0005334485,0.0012525808,0.0011702892,0.0006438516,0.0012380795,0.0009516335,0.0007303666,0.0006951361],"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.0001905863,0.00011073271,0.0051643183,0.00014621932,0.00010309776,0.0001796862,0.00019922062,0.06789118,0.166254,0.00393859,0.0017543884,0.754068],"study_design_scores_gemma":[0.0000084425865,0.00011341447,0.0059843026,0.000012296586,0.00006763922,0.0005162536,0.00007075137,0.9506314,0.034391064,0.0071737226,0.0009963802,0.00003435781],"about_ca_topic_score_codex":0.0016670044,"about_ca_topic_score_gemma":0.0023522647,"teacher_disagreement_score":0.0016670044,"about_ca_system_score_codex":0.0003737828,"about_ca_system_score_gemma":0.00031541797,"threshold_uncertainty_score":0.0033146143},"labels":[],"label_agreement":null},{"id":"W1777764582","doi":"10.1007/978-3-540-75551-7_7","title":"Pairing-Based Onion Routing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Routing (electronic design automation); Pairing; Directory; Anonymity; Computer network; Cryptography; Key (lock); Reduction (mathematics); Protocol (science); Theoretical computer science; Distributed computing; Algorithm; Computer security; Mathematics","score_opus":0.02135806625240727,"score_gpt":0.2510423715049971,"score_spread":0.22968430525258982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777764582","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.062977776,0.0007325585,0.8629687,0.0008468497,0.00090181234,0.0003852188,0.00041601114,0.003957899,0.06681315],"genre_scores_gemma":[0.7671155,0.0006018476,0.19551593,0.00034900947,0.00031543494,0.00026892775,0.0009072616,0.00051469303,0.034411438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.0005831324,0.00010919648,0.00025582217,0.00046941204,0.00037887794],"domain_scores_gemma":[0.99749595,0.0005651408,0.000110058434,0.00139019,0.00028586652,0.00015269639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015877843,0.00076110644,0.0013751325,0.0013584594,0.001713992,0.0023686038,0.0016273949,0.0010671131,0.011256675],"category_scores_gemma":[0.0032329655,0.0004154045,0.0007414706,0.0016576612,0.0011689005,0.0036137,0.0045090327,0.0017750241,0.0028111262],"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.0013946653,0.00039124617,0.00095866836,0.00018662568,0.00009876591,0.00020209621,0.0003566938,0.062219795,0.0130346045,0.54776525,0.022952178,0.35043934],"study_design_scores_gemma":[0.00018969279,0.00034925665,0.00042956683,0.00006764105,0.00008508527,0.00036829803,0.00013913937,0.37334108,0.01675219,0.5762893,0.03191576,0.000072979674],"about_ca_topic_score_codex":0.0005560017,"about_ca_topic_score_gemma":0.0008957449,"teacher_disagreement_score":0.011256675,"about_ca_system_score_codex":0.00089828897,"about_ca_system_score_gemma":0.0010108304,"threshold_uncertainty_score":0.03765732},"labels":[],"label_agreement":null},{"id":"W1777899759","doi":"10.1007/978-3-642-04103-7_12","title":"On Computing the Hermite Form of a Matrix of Differential Polynomials","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hermite polynomials; Computer science; Differential (mechanical device); Matrix (chemical analysis); Algebra over a field; Mathematics; Pure mathematics; Physics","score_opus":0.011567707040216866,"score_gpt":0.2484608247179025,"score_spread":0.23689311767768564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777899759","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.13333198,0.0003411106,0.8443705,0.00047015044,0.00022292706,0.000119428645,0.0004824068,0.003464463,0.017196953],"genre_scores_gemma":[0.47840023,0.0003770437,0.4982209,0.00030146388,0.0002680209,0.00014657187,0.001899808,0.00077564846,0.019610336],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891496,0.00022926612,0.000059587317,0.00021105724,0.00043798352,0.00014722819],"domain_scores_gemma":[0.9976169,0.0012621224,0.0001265193,0.0004939722,0.00038045103,0.00012009364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870275,0.0009388953,0.0012442617,0.0012315342,0.0010620792,0.0034233383,0.0016512288,0.0009767923,0.011436023],"category_scores_gemma":[0.007355558,0.00057873013,0.00074887817,0.001984737,0.0013017247,0.006071744,0.0026477014,0.0018410735,0.0032844548],"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.0009052164,0.00036206967,0.0035314423,0.00032707833,0.00007912904,0.00029425864,0.00083206675,0.06084975,0.025147522,0.441252,0.018488495,0.447931],"study_design_scores_gemma":[0.00009993378,0.00018545087,0.00086783036,0.0000505547,0.000028869857,0.00031126235,0.00034366705,0.39129913,0.015148552,0.58167255,0.009922505,0.00006976988],"about_ca_topic_score_codex":0.0016793165,"about_ca_topic_score_gemma":0.004690895,"teacher_disagreement_score":0.011436023,"about_ca_system_score_codex":0.00083553046,"about_ca_system_score_gemma":0.001033363,"threshold_uncertainty_score":0.0382573},"labels":[],"label_agreement":null},{"id":"W1778004173","doi":"10.1007/978-3-642-39071-5_8","title":"Recovering and Utilizing Partial Duality in QBF","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Representation (politics); Dual (grammatical number); Solver; Context (archaeology); Duality (order theory); Theoretical computer science; Conjunctive normal form; True quantified Boolean formula; Transformation (genetics); Artificial intelligence; Programming language; Mathematics; Discrete mathematics","score_opus":0.04481505906145033,"score_gpt":0.2930764473280285,"score_spread":0.24826138826657818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778004173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02474949,0.00025702192,0.9683894,0.000412794,0.00010273706,0.00006353329,0.00014763552,0.0013949958,0.0044823387],"genre_scores_gemma":[0.57130325,0.00032949957,0.42074105,0.00019323122,0.00011879055,0.000116202675,0.00055019365,0.0006264914,0.00602131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971782,0.0010642662,0.00014016003,0.0003479816,0.0009049589,0.00036441427],"domain_scores_gemma":[0.994375,0.0031544454,0.00019357755,0.0015277574,0.0006206689,0.00012852614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003400915,0.00064605894,0.0011142434,0.0011625843,0.0011207402,0.0022891685,0.0012628236,0.0011706867,0.005445702],"category_scores_gemma":[0.015905213,0.0007151275,0.0011990458,0.0014810644,0.0019610631,0.0057191835,0.0036386617,0.0025700734,0.0012203029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061208,0.0001391323,0.0010675811,0.00033845525,0.000049625523,0.0002616577,0.00047779529,0.09885396,0.011287486,0.6023439,0.0062921103,0.27827618],"study_design_scores_gemma":[0.000030284265,0.000044690023,0.00012415541,0.000042446693,0.00002457341,0.00010138904,0.000075938195,0.28401875,0.006967431,0.7025528,0.0059940433,0.000023404007],"about_ca_topic_score_codex":0.0020385212,"about_ca_topic_score_gemma":0.002374313,"teacher_disagreement_score":0.005445702,"about_ca_system_score_codex":0.0013053039,"about_ca_system_score_gemma":0.0018026077,"threshold_uncertainty_score":0.018217623},"labels":[],"label_agreement":null},{"id":"W1778352006","doi":"10.1007/978-3-642-31155-0_19","title":"Minimum Convex Partitions and Maximum Empty Polytopes","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Calgary","funders":"","keywords":"Combinatorics; Mathematics; Convex body; Partition (number theory); Regular polygon; Convex polytope; Dimension (graph theory); Polytope; Upper and lower bounds; Convex hull; Unit cube; Convex set; General position; Polyhedron; Approximation algorithm; Steiner tree problem; Discrete mathematics; Convex optimization; Geometry; Mathematical analysis","score_opus":0.0200805532088027,"score_gpt":0.2471383111693847,"score_spread":0.227057757960582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778352006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085914105,0.0035346984,0.7998788,0.00109475,0.0003597537,0.00009898673,0.0006955108,0.0003203502,0.10810307],"genre_scores_gemma":[0.53459644,0.003466506,0.40072572,0.00039500833,0.00043067537,0.00038123023,0.0023581325,0.0011582867,0.05648799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930656,0.00015227536,0.000035771234,0.0001525598,0.00025977867,0.00009306532],"domain_scores_gemma":[0.9987721,0.0006975628,0.00009379972,0.00016086397,0.00016552996,0.00011010763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005825315,0.0010201144,0.0014220848,0.0013651302,0.0011646498,0.0026113158,0.0016266163,0.0011945952,0.010099255],"category_scores_gemma":[0.0041828994,0.0012778784,0.0010296436,0.001582498,0.0020506177,0.0040949536,0.0026900903,0.004014981,0.001146528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018952883,0.00004896542,0.00021623044,0.000446915,0.000022479167,0.00008588119,0.00021591413,0.041416425,0.0038514065,0.88764346,0.008722876,0.057139877],"study_design_scores_gemma":[0.000031551153,0.00004293384,0.000409445,0.000115047354,0.000016884043,0.00022083058,0.00015791474,0.06520102,0.0030436483,0.91683364,0.013903975,0.000023122759],"about_ca_topic_score_codex":0.00052244315,"about_ca_topic_score_gemma":0.0006842991,"teacher_disagreement_score":0.010099255,"about_ca_system_score_codex":0.0007615453,"about_ca_system_score_gemma":0.00032852445,"threshold_uncertainty_score":0.033785403},"labels":[],"label_agreement":null},{"id":"W177835669","doi":"10.1007/978-3-319-05960-0_7","title":"Faster FPGA Debug: Efficiently Coupling Trace Instruments with User Circuitry","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Debugging; Field-programmable gate array; Computer science; Observability; Embedded system; Background debug mode interface; Process (computing); TRACE (psycholinguistics); Construct (python library); Computer hardware; Operating system; Programming language","score_opus":0.010258751835662924,"score_gpt":0.2026206263339288,"score_spread":0.19236187449826586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177835669","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.033471305,0.0011215776,0.9046519,0.00021512057,0.00022972962,0.00011137566,0.00025567456,0.04151449,0.018428786],"genre_scores_gemma":[0.41822708,0.00074757275,0.5182359,0.00041483485,0.00011138095,0.00019467436,0.00096885883,0.008035593,0.05306406],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993111,0.00013704655,0.00003255395,0.00010752413,0.0003266773,0.00008512474],"domain_scores_gemma":[0.99876666,0.00051156693,0.00008654697,0.0004284584,0.00015925334,0.000047477002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766409,0.0016448434,0.0005451695,0.0011702948,0.00042264807,0.0018020468,0.0025931688,0.000982914,0.033280224],"category_scores_gemma":[0.0026572996,0.0009180304,0.00039189492,0.0009612756,0.00053928065,0.0034174446,0.0019902836,0.0015126329,0.005552989],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010185172,0.00018171428,0.0027131708,0.00046063965,0.00009386198,0.00034587947,0.00046281936,0.017188534,0.06920199,0.027802352,0.03277954,0.8477509],"study_design_scores_gemma":[0.00043792074,0.0010452238,0.0024720682,0.00030764155,0.00020303769,0.0017989106,0.00038847057,0.3592831,0.40394726,0.047680944,0.18227015,0.00016519353],"about_ca_topic_score_codex":0.00086674956,"about_ca_topic_score_gemma":0.0019324761,"teacher_disagreement_score":0.033280224,"about_ca_system_score_codex":0.0005845741,"about_ca_system_score_gemma":0.00069959747,"threshold_uncertainty_score":0.11133343},"labels":[],"label_agreement":null},{"id":"W1778672286","doi":"10.1007/978-3-642-31374-5_14","title":"Theory Presentation Combinators","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Combinatory logic; Presentation (obstetrics); Computer science; Key (lock); Ideal (ethics); Semantics (computer science); Programming language; Extension (predicate logic); Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics; Philosophy; Epistemology","score_opus":0.01981474727611228,"score_gpt":0.25216467233845213,"score_spread":0.23234992506233987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778672286","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.0062954794,0.0064688055,0.28964198,0.0050078807,0.0017499648,0.00013243918,0.0015001151,0.002508306,0.68669516],"genre_scores_gemma":[0.33722445,0.010969298,0.15076241,0.0032797826,0.0033529752,0.0006349877,0.0055128247,0.003569026,0.48469418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979442,0.0006050871,0.00015503108,0.0005743631,0.0005105228,0.00021088148],"domain_scores_gemma":[0.99847394,0.00056029175,0.00007771021,0.0004309782,0.00031939335,0.00013769387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014021912,0.0014745418,0.0013966004,0.0038847756,0.0037477857,0.012057636,0.002158309,0.0019329387,0.060117602],"category_scores_gemma":[0.0038268259,0.0014287191,0.0017019227,0.004142526,0.004880042,0.017524723,0.0044422746,0.0058924872,0.02040354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062994513,0.000008727841,0.00004090284,0.000047294798,0.000004517972,0.00001841288,0.00019283299,0.00010467393,0.00011976492,0.9773681,0.010638666,0.01144978],"study_design_scores_gemma":[0.0000068692716,0.000004502358,0.00003196152,0.000042259715,0.000007306293,0.0001002189,0.0000816338,0.00042894232,0.00023804496,0.90935975,0.08968944,0.000009157521],"about_ca_topic_score_codex":0.0011449825,"about_ca_topic_score_gemma":0.0010780714,"teacher_disagreement_score":0.060117602,"about_ca_system_score_codex":0.0034107962,"about_ca_system_score_gemma":0.0014779718,"threshold_uncertainty_score":0.2011134},"labels":[],"label_agreement":null},{"id":"W1778913696","doi":"10.1007/978-3-642-31534-3_48","title":"Reverse-Engineering Scanning Keyboards","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"York University","funders":"","keywords":"Huffman coding; Context (archaeology); Computer science; A priori and a posteriori; Divergence (linguistics); Probability distribution; Reverse engineering; Algorithm; Mathematics; Statistics; Data compression; Programming language","score_opus":0.015964942657373724,"score_gpt":0.22693284928285945,"score_spread":0.21096790662548573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778913696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041143347,0.0015039545,0.8991198,0.0002481136,0.0007554797,0.00018487609,0.00026998797,0.009358344,0.04741607],"genre_scores_gemma":[0.31430325,0.001671977,0.5877115,0.0002997335,0.00016242823,0.00016914187,0.0008598913,0.0027354718,0.09208659],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984345,0.00021770343,0.000110180474,0.00039058365,0.00067329785,0.00017374684],"domain_scores_gemma":[0.9951664,0.0012360164,0.00018669192,0.0019138923,0.0013962904,0.000100668185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007639101,0.0016444471,0.00088731654,0.00090465834,0.0006748684,0.001696878,0.0023039673,0.0013508204,0.031625565],"category_scores_gemma":[0.004968941,0.0009454786,0.0007725386,0.00090656965,0.00092699495,0.0038927086,0.0019333151,0.0013688351,0.015285232],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043970207,0.000094073155,0.00076390005,0.00067972485,0.000040515966,0.000578567,0.0005054322,0.003563476,0.21429211,0.023806464,0.010919596,0.7443164],"study_design_scores_gemma":[0.00006821603,0.0010191386,0.0017007996,0.00035256834,0.00015457309,0.008249344,0.00072389905,0.08467367,0.68403864,0.03498955,0.1838341,0.00019539143],"about_ca_topic_score_codex":0.0005385813,"about_ca_topic_score_gemma":0.0008547034,"teacher_disagreement_score":0.031625565,"about_ca_system_score_codex":0.00032571706,"about_ca_system_score_gemma":0.00058413716,"threshold_uncertainty_score":0.105798066},"labels":[],"label_agreement":null},{"id":"W1779179233","doi":"10.1007/3-540-44732-6_29","title":"Learning Complex Action Patterns with CRGST","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Alberta","funders":"","keywords":"Computer science; Constraint (computer-aided design); Action (physics); Process (computing); Artificial intelligence; Horn clause; Theoretical computer science; Programming language; Prolog; Mathematics","score_opus":0.037630391081157635,"score_gpt":0.25749621719513166,"score_spread":0.21986582611397404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779179233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018277755,0.00013622496,0.9787031,0.00010335398,0.000022965283,0.000055683075,0.00010291933,0.0013105556,0.0012874865],"genre_scores_gemma":[0.4319055,0.0002265605,0.5626221,0.00015825735,0.00003895504,0.0002262623,0.00068230845,0.00019001299,0.0039501567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995778,0.00008357879,0.00003419879,0.00015817236,0.00009624071,0.000049948598],"domain_scores_gemma":[0.9988096,0.00074756943,0.00008548876,0.00017419894,0.00014664196,0.000036533584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062532106,0.00057882996,0.0012644051,0.00079830113,0.00028477414,0.00086647,0.0013841848,0.00097552285,0.0058420734],"category_scores_gemma":[0.003124259,0.00055101665,0.000858213,0.0015822825,0.0006044605,0.0013338703,0.0018095572,0.0011830126,0.0010938206],"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.00018413019,0.00007969025,0.0015640465,0.00016257772,0.00008920154,0.00008754424,0.00011281928,0.22959916,0.0035880613,0.014205464,0.0025955318,0.74773175],"study_design_scores_gemma":[0.000018060278,0.000042064352,0.000208826,0.000010927557,0.000012795156,0.000036208035,0.0000216454,0.9816064,0.0010261772,0.016251275,0.0007594023,0.0000062568292],"about_ca_topic_score_codex":0.0069092414,"about_ca_topic_score_gemma":0.009761916,"teacher_disagreement_score":0.0069092414,"about_ca_system_score_codex":0.00049687043,"about_ca_system_score_gemma":0.0008508182,"threshold_uncertainty_score":0.019543648},"labels":[],"label_agreement":null},{"id":"W1779195044","doi":"10.1007/978-3-662-46078-8_23","title":"Efficient Online Strategies for Renting Servers in the Cloud","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Computer science; Server; Cloud computing; Renting; Database; Operating system","score_opus":0.05569048927228374,"score_gpt":0.3030071800178352,"score_spread":0.2473166907455515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779195044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09967973,0.0025870565,0.8584384,0.0012914975,0.00029204032,0.00059216085,0.0006118297,0.0012783344,0.035228994],"genre_scores_gemma":[0.7350367,0.0013230891,0.24613687,0.00013839387,0.0001685075,0.0002551209,0.0004056442,0.00035855,0.016177164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987141,0.00036932883,0.00006571887,0.00017022817,0.00027101708,0.00040962265],"domain_scores_gemma":[0.99805814,0.001159248,0.00010162299,0.00033141204,0.00015830042,0.00019122413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011169305,0.0014791059,0.002965952,0.0008882542,0.0013406223,0.0036252248,0.0040311604,0.0021520997,0.01679766],"category_scores_gemma":[0.005028015,0.0010209267,0.0011799308,0.0021880558,0.0008629699,0.0051892796,0.0024714896,0.0017647864,0.0022538002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001250534,0.00081734674,0.0011511322,0.0005935446,0.00013245323,0.00030414795,0.00026193936,0.50312394,0.011041738,0.1864837,0.03307878,0.26176077],"study_design_scores_gemma":[0.000070514005,0.000086757456,0.00019033064,0.0000261574,0.00003190192,0.0001351581,0.00011589253,0.9377499,0.0013912921,0.057650287,0.002531041,0.00002063618],"about_ca_topic_score_codex":0.0039990833,"about_ca_topic_score_gemma":0.0055395863,"teacher_disagreement_score":0.01679766,"about_ca_system_score_codex":0.0019646876,"about_ca_system_score_gemma":0.002329033,"threshold_uncertainty_score":0.05619377},"labels":[],"label_agreement":null},{"id":"W1779584415","doi":"10.1007/3-540-45739-9_20","title":"A Method for Testing the Conformance of Real Time Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Conformance testing; Computer science; Automaton; State space; Set (abstract data type); Algorithm; Transformation (genetics); Finite-state machine; Theoretical computer science; Programming language; State (computer science); Formal specification; Mathematics","score_opus":0.056270861027121304,"score_gpt":0.30365950191844865,"score_spread":0.24738864089132734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779584415","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.007325367,0.00006898708,0.9858037,0.000072644936,0.000073656185,0.00012905704,0.00008632906,0.0044751577,0.0019651288],"genre_scores_gemma":[0.15496354,0.00012111382,0.8362041,0.00015130336,0.000053662556,0.00047355884,0.0004125629,0.001101873,0.0065182317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549073,0.0011814322,0.00030772976,0.0009498045,0.0018106025,0.00025970867],"domain_scores_gemma":[0.98997074,0.005997742,0.0005097708,0.002408399,0.0008758996,0.00023742658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024312378,0.001228917,0.0010086198,0.0014282077,0.0006814678,0.0011797525,0.0021615617,0.0016454464,0.0075340765],"category_scores_gemma":[0.009470859,0.0008513396,0.0012811531,0.00087493734,0.0018158824,0.002844512,0.0017631499,0.0018514548,0.0020018723],"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.0008655981,0.00066871394,0.0035536592,0.0010992734,0.00026799637,0.00076995,0.00091935496,0.020820169,0.12025096,0.11201036,0.012923962,0.72585005],"study_design_scores_gemma":[0.0007769324,0.0016580961,0.0034605477,0.00030346564,0.0004289693,0.0031698386,0.00040526327,0.4310426,0.2833078,0.20905307,0.06610685,0.00028651653],"about_ca_topic_score_codex":0.0008554636,"about_ca_topic_score_gemma":0.0010141844,"teacher_disagreement_score":0.0075340765,"about_ca_system_score_codex":0.0003967909,"about_ca_system_score_gemma":0.0009429052,"threshold_uncertainty_score":0.025204003},"labels":[],"label_agreement":null},{"id":"W1779930287","doi":"10.1007/978-3-540-74260-9_1","title":"A New Image Scaling Algorithm Based on the Sampling Theorem of Papoulis","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Aliasing; Scaling; Computer science; Image scaling; Algorithm; Sampling (signal processing); Image (mathematics); Nyquist–Shannon sampling theorem; Classification of discontinuities; Curvature; Image processing; Mathematics; Artificial intelligence; Computer vision; Filter (signal processing); Geometry; Mathematical analysis","score_opus":0.028100267211453735,"score_gpt":0.2958744394518806,"score_spread":0.2677741722404268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779930287","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.004354201,0.00039840036,0.9928564,0.00007744534,0.00022282943,0.000034008503,0.00002697248,0.0006685616,0.0013612342],"genre_scores_gemma":[0.03242286,0.00046607078,0.9634551,0.00008746318,0.00017481373,0.00007207058,0.00009231075,0.0001691045,0.0030602126],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963,0.000037294845,0.000017862088,0.00008391693,0.00020724743,0.000023743627],"domain_scores_gemma":[0.99957436,0.00012766654,0.000028855542,0.0000751272,0.00015921652,0.000034829503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045714225,0.00086821837,0.000990397,0.0010788348,0.0004884844,0.0010543881,0.0010375036,0.00077245134,0.0040620235],"category_scores_gemma":[0.0014186355,0.000390979,0.00068702665,0.0011492573,0.0005780185,0.0014506964,0.00094692677,0.0012973647,0.0015941003],"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.00018982466,0.00006870739,0.00043094944,0.00020100673,0.00006407068,0.00013850027,0.0000848695,0.011079304,0.10180588,0.032693494,0.0060748495,0.84716845],"study_design_scores_gemma":[0.00009909883,0.0002210927,0.0011883691,0.000032576514,0.00009959453,0.0013826579,0.000048603208,0.84845746,0.08270357,0.02474646,0.04093997,0.00008049796],"about_ca_topic_score_codex":0.0008710606,"about_ca_topic_score_gemma":0.0009973586,"teacher_disagreement_score":0.0040620235,"about_ca_system_score_codex":0.00037996366,"about_ca_system_score_gemma":0.00047982796,"threshold_uncertainty_score":0.013588846},"labels":[],"label_agreement":null},{"id":"W1780120716","doi":"10.1007/11681960_7","title":"An Agent Negotiation Engine for Collaborative Decision Making","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Negotiation; Computer science; Social Welfare; Multi-agent system; Autonomous agent; Negotiation theory; Operations research; Knowledge management; Management science; Artificial intelligence; Engineering","score_opus":0.021270044020192974,"score_gpt":0.27992183612734245,"score_spread":0.2586517921071495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780120716","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.003022265,0.00023228396,0.97361153,0.0001414285,0.00012651048,0.000241902,0.00021425058,0.014518234,0.007891564],"genre_scores_gemma":[0.07535945,0.00037372805,0.9033808,0.00021685859,0.00006024117,0.00054413325,0.0011541733,0.0014517457,0.017459005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875796,0.000322601,0.00014085682,0.00015648302,0.000532214,0.00008992948],"domain_scores_gemma":[0.998809,0.0006661644,0.000042371274,0.00021145708,0.00018240827,0.000088591645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025663688,0.00097516045,0.0015283615,0.0011630246,0.0014074054,0.0035949294,0.0036374552,0.0018983922,0.016838092],"category_scores_gemma":[0.004887854,0.001100731,0.0010550789,0.0012588444,0.0006709075,0.004175198,0.002900171,0.002035303,0.0063571786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014263232,0.0007378544,0.0007794456,0.0007915901,0.00033551073,0.00066867284,0.001065553,0.0671178,0.018531809,0.22887102,0.04938381,0.6302907],"study_design_scores_gemma":[0.0002627098,0.00009622855,0.00022955032,0.000111251604,0.00020419668,0.0003104394,0.00007910051,0.78145134,0.021020332,0.105896324,0.090231724,0.00010684737],"about_ca_topic_score_codex":0.0024867428,"about_ca_topic_score_gemma":0.0026679197,"teacher_disagreement_score":0.016838092,"about_ca_system_score_codex":0.00064650294,"about_ca_system_score_gemma":0.0013236905,"threshold_uncertainty_score":0.05632907},"labels":[],"label_agreement":null},{"id":"W178057547","doi":"10.1007/978-3-642-32355-3_8","title":"Position Paper: Researching and Developing Open Architectures for National Health Information Systems in Developing African Countries","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Interoperability; Computer science; Developing country; Information system; Knowledge management; Architecture; Health informatics; Economic growth; World Wide Web; Health care; Engineering; Geography","score_opus":0.0807949573846497,"score_gpt":0.4227667380103001,"score_spread":0.3419717806256504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178057547","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12655154,0.04767182,0.12415723,0.2569035,0.033639893,0.0025273375,0.0060064173,0.0014005371,0.40114167],"genre_scores_gemma":[0.24967295,0.043316737,0.1291241,0.011692531,0.005882279,0.00082496443,0.0062749004,0.0009509265,0.5522606],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989427,0.00027354443,0.00004073567,0.0001570796,0.00031937545,0.00026657092],"domain_scores_gemma":[0.9964282,0.0013115605,0.0001658484,0.00017293727,0.0010135819,0.000907889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044671455,0.0005274143,0.00023362516,0.00069511717,0.0015625918,0.0051701,0.0010985631,0.0015371821,0.027919136],"category_scores_gemma":[0.0049012317,0.00023833325,0.00029463504,0.0019439833,0.00073027646,0.0067392164,0.0016521779,0.0017985068,0.003556686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002571221,0.00060533197,0.0036828492,0.0009731284,0.000030237861,0.00023017105,0.0035298886,0.0027427247,0.0059522153,0.11307065,0.5613432,0.30758247],"study_design_scores_gemma":[0.00011934535,0.0005752221,0.0044957427,0.00062970433,0.000063703075,0.00020528473,0.004492706,0.003987825,0.011763506,0.029035814,0.94458777,0.000043497814],"about_ca_topic_score_codex":0.006556356,"about_ca_topic_score_gemma":0.007912242,"teacher_disagreement_score":0.027919136,"about_ca_system_score_codex":0.0023635635,"about_ca_system_score_gemma":0.0081816735,"threshold_uncertainty_score":0.09339887},"labels":[],"label_agreement":null},{"id":"W1780903238","doi":"10.1007/11428848_122","title":"Improving the Sensitivity and Specificity of Protein Homology Search by Incorporating Predicted Secondary Structures","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Homology (biology); Protein secondary structure; Homology modeling; Protein structure prediction; Computational biology; Protein structure; Artificial intelligence; Algorithm; Machine learning; Data mining; Biology; Genetics; Amino acid; Biochemistry","score_opus":0.006551301574485018,"score_gpt":0.21629037496477208,"score_spread":0.20973907339028705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780903238","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.22149082,0.0035873812,0.7554357,0.00049118116,0.00017139943,0.00013934329,0.00043662044,0.011578442,0.0066691884],"genre_scores_gemma":[0.51629114,0.0013184175,0.47654283,0.0005305851,0.00012979568,0.00007252963,0.0013271146,0.00074942125,0.0030381796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975068,0.0011457718,0.0001485351,0.0003816749,0.00068641984,0.00013094457],"domain_scores_gemma":[0.9832298,0.013585505,0.00033389896,0.0013766487,0.0012722856,0.00020180373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052084937,0.0008752955,0.001656686,0.0015812577,0.0003186566,0.0014392115,0.0015520982,0.0014600361,0.0021116824],"category_scores_gemma":[0.014165799,0.0006725348,0.0007700594,0.0011708076,0.00054747745,0.0025109248,0.001322339,0.0010788902,0.0029354459],"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.0018736034,0.0005320293,0.015494818,0.0006545181,0.00036699208,0.00027107837,0.00013488799,0.06023737,0.27603605,0.00438048,0.0058003324,0.63421774],"study_design_scores_gemma":[0.0000958409,0.00035761337,0.0038699636,0.000047826332,0.00022916084,0.0011200919,0.00005099663,0.8240663,0.15663286,0.009028015,0.0044294856,0.00007189456],"about_ca_topic_score_codex":0.0005355089,"about_ca_topic_score_gemma":0.0009018437,"teacher_disagreement_score":0.0052084937,"about_ca_system_score_codex":0.0003193893,"about_ca_system_score_gemma":0.00037902233,"threshold_uncertainty_score":0.027545452},"labels":[],"label_agreement":null},{"id":"W1781227130","doi":"10.1007/978-3-540-77046-6_77","title":"Deformable Object Tracking: A Kernel Density Estimation Approach Via Level Set Function Evolution","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Kernel density estimation; Probability density function; Kernel (algebra); Artificial intelligence; Video tracking; Divergence (linguistics); Density estimation; Partial differential equation; Computer vision; Boundary (topology); Tracking (education); Frame (networking); Mathematics; Constraint (computer-aided design); Computer science; Ordinary differential equation; Pattern recognition (psychology); Object (grammar); Differential equation; Mathematical analysis; Geometry; Statistics","score_opus":0.04895827984192361,"score_gpt":0.28633055353525677,"score_spread":0.23737227369333316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781227130","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.0009880029,0.00009004116,0.9984565,0.000026273061,0.000009564493,0.0000075114817,0.0000059451436,0.00016591679,0.00025034393],"genre_scores_gemma":[0.09352117,0.0005693498,0.9015506,0.00008439281,0.000033952118,0.00007123815,0.00009389342,0.00041314957,0.0036622556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995597,0.00008797029,0.000023304916,0.000094185125,0.00020434248,0.00003039479],"domain_scores_gemma":[0.9992472,0.0003533823,0.000081835395,0.00013221343,0.00015193514,0.000033578835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450354,0.00065866107,0.0013477632,0.0010424843,0.0004189704,0.0014527071,0.0022394399,0.001871612,0.0019367298],"category_scores_gemma":[0.0031914162,0.00097402197,0.0011698283,0.0015441388,0.00070927996,0.002029396,0.0015782244,0.0017526054,0.0011217645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000858997,0.00008459336,0.0005379056,0.00015888583,0.00012905136,0.00011430951,0.00017934205,0.47347802,0.023161393,0.04556947,0.0025247666,0.45397633],"study_design_scores_gemma":[0.0000018526579,0.00000569693,0.000075278025,0.000003931379,0.000007674712,0.000030243262,0.000002938713,0.9942958,0.0016415425,0.0032547815,0.0006732683,0.0000069942516],"about_ca_topic_score_codex":0.0034361945,"about_ca_topic_score_gemma":0.0029617965,"teacher_disagreement_score":0.0034361945,"about_ca_system_score_codex":0.0009194726,"about_ca_system_score_gemma":0.00067487196,"threshold_uncertainty_score":0.006832421},"labels":[],"label_agreement":null},{"id":"W1781258632","doi":"10.1007/978-3-642-31295-3_21","title":"Real-Time Image Alignment for a Gyro-visual Hybrid Pointing Device","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Cursor (databases); Computer vision; Artificial intelligence; Robustness (evolution); Gyroscope","score_opus":0.01102571165242824,"score_gpt":0.23438810843120453,"score_spread":0.22336239677877628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781258632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039229408,0.0004504404,0.9466161,0.00017714484,0.0004053865,0.00008880514,0.00020261429,0.0055445787,0.007285394],"genre_scores_gemma":[0.49696806,0.00033373618,0.48112598,0.00016039614,0.00010882785,0.00013285279,0.00040830436,0.00030401023,0.020457922],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996768,0.00003364271,0.000015788577,0.00010135559,0.00014207783,0.000030417377],"domain_scores_gemma":[0.9997111,0.000052573407,0.00003566633,0.00007143317,0.0000995726,0.000029603045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003355115,0.00071450864,0.0005941993,0.00036056683,0.00044928567,0.0007512108,0.0009882004,0.0010855177,0.006680477],"category_scores_gemma":[0.0006251343,0.0003585732,0.00023733186,0.00046406194,0.00025392702,0.00077532005,0.0008733198,0.00061492773,0.0029057884],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006783221,0.000082799124,0.000868675,0.00021754768,0.000041282525,0.00034051103,0.00025602084,0.004917722,0.6308068,0.0030221646,0.0059047346,0.3528634],"study_design_scores_gemma":[0.00025573213,0.0017083794,0.01321691,0.00017023057,0.00016413968,0.0034457266,0.00030054347,0.30815727,0.58766425,0.0037927437,0.080882736,0.00024135578],"about_ca_topic_score_codex":0.0008909845,"about_ca_topic_score_gemma":0.0012902318,"teacher_disagreement_score":0.006680477,"about_ca_system_score_codex":0.00020611625,"about_ca_system_score_gemma":0.00040762732,"threshold_uncertainty_score":0.022348464},"labels":[],"label_agreement":null},{"id":"W1781278756","doi":"10.1007/978-3-642-10520-3_42","title":"Online Video Textures Generation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Concordia University","funders":"","keywords":"Isomap; Computer science; Artificial intelligence; Autoregressive model; Process (computing); Pattern recognition (psychology); Set (abstract data type); Computer vision; Dimensionality reduction; Nonlinear dimensionality reduction; Mathematics","score_opus":0.019012683711492027,"score_gpt":0.2483335604042227,"score_spread":0.22932087669273066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781278756","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012929769,0.00061451574,0.9223925,0.00019324908,0.00048268816,0.0003764105,0.0022621278,0.025230788,0.03551797],"genre_scores_gemma":[0.20164542,0.0009989545,0.7164843,0.0002047146,0.00023867936,0.00040398596,0.009911334,0.0032207323,0.0668919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997787,0.000017975643,0.0000089900295,0.000061030078,0.00010432222,0.000029074272],"domain_scores_gemma":[0.9997348,0.000050018178,0.00001187533,0.000084275256,0.000087061795,0.00003189833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022448444,0.0009868292,0.00055330945,0.0010936793,0.0003634875,0.00093112973,0.0010653619,0.00064413575,0.05108521],"category_scores_gemma":[0.0009174096,0.00030152942,0.00051992026,0.00083723076,0.00016651857,0.00082356937,0.0011077389,0.0005425683,0.014379659],"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.00040379644,0.00011971403,0.00021362837,0.0001564394,0.00002050264,0.00020212737,0.00004654515,0.005186518,0.06092657,0.004721645,0.042573374,0.88542926],"study_design_scores_gemma":[0.00020008825,0.00030134502,0.0019149987,0.00010837139,0.00008013409,0.0012834276,0.00018892331,0.51778007,0.25738156,0.018739635,0.20194574,0.00007569461],"about_ca_topic_score_codex":0.0015487757,"about_ca_topic_score_gemma":0.0020376008,"teacher_disagreement_score":0.05108521,"about_ca_system_score_codex":0.00029143563,"about_ca_system_score_gemma":0.00029936308,"threshold_uncertainty_score":0.170897},"labels":[],"label_agreement":null},{"id":"W1782163248","doi":"10.1007/978-3-642-54903-8_31","title":"How Complementary Are Different Information Retrieval Techniques? A Study in Biomedicine Domain","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"York University","funders":"","keywords":"Computer science; Novelty; Information retrieval; Biomedicine; Domain (mathematical analysis); Novelty detection; Track (disk drive); Data science; Artificial intelligence; Data mining","score_opus":0.020613538968628668,"score_gpt":0.2665210712310208,"score_spread":0.24590753226239215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782163248","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.7777686,0.079765834,0.02308899,0.005594718,0.00017050805,0.00013763778,0.0003320479,0.00016630889,0.11297529],"genre_scores_gemma":[0.96231073,0.0153253535,0.017950844,0.0006431606,0.00020965622,0.000040346036,0.00024056375,0.00008692043,0.0031924061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920929,0.0042239884,0.00039686981,0.0005303298,0.002481926,0.000273877],"domain_scores_gemma":[0.8689092,0.12051256,0.001995438,0.0015883549,0.0060817357,0.00091281516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008028994,0.00042071115,0.0007762157,0.0062147514,0.0013945411,0.0054049515,0.0009066685,0.0012051304,0.0032579869],"category_scores_gemma":[0.06154073,0.0003472642,0.0009519614,0.008088965,0.0016591027,0.009053899,0.0012116526,0.0011823649,0.00074612885],"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.0015417841,0.00073921203,0.07379919,0.002147994,0.0006226467,0.00045653508,0.014725171,0.001675488,0.008807069,0.032196157,0.0060080327,0.8572808],"study_design_scores_gemma":[0.0005112516,0.006403647,0.51477826,0.0041796165,0.0053535146,0.011844428,0.0674864,0.073150076,0.031766586,0.16064405,0.12339816,0.0004839928],"about_ca_topic_score_codex":0.0032845377,"about_ca_topic_score_gemma":0.0027513523,"teacher_disagreement_score":0.008028994,"about_ca_system_score_codex":0.0016266628,"about_ca_system_score_gemma":0.0012289024,"threshold_uncertainty_score":0.04246193},"labels":[],"label_agreement":null},{"id":"W1782414784","doi":"10.1007/978-3-642-37431-9_41","title":"Spatiotemporal Salience via Centre-Surround Comparison of Visual Spacetime Orientations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"Salience (neuroscience); Salient; Computer science; Spacetime; Artificial intelligence; Visualization; Computer vision; Pattern recognition (psychology); Algorithm","score_opus":0.020598825893342474,"score_gpt":0.299061552346803,"score_spread":0.2784627264534605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782414784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29142058,0.0013345628,0.6975333,0.00016390788,0.0001423733,0.000066418375,0.00035363052,0.0006757601,0.008309483],"genre_scores_gemma":[0.87867016,0.0005583438,0.11910293,0.00003388815,0.00008408437,0.00002190234,0.00022779012,0.00013110836,0.0011697267],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982965,0.000030260566,0.000006305992,0.00006560182,0.000044324195,0.000023855626],"domain_scores_gemma":[0.9995708,0.00015508961,0.000086855456,0.00004655169,0.00008955103,0.000051117084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042552868,0.00035359449,0.00047655404,0.0011716433,0.00022861498,0.0010221199,0.00048139217,0.00026202964,0.0017273288],"category_scores_gemma":[0.002487967,0.00030029667,0.0003365074,0.0012853679,0.00034669938,0.0010245353,0.0008700259,0.00041738298,0.00027441097],"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.0013323782,0.00008268867,0.0047795805,0.00030103364,0.00013897583,0.00015861598,0.0004108531,0.016451987,0.5130929,0.030988729,0.0024627715,0.42979947],"study_design_scores_gemma":[0.00011556335,0.00068589114,0.08104522,0.00008184734,0.0003029847,0.0009246722,0.00027177896,0.6939568,0.14413753,0.07032247,0.008024571,0.00013077447],"about_ca_topic_score_codex":0.0014271851,"about_ca_topic_score_gemma":0.0020088807,"teacher_disagreement_score":0.0017273288,"about_ca_system_score_codex":0.00043304721,"about_ca_system_score_gemma":0.00029610924,"threshold_uncertainty_score":0.005778551},"labels":[],"label_agreement":null},{"id":"W1782814202","doi":"10.1007/978-3-540-24840-8_25","title":"A Decision-Theoretic Graphical Model for Collaborative Design on Supply Chains","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Supply chain; Theoretical computer science; Software engineering; Operations research; Mathematics","score_opus":0.019826722450726968,"score_gpt":0.22915413924396533,"score_spread":0.20932741679323835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782814202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070054294,0.00018828687,0.98628134,0.0005625701,0.000029270419,0.00010770106,0.00034232976,0.00021793717,0.0052650366],"genre_scores_gemma":[0.58103675,0.0010421149,0.39581662,0.00037417273,0.00018844446,0.001033771,0.001048323,0.00019321969,0.019266473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99368405,0.0037898843,0.00024420262,0.0010362781,0.0007839563,0.0004616018],"domain_scores_gemma":[0.98665386,0.010644312,0.00073669414,0.00079234614,0.00073578215,0.00043708252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005065633,0.0019368809,0.0025362896,0.0014640725,0.0012162118,0.0041862833,0.004402275,0.004351413,0.014221149],"category_scores_gemma":[0.015647747,0.001979617,0.0023923877,0.002897442,0.0032114906,0.0051197587,0.0024827798,0.0032434699,0.002025929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011758298,0.00010323952,0.0002954255,0.00013129984,0.00007149897,0.00013866888,0.00019523733,0.6387113,0.00049268606,0.34377754,0.0020156924,0.013949857],"study_design_scores_gemma":[0.00007180204,0.000043010838,0.000058267964,0.000019092678,0.000036515008,0.000038976224,0.000020668496,0.80423224,0.00010769083,0.19382843,0.0015225881,0.000020656691],"about_ca_topic_score_codex":0.010789381,"about_ca_topic_score_gemma":0.008736938,"teacher_disagreement_score":0.014221149,"about_ca_system_score_codex":0.0033160755,"about_ca_system_score_gemma":0.0025808134,"threshold_uncertainty_score":0.04757452},"labels":[],"label_agreement":null},{"id":"W1783202385","doi":"10.1007/978-3-540-75187-8_23","title":"Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Monomial; Lexicographical order; Computer science; Bounded function; Quotient; Amortized analysis; Polynomial; Data structure; Discrete mathematics; Mathematics; Algorithm; Combinatorics; Programming language","score_opus":0.023608894438104884,"score_gpt":0.27824144387327654,"score_spread":0.25463254943517166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783202385","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.03270888,0.003477824,0.9265023,0.00033984787,0.00043242014,0.00005847389,0.00022101852,0.003279891,0.032979466],"genre_scores_gemma":[0.3840268,0.003374014,0.56888115,0.00020367779,0.00037370998,0.0001059547,0.0007003518,0.0013445864,0.04098979],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.000069434354,0.000043085474,0.00011308722,0.00018484368,0.00009699651],"domain_scores_gemma":[0.99942833,0.00015785171,0.00004373721,0.000254511,0.00008892345,0.000026695461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039172106,0.0007364794,0.0008240043,0.0009211484,0.000840965,0.0019804651,0.0011588146,0.00037634323,0.009292942],"category_scores_gemma":[0.0018776549,0.00055285,0.0005958229,0.0024050416,0.0010929389,0.0040372876,0.0020663233,0.0013329528,0.003464174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006418756,0.00009441031,0.000546083,0.00033945055,0.000048455677,0.00009858437,0.0002261121,0.019671101,0.015287793,0.341741,0.018622555,0.6026826],"study_design_scores_gemma":[0.00021527511,0.00024278865,0.0005660207,0.00014924689,0.00010514619,0.0006733622,0.00014357355,0.15727016,0.06524391,0.66824675,0.10705049,0.000093322866],"about_ca_topic_score_codex":0.0006607613,"about_ca_topic_score_gemma":0.0012713827,"teacher_disagreement_score":0.009292942,"about_ca_system_score_codex":0.0007068848,"about_ca_system_score_gemma":0.0007560728,"threshold_uncertainty_score":0.031087935},"labels":[],"label_agreement":null},{"id":"W1783308240","doi":"10.1007/978-3-540-74573-0_26","title":"A Probabilistic Multi-agent Scheduler Implemented in JXTA","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Acadia University","funders":"","keywords":"Probabilistic logic; Computer science; Scheduling (production processes); Distributed computing; Schedule; Interval (graph theory); Multi-agent system; Constraint satisfaction problem; Graph; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.0396655249298687,"score_gpt":0.29231285016758496,"score_spread":0.25264732523771627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783308240","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.022429248,0.00026959874,0.88546664,0.00035504997,0.00061148714,0.0003146572,0.0006088392,0.07886848,0.011076007],"genre_scores_gemma":[0.32158664,0.0002774782,0.64590853,0.00035929668,0.00026753207,0.00055478443,0.0010606544,0.006254761,0.023730299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.00014770846,0.00007162926,0.00018643559,0.000298697,0.00010813788],"domain_scores_gemma":[0.99835926,0.00061562576,0.000088238485,0.0003764133,0.0002968805,0.00026352392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021950796,0.00060634554,0.0011841429,0.00065085373,0.0013044687,0.0028080922,0.002982303,0.001116557,0.023016647],"category_scores_gemma":[0.004541056,0.0009656772,0.0006794857,0.00062518753,0.00076819997,0.0017800175,0.0017184952,0.001872552,0.0048808777],"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.004599906,0.0012412753,0.007431809,0.0011884755,0.000629944,0.00081014796,0.0013994285,0.23234718,0.05296811,0.17784756,0.0784426,0.4410935],"study_design_scores_gemma":[0.0005687778,0.00014269886,0.0005639308,0.000032460423,0.0001288948,0.00013723345,0.00005803442,0.90587187,0.0153303845,0.030161813,0.046931706,0.00007226634],"about_ca_topic_score_codex":0.0047889883,"about_ca_topic_score_gemma":0.006027512,"teacher_disagreement_score":0.023016647,"about_ca_system_score_codex":0.00087148603,"about_ca_system_score_gemma":0.0027474929,"threshold_uncertainty_score":0.07699841},"labels":[],"label_agreement":null},{"id":"W1783453637","doi":"10.1007/978-3-642-55032-4_28","title":"Online Learning for Two Novel Latent Topic Models","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latent Dirichlet allocation; Topic model; Computer science; Dirichlet distribution; Artificial intelligence; Machine learning; Latent variable; Mathematics","score_opus":0.039852724433394396,"score_gpt":0.2890081609870012,"score_spread":0.24915543655360683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783453637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114984615,0.0004240786,0.98565,0.0006051949,0.00010078044,0.00005708247,0.00018908104,0.0005172531,0.00095811783],"genre_scores_gemma":[0.27822843,0.0009118259,0.7024371,0.00053377287,0.0008037033,0.00082651275,0.0024755641,0.00060679414,0.013176304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973241,0.0010178594,0.00017561615,0.00074550894,0.00045306538,0.00028385306],"domain_scores_gemma":[0.97912574,0.017731,0.0004727135,0.0014669211,0.00073351024,0.00047012683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006257395,0.0014457874,0.0026472507,0.0015805456,0.0012980007,0.0033531124,0.0051280335,0.0043356232,0.009906343],"category_scores_gemma":[0.025250135,0.0015965854,0.0026034194,0.002303551,0.0014913206,0.0086612385,0.0047851084,0.0058894046,0.002621012],"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.001484553,0.0006485804,0.002680254,0.0008080748,0.00033149216,0.00034226253,0.0009530491,0.1866765,0.0043320497,0.2496499,0.023360616,0.5287326],"study_design_scores_gemma":[0.000074490694,0.000028304774,0.00017438058,0.000023413377,0.0000419244,0.000064613305,0.000030557978,0.90646154,0.00047550723,0.09124799,0.001356493,0.000020734617],"about_ca_topic_score_codex":0.0028491388,"about_ca_topic_score_gemma":0.004395791,"teacher_disagreement_score":0.009906343,"about_ca_system_score_codex":0.001892696,"about_ca_system_score_gemma":0.0014721173,"threshold_uncertainty_score":0.033140063},"labels":[],"label_agreement":null},{"id":"W1783789643","doi":"10.1007/3-540-45071-8_8","title":"A Space Efficient Algorithm for Sequence Alignment with Inversions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Substring; Shuffling; Algorithm; Computation; Sequence (biology); Computer science; Smith–Waterman algorithm; Dynamic programming; Space (punctuation); Pairwise comparison; Multiple sequence alignment; Longest common subsequence problem; Sequence alignment; Combinatorics; Mathematics; Data structure; Genetics; Biology; Gene; Artificial intelligence","score_opus":0.019360991256674173,"score_gpt":0.24537314774323155,"score_spread":0.22601215648655737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783789643","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.0018036672,0.00021942852,0.99302,0.00006503793,0.000091919406,0.00006259446,0.00011214186,0.0036838013,0.0009414149],"genre_scores_gemma":[0.012489472,0.0001600463,0.9840103,0.00006207992,0.000049348877,0.00016494398,0.00055186095,0.00046575617,0.002046228],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830604,0.00036974766,0.00014830548,0.00037922958,0.0006243161,0.0001723706],"domain_scores_gemma":[0.9982545,0.000691833,0.00010754883,0.00048790165,0.00040479802,0.00005331573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012968767,0.0027110016,0.0020336767,0.0025717805,0.0016793517,0.0020340735,0.0026191678,0.0018129953,0.010609985],"category_scores_gemma":[0.0047713714,0.0010663458,0.0015665076,0.004834246,0.0010221165,0.0031334546,0.0032094808,0.002925605,0.009289952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037392313,0.00016620534,0.00029601797,0.00026941946,0.00009679686,0.00016886552,0.00025090968,0.024240864,0.02805138,0.03822918,0.018972825,0.88888353],"study_design_scores_gemma":[0.00037715814,0.0005391953,0.00062914693,0.0001295206,0.00017234952,0.0012712748,0.0003322811,0.6321723,0.072222434,0.20385067,0.08811441,0.00018921275],"about_ca_topic_score_codex":0.0021757756,"about_ca_topic_score_gemma":0.0033264202,"teacher_disagreement_score":0.010609985,"about_ca_system_score_codex":0.0007649678,"about_ca_system_score_gemma":0.0017843344,"threshold_uncertainty_score":0.03549391},"labels":[],"label_agreement":null},{"id":"W178393112","doi":"10.1007/3-540-47979-1_41","title":"Image Registration for Foveated Omnidirectional Sensing","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"York University","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Catadioptric system; Omnidirectional antenna; Image registration; Image resolution; Feature (linguistics); Parametric statistics; Computer graphics (images); Image (mathematics); Optics; Mathematics","score_opus":0.022795876442608772,"score_gpt":0.27328464596552166,"score_spread":0.2504887695229129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178393112","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.008287213,0.0003825394,0.9870199,0.000038462913,0.00004437304,0.000023780412,0.000065382825,0.0008556326,0.0032826804],"genre_scores_gemma":[0.11498015,0.00058342266,0.8725112,0.000059568552,0.00004063656,0.000060390346,0.00032864691,0.00029379703,0.011142119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996227,0.000049753777,0.000016605964,0.00011082639,0.00016259027,0.00003763134],"domain_scores_gemma":[0.999764,0.00005345265,0.000024495685,0.00009615231,0.00005065996,0.000011220505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027444132,0.0004902259,0.000670593,0.000423033,0.00024813332,0.00074292265,0.0008395184,0.0005888484,0.005181276],"category_scores_gemma":[0.0008409422,0.0004397222,0.0004333873,0.00081990863,0.0003800423,0.0010163602,0.0011835204,0.00055204885,0.0023909826],"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.00041155083,0.00006898119,0.00039033504,0.00023762237,0.00006528586,0.00017921136,0.00018386252,0.022612905,0.25776717,0.028876645,0.007229237,0.68197715],"study_design_scores_gemma":[0.000051862946,0.00028221676,0.0031215334,0.00006742975,0.00008184203,0.0023726434,0.00012522671,0.6661025,0.24682494,0.0311235,0.049750578,0.000095757154],"about_ca_topic_score_codex":0.001164874,"about_ca_topic_score_gemma":0.0020969063,"teacher_disagreement_score":0.005181276,"about_ca_system_score_codex":0.0002977327,"about_ca_system_score_gemma":0.00045692292,"threshold_uncertainty_score":0.01733309},"labels":[],"label_agreement":null},{"id":"W1784203056","doi":"10.1007/11851561_36","title":"Segmentation with an Isochore Distribution","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université de Montréal","funders":"","keywords":"Segmentation; Computer science; Sequence (biology); Probabilistic logic; Markov chain; Image segmentation; Artificial intelligence; Scale-space segmentation; Class (philosophy); Pattern recognition (psychology); Hidden Markov model; Generative model; Generative grammar; Algorithm; Machine learning","score_opus":0.00812662478450473,"score_gpt":0.22547367353191375,"score_spread":0.217347048747409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784203056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029659232,0.00008563591,0.9935808,0.00006520686,0.000033455133,0.000019472733,0.00004075446,0.0006263343,0.0025824157],"genre_scores_gemma":[0.08843453,0.00028075953,0.9004253,0.00009361511,0.00008212377,0.00007984661,0.00031594015,0.0014297925,0.008858126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957985,0.000087928696,0.000025148549,0.0001348561,0.00013537757,0.00003684444],"domain_scores_gemma":[0.99950314,0.00016027353,0.000030489688,0.00015118723,0.00011562216,0.000039296236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092055567,0.0005812559,0.0008224083,0.0016541902,0.0006261599,0.0015651031,0.0015164736,0.0012888231,0.011144844],"category_scores_gemma":[0.0018470866,0.00082446326,0.0010411384,0.0016192495,0.0012060513,0.0016106932,0.0019491294,0.0012797449,0.0030580084],"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.00035309477,0.000057560774,0.00054678845,0.00028705897,0.00009221549,0.00016732563,0.00035588176,0.09126536,0.06445937,0.2731427,0.008281008,0.56099164],"study_design_scores_gemma":[0.000032976404,0.000049961178,0.0005389006,0.000036738158,0.000029016388,0.0003498658,0.000052355917,0.79915756,0.01732293,0.16291547,0.019474441,0.000039851064],"about_ca_topic_score_codex":0.001339357,"about_ca_topic_score_gemma":0.0016681659,"teacher_disagreement_score":0.011144844,"about_ca_system_score_codex":0.00066961115,"about_ca_system_score_gemma":0.0004669137,"threshold_uncertainty_score":0.03728324},"labels":[],"label_agreement":null},{"id":"W1784211297","doi":"10.1007/11604655_17","title":"Cleaning an Arbitrary Regular Network with Mobile Agents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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 Ottawa","funders":"","keywords":"Computer science; Graph; Relation (database); Mobile agent; Task (project management); Mobile genetic elements; Theoretical computer science; Distributed computing; Data mining","score_opus":0.018198049037657742,"score_gpt":0.2504142197784038,"score_spread":0.23221617074074605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784211297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092624344,0.00029401248,0.89562696,0.00066915556,0.00020901182,0.00014432472,0.00028665527,0.00095107267,0.009194474],"genre_scores_gemma":[0.51283437,0.0005424219,0.458923,0.00022012451,0.00017099644,0.0002076976,0.00070634723,0.00044917862,0.025945915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900657,0.00022741561,0.000055421177,0.00033987194,0.00019828601,0.00017254105],"domain_scores_gemma":[0.9977513,0.00084818795,0.0001876036,0.0008556968,0.00019090279,0.00016639076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010545739,0.00074237207,0.0013139959,0.00079458085,0.0014469946,0.0014707666,0.0025713218,0.0016931221,0.004088654],"category_scores_gemma":[0.0057044923,0.00071119,0.0011369236,0.0010493431,0.0012777774,0.003404196,0.003135645,0.0015078887,0.00085448474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010565895,0.00020281292,0.001684802,0.0004010717,0.00015661321,0.0008490725,0.00030040974,0.7076098,0.016318971,0.14897747,0.01034941,0.11209299],"study_design_scores_gemma":[0.000045569333,0.00010406761,0.0002414861,0.00002037095,0.000038740345,0.00021717201,0.00010238952,0.88560075,0.004746206,0.10217359,0.006690454,0.000019248955],"about_ca_topic_score_codex":0.0015961636,"about_ca_topic_score_gemma":0.0015467015,"teacher_disagreement_score":0.004088654,"about_ca_system_score_codex":0.00058163994,"about_ca_system_score_gemma":0.00063493283,"threshold_uncertainty_score":0.013677835},"labels":[],"label_agreement":null},{"id":"W178450645","doi":"10.1007/978-3-642-21708-1_49","title":"Measuring Cultural Markers in Arabic Government Websites Using Hofstede’s Cultural Dimensions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web visibility and informetrics","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":"McGill University","funders":"","keywords":"Hofstede's cultural dimensions theory; Arabic; Government (linguistics); Dimension (graph theory); Cultural values; Christian ministry; Computer science; Sociology; Mathematics; Social science; Linguistics; Political science; Pure mathematics","score_opus":0.06110249937461066,"score_gpt":0.2506411730509266,"score_spread":0.18953867367631594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178450645","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.9896827,0.00008991195,0.0005958227,0.000057200257,0.0000067249384,0.000025045723,0.00008020244,0.0000042239517,0.009458113],"genre_scores_gemma":[0.9986082,0.00006090929,0.0008780437,0.000008839244,0.0000019697118,0.00001891588,0.000057489353,0.0000026795844,0.00036295774],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99791723,0.000759256,0.00024689522,0.00010697942,0.00079718215,0.00017259075],"domain_scores_gemma":[0.9868514,0.006041384,0.002733629,0.00072321517,0.002913368,0.00073696853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023078641,0.00032128367,0.00021159343,0.0039415727,0.0016165529,0.0039994214,0.00027487837,0.000341235,0.0018916758],"category_scores_gemma":[0.015045851,0.00020739272,0.00035124802,0.003918334,0.001136975,0.0024514266,0.0016516777,0.00067858485,0.00036808118],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018131714,0.00026915933,0.870586,0.00011855864,0.000091234004,0.00021853694,0.05819652,0.00049911055,0.0026246065,0.0066836732,0.00067081687,0.05986044],"study_design_scores_gemma":[0.000008983689,0.0001361509,0.8539029,0.0002473122,0.000065752814,0.00025338237,0.13195708,0.0028127108,0.0031133126,0.002321559,0.0051131,0.00006768984],"about_ca_topic_score_codex":0.0071027074,"about_ca_topic_score_gemma":0.009461596,"teacher_disagreement_score":0.0071027074,"about_ca_system_score_codex":0.0014331467,"about_ca_system_score_gemma":0.0012889679,"threshold_uncertainty_score":0.0141227245},"labels":[],"label_agreement":null},{"id":"W1784562764","doi":"10.1007/978-3-540-68825-9_15","title":"Towards a Faster Inference Algorithm in Multiply Sectioned Bayesian Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Windsor","funders":"","keywords":"Subnet; Computer science; Inference; Bayesian network; Bayesian inference; Algorithm; Scheme (mathematics); Message passing; Bayesian probability; Extension (predicate logic); Artificial intelligence; Distributed computing; Computer network; Mathematics","score_opus":0.02160808318426699,"score_gpt":0.25161591716244414,"score_spread":0.23000783397817715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784562764","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.0011883168,0.000078380595,0.99770206,0.00006949502,0.000030734234,0.000023064873,0.000030871248,0.00053024397,0.0003466809],"genre_scores_gemma":[0.015352291,0.00007563443,0.9828888,0.000096875556,0.000056642977,0.000074758675,0.00013208539,0.00019454866,0.001128329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966329,0.0013268313,0.00023839262,0.000646963,0.0009816387,0.0001733366],"domain_scores_gemma":[0.9800367,0.014310357,0.0005163789,0.0026263366,0.0021440124,0.00036623716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072921766,0.0015532455,0.0026296007,0.0017602191,0.0009354295,0.0031444363,0.004588969,0.0029806728,0.012004714],"category_scores_gemma":[0.030795494,0.0023512735,0.0019817755,0.0019417708,0.0012468932,0.0060527176,0.0041562007,0.0059247864,0.0038690711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004989259,0.0001629931,0.0011427074,0.00037328602,0.00036205753,0.00019664585,0.00031792815,0.3042798,0.0072037773,0.16894394,0.009354798,0.50716317],"study_design_scores_gemma":[0.000043251563,0.000025387466,0.00012119435,0.00002026153,0.000041825693,0.000066921646,0.000016406535,0.9074582,0.0018166555,0.08810202,0.0022712352,0.000016584976],"about_ca_topic_score_codex":0.0042845793,"about_ca_topic_score_gemma":0.006251509,"teacher_disagreement_score":0.012004714,"about_ca_system_score_codex":0.0014418185,"about_ca_system_score_gemma":0.0023264152,"threshold_uncertainty_score":0.040159762},"labels":[],"label_agreement":null},{"id":"W1785166314","doi":"10.1007/978-3-642-33509-9_60","title":"Fuzzy Adaptive Backstepping Control of a Two Degree of Freedom Parallel Robot","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adaptive Control of Nonlinear Systems","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":"Lakehead University","funders":"","keywords":"Fuzzy logic; Backstepping; Computer science; Control theory (sociology); Computation; Fuzzy control system; Fuzzy electronics; Norm (philosophy); Degree (music); Control engineering; Algorithm; Artificial intelligence; Fuzzy set operations; Adaptive control; Control (management); Engineering","score_opus":0.030453773053261166,"score_gpt":0.23805839010203925,"score_spread":0.20760461704877808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1785166314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114903316,0.00043270976,0.86442494,0.0002811103,0.00029943418,0.0001130685,0.00005650905,0.00056018383,0.01892875],"genre_scores_gemma":[0.9361736,0.00021239922,0.05473264,0.0000492085,0.000039950824,0.00011651911,0.0000398278,0.00001641625,0.008619464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998565,0.000021977128,0.00000779189,0.000034280627,0.00006226487,0.000017341108],"domain_scores_gemma":[0.9998603,0.000032139178,0.00002011721,0.000023330098,0.00004802993,0.000016036942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028629016,0.0005607631,0.00049962883,0.00026530516,0.00055031385,0.00052043144,0.0008601922,0.0007574178,0.0018550871],"category_scores_gemma":[0.00043198882,0.00027359877,0.0003596655,0.0003045773,0.0005859919,0.00035589296,0.00063278544,0.0004789038,0.00024583197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005057454,0.00012724852,0.00049123587,0.00035338404,0.000060024766,0.0006676699,0.00020882781,0.73310226,0.11119455,0.013839664,0.001519125,0.13793021],"study_design_scores_gemma":[0.000029581135,0.00025009084,0.000385323,0.0000105206655,0.000012916844,0.00008250267,0.000015611742,0.99109507,0.00456891,0.0019411136,0.0015933176,0.000014998068],"about_ca_topic_score_codex":0.0040492313,"about_ca_topic_score_gemma":0.0028872024,"teacher_disagreement_score":0.0040492313,"about_ca_system_score_codex":0.00029092203,"about_ca_system_score_gemma":0.00057130534,"threshold_uncertainty_score":0.008051336},"labels":[],"label_agreement":null},{"id":"W1785201090","doi":"10.1007/978-3-642-15585-7_10","title":"Linguistic Security Testing for Text Communication Protocols","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Protocol (science); Syntax; Programming language; Grammar; Formal grammar; Cryptographic protocol; Communications protocol; Language Of Temporal Ordering Specification; Formal specification; Natural language processing; Rule-based machine translation; Computer security; Computer network; Linguistics","score_opus":0.04246884196833257,"score_gpt":0.3168149333576922,"score_spread":0.2743460913893596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1785201090","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.056012742,0.0007656735,0.88131857,0.0023859337,0.00029603962,0.00019938321,0.00022884308,0.0058948216,0.052897982],"genre_scores_gemma":[0.73044693,0.0005297858,0.24595112,0.0004967071,0.0002053095,0.00025083704,0.00062872353,0.0013212468,0.020169308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508214,0.0018089587,0.00032323535,0.0004072508,0.0019812218,0.00039712884],"domain_scores_gemma":[0.9849937,0.010520865,0.0004903122,0.0021063252,0.0016854982,0.000203303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525857,0.00091750844,0.00074378826,0.0014746808,0.0014320688,0.0022721943,0.0018911508,0.0015531746,0.009663762],"category_scores_gemma":[0.016818369,0.0005396617,0.0009404128,0.00095459475,0.0035473392,0.0063335234,0.0023055354,0.002878946,0.0022451067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055666827,0.00025965512,0.0012754785,0.0006023087,0.000044068787,0.00074202794,0.002075238,0.01225226,0.02594725,0.533498,0.016860263,0.40588686],"study_design_scores_gemma":[0.00007828272,0.00016929138,0.0004881489,0.0003143927,0.000071957555,0.0007788214,0.00041806602,0.1424255,0.05548181,0.7710605,0.028635606,0.00007754836],"about_ca_topic_score_codex":0.0010971779,"about_ca_topic_score_gemma":0.00081861863,"teacher_disagreement_score":0.009663762,"about_ca_system_score_codex":0.0012196457,"about_ca_system_score_gemma":0.0012111196,"threshold_uncertainty_score":0.032328486},"labels":[],"label_agreement":null},{"id":"W1785250253","doi":"10.1007/11552338_6","title":"Specifying an Access Control Model for Ontologies for the Semantic Web","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Semantic Web; Semantic Web Stack; Social Semantic Web; World Wide Web; Ontology; OWL-S; Semantic analytics; Web Ontology Language; Semantic Web Rule Language; Data Web; Information retrieval; Description logic; Web service; Programming language","score_opus":0.0748911444768865,"score_gpt":0.3492364582329575,"score_spread":0.274345313756071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1785250253","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.004498429,0.00010623675,0.98978907,0.0006633285,0.00006982349,0.00027677472,0.00038532846,0.001182154,0.0030287728],"genre_scores_gemma":[0.13863555,0.00041260675,0.8519643,0.00053779944,0.000115711075,0.0007152775,0.0017688015,0.00085867604,0.0049914066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986356,0.004109261,0.0028439655,0.0014222317,0.0040999665,0.0011684475],"domain_scores_gemma":[0.9870228,0.006087572,0.0010019962,0.0033236728,0.0019720206,0.00059192674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017005187,0.0012638734,0.0013592319,0.0032300812,0.0030924822,0.013399304,0.004337237,0.0046276115,0.003598797],"category_scores_gemma":[0.020753447,0.0024028427,0.0042726425,0.0030495625,0.0049530594,0.017298238,0.006089262,0.007112978,0.0011848436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007782889,0.00010886294,0.0006430781,0.00020556754,0.000076043965,0.00043936708,0.0022286077,0.016786898,0.0037478837,0.9479508,0.0038169741,0.023918077],"study_design_scores_gemma":[0.00008974852,0.00005485432,0.00018671191,0.0003316197,0.00018882079,0.00044859925,0.0007528549,0.1721605,0.011959009,0.7499758,0.06372992,0.00012151477],"about_ca_topic_score_codex":0.012236472,"about_ca_topic_score_gemma":0.01615013,"teacher_disagreement_score":0.017005187,"about_ca_system_score_codex":0.004226202,"about_ca_system_score_gemma":0.006354959,"threshold_uncertainty_score":0.0899331},"labels":[],"label_agreement":null},{"id":"W178558778","doi":"10.1007/978-3-319-06701-8_22","title":"Instantiation Validity in IS Design Research","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Systems Theories and Implementation","field":"Social Sciences","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; External validity; Criterion validity; Data science; Internal validity; Research design; Management science; Knowledge management; Construct validity; Psychology; Psychometrics; Social science; Mathematics; Sociology","score_opus":0.1705546905501656,"score_gpt":0.4047865005177252,"score_spread":0.2342318099675596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178558778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03103392,0.018671412,0.69465023,0.027282534,0.00080843223,0.00050608563,0.00021939196,0.0002760426,0.22655198],"genre_scores_gemma":[0.84020007,0.0063691554,0.13824557,0.0014554692,0.0007669363,0.0014763578,0.00039736315,0.00028139455,0.010807756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.8811502,0.096208595,0.0044231648,0.0051235845,0.011614444,0.0014800001],"domain_scores_gemma":[0.66013587,0.3049387,0.0049122334,0.021666156,0.0072591086,0.0010878844],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.092827015,0.001491403,0.0031226124,0.008681364,0.004364787,0.0136753,0.0042715487,0.0047357534,0.010879982],"category_scores_gemma":[0.17163262,0.002920963,0.0022074769,0.008897358,0.043112155,0.032679163,0.009615422,0.007814669,0.00101809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143251,0.000015104053,0.0005385362,0.00017526833,0.000028685043,0.000021231803,0.001146816,0.00065677817,0.000025776402,0.98193514,0.0006308095,0.014811655],"study_design_scores_gemma":[0.000008890653,0.000008021823,0.00016316453,0.00019789129,0.000010204418,0.000023820956,0.00036142368,0.0014644809,0.00008522383,0.9953629,0.0023088392,0.0000051264224],"about_ca_topic_score_codex":0.00229463,"about_ca_topic_score_gemma":0.0017088497,"teacher_disagreement_score":0.907173,"about_ca_system_score_codex":0.008343153,"about_ca_system_score_gemma":0.0071754856,"threshold_uncertainty_score":0.49092203},"labels":[],"label_agreement":null},{"id":"W178670310","doi":"10.1007/11581741_24","title":"Synchronizing Cardinality-Based Feature Models and Their Specializations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Feature (linguistics); Cardinality (data modeling); Synchronizing; Computer science; Feature model; Software product line; Set (abstract data type); Synchronization (alternating current); Line (geometry); Product (mathematics); Product line; Cardinal number (linguistics); Theoretical computer science; Software; Algorithm; Data mining; Programming language; Mathematics; Software development","score_opus":0.0440533905030072,"score_gpt":0.2737542242541372,"score_spread":0.22970083375112998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178670310","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.025231725,0.00009173999,0.96871907,0.00014988153,0.00003089908,0.000057364596,0.0001396595,0.0017234624,0.0038562678],"genre_scores_gemma":[0.5429045,0.00027039,0.4481935,0.0001341082,0.00008472533,0.0002462655,0.0008099075,0.0013118468,0.0060446984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964186,0.0009351879,0.00040654023,0.00059424544,0.0012673029,0.0003780793],"domain_scores_gemma":[0.989293,0.0043587084,0.0007625541,0.004492835,0.000867874,0.00022510004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034964837,0.0006086424,0.0008701278,0.0013402636,0.00076641364,0.0026152595,0.0025383786,0.0011556669,0.004066179],"category_scores_gemma":[0.015211397,0.0011080138,0.0017281626,0.0022034424,0.0018169017,0.008850332,0.005235185,0.002274458,0.00072399114],"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.00045090384,0.00013266045,0.002410716,0.00023153082,0.00007509017,0.0003721177,0.0012224234,0.078901574,0.009856148,0.7575668,0.0032533228,0.14552672],"study_design_scores_gemma":[0.00005494574,0.00008499999,0.00038342932,0.00007496754,0.00010530559,0.0003128101,0.00021017296,0.43589184,0.013575532,0.53834826,0.010909848,0.000047972633],"about_ca_topic_score_codex":0.0013200484,"about_ca_topic_score_gemma":0.0021867547,"teacher_disagreement_score":0.004066179,"about_ca_system_score_codex":0.0010036224,"about_ca_system_score_gemma":0.0010528418,"threshold_uncertainty_score":0.018491387},"labels":[],"label_agreement":null},{"id":"W1786799192","doi":"10.1007/3-540-45325-3_28","title":"Generating Large Instances of the Gong-Harn Cryptosystem","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Computer science; Computer security; Cryptography","score_opus":0.01337517671546098,"score_gpt":0.2252701815759936,"score_spread":0.21189500486053262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786799192","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.6130458,0.00068653247,0.3064339,0.004825895,0.00023569471,0.00030560634,0.0011049772,0.0016675813,0.07169408],"genre_scores_gemma":[0.9380794,0.0002615291,0.054036368,0.00026681958,0.00012752147,0.00017326006,0.00073448056,0.00027495585,0.0060456553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816376,0.00063176546,0.00008123808,0.00024880364,0.0006274142,0.00024704053],"domain_scores_gemma":[0.99368405,0.004251003,0.00027826568,0.001363139,0.00020990195,0.00021361774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018563151,0.00060560455,0.0010244293,0.0007682325,0.0012151882,0.0024183253,0.0011820755,0.0015098145,0.005970706],"category_scores_gemma":[0.009687749,0.0005621382,0.00080055604,0.0012122004,0.0019415147,0.004477876,0.003035648,0.0031515502,0.0008726639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005653805,0.00022929804,0.001883229,0.00026035483,0.00008957151,0.00051968097,0.0005142769,0.09009004,0.0074124066,0.82589597,0.014867764,0.057672057],"study_design_scores_gemma":[0.00015439141,0.000045609777,0.00030693316,0.0000286906,0.000024806759,0.0002282876,0.00009470351,0.18748417,0.0038408493,0.80436105,0.0034084113,0.000022048232],"about_ca_topic_score_codex":0.0002798212,"about_ca_topic_score_gemma":0.0006451126,"teacher_disagreement_score":0.005970706,"about_ca_system_score_codex":0.001418362,"about_ca_system_score_gemma":0.0008502784,"threshold_uncertainty_score":0.019974053},"labels":[],"label_agreement":null},{"id":"W1787247969","doi":"10.1007/3-540-45391-1_3","title":"Toward a Mobile Work Environment","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Mitel (Canada); National Research Council Canada","funders":"","keywords":"Roaming; Computer science; Architecture; Work (physics); The Internet; Telecommunications; Mobile computing; Mobile agent; Multimedia; Human–computer interaction; World Wide Web; Computer network","score_opus":0.01481155959449294,"score_gpt":0.20905976733172174,"score_spread":0.1942482077372288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1787247969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0289156,0.004426113,0.55780566,0.013937444,0.0020470228,0.00015376863,0.00008356661,0.0019051168,0.3907256],"genre_scores_gemma":[0.34503737,0.006493774,0.2710063,0.002909647,0.0009877244,0.00055695546,0.0002722218,0.00067001476,0.372066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.00014779055,0.000013937318,0.00006225393,0.00015864504,0.0000921012],"domain_scores_gemma":[0.9994856,0.00007138669,0.000022662736,0.000063029605,0.00012355162,0.00023376632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007864135,0.0005412205,0.00025436076,0.00047277962,0.0025951478,0.0045435424,0.0013414647,0.0019357852,0.011824927],"category_scores_gemma":[0.0009735484,0.00039440583,0.000357142,0.00044796913,0.0014202239,0.005210322,0.0062940638,0.0018776585,0.008031352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013883937,0.00016348204,0.0010292723,0.0001847665,0.0000133737485,0.0005224714,0.009319067,0.0018391572,0.011142677,0.63340807,0.05577836,0.28646055],"study_design_scores_gemma":[0.000024876841,0.00014127872,0.0004964297,0.00019062289,0.00001378494,0.00044484774,0.0043506473,0.0052363263,0.002492638,0.10161843,0.88496274,0.000027304908],"about_ca_topic_score_codex":0.001039573,"about_ca_topic_score_gemma":0.0016562429,"teacher_disagreement_score":0.011824927,"about_ca_system_score_codex":0.00044976926,"about_ca_system_score_gemma":0.0011161758,"threshold_uncertainty_score":0.03955835},"labels":[],"label_agreement":null},{"id":"W178737885","doi":"10.1007/978-3-642-39470-6_27","title":"Formal Modeling and Analysis of Context-Aware Medication Management System for Smart Houses","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medication Adherence and Compliance","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Context (archaeology); Formal methods; Management system; Risk analysis (engineering); Software engineering; Medicine; Operations management; Engineering","score_opus":0.037515538853970284,"score_gpt":0.2804584520935452,"score_spread":0.2429429132395749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178737885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017662572,0.00033709285,0.97563815,0.00026767363,0.00003920923,0.00011361309,0.00019463943,0.00062488747,0.0051220595],"genre_scores_gemma":[0.5811766,0.00073717686,0.40859488,0.000149811,0.00007375844,0.00037908234,0.0005895404,0.00018274358,0.008116393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900335,0.00025903966,0.00008833037,0.00014858808,0.0003782977,0.00012235655],"domain_scores_gemma":[0.9992712,0.0003838412,0.00008337398,0.00010206468,0.00013656462,0.000022948276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093128945,0.00045456327,0.00051955885,0.0006199391,0.0006372799,0.0019025664,0.0013513467,0.0008629991,0.0024830727],"category_scores_gemma":[0.0015954693,0.00054136594,0.0013406518,0.0004941895,0.00089034846,0.0014277983,0.0008933124,0.000977824,0.00036738248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010045571,0.00017131561,0.0022798774,0.00032753663,0.000094027855,0.0006684889,0.0008608201,0.5938142,0.012520921,0.34294847,0.002260714,0.04395323],"study_design_scores_gemma":[0.000017427732,0.000033333472,0.00037035532,0.00004183531,0.000047015536,0.00012046128,0.00007274211,0.9363685,0.0029658168,0.05239629,0.0075480537,0.000018201976],"about_ca_topic_score_codex":0.010641676,"about_ca_topic_score_gemma":0.008048664,"teacher_disagreement_score":0.010641676,"about_ca_system_score_codex":0.0010419139,"about_ca_system_score_gemma":0.0018746012,"threshold_uncertainty_score":0.02115947},"labels":[],"label_agreement":null},{"id":"W1788095698","doi":"10.1007/11564751_82","title":"Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Inference; Local consistency; Constraint satisfaction problem; Backtracking; Computer science; Semiring; Theoretical computer science; Belief propagation; Approximate inference; Constraint satisfaction; Mathematical optimization; Probabilistic logic; Algorithm; Mathematics; Artificial intelligence; Decoding methods; Discrete mathematics","score_opus":0.04557858026898683,"score_gpt":0.29113197156775983,"score_spread":0.245553391298773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788095698","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.00034952484,0.0005757159,0.99355584,0.00079345435,0.000052895823,0.000031997868,0.0000808131,0.00014576646,0.00441403],"genre_scores_gemma":[0.043206125,0.0026471072,0.9485223,0.0008696234,0.00050159113,0.00021370608,0.0005346771,0.0004311063,0.003073716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904846,0.0052023665,0.00055554544,0.0011151497,0.0024124086,0.00023001664],"domain_scores_gemma":[0.9618161,0.030937765,0.0010766081,0.0036967364,0.0020303598,0.00044237898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013225889,0.0019211593,0.002515995,0.0037089388,0.001589091,0.00840784,0.007919353,0.0030857597,0.013994228],"category_scores_gemma":[0.05815318,0.0020791325,0.00313337,0.006201489,0.007571804,0.012903954,0.0055963034,0.0072687143,0.0035603854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004465365,0.00006899018,0.00024980117,0.00040824045,0.00014973461,0.00011262407,0.0004545282,0.01714658,0.0005316563,0.8279723,0.008298255,0.1445626],"study_design_scores_gemma":[0.000009263751,0.000005710329,0.000058404545,0.00007083732,0.000023402883,0.00003862249,0.00003078681,0.04429495,0.00032022118,0.9487403,0.0063851466,0.000022520866],"about_ca_topic_score_codex":0.0056661805,"about_ca_topic_score_gemma":0.0058337185,"teacher_disagreement_score":0.013994228,"about_ca_system_score_codex":0.0020481825,"about_ca_system_score_gemma":0.0038293065,"threshold_uncertainty_score":0.06994599},"labels":[],"label_agreement":null},{"id":"W178856535","doi":"10.1007/978-3-319-10470-6_96","title":"Segmentation of Cerebrovascular Pathologies in Stroke Patients with Spatial and Shape Priors","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; American Stroke Association; Natural Sciences and Engineering Research Council of Canada; BrightFocus Foundation; National Institute of Neurological Disorders and Stroke; American Health Assistance Foundation; National Institutes of Health; National Science Foundation","keywords":"Segmentation; Stroke (engine); Prior probability; Computer science; Artificial intelligence; Inference; Medicine; Pattern recognition (psychology); Bayesian probability","score_opus":0.005845584758022878,"score_gpt":0.2323503942599397,"score_spread":0.22650480950191682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178856535","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.8290544,0.0032030877,0.15924364,0.0011714698,0.00010626493,0.00015824521,0.0014658764,0.0010001024,0.0045968923],"genre_scores_gemma":[0.95713687,0.001089057,0.038558085,0.00011779135,0.00008971612,0.00004594477,0.0010890535,0.00022566723,0.0016478007],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997353,0.00006921291,0.000031121228,0.000057984627,0.000046416157,0.00006003856],"domain_scores_gemma":[0.9995338,0.00020849996,0.00006146601,0.00006425323,0.00008483513,0.00004722611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097384665,0.0006075039,0.00076186174,0.0019558764,0.000467576,0.0016826823,0.0004935899,0.0016270757,0.0016841103],"category_scores_gemma":[0.0030557185,0.0005850811,0.00088153017,0.0008046244,0.00038282838,0.0005714878,0.00064682745,0.0004973062,0.00063089945],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011202062,0.0005713767,0.11931849,0.0009249778,0.0009692843,0.005871327,0.0012425132,0.10704739,0.19243635,0.0043514026,0.009276806,0.54678804],"study_design_scores_gemma":[0.00019993297,0.0006008217,0.23366733,0.00024042209,0.0013080882,0.010085806,0.0009082715,0.6465483,0.08786982,0.010813502,0.0075859884,0.00017188615],"about_ca_topic_score_codex":0.006503592,"about_ca_topic_score_gemma":0.0072837006,"teacher_disagreement_score":0.006503592,"about_ca_system_score_codex":0.00040023413,"about_ca_system_score_gemma":0.0013767529,"threshold_uncertainty_score":0.012931466},"labels":[],"label_agreement":null},{"id":"W178888444","doi":"10.1007/978-3-642-22351-8_35","title":"Histogram and Other Aggregate Queries in Wireless Sensor Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Histogram; Computer science; Aggregate (composite); Wireless sensor network; Wireless; Process (computing); Data mining; Computer network; Artificial intelligence; Image (mathematics); Telecommunications","score_opus":0.014366563713670762,"score_gpt":0.21452813041554394,"score_spread":0.20016156670187318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178888444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03277369,0.0071820333,0.9473245,0.0018883784,0.0004950232,0.00010604279,0.0006096138,0.0014273743,0.008193426],"genre_scores_gemma":[0.794377,0.0048930105,0.17377728,0.0010133281,0.0017115077,0.00026466732,0.0012095133,0.0005598673,0.022193816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997638,0.00070511445,0.00013007704,0.00026972697,0.001084631,0.00017248522],"domain_scores_gemma":[0.9929091,0.0048849927,0.0003040466,0.0011884838,0.0005299523,0.00018345163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024594283,0.00061288074,0.0023106534,0.0012305271,0.0009602056,0.0022791645,0.0020528457,0.0011168555,0.0042925933],"category_scores_gemma":[0.012188287,0.0004443164,0.00045073323,0.004105211,0.0014738601,0.0071725445,0.0023308485,0.0015554138,0.0006790021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010342228,0.00027241316,0.003281845,0.00045026522,0.0001371293,0.00019793493,0.00047573296,0.21413712,0.005443159,0.34850726,0.03640657,0.38965634],"study_design_scores_gemma":[0.000037672886,0.000065561595,0.00065970654,0.00002412311,0.0000323475,0.00020678357,0.00014638266,0.69274074,0.0021502818,0.29666686,0.007241466,0.000028043782],"about_ca_topic_score_codex":0.0022145356,"about_ca_topic_score_gemma":0.002074088,"teacher_disagreement_score":0.0042925933,"about_ca_system_score_codex":0.0012884235,"about_ca_system_score_gemma":0.00064303045,"threshold_uncertainty_score":0.014360189},"labels":[],"label_agreement":null},{"id":"W1789152958","doi":"10.1007/3-540-36456-0_29","title":"Augmenting WordNet’s Structure Using LDOCE","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"WordNet; Computer science; Artificial intelligence; Information retrieval; Natural language processing","score_opus":0.017050046321081168,"score_gpt":0.26547428046679383,"score_spread":0.24842423414571266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1789152958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119195975,0.0014573911,0.7829776,0.0014888996,0.0012453707,0.000455608,0.010909813,0.031106008,0.051163353],"genre_scores_gemma":[0.3885991,0.0011704993,0.5697265,0.0005647033,0.0002874111,0.0002928987,0.02165963,0.0024268185,0.015272421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995931,0.00010244038,0.000045688124,0.0001168395,0.00010242582,0.0000395515],"domain_scores_gemma":[0.997733,0.0008931081,0.00009185165,0.0006824752,0.00051905523,0.00008049131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066302594,0.0008074555,0.00085653376,0.0031582427,0.000699974,0.0014950032,0.00080865977,0.0006042617,0.01386213],"category_scores_gemma":[0.0043552364,0.0005438982,0.00066636974,0.0027196023,0.00053145643,0.005342075,0.0024324385,0.0011831524,0.006350989],"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.00045673866,0.00032260496,0.0027141045,0.00095163967,0.00009464834,0.0007177447,0.0007705977,0.012410698,0.02920681,0.04009456,0.032177962,0.8800819],"study_design_scores_gemma":[0.00022395741,0.00046422117,0.0037578687,0.0006227213,0.000458358,0.0010331734,0.0016254394,0.31943133,0.06581292,0.24640904,0.36001718,0.00014370105],"about_ca_topic_score_codex":0.0037092576,"about_ca_topic_score_gemma":0.010392506,"teacher_disagreement_score":0.01386213,"about_ca_system_score_codex":0.00045880463,"about_ca_system_score_gemma":0.0010848478,"threshold_uncertainty_score":0.046373427},"labels":[],"label_agreement":null},{"id":"W1790474971","doi":"10.1007/978-3-642-02008-7_16","title":"Combinatorial Algorithms for Structural Variation Detection in High Throughput Sequenced Genomes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Simon Fraser University","funders":"","keywords":"Structural variation; Indel; Hybrid genome assembly; Computer science; DNA sequencing; Reference genome; Sanger sequencing; Genome; Deep sequencing; Redundancy (engineering); Single cell sequencing; Computational biology; Variation (astronomy); Genomics; Algorithm; Biology; Genetics; Mutation; Single-nucleotide polymorphism; Exome sequencing; DNA; Gene; Genotype","score_opus":0.012043673257624617,"score_gpt":0.24318614660239551,"score_spread":0.2311424733447709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790474971","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.009641429,0.0005258214,0.98600185,0.00016954761,0.00006758444,0.00012408698,0.0002984802,0.0019417561,0.0012294224],"genre_scores_gemma":[0.08381716,0.0004159194,0.91164637,0.00020727482,0.00014105719,0.0004505094,0.0014161584,0.00065839896,0.0012471515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977863,0.0009060325,0.00017149156,0.0004739938,0.00050499436,0.0001570864],"domain_scores_gemma":[0.9895992,0.008496577,0.00040100553,0.0007367051,0.0005294255,0.00023709968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035552515,0.001747073,0.0026361598,0.0028360605,0.0012651386,0.002759984,0.0046451604,0.002115329,0.004588834],"category_scores_gemma":[0.010685433,0.0016307172,0.003223028,0.004081385,0.0018839614,0.003298805,0.0024237668,0.0028464291,0.0011225413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048780473,0.0002710251,0.0014757256,0.0004904627,0.0002937624,0.00014053573,0.000101234815,0.60125405,0.0065064644,0.06313922,0.008503394,0.31733635],"study_design_scores_gemma":[0.000057970803,0.000035774665,0.0002207258,0.000013731727,0.00003115995,0.000040823466,0.00001640452,0.938978,0.00095837365,0.058738932,0.00088974636,0.00001844496],"about_ca_topic_score_codex":0.0035500203,"about_ca_topic_score_gemma":0.0041488768,"teacher_disagreement_score":0.0046451604,"about_ca_system_score_codex":0.0019041272,"about_ca_system_score_gemma":0.0017298952,"threshold_uncertainty_score":0.018802226},"labels":[],"label_agreement":null},{"id":"W1790538828","doi":"10.1007/978-3-642-02247-0_38","title":"Detecting Guessed and Random Learners’ Answers through Their Brainwaves","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Test (biology); Artificial intelligence; Machine learning; Human–computer interaction","score_opus":0.022800332959114912,"score_gpt":0.24271418269809972,"score_spread":0.2199138497389848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790538828","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.9806317,0.00022471789,0.016038375,0.00006248039,0.0000466009,0.000050552484,0.0002646165,0.00016028604,0.0025206304],"genre_scores_gemma":[0.990339,0.0001597307,0.007335706,0.000042782838,0.000029969095,0.000030833282,0.00033566754,0.000050575574,0.0016756733],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999356,0.00017318591,0.00004741612,0.00015267827,0.00018891081,0.00008180489],"domain_scores_gemma":[0.9939971,0.004438179,0.0004527847,0.00025564627,0.00054171286,0.0003145652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105808,0.00033031392,0.00035912055,0.0007120082,0.00015320159,0.00089843065,0.00024959422,0.00063909974,0.0025492895],"category_scores_gemma":[0.010896606,0.00017149908,0.00019572434,0.00040047534,0.00027260467,0.0007442452,0.0005694482,0.00050174905,0.0011247441],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004624303,0.00048142107,0.3002172,0.00024757657,0.00035215385,0.00044276967,0.0015666643,0.004398999,0.17290297,0.0011663919,0.0021084514,0.5114912],"study_design_scores_gemma":[0.00025618536,0.0018753087,0.7002297,0.000102993654,0.000354024,0.0026293055,0.0018870146,0.18324742,0.1013717,0.0044716946,0.0034296217,0.00014511793],"about_ca_topic_score_codex":0.00041475933,"about_ca_topic_score_gemma":0.00063361495,"teacher_disagreement_score":0.0025492895,"about_ca_system_score_codex":0.00011653834,"about_ca_system_score_gemma":0.00017461806,"threshold_uncertainty_score":0.008528233},"labels":[],"label_agreement":null},{"id":"W1790943869","doi":"10.1007/11428831_10","title":"Optimization of Spherical Harmonic Transform Computations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geophysics and Gravity Measurements","field":"Earth and Planetary Sciences","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":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Computation; Spherical harmonics; Discretization; Fourier transform; Fast Fourier transform; Computer science; Harmonic analysis; Grid; Fourier analysis; Discrete Fourier transform (general); Geodetic datum; Geopotential; Algorithm; Computational science; Mathematics; Mathematical analysis; Geometry; Physics; Fractional Fourier transform; Geography; Geodesy; Geophysics","score_opus":0.021032866273851963,"score_gpt":0.2197531625048774,"score_spread":0.19872029623102544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790943869","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.0080088675,0.00016449497,0.9859855,0.0001576598,0.000068219226,0.00002319316,0.00007435598,0.00051136175,0.005006211],"genre_scores_gemma":[0.26422146,0.00043371465,0.7183251,0.00012953854,0.00022318735,0.00018983474,0.00068423717,0.0012339402,0.014558894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933416,0.00021636479,0.000029451168,0.00010060774,0.00023995717,0.00007952172],"domain_scores_gemma":[0.9983473,0.0011065305,0.00006621541,0.00019618848,0.00022836967,0.000055437653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223378,0.0010081149,0.0013109503,0.0006805394,0.00039028135,0.0012906515,0.0011435742,0.00086098554,0.010111728],"category_scores_gemma":[0.00473585,0.00062911515,0.0008239653,0.001115731,0.0008766927,0.0015422491,0.0014714284,0.0014494522,0.002066535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040344388,0.00012232785,0.000397172,0.00017405603,0.00006809544,0.00005797816,0.000098413344,0.6070147,0.007782672,0.057167593,0.01203395,0.31467962],"study_design_scores_gemma":[0.000011522788,0.000019538216,0.000058560086,0.0000036124973,0.000004317668,0.000009244535,0.000008662394,0.98844355,0.0012619136,0.009191356,0.0009840176,0.0000038600706],"about_ca_topic_score_codex":0.0043396656,"about_ca_topic_score_gemma":0.005134087,"teacher_disagreement_score":0.010111728,"about_ca_system_score_codex":0.00073341455,"about_ca_system_score_gemma":0.0012535534,"threshold_uncertainty_score":0.033827066},"labels":[],"label_agreement":null},{"id":"W1791109262","doi":"10.1007/978-3-642-34191-5_3","title":"A History of Flips in Combinatorial Triangulations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Computer science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Combinatorics; Artificial intelligence; Mathematics; Geometry","score_opus":0.02310466757687248,"score_gpt":0.2283262121548195,"score_spread":0.205221544577947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791109262","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.016032377,0.16141118,0.15470093,0.012536023,0.0059126187,0.00011197602,0.00065526506,0.0004991859,0.64814055],"genre_scores_gemma":[0.44563484,0.18669218,0.13846785,0.006372496,0.010656497,0.00035706462,0.0011026378,0.0012875472,0.20942892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895394,0.00035260958,0.00006405338,0.00024056528,0.0002816597,0.00010720286],"domain_scores_gemma":[0.9974241,0.0016620475,0.00007766359,0.00044834515,0.00030430692,0.00008354192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013007636,0.00063535536,0.0007786946,0.0030067891,0.002591284,0.003738172,0.0015401754,0.0024991836,0.01593099],"category_scores_gemma":[0.0059233545,0.0010563552,0.0006913544,0.0049516098,0.00790997,0.00898463,0.0031800217,0.0043640453,0.0028447732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001607376,0.00000858298,0.0000704249,0.00014838384,0.0000039120227,0.000028160117,0.0002662108,0.00090260006,0.00013513054,0.9379683,0.010499616,0.04995255],"study_design_scores_gemma":[0.000008426265,0.000011489649,0.000118184355,0.00027114086,0.000005826787,0.00016637746,0.00013308202,0.0015676903,0.0004222288,0.7544154,0.24285822,0.000021867307],"about_ca_topic_score_codex":0.002126106,"about_ca_topic_score_gemma":0.0026806744,"teacher_disagreement_score":0.01593099,"about_ca_system_score_codex":0.0029914377,"about_ca_system_score_gemma":0.0010098544,"threshold_uncertainty_score":0.05329442},"labels":[],"label_agreement":null},{"id":"W1791330396","doi":"10.1007/3-540-44990-6_13","title":"Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":64,"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":"Parametric statistics; Parametric surface; Trigonometry; Mathematics; Parametric equation; Algebra over a field; Polynomial; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.009121096537179397,"score_gpt":0.2321073893731929,"score_spread":0.22298629283601348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791330396","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.014477517,0.0002836377,0.97422326,0.00017205566,0.00008149585,0.000026670656,0.000037269838,0.00032334204,0.010374632],"genre_scores_gemma":[0.36615378,0.0009185287,0.6069308,0.00011597939,0.0001440455,0.00010540273,0.00018705607,0.0006205565,0.024823928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995431,0.00012566967,0.000023908906,0.000039760052,0.00023371735,0.000033934386],"domain_scores_gemma":[0.9994863,0.00021882122,0.000040020048,0.00012262321,0.00010455243,0.000027514954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059721037,0.0005190953,0.0008842861,0.0007227854,0.00063828344,0.0020682476,0.0013905097,0.0006466487,0.0052962396],"category_scores_gemma":[0.0023136002,0.0004287237,0.0007953615,0.0008037243,0.001443914,0.0022722667,0.0025941913,0.002331575,0.00086725346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060316703,0.00006201121,0.00028249616,0.00020855921,0.000027156084,0.00007275125,0.00039291952,0.13853529,0.010766509,0.72201085,0.0029130753,0.124668166],"study_design_scores_gemma":[0.000013004946,0.000026109687,0.000073074276,0.000019420862,0.0000066490957,0.000061769955,0.000053273456,0.82521325,0.0031374502,0.16109133,0.0102895405,0.000015152442],"about_ca_topic_score_codex":0.0012523332,"about_ca_topic_score_gemma":0.0018315659,"teacher_disagreement_score":0.0052962396,"about_ca_system_score_codex":0.00056435727,"about_ca_system_score_gemma":0.0005477585,"threshold_uncertainty_score":0.01771766},"labels":[],"label_agreement":null},{"id":"W1791648248","doi":"10.1007/978-3-642-04271-3_91","title":"Pattern Recognition of Abnormal Left Ventricle Wall Motion in Cardiac MR","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Elasticity and Material Modeling","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Michael's Hospital; Health Sciences Centre; Sunnybrook Health Science Centre","funders":"","keywords":"Normalization (sociology); Artificial intelligence; Ventricle; Pattern recognition (psychology); Computer science; Position (finance); Computer vision; Motion (physics); Medicine; Cardiology","score_opus":0.010429140387962447,"score_gpt":0.20743129805883323,"score_spread":0.1970021576708708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791648248","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.8421752,0.0013593533,0.15298527,0.00043636645,0.00015249354,0.00009293037,0.0006051944,0.00076608435,0.0014271219],"genre_scores_gemma":[0.9640096,0.0007728085,0.033229183,0.000091725364,0.00010405499,0.000028403543,0.00050461583,0.000052721894,0.0012070286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985325,0.000023467055,0.000021890373,0.0000286301,0.000041286636,0.00003145949],"domain_scores_gemma":[0.9994357,0.00019709251,0.00008440285,0.00005006716,0.00014651378,0.00008620932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043966458,0.0002685292,0.00038902508,0.001593806,0.00014224659,0.0005916703,0.00033773272,0.000617521,0.00085323147],"category_scores_gemma":[0.0016711187,0.00013845936,0.00019286363,0.0005182444,0.00021409891,0.00031058773,0.00023867458,0.0002983763,0.00043072557],"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.0014079516,0.00015617364,0.054680284,0.00037609614,0.000072293435,0.001955683,0.00022175327,0.0036238413,0.3567533,0.0005168871,0.00238707,0.57784873],"study_design_scores_gemma":[0.00010414596,0.0010754965,0.37605852,0.00017049088,0.00030674197,0.012563775,0.00079444225,0.41264665,0.18805914,0.002300104,0.0058430005,0.00007753492],"about_ca_topic_score_codex":0.0011568845,"about_ca_topic_score_gemma":0.0012987215,"teacher_disagreement_score":0.001593806,"about_ca_system_score_codex":0.00010642815,"about_ca_system_score_gemma":0.00019779267,"threshold_uncertainty_score":0.0028543472},"labels":[],"label_agreement":null},{"id":"W1791687657","doi":"10.1007/978-3-642-13881-2_7","title":"Automatic Quality Assessment of Source Code Comments: The JavadocMiner","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":88,"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; Source code; Code (set theory); Quality (philosophy); Programming language","score_opus":0.03315713294727574,"score_gpt":0.32769240608061273,"score_spread":0.294535273133337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791687657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13342722,0.0017292254,0.595917,0.0005769529,0.00027766,0.0005226511,0.005710514,0.2589088,0.002930041],"genre_scores_gemma":[0.23329836,0.0004891475,0.7273907,0.00026589402,0.00013913965,0.00033342742,0.013941181,0.017268121,0.0068739476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99086154,0.0014862991,0.00087914895,0.0017521445,0.0047235233,0.00029741536],"domain_scores_gemma":[0.96580017,0.013755072,0.0046813623,0.0048334715,0.010081576,0.00084833347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006138444,0.0014499541,0.0018053666,0.0060282396,0.0007352189,0.0027608855,0.0024461255,0.0015791525,0.0040470394],"category_scores_gemma":[0.029695245,0.0010476465,0.0013104585,0.002267963,0.00060226716,0.002754938,0.0024275284,0.0013856026,0.0043997825],"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.00078193075,0.00037870105,0.017764436,0.0010629167,0.00024498827,0.00027707723,0.0005236449,0.0032966053,0.068643756,0.0013161425,0.037917037,0.8677927],"study_design_scores_gemma":[0.00058169913,0.0009961375,0.051735412,0.0006281332,0.0005085701,0.001934532,0.0006522688,0.5725929,0.30645087,0.0073577156,0.05613269,0.00042898042],"about_ca_topic_score_codex":0.0019693363,"about_ca_topic_score_gemma":0.0034331116,"teacher_disagreement_score":0.006138444,"about_ca_system_score_codex":0.0007226384,"about_ca_system_score_gemma":0.00180077,"threshold_uncertainty_score":0.03246361},"labels":[],"label_agreement":null},{"id":"W1791954569","doi":"10.1007/978-3-319-12691-3_10","title":"Guarding Monotone Art Galleries with Sliding Cameras in Linear Time","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba","funders":"","keywords":"Monotone polygon; Time complexity; Polygon (computer graphics); Line segment; Computer science; Guard (computer science); Interior point method; Algorithm; Point in polygon; Simple polygon; Combinatorics; Regular polygon; Point (geometry); Linear programming; Mathematics; Mathematical optimization; Computer vision; Geometry","score_opus":0.01108756555793992,"score_gpt":0.22742418888146607,"score_spread":0.21633662332352616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791954569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05148074,0.0003403834,0.9320168,0.00013456166,0.00014298873,0.00020082526,0.0005559003,0.0038829043,0.011244931],"genre_scores_gemma":[0.39084688,0.00032008305,0.5907564,0.00012380086,0.000077532975,0.0001964146,0.0018254046,0.0011179751,0.014735562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991211,0.0001107543,0.000056483022,0.0002642336,0.00027819182,0.00016917208],"domain_scores_gemma":[0.99874485,0.00057845947,0.00007844247,0.0003801391,0.00011917939,0.00009884409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070965727,0.0013438066,0.0020385163,0.00092993496,0.0006529706,0.0014177779,0.002198804,0.0013266961,0.017963367],"category_scores_gemma":[0.0032466252,0.0010045144,0.0018252365,0.0007088056,0.0011316346,0.0028014104,0.005275823,0.001764076,0.0023317547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094381854,0.00022946057,0.0010803951,0.0005645992,0.000120855424,0.00026250066,0.00037719286,0.37258092,0.019036477,0.06457159,0.016893936,0.5233383],"study_design_scores_gemma":[0.00004882224,0.0001171599,0.00023948327,0.000040664174,0.000018514967,0.00008325434,0.000117076925,0.9320489,0.003180527,0.060773056,0.0033146022,0.00001802343],"about_ca_topic_score_codex":0.0036208783,"about_ca_topic_score_gemma":0.0051729134,"teacher_disagreement_score":0.017963367,"about_ca_system_score_codex":0.00058759394,"about_ca_system_score_gemma":0.0006542298,"threshold_uncertainty_score":0.060093462},"labels":[],"label_agreement":null},{"id":"W1792272551","doi":"10.1007/978-3-540-73110-8_24","title":"Character Agents in E-Learning Interface Using Multimodal Real-Time Interaction","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Character (mathematics); Human–computer interaction; Interface (matter); Usability; Focus (optics); Empathy; Information exchange; Intelligent agent; Multimedia; Artificial intelligence; Psychology","score_opus":0.04325408082887171,"score_gpt":0.32766503063894037,"score_spread":0.28441094981006865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1792272551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11015406,0.0017717025,0.81668717,0.0004986201,0.00025266278,0.00013680247,0.000040859224,0.0018246471,0.06863344],"genre_scores_gemma":[0.77893066,0.00072547793,0.14667118,0.00009817892,0.000045304118,0.00014758261,0.000080996884,0.000166172,0.07313455],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973947,0.00010683006,0.000013641969,0.000056362314,0.000059786034,0.000023956976],"domain_scores_gemma":[0.99981314,0.00008025666,0.0000110060155,0.00002499077,0.000042063217,0.000028581102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032976706,0.00032759245,0.00031843732,0.00023630046,0.0005720349,0.0015988734,0.00070358516,0.0010632692,0.008548763],"category_scores_gemma":[0.00071372563,0.00023180795,0.00020369988,0.00024218272,0.0006031667,0.0019327189,0.0012154828,0.0006376028,0.0018378926],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008096226,0.00060615316,0.0029807282,0.00058521336,0.000084237574,0.0013984301,0.007536033,0.04158288,0.21235105,0.25301906,0.014707219,0.4643394],"study_design_scores_gemma":[0.00009218926,0.00056166196,0.0031814827,0.0001334274,0.00011477934,0.001498851,0.002292338,0.719706,0.08752712,0.058914617,0.12587772,0.00009989363],"about_ca_topic_score_codex":0.0007792569,"about_ca_topic_score_gemma":0.00057765713,"teacher_disagreement_score":0.008548763,"about_ca_system_score_codex":0.0002398716,"about_ca_system_score_gemma":0.00018021865,"threshold_uncertainty_score":0.028598487},"labels":[],"label_agreement":null},{"id":"W1792405476","doi":"10.1007/3-540-36138-3_5","title":"A Computational Algebraic Topology Model for the Deformation of Curves","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Bishop's University; Université de Sherbrooke","funders":"","keywords":"Computer science; Partial differential equation; ENCODE; Algebraic number; Domain (mathematical analysis); Domain decomposition methods; Elasticity (physics); Topology (electrical circuits); Applied mathematics; Physical law; Algebraic equation; Algebraic topology; Algorithm; Mathematical optimization; Mathematics; Finite element method; Mathematical analysis; Pure mathematics","score_opus":0.030868224834943763,"score_gpt":0.28900093001177835,"score_spread":0.25813270517683456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1792405476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047565475,0.00070302066,0.9059614,0.0014982893,0.00023591965,0.00008627496,0.0003309005,0.00041395397,0.043204788],"genre_scores_gemma":[0.7787695,0.0011401082,0.18118434,0.0003201403,0.00046111192,0.00018397914,0.00068125635,0.0002930567,0.03696652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954873,0.00010224581,0.000027872697,0.00010039737,0.00016780189,0.00005294774],"domain_scores_gemma":[0.9994936,0.00015469034,0.00006539327,0.00013382851,0.00007926167,0.00007327515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161392,0.00087073655,0.00081364525,0.0016655481,0.0013102706,0.0037543203,0.0019956012,0.0017501493,0.008865785],"category_scores_gemma":[0.001763621,0.000465694,0.0014988898,0.0014866911,0.0034653973,0.0060692523,0.0021996745,0.0024105397,0.0013589213],"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.000007026201,0.0000066688776,0.000049586855,0.00001232784,0.0000022768115,0.00002906109,0.00006889911,0.0059364513,0.00029594632,0.9897376,0.00038761686,0.0034665042],"study_design_scores_gemma":[0.000008353433,0.000018093937,0.000055196208,0.000010148288,0.0000035369715,0.000058538495,0.00004719449,0.04990691,0.00017752814,0.94392735,0.0057795728,0.0000075026937],"about_ca_topic_score_codex":0.0013389259,"about_ca_topic_score_gemma":0.0011214488,"teacher_disagreement_score":0.008865785,"about_ca_system_score_codex":0.0012949408,"about_ca_system_score_gemma":0.0006316244,"threshold_uncertainty_score":0.029658973},"labels":[],"label_agreement":null},{"id":"W1792611071","doi":"10.1007/978-3-642-23765-2_22","title":"ToCoPlay: Graphical Multi-touch Interaction for Composing and Playing Music","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Human–computer interaction; Interface (matter); Musical; Graphical user interface; New Interfaces for Musical Expression; Space (punctuation); Electronic music; Performing arts; User interface; Multimedia; Musical composition; Visual arts; Art; Programming language","score_opus":0.04151451576662257,"score_gpt":0.28278493651297865,"score_spread":0.24127042074635607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1792611071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011914914,0.047135234,0.68527037,0.0007641633,0.001362686,0.0002803706,0.000575595,0.011831851,0.24086478],"genre_scores_gemma":[0.10569788,0.033508986,0.40291148,0.0009059267,0.0005899561,0.00057390623,0.0016022697,0.003560992,0.45064858],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997131,0.000030021234,0.000012008224,0.000046599896,0.00017084937,0.000027266533],"domain_scores_gemma":[0.999856,0.00007046514,0.0000086487025,0.000029313655,0.00002001459,0.00001546239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022006685,0.00096546835,0.00041590034,0.0010387691,0.0006004468,0.002080409,0.001493965,0.0012064236,0.02893988],"category_scores_gemma":[0.0006692022,0.00036121797,0.00059908465,0.0012565684,0.0006945705,0.001943442,0.0016739579,0.0013055084,0.005907789],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015182313,0.000055214387,0.00021627719,0.0015558347,0.00004354105,0.00040615525,0.0015913151,0.0017799038,0.05606155,0.09437726,0.07770254,0.76605856],"study_design_scores_gemma":[0.000037383026,0.00017079122,0.0011224626,0.00044042134,0.000049758,0.003440774,0.00026344284,0.010996131,0.014682714,0.022514513,0.94620895,0.00007263848],"about_ca_topic_score_codex":0.0008125219,"about_ca_topic_score_gemma":0.0015195415,"teacher_disagreement_score":0.02893988,"about_ca_system_score_codex":0.00033073427,"about_ca_system_score_gemma":0.00032406364,"threshold_uncertainty_score":0.0968135},"labels":[],"label_agreement":null},{"id":"W1793257153","doi":"10.1007/978-3-642-01129-0_21","title":"Prediction of Interday Stock Prices Using Developmental and Linear Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Stock price; Linear programming; Artificial intelligence; Algorithm; Biology","score_opus":0.11941293434628288,"score_gpt":0.36040260207649477,"score_spread":0.2409896677302119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793257153","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.37207893,0.0007552862,0.6189453,0.0004359367,0.000089755384,0.00006227042,0.00018530473,0.0005653499,0.0068819616],"genre_scores_gemma":[0.8740122,0.00026801732,0.12223582,0.00007301084,0.000023022681,0.00006280341,0.00018109482,0.000030753123,0.0031132682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986434,0.00003942544,0.000006675401,0.000036836722,0.000032036914,0.000020645488],"domain_scores_gemma":[0.9993104,0.00046462225,0.00004619893,0.000023919622,0.00012820523,0.000026688875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537613,0.00038623277,0.0004328099,0.0005583474,0.0002510941,0.0006421819,0.00091207435,0.0008587889,0.0010251533],"category_scores_gemma":[0.001925378,0.00031168078,0.0004983658,0.00053400145,0.00031873773,0.00061122637,0.00035882214,0.00066367775,0.00017240905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005420594,0.000055758122,0.004331906,0.000018862198,0.000039472532,0.000039294166,0.000028911434,0.91473985,0.0015428183,0.0023588587,0.000426193,0.07636381],"study_design_scores_gemma":[0.0000031335353,0.000012942889,0.0005286929,0.0000022862773,0.000004887239,0.0000057095453,0.000003144384,0.99832565,0.00029886153,0.0007428167,0.00006911532,0.0000027954277],"about_ca_topic_score_codex":0.013155368,"about_ca_topic_score_gemma":0.0108947195,"teacher_disagreement_score":0.013155368,"about_ca_system_score_codex":0.00086907344,"about_ca_system_score_gemma":0.00067278,"threshold_uncertainty_score":0.026157618},"labels":[],"label_agreement":null},{"id":"W1793323729","doi":"10.1007/978-3-642-37119-6_21","title":"QoS Aware Adaptive Security Scheme for Video Streaming in MANETs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Cryptography; Mobile QoS; Computer network; Overhead (engineering); Scheme (mathematics); Bandwidth (computing); Adaptive quality of service multi-hop routing; Multimedia; Distributed computing; Computer security; Service (business); Service provider; Routing (electronic design automation); Routing protocol","score_opus":0.01605122822730854,"score_gpt":0.23980078379609332,"score_spread":0.22374955556878479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793323729","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.12722267,0.0030394457,0.85823184,0.0008538868,0.00052808685,0.00028328274,0.0001653187,0.0013961857,0.008279282],"genre_scores_gemma":[0.914802,0.00092549616,0.07732259,0.00020382392,0.00021230869,0.00008294519,0.00017223741,0.00004355583,0.0062350105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995389,0.00008767883,0.00003085349,0.00008374395,0.00015605286,0.000102709804],"domain_scores_gemma":[0.99918205,0.00027934322,0.000073858806,0.0001271245,0.00026033405,0.00007721992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071227597,0.0005946032,0.0006800263,0.0005997473,0.00078602985,0.00087188475,0.00094512996,0.00062738237,0.0019007627],"category_scores_gemma":[0.0015236804,0.00016844673,0.00025468157,0.0004440552,0.0004734845,0.0011286631,0.0011055082,0.0013937551,0.00037719842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023682634,0.0005455071,0.0013698995,0.0004449154,0.00015118008,0.00083944376,0.00054455793,0.09431708,0.30465937,0.09738396,0.012132698,0.48524314],"study_design_scores_gemma":[0.00011333152,0.0006813582,0.0010872012,0.000061362785,0.00009863462,0.0009972376,0.00020785503,0.90838593,0.04858883,0.030674998,0.009029699,0.000073511146],"about_ca_topic_score_codex":0.0007791329,"about_ca_topic_score_gemma":0.00081347354,"teacher_disagreement_score":0.0019007627,"about_ca_system_score_codex":0.00088618475,"about_ca_system_score_gemma":0.0005694369,"threshold_uncertainty_score":0.0064297915},"labels":[],"label_agreement":null},{"id":"W1793399427","doi":"10.1007/11587552_13","title":"Composite Subscriptions in Content-Based Publish/Subscribe Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workflow; Distributed computing; Publication; Router; Event (particle physics); Gossip; Computer network; Database","score_opus":0.03552637814999902,"score_gpt":0.2382614876497916,"score_spread":0.2027351094997926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793399427","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.054313842,0.0019176764,0.92182446,0.0008689279,0.00058348716,0.00035788544,0.00027670176,0.002865673,0.016991287],"genre_scores_gemma":[0.6612788,0.0019757212,0.29999143,0.00034824462,0.0009827606,0.00045550184,0.00074587757,0.0007683204,0.033453334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955605,0.0010865252,0.0004379776,0.0006264545,0.0018401268,0.00044836398],"domain_scores_gemma":[0.98402065,0.010406965,0.0005569119,0.0028321363,0.001383044,0.0008002071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065729585,0.00066466327,0.0031295547,0.00181984,0.0027626967,0.006873302,0.0026662035,0.0025367818,0.008650027],"category_scores_gemma":[0.017026113,0.0016211709,0.001030029,0.003978542,0.0021722224,0.009148293,0.003756343,0.002462808,0.0027025896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011704662,0.00055713195,0.002099103,0.0006076983,0.00013848755,0.00068156316,0.0010727888,0.06344925,0.010088526,0.71551025,0.013045061,0.19157968],"study_design_scores_gemma":[0.00021156161,0.00016856033,0.0004449906,0.000037545815,0.00013002261,0.00041706575,0.00016112173,0.3455825,0.0064896,0.6269432,0.01933804,0.00007583928],"about_ca_topic_score_codex":0.0012225221,"about_ca_topic_score_gemma":0.0012853378,"teacher_disagreement_score":0.008650027,"about_ca_system_score_codex":0.0016746154,"about_ca_system_score_gemma":0.0015627071,"threshold_uncertainty_score":0.034761548},"labels":[],"label_agreement":null},{"id":"W1793630144","doi":"10.1007/978-3-319-23219-5_29","title":"Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Upper and lower bounds; Computer science; Path (computing); Mathematical optimization; Relaxation (psychology); Graph; Longest path problem; Constraint (computer-aided design); Shortest path problem; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.026279975703092668,"score_gpt":0.263332280487377,"score_spread":0.23705230478428432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793630144","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.044151332,0.0007072809,0.91368103,0.0009110014,0.00014080555,0.00012688202,0.00026926713,0.0004354054,0.039577056],"genre_scores_gemma":[0.51182485,0.0012283348,0.45263624,0.0003598152,0.00020335669,0.00042756548,0.0006029565,0.0006399253,0.03207691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987356,0.0004501046,0.00003406332,0.00026270497,0.00027794897,0.00023950671],"domain_scores_gemma":[0.99712676,0.0022605911,0.00012604524,0.00014930293,0.00013294189,0.00020443929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076265,0.002241655,0.0020222766,0.00116751,0.001171948,0.0024674314,0.003381369,0.0032101062,0.008428697],"category_scores_gemma":[0.0067947377,0.0014324207,0.0016678498,0.0016015078,0.0024747893,0.0038363757,0.0034258298,0.0034714276,0.0009872284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011480636,0.00006200318,0.00022188867,0.00018444385,0.000044428463,0.00009863467,0.00011617915,0.7943818,0.0011876108,0.17980793,0.0049348017,0.018845424],"study_design_scores_gemma":[0.000014824973,0.000027516668,0.0000778873,0.000024881225,0.000011767391,0.00002975369,0.000025425517,0.85033643,0.00021122533,0.14771502,0.0015134991,0.000011680026],"about_ca_topic_score_codex":0.008860713,"about_ca_topic_score_gemma":0.006590921,"teacher_disagreement_score":0.008860713,"about_ca_system_score_codex":0.0027878867,"about_ca_system_score_gemma":0.0016964105,"threshold_uncertainty_score":0.028196812},"labels":[],"label_agreement":null},{"id":"W1793726452","doi":"10.1007/978-3-642-17226-7_16","title":"Distributed Group Communication System for Mobile Devices Based on SMS","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Computer science; Overhead (engineering); Communication in small groups; Short Message Service; Exploit; Multicast; Computer network; Service (business); Mobile device; Distributed computing; Computer security; Operating system","score_opus":0.012214481466605531,"score_gpt":0.24282956478741283,"score_spread":0.2306150833208073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793726452","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.33257523,0.0012569408,0.58603644,0.00069257757,0.00090796174,0.00089986424,0.000833673,0.041181564,0.03561576],"genre_scores_gemma":[0.903471,0.00019948377,0.06092133,0.00020919958,0.00017337535,0.0004161665,0.000777362,0.00035122407,0.033480812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958605,0.0001139719,0.000027281587,0.00007590855,0.00012310581,0.00007371215],"domain_scores_gemma":[0.9994541,0.000111838024,0.00003437973,0.00015645206,0.00015590934,0.00008719171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039567493,0.0005701983,0.0008787203,0.00068294205,0.0009937638,0.00062821765,0.0010865285,0.00068309635,0.010337417],"category_scores_gemma":[0.0006753008,0.00020709769,0.00031555753,0.0004729085,0.00024222405,0.0006200759,0.000959239,0.0006280581,0.0026853331],"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.0067955577,0.0010678053,0.0074030417,0.00066074624,0.0002560573,0.0018290841,0.0021055923,0.014577719,0.32989788,0.015680036,0.08092918,0.5387973],"study_design_scores_gemma":[0.0026885204,0.005760688,0.01548793,0.00024928345,0.0011160779,0.0028470464,0.0013253739,0.51756215,0.24298847,0.015960697,0.19370791,0.0003058517],"about_ca_topic_score_codex":0.0012847938,"about_ca_topic_score_gemma":0.0013564683,"teacher_disagreement_score":0.010337417,"about_ca_system_score_codex":0.00041863284,"about_ca_system_score_gemma":0.00049184606,"threshold_uncertainty_score":0.03458208},"labels":[],"label_agreement":null},{"id":"W1794214925","doi":"10.1007/978-3-540-75757-3_86","title":"Modeling of Needle-Tissue Interaction Using Ultrasound-Based Motion Estimation","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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 British Columbia","funders":"","keywords":"Displacement (psychology); Imaging phantom; Biomedical engineering; Ultrasound; Elastography; Finite element method; Acoustics; Brachytherapy; 3D ultrasound; Materials science; Engineering; Physics; Structural engineering; Optics; Surgery; Medicine","score_opus":0.02002166436796495,"score_gpt":0.2822192313951497,"score_spread":0.2621975670271848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794214925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0265379,0.00045367764,0.971348,0.00010233699,0.0000272419,0.00003195878,0.00005368212,0.00033947986,0.0011055979],"genre_scores_gemma":[0.8824273,0.0013626608,0.11029782,0.00011071218,0.000045581193,0.00012286552,0.00021343102,0.00018487833,0.005234716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997235,0.000059851485,0.000019984933,0.000060606566,0.000108352644,0.000027635419],"domain_scores_gemma":[0.99960643,0.00020281918,0.00007843814,0.000028980157,0.000058775473,0.000024592584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003989162,0.0005944445,0.0006590365,0.0004570991,0.00025758884,0.0009532234,0.0010988535,0.0016193743,0.0012001849],"category_scores_gemma":[0.0019760139,0.00076677493,0.0007611716,0.0005598064,0.0003892215,0.0009787332,0.0006448065,0.00054918753,0.0005093208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005649777,0.00003105889,0.0007442775,0.000065116285,0.00002988363,0.00014085643,0.00007660787,0.9574151,0.018339565,0.0017306736,0.0001838318,0.021186562],"study_design_scores_gemma":[0.0000025878376,0.000013471228,0.00019887314,0.0000032997996,0.0000074051245,0.000045666155,0.000003567655,0.99779284,0.0014380969,0.00026869943,0.00021935502,0.0000062634776],"about_ca_topic_score_codex":0.0057441844,"about_ca_topic_score_gemma":0.0040000654,"teacher_disagreement_score":0.0057441844,"about_ca_system_score_codex":0.0005431574,"about_ca_system_score_gemma":0.0007593315,"threshold_uncertainty_score":0.011421502},"labels":[],"label_agreement":null},{"id":"W1794309874","doi":"10.1007/978-3-642-02011-7_10","title":"A Heuristic for Fair Correlation-Aware Resource Placement","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Heuristic; Exploit; Scheme (mathematics); Mathematical optimization; Bounded function; Graph; Distributed computing; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.014910458150040991,"score_gpt":0.23632376810738856,"score_spread":0.22141330995734756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794309874","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.022265801,0.00063436106,0.9681417,0.00048004015,0.00032210932,0.00034201163,0.00016359723,0.001205564,0.006444826],"genre_scores_gemma":[0.3073382,0.00026754139,0.68623817,0.00033174446,0.00018785831,0.00031078793,0.0002677443,0.00027839118,0.004779517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979007,0.000636336,0.00008262053,0.00031106765,0.0005808129,0.0004884327],"domain_scores_gemma":[0.99428046,0.0035251945,0.00023916892,0.0008784712,0.0006888285,0.00038780094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003206593,0.0016163136,0.0025785384,0.002540531,0.0025355588,0.002457099,0.004168742,0.0023597225,0.009200672],"category_scores_gemma":[0.01243449,0.0011622299,0.0011892013,0.0032797535,0.0016464258,0.0026711125,0.0024602378,0.0017470056,0.0010909131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007554694,0.00043387798,0.0008853728,0.00023224858,0.00011111074,0.00016333202,0.00016640454,0.7181517,0.004674363,0.04739078,0.014523395,0.21251188],"study_design_scores_gemma":[0.000065913904,0.00006285238,0.00011972792,0.000020524858,0.0000285638,0.000054176347,0.00003264217,0.9773522,0.0009035731,0.020254502,0.0010853457,0.000019959847],"about_ca_topic_score_codex":0.0074764965,"about_ca_topic_score_gemma":0.014354703,"teacher_disagreement_score":0.009200672,"about_ca_system_score_codex":0.0029879755,"about_ca_system_score_gemma":0.006012594,"threshold_uncertainty_score":0.030779302},"labels":[],"label_agreement":null},{"id":"W1794390359","doi":"10.1007/978-3-540-69828-9_17","title":"Chemical Knowledge for the Semantic Web","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Ontology; Semantic Web; PubChem; Knowledge representation and reasoning; DrugBank; Information retrieval; Semantic Web Rule Language; Web Ontology Language; Sublanguage; OWL-S; World Wide Web; Social Semantic Web; Natural language processing; Artificial intelligence; Semantic analytics","score_opus":0.022038828262771693,"score_gpt":0.2728477746343452,"score_spread":0.25080894637157347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794390359","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.007091969,0.018084519,0.81416285,0.018810455,0.002112288,0.00023709433,0.0058111944,0.0075895796,0.12610006],"genre_scores_gemma":[0.12211383,0.024118857,0.79414654,0.0035232943,0.0013741426,0.00033712393,0.013830783,0.0013989792,0.039156433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990957,0.00017468525,0.00013071374,0.00014170005,0.00040351463,0.00005373708],"domain_scores_gemma":[0.99897707,0.0003555176,0.00004670105,0.00040635743,0.00014890432,0.00006549126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015727205,0.0007347766,0.0007990908,0.0034448104,0.0010871378,0.0046713552,0.0016152199,0.0019614252,0.013221037],"category_scores_gemma":[0.003311269,0.0007440449,0.0012949032,0.0033111463,0.0018171647,0.015232907,0.0037879704,0.0023440577,0.005959224],"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.000035579014,0.000043046995,0.00012574162,0.00037975094,0.000036211575,0.00016494568,0.00015338248,0.0024091236,0.0014101852,0.8339438,0.031123312,0.130175],"study_design_scores_gemma":[0.000008639764,0.00000530864,0.000079320474,0.00013016195,0.000019223255,0.0001160243,0.000050316652,0.009348988,0.0010570649,0.80588055,0.18329366,0.000010766109],"about_ca_topic_score_codex":0.0022699004,"about_ca_topic_score_gemma":0.0028383392,"teacher_disagreement_score":0.013221037,"about_ca_system_score_codex":0.0012921442,"about_ca_system_score_gemma":0.0014027802,"threshold_uncertainty_score":0.044228733},"labels":[],"label_agreement":null},{"id":"W1794401605","doi":"10.1007/978-3-540-30201-8_40","title":"Improved Algorithms for the Global Cardinality Constraint","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Consistency (knowledge bases); Local consistency; Domain (mathematical analysis); Algorithm; Constraint (computer-aided design); Computer science; Range (aeronautics); Constraint satisfaction; Variable (mathematics); Constant (computer programming); Constraint satisfaction problem; Combinatorics; Discrete mathematics; Mathematics; Data mining; Artificial intelligence","score_opus":0.020860163260258958,"score_gpt":0.2659771024728263,"score_spread":0.24511693921256733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794401605","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.003363762,0.00034793225,0.99030906,0.00015449614,0.000094407114,0.000063403095,0.00013284975,0.00080736325,0.004726755],"genre_scores_gemma":[0.02537856,0.00027429292,0.9675913,0.00010698537,0.00012567379,0.00016448452,0.00046639002,0.00059053954,0.0053019244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699247,0.0007751928,0.00017298243,0.00066048955,0.001053453,0.00034540426],"domain_scores_gemma":[0.9929938,0.0037004007,0.00029463042,0.0020801092,0.00077122636,0.00015982047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033434646,0.0023743086,0.0029503116,0.0023214922,0.00142362,0.0028779635,0.005293598,0.0022543224,0.021411443],"category_scores_gemma":[0.01155632,0.001335696,0.0026289031,0.0047396314,0.0017847779,0.007665715,0.0050683473,0.0057256757,0.0035454014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004282583,0.00022948562,0.0005712742,0.00043768686,0.00013693573,0.00008779881,0.00023763465,0.22462188,0.0039872467,0.19039772,0.024359183,0.55450493],"study_design_scores_gemma":[0.00014936869,0.00006842869,0.00035198202,0.00006800674,0.00009542625,0.000121090336,0.00006141483,0.7947929,0.0033661202,0.18732628,0.013562729,0.000036231606],"about_ca_topic_score_codex":0.0034900017,"about_ca_topic_score_gemma":0.0066830376,"teacher_disagreement_score":0.021411443,"about_ca_system_score_codex":0.002198213,"about_ca_system_score_gemma":0.0021776191,"threshold_uncertainty_score":0.07162845},"labels":[],"label_agreement":null},{"id":"W1794864632","doi":"10.1007/978-3-540-76900-2_25","title":"Information-Theoretic Security Without an Honest Majority","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"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":"Computer science; Computer security; Abort; Protocol (science); Veto; Transmission (telecommunications); Private information retrieval; Pairwise comparison; Channel (broadcasting); Oblivious transfer; Computer network; Cryptography; Telecommunications; Political science; Law; Artificial intelligence","score_opus":0.011934644676817511,"score_gpt":0.24989171179120237,"score_spread":0.23795706711438486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794864632","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.045770675,0.0032771367,0.50425446,0.02123534,0.0021930323,0.00025571714,0.00081139425,0.0006923953,0.42150986],"genre_scores_gemma":[0.80794144,0.0020789898,0.06923192,0.0023374734,0.0015017985,0.0003996913,0.00035819112,0.00025105293,0.11589946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528164,0.0012814797,0.00025055662,0.00069388736,0.0019312232,0.0005611386],"domain_scores_gemma":[0.9954715,0.0020778817,0.00020102954,0.0017785358,0.0003448319,0.0001262004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028911242,0.0010008271,0.0010682442,0.0009074364,0.001917519,0.0036004146,0.0017076406,0.0028649918,0.006661648],"category_scores_gemma":[0.008123064,0.0007802229,0.0009829388,0.0010959927,0.0055386857,0.01128924,0.004522859,0.005639427,0.003552136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047083966,0.00001501717,0.000029011795,0.000045689518,0.0000117261525,0.000025236071,0.00009195773,0.0012442314,0.0006445966,0.9851016,0.0036576705,0.009086182],"study_design_scores_gemma":[0.000010828836,0.000009503447,0.000017283697,0.000010926983,0.0000064820983,0.00003662897,0.000008439758,0.002436049,0.00065801304,0.9925863,0.004213441,0.0000060671896],"about_ca_topic_score_codex":0.00015222741,"about_ca_topic_score_gemma":0.00013328408,"teacher_disagreement_score":0.006661648,"about_ca_system_score_codex":0.001417414,"about_ca_system_score_gemma":0.0013659858,"threshold_uncertainty_score":0.022285461},"labels":[],"label_agreement":null},{"id":"W1794915560","doi":"10.1007/978-3-540-68125-0_61","title":"A Tree-Based Approach for Frequent Pattern Mining from Uncertain Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":224,"is_retracted":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":"Computer science; Database transaction; Data mining; Tree (set theory); Transaction data; Database; Mathematics","score_opus":0.06928100922740438,"score_gpt":0.28006681655450605,"score_spread":0.21078580732710167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794915560","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.0022308398,0.0005532297,0.995732,0.00013031479,0.00006299346,0.000088666,0.00031438452,0.00050320936,0.00038433113],"genre_scores_gemma":[0.027264662,0.0007710917,0.96948797,0.00012607273,0.00011073207,0.00017904678,0.0010805258,0.000074446645,0.00090556033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973277,0.00055955705,0.00033788435,0.000386112,0.0012852363,0.000103571525],"domain_scores_gemma":[0.9941757,0.0037315872,0.00021196317,0.00048033576,0.0012568209,0.00014360157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232265,0.0008951187,0.001780954,0.0029776052,0.0009786004,0.0019155664,0.0023503576,0.0016794197,0.0029980268],"category_scores_gemma":[0.0112794135,0.000628568,0.0019172473,0.0063377954,0.00048915093,0.0034097605,0.0014300654,0.001766289,0.0019391543],"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.00032647702,0.00027748322,0.001485008,0.0007249972,0.000359861,0.0006608374,0.00034494116,0.059506,0.009388476,0.02726307,0.014881518,0.8847813],"study_design_scores_gemma":[0.00006684085,0.00019124463,0.000636648,0.00011761054,0.00019376412,0.0010826349,0.00011746316,0.9045362,0.0036982545,0.07488728,0.014406244,0.00006585241],"about_ca_topic_score_codex":0.002819096,"about_ca_topic_score_gemma":0.0038361938,"teacher_disagreement_score":0.0029980268,"about_ca_system_score_codex":0.00043116004,"about_ca_system_score_gemma":0.0012635931,"threshold_uncertainty_score":0.011805534},"labels":[],"label_agreement":null},{"id":"W179492166","doi":"10.1007/978-3-540-77129-6_22","title":"Direct Ellipse Fitting and Measuring Based on Shape Boundaries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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 Ottawa","funders":"","keywords":"Ellipse; Conic section; Polar coordinate system; Measure (data warehouse); Invariant (physics); Geometry; Mathematics; Point (geometry); Ellipsoid; Boundary (topology); Rotation (mathematics); Mathematical analysis; Algorithm; Computer science; Geodesy; Geography","score_opus":0.0229232436524867,"score_gpt":0.24626420344103161,"score_spread":0.2233409597885449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179492166","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.006761127,0.0001951645,0.9900669,0.00003124884,0.00003201152,0.000029207955,0.000025180178,0.0014192665,0.0014400015],"genre_scores_gemma":[0.10542255,0.00032800282,0.88819814,0.000052996074,0.000053021347,0.000060636186,0.000175216,0.00056266104,0.0051467326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974542,0.000289164,0.0001145049,0.00069485244,0.00130356,0.00014374094],"domain_scores_gemma":[0.99522394,0.0014825022,0.00033017606,0.0016610808,0.0011558573,0.00014637006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012937819,0.0014338653,0.001980071,0.0017401136,0.00067035947,0.0019820791,0.0021413695,0.00201481,0.0056182407],"category_scores_gemma":[0.006352211,0.001305095,0.00090159057,0.0016111725,0.00085399527,0.0033323842,0.0028303096,0.0016400354,0.004787066],"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.00022966096,0.0000879462,0.0012949742,0.00024209286,0.0000425478,0.00011119764,0.00024779566,0.007850249,0.1365463,0.009423588,0.002383565,0.8415401],"study_design_scores_gemma":[0.00004373033,0.00045347563,0.006652267,0.000084070125,0.00014058569,0.003116547,0.00021446918,0.61156905,0.33085772,0.018221682,0.02848267,0.00016368306],"about_ca_topic_score_codex":0.00080213515,"about_ca_topic_score_gemma":0.0011373953,"teacher_disagreement_score":0.0056182407,"about_ca_system_score_codex":0.0004541741,"about_ca_system_score_gemma":0.0006821999,"threshold_uncertainty_score":0.018794894},"labels":[],"label_agreement":null},{"id":"W17956733","doi":"10.1007/978-3-642-30353-1_27","title":"Mining Sequential Rules Common to Several Sequences with the Window Size Constraint","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université du Québec à Montréal; Université de Moncton","funders":"","keywords":"Computer science; Constraint (computer-aided design); Window (computing); Data mining; Span (engineering); Sequential Pattern Mining; Algorithm; Sliding window protocol; Artificial intelligence; Mathematics","score_opus":0.020664498789227274,"score_gpt":0.2548446231237625,"score_spread":0.23418012433453522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17956733","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.29834357,0.00252018,0.6906331,0.00039901055,0.0001902962,0.0006027535,0.0036047322,0.001269718,0.0024366162],"genre_scores_gemma":[0.55394804,0.0012487499,0.43148512,0.00021347708,0.00033597025,0.00051642366,0.0096688075,0.00019867382,0.0023847804],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953275,0.00042151863,0.0008679259,0.0017021629,0.0013816393,0.00029928912],"domain_scores_gemma":[0.982028,0.011908778,0.002275517,0.0016884111,0.0015762257,0.00052309973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002931581,0.0011531695,0.0023915388,0.0046455706,0.0008508806,0.0023255409,0.0022317297,0.0013040625,0.001790328],"category_scores_gemma":[0.018071087,0.0010019463,0.002551751,0.0045558345,0.00085837493,0.003928182,0.0013120663,0.0014458349,0.0006402462],"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.0037504965,0.0012443105,0.08915705,0.0024464743,0.0020250732,0.0061931256,0.00070278195,0.10356129,0.058183737,0.022482237,0.007643217,0.70261025],"study_design_scores_gemma":[0.00025951525,0.0012246597,0.018995607,0.00043688848,0.0012427459,0.0050983033,0.00052276195,0.8644197,0.032495663,0.06383339,0.011353244,0.000117527066],"about_ca_topic_score_codex":0.0021535226,"about_ca_topic_score_gemma":0.0036303145,"teacher_disagreement_score":0.0046455706,"about_ca_system_score_codex":0.0004006036,"about_ca_system_score_gemma":0.0025635057,"threshold_uncertainty_score":0.015503883},"labels":[],"label_agreement":null},{"id":"W1795706927","doi":"10.1007/978-3-540-31832-3_9","title":"An Evaluation of Auto-Scoping in OpenMP","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Computer science; Compiler; Suite; Programming language; Benchmark (surveying); Speedup; Parallel computing; Fortran; Compiler construction; Reduction (mathematics)","score_opus":0.051708513546617735,"score_gpt":0.33146923269746137,"score_spread":0.27976071915084366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795706927","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.88437086,0.0022419775,0.07814755,0.00043951563,0.00021866936,0.0004993667,0.0015849635,0.009743026,0.022754047],"genre_scores_gemma":[0.93184805,0.000432164,0.060259137,0.0000856602,0.00004405311,0.00018300704,0.0018690211,0.0013603372,0.003918483],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9850723,0.0073933695,0.0012812677,0.0008649456,0.004665411,0.00072270085],"domain_scores_gemma":[0.78504825,0.17991516,0.0035767923,0.018230174,0.012302396,0.00092721503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009549373,0.0008288031,0.0008665361,0.0025864902,0.0011805986,0.0017819767,0.0026113794,0.0016651566,0.0059962524],"category_scores_gemma":[0.07713503,0.0006006222,0.00077597867,0.002367233,0.0013605452,0.0047571887,0.0028497633,0.0009994821,0.0007193986],"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.011974747,0.0027839716,0.02744618,0.0063381027,0.00058597245,0.0007763569,0.0045311525,0.10178558,0.024221238,0.024137309,0.011445436,0.783974],"study_design_scores_gemma":[0.00196293,0.00894877,0.020395996,0.0018678955,0.0018594043,0.0013003161,0.004095895,0.75938296,0.13331495,0.035038535,0.031563744,0.00026862702],"about_ca_topic_score_codex":0.0036151423,"about_ca_topic_score_gemma":0.0042417343,"teacher_disagreement_score":0.009549373,"about_ca_system_score_codex":0.000870139,"about_ca_system_score_gemma":0.0017130018,"threshold_uncertainty_score":0.05050254},"labels":[],"label_agreement":null},{"id":"W1795714200","doi":"10.1007/11602613_13","title":"An Optimization Problem Related to VoD Broadcasting","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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; Tree (set theory); Binary logarithm; Integer (computer science); Broadcasting (networking); Schedule; Node (physics); Mathematics; Combinatorial optimization; Value (mathematics); Computer science; Discrete mathematics; Algorithm; Physics; Statistics","score_opus":0.010789630284041476,"score_gpt":0.23841217390911873,"score_spread":0.22762254362507725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795714200","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.111005984,0.007547519,0.7257452,0.012438862,0.0015748581,0.0005203449,0.0015054395,0.00033133934,0.13933043],"genre_scores_gemma":[0.80209464,0.006768008,0.1071141,0.0012378664,0.0022377614,0.00044576082,0.0010581737,0.0004245573,0.078619145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869186,0.0005765019,0.000048916925,0.00023952911,0.00023256177,0.00021066044],"domain_scores_gemma":[0.9964104,0.0029118278,0.00021085919,0.00009402816,0.00017479974,0.00019801965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653317,0.0013277871,0.0025246055,0.0011853087,0.0012399299,0.0038128763,0.0020409129,0.0050197947,0.012072043],"category_scores_gemma":[0.009308997,0.0011833175,0.001298149,0.0030356625,0.002092882,0.0036361816,0.0017003475,0.0033901506,0.000562501],"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.000329774,0.0004276099,0.0008120943,0.00067887123,0.0001297257,0.00033894298,0.00020479814,0.5704169,0.0013698009,0.34383845,0.022921164,0.058531865],"study_design_scores_gemma":[0.00009819742,0.00010688964,0.0005976983,0.00007951807,0.00006209195,0.000172527,0.00013776714,0.6983032,0.00040520524,0.29303676,0.006964137,0.00003595564],"about_ca_topic_score_codex":0.0055920887,"about_ca_topic_score_gemma":0.003070295,"teacher_disagreement_score":0.012072043,"about_ca_system_score_codex":0.0030878508,"about_ca_system_score_gemma":0.0016051732,"threshold_uncertainty_score":0.040385067},"labels":[],"label_agreement":null},{"id":"W1795780783","doi":"10.1007/978-3-540-77343-6_17","title":"Selective Attention in the Learning of Viewpoint and Position Invariance","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"Computer science; Artificial intelligence; Invariant (physics); Object (grammar); Construct (python library); Artificial neural network; Task (project management); Cognitive neuroscience of visual object recognition; Computer vision; Mathematics","score_opus":0.023336422079447923,"score_gpt":0.2811971622341837,"score_spread":0.25786074015473576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795780783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19655831,0.0033285758,0.79250884,0.0005805374,0.00016610515,0.000034879246,0.00011279547,0.00048478338,0.0062251105],"genre_scores_gemma":[0.93855095,0.0011424199,0.054662757,0.00012551174,0.00016028552,0.000036159105,0.00022979885,0.00009153005,0.0050005466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999729,0.00007275297,0.000012368128,0.000095682524,0.00003992115,0.000050254854],"domain_scores_gemma":[0.9986564,0.00092341175,0.000098828925,0.00014545502,0.00011176593,0.000064151485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011243969,0.00041220867,0.0009618445,0.00042457023,0.00018624566,0.00084940996,0.0012346796,0.00069764606,0.0018198382],"category_scores_gemma":[0.004614226,0.00044618838,0.0005766923,0.00066763186,0.0007619888,0.0018103153,0.0009884043,0.0010722955,0.00025244773],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005044915,0.00013942449,0.0039356165,0.00029720739,0.00021765454,0.00016538572,0.0002864717,0.13590482,0.03618261,0.11558491,0.006443303,0.7003381],"study_design_scores_gemma":[0.00003893512,0.00013879733,0.005585266,0.000015038639,0.000041006588,0.000115023584,0.000030189454,0.82195985,0.0070325523,0.16386116,0.0011594913,0.00002267339],"about_ca_topic_score_codex":0.0034757245,"about_ca_topic_score_gemma":0.0031210557,"teacher_disagreement_score":0.0034757245,"about_ca_system_score_codex":0.0006565258,"about_ca_system_score_gemma":0.00042783126,"threshold_uncertainty_score":0.0069109797},"labels":[],"label_agreement":null},{"id":"W1795879888","doi":"10.1007/3-540-39205-x_12","title":"A Common Framework for Rough Sets, Databases, and Bayesian Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Bayesian network; Computer science; Database; Data mining; Bayesian probability; Artificial intelligence","score_opus":0.03586119094432777,"score_gpt":0.2923577775413548,"score_spread":0.256496586597027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795879888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005543836,0.0050825267,0.98188925,0.0031309477,0.0002762999,0.00006778436,0.00025177214,0.00015941098,0.008587596],"genre_scores_gemma":[0.0545808,0.011379983,0.9220729,0.0014482609,0.0017910243,0.0007684613,0.00062878843,0.00018554047,0.0071442537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99092484,0.0042751688,0.0010735054,0.0011386585,0.0023013654,0.00028637607],"domain_scores_gemma":[0.98960495,0.0057392744,0.0007161082,0.0019541243,0.00150196,0.000483539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012325653,0.002051579,0.003867445,0.0063374345,0.0026468653,0.011721185,0.006383069,0.005277726,0.0070076007],"category_scores_gemma":[0.02362712,0.0015203087,0.004393429,0.010317597,0.0068324045,0.014013203,0.0052414834,0.0084058875,0.0026470164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003756,0.000008846932,0.00002779427,0.00007634803,0.000021279433,0.00003235111,0.00011394846,0.0018905333,0.000052132105,0.98636395,0.0021003028,0.00930881],"study_design_scores_gemma":[0.0000055145215,0.0000065292998,0.000030559324,0.00006283752,0.00001684297,0.00005122529,0.00003753592,0.007021433,0.000040662908,0.9768016,0.015913494,0.000011802497],"about_ca_topic_score_codex":0.0041653067,"about_ca_topic_score_gemma":0.0042076507,"teacher_disagreement_score":0.012325653,"about_ca_system_score_codex":0.003131367,"about_ca_system_score_gemma":0.0038773958,"threshold_uncertainty_score":0.06518507},"labels":[],"label_agreement":null},{"id":"W179605015","doi":"10.1007/978-3-642-37484-5_1","title":"Historical Document Binarization Based on Phase Information of Images","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Robustness (evolution); Maxima and minima; Pattern recognition (psychology); Gaussian; Phase congruency; Gaussian filter; Filter (signal processing); Historical document; Binary number; Feature (linguistics); Computer vision; Image (mathematics); Mathematics","score_opus":0.01132746934662753,"score_gpt":0.24698485900489434,"score_spread":0.2356573896582668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179605015","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.04561739,0.009923119,0.9231798,0.0001854048,0.0008822906,0.00014151755,0.0016205607,0.0038989063,0.0145511525],"genre_scores_gemma":[0.2971213,0.01192977,0.64114225,0.00011205565,0.0007096867,0.000117219824,0.0072159627,0.0009612639,0.040690526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980146,0.000014758183,0.000016669726,0.00006302824,0.00007943382,0.000024750592],"domain_scores_gemma":[0.9995789,0.00007041182,0.000035651476,0.00006872271,0.00022085446,0.000025547772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028579627,0.0006037465,0.0004403027,0.003432309,0.00042053152,0.0009997374,0.0005452008,0.00034820935,0.0074254377],"category_scores_gemma":[0.00068417034,0.00030404693,0.0004415666,0.0032899166,0.0003169789,0.0011680875,0.00038945198,0.0005452226,0.005036527],"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.00024765317,0.00002690423,0.0008938026,0.000393282,0.000030230494,0.000086435444,0.000075505675,0.002339454,0.11777055,0.0027305458,0.004861468,0.8705442],"study_design_scores_gemma":[0.00006025635,0.00052370323,0.037356533,0.00028769046,0.0006389513,0.0034055747,0.00030763296,0.16728088,0.5790985,0.0068504275,0.2040176,0.00017218277],"about_ca_topic_score_codex":0.0015432825,"about_ca_topic_score_gemma":0.0024910043,"teacher_disagreement_score":0.0074254377,"about_ca_system_score_codex":0.00029721425,"about_ca_system_score_gemma":0.00036459477,"threshold_uncertainty_score":0.024840534},"labels":[],"label_agreement":null},{"id":"W1796186189","doi":"10.1007/978-3-642-21538-4_17","title":"Online Incremental Learning of Inverse Dynamics Incorporating Prior Knowledge","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","field":"Engineering","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 Waterloo","funders":"","keywords":"Computer science; Initialization; Inverse dynamics; Machine learning; Artificial intelligence; A priori and a posteriori; Process (computing); System dynamics; Regression; Data mining; Mathematics","score_opus":0.015021752411975975,"score_gpt":0.21882398370144132,"score_spread":0.20380223128946534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796186189","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.009769506,0.0003237438,0.9866024,0.00009285584,0.00008139069,0.000030296986,0.000048259557,0.00092659856,0.0021249177],"genre_scores_gemma":[0.5336543,0.0006326805,0.45290518,0.00023499243,0.00023465742,0.00022877213,0.00069096906,0.00027967637,0.011138746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970967,0.000046500118,0.000019823387,0.0000835942,0.000103898325,0.000036530888],"domain_scores_gemma":[0.9982932,0.0010908019,0.00007121345,0.0002662775,0.00022235504,0.00005628164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007460485,0.0009486724,0.0013648954,0.00049385417,0.00032217256,0.0009959427,0.002140127,0.0015045073,0.0059011695],"category_scores_gemma":[0.0038520303,0.00090110366,0.0007604126,0.0005951146,0.00065584725,0.0019465116,0.0020868548,0.0021476715,0.0016203839],"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.00027151042,0.00024285763,0.00049856084,0.00030257288,0.00009172836,0.00014613375,0.00010030023,0.3928642,0.009642854,0.010654947,0.0050407606,0.5801436],"study_design_scores_gemma":[0.000010890564,0.000035612808,0.00009122054,0.000007738092,0.000009999978,0.000037238642,0.0000048198585,0.994547,0.0013073962,0.0033469598,0.0005951572,0.0000058844166],"about_ca_topic_score_codex":0.004352103,"about_ca_topic_score_gemma":0.0066197473,"teacher_disagreement_score":0.0059011695,"about_ca_system_score_codex":0.00037128493,"about_ca_system_score_gemma":0.00087578146,"threshold_uncertainty_score":0.019741356},"labels":[],"label_agreement":null},{"id":"W179626221","doi":"10.1007/978-3-642-31522-0_68","title":"Creating an Entertaining and Informative Music Visualization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multisensory perception and integration","field":"Psychology","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Visualization; Audio visual; Multimedia; Human–computer interaction; Cognitive science; Artificial intelligence; Psychology","score_opus":0.05798576979333388,"score_gpt":0.3496006790654885,"score_spread":0.2916149092721546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179626221","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03669848,0.0012467629,0.8295912,0.001429204,0.0013793804,0.00024296502,0.00081363344,0.03310437,0.09549404],"genre_scores_gemma":[0.13402624,0.0011748624,0.75741017,0.00047447326,0.0003858209,0.00025077155,0.0010342038,0.010694597,0.09454886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985194,0.00002984065,0.000005317138,0.000022714368,0.000069644375,0.000020459363],"domain_scores_gemma":[0.999553,0.00023022965,0.000014559165,0.00004990427,0.000066308094,0.0000860179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035442892,0.0011218217,0.000322226,0.00079175935,0.0005538999,0.001851216,0.0009478751,0.0008840932,0.050123136],"category_scores_gemma":[0.001468282,0.00046844906,0.00069927884,0.00033171478,0.00037200146,0.0015479473,0.0024225705,0.0011605313,0.007845831],"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.0003460531,0.00020700668,0.0008468468,0.0010875927,0.000080745944,0.0013970027,0.0034115103,0.005269147,0.19747403,0.026139198,0.14422719,0.6195136],"study_design_scores_gemma":[0.00021389079,0.00041155677,0.0028573247,0.00046749553,0.00013265743,0.0041596494,0.0019423729,0.048657104,0.07704021,0.03428554,0.82962286,0.00020930439],"about_ca_topic_score_codex":0.00024296631,"about_ca_topic_score_gemma":0.0006597422,"teacher_disagreement_score":0.050123136,"about_ca_system_score_codex":0.00016540213,"about_ca_system_score_gemma":0.00021983807,"threshold_uncertainty_score":0.1676786},"labels":[],"label_agreement":null},{"id":"W1796297130","doi":"10.1007/978-3-540-77224-8_36","title":"Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p,2)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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 Victoria","funders":"","keywords":"TRACE (psycholinguistics); Weight distribution; Mathematics; Galois theory; Binary number; Distribution (mathematics); Finite field; Construct (python library); Discrete mathematics; Field (mathematics); Arithmetic; Pure mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.012430558016525216,"score_gpt":0.24924893176911564,"score_spread":0.23681837375259043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796297130","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.7675932,0.00060982816,0.20880581,0.0013187799,0.0001226126,0.00010683737,0.00072858983,0.0006072563,0.020107057],"genre_scores_gemma":[0.9826096,0.00035004408,0.00932012,0.00007501672,0.00013897405,0.00008706002,0.00048813352,0.00012840367,0.0068026544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874926,0.00034513883,0.00004623534,0.0001799256,0.00041490074,0.00026457416],"domain_scores_gemma":[0.99291223,0.003897295,0.0007012004,0.0010990624,0.00093867857,0.00045164354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00189071,0.000621846,0.00052936847,0.0021092822,0.00066903635,0.002383009,0.0012504697,0.0010623337,0.0044678836],"category_scores_gemma":[0.015387065,0.00042913933,0.00031556745,0.0019342878,0.0023717799,0.002945381,0.0013907526,0.0011422418,0.0007024181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010631367,0.00014157948,0.0056470465,0.00014525384,0.000040180883,0.0005734309,0.00071163155,0.038979765,0.022582533,0.880057,0.0032395911,0.04681879],"study_design_scores_gemma":[0.0001437304,0.00018615465,0.0036363571,0.00009451607,0.000020404192,0.0011480737,0.000263428,0.27927083,0.012254082,0.70042676,0.0024734347,0.00008223737],"about_ca_topic_score_codex":0.00043072825,"about_ca_topic_score_gemma":0.00033254054,"teacher_disagreement_score":0.0044678836,"about_ca_system_score_codex":0.0014081106,"about_ca_system_score_gemma":0.0010712546,"threshold_uncertainty_score":0.01494652},"labels":[],"label_agreement":null},{"id":"W179681099","doi":"10.1007/978-3-642-33515-0_55","title":"Rapid Control Selection through Hill-Climbing Methods","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Control Systems Optimization","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 Calgary","funders":"","keywords":"Hill climbing; Climbing; Selection (genetic algorithm); Dimension (graph theory); Random search; Control (management); Model predictive control; Set (abstract data type); Computer science; Mathematical optimization; Machine learning; Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.01590554455681455,"score_gpt":0.2639166353443206,"score_spread":0.24801109078750602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179681099","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.0042817504,0.00046629846,0.98114496,0.00005894635,0.00008419721,0.00007088729,0.000037700596,0.0012536293,0.012601693],"genre_scores_gemma":[0.21831638,0.00069643883,0.7587238,0.00018671018,0.00007855333,0.000410061,0.00022593183,0.000913888,0.020448327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997135,0.00006175888,0.000012983891,0.000040013576,0.00013700697,0.000034625293],"domain_scores_gemma":[0.9995709,0.00023319264,0.000025589483,0.00006220389,0.00008702826,0.000021082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006492587,0.0013682272,0.0013348337,0.00068324385,0.00068390474,0.0009630284,0.0012655172,0.0010916783,0.0117692705],"category_scores_gemma":[0.001603583,0.00086859695,0.0006209343,0.0005976435,0.00042963994,0.00081074267,0.0010358538,0.0012137747,0.0025574726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018099509,0.00011619532,0.0002076558,0.00039521765,0.000109683,0.00018993663,0.00015792844,0.5318796,0.018603418,0.02508396,0.016410498,0.4066649],"study_design_scores_gemma":[0.000027493883,0.000054808264,0.00010119611,0.000027482898,0.000013863277,0.000050630948,0.000013518599,0.9892029,0.0021978647,0.004077027,0.0042207614,0.000012350567],"about_ca_topic_score_codex":0.0031064749,"about_ca_topic_score_gemma":0.00435644,"teacher_disagreement_score":0.0117692705,"about_ca_system_score_codex":0.00032442782,"about_ca_system_score_gemma":0.0005452473,"threshold_uncertainty_score":0.039372087},"labels":[],"label_agreement":null},{"id":"W1797665807","doi":"10.1007/3-540-45749-6_58","title":"Covering Things with Things","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Dimension (graph theory); Running time; Time complexity; Combinatorics; Notation; Algorithm; Binary logarithm; Computer science; Discrete mathematics; Mathematics; Arithmetic","score_opus":0.013497516783689227,"score_gpt":0.21498064990667748,"score_spread":0.20148313312298824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797665807","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008478586,0.015640412,0.019063348,0.009451459,0.007430661,0.00003891114,0.00016735226,0.00050474936,0.94685525],"genre_scores_gemma":[0.017502494,0.013219794,0.008041368,0.0054860064,0.0022636082,0.00008986094,0.000381472,0.00087001163,0.95214534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995092,0.00013356654,0.000018843295,0.00009478841,0.00018125388,0.00006232379],"domain_scores_gemma":[0.99960953,0.00010135746,0.00001497494,0.000110973735,0.0000846539,0.000078592486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004736784,0.0008126968,0.0005150494,0.0014301357,0.0029729116,0.006027606,0.0008547674,0.0014594544,0.10228303],"category_scores_gemma":[0.001485213,0.00039456695,0.00069096114,0.0020549821,0.003022922,0.009411131,0.004291143,0.0031052276,0.038856428],"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.000010204108,0.000011195803,0.000079930775,0.00014376156,0.0000068313366,0.00006281531,0.0015463113,0.00013883907,0.00034232604,0.5081495,0.3795416,0.109966636],"study_design_scores_gemma":[8.191323e-7,0.0000029036526,0.00003777888,0.000053051896,0.0000017198798,0.00005303818,0.00026102277,0.000033763186,0.000041241703,0.041550428,0.9579617,0.000002592613],"about_ca_topic_score_codex":0.0012007019,"about_ca_topic_score_gemma":0.0032313815,"teacher_disagreement_score":0.10228303,"about_ca_system_score_codex":0.001314677,"about_ca_system_score_gemma":0.0009924519,"threshold_uncertainty_score":0.34217083},"labels":[],"label_agreement":null},{"id":"W1797874232","doi":"10.1007/978-3-319-08434-3_5","title":"Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"Engineering and Physical Sciences Research Council; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"CAD; Computer science; Heuristics; Invariant (physics); Decomposition; Algebraic number; Algorithm; Theoretical computer science; Algebra over a field; Mathematical optimization; Mathematics; Engineering drawing; Pure mathematics","score_opus":0.011175625921022963,"score_gpt":0.2518775313712258,"score_spread":0.24070190545020284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797874232","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.0105914585,0.00021619114,0.9803569,0.0005603113,0.00008993187,0.00013019859,0.00052771514,0.00033012434,0.007197288],"genre_scores_gemma":[0.31534913,0.0005122128,0.6684885,0.000302012,0.00022385395,0.00039329167,0.002226265,0.00036478933,0.01213994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909985,0.00018214305,0.000039534134,0.0003132346,0.00021084117,0.00015441455],"domain_scores_gemma":[0.9986829,0.00078628026,0.00007155733,0.00015536661,0.0002404601,0.000063333195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038969,0.00077243254,0.001379674,0.0006922672,0.0006877856,0.00225094,0.001897377,0.0014994915,0.020510059],"category_scores_gemma":[0.0046269502,0.00053237873,0.0013533224,0.0010432946,0.0009729832,0.0032931156,0.0018272183,0.0019017074,0.0019125202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003120468,0.00022859723,0.0008776011,0.0010086052,0.00006913049,0.00040562722,0.00034078106,0.34316292,0.006166833,0.3888335,0.037914738,0.22067969],"study_design_scores_gemma":[0.000037901926,0.00004911778,0.00010093059,0.00003768247,0.000020759195,0.000087904446,0.00015600401,0.83990455,0.001010494,0.1550297,0.0035484566,0.000016458642],"about_ca_topic_score_codex":0.0037767603,"about_ca_topic_score_gemma":0.004305939,"teacher_disagreement_score":0.020510059,"about_ca_system_score_codex":0.0009214565,"about_ca_system_score_gemma":0.0016469087,"threshold_uncertainty_score":0.06861293},"labels":[],"label_agreement":null},{"id":"W1798342512","doi":"10.1007/3-540-47555-9_14","title":"Public-Key Cryptosystems with Very Small Key Lengths","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Key (lock); Public-key cryptography; Hybrid cryptosystem; Key size; Computer science; Public key cryptosystem; Computer security; Cryptography; Elliptic curve cryptography; Encryption","score_opus":0.030961371600425756,"score_gpt":0.22758354165613867,"score_spread":0.19662217005571292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798342512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02893396,0.0065419697,0.8759085,0.0020830892,0.0010139771,0.00023328904,0.00023369052,0.002148896,0.08290261],"genre_scores_gemma":[0.5615221,0.009596285,0.33788246,0.0010273955,0.0016399862,0.00074504357,0.00051629805,0.0010896397,0.085980855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986066,0.00026823647,0.00009838466,0.00016634451,0.00073845877,0.00012203403],"domain_scores_gemma":[0.9968065,0.0018135785,0.00020152774,0.00084956136,0.00022924172,0.00009957574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755599,0.0010691783,0.0007612986,0.0010101406,0.00074156706,0.0018677055,0.0010626379,0.0011749319,0.008767046],"category_scores_gemma":[0.005126479,0.0007567338,0.00050551054,0.0012368065,0.0021274246,0.008144607,0.0021088447,0.0031714826,0.00569884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003805762,0.00007329952,0.00012541821,0.00057533593,0.000037832106,0.00010391905,0.0001949181,0.0050171427,0.038328826,0.7921217,0.008871463,0.15416951],"study_design_scores_gemma":[0.00014862992,0.00020680117,0.00018160674,0.00012865792,0.000058506164,0.00065887714,0.000034924902,0.01642624,0.054171905,0.835327,0.09259758,0.000059180355],"about_ca_topic_score_codex":0.00003712661,"about_ca_topic_score_gemma":0.00006551816,"teacher_disagreement_score":0.008767046,"about_ca_system_score_codex":0.00075651146,"about_ca_system_score_gemma":0.00060973223,"threshold_uncertainty_score":0.029328644},"labels":[],"label_agreement":null},{"id":"W179872536","doi":"10.1007/978-3-319-02432-5_12","title":"Document Listing on Versioned Documents","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Waterloo","funders":"","keywords":"Computer science; Substring; Listing (finance); Information retrieval; Index (typography); Ranking (information retrieval); Phrase; Space (punctuation); World Wide Web; Data structure; Natural language processing; Programming language","score_opus":0.01457403965835758,"score_gpt":0.2497860624078519,"score_spread":0.23521202274949432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179872536","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013779344,0.0072529707,0.04093955,0.0025122794,0.015883747,0.0013316923,0.0874171,0.024825132,0.8184596],"genre_scores_gemma":[0.0027002045,0.005391524,0.013933417,0.0005321964,0.0012047616,0.00035836585,0.06215421,0.007948845,0.9057765],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988418,0.00011254885,0.00014307459,0.00017773839,0.0006377132,0.00008703514],"domain_scores_gemma":[0.9948249,0.0008139428,0.0002559727,0.0011248909,0.0026257774,0.00035467185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011969074,0.0016647356,0.0018222566,0.008365385,0.0010441522,0.008012153,0.002256431,0.001670084,0.7433828],"category_scores_gemma":[0.007964172,0.0011131497,0.0009402587,0.011057425,0.0004721462,0.0053939456,0.0015077731,0.0022679274,0.6681035],"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.000036833582,0.000060801216,0.00004989162,0.0005502199,0.000008079028,0.000053807587,0.00002007177,0.00028896084,0.0013229095,0.0040533836,0.84721744,0.14633758],"study_design_scores_gemma":[0.000015149215,0.00002569802,0.00016877872,0.0002088108,0.000008284572,0.0001433315,0.000014266851,0.00026101898,0.0007851941,0.0017847704,0.99656796,0.000016682916],"about_ca_topic_score_codex":0.0022055905,"about_ca_topic_score_gemma":0.0020137872,"teacher_disagreement_score":0.7433828,"about_ca_system_score_codex":0.0011719364,"about_ca_system_score_gemma":0.0020765471,"threshold_uncertainty_score":0.36603326},"labels":[],"label_agreement":null},{"id":"W1799095500","doi":"10.1007/978-3-642-04146-4_16","title":"Integration of Contextual Information in Online Handwriting Representation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cursive; Artificial intelligence; Handwriting recognition; Robustness (evolution); Optimal distinctiveness theory; Pattern recognition (psychology); Intelligent character recognition; Handwriting; Classifier (UML); Representation (politics); Scripting language; Support vector machine; Machine learning; Character recognition; Feature extraction","score_opus":0.023769106847008923,"score_gpt":0.2828602374181504,"score_spread":0.25909113057114147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799095500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062735796,0.0026749105,0.9236107,0.00012084168,0.00024163922,0.00007828003,0.00041934938,0.0057089143,0.004409572],"genre_scores_gemma":[0.5473805,0.002170831,0.4413476,0.00011563634,0.00028795487,0.000119530596,0.0013293228,0.00067670597,0.0065719704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.000036486683,0.0000215535,0.00008472251,0.000092286624,0.000043405526],"domain_scores_gemma":[0.99956506,0.0001277439,0.00003983927,0.00010821497,0.00012887089,0.000030198482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002494396,0.00066014664,0.00075865124,0.0009280284,0.00028389553,0.00095543097,0.00057899253,0.0004588088,0.0046475446],"category_scores_gemma":[0.0010549563,0.000349199,0.00041475752,0.0011893094,0.00018788213,0.0013865406,0.00083133375,0.00047604193,0.0017089638],"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.00034804663,0.00010643113,0.0004727204,0.00015139687,0.000028401144,0.000090779016,0.00004110551,0.011027805,0.09154383,0.0010347089,0.0021233493,0.89303136],"study_design_scores_gemma":[0.000038664413,0.0004226583,0.006026237,0.000083591476,0.00018179817,0.00044656478,0.00011866431,0.7947184,0.18024358,0.0046405997,0.013019713,0.00005943304],"about_ca_topic_score_codex":0.0018062348,"about_ca_topic_score_gemma":0.0038661798,"teacher_disagreement_score":0.0046475446,"about_ca_system_score_codex":0.00015951201,"about_ca_system_score_gemma":0.00040218895,"threshold_uncertainty_score":0.015547633},"labels":[],"label_agreement":null},{"id":"W1799546","doi":"10.1007/978-3-319-12436-0_19","title":"Fixed-Priority Scheduling Policies and Their Non-utilization Bounds","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dynamic priority scheduling; Earliest deadline first scheduling; Rate-monotonic scheduling; Scheduling (production processes); Fair-share scheduling; Mathematical optimization; Deadline-monotonic scheduling; Distributed computing; Two-level scheduling; Monotonic function; Mathematics; Computer network; Quality of service","score_opus":0.021163516601045665,"score_gpt":0.2575855369553231,"score_spread":0.23642202035427745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035042368,0.030463275,0.8490873,0.0021348626,0.0009765214,0.00012289656,0.0003981951,0.0009871371,0.08078742],"genre_scores_gemma":[0.6976079,0.022106119,0.24949516,0.00091667374,0.0014698474,0.0005378537,0.000561213,0.0009755754,0.026329603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950931,0.0012465483,0.0002461925,0.00063558493,0.0018077283,0.00097095204],"domain_scores_gemma":[0.97090673,0.022972282,0.0013019546,0.002227969,0.0018397362,0.0007513095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064503304,0.0023992816,0.0022060752,0.002765383,0.0018431373,0.005966063,0.00510935,0.0020211933,0.007683981],"category_scores_gemma":[0.0348411,0.0015966304,0.0011816769,0.0045704897,0.0025108748,0.0068607135,0.0029076585,0.0067081894,0.0015448027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003231774,0.00015204288,0.00030411722,0.00030972436,0.000063267544,0.000109942666,0.0002366616,0.090806924,0.001578178,0.81720394,0.0063237627,0.08258824],"study_design_scores_gemma":[0.0000309039,0.00008006166,0.00033858352,0.00021012334,0.000050480056,0.000213158,0.00006476503,0.377102,0.0014782614,0.6135481,0.006844061,0.000039511313],"about_ca_topic_score_codex":0.0026147098,"about_ca_topic_score_gemma":0.0014510916,"teacher_disagreement_score":0.007683981,"about_ca_system_score_codex":0.0046543544,"about_ca_system_score_gemma":0.002737671,"threshold_uncertainty_score":0.03411299},"labels":[],"label_agreement":null},{"id":"W1800402330","doi":"10.1007/3-540-40922-x_19","title":"Model Reductions and a Case Study","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Computer science; Reduction (mathematics); Property (philosophy); Dependency graph; Algorithm; Graph; Dependency (UML); Model checking; Construct (python library); Theoretical computer science; State (computer science); Set (abstract data type); State variable; Artificial intelligence; Mathematics; Programming language","score_opus":0.04993290233842406,"score_gpt":0.30895240832538107,"score_spread":0.259019505986957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800402330","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26092878,0.0023859635,0.31556803,0.011381009,0.0003551317,0.00073739927,0.0005350855,0.0016249309,0.40648374],"genre_scores_gemma":[0.8627548,0.0014391482,0.083911665,0.0005704437,0.000079639634,0.0004447788,0.00038236944,0.00041633027,0.050000925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971861,0.0017021593,0.000065882436,0.0001506842,0.00064455625,0.0002506026],"domain_scores_gemma":[0.9959831,0.0029678508,0.00010151252,0.00063893205,0.00022143911,0.00008715231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021553277,0.00070067105,0.000578116,0.00091190793,0.0021908279,0.0023329218,0.001887132,0.0028217286,0.010111228],"category_scores_gemma":[0.0076976717,0.00034784584,0.001271891,0.001205824,0.0025699842,0.0029688978,0.0022896654,0.0029530704,0.0013603651],"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.00024332083,0.0007926242,0.0006626439,0.00020018424,0.000023329023,0.0036384137,0.0017898835,0.01895103,0.0021862108,0.91496295,0.011686247,0.04486322],"study_design_scores_gemma":[0.0002483758,0.00053596246,0.0008901417,0.00017791786,0.00011535511,0.004209569,0.0045962525,0.091742866,0.011342972,0.7347636,0.15130739,0.00006955254],"about_ca_topic_score_codex":0.0032333988,"about_ca_topic_score_gemma":0.0039858124,"teacher_disagreement_score":0.010111228,"about_ca_system_score_codex":0.0012698137,"about_ca_system_score_gemma":0.000969309,"threshold_uncertainty_score":0.033825457},"labels":[],"label_agreement":null},{"id":"W1800643017","doi":"10.1007/3-540-45151-x_22","title":"A Non-Euclidean Model for Web Retrieval","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Information retrieval; World Wide Web","score_opus":0.021612683039276735,"score_gpt":0.25353840819541384,"score_spread":0.2319257251561371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800643017","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.018646004,0.0016986576,0.9701085,0.0012287885,0.0001249694,0.00005884083,0.0005356811,0.00046336395,0.007135239],"genre_scores_gemma":[0.6560221,0.0039878716,0.26494977,0.00079525844,0.0007658896,0.00047336397,0.0021977755,0.0006009943,0.07020701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978125,0.000982302,0.0001335065,0.00044100216,0.00041330844,0.0002173422],"domain_scores_gemma":[0.99618214,0.002141696,0.0003287474,0.0006491637,0.00053603505,0.00016223505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025209745,0.0009624308,0.0018142194,0.0016716708,0.0008801906,0.0033012158,0.0055746306,0.0029962626,0.0068914783],"category_scores_gemma":[0.0100714285,0.0008827729,0.0014975423,0.0027421124,0.0018938853,0.0074777273,0.0022325113,0.0025685227,0.0038105838],"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.00019291481,0.000112109214,0.000921703,0.00022799666,0.00010410259,0.00016793002,0.00019590792,0.27141833,0.0014190455,0.66909146,0.007405895,0.048742548],"study_design_scores_gemma":[0.000016910117,0.000030278052,0.00019778332,0.0000110854,0.000019385085,0.00008121115,0.000020948286,0.806236,0.0001597573,0.19120722,0.0019984306,0.000020916785],"about_ca_topic_score_codex":0.0076609435,"about_ca_topic_score_gemma":0.005791523,"teacher_disagreement_score":0.0076609435,"about_ca_system_score_codex":0.0020676218,"about_ca_system_score_gemma":0.0009355396,"threshold_uncertainty_score":0.023054302},"labels":[],"label_agreement":null},{"id":"W1801457577","doi":"10.1007/978-3-642-27576-0_13","title":"Revisiting the Computational Practicality of Private Information Retrieval","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Private information retrieval; Server; Scheme (mathematics); Confidentiality; Bandwidth (computing); Computation; Computer network; Theoretical computer science; Algorithm; Computer security; Mathematics","score_opus":0.018630492017380238,"score_gpt":0.2627758982982837,"score_spread":0.24414540628090345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801457577","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.03063702,0.013060599,0.7361481,0.052673895,0.0017014343,0.00017088046,0.00049193046,0.0007043824,0.16441171],"genre_scores_gemma":[0.72057176,0.012524178,0.21507697,0.00596736,0.008290676,0.00030531196,0.00068620086,0.0010607137,0.03551679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9839544,0.0072749113,0.0007015961,0.0018876595,0.005294486,0.00088691997],"domain_scores_gemma":[0.9049811,0.074087955,0.0012021227,0.015787588,0.0034455338,0.0004957437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011948048,0.0011986272,0.0021433707,0.0025983355,0.0025802942,0.010742852,0.0050259717,0.0043571168,0.020088444],"category_scores_gemma":[0.08152576,0.0015206495,0.0019467098,0.004207291,0.019000031,0.049561396,0.009051649,0.010102115,0.005063331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052947515,0.000022786171,0.00010963512,0.00012571563,0.0000093666085,0.000036975132,0.00013770958,0.0023209136,0.00023257748,0.97434175,0.003667707,0.01894189],"study_design_scores_gemma":[0.00001278326,0.000009799593,0.000042471835,0.000030690288,0.0000051820293,0.00006513816,0.00003214861,0.007597731,0.00026993486,0.9869473,0.0049771233,0.000009641603],"about_ca_topic_score_codex":0.0020215365,"about_ca_topic_score_gemma":0.0012769792,"teacher_disagreement_score":0.020088444,"about_ca_system_score_codex":0.0039879386,"about_ca_system_score_gemma":0.0028334619,"threshold_uncertainty_score":0.06720251},"labels":[],"label_agreement":null},{"id":"W1801772197","doi":"10.1007/978-3-540-72665-4_5","title":"R-FRTDP: A Real-Time DP Algorithm with Tight Bounds for a Stochastic Resource Allocation Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Université Laval","funders":"","keywords":"Computer science; Markov decision process; Mathematical optimization; Resource allocation; Heuristic; Context (archaeology); Task (project management); Stochastic programming; Dynamic programming; Resource (disambiguation); Markov process; Algorithm; Artificial intelligence; Mathematics","score_opus":0.014734208176855099,"score_gpt":0.24645569856153343,"score_spread":0.23172149038467832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801772197","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.0031073492,0.0002464076,0.9919859,0.00026210875,0.0001297275,0.00007683329,0.00009243344,0.0010997772,0.0029994168],"genre_scores_gemma":[0.11917711,0.00024990295,0.8747909,0.00032693858,0.00012788674,0.00039057338,0.00031310137,0.00052626035,0.0040974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859565,0.0004119841,0.00008434485,0.00032688896,0.00034474104,0.00023631423],"domain_scores_gemma":[0.99824846,0.0010899758,0.000106894775,0.00020032012,0.00021708492,0.00013735147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024691902,0.0015379471,0.0022518332,0.0009067666,0.0006215785,0.0018368555,0.003263149,0.0030512097,0.007910232],"category_scores_gemma":[0.00730774,0.0010809617,0.0011984697,0.001283553,0.001039363,0.0022311956,0.0026981735,0.0036162108,0.0015621508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035370758,0.00023464518,0.0001946472,0.00025685955,0.00007813994,0.00009352171,0.00007709727,0.7282903,0.002679682,0.04804713,0.014280319,0.20541395],"study_design_scores_gemma":[0.000061250685,0.00002743813,0.000021838563,0.000009276,0.000007663776,0.000022527198,0.000005645323,0.9874578,0.0004062571,0.01057623,0.0013977147,0.000006432041],"about_ca_topic_score_codex":0.0052438015,"about_ca_topic_score_gemma":0.005504174,"teacher_disagreement_score":0.007910232,"about_ca_system_score_codex":0.0016651786,"about_ca_system_score_gemma":0.0032082302,"threshold_uncertainty_score":0.026462317},"labels":[],"label_agreement":null},{"id":"W1802225118","doi":"10.1007/3-540-47728-4_24","title":"Investigations into the Per-Hop Behaviors of Diffserv Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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":"Computer science; Hop (telecommunications); Computer network","score_opus":0.012275372759223342,"score_gpt":0.2267518450688806,"score_spread":0.21447647230965727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802225118","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.77580965,0.0043097753,0.17957965,0.0008532562,0.00006977256,0.00006535613,0.00025372545,0.00041286158,0.038645983],"genre_scores_gemma":[0.9874653,0.0019084555,0.007493299,0.000055892488,0.00004988786,0.000017735081,0.00009368419,0.000047754653,0.0028678724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.00006965253,0.000008784552,0.00003611183,0.0001394282,0.000038212438],"domain_scores_gemma":[0.9962914,0.0026559064,0.00017809219,0.00032479133,0.00044507466,0.000104762206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007216491,0.00034086275,0.00035963464,0.0008224338,0.00034545487,0.0007099819,0.0007941153,0.0004957079,0.0014737647],"category_scores_gemma":[0.005328643,0.00045418623,0.00020491837,0.0008161806,0.0006003438,0.0021415723,0.00030078378,0.0011247124,0.00019505942],"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.00045223057,0.0005677659,0.01316323,0.0004155128,0.0000794788,0.00048339445,0.0011557024,0.34681216,0.085978724,0.4274243,0.0034551127,0.12001237],"study_design_scores_gemma":[0.000008864183,0.00008145297,0.0045331134,0.000033079486,0.000015414376,0.0003039671,0.00017839318,0.91404593,0.009018314,0.069582894,0.0021787358,0.000019779922],"about_ca_topic_score_codex":0.00072153215,"about_ca_topic_score_gemma":0.00046768252,"teacher_disagreement_score":0.0014737647,"about_ca_system_score_codex":0.00060618,"about_ca_system_score_gemma":0.00025004058,"threshold_uncertainty_score":0.004930198},"labels":[],"label_agreement":null},{"id":"W1802230","doi":"10.1007/978-3-642-33518-1_22","title":"An Integrated Runtime Scheduler for MPI","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Runtime system; Message Passing Interface; Code (set theory); Scheduling (production processes); Middleware (distributed applications); Operating system; Message passing; Distributed computing; Programming language; Set (abstract data type)","score_opus":0.02088466653682655,"score_gpt":0.2741662488557546,"score_spread":0.25328158231892806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016644321,0.0009757703,0.8403405,0.0002918099,0.000831377,0.00021991998,0.0012757054,0.11524678,0.02417388],"genre_scores_gemma":[0.13507135,0.00074837636,0.7910408,0.00042884157,0.00047274356,0.0005186121,0.005522938,0.016032543,0.05016377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.000054130538,0.000033269633,0.00008247516,0.00025156394,0.00008579398],"domain_scores_gemma":[0.99947184,0.00007423095,0.000022448097,0.00018950511,0.00016734313,0.00007463727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057707384,0.0009907122,0.00107341,0.00067394733,0.0009776228,0.0012452507,0.0033194718,0.0006893783,0.014900756],"category_scores_gemma":[0.0012311565,0.0009130764,0.0008046658,0.0012044355,0.00036582412,0.0011159346,0.0016204363,0.002161723,0.008602935],"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.0017684427,0.0005220831,0.0016011464,0.00053775165,0.00032686171,0.00037312874,0.00033758205,0.070550114,0.07352867,0.04542507,0.19292986,0.6120993],"study_design_scores_gemma":[0.00065656065,0.00034175607,0.0019588703,0.000056401932,0.00027457872,0.00027128326,0.00006434635,0.6742888,0.06260932,0.04078991,0.21851294,0.0001751696],"about_ca_topic_score_codex":0.0039662845,"about_ca_topic_score_gemma":0.0058665425,"teacher_disagreement_score":0.014900756,"about_ca_system_score_codex":0.0006576189,"about_ca_system_score_gemma":0.0017688189,"threshold_uncertainty_score":0.04984796},"labels":[],"label_agreement":null},{"id":"W1802428296","doi":"10.1007/3-540-36181-2_18","title":"Tracking through Optical Snow","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Snow; Observer (physics); Computer vision; Optical flow; Computer science; Artificial intelligence; Motion (physics); Classification of discontinuities; Tracking (education); Motion field; Object (grammar); Computer graphics (images); Geology; Image (mathematics); Mathematics; Physics","score_opus":0.03205818890348092,"score_gpt":0.28566153065411143,"score_spread":0.2536033417506305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802428296","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.042892706,0.0010441866,0.9353565,0.00021750257,0.00021738437,0.000045109737,0.0001678087,0.0018313535,0.018227497],"genre_scores_gemma":[0.5211146,0.0021423341,0.4394824,0.00024649545,0.00013803413,0.00006047392,0.00083371555,0.00043694384,0.03554506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978286,0.000019541882,0.0000058252076,0.00008907494,0.000067463836,0.000035180154],"domain_scores_gemma":[0.99983585,0.000041277966,0.000022990846,0.000041595762,0.00004117115,0.00001709586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027939575,0.00063110807,0.00063000317,0.0011299622,0.00075559784,0.00132561,0.000722711,0.000932784,0.0030353882],"category_scores_gemma":[0.0005609449,0.0006332346,0.00051926303,0.0012955527,0.00048779344,0.0018196176,0.0016550575,0.00062641053,0.0014748921],"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.00030612721,0.00007317899,0.0028708817,0.00017927922,0.000090469366,0.00024345308,0.00036702032,0.08200843,0.14930238,0.025811313,0.010479463,0.72826797],"study_design_scores_gemma":[0.000025951687,0.00013864356,0.0031468114,0.000053307274,0.00005707512,0.0006609267,0.00017967923,0.86102265,0.07571168,0.03042232,0.028531866,0.00004904976],"about_ca_topic_score_codex":0.0040195603,"about_ca_topic_score_gemma":0.004558617,"teacher_disagreement_score":0.0040195603,"about_ca_system_score_codex":0.00047853374,"about_ca_system_score_gemma":0.0005135158,"threshold_uncertainty_score":0.010154426},"labels":[],"label_agreement":null},{"id":"W1802659144","doi":"10.1007/978-3-540-72606-7_58","title":"Optimal Rate Allocation in Overlay Content Distribution","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Overlay; Mathematical optimization; Node (physics); Convergence (economics); Rate of convergence; Overlay network; Optimal allocation; Linear programming; Content distribution; Optimization problem; Distributed computing; Algorithm; Computer network; Mathematics; The Internet","score_opus":0.03453425704479631,"score_gpt":0.2613523442078247,"score_spread":0.2268180871630284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802659144","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.050075177,0.00081109867,0.94061166,0.00036164976,0.000078751735,0.000109533,0.00009394747,0.00043837356,0.0074198036],"genre_scores_gemma":[0.84512836,0.0010290351,0.14630145,0.00010318834,0.00021096141,0.00017956902,0.00008779599,0.00020912892,0.0067505306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980573,0.0008792888,0.000071719514,0.0002151244,0.00044735192,0.00032919634],"domain_scores_gemma":[0.9947476,0.0041685477,0.00019252939,0.00029830626,0.00041559307,0.00017731496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002663004,0.0009792878,0.0024192054,0.0010105574,0.0007841248,0.00200054,0.0022948834,0.001295222,0.0030319055],"category_scores_gemma":[0.012500596,0.0009191157,0.00045380497,0.0021498809,0.001492676,0.0023821453,0.0022102399,0.0011862315,0.00053456315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035164558,0.00012403773,0.00037971872,0.0001731873,0.00003561748,0.000072072624,0.00014878907,0.8207219,0.0042871176,0.09149675,0.003328802,0.078880206],"study_design_scores_gemma":[0.00001830612,0.000022334909,0.00007176773,0.00000810533,0.000009483351,0.000028707898,0.000019033228,0.97737324,0.0006421253,0.021464065,0.0003347656,0.000008064465],"about_ca_topic_score_codex":0.0029050577,"about_ca_topic_score_gemma":0.001974381,"teacher_disagreement_score":0.0030319055,"about_ca_system_score_codex":0.0024692218,"about_ca_system_score_gemma":0.0012952652,"threshold_uncertainty_score":0.017915606},"labels":[],"label_agreement":null},{"id":"W1803070299","doi":"10.1007/11533719_8","title":"Genome Rearrangements with Partially Ordered Chromosomes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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 Ottawa","funders":"","keywords":"Directed acyclic graph; Genome; Computer science; Graph; Directed graph; Chromosome; Computational biology; Biology; Genetics; Combinatorics; Algorithm; Mathematics; Theoretical computer science; Gene","score_opus":0.010500122973351131,"score_gpt":0.22572770314688861,"score_spread":0.2152275801735375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803070299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072925285,0.0007386342,0.91337425,0.00023674814,0.000088107125,0.00007340069,0.0003382017,0.0012016929,0.011023669],"genre_scores_gemma":[0.38773414,0.0010428879,0.5963828,0.00010582881,0.00008983074,0.00018310446,0.0019489742,0.00047850047,0.012034011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967754,0.00009684031,0.00001702781,0.00009559478,0.00007786193,0.000035191042],"domain_scores_gemma":[0.99910873,0.00063369714,0.00005655347,0.00013029714,0.000041477088,0.000029220319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050407136,0.0004138732,0.00052554527,0.00068028754,0.00051936356,0.0010883616,0.0009810746,0.00054195063,0.004959602],"category_scores_gemma":[0.0022603914,0.000575249,0.0006880911,0.0013632813,0.00075235346,0.0017827343,0.0009999417,0.0007453614,0.00084766385],"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.00039195523,0.0000475886,0.0013597582,0.00036462906,0.000046504036,0.00038499356,0.0004319968,0.24601735,0.023042262,0.4020094,0.005982708,0.3199209],"study_design_scores_gemma":[0.000057281773,0.00006530028,0.0006824462,0.000045797413,0.0000327398,0.00033749142,0.000114115224,0.43182388,0.013409796,0.5373249,0.016077977,0.000028327559],"about_ca_topic_score_codex":0.0005688385,"about_ca_topic_score_gemma":0.0010606176,"teacher_disagreement_score":0.004959602,"about_ca_system_score_codex":0.0004096762,"about_ca_system_score_gemma":0.00026400492,"threshold_uncertainty_score":0.016591549},"labels":[],"label_agreement":null},{"id":"W1803408867","doi":"10.1007/3-540-47922-8_20","title":"Using Agent Replication to Enhance Reliability and Availability of Multi-agent Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Saskatchewan","funders":"","keywords":"Dependability; Replication (statistics); Software deployment; Computer science; Reliability (semiconductor); Distributed computing; Mainstream; Multi-agent system; Software engineering; Artificial intelligence","score_opus":0.04064489282384873,"score_gpt":0.29467508070047665,"score_spread":0.2540301878766279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803408867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123308465,0.002583779,0.8588205,0.0004928069,0.0005757561,0.00010479324,0.00003379438,0.0034862643,0.010593882],"genre_scores_gemma":[0.805527,0.00080045074,0.18918775,0.000070287715,0.0002584731,0.00006602428,0.000042586467,0.00020064336,0.003846811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.0002019508,0.00004190722,0.00007959421,0.00018996905,0.000057599464],"domain_scores_gemma":[0.9964043,0.0018218938,0.00023406243,0.0009444148,0.0004612641,0.00013408082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012989505,0.0004937332,0.00060976594,0.00051612046,0.0006627533,0.0009109431,0.0011631637,0.00069491385,0.0018437955],"category_scores_gemma":[0.0050920458,0.00039922624,0.00042341303,0.0004718769,0.00040031882,0.002163973,0.0011284369,0.0010869587,0.0004831041],"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.0007914283,0.0004265498,0.001872124,0.0005528755,0.00017369009,0.0007889269,0.00079938746,0.21540502,0.24580449,0.045769323,0.005353436,0.4822628],"study_design_scores_gemma":[0.00016578639,0.00048692166,0.0009352716,0.000042211774,0.00019437406,0.0007982343,0.00011063308,0.8594991,0.074791975,0.045889262,0.017028404,0.00005774873],"about_ca_topic_score_codex":0.00044951658,"about_ca_topic_score_gemma":0.00070435094,"teacher_disagreement_score":0.0018437955,"about_ca_system_score_codex":0.00028195235,"about_ca_system_score_gemma":0.00037303753,"threshold_uncertainty_score":0.0068695545},"labels":[],"label_agreement":null},{"id":"W18036528","doi":"10.1007/978-3-642-23544-3_19","title":"Frequent Pattern Mining from Time-Fading Streams of Uncertain Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":53,"is_retracted":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":"Data stream mining; Computer science; STREAMS; Fading; Sliding window protocol; Data mining; Data stream; Real-time computing; Window (computing); Computer network; Telecommunications; Channel (broadcasting); World Wide Web","score_opus":0.050093446914141505,"score_gpt":0.2686092116487376,"score_spread":0.21851576473459608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18036528","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.11209912,0.0033588083,0.8810353,0.0004759872,0.00013934105,0.00011239987,0.0014161348,0.0005983444,0.00076464494],"genre_scores_gemma":[0.64047176,0.0034284054,0.3497498,0.000092011614,0.00037247298,0.00015013617,0.0041876207,0.00007541808,0.0014723487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985948,0.00018854023,0.00019299035,0.00033076687,0.00058463024,0.00010822805],"domain_scores_gemma":[0.9941841,0.0042503793,0.0005406101,0.00046186976,0.00045884005,0.00010421999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413225,0.0007158731,0.0012458024,0.0019856167,0.00046392396,0.001372104,0.0015728837,0.00096086774,0.00065798877],"category_scores_gemma":[0.010197198,0.00041817655,0.0010809788,0.0034291137,0.0003982949,0.0025559233,0.0009240672,0.0012161256,0.0003477681],"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.00096569303,0.00023320234,0.020110374,0.0010192036,0.00044978756,0.0031636506,0.00061122444,0.21004127,0.014081036,0.012309768,0.0043618553,0.7326529],"study_design_scores_gemma":[0.00002628066,0.00015565337,0.003921759,0.000080289545,0.0001203435,0.0016705103,0.0002126454,0.9527813,0.0059665986,0.031994592,0.0030350257,0.000035019617],"about_ca_topic_score_codex":0.0008645226,"about_ca_topic_score_gemma":0.0009688354,"teacher_disagreement_score":0.0019856167,"about_ca_system_score_codex":0.00034416004,"about_ca_system_score_gemma":0.00038190835,"threshold_uncertainty_score":0.0074739456},"labels":[],"label_agreement":null},{"id":"W1804029757","doi":"10.1007/978-3-642-20152-3_27","title":"Indexing for Vector Projections","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Search engine indexing; Computer science; Artificial intelligence; Information retrieval","score_opus":0.036854241327270804,"score_gpt":0.25773242166584637,"score_spread":0.22087818033857556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804029757","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.007153097,0.0044713877,0.89465296,0.00064260326,0.0012705477,0.00021849028,0.0031638618,0.009347883,0.07907913],"genre_scores_gemma":[0.13461787,0.0065321457,0.724919,0.0006767289,0.0018063838,0.000831151,0.020384496,0.004164924,0.106067255],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981488,0.00029836778,0.00020891675,0.0003454398,0.0008216629,0.000176886],"domain_scores_gemma":[0.9986071,0.0002432652,0.00007438375,0.0006673395,0.0003359042,0.00007197224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010021323,0.0010069276,0.0016191485,0.0027699657,0.0014415797,0.005051215,0.0016006945,0.0008410476,0.038287643],"category_scores_gemma":[0.0038744558,0.0007258737,0.0012991435,0.0061381124,0.0012058963,0.0069945655,0.00341929,0.0022775203,0.02420191],"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.000106061016,0.00008228536,0.00022647786,0.0002680194,0.0000276046,0.000064398984,0.00016948784,0.0018758735,0.0033876484,0.4237815,0.06802516,0.50198543],"study_design_scores_gemma":[0.00002989115,0.00007837596,0.00041344124,0.00013520653,0.000034832898,0.000552185,0.00012472545,0.029894123,0.006467674,0.8017939,0.16041899,0.000056724894],"about_ca_topic_score_codex":0.0009907099,"about_ca_topic_score_gemma":0.0008469158,"teacher_disagreement_score":0.038287643,"about_ca_system_score_codex":0.00090134755,"about_ca_system_score_gemma":0.0011564961,"threshold_uncertainty_score":0.1280849},"labels":[],"label_agreement":null},{"id":"W1804148672","doi":"10.1007/978-3-540-24677-0_101","title":"Comparison of Different Coordination Strategies for the RoboCupRescue Simulation","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Standardization; Distributed computing; Artificial intelligence","score_opus":0.03958897799533128,"score_gpt":0.323238277333952,"score_spread":0.2836492993386207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804148672","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.6523142,0.0023941586,0.25718218,0.0007882642,0.0003669127,0.0005059989,0.00068974745,0.0025595147,0.083199],"genre_scores_gemma":[0.9661846,0.0003993754,0.029810358,0.000051212515,0.000010751734,0.00020624655,0.0002917811,0.00022327276,0.0028224054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.00058644265,0.000055490687,0.00008377429,0.00022994637,0.00016698908],"domain_scores_gemma":[0.9959078,0.0028654372,0.00011222734,0.00038550142,0.00047025894,0.00025879047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019175464,0.00085058186,0.0011213634,0.0013681737,0.00079984084,0.0012420677,0.0015699638,0.0012414171,0.0063909604],"category_scores_gemma":[0.006915827,0.00036033368,0.00053227216,0.001064238,0.00049449597,0.001253726,0.00076925854,0.00069888216,0.00060904835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001138329,0.00030476763,0.0009829457,0.00027300805,0.0000995457,0.00005491436,0.00014592457,0.93152994,0.0020120172,0.01412162,0.001608876,0.047728106],"study_design_scores_gemma":[0.0001508119,0.00034332977,0.00051398814,0.000028114911,0.000051110976,0.000018857987,0.00010420952,0.9921389,0.002212345,0.0030115172,0.0014064014,0.000020318252],"about_ca_topic_score_codex":0.008513259,"about_ca_topic_score_gemma":0.009051731,"teacher_disagreement_score":0.008513259,"about_ca_system_score_codex":0.0012246461,"about_ca_system_score_gemma":0.0011155896,"threshold_uncertainty_score":0.021379888},"labels":[],"label_agreement":null},{"id":"W1804227813","doi":"10.1007/3-540-45049-1_50","title":"Building Logistics Networks Using Model-Based Reasoning Techniques","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Advice (programming); Artificial intelligence; Software engineering; Operations research; Programming language","score_opus":0.025247805678886005,"score_gpt":0.2667599703451272,"score_spread":0.2415121646662412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804227813","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.0066269883,0.00019762806,0.9879921,0.00014048626,0.000026690375,0.00011472093,0.00031421863,0.0008639274,0.0037232467],"genre_scores_gemma":[0.09370922,0.0005777285,0.9022719,0.00005325419,0.00001768854,0.00019557195,0.00083264813,0.00015597293,0.0021859857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.00023662302,0.00007047688,0.00017130692,0.00019819071,0.000060528913],"domain_scores_gemma":[0.9985411,0.0009983685,0.000110331355,0.000207341,0.00010055715,0.000042297743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012382464,0.001819432,0.0014531099,0.0023281856,0.0012325223,0.0028454915,0.00261618,0.0014474688,0.008657353],"category_scores_gemma":[0.0044539664,0.0022320237,0.003572338,0.002277867,0.0010535341,0.0053758235,0.002297949,0.0018766839,0.0013052095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003739422,0.000058654074,0.0003074778,0.00019149136,0.000098828925,0.00013819938,0.00009962448,0.9076859,0.0009524207,0.030137163,0.0012810637,0.05901182],"study_design_scores_gemma":[0.000020445637,0.000011998835,0.000044605833,0.000035080204,0.00006146518,0.000041113435,0.000044140048,0.93836725,0.0014134377,0.056397725,0.003545799,0.00001693765],"about_ca_topic_score_codex":0.013069401,"about_ca_topic_score_gemma":0.025883298,"teacher_disagreement_score":0.013069401,"about_ca_system_score_codex":0.0014397674,"about_ca_system_score_gemma":0.0014838299,"threshold_uncertainty_score":0.028961778},"labels":[],"label_agreement":null},{"id":"W180436480","doi":"10.1007/978-3-642-31368-4_6","title":"Vehicular Ad-hoc Networks(VANETs): Capabilities, Challenges in Context-Aware Processing and Communication Gateway","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Vehicular ad hoc network; Intelligent transportation system; Wireless ad hoc network; Gateway (web page); Context (archaeology); Computer network; Default gateway; Vehicular communication systems; Telecommunications; World Wide Web; Engineering; Transport engineering; Wireless","score_opus":0.017629641341999736,"score_gpt":0.21560033006828846,"score_spread":0.19797068872628873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180436480","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008033435,0.4413911,0.2825748,0.012995085,0.008381048,0.00012587066,0.00042882859,0.00099682,0.24507307],"genre_scores_gemma":[0.12749697,0.5396956,0.15751907,0.002903005,0.005118284,0.00016691179,0.0009252565,0.00040619355,0.16576862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960536,0.000063777225,0.000032009135,0.00007115109,0.00019143344,0.00003630204],"domain_scores_gemma":[0.9995797,0.00020139635,0.000021284712,0.000051486833,0.00010627204,0.00003980317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066931924,0.00080639054,0.00066340767,0.0008109192,0.00046824437,0.0048714587,0.0011388916,0.0012544869,0.0041798893],"category_scores_gemma":[0.0011801707,0.0006276437,0.00036994176,0.002191884,0.0009348815,0.0077016577,0.0016286209,0.002362943,0.0027561884],"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.000042350082,0.000047526195,0.00030418608,0.0010255184,0.000023412977,0.00023042136,0.0004004984,0.0057897465,0.004439313,0.43485802,0.051117837,0.5017212],"study_design_scores_gemma":[0.00000511123,0.000051410487,0.00023939594,0.0006344193,0.000026597265,0.0008975521,0.00035663822,0.012736311,0.0018745791,0.15015042,0.83298874,0.000038823327],"about_ca_topic_score_codex":0.00088104646,"about_ca_topic_score_gemma":0.0011935533,"teacher_disagreement_score":0.0048714587,"about_ca_system_score_codex":0.00060466124,"about_ca_system_score_gemma":0.0007019435,"threshold_uncertainty_score":0.01398313},"labels":[],"label_agreement":null},{"id":"W1804630428","doi":"10.1007/978-3-642-15317-4_27","title":"Distributed Private-Key Generators for Identity-Based Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":95,"is_retracted":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":"Random oracle; Computer science; Encryption; Scheme (mathematics); Key escrow; Key (lock); Public-key cryptography; Computer security; Protocol (science); Cryptography; Cryptosystem; Identity (music); Theoretical computer science; Mathematics","score_opus":0.01318622371227801,"score_gpt":0.24636081348565808,"score_spread":0.23317458977338007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804630428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037829361,0.0014012164,0.97729355,0.0004841073,0.00032784106,0.00014263103,0.00009600475,0.0008736677,0.015598095],"genre_scores_gemma":[0.35113713,0.0024965296,0.5867282,0.00046122304,0.00079902465,0.00066146936,0.0007099569,0.00053157174,0.056474946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849236,0.00048161251,0.00008480511,0.00024767517,0.00056680373,0.00012675827],"domain_scores_gemma":[0.9985215,0.0005408625,0.000060950548,0.0006445079,0.00018176007,0.000050434213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015153165,0.0007484062,0.0009256217,0.00063830387,0.0010315935,0.0020535726,0.0017810176,0.0012064552,0.0075656143],"category_scores_gemma":[0.003456418,0.0004731739,0.0004895376,0.0012071651,0.0017764753,0.0041543455,0.0021193558,0.003164962,0.0041479156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114947834,0.00006123095,0.00009305138,0.00012557415,0.000014090467,0.00006894473,0.00015136824,0.005374488,0.004296604,0.8590645,0.008755765,0.12187939],"study_design_scores_gemma":[0.0000716095,0.000046801833,0.00005936925,0.00003814634,0.0000146083585,0.00022452009,0.000023324863,0.041394345,0.00838512,0.9073095,0.042411666,0.00002085673],"about_ca_topic_score_codex":0.000111468195,"about_ca_topic_score_gemma":0.0001551641,"teacher_disagreement_score":0.0075656143,"about_ca_system_score_codex":0.0010554197,"about_ca_system_score_gemma":0.0008574839,"threshold_uncertainty_score":0.025309503},"labels":[],"label_agreement":null},{"id":"W180499199","doi":"10.1007/978-3-642-45324-3_6","title":"Paradise Lost and Milton’s Associative Memory","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reading and Literacy Development","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Associative property; Cognitive science; Content-addressable memory; Composition (language); Poetry; Artificial intelligence; Literature; Art; Psychology; Artificial neural network","score_opus":0.01625374892418176,"score_gpt":0.277166736615742,"score_spread":0.26091298769156024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180499199","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.03702546,0.018106654,0.040985055,0.012855545,0.0026268726,0.00005315611,0.0002796583,0.00021436771,0.88785326],"genre_scores_gemma":[0.5000604,0.0062989383,0.010010138,0.001525425,0.00090578676,0.000056227145,0.00025436433,0.00012469162,0.48076403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997969,0.00003408008,0.000015281797,0.00006746408,0.00005976268,0.00002653582],"domain_scores_gemma":[0.99944085,0.00018981865,0.000032561966,0.00014886567,0.00013886117,0.0000490627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046881536,0.0005190713,0.00030034935,0.0011832995,0.0010004692,0.0034577306,0.0010184238,0.0011958805,0.027439626],"category_scores_gemma":[0.002979735,0.000268272,0.00031627194,0.00087566796,0.0034479944,0.010251417,0.0012369934,0.0023275886,0.0033737316],"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.00004376378,0.00002287963,0.00026271143,0.00006265585,0.000009870859,0.0001726733,0.0009411423,0.00019976925,0.00028103017,0.91668695,0.01961714,0.061699335],"study_design_scores_gemma":[0.000009206758,0.000016061389,0.00034387037,0.000043060663,0.000008288504,0.000499516,0.00027159043,0.00044656135,0.0004152036,0.8759222,0.1220126,0.000011741947],"about_ca_topic_score_codex":0.0019443951,"about_ca_topic_score_gemma":0.0022348121,"teacher_disagreement_score":0.027439626,"about_ca_system_score_codex":0.0013031301,"about_ca_system_score_gemma":0.00064497517,"threshold_uncertainty_score":0.09179467},"labels":[],"label_agreement":null},{"id":"W1805380992","doi":"10.1007/11417170_26","title":"A Lambda Calculus for Quantum Computation with Classical Control","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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 Ottawa","funders":"","keywords":"Church encoding; Dependent type; Simply typed lambda calculus; Lambda calculus; Typed lambda calculus; Type (biology); Lambda; System F; Affine transformation; Quantum","score_opus":0.01886700617306379,"score_gpt":0.2522603139138419,"score_spread":0.2333933077407781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1805380992","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.009370495,0.003100218,0.8664597,0.0034401235,0.0011031878,0.000091318725,0.0002598686,0.0011309346,0.115044236],"genre_scores_gemma":[0.50221306,0.004118309,0.39751354,0.0021310793,0.0025516169,0.00045607702,0.00035567448,0.0009391718,0.08972144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987348,0.00030475302,0.00006982925,0.0001924465,0.0005192663,0.00017895031],"domain_scores_gemma":[0.9991591,0.00034437582,0.000035823407,0.00020920622,0.00015788808,0.000093492075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018027759,0.00092468417,0.0013859642,0.0013690152,0.0032582886,0.0048492854,0.0022678669,0.002087422,0.009623603],"category_scores_gemma":[0.0027150554,0.000891314,0.0019487891,0.0016659945,0.006498824,0.008247846,0.0034581842,0.004729884,0.002226193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004324379,0.0000052349897,0.000008702152,0.0000110017145,0.000002154065,0.000011494533,0.00006087768,0.00034358317,0.0001423708,0.9963419,0.0008125125,0.0022558407],"study_design_scores_gemma":[0.000005628758,0.0000031159218,0.000009058518,0.0000073203464,0.0000035585651,0.000010681282,0.0000100360885,0.0022085325,0.00010724923,0.99170715,0.0059212646,0.000006449662],"about_ca_topic_score_codex":0.0024169337,"about_ca_topic_score_gemma":0.0021960824,"teacher_disagreement_score":0.009623603,"about_ca_system_score_codex":0.0023181944,"about_ca_system_score_gemma":0.0018548603,"threshold_uncertainty_score":0.032194197},"labels":[],"label_agreement":null},{"id":"W1805437643","doi":"10.1007/978-3-642-22450-8_14","title":"MobiID: A User-Centric and Social-Aware Reputation Based Incentive Scheme for Delay/Disruption Tolerant Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":52,"is_retracted":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":"Israeli Centers for Research Excellence","keywords":"Computer science; Incentive; Reputation; Scheme (mathematics); Distributed computing; Microeconomics","score_opus":0.02456562186060364,"score_gpt":0.2476865249307305,"score_spread":0.22312090307012689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1805437643","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.01893114,0.0014791036,0.95958924,0.00079369644,0.0006978533,0.00035947154,0.0004928819,0.0053762863,0.01228031],"genre_scores_gemma":[0.5584728,0.0014427231,0.3950845,0.00041742253,0.0003641998,0.00039231026,0.0009952041,0.0004688551,0.04236188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992686,0.00014854761,0.000048945734,0.000106029445,0.0003159706,0.000111912435],"domain_scores_gemma":[0.9990569,0.00021903802,0.00009444997,0.00024470018,0.00020794266,0.00017700218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014169499,0.0006140428,0.0009430642,0.00059749023,0.001029849,0.0016089611,0.0029401486,0.0010036774,0.0041165804],"category_scores_gemma":[0.0026487114,0.00036348854,0.0004606395,0.000775121,0.0005163402,0.0026770057,0.002504137,0.0015430995,0.0013268036],"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.0013751829,0.0005149549,0.0010770062,0.00064980105,0.00014497928,0.00038746223,0.00042734764,0.07908768,0.03830366,0.18929696,0.06839669,0.62033826],"study_design_scores_gemma":[0.00029029837,0.00051435665,0.001052477,0.00008817418,0.00012218097,0.00090373144,0.000099740406,0.75401413,0.023873853,0.078794405,0.14008392,0.00016282556],"about_ca_topic_score_codex":0.0012321504,"about_ca_topic_score_gemma":0.0017491366,"teacher_disagreement_score":0.0041165804,"about_ca_system_score_codex":0.0011144207,"about_ca_system_score_gemma":0.0014053201,"threshold_uncertainty_score":0.013771355},"labels":[],"label_agreement":null},{"id":"W1805455758","doi":"10.1007/3-540-47984-8_33","title":"An Empirical Study with Metrics for Object-Relational Databases","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Université de Montréal","funders":"","keywords":"Computer science; Relational database; Schema (genetic algorithms); Granularity; Relational calculus; Semi-structured model; Relational model; Empirical research; Information schema; Database schema; Table (database); Data mining; Database; Theoretical computer science; Database model; Information retrieval; Database design; Programming language; Mathematics; Statistics","score_opus":0.05567951139443925,"score_gpt":0.3146619773778031,"score_spread":0.25898246598336383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1805455758","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.96775514,0.0034810253,0.022150464,0.00094079913,0.00007117746,0.00018192916,0.0008078168,0.00007057043,0.004541065],"genre_scores_gemma":[0.9894154,0.00038133678,0.008656403,0.00007613949,0.000057796788,0.0001384928,0.00069155527,0.000049567927,0.0005333467],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.92963976,0.054504383,0.0038015773,0.0027609519,0.008220041,0.0010732417],"domain_scores_gemma":[0.34220782,0.60537565,0.014576291,0.014958768,0.020615447,0.0022660196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04285949,0.00078268844,0.00079152663,0.0036804006,0.0012988182,0.0031923328,0.0021381562,0.0013408259,0.0031562964],"category_scores_gemma":[0.40106875,0.00043192826,0.0011451805,0.010651671,0.0025515908,0.0114313075,0.0023728972,0.002203024,0.00058955257],"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.0018360039,0.002630897,0.842396,0.0009878321,0.00068185246,0.0003185466,0.009062243,0.0038276883,0.0008363829,0.030115781,0.0069344696,0.10037225],"study_design_scores_gemma":[0.00049718306,0.010476795,0.7504178,0.0009827487,0.002061263,0.0044225566,0.042639375,0.10053564,0.004563627,0.05738774,0.02578801,0.00022721394],"about_ca_topic_score_codex":0.0045395736,"about_ca_topic_score_gemma":0.0038710765,"teacher_disagreement_score":0.04285949,"about_ca_system_score_codex":0.0017966024,"about_ca_system_score_gemma":0.0012705481,"threshold_uncertainty_score":0.22666538},"labels":[],"label_agreement":null},{"id":"W1805834402","doi":"10.1007/978-3-540-73007-1_124","title":"Hybrid Unsupervised/Supervised Virtual Reality Spaces for Visualizing Cancer Databases: An Evolutionary Computation Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"National Research Council Canada","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Cluster analysis; Data mining; Knowledge extraction","score_opus":0.1003301340051558,"score_gpt":0.36815997418564805,"score_spread":0.2678298401804923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1805834402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019701952,0.00023384434,0.97745967,0.00016938602,0.00001843548,0.000044938544,0.00008245883,0.0005303209,0.0017590085],"genre_scores_gemma":[0.28621602,0.00028490194,0.71091235,0.000100899444,0.00002992925,0.00013858758,0.00017077854,0.0002109447,0.0019356046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955004,0.00017950508,0.000021428543,0.000077898636,0.0001262823,0.000044728946],"domain_scores_gemma":[0.99912375,0.00050011853,0.000068303976,0.000102305705,0.00015524364,0.000050377934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010812058,0.0009265239,0.0010638422,0.0014612137,0.00058522355,0.0025981204,0.002058626,0.0012807632,0.002168413],"category_scores_gemma":[0.0023230298,0.0006569032,0.0013745229,0.0014498885,0.00073607534,0.0016148692,0.0017801921,0.0008967966,0.00038018762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017041231,0.000117460586,0.0009154827,0.0001301993,0.00011669799,0.0001330716,0.00030302198,0.79787225,0.009396418,0.027153559,0.0019609989,0.1617305],"study_design_scores_gemma":[0.000004846044,0.000011371918,0.000086742955,0.000005403487,0.000006235155,0.00003349662,0.000027872007,0.9940276,0.0012177144,0.0041466127,0.0004248397,0.0000072639787],"about_ca_topic_score_codex":0.0033117302,"about_ca_topic_score_gemma":0.004645028,"teacher_disagreement_score":0.0033117302,"about_ca_system_score_codex":0.0007365254,"about_ca_system_score_gemma":0.00063483935,"threshold_uncertainty_score":0.007254064},"labels":[],"label_agreement":null},{"id":"W1806261122","doi":"10.1007/11876663_11","title":"Bayesian Student Models Based on Item to Item Knowledge Structures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Bayesian network; Bayesian probability; Bayesian statistics; Artificial intelligence; Machine learning; Item response theory; Variable-order Bayesian network; Independence (probability theory); Bayesian inference; Psychometrics; Mathematics; Statistics","score_opus":0.022647824482085528,"score_gpt":0.26833417748606553,"score_spread":0.24568635300398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806261122","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.129181,0.00062117283,0.8626777,0.00089976523,0.000095212345,0.0003064631,0.0009348527,0.0010776957,0.004206185],"genre_scores_gemma":[0.83928126,0.00083166204,0.1410974,0.0003460432,0.00020526485,0.0006859397,0.0022161987,0.00023522667,0.015100982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518245,0.0026871099,0.00024327327,0.0009150037,0.00063048076,0.00034169597],"domain_scores_gemma":[0.9326687,0.05816727,0.0015495721,0.002838127,0.0041089323,0.0006673747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009975669,0.0012072559,0.002874863,0.0027423354,0.00072861055,0.0032452417,0.004472,0.003501468,0.008130668],"category_scores_gemma":[0.052915998,0.0020896888,0.0024709054,0.0026736862,0.0015151507,0.0077925758,0.002294723,0.004400416,0.0032488636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002081064,0.00072006707,0.019853313,0.0003285136,0.0008636887,0.00027561522,0.0012920168,0.64786553,0.0011346512,0.090981595,0.0076189525,0.2269851],"study_design_scores_gemma":[0.000056044173,0.00007443853,0.0018878473,0.000031077714,0.00010031742,0.000049408838,0.00003512638,0.95465934,0.00024953758,0.04255065,0.00027635257,0.000029845734],"about_ca_topic_score_codex":0.0066648675,"about_ca_topic_score_gemma":0.009874199,"teacher_disagreement_score":0.009975669,"about_ca_system_score_codex":0.0013852345,"about_ca_system_score_gemma":0.0011120118,"threshold_uncertainty_score":0.052757025},"labels":[],"label_agreement":null},{"id":"W1806726896","doi":"10.1007/978-3-540-77042-8_7","title":"Safe and Sound Evolution with SONAR","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Sonar; Computer science; Java; Abstraction; Systems engineering; Human–computer interaction; Software engineering; Artificial intelligence; Engineering; Programming language","score_opus":0.03499725117315887,"score_gpt":0.2754603664255376,"score_spread":0.24046311525237873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806726896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012416428,0.00042647068,0.962454,0.00023681432,0.00017114842,0.00002440362,0.000055137298,0.0013994562,0.022816021],"genre_scores_gemma":[0.3871142,0.0012449918,0.5477686,0.0003399468,0.00018136426,0.000105408064,0.00042222496,0.0019289093,0.060894344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994166,0.00007886816,0.000032745033,0.000111619556,0.00030072537,0.000059499667],"domain_scores_gemma":[0.9992901,0.00027947788,0.000047672063,0.00021652204,0.00012573351,0.00004058706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053221383,0.0005697175,0.0004883231,0.00062036165,0.00061386375,0.0012467495,0.0010893241,0.0008322313,0.0069463374],"category_scores_gemma":[0.0022893222,0.0004812759,0.0007054227,0.00041548585,0.0018780759,0.0018886538,0.0022638428,0.0019573206,0.0017799863],"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.000107253836,0.00004958617,0.0005840203,0.00018355786,0.00003739172,0.00029763396,0.00060118723,0.05391504,0.026935034,0.6004445,0.005556662,0.31128815],"study_design_scores_gemma":[0.00003684122,0.00010602458,0.00028882956,0.000070644564,0.000045821707,0.0003945673,0.00014118872,0.15508756,0.026790101,0.7501153,0.066883676,0.000039506278],"about_ca_topic_score_codex":0.0008763169,"about_ca_topic_score_gemma":0.0008787581,"teacher_disagreement_score":0.0069463374,"about_ca_system_score_codex":0.00044569312,"about_ca_system_score_gemma":0.00045822706,"threshold_uncertainty_score":0.023237765},"labels":[],"label_agreement":null},{"id":"W1806995473","doi":"10.1007/11799573_42","title":"Learning Semantic Parsers: A Constraint Handling Rule Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Parsing; Natural language processing; Artificial intelligence; Semantic compression; Semantic role labeling; Natural language; Semantic computing; Top-down parsing; Bottom-up parsing; Natural language understanding; Semantic analysis (machine learning); Frame (networking); Process (computing); S-attributed grammar; Word (group theory); Programming language; Semantic Web; Semantic technology; Linguistics","score_opus":0.013997348473425222,"score_gpt":0.24235615697399668,"score_spread":0.22835880850057144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806995473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054439665,0.00022066355,0.985535,0.0003586929,0.000051682004,0.0001469384,0.0007500236,0.004934599,0.0025583913],"genre_scores_gemma":[0.0515501,0.00032158048,0.9393959,0.00026934716,0.00008229068,0.00022107773,0.0045205136,0.0008321791,0.0028071173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961926,0.0009295369,0.00038669142,0.0012649081,0.001006086,0.00022022426],"domain_scores_gemma":[0.9868466,0.009431124,0.00041331927,0.0016328443,0.0014691018,0.00020704205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041723833,0.0019430694,0.0024999613,0.0032048938,0.001421131,0.004144214,0.008884546,0.0030948427,0.014299526],"category_scores_gemma":[0.017959775,0.0022857406,0.003932702,0.005187478,0.0018757265,0.009979146,0.0037633698,0.005698678,0.005707631],"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.000204426,0.0004601518,0.0017797388,0.0004263059,0.00026046883,0.0005259989,0.00026894826,0.06462914,0.0042686993,0.049533132,0.026666373,0.85097665],"study_design_scores_gemma":[0.0000957935,0.00008638422,0.00051917945,0.00010929928,0.00026056138,0.00028737888,0.00019120798,0.78854656,0.009739836,0.18654186,0.013544208,0.0000777345],"about_ca_topic_score_codex":0.004541285,"about_ca_topic_score_gemma":0.008032367,"teacher_disagreement_score":0.014299526,"about_ca_system_score_codex":0.0012670845,"about_ca_system_score_gemma":0.0025761225,"threshold_uncertainty_score":0.04783666},"labels":[],"label_agreement":null},{"id":"W1807142225","doi":"10.1007/978-3-540-72788-0_22","title":"Dynamically Partitioning for Solving QBF","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Solver; Computer science; True quantified Boolean formula; Boolean satisfiability problem; Propositional formula; Conjunctive normal form; Propositional calculus; Theoretical computer science; Parallel computing; Algorithm; Programming language; Propositional variable","score_opus":0.04062352991424389,"score_gpt":0.3092980261095121,"score_spread":0.26867449619526823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807142225","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.011694544,0.00030026786,0.97575164,0.00020171162,0.00007009185,0.00014597464,0.00013184892,0.001798493,0.0099053765],"genre_scores_gemma":[0.20167547,0.00033103244,0.78693503,0.00014928417,0.00004584721,0.00031718105,0.00073915854,0.00073229655,0.009074771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926263,0.00022508657,0.0000426145,0.00013196516,0.00019750482,0.00014017308],"domain_scores_gemma":[0.99919385,0.00047456648,0.000031037107,0.00017552757,0.00009799104,0.000026989357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153582,0.0009727682,0.0007835623,0.00078350626,0.0011310471,0.0008976049,0.0014487747,0.00083620544,0.013150386],"category_scores_gemma":[0.0025723553,0.00072254473,0.0010812028,0.0010219865,0.0011403587,0.0025229428,0.001999394,0.0018129685,0.0020873107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043696983,0.00019615528,0.0005307113,0.00089288526,0.000060830425,0.00018485448,0.00075047556,0.098991916,0.020671193,0.27497584,0.014405553,0.5879027],"study_design_scores_gemma":[0.00014779407,0.00015832871,0.00031436534,0.00016696008,0.000089193,0.00018999081,0.00027314096,0.38180333,0.021132702,0.5651138,0.030568352,0.000042071042],"about_ca_topic_score_codex":0.0038956774,"about_ca_topic_score_gemma":0.006096719,"teacher_disagreement_score":0.013150386,"about_ca_system_score_codex":0.0011515833,"about_ca_system_score_gemma":0.00125514,"threshold_uncertainty_score":0.04399246},"labels":[],"label_agreement":null},{"id":"W1808361979","doi":"10.1007/978-3-642-11322-2_15","title":"A New Architecture for Hierarchical Sensor Networks with Mobile Data Collectors","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Windsor","funders":"","keywords":"Relay; Computer science; Wireless sensor network; Computer network; Node (physics); Distributed computing; Engineering","score_opus":0.014399715415337855,"score_gpt":0.2372901131058017,"score_spread":0.22289039769046384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808361979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074864244,0.0008931177,0.98368734,0.0002608965,0.00024618095,0.000092066926,0.000071123795,0.003023759,0.0042390614],"genre_scores_gemma":[0.119398676,0.0010620423,0.86192924,0.00031710987,0.0002749522,0.00023518626,0.00026072847,0.0003021597,0.016219856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.00004895846,0.000032520376,0.00009920137,0.00017736542,0.000047863716],"domain_scores_gemma":[0.9995091,0.000081320744,0.0000309133,0.00015159296,0.00017176964,0.0000552666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058187835,0.0005034078,0.00063019834,0.00065627217,0.0008325811,0.0012217084,0.0026491624,0.00077788625,0.003138668],"category_scores_gemma":[0.0007587033,0.00065946754,0.00054700725,0.0007177147,0.0006124994,0.0026149773,0.0018781205,0.0012784725,0.0014301738],"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.0005067061,0.00019310486,0.0014175773,0.00085221365,0.00019604326,0.00031641193,0.0009105063,0.06979583,0.19776879,0.13009004,0.026725747,0.5712271],"study_design_scores_gemma":[0.00011458294,0.0005090412,0.0011574206,0.0001355515,0.00031533325,0.00089061895,0.00019326204,0.6340498,0.09681416,0.060821086,0.204858,0.00014112746],"about_ca_topic_score_codex":0.0012487546,"about_ca_topic_score_gemma":0.0028419232,"teacher_disagreement_score":0.003138668,"about_ca_system_score_codex":0.0006958688,"about_ca_system_score_gemma":0.00076487014,"threshold_uncertainty_score":0.010499895},"labels":[],"label_agreement":null},{"id":"W1808640434","doi":"10.1007/978-3-540-68825-9_3","title":"A Comparison of Sentiment Analysis Techniques: Polarizing Movie Blogs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":172,"is_retracted":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":"Computer science; Popularity; Sentiment analysis; Polarity (international relations); Social media; Set (abstract data type); Support vector machine; Visualization; Task (project management); The Internet; Information retrieval; World Wide Web; Data science; Service (business); Artificial intelligence; Machine learning","score_opus":0.03004770387279265,"score_gpt":0.30358412287881853,"score_spread":0.2735364190060259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808640434","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.64639395,0.023417154,0.25880802,0.0020179919,0.0018198015,0.0011123349,0.00777291,0.0040114997,0.054646306],"genre_scores_gemma":[0.6676213,0.0123876445,0.29986092,0.0003245595,0.0010912595,0.00046579633,0.00924283,0.0006547198,0.00835093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99759173,0.0009884769,0.0001637101,0.00023521707,0.0008848355,0.00013612007],"domain_scores_gemma":[0.988485,0.0076715113,0.0004096671,0.0003988739,0.0027406297,0.0002942297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035486945,0.000999455,0.0010564895,0.0069502727,0.00067975867,0.0026011865,0.000597952,0.00076168025,0.0025088668],"category_scores_gemma":[0.01056956,0.0003143139,0.0010081284,0.0058809128,0.00030689544,0.0029889073,0.0010497521,0.0007176234,0.0019187871],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026503513,0.00039084,0.019397015,0.0016954379,0.00070684525,0.00009598213,0.0012615982,0.0016078559,0.025412878,0.0015958023,0.01213833,0.93304706],"study_design_scores_gemma":[0.0011780167,0.0058664824,0.37441677,0.0013547405,0.00391878,0.0021588663,0.0177266,0.41099107,0.07717949,0.019866847,0.08463454,0.00070783065],"about_ca_topic_score_codex":0.0012795499,"about_ca_topic_score_gemma":0.003607293,"teacher_disagreement_score":0.0069502727,"about_ca_system_score_codex":0.00031210034,"about_ca_system_score_gemma":0.0004872202,"threshold_uncertainty_score":0.018767536},"labels":[],"label_agreement":null},{"id":"W1809001740","doi":"10.1007/11853565_13","title":"Mobility Detection Using Everyday GSM Traces","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":277,"is_retracted":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":"National Science Foundation","keywords":"GSM; Computer science; Mobile phone; Tower; Mobile telephony; Phone; Everyday life; Activity recognition; Real-time computing; Telecommunications; Artificial intelligence; Mobile radio; Engineering","score_opus":0.03051327408169161,"score_gpt":0.25633679779462976,"score_spread":0.22582352371293815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809001740","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.72807014,0.00069070177,0.2571957,0.00011682245,0.0001229186,0.00009759541,0.0024087476,0.0044278307,0.00686956],"genre_scores_gemma":[0.95966345,0.00037933234,0.035924245,0.00002957024,0.00004161991,0.00003167653,0.0015336692,0.00007427169,0.002322168],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985826,0.000024584546,0.000008539977,0.00003693623,0.000038798164,0.000032765125],"domain_scores_gemma":[0.999723,0.0000863429,0.000032310294,0.00003459387,0.0000879626,0.000035801535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012749218,0.00069211976,0.00044798624,0.0019459875,0.00018446927,0.0005262167,0.00045253753,0.0005555731,0.0015998482],"category_scores_gemma":[0.0007554812,0.00018450955,0.00026725596,0.0011052538,0.0001416274,0.00046084524,0.00048596578,0.00022173095,0.0016190753],"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.0011269421,0.0002651324,0.11468821,0.000466879,0.00021782839,0.0012776336,0.0004980695,0.023322353,0.1426323,0.0014255362,0.005019738,0.7090594],"study_design_scores_gemma":[0.000092873546,0.00083356287,0.17949237,0.00017603488,0.00029073944,0.005308349,0.0010758145,0.6959379,0.10015074,0.0044740466,0.0120498715,0.00011776918],"about_ca_topic_score_codex":0.0018312574,"about_ca_topic_score_gemma":0.0033546456,"teacher_disagreement_score":0.0019459875,"about_ca_system_score_codex":0.00011370526,"about_ca_system_score_gemma":0.00016236302,"threshold_uncertainty_score":0.0053520203},"labels":[],"label_agreement":null},{"id":"W1809049220","doi":"10.1007/978-3-540-76843-2_22","title":"Sidera: A Cluster-Based Server for Online Analytical Processing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Concordia University","funders":"","keywords":"Online analytical processing; Computer science; Server; Robustness (evolution); Database; Computer cluster; Data warehouse; Cluster (spacecraft); Operating system","score_opus":0.04094772496917243,"score_gpt":0.30988234587392244,"score_spread":0.26893462090475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809049220","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.015054843,0.0009628297,0.5446571,0.00040813332,0.0004856452,0.0007125606,0.006553179,0.40556774,0.025597943],"genre_scores_gemma":[0.23285526,0.0013889554,0.5847415,0.0013872713,0.0008140212,0.0011277437,0.036042143,0.040005185,0.10163794],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815315,0.00021673096,0.000118155505,0.0003877456,0.00090731354,0.00021694125],"domain_scores_gemma":[0.9965295,0.00058148225,0.00013320532,0.0012636362,0.0010135616,0.0004785937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014788869,0.0020250278,0.0023212458,0.0024737078,0.0010531232,0.0032332775,0.0059541445,0.0013990193,0.041116327],"category_scores_gemma":[0.0039872434,0.0013366472,0.00082886143,0.0038602396,0.0006754842,0.0030741857,0.002541354,0.0020225258,0.039436404],"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.0027636094,0.0006801663,0.002841402,0.0005598223,0.00033867586,0.00038693607,0.00038523,0.012178781,0.06586098,0.009831705,0.49971715,0.4044555],"study_design_scores_gemma":[0.0009001852,0.00055330375,0.0047488096,0.000117447096,0.00028874562,0.0011470445,0.00031919888,0.52862245,0.121474184,0.0262782,0.31510505,0.0004453769],"about_ca_topic_score_codex":0.004099569,"about_ca_topic_score_gemma":0.0034078003,"teacher_disagreement_score":0.041116327,"about_ca_system_score_codex":0.00088076317,"about_ca_system_score_gemma":0.0022499592,"threshold_uncertainty_score":0.13754779},"labels":[],"label_agreement":null},{"id":"W1809345383","doi":"10.1007/978-3-642-20847-8_33","title":"Asking Generalized Queries with Minimum Cost","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.016921607349679728,"score_gpt":0.23915437323266225,"score_spread":0.22223276588298252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809345383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0959602,0.0022048997,0.85815305,0.0074651036,0.0005733316,0.0006264765,0.002819557,0.00785094,0.024346516],"genre_scores_gemma":[0.53043103,0.0011712624,0.43924472,0.0020951168,0.0013608908,0.0005243645,0.00530213,0.0019011057,0.01796936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98972744,0.0033812437,0.0007365403,0.002177452,0.0027688253,0.0012084617],"domain_scores_gemma":[0.9805197,0.012387779,0.00056088,0.005100249,0.0008789174,0.000552572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033005315,0.0020957952,0.0051707937,0.0010788122,0.0016916463,0.0049865665,0.0049285893,0.0051500914,0.014523044],"category_scores_gemma":[0.022082696,0.0014951441,0.0030871697,0.003029462,0.002559418,0.014318027,0.0067875753,0.0054156925,0.0034077321],"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.0038188016,0.00062743266,0.0032110596,0.0031867188,0.00066504604,0.0010008576,0.0022204553,0.108711086,0.024239901,0.33568776,0.11846802,0.3981629],"study_design_scores_gemma":[0.000289681,0.00017145985,0.00062430784,0.00007873147,0.00018663477,0.0006637387,0.00046188032,0.23918198,0.00423821,0.74301237,0.011018386,0.00007252039],"about_ca_topic_score_codex":0.0019383885,"about_ca_topic_score_gemma":0.0033519794,"teacher_disagreement_score":0.014523044,"about_ca_system_score_codex":0.0021437174,"about_ca_system_score_gemma":0.0019640585,"threshold_uncertainty_score":0.04858446},"labels":[],"label_agreement":null},{"id":"W1809981037","doi":"10.1007/978-3-642-02868-7_8","title":"Market Potential for Ambient Assisted Living Technology: The Case of Canada","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Healthcare Policy and Management","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Assisted living; Operations research; Gerontology; Engineering; Medicine","score_opus":0.022675236823298636,"score_gpt":0.2368643152472542,"score_spread":0.21418907842395557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809981037","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5697364,0.0053387014,0.007030777,0.015870793,0.00011044901,0.00007059338,0.0012318699,0.00009126554,0.40051913],"genre_scores_gemma":[0.97801346,0.0007787017,0.00048622533,0.00012426094,0.000015508735,0.0000081588,0.00009043928,0.000009526223,0.02047375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994081,0.00005450304,0.000009439828,0.00004957904,0.00016981608,0.00030855762],"domain_scores_gemma":[0.9988373,0.00039960456,0.000063963686,0.000028950157,0.00041389986,0.0002563921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006189452,0.00027752353,0.00042962455,0.0008802376,0.0036887098,0.0058119004,0.0015241404,0.0022482835,0.011505037],"category_scores_gemma":[0.0023335523,0.00019904149,0.0007101257,0.0016368554,0.002059838,0.0019458836,0.001044087,0.0015343233,0.00034095976],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725066,0.0000823877,0.009770686,0.000093863935,0.000047225712,0.0014179116,0.0012960669,0.032648113,0.0008466547,0.91078246,0.024068939,0.018773213],"study_design_scores_gemma":[0.000220554,0.0001293411,0.05525466,0.00027812683,0.00027239748,0.0012908074,0.021095956,0.32755604,0.0013768768,0.41773036,0.17440033,0.0003945977],"about_ca_topic_score_codex":0.9582863,"about_ca_topic_score_gemma":0.96163374,"teacher_disagreement_score":0.041713715,"about_ca_system_score_codex":0.031104777,"about_ca_system_score_gemma":0.0216155,"threshold_uncertainty_score":0.22568196},"labels":[],"label_agreement":null},{"id":"W1810327353","doi":"10.1007/978-3-642-02498-6_49","title":"Level Set Image Segmentation with a Statistical Overlap Constraint","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"London Health Sciences Centre; CARE Canada","funders":"","keywords":"Segmentation; Artificial intelligence; Computer science; Bhattacharyya distance; Image segmentation; Pattern recognition (psychology); Statistical model; Gaussian; A priori and a posteriori; Algorithm; Constraint (computer-aided design); Mathematics","score_opus":0.02125545820288571,"score_gpt":0.3075554129049665,"score_spread":0.2862999547020808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810327353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040543494,0.0000747371,0.9946942,0.000084095474,0.000014393229,0.000032392858,0.00005878486,0.0003279163,0.000659192],"genre_scores_gemma":[0.12576953,0.00016230883,0.8693967,0.00017219913,0.00009250654,0.00024175459,0.0004678278,0.00084117585,0.0028559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978248,0.000364694,0.00015558569,0.00045840873,0.0010522151,0.00014427841],"domain_scores_gemma":[0.9973308,0.0011843656,0.00026176966,0.0005991236,0.0004948717,0.00012915848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298895,0.00092856627,0.002137062,0.0016910374,0.0008888973,0.0027484572,0.0026951442,0.0021761493,0.004152924],"category_scores_gemma":[0.0065193144,0.001690619,0.0016821048,0.0023144432,0.0012545137,0.002284685,0.003843699,0.002126609,0.0013433044],"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.0007974024,0.00025299535,0.0016521965,0.0005149132,0.00040637318,0.00042399668,0.00028191364,0.39912277,0.0857804,0.09013351,0.006422101,0.41421145],"study_design_scores_gemma":[0.000023766577,0.00006259516,0.00043764923,0.000015403326,0.000044643413,0.00019426642,0.00001358538,0.9675505,0.014174942,0.013875488,0.0035820762,0.000024995059],"about_ca_topic_score_codex":0.0028381015,"about_ca_topic_score_gemma":0.0054643257,"teacher_disagreement_score":0.004152924,"about_ca_system_score_codex":0.0010342386,"about_ca_system_score_gemma":0.0025850306,"threshold_uncertainty_score":0.013892889},"labels":[],"label_agreement":null},{"id":"W1810381759","doi":"10.1007/3-540-44842-x_7","title":"Mesh Partitioners for Computational Grids: A Comparison","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing 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":"University of New Brunswick","funders":"","keywords":"Computer science; Grid; Distributed computing; Metric (unit); Load balancing (electrical power); Parallel computing; Performance metric; Grid computing; Execution time; Mesh generation; Computational science; Finite element method","score_opus":0.026343408240336166,"score_gpt":0.27392255653156683,"score_spread":0.24757914829123068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810381759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07886415,0.09581853,0.72573566,0.0016243393,0.0016429051,0.00048035142,0.001023073,0.004302819,0.090508215],"genre_scores_gemma":[0.38424325,0.07219513,0.50742465,0.00068010465,0.0010505716,0.00046863157,0.0020368109,0.0030229252,0.028877916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979456,0.0004582129,0.00012503582,0.00016286824,0.0012034994,0.000104883926],"domain_scores_gemma":[0.9954242,0.0026459277,0.00021384534,0.00073073717,0.0008629655,0.0001223412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018061721,0.00081924914,0.001582889,0.0021623117,0.0005510505,0.0021310425,0.0021297673,0.0012393242,0.01301929],"category_scores_gemma":[0.007750386,0.00050319405,0.00086906384,0.0037374757,0.00057455583,0.0036345203,0.001725281,0.0009854387,0.0019895658],"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.0020456812,0.00025820936,0.0012810169,0.0020773136,0.00029723143,0.000049776918,0.00023383088,0.05231089,0.004642926,0.0574513,0.0118797375,0.8674721],"study_design_scores_gemma":[0.0010278221,0.0024912313,0.008691931,0.0012218483,0.00088893564,0.0012276429,0.00081333984,0.62996614,0.02851293,0.13197109,0.19296403,0.00022308774],"about_ca_topic_score_codex":0.0012009867,"about_ca_topic_score_gemma":0.0018664888,"teacher_disagreement_score":0.01301929,"about_ca_system_score_codex":0.00091608765,"about_ca_system_score_gemma":0.0008283589,"threshold_uncertainty_score":0.04355389},"labels":[],"label_agreement":null},{"id":"W181041260","doi":"10.1007/978-3-642-02774-1_75","title":"Measuring E-Democracy Opportunities: A Global Perspective","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Democracy; ICTS; Information and Communications Technology; The Internet; Digital divide; Perspective (graphical); E-democracy; Politics; Political science; Index (typography); Computer science; World Wide Web","score_opus":0.08698695317939134,"score_gpt":0.32610129776626995,"score_spread":0.2391143445868786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181041260","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.46947655,0.006663729,0.07646102,0.0049110376,0.00019126828,0.00018598832,0.002392164,0.00017347586,0.4395448],"genre_scores_gemma":[0.983042,0.0021900744,0.011497747,0.00016865107,0.00007260735,0.000093725066,0.00036021878,0.000043897944,0.0025310596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99548125,0.0027245504,0.00014432374,0.0004023874,0.0008007613,0.0004467657],"domain_scores_gemma":[0.991325,0.0055457614,0.0014420975,0.00061113224,0.0006474772,0.00042858184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042935885,0.0010329314,0.00077138806,0.005528578,0.0010089028,0.0058894716,0.0005340378,0.0013103867,0.005571808],"category_scores_gemma":[0.010705095,0.0003719412,0.0005418564,0.0121172005,0.003142053,0.011922249,0.0047255405,0.0016316902,0.000612175],"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.00023048323,0.00031731624,0.17877021,0.0009046661,0.00054437015,0.00028230925,0.0046815216,0.01848219,0.002895903,0.4830335,0.0054918677,0.30436566],"study_design_scores_gemma":[0.000050705774,0.0006381665,0.27342477,0.0013852237,0.00035562465,0.00073505135,0.025427928,0.01584156,0.008063431,0.5927406,0.08119316,0.00014387743],"about_ca_topic_score_codex":0.0011995713,"about_ca_topic_score_gemma":0.0022275236,"teacher_disagreement_score":0.0058894716,"about_ca_system_score_codex":0.0011933924,"about_ca_system_score_gemma":0.0009449926,"threshold_uncertainty_score":0.022706926},"labels":[],"label_agreement":null},{"id":"W18104785","doi":"10.1007/978-3-642-36424-2_12","title":"Inter-warp Instruction Temporal Locality in Deep-Multithreaded GPUs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Computer science; Locality; Parallel computing; Cache; Locality of reference; Control flow; Throughput; Filter (signal processing); Instruction set; Multithreading; Multi-core processor; Thread (computing); Operating system; Programming language","score_opus":0.018829069990696473,"score_gpt":0.25395316613583707,"score_spread":0.2351240961451406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18104785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30235854,0.009923567,0.64790505,0.0006135683,0.00039260392,0.0000498309,0.00021680098,0.003330247,0.035209805],"genre_scores_gemma":[0.90775496,0.0010523313,0.07600404,0.00014182452,0.000071187394,0.00005422313,0.00018209082,0.00041053354,0.014328769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.000024783541,0.000009906324,0.000033614037,0.00007251406,0.000054961045],"domain_scores_gemma":[0.9996295,0.00010811456,0.00003647915,0.00009073423,0.000089828995,0.00004531581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582417,0.00029268838,0.000419331,0.00033167744,0.0004527358,0.00078385806,0.0013037105,0.00028132537,0.0033137423],"category_scores_gemma":[0.00091118837,0.00032276096,0.00025550363,0.00085818605,0.0004559322,0.00096458255,0.0009155833,0.0008505175,0.00042526753],"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.0010420135,0.00025575058,0.004184535,0.0005493317,0.0001300147,0.00041460927,0.00075280084,0.30085987,0.094712585,0.15523143,0.020707918,0.42115918],"study_design_scores_gemma":[0.00004057263,0.00019897262,0.0012430057,0.000049023733,0.000045376095,0.00017434676,0.00012136742,0.9032226,0.025844932,0.05114146,0.017886207,0.000032206557],"about_ca_topic_score_codex":0.003114187,"about_ca_topic_score_gemma":0.008011998,"teacher_disagreement_score":0.0033137423,"about_ca_system_score_codex":0.000818665,"about_ca_system_score_gemma":0.00092815625,"threshold_uncertainty_score":0.01108557},"labels":[],"label_agreement":null},{"id":"W1810526953","doi":"10.1007/978-3-540-76931-6_2","title":"Analyzing the Role of “Smart” Start Points in Coarse Search-Greedy Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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 Toronto; York University","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Computer science; Memetic algorithm; Point (geometry); Greedy algorithm; Domain (mathematical analysis); Local search (optimization); Process (computing); Mathematics","score_opus":0.038195848875386566,"score_gpt":0.3025436831775436,"score_spread":0.264347834302157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810526953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28075796,0.0014738963,0.69286656,0.0009825426,0.00012473998,0.00011728087,0.0001136063,0.00064795243,0.022915527],"genre_scores_gemma":[0.9262504,0.00024820364,0.070518576,0.00013585722,0.00003421,0.00006219439,0.00008175642,0.00018324789,0.0024856427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.00052238454,0.000027975671,0.00011977925,0.00021763232,0.00019167065],"domain_scores_gemma":[0.9837105,0.01384198,0.0005889515,0.00083922147,0.0005906581,0.00042869453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003090942,0.0007163699,0.0011366707,0.0010192028,0.00072973414,0.0014566719,0.0015701611,0.0015831573,0.0036070393],"category_scores_gemma":[0.024602238,0.00068621297,0.00063041673,0.0011296286,0.0019859304,0.0028644293,0.0016705403,0.0015608922,0.00031553526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000367752,0.000090321286,0.0017708859,0.000114345494,0.000060973092,0.00006885424,0.00013045197,0.8869555,0.0011940121,0.08596465,0.0015562573,0.021725912],"study_design_scores_gemma":[0.00002956092,0.000050588762,0.000320635,0.000013130933,0.000018793164,0.000015985399,0.000038250113,0.96418834,0.00047232045,0.034597095,0.00024591744,0.000009349024],"about_ca_topic_score_codex":0.0044278167,"about_ca_topic_score_gemma":0.0050731516,"teacher_disagreement_score":0.0044278167,"about_ca_system_score_codex":0.001432656,"about_ca_system_score_gemma":0.0019437317,"threshold_uncertainty_score":0.016346693},"labels":[],"label_agreement":null},{"id":"W1810559539","doi":"10.1007/978-3-642-22300-6_46","title":"Closest Pair and the Post Office Problem for Stochastic Points","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Euclidean space; Point (geometry); Set (abstract data type); Euclidean distance; Stochastic geometry; Computer science; Euclidean geometry; Combinatorics; k-nearest neighbors algorithm; Point process; Stochastic process; Space (punctuation); Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Statistics; Geometry","score_opus":0.017112171882038067,"score_gpt":0.2304949142624519,"score_spread":0.21338274238041383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810559539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0870551,0.0011529031,0.8863273,0.0021267664,0.0002748772,0.000158763,0.00059102935,0.00026819363,0.022044994],"genre_scores_gemma":[0.60470265,0.0022458844,0.3179042,0.0003493609,0.0007442137,0.00057313184,0.0022100827,0.0006617722,0.07060866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.0008648277,0.00012854075,0.0004725921,0.00051952695,0.000245251],"domain_scores_gemma":[0.99113023,0.0065240115,0.0007229891,0.00058090594,0.0004600433,0.00058177725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032106966,0.0011634085,0.003012216,0.0019982413,0.0023928476,0.0037156048,0.0042473953,0.006285064,0.015901728],"category_scores_gemma":[0.023320444,0.0012831673,0.0022469575,0.0028232895,0.0029629937,0.008314324,0.005736447,0.004774624,0.0016058917],"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.00033009605,0.00013365112,0.00077234645,0.00020256106,0.00005959182,0.00025246834,0.00026003737,0.19599108,0.0005829488,0.76239324,0.008516802,0.030505113],"study_design_scores_gemma":[0.000059390462,0.00006938206,0.00018300845,0.00004151591,0.000020640626,0.00014167727,0.00015054538,0.37455082,0.0004012557,0.6203192,0.0040298565,0.000032689455],"about_ca_topic_score_codex":0.0037063337,"about_ca_topic_score_gemma":0.003012786,"teacher_disagreement_score":0.015901728,"about_ca_system_score_codex":0.0019007256,"about_ca_system_score_gemma":0.0017025716,"threshold_uncertainty_score":0.05319655},"labels":[],"label_agreement":null},{"id":"W1810702064","doi":"10.1007/978-3-642-17517-6_6","title":"Approximating the Average Stretch Factor of Geometric Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Euclidean geometry; Shortest path problem; Mathematics; Approximation algorithm; Graph; Path (computing); Plane (geometry); Set (abstract data type); Discrete mathematics; Computer science; Geometry","score_opus":0.016855616836274304,"score_gpt":0.23803114598761566,"score_spread":0.22117552915134137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810702064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31838378,0.0040550125,0.64498174,0.0011248834,0.00040087616,0.000095328556,0.0010039703,0.002549242,0.027405089],"genre_scores_gemma":[0.786001,0.0023497855,0.19828402,0.00020684776,0.0003754624,0.00012354049,0.0014160671,0.0012948506,0.009948341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989588,0.00020152036,0.000033899545,0.00022377948,0.00043525037,0.00014663479],"domain_scores_gemma":[0.9953425,0.0028187933,0.0002995592,0.00091482676,0.00036920296,0.00025501326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012353943,0.0018401212,0.0014968864,0.002196744,0.00063128886,0.0017514643,0.0026706427,0.0014584679,0.0071065254],"category_scores_gemma":[0.011599466,0.00078821747,0.0007446528,0.0026338615,0.0016505867,0.0044935904,0.0021417292,0.0020782028,0.0013825025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010855304,0.00021391298,0.004341809,0.0005410566,0.00013777293,0.0002179134,0.0002953634,0.61765903,0.021962881,0.114029475,0.014261861,0.22525337],"study_design_scores_gemma":[0.000037934227,0.00009941436,0.0008782406,0.000033834644,0.000030300964,0.00014460016,0.00007352045,0.88927704,0.003785449,0.10276298,0.0028583785,0.000018304021],"about_ca_topic_score_codex":0.003272508,"about_ca_topic_score_gemma":0.0043443884,"teacher_disagreement_score":0.0071065254,"about_ca_system_score_codex":0.0018484956,"about_ca_system_score_gemma":0.0006982187,"threshold_uncertainty_score":0.02377367},"labels":[],"label_agreement":null},{"id":"W1811041217","doi":"10.1007/978-3-642-15464-5_29","title":"Examining Group Work: Implications for the Digital Library as Sharium","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Knowledge Management and Sharing","field":"Social Sciences","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":"Dalhousie University","funders":"","keywords":"Work (physics); Group work; Working group; Digital library; Computer science; Group (periodic table); Space (punctuation); Human–computer interaction; Psychology; Engineering; Mathematics education","score_opus":0.0463055178156644,"score_gpt":0.2816223321065359,"score_spread":0.23531681429087153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1811041217","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.33967668,0.013882574,0.03364771,0.07952884,0.0011241538,0.00033367268,0.00025165125,0.00012319098,0.5314315],"genre_scores_gemma":[0.9660699,0.0039135064,0.011841055,0.0033859692,0.00031137385,0.00021951407,0.00008151298,0.00006217364,0.014115001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996345,0.0026641467,0.00007317274,0.0002931351,0.00028578486,0.0003388286],"domain_scores_gemma":[0.9744444,0.02110779,0.0013857083,0.0008201461,0.0009238958,0.0013180804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066856304,0.00052937627,0.00060556125,0.0031510408,0.006793946,0.015828105,0.0023770696,0.0028842334,0.020617874],"category_scores_gemma":[0.01956172,0.0003444205,0.0004683024,0.006025846,0.012066477,0.016183842,0.0062650735,0.0025771114,0.00092273427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012139427,0.00039544265,0.021211969,0.00038599447,0.00003743708,0.0003604633,0.100000255,0.0005824336,0.00025654427,0.7824899,0.01696458,0.07719366],"study_design_scores_gemma":[0.000045289737,0.000059114147,0.020188948,0.0006394315,0.00005069081,0.00017032224,0.3585472,0.001971322,0.00027494173,0.5721678,0.045852847,0.00003208878],"about_ca_topic_score_codex":0.008930034,"about_ca_topic_score_gemma":0.019116664,"teacher_disagreement_score":0.020617874,"about_ca_system_score_codex":0.004615501,"about_ca_system_score_gemma":0.0056722444,"threshold_uncertainty_score":0.06897366},"labels":[],"label_agreement":null},{"id":"W1811567911","doi":"10.1007/978-3-642-39013-5_3","title":"Supporting Different Process Views through a Shared Process Model","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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 Waterloo","funders":"","keywords":"Computer science; Abstraction; Process (computing); Business process; Stakeholder; Process management; Business process management; Business process modeling; Software engineering; Process modeling; Work in process; Human–computer interaction; Programming language; Operations management; Engineering","score_opus":0.04133077522310387,"score_gpt":0.286391206324212,"score_spread":0.24506043110110814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1811567911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004447465,0.000042108888,0.9910585,0.00021213811,0.000032576023,0.00010309092,0.00005944765,0.0015463734,0.0024982372],"genre_scores_gemma":[0.17204988,0.00018716659,0.82146823,0.00019682873,0.00003689967,0.00037411315,0.0005910685,0.0007936394,0.004302082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99011165,0.0026528982,0.0010748445,0.0014306277,0.0038978239,0.0008322421],"domain_scores_gemma":[0.98747474,0.0039980197,0.0005780896,0.005855857,0.0014793647,0.0006139183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008668619,0.001420671,0.0015979832,0.0018662083,0.0015628389,0.009666221,0.0049898257,0.0045455485,0.0049564186],"category_scores_gemma":[0.018109625,0.0018214528,0.0042951135,0.0018052144,0.0026819357,0.015899757,0.010360551,0.006358649,0.0015210203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053344783,0.0004857897,0.0019001977,0.00032334164,0.0002525742,0.0007873378,0.0033950852,0.128042,0.01753564,0.6776693,0.0032980691,0.16577725],"study_design_scores_gemma":[0.00013741084,0.00011303582,0.00016062,0.00014623153,0.00024183768,0.00026577598,0.00032800337,0.71186936,0.015357314,0.23999076,0.031286947,0.00010267647],"about_ca_topic_score_codex":0.003916799,"about_ca_topic_score_gemma":0.003989342,"teacher_disagreement_score":0.009666221,"about_ca_system_score_codex":0.0018186086,"about_ca_system_score_gemma":0.0046565617,"threshold_uncertainty_score":0.045844555},"labels":[],"label_agreement":null},{"id":"W181174070","doi":"10.1007/978-3-642-04667-4_40","title":"Nonideal Iris Recognition Using Level Set Approach and Coalitional Game Theory","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Iris recognition; Boundary (topology); Context (archaeology); Level set (data structures); Segmentation; Image segmentation; Algorithm; Set (abstract data type); Artificial intelligence; Function (biology); Selection (genetic algorithm); Mathematical optimization; Pattern recognition (psychology); Mathematics; Biometrics","score_opus":0.08976174746956248,"score_gpt":0.28253478690842165,"score_spread":0.19277303943885918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181174070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009920772,0.00006864627,0.9854719,0.00012263095,0.00001719543,0.000034132005,0.00001907755,0.000057507714,0.004288222],"genre_scores_gemma":[0.761556,0.00019700523,0.22727634,0.000070693975,0.000037711186,0.00016619764,0.00007700061,0.00005721485,0.010561859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978338,0.00088676694,0.0000894942,0.00032249282,0.0006291223,0.00023839074],"domain_scores_gemma":[0.9965957,0.0022996853,0.00028812786,0.00035666864,0.00030865686,0.00015120242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026172204,0.0006955393,0.0015816453,0.00085928495,0.000816314,0.0028076835,0.0022840437,0.0010606732,0.003157183],"category_scores_gemma":[0.005742436,0.0006161454,0.0014810727,0.0008845402,0.002362191,0.0032968319,0.0030680017,0.001640287,0.00043823794],"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.00012972408,0.00007859734,0.00069759774,0.0001072513,0.00008235046,0.00014235181,0.00021922351,0.41980267,0.0042221234,0.5315699,0.0009612661,0.04198701],"study_design_scores_gemma":[0.000005647255,0.000020234307,0.00008548291,0.0000057646434,0.000008758919,0.000035465,0.000022697986,0.902847,0.0006472771,0.095989615,0.00031909795,0.000012938462],"about_ca_topic_score_codex":0.0022553941,"about_ca_topic_score_gemma":0.0019936734,"teacher_disagreement_score":0.003157183,"about_ca_system_score_codex":0.0019691675,"about_ca_system_score_gemma":0.0012516518,"threshold_uncertainty_score":0.014287412},"labels":[],"label_agreement":null},{"id":"W1811945719","doi":"10.1007/11559573_12","title":"Image Denoising Using Neighbor and Level Dependency","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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; Concordia University","funders":"","keywords":"Dependency (UML); Wavelet; Noise reduction; Pattern recognition (psychology); Artificial intelligence; Image denoising; Computation; Image (mathematics); Shrinkage; Mathematics; Non-local means; Noise (video); Computer science; Peak signal-to-noise ratio; Algorithm; Statistics","score_opus":0.043420308815947946,"score_gpt":0.2942571536770609,"score_spread":0.25083684486111296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1811945719","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.0052890093,0.00032651768,0.992214,0.000049819326,0.0000420726,0.000012479955,0.000033158576,0.00016145295,0.001871531],"genre_scores_gemma":[0.07909546,0.0010653875,0.90899897,0.00006834674,0.00008245708,0.000035529683,0.00022767734,0.00025456183,0.010171618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997056,0.00004267472,0.000017586008,0.00007375894,0.00014131138,0.00001893488],"domain_scores_gemma":[0.99952066,0.00017606052,0.00003198601,0.000099714314,0.0001531018,0.000018504703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038734,0.00047124535,0.0008607313,0.00084256125,0.00027325624,0.00070825935,0.00082094263,0.0008226004,0.0020378984],"category_scores_gemma":[0.0014285266,0.0005239015,0.0007941444,0.00087390793,0.00054112554,0.0010971188,0.0006398314,0.0010348733,0.0008414376],"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.0002304056,0.000095110685,0.001029186,0.00040322874,0.00015546787,0.00015581178,0.00017692802,0.10010001,0.10438993,0.10626904,0.0063429438,0.68065184],"study_design_scores_gemma":[0.000010965461,0.000055485445,0.0008274016,0.000019758641,0.00007645819,0.00028918384,0.000019606037,0.92340267,0.036256786,0.030366767,0.008645453,0.000029463714],"about_ca_topic_score_codex":0.0016839163,"about_ca_topic_score_gemma":0.0037347672,"teacher_disagreement_score":0.0020378984,"about_ca_system_score_codex":0.00035409458,"about_ca_system_score_gemma":0.0003220924,"threshold_uncertainty_score":0.0068175197},"labels":[],"label_agreement":null},{"id":"W1812360726","doi":"10.1007/978-3-540-78789-1_7","title":"Interface Composition for Web Service Intermediaries","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Web service; World Wide Web; Interoperability; WS-Policy; Correctness; Business Process Execution Language; SOAP; Schema (genetic algorithms); WS-Addressing; Service-oriented architecture; Web development; Web application security; Programming language; Information retrieval","score_opus":0.013112940277056749,"score_gpt":0.24209033501408814,"score_spread":0.22897739473703138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1812360726","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.011813031,0.00024378972,0.9670966,0.00014493047,0.000095722055,0.0002158144,0.000059710543,0.003216173,0.017114107],"genre_scores_gemma":[0.22657183,0.0005274688,0.73220044,0.00017125125,0.00009537233,0.0004939518,0.00063284615,0.0014554148,0.037851457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985592,0.0003235476,0.00013615948,0.0001888205,0.0006015716,0.00019069441],"domain_scores_gemma":[0.9989813,0.00041015484,0.000053556425,0.0002669677,0.00022562487,0.000062341154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125234,0.00072996476,0.00091122393,0.0010210279,0.0015200792,0.0025050284,0.0016576272,0.0013956778,0.01114248],"category_scores_gemma":[0.0034865441,0.0009988105,0.0011033047,0.0012346462,0.0014004037,0.0034578883,0.002741557,0.0023810973,0.0034600513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065067207,0.00031463258,0.0006500295,0.00040988284,0.00006326767,0.0005849049,0.0011358922,0.019342814,0.029281214,0.61237806,0.008490845,0.32669783],"study_design_scores_gemma":[0.00017006804,0.00014581095,0.0003281427,0.00016336032,0.00017488388,0.0005473083,0.00033363854,0.40028948,0.065214396,0.44710138,0.08545816,0.000073353105],"about_ca_topic_score_codex":0.0020414004,"about_ca_topic_score_gemma":0.001953545,"teacher_disagreement_score":0.01114248,"about_ca_system_score_codex":0.000830066,"about_ca_system_score_gemma":0.0009699659,"threshold_uncertainty_score":0.037275374},"labels":[],"label_agreement":null},{"id":"W1812405065","doi":"10.1007/978-3-642-04636-0_42","title":"Project-Based Collaborative Learning Environment with Context-Aware Educational Services","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Athabasca University","funders":"","keywords":"Computer science; Context (archaeology); Collaborative learning; Process (computing); Component (thermodynamics); Learning environment; Educational software; Task (project management); Software; Human–computer interaction; Software engineering; Knowledge management; Systems engineering; Mathematics education; Engineering","score_opus":0.010392343206485688,"score_gpt":0.24589102461520596,"score_spread":0.23549868140872027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1812405065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09550928,0.00022401057,0.86960834,0.00024487116,0.00010728094,0.00057974877,0.0003164649,0.008989709,0.024420243],"genre_scores_gemma":[0.5614336,0.00029314146,0.41144124,0.00014915438,0.00007159946,0.0013127909,0.0008896606,0.00035092037,0.02405783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985312,0.0005397936,0.00011172506,0.0002465738,0.00041599746,0.00015458118],"domain_scores_gemma":[0.9982843,0.00053024816,0.000104050625,0.00035483832,0.00020646318,0.00052006956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144704,0.00070045644,0.00067148067,0.0006570851,0.0010086952,0.0021384258,0.0020959845,0.0013261568,0.008571105],"category_scores_gemma":[0.00221075,0.000480775,0.0005924236,0.0009473613,0.00031888788,0.0021771912,0.005268289,0.0009396265,0.0029344298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00236575,0.0043723243,0.00830784,0.0006339616,0.0002154682,0.001528506,0.005386325,0.032255594,0.051932495,0.027866358,0.029122405,0.836013],"study_design_scores_gemma":[0.0016755728,0.0042303815,0.016060883,0.00028348112,0.000477599,0.005698135,0.0037628715,0.5974244,0.07335566,0.08296599,0.21362512,0.00043990978],"about_ca_topic_score_codex":0.0008679165,"about_ca_topic_score_gemma":0.00076095917,"teacher_disagreement_score":0.008571105,"about_ca_system_score_codex":0.00022420465,"about_ca_system_score_gemma":0.000991717,"threshold_uncertainty_score":0.028673232},"labels":[],"label_agreement":null},{"id":"W181263017","doi":"10.1007/978-3-642-24500-8_35","title":"VivoSpace: Towards Health Behavior Change Using Social Gaming","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Apprehension; Computer science; Leverage (statistics); Behavior change; Internet privacy; Process (computing); Social network (sociolinguistics); Domain (mathematical analysis); Human–computer interaction; World Wide Web; Social media; Psychology; Social psychology; Artificial intelligence; Cognitive psychology","score_opus":0.10216320325957069,"score_gpt":0.3648446215637274,"score_spread":0.2626814183041567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181263017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12341676,0.005844862,0.6171419,0.0072623,0.0014017912,0.0009454993,0.0028338141,0.020995712,0.22015734],"genre_scores_gemma":[0.35075486,0.0046269,0.5144215,0.0032215258,0.0003243852,0.0011923938,0.003681516,0.0013454873,0.120431475],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966633,0.00017206474,0.000012688329,0.000043542175,0.00008329924,0.000022148452],"domain_scores_gemma":[0.9996245,0.00024755334,0.000012563418,0.00004405561,0.000031248717,0.000040095423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010554006,0.0007642596,0.00022637524,0.00041953553,0.0002337894,0.0014151348,0.0010056343,0.00067911734,0.011960693],"category_scores_gemma":[0.0011474676,0.00020217203,0.00047062922,0.00022180624,0.00040205763,0.00085888826,0.0013799736,0.0008660099,0.001828539],"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.00022335249,0.0007825552,0.003962984,0.0003693176,0.00009649021,0.00008284346,0.0015750978,0.002195349,0.010400718,0.020083416,0.032741632,0.9274862],"study_design_scores_gemma":[0.00040170032,0.0021680123,0.031355575,0.00086738967,0.00026099433,0.0016692607,0.0024768617,0.061703008,0.026939584,0.076226674,0.79578143,0.00014962837],"about_ca_topic_score_codex":0.00152679,"about_ca_topic_score_gemma":0.003610832,"teacher_disagreement_score":0.011960693,"about_ca_system_score_codex":0.0002818693,"about_ca_system_score_gemma":0.0004545561,"threshold_uncertainty_score":0.04001248},"labels":[],"label_agreement":null},{"id":"W181282468","doi":"10.1007/978-3-642-31900-6_25","title":"A Spatial Clustering Method for Points-with-Directions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Trajectory; Point (geometry); Set (abstract data type); Data set; Data mining; Data point; Correlation clustering; Artificial intelligence; Algorithm; Mathematics","score_opus":0.024455545978639578,"score_gpt":0.27550299358854374,"score_spread":0.25104744760990416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181282468","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.00073190726,0.0000862328,0.99777526,0.00002178137,0.00004904254,0.000034975266,0.00006939534,0.0006963119,0.0005351231],"genre_scores_gemma":[0.010798411,0.00012171688,0.98557335,0.000026244868,0.00004281361,0.000097518765,0.00037093263,0.00028181952,0.0026871872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853504,0.00018962275,0.00008123754,0.00031940866,0.0007871583,0.00008757549],"domain_scores_gemma":[0.9986873,0.00025430697,0.000059431248,0.00033206306,0.00060833915,0.00005858104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011087856,0.0012585459,0.0015118222,0.0025418245,0.0014965108,0.0016217097,0.004052336,0.0014237759,0.007164376],"category_scores_gemma":[0.002836724,0.0009478913,0.002307874,0.0036417176,0.00092916534,0.001456477,0.0024648272,0.0017948219,0.0047328006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021645504,0.00012510945,0.0008792134,0.00037916077,0.00019535288,0.000109825145,0.00023123056,0.08007433,0.024037126,0.04932839,0.015587666,0.8288362],"study_design_scores_gemma":[0.000048991376,0.000074688185,0.00071764993,0.00003587124,0.00008486799,0.00038367818,0.00008815934,0.9186481,0.014282821,0.033995237,0.03155309,0.0000867525],"about_ca_topic_score_codex":0.007799975,"about_ca_topic_score_gemma":0.011389455,"teacher_disagreement_score":0.007799975,"about_ca_system_score_codex":0.0007138001,"about_ca_system_score_gemma":0.0016418564,"threshold_uncertainty_score":0.023967266},"labels":[],"label_agreement":null},{"id":"W1813146539","doi":"10.1007/978-3-540-88282-4_43","title":"Length Codes, Products of Languages and Primality","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University; Queen's University","funders":"","keywords":"Primality test; Catenation; Computer science; Extension (predicate logic); Prime (order theory); Code (set theory); Decomposition; Programming language; Prefix code; Regular language; Algebra over a field; Discrete mathematics; Arithmetic; Mathematics; Theoretical computer science; Automaton; Algorithm; Pure mathematics; Combinatorics; Linear code; Set (abstract data type)","score_opus":0.012823321688631656,"score_gpt":0.24395722421437444,"score_spread":0.23113390252574278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813146539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26749587,0.018378593,0.48352832,0.005887595,0.0012451819,0.00010822604,0.0007707708,0.0006380781,0.22194733],"genre_scores_gemma":[0.86151636,0.0070046284,0.07313625,0.00081859995,0.0017194276,0.00022805657,0.0005281096,0.0004678957,0.05458069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.00030096972,0.00008554101,0.00026297878,0.00039535944,0.00014132005],"domain_scores_gemma":[0.99573684,0.002862459,0.0003993901,0.00044383088,0.00034499553,0.00021248519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013752464,0.0006469064,0.0008300724,0.00166768,0.0015291556,0.0042914953,0.00083307154,0.0013263754,0.005386292],"category_scores_gemma":[0.006159839,0.00083457684,0.0007012309,0.0021354163,0.0057535623,0.008880281,0.0026317479,0.0035564408,0.0010317124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035422712,0.0000086342425,0.00011967989,0.000050201852,0.0000033466606,0.00002739274,0.00019071263,0.0006948974,0.0005341465,0.98821425,0.0009366829,0.009184577],"study_design_scores_gemma":[0.000005006798,0.000009309593,0.00005419944,0.000010456959,0.0000036837487,0.0000724578,0.000028149158,0.0007858461,0.00032702633,0.99580306,0.0028943706,0.0000065434238],"about_ca_topic_score_codex":0.00038392734,"about_ca_topic_score_gemma":0.00034647615,"teacher_disagreement_score":0.005386292,"about_ca_system_score_codex":0.0013339523,"about_ca_system_score_gemma":0.00071632315,"threshold_uncertainty_score":0.018018961},"labels":[],"label_agreement":null},{"id":"W1813387235","doi":"10.1007/3-540-39963-1_13","title":"Rule Quality Measures Improve the Accuracy of Rule Induction: An Experimental Approach","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rule induction; Computer science; Rule-based system; Quality (philosophy); Selection (genetic algorithm); Set (abstract data type); Data mining; Decision rule; Artificial intelligence; Machine learning","score_opus":0.04862834088733833,"score_gpt":0.3079711532364283,"score_spread":0.25934281234909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813387235","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.8555215,0.00375989,0.12676282,0.0008503224,0.0006871105,0.0008551114,0.0030292592,0.0025582884,0.005975721],"genre_scores_gemma":[0.85193837,0.0005296703,0.13946125,0.00021921615,0.00021556288,0.00036361342,0.0040172143,0.0007410038,0.0025139644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98365223,0.0065081813,0.0021690927,0.002218567,0.004945672,0.0005062791],"domain_scores_gemma":[0.7244005,0.2249413,0.0073970095,0.021120293,0.02071337,0.0014275531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022229256,0.0016213568,0.0021863023,0.0030070867,0.0009957915,0.0029267846,0.0025146238,0.0023141736,0.0040170853],"category_scores_gemma":[0.10519464,0.00063137495,0.0014171455,0.0031444305,0.0013356451,0.0035968309,0.0016924903,0.0023419913,0.001261598],"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.025414143,0.011928804,0.050092023,0.003171619,0.0025640333,0.00051118823,0.0014672652,0.07898052,0.06723789,0.004929427,0.011354194,0.74234885],"study_design_scores_gemma":[0.0027535362,0.015538344,0.03790887,0.00024080032,0.0030938426,0.0009878793,0.00088436884,0.75148356,0.16434702,0.016936164,0.0054907287,0.0003348673],"about_ca_topic_score_codex":0.0021848693,"about_ca_topic_score_gemma":0.002381435,"teacher_disagreement_score":0.022229256,"about_ca_system_score_codex":0.0012250072,"about_ca_system_score_gemma":0.0009809405,"threshold_uncertainty_score":0.11756092},"labels":[],"label_agreement":null},{"id":"W1813891131","doi":"10.1007/11499169_5","title":"A High-Throughput Overlay Multicast Infrastructure with Network Coding","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Multicast; Computer network; Overlay network; Overlay; Overlay multicast; Distributed computing; Coding (social sciences); Throughput; Source-specific multicast; Reliable multicast; Wireless; Telecommunications; The Internet; Network packet","score_opus":0.017713014984501205,"score_gpt":0.24972425097530032,"score_spread":0.23201123599079912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813891131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063125044,0.00049964443,0.913811,0.0005234673,0.00020072602,0.00022344416,0.0002638859,0.004336207,0.017016547],"genre_scores_gemma":[0.70380145,0.00036251193,0.28948632,0.00010580413,0.00015056369,0.00020089779,0.00038882042,0.00017679902,0.0053268145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931455,0.00014321358,0.00002984507,0.00006924161,0.00033948914,0.00010353171],"domain_scores_gemma":[0.99848986,0.00039662045,0.00008514859,0.00053674413,0.00037350936,0.00011817981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008377694,0.0004899269,0.0006661894,0.0012306308,0.0008587337,0.00112411,0.002049378,0.00083261484,0.0026932878],"category_scores_gemma":[0.0025743456,0.00038213303,0.00033938704,0.0014638319,0.0006050391,0.0019112008,0.0024541786,0.0012533517,0.00079279783],"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.00080644374,0.00057017646,0.0010966171,0.00032088917,0.00010306003,0.0006476714,0.0002866382,0.26671207,0.10548161,0.21852769,0.025183221,0.380264],"study_design_scores_gemma":[0.00006061698,0.00015415155,0.00026891584,0.000024685638,0.000042027743,0.00024079288,0.000034002787,0.9356242,0.01883346,0.035418097,0.009258986,0.000040127135],"about_ca_topic_score_codex":0.0017984401,"about_ca_topic_score_gemma":0.0024621484,"teacher_disagreement_score":0.0026932878,"about_ca_system_score_codex":0.0011932884,"about_ca_system_score_gemma":0.001117913,"threshold_uncertainty_score":0.009009957},"labels":[],"label_agreement":null},{"id":"W1814035124","doi":"10.1007/3-540-44983-3_12","title":"A Global PMI for Electronic Content Distribution","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Rights Management and 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":"Entrust (Canada)","funders":"","keywords":"Computer science; Content distribution; Content (measure theory); Distribution (mathematics); Computer network; Mathematics","score_opus":0.02150991522031261,"score_gpt":0.2396099073940892,"score_spread":0.21809999217377657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814035124","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.003678214,0.0035377864,0.18860818,0.006321355,0.0045762127,0.0005099898,0.0007435928,0.009601689,0.7824231],"genre_scores_gemma":[0.064471416,0.004778102,0.1253353,0.002661935,0.0026543732,0.00070671213,0.0017010538,0.002591253,0.79509985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991492,0.00016251788,0.0000330974,0.00012200779,0.0004313186,0.00010181852],"domain_scores_gemma":[0.9991456,0.0001193222,0.00004316251,0.00028201911,0.0002402338,0.00016970203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910381,0.00082260143,0.00041228157,0.0019438436,0.0012491703,0.0029891531,0.0011698256,0.0018475695,0.07868544],"category_scores_gemma":[0.0022795582,0.00041027594,0.00035895983,0.001870028,0.0009093631,0.0057994244,0.0029430478,0.002513452,0.037263326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010882675,0.00009364147,0.00031125586,0.00020458271,0.0000060845373,0.00011347305,0.00015018035,0.0004788003,0.0039128815,0.20254628,0.2878719,0.5042021],"study_design_scores_gemma":[0.000023312328,0.00010572882,0.00052256667,0.00008006406,0.000007054522,0.00038549607,0.00004824552,0.0015092781,0.002243467,0.019578436,0.97548103,0.000015270149],"about_ca_topic_score_codex":0.00050569436,"about_ca_topic_score_gemma":0.00094163715,"teacher_disagreement_score":0.07868544,"about_ca_system_score_codex":0.00091000536,"about_ca_system_score_gemma":0.0013874592,"threshold_uncertainty_score":0.263229},"labels":[],"label_agreement":null},{"id":"W1814275833","doi":"10.1007/978-3-642-14052-5_27","title":"On the Formalization of the Lebesgue Integration Theory in HOL","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Concordia University","funders":"","keywords":"Lebesgue integration; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.012409064469060387,"score_gpt":0.2241418883832711,"score_spread":0.2117328239142107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814275833","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.02843676,0.008289541,0.70156395,0.007231639,0.001080509,0.000087609886,0.0003366983,0.00057226367,0.25240102],"genre_scores_gemma":[0.7750868,0.005743812,0.16217911,0.0022498453,0.0022459824,0.0002669735,0.0005688779,0.00069354725,0.050965033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998953,0.0003913174,0.00006965639,0.00013310908,0.00032358663,0.0001293328],"domain_scores_gemma":[0.99854654,0.0008364498,0.00008248703,0.0002384266,0.00019994452,0.000096058386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023261805,0.00074800913,0.001206673,0.0020721683,0.002083512,0.004719249,0.0016018503,0.0014888403,0.006871131],"category_scores_gemma":[0.0029656896,0.0006391004,0.00158628,0.001969401,0.008979915,0.011126482,0.0031242233,0.006322088,0.001135011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003990093,0.0000036415888,0.000014031699,0.000010337913,0.0000019455993,0.000010572114,0.000051287807,0.00019910636,0.000057875273,0.9979327,0.0003716969,0.0013427464],"study_design_scores_gemma":[0.0000040589875,0.000003423164,0.00003105645,0.000010329098,0.0000020276198,0.000014674953,0.000018195022,0.0011798242,0.00007552509,0.99542,0.00323701,0.0000038155463],"about_ca_topic_score_codex":0.0015942947,"about_ca_topic_score_gemma":0.0014403324,"teacher_disagreement_score":0.006871131,"about_ca_system_score_codex":0.0028770182,"about_ca_system_score_gemma":0.0009127903,"threshold_uncertainty_score":0.022986233},"labels":[],"label_agreement":null},{"id":"W1814905144","doi":"10.1007/978-3-642-02658-4_11","title":"Explaining Counterexamples Using Causality","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Counterexample; TRACE (psycholinguistics); Computer science; Causality (physics); Set (abstract data type); Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics","score_opus":0.07332092788385225,"score_gpt":0.32067037289480216,"score_spread":0.2473494450109499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814905144","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.051665585,0.000548334,0.88784987,0.0025082426,0.000545622,0.00018860096,0.00038579528,0.006014084,0.050293807],"genre_scores_gemma":[0.7141605,0.0007580229,0.26225588,0.0006029378,0.00015708675,0.00019320284,0.00060076,0.0017237334,0.019547822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998582,0.00043634442,0.000090581605,0.00027420346,0.000411927,0.00020503115],"domain_scores_gemma":[0.9882081,0.009641064,0.00036672494,0.0012152911,0.00045607676,0.00011264548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017584062,0.0012892061,0.0007310675,0.0023383063,0.0013645906,0.00272211,0.0015774184,0.0025548064,0.022678778],"category_scores_gemma":[0.015221023,0.0009616439,0.0018350903,0.001494007,0.003107476,0.008268015,0.0029538933,0.0031779471,0.0015924672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001487157,0.00006671904,0.0010800705,0.00022331387,0.00003136691,0.0009811905,0.0009033084,0.0134006785,0.0027761504,0.9345152,0.0049159047,0.04095737],"study_design_scores_gemma":[0.00003926683,0.000026677786,0.00023297522,0.0001109761,0.0000660875,0.00053083274,0.00024243061,0.07656246,0.0076284115,0.89313275,0.021384887,0.000042129974],"about_ca_topic_score_codex":0.0016029151,"about_ca_topic_score_gemma":0.0016592512,"teacher_disagreement_score":0.022678778,"about_ca_system_score_codex":0.00086327054,"about_ca_system_score_gemma":0.0009100396,"threshold_uncertainty_score":0.07586801},"labels":[],"label_agreement":null},{"id":"W1814946086","doi":"10.1007/978-3-642-15597-0_45","title":"An Autonomy-Oriented Computing Mechanism for Modeling the Formation of Energy Distribution Networks: Crude Oil Distribution in U.S. and Canada","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Slime Mold and Myxomycetes Research","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Mechanism (biology); Energy consumption; Distribution (mathematics); Autonomy; Energy (signal processing); Consumption (sociology); Foraging; Work (physics); Distributed computing; Operations research; Engineering","score_opus":0.008341648930292565,"score_gpt":0.2134842929794842,"score_spread":0.20514264404919164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814946086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12846033,0.00043339486,0.83864063,0.0014616981,0.00013951685,0.00017598594,0.0010082553,0.0015881199,0.028091997],"genre_scores_gemma":[0.8626372,0.000490263,0.1276542,0.00008056182,0.00003436907,0.00020667691,0.00038217695,0.000117409734,0.008397172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998903,0.000022104792,0.000005737033,0.000023721337,0.000031395946,0.000026757694],"domain_scores_gemma":[0.99980336,0.00005537695,0.000019578994,0.000024660401,0.00006440327,0.00003269547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038717964,0.0004395657,0.00038583935,0.00040197908,0.0012732962,0.0013106014,0.0021874928,0.0008171709,0.0022247878],"category_scores_gemma":[0.0008574018,0.0003321046,0.000629776,0.0005886149,0.001277447,0.0010504489,0.0010026705,0.0008795916,0.00022601052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001739963,0.000012800035,0.0007393179,0.00001635907,0.000012734699,0.0000359829,0.00009386957,0.94192594,0.0006029158,0.05170497,0.00092213,0.003915529],"study_design_scores_gemma":[0.000005852527,0.000004467275,0.00011914957,0.0000028378215,0.0000054529137,0.0000060723255,0.000024379602,0.98985845,0.0002039232,0.008007353,0.0017578887,0.000004087909],"about_ca_topic_score_codex":0.38006836,"about_ca_topic_score_gemma":0.3269079,"teacher_disagreement_score":0.61993164,"about_ca_system_score_codex":0.0029732962,"about_ca_system_score_gemma":0.0051789214,"threshold_uncertainty_score":0.7557123},"labels":[],"label_agreement":null},{"id":"W181500213","doi":"10.1007/978-3-319-14472-6_18","title":"Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Rendezvous; Computer science; Node (physics); Oracle; Traverse; Network topology; Computer network; Theoretical computer science; Topology (electrical circuits); Mathematics; Combinatorics; Geography","score_opus":0.02409095994760135,"score_gpt":0.25103313663737603,"score_spread":0.22694217668977468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181500213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39051035,0.008929308,0.4243317,0.0035633787,0.00037220318,0.00016344745,0.0006858666,0.0016074884,0.16983621],"genre_scores_gemma":[0.96046764,0.0010673353,0.028152937,0.00008157665,0.00009372542,0.000036834757,0.00015626125,0.00023033429,0.009713353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833655,0.00049284624,0.00006046756,0.00020700417,0.0005540596,0.0003489977],"domain_scores_gemma":[0.98301125,0.014055016,0.00048447278,0.0013834897,0.0006769712,0.0003888837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023064164,0.0008564648,0.001503978,0.0014903871,0.0008718947,0.0034701333,0.002503955,0.0023109897,0.018435717],"category_scores_gemma":[0.022354884,0.0006942409,0.00067771494,0.0014386907,0.0017645672,0.0075214617,0.0024159877,0.0015824444,0.0016309262],"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.0036858749,0.00027342862,0.0023874105,0.000664042,0.00015553946,0.00039571486,0.00037705127,0.3259463,0.01753339,0.41329676,0.0062644454,0.22902009],"study_design_scores_gemma":[0.00016599336,0.00042244748,0.002239932,0.00012618731,0.00014292666,0.00075667887,0.0004331007,0.6482343,0.007504228,0.3350454,0.004808189,0.000120691475],"about_ca_topic_score_codex":0.0015695653,"about_ca_topic_score_gemma":0.0021019932,"teacher_disagreement_score":0.018435717,"about_ca_system_score_codex":0.0012695579,"about_ca_system_score_gemma":0.0007960333,"threshold_uncertainty_score":0.06167364},"labels":[],"label_agreement":null},{"id":"W1815097100","doi":"10.1007/978-3-540-25969-5_84","title":"An Improved ILP Formulation for Path Protection in WDM Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Windsor","funders":"","keywords":"Heuristics; Computer science; Wavelength-division multiplexing; Integer programming; Path (computing); Path protection; Mathematical optimization; Integer (computer science); Distributed computing; Computer network; Algorithm; Mathematics","score_opus":0.010835961364151573,"score_gpt":0.22438644093210747,"score_spread":0.2135504795679559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1815097100","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.005737092,0.00033734232,0.98168015,0.00043877578,0.00019992188,0.00011082616,0.00019488789,0.00018548635,0.011115545],"genre_scores_gemma":[0.32135236,0.0007143753,0.65889376,0.0005015972,0.000389013,0.0005469395,0.0004978922,0.00034340261,0.016760642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00021190848,0.00001972184,0.00007641848,0.000170182,0.000093535455],"domain_scores_gemma":[0.9990344,0.0006855073,0.000046083616,0.000051705934,0.00015100684,0.00003125375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053383,0.0011940582,0.0011464761,0.00054720195,0.0004760653,0.0013338431,0.0015887355,0.0016198463,0.011536651],"category_scores_gemma":[0.0028829172,0.00069282856,0.00085719506,0.0007949273,0.00067845616,0.0013532072,0.0011214339,0.0021060589,0.0009031826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004420422,0.000056222652,0.000068842484,0.00013260274,0.000014540544,0.00007057949,0.0000327906,0.9461665,0.00088324334,0.021526873,0.0037756024,0.02722796],"study_design_scores_gemma":[0.000012932714,0.00001516263,0.000017948445,0.000009713119,0.0000048370052,0.000009799687,0.0000086412265,0.99001676,0.00016007548,0.008769865,0.0009717358,0.000002504122],"about_ca_topic_score_codex":0.0032535566,"about_ca_topic_score_gemma":0.0040900195,"teacher_disagreement_score":0.011536651,"about_ca_system_score_codex":0.0010587112,"about_ca_system_score_gemma":0.0013120165,"threshold_uncertainty_score":0.038593948},"labels":[],"label_agreement":null},{"id":"W181609631","doi":"10.1007/978-3-319-05810-8_28","title":"Monitoring Probabilistic Threshold SUM Query Processing in Uncertain Streams","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Scalability; Data stream mining; Probability distribution; Data mining; Stream processing; Computation; Theoretical computer science; Algorithm; Distributed computing; Artificial intelligence; Database","score_opus":0.025054234627576583,"score_gpt":0.25891524561035056,"score_spread":0.23386101098277398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181609631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16182123,0.0012891513,0.8318472,0.0005587929,0.00014612367,0.00009530772,0.00033131897,0.0020319277,0.0018790074],"genre_scores_gemma":[0.92967784,0.00036509076,0.067614354,0.00011090986,0.00020827953,0.00007035306,0.00040740223,0.00016384272,0.0013820098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952335,0.00080221577,0.00031573657,0.00086797844,0.00239362,0.00038698543],"domain_scores_gemma":[0.98908573,0.0072064055,0.00089867914,0.0010522462,0.0013648098,0.00039218322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035438638,0.00096513086,0.0019288723,0.0010424714,0.00087887567,0.0030043814,0.0028525873,0.0014280357,0.0014123047],"category_scores_gemma":[0.018399153,0.000715644,0.0004276787,0.0023366248,0.0009915498,0.0045994706,0.0022954894,0.0018523292,0.00043536632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004274934,0.00047540004,0.0133460695,0.00042959608,0.0002033352,0.0005414784,0.00043847895,0.6525105,0.046938956,0.029050939,0.006829335,0.24496093],"study_design_scores_gemma":[0.000010057883,0.000041390856,0.0003234136,0.0000035259313,0.000009845433,0.00007187445,0.000023439086,0.9881467,0.0038039393,0.007364476,0.00019543277,0.000005848611],"about_ca_topic_score_codex":0.0017190418,"about_ca_topic_score_gemma":0.0012644526,"teacher_disagreement_score":0.0035438638,"about_ca_system_score_codex":0.0013020178,"about_ca_system_score_gemma":0.0010160906,"threshold_uncertainty_score":0.018741965},"labels":[],"label_agreement":null},{"id":"W1816145465","doi":"10.1007/978-3-662-44777-2_46","title":"Ordering without Forbidden Patterns","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Graph; Discrete mathematics","score_opus":0.022712947709002854,"score_gpt":0.2848081149853978,"score_spread":0.262095167276395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816145465","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039149076,0.0014794029,0.15790537,0.001941417,0.0013964358,0.00015545115,0.002129703,0.0008851708,0.794958],"genre_scores_gemma":[0.3314794,0.0034111342,0.12639274,0.0013015791,0.00086781126,0.00026490635,0.0061720028,0.0014922614,0.5286182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994735,0.00007425826,0.000034416713,0.00014058319,0.00018218199,0.00009502559],"domain_scores_gemma":[0.99919707,0.00023537256,0.000058768892,0.00024807366,0.00017737632,0.000083386876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028531958,0.00074147334,0.0006232933,0.0014574579,0.0018422429,0.0022374187,0.0007958289,0.0006445441,0.028092736],"category_scores_gemma":[0.0013704187,0.0006517013,0.00061375526,0.0023347393,0.0013563385,0.0037373675,0.001360492,0.0026169664,0.009743486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630351,0.0000508162,0.00015155645,0.00014608745,0.000010203105,0.00014907565,0.00023947183,0.00063857384,0.0025142212,0.9068322,0.023393016,0.06579847],"study_design_scores_gemma":[0.000009283381,0.000013252355,0.00009446806,0.00002794831,0.000008210074,0.00019159223,0.000059246755,0.00078309677,0.0015082628,0.9366608,0.06063469,0.0000090396825],"about_ca_topic_score_codex":0.00087878865,"about_ca_topic_score_gemma":0.0015215534,"teacher_disagreement_score":0.028092736,"about_ca_system_score_codex":0.0007696801,"about_ca_system_score_gemma":0.0008965928,"threshold_uncertainty_score":0.0939796},"labels":[],"label_agreement":null},{"id":"W1816723967","doi":"10.1007/978-3-540-92698-6_5","title":"Consistency between Task Models and Use Cases","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Concordia University","funders":"","keywords":"Computer science; Consistency (knowledge bases); Notation; Task (project management); Interface (matter); Semantics (computer science); Documentation; Software engineering; User interface; Point (geometry); Programming language; Causal consistency; Consistency model; Human–computer interaction; Artificial intelligence; Sequential consistency; Systems engineering","score_opus":0.07517510705489282,"score_gpt":0.26507482136047883,"score_spread":0.189899714305586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816723967","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.10764543,0.0010750446,0.86424345,0.0010721191,0.0002067687,0.0008439611,0.0024390449,0.0034001532,0.019073967],"genre_scores_gemma":[0.8122834,0.00045472258,0.17325664,0.00032812732,0.00012320961,0.001073781,0.0069741122,0.0016722017,0.0038338671],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9246836,0.030211829,0.0075432793,0.012195141,0.023309562,0.0020565959],"domain_scores_gemma":[0.5640517,0.30733323,0.016428748,0.075984746,0.03472232,0.0014793422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03463081,0.0009785732,0.0015036223,0.004073489,0.0012744477,0.009926685,0.0042011244,0.0026508686,0.0055178264],"category_scores_gemma":[0.36715755,0.0025391525,0.0020327854,0.0030908128,0.0030337956,0.01870359,0.0047004065,0.004214315,0.0022213429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004294451,0.00119928,0.10151212,0.002453811,0.0011364407,0.0010566564,0.016787674,0.06261417,0.018013474,0.2477417,0.018174374,0.52501583],"study_design_scores_gemma":[0.00036980322,0.00040935358,0.044150636,0.0009780003,0.00090027397,0.0013848874,0.0037042426,0.26725987,0.020439636,0.63154304,0.028602136,0.0002581965],"about_ca_topic_score_codex":0.0030266002,"about_ca_topic_score_gemma":0.0021867175,"teacher_disagreement_score":0.03463081,"about_ca_system_score_codex":0.0023603004,"about_ca_system_score_gemma":0.0035366153,"threshold_uncertainty_score":0.18314737},"labels":[],"label_agreement":null},{"id":"W1817101438","doi":"10.1007/978-3-642-37057-1_8","title":"Towards Understanding the Behavior of Classes Using Probabilistic Models of Program Inputs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Université de Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Set (abstract data type); Variable (mathematics); Coupling (piping); Theoretical computer science; Probability distribution; Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.08997228213455946,"score_gpt":0.31282967490161007,"score_spread":0.2228573927670506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817101438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006978229,0.00024048775,0.9898189,0.0003476226,0.000017589233,0.00004823687,0.00024124487,0.000885955,0.0014217352],"genre_scores_gemma":[0.24017549,0.0014006431,0.75002974,0.0003231689,0.00012702441,0.00034229865,0.0012740797,0.0010092487,0.005318263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767095,0.0006321574,0.0001733891,0.000648028,0.0006795087,0.00019604436],"domain_scores_gemma":[0.9894406,0.0069895666,0.0008897468,0.0018231348,0.00060000207,0.00025703027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027077417,0.0018199517,0.0014994843,0.002172549,0.00085893617,0.0053702625,0.00450537,0.0029238225,0.0057858424],"category_scores_gemma":[0.014502012,0.0026042378,0.0045217127,0.0018003116,0.0025352465,0.015144141,0.0029486907,0.0064091845,0.0014222737],"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.00011418922,0.0001974493,0.004641186,0.00048983,0.000159569,0.00018540678,0.0011655844,0.29307902,0.00584077,0.579018,0.0036308437,0.11147812],"study_design_scores_gemma":[0.000008805626,0.000015593727,0.0003219547,0.000041832944,0.000037505677,0.000050979896,0.0000558931,0.658796,0.0011524293,0.33669433,0.0028048477,0.000019769514],"about_ca_topic_score_codex":0.007968132,"about_ca_topic_score_gemma":0.010361598,"teacher_disagreement_score":0.007968132,"about_ca_system_score_codex":0.0025074126,"about_ca_system_score_gemma":0.0022137223,"threshold_uncertainty_score":0.019355595},"labels":[],"label_agreement":null},{"id":"W1817149645","doi":"10.1007/978-3-642-21593-3_34","title":"Dictionary Learning in Texture Classification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Texture (cosmology); Dictionary learning; Pattern recognition (psychology); Natural language processing; Image (mathematics)","score_opus":0.02817092203169497,"score_gpt":0.2519435173351485,"score_spread":0.22377259530345356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817149645","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.004013742,0.005938314,0.9844067,0.00033668417,0.00028470895,0.0000253113,0.00016252235,0.00048248484,0.0043496126],"genre_scores_gemma":[0.15094149,0.01488578,0.7860125,0.0004486889,0.0008752815,0.00017138249,0.0012260473,0.0005040917,0.04493472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997414,0.000059670347,0.000016953825,0.000056839915,0.000100327314,0.00002478125],"domain_scores_gemma":[0.9995117,0.00023031105,0.000027135397,0.00011251611,0.000097587756,0.00002074425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042197175,0.00042947737,0.0012133614,0.00076563365,0.00028619764,0.0011411047,0.001019822,0.00075254525,0.0058516194],"category_scores_gemma":[0.001384885,0.0003715209,0.00049256464,0.002004303,0.00069474726,0.0012227066,0.0010368397,0.0013087739,0.002276449],"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.000057976893,0.00003986822,0.00028671767,0.00034009884,0.000042331452,0.000048726222,0.000049439957,0.043611698,0.007909202,0.067761324,0.017462887,0.8623898],"study_design_scores_gemma":[0.000020534539,0.00006164826,0.0005164872,0.00006816861,0.00003486204,0.0002212137,0.00004696576,0.83800393,0.008464281,0.114455834,0.038079124,0.000026928095],"about_ca_topic_score_codex":0.0023547772,"about_ca_topic_score_gemma":0.0024254264,"teacher_disagreement_score":0.0058516194,"about_ca_system_score_codex":0.00036487973,"about_ca_system_score_gemma":0.00031486875,"threshold_uncertainty_score":0.019575655},"labels":[],"label_agreement":null},{"id":"W1817851888","doi":"10.1007/978-3-642-36763-2_17","title":"On Representing Graphs by Touching Cuboids","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Queen's University; University of British Columbia; University of Victoria; University of New Brunswick","funders":"","keywords":"Cuboid; Mathematics; Rectangle; Combinatorics; Disjoint sets; Graph; Unit cube; Intersection (aeronautics); Representation (politics); Planar graph; Geometry; Engineering","score_opus":0.01284476302467643,"score_gpt":0.2417111072095744,"score_spread":0.22886634418489796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817851888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074621835,0.00043128018,0.98035634,0.00017518488,0.00011509851,0.00004648188,0.00023610512,0.0018072776,0.009370138],"genre_scores_gemma":[0.14188097,0.0018041348,0.83535326,0.0002953289,0.000080991915,0.00024775328,0.0013854293,0.0016588797,0.017293293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996792,0.00009232109,0.00002236825,0.000072602,0.00009680207,0.000036736805],"domain_scores_gemma":[0.99928266,0.00029617845,0.000038033308,0.00022973031,0.000111196634,0.000042294527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004147312,0.0010881138,0.0011362431,0.0013429328,0.00086990686,0.0023534724,0.0019956545,0.001038592,0.01082869],"category_scores_gemma":[0.0022227522,0.0007269879,0.0010815206,0.002827665,0.0011990686,0.0048392625,0.0034051037,0.0020091208,0.0023043882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015313776,0.000042068936,0.00027022036,0.0003620499,0.00004060348,0.00014844291,0.0008286433,0.17423667,0.0060006604,0.53848475,0.01450235,0.2649305],"study_design_scores_gemma":[0.00002206002,0.000033322092,0.00008186011,0.00012267524,0.000028993118,0.00014664153,0.00026241856,0.5004873,0.0037373628,0.444391,0.050651494,0.000034752145],"about_ca_topic_score_codex":0.0049091964,"about_ca_topic_score_gemma":0.005001399,"teacher_disagreement_score":0.01082869,"about_ca_system_score_codex":0.0006672732,"about_ca_system_score_gemma":0.0003341776,"threshold_uncertainty_score":0.036225617},"labels":[],"label_agreement":null},{"id":"W1817978457","doi":"10.1007/3-540-40064-8_17","title":"Efficient Communication in Unknown Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Broadcasting (networking); Synchronization (alternating current); Dissemination; Node (physics); Overhead (engineering); Computer network; Network topology; Constant (computer programming); Distributed computing; Simple (philosophy); Broadcast communication network; State (computer science); Theoretical computer science; Telecommunications network; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics","score_opus":0.010458574356660501,"score_gpt":0.22980066903922314,"score_spread":0.21934209468256263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817978457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020935165,0.0034744202,0.92889076,0.0012163044,0.00030206327,0.000052547675,0.00013423126,0.00086054293,0.04413402],"genre_scores_gemma":[0.6495775,0.007550181,0.26181084,0.00041704052,0.00074058276,0.00024219185,0.0005589327,0.00046340865,0.078639306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928325,0.00019198927,0.000029758958,0.00011570426,0.00028492403,0.00009429621],"domain_scores_gemma":[0.9984124,0.0008729892,0.000076487355,0.00048093597,0.00010997039,0.000047227768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064441696,0.00062672346,0.00084515155,0.0007311155,0.0008532623,0.0019808495,0.0012375761,0.0010897783,0.006427496],"category_scores_gemma":[0.00313693,0.0005020253,0.00031891675,0.0012814422,0.0016155859,0.004399701,0.0023564533,0.0016799482,0.0013868787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016952594,0.000054233944,0.00018646201,0.0002651449,0.000034611025,0.00008902993,0.00017222532,0.15189147,0.005411117,0.65464574,0.012159244,0.1749213],"study_design_scores_gemma":[0.00002611887,0.000039969967,0.00017666703,0.00004004204,0.000021646201,0.00016155867,0.000056764045,0.44223282,0.0043756044,0.52796006,0.024892943,0.000015807893],"about_ca_topic_score_codex":0.0004062738,"about_ca_topic_score_gemma":0.00050954876,"teacher_disagreement_score":0.006427496,"about_ca_system_score_codex":0.00062817545,"about_ca_system_score_gemma":0.00043340115,"threshold_uncertainty_score":0.021502137},"labels":[],"label_agreement":null},{"id":"W1818701913","doi":"10.1007/978-3-319-22723-8_85","title":"Tutorial on Human Computer Interaction for Third Places - THCI-3P","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Universidade de São Paulo; Massachusetts Institute of Technology","keywords":"Computer science; Intersection (aeronautics); Information and Communications Technology; Human–computer interaction; Work (physics); Data science; World Wide Web; Knowledge management","score_opus":0.05083415355786311,"score_gpt":0.32540162135078987,"score_spread":0.27456746779292673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1818701913","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035822568,0.027858425,0.36605155,0.0017809146,0.008460679,0.00042158188,0.003126312,0.018011864,0.5707064],"genre_scores_gemma":[0.01107356,0.017370425,0.06364928,0.0005970403,0.0015324785,0.00039283204,0.0043551438,0.0037168318,0.89731234],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975497,0.000026235373,0.000008923327,0.00004806717,0.00013057864,0.000031189764],"domain_scores_gemma":[0.99970645,0.00006540172,0.000008113286,0.000037536312,0.00009283958,0.00008965703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003586282,0.0016448214,0.0008873393,0.0009204171,0.0006191384,0.0016622397,0.0012421819,0.0009976246,0.24613824],"category_scores_gemma":[0.00052821625,0.00043732752,0.00078550726,0.0014648625,0.00023792026,0.0017468958,0.0021895438,0.0014792024,0.12889725],"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.00005028754,0.000090071604,0.000083275925,0.00037687918,0.000016355178,0.00008000614,0.00012459587,0.0014998956,0.0056430423,0.006940416,0.4893309,0.49576426],"study_design_scores_gemma":[0.000012636938,0.0000647947,0.0005053886,0.00019350047,0.00001253024,0.00030105692,0.000050530067,0.0022791876,0.002016479,0.004654964,0.98988956,0.000019411715],"about_ca_topic_score_codex":0.0013829403,"about_ca_topic_score_gemma":0.0034075335,"teacher_disagreement_score":0.24613824,"about_ca_system_score_codex":0.00045056292,"about_ca_system_score_gemma":0.0006818228,"threshold_uncertainty_score":0.82341444},"labels":[],"label_agreement":null},{"id":"W181900640","doi":"10.1007/978-3-642-24403-2_1","title":"Elastic Phoenix: Malleable MapReduce for Shared-Memory Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":11,"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":"Phoenix; Computer science; Offset (computer science); Workload; Operating system; Distributed computing; Parallel computing","score_opus":0.021741600330723854,"score_gpt":0.22411462333696508,"score_spread":0.20237302300624121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181900640","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.012418578,0.0022984047,0.836937,0.0009921422,0.0006823408,0.00035731806,0.002314369,0.073112845,0.070886925],"genre_scores_gemma":[0.15430981,0.0031986414,0.6283318,0.00088067644,0.0004024597,0.0003451159,0.008715285,0.013718766,0.19009748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966025,0.00002309972,0.000018910057,0.000056509725,0.00018799856,0.00005314803],"domain_scores_gemma":[0.9998031,0.000036993522,0.000008779151,0.000072897135,0.000050247603,0.000027828653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003527613,0.00071484066,0.00043686794,0.0004066396,0.00044789273,0.0013857208,0.001982382,0.0005511054,0.016574949],"category_scores_gemma":[0.00079309964,0.00066428806,0.00054953917,0.0008953772,0.00030921827,0.0017855179,0.0013218165,0.0016876848,0.008185057],"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.00046105238,0.00024024701,0.00046877,0.0007231215,0.00011032518,0.0002646754,0.00024008371,0.022328675,0.027774824,0.049292848,0.3341739,0.56392145],"study_design_scores_gemma":[0.00020465671,0.0001335546,0.0013359415,0.00011378581,0.000064062835,0.00068349467,0.000103743354,0.1429695,0.059861667,0.07557598,0.71883833,0.00011530904],"about_ca_topic_score_codex":0.0016487766,"about_ca_topic_score_gemma":0.0022946794,"teacher_disagreement_score":0.016574949,"about_ca_system_score_codex":0.00041791968,"about_ca_system_score_gemma":0.000578464,"threshold_uncertainty_score":0.05544871},"labels":[],"label_agreement":null},{"id":"W1819025800","doi":"10.1007/978-3-540-89796-5_36","title":"A Collaborative Bayesian Image Annotation Framework","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Annotation; Automatic image annotation; Context (archaeology); Information retrieval; Domain (mathematical analysis); Bayesian probability; Probabilistic logic; Image (mathematics); Bayesian network; Artificial intelligence; Image retrieval","score_opus":0.01069996890254083,"score_gpt":0.2599871125160127,"score_spread":0.24928714361347187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819025800","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.00083623023,0.00019345323,0.9969752,0.00011466688,0.000022481483,0.000032671644,0.000073497744,0.00037073213,0.0013810529],"genre_scores_gemma":[0.0996887,0.00068569416,0.8868413,0.00023615628,0.00018097079,0.00028763647,0.0008239964,0.0003845125,0.010871044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961972,0.0012885473,0.00017442666,0.0008311929,0.0012510212,0.0002575964],"domain_scores_gemma":[0.99585825,0.0020186251,0.00018031335,0.00074727193,0.0010293653,0.00016614112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00504817,0.0011729867,0.0021169954,0.0021629662,0.0013826519,0.0030222135,0.005609584,0.0033828346,0.008198364],"category_scores_gemma":[0.01101316,0.0014160905,0.0019644885,0.0031407003,0.0015357396,0.0049267495,0.0043282355,0.002532525,0.003173668],"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.00034505254,0.00029458624,0.0007269614,0.00026888278,0.00022824443,0.00024977638,0.00041540342,0.19519162,0.0052558887,0.21325582,0.017967936,0.56579983],"study_design_scores_gemma":[0.00003120072,0.00003322158,0.00016431397,0.000029208792,0.00006092735,0.00012438996,0.00003319846,0.86659926,0.0020406793,0.122821085,0.008025577,0.000037045804],"about_ca_topic_score_codex":0.014031024,"about_ca_topic_score_gemma":0.016577119,"teacher_disagreement_score":0.014031024,"about_ca_system_score_codex":0.0015245874,"about_ca_system_score_gemma":0.0024977445,"threshold_uncertainty_score":0.027898729},"labels":[],"label_agreement":null},{"id":"W1819272977","doi":"10.1007/978-3-642-32820-6_23","title":"A Practical Approach to DOACROSS Parallelization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"IBM (Canada)","funders":"","keywords":"Computer science; Automatic parallelization; Parallel computing; Compiler; Multi-core processor; Thread (computing); Synchronization (alternating current); Task parallelism; Nested loop join; Parallelism (grammar); Programming language","score_opus":0.03802015673996617,"score_gpt":0.30408009226269583,"score_spread":0.26605993552272966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819272977","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.002820736,0.00021266646,0.9414178,0.0013251855,0.000332132,0.00015345002,0.000085215135,0.0025171116,0.051135667],"genre_scores_gemma":[0.072979674,0.00041802123,0.86012244,0.00065837294,0.00028167435,0.00041183506,0.00023431463,0.00133683,0.06355686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982804,0.00031549952,0.00006697024,0.00030670763,0.00081570674,0.00021472479],"domain_scores_gemma":[0.9985537,0.00032288034,0.000048100475,0.0007151243,0.00029093825,0.00006932297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055291,0.0015465145,0.00086502807,0.0011683912,0.0023022583,0.0027658239,0.002440267,0.0013127244,0.03232716],"category_scores_gemma":[0.00429514,0.0008261884,0.00076656777,0.0017677702,0.0021215896,0.0039237477,0.0042377505,0.0034927956,0.009594855],"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.00018486648,0.00015752428,0.00027533283,0.00020819416,0.0000266102,0.00012414911,0.00026734982,0.007406032,0.007752401,0.671278,0.034568585,0.27775106],"study_design_scores_gemma":[0.0001054289,0.00010336518,0.00017607323,0.000076325305,0.00003791906,0.0005003238,0.00016798862,0.0859899,0.018286098,0.6956767,0.1988391,0.000040819134],"about_ca_topic_score_codex":0.0011647186,"about_ca_topic_score_gemma":0.002840479,"teacher_disagreement_score":0.03232716,"about_ca_system_score_codex":0.00089358917,"about_ca_system_score_gemma":0.001535437,"threshold_uncertainty_score":0.10814506},"labels":[],"label_agreement":null},{"id":"W1819759706","doi":"10.1007/978-3-642-28872-2_22","title":"Cohesive and Isolated Development with Branches","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":67,"is_retracted":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; University of Alberta; McGill University","funders":"","keywords":"Computer science; Branching (polymer chemistry); Software engineering; Source code; Open source; Software; Database; Operating system; World Wide Web","score_opus":0.014175799800239735,"score_gpt":0.22625982145862242,"score_spread":0.2120840216583827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819759706","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.068478286,0.0033010137,0.5727368,0.0012657205,0.00020286241,0.00019458316,0.00007006511,0.0016224382,0.3521282],"genre_scores_gemma":[0.60624754,0.002439892,0.25700244,0.0004080765,0.00012328797,0.00043104638,0.00025482598,0.0013600736,0.13173276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855787,0.00044416054,0.000075419666,0.0002337588,0.000516816,0.00017192197],"domain_scores_gemma":[0.9964497,0.0017304588,0.00023437958,0.00097115216,0.000333371,0.00028100185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012013854,0.00061931874,0.00030641217,0.000825081,0.0010057028,0.0026154795,0.0011126652,0.0008033479,0.0076718656],"category_scores_gemma":[0.00537921,0.00076347886,0.00041876035,0.0010448651,0.0024121017,0.004033041,0.004116672,0.0022144734,0.0022572244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055069835,0.00009035307,0.0018491102,0.00025747294,0.000019452498,0.00036741368,0.005490606,0.0058396505,0.0037289022,0.6881217,0.006077991,0.28810227],"study_design_scores_gemma":[0.000030137258,0.000116795,0.0017464771,0.0003965125,0.000035187688,0.00057288323,0.0011424614,0.017513093,0.0038618078,0.8254237,0.1491356,0.000025360674],"about_ca_topic_score_codex":0.0006382199,"about_ca_topic_score_gemma":0.001302929,"teacher_disagreement_score":0.0076718656,"about_ca_system_score_codex":0.0006152839,"about_ca_system_score_gemma":0.0014045835,"threshold_uncertainty_score":0.025664926},"labels":[],"label_agreement":null},{"id":"W181993896","doi":"10.1007/978-3-319-07046-9_27","title":"Parallel Depth-Bounded Discrepancy Search","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Heuristics; Iterative deepening depth-first search; Bounded function; Computer science; Pruning; Depth-first search; Workload; Search algorithm; Parallel computing; Best-first search; Search tree; Beam search; Beam stack search; Massively parallel; Algorithm; Mathematics","score_opus":0.020134524521984505,"score_gpt":0.25896325006860377,"score_spread":0.23882872554661927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181993896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013138749,0.001486689,0.93672127,0.00072243134,0.00029898618,0.000106348874,0.00048249937,0.0031606546,0.043882348],"genre_scores_gemma":[0.24809358,0.0008210413,0.71962726,0.00046445717,0.00021520967,0.0002923681,0.0015657002,0.0016504499,0.027269978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903935,0.00020065269,0.000044912966,0.00020773904,0.0003752209,0.00013211813],"domain_scores_gemma":[0.99877983,0.0005682631,0.000054286134,0.00035777313,0.00017589916,0.00006398917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297449,0.001352139,0.0017389688,0.00084694166,0.0007330652,0.0015372033,0.00246214,0.00135202,0.02121641],"category_scores_gemma":[0.0039045138,0.00073875795,0.00093074207,0.0020685124,0.00087279617,0.0028037305,0.002868896,0.0025641543,0.004387485],"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.00088678737,0.00025545066,0.0003963009,0.0005150672,0.00008683491,0.00009747947,0.000113679336,0.3035362,0.005871612,0.17240134,0.04537639,0.47046292],"study_design_scores_gemma":[0.00014835461,0.000058664224,0.00012267739,0.00004089775,0.000024197125,0.00008695017,0.00003291019,0.8303993,0.0028317,0.15232264,0.013915788,0.000015902555],"about_ca_topic_score_codex":0.002675084,"about_ca_topic_score_gemma":0.0041136,"teacher_disagreement_score":0.02121641,"about_ca_system_score_codex":0.0012922642,"about_ca_system_score_gemma":0.0017578572,"threshold_uncertainty_score":0.07097602},"labels":[],"label_agreement":null},{"id":"W1820018505","doi":"10.1007/978-3-662-47989-6_4","title":"Provably Weak Instances of Ring-LWE","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Learning with errors; Cryptosystem; Ring (chemistry); Cyclotomic field; Polynomial ring; Discrete mathematics; Mathematics; Ring of integers; Lattice problem; Algebraic number field; Class (philosophy); Computer science; Lattice (music); Cryptography; Combinatorics; Polynomial; Algorithm; Physics; Artificial intelligence","score_opus":0.024629387579976094,"score_gpt":0.2539962491447131,"score_spread":0.22936686156473698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820018505","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.15161821,0.0041677277,0.39045072,0.020417992,0.0018482499,0.00036478377,0.0040371628,0.003081452,0.42401364],"genre_scores_gemma":[0.8636266,0.0020388633,0.069208734,0.0028338968,0.0013397683,0.0004708511,0.0026148367,0.0007732035,0.05709338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967709,0.00072101515,0.0002346974,0.0007400561,0.0009447204,0.00058848324],"domain_scores_gemma":[0.9935033,0.004168057,0.00028925645,0.0011227645,0.0005560691,0.00036064838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024597663,0.0013364734,0.0015211913,0.001206311,0.0028991455,0.006727111,0.0025192604,0.0023499539,0.01981306],"category_scores_gemma":[0.009185931,0.0011329617,0.0018748617,0.0018741649,0.004693953,0.016377326,0.006644763,0.007860317,0.003642422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015428095,0.00005301648,0.00023312485,0.00018419109,0.000030738676,0.00008734915,0.00017925019,0.0014431068,0.000860595,0.98053026,0.00673976,0.009504286],"study_design_scores_gemma":[0.000035649726,0.000012209216,0.0000739141,0.000028143946,0.000018341021,0.00010344258,0.000055023196,0.0024045561,0.0006862673,0.99028647,0.0062831216,0.00001302004],"about_ca_topic_score_codex":0.00048093792,"about_ca_topic_score_gemma":0.00074613595,"teacher_disagreement_score":0.01981306,"about_ca_system_score_codex":0.0024136778,"about_ca_system_score_gemma":0.0013413783,"threshold_uncertainty_score":0.06628132},"labels":[],"label_agreement":null},{"id":"W1820119192","doi":"10.1007/978-3-642-01671-4_6","title":"An Account Policy Model for Grid Environments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Calgary","funders":"","keywords":"Computer science; Grid; Distributed computing; Operations research; Geology; Mathematics","score_opus":0.020808814076328622,"score_gpt":0.2657895268518602,"score_spread":0.24498071277553157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820119192","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.01744597,0.00040750866,0.91319335,0.0041378057,0.000334392,0.0002680824,0.0011274274,0.0015916404,0.061493754],"genre_scores_gemma":[0.6695391,0.0010096744,0.26140666,0.0009447093,0.00036128168,0.0006695278,0.0014975923,0.0007043851,0.06386709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983693,0.0006060316,0.00012507064,0.00023842452,0.00038353057,0.00027756792],"domain_scores_gemma":[0.9980416,0.00073168695,0.00013670507,0.0004972089,0.00035265565,0.00024010021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021900253,0.0007358841,0.00107172,0.0007564588,0.0017113611,0.0057877703,0.0031193187,0.0025820632,0.015188236],"category_scores_gemma":[0.0059963153,0.0007920906,0.0011671515,0.0018262316,0.0017021835,0.009185305,0.0026335607,0.0032010907,0.0032323832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008565236,0.000058264966,0.00024035,0.000044169094,0.000013325839,0.00011896417,0.00014890745,0.06996373,0.000287192,0.9112259,0.007802367,0.010011227],"study_design_scores_gemma":[0.00004558233,0.000019014395,0.00006726809,0.000021763488,0.000018364992,0.0000671768,0.00008070655,0.4118162,0.00032333733,0.5705873,0.016933287,0.000020032396],"about_ca_topic_score_codex":0.0076647936,"about_ca_topic_score_gemma":0.0062686517,"teacher_disagreement_score":0.015188236,"about_ca_system_score_codex":0.002508584,"about_ca_system_score_gemma":0.0029849173,"threshold_uncertainty_score":0.05080974},"labels":[],"label_agreement":null},{"id":"W1820209741","doi":"10.1007/978-3-642-20662-7_12","title":"Compressed String Dictionaries","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; String (physics); Search engine indexing; Theoretical computer science; Set (abstract data type); RDF; Space (punctuation); Information retrieval; Programming language; Mathematics; Semantic Web","score_opus":0.023098639261622336,"score_gpt":0.23298247406148845,"score_spread":0.2098838347998661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820209741","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.020476317,0.005394819,0.8282157,0.0018877694,0.0040077018,0.00048488774,0.014201593,0.018407734,0.10692347],"genre_scores_gemma":[0.10179417,0.006507905,0.58964115,0.0014779173,0.0017809226,0.0006330342,0.05767567,0.0047017233,0.23578754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934214,0.00008144467,0.000067061424,0.00012364845,0.00033524702,0.000050448423],"domain_scores_gemma":[0.99870515,0.00029888074,0.000051082316,0.00055796176,0.00034073865,0.000046138684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003775866,0.0009307722,0.0008992459,0.0019904738,0.00059648056,0.0016837191,0.001286961,0.0010299428,0.06388634],"category_scores_gemma":[0.0026769014,0.0005448044,0.00048704608,0.0036495898,0.0006667525,0.002564769,0.0022056513,0.0016810106,0.04044203],"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.00034531383,0.00009155073,0.00015285698,0.0004586674,0.000035044963,0.00023513731,0.00009132366,0.0059501994,0.023475362,0.056913756,0.08890474,0.823346],"study_design_scores_gemma":[0.00013129087,0.00029442372,0.0008910053,0.00041646592,0.00008591137,0.0023659226,0.00019456935,0.09486602,0.14576674,0.103505425,0.65136236,0.000119805445],"about_ca_topic_score_codex":0.00051763497,"about_ca_topic_score_gemma":0.00070558407,"teacher_disagreement_score":0.06388634,"about_ca_system_score_codex":0.0003643319,"about_ca_system_score_gemma":0.00072510244,"threshold_uncertainty_score":0.2137211},"labels":[],"label_agreement":null},{"id":"W1820559390","doi":"10.1007/3-540-45548-5_38","title":"On Mining Ordering Rules","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Computer science; Association rule learning; Table (database); Object (grammar); Data mining; Value (mathematics); Order (exchange); Binary relation; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Discrete mathematics","score_opus":0.02294105279784202,"score_gpt":0.2408162877741415,"score_spread":0.21787523497629946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820559390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06827998,0.005271784,0.90156716,0.0015157044,0.00048208167,0.0005200494,0.0030765298,0.0015913345,0.017695446],"genre_scores_gemma":[0.22742696,0.0038348404,0.74391115,0.0006408753,0.0005300871,0.00040492904,0.0117411325,0.00021873895,0.011291309],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755585,0.0004233965,0.00027002956,0.0006611969,0.00093083957,0.00015852903],"domain_scores_gemma":[0.9951102,0.0030935805,0.00025128154,0.00084883015,0.0005797198,0.000116337265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016259437,0.0011164099,0.0018950468,0.004885612,0.0012302323,0.0026465908,0.0020248177,0.0011150388,0.0060321554],"category_scores_gemma":[0.011615194,0.00085742376,0.0019180733,0.0066446154,0.0012966205,0.0053462978,0.001927873,0.002011298,0.0018831562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025982797,0.0003842181,0.0059760036,0.00057159044,0.00024551034,0.0004759898,0.0003588869,0.02961574,0.0030840435,0.0737175,0.015322003,0.86998874],"study_design_scores_gemma":[0.000093195384,0.00020559129,0.0042958334,0.00040567634,0.0002568595,0.0009325312,0.000380037,0.38786232,0.00489757,0.57273936,0.027876167,0.00005499608],"about_ca_topic_score_codex":0.003268827,"about_ca_topic_score_gemma":0.0039542858,"teacher_disagreement_score":0.0060321554,"about_ca_system_score_codex":0.0006531747,"about_ca_system_score_gemma":0.0013933855,"threshold_uncertainty_score":0.02017963},"labels":[],"label_agreement":null},{"id":"W182168334","doi":"10.1007/978-3-642-29889-9_12","title":"Human Subjects, Agents, or Bots: Current Issues in Ethics and Computer Security Research","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Current (fluid); Computer security; Computer science; Engineering ethics; Engineering; Electrical engineering","score_opus":0.20947510325943622,"score_gpt":0.4809892976414372,"score_spread":0.271514194382001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182168334","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006149197,0.46771777,0.021263864,0.38808012,0.005286382,0.000059304348,0.00006579749,0.000066401764,0.11131121],"genre_scores_gemma":[0.3032984,0.47086316,0.02002705,0.104358576,0.020936241,0.00045751833,0.00015137992,0.00026243294,0.0796453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98951644,0.0074345586,0.0003209119,0.00067845464,0.0016263918,0.00042308777],"domain_scores_gemma":[0.9484007,0.046488885,0.0008648286,0.001285876,0.001650829,0.0013088544],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.020331385,0.00062410376,0.0015625814,0.0020779811,0.0033942228,0.013657543,0.0019044327,0.009991368,0.0107728625],"category_scores_gemma":[0.018905703,0.0006761756,0.00036440155,0.0036342733,0.040470872,0.018444508,0.0037648613,0.008330585,0.0021439581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018959738,0.000047883284,0.00035921542,0.0004687363,0.000005984774,0.000051391016,0.0038059957,0.00010255795,0.00007350297,0.8885528,0.03367099,0.07284198],"study_design_scores_gemma":[0.000008173243,0.000017463428,0.00041458794,0.0016015467,0.0000053225413,0.00014043365,0.004359735,0.00027676177,0.00005773832,0.8164696,0.17663625,0.000012467665],"about_ca_topic_score_codex":0.0027369733,"about_ca_topic_score_gemma":0.0054959767,"teacher_disagreement_score":0.99000865,"about_ca_system_score_codex":0.0036747588,"about_ca_system_score_gemma":0.008724716,"threshold_uncertainty_score":0.10752392},"labels":[],"label_agreement":null},{"id":"W1821814192","doi":"10.1007/978-3-642-31295-3_2","title":"Optimal “Anti-Bayesian” Parametric Pattern Classification for the Exponential Family Using Order Statistics Criteria","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Carleton University","funders":"","keywords":"Mahalanobis distance; Exponential family; Computer science; Bayesian probability; Parametric statistics; Artificial intelligence; Order statistic; Algorithm; Bayes' theorem; Pattern recognition (psychology); Statistics; Mathematics; Machine learning","score_opus":0.05307906058183555,"score_gpt":0.3118320624366386,"score_spread":0.25875300185480304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821814192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009709413,0.00015238226,0.988846,0.00021443504,0.000020905047,0.000022730139,0.00004283379,0.00012350437,0.00086794194],"genre_scores_gemma":[0.35404113,0.00067565456,0.63788337,0.0003066195,0.00027446714,0.00028897688,0.00076305756,0.00035315994,0.005413495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649185,0.0015025389,0.00025365571,0.00052928086,0.0009601266,0.0002626142],"domain_scores_gemma":[0.9853534,0.01075266,0.00060290674,0.0012616677,0.0017180892,0.0003112543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067553353,0.00095241086,0.0023186863,0.0017718577,0.0007075769,0.0025564716,0.0030460982,0.0022349376,0.002960656],"category_scores_gemma":[0.027652128,0.0008709855,0.0017117318,0.0015931899,0.0018953416,0.0048457845,0.0027065508,0.0026786495,0.0007982247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049071497,0.00022727919,0.0023583123,0.00036171186,0.00016406315,0.0001417048,0.00022715762,0.365116,0.004949594,0.3013556,0.006749726,0.31785807],"study_design_scores_gemma":[0.000011490099,0.000027432217,0.0002466859,0.0000129635755,0.000010679483,0.0000372628,0.000011582314,0.9120012,0.00055226235,0.0866758,0.0003995971,0.000013070235],"about_ca_topic_score_codex":0.0017408038,"about_ca_topic_score_gemma":0.0016861953,"teacher_disagreement_score":0.0067553353,"about_ca_system_score_codex":0.0014167217,"about_ca_system_score_gemma":0.002092425,"threshold_uncertainty_score":0.03572607},"labels":[],"label_agreement":null},{"id":"W182188404","doi":"10.1007/978-3-642-21538-4_4","title":"Toward Opportunistic Collaboration in Target Pursuit Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Observability; Computer science; Robot; Inference; Action (physics); Relation (database); Artificial intelligence; Inference engine; Distributed computing; Data mining; Mathematics","score_opus":0.0459958402866514,"score_gpt":0.26213892721865434,"score_spread":0.21614308693200293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182188404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009462627,0.0014668748,0.9676299,0.00040419676,0.000099415185,0.000041759165,0.000043454438,0.00014589775,0.02070575],"genre_scores_gemma":[0.43017185,0.0065928656,0.5246661,0.0003516052,0.00052232126,0.00048212128,0.00045275103,0.00025405982,0.036506318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990609,0.00036167607,0.000029983943,0.00013828331,0.00029718806,0.00011195972],"domain_scores_gemma":[0.9979547,0.0014678232,0.00009616556,0.00020775269,0.00014996795,0.00012349965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013092265,0.0009865072,0.0010414252,0.000781117,0.0009756971,0.0018614616,0.0018051956,0.0015522165,0.004744335],"category_scores_gemma":[0.004731101,0.0006243997,0.0009219434,0.0017180404,0.0010190707,0.0026107286,0.003993141,0.0031047238,0.0011653728],"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.0001855526,0.00013356266,0.0005718176,0.0004010108,0.00008930881,0.00017557635,0.0004907906,0.24860221,0.0038512773,0.55562955,0.013367277,0.17650208],"study_design_scores_gemma":[0.000033993343,0.00007113297,0.0001596673,0.000050745522,0.000017976778,0.00012855617,0.00010516261,0.5746807,0.0007609245,0.41257203,0.011405345,0.000013803136],"about_ca_topic_score_codex":0.0011029012,"about_ca_topic_score_gemma":0.0011520798,"teacher_disagreement_score":0.004744335,"about_ca_system_score_codex":0.00063124165,"about_ca_system_score_gemma":0.0008440518,"threshold_uncertainty_score":0.015871346},"labels":[],"label_agreement":null},{"id":"W1822879907","doi":"10.1007/11693017_30","title":"The Pervasiveness of Global Data in Evolving Software Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"University of Waterloo","funders":"","keywords":"Computer science; Software; Software system; Software engineering; Data science; Programming language","score_opus":0.023651327539422628,"score_gpt":0.2702795646568284,"score_spread":0.24662823711740578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822879907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25610447,0.010630883,0.64802694,0.010078791,0.0004969212,0.000092399925,0.0003403932,0.0012246963,0.07300453],"genre_scores_gemma":[0.92527366,0.0039011645,0.060692437,0.00042643206,0.0003640803,0.00006368707,0.00018701593,0.00036601507,0.008725465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977648,0.0005142098,0.00015726333,0.00053246674,0.00084537134,0.00018594533],"domain_scores_gemma":[0.98405,0.009587559,0.0009175043,0.0038227744,0.0010898178,0.0005324677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023531155,0.000340436,0.0005671167,0.0019842414,0.0015099259,0.006035341,0.0014725121,0.0019709507,0.0023009705],"category_scores_gemma":[0.019974379,0.0011080698,0.000654886,0.0030583893,0.00710377,0.02174168,0.005095405,0.003734233,0.00042813682],"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.00017213976,0.000046291483,0.0119353775,0.0004484701,0.00006940048,0.0018340668,0.011560621,0.010383084,0.010016207,0.71815914,0.0047795153,0.23059565],"study_design_scores_gemma":[0.000031985932,0.00012398566,0.0075249146,0.00029278427,0.00015821602,0.003606369,0.003666833,0.04449807,0.009291857,0.8274199,0.10330726,0.000077821904],"about_ca_topic_score_codex":0.0012142787,"about_ca_topic_score_gemma":0.0017936435,"teacher_disagreement_score":0.006035341,"about_ca_system_score_codex":0.00084664434,"about_ca_system_score_gemma":0.00086643454,"threshold_uncertainty_score":0.012444615},"labels":[],"label_agreement":null},{"id":"W1822891440","doi":"10.1007/978-3-540-39646-8_9","title":"Agent Support for Context-Aware Services and Personal Mobility","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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 Ottawa","funders":"","keywords":"Computer science; Artifact (error); Service discovery; Session (web analytics); Quality of service; Software architecture; Ubiquitous computing; Context (archaeology); Software agent; Context awareness; Wireless; Service (business); Software; Session Initiation Protocol; Computer network; Distributed computing; Web service; Human–computer interaction; World Wide Web; Operating system; Server; Artificial intelligence","score_opus":0.03026568681402006,"score_gpt":0.26032068364273425,"score_spread":0.2300549968287142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822891440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05050663,0.003973187,0.8175478,0.0016816997,0.0005949864,0.00014760539,0.0001673386,0.004875668,0.120505065],"genre_scores_gemma":[0.73665315,0.0032133518,0.19235873,0.00021852071,0.00031879073,0.00017598011,0.00049143395,0.00029733047,0.066272795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976856,0.000049353075,0.000021391304,0.000036391404,0.000080631144,0.000043710814],"domain_scores_gemma":[0.9997124,0.00008648439,0.000025022115,0.000084472435,0.000050829916,0.000040652565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036321627,0.00040712656,0.0004784318,0.00033123032,0.0006623353,0.0018295862,0.00116553,0.0010426079,0.005968148],"category_scores_gemma":[0.0010029266,0.0003299995,0.00042022695,0.00042673555,0.00041840624,0.0022046596,0.0014951299,0.0010924314,0.0020543388],"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.00034872707,0.00034703588,0.0012401431,0.00051013986,0.00011998034,0.0008163324,0.0019289574,0.028452432,0.04713384,0.4499212,0.026053522,0.44312778],"study_design_scores_gemma":[0.000107028376,0.00016623214,0.0010964498,0.00019392389,0.00018908925,0.0012631372,0.00058247976,0.3759012,0.031271767,0.1798,0.40934864,0.000079987425],"about_ca_topic_score_codex":0.0012385838,"about_ca_topic_score_gemma":0.0017378681,"teacher_disagreement_score":0.005968148,"about_ca_system_score_codex":0.00024211555,"about_ca_system_score_gemma":0.00030529246,"threshold_uncertainty_score":0.01996547},"labels":[],"label_agreement":null},{"id":"W1822932347","doi":"10.1007/3-540-44634-6_35","title":"Computing Phylogenetic Roots with Bounded Degrees and Errors","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Phylogenetic tree; Combinatorics; Similarity (geometry); Phylogenetics; Mathematics; Tree (set theory); Bounded function; Vertex (graph theory); Graph; Phylogenetic network; Biology; Computer science; Artificial intelligence; Genetics; Image (mathematics)","score_opus":0.015868047004678792,"score_gpt":0.2381215292257102,"score_spread":0.22225348222103142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822932347","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.09695104,0.0014366509,0.885581,0.0011142413,0.00025256013,0.00005080024,0.0005789734,0.0021712382,0.011863481],"genre_scores_gemma":[0.53889793,0.0009222093,0.4440031,0.0003200148,0.00032580693,0.00008022504,0.0013279358,0.0010919042,0.013030878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976259,0.00048856495,0.0001677409,0.0006317003,0.0008100231,0.00027616217],"domain_scores_gemma":[0.9814169,0.013013022,0.00082435884,0.0030938953,0.0012449037,0.0004069609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021439458,0.0010806086,0.0015780877,0.0018178868,0.0010800987,0.0028557682,0.002623132,0.0018725671,0.008836344],"category_scores_gemma":[0.026743852,0.00089788804,0.0007931696,0.002655527,0.003056593,0.010461659,0.0044664713,0.0027916566,0.0024233023],"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.0007676064,0.000101352314,0.0038709778,0.0006842845,0.000097350014,0.000264863,0.0009149196,0.14224625,0.0092528565,0.5181604,0.011214438,0.31242475],"study_design_scores_gemma":[0.000041298234,0.000045844383,0.00035541508,0.000071584735,0.000030378833,0.0001450424,0.00014697819,0.122070596,0.0058910456,0.8658402,0.005337428,0.000024156217],"about_ca_topic_score_codex":0.00094713207,"about_ca_topic_score_gemma":0.002074867,"teacher_disagreement_score":0.008836344,"about_ca_system_score_codex":0.0012671454,"about_ca_system_score_gemma":0.0008432211,"threshold_uncertainty_score":0.029560566},"labels":[],"label_agreement":null},{"id":"W1823282295","doi":"10.1007/978-3-540-30136-3_72","title":"Patient and Probe Tracking During Freehand Ultrasound","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","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 British Columbia","funders":"","keywords":"Computer science; Fiducial marker; Computer vision; Artificial intelligence; Ultrasound; Standard deviation; Tracking (education); 3D ultrasound; Digital camera; Consistency (knowledge bases); Computer graphics (images); Medicine; Radiology; Mathematics","score_opus":0.006261624507074683,"score_gpt":0.19726816556802668,"score_spread":0.191006541060952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823282295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041576073,0.0025049255,0.9441234,0.00016997232,0.00019156942,0.00009623662,0.00024633706,0.0025683285,0.008523047],"genre_scores_gemma":[0.47762957,0.0031934106,0.48718995,0.00046782068,0.00021718182,0.00016450688,0.0007342088,0.0026919013,0.027711486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999376,0.0001970281,0.000037173744,0.00012438951,0.00020538995,0.00006007803],"domain_scores_gemma":[0.9981432,0.0013406572,0.00009729756,0.00023892632,0.00011307368,0.00006683536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086321373,0.0007217891,0.0006057079,0.0003683708,0.00034712898,0.0010320968,0.00079324143,0.0016627081,0.008109659],"category_scores_gemma":[0.0037644801,0.0010054566,0.00041558093,0.00037231686,0.00033856783,0.0014838475,0.0013614148,0.00080411194,0.0026512952],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013217501,0.00007289134,0.0021065364,0.0005597352,0.000057928617,0.0010836727,0.0015460844,0.01165691,0.37838602,0.0022698308,0.0052248617,0.59571385],"study_design_scores_gemma":[0.00017712866,0.002297372,0.053596757,0.00088543806,0.00038287163,0.038798537,0.00086585124,0.2547296,0.55291885,0.011045148,0.08395688,0.00034561774],"about_ca_topic_score_codex":0.00089543307,"about_ca_topic_score_gemma":0.0020812876,"teacher_disagreement_score":0.008109659,"about_ca_system_score_codex":0.00020731105,"about_ca_system_score_gemma":0.0005129297,"threshold_uncertainty_score":0.02712953},"labels":[],"label_agreement":null},{"id":"W1823325150","doi":"10.1007/978-3-642-16696-9_49","title":"Strategic Health Information Management and Forecast: The Birdwatching Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Set (abstract data type); Controlled vocabulary; Information exchange; Information system; Data science; Knowledge management; Artificial intelligence; Engineering","score_opus":0.02613786373024393,"score_gpt":0.24234523565099617,"score_spread":0.21620737192075223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823325150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011203947,0.00096739334,0.92472565,0.0032168645,0.00018541157,0.00014247284,0.0002782129,0.000681963,0.05859804],"genre_scores_gemma":[0.4230126,0.002282756,0.549541,0.0005648981,0.00019055596,0.00017800064,0.0005696901,0.00017797282,0.023482442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949205,0.00022778733,0.000022548817,0.000095463176,0.000118006035,0.000044154294],"domain_scores_gemma":[0.9987123,0.00082856644,0.000074480966,0.00015500578,0.00015500044,0.00007458993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015382123,0.00055385823,0.00075515005,0.001792527,0.000818876,0.003985534,0.0013805605,0.0012828143,0.0075130975],"category_scores_gemma":[0.0035642395,0.00056450785,0.00062157225,0.0028304483,0.0013119264,0.0057714866,0.0015560056,0.0010656883,0.0010298495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113952556,0.000115843555,0.0030640243,0.00020624185,0.0001212911,0.00023751438,0.0008336875,0.0665936,0.0015823732,0.62921226,0.01702157,0.28089765],"study_design_scores_gemma":[0.000023000317,0.00008027746,0.001655902,0.00012479018,0.0000732998,0.00016067967,0.0011697914,0.32676262,0.0011508744,0.61474377,0.054002896,0.000052147494],"about_ca_topic_score_codex":0.012157251,"about_ca_topic_score_gemma":0.014982019,"teacher_disagreement_score":0.012157251,"about_ca_system_score_codex":0.0012090632,"about_ca_system_score_gemma":0.0015892333,"threshold_uncertainty_score":0.025133848},"labels":[],"label_agreement":null},{"id":"W1823652951","doi":"10.1007/3-540-45724-0_5","title":"An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Waterloo","funders":"","keywords":"Vehicle routing problem; Metaheuristic; Computer science; Heuristics; Ant colony optimization algorithms; Ant colony; Mathematical optimization; Scheduling (production processes); Parallel metaheuristic; Job shop scheduling; Set (abstract data type); Ranging; Routing (electronic design automation); Operations research; Artificial intelligence; Mathematics; Computer network; Meta-optimization","score_opus":0.018252130103274436,"score_gpt":0.25866336348018026,"score_spread":0.24041123337690584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823652951","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.9753948,0.0002048761,0.020078521,0.00011164455,0.00011642147,0.00020834728,0.00021399854,0.00028908753,0.003382326],"genre_scores_gemma":[0.9818595,0.00008722034,0.016525025,0.000019825053,0.000015004163,0.00008825747,0.00014382054,0.000053932243,0.0012074531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993973,0.00023200076,0.00003843257,0.00010306199,0.00015567344,0.00007348165],"domain_scores_gemma":[0.9947864,0.003412616,0.0002397564,0.0007020644,0.0005510241,0.00030808322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093073584,0.00065930915,0.00080580445,0.00044144414,0.00049966195,0.0006710392,0.0013803501,0.001018895,0.0032692312],"category_scores_gemma":[0.00437595,0.00032191098,0.00034768737,0.00057935016,0.0006320788,0.0009528719,0.00049090345,0.00084857986,0.00042787896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0070112576,0.012992357,0.0046183392,0.001280005,0.00026402558,0.0006017252,0.00036514387,0.6755682,0.19911286,0.0055002817,0.0024299785,0.090255864],"study_design_scores_gemma":[0.000357659,0.0047254693,0.0022958945,0.000011674446,0.000053146443,0.00010543237,0.00012633365,0.96192485,0.028315935,0.0013858479,0.0006707421,0.000027017839],"about_ca_topic_score_codex":0.0029089763,"about_ca_topic_score_gemma":0.0016253918,"teacher_disagreement_score":0.0032692312,"about_ca_system_score_codex":0.00042589213,"about_ca_system_score_gemma":0.0005972531,"threshold_uncertainty_score":0.010936677},"labels":[],"label_agreement":null},{"id":"W1823694584","doi":"10.1007/978-3-540-27836-8_84","title":"Succinct Representations of Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.016982082124449977,"score_gpt":0.26036718963422534,"score_spread":0.24338510750977535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823694584","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.00926976,0.0012918347,0.9375557,0.00074756605,0.00039748944,0.00010531895,0.0020101701,0.002616205,0.046005838],"genre_scores_gemma":[0.25464666,0.003935194,0.643475,0.0009475694,0.0005246928,0.0007307338,0.010642681,0.0023022874,0.08279523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882346,0.0002552845,0.000117998075,0.00017469712,0.00051851664,0.000109963126],"domain_scores_gemma":[0.99858046,0.00047520828,0.00007529187,0.0005991448,0.00022416541,0.000045861914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072056364,0.0013852498,0.00084976165,0.0016363919,0.0006421696,0.0039377855,0.0015709851,0.0013491735,0.022171643],"category_scores_gemma":[0.004013254,0.00070197304,0.0008406097,0.0026135163,0.0013179673,0.006895353,0.002261413,0.0031232925,0.008524121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009277985,0.000033743672,0.00009841115,0.00018704723,0.0000104270075,0.00009023956,0.00025116032,0.007955784,0.002204997,0.82591844,0.015857933,0.14729895],"study_design_scores_gemma":[0.000021683929,0.000035791556,0.00009620391,0.0001282031,0.000019307176,0.0002262428,0.000072753486,0.027941966,0.0037260088,0.89226294,0.075443685,0.000025364285],"about_ca_topic_score_codex":0.00052586844,"about_ca_topic_score_gemma":0.0009104789,"teacher_disagreement_score":0.022171643,"about_ca_system_score_codex":0.00087496446,"about_ca_system_score_gemma":0.0006834323,"threshold_uncertainty_score":0.07417154},"labels":[],"label_agreement":null},{"id":"W1823790170","doi":"10.1007/978-3-319-06483-3_25","title":"Experts and Machines against Bullies: A Hybrid Approach to Detect Cyberbullies","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Twente; York University","keywords":"Computer science; Machine learning; Artificial intelligence; Classifier (UML)","score_opus":0.010636258748427573,"score_gpt":0.21431803929404786,"score_spread":0.20368178054562028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823790170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38785228,0.002836133,0.5686354,0.0017548831,0.00030415977,0.00048470075,0.0017754049,0.0023052078,0.03405188],"genre_scores_gemma":[0.83233654,0.0005130515,0.14770785,0.00041080225,0.000153656,0.00013512911,0.001005992,0.00008582622,0.01765116],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991543,0.00021025489,0.000027032725,0.0002649608,0.00022464401,0.00011880806],"domain_scores_gemma":[0.9986333,0.00082843495,0.000087812274,0.00009768534,0.00024795215,0.00010465326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165959,0.0009574075,0.00085084495,0.0029450115,0.00060570583,0.0018404557,0.0014356285,0.0019716253,0.004204154],"category_scores_gemma":[0.0025386733,0.00038420912,0.0007075685,0.0012424742,0.0004307909,0.002127685,0.0011137893,0.001018778,0.0013375373],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001069442,0.0015550306,0.08085983,0.00032149602,0.0006935181,0.000587333,0.0014912115,0.035874918,0.018823769,0.009009179,0.017822785,0.83189136],"study_design_scores_gemma":[0.00005467987,0.0006166637,0.05300445,0.00008591545,0.00034652848,0.0007904855,0.0017135584,0.902484,0.008771688,0.02418065,0.007839218,0.00011214648],"about_ca_topic_score_codex":0.0067998758,"about_ca_topic_score_gemma":0.011727772,"teacher_disagreement_score":0.0067998758,"about_ca_system_score_codex":0.00063452445,"about_ca_system_score_gemma":0.000575679,"threshold_uncertainty_score":0.014064312},"labels":[],"label_agreement":null},{"id":"W1824139226","doi":"10.1007/978-3-540-74126-8_14","title":"A Graph Clustering Approach to Weak Motif Recognition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Motif (music); Cluster analysis; Computer science; Artificial intelligence; Pattern recognition (psychology); Art; Aesthetics","score_opus":0.03318239396176013,"score_gpt":0.24489424534870285,"score_spread":0.21171185138694273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824139226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023432826,0.00032269894,0.99541193,0.000077744415,0.00004335199,0.00003890972,0.00011593763,0.00070243893,0.000943692],"genre_scores_gemma":[0.040492572,0.00054682017,0.9509728,0.00015883839,0.000109823915,0.00015108683,0.0010816023,0.00046430496,0.006022122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904794,0.00019993335,0.00007100271,0.00029946846,0.00031515275,0.000066527704],"domain_scores_gemma":[0.9981888,0.0006321444,0.000112657755,0.0004671383,0.0005024147,0.00009685475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715737,0.0011176957,0.00161875,0.0034049044,0.0012129309,0.0017057656,0.0038549441,0.0015669103,0.0045641502],"category_scores_gemma":[0.0035904553,0.00067900796,0.001383207,0.004594243,0.0010475059,0.0025274663,0.0018709636,0.001883704,0.0027902566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022245273,0.00021479728,0.001342117,0.000594033,0.0002452012,0.00021028605,0.00029990607,0.07431337,0.027664397,0.11539537,0.020123104,0.7593749],"study_design_scores_gemma":[0.000019988915,0.000058901147,0.00053862215,0.000041469768,0.00007033735,0.0002692696,0.00009196698,0.7563109,0.0067190346,0.2227243,0.0131115755,0.000043618475],"about_ca_topic_score_codex":0.0031988823,"about_ca_topic_score_gemma":0.0053428533,"teacher_disagreement_score":0.0045641502,"about_ca_system_score_codex":0.000635806,"about_ca_system_score_gemma":0.0006564476,"threshold_uncertainty_score":0.015268564},"labels":[],"label_agreement":null},{"id":"W1824279275","doi":"10.1007/978-3-642-39995-4_6","title":"Intelligence for the Personal Web","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"IBM (Canada); Queen's University","funders":"","keywords":"Computer science; Analytics; Predictive analytics; Web analytics; World Wide Web; Web service; Web intelligence; Human–computer interaction; Data science; Web modeling","score_opus":0.025402356010516335,"score_gpt":0.2593559191106855,"score_spread":0.23395356310016918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824279275","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.002862689,0.031523336,0.02878422,0.009943747,0.0009263087,0.000033054686,0.00023387269,0.0006750681,0.9250177],"genre_scores_gemma":[0.17111465,0.06462621,0.036815744,0.004295945,0.0031110572,0.000099563214,0.0015880264,0.0006729852,0.7176758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995394,0.00008939532,0.000024546933,0.000071635775,0.00022937749,0.00004575386],"domain_scores_gemma":[0.99953437,0.00014142739,0.000024550252,0.00016611823,0.00007276844,0.000060706385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058380875,0.0004487254,0.00039489605,0.001516171,0.0010909131,0.0062696976,0.00065718027,0.0014238558,0.027573785],"category_scores_gemma":[0.001469755,0.00038787062,0.0003736891,0.001925095,0.001852377,0.009813866,0.0022904617,0.0024707727,0.010100241],"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.00001601376,0.000028914501,0.00020118167,0.00015944843,0.00001362729,0.00009048548,0.0004791521,0.0004371886,0.0005983056,0.69785345,0.11535018,0.18477203],"study_design_scores_gemma":[0.0000035166793,0.0000050822773,0.00024161604,0.0001395128,0.0000075444295,0.0001667956,0.00021722466,0.0010724111,0.00037793771,0.3361347,0.6616279,0.0000057186826],"about_ca_topic_score_codex":0.0017976254,"about_ca_topic_score_gemma":0.0023440376,"teacher_disagreement_score":0.027573785,"about_ca_system_score_codex":0.00097419234,"about_ca_system_score_gemma":0.0006760406,"threshold_uncertainty_score":0.09224355},"labels":[],"label_agreement":null},{"id":"W1824465360","doi":"10.1007/978-3-540-45238-6_16","title":"On Low Complexity Bit Parallel Polynomial Basis Multipliers","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Finite field; Polynomial basis; Mathematics; Irreducible polynomial; Verilog; Basis (linear algebra); Arithmetic; Polynomial; Finite field arithmetic; Discrete mathematics; Algebra over a field; Computer science; Field-programmable gate array; Pure mathematics; Matrix polynomial; Mathematical analysis; Computer hardware","score_opus":0.02197533117921908,"score_gpt":0.23651409616052138,"score_spread":0.2145387649813023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824465360","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.046136234,0.0025715644,0.79201233,0.0019569476,0.001314301,0.00026278052,0.00049951894,0.0019228889,0.15332346],"genre_scores_gemma":[0.27932033,0.0034405682,0.55098915,0.0011975797,0.0010837881,0.00068231963,0.0010873915,0.0013265761,0.16087231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.00019497925,0.000040852334,0.00009008465,0.00041860525,0.000093030176],"domain_scores_gemma":[0.99902093,0.00049018895,0.000068454035,0.00026001048,0.00012043068,0.00003998917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184586,0.0016662896,0.0007556147,0.0012814282,0.0010065045,0.0020240443,0.0012614531,0.00075557554,0.025400069],"category_scores_gemma":[0.0036515584,0.00067254255,0.000546284,0.0025193393,0.0010929367,0.004491066,0.002856647,0.0023602848,0.0070766434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005254284,0.00012165309,0.00029932708,0.00026702593,0.00003782456,0.0001266106,0.00011814299,0.02058754,0.011744282,0.6520695,0.025970004,0.28813273],"study_design_scores_gemma":[0.00012907051,0.000111129775,0.00023368397,0.00010290556,0.00004559357,0.00029984646,0.000051885487,0.08276483,0.011493101,0.8559548,0.048771646,0.000041376345],"about_ca_topic_score_codex":0.0005642895,"about_ca_topic_score_gemma":0.0016510362,"teacher_disagreement_score":0.025400069,"about_ca_system_score_codex":0.0010578245,"about_ca_system_score_gemma":0.0009070176,"threshold_uncertainty_score":0.084971726},"labels":[],"label_agreement":null},{"id":"W1824515224","doi":"10.1007/978-3-540-30498-2_32","title":"Coordination Revisited – A Constraint Handling Rule Approach","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Computer science; Grammar; Programming language; Constraint (computer-aided design); Semantics (computer science); Theoretical computer science; Artificial intelligence; Linguistics; Mathematics","score_opus":0.014253147288650478,"score_gpt":0.25316424316613245,"score_spread":0.23891109587748197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824515224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00522213,0.0009527699,0.8537078,0.0037904838,0.0012083112,0.00017952776,0.00034228512,0.0007467145,0.13385002],"genre_scores_gemma":[0.18337403,0.0017068994,0.74208784,0.0018505085,0.0011101663,0.00035761087,0.0008973749,0.0015128535,0.06710263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943461,0.0013217825,0.0004636394,0.0014809968,0.0019767869,0.00041069728],"domain_scores_gemma":[0.9907319,0.004154005,0.00039516858,0.0029583413,0.0014823346,0.00027822086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150406,0.0010545941,0.0015624543,0.0024749872,0.002561105,0.007220786,0.011655065,0.0033345877,0.030105293],"category_scores_gemma":[0.015627613,0.0013379921,0.0026669835,0.0039873095,0.003909136,0.013631468,0.0039201244,0.0065329173,0.004779156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005677232,0.000059069975,0.00017088748,0.00018395319,0.0000464199,0.00063163583,0.0003772571,0.0044553285,0.0012438513,0.9137376,0.014036138,0.0650012],"study_design_scores_gemma":[0.00006722802,0.000035874302,0.00016666444,0.00019487424,0.00013705716,0.0007069994,0.00033971408,0.07428965,0.006078138,0.8289087,0.0889884,0.000086752385],"about_ca_topic_score_codex":0.00850305,"about_ca_topic_score_gemma":0.0066141705,"teacher_disagreement_score":0.030105293,"about_ca_system_score_codex":0.0015680097,"about_ca_system_score_gemma":0.0024555917,"threshold_uncertainty_score":0.10071224},"labels":[],"label_agreement":null},{"id":"W1825657983","doi":"10.1007/978-3-319-13075-0_42","title":"Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Constant (computer programming); Randomized algorithm; Computer science; Algorithm; Approximation algorithm; Deterministic algorithm; Matching (statistics); Maximization; Greedy algorithm; Online algorithm; Running time; Simple (philosophy); Mathematics; Combinatorics; Mathematical optimization","score_opus":0.02816901447274186,"score_gpt":0.26118368632132904,"score_spread":0.23301467184858718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1825657983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018063437,0.008221997,0.8771407,0.004071275,0.0010951179,0.00040355354,0.0008564209,0.0015616609,0.08858587],"genre_scores_gemma":[0.30120066,0.0069756145,0.6274583,0.0037147137,0.0019024992,0.0024604304,0.0022315218,0.0032107432,0.050845448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898296,0.0036226918,0.00047647938,0.0015814292,0.002875948,0.0016138086],"domain_scores_gemma":[0.95603484,0.035393566,0.0009996895,0.0040710364,0.0020425587,0.0014583565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012795674,0.007205611,0.0045526354,0.0026934184,0.0026947856,0.008233485,0.009906427,0.0063253962,0.03154292],"category_scores_gemma":[0.057110235,0.0027936392,0.0036478702,0.0056065903,0.005334492,0.015602011,0.010347349,0.016289651,0.006900691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001749711,0.00073723384,0.001041391,0.0016377929,0.00027307143,0.00018663492,0.0004699469,0.23255937,0.002991469,0.5155066,0.053669423,0.18917742],"study_design_scores_gemma":[0.00021295508,0.00015554101,0.00029679836,0.00028686234,0.000100780875,0.00014972249,0.00007633276,0.5382711,0.0009198182,0.45353928,0.0059410725,0.000049746337],"about_ca_topic_score_codex":0.0022354873,"about_ca_topic_score_gemma":0.004695187,"teacher_disagreement_score":0.03154292,"about_ca_system_score_codex":0.007243063,"about_ca_system_score_gemma":0.006818363,"threshold_uncertainty_score":0.10552162},"labels":[],"label_agreement":null},{"id":"W1826151234","doi":"10.1007/978-3-540-45072-6_21","title":"Query Pre-processing of Topological Constraints: Comparing a Composition-Based with Neighborhood-Based Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Esri (Canada)","funders":"","keywords":"Composition (language); Computer science; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Art","score_opus":0.016812896622536478,"score_gpt":0.23422943290474685,"score_spread":0.21741653628221036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826151234","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.13227953,0.0023327067,0.8481649,0.0005741373,0.00018485647,0.0006023921,0.0002663495,0.0040062405,0.011588932],"genre_scores_gemma":[0.37292314,0.0012552601,0.6180446,0.00017228801,0.00014664262,0.00018820957,0.0010552703,0.0006848434,0.0055297245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956945,0.00095210044,0.0002213363,0.00037789176,0.0024521868,0.0003019757],"domain_scores_gemma":[0.9910178,0.00426308,0.0002503312,0.0016216133,0.002525812,0.000321397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033417076,0.00072523515,0.0021827724,0.0021369073,0.0016461164,0.0024729595,0.0029087395,0.00131845,0.0062477393],"category_scores_gemma":[0.009633188,0.0005366034,0.0012315618,0.0027470668,0.0008458606,0.004670783,0.0016523713,0.001063361,0.0015685786],"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.00447008,0.0009196595,0.005948908,0.0007672191,0.00036111625,0.00020328622,0.0007606745,0.05637496,0.037440177,0.014770613,0.0058958535,0.8720874],"study_design_scores_gemma":[0.0002098719,0.00094097626,0.0052669668,0.000051755917,0.0005112386,0.00051852036,0.0014150213,0.92048013,0.04760245,0.011705158,0.011198395,0.000099568526],"about_ca_topic_score_codex":0.017295808,"about_ca_topic_score_gemma":0.02282889,"teacher_disagreement_score":0.017295808,"about_ca_system_score_codex":0.0010492041,"about_ca_system_score_gemma":0.002827325,"threshold_uncertainty_score":0.03439027},"labels":[],"label_agreement":null},{"id":"W1826169607","doi":"10.1007/978-3-642-31223-6_33","title":"The Use of Diagrams in Science","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 New Brunswick","funders":"","keywords":"Computer science; Sample (material); Graph; Representation (politics); Selection (genetic algorithm); Theoretical computer science; Data science; Information retrieval; Artificial intelligence","score_opus":0.049771448276070863,"score_gpt":0.29125751748439693,"score_spread":0.24148606920832608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826169607","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.0054762964,0.13536407,0.5086117,0.010851213,0.0031279388,0.00010654497,0.00046519111,0.0010727504,0.3349243],"genre_scores_gemma":[0.26036435,0.10181653,0.53355694,0.002615612,0.0024335084,0.0005275047,0.0009608718,0.0012779513,0.09644675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751186,0.0016249167,0.0001678411,0.00023068098,0.00039144247,0.000073299394],"domain_scores_gemma":[0.991507,0.0069642435,0.00019046944,0.00073161576,0.00046636612,0.00014037802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029868903,0.001041775,0.00080718094,0.0049208547,0.0015753988,0.008645726,0.0014654882,0.0017824534,0.010394217],"category_scores_gemma":[0.009111041,0.00084950746,0.0010171104,0.0054679103,0.007836086,0.015143851,0.0026164611,0.0028148901,0.0019970615],"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.0000035886774,0.0000035343242,0.00006001029,0.00015536418,0.0000068423765,0.000024901048,0.0009805306,0.00033276065,0.00009581253,0.9672356,0.004765195,0.026335847],"study_design_scores_gemma":[0.0000035487492,0.000003947191,0.000049425773,0.00021619338,0.00000696632,0.00009959051,0.00027205158,0.00076756603,0.00012119638,0.81591284,0.1825384,0.0000082134275],"about_ca_topic_score_codex":0.0020256273,"about_ca_topic_score_gemma":0.0024890644,"teacher_disagreement_score":0.010394217,"about_ca_system_score_codex":0.0023604992,"about_ca_system_score_gemma":0.001352827,"threshold_uncertainty_score":0.034772098},"labels":[],"label_agreement":null},{"id":"W1826207841","doi":"10.1007/978-3-540-85654-2_68","title":"Hierarchy Encoding with Multiple Genes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"St. Francis Xavier University","funders":"","keywords":"Encoding (memory); Hierarchy; Computer science; Inheritance (genetic algorithm); Set (abstract data type); Theoretical computer science; Multiple inheritance; Simple (philosophy); Algorithm; Artificial intelligence; Gene; Genetics; Programming language; Biology","score_opus":0.01912843602434203,"score_gpt":0.23069644965088018,"score_spread":0.21156801362653815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826207841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050503727,0.0012144498,0.87316567,0.0014885839,0.0008371376,0.00017113432,0.002019336,0.006278272,0.06432163],"genre_scores_gemma":[0.31090555,0.0008310172,0.6396853,0.0006966726,0.00019795905,0.00022358912,0.0039639524,0.0013963402,0.0420997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997546,0.000046452653,0.000016356691,0.00006248063,0.00006937901,0.000050796974],"domain_scores_gemma":[0.9994954,0.00015357115,0.000021859722,0.00017834963,0.00010389448,0.00004691586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026953054,0.0003958292,0.0005762922,0.00067464076,0.0007174043,0.00097387214,0.00091138453,0.0006368394,0.0123127205],"category_scores_gemma":[0.0012050483,0.00026996285,0.0005622079,0.0010855937,0.00060682825,0.001510755,0.0011892216,0.0012623065,0.0026718762],"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.00039958282,0.00012503407,0.0004936905,0.00036112865,0.000037149628,0.00038548117,0.0003593393,0.023412243,0.047011122,0.33190775,0.03611674,0.55939084],"study_design_scores_gemma":[0.00011494926,0.00023944942,0.0006358471,0.00022923264,0.00012062869,0.00049153133,0.00023427048,0.21238773,0.05179081,0.58315104,0.15052001,0.000084549094],"about_ca_topic_score_codex":0.001502287,"about_ca_topic_score_gemma":0.0032590928,"teacher_disagreement_score":0.0123127205,"about_ca_system_score_codex":0.00087556697,"about_ca_system_score_gemma":0.0007916089,"threshold_uncertainty_score":0.041190147},"labels":[],"label_agreement":null},{"id":"W1826365044","doi":"10.1007/978-3-642-31368-4_5","title":"Vehicular Ad-hoc Networks(VANETs): Capabilities, Challenges in Information Gathering and Data Fusion","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":30,"is_retracted":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":"Vehicular ad hoc network; Computer science; Wireless ad hoc network; Quality of service; Computer network; Broadcasting (networking); Intelligent transportation system; Context (archaeology); Computer security; Telecommunications; Transport engineering; Wireless; Engineering","score_opus":0.02175473515595068,"score_gpt":0.21737377937283053,"score_spread":0.19561904421687987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826365044","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060180645,0.37997934,0.48496196,0.009903738,0.004445306,0.00009559666,0.00044846188,0.00072043284,0.113427214],"genre_scores_gemma":[0.12796563,0.5527917,0.22503014,0.0018538251,0.004309019,0.0001377025,0.00090662914,0.00033300358,0.086672366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944836,0.00009949271,0.000045023102,0.00009018229,0.00028486838,0.000032023465],"domain_scores_gemma":[0.99915874,0.0005392033,0.000035343386,0.00007698679,0.00015689195,0.000032843214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247966,0.0007817221,0.00078645244,0.0010834344,0.00043894304,0.004144972,0.0011201852,0.0014045916,0.0030731482],"category_scores_gemma":[0.001838639,0.0006986657,0.00044518363,0.0027277987,0.0012381757,0.0064567965,0.0015241846,0.0022047858,0.0023520454],"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.00005243133,0.0000503539,0.00042855914,0.0014725534,0.000044232947,0.00019121912,0.00033511035,0.016646927,0.0048701162,0.34234047,0.041368615,0.5921993],"study_design_scores_gemma":[0.000007951042,0.00009264112,0.0003881912,0.00075253483,0.00003950332,0.0008366527,0.00033306255,0.039190963,0.0039520524,0.30620492,0.648136,0.000065615],"about_ca_topic_score_codex":0.0007504985,"about_ca_topic_score_gemma":0.00080473325,"teacher_disagreement_score":0.004144972,"about_ca_system_score_codex":0.00053868495,"about_ca_system_score_gemma":0.0006672353,"threshold_uncertainty_score":0.010280728},"labels":[],"label_agreement":null},{"id":"W1826423291","doi":"10.1007/978-3-319-14717-8_7","title":"Community Dynamics: Event and Role Analysis in Social Network Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Event (particle physics); Social network analysis; Community structure; Data science; Network analysis; Complex network; Relation (database); Dynamic network analysis; Dynamics (music); Order (exchange); Data mining; World Wide Web; Social media; Sociology; Computer network; Ecology","score_opus":0.008332632787932615,"score_gpt":0.2550819172058235,"score_spread":0.2467492844178909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826423291","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.008396327,0.0025565245,0.98437035,0.0006592046,0.00012846629,0.0000686101,0.000310311,0.00023404634,0.003276228],"genre_scores_gemma":[0.33303413,0.005427697,0.6457124,0.0002741771,0.0008735795,0.0005578709,0.0014138707,0.00034547772,0.012360854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829143,0.0008682677,0.000069983274,0.00033579674,0.000354033,0.00008049328],"domain_scores_gemma":[0.9951747,0.0037644666,0.00023371988,0.0003708151,0.00027129543,0.00018496947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025129488,0.0009446416,0.0010188164,0.002578914,0.00067612535,0.0022276402,0.0016195632,0.0010841246,0.0035317424],"category_scores_gemma":[0.010256799,0.00061271543,0.0011191032,0.0037051137,0.0013776079,0.0048957737,0.0018508715,0.0022327325,0.0010250454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011024214,0.00023255554,0.005907301,0.00073129416,0.00022232515,0.00017293346,0.0012541483,0.08288284,0.0038046634,0.527175,0.01743029,0.3600764],"study_design_scores_gemma":[0.000009090355,0.000030422942,0.0015977366,0.00007518126,0.000040378793,0.00013881887,0.00021273129,0.6246731,0.0008592224,0.35968098,0.012651819,0.000030480851],"about_ca_topic_score_codex":0.0017082837,"about_ca_topic_score_gemma":0.0020213192,"teacher_disagreement_score":0.0035317424,"about_ca_system_score_codex":0.0008314608,"about_ca_system_score_gemma":0.0006554033,"threshold_uncertainty_score":0.013289869},"labels":[],"label_agreement":null},{"id":"W1826607394","doi":"10.1007/978-3-642-10268-4_94","title":"Generating Video Textures by PPCA and Gaussian Process Dynamical Model","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Gaussian process; Process (computing); Computer vision; Gaussian; Computer graphics (images); Pattern recognition (psychology); Programming language","score_opus":0.009307873704370624,"score_gpt":0.24159422331523134,"score_spread":0.23228634961086073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826607394","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.005377911,0.00007003537,0.9935901,0.000042988955,0.00003892973,0.000027326252,0.000059346374,0.00040790634,0.0003854696],"genre_scores_gemma":[0.18300176,0.0003507761,0.8129558,0.0000991469,0.00010461818,0.00012827576,0.0005159953,0.00032529345,0.0025183868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.000059616363,0.000011789105,0.0000901217,0.00009032985,0.000035471978],"domain_scores_gemma":[0.99942964,0.00027469886,0.000033810178,0.000096340955,0.00012861696,0.000036801404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061662414,0.0006159273,0.00093952357,0.0009928884,0.00024546028,0.00080610515,0.00083164463,0.0008885915,0.0029049986],"category_scores_gemma":[0.003270656,0.00063045794,0.0011648512,0.0010060617,0.00042412404,0.000966997,0.0007871692,0.001140652,0.0008315861],"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.0005117807,0.00011770995,0.00095396047,0.00021196996,0.00011616497,0.0002647893,0.00008168013,0.33447683,0.046464242,0.025764108,0.0056555304,0.58538127],"study_design_scores_gemma":[0.000015638576,0.000019607482,0.00018375514,0.0000048882484,0.000010419823,0.00004440717,0.0000049673686,0.9878572,0.004169357,0.0069609303,0.0007191389,0.000009560582],"about_ca_topic_score_codex":0.0040181954,"about_ca_topic_score_gemma":0.003340088,"teacher_disagreement_score":0.0040181954,"about_ca_system_score_codex":0.00039414028,"about_ca_system_score_gemma":0.0004929954,"threshold_uncertainty_score":0.009718239},"labels":[],"label_agreement":null},{"id":"W1826657853","doi":"10.1007/978-3-540-87991-6_3","title":"Designing Privacy-Aware Personal Health Record Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Canada Research Chairs; University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Exploit; Patient privacy; Internet privacy; Computer security; Personally identifiable information; Information privacy; Privacy protection; Health care","score_opus":0.04319655399661164,"score_gpt":0.2650894761429417,"score_spread":0.22189292214633005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826657853","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.029637894,0.00040416673,0.9623655,0.0006783541,0.000060707596,0.0005155468,0.00009913377,0.0016273194,0.0046113865],"genre_scores_gemma":[0.43580025,0.00056738814,0.55568403,0.00031740748,0.000063797874,0.00030845008,0.00041456273,0.00021866732,0.006625483],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966953,0.001405511,0.0003245693,0.0004393255,0.0007748169,0.00036044308],"domain_scores_gemma":[0.9954457,0.0025986838,0.0003464751,0.0008767154,0.0005131687,0.00021924597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051249103,0.0003911915,0.00072188367,0.00062049384,0.0013093151,0.0036487975,0.0023238424,0.002046277,0.0031995026],"category_scores_gemma":[0.0126029095,0.0011223198,0.00061574613,0.00087599515,0.00081035914,0.004620735,0.0030983917,0.0013898914,0.0009252381],"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.0012333371,0.00092249346,0.0117718605,0.0012316538,0.0004211681,0.0019408639,0.0062166518,0.1728387,0.06806402,0.19458069,0.01900837,0.5217701],"study_design_scores_gemma":[0.00015293849,0.00032404167,0.0017506646,0.00010699854,0.0002445237,0.0009806802,0.0017923368,0.82349753,0.055584013,0.06831607,0.04716263,0.000087524924],"about_ca_topic_score_codex":0.0015201949,"about_ca_topic_score_gemma":0.0017512944,"teacher_disagreement_score":0.0051249103,"about_ca_system_score_codex":0.0007810359,"about_ca_system_score_gemma":0.0013120895,"threshold_uncertainty_score":0.027103424},"labels":[],"label_agreement":null},{"id":"W1826765467","doi":"10.1007/978-3-642-40760-4_64","title":"Diffusion Propagator Estimation from Sparse Measurements in a Tractography Framework","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health; National Center for Research Resources; U.S. Public Health Service; National Institutes of Health","keywords":"Propagator; Diffusion MRI; Computer science; Tractography; Artificial intelligence; Diffusion; Voxel; Exponential function; Algorithm; Computer vision; Pattern recognition (psychology); Physics; Mathematics; Mathematical analysis","score_opus":0.05872241666313185,"score_gpt":0.3324979438030909,"score_spread":0.27377552713995906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826765467","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.0014931903,0.000075076845,0.99808925,0.00007495937,0.000009741722,0.0000075118774,0.00002185042,0.00008755777,0.00014077459],"genre_scores_gemma":[0.14228202,0.0011139535,0.852305,0.000089301866,0.0001519931,0.00016277081,0.0003862339,0.00027199154,0.0032368158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954396,0.00018245599,0.000030586634,0.00009339546,0.00011866808,0.000030824056],"domain_scores_gemma":[0.9966557,0.0025205647,0.00026315005,0.00020422328,0.0002489248,0.00010742984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014177657,0.0010021495,0.0013712686,0.0010059745,0.00044183692,0.0016082574,0.0012096744,0.0021925766,0.0014582701],"category_scores_gemma":[0.00857678,0.0012344439,0.0011349536,0.0014611356,0.0011315343,0.0021267575,0.0016887657,0.002716335,0.00071957277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017315784,0.00007064273,0.0005986472,0.00029392424,0.00012093208,0.00022859103,0.00016358444,0.81262636,0.01681843,0.06855969,0.0016328596,0.09871317],"study_design_scores_gemma":[0.000011078073,0.000017579961,0.00008651395,0.000012250152,0.000011702573,0.000057907448,0.000007945081,0.98174816,0.0010335506,0.016325595,0.00067399204,0.000013773073],"about_ca_topic_score_codex":0.003983269,"about_ca_topic_score_gemma":0.0041822917,"teacher_disagreement_score":0.003983269,"about_ca_system_score_codex":0.0004993551,"about_ca_system_score_gemma":0.0016545785,"threshold_uncertainty_score":0.007920146},"labels":[],"label_agreement":null},{"id":"W182693664","doi":"10.1007/978-3-642-30353-1_32","title":"Bayesian Multiple Imputation Approaches for One-Class Classification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Imputation (statistics); Bayesian probability; Class (philosophy); Computer science; Artificial intelligence; Machine learning; Missing data","score_opus":0.05957947064101748,"score_gpt":0.26559070127584306,"score_spread":0.20601123063482557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182693664","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.0014290599,0.00050923007,0.99673235,0.00019358603,0.0000764673,0.000045860896,0.00015735686,0.00043041422,0.000425723],"genre_scores_gemma":[0.08027495,0.00095668394,0.90806407,0.00034222487,0.0005390894,0.0005998511,0.002590728,0.00047390602,0.006158482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9851386,0.00833087,0.00086725963,0.0028852823,0.0021102314,0.0006677471],"domain_scores_gemma":[0.9539431,0.031542756,0.0015627737,0.008216662,0.004245366,0.0004894441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023978714,0.0018299512,0.0059728036,0.003247056,0.0023218102,0.0045788256,0.015518807,0.0053316667,0.00833361],"category_scores_gemma":[0.051050022,0.0023144116,0.0051297387,0.0062013627,0.0019306,0.0067350557,0.004864291,0.009184911,0.004639033],"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.00050509226,0.0005143141,0.0047486695,0.00058252976,0.001149832,0.00030499636,0.0007193303,0.20153895,0.00082685717,0.13443796,0.018500183,0.6361714],"study_design_scores_gemma":[0.00003669563,0.000038473267,0.0005986816,0.00006456075,0.000095539806,0.0001195671,0.0000554769,0.81643593,0.00039335823,0.17926516,0.0028518578,0.000044689357],"about_ca_topic_score_codex":0.005950589,"about_ca_topic_score_gemma":0.007823521,"teacher_disagreement_score":0.023978714,"about_ca_system_score_codex":0.0017616441,"about_ca_system_score_gemma":0.0020430554,"threshold_uncertainty_score":0.12681305},"labels":[],"label_agreement":null},{"id":"W1827256152","doi":"10.1007/978-3-642-02617-1_24","title":"A New Approach to Malware Detection","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Malware; False positive paradox; Obfuscation; Control flow graph; Control flow; Static analysis; Theoretical computer science; Graph; Programming language; Artificial intelligence; Computer security","score_opus":0.016001097704972954,"score_gpt":0.24945288979793973,"score_spread":0.23345179209296676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827256152","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.0024207002,0.002665579,0.9600933,0.0012257735,0.0011784377,0.00012888528,0.00013023253,0.0012349884,0.030922113],"genre_scores_gemma":[0.05965909,0.006289386,0.8290408,0.00174307,0.002016797,0.00039434223,0.00042882483,0.00056701107,0.099860735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983967,0.00016475805,0.00006763262,0.00042928624,0.0008559122,0.000085840584],"domain_scores_gemma":[0.99855965,0.0005312527,0.00008217624,0.0003798077,0.0003740563,0.00007312267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006543607,0.0016709126,0.001276223,0.00307347,0.0013078395,0.0035151225,0.002407812,0.0021086973,0.009365751],"category_scores_gemma":[0.002146329,0.00079906493,0.0015018322,0.0015346572,0.0022055588,0.0065299347,0.0031359624,0.0030024168,0.005118979],"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.00006589232,0.00019150038,0.00046370112,0.00045963467,0.00009667208,0.00023534328,0.00025656543,0.0061758305,0.028768439,0.3243776,0.032340158,0.60656863],"study_design_scores_gemma":[0.00002676615,0.00016149906,0.000628622,0.00014612268,0.00012510306,0.0028171903,0.0001414446,0.15727015,0.03043452,0.58916914,0.21897444,0.00010504235],"about_ca_topic_score_codex":0.00053471525,"about_ca_topic_score_gemma":0.0007755185,"teacher_disagreement_score":0.009365751,"about_ca_system_score_codex":0.0008157359,"about_ca_system_score_gemma":0.0007581059,"threshold_uncertainty_score":0.03133154},"labels":[],"label_agreement":null},{"id":"W1827386195","doi":"10.1007/3-540-45108-0_58","title":"Inspecting and Visualizing Distributed Bayesian Student Models","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":60,"is_retracted":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":"Bayesian network; Computer science; Visualization; Bayesian probability; Bayesian inference; Artificial intelligence; Variable-order Bayesian network; Process (computing); Graphical model; Machine learning; Data science","score_opus":0.023026776971274834,"score_gpt":0.27148615854482533,"score_spread":0.2484593815735505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827386195","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.053676542,0.00026076712,0.93497086,0.00036813237,0.000033492084,0.00005224402,0.0005500399,0.007095037,0.0029929576],"genre_scores_gemma":[0.5265232,0.0005900432,0.46479222,0.00011161363,0.00005267209,0.00010994592,0.0016943153,0.0010178513,0.0051081693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00015804204,0.000021738086,0.0000840413,0.00013034271,0.000033147127],"domain_scores_gemma":[0.99550796,0.0032834294,0.000250615,0.00044346912,0.00036272558,0.00015189005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017513644,0.0007479827,0.0006043591,0.00166142,0.00040541668,0.0020802647,0.001175966,0.0012130643,0.005624379],"category_scores_gemma":[0.007699049,0.0007495675,0.00073079235,0.0013135661,0.0005097798,0.0025156753,0.0015194634,0.0014458796,0.0009462697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005532636,0.00022488614,0.012557038,0.00029039316,0.00013573343,0.00047449046,0.0023937223,0.54509956,0.013955743,0.06336095,0.018701006,0.3422532],"study_design_scores_gemma":[0.000015098045,0.00001651161,0.0007132435,0.000013954012,0.000011918301,0.000066936474,0.00012599242,0.97368705,0.0014972284,0.021732766,0.002106773,0.000012471275],"about_ca_topic_score_codex":0.009648996,"about_ca_topic_score_gemma":0.014948202,"teacher_disagreement_score":0.009648996,"about_ca_system_score_codex":0.00067890476,"about_ca_system_score_gemma":0.00094792334,"threshold_uncertainty_score":0.019185662},"labels":[],"label_agreement":null},{"id":"W1827647151","doi":"10.1007/11587552_16","title":"Generic Middleware Substrate Through Modelware","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Reusability; Separation of concerns; Aspect-oriented programming; Reuse; Distributed computing; Benchmark (surveying); Coding (social sciences); Component (thermodynamics); Architecture; Programming paradigm; Computer architecture; Software engineering; Operating system; Programming language; Software","score_opus":0.062277456953522964,"score_gpt":0.28200170687608966,"score_spread":0.2197242499225667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827647151","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.00515912,0.00031394904,0.9482209,0.00025305062,0.00018430203,0.00008898743,0.00019283417,0.02133397,0.02425282],"genre_scores_gemma":[0.16819276,0.0014273359,0.7578295,0.00048651476,0.00012695127,0.00032899054,0.0026372974,0.009742937,0.059227645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.00014821108,0.00008770203,0.000197698,0.00031715608,0.00010272139],"domain_scores_gemma":[0.9990403,0.00012593018,0.000039893996,0.0006362078,0.00009007346,0.000067557055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010705935,0.0010328434,0.00078756234,0.001216045,0.00071706425,0.0044101197,0.0029587185,0.0018173946,0.013602418],"category_scores_gemma":[0.002037918,0.0010524688,0.0011984286,0.0013950106,0.0008373525,0.005096761,0.0032699208,0.002891464,0.0074067228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026437626,0.00026591364,0.0012013951,0.00078123424,0.00016546735,0.0009808512,0.0011594356,0.023127807,0.04719547,0.5145512,0.031456754,0.37885016],"study_design_scores_gemma":[0.00008892093,0.00017376267,0.0006917166,0.00033712445,0.00022210811,0.0017081043,0.00024012887,0.13812055,0.06527954,0.25207555,0.5409441,0.00011831426],"about_ca_topic_score_codex":0.00079852325,"about_ca_topic_score_gemma":0.0009783524,"teacher_disagreement_score":0.013602418,"about_ca_system_score_codex":0.00082119025,"about_ca_system_score_gemma":0.0010057238,"threshold_uncertainty_score":0.04550457},"labels":[],"label_agreement":null},{"id":"W182773067","doi":"10.1007/978-3-642-33503-7_27","title":"A Novel Distributed Tuned Mass Damper Design Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vibration Control and Rheological Fluids","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":"Ontario Tech University; Concordia University","funders":"","keywords":"Tuned mass damper; Computer science; Damper; Vibration; Focus (optics); Mode (computer interface); Spring (device); Work (physics); Design methods; Vibration control; Optimal design; Control theory (sociology); Structural engineering; Mechanical engineering; Engineering; Artificial intelligence; Acoustics","score_opus":0.024369952649202782,"score_gpt":0.20761223635821122,"score_spread":0.18324228370900844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182773067","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.0019617889,0.000051806368,0.99495524,0.00002504108,0.000031752792,0.000019267785,0.000004974932,0.00019826464,0.0027517907],"genre_scores_gemma":[0.4338934,0.00022174286,0.54608685,0.00018196783,0.00013961046,0.00020036189,0.00005575699,0.00016843594,0.01905176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997873,0.000034413304,0.000008634445,0.000058159436,0.00009467671,0.000016985206],"domain_scores_gemma":[0.9998902,0.000030065836,0.000014254635,0.000019905174,0.00003831696,0.0000072505595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023396553,0.0007807922,0.0006039016,0.00031862652,0.00040240597,0.00058437634,0.0012999002,0.0010378729,0.006405584],"category_scores_gemma":[0.00036787297,0.00032634646,0.00042671402,0.00019667653,0.0002548341,0.00050693855,0.0007083572,0.00056170946,0.0012521698],"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.00034293733,0.00026993826,0.00033427245,0.00036855915,0.000100046454,0.00020386562,0.00016173982,0.3009575,0.22697258,0.032497443,0.0036652142,0.4341258],"study_design_scores_gemma":[0.00004286031,0.00020161645,0.00012727192,0.000013417346,0.000032932006,0.00012781822,0.000012131623,0.97829264,0.010100912,0.0041787857,0.0068570576,0.000012512306],"about_ca_topic_score_codex":0.00035136173,"about_ca_topic_score_gemma":0.0007253651,"teacher_disagreement_score":0.006405584,"about_ca_system_score_codex":0.00020209147,"about_ca_system_score_gemma":0.00020283315,"threshold_uncertainty_score":0.021428823},"labels":[],"label_agreement":null},{"id":"W1827782689","doi":"10.1007/978-3-540-39737-3_42","title":"A Poisson Model for User Accesses to Web Pages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Session (web analytics); Premise; Web page; Aggregate (composite); World Wide Web; Static web page; Web navigation; Information retrieval","score_opus":0.04229435295853148,"score_gpt":0.2859099418737206,"score_spread":0.2436155889151891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827782689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09650995,0.0028217535,0.8780798,0.0055021606,0.0005624154,0.00060411455,0.0041999565,0.0018871571,0.009832703],"genre_scores_gemma":[0.8097745,0.0069753714,0.08135867,0.0018369961,0.002195417,0.0016579244,0.0050887377,0.0008068055,0.09030553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914238,0.003416516,0.00050138915,0.0017352839,0.001653619,0.0012694288],"domain_scores_gemma":[0.9556416,0.033190776,0.0022515112,0.003481852,0.004211037,0.0012231487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01570606,0.0024327545,0.0057651014,0.0050163856,0.001941063,0.005755483,0.013335748,0.0081200525,0.016397564],"category_scores_gemma":[0.04459196,0.0045182155,0.0048105037,0.006881301,0.003590174,0.011599925,0.002982219,0.007223341,0.009966796],"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.0008803085,0.00066002016,0.015243851,0.00054527406,0.00059600105,0.0013479377,0.0016086007,0.42326722,0.0024472915,0.48514548,0.020050477,0.048207495],"study_design_scores_gemma":[0.000096352625,0.0001045501,0.0014675014,0.000048954138,0.00016418529,0.0004969135,0.0001246446,0.9310611,0.00030062464,0.064171866,0.0018758487,0.00008744414],"about_ca_topic_score_codex":0.0231832,"about_ca_topic_score_gemma":0.014760576,"teacher_disagreement_score":0.0231832,"about_ca_system_score_codex":0.0037435547,"about_ca_system_score_gemma":0.0021588781,"threshold_uncertainty_score":0.08306259},"labels":[],"label_agreement":null},{"id":"W1827858626","doi":"10.1007/978-3-642-13437-1_63","title":"Theoretical Model for Interplay between Some Learning Situations and Brainwaves","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Unconscious mind; Artificial intelligence; Cognitive science; Psychology; Psychoanalysis","score_opus":0.020508071653170583,"score_gpt":0.28110743747784334,"score_spread":0.26059936582467275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827858626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108084366,0.0008451811,0.64242923,0.010810057,0.00021250169,0.00014998704,0.0007276375,0.00042269268,0.23631835],"genre_scores_gemma":[0.937994,0.00062298245,0.036866367,0.000535935,0.00016984905,0.0002682339,0.00019448607,0.00005199416,0.023296239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972624,0.00007613758,0.000012677066,0.00006786816,0.000058809997,0.000058381942],"domain_scores_gemma":[0.9993229,0.00041266985,0.000062090905,0.000050376588,0.00009494063,0.000057045894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048498774,0.0005169969,0.00038887173,0.00078714144,0.0006748703,0.0018296535,0.0015605704,0.0014133912,0.01447331],"category_scores_gemma":[0.0014970168,0.0002994938,0.00063863484,0.00059446436,0.001352635,0.0024263933,0.00096634723,0.0011770581,0.0014453222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020762038,0.00005851303,0.0005416758,0.00006205734,0.000020880285,0.00015579254,0.000340794,0.010291741,0.0014358299,0.9798362,0.0012607594,0.005974913],"study_design_scores_gemma":[0.000034022047,0.000048910195,0.00074143434,0.000020276531,0.00002957999,0.00023618799,0.00025800877,0.082470305,0.00035475226,0.91266036,0.0031297256,0.000016441181],"about_ca_topic_score_codex":0.0013866284,"about_ca_topic_score_gemma":0.00084402895,"teacher_disagreement_score":0.01447331,"about_ca_system_score_codex":0.0007776023,"about_ca_system_score_gemma":0.00070564187,"threshold_uncertainty_score":0.048418105},"labels":[],"label_agreement":null},{"id":"W1828328674","doi":"10.1007/978-3-642-10604-0_11","title":"NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia; Simon Fraser University","funders":"","keywords":"Heuristics; Computer science; Simple (philosophy); Base pair; Computational complexity theory; Completeness (order theory); Energy (signal processing); Folding (DSP implementation); Theoretical computer science; Algorithm; DNA; Mathematics; Physics; Biology; Quantum mechanics; Genetics","score_opus":0.008041545332479626,"score_gpt":0.23848124325663617,"score_spread":0.23043969792415653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828328674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15926363,0.0056297434,0.6532038,0.017123215,0.0012209697,0.00074044673,0.0071987524,0.002001235,0.15361825],"genre_scores_gemma":[0.7393244,0.0029717598,0.20485908,0.0028412584,0.0008649881,0.0012140201,0.005974545,0.0012383258,0.040711757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677724,0.0009840239,0.00018081517,0.0007266356,0.00078229344,0.00054891274],"domain_scores_gemma":[0.98027647,0.017029922,0.00046333065,0.0010893537,0.00078481616,0.00035604517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019813161,0.0016141967,0.0026767077,0.0009004252,0.0022339968,0.0052387295,0.0043676435,0.004367662,0.016223133],"category_scores_gemma":[0.016090663,0.0017563368,0.0031425192,0.0020105573,0.0036762743,0.009444628,0.003451571,0.0077101314,0.0018089354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008817112,0.0004815495,0.0010262075,0.0020321475,0.00031238009,0.00077930454,0.0006140614,0.37796134,0.003218796,0.5075665,0.047592036,0.05753386],"study_design_scores_gemma":[0.00018606815,0.000045379667,0.00020921821,0.00009149067,0.00005272218,0.00026493936,0.00013780178,0.15858045,0.0010360065,0.8338739,0.0054878574,0.00003414869],"about_ca_topic_score_codex":0.00479392,"about_ca_topic_score_gemma":0.004358341,"teacher_disagreement_score":0.016223133,"about_ca_system_score_codex":0.0022930042,"about_ca_system_score_gemma":0.002762476,"threshold_uncertainty_score":0.054271758},"labels":[],"label_agreement":null},{"id":"W1828336234","doi":"10.1007/3-540-45812-3_22","title":"A Management Framework for Service Personalization","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Service provider; Personalization; Service (business); Content management; Computer network; Differentiated service; Service delivery framework; World Wide Web; Server; Database; Service design","score_opus":0.024168197644172353,"score_gpt":0.23974750485183527,"score_spread":0.2155793072076629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828336234","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.003637087,0.00039146436,0.9731189,0.0007275361,0.00017610673,0.00020155431,0.00019966833,0.0089560095,0.012591748],"genre_scores_gemma":[0.16578601,0.0009394859,0.80095583,0.0005168674,0.00033809047,0.00050741,0.0009717478,0.001459341,0.02852527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980861,0.00038134938,0.00020229183,0.00031335757,0.0007176863,0.00029928458],"domain_scores_gemma":[0.9981932,0.00041526515,0.00010218138,0.00075347174,0.00032858088,0.00020725273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003748653,0.0009053266,0.0010108631,0.0017732024,0.0021320323,0.006262847,0.0032588432,0.0021513095,0.008573796],"category_scores_gemma":[0.0036883135,0.0011115161,0.0011837132,0.002003584,0.0017114825,0.008224246,0.0034145878,0.0036429083,0.0027883973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013746142,0.00022080171,0.0005904916,0.00014715004,0.000044597622,0.0002291191,0.00061156513,0.017096326,0.0041319504,0.7784911,0.029754683,0.1685448],"study_design_scores_gemma":[0.000069445974,0.00007438723,0.0003039461,0.000117737596,0.000109027256,0.00043332763,0.00023994694,0.3873229,0.008071243,0.40909415,0.1940675,0.00009644681],"about_ca_topic_score_codex":0.00741745,"about_ca_topic_score_gemma":0.006940107,"teacher_disagreement_score":0.008573796,"about_ca_system_score_codex":0.001991141,"about_ca_system_score_gemma":0.0022516255,"threshold_uncertainty_score":0.028682232},"labels":[],"label_agreement":null},{"id":"W1828761215","doi":"10.1007/978-3-540-30110-3_154","title":"Source Separation on Astrophysical Data Sets from the WMAP Satellite","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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 British Columbia","funders":"","keywords":"CMB cold spot; Cosmic microwave background; Satellite; Physics; Separation (statistics); Blind signal separation; Astrophysics; COSMIC cancer database; Cosmic background radiation; Computer science; Astronomy; Telecommunications","score_opus":0.03245364716193739,"score_gpt":0.2932755807177369,"score_spread":0.2608219335557995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828761215","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.32666698,0.0028146915,0.6513518,0.0008398069,0.00032683893,0.00012745126,0.0069209253,0.00310918,0.00784232],"genre_scores_gemma":[0.43152383,0.0019712218,0.53739506,0.00012468144,0.00033694727,0.00012711086,0.018012075,0.0006381081,0.009871085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996178,0.000082697516,0.000022987717,0.0000662773,0.00017434188,0.000035791723],"domain_scores_gemma":[0.99910396,0.00046447644,0.00005917349,0.0001786612,0.00016538563,0.00002821191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849147,0.0009686074,0.0005241912,0.001590542,0.0004931535,0.0007046212,0.0008269496,0.00075993885,0.0014027354],"category_scores_gemma":[0.0037016214,0.00034515845,0.0008988176,0.0033104853,0.00041734104,0.0010437886,0.00096967665,0.0009662824,0.0011260348],"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.0010943615,0.00013763242,0.004987862,0.0005814148,0.0003446346,0.000518612,0.00043022895,0.13743566,0.060407322,0.007124774,0.018330516,0.768607],"study_design_scores_gemma":[0.00018183819,0.00015750958,0.03337521,0.00010833851,0.00020734081,0.000980916,0.0002983163,0.81121385,0.09569767,0.03675207,0.020890344,0.00013669435],"about_ca_topic_score_codex":0.006178948,"about_ca_topic_score_gemma":0.006792026,"teacher_disagreement_score":0.006178948,"about_ca_system_score_codex":0.00035292393,"about_ca_system_score_gemma":0.0005021476,"threshold_uncertainty_score":0.012285948},"labels":[],"label_agreement":null},{"id":"W1828773426","doi":"10.1007/978-3-642-21043-3_23","title":"Correcting Different Types of Errors in Texts","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Spelling; Computer science; Punctuation; Natural language processing; Artificial intelligence; Word (group theory); Verb; Error detection and correction; Speech recognition; Linguistics; Algorithm","score_opus":0.018046131009018113,"score_gpt":0.2580295709324431,"score_spread":0.239983439923425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828773426","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.12493015,0.0049580364,0.81214654,0.0034650504,0.003032646,0.00048101036,0.003149095,0.02652788,0.021309525],"genre_scores_gemma":[0.39816165,0.002890842,0.5376267,0.00073186244,0.001115375,0.00020465495,0.005059033,0.008769213,0.04544069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899877,0.001809357,0.0013025166,0.002511787,0.0038236403,0.0005651106],"domain_scores_gemma":[0.94145966,0.028626256,0.0043698796,0.015514842,0.0094767595,0.0005525587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039778994,0.001921792,0.0014781485,0.0048898472,0.0014322611,0.0034017882,0.0035158477,0.0034023442,0.011001751],"category_scores_gemma":[0.052776873,0.0009764024,0.0013884915,0.004380479,0.0019302085,0.008025542,0.0041776374,0.002351731,0.005535632],"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.0007215537,0.00016652729,0.004845657,0.0015074398,0.00017089896,0.0010180401,0.0022023655,0.0084743695,0.025385434,0.023783451,0.020311639,0.9114126],"study_design_scores_gemma":[0.00021786321,0.0007492895,0.007932932,0.0018025644,0.0015587542,0.006602221,0.0021742962,0.14387715,0.4724812,0.19059995,0.1715314,0.0004724487],"about_ca_topic_score_codex":0.0009564962,"about_ca_topic_score_gemma":0.0011574565,"teacher_disagreement_score":0.011001751,"about_ca_system_score_codex":0.00085706444,"about_ca_system_score_gemma":0.0012127918,"threshold_uncertainty_score":0.036804497},"labels":[],"label_agreement":null},{"id":"W1828795277","doi":"10.1007/11752707_7","title":"Task Model Simulation Using Interaction Templates","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Template; Computer science; Task (project management); Interface (matter); Human–computer interaction; Interaction model; User interface; Programming language; Engineering; Systems engineering; World Wide Web; Parallel computing","score_opus":0.054642949292832,"score_gpt":0.2979695804981059,"score_spread":0.2433266312052739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828795277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010183147,0.000023698254,0.9776414,0.00007057282,0.000048265803,0.0002128046,0.00036234272,0.0030885357,0.008369253],"genre_scores_gemma":[0.4014811,0.00014869678,0.57460845,0.00008524211,0.000024280287,0.0018315885,0.001624654,0.0014743076,0.018721774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994481,0.00021492675,0.00004463665,0.00009580582,0.00015243977,0.000044046494],"domain_scores_gemma":[0.99744284,0.0017879573,0.00007402813,0.00037693995,0.00024931965,0.000068873276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009720062,0.00081926316,0.00078194216,0.0006972552,0.0005916508,0.0014584291,0.0018502111,0.0014729797,0.021165619],"category_scores_gemma":[0.0069057285,0.00093760714,0.0012101872,0.0006674731,0.00040086836,0.0014979052,0.0012397948,0.0011629437,0.0030146872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015435072,0.00010189709,0.0006255648,0.00010534914,0.000045269455,0.00012555471,0.00034506666,0.92593634,0.0016245936,0.03130645,0.0024988777,0.03713078],"study_design_scores_gemma":[0.000022197582,0.000014499447,0.000040701525,0.000009039612,0.0000075879675,0.000016213804,0.000016158003,0.9895846,0.00084494636,0.0073079783,0.002128906,0.0000070750707],"about_ca_topic_score_codex":0.0067243143,"about_ca_topic_score_gemma":0.0050317524,"teacher_disagreement_score":0.021165619,"about_ca_system_score_codex":0.00070118107,"about_ca_system_score_gemma":0.0014292138,"threshold_uncertainty_score":0.07080603},"labels":[],"label_agreement":null},{"id":"W1828993462","doi":"10.1007/978-3-540-45187-7_28","title":"Abstract Patterns of Compositional Reasoning","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Reasoning system; Component (thermodynamics); Deductive reasoning; Construct (python library); Process (computing); Opportunistic reasoning; Composition (language); Adaptive reasoning; Model-based reasoning; Theoretical computer science; Non-monotonic logic; State (computer science); Automated reasoning; Artificial intelligence; Programming language; Knowledge representation and reasoning","score_opus":0.023222640806348102,"score_gpt":0.2769562714368946,"score_spread":0.2537336306305465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828993462","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.01736294,0.00050903583,0.86166555,0.0010350023,0.00019189689,0.0001539189,0.0001749055,0.001120779,0.11778592],"genre_scores_gemma":[0.47359842,0.00088738103,0.4709697,0.00042311152,0.00027411297,0.000538443,0.00076620345,0.0008497895,0.051692773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725384,0.0008458543,0.00024086461,0.00055543386,0.00087040133,0.0002335885],"domain_scores_gemma":[0.9966331,0.0013652225,0.00014167091,0.0013588784,0.0004061032,0.00009514836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019154898,0.0007779989,0.0007321129,0.0013964004,0.0017449097,0.0039941687,0.0014935752,0.0013027367,0.015620352],"category_scores_gemma":[0.0069486406,0.0010786441,0.0015187019,0.0018468492,0.0048372974,0.011068788,0.0035409671,0.003190611,0.0031810408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014571933,0.000008748126,0.000055758002,0.000035642333,0.0000056690237,0.00003440823,0.00035038806,0.0004777438,0.000489288,0.9843485,0.0009064922,0.013272883],"study_design_scores_gemma":[0.000008607267,0.0000047695676,0.000025665326,0.000015114336,0.000008738068,0.000041165662,0.00007124119,0.0026320359,0.00077799795,0.9867035,0.009707073,0.0000039443144],"about_ca_topic_score_codex":0.0008157778,"about_ca_topic_score_gemma":0.0009415644,"teacher_disagreement_score":0.015620352,"about_ca_system_score_codex":0.0010324749,"about_ca_system_score_gemma":0.00082145754,"threshold_uncertainty_score":0.052255273},"labels":[],"label_agreement":null},{"id":"W1829031287","doi":"10.1007/978-3-642-20398-5_19","title":"Symmetry for the Analysis of Dynamic Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Model checking; Graph rewriting; Computer science; Quotient; Reduction (mathematics); Symmetry (geometry); Graph; Transformation (genetics); Theoretical computer science; Graph reduction; Algorithm; Mathematics; Pure mathematics","score_opus":0.017230861151349215,"score_gpt":0.24339685893441645,"score_spread":0.22616599778306723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829031287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013659695,0.0049510133,0.9334357,0.0010782371,0.0006599103,0.000062730556,0.00025255114,0.0003484466,0.045551665],"genre_scores_gemma":[0.61252075,0.010455344,0.31903496,0.0010803727,0.0028393685,0.000559583,0.0009970549,0.0008431012,0.051669437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993062,0.0002536026,0.000049336744,0.0000983635,0.00023649118,0.000056076355],"domain_scores_gemma":[0.9990922,0.00046775577,0.0000732351,0.00017969924,0.000133284,0.00005376852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015792752,0.0009918673,0.0012806235,0.0013316554,0.0006697841,0.0015504203,0.0010424525,0.0007333464,0.0070444667],"category_scores_gemma":[0.0030868468,0.00039517772,0.0018379365,0.0012365038,0.002312468,0.0030323898,0.0014655504,0.002930844,0.0019025647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011801508,0.000009322701,0.00006489629,0.00006473508,0.000012333951,0.000033791337,0.00007231576,0.0024892373,0.00068328803,0.9806613,0.002382443,0.013514474],"study_design_scores_gemma":[0.000005031655,0.000008430318,0.000051054474,0.0000105217005,0.0000046740997,0.000027908634,0.000011130737,0.01111268,0.00019422265,0.98438543,0.004182993,0.000005794852],"about_ca_topic_score_codex":0.0009958684,"about_ca_topic_score_gemma":0.000556855,"teacher_disagreement_score":0.0070444667,"about_ca_system_score_codex":0.0010950838,"about_ca_system_score_gemma":0.00080521643,"threshold_uncertainty_score":0.023566067},"labels":[],"label_agreement":null},{"id":"W182907944","doi":"10.1007/978-3-642-37456-2_32","title":"Location Recommendation Based on Periodicity of Human Activities and Location Categories","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Probabilistic logic; Recommender system; Precision and recall; Information retrieval; Statistical model; Service (business); Data mining; Artificial intelligence","score_opus":0.020777179042808663,"score_gpt":0.2803898349316141,"score_spread":0.25961265588880544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182907944","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.6757541,0.0056352797,0.29177648,0.0006641005,0.0005213678,0.00039689493,0.0100850705,0.0030634454,0.012103308],"genre_scores_gemma":[0.9226242,0.0008375201,0.06421949,0.00010507867,0.0002518923,0.00012402778,0.0066032335,0.00006406273,0.005170553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994566,0.000072316776,0.000044220105,0.00017940409,0.0001566346,0.00009080492],"domain_scores_gemma":[0.9987357,0.0005098403,0.000094219016,0.00011823947,0.00045299504,0.000089024266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047508517,0.00070006936,0.0011135835,0.0035450193,0.00038750234,0.00059581205,0.0009181253,0.0007465396,0.0027694863],"category_scores_gemma":[0.0021141334,0.00022645359,0.00089122565,0.0034359398,0.00013550658,0.000919721,0.0003712288,0.0003870499,0.0015179522],"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.0024160063,0.0008642225,0.15849952,0.00053315156,0.00070786604,0.00032849473,0.00018823388,0.03589282,0.014449549,0.0013821747,0.03531222,0.7494257],"study_design_scores_gemma":[0.00014202764,0.00046268973,0.07722515,0.00006436532,0.00046611147,0.00048888696,0.00026535164,0.90939146,0.004746861,0.0021473446,0.004515211,0.000084446845],"about_ca_topic_score_codex":0.014403928,"about_ca_topic_score_gemma":0.03587842,"teacher_disagreement_score":0.014403928,"about_ca_system_score_codex":0.00043872278,"about_ca_system_score_gemma":0.0004961785,"threshold_uncertainty_score":0.02864021},"labels":[],"label_agreement":null},{"id":"W1829144360","doi":"10.1007/978-3-540-25944-2_10","title":"A {k, n}-Secret Sharing Scheme for Color Images","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Secret sharing; RGB color model; Computer science; Color image; High color; Shamir's Secret Sharing; Encryption; Artificial intelligence; Color space; Color depth; Computer vision; Cryptography; Image (mathematics); Binary number; Binary image; Homomorphic secret sharing; Mathematics; Image processing; Algorithm; Arithmetic; Computer security","score_opus":0.018922274439057914,"score_gpt":0.2640490768138593,"score_spread":0.2451268023748014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829144360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16688238,0.00096535595,0.78403556,0.001407842,0.00034682223,0.00047477233,0.0010631606,0.0020968425,0.04272724],"genre_scores_gemma":[0.7492103,0.00050478714,0.22616783,0.00040089063,0.00009426651,0.00028056488,0.0004612416,0.00008246878,0.022797756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991574,0.00017260728,0.00006994466,0.00017003888,0.00025327553,0.00017677994],"domain_scores_gemma":[0.99894613,0.00022272998,0.00013901474,0.00046668397,0.00013226982,0.00009319018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065985235,0.0005523744,0.0007671129,0.00042750838,0.0013243001,0.0012750032,0.0012850717,0.0011848683,0.004716757],"category_scores_gemma":[0.0012409532,0.00031687375,0.0006663304,0.0009863657,0.00087841897,0.002149341,0.0023162025,0.00092721794,0.0013369967],"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.0023543516,0.0004813134,0.00091792754,0.00072361063,0.00023349629,0.0005405594,0.0005524941,0.033981882,0.22908929,0.41710338,0.0170553,0.2969664],"study_design_scores_gemma":[0.0006272646,0.0011093805,0.0024449108,0.00019643865,0.00025163853,0.002282774,0.00015880604,0.35220706,0.15985966,0.42885146,0.051705986,0.00030463628],"about_ca_topic_score_codex":0.0007070633,"about_ca_topic_score_gemma":0.0010115211,"teacher_disagreement_score":0.004716757,"about_ca_system_score_codex":0.0011688743,"about_ca_system_score_gemma":0.0016856381,"threshold_uncertainty_score":0.015779138},"labels":[],"label_agreement":null},{"id":"W1829370927","doi":"10.1007/978-3-540-74628-7_11","title":"Disambiguating Hypernym Relations for Roget’s Thesaurus","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"Thesaurus; Computer science; Natural language processing; Relation (database); Information retrieval; Artificial intelligence; Semantic relation; Psychology; Data mining; Neuroscience","score_opus":0.03043405292626822,"score_gpt":0.2972423155458985,"score_spread":0.26680826261963025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829370927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35613334,0.00676079,0.57480675,0.0018972057,0.0013297774,0.00063323206,0.0074973,0.0067561436,0.044185437],"genre_scores_gemma":[0.5164001,0.0015777039,0.4599619,0.00027563627,0.00023405021,0.00017185434,0.012924962,0.0010163225,0.0074374652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998262,0.00047993308,0.00032009027,0.00045849633,0.00035614477,0.00012335872],"domain_scores_gemma":[0.99808997,0.0009024521,0.00016540996,0.00033686348,0.00037894797,0.00012639255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453222,0.00073338836,0.0009612683,0.010351745,0.0022019132,0.003066574,0.0011379578,0.0014161236,0.0066886237],"category_scores_gemma":[0.005784191,0.00076845405,0.0011695386,0.0049823713,0.001128252,0.006979863,0.004575308,0.0015602517,0.0033018512],"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.00085779343,0.00035360805,0.008909469,0.0021468643,0.00032617123,0.004291156,0.013700365,0.003423313,0.096612774,0.22333746,0.0430162,0.60302484],"study_design_scores_gemma":[0.00028236993,0.00031882332,0.019168505,0.0016098233,0.0006461013,0.009808038,0.012138826,0.07944135,0.070795015,0.33421037,0.47117937,0.00040136746],"about_ca_topic_score_codex":0.002112591,"about_ca_topic_score_gemma":0.0047261794,"teacher_disagreement_score":0.010351745,"about_ca_system_score_codex":0.0008853273,"about_ca_system_score_gemma":0.0012006093,"threshold_uncertainty_score":0.022375703},"labels":[],"label_agreement":null},{"id":"W1829441069","doi":"10.1007/11785293_27","title":"Improved Algorithms for Quantum Identification of Boolean Oracles","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oracle; Upper and lower bounds; Computer science; Set (abstract data type); Matching (statistics); Algorithm; Range (aeronautics); Identification (biology); Combinatorics; Constant (computer programming); Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.014754574944311446,"score_gpt":0.25277256280066396,"score_spread":0.2380179878563525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829441069","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.013504744,0.00040074598,0.9726222,0.0005150497,0.0002305493,0.00011320929,0.0001560116,0.0017404491,0.010716979],"genre_scores_gemma":[0.25548443,0.00050562294,0.7238707,0.0004697058,0.00031745803,0.00047203526,0.0008880419,0.00078110956,0.01721088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934098,0.0020070611,0.00048156886,0.001091493,0.002141728,0.00086837943],"domain_scores_gemma":[0.9908309,0.004675818,0.0003384489,0.0027600327,0.0010736944,0.0003212558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041446947,0.0016829323,0.0028764547,0.0024837472,0.0020990956,0.0056807115,0.005279055,0.0036467821,0.018878954],"category_scores_gemma":[0.018108977,0.0015869554,0.0026081882,0.00323048,0.003263611,0.013003882,0.010100375,0.007388718,0.004744452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041552543,0.00022420149,0.000438725,0.00022287041,0.00007212917,0.00008825071,0.0004038857,0.03083521,0.004465812,0.7891093,0.009527951,0.16419621],"study_design_scores_gemma":[0.00008927838,0.000049712326,0.00020048307,0.000041230578,0.000042491698,0.00008398861,0.00007355419,0.26299992,0.004432916,0.72647923,0.005450002,0.000057168192],"about_ca_topic_score_codex":0.0013930014,"about_ca_topic_score_gemma":0.0021815007,"teacher_disagreement_score":0.018878954,"about_ca_system_score_codex":0.0037481205,"about_ca_system_score_gemma":0.002394642,"threshold_uncertainty_score":0.063156426},"labels":[],"label_agreement":null},{"id":"W1829733767","doi":"10.1007/978-3-642-35890-6_6","title":"Differential Privacy in Tripartite Interaction: A Case Study with Linguistic Minorities in Canada","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":true,"ca_institutions":"Institute of Population and Public Health; Montfort Hospital; University of Ottawa","funders":"","keywords":"Collusion; Adversary; Exploit; Agency (philosophy); Commit; Differential privacy; Computer security; Set (abstract data type); Computer science; Actuarial science; Internet privacy; Political science; Business; Economics; Sociology; Data mining; Microeconomics","score_opus":0.02634522509306795,"score_gpt":0.2587419615124739,"score_spread":0.23239673641940597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829733767","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.969047,0.00031212583,0.0013921768,0.003460435,0.000022696155,0.000083179715,0.00013668163,0.000015570868,0.025530169],"genre_scores_gemma":[0.9930646,0.00016388,0.0007071158,0.00026389267,0.0000047089557,0.00002318362,0.000050923358,0.000011155015,0.0057105506],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934661,0.002450068,0.000113138405,0.00046515718,0.00097324344,0.002532356],"domain_scores_gemma":[0.9914076,0.004128245,0.0006081301,0.0004569706,0.0013943464,0.002004667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210808,0.0003499845,0.00056719297,0.0011587573,0.04171477,0.007161469,0.0030577353,0.004080362,0.0054883324],"category_scores_gemma":[0.008378896,0.0003115352,0.00046761392,0.0045041726,0.01052939,0.002819974,0.0063685053,0.0030951367,0.0004977066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036979665,0.00056989177,0.082340404,0.0001559014,0.00007033986,0.015726723,0.7726518,0.0019502457,0.0008490334,0.06566493,0.011380941,0.04826997],"study_design_scores_gemma":[0.000028524457,0.00006081395,0.019502781,0.000116914016,0.000031710668,0.0013942206,0.94254297,0.0017230108,0.00032799764,0.0056933425,0.028521243,0.000056475255],"about_ca_topic_score_codex":0.94498914,"about_ca_topic_score_gemma":0.9712966,"teacher_disagreement_score":0.055010855,"about_ca_system_score_codex":0.03344425,"about_ca_system_score_gemma":0.052890386,"threshold_uncertainty_score":0.24265611},"labels":[],"label_agreement":null},{"id":"W1829867232","doi":"10.1007/978-3-642-14600-8_31","title":"Are Pixel Graphs Are Better at Representing Information than Pie Graphs?","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"Computer science; Bar chart; Pixel; Pie chart; Indifference graph; Chordal graph; Graph product; Graph; Theoretical computer science; Combinatorics; Artificial intelligence; 1-planar graph; Mathematics; Statistics","score_opus":0.019751181321976594,"score_gpt":0.24718884208148686,"score_spread":0.22743766075951027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829867232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11919145,0.013579162,0.78297967,0.012090989,0.0015364853,0.00020486116,0.0051935785,0.008219347,0.05700441],"genre_scores_gemma":[0.6317963,0.009459083,0.3305705,0.0026361132,0.0008875611,0.0001982097,0.0063096797,0.0027936806,0.015348958],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987771,0.00050603703,0.000063394036,0.00027923743,0.0002621215,0.000112120644],"domain_scores_gemma":[0.98723364,0.00847974,0.00085974566,0.0015095713,0.0015435611,0.0003737927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023907856,0.0011702842,0.001205438,0.002938124,0.00065313425,0.0060357074,0.0015640223,0.0021387942,0.022157548],"category_scores_gemma":[0.027119065,0.0007656012,0.0009990352,0.005109696,0.0011452798,0.023925077,0.00080656883,0.0012141891,0.004226752],"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.0011541562,0.00018275359,0.009524918,0.0011293637,0.00028100022,0.00008415517,0.0006379943,0.022445615,0.003701784,0.2619005,0.06246161,0.6364961],"study_design_scores_gemma":[0.00013602906,0.00028738394,0.0041981316,0.0003347462,0.00045375485,0.00036708903,0.0011375115,0.13258235,0.0072444915,0.80126923,0.051853582,0.00013562065],"about_ca_topic_score_codex":0.005172072,"about_ca_topic_score_gemma":0.004526536,"teacher_disagreement_score":0.022157548,"about_ca_system_score_codex":0.0008508364,"about_ca_system_score_gemma":0.0005003299,"threshold_uncertainty_score":0.074124396},"labels":[],"label_agreement":null},{"id":"W1829892363","doi":"10.1007/3-540-47555-9_44","title":"On the Development of a Fast Elliptic Curve Cryptosystem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Coprocessor; Smart card; Block (permutation group theory); Computer science; Elliptic Curve Digital Signature Algorithm; Cryptosystem; Embedded system; Development (topology); Key (lock); Arithmetic; Computer hardware; Elliptic curve cryptography; Mathematics; Operating system; Cryptography; Algorithm; Public-key cryptography; Geometry; Encryption","score_opus":0.023228337697772043,"score_gpt":0.2429639614934167,"score_spread":0.21973562379564465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829892363","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.02331267,0.013828417,0.81196934,0.0044937693,0.0022782655,0.00043892668,0.00019166402,0.001387851,0.14209908],"genre_scores_gemma":[0.24544758,0.02356447,0.6456616,0.0010029521,0.0012802209,0.0003606562,0.00038073506,0.0006144577,0.08168728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.00022239801,0.00005688507,0.000104073646,0.00053208193,0.00008972882],"domain_scores_gemma":[0.99881685,0.00049160875,0.00004024661,0.00023424305,0.0003540898,0.00006293465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015387476,0.00096953905,0.00059778104,0.0014963484,0.0010235055,0.0023384898,0.00103818,0.0011335284,0.007096284],"category_scores_gemma":[0.004083458,0.00078106276,0.000640194,0.0011682793,0.0017278,0.0070303692,0.0021158273,0.0034875283,0.0025076284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094384704,0.000056489902,0.00018815356,0.00021132594,0.000014781086,0.00014004605,0.0001906338,0.008663602,0.0046762577,0.83420146,0.007188797,0.14437407],"study_design_scores_gemma":[0.000097788296,0.00023419187,0.00025782836,0.0004242734,0.00003267822,0.0009110297,0.00008246782,0.07578864,0.019158833,0.6477087,0.25523084,0.00007275275],"about_ca_topic_score_codex":0.0006865021,"about_ca_topic_score_gemma":0.0005357317,"teacher_disagreement_score":0.007096284,"about_ca_system_score_codex":0.0013780186,"about_ca_system_score_gemma":0.0013660607,"threshold_uncertainty_score":0.023739457},"labels":[],"label_agreement":null},{"id":"W1830253132","doi":"10.1007/978-3-540-69132-7_113","title":"Cognitive Tutoring System with \"Consciousness\"","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Consciousness; Cognitive architecture; Cognition; Proposition; Cognitive systems; Architecture; Cognitive science; Human–computer interaction; State (computer science); Artificial intelligence; Programming language; Psychology","score_opus":0.016206837702765667,"score_gpt":0.22322380931363,"score_spread":0.20701697161086435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830253132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20684834,0.00042610127,0.71020484,0.0008178648,0.00034293786,0.00039617968,0.00048055063,0.04358409,0.036899053],"genre_scores_gemma":[0.85825884,0.000113546696,0.12748823,0.00038815182,0.000055092445,0.00018088422,0.00041080915,0.00020800238,0.012896442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999871,0.000029434046,0.000010499056,0.00004164593,0.000028792929,0.000018549168],"domain_scores_gemma":[0.9997013,0.00008944204,0.000016645121,0.000045811663,0.000068021924,0.00007865872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001942113,0.0002696205,0.0002736348,0.0002801549,0.00024098177,0.0007540222,0.0006352727,0.0005072624,0.007154143],"category_scores_gemma":[0.0010038213,0.00012203069,0.00021689369,0.00018401131,0.00017578898,0.0006246128,0.0011338249,0.0005380984,0.0012716644],"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.001303751,0.0012222293,0.0034096052,0.00042176788,0.00015520057,0.0006010891,0.0009917186,0.008128406,0.12123929,0.021153057,0.024117501,0.8172564],"study_design_scores_gemma":[0.001306657,0.0028714137,0.01591249,0.00015319808,0.0009073514,0.0029149996,0.0006361403,0.5302419,0.26494995,0.053709254,0.12614025,0.00025648778],"about_ca_topic_score_codex":0.0007164143,"about_ca_topic_score_gemma":0.00057314034,"teacher_disagreement_score":0.007154143,"about_ca_system_score_codex":0.00023090618,"about_ca_system_score_gemma":0.0006117807,"threshold_uncertainty_score":0.023932993},"labels":[],"label_agreement":null},{"id":"W1830327897","doi":"10.1007/978-3-642-10217-2_18","title":"LPF Computation Revisited","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":52,"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":"Suffix array; Computation; Table (database); Suffix; Algorithm; Permutation (music); Computer science; Position (finance); Mathematics; Data structure; Data mining; Physics","score_opus":0.015785971753027674,"score_gpt":0.2574532700920008,"score_spread":0.24166729833897313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830327897","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.014853704,0.008447359,0.51847816,0.012340076,0.0035243514,0.000043195505,0.0004497136,0.000772319,0.4410911],"genre_scores_gemma":[0.49950293,0.009635827,0.20152946,0.0039218003,0.0064295074,0.00021071521,0.0012453587,0.0015170106,0.27600738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00012779472,0.000031285264,0.00016038238,0.00028278478,0.00008527736],"domain_scores_gemma":[0.9989894,0.00045470698,0.000029300149,0.00030345123,0.00017624356,0.0000468664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324686,0.0006725698,0.0010459078,0.001535635,0.0017303786,0.003521333,0.001819646,0.0014662322,0.025595782],"category_scores_gemma":[0.0047411076,0.00041881643,0.0008097061,0.0023808097,0.0027826724,0.0074708303,0.0023111415,0.003918667,0.005201592],"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.000013918407,0.000006078681,0.00003996658,0.00003960756,0.0000033909898,0.00002687906,0.000053092896,0.0010165783,0.0001858072,0.96273154,0.009119214,0.02676399],"study_design_scores_gemma":[0.0000045499196,0.0000045677316,0.000057539604,0.00002828931,0.000003942546,0.00007835102,0.000031530846,0.008480277,0.00050349114,0.956559,0.034239408,0.000009107779],"about_ca_topic_score_codex":0.0020114724,"about_ca_topic_score_gemma":0.0015787926,"teacher_disagreement_score":0.025595782,"about_ca_system_score_codex":0.0013472865,"about_ca_system_score_gemma":0.00076227356,"threshold_uncertainty_score":0.08562642},"labels":[],"label_agreement":null},{"id":"W1830646994","doi":"10.1007/978-3-642-29485-3_14","title":"Combining Epistemic Logic and Hennessy-Milner Logic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Philosophy of logic; Completeness (order theory); Modulo; Dynamic logic (digital electronics); Computer science; Epistemic modal logic; Equivalence (formal languages); Multimodal logic; Class (philosophy); Calculus (dental); Many-valued logic; State (computer science); Theoretical computer science; Programming language; Mathematics; Discrete mathematics; Artificial intelligence; Description logic; Physics; Quantum mechanics","score_opus":0.024871371004859345,"score_gpt":0.24494435771506404,"score_spread":0.2200729867102047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830646994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009314707,0.002430837,0.8791257,0.0025995304,0.00049038924,0.000062311396,0.000096542644,0.0006739448,0.105206065],"genre_scores_gemma":[0.50064963,0.0045529506,0.44211245,0.0019697435,0.0017153961,0.00028490872,0.00062898337,0.0007384405,0.04734761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969297,0.0012969946,0.00020641046,0.00044737072,0.0008099937,0.0003095171],"domain_scores_gemma":[0.9980081,0.0011284994,0.000092693444,0.00038600876,0.0002625657,0.00012222833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043583824,0.0014609541,0.0015394079,0.003402664,0.002015344,0.0065477397,0.0023929214,0.0023943365,0.011334292],"category_scores_gemma":[0.0060714707,0.0009863747,0.002476684,0.0025130084,0.004339997,0.021253625,0.0070034843,0.0044538565,0.0024760657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029292105,0.000028896391,0.000052719755,0.0000648043,0.00002611438,0.00005549988,0.00011869187,0.0013413354,0.00047686393,0.9767213,0.0014189723,0.019665493],"study_design_scores_gemma":[0.0000070663255,0.000007740187,0.000019156127,0.000025406078,0.000017658766,0.000028260825,0.000025979461,0.004349076,0.00048751367,0.9897385,0.0052821925,0.000011292084],"about_ca_topic_score_codex":0.0007409659,"about_ca_topic_score_gemma":0.0011400752,"teacher_disagreement_score":0.011334292,"about_ca_system_score_codex":0.0019987642,"about_ca_system_score_gemma":0.001554965,"threshold_uncertainty_score":0.037917018},"labels":[],"label_agreement":null},{"id":"W1830679227","doi":"10.1007/978-3-642-03655-2_12","title":"Emotional Bandwidth: Information Theory Analysis of Affective Response Ratings Using a Continuous Slider","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color perception and design","field":"Psychology","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":"Slider; Computer science; Bandwidth (computing); Entropy (arrow of time); Cognitive psychology; Psychology; Telecommunications","score_opus":0.021664575111551985,"score_gpt":0.3012421720902828,"score_spread":0.2795775969787308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830679227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32535684,0.0005331172,0.6617448,0.00016340798,0.00011386641,0.00030177867,0.0009175497,0.0014512831,0.009417449],"genre_scores_gemma":[0.8551683,0.00017601212,0.14168055,0.000034722627,0.00008381959,0.0002662168,0.0006588873,0.00020302969,0.0017285715],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99862075,0.00058448093,0.00006002919,0.00020442191,0.00045213153,0.00007821856],"domain_scores_gemma":[0.99052835,0.0079862345,0.0003221276,0.00045282784,0.0006011903,0.00010935179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022198723,0.00035911487,0.0003984286,0.0017474357,0.00027473742,0.0012810591,0.0006032113,0.00040682819,0.007976497],"category_scores_gemma":[0.01609498,0.00020540801,0.00045118932,0.001651162,0.00040234637,0.0017150996,0.0007480155,0.0006230052,0.00085454463],"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.0034448712,0.00056689634,0.020322736,0.00072696345,0.00034366726,0.00020327231,0.0022584887,0.019036211,0.077257074,0.030155912,0.005074728,0.8406091],"study_design_scores_gemma":[0.00014870863,0.00136421,0.17931567,0.00012945289,0.00032920038,0.00059708406,0.0014508286,0.73929065,0.038944595,0.032456182,0.0057396838,0.00023369018],"about_ca_topic_score_codex":0.00076675846,"about_ca_topic_score_gemma":0.000701758,"teacher_disagreement_score":0.007976497,"about_ca_system_score_codex":0.0003683678,"about_ca_system_score_gemma":0.00017659388,"threshold_uncertainty_score":0.026684046},"labels":[],"label_agreement":null},{"id":"W1830887721","doi":"10.1007/978-3-540-72608-1_18","title":"Ambulatory e-Prescribing: Evaluating a Novel Surveillance Data Source","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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 Health Centre","funders":"","keywords":"Medicine; Ambulatory; Respiratory tract infections; Incidence (geometry); Population; Antibiotics; Ambulatory care; Intensive care medicine; Pediatrics; Internal medicine; Emergency medicine; Respiratory system; Environmental health; Health care","score_opus":0.24585746937547284,"score_gpt":0.4622927084537482,"score_spread":0.21643523907827536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830887721","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.94703555,0.0009879587,0.03529257,0.001014232,0.00030520046,0.00086383166,0.0068697915,0.002455047,0.005175796],"genre_scores_gemma":[0.88401645,0.00059578783,0.1045467,0.00030965387,0.00016844808,0.00025612055,0.008347972,0.00010435476,0.0016545599],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99561274,0.0022253373,0.0004969908,0.00045294187,0.0011082957,0.0001036783],"domain_scores_gemma":[0.96625113,0.025500976,0.0017765705,0.0016262477,0.004273388,0.00057173206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007477399,0.0005964402,0.0005595557,0.0014737044,0.00034577792,0.0015799272,0.0011548079,0.0012570878,0.0016450258],"category_scores_gemma":[0.02471622,0.0002084136,0.00047963747,0.0015029908,0.00029864925,0.0019805848,0.001167315,0.00048082697,0.00051283167],"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.018423257,0.007072036,0.2906616,0.0014742644,0.0011116748,0.00036205383,0.00080977625,0.021289282,0.012149978,0.0018618593,0.012346033,0.6324382],"study_design_scores_gemma":[0.002854016,0.012902785,0.1857076,0.00037220385,0.0019459543,0.00091135135,0.0020580078,0.7519712,0.029691722,0.0020650276,0.009325796,0.00019432347],"about_ca_topic_score_codex":0.010484896,"about_ca_topic_score_gemma":0.011556793,"teacher_disagreement_score":0.010484896,"about_ca_system_score_codex":0.0006365782,"about_ca_system_score_gemma":0.0012021975,"threshold_uncertainty_score":0.03954476},"labels":[],"label_agreement":null},{"id":"W183093845","doi":"10.1007/978-3-319-03841-4_1","title":"On the Upward Planarity of Mixed Plane Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Planarity testing; Planar graph; Mixed graph; Combinatorics; Plane (geometry); Mathematics; Graph; Discrete mathematics; Geometry; Line graph; Voltage graph","score_opus":0.01849744526131878,"score_gpt":0.22624184070054384,"score_spread":0.20774439543922507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183093845","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35119113,0.005068612,0.38701236,0.0030510686,0.00038394122,0.00015493385,0.0009131296,0.00038919805,0.2518357],"genre_scores_gemma":[0.81987894,0.006542125,0.11575458,0.00075503305,0.0006476451,0.0001958723,0.0015889499,0.00059647963,0.054040372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995739,0.00010520384,0.000020147807,0.0000886572,0.000148872,0.000063340565],"domain_scores_gemma":[0.9986682,0.00074430037,0.00017326737,0.00012758488,0.00018737922,0.00009938131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047092,0.00090608775,0.00063158316,0.0023796875,0.0010803537,0.0022644233,0.0013407603,0.0009633431,0.009856295],"category_scores_gemma":[0.004044903,0.0009910841,0.0010200042,0.0018734836,0.0020434891,0.0036727462,0.0024719716,0.0041929735,0.0011902297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007552098,0.0000202456,0.00054066477,0.00015972719,0.00001583883,0.000102852806,0.00028923296,0.0073260753,0.0031217136,0.95293015,0.00358726,0.03183069],"study_design_scores_gemma":[0.000015424152,0.000033037926,0.00054622674,0.00006537643,0.000031081756,0.00027254055,0.00022423409,0.020804208,0.002008879,0.9638645,0.012117524,0.000016861799],"about_ca_topic_score_codex":0.0015425561,"about_ca_topic_score_gemma":0.0013991565,"teacher_disagreement_score":0.009856295,"about_ca_system_score_codex":0.0008493485,"about_ca_system_score_gemma":0.00027154913,"threshold_uncertainty_score":0.032972574},"labels":[],"label_agreement":null},{"id":"W183117328","doi":"10.1007/978-3-642-32584-7_7","title":"Automatic Transformation of Multi-dimensional Web Tables into Data Cubes","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Online analytical processing; Computer science; Table (database); Metadata; Transformation (genetics); Data transformation; Data warehouse; Information retrieval; Data mining; Data cube; Database; Process (computing); Visualization; Programming language; World Wide Web","score_opus":0.033874131845582724,"score_gpt":0.27114551111559665,"score_spread":0.23727137927001393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183117328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021940518,0.00047466706,0.9318812,0.00028026197,0.00016456153,0.00024891904,0.0037428217,0.0389968,0.0022703246],"genre_scores_gemma":[0.114916384,0.00048957224,0.8694412,0.0001274319,0.000038033486,0.00025571138,0.009961933,0.002034179,0.0027355724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905556,0.000094963216,0.00010875725,0.00018600006,0.00048612102,0.000068540096],"domain_scores_gemma":[0.9980696,0.00067928544,0.00014110487,0.00050028693,0.00053364044,0.000076178185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066698354,0.0009344964,0.0008192858,0.0022678098,0.00048524322,0.0025030489,0.0012747652,0.00056641496,0.006602592],"category_scores_gemma":[0.0041361675,0.00063522573,0.0014778536,0.0033762741,0.00047642027,0.0022372685,0.0023293344,0.0010312716,0.0033179985],"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.0004493126,0.0001929614,0.004045815,0.0006792805,0.00014340864,0.00052560406,0.0006493359,0.013894434,0.04663044,0.013313975,0.0383282,0.8811473],"study_design_scores_gemma":[0.0001547301,0.00023097325,0.00660382,0.00022726311,0.00017636067,0.0011942963,0.0011503145,0.6713986,0.1667183,0.05553742,0.09648305,0.00012486945],"about_ca_topic_score_codex":0.002489242,"about_ca_topic_score_gemma":0.0042704153,"teacher_disagreement_score":0.006602592,"about_ca_system_score_codex":0.0005515808,"about_ca_system_score_gemma":0.0010134928,"threshold_uncertainty_score":0.022087872},"labels":[],"label_agreement":null},{"id":"W1831273253","doi":"10.1007/978-3-642-12200-2_17","title":"Compact Rich-Functional Binary Relation Representations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary relation; Binary number; Redundancy (engineering); Relation (database); Theoretical computer science; Data structure; Set operations; Binary data; Abstraction; Representation (politics); Set (abstract data type); Algorithm; Data mining; Mathematics; Arithmetic; Discrete mathematics; Programming language","score_opus":0.018980754201399917,"score_gpt":0.25070494378175323,"score_spread":0.23172418958035332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831273253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057809275,0.001190157,0.8130309,0.0010466252,0.00030233708,0.000100295794,0.0014944037,0.0025988328,0.1224272],"genre_scores_gemma":[0.65325713,0.0014715653,0.24622466,0.0005502405,0.00040343622,0.0002239682,0.0027353906,0.0013961351,0.09373746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.00012287233,0.00004889766,0.000115573486,0.00021058308,0.000081451544],"domain_scores_gemma":[0.9989687,0.00032418602,0.00007899123,0.00038685594,0.00017752836,0.000063751875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061272946,0.0005869659,0.0006272846,0.0013285417,0.00081560336,0.0029454427,0.001033084,0.0008330179,0.017625628],"category_scores_gemma":[0.002114858,0.00054685393,0.0005860042,0.0020958509,0.0011957774,0.00768039,0.0018501275,0.0022353416,0.0036457737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025248351,0.000014139019,0.00004370782,0.00004968593,0.000004410058,0.000042259006,0.00019936942,0.0006826879,0.001308336,0.96122336,0.00322172,0.03318509],"study_design_scores_gemma":[0.000006006776,0.0000110850915,0.00006737084,0.00002026632,0.000008538555,0.00014047037,0.00006699833,0.0050480235,0.0010163554,0.97691035,0.016695846,0.000008792057],"about_ca_topic_score_codex":0.00034825513,"about_ca_topic_score_gemma":0.00059279695,"teacher_disagreement_score":0.017625628,"about_ca_system_score_codex":0.0005943219,"about_ca_system_score_gemma":0.0002938773,"threshold_uncertainty_score":0.058963597},"labels":[],"label_agreement":null},{"id":"W1831641206","doi":"10.1007/978-3-642-02882-3_45","title":"The Weighted Coupon Collector’s Problem and Applications","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Coupon; Combinatorics; Simple (philosophy); Binary logarithm; Approx; Mathematics; Discrete mathematics; Computer science","score_opus":0.019657166507394762,"score_gpt":0.27441751758228555,"score_spread":0.2547603510748908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831641206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0535199,0.016328713,0.7245511,0.012284847,0.0027412402,0.00020114862,0.00042105967,0.0003089948,0.18964306],"genre_scores_gemma":[0.56439185,0.013322388,0.18566822,0.0018418654,0.0060908203,0.0005756529,0.00069256447,0.0006713859,0.22674528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984267,0.0007134041,0.00006724991,0.00033205588,0.00029572667,0.0001649169],"domain_scores_gemma":[0.99271446,0.005246638,0.00035993097,0.0005818883,0.00057454826,0.0005226375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003986149,0.0016835436,0.0030731321,0.0026407659,0.0026273234,0.0049744677,0.004704736,0.006901178,0.016587414],"category_scores_gemma":[0.020544592,0.0013807308,0.0023240633,0.004031241,0.006210447,0.0075570657,0.0048854495,0.0055803168,0.0014201244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091463065,0.000033582335,0.00016342821,0.000120706376,0.00003513664,0.00008273297,0.00008002124,0.019607596,0.00026494605,0.96058476,0.0065124966,0.012423149],"study_design_scores_gemma":[0.000033851462,0.000017300224,0.00011190182,0.000054864297,0.000022007178,0.000098276105,0.000042410316,0.08339218,0.00028329834,0.9094623,0.006448031,0.000033687218],"about_ca_topic_score_codex":0.0022794043,"about_ca_topic_score_gemma":0.001324868,"teacher_disagreement_score":0.016587414,"about_ca_system_score_codex":0.0031301365,"about_ca_system_score_gemma":0.0017210246,"threshold_uncertainty_score":0.055490375},"labels":[],"label_agreement":null},{"id":"W1831784878","doi":"10.1007/978-3-540-74260-9_47","title":"A Sequential Monte-Carlo and DSmT Based Approach for Conflict Handling in Case of Multiple Targets Tracking","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Target Tracking and Data Fusion in Sensor Networks","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":"Bishop's University","funders":"","keywords":"Particle filter; Computer science; Tracking (education); Monte Carlo method; Artificial intelligence; Algorithm; Computer vision; Statistics; Mathematics; Kalman filter; Psychology","score_opus":0.05296559575407361,"score_gpt":0.28096975648405287,"score_spread":0.22800416072997925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831784878","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.0014678122,0.00010778722,0.99731123,0.000040428422,0.000047812682,0.000027546135,0.000024801795,0.0002374708,0.00073507096],"genre_scores_gemma":[0.13665248,0.00025189476,0.8591541,0.00012601266,0.00013195074,0.00018609954,0.00024338154,0.00018179775,0.0030722537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989103,0.0002822177,0.00008630958,0.00015703765,0.00048241043,0.00008166858],"domain_scores_gemma":[0.99701464,0.0017012191,0.00013563548,0.00026031496,0.000745579,0.00014268856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017096032,0.0009065886,0.0017467147,0.0009832352,0.0007603191,0.0013891219,0.0025368747,0.0014710915,0.0040779947],"category_scores_gemma":[0.0048051695,0.0009172453,0.0013353061,0.0014679849,0.0006446455,0.0012950858,0.001785145,0.0014761271,0.0010103914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025297134,0.00012866028,0.0007278557,0.0001595913,0.00012879742,0.00022387602,0.000099403514,0.75502604,0.005358454,0.0163754,0.0025035318,0.21901545],"study_design_scores_gemma":[0.0000056180575,0.000009812345,0.000041491086,0.0000026665177,0.000006910381,0.000037383328,0.0000035578787,0.99699163,0.00039182793,0.0021142864,0.00038943905,0.000005312383],"about_ca_topic_score_codex":0.0069848155,"about_ca_topic_score_gemma":0.007618578,"teacher_disagreement_score":0.0069848155,"about_ca_system_score_codex":0.0008261182,"about_ca_system_score_gemma":0.001713686,"threshold_uncertainty_score":0.013888359},"labels":[],"label_agreement":null},{"id":"W1831799901","doi":"10.1007/978-3-540-72951-8_25","title":"Selfish Routing with Oblivious Users","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Computer science; Latency (audio); Computer network; Routing (electronic design automation); Static routing; Policy-based routing; Equal-cost multi-path routing; The Internet; Flow network; Routing domain; Hierarchical routing; Distributed computing; Routing protocol; Mathematical optimization; Mathematics; World Wide Web; Telecommunications","score_opus":0.0699192145958308,"score_gpt":0.3368978829090431,"score_spread":0.2669786683132123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831799901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085147,0.00062220264,0.8655529,0.0015720305,0.00022409187,0.00019718337,0.00017999507,0.0011813093,0.045323424],"genre_scores_gemma":[0.8485589,0.00071228534,0.10064198,0.00039579105,0.00022409206,0.00029289586,0.00010246892,0.00029048687,0.04878117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987344,0.0004986219,0.000057466197,0.00017754546,0.00031285975,0.00021901724],"domain_scores_gemma":[0.99516857,0.0025408056,0.0002896333,0.0015172329,0.00031476837,0.00016905378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016246731,0.0007105505,0.000814785,0.0007260754,0.0011825935,0.0021985404,0.0017558058,0.0012956477,0.004484449],"category_scores_gemma":[0.006018445,0.00061369233,0.0005471582,0.00097301474,0.0019198257,0.005271426,0.0027732197,0.0020911878,0.0010576446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024120993,0.00009506557,0.00024989204,0.00016801087,0.000042700187,0.00013780556,0.00038665964,0.079580165,0.004304496,0.8516246,0.0075721066,0.0555973],"study_design_scores_gemma":[0.000047095386,0.0000798217,0.00008441125,0.00002586059,0.000029212866,0.00021067815,0.00006628264,0.28143486,0.0036625057,0.70778304,0.006545548,0.000030596],"about_ca_topic_score_codex":0.00041706004,"about_ca_topic_score_gemma":0.00044056404,"teacher_disagreement_score":0.004484449,"about_ca_system_score_codex":0.0010146956,"about_ca_system_score_gemma":0.0010455622,"threshold_uncertainty_score":0.015001953},"labels":[],"label_agreement":null},{"id":"W1832094072","doi":"10.1007/978-3-642-15615-1_36","title":"An Evaluation of DNA Barcoding Using Genetic Programming-Based Process","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Identification and Quantification in Food","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph","funders":"","keywords":"DNA barcoding; Process (computing); Genetic programming; Computer science; Computational biology; Evolutionary biology; Biology; Artificial intelligence; Programming language","score_opus":0.043671462541829575,"score_gpt":0.3286622264450076,"score_spread":0.284990763903178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832094072","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.40319097,0.0013850003,0.5685156,0.0005743873,0.00027595172,0.0003780809,0.000493166,0.0071091964,0.01807765],"genre_scores_gemma":[0.63560677,0.0005216745,0.35913056,0.00009913393,0.000021907714,0.00014953925,0.00049360597,0.00039983186,0.0035769895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996959,0.0009224689,0.000115881085,0.00037697115,0.0013939582,0.00023182858],"domain_scores_gemma":[0.99332494,0.0046841265,0.00017294426,0.0004206457,0.0012806874,0.00011664923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030962876,0.0009093033,0.0008683751,0.0007965906,0.00066087,0.0016519356,0.0018681064,0.0016560686,0.0030622433],"category_scores_gemma":[0.00799543,0.00022960213,0.0007050336,0.0011816939,0.0009469715,0.0013853849,0.00091005437,0.0008591003,0.00050353305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035912886,0.0010192147,0.003302083,0.000883955,0.0001593098,0.00025640926,0.0001713366,0.49646357,0.07655203,0.018152101,0.0017373485,0.39771122],"study_design_scores_gemma":[0.00009395782,0.0008448317,0.0004973455,0.000022997045,0.00007339465,0.00007551631,0.000056876346,0.9297113,0.064632505,0.002547814,0.0014186342,0.00002473815],"about_ca_topic_score_codex":0.008422538,"about_ca_topic_score_gemma":0.0037535501,"teacher_disagreement_score":0.008422538,"about_ca_system_score_codex":0.0017415631,"about_ca_system_score_gemma":0.0017396897,"threshold_uncertainty_score":0.016746998},"labels":[],"label_agreement":null},{"id":"W1832141373","doi":"10.1007/978-3-642-21028-0_25","title":"A 3D MRI-Based Cardiac Computer Model to Study Arrhythmia and Its In-vivo Experimental Validation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"In vivo; Ventricular tachycardia; Voxel; Diffusion MRI; Biomedical engineering; Nuclear medicine; Computer science; Medicine; Magnetic resonance imaging; Cardiology; Radiology; Artificial intelligence; Biology","score_opus":0.021573388474545728,"score_gpt":0.27122698355865554,"score_spread":0.2496535950841098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832141373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033509556,0.0004899378,0.9568051,0.00019137695,0.00013282387,0.00018281581,0.0010650913,0.0021086507,0.0055146925],"genre_scores_gemma":[0.4963317,0.001284026,0.48873183,0.00021710404,0.000051836334,0.00058536144,0.002541414,0.0006757545,0.0095810015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.000042832038,0.000014745067,0.00003601989,0.00011317977,0.000009085593],"domain_scores_gemma":[0.9995296,0.0002154325,0.00002439535,0.00009724742,0.00011518235,0.000018055289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038550844,0.00055241096,0.00039585508,0.00051082927,0.00020416985,0.0007730117,0.0009782182,0.0010285641,0.003534494],"category_scores_gemma":[0.00093616237,0.00032439968,0.00055662263,0.00039008737,0.00031672936,0.00043640635,0.0004642597,0.0004961776,0.001217296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028336144,0.00029647438,0.0018311249,0.00044706013,0.000111213376,0.0004615684,0.00024344293,0.6327412,0.18368869,0.007969302,0.0069406284,0.16498597],"study_design_scores_gemma":[0.000022890032,0.00013771528,0.0013621163,0.00002588455,0.000042137082,0.0004564618,0.000024674702,0.9622518,0.026911953,0.0014650836,0.007268161,0.00003115655],"about_ca_topic_score_codex":0.0018001272,"about_ca_topic_score_gemma":0.0021272707,"teacher_disagreement_score":0.003534494,"about_ca_system_score_codex":0.00026197094,"about_ca_system_score_gemma":0.0004785887,"threshold_uncertainty_score":0.011824071},"labels":[],"label_agreement":null},{"id":"W1832226433","doi":"10.1007/3-540-45486-1_29","title":"Typical Example Selection for Learning Classifiers","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mahalanobis distance; Computer science; Artificial intelligence; Set (abstract data type); Selection (genetic algorithm); Machine learning; Gaussian; Training set; Measure (data warehouse); Pattern recognition (psychology); Labeled data; Data mining","score_opus":0.027766386641199577,"score_gpt":0.26584179621263876,"score_spread":0.2380754095714392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832226433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008430848,0.0012675769,0.9839287,0.00026284173,0.000086917964,0.00009684579,0.00048660123,0.0011188366,0.004320867],"genre_scores_gemma":[0.1270836,0.0010000498,0.8596074,0.0002522508,0.00027410043,0.00052448857,0.0023800852,0.00047531616,0.0084026605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975516,0.0007828362,0.00021294516,0.00059108913,0.0007550821,0.00010631626],"domain_scores_gemma":[0.9969735,0.0020028441,0.00007850606,0.0004671185,0.000402631,0.00007526181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021179898,0.0007157688,0.00112329,0.0015173871,0.00090885855,0.0016881775,0.001934855,0.0013772217,0.010381159],"category_scores_gemma":[0.010086463,0.00048402202,0.0010273169,0.0024041485,0.0006698288,0.0028541689,0.0013312821,0.0015826139,0.0044293706],"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.00038753587,0.00008356066,0.0014481806,0.0005300188,0.00011868971,0.00029179043,0.00020223891,0.02018441,0.006739391,0.090112224,0.032874737,0.8470272],"study_design_scores_gemma":[0.000057854948,0.0001447742,0.0010361511,0.00012425888,0.00008319997,0.0013480901,0.000101203324,0.54714054,0.01195641,0.4001331,0.037827093,0.000047437294],"about_ca_topic_score_codex":0.00044302543,"about_ca_topic_score_gemma":0.0008341053,"teacher_disagreement_score":0.010381159,"about_ca_system_score_codex":0.0005726502,"about_ca_system_score_gemma":0.000525766,"threshold_uncertainty_score":0.034728467},"labels":[],"label_agreement":null},{"id":"W1832501911","doi":"10.1007/978-3-540-76858-6_6","title":"Nonuniform Segment-Based Compression of Motion Capture Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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 Waterloo","funders":"","keywords":"Classification of discontinuities; Lossy compression; Data compression; Wavelet; Algorithm; Compression (physics); Smoothing; Computer science; Data compression ratio; Mathematics; Artificial intelligence; Computer vision; Mathematical analysis; Image compression; Physics","score_opus":0.0383949118119124,"score_gpt":0.2610242476709469,"score_spread":0.2226293358590345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832501911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16666396,0.0021145104,0.823208,0.0002125882,0.00022691832,0.00014246807,0.00080386526,0.001223371,0.005404241],"genre_scores_gemma":[0.6676949,0.0024576322,0.31203148,0.00015437955,0.00030968318,0.00017277146,0.0031644155,0.0003157083,0.0136989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986374,0.000021656215,0.0000089476825,0.00002381627,0.00006577595,0.000016041677],"domain_scores_gemma":[0.99963486,0.00015880277,0.000026318672,0.00009235566,0.00007436253,0.00001327636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018711072,0.0004631476,0.00034584387,0.0007530521,0.00016954585,0.00031212892,0.0003985412,0.0003048216,0.0026836952],"category_scores_gemma":[0.00094543165,0.00015161494,0.00016769319,0.0013752773,0.00024885402,0.00048627722,0.00038760045,0.00030768174,0.0005533498],"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.0012228268,0.000080645405,0.0009622346,0.00023482618,0.000039803985,0.00021020693,0.00011572783,0.04720993,0.24648334,0.0051644715,0.0047749053,0.6935012],"study_design_scores_gemma":[0.000056420173,0.00040213784,0.006750801,0.000049236784,0.000071398,0.0008548001,0.00006517809,0.75741434,0.21979317,0.0032051916,0.011302671,0.000034514887],"about_ca_topic_score_codex":0.001062481,"about_ca_topic_score_gemma":0.0017690498,"teacher_disagreement_score":0.0026836952,"about_ca_system_score_codex":0.00023236049,"about_ca_system_score_gemma":0.00018032419,"threshold_uncertainty_score":0.00897789},"labels":[],"label_agreement":null},{"id":"W1832526807","doi":"10.1007/11557654_29","title":"Convergence of the Discrete FGDLS Algorithm","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"St. Francis Xavier University","funders":"","keywords":"Monotonic function; Computer science; Convergence (economics); Workload; Algorithm; Mathematical optimization; Variable (mathematics); Scheduling (production processes); Mathematics","score_opus":0.01228171881359969,"score_gpt":0.23777501658346362,"score_spread":0.22549329776986393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832526807","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.01917751,0.00030822307,0.9608879,0.00044303152,0.00018050251,0.00006446986,0.00012134311,0.0006448822,0.018172167],"genre_scores_gemma":[0.5447741,0.00036083182,0.42991385,0.00029938834,0.00016619923,0.00027020668,0.00041318507,0.00040183926,0.023400355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990332,0.00035706122,0.000032609583,0.00013367391,0.00031854075,0.00012482292],"domain_scores_gemma":[0.99751914,0.0015532526,0.00010352386,0.0002667608,0.00043331322,0.00012403294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019504664,0.0006901241,0.000876238,0.0009578888,0.0005007691,0.0014521056,0.0015157849,0.0009513298,0.008766362],"category_scores_gemma":[0.007585191,0.00033786392,0.0005602009,0.00063013326,0.0014797907,0.0010295381,0.0017315296,0.0013766978,0.0016568904],"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.0007037907,0.00012622327,0.00075244927,0.0002625263,0.000038115635,0.00006178983,0.00014818937,0.5904807,0.003448458,0.20718734,0.007927949,0.18886262],"study_design_scores_gemma":[0.000051697527,0.000025341345,0.00006325668,0.00001592743,0.0000038556805,0.000017424978,0.000012682104,0.9682073,0.0008126518,0.029262863,0.0015213788,0.000005665019],"about_ca_topic_score_codex":0.004153653,"about_ca_topic_score_gemma":0.0027477515,"teacher_disagreement_score":0.008766362,"about_ca_system_score_codex":0.0015700266,"about_ca_system_score_gemma":0.0016682532,"threshold_uncertainty_score":0.02932638},"labels":[],"label_agreement":null},{"id":"W1832756347","doi":"10.1007/11894063_28","title":"Unified Point Addition Formulæ and Side-Channel Attacks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Side channel attack; Affine transformation; Computer science; Point (geometry); Elliptic curve; Cryptography; Channel (broadcasting); Arithmetic; Mathematics; Algorithm; Pure mathematics; Geometry; Computer network","score_opus":0.01128440881028721,"score_gpt":0.21986617519881588,"score_spread":0.20858176638852866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832756347","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.06480435,0.0034392315,0.7788751,0.001939767,0.0008971874,0.00013355163,0.00021093778,0.0011627887,0.1485371],"genre_scores_gemma":[0.81363446,0.0030047968,0.1301015,0.0007015361,0.0008412374,0.00018870858,0.00029983345,0.00039267377,0.05083515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819213,0.00045284172,0.00008449179,0.0001624573,0.0008295107,0.00027859182],"domain_scores_gemma":[0.99878436,0.00039489346,0.00010213274,0.0004897344,0.00018089404,0.00004806114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011044308,0.0011112748,0.0010427659,0.0014032351,0.0012476887,0.0028169507,0.0013880004,0.0018487348,0.006553853],"category_scores_gemma":[0.0027773515,0.00066433364,0.0008223096,0.00225145,0.0022947174,0.0050251395,0.0036221275,0.0037757813,0.0026476434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014332049,0.00003420144,0.000097257696,0.0000644465,0.000016309055,0.00013600364,0.00011216894,0.0043143895,0.0033701654,0.94389284,0.004385571,0.04343326],"study_design_scores_gemma":[0.000027249773,0.000050309594,0.00008486397,0.000041687676,0.000028605955,0.0003823044,0.000038785216,0.02440494,0.005541983,0.9552477,0.014120188,0.000031360618],"about_ca_topic_score_codex":0.00012636199,"about_ca_topic_score_gemma":0.00013941895,"teacher_disagreement_score":0.006553853,"about_ca_system_score_codex":0.0006755579,"about_ca_system_score_gemma":0.00063420675,"threshold_uncertainty_score":0.021924853},"labels":[],"label_agreement":null},{"id":"W1832761474","doi":"10.1007/978-3-540-78773-0_16","title":"Minimum Cost Homomorphisms to Reflexive Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Graph homomorphism; Graph; Line graph; Voltage graph","score_opus":0.0334414931792028,"score_gpt":0.3030028647787649,"score_spread":0.2695613715995621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832761474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21796207,0.001414835,0.6886123,0.0012940317,0.0003866219,0.0002401648,0.00076026836,0.0017133224,0.08761642],"genre_scores_gemma":[0.75038683,0.0014299306,0.20322913,0.00033803505,0.0002813235,0.00029774304,0.0007169399,0.00061031117,0.04270984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938834,0.000155031,0.000038021048,0.00014832687,0.00017716597,0.000093103656],"domain_scores_gemma":[0.99758494,0.0013558349,0.00013416226,0.00043249913,0.00022995894,0.00026257028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516544,0.0005869757,0.0008210564,0.0011689556,0.0006969592,0.0020198566,0.0015503118,0.0008201771,0.007564418],"category_scores_gemma":[0.0034478172,0.0006661031,0.0007895134,0.001353276,0.0010021047,0.0039684135,0.0016205405,0.0025977844,0.00096629525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010575176,0.000091526366,0.00019088453,0.00027866263,0.000025258722,0.0000743914,0.0002992726,0.0097773345,0.0049695917,0.91256464,0.0041652303,0.06745758],"study_design_scores_gemma":[0.000033329445,0.000053443368,0.00018359993,0.000031748204,0.000025421465,0.0001387853,0.000090052425,0.017352656,0.0030793215,0.9708553,0.008142187,0.000014193613],"about_ca_topic_score_codex":0.00039370015,"about_ca_topic_score_gemma":0.0007646883,"teacher_disagreement_score":0.007564418,"about_ca_system_score_codex":0.0013066404,"about_ca_system_score_gemma":0.00053283107,"threshold_uncertainty_score":0.02530551},"labels":[],"label_agreement":null},{"id":"W1833038439","doi":"10.1007/11535218_28","title":"New Monotones and Lower Bounds in Unconditional Two-Party Computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Oblivious transfer; Computation; Protocol (science); String (physics); Theoretical computer science; Reduction (mathematics); Context (archaeology); Upper and lower bounds; Secure multi-party computation; Transfer (computing); Scheme (mathematics); Algorithm; Mathematics; Parallel computing","score_opus":0.012011701040091664,"score_gpt":0.25291351746423923,"score_spread":0.24090181642414757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833038439","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.036762055,0.00767865,0.78329444,0.009833223,0.0012312412,0.00021699448,0.00055821583,0.0010106517,0.15941449],"genre_scores_gemma":[0.68394655,0.0070370934,0.23587662,0.0033710322,0.004327719,0.001023972,0.000663501,0.0012677015,0.06248579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99108195,0.002930194,0.00041919484,0.0013201486,0.0030231592,0.0012254268],"domain_scores_gemma":[0.9646041,0.027360577,0.0008970208,0.0040347963,0.001849102,0.0012543554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009318979,0.0028284236,0.0036050244,0.004318055,0.0043052956,0.008724344,0.0071245413,0.0049926434,0.014974119],"category_scores_gemma":[0.0349224,0.0022701966,0.003638669,0.006586495,0.01065232,0.029497169,0.012784294,0.02200998,0.0029927536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057829144,0.000038485756,0.00007233863,0.000071179915,0.0000092218115,0.0000224212,0.00009071835,0.001614947,0.00026409095,0.9873076,0.0021865054,0.0082645975],"study_design_scores_gemma":[0.000011748172,0.000014891785,0.0000508774,0.000024690093,0.000015255389,0.000039547704,0.000015058935,0.01559623,0.0002419266,0.98207664,0.0018971406,0.0000160415],"about_ca_topic_score_codex":0.0008942338,"about_ca_topic_score_gemma":0.0010221052,"teacher_disagreement_score":0.014974119,"about_ca_system_score_codex":0.0057631037,"about_ca_system_score_gemma":0.002348385,"threshold_uncertainty_score":0.050093412},"labels":[],"label_agreement":null},{"id":"W1833067105","doi":"10.1007/978-3-540-88192-6_56","title":"Mining Causal Knowledge from Diagnostic Knowledge","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Alpha Technologies (Canada); York University","funders":"","keywords":"Computer science; Knowledge extraction; Medical knowledge; Bayesian probability; Bayesian network; Causal analysis; Artificial intelligence; Data science; Knowledge-based systems; Data mining; Machine learning; Risk analysis (engineering); Medicine","score_opus":0.03334912607626544,"score_gpt":0.2669122653541368,"score_spread":0.23356313927787137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833067105","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.027427357,0.0030514724,0.9585678,0.0015830726,0.0001125031,0.00021605898,0.0021324463,0.0012199053,0.005689501],"genre_scores_gemma":[0.42410964,0.004165134,0.56053996,0.0003899114,0.00039366772,0.00028234127,0.006325529,0.0001512022,0.0036426412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983746,0.00038750903,0.00015607874,0.0003902177,0.0006170809,0.000074541684],"domain_scores_gemma":[0.97927034,0.018127387,0.0007261196,0.001089487,0.0006493772,0.0001372941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023344462,0.0013083627,0.0014605952,0.0068704025,0.00068321975,0.0020535998,0.0025537142,0.0017871096,0.0047403225],"category_scores_gemma":[0.025622528,0.0011900228,0.0020817074,0.003549973,0.0014677563,0.004421444,0.0016409898,0.0022104955,0.0009188766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045936252,0.0004570757,0.011591001,0.0019580112,0.0006480287,0.003074155,0.000627748,0.09724254,0.004213758,0.1179459,0.015015069,0.7467673],"study_design_scores_gemma":[0.00008363597,0.00007029039,0.0019675065,0.0003737806,0.0005046873,0.0012851312,0.00019637667,0.4202734,0.005509874,0.5595148,0.010167791,0.00005264808],"about_ca_topic_score_codex":0.0017751948,"about_ca_topic_score_gemma":0.0023829048,"teacher_disagreement_score":0.0068704025,"about_ca_system_score_codex":0.0007589296,"about_ca_system_score_gemma":0.0013061588,"threshold_uncertainty_score":0.015857995},"labels":[],"label_agreement":null},{"id":"W1833162360","doi":"10.1007/978-3-642-01815-2_5","title":"What Can Formal Concept Analysis Do for Data Warehouses?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Université du Québec en Outaouais","funders":"","keywords":"Online analytical processing; Computer science; Data warehouse; Data cube; Data mining; Knowledge extraction; Association rule learning; Data science; Formal concept analysis; Information retrieval; Exploit; Algorithm","score_opus":0.037744071461735564,"score_gpt":0.27718709751826187,"score_spread":0.23944302605652631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833162360","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.012868485,0.027240135,0.79236686,0.13574341,0.0024075876,0.0002127439,0.000899359,0.0020822408,0.026179219],"genre_scores_gemma":[0.24438834,0.017758284,0.71978825,0.0073421467,0.0026800397,0.00052822457,0.0014316615,0.0005446044,0.0055385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99043673,0.0049757725,0.0008145,0.0007957725,0.0025000079,0.00047732485],"domain_scores_gemma":[0.9524419,0.03170757,0.0023467992,0.007414568,0.0049621314,0.0011271314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024201876,0.0018579512,0.0028568127,0.0034032725,0.0026468653,0.016532432,0.004068561,0.0045895376,0.00830406],"category_scores_gemma":[0.07275612,0.0013612658,0.0030639716,0.0037410175,0.011956157,0.06616562,0.0044246335,0.0059395772,0.0030909127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098842655,0.00009969782,0.00076871965,0.0012663376,0.00012279906,0.00008014826,0.00086811703,0.0034775448,0.000374923,0.8580855,0.015636526,0.11912072],"study_design_scores_gemma":[0.000013243789,0.000011502114,0.00007644342,0.00020706007,0.000011256926,0.00002536347,0.00033380793,0.00373881,0.00012892271,0.98538834,0.010042369,0.00002290411],"about_ca_topic_score_codex":0.0042115343,"about_ca_topic_score_gemma":0.002519009,"teacher_disagreement_score":0.024201876,"about_ca_system_score_codex":0.0036869317,"about_ca_system_score_gemma":0.004640075,"threshold_uncertainty_score":0.12799323},"labels":[],"label_agreement":null},{"id":"W1833249913","doi":"10.1007/978-3-642-25832-9_43","title":"Correlation between Genetic Diversity and Fitness in a Predator-Prey Ecosystem Simulation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Entropy (arrow of time); Computer science; Correlation; Population; Artificial intelligence; Machine learning; Ecology; Mathematics; Biology","score_opus":0.015010964830168881,"score_gpt":0.22995639986474609,"score_spread":0.2149454350345772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833249913","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.99090636,0.00008795056,0.0068176053,0.00027955297,0.0000126713385,0.000007933962,0.00010284728,0.000044821518,0.0017402045],"genre_scores_gemma":[0.9976501,0.0000308498,0.0016108786,0.00002220041,0.00000654539,0.000008616374,0.000065202614,0.000012973215,0.0005926225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997466,0.00013408408,0.000012657851,0.00003889645,0.00003109847,0.000036628273],"domain_scores_gemma":[0.9904541,0.008273433,0.00039007203,0.00025942555,0.0003526083,0.00027036693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011396067,0.00026544154,0.00050411583,0.0005066647,0.0004237288,0.0006005132,0.00093853264,0.0010532195,0.0015213657],"category_scores_gemma":[0.008798691,0.0003997552,0.00046153547,0.0005777439,0.0006877184,0.000598553,0.00057572866,0.0008627439,0.00010604351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007596849,0.00005299052,0.012546667,0.000014598488,0.00005118761,0.000086739135,0.000041377905,0.9823361,0.0004957277,0.0026962955,0.00021436819,0.0013880061],"study_design_scores_gemma":[0.000007904934,0.000017809833,0.0016540934,0.0000020873226,0.000007925361,0.000012263362,0.0000075020207,0.9971533,0.00010395088,0.0010069603,0.000020323723,0.000005882118],"about_ca_topic_score_codex":0.010505946,"about_ca_topic_score_gemma":0.008324832,"teacher_disagreement_score":0.010505946,"about_ca_system_score_codex":0.00070995453,"about_ca_system_score_gemma":0.00046300786,"threshold_uncertainty_score":0.02088958},"labels":[],"label_agreement":null},{"id":"W1833441044","doi":"10.1007/3-540-45348-2_27","title":"Delivering Adaptive Web Content Based on Client Computing Resources","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; XML; Dynamic web page; Architecture; World Wide Web; Web service; Web content; Web server; Server-side; Operating system; Distributed computing; Web page; The Internet","score_opus":0.036335506358619776,"score_gpt":0.23788169714877436,"score_spread":0.20154619079015457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833441044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17967069,0.0006179106,0.69123596,0.0005527922,0.00028046733,0.0006651402,0.00058817526,0.05732363,0.06906519],"genre_scores_gemma":[0.7313274,0.000780143,0.17137185,0.00030283476,0.00023183931,0.00030817583,0.0015135456,0.00515769,0.089006536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995616,0.000050967323,0.00001875035,0.00006951879,0.00023570895,0.00006354247],"domain_scores_gemma":[0.99844533,0.00047530213,0.000057301113,0.0004937378,0.00039334586,0.00013496779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004490504,0.0006832223,0.00073568715,0.00096820423,0.00062846916,0.0021812515,0.001840949,0.0011277099,0.00817743],"category_scores_gemma":[0.0026399298,0.00060143654,0.00031474448,0.0011678037,0.0003331838,0.0025853883,0.001379402,0.001150414,0.005574887],"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.001159733,0.00084591325,0.003378173,0.0003088003,0.00006841212,0.00073992054,0.0006875527,0.015912414,0.319791,0.012725102,0.03687944,0.60750353],"study_design_scores_gemma":[0.00014782076,0.00030214185,0.008099188,0.000078195495,0.00021156664,0.00075796864,0.00043399955,0.6620728,0.25310862,0.020440165,0.05421142,0.00013612912],"about_ca_topic_score_codex":0.0038588904,"about_ca_topic_score_gemma":0.0038486081,"teacher_disagreement_score":0.00817743,"about_ca_system_score_codex":0.0006609559,"about_ca_system_score_gemma":0.00046667788,"threshold_uncertainty_score":0.027356207},"labels":[],"label_agreement":null},{"id":"W1833516523","doi":"10.1007/978-3-642-38771-5_34","title":"Repetition Avoidance in Circular Factors","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Repetition (rhetorical device); Alphabet; Exponent; Mathematics; Word length; Combinatorics; Variation (astronomy); Upper and lower bounds; Computer science; Geometry; Physics; Natural language processing; Linguistics; Mathematical analysis","score_opus":0.01386120211592238,"score_gpt":0.2395959528970629,"score_spread":0.22573475078114053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833516523","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.60189337,0.0010060249,0.26985878,0.0010636431,0.00035854572,0.000082362545,0.00015629547,0.0010755402,0.12450539],"genre_scores_gemma":[0.9562372,0.00024629556,0.02007345,0.00017867517,0.000137447,0.00005293059,0.00012476559,0.00025282303,0.02269649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989512,0.00020701786,0.00006233291,0.00026798638,0.00023451194,0.0002769843],"domain_scores_gemma":[0.9957676,0.0021531193,0.00039414814,0.0008596844,0.0004505956,0.0003748691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007893668,0.00045648558,0.00079916656,0.0011486871,0.0022004994,0.0021905892,0.0009837662,0.0011370726,0.009050819],"category_scores_gemma":[0.005680184,0.0005863768,0.0010616665,0.0009776964,0.0026077714,0.00386347,0.0025389125,0.0016600057,0.0012166342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015490747,0.000024132001,0.00040079287,0.00005460421,0.000010208119,0.00021770563,0.0006516974,0.0017949158,0.0026167876,0.98422766,0.0011405589,0.008705818],"study_design_scores_gemma":[0.00002235404,0.000024201847,0.00015318856,0.000013979572,0.000015694302,0.00016980492,0.00013690675,0.006561683,0.0015502225,0.9880314,0.003301864,0.000018782332],"about_ca_topic_score_codex":0.0009899985,"about_ca_topic_score_gemma":0.0008752959,"teacher_disagreement_score":0.009050819,"about_ca_system_score_codex":0.00078975194,"about_ca_system_score_gemma":0.00060989236,"threshold_uncertainty_score":0.030277967},"labels":[],"label_agreement":null},{"id":"W1833591934","doi":"10.1007/978-3-540-92892-8_12","title":"Converting H.264-Derived Motion Information into Depth Map","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Motion estimation; Motion (physics); Depth map; Computer graphics (images); Image (mathematics)","score_opus":0.011554303387171368,"score_gpt":0.25174499441313725,"score_spread":0.24019069102596588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833591934","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.03573977,0.0013349766,0.9304974,0.00031667165,0.0006902264,0.00031949155,0.0034209087,0.0072356085,0.020444918],"genre_scores_gemma":[0.14355941,0.0027149327,0.8184389,0.00029304822,0.00021795848,0.00015053649,0.0069256206,0.0008104445,0.026889207],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99989855,0.00000482547,0.000004455864,0.000015177103,0.000059772174,0.000017350954],"domain_scores_gemma":[0.9998982,0.000016927337,0.000006407551,0.000015485592,0.00005769365,0.0000052729847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001413232,0.00079823687,0.00028780053,0.0011696651,0.00016136306,0.00052961323,0.00037269402,0.00041535596,0.009836792],"category_scores_gemma":[0.00055874645,0.00032414772,0.0003734882,0.00090352766,0.00012600355,0.0004864863,0.00039771895,0.0005612757,0.0044019893],"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.00025526082,0.000057094087,0.00037477067,0.00032381833,0.00004347575,0.00019417348,0.000066366934,0.008903872,0.28845596,0.003073676,0.01492856,0.68332297],"study_design_scores_gemma":[0.00009604408,0.00030266753,0.006527996,0.00018983532,0.00014011777,0.000934708,0.00013685002,0.22045414,0.6684643,0.0074007483,0.095249765,0.00010290346],"about_ca_topic_score_codex":0.0037637774,"about_ca_topic_score_gemma":0.0045609344,"teacher_disagreement_score":0.009836792,"about_ca_system_score_codex":0.00025273723,"about_ca_system_score_gemma":0.00043298156,"threshold_uncertainty_score":0.032907367},"labels":[],"label_agreement":null},{"id":"W1833767862","doi":"10.1007/3-540-45108-0_89","title":"W5 - Case-Based Reasoning in Intelligent Training Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université de Montréal","funders":"","keywords":"Computer science; Reusability; Case-based reasoning; TUTOR; Intelligent tutoring system; Intelligent decision support system; Software engineering; Component (thermodynamics); Human–computer interaction; Software; Focus (optics); Artificial intelligence","score_opus":0.03167152494968648,"score_gpt":0.24935279623397605,"score_spread":0.21768127128428957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833767862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042139273,0.0012075383,0.9458886,0.00076260424,0.0001408507,0.00020574295,0.00028568722,0.0008042973,0.046490707],"genre_scores_gemma":[0.16307077,0.0014339354,0.7886616,0.0005713625,0.00015591078,0.00031906873,0.0018718182,0.0003618558,0.04355362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773765,0.0008231115,0.00027029213,0.00035518964,0.00066969625,0.0001440045],"domain_scores_gemma":[0.9988599,0.0006226288,0.000055089564,0.00028442466,0.00013482182,0.000043170206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022979763,0.00078001845,0.000623634,0.0017554399,0.0007398845,0.003897841,0.002536607,0.0019010603,0.027977835],"category_scores_gemma":[0.0052123414,0.00068131555,0.0017627137,0.0020381052,0.0017058281,0.0077719493,0.0019586354,0.0014337867,0.0060349004],"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.00012381907,0.00018738928,0.00055091165,0.0003445525,0.000099967634,0.00023579183,0.00028736488,0.02731547,0.0017307643,0.52457064,0.014991682,0.42956153],"study_design_scores_gemma":[0.000042297474,0.00005383619,0.00037617589,0.0001794764,0.00005995297,0.00025277302,0.00011800719,0.1627915,0.004268599,0.7749619,0.056867003,0.000028500277],"about_ca_topic_score_codex":0.005660703,"about_ca_topic_score_gemma":0.0031112377,"teacher_disagreement_score":0.027977835,"about_ca_system_score_codex":0.0010330447,"about_ca_system_score_gemma":0.0010456408,"threshold_uncertainty_score":0.09359515},"labels":[],"label_agreement":null},{"id":"W1833943521","doi":"10.1007/978-3-540-25940-4_65","title":"Toward an Undergraduate League for RoboCup","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Manitoba","funders":"","keywords":"League; Computer science; Artificial intelligence; Political science; Mathematics education; Engineering; Psychology","score_opus":0.04226289565341727,"score_gpt":0.2829359307603361,"score_spread":0.2406730351069188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833943521","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07535826,0.0072351177,0.036301095,0.072467744,0.014994659,0.00041014643,0.0005979302,0.0021349452,0.79050004],"genre_scores_gemma":[0.10567372,0.001911546,0.01795452,0.002731972,0.0008230643,0.00008396536,0.0005729078,0.00043023235,0.86981815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936324,0.000101388265,0.000018352432,0.000086969034,0.00021613947,0.00021399677],"domain_scores_gemma":[0.9984043,0.00002871118,0.000020780555,0.000036452795,0.00034510755,0.0011645281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015655115,0.00085755985,0.00032405934,0.0009305825,0.004392374,0.0049250103,0.0010995332,0.0014255694,0.04834197],"category_scores_gemma":[0.0013280318,0.00034644097,0.00031734508,0.00038044195,0.00090270897,0.002544886,0.0034898743,0.0030816067,0.018117594],"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.00013121858,0.0005872626,0.0019643118,0.00007161006,0.0000092959435,0.00011895698,0.0025542816,0.0005881583,0.0017608557,0.08618497,0.6725835,0.23344563],"study_design_scores_gemma":[0.000008464436,0.0001460343,0.0008387644,0.00006793013,0.0000035188543,0.00007068239,0.0014027084,0.0006511657,0.0006952,0.010958681,0.9851482,0.000008660696],"about_ca_topic_score_codex":0.0068574394,"about_ca_topic_score_gemma":0.03200142,"teacher_disagreement_score":0.04834197,"about_ca_system_score_codex":0.0022329893,"about_ca_system_score_gemma":0.0036939604,"threshold_uncertainty_score":0.16171998},"labels":[],"label_agreement":null},{"id":"W1834407027","doi":"10.1007/978-3-540-69939-2_28","title":"Improving Features Subset Selection Using Genetic Algorithms for Iris Recognition","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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":"Concordia University","funders":"","keywords":"Iris recognition; Computer science; Feature selection; Pattern recognition (psychology); Selection (genetic algorithm); Artificial intelligence; IRIS (biosensor); Gaussian; Feature (linguistics); Biometrics; Set (abstract data type); Machine learning; Data mining","score_opus":0.045710125798393224,"score_gpt":0.27104437797304654,"score_spread":0.2253342521746533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834407027","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.11560245,0.0005628919,0.8804532,0.00008303202,0.00006529899,0.000058378715,0.000063414715,0.0014429056,0.0016683798],"genre_scores_gemma":[0.47494268,0.0002761385,0.52134615,0.0000835934,0.00004270066,0.00008402403,0.00028989327,0.00020911457,0.0027257884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.000063361826,0.000018168987,0.00006135473,0.000101644044,0.000033866465],"domain_scores_gemma":[0.99954516,0.00020050307,0.000035506986,0.00007153884,0.0001345299,0.000012707583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581495,0.00071309024,0.00094367366,0.00080818794,0.0003164342,0.00053051056,0.00073957257,0.00054077985,0.0011744244],"category_scores_gemma":[0.0012587539,0.00026117588,0.0006929744,0.0008043541,0.00024540132,0.0005847603,0.00044288737,0.0005168811,0.00038916417],"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.00021412846,0.0001539839,0.0018422088,0.000058844682,0.00010053137,0.00009763824,0.00006873083,0.20170979,0.056507442,0.0013834875,0.0016258637,0.7362374],"study_design_scores_gemma":[0.000016050039,0.000077364144,0.0010191734,0.0000055390697,0.000045452543,0.000060082042,0.000018503475,0.9842144,0.013049555,0.0009100302,0.00057452853,0.000009215585],"about_ca_topic_score_codex":0.002947456,"about_ca_topic_score_gemma":0.002616643,"teacher_disagreement_score":0.002947456,"about_ca_system_score_codex":0.00025440418,"about_ca_system_score_gemma":0.00034758265,"threshold_uncertainty_score":0.005860567},"labels":[],"label_agreement":null},{"id":"W1834432298","doi":"10.1007/978-3-642-01818-3_24","title":"Co-Training on Handwritten Digit Recognition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Western University","funders":"","keywords":"Digit recognition; Computer science; Construct (python library); Numerical digit; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Training (meteorology); Artificial neural network; Arithmetic; Mathematics","score_opus":0.03589896077276799,"score_gpt":0.27124257374988664,"score_spread":0.23534361297711864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834432298","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.024595765,0.0042223157,0.9466586,0.0003205867,0.000920023,0.0001004575,0.00026704188,0.006339266,0.01657594],"genre_scores_gemma":[0.2987155,0.002895932,0.5756822,0.0006725007,0.0005514129,0.00026889562,0.001976301,0.0011613759,0.1180759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993374,0.000119778044,0.00004011955,0.00019642651,0.00019374411,0.00011249081],"domain_scores_gemma":[0.99853075,0.00055431214,0.00004758485,0.00037465204,0.00043820022,0.000054525717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521297,0.00112411,0.0013765896,0.000680855,0.00057563046,0.0008558118,0.0016970105,0.0012677393,0.016901756],"category_scores_gemma":[0.0016577045,0.0004461567,0.00062957313,0.0015252794,0.0004074447,0.0016615647,0.0016236339,0.0013556469,0.0089611905],"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.00011326278,0.0000875519,0.0003205709,0.00010568342,0.000048198737,0.000094735544,0.000025541436,0.019544441,0.013070881,0.0018518035,0.0124576,0.9522797],"study_design_scores_gemma":[0.00002669709,0.00023452686,0.001713237,0.00006999785,0.00009469743,0.00075168896,0.00007310647,0.871155,0.08050721,0.007066082,0.038264636,0.0000431072],"about_ca_topic_score_codex":0.004173507,"about_ca_topic_score_gemma":0.0074544563,"teacher_disagreement_score":0.016901756,"about_ca_system_score_codex":0.00032069153,"about_ca_system_score_gemma":0.0007208467,"threshold_uncertainty_score":0.05654204},"labels":[],"label_agreement":null},{"id":"W1834534263","doi":"10.1007/10722515_8","title":"Performance Modeling of a Service Provisioning Design","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Provisioning; Computer science; Scalability; Service (business); Service provider; Differentiated service; Service design; Computer network; Software engineering; Database","score_opus":0.023283486785465605,"score_gpt":0.233800948743891,"score_spread":0.2105174619584254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834534263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046923183,0.00037598357,0.9171768,0.00065156503,0.00008312736,0.00014433588,0.00019860918,0.0011523194,0.0332941],"genre_scores_gemma":[0.84541464,0.0005810978,0.13063583,0.00015751837,0.00011479765,0.0002612288,0.0003268906,0.00032953548,0.02217846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919254,0.00025551528,0.00003070662,0.000095460964,0.0003120001,0.00011385188],"domain_scores_gemma":[0.9988997,0.0005824652,0.00007322685,0.00010747188,0.0002918348,0.000045294302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000948142,0.0008699164,0.0004882621,0.0005990826,0.0005033864,0.0016570472,0.0011885314,0.0009881172,0.008259344],"category_scores_gemma":[0.003213706,0.00048766346,0.0005737006,0.0006009919,0.0004793105,0.0011923227,0.0005580952,0.0009591518,0.0014239115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007912251,0.000049220896,0.00031405818,0.00006616332,0.000012845354,0.000049432118,0.000059930142,0.9258612,0.0041483412,0.045093525,0.001161739,0.023104426],"study_design_scores_gemma":[0.000003552066,0.000014762764,0.00004333075,0.0000035050828,0.000005233128,0.0000104555165,0.000003466898,0.99321026,0.0007626649,0.0052742856,0.00066612265,0.000002407302],"about_ca_topic_score_codex":0.0045510796,"about_ca_topic_score_gemma":0.0019573271,"teacher_disagreement_score":0.008259344,"about_ca_system_score_codex":0.0015239575,"about_ca_system_score_gemma":0.0013098195,"threshold_uncertainty_score":0.02763027},"labels":[],"label_agreement":null},{"id":"W1834794781","doi":"10.1007/978-3-540-74510-5_8","title":"Pushing Random Walk Beyond Golden Ratio","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Simon Fraser University","funders":"","keywords":"Random walk; Satisfiability; Computer science; Simple (philosophy); Fraction (chemistry); Algorithm; Mathematics; Statistics","score_opus":0.02818538057039159,"score_gpt":0.26457150185473194,"score_spread":0.23638612128434033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834794781","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.02239046,0.0023645652,0.8919744,0.0065835575,0.001212414,0.000041182466,0.00014998767,0.0009256022,0.07435785],"genre_scores_gemma":[0.67059165,0.0039837467,0.24649632,0.0041170977,0.002806091,0.00032137643,0.0003026178,0.0023414798,0.06903964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854857,0.0006611029,0.00004347964,0.0002732092,0.00034616084,0.00012753396],"domain_scores_gemma":[0.9928618,0.005306735,0.00029971733,0.00071594585,0.0003339199,0.0004819421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028152354,0.0009130338,0.0019842715,0.0014013788,0.0013459232,0.0031054488,0.0018615155,0.0029112091,0.013414182],"category_scores_gemma":[0.021600382,0.0009300697,0.0009845725,0.0009031089,0.0029427246,0.008444102,0.0033021101,0.0051040393,0.0028765737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001474279,0.00000766689,0.000047482776,0.000019916142,0.000007671309,0.000028978508,0.00003284337,0.0047152885,0.00021303349,0.9861742,0.0023236836,0.006414541],"study_design_scores_gemma":[0.000005290817,0.000004505013,0.00001437905,0.0000091176635,0.0000024220815,0.000025510857,0.00000553402,0.021285819,0.00008765048,0.97660977,0.0019443041,0.000005731462],"about_ca_topic_score_codex":0.000516212,"about_ca_topic_score_gemma":0.0003105137,"teacher_disagreement_score":0.013414182,"about_ca_system_score_codex":0.0011746024,"about_ca_system_score_gemma":0.0005462278,"threshold_uncertainty_score":0.044874907},"labels":[],"label_agreement":null},{"id":"W1834817605","doi":"10.1007/bfb0032853","title":"Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quadratic equation; The Imaginary; Class field theory; Mathematics; Class (philosophy); Pure mathematics; Field (mathematics); Mathematical analysis; Computer science; Geometry; Artificial intelligence","score_opus":0.012721797952439013,"score_gpt":0.24021190418678492,"score_spread":0.2274901062343459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834817605","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34378612,0.0024377021,0.21582872,0.0041839853,0.0014117773,0.00013036026,0.00046530104,0.0006335697,0.43112254],"genre_scores_gemma":[0.8507055,0.0006616053,0.049261153,0.0005759969,0.0005452794,0.000085469976,0.00033647974,0.00026250342,0.09756593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995173,0.00012373952,0.000019265193,0.00005954074,0.00017843045,0.00010166815],"domain_scores_gemma":[0.9995136,0.00018687443,0.000051038565,0.000063373605,0.00007887514,0.0001062718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008570804,0.0007372719,0.0006857576,0.0014404092,0.0015784138,0.0026468579,0.0013319979,0.0009929324,0.013091013],"category_scores_gemma":[0.001313174,0.0006356824,0.00067898334,0.0009125529,0.0024634956,0.0047149668,0.0018953958,0.003407177,0.001547086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012071211,0.000013563798,0.00005658275,0.000018603238,0.0000018749387,0.00004718464,0.00017770127,0.00015314994,0.0006778802,0.9956976,0.0007584372,0.0023853204],"study_design_scores_gemma":[0.00002637109,0.000016926611,0.00022688715,0.000020472138,0.0000061802616,0.00021351775,0.00010416043,0.0020048823,0.0009222563,0.98234713,0.014093294,0.00001787491],"about_ca_topic_score_codex":0.00047567268,"about_ca_topic_score_gemma":0.0007119499,"teacher_disagreement_score":0.013091013,"about_ca_system_score_codex":0.0014872306,"about_ca_system_score_gemma":0.0007492572,"threshold_uncertainty_score":0.043793738},"labels":[],"label_agreement":null},{"id":"W1834928324","doi":"10.1007/978-3-642-15585-7_19","title":"An Empirical Evaluation to Study Benefits of Visual versus Textual Test Coverage Information","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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 Calgary","funders":"","keywords":"Computer science; Usability; Unit testing; Visualization; Code coverage; Java; Metric (unit); Abstraction; Test (biology); Code (set theory); Empirical research; Information retrieval; Programming language; Test case; Software engineering; Data mining; Human–computer interaction; Software; Machine learning; Statistics","score_opus":0.034239767217925175,"score_gpt":0.3433009493754234,"score_spread":0.3090611821574982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834928324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704021,0.0023464735,0.015614049,0.00046737233,0.00009444125,0.0009258143,0.0021107043,0.00087671645,0.007162358],"genre_scores_gemma":[0.98173356,0.0003048224,0.013669852,0.00014803896,0.00006864416,0.0005535615,0.0016805861,0.00011623779,0.0017246167],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9834731,0.010408026,0.001245475,0.0011623794,0.0034649114,0.00024609943],"domain_scores_gemma":[0.5428955,0.42263204,0.012209883,0.008112701,0.011971199,0.0021787495],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.014597111,0.0008576465,0.00066263834,0.0030235932,0.00045868,0.0013392556,0.0012478717,0.0015502239,0.008242652],"category_scores_gemma":[0.15990004,0.00031128936,0.00076503964,0.0019512316,0.0009832615,0.002499985,0.0010403066,0.0007664483,0.0009915989],"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.084126435,0.02598352,0.19328564,0.0063279024,0.0019356557,0.00069358904,0.003286511,0.024419248,0.030790113,0.0046289456,0.011451535,0.61307085],"study_design_scores_gemma":[0.023198914,0.1396423,0.4485523,0.0021120945,0.008612836,0.0037603232,0.004367537,0.2730898,0.06649306,0.008209573,0.021405272,0.00055602915],"about_ca_topic_score_codex":0.0015781643,"about_ca_topic_score_gemma":0.0016666895,"teacher_disagreement_score":0.9854029,"about_ca_system_score_codex":0.000922791,"about_ca_system_score_gemma":0.0008064217,"threshold_uncertainty_score":0.07719785},"labels":[],"label_agreement":null},{"id":"W1835137587","doi":"10.1007/978-3-642-04027-6_16","title":"On the Word Problem for ${\\it \\Sigma\\Pi}$ -Categories, and the Properties of Two-Way Communication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Calgary","funders":"","keywords":"Computer science; Sigma; Word (group theory); Pi; Natural language processing; Artificial intelligence; Linguistics; Mathematics; Philosophy; Physics","score_opus":0.02236925122544508,"score_gpt":0.2297262105053634,"score_spread":0.20735695927991832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835137587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14342003,0.019462822,0.47980636,0.03761697,0.0017407562,0.00026583453,0.001657032,0.00075666147,0.3152736],"genre_scores_gemma":[0.74008983,0.009761273,0.12103822,0.0040542088,0.0028839535,0.0008797382,0.0019016251,0.00084228767,0.11854892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821883,0.0005526497,0.0001863103,0.0004269721,0.0003635616,0.00025159484],"domain_scores_gemma":[0.9964251,0.0025637967,0.00018227182,0.0004134965,0.00027218604,0.00014323689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025983069,0.0011948883,0.0020603586,0.0023616864,0.006744504,0.008740136,0.0028551926,0.006700505,0.0149265],"category_scores_gemma":[0.007151634,0.0012148693,0.0027760458,0.004999613,0.012203308,0.04049736,0.0056520104,0.006534094,0.002071017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014374011,0.0000068794366,0.000025961333,0.000037281323,0.000002887067,0.000021625534,0.00016411794,0.00032120445,0.00008050392,0.995086,0.0014702221,0.0027689608],"study_design_scores_gemma":[0.000002976264,0.0000018668857,0.000015959438,0.0000067576702,0.0000015984944,0.00002155154,0.000046982474,0.00047837532,0.00003671712,0.9980817,0.0013002418,0.000005290168],"about_ca_topic_score_codex":0.003663559,"about_ca_topic_score_gemma":0.0022733666,"teacher_disagreement_score":0.0149265,"about_ca_system_score_codex":0.0035647983,"about_ca_system_score_gemma":0.0017895313,"threshold_uncertainty_score":0.04993409},"labels":[],"label_agreement":null},{"id":"W1835322629","doi":"10.1007/bfb0042368","title":"Questions in planning undergraduate software engineering","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Curriculum; Plan (archaeology); Process (computing); Software; Engineering ethics; Position (finance); Engineering management; Engineering; Politics; Position paper; Computer science; Software engineering; Mathematics education; Sociology; Pedagogy; Political science; World Wide Web; Psychology; Business; Programming language","score_opus":0.013048317389191707,"score_gpt":0.24201151701870852,"score_spread":0.2289631996295168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835322629","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.018687846,0.0031484868,0.19910935,0.02953124,0.0010303572,0.0003031632,0.00043883303,0.00054848613,0.74720216],"genre_scores_gemma":[0.43078464,0.0040046,0.13822795,0.003301841,0.00100704,0.0005363085,0.001266961,0.0004919313,0.4203787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934286,0.00032249824,0.000038501425,0.00009900038,0.00014236776,0.000054744527],"domain_scores_gemma":[0.9968592,0.002404751,0.00008164325,0.00014949279,0.00031244243,0.00019249954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011796036,0.00059694034,0.00034529515,0.0004853591,0.0012283395,0.0019434504,0.00089968933,0.0013635688,0.037481945],"category_scores_gemma":[0.0077637457,0.0004159079,0.00042370558,0.0007446102,0.00232112,0.0068339966,0.0012742674,0.002695151,0.0045080977],"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.000054046384,0.000106606436,0.0005900506,0.0001983429,0.0000047107937,0.00011593051,0.0022270854,0.0036429178,0.00030643694,0.76807356,0.077061094,0.14761935],"study_design_scores_gemma":[0.000015325002,0.000050092487,0.0003962538,0.00020949564,0.0000053733675,0.000094919866,0.0014292051,0.0032733441,0.0004958782,0.80115855,0.19286005,0.000011591054],"about_ca_topic_score_codex":0.0022028354,"about_ca_topic_score_gemma":0.0027857188,"teacher_disagreement_score":0.037481945,"about_ca_system_score_codex":0.0017266851,"about_ca_system_score_gemma":0.0013481677,"threshold_uncertainty_score":0.12538958},"labels":[],"label_agreement":null},{"id":"W1835898370","doi":"10.1007/978-3-540-73580-9_19","title":"An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Windsor","funders":"","keywords":"Motion (physics); Class (philosophy); Connection (principal bundle); Topology (electrical circuits); Construct (python library); Representation (politics); Computer science; Set (abstract data type); Mathematics; Ontology; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Geometry","score_opus":0.022753674126035708,"score_gpt":0.2645628645308652,"score_spread":0.24180919040482948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835898370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008244141,0.0021443244,0.9151462,0.0014792057,0.0003084276,0.00004687375,0.00022276776,0.00018963369,0.07221842],"genre_scores_gemma":[0.4635688,0.004449425,0.49262208,0.00088234956,0.0009236852,0.00043003247,0.0006947249,0.00038825267,0.036040667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927765,0.00025548413,0.000049661194,0.00016532166,0.00018111202,0.00007076747],"domain_scores_gemma":[0.99958915,0.00015965922,0.000034837627,0.000095488474,0.00007401535,0.000046908714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918918,0.0005818368,0.00077714084,0.001322443,0.0014018313,0.003132372,0.0017449396,0.0015392811,0.0045779217],"category_scores_gemma":[0.0014025818,0.00056986604,0.001508843,0.0015461065,0.0064764274,0.0069759637,0.0021434298,0.0033403104,0.0007817735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001081391,9.874116e-7,0.000007689687,0.000005677205,0.0000012488922,0.0000067432047,0.00003705832,0.0004397336,0.00007202403,0.9984225,0.00015083073,0.0008543792],"study_design_scores_gemma":[0.0000030660804,0.000003458206,0.00002777495,0.000007105109,0.0000031179065,0.000019096506,0.000023253782,0.0035153243,0.00007593034,0.9879462,0.008372072,0.0000036311812],"about_ca_topic_score_codex":0.0036396284,"about_ca_topic_score_gemma":0.0021620935,"teacher_disagreement_score":0.0045779217,"about_ca_system_score_codex":0.0017034092,"about_ca_system_score_gemma":0.0010818853,"threshold_uncertainty_score":0.015314698},"labels":[],"label_agreement":null},{"id":"W1836139326","doi":"10.1007/3-540-44849-7_30","title":"Improving Customer Proximity to Railway Stations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Dynamic programming; Algorithm","score_opus":0.01739495702249567,"score_gpt":0.2720882694312704,"score_spread":0.25469331240877474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836139326","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.6528985,0.002576712,0.2730271,0.0011111425,0.00031123837,0.00013973427,0.0009892003,0.002172993,0.0667734],"genre_scores_gemma":[0.918624,0.0010068296,0.06036789,0.000116542295,0.00013503488,0.00003876492,0.00078822405,0.0002394017,0.018683337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994017,0.00015211276,0.000021083619,0.00015724922,0.00017183408,0.0000960534],"domain_scores_gemma":[0.9989587,0.00044242296,0.00011482907,0.0001361638,0.00022915308,0.000118789336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041839085,0.0006829482,0.0009472029,0.0008808836,0.00075910176,0.0011915596,0.0013941043,0.0009551143,0.021191634],"category_scores_gemma":[0.003663108,0.0005253815,0.00044416776,0.0022336363,0.00018396077,0.0016570353,0.0016908168,0.0009162195,0.0037044168],"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.0012548742,0.0009460064,0.019168857,0.00053499796,0.00018872767,0.0003792293,0.0006358144,0.17432527,0.03382359,0.012590908,0.01943439,0.7367173],"study_design_scores_gemma":[0.00032461906,0.0035531286,0.048942603,0.00016990268,0.0011575538,0.001569241,0.0027819322,0.7637999,0.06902778,0.039423846,0.06910356,0.00014594782],"about_ca_topic_score_codex":0.0032073199,"about_ca_topic_score_gemma":0.0075009866,"teacher_disagreement_score":0.021191634,"about_ca_system_score_codex":0.0004907418,"about_ca_system_score_gemma":0.00057673344,"threshold_uncertainty_score":0.07089305},"labels":[],"label_agreement":null},{"id":"W1836257789","doi":"10.1007/978-3-540-79230-7_3","title":"Extending Model Checking to Data-Aware Temporal Properties of Web Services","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec à Montréal","funders":"","keywords":"CTL*; Computer science; Workflow; Model checking; Web service; Translation (biology); Computation tree logic; Temporal logic; Distributed computing; Property (philosophy); Constraint (computer-aided design); Theoretical computer science; Data mining; World Wide Web; Database; Mathematics","score_opus":0.044559092577200254,"score_gpt":0.2580862705327919,"score_spread":0.21352717795559162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836257789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018717011,0.00014453998,0.9757224,0.00022892907,0.000060448805,0.00011630308,0.000106683976,0.0030152902,0.0018884309],"genre_scores_gemma":[0.57159775,0.000331609,0.42408895,0.00026986896,0.000110791356,0.00021293566,0.0004202838,0.0010592074,0.0019085708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99191016,0.0025625217,0.00069890515,0.0010499047,0.0027997938,0.000978637],"domain_scores_gemma":[0.9549958,0.033465166,0.0019616,0.00672576,0.0025124613,0.00033919504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007854696,0.0014415338,0.0014970148,0.0021722359,0.0011939439,0.0040177777,0.004165809,0.001689614,0.0024264916],"category_scores_gemma":[0.032908738,0.0017624578,0.004076465,0.0020004935,0.00402244,0.007694383,0.0042892406,0.0038519844,0.0004179422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077352865,0.00040618397,0.0037597134,0.00075777806,0.0003230301,0.0008704783,0.0011823802,0.5178002,0.026288887,0.29556435,0.0027359747,0.14953749],"study_design_scores_gemma":[0.00006385227,0.000045816214,0.0001296266,0.00007198189,0.000086617656,0.000083627965,0.000057493166,0.8338763,0.019281885,0.1443408,0.0019279169,0.000034077737],"about_ca_topic_score_codex":0.008968473,"about_ca_topic_score_gemma":0.007820849,"teacher_disagreement_score":0.008968473,"about_ca_system_score_codex":0.002188616,"about_ca_system_score_gemma":0.0034074832,"threshold_uncertainty_score":0.041540146},"labels":[],"label_agreement":null},{"id":"W1836420046","doi":"10.1007/3-540-45578-7_13","title":"A Filtering Algorithm for the Stretch Constraint","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constraint (computer-aided design); Pruning; Computer science; Sequence (biology); Algorithm; Filter (signal processing); Time constraint; Mathematical optimization; Mathematics; Computer vision","score_opus":0.01939056500295277,"score_gpt":0.24784964645672108,"score_spread":0.2284590814537683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836420046","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.0033725924,0.00014302683,0.9933407,0.00008583816,0.00006364871,0.00005802055,0.0000744777,0.0006752653,0.002186425],"genre_scores_gemma":[0.037384354,0.00024165181,0.9524437,0.00012000741,0.000099174176,0.00013809105,0.00047706816,0.00047196046,0.008624031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.00010556136,0.00006534076,0.0002742823,0.00035390927,0.000119290075],"domain_scores_gemma":[0.9978668,0.0011264548,0.00010433515,0.0003828082,0.00042257187,0.0000970649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219752,0.0014388977,0.0018029381,0.001966257,0.0014932283,0.0021761989,0.0022480215,0.0022439768,0.017422898],"category_scores_gemma":[0.0048323674,0.00094962196,0.00155215,0.0026953865,0.00094230846,0.0040273755,0.0018869415,0.0024633352,0.0033249536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031717677,0.00018533976,0.0004666107,0.0002246822,0.000063679625,0.000101970174,0.00016524455,0.057427492,0.012465073,0.074817225,0.01628598,0.8374795],"study_design_scores_gemma":[0.00014357474,0.00016462087,0.00040273138,0.0000652441,0.00006230078,0.00022877107,0.00007963544,0.86239433,0.010899137,0.10675069,0.01874712,0.00006182538],"about_ca_topic_score_codex":0.0061751544,"about_ca_topic_score_gemma":0.0058090826,"teacher_disagreement_score":0.017422898,"about_ca_system_score_codex":0.0011637743,"about_ca_system_score_gemma":0.0015783656,"threshold_uncertainty_score":0.058285356},"labels":[],"label_agreement":null},{"id":"W1836437957","doi":"10.1007/978-3-540-85361-9_19","title":"Unfolding-Based Diagnosis of Systems with an Evolving Topology","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Correctness; Petri net; Computer science; Theoretical computer science; Categorical variable; Exploit; Rule-based machine translation; Graph; Algorithm; Topology (electrical circuits); Mathematics; Artificial intelligence; Machine learning","score_opus":0.015226566097175044,"score_gpt":0.24060535517531625,"score_spread":0.2253787890781412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836437957","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.19193877,0.00016331786,0.8057051,0.00017099884,0.000023385935,0.000045296918,0.00009501893,0.0008769635,0.0009812182],"genre_scores_gemma":[0.94165635,0.00007685618,0.057728615,0.000017371192,0.000009610966,0.00002093586,0.00009160189,0.000030427733,0.00036814468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994803,0.0001486403,0.000025433239,0.00009575145,0.00017980591,0.000070182716],"domain_scores_gemma":[0.9962528,0.0026790744,0.00029042372,0.0003134568,0.00032373783,0.0001404877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086120056,0.0006514722,0.00066919933,0.0010193839,0.0004464592,0.0006412324,0.0007980479,0.0006640165,0.0010231838],"category_scores_gemma":[0.0051055653,0.00027410348,0.00049113,0.0006052906,0.00094114954,0.0012379221,0.0011034943,0.0006752718,0.00009575617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038677192,0.0000599994,0.004062412,0.00015570484,0.000056016335,0.0006914215,0.00031752215,0.8835953,0.016154675,0.024651945,0.000448973,0.06941938],"study_design_scores_gemma":[0.000005680402,0.000024359275,0.00040383224,0.0000040298683,0.0000085183365,0.000044577464,0.00001640722,0.98441654,0.0021288139,0.012817971,0.00012531257,0.0000039272427],"about_ca_topic_score_codex":0.0024678586,"about_ca_topic_score_gemma":0.0024171511,"teacher_disagreement_score":0.0024678586,"about_ca_system_score_codex":0.00075832236,"about_ca_system_score_gemma":0.0005719093,"threshold_uncertainty_score":0.005502045},"labels":[],"label_agreement":null},{"id":"W1836516978","doi":"10.1007/978-3-642-11928-6_19","title":"Concept Analysis as a Framework for Mining Functional Features from Legacy Code","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Programming language; Implementation; Set (abstract data type); Code (set theory); Class (philosophy); Functional programming; Inheritance (genetic algorithm); Software engineering; Theoretical computer science; Artificial intelligence","score_opus":0.035978246445163016,"score_gpt":0.3035847591646655,"score_spread":0.2676065127195025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836516978","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.0064613903,0.00050379266,0.989038,0.00013320919,0.00001650482,0.00017080894,0.000708448,0.0020418398,0.00092592795],"genre_scores_gemma":[0.041611925,0.0002508727,0.9552625,0.000054230088,0.000018836527,0.00024558927,0.0016445221,0.00011751956,0.00079404685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980914,0.00037329627,0.00017929851,0.0004084594,0.0008629349,0.00008451212],"domain_scores_gemma":[0.9958948,0.0027706036,0.0003232048,0.00035649087,0.0005500416,0.00010496276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025169596,0.0011587897,0.0008441789,0.007567551,0.0009186754,0.0027920192,0.002435399,0.0008693885,0.0027747906],"category_scores_gemma":[0.006638874,0.0005884015,0.0022025472,0.005086121,0.0012636303,0.0028788846,0.0015156369,0.0017715693,0.0011607065],"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.00016091451,0.00025421227,0.008292947,0.0011390201,0.00028345504,0.00060473406,0.001427318,0.02083524,0.012918358,0.10977429,0.007677772,0.83663166],"study_design_scores_gemma":[0.000062932544,0.0002558339,0.008066832,0.0005138681,0.00038601147,0.001701501,0.0010186034,0.6250788,0.020949028,0.2883962,0.053430073,0.00014031501],"about_ca_topic_score_codex":0.005225611,"about_ca_topic_score_gemma":0.006197259,"teacher_disagreement_score":0.007567551,"about_ca_system_score_codex":0.0009824422,"about_ca_system_score_gemma":0.0024887093,"threshold_uncertainty_score":0.013311088},"labels":[],"label_agreement":null},{"id":"W1836529743","doi":"10.1007/978-3-642-13059-5_27","title":"Phrase-Based Statistical Machine Translation for a Low-Density Language Pair","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Computer science; Phrase; Bengali; Machine translation; Transliteration; Natural language processing; Artificial intelligence; Evaluation of machine translation; Component (thermodynamics); Set (abstract data type); Translation (biology); BLEU; Test set; Machine translation software usability; Example-based machine translation; Programming language","score_opus":0.012263877094776969,"score_gpt":0.27085807556316316,"score_spread":0.2585941984683862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836529743","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.027699137,0.0006911585,0.9553019,0.000725019,0.00055839843,0.00017953465,0.0016696943,0.007367571,0.005807514],"genre_scores_gemma":[0.24787895,0.0005856581,0.7367581,0.0003367335,0.00040771833,0.00032962018,0.0056094,0.0012926603,0.0068011074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838245,0.00055699464,0.0001514465,0.00039078013,0.0003877903,0.00013058941],"domain_scores_gemma":[0.9962685,0.0018229203,0.00017153993,0.0006287231,0.0010195732,0.000088683235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373229,0.0010341874,0.001384318,0.0014847966,0.0012514485,0.0021435155,0.0011792628,0.0016706071,0.012077903],"category_scores_gemma":[0.0058002686,0.00068627996,0.0012088203,0.0022629155,0.0005924942,0.0025049425,0.0021397125,0.0018951936,0.012789345],"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.0008109024,0.00037728323,0.0011878301,0.0011610723,0.00020801241,0.0019505463,0.00070191576,0.028293904,0.10425995,0.06224312,0.0416434,0.75716203],"study_design_scores_gemma":[0.00016296134,0.0005603044,0.0012673319,0.00009297033,0.00022395542,0.0020099948,0.00044781112,0.78729355,0.08080306,0.09934193,0.027656527,0.00013961918],"about_ca_topic_score_codex":0.0010657472,"about_ca_topic_score_gemma":0.0021200548,"teacher_disagreement_score":0.012077903,"about_ca_system_score_codex":0.0004777949,"about_ca_system_score_gemma":0.0015493939,"threshold_uncertainty_score":0.040404618},"labels":[],"label_agreement":null},{"id":"W1836544685","doi":"10.1007/3-540-44839-x_19","title":"A Context-Based Information Agent for Supporting Education on the Web","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Context (archaeology); Closeness; Information retrieval; Session (web analytics); Domain (mathematical analysis); Set (abstract data type); Hierarchy; Filter (signal processing); Information space; Task (project management); Domain knowledge; Meaning (existential); World Wide Web; Artificial intelligence","score_opus":0.02460755290130029,"score_gpt":0.2697590355634589,"score_spread":0.24515148266215864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836544685","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.08902514,0.0027599782,0.8426973,0.0015942649,0.00069719815,0.0007797224,0.00059351063,0.020932024,0.040920794],"genre_scores_gemma":[0.40882134,0.0010294411,0.56773424,0.00043252,0.00015820388,0.0002987562,0.00050670526,0.00022039404,0.0207984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.00008851657,0.00003200695,0.000060499064,0.00009295124,0.000030716095],"domain_scores_gemma":[0.9994216,0.00017547954,0.000033678287,0.000097564436,0.00013498413,0.00013662581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069270376,0.0003719568,0.00053300476,0.0005541756,0.0009335219,0.001510336,0.0010152763,0.0015605711,0.004083675],"category_scores_gemma":[0.0016094507,0.00033330865,0.00031226673,0.0005270279,0.00024056646,0.0019293332,0.0014064709,0.0011105256,0.0016879459],"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.0011569206,0.0016642608,0.0071642892,0.0006746382,0.00024834342,0.0010466184,0.0017601716,0.023664802,0.058791663,0.04635908,0.046487994,0.8109812],"study_design_scores_gemma":[0.0004954987,0.0009412589,0.005577585,0.00025012527,0.0007278783,0.0013785259,0.0007351745,0.5877402,0.066460304,0.02857329,0.30686647,0.0002536785],"about_ca_topic_score_codex":0.00283385,"about_ca_topic_score_gemma":0.005799867,"teacher_disagreement_score":0.004083675,"about_ca_system_score_codex":0.00025208938,"about_ca_system_score_gemma":0.00063007616,"threshold_uncertainty_score":0.013661206},"labels":[],"label_agreement":null},{"id":"W1836766809","doi":"10.1007/3-540-44732-6_33","title":"Complex Images and Complex Filters: A Unified Model for Encoding and Matching Shape and Colour","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Matching (statistics); Encoding (memory); Pattern recognition (psychology); Fourier transform; Feature (linguistics); Filter (signal processing); Feature extraction; Mathematics","score_opus":0.05970573594887894,"score_gpt":0.289000093459731,"score_spread":0.22929435751085206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836766809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020834396,0.0008180393,0.9940455,0.0001474575,0.00006868918,0.000029657625,0.00015453607,0.00031475726,0.002337902],"genre_scores_gemma":[0.1449476,0.0045081507,0.83090276,0.0003655166,0.00039000952,0.00030421515,0.0007601108,0.0004722465,0.017349422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992624,0.00012223942,0.00005547323,0.0002154544,0.00027500172,0.000069326066],"domain_scores_gemma":[0.99892634,0.0003514091,0.000095426796,0.0002851987,0.00028405836,0.00005759856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008708004,0.0012467032,0.0013859926,0.0019547346,0.0005638051,0.004528397,0.0032446664,0.0020261412,0.0053552715],"category_scores_gemma":[0.003938429,0.00076242903,0.0012006926,0.0032194362,0.0021320193,0.0064301034,0.0014413375,0.002029792,0.002332003],"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.00018769152,0.000054221502,0.00036225579,0.00024279476,0.000067211804,0.00015883618,0.00027554433,0.082387924,0.01466156,0.70196503,0.007847302,0.19178957],"study_design_scores_gemma":[0.000020566951,0.000052876374,0.00027055293,0.000044240955,0.000053489563,0.00027805983,0.000048131773,0.60122454,0.0042374283,0.37710944,0.016603174,0.00005743213],"about_ca_topic_score_codex":0.007368486,"about_ca_topic_score_gemma":0.006821431,"teacher_disagreement_score":0.007368486,"about_ca_system_score_codex":0.0012938885,"about_ca_system_score_gemma":0.0011184382,"threshold_uncertainty_score":0.01791513},"labels":[],"label_agreement":null},{"id":"W1836853629","doi":"10.1007/978-3-642-04268-3_8","title":"Optimal Matching for Prostate Brachytherapy Seed Localization with Dimension Reduction","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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":"Queen's University","funders":"National Cancer Institute; National Institutes of Health","keywords":"Imaging phantom; Computer science; Robustness (evolution); Prostate brachytherapy; Brachytherapy; Dimension (graph theory); Fluoroscopy; Reduction (mathematics); Projection (relational algebra); Algorithm; Dosimetry; Matching (statistics); Mathematical optimization; Computer vision; Artificial intelligence; Mathematics; Radiation therapy; Nuclear medicine; Radiology","score_opus":0.006033469741328019,"score_gpt":0.24473691466184253,"score_spread":0.2387034449205145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836853629","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.020283123,0.00032193624,0.97757393,0.00009711343,0.00003344086,0.000034698496,0.00007524237,0.00071306294,0.00086750503],"genre_scores_gemma":[0.31664795,0.00025935879,0.68010694,0.000097388474,0.000039960676,0.000095336,0.00022730627,0.00020296764,0.0023226412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925584,0.00017814609,0.00004168223,0.00012534884,0.0003239457,0.000075127544],"domain_scores_gemma":[0.9994912,0.00023280253,0.000056997585,0.000110978275,0.000085910026,0.000022154882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960796,0.00050222303,0.0010503792,0.0010273336,0.00032661602,0.0006883528,0.00079357217,0.00077538984,0.0019914375],"category_scores_gemma":[0.0024945352,0.00073756493,0.0008780299,0.0011051655,0.0003072851,0.00066793134,0.0013175186,0.00049581943,0.00069885945],"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.0008345246,0.00016579712,0.0015471501,0.00020684024,0.00016121766,0.00013569674,0.00013213027,0.23938644,0.090542875,0.010368171,0.0050401883,0.651479],"study_design_scores_gemma":[0.000031160253,0.0000634557,0.0008818833,0.000006905181,0.000029848952,0.00018790315,0.00001809997,0.97603637,0.015980246,0.005146051,0.0015968188,0.00002124898],"about_ca_topic_score_codex":0.002622118,"about_ca_topic_score_gemma":0.0026380084,"teacher_disagreement_score":0.002622118,"about_ca_system_score_codex":0.00053077936,"about_ca_system_score_gemma":0.000961087,"threshold_uncertainty_score":0.0066620708},"labels":[],"label_agreement":null},{"id":"W1836961878","doi":"10.1007/978-3-642-37247-6_7","title":"Approaches of Anonymisation of an SMS Corpus","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":52,"is_retracted":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":"Computer science; Process (computing); Artificial intelligence; Order (exchange); Machine learning; Natural language processing; Data mining; Information retrieval","score_opus":0.028695949591384086,"score_gpt":0.22565341556487306,"score_spread":0.19695746597348898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836961878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014441293,0.0005627686,0.9694341,0.0014374199,0.0002895131,0.00043130183,0.0028260122,0.0021044044,0.008473135],"genre_scores_gemma":[0.23581986,0.001353096,0.72293353,0.00042097093,0.00066025805,0.0010277616,0.020160157,0.0015701097,0.016054215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9862959,0.0076334835,0.0007622015,0.0016394543,0.0030489543,0.0006199858],"domain_scores_gemma":[0.9654281,0.015478072,0.0011658879,0.0141565865,0.0034650823,0.00030634867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106122475,0.0009067195,0.0012749023,0.0068202303,0.0026743335,0.0058815903,0.0027170999,0.0020837262,0.0057386965],"category_scores_gemma":[0.0460142,0.0011673394,0.001470266,0.0064427187,0.0028095224,0.008645191,0.008642409,0.003166396,0.004778294],"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.00067414116,0.00020865115,0.002657048,0.00071205944,0.0002188087,0.00067022536,0.0050708083,0.040059514,0.014448768,0.456956,0.03155058,0.4467734],"study_design_scores_gemma":[0.000052286265,0.00009267506,0.0023177408,0.00035982736,0.00013939559,0.0009194364,0.0026817773,0.28395018,0.027672255,0.54202056,0.13967933,0.000114540955],"about_ca_topic_score_codex":0.0021333445,"about_ca_topic_score_gemma":0.0023217339,"teacher_disagreement_score":0.0106122475,"about_ca_system_score_codex":0.0016461444,"about_ca_system_score_gemma":0.0027852776,"threshold_uncertainty_score":0.056123614},"labels":[],"label_agreement":null},{"id":"W1837658860","doi":"10.1007/978-3-540-69812-8_89","title":"Optimal Features Subset Selection Using Genetic Algorithms for Iris Recognition","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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":"Concordia University","funders":"","keywords":"Iris recognition; Computer science; Biometrics; Feature selection; Pattern recognition (psychology); Artificial intelligence; Selection (genetic algorithm); IRIS (biosensor); Principal component analysis; Feature (linguistics); Gaussian","score_opus":0.051759132888442756,"score_gpt":0.2805869966771369,"score_spread":0.22882786378869413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837658860","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.05865575,0.0005389144,0.9382988,0.00007796519,0.000035707184,0.000045878853,0.000047604746,0.00065800105,0.0016413664],"genre_scores_gemma":[0.46801203,0.0003015019,0.52845925,0.00005917739,0.000032296542,0.000121546465,0.00019060104,0.00014093949,0.0026826393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975306,0.0000650502,0.000014553595,0.000055439636,0.000080585225,0.000031387954],"domain_scores_gemma":[0.99968374,0.00016757233,0.000027321696,0.00003875412,0.00007376141,0.000008858137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050767866,0.00059319707,0.0008968658,0.0007856869,0.0003225647,0.0005257334,0.00063325546,0.00055244047,0.001165962],"category_scores_gemma":[0.0011135028,0.0003267001,0.00071569916,0.00077511877,0.00030761634,0.0005180644,0.00041080354,0.00045034906,0.00027849362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019416558,0.000101897494,0.0010785264,0.00006255819,0.0000784984,0.000086038846,0.00008075882,0.40101892,0.027658232,0.0028067376,0.0014178085,0.56541586],"study_design_scores_gemma":[0.0000113346305,0.000041308445,0.00043464336,0.0000056054437,0.000022238612,0.00003452602,0.000015007241,0.9925755,0.004875562,0.0015954778,0.00038223257,0.0000066343714],"about_ca_topic_score_codex":0.0029393197,"about_ca_topic_score_gemma":0.0024855991,"teacher_disagreement_score":0.0029393197,"about_ca_system_score_codex":0.0003327273,"about_ca_system_score_gemma":0.00042562242,"threshold_uncertainty_score":0.0058444142},"labels":[],"label_agreement":null},{"id":"W1837826463","doi":"10.1007/978-3-642-15928-2_24","title":"Amalgamating Pushout and Pullback Graph Transformation in Collagories","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"McMaster University","funders":"","keywords":"Computer science; Pullback; Graph rewriting; Graph; Transformation (genetics); Theoretical computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.013788478101884027,"score_gpt":0.2370957112749463,"score_spread":0.22330723317306228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837826463","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030275166,0.00013884445,0.93265575,0.00028739186,0.00017405051,0.0002280425,0.0003754083,0.02025979,0.0156054925],"genre_scores_gemma":[0.24944809,0.000194562,0.7070656,0.00025367367,0.00005032499,0.00019364478,0.0016348279,0.008672798,0.03248645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989191,0.0001978118,0.00007460154,0.0003233264,0.00034977563,0.00013541589],"domain_scores_gemma":[0.9980558,0.00055390934,0.000059547423,0.0009571608,0.00030513367,0.00006846119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826522,0.00076603395,0.000679048,0.0012356244,0.00090244925,0.0017021188,0.001308427,0.00090722204,0.013969851],"category_scores_gemma":[0.0030871902,0.00052999274,0.0016336791,0.0012171315,0.0013082462,0.0033044603,0.0033952051,0.0013779504,0.0032793165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055592315,0.00040574156,0.001753836,0.0006819532,0.00013026784,0.00077007234,0.0013729399,0.022852352,0.038493715,0.18568663,0.020675244,0.72662127],"study_design_scores_gemma":[0.00013880258,0.00026431368,0.0014313363,0.00018293849,0.0003446127,0.0009011386,0.0009383164,0.27785972,0.16430491,0.39520806,0.15829833,0.00012753844],"about_ca_topic_score_codex":0.0036664177,"about_ca_topic_score_gemma":0.006110629,"teacher_disagreement_score":0.013969851,"about_ca_system_score_codex":0.0006576192,"about_ca_system_score_gemma":0.0009036151,"threshold_uncertainty_score":0.046733737},"labels":[],"label_agreement":null},{"id":"W1838171755","doi":"10.1007/978-3-540-87781-3_54","title":"A UML Model of the Client Tracking System at the Learning Enrichment Foundation in Toronto, Canada: A Study of Class, Object, and State Diagrams","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":1,"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":"Unified Modeling Language; Computer science; Class diagram; Class (philosophy); Applications of UML; Use Case Diagram; Tracking (education); Object (grammar); State (computer science); Software engineering; Artificial intelligence; Programming language","score_opus":0.03708846954270415,"score_gpt":0.31604604734894504,"score_spread":0.27895757780624086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838171755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19861439,0.0019987011,0.53935665,0.0070951665,0.0001912869,0.0010280075,0.021414498,0.007439203,0.22286218],"genre_scores_gemma":[0.6312162,0.0020961065,0.24753541,0.0003938849,0.000027807842,0.00046781814,0.008450936,0.0011817613,0.10863002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995334,0.0000834334,0.000023864643,0.000052485866,0.00022801844,0.00007884166],"domain_scores_gemma":[0.9988508,0.00046271386,0.0000884385,0.000077893004,0.000427676,0.00009235444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006841459,0.00046276808,0.0002532225,0.0017970332,0.0019227793,0.0039781756,0.0016859038,0.0013543809,0.007402527],"category_scores_gemma":[0.002024026,0.00067212473,0.00043308764,0.0022909662,0.0014796187,0.0017481053,0.0005356054,0.0009695409,0.0012712665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020840373,0.00017687146,0.014426154,0.0005756503,0.00003493104,0.0020209895,0.0358923,0.13929522,0.015098566,0.6004954,0.046715546,0.14505997],"study_design_scores_gemma":[0.000093721406,0.000096399046,0.023187336,0.00088739104,0.00013457761,0.0009512012,0.01043469,0.4233118,0.010810955,0.04793249,0.48190317,0.0002562427],"about_ca_topic_score_codex":0.9306517,"about_ca_topic_score_gemma":0.9372784,"teacher_disagreement_score":0.9306517,"about_ca_system_score_codex":0.01945206,"about_ca_system_score_gemma":0.030449789,"threshold_uncertainty_score":0.14113522},"labels":[],"label_agreement":null},{"id":"W1838693299","doi":"10.1007/bfb0045693","title":"The cognitive basis of knowledge engineering","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Science and Education Research","field":"Neuroscience","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 Calgary","funders":"","keywords":"Knowledge engineering; Cognition; Perspective (graphical); Comprehension; Computer science; Cognitive science; Domain knowledge; Knowledge management; Knowledge representation and reasoning; Cognitive ergonomics; Socio-cognitive; Artificial intelligence; Psychology","score_opus":0.03888725655303279,"score_gpt":0.30913616605541605,"score_spread":0.2702489095023833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838693299","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.03771979,0.013523636,0.28570482,0.0133539,0.00042254693,0.000051901992,0.00013996495,0.00020749652,0.6488759],"genre_scores_gemma":[0.8544042,0.007267277,0.103238314,0.00088603364,0.00036714796,0.000121995254,0.00023622798,0.00007992789,0.033398885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995449,0.00017325518,0.000028654811,0.000076615535,0.00013886332,0.00003775044],"domain_scores_gemma":[0.9980148,0.0013951445,0.00009043109,0.00022982538,0.00020057504,0.000069233574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009588741,0.0003675855,0.000256464,0.00081912655,0.0005879351,0.0044238563,0.0009906433,0.0011124071,0.0044612223],"category_scores_gemma":[0.0036142666,0.0003201691,0.00042578636,0.0008888858,0.007632838,0.0060847877,0.00082695583,0.0018016427,0.0006717361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004984588,0.000009776621,0.00013343376,0.000036689416,0.000008018066,0.000036790152,0.0005996842,0.00069324113,0.00023980335,0.9818918,0.0011792311,0.015166514],"study_design_scores_gemma":[0.000002663794,0.0000022287588,0.00015257706,0.000014223122,0.000002477529,0.000037551104,0.00008826812,0.0008922798,0.000108696484,0.991869,0.0068271444,0.0000029000353],"about_ca_topic_score_codex":0.002361263,"about_ca_topic_score_gemma":0.0020673797,"teacher_disagreement_score":0.0044612223,"about_ca_system_score_codex":0.0013876561,"about_ca_system_score_gemma":0.001268223,"threshold_uncertainty_score":0.014924288},"labels":[],"label_agreement":null},{"id":"W1838803699","doi":"10.1007/978-3-540-73110-8_85","title":"Evaluating Eye Tracking with ISO 9241 - Part 9","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":134,"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; Throughput; Eye tracking; Fixation (population genetics); Tracking (education); Dwell time; Selection (genetic algorithm); Point (geometry); Task (project management); Tracking system; Artificial intelligence; Computer vision; Computer hardware; Simulation; Operating system; Engineering","score_opus":0.0581028780014639,"score_gpt":0.3296150350680574,"score_spread":0.2715121570665935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838803699","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.56276053,0.0033633616,0.3421834,0.00034109212,0.0006330056,0.0034425452,0.00842255,0.0068377224,0.07201578],"genre_scores_gemma":[0.8144985,0.0013689887,0.14640756,0.00015827801,0.000057803307,0.0013166523,0.013430242,0.000766173,0.021995809],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99347526,0.0013085001,0.0007004768,0.00046388607,0.0038731827,0.00017868997],"domain_scores_gemma":[0.9910129,0.0016914355,0.00059575477,0.00066997454,0.005898349,0.00013151592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004939522,0.0010856475,0.0007061916,0.002774759,0.00054265856,0.0018324702,0.0008652499,0.0014025437,0.0057579586],"category_scores_gemma":[0.01682497,0.00035387304,0.0008291095,0.0015737077,0.00039564248,0.001722892,0.0012421352,0.00036234903,0.0039330716],"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.0013778477,0.00046110855,0.06947303,0.0010901045,0.00031828886,0.00018397866,0.0006032422,0.016252644,0.07802482,0.0016614518,0.017622678,0.81293076],"study_design_scores_gemma":[0.00019724015,0.004223932,0.59725904,0.0008752408,0.000735241,0.0015965014,0.0013932936,0.16450746,0.17760757,0.0030743566,0.04826655,0.00026366202],"about_ca_topic_score_codex":0.009840638,"about_ca_topic_score_gemma":0.010931665,"teacher_disagreement_score":0.009840638,"about_ca_system_score_codex":0.00077038497,"about_ca_system_score_gemma":0.0010171705,"threshold_uncertainty_score":0.026123047},"labels":[],"label_agreement":null},{"id":"W1839073209","doi":"10.1007/978-3-642-33509-9_32","title":"Consensus Algorithms in a Multi-agent Framework to Solve PTZ Camera Reconfiguration in UAVs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Computer science; Control reconfiguration; Zoom; Scalability; Artificial intelligence; Computer vision; Tracking (education); Real-time computing; Embedded system","score_opus":0.0383510661276853,"score_gpt":0.30995284328900463,"score_spread":0.27160177716131934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839073209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152240945,0.00021587846,0.9822139,0.00012382265,0.000048924376,0.000036772155,0.000013537555,0.00019458796,0.001928452],"genre_scores_gemma":[0.7689673,0.00026575162,0.22650313,0.00006808599,0.000045516063,0.00019341198,0.00007110739,0.00007640424,0.0038092455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973863,0.00007626265,0.000017469376,0.000067166,0.000059121194,0.00004124283],"domain_scores_gemma":[0.99948967,0.00026547874,0.00006563582,0.000034774614,0.00010893781,0.000035550755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058875413,0.00073231664,0.0011122031,0.0003678984,0.00073760323,0.00083204225,0.0011588637,0.0011957022,0.0014961874],"category_scores_gemma":[0.0014324541,0.00050311757,0.0006457739,0.00051214924,0.0006438166,0.00088821066,0.0011047234,0.0012907338,0.00023066676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035069657,0.00001718745,0.000116424446,0.00004125163,0.000018878054,0.0000498475,0.00005341739,0.9759296,0.0014149026,0.0047565363,0.00045879753,0.01710805],"study_design_scores_gemma":[0.000008002423,0.000015272504,0.000026529373,0.0000022418822,0.000003132267,0.0000064343535,0.000009423944,0.99785393,0.00025437624,0.0016424033,0.0001754971,0.0000026899866],"about_ca_topic_score_codex":0.0067187874,"about_ca_topic_score_gemma":0.005063341,"teacher_disagreement_score":0.0067187874,"about_ca_system_score_codex":0.000568211,"about_ca_system_score_gemma":0.0007741912,"threshold_uncertainty_score":0.013359368},"labels":[],"label_agreement":null},{"id":"W183907894","doi":"10.1007/3-540-44987-6_25","title":"Hyper-bent Functions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":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":"Bent molecular geometry; Monomial; Affine transformation; Bijection; Class (philosophy); Bent function; Computer science; Boolean function; Affine variety; Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.017329643431957937,"score_gpt":0.226247697678485,"score_spread":0.20891805424652704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183907894","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.055040523,0.0037947865,0.19099025,0.0016119285,0.0013125023,0.000056004177,0.00043146143,0.00063917227,0.7461235],"genre_scores_gemma":[0.40624472,0.0056968965,0.06680337,0.0010835122,0.0009683144,0.00012977129,0.00064882863,0.00085908954,0.5175655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997708,0.000039826726,0.000010972308,0.000036734426,0.00010674155,0.00003488682],"domain_scores_gemma":[0.9997589,0.000053163058,0.000020736483,0.00005819607,0.00006449254,0.00004448451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024862753,0.00075737445,0.0004493636,0.0016184364,0.0007229377,0.0017390663,0.00048322565,0.0005173913,0.019391075],"category_scores_gemma":[0.0007009175,0.00033829806,0.0003786859,0.0015848555,0.0010390264,0.0019247368,0.0011434217,0.0024018188,0.008142496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029200624,0.000015344709,0.00006325382,0.000054519776,0.000006305359,0.000036506663,0.000080466496,0.00052140007,0.0033266495,0.91796494,0.007985546,0.069915794],"study_design_scores_gemma":[0.000010118873,0.000037913673,0.0002672175,0.00004320143,0.000013074529,0.00040446807,0.000060408867,0.0035765497,0.0041391244,0.9054085,0.08601955,0.000020021062],"about_ca_topic_score_codex":0.00016914555,"about_ca_topic_score_gemma":0.00023148482,"teacher_disagreement_score":0.019391075,"about_ca_system_score_codex":0.00060231105,"about_ca_system_score_gemma":0.0002940808,"threshold_uncertainty_score":0.06486964},"labels":[],"label_agreement":null},{"id":"W183918048","doi":"10.1007/978-3-642-21869-9_12","title":"A Cognitive Tutoring Agent with Episodic and Causal Learning Capabilities","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; TUTOR; Cognitive architecture; Intelligent tutoring system; Cognition; Cognitive science; Human–computer interaction; Artificial intelligence; Intelligent agent; Architecture; Psychology; Programming language","score_opus":0.025052560623896967,"score_gpt":0.23479248781437684,"score_spread":0.20973992719047987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183918048","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.08442115,0.00030398226,0.8736667,0.00067482813,0.000152502,0.00018386642,0.00018851645,0.00997058,0.03043787],"genre_scores_gemma":[0.55701876,0.00018794413,0.42341605,0.00022862059,0.000067374065,0.00017171967,0.00024116357,0.00015614825,0.018512212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998399,0.00002937273,0.000015665275,0.000040637748,0.000055909477,0.000018494857],"domain_scores_gemma":[0.9993942,0.00025823954,0.000039722676,0.000085560016,0.00010019171,0.00012218072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037863626,0.0003279524,0.00034497274,0.00023366907,0.0004634539,0.0012954841,0.0014348945,0.0013238462,0.004484662],"category_scores_gemma":[0.0018033475,0.00027722813,0.00026649388,0.00016567757,0.0005119116,0.0013493579,0.0013665668,0.0007631555,0.001070232],"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.00094287173,0.0011005645,0.0054580187,0.00046136038,0.00021731274,0.0015002697,0.0019789722,0.10992579,0.07782994,0.19683069,0.022266608,0.58148766],"study_design_scores_gemma":[0.0002970872,0.00040302545,0.0010389029,0.000044701304,0.00017210527,0.0010329408,0.00015528365,0.8174233,0.042927295,0.06292588,0.07350637,0.000073146264],"about_ca_topic_score_codex":0.0010940343,"about_ca_topic_score_gemma":0.0013166198,"teacher_disagreement_score":0.004484662,"about_ca_system_score_codex":0.000327235,"about_ca_system_score_gemma":0.00066167663,"threshold_uncertainty_score":0.015002668},"labels":[],"label_agreement":null},{"id":"W1839270925","doi":"10.1007/11568346_2","title":"Current Practices in the Use of UML","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Lethbridge","funders":"","keywords":"Computer science; Unified Modeling Language; Programming language; Software engineering; Applications of UML; Software","score_opus":0.06674049052490448,"score_gpt":0.30074637155326184,"score_spread":0.23400588102835734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839270925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029234923,0.19391017,0.56248116,0.052353185,0.0015798183,0.00017390611,0.0002650721,0.0031408223,0.1568609],"genre_scores_gemma":[0.3251437,0.23079439,0.39397293,0.009365745,0.0012655183,0.00026476145,0.0010824547,0.0023504607,0.035760134],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9592503,0.019384671,0.004248898,0.0032536045,0.012896869,0.0009656932],"domain_scores_gemma":[0.8874762,0.08062184,0.0046130894,0.012584717,0.013162397,0.001541711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04431961,0.000764012,0.0005910123,0.006158187,0.0014602225,0.013405905,0.004365007,0.0026672296,0.0049034045],"category_scores_gemma":[0.05670758,0.0014433161,0.0010387226,0.007203251,0.0069959736,0.014654467,0.0047178743,0.0046917587,0.0033293937],"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.00007668219,0.00011741145,0.0031619587,0.0019367691,0.00004248109,0.00016126594,0.010108025,0.0017054413,0.00411128,0.26309896,0.011136661,0.7043429],"study_design_scores_gemma":[0.000023489856,0.0000984078,0.0021439895,0.0064747264,0.00007965385,0.0013564285,0.005621044,0.004626356,0.0068948315,0.09808806,0.8744972,0.00009586918],"about_ca_topic_score_codex":0.0063601793,"about_ca_topic_score_gemma":0.0072900713,"teacher_disagreement_score":0.04431961,"about_ca_system_score_codex":0.0055557783,"about_ca_system_score_gemma":0.005390278,"threshold_uncertainty_score":0.23438734},"labels":[],"label_agreement":null},{"id":"W1839938879","doi":"10.1007/11559573_105","title":"A Model-Based Hematopoietic Stem Cell Tracker","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer vision; Probabilistic logic; Artificial intelligence; Segmentation; Tracking (education); Stem cell; Hematopoietic stem cell; Cytometry; Image segmentation; Flow cytometry; Pattern recognition (psychology); Haematopoiesis; Biology; Immunology; Cell biology","score_opus":0.010293419329160166,"score_gpt":0.2409135777857705,"score_spread":0.23062015845661032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839938879","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.016238915,0.00048079411,0.9731269,0.0002013481,0.00014097255,0.0000665918,0.00030698229,0.0036042212,0.0058332644],"genre_scores_gemma":[0.1523654,0.001348213,0.8186256,0.00021813528,0.000038093043,0.00018322033,0.0011908812,0.0009821946,0.025048297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978536,0.000013471161,0.0000059394065,0.00003185671,0.00014968871,0.000013694686],"domain_scores_gemma":[0.9998952,0.000022388596,0.000008913463,0.000027159116,0.000028951454,0.000017343618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026465487,0.00033999782,0.00056282873,0.00029629364,0.00031007885,0.00083482894,0.0013649942,0.0010225679,0.0036046973],"category_scores_gemma":[0.0003069361,0.00040152736,0.00045734053,0.00025803124,0.00022178362,0.0005810257,0.00091622164,0.0008619036,0.0026486686],"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.00014221163,0.00007257359,0.00043334416,0.00016358051,0.000028552447,0.00013375941,0.000044654833,0.029564766,0.822664,0.012993748,0.009928598,0.12383021],"study_design_scores_gemma":[0.00005373073,0.00011049198,0.00070445455,0.000026187865,0.00004998449,0.00081848487,0.000015723535,0.58396524,0.34785384,0.004567463,0.061780773,0.000053571508],"about_ca_topic_score_codex":0.0013317073,"about_ca_topic_score_gemma":0.002134301,"teacher_disagreement_score":0.0036046973,"about_ca_system_score_codex":0.0005995647,"about_ca_system_score_gemma":0.0005230368,"threshold_uncertainty_score":0.012058973},"labels":[],"label_agreement":null},{"id":"W1840193652","doi":"10.1007/978-3-642-21043-3_42","title":"Cross-Lingual Word Sense Disambiguation for Languages with Scarce Resources","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"York University","funders":"","keywords":"Computer science; Persian; Natural language processing; Artificial intelligence; Context (archaeology); Word (group theory); Meaning (existential); Word-sense disambiguation; Resource (disambiguation); SemEval; Linguistics; WordNet","score_opus":0.017577510790669167,"score_gpt":0.2883880051316756,"score_spread":0.27081049434100646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840193652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107076176,0.014129452,0.83112097,0.0017134261,0.0020502214,0.00021417222,0.007029885,0.0136694005,0.02299617],"genre_scores_gemma":[0.43604696,0.003809999,0.523636,0.00069337053,0.00034333838,0.00020768418,0.021619087,0.002449935,0.01119363],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803346,0.00044236446,0.0004300254,0.0005484982,0.0003436865,0.00020193539],"domain_scores_gemma":[0.9976445,0.0010870554,0.00015706931,0.0005047141,0.0004879345,0.00011869393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021994286,0.0013356826,0.001691242,0.0063707656,0.001993199,0.0039414866,0.0017602467,0.0012155911,0.006741445],"category_scores_gemma":[0.0047980007,0.0009686295,0.0015351526,0.00690153,0.0010965405,0.009110761,0.006347803,0.0014172212,0.0051455367],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005389009,0.00016335267,0.004849537,0.0016280314,0.00039063845,0.0015500361,0.0022625267,0.005165112,0.03804173,0.028722765,0.04881488,0.8678725],"study_design_scores_gemma":[0.00020156664,0.00033486824,0.01971807,0.000980112,0.00094942586,0.0074553317,0.013228843,0.22586441,0.13819143,0.31725317,0.27523136,0.0005913154],"about_ca_topic_score_codex":0.0025642859,"about_ca_topic_score_gemma":0.0072945077,"teacher_disagreement_score":0.006741445,"about_ca_system_score_codex":0.0005920203,"about_ca_system_score_gemma":0.0018185041,"threshold_uncertainty_score":0.022552371},"labels":[],"label_agreement":null},{"id":"W1840234796","doi":"10.1007/978-3-540-77537-9_14","title":"Point-Set Embedding of Trees with Edge Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Embedding; Combinatorics; Vertex (graph theory); Planar graph; Point (geometry); Planar; Mathematics; Set (abstract data type); Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.019341664457584812,"score_gpt":0.2525299114687582,"score_spread":0.23318824701117338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840234796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049537744,0.00040148728,0.93467396,0.0001538303,0.000079212994,0.000042069703,0.00039480603,0.0004115941,0.014305277],"genre_scores_gemma":[0.41022056,0.0011554599,0.5710636,0.00007796674,0.00009825559,0.00012737853,0.001147341,0.00055916613,0.01555039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955636,0.000079648555,0.000026138368,0.00006546852,0.00024023883,0.000032183536],"domain_scores_gemma":[0.99926585,0.0003131125,0.00006676998,0.00019347195,0.00010481087,0.00005594723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030920174,0.00063057936,0.0007675959,0.0011155747,0.00037043358,0.0013141255,0.0015548147,0.0008248098,0.004662376],"category_scores_gemma":[0.00221334,0.00064592774,0.00052856276,0.0015020903,0.0007107855,0.00243987,0.0025256863,0.002193164,0.0013683934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015974417,0.00009850127,0.0005098561,0.0003824242,0.000048818245,0.00023941047,0.00045548848,0.17888168,0.01501844,0.56398356,0.0087762885,0.23144577],"study_design_scores_gemma":[0.00002150557,0.000059320035,0.00028288047,0.00006093846,0.000021880678,0.00030431917,0.00009963601,0.5353281,0.0059126224,0.44123772,0.016644185,0.000026902582],"about_ca_topic_score_codex":0.0006378474,"about_ca_topic_score_gemma":0.0010110943,"teacher_disagreement_score":0.004662376,"about_ca_system_score_codex":0.00036938832,"about_ca_system_score_gemma":0.00023792911,"threshold_uncertainty_score":0.015597165},"labels":[],"label_agreement":null},{"id":"W184023512","doi":"10.1007/978-3-642-24728-6_22","title":"A Stochastic Optimization Method for Solving the Machine–Part Cell Formation Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Benchmark (surveying); Mathematical optimization; Set (abstract data type); Measure (data warehouse); Algorithm; Mathematics; Data mining","score_opus":0.016525701339420912,"score_gpt":0.22773775048121983,"score_spread":0.21121204914179892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184023512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018755979,0.00015702771,0.9959413,0.00008107483,0.000056810146,0.000028104669,0.000027160602,0.00006673939,0.001766301],"genre_scores_gemma":[0.20990427,0.0006021414,0.77582514,0.00027976645,0.0002509778,0.0006131767,0.0002954138,0.0002468117,0.011982318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.00020206273,0.000022228627,0.00007473698,0.00019450276,0.000049099457],"domain_scores_gemma":[0.9988495,0.00080475054,0.00006861829,0.00003850033,0.00018324911,0.000055338845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014844227,0.0008585664,0.0015742554,0.00054488436,0.00060326245,0.00077814795,0.0015734005,0.0018271542,0.0043497276],"category_scores_gemma":[0.0022084948,0.0007548922,0.0012821638,0.0009292977,0.0007798047,0.0006322474,0.0015368639,0.0015037188,0.0006037845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002957673,0.000029338838,0.000117346965,0.000053221363,0.000028502644,0.000028072474,0.000017439657,0.96423954,0.0009437599,0.0138960555,0.0010341952,0.019582937],"study_design_scores_gemma":[0.0000050299723,0.0000068924683,0.000018633356,0.0000024664678,0.0000024075357,0.000004581642,0.0000013166392,0.99766445,0.00007342479,0.0018789031,0.00033945095,0.0000024120839],"about_ca_topic_score_codex":0.008794899,"about_ca_topic_score_gemma":0.0074982857,"teacher_disagreement_score":0.008794899,"about_ca_system_score_codex":0.00087656156,"about_ca_system_score_gemma":0.0020167544,"threshold_uncertainty_score":0.017487407},"labels":[],"label_agreement":null},{"id":"W1840288141","doi":"10.1007/11783596_16","title":"Bimonadic Semantics for Basic Pattern Matching Calculi","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"McMaster University","funders":"","keywords":"Computer science; Semantics (computer science); Pattern matching; Programming language; Matching (statistics); Theoretical computer science; Mathematics","score_opus":0.020396917070602056,"score_gpt":0.24367094475764275,"score_spread":0.2232740276870407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840288141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029941915,0.0012730976,0.8415738,0.0007812722,0.00041778068,0.00013669561,0.0004165994,0.0011794574,0.12427926],"genre_scores_gemma":[0.4639008,0.000973994,0.50320965,0.0007458501,0.00031308047,0.0004314756,0.0007356382,0.0004136858,0.02927586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984219,0.00036569368,0.00019643118,0.00026617976,0.0005659601,0.00018388372],"domain_scores_gemma":[0.9993218,0.00022517312,0.00004525445,0.00017334789,0.00016993165,0.000064522406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016474245,0.00068401586,0.0007492651,0.0017630334,0.0021603422,0.004062566,0.002394633,0.0015455827,0.0074796355],"category_scores_gemma":[0.0022979337,0.00065135764,0.0010857029,0.0022505054,0.0031887416,0.0064465143,0.0031450416,0.0022471405,0.0014769905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011625299,0.000008581954,0.000020027574,0.000029392002,0.0000025101583,0.00001826544,0.00008936565,0.00021888918,0.0004566158,0.9914961,0.00040603962,0.007242485],"study_design_scores_gemma":[0.000010294297,0.0000075037588,0.000026144175,0.000014948017,0.000006595881,0.000060145398,0.000032706314,0.0025823107,0.0008526589,0.98429424,0.01210363,0.000008764813],"about_ca_topic_score_codex":0.00095120247,"about_ca_topic_score_gemma":0.0013896471,"teacher_disagreement_score":0.0074796355,"about_ca_system_score_codex":0.0015274006,"about_ca_system_score_gemma":0.001034903,"threshold_uncertainty_score":0.02502191},"labels":[],"label_agreement":null},{"id":"W1840306116","doi":"10.1007/978-3-540-74984-4_9","title":"Enhanced Use Case Map Traversal Semantics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Ottawa","funders":"","keywords":"Computer science; Tree traversal; Semantics (computer science); Notation; Programming language; Context (archaeology); TRACE (psycholinguistics); Set (abstract data type); Plug-in; Sequence diagram; Unified Modeling Language; Software","score_opus":0.05619144105051174,"score_gpt":0.29956427559241183,"score_spread":0.2433728345419001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840306116","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.008220867,0.00011918572,0.95888984,0.00029171654,0.000086710126,0.00017876939,0.00065451517,0.008584016,0.02297433],"genre_scores_gemma":[0.25093654,0.0005015937,0.7053677,0.00026318638,0.00009330203,0.0003313295,0.0026080129,0.0038498193,0.036048457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800414,0.00035506772,0.00018000719,0.00023877526,0.0010230092,0.00019897294],"domain_scores_gemma":[0.9978497,0.0005224412,0.000089973146,0.00080711767,0.0006516123,0.0000791464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014814205,0.0007634265,0.00057133095,0.0022007162,0.00091837865,0.003709101,0.0021593105,0.001197457,0.013190558],"category_scores_gemma":[0.004538895,0.00071315555,0.0009926212,0.0019771925,0.0011252124,0.0080563845,0.0035554222,0.0023372865,0.0038276277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019948132,0.00024173409,0.0009339013,0.00035564866,0.000053497442,0.0006194043,0.001576447,0.0077810306,0.014805686,0.6453123,0.020476384,0.3076445],"study_design_scores_gemma":[0.00005271822,0.00008457409,0.0006103212,0.00024377194,0.00016795057,0.0014286054,0.00057117105,0.1554061,0.038560484,0.48466787,0.31811327,0.000093167524],"about_ca_topic_score_codex":0.0033217159,"about_ca_topic_score_gemma":0.0058839717,"teacher_disagreement_score":0.013190558,"about_ca_system_score_codex":0.0008100353,"about_ca_system_score_gemma":0.0016299606,"threshold_uncertainty_score":0.04412687},"labels":[],"label_agreement":null},{"id":"W1840383617","doi":"10.1007/11669487_6","title":"Gray-Scale Thinning Algorithm Using Local Min/Max Operations","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"Concordia University","funders":"","keywords":"Dilation (metric space); Thinning; Salient; Computer science; Grayscale; Scale (ratio); Algorithm; Mathematical morphology; Image (mathematics); Artificial intelligence; Image processing; Mathematics; Geometry; Cartography; Geography; Forestry","score_opus":0.01690705746016663,"score_gpt":0.26297746651711207,"score_spread":0.24607040905694544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840383617","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.015000725,0.00032081266,0.97972053,0.00006922437,0.0000843362,0.00007353738,0.00005029345,0.0014644397,0.003216093],"genre_scores_gemma":[0.073294416,0.00035305618,0.9190702,0.000054514978,0.000053878368,0.00007949505,0.00016233684,0.00028886372,0.0066432636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.000023120934,0.00002907303,0.000065571214,0.0001652638,0.000027600814],"domain_scores_gemma":[0.9996706,0.00005854769,0.00003659107,0.00008465907,0.00012597021,0.000023648412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062686834,0.00074531947,0.0010158892,0.0011822601,0.0005256848,0.0010198676,0.0011805733,0.00058303005,0.005288413],"category_scores_gemma":[0.00068955106,0.00050955487,0.0007636073,0.0012970997,0.00046333217,0.001030166,0.00079142785,0.0008324447,0.0015384327],"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.00024218291,0.000098423334,0.00052864227,0.0001850619,0.000088941386,0.00015381271,0.00009764295,0.02641771,0.1483654,0.013608617,0.005358926,0.80485463],"study_design_scores_gemma":[0.00010291023,0.00024498272,0.0022730967,0.00004797652,0.00022146109,0.0012471059,0.000057539106,0.7556093,0.20535342,0.011373258,0.023374822,0.000094204566],"about_ca_topic_score_codex":0.00091670227,"about_ca_topic_score_gemma":0.0018657864,"teacher_disagreement_score":0.005288413,"about_ca_system_score_codex":0.00030492563,"about_ca_system_score_gemma":0.00095602474,"threshold_uncertainty_score":0.017691553},"labels":[],"label_agreement":null},{"id":"W184080503","doi":"10.1007/978-3-642-33515-0_6","title":"Nonlinear Sliding Mode Control Implementation of an Upper Limb Exoskeleton Robot to Provide Passive Rehabilitation Therapy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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":"McGill University; École de Technologie Supérieure","funders":"","keywords":"Exoskeleton; Rehabilitation; Physical medicine and rehabilitation; Computer science; Robustness (evolution); Spasticity; Powered exoskeleton; Robot; Simulation; Control theory (sociology); Medicine; Physical therapy; Control (management); Artificial intelligence","score_opus":0.014854484695790943,"score_gpt":0.31435599130917563,"score_spread":0.2995015066133847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184080503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08050024,0.00027968682,0.888346,0.00026330884,0.0002574498,0.00016990934,0.00006248726,0.0014209975,0.028699927],"genre_scores_gemma":[0.8891055,0.00015942368,0.08024697,0.0000760989,0.000024938701,0.00016743396,0.00006808417,0.00004014305,0.030111397],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992144,0.000011603034,0.0000056442695,0.000016376154,0.00003640218,0.000008575857],"domain_scores_gemma":[0.9999218,0.000017540444,0.000008360838,0.000010955488,0.000036923466,0.000004353281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016585049,0.0002889922,0.00021267676,0.00011415372,0.00025399847,0.00029191587,0.00047570578,0.00036308556,0.0047029075],"category_scores_gemma":[0.00018650688,0.0001429602,0.00018644288,0.00006677037,0.00016955183,0.00019533692,0.00021322965,0.00025189092,0.00060292706],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068645965,0.00026240697,0.0008607563,0.00063348823,0.00007636078,0.0005436545,0.00046280274,0.13920085,0.4952225,0.015482437,0.0039366134,0.3426317],"study_design_scores_gemma":[0.00008331976,0.0009785756,0.0023327197,0.00004517963,0.00005241863,0.00026487352,0.00006420107,0.8952951,0.08579994,0.0017781997,0.013276631,0.000028783832],"about_ca_topic_score_codex":0.0014877109,"about_ca_topic_score_gemma":0.0022143228,"teacher_disagreement_score":0.0047029075,"about_ca_system_score_codex":0.00015432216,"about_ca_system_score_gemma":0.00029293625,"threshold_uncertainty_score":0.015732765},"labels":[],"label_agreement":null},{"id":"W184084465","doi":"10.1007/978-3-642-38631-2_12","title":"Next-Generation DoS at the Higher Layers: A Study of SMTP Flooding","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Timeout; Denial-of-service attack; Computer science; Server; Computer network; Application layer DDoS attack; Callback; Flooding (psychology); Computer security; Operating system; The Internet","score_opus":0.057602195282266185,"score_gpt":0.24725444377049022,"score_spread":0.18965224848822404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184084465","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.51455903,0.020062832,0.3345909,0.0070246034,0.0006078163,0.00028154685,0.00028835595,0.0006016173,0.12198333],"genre_scores_gemma":[0.9773037,0.004411856,0.010031591,0.00024277654,0.0004176922,0.00004045361,0.00005730223,0.00012326217,0.007371406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992556,0.00026155275,0.000026457994,0.00008357376,0.00021114491,0.00016166655],"domain_scores_gemma":[0.9959915,0.0024619694,0.00039987836,0.0003807444,0.0005853735,0.00018055413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534245,0.00059728813,0.0009809518,0.0012115366,0.0011351272,0.0024734337,0.0015925597,0.0015607739,0.001936972],"category_scores_gemma":[0.0067549837,0.0004421738,0.0005564913,0.0015353017,0.0018707792,0.0047117546,0.0012732181,0.0017037871,0.00026693993],"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.00018198688,0.00022831187,0.005158695,0.00028319782,0.00007391194,0.0009677411,0.0015290168,0.1746483,0.006503467,0.7694979,0.008741775,0.032185677],"study_design_scores_gemma":[0.000024485966,0.00007875559,0.0020776126,0.00007576871,0.000054479715,0.00063437456,0.000731123,0.8179952,0.0017564555,0.1698485,0.00668419,0.00003901139],"about_ca_topic_score_codex":0.004552015,"about_ca_topic_score_gemma":0.0025281503,"teacher_disagreement_score":0.004552015,"about_ca_system_score_codex":0.0025696626,"about_ca_system_score_gemma":0.0009593538,"threshold_uncertainty_score":0.018644273},"labels":[],"label_agreement":null},{"id":"W1841070547","doi":"10.1007/11892755_86","title":"Document Mining Based on Semantic Understanding of Text","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Semantic similarity; Representation (politics); Information retrieval; Measure (data warehouse); Semantic computing; Similarity (geometry); Natural language processing; Similarity measure; Matching (statistics); Cluster analysis; Explicit semantic analysis; Semantic matching; Data mining; Artificial intelligence; Semantic technology; Semantic Web; Image (mathematics)","score_opus":0.025920840777231703,"score_gpt":0.24630791501138222,"score_spread":0.22038707423415052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841070547","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.028821034,0.0019925374,0.958085,0.00041097222,0.00018001511,0.00023726218,0.0017348535,0.005125575,0.00341277],"genre_scores_gemma":[0.11687323,0.001400552,0.8707542,0.00013341155,0.00021161552,0.00020168746,0.006436192,0.0003729258,0.0036161884],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886596,0.00017642742,0.00017144544,0.00030887825,0.00040243275,0.00007485976],"domain_scores_gemma":[0.99737954,0.001505071,0.00015141994,0.00026854535,0.00062967034,0.00006569154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010867118,0.0008210334,0.0012675915,0.006289562,0.0007657015,0.0023454286,0.0013947218,0.0008771402,0.0028636751],"category_scores_gemma":[0.0045680604,0.00040411204,0.001367951,0.005029664,0.00063266634,0.004395349,0.0010769228,0.0011242556,0.0021247095],"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.00034477614,0.00023085451,0.0021966374,0.0006184471,0.00013456432,0.00024642085,0.0004133514,0.0055523934,0.03559736,0.014891136,0.010506359,0.92926776],"study_design_scores_gemma":[0.00014035356,0.00036944964,0.004972304,0.00028714706,0.0005791167,0.0021452121,0.0007332677,0.7113154,0.10349065,0.12233484,0.053491674,0.00014055985],"about_ca_topic_score_codex":0.00153441,"about_ca_topic_score_gemma":0.0021378228,"teacher_disagreement_score":0.006289562,"about_ca_system_score_codex":0.000495221,"about_ca_system_score_gemma":0.001054263,"threshold_uncertainty_score":0.0095799565},"labels":[],"label_agreement":null},{"id":"W1841138106","doi":"10.1007/978-3-642-34103-8_17","title":"Imagery of Disabled People within Social Robotics Research","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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 Calgary","funders":"","keywords":"Robotics; Artificial intelligence; Field (mathematics); Narrative; Visibility; Computer science; Disabled people; Social robot; Robot; Norm (philosophy); Human–computer interaction; Psychology; Mobile robot; Political science; Applied psychology; Law; Robot control","score_opus":0.0971113546260147,"score_gpt":0.4072056384680078,"score_spread":0.3100942838419931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841138106","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.4847372,0.03285635,0.017931461,0.009509172,0.0004585083,0.00012874368,0.00048028256,0.0001515797,0.4537467],"genre_scores_gemma":[0.95473576,0.006554578,0.004685244,0.00044808473,0.00010831166,0.000056300665,0.00017914476,0.000030875355,0.03320165],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9997136,0.00013749376,0.000008347912,0.000036216716,0.00005289525,0.000051393155],"domain_scores_gemma":[0.99961865,0.00018945234,0.00004527264,0.000029415058,0.00003647298,0.0000807019],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00037524267,0.0003915148,0.00019208588,0.0010191193,0.0009971951,0.0015749114,0.00045736562,0.0006525609,0.009751402],"category_scores_gemma":[0.0013753513,0.00010800527,0.00010705822,0.0007908726,0.0027210552,0.0016288992,0.0015643016,0.000652084,0.00064829754],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042944076,0.0002564845,0.01605852,0.001371034,0.000029980883,0.0021590805,0.19262916,0.0006716758,0.010830944,0.18366912,0.03949956,0.5523951],"study_design_scores_gemma":[0.000037834547,0.00042181188,0.08984897,0.0017598936,0.000043026,0.01115535,0.32198796,0.0017921466,0.008276981,0.18203466,0.3825448,0.00009666772],"about_ca_topic_score_codex":0.0045084674,"about_ca_topic_score_gemma":0.0057335156,"teacher_disagreement_score":0.9990028,"about_ca_system_score_codex":0.0006622211,"about_ca_system_score_gemma":0.0005280876,"threshold_uncertainty_score":0.03262174},"labels":[],"label_agreement":null},{"id":"W1841195071","doi":"10.1007/978-3-540-76843-2_13","title":"Efficient Management of Grid Resources Using a Bi-level Decision-Making Architecture for “Processable” Bulk Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Partition (number theory); Computer science; Workload; Architecture; Distributed computing; Grid; Task (project management); Grid computing; Set (abstract data type); Integer programming; Resource (disambiguation); Algorithm; Engineering; Systems engineering; Operating system; Computer network; Mathematics","score_opus":0.0677722444926564,"score_gpt":0.3157162813702952,"score_spread":0.24794403687763883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841195071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047058802,0.00022326777,0.94337326,0.00057948875,0.00008156058,0.00017769233,0.00012179908,0.0028137807,0.0055703325],"genre_scores_gemma":[0.48236236,0.0001816852,0.5128997,0.00016531626,0.000043661894,0.00017600668,0.0003773749,0.00014273322,0.00365129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897456,0.00025478244,0.00009803646,0.00017547232,0.0003407337,0.0001564504],"domain_scores_gemma":[0.99890673,0.00041254715,0.00008234014,0.0002937067,0.00019836493,0.000106317435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530342,0.00064022146,0.0009297299,0.00048845087,0.001095847,0.0036555734,0.0027612203,0.000978522,0.0030681633],"category_scores_gemma":[0.002480688,0.0006928553,0.00065109384,0.0010786728,0.0008266714,0.002424589,0.0016283417,0.001816076,0.0008795982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008927035,0.00072332326,0.0029056217,0.00031353204,0.0002568197,0.00036549388,0.00056423846,0.5821453,0.041933827,0.05964035,0.010707513,0.29955134],"study_design_scores_gemma":[0.000024434663,0.000044911074,0.00018117296,0.000007087034,0.000023708672,0.000018743729,0.000027974753,0.9781196,0.005474475,0.01448958,0.0015726048,0.00001582062],"about_ca_topic_score_codex":0.005937077,"about_ca_topic_score_gemma":0.0074167545,"teacher_disagreement_score":0.005937077,"about_ca_system_score_codex":0.0010099857,"about_ca_system_score_gemma":0.0024207064,"threshold_uncertainty_score":0.011804998},"labels":[],"label_agreement":null},{"id":"W184123393","doi":"10.1007/978-3-540-25967-1_12","title":"Knowledge Sharing in Agile Software Teams","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":93,"is_retracted":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":"Agile software development; Computer science; Tacit knowledge; Knowledge management; Knowledge sharing; Context (archaeology); Software development; Process (computing); Knowledge transfer; Software development process; Software; Process management; Software engineering; Engineering","score_opus":0.018408413350624275,"score_gpt":0.26667701878623545,"score_spread":0.2482686054356112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184123393","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.40321812,0.0019494058,0.32679448,0.0033214753,0.00015494229,0.0001603623,0.000037230948,0.00016580538,0.2641981],"genre_scores_gemma":[0.97404796,0.0002641373,0.015283626,0.00003836205,0.000018573599,0.00006481642,0.000020096395,0.0000134465445,0.010249054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9962745,0.0022662592,0.00011290903,0.00023202674,0.000710749,0.00040356422],"domain_scores_gemma":[0.9924159,0.005244522,0.00046181201,0.0009071107,0.00045700933,0.0005136106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00330776,0.00029552178,0.00032431836,0.00068657997,0.0021454124,0.0037055009,0.0011963214,0.0015699898,0.004105084],"category_scores_gemma":[0.00832232,0.00040724725,0.00043935076,0.0012208556,0.0024806538,0.0065532573,0.0038694702,0.0012965557,0.0004362984],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021477975,0.0002877315,0.0042801807,0.00020994288,0.000059430855,0.0008497053,0.026111437,0.018023886,0.0019257223,0.6861273,0.0034788498,0.258431],"study_design_scores_gemma":[0.000060320424,0.00021814687,0.0027564862,0.00022572464,0.000038871844,0.00057093333,0.017719787,0.041033827,0.0023455347,0.90673214,0.028261108,0.000037121004],"about_ca_topic_score_codex":0.0012654148,"about_ca_topic_score_gemma":0.0011311247,"teacher_disagreement_score":0.004105084,"about_ca_system_score_codex":0.0011499646,"about_ca_system_score_gemma":0.0017901635,"threshold_uncertainty_score":0.017493308},"labels":[],"label_agreement":null},{"id":"W1841273994","doi":"10.1007/978-3-540-30139-4_93","title":"The Overlaying Roles of Cognitive and Information Theories in the Design of Information Access Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Computer science; Overlay; Human–computer interaction; Cognition; Interface design; Interface (matter); User interface; World Wide Web; Programming language","score_opus":0.03255633058168393,"score_gpt":0.33605323127323217,"score_spread":0.3034969006915482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841273994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026331356,0.004916266,0.8634148,0.008781543,0.00027518455,0.00010055973,0.000059734706,0.0002678472,0.09585271],"genre_scores_gemma":[0.61634797,0.005081428,0.36349276,0.0007203051,0.00029554748,0.00027885704,0.00011734717,0.000202498,0.01346338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953576,0.0027956343,0.00028324928,0.0002865015,0.0010563576,0.0002206257],"domain_scores_gemma":[0.9735373,0.023684641,0.0003913351,0.0012464103,0.0007922107,0.00034813784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00658711,0.0006812019,0.0005111315,0.0020303736,0.0013448764,0.00828816,0.0019730371,0.0018196789,0.008044073],"category_scores_gemma":[0.019998984,0.0010906283,0.0010175525,0.0013517167,0.009301946,0.01579824,0.0029274402,0.0036526097,0.0009443437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015951215,0.000027368713,0.0002538828,0.00011661709,0.000015410664,0.00004502988,0.0012502737,0.0034590682,0.0002665159,0.9665096,0.0007834952,0.027256668],"study_design_scores_gemma":[0.000013068553,0.000023871833,0.000108909546,0.000087701344,0.000021094702,0.00006845996,0.00041704864,0.01436311,0.00066070334,0.97435045,0.009873184,0.00001233779],"about_ca_topic_score_codex":0.0015094646,"about_ca_topic_score_gemma":0.0017018975,"teacher_disagreement_score":0.00828816,"about_ca_system_score_codex":0.0017803819,"about_ca_system_score_gemma":0.0021804029,"threshold_uncertainty_score":0.034836352},"labels":[],"label_agreement":null},{"id":"W1841391047","doi":"10.1007/978-3-540-74553-2_20","title":"Selection and Pruning Algorithms for Bitmap Index Selection Problem Using Data Mining","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université du Québec en Outaouais","funders":"","keywords":"Bitmap; Computer science; Data mining; Joins; Pruning; Join (topology); Data warehouse; Key (lock); Tuple; Dimension (graph theory); Search engine indexing; Selection (genetic algorithm); Information retrieval; Mathematics; Artificial intelligence","score_opus":0.07942153423394675,"score_gpt":0.3231942760796316,"score_spread":0.24377274184568481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841391047","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.031167703,0.0017915294,0.9624801,0.00045086915,0.00015830914,0.00020137626,0.00031179443,0.0014257377,0.0020127008],"genre_scores_gemma":[0.1090566,0.00088978023,0.88532007,0.00015430641,0.00015489734,0.0002180789,0.0008848106,0.0001573141,0.0031641107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860483,0.00031911186,0.0001315561,0.00017673727,0.00063731417,0.00013039571],"domain_scores_gemma":[0.996381,0.001826005,0.00022326375,0.0005532591,0.0008655901,0.00015094237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002080048,0.00093158404,0.0019912443,0.0033399328,0.0010399579,0.00161468,0.0025204255,0.0013803921,0.0025473516],"category_scores_gemma":[0.0063221543,0.0005212404,0.0008976399,0.0051969406,0.00050374906,0.0024246236,0.0011893276,0.0016701189,0.00075232406],"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.00039502225,0.00037988267,0.0025583105,0.000300751,0.00009680612,0.00017496556,0.00015579027,0.05697712,0.008185099,0.012160692,0.014948266,0.9036673],"study_design_scores_gemma":[0.00006755038,0.00011550894,0.0008594262,0.00004351156,0.00007303367,0.00028945078,0.00006310401,0.96744776,0.006348063,0.02093875,0.0037300189,0.000023853832],"about_ca_topic_score_codex":0.002283494,"about_ca_topic_score_gemma":0.0034729803,"teacher_disagreement_score":0.0033399328,"about_ca_system_score_codex":0.0006458844,"about_ca_system_score_gemma":0.0012879751,"threshold_uncertainty_score":0.011000514},"labels":[],"label_agreement":null},{"id":"W1841999836","doi":"10.1007/11564096_36","title":"Simple Test Strategies for Cost-Sensitive Decision Trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decision tree; Test (biology); Computer science; Simple (philosophy); Machine learning; Artificial intelligence; Decision tree learning; Total cost","score_opus":0.02663294647029125,"score_gpt":0.2935392305685823,"score_spread":0.26690628409829104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841999836","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.017142776,0.000711154,0.9768946,0.00032288855,0.00011674358,0.00040471496,0.00030563388,0.00085984706,0.0032416775],"genre_scores_gemma":[0.35026026,0.0004313962,0.64197886,0.0004174136,0.00027772348,0.00087983004,0.0011612268,0.00036825065,0.0042250496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943387,0.0027455993,0.00045312135,0.00053777423,0.0015549976,0.00036976833],"domain_scores_gemma":[0.96775204,0.02646532,0.0006420198,0.0026512784,0.0019927996,0.0004965468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008142585,0.0018421296,0.0023639705,0.0020560278,0.00073381164,0.002290528,0.004096897,0.002417212,0.008029135],"category_scores_gemma":[0.044103123,0.00090751983,0.001191932,0.0021495854,0.001130059,0.0048811142,0.0027883374,0.002683501,0.0016543934],"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.0011833723,0.0006549691,0.0021994978,0.00049855304,0.00024288785,0.00029019377,0.00021161108,0.16073525,0.0050413283,0.12206591,0.012877144,0.69399935],"study_design_scores_gemma":[0.00015344829,0.0003064729,0.00059364486,0.000071936505,0.00009461314,0.00017259369,0.000045485456,0.72993994,0.003009024,0.26310357,0.0024653075,0.00004392185],"about_ca_topic_score_codex":0.00078246766,"about_ca_topic_score_gemma":0.0013840424,"teacher_disagreement_score":0.008142585,"about_ca_system_score_codex":0.0011198283,"about_ca_system_score_gemma":0.0013909724,"threshold_uncertainty_score":0.043062627},"labels":[],"label_agreement":null},{"id":"W1842176639","doi":"10.1007/978-3-642-16321-0_35","title":"Succinct Representations of Dynamic Strings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":48,"is_retracted":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":"String (physics); Word (group theory); Alphabet; Rank (graph theory); Omega; Combinatorics; Space (punctuation); Sigma; Computer science; Mathematics; Discrete mathematics; Physics; Geometry; Mathematical physics; Quantum mechanics","score_opus":0.010552717314922765,"score_gpt":0.26190641631291556,"score_spread":0.2513536989979928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842176639","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.019787824,0.0016662541,0.93776214,0.00083887816,0.00055310153,0.00013688604,0.003496918,0.0038083747,0.03194966],"genre_scores_gemma":[0.347481,0.004648323,0.5674546,0.0007476293,0.00055961113,0.00069904374,0.016758366,0.0025614304,0.059089936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989994,0.00019098893,0.00010691237,0.00014578193,0.0004530027,0.00010389513],"domain_scores_gemma":[0.9976192,0.0009395079,0.00015393138,0.0008867818,0.00033679404,0.000063787054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006166353,0.0009876,0.000752575,0.0016150174,0.0005290045,0.0026937285,0.001576047,0.0012901722,0.020000651],"category_scores_gemma":[0.0050807837,0.0006014386,0.0005702676,0.0031483308,0.0010700276,0.0063984655,0.0023049673,0.0020571689,0.005714839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031849628,0.00008076189,0.00020658979,0.00042942274,0.000021011996,0.0003118894,0.00036993652,0.03176983,0.009450451,0.58728594,0.027016861,0.34273878],"study_design_scores_gemma":[0.000057534235,0.00009845177,0.0001728766,0.00030011308,0.00003297086,0.0006073376,0.00019218688,0.1205031,0.0180075,0.761883,0.098086916,0.000057897792],"about_ca_topic_score_codex":0.00045375584,"about_ca_topic_score_gemma":0.0007292065,"teacher_disagreement_score":0.020000651,"about_ca_system_score_codex":0.0006397945,"about_ca_system_score_gemma":0.00065082643,"threshold_uncertainty_score":0.066908896},"labels":[],"label_agreement":null},{"id":"W1842316007","doi":"10.1007/978-3-642-28368-0_28","title":"Dynamic Secure Cloud Storage with Provenance","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Cloud computing; Anonymity; Ciphertext; Computer security; Broadcast encryption; Cloud storage; Cryptography; Server; Scalability; Public-key cryptography; Computer network; Database; Operating system","score_opus":0.007655643334861957,"score_gpt":0.21668619705554076,"score_spread":0.2090305537206788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842316007","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.036039457,0.003959971,0.9083357,0.0023869763,0.0013267318,0.00028564947,0.0010326327,0.004255655,0.042377178],"genre_scores_gemma":[0.7705255,0.003558123,0.18588546,0.00031376586,0.0006199401,0.00018753763,0.0011676698,0.0007664509,0.036975555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869066,0.00015889898,0.00011154422,0.00015196396,0.0007040493,0.00018288603],"domain_scores_gemma":[0.996552,0.000566045,0.00014692363,0.002254312,0.00040614605,0.000074553485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014109651,0.0004553606,0.0006176923,0.00075523934,0.0011564018,0.0029136492,0.0013422583,0.00074222806,0.0051358775],"category_scores_gemma":[0.004710802,0.00047593185,0.0005229057,0.001730704,0.0013767626,0.008016119,0.0029603562,0.0017568894,0.0013408305],"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.00059155846,0.00009270989,0.0009177308,0.00038387408,0.000047275324,0.00043914653,0.00040054857,0.03275944,0.017815173,0.659801,0.021259865,0.2654917],"study_design_scores_gemma":[0.00010479079,0.00010282473,0.0003679634,0.00017193923,0.00007051569,0.00085540477,0.00018056734,0.1709824,0.044293776,0.6683957,0.114394955,0.00007913555],"about_ca_topic_score_codex":0.0010738581,"about_ca_topic_score_gemma":0.0012354961,"teacher_disagreement_score":0.0051358775,"about_ca_system_score_codex":0.0012017683,"about_ca_system_score_gemma":0.0016650622,"threshold_uncertainty_score":0.017181158},"labels":[],"label_agreement":null},{"id":"W184252680","doi":"10.1007/978-3-319-07455-9_42","title":"An Adaptive Questionnaire for Automatic Identification of Learning Styles","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Learning Styles and Cognitive Differences","field":"Psychology","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":"Université de Moncton","funders":"","keywords":"Learning styles; Computer science; Style (visual arts); Identification (biology); Artificial intelligence; Adaptive learning; Machine learning; Mathematics education; Psychology","score_opus":0.020184732948152977,"score_gpt":0.3045618652275867,"score_spread":0.28437713227943373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184252680","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.8506151,0.00034274402,0.118444055,0.00029229684,0.00038842487,0.0074909646,0.006720552,0.0037339018,0.011971913],"genre_scores_gemma":[0.76260054,0.00035269748,0.1956933,0.00071567256,0.0001513878,0.014503232,0.007380395,0.00044561632,0.01815727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983876,0.0005937673,0.00020885716,0.00027613167,0.00044594874,0.00008768942],"domain_scores_gemma":[0.98576015,0.011033079,0.0005889512,0.00073075684,0.001542041,0.00034504075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003028297,0.00059654086,0.0006079116,0.0010699114,0.0002116687,0.000562903,0.0007944616,0.0007766833,0.011188207],"category_scores_gemma":[0.012483154,0.00029797747,0.0004825194,0.0005290204,0.00018108731,0.0011512241,0.00087346963,0.0006749684,0.004096893],"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.002454757,0.003323773,0.17323656,0.00039223387,0.00016748441,0.00015221602,0.001142995,0.0013959478,0.023710594,0.0010035008,0.018093979,0.774926],"study_design_scores_gemma":[0.0010385896,0.004771632,0.92753285,0.00019310067,0.00017526135,0.0007993312,0.0011545164,0.031231795,0.012334123,0.0026101454,0.017997691,0.00016101394],"about_ca_topic_score_codex":0.0004333183,"about_ca_topic_score_gemma":0.0005878329,"teacher_disagreement_score":0.011188207,"about_ca_system_score_codex":0.00022029485,"about_ca_system_score_gemma":0.00027711477,"threshold_uncertainty_score":0.03742826},"labels":[],"label_agreement":null},{"id":"W1842689613","doi":"10.1007/978-3-642-13437-1_41","title":"The Online Deteriorating Patient: An Adaptive Simulation to Foster Expertise in Emergency Decision-Making","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation-Based Education in Healthcare","field":"Medicine","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":"McGill University","funders":"","keywords":"Computer science; Fidelity; Medical decision making; Human–computer interaction; Operations research; Multimedia; Simulation; Medical emergency; Medicine; Engineering","score_opus":0.044525597844335525,"score_gpt":0.37390374394432335,"score_spread":0.32937814609998783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842689613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3629695,0.0009944844,0.465944,0.006796204,0.00085648196,0.00040571205,0.00044855627,0.0019606769,0.15962441],"genre_scores_gemma":[0.8526089,0.00066626264,0.13118747,0.00065925065,0.00009998139,0.00018247293,0.00026668236,0.0001047741,0.014224098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.00011657979,0.00000652926,0.000022579792,0.000029834364,0.000019246923],"domain_scores_gemma":[0.9989072,0.0008040912,0.000037436475,0.000052259154,0.00004361663,0.00015551937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332009,0.0004882479,0.00017965914,0.00015082807,0.00029152818,0.0009297157,0.0009095333,0.0009514178,0.00678889],"category_scores_gemma":[0.0025333613,0.00014030555,0.00023425775,0.00013113843,0.00036392265,0.0008218447,0.0010715838,0.0012461921,0.00063982373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011060396,0.0029572044,0.012941866,0.0004518705,0.00013903102,0.0031212342,0.006168809,0.41995534,0.018115478,0.07387362,0.06001833,0.40115118],"study_design_scores_gemma":[0.00028241242,0.00090608816,0.004156048,0.000265214,0.00009610022,0.0019306722,0.001617023,0.8230535,0.009901325,0.080238454,0.077458955,0.000094262614],"about_ca_topic_score_codex":0.00072121766,"about_ca_topic_score_gemma":0.0013526151,"teacher_disagreement_score":0.00678889,"about_ca_system_score_codex":0.00027163772,"about_ca_system_score_gemma":0.00072591344,"threshold_uncertainty_score":0.022711039},"labels":[],"label_agreement":null},{"id":"W1842747459","doi":"10.1007/978-3-642-39320-4_11","title":"Determining Points on Handwritten Mathematical Symbols","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Western University","funders":"","keywords":"Handwriting; Computer science; Variety (cybernetics); Diagram; Simple (philosophy); Baseline (sea); Scale (ratio); Artificial intelligence; Pattern recognition (psychology); Natural language processing; Mathematics; Geography; Cartography","score_opus":0.021306751936100744,"score_gpt":0.25835828361839874,"score_spread":0.237051531682298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842747459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06933306,0.0006676527,0.9031434,0.00010993637,0.00023784174,0.00020469555,0.0003478187,0.0030871124,0.022868432],"genre_scores_gemma":[0.154559,0.00076237746,0.82298386,0.000039289604,0.00008996328,0.00006789347,0.0008532178,0.0006881105,0.019956214],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993699,0.00005748209,0.00004100662,0.0001794604,0.00027793727,0.00007421927],"domain_scores_gemma":[0.9989435,0.00035353826,0.00007248972,0.00017586157,0.00040455585,0.000050015682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032788332,0.0010014748,0.0013031748,0.0017157577,0.0006645531,0.001847412,0.0020989378,0.0009980506,0.016952904],"category_scores_gemma":[0.0025209025,0.00073836837,0.000793942,0.0018724139,0.0009151067,0.0021666454,0.0014374289,0.00140173,0.010947128],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025686718,0.0000420441,0.0008052242,0.00042255115,0.000028527518,0.00026897434,0.00031508697,0.010968498,0.069823556,0.020762308,0.0064669875,0.88983953],"study_design_scores_gemma":[0.00012239083,0.00063791906,0.0050581763,0.00035213583,0.00013058017,0.0016392868,0.0013743498,0.3756193,0.37099817,0.14495337,0.09897122,0.00014313142],"about_ca_topic_score_codex":0.0014326418,"about_ca_topic_score_gemma":0.0018468801,"teacher_disagreement_score":0.016952904,"about_ca_system_score_codex":0.00045579943,"about_ca_system_score_gemma":0.0006006927,"threshold_uncertainty_score":0.056713104},"labels":[],"label_agreement":null},{"id":"W1842824552","doi":"10.1007/978-3-642-02017-9_47","title":"The Two-Guard Polygon Walk Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Visibility polygon; Guard (computer science); Computer science; Boundary (topology); Visibility; Point (geometry); Computer graphics (images); Regular polygon; Mathematics; Geometry; Physics; Optics; Mathematical analysis","score_opus":0.012368779486296963,"score_gpt":0.24459299905053153,"score_spread":0.23222421956423456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842824552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13395621,0.0014924236,0.77284324,0.0027511667,0.0006607496,0.00017099032,0.0009718871,0.0006246674,0.08652868],"genre_scores_gemma":[0.68351847,0.0016968487,0.23727739,0.00053596654,0.00031728754,0.00024235464,0.0019619637,0.00054007233,0.07390968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996631,0.0000854479,0.000013734155,0.00008970112,0.00007802418,0.0000699419],"domain_scores_gemma":[0.9994635,0.0002639148,0.000043982152,0.00008427481,0.000036527883,0.00010780649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034755448,0.0006493485,0.0011778977,0.00047467076,0.00082851015,0.0016222232,0.0015296552,0.0023875022,0.014255577],"category_scores_gemma":[0.0024174121,0.00051385583,0.0006615461,0.00092611834,0.00110266,0.0026700026,0.0020510373,0.002171775,0.0018867933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000410609,0.00019451478,0.00053648587,0.00039863496,0.00004727769,0.000536699,0.00024061764,0.11958772,0.0028577032,0.7247204,0.029080493,0.12138877],"study_design_scores_gemma":[0.00013092092,0.000056185017,0.00022734348,0.000049071477,0.000016519545,0.0002180369,0.00016089028,0.30106604,0.0012264178,0.6807186,0.016106654,0.000023445065],"about_ca_topic_score_codex":0.0013043812,"about_ca_topic_score_gemma":0.0011615958,"teacher_disagreement_score":0.014255577,"about_ca_system_score_codex":0.00041040423,"about_ca_system_score_gemma":0.0006035146,"threshold_uncertainty_score":0.047689676},"labels":[],"label_agreement":null},{"id":"W1842879116","doi":"10.1007/978-3-540-24677-0_111","title":"Boosting with Data Generation: Improving the Classification of Hard to Learn Examples","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Boosting (machine learning); Computer science; Artificial intelligence; Machine learning; Training set; Artificial neural network; Decision tree; Ensemble learning; Gradient boosting; Data mining; Pattern recognition (psychology); Algorithm; Random forest","score_opus":0.06730520912970453,"score_gpt":0.2824679243042869,"score_spread":0.21516271517458238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842879116","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.028899081,0.0019594098,0.96184874,0.00037033178,0.0003256568,0.00010949512,0.0001468843,0.00265632,0.0036840723],"genre_scores_gemma":[0.36004075,0.0011401955,0.6281054,0.00068338535,0.0005574491,0.00021576165,0.00092435925,0.0006387669,0.007694012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983668,0.0006597677,0.000066429355,0.00022745167,0.00057388394,0.00010576416],"domain_scores_gemma":[0.99586415,0.002280832,0.00014729457,0.00079073437,0.0007902165,0.00012674405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003762437,0.0010946039,0.0020773662,0.0011965978,0.00035437942,0.0010297985,0.0024101266,0.0014425569,0.0029052706],"category_scores_gemma":[0.009562031,0.0006159977,0.0010192833,0.001252347,0.0007195823,0.0014994021,0.0017573645,0.002085464,0.0017378987],"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.00036731857,0.00021532184,0.0017313826,0.00020438645,0.00009577656,0.000096443735,0.00009241123,0.07352691,0.00797034,0.0086610345,0.020894337,0.8861443],"study_design_scores_gemma":[0.000057788035,0.00010353095,0.00044433065,0.00002963497,0.000056126915,0.00012598807,0.000010264531,0.96885824,0.0061244313,0.019782405,0.004394569,0.000012798241],"about_ca_topic_score_codex":0.00068836234,"about_ca_topic_score_gemma":0.00090704917,"teacher_disagreement_score":0.003762437,"about_ca_system_score_codex":0.00032760302,"about_ca_system_score_gemma":0.00055652816,"threshold_uncertainty_score":0.019897938},"labels":[],"label_agreement":null},{"id":"W1842941715","doi":"10.1007/3-540-70659-3_30","title":"A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Matching (statistics); Blossom algorithm; Graph; Image retrieval; Algorithm; 3-dimensional matching; Image (mathematics); Content-based image retrieval; Process (computing); Optimal matching; Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Mathematics; Bipartite graph","score_opus":0.014888319704092864,"score_gpt":0.23069296074358528,"score_spread":0.21580464103949243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842941715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015295417,0.000252275,0.99513346,0.00009721237,0.00013679925,0.0001204024,0.00010150567,0.001851608,0.00077713025],"genre_scores_gemma":[0.011383813,0.0002450755,0.9848043,0.00009766596,0.000101942336,0.00017841003,0.00033446844,0.00032338154,0.0025310102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982223,0.00020933183,0.00013448825,0.0005557988,0.0007647404,0.00011333927],"domain_scores_gemma":[0.99832135,0.0005005111,0.00009785834,0.00041037085,0.00057645317,0.00009349452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816651,0.0016616983,0.002570774,0.0052931835,0.0015885744,0.0023554,0.0037417677,0.002800614,0.009752318],"category_scores_gemma":[0.004660734,0.0011133177,0.0016627555,0.00749758,0.0012641792,0.0042650397,0.0033847017,0.0023897078,0.006241531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001902133,0.00017845808,0.00028675178,0.0002363604,0.00013084855,0.000118724965,0.00007545186,0.0190499,0.026271943,0.014332935,0.014385286,0.9247432],"study_design_scores_gemma":[0.00019352583,0.00022705093,0.000889143,0.000046582558,0.00018840982,0.001160741,0.00009761819,0.8674878,0.035545792,0.061142832,0.032912496,0.00010804554],"about_ca_topic_score_codex":0.0053305896,"about_ca_topic_score_gemma":0.007110066,"teacher_disagreement_score":0.009752318,"about_ca_system_score_codex":0.0011282262,"about_ca_system_score_gemma":0.0015525565,"threshold_uncertainty_score":0.03262472},"labels":[],"label_agreement":null},{"id":"W1843172357","doi":"10.1007/978-3-540-73078-1_41","title":"Conceptualizing Student Models for ICALL","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Perspective (graphical); Language acquisition; Representation (politics); Language model; Artificial intelligence; Second-language acquisition; Natural language processing; Human–computer interaction; Linguistics; Mathematics education; Psychology","score_opus":0.04332132384124821,"score_gpt":0.3269412944556134,"score_spread":0.28361997061436517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843172357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015577675,0.0002576504,0.840805,0.0037581432,0.0001231788,0.00013704396,0.0006299962,0.0017666009,0.13694473],"genre_scores_gemma":[0.6838124,0.0004517801,0.2620934,0.00077490916,0.00017707399,0.00043608167,0.0024314055,0.00066861894,0.04915438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862075,0.00056799303,0.00007628352,0.0002607952,0.00027771806,0.0001963744],"domain_scores_gemma":[0.99709237,0.0013214,0.00021385877,0.00052517635,0.00055405236,0.0002931981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018965472,0.00073895475,0.00033646185,0.0012831661,0.0014613221,0.005911313,0.0020280078,0.0020826457,0.014410665],"category_scores_gemma":[0.0065760855,0.0005292912,0.0012239272,0.0011566988,0.0025267643,0.01068827,0.0028200115,0.0030304529,0.0035158058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018386505,0.000033170756,0.00082176976,0.00003264301,0.000008928205,0.00007084801,0.0014746516,0.0065384125,0.00021474948,0.97007006,0.0050181854,0.015698168],"study_design_scores_gemma":[0.000018179364,0.000023299484,0.00029500466,0.00008217484,0.000028110899,0.00016702389,0.001260156,0.10975766,0.0011253515,0.82089484,0.06632332,0.00002487219],"about_ca_topic_score_codex":0.0070857955,"about_ca_topic_score_gemma":0.009761297,"teacher_disagreement_score":0.014410665,"about_ca_system_score_codex":0.0028853607,"about_ca_system_score_gemma":0.0019545793,"threshold_uncertainty_score":0.048208535},"labels":[],"label_agreement":null},{"id":"W1843400138","doi":"10.1007/978-3-540-72586-2_35","title":"On the Virtues of Generic Programming for Symbolic Computation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Univariate; Polynomial; Axiom; Code (set theory); Computation; Factorization; Computer science; Symbolic computation; Mathematics; Discrete mathematics; Algorithm; Programming language","score_opus":0.030276800820531462,"score_gpt":0.26897273839723057,"score_spread":0.2386959375766991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843400138","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.017127683,0.0060234577,0.77881914,0.01030818,0.0006648971,0.000079456004,0.00023220727,0.0014265922,0.18531841],"genre_scores_gemma":[0.6612921,0.005933954,0.3009047,0.002929719,0.0019543464,0.00029757613,0.0004269986,0.0012143056,0.025046393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972389,0.0011010654,0.00015347802,0.0004168491,0.0008150263,0.00027466926],"domain_scores_gemma":[0.9935314,0.003961775,0.00020137963,0.0017804236,0.00036451928,0.0001604669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034520782,0.0009813771,0.0015925446,0.0013985417,0.0026100893,0.005594765,0.002380873,0.0028078745,0.0066874577],"category_scores_gemma":[0.011299015,0.001014747,0.0020301058,0.0025619052,0.017445829,0.01575719,0.0045053335,0.007924344,0.0016453328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063495254,0.00000299629,0.000021241012,0.000016079373,0.0000021989251,0.0000066389566,0.00004484295,0.0005520503,0.000048429392,0.9954502,0.0007104201,0.0031385017],"study_design_scores_gemma":[0.000003835175,0.000002359241,0.0000113497435,0.000007013853,0.0000021848793,0.000010775975,0.00000781153,0.0013295354,0.00006009474,0.9958497,0.00271249,0.0000027727933],"about_ca_topic_score_codex":0.0013908168,"about_ca_topic_score_gemma":0.0011995478,"teacher_disagreement_score":0.0066874577,"about_ca_system_score_codex":0.0020316483,"about_ca_system_score_gemma":0.0011886678,"threshold_uncertainty_score":0.022371769},"labels":[],"label_agreement":null},{"id":"W1843409908","doi":"10.1007/978-3-642-15763-9_50","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Simon Fraser University","funders":"","keywords":"Computer science; Adversarial system; Adversary; Consensus; Value (mathematics); Process (computing); State (computer science); Logarithm; Uniform consensus; Simple (philosophy); Consensus algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Multi-agent system; Artificial intelligence; Computer security; Mathematics; Machine learning","score_opus":0.013088301947167983,"score_gpt":0.24329490561744938,"score_spread":0.2302066036702814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843409908","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011442398,0.075968266,0.22888555,0.19870315,0.25058874,0.00018075608,0.0011464771,0.0017166759,0.23136798],"genre_scores_gemma":[0.2592849,0.047865983,0.03497541,0.03056682,0.13262771,0.00027972463,0.001397226,0.0006971262,0.4923051],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992735,0.0002634151,0.000032895703,0.00014847497,0.00020322787,0.00007849656],"domain_scores_gemma":[0.99849224,0.00086718687,0.000048113936,0.00011626579,0.00030570294,0.00017048635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012910486,0.00070440664,0.0006218828,0.0005607907,0.0008548366,0.0022093314,0.0011469803,0.0031972514,0.021516336],"category_scores_gemma":[0.004709215,0.0004522016,0.00060618087,0.00095705997,0.0012169826,0.003582654,0.0008249364,0.0035362744,0.0066792816],"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.00034936308,0.00006067529,0.000106097985,0.00051353336,0.000048182475,0.00021431627,0.00014525682,0.004420604,0.002087159,0.2787995,0.6003033,0.11295202],"study_design_scores_gemma":[0.00014030084,0.00021069936,0.0002331183,0.0001613007,0.000066182845,0.0003177769,0.00010162017,0.013744835,0.0028378544,0.36171332,0.62038124,0.00009175952],"about_ca_topic_score_codex":0.0007215573,"about_ca_topic_score_gemma":0.00086431537,"teacher_disagreement_score":0.021516336,"about_ca_system_score_codex":0.0009596453,"about_ca_system_score_gemma":0.000709779,"threshold_uncertainty_score":0.071979284},"labels":[],"label_agreement":null},{"id":"W1843575755","doi":"10.1007/11566465_16","title":"3D Curve Inference for Diffusion MRI Regularization","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Diffusion MRI; Voxel; Regularization (linguistics); Inference; Imaging phantom; Artificial intelligence; Computer science; Mathematics; Algorithm; Physics; Magnetic resonance imaging; Medicine; Radiology; Optics","score_opus":0.03428829711341734,"score_gpt":0.34748213446659865,"score_spread":0.3131938373531813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843575755","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.0010348905,0.00018591176,0.99785006,0.00013246521,0.00002295709,0.000014839043,0.00006301396,0.0005141281,0.00018177075],"genre_scores_gemma":[0.06173178,0.00066737505,0.93238366,0.0001948883,0.00013366199,0.00018871666,0.0006395311,0.0008273035,0.0032330817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.00033986743,0.000048987164,0.00018880876,0.00023712593,0.000052762058],"domain_scores_gemma":[0.9960157,0.002394211,0.00026267255,0.00071345846,0.00047753289,0.00013637074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025706517,0.0011807571,0.0020956665,0.0017328713,0.0008168607,0.0016631213,0.0030903956,0.003995706,0.005148557],"category_scores_gemma":[0.0122968415,0.0020892275,0.002128013,0.0018178981,0.001432227,0.0021925713,0.0026608584,0.0041625663,0.0022772625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025439452,0.0001001534,0.00079253066,0.000391436,0.00021509475,0.00012046004,0.0001337352,0.5460291,0.009432448,0.07084965,0.013730504,0.3579505],"study_design_scores_gemma":[0.0000096182175,0.000008878827,0.000056904348,0.000010818674,0.000007558509,0.000021902393,0.0000038601847,0.9706288,0.0008617966,0.026975527,0.0014043075,0.000009960063],"about_ca_topic_score_codex":0.010066852,"about_ca_topic_score_gemma":0.010205995,"teacher_disagreement_score":0.010066852,"about_ca_system_score_codex":0.0012832481,"about_ca_system_score_gemma":0.0025258558,"threshold_uncertainty_score":0.020016551},"labels":[],"label_agreement":null},{"id":"W1843628981","doi":"10.1007/11564751_60","title":"Extending Systematic Local Search for Job Shop Scheduling Problems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Guided Local Search; Tabu search; Hill climbing; Local search (optimization); Local optimum; Beam search; Constructive; Computer science; Iterated local search; Search algorithm; Mathematical optimization; Iterative deepening depth-first search; Best-first search; Depth-first search; Incremental heuristic search; Backtracking; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.021738206307159457,"score_gpt":0.25079875532159956,"score_spread":0.22906054901444012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843628981","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.010210706,0.0005145468,0.9840954,0.000080213795,0.000038797363,0.00006295939,0.000043299922,0.0006102824,0.0043438193],"genre_scores_gemma":[0.21471825,0.00095903705,0.7783497,0.00017567766,0.00010298258,0.00031665465,0.00025229543,0.00051102205,0.0046143313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990978,0.0004996496,0.000043855754,0.00006830585,0.00024243216,0.00004792182],"domain_scores_gemma":[0.99817836,0.0012237022,0.00007547862,0.00029108362,0.00019038605,0.000041038344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016821497,0.0007504459,0.0015919071,0.0008418109,0.0003883559,0.0005718308,0.0011186476,0.00069835386,0.0031278636],"category_scores_gemma":[0.004211235,0.00064428436,0.0011710157,0.0014322958,0.0007863029,0.0012063001,0.0022810998,0.001133542,0.0009125042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011285298,0.00016943872,0.0006552426,0.00048840226,0.00008995261,0.000113386544,0.00019484188,0.67373466,0.005225266,0.061171923,0.0034666366,0.25457734],"study_design_scores_gemma":[0.000042191263,0.00007595427,0.0001084577,0.000033959845,0.000024899067,0.00003839496,0.000018168972,0.93975645,0.0007824912,0.05470883,0.004400498,0.000009677928],"about_ca_topic_score_codex":0.0017584874,"about_ca_topic_score_gemma":0.0027433308,"teacher_disagreement_score":0.0031278636,"about_ca_system_score_codex":0.0004637425,"about_ca_system_score_gemma":0.00084428996,"threshold_uncertainty_score":0.010463774},"labels":[],"label_agreement":null},{"id":"W1844089452","doi":"10.1007/978-3-642-41062-8_32","title":"PFMFind: A System for Discovery of Peptide Homology and Function","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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 Ottawa","funders":"National Institutes of Health","keywords":"Python (programming language); Computer science; Plug-in; Homology (biology); Nearest neighbor search; Computational biology; Information retrieval; Data mining; Artificial intelligence; Programming language; Biology; Amino acid; Genetics","score_opus":0.00486217806822931,"score_gpt":0.2246060796678768,"score_spread":0.2197439015996475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844089452","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027235601,0.0014729016,0.4295865,0.0003403721,0.00042366562,0.00031125083,0.04256049,0.49066722,0.0074019316],"genre_scores_gemma":[0.12249007,0.0013514931,0.7032912,0.0006079034,0.00016895484,0.0015029892,0.12600842,0.035051495,0.009527541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00009625078,0.000071104136,0.00024808553,0.0002016221,0.0000713701],"domain_scores_gemma":[0.998928,0.00055322587,0.00010295566,0.00022257029,0.000112730864,0.00008037381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042927,0.0025209745,0.0016068293,0.0031058989,0.0012466273,0.0018002755,0.002823111,0.0017614521,0.028826889],"category_scores_gemma":[0.0045315777,0.0011556129,0.0018782484,0.0016729749,0.0004378352,0.002611153,0.0024030611,0.0019020867,0.014263679],"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.0047534234,0.00046489463,0.011074402,0.0041330513,0.0011000053,0.001795165,0.0005640934,0.008330378,0.11968176,0.015652653,0.39570835,0.43674174],"study_design_scores_gemma":[0.001379087,0.00073690707,0.008882102,0.00046617995,0.0007501316,0.0057488265,0.00022739249,0.2972874,0.23940209,0.0466639,0.39794144,0.0005145304],"about_ca_topic_score_codex":0.00083709875,"about_ca_topic_score_gemma":0.0010558487,"teacher_disagreement_score":0.028826889,"about_ca_system_score_codex":0.0006371427,"about_ca_system_score_gemma":0.001106175,"threshold_uncertainty_score":0.09643555},"labels":[],"label_agreement":null},{"id":"W1844128133","doi":"10.1007/978-3-540-74960-8_8","title":"Evolution of Tandemly Arrayed Genes in Multiple Species","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Genome; Gene duplication; Computer science; Gene; Tandem repeat; Cluster (spacecraft); Computational biology; Tandem exon duplication; Evolutionary biology; Biology; Genetics","score_opus":0.021166589576194796,"score_gpt":0.23917021410800543,"score_spread":0.21800362453181063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844128133","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.9125273,0.0014484617,0.07502661,0.00048578894,0.00012654068,0.000029457282,0.00017444835,0.0003242764,0.0098571405],"genre_scores_gemma":[0.9220868,0.00073905184,0.0701674,0.00033653888,0.000051999563,0.000039775263,0.0003339358,0.00012467813,0.0061198627],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996817,0.000052872234,0.00001840607,0.00013980604,0.00006130994,0.00004606007],"domain_scores_gemma":[0.99932003,0.0003492536,0.00009272045,0.00008940605,0.00006807215,0.00008057314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066334254,0.00026251824,0.0004592451,0.00069968414,0.0007179504,0.0008434263,0.0009837319,0.0012162124,0.0027931784],"category_scores_gemma":[0.0016583384,0.0004265948,0.0006649313,0.0012241098,0.00087451143,0.0012432662,0.0009382711,0.0014016405,0.0007053894],"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.00068188267,0.00015500732,0.017466396,0.00036819067,0.00025554706,0.002677366,0.0013616711,0.038181655,0.6713986,0.110723175,0.0014971569,0.15523343],"study_design_scores_gemma":[0.00046130456,0.0013714741,0.077200934,0.00041891928,0.0008583898,0.017546365,0.0021030433,0.29784238,0.21326683,0.30276895,0.085752584,0.00040881167],"about_ca_topic_score_codex":0.00040604267,"about_ca_topic_score_gemma":0.00094096945,"teacher_disagreement_score":0.0027931784,"about_ca_system_score_codex":0.00071734784,"about_ca_system_score_gemma":0.00029592944,"threshold_uncertainty_score":0.009344161},"labels":[],"label_agreement":null},{"id":"W1844422116","doi":"10.1007/978-3-540-85988-8_81","title":"Cardiac Electrophysiology Model Adjustment Using the Fusion of MR and Optical Imaging","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Cardiac electrophysiology; Computer science; Electrophysiology; Orientation (vector space); Artificial intelligence; Optical mapping; Optical imaging; Computer vision; Biomedical engineering; Pattern recognition (psychology); Cardiology; Medicine; Physics; Optics; Internal medicine","score_opus":0.01917832604519975,"score_gpt":0.3045493115831054,"score_spread":0.28537098553790563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844422116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074720853,0.00012544543,0.99078745,0.00010651138,0.000058209724,0.000014890913,0.000048526057,0.000758831,0.00062799215],"genre_scores_gemma":[0.45127118,0.0006327846,0.543351,0.0002195646,0.00018630145,0.000081276994,0.00045284443,0.0005344821,0.0032706356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997383,0.000050605442,0.0000145458735,0.000085691725,0.000084685074,0.000026129192],"domain_scores_gemma":[0.9994875,0.00016903329,0.00008608268,0.000071629736,0.00016048117,0.000025264299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056544214,0.00065095705,0.0005740911,0.0007318199,0.00027285688,0.0009981571,0.0005699022,0.000592191,0.0014353783],"category_scores_gemma":[0.0031548908,0.00048082697,0.0007090063,0.0005107231,0.00021304087,0.0009661977,0.0006341844,0.0009144882,0.0008438303],"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.0003227813,0.00013565106,0.003682207,0.00020317335,0.00021612059,0.00019909734,0.00015829373,0.2983113,0.06428209,0.0041984445,0.006219503,0.6220714],"study_design_scores_gemma":[0.000018075269,0.00004199705,0.0020777157,0.00001415664,0.00005160472,0.0002135483,0.00002051017,0.9809018,0.0109883435,0.002815811,0.0028274965,0.000029036182],"about_ca_topic_score_codex":0.0036062354,"about_ca_topic_score_gemma":0.005360509,"teacher_disagreement_score":0.0036062354,"about_ca_system_score_codex":0.0003116915,"about_ca_system_score_gemma":0.0007026289,"threshold_uncertainty_score":0.0071704984},"labels":[],"label_agreement":null},{"id":"W1844546726","doi":"10.1007/978-3-642-22300-6_49","title":"Planar Subgraphs without Low-Degree Nodes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Combinatorics; Degree (music); Planar graph; Unit disk graph; Embedding; Mathematics; Planar; Graph; Book embedding; Unit (ring theory); Discrete mathematics; Integer (computer science); Line graph; Computer science; Physics; 1-planar graph","score_opus":0.03057628276226043,"score_gpt":0.24229707503983758,"score_spread":0.21172079227757715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844546726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14563993,0.0020188373,0.5411479,0.0011373372,0.00032449706,0.000369408,0.0027333824,0.0017905628,0.30483815],"genre_scores_gemma":[0.50514734,0.0038209234,0.27562636,0.0005070627,0.00018962931,0.0003482562,0.005629408,0.0011519784,0.20757903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998522,0.00002118301,0.0000069500775,0.00004577468,0.000047994246,0.000025949117],"domain_scores_gemma":[0.9996525,0.000103124206,0.000035329373,0.00011654108,0.000060237522,0.00003232731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000947299,0.0005650168,0.00041140095,0.00072592346,0.00054320577,0.000841,0.0009604375,0.00045514468,0.01566753],"category_scores_gemma":[0.00070781563,0.0004996003,0.0004263174,0.0009959808,0.00047996745,0.0015474637,0.00091134245,0.0008730594,0.0044257175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015309636,0.000083744795,0.0007639072,0.0012201222,0.00006461756,0.00059635175,0.00038813122,0.022521323,0.046735514,0.6726679,0.034430664,0.22037469],"study_design_scores_gemma":[0.00006029815,0.000106764935,0.0019001858,0.00016552089,0.00012799262,0.00204267,0.0002883646,0.04263588,0.03819251,0.7470595,0.16738868,0.00003162208],"about_ca_topic_score_codex":0.00061597564,"about_ca_topic_score_gemma":0.0013389584,"teacher_disagreement_score":0.01566753,"about_ca_system_score_codex":0.00035862086,"about_ca_system_score_gemma":0.00023422536,"threshold_uncertainty_score":0.052413106},"labels":[],"label_agreement":null},{"id":"W1844822759","doi":"10.1007/978-3-540-24840-8_16","title":"Sequential Consolidation of Learned Task Knowledge","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Acadia University","funders":"","keywords":"Computer science; Domain knowledge; Task (project management); Knowledge transfer; Artificial intelligence; Artificial neural network; Machine learning; Multi-task learning; Consolidation (business); Knowledge management","score_opus":0.03235171012310735,"score_gpt":0.2822765319773342,"score_spread":0.24992482185422688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844822759","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2893132,0.004016553,0.67163336,0.0013489316,0.001079451,0.00040514945,0.0011722543,0.0051172357,0.025913842],"genre_scores_gemma":[0.9230693,0.0011499064,0.055434905,0.00043004818,0.00021703745,0.00019430858,0.0024287798,0.0004729083,0.016602835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915195,0.00012659743,0.00005461789,0.00039674324,0.00016738052,0.00010271009],"domain_scores_gemma":[0.9947625,0.0023290243,0.00025465013,0.0014757746,0.0008219478,0.0003561788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012446406,0.0008627019,0.0011409036,0.00069318415,0.00042113147,0.0022737526,0.0019819848,0.0009992893,0.0071607814],"category_scores_gemma":[0.011715342,0.0008438649,0.00071944046,0.0010824038,0.0006868476,0.0050788755,0.00268842,0.0032048542,0.002684189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007970712,0.00077011227,0.0048495834,0.00047083927,0.00033381433,0.0002573781,0.00057895936,0.027136937,0.07786047,0.014636312,0.009710324,0.8625981],"study_design_scores_gemma":[0.0001226125,0.0009002125,0.030952275,0.00023553873,0.00045906892,0.00065115816,0.00058850745,0.7111587,0.08213892,0.1561096,0.016510956,0.00017253068],"about_ca_topic_score_codex":0.002252998,"about_ca_topic_score_gemma":0.0026612657,"teacher_disagreement_score":0.0071607814,"about_ca_system_score_codex":0.00063210074,"about_ca_system_score_gemma":0.001122892,"threshold_uncertainty_score":0.023955226},"labels":[],"label_agreement":null},{"id":"W1844882231","doi":"10.1007/978-3-540-72606-7_71","title":"Reinforcement Learning-Based Load Shared Sequential Routing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Learning automata; Reinforcement learning; Static routing; Distributed computing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Link-state routing protocol; Dynamic Source Routing; Blocking (statistics); Artificial intelligence; Automaton; Computer network; Routing protocol","score_opus":0.10729862514666907,"score_gpt":0.39573778242917695,"score_spread":0.2884391572825079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844882231","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.04556249,0.00025595815,0.9459722,0.0002848196,0.00013543188,0.000085457694,0.000056063127,0.0013119783,0.0063355933],"genre_scores_gemma":[0.9217363,0.00009340254,0.07270938,0.000120035125,0.000057983227,0.00009410862,0.00007735179,0.0001181613,0.0049932143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922633,0.00021245323,0.000037274167,0.00015033442,0.00019916627,0.00017448932],"domain_scores_gemma":[0.99756634,0.0013472629,0.0001980689,0.00027066667,0.0004419298,0.00017573338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015432686,0.0008018604,0.0015687504,0.0005696127,0.0006971981,0.0010593503,0.0024745127,0.00091274333,0.00456534],"category_scores_gemma":[0.0040137838,0.00052154803,0.00038762152,0.00065712584,0.0009396023,0.0012747719,0.0014258545,0.0012973103,0.00056228606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019253328,0.00010005771,0.0002678996,0.000029838298,0.000021147993,0.000025097534,0.000032430955,0.93814903,0.0012680158,0.005276889,0.0015973455,0.05303971],"study_design_scores_gemma":[0.000007900977,0.000013950449,0.000023143819,0.000001191224,0.000002479064,0.0000044031162,0.0000023416353,0.9980094,0.00014965398,0.0017018482,0.00008191772,0.0000018150906],"about_ca_topic_score_codex":0.0064478857,"about_ca_topic_score_gemma":0.0074924426,"teacher_disagreement_score":0.0064478857,"about_ca_system_score_codex":0.0014509285,"about_ca_system_score_gemma":0.0015677746,"threshold_uncertainty_score":0.015272558},"labels":[],"label_agreement":null},{"id":"W1845185439","doi":"10.1007/11561354_6","title":"Randomized AB-Face-AB Routing Algorithms in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Concordia University","funders":"","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Static routing; Algorithm; Optimized Link State Routing Protocol; Computer network; Multipath routing; Distributed computing; Routing (electronic design automation); Routing protocol","score_opus":0.01128650629168062,"score_gpt":0.2407008591141244,"score_spread":0.22941435282244377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845185439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024056759,0.0016532625,0.95789737,0.0016851645,0.0006908093,0.00046723508,0.00030723738,0.0019123361,0.011329865],"genre_scores_gemma":[0.28542668,0.0011714348,0.69684875,0.0010278655,0.00068387337,0.0010781125,0.0008079735,0.0005058393,0.012449527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418145,0.0028392943,0.00026092687,0.00074271136,0.0012669171,0.00070857845],"domain_scores_gemma":[0.98688054,0.007990552,0.0005457116,0.002706462,0.001387831,0.00048880867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047549605,0.0016734359,0.0025572353,0.0018236015,0.0029088212,0.0027196554,0.0058113025,0.0026398331,0.008989489],"category_scores_gemma":[0.018082716,0.0011668035,0.001272321,0.0032418962,0.00219855,0.0063711456,0.00462362,0.003682284,0.0022359586],"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.0024668686,0.00075938465,0.0011940715,0.0005279973,0.00017924477,0.000107590204,0.00027633127,0.36695778,0.004724721,0.18259822,0.04290485,0.39730296],"study_design_scores_gemma":[0.00031515807,0.0002609363,0.00021135034,0.00004617903,0.000052672316,0.000118328186,0.000078809724,0.87623733,0.0016342984,0.116028704,0.004978431,0.000037831967],"about_ca_topic_score_codex":0.003582186,"about_ca_topic_score_gemma":0.005131871,"teacher_disagreement_score":0.008989489,"about_ca_system_score_codex":0.0029274016,"about_ca_system_score_gemma":0.0042127324,"threshold_uncertainty_score":0.030072808},"labels":[],"label_agreement":null},{"id":"W1845231118","doi":"10.1007/978-3-540-28629-5_57","title":"Efficient View Point Selection for Silhouettes of Convex Polyhedra","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Silhouette; Polyhedron; Regular polygon; Computer science; Combinatorics; Convex polytope; Set (abstract data type); Point (geometry); Artificial intelligence; Algorithm; Computer vision; Mathematics; Convex set; Convex optimization; Geometry","score_opus":0.013926749587646807,"score_gpt":0.248661362414653,"score_spread":0.2347346128270062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845231118","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.011194887,0.00019478513,0.98559463,0.000046268877,0.000031867166,0.000084820815,0.00017425892,0.001268931,0.0014094897],"genre_scores_gemma":[0.15804914,0.00046747655,0.8356174,0.00005714022,0.00006439304,0.00013490919,0.0012093729,0.0011449126,0.0032552301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864644,0.00020140817,0.00004297058,0.00020112717,0.0007641957,0.00014385526],"domain_scores_gemma":[0.9984541,0.00063911563,0.00009557307,0.00029250045,0.00039116203,0.0001275552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438117,0.0015034246,0.002517629,0.0019546472,0.0005015396,0.0019634191,0.0019355393,0.0014026973,0.010718277],"category_scores_gemma":[0.0039831456,0.0012934566,0.0013542436,0.001992761,0.0005193828,0.0014836427,0.0025166185,0.0020657915,0.004914223],"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.00067379413,0.00012628274,0.0011292347,0.0005116856,0.000105782994,0.00041834018,0.00033039585,0.08483848,0.1085704,0.0155849485,0.01417963,0.7735311],"study_design_scores_gemma":[0.00004292844,0.00010601874,0.00048737557,0.00003750979,0.000018487042,0.0003118484,0.0001093541,0.95591444,0.02969076,0.0085153775,0.004737965,0.00002786901],"about_ca_topic_score_codex":0.0014219906,"about_ca_topic_score_gemma":0.0026949432,"teacher_disagreement_score":0.010718277,"about_ca_system_score_codex":0.00045498554,"about_ca_system_score_gemma":0.00047197047,"threshold_uncertainty_score":0.035856247},"labels":[],"label_agreement":null},{"id":"W1845267493","doi":"10.1007/978-3-642-14600-8_44","title":"Modelling English Spatial Preposition Detectors","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Categorization, perception, and language","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Detector; Artificial intelligence; Computer vision; Image (mathematics); Algorithm; Telecommunications","score_opus":0.013731408170101938,"score_gpt":0.2549376811786855,"score_spread":0.24120627300858355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845267493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17093977,0.0013612013,0.8070277,0.00084490667,0.0001484539,0.000055348675,0.0010579005,0.0017415138,0.01682322],"genre_scores_gemma":[0.87949854,0.0006948463,0.0999605,0.00011512268,0.0000605069,0.00007603972,0.00095355127,0.0004077808,0.018233195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.00004850633,0.000011261245,0.00006581095,0.00003202919,0.00003813214],"domain_scores_gemma":[0.9986546,0.0010143771,0.000058882863,0.000076403616,0.00014838415,0.000047286147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068697234,0.000691301,0.0011880555,0.0005866734,0.00044885202,0.0024695941,0.0018222391,0.0015868797,0.008601491],"category_scores_gemma":[0.0035180734,0.0012578951,0.0011883678,0.00093041314,0.0006820295,0.0032504345,0.0009613127,0.0010732522,0.0011280107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024136997,0.0000747678,0.0018451937,0.00017167171,0.00007786233,0.0003824205,0.00027446513,0.7944243,0.0050165476,0.15015689,0.0035916963,0.04374282],"study_design_scores_gemma":[0.0000070422057,0.000006761884,0.000093210874,0.000005485731,0.0000073003525,0.000030457993,0.000016812466,0.9780573,0.0005125701,0.020838259,0.0004196356,0.0000050976582],"about_ca_topic_score_codex":0.018728908,"about_ca_topic_score_gemma":0.023923129,"teacher_disagreement_score":0.018728908,"about_ca_system_score_codex":0.0013810095,"about_ca_system_score_gemma":0.0007394743,"threshold_uncertainty_score":0.03723979},"labels":[],"label_agreement":null},{"id":"W1845278523","doi":"10.1007/3-540-70659-3_58","title":"Document Classification Using Phrases","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural language processing; Computer science; Artificial intelligence; Grammar; Classifier (UML); Naive Bayes classifier; Bayes classifier; Pattern recognition (psychology); Linguistics; Support vector machine","score_opus":0.04930136608321829,"score_gpt":0.27855149538897356,"score_spread":0.22925012930575528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845278523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019356057,0.007537655,0.9186376,0.0009195436,0.0015411293,0.0009769253,0.010059494,0.013921842,0.02704974],"genre_scores_gemma":[0.10386794,0.0051341755,0.81796163,0.00048384522,0.0010124808,0.0009200961,0.024390593,0.0009229488,0.04530628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986066,0.00022342213,0.00020201321,0.0003943276,0.0004724678,0.000101139085],"domain_scores_gemma":[0.99824095,0.00066894037,0.000106544474,0.0003291172,0.00058126,0.00007315889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011158352,0.0015671335,0.001395004,0.007907696,0.0011687519,0.0031831039,0.0011582435,0.0009448968,0.019407429],"category_scores_gemma":[0.0038997207,0.00043625827,0.001729714,0.007909016,0.0005759639,0.0035148119,0.0014917374,0.001376796,0.023780394],"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.00015458,0.00009363759,0.000960238,0.00052913796,0.00009963811,0.00012008785,0.00009508795,0.0012571298,0.02114435,0.0070304554,0.029954424,0.93856114],"study_design_scores_gemma":[0.00017676673,0.0012505391,0.007917932,0.0009073509,0.0010934768,0.0033326694,0.00072888436,0.24553941,0.1847755,0.10017081,0.45385513,0.0002514735],"about_ca_topic_score_codex":0.0011270688,"about_ca_topic_score_gemma":0.0013489833,"teacher_disagreement_score":0.019407429,"about_ca_system_score_codex":0.00058929896,"about_ca_system_score_gemma":0.0009869726,"threshold_uncertainty_score":0.0649243},"labels":[],"label_agreement":null},{"id":"W1845283042","doi":"10.1007/3-540-47922-8_37","title":"Relaxed Unification — Proposal","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unification; Computer science; Imperfect; Theoretical computer science; Algorithm; Programming language; Philosophy","score_opus":0.023128428102131494,"score_gpt":0.24094282860117214,"score_spread":0.21781440049904063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845283042","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.033488877,0.0034015898,0.77340144,0.016349936,0.00574791,0.0004304813,0.0006693393,0.0029846153,0.16352583],"genre_scores_gemma":[0.4850596,0.0021675183,0.39638975,0.0073760655,0.0058243317,0.001319234,0.0028032372,0.002162068,0.09689815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922111,0.0025284747,0.00041512086,0.0022692415,0.0014565006,0.0011195646],"domain_scores_gemma":[0.9921131,0.0021075353,0.00019825017,0.004119713,0.0009773406,0.00048405217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073270113,0.0010698207,0.0018477091,0.0027514452,0.0042120023,0.0049970727,0.0058773924,0.0052047144,0.019910993],"category_scores_gemma":[0.01662469,0.0013715893,0.0027251136,0.0037852074,0.0071445853,0.021950793,0.010943989,0.008689186,0.005884066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008699984,0.000033534583,0.000099253986,0.00007974734,0.000020435431,0.00004944632,0.0002679252,0.00053128635,0.0004511562,0.96764874,0.00675853,0.023972778],"study_design_scores_gemma":[0.00004756806,0.000024969262,0.00011849354,0.00005539842,0.000040044906,0.00011430384,0.00012450911,0.0047153146,0.0010655051,0.96862453,0.025038222,0.00003118284],"about_ca_topic_score_codex":0.0016369527,"about_ca_topic_score_gemma":0.0010313548,"teacher_disagreement_score":0.019910993,"about_ca_system_score_codex":0.0016840189,"about_ca_system_score_gemma":0.0026734434,"threshold_uncertainty_score":0.066608906},"labels":[],"label_agreement":null},{"id":"W1845490991","doi":"10.1007/11901433_25","title":"Conditions for Avoiding Controllability Problems in Distributed Testing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Windsor","funders":"","keywords":"Controllability; Computer science; Finite-state machine; Context (archaeology); Sequence (biology); Distributed computing; Conformance testing; Test (biology); State (computer science); Architecture; Test case; System under test; Algorithm; Machine learning; Operating system; Mathematics","score_opus":0.032157442413021396,"score_gpt":0.2695266468818414,"score_spread":0.23736920446882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845490991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03423592,0.00039698408,0.9527533,0.00066853757,0.00022121878,0.00028633382,0.000239916,0.002132859,0.009065005],"genre_scores_gemma":[0.71393263,0.00049622095,0.27639693,0.0006033836,0.0007308427,0.0010835455,0.00087335764,0.000743434,0.0051396056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924509,0.001865923,0.000743246,0.0013725717,0.0021850257,0.0013823307],"domain_scores_gemma":[0.8714038,0.105557956,0.0047843447,0.007601301,0.006968404,0.0036841156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008285954,0.0021954034,0.0025312833,0.0028265319,0.0017012957,0.002765095,0.0037426618,0.0035880902,0.007219259],"category_scores_gemma":[0.059219588,0.0015018035,0.002713478,0.0018532648,0.0057815784,0.010087391,0.0058758827,0.00766827,0.0011597129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003413986,0.00080824486,0.0037382918,0.0013341327,0.00022314982,0.0017306784,0.0010234199,0.109415784,0.02958487,0.719881,0.010142716,0.118703745],"study_design_scores_gemma":[0.0006844092,0.00056842196,0.0008589108,0.00017882083,0.00019499745,0.0006086565,0.00016341121,0.20289446,0.017651806,0.7724737,0.0035921882,0.00013008487],"about_ca_topic_score_codex":0.0009982664,"about_ca_topic_score_gemma":0.00096905045,"teacher_disagreement_score":0.008285954,"about_ca_system_score_codex":0.0010256466,"about_ca_system_score_gemma":0.0019710718,"threshold_uncertainty_score":0.043820858},"labels":[],"label_agreement":null},{"id":"W1845560990","doi":"10.1007/978-3-642-13881-2_8","title":"Towards Approximating COSMIC Functional Size from User Requirements in Agile Development Processes Using Text Mining","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"Concordia University","funders":"","keywords":"Agile software development; Computer science; User story; Granularity; Scrum; Software; User requirements document; Software engineering; Function point; Functional requirement; Software development; COSMIC cancer database; Requirements analysis; Data mining; Programming language","score_opus":0.04357323396090906,"score_gpt":0.2753789324966259,"score_spread":0.2318056985357168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845560990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21789709,0.000482287,0.7761799,0.00016585985,0.000028834656,0.000103305676,0.0011472955,0.0018990191,0.0020964372],"genre_scores_gemma":[0.6203736,0.00026147312,0.37484097,0.00005170183,0.00002906207,0.00022480238,0.0030739638,0.00025005164,0.0008942929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829537,0.00062173913,0.00018238263,0.00030668618,0.0005043186,0.000089455534],"domain_scores_gemma":[0.97993374,0.015964681,0.0012952238,0.0011333,0.0015004297,0.00017266176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020425238,0.00086391566,0.0007202956,0.0033731195,0.00040765604,0.001418162,0.0011731085,0.00093770714,0.0009428895],"category_scores_gemma":[0.020347975,0.00051186694,0.0010371647,0.0026952839,0.00041136096,0.0022857157,0.0009659712,0.0012184253,0.00061447953],"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.00038933242,0.0003258983,0.050905947,0.00045045622,0.00015436271,0.00032363326,0.00073053775,0.32906055,0.012010854,0.009492406,0.0027857816,0.59337026],"study_design_scores_gemma":[0.0000059224617,0.000032842734,0.0044275983,0.000029436893,0.000018044762,0.000053342483,0.000088827815,0.98601496,0.0023200384,0.0063379332,0.00066138303,0.000009671735],"about_ca_topic_score_codex":0.005689194,"about_ca_topic_score_gemma":0.005667618,"teacher_disagreement_score":0.005689194,"about_ca_system_score_codex":0.0008539553,"about_ca_system_score_gemma":0.0008884595,"threshold_uncertainty_score":0.011312187},"labels":[],"label_agreement":null},{"id":"W1845934457","doi":"10.1007/3-540-46016-0_33","title":"Automated Case Generation from Databases Using Similarity-Based Rough Approximation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Computer science; Data mining; Rough set; Similarity (geometry); Domain (mathematical analysis); Bottleneck; Database; Process (computing); Artificial neural network; Case-based reasoning; Set (abstract data type); Artificial intelligence; Machine learning; Image (mathematics)","score_opus":0.0799861234815601,"score_gpt":0.28131716931719786,"score_spread":0.20133104583563777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845934457","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.027306749,0.00033811215,0.96667653,0.00020678928,0.000037563143,0.00055653456,0.00033447673,0.0020203302,0.0025228974],"genre_scores_gemma":[0.1437023,0.00025945614,0.8534899,0.000050227547,0.000029080566,0.0002652928,0.001187473,0.0001172838,0.00089899014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972596,0.0006093712,0.00028759977,0.000370653,0.0013279292,0.00014480401],"domain_scores_gemma":[0.9953708,0.002864216,0.00020337963,0.0007265975,0.0007342655,0.00010075994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020824107,0.0009741315,0.0019242668,0.0046542753,0.0007560033,0.0027134109,0.0025051094,0.0011822704,0.005545669],"category_scores_gemma":[0.010611602,0.00089979696,0.001967094,0.0029823382,0.00066507934,0.002514021,0.0022991858,0.0010108848,0.0013329352],"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.00042076304,0.000301785,0.001718533,0.00048620216,0.00013799737,0.0009878781,0.00042195796,0.10794038,0.014192253,0.017202433,0.0071072336,0.84908265],"study_design_scores_gemma":[0.0000940538,0.00010652215,0.00065305206,0.000058304064,0.0000929498,0.00073713897,0.0002170761,0.94084954,0.012230315,0.040502213,0.0044194646,0.00003933506],"about_ca_topic_score_codex":0.001738257,"about_ca_topic_score_gemma":0.001976595,"teacher_disagreement_score":0.005545669,"about_ca_system_score_codex":0.00068958657,"about_ca_system_score_gemma":0.0011291959,"threshold_uncertainty_score":0.018552125},"labels":[],"label_agreement":null},{"id":"W1846028828","doi":"10.1007/11579427_10","title":"Domain and Competences Ontologies and Their Maintenance for an Intelligent Dissemination of Documents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université du Québec à Montréal","funders":"","keywords":"Ontology; Computer science; Relevance (law); Domain (mathematical analysis); Relation (database); World Wide Web; Knowledge management; Service (business); Domain knowledge; Information retrieval; Database","score_opus":0.01890286308716695,"score_gpt":0.27623776499094965,"score_spread":0.2573349019037827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846028828","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.017791545,0.0011507226,0.9564242,0.003241004,0.00014552548,0.00018095331,0.00051004335,0.0015694794,0.018986596],"genre_scores_gemma":[0.22097209,0.0017172871,0.7612466,0.0002569077,0.00012572888,0.0001835767,0.001777642,0.0005604679,0.013159684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729663,0.00074709975,0.00038236717,0.00046493954,0.00096943363,0.00013962433],"domain_scores_gemma":[0.99450964,0.0015425491,0.00040675089,0.001997099,0.0012889378,0.00025508946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059744935,0.00028699797,0.0004541804,0.003800401,0.001593941,0.005336461,0.0016561064,0.0011834042,0.0032492203],"category_scores_gemma":[0.017541438,0.0007250047,0.00093093986,0.0030784602,0.0021419944,0.010979215,0.0033044806,0.0021942535,0.001395016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058116522,0.000094443145,0.0014937364,0.00019534002,0.000045410878,0.0002502023,0.0030283085,0.006134238,0.007030581,0.6355701,0.012117687,0.33398187],"study_design_scores_gemma":[0.000034106622,0.000046904166,0.0031635417,0.00034210717,0.0002087808,0.0010095257,0.002048009,0.09627643,0.0156293,0.61683077,0.2643087,0.00010179608],"about_ca_topic_score_codex":0.008303522,"about_ca_topic_score_gemma":0.005308951,"teacher_disagreement_score":0.008303522,"about_ca_system_score_codex":0.0017175219,"about_ca_system_score_gemma":0.0035728032,"threshold_uncertainty_score":0.03159648},"labels":[],"label_agreement":null},{"id":"W1846157972","doi":"10.1007/978-3-642-11970-5_8","title":"Practical Extensions to the IFDS Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":60,"is_retracted":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":"Dataflow; Computer science; Extension (predicate logic); Algorithm; Subroutine; Context (archaeology); Data-flow analysis; Distributive property; Class (philosophy); Epigraph; Theoretical computer science; Programming language; Data flow diagram; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.030973902325689917,"score_gpt":0.2869987577958471,"score_spread":0.2560248554701572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846157972","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.012204481,0.00085393805,0.9158187,0.0014521604,0.00073943415,0.00011079186,0.0004754624,0.0028605945,0.06548443],"genre_scores_gemma":[0.16128328,0.0009401467,0.7877626,0.0007018532,0.0006342469,0.00027683077,0.0015013532,0.001361813,0.045537997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972958,0.0009856509,0.0001809151,0.00046849545,0.00075525575,0.00031387567],"domain_scores_gemma":[0.9955947,0.0015133951,0.000114794246,0.0020077259,0.0005879677,0.00018144245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002906818,0.0011312708,0.0011708227,0.0016678061,0.0014490017,0.0031093766,0.002992826,0.001377261,0.03409435],"category_scores_gemma":[0.009691382,0.00071369944,0.0015469232,0.0020262077,0.0021919236,0.0066321976,0.0048511126,0.0033747803,0.007785298],"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.0004991003,0.00013546739,0.0005013482,0.00020931737,0.000037077625,0.00008422905,0.00018632862,0.013661092,0.0014324394,0.5948111,0.03185784,0.3565847],"study_design_scores_gemma":[0.0001821799,0.000065826,0.00016852822,0.00010321287,0.000034065448,0.00023686235,0.00009147755,0.08831584,0.0030174097,0.80980825,0.097944126,0.00003222761],"about_ca_topic_score_codex":0.0015456966,"about_ca_topic_score_gemma":0.002746735,"teacher_disagreement_score":0.03409435,"about_ca_system_score_codex":0.0015960041,"about_ca_system_score_gemma":0.0014489479,"threshold_uncertainty_score":0.114057004},"labels":[],"label_agreement":null},{"id":"W1846160651","doi":"10.1007/978-3-540-77255-2_4","title":"Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Relevance feedback; Content-based image retrieval; Relevance (law); Image retrieval; Computer science; Graph; Information retrieval; Pattern recognition (psychology); Selection (genetic algorithm); Artificial intelligence; Image (mathematics); Theoretical computer science","score_opus":0.03771364657798523,"score_gpt":0.26443958622745733,"score_spread":0.2267259396494721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846160651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006942537,0.003041004,0.98769534,0.00024909232,0.000100706515,0.0001398433,0.00013900787,0.00084018486,0.00085224013],"genre_scores_gemma":[0.13455853,0.002183879,0.8555552,0.00019971553,0.00037996517,0.00034495507,0.00093318353,0.00035600155,0.005488562],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974348,0.0010862541,0.00012215138,0.00042583697,0.0008000145,0.00013107529],"domain_scores_gemma":[0.9953951,0.0032141227,0.00021217439,0.00037667478,0.000709367,0.00009259626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024299498,0.0010762188,0.0026733482,0.0036267168,0.0007567234,0.0014215892,0.0027721636,0.0027892299,0.0025892796],"category_scores_gemma":[0.008104629,0.0010352421,0.0010605792,0.00459491,0.0015324828,0.0026769673,0.0012363348,0.0019433143,0.0010283774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006592328,0.00024854246,0.00043391908,0.000710468,0.00014232103,0.00015392962,0.00018189427,0.19356902,0.010508487,0.032872643,0.016157271,0.74436224],"study_design_scores_gemma":[0.000050380793,0.000099897065,0.0003244258,0.000032820506,0.00005274623,0.00011205527,0.000032354008,0.9368215,0.0037844763,0.055810396,0.0028545577,0.000024349878],"about_ca_topic_score_codex":0.0115318885,"about_ca_topic_score_gemma":0.0087163225,"teacher_disagreement_score":0.0115318885,"about_ca_system_score_codex":0.0014068319,"about_ca_system_score_gemma":0.0009804155,"threshold_uncertainty_score":0.02292955},"labels":[],"label_agreement":null},{"id":"W1846199910","doi":"10.1007/11847465_5","title":"An Efficient Algorithm for Inference in Rough Set Flow Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Correctness; Inference; Time complexity; Algorithm; Rough set; Theoretical computer science; Set (abstract data type); Computational complexity theory; Artificial intelligence","score_opus":0.019223565094754817,"score_gpt":0.2616903689357371,"score_spread":0.2424668038409823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846199910","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.0011987585,0.00005712451,0.9970611,0.00004676505,0.000021018179,0.00007252562,0.000087855486,0.0009908574,0.00046399952],"genre_scores_gemma":[0.017958378,0.000073421266,0.9805571,0.000042178413,0.000021946074,0.00013199203,0.0003313368,0.00013127584,0.00075241184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.0003828295,0.00013788683,0.0005108008,0.0005319163,0.00014963892],"domain_scores_gemma":[0.9971046,0.0018335036,0.00010978174,0.0004671051,0.00041470845,0.0000702713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002292327,0.0014853744,0.0024628723,0.0033990568,0.0015525143,0.0034309165,0.00320947,0.0021921166,0.008607877],"category_scores_gemma":[0.009060297,0.001372121,0.0027940618,0.0033308784,0.0011663496,0.0053754253,0.0031501362,0.0027212026,0.002482318],"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.00021566753,0.000176574,0.00044979845,0.00030673502,0.00012620751,0.000110205045,0.0002645823,0.11094787,0.003507455,0.082228586,0.009282254,0.79238415],"study_design_scores_gemma":[0.00007367205,0.000042063748,0.00018694688,0.000041407504,0.00006718211,0.00006865085,0.000061733605,0.8357515,0.0021823596,0.15737312,0.0041234433,0.00002804239],"about_ca_topic_score_codex":0.0058972156,"about_ca_topic_score_gemma":0.006414312,"teacher_disagreement_score":0.008607877,"about_ca_system_score_codex":0.0017817807,"about_ca_system_score_gemma":0.0024905375,"threshold_uncertainty_score":0.028796196},"labels":[],"label_agreement":null},{"id":"W1846299526","doi":"10.1007/978-3-642-33509-9_56","title":"Design and Performance Evaluation of a Rotary Series Elastic Actuator","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prosthetics and Rehabilitation Robotics","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":"Queen's University","funders":"","keywords":"Computer science; Actuator; Series (stratigraphy); Rotary actuator; Artificial intelligence; Geology","score_opus":0.018642744947025874,"score_gpt":0.22549052476741277,"score_spread":0.2068477798203869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846299526","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.6994864,0.0016494461,0.2815803,0.00030306578,0.00014991853,0.00038842153,0.00025495217,0.0012477548,0.0149397915],"genre_scores_gemma":[0.95388186,0.00030476335,0.03964794,0.000030127665,0.000015570875,0.00011274072,0.00011362442,0.000046530837,0.005846804],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957174,0.00007430141,0.000032857763,0.00005970508,0.00022567084,0.000035710975],"domain_scores_gemma":[0.9994074,0.00015705946,0.000096419055,0.00008020696,0.00021207306,0.00004683176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006450699,0.00043199625,0.00045664553,0.00034292156,0.00049671443,0.00039562234,0.0007612682,0.0006386382,0.0030281863],"category_scores_gemma":[0.000785524,0.00026320168,0.00030502075,0.00021541577,0.00024953543,0.00041923727,0.00042000547,0.00024937015,0.0005977842],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011262074,0.00021221377,0.0015048719,0.0007420931,0.00005251452,0.0002504568,0.00019623402,0.041368004,0.86763835,0.0012714855,0.0007464384,0.08489098],"study_design_scores_gemma":[0.0002289102,0.009596369,0.012456126,0.000099194,0.0001961692,0.0010831534,0.00024592146,0.35835603,0.5990189,0.000485298,0.01813041,0.00010356653],"about_ca_topic_score_codex":0.0007155658,"about_ca_topic_score_gemma":0.0006080191,"teacher_disagreement_score":0.0030281863,"about_ca_system_score_codex":0.00023545597,"about_ca_system_score_gemma":0.00047644,"threshold_uncertainty_score":0.010130286},"labels":[],"label_agreement":null},{"id":"W1846902312","doi":"10.1007/11532378_14","title":"The Use of Traces for Inlining in Java Programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Java; TRACE (psycholinguistics); Programming language; Operating system; Overhead (engineering); Just-in-time compilation; Code (set theory); Virtual machine; Parallel computing","score_opus":0.0715089159885698,"score_gpt":0.29134742622707543,"score_spread":0.21983851023850565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846902312","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.040945612,0.000982704,0.940825,0.00043720196,0.00013448422,0.000058784586,0.00013243106,0.008338129,0.008145663],"genre_scores_gemma":[0.7013487,0.0010782714,0.28521886,0.00020545915,0.00008717983,0.000098554425,0.0002482869,0.0036077984,0.008106932],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99796593,0.0008884666,0.00015785873,0.00027802153,0.00057217263,0.00013755112],"domain_scores_gemma":[0.97189474,0.020066204,0.0011054494,0.005416411,0.0011861363,0.00033107816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002233252,0.0009164878,0.00060656114,0.0017595266,0.0008635091,0.0021279673,0.0018422445,0.0011906208,0.0043655625],"category_scores_gemma":[0.022986503,0.0010360976,0.00064165116,0.0014454294,0.002006226,0.008732261,0.0017257228,0.0022398108,0.000757998],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006146304,0.00021660766,0.0042225067,0.0005841428,0.00006387084,0.0005035289,0.0024963925,0.030767944,0.0136496015,0.21569149,0.0058637457,0.7253256],"study_design_scores_gemma":[0.00007376937,0.000470171,0.001290389,0.00056073326,0.00018244467,0.0012589636,0.00053210097,0.37777883,0.09422287,0.48430246,0.039200522,0.00012665142],"about_ca_topic_score_codex":0.0017583391,"about_ca_topic_score_gemma":0.0024336444,"teacher_disagreement_score":0.0043655625,"about_ca_system_score_codex":0.0006885953,"about_ca_system_score_gemma":0.0007383976,"threshold_uncertainty_score":0.01460427},"labels":[],"label_agreement":null},{"id":"W1846963259","doi":"10.1007/978-3-642-23771-3_5","title":"Smart Homes or Smart Occupants? Supporting Aware Living in the Home","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Environmental Education and Sustainability","field":"Environmental Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Western Economic Diversification Canada; Mitacs; BC Hydro","keywords":"Software deployment; Home automation; Computer science; Key (lock); Resource (disambiguation); The Internet; Ecological footprint; Sustainable living; Internet of Things; Architectural engineering; Sustainable development; Computer security; Telecommunications; Sustainability; World Wide Web; Engineering; Ecology","score_opus":0.018106870670060903,"score_gpt":0.25905993684354345,"score_spread":0.24095306617348256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846963259","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.020280968,0.1876993,0.04945615,0.025668314,0.006329428,0.00009015991,0.00019602195,0.001126713,0.7091529],"genre_scores_gemma":[0.17119038,0.109892674,0.03851593,0.010318297,0.0021216036,0.00014194561,0.00028766872,0.00029176613,0.66723967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999161,0.000023201816,0.0000032216815,0.000018512395,0.000025448793,0.000013566115],"domain_scores_gemma":[0.9999361,0.000028958548,0.0000038509274,0.0000084495805,0.000007425661,0.000015330214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019137727,0.00042005914,0.0001866024,0.00017877601,0.0003586089,0.0015071902,0.00043313904,0.0008732342,0.011087369],"category_scores_gemma":[0.00020820128,0.0001433882,0.00020853305,0.00029000323,0.0010254303,0.0032492727,0.0008316792,0.0010365058,0.00281337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034192395,0.000079918325,0.00055912335,0.0007696331,0.000012541009,0.0002563327,0.008591544,0.0005793566,0.003239098,0.372822,0.19014578,0.42291054],"study_design_scores_gemma":[0.0000036633298,0.000049877788,0.00057170796,0.000386105,0.000007704382,0.00038588964,0.0016733396,0.00038849883,0.00048435343,0.040087536,0.95595235,0.00000888767],"about_ca_topic_score_codex":0.0005537616,"about_ca_topic_score_gemma":0.0012451308,"teacher_disagreement_score":0.011087369,"about_ca_system_score_codex":0.00031202566,"about_ca_system_score_gemma":0.00031556597,"threshold_uncertainty_score":0.037090898},"labels":[],"label_agreement":null},{"id":"W1847018988","doi":"10.1007/3-540-45813-1_34","title":"Time Complexity of Rough Clustering: GAs versus K-Means","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Saint Mary's University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Fuzzy clustering; Cluster (spacecraft); Object (grammar); CURE data clustering algorithm; Rough set; Correlation clustering; Artificial intelligence","score_opus":0.055330063505071164,"score_gpt":0.25312753772956,"score_spread":0.19779747422448882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847018988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13727917,0.008499804,0.81597704,0.01002267,0.0007186341,0.00017428253,0.0014319385,0.0017895206,0.024106907],"genre_scores_gemma":[0.7203622,0.003143482,0.26161924,0.0006702405,0.0009323218,0.00030828195,0.0011421917,0.0010265096,0.0107956305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680257,0.0012612323,0.00015980985,0.0004540421,0.0009889853,0.00033333417],"domain_scores_gemma":[0.9757746,0.020896753,0.0005957862,0.0013922837,0.00088727614,0.00045327272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037699563,0.00087997713,0.0028073338,0.0012426032,0.0011556597,0.0047188126,0.0025845892,0.0023287914,0.0084112985],"category_scores_gemma":[0.023466175,0.00065739616,0.0014724426,0.002589421,0.0016292607,0.008892961,0.0020675254,0.0023395447,0.0008049253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011455548,0.00012998271,0.0013873553,0.0006682841,0.0001585869,0.000108598106,0.00041051072,0.707831,0.0021311787,0.1607565,0.014733559,0.1105389],"study_design_scores_gemma":[0.00004196226,0.00004133183,0.00034708285,0.000022957967,0.00003742494,0.000048737642,0.00010956216,0.8754942,0.0006108626,0.122104794,0.0011247674,0.000016384194],"about_ca_topic_score_codex":0.0062953886,"about_ca_topic_score_gemma":0.0053800545,"teacher_disagreement_score":0.0084112985,"about_ca_system_score_codex":0.0036327906,"about_ca_system_score_gemma":0.0030100571,"threshold_uncertainty_score":0.028138578},"labels":[],"label_agreement":null},{"id":"W1847308910","doi":"10.1007/978-3-540-79982-5_1","title":"Towards a Medical Virtual Reality Environment for Minimally Invasive Cardiac Surgery","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"","keywords":"Virtual reality; Augmented reality; Cardiac surgery; Medicine; Invasive surgery; Computer science; Surgery; Human–computer interaction","score_opus":0.04670564818885829,"score_gpt":0.28446533757292564,"score_spread":0.23775968938406733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847308910","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.008321912,0.0022808968,0.9505061,0.00069719023,0.0005310321,0.000085337706,0.000119699784,0.0017634111,0.035694413],"genre_scores_gemma":[0.1124431,0.0050698784,0.8176773,0.0007065303,0.0002207139,0.00017326245,0.00047674382,0.0007817938,0.062450647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995926,0.00012818591,0.000013507694,0.000032202417,0.00020091014,0.00003266807],"domain_scores_gemma":[0.9996886,0.00014563563,0.000010139811,0.000036133497,0.0000645387,0.00005491262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006843523,0.00076753594,0.00033612648,0.00038526833,0.00032995638,0.0018250645,0.0016006556,0.0013198553,0.010269639],"category_scores_gemma":[0.0010898774,0.0005648419,0.0006518358,0.00024210125,0.0005364165,0.0013959549,0.00277202,0.0014298148,0.0028818839],"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.00029843213,0.00023140512,0.00048628516,0.00075932837,0.00008883766,0.0012311783,0.0024010486,0.07094633,0.11260509,0.17193836,0.0529095,0.5861042],"study_design_scores_gemma":[0.00008450865,0.00070022786,0.0015546032,0.000582036,0.00010074821,0.0048036273,0.00066739315,0.18798399,0.03955494,0.061278526,0.7024459,0.00024354429],"about_ca_topic_score_codex":0.00057447975,"about_ca_topic_score_gemma":0.00070662674,"teacher_disagreement_score":0.010269639,"about_ca_system_score_codex":0.00021376197,"about_ca_system_score_gemma":0.00040545608,"threshold_uncertainty_score":0.034355402},"labels":[],"label_agreement":null},{"id":"W1847550145","doi":"10.1007/978-3-642-33718-5_42","title":"Segmentation with Non-linear Regional Constraints via Line-Search Cuts","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; National Institutes of Health","keywords":"Unary operation; Maxima and minima; Computer science; Gradient descent; Mathematical optimization; Segmentation; Line (geometry); Submodular set function; Energy (signal processing); Line segment; Image segmentation; Class (philosophy); Line search; Minification; Algorithm; Descent direction; Mathematics; Artificial intelligence; Combinatorics; Artificial neural network; Geometry","score_opus":0.0314667443398586,"score_gpt":0.3019853726781258,"score_spread":0.27051862833826723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847550145","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.0011531371,0.00018874377,0.99716187,0.000038811133,0.0000142140725,0.000040485942,0.000070005626,0.00053012674,0.00080262806],"genre_scores_gemma":[0.023265578,0.00025350897,0.973127,0.000045975543,0.00003117457,0.0001137987,0.0003848057,0.00060522335,0.0021729523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829334,0.0002971379,0.00012591165,0.0005060356,0.00066430966,0.000113253234],"domain_scores_gemma":[0.9979533,0.0010557265,0.00020370944,0.00033904315,0.0003970914,0.000051133462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016663397,0.0020571346,0.0024040148,0.002154358,0.00063473015,0.0031325745,0.0031984048,0.0028195411,0.007949072],"category_scores_gemma":[0.0039791465,0.0025221691,0.0018783871,0.0030079973,0.0013120965,0.002845275,0.0020306092,0.0026621986,0.003290395],"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.000509219,0.00014671515,0.00045754295,0.0013370503,0.00026570176,0.0003163223,0.00028970727,0.32097873,0.08742127,0.03778688,0.013146091,0.53734475],"study_design_scores_gemma":[0.000040198836,0.0000799884,0.00035969474,0.00006741444,0.00007203849,0.0003443743,0.000036759466,0.94241303,0.029310664,0.016814157,0.010415308,0.00004630221],"about_ca_topic_score_codex":0.0031806128,"about_ca_topic_score_gemma":0.006475517,"teacher_disagreement_score":0.007949072,"about_ca_system_score_codex":0.0011171716,"about_ca_system_score_gemma":0.0016721969,"threshold_uncertainty_score":0.026592314},"labels":[],"label_agreement":null},{"id":"W1847588464","doi":"10.1007/11427995_29","title":"Analysis of Three Intrusion Detection System Benchmark Datasets Using Machine Learning Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada; Ege Üniversitesi","keywords":"Computer science; Benchmark (surveying); Intrusion detection system; Artificial intelligence; Machine learning; Algorithm; Data mining","score_opus":0.0161138039266234,"score_gpt":0.2391657902735441,"score_spread":0.2230519863469207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847588464","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.9795129,0.00081370154,0.008163267,0.00042858577,0.00015198126,0.0001605484,0.0069359955,0.0021878125,0.0016451456],"genre_scores_gemma":[0.9359014,0.00035553306,0.020562736,0.00011268697,0.00008444437,0.00019504852,0.041069996,0.00015101086,0.0015671452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981311,0.00038594296,0.00023292226,0.00030199034,0.0007566734,0.0001913397],"domain_scores_gemma":[0.98949826,0.0056098886,0.00082958135,0.0010700015,0.0027298457,0.00026240863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021836523,0.0013927673,0.0008987551,0.0028424733,0.0006437565,0.0010830857,0.00133404,0.0008073416,0.00058937084],"category_scores_gemma":[0.0065721218,0.00024006514,0.0007334897,0.002929927,0.000430894,0.0010612452,0.0005585664,0.00065323536,0.00024176399],"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.004725378,0.0055056447,0.13266894,0.0021063297,0.0016007243,0.0011729194,0.00047927318,0.27189997,0.04948008,0.004309528,0.08249801,0.4435532],"study_design_scores_gemma":[0.0003434994,0.002000718,0.15746781,0.00006180024,0.00039645375,0.000814286,0.0005336183,0.76365983,0.061549243,0.0028223416,0.01025625,0.00009415165],"about_ca_topic_score_codex":0.006729252,"about_ca_topic_score_gemma":0.009526611,"teacher_disagreement_score":0.006729252,"about_ca_system_score_codex":0.0013257382,"about_ca_system_score_gemma":0.000765626,"threshold_uncertainty_score":0.01338017},"labels":[],"label_agreement":null},{"id":"W184781111","doi":"10.1007/978-3-642-29952-0_11","title":"Vertex-Pursuit in Hierarchical Social Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Stochastic block model; Computer science; Directed graph; Social network (sociolinguistics); Directed acyclic graph; Theoretical computer science; Node (physics); Mathematics; Graph; Algorithm; Social media; Artificial intelligence; Engineering","score_opus":0.012699107941487695,"score_gpt":0.25824438438445624,"score_spread":0.24554527644296853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184781111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3473669,0.003226436,0.61270285,0.0034564596,0.00016680514,0.00017748967,0.00076778856,0.00039176116,0.031743556],"genre_scores_gemma":[0.938837,0.0021722077,0.03783212,0.00021794725,0.00033542415,0.00017771295,0.0004915552,0.00011258845,0.019823536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986559,0.0006008844,0.00004889068,0.00023450793,0.00023582777,0.00022392401],"domain_scores_gemma":[0.98368466,0.013009071,0.0010922237,0.0005646759,0.0006160729,0.0010333242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021028167,0.0006575371,0.0015202282,0.00225777,0.00202439,0.0028955073,0.0024301151,0.0024552878,0.0059944317],"category_scores_gemma":[0.0197811,0.0007904721,0.001069727,0.0028155472,0.0023336955,0.004862034,0.0028128335,0.0015925893,0.0008508166],"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.00016839303,0.000061957726,0.0024133488,0.00021064472,0.00005902599,0.00019793921,0.00064199464,0.09696454,0.00081159634,0.8688243,0.00539099,0.024255339],"study_design_scores_gemma":[0.000030170695,0.000024304547,0.00042950397,0.00002325098,0.000020389414,0.000078185214,0.000118981625,0.3274302,0.00016130978,0.6703705,0.0012983602,0.000014793338],"about_ca_topic_score_codex":0.004380889,"about_ca_topic_score_gemma":0.00421897,"teacher_disagreement_score":0.0059944317,"about_ca_system_score_codex":0.0016491596,"about_ca_system_score_gemma":0.0007365254,"threshold_uncertainty_score":0.020053387},"labels":[],"label_agreement":null},{"id":"W1847939393","doi":"10.1007/978-3-540-87605-2_46","title":"Semantic Technologies for Socially-Enhanced Context-Aware Mobile Learning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Learning in Education","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":"Athabasca University; Simon Fraser University","funders":"","keywords":"Affordance; Computer science; Context (archaeology); Collaborative learning; Human–computer interaction; Learning environment; Multimedia; Knowledge management; World Wide Web; Mathematics education; Psychology","score_opus":0.014573690323768056,"score_gpt":0.2609414940651092,"score_spread":0.24636780374134112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847939393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016861822,0.0019964285,0.95778644,0.0008022628,0.00028179697,0.00011987637,0.00015693715,0.0018056079,0.020188736],"genre_scores_gemma":[0.5648528,0.002422325,0.4192143,0.0004316409,0.0002233667,0.0003356673,0.0005948901,0.00023927576,0.011685801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910754,0.0003221543,0.00007685638,0.00013573664,0.00027822758,0.00007946201],"domain_scores_gemma":[0.9994797,0.00022619321,0.00003620027,0.00013462364,0.0000776156,0.000045705772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090577354,0.00070892076,0.0006556079,0.00055306585,0.00065821956,0.0024782668,0.001145934,0.0015269353,0.0030510458],"category_scores_gemma":[0.0015160902,0.00034220258,0.00066762965,0.0007476431,0.0011093752,0.0051750415,0.0035656455,0.0015468171,0.00097174593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031536486,0.000378148,0.0009888244,0.0009394728,0.00015574525,0.00060683425,0.0033915802,0.018057661,0.05395872,0.46677887,0.011025778,0.44340298],"study_design_scores_gemma":[0.000069846785,0.00025404547,0.0011226306,0.00034830434,0.00020287812,0.0011765342,0.001941102,0.15048598,0.038041167,0.6220882,0.18413962,0.00012966071],"about_ca_topic_score_codex":0.0007291155,"about_ca_topic_score_gemma":0.0013717134,"teacher_disagreement_score":0.0030510458,"about_ca_system_score_codex":0.00039646687,"about_ca_system_score_gemma":0.0005521883,"threshold_uncertainty_score":0.010206759},"labels":[],"label_agreement":null},{"id":"W1847972783","doi":"10.1007/978-3-642-22092-0_58","title":"Rotation Invariant Completion Fields for Mapping Diffusion MRI Connectivity","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"McGill University","funders":"","keywords":"Computer science; Rotation (mathematics); Imaging phantom; Spherical harmonics; Invariant (physics); Partial differential equation; Focus (optics); Artificial intelligence; Algorithm; Mathematics; Mathematical analysis; Physics","score_opus":0.09198212027283113,"score_gpt":0.3301112670399717,"score_spread":0.23812914676714053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847972783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051113227,0.00019126176,0.9936603,0.0000980029,0.0000232657,0.000033746634,0.00015975276,0.00039585537,0.00032642874],"genre_scores_gemma":[0.15234432,0.0011550299,0.8379915,0.00010911199,0.00015998234,0.0002967665,0.0015862846,0.00068243116,0.005674629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995685,0.00017016353,0.00002715154,0.00008088546,0.00011981649,0.00003339333],"domain_scores_gemma":[0.9981499,0.00097128283,0.00020294127,0.0003009779,0.00027767132,0.00009713615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771317,0.0010395161,0.0011472879,0.00164121,0.00045858583,0.0011235013,0.0013299981,0.001045231,0.003555797],"category_scores_gemma":[0.005683158,0.0006888158,0.0010560921,0.0018468492,0.0009971657,0.0018752677,0.0014471676,0.002173555,0.0013214779],"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.0003836687,0.0001902445,0.0006668514,0.0003709057,0.00009268965,0.00014321264,0.0002209113,0.31144792,0.02446571,0.1452862,0.014106684,0.50262505],"study_design_scores_gemma":[0.000028903285,0.000083456915,0.00033391616,0.000021106847,0.000017065286,0.00008453091,0.000025330584,0.92257607,0.0040449584,0.069589525,0.003163987,0.000031129883],"about_ca_topic_score_codex":0.0046652732,"about_ca_topic_score_gemma":0.003521681,"teacher_disagreement_score":0.0046652732,"about_ca_system_score_codex":0.0006183158,"about_ca_system_score_gemma":0.0012497117,"threshold_uncertainty_score":0.011895359},"labels":[],"label_agreement":null},{"id":"W184810141","doi":"10.1007/978-3-642-39159-0_20","title":"Inferring the Association Network from p53 Sequence Alignment Using Granular Evaluations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Guelph","funders":"","keywords":"Computational biology; Granularity; Sequence (biology); Function (biology); Biology; Sequence analysis; Biomolecule; Computer science; Genetics; Gene","score_opus":0.04665446844859662,"score_gpt":0.27987780153666764,"score_spread":0.23322333308807103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184810141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45936784,0.0036434561,0.5229234,0.00083977013,0.00017152585,0.0001509645,0.005191969,0.0017236306,0.0059874007],"genre_scores_gemma":[0.82468927,0.0013437334,0.16639036,0.00011992486,0.00012834478,0.00013273447,0.005788968,0.000082399805,0.0013242854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985606,0.00027624643,0.00015309018,0.00053734967,0.00035064266,0.00012199653],"domain_scores_gemma":[0.99704164,0.0019420434,0.00038076146,0.00027849557,0.00025577552,0.00010126344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015105343,0.0007580482,0.00119036,0.005684893,0.00075184676,0.002367581,0.00087205844,0.0011085586,0.0018775834],"category_scores_gemma":[0.0075395014,0.0004906887,0.0014366981,0.004688549,0.00048594014,0.0024855565,0.0011735281,0.0013233753,0.0010871819],"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.002249137,0.00067796936,0.14315501,0.000989438,0.0011222302,0.0031222438,0.0007305752,0.12239774,0.059864394,0.025598368,0.009446946,0.630646],"study_design_scores_gemma":[0.000053271804,0.00016846944,0.03728437,0.00016371811,0.00049537607,0.001093625,0.00044899058,0.8252727,0.009807838,0.12074774,0.0043922076,0.00007166851],"about_ca_topic_score_codex":0.0022848046,"about_ca_topic_score_gemma":0.0029706229,"teacher_disagreement_score":0.005684893,"about_ca_system_score_codex":0.0005780405,"about_ca_system_score_gemma":0.000545346,"threshold_uncertainty_score":0.007988572},"labels":[],"label_agreement":null},{"id":"W1848178588","doi":"10.1007/3-540-44886-1_51","title":"Re-using Web Information for Building Flexible Domain Knowledge","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université de Montréal","funders":"","keywords":"Computer science; Subject-matter expert; Domain (mathematical analysis); Domain knowledge; Knowledge base; Meaning (existential); TUTOR; Session (web analytics); Artificial intelligence; Subject matter; Information retrieval; Subject (documents); Knowledge-based systems; Natural language processing; Expert system; World Wide Web; Programming language; Curriculum","score_opus":0.030902940789449967,"score_gpt":0.2852948213217067,"score_spread":0.2543918805322567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848178588","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.016018912,0.0012270557,0.9484273,0.0011564206,0.00016853756,0.00033949292,0.001604527,0.009675783,0.021381898],"genre_scores_gemma":[0.14920239,0.0018607002,0.82885593,0.0005636197,0.0000903265,0.00024419947,0.00804365,0.0020506945,0.00908848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972681,0.00070767786,0.0003358938,0.00053999835,0.0009958574,0.0001525755],"domain_scores_gemma":[0.9910926,0.0025906852,0.00021802317,0.0050575603,0.000883207,0.00015794925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003773133,0.0010818394,0.0015127792,0.006807799,0.0012082706,0.0057585235,0.002849564,0.0015286126,0.0065672975],"category_scores_gemma":[0.012808298,0.001112478,0.002244466,0.006804937,0.0014392609,0.014438568,0.0065098614,0.0029627613,0.003986045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017713326,0.00034212295,0.0028068265,0.00088971626,0.0003750644,0.0011369924,0.002741234,0.019010024,0.013734995,0.07624443,0.0247767,0.8577647],"study_design_scores_gemma":[0.00006581607,0.00008654635,0.0021197188,0.0009099789,0.00087042205,0.0015450487,0.0027228526,0.2151236,0.05260915,0.34769925,0.37604085,0.00020669939],"about_ca_topic_score_codex":0.0062467977,"about_ca_topic_score_gemma":0.011919974,"teacher_disagreement_score":0.006807799,"about_ca_system_score_codex":0.0010075647,"about_ca_system_score_gemma":0.0014522563,"threshold_uncertainty_score":0.021969795},"labels":[],"label_agreement":null},{"id":"W1848232782","doi":"10.1007/11766247_1","title":"Integrating Information Gathering Interaction into Transfer of Control Strategies in Adjustable Autonomy Multiagent Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Autonomy; Control (management); Multi-agent system; Value (mathematics); Field (mathematics); Order (exchange); Human–computer interaction; Knowledge management; Artificial intelligence; Machine learning; Mathematics","score_opus":0.01204202617098269,"score_gpt":0.23175431659781576,"score_spread":0.21971229042683307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848232782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0366236,0.00020715049,0.9564427,0.00014835528,0.00004328351,0.000041843974,0.000007742202,0.00028171742,0.006203599],"genre_scores_gemma":[0.9046257,0.00019808195,0.09235544,0.00004532634,0.000031176085,0.00007946711,0.000020380325,0.00006573256,0.0025786154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997205,0.000108614906,0.000022993192,0.00004402347,0.000073227915,0.000030659947],"domain_scores_gemma":[0.99919647,0.00055588677,0.00005537063,0.00010047011,0.000058835696,0.000032992222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074848253,0.0003801622,0.00044463694,0.00021380863,0.00038202488,0.0010289855,0.0011490734,0.00073522667,0.0018404268],"category_scores_gemma":[0.0024706621,0.0003140431,0.00036481657,0.0003647561,0.00078648014,0.0023776465,0.0011513694,0.001014151,0.00020469632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024096147,0.00021209041,0.00074233674,0.00014015714,0.00006577759,0.00027517613,0.00066226063,0.6237077,0.022975659,0.16528042,0.00085854396,0.18483892],"study_design_scores_gemma":[0.000015079748,0.00005829175,0.00017097268,0.0000061112455,0.000013314559,0.00003063977,0.0000234818,0.9447342,0.0033645446,0.05083586,0.0007356014,0.0000119099195],"about_ca_topic_score_codex":0.0007753304,"about_ca_topic_score_gemma":0.00047033973,"teacher_disagreement_score":0.0018404268,"about_ca_system_score_codex":0.00031878785,"about_ca_system_score_gemma":0.0002811945,"threshold_uncertainty_score":0.006156802},"labels":[],"label_agreement":null},{"id":"W1849027473","doi":"10.1007/978-3-642-38824-8_11","title":"Evaluating Syntactic Sentence Compression for Text Summarisation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Natural language processing; Sentence; Computer science; Linguistics; Artificial intelligence; Philosophy","score_opus":0.06215909734522565,"score_gpt":0.316962817238673,"score_spread":0.2548037198934473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849027473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40183306,0.017975371,0.5120078,0.0014294975,0.0022953914,0.001335629,0.008777536,0.03504749,0.019298222],"genre_scores_gemma":[0.51965034,0.003922165,0.419338,0.00034185924,0.0015598417,0.0007273368,0.039891254,0.0015584959,0.013010736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983164,0.00057862175,0.00016533755,0.0002773947,0.00052432436,0.00013796183],"domain_scores_gemma":[0.99388146,0.004047351,0.00025303132,0.00033662305,0.0013148938,0.00016662135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020191013,0.0022476204,0.0017794814,0.002354843,0.0007321778,0.0017766672,0.0012297033,0.0016271485,0.009049553],"category_scores_gemma":[0.0077321352,0.00047000268,0.0008477612,0.0021459952,0.00035768244,0.0021856138,0.0012420346,0.0012589098,0.005138219],"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.0016867431,0.0003385745,0.0012614811,0.0012039703,0.0002939054,0.0003400731,0.0002834137,0.016354613,0.056087986,0.0011292733,0.029283492,0.8917364],"study_design_scores_gemma":[0.0006133775,0.0027193178,0.008794719,0.00023875956,0.0010338419,0.0008633283,0.00095000764,0.8317289,0.12474718,0.008062844,0.020102784,0.00014500848],"about_ca_topic_score_codex":0.0025022095,"about_ca_topic_score_gemma":0.0036050277,"teacher_disagreement_score":0.009049553,"about_ca_system_score_codex":0.0005452465,"about_ca_system_score_gemma":0.0009515727,"threshold_uncertainty_score":0.030273795},"labels":[],"label_agreement":null},{"id":"W1849207675","doi":"10.1007/978-3-642-15745-5_79","title":"Hierarchical Multimodal Image Registration Based on Adaptive Local Mutual Information","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Image registration; Computer science; Mutual information; Artificial intelligence; Robustness (evolution); Computer vision; Similarity measure; Metric (unit); Modalities; Pixel; Pattern recognition (psychology); Image (mathematics)","score_opus":0.008556847812374634,"score_gpt":0.26588120505634893,"score_spread":0.2573243572439743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849207675","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.007867606,0.00010485636,0.99075985,0.000036778813,0.000013578281,0.000030369865,0.00002245623,0.00049251434,0.00067201955],"genre_scores_gemma":[0.23630504,0.00022751206,0.7600662,0.00009030416,0.00005851988,0.00017979245,0.0002392278,0.00041839434,0.0024150417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.00039382797,0.00006312567,0.0002579363,0.00046774073,0.0001073209],"domain_scores_gemma":[0.9989969,0.000399439,0.00012941349,0.00022555933,0.00020386082,0.000044776516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012581324,0.000678014,0.0012790194,0.0014805532,0.00063833606,0.0010071415,0.0015624512,0.0010520583,0.0022146294],"category_scores_gemma":[0.0031144428,0.00063623703,0.0011974867,0.001339644,0.000712411,0.0017391358,0.0023226375,0.0010002294,0.0010351647],"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.0007425753,0.00020912186,0.0014201889,0.00023655359,0.0002955175,0.00023884789,0.00040788008,0.182359,0.16451326,0.024010554,0.0037207776,0.62184566],"study_design_scores_gemma":[0.000022688395,0.00009601426,0.0010195309,0.000010494675,0.000063622676,0.00019387812,0.00003112911,0.96800095,0.021754386,0.007232561,0.0015337366,0.00004098734],"about_ca_topic_score_codex":0.0017566069,"about_ca_topic_score_gemma":0.0031444812,"teacher_disagreement_score":0.0022146294,"about_ca_system_score_codex":0.00048696436,"about_ca_system_score_gemma":0.0007792387,"threshold_uncertainty_score":0.007408738},"labels":[],"label_agreement":null},{"id":"W1849528754","doi":"10.1007/3-540-45075-0_7","title":"Synthesizing SDL from Use Case Maps: An Experiment","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer graphics (images); Programming language; Software engineering","score_opus":0.024113356887409385,"score_gpt":0.24845142833730283,"score_spread":0.22433807144989343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849528754","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.8624787,0.0001203232,0.1133355,0.00028998207,0.00013132516,0.00082617154,0.00093216915,0.012266016,0.009619946],"genre_scores_gemma":[0.8590881,0.00008305407,0.13616607,0.000073325224,0.000011027294,0.00031700011,0.0009583751,0.0006916115,0.002611362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847716,0.0005356972,0.00012565927,0.000293251,0.00046995332,0.00009831404],"domain_scores_gemma":[0.97806317,0.017960943,0.00045416687,0.002127374,0.0010947327,0.00029973942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885253,0.00071942294,0.0005223791,0.0007039946,0.0004249075,0.0012158551,0.0012880063,0.0011488687,0.005656877],"category_scores_gemma":[0.016603248,0.0006360475,0.00050755695,0.0008057081,0.00047398146,0.0016769073,0.00097081467,0.0010986557,0.001159798],"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.005816279,0.005344366,0.007461059,0.0017515115,0.00018560793,0.0012855601,0.004262502,0.24324225,0.118185066,0.011590214,0.005563747,0.5953118],"study_design_scores_gemma":[0.00080981985,0.0019827876,0.0024340407,0.00006343834,0.0001755234,0.00023555841,0.0011040616,0.82405555,0.15119168,0.0062080827,0.011662634,0.00007681648],"about_ca_topic_score_codex":0.0034361782,"about_ca_topic_score_gemma":0.0029075285,"teacher_disagreement_score":0.005656877,"about_ca_system_score_codex":0.0005944272,"about_ca_system_score_gemma":0.0010658219,"threshold_uncertainty_score":0.018924117},"labels":[],"label_agreement":null},{"id":"W1850079471","doi":"10.1007/978-3-540-74126-8_27","title":"Computability of Models for Sequence Assembly","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":166,"is_retracted":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":"De Bruijn sequence; Computer science; Sequence (biology); De Bruijn graph; Sequence assembly; Time complexity; Theoretical computer science; Combinatorics; Algorithm; Graph; Mathematics; Biology; Genetics; Gene","score_opus":0.0457136478197498,"score_gpt":0.2884063748465907,"score_spread":0.24269272702684092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850079471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04348747,0.00055123353,0.9419979,0.0013668322,0.00008668809,0.000064838634,0.0004541278,0.0012843114,0.010706567],"genre_scores_gemma":[0.7308952,0.000965249,0.25610435,0.00035827458,0.0002523374,0.0005579291,0.0019860144,0.00078897015,0.008091707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758196,0.00095654436,0.00016203224,0.0005228961,0.0005863975,0.00019003925],"domain_scores_gemma":[0.97579837,0.020310542,0.00070158776,0.002309223,0.00047164448,0.0004086074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037256642,0.0015783206,0.0019546843,0.0018599568,0.0014553388,0.0041593397,0.004407771,0.0032615284,0.0095888255],"category_scores_gemma":[0.028116565,0.0015486896,0.0032041778,0.002210039,0.0038352227,0.009967408,0.0035776307,0.00420528,0.001193093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013037764,0.000051965348,0.00057384215,0.00014797368,0.000056181885,0.000076245975,0.00020450224,0.290552,0.0005304625,0.6851458,0.002793378,0.019737318],"study_design_scores_gemma":[0.000012562644,0.000006944768,0.000029193594,0.000008694938,0.000007208336,0.000020663527,0.000008662262,0.30557612,0.00019295081,0.6936208,0.0005110811,0.00000509453],"about_ca_topic_score_codex":0.00206503,"about_ca_topic_score_gemma":0.0017509743,"teacher_disagreement_score":0.0095888255,"about_ca_system_score_codex":0.0031768568,"about_ca_system_score_gemma":0.0011583202,"threshold_uncertainty_score":0.03207785},"labels":[],"label_agreement":null},{"id":"W185011072","doi":"10.1007/978-3-642-33536-5_12","title":"Formal Verification of Security Preservation for Migrating Virtual Machines in the Cloud","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Research Canada; Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Virtual machine; Software engineering; Programming language; Operating system","score_opus":0.026264346302484514,"score_gpt":0.2682224568085786,"score_spread":0.2419581105060941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185011072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03666441,0.00023270847,0.95397246,0.0006564204,0.00013519994,0.00018600475,0.00015507093,0.0022488788,0.0057487935],"genre_scores_gemma":[0.7747532,0.00033688385,0.21959403,0.000264881,0.000121644465,0.00023338712,0.00036773455,0.0004936392,0.00383462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946108,0.0017620733,0.0004214918,0.00065947877,0.0016038063,0.0009423212],"domain_scores_gemma":[0.98722214,0.0081125125,0.00078613264,0.0024921112,0.001183299,0.0002037369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005363683,0.00093353435,0.000870025,0.000874159,0.001084024,0.0037291276,0.003265833,0.0014356922,0.003063284],"category_scores_gemma":[0.01636438,0.0011221317,0.0025753754,0.00058281975,0.005168307,0.004587769,0.0034123282,0.003063357,0.00056267425],"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.00051389314,0.00033248516,0.0023404513,0.00076552556,0.00015549181,0.00073001784,0.0012584698,0.26337993,0.027238041,0.62803304,0.00323893,0.07201372],"study_design_scores_gemma":[0.00017076233,0.00013661938,0.00043968525,0.00017741376,0.00013247225,0.00021231378,0.00022037278,0.5966946,0.03708102,0.35715735,0.0075119883,0.000065377506],"about_ca_topic_score_codex":0.0066233664,"about_ca_topic_score_gemma":0.004929137,"teacher_disagreement_score":0.0066233664,"about_ca_system_score_codex":0.0023712295,"about_ca_system_score_gemma":0.0045388,"threshold_uncertainty_score":0.028366208},"labels":[],"label_agreement":null},{"id":"W185013779","doi":"10.1007/978-3-319-07046-9_29","title":"The Markov Transition Constraint","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Université Laval","funders":"","keywords":"Markov chain; Knapsack problem; Computer science; Mathematical optimization; Algorithm; Constraint (computer-aided design); Linear programming; State space; Local consistency; Consistency (knowledge bases); Mathematics; Constraint satisfaction; Artificial intelligence","score_opus":0.015708498608575528,"score_gpt":0.23327887502755834,"score_spread":0.2175703764189828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185013779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003705074,0.005654115,0.681293,0.0055782483,0.00094378827,0.00006257991,0.0010564632,0.00028844608,0.30141824],"genre_scores_gemma":[0.41961372,0.018146785,0.32054538,0.00419966,0.0036856902,0.0008259378,0.0037724571,0.0009985522,0.22821175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989091,0.0004002191,0.000063017105,0.00028271246,0.00026525446,0.00007970378],"domain_scores_gemma":[0.99799454,0.0013073533,0.00009896822,0.0003467341,0.00018932825,0.00006313654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013523657,0.0006971323,0.0009322771,0.00082183763,0.0011329541,0.002552914,0.0012077764,0.0019192896,0.027196757],"category_scores_gemma":[0.0064392737,0.0007436954,0.0011626508,0.0016069326,0.0030740178,0.0043027266,0.0017373818,0.004684392,0.0056562466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048884394,0.0000040382297,0.000019613148,0.000023048859,0.0000041948115,0.000021924434,0.000032772874,0.0010398083,0.00007662523,0.98665667,0.0041615586,0.0079549765],"study_design_scores_gemma":[0.0000029546025,0.0000021618064,0.000028637767,0.000019965233,0.00000361111,0.000032063603,0.0000069063435,0.004055385,0.00008563074,0.976616,0.019141793,0.000004835593],"about_ca_topic_score_codex":0.0029146494,"about_ca_topic_score_gemma":0.001973193,"teacher_disagreement_score":0.027196757,"about_ca_system_score_codex":0.0017623805,"about_ca_system_score_gemma":0.0018184036,"threshold_uncertainty_score":0.09098226},"labels":[],"label_agreement":null},{"id":"W1850172974","doi":"10.1007/978-3-642-13962-8_23","title":"Spatial Models for Virtual Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Dalhousie University","funders":"","keywords":"Computer science; Spatial network; Theoretical computer science; Cluster analysis; Link (geometry); Spatial analysis; Data mining; Graph; Spatial database; Link analysis; Node (physics); Information retrieval; Artificial intelligence; Geography; Mathematics; Computer network","score_opus":0.013410573460410927,"score_gpt":0.24729299915714067,"score_spread":0.23388242569672973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850172974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015668025,0.0026980797,0.92513156,0.003068777,0.00043483498,0.000058884216,0.00068586797,0.00035658726,0.051897414],"genre_scores_gemma":[0.7402032,0.008052468,0.10875445,0.00088043703,0.0012745874,0.0005486647,0.0014379424,0.0005008314,0.13834742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00027958784,0.000026475376,0.0001154069,0.0001239215,0.0000897161],"domain_scores_gemma":[0.9981863,0.00096386555,0.00019672094,0.00022079382,0.0002622747,0.00017009993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088627,0.0013951834,0.001269006,0.0012276588,0.0010452052,0.0031461543,0.0028390435,0.0023092171,0.013782908],"category_scores_gemma":[0.0053129587,0.00091053615,0.0011215071,0.0018695091,0.0018956519,0.005486537,0.0022517648,0.0025986133,0.002028827],"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.000008993453,0.000013187172,0.00009770334,0.000027181895,0.000012122402,0.00002615419,0.000050743838,0.10739798,0.000109164794,0.8854198,0.0032610781,0.00357578],"study_design_scores_gemma":[0.0000065678014,0.000005391337,0.000045154196,0.000010374339,0.0000070915107,0.00002047362,0.000029689478,0.4030921,0.00003305102,0.5923895,0.0043533216,0.0000072395687],"about_ca_topic_score_codex":0.00879096,"about_ca_topic_score_gemma":0.007075692,"teacher_disagreement_score":0.013782908,"about_ca_system_score_codex":0.0022485168,"about_ca_system_score_gemma":0.0011044103,"threshold_uncertainty_score":0.046108484},"labels":[],"label_agreement":null},{"id":"W1850501806","doi":"10.1007/3-540-45014-9_5","title":"Multiple Classifier Combination Methodologies for Different Output Levels","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":122,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Classifier (UML); Machine learning; Artificial intelligence; Scope (computer science); Data mining; Data science","score_opus":0.10073118306966654,"score_gpt":0.32968489645825944,"score_spread":0.22895371338859288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850501806","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.0039458303,0.0004604117,0.9927142,0.00007446807,0.0001238346,0.00006804771,0.00006648933,0.001321854,0.0012247293],"genre_scores_gemma":[0.06687943,0.0005418654,0.9246819,0.000112367365,0.00013807496,0.00024616803,0.00042606465,0.00045932643,0.006514874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972873,0.000547387,0.00020972815,0.00058496994,0.0011840678,0.00018655849],"domain_scores_gemma":[0.995372,0.0016767466,0.0001451014,0.00067626755,0.002063422,0.00006646718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003524306,0.0020581842,0.0017051761,0.0022907003,0.0010041331,0.0026068983,0.0020944204,0.0022233233,0.008450824],"category_scores_gemma":[0.006549322,0.00093787786,0.0022570482,0.0022384152,0.00047905082,0.0034796721,0.0016186283,0.0023257989,0.0048957905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026260834,0.00014950789,0.000621017,0.00025685987,0.0002334658,0.00008996917,0.00008639924,0.014322792,0.032880306,0.0031265316,0.004091191,0.94387937],"study_design_scores_gemma":[0.000051933785,0.0002825098,0.0014815603,0.000086865286,0.0005524609,0.0005187738,0.00011632587,0.8290319,0.14046505,0.014327615,0.012974825,0.000110206776],"about_ca_topic_score_codex":0.000533255,"about_ca_topic_score_gemma":0.0015134866,"teacher_disagreement_score":0.008450824,"about_ca_system_score_codex":0.00048209686,"about_ca_system_score_gemma":0.00054918573,"threshold_uncertainty_score":0.02827084},"labels":[],"label_agreement":null},{"id":"W1850542807","doi":"10.1007/978-3-540-45198-3_25","title":"Continuous-Time Quantum Walks on the Symmetric Group","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":77,"is_retracted":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":"Quantum walk; Cayley graph; Limiting; Computer science; Quantum; Group (periodic table); Symmetric group; Random walk; Quantum algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Quantum mechanics; Physics","score_opus":0.010787857966635636,"score_gpt":0.2142593286100372,"score_spread":0.20347147064340154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850542807","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.63104886,0.0013355499,0.21413785,0.0025186765,0.0007843166,0.00013050357,0.00034364144,0.0004219047,0.14927873],"genre_scores_gemma":[0.95050913,0.0006036391,0.014850953,0.00023774657,0.00033507214,0.00007658692,0.00013079561,0.00008154702,0.03317449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996997,0.00007449831,0.000009882237,0.000043269014,0.000109716166,0.000062856336],"domain_scores_gemma":[0.9993754,0.0002458621,0.000055116838,0.000091465176,0.000073207324,0.00015894258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825755,0.00053200155,0.00064829877,0.00085357786,0.0008598292,0.0018852181,0.0009086702,0.0012453207,0.006768373],"category_scores_gemma":[0.0012146339,0.00028850738,0.0005147588,0.0008264978,0.0018927483,0.00225884,0.0008320449,0.0015086498,0.00062800245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022671384,0.000020640839,0.000042681084,0.000013112434,0.0000045783063,0.00004086843,0.000051753817,0.002513081,0.0009223344,0.99334985,0.00065634894,0.0023621852],"study_design_scores_gemma":[0.000025408688,0.000018893877,0.00009044445,0.000004726371,0.0000020768653,0.000031108553,0.000022157203,0.020725982,0.00024465437,0.9778717,0.0009546286,0.0000081345215],"about_ca_topic_score_codex":0.0008400633,"about_ca_topic_score_gemma":0.00073282805,"teacher_disagreement_score":0.006768373,"about_ca_system_score_codex":0.00078066014,"about_ca_system_score_gemma":0.0006495601,"threshold_uncertainty_score":0.022642493},"labels":[],"label_agreement":null},{"id":"W1850778893","doi":"10.1007/978-3-540-24840-8_44","title":"Artificial Aging of Faces by Support Vector Machines","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"Western University","funders":"","keywords":"Support vector machine; Computer science; Artificial intelligence; Image warping; Feature (linguistics); Pattern recognition (psychology); Displacement (psychology); Computer vision; Face (sociological concept); Facial expression; Feature vector","score_opus":0.015147363120463497,"score_gpt":0.24758596805522268,"score_spread":0.23243860493475918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850778893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07895027,0.0013323347,0.9147992,0.0002082612,0.00044574583,0.00009163733,0.00017746715,0.0019875134,0.0020075853],"genre_scores_gemma":[0.6570471,0.0009695955,0.3338232,0.00011394275,0.0002383597,0.00008487046,0.0005482317,0.00018784657,0.0069868355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967337,0.00006811096,0.000019691302,0.000098367265,0.0000920524,0.000048562782],"domain_scores_gemma":[0.99898404,0.00042245857,0.00010882208,0.00017239309,0.00026453592,0.000047717993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011307008,0.0007168316,0.00085778715,0.00084193604,0.00027526388,0.0006720908,0.0008797403,0.00072640966,0.002363479],"category_scores_gemma":[0.003425169,0.00032736108,0.0007737675,0.00064855866,0.00041678327,0.0013486228,0.0006534898,0.0011256449,0.001119326],"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.00037472462,0.000098937955,0.0024683122,0.0001240327,0.00006502014,0.00012746031,0.00010596814,0.10016861,0.02653201,0.00460786,0.0043024323,0.8610247],"study_design_scores_gemma":[0.0000072210555,0.00008673738,0.00094853295,0.000011573842,0.000024189456,0.000111932546,0.000026881364,0.9838575,0.0075374697,0.0059523657,0.0014241488,0.0000115143475],"about_ca_topic_score_codex":0.0016103588,"about_ca_topic_score_gemma":0.0014686855,"teacher_disagreement_score":0.002363479,"about_ca_system_score_codex":0.00039190426,"about_ca_system_score_gemma":0.00032379222,"threshold_uncertainty_score":0.007906616},"labels":[],"label_agreement":null},{"id":"W1851113295","doi":"10.1007/11406921_22","title":"Using Inter-Procedural Side-Effect Information in JIT Optimizations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Side effect (computer science); Static analysis; Compiler; Parallel computing; Just-in-time compilation; Heap (data structure); Execution time; Programming language","score_opus":0.018838015857023046,"score_gpt":0.2730569146381558,"score_spread":0.25421889878113274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851113295","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.0879349,0.0011320348,0.88002235,0.000288247,0.00015266737,0.00013150349,0.00043946278,0.017317913,0.012580917],"genre_scores_gemma":[0.55208975,0.00064213964,0.43058044,0.00033355967,0.00010486917,0.00018069395,0.0008520739,0.010047619,0.0051688286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973014,0.0006572613,0.00018867261,0.00032727266,0.0012032875,0.00032220304],"domain_scores_gemma":[0.99139893,0.0042823567,0.00077186764,0.0026653556,0.0007957726,0.00008574352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204342,0.0015807027,0.00096640526,0.0013160908,0.00077937124,0.0018102679,0.0012767732,0.0008232975,0.0037858675],"category_scores_gemma":[0.008247003,0.0010165176,0.0015809136,0.0014206918,0.001000502,0.0029885932,0.0015423644,0.0019029315,0.0012244956],"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.0011119564,0.00036916204,0.012129902,0.0007773464,0.0002725953,0.00054564385,0.0007263778,0.16997835,0.23055552,0.041189045,0.009028528,0.5333156],"study_design_scores_gemma":[0.00013735182,0.00041710312,0.0075933584,0.00019936392,0.00038642323,0.0006058094,0.00012540922,0.48207858,0.39893612,0.07772395,0.0315517,0.0002448479],"about_ca_topic_score_codex":0.0010386478,"about_ca_topic_score_gemma":0.002177158,"teacher_disagreement_score":0.0037858675,"about_ca_system_score_codex":0.0007204706,"about_ca_system_score_gemma":0.0012084225,"threshold_uncertainty_score":0.012665033},"labels":[],"label_agreement":null},{"id":"W1851207850","doi":"10.1007/978-3-642-13498-2_43","title":"Computer-Aided Detection and Classification of Masses in Digitized Mammograms Using Artificial Neural Network","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Preprocessor; Artificial intelligence; CAD; Pattern recognition (psychology); Artificial neural network; Computer-aided diagnosis; Gray level; Noise (video); Computer vision; Image (mathematics)","score_opus":0.03281826650673853,"score_gpt":0.260889094934732,"score_spread":0.22807082842799348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851207850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26199666,0.0059544747,0.7159801,0.00061948365,0.00040552623,0.0003865403,0.0010634443,0.005266282,0.008327475],"genre_scores_gemma":[0.55890554,0.0023582098,0.4266689,0.00022879134,0.000108396875,0.0001676167,0.0011924924,0.00013289526,0.010237151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979275,0.000023250383,0.000021701813,0.00004434928,0.000096827825,0.000021166648],"domain_scores_gemma":[0.9994924,0.00024570548,0.00004017915,0.000040807518,0.00017087307,0.000010090576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044113517,0.00042475888,0.0004765016,0.0011905505,0.00018537043,0.00070127693,0.00062059297,0.00089907757,0.0022788642],"category_scores_gemma":[0.0017138484,0.0002976697,0.00041036768,0.00060365326,0.00019019177,0.00046435,0.00037725794,0.0003032936,0.00083813426],"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.00050210755,0.00013026145,0.007021227,0.00033794725,0.00008537607,0.00048094537,0.00009069127,0.025193173,0.07334368,0.00084348297,0.004039372,0.8879317],"study_design_scores_gemma":[0.00004316148,0.00020014541,0.03005317,0.00012797536,0.0002401429,0.0017916827,0.00013182207,0.8688978,0.089028955,0.0013756796,0.008055556,0.000053932254],"about_ca_topic_score_codex":0.0031102381,"about_ca_topic_score_gemma":0.0074432557,"teacher_disagreement_score":0.0031102381,"about_ca_system_score_codex":0.00028517487,"about_ca_system_score_gemma":0.00037581494,"threshold_uncertainty_score":0.0076235533},"labels":[],"label_agreement":null},{"id":"W1851302639","doi":"10.1007/978-3-540-30572-9_5","title":"Learning of Position-Invariant Object Representation Across Attention Shifts","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Invariant (physics); Computer science; Artificial neural network; Artificial intelligence; Perception; Constraint (computer-aided design); Pattern recognition (psychology); Representation (politics); Cognitive neuroscience of visual object recognition; Position (finance); Object (grammar); Computer vision; Mathematics; Psychology","score_opus":0.019710390926384484,"score_gpt":0.2975211147232653,"score_spread":0.2778107237968808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851302639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27061313,0.00068710453,0.7228458,0.00038114088,0.0001913199,0.00004554676,0.00020911785,0.0022124108,0.0028143493],"genre_scores_gemma":[0.91248256,0.00052323926,0.079319365,0.00019432198,0.000110701796,0.000031223743,0.0005742498,0.00018916289,0.006575057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982065,0.00001632386,0.0000062269914,0.0000958579,0.000027491733,0.00003346128],"domain_scores_gemma":[0.99956995,0.00015713296,0.00005376925,0.00009697443,0.000074080024,0.000048133632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004700421,0.0006702033,0.0009549896,0.0004787427,0.00017479382,0.0007912468,0.001287267,0.00091399654,0.0023724786],"category_scores_gemma":[0.0015443403,0.00053934363,0.0006405691,0.0007310626,0.0004135488,0.0013957436,0.0009583292,0.0011141745,0.00068162597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039122472,0.00017118537,0.0022245178,0.00010438387,0.00015398671,0.00010689147,0.000073127674,0.04680852,0.15375482,0.0035512508,0.0033123004,0.78934795],"study_design_scores_gemma":[0.00003639601,0.00029659405,0.0053175595,0.000010030603,0.000071979,0.00014226069,0.000028942146,0.94655424,0.034756195,0.011874906,0.00089104526,0.000019709367],"about_ca_topic_score_codex":0.0028177907,"about_ca_topic_score_gemma":0.0027350087,"teacher_disagreement_score":0.0028177907,"about_ca_system_score_codex":0.00048550277,"about_ca_system_score_gemma":0.0004689401,"threshold_uncertainty_score":0.007936716},"labels":[],"label_agreement":null},{"id":"W1851343703","doi":"10.1007/978-3-642-32973-9_20","title":"Sparse Polynomial Powering Using Heaps","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Heap (data structure); Computer science; Monomial; Benchmark (surveying); sort; Polynomial; Maple; Chebyshev polynomials; Magma; Parallel computing; Algorithm; Algebra over a field; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.025814581225942112,"score_gpt":0.251266098434845,"score_spread":0.22545151720890289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851343703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05084414,0.001914754,0.81796473,0.0008214359,0.00044390626,0.000116984906,0.0003255325,0.0037858076,0.12378272],"genre_scores_gemma":[0.5630544,0.0028591298,0.32660908,0.00035290676,0.0005901706,0.00013837448,0.00091611367,0.0024629591,0.10301691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995554,0.000060142018,0.000022253585,0.00008011319,0.00019333378,0.00008866148],"domain_scores_gemma":[0.9992034,0.0003167999,0.000032359352,0.00031473738,0.00009436333,0.000038379298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041110517,0.00060838053,0.0009303937,0.0008600767,0.0008582441,0.0014651602,0.0011265589,0.0003675156,0.018660698],"category_scores_gemma":[0.002203592,0.000557866,0.00072743767,0.0018178793,0.0013043985,0.005468284,0.0025134746,0.0017049878,0.0033040505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018082937,0.00006222541,0.00028417353,0.00035922282,0.000022366543,0.000087510525,0.00025072618,0.009543905,0.00844895,0.64189523,0.015247132,0.32361764],"study_design_scores_gemma":[0.00004222299,0.000046206012,0.00022560896,0.000069485985,0.000031584466,0.00018314524,0.00007268027,0.031908423,0.010880738,0.88777214,0.068740524,0.000027093027],"about_ca_topic_score_codex":0.00075592985,"about_ca_topic_score_gemma":0.0015488369,"teacher_disagreement_score":0.018660698,"about_ca_system_score_codex":0.00071339717,"about_ca_system_score_gemma":0.0005781033,"threshold_uncertainty_score":0.06242627},"labels":[],"label_agreement":null},{"id":"W1851849126","doi":"10.1007/978-3-540-30464-7_22","title":"Merging of XML Documents","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; XML validation; XML Schema Editor; XML Encryption; Streaming XML; Efficient XML Interchange; Document Structure Description; Merge (version control); XML database; XML Signature; Information retrieval; XML; XML Schema (W3C); Database; Programming language; World Wide Web","score_opus":0.012158246283899872,"score_gpt":0.2523578509546292,"score_spread":0.24019960467072934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851849126","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.04580779,0.0021012046,0.8761941,0.00086920825,0.0006568084,0.0006097434,0.0032798012,0.02235632,0.04812494],"genre_scores_gemma":[0.17079052,0.0015538064,0.75958914,0.0004926396,0.00021790928,0.0002758313,0.01725594,0.005467909,0.044356193],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974446,0.00047472003,0.0002599079,0.0006077821,0.0010073265,0.0002055331],"domain_scores_gemma":[0.99633574,0.0011166263,0.00018419065,0.0014535699,0.00078508037,0.00012475366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023971198,0.0009517129,0.0009385635,0.002878455,0.0013495621,0.0039756596,0.0022005455,0.001353142,0.022426005],"category_scores_gemma":[0.006060911,0.0012698439,0.0018291918,0.004610721,0.00067828223,0.005421955,0.003262454,0.0015226986,0.009369464],"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.00096643256,0.00026780923,0.003189205,0.0010267484,0.00024017785,0.0010855206,0.0018519379,0.00609606,0.08781241,0.06183457,0.038045306,0.79758394],"study_design_scores_gemma":[0.000118479096,0.00039308393,0.0037874086,0.0003106301,0.0005433629,0.001820101,0.0011871838,0.048764326,0.42912617,0.049754966,0.46401432,0.00017990018],"about_ca_topic_score_codex":0.0014007477,"about_ca_topic_score_gemma":0.0014684602,"teacher_disagreement_score":0.022426005,"about_ca_system_score_codex":0.00086499675,"about_ca_system_score_gemma":0.0011660857,"threshold_uncertainty_score":0.07502246},"labels":[],"label_agreement":null},{"id":"W1852114920","doi":"10.1007/3-540-70657-7_11","title":"Modeling Early Requirements in Tropos: A Transformation Based Approach","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software engineering; Requirements analysis; Transformation (genetics); Model transformation; Software development process; Agent-oriented software engineering; Software development; Process (computing); Systems engineering; Set (abstract data type); Software; Programming language; Artificial intelligence; Engineering","score_opus":0.0656782006373824,"score_gpt":0.27814075107725256,"score_spread":0.21246255043987017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852114920","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.011760488,0.00005978212,0.97987396,0.00014557088,0.000013621836,0.00015717284,0.00025041765,0.00196633,0.0057726693],"genre_scores_gemma":[0.25765702,0.00035515265,0.73266846,0.00013177293,0.000019910984,0.00035472278,0.00086875935,0.0011994625,0.0067447503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998575,0.0005267198,0.000108553264,0.00019171968,0.00046942776,0.00012858691],"domain_scores_gemma":[0.9974183,0.0013747308,0.0003249584,0.000527278,0.00028969732,0.0000651211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015283638,0.0009155741,0.00058576406,0.0012390936,0.00054326816,0.0022213028,0.001964366,0.00095430383,0.0051336195],"category_scores_gemma":[0.0034378362,0.0010523866,0.002047177,0.0010226615,0.0011386377,0.0035993748,0.0015734537,0.0022393109,0.0011534244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024950327,0.00018200684,0.0026066564,0.0006016066,0.00016698184,0.0011529673,0.0020644483,0.49374884,0.019488133,0.3700757,0.0033135323,0.106349535],"study_design_scores_gemma":[0.00003755688,0.00009486548,0.00030220096,0.000106002015,0.00013465396,0.00030692833,0.00038468387,0.87382364,0.014726575,0.08350965,0.026532104,0.000041147505],"about_ca_topic_score_codex":0.004882511,"about_ca_topic_score_gemma":0.007212208,"teacher_disagreement_score":0.0051336195,"about_ca_system_score_codex":0.00077899074,"about_ca_system_score_gemma":0.0016001413,"threshold_uncertainty_score":0.017173707},"labels":[],"label_agreement":null},{"id":"W1852585194","doi":"10.1007/978-3-540-75248-6_7","title":"Architecture for Data Collection in Database Intrusion Detection Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Intrusion detection system; Database; Architecture; Data mining; Geography; Archaeology","score_opus":0.03823670252670967,"score_gpt":0.2728143776025103,"score_spread":0.23457767507580063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852585194","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.019776378,0.0011693399,0.9397664,0.0006931444,0.00017091735,0.00040701972,0.0005256377,0.031891774,0.0055993265],"genre_scores_gemma":[0.25556418,0.0017707646,0.71290475,0.0012136895,0.0001904436,0.00078761845,0.0029163335,0.0016260874,0.023026226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987587,0.00020942894,0.0001603484,0.00027104805,0.0004456213,0.00015488088],"domain_scores_gemma":[0.99809486,0.00048576746,0.00008006267,0.0005908366,0.0006322408,0.00011615636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019650683,0.0008057246,0.0011101364,0.0018457869,0.0011017103,0.0043404466,0.0035262422,0.0013377131,0.0070086755],"category_scores_gemma":[0.003271922,0.0011401355,0.0008025691,0.0023387815,0.0009042008,0.0034640064,0.0019114973,0.0018960101,0.0034899935],"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.0013258159,0.0006515469,0.012365414,0.001242703,0.000431433,0.00045681492,0.0017730332,0.038533434,0.06350962,0.092029236,0.07487445,0.7128065],"study_design_scores_gemma":[0.00013451977,0.00041929667,0.0037714916,0.00028442428,0.0005375221,0.0007828071,0.00038001259,0.6769946,0.16155368,0.05876133,0.09618631,0.00019387183],"about_ca_topic_score_codex":0.00809656,"about_ca_topic_score_gemma":0.0078090173,"teacher_disagreement_score":0.00809656,"about_ca_system_score_codex":0.0018125249,"about_ca_system_score_gemma":0.0019847702,"threshold_uncertainty_score":0.023446321},"labels":[],"label_agreement":null},{"id":"W1852771732","doi":"10.1007/978-3-642-18305-8_9","title":"Triangular Tile Self-assembly Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Tile; Equilateral triangle; Square (algebra); Escher; Computer science; Triangular array; Hexagonal crystal system; Combinatorics; Mathematics; Geometry; Crystallography; Materials science","score_opus":0.01675393470677481,"score_gpt":0.23208903383377202,"score_spread":0.21533509912699722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852771732","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.41882378,0.0026002133,0.38710633,0.0004959852,0.00067090924,0.00015640189,0.00031901634,0.0020893996,0.18773803],"genre_scores_gemma":[0.89318997,0.0008555614,0.057075232,0.000114101116,0.000070111484,0.00014903436,0.00036551934,0.00013177143,0.048048712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998933,0.000016724494,0.000006152386,0.000023974559,0.00003067507,0.00002915071],"domain_scores_gemma":[0.99987113,0.000032115197,0.000015295735,0.00003033857,0.000018306717,0.000032748867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096113865,0.00021899038,0.00042045175,0.0003497047,0.0004598542,0.0009408968,0.0005836305,0.0005961586,0.008590743],"category_scores_gemma":[0.0003376458,0.00026947403,0.00027598048,0.00031933206,0.00058507104,0.00050805917,0.00069895503,0.00037194652,0.0013122607],"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.00019866094,0.00009823743,0.00037926805,0.0002583265,0.000033768283,0.0003919807,0.00041859926,0.085629895,0.11303424,0.72530735,0.0076241978,0.06662556],"study_design_scores_gemma":[0.00013236713,0.00028224726,0.0005596875,0.00004466047,0.000027066357,0.00039940854,0.00018532694,0.5603763,0.039662324,0.3563182,0.04194247,0.00006989701],"about_ca_topic_score_codex":0.0003514245,"about_ca_topic_score_gemma":0.00047768056,"teacher_disagreement_score":0.008590743,"about_ca_system_score_codex":0.0002974504,"about_ca_system_score_gemma":0.00017120989,"threshold_uncertainty_score":0.028738856},"labels":[],"label_agreement":null},{"id":"W1853034543","doi":"10.1007/978-3-642-41533-3_41","title":"Transformation of Models Containing Uncertainty","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Model transformation; Transformation (genetics); Graph rewriting; Software; Uncertainty analysis; Graph; Theoretical computer science; Data mining; Programming language; Artificial intelligence; Simulation","score_opus":0.0201239606592011,"score_gpt":0.2334055655372519,"score_spread":0.21328160487805078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853034543","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.013358988,0.00016980321,0.97212124,0.00020400184,0.000058309044,0.000040897445,0.00012411037,0.00045680327,0.013465895],"genre_scores_gemma":[0.6729387,0.00083075545,0.30504578,0.00019600324,0.00012768207,0.0002011207,0.0010157702,0.00076780026,0.018876463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879175,0.0003781797,0.000060178652,0.00019642677,0.0005055129,0.00006795082],"domain_scores_gemma":[0.99846554,0.0008472552,0.00011644234,0.00036371805,0.00016788353,0.000039326038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011025224,0.0008503753,0.0008252607,0.0008856024,0.00046019224,0.0017303514,0.00092174363,0.00074101915,0.0038701135],"category_scores_gemma":[0.004794364,0.00058300525,0.0018535488,0.0008094724,0.0012598934,0.0020636693,0.0028181002,0.0023085854,0.00094619085],"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.0000639333,0.00004520572,0.00022165957,0.00011019811,0.00004900543,0.00022154082,0.00025169403,0.16456993,0.0033489475,0.78282404,0.0015090405,0.046784792],"study_design_scores_gemma":[0.000011027427,0.00002270606,0.00004842319,0.000015689346,0.000014801232,0.00006526544,0.000032320604,0.393407,0.0021357785,0.59928143,0.004956745,0.000008803493],"about_ca_topic_score_codex":0.0009741769,"about_ca_topic_score_gemma":0.00055671093,"teacher_disagreement_score":0.0038701135,"about_ca_system_score_codex":0.00077336386,"about_ca_system_score_gemma":0.0005270143,"threshold_uncertainty_score":0.0129467845},"labels":[],"label_agreement":null},{"id":"W1853101966","doi":"10.1007/978-3-540-73283-9_83","title":"Technology-Mediated Provision of Models: Observational Learning for First Year Students","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Writing and Handwriting Education","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 Toronto","funders":"","keywords":"Observational study; Computer science; Vocabulary; Bridging (networking); Mathematics education; World Wide Web; Pedagogy; Multimedia; Psychology; Linguistics; Medicine","score_opus":0.07102086674599034,"score_gpt":0.3495325976224767,"score_spread":0.27851173087648634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853101966","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.91097575,0.00013456927,0.05303111,0.0012526722,0.000079289865,0.00033531876,0.00029206622,0.0007333355,0.03316589],"genre_scores_gemma":[0.9491554,0.00021674433,0.04165499,0.000099933,0.000015222907,0.00031552152,0.00033162878,0.00009414097,0.00811646],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99683136,0.0020575386,0.00008555394,0.0003817755,0.0004223573,0.00022142424],"domain_scores_gemma":[0.9640434,0.0228763,0.0019241959,0.007664722,0.0014976966,0.0019938203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075176326,0.00071258686,0.00045851216,0.00051886524,0.0015472517,0.00461474,0.0026732972,0.0016132733,0.009089412],"category_scores_gemma":[0.043223534,0.00063564273,0.0005186823,0.0004619576,0.0019159574,0.0067641903,0.005315847,0.003349806,0.0020750258],"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.0022434355,0.036704008,0.08073974,0.0006122348,0.00010850713,0.0009164685,0.26063365,0.008450463,0.014507893,0.056025006,0.03061277,0.5084459],"study_design_scores_gemma":[0.0016950135,0.0142123075,0.09002606,0.0012983428,0.00038964621,0.0023198277,0.22757234,0.097024314,0.05080277,0.32410398,0.18973625,0.000819213],"about_ca_topic_score_codex":0.0018096769,"about_ca_topic_score_gemma":0.0034428863,"teacher_disagreement_score":0.009089412,"about_ca_system_score_codex":0.0012119251,"about_ca_system_score_gemma":0.0024903244,"threshold_uncertainty_score":0.03975755},"labels":[],"label_agreement":null},{"id":"W1853127611","doi":"10.1007/11760023_121","title":"Consecutive Identification of ANFIS-Based Fuzzy Systems with the Aid of Genetic Data Granulation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adaptive neuro fuzzy inference system; Identification (biology); Computer science; Genetic algorithm; Granulation; Fuzzy logic; Data mining; Cluster analysis; Neuro-fuzzy; System identification; Parameter identification problem; Fuzzy control system; Artificial intelligence; Machine learning; Engineering; Model parameter","score_opus":0.018165145140931184,"score_gpt":0.2255809136079029,"score_spread":0.2074157684669717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853127611","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.05020366,0.00019558746,0.94579303,0.0000690284,0.000067970075,0.000079521546,0.00004290226,0.0005639403,0.002984363],"genre_scores_gemma":[0.7789848,0.00011571537,0.21867052,0.000033510038,0.000017406413,0.00013430182,0.00008756322,0.000046169866,0.0019101603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996449,0.00007086859,0.000040326595,0.000070621994,0.0001374611,0.000035862842],"domain_scores_gemma":[0.99932146,0.0003269706,0.00008676907,0.000096063464,0.000153897,0.000014869089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058114453,0.00040278136,0.0007354285,0.0005251807,0.00050518586,0.0007673531,0.0005694108,0.00062136824,0.0014955954],"category_scores_gemma":[0.002088998,0.00030599238,0.00049947837,0.00044961236,0.00045979721,0.0007100645,0.0005307197,0.0006737329,0.00025513215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045815384,0.00013430057,0.001604752,0.0003019068,0.00009778722,0.00028814387,0.0005948998,0.5360317,0.049085375,0.019497665,0.0010690591,0.39083624],"study_design_scores_gemma":[0.000008215432,0.000044077853,0.00040798256,0.000013478326,0.000015381402,0.000056412628,0.00001837738,0.98726106,0.007660588,0.0038163343,0.00068934576,0.000008805438],"about_ca_topic_score_codex":0.0027779632,"about_ca_topic_score_gemma":0.002678674,"teacher_disagreement_score":0.0027779632,"about_ca_system_score_codex":0.00036586443,"about_ca_system_score_gemma":0.00055476086,"threshold_uncertainty_score":0.005523503},"labels":[],"label_agreement":null},{"id":"W1853166665","doi":"10.1007/978-3-642-54423-1_10","title":"Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Carleton University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Spanning tree; Integer (computer science); Mathematics; Computer science; Discrete mathematics","score_opus":0.02470718623155525,"score_gpt":0.2757769881116598,"score_spread":0.2510698018801045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853166665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25067693,0.016796613,0.49627936,0.0053588864,0.00075241603,0.00026335297,0.0031246494,0.0023061153,0.22444175],"genre_scores_gemma":[0.8181799,0.011310904,0.13986056,0.0014908533,0.001584744,0.0005714962,0.0032340158,0.0018620726,0.021905452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976841,0.00060440815,0.000086776396,0.0005181351,0.0006674148,0.0004390416],"domain_scores_gemma":[0.97907513,0.016479466,0.00089289196,0.0014753873,0.0009640038,0.0011131567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026722308,0.00296823,0.00213451,0.004232333,0.0013941355,0.003744883,0.0051344107,0.0020910385,0.020017875],"category_scores_gemma":[0.023844954,0.0014442942,0.0014448363,0.005041655,0.0022615327,0.007986959,0.0037694173,0.005126899,0.0034636522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008044995,0.00030439527,0.002234706,0.0014356233,0.0002467933,0.0003342041,0.00052823446,0.10156478,0.018312464,0.72437775,0.026244735,0.12361186],"study_design_scores_gemma":[0.00006033942,0.00013594041,0.0019191343,0.00025154784,0.00016209629,0.00067252753,0.00021778351,0.177574,0.0048288344,0.8047126,0.0093985135,0.00006664344],"about_ca_topic_score_codex":0.0007508261,"about_ca_topic_score_gemma":0.0011790983,"teacher_disagreement_score":0.020017875,"about_ca_system_score_codex":0.0021112384,"about_ca_system_score_gemma":0.00069932616,"threshold_uncertainty_score":0.066966414},"labels":[],"label_agreement":null},{"id":"W1853379672","doi":"10.1007/978-3-540-24840-8_52","title":"Two Set-Theoretic Approaches to the Semantics of Adjective-Noun Combinations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Windsor","funders":"","keywords":"Adjective; Noun; Syntax; Linguistics; Semantics (computer science); Hierarchy; Computer science; Set (abstract data type); Parallels; Simplicity; Natural language processing; Simple (philosophy); Artificial intelligence; Mathematics; Philosophy; Epistemology; Programming language","score_opus":0.03453039172299875,"score_gpt":0.265354845730622,"score_spread":0.23082445400762325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853379672","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.012385342,0.0028675883,0.9217639,0.0051898607,0.0006968479,0.00013246563,0.00044718708,0.00040053265,0.056116287],"genre_scores_gemma":[0.42188835,0.002251498,0.5529362,0.0019338139,0.0019881425,0.000773824,0.0012024363,0.0004732475,0.016552515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99377126,0.0021919543,0.00066306867,0.0010072283,0.0018674276,0.0004991646],"domain_scores_gemma":[0.99403834,0.0031733818,0.0004939133,0.0009697051,0.00088681595,0.0004378083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004427365,0.0017471986,0.0020703883,0.007127675,0.0041240975,0.012411569,0.006432709,0.0044876155,0.011046898],"category_scores_gemma":[0.0102327205,0.0023737801,0.005484164,0.00648606,0.014425437,0.028277153,0.008623914,0.008093907,0.0013898562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001513451,0.000016079412,0.00004542707,0.00004163247,0.0000100820935,0.0000375976,0.0003732884,0.00035203827,0.00019480662,0.99477684,0.00049762294,0.0036393146],"study_design_scores_gemma":[0.000008914274,0.000010643167,0.00006939098,0.000021573976,0.000013349369,0.00008193358,0.00014532903,0.0027379296,0.00023231246,0.9930601,0.0036033608,0.000015137468],"about_ca_topic_score_codex":0.0016728585,"about_ca_topic_score_gemma":0.0021921583,"teacher_disagreement_score":0.012411569,"about_ca_system_score_codex":0.00409579,"about_ca_system_score_gemma":0.0018902968,"threshold_uncertainty_score":0.036955535},"labels":[],"label_agreement":null},{"id":"W1853472211","doi":"10.1007/978-3-642-30950-2_105","title":"The Effectiveness of a Pedagogical Agent’s Immediate Feedback on Learners’ Metacognitive Judgments during Learning with MetaTutor","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Metacognition; Overconfidence effect; Session (web analytics); Computer science; Cognition; Control (management); Adaptive hypermedia; Hypermedia; Feeling; Psychology; Metamemory; Cognitive psychology; Artificial intelligence; Multimedia; Social psychology; World Wide Web","score_opus":0.037140766064191554,"score_gpt":0.27092368130358335,"score_spread":0.2337829152393918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853472211","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.99747485,0.00015292664,0.00075152697,0.000023388024,0.000026810538,0.000020681,0.000041171188,0.000060304734,0.0014484404],"genre_scores_gemma":[0.99697804,0.000109731904,0.0017463898,0.000021219112,0.000015374715,0.00004862516,0.000067734734,0.00003103374,0.0009819292],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990277,0.00045301512,0.000117803604,0.00018994551,0.00015159324,0.000059911792],"domain_scores_gemma":[0.9701681,0.02629447,0.0011802485,0.0010529747,0.00063156796,0.0006726332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492232,0.0003880456,0.00040059906,0.00030461999,0.00015853868,0.0008263301,0.00052963267,0.000682445,0.0028255885],"category_scores_gemma":[0.024501938,0.0002501889,0.00023429304,0.00019224234,0.00021020592,0.0010580997,0.00069950015,0.00066965836,0.00037947248],"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.060983792,0.008097837,0.046208117,0.0016558322,0.0007240511,0.000344257,0.006809622,0.0055946894,0.2914098,0.00071206846,0.0016404024,0.57581955],"study_design_scores_gemma":[0.0029376135,0.06872187,0.5422454,0.0005568538,0.003155363,0.0010567056,0.002111901,0.04759046,0.32463545,0.0015472918,0.0051943525,0.00024680232],"about_ca_topic_score_codex":0.000528974,"about_ca_topic_score_gemma":0.00046892485,"teacher_disagreement_score":0.0028255885,"about_ca_system_score_codex":0.00012100404,"about_ca_system_score_gemma":0.00024022153,"threshold_uncertainty_score":0.009452522},"labels":[],"label_agreement":null},{"id":"W1853645231","doi":"10.1007/11901181_50","title":"iQL: A Query Language for the Instance-Based Data Model","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Query language; Exploit; Class (philosophy); Query optimization; Sargable; Data control language; Data model (GIS); RDF query language; Programming language; Relational database; Query by Example; Object (grammar); Information retrieval; Artificial intelligence; Web query classification; Web search query; Search engine","score_opus":0.035230106636358866,"score_gpt":0.2768388598100966,"score_spread":0.24160875317373773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853645231","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.00080330676,0.0002978729,0.94445205,0.0006533479,0.0001296927,0.00022433842,0.007033462,0.04340086,0.0030050334],"genre_scores_gemma":[0.04629199,0.0012999376,0.87540615,0.003053776,0.0003466692,0.0014775238,0.036735658,0.02583212,0.009556242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949774,0.0009335712,0.0010057897,0.0006145892,0.002110994,0.000357572],"domain_scores_gemma":[0.99497545,0.0022220958,0.00037971282,0.0013071428,0.0008471892,0.000268377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055289185,0.001772767,0.002362255,0.002972335,0.0010945069,0.0069919894,0.0063009067,0.0026757494,0.018131508],"category_scores_gemma":[0.012969942,0.002271009,0.0028613147,0.0037264514,0.002221026,0.013201884,0.006051599,0.0059016505,0.011825557],"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.00073183735,0.00023410018,0.0017273619,0.0026611846,0.00020770758,0.0005928815,0.001592149,0.012674785,0.017732084,0.38372245,0.32416221,0.25396124],"study_design_scores_gemma":[0.00031602613,0.00014583072,0.0005016887,0.000528561,0.00019587527,0.0008693517,0.00030982142,0.109259844,0.031175764,0.26785997,0.5885126,0.00032471778],"about_ca_topic_score_codex":0.0044777314,"about_ca_topic_score_gemma":0.0037384504,"teacher_disagreement_score":0.018131508,"about_ca_system_score_codex":0.0022170846,"about_ca_system_score_gemma":0.0026915797,"threshold_uncertainty_score":0.060655892},"labels":[],"label_agreement":null},{"id":"W1853731358","doi":"10.1007/978-3-642-38233-8_14","title":"Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Price of stability; Stability (learning theory); Combinatorics; Nash equilibrium; Shapley value; Function (biology); Mathematics; Undirected graph; Discrete mathematics; Computer science; Mathematical economics; Game theory; Graph; Mathematical analysis; Economics","score_opus":0.09273870334345653,"score_gpt":0.30727903446057636,"score_spread":0.21454033111711984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853731358","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.117263064,0.0030507937,0.7550694,0.004859404,0.00091793993,0.00025398788,0.000721814,0.0008008553,0.11706275],"genre_scores_gemma":[0.8695334,0.001565183,0.1076222,0.0012425799,0.0008051821,0.00030013846,0.00045192416,0.00059231144,0.017887034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595886,0.0018688487,0.00014190677,0.00069312,0.00080149766,0.00053572375],"domain_scores_gemma":[0.9666104,0.027556272,0.00081961474,0.0025873962,0.0012529802,0.0011733198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049339198,0.0026906813,0.0037157673,0.0018182115,0.0017345787,0.0051161144,0.0062044696,0.004230195,0.020705726],"category_scores_gemma":[0.03269148,0.0013800728,0.0018695374,0.002704747,0.004109972,0.0125200655,0.0056738425,0.008083443,0.0025959958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086110027,0.0005051822,0.0010978912,0.0006026654,0.00016274054,0.0002297894,0.00039212615,0.22445385,0.003701572,0.68523103,0.017772716,0.06498936],"study_design_scores_gemma":[0.000069798574,0.0001012712,0.00023735146,0.0000513617,0.000037718084,0.000053503303,0.000056552857,0.38721225,0.0005923211,0.61012626,0.0014279058,0.000033743112],"about_ca_topic_score_codex":0.0021134194,"about_ca_topic_score_gemma":0.002744004,"teacher_disagreement_score":0.020705726,"about_ca_system_score_codex":0.003709268,"about_ca_system_score_gemma":0.0025115972,"threshold_uncertainty_score":0.06926757},"labels":[],"label_agreement":null},{"id":"W1853801442","doi":"10.1007/978-3-540-39903-2_111","title":"Tuning and Comparing Spatial Normalization Methods","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Normalization (sociology); Computer science; Spatial normalization; Algorithm; Artificial intelligence; Process (computing); Data mining","score_opus":0.02977655063255259,"score_gpt":0.3215934126039935,"score_spread":0.2918168619714409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853801442","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.18627019,0.006452577,0.7851528,0.00036580447,0.0006025669,0.00043048034,0.0010698957,0.011621197,0.008034421],"genre_scores_gemma":[0.4248114,0.0012033025,0.56166726,0.00018033733,0.00012693109,0.00028990023,0.0036242453,0.0031686083,0.0049281083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99371064,0.0021073285,0.00061026466,0.0016156138,0.0015956002,0.00036042207],"domain_scores_gemma":[0.98535025,0.007453385,0.00057042454,0.0028720207,0.0035585316,0.00019533669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009688897,0.0016468265,0.0014799654,0.0036651883,0.0011588136,0.0027259884,0.0026370273,0.0017590257,0.0046303025],"category_scores_gemma":[0.028269963,0.0008254318,0.0011515712,0.0033323953,0.00094339176,0.0037154264,0.0020572373,0.0010047269,0.0018368477],"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.001459008,0.000363962,0.0064726355,0.0006400916,0.0006567217,0.000063322615,0.00020243147,0.09119629,0.036947485,0.0053467047,0.008899221,0.8477521],"study_design_scores_gemma":[0.0001675454,0.0004600934,0.01031198,0.00010347404,0.0005167494,0.0002641894,0.00039706644,0.87437063,0.09218569,0.013117959,0.00800142,0.00010313936],"about_ca_topic_score_codex":0.008576618,"about_ca_topic_score_gemma":0.010475851,"teacher_disagreement_score":0.009688897,"about_ca_system_score_codex":0.0016449279,"about_ca_system_score_gemma":0.0015060825,"threshold_uncertainty_score":0.051240385},"labels":[],"label_agreement":null},{"id":"W1853876455","doi":"10.1007/3-540-36400-5_10","title":"Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Elliptic curve cryptography; Very long instruction word; Power analysis; Elliptic Curve Digital Signature Algorithm; Embedded system; Cryptography; Wireless; Smart card; Computer hardware; Computer network; Computer security; Encryption; Public-key cryptography; Telecommunications","score_opus":0.013617853898622584,"score_gpt":0.28369485172872855,"score_spread":0.27007699783010597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853876455","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.73416835,0.0017345359,0.23612109,0.0008823215,0.0000776139,0.0001469012,0.0001130931,0.0011912402,0.025564859],"genre_scores_gemma":[0.981079,0.00038692486,0.01476678,0.000042753527,0.000058164813,0.000023600294,0.000050288985,0.00009404462,0.0034984462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852234,0.0003231037,0.00006695141,0.00014700677,0.0007028198,0.00023784194],"domain_scores_gemma":[0.992214,0.0051447283,0.00062252546,0.0013761686,0.0005273391,0.00011531976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015940883,0.0009197491,0.00070027256,0.0016919031,0.0005157315,0.0016760526,0.0008998489,0.0011007766,0.0048803687],"category_scores_gemma":[0.010055672,0.00038206493,0.0007328532,0.000993511,0.0014025551,0.003126254,0.00098714,0.0011853408,0.0006872087],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032296844,0.00054644624,0.0051245145,0.00040042587,0.0002182755,0.0007609419,0.00051645044,0.44267896,0.09441552,0.25133282,0.0036548031,0.19712114],"study_design_scores_gemma":[0.000064228836,0.00042389744,0.00068444083,0.000028148754,0.000089271365,0.00049278076,0.000069962596,0.93238246,0.023860933,0.040624563,0.0012544416,0.000024877367],"about_ca_topic_score_codex":0.00018966803,"about_ca_topic_score_gemma":0.00024081844,"teacher_disagreement_score":0.0048803687,"about_ca_system_score_codex":0.00092768454,"about_ca_system_score_gemma":0.00056809484,"threshold_uncertainty_score":0.016326487},"labels":[],"label_agreement":null},{"id":"W1854300463","doi":"10.1007/978-3-540-72990-7_27","title":"Generating LRD Traffic Traces Using Bootstrapping","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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":"Multifractal system; Computer science; Bootstrapping (finance); Internet traffic; Wavelet; Data set; Algorithm; Pattern recognition (psychology); Data mining; Artificial intelligence; Mathematics; Fractal; The Internet; Econometrics","score_opus":0.06539196416180564,"score_gpt":0.24882313070202342,"score_spread":0.1834311665402178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854300463","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.1699106,0.00012605828,0.8234075,0.00012808152,0.000088047695,0.00013221496,0.0005488089,0.0044392413,0.0012194178],"genre_scores_gemma":[0.78101254,0.00008037138,0.21538809,0.000054423082,0.0000619918,0.00014785999,0.0021958477,0.00020733733,0.0008514973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926084,0.00028306054,0.000035757486,0.00013764609,0.00021333116,0.000069389],"domain_scores_gemma":[0.9931465,0.0038564361,0.0003264725,0.001569096,0.000892188,0.00020919225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017381997,0.0006492903,0.00083134166,0.0016105031,0.0003502756,0.0006512133,0.0016232266,0.0013344168,0.0019672269],"category_scores_gemma":[0.01246298,0.00064819714,0.00082601793,0.0013933205,0.00044774584,0.0010449368,0.0011713783,0.0010577121,0.0010830685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005043759,0.00037018603,0.010949177,0.00014649556,0.00012897106,0.00049218134,0.00014032036,0.7759944,0.00951257,0.010645605,0.003913247,0.18720248],"study_design_scores_gemma":[0.000008290633,0.000013171987,0.00032521095,0.0000031914321,0.0000035646215,0.000035076522,0.000004978658,0.9963104,0.0007684943,0.0023647477,0.00015847266,0.000004344907],"about_ca_topic_score_codex":0.0019601954,"about_ca_topic_score_gemma":0.0017056534,"teacher_disagreement_score":0.0019672269,"about_ca_system_score_codex":0.000411209,"about_ca_system_score_gemma":0.0004401296,"threshold_uncertainty_score":0.009192646},"labels":[],"label_agreement":null},{"id":"W1854452706","doi":"10.1007/978-3-642-03013-0_16","title":"Supporting Framework Use via Automatically Extracted Concept-Implementation Templates","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":28,"is_retracted":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":"Template; Computer science; Documentation; Code (set theory); Software engineering; Proof of concept; Programming language; Set (abstract data type); Operating system","score_opus":0.02232149777068025,"score_gpt":0.3241798272673513,"score_spread":0.301858329496671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854452706","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.011612177,0.00025907735,0.92432153,0.00018965914,0.00010366964,0.0003922531,0.0016819463,0.055650957,0.0057887943],"genre_scores_gemma":[0.09868902,0.0003432653,0.88332343,0.00012379343,0.000031565596,0.00039512385,0.0045728264,0.009023325,0.0034976834],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801743,0.00039387553,0.0002451434,0.0003616927,0.0008210112,0.00016093784],"domain_scores_gemma":[0.9886258,0.007524633,0.00070872507,0.0017910398,0.0011590221,0.00019077896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989024,0.0016426945,0.000916082,0.0026323036,0.0005613431,0.0036411122,0.0026088979,0.0016714813,0.013284229],"category_scores_gemma":[0.024539175,0.0015942248,0.0016154996,0.0014565914,0.0005852902,0.004948815,0.0022232346,0.0021490883,0.005689054],"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.00060754135,0.00047657595,0.0068555083,0.001932612,0.00018804445,0.0018167013,0.002655368,0.016292393,0.044771858,0.047758102,0.045457747,0.83118755],"study_design_scores_gemma":[0.0003030712,0.00019961061,0.0032934449,0.0015855682,0.0005404395,0.0027275148,0.00089211133,0.48993075,0.17941758,0.065361224,0.25542697,0.00032172812],"about_ca_topic_score_codex":0.0027398719,"about_ca_topic_score_gemma":0.005475537,"teacher_disagreement_score":0.013284229,"about_ca_system_score_codex":0.0006766771,"about_ca_system_score_gemma":0.0024147008,"threshold_uncertainty_score":0.04444021},"labels":[],"label_agreement":null},{"id":"W18545325","doi":"10.1007/978-3-642-23629-7_12","title":"Detecting Structure in Diffusion Tensor MR Images","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Diffusion MRI; Computer science; Tensor (intrinsic definition); Structure tensor; Curse of dimensionality; Curvature; Feature (linguistics); Diffusion; Artificial intelligence; Differential (mechanical device); Manifold (fluid mechanics); Dimensionality reduction; Pattern recognition (psychology); Computer vision; Image (mathematics); Mathematics; Physics; Pure mathematics; Geometry; Magnetic resonance imaging","score_opus":0.045158095133525394,"score_gpt":0.31949255465252796,"score_spread":0.2743344595190026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18545325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3450983,0.0018186774,0.6494591,0.00073050207,0.00014071257,0.00009961681,0.0004148221,0.00082255783,0.0014157863],"genre_scores_gemma":[0.5961765,0.003190202,0.3964129,0.00012141728,0.00024481583,0.00004241642,0.00077695533,0.0002864642,0.0027482721],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998049,0.000031275144,0.000017055514,0.000046291534,0.00007172475,0.0000287457],"domain_scores_gemma":[0.99871206,0.0005235856,0.00026773347,0.00015000363,0.00023152662,0.00011502593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065521564,0.0008765988,0.0005406994,0.0023052238,0.00043910876,0.0014454714,0.0005393082,0.00097451627,0.0009728604],"category_scores_gemma":[0.004168896,0.0007030824,0.00048351733,0.0010870451,0.000535803,0.0015147711,0.0006144564,0.00085473154,0.0005640322],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004957533,0.00014520416,0.010961378,0.00046373802,0.000155276,0.0009999061,0.00033470528,0.01985178,0.581816,0.006497742,0.0029241748,0.37535426],"study_design_scores_gemma":[0.000082023595,0.00050038914,0.026604252,0.00011047233,0.00030621188,0.0038112083,0.00040967,0.6103831,0.31626096,0.035186637,0.00621689,0.00012809187],"about_ca_topic_score_codex":0.0016160366,"about_ca_topic_score_gemma":0.0025377232,"teacher_disagreement_score":0.0023052238,"about_ca_system_score_codex":0.00021768427,"about_ca_system_score_gemma":0.000579351,"threshold_uncertainty_score":0.0034651756},"labels":[],"label_agreement":null},{"id":"W1854561485","doi":"10.1007/978-3-642-33290-6_51","title":"Diva: A Web-Based High-Resolution Digital Document Viewer","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Diva; Computer science; World Wide Web; Web application; Computer graphics (images); Information retrieval; Art","score_opus":0.012813946223871723,"score_gpt":0.2289692785660168,"score_spread":0.21615533234214507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854561485","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006812623,0.002349213,0.39267886,0.0007760984,0.0008532418,0.0005431959,0.050807644,0.4263115,0.11886773],"genre_scores_gemma":[0.06897358,0.004094145,0.38991797,0.001567456,0.0006247611,0.0012434591,0.109842986,0.13818373,0.2855519],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966884,0.000036265657,0.000027232583,0.000054916978,0.00017544144,0.000037277096],"domain_scores_gemma":[0.998628,0.0005074605,0.000055702305,0.00025729847,0.0003945772,0.00015693728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084837986,0.0011890178,0.00087930996,0.0026797443,0.000546037,0.0031978164,0.0021754059,0.0012985447,0.1598009],"category_scores_gemma":[0.002391953,0.00076892064,0.00080829696,0.0019684827,0.0002957092,0.0030861173,0.0019572452,0.0015495429,0.06460921],"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.00048027674,0.00011331618,0.00057073723,0.0010315032,0.00007307533,0.00041610652,0.00037429575,0.0010506719,0.027132042,0.008124807,0.64427173,0.3163615],"study_design_scores_gemma":[0.00014159318,0.00005562808,0.0016019923,0.00021199315,0.00005748434,0.0012047236,0.0002367563,0.01741096,0.032607842,0.011088268,0.935269,0.00011362433],"about_ca_topic_score_codex":0.0010902586,"about_ca_topic_score_gemma":0.0019557506,"teacher_disagreement_score":0.1598009,"about_ca_system_score_codex":0.0004305971,"about_ca_system_score_gemma":0.00057491683,"threshold_uncertainty_score":0.53458726},"labels":[],"label_agreement":null},{"id":"W1854621565","doi":"10.1007/11866763_74","title":"A High-Order Solution for the Distribution of Target Registration Error in Rigid-Body Point-Based Registration","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Point (geometry); Image registration; Distribution (mathematics); Point distribution model; Computer vision; Rigid body; Artificial intelligence; Algorithm; Mathematics; Geometry; Mathematical analysis","score_opus":0.008881138588796175,"score_gpt":0.2245808183224281,"score_spread":0.2156996797336319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854621565","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.0009399208,0.00004194943,0.9985045,0.000039114897,0.00001756977,0.000011768527,0.000015656742,0.00013520381,0.00029426566],"genre_scores_gemma":[0.081295826,0.0004173507,0.907473,0.0001252193,0.00010177404,0.00019211805,0.0002483853,0.00073729333,0.009409042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.00014769271,0.000043832264,0.00011117831,0.0003338094,0.00006063852],"domain_scores_gemma":[0.99773115,0.0011370874,0.00017923619,0.00029513988,0.0005521964,0.000105226536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038909,0.0011954933,0.0011951369,0.0011150786,0.00081714283,0.0015579647,0.0017881085,0.0026801813,0.0047982153],"category_scores_gemma":[0.007905803,0.0013513409,0.0012317237,0.001378658,0.0013647595,0.0026949919,0.001757004,0.0026534407,0.002629481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000834347,0.000055855482,0.00041232587,0.00018393494,0.00004575709,0.00011888389,0.00018834874,0.87675476,0.00802028,0.04435393,0.0026607837,0.06712174],"study_design_scores_gemma":[0.0000056274034,0.000007244849,0.00008108513,0.0000066638245,0.0000043507807,0.000031659358,0.000008675383,0.9927562,0.0008797768,0.005558924,0.0006499988,0.000009826859],"about_ca_topic_score_codex":0.0070283986,"about_ca_topic_score_gemma":0.01013056,"teacher_disagreement_score":0.0070283986,"about_ca_system_score_codex":0.0013767305,"about_ca_system_score_gemma":0.0028745474,"threshold_uncertainty_score":0.01605159},"labels":[],"label_agreement":null},{"id":"W1854723381","doi":"10.1007/978-3-540-87355-6_3","title":"Strategy-Trees: A Feedback Based Approach to Policy Management","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Western University","funders":"","keywords":"Computer science; Tree (set theory); Set (abstract data type); Abstraction; Directive; Architecture; Operations research; Process management; Programming language","score_opus":0.04370282045257278,"score_gpt":0.28130193432145045,"score_spread":0.23759911386887766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854723381","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.0019356393,0.00009377978,0.991617,0.0002836429,0.00005371307,0.00007391368,0.00011952573,0.0014923436,0.0043304255],"genre_scores_gemma":[0.17655659,0.00035105378,0.81393266,0.00029762194,0.00010574143,0.00033644095,0.00040785054,0.0005006143,0.007511485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711585,0.001397147,0.00014538004,0.00026395108,0.0009271817,0.00015047885],"domain_scores_gemma":[0.99405956,0.00441551,0.00025656313,0.00054411526,0.00047154858,0.00025278673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047493656,0.0009067044,0.0011295005,0.0015653833,0.0009227128,0.002929856,0.0024271253,0.0016534202,0.011832741],"category_scores_gemma":[0.011634633,0.00062012736,0.0009804762,0.002096281,0.0013185405,0.0048439982,0.0020386162,0.0025681902,0.0018234964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024279284,0.00031219234,0.0006680886,0.00023716482,0.00010122959,0.00012466483,0.00059588294,0.2008145,0.0019979412,0.44640732,0.016653376,0.33184484],"study_design_scores_gemma":[0.000033264394,0.000037609545,0.00006924596,0.000027785569,0.00003024304,0.000028825927,0.00006004477,0.6972268,0.0012053386,0.29252508,0.008737254,0.000018453326],"about_ca_topic_score_codex":0.005093868,"about_ca_topic_score_gemma":0.006381668,"teacher_disagreement_score":0.011832741,"about_ca_system_score_codex":0.0015902551,"about_ca_system_score_gemma":0.0023772041,"threshold_uncertainty_score":0.039584458},"labels":[],"label_agreement":null},{"id":"W185475015","doi":"10.1007/978-3-642-23199-5_18","title":"Sensitivity Analysis for Weak Constraint Generation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sensitivity (control systems); Constraint (computer-aided design); Domain (mathematical analysis); Mathematical optimization; Cluster analysis; Sample (material); Plan (archaeology); Artificial intelligence; Mathematics","score_opus":0.03718666369405884,"score_gpt":0.24780274004657218,"score_spread":0.21061607635251334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185475015","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.0077157053,0.0005647732,0.9830495,0.0003282896,0.000068563335,0.00015229963,0.00017028842,0.0003600649,0.0075905435],"genre_scores_gemma":[0.69338757,0.0011620502,0.29356718,0.00057901413,0.00028075042,0.0007837591,0.00080216373,0.0007186478,0.008718697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99175996,0.0049838405,0.00027749018,0.0006211716,0.0018471692,0.0005103518],"domain_scores_gemma":[0.9472428,0.047520466,0.0011174309,0.001690203,0.0020246394,0.00040443963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010273662,0.0023621137,0.0023797997,0.0037251187,0.0009414442,0.0028341073,0.0027627912,0.0017715945,0.009656554],"category_scores_gemma":[0.053811885,0.0017276685,0.0030043584,0.0025968428,0.0030959358,0.004348534,0.004150465,0.004015292,0.0006753983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001775764,0.000062695275,0.00034470335,0.000254969,0.0001303319,0.00008992836,0.00007378283,0.8491608,0.00091070245,0.11728808,0.0019227137,0.029583793],"study_design_scores_gemma":[0.000008190523,0.000017891898,0.00006272688,0.0000224698,0.000017224693,0.000015471585,0.000007447776,0.8990305,0.00032405966,0.10014538,0.0003387021,0.0000100299385],"about_ca_topic_score_codex":0.0036487803,"about_ca_topic_score_gemma":0.0016735411,"teacher_disagreement_score":0.010273662,"about_ca_system_score_codex":0.0027315838,"about_ca_system_score_gemma":0.0017533563,"threshold_uncertainty_score":0.05433297},"labels":[],"label_agreement":null},{"id":"W1854985511","doi":"10.1007/978-3-642-22321-1_15","title":"Enumeration and Decidable Properties of Automatic Sequences","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Class (philosophy); Computer science; Function (biology); Sequence (biology); Characterization (materials science); Combinatorics; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence; Biology; Physics","score_opus":0.022701264572092743,"score_gpt":0.21484894919083253,"score_spread":0.1921476846187398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854985511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24519765,0.0032666607,0.6046074,0.00288223,0.0003262357,0.00017126185,0.0012742227,0.0015510344,0.14072332],"genre_scores_gemma":[0.83505684,0.0015897262,0.13327625,0.00044497257,0.0005740656,0.0004465433,0.002430616,0.00048913085,0.025691729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971206,0.00081678055,0.00026353204,0.00067119073,0.00081715104,0.0003107338],"domain_scores_gemma":[0.98435867,0.013096254,0.00052891724,0.0011950738,0.00058052485,0.00024062877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020358039,0.000841914,0.00079312274,0.0016685113,0.0016956313,0.004611513,0.0024784917,0.0012617734,0.0059216954],"category_scores_gemma":[0.011225163,0.0011323511,0.0017157423,0.0024401057,0.004596876,0.009941346,0.0020284334,0.005195644,0.00076087756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724274,0.00005795797,0.00032557998,0.00011401162,0.0000151816,0.00010506579,0.00038769512,0.003778008,0.001973827,0.9708746,0.0015375968,0.020763116],"study_design_scores_gemma":[0.000015783906,0.000009202422,0.00010966561,0.000020098903,0.00000840823,0.00007701935,0.000039083207,0.0072007114,0.00143262,0.9886672,0.00241172,0.000008520854],"about_ca_topic_score_codex":0.0010738893,"about_ca_topic_score_gemma":0.0014334557,"teacher_disagreement_score":0.0059216954,"about_ca_system_score_codex":0.0020173427,"about_ca_system_score_gemma":0.0013798664,"threshold_uncertainty_score":0.01981002},"labels":[],"label_agreement":null},{"id":"W1855173130","doi":"10.1007/11774303_24","title":"SPRITS: Secure Pedagogical Resources in Intelligent Tutoring Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Multimedia; Human–computer interaction; Software engineering","score_opus":0.04158751686636801,"score_gpt":0.27317783431508746,"score_spread":0.23159031744871944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855173130","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016852546,0.0012081364,0.93672514,0.0006222495,0.00024713916,0.00019697848,0.00030604764,0.02624387,0.017597876],"genre_scores_gemma":[0.596491,0.002751962,0.31470177,0.00065960473,0.0003436785,0.0006924363,0.0023615048,0.004946349,0.07705184],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977545,0.0005690975,0.0001831385,0.00024901444,0.00097420317,0.0002699811],"domain_scores_gemma":[0.9971095,0.0010685221,0.00015680927,0.0012361347,0.00027708762,0.00015208653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016226232,0.0009871518,0.0008953336,0.00082979555,0.0008804871,0.0036576565,0.0021375786,0.0014479093,0.011291619],"category_scores_gemma":[0.0054266034,0.0007809369,0.00055350276,0.00093779207,0.0018999631,0.007412663,0.005504362,0.0023622809,0.006654946],"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.0015383946,0.0003119658,0.00085773796,0.00069703616,0.00008524166,0.00056923646,0.0011761197,0.029444521,0.017291913,0.28923273,0.04712433,0.61167073],"study_design_scores_gemma":[0.0003318768,0.000404036,0.0008559302,0.00029803414,0.00017251458,0.0010436312,0.00047071604,0.2985292,0.101445355,0.3558053,0.24053554,0.00010782994],"about_ca_topic_score_codex":0.00088819285,"about_ca_topic_score_gemma":0.0007776509,"teacher_disagreement_score":0.011291619,"about_ca_system_score_codex":0.00060830225,"about_ca_system_score_gemma":0.00073735375,"threshold_uncertainty_score":0.037774265},"labels":[],"label_agreement":null},{"id":"W1855363286","doi":"10.1007/978-3-540-69057-3_19","title":"GPU in Haptic Rendering of Deformable Objects","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Simon Fraser University","funders":"","keywords":"Computer science; CUDA; Computer graphics (images); Graphics processing unit; Neumann series; Graphics; Computational science; Rendering (computer graphics); Von Neumann architecture; Parallel computing; Operating system","score_opus":0.014458011746972083,"score_gpt":0.20398036172936693,"score_spread":0.18952234998239484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855363286","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.033902463,0.00369289,0.924413,0.000271329,0.00042940737,0.00005379843,0.00017174485,0.004988874,0.032076426],"genre_scores_gemma":[0.4143425,0.0037236593,0.51932716,0.00021065427,0.00016426686,0.00009130489,0.00043775392,0.002186975,0.059515696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997533,0.000040722527,0.00000885453,0.000024186043,0.00014715375,0.000025730888],"domain_scores_gemma":[0.9997924,0.000101182435,0.000008941824,0.00004293087,0.000037534566,0.00001704434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024897174,0.00059272576,0.0005729227,0.00045475134,0.0002810334,0.0011123138,0.001055006,0.00078142044,0.008890704],"category_scores_gemma":[0.00076172274,0.0004666303,0.00037717953,0.0009982465,0.0004085881,0.00085061113,0.00085921126,0.0011950282,0.0018947411],"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.0008242522,0.00017125474,0.0010468703,0.0006948664,0.000091992006,0.00086673006,0.0006805384,0.120429255,0.15429091,0.09935484,0.03324127,0.58830726],"study_design_scores_gemma":[0.00008397722,0.00008922959,0.0007262763,0.00008290409,0.000022349153,0.00054256263,0.00006951745,0.8842265,0.04124584,0.01863055,0.05424966,0.000030590058],"about_ca_topic_score_codex":0.0026787706,"about_ca_topic_score_gemma":0.003777839,"teacher_disagreement_score":0.008890704,"about_ca_system_score_codex":0.00041452234,"about_ca_system_score_gemma":0.00022846005,"threshold_uncertainty_score":0.02974242},"labels":[],"label_agreement":null},{"id":"W185554932","doi":"10.1007/978-3-642-21043-3_25","title":"Base Station Controlled Intelligent Clustering Routing in Wireless Sensor Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Acadia University","funders":"","keywords":"Computer science; Base station; Wireless sensor network; Cluster analysis; Computer network; Routing (electronic design automation); Wireless; Telecommunications; Artificial intelligence","score_opus":0.019103753384736823,"score_gpt":0.23002020579279978,"score_spread":0.21091645240806295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185554932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032575272,0.0048602996,0.94436985,0.00027044586,0.0005294199,0.00008700215,0.00011445731,0.0021906,0.015002526],"genre_scores_gemma":[0.73937577,0.0045228773,0.22838874,0.00017133221,0.00034789022,0.0001566408,0.00034382832,0.00037954302,0.026313268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997719,0.000048073438,0.000008996778,0.000046336823,0.00010229438,0.000022499207],"domain_scores_gemma":[0.999828,0.000059022197,0.000016392967,0.00003873547,0.000047270107,0.000010494701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409469,0.00047169632,0.00048499953,0.0004081176,0.00031507923,0.0006434344,0.001759266,0.00059443543,0.0015254137],"category_scores_gemma":[0.0004959305,0.00029980094,0.00023580599,0.0008275045,0.00032860652,0.0007328434,0.00045579966,0.000626458,0.00058287306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033572657,0.00014761949,0.0003398598,0.00035086772,0.000096883356,0.0001094676,0.00015412283,0.49184856,0.09357089,0.038531784,0.012733803,0.36178038],"study_design_scores_gemma":[0.000018291217,0.000111700545,0.00036581358,0.000016743717,0.000029649907,0.00009665558,0.000021223324,0.9637441,0.016883355,0.007719814,0.010971891,0.000020879586],"about_ca_topic_score_codex":0.0012613625,"about_ca_topic_score_gemma":0.0016417376,"teacher_disagreement_score":0.001759266,"about_ca_system_score_codex":0.0004627824,"about_ca_system_score_gemma":0.00028252925,"threshold_uncertainty_score":0.005102992},"labels":[],"label_agreement":null},{"id":"W1855751840","doi":"10.1007/978-3-540-73345-4_39","title":"Facilitating Visual Queries in the TreeMap Using Distortion Techniques","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 Manitoba","funders":"","keywords":"Zoom; Distortion (music); Computer science; Visualization; Simple (philosophy); Space (punctuation); Theoretical computer science; Data mining","score_opus":0.04455614935199955,"score_gpt":0.3389099099083765,"score_spread":0.29435376055637696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855751840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009170031,0.00033315958,0.9771746,0.00031563314,0.00007729038,0.0001322987,0.0004093804,0.009390205,0.0029974568],"genre_scores_gemma":[0.12471123,0.0008290523,0.8651923,0.00020021369,0.000069293834,0.00022835442,0.0010934676,0.003583773,0.004092354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857235,0.00034740896,0.00009543611,0.00019251488,0.00066544465,0.00012687258],"domain_scores_gemma":[0.9944576,0.0030980743,0.00019602309,0.0012374624,0.0007651652,0.0002456386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014146881,0.0015059679,0.0013785089,0.0016342619,0.00081609393,0.004419163,0.0023912839,0.0012985583,0.015264598],"category_scores_gemma":[0.011692612,0.00079736416,0.0008645221,0.0028020847,0.000922406,0.0053855614,0.0044867103,0.00209162,0.0031331314],"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.0012549923,0.0003364195,0.001672185,0.0013221211,0.0000797438,0.00048720124,0.0031211984,0.026714996,0.11905876,0.073730186,0.057387646,0.71483463],"study_design_scores_gemma":[0.00029534163,0.00031755894,0.0011402402,0.00022384939,0.00010008878,0.0011357937,0.0015992799,0.62282777,0.16099718,0.10455105,0.10658172,0.0002300714],"about_ca_topic_score_codex":0.0031705813,"about_ca_topic_score_gemma":0.004278544,"teacher_disagreement_score":0.015264598,"about_ca_system_score_codex":0.0006225114,"about_ca_system_score_gemma":0.00095271535,"threshold_uncertainty_score":0.051065147},"labels":[],"label_agreement":null},{"id":"W1856348812","doi":"10.1007/978-3-540-72458-2_12","title":"A General Definition of an Attribute Reduct","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Reduct; Property (philosophy); Heuristics; Mathematics; Set (abstract data type); Table (database); Monotonic function; Rough set; Function (biology); Computer science; Data mining; Mathematical optimization","score_opus":0.053287233631084806,"score_gpt":0.2734619937344257,"score_spread":0.2201747601033409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856348812","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.008150322,0.003364523,0.91708684,0.0023977105,0.0013718248,0.00023328325,0.0007564754,0.00044153587,0.066197544],"genre_scores_gemma":[0.15701692,0.0037778812,0.80404717,0.0017908594,0.001583471,0.00072365126,0.0013286922,0.00026308332,0.029468348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973163,0.0004601474,0.00036485633,0.00086486805,0.00082956377,0.00016420367],"domain_scores_gemma":[0.9987379,0.00037949497,0.000077654804,0.0003321955,0.00039855094,0.000074241965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002503981,0.0011018509,0.0012032894,0.0030030322,0.001623222,0.004337313,0.002029253,0.0018749965,0.006574133],"category_scores_gemma":[0.0031308972,0.0006793999,0.0024343508,0.0031208894,0.004694939,0.0070855543,0.0030178372,0.004486246,0.002303287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013609161,0.000021175374,0.00010228153,0.000111457215,0.000025449228,0.00014887197,0.00030443244,0.0011368918,0.0010102803,0.9778658,0.0029026328,0.016357109],"study_design_scores_gemma":[0.000013701093,0.0000433549,0.00017537716,0.00008606699,0.000051875762,0.0007799742,0.00013790306,0.0063678403,0.0013274491,0.9129209,0.07806442,0.000031171814],"about_ca_topic_score_codex":0.0008141513,"about_ca_topic_score_gemma":0.00059008354,"teacher_disagreement_score":0.006574133,"about_ca_system_score_codex":0.0008952837,"about_ca_system_score_gemma":0.00092435646,"threshold_uncertainty_score":0.021992624},"labels":[],"label_agreement":null},{"id":"W1856363524","doi":"10.1007/978-3-642-18305-8_3","title":"Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Electronic circuit; Ideal (ethics); SIGNAL (programming language); Abstraction; Energy (signal processing); DNA computing; DNA; Circuit design","score_opus":0.01109552020442024,"score_gpt":0.2408510594433112,"score_spread":0.22975553923889097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856363524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30240637,0.025313964,0.5928488,0.0023579192,0.002235275,0.00053052604,0.0015945901,0.0075801993,0.065132394],"genre_scores_gemma":[0.72433394,0.0066015343,0.20297319,0.0010335946,0.00022842473,0.00036173922,0.0007458688,0.0002994625,0.063422255],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997576,0.000010280278,0.000009139825,0.00006654366,0.00012154098,0.000034886423],"domain_scores_gemma":[0.99987364,0.00005279923,0.00002502405,0.000014965903,0.000020088604,0.000013453529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015603591,0.00053484755,0.00039883517,0.0002497118,0.0001917925,0.00074408005,0.0022699882,0.00079101836,0.0055931625],"category_scores_gemma":[0.00029430236,0.00040475864,0.00029467436,0.00031934178,0.0003330637,0.001257431,0.0007167773,0.0009457114,0.0019230017],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004534717,0.000038101607,0.000028675398,0.00016850028,0.0000091374895,0.000041296986,0.000027497525,0.001392792,0.96816975,0.0030472116,0.000988891,0.026042784],"study_design_scores_gemma":[0.000029245459,0.00021092546,0.0001570859,0.000019234298,0.000013661667,0.00017288845,0.000021595633,0.018959383,0.95839345,0.0016721253,0.02032628,0.000024169385],"about_ca_topic_score_codex":0.00021926114,"about_ca_topic_score_gemma":0.00073156646,"teacher_disagreement_score":0.0055931625,"about_ca_system_score_codex":0.00060896674,"about_ca_system_score_gemma":0.00019958083,"threshold_uncertainty_score":0.01871097},"labels":[],"label_agreement":null},{"id":"W1856521710","doi":"10.1007/3-540-44566-8_26","title":"Modeling Exploratory Behaviour","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health Research Topics","field":"Psychology","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 British Columbia","funders":"","keywords":"Computer science; Exploratory research; Bayesian network; Exploratory analysis; User modeling; Exploratory search; Personality; Big Five personality traits; Human–computer interaction; Artificial intelligence; Data science; Machine learning; User interface; Psychology; Social psychology","score_opus":0.11698249873577171,"score_gpt":0.3942859595685144,"score_spread":0.2773034608327427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856521710","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.07296914,0.0008964979,0.89080346,0.0005765294,0.00007475406,0.00008441086,0.0009611404,0.0015857668,0.03204833],"genre_scores_gemma":[0.7709563,0.0009766258,0.18802597,0.00010171052,0.00005042902,0.0004388176,0.002067086,0.00048434446,0.03689872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997546,0.000105200284,0.000007945544,0.00006649887,0.00003491861,0.000030813095],"domain_scores_gemma":[0.9980952,0.0014445315,0.000077183606,0.00022530074,0.00008482751,0.00007293276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074917113,0.00070501276,0.0006448744,0.00084199343,0.0004279497,0.0013124688,0.0010298309,0.00079727825,0.013546803],"category_scores_gemma":[0.0048493887,0.0005156413,0.0012335171,0.00082870945,0.00048402202,0.0015310701,0.0007518278,0.0010775744,0.0021585298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001538329,0.0003018163,0.009881648,0.00021759816,0.00020647846,0.00016788718,0.00078296877,0.447797,0.0021987895,0.35729292,0.011036515,0.16996256],"study_design_scores_gemma":[0.000010126943,0.000023373155,0.0011483794,0.000023473856,0.00002761966,0.00004935617,0.000060046154,0.8772307,0.00044174647,0.11742102,0.0035537109,0.000010416709],"about_ca_topic_score_codex":0.0062837177,"about_ca_topic_score_gemma":0.005345966,"teacher_disagreement_score":0.013546803,"about_ca_system_score_codex":0.00057436613,"about_ca_system_score_gemma":0.00046550672,"threshold_uncertainty_score":0.045318544},"labels":[],"label_agreement":null},{"id":"W1856713069","doi":"10.1007/978-3-642-30885-7_9","title":"Extending Alloy with Partial Instances","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Syntax; MODELLER; Programming language; Partial evaluation; Artificial intelligence","score_opus":0.016286544118567125,"score_gpt":0.23492886984228908,"score_spread":0.21864232572372197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856713069","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.031412415,0.00091659225,0.89233553,0.0004881378,0.00027674582,0.00012188313,0.00049492955,0.0070414855,0.06691233],"genre_scores_gemma":[0.2592309,0.0014959021,0.70057666,0.00033274209,0.00013242346,0.00012828449,0.0017728644,0.0031448922,0.033185463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989229,0.00019308084,0.00010800044,0.00017610296,0.00050949596,0.00009038036],"domain_scores_gemma":[0.99911755,0.00030106577,0.000033989883,0.00039596434,0.00012463992,0.000026833417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568897,0.0009523868,0.00068351737,0.0010206375,0.00062499335,0.0018756541,0.0016134161,0.00064203655,0.0060858233],"category_scores_gemma":[0.002360305,0.00094181707,0.0018521158,0.0011862885,0.000989699,0.0037054569,0.0027607072,0.0016177185,0.0025410373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016834326,0.00012607749,0.000974107,0.00057170884,0.000096244476,0.00082103244,0.0006642427,0.023571817,0.018136771,0.47571656,0.009142861,0.47001028],"study_design_scores_gemma":[0.000042747703,0.00009807975,0.0003484193,0.00025290178,0.00022510954,0.0013941451,0.0002242362,0.09238528,0.03581998,0.60744935,0.26168996,0.00006978601],"about_ca_topic_score_codex":0.0009575137,"about_ca_topic_score_gemma":0.0019648008,"teacher_disagreement_score":0.0060858233,"about_ca_system_score_codex":0.00047782678,"about_ca_system_score_gemma":0.0006077949,"threshold_uncertainty_score":0.020359099},"labels":[],"label_agreement":null},{"id":"W1856766194","doi":"10.1007/978-3-642-21596-4_25","title":"Lossless Compression of Satellite Image Sets Using Spatial Area Overlap Compensation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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 Lethbridge","funders":"","keywords":"Lossless compression; Computer science; Data compression; Image compression; Artificial intelligence; Computer vision; Set (abstract data type); Compression (physics); Image (mathematics); Satellite; Pattern recognition (psychology); Image processing","score_opus":0.03627776436042709,"score_gpt":0.28479161270061265,"score_spread":0.24851384834018556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856766194","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.25889552,0.0014868007,0.726833,0.00027936077,0.0002307613,0.00007518643,0.0005093604,0.001281092,0.010408913],"genre_scores_gemma":[0.68723196,0.001306813,0.29715213,0.00011345739,0.00020651145,0.000076743345,0.0011807546,0.0001671958,0.012564418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998417,0.000013680327,0.0000066302105,0.000013634597,0.00011136712,0.000013000885],"domain_scores_gemma":[0.99979633,0.00007910848,0.000018710467,0.000061285216,0.000037910435,0.000006678379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013377123,0.0003574249,0.00028755696,0.00057253457,0.00017410153,0.00040652658,0.00037703646,0.0002633606,0.0015529986],"category_scores_gemma":[0.0005774499,0.00014889243,0.00020254016,0.0008862422,0.00025051806,0.00060888694,0.000438117,0.00033983917,0.00045179535],"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.00072788884,0.00012766036,0.00058445527,0.00022256168,0.00006174606,0.00035841053,0.00016811697,0.06043603,0.31656358,0.009482096,0.004517714,0.6067498],"study_design_scores_gemma":[0.000050883995,0.00023828106,0.005024193,0.000056343546,0.000057450878,0.001482469,0.00009059909,0.6370074,0.33695903,0.0073385304,0.011662847,0.00003187952],"about_ca_topic_score_codex":0.0006130294,"about_ca_topic_score_gemma":0.0010359441,"teacher_disagreement_score":0.0015529986,"about_ca_system_score_codex":0.00017484283,"about_ca_system_score_gemma":0.00013010984,"threshold_uncertainty_score":0.0051953197},"labels":[],"label_agreement":null},{"id":"W1856930045","doi":"10.1007/978-3-642-15711-0_39","title":"C-arm Pose Estimation in Prostate Brachytherapy by Registration to Ultrasound","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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 British Columbia; Queen's University","funders":"","keywords":"Fiducial marker; Fluoroscopy; Imaging phantom; Prostate brachytherapy; Image registration; Brachytherapy; Ground truth; Medicine; 3D ultrasound; Ultrasound; Computer science; Nuclear medicine; Rotation (mathematics); Artificial intelligence; Computer vision; Translation (biology); Radiology; Radiation therapy; Image (mathematics)","score_opus":0.004562254601736422,"score_gpt":0.27552769893157647,"score_spread":0.27096544432984004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856930045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05870854,0.0028975385,0.93124545,0.00025036212,0.000107465195,0.00015029356,0.00026115676,0.0032091965,0.0031700847],"genre_scores_gemma":[0.662127,0.0026228004,0.32475194,0.00026049357,0.00012285405,0.00019042676,0.0006880892,0.0011669615,0.008069535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993482,0.00020216362,0.00003680037,0.00013150396,0.00020891683,0.0000723408],"domain_scores_gemma":[0.99936,0.0002949667,0.000115471295,0.0000780891,0.000112875925,0.000038721035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085347414,0.001021205,0.00093361083,0.0010634937,0.00040295973,0.0011914542,0.0007906646,0.0010996294,0.0024540643],"category_scores_gemma":[0.0024039722,0.00090017257,0.0009506403,0.001346284,0.00031428723,0.00066500227,0.0009033586,0.001060506,0.0016108381],"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.0015773942,0.00022894431,0.0048937565,0.00048724073,0.00020537588,0.00021552703,0.00023763183,0.097007476,0.20782982,0.0011298173,0.0047958223,0.68139124],"study_design_scores_gemma":[0.00008337336,0.0006623848,0.022103433,0.0000922697,0.00033582645,0.0013316197,0.00012853504,0.81461453,0.14991203,0.0016953873,0.008906513,0.00013409091],"about_ca_topic_score_codex":0.00463156,"about_ca_topic_score_gemma":0.0058506564,"teacher_disagreement_score":0.00463156,"about_ca_system_score_codex":0.00038263298,"about_ca_system_score_gemma":0.0011956259,"threshold_uncertainty_score":0.009209156},"labels":[],"label_agreement":null},{"id":"W1857035554","doi":"10.1007/3-540-36288-6_16","title":"Validation of Elliptic Curve Public Keys","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Elliptic curve cryptography; Public-key cryptography; Elliptic curve; Elliptic curve point multiplication; Key (lock); Computer security; Encryption; Protocol (science); Point (geometry); Curve25519; Computer network; Mathematics","score_opus":0.03536184863177191,"score_gpt":0.2667073088965999,"score_spread":0.23134546026482797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857035554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09337238,0.0019634478,0.85463226,0.0021941422,0.0009247891,0.0002873259,0.00044505467,0.0034553434,0.042725213],"genre_scores_gemma":[0.8709127,0.001183331,0.09218552,0.00039083083,0.00024671722,0.00017908623,0.0011612123,0.000978755,0.032761943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98866946,0.004016364,0.0006575063,0.0009754554,0.0048409975,0.0008402182],"domain_scores_gemma":[0.97384155,0.011039027,0.0011869521,0.010021549,0.0036300402,0.00028091992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006569136,0.00077504007,0.0011089483,0.0011327831,0.0012193078,0.004265157,0.001731599,0.0029199105,0.007215142],"category_scores_gemma":[0.02973726,0.0009253602,0.00074292824,0.0010664657,0.0025495721,0.008967397,0.0040577264,0.0030199026,0.0030010983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012843201,0.0002074434,0.002800247,0.00060114847,0.000099452205,0.0006548992,0.0012569978,0.031329773,0.04606578,0.56107455,0.015841747,0.33878374],"study_design_scores_gemma":[0.00016831626,0.0002852461,0.00087863323,0.0005282955,0.00006225469,0.0010339007,0.0003078316,0.16087535,0.20207189,0.56526244,0.06837961,0.00014614186],"about_ca_topic_score_codex":0.00030126076,"about_ca_topic_score_gemma":0.00021091283,"teacher_disagreement_score":0.007215142,"about_ca_system_score_codex":0.0013176906,"about_ca_system_score_gemma":0.0014586943,"threshold_uncertainty_score":0.034741282},"labels":[],"label_agreement":null},{"id":"W1857229159","doi":"10.1007/978-3-319-10404-1_54","title":"Pico Lantern: A Pick-up Projector for Augmented Reality in Laparoscopic Surgery","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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 British Columbia","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Computer vision; Endoscope; Augmented reality; Artificial intelligence; Endoscopy; Surgery; Medicine","score_opus":0.03095660298777564,"score_gpt":0.2965523517698987,"score_spread":0.26559574878212305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857229159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025205914,0.0016718064,0.9412464,0.00040565798,0.00032471586,0.00079515914,0.0010238633,0.013170755,0.01615577],"genre_scores_gemma":[0.19519475,0.0016752154,0.7620734,0.0006720878,0.00021447071,0.00089958013,0.0017322472,0.0036259927,0.033912282],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987669,0.00016709678,0.0000656674,0.00013094315,0.0007466982,0.00012270124],"domain_scores_gemma":[0.9991223,0.00026250613,0.000059552527,0.00017823224,0.00018656129,0.00019084853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000993176,0.0013252654,0.0010570674,0.0012506876,0.00049875164,0.0014284764,0.0026029663,0.0012475466,0.032438718],"category_scores_gemma":[0.0017890185,0.0013680123,0.000996999,0.0007905602,0.00049400533,0.001451176,0.0037390527,0.0017116707,0.005822904],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023535388,0.00030171554,0.003144788,0.0012555355,0.00021712635,0.0011876847,0.000597547,0.004910677,0.28964433,0.005770382,0.03814006,0.65247655],"study_design_scores_gemma":[0.0009248663,0.0040779607,0.025362337,0.0008012647,0.00053325214,0.023237998,0.0005306314,0.105864815,0.40896055,0.003961514,0.42474636,0.0009985175],"about_ca_topic_score_codex":0.0010303074,"about_ca_topic_score_gemma":0.0013324895,"teacher_disagreement_score":0.032438718,"about_ca_system_score_codex":0.00028699823,"about_ca_system_score_gemma":0.0011274558,"threshold_uncertainty_score":0.10851836},"labels":[],"label_agreement":null},{"id":"W1857279498","doi":"10.1007/978-3-642-21043-3_49","title":"Intelligent Software Development Environments: Integrating Natural Language Processing with the Eclipse Platform","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Concordia University","funders":"","keywords":"Computer science; Software engineering; Software development; Eclipse; Software construction; Source code; Programming language; Commit; Software framework; Software; Software system; Static program analysis; Database","score_opus":0.01770433264318706,"score_gpt":0.23893936121384818,"score_spread":0.22123502857066113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857279498","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.010030557,0.0004152288,0.9613609,0.00019074939,0.0000565406,0.00007869065,0.00023907542,0.021424659,0.006203653],"genre_scores_gemma":[0.08395066,0.0008099852,0.90347517,0.0001677313,0.00003552631,0.0001038288,0.0019561716,0.003918163,0.005582788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931955,0.0001622778,0.00008540445,0.00013204181,0.00024038908,0.000060337145],"domain_scores_gemma":[0.9986663,0.00084280333,0.00009152938,0.00021852912,0.00012585806,0.000055040397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015365425,0.0005728176,0.00048728805,0.0007437632,0.00026945912,0.001816434,0.0015549437,0.00056994864,0.0019065475],"category_scores_gemma":[0.0029982931,0.0006121779,0.0008168544,0.00051161647,0.00040378398,0.002561262,0.0012231924,0.0013034436,0.0012518764],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005937033,0.00042286835,0.002242707,0.0007279989,0.00012641089,0.00060529384,0.0009940815,0.013026357,0.050678242,0.062516615,0.023266288,0.8447994],"study_design_scores_gemma":[0.00041422216,0.000391916,0.0040228623,0.000507145,0.0003649719,0.0024012777,0.00033913457,0.39058715,0.11764223,0.1300059,0.35313487,0.00018836245],"about_ca_topic_score_codex":0.0008922682,"about_ca_topic_score_gemma":0.0019478895,"teacher_disagreement_score":0.0019065475,"about_ca_system_score_codex":0.00030968204,"about_ca_system_score_gemma":0.00067926163,"threshold_uncertainty_score":0.00812614},"labels":[],"label_agreement":null},{"id":"W1857322730","doi":"10.1007/978-3-642-04985-9_12","title":"RBDT-1: A New Rule-Based Decision Tree Generation Technique","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Victoria","funders":"","keywords":"Incremental decision tree; Decision tree; Computer science; ID3 algorithm; Decision tree learning; Data mining; Tree (set theory); Decision rule; Machine learning; Decision stump; Decision tree model; Artificial intelligence; Set (abstract data type); Mathematics","score_opus":0.023713212876463177,"score_gpt":0.26454110393866065,"score_spread":0.24082789106219749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857322730","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.004484043,0.00032528068,0.98617643,0.00014451392,0.00014732148,0.00029445405,0.0011635748,0.0058268528,0.0014375207],"genre_scores_gemma":[0.02662242,0.00016708502,0.96816385,0.00018943743,0.000064427455,0.00027853868,0.0023844026,0.0003272569,0.0018025564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843115,0.0003273592,0.00016782238,0.0003178604,0.0006920254,0.00006382229],"domain_scores_gemma":[0.997097,0.0016512009,0.00011938934,0.00033824815,0.0007120051,0.00008222492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018892337,0.001052149,0.001305958,0.0022943518,0.0005376852,0.0010945366,0.003099523,0.0013947039,0.0074031046],"category_scores_gemma":[0.0068192678,0.0006932004,0.0015106271,0.0020798063,0.000335554,0.0015385718,0.0012910628,0.002234303,0.003789446],"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.00020408763,0.00022448013,0.0010681583,0.00043026323,0.00012246725,0.0002058885,0.000078619116,0.025898816,0.012941999,0.0041598417,0.019221114,0.9354443],"study_design_scores_gemma":[0.00017528322,0.0003084136,0.00097346836,0.00012729962,0.00021825042,0.0007343872,0.000033196913,0.9183603,0.025548905,0.01735726,0.036092952,0.000070254675],"about_ca_topic_score_codex":0.0014939266,"about_ca_topic_score_gemma":0.0027016336,"teacher_disagreement_score":0.0074031046,"about_ca_system_score_codex":0.00045393608,"about_ca_system_score_gemma":0.0010306907,"threshold_uncertainty_score":0.02476585},"labels":[],"label_agreement":null},{"id":"W1857325261","doi":"10.1007/978-3-642-14843-9_6","title":"Golog Speaks the BDI Language","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"York University","funders":"","keywords":"Computer science; Programming language; Artificial intelligence","score_opus":0.01382565378680022,"score_gpt":0.2440322837119734,"score_spread":0.23020662992517318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857325261","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.0054251733,0.005411573,0.619809,0.0047028577,0.0018019276,0.0001478606,0.0022689975,0.015576949,0.34485573],"genre_scores_gemma":[0.22672634,0.0076037073,0.5192885,0.0040252237,0.0014756535,0.0005646676,0.0034978853,0.009397236,0.22742094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943286,0.00013856904,0.000047554087,0.00010528022,0.00018712325,0.00008854921],"domain_scores_gemma":[0.9994973,0.0002340537,0.00003772744,0.000075012234,0.00011355419,0.000042270505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007269948,0.0013382229,0.0011633204,0.0021749062,0.001806055,0.0051276316,0.0013850611,0.0013497962,0.03646704],"category_scores_gemma":[0.0020732936,0.00085018604,0.00095447473,0.0024582844,0.0032964996,0.0057532624,0.0021572125,0.0034117685,0.022147508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006419136,0.000021965023,0.00012304007,0.00032071723,0.000013897151,0.00009373562,0.00034980892,0.0007916384,0.00073092984,0.85834086,0.049683783,0.089465365],"study_design_scores_gemma":[0.000031604697,0.00002286405,0.00008950775,0.00013955728,0.000016651742,0.0003211961,0.00009227789,0.0026725952,0.001544782,0.5935599,0.4014743,0.000034774584],"about_ca_topic_score_codex":0.0022335865,"about_ca_topic_score_gemma":0.00297267,"teacher_disagreement_score":0.03646704,"about_ca_system_score_codex":0.0016400777,"about_ca_system_score_gemma":0.0011549812,"threshold_uncertainty_score":0.121994436},"labels":[],"label_agreement":null},{"id":"W1857416707","doi":"10.1007/11866565_41","title":"Realistic Simulated MRI and SPECT Databases","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Ictal; Image registration; Ictal-Interictal SPECT Analysis by SPM; Artificial intelligence; Spect imaging; Neuroimaging; Pattern recognition (psychology); Nuclear medicine; Epilepsy; Medicine","score_opus":0.01869263148852085,"score_gpt":0.323540615611292,"score_spread":0.30484798412277114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857416707","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.53916323,0.0004913115,0.44067565,0.0005845889,0.00012818593,0.00088337867,0.009306074,0.0016618784,0.007105723],"genre_scores_gemma":[0.8752554,0.0003265399,0.11131786,0.00016987325,0.000031815278,0.0009603819,0.009823108,0.00028876495,0.0018262729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989262,0.00043098265,0.00009768949,0.0001461418,0.00033102784,0.00006796276],"domain_scores_gemma":[0.99640626,0.0021031054,0.00023664473,0.0005913546,0.00053965615,0.00012303221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628671,0.00063035457,0.00089360104,0.0010313926,0.00030461446,0.0012124786,0.001987674,0.0013011899,0.0033019811],"category_scores_gemma":[0.0066658393,0.0006017066,0.0008395987,0.001203447,0.0005699456,0.0006644774,0.00094627927,0.000634816,0.00064844306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005144943,0.00017353604,0.0031184,0.00012765275,0.0000712522,0.00039291172,0.00010097711,0.9764589,0.005009142,0.0029071395,0.0012521435,0.009873482],"study_design_scores_gemma":[0.0000976481,0.00018174111,0.0018307965,0.000018582798,0.00003312192,0.0005620048,0.00006551596,0.98270494,0.007856864,0.0031232869,0.003481098,0.000044468947],"about_ca_topic_score_codex":0.0035534122,"about_ca_topic_score_gemma":0.0025875964,"teacher_disagreement_score":0.0035534122,"about_ca_system_score_codex":0.0007596311,"about_ca_system_score_gemma":0.0009441876,"threshold_uncertainty_score":0.011046231},"labels":[],"label_agreement":null},{"id":"W1857420647","doi":"10.1007/978-3-540-24840-8_36","title":"Using Language to Determine Success in Negotiations: A Preliminary Study","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Ottawa","funders":"","keywords":"Negotiation; Computer science; Natural language; Work (physics); Natural language processing; World Wide Web; Artificial intelligence; Sociology","score_opus":0.04062645639203775,"score_gpt":0.30397076236327564,"score_spread":0.26334430597123787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857420647","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.97504145,0.00033243196,0.0023640946,0.00024697717,0.000015327581,0.00017829779,0.00010656836,0.00003182252,0.021682985],"genre_scores_gemma":[0.9962953,0.000108359476,0.0013481285,0.000058452486,0.000013304079,0.00014016448,0.00009396719,0.00003623798,0.0019061331],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9902525,0.006394937,0.00051584153,0.0004959106,0.0015338608,0.0008068861],"domain_scores_gemma":[0.7171741,0.25121838,0.009110322,0.0050777155,0.013255206,0.0041642725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015841799,0.0004962835,0.00074623764,0.0024799968,0.0019695163,0.004987878,0.0017122665,0.0016138748,0.010543533],"category_scores_gemma":[0.12794015,0.0005141988,0.00064525433,0.0021383527,0.002843914,0.008021944,0.002137003,0.0024128305,0.0020916746],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0128657,0.004371028,0.78477615,0.000494129,0.00022971914,0.002072454,0.07920966,0.0020731853,0.009321828,0.018917836,0.001191203,0.084477104],"study_design_scores_gemma":[0.0013050371,0.008672346,0.7690499,0.00043596773,0.00096714724,0.004503361,0.09890951,0.04082135,0.012429939,0.052539956,0.00992684,0.00043855712],"about_ca_topic_score_codex":0.00456461,"about_ca_topic_score_gemma":0.0028176191,"teacher_disagreement_score":0.015841799,"about_ca_system_score_codex":0.0011678359,"about_ca_system_score_gemma":0.0015636948,"threshold_uncertainty_score":0.08378041},"labels":[],"label_agreement":null},{"id":"W1857920410","doi":"10.1007/978-3-642-32512-0_29","title":"Spectral Norm of Symmetric Functions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Boolean function; Logarithm; Combinatorics; Norm (philosophy); Mathematics; Communication complexity; Discrete mathematics; Fourier transform; Parity (physics); Function (biology); Physics; Mathematical analysis; Quantum mechanics","score_opus":0.016332293128534237,"score_gpt":0.22401183056085874,"score_spread":0.2076795374323245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857920410","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061172724,0.010864364,0.3461713,0.00319135,0.002138471,0.00004082011,0.00048146647,0.0002567258,0.5756828],"genre_scores_gemma":[0.6737183,0.01523916,0.087808564,0.0011760767,0.0052623167,0.00023711623,0.0009063746,0.0005889141,0.21506318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952066,0.0001330164,0.000024131117,0.00007439588,0.00020527124,0.00004248723],"domain_scores_gemma":[0.99949324,0.00017313984,0.00004949506,0.00006852639,0.00015223816,0.000063334315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066072727,0.0007174104,0.0005113885,0.0016380722,0.0006561602,0.0024220243,0.000741004,0.000702165,0.0063704033],"category_scores_gemma":[0.0014254235,0.00024765634,0.0003672577,0.0011729538,0.0020536508,0.0027077931,0.0011243487,0.0022700538,0.0018992824],"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.00000639922,0.0000049856476,0.000017031321,0.00001739578,0.0000019391919,0.000005272054,0.0000316848,0.00033142883,0.000426749,0.98966545,0.0016825601,0.0078090625],"study_design_scores_gemma":[0.0000020687262,0.000007351939,0.000056902234,0.000009757299,0.000001624736,0.00003634893,0.000019576584,0.0019839648,0.000311036,0.9882712,0.009294967,0.00000518717],"about_ca_topic_score_codex":0.0002754458,"about_ca_topic_score_gemma":0.00023765817,"teacher_disagreement_score":0.0063704033,"about_ca_system_score_codex":0.0008310984,"about_ca_system_score_gemma":0.0005263479,"threshold_uncertainty_score":0.021311104},"labels":[],"label_agreement":null},{"id":"W1858261188","doi":"10.1007/978-3-540-73599-1_60","title":"Semantic Web Framework for Knowledge-Centric Clinical Decision Support Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Semantic Web; Social Semantic Web; Clinical decision support system; Decision support system; World Wide Web; Knowledge management; Artificial intelligence","score_opus":0.04553683976924533,"score_gpt":0.3575536375243903,"score_spread":0.31201679775514496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858261188","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.002235879,0.0012427793,0.9813131,0.0014984034,0.00020293989,0.00026757963,0.0018726006,0.0057090675,0.005657637],"genre_scores_gemma":[0.06477798,0.002054771,0.919388,0.0010547037,0.00022862785,0.0005445486,0.0071976664,0.0005594808,0.0041942657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973314,0.00068170036,0.00056095945,0.000352929,0.0008896978,0.00018342293],"domain_scores_gemma":[0.9984725,0.00060608104,0.00011300241,0.00030259017,0.0003433907,0.00016242177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00424445,0.00091549475,0.0017646243,0.0040957434,0.0014310313,0.0072669145,0.0029395348,0.0022256167,0.0034214908],"category_scores_gemma":[0.0037075242,0.0007398747,0.0024014362,0.0043995865,0.0013222849,0.0056590256,0.0036483903,0.0023227492,0.0020529844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033333406,0.00032386387,0.0008948072,0.001170562,0.0004461771,0.0011098873,0.00071764307,0.03899033,0.0051011858,0.6899467,0.03618514,0.22478032],"study_design_scores_gemma":[0.00010132829,0.000063637104,0.0003852168,0.00045658584,0.0003212443,0.0006142324,0.00023458397,0.2015729,0.006945772,0.5912452,0.19798496,0.00007428708],"about_ca_topic_score_codex":0.0056144805,"about_ca_topic_score_gemma":0.0059673022,"teacher_disagreement_score":0.0072669145,"about_ca_system_score_codex":0.00174484,"about_ca_system_score_gemma":0.0037232314,"threshold_uncertainty_score":0.02244705},"labels":[],"label_agreement":null},{"id":"W1858295406","doi":"10.1007/3-540-44886-1_50","title":"Fuzzy C-Means Clustering of Web Users for Educational Sites","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Saint Mary's University","funders":"","keywords":"Computer science; Web mining; Cluster analysis; Data mining; Fuzzy clustering; Web intelligence; Fuzzy logic; Data Web; Web modeling; Web analytics; World Wide Web; Web page; Information retrieval; Machine learning; Artificial intelligence","score_opus":0.02448505845040658,"score_gpt":0.27102063153861455,"score_spread":0.24653557308820798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858295406","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.86186725,0.0008782715,0.12543125,0.00040642725,0.00008553883,0.00029822576,0.0032617026,0.0015385961,0.006232678],"genre_scores_gemma":[0.8883803,0.0001731646,0.102443114,0.000043634056,0.00003421308,0.00010793386,0.0037188495,0.00022238317,0.004876374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986064,0.00019277223,0.00009241113,0.00029302982,0.0005501503,0.00026538406],"domain_scores_gemma":[0.9969037,0.0008910312,0.00022278391,0.00033101038,0.0013946235,0.00025683237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016027953,0.0005592641,0.00067703513,0.0077241347,0.0019826575,0.0025071693,0.0015992861,0.0017257648,0.0035872634],"category_scores_gemma":[0.0066130715,0.00031435734,0.0014578063,0.005097835,0.00051648763,0.0011945058,0.0007881487,0.0007864191,0.0019603102],"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.0027033428,0.00096080307,0.21829982,0.0005053448,0.00048961065,0.00035756003,0.003024375,0.079853624,0.02786279,0.0063064457,0.02785903,0.6317772],"study_design_scores_gemma":[0.000060486494,0.00022071006,0.15609603,0.00011514665,0.0003045344,0.000359479,0.0021377595,0.8031093,0.022770926,0.008683301,0.0059625003,0.00017984168],"about_ca_topic_score_codex":0.036490746,"about_ca_topic_score_gemma":0.053982157,"teacher_disagreement_score":0.036490746,"about_ca_system_score_codex":0.0020646458,"about_ca_system_score_gemma":0.0019789273,"threshold_uncertainty_score":0.072556674},"labels":[],"label_agreement":null},{"id":"W1858742897","doi":"10.1007/978-3-642-33269-2_12","title":"Modeling of Spiking Analog Neural Circuits with Hebbian Learning, Using Amorphous Semiconductor Thin Film Transistors with Silicon Oxide Nitride Semiconductor Split Gates","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Materials science; Hebbian theory; Transistor; Electronic circuit; Optoelectronics; Semiconductor; Computer science; Electronic engineering; Artificial neural network; Nanotechnology; Electrical engineering; Artificial intelligence; Voltage; Engineering","score_opus":0.025667835271532484,"score_gpt":0.22433316833213615,"score_spread":0.19866533306060366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858742897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14485517,0.0018600177,0.8165559,0.0005350598,0.00019958976,0.00009472583,0.00038868192,0.0011289589,0.034381904],"genre_scores_gemma":[0.94036883,0.0007594765,0.047685266,0.000098416414,0.000035524103,0.00008488023,0.00013691041,0.000062725216,0.01076797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999317,0.000010734755,0.0000044363633,0.00001527076,0.000027394934,0.000010427746],"domain_scores_gemma":[0.99989355,0.000043123564,0.00001231584,0.000013547269,0.000029420313,0.000008017006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013650268,0.00033186816,0.00045065227,0.00020227634,0.00028584478,0.00073636783,0.0015381045,0.0009351224,0.0022369768],"category_scores_gemma":[0.00035449225,0.0002782548,0.0005855991,0.00031239414,0.00038162735,0.0007540898,0.0002521978,0.0006050928,0.0003284211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051570823,0.00003562008,0.0002660928,0.00006408662,0.00003815293,0.000083814106,0.000042496962,0.9568241,0.013395923,0.014231953,0.00056461315,0.01440148],"study_design_scores_gemma":[0.0000029011323,0.000009990677,0.000060881368,0.0000027102224,0.000005168711,0.000016465088,0.0000029137707,0.99518484,0.0013156403,0.0030789557,0.00031693088,0.0000026042162],"about_ca_topic_score_codex":0.0049245125,"about_ca_topic_score_gemma":0.007423976,"teacher_disagreement_score":0.0049245125,"about_ca_system_score_codex":0.0007663644,"about_ca_system_score_gemma":0.0006286987,"threshold_uncertainty_score":0.009791672},"labels":[],"label_agreement":null},{"id":"W1858790713","doi":"10.1007/978-3-642-20520-0_37","title":"Interactive Biomimetic Space: An Interactive Installation to Explore Living Architecture","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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 Calgary","funders":"","keywords":"Computer science; Human–computer interaction; Process (computing); Space (punctuation); Swarm behaviour; Architecture; Artificial life; Artificial intelligence; Programming language","score_opus":0.032623962592506855,"score_gpt":0.27003192971497575,"score_spread":0.2374079671224689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858790713","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06228416,0.0017985507,0.67139554,0.0007804595,0.00085944426,0.00024790526,0.0020464107,0.016082978,0.24450457],"genre_scores_gemma":[0.28193748,0.0024245796,0.39477962,0.0005278499,0.0003306604,0.0008000799,0.0029118967,0.0050954903,0.31119233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999188,0.000017267745,0.0000022546863,0.000013664628,0.000033302582,0.000014745889],"domain_scores_gemma":[0.99990535,0.000036636153,0.0000024865963,0.000017656208,0.0000083651585,0.000029492547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017072166,0.0011621392,0.00038304777,0.00048082494,0.0007393982,0.0009022051,0.0011988762,0.00087503734,0.071474575],"category_scores_gemma":[0.00028813604,0.00040885888,0.0007833141,0.00033514813,0.0005730879,0.0009944149,0.003553152,0.0009820388,0.008046924],"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.00054578314,0.00033711834,0.0009058887,0.0015436676,0.000096010015,0.0021381727,0.006812748,0.0170565,0.34059328,0.06272663,0.15770961,0.4095346],"study_design_scores_gemma":[0.00011889959,0.00033388697,0.0038148458,0.00022729347,0.00005570246,0.0035876965,0.0011225208,0.014829009,0.023987224,0.02303419,0.9287558,0.00013288036],"about_ca_topic_score_codex":0.00029466563,"about_ca_topic_score_gemma":0.0010689364,"teacher_disagreement_score":0.071474575,"about_ca_system_score_codex":0.00013959614,"about_ca_system_score_gemma":0.00023206025,"threshold_uncertainty_score":0.2391063},"labels":[],"label_agreement":null},{"id":"W1858879794","doi":"10.1007/978-3-642-34002-4_8","title":"Sliced Column-Store (SCS): Ontological Foundations and Practical Implications","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Memorial University of Newfoundland","funders":"","keywords":"Column (typography); Computer science; Basis (linear algebra); Database; Mathematics","score_opus":0.04392375029413948,"score_gpt":0.3138288031854855,"score_spread":0.26990505289134603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858879794","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.04385076,0.0076791127,0.8344547,0.018070247,0.0008608104,0.0002142743,0.004191234,0.003101154,0.08757762],"genre_scores_gemma":[0.4153117,0.008091802,0.54491425,0.0027488575,0.0007177398,0.0002893631,0.0041474695,0.0010533889,0.022725424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840134,0.00037290095,0.00018250989,0.00035614354,0.00050203264,0.00018516737],"domain_scores_gemma":[0.9927182,0.0026668063,0.0003794551,0.002415848,0.0013584895,0.0004613333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025560085,0.0005888649,0.000691275,0.0013465899,0.00239488,0.009534727,0.0030747352,0.0022641046,0.009656644],"category_scores_gemma":[0.007528374,0.00095083966,0.00085404643,0.006940248,0.008978001,0.02258148,0.0039114314,0.0030704117,0.0019575376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002623052,0.00001505017,0.00029821927,0.00008584947,0.0000043280547,0.00003254109,0.00040615373,0.00088495604,0.0002838543,0.97479236,0.005400396,0.017770028],"study_design_scores_gemma":[0.000022486403,0.00002679469,0.00031344383,0.00019249138,0.000027864357,0.0003029951,0.0008400901,0.011469038,0.0018525568,0.8924337,0.09247566,0.000042899377],"about_ca_topic_score_codex":0.019901017,"about_ca_topic_score_gemma":0.014706204,"teacher_disagreement_score":0.019901017,"about_ca_system_score_codex":0.0024690502,"about_ca_system_score_gemma":0.005383618,"threshold_uncertainty_score":0.03957033},"labels":[],"label_agreement":null},{"id":"W1859002903","doi":"10.1007/978-3-642-31254-0_1","title":"Bayesian Image Matting Using Infrared and Color Cues","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"Bishop's University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Infrared; Image (mathematics); Bayesian probability; Pattern recognition (psychology)","score_opus":0.016203095952034216,"score_gpt":0.2623876608477602,"score_spread":0.246184564895726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859002903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003070885,0.00012528151,0.9952317,0.000041026215,0.000015473117,0.000007787438,0.000027265207,0.00022585347,0.0012546609],"genre_scores_gemma":[0.12208205,0.00056581985,0.86654204,0.00007139736,0.00006150647,0.000035592664,0.00028926987,0.0003690142,0.009983419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964094,0.000044974913,0.000016719792,0.000071286886,0.00019720798,0.00002891198],"domain_scores_gemma":[0.9992316,0.00027773718,0.000090269066,0.0001362787,0.00022458148,0.000039635695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006674382,0.0005638344,0.0006326706,0.00062023813,0.00019855739,0.0008856736,0.0008870376,0.00066162396,0.0043232897],"category_scores_gemma":[0.0020631214,0.0007802099,0.0006604613,0.0006004434,0.0005012933,0.0015645652,0.00088187837,0.0011301124,0.001609574],"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.00026003263,0.00009679114,0.00081503246,0.00027470785,0.00009579349,0.00008372326,0.00014331649,0.20127392,0.13246025,0.04674116,0.005287992,0.61246717],"study_design_scores_gemma":[0.0000127903195,0.000038879083,0.00072768703,0.000025144462,0.000027074782,0.00017668265,0.000015755062,0.9523602,0.028668657,0.014081353,0.0038361773,0.000029444162],"about_ca_topic_score_codex":0.0015020602,"about_ca_topic_score_gemma":0.0036649653,"teacher_disagreement_score":0.0043232897,"about_ca_system_score_codex":0.0003433707,"about_ca_system_score_gemma":0.00048412126,"threshold_uncertainty_score":0.014462888},"labels":[],"label_agreement":null},{"id":"W1859527135","doi":"10.1007/3-540-47922-8_18","title":"Construction of a Non-redundant Cover for Conditional Independencies","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Computer science; Redundancy (engineering); Probabilistic logic; Set (abstract data type); Construct (python library); Cover (algebra); Theoretical computer science; Graphical model; Context (archaeology); Algorithm; Artificial intelligence; Programming language","score_opus":0.02518064747262734,"score_gpt":0.251738423366008,"score_spread":0.22655777589338066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859527135","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.024527732,0.00010394494,0.96735394,0.00018569322,0.00004462855,0.00009667137,0.0005786801,0.00078621384,0.0063225282],"genre_scores_gemma":[0.2925231,0.00038223836,0.6918801,0.00026217423,0.0002512436,0.000642663,0.0033230118,0.0009305172,0.009804947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978885,0.00036287418,0.00009998449,0.00039632432,0.0008983064,0.00035402682],"domain_scores_gemma":[0.9956053,0.002402504,0.00017246569,0.0012140473,0.00036788435,0.00023778372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015235419,0.0011206121,0.0019624121,0.0027088316,0.0016409555,0.0020280897,0.0023036024,0.0020441038,0.0077006705],"category_scores_gemma":[0.006592435,0.001801383,0.0025879976,0.0022777272,0.0012079409,0.0040016766,0.004892358,0.003056615,0.0019344895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067415833,0.00034567498,0.001752144,0.0005057282,0.0002284732,0.0016075488,0.0010332406,0.06607768,0.03865118,0.66078335,0.018119678,0.21022114],"study_design_scores_gemma":[0.00006910738,0.00014099423,0.0008037978,0.00007858004,0.00014362067,0.00082410447,0.00013591624,0.41851062,0.014614739,0.55119187,0.013433339,0.00005335409],"about_ca_topic_score_codex":0.0008827165,"about_ca_topic_score_gemma":0.0010742019,"teacher_disagreement_score":0.0077006705,"about_ca_system_score_codex":0.00082693266,"about_ca_system_score_gemma":0.0009830559,"threshold_uncertainty_score":0.025761366},"labels":[],"label_agreement":null},{"id":"W1859577851","doi":"10.1007/978-3-642-02771-0_22","title":"The Design of a Virtual Trailblazing Tool","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Usability; Software engineering; Virtual machine; Human–computer interaction; World Wide Web; Programming language","score_opus":0.024092282590413655,"score_gpt":0.25067039511121436,"score_spread":0.2265781125208007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859577851","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.038142823,0.0003635641,0.93859893,0.00014657497,0.00020789116,0.0002361501,0.00016745694,0.002468623,0.019667882],"genre_scores_gemma":[0.5072112,0.00058184186,0.44917536,0.00011524013,0.0000240265,0.00028344273,0.000328947,0.00057891227,0.041701145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.000055231874,0.000026689522,0.000057856072,0.00020989853,0.000072556286],"domain_scores_gemma":[0.99977607,0.000053656313,0.000019219122,0.000053714884,0.00005657969,0.000040781437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039892434,0.0009884612,0.00048576292,0.00088463665,0.00073568575,0.0017853277,0.0016343691,0.0011589973,0.0133530935],"category_scores_gemma":[0.00075850013,0.0006225197,0.00053869264,0.000594472,0.0006781278,0.0010355909,0.0019113682,0.00060727756,0.0024825246],"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.000758918,0.0002718893,0.0015759369,0.0013688289,0.00007581761,0.0013456576,0.0017518987,0.0781129,0.29968798,0.055126674,0.010664937,0.54925853],"study_design_scores_gemma":[0.00039704883,0.0021998805,0.0038406872,0.0007441529,0.00028687707,0.0056948005,0.0014737137,0.35890755,0.20565684,0.02170546,0.39876053,0.00033247677],"about_ca_topic_score_codex":0.0005956511,"about_ca_topic_score_gemma":0.0007282371,"teacher_disagreement_score":0.0133530935,"about_ca_system_score_codex":0.0002607698,"about_ca_system_score_gemma":0.0010304521,"threshold_uncertainty_score":0.044670522},"labels":[],"label_agreement":null},{"id":"W1859609600","doi":"10.1007/978-3-642-02843-4_13","title":"Answering Multiple-Item Queries in Data Broadcast Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.03054351647770143,"score_gpt":0.2582071972749866,"score_spread":0.22766368079728516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859609600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073631234,0.0037259073,0.9109717,0.0019491218,0.0002816467,0.0002182945,0.0005992497,0.003252335,0.0053705256],"genre_scores_gemma":[0.618796,0.0021140608,0.35675898,0.0004388284,0.0007943765,0.00032911223,0.0022558456,0.00049960567,0.018013123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958106,0.0013769201,0.0003399185,0.0005472567,0.0014575317,0.00046786494],"domain_scores_gemma":[0.9874538,0.009762516,0.0002526934,0.0014254327,0.0008607275,0.0002447659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037571962,0.0007119671,0.0031679042,0.0011478126,0.0017350602,0.004091939,0.003120778,0.0027164887,0.0046492764],"category_scores_gemma":[0.013753822,0.0011193708,0.00088265183,0.0027332988,0.0013201878,0.0061783716,0.0023229911,0.0027546934,0.0013331891],"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.0024876893,0.0006661199,0.0053766174,0.0013055217,0.00024076698,0.0005448302,0.0022038128,0.2726161,0.014621093,0.15817028,0.04081707,0.5009502],"study_design_scores_gemma":[0.00010903108,0.00008555483,0.0004205636,0.000030884712,0.00006366924,0.00019080882,0.000365985,0.85484546,0.0049598236,0.13301301,0.0058879564,0.000027243008],"about_ca_topic_score_codex":0.004777779,"about_ca_topic_score_gemma":0.0043914733,"teacher_disagreement_score":0.004777779,"about_ca_system_score_codex":0.0016283528,"about_ca_system_score_gemma":0.0013071339,"threshold_uncertainty_score":0.019870162},"labels":[],"label_agreement":null},{"id":"W1860073133","doi":"10.1007/11686699_40","title":"Research on Internet-Based System Architecture for Collaborative Product Development","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Collaboration in agile enterprises","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":"National Research Council Canada","funders":"","keywords":"Computer science; The Internet; Architecture; Product (mathematics); New product development; Process (computing); Work (physics); Engineering management; Knowledge management; Process management; World Wide Web; Engineering; Business; Operating system","score_opus":0.034449928949770524,"score_gpt":0.28276787060936615,"score_spread":0.24831794165959561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860073133","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.28630164,0.007403851,0.4951599,0.0032345506,0.0002010744,0.00033372408,0.0000830659,0.00088268874,0.20639955],"genre_scores_gemma":[0.76540196,0.005688344,0.19857498,0.00026237685,0.00006950843,0.00021068241,0.00024489657,0.00016522464,0.02938195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984548,0.00061601854,0.000089587316,0.0002300131,0.00048251386,0.00012701999],"domain_scores_gemma":[0.99571085,0.002545379,0.00015343544,0.00066938135,0.000812775,0.0001081442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367786,0.00040903856,0.00030779646,0.001368843,0.0007874442,0.0045342306,0.0014161688,0.0013757901,0.008980386],"category_scores_gemma":[0.0066116084,0.00060312875,0.00042544838,0.0027750388,0.0016359563,0.011078115,0.0007303488,0.0013122639,0.0011948398],"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.00012803065,0.0004370535,0.0031461613,0.000410704,0.000043090447,0.0001973087,0.002828219,0.01778304,0.009397506,0.70080525,0.0026561944,0.26216736],"study_design_scores_gemma":[0.0001843294,0.000675805,0.007598729,0.00069218193,0.00021078643,0.0011135077,0.0041677346,0.32531685,0.03862751,0.45006025,0.17125061,0.000101702826],"about_ca_topic_score_codex":0.00579772,"about_ca_topic_score_gemma":0.003217307,"teacher_disagreement_score":0.008980386,"about_ca_system_score_codex":0.00213482,"about_ca_system_score_gemma":0.0021747747,"threshold_uncertainty_score":0.03004241},"labels":[],"label_agreement":null},{"id":"W1860119121","doi":"10.1007/978-3-540-85654-2_12","title":"On the Evaluation of Large and Sparse Graph Reachability Queries","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Reachability; Bounded function; Search engine indexing; Theoretical computer science; Graph; Graph database; Treewidth; Mathematics; Information retrieval; Pathwidth","score_opus":0.040333803899718405,"score_gpt":0.2734266014825541,"score_spread":0.2330927975828357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860119121","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.50100946,0.0049439715,0.3994349,0.007877753,0.0010023122,0.001001351,0.003750736,0.031621065,0.049358502],"genre_scores_gemma":[0.8267784,0.00072214083,0.15632598,0.0009441964,0.00039116206,0.00027748448,0.004722869,0.0022836104,0.0075540943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9756796,0.0073667187,0.0013383741,0.0022099828,0.01090184,0.0025034684],"domain_scores_gemma":[0.89835423,0.08596526,0.0016611004,0.008473454,0.0041715316,0.001374403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009203785,0.0022179447,0.0031392255,0.0027281397,0.0019978837,0.0051014274,0.005034427,0.0034543986,0.011829503],"category_scores_gemma":[0.06090453,0.0010477393,0.0015297579,0.0046583745,0.003980103,0.013945655,0.006454334,0.0026228589,0.0017861556],"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.010213932,0.0012400904,0.013411187,0.0015295937,0.00045001376,0.0008169285,0.0014703562,0.22734588,0.03035927,0.112967744,0.08536121,0.5148338],"study_design_scores_gemma":[0.0003847749,0.00036269773,0.0016060384,0.0000704474,0.00012376941,0.00026101698,0.0006207477,0.8733992,0.009465449,0.10908468,0.0045698206,0.00005132793],"about_ca_topic_score_codex":0.013600759,"about_ca_topic_score_gemma":0.02143293,"teacher_disagreement_score":0.013600759,"about_ca_system_score_codex":0.0044679916,"about_ca_system_score_gemma":0.004599447,"threshold_uncertainty_score":0.04867488},"labels":[],"label_agreement":null},{"id":"W186029108","doi":"10.1007/978-3-642-24364-6_18","title":"A Semantic Account for Modularity in Multi-language Modelling of Search Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Monotonic function; Modularity (biology); Expressive power; Theoretical computer science; Operator (biology); Scheduling (production processes); Programming language; Property (philosophy); Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.07514873948279129,"score_gpt":0.27947157520041577,"score_spread":0.2043228357176245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186029108","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.018686168,0.00049484323,0.9614536,0.0018608139,0.000060270504,0.000060439615,0.00015091982,0.00037258485,0.016860297],"genre_scores_gemma":[0.6201911,0.0005315655,0.37159634,0.000409191,0.00021068873,0.00026571853,0.00032718581,0.0003445931,0.0061235353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655485,0.0018474078,0.00029787087,0.00037627335,0.00062033796,0.00030329832],"domain_scores_gemma":[0.98993474,0.0067013665,0.00048705333,0.0017927134,0.0006939907,0.00039013659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045272713,0.0007674153,0.0011167864,0.0024251633,0.0020397205,0.0047058477,0.0034348462,0.00297588,0.008738579],"category_scores_gemma":[0.017135326,0.0012303612,0.0031263297,0.0028111008,0.0066070003,0.018145718,0.0051996657,0.0037502456,0.0009105804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014212987,0.000011771467,0.000118372736,0.000035397094,0.000012245948,0.00005941657,0.0003920933,0.0055056573,0.00024602507,0.9895141,0.00034920793,0.003741384],"study_design_scores_gemma":[0.0000082892275,0.0000051553775,0.000034826706,0.000010928391,0.00001208468,0.000051435993,0.00004859154,0.028943945,0.00014376975,0.9695515,0.0011817699,0.000007589653],"about_ca_topic_score_codex":0.0024492934,"about_ca_topic_score_gemma":0.0026124388,"teacher_disagreement_score":0.008738579,"about_ca_system_score_codex":0.0017722449,"about_ca_system_score_gemma":0.0014874727,"threshold_uncertainty_score":0.029233456},"labels":[],"label_agreement":null},{"id":"W1860519478","doi":"10.1007/978-3-642-12980-3_24","title":"Aperio: High Integrity Elections for Developing Countries","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Ballot; Computer science; Cryptography; Audit; Computer security; Scheme (mathematics); Computation; Algorithm; Voting; Political science; Law; Accounting; Politics; Mathematics; Business","score_opus":0.01616369165779772,"score_gpt":0.2518029468792958,"score_spread":0.23563925522149806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860519478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041413695,0.0020751625,0.5365563,0.0047067013,0.0025430638,0.00059287256,0.0048060967,0.025911015,0.3813951],"genre_scores_gemma":[0.4534851,0.0015656622,0.2761202,0.0007752612,0.0013093404,0.00058680115,0.006451093,0.0069380393,0.2527686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862814,0.000464232,0.00005639316,0.0001416948,0.00050085015,0.00020866535],"domain_scores_gemma":[0.9987031,0.00049320067,0.0000970108,0.00038742498,0.00016754773,0.00015164778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001937624,0.0005944122,0.0005813872,0.0008894675,0.001353644,0.0029327353,0.0008944622,0.00094102416,0.029435536],"category_scores_gemma":[0.004811723,0.00040637702,0.0004308866,0.0010839212,0.00064293673,0.0032711583,0.0025244134,0.0020953463,0.008456163],"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.0005540843,0.00015189253,0.0015941012,0.00022224107,0.000032454693,0.00025483564,0.00047485274,0.011155004,0.005161893,0.21890791,0.23643339,0.5250573],"study_design_scores_gemma":[0.00021159928,0.00019459634,0.0024021217,0.00007268332,0.000036108584,0.00056517817,0.00029475664,0.05023017,0.011428165,0.15348068,0.7810182,0.000065762666],"about_ca_topic_score_codex":0.0010308365,"about_ca_topic_score_gemma":0.0022546968,"teacher_disagreement_score":0.029435536,"about_ca_system_score_codex":0.0004746712,"about_ca_system_score_gemma":0.001113251,"threshold_uncertainty_score":0.0984717},"labels":[],"label_agreement":null},{"id":"W1860539286","doi":"10.1007/978-3-540-30479-1_9","title":"Applying Cell-DEVS in 3D Free-Form Shape Modeling","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"DEVS; Computer science; Cellular automaton; Computation; Formalism (music); Automaton; Free space; Conservation law; Theoretical computer science; Algorithm; Computational science; Computer graphics (images); Modeling and simulation; Simulation; Mathematics; Mathematical analysis; Physics","score_opus":0.020557774219677246,"score_gpt":0.2376088692002392,"score_spread":0.21705109498056194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860539286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035513586,0.00005748873,0.99012345,0.000051565992,0.000057871475,0.000036138004,0.000108172404,0.0014053673,0.004608646],"genre_scores_gemma":[0.17277762,0.00041978183,0.81388915,0.00017846037,0.000050754014,0.00021613688,0.00059565867,0.0019330555,0.009939477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969697,0.000036111716,0.000017260194,0.000029012042,0.00020051764,0.000020037685],"domain_scores_gemma":[0.9995004,0.00019756822,0.000025366795,0.00013943385,0.00011221565,0.00002498972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049905386,0.00068151,0.00080115243,0.0006879587,0.0005392249,0.0012407245,0.0020324867,0.0013354104,0.008955751],"category_scores_gemma":[0.0014675949,0.00075641007,0.0012963099,0.0007686913,0.0007480497,0.00075807166,0.00204424,0.0011295236,0.0026831042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003595989,0.000049123315,0.0006405969,0.00020418919,0.000051710434,0.00022540809,0.00020991436,0.7657885,0.011848152,0.062724106,0.0039207353,0.15430163],"study_design_scores_gemma":[0.000005008912,0.000009545451,0.000034747027,0.000010549258,0.000006192334,0.000067912166,0.000017305427,0.97908884,0.0038657365,0.008890363,0.0079964325,0.0000073898827],"about_ca_topic_score_codex":0.0035155271,"about_ca_topic_score_gemma":0.004409368,"teacher_disagreement_score":0.008955751,"about_ca_system_score_codex":0.00047320407,"about_ca_system_score_gemma":0.00054369244,"threshold_uncertainty_score":0.029959977},"labels":[],"label_agreement":null},{"id":"W1860567208","doi":"10.1007/11751540_6","title":"Backward Error Analysis in Computational Geometry","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","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":"Université de Montréal","funders":"","keywords":"Computer science; Context (archaeology); Computational geometry; Floating point; Algorithm; Computation; Point (geometry); Interval arithmetic; Theoretical computer science; Mathematics; Geometry","score_opus":0.019609992187504716,"score_gpt":0.28553203587516657,"score_spread":0.26592204368766187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860567208","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.0025886132,0.0029339911,0.9679823,0.00086117716,0.00073384837,0.000022809361,0.00015141375,0.00027472898,0.0244511],"genre_scores_gemma":[0.21702951,0.00985205,0.57615304,0.0010550366,0.0018232657,0.00029973386,0.000820846,0.0022935316,0.19067295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.00032494482,0.000050937113,0.00010776982,0.00047779034,0.00005603072],"domain_scores_gemma":[0.9978108,0.0010655982,0.00013060977,0.00032683113,0.00058461033,0.00008155084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021769302,0.0014607371,0.0016209957,0.0019955367,0.0007924341,0.0020364125,0.0016556272,0.0012729979,0.0075494875],"category_scores_gemma":[0.0061078584,0.0006432312,0.0013100517,0.0016594573,0.002571515,0.003126661,0.00270798,0.003913102,0.0028801153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022726103,0.000012792788,0.00014493163,0.0001284339,0.00002368104,0.000031806543,0.00007708258,0.016879404,0.00097087026,0.9412095,0.0070682825,0.03343049],"study_design_scores_gemma":[0.00000858278,0.00001878709,0.00013996233,0.00005891754,0.000022563863,0.000063610474,0.000024529754,0.10491809,0.0016816355,0.8681299,0.024916,0.000017347335],"about_ca_topic_score_codex":0.0026701095,"about_ca_topic_score_gemma":0.0019288512,"teacher_disagreement_score":0.0075494875,"about_ca_system_score_codex":0.0013352571,"about_ca_system_score_gemma":0.0011574086,"threshold_uncertainty_score":0.02525556},"labels":[],"label_agreement":null},{"id":"W1860889222","doi":"10.1007/3-540-45129-3_15","title":"On the Representation of Visual Information","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Entropy (arrow of time); Representation (politics); Isotropy; Computer vision; Extension (predicate logic); Variation (astronomy); Image (mathematics); Pattern recognition (psychology); Information theory; Mathematics; Optics; Statistics","score_opus":0.019394521685620565,"score_gpt":0.2974480177244668,"score_spread":0.2780534960388462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860889222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020303675,0.01020802,0.97411376,0.0005096261,0.00043670688,0.000045784498,0.00032312633,0.0008856021,0.011446982],"genre_scores_gemma":[0.11937863,0.028101217,0.8096732,0.00082584907,0.0012276656,0.00032739746,0.0025992768,0.0009136632,0.036953002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939644,0.00013174454,0.000059529284,0.00015061203,0.00020495252,0.00005665884],"domain_scores_gemma":[0.99920505,0.00032372138,0.000054289674,0.00023206233,0.00014627713,0.000038602913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076946744,0.0013082973,0.0015635899,0.002173251,0.0004995524,0.003981907,0.0024438435,0.0014207256,0.00857532],"category_scores_gemma":[0.0027962986,0.0006966505,0.0012203621,0.0042196293,0.0019535238,0.005689793,0.002025422,0.0018318763,0.0032919499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012421282,0.00003249866,0.00012629891,0.0006190385,0.000058219262,0.00012266762,0.0002541279,0.0139601035,0.009972199,0.40017673,0.024649678,0.5499043],"study_design_scores_gemma":[0.000025405498,0.000077823825,0.0004810716,0.0002414216,0.0000711214,0.00042379057,0.000114725844,0.15562788,0.0067477305,0.7529735,0.083165295,0.00005022815],"about_ca_topic_score_codex":0.0024443227,"about_ca_topic_score_gemma":0.0018108366,"teacher_disagreement_score":0.00857532,"about_ca_system_score_codex":0.0007146165,"about_ca_system_score_gemma":0.00042973514,"threshold_uncertainty_score":0.028687298},"labels":[],"label_agreement":null},{"id":"W1860914937","doi":"10.1007/11610113_36","title":"The Adaptability of English Based Web Search Algorithms to Chinese Search Engines","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Victoria","funders":"","keywords":"Computer science; Search engine; Scope (computer science); Adaptability; Information retrieval; Semantic search; Search algorithm; Search analytics; Web search engine; Beam search; Web crawler; Exploratory search; Web search query; World Wide Web; Algorithm; Programming language","score_opus":0.0183141131814815,"score_gpt":0.2678530435157057,"score_spread":0.24953893033422422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860914937","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.87446666,0.001487568,0.08316284,0.0014452502,0.000212078,0.0002566237,0.00080396037,0.002430982,0.03573405],"genre_scores_gemma":[0.97189957,0.0004942052,0.020012377,0.00039176588,0.000098459066,0.00008475473,0.0007527936,0.00068440253,0.005581676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969313,0.0013899849,0.0002642339,0.00050296687,0.000671489,0.00024000861],"domain_scores_gemma":[0.9798166,0.013335768,0.0005138402,0.0026002396,0.003350673,0.00038288775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005585111,0.00058724737,0.0005477264,0.002123236,0.0010272181,0.002397878,0.0010666216,0.0005950063,0.0038942937],"category_scores_gemma":[0.04589335,0.00040333119,0.00067135144,0.0031231912,0.0008859239,0.004879977,0.0010046073,0.0009506589,0.001494391],"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.003293392,0.0008357155,0.11272078,0.0007405741,0.00058792613,0.0010194813,0.007569357,0.08567819,0.054489493,0.040165957,0.019662587,0.6732365],"study_design_scores_gemma":[0.00026340634,0.0009190542,0.0784594,0.00011163372,0.0007120673,0.0010759823,0.0040329103,0.80155957,0.05706017,0.036748342,0.018893884,0.00016361935],"about_ca_topic_score_codex":0.021120049,"about_ca_topic_score_gemma":0.017520003,"teacher_disagreement_score":0.021120049,"about_ca_system_score_codex":0.0015376974,"about_ca_system_score_gemma":0.0014182443,"threshold_uncertainty_score":0.041994214},"labels":[],"label_agreement":null},{"id":"W1861127629","doi":"10.1007/978-3-642-18421-5_17","title":"A Texture Manifold for Curve-Based Morphometry of the Cerebral Cortex","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"McGill University","funders":"","keywords":"Artificial intelligence; Computer science; Orientation (vector space); Texture (cosmology); Computer vision; Salient; Geometry; Shape analysis (program analysis); Segmentation; Surface (topology); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.056575578061976016,"score_gpt":0.3083700348121913,"score_spread":0.2517944567502153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861127629","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.0076695345,0.00042746542,0.98884076,0.00019807038,0.000089500754,0.000027552784,0.00017151752,0.00051040197,0.0020652728],"genre_scores_gemma":[0.16177921,0.0015749184,0.82795423,0.000087484914,0.00025565704,0.00008132776,0.00048387653,0.0006952263,0.0070880186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988484,0.000015908512,0.000006323076,0.0000306756,0.00005168391,0.000010561758],"domain_scores_gemma":[0.99983597,0.000046670695,0.000014852448,0.000037483474,0.000041603107,0.0000233022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021967526,0.00038354765,0.0005638172,0.0009124177,0.00035331832,0.0011607043,0.00078417634,0.00075658644,0.0035481162],"category_scores_gemma":[0.00090090063,0.00026583028,0.00065215083,0.0009201737,0.0008889371,0.000954689,0.0011894505,0.0013062522,0.0010394433],"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.00008711306,0.00003811634,0.00047138348,0.0003300554,0.000048386963,0.00021375589,0.00035109848,0.07738043,0.057082847,0.29552862,0.011563101,0.55690515],"study_design_scores_gemma":[0.000010186602,0.000068374386,0.00092921377,0.000025781972,0.000015711432,0.0004044314,0.00007601962,0.74469274,0.005909527,0.22009876,0.027735284,0.000033933487],"about_ca_topic_score_codex":0.0016717003,"about_ca_topic_score_gemma":0.0014054585,"teacher_disagreement_score":0.0035481162,"about_ca_system_score_codex":0.0004207414,"about_ca_system_score_gemma":0.00044427085,"threshold_uncertainty_score":0.011869609},"labels":[],"label_agreement":null},{"id":"W186117384","doi":"10.1007/978-3-642-36315-3_12","title":"Design of an Online Testable Ternary Circuit from the Truth Table","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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 Lethbridge","funders":"","keywords":"Toffoli gate; Truth table; Computer science; Adder; Ternary operation; Arithmetic; Logic gate; Algorithm; NAND gate; Theoretical computer science; Mathematics; Programming language; Quantum gate; Telecommunications; Physics","score_opus":0.030585175045077607,"score_gpt":0.22949520313013647,"score_spread":0.19891002808505887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186117384","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.097439826,0.00039785946,0.8625949,0.0009892669,0.00040750016,0.00052085205,0.0010488991,0.0057928227,0.030808058],"genre_scores_gemma":[0.8025517,0.00014078435,0.18716341,0.00045290784,0.000092527676,0.0002518564,0.00048905006,0.00020384148,0.008653999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996253,0.000060441947,0.000023619958,0.000099090044,0.000104434424,0.00008710408],"domain_scores_gemma":[0.9993925,0.00029271815,0.000059868373,0.0001082159,0.0001010444,0.000045649558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034153165,0.00041599074,0.0006024446,0.00042764022,0.00057146436,0.0013443686,0.0015137964,0.0010287949,0.01251318],"category_scores_gemma":[0.0011955224,0.00027687577,0.00049950054,0.00043407342,0.0004679501,0.0012355285,0.00093037676,0.00075693906,0.0014969641],"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.001165477,0.000410367,0.001115407,0.0009435925,0.00014844532,0.0010261122,0.00039955028,0.045812953,0.18028456,0.35251066,0.018885657,0.3972973],"study_design_scores_gemma":[0.0006001318,0.0012506981,0.0010376124,0.0001780286,0.0002738196,0.0011909232,0.0001430118,0.44407904,0.2799461,0.22369887,0.047483847,0.00011793484],"about_ca_topic_score_codex":0.0007871553,"about_ca_topic_score_gemma":0.0015446652,"teacher_disagreement_score":0.01251318,"about_ca_system_score_codex":0.00085072336,"about_ca_system_score_gemma":0.0012267675,"threshold_uncertainty_score":0.04186082},"labels":[],"label_agreement":null},{"id":"W1861179452","doi":"10.1007/978-3-540-70521-5_12","title":"Simulating Mechanism of Brain Injury During Closed Head Impact","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automotive and Human Injury Biomechanics","field":"Medicine","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 Waterloo","funders":"","keywords":"Mechanism (biology); Mechanics; Computer science; Head (geology); Computer simulation; Fluid mechanics; Physics; Geology","score_opus":0.02608291723069486,"score_gpt":0.3068256665059941,"score_spread":0.28074274927529924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861179452","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.75787,0.0010178825,0.21422532,0.00038688257,0.00042648587,0.00048605844,0.0009649065,0.0021252544,0.022497112],"genre_scores_gemma":[0.98359805,0.00035022563,0.010360676,0.0000506363,0.000023116887,0.00005644687,0.0001686673,0.000059443777,0.005332886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994266,0.000011014478,0.0000041624476,0.000007796695,0.000022210214,0.000012133131],"domain_scores_gemma":[0.99985373,0.000084332074,0.000012982593,0.000013570186,0.00001954336,0.000015771235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013244916,0.0005115889,0.00038970416,0.0003177892,0.0002160489,0.0004369419,0.0009503079,0.0010678585,0.0053199665],"category_scores_gemma":[0.00062784384,0.00030646127,0.00045668948,0.00016800272,0.00027800418,0.00034188776,0.0005039715,0.00027669556,0.00037943284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084568467,0.00011933558,0.002947316,0.00025186577,0.00007196378,0.0027183776,0.00031149416,0.9069824,0.05790499,0.0026017516,0.0017707412,0.023474066],"study_design_scores_gemma":[0.00009841188,0.00044844756,0.0040130746,0.000030444276,0.00006447488,0.0009624534,0.00012833162,0.9795833,0.010374397,0.0028017645,0.0014673406,0.000027476062],"about_ca_topic_score_codex":0.00377449,"about_ca_topic_score_gemma":0.0021358635,"teacher_disagreement_score":0.0053199665,"about_ca_system_score_codex":0.00025678624,"about_ca_system_score_gemma":0.00042114052,"threshold_uncertainty_score":0.017796993},"labels":[],"label_agreement":null},{"id":"W1861204304","doi":"10.1007/978-3-642-25870-1_29","title":"Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Grid; Vertex (graph theory); Intersection (aeronautics); Computer science; Combinatorics; Theoretical computer science; Geography; Mathematics; Graph; Cartography; Geometry","score_opus":0.03237308431601719,"score_gpt":0.2708802046717232,"score_spread":0.238507120355706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861204304","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.80147547,0.0002814734,0.17578885,0.0005159698,0.000053457527,0.00015063319,0.0016126782,0.0016149589,0.018506382],"genre_scores_gemma":[0.8785106,0.00024544648,0.10874736,0.00015731751,0.000045980043,0.00010417288,0.0057137967,0.00041073436,0.0060645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.000049731658,0.00005062376,0.0002910375,0.00013069189,0.00015284237],"domain_scores_gemma":[0.99761343,0.0009624804,0.0003432468,0.00051543274,0.00028760658,0.00027794664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969551,0.0006125602,0.0009110777,0.0012481849,0.0013345737,0.0024285908,0.0019386681,0.001326074,0.0046241665],"category_scores_gemma":[0.0028809193,0.00093967747,0.0010077073,0.0021860476,0.0010206763,0.004167685,0.0013389853,0.0017652905,0.000811548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015561694,0.0009543103,0.08448954,0.00090125605,0.00022753338,0.0043455665,0.00472622,0.1039982,0.054134186,0.455983,0.027606763,0.26107726],"study_design_scores_gemma":[0.000095141055,0.00016470537,0.016066805,0.00015804298,0.00011970475,0.0025325709,0.0038048532,0.38608277,0.018254695,0.54981416,0.022832526,0.00007399904],"about_ca_topic_score_codex":0.00472361,"about_ca_topic_score_gemma":0.0053592427,"teacher_disagreement_score":0.00472361,"about_ca_system_score_codex":0.00074182573,"about_ca_system_score_gemma":0.0005688198,"threshold_uncertainty_score":0.015469372},"labels":[],"label_agreement":null},{"id":"W1861448938","doi":"10.1007/978-3-642-21869-9_90","title":"Generating Task-Specific Next-Step Hints Using Domain-Independent Structures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; TUTOR; Task (project management); Domain (mathematical analysis); Human–computer interaction; Artificial intelligence; Programming language","score_opus":0.04478911461724036,"score_gpt":0.2511717472853202,"score_spread":0.20638263266807985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861448938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06045119,0.0002985323,0.9129155,0.00014592826,0.00011715035,0.0002926705,0.00062470743,0.01835389,0.00680047],"genre_scores_gemma":[0.37257898,0.00020773397,0.6193166,0.00009435167,0.000027838481,0.0002114874,0.001717998,0.00063663936,0.0052083535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997116,0.000061279905,0.000024814826,0.000092303126,0.00008194545,0.00002804542],"domain_scores_gemma":[0.9983558,0.000930943,0.00008465729,0.00025236764,0.0002813789,0.00009484441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044130176,0.0012801095,0.0006764135,0.00066924427,0.0003221443,0.0008142138,0.0017858887,0.0012196754,0.007254655],"category_scores_gemma":[0.003956993,0.0005629213,0.0005447325,0.0004865324,0.00027405174,0.0012950099,0.0014289742,0.0010491157,0.0029342666],"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.0010956629,0.00063042477,0.002748954,0.00047942036,0.00009291657,0.0004447834,0.0005404938,0.051768824,0.06287862,0.006689473,0.012206626,0.8604237],"study_design_scores_gemma":[0.00016275575,0.00032697333,0.0015641674,0.00010151752,0.000120084806,0.00031671338,0.00016359826,0.88894784,0.085335456,0.014765467,0.008123137,0.000072255636],"about_ca_topic_score_codex":0.001911862,"about_ca_topic_score_gemma":0.0039610323,"teacher_disagreement_score":0.007254655,"about_ca_system_score_codex":0.0003253285,"about_ca_system_score_gemma":0.000951454,"threshold_uncertainty_score":0.024269283},"labels":[],"label_agreement":null},{"id":"W1861619326","doi":"10.1007/978-3-642-02562-4_12","title":"A Multi-Agent Resource Negotiation for the Utilitarian Welfare","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Negotiation; Computer science; Resource (disambiguation); Welfare; Operations research; Computer network; Engineering; Political science; Law","score_opus":0.07547323864354225,"score_gpt":0.34254978097120625,"score_spread":0.267076542327664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861619326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030787038,0.00038621083,0.97071886,0.0008260041,0.00017494328,0.00012733988,0.000045963745,0.00010840887,0.024533574],"genre_scores_gemma":[0.367944,0.0012161268,0.5897889,0.00047647476,0.00054049207,0.0010625862,0.00015236369,0.00028915837,0.038529944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997544,0.0012176782,0.00012464245,0.00036430516,0.0005837619,0.0001655795],"domain_scores_gemma":[0.9987457,0.00076634146,0.00006497689,0.00019339558,0.00013193313,0.00009764752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033521422,0.0012251092,0.0018023255,0.0010465393,0.0020613002,0.0039177216,0.0035767201,0.0036642689,0.014335784],"category_scores_gemma":[0.0059810556,0.00076117023,0.0025154217,0.0018856745,0.002894907,0.0065100556,0.005420893,0.004665448,0.0022368694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044925822,0.000048897942,0.00005738718,0.00011323319,0.000041350206,0.000095245574,0.00013139089,0.045097694,0.0011380811,0.92992926,0.0026718257,0.020630734],"study_design_scores_gemma":[0.000033602224,0.00005202995,0.000063068735,0.00005207393,0.000027592107,0.00011868412,0.000038193997,0.3074241,0.00036309252,0.6856738,0.0061270907,0.000026662892],"about_ca_topic_score_codex":0.00069204357,"about_ca_topic_score_gemma":0.00057722704,"teacher_disagreement_score":0.014335784,"about_ca_system_score_codex":0.0019611304,"about_ca_system_score_gemma":0.0017684132,"threshold_uncertainty_score":0.047957957},"labels":[],"label_agreement":null},{"id":"W1861651162","doi":"10.1007/978-3-319-18173-8_6","title":"Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Interval (graph theory); Sequence (biology); Discrete mathematics; Intersection (aeronautics); Mathematics; Indifference graph; Interval graph; Chordal graph; Computer science; Graph; 1-planar graph","score_opus":0.02732113612990234,"score_gpt":0.26428183474072364,"score_spread":0.2369606986108213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861651162","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.44495583,0.00050093664,0.5226294,0.0015834856,0.00032338983,0.00037713393,0.001568427,0.007659264,0.02040207],"genre_scores_gemma":[0.85482675,0.00017069202,0.13799559,0.0002894233,0.00007641716,0.00014102648,0.0021036405,0.00068847666,0.003708011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984628,0.00039215767,0.00007917955,0.00042457468,0.00040382202,0.00023753286],"domain_scores_gemma":[0.986061,0.010473484,0.0006312194,0.0016355684,0.00076222926,0.00043660184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232589,0.0011150207,0.0009051249,0.00087431935,0.00064405805,0.0016486973,0.0032857491,0.0013222654,0.007579637],"category_scores_gemma":[0.010719668,0.00061416253,0.0011933816,0.00090913783,0.0010993452,0.0038842552,0.0022207196,0.0015238181,0.0008630382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019086405,0.00058438577,0.0067063095,0.00090756913,0.00023266295,0.0008016671,0.00040873417,0.61777127,0.038766246,0.055958565,0.019621585,0.25633237],"study_design_scores_gemma":[0.00015196744,0.0003474478,0.0006554712,0.00004667863,0.00006554727,0.00024315661,0.00019461267,0.87163943,0.014898948,0.109570675,0.0021590865,0.000026992702],"about_ca_topic_score_codex":0.003080668,"about_ca_topic_score_gemma":0.0033158327,"teacher_disagreement_score":0.007579637,"about_ca_system_score_codex":0.0010792506,"about_ca_system_score_gemma":0.0012039755,"threshold_uncertainty_score":0.025356352},"labels":[],"label_agreement":null},{"id":"W1861711793","doi":"10.1007/978-3-642-24500-8_40","title":"Re:Cycle - A Generative Ambient Video Engine","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chrominance; Computer science; Narrative; Luminance; Generative grammar; Meaning (existential); Set (abstract data type); Computer graphics (images); Computer vision; Artificial intelligence; Art; Literature","score_opus":0.023375879144908865,"score_gpt":0.2625356789147692,"score_spread":0.23915979976986035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861711793","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008334531,0.00020491384,0.8212489,0.00009288022,0.00016474775,0.00038982683,0.0015805983,0.14144641,0.026537206],"genre_scores_gemma":[0.21271081,0.00046956548,0.60964525,0.0004338244,0.000102384474,0.0009237699,0.010289902,0.053132426,0.11229208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999613,0.000059033035,0.000020304027,0.0001025649,0.0001599584,0.000045321976],"domain_scores_gemma":[0.9996107,0.00011978293,0.000008950931,0.00014308168,0.000074749216,0.00004279848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005770816,0.001511651,0.0008148689,0.00077880034,0.00049685576,0.0016590758,0.0029247566,0.0011393169,0.039914172],"category_scores_gemma":[0.0019028526,0.0009659311,0.0011734567,0.00046130785,0.00061793317,0.0022572812,0.0026991589,0.0011380716,0.012760797],"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.0013476657,0.00074798765,0.0014312632,0.000964915,0.00024476828,0.0006256347,0.0012719884,0.040705316,0.09515512,0.08363936,0.14886963,0.6249964],"study_design_scores_gemma":[0.00040002438,0.00035926807,0.00073413766,0.000121772595,0.00015981737,0.0007253861,0.00024064125,0.48972097,0.105822004,0.05738125,0.34412345,0.0002112871],"about_ca_topic_score_codex":0.002989841,"about_ca_topic_score_gemma":0.0034070201,"teacher_disagreement_score":0.039914172,"about_ca_system_score_codex":0.00042613578,"about_ca_system_score_gemma":0.00057851174,"threshold_uncertainty_score":0.13352615},"labels":[],"label_agreement":null},{"id":"W1861862848","doi":"10.1007/11561927_14","title":"Time and Space Lower Bounds for Implementations Using k-CAS","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Implementation; Upper and lower bounds; Queue; Binary logarithm; Priority queue; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.022031467034643537,"score_gpt":0.2870211703615573,"score_spread":0.26498970332691374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861862848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08750116,0.010400932,0.704492,0.0069839307,0.0019178906,0.0006750437,0.00202661,0.01401206,0.17199038],"genre_scores_gemma":[0.57211506,0.004150231,0.36111718,0.002044931,0.0016153604,0.0015090028,0.0027449853,0.005812193,0.04889102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.979871,0.0034361372,0.0014372084,0.0021634165,0.0067688148,0.0063234274],"domain_scores_gemma":[0.9249548,0.046292115,0.0027745331,0.018372996,0.0051021106,0.0025034905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008406143,0.00524267,0.0049075778,0.005039708,0.004847047,0.016864423,0.010232257,0.0055546323,0.046068445],"category_scores_gemma":[0.046841316,0.0024047764,0.0043348633,0.008193035,0.0054233284,0.025123201,0.010359143,0.010432255,0.010835015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005250181,0.0008312156,0.0020818375,0.0020613484,0.0003746621,0.00021569694,0.00075575965,0.19338329,0.01437278,0.5037296,0.056582436,0.22036129],"study_design_scores_gemma":[0.00031452996,0.00035470387,0.00057492807,0.00043017024,0.00048419525,0.0003659749,0.00042934748,0.5103123,0.013991997,0.45865124,0.013921745,0.00016886322],"about_ca_topic_score_codex":0.004708875,"about_ca_topic_score_gemma":0.011822577,"teacher_disagreement_score":0.046068445,"about_ca_system_score_codex":0.00861058,"about_ca_system_score_gemma":0.012054682,"threshold_uncertainty_score":0.15411437},"labels":[],"label_agreement":null},{"id":"W1862298752","doi":"10.1007/978-3-642-14186-7_24","title":"Improved Local Search for Circuit Satisfiability","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Boolean satisfiability problem; Computer science; Benchmark (surveying); Satisfiability; Local search (optimization); Reduction (mathematics); Constraint (computer-aided design); Electronic circuit; Algorithm; Search algorithm; Boolean circuit; Constraint satisfaction problem; Theoretical computer science; Boolean function; Mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.03585265515694759,"score_gpt":0.2973369076002441,"score_spread":0.26148425244329654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862298752","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.042992875,0.0013467632,0.91352415,0.0007292447,0.00023078316,0.0003128147,0.0006746762,0.006544976,0.033643764],"genre_scores_gemma":[0.42512286,0.00064996094,0.5402473,0.0005677241,0.00022652757,0.0007793048,0.0019015532,0.0019392227,0.028565446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837035,0.0005355431,0.000068959474,0.00026508057,0.0005628199,0.00019727145],"domain_scores_gemma":[0.99664426,0.0021751132,0.00009253262,0.0007084652,0.00029333448,0.000086259424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015766256,0.0009772838,0.0020848538,0.0018517985,0.00092181476,0.0013799927,0.003504729,0.0013157437,0.027725482],"category_scores_gemma":[0.0071946355,0.0006872614,0.0015871819,0.0024137683,0.0015582569,0.0031503758,0.0034202116,0.003070371,0.003255428],"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.0013870191,0.00048873195,0.0006892771,0.0011079434,0.00014569775,0.00019469664,0.00034508453,0.22370654,0.01393164,0.23013216,0.03199401,0.4958772],"study_design_scores_gemma":[0.00025864798,0.00014896155,0.0002500999,0.00007119586,0.000093376315,0.00007874886,0.00006277765,0.8010999,0.004710548,0.18623659,0.0069544287,0.000034686116],"about_ca_topic_score_codex":0.0032196091,"about_ca_topic_score_gemma":0.007126721,"teacher_disagreement_score":0.027725482,"about_ca_system_score_codex":0.0021647525,"about_ca_system_score_gemma":0.001565367,"threshold_uncertainty_score":0.092751026},"labels":[],"label_agreement":null},{"id":"W1862916997","doi":"10.1007/978-3-642-21596-4_27","title":"Structural Similarity-Based Affine Approximation and Self-similarity of Images Revisited","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Waterloo","funders":"","keywords":"Affine transformation; Grayscale; Similarity (geometry); Mathematics; Fractal; Pattern recognition (psychology); Self-similarity; Mean squared error; Artificial intelligence; Affine shape adaptation; Structural similarity; Computer science; Algorithm; Affine combination; Image (mathematics); Statistics; Geometry; Mathematical analysis","score_opus":0.0235952797480922,"score_gpt":0.26041273964136324,"score_spread":0.23681745989327105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862916997","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.04315438,0.0056334888,0.9418251,0.000662643,0.0001960737,0.000027106815,0.000035829416,0.00008878173,0.008376649],"genre_scores_gemma":[0.8217186,0.0072277617,0.15728313,0.00024610246,0.0006149338,0.000030898602,0.00013662897,0.00010236336,0.012639489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960107,0.000105693034,0.000026365211,0.00009331132,0.00014505335,0.000028651448],"domain_scores_gemma":[0.9988814,0.00044267316,0.00015373241,0.00022587807,0.00024500952,0.000051212068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095358846,0.00042488074,0.00094134646,0.0011716378,0.0002885627,0.0014296012,0.001272267,0.0011999313,0.0013079365],"category_scores_gemma":[0.0039826557,0.0005059133,0.00077373284,0.0015110564,0.0016356433,0.00309471,0.0011649699,0.0017511668,0.00041220846],"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.000095529125,0.000053602824,0.00072120415,0.00033910127,0.00008095924,0.00016981804,0.00028570212,0.053519882,0.019701127,0.80051464,0.0016442112,0.12287421],"study_design_scores_gemma":[0.000015091714,0.0001191007,0.0013515927,0.000034444416,0.000042096297,0.00059326,0.000120369325,0.6469771,0.0076361024,0.3388663,0.0042056697,0.000038885257],"about_ca_topic_score_codex":0.00085770333,"about_ca_topic_score_gemma":0.0006462504,"teacher_disagreement_score":0.0014296012,"about_ca_system_score_codex":0.00052172155,"about_ca_system_score_gemma":0.0003271876,"threshold_uncertainty_score":0.0050430894},"labels":[],"label_agreement":null},{"id":"W1863168021","doi":"10.1007/3-540-47728-4_42","title":"A Discrete-Time Queuing Analysis of the Wireless ATM Multiplexing System","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"Concordia University","funders":"","keywords":"Computer science; Channel (broadcasting); Queue; Queueing theory; Markov chain; Computer network; Multiplexing; Algorithm; Wireless; Markov process; Queue management system; Real-time computing; Telecommunications; Mathematics; Statistics","score_opus":0.019696271486492768,"score_gpt":0.2666857410022098,"score_spread":0.24698946951571704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863168021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047553856,0.0024504215,0.9322887,0.0011264518,0.00040817773,0.00008250038,0.000161557,0.00017051311,0.015757717],"genre_scores_gemma":[0.9219235,0.0027376178,0.056703694,0.0003499455,0.00073717086,0.00010637961,0.00016916676,0.00012821004,0.017144227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00017155659,0.000021603975,0.00007984569,0.00020256355,0.00010923962],"domain_scores_gemma":[0.99871504,0.00072174275,0.00012653433,0.00006713961,0.00024826347,0.00012135739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540174,0.00065424596,0.0007837643,0.0009278693,0.0008646033,0.0021697723,0.0016904654,0.0008181803,0.0053540273],"category_scores_gemma":[0.0038915165,0.0004842124,0.0007821371,0.0009618565,0.0011333418,0.0024335843,0.0008439324,0.0016823964,0.00037950106],"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.000071687835,0.00009411971,0.0006265331,0.00011061651,0.000044602795,0.00012527322,0.00013619811,0.38779756,0.0043971287,0.591217,0.0024988938,0.012880464],"study_design_scores_gemma":[0.000003612764,0.00000807485,0.00010839677,0.0000058680384,0.0000075122603,0.000016415517,0.000011559346,0.95977473,0.00015086346,0.03930554,0.0005991073,0.000008224641],"about_ca_topic_score_codex":0.0074040024,"about_ca_topic_score_gemma":0.0033651679,"teacher_disagreement_score":0.0074040024,"about_ca_system_score_codex":0.0025492387,"about_ca_system_score_gemma":0.001892713,"threshold_uncertainty_score":0.018496156},"labels":[],"label_agreement":null},{"id":"W1863189299","doi":"10.1007/978-3-642-29178-4_2","title":"Network Protocol Discovery and Analysis via Live Interaction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Protocol (science); Set (abstract data type); Service (business); Service discovery; Protocol analysis; Network analysis; Distributed computing; Theoretical computer science; Web service; World Wide Web; Programming language","score_opus":0.013777016133449328,"score_gpt":0.2767085319041541,"score_spread":0.2629315157707048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863189299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109096244,0.00034734805,0.8721074,0.00021864074,0.00007381163,0.00022818732,0.0004779822,0.008455567,0.008994876],"genre_scores_gemma":[0.805039,0.00026385736,0.18269338,0.000094224815,0.00006559804,0.0002852781,0.000726755,0.00041983006,0.010411992],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980215,0.00036754194,0.00006306019,0.0003055288,0.0010512278,0.00019119175],"domain_scores_gemma":[0.99436414,0.0029405456,0.0004789113,0.0014336844,0.00062839943,0.0001543162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091524876,0.00063370855,0.00067167904,0.0018237828,0.0006966478,0.0018639261,0.0013866561,0.0010004772,0.0046658022],"category_scores_gemma":[0.0060426197,0.00040542864,0.00037983837,0.0010176712,0.000841129,0.0030240647,0.0018020476,0.0016379397,0.0014067589],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010552582,0.0007837157,0.01624292,0.0003248549,0.00019190877,0.0009687163,0.0010903891,0.06376769,0.15237013,0.058421414,0.009826248,0.6949568],"study_design_scores_gemma":[0.000027511755,0.00018863822,0.0031730228,0.000026453483,0.000037251135,0.00076159515,0.00022738603,0.869607,0.08283271,0.03710784,0.005963915,0.000046622667],"about_ca_topic_score_codex":0.0007165444,"about_ca_topic_score_gemma":0.0008601885,"teacher_disagreement_score":0.0046658022,"about_ca_system_score_codex":0.00054904836,"about_ca_system_score_gemma":0.00053472957,"threshold_uncertainty_score":0.015608609},"labels":[],"label_agreement":null},{"id":"W1863642815","doi":"10.1007/978-3-540-73595-3_2","title":"Formalization of Continuous Probability Distributions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"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":"Cumulative distribution function; Computer science; Random variable; Probability distribution; Inverse distribution; Applied mathematics; Probability integral transform; Automated theorem proving; Algorithm; Calculus (dental); Probability density function; Mathematics; Theoretical computer science; Moment-generating function; Heavy-tailed distribution; Statistics","score_opus":0.03663569453984287,"score_gpt":0.29448766659307807,"score_spread":0.2578519720532352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863642815","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.0028853372,0.0003652178,0.98577094,0.00035469272,0.00010502846,0.0000239282,0.00010557838,0.00023310317,0.010156347],"genre_scores_gemma":[0.4798433,0.00203707,0.48834097,0.0005621919,0.00080316095,0.00036611492,0.00063041813,0.000514161,0.026902677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979013,0.00063099194,0.00015259409,0.00038422336,0.000779437,0.0001513995],"domain_scores_gemma":[0.99543154,0.0031685256,0.0002362834,0.00048650615,0.00052060117,0.00015659003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025787998,0.00081123953,0.00070673955,0.0013037197,0.0005424349,0.0028017436,0.0017586398,0.0009885705,0.009663095],"category_scores_gemma":[0.00796866,0.0006300375,0.0013859412,0.0010600312,0.0033113144,0.0043429304,0.0018965104,0.0037409447,0.0012503178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000685362,0.000008377218,0.00003560846,0.000036254023,0.000004830925,0.000027432447,0.00007049003,0.0040229904,0.0003852993,0.98798615,0.0005720061,0.006843755],"study_design_scores_gemma":[0.0000143225325,0.000015494092,0.00007361013,0.000035263634,0.000009382167,0.00009472311,0.00002502083,0.048345726,0.0009849203,0.9402041,0.010185466,0.000011983827],"about_ca_topic_score_codex":0.000935602,"about_ca_topic_score_gemma":0.0006583874,"teacher_disagreement_score":0.009663095,"about_ca_system_score_codex":0.0017338878,"about_ca_system_score_gemma":0.0011659553,"threshold_uncertainty_score":0.03232628},"labels":[],"label_agreement":null},{"id":"W1863779216","doi":"10.1007/bfb0025021","title":"Design efficient local search algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Local search (optimization); Guided Local Search; Constraint satisfaction problem; Mathematical optimization; Computer science; Constraint (computer-aided design); Satisfiability; Boolean satisfiability problem; Constraint satisfaction; Search algorithm; Iterated local search; Combinatorial optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.023213274401388345,"score_gpt":0.25373221083654274,"score_spread":0.2305189364351544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863779216","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.0032860872,0.0005051455,0.9900411,0.000068431,0.000032199478,0.00007365474,0.00004976221,0.0005014157,0.005442209],"genre_scores_gemma":[0.11451275,0.0009620336,0.86916107,0.00020499135,0.00006250595,0.000651313,0.00031689997,0.0005064221,0.013622023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999405,0.00018111973,0.000029699355,0.000118153956,0.0001972222,0.00006881417],"domain_scores_gemma":[0.9992855,0.00035122366,0.000066216235,0.00014182217,0.00012750081,0.000027728252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091337756,0.0008888663,0.0011138142,0.0010366549,0.00052946684,0.0011536006,0.0015598476,0.0011447862,0.009768832],"category_scores_gemma":[0.0038458745,0.00061660504,0.00061559124,0.0014343734,0.00060218223,0.0016538751,0.0015299413,0.0011972067,0.003843046],"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.00019547007,0.00016543655,0.00043879106,0.00062718923,0.00009598045,0.000060967996,0.00014684623,0.33357885,0.011325796,0.15331239,0.016227143,0.4838252],"study_design_scores_gemma":[0.00009234947,0.00014170635,0.00011102057,0.000079087935,0.000043382675,0.00009169952,0.00006078067,0.8941094,0.0072155986,0.07838928,0.019649485,0.000016194635],"about_ca_topic_score_codex":0.00039980226,"about_ca_topic_score_gemma":0.0010188217,"teacher_disagreement_score":0.009768832,"about_ca_system_score_codex":0.0006129196,"about_ca_system_score_gemma":0.0006325578,"threshold_uncertainty_score":0.032680035},"labels":[],"label_agreement":null},{"id":"W1863804251","doi":"10.1007/978-3-540-75248-6_1","title":"A Unified Conflict Resolution Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Waterloo","funders":"","keywords":"Computer science; Conflict resolution; Authorization; Resolution (logic); Tree (set theory); Simple (philosophy); Inheritance (genetic algorithm); Theoretical computer science; Parametric statistics; Diversity (politics); Algorithm; Data mining; Computer security; Artificial intelligence; Law; Mathematics","score_opus":0.03843744942416563,"score_gpt":0.30863702821593,"score_spread":0.27019957879176437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863804251","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.002755181,0.00016132212,0.9902298,0.000172809,0.00007919699,0.00013742654,0.00011265784,0.00071599474,0.0056356355],"genre_scores_gemma":[0.07839702,0.00018732638,0.9123416,0.00016175979,0.00008282078,0.0003494505,0.00056428707,0.0002502223,0.0076656295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745554,0.0008504997,0.00017827205,0.00058977713,0.00065963774,0.0002662904],"domain_scores_gemma":[0.9968316,0.001505556,0.00010952908,0.0007903681,0.00067452295,0.000088394925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029120676,0.0011719788,0.001815923,0.0018892607,0.001642048,0.0032169614,0.004347601,0.0023949551,0.018842423],"category_scores_gemma":[0.009659226,0.00069075375,0.0014927214,0.0026948687,0.0010266942,0.0044099772,0.0036963355,0.0021542748,0.0049543804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002509168,0.00021676258,0.0004779677,0.00017000937,0.00010506447,0.00007427223,0.0001905288,0.12427328,0.0022330366,0.22089149,0.017995859,0.6331208],"study_design_scores_gemma":[0.00009095419,0.000053263095,0.00010400559,0.00002484864,0.00004810777,0.00009021738,0.00004805632,0.8240202,0.0016194372,0.1659738,0.007905114,0.000021899505],"about_ca_topic_score_codex":0.0019742392,"about_ca_topic_score_gemma":0.0018937456,"teacher_disagreement_score":0.018842423,"about_ca_system_score_codex":0.0009733388,"about_ca_system_score_gemma":0.002559323,"threshold_uncertainty_score":0.06303418},"labels":[],"label_agreement":null},{"id":"W1864149940","doi":"10.1007/978-3-642-19867-0_4","title":"An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Discrete geometry; Coprime integers; Discrete space; Computer science; Digital geometry; Arithmetic function; Simple (philosophy); Euclidean space; Point (geometry); Integer (computer science); Algorithm; Euclidean geometry; Discrete mathematics; Mathematics; Combinatorics; Image processing; Artificial intelligence; Image (mathematics)","score_opus":0.02198518174772196,"score_gpt":0.2553348456603041,"score_spread":0.23334966391258216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864149940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025189735,0.004335604,0.736797,0.0020021272,0.0011037465,0.00006153614,0.00031870065,0.00045881383,0.2297328],"genre_scores_gemma":[0.46848798,0.006654772,0.44807544,0.00084936345,0.0016627397,0.0002023386,0.0005035845,0.00032126758,0.0732426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975723,0.0000614304,0.00001535041,0.000040687126,0.00010036355,0.000024878136],"domain_scores_gemma":[0.9997695,0.00009777083,0.000024571606,0.000029863413,0.00005420215,0.000024063713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026528165,0.00074051763,0.0004956899,0.0018160233,0.0010968742,0.0033286186,0.0015654258,0.0007129452,0.009827155],"category_scores_gemma":[0.0009986178,0.00040142593,0.0007211912,0.002127292,0.0029381476,0.0027997897,0.0011382402,0.0029492783,0.0017659393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069253892,0.000006779507,0.000023987877,0.000026708221,0.0000022927286,0.000026057798,0.00006960014,0.0017355579,0.000337635,0.98349,0.001523938,0.012750545],"study_design_scores_gemma":[0.0000053224294,0.000008162767,0.00005299806,0.000011384561,0.0000031460186,0.00008375581,0.00004732587,0.007296261,0.00019644896,0.9747791,0.017509038,0.000007124371],"about_ca_topic_score_codex":0.0011314696,"about_ca_topic_score_gemma":0.0010642178,"teacher_disagreement_score":0.009827155,"about_ca_system_score_codex":0.0011433129,"about_ca_system_score_gemma":0.000388456,"threshold_uncertainty_score":0.03287512},"labels":[],"label_agreement":null},{"id":"W1864186126","doi":"10.1007/978-3-642-04840-1_10","title":"A Modeling Ontology for Integrating Vulnerabilities into Security Requirements Conceptual Foundations","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Ontology; Exploit; Vulnerability (computing); Vulnerability management; Process (computing); Software engineering; Threat model; Compromise; Conceptual model; Computer security; Vulnerability assessment; Database","score_opus":0.03497104198466348,"score_gpt":0.29649645385979745,"score_spread":0.26152541187513395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864186126","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.0029089996,0.00015582949,0.9860913,0.0009413521,0.00007073063,0.0002049782,0.00054609374,0.0008655142,0.00821513],"genre_scores_gemma":[0.06983277,0.0005999909,0.92156416,0.00031570342,0.000057174628,0.00042297892,0.001827782,0.00039290523,0.0049864794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771935,0.00053408387,0.0004424644,0.00033451914,0.00073704065,0.0002324754],"domain_scores_gemma":[0.9978688,0.0006730319,0.0002340707,0.0005146254,0.0005395615,0.0001698625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029137519,0.0011716506,0.0008539553,0.0042144493,0.0019210998,0.005639301,0.0026282296,0.0019248805,0.0040108226],"category_scores_gemma":[0.0046963347,0.0015383448,0.0036858472,0.0036176732,0.0024278932,0.01028467,0.0034858666,0.0046238326,0.0012367123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012407016,0.000059409707,0.00044969103,0.00015064502,0.000037975937,0.00028578294,0.0012663493,0.010019004,0.0018631535,0.9457725,0.0042648837,0.035818033],"study_design_scores_gemma":[0.00002855799,0.00002897813,0.00039717817,0.00042597813,0.00016453734,0.000607079,0.0009739417,0.1409123,0.004103458,0.6766634,0.17560796,0.00008674743],"about_ca_topic_score_codex":0.022547431,"about_ca_topic_score_gemma":0.022362642,"teacher_disagreement_score":0.022547431,"about_ca_system_score_codex":0.0034535779,"about_ca_system_score_gemma":0.0057510696,"threshold_uncertainty_score":0.04483235},"labels":[],"label_agreement":null},{"id":"W1865269592","doi":"10.1007/3-540-36108-1_7","title":"Transformations of Self-Stabilizing Algorithms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Correctness; Transformation (genetics); Self-stabilization; Bounded function; Algorithm; Class (philosophy); Security token; Theoretical computer science; Parallel computing; Distributed algorithm; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.016522905735754625,"score_gpt":0.23303585900886817,"score_spread":0.21651295327311354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1865269592","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.0476123,0.00038881795,0.8658457,0.00025631802,0.00027561845,0.000112954476,0.00011761962,0.0017737749,0.08361682],"genre_scores_gemma":[0.8024027,0.000669482,0.13433161,0.00021540596,0.00020414368,0.00022623425,0.00034805518,0.00082633423,0.060776073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968505,0.000078197976,0.000016811333,0.000053135558,0.00013100432,0.000035888057],"domain_scores_gemma":[0.99957675,0.00014147708,0.000037172842,0.0001304548,0.00008439254,0.000029805053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620871,0.00043970734,0.00033475502,0.00058898615,0.00044719368,0.00086450856,0.00054585066,0.00036524844,0.009100685],"category_scores_gemma":[0.0012811542,0.00023991754,0.00044619114,0.00048528326,0.0007029143,0.0010816277,0.00096982345,0.0011024195,0.0017862857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095644,0.000077811135,0.0001469974,0.00006523586,0.000015932172,0.00006346637,0.00019152905,0.035835527,0.011413862,0.79663074,0.004503037,0.15096031],"study_design_scores_gemma":[0.000047956397,0.000107280925,0.00016936687,0.000017438166,0.000012540491,0.00012982181,0.000049780807,0.18468297,0.011669866,0.78627616,0.016823223,0.000013598535],"about_ca_topic_score_codex":0.00029869168,"about_ca_topic_score_gemma":0.00027127148,"teacher_disagreement_score":0.009100685,"about_ca_system_score_codex":0.00034595004,"about_ca_system_score_gemma":0.00029249533,"threshold_uncertainty_score":0.0304448},"labels":[],"label_agreement":null},{"id":"W1866168164","doi":"10.1007/3-540-45813-1_51","title":"Triangulation of Bayesian Networks: A Relational Database Perspective","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Perspective (graphical); Bayesian network; Computer science; Relational database; Triangulation; Bayesian probability; Artificial intelligence; Theoretical computer science; Data mining; Mathematics","score_opus":0.03242788186633415,"score_gpt":0.2594950915686602,"score_spread":0.22706720970232602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866168164","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.0018802489,0.001203482,0.98891056,0.0005804106,0.000051663097,0.000039318507,0.00019934821,0.00010772547,0.0070271464],"genre_scores_gemma":[0.10961773,0.00474839,0.87961346,0.00024783332,0.00031294068,0.00023160008,0.0010472782,0.0002465697,0.0039340467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867634,0.007580083,0.0008944482,0.0016816797,0.0026949272,0.00038543326],"domain_scores_gemma":[0.9625655,0.026242977,0.0018935102,0.0054461574,0.0032213808,0.00063040515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010428185,0.0010487775,0.0027103196,0.007288094,0.0022248048,0.010068006,0.0065899,0.0033457994,0.010889239],"category_scores_gemma":[0.060680162,0.0026727198,0.003060814,0.011516696,0.0045952094,0.016665384,0.006119242,0.0045403233,0.0017364044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002769476,0.000014306501,0.00029172422,0.00014491254,0.00006739246,0.000110610876,0.0005436698,0.01662644,0.00017945991,0.9482351,0.0015882605,0.032170307],"study_design_scores_gemma":[0.00001028668,0.0000067817637,0.00007193677,0.00006238309,0.00003097153,0.00008747281,0.0001517427,0.029639168,0.00015384168,0.96255165,0.0072185956,0.000015297785],"about_ca_topic_score_codex":0.008087099,"about_ca_topic_score_gemma":0.00479468,"teacher_disagreement_score":0.010889239,"about_ca_system_score_codex":0.00277568,"about_ca_system_score_gemma":0.002013586,"threshold_uncertainty_score":0.05515021},"labels":[],"label_agreement":null},{"id":"W1866966051","doi":"10.1007/978-3-540-85538-5_17","title":"Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supersingular elliptic curve; Hyperelliptic curve cryptography; Hyperelliptic curve; Automorphism; Pairing; Genus; Edwards curve; Elliptic curve; Computer science; Cryptography; Computation; Prime (order theory); Mathematics; Embedding; Finite field; Discrete mathematics; Schoof's algorithm; Algorithm; Pure mathematics; Elliptic curve cryptography; Combinatorics; Public-key cryptography; Encryption; Artificial intelligence","score_opus":0.020285270443268888,"score_gpt":0.2272133664758297,"score_spread":0.20692809603256082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866966051","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.50125164,0.0014412054,0.3807416,0.0017377376,0.0008758191,0.00042492515,0.0011034983,0.020283021,0.09214054],"genre_scores_gemma":[0.797079,0.0004474003,0.17454939,0.000364379,0.0002909047,0.00024151347,0.0015378589,0.0018082411,0.023681255],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977017,0.00044217016,0.00012207539,0.00042994725,0.0006871841,0.0006169006],"domain_scores_gemma":[0.9967353,0.0014379625,0.00015061852,0.0012576018,0.00024457663,0.00017393932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011124102,0.002154202,0.002054249,0.0015641721,0.0017033225,0.0042109885,0.0021182469,0.0015865958,0.023082042],"category_scores_gemma":[0.0053882156,0.001093905,0.001782428,0.0026800488,0.0021781817,0.009580117,0.0056472477,0.0030026655,0.0069516613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032222779,0.0004665414,0.0044542216,0.0009492723,0.00025308607,0.0009637777,0.001952711,0.06891365,0.039634712,0.3430408,0.054083277,0.48206568],"study_design_scores_gemma":[0.0004218164,0.0004421671,0.0011670946,0.00016636642,0.00017619485,0.00046384078,0.0006240041,0.20143284,0.043112043,0.7161476,0.035718452,0.00012764029],"about_ca_topic_score_codex":0.0014402672,"about_ca_topic_score_gemma":0.0030099356,"teacher_disagreement_score":0.023082042,"about_ca_system_score_codex":0.0019083241,"about_ca_system_score_gemma":0.0018623493,"threshold_uncertainty_score":0.07721716},"labels":[],"label_agreement":null},{"id":"W1866973554","doi":"10.1007/11779568_90","title":"Generating Tutoring Feedback in an Intelligent Training System on a Robotic Simulator","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Montréal","funders":"","keywords":"Computer science; Simulation; Training (meteorology); Human–computer interaction; Artificial intelligence","score_opus":0.03945526250975288,"score_gpt":0.26051174319601816,"score_spread":0.2210564806862653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866973554","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.63125896,0.00008114728,0.35423958,0.00019895053,0.00007754241,0.00027712868,0.00009770612,0.0070284107,0.006740511],"genre_scores_gemma":[0.9516635,0.00004155638,0.043976128,0.000043666994,0.000013303033,0.00009148435,0.00009771858,0.00012280652,0.0039499253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999889,0.00003654504,0.000008038052,0.000025462572,0.000026016854,0.000015045874],"domain_scores_gemma":[0.9993679,0.00037125792,0.000030248495,0.000053243268,0.00010241925,0.000074890166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003236805,0.00047810035,0.00041888253,0.00024591095,0.00030266825,0.00041770205,0.0009112352,0.0008407523,0.004289874],"category_scores_gemma":[0.0015633255,0.00024791976,0.00019636903,0.00013797633,0.00021683764,0.00032149232,0.00057288806,0.00030278196,0.0004966678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023505122,0.00089157076,0.0071744467,0.00025291988,0.000108334476,0.0020621922,0.0017155322,0.39123276,0.29073167,0.0023057375,0.0045021633,0.29667217],"study_design_scores_gemma":[0.00008943411,0.0005586818,0.0025454992,0.000014977173,0.000052278658,0.00022580838,0.00010527657,0.95533645,0.038024154,0.0008442523,0.0021742804,0.000028903745],"about_ca_topic_score_codex":0.0019557627,"about_ca_topic_score_gemma":0.0016946686,"teacher_disagreement_score":0.004289874,"about_ca_system_score_codex":0.00024133493,"about_ca_system_score_gemma":0.0003665576,"threshold_uncertainty_score":0.01435101},"labels":[],"label_agreement":null},{"id":"W1867591718","doi":"10.1007/978-3-319-23528-8_33","title":"Scoring and Classifying with Gated Auto-Encoders","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Guelph","funders":"","keywords":"Computer science; Artificial intelligence; Autoencoder; Encoder; Representation (politics); Probabilistic logic; Set (abstract data type); Machine learning; Extension (predicate logic); Simple (philosophy); Pattern recognition (psychology); Encoding (memory); Function (biology); Theoretical computer science; Deep learning","score_opus":0.02827276685641825,"score_gpt":0.2546110047077628,"score_spread":0.22633823785134458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867591718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039206248,0.0005126767,0.9506204,0.0005209029,0.00023383727,0.00013632495,0.00035239581,0.0051611923,0.0032559645],"genre_scores_gemma":[0.64113384,0.0003660056,0.33746392,0.0006710993,0.00028019384,0.00021491035,0.0019790023,0.0007130206,0.017177971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771667,0.00064338,0.00015929177,0.0005761358,0.00058779644,0.00031678285],"domain_scores_gemma":[0.9952815,0.002253223,0.00020447416,0.0010842471,0.0009594288,0.00021717681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025449768,0.0015502844,0.0019527589,0.0012580922,0.00071044586,0.002145588,0.0027889952,0.0026580845,0.006957075],"category_scores_gemma":[0.008580462,0.00089065346,0.0012039865,0.0009453394,0.0009339627,0.0026433845,0.0032828224,0.0026832076,0.0040357597],"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.00056915684,0.00026425134,0.003974496,0.00017551439,0.0001553744,0.00026183185,0.000110006644,0.21309699,0.020139039,0.023840131,0.015700687,0.72171247],"study_design_scores_gemma":[0.000015576068,0.000041033134,0.00031894114,0.00001597831,0.00002694632,0.000069625064,0.000015432086,0.97477084,0.0067944517,0.017095266,0.0008227562,0.00001322181],"about_ca_topic_score_codex":0.0031298702,"about_ca_topic_score_gemma":0.006933827,"teacher_disagreement_score":0.006957075,"about_ca_system_score_codex":0.00092163734,"about_ca_system_score_gemma":0.0016236997,"threshold_uncertainty_score":0.023273766},"labels":[],"label_agreement":null},{"id":"W1867809419","doi":"10.1007/978-3-642-21268-0_7","title":"Towards a Model of Social Coherence in Multi-agent Organizations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Coherence (philosophical gambling strategy); Computer science; Social organization; Social force model; Artificial intelligence; Management science; Knowledge management; Sociology; Engineering; Mathematics","score_opus":0.0528860209914885,"score_gpt":0.26777139394008065,"score_spread":0.21488537294859214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867809419","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.017849525,0.000346121,0.9541214,0.0028251058,0.00008822159,0.00009360006,0.000104648105,0.00022299266,0.024348283],"genre_scores_gemma":[0.67507684,0.0005946482,0.31278282,0.00054820837,0.00021704198,0.000575135,0.00026019613,0.0001572111,0.00978793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793327,0.0012285919,0.00011971063,0.00023389682,0.0003274731,0.00015706698],"domain_scores_gemma":[0.99589926,0.002380617,0.00033258775,0.0006046217,0.00046076483,0.00032215228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724638,0.000575982,0.0009317784,0.0011617203,0.0019484385,0.0046054763,0.0031092686,0.0031583705,0.00493138],"category_scores_gemma":[0.008531511,0.00077060156,0.0012835537,0.0018484357,0.0052484423,0.009677041,0.0037810365,0.0035351536,0.00072053657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007920815,0.000015078385,0.00012123284,0.000018549808,0.000007029596,0.000039571903,0.0004715817,0.0134248845,0.00013495988,0.9831632,0.00038978894,0.0022060631],"study_design_scores_gemma":[0.000014038083,0.000010975912,0.000055419172,0.000010965501,0.000007059041,0.000019266927,0.00016571338,0.0944641,0.00006985812,0.9024869,0.0026881616,0.000007497838],"about_ca_topic_score_codex":0.0044994773,"about_ca_topic_score_gemma":0.0036491982,"teacher_disagreement_score":0.00493138,"about_ca_system_score_codex":0.0021461432,"about_ca_system_score_gemma":0.002039079,"threshold_uncertainty_score":0.016497135},"labels":[],"label_agreement":null},{"id":"W1867947061","doi":"10.1007/978-3-540-73345-4_38","title":"Towards a Metrics-Based Framework for Assessing Comprehension of Software Visualization Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Concordia University","funders":"","keywords":"Visualization; Computer science; Software visualization; Comprehension; Information visualization; Visual analytics; Program comprehension; Context (archaeology); Human–computer interaction; Domain (mathematical analysis); Data science; Creative visualization; Variety (cybernetics); Software; Data visualization; Software engineering; Software system; Artificial intelligence; Component-based software engineering; Programming language","score_opus":0.061536321860768,"score_gpt":0.36057287457589393,"score_spread":0.2990365527151259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867947061","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.025270434,0.0006482132,0.9636448,0.00081382925,0.000038716375,0.0005224526,0.00057850726,0.0029316524,0.005551411],"genre_scores_gemma":[0.15829822,0.00026278888,0.838357,0.000088591456,0.000024190402,0.00055473606,0.0010747178,0.00024549995,0.0010942329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98465586,0.006086637,0.002020706,0.0013314794,0.0054488475,0.00045649166],"domain_scores_gemma":[0.96522695,0.015755422,0.004415478,0.0026604955,0.011012167,0.00092944846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01476688,0.002625662,0.0013821392,0.0128264725,0.0010573686,0.010287995,0.0035169323,0.002541018,0.00274141],"category_scores_gemma":[0.056622006,0.0010178869,0.0013736632,0.005712986,0.0020754505,0.009536249,0.004319724,0.0027811285,0.0009335788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027547067,0.0008230128,0.05511294,0.0013831933,0.000574286,0.00022519453,0.0066065853,0.03464397,0.02616663,0.12538168,0.013918636,0.7348885],"study_design_scores_gemma":[0.00009668765,0.001268284,0.06827875,0.0012701905,0.00042765847,0.00090327975,0.006032401,0.56244016,0.027117336,0.29448444,0.037292074,0.00038873518],"about_ca_topic_score_codex":0.007389641,"about_ca_topic_score_gemma":0.0073194476,"teacher_disagreement_score":0.01476688,"about_ca_system_score_codex":0.002942414,"about_ca_system_score_gemma":0.00406105,"threshold_uncertainty_score":0.078095675},"labels":[],"label_agreement":null},{"id":"W1868231939","doi":"10.1007/978-3-540-69968-2_1","title":"Combining a High-Throughput Bioinformatics Grid and Bioinformatics Web Services","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Institute for Marine Biosciences; University of Calgary","funders":"","keywords":"Grid; Computer science; Grid computing; Turnaround time; Throughput; Web service; Software; Resource (disambiguation); Distributed computing; Sequence database; Adaptation (eye); Smith–Waterman algorithm; Load balancing (electrical power); Hidden Markov model; Bioinformatics; Sequence alignment; World Wide Web; Operating system; Artificial intelligence; Computer network; Wireless; Biology","score_opus":0.016754219292729813,"score_gpt":0.24087637836273407,"score_spread":0.22412215907000427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868231939","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.028286066,0.0013920092,0.90071344,0.003751022,0.0007786806,0.00028906093,0.00047657042,0.041899767,0.022413526],"genre_scores_gemma":[0.19203712,0.002260023,0.7748509,0.0016048613,0.00057487504,0.00021528274,0.003726507,0.0034335183,0.021296859],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866533,0.00025957383,0.000096701304,0.0001775513,0.0006404682,0.00016033585],"domain_scores_gemma":[0.9980761,0.00041562787,0.000065996464,0.00074460503,0.00034795864,0.00034967647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248106,0.0008440454,0.00111881,0.0013539831,0.00089090725,0.0029714608,0.0031330793,0.0012600669,0.004761609],"category_scores_gemma":[0.002997012,0.0009521968,0.0012503375,0.003315683,0.00061275635,0.0043277196,0.004155792,0.002562801,0.004327623],"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.0016641275,0.0012886928,0.0067710713,0.0010363138,0.0007209566,0.0020009154,0.0004415735,0.060094904,0.097772054,0.097002916,0.13948144,0.5917251],"study_design_scores_gemma":[0.0004530366,0.00037929794,0.0027671685,0.00015729829,0.00037268206,0.0020017067,0.00020979058,0.48574477,0.076689355,0.1779312,0.25308123,0.00021247577],"about_ca_topic_score_codex":0.002618488,"about_ca_topic_score_gemma":0.0028258397,"teacher_disagreement_score":0.004761609,"about_ca_system_score_codex":0.00073181227,"about_ca_system_score_gemma":0.0014451363,"threshold_uncertainty_score":0.015929163},"labels":[],"label_agreement":null},{"id":"W1868235818","doi":"10.1007/978-3-642-22300-6_9","title":"Orthogonal Cartograms with Few Corners Per Face","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Face (sociological concept); Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Geometry; Mathematics; Computer science; Artificial intelligence; Computer vision; Computer graphics (images); Sociology","score_opus":0.01986018929487761,"score_gpt":0.22847626956806263,"score_spread":0.208616080273185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868235818","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.0354322,0.00045494677,0.8543366,0.00022144718,0.0006960908,0.00018122474,0.00058101164,0.0016908814,0.1064056],"genre_scores_gemma":[0.24641405,0.0012921556,0.6790872,0.00026003126,0.00022792703,0.00018577899,0.0011841507,0.0013522574,0.06999643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996935,0.000045816723,0.00001857554,0.000058600148,0.00014126467,0.000042237334],"domain_scores_gemma":[0.9996247,0.00006167165,0.000030001895,0.00013471805,0.00010834691,0.000040525876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039955,0.0007535129,0.00059383013,0.0010992714,0.00038248932,0.000930986,0.00062737643,0.000585148,0.024388194],"category_scores_gemma":[0.00099433,0.0006781918,0.0004623089,0.0009356457,0.0006464204,0.0009294753,0.0014071019,0.0010775488,0.006828588],"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.0004826935,0.000091987764,0.00060876523,0.0003923245,0.000043558364,0.00041298103,0.00022160131,0.026094673,0.058250763,0.25990957,0.034281265,0.61920977],"study_design_scores_gemma":[0.00022627403,0.0005936286,0.0028750894,0.00028835208,0.00012662378,0.0053556,0.0005744172,0.32806826,0.0823431,0.22082995,0.35855335,0.00016533765],"about_ca_topic_score_codex":0.00057392503,"about_ca_topic_score_gemma":0.001014093,"teacher_disagreement_score":0.024388194,"about_ca_system_score_codex":0.00015932095,"about_ca_system_score_gemma":0.00038750548,"threshold_uncertainty_score":0.08158666},"labels":[],"label_agreement":null},{"id":"W1868837168","doi":"10.1007/978-3-642-33996-7_19","title":"Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Blocking (statistics); Extension (predicate logic); Set (abstract data type); Core (optical fiber); Mathematics; Combinatorics; Graph; Independent set; Nash equilibrium; Bargaining problem; Computer science; Discrete mathematics; Mathematical optimization; Mathematical economics","score_opus":0.0607029547653649,"score_gpt":0.2469232900001583,"score_spread":0.18622033523479342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868837168","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.029467367,0.00012685177,0.96374166,0.00020245623,0.00007750795,0.0000944846,0.000082790066,0.0005356752,0.005671242],"genre_scores_gemma":[0.73468995,0.0002371947,0.254652,0.00021532945,0.00012615338,0.0005361638,0.00038743264,0.00057533337,0.008580458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984875,0.0006010748,0.00007645489,0.00028043034,0.00033462953,0.00022000716],"domain_scores_gemma":[0.99095786,0.0063739168,0.00061845285,0.0010428512,0.0006056254,0.00040128944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920642,0.0012628675,0.0018915244,0.0015333039,0.0013178963,0.0023570813,0.0034640718,0.0017489034,0.0076034227],"category_scores_gemma":[0.017469816,0.0010151371,0.0011902949,0.0013754547,0.0018820883,0.0036044435,0.0032823947,0.002991314,0.00094344263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037366772,0.00010778068,0.00040462264,0.0000818966,0.00006604965,0.000034036333,0.00015675105,0.8167791,0.0017951315,0.12722284,0.0031730935,0.04980499],"study_design_scores_gemma":[0.00002288443,0.000018158406,0.000022913126,0.000006507114,0.000008953983,0.0000056802405,0.000013952372,0.94610864,0.0003125702,0.053215664,0.0002590868,0.000004943666],"about_ca_topic_score_codex":0.0025187538,"about_ca_topic_score_gemma":0.0032514,"teacher_disagreement_score":0.0076034227,"about_ca_system_score_codex":0.0020125925,"about_ca_system_score_gemma":0.0014830169,"threshold_uncertainty_score":0.025436044},"labels":[],"label_agreement":null},{"id":"W1869164539","doi":"10.1007/978-3-540-73625-7_31","title":"Automated Power Gating of Registers Using CoDeL and FSM Branch Prediction","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Low-power high-performance VLSI design","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 Victoria","funders":"","keywords":"Computer science; Power gating; Benchmark (surveying); Compiler; Gating; Embedded system; Clock gating; Overhead (engineering); Parallel computing; Operating system; Voltage; Transistor; Engineering; Clock skew","score_opus":0.018756430367749745,"score_gpt":0.23714643544282887,"score_spread":0.21839000507507914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869164539","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.13810323,0.0010262949,0.7883081,0.00039603375,0.0002292931,0.00024000763,0.0009169136,0.061053675,0.009726468],"genre_scores_gemma":[0.63188744,0.00020870654,0.36094895,0.00025026832,0.0000714001,0.00020068817,0.00084889925,0.0012738548,0.004309829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.00008474896,0.000023335679,0.00009415164,0.00014661795,0.00006938667],"domain_scores_gemma":[0.998635,0.0007423507,0.00013756959,0.00027062217,0.00017833532,0.000036031546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037618287,0.0011024651,0.0006880918,0.001464039,0.00052834844,0.0009341537,0.0011960053,0.00044687564,0.0063550854],"category_scores_gemma":[0.0015830194,0.0005280796,0.00051572954,0.00089960283,0.00039762,0.0010122842,0.00047962586,0.00069737586,0.0013766617],"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.000646452,0.0001909544,0.0027573404,0.00026337613,0.00005128359,0.00018639633,0.00012464984,0.042633,0.100962296,0.0066179447,0.011962854,0.83360344],"study_design_scores_gemma":[0.00013858113,0.00029694376,0.0023418365,0.00007819917,0.00008054033,0.00019494005,0.000046246583,0.84305966,0.13150512,0.012719122,0.009489568,0.0000492692],"about_ca_topic_score_codex":0.0035499076,"about_ca_topic_score_gemma":0.008829907,"teacher_disagreement_score":0.0063550854,"about_ca_system_score_codex":0.0008537027,"about_ca_system_score_gemma":0.0018828533,"threshold_uncertainty_score":0.021259844},"labels":[],"label_agreement":null},{"id":"W1869857094","doi":"10.1007/978-3-540-27800-9_1","title":"Multi-service Oriented Broadcast Encryption","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Rekeying; Random oracle; Encryption; Service (business); Computer network; Key (lock); Scheme (mathematics); Computer security; Distributed computing; Public-key cryptography; Key management; Mathematics","score_opus":0.019669342267176985,"score_gpt":0.2500775009194586,"score_spread":0.2304081586522816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869857094","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.07009699,0.0027509197,0.7883694,0.0010571028,0.00065145997,0.00018530399,0.0003062141,0.0019625693,0.13462006],"genre_scores_gemma":[0.7643125,0.001794061,0.12450365,0.0004216321,0.0002861246,0.00014455244,0.0005260494,0.0002112962,0.10780013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998264,0.000027074368,0.0000087337085,0.000016684296,0.00007701112,0.000044211163],"domain_scores_gemma":[0.99982375,0.00003632545,0.000015730475,0.00004983364,0.000059144444,0.00001523705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020837842,0.0003413974,0.00031506663,0.00051018887,0.00043141906,0.0007842813,0.00027333206,0.00036916425,0.0038379834],"category_scores_gemma":[0.00029446767,0.00010996933,0.00021946486,0.00051897607,0.00030791358,0.00071927696,0.00049443095,0.0007098395,0.001867549],"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.0006722385,0.00012069417,0.00035811454,0.0003431777,0.00003819841,0.00047933563,0.00031697156,0.012596652,0.12685575,0.45098662,0.023166902,0.3840653],"study_design_scores_gemma":[0.00013227717,0.0005433365,0.0015070223,0.00014500413,0.000115421746,0.0045425254,0.00024913554,0.31803527,0.2034494,0.21912977,0.25207207,0.00007873812],"about_ca_topic_score_codex":0.0003179929,"about_ca_topic_score_gemma":0.0005080577,"teacher_disagreement_score":0.0038379834,"about_ca_system_score_codex":0.0005494802,"about_ca_system_score_gemma":0.00036989345,"threshold_uncertainty_score":0.012839317},"labels":[],"label_agreement":null},{"id":"W1870024457","doi":"10.1007/978-3-642-15745-5_53","title":"Real Time Ultrasound Needle Image Simulation Using Multi-dimensional Interpolation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Imaging phantom; Computer vision; Computer science; Interpolation (computer graphics); Artificial intelligence; Similarity (geometry); Orientation (vector space); Image (mathematics); Mathematics; Optics; Physics; Geometry","score_opus":0.01462378465535504,"score_gpt":0.30931334231469304,"score_spread":0.294689557659338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870024457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24274093,0.00026926145,0.74344385,0.00035509004,0.00014702158,0.00014878725,0.00023923247,0.001985492,0.010670333],"genre_scores_gemma":[0.8746524,0.00012869926,0.12175779,0.00005660589,0.000015927568,0.000092243994,0.00012170206,0.00017108305,0.0030034678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974555,0.00007409318,0.000016767119,0.000031440653,0.00010211878,0.00002991997],"domain_scores_gemma":[0.9989287,0.0006772487,0.00009763841,0.00008927376,0.00015101922,0.0000561237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005347777,0.0005586639,0.0006364244,0.00045282123,0.0003584486,0.00080793427,0.0009329098,0.0016077306,0.0039579235],"category_scores_gemma":[0.0024100258,0.0005025235,0.0006473233,0.00049666496,0.00049963646,0.00058697315,0.0008375272,0.00060426083,0.00039645666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016609898,0.000050632698,0.0006330564,0.000052940442,0.00001604119,0.00014016728,0.00008609726,0.98474914,0.004672633,0.0018821042,0.00016865885,0.007382445],"study_design_scores_gemma":[0.000011209499,0.00002001647,0.000064976564,0.0000021536096,0.0000026847076,0.000018723496,0.000005604319,0.99875474,0.0008264216,0.0001447823,0.00014474268,0.0000040760933],"about_ca_topic_score_codex":0.0063338717,"about_ca_topic_score_gemma":0.0033857056,"teacher_disagreement_score":0.0063338717,"about_ca_system_score_codex":0.00061930006,"about_ca_system_score_gemma":0.0007690474,"threshold_uncertainty_score":0.013240576},"labels":[],"label_agreement":null},{"id":"W1870111070","doi":"10.1007/978-3-642-40084-1_20","title":"Quantum One-Time Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Quantum; Security token; Computer security","score_opus":0.015593843567203888,"score_gpt":0.22748629728263156,"score_spread":0.21189245371542767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870111070","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033987537,0.002646977,0.23690061,0.0042812075,0.00081474683,0.00007485077,0.00026007503,0.0005534005,0.7204806],"genre_scores_gemma":[0.6376162,0.003947388,0.055185918,0.0009001472,0.0008193155,0.00023599842,0.00037937317,0.00064559217,0.30027008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996424,0.00007029237,0.000012273039,0.000047167006,0.0001768637,0.00005100397],"domain_scores_gemma":[0.9995987,0.00018977042,0.000025511683,0.000081873,0.00006355258,0.000040654377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040651843,0.00048627137,0.000494557,0.0006797752,0.00090862473,0.0014594232,0.0007393841,0.000640158,0.015005245],"category_scores_gemma":[0.0012960952,0.00024775317,0.00046247506,0.000978936,0.0020824247,0.0027517828,0.0010475352,0.0022149256,0.002018184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004151647,0.0000050365693,0.00000818719,0.000016562411,0.0000011828998,0.000003230233,0.000035397698,0.000406928,0.00019144487,0.9911942,0.0014530083,0.006680747],"study_design_scores_gemma":[0.0000049166974,0.000004519088,0.00003528158,0.000013418685,0.00000258635,0.000017146447,0.000011444426,0.002565285,0.00043890678,0.9816877,0.015214669,0.0000039577026],"about_ca_topic_score_codex":0.00039481922,"about_ca_topic_score_gemma":0.0005002493,"teacher_disagreement_score":0.015005245,"about_ca_system_score_codex":0.0011901151,"about_ca_system_score_gemma":0.00059318834,"threshold_uncertainty_score":0.050197482},"labels":[],"label_agreement":null},{"id":"W1870196768","doi":"10.1007/978-3-540-74260-9_26","title":"Deformation Weight Constraint and 3D Reconstruction of Nonrigid Objects","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Affine transformation; Computer science; Rigid transformation; Constraint (computer-aided design); Artificial intelligence; Computer vision; Euclidean space; Algorithm; Invariant (physics); Mathematics; Geometry","score_opus":0.014914778667924664,"score_gpt":0.2559819940266279,"score_spread":0.24106721535870324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870196768","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.012060257,0.0004027768,0.9843662,0.00011301849,0.000043746844,0.000017527038,0.00007015276,0.00015307669,0.002773298],"genre_scores_gemma":[0.2597651,0.0017546418,0.7199859,0.00010634187,0.00009378124,0.00008789623,0.00055322883,0.000656921,0.01699622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996356,0.000052645042,0.000018241468,0.00006410234,0.00020698729,0.000022433282],"domain_scores_gemma":[0.99971336,0.000113856804,0.000041319578,0.000078699064,0.00003806411,0.00001474321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003587556,0.0006945745,0.00087906286,0.0006547372,0.0002686749,0.0011755499,0.0011565369,0.0010976989,0.0028406857],"category_scores_gemma":[0.0017226319,0.00087028864,0.0005878835,0.0011983241,0.000893518,0.0014346009,0.0014849111,0.0011560224,0.0007859591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016692677,0.00006015212,0.0004370786,0.0003924029,0.00005427713,0.00029426906,0.00021799757,0.3873124,0.07163298,0.15999663,0.003984925,0.37544993],"study_design_scores_gemma":[0.000008836842,0.000027342374,0.00041849713,0.000021329504,0.000009790993,0.0002915257,0.000027977194,0.9279574,0.012377549,0.05251988,0.0063084695,0.00003128812],"about_ca_topic_score_codex":0.0021982882,"about_ca_topic_score_gemma":0.00264024,"teacher_disagreement_score":0.0028406857,"about_ca_system_score_codex":0.00035937995,"about_ca_system_score_gemma":0.00043374705,"threshold_uncertainty_score":0.009503067},"labels":[],"label_agreement":null},{"id":"W1870211331","doi":"10.1007/11944935_13","title":"Text Mining Through Semi Automatic Semantic Annotation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"University of Toronto; Queen's University","funders":"","keywords":"Annotation; Computer science; Semantic annotation; Information retrieval; Natural language processing; Artificial intelligence","score_opus":0.01645471353785901,"score_gpt":0.24815726148980818,"score_spread":0.23170254795194917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870211331","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.013771438,0.00055778684,0.9656375,0.00037614795,0.00020900377,0.00023590695,0.0026229615,0.011248778,0.0053405175],"genre_scores_gemma":[0.11651532,0.0007786226,0.8576313,0.00020481941,0.00017674176,0.0005209094,0.014161094,0.0011843942,0.008826699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817,0.00046850854,0.00022641984,0.00040067546,0.00065365166,0.00008068245],"domain_scores_gemma":[0.9954136,0.0023262461,0.00025217762,0.0007580759,0.0011790592,0.000070936156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615149,0.0010228261,0.0009638499,0.0049575386,0.0011068865,0.0023323714,0.0012685366,0.0007698136,0.00435577],"category_scores_gemma":[0.005742403,0.00061113085,0.0012739495,0.0045548202,0.0009666023,0.0039069327,0.0022248577,0.0012513435,0.005918967],"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.000341306,0.00018352491,0.0014009797,0.0008061239,0.000115624476,0.00034751912,0.0006189868,0.0047601876,0.05173935,0.025451073,0.025371563,0.88886374],"study_design_scores_gemma":[0.00008279605,0.00023672324,0.0031855796,0.00042215656,0.00039353935,0.0015209119,0.0010132506,0.47683233,0.17971013,0.19418004,0.1422713,0.00015122067],"about_ca_topic_score_codex":0.0013182579,"about_ca_topic_score_gemma":0.0021250057,"teacher_disagreement_score":0.0049575386,"about_ca_system_score_codex":0.00044684214,"about_ca_system_score_gemma":0.00129645,"threshold_uncertainty_score":0.014571488},"labels":[],"label_agreement":null},{"id":"W1870290102","doi":"10.1007/978-3-540-73331-7_30","title":"Effects of Cognitive Training on Individual Differences in Attention","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural and Behavioral Psychology Studies","field":"Neuroscience","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognitive psychology; Cognition; Selective attention; Training (meteorology); Action (physics); Psychology; Neuroscience","score_opus":0.1712653034988458,"score_gpt":0.35699801941832937,"score_spread":0.18573271591948357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870290102","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.99550277,0.0006631018,0.00033467833,0.00014426686,0.00016433549,0.000038316444,0.00015882982,0.000052175703,0.0029414613],"genre_scores_gemma":[0.99317944,0.0007017108,0.00060200976,0.00016870913,0.00013682288,0.00010507946,0.0002090221,0.000075113734,0.004822076],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999744,0.000050344635,0.000020176947,0.00007446752,0.000041862662,0.00006922091],"domain_scores_gemma":[0.99790466,0.0014041767,0.00015807727,0.00016224488,0.000061737745,0.00030903512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041374343,0.00072831236,0.00089441874,0.0002531641,0.00023377557,0.0004975603,0.0006149318,0.0006122677,0.010238822],"category_scores_gemma":[0.002842399,0.0003287074,0.00034123144,0.00030878608,0.00062708824,0.00043966292,0.00058657,0.001266176,0.00057521666],"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.1985825,0.0247018,0.0052738846,0.0009821227,0.00079492823,0.00041419084,0.00075324083,0.0027680704,0.616398,0.0011474062,0.0020960225,0.14608788],"study_design_scores_gemma":[0.016059179,0.09922242,0.55799973,0.00030908038,0.0031523553,0.00092420203,0.0007139439,0.012559345,0.29429802,0.0067884303,0.007790518,0.00018276587],"about_ca_topic_score_codex":0.0014499666,"about_ca_topic_score_gemma":0.0010204546,"teacher_disagreement_score":0.010238822,"about_ca_system_score_codex":0.000275615,"about_ca_system_score_gemma":0.00032594876,"threshold_uncertainty_score":0.034252286},"labels":[],"label_agreement":null},{"id":"W1870633701","doi":"10.1007/978-3-642-14706-7_11","title":"Using Equivalence Relations for Corrective Enforcement of Security Policies","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université Laval","funders":"","keywords":"Enforcement; Computer science; Equivalence (formal languages); Security policy; Computer security; A priori and a posteriori; Field (mathematics); Theoretical computer science; Discrete mathematics; Mathematics; Law; Political science","score_opus":0.04954532813948358,"score_gpt":0.3139285724215557,"score_spread":0.2643832442820721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870633701","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.0075672385,0.00010029227,0.98450524,0.0002174269,0.00012796625,0.00008798541,0.000036698104,0.0032172236,0.004139825],"genre_scores_gemma":[0.35775107,0.0002244593,0.63586986,0.0003379052,0.00016724042,0.00016557632,0.00024421915,0.0012911508,0.003948489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9860399,0.004515917,0.0011524768,0.0020180827,0.0052092746,0.0010643695],"domain_scores_gemma":[0.96760565,0.016644359,0.001564871,0.0107884295,0.0030414902,0.00035510774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009180087,0.0011948922,0.0010281604,0.0022731037,0.0012380907,0.002646494,0.002614584,0.0018386906,0.0061286483],"category_scores_gemma":[0.0380695,0.001045357,0.0018724333,0.00088674104,0.003827446,0.008185494,0.0040408745,0.0048783333,0.0012626065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044096523,0.00037508234,0.0011799874,0.00039563412,0.00011294346,0.00049373234,0.0009365534,0.04201306,0.019744385,0.57576185,0.0058640786,0.35268182],"study_design_scores_gemma":[0.00010803251,0.0001745169,0.00042396228,0.00012950134,0.00015001588,0.0003359333,0.00012846023,0.28682327,0.04319836,0.6517305,0.01671487,0.00008259498],"about_ca_topic_score_codex":0.0016230883,"about_ca_topic_score_gemma":0.0017247037,"teacher_disagreement_score":0.009180087,"about_ca_system_score_codex":0.0012763275,"about_ca_system_score_gemma":0.0020166412,"threshold_uncertainty_score":0.048549533},"labels":[],"label_agreement":null},{"id":"W1870700426","doi":"10.1007/978-3-642-01680-6_12","title":"Evidence-Based Insights about Issue Management Processes: An Exploratory Study","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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 Calgary","funders":"","keywords":"Computer science; Context (archaeology); Process (computing); Data science; Exploratory research; Software development; Software development process; Empirical research; Software; Software engineering; Knowledge management","score_opus":0.042271127125060655,"score_gpt":0.2900931711198417,"score_spread":0.24782204399478103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870700426","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.97074294,0.0010938691,0.011305502,0.0025366507,0.000023608538,0.00059101556,0.00016841115,0.000019340232,0.0135187125],"genre_scores_gemma":[0.9923327,0.0006243176,0.005937336,0.0001772758,0.000014497066,0.00022903964,0.000103998325,0.000011622111,0.00056913006],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.96818495,0.022401178,0.0023137135,0.0009613088,0.0054849,0.00065385824],"domain_scores_gemma":[0.38952258,0.5775694,0.017064005,0.0059275567,0.008390043,0.0015263491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04383738,0.00038155535,0.0005462775,0.0039939317,0.0027906215,0.0065593356,0.0020705587,0.0020571228,0.0043488787],"category_scores_gemma":[0.2788437,0.00071744085,0.00039457748,0.004392382,0.0028814385,0.009128527,0.0039611054,0.0033453526,0.0003141111],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014154263,0.0030071123,0.1141615,0.0026194577,0.00015963281,0.002884901,0.67035204,0.0007071841,0.0032119912,0.03843159,0.0013852209,0.1616639],"study_design_scores_gemma":[0.0003915042,0.0028305755,0.15100804,0.0036439572,0.00032335005,0.003596805,0.74316674,0.0051513007,0.0048830034,0.0541114,0.030751897,0.0001414582],"about_ca_topic_score_codex":0.0007782161,"about_ca_topic_score_gemma":0.001238113,"teacher_disagreement_score":0.04383738,"about_ca_system_score_codex":0.0019165494,"about_ca_system_score_gemma":0.0042132344,"threshold_uncertainty_score":0.23183703},"labels":[],"label_agreement":null},{"id":"W1870724964","doi":"10.1007/978-3-540-73066-8_2","title":"New Approach for EFSM-Based Passive Testing of Web Services","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Extended finite-state machine; Initialization; Automaton; Fault (geology); Finite-state machine; Fault detection and isolation; Homing (biology); Fault management; Web application; Artificial intelligence; Real-time computing; Algorithm; World Wide Web; Programming language; Engineering; Actuator","score_opus":0.02856033740541997,"score_gpt":0.26136831168928704,"score_spread":0.23280797428386707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870724964","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.010537214,0.00016978383,0.9839878,0.00007991969,0.00007310911,0.00008273617,0.000045637644,0.0021496962,0.0028742473],"genre_scores_gemma":[0.35965797,0.0001704154,0.6328167,0.00025129045,0.00009598738,0.00022780754,0.00028042702,0.00033767326,0.0061618127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982198,0.0004054968,0.00013410856,0.0003436161,0.0007287181,0.00016821495],"domain_scores_gemma":[0.998166,0.00064833066,0.00009711067,0.0005011753,0.0005267999,0.00006061339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244327,0.0009130416,0.0008655455,0.0013560401,0.0005118484,0.0011889259,0.0025137053,0.0010717252,0.0032756918],"category_scores_gemma":[0.0023826882,0.0003385181,0.00079097843,0.00056345674,0.0007157012,0.0016555247,0.0014373364,0.0011337202,0.00072951237],"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.0005310872,0.00063711934,0.0035462284,0.0005659749,0.00020412027,0.0008261891,0.00040750057,0.058182117,0.1356326,0.075121015,0.005009024,0.7193369],"study_design_scores_gemma":[0.00007501371,0.00026159122,0.0009847055,0.0000658604,0.00012639837,0.0010042047,0.0000698872,0.89606637,0.043633547,0.0455573,0.012112814,0.000042261705],"about_ca_topic_score_codex":0.0011974542,"about_ca_topic_score_gemma":0.0016418081,"teacher_disagreement_score":0.0032756918,"about_ca_system_score_codex":0.0005619491,"about_ca_system_score_gemma":0.0008409286,"threshold_uncertainty_score":0.010958254},"labels":[],"label_agreement":null},{"id":"W1871031609","doi":"10.1007/11946441_34","title":"Interference Aware Dynamic Subchannel Allocation in a Multi-cellular OFDMA System Based on Traffic Situation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Network Optimization","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":"Queen's University","funders":"","keywords":"Channel allocation schemes; Quality of service; Computer science; Telecommunications link; Interference (communication); Orthogonal frequency-division multiple access; Computer network; Bandwidth (computing); Orthogonal frequency-division multiplexing; Dynamic bandwidth allocation; WiMAX; Adaptability; Bandwidth allocation; Channel (broadcasting); Frequency-division multiple access; Spectral efficiency; Real-time computing; Telecommunications; Wireless","score_opus":0.0104139913745345,"score_gpt":0.20929974076377855,"score_spread":0.19888574938924405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871031609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36612654,0.0012909835,0.62082976,0.00029975374,0.00015057565,0.0000416192,0.00008402565,0.00047082923,0.010706008],"genre_scores_gemma":[0.9770569,0.0002304959,0.021425858,0.00003076657,0.000042219355,0.000013448202,0.000025200763,0.000019039522,0.0011560975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984264,0.00004028925,0.000006341457,0.00003180911,0.000041265965,0.000037674454],"domain_scores_gemma":[0.99968684,0.00015123333,0.000023376355,0.00002382621,0.000086452,0.000028402517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020471879,0.0003662343,0.00059192575,0.00023513648,0.0004523816,0.00059872185,0.00045360927,0.00027924846,0.00073251314],"category_scores_gemma":[0.00071717973,0.00021274065,0.00018635578,0.0003783999,0.00032524014,0.00042805378,0.00032106627,0.00034249402,0.00014081821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007459764,0.00015272782,0.003569977,0.00012263004,0.00010628525,0.0007554697,0.00028151742,0.6120225,0.20251031,0.010914387,0.0017432709,0.16707487],"study_design_scores_gemma":[0.0000061191085,0.000054274864,0.0012531443,0.0000037305042,0.000032390002,0.00018507181,0.000026935608,0.991727,0.0045805825,0.0018407825,0.00027610274,0.0000138963715],"about_ca_topic_score_codex":0.0013085708,"about_ca_topic_score_gemma":0.0028271624,"teacher_disagreement_score":0.0013085708,"about_ca_system_score_codex":0.00034773047,"about_ca_system_score_gemma":0.00027323983,"threshold_uncertainty_score":0.002601862},"labels":[],"label_agreement":null},{"id":"W1871316873","doi":"10.1007/978-3-540-69057-3_12","title":"User Identification Based on Handwritten Signatures with Haptic Information","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Haptic technology; Focus (optics); Signature (topology); Identification (biology); Artificial neural network; Biometrics; Artificial intelligence; Pattern recognition (psychology); Human–computer interaction; Speech recognition","score_opus":0.010430109290483958,"score_gpt":0.2158075068464149,"score_spread":0.20537739755593093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871316873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121560484,0.0013743324,0.84797734,0.00020137949,0.00048284937,0.00017177983,0.00021052889,0.0040584356,0.023962835],"genre_scores_gemma":[0.7996948,0.0008979011,0.16854014,0.00015871825,0.00015004774,0.00007021793,0.00021262845,0.00013473892,0.030140797],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906796,0.000174573,0.000042050833,0.00012569562,0.0004971832,0.00009248329],"domain_scores_gemma":[0.9987961,0.00046049035,0.0001598385,0.000289931,0.0002477425,0.00004589965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045185495,0.00067829713,0.00081788877,0.00066946977,0.00038649316,0.0011921864,0.000779052,0.0012677304,0.0064669596],"category_scores_gemma":[0.0024045922,0.0002830658,0.00028921766,0.0005952669,0.0004352219,0.0019177328,0.0010849873,0.00057620654,0.0047422056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013942715,0.00013656482,0.0017045739,0.00047827978,0.000043265794,0.00071164087,0.00024260322,0.003701385,0.34600893,0.004102743,0.0035766985,0.637899],"study_design_scores_gemma":[0.00010475188,0.0017880297,0.013238546,0.00024729603,0.00016352582,0.013160141,0.00033107653,0.30962476,0.63350284,0.006813635,0.020752728,0.00027259285],"about_ca_topic_score_codex":0.00016126478,"about_ca_topic_score_gemma":0.00026344848,"teacher_disagreement_score":0.0064669596,"about_ca_system_score_codex":0.00013948797,"about_ca_system_score_gemma":0.00022658642,"threshold_uncertainty_score":0.021634102},"labels":[],"label_agreement":null},{"id":"W1871468840","doi":"10.1007/978-3-642-00982-2_27","title":"A Cryptosystem Based on the Composition of Reversible Cellular Automata","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"Queen's University","funders":"","keywords":"Cryptosystem; Cellular automaton; Computer science; Automaton; Theoretical computer science; Neighbourhood (mathematics); Key (lock); Public key cryptosystem; Algorithm; Cryptography; Computer security; Mathematics","score_opus":0.013818549331408176,"score_gpt":0.21991515311317492,"score_spread":0.20609660378176675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871468840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07211979,0.0012722489,0.893848,0.00077279145,0.0010109307,0.00030088122,0.00015888081,0.002979247,0.027537264],"genre_scores_gemma":[0.7348543,0.0013122612,0.2443096,0.00026636478,0.00022273509,0.00024911747,0.00015549459,0.00018992242,0.018440166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958545,0.00009096936,0.000025772022,0.00008123672,0.00016176635,0.000054751337],"domain_scores_gemma":[0.99955946,0.00018656852,0.000032067794,0.00010810018,0.000073275216,0.000040529994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734996,0.0004486546,0.0007895966,0.00048331826,0.0008020091,0.0011941412,0.00070286304,0.0008306127,0.0044797254],"category_scores_gemma":[0.0011770115,0.00030619782,0.0005673606,0.00049296574,0.0009953257,0.0014334578,0.0012010552,0.0012701639,0.0010434058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005951435,0.00022355138,0.00036884117,0.0003983684,0.00011421601,0.00053867896,0.00023433703,0.07725371,0.11690382,0.6404892,0.0047614817,0.1581187],"study_design_scores_gemma":[0.00032206482,0.000448655,0.0002655687,0.00007928949,0.0001332515,0.00068007695,0.000044884135,0.58164,0.12368824,0.24922475,0.04336848,0.00010472364],"about_ca_topic_score_codex":0.0003991895,"about_ca_topic_score_gemma":0.00045050148,"teacher_disagreement_score":0.0044797254,"about_ca_system_score_codex":0.00047548683,"about_ca_system_score_gemma":0.0008033289,"threshold_uncertainty_score":0.014986217},"labels":[],"label_agreement":null},{"id":"W1871884361","doi":"10.1007/3-540-47967-8_45","title":"Feature-Preserving Medial Axis Noise Removal","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pruning; Computer science; Noise (video); Medial axis; Feature (linguistics); Boundary (topology); Artificial intelligence; Process (computing); Algorithm; Object (grammar); Pattern recognition (psychology); Computer vision; Topology (electrical circuits); Mathematics; Image (mathematics)","score_opus":0.013865325318178379,"score_gpt":0.2357107317657484,"score_spread":0.22184540644757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871884361","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.008291795,0.000308555,0.9877958,0.000075706805,0.0001039772,0.000022409065,0.0000784909,0.0009468817,0.0023763129],"genre_scores_gemma":[0.13121368,0.0008090028,0.84819615,0.00012196249,0.00014951437,0.00004999467,0.0005854741,0.0006969043,0.018177357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995597,0.000033580753,0.00002176502,0.00008288947,0.00025691176,0.000045099285],"domain_scores_gemma":[0.999485,0.00008745149,0.00004448853,0.00016351292,0.00018682008,0.000032700584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030717175,0.0014094018,0.0009073024,0.0009914114,0.00052595366,0.0010382013,0.0010542399,0.00097163446,0.0056736274],"category_scores_gemma":[0.0013785404,0.0005249417,0.000741878,0.0009228152,0.00055220176,0.0010488319,0.0012238928,0.00081560336,0.0041934694],"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.0005074095,0.00008760225,0.00036832402,0.00024807017,0.000056950405,0.00021842669,0.000091962786,0.012393448,0.3105447,0.010575338,0.005019363,0.6598883],"study_design_scores_gemma":[0.00005591374,0.00031250413,0.0026259546,0.000053726504,0.00013904014,0.002943376,0.00011659861,0.42743838,0.51355654,0.015040656,0.03765112,0.0000662392],"about_ca_topic_score_codex":0.0007889415,"about_ca_topic_score_gemma":0.0014228948,"teacher_disagreement_score":0.0056736274,"about_ca_system_score_codex":0.00020643802,"about_ca_system_score_gemma":0.0005222271,"threshold_uncertainty_score":0.018980145},"labels":[],"label_agreement":null},{"id":"W1871992796","doi":"10.1007/978-3-319-10428-7_15","title":"The Balance Constraint Family","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Computer science; Consistency (knowledge bases); Constraint (computer-aided design); Focus (optics); Domain (mathematical analysis); Polynomial; Local consistency; Balance (ability); Time complexity; Semantics (computer science); Upper and lower bounds; Algorithm; Decomposition; Decomposition method (queueing theory); Mathematical optimization; Theoretical computer science; Constraint satisfaction problem; Mathematics; Discrete mathematics; Artificial intelligence; Programming language","score_opus":0.011495926558907134,"score_gpt":0.22416679429028982,"score_spread":0.2126708677313827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871992796","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005252688,0.011784977,0.3832783,0.0026252274,0.00066121935,0.000084433916,0.0012539335,0.0004244092,0.5946349],"genre_scores_gemma":[0.28113413,0.036193345,0.2816253,0.0028487043,0.0025692198,0.0007204737,0.0052540475,0.001776209,0.38787854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938726,0.00012785915,0.000035383582,0.00014102139,0.00025702573,0.000051455027],"domain_scores_gemma":[0.99944764,0.0002106663,0.00003669297,0.00012984421,0.00013332517,0.00004179824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000847529,0.0009517246,0.00064577634,0.0014518705,0.0013507683,0.0025105844,0.0010923289,0.000836276,0.027743338],"category_scores_gemma":[0.0027070504,0.00059700356,0.00072621653,0.0030994155,0.0016931093,0.004812531,0.0013945198,0.0025881885,0.0073303035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016338354,0.000010041817,0.00005686717,0.000082224666,0.000008547358,0.000035568617,0.00007172413,0.0015880782,0.00043631415,0.90478563,0.023975305,0.068933375],"study_design_scores_gemma":[0.0000062374934,0.000006103063,0.00006339603,0.000056747354,0.0000066019556,0.00010942618,0.00002543525,0.0040229503,0.0004986722,0.8375719,0.15762322,0.000009343882],"about_ca_topic_score_codex":0.0016115967,"about_ca_topic_score_gemma":0.0012690508,"teacher_disagreement_score":0.027743338,"about_ca_system_score_codex":0.001211783,"about_ca_system_score_gemma":0.00092028774,"threshold_uncertainty_score":0.09281069},"labels":[],"label_agreement":null},{"id":"W1872058502","doi":"10.1007/3-540-45441-1_28","title":"iState: A Statechart Translator","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Programming language; Computer science; Notation; Pascal (unit); Java; Class (philosophy); Focus (optics); Code (set theory); Artificial intelligence; Mathematics; Arithmetic; Set (abstract data type)","score_opus":0.026493163383678214,"score_gpt":0.2792932405927002,"score_spread":0.252800077209022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872058502","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018819501,0.00006513115,0.91668165,0.0001526111,0.00036431177,0.0001300155,0.0011516017,0.0660345,0.013538214],"genre_scores_gemma":[0.12410079,0.00079761125,0.70423406,0.0007371315,0.00029548793,0.0011188162,0.007199021,0.059482083,0.102035046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991947,0.00016483659,0.00007793536,0.0001791275,0.00030986578,0.00007364324],"domain_scores_gemma":[0.9988508,0.00051215827,0.000059472448,0.0002933647,0.00023464608,0.000049477494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635407,0.0012080877,0.0006865178,0.0010097005,0.0005158259,0.0020910932,0.0012924605,0.0009920539,0.04232607],"category_scores_gemma":[0.0031543467,0.0010295213,0.0012730677,0.0007377597,0.0009886831,0.0029679097,0.0022910926,0.0019704623,0.018260842],"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.0006610695,0.00024686195,0.00056644547,0.001325996,0.00010876117,0.0008264244,0.0016764511,0.011250037,0.05038255,0.25730675,0.17163453,0.5040141],"study_design_scores_gemma":[0.00023585303,0.00018296503,0.00032169998,0.00033126233,0.00017331884,0.0007054122,0.00021139995,0.07670194,0.12380866,0.14246917,0.654733,0.00012528402],"about_ca_topic_score_codex":0.0005716654,"about_ca_topic_score_gemma":0.00076428184,"teacher_disagreement_score":0.04232607,"about_ca_system_score_codex":0.00051968516,"about_ca_system_score_gemma":0.0010421785,"threshold_uncertainty_score":0.14159477},"labels":[],"label_agreement":null},{"id":"W1872088823","doi":"10.1007/978-3-540-85363-3_30","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Constant (computer programming); Computer science; Function (biology); Combinatorics; Set (abstract data type); Computable function; String (physics); Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.02753479408787502,"score_gpt":0.27092340219700467,"score_spread":0.24338860810912966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872088823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026987381,0.0011805887,0.93115646,0.0018704175,0.0012093511,0.00019546792,0.00033303845,0.0019450356,0.035122357],"genre_scores_gemma":[0.6058956,0.0011208751,0.35456374,0.001229078,0.001467049,0.0007786967,0.0007725395,0.0015610253,0.032611467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98444104,0.005702021,0.00072816265,0.0031754223,0.0039913515,0.001962057],"domain_scores_gemma":[0.9527335,0.030815024,0.0013768835,0.011851108,0.0015677058,0.0016557997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009562922,0.0021549237,0.0037466467,0.0015328579,0.0035826236,0.0057106433,0.007268164,0.0044320375,0.013005645],"category_scores_gemma":[0.031502828,0.0021761595,0.0031926895,0.002285622,0.00526082,0.015203856,0.013836712,0.018972391,0.0044858735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012175757,0.00029043062,0.00021941679,0.0002789288,0.0000702286,0.00011151127,0.00026194818,0.031912528,0.0045850715,0.9131089,0.007011334,0.040932238],"study_design_scores_gemma":[0.00015768905,0.000118581265,0.00015135016,0.000058507707,0.000052966865,0.000103773134,0.00004237866,0.14275362,0.0043943184,0.8459523,0.0061532296,0.00006133813],"about_ca_topic_score_codex":0.00058317615,"about_ca_topic_score_gemma":0.0007925863,"teacher_disagreement_score":0.013005645,"about_ca_system_score_codex":0.0035589917,"about_ca_system_score_gemma":0.0041642445,"threshold_uncertainty_score":0.050574183},"labels":[],"label_agreement":null},{"id":"W1872117385","doi":"10.1007/978-3-642-10877-8_11","title":"The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Message passing; Task (project management); Set (abstract data type); Theoretical computer science; Distributed computing; Programming language","score_opus":0.009171732976890133,"score_gpt":0.23493539508187028,"score_spread":0.22576366210498014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872117385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09024826,0.0025385031,0.89453894,0.001832766,0.00032776524,0.00012212258,0.00047796965,0.00096144463,0.008952296],"genre_scores_gemma":[0.7004055,0.0012600463,0.29133317,0.0001904195,0.00053583895,0.00031897888,0.00065535627,0.0006401744,0.0046605207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975108,0.0007452319,0.00024836624,0.00037435285,0.0008818028,0.00023938232],"domain_scores_gemma":[0.97855854,0.016727757,0.0009842089,0.0019996907,0.0010847667,0.0006450502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032961299,0.0012172207,0.0021574723,0.0016865475,0.0010889993,0.0029077178,0.0031061808,0.0022414844,0.0033271967],"category_scores_gemma":[0.028561914,0.0010259354,0.0010974726,0.0018157485,0.002167258,0.007033102,0.0019672746,0.0039886776,0.0004508624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032734412,0.00026633288,0.0012974924,0.0013410227,0.00013568535,0.00015424019,0.00096250925,0.29891005,0.012180951,0.3834805,0.010510791,0.28748697],"study_design_scores_gemma":[0.00010553583,0.00024596014,0.0006248851,0.00008938671,0.00006144741,0.0000811951,0.00007154858,0.47719425,0.0047775134,0.51498365,0.0017268931,0.0000377642],"about_ca_topic_score_codex":0.0006863866,"about_ca_topic_score_gemma":0.0008334578,"teacher_disagreement_score":0.0033271967,"about_ca_system_score_codex":0.0014253611,"about_ca_system_score_gemma":0.0017971984,"threshold_uncertainty_score":0.017431855},"labels":[],"label_agreement":null},{"id":"W1872209150","doi":"10.1007/3-540-44968-x_29","title":"Tetrahedralization of Two Nested Convex Polyhedra","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Polyhedron; Tetrahedron; Combinatorics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Mathematics; Computer science; Convex set; Linear programming; Algorithm; Convex optimization; Geometry","score_opus":0.014932106861893857,"score_gpt":0.2543513308328067,"score_spread":0.23941922397091284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872209150","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.044990435,0.00009439983,0.919009,0.00013781279,0.00014502338,0.000101178346,0.00010781715,0.0002792998,0.035135075],"genre_scores_gemma":[0.5097299,0.00023774718,0.46389142,0.00009217954,0.000050062594,0.000204387,0.00047776967,0.00040196802,0.024914553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00006150825,0.000022015936,0.000067350586,0.0002998335,0.000053139258],"domain_scores_gemma":[0.99969983,0.000056981815,0.000021777,0.000071902876,0.00009890747,0.000050628598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024347857,0.00048253866,0.0007569971,0.0006629577,0.0006957912,0.0011488572,0.001168054,0.0006449896,0.0077197463],"category_scores_gemma":[0.0009659886,0.00043283918,0.00066373625,0.00063620304,0.0011333509,0.00073830853,0.0018369464,0.0015057563,0.0011449493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016296335,0.00015913065,0.0005404498,0.00018461255,0.00002940686,0.00045276363,0.000663557,0.33225602,0.036185686,0.467191,0.00579815,0.15637633],"study_design_scores_gemma":[0.00003276421,0.00007839072,0.00028802318,0.00003550103,0.000010914224,0.00024637076,0.00019015213,0.8811178,0.004533305,0.094458066,0.018983888,0.00002477549],"about_ca_topic_score_codex":0.0023184756,"about_ca_topic_score_gemma":0.0025268123,"teacher_disagreement_score":0.0077197463,"about_ca_system_score_codex":0.00044050865,"about_ca_system_score_gemma":0.0006950963,"threshold_uncertainty_score":0.025825143},"labels":[],"label_agreement":null},{"id":"W1872328440","doi":"10.1007/978-3-642-15711-0_27","title":"Quantification of Prostate Deformation due to Needle Insertion during TRUS-guided Biopsy","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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":"Western University; Robarts Clinical Trials","funders":"","keywords":"Biopsy; Prostate biopsy; Prostate; Prostate cancer; Computer science; Needle biopsy; Medicine; Radiology; Cancer; Internal medicine","score_opus":0.017377206167958528,"score_gpt":0.2814173086756189,"score_spread":0.2640401025076604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872328440","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.9278124,0.001090365,0.069391005,0.00008236754,0.00004620682,0.000056471257,0.00018706733,0.0003893757,0.000944648],"genre_scores_gemma":[0.9857305,0.00022529553,0.013205225,0.000026911463,0.000017460943,0.000017256956,0.00012605145,0.00007244016,0.00057871605],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.000101261794,0.000020564461,0.000052882475,0.00020549376,0.000044597426],"domain_scores_gemma":[0.9986939,0.00071014016,0.00020835934,0.00011353977,0.00017093155,0.00010319336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054494775,0.00039507603,0.00042036496,0.00058772694,0.00021808835,0.0006202822,0.0003842038,0.00069997064,0.00064919837],"category_scores_gemma":[0.0024553102,0.00043794245,0.00027222754,0.00059100863,0.00031516847,0.0004419907,0.00043385828,0.00035344582,0.00020840426],"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.003081061,0.00016850817,0.022816602,0.00036127988,0.00011098786,0.00044037166,0.00061055704,0.048671655,0.79603416,0.00031963972,0.0005059232,0.12687917],"study_design_scores_gemma":[0.00006574356,0.002304427,0.29058135,0.00007842396,0.00020837902,0.0028597452,0.00029617193,0.42783833,0.27379116,0.00039919946,0.0014097001,0.00016740404],"about_ca_topic_score_codex":0.00097534107,"about_ca_topic_score_gemma":0.001274827,"teacher_disagreement_score":0.00097534107,"about_ca_system_score_codex":0.00024797107,"about_ca_system_score_gemma":0.00035080628,"threshold_uncertainty_score":0.0028820038},"labels":[],"label_agreement":null},{"id":"W1872492457","doi":"10.1007/978-3-642-40763-5_22","title":"An Automatic Multi-atlas Segmentation of the Prostate in Transrectal Ultrasound Images Using Pairwise Atlas Shape Similarity","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency; University of British Columbia","funders":"Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Institute for Computing, Information and Cognitive Systems","keywords":"Computer science; Segmentation; Prostate brachytherapy; Artificial intelligence; Atlas (anatomy); Computer vision; Image segmentation; Metric (unit); Similarity (geometry); Brachytherapy; Ultrasound; Image registration; Pattern recognition (psychology); Medicine; Image (mathematics); Radiology; Radiation therapy","score_opus":0.01726767781539539,"score_gpt":0.2920572531421354,"score_spread":0.27478957532674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872492457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018927341,0.00051134627,0.9755774,0.0001270198,0.000058313348,0.00017222235,0.00025362385,0.003539671,0.0008330449],"genre_scores_gemma":[0.11826766,0.00048743858,0.8776595,0.0000926802,0.000050189647,0.00014962356,0.00073289964,0.0009963766,0.0015636117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985814,0.0002198479,0.00009889533,0.00035131729,0.00060580386,0.00014269707],"domain_scores_gemma":[0.99877316,0.00033019457,0.0001406336,0.00025192788,0.00041710422,0.00008703729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013593212,0.0010763664,0.0020613503,0.004191254,0.0010612048,0.00266015,0.0022260011,0.0019697628,0.002116801],"category_scores_gemma":[0.0032183575,0.0012306261,0.0028513463,0.0038014306,0.00067007873,0.0014516611,0.0025225936,0.0014771523,0.0015228832],"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.0005247763,0.00018059378,0.0025947783,0.0005573385,0.00046796538,0.00045364784,0.00044266056,0.068955295,0.12827389,0.0062091905,0.0061760093,0.78516394],"study_design_scores_gemma":[0.000060340928,0.00022140163,0.005050969,0.00006537776,0.00023656916,0.001794491,0.00018756934,0.91475767,0.061806258,0.008104256,0.0075863367,0.00012868889],"about_ca_topic_score_codex":0.010307508,"about_ca_topic_score_gemma":0.014654349,"teacher_disagreement_score":0.010307508,"about_ca_system_score_codex":0.000984951,"about_ca_system_score_gemma":0.003387693,"threshold_uncertainty_score":0.020495057},"labels":[],"label_agreement":null},{"id":"W1873263069","doi":"10.1007/978-3-642-21538-4_7","title":"Autonomous Haulage Systems – Justification and Opportunity","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mining Techniques and Economics","field":"Engineering","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 British Columbia","funders":"","keywords":"Haulage; Truck; Computer science; Fuel efficiency; Process (computing); Performance indicator; Key (lock); Consumption (sociology); Automotive engineering; Operations research; Engineering; Computer security; Business","score_opus":0.03648761106020723,"score_gpt":0.2166938267946454,"score_spread":0.18020621573443818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873263069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11334134,0.004077289,0.6170946,0.009589702,0.0005530552,0.000092796006,0.00024254994,0.00027603502,0.2547326],"genre_scores_gemma":[0.91430753,0.0011261123,0.05395533,0.00038361407,0.00049876445,0.00013577563,0.00014836753,0.00010192037,0.02934264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987363,0.00046230617,0.00006385842,0.00021393901,0.00038474702,0.00013877852],"domain_scores_gemma":[0.99502254,0.0031509234,0.00033887327,0.0007617494,0.0005061707,0.00021973475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019494402,0.00050901895,0.0007733193,0.0009985699,0.0024134777,0.0034825953,0.00117696,0.0033112091,0.008535545],"category_scores_gemma":[0.010321146,0.00055494887,0.00083530316,0.00081126235,0.0066348496,0.006278432,0.0023957891,0.003068626,0.00082087604],"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.0000032984813,0.0000026650466,0.000046891226,0.0000069581693,0.000002562701,0.000014848766,0.000053258806,0.00078965025,0.00005789719,0.997029,0.0004647924,0.0015281988],"study_design_scores_gemma":[0.0000033132899,0.000002505849,0.000034723264,0.000003314829,0.000001040484,0.00001884732,0.000019370247,0.003904861,0.000041365503,0.9944613,0.0015062406,0.000003102374],"about_ca_topic_score_codex":0.0009905787,"about_ca_topic_score_gemma":0.0013347148,"teacher_disagreement_score":0.008535545,"about_ca_system_score_codex":0.0014052385,"about_ca_system_score_gemma":0.00084770756,"threshold_uncertainty_score":0.028554201},"labels":[],"label_agreement":null},{"id":"W1873439862","doi":"10.1007/978-3-642-16561-0_29","title":"Certification of Software-Driven Medical Devices","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"McMaster University","funders":"","keywords":"Certification; Computer science; Medical software; Product certification; Product (mathematics); Software; Process (computing); Software engineering; Track (disk drive); Software quality; Engineering management; Risk analysis (engineering); Software development; Engineering; Management; Operating system; Medicine","score_opus":0.011316621436881905,"score_gpt":0.21627610423624813,"score_spread":0.2049594827993662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873439862","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.039958887,0.0024366537,0.88070136,0.0012863219,0.0004912602,0.00030575998,0.00015141253,0.002473586,0.072194844],"genre_scores_gemma":[0.77185756,0.001741523,0.19193955,0.00029156217,0.00020896671,0.00018562254,0.0006608034,0.000396604,0.032717843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715996,0.0007337251,0.0001233434,0.00024631762,0.0015463434,0.00019021338],"domain_scores_gemma":[0.9949084,0.0020221288,0.00026019863,0.0011466071,0.0015059423,0.00015672804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099644,0.0004095306,0.00039262316,0.0008070989,0.00040655216,0.0022484558,0.0015527775,0.0013344708,0.004767216],"category_scores_gemma":[0.010218884,0.00040108053,0.0004273199,0.00044386808,0.0014120296,0.0018354782,0.0015770663,0.0012117358,0.0012857536],"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.0001924355,0.00016160356,0.001700752,0.00058956235,0.000037423768,0.00064294675,0.00060254964,0.04274948,0.026538106,0.46491304,0.013838341,0.44803384],"study_design_scores_gemma":[0.00011804144,0.00041306322,0.0025293818,0.00086130045,0.000050656694,0.0018985873,0.00026094326,0.41212484,0.06597226,0.33704978,0.17863138,0.000089780806],"about_ca_topic_score_codex":0.00084002526,"about_ca_topic_score_gemma":0.00086876826,"teacher_disagreement_score":0.004767216,"about_ca_system_score_codex":0.00085864775,"about_ca_system_score_gemma":0.0016255381,"threshold_uncertainty_score":0.015947878},"labels":[],"label_agreement":null},{"id":"W1873547760","doi":"10.1007/978-3-642-12683-3_31","title":"Time and Space Efficient RNA-RNA Interaction Prediction via Sparse Folding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Folding (DSP implementation); Time complexity; Computer science; Algorithm; Computational complexity theory; Space (punctuation); Set (abstract data type); RNA; Reduction (mathematics); Theoretical computer science; Mathematics","score_opus":0.008569762429266898,"score_gpt":0.2218521403741716,"score_spread":0.2132823779449047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873547760","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.061830115,0.00024603138,0.9315956,0.00031903127,0.000061234234,0.000063935666,0.00042166142,0.0038735643,0.0015887578],"genre_scores_gemma":[0.5086864,0.00022455533,0.48404872,0.00018519023,0.00012365093,0.00018475259,0.0019600145,0.00030090119,0.0042858566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999632,0.00010509554,0.000020545049,0.000072061084,0.00011950023,0.00005082563],"domain_scores_gemma":[0.9983734,0.0010496632,0.000085266154,0.00023183272,0.00019511548,0.00006475865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006850489,0.000895279,0.0016542438,0.00068724767,0.00048438943,0.00073646114,0.0015786729,0.001164829,0.0030661311],"category_scores_gemma":[0.0022174877,0.0006180551,0.00086264603,0.0011125226,0.00052577147,0.0014159692,0.0013762631,0.0011017481,0.0011233991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007737673,0.00018900346,0.0013954896,0.00011759187,0.00009556049,0.0001501618,0.00006481455,0.657538,0.016905753,0.007819381,0.008418062,0.30653244],"study_design_scores_gemma":[0.000008396066,0.00001467434,0.000059576636,9.2011436e-7,0.0000030173762,0.000009852261,0.0000035750447,0.9966066,0.0010101878,0.0021985476,0.00008258581,0.0000020354437],"about_ca_topic_score_codex":0.0037422888,"about_ca_topic_score_gemma":0.0059117274,"teacher_disagreement_score":0.0037422888,"about_ca_system_score_codex":0.00042147364,"about_ca_system_score_gemma":0.0009147344,"threshold_uncertainty_score":0.0102571845},"labels":[],"label_agreement":null},{"id":"W1873730544","doi":"10.1007/11527862_20","title":"A Qualitative Spatio-temporal Abstraction of a Disaster Space","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Windsor","funders":"","keywords":"Abstraction; Computer science; Representation (politics); Motion (physics); Set (abstract data type); Traverse; Space (punctuation); Artificial intelligence; Human–computer interaction; Qualitative reasoning; Programming language; Geography","score_opus":0.02429685343336524,"score_gpt":0.2966705149862963,"score_spread":0.2723736615529311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873730544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017275186,0.0004985033,0.9417889,0.00077890395,0.00013968069,0.00008320344,0.0011581632,0.00070747314,0.03756989],"genre_scores_gemma":[0.6061128,0.001141559,0.37071022,0.00020034736,0.00010542914,0.00022452277,0.0010274708,0.0003170176,0.020160647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998354,0.000035509336,0.000010034942,0.00003121331,0.00005124152,0.000036664595],"domain_scores_gemma":[0.99956554,0.00015839019,0.000059384038,0.00006613733,0.0000844755,0.00006615525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039876372,0.00039441505,0.00030706462,0.0010557134,0.00084591814,0.002357845,0.0009782112,0.00067182886,0.012892013],"category_scores_gemma":[0.0012380453,0.00037962876,0.0007601861,0.0014111579,0.0021326644,0.002412025,0.0012513234,0.0011070921,0.0007562803],"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.000026775462,0.000009858684,0.00038501716,0.00010126583,0.0000099297085,0.00029158205,0.0011776795,0.039089266,0.0025438291,0.94671065,0.0021508771,0.0075032506],"study_design_scores_gemma":[0.000025658415,0.000029860777,0.00087659515,0.00007067267,0.000027387028,0.00033396925,0.0011162261,0.15325736,0.0011219364,0.78614336,0.056960206,0.000036652018],"about_ca_topic_score_codex":0.014715693,"about_ca_topic_score_gemma":0.012598192,"teacher_disagreement_score":0.014715693,"about_ca_system_score_codex":0.001061491,"about_ca_system_score_gemma":0.00093265285,"threshold_uncertainty_score":0.043128073},"labels":[],"label_agreement":null},{"id":"W1874190160","doi":"10.1007/3-540-45268-0_2","title":"Content Based Indexing and Retrieval in a Digital Library of Arabic Scripts and Calligraphy","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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 Saskatchewan","funders":"","keywords":"Search engine indexing; Computer science; Scripting language; Calligraphy; Information retrieval; Feature (linguistics); Feature extraction; Glyph (data visualization); Cursive; Artificial intelligence; Arabic; Visual Word; Visualization; Pattern recognition (psychology); Image retrieval; Natural language processing; Image (mathematics)","score_opus":0.019516869207877895,"score_gpt":0.21704200602613963,"score_spread":0.19752513681826173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874190160","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.57749367,0.00928092,0.22313553,0.0025168015,0.00046926414,0.0012951999,0.012210417,0.03292619,0.14067207],"genre_scores_gemma":[0.5355966,0.00506333,0.3107082,0.0005596313,0.00032851877,0.00036265596,0.015873007,0.0018408182,0.12966728],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968493,0.00007011064,0.000036074314,0.00005267034,0.0001123621,0.000043788343],"domain_scores_gemma":[0.9993525,0.00021981359,0.000035985846,0.000115517345,0.00020237666,0.000073801966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544818,0.00044469858,0.00082651316,0.0040029786,0.0013169979,0.002333003,0.00073634257,0.00060470763,0.01928678],"category_scores_gemma":[0.0015788918,0.00026794637,0.000406764,0.005532543,0.00040688404,0.0029495417,0.00078470295,0.00028869644,0.007844536],"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.0011824102,0.00042577993,0.0026286899,0.0008006454,0.00004194525,0.0014590635,0.0015520205,0.0036534783,0.06026711,0.008406542,0.070236415,0.84934586],"study_design_scores_gemma":[0.00030910803,0.0010208122,0.04402344,0.0005405086,0.0008641768,0.008268609,0.0080503775,0.21785204,0.27668026,0.020530004,0.42146295,0.0003976239],"about_ca_topic_score_codex":0.009527173,"about_ca_topic_score_gemma":0.009763275,"teacher_disagreement_score":0.01928678,"about_ca_system_score_codex":0.0010575041,"about_ca_system_score_gemma":0.0010047829,"threshold_uncertainty_score":0.06452072},"labels":[],"label_agreement":null},{"id":"W1874195712","doi":"10.1007/3-540-44798-9_12","title":"Temporal Properties of Self-Timed Rings","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Abstraction; Automaton; Simple (philosophy); Key (lock); Theoretical computer science; Interval (graph theory); Event (particle physics); Algorithm; Mathematics","score_opus":0.03178153337522161,"score_gpt":0.2561397302930787,"score_spread":0.22435819691785708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874195712","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.2802086,0.0015471515,0.6492897,0.00039138805,0.00023653418,0.00014995062,0.00045064645,0.0007035692,0.067022465],"genre_scores_gemma":[0.9414735,0.0006287332,0.045602426,0.00006952344,0.00021623044,0.00011924172,0.00022787011,0.000120374934,0.011542012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916005,0.0001857988,0.000076965596,0.0002046564,0.0002715796,0.0001009453],"domain_scores_gemma":[0.9969103,0.0017836178,0.00040418355,0.0004131502,0.000340481,0.00014835174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014912303,0.00030713223,0.00036100848,0.00090113713,0.0006415604,0.0018906728,0.0007860209,0.00040347787,0.0028365124],"category_scores_gemma":[0.0031999866,0.00043046783,0.00064848544,0.0006750321,0.0018524677,0.0038288312,0.00061213353,0.0009532466,0.00029685008],"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.000080156555,0.000017198872,0.00016929572,0.000055931352,0.0000105609415,0.00009926618,0.0002720655,0.0029442047,0.004919369,0.9847248,0.00034352718,0.0063634897],"study_design_scores_gemma":[0.00005386624,0.00008103333,0.0004722055,0.000024478431,0.000041881794,0.00026425262,0.000120126344,0.024988081,0.010871676,0.9529659,0.010094601,0.00002205431],"about_ca_topic_score_codex":0.00045946465,"about_ca_topic_score_gemma":0.00036822035,"teacher_disagreement_score":0.0028365124,"about_ca_system_score_codex":0.0007534196,"about_ca_system_score_gemma":0.00040966764,"threshold_uncertainty_score":0.009489119},"labels":[],"label_agreement":null},{"id":"W1874267771","doi":"10.1007/978-3-642-03641-5_1","title":"Multi-label Moves for MRFs with Truncated Convex Priors","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Western University","funders":"","keywords":"Prior probability; Piecewise; Computer science; Potts model; Regular polygon; Swap (finance); Cut; Algorithm; Range (aeronautics); Artificial intelligence; Mathematical optimization; Mathematics; Segmentation; Image segmentation; Statistical physics; Bayesian probability","score_opus":0.025363984385914636,"score_gpt":0.2878830357362171,"score_spread":0.26251905135030246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874267771","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.0014046064,0.00019701576,0.9969404,0.00016478954,0.000039963285,0.000027319442,0.000035367306,0.00015772658,0.001032922],"genre_scores_gemma":[0.07949883,0.0005882387,0.90036595,0.0002441452,0.0001995517,0.0003565299,0.00035935585,0.00066310505,0.017724285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897987,0.0003906962,0.000050258495,0.00022837253,0.00026287226,0.00008798326],"domain_scores_gemma":[0.99624336,0.0027376357,0.00022618656,0.0003462571,0.00026871337,0.00017776154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023808856,0.0015779134,0.002245016,0.0013207468,0.0011126131,0.0018717955,0.0032314046,0.003928085,0.007905953],"category_scores_gemma":[0.0102433795,0.0014935206,0.0016370362,0.0013784511,0.002432082,0.0027246624,0.0040060654,0.0041295495,0.001804675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001769454,0.00006546618,0.00022705055,0.00028822402,0.00007133991,0.00015885671,0.00024167493,0.62025195,0.005524039,0.23775664,0.00789102,0.12734677],"study_design_scores_gemma":[0.000013550305,0.000022280336,0.000047506182,0.000021041455,0.000008638065,0.00003756898,0.000013429107,0.9277767,0.0006437878,0.06923665,0.0021611943,0.000017681696],"about_ca_topic_score_codex":0.0063933586,"about_ca_topic_score_gemma":0.0070850006,"teacher_disagreement_score":0.007905953,"about_ca_system_score_codex":0.0019234106,"about_ca_system_score_gemma":0.0013538845,"threshold_uncertainty_score":0.026448071},"labels":[],"label_agreement":null},{"id":"W1874892428","doi":"10.1007/3-540-45140-4_2","title":"Why Is It So Difficult to Introduce RE Research Results into Mainstream RE Practice?","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Canada Research Chairs; University of Toronto; University of New Brunswick","funders":"","keywords":"Mainstream; Computer science; Data science","score_opus":0.03645989557913309,"score_gpt":0.3316178737241077,"score_spread":0.29515797814497463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874892428","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029169858,0.033005726,0.25164193,0.50502956,0.010873868,0.00016035695,0.00009005382,0.0019411829,0.16808744],"genre_scores_gemma":[0.64199305,0.025971498,0.16557446,0.0798701,0.011449171,0.00050159,0.0001798053,0.0020233481,0.072436914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.96649015,0.019068155,0.0015124358,0.0028207586,0.008533423,0.0015750853],"domain_scores_gemma":[0.8050731,0.14433828,0.0049398458,0.013971831,0.027799156,0.0038777662],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.04953112,0.00085608294,0.0011763055,0.0032605908,0.0031624655,0.017798003,0.0029321343,0.008812796,0.006606443],"category_scores_gemma":[0.09513797,0.0007992416,0.0005832787,0.0026500167,0.015806548,0.051783808,0.007374431,0.011342999,0.0040954067],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007327018,0.00021873225,0.0012760736,0.0013228204,0.0000515826,0.0003244026,0.015846372,0.00051935413,0.0021857691,0.76910216,0.04088784,0.16819164],"study_design_scores_gemma":[0.00005679543,0.00014429976,0.0012060323,0.0018415956,0.00003616874,0.0007439027,0.020051718,0.003002665,0.0031938872,0.60360664,0.3660436,0.00007267398],"about_ca_topic_score_codex":0.0013158695,"about_ca_topic_score_gemma":0.002089161,"teacher_disagreement_score":0.9504689,"about_ca_system_score_codex":0.0030825268,"about_ca_system_score_gemma":0.003563376,"threshold_uncertainty_score":0.2619487},"labels":[],"label_agreement":null},{"id":"W1875351242","doi":"10.1007/11429760_2","title":"Trust, Untrust, Distrust and Mistrust – An Exploration of the Dark(er) Side","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Distrust; Great Rift; Computer science; Field (mathematics); Phenomenon; Space (punctuation); Affect (linguistics); Maturity (psychological); Internet privacy; Epistemology; Computer security; Data science; Public relations; Political science; Psychology; Law; Physics; Philosophy","score_opus":0.017206611419892295,"score_gpt":0.23979631919168726,"score_spread":0.22258970777179496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875351242","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05532424,0.049592357,0.10118056,0.08323385,0.001081326,0.000044834294,0.00010671277,0.000114248425,0.70932186],"genre_scores_gemma":[0.9507285,0.014386428,0.0076733273,0.002659954,0.0008524748,0.0000454614,0.000029250286,0.00007772356,0.023546888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975534,0.0012977918,0.00006800153,0.00020033802,0.00062150107,0.00025896358],"domain_scores_gemma":[0.9914308,0.006647726,0.0004206327,0.0006940714,0.00044968433,0.0003570837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036704035,0.0005420922,0.00077834586,0.0014913171,0.0023492856,0.011852965,0.0012505953,0.004214325,0.0081002135],"category_scores_gemma":[0.0062832055,0.0006119305,0.00047886246,0.002037118,0.023332607,0.024298392,0.0049019363,0.0053162556,0.00080979406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008773939,0.0000061765645,0.000083305495,0.000026462933,0.000002523802,0.00004784133,0.0006548455,0.00019310621,0.000055809527,0.9928785,0.0008216897,0.0052209734],"study_design_scores_gemma":[0.0000034908087,0.0000061367823,0.00010282504,0.00007735564,0.0000028052646,0.00006732186,0.0006968584,0.0014772639,0.000056460736,0.9887072,0.008796179,0.0000060829657],"about_ca_topic_score_codex":0.0020228762,"about_ca_topic_score_gemma":0.0021482122,"teacher_disagreement_score":0.011852965,"about_ca_system_score_codex":0.0032191346,"about_ca_system_score_gemma":0.002014853,"threshold_uncertainty_score":0.02709788},"labels":[],"label_agreement":null},{"id":"W1875432820","doi":"10.1007/978-3-642-21341-0_19","title":"Computations with Uncertain Time Constraints: Effects on Parallelism and Universality","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Universality (dynamical systems); Computer science; Computation; Spacetime; Focus (optics); Theoretical computer science; Class (philosophy); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.015359543649017354,"score_gpt":0.22701599209689244,"score_spread":0.2116564484478751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875432820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38733366,0.0010274958,0.58310014,0.0017994717,0.0001478668,0.00009182045,0.0004504196,0.00110713,0.024942018],"genre_scores_gemma":[0.940725,0.00036513,0.056776516,0.00007078206,0.00012439281,0.000054489596,0.00012010363,0.00023828784,0.0015253054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735,0.0006101787,0.00021624348,0.000649638,0.0007812726,0.0003926351],"domain_scores_gemma":[0.95590127,0.031639345,0.0028332043,0.007212304,0.0012632662,0.0011506228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033172483,0.0006129304,0.0013048789,0.00064264325,0.0013855803,0.0032022046,0.002036425,0.0010474749,0.004305643],"category_scores_gemma":[0.030443897,0.0009272772,0.0012733702,0.0014350879,0.0040324456,0.01240232,0.0038592713,0.0033538486,0.00032091906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010184003,0.00012069001,0.002463085,0.00041167522,0.000104983876,0.00041660634,0.0009294215,0.17609517,0.0140176825,0.7452678,0.0015151526,0.05763937],"study_design_scores_gemma":[0.000044294793,0.00004467998,0.0005437571,0.000030909894,0.000053121472,0.0001087383,0.000102982885,0.20078202,0.006745228,0.79009897,0.0014177909,0.000027578932],"about_ca_topic_score_codex":0.00095726474,"about_ca_topic_score_gemma":0.0012358304,"teacher_disagreement_score":0.004305643,"about_ca_system_score_codex":0.00101514,"about_ca_system_score_gemma":0.0013738405,"threshold_uncertainty_score":0.017543495},"labels":[],"label_agreement":null},{"id":"W1875435316","doi":"10.1007/978-3-642-15470-6_40","title":"Enhancing Content-Based Image Retrieval Using Machine Learning Techniques","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"York University","funders":"","keywords":"Computer science; Ranking (information retrieval); Content-based image retrieval; Selection (genetic algorithm); Image retrieval; Divergence (linguistics); Artificial intelligence; Content (measure theory); Image (mathematics); Pattern recognition (psychology); Information retrieval; Machine learning; Feature (linguistics); Mathematics","score_opus":0.02779135706315779,"score_gpt":0.26705478015132206,"score_spread":0.23926342308816426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875435316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054039314,0.005755275,0.92715126,0.0003026456,0.00046600617,0.0002217829,0.00023048802,0.004398324,0.0074349237],"genre_scores_gemma":[0.19954157,0.004954179,0.7727242,0.0004922992,0.0006921401,0.00016573479,0.00090836745,0.0007042442,0.019817254],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999648,0.000047559693,0.000022262695,0.000046885983,0.00019360353,0.00004160207],"domain_scores_gemma":[0.9992779,0.00029768638,0.000054880114,0.00008884132,0.00025764867,0.000022962155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038967034,0.0009688917,0.0012275722,0.0020286448,0.00031893345,0.0010069108,0.00087079086,0.001087417,0.006372139],"category_scores_gemma":[0.0014369839,0.00031242095,0.0008254396,0.0016242563,0.00031724526,0.0019510727,0.00069747056,0.0007034031,0.00480988],"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.00026142827,0.00020822405,0.00019952512,0.00048635557,0.000058183912,0.0001319202,0.000037511796,0.0059520127,0.56360996,0.001118981,0.004359582,0.42357627],"study_design_scores_gemma":[0.0000736882,0.00048446964,0.002423839,0.000056759007,0.00038356165,0.0014115251,0.00007629723,0.33158895,0.64556426,0.0027636755,0.015110927,0.00006205086],"about_ca_topic_score_codex":0.00081103435,"about_ca_topic_score_gemma":0.0011012654,"teacher_disagreement_score":0.006372139,"about_ca_system_score_codex":0.00033763418,"about_ca_system_score_gemma":0.0002494869,"threshold_uncertainty_score":0.021316886},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"bench_or_experimental","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"bench_or_experimental","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W1875480853","doi":"10.1007/3-540-45711-9_21","title":"Codes, Involutions, and DNA Encodings","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":40,"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":"DNA computing; Computer science; Computation; DNA; Theoretical computer science; Encoding (memory); Algorithm; Computational problem; Artificial intelligence; Biology; Genetics","score_opus":0.016805049860248732,"score_gpt":0.2307862610184788,"score_spread":0.21398121115823007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875480853","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08589145,0.08778747,0.2523354,0.012001379,0.0031102062,0.00007677218,0.0006388676,0.0006468773,0.55751157],"genre_scores_gemma":[0.8176601,0.031818517,0.05352598,0.0014796705,0.0029473007,0.00021794389,0.0005993289,0.00018241318,0.09156873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.00016925186,0.00003034967,0.00007903595,0.00016954799,0.00006615097],"domain_scores_gemma":[0.9989374,0.00069035636,0.000073823394,0.00014839164,0.00010921863,0.000040850104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005392596,0.0006018941,0.00054603233,0.0016824068,0.0012094842,0.0030379551,0.00057666836,0.0012426232,0.0043778867],"category_scores_gemma":[0.0030261986,0.00030393363,0.00039656687,0.0023069375,0.004612472,0.003664873,0.0010990655,0.0021929322,0.0009662542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005163599,0.0000034007855,0.000019719297,0.000018641886,9.988313e-7,0.000011724751,0.000080097554,0.00038710452,0.00011832571,0.9888277,0.0015158061,0.009011323],"study_design_scores_gemma":[0.0000017471771,0.000003246334,0.000018567032,0.0000123044265,8.770791e-7,0.000026954292,0.0000241859,0.0005226153,0.000103824896,0.9913668,0.00791579,0.000003195989],"about_ca_topic_score_codex":0.00081085926,"about_ca_topic_score_gemma":0.00066475925,"teacher_disagreement_score":0.0043778867,"about_ca_system_score_codex":0.0013125513,"about_ca_system_score_gemma":0.0005315028,"threshold_uncertainty_score":0.014645457},"labels":[],"label_agreement":null},{"id":"W1875601660","doi":"10.1007/3-540-45537-x_9","title":"Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Bounding overwatch; Advanced Encryption Standard; Linear cryptanalysis; Computer science; Cryptanalysis; Hull; Cryptography; Mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.028921129306277712,"score_gpt":0.2675139365779389,"score_spread":0.2385928072716612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875601660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04372431,0.009216047,0.8305439,0.0061694114,0.0012421338,0.00017891136,0.0010844761,0.0067877504,0.10105312],"genre_scores_gemma":[0.6931455,0.0063385814,0.25006652,0.0024146002,0.0028450727,0.00045516648,0.0017069629,0.0031179797,0.039909575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9842768,0.0040039783,0.00061667716,0.0020704495,0.006259875,0.0027722951],"domain_scores_gemma":[0.95247066,0.030676207,0.0012931733,0.011075722,0.0034467194,0.0010376056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010035504,0.0032403343,0.004740959,0.0044428376,0.0035164726,0.00974528,0.008113987,0.0032400908,0.023549944],"category_scores_gemma":[0.045571446,0.0025309524,0.0031665824,0.0049376595,0.0052775852,0.020420425,0.010301103,0.00941762,0.008520063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020725336,0.00041266164,0.0014375804,0.0009188054,0.0003205506,0.00028408473,0.00039772704,0.27412254,0.009404902,0.49592254,0.047570646,0.16713548],"study_design_scores_gemma":[0.00009869818,0.00016630726,0.00045601424,0.00014811945,0.00013283534,0.00021412128,0.000072027,0.54612887,0.008456882,0.43504623,0.008957164,0.00012273515],"about_ca_topic_score_codex":0.0040004016,"about_ca_topic_score_gemma":0.007581233,"teacher_disagreement_score":0.023549944,"about_ca_system_score_codex":0.0061812997,"about_ca_system_score_gemma":0.0054042186,"threshold_uncertainty_score":0.07878244},"labels":[],"label_agreement":null},{"id":"W1875640459","doi":"10.1007/978-3-642-04268-3_59","title":"In Vivo OCT Coronary Imaging Augmented with Stent Reendothelialization Score","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Coronary Interventions and Diagnostics","field":"Medicine","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":"Hôpital Notre-Dame","funders":"","keywords":"Optical coherence tomography; Imaging phantom; Computer science; Artificial intelligence; Robustness (evolution); Outlier; Spline (mechanical); Stent; Computer vision; Biomedical engineering; Optics; Radiology; Medicine; Physics","score_opus":0.012923717590897318,"score_gpt":0.27454730818430423,"score_spread":0.2616235905934069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875640459","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.929459,0.0015305015,0.05877757,0.0004734791,0.00011351232,0.00013002961,0.0016624753,0.0008321784,0.0070213415],"genre_scores_gemma":[0.9578328,0.0012562472,0.037674017,0.00016047164,0.00022197122,0.00005757586,0.00062420923,0.00013743459,0.0020353408],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997603,0.00007452351,0.000025673515,0.00002068066,0.000079307545,0.000039644492],"domain_scores_gemma":[0.9993618,0.00020843388,0.000100844336,0.00008246059,0.00017762513,0.00006891936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052666327,0.0005489816,0.0004790307,0.0017237196,0.00018569878,0.0010563149,0.00026845722,0.0012022291,0.002632678],"category_scores_gemma":[0.0011965488,0.00039613954,0.00032333413,0.0008741294,0.00019843284,0.00062614854,0.00031427582,0.00047679577,0.00058012654],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064394316,0.0005559687,0.06545133,0.00056629063,0.00035332717,0.0035003817,0.00019507387,0.011156212,0.72914934,0.0010828599,0.002719017,0.17883083],"study_design_scores_gemma":[0.0003230523,0.0016663232,0.38020226,0.00018154006,0.0012428666,0.016527245,0.00035616706,0.2793178,0.31370327,0.001469719,0.004726664,0.00028309532],"about_ca_topic_score_codex":0.0013364543,"about_ca_topic_score_gemma":0.0030379319,"teacher_disagreement_score":0.002632678,"about_ca_system_score_codex":0.00015756152,"about_ca_system_score_gemma":0.00022668234,"threshold_uncertainty_score":0.008807182},"labels":[],"label_agreement":null},{"id":"W1875662944","doi":"10.1007/978-3-642-31298-4_21","title":"Dental X-Ray Image Segmentation and Object Detection Based on Phase Congruency","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Phase congruency; Segmentation; Image segmentation; Translation (biology); Invariant (physics); Rotation (mathematics); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.012936975064798273,"score_gpt":0.28433558803779246,"score_spread":0.27139861297299417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875662944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01215965,0.00090024376,0.98248565,0.00009354731,0.00007067243,0.00008866964,0.00008604604,0.00072452123,0.0033909667],"genre_scores_gemma":[0.08866625,0.0014877577,0.90464514,0.000105802246,0.00008683358,0.00010639377,0.0002703822,0.00024518344,0.0043862555],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995289,0.000042188836,0.000028609842,0.000116232986,0.00024916316,0.000034923312],"domain_scores_gemma":[0.9996001,0.00017814188,0.00003759376,0.00004628316,0.00011886617,0.000018972682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054818526,0.0005419628,0.0009421347,0.0018944371,0.0003206105,0.0012856134,0.0008866155,0.0009776377,0.0059297],"category_scores_gemma":[0.0013058492,0.0007749958,0.00076147716,0.0017112187,0.00057091203,0.0011533656,0.00082870707,0.0006706461,0.0030223816],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003289276,0.00006441422,0.000848491,0.00046123474,0.00005278763,0.00017262505,0.0001264076,0.004501523,0.36110228,0.0071585015,0.0017308348,0.62345195],"study_design_scores_gemma":[0.00012333416,0.00050581375,0.0142110875,0.0001614185,0.0003931089,0.004953046,0.00019347826,0.33826485,0.5863071,0.01693644,0.03779462,0.00015559408],"about_ca_topic_score_codex":0.00043000482,"about_ca_topic_score_gemma":0.0006387076,"teacher_disagreement_score":0.0059297,"about_ca_system_score_codex":0.0002737483,"about_ca_system_score_gemma":0.0006479044,"threshold_uncertainty_score":0.019836843},"labels":[],"label_agreement":null},{"id":"W1875842672","doi":"10.1007/978-3-319-08970-6_32","title":"Universe Polymorphism in Coq","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Type theory; Universe; Proof theory; Programming language; Extensionality; Calculus (dental); Theoretical computer science; Algebra over a field; Mathematics; Type (biology); Mathematical proof; Pure mathematics","score_opus":0.01729228904551775,"score_gpt":0.22450929487036242,"score_spread":0.20721700582484467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875842672","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.024219882,0.009376964,0.44752148,0.0063598463,0.0022300924,0.00008713313,0.00048613703,0.0024737662,0.5072447],"genre_scores_gemma":[0.642863,0.0054337443,0.12437105,0.002390036,0.0016260762,0.0002863375,0.00093974604,0.0030272459,0.21906272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895525,0.00028550328,0.00005024077,0.00021833567,0.00034631666,0.00014438444],"domain_scores_gemma":[0.9991548,0.00033597305,0.000037106478,0.00023267846,0.00019273908,0.00004667935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011297195,0.0005312559,0.0006852173,0.0013337142,0.0024470948,0.004015765,0.0008856518,0.0009439803,0.015083138],"category_scores_gemma":[0.0026910105,0.00053542265,0.00059879606,0.0026557092,0.003873766,0.0066299927,0.0025774194,0.003631165,0.0032027543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011911529,0.0000056339754,0.00006426834,0.00002607741,0.000002792397,0.00001816572,0.00017856895,0.00013244705,0.00021578756,0.97499543,0.0057518086,0.018597255],"study_design_scores_gemma":[0.000011018244,0.000007446093,0.00014814081,0.000040376075,0.0000078468265,0.00014252937,0.00008348224,0.0010507371,0.00083501794,0.88512355,0.112535216,0.0000145489785],"about_ca_topic_score_codex":0.0033825887,"about_ca_topic_score_gemma":0.0025473952,"teacher_disagreement_score":0.015083138,"about_ca_system_score_codex":0.0019268659,"about_ca_system_score_gemma":0.0012063535,"threshold_uncertainty_score":0.050458133},"labels":[],"label_agreement":null},{"id":"W187587118","doi":"10.1007/978-3-642-21535-3_5","title":"Activity Recognition in Smart Environments: An Information Retrieval Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"Université de Sherbrooke","funders":"","keywords":"Activity recognition; Computer science; Activities of daily living; Smart environment; Process (computing); Artificial intelligence; Machine learning; Home automation; Human–computer interaction; Internet of Things; World Wide Web","score_opus":0.03323290163610457,"score_gpt":0.23357183024126785,"score_spread":0.20033892860516328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187587118","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03192997,0.012609685,0.9427823,0.0035135515,0.00024867585,0.00024080752,0.0016004011,0.0015816992,0.005492954],"genre_scores_gemma":[0.42728332,0.019497102,0.52707815,0.0014922133,0.0020723771,0.0005707198,0.00608832,0.0004094703,0.015508382],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976495,0.0004217528,0.00028936903,0.00082168,0.00064157275,0.00017613007],"domain_scores_gemma":[0.9963833,0.002437489,0.00028776005,0.00037766877,0.00043280824,0.00008091503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019545867,0.0010433691,0.0039139553,0.003760396,0.0010523851,0.004046161,0.0030159801,0.004148944,0.0032024938],"category_scores_gemma":[0.008353255,0.00087462814,0.002001496,0.007011623,0.001339538,0.0077438434,0.0019509122,0.0018610735,0.0027177252],"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.00026529154,0.00043457779,0.003214401,0.0010290482,0.00018193445,0.0004785914,0.00050002715,0.040524997,0.0050821104,0.018089337,0.026579266,0.90362036],"study_design_scores_gemma":[0.0001559063,0.00032303197,0.005610976,0.00026975278,0.0003538248,0.0021256818,0.0017353711,0.7702864,0.010543607,0.18364495,0.024754923,0.00019562119],"about_ca_topic_score_codex":0.008191648,"about_ca_topic_score_gemma":0.005894334,"teacher_disagreement_score":0.008191648,"about_ca_system_score_codex":0.001011139,"about_ca_system_score_gemma":0.0010514456,"threshold_uncertainty_score":0.016287923},"labels":[],"label_agreement":null},{"id":"W1875872827","doi":"10.1007/978-3-540-24627-5_7","title":"Skyline Cardinality for Relational Processing","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":120,"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":"Skyline; Cardinality (data modeling); Computer science; Online analytical processing; Tuple; Extension (predicate logic); Data mining; Theoretical computer science; Database; Mathematics; Discrete mathematics; Data warehouse; Programming language","score_opus":0.030965914320897212,"score_gpt":0.2674929519471953,"score_spread":0.2365270376262981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875872827","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063741636,0.0012062566,0.9597185,0.00058228686,0.00026537466,0.000116188516,0.0017869733,0.009447668,0.020502592],"genre_scores_gemma":[0.08926879,0.0020552634,0.86825436,0.0004078266,0.0005787067,0.0003643184,0.0060952906,0.0049382807,0.02803722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832875,0.00029673727,0.00018944748,0.0002979958,0.00074934366,0.00013778418],"domain_scores_gemma":[0.9970458,0.0008691669,0.00013051809,0.0014947765,0.00035990356,0.00009985967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661893,0.00085925293,0.0012994095,0.0013230828,0.0011325468,0.003494833,0.0021116373,0.00073261786,0.022914281],"category_scores_gemma":[0.004677312,0.00094971736,0.0010437429,0.004299388,0.0012459969,0.011263498,0.002680843,0.0024665745,0.006366547],"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.00026703722,0.00007745981,0.0005055419,0.0005044775,0.000042551226,0.00008751986,0.000401526,0.008779222,0.005894229,0.54583746,0.075929545,0.36167347],"study_design_scores_gemma":[0.0000559047,0.00007343132,0.00043386276,0.00015994685,0.000053783227,0.00036384072,0.00015568601,0.061352506,0.013761453,0.68341696,0.24011092,0.000061657476],"about_ca_topic_score_codex":0.0011682281,"about_ca_topic_score_gemma":0.001736941,"teacher_disagreement_score":0.022914281,"about_ca_system_score_codex":0.0010563667,"about_ca_system_score_gemma":0.0009636943,"threshold_uncertainty_score":0.076655924},"labels":[],"label_agreement":null},{"id":"W1876005976","doi":"10.1007/978-3-540-73035-4_19","title":"Report on the Impact of a User-Centered Approach and Usability Studies for Designing Mobile and Context-Aware Cognitive Orthosis","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Sherbrooke","funders":"","keywords":"Usability; Context (archaeology); Cognition; Process (computing); Computer science; Human–computer interaction; User-centered design; Psychology","score_opus":0.10362977968059685,"score_gpt":0.34377876426321274,"score_spread":0.2401489845826159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876005976","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.87829614,0.0039110277,0.054376833,0.005079461,0.0013590159,0.0019014692,0.002685276,0.0011042537,0.051286563],"genre_scores_gemma":[0.91192454,0.0029823913,0.030423472,0.0017324496,0.0003028177,0.00097249064,0.0023699163,0.00046277323,0.048828967],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9956228,0.00096469745,0.00045245732,0.00028399404,0.0024434177,0.00023258943],"domain_scores_gemma":[0.97146827,0.013317201,0.0011216843,0.0016505707,0.011641868,0.000800411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008100896,0.0008901652,0.0004691871,0.001071275,0.000929737,0.0013517953,0.0012068098,0.0016127317,0.008304539],"category_scores_gemma":[0.017361976,0.00028783045,0.0008041737,0.00056312437,0.00065912947,0.0012170352,0.0010865461,0.0011934021,0.0020235057],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050851083,0.01602349,0.08669574,0.004527437,0.0006700185,0.008073385,0.055488165,0.0034377046,0.20129773,0.005901181,0.055148818,0.5576512],"study_design_scores_gemma":[0.0008893911,0.04403387,0.3211165,0.0019144932,0.0024734894,0.007942365,0.05398686,0.0074121226,0.33052015,0.0038115697,0.22549748,0.00040171848],"about_ca_topic_score_codex":0.004765099,"about_ca_topic_score_gemma":0.004297235,"teacher_disagreement_score":0.008304539,"about_ca_system_score_codex":0.000496709,"about_ca_system_score_gemma":0.0015756742,"threshold_uncertainty_score":0.04284215},"labels":[],"label_agreement":null},{"id":"W1876112628","doi":"10.1007/978-3-642-15205-4_21","title":"Formal Theories for Linear Algebra","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algebra over a field; Linear algebra; Theoretical computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.011148139607841716,"score_gpt":0.23994299268770977,"score_spread":0.22879485307986805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876112628","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064568697,0.043440115,0.20313056,0.010310252,0.0024569924,0.00009818586,0.00097359647,0.0013594155,0.73177403],"genre_scores_gemma":[0.41061676,0.03990211,0.087053806,0.002998146,0.0076833568,0.0005776551,0.00409917,0.0012285481,0.44584042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00017900873,0.00003502694,0.00007332337,0.00023800923,0.000059368936],"domain_scores_gemma":[0.9996131,0.0001786972,0.000020519361,0.00007872193,0.00008387238,0.000025160803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000685458,0.001189191,0.0010426239,0.0021536949,0.0018073476,0.0037640529,0.0012014483,0.0009697423,0.024665514],"category_scores_gemma":[0.0010939544,0.00088976754,0.0009572698,0.0028640481,0.0041642585,0.0076823165,0.0013872822,0.004908677,0.008035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035431854,0.0000086773825,0.0000151590175,0.000056221856,0.0000037909654,0.000008360332,0.00011959945,0.00019278706,0.00010918365,0.97864807,0.01096135,0.009873381],"study_design_scores_gemma":[0.00000593666,0.000003332293,0.00002657976,0.00002815434,0.0000035275468,0.000019690975,0.00003986805,0.0003725603,0.00008350977,0.9436701,0.055742864,0.0000038383073],"about_ca_topic_score_codex":0.0013856357,"about_ca_topic_score_gemma":0.0015161262,"teacher_disagreement_score":0.024665514,"about_ca_system_score_codex":0.0031380306,"about_ca_system_score_gemma":0.0011784256,"threshold_uncertainty_score":0.082514346},"labels":[],"label_agreement":null},{"id":"W1876221940","doi":"10.1007/11560548_8","title":"How Thorough Is Thorough Enough?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Counterexample; Abstraction; Model checking; Key (lock); Abstraction model checking; Theoretical computer science; Programming language; Computer security; Mathematics","score_opus":0.03237070675910247,"score_gpt":0.2823814480485241,"score_spread":0.25001074128942163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876221940","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.023036385,0.09219302,0.25032142,0.42056644,0.023267549,0.00095977506,0.0012118417,0.00512288,0.18332073],"genre_scores_gemma":[0.27156696,0.06621115,0.35061124,0.10446646,0.013387729,0.0020344602,0.0023560033,0.008438697,0.18092732],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98128617,0.008458948,0.0019411304,0.0016191375,0.0057471986,0.00094747427],"domain_scores_gemma":[0.8927252,0.046540823,0.0069992393,0.010510519,0.037517734,0.0057064705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.034004655,0.0011918157,0.0016290809,0.0033713356,0.002074701,0.009301563,0.0023727606,0.0034545755,0.015834553],"category_scores_gemma":[0.14048229,0.0011042425,0.0011266082,0.0015976279,0.004021632,0.022647357,0.0049328897,0.003821698,0.0083092805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016685485,0.00018756311,0.005105223,0.0036147237,0.00033366276,0.00045042433,0.0052923453,0.0010332266,0.0035297077,0.14642961,0.43580073,0.398056],"study_design_scores_gemma":[0.000055341352,0.0001194137,0.0034589325,0.0045414544,0.0003114794,0.0009314395,0.0037160525,0.00091686414,0.002528586,0.19376849,0.78954905,0.000102980324],"about_ca_topic_score_codex":0.0019211456,"about_ca_topic_score_gemma":0.0035779118,"teacher_disagreement_score":0.034004655,"about_ca_system_score_codex":0.0024428733,"about_ca_system_score_gemma":0.0076355194,"threshold_uncertainty_score":0.17983598},"labels":[],"label_agreement":null},{"id":"W1876349746","doi":"10.1007/978-3-642-23768-3_42","title":"Exploring Serendipity’s Precipitating Conditions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Serendipity; Computer science; Field (mathematics); Process (computing); Data science; Knowledge management; Epistemology","score_opus":0.4525752197007707,"score_gpt":0.4006079664650851,"score_spread":0.05196725323568557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876349746","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.83233595,0.0033876393,0.021894261,0.0051366286,0.00022548137,0.00028049893,0.00017950064,0.0002448934,0.13631521],"genre_scores_gemma":[0.99289274,0.00075468427,0.0034332154,0.00016471476,0.00003141281,0.000051583585,0.000058071204,0.000039161034,0.0025744685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970546,0.0010630724,0.0001515383,0.00046623204,0.00066412543,0.000600347],"domain_scores_gemma":[0.982533,0.010703999,0.0032435926,0.0011820808,0.0010157878,0.0013215732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004055875,0.00054612104,0.0005059381,0.0016192842,0.00395284,0.009697209,0.0013906539,0.0014540019,0.00806753],"category_scores_gemma":[0.018802185,0.00058056985,0.0005840982,0.0013054232,0.009067604,0.009877752,0.009337285,0.0035432207,0.0009417641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008039522,0.0005961475,0.09250251,0.0022176264,0.00015660723,0.0094658015,0.29541335,0.003445494,0.0118748285,0.45198697,0.007342428,0.12419427],"study_design_scores_gemma":[0.00010193486,0.00067730376,0.1144107,0.0023889698,0.00022395866,0.006603893,0.47474697,0.0074835327,0.021031626,0.23308362,0.13894455,0.0003029929],"about_ca_topic_score_codex":0.0014265854,"about_ca_topic_score_gemma":0.0023545935,"teacher_disagreement_score":0.009697209,"about_ca_system_score_codex":0.002744642,"about_ca_system_score_gemma":0.0030085035,"threshold_uncertainty_score":0.026988566},"labels":[],"label_agreement":null},{"id":"W1876472356","doi":"10.1007/978-3-540-77962-9_29","title":"Watson-Crick Conjugate and Commutative Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"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":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Mathematics; Watson; Commutative property; Palindrome; Conjugacy class; Combinatorics on words; Complementarity (molecular biology); Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; DNA; Computer science; Genome; Word (group theory); Base pair","score_opus":0.016543215355268887,"score_gpt":0.24889508872811086,"score_spread":0.23235187337284197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876472356","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.08573101,0.004420221,0.28942567,0.0015102421,0.00239209,0.00017976633,0.0002790199,0.00045496062,0.615607],"genre_scores_gemma":[0.60499996,0.0037154884,0.09221511,0.0010760723,0.0012722266,0.00046030065,0.0003068911,0.00059875567,0.29535517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00022896063,0.000065274,0.00019261231,0.00038033872,0.00010459843],"domain_scores_gemma":[0.99885654,0.00051016983,0.00010208345,0.00020624806,0.00023412594,0.000090907364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083418563,0.0008046562,0.0007626347,0.0015815498,0.001813017,0.0038642462,0.00093931716,0.0011434577,0.012434338],"category_scores_gemma":[0.003997716,0.00058961863,0.00054069347,0.001945827,0.0040607257,0.005199463,0.0015714953,0.002119262,0.0036250406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006756207,0.0000034563418,0.000009915187,0.00001005859,0.000001342155,0.000026773048,0.00006430727,0.00016201031,0.00024567428,0.99472445,0.0006846962,0.0040605674],"study_design_scores_gemma":[0.0000034607797,0.000006482208,0.0000170519,0.000005572208,0.0000021785813,0.00007182384,0.000029586026,0.0006476675,0.0008818271,0.9883195,0.010007277,0.000007522405],"about_ca_topic_score_codex":0.00053141214,"about_ca_topic_score_gemma":0.0004158062,"teacher_disagreement_score":0.012434338,"about_ca_system_score_codex":0.0010682391,"about_ca_system_score_gemma":0.0007614524,"threshold_uncertainty_score":0.04159701},"labels":[],"label_agreement":null},{"id":"W1876557134","doi":"10.1007/3-540-45813-1_36","title":"Time Series Model Mining with Similarity-Based Neuro-fuzzy Networks and Genetic Algorithms: A Parallel Implementation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"National Research Council Canada","funders":"","keywords":"Computer science; Granularity; Multivariate statistics; Algorithm; Dependency (UML); Data mining; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.01758930483008633,"score_gpt":0.24106116471400515,"score_spread":0.22347185988391882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876557134","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.015837777,0.00016712895,0.9805162,0.00009999408,0.00004637154,0.00008143365,0.000042154337,0.0015949822,0.0016139342],"genre_scores_gemma":[0.15177456,0.00013891344,0.8459223,0.0000588728,0.000042556574,0.0001550889,0.00010031032,0.00008349712,0.0017239407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969625,0.0000670566,0.000029764498,0.0000785106,0.00010159601,0.000026736685],"domain_scores_gemma":[0.99942786,0.00028137089,0.00003154547,0.00008453349,0.00015261587,0.000022026361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957902,0.00057358353,0.001073767,0.00074866053,0.00061192876,0.0010546804,0.0014646511,0.0010410675,0.0031662108],"category_scores_gemma":[0.0022468518,0.0004934006,0.00093894894,0.001255145,0.00040120864,0.0010854552,0.0007655049,0.00089148973,0.0007888159],"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.0003043152,0.00022506874,0.001147264,0.00010295061,0.00020057442,0.000114237766,0.00008716582,0.4299397,0.0048747608,0.011973503,0.0020703727,0.5489601],"study_design_scores_gemma":[0.000028439248,0.000018253057,0.00010359016,0.0000027454482,0.00002200618,0.000020556645,0.000007960046,0.99516207,0.0013459141,0.0029281431,0.00035637213,0.0000039121333],"about_ca_topic_score_codex":0.012344794,"about_ca_topic_score_gemma":0.012031432,"teacher_disagreement_score":0.012344794,"about_ca_system_score_codex":0.0007217808,"about_ca_system_score_gemma":0.001048287,"threshold_uncertainty_score":0.024545908},"labels":[],"label_agreement":null},{"id":"W1876588311","doi":"10.1007/11861201_83","title":"Information in Crowds: The Swarm Information Model","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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":"Carleton University","funders":"","keywords":"Crowds; Computer science; Point (geometry); Population; Artificial intelligence; Human–computer interaction; Machine learning; Computer security","score_opus":0.006976957711482927,"score_gpt":0.20031924272777127,"score_spread":0.19334228501628833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876588311","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.0270581,0.0072154365,0.8879144,0.0058519826,0.00070435775,0.000107894855,0.00065688684,0.00029934003,0.070191555],"genre_scores_gemma":[0.8140891,0.010697697,0.110690236,0.00080655084,0.0017689134,0.00039598055,0.00073684234,0.00028107708,0.06053357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.00016682278,0.00001963834,0.00007044468,0.00013430972,0.000047854683],"domain_scores_gemma":[0.9983625,0.0011160976,0.000114992356,0.0001302269,0.00017689822,0.00009931602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010381439,0.0008090194,0.0011962833,0.0011530152,0.0007841487,0.0027297854,0.0018874876,0.0027159294,0.0039061033],"category_scores_gemma":[0.0049449303,0.00062085735,0.0009421903,0.0017329017,0.0014627172,0.004747087,0.0015911598,0.0017091369,0.0008537629],"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.000042762866,0.000038742317,0.00033850348,0.00011249573,0.00003408124,0.00012379746,0.00020317106,0.22547841,0.0003481306,0.74502504,0.010183342,0.018071566],"study_design_scores_gemma":[0.000013243371,0.000013541534,0.00009401086,0.000027206044,0.000013118898,0.000050571132,0.000035392764,0.5609472,0.00009476058,0.43347794,0.005218076,0.000014922561],"about_ca_topic_score_codex":0.00375768,"about_ca_topic_score_gemma":0.0018980588,"teacher_disagreement_score":0.0039061033,"about_ca_system_score_codex":0.0012205278,"about_ca_system_score_gemma":0.0010754009,"threshold_uncertainty_score":0.013067186},"labels":[],"label_agreement":null},{"id":"W1876602362","doi":"10.1007/3-540-45156-0_16","title":"Shared Memory Contention and Its Impact on Multiprocessor Call Control Throughput","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Throughput; Parallel computing; Multiprocessing; Shared memory; Uniform memory access; Distributed computing; Memory management; Operating system; Semiconductor memory","score_opus":0.017673387639066614,"score_gpt":0.26728081795809905,"score_spread":0.24960743031903243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876602362","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.97682106,0.0028019662,0.009111543,0.0006076338,0.00013031228,0.000011215268,0.00017430232,0.00045574445,0.009886205],"genre_scores_gemma":[0.9985172,0.00014929852,0.00039928893,0.000013686475,0.000027617345,0.0000052607184,0.00003061063,0.000043269632,0.0008136965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881893,0.00029520874,0.000036082063,0.0001263702,0.00037390125,0.00034947484],"domain_scores_gemma":[0.97876906,0.018223165,0.00075203,0.00090494606,0.0009076783,0.00044320358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379354,0.00036769398,0.00051318354,0.0009081487,0.0007554769,0.0018782145,0.0009817769,0.0009239136,0.0060997386],"category_scores_gemma":[0.017064326,0.0005873333,0.00029199966,0.0018416703,0.00074806466,0.0020689021,0.00087375555,0.0013173122,0.0005929241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009594575,0.0013053506,0.057212286,0.0003472564,0.00036459343,0.0017573488,0.0013044459,0.5086799,0.16224436,0.041265845,0.008206295,0.20771766],"study_design_scores_gemma":[0.00017323396,0.0009091087,0.03909072,0.000036788544,0.00033428584,0.0007131234,0.00050699536,0.85970443,0.0813089,0.015121686,0.001998431,0.00010231268],"about_ca_topic_score_codex":0.0018155886,"about_ca_topic_score_gemma":0.0020906057,"teacher_disagreement_score":0.0060997386,"about_ca_system_score_codex":0.0011766887,"about_ca_system_score_gemma":0.00083221984,"threshold_uncertainty_score":0.02040565},"labels":[],"label_agreement":null},{"id":"W1877793656","doi":"10.1007/3-540-36563-x_12","title":"Hardware Performance Characterization of Block Cipher Structures","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Memorial University of Newfoundland","funders":"","keywords":"Block cipher; Computer science; Parameterized complexity; Differential cryptanalysis; Cipher; Linear cryptanalysis; Permutation (music); Advanced Encryption Standard; Theoretical computer science; Arithmetic; Cryptography; Algorithm; Mathematics; Encryption; Computer network","score_opus":0.01515064140990828,"score_gpt":0.24349314790596333,"score_spread":0.22834250649605503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877793656","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.6036755,0.004204662,0.3558464,0.0006102007,0.00017963527,0.00024560606,0.0011063415,0.00305848,0.03107317],"genre_scores_gemma":[0.9712362,0.0006268239,0.022138225,0.000053744378,0.000093692084,0.00009945044,0.00075540703,0.00021067455,0.0047858255],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987029,0.00020201456,0.00008996561,0.00015342099,0.0006667266,0.0001849467],"domain_scores_gemma":[0.9947523,0.003022691,0.00060902524,0.00087745005,0.0006427139,0.00009574488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085826864,0.0007469833,0.0005036046,0.0017339786,0.00036448234,0.0013367878,0.00087066396,0.0005487496,0.0047363127],"category_scores_gemma":[0.0052191378,0.00036006153,0.00028118992,0.0011942703,0.0006163535,0.0022118841,0.0004909528,0.000724223,0.0009406117],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028163665,0.00037695124,0.00573061,0.00066739117,0.000107465006,0.0003701002,0.000312128,0.14701673,0.3779468,0.20741603,0.008159957,0.24907939],"study_design_scores_gemma":[0.00009522526,0.00139178,0.0042806766,0.000086370506,0.00007416737,0.00088680297,0.00007594365,0.7003562,0.24123864,0.042733245,0.008713417,0.00006754156],"about_ca_topic_score_codex":0.0003529961,"about_ca_topic_score_gemma":0.0004666029,"teacher_disagreement_score":0.0047363127,"about_ca_system_score_codex":0.00122576,"about_ca_system_score_gemma":0.0006706048,"threshold_uncertainty_score":0.015844524},"labels":[],"label_agreement":null},{"id":"W1878054599","doi":"10.1007/978-3-642-15745-5_36","title":"Bayesian Classification of Multiple Sclerosis Lesions in Longitudinal MRI Using Subtraction Images","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NeuroRx Research (Canada); Montreal Neurological Institute and Hospital; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subtraction; Artifact (error); Multiple sclerosis; Computer science; Artificial intelligence; Pattern recognition (psychology); Bayesian probability; Magnetic resonance imaging; Data set; Radiology; Medicine; Mathematics","score_opus":0.03660848070202634,"score_gpt":0.28853833094714215,"score_spread":0.2519298502451158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878054599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41739336,0.0018061291,0.57784617,0.00040117925,0.00004939036,0.000057932866,0.0003484369,0.00082495826,0.0012723858],"genre_scores_gemma":[0.8843308,0.0008307438,0.1117255,0.00007688929,0.00007173776,0.0000442136,0.0006530818,0.00009331578,0.0021737546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965215,0.000106584754,0.000031304557,0.00007373503,0.00009021092,0.000045976903],"domain_scores_gemma":[0.99832255,0.0009444083,0.00020677573,0.00010751022,0.0003590728,0.00005969777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024544636,0.00047291504,0.0005767181,0.0016478044,0.00021746832,0.00092733506,0.0005771941,0.00095706916,0.00085933815],"category_scores_gemma":[0.0043336703,0.00044460708,0.0006687696,0.00043088046,0.0002461061,0.00068830134,0.00045618392,0.00052913034,0.00047352174],"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.0021412172,0.00044912708,0.05714779,0.00031448295,0.0004514131,0.00033134152,0.00020130428,0.13815218,0.09852284,0.0039616455,0.0035319577,0.6947947],"study_design_scores_gemma":[0.00003353272,0.00017304921,0.038760204,0.000042122723,0.00013219567,0.0005159303,0.000049619113,0.9384821,0.015951652,0.0048010307,0.0010153531,0.00004323607],"about_ca_topic_score_codex":0.0027320476,"about_ca_topic_score_gemma":0.004419704,"teacher_disagreement_score":0.0027320476,"about_ca_system_score_codex":0.0003645508,"about_ca_system_score_gemma":0.0005165548,"threshold_uncertainty_score":0.01298058},"labels":[],"label_agreement":null},{"id":"W1878146358","doi":"10.1007/978-3-540-30192-9_12","title":"XML Query Processing and Optimization","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; XML; Component (thermodynamics); Relational algebra; Query optimization; Theoretical computer science; Relational database; Programming language; Algebra over a field; Information retrieval; Mathematics; World Wide Web","score_opus":0.012734684969691695,"score_gpt":0.23850048064553828,"score_spread":0.2257657956758466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878146358","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.002806179,0.008689365,0.9395455,0.001554962,0.00040746207,0.00010706598,0.0004998597,0.002740433,0.043649085],"genre_scores_gemma":[0.06560718,0.012354782,0.79674584,0.0009836089,0.0012235305,0.00031907752,0.0032227251,0.0017779716,0.11776528],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975909,0.00047130286,0.00019749113,0.0004189057,0.0012067844,0.00011456844],"domain_scores_gemma":[0.99921405,0.00031872335,0.000029920351,0.00027815433,0.00013732444,0.000021859238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017568935,0.0012458747,0.0015433509,0.0012348603,0.0006790387,0.003330666,0.0020001403,0.00087478646,0.018481791],"category_scores_gemma":[0.0028994593,0.00094484864,0.0011918254,0.0035899319,0.0011060964,0.004017274,0.001759931,0.0021608018,0.008479677],"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.00011490172,0.00011244187,0.0002754068,0.00043754355,0.00007497869,0.00007747181,0.00014723143,0.018298851,0.0043587517,0.31863183,0.077234045,0.58023655],"study_design_scores_gemma":[0.000048392452,0.00007973189,0.00056215754,0.0001259458,0.00007621876,0.00048053588,0.000100702644,0.19791497,0.013249358,0.5002822,0.28702596,0.00005381287],"about_ca_topic_score_codex":0.0017293757,"about_ca_topic_score_gemma":0.0016559267,"teacher_disagreement_score":0.018481791,"about_ca_system_score_codex":0.0011985285,"about_ca_system_score_gemma":0.00087817543,"threshold_uncertainty_score":0.06182778},"labels":[],"label_agreement":null},{"id":"W1878146926","doi":"10.1007/3-540-44867-5_21","title":"A Framework for Designing Approximation Algorithms for Scheduling Problems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Fair-share scheduling; Two-level scheduling; Mathematical optimization; Rate-monotonic scheduling; Theoretical computer science; Algorithm; Mathematics; Schedule","score_opus":0.031226865099060152,"score_gpt":0.2595253631836189,"score_spread":0.22829849808455877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878146926","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.0005230602,0.00033881923,0.996929,0.00016732012,0.0000704394,0.000045576613,0.000034655102,0.00021858233,0.0016724244],"genre_scores_gemma":[0.028701978,0.0012874416,0.9668659,0.00018594251,0.00026467687,0.00037204928,0.00021671568,0.00020274948,0.0019025202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967103,0.0011890888,0.00023953401,0.00040119217,0.0011288375,0.0003310314],"domain_scores_gemma":[0.99626017,0.0022502574,0.0002054563,0.0006706147,0.00045651468,0.0001569868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053681773,0.0029322167,0.0025868139,0.0023633027,0.0017304873,0.0039832573,0.005227877,0.0023552657,0.0051643173],"category_scores_gemma":[0.013225249,0.0019349407,0.0035402353,0.0045108907,0.002266673,0.0052245054,0.0033164774,0.006664804,0.0022393973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000761802,0.00013947424,0.00022986556,0.0003284546,0.00008700815,0.000082447696,0.00017151273,0.23266456,0.0017110553,0.6485228,0.010351845,0.10563482],"study_design_scores_gemma":[0.000055929464,0.00006522511,0.000064073436,0.00009736473,0.000049306953,0.000078661506,0.00004518201,0.56310105,0.00080416666,0.41847533,0.017135793,0.000027881631],"about_ca_topic_score_codex":0.0031130088,"about_ca_topic_score_gemma":0.0033336354,"teacher_disagreement_score":0.0053681773,"about_ca_system_score_codex":0.0025315857,"about_ca_system_score_gemma":0.0026879637,"threshold_uncertainty_score":0.02838993},"labels":[],"label_agreement":null},{"id":"W1878475345","doi":"10.1007/978-3-642-40196-1_16","title":"SAT-Based Analysis and Quantification of Information Flow in Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information flow; Data-flow analysis; Data flow diagram; Database","score_opus":0.019598351513946476,"score_gpt":0.24359867699794685,"score_spread":0.22400032548400037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878475345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072696996,0.0005679623,0.9811859,0.00066497974,0.000088069006,0.000064579195,0.0002616076,0.0007848831,0.0091122985],"genre_scores_gemma":[0.3916881,0.0014677494,0.5911247,0.0006780622,0.00039812442,0.00037232463,0.0013160208,0.00096524396,0.01198976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927591,0.0031343244,0.0004132882,0.0010381882,0.0020655708,0.0005894792],"domain_scores_gemma":[0.98489714,0.011497248,0.0004257121,0.002045601,0.0009890303,0.00014532461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00514355,0.0016627888,0.0014973155,0.0032889019,0.0013102532,0.004485243,0.0039904052,0.0017345292,0.010848464],"category_scores_gemma":[0.019485341,0.0017587595,0.0045935432,0.0033099947,0.004997414,0.011760047,0.0037128842,0.0058723213,0.001458332],"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.00009831733,0.000058624042,0.0005073408,0.00031761764,0.00007873169,0.000052508873,0.00021874318,0.05531577,0.002372375,0.87910676,0.0030224998,0.05885075],"study_design_scores_gemma":[0.000011570364,0.000019544226,0.00021864513,0.0000795987,0.00004708396,0.00003697774,0.00003228949,0.17843562,0.0035450966,0.81426686,0.0032821351,0.000024635914],"about_ca_topic_score_codex":0.0030642762,"about_ca_topic_score_gemma":0.003622644,"teacher_disagreement_score":0.010848464,"about_ca_system_score_codex":0.0035629796,"about_ca_system_score_gemma":0.0025087008,"threshold_uncertainty_score":0.03629172},"labels":[],"label_agreement":null},{"id":"W187925356","doi":"10.1007/978-3-642-37484-5_47","title":"An Accurate Method for Line Detection and Manhattan Frame Estimation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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":"York University","funders":"","keywords":"Frame (networking); Line (geometry); Computer science; Estimation; Artificial intelligence; Computer vision; Mathematics; Engineering; Telecommunications; Geometry","score_opus":0.01665810174723548,"score_gpt":0.3022545675876076,"score_spread":0.2855964658403721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187925356","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.00070355367,0.00032654492,0.99689794,0.000029994393,0.000120997465,0.000015914595,0.000049835307,0.001284037,0.00057127664],"genre_scores_gemma":[0.017890861,0.00061861536,0.9720662,0.00007586857,0.00019654991,0.00006637024,0.0004740095,0.0004283491,0.008183119],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987381,0.00017256348,0.000054068114,0.00025263985,0.00070082303,0.00008192142],"domain_scores_gemma":[0.99857783,0.0003109541,0.00006794022,0.0003855075,0.00061277614,0.000044920995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063334266,0.0016824219,0.0014452271,0.0027404714,0.0007084096,0.0011506304,0.0021313387,0.0017274233,0.009214497],"category_scores_gemma":[0.002256038,0.0010910159,0.00093771436,0.0026938284,0.0005490229,0.002006665,0.0010988043,0.0017392418,0.010323801],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014477911,0.000080552825,0.0003297784,0.00019408538,0.000073848685,0.00014130559,0.00007050953,0.015852591,0.06669702,0.009800554,0.018223641,0.88839126],"study_design_scores_gemma":[0.000041760733,0.00016264748,0.0018027603,0.000060941296,0.00014598828,0.001477576,0.000055593402,0.78176045,0.12554789,0.0151923755,0.07360123,0.00015070247],"about_ca_topic_score_codex":0.0025044933,"about_ca_topic_score_gemma":0.003846885,"teacher_disagreement_score":0.009214497,"about_ca_system_score_codex":0.0005547889,"about_ca_system_score_gemma":0.00073708995,"threshold_uncertainty_score":0.030825555},"labels":[],"label_agreement":null},{"id":"W187936873","doi":"10.1007/978-3-642-40104-6_26","title":"Plane 3-trees: Embeddability and Approximation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Plane (geometry); Embedding; Approximation algorithm; Vertex (graph theory); Point (geometry); Discrete mathematics; Graph; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.014567519663892204,"score_gpt":0.23464193741514788,"score_spread":0.2200744177512557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187936873","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.057457216,0.009550153,0.8389286,0.0010847965,0.00042874244,0.00008341561,0.0007469854,0.0009917788,0.09072836],"genre_scores_gemma":[0.48437032,0.015904536,0.44046387,0.0004123296,0.0006179915,0.00018928609,0.0019645144,0.001193253,0.054883868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996823,0.00004643211,0.000019633144,0.00006756258,0.00015293027,0.000031139887],"domain_scores_gemma":[0.99938226,0.00029353308,0.000064758045,0.00015066464,0.00007189868,0.00003681103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026922877,0.00073804794,0.0008006746,0.001216045,0.00044495834,0.0023383764,0.0013121251,0.0009944575,0.0088400245],"category_scores_gemma":[0.002134381,0.00071593584,0.0006937013,0.0024351568,0.0011202146,0.0036171523,0.0014400821,0.003049435,0.0024120375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105716914,0.000045949302,0.00032792843,0.00030282498,0.000020680127,0.00011806594,0.00030866987,0.03642648,0.0045962147,0.71702474,0.012333579,0.22838911],"study_design_scores_gemma":[0.000026631496,0.000039097034,0.000354061,0.000077497156,0.00002381874,0.00041488183,0.0001154603,0.08446974,0.0029332568,0.86662036,0.04490344,0.000021739019],"about_ca_topic_score_codex":0.0011352521,"about_ca_topic_score_gemma":0.001313809,"teacher_disagreement_score":0.0088400245,"about_ca_system_score_codex":0.0007843826,"about_ca_system_score_gemma":0.00029202693,"threshold_uncertainty_score":0.029572845},"labels":[],"label_agreement":null},{"id":"W1879453025","doi":"10.1007/11427865_18","title":"VRML-Based 3D Collaborative GIS: A Design Perspective","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Modeling in Geospatial Applications","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"VRML; Computer science; Visualization; Focus (optics); The Internet; Human–computer interaction; Perspective (graphical); Software; Information visualization; Geographic information system; World Wide Web; Software engineering; Data mining; Artificial intelligence","score_opus":0.015422415471835812,"score_gpt":0.2386957322831925,"score_spread":0.22327331681135668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879453025","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.0018382969,0.0011528359,0.9800592,0.0006166344,0.000061723535,0.000035125573,0.000055704637,0.0007579588,0.015422404],"genre_scores_gemma":[0.1401937,0.004203602,0.82348406,0.00038175646,0.00016442033,0.00020380372,0.00041502158,0.00059660827,0.030357068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976357,0.00088938425,0.000097711985,0.00024851225,0.0009954207,0.00013322418],"domain_scores_gemma":[0.9977939,0.0011373995,0.0001336574,0.0004164081,0.00041342652,0.00010515651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024853898,0.0015157481,0.0009791963,0.0014328395,0.0006499741,0.007512334,0.0060170186,0.0035390179,0.009185471],"category_scores_gemma":[0.0048264638,0.0017769954,0.0009795825,0.0021411628,0.0034606154,0.0056224563,0.0023740195,0.0018313462,0.0025461947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008164836,0.000087831206,0.0003486267,0.00092299737,0.00007808376,0.00051985617,0.0023515983,0.0907999,0.015089509,0.7135257,0.008458419,0.16773571],"study_design_scores_gemma":[0.00006314971,0.00022766321,0.0004146607,0.00039201893,0.00016009388,0.0017927723,0.0011073966,0.39367664,0.0357353,0.18656401,0.37972164,0.00014469077],"about_ca_topic_score_codex":0.0053621694,"about_ca_topic_score_gemma":0.0041907663,"teacher_disagreement_score":0.009185471,"about_ca_system_score_codex":0.0014160447,"about_ca_system_score_gemma":0.0012326832,"threshold_uncertainty_score":0.03072846},"labels":[],"label_agreement":null},{"id":"W187952197","doi":"10.1007/978-3-642-40760-4_81","title":"Implications of Inconsistencies between fMRI and dMRI on Multimodal Connectivity Estimation","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; Correlation; Diffusion MRI; Functional magnetic resonance imaging; Resting state fMRI; Artificial intelligence; Pattern recognition (psychology); Neuroimaging; Functional connectivity; Modalities; Magnetic resonance imaging; Machine learning; Neuroscience; Mathematics; Psychology; Medicine","score_opus":0.03290557349630619,"score_gpt":0.278241929502749,"score_spread":0.24533635600644282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187952197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41414836,0.0077003147,0.5448666,0.010057125,0.0019062842,0.00042834677,0.0026788607,0.0014066445,0.016807437],"genre_scores_gemma":[0.93336254,0.00084419013,0.061703347,0.00093750627,0.0008548274,0.00009790895,0.0009507788,0.00065773755,0.0005911796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9760336,0.011790009,0.003010539,0.0041702874,0.004148694,0.00084695],"domain_scores_gemma":[0.56852275,0.37190688,0.016181087,0.024934018,0.017357416,0.00109782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06168579,0.0011264869,0.0013651801,0.0030798595,0.001117961,0.004789243,0.0032574837,0.0021619464,0.0047297156],"category_scores_gemma":[0.43071532,0.0011338136,0.0007841999,0.003329764,0.0028567228,0.0060523963,0.0028424151,0.0024867626,0.00082534243],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00796115,0.0005499625,0.2989529,0.0038248978,0.0042492542,0.008433008,0.0067236046,0.053622186,0.081987545,0.19233464,0.014362996,0.3269979],"study_design_scores_gemma":[0.0005051775,0.00051162514,0.22133416,0.0014908196,0.0024669156,0.010316521,0.0026189226,0.17683673,0.047254946,0.52336043,0.012891361,0.00041236126],"about_ca_topic_score_codex":0.0025124336,"about_ca_topic_score_gemma":0.0023516293,"teacher_disagreement_score":0.06168579,"about_ca_system_score_codex":0.0009861661,"about_ca_system_score_gemma":0.0011640848,"threshold_uncertainty_score":0.3262295},"labels":[],"label_agreement":null},{"id":"W1879823367","doi":"10.1007/978-3-642-27940-9_4","title":"Whale: An Interpolation-Based Algorithm for Inter-procedural Verification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Interpolation (computer graphics); Mathematical proof; Software verification; Algorithm; State (computer science); Software; Model checking; Code (set theory); Programming language; Theoretical computer science; Software system; Artificial intelligence; Motion (physics); Software construction; Mathematics","score_opus":0.033696489773158866,"score_gpt":0.3015026433532409,"score_spread":0.26780615358008203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879823367","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.00076661067,0.000024935684,0.9945372,0.00002934518,0.000031013788,0.00004241553,0.00003417088,0.0034050893,0.0011292922],"genre_scores_gemma":[0.046660077,0.000059541147,0.94644064,0.00010194187,0.000023695491,0.00019267762,0.0002763124,0.0018816553,0.004363436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978551,0.00051569723,0.00015350082,0.00046883375,0.000765549,0.00024131114],"domain_scores_gemma":[0.9976077,0.0010813534,0.00009823808,0.00073530275,0.00040242518,0.00007492699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022422075,0.0015850088,0.0012886126,0.0017517821,0.0013756859,0.0016980214,0.0035124295,0.0017530534,0.023519415],"category_scores_gemma":[0.006243602,0.0013213111,0.0022763514,0.001358678,0.0019339767,0.0037576729,0.0050577545,0.00325121,0.006001806],"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.00073096453,0.00016140867,0.0005921937,0.0005250114,0.00012130988,0.00016778197,0.00031624624,0.04516004,0.014984437,0.17570178,0.013669597,0.7478692],"study_design_scores_gemma":[0.0001812255,0.00018633186,0.0002598985,0.00013961749,0.000098983226,0.00023866462,0.000121074096,0.6607681,0.04049724,0.25605056,0.04137191,0.00008647974],"about_ca_topic_score_codex":0.001965722,"about_ca_topic_score_gemma":0.0028550497,"teacher_disagreement_score":0.023519415,"about_ca_system_score_codex":0.00093704887,"about_ca_system_score_gemma":0.0017628545,"threshold_uncertainty_score":0.07868034},"labels":[],"label_agreement":null},{"id":"W1880392226","doi":"10.1007/978-3-540-75759-7_109","title":"Tissue Characterization Using Fractal Dimension of High Frequency Ultrasound RF Time Series","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fractal dimension; High frequency ultrasound; Series (stratigraphy); Fractal; Radio frequency; Ultrasound; Feature (linguistics); Fractal analysis; Materials science; Biomedical engineering; Acoustics; Computer science; Medicine; Mathematics; Physics; Telecommunications; Biology; Mathematical analysis","score_opus":0.008524097129921355,"score_gpt":0.23076029987624258,"score_spread":0.22223620274632122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880392226","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.61418027,0.0010509238,0.38196918,0.00015602185,0.000059998187,0.000029312561,0.00031714077,0.00030679148,0.0019304447],"genre_scores_gemma":[0.9681386,0.0005216664,0.030631991,0.000025941003,0.000050822964,0.000016963402,0.00015771338,0.000028001337,0.00042844887],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998908,0.000026032114,0.0000073152614,0.000026604199,0.00003382146,0.000015403526],"domain_scores_gemma":[0.9990238,0.0005686587,0.0001417961,0.00008391885,0.00014669467,0.000035050238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040882186,0.00023453396,0.0002703482,0.0016254684,0.0001512016,0.00055774156,0.00017771192,0.00039959518,0.00063023716],"category_scores_gemma":[0.001743045,0.0001269476,0.00035528518,0.000801653,0.00029981122,0.0006450997,0.00017825124,0.00031424945,0.00014807661],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007491514,0.00017319436,0.04170791,0.00042266367,0.00016626547,0.0006453019,0.00058735907,0.10998905,0.49872422,0.0100993095,0.0014484193,0.33528715],"study_design_scores_gemma":[0.000014023149,0.00023197598,0.08070961,0.000033324086,0.00009588815,0.0015823416,0.00019909097,0.8652536,0.043432396,0.00660053,0.001765086,0.00008208587],"about_ca_topic_score_codex":0.00053315563,"about_ca_topic_score_gemma":0.0003531422,"teacher_disagreement_score":0.0016254684,"about_ca_system_score_codex":0.00021768054,"about_ca_system_score_gemma":0.000118080105,"threshold_uncertainty_score":0.002162099},"labels":[],"label_agreement":null},{"id":"W1880508059","doi":"10.1007/978-3-642-13923-9_18","title":"Optic Disc Detection by Multi-scale Gaussian Filtering with Scale Production and a Vessels’ Directional Matched Filter","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Thresholding; Computer science; Artificial intelligence; Fundus (uterus); Computer vision; Pixel; Filter (signal processing); Scale (ratio); Optic disc; Blob detection; Gaussian filter; Matched filter; Pattern recognition (psychology); Gaussian; Image (mathematics); Retinal; Image processing; Edge detection; Physics; Ophthalmology","score_opus":0.010315463524266247,"score_gpt":0.24164481572763893,"score_spread":0.2313293522033727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880508059","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.024969514,0.00074289134,0.9712422,0.000134327,0.000086672044,0.00003100137,0.000081046506,0.00055588386,0.0021564988],"genre_scores_gemma":[0.20295298,0.0010191138,0.78848946,0.00010326274,0.00013323528,0.000052188774,0.00017679851,0.00014426764,0.0069286483],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962413,0.00006222203,0.000019257774,0.00008000157,0.0001736287,0.00004074329],"domain_scores_gemma":[0.99964046,0.00014085282,0.00003304528,0.00006995552,0.0000947845,0.000020985515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057100237,0.0005505835,0.0005852922,0.0009999812,0.00028817504,0.00082797423,0.00062902767,0.001010093,0.0022607634],"category_scores_gemma":[0.00088983204,0.0004403621,0.0009541657,0.0010933543,0.00042018108,0.0009564584,0.00076069415,0.0004511848,0.0012927966],"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.00046413363,0.0001011713,0.0015379613,0.0002834144,0.00013938305,0.00031943608,0.000100052144,0.007949084,0.32639536,0.013244246,0.0028276837,0.64663804],"study_design_scores_gemma":[0.00006901523,0.0003727176,0.017118791,0.000044422064,0.00029716516,0.0027668888,0.00009252934,0.60290617,0.34487563,0.013045077,0.0182686,0.00014297916],"about_ca_topic_score_codex":0.000973081,"about_ca_topic_score_gemma":0.0015621656,"teacher_disagreement_score":0.0022607634,"about_ca_system_score_codex":0.00032556927,"about_ca_system_score_gemma":0.00041000126,"threshold_uncertainty_score":0.0075630546},"labels":[],"label_agreement":null},{"id":"W188074206","doi":"10.1007/11516798_5","title":"Searching for a Black Hole in Tree Networks","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université du Québec en Outaouais","funders":"","keywords":"Tree (set theory); Computer science; Mathematics; Combinatorics","score_opus":0.01867880802106293,"score_gpt":0.2854821865197181,"score_spread":0.26680337849865515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188074206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48425,0.0015689846,0.4925247,0.007146093,0.0003287544,0.0001871447,0.00033887464,0.00080472394,0.012850577],"genre_scores_gemma":[0.83660764,0.0005696726,0.15471698,0.00091178186,0.00011779866,0.00011001539,0.00029190362,0.00019716691,0.0064769275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906343,0.00042756062,0.000035543224,0.00018174984,0.00014394827,0.00014777735],"domain_scores_gemma":[0.985926,0.010882649,0.0010067133,0.0008827694,0.0005702557,0.0007316762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022491855,0.0005695647,0.0016042474,0.0014553942,0.0018832613,0.0018073063,0.002120537,0.004275199,0.004872247],"category_scores_gemma":[0.023002373,0.0011609404,0.0010435953,0.001142917,0.0026178067,0.0072756647,0.0030999708,0.0020732603,0.00052296504],"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.001970446,0.0003401242,0.008791411,0.0007773161,0.00039555103,0.001056193,0.001851602,0.22184606,0.007100892,0.63741016,0.023726322,0.09473388],"study_design_scores_gemma":[0.00013009604,0.00013501929,0.00030362658,0.000069425725,0.00005876949,0.00017141801,0.00031650218,0.42595917,0.0016120626,0.56915635,0.0020668008,0.00002082164],"about_ca_topic_score_codex":0.0010340686,"about_ca_topic_score_gemma":0.001199352,"teacher_disagreement_score":0.004872247,"about_ca_system_score_codex":0.0007109857,"about_ca_system_score_gemma":0.00070251577,"threshold_uncertainty_score":0.016299248},"labels":[],"label_agreement":null},{"id":"W1880858962","doi":"10.1007/3-540-45526-4_5","title":"Metric Lexical Analysis","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University; Queen's University","funders":"","keywords":"Linguistics; Computer science; Mathematics; Philosophy","score_opus":0.015200702678385558,"score_gpt":0.24701855855411545,"score_spread":0.2318178558757299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880858962","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.029275656,0.004939665,0.7173394,0.0034254685,0.0009841063,0.00015079105,0.0033938542,0.0028924146,0.23759861],"genre_scores_gemma":[0.6170206,0.0027939708,0.24857885,0.0010725849,0.0011203233,0.00032747546,0.008440691,0.0022659013,0.11837964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816304,0.0004979053,0.00017598057,0.0005124613,0.000522334,0.00012823768],"domain_scores_gemma":[0.9983651,0.0004373218,0.00009229897,0.00047638183,0.0005308907,0.00009785974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087964773,0.00089389435,0.001263823,0.0041349498,0.001956636,0.00391708,0.0012348744,0.0009265385,0.027037594],"category_scores_gemma":[0.0048831557,0.0005215468,0.00104448,0.0048908517,0.0019472612,0.0069325953,0.0025764315,0.0017815704,0.0090353],"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.00003860787,0.000022332122,0.00035800258,0.000111234825,0.000029095649,0.000052341908,0.00018474726,0.0008721082,0.0010483857,0.8674338,0.016928691,0.11292058],"study_design_scores_gemma":[0.0000042646,0.000011594573,0.00033020653,0.000029195744,0.000016672286,0.00010389874,0.00011696153,0.006668444,0.0007470355,0.9590343,0.032922056,0.000015337991],"about_ca_topic_score_codex":0.001442916,"about_ca_topic_score_gemma":0.001266504,"teacher_disagreement_score":0.027037594,"about_ca_system_score_codex":0.0014576092,"about_ca_system_score_gemma":0.00078647153,"threshold_uncertainty_score":0.09044975},"labels":[],"label_agreement":null},{"id":"W1881423045","doi":"10.1007/978-3-642-13059-5_54","title":"Peer-Based Intelligent Tutoring Systems: A Corpus-Oriented Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Multimedia; World Wide Web; Human–computer interaction","score_opus":0.029749265761990645,"score_gpt":0.24785607824101968,"score_spread":0.21810681247902905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881423045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036161263,0.0034039025,0.9053404,0.0019300343,0.00037423545,0.0009973123,0.002760126,0.006213735,0.042819016],"genre_scores_gemma":[0.45444465,0.0030620391,0.50199705,0.00033666083,0.0007339998,0.0017328651,0.0072576893,0.0019833727,0.028451623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960836,0.0021638733,0.00019994804,0.000520193,0.00091940665,0.000112940266],"domain_scores_gemma":[0.98900944,0.007481955,0.00025071678,0.0010135135,0.0019318827,0.00031246128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00472696,0.00092498685,0.0017922992,0.003784066,0.0022856721,0.004824449,0.004564911,0.0019966073,0.010894489],"category_scores_gemma":[0.02173476,0.0007346723,0.00058144814,0.0049430556,0.001669998,0.008740215,0.0038172544,0.001647794,0.0036514562],"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.0005181064,0.00052424415,0.0037797613,0.0021843247,0.00026438726,0.00067555124,0.0070196157,0.066826865,0.015698005,0.10801908,0.045480616,0.74900943],"study_design_scores_gemma":[0.00018703248,0.00040382182,0.0033366873,0.00034989687,0.00041697937,0.00096949993,0.004654319,0.68179333,0.023380818,0.13361776,0.15070409,0.00018577033],"about_ca_topic_score_codex":0.0034796703,"about_ca_topic_score_gemma":0.005687301,"teacher_disagreement_score":0.010894489,"about_ca_system_score_codex":0.0015436743,"about_ca_system_score_gemma":0.0021170196,"threshold_uncertainty_score":0.036445677},"labels":[],"label_agreement":null},{"id":"W1881619528","doi":"10.1007/978-3-642-21538-4_3","title":"A Fuzzy Logic Approach for Indoor Mobile Robot Navigation Using UKF and Customized RFID Communication","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Real-time computing; Navigation system; RSS; Sensor fusion; Mobile robot; Mobile robot navigation; Robot; Encoder; Computer vision; Artificial intelligence; Embedded system; Robot control","score_opus":0.02679784763739915,"score_gpt":0.24373928417922827,"score_spread":0.21694143654182912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881619528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030270019,0.00023851234,0.9921799,0.00005287488,0.000049167305,0.00001922544,0.000024464362,0.00009062849,0.004318309],"genre_scores_gemma":[0.3519006,0.00089359464,0.63378024,0.00018439807,0.00011596293,0.0001473594,0.00012482828,0.00003705889,0.012815959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972814,0.000036661604,0.00001877774,0.00006924689,0.00011705394,0.000030030791],"domain_scores_gemma":[0.99988544,0.000035835466,0.000010703837,0.00000967378,0.000052785155,0.00000547396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028602305,0.0004895306,0.000624334,0.00061828544,0.000572132,0.0010027895,0.0012300437,0.00077357993,0.0024768158],"category_scores_gemma":[0.0005144942,0.00024562742,0.00094863673,0.00064599764,0.00038544266,0.00075037405,0.00042633893,0.0005889991,0.00055862847],"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.00012383975,0.0001534984,0.00069180387,0.00037106161,0.00010509492,0.0006466895,0.000386722,0.40525988,0.02882049,0.14826271,0.0036750694,0.41150317],"study_design_scores_gemma":[0.000010928539,0.000078223624,0.00024007964,0.000036737823,0.000043752407,0.00019058159,0.000068685964,0.9614252,0.0030803971,0.030279722,0.004515103,0.00003060443],"about_ca_topic_score_codex":0.0103067625,"about_ca_topic_score_gemma":0.0110441465,"teacher_disagreement_score":0.0103067625,"about_ca_system_score_codex":0.0009264174,"about_ca_system_score_gemma":0.00067557074,"threshold_uncertainty_score":0.020493567},"labels":[],"label_agreement":null},{"id":"W1881623667","doi":"10.1007/978-3-642-31770-5_5","title":"The Edge-Centered Surface Area of the Arrangement Graph","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Computer science; Interconnection; Surface (topology); Graph; Edge contraction; Theoretical computer science; Topology (electrical circuits); Geometry; Combinatorics; Mathematics; Line graph; Voltage graph; Artificial intelligence; Telecommunications","score_opus":0.024431572673624377,"score_gpt":0.22643070229619983,"score_spread":0.20199912962257544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881623667","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.3918665,0.0034019658,0.3143287,0.0015266056,0.0007422441,0.00009189118,0.0014142969,0.00094523793,0.28568262],"genre_scores_gemma":[0.933997,0.0017523266,0.029430633,0.00021674138,0.00091870665,0.000100266225,0.00062869437,0.0003905786,0.03256521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998186,0.000041659878,0.0000061763812,0.000051280604,0.000060166803,0.000022121449],"domain_scores_gemma":[0.99948186,0.00019420318,0.00007040701,0.000044309367,0.00014319317,0.00006604847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018441599,0.00042026903,0.0004699413,0.0014663929,0.00045314425,0.0012681325,0.00077862263,0.00059559295,0.00998869],"category_scores_gemma":[0.0011349979,0.00023129002,0.00022277885,0.00095033966,0.00084867334,0.0016346844,0.0005498218,0.00070721086,0.0016950704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084260006,0.000027858861,0.00064796815,0.0001258225,0.000019120911,0.0000997084,0.00017284216,0.010309796,0.008826863,0.8964815,0.008451513,0.07475267],"study_design_scores_gemma":[0.000017104618,0.00006963211,0.0025198178,0.000028361765,0.00002027593,0.00058793713,0.00014496365,0.065184325,0.0028474198,0.9068136,0.021736065,0.000030434348],"about_ca_topic_score_codex":0.00038737842,"about_ca_topic_score_gemma":0.00034567033,"teacher_disagreement_score":0.00998869,"about_ca_system_score_codex":0.00028413598,"about_ca_system_score_gemma":0.00018078402,"threshold_uncertainty_score":0.033415496},"labels":[],"label_agreement":null},{"id":"W18818675","doi":"10.1007/978-3-319-05579-4_18","title":"Integrating Epidemiological Modeling and Surveillance Data Feeds: A Kalman Filter Based Approach","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","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 Saskatchewan","funders":"","keywords":"Computer science; Extended Kalman filter; Kalman filter; Markov chain Monte Carlo; Markov chain; Data mining; Algorithm; Artificial intelligence; Machine learning; Bayesian probability","score_opus":0.2748076336102762,"score_gpt":0.3832073613467798,"score_spread":0.10839972773650358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18818675","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.00367288,0.00021548558,0.9947818,0.00014692878,0.000042413503,0.000022912138,0.00011238775,0.0003428452,0.0006623632],"genre_scores_gemma":[0.38835514,0.0014273674,0.6031812,0.00020531884,0.0002424616,0.00017557497,0.001042533,0.00026331007,0.00510708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882036,0.00037233433,0.00010362687,0.00032561267,0.00027256776,0.00010547711],"domain_scores_gemma":[0.9968771,0.0022081588,0.00020095932,0.0002356339,0.0004160941,0.000062082116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029398494,0.001183569,0.0021274893,0.0016119959,0.0005912337,0.0031858257,0.0021108445,0.002114702,0.0018513564],"category_scores_gemma":[0.0080855535,0.0012870408,0.0016782944,0.002073338,0.00049970695,0.0042769937,0.0019499618,0.00215317,0.0007840284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014499473,0.00018893374,0.0036144713,0.00019642198,0.00037915632,0.0001622115,0.0002086312,0.76621693,0.0035122107,0.02562698,0.002188853,0.19756015],"study_design_scores_gemma":[0.0000047578005,0.000013803254,0.00033003002,0.000010696184,0.000042263382,0.000020034606,0.000020088826,0.990094,0.0004699318,0.008250719,0.0007285894,0.00001520836],"about_ca_topic_score_codex":0.023139298,"about_ca_topic_score_gemma":0.018374586,"teacher_disagreement_score":0.023139298,"about_ca_system_score_codex":0.0012722579,"about_ca_system_score_gemma":0.00178155,"threshold_uncertainty_score":0.046009243},"labels":[],"label_agreement":null},{"id":"W1882118742","doi":"10.1007/11766247_4","title":"Using Multiagent Systems to Improve Real-Time Map Generation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Flexibility (engineering); Geospatial analysis; Personalization; Dissemination; Context (archaeology); Process (computing); Mobile agent; Spatial analysis; The Internet; Data mining; World Wide Web; Distributed computing","score_opus":0.03439161532843422,"score_gpt":0.2862697123466608,"score_spread":0.2518780970182266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882118742","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.03340952,0.00025097487,0.95765233,0.00018518348,0.00019724056,0.00008206636,0.00008531094,0.0050028902,0.0031344825],"genre_scores_gemma":[0.4641737,0.00014889392,0.53109115,0.00011028626,0.00007672929,0.00011804387,0.00031451014,0.00048497252,0.0034816733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.00016363965,0.000038733022,0.00015097721,0.00015985868,0.000048050173],"domain_scores_gemma":[0.9976094,0.00114568,0.00015152649,0.0004148385,0.0005775203,0.000101125326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012119499,0.0011437436,0.000924971,0.0009950512,0.0006773956,0.0014187307,0.0020969932,0.0012851212,0.0051452173],"category_scores_gemma":[0.0054307925,0.0007429935,0.00055457215,0.0010014519,0.0004069465,0.0020192098,0.0016327477,0.0012476096,0.001191672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003881388,0.00031775597,0.0014517154,0.00014939197,0.00015172573,0.00020644009,0.0002513707,0.5373523,0.026599009,0.004188233,0.0064125485,0.42253134],"study_design_scores_gemma":[0.000032897773,0.00003161845,0.00016407824,0.000004445276,0.000020492975,0.000030970834,0.00002083599,0.9902412,0.0060609225,0.0020989908,0.0012848857,0.000008679456],"about_ca_topic_score_codex":0.004922882,"about_ca_topic_score_gemma":0.0060146977,"teacher_disagreement_score":0.0051452173,"about_ca_system_score_codex":0.0005663046,"about_ca_system_score_gemma":0.00052493124,"threshold_uncertainty_score":0.01721251},"labels":[],"label_agreement":null},{"id":"W1882783948","doi":"10.1007/978-3-642-32584-7_30","title":"Classifying Websites into Non-topical Categories","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bigram; Classifier (UML); Information retrieval; Web page; Support vector machine; Set (abstract data type); Artificial intelligence; World Wide Web; Trigram","score_opus":0.022527970990159556,"score_gpt":0.26058073308932184,"score_spread":0.2380527620991623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882783948","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.67578036,0.010614765,0.17443587,0.0011765669,0.00074411754,0.0009885762,0.014530282,0.004981613,0.116747804],"genre_scores_gemma":[0.8425495,0.004041582,0.09431517,0.0002580176,0.00056948204,0.0003252066,0.023746014,0.0004907468,0.03370427],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898595,0.00012919282,0.00008968969,0.0001912561,0.0004568204,0.00014707838],"domain_scores_gemma":[0.99763083,0.00080158544,0.00021486131,0.0002674783,0.0008842931,0.0002007895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057238975,0.0006951165,0.0005855349,0.012777232,0.00092500495,0.002951535,0.00061275694,0.0006547003,0.0037021893],"category_scores_gemma":[0.0027642576,0.00016980892,0.0007827131,0.008338794,0.00042708352,0.0025184515,0.0008213472,0.00068314647,0.004754498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027835515,0.0005484176,0.085741214,0.0012478451,0.00016805089,0.00032124366,0.0012457286,0.0012167165,0.03581987,0.008238143,0.035736065,0.8294384],"study_design_scores_gemma":[0.000085232816,0.0010915211,0.42135125,0.0014981225,0.0012981952,0.005396163,0.011895535,0.1678116,0.0861161,0.07510768,0.2281294,0.00021920024],"about_ca_topic_score_codex":0.001677669,"about_ca_topic_score_gemma":0.0038915996,"teacher_disagreement_score":0.012777232,"about_ca_system_score_codex":0.0005421661,"about_ca_system_score_gemma":0.0006541652,"threshold_uncertainty_score":0.01238507},"labels":[],"label_agreement":null},{"id":"W1882835700","doi":"10.1007/3-540-36261-4_25","title":"Client Migration in a Continuous Data Network","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Victoria","funders":"","keywords":"Computer science; Scalability; Distributed computing; Computer network; Client-side; Data migration; Data stream; Network congestion; The Internet; Client–server model; Jitter; Protocol (science); Network packet; Server; Database; Operating system","score_opus":0.03148513070581995,"score_gpt":0.2502440843959382,"score_spread":0.21875895369011825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882835700","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43684947,0.00202796,0.5346766,0.0011605137,0.0005332117,0.00023774926,0.00019765805,0.004728666,0.019588113],"genre_scores_gemma":[0.87355,0.0004416164,0.11180313,0.0001265473,0.00010358733,0.00009913411,0.0001674022,0.00023760473,0.013470915],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990761,0.0002853114,0.00005227118,0.00016029355,0.00028128957,0.00014469305],"domain_scores_gemma":[0.9971608,0.0011055302,0.00016444852,0.0008275172,0.00039420943,0.00034760937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015406763,0.000387367,0.0006366619,0.0005433557,0.0012425688,0.0017490699,0.0019650636,0.001145915,0.0029419076],"category_scores_gemma":[0.003877788,0.0005104,0.0002777353,0.0011710558,0.0008993697,0.0020850482,0.001569788,0.0012553618,0.00054241915],"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.003792234,0.0011550197,0.011356337,0.00043898085,0.00011124343,0.0016124082,0.001608047,0.35419106,0.050300293,0.113309845,0.024036322,0.43808827],"study_design_scores_gemma":[0.00013476584,0.00019786844,0.0012200511,0.00002312133,0.000036120156,0.00030653598,0.00020666764,0.96274155,0.0075876378,0.020696163,0.00682405,0.000025440137],"about_ca_topic_score_codex":0.004266727,"about_ca_topic_score_gemma":0.0034090849,"teacher_disagreement_score":0.004266727,"about_ca_system_score_codex":0.0010054949,"about_ca_system_score_gemma":0.0009762057,"threshold_uncertainty_score":0.0098416805},"labels":[],"label_agreement":null},{"id":"W1882901045","doi":"10.1007/978-3-642-24958-7_9","title":"An Infinite Mixture of Inverted Dirichlet Distributions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Mixture model; Dirichlet distribution; Computer science; Cluster analysis; Latent Dirichlet allocation; Gaussian; Algorithm; Bayesian probability; Hierarchical Dirichlet process; Selection (genetic algorithm); Artificial intelligence; Pattern recognition (psychology); Categorization; Data mining; Topic model; Mathematics","score_opus":0.02493161102073771,"score_gpt":0.2655297200954098,"score_spread":0.2405981090746721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882901045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077974848,0.0006735977,0.9810286,0.000408075,0.00013311926,0.000042305677,0.00017894714,0.00021309394,0.009524722],"genre_scores_gemma":[0.29570892,0.0029893783,0.64327675,0.0010402513,0.0007830251,0.0007813244,0.001706108,0.0008270188,0.05288724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997156,0.0012080664,0.00014751997,0.0006166978,0.00064486515,0.00022682839],"domain_scores_gemma":[0.99028945,0.0071821646,0.00033049393,0.0009369734,0.0009956487,0.00026528066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003907146,0.0009517841,0.002224737,0.0025341746,0.001688654,0.0055941544,0.004008252,0.0033410422,0.011786082],"category_scores_gemma":[0.022478685,0.0019268575,0.0028337892,0.0028877007,0.0029895697,0.007759817,0.0027296036,0.0044105635,0.0034198996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100347934,0.000048827987,0.0006295591,0.00014311326,0.000060594553,0.000246151,0.00043851664,0.056593224,0.001014514,0.90174985,0.0037519247,0.035223406],"study_design_scores_gemma":[0.0000226965,0.0000147412875,0.00018996083,0.00006209457,0.000041487758,0.00032669283,0.000072381954,0.31023464,0.0005514677,0.68254757,0.0058852737,0.00005097595],"about_ca_topic_score_codex":0.0026324012,"about_ca_topic_score_gemma":0.0032080165,"teacher_disagreement_score":0.011786082,"about_ca_system_score_codex":0.0018384833,"about_ca_system_score_gemma":0.0011981119,"threshold_uncertainty_score":0.039428353},"labels":[],"label_agreement":null},{"id":"W1882953655","doi":"10.1007/978-3-642-12659-8_14","title":"OpenMP Parallelization of a Mickens Time-Integration Scheme for a Mixed-Culture Biofilm Model and Its Performance on Multi-core and Multi-processor Computers","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Lattice Boltzmann Simulation Studies","field":"Engineering","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 Guelph","funders":"","keywords":"Parallel computing; Computer science; Xeon; Xeon Phi; Multi-core processor; Scheme (mathematics); Discretization; Code (set theory); Workstation; Computational science; Operating system; Mathematics; Set (abstract data type); Programming language","score_opus":0.034782544980928594,"score_gpt":0.266333861660628,"score_spread":0.23155131667969941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882953655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45644897,0.0012950838,0.5115332,0.0008137784,0.00049977424,0.00016144908,0.0010084622,0.003785441,0.024453795],"genre_scores_gemma":[0.78322804,0.00026045946,0.20970513,0.00007491095,0.000045083663,0.0001940694,0.000507696,0.0004562321,0.0055283676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981433,0.000047551555,0.000011814212,0.000022953896,0.000074827294,0.000028510682],"domain_scores_gemma":[0.9993104,0.00029031275,0.000038595314,0.000090487716,0.00022204478,0.000048174585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038182715,0.00053107494,0.0007469933,0.000255147,0.0007076302,0.0006182277,0.0018403025,0.00084859086,0.00433657],"category_scores_gemma":[0.0016333153,0.0003146671,0.0004867435,0.0005454063,0.0003265606,0.0006477047,0.00057284103,0.0011188831,0.00042646597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057906634,0.000285928,0.001621356,0.00024495067,0.0000625906,0.00021889477,0.00021993979,0.8702169,0.033212435,0.019781305,0.0043511647,0.06920544],"study_design_scores_gemma":[0.000014899658,0.00001425182,0.00010094547,0.000002466547,0.0000031931481,0.0000071522204,0.0000057054513,0.9969222,0.0020219733,0.0005867327,0.0003162123,0.000004359208],"about_ca_topic_score_codex":0.008929038,"about_ca_topic_score_gemma":0.006718626,"teacher_disagreement_score":0.008929038,"about_ca_system_score_codex":0.0006171012,"about_ca_system_score_gemma":0.0009918985,"threshold_uncertainty_score":0.017754138},"labels":[],"label_agreement":null},{"id":"W1883367367","doi":"10.1007/978-3-540-87391-4_1","title":"The Future of Text-Meaning in Computational Linguistics","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Meaning (existential); Computer science; Perspective (graphical); Computational linguistics; Linguistics; Artificial intelligence; Natural language processing; Epistemology; Philosophy","score_opus":0.017460770707665493,"score_gpt":0.24569104801959635,"score_spread":0.22823027731193085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883367367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014928627,0.36394608,0.38759932,0.08970595,0.007212739,0.00006675447,0.00073882675,0.0010505263,0.13475117],"genre_scores_gemma":[0.57050925,0.12737165,0.22274438,0.007462631,0.021440445,0.00029974798,0.0013144624,0.0013507055,0.047506787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978855,0.0013080578,0.0001353927,0.0002752261,0.00030866516,0.000087088745],"domain_scores_gemma":[0.98955345,0.009007348,0.00020124241,0.0006304294,0.00041276138,0.00019477126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039643953,0.0007581515,0.0012131967,0.0033051923,0.0015722188,0.00897675,0.0016528127,0.0026142125,0.009298409],"category_scores_gemma":[0.009912397,0.0007421358,0.0007881165,0.0049217516,0.01117243,0.033623457,0.002385038,0.0043253493,0.0021408063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017926808,0.0000113442275,0.00011857822,0.00032353812,0.000010543139,0.00003302132,0.0011822135,0.0003524861,0.0002124909,0.93951994,0.008949133,0.04926885],"study_design_scores_gemma":[0.000005383582,0.0000048528887,0.00009173432,0.000103962884,0.0000048792895,0.000048553356,0.00022922442,0.0015394758,0.00009945652,0.95936006,0.038503636,0.000008830265],"about_ca_topic_score_codex":0.0011644723,"about_ca_topic_score_gemma":0.0013789369,"teacher_disagreement_score":0.009298409,"about_ca_system_score_codex":0.00207502,"about_ca_system_score_gemma":0.0014585693,"threshold_uncertainty_score":0.031106293},"labels":[],"label_agreement":null},{"id":"W188340665","doi":"10.1007/978-3-662-46018-4_1","title":"The Multi-source Beachcombers’ Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"","keywords":"Computer science","score_opus":0.04093236582003341,"score_gpt":0.2774382950420483,"score_spread":0.2365059292220149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188340665","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.03253093,0.0020572783,0.7963231,0.008165903,0.0011614326,0.00013387584,0.00068906514,0.00052646257,0.1584119],"genre_scores_gemma":[0.52638274,0.0029357532,0.2248594,0.002171134,0.0012601548,0.00043436675,0.0014122545,0.001153318,0.23939085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993119,0.0002141107,0.000027592814,0.00019189062,0.00016737237,0.00008702048],"domain_scores_gemma":[0.99782974,0.0015140402,0.00012032105,0.00024378761,0.00017572379,0.000116346666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011262,0.0011011878,0.0012151216,0.00085534627,0.0012083448,0.0025402626,0.002231442,0.004031731,0.024792388],"category_scores_gemma":[0.0074799857,0.00081123406,0.0011188943,0.0013791254,0.002213221,0.005012533,0.0035447343,0.0039905095,0.003016122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023083392,0.00008078304,0.00034139713,0.00033393677,0.00008775751,0.0005271882,0.00018499358,0.06779036,0.0014278035,0.80236685,0.05293856,0.073689565],"study_design_scores_gemma":[0.000088775065,0.000036097328,0.00020895187,0.00007540863,0.000027831193,0.00036025827,0.00013178618,0.20404379,0.0013382321,0.7655139,0.028136289,0.000038520615],"about_ca_topic_score_codex":0.0013541734,"about_ca_topic_score_gemma":0.0013405094,"teacher_disagreement_score":0.024792388,"about_ca_system_score_codex":0.0008335087,"about_ca_system_score_gemma":0.00079441234,"threshold_uncertainty_score":0.08293885},"labels":[],"label_agreement":null},{"id":"W1883438710","doi":"10.1007/978-3-642-15399-0_56","title":"NetPot: Easy Meal Enjoyment for Distant Diners","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social 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":"University of British Columbia","funders":"","keywords":"Meal; Key (lock); Computer science; Feeling; Food science; Psychology; Biology; Computer security; Social psychology","score_opus":0.030046149844676434,"score_gpt":0.31619949714699086,"score_spread":0.28615334730231445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883438710","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16826215,0.003196593,0.13685848,0.0024380793,0.002615861,0.0012498678,0.027937615,0.1255086,0.5319328],"genre_scores_gemma":[0.21197955,0.0017034749,0.103464104,0.0011106024,0.00071013503,0.0009916729,0.035327975,0.013799736,0.63091284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99986744,0.000018551296,0.000004749051,0.000026314681,0.000041772913,0.000041237876],"domain_scores_gemma":[0.9996768,0.000052071286,0.000008122994,0.000036985813,0.000044975237,0.00018111302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029068,0.001110953,0.00050116424,0.0005633963,0.0007838181,0.0012199694,0.0014293249,0.00066969055,0.1623808],"category_scores_gemma":[0.00060792523,0.00034777803,0.00077684876,0.00035399178,0.0001379733,0.0017759646,0.0033200048,0.0009967326,0.052433096],"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.003240538,0.0011091082,0.002664426,0.00065633387,0.00007100448,0.0006321768,0.0009020194,0.00048809627,0.023240004,0.002527895,0.48106995,0.4833984],"study_design_scores_gemma":[0.0005732503,0.00123791,0.036359623,0.00029664906,0.00016889567,0.0016960354,0.001626003,0.0072279996,0.015707627,0.004927977,0.9299241,0.0002539376],"about_ca_topic_score_codex":0.00072870916,"about_ca_topic_score_gemma":0.00306075,"teacher_disagreement_score":0.1623808,"about_ca_system_score_codex":0.00022084166,"about_ca_system_score_gemma":0.000232458,"threshold_uncertainty_score":0.5432179},"labels":[],"label_agreement":null},{"id":"W1883695154","doi":"10.1007/978-3-642-37447-0_28","title":"Utilizing Optical Aberrations for Extended-Depth-of-Field Panoramas","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","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":"University of Toronto","funders":"","keywords":"Depth of field; Computer science; Lens (geology); Computer vision; Deconvolution; Optics; Artificial intelligence; Image restoration; Point spread function; Image quality; Photography; Aperture (computer memory); Image (mathematics); Point (geometry); Field of view; Blind deconvolution; Camera lens; Image processing; Physics; Algorithm; Mathematics; Acoustics","score_opus":0.023808235796554073,"score_gpt":0.2736338910856204,"score_spread":0.24982565528906633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883695154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035987098,0.0011691957,0.9485406,0.00011138806,0.00008190377,0.00007682584,0.00018656853,0.0009990233,0.012847264],"genre_scores_gemma":[0.23394036,0.0014861842,0.75764143,0.00007929865,0.00006344351,0.00004536504,0.00038064874,0.00024033079,0.006122929],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974054,0.000024327608,0.000012831576,0.000046079258,0.00014365184,0.000032587173],"domain_scores_gemma":[0.9995976,0.00012210691,0.000050627765,0.00011054652,0.00009130031,0.000027887965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002743074,0.0009583082,0.00043192354,0.00047721068,0.00027058568,0.0008010815,0.00067536446,0.00038843087,0.0055588987],"category_scores_gemma":[0.00077476836,0.00045137215,0.0004651889,0.0006483559,0.00036456523,0.0014648534,0.0014207305,0.0007452044,0.0010043967],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037221896,0.000100576406,0.0012123833,0.0004631428,0.00008427197,0.00017843199,0.00025157616,0.032548897,0.5467922,0.021534212,0.003079558,0.3933826],"study_design_scores_gemma":[0.000058249032,0.00031577423,0.0037213615,0.00010718543,0.000109850276,0.0018296869,0.00021588257,0.36090577,0.5495588,0.021325802,0.06171501,0.0001365208],"about_ca_topic_score_codex":0.0006869216,"about_ca_topic_score_gemma":0.0026668669,"teacher_disagreement_score":0.0055588987,"about_ca_system_score_codex":0.00042682976,"about_ca_system_score_gemma":0.00038982194,"threshold_uncertainty_score":0.01859641},"labels":[],"label_agreement":null},{"id":"W1883797946","doi":"10.1007/11940197_2","title":"Aspects for Trace Monitoring","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":28,"is_retracted":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; McGill University","funders":"","keywords":"AspectJ; Computer science; TRACE (psycholinguistics); Programming language; Compiler; Programmer; Property (philosophy); Feature (linguistics); Undo; Datalog; Aspect-oriented programming; Software","score_opus":0.040040161851397346,"score_gpt":0.2925132254012492,"score_spread":0.25247306354985183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883797946","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.005722414,0.0010837162,0.9586583,0.00061857235,0.00021730606,0.00016286124,0.00023497733,0.0070802323,0.026221707],"genre_scores_gemma":[0.19487667,0.0023921833,0.75439125,0.00072744215,0.0006029738,0.00034273588,0.0016035382,0.0039358544,0.041127365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99712807,0.00060008786,0.0002882917,0.0004859972,0.0012753966,0.00022216374],"domain_scores_gemma":[0.99539065,0.0012767257,0.00027058652,0.0022670901,0.00061027764,0.00018472047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022436364,0.0011620645,0.0006736099,0.0017053175,0.00082985644,0.003119605,0.0019738127,0.001073894,0.008525141],"category_scores_gemma":[0.007442847,0.0008485884,0.0011013272,0.0016071581,0.0012033031,0.007152,0.0032294497,0.0027662169,0.0028492566],"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.0003208788,0.0001482954,0.0018660072,0.00049191236,0.00007941921,0.0003976171,0.0010191047,0.0051712887,0.012839376,0.44630626,0.019873379,0.51148653],"study_design_scores_gemma":[0.000045106117,0.00012739003,0.0010028605,0.00025043878,0.00019926117,0.0011770417,0.00025782784,0.05699678,0.02127437,0.64883417,0.2697779,0.000056786612],"about_ca_topic_score_codex":0.00082056056,"about_ca_topic_score_gemma":0.0011762886,"teacher_disagreement_score":0.008525141,"about_ca_system_score_codex":0.0006140744,"about_ca_system_score_gemma":0.0008035019,"threshold_uncertainty_score":0.028519392},"labels":[],"label_agreement":null},{"id":"W1883814555","doi":"10.1007/978-3-642-02614-0_15","title":"Reasoning with Generic Cases in the Arithmetic of Abstract Matrices","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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":"Western University","funders":"","keywords":"Representation (politics); Computer science; Rectangle; Simple (philosophy); Matrix (chemical analysis); Matrix representation; Function (biology); Sequence (biology); Term (time); Theoretical computer science; Matrix multiplication; Algorithm; Arithmetic; Algebra over a field; Mathematics; Group (periodic table); Pure mathematics","score_opus":0.018333896347060043,"score_gpt":0.24484278651880026,"score_spread":0.22650889017174022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883814555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06694477,0.0016782263,0.8402215,0.0038455888,0.0003153856,0.00010845817,0.00046937048,0.0011750355,0.085241646],"genre_scores_gemma":[0.690042,0.0015764042,0.28955463,0.000699328,0.0005350387,0.000095372736,0.001064953,0.00028442862,0.016147926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956066,0.0017252539,0.00040025142,0.0007106971,0.0011833468,0.0003738753],"domain_scores_gemma":[0.9953296,0.0030537674,0.00026342773,0.00082981185,0.00036391008,0.00015950266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004163798,0.0013154403,0.0011559817,0.0020167574,0.0024038397,0.007224954,0.003169614,0.0030409142,0.008511693],"category_scores_gemma":[0.010979526,0.0014788201,0.003308186,0.002263831,0.008244628,0.022776093,0.0060442206,0.0065539028,0.0015415759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004121951,0.000012878137,0.00023253393,0.00006777412,0.000018210718,0.0002020415,0.0004972956,0.0018302259,0.000511066,0.98638994,0.0017277249,0.0084690675],"study_design_scores_gemma":[0.000010441955,0.0000044531994,0.000036924008,0.000014410915,0.000011101209,0.00009958972,0.00011114296,0.0038240103,0.00039823278,0.9928221,0.0026589863,0.000008644163],"about_ca_topic_score_codex":0.0017170486,"about_ca_topic_score_gemma":0.00208879,"teacher_disagreement_score":0.008511693,"about_ca_system_score_codex":0.0019302488,"about_ca_system_score_gemma":0.0008030495,"threshold_uncertainty_score":0.02847445},"labels":[],"label_agreement":null},{"id":"W1884165172","doi":"10.1007/11957454_7","title":"A Systemic Approach to Automate Privacy Policy Enforcement in Enterprises","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Leverage (statistics); Computer science; Enforcement; Privacy policy; Privacy by Design; Information privacy; Personally identifiable information; Computer security; Identity management; Internet privacy; Privacy law; Identity (music); Law enforcement; Privacy software; Work (physics); Knowledge management; Business; Access control; Law","score_opus":0.016509241738306805,"score_gpt":0.2841144757810714,"score_spread":0.2676052340427646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884165172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042627887,0.00006832267,0.98838145,0.00095632346,0.000029812092,0.00011112097,0.00003556181,0.0010502677,0.0051043257],"genre_scores_gemma":[0.22219402,0.00016354323,0.77142376,0.00043141577,0.00004621879,0.00023865124,0.00014503062,0.00017098107,0.005186374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356717,0.0025821945,0.0004466234,0.00095575425,0.0020696293,0.00037853082],"domain_scores_gemma":[0.9911413,0.0036658728,0.0005745584,0.0029334016,0.0013873737,0.0002974551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008617259,0.0005506192,0.00058456854,0.001325434,0.0016979575,0.004066144,0.001745458,0.0021892472,0.0038783296],"category_scores_gemma":[0.012069768,0.0008813517,0.0011499039,0.0015742277,0.0030373775,0.0057992153,0.005112771,0.003365488,0.00094884366],"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.00011631599,0.00039288594,0.003533624,0.0002948708,0.000115402116,0.00038162956,0.001937929,0.04040722,0.016149793,0.6376498,0.012409353,0.2866111],"study_design_scores_gemma":[0.00006735359,0.00015112704,0.0011868486,0.0001438168,0.00011848643,0.0003930664,0.0007040266,0.532067,0.020225111,0.400297,0.044573374,0.00007286356],"about_ca_topic_score_codex":0.003749408,"about_ca_topic_score_gemma":0.006268619,"teacher_disagreement_score":0.008617259,"about_ca_system_score_codex":0.0016019844,"about_ca_system_score_gemma":0.006333815,"threshold_uncertainty_score":0.045572937},"labels":[],"label_agreement":null},{"id":"W1884573419","doi":"10.1007/978-3-540-30597-2_1","title":"Introduction to Inconsistency Tolerance","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Brainstorming; Artificial intelligence; Robotics; Negotiation; Robot","score_opus":0.011692352911035032,"score_gpt":0.23116659555782829,"score_spread":0.21947424264679324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884573419","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.0012244764,0.021453807,0.80318034,0.0073724026,0.0025446701,0.00035588144,0.001447328,0.004723085,0.15769808],"genre_scores_gemma":[0.049176183,0.02354406,0.8012627,0.0060690013,0.0034137159,0.0008748973,0.003704691,0.004072472,0.10788241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610054,0.0006837918,0.00040306244,0.0010340414,0.0015419219,0.00023675404],"domain_scores_gemma":[0.9951131,0.0026052846,0.00015244572,0.0011761935,0.00082196353,0.00013110835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033163226,0.00221362,0.002458034,0.004045514,0.0021413055,0.006360797,0.0059405966,0.0028119616,0.057976782],"category_scores_gemma":[0.010450499,0.0023049135,0.0031391121,0.0054435306,0.004488327,0.012061675,0.0055286693,0.0092620645,0.017491216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056539615,0.00008323,0.00015117445,0.0007933981,0.00006423492,0.00017896255,0.00057824445,0.0028604502,0.0010307869,0.5954458,0.09707918,0.30167794],"study_design_scores_gemma":[0.000020528181,0.000016878714,0.00010677363,0.0003218721,0.000031055068,0.00033246112,0.00007243024,0.00343062,0.0007929868,0.7153066,0.27953297,0.000034852008],"about_ca_topic_score_codex":0.002035397,"about_ca_topic_score_gemma":0.0020063156,"teacher_disagreement_score":0.057976782,"about_ca_system_score_codex":0.0023991992,"about_ca_system_score_gemma":0.002188111,"threshold_uncertainty_score":0.19395167},"labels":[],"label_agreement":null},{"id":"W1884582486","doi":"10.1007/3-540-45995-2_13","title":"Weakly Iterated Block Products of Finite Monoids","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Iterated function; Mathematics; Block (permutation group theory); Operand; Variety (cybernetics); Wreath product; Product (mathematics); Mathematical proof; Associative property; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic; Combinatorics","score_opus":0.01492536362326868,"score_gpt":0.21454599110122854,"score_spread":0.19962062747795986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884582486","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.5243304,0.0020527157,0.37301067,0.00021920537,0.00017118602,0.00011234901,0.00030198545,0.00056873163,0.09923271],"genre_scores_gemma":[0.8694013,0.0010406773,0.056230713,0.00006831665,0.00011664857,0.00018505137,0.00041501812,0.00024375612,0.072298385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925095,0.00018988036,0.00005978977,0.00011600082,0.00026356068,0.000119758435],"domain_scores_gemma":[0.9986852,0.0006210034,0.00011831503,0.00017985779,0.00024467421,0.00015092453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007876239,0.0005074189,0.0007455738,0.0008787459,0.001018514,0.0023510186,0.0006971665,0.00047388935,0.0043464783],"category_scores_gemma":[0.0016274204,0.00070186297,0.0008105522,0.0007589821,0.0015217107,0.0040809354,0.0016870559,0.0011129439,0.0010901785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010849477,0.000024392531,0.00037832695,0.00007847019,0.000016649308,0.00019002023,0.0008337768,0.0012800571,0.009560684,0.97730607,0.00056552683,0.009657583],"study_design_scores_gemma":[0.00002636289,0.00013410822,0.0007964901,0.000040054376,0.000050896888,0.0004030388,0.00030541484,0.012923707,0.011848252,0.95657575,0.016866539,0.000029457982],"about_ca_topic_score_codex":0.0006291107,"about_ca_topic_score_gemma":0.0008735961,"teacher_disagreement_score":0.0043464783,"about_ca_system_score_codex":0.0008275424,"about_ca_system_score_gemma":0.00050048303,"threshold_uncertainty_score":0.014540434},"labels":[],"label_agreement":null},{"id":"W1884716864","doi":"10.1007/3-540-44759-8_48","title":"DrawCAD: Using Deductive Object-Relational Databases in CAD","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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":"Carleton University","funders":"","keywords":"Computer science; Relational database; Reuse; CAD; Object (grammar); Object-relational mapping; Deductive database; Programming language; Database; Data model (GIS); Object-oriented design; Database design; Object-oriented programming; Engineering drawing; Database model; Artificial intelligence","score_opus":0.0260786848776205,"score_gpt":0.24441510395398283,"score_spread":0.21833641907636234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884716864","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.0017741901,0.00076228526,0.9697552,0.00016734289,0.00007582554,0.00008519646,0.000732783,0.02130636,0.005340906],"genre_scores_gemma":[0.038070034,0.0018598356,0.94630075,0.0002882743,0.000080078375,0.00017598343,0.0035987566,0.0030695435,0.0065566082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982668,0.00032407226,0.00021121578,0.00025559086,0.0008844375,0.000057809022],"domain_scores_gemma":[0.99791306,0.0010916571,0.00008898334,0.0006151159,0.00024329258,0.000047949474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017169417,0.0009314704,0.00092454895,0.0018729157,0.0006407031,0.0061808084,0.0033425258,0.0010542078,0.01314939],"category_scores_gemma":[0.0058174743,0.0014523048,0.0012812231,0.002465927,0.0010157847,0.005608943,0.002176256,0.0017675364,0.005577267],"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.00021654881,0.00018605168,0.0010250101,0.0014843233,0.00019217703,0.00060996204,0.0007909497,0.020363742,0.0075517613,0.14196824,0.050182417,0.77542883],"study_design_scores_gemma":[0.0002510383,0.00011192939,0.0010581632,0.00051315647,0.0003345042,0.0015601175,0.00038054408,0.25367248,0.048883393,0.26607147,0.42699617,0.00016707212],"about_ca_topic_score_codex":0.0021745772,"about_ca_topic_score_gemma":0.0031595072,"teacher_disagreement_score":0.01314939,"about_ca_system_score_codex":0.0005622703,"about_ca_system_score_gemma":0.00084621366,"threshold_uncertainty_score":0.043989062},"labels":[],"label_agreement":null},{"id":"W1885326446","doi":"10.1007/978-3-642-13059-5_43","title":"Deep Distributed News: Ontologies to the Rescue of Journalism","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université de Montréal","funders":"","keywords":"Computer science; Conceptualization; World Wide Web; The Internet; Journalism; Context (archaeology); Set (abstract data type); Semantic Web; Information overload; News media; Social media; Artificial intelligence; Media studies; Sociology; History","score_opus":0.0200076272028943,"score_gpt":0.25649254295371665,"score_spread":0.23648491575082237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885326446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025760226,0.0072451895,0.85178787,0.016517656,0.0012908016,0.00011355431,0.0017515986,0.0038597898,0.09167333],"genre_scores_gemma":[0.6067215,0.006315249,0.341131,0.0019548174,0.0013322717,0.00013917107,0.0037425982,0.0010512725,0.03761215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990177,0.00035310508,0.000105675485,0.00014605625,0.0002873837,0.000090062225],"domain_scores_gemma":[0.99451655,0.0026705519,0.0003242795,0.0015084806,0.00066670426,0.00031338778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020539302,0.0004016336,0.00062515953,0.002884428,0.0016152835,0.006880975,0.0014980321,0.0016362446,0.0053271423],"category_scores_gemma":[0.009524573,0.00045990283,0.00063747365,0.0036954135,0.0038425785,0.016374268,0.0033845375,0.0023790991,0.0014446382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009876424,0.00009189384,0.0012079098,0.0003014467,0.000050562903,0.00015643211,0.0019508391,0.0063284026,0.0013011635,0.73825556,0.03269504,0.21756206],"study_design_scores_gemma":[0.000018949375,0.000009368498,0.00036866055,0.0000841433,0.00002851937,0.000101937265,0.00082446716,0.02586491,0.001352627,0.8733772,0.097952425,0.000016816177],"about_ca_topic_score_codex":0.0032764657,"about_ca_topic_score_gemma":0.0038948006,"teacher_disagreement_score":0.006880975,"about_ca_system_score_codex":0.0015111185,"about_ca_system_score_gemma":0.0020918278,"threshold_uncertainty_score":0.017821014},"labels":[],"label_agreement":null},{"id":"W1885675146","doi":"10.1007/11602897_11","title":"Admissible Interference by Typing for Cryptographic Protocols","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Correctness; Computer science; Cryptography; Interference (communication); Type (biology); Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Process (computing); Information flow; Algorithm; Programming language; Computer network; Channel (broadcasting)","score_opus":0.038866297352664746,"score_gpt":0.3025482220994188,"score_spread":0.26368192474675406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885675146","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.027015459,0.0017383302,0.84160644,0.0010835824,0.00054882764,0.00015827292,0.0001492522,0.0012409538,0.12645882],"genre_scores_gemma":[0.7511081,0.00281095,0.18263125,0.0007501941,0.0009772851,0.0007441921,0.00055513653,0.0013542391,0.05906863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922167,0.002927272,0.0007279541,0.00084213505,0.0023649973,0.00092091376],"domain_scores_gemma":[0.98686475,0.0071777822,0.0005553973,0.00405565,0.0008991303,0.00044729558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041731643,0.0016415094,0.0018095339,0.002081966,0.0035860126,0.00765354,0.0025782883,0.0028642484,0.007058576],"category_scores_gemma":[0.013416094,0.0017856802,0.002341637,0.003575335,0.007677534,0.0130407335,0.006070909,0.008445851,0.0030242286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003345695,0.000022984583,0.00007814992,0.000052867337,0.000005902456,0.00006366093,0.00041109545,0.0010119396,0.0005420168,0.98775804,0.00092111446,0.009098758],"study_design_scores_gemma":[0.000009365643,0.0000104432365,0.000017121672,0.000022442488,0.00000914096,0.000063133535,0.00003380819,0.003030694,0.00075473223,0.9915577,0.0044806437,0.000010787584],"about_ca_topic_score_codex":0.00049415673,"about_ca_topic_score_gemma":0.0003730251,"teacher_disagreement_score":0.00765354,"about_ca_system_score_codex":0.002209117,"about_ca_system_score_gemma":0.0015202948,"threshold_uncertainty_score":0.023613334},"labels":[],"label_agreement":null},{"id":"W1885697441","doi":"10.1007/978-3-642-18073-6_5","title":"Local Equivalence of Surface Code States","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Counterexample; Code (set theory); Computer science; Equivalence (formal languages); Class (philosophy); Equivalence class (music); Conjecture; Connection (principal bundle); Binary number; Characterization (materials science); Surface (topology); Unitary state; Theoretical computer science; Discrete mathematics; Mathematics; Physics; Arithmetic; Programming language; Geometry","score_opus":0.019075802352047293,"score_gpt":0.24232157240689572,"score_spread":0.22324577005484844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885697441","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.2796967,0.0014828207,0.13352679,0.0022049907,0.000860206,0.00012208585,0.00038865354,0.00057486945,0.5811428],"genre_scores_gemma":[0.9129012,0.0009238096,0.014614065,0.0008640503,0.00074171665,0.00018724083,0.00063211325,0.0005346745,0.068601154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908626,0.00019004052,0.000032232856,0.00015731761,0.00031962612,0.00021439699],"domain_scores_gemma":[0.99913365,0.00032345322,0.000058581623,0.00020194448,0.00018162018,0.00010072579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103241,0.0005367525,0.0010381908,0.0017653476,0.0017453898,0.002965102,0.0010302117,0.0017553815,0.014299815],"category_scores_gemma":[0.0024646688,0.00033732565,0.00082462985,0.0010321282,0.003525984,0.0046540564,0.00259753,0.0033979947,0.0019138248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103483735,0.000008799814,0.00002293062,0.00000933547,0.0000014205767,0.000016936803,0.00007855165,0.00024129685,0.00034843243,0.9963213,0.00060914,0.0023314573],"study_design_scores_gemma":[0.000006906383,0.00000781846,0.00006317755,0.0000073110027,0.0000016880057,0.000029035338,0.000033580138,0.0013497345,0.00030482784,0.99644995,0.0017406383,0.00000527152],"about_ca_topic_score_codex":0.0009013793,"about_ca_topic_score_gemma":0.00058197597,"teacher_disagreement_score":0.014299815,"about_ca_system_score_codex":0.0012680244,"about_ca_system_score_gemma":0.0006643162,"threshold_uncertainty_score":0.047837615},"labels":[],"label_agreement":null},{"id":"W1885730953","doi":"10.1007/978-3-540-74742-0_55","title":"Distributing Fixed Time Slices in Heterogeneous Networks of Workstations (NOWs)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workstation; Scheme (mathematics); Task (project management); Parallel computing; Simple (philosophy); Distributed computing; Heterogeneous network; Operating system","score_opus":0.016880154519154447,"score_gpt":0.26244294999218587,"score_spread":0.24556279547303142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885730953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15736915,0.0026534912,0.81886417,0.00032863475,0.00066212454,0.00027027034,0.0002564184,0.002900109,0.016695667],"genre_scores_gemma":[0.6197991,0.0009593511,0.3611931,0.00009836931,0.00022589919,0.00013628199,0.0004954187,0.0004630003,0.01662952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993349,0.00012908952,0.00003666459,0.00017030377,0.00015349274,0.00017558316],"domain_scores_gemma":[0.9985512,0.00031983203,0.00008739186,0.00058040355,0.00025521833,0.00020592149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011754637,0.00073527044,0.0010674665,0.0005209394,0.0009709473,0.001214925,0.002407536,0.0006121172,0.008485347],"category_scores_gemma":[0.0021525186,0.0006370418,0.0005175479,0.0013689935,0.00072078273,0.0018324789,0.0017141472,0.0008005568,0.0012012876],"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.003693213,0.000379036,0.002460778,0.00047399433,0.00018217608,0.00055840454,0.0007464889,0.40006465,0.06809453,0.046497587,0.019392023,0.45745707],"study_design_scores_gemma":[0.00034304624,0.00073160866,0.0020867565,0.00006837788,0.00017931544,0.00043054033,0.00048337498,0.8802054,0.03040381,0.053542,0.031457443,0.00006836373],"about_ca_topic_score_codex":0.0049186232,"about_ca_topic_score_gemma":0.0065503675,"teacher_disagreement_score":0.008485347,"about_ca_system_score_codex":0.0011179135,"about_ca_system_score_gemma":0.0009981965,"threshold_uncertainty_score":0.028386295},"labels":[],"label_agreement":null},{"id":"W1886179201","doi":"10.1007/11424918_5","title":"ARES 2: A Tool for Evaluating Cooperative and Competitive Multi-agent Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Calgary","funders":"","keywords":"Computer science; Key (lock); Systems engineering; Range (aeronautics); Multi-agent system; Software engineering; Simulation; Operations research; Artificial intelligence; Computer security; Aerospace engineering; Engineering","score_opus":0.048481816225201486,"score_gpt":0.30612797795225416,"score_spread":0.2576461617270527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886179201","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.09828983,0.0010364208,0.7795094,0.0002675364,0.00055393664,0.0016568489,0.014502494,0.039590903,0.06459257],"genre_scores_gemma":[0.3453945,0.00038741773,0.6243916,0.00008559468,0.000081377075,0.0028913398,0.01342061,0.0026919928,0.010655508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930801,0.0022322307,0.0005820401,0.0004078887,0.003412059,0.0002856062],"domain_scores_gemma":[0.98371375,0.010738935,0.0011208853,0.0011957474,0.0028584348,0.0003723337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006151138,0.0025171884,0.0016823179,0.007200122,0.00091507396,0.0033749023,0.0023719186,0.0014135783,0.017920708],"category_scores_gemma":[0.023408268,0.0007526252,0.0011266163,0.005089626,0.00083452667,0.0048052697,0.0022207429,0.0010707903,0.0023606676],"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.0024900096,0.00084682123,0.016823143,0.0034150975,0.00095139653,0.0005104415,0.0014280846,0.24714707,0.01023013,0.09132385,0.09035604,0.53447795],"study_design_scores_gemma":[0.00036520473,0.0010301825,0.007556474,0.00021510801,0.00031051124,0.00033175267,0.0006020281,0.8652357,0.013552759,0.055959973,0.05467899,0.00016127095],"about_ca_topic_score_codex":0.0044713737,"about_ca_topic_score_gemma":0.005163303,"teacher_disagreement_score":0.017920708,"about_ca_system_score_codex":0.0013519324,"about_ca_system_score_gemma":0.0015137511,"threshold_uncertainty_score":0.05995071},"labels":[],"label_agreement":null},{"id":"W1886339809","doi":"10.1007/978-3-642-29627-7_26","title":"A Model for Biased Fractionation after Whole Genome Duplication","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological Sciences","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 Ottawa","funders":"","keywords":"Gene duplication; Genome; Gene; Biology; Genetics; Chromosomal translocation; Constraint (computer-aided design); Computational biology; Mathematics","score_opus":0.03192913365981812,"score_gpt":0.2352527056424772,"score_spread":0.20332357198265907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886339809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31311154,0.003940319,0.6017583,0.008839159,0.0013862433,0.00018361157,0.0018416216,0.0039029203,0.0650362],"genre_scores_gemma":[0.9035654,0.0017447573,0.02680473,0.0031054253,0.00036625116,0.0002369646,0.0008565776,0.0007734321,0.06254643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997111,0.00003443363,0.000009248984,0.00010920028,0.00004706905,0.00008893156],"domain_scores_gemma":[0.9992706,0.0002893802,0.00007083239,0.00018083978,0.000073816336,0.00011447779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081149966,0.00066208193,0.0013682174,0.0009755373,0.0006707915,0.0013266444,0.0026385062,0.002706834,0.014623865],"category_scores_gemma":[0.0027707417,0.0004159654,0.0015081025,0.0009613947,0.0012640782,0.002561704,0.0012314521,0.0014024243,0.0033544018],"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.00044540744,0.0000982405,0.0036195198,0.0004149022,0.00014710648,0.0014220602,0.00036806107,0.11605767,0.07598292,0.7462442,0.013069473,0.042130396],"study_design_scores_gemma":[0.0001476681,0.0001324614,0.002958734,0.000024509254,0.00009243259,0.0012405887,0.000094870964,0.22740763,0.008190565,0.7512238,0.00839721,0.00008957549],"about_ca_topic_score_codex":0.0018587267,"about_ca_topic_score_gemma":0.0010495295,"teacher_disagreement_score":0.014623865,"about_ca_system_score_codex":0.0012114316,"about_ca_system_score_gemma":0.00060855073,"threshold_uncertainty_score":0.048921645},"labels":[],"label_agreement":null},{"id":"W1886363748","doi":"10.1007/978-3-540-69733-6_6","title":"On the Monotonicity of Weak Searching","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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 Regina","funders":"","keywords":"Monotonic function; Digraph; Computer science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.02806827670807373,"score_gpt":0.26032164602651364,"score_spread":0.2322533693184399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886363748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047520142,0.013275535,0.47776434,0.011114687,0.00074493675,0.00012233901,0.00054014707,0.00030788482,0.44861007],"genre_scores_gemma":[0.7257752,0.013224274,0.15926962,0.0027318737,0.0017665051,0.00057337666,0.000596792,0.0005374594,0.09552488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987012,0.0005376781,0.00008039556,0.00017773827,0.00036126235,0.00014181239],"domain_scores_gemma":[0.991748,0.0061736084,0.00030331308,0.00073471974,0.0007760612,0.00026425655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025737637,0.0007328497,0.0012248561,0.0014126934,0.0010963661,0.0023706248,0.0017373626,0.0014110229,0.014552268],"category_scores_gemma":[0.014400896,0.0007119868,0.0010432845,0.0019710136,0.0053386963,0.008349814,0.0025496692,0.0050912173,0.0016908186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037141515,0.000015867416,0.00014404407,0.00010679433,0.000008352088,0.000032216773,0.00010297006,0.0015578255,0.0005172058,0.97521544,0.0028971657,0.019365108],"study_design_scores_gemma":[0.000011288065,0.000020230385,0.00017425726,0.00005010078,0.0000069331772,0.00008481096,0.000051153136,0.0063452395,0.00026670453,0.98716474,0.005817462,0.0000069870352],"about_ca_topic_score_codex":0.0010332778,"about_ca_topic_score_gemma":0.0007694909,"teacher_disagreement_score":0.014552268,"about_ca_system_score_codex":0.0012090799,"about_ca_system_score_gemma":0.0009678104,"threshold_uncertainty_score":0.048682153},"labels":[],"label_agreement":null},{"id":"W1886451272","doi":"10.1007/978-3-642-13437-1_22","title":"Peer-Based Intelligent Tutoring Systems: A Corpus-Oriented Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multimedia; Natural language processing; Artificial intelligence; Human–computer interaction; Software engineering; Programming language","score_opus":0.024878209635484663,"score_gpt":0.24471920553859133,"score_spread":0.21984099590310668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886451272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023270782,0.0033371907,0.9163515,0.0016886491,0.0003698149,0.00093435124,0.001802602,0.0045556906,0.047689326],"genre_scores_gemma":[0.38393003,0.0037331693,0.56767964,0.00037327295,0.00075817213,0.0018677857,0.005207319,0.0019985265,0.034452166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962968,0.0018505922,0.00019867177,0.0004715582,0.0010787786,0.00010351738],"domain_scores_gemma":[0.9910452,0.0056555914,0.00019259696,0.00095865893,0.0019022184,0.0002458028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004602891,0.00091820717,0.0018447548,0.0035137434,0.0021755209,0.005405059,0.0053511336,0.0021887866,0.011178168],"category_scores_gemma":[0.02142505,0.00073092745,0.0005842575,0.0050553964,0.0023039225,0.009786334,0.003961211,0.0016651368,0.003513084],"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.00038129094,0.00038932695,0.0023740756,0.00219517,0.00022651599,0.0006262263,0.005717685,0.05817973,0.012320359,0.16535306,0.034939643,0.71729696],"study_design_scores_gemma":[0.00017138539,0.0003699609,0.0026217487,0.00040127942,0.00035741486,0.0011215529,0.0037564703,0.6086745,0.025925579,0.1890467,0.16735697,0.00019644857],"about_ca_topic_score_codex":0.0036650666,"about_ca_topic_score_gemma":0.005434026,"teacher_disagreement_score":0.011178168,"about_ca_system_score_codex":0.0016870535,"about_ca_system_score_gemma":0.0020968923,"threshold_uncertainty_score":0.037394702},"labels":[],"label_agreement":null},{"id":"W1886742437","doi":"10.1007/978-3-642-30950-2_15","title":"An Analysis of Attention to Student – Adaptive Hints in an Educational Game","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Leverage (statistics); Educational game; Human–computer interaction; Affect (linguistics); Plan (archaeology); Multimedia; Artificial intelligence","score_opus":0.035604619138002294,"score_gpt":0.36801480353187804,"score_spread":0.33241018439387576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886742437","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.9938783,0.00013951235,0.0031906602,0.000020812979,0.000011230768,0.000059180216,0.00011499626,0.00007817982,0.0025069942],"genre_scores_gemma":[0.9979693,0.000043972093,0.0008007868,0.000019952113,0.000004372464,0.000022831728,0.00013780383,0.000030387555,0.0009704947],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99953294,0.00011765351,0.000030541174,0.00008445147,0.0001724911,0.0000619439],"domain_scores_gemma":[0.9926333,0.005423437,0.0004695886,0.00024425585,0.00087744003,0.00035207826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063086,0.00032200888,0.00039151686,0.00093052967,0.00019378937,0.00079810683,0.00051237806,0.00044290442,0.0030609453],"category_scores_gemma":[0.011327919,0.00019399809,0.00027666177,0.00068833877,0.00017218957,0.00042931977,0.00045131153,0.00039570604,0.0003793849],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014653082,0.0030201254,0.3854156,0.0010091275,0.0007200768,0.0013399208,0.0052393125,0.01106103,0.24275312,0.0032891538,0.002797574,0.32870185],"study_design_scores_gemma":[0.00008897375,0.001482565,0.92467713,0.000043698434,0.00033361992,0.00050196657,0.00092488417,0.053559255,0.015943417,0.0010810718,0.0013147995,0.000048690537],"about_ca_topic_score_codex":0.0062251086,"about_ca_topic_score_gemma":0.0044340915,"teacher_disagreement_score":0.0062251086,"about_ca_system_score_codex":0.00045933283,"about_ca_system_score_gemma":0.00031602537,"threshold_uncertainty_score":0.012377739},"labels":[],"label_agreement":null},{"id":"W1887036206","doi":"10.1007/978-3-642-31155-0_7","title":"On Minimum Sum of Radii and Diameters Clustering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Euclidean geometry; Approximation algorithm; Metric (unit); Cluster analysis; Shortest path problem; Polynomial-time approximation scheme; Euclidean distance; Mathematics; Plane (geometry); Graph; Singleton; Path (computing); Polynomial; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.018562734337131095,"score_gpt":0.23256725870375436,"score_spread":0.21400452436662326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887036206","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.010413836,0.007794301,0.95223904,0.0022678804,0.0008144872,0.000106135536,0.0004952143,0.0007188428,0.025150174],"genre_scores_gemma":[0.18483125,0.010455592,0.76134497,0.0010722352,0.0029766057,0.0004979673,0.0018772123,0.0017222768,0.035221938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965643,0.0012165392,0.00018301392,0.0006525572,0.0011724106,0.00021107808],"domain_scores_gemma":[0.9939306,0.0034709298,0.00038608335,0.0010377271,0.0008753635,0.00029938825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002644686,0.0025682026,0.0037452374,0.003419459,0.002211798,0.0036145896,0.006914321,0.0034844654,0.0071563586],"category_scores_gemma":[0.01650593,0.0015336989,0.0019653805,0.008086165,0.003106732,0.008248325,0.005457217,0.004944125,0.002841988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031750553,0.000084151776,0.00060007046,0.00072284776,0.000121117555,0.00008623698,0.00043433593,0.14575231,0.0026352387,0.61860216,0.041038964,0.18960512],"study_design_scores_gemma":[0.000025853715,0.000049265873,0.00045278177,0.00009204365,0.000043486554,0.00025806355,0.00012515047,0.2324763,0.0012310744,0.74722016,0.017981043,0.000044812405],"about_ca_topic_score_codex":0.002881303,"about_ca_topic_score_gemma":0.0027056425,"teacher_disagreement_score":0.0071563586,"about_ca_system_score_codex":0.0041028527,"about_ca_system_score_gemma":0.001297426,"threshold_uncertainty_score":0.029768467},"labels":[],"label_agreement":null},{"id":"W188710525","doi":"10.1007/978-3-319-08608-8_3","title":"OSSM: The OLAP Security Specification Model","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Online analytical processing; Computer science; Computer security model; Dimension (graph theory); Data model (GIS); Database; Data security; Security policy; Computer security; Domain (mathematical analysis); Data mining; Data warehouse; Encryption","score_opus":0.028011354656234885,"score_gpt":0.2529050565961058,"score_spread":0.2248937019398709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188710525","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.0037970329,0.00035479103,0.9599237,0.0011097587,0.00015572569,0.00023669342,0.0028536427,0.007626162,0.023942482],"genre_scores_gemma":[0.14204286,0.0019070166,0.79084146,0.0016047315,0.0002002597,0.0012010463,0.012287938,0.0039908946,0.045923766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980615,0.0004869762,0.00021150004,0.0002353195,0.00081815623,0.00018646399],"domain_scores_gemma":[0.9985669,0.0004107426,0.00013303886,0.0005304514,0.00027829007,0.00008056089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021803374,0.0012562686,0.0005373957,0.001317562,0.0007261176,0.0042433375,0.0022714,0.0014946011,0.010896288],"category_scores_gemma":[0.0040117525,0.001025187,0.0013577576,0.0013334639,0.0014988654,0.004925875,0.0027375473,0.0029677586,0.005387178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013971244,0.00005990424,0.00045000008,0.00043221825,0.000030578944,0.0002459006,0.0003864919,0.023174252,0.00588543,0.8671429,0.02838493,0.07366759],"study_design_scores_gemma":[0.00006889955,0.00007770053,0.00025845994,0.0003578754,0.000054817792,0.00047196238,0.00019477325,0.11361932,0.014716187,0.46117303,0.40893263,0.00007444448],"about_ca_topic_score_codex":0.0041387803,"about_ca_topic_score_gemma":0.004929118,"teacher_disagreement_score":0.010896288,"about_ca_system_score_codex":0.0014403269,"about_ca_system_score_gemma":0.0030035218,"threshold_uncertainty_score":0.036451757},"labels":[],"label_agreement":null},{"id":"W1887209609","doi":"10.1007/978-3-540-85259-9_13","title":"A Methodology for Bridging between RBAC and an Arbitrary Application Program","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Role-based access control; Computer science; Bridging (networking); Access control; Programming language; Graph; Software engineering; Theoretical computer science; Distributed computing; Computer security","score_opus":0.07436677496485684,"score_gpt":0.3741329408636101,"score_spread":0.29976616589875327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887209609","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.0013986559,0.00005187207,0.99570894,0.00012701661,0.000034577126,0.000083690335,0.000022668255,0.0011725577,0.0014000179],"genre_scores_gemma":[0.046271995,0.00009025621,0.94737846,0.00016035665,0.00004423012,0.00021016141,0.0000967669,0.0005885829,0.005159191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99130076,0.0029227338,0.0007617407,0.0014378312,0.0028559014,0.00072107476],"domain_scores_gemma":[0.9853161,0.0054892525,0.0005704184,0.0061009554,0.002036305,0.00048701724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008718787,0.0010314599,0.0010048111,0.00207534,0.0026259928,0.0050812783,0.004124156,0.0025956156,0.010238884],"category_scores_gemma":[0.01861221,0.0020384027,0.002517896,0.0019089482,0.00397816,0.008925149,0.007359943,0.006178764,0.0030577453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115280825,0.000118340235,0.0006474163,0.00028056648,0.00007225899,0.0002254359,0.0015757728,0.007930321,0.0058331518,0.79687405,0.004140383,0.18218699],"study_design_scores_gemma":[0.00006820548,0.00019653192,0.0004034335,0.00027008558,0.0002297506,0.0007191304,0.0007613273,0.25453967,0.02549435,0.60777473,0.1094104,0.0001322962],"about_ca_topic_score_codex":0.004045072,"about_ca_topic_score_gemma":0.0035687825,"teacher_disagreement_score":0.010238884,"about_ca_system_score_codex":0.0014886212,"about_ca_system_score_gemma":0.004259927,"threshold_uncertainty_score":0.046109915},"labels":[],"label_agreement":null},{"id":"W1887353995","doi":"10.1007/11861201_12","title":"On the Dynamics of Some Exceptional Fuzzy Cellular Automata","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"Carleton University","funders":"","keywords":"Cellular automaton; Computer science; Mobile automaton; Stochastic cellular automaton; Fuzzy logic; Theoretical computer science; Continuous spatial automaton; Term (time); Automaton; Fuzzy set; Asynchronous cellular automaton; Automata theory; Algorithm; Artificial intelligence; Quantum finite automata","score_opus":0.01148303974785472,"score_gpt":0.21929581325036088,"score_spread":0.20781277350250615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887353995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3952748,0.0023447815,0.49835166,0.0013645903,0.0004799079,0.000048737442,0.0002313434,0.0003178261,0.101586275],"genre_scores_gemma":[0.9689999,0.00079061475,0.019829875,0.00010191179,0.00011263751,0.00004028032,0.00008584043,0.000039523802,0.009999398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997657,0.000053137064,0.00001465688,0.00004550167,0.00007298448,0.000048035836],"domain_scores_gemma":[0.99932706,0.0002953792,0.000072305746,0.000066205095,0.00014067469,0.00009832822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004333643,0.00035423334,0.0006698214,0.00090538565,0.0009638852,0.0015587066,0.0006685717,0.0006976102,0.0031480885],"category_scores_gemma":[0.0021397541,0.00023723369,0.0006607673,0.00053567305,0.0015974948,0.0013088768,0.0008951899,0.0010194663,0.0002715564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018948314,0.000007636051,0.00026608462,0.000026068175,0.000008922375,0.000093687646,0.00017148793,0.022033498,0.0016707826,0.9692638,0.0006371947,0.0058018547],"study_design_scores_gemma":[0.000009101914,0.000017414872,0.00027531557,0.00002045354,0.00000979623,0.00013429203,0.00008866314,0.22909713,0.00085906667,0.76673925,0.0027318543,0.0000176526],"about_ca_topic_score_codex":0.002090985,"about_ca_topic_score_gemma":0.0013903301,"teacher_disagreement_score":0.0031480885,"about_ca_system_score_codex":0.00091450743,"about_ca_system_score_gemma":0.000436319,"threshold_uncertainty_score":0.010531366},"labels":[],"label_agreement":null},{"id":"W1887434847","doi":"10.1007/978-3-642-22792-9_38","title":"Constant-Rate Oblivious Transfer from Noisy Channels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Oblivious transfer; Computer science; Generality; Constant (computer programming); Security parameter; Transfer (computing); Corollary; Channel (broadcasting); Binary symmetric channel; Theoretical computer science; Alice and Bob; Discrete mathematics; Cryptography; Algorithm; Mathematics; Channel capacity; Computer network; Alice (programming language); Parallel computing","score_opus":0.021383647531742943,"score_gpt":0.22123537187448616,"score_spread":0.19985172434274323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887434847","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.025254546,0.0017159397,0.9134943,0.0014699148,0.00032928956,0.00019245612,0.00038572194,0.0017686192,0.055389237],"genre_scores_gemma":[0.7912819,0.0034196153,0.114819564,0.0007189105,0.0006272904,0.0006343742,0.0007127433,0.0009146954,0.08687095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986745,0.0003061509,0.00006656768,0.00021503872,0.0005016232,0.00023612044],"domain_scores_gemma":[0.99761677,0.0012009271,0.00014762009,0.00085508946,0.00012906361,0.00005056615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009510208,0.001294979,0.0011517293,0.0007946013,0.0010576628,0.0021332726,0.0017687441,0.0019202672,0.008594095],"category_scores_gemma":[0.004392937,0.0008034146,0.00075237674,0.0014950116,0.0026558142,0.0060116537,0.0037430422,0.0037204092,0.0035310576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036093782,0.000087595465,0.0001344442,0.00049592805,0.00006323258,0.000131293,0.00037250802,0.05024138,0.010420598,0.8536363,0.01066648,0.07338934],"study_design_scores_gemma":[0.00008233494,0.000083616455,0.00013723648,0.00012402268,0.00004847053,0.0003106651,0.00004142861,0.11609602,0.018940497,0.84950656,0.01456686,0.00006224369],"about_ca_topic_score_codex":0.00025790805,"about_ca_topic_score_gemma":0.00019752995,"teacher_disagreement_score":0.008594095,"about_ca_system_score_codex":0.0012292981,"about_ca_system_score_gemma":0.0009353997,"threshold_uncertainty_score":0.028750122},"labels":[],"label_agreement":null},{"id":"W1887546054","doi":"10.1007/11527923_114","title":"Vulnerabilities in Biometric Encryption Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":161,"is_retracted":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":"Biometrics; Computer science; Encryption; Vulnerability (computing); Code (set theory); Computer security; Image (mathematics); Computer vision; Data mining; Artificial intelligence","score_opus":0.024611035481166027,"score_gpt":0.25335752553433877,"score_spread":0.22874649005317274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887546054","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.09983116,0.054629255,0.4031001,0.008342717,0.000769824,0.00017884202,0.00030516795,0.0018420279,0.43100092],"genre_scores_gemma":[0.8312141,0.024541674,0.04441739,0.00056075485,0.00044412634,0.00010142645,0.00022150848,0.00026562542,0.098233365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913114,0.00017807289,0.00004471263,0.00009189409,0.0004383688,0.00011585027],"domain_scores_gemma":[0.9984913,0.0008668243,0.00014004031,0.0003400824,0.00013149023,0.000030193296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057992944,0.0007723093,0.00048195216,0.0009837956,0.00065161154,0.002714207,0.00062330393,0.0021507312,0.0061764247],"category_scores_gemma":[0.0038993096,0.00063373335,0.00039853418,0.000996706,0.0016177793,0.0058229347,0.0017969024,0.002478592,0.0017167241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008664381,0.000047904778,0.0006649895,0.00029944515,0.000026752528,0.00067071634,0.00063093024,0.0074183885,0.0066145863,0.81193393,0.012293969,0.15931173],"study_design_scores_gemma":[0.0000121528465,0.00007937161,0.0006851791,0.00033877656,0.000041674717,0.0046763294,0.0002764092,0.027597634,0.013810422,0.87397766,0.07846038,0.000044084954],"about_ca_topic_score_codex":0.00022675822,"about_ca_topic_score_gemma":0.00019891249,"teacher_disagreement_score":0.0061764247,"about_ca_system_score_codex":0.0006778034,"about_ca_system_score_gemma":0.0003250275,"threshold_uncertainty_score":0.020662129},"labels":[],"label_agreement":null},{"id":"W1887553753","doi":"10.1007/11499145_83","title":"Modeling Inaccurate Perception: Desynchronization Issues of a Chaotic Pattern Recognition Neural Network","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Carleton University","funders":"","keywords":"Chaotic; Computer science; Lyapunov exponent; Artificial intelligence; Perception; Numeral system; Image (mathematics); Object (grammar); Point (geometry); Artificial neural network; Algorithm; Pattern recognition (psychology); Computer vision; Mathematics; Psychology","score_opus":0.03173570963163696,"score_gpt":0.26230069798816197,"score_spread":0.230564988356525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887553753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19771658,0.0012402205,0.7857409,0.0024571687,0.00024358588,0.00004401591,0.000126755,0.0002607803,0.012169942],"genre_scores_gemma":[0.98473454,0.0004963448,0.0119970525,0.000094851464,0.000084508305,0.00002452713,0.000036630456,0.000067046436,0.0024645175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974257,0.00008113984,0.0000143317075,0.00006438431,0.000062530664,0.00003504035],"domain_scores_gemma":[0.9985852,0.00081691967,0.00018651914,0.00021456125,0.00014096092,0.00005583639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083241845,0.0004964127,0.00071222096,0.0002760547,0.00047552353,0.0012633138,0.0011916806,0.0013081714,0.0017794458],"category_scores_gemma":[0.0066979597,0.00055487297,0.00054263993,0.00047186608,0.00096703565,0.0023947672,0.0011780462,0.0015238676,0.00019617104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016519403,0.000042023057,0.0013200665,0.00009281687,0.000054821314,0.00022754853,0.00023509903,0.88858455,0.0072508175,0.07394281,0.0014890294,0.026595205],"study_design_scores_gemma":[0.000003714569,0.000007987837,0.0001690742,0.0000028016266,0.0000052718797,0.000018020313,0.00000718267,0.98931944,0.0002891558,0.01006085,0.000112078254,0.00000438815],"about_ca_topic_score_codex":0.004265858,"about_ca_topic_score_gemma":0.0018350746,"teacher_disagreement_score":0.004265858,"about_ca_system_score_codex":0.0008117484,"about_ca_system_score_gemma":0.0004553797,"threshold_uncertainty_score":0.008482039},"labels":[],"label_agreement":null},{"id":"W1888439455","doi":"10.1007/978-3-642-02611-9_73","title":"Brain MRI Segmentation Based on the Rényi’s Fractal Dimension","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Manitoba; CancerCare Manitoba","funders":"","keywords":"Multifractal system; Computer science; Artificial intelligence; Fractal dimension; Segmentation; Pattern recognition (psychology); Magnetic resonance imaging; Entropy (arrow of time); Dimension (graph theory); Image segmentation; Fractal; Fractal analysis; Computer vision; Mathematics; Physics; Combinatorics","score_opus":0.014330198273255443,"score_gpt":0.26867622161654675,"score_spread":0.2543460233432913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888439455","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.084821254,0.0047329688,0.90161705,0.0003087567,0.00016939724,0.000045135625,0.00020586987,0.0006267289,0.0074729244],"genre_scores_gemma":[0.54474,0.0040753037,0.44671443,0.00008161987,0.00035100587,0.000065357504,0.00029157754,0.0002554478,0.003425235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997557,0.000048419668,0.000016883107,0.000050251736,0.000104943574,0.00002372142],"domain_scores_gemma":[0.99911016,0.0005142065,0.00010924314,0.00006940633,0.00016760307,0.000029411367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865619,0.00047014854,0.0005795703,0.0025310344,0.0002554315,0.0009436467,0.0003924187,0.00055705063,0.0010978491],"category_scores_gemma":[0.0019369777,0.00031156314,0.00065412436,0.0011666435,0.00079463836,0.0015285871,0.00049397,0.0007124399,0.00036357413],"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.00055189757,0.000053624462,0.0040672487,0.00069885777,0.00020053379,0.00050055026,0.0004522013,0.07046246,0.1911714,0.16886479,0.0047742324,0.5582022],"study_design_scores_gemma":[0.00004017695,0.00021230736,0.012562287,0.00010460059,0.00016817926,0.0024524524,0.00009975758,0.8230446,0.07005837,0.07125535,0.019801294,0.00020063815],"about_ca_topic_score_codex":0.00050691346,"about_ca_topic_score_gemma":0.0003995965,"teacher_disagreement_score":0.0025310344,"about_ca_system_score_codex":0.0004944804,"about_ca_system_score_gemma":0.00030718732,"threshold_uncertainty_score":0.003672719},"labels":[],"label_agreement":null},{"id":"W188845496","doi":"10.1007/978-3-642-23568-9_9","title":"Semi-algebraic Description of the Equilibria of Dynamical Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","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":"Western University","funders":"","keywords":"Algebraic number; Dynamical systems theory; Parametric statistics; Ordinary differential equation; Univariate; Sign (mathematics); Decomposition; Mathematics; Polynomial; Applied mathematics; Dynamical system (definition); Differential (mechanical device); Computer science; Pure mathematics; Differential equation; Mathematical analysis; Multivariate statistics","score_opus":0.042371583906536246,"score_gpt":0.2644864252922315,"score_spread":0.22211484138569523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188845496","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.05390964,0.0062014335,0.70971525,0.0023778693,0.0007260766,0.00010629739,0.00054378057,0.00021745135,0.2262023],"genre_scores_gemma":[0.837749,0.0046923347,0.09575633,0.00047927926,0.0013882319,0.00023320879,0.0005200448,0.0001531131,0.059028387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996182,0.00010880739,0.000032134092,0.000049984592,0.00014731202,0.0000435623],"domain_scores_gemma":[0.99961203,0.00013550102,0.000043626267,0.000049661994,0.00011233441,0.00004689722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007265121,0.00070006505,0.0006105222,0.001448554,0.0007830809,0.0026385766,0.0011170438,0.0007864464,0.006725136],"category_scores_gemma":[0.0011757464,0.0003621351,0.00084291614,0.0008374813,0.002105642,0.004129032,0.0012468529,0.0021898835,0.0008316602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025230822,0.000003330135,0.00001869875,0.000013971315,0.0000019570898,0.000015999747,0.000048207174,0.0008489355,0.00024104299,0.9973264,0.00027978333,0.0011991049],"study_design_scores_gemma":[0.000004611114,0.0000080517175,0.000044728073,0.000008842348,0.0000028011007,0.000048984675,0.000034450593,0.010087513,0.0001224878,0.98436654,0.0052672257,0.000003872618],"about_ca_topic_score_codex":0.0007520972,"about_ca_topic_score_gemma":0.00070080796,"teacher_disagreement_score":0.006725136,"about_ca_system_score_codex":0.000919548,"about_ca_system_score_gemma":0.00052386406,"threshold_uncertainty_score":0.022497833},"labels":[],"label_agreement":null},{"id":"W1888496803","doi":"10.1007/978-3-642-02976-9_46","title":"Automatic Detecting Documents Containing Personal Health Information","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"National Research Council Canada","funders":"","keywords":"Computer science; Artificial intelligence; Decision tree; Support vector machine; Natural language processing; Categorization; Information retrieval; Lexical analysis; Text categorization; Naive Bayes classifier; The Internet; Task (project management); Supervised learning; Machine learning; World Wide Web","score_opus":0.01851048022841444,"score_gpt":0.268608716320946,"score_spread":0.25009823609253157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888496803","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.5632409,0.024899995,0.32238054,0.0024690228,0.0021325438,0.0013245668,0.038387366,0.020241344,0.02492367],"genre_scores_gemma":[0.5754009,0.0061358586,0.3485603,0.0005860273,0.0010782116,0.00028623175,0.03830288,0.0005143533,0.029135203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994276,0.00005338047,0.00006495396,0.00013569328,0.0002489237,0.00006941414],"domain_scores_gemma":[0.9971601,0.0014627913,0.0002970033,0.00021136587,0.000741021,0.00012768582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060792296,0.0007091867,0.0008068571,0.00548948,0.0007471745,0.0014875777,0.00068324123,0.001070126,0.0030000042],"category_scores_gemma":[0.002602601,0.00027193414,0.0005332294,0.0026340568,0.00028611062,0.0010163089,0.0004812782,0.0005128427,0.0028314956],"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.00090097357,0.0003798194,0.017462622,0.0011625965,0.00010021162,0.0013893197,0.00042211352,0.0009981332,0.14661086,0.0016089039,0.042962674,0.78600174],"study_design_scores_gemma":[0.00021755665,0.000969606,0.13186717,0.0007058643,0.001278007,0.01517237,0.0016420103,0.13385747,0.55694324,0.008992075,0.1481506,0.00020404955],"about_ca_topic_score_codex":0.0033692184,"about_ca_topic_score_gemma":0.0048947707,"teacher_disagreement_score":0.00548948,"about_ca_system_score_codex":0.0005197352,"about_ca_system_score_gemma":0.0008267159,"threshold_uncertainty_score":0.010035992},"labels":[],"label_agreement":null},{"id":"W1888622165","doi":"10.1007/978-3-319-22747-4_12","title":"Dynamic Credibility Threshold Assignment in Trust and Reputation Mechanisms Using PID Controller","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"PID controller; Credibility; Computer science; Reputation; Controller (irrigation); Computer security; Control theory (sociology); Control (management); Artificial intelligence; Control engineering; Engineering; Law; Political science","score_opus":0.038881286239249406,"score_gpt":0.31320299963166054,"score_spread":0.2743217133924111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888622165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01749177,0.0007576656,0.9743798,0.00021013887,0.00021670561,0.000050788272,0.000016861888,0.00039629827,0.006480068],"genre_scores_gemma":[0.9075928,0.00037876345,0.08475693,0.00007510163,0.000112442394,0.00008195506,0.00002185432,0.000045933975,0.0069342395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878377,0.00030767458,0.00006615434,0.00031567033,0.00038225937,0.0001443448],"domain_scores_gemma":[0.9978877,0.0011809074,0.00015370344,0.00025076268,0.00042318323,0.00010388646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325136,0.00058422575,0.0011742461,0.0006397387,0.0007768576,0.0028159623,0.0021239421,0.0014616457,0.003284144],"category_scores_gemma":[0.0070819417,0.0004045941,0.0005205257,0.0007673352,0.0012806412,0.0025898004,0.0014542214,0.0022114506,0.0005639247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000743545,0.0003800968,0.0010619805,0.0003359532,0.00012225144,0.00029126488,0.00045593653,0.3954631,0.017721655,0.22008567,0.0049493546,0.35838914],"study_design_scores_gemma":[0.000033313736,0.000080740545,0.00013027304,0.000012401499,0.000024628138,0.00006175361,0.000019287978,0.9702534,0.0018816933,0.026283398,0.0011977367,0.00002135575],"about_ca_topic_score_codex":0.0011980183,"about_ca_topic_score_gemma":0.0007669689,"teacher_disagreement_score":0.003284144,"about_ca_system_score_codex":0.0015192268,"about_ca_system_score_gemma":0.00089802535,"threshold_uncertainty_score":0.012296617},"labels":[],"label_agreement":null},{"id":"W1888792907","doi":"10.1007/3-540-45490-x_62","title":"Mining Web Logs to Improve Web Caching and Prefetching","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Security token; Cache; False sharing; The Internet; Proxy (statistics); Cache algorithms; Web page; Data mining; Database; CPU cache; World Wide Web; Computer network; Machine learning","score_opus":0.015952382100617227,"score_gpt":0.23029988881275926,"score_spread":0.21434750671214203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888792907","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.5910356,0.0035741304,0.35737345,0.00079946546,0.0003546076,0.00038667663,0.00713793,0.036037896,0.0033003073],"genre_scores_gemma":[0.82389086,0.0008293973,0.16348648,0.00014568763,0.0002234076,0.00018654428,0.007959021,0.0004755895,0.002802957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00009895663,0.00006570262,0.00014515738,0.00025134583,0.00007333879],"domain_scores_gemma":[0.99634117,0.0016490903,0.00035048233,0.0005980726,0.0009117005,0.00014942363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068450137,0.0012140261,0.0014197938,0.0037768679,0.00054785353,0.0012195795,0.0011237175,0.00084368483,0.0012541871],"category_scores_gemma":[0.006188982,0.0006127882,0.0006750643,0.004264673,0.0002570508,0.0017489161,0.00039803906,0.0009020581,0.0010786441],"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.0011288559,0.0017894485,0.09059996,0.0004861028,0.00030522232,0.00028956766,0.00014164406,0.100866646,0.038667962,0.0012799031,0.022519428,0.74192524],"study_design_scores_gemma":[0.00003798319,0.00010531363,0.0065243784,0.000014247405,0.000080242724,0.00010625001,0.000051932908,0.97604895,0.013392908,0.0023601344,0.0012589879,0.000018710009],"about_ca_topic_score_codex":0.009957955,"about_ca_topic_score_gemma":0.022450747,"teacher_disagreement_score":0.009957955,"about_ca_system_score_codex":0.0005843106,"about_ca_system_score_gemma":0.0012436381,"threshold_uncertainty_score":0.019800007},"labels":[],"label_agreement":null},{"id":"W1888803100","doi":"10.1007/978-3-540-24677-0_97","title":"Monte Carlo Approach for Switching State-Space Models","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo method; Convergence (economics); Markov chain Monte Carlo; Gibbs sampling; State space; Hybrid Monte Carlo; Algorithm; Markov process; Sample (material); Mathematical optimization; Markov chain; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.012629714224616754,"score_gpt":0.20757172400077323,"score_spread":0.19494200977615647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888803100","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.005168728,0.0004959483,0.9899142,0.00020009401,0.000056168912,0.00002646078,0.00007527328,0.00022488573,0.0038383224],"genre_scores_gemma":[0.6149627,0.0023329575,0.34511843,0.00044169463,0.00041865377,0.00063967216,0.0009561509,0.00061665487,0.03451306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.00049827853,0.000037525635,0.00012129908,0.00023664154,0.00010256429],"domain_scores_gemma":[0.9928039,0.006263807,0.00021280638,0.00027588586,0.0003196778,0.00012401456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025354815,0.00086489617,0.0022957232,0.0013207122,0.0008889896,0.0017919545,0.0024578318,0.0020475227,0.008663421],"category_scores_gemma":[0.008529277,0.0012668576,0.001601947,0.0014388751,0.001572558,0.0022031278,0.0013069833,0.0028698333,0.0010314112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032202704,0.000026191754,0.00018180785,0.000035083787,0.000043393113,0.000042144413,0.000030944007,0.8710535,0.00015127611,0.11963423,0.00065159204,0.00811757],"study_design_scores_gemma":[0.0000032567464,0.0000029700532,0.000022629596,0.0000039239935,0.00000524814,0.0000070891765,0.0000021494557,0.9720862,0.00003521767,0.027591022,0.00023582178,0.000004514534],"about_ca_topic_score_codex":0.011695584,"about_ca_topic_score_gemma":0.011310688,"teacher_disagreement_score":0.011695584,"about_ca_system_score_codex":0.0017453282,"about_ca_system_score_gemma":0.0014397297,"threshold_uncertainty_score":0.028981984},"labels":[],"label_agreement":null},{"id":"W188897625","doi":"10.1007/978-3-642-23771-3_2","title":"Exploring Haptic Feedback in Exergames","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Haptic technology; Computer science; Human–computer interaction; Computer graphics (images); Multimedia; Simulation","score_opus":0.10983508462381314,"score_gpt":0.320974528856435,"score_spread":0.21113944423262188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188897625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34322396,0.012538884,0.49169618,0.0011037759,0.00027901467,0.0001680056,0.0002208987,0.0010376711,0.1497318],"genre_scores_gemma":[0.88384086,0.006217813,0.074822225,0.00025228705,0.0000611852,0.00010146957,0.00018263861,0.000169873,0.03435146],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987996,0.00003372202,0.0000039584456,0.000019742536,0.0000400352,0.00002261579],"domain_scores_gemma":[0.9998754,0.00008988597,0.000004730692,0.000007677177,0.0000115946905,0.000010688755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021896907,0.00065728737,0.00031971344,0.00019823636,0.00023277536,0.001321926,0.00069909194,0.00066881225,0.01037874],"category_scores_gemma":[0.00067774433,0.00024920877,0.00030261948,0.00017029472,0.0006426855,0.0017129962,0.001549023,0.0004818694,0.0008884574],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086783816,0.0002484793,0.0014301466,0.0028656486,0.000119961296,0.001415723,0.008295807,0.013404601,0.44415122,0.08497249,0.006656555,0.43557155],"study_design_scores_gemma":[0.00039579568,0.0033447517,0.033640757,0.0040242267,0.00029745107,0.00966097,0.020721901,0.13911067,0.18886426,0.29232195,0.30727908,0.00033814783],"about_ca_topic_score_codex":0.00026081182,"about_ca_topic_score_gemma":0.00045622938,"teacher_disagreement_score":0.01037874,"about_ca_system_score_codex":0.00013433647,"about_ca_system_score_gemma":0.00013463925,"threshold_uncertainty_score":0.03472036},"labels":[],"label_agreement":null},{"id":"W1889055149","doi":"10.1007/11596141_9","title":"Towards a Classification of Web Service Feature Interactions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Carleton University","funders":"","keywords":"Computer science; Web service; Feature (linguistics); WS-Policy; Service (business); World Wide Web; Web modeling; Web standards; Web development; Web application security","score_opus":0.01863894287301292,"score_gpt":0.26152587749727524,"score_spread":0.2428869346242623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889055149","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.053911477,0.0015817601,0.90781283,0.0007760732,0.00039068746,0.0006720448,0.0018018172,0.0049603027,0.02809296],"genre_scores_gemma":[0.23374292,0.0017334211,0.7362865,0.00036149364,0.00036334444,0.00077298144,0.006898747,0.00088024297,0.018960334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979925,0.0002535701,0.000283828,0.00034574096,0.0008980955,0.000226216],"domain_scores_gemma":[0.9974643,0.0005738871,0.00025013238,0.0004931845,0.0009928816,0.00022551333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989699,0.001229855,0.00091644994,0.00559947,0.0012944507,0.0035191956,0.0015358654,0.0015227499,0.0049910545],"category_scores_gemma":[0.0034267874,0.00048146473,0.0018352389,0.0038568017,0.0011670814,0.005197439,0.0015340742,0.0020911263,0.002995502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034223867,0.00065198314,0.016868165,0.0005788034,0.00012050403,0.00087259297,0.001251554,0.009692065,0.028122861,0.2702169,0.024094211,0.64718807],"study_design_scores_gemma":[0.000077612225,0.000498125,0.015079644,0.0005089237,0.0003325162,0.0031163737,0.0016945692,0.3755482,0.019105615,0.40117094,0.18271108,0.00015634263],"about_ca_topic_score_codex":0.0035613852,"about_ca_topic_score_gemma":0.002354701,"teacher_disagreement_score":0.00559947,"about_ca_system_score_codex":0.0010448522,"about_ca_system_score_gemma":0.0018036781,"threshold_uncertainty_score":0.016696751},"labels":[],"label_agreement":null},{"id":"W188951562","doi":"10.1007/978-3-642-39229-0_15","title":"Hypertext in Mutation: The Mapping of a Mythos","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Hypertext; Hyperlink; Computer science; Reading (process); World Wide Web; Space (punctuation); Set (abstract data type); Hypermedia; Narrative; Interface (matter); Web page; Human–computer interaction; Art; Linguistics","score_opus":0.018744759912405977,"score_gpt":0.2411553248667943,"score_spread":0.22241056495438832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188951562","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12203853,0.010021531,0.3166339,0.02571954,0.002192533,0.0001558476,0.00027947,0.0024060018,0.52055264],"genre_scores_gemma":[0.818763,0.004844974,0.07059228,0.0012040178,0.0006429489,0.00018700141,0.00025123337,0.0010382554,0.10247629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911803,0.0004553883,0.000028213142,0.00010399471,0.0002293718,0.000064951615],"domain_scores_gemma":[0.9980866,0.0010523758,0.00008202325,0.00045726483,0.00015483437,0.00016701705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008890743,0.000342053,0.00028758138,0.0011523647,0.0013524836,0.0056769075,0.0009708326,0.0013997656,0.010188049],"category_scores_gemma":[0.0064132335,0.00022243778,0.00036773083,0.0011417918,0.0052044927,0.010790658,0.0040255873,0.0021470012,0.0014687441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005707866,0.000029554805,0.0006167095,0.00011906611,0.000008742051,0.00035297745,0.011186822,0.0010184605,0.0023645242,0.8601109,0.01154602,0.11258915],"study_design_scores_gemma":[0.000022117598,0.00007117913,0.00084722094,0.00022038798,0.000014045506,0.0019883346,0.0059771785,0.0064925887,0.0032722265,0.6968256,0.28423914,0.000029925848],"about_ca_topic_score_codex":0.00057254767,"about_ca_topic_score_gemma":0.00044380868,"teacher_disagreement_score":0.010188049,"about_ca_system_score_codex":0.00082751986,"about_ca_system_score_gemma":0.00084865274,"threshold_uncertainty_score":0.034082413},"labels":[],"label_agreement":null},{"id":"W1889788879","doi":"10.1007/978-3-642-21043-3_11","title":"Learning Dialogue POMDP Models from Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","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":"Université Laval","funders":"","keywords":"Computer science; Partially observable Markov decision process; Artificial intelligence; Machine learning; Markov chain; Markov model","score_opus":0.05876410289242141,"score_gpt":0.24671100153610462,"score_spread":0.1879468986436832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889788879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022590706,0.0006924478,0.9710397,0.00050638424,0.00006492881,0.00010817635,0.0009219052,0.002759943,0.0013158196],"genre_scores_gemma":[0.54569083,0.0011665168,0.4403554,0.00033565756,0.00015282076,0.0007196842,0.006644356,0.00039166704,0.0045430795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936754,0.00020420736,0.000037374124,0.00023916965,0.00009369368,0.00005800112],"domain_scores_gemma":[0.9923332,0.0068621915,0.00013070021,0.00029987475,0.00024643133,0.00012764575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020423157,0.0015644304,0.0017057395,0.0010763874,0.0005633179,0.0018133526,0.0019389883,0.0016753833,0.0046865935],"category_scores_gemma":[0.010638017,0.0015237639,0.0016593672,0.0010889284,0.00078785967,0.0029925401,0.0022180523,0.0041423785,0.0018231092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005250155,0.00026979504,0.0029371998,0.00041010053,0.00020671723,0.0001816286,0.00035336765,0.5679106,0.0015297208,0.014607188,0.008735497,0.4023331],"study_design_scores_gemma":[0.000028919103,0.00002571071,0.00010858164,0.000022986414,0.000017694321,0.000014717394,0.00003432107,0.97745353,0.00041284223,0.021222454,0.000650361,0.00000785475],"about_ca_topic_score_codex":0.006423347,"about_ca_topic_score_gemma":0.008315366,"teacher_disagreement_score":0.006423347,"about_ca_system_score_codex":0.0012808284,"about_ca_system_score_gemma":0.0012839424,"threshold_uncertainty_score":0.015678227},"labels":[],"label_agreement":null},{"id":"W1889811593","doi":"10.1007/978-3-540-24855-2_67","title":"On Multi-class Classification by Way of Niching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Computer science; Population; Artificial intelligence; Classifier (UML); Machine learning; Class (philosophy); Niche; Context (archaeology); Data mining; Theoretical computer science","score_opus":0.021663388428801823,"score_gpt":0.25738467567569745,"score_spread":0.23572128724689562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889811593","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.010332779,0.00050357485,0.98434573,0.00023220234,0.0001605222,0.000086205,0.000026127223,0.00023822175,0.004074559],"genre_scores_gemma":[0.22231711,0.000371375,0.7680491,0.00039639202,0.00020909136,0.00034558366,0.000148226,0.00020338941,0.007959681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983851,0.000638951,0.000096636286,0.00031961966,0.00042561104,0.00013409379],"domain_scores_gemma":[0.9949013,0.0034075708,0.00016491029,0.000740552,0.0006569386,0.00012873368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003848007,0.00089688506,0.0019361592,0.0015734268,0.001201176,0.0013877982,0.004454842,0.0021045133,0.004118481],"category_scores_gemma":[0.010790541,0.00066107843,0.0015180954,0.0015671297,0.0019735808,0.0028592707,0.003003859,0.0023640944,0.00049162155],"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.00027853608,0.00017978075,0.0016742458,0.0002421204,0.00022853137,0.00009906281,0.0003202123,0.39553413,0.0031845376,0.13549459,0.0068345587,0.4559296],"study_design_scores_gemma":[0.000036457837,0.000044239783,0.00021600212,0.000029848472,0.00004118194,0.000066843095,0.000022688495,0.94551283,0.00079340226,0.051272348,0.0019489941,0.000015171125],"about_ca_topic_score_codex":0.0032076614,"about_ca_topic_score_gemma":0.0039403522,"teacher_disagreement_score":0.004454842,"about_ca_system_score_codex":0.0012855895,"about_ca_system_score_gemma":0.0007920646,"threshold_uncertainty_score":0.020350397},"labels":[],"label_agreement":null},{"id":"W1890585588","doi":"10.1007/11907503_9","title":"Toward Wide Area Interaction with Ubiquitous Computing Environments","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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 British Columbia","funders":"","keywords":"Ubiquitous computing; Computer science; Middleware (distributed applications); Interoperability; Software deployment; Context-aware pervasive systems; Human–computer interaction; Domain (mathematical analysis); World Wide Web; Software engineering; Distributed computing","score_opus":0.027618184779971685,"score_gpt":0.23659896199626546,"score_spread":0.20898077721629377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890585588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008277434,0.0032333112,0.9619967,0.00070192944,0.000168205,0.000059288934,0.000038239745,0.0024043953,0.023120577],"genre_scores_gemma":[0.15932754,0.0074591488,0.7880161,0.0006523683,0.00020066484,0.00020374032,0.00038346054,0.00047149765,0.0432855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923,0.00020210288,0.000036966743,0.00014673264,0.00029876333,0.00008541422],"domain_scores_gemma":[0.99960715,0.000090886875,0.000017352648,0.0001090398,0.00012431995,0.00005126619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009002554,0.00067111215,0.00053164747,0.0003824315,0.0005105007,0.0023906175,0.001629436,0.0013229979,0.008192841],"category_scores_gemma":[0.0016083936,0.00051355344,0.00037613304,0.0008160371,0.00058007817,0.004445667,0.0035742603,0.001459303,0.004210221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120966266,0.0001693601,0.00096930546,0.00033816582,0.000039101807,0.0001865514,0.001423948,0.00584617,0.038846962,0.1069607,0.019226214,0.8258725],"study_design_scores_gemma":[0.000046709963,0.00043010295,0.0018983094,0.0002444474,0.000119783406,0.0014889882,0.0020016616,0.21115026,0.039273333,0.17393179,0.56935257,0.000062023566],"about_ca_topic_score_codex":0.0009268903,"about_ca_topic_score_gemma":0.0020976749,"teacher_disagreement_score":0.008192841,"about_ca_system_score_codex":0.00023249233,"about_ca_system_score_gemma":0.00039628023,"threshold_uncertainty_score":0.027407765},"labels":[],"label_agreement":null},{"id":"W1890665645","doi":"10.1007/978-3-642-15470-6_22","title":"Perception of Parameter Variations in Linear Fractal Images","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Fractal; Perception; Computer science; Parametric statistics; Image (mathematics); Path (computing); Fractal analysis; Interface (matter); Artificial intelligence; Computer vision; Expression (computer science); Fractal dimension; Human–computer interaction; Computer graphics (images); Mathematics; Psychology; Mathematical analysis; Statistics","score_opus":0.015032150749180717,"score_gpt":0.25793273157015095,"score_spread":0.24290058082097024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890665645","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.91953856,0.0008903055,0.06966194,0.00016293263,0.00005914483,0.00002247695,0.00010505014,0.0003046192,0.0092549585],"genre_scores_gemma":[0.9911151,0.00029856182,0.0071769054,0.000030132314,0.000023433793,0.0000059178533,0.00006876201,0.000083089835,0.0011981019],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998909,0.000016584097,0.0000030701906,0.00002544228,0.00004805702,0.000015961965],"domain_scores_gemma":[0.9995617,0.00021188706,0.000049361603,0.00003748706,0.0000800329,0.000059514663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015308186,0.0002613632,0.00019647804,0.00040238473,0.00012821256,0.0010571636,0.00026017602,0.00038728095,0.0029210197],"category_scores_gemma":[0.0016542744,0.00018599276,0.00017196298,0.0002988133,0.0003634426,0.0010830046,0.00044148098,0.0004922947,0.00029286506],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011644823,0.000040505354,0.0016078472,0.00018724629,0.000026859278,0.000314821,0.0008444956,0.005723251,0.8870959,0.007226862,0.00096681603,0.09480093],"study_design_scores_gemma":[0.00025742772,0.0017390689,0.2094302,0.0002823346,0.00028229004,0.009513614,0.0038433901,0.3121567,0.39993382,0.048160385,0.014023233,0.00037749513],"about_ca_topic_score_codex":0.00036495485,"about_ca_topic_score_gemma":0.00015544175,"teacher_disagreement_score":0.0029210197,"about_ca_system_score_codex":0.00023794589,"about_ca_system_score_gemma":0.00009774867,"threshold_uncertainty_score":0.009771764},"labels":[],"label_agreement":null},{"id":"W1890759571","doi":"10.1007/978-3-642-38616-9_6","title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Lattice problem; Quantum algorithm; Quantum; Quantum computer; Cryptosystem; Time complexity; Computational complexity theory; Search algorithm","score_opus":0.027579807322433397,"score_gpt":0.25998263763789875,"score_spread":0.23240283031546535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890759571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14999133,0.0031458444,0.7658351,0.0042113876,0.00086435635,0.00019463176,0.0003576424,0.0024227062,0.07297695],"genre_scores_gemma":[0.34992534,0.0011434902,0.63162756,0.0004917759,0.00033569534,0.00017706,0.0004573998,0.00058528216,0.015256477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991872,0.0002526997,0.000042566364,0.00010161266,0.00032737033,0.000088725734],"domain_scores_gemma":[0.9989471,0.0006491041,0.00005351926,0.00020001632,0.00009793676,0.000052476593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081647316,0.00055247283,0.001231864,0.0006603697,0.00077357027,0.001829703,0.0012040696,0.001150796,0.010772396],"category_scores_gemma":[0.0031826922,0.00042764246,0.0008825206,0.0013166976,0.001105295,0.0049520633,0.0010980791,0.0026571732,0.0016984281],"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.00046801468,0.00036081695,0.00047915173,0.000640445,0.00012516884,0.00007471108,0.00031216815,0.13873655,0.016405,0.60165596,0.0229273,0.21781474],"study_design_scores_gemma":[0.00019161416,0.00008263943,0.00013810574,0.00004101923,0.00002357307,0.000056336503,0.00010687935,0.44350484,0.003985085,0.5420791,0.009764906,0.000025940046],"about_ca_topic_score_codex":0.0019618836,"about_ca_topic_score_gemma":0.0041020443,"teacher_disagreement_score":0.010772396,"about_ca_system_score_codex":0.0008517012,"about_ca_system_score_gemma":0.0016993823,"threshold_uncertainty_score":0.036037266},"labels":[],"label_agreement":null},{"id":"W189085582","doi":"10.1007/978-3-642-02611-9_57","title":"3D Shape from Focus and Depth Map Computation Using Steerable Filters","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Focus (optics); Artificial intelligence; Computer vision; Orientation (vector space); Computation; Filter (signal processing); Quadrature (astronomy); Noise (video); Image (mathematics); Pattern recognition (psychology); Algorithm; Mathematics; Optics; Geometry","score_opus":0.017803759639434653,"score_gpt":0.24768837373488364,"score_spread":0.229884614095449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189085582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010417085,0.00018879236,0.9855239,0.00004341992,0.000023640074,0.000022387223,0.000076725795,0.0011492403,0.0025548919],"genre_scores_gemma":[0.09949957,0.0004524779,0.89584106,0.000049291626,0.000029830066,0.00004017345,0.00028480546,0.00025482944,0.003547987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997321,0.000015660018,0.000007790282,0.00003136862,0.00018875423,0.000024357163],"domain_scores_gemma":[0.9997454,0.000073017334,0.000021026546,0.000047427267,0.00009309048,0.00002008582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020973106,0.0006589662,0.0006729612,0.0010718037,0.00025278953,0.0010684498,0.00077220367,0.0006927714,0.0048205904],"category_scores_gemma":[0.0007319381,0.00063487416,0.0007280431,0.0009181572,0.00025437967,0.0012403073,0.0011757447,0.0006568779,0.0018378926],"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.00023442441,0.000050772494,0.0005960906,0.00018100823,0.00005117276,0.00013420112,0.00020735091,0.02768762,0.21585943,0.01803045,0.0043182904,0.73264915],"study_design_scores_gemma":[0.000037561946,0.00015313782,0.0024566208,0.000044774006,0.000052755564,0.0010331338,0.00013486671,0.76076055,0.20022841,0.01449376,0.020515729,0.00008869862],"about_ca_topic_score_codex":0.0020915382,"about_ca_topic_score_gemma":0.0035692237,"teacher_disagreement_score":0.0048205904,"about_ca_system_score_codex":0.0003831725,"about_ca_system_score_gemma":0.00061354873,"threshold_uncertainty_score":0.016126454},"labels":[],"label_agreement":null},{"id":"W1890896788","doi":"10.1007/11527886_51","title":"Computer Adaptive Testing: Comparison of a Probabilistic Network Approach with Item Response Theory","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Polytechnique Montréal","funders":"","keywords":"Computerized adaptive testing; Computer science; Unix; Item response theory; Probabilistic logic; Bayesian network; Machine learning; Artificial intelligence; Test (biology); Bayesian probability; Programming language; Software; Statistics","score_opus":0.040285491985018046,"score_gpt":0.2561196021827327,"score_spread":0.21583411019771467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890896788","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.15940322,0.0022866444,0.82532036,0.0010993832,0.00025335007,0.0010860761,0.00035087668,0.0012909478,0.008909184],"genre_scores_gemma":[0.7268741,0.0015412958,0.26645374,0.0003840468,0.00024556293,0.0015448863,0.00053827115,0.0003334055,0.0020847365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9617966,0.032877643,0.0006303823,0.0015807326,0.0028140773,0.00030056614],"domain_scores_gemma":[0.6585871,0.3284989,0.0023242086,0.0050614993,0.004861651,0.0006666467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.039714027,0.001806718,0.002021757,0.0038343682,0.0006422049,0.002573874,0.0049419748,0.0027135075,0.0049831965],"category_scores_gemma":[0.15428203,0.0008545402,0.0013739975,0.0030879416,0.0018760285,0.008728031,0.003473304,0.0022355416,0.00081950205],"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.011162712,0.0021751635,0.031010693,0.0010214294,0.0021516425,0.0001593127,0.0015304027,0.220821,0.0010585126,0.04967939,0.0028729388,0.67635685],"study_design_scores_gemma":[0.00043299366,0.00122851,0.01092659,0.00008254102,0.00043086242,0.00015329446,0.00030501073,0.9354632,0.00054917013,0.04947059,0.00087385834,0.000083369865],"about_ca_topic_score_codex":0.006802662,"about_ca_topic_score_gemma":0.00534057,"teacher_disagreement_score":0.039714027,"about_ca_system_score_codex":0.0024280502,"about_ca_system_score_gemma":0.0012942171,"threshold_uncertainty_score":0.21003032},"labels":[],"label_agreement":null},{"id":"W1890977971","doi":"10.1007/978-3-540-71505-4_4","title":"Towards Neurocomputational Speech and Sound Processing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"Communications Research Centre Canada; Université de Sherbrooke","funders":"","keywords":"Computational auditory scene analysis; Computer science; Speech recognition; Auditory scene analysis; Segmentation; Auditory system; Coding (social sciences); Artificial neural network; Pattern recognition (psychology); Artificial intelligence; Perception; Psychology; Mathematics","score_opus":0.038897626711755555,"score_gpt":0.2818878271414316,"score_spread":0.24299020042967606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890977971","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010890593,0.0035628292,0.94447696,0.0013938084,0.00031893697,0.000026434438,0.0001308388,0.00064740545,0.03855227],"genre_scores_gemma":[0.20794189,0.00707276,0.7309993,0.0004031811,0.00045955714,0.000117690666,0.00045478457,0.0003963924,0.05215441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999138,0.000013211169,0.0000052970436,0.0000239788,0.000036722093,0.0000069888115],"domain_scores_gemma":[0.99984527,0.00008042382,0.000006814954,0.00002552876,0.000030451965,0.000011535468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024261675,0.0004767421,0.00044755425,0.0004159856,0.00032903723,0.0018566895,0.0012037738,0.0007130108,0.008108547],"category_scores_gemma":[0.00082412513,0.00037699495,0.0005082292,0.0005233021,0.0010347911,0.0022129326,0.0013030141,0.0011734471,0.0025987802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000425325,0.000030180834,0.00022203912,0.00025910043,0.000039044466,0.00006389856,0.00019331038,0.02403184,0.015952123,0.73829585,0.0062328107,0.21463726],"study_design_scores_gemma":[0.0000065165696,0.000017468907,0.00033223824,0.00004448772,0.000014497336,0.000082056664,0.00005944843,0.1195426,0.0067877313,0.83834296,0.034758363,0.00001167623],"about_ca_topic_score_codex":0.0006742518,"about_ca_topic_score_gemma":0.0010419561,"teacher_disagreement_score":0.008108547,"about_ca_system_score_codex":0.0004524726,"about_ca_system_score_gemma":0.00047369648,"threshold_uncertainty_score":0.027125835},"labels":[],"label_agreement":null},{"id":"W1891514807","doi":"10.1007/3-540-47887-6_4","title":"On Data Clustering Analysis: Scalability, Constraints, and Validation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":88,"is_retracted":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; Scalability; Data mining; Correlation clustering; Similarity (geometry); Consensus clustering; CURE data clustering algorithm; Artificial intelligence; Machine learning; Database","score_opus":0.050158553012031065,"score_gpt":0.31330475141825476,"score_spread":0.26314619840622366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891514807","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.015461093,0.0020902723,0.97208655,0.002543507,0.00017005546,0.000554643,0.0003631346,0.0028498396,0.0038808973],"genre_scores_gemma":[0.16109584,0.0013421993,0.8317899,0.0008916941,0.00041177895,0.0007241092,0.0010388279,0.0010372143,0.0016683635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9064413,0.05417688,0.006022006,0.006326301,0.02502504,0.0020085599],"domain_scores_gemma":[0.53571093,0.35108078,0.008944332,0.06862209,0.033270262,0.00237163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.09286975,0.0031803937,0.0049676797,0.0050252946,0.00366681,0.007899754,0.008711525,0.005999687,0.0036038307],"category_scores_gemma":[0.34986407,0.0026246533,0.003295851,0.009786966,0.00758834,0.021646535,0.01261559,0.007990186,0.0015152256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017671324,0.00060709164,0.01816363,0.0013019044,0.0007371357,0.00031021002,0.0009414972,0.25984362,0.005876109,0.10251893,0.019828446,0.58810437],"study_design_scores_gemma":[0.00010696717,0.00009245071,0.0012671915,0.0001977312,0.000091991446,0.00022607596,0.00015772686,0.88763446,0.0039791143,0.104467146,0.0017298401,0.000049378286],"about_ca_topic_score_codex":0.010055188,"about_ca_topic_score_gemma":0.0091021685,"teacher_disagreement_score":0.09286975,"about_ca_system_score_codex":0.004350682,"about_ca_system_score_gemma":0.008509657,"threshold_uncertainty_score":0.49114805},"labels":[],"label_agreement":null},{"id":"W1891529127","doi":"10.1007/978-3-319-14974-5_9","title":"Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Equilateral triangle; Mathematics; Dual graph; Pitteway triangulation; Discrete mathematics; Graph; Geometry; Line graph","score_opus":0.026570902929255697,"score_gpt":0.24799819547102006,"score_spread":0.22142729254176435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891529127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20482363,0.0014634359,0.6149057,0.0012874785,0.0003120902,0.00016300159,0.0008063937,0.00058435503,0.17565383],"genre_scores_gemma":[0.7197906,0.0025796029,0.20544824,0.0005922602,0.00037605874,0.00017222931,0.0012928648,0.0006604737,0.069087595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.000046479123,0.000017895594,0.00009873715,0.00017298841,0.00005295543],"domain_scores_gemma":[0.99743646,0.0011502454,0.0003078814,0.00039314802,0.00047785504,0.00023445264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033477513,0.0004651069,0.00059697684,0.0013050298,0.0010612716,0.002497658,0.0014251535,0.00096053135,0.013607178],"category_scores_gemma":[0.0036064426,0.0005387535,0.0005785848,0.0017428087,0.0013442521,0.0031009007,0.0012115539,0.002119938,0.0019236287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039506944,0.000037877646,0.00045002298,0.00012383837,0.000007765184,0.00009381927,0.00034117777,0.010990448,0.0021577622,0.9537001,0.004399547,0.02765818],"study_design_scores_gemma":[0.00001161116,0.000026051217,0.0003986091,0.000025463472,0.000012361335,0.0003803442,0.00021327767,0.049817484,0.0015792804,0.9325868,0.014934591,0.000014116684],"about_ca_topic_score_codex":0.0018944687,"about_ca_topic_score_gemma":0.002866773,"teacher_disagreement_score":0.013607178,"about_ca_system_score_codex":0.0010811095,"about_ca_system_score_gemma":0.00039540118,"threshold_uncertainty_score":0.045520544},"labels":[],"label_agreement":null},{"id":"W189169192","doi":"10.1007/978-3-642-32208-2_11","title":"Space and Energy Efficient Computation with DNA Strand Displacement Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"is_retracted":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":"Correctness; Computation; Computer science; Turing machine; Mathematical proof; Theoretical computer science; PSPACE; Turing; Algorithm; Energy (signal processing); Space (punctuation); Bounded function; Computational complexity theory; Mathematics; Physics; Programming language; Quantum mechanics; Geometry","score_opus":0.006473463274898307,"score_gpt":0.23224159075264683,"score_spread":0.22576812747774852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189169192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14586857,0.0032280586,0.7767638,0.0013115191,0.00044646236,0.000071896735,0.00023799496,0.00091192476,0.07115973],"genre_scores_gemma":[0.7966309,0.00086974027,0.18400317,0.00017380528,0.000090826026,0.0001524781,0.00021446128,0.00023915281,0.017625436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998702,0.000030453448,0.0000051554543,0.0000149876605,0.00005887419,0.000020307527],"domain_scores_gemma":[0.9997837,0.00013897772,0.000008528744,0.000032866265,0.0000228658,0.000012994441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019100666,0.00037470864,0.00046145057,0.00024545324,0.0004218961,0.0007100219,0.0008431331,0.0006231721,0.0060738535],"category_scores_gemma":[0.00088529947,0.0002502397,0.0002538525,0.0005762755,0.0005920821,0.00094711134,0.0008949844,0.0007747647,0.00063002814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002316745,0.00005861096,0.00022607524,0.00018672287,0.000029983094,0.000075932185,0.00014006959,0.5473939,0.014758384,0.33688566,0.0050030095,0.09500989],"study_design_scores_gemma":[0.000034198543,0.000026144098,0.000069406866,0.00000984195,0.0000049349446,0.000017646275,0.000018561588,0.8393533,0.0047875736,0.15065166,0.005015727,0.0000109545335],"about_ca_topic_score_codex":0.0007072682,"about_ca_topic_score_gemma":0.0009784913,"teacher_disagreement_score":0.0060738535,"about_ca_system_score_codex":0.00041847682,"about_ca_system_score_gemma":0.00029162268,"threshold_uncertainty_score":0.020319104},"labels":[],"label_agreement":null},{"id":"W1891967652","doi":"10.1007/978-3-642-00593-0_11","title":"Describing and Analyzing Behaviours over Tabular Specifications Using (Dyn)Alloy","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Notation; Programming language; Computation; Formalism (music); Theoretical computer science; Debugging; Class (philosophy); Artificial intelligence; Arithmetic; Mathematics","score_opus":0.08830630026189369,"score_gpt":0.29850024546882886,"score_spread":0.21019394520693518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891967652","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.05028763,0.00017764738,0.9404581,0.000085373795,0.000024848081,0.00012322795,0.0003043726,0.003938223,0.004600514],"genre_scores_gemma":[0.34739557,0.00041519702,0.64349467,0.00009402447,0.0000137278885,0.0001799291,0.0009585504,0.0018995277,0.005548791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982157,0.0004528261,0.00015933711,0.00018724558,0.0007561016,0.00022885735],"domain_scores_gemma":[0.9966775,0.0021527666,0.0002828502,0.0004612661,0.00038457653,0.000040934345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017841052,0.00096134935,0.0005814717,0.0010714807,0.0007456871,0.0023617786,0.0014393965,0.0009656174,0.004068588],"category_scores_gemma":[0.004741704,0.0011110986,0.0017476636,0.0011788611,0.0018147064,0.0027596832,0.0015411371,0.0013095895,0.0009339027],"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.0004558445,0.00017590416,0.006332934,0.0017201997,0.00018085008,0.0015624315,0.0035781863,0.33445477,0.07594323,0.38164923,0.0029756972,0.1909707],"study_design_scores_gemma":[0.00007279598,0.0001252874,0.00079295394,0.00019533117,0.00015402562,0.0005882946,0.0009035222,0.7183545,0.089364745,0.17165485,0.017701367,0.0000923313],"about_ca_topic_score_codex":0.0050706947,"about_ca_topic_score_gemma":0.008800758,"teacher_disagreement_score":0.0050706947,"about_ca_system_score_codex":0.000904595,"about_ca_system_score_gemma":0.0013423043,"threshold_uncertainty_score":0.01361078},"labels":[],"label_agreement":null},{"id":"W189254053","doi":"10.1007/978-3-319-13039-2_25","title":"A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":92,"is_retracted":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":"Isogeny; Supersingular elliptic curve; Quantum algorithm; Quantum computer; Elliptic curve; Finite field; Field (mathematics); Computer science; Quantum; Cryptography; Base (topology); Schoof's algorithm; Algorithm; Post-quantum cryptography; Mathematics; Discrete mathematics; Pure mathematics; Physics; Quantum mechanics; Mathematical analysis; Quarter period","score_opus":0.017317190295271317,"score_gpt":0.24719921451019622,"score_spread":0.2298820242149249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189254053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06570797,0.00065310986,0.910776,0.0006302491,0.00034558866,0.00017884819,0.00022566419,0.0022637364,0.019218896],"genre_scores_gemma":[0.3790936,0.00041454352,0.6051945,0.000271127,0.00022281954,0.00022968222,0.0006099375,0.00037300115,0.0135907885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988778,0.00018701433,0.000079095524,0.00025254532,0.00045934523,0.00014420193],"domain_scores_gemma":[0.9989312,0.00034619062,0.000067412606,0.00036487944,0.00021090472,0.00007935688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079990976,0.0009789566,0.0012580857,0.0014284776,0.001620991,0.0027462689,0.001783977,0.001662788,0.010354486],"category_scores_gemma":[0.0026141452,0.00056641205,0.00091824564,0.002302303,0.0016598627,0.0044195135,0.0033329749,0.0019686157,0.0026028648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005944036,0.00023290757,0.0009764374,0.0002577543,0.000107238375,0.0001439902,0.00040960917,0.02188175,0.019653428,0.48754928,0.011877736,0.45631558],"study_design_scores_gemma":[0.0002616438,0.00022781141,0.0006633083,0.000075525,0.0000776578,0.00024166524,0.00022831929,0.20302439,0.01721979,0.7605177,0.017372578,0.000089447276],"about_ca_topic_score_codex":0.0010662611,"about_ca_topic_score_gemma":0.001822136,"teacher_disagreement_score":0.010354486,"about_ca_system_score_codex":0.0013110616,"about_ca_system_score_gemma":0.0013767522,"threshold_uncertainty_score":0.03463924},"labels":[],"label_agreement":null},{"id":"W1892621731","doi":"10.1007/bfb0022520","title":"Approaches to concurrency in B-trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Concurrency; Computer science; B-tree; Programming language; Data structure","score_opus":0.11238077120144688,"score_gpt":0.30320272249385194,"score_spread":0.19082195129240506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892621731","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.011995762,0.007497273,0.83115214,0.0022728737,0.0006371697,0.000066473134,0.00013662771,0.0004910992,0.14575057],"genre_scores_gemma":[0.4435366,0.01010058,0.42907205,0.0013495564,0.001236404,0.00041090997,0.0004533224,0.0008139541,0.11302662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989876,0.00028745865,0.000069301524,0.0001798234,0.0003266675,0.00014910926],"domain_scores_gemma":[0.997928,0.0011225775,0.00008309343,0.00045359338,0.00019901544,0.00021370838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012062743,0.00075237214,0.00091392716,0.0015032478,0.002905819,0.0051338165,0.0025677178,0.0016745245,0.0122767035],"category_scores_gemma":[0.0031567104,0.001101746,0.0012893681,0.003414252,0.0053178845,0.011547803,0.0035689962,0.005841592,0.0025759486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043649434,0.0000050234253,0.000024283694,0.00002032329,0.0000018779656,0.0000141222135,0.0001555259,0.00036926634,0.000158705,0.9937164,0.00081619434,0.0047140317],"study_design_scores_gemma":[0.0000032967428,0.000002240311,0.000014219081,0.000014931328,0.000002751452,0.0000363946,0.000051523624,0.0013707763,0.00012596442,0.98598874,0.012385563,0.0000034927834],"about_ca_topic_score_codex":0.0021952332,"about_ca_topic_score_gemma":0.002616934,"teacher_disagreement_score":0.0122767035,"about_ca_system_score_codex":0.0018756721,"about_ca_system_score_gemma":0.0010293027,"threshold_uncertainty_score":0.041069686},"labels":[],"label_agreement":null},{"id":"W189307353","doi":"10.1007/978-3-540-87989-3_10","title":"An Evolutionary Study of the Human Papillomavirus Genomes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cervical Cancer and HPV Research","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Genome; Computer science; Human papillomavirus; Clade; Human genome; Sequence (biology); Monophyly; Computational biology; Sliding window protocol; Biology; Genetics; Phylogenetics; Gene; Window (computing); Medicine","score_opus":0.04402736724995925,"score_gpt":0.33415675203948525,"score_spread":0.290129384789526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189307353","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.6864397,0.04224526,0.16035888,0.004747402,0.00037242155,0.00009445108,0.0010792379,0.00021701706,0.10444571],"genre_scores_gemma":[0.87198436,0.019038333,0.08785317,0.00039443374,0.00016785845,0.00004001409,0.0010360398,0.00012396065,0.019361915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9998572,0.0000509682,0.0000052528985,0.000037529844,0.00002982075,0.000019262172],"domain_scores_gemma":[0.9994721,0.0003828449,0.000028710163,0.000039444676,0.000047329504,0.000029618413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034093892,0.00020250541,0.00021985147,0.00101444,0.00059763977,0.0007506498,0.0005018079,0.0004375953,0.0037462497],"category_scores_gemma":[0.0016257926,0.00020214988,0.0004509851,0.0017301819,0.0005345846,0.0012858919,0.00039575415,0.0008144974,0.00025285606],"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.00028436954,0.00012732379,0.017161598,0.0006663406,0.00019159036,0.0011651359,0.0030738548,0.036327016,0.043386713,0.45344362,0.0071853,0.4369872],"study_design_scores_gemma":[0.000034381814,0.00033596717,0.08454376,0.00035897846,0.00017210247,0.0043933806,0.0030294717,0.07198123,0.016595226,0.6422984,0.1761767,0.00008032642],"about_ca_topic_score_codex":0.001475716,"about_ca_topic_score_gemma":0.0018711345,"teacher_disagreement_score":0.0037462497,"about_ca_system_score_codex":0.00059500855,"about_ca_system_score_gemma":0.00022514827,"threshold_uncertainty_score":0.012532413},"labels":[],"label_agreement":null},{"id":"W189364156","doi":"10.1007/978-3-642-30885-7_7","title":"Modeling the Supervisory Control Theory with Alloy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Supervisory control; Representation (politics); Context (archaeology); Heuristic; Theoretical computer science; State space; Computation; Control (management); Artificial intelligence; Programming language; Mathematics","score_opus":0.027736908013739906,"score_gpt":0.22654488696945363,"score_spread":0.19880797895571373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189364156","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.011877181,0.0014613327,0.94665617,0.00034828766,0.00018871405,0.00004856433,0.00014636305,0.0006618882,0.03861154],"genre_scores_gemma":[0.5453146,0.003148793,0.4105663,0.00026583276,0.00022652064,0.00026199594,0.0005399308,0.00031877804,0.03935718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957794,0.0000778063,0.000032355616,0.000069964684,0.00019652159,0.000045397992],"domain_scores_gemma":[0.9997843,0.00007575422,0.000026574893,0.000050742317,0.000050893523,0.000011734156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004883689,0.00065507233,0.0006506556,0.00063718937,0.00050458504,0.0018476967,0.0015817905,0.00075505365,0.0040846504],"category_scores_gemma":[0.00069863437,0.0005390466,0.0010228046,0.00059052213,0.0015701714,0.0016544014,0.00090117153,0.0011095394,0.0011020425],"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.00003882179,0.000016136155,0.0001264752,0.000108936256,0.000019724233,0.00009215336,0.00013653038,0.0851635,0.0036067509,0.8874228,0.0010841934,0.022183906],"study_design_scores_gemma":[0.000026646429,0.000047661582,0.00009582525,0.000059033122,0.00003240306,0.00008136306,0.000050962924,0.30619252,0.004399228,0.6621487,0.026847323,0.00001832205],"about_ca_topic_score_codex":0.0027194407,"about_ca_topic_score_gemma":0.0024727138,"teacher_disagreement_score":0.0040846504,"about_ca_system_score_codex":0.0009058547,"about_ca_system_score_gemma":0.0010187174,"threshold_uncertainty_score":0.013664484},"labels":[],"label_agreement":null},{"id":"W1893729795","doi":"10.1007/978-3-540-72530-5_9","title":"A Rough-Hybrid Approach to Software Defect Classification","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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 Winnipeg","funders":"","keywords":"Computer science; Rough set; Data mining; Decision tree; Software; Fuzzy logic; Artificial intelligence; Dominance-based rough set approach; Knowledge extraction; Machine learning; Fuzzy set","score_opus":0.04320667514004044,"score_gpt":0.2811904742937011,"score_spread":0.23798379915366064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893729795","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.007006812,0.00043634034,0.99115705,0.00011177296,0.000036089066,0.000042498334,0.000070789676,0.00027453006,0.0008642089],"genre_scores_gemma":[0.15149903,0.00049238506,0.84327364,0.00013694468,0.0001572767,0.0001791182,0.00039263663,0.0001026928,0.0037662557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960598,0.0010957257,0.00025948862,0.0003693989,0.002063355,0.00015229329],"domain_scores_gemma":[0.9944992,0.003296628,0.00021845673,0.0006391926,0.0012380253,0.00010841012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031049203,0.000832985,0.002062406,0.004081918,0.0007590587,0.0023801292,0.0026596298,0.0012016388,0.002092462],"category_scores_gemma":[0.006532843,0.0006850691,0.00191837,0.0030902426,0.0009703125,0.002328984,0.0015446983,0.0016062366,0.00069337146],"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.0002745056,0.0004048211,0.0028654176,0.0004606478,0.0005424182,0.00026088764,0.00029557158,0.20389618,0.009746861,0.053517148,0.0071767615,0.7205587],"study_design_scores_gemma":[0.000019301864,0.00012135402,0.0012953883,0.000035516863,0.00011301638,0.00019812779,0.00007116395,0.9428521,0.0019812977,0.050511584,0.0027562566,0.000044894397],"about_ca_topic_score_codex":0.0023598694,"about_ca_topic_score_gemma":0.0032835025,"teacher_disagreement_score":0.004081918,"about_ca_system_score_codex":0.0007876768,"about_ca_system_score_gemma":0.00084034586,"threshold_uncertainty_score":0.016420603},"labels":[],"label_agreement":null},{"id":"W1894891660","doi":"10.1007/978-3-642-28332-1_42","title":"k-Automatic Sets of Rational Numbers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Closure (psychology); Computer science; Set (abstract data type); Rational number; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.013988133444734424,"score_gpt":0.24152889745235093,"score_spread":0.2275407640076165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894891660","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.18251751,0.0038449708,0.12057608,0.0014254327,0.0011528984,0.00010619057,0.0007042999,0.0008143103,0.6888584],"genre_scores_gemma":[0.88774174,0.0018499829,0.034028374,0.00031796552,0.0005777286,0.0001858976,0.0007216369,0.00026829034,0.074308395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.000115869305,0.000052971933,0.00015196115,0.00026396854,0.00011610834],"domain_scores_gemma":[0.9991172,0.00042750983,0.000068769434,0.00014977469,0.00015784487,0.00007900997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039711164,0.0005610056,0.0005353157,0.0016063161,0.0018352029,0.0038352697,0.0010511195,0.0007366812,0.009183839],"category_scores_gemma":[0.0016743173,0.000619471,0.00090835936,0.0010587429,0.0029963057,0.004266502,0.001980826,0.001854119,0.0027119736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023734621,0.000008255862,0.00008706954,0.00005550079,0.0000054071957,0.000051772353,0.0002908935,0.00034162635,0.0011310095,0.9900525,0.0013214856,0.0066307015],"study_design_scores_gemma":[0.000011642732,0.000011943522,0.0002708487,0.000027873955,0.000007227207,0.00018421971,0.00012277297,0.0012238469,0.001052892,0.9813787,0.015692154,0.0000158086],"about_ca_topic_score_codex":0.00038442857,"about_ca_topic_score_gemma":0.00043937797,"teacher_disagreement_score":0.009183839,"about_ca_system_score_codex":0.0011985428,"about_ca_system_score_gemma":0.0005481121,"threshold_uncertainty_score":0.030723035},"labels":[],"label_agreement":null},{"id":"W1894973801","doi":"10.1007/978-3-540-75975-1_9","title":"Recovering Business Rules from Legacy Source Code for System Modernization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"National Research Council Canada","funders":"","keywords":"Legacy system; Semantics of Business Vocabulary and Business Rules; Business rule; Source code; Computer science; Modernization theory; Software engineering; Documentation; Legacy code; Reverse engineering; Code (set theory); Business logic; KPI-driven code analysis; Business process; Programming language; Engineering; Static program analysis; Software development; Set (abstract data type); Operations management; Software; Work in process; Political science; Law","score_opus":0.029155691322831374,"score_gpt":0.26073486195172746,"score_spread":0.23157917062889607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894973801","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.15585981,0.0012582146,0.7735848,0.0013282243,0.0002913259,0.00030929016,0.002145929,0.05646004,0.008762381],"genre_scores_gemma":[0.3937428,0.00092430494,0.5872751,0.00026516238,0.00008930739,0.00011390497,0.0052541452,0.0053395815,0.0069957124],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980659,0.0002525064,0.000114967625,0.00030300365,0.0010835471,0.00018013854],"domain_scores_gemma":[0.9898699,0.0027817278,0.00078591186,0.0048391577,0.0016064927,0.00011684691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013923985,0.0012472229,0.00084008207,0.0030134604,0.0006021805,0.0019916801,0.0018782966,0.0012188596,0.0031730898],"category_scores_gemma":[0.01362543,0.0012187196,0.0015397246,0.002007352,0.00083198113,0.003179821,0.001967872,0.0027789369,0.0023420637],"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.00027947777,0.00031207685,0.010082047,0.0004264865,0.0001956413,0.000847577,0.00042545708,0.05331551,0.03991566,0.0101296725,0.017170483,0.8668998],"study_design_scores_gemma":[0.000062271574,0.00013230616,0.0057972935,0.00013431984,0.0002505415,0.00074329757,0.0002848669,0.80412465,0.1213982,0.04098166,0.026002074,0.0000885837],"about_ca_topic_score_codex":0.002693932,"about_ca_topic_score_gemma":0.004806606,"teacher_disagreement_score":0.0031730898,"about_ca_system_score_codex":0.0007214239,"about_ca_system_score_gemma":0.0019114099,"threshold_uncertainty_score":0.010614991},"labels":[],"label_agreement":null},{"id":"W1895520507","doi":"10.1007/978-3-642-32208-2_4","title":"Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Reachability; Computer science; Sequence (biology); Displacement (psychology); Algorithm; Theoretical computer science; Chemistry","score_opus":0.01049084421419576,"score_gpt":0.2608141058688969,"score_spread":0.25032326165470115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895520507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026599573,0.0052439063,0.8975876,0.0019057859,0.0002562491,0.00012735544,0.0010957036,0.00096620095,0.066217646],"genre_scores_gemma":[0.6970424,0.00953551,0.24292879,0.0011213305,0.00077201653,0.001047529,0.0034440376,0.0008770223,0.043231282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997973,0.00038393488,0.00011251328,0.00046807132,0.0007827537,0.00027959363],"domain_scores_gemma":[0.9912219,0.00722995,0.00037827043,0.00040970102,0.0005368689,0.0002233906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974848,0.0022245445,0.0014870748,0.002537565,0.0013280343,0.0036034351,0.002858454,0.0020424684,0.01276427],"category_scores_gemma":[0.008276673,0.001154219,0.0022794302,0.002564792,0.002997166,0.0071710474,0.0032375816,0.005829674,0.0014775399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017031233,0.00007658414,0.00025727114,0.00043498987,0.00007178466,0.00011750412,0.00022449796,0.1913353,0.0024695802,0.76232564,0.00438467,0.03813182],"study_design_scores_gemma":[0.000014194408,0.000019972358,0.00009468792,0.000047920752,0.000032307136,0.00003655244,0.000028670536,0.18110129,0.0009232651,0.81475157,0.0029324843,0.000017158633],"about_ca_topic_score_codex":0.0046964483,"about_ca_topic_score_gemma":0.004726332,"teacher_disagreement_score":0.01276427,"about_ca_system_score_codex":0.0035713082,"about_ca_system_score_gemma":0.0016623084,"threshold_uncertainty_score":0.042700768},"labels":[],"label_agreement":null},{"id":"W1896373471","doi":"10.1007/978-3-540-74591-4_10","title":"Verification of Expectation Properties for Discrete Random Variables in HOL","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Concordia University","funders":"","keywords":"HOL; Random variable; Computer science; Probabilistic logic; Sum of normally distributed random variables; Probability distribution; Mathematics; Expected value; Discrete mathematics; Multivariate random variable; Algorithm; Applied mathematics; Artificial intelligence; Statistics","score_opus":0.037799844185619866,"score_gpt":0.2607793551179019,"score_spread":0.22297951093228202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896373471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04794977,0.00013666828,0.94180477,0.0010931967,0.00013607251,0.00013175326,0.0003528803,0.0025181617,0.005876727],"genre_scores_gemma":[0.9146766,0.00014224919,0.07989396,0.00045695153,0.00015657711,0.00016041684,0.0005534637,0.00052703376,0.0034327332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98983216,0.0034511073,0.0007527132,0.001643967,0.0028809602,0.0014391358],"domain_scores_gemma":[0.9375631,0.050474424,0.0021555878,0.0066241664,0.00235482,0.0008278451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080679,0.0007991997,0.0016254167,0.0008566056,0.0011197056,0.0041603353,0.0030399328,0.0016156551,0.0061019156],"category_scores_gemma":[0.040729083,0.0010011733,0.0030569402,0.0008771298,0.0048114695,0.009272424,0.005092012,0.0045731133,0.0007848914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062559417,0.00016943405,0.0023377293,0.00033207252,0.00013220792,0.00059388974,0.00055092206,0.04521899,0.005415918,0.9163945,0.0029610572,0.0252677],"study_design_scores_gemma":[0.00014812541,0.00007363054,0.00048511097,0.000046441208,0.000050079485,0.00014307084,0.00010620771,0.22890592,0.009719297,0.75863296,0.0016467139,0.000042501906],"about_ca_topic_score_codex":0.0016183872,"about_ca_topic_score_gemma":0.0021589017,"teacher_disagreement_score":0.0080679,"about_ca_system_score_codex":0.0021261019,"about_ca_system_score_gemma":0.0025085302,"threshold_uncertainty_score":0.042667687},"labels":[],"label_agreement":null},{"id":"W189728362","doi":"10.1007/978-3-642-40988-2_16","title":"Greedy Confidence Pursuit: A Pragmatic Approach to Multi-bandit Optimization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Computer science; Greedy algorithm; Selection (genetic algorithm); Set (abstract data type); Thompson sampling; Mathematical optimization; Baseline (sea); Artificial intelligence; Machine learning; Algorithm; Bayesian probability; Mathematics","score_opus":0.08883393490227826,"score_gpt":0.3708055884183275,"score_spread":0.28197165351604925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189728362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000675179,0.00017714742,0.99449027,0.00035466976,0.00004858957,0.00001529875,0.000017285585,0.000072256014,0.0041493834],"genre_scores_gemma":[0.13127643,0.0010264545,0.85089874,0.0006852577,0.00043295434,0.0003354761,0.00010712223,0.0003750837,0.0148624955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976822,0.0012636094,0.000082009035,0.00017481166,0.0006956887,0.000101684345],"domain_scores_gemma":[0.9969266,0.0022846276,0.00012981692,0.0002536672,0.00030823596,0.00009708857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003563872,0.001316448,0.0015534748,0.0007855278,0.00087191095,0.0032799528,0.0022209033,0.0025485002,0.0055746413],"category_scores_gemma":[0.01357139,0.0008795086,0.00107754,0.0017501567,0.002710705,0.0023804484,0.0044282856,0.0040170182,0.0014854982],"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.000080943304,0.000035842204,0.00015000654,0.00014250362,0.000050071303,0.00007559236,0.00011768277,0.08271133,0.0014186287,0.8536153,0.0066309855,0.05497118],"study_design_scores_gemma":[0.000023776605,0.00003038097,0.00004950586,0.000035221507,0.000015315605,0.000045673743,0.000021371117,0.49872598,0.0005445367,0.4950497,0.0054380912,0.000020449212],"about_ca_topic_score_codex":0.0010290336,"about_ca_topic_score_gemma":0.0012802857,"teacher_disagreement_score":0.0055746413,"about_ca_system_score_codex":0.0010811482,"about_ca_system_score_gemma":0.001445179,"threshold_uncertainty_score":0.018847764},"labels":[],"label_agreement":null},{"id":"W1899004660","doi":"10.1007/978-3-642-13595-8_22","title":"Precise Specification of Design Pattern Structure and Behaviour","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Trinity College","funders":"","keywords":"Computer science; Programming language; Unified Modeling Language; Sequence diagram; Semantics (computer science); Class diagram; Software design pattern; Specification pattern; Syntax; Formal semantics (linguistics); Formal specification; Object Constraint Language; Software design; Software; Software development; Applications of UML; Artificial intelligence","score_opus":0.018365295089721307,"score_gpt":0.231699447711284,"score_spread":0.2133341526215627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899004660","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.0022307152,0.000052464373,0.99504566,0.00007350228,0.000029704684,0.000092157345,0.0001026382,0.0010072159,0.0013659999],"genre_scores_gemma":[0.10799582,0.0003497766,0.88546926,0.00021288916,0.00004291832,0.00055629836,0.00071561243,0.0010172324,0.003640236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99150205,0.0016755259,0.0012043618,0.00081352587,0.004207747,0.00059668755],"domain_scores_gemma":[0.98870057,0.0031238024,0.00076654204,0.0056158053,0.0016589139,0.00013432789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005906652,0.0017785982,0.0015746129,0.0014873312,0.00076648046,0.0036471859,0.002741234,0.0025457735,0.003788973],"category_scores_gemma":[0.017745223,0.0026885364,0.002141649,0.0012206691,0.0022048792,0.0047135083,0.0028603547,0.005221815,0.0025342698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019236832,0.00021127949,0.0017508111,0.0014128861,0.0001657324,0.00066835916,0.0011132135,0.1049633,0.07895802,0.5592422,0.007882513,0.24343938],"study_design_scores_gemma":[0.00017192854,0.00019516924,0.0009541384,0.0004791541,0.00029131578,0.0010606751,0.00021568021,0.35808086,0.13081451,0.44015706,0.067450106,0.00012935426],"about_ca_topic_score_codex":0.0014286075,"about_ca_topic_score_gemma":0.0023262515,"teacher_disagreement_score":0.005906652,"about_ca_system_score_codex":0.001011328,"about_ca_system_score_gemma":0.0033740443,"threshold_uncertainty_score":0.031237781},"labels":[],"label_agreement":null},{"id":"W18994745","doi":"10.1007/978-3-642-40763-5_6","title":"Random Walks with Efficient Search and Contextually Adapted Image Similarity for Deformable Registration","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Weighting; Probabilistic logic; Image registration; Random walk; Similarity (geometry); Image (mathematics); Pattern recognition (psychology); Computer vision; Data mining; Mathematics","score_opus":0.014048926270726639,"score_gpt":0.2701784047828632,"score_spread":0.2561294785121366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18994745","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.017507276,0.00019835617,0.9811266,0.00006342946,0.00002391383,0.00003580034,0.00003845761,0.00053954415,0.0004665978],"genre_scores_gemma":[0.3981682,0.00025005525,0.5969185,0.00012598364,0.00007848342,0.00020766696,0.0004569765,0.00050704204,0.003287179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897814,0.00034619315,0.000062779945,0.0002305185,0.0003023135,0.000080074096],"domain_scores_gemma":[0.9982152,0.0009113154,0.00018238451,0.00037679318,0.0002108022,0.00010361101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009420153,0.0006872978,0.0015668992,0.0017346028,0.0005389341,0.00075232657,0.0018410786,0.001986368,0.0022353448],"category_scores_gemma":[0.0055684117,0.0007306085,0.0010142733,0.002145989,0.0009633422,0.0019292267,0.002487462,0.0012141597,0.0009140896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000571554,0.00033392943,0.0011565083,0.00018429547,0.00014466883,0.00022050118,0.0001480144,0.6316963,0.02789555,0.06485082,0.0040297443,0.2687681],"study_design_scores_gemma":[0.000015499552,0.000033479704,0.000092956434,0.0000030205445,0.0000063241423,0.000037349448,0.0000059327044,0.98835725,0.0011318716,0.009989777,0.0003172291,0.000009260511],"about_ca_topic_score_codex":0.0028334402,"about_ca_topic_score_gemma":0.0052824863,"teacher_disagreement_score":0.0028334402,"about_ca_system_score_codex":0.00052211306,"about_ca_system_score_gemma":0.0007967887,"threshold_uncertainty_score":0.0074779987},"labels":[],"label_agreement":null},{"id":"W190049315","doi":"10.1007/978-3-642-30353-1_6","title":"Mining Top-K Association Rules","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":80,"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 Moncton","funders":"","keywords":"Association rule learning; Computer science; Data mining; Scalability; Task (project management); Set (abstract data type); Association (psychology); Algorithm; Database","score_opus":0.018313512452441,"score_gpt":0.25095015021367056,"score_spread":0.23263663776122956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190049315","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.18790185,0.014673414,0.75040436,0.0024858946,0.0015452628,0.0010000925,0.018931476,0.0077487538,0.015308897],"genre_scores_gemma":[0.3142402,0.00620406,0.626182,0.0007059005,0.0006628685,0.00041041014,0.041165404,0.00042606975,0.0100030145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963973,0.00035641133,0.0006866225,0.0009695917,0.0013529017,0.00023713872],"domain_scores_gemma":[0.9930346,0.0036087104,0.0006402029,0.0010518951,0.0014045687,0.00026003848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019309372,0.0018176076,0.002459634,0.0070381295,0.0019287034,0.0042828056,0.0036377923,0.001849336,0.0041359845],"category_scores_gemma":[0.013546433,0.0012028001,0.0033022482,0.0072211833,0.00063279486,0.005011404,0.0020117604,0.0023781531,0.0068119727],"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.0006646999,0.0007750243,0.040166516,0.0017740559,0.0011287845,0.0032398175,0.0003686707,0.013132849,0.010843454,0.0056060716,0.03331873,0.8889814],"study_design_scores_gemma":[0.00035655315,0.0011576691,0.040816985,0.0019209494,0.004176087,0.023545608,0.002223778,0.60802466,0.046455894,0.17650945,0.09444804,0.00036437626],"about_ca_topic_score_codex":0.0015270791,"about_ca_topic_score_gemma":0.0038134106,"teacher_disagreement_score":0.0070381295,"about_ca_system_score_codex":0.00047654405,"about_ca_system_score_gemma":0.0020921612,"threshold_uncertainty_score":0.013836265},"labels":[],"label_agreement":null},{"id":"W1901467827","doi":"10.1007/978-3-319-23528-8_30","title":"An Empirical Investigation of Minimum Probability Flow Learning Under Different Connectivity Patterns","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Guelph","funders":"","keywords":"Computer science; Boltzmann machine; Divergence (linguistics); Partition function (quantum field theory); Artificial intelligence; Importance sampling; Gibbs sampling; Artificial neural network; Function (biology); Sampling (signal processing); Restricted Boltzmann machine; Machine learning; Partition (number theory); Focus (optics); Theoretical computer science; Monte Carlo method; Mathematics; Statistics; Bayesian probability","score_opus":0.04715265720020493,"score_gpt":0.2759495844214585,"score_spread":0.22879692722125358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901467827","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.88565016,0.0015033768,0.10414126,0.0023287807,0.000058345046,0.00011178552,0.0010642471,0.0003328882,0.004809156],"genre_scores_gemma":[0.9888455,0.00030788887,0.008419702,0.00009935547,0.000055605313,0.000061269886,0.0010181357,0.00006665069,0.0011258596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893266,0.00054024335,0.000041196927,0.0002632509,0.000114186594,0.000108450266],"domain_scores_gemma":[0.88455546,0.104099885,0.0038271544,0.004516552,0.00178406,0.0012168657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066383136,0.00046083474,0.0008479628,0.0012098063,0.000672079,0.0014112641,0.0020408516,0.0020052467,0.005842605],"category_scores_gemma":[0.09437523,0.00040869947,0.00061410863,0.001020547,0.0023409207,0.005268004,0.0012946534,0.002974259,0.0003448907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024602101,0.001152998,0.056513887,0.0008883521,0.0003595785,0.00046328522,0.0006214269,0.6147462,0.0035200773,0.18826385,0.021594848,0.10941525],"study_design_scores_gemma":[0.00011659622,0.00024526392,0.012192826,0.00008190178,0.00007017687,0.0003103086,0.00018112452,0.8749678,0.0011945114,0.109568045,0.0010256545,0.00004580768],"about_ca_topic_score_codex":0.0017019438,"about_ca_topic_score_gemma":0.0015937317,"teacher_disagreement_score":0.0066383136,"about_ca_system_score_codex":0.0013691076,"about_ca_system_score_gemma":0.0005436694,"threshold_uncertainty_score":0.035107195},"labels":[],"label_agreement":null},{"id":"W1901581672","doi":"10.1007/978-3-642-33418-4_66","title":"Global Assessment of Cardiac Function Using Image Statistics in MRI","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CARE Canada; Robarts Clinical Trials; Western University","funders":"","keywords":"Bhattacharyya distance; Segmentation; Artificial intelligence; Computer science; Statistic; Pattern recognition (psychology); Similarity (geometry); Artificial neural network; Image (mathematics); Image segmentation; Statistics; Mathematics","score_opus":0.01658878769330017,"score_gpt":0.337025060007555,"score_spread":0.3204362723142548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901581672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31689164,0.002065456,0.6774477,0.0001785034,0.000042624175,0.000060787886,0.0005803771,0.0011698086,0.0015631256],"genre_scores_gemma":[0.8896653,0.0013780514,0.106951356,0.000053416854,0.00010785233,0.000046648223,0.0005868717,0.00023934933,0.00097110524],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996049,0.00012494963,0.000037017096,0.00007967279,0.00011891731,0.000034574874],"domain_scores_gemma":[0.9985291,0.00076576474,0.00023471909,0.00012690978,0.0002612452,0.00008220758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013248791,0.0006224817,0.0008796188,0.0022428392,0.00018583162,0.0011226855,0.00032883123,0.00050646067,0.0005267682],"category_scores_gemma":[0.0032117714,0.0002562609,0.0005221193,0.0014912417,0.00042616602,0.00087212445,0.00048722068,0.00047095594,0.00031564297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011052073,0.00025789283,0.07790993,0.0003783552,0.00044486873,0.00049108936,0.00028013016,0.10521109,0.2194134,0.0032773237,0.0016880514,0.5895426],"study_design_scores_gemma":[0.000028676548,0.0009121602,0.19710329,0.00008084478,0.00045568988,0.0018834856,0.0002818302,0.6865922,0.10210495,0.00814276,0.0022911967,0.0001228574],"about_ca_topic_score_codex":0.0013907254,"about_ca_topic_score_gemma":0.002060154,"teacher_disagreement_score":0.0022428392,"about_ca_system_score_codex":0.00020235602,"about_ca_system_score_gemma":0.00044803406,"threshold_uncertainty_score":0.007006705},"labels":[],"label_agreement":null},{"id":"W1901651598","doi":"10.1007/978-3-319-02297-0_28","title":"Applications of Symbolic Calculations and Polynomial Invariants to the Classification of Singularities of Differential Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","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":"Université de Montréal","funders":"","keywords":"Gravitational singularity; Quadratic differential; Mathematics; Polynomial; Singularity; Pure mathematics; Bifurcation diagram; Singularity theory; Bifurcation; Invariant theory; Quadratic equation; Algebra over a field; Mathematical analysis; Geometry; Nonlinear system","score_opus":0.029975154347967263,"score_gpt":0.2792647954516076,"score_spread":0.24928964110364032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901651598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10215594,0.026264044,0.6411831,0.004178509,0.0015724573,0.00010726381,0.0003037943,0.00072850555,0.22350632],"genre_scores_gemma":[0.7617543,0.015501543,0.18316752,0.0004174289,0.002644194,0.000106057036,0.00056017825,0.00033183797,0.035517037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950767,0.00014111062,0.000040652267,0.000074251024,0.00019227428,0.000044079712],"domain_scores_gemma":[0.99911135,0.0004897754,0.00008393132,0.00012920954,0.00011735214,0.00006832834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068926957,0.00096990855,0.0010772608,0.0037731149,0.0012313307,0.002987123,0.0012893951,0.00070851925,0.0047667297],"category_scores_gemma":[0.0037144208,0.00039822885,0.0009762257,0.0026037833,0.0036836085,0.0036873417,0.0022172146,0.003239421,0.0009266575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018098028,0.00003203454,0.0002516352,0.00011330542,0.000011952056,0.00007661504,0.00026737782,0.004152682,0.00093909266,0.93500304,0.003187914,0.055946354],"study_design_scores_gemma":[0.000003668,0.000006644684,0.0001271248,0.000019138179,0.000002834254,0.00006128465,0.000038607348,0.006440489,0.0002687403,0.988042,0.004981366,0.000008275116],"about_ca_topic_score_codex":0.0006176158,"about_ca_topic_score_gemma":0.00061511504,"teacher_disagreement_score":0.0047667297,"about_ca_system_score_codex":0.0013474508,"about_ca_system_score_gemma":0.0005757633,"threshold_uncertainty_score":0.015946329},"labels":[],"label_agreement":null},{"id":"W1902317482","doi":"10.1007/978-3-642-21878-1_23","title":"Gridifying the TINKER Conformer Generator Application for gLite Grid","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"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":"Magyar Tudományos Akadémia Számítástechnikai és Automatizálási Kutatóintézet; Université de Franche-Comté; Università di Pisa; Università della Calabria; Université de Bordeaux; Universidad Complutense de Madrid; Universidade de São Paulo; Technische Universiteit Delft; Science and Technology Facilities Council; Indian Council of Agricultural Research; University College Dublin; Universidad de Extremadura; Cardiff University; Queen's University; Institut national de recherche en informatique et en automatique (INRIA); Universität Innsbruck; Aristotle University of Thessaloniki; Centre National de la Recherche Scientifique; University of Reading; University of Westminster; Universidad de La Laguna; University of Cyprus","keywords":"Computer science; Grid; Porting; Computational science; Workflow; Conformational isomerism; Molecular dynamics; Generator (circuit theory); Simulated annealing; Parallel computing; Algorithm; Power (physics); Programming language; Molecule; Thermodynamics; Chemistry","score_opus":0.026187014727293286,"score_gpt":0.24596218892486116,"score_spread":0.21977517419756787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902317482","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.01970049,0.00015399087,0.49932298,0.00039046523,0.00043306095,0.00025729954,0.0018178463,0.429984,0.04793979],"genre_scores_gemma":[0.409247,0.0005222996,0.30629098,0.0010978745,0.00017132497,0.0005352565,0.013667146,0.17008893,0.09837908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995932,0.00007119027,0.000025439118,0.00006719468,0.00018084519,0.00006213372],"domain_scores_gemma":[0.9991474,0.00019072687,0.00002617561,0.00040757292,0.00015285864,0.00007523353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082533696,0.00091448077,0.0006902605,0.00059847994,0.00043638743,0.001341563,0.0019073308,0.00082325743,0.050511815],"category_scores_gemma":[0.0027420395,0.0005735149,0.0007034933,0.00055289164,0.00047349875,0.0012794628,0.0023496186,0.0014708702,0.014716378],"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.002304307,0.00038297987,0.0047909757,0.0007453551,0.00020081001,0.0014178117,0.0011827296,0.04226068,0.047883585,0.038932092,0.4157309,0.4441677],"study_design_scores_gemma":[0.00089315587,0.00019523207,0.0025162965,0.00013566876,0.00009524847,0.0008900637,0.00027252745,0.42709047,0.08920391,0.04089855,0.4376446,0.00016426475],"about_ca_topic_score_codex":0.0014082895,"about_ca_topic_score_gemma":0.0018956576,"teacher_disagreement_score":0.050511815,"about_ca_system_score_codex":0.00036983052,"about_ca_system_score_gemma":0.0005354339,"threshold_uncertainty_score":0.16897881},"labels":[],"label_agreement":null},{"id":"W1903121390","doi":"10.1007/978-3-642-02454-2_1","title":"Using Causality Relationships for a Progressive Management of Hazardous Phenomena with Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université Laval","funders":"","keywords":"Computer science; Causality (physics); Hazardous waste; Scope (computer science); Representation (politics); Event (particle physics); Process (computing); ENCODE; Set (abstract data type); Semantics (computer science); Wireless sensor network; Identification (biology); Data mining; Data science; Risk analysis (engineering)","score_opus":0.055202250212790294,"score_gpt":0.2832520054248171,"score_spread":0.2280497552120268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903121390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033245725,0.00031094477,0.9902395,0.00022807269,0.00008477053,0.00006576987,0.00010507891,0.0010584485,0.004582881],"genre_scores_gemma":[0.21776628,0.0016675201,0.7738647,0.00016481595,0.00014889624,0.0001742285,0.00055724673,0.00036245008,0.0052938764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874806,0.00034110446,0.00015255834,0.00023792658,0.0004332678,0.000087126464],"domain_scores_gemma":[0.9976507,0.0012104699,0.0002453833,0.00044125118,0.0003439628,0.000108325956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026175801,0.0010206297,0.0006742069,0.0022336673,0.0012348561,0.002775832,0.0019292324,0.00097133877,0.0051306756],"category_scores_gemma":[0.006027837,0.00065842725,0.0011333104,0.0021328472,0.0014866946,0.0068130507,0.0029082058,0.0019633286,0.0008055649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016560158,0.00018899603,0.0018703704,0.0005939063,0.0001434321,0.0004104542,0.0008436917,0.1887768,0.01078716,0.42316154,0.0059413775,0.36711654],"study_design_scores_gemma":[0.000034444718,0.00006617068,0.00055452815,0.0001399698,0.00018847178,0.00023372471,0.00024854467,0.5357051,0.013069074,0.39948645,0.050198752,0.00007479915],"about_ca_topic_score_codex":0.0036353285,"about_ca_topic_score_gemma":0.0077584214,"teacher_disagreement_score":0.0051306756,"about_ca_system_score_codex":0.00083921675,"about_ca_system_score_gemma":0.0016409486,"threshold_uncertainty_score":0.017163813},"labels":[],"label_agreement":null},{"id":"W1903181316","doi":"10.1007/978-3-642-24500-8_50","title":"Exercise Pal Mootchi","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Trainer; Computer science; Neglect; Incentive; Human–computer interaction; Persuasive technology; Work (physics); Multimedia; Psychology; Persuasion; Social psychology; Engineering","score_opus":0.023724042771376845,"score_gpt":0.25344689931577025,"score_spread":0.2297228565443934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903181316","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.0020668025,0.0027403447,0.0045410763,0.0074125766,0.003998375,0.00011625829,0.00082293333,0.0019954892,0.97630614],"genre_scores_gemma":[0.0030082255,0.00051638315,0.00093923527,0.0009784932,0.00042003478,0.000035010795,0.00029941706,0.0003171475,0.993486],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998229,0.000017257216,0.0000035280962,0.00005497727,0.000071069524,0.000030226904],"domain_scores_gemma":[0.9997563,0.00002748464,0.000009878564,0.000025881482,0.0000638833,0.000116615665],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032085637,0.0009598699,0.0006197657,0.0013773167,0.0017336295,0.0018971249,0.000876646,0.0011215066,0.54694664],"category_scores_gemma":[0.0007408748,0.00027060736,0.00033943573,0.0005935562,0.00043850765,0.0019884915,0.003179372,0.0013504365,0.33376148],"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.00006928375,0.000047084763,0.00008965666,0.00007773218,0.000002154422,0.000036122627,0.00014393433,0.000035018096,0.0008245779,0.007427145,0.9005851,0.09066221],"study_design_scores_gemma":[0.000005492145,0.00001526692,0.0001845182,0.000032548127,0.0000011206375,0.00004645576,0.00008973569,0.000027471284,0.00013317727,0.0016315734,0.99783057,0.0000021462454],"about_ca_topic_score_codex":0.0011317979,"about_ca_topic_score_gemma":0.0050094407,"teacher_disagreement_score":0.54694664,"about_ca_system_score_codex":0.0004922832,"about_ca_system_score_gemma":0.00045128353,"threshold_uncertainty_score":0.6462256},"labels":[],"label_agreement":null},{"id":"W1903645564","doi":"10.1007/978-3-319-03089-0_29","title":"Zone-Based Synthesis of Strict 2-Phase Fault Recovery","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Automaton; Timed automaton; Algorithm; Bounded function; Fault (geology); Graph; Set (abstract data type); Fault model; Representation (politics); Theoretical computer science; Mathematics; Programming language","score_opus":0.026470704724976164,"score_gpt":0.2825107681267793,"score_spread":0.25604006340180313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903645564","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.041050494,0.00041169638,0.9362182,0.00009420234,0.00014931872,0.00009227164,0.00014963718,0.002584229,0.01924984],"genre_scores_gemma":[0.8525431,0.00021841172,0.14089604,0.000067569556,0.000019761317,0.00009617418,0.0001619012,0.00020787615,0.0057891677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00004260743,0.000018486506,0.000049523245,0.00009478635,0.000055381955],"domain_scores_gemma":[0.9997311,0.00008961547,0.000033291217,0.00006996013,0.00006270037,0.000013365221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031793438,0.00057520735,0.00051862915,0.00050188013,0.00032359533,0.00072992296,0.00088572217,0.00051073066,0.0059802844],"category_scores_gemma":[0.0006796638,0.00028979313,0.00045590068,0.00027980172,0.0004024841,0.0006099749,0.00086507463,0.00055715314,0.0009569086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075695413,0.00014474793,0.0005192947,0.00079291494,0.0000755239,0.00035770715,0.0003894417,0.41465548,0.17456901,0.18826713,0.003475029,0.21599682],"study_design_scores_gemma":[0.000100681624,0.00034929538,0.0002588537,0.00007689887,0.00009151347,0.00018568903,0.000056941568,0.8158348,0.1076593,0.05969445,0.015649777,0.000041771968],"about_ca_topic_score_codex":0.0010820306,"about_ca_topic_score_gemma":0.0019368541,"teacher_disagreement_score":0.0059802844,"about_ca_system_score_codex":0.0005134903,"about_ca_system_score_gemma":0.0006056859,"threshold_uncertainty_score":0.02000606},"labels":[],"label_agreement":null},{"id":"W1905656136","doi":"10.1007/11871637_28","title":"Efficient Spatial Classification Using Decoupled Conditional Random Fields","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"CRFS; Conditional random field; Discriminative model; Computer science; Random field; Artificial intelligence; Generative grammar; Markov random field; Machine learning; Boosting (machine learning); Pattern recognition (psychology); Markov process; Mathematics; Image (mathematics); Statistics","score_opus":0.022754883563641963,"score_gpt":0.25812011596751083,"score_spread":0.23536523240386886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1905656136","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.008795534,0.00021947162,0.98719597,0.0001500827,0.000055230674,0.000029875464,0.00018712971,0.0018311617,0.0015355666],"genre_scores_gemma":[0.2759022,0.00037634914,0.7105063,0.0002861066,0.00014803885,0.0001703254,0.00226157,0.00045238886,0.009896694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915445,0.00020437148,0.000039815422,0.00020239118,0.000271532,0.00012741871],"domain_scores_gemma":[0.99799466,0.0009982433,0.000105788786,0.00048952404,0.00032642562,0.00008539523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012889649,0.00093013473,0.0020087815,0.0014745059,0.00069933315,0.0017401328,0.003458194,0.0017830466,0.007819839],"category_scores_gemma":[0.0033276347,0.00081424403,0.0015367694,0.0022102061,0.0007106917,0.0028929876,0.00245918,0.001777108,0.0028953063],"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.00038318287,0.00020908068,0.00096385553,0.00013329694,0.00011537837,0.00007505687,0.00006580434,0.2812341,0.009998783,0.047355287,0.01620506,0.64326113],"study_design_scores_gemma":[0.0000106397065,0.000011114549,0.00011764762,0.000004243337,0.000007885666,0.000023077106,0.000006884898,0.9818829,0.0011955485,0.01603359,0.00069918256,0.0000072412295],"about_ca_topic_score_codex":0.0074628326,"about_ca_topic_score_gemma":0.010783189,"teacher_disagreement_score":0.007819839,"about_ca_system_score_codex":0.0010876558,"about_ca_system_score_gemma":0.001408448,"threshold_uncertainty_score":0.026159942},"labels":[],"label_agreement":null},{"id":"W190629664","doi":"10.1007/978-3-642-40763-5_63","title":"Cardiac Fiber Inpainting Using Cartan Forms","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Villum Fonden","keywords":"Inpainting; Computer science; Connection (principal bundle); Interpolation (computer graphics); Curvature; Orientation (vector space); Artificial intelligence; Curvilinear coordinates; Computer vision; Fiber; Algorithm; Diffusion MRI; Tensor (intrinsic definition); Mathematics; Image (mathematics); Geometry; Materials science","score_opus":0.03970193718831911,"score_gpt":0.3337795257651178,"score_spread":0.2940775885767987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190629664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015552288,0.00046076303,0.97846586,0.0002731522,0.00017474254,0.00009580482,0.00019840487,0.0011725295,0.0036064119],"genre_scores_gemma":[0.11614334,0.0012691128,0.8712913,0.00016814673,0.0002838793,0.0000765362,0.00037845678,0.00060233637,0.009786838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997212,0.00005446171,0.000020237634,0.000040197086,0.00014014411,0.000023738006],"domain_scores_gemma":[0.99912816,0.00030643633,0.000085646134,0.00020635453,0.00020603242,0.00006740494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337038,0.00097333925,0.00059160654,0.0010803785,0.00036097804,0.001395594,0.00062060537,0.0009492555,0.013239289],"category_scores_gemma":[0.001760267,0.00044824101,0.0006256286,0.0010280213,0.00039017884,0.0009447478,0.00090397464,0.0012663226,0.0020318783],"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.0003644055,0.00008881568,0.00087332266,0.00037837867,0.0000630491,0.00052392564,0.00019392396,0.02172588,0.071702056,0.009925271,0.010424371,0.8837365],"study_design_scores_gemma":[0.000066026456,0.00038717888,0.0034886813,0.00010452947,0.00009533223,0.003117772,0.00017292459,0.8554905,0.080290884,0.010201578,0.046516355,0.00006822971],"about_ca_topic_score_codex":0.0008993483,"about_ca_topic_score_gemma":0.0025416901,"teacher_disagreement_score":0.013239289,"about_ca_system_score_codex":0.00018437045,"about_ca_system_score_gemma":0.0004051207,"threshold_uncertainty_score":0.044289827},"labels":[],"label_agreement":null},{"id":"W190710300","doi":"10.1007/978-3-642-40811-3_64","title":"Right Ventricle Segmentation with Probability Product Kernel Constraints","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Graphics processing unit; Segmentation; Kernel (algebra); Algorithm; Artificial intelligence; Parallel computing; Mathematics","score_opus":0.011884045779261387,"score_gpt":0.24675830111330033,"score_spread":0.23487425533403894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190710300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014091982,0.0002820987,0.9828591,0.00024539823,0.000041349347,0.00003396938,0.00020258555,0.0008870181,0.0013564997],"genre_scores_gemma":[0.3529189,0.0005399967,0.6375436,0.0001699372,0.00016172307,0.00010498882,0.0010270014,0.0012018114,0.0063319416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994905,0.000104588966,0.00004016038,0.00014226513,0.00015249333,0.00007002058],"domain_scores_gemma":[0.99877733,0.00049066916,0.00013309495,0.00026281094,0.00023331969,0.00010264946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011217298,0.00074512133,0.0013787926,0.0010441312,0.00043637288,0.0026525839,0.0011921187,0.0021159924,0.004694289],"category_scores_gemma":[0.0035479004,0.0010197029,0.0011903226,0.0009520788,0.00050629344,0.0018216686,0.0015929267,0.0016528001,0.0015970871],"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.0011915158,0.00018616414,0.002058421,0.00055172003,0.00034132684,0.00092246744,0.00016349404,0.3740214,0.072628774,0.039613757,0.012921987,0.495399],"study_design_scores_gemma":[0.000017650347,0.00003183805,0.00043006605,0.000017099654,0.000027725846,0.00022265037,0.000008046343,0.9811864,0.009086353,0.006977098,0.0019788218,0.000016187836],"about_ca_topic_score_codex":0.00347207,"about_ca_topic_score_gemma":0.0042110407,"teacher_disagreement_score":0.004694289,"about_ca_system_score_codex":0.00050156115,"about_ca_system_score_gemma":0.001596929,"threshold_uncertainty_score":0.015703917},"labels":[],"label_agreement":null},{"id":"W1907847775","doi":"10.1007/978-3-319-11758-4_19","title":"Unconstrained Structural Similarity-Based Optimization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","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 Waterloo","funders":"","keywords":"Closeness; Computer science; Measure (data warehouse); Similarity (geometry); Similarity measure; Fidelity; Set (abstract data type); Structural similarity; Euclidean distance; Artificial intelligence; Image processing; Euclidean geometry; Image (mathematics); Image quality; Data mining; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.019936527033172963,"score_gpt":0.275322763283599,"score_spread":0.25538623625042606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907847775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030418711,0.000309503,0.9893945,0.00011601726,0.0000804582,0.000032344527,0.000047246416,0.00017430643,0.0068037244],"genre_scores_gemma":[0.25868252,0.0007126307,0.70509326,0.00031632464,0.00031477393,0.0003796301,0.0006195126,0.0009203241,0.0329611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994758,0.00015743944,0.000022939146,0.000117829346,0.00018818682,0.000037802478],"domain_scores_gemma":[0.99911207,0.00053976383,0.00006276442,0.00009592781,0.00014665042,0.00004288157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010024944,0.0011417745,0.0017435405,0.0007398133,0.00041362294,0.001036613,0.0020539712,0.0019556354,0.0072321817],"category_scores_gemma":[0.0032203665,0.00072693947,0.0008590516,0.0012579873,0.0010626774,0.001560326,0.0023190647,0.0015156426,0.0018798911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010693498,0.000104973435,0.00018306696,0.00020915917,0.00007226459,0.000045025194,0.000052050436,0.78833365,0.0030428898,0.06485901,0.007913061,0.13507788],"study_design_scores_gemma":[0.00000924497,0.000026509662,0.000041694653,0.000007689571,0.0000052524156,0.000025206644,0.0000055252804,0.98798764,0.00037501508,0.010405206,0.0011052664,0.0000057736256],"about_ca_topic_score_codex":0.0020029633,"about_ca_topic_score_gemma":0.0022621287,"teacher_disagreement_score":0.0072321817,"about_ca_system_score_codex":0.0006895268,"about_ca_system_score_gemma":0.000960395,"threshold_uncertainty_score":0.024194062},"labels":[],"label_agreement":null},{"id":"W1907964890","doi":"10.1007/978-3-540-27868-9_27","title":"Improving Probabilistic Automata Learning with Additional Knowledge","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Université de Montréal","funders":"","keywords":"Computer science; Automaton; Grammar induction; Probabilistic logic; Inference; Artificial intelligence; Cluster analysis; Learning automata; Task (project management); Machine learning; Natural language processing; Rule-based machine translation","score_opus":0.008600264750054234,"score_gpt":0.2271526474379097,"score_spread":0.21855238268785546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907964890","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.011385522,0.00074859266,0.9759576,0.0005369922,0.00028202424,0.00005679759,0.00016743294,0.00475994,0.006105196],"genre_scores_gemma":[0.28228253,0.00071398204,0.7023969,0.000833214,0.00052227,0.00026081034,0.0010680616,0.0009459722,0.010976248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967063,0.00086567545,0.00022581137,0.00083184685,0.0011570998,0.00021311399],"domain_scores_gemma":[0.9802801,0.012102914,0.00040166144,0.0054964107,0.0014725073,0.00024640004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002692152,0.0016105374,0.0026244859,0.0010741062,0.00088296254,0.0018804282,0.0048797526,0.0031577956,0.0134797795],"category_scores_gemma":[0.019567316,0.0011526336,0.0020075925,0.0016730243,0.0015154463,0.010028187,0.00527935,0.0050845603,0.004419079],"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.00036850493,0.00033684444,0.0010200562,0.00046222066,0.00019092885,0.00011056419,0.00011710761,0.24832328,0.006427135,0.06248437,0.013835914,0.6663231],"study_design_scores_gemma":[0.000031578,0.000057955735,0.00012522176,0.000023650764,0.000061356826,0.00007979081,0.000013070973,0.8892478,0.003327255,0.104021505,0.0029960403,0.000014851793],"about_ca_topic_score_codex":0.0018270505,"about_ca_topic_score_gemma":0.0036197088,"teacher_disagreement_score":0.0134797795,"about_ca_system_score_codex":0.0011131072,"about_ca_system_score_gemma":0.0014572664,"threshold_uncertainty_score":0.04509431},"labels":[],"label_agreement":null},{"id":"W1908634864","doi":"10.1007/978-3-642-40763-5_78","title":"Manifold Learning of Brain MRIs by Deep Learning","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":225,"is_retracted":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":"Artificial intelligence; Computer science; Nonlinear dimensionality reduction; Manifold alignment; Deep learning; Deep belief network; Manifold (fluid mechanics); Segmentation; Pattern recognition (psychology); Machine learning; Population; Similarity (geometry); Computer vision; Image (mathematics); Dimensionality reduction","score_opus":0.006201457851369817,"score_gpt":0.22405991227068445,"score_spread":0.21785845441931462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1908634864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029703565,0.0005808194,0.9668276,0.00048480317,0.00005493895,0.00003654359,0.00024122222,0.0012058105,0.0008646668],"genre_scores_gemma":[0.6009979,0.0013866891,0.3901055,0.00024024991,0.00020947256,0.00011751299,0.001332334,0.00051579025,0.0050944723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997671,0.00006394549,0.000011042558,0.00006459857,0.000056554047,0.00003669609],"domain_scores_gemma":[0.999228,0.00029024677,0.00011631208,0.00015822003,0.00015501794,0.00005230496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057381624,0.00071974524,0.00090206234,0.0013680506,0.00034149503,0.00092061877,0.0010324179,0.0010459692,0.0017997572],"category_scores_gemma":[0.0033218816,0.00059885223,0.0011834573,0.0010999286,0.0005498058,0.0013191648,0.0013483244,0.001894796,0.00084060733],"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.00021687153,0.00013076719,0.0030655125,0.00024458606,0.0001681592,0.00017607475,0.00021464385,0.3452745,0.02878816,0.029174663,0.010917065,0.581629],"study_design_scores_gemma":[0.0000043340874,0.000027724924,0.00046078305,0.000010361223,0.000009111278,0.00006704683,0.000014881693,0.9772354,0.0020282094,0.018934265,0.0011962961,0.000011545229],"about_ca_topic_score_codex":0.0043685394,"about_ca_topic_score_gemma":0.0056592454,"teacher_disagreement_score":0.0043685394,"about_ca_system_score_codex":0.0005536758,"about_ca_system_score_gemma":0.0008135216,"threshold_uncertainty_score":0.0086862445},"labels":[],"label_agreement":null},{"id":"W190884861","doi":"10.1007/978-3-642-21043-3_17","title":"Extracting Relations between Diseases, Treatments, and Tests from Clinical Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Relation (database); Sentence; Support vector machine; Identification (biology); Natural language processing; Task (project management); Set (abstract data type); Projection (relational algebra); Data set; Random projection; Relationship extraction; Pattern recognition (psychology); Data mining; Algorithm","score_opus":0.08944012625585655,"score_gpt":0.34846279627255444,"score_spread":0.2590226700166979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190884861","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.17597787,0.044972744,0.52730423,0.010364008,0.0011364635,0.0019457975,0.21616332,0.0068896576,0.0152459275],"genre_scores_gemma":[0.2289993,0.015711468,0.5365824,0.0014790279,0.0007037334,0.00068658363,0.21293618,0.00039744526,0.0025038354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978255,0.0004387941,0.00051285647,0.0005446167,0.00057514984,0.00010307474],"domain_scores_gemma":[0.98835665,0.009336966,0.0008581529,0.00072087476,0.0004940475,0.00023330841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002888511,0.0014832378,0.0018641371,0.011674317,0.0007172002,0.002802415,0.0015308493,0.0012543573,0.0038339656],"category_scores_gemma":[0.013566762,0.00067171844,0.0032639727,0.010027075,0.0005806114,0.0024017459,0.0018548355,0.0015593858,0.0025085374],"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.00090558565,0.000635967,0.07718782,0.006802591,0.0014853938,0.004196986,0.0013389962,0.009522604,0.020742502,0.012295531,0.035637803,0.8292483],"study_design_scores_gemma":[0.0007139538,0.0011741936,0.17381234,0.005683246,0.009575779,0.017923893,0.004347801,0.13734199,0.051821947,0.32385147,0.27329174,0.00046162424],"about_ca_topic_score_codex":0.003209531,"about_ca_topic_score_gemma":0.0053727184,"teacher_disagreement_score":0.011674317,"about_ca_system_score_codex":0.00074269366,"about_ca_system_score_gemma":0.003018562,"threshold_uncertainty_score":0.015276134},"labels":[],"label_agreement":null},{"id":"W190911302","doi":"10.1007/978-3-642-54903-8_46","title":"Evaluation of Sentence Compression Techniques against Human Performance","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Concordia University","funders":"","keywords":"Automatic summarization; Computer science; Sentence; Natural language processing; Artificial intelligence; Syntax; Compression (physics); Word (group theory); Context (archaeology); Feature (linguistics); Speech recognition; Linguistics","score_opus":0.02513418462569633,"score_gpt":0.297930327783601,"score_spread":0.2727961431579047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190911302","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.87424874,0.011911378,0.08117521,0.00042549628,0.00095351425,0.0006244792,0.0069766087,0.01448308,0.009201586],"genre_scores_gemma":[0.86486065,0.0029412506,0.099052265,0.00017739202,0.00036898864,0.00029015163,0.020961482,0.0007477113,0.010600066],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972939,0.00094595144,0.0003191148,0.0004848239,0.0008200781,0.0001361846],"domain_scores_gemma":[0.98738074,0.00900427,0.00048659707,0.0008512739,0.0020427466,0.00023431117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002514527,0.0014830148,0.00077847426,0.0021438072,0.00041426616,0.0008741049,0.0011160142,0.0010804016,0.0050226036],"category_scores_gemma":[0.010163305,0.00018801563,0.00047479587,0.0016341801,0.0003383584,0.0010551106,0.00079987774,0.0005438518,0.0026493866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063790902,0.0013541064,0.0064072404,0.002114805,0.00067754433,0.00067300873,0.0004182103,0.026927076,0.084769696,0.00057125406,0.015877089,0.8538309],"study_design_scores_gemma":[0.00090754044,0.015889458,0.059650246,0.00028290876,0.001692889,0.0034707482,0.0009235238,0.53841996,0.36088255,0.0018816622,0.015762856,0.00023558471],"about_ca_topic_score_codex":0.0024748186,"about_ca_topic_score_gemma":0.002339765,"teacher_disagreement_score":0.0050226036,"about_ca_system_score_codex":0.00038118925,"about_ca_system_score_gemma":0.00038458346,"threshold_uncertainty_score":0.016802311},"labels":[],"label_agreement":null},{"id":"W19096729","doi":"10.1007/978-3-319-11656-3_21","title":"End-Shape Recognition for Arabic Handwritten Text Segmentation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"King Abdulaziz University","keywords":"Computer science; Spotting; Arabic; Text segmentation; Segmentation; Artificial intelligence; Natural language processing; Handwriting; Text recognition; Handwriting recognition; Speech recognition; Word (group theory); Pattern recognition (psychology); Feature extraction; Linguistics; Image (mathematics)","score_opus":0.023558543297169263,"score_gpt":0.2611351952739788,"score_spread":0.23757665197680955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19096729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024662757,0.0010510095,0.9231706,0.00012872873,0.00040021725,0.0002277976,0.0017294118,0.032541454,0.016088039],"genre_scores_gemma":[0.11085336,0.0007882796,0.80989724,0.0003184716,0.00015865515,0.00023158254,0.0076670675,0.0028106158,0.06727466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996043,0.000024200248,0.000026781028,0.00010293637,0.00017896661,0.00006282493],"domain_scores_gemma":[0.9995449,0.00006081759,0.00002211731,0.000115811294,0.0002216033,0.00003459576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549967,0.0013743548,0.0009553795,0.0012011852,0.0005916232,0.0013960738,0.0017429664,0.0013192118,0.029591003],"category_scores_gemma":[0.00060508004,0.0005262857,0.0010478467,0.0010579898,0.0003340473,0.0011869102,0.0011427745,0.00090891833,0.033627156],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004019732,0.00007807684,0.00035663764,0.0001702456,0.000029407234,0.00013645455,0.00004696821,0.0026175187,0.19533372,0.0012091008,0.011303509,0.78831637],"study_design_scores_gemma":[0.000039434908,0.00031306388,0.0043046842,0.00007699435,0.000081067104,0.0012894934,0.00012246559,0.2236217,0.71039665,0.003333393,0.056341626,0.00007934559],"about_ca_topic_score_codex":0.0015829313,"about_ca_topic_score_gemma":0.0025438524,"teacher_disagreement_score":0.029591003,"about_ca_system_score_codex":0.0003510301,"about_ca_system_score_gemma":0.00058348,"threshold_uncertainty_score":0.09899175},"labels":[],"label_agreement":null},{"id":"W1909718695","doi":"10.1007/3-540-36559-1_3","title":"Emergence in Cyberspace: Towards the Evolutionary Self-Organizing Enterprise","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cyberspace; Computer science; Self-organization; Artificial life; Information system; Fuzzy logic; Software; Knowledge management; Artificial intelligence; The Internet; World Wide Web; Engineering","score_opus":0.017765956949859277,"score_gpt":0.2371606232738235,"score_spread":0.21939466632396423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1909718695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107641615,0.008160108,0.5305061,0.013178403,0.00065131276,0.00009639617,0.00005958885,0.00048579634,0.3392207],"genre_scores_gemma":[0.9005203,0.002939023,0.07568348,0.00034020524,0.00014714144,0.00006757757,0.00006265934,0.00009197441,0.02014763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996723,0.00014773605,0.0000105889885,0.000048536756,0.000085105086,0.00003570333],"domain_scores_gemma":[0.9994772,0.00023073397,0.000039188115,0.00010904716,0.000059455288,0.0000844313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489692,0.0002241155,0.0002961397,0.0003695306,0.0007230359,0.003637915,0.00070468395,0.0011392918,0.0017589745],"category_scores_gemma":[0.0016600009,0.00021027029,0.00028169117,0.00048739763,0.003960729,0.00493076,0.0020730323,0.0017417123,0.0004307712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009636357,0.000014445978,0.00040109028,0.000041528485,0.0000062987806,0.0000704127,0.0014413716,0.0046066325,0.0005186872,0.95738375,0.0018825743,0.03362347],"study_design_scores_gemma":[0.00000763891,0.000016055257,0.00028087618,0.000033586784,0.0000039579863,0.00009985003,0.00076446665,0.016818814,0.00038861623,0.9395228,0.042056933,0.000006426585],"about_ca_topic_score_codex":0.000515557,"about_ca_topic_score_gemma":0.00056666473,"teacher_disagreement_score":0.003637915,"about_ca_system_score_codex":0.00063508353,"about_ca_system_score_gemma":0.0009679156,"threshold_uncertainty_score":0.0058842897},"labels":[],"label_agreement":null},{"id":"W1909963642","doi":"10.1007/978-3-642-21043-3_21","title":"Comparison of Learned versus Engineered Features for Classification of Mine Like Objects from Raw Sonar Images","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Underwater Acoustics Research","field":"Earth and Planetary Sciences","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; Dalhousie University","funders":"","keywords":"Artificial intelligence; Scale-invariant feature transform; Computer science; Sonar; Support vector machine; Pattern recognition (psychology); Matching (statistics); Cognitive neuroscience of visual object recognition; Feature (linguistics); Convolutional neural network; Feature extraction; Automatic target recognition; Field (mathematics); Computer vision; Synthetic aperture radar","score_opus":0.07093413095472281,"score_gpt":0.30078309517836593,"score_spread":0.22984896422364312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1909963642","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.85174584,0.005436008,0.13503234,0.0002737966,0.0003972764,0.00010770505,0.0010772052,0.0019265054,0.0040032645],"genre_scores_gemma":[0.9288928,0.0010192218,0.063397326,0.000095389165,0.00009823195,0.000043682838,0.0031081191,0.00018324722,0.003161967],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929655,0.00012782316,0.00006181331,0.00019154248,0.00022140461,0.000100821606],"domain_scores_gemma":[0.9974064,0.0016669865,0.00010572774,0.00015828489,0.0005772316,0.000085313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016635474,0.00082417147,0.0007794489,0.00095908146,0.00021337121,0.0014035659,0.0010735124,0.0011959255,0.0018675624],"category_scores_gemma":[0.003714428,0.00022658707,0.00058971107,0.0007034695,0.00033328196,0.0014341432,0.0007827217,0.0006862116,0.0007034916],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052549564,0.00058041804,0.008994771,0.00054660905,0.0005353705,0.00018768806,0.00014421564,0.059318434,0.089300185,0.0006657452,0.0037319022,0.8307397],"study_design_scores_gemma":[0.0001796099,0.0016812033,0.025750771,0.00006799432,0.00032263773,0.0003153006,0.00024721056,0.9152709,0.053675942,0.0010268843,0.0014021135,0.000059499103],"about_ca_topic_score_codex":0.0031963517,"about_ca_topic_score_gemma":0.0041204253,"teacher_disagreement_score":0.0031963517,"about_ca_system_score_codex":0.0004590654,"about_ca_system_score_gemma":0.0004067704,"threshold_uncertainty_score":0.008797824},"labels":[],"label_agreement":null},{"id":"W190999257","doi":"10.1007/978-3-642-38827-9_43","title":"Cooperative Games and Their Effect on Group Collaboration","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Systems, Applications & Products in Data Processing (Canada); University of Toronto","funders":"","keywords":"Computer science; Harmony (color); Group behavior; Computer-supported cooperative work; Work (physics); Human–computer interaction; Game mechanics; Group (periodic table); Group dynamic; Group work; Computer game; Multimedia; Social psychology; Mathematics education; Psychology; Engineering","score_opus":0.013954393958831217,"score_gpt":0.28659312274024507,"score_spread":0.2726387287814139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190999257","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.6534767,0.011965778,0.017083485,0.0016275778,0.00041436075,0.00011683558,0.00013114736,0.00015076782,0.31503335],"genre_scores_gemma":[0.9862592,0.001693337,0.0023627793,0.00006847427,0.000048734233,0.000067601446,0.000022705015,0.000016103337,0.009461005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916685,0.0004928273,0.000015990401,0.000065803,0.00016914707,0.00008943882],"domain_scores_gemma":[0.9903464,0.00859337,0.00031834477,0.00018546708,0.00014576525,0.0004106284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010931335,0.0006637242,0.0004143501,0.00049798354,0.0007966499,0.0019816,0.000847083,0.0010601762,0.011895294],"category_scores_gemma":[0.0078930855,0.00027381198,0.00044882423,0.000575749,0.0013122619,0.0014694304,0.0016281821,0.0010500256,0.00046741177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076846657,0.0039001286,0.010547156,0.0013987357,0.000429557,0.0010857261,0.012098973,0.024191132,0.016710084,0.54222006,0.012358495,0.36737522],"study_design_scores_gemma":[0.002291452,0.0039198175,0.049462926,0.0006118142,0.000605526,0.001111752,0.007200489,0.048241157,0.007968152,0.8240037,0.054440252,0.00014292779],"about_ca_topic_score_codex":0.0010585589,"about_ca_topic_score_gemma":0.0012206458,"teacher_disagreement_score":0.011895294,"about_ca_system_score_codex":0.0004334457,"about_ca_system_score_gemma":0.00050185237,"threshold_uncertainty_score":0.03979373},"labels":[],"label_agreement":null},{"id":"W1911215475","doi":"10.1007/11866763_3","title":"Prostate Segmentation in 2D Ultrasound Images Using Image Warping and Ellipse Fitting","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency; University of British Columbia","funders":"","keywords":"Segmentation; Image warping; Computer science; Artificial intelligence; Ellipse; Computer vision; Image segmentation; Observer (physics); Pattern recognition (psychology); Mathematics; Geometry","score_opus":0.0072154031718153705,"score_gpt":0.2527505332812656,"score_spread":0.24553513010945024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911215475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02121925,0.0004929633,0.9758874,0.000091736554,0.000030938638,0.00007286445,0.000055886776,0.0016201169,0.00052888604],"genre_scores_gemma":[0.13076621,0.00086023397,0.8655819,0.00008792915,0.000050432438,0.0001085395,0.00019105019,0.00082001556,0.0015336447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908125,0.00020829469,0.00006841418,0.00023963419,0.00030111658,0.000101343125],"domain_scores_gemma":[0.9986436,0.00070391333,0.00016095038,0.00020479481,0.00023161255,0.000055062035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016027709,0.0012940796,0.0014220468,0.0024649971,0.00058683136,0.0016334476,0.00082819245,0.0016911961,0.0020775364],"category_scores_gemma":[0.0043581943,0.0015346236,0.0013777044,0.0024081706,0.0005360556,0.0017928062,0.0013749046,0.0011443316,0.0013669677],"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.0005977597,0.00016547235,0.0026164057,0.00048150631,0.00024520876,0.00044912196,0.0005731979,0.075714156,0.14367922,0.0030873397,0.0018496049,0.770541],"study_design_scores_gemma":[0.00004579389,0.00018498533,0.0060563437,0.00005686959,0.00013281468,0.0016388034,0.00015247449,0.87500316,0.10680811,0.004170556,0.0056436583,0.00010652172],"about_ca_topic_score_codex":0.0018762936,"about_ca_topic_score_gemma":0.0028288725,"teacher_disagreement_score":0.0024649971,"about_ca_system_score_codex":0.0003998093,"about_ca_system_score_gemma":0.0007721746,"threshold_uncertainty_score":0.0084763765},"labels":[],"label_agreement":null},{"id":"W1911249824","doi":"10.1007/3-540-45111-0_2","title":"Creating an Electronic Commerce Device Which Promotes Universal Access: The KALI Project","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ICT in Developing Communities","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"GRASP; Computer science; Kali; Field (mathematics); Focus (optics); Population; Knowledge management; Telecommunications; World Wide Web; Software engineering; Sociology","score_opus":0.035127804976011666,"score_gpt":0.29058835208339784,"score_spread":0.2554605471073862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911249824","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.49503708,0.0011524161,0.12624714,0.008166599,0.00044419264,0.0007843495,0.00032512614,0.0047634314,0.36307973],"genre_scores_gemma":[0.7276606,0.0012506862,0.18282017,0.0012946891,0.00007696628,0.00041129426,0.0005259666,0.0012308864,0.084728785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986929,0.00041543483,0.000060172584,0.00021991816,0.000382067,0.00022958007],"domain_scores_gemma":[0.99815124,0.0005922129,0.00013529837,0.0004017609,0.00021290213,0.0005065748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002361136,0.00036565555,0.00032710805,0.0009309811,0.003077341,0.005926264,0.0010125977,0.0015678015,0.0061596404],"category_scores_gemma":[0.0027777322,0.00043423355,0.00038823573,0.00087766437,0.0030147128,0.011712125,0.006230341,0.0020245113,0.0018759926],"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.0009084867,0.0020942756,0.00919285,0.00049616565,0.000049278267,0.00075314724,0.01990269,0.00095869193,0.040763468,0.4439139,0.039934557,0.44103253],"study_design_scores_gemma":[0.00046822222,0.002039235,0.013328499,0.0003323624,0.00026121605,0.0031205022,0.019149752,0.016972773,0.07619467,0.071339056,0.79637694,0.00041688894],"about_ca_topic_score_codex":0.00093575084,"about_ca_topic_score_gemma":0.0013396505,"teacher_disagreement_score":0.0061596404,"about_ca_system_score_codex":0.000831424,"about_ca_system_score_gemma":0.0019018404,"threshold_uncertainty_score":0.020606041},"labels":[],"label_agreement":null},{"id":"W1911265461","doi":"10.1007/11676904_23","title":"Visualizing Search Results from Metadata-Enabled Repositories in Cultural Domains","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Humanities and Scholarship","field":"Arts and Humanities","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metadata; Computer science; Bridge (graph theory); World Wide Web; Information retrieval; Interface (matter); Visualization; Metadata modeling; Digital library; Metadata repository; Data mining","score_opus":0.05657294084407591,"score_gpt":0.2708532080769293,"score_spread":0.2142802672328534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911265461","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.8426391,0.008681726,0.053496234,0.0021099814,0.00040644314,0.00032624896,0.043213073,0.033809103,0.015318078],"genre_scores_gemma":[0.8503625,0.002596941,0.10529936,0.00017234434,0.00013863982,0.00014344795,0.032438487,0.0018648832,0.006983352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999278,0.00012971375,0.00009207473,0.000103365055,0.00030640134,0.000090409565],"domain_scores_gemma":[0.99397475,0.0038691312,0.00047079573,0.00034029395,0.0009592754,0.0003858066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103813,0.00096869515,0.0008275491,0.012694163,0.0009540352,0.004558961,0.0010396809,0.0015436007,0.006227755],"category_scores_gemma":[0.006608039,0.00040852884,0.00082728214,0.012748782,0.0004046259,0.0035390279,0.0018135227,0.00078561314,0.001701354],"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.0077069844,0.0013481651,0.098471224,0.007475687,0.0009208969,0.005003782,0.017960776,0.038371567,0.09843734,0.024335803,0.13240528,0.5675625],"study_design_scores_gemma":[0.0006507823,0.0013059537,0.15011181,0.0014689298,0.0013609758,0.0045290603,0.018306572,0.5899583,0.0917174,0.041882813,0.09822728,0.00048012208],"about_ca_topic_score_codex":0.020196073,"about_ca_topic_score_gemma":0.031501397,"teacher_disagreement_score":0.020196073,"about_ca_system_score_codex":0.0007292462,"about_ca_system_score_gemma":0.00088615733,"threshold_uncertainty_score":0.04015708},"labels":[],"label_agreement":null},{"id":"W1912275919","doi":"10.1007/978-3-540-71496-5_85","title":"A Bayesian Approach for Learning Document Type Relevance","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Ranking (information retrieval); Relevance (law); Information retrieval; Bayesian probability; Type (biology); Term (time); Artificial intelligence; Key (lock); Process (computing); Document retrieval; Factor (programming language); Machine learning","score_opus":0.024887726780150658,"score_gpt":0.287531681354494,"score_spread":0.2626439545743433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912275919","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.007013796,0.0018021911,0.98689574,0.00045628648,0.000107492655,0.00014566536,0.0005145793,0.001610592,0.0014536041],"genre_scores_gemma":[0.18624406,0.0023078877,0.7964439,0.000533123,0.00089393376,0.0006360209,0.0030584473,0.00055902894,0.009323625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934477,0.001956507,0.00055132457,0.0014446777,0.0022641046,0.00033575666],"domain_scores_gemma":[0.9804145,0.015037227,0.0005519643,0.0013887831,0.0022742192,0.0003332034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007869395,0.0014868177,0.0033601327,0.0072881808,0.0016195341,0.0037210316,0.0049663056,0.0044098324,0.006557574],"category_scores_gemma":[0.032281306,0.0018123551,0.0024059962,0.0062994137,0.0013682845,0.007573907,0.003190963,0.004636775,0.003319497],"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.00080967514,0.0004944107,0.0030167517,0.0005561513,0.00032818562,0.00015677292,0.00035943338,0.07300993,0.006183957,0.033664457,0.021474542,0.8599457],"study_design_scores_gemma":[0.00013464477,0.0001204424,0.0015917445,0.00011803029,0.00019386184,0.00024500495,0.00007002627,0.8476058,0.003341858,0.13954453,0.006929922,0.000104166036],"about_ca_topic_score_codex":0.010715204,"about_ca_topic_score_gemma":0.014080141,"teacher_disagreement_score":0.010715204,"about_ca_system_score_codex":0.0023700814,"about_ca_system_score_gemma":0.0025014835,"threshold_uncertainty_score":0.04161781},"labels":[],"label_agreement":null},{"id":"W1912889008","doi":"10.1007/11866565_29","title":"A Statistical Parts-Based Appearance Model of Inter-subject Variability","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Set (abstract data type); Artificial intelligence; Matching (statistics); Image (mathematics); Invariant (physics); Statistical model; Subject (documents); Computer science; Pattern recognition (psychology); Scale (ratio); Computer vision; Mathematics; Statistics; Geography; Cartography","score_opus":0.015326140144433209,"score_gpt":0.2889708153818138,"score_spread":0.27364467523738056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912889008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01081887,0.00047042264,0.9872283,0.00010372994,0.00010770346,0.000035893056,0.00017785093,0.00067015144,0.00038715472],"genre_scores_gemma":[0.62915903,0.0021106426,0.35401738,0.00044287567,0.00040614448,0.0004007808,0.0014941954,0.0011015352,0.010867394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915314,0.00022393189,0.00004208017,0.00026340698,0.00024000685,0.000077526114],"domain_scores_gemma":[0.99917775,0.00030959735,0.00009671375,0.00017357682,0.00019868309,0.000043695316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012753311,0.00082520134,0.0013949482,0.0014054646,0.00034714735,0.0010374858,0.0018983705,0.0017574839,0.0018300776],"category_scores_gemma":[0.002962074,0.0008961009,0.0021041108,0.0018228403,0.00060775783,0.0013428605,0.00076669705,0.0015880564,0.0019205267],"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.0006182574,0.00023215055,0.0026047153,0.00022584818,0.00039049203,0.00029553517,0.00019068558,0.45649543,0.058037005,0.011075639,0.005409976,0.46442428],"study_design_scores_gemma":[0.000008691007,0.0000521841,0.0014329322,0.000010247308,0.00005282139,0.00014404493,0.0000054981706,0.99296993,0.0016746963,0.0028026795,0.00082918745,0.000017037744],"about_ca_topic_score_codex":0.0050594555,"about_ca_topic_score_gemma":0.0053255735,"teacher_disagreement_score":0.0050594555,"about_ca_system_score_codex":0.0005341422,"about_ca_system_score_gemma":0.00068371574,"threshold_uncertainty_score":0.010060012},"labels":[],"label_agreement":null},{"id":"W191325165","doi":"10.1007/978-3-642-31491-9_8","title":"Combining UML Sequence and State Machine Diagrams for Data-Flow Based Integration Testing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Sequence diagram; Control flow; Finite-state machine; Applications of UML; Data flow diagram; Integration testing; Activity diagram; Abstract state machines; Graph; Data mining; Programming language; Class diagram; State (computer science); Theoretical computer science; Database; Software","score_opus":0.08609689577891642,"score_gpt":0.30227431284458683,"score_spread":0.2161774170656704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191325165","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.005059685,0.000112138936,0.99042636,0.0000502389,0.000026316713,0.00006344188,0.000063987405,0.0028861032,0.0013117406],"genre_scores_gemma":[0.10426741,0.00025147106,0.89200985,0.0000629917,0.000020186824,0.00020264064,0.0006113927,0.0010023727,0.0015717032],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99579287,0.0015163397,0.0003595322,0.00037958124,0.0017929851,0.0001586378],"domain_scores_gemma":[0.98994243,0.0067375,0.0004042727,0.0014015898,0.0013739669,0.00014018458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043543703,0.0013149757,0.00091589213,0.0033586302,0.000317215,0.0016897524,0.0015294192,0.0011168252,0.0037479284],"category_scores_gemma":[0.012577983,0.0009267596,0.001113218,0.0018914128,0.00058235414,0.0038451948,0.0018319974,0.0013088257,0.0011373846],"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.0003251193,0.00040141537,0.0030826463,0.00075452344,0.00015037644,0.00049666315,0.0007513618,0.076392405,0.05397265,0.05350487,0.0050527533,0.8051153],"study_design_scores_gemma":[0.00009795774,0.00026155592,0.0013501708,0.00039024677,0.00023708004,0.0005964658,0.00015997911,0.85123086,0.050355054,0.07020188,0.025029132,0.00008947916],"about_ca_topic_score_codex":0.0017542704,"about_ca_topic_score_gemma":0.0024160463,"teacher_disagreement_score":0.0043543703,"about_ca_system_score_codex":0.000562046,"about_ca_system_score_gemma":0.00086875097,"threshold_uncertainty_score":0.023028374},"labels":[],"label_agreement":null},{"id":"W1914481770","doi":"10.1007/978-3-540-75759-7_11","title":"Rapid Voxel Classification Methodology for Interactive 3D Medical Image Visualization","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Western University","funders":"","keywords":"Computer science; Volume rendering; Visualization; Rendering (computer graphics); Voxel; Artificial intelligence; Computer vision; Computation; Volume (thermodynamics); Lookup table; Interactive visualization; Medical imaging; Image quality; Image (mathematics); Data visualization; Computer graphics (images); Algorithm","score_opus":0.05976341126512978,"score_gpt":0.3997509683678337,"score_spread":0.3399875571027039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914481770","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.0015453692,0.00008953865,0.9954222,0.00007876584,0.000021107366,0.00004612326,0.00006667039,0.0023913549,0.00033890194],"genre_scores_gemma":[0.02318421,0.00020455144,0.9742755,0.000070890994,0.000025597585,0.00013937708,0.00018443624,0.0007601788,0.0011551698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921036,0.00018997642,0.000043818804,0.00006977633,0.00042748652,0.00005851331],"domain_scores_gemma":[0.9978053,0.0010366323,0.00013952724,0.00033666546,0.0005958197,0.0000860888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014759465,0.0011122173,0.0009822433,0.0020840652,0.0005064763,0.0024036693,0.0020065715,0.0011540969,0.011799991],"category_scores_gemma":[0.0039250413,0.0010915529,0.00083151594,0.0015437558,0.00042328733,0.0011229995,0.0015908843,0.0017933352,0.002370696],"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.00031852993,0.000102158905,0.0010074715,0.0005097276,0.00015371125,0.00023886589,0.00032198007,0.03762245,0.11332863,0.022993116,0.016739713,0.80666363],"study_design_scores_gemma":[0.00007781514,0.00010193102,0.0008970422,0.00005243538,0.000053227202,0.0009576069,0.00009339776,0.86687464,0.0864069,0.015848013,0.02855575,0.00008120243],"about_ca_topic_score_codex":0.0021780988,"about_ca_topic_score_gemma":0.00457973,"teacher_disagreement_score":0.011799991,"about_ca_system_score_codex":0.000598618,"about_ca_system_score_gemma":0.0013194304,"threshold_uncertainty_score":0.039474905},"labels":[],"label_agreement":null},{"id":"W191486739","doi":"10.1007/978-3-642-37119-6_18","title":"Extracting Attack Scenarios Using Intrusion Semantics","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Intrusion detection system; Semantics (computer science); Intrusion; Ontology; Attack patterns; Attack model; Computer security; Data mining","score_opus":0.03128147245684225,"score_gpt":0.26443595342085796,"score_spread":0.2331544809640157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191486739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09353263,0.0013107816,0.87527657,0.00046376674,0.00018067526,0.0005005794,0.0036666451,0.011722427,0.013345862],"genre_scores_gemma":[0.58146936,0.0017161599,0.40259704,0.00013686536,0.00014192048,0.00020235231,0.010123958,0.00067989493,0.0029324205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912447,0.00008992071,0.00010300792,0.00020968994,0.00039049942,0.0000823358],"domain_scores_gemma":[0.99865663,0.00058171706,0.00018901244,0.00022654988,0.00027734533,0.00006862716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050005526,0.0022590526,0.0008322191,0.0074069253,0.00062735635,0.0021140268,0.0009914964,0.00094438373,0.00226851],"category_scores_gemma":[0.0031571304,0.0006678235,0.0018803836,0.003206314,0.0006577799,0.005270306,0.0018289813,0.0011569132,0.001529056],"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.00043385848,0.0004953001,0.020463891,0.00097038597,0.00036144326,0.0038661405,0.00092004245,0.07430216,0.035997476,0.049010437,0.01988273,0.79329616],"study_design_scores_gemma":[0.000038701866,0.00023089355,0.006121467,0.00035022997,0.000358174,0.004919856,0.001102592,0.7335198,0.03689658,0.18162589,0.034747444,0.000088424364],"about_ca_topic_score_codex":0.0009669551,"about_ca_topic_score_gemma":0.0016667861,"teacher_disagreement_score":0.0074069253,"about_ca_system_score_codex":0.0005044679,"about_ca_system_score_gemma":0.0007686738,"threshold_uncertainty_score":0.0075889826},"labels":[],"label_agreement":null},{"id":"W1915057100","doi":"10.1007/978-3-319-11662-4_13","title":"Bayesian Reinforcement Learning with Exploration","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Reinforcement learning; Computer science; Minimax; Sample complexity; Bayesian probability; Class (philosophy); Artificial intelligence; Sample (material); Machine learning; Mathematical optimization; Mathematics","score_opus":0.06435445389814211,"score_gpt":0.3528636545911634,"score_spread":0.28850920069302133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1915057100","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.0042221104,0.0015142598,0.96379495,0.00055694446,0.0001866429,0.000028366063,0.000051383468,0.00035906985,0.029286385],"genre_scores_gemma":[0.54834276,0.0026029465,0.35728094,0.0004719336,0.00050807244,0.00032770232,0.00026751714,0.0003742274,0.089823924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999549,0.00018184354,0.000015924887,0.00007941557,0.00013807973,0.00003569174],"domain_scores_gemma":[0.9991364,0.0006099384,0.000042298663,0.00008407466,0.00008450045,0.000042897624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009557473,0.0007787569,0.0008052648,0.00033086454,0.00026060228,0.00095956813,0.0009706297,0.0010327101,0.009379435],"category_scores_gemma":[0.003842843,0.00041436433,0.00040961336,0.00048770758,0.0008005434,0.0011884477,0.0013165433,0.0019487935,0.0017200534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010415587,0.00008819831,0.00028883954,0.00015230758,0.00005774084,0.000055909502,0.00007004421,0.44475418,0.001306476,0.2554016,0.012653881,0.28506672],"study_design_scores_gemma":[0.000019415635,0.00003479699,0.0000894896,0.000030948526,0.000010927723,0.000035051984,0.000006277957,0.80561745,0.00048638834,0.18758094,0.006076556,0.000011702244],"about_ca_topic_score_codex":0.00094886584,"about_ca_topic_score_gemma":0.0011346423,"teacher_disagreement_score":0.009379435,"about_ca_system_score_codex":0.0006083237,"about_ca_system_score_gemma":0.00061425474,"threshold_uncertainty_score":0.031377375},"labels":[],"label_agreement":null},{"id":"W1916861818","doi":"10.1007/978-3-642-20757-0_11","title":"Stochastic Scheduling for Underwater Sensor Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aloha; Computer science; Scheduling (production processes); Distributed computing; Computer network; Real-time computing; Mathematical optimization; Wireless; Telecommunications; Throughput","score_opus":0.02870785328053989,"score_gpt":0.2269831689363504,"score_spread":0.19827531565581052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916861818","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.0035040197,0.007929332,0.96810013,0.0006009066,0.0005637342,0.00004559863,0.000062279476,0.00021492435,0.018979063],"genre_scores_gemma":[0.39651772,0.03732249,0.49837014,0.00076375355,0.002380129,0.0005696237,0.00047636207,0.00045542786,0.06314439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.00010037034,0.000016632244,0.000038532486,0.00013852691,0.000018452225],"domain_scores_gemma":[0.9996966,0.0001843666,0.000026461896,0.000027745797,0.000047991536,0.000016786713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005339524,0.00065330573,0.00043868367,0.00025518396,0.00030596147,0.00067464786,0.0007138175,0.0005314213,0.0027040965],"category_scores_gemma":[0.0012791065,0.0002345854,0.00033330516,0.00066422793,0.000502346,0.0006685832,0.00056559744,0.00096646923,0.0007985869],"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.000031682295,0.000040697403,0.00015321362,0.0003286466,0.00003069272,0.00012871323,0.00011825975,0.4092309,0.003988814,0.41815698,0.0147878975,0.15300348],"study_design_scores_gemma":[0.00001622336,0.00006106316,0.00015659817,0.00007881854,0.00001478284,0.00010407661,0.000047635654,0.7001555,0.0010819421,0.23000799,0.06825571,0.000019658291],"about_ca_topic_score_codex":0.0018030796,"about_ca_topic_score_gemma":0.0019866705,"teacher_disagreement_score":0.0027040965,"about_ca_system_score_codex":0.0010152932,"about_ca_system_score_gemma":0.0010589508,"threshold_uncertainty_score":0.009046078},"labels":[],"label_agreement":null},{"id":"W1916886752","doi":"10.1007/3-540-48285-7_35","title":"Secret-Key Reconciliation by Public Discussion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":790,"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; Collège Montmorency","funders":"","keywords":"Alice (programming language); Key (lock); Computer science; Channel (broadcasting); Alice and Bob; Computer security; Construct (python library); Protocol (science); Theoretical computer science; Binary number; Algorithm; Computer network; Mathematics; Arithmetic; Programming language","score_opus":0.02534850090791529,"score_gpt":0.25374691767162405,"score_spread":0.22839841676370876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916886752","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.013851777,0.001089616,0.8808136,0.004182942,0.0011753753,0.0005132137,0.00043665245,0.002382172,0.09555459],"genre_scores_gemma":[0.6676511,0.0013198259,0.21366759,0.0013660282,0.0010377269,0.00095182826,0.0009897443,0.0016899965,0.11132622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99227035,0.0031900294,0.0003911802,0.001033234,0.0019418825,0.0011732206],"domain_scores_gemma":[0.990842,0.003570606,0.0003418862,0.00432451,0.0007519249,0.00016906914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005017261,0.0013856495,0.0015083345,0.0017447751,0.0032795833,0.005345078,0.003120434,0.0030000214,0.027727205],"category_scores_gemma":[0.016401064,0.0009360862,0.0016975397,0.0023854554,0.003353149,0.017077953,0.009804395,0.0042336476,0.011218813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045673022,0.00011126185,0.00014212134,0.00022494594,0.000061209044,0.00014762983,0.00043822397,0.0052793934,0.0027472244,0.84743714,0.021058729,0.12189546],"study_design_scores_gemma":[0.000108123095,0.000045614757,0.0000885988,0.000082629485,0.0000595953,0.0003295834,0.00012005527,0.030035097,0.015354822,0.9030906,0.050633464,0.00005181938],"about_ca_topic_score_codex":0.0001934912,"about_ca_topic_score_gemma":0.00019844969,"teacher_disagreement_score":0.027727205,"about_ca_system_score_codex":0.0020091706,"about_ca_system_score_gemma":0.0021875645,"threshold_uncertainty_score":0.09275681},"labels":[],"label_agreement":null},{"id":"W1917810517","doi":"10.1007/978-3-642-31037-9_15","title":"Biometric Monitoring as a Persuasive Technology: Ensuring Patients Visit Health Centers in India’s Slums","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data-Driven Disease Surveillance","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Attendance; Slum; Medicine; Schedule; Biometrics; Developing country; Medical emergency; mHealth; Family medicine; Environmental health; Computer security; Nursing; Computer science; Economic growth; Population","score_opus":0.01485278164047654,"score_gpt":0.2821481940210346,"score_spread":0.26729541238055804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917810517","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.62593395,0.023427693,0.009101483,0.097775556,0.0019986052,0.00012132909,0.00040308802,0.00052972493,0.2407085],"genre_scores_gemma":[0.9713283,0.005225169,0.0041356864,0.0021764976,0.00017904963,0.000028940138,0.000061009494,0.000026461401,0.016838895],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99946195,0.00023836564,0.000022967064,0.00003975379,0.00010849003,0.00012841324],"domain_scores_gemma":[0.99906033,0.0005730036,0.00010877468,0.000025434578,0.000089324785,0.0001431598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073693675,0.00025215762,0.00012724975,0.000563721,0.0014567004,0.0023313265,0.00077152695,0.0009713874,0.0035512787],"category_scores_gemma":[0.0017884797,0.00016790823,0.00014712533,0.00085538375,0.0010376999,0.0012810291,0.0011773249,0.0013974234,0.0007060711],"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.00016922658,0.00030097234,0.081266396,0.0011779106,0.000035199868,0.0027522082,0.14293033,0.0006893322,0.007609429,0.028845055,0.08681282,0.6474112],"study_design_scores_gemma":[0.00003195372,0.0007319985,0.17443645,0.0013494131,0.00012802899,0.005795709,0.3185617,0.003425515,0.007953236,0.011044289,0.4763635,0.00017803992],"about_ca_topic_score_codex":0.009476748,"about_ca_topic_score_gemma":0.019732391,"teacher_disagreement_score":0.009476748,"about_ca_system_score_codex":0.0014336435,"about_ca_system_score_gemma":0.0023448754,"threshold_uncertainty_score":0.018843174},"labels":[],"label_agreement":null},{"id":"W1917877903","doi":"10.1007/978-3-540-75757-3_50","title":"Quantitative Comparison of Two Cortical Surface Extraction Methods Using MRI Phantoms","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":17,"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":"Rigshospitalet; McGill University","keywords":"Computer science; Extraction (chemistry); Artificial intelligence; Surface (topology); Computer vision; Pattern recognition (psychology); Mathematics; Chemistry; Geometry; Chromatography","score_opus":0.09164703413938813,"score_gpt":0.5256320067019915,"score_spread":0.4339849725626034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917877903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22572601,0.0034835413,0.7604961,0.00047965912,0.00030829472,0.00027223004,0.001015479,0.005297869,0.0029208865],"genre_scores_gemma":[0.6271159,0.001785842,0.36339012,0.00022630823,0.00009986687,0.00022266815,0.0014343492,0.0018897478,0.0038351752],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992619,0.00017670351,0.000066253015,0.000103917286,0.00031457757,0.0000766162],"domain_scores_gemma":[0.9953205,0.002844778,0.0003022151,0.00039654569,0.0010395142,0.00009649073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023582266,0.0014108509,0.0008701854,0.0024170878,0.00035378698,0.0020822226,0.0008255588,0.0016026221,0.0033788309],"category_scores_gemma":[0.008363407,0.00076634577,0.0006290624,0.0013904255,0.0005184665,0.0012618636,0.00083269813,0.00052830187,0.0008872802],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004641431,0.00033563885,0.004984922,0.0018196207,0.0004299946,0.00043626066,0.0005327251,0.039999947,0.55586493,0.0024356649,0.003131401,0.38538745],"study_design_scores_gemma":[0.0003957877,0.0010727858,0.028546812,0.00019562927,0.0006971214,0.0039298064,0.00038999697,0.39630115,0.55654955,0.0035133017,0.0081087435,0.00029935205],"about_ca_topic_score_codex":0.0013603293,"about_ca_topic_score_gemma":0.0016066488,"teacher_disagreement_score":0.0033788309,"about_ca_system_score_codex":0.00037964035,"about_ca_system_score_gemma":0.0006560123,"threshold_uncertainty_score":0.012471676},"labels":[],"label_agreement":null},{"id":"W1918301124","doi":"10.1007/978-3-319-08171-7_12","title":"An Effective Algorithm for Peptide de novo Sequencing from Mixture MS/MS Spectra","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Computer science; Mass spectrum; Algorithm; Spectral line; Fragmentation (computing); Identification (biology); Proteomics; Mass spectrometry; Chemistry; Chromatography; Physics; Biology","score_opus":0.009705856015131159,"score_gpt":0.2644436503509369,"score_spread":0.2547377943358058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918301124","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.0015366487,0.000105559,0.9960995,0.000039979568,0.000038715396,0.000042939537,0.00006105232,0.0018424903,0.00023308992],"genre_scores_gemma":[0.0074168523,0.0000677451,0.99108195,0.000042511576,0.000023515171,0.00007635922,0.00024993543,0.00019732695,0.0008437558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989029,0.00015772691,0.00010913541,0.00030619814,0.00045454295,0.00006953436],"domain_scores_gemma":[0.99853647,0.0005844232,0.00007931002,0.0002557767,0.00047783853,0.00006622089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017009808,0.0017732076,0.0013013887,0.0016205304,0.0011812212,0.0020910874,0.0026685377,0.0017299461,0.004638974],"category_scores_gemma":[0.0037072704,0.0010843839,0.001218173,0.0018763035,0.0007144426,0.0021012493,0.00290921,0.0024107974,0.004733585],"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.00035116143,0.00011710205,0.0004059306,0.00017153728,0.00009493972,0.00013836497,0.00007998921,0.029807974,0.04215714,0.008176144,0.006435594,0.9120641],"study_design_scores_gemma":[0.000084398685,0.00008070086,0.00054273574,0.00002484073,0.00005816269,0.00049435766,0.000037656264,0.92417747,0.033554118,0.029453013,0.01143837,0.000054096716],"about_ca_topic_score_codex":0.0015386789,"about_ca_topic_score_gemma":0.002720724,"teacher_disagreement_score":0.004638974,"about_ca_system_score_codex":0.000625493,"about_ca_system_score_gemma":0.0014843894,"threshold_uncertainty_score":0.015518904},"labels":[],"label_agreement":null},{"id":"W1918874199","doi":"10.1007/11424918_13","title":"A Bayesian Model to Smooth Telepointer Jitter","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Jitter; Cursor (databases); Bayesian network; Artificial intelligence; Bayesian probability; Gesture; Computer vision; Machine learning","score_opus":0.013909786075580128,"score_gpt":0.23830387570862302,"score_spread":0.2243940896330429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918874199","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.0088954,0.00032598988,0.9884444,0.00033987057,0.000058552992,0.000026369056,0.00013197889,0.00032110367,0.001456403],"genre_scores_gemma":[0.72671384,0.0016786661,0.2318604,0.00046234668,0.00043374923,0.00029234964,0.00074782426,0.00063694286,0.037173886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.00038581312,0.000056038443,0.00036647156,0.00027256564,0.00017706574],"domain_scores_gemma":[0.9946496,0.0036190166,0.00045971686,0.00042921896,0.0006709618,0.00017147002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004131038,0.0011094048,0.0022606936,0.0014311689,0.0009125789,0.0022184027,0.003792598,0.0040467572,0.0057168743],"category_scores_gemma":[0.016584264,0.0023623754,0.0013403925,0.0019039996,0.0016512376,0.004580617,0.0017174287,0.0034087026,0.0015093733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012876366,0.00005045218,0.0004785624,0.000054240918,0.00004681008,0.000061854524,0.000081957915,0.89907396,0.0008832756,0.07165229,0.0018188283,0.025669022],"study_design_scores_gemma":[0.000009247112,0.000009496609,0.00011766703,0.000006042622,0.000010867231,0.000015611025,0.0000044239637,0.98021,0.00011539774,0.019134136,0.00035377283,0.000013373541],"about_ca_topic_score_codex":0.014293485,"about_ca_topic_score_gemma":0.009808487,"teacher_disagreement_score":0.014293485,"about_ca_system_score_codex":0.0023869255,"about_ca_system_score_gemma":0.001358423,"threshold_uncertainty_score":0.028420568},"labels":[],"label_agreement":null},{"id":"W1919650993","doi":"10.1007/978-3-642-21875-0_14","title":"Computability of the Radon-Nikodym Derivative","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computability; Measure (data warehouse); Derivative (finance); Operator (biology); Discrete mathematics; Computer science; Mathematics; Algebra over a field; Pure mathematics; Data mining","score_opus":0.025102700577793163,"score_gpt":0.23717267869667738,"score_spread":0.21206997811888423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919650993","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25058967,0.009481308,0.35280547,0.0057476056,0.0005349671,0.00004977616,0.00041678664,0.0004336928,0.37994072],"genre_scores_gemma":[0.9307996,0.0030768528,0.034433916,0.00034770273,0.0005334455,0.00005593498,0.00023861094,0.00014267092,0.030371219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00013034609,0.00003089066,0.00015843652,0.00021878067,0.00006895653],"domain_scores_gemma":[0.99872655,0.000840615,0.00006663212,0.00018785862,0.00010281785,0.000075374875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010931075,0.0005064568,0.0008356221,0.0010688626,0.0008972308,0.0038338436,0.00092191,0.00090077065,0.005097806],"category_scores_gemma":[0.003250164,0.00040666494,0.0009929952,0.00085590436,0.0043078004,0.007840184,0.0016628315,0.0034629297,0.0008441648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006669235,0.0000037686318,0.000042691063,0.000011668405,0.0000019921663,0.000015016573,0.000037760266,0.0004074319,0.0001640663,0.9972588,0.00024225168,0.0018079741],"study_design_scores_gemma":[0.0000044679587,0.000003788726,0.000076464516,0.0000056490417,0.000002353562,0.000040611278,0.0000120997365,0.0028925587,0.0002234871,0.9948196,0.0019153978,0.000003567491],"about_ca_topic_score_codex":0.00066644885,"about_ca_topic_score_gemma":0.0004354427,"teacher_disagreement_score":0.005097806,"about_ca_system_score_codex":0.0017340917,"about_ca_system_score_gemma":0.00065487664,"threshold_uncertainty_score":0.017053843},"labels":[],"label_agreement":null},{"id":"W1919787233","doi":"10.1007/978-3-540-89982-2_33","title":"Lparse Programs Revisited: Semantics and Representation of Aggregates","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Semantics (computer science); Well-founded semantics; Programming language; Stable model semantics; Representation (politics); Class (philosophy); Theoretical computer science; Operational semantics; Logic program; Formal semantics (linguistics); Program transformation; Logic programming; Denotational semantics; Artificial intelligence","score_opus":0.02597617840637696,"score_gpt":0.25780163860386535,"score_spread":0.2318254601974884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919787233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027589664,0.003062783,0.93967915,0.0035661752,0.00025714212,0.000050012506,0.00039817646,0.0012194719,0.02417743],"genre_scores_gemma":[0.48548016,0.0036147658,0.4834634,0.0011011782,0.00081146683,0.00025332923,0.001143572,0.0009120239,0.023220187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982577,0.0005509987,0.00018784958,0.00031872056,0.0005299434,0.00015472127],"domain_scores_gemma":[0.99746394,0.0009385388,0.00021346321,0.0008184879,0.00043939624,0.00012625392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147318,0.0005842424,0.0010961023,0.0013425141,0.0013200092,0.0087219365,0.0034541436,0.0021714442,0.005949216],"category_scores_gemma":[0.006059216,0.0007813169,0.0010804109,0.0043451353,0.004551196,0.015234666,0.0034747485,0.005709117,0.0010584192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021307802,0.000010702207,0.00008766519,0.000044196757,0.00000643978,0.000052788746,0.00040690321,0.0011827863,0.00040721474,0.981948,0.0016953711,0.0141366245],"study_design_scores_gemma":[0.000008419849,0.000009364024,0.00007103221,0.00003347443,0.000017572069,0.00010074401,0.00019472065,0.015680138,0.0008721961,0.9691739,0.013827766,0.000010613268],"about_ca_topic_score_codex":0.001999611,"about_ca_topic_score_gemma":0.0018603348,"teacher_disagreement_score":0.0087219365,"about_ca_system_score_codex":0.0014476107,"about_ca_system_score_gemma":0.0012307973,"threshold_uncertainty_score":0.01990217},"labels":[],"label_agreement":null},{"id":"W1920416369","doi":"10.1007/11693383_21","title":"Accelerated Verification of ECDSA Signatures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Computer science; ElGamal encryption; Signature (topology); Digital Signature Algorithm; ElGamal signature scheme; Digital signature; Public-key cryptography; Elliptic curve cryptography; Computer security; Encryption; Mathematics; Blind signature","score_opus":0.014799100465216864,"score_gpt":0.23481036906152394,"score_spread":0.22001126859630707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920416369","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.20381738,0.0018515066,0.7300204,0.0009028274,0.00095267314,0.00027468824,0.0007387658,0.013978802,0.047462925],"genre_scores_gemma":[0.7871326,0.00035053946,0.19086058,0.00026317316,0.00021307004,0.00010032939,0.00079322275,0.00068385823,0.01960252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970907,0.0005970203,0.00017250127,0.00039749805,0.0012943884,0.00044782698],"domain_scores_gemma":[0.9955765,0.0011430053,0.00018781591,0.002021051,0.0009564877,0.00011516903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013417803,0.000941298,0.000990264,0.0010335678,0.0007068282,0.0018696685,0.0013023168,0.0010584565,0.012672924],"category_scores_gemma":[0.0035974137,0.00050396856,0.00081889005,0.0008542801,0.0010457211,0.00300528,0.0026548163,0.0014990182,0.004452736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034998618,0.0003082936,0.0018419194,0.00051232515,0.00010896958,0.00055919314,0.00032335523,0.040684137,0.15903427,0.21510081,0.02174373,0.5562832],"study_design_scores_gemma":[0.0004642455,0.00064878515,0.0014895308,0.00014140828,0.00010916051,0.0012135379,0.00012534294,0.38995728,0.34575796,0.20296182,0.057033256,0.000097748816],"about_ca_topic_score_codex":0.0005570331,"about_ca_topic_score_gemma":0.0010145482,"teacher_disagreement_score":0.012672924,"about_ca_system_score_codex":0.0010953523,"about_ca_system_score_gemma":0.0015245054,"threshold_uncertainty_score":0.042395175},"labels":[],"label_agreement":null},{"id":"W192120928","doi":"10.1007/978-3-662-44124-4_9","title":"Categories of Coalgebras with Monadic Homomorphisms","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Homomorphism; Unary operation; Graph rewriting; Monad (category theory); Functor; Galois connection; Coalgebra; Computer science; Graph; Algebraic structure; Commutative property; Mathematics; Term (time); Substitution (logic); Algebraic number; Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.014036554648105305,"score_gpt":0.2143142818376543,"score_spread":0.200277727189549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192120928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12881231,0.00715667,0.6398335,0.002509414,0.0012715472,0.00021405864,0.0006776927,0.0022555538,0.21726929],"genre_scores_gemma":[0.8546282,0.0020300434,0.09894388,0.00074899243,0.00050461903,0.00025489723,0.0005859615,0.00030698598,0.0419964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814916,0.00057911105,0.00013886753,0.00035017845,0.0006028169,0.00017987461],"domain_scores_gemma":[0.99840826,0.0006404948,0.000085776686,0.00036339348,0.00032482462,0.00017726891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021462026,0.00040587102,0.00052397145,0.0024074032,0.0014625724,0.004105435,0.0009912527,0.0009585749,0.0051875273],"category_scores_gemma":[0.0021786636,0.00047493758,0.0011729448,0.0018363267,0.004419146,0.0057894913,0.0039181923,0.0020515732,0.0010236338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057267257,0.0000050428794,0.00006330489,0.000025125582,0.0000042327024,0.000043439206,0.0002369949,0.00021163342,0.00034797608,0.9944378,0.0004685425,0.0041502034],"study_design_scores_gemma":[0.0000067841966,0.000014992231,0.00019198934,0.000030014862,0.000008637367,0.00017083428,0.00015540775,0.0016998951,0.0006870258,0.96740717,0.029615594,0.000011690302],"about_ca_topic_score_codex":0.0015973358,"about_ca_topic_score_gemma":0.0008116961,"teacher_disagreement_score":0.0051875273,"about_ca_system_score_codex":0.0019677428,"about_ca_system_score_gemma":0.00081143784,"threshold_uncertainty_score":0.017354071},"labels":[],"label_agreement":null},{"id":"W1921331994","doi":"10.1007/3-540-48071-4_18","title":"On the Design of SP Networks from an Information Theoretic Point of View","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Information leakage; Invariant (physics); Cryptography; Leakage (economics); Discrete mathematics; Theoretical computer science; Computer science; Equivalence (formal languages); Mathematics; Combinatorics; Computer network; Algorithm","score_opus":0.02569431493111165,"score_gpt":0.27050025381020937,"score_spread":0.2448059388790977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921331994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012393813,0.0007763594,0.95941645,0.0010149805,0.00012686416,0.00009728979,0.00007772257,0.00022811518,0.025868267],"genre_scores_gemma":[0.46153992,0.0028978842,0.51671714,0.00066919735,0.0003259203,0.00039053484,0.00025777766,0.00023912062,0.016962534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.0005151314,0.0000875695,0.00018635743,0.0003884656,0.0001376603],"domain_scores_gemma":[0.99773586,0.001194262,0.00013582967,0.0005460374,0.0002961721,0.000091827045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018496872,0.00075782323,0.00077970815,0.000877935,0.0010523681,0.0027759087,0.002079366,0.001702207,0.005922551],"category_scores_gemma":[0.005331047,0.00068209454,0.0006664822,0.0011307375,0.0022538076,0.00618391,0.0023946373,0.0021395057,0.0011975322],"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.000047482023,0.000020612382,0.00011792937,0.00012526655,0.000014301355,0.00005557785,0.00010779813,0.029843813,0.0019873502,0.92849594,0.0022251173,0.036958754],"study_design_scores_gemma":[0.000017724446,0.00007036732,0.00006767869,0.0000705838,0.00002267389,0.00016903732,0.000058887083,0.13304141,0.0025085409,0.850158,0.013798292,0.000016905913],"about_ca_topic_score_codex":0.00050275825,"about_ca_topic_score_gemma":0.000999257,"teacher_disagreement_score":0.005922551,"about_ca_system_score_codex":0.0011294817,"about_ca_system_score_gemma":0.0009765769,"threshold_uncertainty_score":0.019812942},"labels":[],"label_agreement":null},{"id":"W1921471943","doi":"10.1007/978-3-642-30618-1_3","title":"Automatic Detection and Localization of da Vinci Tool Tips in 3D Ultrasound","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Laparoscopic radical prostatectomy; Fiducial marker; Imaging phantom; Da Vinci Surgical System; 3D ultrasound; Prostatectomy; Ultrasound; Artificial intelligence; Medicine; Computer science; Computer vision; Robotic surgery; Prostate cancer; Radiology; Cancer","score_opus":0.009347150710365994,"score_gpt":0.2012632823115986,"score_spread":0.1919161316012326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921471943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03790268,0.0011690414,0.95288676,0.00019010616,0.000120008735,0.000107336666,0.00025366482,0.003332562,0.0040378748],"genre_scores_gemma":[0.25318015,0.0010515822,0.73843235,0.00014243987,0.000046422367,0.00013406905,0.0004940271,0.00043567625,0.0060833143],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900204,0.000097225944,0.0000461878,0.00020768632,0.00054859865,0.00009823907],"domain_scores_gemma":[0.99876297,0.00048660932,0.00014476664,0.00023020328,0.00033068564,0.000044843455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062934606,0.001035536,0.00083193753,0.0020476114,0.00037224678,0.0016261959,0.0018553187,0.0017294226,0.0033156076],"category_scores_gemma":[0.0021860308,0.0011707201,0.00050327537,0.0012470619,0.0006113959,0.0010112181,0.001193002,0.0007760352,0.0025153118],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015534417,0.000045570774,0.0033526816,0.00032349408,0.00004296336,0.00026239766,0.00035651843,0.008850214,0.273623,0.0040611136,0.0066283057,0.70229846],"study_design_scores_gemma":[0.000061848325,0.00041630928,0.042180818,0.0003235281,0.00010248285,0.006637496,0.00044343012,0.48312768,0.42448205,0.006548974,0.035368163,0.00030725496],"about_ca_topic_score_codex":0.0009821178,"about_ca_topic_score_gemma":0.0022318698,"teacher_disagreement_score":0.0033156076,"about_ca_system_score_codex":0.00034004758,"about_ca_system_score_gemma":0.0005928467,"threshold_uncertainty_score":0.011091769},"labels":[],"label_agreement":null},{"id":"W1921760157","doi":"10.1007/978-3-642-10268-4_73","title":"Improved Online Support Vector Machines Spam Filtering Using String Kernels","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Concordia University","funders":"","keywords":"Computer science; Bottleneck; Support vector machine; String (physics); Spamming; Feature vector; Feature (linguistics); Task (project management); Machine learning; Spambot; Artificial intelligence; Data mining; The Internet; World Wide Web","score_opus":0.02601324757649461,"score_gpt":0.2625294759370722,"score_spread":0.2365162283605776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921760157","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.050871726,0.00043564336,0.9418001,0.00014970358,0.00022796528,0.000039683244,0.00006517414,0.0051248423,0.0012851333],"genre_scores_gemma":[0.50823987,0.00028422914,0.4801167,0.00019207475,0.00027181747,0.0000740832,0.00050376623,0.0003426592,0.009974772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986204,0.0003046292,0.00011558837,0.00021097447,0.00059107435,0.00015738003],"domain_scores_gemma":[0.9965328,0.0010723564,0.0001911237,0.00083375577,0.0012446844,0.00012528963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016967335,0.00096324127,0.0019259178,0.0011655171,0.0006338219,0.0014526732,0.0013311292,0.0013373666,0.0034167173],"category_scores_gemma":[0.00508238,0.0004646263,0.00097105413,0.0011741095,0.0003835652,0.0028234879,0.0015393551,0.0014429367,0.0026084883],"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.0008865818,0.0006505855,0.0017143146,0.0001197784,0.00017632786,0.00011132764,0.0000711226,0.06441571,0.033711117,0.0061665345,0.0062892684,0.8856875],"study_design_scores_gemma":[0.00002081133,0.00007250061,0.00040270112,0.000004032387,0.000033590397,0.000052081523,0.00000827355,0.9883442,0.007776007,0.0023312422,0.00094236113,0.000012217176],"about_ca_topic_score_codex":0.0021767593,"about_ca_topic_score_gemma":0.0020964993,"teacher_disagreement_score":0.0034167173,"about_ca_system_score_codex":0.00047325168,"about_ca_system_score_gemma":0.0009681674,"threshold_uncertainty_score":0.011430085},"labels":[],"label_agreement":null},{"id":"W192218065","doi":"10.1007/978-3-642-37087-8_2","title":"A Strategy for Optimizing a Multi-site Query in a Distributed Spatial Database","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Database; Distributed database; Query optimization; Spatiotemporal database; Information retrieval; Spatial database; Database theory; View; Spatial query; Data mining; Database design; Sargable; Database tuning; Spatial analysis; Web search query; Search engine","score_opus":0.036795136319182964,"score_gpt":0.27006818067291993,"score_spread":0.23327304435373697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192218065","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.037649557,0.00016551575,0.9553847,0.00037477122,0.000053234162,0.00023074324,0.00012882466,0.002623582,0.0033890805],"genre_scores_gemma":[0.3321789,0.00012745727,0.6620033,0.00016630936,0.000059842147,0.00019004704,0.00027707446,0.00037445474,0.0046226224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982564,0.00041418892,0.00013683586,0.00028602907,0.0006823769,0.00022418392],"domain_scores_gemma":[0.99807525,0.0006080136,0.00007948459,0.0007529897,0.0003451896,0.00013911372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015889193,0.0010977774,0.0018438945,0.001150831,0.0016527027,0.0026557257,0.0033516448,0.0018921862,0.0044943416],"category_scores_gemma":[0.0047739875,0.00085100025,0.0008747294,0.0023759007,0.0011222,0.0030133228,0.002888893,0.001335332,0.001176134],"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.0017631066,0.0010449265,0.005780877,0.00034876348,0.00028326758,0.00080301525,0.0011651434,0.2369526,0.124448225,0.108796805,0.02244989,0.49616334],"study_design_scores_gemma":[0.000109393,0.00017464388,0.000510569,0.0000077964505,0.00009143292,0.00025894865,0.00029065306,0.9583479,0.014358125,0.022792786,0.0030163068,0.000041417323],"about_ca_topic_score_codex":0.005331806,"about_ca_topic_score_gemma":0.0073191565,"teacher_disagreement_score":0.005331806,"about_ca_system_score_codex":0.0009496179,"about_ca_system_score_gemma":0.0017152604,"threshold_uncertainty_score":0.015035033},"labels":[],"label_agreement":null},{"id":"W192243523","doi":"10.1007/978-3-319-06483-3_19","title":"Text Representation Using Multi-level Latent Dirichlet Allocation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Latent Dirichlet allocation; Representation (politics); Computer science; Granularity; Artificial intelligence; Topic model; Pattern recognition (psychology); Machine learning; Natural language processing","score_opus":0.08373228379650947,"score_gpt":0.3067533469916922,"score_spread":0.22302106319518272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192243523","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.0032031985,0.00066131965,0.9926644,0.0002365312,0.00011481573,0.000076482305,0.00051470875,0.0019370721,0.000591414],"genre_scores_gemma":[0.17779915,0.0015744457,0.79818916,0.00044508156,0.0005587639,0.000866771,0.008355768,0.0009907633,0.011220156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698645,0.0011977153,0.00029646888,0.0007835001,0.0004935522,0.0002423676],"domain_scores_gemma":[0.99562633,0.002760095,0.00020853631,0.00062472984,0.00066090014,0.00011947684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025489053,0.0013418352,0.0022305907,0.0037446925,0.0011563237,0.0030079458,0.0028634013,0.0022617758,0.005844774],"category_scores_gemma":[0.009851437,0.00086241256,0.002956522,0.004524066,0.00083271717,0.0039923997,0.0028206822,0.0035079245,0.0054370337],"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.00076787925,0.0003423077,0.0008357466,0.00054665055,0.0002559435,0.00021060728,0.00041564618,0.09850766,0.013003879,0.02829876,0.02281383,0.83400106],"study_design_scores_gemma":[0.00004084852,0.0000444342,0.00023461685,0.00003380598,0.00006457047,0.00008939026,0.000056091456,0.9582333,0.004693901,0.03232244,0.0041514947,0.000035076973],"about_ca_topic_score_codex":0.0041398006,"about_ca_topic_score_gemma":0.0049941624,"teacher_disagreement_score":0.005844774,"about_ca_system_score_codex":0.0012304825,"about_ca_system_score_gemma":0.0015799423,"threshold_uncertainty_score":0.019552708},"labels":[],"label_agreement":null},{"id":"W192282920","doi":"10.1007/978-3-642-24971-6_1","title":"Born’s Rule as an Empirical Addition to Probabilistic Coherence","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Perimeter Institute","funders":"","keywords":"Coherence (philosophical gambling strategy); Computer science; Normative; Conditional probability; Quantum; Quantum probability; Mathematics; Mathematical economics; Quantum process; Epistemology; Quantum mechanics; Physics; Philosophy; Statistics; Quantum dynamics","score_opus":0.02724170043606285,"score_gpt":0.2816568726293614,"score_spread":0.25441517219329857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192282920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046730347,0.0020476372,0.8108707,0.0063350806,0.0027018364,0.00006607556,0.00038565858,0.00052339886,0.13033926],"genre_scores_gemma":[0.7586704,0.0018019207,0.19072363,0.0020420717,0.003049455,0.00012863625,0.00047856648,0.0007017841,0.04240348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963367,0.0009861465,0.00033083349,0.0007783241,0.0013347123,0.0002332682],"domain_scores_gemma":[0.98974425,0.0062445896,0.0004026423,0.002216427,0.0010792055,0.00031285212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046098894,0.00045819275,0.0013687616,0.0020530783,0.0015399291,0.0034280447,0.0022420944,0.0022541538,0.006733097],"category_scores_gemma":[0.022375768,0.00088387716,0.00153622,0.0016540618,0.0055422927,0.012290079,0.0032944274,0.0068808477,0.0010617261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009179438,0.0000060813554,0.000084627114,0.00001708246,0.000008004877,0.00004760416,0.00004806078,0.0004975901,0.00012588617,0.99262744,0.0010179757,0.005510606],"study_design_scores_gemma":[0.0000039281763,0.0000034928396,0.000062770676,0.000007756198,0.0000057884404,0.00008486629,0.000008759335,0.0033357623,0.00016970013,0.9944906,0.0018200065,0.000006533965],"about_ca_topic_score_codex":0.0008317877,"about_ca_topic_score_gemma":0.0011679344,"teacher_disagreement_score":0.006733097,"about_ca_system_score_codex":0.0009837507,"about_ca_system_score_gemma":0.00091265625,"threshold_uncertainty_score":0.02437967},"labels":[],"label_agreement":null},{"id":"W192306439","doi":"10.1007/978-3-319-07509-9_37","title":"The GPII on Desktops in PCs OSs: Windows and GNOME","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Software; Personal computer; Operating system","score_opus":0.014134984657645202,"score_gpt":0.22701418345082014,"score_spread":0.21287919879317493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192306439","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005871083,0.011076564,0.077099375,0.0049769655,0.0016806673,0.00010463313,0.0008097653,0.013789885,0.88459104],"genre_scores_gemma":[0.064198025,0.012593487,0.059041552,0.0023564154,0.0011246793,0.00013744376,0.001404647,0.008171467,0.85097224],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996542,0.000045650144,0.000014628058,0.00007478185,0.0001639441,0.000046802506],"domain_scores_gemma":[0.9996551,0.000069601854,0.000010156659,0.00012814773,0.00007539346,0.000061573446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046683027,0.00091780093,0.0005515519,0.0012247377,0.0008726673,0.0028531025,0.0009428823,0.0011995084,0.073946655],"category_scores_gemma":[0.0013949621,0.0005673351,0.00046540267,0.001650622,0.0009248445,0.0051276777,0.0022060333,0.002838635,0.049557835],"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.00011315854,0.000035483186,0.00045757153,0.00018326676,0.000008912746,0.0001901576,0.0005835186,0.00036724747,0.0044290056,0.15401277,0.31028628,0.5293327],"study_design_scores_gemma":[0.000015721183,0.00004299222,0.0008715229,0.00021382124,0.000011228257,0.0005375158,0.00014258339,0.00083440135,0.0030799233,0.03439636,0.95983034,0.000023621931],"about_ca_topic_score_codex":0.0016538169,"about_ca_topic_score_gemma":0.0017330799,"teacher_disagreement_score":0.073946655,"about_ca_system_score_codex":0.00081042823,"about_ca_system_score_gemma":0.00057417096,"threshold_uncertainty_score":0.2473762},"labels":[],"label_agreement":null},{"id":"W1923117336","doi":"10.1007/978-3-642-10677-4_27","title":"Quasi-Deterministic Partially Observable Markov Decision Processes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Université Laval","funders":"","keywords":"Observability; Computer science; Observable; Markov decision process; Hierarchy; Mathematical optimization; Theoretical computer science; Polynomial hierarchy; Decision problem; Time complexity; Markov process; Algorithm; Mathematics; Applied mathematics","score_opus":0.027048840545886504,"score_gpt":0.2727263273379048,"score_spread":0.2456774867920183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923117336","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.05002865,0.000864315,0.934983,0.001146582,0.00015162527,0.00009313128,0.0012225711,0.00037270243,0.011137329],"genre_scores_gemma":[0.882784,0.0016164689,0.0855514,0.00033384105,0.00022303304,0.00038097563,0.0013873618,0.00010554149,0.027617447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734604,0.001139368,0.00015293795,0.00048895733,0.0004907026,0.00038200468],"domain_scores_gemma":[0.9648758,0.030910764,0.0013260426,0.0010990129,0.0010942324,0.0006941095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036176885,0.0011317827,0.0020693324,0.00073807436,0.00059120497,0.0028290302,0.0022180101,0.0021676878,0.012668254],"category_scores_gemma":[0.016042698,0.0011610216,0.0012591478,0.0011067733,0.0021830632,0.0032973816,0.0014201921,0.0024061874,0.0012170858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024555495,0.0000685319,0.001394431,0.00015056423,0.00007294502,0.0002738159,0.00011518295,0.16573648,0.000757628,0.8200007,0.0017813302,0.009402922],"study_design_scores_gemma":[0.00008130411,0.000045831148,0.00038457994,0.00002146967,0.000027711416,0.00006314543,0.000015095834,0.6472093,0.00021413325,0.35106418,0.0008488889,0.00002447337],"about_ca_topic_score_codex":0.0043119215,"about_ca_topic_score_gemma":0.00359604,"teacher_disagreement_score":0.012668254,"about_ca_system_score_codex":0.0018972217,"about_ca_system_score_gemma":0.0017790123,"threshold_uncertainty_score":0.0423795},"labels":[],"label_agreement":null},{"id":"W192314245","doi":"10.1007/978-3-642-30950-2_114","title":"Interoperability for ITS: An Ontology of Learning Style Models","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Learning Styles and Cognitive Differences","field":"Psychology","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 Guelph","funders":"","keywords":"Computer science; Style (visual arts); Ontology; Interoperability; Learning styles; Artificial intelligence; Human–computer interaction; World Wide Web; Mathematics education","score_opus":0.05485446299467998,"score_gpt":0.3248043494129524,"score_spread":0.2699498864182724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192314245","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.018226795,0.0008128956,0.91931623,0.0020062511,0.00018498542,0.00016432651,0.0006452642,0.0008412258,0.057801936],"genre_scores_gemma":[0.44312,0.0015672885,0.5321425,0.0006254979,0.0003345668,0.0007157744,0.0019956026,0.00059853174,0.018900208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966364,0.0010336154,0.0005961079,0.0006734115,0.00074521475,0.00031528794],"domain_scores_gemma":[0.9950275,0.0017204331,0.00039164233,0.0018756881,0.00067744503,0.0003073605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034402024,0.0007006287,0.0007716979,0.0023798235,0.0016085482,0.00949609,0.0023300692,0.0024685794,0.0049990295],"category_scores_gemma":[0.00706425,0.00067269185,0.0023319265,0.0034343188,0.0048790183,0.018100306,0.0035139555,0.004459624,0.0014128368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070354254,0.000016549477,0.0003031893,0.00003164452,0.000010654243,0.00003599234,0.00057303015,0.0011252791,0.00026551838,0.98454076,0.0005567824,0.012533568],"study_design_scores_gemma":[0.0000065007675,0.000011809645,0.00028520287,0.000055522967,0.00002159337,0.00012208712,0.00026554996,0.010439927,0.00041271065,0.9634457,0.024919214,0.0000142201625],"about_ca_topic_score_codex":0.004221854,"about_ca_topic_score_gemma":0.0019973693,"teacher_disagreement_score":0.00949609,"about_ca_system_score_codex":0.0022520756,"about_ca_system_score_gemma":0.0019181863,"threshold_uncertainty_score":0.018193722},"labels":[],"label_agreement":null},{"id":"W1923950849","doi":"10.1007/978-3-540-74260-9_52","title":"Tracking Multiple People in the Context of Video Surveillance","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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 Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Minimum bounding box; Feature (linguistics); Tracking (education); Video tracking; Context (archaeology); Feature extraction; Pixel; Cluster analysis; Object detection; Tracking system; Pattern recognition (psychology); Matching (statistics); Image (mathematics); Video processing; Kalman filter; Mathematics","score_opus":0.0382191993295249,"score_gpt":0.29477175311917675,"score_spread":0.25655255378965186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923950849","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12409919,0.002723234,0.8681216,0.00021086994,0.00019569651,0.00005236768,0.00011875187,0.00033535055,0.004142972],"genre_scores_gemma":[0.7659925,0.0024139874,0.22463113,0.00009850969,0.00027718657,0.00004321831,0.00038843157,0.00006975279,0.0060851937],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995122,0.00009311679,0.000018329105,0.00018189634,0.00013267306,0.00006184864],"domain_scores_gemma":[0.99931824,0.00040233036,0.00008604158,0.000055694632,0.00008462132,0.000053112264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006058262,0.00051994354,0.00097016554,0.0008820485,0.00035961336,0.0009198915,0.0009317185,0.0013388091,0.00076020934],"category_scores_gemma":[0.0021527624,0.0004724447,0.0004269486,0.0011367357,0.00036771272,0.0013172012,0.0009952423,0.00084156357,0.00028796165],"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.00092237804,0.00024104297,0.012213565,0.00038417985,0.00022940765,0.0015474528,0.0009339025,0.14263205,0.10104055,0.009797702,0.0049779164,0.7250799],"study_design_scores_gemma":[0.000023453042,0.00019133465,0.008182381,0.00005170025,0.00010206831,0.0013714433,0.00030525893,0.95320326,0.021718344,0.010566695,0.004244767,0.000039347124],"about_ca_topic_score_codex":0.002662757,"about_ca_topic_score_gemma":0.003328103,"teacher_disagreement_score":0.002662757,"about_ca_system_score_codex":0.00026117289,"about_ca_system_score_gemma":0.00020586506,"threshold_uncertainty_score":0.0052945614},"labels":[],"label_agreement":null},{"id":"W1924179117","doi":"10.1007/978-3-642-21535-3_15","title":"Guidelines for Increasing Prompt Efficiency in Smart Homes According to the Resident’s Profile and Task Characteristics","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy and Environmental Systems","field":"Social Sciences","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é du Québec à Chicoutimi","funders":"","keywords":"Computer science; Task (project management); Human–computer interaction; Systems engineering; Engineering","score_opus":0.042185395723748534,"score_gpt":0.2908672466424705,"score_spread":0.24868185091872197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924179117","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095166706,0.028676031,0.67808205,0.030893933,0.0035704628,0.006750394,0.0034100215,0.017586019,0.13586436],"genre_scores_gemma":[0.18358411,0.008506799,0.7640967,0.0033308468,0.00032842578,0.0048521594,0.0015878098,0.0007256269,0.032987457],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747413,0.00085899397,0.00040716966,0.00020715421,0.00082241395,0.00023019164],"domain_scores_gemma":[0.9914179,0.0035717,0.0007871289,0.00030312827,0.0032578856,0.0006621912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004762031,0.0011669914,0.0007119129,0.0017106722,0.0009343637,0.0023095775,0.0027175494,0.0018644691,0.0101744635],"category_scores_gemma":[0.016915936,0.0005463356,0.0005619834,0.0013498231,0.0003914997,0.0017432376,0.0014252152,0.0018859413,0.00458136],"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.0004756167,0.0016546455,0.009803726,0.0015577071,0.00005730434,0.0002847142,0.0029121025,0.0067686527,0.008905867,0.008925577,0.1502086,0.8084455],"study_design_scores_gemma":[0.0013341578,0.0032820466,0.15153566,0.011031255,0.00076352595,0.0021615026,0.012495526,0.05917,0.042655982,0.06929518,0.64562225,0.00065292773],"about_ca_topic_score_codex":0.0047797523,"about_ca_topic_score_gemma":0.012118251,"teacher_disagreement_score":0.0101744635,"about_ca_system_score_codex":0.0013098645,"about_ca_system_score_gemma":0.0027891397,"threshold_uncertainty_score":0.034036934},"labels":[],"label_agreement":null},{"id":"W1924314351","doi":"10.1007/978-3-319-22849-5_11","title":"Quality Metrics for Linked Open Data","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Quality (philosophy); Data mining","score_opus":0.6007819523488969,"score_gpt":0.5116201951511121,"score_spread":0.08916175719778474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924314351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044372575,0.015796848,0.9482907,0.003324603,0.0011226969,0.00018553369,0.0014627437,0.0014616017,0.023918048],"genre_scores_gemma":[0.14518516,0.015866963,0.8087997,0.00076549134,0.0013882264,0.00070668105,0.005657402,0.001546571,0.020083837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9765315,0.0059604994,0.0024131518,0.0013820907,0.013195456,0.00051729445],"domain_scores_gemma":[0.97092414,0.013388098,0.0031785876,0.0037840588,0.008051918,0.00067326485],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.015717011,0.0013222862,0.0012035157,0.009975504,0.0009770371,0.007435812,0.0020090158,0.0016031143,0.0050298194],"category_scores_gemma":[0.06608807,0.0006425229,0.0011700233,0.013106701,0.0016050182,0.010875575,0.004080451,0.0026176835,0.001440041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031517768,0.000044571883,0.0020222198,0.0007412011,0.000086920736,0.000055121713,0.0004321961,0.008012353,0.0009814755,0.48590228,0.039523713,0.46216652],"study_design_scores_gemma":[0.00001118154,0.00007967394,0.0026212898,0.001088795,0.000058529782,0.0003013756,0.00029548758,0.052798208,0.002987364,0.7586709,0.18100572,0.00008143573],"about_ca_topic_score_codex":0.0022788371,"about_ca_topic_score_gemma":0.0022396615,"teacher_disagreement_score":0.984283,"about_ca_system_score_codex":0.0034895989,"about_ca_system_score_gemma":0.0021548069,"threshold_uncertainty_score":0.083120525},"labels":[],"label_agreement":null},{"id":"W1924339725","doi":"10.1007/978-3-642-13577-4_47","title":"SIMACT: A 3D Open Source Smart Home Simulator for Activity Recognition","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Java; Open source; Home automation; Field (mathematics); Set (abstract data type); Human–computer interaction; Simulation; Embedded system; Software; Operating system","score_opus":0.043301130113119264,"score_gpt":0.2823900745041111,"score_spread":0.23908894439099182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924339725","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.036845896,0.00025525497,0.8537921,0.00023260475,0.0002573556,0.00059153326,0.008135143,0.085317336,0.014572743],"genre_scores_gemma":[0.46140704,0.00066311215,0.4781706,0.00060514134,0.000071063565,0.0016373764,0.013711828,0.007943429,0.035790462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999856,0.000029323272,0.000008598954,0.000024177412,0.00006857107,0.000013333305],"domain_scores_gemma":[0.99981993,0.00006088366,0.000008962449,0.000027723669,0.000043952878,0.000038580172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021079821,0.0009267547,0.0007849857,0.00041051657,0.00015320479,0.000598011,0.0015993629,0.00060239603,0.022236284],"category_scores_gemma":[0.0007586462,0.00052188965,0.00061989063,0.00029563223,0.0002184867,0.00045411414,0.000894458,0.0006413146,0.0053446954],"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.0017589582,0.0007073603,0.0063455403,0.00090692396,0.00043979113,0.00086069613,0.0007605888,0.27114308,0.08127157,0.007392807,0.15713537,0.47127733],"study_design_scores_gemma":[0.00028148716,0.00022821386,0.0031354714,0.000045374298,0.00011352324,0.00054416014,0.00009440722,0.8953663,0.030530376,0.003392585,0.066158965,0.000109192144],"about_ca_topic_score_codex":0.004035585,"about_ca_topic_score_gemma":0.006025075,"teacher_disagreement_score":0.022236284,"about_ca_system_score_codex":0.00034176,"about_ca_system_score_gemma":0.0007212259,"threshold_uncertainty_score":0.07438779},"labels":[],"label_agreement":null},{"id":"W192507917","doi":"10.1007/978-3-540-76848-7_20","title":"A Multi-level Model for Activity Commitments in E-contracts","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Memorial University of Newfoundland","funders":"","keywords":"Atomicity; Transactional leadership; Design by contract; Computer science; Contract management; Interdependence; Composition (language); Database transaction; Payment; Closure (psychology); Workflow; Programming language; Software; Business; Database; Software system; World Wide Web","score_opus":0.10313655544253811,"score_gpt":0.29759756683199495,"score_spread":0.19446101138945684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192507917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099903215,0.00013900307,0.9746532,0.0006849923,0.00004666457,0.000103736034,0.00040671005,0.00036294034,0.013612451],"genre_scores_gemma":[0.48877096,0.0004497209,0.4820001,0.0002664269,0.00007894815,0.0006847158,0.0008817148,0.00033135555,0.026535962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984516,0.0005704001,0.00013758356,0.00027618074,0.00036279735,0.00020142592],"domain_scores_gemma":[0.9978294,0.0012531676,0.00015499123,0.00029335744,0.00028184644,0.00018734705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024065136,0.0006537623,0.0009962901,0.0009621135,0.0012669825,0.0045275013,0.0036374778,0.0027509178,0.015121877],"category_scores_gemma":[0.005671346,0.0010940013,0.0018363589,0.0018599099,0.0015323573,0.0064144,0.0026168681,0.003224378,0.0022505631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004869705,0.00005597251,0.00046453695,0.000064696775,0.000030322739,0.00017141296,0.00033064434,0.4655677,0.0005689004,0.51652205,0.0013049368,0.014870102],"study_design_scores_gemma":[0.000016248458,0.000013386435,0.00008524502,0.000012000736,0.000014565245,0.00003474413,0.000038508195,0.91014147,0.00014624267,0.08660974,0.0028768003,0.000011095606],"about_ca_topic_score_codex":0.012250706,"about_ca_topic_score_gemma":0.011997947,"teacher_disagreement_score":0.015121877,"about_ca_system_score_codex":0.0024098023,"about_ca_system_score_gemma":0.0026128204,"threshold_uncertainty_score":0.050587714},"labels":[],"label_agreement":null},{"id":"W1925198521","doi":"10.1007/978-3-642-13335-0_25","title":"The Instance-Based Multilevel Security Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Access control; Computer security model; Data security; Database security; Relation (database); Computer security; Data integrity; Database; Key (lock); Data access; Field (mathematics); Encryption","score_opus":0.020691327319470258,"score_gpt":0.2791206697579599,"score_spread":0.25842934243848964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925198521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02919333,0.00032442113,0.9450978,0.0019854705,0.00006392722,0.00010519823,0.00075680704,0.00052368105,0.021949433],"genre_scores_gemma":[0.76731545,0.0009038623,0.2096476,0.00034672383,0.00014159776,0.00033368758,0.001031604,0.00018107242,0.02009849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827707,0.00057521363,0.000111301066,0.0002926693,0.00046994252,0.0002738083],"domain_scores_gemma":[0.9973666,0.0011698483,0.00022555275,0.00071370055,0.00030571554,0.0002186055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017608284,0.0005000629,0.0010026328,0.00077459787,0.0008688809,0.0037089759,0.002862368,0.0018223373,0.01152187],"category_scores_gemma":[0.005627343,0.0005880273,0.0014983874,0.0015701617,0.0016600981,0.00677444,0.0027255917,0.0034754288,0.0017392815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063611806,0.000046944184,0.0004455138,0.00005392746,0.00004490365,0.000080649246,0.000095612006,0.08061063,0.00082479505,0.8998706,0.0025754957,0.015287203],"study_design_scores_gemma":[0.00002140946,0.000025171019,0.00016559348,0.00001642228,0.00003199088,0.000065593966,0.000029266694,0.5053159,0.00030908943,0.490678,0.0033258195,0.000015868321],"about_ca_topic_score_codex":0.004877572,"about_ca_topic_score_gemma":0.0043117777,"teacher_disagreement_score":0.01152187,"about_ca_system_score_codex":0.0018568505,"about_ca_system_score_gemma":0.0016847126,"threshold_uncertainty_score":0.038544536},"labels":[],"label_agreement":null},{"id":"W1925397890","doi":"10.1007/11557067_28","title":"Linear Time Algorithm for Parsing RNA Secondary Structure","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Algorithm; Parsing; Nucleic acid secondary structure; Computer science; Protein secondary structure; Time complexity; Generality; RNA; Artificial intelligence","score_opus":0.00895493629812733,"score_gpt":0.23275585143019073,"score_spread":0.2238009151320634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925397890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013642714,0.00082972413,0.9416468,0.0006972746,0.00023513736,0.00039244897,0.0025130713,0.030337794,0.009704899],"genre_scores_gemma":[0.06468642,0.0002687347,0.912566,0.00045800762,0.00012646471,0.0006005384,0.0075032236,0.0015625196,0.012228128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807954,0.00027769807,0.00013990996,0.0007032458,0.0004769651,0.00032262207],"domain_scores_gemma":[0.99667215,0.0020615377,0.00013635056,0.0005570004,0.000436073,0.00013687012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328295,0.0029192066,0.0026172814,0.0022857862,0.0017997768,0.0034103845,0.0047070766,0.0025888693,0.028845768],"category_scores_gemma":[0.004344362,0.0012269965,0.0020272774,0.0042953766,0.0014316816,0.0050830985,0.0031765231,0.0026400627,0.011974269],"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.0011910242,0.0005622795,0.000662104,0.00061871455,0.00013018839,0.0001847203,0.00025096984,0.038237132,0.015855607,0.019420875,0.06838119,0.8545052],"study_design_scores_gemma":[0.0011122945,0.00046646508,0.0009958271,0.000082768,0.00024735424,0.0004423853,0.00031927926,0.80900675,0.02508431,0.13423406,0.027890878,0.00011764422],"about_ca_topic_score_codex":0.008671943,"about_ca_topic_score_gemma":0.013344879,"teacher_disagreement_score":0.028845768,"about_ca_system_score_codex":0.0026083507,"about_ca_system_score_gemma":0.0036793356,"threshold_uncertainty_score":0.09649867},"labels":[],"label_agreement":null},{"id":"W1925566585","doi":"10.1007/978-3-642-34413-8_19","title":"Vehicle Routing and Adaptive Iterated Local Search within the HyFlex Hyper-heuristic Framework","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Heuristics; Computer science; Iterated local search; Vehicle routing problem; Domain (mathematical analysis); Heuristic; Routing (electronic design automation); Incremental heuristic search; Local search (optimization); Mathematical optimization; Search algorithm; Artificial intelligence; Beam search; Algorithm; Mathematics","score_opus":0.024266817398528522,"score_gpt":0.26166402899121416,"score_spread":0.23739721159268565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925566585","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.013300212,0.00076970475,0.97435385,0.00018448205,0.000078132645,0.000057808153,0.000039121107,0.0001802355,0.011036526],"genre_scores_gemma":[0.53685373,0.0010492,0.4454906,0.0001717286,0.00016177658,0.00047056758,0.00012363982,0.00025125244,0.01542745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995741,0.00020619103,0.000013237272,0.000043797525,0.000116427735,0.00004629193],"domain_scores_gemma":[0.99954575,0.00027328415,0.000047725935,0.000043277538,0.000059980255,0.000029897645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089804287,0.0007556594,0.0012629373,0.00070253416,0.00049074955,0.0012760066,0.0021257498,0.00136851,0.003495638],"category_scores_gemma":[0.0018373479,0.0006066256,0.00076956203,0.00093985297,0.0011108007,0.0012669486,0.0014359683,0.0013160731,0.00048102415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027363436,0.000021151864,0.000076352095,0.00003463839,0.000025645577,0.000027323955,0.000022192153,0.9439725,0.0003397325,0.04029692,0.00060835155,0.014547858],"study_design_scores_gemma":[0.0000068588124,0.00001325066,0.000016710721,0.0000048320267,0.00000373037,0.0000057380585,0.000003981576,0.992382,0.00006874939,0.007157104,0.0003336729,0.0000033094598],"about_ca_topic_score_codex":0.0050970246,"about_ca_topic_score_gemma":0.004276306,"teacher_disagreement_score":0.0050970246,"about_ca_system_score_codex":0.0011776054,"about_ca_system_score_gemma":0.0011933822,"threshold_uncertainty_score":0.011694074},"labels":[],"label_agreement":null},{"id":"W192568510","doi":"10.1007/978-3-642-32873-2_2","title":"Differential Privacy in Practice","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Differential privacy; Computer science; Laplace distribution; Noise (video); Point (geometry); Personally identifiable information; Differential (mechanical device); Aggregate (composite); Laplace transform; Algorithm; Simple (philosophy); Theoretical computer science; Data mining; Information retrieval; Mathematics; Artificial intelligence; Computer security","score_opus":0.029169540684208982,"score_gpt":0.28098362636054663,"score_spread":0.2518140856763377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192568510","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008821019,0.012347157,0.40233666,0.018962106,0.00068933173,0.00007521731,0.00017619092,0.0004835799,0.5561088],"genre_scores_gemma":[0.6732128,0.010428951,0.07968166,0.0044895443,0.0011441761,0.00032413562,0.00027772473,0.00035764542,0.23008336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967282,0.0013104803,0.00017184312,0.00058645883,0.0009569524,0.00024603],"domain_scores_gemma":[0.9972645,0.0012916075,0.00010435922,0.0010468267,0.0002051895,0.00008752447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026729617,0.0005979585,0.0006993852,0.0008366749,0.0015606974,0.0055018826,0.0010554082,0.0024818622,0.018781807],"category_scores_gemma":[0.007976803,0.0004937339,0.0004943527,0.0013991406,0.0074465577,0.008891452,0.0037450183,0.004689052,0.0044030217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042513507,0.0000049280384,0.000033995744,0.000017191178,0.0000017355139,0.000013066328,0.00010964755,0.00027325508,0.000057959176,0.98415667,0.002629948,0.012697456],"study_design_scores_gemma":[0.0000030916733,0.0000065662725,0.00003525544,0.000030609262,0.0000019009827,0.000070919945,0.000045942405,0.0011115,0.00020406145,0.9580227,0.04046419,0.0000032611101],"about_ca_topic_score_codex":0.00076108647,"about_ca_topic_score_gemma":0.000533098,"teacher_disagreement_score":0.018781807,"about_ca_system_score_codex":0.0025786196,"about_ca_system_score_gemma":0.001274642,"threshold_uncertainty_score":0.0628314},"labels":[],"label_agreement":null},{"id":"W1926478007","doi":"10.1007/978-3-319-15979-9_5","title":"Representation of Cultural Objects by Image Sets with Directional Illumination","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Impact","funders":"","keywords":"Computer science; Computer graphics (images); Rendering (computer graphics); Computer vision; Specular reflection; Artificial intelligence; Representation (politics); Painting; Cultural heritage; Object (grammar); Visualization; Pixel; Visual arts; Art; Geography; Archaeology; Optics","score_opus":0.023430737398209396,"score_gpt":0.30680998385354097,"score_spread":0.2833792464553316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926478007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020828627,0.00027285214,0.9648891,0.00015871112,0.00007381653,0.000066645145,0.00055386114,0.0012459778,0.011910369],"genre_scores_gemma":[0.27358398,0.0010192083,0.716724,0.00009554063,0.00007130715,0.00014748085,0.0013117982,0.00056229107,0.006484478],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998053,0.000042004158,0.000010594397,0.00004016533,0.00007312366,0.000028803448],"domain_scores_gemma":[0.9998167,0.000040406718,0.000015630843,0.000055707587,0.00005061289,0.00002089419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020862452,0.00071183284,0.00041741505,0.001504642,0.0003605486,0.0032544055,0.00083959795,0.00042789732,0.005433884],"category_scores_gemma":[0.0007985557,0.00050057465,0.00093513983,0.00196568,0.00070340943,0.0012575136,0.0014424511,0.0010459258,0.0014453166],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004098338,0.00011745114,0.0012826282,0.0005649695,0.00013015208,0.00040149677,0.0017032421,0.07827854,0.09597028,0.19068678,0.014055695,0.61639893],"study_design_scores_gemma":[0.000085587184,0.00012286167,0.0034482442,0.00020118122,0.00013977528,0.0010408139,0.0011611689,0.7132307,0.07181256,0.12625606,0.08233962,0.00016134037],"about_ca_topic_score_codex":0.0032359203,"about_ca_topic_score_gemma":0.003374484,"teacher_disagreement_score":0.005433884,"about_ca_system_score_codex":0.0004460504,"about_ca_system_score_gemma":0.00032233048,"threshold_uncertainty_score":0.018178165},"labels":[],"label_agreement":null},{"id":"W1926518666","doi":"10.1007/978-3-642-15711-0_17","title":"Nonlocal Patch-Based Label Fusion for Hippocampus Segmentation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":53,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Pattern recognition (psychology); Image warping; Market segmentation; Fusion; Prior probability; Computer vision","score_opus":0.014041845707215032,"score_gpt":0.2984307847783678,"score_spread":0.2843889390711528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926518666","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.044343542,0.0009810262,0.951476,0.00013224909,0.00006230298,0.000054343433,0.0001559851,0.0016383197,0.001156316],"genre_scores_gemma":[0.351211,0.0008589925,0.643096,0.00013342079,0.00010776323,0.000083163526,0.00061889825,0.00054982916,0.0033408415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.00007295928,0.000025719743,0.00010856314,0.00019416679,0.000078072444],"domain_scores_gemma":[0.99933136,0.00016463744,0.00007600945,0.00015542362,0.0002335785,0.000039031347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009298211,0.0007184894,0.0013350315,0.0016646255,0.00057243794,0.0013502301,0.0012301321,0.0015033016,0.002139791],"category_scores_gemma":[0.0016910898,0.00048140463,0.00086292473,0.0016573084,0.0005882493,0.0015669328,0.0012960439,0.00083470327,0.0011303357],"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.00080830115,0.00016481569,0.0019009685,0.00038468282,0.0002230907,0.00014821257,0.00018707526,0.025644276,0.25009444,0.0019879288,0.0029897336,0.71546644],"study_design_scores_gemma":[0.000041377916,0.0001681617,0.004547757,0.000043581214,0.00027317656,0.00057892647,0.00014934546,0.81073785,0.17361665,0.0061814613,0.003596368,0.00006538585],"about_ca_topic_score_codex":0.003917121,"about_ca_topic_score_gemma":0.007247621,"teacher_disagreement_score":0.003917121,"about_ca_system_score_codex":0.000510626,"about_ca_system_score_gemma":0.0009858251,"threshold_uncertainty_score":0.007788658},"labels":[],"label_agreement":null},{"id":"W1927399054","doi":"10.1007/978-3-642-02611-9_60","title":"COBVIS-D: A Computer Vision System for Describing the Cephalo-Ocular Behavior of Drivers in a Driving Simulator","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ergonomics and Musculoskeletal Disorders","field":"Psychology","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":"Université Laval; Computer Research Institute of Montréal; Western University","funders":"","keywords":"Computer science; Human–computer interaction; Simulation; Virtual reality; Kinesiology; Driving simulator; Computer graphics (images); Artificial intelligence","score_opus":0.02306987034031923,"score_gpt":0.2787381698243544,"score_spread":0.2556682994840352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927399054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009667781,0.00089794805,0.94442886,0.00013152671,0.00019754404,0.00024449424,0.002929875,0.031157276,0.010344584],"genre_scores_gemma":[0.16730045,0.0020964004,0.78504115,0.00040930393,0.00013732575,0.00063640776,0.0077434345,0.0042300383,0.03240548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989307,0.000013462081,0.000006378321,0.00002556282,0.000046931433,0.000014498928],"domain_scores_gemma":[0.9998388,0.00005963202,0.00001151518,0.00002064756,0.0000524987,0.000016856065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022333437,0.0011616223,0.00046771264,0.0008378485,0.00025407935,0.0008742769,0.0010396343,0.001238323,0.015309],"category_scores_gemma":[0.00050110166,0.0003714646,0.00046893893,0.00048809737,0.00016661592,0.0005227674,0.00045583726,0.0005694835,0.0054559046],"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.00036740012,0.00011045594,0.002009052,0.0005492014,0.0001032804,0.00030378386,0.00016738582,0.026245482,0.15740828,0.005702008,0.073467776,0.7335659],"study_design_scores_gemma":[0.00008093521,0.00021397923,0.00927408,0.00016883026,0.00012975637,0.0018657382,0.00011055803,0.6735218,0.16652162,0.006975405,0.14098987,0.00014739798],"about_ca_topic_score_codex":0.0053494736,"about_ca_topic_score_gemma":0.006653121,"teacher_disagreement_score":0.015309,"about_ca_system_score_codex":0.0003334647,"about_ca_system_score_gemma":0.00046829233,"threshold_uncertainty_score":0.05121374},"labels":[],"label_agreement":null},{"id":"W1927570069","doi":"10.1007/978-3-642-35746-6_4","title":"Advanced Theorem Proving Techniques in PVS and Applications","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Automated theorem proving; Computer science; Programming language; First-order logic; Tuple; Propositional calculus; Theoretical computer science; Predicate (mathematical logic); Algorithm; Discrete mathematics; Mathematics","score_opus":0.013171497475002182,"score_gpt":0.24688505996184662,"score_spread":0.23371356248684444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927570069","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.0030814495,0.005825008,0.9343232,0.0014798032,0.000624882,0.000108394735,0.00027705368,0.00223253,0.052047662],"genre_scores_gemma":[0.10827618,0.009726008,0.8351136,0.0009456485,0.0016484429,0.00026837306,0.001122518,0.0014825203,0.041416667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974654,0.00071205175,0.00022569903,0.00044509434,0.0009953713,0.00015639947],"domain_scores_gemma":[0.99659973,0.0019709615,0.00010135205,0.0008109405,0.0004294441,0.000087585664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028808124,0.001062485,0.00096867763,0.002164642,0.0012427488,0.004265457,0.0036479412,0.0012333661,0.02115432],"category_scores_gemma":[0.0075898087,0.0012508412,0.0020790189,0.0036447519,0.0027783383,0.007976071,0.003098978,0.0060140193,0.0077012456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034955032,0.000046543617,0.00018994983,0.0005725678,0.000031149717,0.000075236996,0.0002795668,0.0028535756,0.0015958196,0.73609465,0.01625023,0.2419759],"study_design_scores_gemma":[0.00001754988,0.000020993944,0.00016573867,0.00017933533,0.000023530227,0.00024762793,0.00003743432,0.0107158655,0.0025687853,0.88222766,0.10377788,0.000017567565],"about_ca_topic_score_codex":0.00064191694,"about_ca_topic_score_gemma":0.0006656674,"teacher_disagreement_score":0.02115432,"about_ca_system_score_codex":0.0012542969,"about_ca_system_score_gemma":0.0012809859,"threshold_uncertainty_score":0.07076824},"labels":[],"label_agreement":null},{"id":"W1927906724","doi":"10.1007/978-3-642-02611-9_72","title":"The Distinction between Virtual and Physical Planes Using Homography","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Homography; Computer science; Convex hull; Plane (geometry); Computer vision; Artificial intelligence; Point (geometry); Regular polygon; Identification (biology); Computer graphics (images); Algorithm; Geometry; Mathematics","score_opus":0.016058558963310484,"score_gpt":0.2678665338713688,"score_spread":0.2518079749080583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927906724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01869389,0.0054920036,0.92867225,0.0008602195,0.000671919,0.000040808354,0.00012262588,0.00035165536,0.04509468],"genre_scores_gemma":[0.5447298,0.010603628,0.41423818,0.0005263802,0.00052670814,0.00010327822,0.00035439464,0.00037223496,0.028545452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945384,0.00014862744,0.000029168925,0.000130369,0.0001943478,0.000043682474],"domain_scores_gemma":[0.9995115,0.0002033581,0.00003998169,0.0001462666,0.000073073104,0.000025817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052132236,0.0005046795,0.00057457504,0.00090247457,0.000375679,0.0032034211,0.0008255793,0.0009803324,0.004611349],"category_scores_gemma":[0.0021000348,0.0004800377,0.00042027442,0.0008040196,0.003213616,0.0055044717,0.0021999907,0.0021503936,0.0013305594],"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.00011679606,0.000020602463,0.00039343577,0.00024490856,0.000024525134,0.00018528942,0.0005978344,0.0072244965,0.009492687,0.7517392,0.004360248,0.22559997],"study_design_scores_gemma":[0.000046601566,0.000117777054,0.0020767911,0.00032068047,0.000074135765,0.0016639683,0.0009409902,0.10121723,0.013174225,0.7819784,0.09830602,0.000083173865],"about_ca_topic_score_codex":0.0007368571,"about_ca_topic_score_gemma":0.0005627182,"teacher_disagreement_score":0.004611349,"about_ca_system_score_codex":0.00026466622,"about_ca_system_score_gemma":0.00032840826,"threshold_uncertainty_score":0.015426457},"labels":[],"label_agreement":null},{"id":"W1927977443","doi":"10.1007/3-540-45053-x_50","title":"Regularised Range Flow","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Western University","funders":"","keywords":"Computer science; Range (aeronautics); Classification of discontinuities; Algorithm; Flow (mathematics); Least-squares function approximation; Artificial intelligence; Mathematics; Geometry; Mathematical analysis","score_opus":0.012945401757183846,"score_gpt":0.2483918235969691,"score_spread":0.23544642183978526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927977443","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008152778,0.0007166205,0.9661655,0.00023322241,0.0002163015,0.00004075596,0.00017982784,0.0011814325,0.023113674],"genre_scores_gemma":[0.30749884,0.00173196,0.55407405,0.00033834524,0.0005786658,0.00014212198,0.0014454896,0.0013683494,0.1328222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971133,0.00005024074,0.000013288371,0.00008838538,0.00010549572,0.000031178675],"domain_scores_gemma":[0.9997199,0.000074949916,0.000021056952,0.00009552338,0.00006186055,0.000026643469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044810754,0.000567966,0.0006635838,0.00078811,0.0002979718,0.0011886338,0.00076975237,0.0008370497,0.014234551],"category_scores_gemma":[0.0012241529,0.0004070396,0.00044331735,0.00049825106,0.00070084864,0.0018526008,0.0019192657,0.0015364622,0.0045705982],"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.0003215634,0.000091424095,0.00028396252,0.00020067002,0.000042853575,0.00010274922,0.00012700704,0.06784289,0.027572436,0.36768895,0.023228751,0.51249665],"study_design_scores_gemma":[0.000042035183,0.00012445031,0.00041868468,0.000059594324,0.00002354221,0.00037630033,0.00003764913,0.63785386,0.01464856,0.2921841,0.05418427,0.000046959016],"about_ca_topic_score_codex":0.0006737611,"about_ca_topic_score_gemma":0.00049909006,"teacher_disagreement_score":0.014234551,"about_ca_system_score_codex":0.00039055082,"about_ca_system_score_gemma":0.00033269243,"threshold_uncertainty_score":0.047619283},"labels":[],"label_agreement":null},{"id":"W192821","doi":"10.1007/978-3-642-41299-8_4","title":"A Scientometrics Study of Rough Sets in Three Decades","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Scientometrics; Computer science; Library science","score_opus":0.04097173767765032,"score_gpt":0.2816243653013237,"score_spread":0.24065262762367334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192821","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.5801692,0.15286522,0.020543903,0.033753198,0.0015664096,0.000080758335,0.003206763,0.00017742392,0.2076371],"genre_scores_gemma":[0.9517992,0.035410326,0.0033399947,0.00048295263,0.0015137244,0.00004443401,0.0007600829,0.000038210892,0.006611071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980546,0.0005935931,0.00015973081,0.00019816244,0.00080723804,0.00018660414],"domain_scores_gemma":[0.9860989,0.008851842,0.0016667257,0.0007851004,0.0019163855,0.0006810274],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0052132295,0.00034555898,0.00072675827,0.021659961,0.0017725064,0.0044855583,0.00067146117,0.00082776864,0.00237742],"category_scores_gemma":[0.02825153,0.00027800605,0.0008253032,0.054495644,0.0023406057,0.005899942,0.0019195508,0.0014144705,0.00034351525],"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.00017130058,0.000119358505,0.047766853,0.00063477247,0.00023799427,0.00018241999,0.0050152703,0.005605375,0.0002179248,0.7262045,0.021878092,0.1919661],"study_design_scores_gemma":[0.000027176973,0.00024494642,0.31300938,0.0014161034,0.00030445433,0.0005871061,0.009852468,0.013071232,0.00072903355,0.41392037,0.24671961,0.000118024946],"about_ca_topic_score_codex":0.010227115,"about_ca_topic_score_gemma":0.00790209,"teacher_disagreement_score":0.97834,"about_ca_system_score_codex":0.0036355825,"about_ca_system_score_gemma":0.0028714791,"threshold_uncertainty_score":0.027570546},"labels":[],"label_agreement":null},{"id":"W1928219016","doi":"10.1007/978-3-642-13036-6_29","title":"Hypergraphic LP Relaxations for Steiner Trees","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Mathematics; Combinatorics","score_opus":0.020650835062804664,"score_gpt":0.24624998155214245,"score_spread":0.2255991464893378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928219016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029205224,0.002583702,0.85905796,0.003924155,0.0005577389,0.00028116,0.0014763473,0.0006251391,0.10228866],"genre_scores_gemma":[0.33411387,0.0073192045,0.5563768,0.0023345288,0.0021673886,0.0018153867,0.0055551357,0.0016392607,0.088678464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.0004986651,0.000061632694,0.00020814649,0.0002737036,0.00016067756],"domain_scores_gemma":[0.99680054,0.0022216565,0.0002227139,0.00029937155,0.00021990058,0.0002357745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019086619,0.0022044028,0.001552691,0.0012800413,0.0008935009,0.0032321494,0.0026614582,0.0022201238,0.028370908],"category_scores_gemma":[0.009381659,0.0015522306,0.0016378531,0.003026377,0.0014748977,0.006902047,0.0031357894,0.008595256,0.0030243495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021557306,0.0003017936,0.00025917598,0.0007600948,0.000072964394,0.00016662358,0.00053029426,0.14169219,0.001439489,0.7036889,0.048748806,0.102124065],"study_design_scores_gemma":[0.00007626334,0.00006024556,0.00012671108,0.00013410418,0.000029048731,0.00008398991,0.00019063827,0.19278957,0.00041306595,0.79289246,0.013183835,0.000019994071],"about_ca_topic_score_codex":0.0019706676,"about_ca_topic_score_gemma":0.0023504223,"teacher_disagreement_score":0.028370908,"about_ca_system_score_codex":0.0019727938,"about_ca_system_score_gemma":0.0012171257,"threshold_uncertainty_score":0.094910145},"labels":[],"label_agreement":null},{"id":"W192833019","doi":"10.1007/978-3-642-40477-1_12","title":"When Paper Meets Multi-touch: A Study of Multi-modal Interactions in Air Traffic Control","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Queen's University","funders":"","keywords":"Computer science; Modalities; Air traffic control; Human–computer interaction; Modal; Set (abstract data type); Context (archaeology); Control (management); Modality (human–computer interaction); Range (aeronautics); Artificial intelligence; Engineering","score_opus":0.024790522893556446,"score_gpt":0.27789452821215116,"score_spread":0.2531040053185947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192833019","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.90108776,0.0016705764,0.023957297,0.00044283492,0.00008709088,0.000059430706,0.000048373437,0.000055973607,0.07259062],"genre_scores_gemma":[0.9919544,0.00029726845,0.0021251412,0.00004895711,0.000014634618,0.000016433536,0.00001977433,0.00003237278,0.00549093],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994836,0.00020785558,0.000013268072,0.00008465582,0.00014818023,0.00006243617],"domain_scores_gemma":[0.9968664,0.0026882298,0.00011515977,0.00008803734,0.00013070872,0.000111419926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050056935,0.00024664335,0.00026091802,0.0004373632,0.0010408384,0.0033828025,0.00071474526,0.0011274698,0.004926062],"category_scores_gemma":[0.005044476,0.00022348965,0.00023198416,0.00079484325,0.0011516173,0.002639473,0.0009443941,0.0009405579,0.00035425968],"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.0018741802,0.0011374878,0.033916023,0.001624519,0.00016223353,0.0048949462,0.23715323,0.013383862,0.1583504,0.20179789,0.007184488,0.33852077],"study_design_scores_gemma":[0.00021788936,0.0021256437,0.18959868,0.001106258,0.00024222561,0.0057038586,0.3220539,0.21287093,0.04100602,0.1427393,0.082002655,0.00033264837],"about_ca_topic_score_codex":0.001907033,"about_ca_topic_score_gemma":0.0018417028,"teacher_disagreement_score":0.004926062,"about_ca_system_score_codex":0.00041483168,"about_ca_system_score_gemma":0.0003544154,"threshold_uncertainty_score":0.016479313},"labels":[],"label_agreement":null},{"id":"W19283389","doi":"10.1007/978-3-642-41218-9_35","title":"Recursive Profiles of Businesses and Reviewers on Yelp.com","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Saskatchewan","funders":"","keywords":"Computer science; Profiling (computer programming); Cluster analysis; Grading (engineering); Representation (politics); World Wide Web; Data science; Information retrieval; Data mining; Database; Artificial intelligence; Programming language","score_opus":0.019640891649529486,"score_gpt":0.2524847464374856,"score_spread":0.2328438547879561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19283389","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.06245995,0.0037769675,0.03898723,0.008770962,0.001338923,0.00047403818,0.23698878,0.01882437,0.6283788],"genre_scores_gemma":[0.18299244,0.003166758,0.041944742,0.0012345086,0.00090683927,0.00039758958,0.16799413,0.0057455692,0.5956175],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990865,0.00017401855,0.00006662233,0.00018425671,0.00033025155,0.00015840595],"domain_scores_gemma":[0.9962919,0.0010021899,0.00044361627,0.0005013012,0.0009736772,0.00078735367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009650279,0.0005732283,0.00047610363,0.0061737094,0.0015698919,0.0036684894,0.0008279324,0.0006955383,0.11060059],"category_scores_gemma":[0.0072785956,0.0004092297,0.0003692234,0.008156446,0.00022768589,0.00486352,0.0015392026,0.00070045004,0.07083026],"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.00023635413,0.000037733727,0.008736268,0.00017516756,0.000014747992,0.00020097295,0.0005572085,0.0008401138,0.0006068574,0.019438302,0.8282234,0.14093277],"study_design_scores_gemma":[0.000016664062,0.000020137384,0.008402677,0.000093319846,0.000008541411,0.0002953835,0.00052959495,0.0017324969,0.0007972215,0.008791128,0.9792793,0.000033490353],"about_ca_topic_score_codex":0.0065020854,"about_ca_topic_score_gemma":0.017724773,"teacher_disagreement_score":0.11060059,"about_ca_system_score_codex":0.0009232422,"about_ca_system_score_gemma":0.0014274884,"threshold_uncertainty_score":0.36999583},"labels":[],"label_agreement":null},{"id":"W1929604979","doi":"10.1007/978-3-540-75696-5_15","title":"Deployment Experience Toward Core Abstractions for Context Aware Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Context (archaeology); Set (abstract data type); Software deployment; Core (optical fiber); Process (computing); Iterative and incremental development; Software engineering; Context model; Data science; Human–computer interaction; Programming language; Artificial intelligence","score_opus":0.09730368469260686,"score_gpt":0.3294852479283288,"score_spread":0.23218156323572192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929604979","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.29549778,0.0014621775,0.6397127,0.0018709588,0.00035951953,0.0002469634,0.00029007465,0.015914798,0.044645093],"genre_scores_gemma":[0.6969359,0.0013895844,0.2751562,0.00042497265,0.0000687762,0.00013369462,0.0009640511,0.0030685316,0.02185836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983627,0.00052145036,0.000088924,0.00020000096,0.00060431124,0.00022256868],"domain_scores_gemma":[0.9975915,0.0008121939,0.000086507906,0.00060734316,0.00060945924,0.00029307223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024166545,0.0008589412,0.00044039782,0.0003143139,0.0005683123,0.0028159597,0.0014076333,0.0008468635,0.005528462],"category_scores_gemma":[0.006025078,0.00082113425,0.00032174346,0.00044762553,0.00048580318,0.0045607877,0.0024258073,0.003289821,0.0022559853],"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.0020174799,0.0011477486,0.008601025,0.0010662655,0.00010100548,0.0011770515,0.017892137,0.023818322,0.16870177,0.092745945,0.048110373,0.63462096],"study_design_scores_gemma":[0.0002685031,0.0020129313,0.00832023,0.0005301901,0.00032546805,0.0027479853,0.007826908,0.36896902,0.1788108,0.047946557,0.38208258,0.0001587818],"about_ca_topic_score_codex":0.0020845563,"about_ca_topic_score_gemma":0.00248948,"teacher_disagreement_score":0.005528462,"about_ca_system_score_codex":0.0005216679,"about_ca_system_score_gemma":0.00068598636,"threshold_uncertainty_score":0.018494487},"labels":[],"label_agreement":null},{"id":"W1929832589","doi":"10.1007/978-3-540-85521-7_11","title":"Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subdivision; Transfinite number; Context (archaeology); Computer science; Representation (politics); Vertex (graph theory); Interpolation (computer graphics); Algorithm; Boundary (topology); Mathematics; Theoretical computer science; Graph; Discrete mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.027047277463906907,"score_gpt":0.2613550573437748,"score_spread":0.2343077798798679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929832589","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.0017239315,0.0023252731,0.989504,0.00029072538,0.00027008133,0.000015398291,0.000038711074,0.00012245303,0.005709492],"genre_scores_gemma":[0.13245495,0.0063825985,0.8319201,0.0005061984,0.0009873271,0.00015425654,0.0002449186,0.0007829268,0.02656667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983632,0.0007556874,0.00015060331,0.0001511204,0.00051993167,0.00005944058],"domain_scores_gemma":[0.9967249,0.0020361096,0.00014969989,0.0004687424,0.0005159499,0.00010460718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046771877,0.0014732336,0.0016605201,0.0021194778,0.0007561906,0.0023849222,0.0017974096,0.0019838344,0.0041788593],"category_scores_gemma":[0.0077863284,0.0006895534,0.0018613924,0.0022434029,0.0032975306,0.005112061,0.0026387686,0.0059250784,0.0014836907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002697743,0.000023182218,0.00006975945,0.0002863276,0.000019832507,0.000057486737,0.00019388569,0.01072572,0.0019686203,0.94871145,0.002396454,0.03552033],"study_design_scores_gemma":[0.000006817642,0.000048794234,0.00009668661,0.00008527707,0.000026146308,0.00013545982,0.000045850098,0.122868426,0.0018932424,0.8573537,0.017410176,0.000029479006],"about_ca_topic_score_codex":0.0007701471,"about_ca_topic_score_gemma":0.0009978457,"teacher_disagreement_score":0.0046771877,"about_ca_system_score_codex":0.001068032,"about_ca_system_score_gemma":0.00055725087,"threshold_uncertainty_score":0.02473563},"labels":[],"label_agreement":null},{"id":"W1929950373","doi":"10.1007/978-3-642-38616-9_9","title":"Quantum Key Distribution in the Classical Authenticated Key Exchange Framework","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Mitacs; Government of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Quantum key distribution; Key exchange; BB84; Authentication (law); Key (lock); Adversary; Computer security; Secrecy; Key distribution; Information-theoretic security; Authenticated Key Exchange; Theoretical computer science; Quantum cryptography; Quantum; Public-key cryptography; Encryption; Quantum information","score_opus":0.017610765247015752,"score_gpt":0.2435210049012421,"score_spread":0.22591023965422635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929950373","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.02399389,0.0021915697,0.8961739,0.002477864,0.00048830156,0.00016153618,0.00018916551,0.00034743923,0.073976375],"genre_scores_gemma":[0.7535951,0.0026975088,0.19761091,0.00059364416,0.0008303934,0.00030391,0.00017587737,0.0001371576,0.044055536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780065,0.00079645833,0.00008637615,0.00026874404,0.0007989665,0.00024883627],"domain_scores_gemma":[0.99898595,0.00041533523,0.0000633242,0.00031892874,0.00016225132,0.000054196767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002166465,0.0004623089,0.00081799785,0.0006859583,0.0012647549,0.0032434869,0.0021792068,0.0017782011,0.0063058375],"category_scores_gemma":[0.003316501,0.00044518808,0.0005245256,0.0013986189,0.004040443,0.0065368367,0.0025472606,0.002642736,0.0014959159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018272587,0.0000073153556,0.000010556378,0.000016433689,0.0000029180512,0.000016441963,0.000030854568,0.0025684743,0.00033823223,0.99083555,0.0006718277,0.0054831253],"study_design_scores_gemma":[0.00001825976,0.00001644602,0.000031630803,0.0000140977545,0.000005716698,0.00005900667,0.000017158332,0.042164143,0.00080016936,0.94997877,0.0068784333,0.000016175492],"about_ca_topic_score_codex":0.0006176108,"about_ca_topic_score_gemma":0.0004533544,"teacher_disagreement_score":0.0063058375,"about_ca_system_score_codex":0.0018134803,"about_ca_system_score_gemma":0.0014405053,"threshold_uncertainty_score":0.021095157},"labels":[],"label_agreement":null},{"id":"W1930235639","doi":"10.1007/11848035_82","title":"An Information Filtering Approach for the Page Zero Problem","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Zero (linguistics); Computer science; Information retrieval; Mathematics; Artificial intelligence; Philosophy; Linguistics","score_opus":0.01906462694269709,"score_gpt":0.24279647442821858,"score_spread":0.2237318474855215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930235639","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.0034167229,0.0012180406,0.99204856,0.0005307538,0.00017626006,0.000026709024,0.00007832914,0.00025598868,0.002248601],"genre_scores_gemma":[0.1792716,0.0041603167,0.78818125,0.00087305455,0.002285942,0.00021993532,0.0012366107,0.0004130376,0.023358326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977907,0.0006415473,0.00011878087,0.00047466878,0.0007437595,0.00023047935],"domain_scores_gemma":[0.99188364,0.0054663504,0.0003722354,0.001044417,0.0010330646,0.00020029853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030660129,0.0010746032,0.0025189682,0.003237611,0.0016038952,0.0028186846,0.0028324958,0.0027536978,0.0061930926],"category_scores_gemma":[0.013957869,0.0006970671,0.0017588105,0.0037533517,0.0018795987,0.005476157,0.0017021,0.0030403144,0.002052204],"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.00037343038,0.00030176307,0.0012530349,0.0005471187,0.00015291595,0.00027076865,0.0002625312,0.07355511,0.0071950774,0.36257342,0.032286894,0.5212279],"study_design_scores_gemma":[0.000053650565,0.00011889296,0.000569078,0.000071879665,0.00008725738,0.00027111845,0.000049105358,0.5462017,0.0038600315,0.43787906,0.010777002,0.00006114339],"about_ca_topic_score_codex":0.0038120411,"about_ca_topic_score_gemma":0.0033540605,"teacher_disagreement_score":0.0061930926,"about_ca_system_score_codex":0.0011179913,"about_ca_system_score_gemma":0.0014629276,"threshold_uncertainty_score":0.020717978},"labels":[],"label_agreement":null},{"id":"W1930720625","doi":"10.1007/978-3-642-33266-1_36","title":"Improving Neural Networks Classification through Chaining","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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 Lethbridge","funders":"","keywords":"Chaining; Computer science; Artificial neural network; Artificial intelligence; Time delay neural network; Machine learning; Backward chaining; Nervous system network models; Types of artificial neural networks; Data mining; Pattern recognition (psychology); Expert system","score_opus":0.03358219382364943,"score_gpt":0.258982748861842,"score_spread":0.2254005550381926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930720625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045824584,0.0020469595,0.94083047,0.00036675294,0.00044073796,0.000111699825,0.00020085693,0.0030683933,0.00710958],"genre_scores_gemma":[0.41434208,0.0020360611,0.55307055,0.0005082387,0.0006545604,0.00025893401,0.0018355474,0.00096210476,0.026331943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991672,0.00016173413,0.000072539835,0.00023852248,0.00026657467,0.00009341565],"domain_scores_gemma":[0.9968213,0.0014702565,0.00018551563,0.00073869096,0.0006687303,0.00011547061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016759689,0.0012554821,0.001502249,0.0014457027,0.0007053081,0.0012793673,0.0020403594,0.0015341458,0.011803389],"category_scores_gemma":[0.005137848,0.0006646262,0.001009157,0.0019272034,0.0008322515,0.0030452772,0.0023601905,0.0026419056,0.004484234],"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.0002564877,0.00018542407,0.0011799176,0.00016644989,0.00010894646,0.000089340276,0.00005904435,0.16331075,0.010799612,0.010587023,0.0067550223,0.8065021],"study_design_scores_gemma":[0.000014231888,0.000086401604,0.00023877095,0.000032520995,0.000040304516,0.00003941354,0.000014028598,0.9748576,0.0069892793,0.014909396,0.0027670816,0.000010992476],"about_ca_topic_score_codex":0.0032329164,"about_ca_topic_score_gemma":0.004199587,"teacher_disagreement_score":0.011803389,"about_ca_system_score_codex":0.0006864098,"about_ca_system_score_gemma":0.00075839786,"threshold_uncertainty_score":0.03948629},"labels":[],"label_agreement":null},{"id":"W1931029610","doi":"10.1007/978-3-642-21590-2_26","title":"Motivic Topologies: Mathematical and Computational Modelling in Music Analysis","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Realization (probability); Rigour; Network topology; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.041120337641753525,"score_gpt":0.24813220213537235,"score_spread":0.20701186449361883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931029610","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.036750697,0.010928136,0.83412063,0.0031361242,0.0005746804,0.00006234513,0.00030291456,0.00026384808,0.11386069],"genre_scores_gemma":[0.6971272,0.007947968,0.24528188,0.0004659405,0.0014207639,0.00023517587,0.00042545065,0.00022242381,0.046873208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00019422853,0.000027504599,0.00006800659,0.0001067229,0.00003307651],"domain_scores_gemma":[0.9993031,0.0004068168,0.00005800717,0.00007801766,0.00009234271,0.00006166022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070631807,0.00059424876,0.00057605666,0.0013913984,0.0010311636,0.0032039508,0.0010122359,0.0010720877,0.007562318],"category_scores_gemma":[0.0023671405,0.00036666874,0.00062800245,0.0014686785,0.0034586787,0.0045314594,0.0014077177,0.0021367753,0.0012307229],"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.000003270048,0.0000034789832,0.000035165616,0.000021775997,0.0000017233552,0.000012453728,0.000082250604,0.00071770087,0.0001029625,0.99451715,0.00051814655,0.003984067],"study_design_scores_gemma":[0.0000026607047,0.000006448514,0.000058899546,0.000014632802,0.0000023728483,0.00005240638,0.000062098174,0.0074672964,0.00007380532,0.9845531,0.0077013876,0.000004891671],"about_ca_topic_score_codex":0.0005436997,"about_ca_topic_score_gemma":0.00061600737,"teacher_disagreement_score":0.007562318,"about_ca_system_score_codex":0.0006768126,"about_ca_system_score_gemma":0.0004073121,"threshold_uncertainty_score":0.025298417},"labels":[],"label_agreement":null},{"id":"W1931082782","doi":"10.1007/978-3-642-01004-0_9","title":"Security Analysis of Role Based Access Control Models Using Colored Petri Nets and CPNtools","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Role-based access control; Computer science; Petri net; Access control; Separation of duties; Flexibility (engineering); Information flow; Representation (politics); Distributed computing; Context (archaeology); Process architecture; Security policy; Hierarchy; Control flow; Security token; Theoretical computer science; Computer security; Programming language","score_opus":0.02773067912094553,"score_gpt":0.3041418588722941,"score_spread":0.2764111797513486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931082782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03570328,0.00018774167,0.95803523,0.0002794223,0.000053011256,0.00011503494,0.00011293774,0.0003575533,0.0051557496],"genre_scores_gemma":[0.8418768,0.00036420074,0.15099907,0.0000906263,0.000059533628,0.00019506107,0.0002136351,0.00015172073,0.0060493355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723583,0.00078610826,0.00013585587,0.00034811258,0.0010214848,0.00047252464],"domain_scores_gemma":[0.99431807,0.0037987528,0.00045243572,0.0005089245,0.00073750806,0.00018431178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029921231,0.00096617517,0.00095551065,0.0015470035,0.0009843817,0.0027826075,0.0018343297,0.0009739047,0.0035036535],"category_scores_gemma":[0.0072226874,0.0008148984,0.002921495,0.00091927906,0.0021311408,0.0035100754,0.0015715805,0.0022026259,0.00034205872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012685113,0.00010458319,0.0010783904,0.00009151325,0.00006933839,0.00022085579,0.0001898216,0.6346439,0.003450747,0.343463,0.0007014721,0.015859602],"study_design_scores_gemma":[0.000006686813,0.000013780312,0.00008281871,0.0000119619735,0.000018966495,0.000026065929,0.000024052755,0.9395714,0.00088911905,0.058889154,0.00045698145,0.000009041564],"about_ca_topic_score_codex":0.012984637,"about_ca_topic_score_gemma":0.008582637,"teacher_disagreement_score":0.012984637,"about_ca_system_score_codex":0.003312747,"about_ca_system_score_gemma":0.0035677245,"threshold_uncertainty_score":0.02581811},"labels":[],"label_agreement":null},{"id":"W1931647778","doi":"10.1007/978-3-642-33122-0_9","title":"An Optimal Reconciliation Algorithm for Gene Trees with Polytomies","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.015419245231160969,"score_gpt":0.2580344660041036,"score_spread":0.24261522077294265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931647778","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.025469204,0.0006816845,0.9647252,0.00038023083,0.00017999079,0.00022457026,0.0005175825,0.004757339,0.0030641053],"genre_scores_gemma":[0.054696497,0.0001476301,0.9405803,0.00013611949,0.00006675121,0.000218231,0.0017508984,0.00089827634,0.0015053573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979721,0.0006246939,0.00017380025,0.0005862549,0.00043105232,0.00021213495],"domain_scores_gemma":[0.9959882,0.0019806954,0.00016491264,0.0012853304,0.0004587902,0.00012210236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00253718,0.0013075648,0.0026684161,0.0022773133,0.0021968214,0.0022729945,0.004342611,0.002514472,0.0075327577],"category_scores_gemma":[0.008791632,0.0012399501,0.0025347436,0.0038707678,0.0015994658,0.0041044,0.004138737,0.0031011426,0.002784544],"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.0006306115,0.00026296877,0.0010096079,0.0003532401,0.00015273379,0.00018656066,0.00057063013,0.08562338,0.0060085924,0.03642191,0.02160315,0.8471766],"study_design_scores_gemma":[0.00034053248,0.0002107865,0.0008428871,0.0000905156,0.0001620408,0.00042570583,0.00029994422,0.754879,0.00802749,0.21867396,0.015975172,0.00007193137],"about_ca_topic_score_codex":0.0015370307,"about_ca_topic_score_gemma":0.0025245263,"teacher_disagreement_score":0.0075327577,"about_ca_system_score_codex":0.0011647396,"about_ca_system_score_gemma":0.0018252904,"threshold_uncertainty_score":0.025199533},"labels":[],"label_agreement":null},{"id":"W1931733763","doi":"10.1007/978-3-540-77105-0_20","title":"Network Formation: Bilateral Contracting and Myopic Dynamics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Pairwise comparison; Node (physics); Stochastic game; Computer science; Set (abstract data type); Network formation; Routing (electronic design automation); Repeated game; Crawling; Simple (philosophy); Computer network; Topology (electrical circuits); Mathematical optimization; Game theory; Mathematical economics; Mathematics; Engineering","score_opus":0.06514636889501765,"score_gpt":0.3364258573956081,"score_spread":0.27127948850059047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931733763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12772469,0.0029369707,0.6376521,0.004711006,0.00037780654,0.00012205525,0.00015270065,0.00010777626,0.22621493],"genre_scores_gemma":[0.90648824,0.002140017,0.032290526,0.00024972812,0.00027673296,0.00014409347,0.00006380568,0.0000455494,0.05830118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994374,0.00029636896,0.00001596777,0.00009403808,0.00009531523,0.000060856182],"domain_scores_gemma":[0.9983541,0.0010597672,0.00019747134,0.00013177292,0.00011935178,0.0001375949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624042,0.00047273116,0.00060245715,0.00034838266,0.0007193235,0.0016614887,0.0010692888,0.0016720511,0.008836464],"category_scores_gemma":[0.0068225204,0.0004109222,0.0004345582,0.0006607862,0.0018056374,0.0029563466,0.0014521602,0.0011920149,0.00050207344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035881614,0.00002413669,0.00017084517,0.0000630177,0.000013597453,0.00006399842,0.000108144566,0.046990808,0.0005614229,0.9374741,0.0025493016,0.011944742],"study_design_scores_gemma":[0.000028360739,0.000020848394,0.00015592248,0.000020543637,0.000009196439,0.00008501032,0.00006049875,0.14704177,0.00024031337,0.84820753,0.0041203485,0.000009623679],"about_ca_topic_score_codex":0.0011329466,"about_ca_topic_score_gemma":0.0010731923,"teacher_disagreement_score":0.008836464,"about_ca_system_score_codex":0.0012269579,"about_ca_system_score_gemma":0.00079570565,"threshold_uncertainty_score":0.029560983},"labels":[],"label_agreement":null},{"id":"W1931845768","doi":"10.1007/3-540-45654-6_33","title":"Towards a Computer-Aided Design of Reactive Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Scalability; Notation; Context (archaeology); Supervisory control; Representation (politics); State space; Theoretical computer science; State (computer science); Scale (ratio); Control (management); Programming language; Distributed computing; Artificial intelligence; Database; Mathematics","score_opus":0.050764824922186,"score_gpt":0.2882635640846574,"score_spread":0.2374987391624714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931845768","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.0015211779,0.00007120094,0.99574006,0.000036264857,0.000015091441,0.000050633156,0.000017856242,0.0005383881,0.0020093177],"genre_scores_gemma":[0.056512766,0.00029626337,0.93915707,0.00005453107,0.000016608466,0.00023214336,0.00009342152,0.00019061987,0.0034467378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998836,0.00035358383,0.000060594815,0.00014226297,0.0005487304,0.000058858743],"domain_scores_gemma":[0.99863166,0.0007900409,0.00007001848,0.00021312732,0.00027460154,0.000020506373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016383225,0.000885853,0.00078926637,0.00062072783,0.0005074404,0.0016191925,0.0015000362,0.001281972,0.005943131],"category_scores_gemma":[0.0030814162,0.000859925,0.0011973183,0.0003688645,0.0012402188,0.0007897173,0.0009462589,0.0014857316,0.0015840521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000134862,0.00009175002,0.000328952,0.0006566074,0.000086178676,0.0001742834,0.00039725317,0.5847994,0.031834938,0.18396966,0.0023043363,0.19522175],"study_design_scores_gemma":[0.00008352681,0.00012859724,0.00012901648,0.00013408787,0.00006297759,0.00012646534,0.000045774155,0.89371556,0.022695776,0.045163248,0.03768809,0.000026872642],"about_ca_topic_score_codex":0.0019919616,"about_ca_topic_score_gemma":0.0029643646,"teacher_disagreement_score":0.005943131,"about_ca_system_score_codex":0.0006055503,"about_ca_system_score_gemma":0.0015739653,"threshold_uncertainty_score":0.019881725},"labels":[],"label_agreement":null},{"id":"W1932081020","doi":"10.1007/978-3-319-19312-0_3","title":"Perspectives on Collaboration in Technology Innovation for Ageing","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Approaches in Technology and Social Development","field":"Business, Management and Accounting","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":"Toronto Rehabilitation Institute; University of Toronto; Simon Fraser University","funders":"","keywords":"Ageing; Business; Knowledge management; Computer science; Medicine","score_opus":0.031913500449515984,"score_gpt":0.2772017101204267,"score_spread":0.24528820967091072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932081020","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.031305812,0.24383363,0.007305259,0.13178629,0.0054935683,0.00005461426,0.000110016204,0.000045773708,0.580065],"genre_scores_gemma":[0.76716745,0.11787537,0.0032640074,0.012309575,0.008238303,0.00020824812,0.000118290365,0.000052449446,0.09076623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9976622,0.0011854079,0.00009158397,0.00021549725,0.00033820033,0.00050708675],"domain_scores_gemma":[0.9965643,0.0020343007,0.00027106245,0.00013686888,0.00036473176,0.0006286468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046873074,0.0007783923,0.00077542017,0.0022380329,0.0035678654,0.008160088,0.0013886476,0.0071531273,0.009513464],"category_scores_gemma":[0.0032659664,0.00017966189,0.0005948285,0.0033200176,0.011657454,0.010764787,0.0063973134,0.004237213,0.0011305974],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014680721,0.000021956073,0.00012393708,0.000116943425,0.0000044011676,0.00024792127,0.010840495,0.000120745965,0.00007869351,0.97325915,0.005839245,0.009331919],"study_design_scores_gemma":[0.000022897028,0.00007925405,0.0005573824,0.00053356116,0.000008852164,0.0008645048,0.014684112,0.0003132298,0.0001286916,0.66068494,0.3221022,0.000020501053],"about_ca_topic_score_codex":0.0018044508,"about_ca_topic_score_gemma":0.0018554943,"teacher_disagreement_score":0.009513464,"about_ca_system_score_codex":0.0044810013,"about_ca_system_score_gemma":0.0029215044,"threshold_uncertainty_score":0.03251213},"labels":[],"label_agreement":null},{"id":"W19322915","doi":"10.1007/978-3-319-08786-3_19","title":"Eye Tracking to Understand User Differences in Visualization Processing with Highlighting Interventions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Visualization; Computer science; Human–computer interaction; Eye tracking; Gaze; Bar chart; Task (project management); Visual analytics; Information visualization; Artificial intelligence; Engineering","score_opus":0.04554174995530865,"score_gpt":0.32307575677781986,"score_spread":0.2775340068225112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19322915","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.9127042,0.0013860194,0.065939814,0.00041229228,0.00017877395,0.000514482,0.0010245658,0.0013905414,0.016449407],"genre_scores_gemma":[0.9622934,0.00032824304,0.032589607,0.00023820846,0.00004425799,0.00038471745,0.00030386745,0.00026803807,0.0035495837],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99943906,0.0001598339,0.000037086636,0.00013358891,0.00016327354,0.0000672411],"domain_scores_gemma":[0.99486226,0.0037377293,0.00049031165,0.00029726684,0.00048708747,0.00012537507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010435694,0.0004853031,0.00029353873,0.0005448361,0.0002570155,0.0009780946,0.00045389996,0.0005667879,0.011060846],"category_scores_gemma":[0.0146719385,0.00018130794,0.00021382495,0.00039820114,0.00019211682,0.0013728001,0.0005370759,0.0006996251,0.0008794801],"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.007394418,0.0016711673,0.030552024,0.0018268499,0.00024763405,0.00026040713,0.010092154,0.002496658,0.4232646,0.004559013,0.008692624,0.5089424],"study_design_scores_gemma":[0.0010615018,0.009662669,0.77207285,0.0007417572,0.00084800815,0.0012258503,0.005989295,0.054560985,0.116254926,0.01577708,0.021525979,0.00027907646],"about_ca_topic_score_codex":0.001724831,"about_ca_topic_score_gemma":0.0017582439,"teacher_disagreement_score":0.011060846,"about_ca_system_score_codex":0.00028195934,"about_ca_system_score_gemma":0.0003598711,"threshold_uncertainty_score":0.037002146},"labels":[],"label_agreement":null},{"id":"W193255932","doi":"10.1007/978-3-642-42054-2_41","title":"Semi Supervised Autoencoders: Better Focusing Model Capacity during Feature Extraction","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Université de Montréal","funders":"","keywords":"Computer science; Autoencoder; Artificial intelligence; Pattern recognition (psychology); Machine learning; Feature extraction; Task (project management); Unsupervised learning; Deep learning; Data mining","score_opus":0.02212003609481173,"score_gpt":0.22627803316221387,"score_spread":0.20415799706740215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193255932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007012226,0.00018473751,0.99094534,0.000078610086,0.000028388507,0.000013512211,0.00006144521,0.0006580143,0.0010177526],"genre_scores_gemma":[0.43111387,0.0007754852,0.55217135,0.00038101888,0.00018657974,0.00015847612,0.0008656221,0.0008797301,0.013467857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.0000929221,0.000016382699,0.00007793308,0.000067111505,0.00003309295],"domain_scores_gemma":[0.99878293,0.00075684517,0.00005337499,0.00026799436,0.00011066477,0.000028247396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629722,0.0010274946,0.0008578304,0.00024723972,0.0002118789,0.0007095578,0.0009974616,0.00087830727,0.004795456],"category_scores_gemma":[0.002205346,0.0006467791,0.0007075183,0.0003765707,0.0004483609,0.0017609717,0.0013718401,0.0017977846,0.001945605],"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.00038499912,0.00014147343,0.0004852131,0.00022038727,0.00012137606,0.00016223287,0.00010791983,0.31691274,0.07835579,0.019626075,0.008948446,0.5745332],"study_design_scores_gemma":[0.0000056733907,0.000026631467,0.000096485775,0.0000074968,0.0000134888105,0.00004391289,0.0000060006555,0.9820769,0.012062539,0.0044930344,0.0011616788,0.000006183277],"about_ca_topic_score_codex":0.00076681987,"about_ca_topic_score_gemma":0.0015924036,"teacher_disagreement_score":0.004795456,"about_ca_system_score_codex":0.00023123731,"about_ca_system_score_gemma":0.0004665798,"threshold_uncertainty_score":0.016042411},"labels":[],"label_agreement":null},{"id":"W1933189888","doi":"10.1007/978-3-642-01932-6_1","title":"Characterization of Post-infarct Scars in a Porcine Model – A Combined Experimental and Theoretical Study","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Health Sciences Centre; Sunnybrook Health Science Centre","funders":"","keywords":"Ex vivo; Scars; In vivo; Segmentation; Biomedical engineering; Diffusion MRI; Magnetic resonance imaging; Medicine; Computer science; Pathology; Artificial intelligence; Radiology; Biology","score_opus":0.011844477543829694,"score_gpt":0.292891252836188,"score_spread":0.28104677529235833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933189888","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.88081765,0.012335306,0.09138061,0.00036928445,0.00009354746,0.00018699154,0.00043433587,0.00017811236,0.014204224],"genre_scores_gemma":[0.96842235,0.0052233967,0.019229112,0.00010350302,0.00005293909,0.00007665001,0.00068136654,0.000043048698,0.0061676186],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998603,0.000034479155,0.000008498137,0.0000295023,0.00004139823,0.00002583867],"domain_scores_gemma":[0.9995914,0.00020654038,0.000072681665,0.000062790336,0.000040687595,0.000025964626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006497673,0.00033609683,0.00026651574,0.0006747906,0.00026842448,0.00039162155,0.00053226756,0.0006858348,0.0022942305],"category_scores_gemma":[0.0003354739,0.000264223,0.00031234085,0.00031796924,0.0006498784,0.0011010614,0.00020631582,0.0004653288,0.00035461245],"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.00021184576,0.00014350943,0.00048077942,0.00021314049,0.0000081091375,0.0003723976,0.00010558718,0.000787333,0.9894559,0.0012663933,0.000088428525,0.0068665626],"study_design_scores_gemma":[0.000036259225,0.0035013533,0.021101996,0.000086548105,0.000096503885,0.007632158,0.0006288001,0.015977677,0.943184,0.0024686295,0.0052420045,0.000044094893],"about_ca_topic_score_codex":0.00023103655,"about_ca_topic_score_gemma":0.00021346359,"teacher_disagreement_score":0.0022942305,"about_ca_system_score_codex":0.00018018342,"about_ca_system_score_gemma":0.0001335371,"threshold_uncertainty_score":0.007674992},"labels":[],"label_agreement":null},{"id":"W1933190328","doi":"10.1007/11556121_18","title":"A New Approach to Camera Image Indexing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Metadata; Computer vision; Demosaicing; Artificial intelligence; Mobile device; Search engine indexing; Color filter array; Digital camera; Discrete cosine transform; Digital image; Digital watermarking; Color image; Image processing; Image (mathematics); Color gel; Layer (electronics)","score_opus":0.01608944849414567,"score_gpt":0.25242230931300386,"score_spread":0.23633286081885818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933190328","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.0013983751,0.000819591,0.9884511,0.00014539309,0.00025431233,0.00007052832,0.00011449502,0.0014059724,0.0073402217],"genre_scores_gemma":[0.04340283,0.00202796,0.92632896,0.0003138994,0.000737396,0.00018141238,0.0006139903,0.0006193517,0.025774177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802065,0.00018771332,0.0001404692,0.0004379085,0.0010899063,0.00012330114],"domain_scores_gemma":[0.99827945,0.0002691958,0.00007475269,0.00082433596,0.00047752014,0.00007469383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000643158,0.00083272794,0.0015884625,0.004040811,0.0014585139,0.00412149,0.0024504424,0.0014441725,0.011679489],"category_scores_gemma":[0.0028528366,0.0006423169,0.0011317849,0.0050808634,0.0013232676,0.0075950255,0.0034941218,0.0017768702,0.0057271426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117598276,0.00009890139,0.00024429892,0.00025265882,0.00005505736,0.00014052445,0.00019678252,0.0055392245,0.031463295,0.21495652,0.018790154,0.7281449],"study_design_scores_gemma":[0.00006642554,0.00017452447,0.0007634287,0.000125471,0.00015970865,0.0022273792,0.00023775584,0.36932412,0.05495184,0.3200234,0.25178206,0.00016395494],"about_ca_topic_score_codex":0.0016528663,"about_ca_topic_score_gemma":0.0022234556,"teacher_disagreement_score":0.011679489,"about_ca_system_score_codex":0.00087307807,"about_ca_system_score_gemma":0.00078716024,"threshold_uncertainty_score":0.0390718},"labels":[],"label_agreement":null},{"id":"W1933312167","doi":"10.1007/978-3-662-43948-7_27","title":"Characterization of Binary Constraint System Games","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Characterization (materials science); Simple (philosophy); Bounding overwatch; Class (philosophy); Constraint (computer-aided design); Binary number; Theoretical computer science; Decidability; Quantum entanglement; Algorithm; Mathematics; Artificial intelligence","score_opus":0.015447118990454152,"score_gpt":0.22130263269195324,"score_spread":0.2058555137014991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933312167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18026622,0.0010656804,0.54550177,0.0038147909,0.00031137362,0.0004466116,0.0021028135,0.00067552977,0.2658152],"genre_scores_gemma":[0.88997245,0.00070166826,0.065576866,0.0007517629,0.00032680883,0.00046177872,0.0021390708,0.0003105128,0.03975905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758697,0.0006879293,0.00015957668,0.00041442562,0.00072882103,0.0004221654],"domain_scores_gemma":[0.9960586,0.0021652454,0.0003881475,0.00022913351,0.00054897746,0.00061002356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012757466,0.0010021816,0.0010651874,0.0025358421,0.0017714807,0.0060941554,0.0022207184,0.0015607799,0.016186895],"category_scores_gemma":[0.0077257245,0.00078295736,0.0010676907,0.003049036,0.0024235176,0.005846074,0.0025183475,0.0035872944,0.0011785245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033504442,0.000023942903,0.00019255083,0.000041867137,0.000009086773,0.00003159149,0.00013738066,0.0016279054,0.00050720177,0.99117446,0.002122435,0.004098063],"study_design_scores_gemma":[0.0000231443,0.000014245197,0.00025271514,0.000032085947,0.000009797446,0.00007334887,0.00008517175,0.025684102,0.0003558455,0.9689794,0.0044725947,0.000017524868],"about_ca_topic_score_codex":0.0037013504,"about_ca_topic_score_gemma":0.00276087,"teacher_disagreement_score":0.016186895,"about_ca_system_score_codex":0.0028099914,"about_ca_system_score_gemma":0.0017027591,"threshold_uncertainty_score":0.05415058},"labels":[],"label_agreement":null},{"id":"W193481530","doi":"10.1007/978-3-642-19391-0_5","title":"On Language Decompositions and Primality","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University; University of Manitoba","funders":"","keywords":"Concatenation (mathematics); Computer science; Primality test; Formal language; Prime (order theory); Abstract family of languages; Regular language; Inverse; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Programming language; Combinatorics; Second-generation programming language; Fifth-generation programming language; Automaton","score_opus":0.012018288405341882,"score_gpt":0.23968593960206275,"score_spread":0.22766765119672086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193481530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048432827,0.0068827407,0.6606865,0.0050469534,0.0012232861,0.00010186263,0.0004271865,0.00064301846,0.27655563],"genre_scores_gemma":[0.6402948,0.006602438,0.25717333,0.0014864394,0.0018113779,0.0003717569,0.0009732775,0.0011998195,0.090086736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904364,0.00036065804,0.000065828644,0.00020895993,0.00017379565,0.00014704102],"domain_scores_gemma":[0.99805415,0.0011330182,0.00011080053,0.00031376316,0.00023533012,0.00015294716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775314,0.0009550697,0.00095326785,0.0015186006,0.0018006242,0.003581718,0.0009422823,0.00093552936,0.013076051],"category_scores_gemma":[0.0038703321,0.0010964302,0.0015300448,0.0015997445,0.004586332,0.0112940995,0.0041198875,0.005348568,0.0026342524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013788586,0.000006563424,0.000028305565,0.000031495427,0.000002931532,0.000023219949,0.00017462893,0.00025025103,0.00024147033,0.9901659,0.0012093812,0.00785204],"study_design_scores_gemma":[0.000003474434,0.0000032551159,0.000018404538,0.000014468857,0.0000033807364,0.000041102143,0.000034815337,0.00057743257,0.00014114029,0.9947296,0.0044301697,0.000002807496],"about_ca_topic_score_codex":0.00039547036,"about_ca_topic_score_gemma":0.00039181666,"teacher_disagreement_score":0.013076051,"about_ca_system_score_codex":0.0013500982,"about_ca_system_score_gemma":0.00058096816,"threshold_uncertainty_score":0.04374373},"labels":[],"label_agreement":null},{"id":"W1934957673","doi":"10.1007/11788911_16","title":"An Efficient System for Detecting Outliers from Financial Time Series","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outlier; Computer science; Strengths and weaknesses; Anomaly detection; Time series; Series (stratigraphy); Data mining; Finance; Financial market; Artificial intelligence; Machine learning","score_opus":0.04066673123829086,"score_gpt":0.3203210036050929,"score_spread":0.27965427236680207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934957673","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.014336822,0.00016175005,0.9766167,0.00006147237,0.00009169381,0.000102702084,0.00020591225,0.007920627,0.0005022972],"genre_scores_gemma":[0.19411586,0.00017329742,0.79970884,0.00022095283,0.0001954551,0.0004005375,0.0008212534,0.00026658378,0.004097293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992236,0.000110431305,0.0000772921,0.00021528153,0.00030184005,0.000071513845],"domain_scores_gemma":[0.9985172,0.00060335203,0.0001267276,0.00022204382,0.00046367955,0.00006703778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012047275,0.0010032214,0.0014491956,0.0017706715,0.00064735883,0.0012903658,0.0015105818,0.0015855597,0.0041407445],"category_scores_gemma":[0.0036442617,0.00052560715,0.000426859,0.0012652139,0.00032850564,0.0013583959,0.0014985322,0.0008660066,0.0030946692],"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.0009526885,0.00022571746,0.0025839736,0.00018748845,0.000088748435,0.00029072916,0.00012577802,0.014585388,0.082301795,0.0032859168,0.009531057,0.8858407],"study_design_scores_gemma":[0.00012452275,0.00035452904,0.0034171888,0.000029870267,0.000114983195,0.00044080717,0.00005052628,0.92034745,0.062034197,0.00517198,0.0078484565,0.00006546567],"about_ca_topic_score_codex":0.0012659892,"about_ca_topic_score_gemma":0.0019200495,"teacher_disagreement_score":0.0041407445,"about_ca_system_score_codex":0.00033123474,"about_ca_system_score_gemma":0.0006385125,"threshold_uncertainty_score":0.013852119},"labels":[],"label_agreement":null},{"id":"W1935236720","doi":"10.1007/978-3-540-37275-2_133","title":"An Overview of Wireless Networks in Control and Monitoring","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":27,"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":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Wireless network; Wireless; Computer network; Telecommunications","score_opus":0.01820530226865115,"score_gpt":0.2531769857746606,"score_spread":0.23497168350600944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935236720","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015726602,0.6323163,0.27823552,0.0026666138,0.004504756,0.00012464024,0.0001704844,0.00078450725,0.079624444],"genre_scores_gemma":[0.022772053,0.73881376,0.160557,0.0017523628,0.007137425,0.00032776405,0.00044322223,0.00021402718,0.06798247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954945,0.00007895466,0.000038373662,0.00008712339,0.00021364223,0.00003239715],"domain_scores_gemma":[0.99966073,0.00018300397,0.000018695122,0.000029256713,0.00008673778,0.000021591359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005331495,0.0014498844,0.0010380835,0.0016148614,0.00044490045,0.002098687,0.0015335242,0.0018162298,0.0068369033],"category_scores_gemma":[0.00076373504,0.0006264717,0.0005542625,0.0033456802,0.0006592897,0.0037263455,0.0010418463,0.001544911,0.00405825],"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.00005321521,0.00011693573,0.000303316,0.003323457,0.000055644163,0.0002483183,0.00013912561,0.01068425,0.0039363983,0.14034784,0.06038079,0.7804107],"study_design_scores_gemma":[0.000012393956,0.000079202146,0.00035888745,0.00070830155,0.000039336897,0.0007472442,0.00006446733,0.013030586,0.001044094,0.07192902,0.911954,0.000032512125],"about_ca_topic_score_codex":0.0008085669,"about_ca_topic_score_gemma":0.0011819325,"teacher_disagreement_score":0.0068369033,"about_ca_system_score_codex":0.0005359062,"about_ca_system_score_gemma":0.000674036,"threshold_uncertainty_score":0.022871673},"labels":[],"label_agreement":null},{"id":"W1935297443","doi":"10.1007/978-3-642-29963-6_4","title":"Non-standards for Trust: Foreground Trust and Second Thoughts for Mobile Security","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"Carleton University; Communications Research Centre Canada","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Mobile device; Focus (optics); Work (physics); Computational trust; Human–computer interaction; Internet privacy; Computer security; World Wide Web","score_opus":0.08399652178876935,"score_gpt":0.37864535643920605,"score_spread":0.2946488346504367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935297443","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.033586655,0.027518718,0.22864951,0.13366476,0.004093889,0.00006772013,0.0001354238,0.00015951805,0.5721238],"genre_scores_gemma":[0.9186206,0.0042490736,0.013771148,0.004570762,0.0020896043,0.0001012095,0.00005482812,0.0001673809,0.056375455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979388,0.0010442799,0.00010309253,0.00026215965,0.00041050828,0.00024106752],"domain_scores_gemma":[0.9959282,0.002424936,0.00026213395,0.0006482775,0.00049178815,0.00024469016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002882491,0.00068400183,0.0006973685,0.0010681949,0.003038891,0.008639704,0.0012469811,0.0048566754,0.00597485],"category_scores_gemma":[0.0060623097,0.00043012184,0.0006470004,0.0010700164,0.019149948,0.02019537,0.003304146,0.0095394105,0.0010879983],"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.000003899307,0.0000032824125,0.000022209162,0.000009809572,0.0000011708034,0.00001770299,0.00072333537,0.00005238684,0.000034681474,0.99625754,0.0011773485,0.0016965966],"study_design_scores_gemma":[0.0000026610646,0.00000594495,0.00003348852,0.000032801665,0.0000020922382,0.00004228326,0.0003565319,0.00030558935,0.00006580658,0.985216,0.013932009,0.0000046852765],"about_ca_topic_score_codex":0.0018463685,"about_ca_topic_score_gemma":0.0016629662,"teacher_disagreement_score":0.008639704,"about_ca_system_score_codex":0.00461402,"about_ca_system_score_gemma":0.0014147055,"threshold_uncertainty_score":0.033477247},"labels":[],"label_agreement":null},{"id":"W1936061154","doi":"10.1007/978-3-642-41068-0_4","title":"Potential Tissue Puncture Notification during Telesurgery","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"IMRIS (Canada); University of Calgary","funders":"","keywords":"Haptic technology; Modality (human–computer interaction); Modalities; Biomedical engineering; Computer science; Operator (biology); Wrist; Task (project management); Simulation; Stimulus modality; Medicine; Human–computer interaction; Acoustics; Artificial intelligence; Computer vision; Sensory system; Surgery; Engineering; Physics; Psychology; Neuroscience","score_opus":0.019110015861406215,"score_gpt":0.26121496928505816,"score_spread":0.24210495342365196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936061154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047114257,0.037134197,0.6542172,0.0040307026,0.011774779,0.00039598765,0.00053168787,0.0069600977,0.23784123],"genre_scores_gemma":[0.44078428,0.030428981,0.18530115,0.0032993525,0.0036680505,0.0003518589,0.0007674861,0.001441568,0.3339572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948573,0.00010765488,0.000032023137,0.00005046621,0.0002755665,0.000048522514],"domain_scores_gemma":[0.99883014,0.0007308443,0.000105713494,0.000083859784,0.00016150388,0.00008799004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006682134,0.00094679964,0.000487603,0.00040237093,0.00039231172,0.0010317035,0.0011512986,0.0013940558,0.013929199],"category_scores_gemma":[0.0030293178,0.00025746113,0.00042507504,0.00020795269,0.00029202524,0.0009718228,0.0010596667,0.001175088,0.0061653648],"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.00073005795,0.00011805438,0.0011776247,0.0009640487,0.000023670304,0.0051993662,0.0007422122,0.0020177355,0.049225308,0.004582604,0.040947217,0.89427215],"study_design_scores_gemma":[0.00015930999,0.0034838722,0.023633178,0.0050857193,0.00025511475,0.12306532,0.0019431646,0.037182193,0.12502927,0.03270828,0.64704466,0.00040993004],"about_ca_topic_score_codex":0.0003365871,"about_ca_topic_score_gemma":0.000703507,"teacher_disagreement_score":0.013929199,"about_ca_system_score_codex":0.00024261353,"about_ca_system_score_gemma":0.0005629358,"threshold_uncertainty_score":0.04659778},"labels":[],"label_agreement":null},{"id":"W1936642637","doi":"10.1007/978-3-319-24574-4_10","title":"Interactive Whole-Heart Segmentation in Congenital Heart Disease","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Congenital Heart Disease Studies","field":"Medicine","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institutes of Health; Natural Sciences and Engineering Research Council of Canada; Harvard Catalyst; Boston Children's Hospital","keywords":"Heart disease; Medicine; Segmentation; Cardiology; Computer science; Internal medicine; Artificial intelligence","score_opus":0.023119549985382383,"score_gpt":0.3169747796801674,"score_spread":0.293855229694785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936642637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2512088,0.007425823,0.7021536,0.0015147196,0.0003477843,0.0003720028,0.0036349893,0.020942321,0.012399905],"genre_scores_gemma":[0.5555662,0.0030769575,0.42714664,0.0006331234,0.0004211233,0.00017323987,0.002290736,0.0038070525,0.0068849204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996917,0.00008795146,0.000026507054,0.00005744338,0.00007578991,0.00006070946],"domain_scores_gemma":[0.9989574,0.0006968274,0.000034950473,0.00010987859,0.0000868965,0.00011408329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103949,0.000949024,0.000900242,0.0021457411,0.00044441974,0.0017121198,0.0009176488,0.0021909205,0.0106077725],"category_scores_gemma":[0.0020477322,0.00087593915,0.00087053666,0.0008472238,0.00029910004,0.00067909074,0.0016010809,0.0008470252,0.0015095788],"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.004236864,0.00030195987,0.012549042,0.0016294448,0.00057830266,0.0048260074,0.0010035521,0.03555188,0.24918897,0.003275091,0.026479047,0.6603798],"study_design_scores_gemma":[0.00049675594,0.00055443274,0.04622756,0.0004729431,0.0007631848,0.017713545,0.0008147912,0.74609506,0.13483371,0.011363669,0.040377222,0.00028717966],"about_ca_topic_score_codex":0.0027098851,"about_ca_topic_score_gemma":0.006378093,"teacher_disagreement_score":0.0106077725,"about_ca_system_score_codex":0.00030607087,"about_ca_system_score_gemma":0.0005110754,"threshold_uncertainty_score":0.03548658},"labels":[],"label_agreement":null},{"id":"W1937925830","doi":"10.1007/978-3-319-17142-5_29","title":"Algorithms in the Ultra-Wide Word Model","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Word (group theory); Parallel computing; Prefix; Concurrency; Context (archaeology); Programming paradigm; Theoretical computer science; Programming language","score_opus":0.03650257839557475,"score_gpt":0.26940851793368276,"score_spread":0.232905939538108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937925830","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.0066036982,0.0024261903,0.9800468,0.0010741962,0.0002214504,0.000030053514,0.00021316508,0.00057877286,0.008805669],"genre_scores_gemma":[0.23375297,0.0057055587,0.72368586,0.0018870533,0.0012686874,0.0004362344,0.0019513947,0.001014796,0.030297477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796605,0.00072514504,0.00018635,0.00038223393,0.0005689042,0.00017133605],"domain_scores_gemma":[0.9935361,0.004309451,0.00023602294,0.0012134084,0.00059566693,0.00010941013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019763599,0.00081084383,0.0014040258,0.0017527038,0.0008508061,0.0032931203,0.0025830606,0.0019257052,0.0066818283],"category_scores_gemma":[0.011823873,0.0005870775,0.0012303342,0.0029283657,0.002107959,0.01026586,0.0032307059,0.0037165352,0.0036215014],"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.000056616347,0.000030147652,0.00016945759,0.0001645233,0.000026451162,0.000041798266,0.00012434596,0.01974387,0.0006691844,0.85999227,0.0069624833,0.112018816],"study_design_scores_gemma":[0.000008539627,0.000011308745,0.00003160384,0.00002586517,0.0000068168038,0.000048300895,0.00002053023,0.07078564,0.00035758447,0.9244497,0.004244634,0.000009399235],"about_ca_topic_score_codex":0.0011228968,"about_ca_topic_score_gemma":0.0010468569,"teacher_disagreement_score":0.0066818283,"about_ca_system_score_codex":0.0010905463,"about_ca_system_score_gemma":0.0010875589,"threshold_uncertainty_score":0.022352934},"labels":[],"label_agreement":null},{"id":"W1939016344","doi":"10.1007/978-3-540-30503-3_56","title":"Practical Region-Based Matching for Stereo Vision","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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 Manitoba","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Stereopsis; Computer stereo vision; Matching (statistics); Observer (physics); Machine vision; Stereo cameras; Object (grammar); Field (mathematics); Mathematics","score_opus":0.022498707858457326,"score_gpt":0.26689608487751054,"score_spread":0.24439737701905323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939016344","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.000956592,0.00014753912,0.99759835,0.000014079523,0.000016040569,0.00001388696,0.000021986669,0.0005092015,0.0007222643],"genre_scores_gemma":[0.05568457,0.00037276273,0.93918294,0.000042963176,0.0000399583,0.000060945873,0.00025223108,0.00029853286,0.0040651257],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922705,0.00013741454,0.000034030425,0.00015324773,0.00038242704,0.000065744345],"domain_scores_gemma":[0.9995622,0.00013085986,0.000024833182,0.00015644841,0.000111173875,0.000014516762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006732669,0.0007091799,0.0010534478,0.0008375711,0.00039557295,0.00080929114,0.002018013,0.0013253329,0.009686615],"category_scores_gemma":[0.0016500329,0.0009119201,0.0007495146,0.0014716738,0.00045841624,0.0018037879,0.0015872795,0.0010758108,0.0045230524],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017414082,0.000075383745,0.00013544213,0.00020778042,0.000046016467,0.00005485727,0.000062362844,0.052414242,0.051281773,0.027183367,0.00703297,0.86133164],"study_design_scores_gemma":[0.000034936184,0.00010988457,0.00035366663,0.000025954296,0.000026785017,0.00041787166,0.000033226206,0.89680487,0.037191417,0.047833804,0.01713884,0.000028831877],"about_ca_topic_score_codex":0.0014928351,"about_ca_topic_score_gemma":0.001837632,"teacher_disagreement_score":0.009686615,"about_ca_system_score_codex":0.00040317507,"about_ca_system_score_gemma":0.00060139556,"threshold_uncertainty_score":0.03240496},"labels":[],"label_agreement":null},{"id":"W193938319","doi":"10.1007/978-3-642-33515-0_39","title":"Velocity Selection for High-Speed UGVs in Rough Unknown Terrains Using Force Prediction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Dynamics and Control Systems","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 Calgary","funders":"","keywords":"Terrain; Base (topology); Elevation angle; Elevation (ballistics); Frame (networking); Selection (genetic algorithm); Control theory (sociology); Robot","score_opus":0.012991882076227767,"score_gpt":0.21429534289002058,"score_spread":0.20130346081379283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193938319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10074054,0.00033983655,0.89465505,0.00013132014,0.00007292364,0.00005097259,0.00006390281,0.0006305781,0.0033148846],"genre_scores_gemma":[0.92428344,0.00013113332,0.072239704,0.0000345891,0.0000432617,0.000065980625,0.0001488603,0.000067975554,0.002984962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982965,0.00003212961,0.000006619693,0.000029005212,0.000057240966,0.000045282974],"domain_scores_gemma":[0.9996124,0.00018679454,0.000035591253,0.000025731777,0.00010451277,0.000034923898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034254955,0.0008325462,0.00096909713,0.0006040639,0.00062719703,0.0006030748,0.00084487506,0.00079484325,0.0015296901],"category_scores_gemma":[0.0010392754,0.0004845453,0.00035884386,0.00052913337,0.00037254053,0.0006462409,0.0006534409,0.0006044201,0.00037728797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029665916,0.00008520004,0.001650162,0.00007745148,0.000034831533,0.00011568798,0.0000969388,0.8528558,0.008368227,0.0016733333,0.0014479333,0.13329765],"study_design_scores_gemma":[0.0000075313797,0.00002375439,0.00022735672,0.0000026786,0.0000022176066,0.000008120531,0.000011004159,0.9986745,0.00057712465,0.00031771875,0.00014559102,0.000002391529],"about_ca_topic_score_codex":0.008213724,"about_ca_topic_score_gemma":0.0069760135,"teacher_disagreement_score":0.008213724,"about_ca_system_score_codex":0.00031339526,"about_ca_system_score_gemma":0.00060991413,"threshold_uncertainty_score":0.016331851},"labels":[],"label_agreement":null},{"id":"W193970460","doi":"10.1007/978-3-642-34752-8_11","title":"Improving Supervised Keyphrase Indexer Classification of Keyphrases with Text Denoising","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Information retrieval; Pattern recognition (psychology)","score_opus":0.018745757084550643,"score_gpt":0.25325356572081503,"score_spread":0.2345078086362644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193970460","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.098370984,0.0033905914,0.8795751,0.00040206956,0.00057907135,0.00020315647,0.0013969,0.012555279,0.0035268697],"genre_scores_gemma":[0.36684704,0.0019018253,0.5967061,0.00043845558,0.0008967751,0.00021606818,0.007325082,0.0011218362,0.024546858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986922,0.0001823233,0.00009688669,0.00035849924,0.0005017993,0.00016828443],"domain_scores_gemma":[0.9972573,0.0008886777,0.00021543526,0.0005674291,0.00092914567,0.0001420403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013466361,0.0015352111,0.0022555506,0.003147478,0.0005256835,0.0016449607,0.0013247234,0.0016233232,0.003686516],"category_scores_gemma":[0.0040118536,0.00036032838,0.0012137301,0.002215907,0.00045951433,0.0020950623,0.0012364144,0.0016774038,0.008272681],"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.0009350859,0.00024860742,0.0013505941,0.00020406037,0.00008249433,0.0001137253,0.000054750366,0.005381874,0.12790497,0.00096679555,0.010070374,0.8526866],"study_design_scores_gemma":[0.000069391106,0.00033358895,0.0039176825,0.00003240599,0.00014648814,0.0004420126,0.00011570628,0.8803622,0.102297954,0.002876482,0.0093585625,0.0000475781],"about_ca_topic_score_codex":0.001974928,"about_ca_topic_score_gemma":0.0033999006,"teacher_disagreement_score":0.003686516,"about_ca_system_score_codex":0.00041711333,"about_ca_system_score_gemma":0.0008054437,"threshold_uncertainty_score":0.012332618},"labels":[],"label_agreement":null},{"id":"W1940458181","doi":"10.1007/978-3-642-30618-1_5","title":"A Closed-Form Differential Formulation for Ultrasound Spatial Calibration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Calibration; Imaging phantom; Computer vision; Artificial intelligence; Coordinate system; Transformation (genetics); Transformation matrix; Mathematics; Optics; Statistics; Physics","score_opus":0.013864844606967512,"score_gpt":0.2506661231923189,"score_spread":0.23680127858535138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940458181","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.0003301039,0.00021861882,0.99677783,0.000099487435,0.000075975324,0.000016099313,0.000032362732,0.00005410968,0.0023954352],"genre_scores_gemma":[0.08878267,0.0022113465,0.8631141,0.00057544524,0.00044631382,0.0003095139,0.00045887986,0.00049413275,0.043607622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.00013282202,0.000031997897,0.00012385522,0.00021920234,0.000022293356],"domain_scores_gemma":[0.9993647,0.0002764259,0.000040577084,0.00007029007,0.00022429223,0.000023648594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010205728,0.0010003595,0.00096683536,0.0005152028,0.00040822424,0.0014941869,0.0015522807,0.0024684938,0.008934771],"category_scores_gemma":[0.0025814811,0.0006014531,0.0010885264,0.0007852191,0.0008728024,0.0018841882,0.002022932,0.002066826,0.0031097236],"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.000057702862,0.000116382595,0.00028620262,0.000576739,0.000057612193,0.00038358071,0.00033864827,0.32557002,0.019952677,0.42629313,0.016135281,0.21023206],"study_design_scores_gemma":[0.000008176749,0.000035035417,0.00008175599,0.000030017778,0.000014268039,0.00018967949,0.000033964,0.9387579,0.0015360904,0.045308102,0.013982688,0.000022326898],"about_ca_topic_score_codex":0.0016217437,"about_ca_topic_score_gemma":0.0021175556,"teacher_disagreement_score":0.008934771,"about_ca_system_score_codex":0.00060034293,"about_ca_system_score_gemma":0.000786708,"threshold_uncertainty_score":0.029889762},"labels":[],"label_agreement":null},{"id":"W194050023","doi":"10.1007/978-3-540-87779-0_7","title":"Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Mutual exclusion; Computer science; Asynchronous communication; Class (philosophy); Theoretical computer science; Algorithm; Closing (real estate); Shared memory; Parallel computing; Computer network; Artificial intelligence","score_opus":0.050233849505739434,"score_gpt":0.2678825908409869,"score_spread":0.21764874133524748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194050023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05596746,0.0053599956,0.8333466,0.013685961,0.0010333111,0.000107750624,0.00021468596,0.001000591,0.08928353],"genre_scores_gemma":[0.7539886,0.0038023654,0.21282338,0.0018161733,0.0020927126,0.00029061525,0.00035267792,0.0006118689,0.024221614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961326,0.0008641151,0.00012034962,0.00040679137,0.0020676842,0.00040854904],"domain_scores_gemma":[0.98613095,0.010046301,0.00038599357,0.0023436625,0.0007654019,0.000327748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431593,0.0006837008,0.0011953999,0.00084417337,0.0020643028,0.004174502,0.0022805454,0.002148942,0.006995394],"category_scores_gemma":[0.013781917,0.0006558316,0.0010889781,0.0015838087,0.004424283,0.016543258,0.0049418807,0.0060777497,0.0009239185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012461537,0.000037589176,0.00017976166,0.00011442768,0.000016027698,0.000051860352,0.00028550057,0.013043961,0.0008779267,0.9388084,0.004536426,0.041923612],"study_design_scores_gemma":[0.000021847916,0.000019585988,0.00013875672,0.000029618866,0.000010989804,0.00010944511,0.000060077044,0.045550097,0.0011187381,0.9372049,0.015718818,0.0000171396],"about_ca_topic_score_codex":0.002869361,"about_ca_topic_score_gemma":0.002034632,"teacher_disagreement_score":0.006995394,"about_ca_system_score_codex":0.0033109372,"about_ca_system_score_gemma":0.0028248513,"threshold_uncertainty_score":0.024022639},"labels":[],"label_agreement":null},{"id":"W1940847786","doi":"10.1007/3-540-45357-1_61","title":"Interactive Construction of Decision Trees","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Domain (mathematical analysis); Decision tree; Preference; Process (computing); Decision process; Human–computer interaction; Tree (set theory); Artificial intelligence; Management science; Programming language","score_opus":0.014567321842768497,"score_gpt":0.2646791023793548,"score_spread":0.25011178053658634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940847786","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.010881933,0.0002145127,0.977452,0.00022062473,0.00006301521,0.00012348115,0.00057007436,0.0024200852,0.0080543095],"genre_scores_gemma":[0.14283042,0.0002568321,0.84718,0.00012081388,0.00006769997,0.0002618187,0.0031584562,0.00065937894,0.005464635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743205,0.0008354764,0.00017778788,0.00047118176,0.00084068836,0.00024286058],"domain_scores_gemma":[0.9925869,0.0053010653,0.00013867633,0.0011176835,0.0006008839,0.0002548538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019519383,0.0006847415,0.0011831102,0.0016482021,0.0010161274,0.0021378929,0.0020268075,0.0008135956,0.015476314],"category_scores_gemma":[0.010954756,0.0011030177,0.0022760178,0.001790137,0.001002606,0.0027953947,0.004808648,0.0024310655,0.0043360554],"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.00055714784,0.00025831864,0.0025010481,0.00073972804,0.00018275935,0.00047902434,0.000854222,0.06607203,0.013259406,0.24952626,0.030432058,0.635138],"study_design_scores_gemma":[0.00011846775,0.00008617915,0.00075151416,0.00011510355,0.000098052995,0.00028180226,0.00019182854,0.4523085,0.012382693,0.49303964,0.040588927,0.000037258018],"about_ca_topic_score_codex":0.0010603272,"about_ca_topic_score_gemma":0.0023730958,"teacher_disagreement_score":0.015476314,"about_ca_system_score_codex":0.0008679773,"about_ca_system_score_gemma":0.0010294517,"threshold_uncertainty_score":0.05177343},"labels":[],"label_agreement":null},{"id":"W194127526","doi":"10.1007/978-3-319-07440-5_42","title":"An Introduction to the FLOE Project","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Software portability; Repurposing; Open educational resources; Reuse; Set (abstract data type); Personalized learning; Resource (disambiguation); World Wide Web; Multimedia; Knowledge management; Open learning; Teaching method; Mathematics education; Cooperative learning","score_opus":0.01634832689902657,"score_gpt":0.27397716740808403,"score_spread":0.2576288405090575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194127526","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003149474,0.02564563,0.116237454,0.008655307,0.004086735,0.00018922811,0.0013168191,0.0035559793,0.8371634],"genre_scores_gemma":[0.022614392,0.02479451,0.06091683,0.0024923584,0.0023888564,0.00021439347,0.002202309,0.0032542772,0.88112205],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962234,0.000057170295,0.000018411789,0.0000774693,0.00016762438,0.00005682621],"domain_scores_gemma":[0.99962306,0.00013532689,0.000017187303,0.00006150503,0.00008695938,0.00007592106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007947804,0.0006876044,0.00041853826,0.0017177257,0.0010975918,0.0031485688,0.000803768,0.0013383032,0.13066263],"category_scores_gemma":[0.0018781357,0.0004170988,0.0004453179,0.0018068907,0.0010087917,0.00555816,0.002407079,0.0014088685,0.05132308],"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.00003685756,0.00008139301,0.00015132235,0.00034854544,0.0000042440333,0.00010071766,0.00048637297,0.00045695214,0.0013988864,0.15336974,0.3899558,0.45360923],"study_design_scores_gemma":[0.0000027031087,0.000007678148,0.000094212584,0.00010767186,7.698395e-7,0.000115975454,0.000046677906,0.00009671564,0.0001379918,0.016706757,0.9826766,0.00000625128],"about_ca_topic_score_codex":0.0007653564,"about_ca_topic_score_gemma":0.001474529,"teacher_disagreement_score":0.13066263,"about_ca_system_score_codex":0.0007643659,"about_ca_system_score_gemma":0.0006174925,"threshold_uncertainty_score":0.43711007},"labels":[],"label_agreement":null},{"id":"W1941622581","doi":"10.1007/978-3-642-30615-0_1","title":"Odd Perfect Sequences and Sets of Spreading Sequences with Zero or Low Odd Periodic Correlation Zone","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interleaving; Generalization; Periodic sequence; Sequence (biology); Mathematics; Zero (linguistics); Correlation; Property (philosophy); Periodic function; Combinatorics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.01571456617777861,"score_gpt":0.23252073574837176,"score_spread":0.21680616957059315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941622581","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.64788365,0.002561961,0.21343361,0.00043826352,0.00026479314,0.00009524334,0.0009642363,0.0002624753,0.13409582],"genre_scores_gemma":[0.9351076,0.0011773275,0.037097752,0.00016006189,0.00021630734,0.00016972006,0.0007989505,0.000099090066,0.025173154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956197,0.000086096225,0.000032867752,0.00008668679,0.0001611053,0.0000712854],"domain_scores_gemma":[0.9988158,0.0005410567,0.00016116307,0.0002328552,0.00012676003,0.0001223506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043515014,0.0005745372,0.0006004697,0.0016805945,0.001021046,0.0021838092,0.0008524789,0.0005465997,0.0026849792],"category_scores_gemma":[0.0020682013,0.0003795408,0.00048810296,0.0009929186,0.0020450533,0.0014776784,0.0014463189,0.0008046293,0.00040189366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105641884,0.000013323809,0.0004619289,0.00006931117,0.000012575427,0.00012991064,0.00017685056,0.0035172396,0.003993514,0.9813805,0.0006225193,0.009516719],"study_design_scores_gemma":[0.000021665926,0.000054763666,0.0009895177,0.000048406073,0.000019803543,0.00044178785,0.00012948678,0.019796688,0.004793571,0.9671458,0.0065288064,0.000029670826],"about_ca_topic_score_codex":0.0004112394,"about_ca_topic_score_gemma":0.00030671377,"teacher_disagreement_score":0.0026849792,"about_ca_system_score_codex":0.0006575465,"about_ca_system_score_gemma":0.00050704804,"threshold_uncertainty_score":0.008982182},"labels":[],"label_agreement":null},{"id":"W1942076951","doi":"10.1007/978-3-319-08389-6_8","title":"A Framework for Qualitative Representation and Reasoning about Spatiotemporal Patterns","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université Laval","funders":"","keywords":"Computer science; Representation (politics); Domain (mathematical analysis); Context (archaeology); Expressive power; Qualitative reasoning; Artificial intelligence; Data science; Human–computer interaction; Theoretical computer science","score_opus":0.045816653687028815,"score_gpt":0.3466423734625906,"score_spread":0.3008257197755618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942076951","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.00044073246,0.00013183893,0.99632543,0.0002058165,0.000027939366,0.000072357056,0.00038770348,0.0005542702,0.001853856],"genre_scores_gemma":[0.03175282,0.00044673894,0.96330076,0.00013862469,0.000057327437,0.00038530774,0.0012956675,0.00019286352,0.0024298725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767154,0.00058546604,0.000373668,0.00046958958,0.0007344026,0.0001653343],"domain_scores_gemma":[0.9969427,0.0013294627,0.0002662329,0.00069597637,0.0006254806,0.00014014245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040387237,0.0012738087,0.0012137209,0.004138641,0.0019804414,0.006320821,0.004313594,0.0017270147,0.00940674],"category_scores_gemma":[0.009166209,0.0013347479,0.003945898,0.005135846,0.0037879252,0.010254528,0.0043597776,0.0029098338,0.0025019145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028082419,0.000029918048,0.00017696107,0.00021918832,0.0000392128,0.00014721659,0.0005334319,0.014799342,0.0011756897,0.93853456,0.004317676,0.039998706],"study_design_scores_gemma":[0.000015998761,0.000012693435,0.00007294335,0.00008020097,0.00003959686,0.00009322801,0.00020734334,0.073611885,0.0011560785,0.8980131,0.02666616,0.00003072027],"about_ca_topic_score_codex":0.020263487,"about_ca_topic_score_gemma":0.01638249,"teacher_disagreement_score":0.020263487,"about_ca_system_score_codex":0.002778464,"about_ca_system_score_gemma":0.0033572388,"threshold_uncertainty_score":0.04029107},"labels":[],"label_agreement":null},{"id":"W1942226195","doi":"10.1007/978-3-540-70596-3_17","title":"Employing a Domain Specific Ontology to Perform Semantic Search","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université Laval","funders":"","keywords":"Computer science; Ontology; Information retrieval; Semantic search; Semantic Web; Domain (mathematical analysis); Ontology learning; Upper ontology; Metadata; World Wide Web; Natural language; Suggested Upper Merged Ontology; Natural language processing","score_opus":0.024952012683194403,"score_gpt":0.278435293524624,"score_spread":0.25348328084142957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942226195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010226846,0.00019228678,0.97659177,0.00048117724,0.00010526714,0.00020208042,0.0007628596,0.0020665228,0.009371154],"genre_scores_gemma":[0.08319283,0.0006144644,0.9093612,0.00020861646,0.000033721368,0.000117592994,0.0027187562,0.00030195355,0.0034508193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879694,0.00025288662,0.00018990053,0.00020667916,0.00045889604,0.00009463707],"domain_scores_gemma":[0.998604,0.0004895932,0.00007470627,0.00048472223,0.00029021854,0.000056729084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017362399,0.0004906754,0.00071133545,0.0033532237,0.0011444308,0.0029638375,0.0013108604,0.0011292697,0.0026760916],"category_scores_gemma":[0.0045582643,0.0004802205,0.0017457312,0.0039952467,0.000964572,0.0063485163,0.0026867024,0.0016741602,0.0016096437],"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.00013966789,0.00040105663,0.0029697446,0.0010408541,0.0002474531,0.0008997445,0.0015297887,0.013792525,0.044702336,0.42761606,0.018882388,0.4877784],"study_design_scores_gemma":[0.000043781543,0.00008914432,0.0017412921,0.00043754018,0.00043275353,0.0016810423,0.0014662198,0.29282758,0.05549229,0.36205018,0.2836036,0.0001345695],"about_ca_topic_score_codex":0.007483081,"about_ca_topic_score_gemma":0.01467187,"teacher_disagreement_score":0.007483081,"about_ca_system_score_codex":0.001075134,"about_ca_system_score_gemma":0.0027548503,"threshold_uncertainty_score":0.014879048},"labels":[],"label_agreement":null},{"id":"W194279835","doi":"10.1007/978-3-642-30891-8_5","title":"The Impact of Parameterized Complexity to Interdisciplinary Problem Solving","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Computer science; Computational complexity theory; Theoretical computer science; Artificial intelligence; Data science; Algorithm","score_opus":0.04007682157717889,"score_gpt":0.3117525082969771,"score_spread":0.2716756867197982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194279835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07482792,0.012336479,0.72594845,0.023640009,0.0007996341,0.00019561876,0.0005155074,0.00058146747,0.161155],"genre_scores_gemma":[0.7018905,0.0072895223,0.27476498,0.0012121774,0.001200596,0.00045240266,0.000843356,0.0005537495,0.0117926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99077433,0.0057207514,0.0004486342,0.00094850676,0.0017016034,0.00040624526],"domain_scores_gemma":[0.8917733,0.091456495,0.002265117,0.010867491,0.0022337085,0.0014038815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007362866,0.0009462657,0.0012859919,0.0013514587,0.0016422496,0.0076651387,0.003080936,0.0022078278,0.016029177],"category_scores_gemma":[0.09232323,0.0009762164,0.0018362174,0.0038417939,0.006084471,0.018637113,0.005648651,0.0064251586,0.0011257731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067497975,0.00007488937,0.0008018707,0.00023962495,0.000053605,0.00004081656,0.00025432307,0.03937396,0.00023257674,0.91080207,0.0032451726,0.04481349],"study_design_scores_gemma":[0.000017410206,0.000010286217,0.00020730661,0.00003718487,0.000014373526,0.00001901383,0.00009158602,0.039666526,0.0001126796,0.9551884,0.004627476,0.0000077392415],"about_ca_topic_score_codex":0.0027474079,"about_ca_topic_score_gemma":0.00257866,"teacher_disagreement_score":0.016029177,"about_ca_system_score_codex":0.004456769,"about_ca_system_score_gemma":0.0028522073,"threshold_uncertainty_score":0.05362296},"labels":[],"label_agreement":null},{"id":"W19431222","doi":"10.1007/978-3-642-39094-4_27","title":"The Discrete Orthonormal Stockwell Transform and Variations, with Applications to Image Compression","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete cosine transform; Biorthogonal system; Orthonormal basis; Computer science; Image compression; Simple (philosophy); Algorithm; Wavelet; Orthonormality; Wavelet transform; Modified discrete cosine transform; Image (mathematics); Artificial intelligence; Image processing; Transform coding","score_opus":0.011046663495529728,"score_gpt":0.2578043311106382,"score_spread":0.24675766761510848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19431222","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.015821263,0.03719788,0.9163442,0.0011962749,0.0011493086,0.000037235855,0.0002090146,0.00036292677,0.02768195],"genre_scores_gemma":[0.2844079,0.05509752,0.60642534,0.00063749583,0.0030544142,0.00010703189,0.00057616574,0.0004213976,0.049272627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997788,0.000049978233,0.000015889873,0.000041188512,0.00009976185,0.000014443588],"domain_scores_gemma":[0.99972254,0.00013290654,0.000036406742,0.000034437042,0.000054961845,0.000018847424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504747,0.0006966182,0.0005566162,0.0013931963,0.00023000989,0.0011179865,0.0005401006,0.000722938,0.002316847],"category_scores_gemma":[0.00179094,0.00026747925,0.00035809798,0.002457115,0.0013130865,0.0014543968,0.0006707892,0.0013295606,0.0007138001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071404145,0.000028584234,0.00025541353,0.00019009046,0.000018618643,0.00010288749,0.00009381495,0.020984385,0.010558673,0.60667,0.009648767,0.35137737],"study_design_scores_gemma":[0.000017722634,0.000111275425,0.001264435,0.000063885964,0.000027732742,0.00068005384,0.00011241727,0.34630558,0.010693695,0.56409943,0.07655287,0.00007089386],"about_ca_topic_score_codex":0.00083697354,"about_ca_topic_score_gemma":0.0009978005,"teacher_disagreement_score":0.002316847,"about_ca_system_score_codex":0.0003377897,"about_ca_system_score_gemma":0.0003250628,"threshold_uncertainty_score":0.007750571},"labels":[],"label_agreement":null},{"id":"W1943228898","doi":"10.1007/978-3-540-30136-3_119","title":"Real-Time Dosimetry for Prostate Brachytherapy Using TRUS and Fluoroscopy","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency; University of British Columbia","funders":"","keywords":"Dosimetry; Fluoroscopy; Imaging phantom; Brachytherapy; Prostate brachytherapy; Computer science; Ultrasound; Tracking (education); Computer vision; Medical physics; Nuclear medicine; Medicine; Radiology; Radiation therapy","score_opus":0.00973773121905634,"score_gpt":0.2814682341794376,"score_spread":0.27173050296038126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943228898","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.021122627,0.014883723,0.94337463,0.00028158346,0.000246645,0.00008799634,0.00028699046,0.003526192,0.016189568],"genre_scores_gemma":[0.46254298,0.009262964,0.4846399,0.00033192112,0.00015122487,0.00010609692,0.00057111226,0.0026915963,0.03970226],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995859,0.00008891559,0.000020335568,0.000053205385,0.00022894802,0.00002270289],"domain_scores_gemma":[0.9996182,0.00020200427,0.000053031927,0.00006505519,0.00004814725,0.000013615102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006536535,0.0005038703,0.0003969398,0.0005832879,0.00023533746,0.0010295219,0.0011878036,0.0005719515,0.0044623767],"category_scores_gemma":[0.0011562709,0.00064279087,0.00058210024,0.00065668597,0.0003362736,0.0008412716,0.00062020594,0.0006005075,0.0010005478],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071372895,0.000069930065,0.0011941602,0.0010116937,0.00013039785,0.00015409967,0.0005793579,0.0812269,0.33541012,0.016249044,0.008101566,0.55515903],"study_design_scores_gemma":[0.000112299254,0.0011410422,0.019827036,0.0006666229,0.0005210886,0.0078725265,0.00023066033,0.28224224,0.50517666,0.017196465,0.16457033,0.00044295972],"about_ca_topic_score_codex":0.0013131114,"about_ca_topic_score_gemma":0.0021032458,"teacher_disagreement_score":0.0044623767,"about_ca_system_score_codex":0.0005533854,"about_ca_system_score_gemma":0.00047656422,"threshold_uncertainty_score":0.014928162},"labels":[],"label_agreement":null},{"id":"W1943259161","doi":"10.1007/3-540-45441-1_31","title":"UML for Agent-Oriented Software Development: The Tropos Proposal","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":96,"is_retracted":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":"Unified Modeling Language; Computer science; Software engineering; Agent-oriented software engineering; Applications of UML; Software development; Software development process; UML tool; Software; Dependency (UML); Systems engineering; Programming language; Engineering","score_opus":0.022230224978043434,"score_gpt":0.25020619042647557,"score_spread":0.22797596544843213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943259161","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.0013053546,0.001269742,0.9799329,0.003244477,0.0004052824,0.00012231765,0.000047769998,0.002106195,0.011565986],"genre_scores_gemma":[0.056182656,0.003990525,0.9240386,0.0015034139,0.00052105036,0.00068143226,0.00021975429,0.0009527289,0.011909929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537766,0.0021897699,0.00037470943,0.00042073542,0.001353448,0.0002837068],"domain_scores_gemma":[0.9949768,0.0026529713,0.00031530013,0.0010673726,0.00067918876,0.00030834242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00751996,0.00071348454,0.0008335078,0.002115921,0.0010336712,0.0052245725,0.0022689698,0.0028606048,0.004511634],"category_scores_gemma":[0.010029968,0.001331504,0.0020697766,0.0015119597,0.003923027,0.010636346,0.003935037,0.004447617,0.0027201807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043377757,0.000046655394,0.000100624005,0.00023975645,0.000021103024,0.00011186305,0.000683885,0.0029354529,0.002167173,0.92259985,0.007930037,0.06312029],"study_design_scores_gemma":[0.00013687866,0.000059960043,0.00008257467,0.00044757946,0.00006831254,0.00059486134,0.00020714416,0.060360987,0.0063328976,0.64978975,0.28186432,0.000054786065],"about_ca_topic_score_codex":0.000997772,"about_ca_topic_score_gemma":0.0008845735,"teacher_disagreement_score":0.00751996,"about_ca_system_score_codex":0.001321023,"about_ca_system_score_gemma":0.0024071673,"threshold_uncertainty_score":0.03976983},"labels":[],"label_agreement":null},{"id":"W1944385714","doi":"10.1007/3-540-47987-2_94","title":"Modeling Students’ Emotions from Cognitive Appraisal in Educational Games","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Cognitive appraisal; Educational game; Cognition; Personality; Game theory; Appraisal theory; Cognitive psychology; Artificial intelligence; Human–computer interaction; Multimedia; Psychology; Social psychology; Mathematical economics","score_opus":0.0481980177279456,"score_gpt":0.32637121151912946,"score_spread":0.2781731937911839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944385714","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.9703371,0.000119306256,0.023892207,0.00011756764,0.000023141258,0.000054266195,0.000087048815,0.00006271308,0.005306668],"genre_scores_gemma":[0.9970291,0.000027205575,0.0022694254,0.000009745715,0.0000024021556,0.000025609677,0.00004786033,0.000005733747,0.0005828775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00015953538,0.000010881842,0.00003736649,0.000043006432,0.00004627366],"domain_scores_gemma":[0.9978562,0.0016997599,0.00015083925,0.00005519894,0.00013188139,0.00010604389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007365106,0.00056224933,0.00025822004,0.00031514652,0.00017014994,0.0014202102,0.0005461546,0.00047498214,0.0015211318],"category_scores_gemma":[0.0063459803,0.0002165835,0.00034617324,0.0002592225,0.00026664205,0.0006904675,0.00043902503,0.0008795232,0.00019524698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002125891,0.0033371632,0.2994872,0.00040780005,0.00058658276,0.0005184089,0.0045286366,0.4576078,0.013987543,0.024453117,0.0038881616,0.18907166],"study_design_scores_gemma":[0.000043467728,0.00026622997,0.085720174,0.000024233312,0.000079922014,0.000040137482,0.0004994826,0.90081674,0.0016469163,0.010310613,0.0005183268,0.000033733748],"about_ca_topic_score_codex":0.005492209,"about_ca_topic_score_gemma":0.0065185516,"teacher_disagreement_score":0.005492209,"about_ca_system_score_codex":0.00071021775,"about_ca_system_score_gemma":0.0002525397,"threshold_uncertainty_score":0.010920465},"labels":[],"label_agreement":null},{"id":"W1944494027","doi":"10.1007/978-3-642-21596-4_33","title":"A New Image-Based Method for Event Detection and Extraction of Noisy Hydrophone Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hydrophone; Computer science; Spectrogram; Artificial intelligence; Noise (video); Orientation (vector space); Computer vision; Pattern recognition (psychology); Image (mathematics); Acoustics; Mathematics","score_opus":0.03198752506988693,"score_gpt":0.3102790461874813,"score_spread":0.27829152111759436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944494027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025637406,0.00022378279,0.99533904,0.00003634458,0.00007591654,0.00003339377,0.00013415352,0.0010508484,0.00054280466],"genre_scores_gemma":[0.020231633,0.00033248813,0.97460926,0.0000699688,0.00010390591,0.00009498729,0.00044762314,0.0001837027,0.0039263996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999438,0.000036756115,0.000031243337,0.00014121483,0.00031409724,0.000038696664],"domain_scores_gemma":[0.9994307,0.00013847573,0.000045564702,0.00008496929,0.0002648989,0.000035424087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042071176,0.0008913602,0.001072072,0.001771221,0.0003713428,0.0010684417,0.0013897867,0.0010544409,0.0042362553],"category_scores_gemma":[0.0010865683,0.00058879954,0.0007862546,0.0017865007,0.0004606237,0.0012472348,0.0010388325,0.00096829596,0.0032500112],"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.0002048721,0.000101117446,0.00054149283,0.00025163963,0.0000879855,0.00012501229,0.00007059525,0.0062921736,0.256898,0.002240815,0.0051396745,0.7280467],"study_design_scores_gemma":[0.000063023464,0.00017614452,0.004710041,0.000042672207,0.00015015804,0.0012745954,0.00006113391,0.73688656,0.21993269,0.0038900124,0.032688584,0.00012451127],"about_ca_topic_score_codex":0.0020187506,"about_ca_topic_score_gemma":0.0043492797,"teacher_disagreement_score":0.0042362553,"about_ca_system_score_codex":0.00033681438,"about_ca_system_score_gemma":0.0006121989,"threshold_uncertainty_score":0.01417166},"labels":[],"label_agreement":null},{"id":"W1944600025","doi":"10.1007/11853565_14","title":"Practical Metropolitan-Scale Positioning for GSM Phones","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":270,"is_retracted":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":"Metropolitan area; GSM; Downtown; Calibration; Computer science; Scale (ratio); Real-time computing; Set (abstract data type); Geography; Computer network; Statistics; Cartography; Mathematics","score_opus":0.01305806406679495,"score_gpt":0.2518605691543556,"score_spread":0.23880250508756068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944600025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010288791,0.00068428856,0.9423998,0.00035810447,0.00017193997,0.000056619872,0.00023147427,0.0034628005,0.042346183],"genre_scores_gemma":[0.39060998,0.0015309425,0.5243194,0.00015436961,0.00021659773,0.00014738481,0.00074974773,0.00048194383,0.08178963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996866,0.00009068119,0.000012842331,0.00007454829,0.00009207189,0.000043227366],"domain_scores_gemma":[0.99973375,0.00006242167,0.000009329002,0.000114114584,0.00006723759,0.000013252017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962939,0.00095321256,0.0003935255,0.0003752947,0.00059967756,0.0008198771,0.0009887386,0.0008699222,0.022238348],"category_scores_gemma":[0.0009297579,0.00044333993,0.0003119965,0.0007996675,0.00038233746,0.0011171151,0.0014725603,0.00053009274,0.011117504],"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.00022599212,0.000058740872,0.0023584396,0.00042086496,0.000041525323,0.0005913638,0.0004569801,0.06473385,0.062183324,0.07510703,0.029646121,0.7641758],"study_design_scores_gemma":[0.00008457083,0.00057368504,0.0043648737,0.00017923563,0.00011146181,0.003612699,0.0009124134,0.41732782,0.06478602,0.115086384,0.39284542,0.00011545591],"about_ca_topic_score_codex":0.001865981,"about_ca_topic_score_gemma":0.00652639,"teacher_disagreement_score":0.022238348,"about_ca_system_score_codex":0.00042186314,"about_ca_system_score_gemma":0.00044723676,"threshold_uncertainty_score":0.07439464},"labels":[],"label_agreement":null},{"id":"W1945061051","doi":"10.1007/978-3-540-73101-6_9","title":"Motivation and Cohesion in Agile Teams","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Agile software development; Agile Unified Process; Teamwork; Agile usability engineering; Lean software development; Cohesion (chemistry); Knowledge management; Grounded theory; Psychology; Extreme programming practices; Scope (computer science); Engineering; Qualitative research; Process management; Software development; Computer science; Management; Sociology; Software; Software development process; Software engineering","score_opus":0.021024040363308773,"score_gpt":0.2613816745389955,"score_spread":0.24035763417568676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945061051","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.786706,0.0029305543,0.0459922,0.0031938585,0.0001646119,0.00008646018,0.000026773108,0.0000557826,0.1608438],"genre_scores_gemma":[0.9948955,0.00017937821,0.0019875718,0.00003368187,0.00001944116,0.000044578224,0.000007244968,0.000008962302,0.0028235246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768376,0.0013846149,0.00007210882,0.00015676438,0.00038836928,0.00031445932],"domain_scores_gemma":[0.992396,0.0046817013,0.0010685227,0.00023177349,0.00047280168,0.00114917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030458854,0.0002912176,0.00028016127,0.0007230727,0.0016008316,0.0027782142,0.000535439,0.0007878844,0.0019983896],"category_scores_gemma":[0.009008987,0.0004142774,0.00029935766,0.00072840473,0.0025390212,0.0022924403,0.0023699517,0.0014136544,0.00018653127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035193833,0.00060833246,0.041061297,0.0002746862,0.00011490926,0.00078180776,0.048688278,0.0075148125,0.0021664423,0.69308513,0.0048297956,0.20052256],"study_design_scores_gemma":[0.0001625564,0.0007079827,0.08353627,0.0003567832,0.00008317793,0.0005835935,0.03200335,0.014124708,0.00120587,0.8361809,0.0309595,0.00009522192],"about_ca_topic_score_codex":0.0007673801,"about_ca_topic_score_gemma":0.0013679301,"teacher_disagreement_score":0.0030458854,"about_ca_system_score_codex":0.0011151838,"about_ca_system_score_gemma":0.0011962508,"threshold_uncertainty_score":0.016108394},"labels":[],"label_agreement":null},{"id":"W194567576","doi":"10.1007/978-3-642-33415-3_66","title":"Rotational-Slice-Based Prostate Segmentation Using Level Set with Shape Constraint for 3D End-Firing TRUS Guided Biopsy","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials","funders":"","keywords":"3D ultrasound; Prostate biopsy; Segmentation; Computer science; Prostate; Ultrasound; Artificial intelligence; Image segmentation; Computer vision; Medicine; Radiology","score_opus":0.06620918864385694,"score_gpt":0.3353622447775685,"score_spread":0.26915305613371154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194567576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03154593,0.00023839608,0.9663321,0.00009684363,0.000015082753,0.000052708732,0.00012733617,0.0008952033,0.0006964985],"genre_scores_gemma":[0.24879552,0.0002342043,0.7493456,0.00006799004,0.000013737161,0.00008520902,0.00036376936,0.0004489164,0.0006450512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999503,0.000107320106,0.00004082578,0.00005779936,0.00024805355,0.000042882726],"domain_scores_gemma":[0.99939084,0.00023010187,0.000089210276,0.000098822224,0.00014951966,0.000041511365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813097,0.0006758032,0.0010497676,0.00082756096,0.00039473234,0.001474487,0.0013950571,0.00093129074,0.0012641726],"category_scores_gemma":[0.0020666253,0.001214631,0.001208917,0.00078005076,0.00039662054,0.0006282802,0.0011602344,0.0009041163,0.00045682752],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009428947,0.00019591894,0.0034002417,0.0004386449,0.0001957417,0.00040772464,0.00029472617,0.45610186,0.20604143,0.0066305296,0.00263901,0.32271135],"study_design_scores_gemma":[0.00001693537,0.000051372772,0.0009453414,0.000016528773,0.000030103558,0.00028420714,0.000018340914,0.9766475,0.020282863,0.0009874377,0.0006835764,0.000035751076],"about_ca_topic_score_codex":0.0051532243,"about_ca_topic_score_gemma":0.0075579057,"teacher_disagreement_score":0.0051532243,"about_ca_system_score_codex":0.00055793487,"about_ca_system_score_gemma":0.0021287045,"threshold_uncertainty_score":0.010246515},"labels":[],"label_agreement":null},{"id":"W194649186","doi":"10.1007/978-3-642-25011-8_24","title":"On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Multigraph; Combinatorics; Vertex (graph theory); Planar graph; Graph; Planar; Mathematics; Plane (geometry); Discrete mathematics; Computer science; Geometry","score_opus":0.03404041091732289,"score_gpt":0.2868589059006162,"score_spread":0.2528184949832933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194649186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27944508,0.001412592,0.6935351,0.0013088697,0.00027810136,0.00024668183,0.0005998523,0.0013036083,0.021870097],"genre_scores_gemma":[0.4802567,0.0015691741,0.48819724,0.0003402568,0.00027985254,0.000506292,0.0015986917,0.0019580352,0.025293803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931836,0.0002318086,0.000025765748,0.00016585378,0.00013321784,0.00012504696],"domain_scores_gemma":[0.9956802,0.0031681566,0.0003367449,0.0003283916,0.00022993395,0.0002565864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394367,0.0026686685,0.0021392584,0.0011318674,0.0011338714,0.0017885477,0.0033240106,0.0022614745,0.007940022],"category_scores_gemma":[0.006456435,0.001060365,0.00094094157,0.0019931667,0.0016461562,0.0031967848,0.0022357607,0.0019564563,0.0011209704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084135093,0.00030077636,0.0015441007,0.0008101299,0.00010256772,0.00016538089,0.0002859368,0.76929367,0.015568451,0.05605982,0.010686167,0.14434166],"study_design_scores_gemma":[0.00009054776,0.00032161234,0.0009112397,0.00005311011,0.0000644299,0.00013407297,0.00017241284,0.8918104,0.0036926735,0.100480214,0.0022423058,0.000026927268],"about_ca_topic_score_codex":0.00294153,"about_ca_topic_score_gemma":0.0039994307,"teacher_disagreement_score":0.007940022,"about_ca_system_score_codex":0.0018442824,"about_ca_system_score_gemma":0.0010916279,"threshold_uncertainty_score":0.026562035},"labels":[],"label_agreement":null},{"id":"W194770738","doi":"10.1007/978-3-642-36763-2_54","title":"The First Simple Symmetric 11-Venn Diagram","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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","funders":"","keywords":"Venn diagram; Simple (philosophy); Diagram; Jordan curve theorem; Mathematics; Plane (geometry); Combinatorics; Geometry; Statistics","score_opus":0.025987457170147877,"score_gpt":0.2772079367949887,"score_spread":0.2512204796248408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194770738","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06830952,0.001518557,0.06261896,0.0010171854,0.001380012,0.00011796378,0.0006314119,0.00037894346,0.86402744],"genre_scores_gemma":[0.6175569,0.0021322775,0.039297596,0.000786478,0.00039730975,0.00011950547,0.00088950613,0.000473223,0.3383472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968123,0.000067577705,0.000010823503,0.00006494127,0.00010390528,0.00007155164],"domain_scores_gemma":[0.99979395,0.000047093425,0.000020887379,0.00002659046,0.00006565874,0.000045814508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027980708,0.00048549168,0.000585864,0.00111935,0.0018432419,0.0022010575,0.00080878194,0.0010806132,0.02040373],"category_scores_gemma":[0.0006736655,0.00038183515,0.0004377396,0.0008075782,0.0011912101,0.0020455283,0.0010333079,0.0016665063,0.006051559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000321568,0.000015850737,0.000085321,0.00008809119,0.000005487368,0.00020240202,0.00019441677,0.00037157998,0.0020200005,0.9771194,0.0056465766,0.014218696],"study_design_scores_gemma":[0.00001924091,0.00002083842,0.00025332728,0.000067172885,0.000010763036,0.00054569775,0.00016099682,0.0008824014,0.0017535425,0.87555516,0.120708264,0.000022671853],"about_ca_topic_score_codex":0.0012911108,"about_ca_topic_score_gemma":0.0018858417,"teacher_disagreement_score":0.02040373,"about_ca_system_score_codex":0.0011600914,"about_ca_system_score_gemma":0.0009980962,"threshold_uncertainty_score":0.06825733},"labels":[],"label_agreement":null},{"id":"W1948381900","doi":"10.1007/11593447_8","title":"Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Secure multi-party computation; Secret sharing; Secure two-party computation; Computation; Computer security; Theoretical computer science; Cryptography; Algorithm","score_opus":0.03368925177574418,"score_gpt":0.28926373089285506,"score_spread":0.2555744791171109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948381900","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.06552145,0.0010439116,0.86144567,0.0012074308,0.00029529576,0.00031695902,0.00027383285,0.00093874155,0.0689567],"genre_scores_gemma":[0.86373425,0.000744323,0.09563771,0.0002454259,0.00015174133,0.00023866163,0.00020945178,0.0001970156,0.038841367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824333,0.0004616351,0.000073060335,0.00022151448,0.0006551432,0.0003453936],"domain_scores_gemma":[0.9987024,0.0005577785,0.00006612965,0.00053146476,0.00008954938,0.00005272391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013200501,0.0007292284,0.0011754155,0.0006177394,0.001083256,0.002953458,0.0016494658,0.0013038439,0.0056706397],"category_scores_gemma":[0.0024814727,0.00040600952,0.00086220226,0.0015884036,0.002703546,0.004242997,0.0027565984,0.0024510918,0.0012433555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002267545,0.00005948423,0.0000910624,0.000088513916,0.000019694038,0.000108537984,0.0001317085,0.013696981,0.0049928785,0.9468623,0.0022819638,0.031439997],"study_design_scores_gemma":[0.000054464897,0.00008181095,0.00013188836,0.000023777686,0.000025214173,0.00019633757,0.000024379147,0.10456551,0.011864753,0.87729096,0.0057075378,0.000033412078],"about_ca_topic_score_codex":0.0003718038,"about_ca_topic_score_gemma":0.00052967004,"teacher_disagreement_score":0.0056706397,"about_ca_system_score_codex":0.0014274463,"about_ca_system_score_gemma":0.0011577118,"threshold_uncertainty_score":0.018970191},"labels":[],"label_agreement":null},{"id":"W1948983780","doi":"10.1007/978-3-540-89335-6_18","title":"Our Brothers’ Keepers: Secure Routing with High Performance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Winnipeg","funders":"","keywords":"Computer science; Computer network; Chord (peer-to-peer); Overlay network; Network packet; Distributed hash table; Routing table; Spoofing attack; Distributed computing; Overlay; Peer-to-peer; Routing (electronic design automation); Identifier; Pastry; Static routing; Routing protocol; Computer security; The Internet; World Wide Web","score_opus":0.016173593452050033,"score_gpt":0.2219925259903154,"score_spread":0.2058189325382654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948983780","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022272805,0.004528661,0.9078597,0.0021316998,0.0014803759,0.00015414224,0.00013601825,0.010884979,0.050551612],"genre_scores_gemma":[0.41729635,0.004510927,0.41898167,0.0007368874,0.0009769534,0.00019908533,0.0006032774,0.0024515735,0.15424338],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994318,0.000099806566,0.000028729492,0.00006716819,0.00030279942,0.00006964559],"domain_scores_gemma":[0.9993286,0.00017564504,0.00004265566,0.00030869173,0.00008427179,0.00006016812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075538224,0.00072997896,0.00054506696,0.00050076004,0.0009158969,0.0017074724,0.0014439498,0.0011363638,0.009474729],"category_scores_gemma":[0.0016367394,0.0006434685,0.00028987383,0.0006393142,0.0007268244,0.004149787,0.0021483921,0.0022368566,0.00432053],"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.00062788755,0.00015556988,0.00041445423,0.0003280938,0.000081679354,0.00034297863,0.00067076244,0.02238784,0.028894765,0.22476725,0.09314273,0.628186],"study_design_scores_gemma":[0.00016612383,0.0004285536,0.00047735032,0.00015623149,0.00014145703,0.00129947,0.00023726479,0.31156358,0.059527133,0.258556,0.36730343,0.000143404],"about_ca_topic_score_codex":0.0004389558,"about_ca_topic_score_gemma":0.0008310687,"teacher_disagreement_score":0.009474729,"about_ca_system_score_codex":0.0004324466,"about_ca_system_score_gemma":0.0004684,"threshold_uncertainty_score":0.03169614},"labels":[],"label_agreement":null},{"id":"W194933706","doi":"10.1007/978-3-642-25249-5_6","title":"A GIS Based Wireless Sensor Network Coverage Estimation and Optimization: A Voronoi Approach","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Voronoi diagram; Computer science; Wireless sensor network; Estimation; Wireless network; Wireless; Real-time computing; Computer network; Telecommunications; Mathematics","score_opus":0.013194110606455927,"score_gpt":0.2046418036927702,"score_spread":0.1914476930863143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194933706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018235028,0.00027075378,0.9966558,0.000054553348,0.000019008648,0.000017715101,0.000037716316,0.000093922965,0.0010269488],"genre_scores_gemma":[0.22302824,0.0017426482,0.76922333,0.00008996836,0.00015970948,0.00024919456,0.00033928163,0.0002650671,0.004902622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995136,0.00013900832,0.000021737922,0.0000866302,0.00020739414,0.00003163814],"domain_scores_gemma":[0.9992803,0.00045213746,0.000048217807,0.000047067344,0.00014784833,0.000024439136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060734496,0.0008632285,0.0017155085,0.0013717781,0.00038707387,0.0013039992,0.0017372459,0.0012023499,0.002065481],"category_scores_gemma":[0.0024573735,0.0010741272,0.0014118709,0.002106485,0.00076796795,0.0014864829,0.0015718065,0.00078014407,0.0005169077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031153268,0.000027184315,0.0003646557,0.000115954936,0.000048383376,0.00007428828,0.000051655195,0.9168813,0.002678633,0.014955396,0.001255362,0.06351599],"study_design_scores_gemma":[0.0000022645365,0.000010063306,0.000058898848,0.000004894306,0.0000049256228,0.000033846834,0.0000059386584,0.9955733,0.00035762475,0.003221069,0.0007227478,0.000004511263],"about_ca_topic_score_codex":0.0062449924,"about_ca_topic_score_gemma":0.004291041,"teacher_disagreement_score":0.0062449924,"about_ca_system_score_codex":0.0008581587,"about_ca_system_score_gemma":0.0007804062,"threshold_uncertainty_score":0.012417257},"labels":[],"label_agreement":null},{"id":"W194959742","doi":"10.1007/978-3-319-06483-3_36","title":"Heterogeneous Multi-Population Cultural Algorithm with a Dynamic Dimension Decomposition Strategy","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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 Windsor","funders":"","keywords":"Benchmark (surveying); Dimension (graph theory); Computer science; Decomposition; Population; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01824106933648329,"score_gpt":0.2962817787374648,"score_spread":0.2780407094009815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194959742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038615834,0.00033357617,0.9488304,0.00019275746,0.00013959476,0.000067281435,0.000036655747,0.00015898283,0.011624835],"genre_scores_gemma":[0.507836,0.0002845755,0.48132154,0.0002572782,0.00009971869,0.00043020133,0.00015527496,0.000117999276,0.009497519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.00019351006,0.000018542989,0.000072314666,0.00011300148,0.000056946188],"domain_scores_gemma":[0.9994715,0.0002374574,0.000045282297,0.00007558895,0.00011221197,0.00005795584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077118515,0.0007257087,0.0008340239,0.00082170335,0.00080816826,0.0011791274,0.0014910813,0.0011873947,0.0027999657],"category_scores_gemma":[0.0019105705,0.0003355115,0.0008811363,0.0010306848,0.0007412395,0.0009591175,0.0022699751,0.00097576686,0.00043831897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013452514,0.00014165876,0.00074203504,0.00009352837,0.0001504462,0.00011850366,0.00015834557,0.79936,0.0065763798,0.0660426,0.003052131,0.12342988],"study_design_scores_gemma":[0.000023208926,0.000036779842,0.000084254236,0.000008005811,0.000017796767,0.000033354307,0.000018358895,0.9929026,0.00061284244,0.0053437403,0.0009107405,0.000008383005],"about_ca_topic_score_codex":0.0013526685,"about_ca_topic_score_gemma":0.0012469479,"teacher_disagreement_score":0.0027999657,"about_ca_system_score_codex":0.00062901777,"about_ca_system_score_gemma":0.0006705789,"threshold_uncertainty_score":0.00936681},"labels":[],"label_agreement":null},{"id":"W1949967182","doi":"10.1007/978-3-642-02463-4_17","title":"Web Service Composition via the Customization of Golog Programs with User Preferences","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Web service; Exploit; Personalization; World Wide Web; Human–computer interaction","score_opus":0.010098437212428594,"score_gpt":0.21456533547995496,"score_spread":0.20446689826752637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949967182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08658324,0.00012761525,0.89571583,0.00013881744,0.000033321016,0.00015117112,0.000055547127,0.0065637566,0.010630802],"genre_scores_gemma":[0.64924246,0.00022662511,0.33555,0.0001665,0.000036920814,0.0001755348,0.00029430407,0.0012612548,0.013046382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941945,0.00014027893,0.000038121387,0.00010333493,0.00020172732,0.00009715791],"domain_scores_gemma":[0.99927014,0.0002870016,0.000060172348,0.00021354608,0.00012172352,0.000047429505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087316387,0.00042251675,0.00054505817,0.0007419968,0.00055135053,0.0009721177,0.0007161368,0.00046417944,0.0034940487],"category_scores_gemma":[0.002142241,0.0003739842,0.00058112683,0.0006899458,0.0007224442,0.0013079309,0.001386687,0.00078939454,0.0008611374],"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.0009858654,0.00056980894,0.004349631,0.00027033355,0.00012597349,0.000811199,0.0013414124,0.060684428,0.09728547,0.11400622,0.008795516,0.71077424],"study_design_scores_gemma":[0.00011104157,0.00011894937,0.001621975,0.000060109072,0.00011572678,0.0006739024,0.00022671475,0.80302864,0.083954126,0.07251914,0.037493773,0.000075924865],"about_ca_topic_score_codex":0.0022114369,"about_ca_topic_score_gemma":0.003457021,"teacher_disagreement_score":0.0034940487,"about_ca_system_score_codex":0.0005855187,"about_ca_system_score_gemma":0.000561835,"threshold_uncertainty_score":0.011688769},"labels":[],"label_agreement":null},{"id":"W1950070584","doi":"10.1007/978-3-540-78671-9_25","title":"Cooperative Problem Decomposition in Pareto Competitive Classifier Models of Coevolution","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Pareto principle; Classifier (UML); Artificial intelligence; Coevolution; Modularity (biology); Population; Machine learning; Mathematical optimization; Pareto optimal; Multi-objective optimization; Mathematics","score_opus":0.019881005426592532,"score_gpt":0.25393094741623956,"score_spread":0.23404994198964701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1950070584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03553556,0.0005572797,0.9505979,0.0005880901,0.00006118462,0.00008116018,0.00005006614,0.00009944466,0.012429368],"genre_scores_gemma":[0.74279886,0.00079374615,0.22522028,0.00032057904,0.00017679136,0.00053462386,0.0002472619,0.00013987615,0.029767858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985898,0.0007182991,0.000051191848,0.00021005515,0.00027997323,0.00015060892],"domain_scores_gemma":[0.99631137,0.0023897858,0.00020872278,0.00034058784,0.00054677966,0.00020279808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028414272,0.00085743814,0.001587241,0.00089276955,0.00083175325,0.0025471407,0.0024656819,0.002625275,0.004984965],"category_scores_gemma":[0.009656134,0.0007308181,0.0012067857,0.0011091665,0.0017807821,0.0031257248,0.0020957752,0.0021378826,0.0008302998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000862782,0.00012490209,0.0005505481,0.00009809401,0.00007030803,0.00008365968,0.00025450822,0.5408667,0.0009277798,0.412419,0.003506691,0.04101149],"study_design_scores_gemma":[0.00000658583,0.0000104057835,0.00004654258,0.000005178544,0.0000064402125,0.000012974831,0.000015558991,0.9333866,0.00006171885,0.06612723,0.00031647595,0.0000042880733],"about_ca_topic_score_codex":0.0035105292,"about_ca_topic_score_gemma":0.0025971963,"teacher_disagreement_score":0.004984965,"about_ca_system_score_codex":0.0015226897,"about_ca_system_score_gemma":0.001268649,"threshold_uncertainty_score":0.016676426},"labels":[],"label_agreement":null},{"id":"W195053133","doi":"10.1007/978-3-642-21458-5_9","title":"A d-Step Approach for Distinct Squares in Strings","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"","keywords":"Alphabet; Conjecture; String (physics); Bounded function; Combinatorics; Constant (computer programming); Computer science; String searching algorithm; Least-squares function approximation; Key (lock); Mathematics; Discrete mathematics; Algorithm; Pattern matching; Artificial intelligence; Mathematical analysis; Statistics","score_opus":0.026826963749004114,"score_gpt":0.24490103356850984,"score_spread":0.21807406981950572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195053133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022308147,0.000099343175,0.99052584,0.0001232983,0.00013041936,0.000046922323,0.0000779355,0.00046209115,0.006303359],"genre_scores_gemma":[0.030097667,0.00016245371,0.95263666,0.00025480334,0.00008001237,0.000121381985,0.00023689229,0.00045780785,0.015952412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905163,0.00022214357,0.00006751119,0.0001926565,0.00038866204,0.00007743039],"domain_scores_gemma":[0.99843186,0.00067977415,0.000034362096,0.0004401134,0.00034818193,0.000065709326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078503165,0.00081004377,0.00075010484,0.0014425225,0.0008562694,0.0013974147,0.002181566,0.001454292,0.02300753],"category_scores_gemma":[0.0043691495,0.00058222783,0.0014189726,0.0015484832,0.0012099798,0.0022429333,0.0036463486,0.0025312726,0.010018299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016331988,0.0001209399,0.00036080135,0.00033965887,0.000039165232,0.00022575971,0.00026399712,0.018996535,0.015710058,0.44549796,0.019695597,0.49858615],"study_design_scores_gemma":[0.000052058556,0.0001458742,0.00023241795,0.000086470885,0.00003673285,0.00057037105,0.00017297057,0.34388965,0.021206949,0.5638232,0.06971705,0.00006618948],"about_ca_topic_score_codex":0.0008403035,"about_ca_topic_score_gemma":0.0018333043,"teacher_disagreement_score":0.02300753,"about_ca_system_score_codex":0.00045217664,"about_ca_system_score_gemma":0.0007576228,"threshold_uncertainty_score":0.076967895},"labels":[],"label_agreement":null},{"id":"W1951216170","doi":"10.1007/3-540-44614-1_82","title":"FPGA Implementation of a Prototype WDM On-Line Scheduler","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Field-programmable gate array; Scheduling (production processes); Wavelength-division multiplexing; Testbed; Distributed computing; Computer network; Embedded system; Engineering; Wavelength","score_opus":0.017818265272970802,"score_gpt":0.27347794953408167,"score_spread":0.25565968426111085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951216170","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.5260227,0.0015757037,0.36662847,0.00071579433,0.0013480857,0.0007712688,0.0011455304,0.028958593,0.072833925],"genre_scores_gemma":[0.8725333,0.0002403567,0.10692288,0.00030190757,0.00009112547,0.00009994544,0.0005915569,0.00027408343,0.01894486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998661,0.000020038553,0.0000071567574,0.000023187229,0.000035921956,0.00004758097],"domain_scores_gemma":[0.999841,0.000038563325,0.000013766369,0.000027226468,0.000051551393,0.000027903907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017589261,0.00044306368,0.00032243805,0.0004938667,0.0003368757,0.00064295536,0.0012251688,0.00031791802,0.013385983],"category_scores_gemma":[0.00027474161,0.00024601485,0.0001488991,0.00029920443,0.000110230656,0.00034689324,0.00017676182,0.00030059688,0.001704083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034354636,0.0008869443,0.005117159,0.00062193227,0.00022496622,0.0014039834,0.00038427272,0.043413736,0.37353897,0.010766158,0.041428234,0.5187782],"study_design_scores_gemma":[0.0020008814,0.0039696894,0.011478049,0.00011503445,0.000323148,0.0019632704,0.00024034025,0.43695983,0.42231327,0.0036783284,0.11679287,0.00016533899],"about_ca_topic_score_codex":0.003996966,"about_ca_topic_score_gemma":0.0051067304,"teacher_disagreement_score":0.013385983,"about_ca_system_score_codex":0.00056703435,"about_ca_system_score_gemma":0.00070625043,"threshold_uncertainty_score":0.044780552},"labels":[],"label_agreement":null},{"id":"W1951707894","doi":"10.1007/0-387-34805-0_29","title":"Flexible Access Control with Master Keys","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scheme (mathematics); Key (lock); Set (abstract data type); Service (business); Access control; Representation (politics); Computer network; Computer security; Distributed computing; Mathematics; Programming language; Business","score_opus":0.03239600057577496,"score_gpt":0.27094634757980407,"score_spread":0.2385503470040291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951707894","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.023962121,0.0012725919,0.9483542,0.0002824043,0.00023568327,0.0001466457,0.00018923798,0.0030987945,0.022458386],"genre_scores_gemma":[0.7970759,0.001508539,0.14350033,0.00025635402,0.0003229835,0.00034039372,0.00043462598,0.0005526838,0.056008197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842465,0.00017493007,0.00012749819,0.00033303452,0.0005984397,0.00034152757],"domain_scores_gemma":[0.99736756,0.0005847172,0.00020387198,0.001521629,0.00023147084,0.0000907722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011773697,0.0008898349,0.00094749674,0.00093106047,0.0008224789,0.0024355112,0.0015851107,0.0006824964,0.007804224],"category_scores_gemma":[0.0031221076,0.0005607765,0.00055134605,0.0010328911,0.0014991801,0.0066616824,0.0032404803,0.0023890964,0.0026120413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080041826,0.00010170198,0.0003717159,0.00036698728,0.00006777275,0.00023315923,0.00046188978,0.013339683,0.05768444,0.66572744,0.010055567,0.25078917],"study_design_scores_gemma":[0.00018389318,0.00043142407,0.00066844746,0.00016296476,0.000119583085,0.0012462876,0.00013909742,0.18863884,0.13271649,0.5794569,0.09607352,0.00016245038],"about_ca_topic_score_codex":0.00023854033,"about_ca_topic_score_gemma":0.0002200656,"teacher_disagreement_score":0.007804224,"about_ca_system_score_codex":0.00062756473,"about_ca_system_score_gemma":0.00061459054,"threshold_uncertainty_score":0.026107728},"labels":[],"label_agreement":null},{"id":"W1952227545","doi":"10.1007/978-3-662-44654-6_22","title":"A Dynamic Questionnaire to Further Reduce Questions in Learning Style Assessment","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Learning Styles and Cognitive Differences","field":"Psychology","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":"Université de Moncton","funders":"","keywords":"Ask price; Learning styles; Style (visual arts); Computer science; Process (computing); Questionnaire; Psychology; Scheme (mathematics); Applied psychology; Artificial intelligence; Machine learning; Mathematics education; Statistics; Mathematics","score_opus":0.013500409723017064,"score_gpt":0.3223607652651944,"score_spread":0.30886035554217733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952227545","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.57774734,0.00042674376,0.30066612,0.0023194079,0.0024444212,0.036979154,0.01877584,0.006951425,0.05368955],"genre_scores_gemma":[0.3355137,0.0007169634,0.47571144,0.0031622068,0.00045534887,0.07962639,0.01574388,0.0016615117,0.08740854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581295,0.0014278427,0.00077425427,0.00043786687,0.0012795473,0.00026751793],"domain_scores_gemma":[0.9514909,0.03346572,0.0013674294,0.0033771435,0.009165865,0.0011328926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073097846,0.00073543267,0.00070949964,0.0020411604,0.00041909103,0.00086534995,0.00092840084,0.00074169313,0.033268712],"category_scores_gemma":[0.030974088,0.00037950865,0.0008696081,0.0011418724,0.0002893299,0.0011186486,0.001496295,0.001406357,0.012841902],"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.00082636636,0.007889406,0.02927345,0.0011991451,0.0000678412,0.00013382145,0.0045589022,0.0012636828,0.025868231,0.002317005,0.06535335,0.86124885],"study_design_scores_gemma":[0.001619932,0.007906873,0.5139579,0.0011950203,0.00025627174,0.000784994,0.008183722,0.021293547,0.040891033,0.00939786,0.3940323,0.00048060052],"about_ca_topic_score_codex":0.00039574527,"about_ca_topic_score_gemma":0.00082792016,"teacher_disagreement_score":0.033268712,"about_ca_system_score_codex":0.000474059,"about_ca_system_score_gemma":0.00082798523,"threshold_uncertainty_score":0.111294985},"labels":[],"label_agreement":null},{"id":"W1952339091","doi":"10.1007/3-540-39173-8_17","title":"Modelling a Multi-agent System Environment","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Université Laval","funders":"","keywords":"Computer science; Task (project management); Multi-agent system; Human–computer interaction; Software engineering; Diagram; Activity diagram; Software; Systems engineering; Unified Modeling Language; Artificial intelligence; Programming language; Database","score_opus":0.034887413881179274,"score_gpt":0.22682503993648206,"score_spread":0.1919376260553028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952339091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014687683,0.00081463373,0.9414661,0.00079030305,0.00015008154,0.00015480786,0.00016593654,0.00057072437,0.041199617],"genre_scores_gemma":[0.509355,0.0026550076,0.44118926,0.00025981473,0.00020760037,0.0007245088,0.0005641033,0.00029193208,0.04475278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934834,0.0002906956,0.000047029,0.00008651013,0.00015918311,0.000068216075],"domain_scores_gemma":[0.99920577,0.00050203956,0.00007926243,0.000072987656,0.00007501933,0.00006496525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008213655,0.0011521797,0.0007863846,0.00063151063,0.0009801026,0.0036708694,0.0028547447,0.0027711156,0.0081610335],"category_scores_gemma":[0.0022069225,0.0008617501,0.0011883791,0.0010763453,0.0015107724,0.0044426015,0.002384927,0.001696946,0.0018460908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000784955,0.00007221868,0.0003643756,0.00024736693,0.000048936723,0.00083258934,0.0006637022,0.52109575,0.002738729,0.45701984,0.0016687047,0.015169298],"study_design_scores_gemma":[0.000048260976,0.00004054408,0.00007652445,0.000037595328,0.000033693228,0.00015287932,0.00008672183,0.8159119,0.0009300111,0.1667128,0.015948595,0.000020444064],"about_ca_topic_score_codex":0.0030359642,"about_ca_topic_score_gemma":0.002925427,"teacher_disagreement_score":0.0081610335,"about_ca_system_score_codex":0.0008950278,"about_ca_system_score_gemma":0.0009549769,"threshold_uncertainty_score":0.027301371},"labels":[],"label_agreement":null},{"id":"W1952702141","doi":"10.1007/978-3-540-85990-1_79","title":"Needle Insertion Study Using Ultrasound-Based 2D Motion Tracking","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Imaging phantom; Brachytherapy; Displacement (psychology); Computer science; Sagittal plane; Rotation (mathematics); Block (permutation group theory); Tracking (education); Transducer; Biomedical engineering; Prostate brachytherapy; Acoustics; Materials science; Computer vision; Nuclear medicine; Physics; Surgery; Medicine; Mathematics; Anatomy; Geometry; Radiation therapy","score_opus":0.030405887434672974,"score_gpt":0.25614659230438713,"score_spread":0.22574070486971415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952702141","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.92908645,0.0020500652,0.0662284,0.00012268982,0.000104084786,0.00019122481,0.0001822221,0.0002264024,0.0018085688],"genre_scores_gemma":[0.9796769,0.0008083582,0.017617038,0.00009169315,0.000037720332,0.000053174263,0.0001157536,0.000059959813,0.0015393873],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99945694,0.0001673041,0.000053768657,0.00009475906,0.00014526887,0.00008197694],"domain_scores_gemma":[0.99822444,0.0010079766,0.00013171887,0.00020295741,0.00033117656,0.00010170101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008649218,0.0004040905,0.0006400168,0.0010473761,0.0004362113,0.0005791343,0.00056974794,0.001328703,0.0025220935],"category_scores_gemma":[0.0028328963,0.00057726336,0.00054138224,0.0007168316,0.0006037189,0.0010723635,0.00050425954,0.00050713576,0.00048036317],"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.0034883353,0.0010626815,0.010053532,0.00064944255,0.000090424284,0.00228341,0.0014430054,0.006397478,0.91705877,0.0005360219,0.00040179124,0.05653506],"study_design_scores_gemma":[0.0004637561,0.024885707,0.10170155,0.00020503388,0.00090026774,0.016228493,0.0019277635,0.18676503,0.6586918,0.000660355,0.007195342,0.00037495611],"about_ca_topic_score_codex":0.0019949025,"about_ca_topic_score_gemma":0.001168108,"teacher_disagreement_score":0.0025220935,"about_ca_system_score_codex":0.00026384814,"about_ca_system_score_gemma":0.00047282514,"threshold_uncertainty_score":0.008437216},"labels":[],"label_agreement":null},{"id":"W1953336573","doi":"10.1007/978-3-642-03668-2_16","title":"Distributed Sensing and Control Architecture for Automotive Factory Automation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Modular design; Automotive industry; Middleware (distributed applications); Automation; Factory (object-oriented programming); Wireless sensor network; Embedded system; Distributed computing; Architecture; Layer (electronics); Wireless; Computer network; Engineering; Operating system","score_opus":0.010565620485032115,"score_gpt":0.21819575081034961,"score_spread":0.2076301303253175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953336573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014808022,0.0009433405,0.9723146,0.00019963119,0.000118441465,0.000042081767,0.000031280833,0.001364216,0.010178414],"genre_scores_gemma":[0.7098232,0.00092204916,0.2552959,0.00016289901,0.00012592676,0.00017488735,0.00018448793,0.000093344,0.033217404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998418,0.000020443222,0.000007623906,0.000036672627,0.00007548237,0.000018023607],"domain_scores_gemma":[0.99991167,0.000017330245,0.000006969973,0.000020260357,0.000038218444,0.000005553477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021350347,0.00040156316,0.00032674245,0.00020276585,0.000293574,0.00052951305,0.0010915628,0.0005453447,0.0027378467],"category_scores_gemma":[0.00019208,0.00024972943,0.00022825277,0.00021614511,0.00031388985,0.00056626846,0.00052363344,0.0006009105,0.00067291374],"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.00022474011,0.00020888353,0.00039783763,0.0002245079,0.000059364553,0.00015969672,0.00020201481,0.31523508,0.113859095,0.06398575,0.009113675,0.4963294],"study_design_scores_gemma":[0.000042385793,0.00020154403,0.0005625381,0.000026786129,0.000031208587,0.00014906829,0.000038780938,0.9142464,0.029269887,0.028063936,0.027347934,0.0000194824],"about_ca_topic_score_codex":0.0012777908,"about_ca_topic_score_gemma":0.0021095192,"teacher_disagreement_score":0.0027378467,"about_ca_system_score_codex":0.00041365038,"about_ca_system_score_gemma":0.00035559843,"threshold_uncertainty_score":0.0091590285},"labels":[],"label_agreement":null},{"id":"W1954026600","doi":"10.1007/978-3-540-73554-0_13","title":"Quantum Authenticated Key Distribution","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Queen's University","funders":"","keywords":"Computer science; Quantum key distribution; Quantum channel; Quantum; Computer network; Key (lock); Authentication (law); Theoretical computer science; Channel (broadcasting); Quantum information; Computer security; Physics; Quantum mechanics","score_opus":0.01941796945303697,"score_gpt":0.2634893479026512,"score_spread":0.24407137844961424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954026600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012418477,0.0024008139,0.86801887,0.0025600363,0.0016848057,0.0002667166,0.00039408068,0.0014822218,0.11077403],"genre_scores_gemma":[0.61060923,0.004196493,0.15579212,0.0013187842,0.0018132274,0.00050331844,0.00083042716,0.0005188213,0.22441754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982591,0.0004231119,0.000093096074,0.0002755908,0.0007389019,0.0002102884],"domain_scores_gemma":[0.99815816,0.00053021254,0.00011405367,0.00076984725,0.0003501384,0.000077445664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872614,0.0006082898,0.0007130362,0.00089170004,0.0011570002,0.0028111916,0.0011671598,0.001312277,0.02116554],"category_scores_gemma":[0.0036426487,0.0005397255,0.0003523323,0.0017808321,0.001926145,0.0051640263,0.003022021,0.0024267836,0.007088406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017690605,0.00005904738,0.00009439957,0.00014730466,0.000017716884,0.00008107819,0.00016178419,0.0033185645,0.004987719,0.8531237,0.016666379,0.121165425],"study_design_scores_gemma":[0.00007802099,0.000106453655,0.00021650126,0.00010933331,0.000033758854,0.0006139209,0.000070343594,0.043343242,0.01492591,0.80199355,0.13844685,0.00006220625],"about_ca_topic_score_codex":0.0001623135,"about_ca_topic_score_gemma":0.00016542281,"teacher_disagreement_score":0.02116554,"about_ca_system_score_codex":0.0011003998,"about_ca_system_score_gemma":0.0010745283,"threshold_uncertainty_score":0.07080579},"labels":[],"label_agreement":null},{"id":"W195446234","doi":"10.1007/978-3-319-11298-5_18","title":"QoS-Based Reputation Feedback Fusion under Unknown Correlation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Concordia University","funders":"","keywords":"Reputation; Computer science; Scalability; Quality of service; Web service; Kalman filter; Service (business); Sensor fusion; Machine learning; Computer network; Artificial intelligence; World Wide Web; Database","score_opus":0.014830395099772147,"score_gpt":0.23246128156059054,"score_spread":0.21763088646081838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195446234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03628418,0.0011426838,0.95831734,0.0005327478,0.0002899793,0.00007377134,0.00013567357,0.00084043597,0.0023832154],"genre_scores_gemma":[0.92834014,0.0003754676,0.06811254,0.00017943812,0.00038811826,0.000049759743,0.00020315636,0.00005086864,0.002300516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996811,0.00074851234,0.00018651778,0.00069618714,0.001126155,0.00043157564],"domain_scores_gemma":[0.9936826,0.002859657,0.00051261,0.0006333816,0.0020467308,0.00026515083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003705508,0.001162303,0.0024180298,0.0010275338,0.0009227132,0.0018996014,0.0016016893,0.0015406132,0.0013703508],"category_scores_gemma":[0.012483767,0.00048277172,0.000620469,0.0013863615,0.0009757032,0.0027781865,0.0022071262,0.0014242335,0.00057604595],"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.0017334791,0.00040361058,0.0037124967,0.00042588124,0.0002562192,0.00042217912,0.0003840287,0.4129034,0.047345113,0.024942443,0.008339026,0.49913207],"study_design_scores_gemma":[0.000015168298,0.00008333166,0.00046946557,0.000008729339,0.000032942513,0.000085357045,0.000020859632,0.99171,0.002781283,0.004409817,0.00035922983,0.000023868477],"about_ca_topic_score_codex":0.0023174798,"about_ca_topic_score_gemma":0.0024750389,"teacher_disagreement_score":0.003705508,"about_ca_system_score_codex":0.0011862958,"about_ca_system_score_gemma":0.0014309448,"threshold_uncertainty_score":0.019596815},"labels":[],"label_agreement":null},{"id":"W1954494745","doi":"10.1007/3-540-44839-x_28","title":"Scheduling Intervals Using Independent Sets in Claw-Free Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Computer science; Scheduling (production processes); Time complexity; Combinatorics; Execution time; Running time; Discrete mathematics; Algorithm; Parallel computing; Mathematics; Mathematical optimization","score_opus":0.03839137146645097,"score_gpt":0.28757377182614086,"score_spread":0.2491824003596899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954494745","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.104024865,0.0006618312,0.87815434,0.00031197083,0.00022954526,0.00031604356,0.0003465273,0.0018224284,0.014132415],"genre_scores_gemma":[0.62890977,0.0006375583,0.3616848,0.00015469089,0.00019429246,0.00034348763,0.00077038945,0.0006341582,0.0066708536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881893,0.0002604376,0.00007895875,0.00024233514,0.0003338034,0.00026556867],"domain_scores_gemma":[0.99522734,0.0028146557,0.00038620143,0.0007834191,0.00034843574,0.00043996825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016290233,0.0012488294,0.0016856879,0.0018260238,0.0011898805,0.002146322,0.00379396,0.0009050412,0.005779712],"category_scores_gemma":[0.006534184,0.0013208934,0.0010753112,0.0030914855,0.00088014826,0.003683577,0.0017005233,0.0021794029,0.00074934826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012970384,0.0005275464,0.0007353694,0.00044913878,0.00014643038,0.00016333042,0.0004209022,0.6025457,0.0124014625,0.1514649,0.009066825,0.22078149],"study_design_scores_gemma":[0.0001364602,0.00027200254,0.0002852444,0.000036197205,0.00006730507,0.000059140235,0.00007059499,0.82254505,0.005087777,0.16810068,0.0033010638,0.000038497896],"about_ca_topic_score_codex":0.0031755792,"about_ca_topic_score_gemma":0.0044116084,"teacher_disagreement_score":0.005779712,"about_ca_system_score_codex":0.0014829717,"about_ca_system_score_gemma":0.001659372,"threshold_uncertainty_score":0.019335091},"labels":[],"label_agreement":null},{"id":"W1954679557","doi":"10.1007/11758501_39","title":"Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Oak Ridge National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; UT-Battelle; Battelle; National Science Foundation","keywords":"Tensor contraction; Contraction (grammar); Computer science; Tensor (intrinsic definition); Associative property; Cartesian tensor; Algorithm; Algebra over a field; Applied mathematics; Mathematics; Tensor product; Pure mathematics; Tensor density; Exact solutions in general relativity; Tensor field; Mathematical analysis","score_opus":0.03318684147215604,"score_gpt":0.33991539469982696,"score_spread":0.3067285532276709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954679557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11616195,0.0004934529,0.8755409,0.00038071309,0.000138062,0.00018570707,0.000130082,0.0020406626,0.004928558],"genre_scores_gemma":[0.34747553,0.000332814,0.6450059,0.00014482724,0.00010368643,0.00019297881,0.0004006882,0.0012112759,0.005132359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981445,0.00059258967,0.0001257388,0.00017322278,0.00066065957,0.00030326803],"domain_scores_gemma":[0.9936699,0.0029975509,0.00039795676,0.0013180078,0.0013892719,0.00022733833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328777,0.0013491401,0.0015271221,0.0014384873,0.00085141225,0.0013198063,0.0015084263,0.0007710955,0.004681085],"category_scores_gemma":[0.0117893815,0.00059622905,0.00088402786,0.0017784187,0.0011463953,0.0032781903,0.0016361215,0.0016407274,0.00091551524],"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.001418176,0.00049597723,0.0031784724,0.00053286966,0.00010399867,0.00032932972,0.0005357119,0.11630128,0.055934463,0.09950356,0.011924224,0.70974195],"study_design_scores_gemma":[0.00009100347,0.00027055474,0.00074563094,0.000057775636,0.00011047542,0.00019649966,0.00019356709,0.86314994,0.043072585,0.08801824,0.004049466,0.000044292377],"about_ca_topic_score_codex":0.0016633802,"about_ca_topic_score_gemma":0.0048473505,"teacher_disagreement_score":0.004681085,"about_ca_system_score_codex":0.00069351384,"about_ca_system_score_gemma":0.0023790854,"threshold_uncertainty_score":0.01565975},"labels":[],"label_agreement":null},{"id":"W1955580075","doi":"10.1007/978-3-319-08970-6_31","title":"On the Formalization of Z-Transform in HOL","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Infinite impulse response; Z-transform; HOL; Transcendental number; Computer science; Algorithm; Signal processing; Mathematics; Algebra over a field; Digital filter; Digital signal processing; Calculus (dental); Theoretical computer science; Discrete mathematics; Filter (signal processing); Pure mathematics; Mathematical analysis; Fractional Fourier transform; Programming language","score_opus":0.013977977191459733,"score_gpt":0.2323210986302469,"score_spread":0.21834312143878717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955580075","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.044818074,0.0070883804,0.69043845,0.005742623,0.0018390814,0.00011038561,0.0006683434,0.0012202708,0.24807444],"genre_scores_gemma":[0.76906985,0.005099973,0.1670724,0.0027279283,0.0017380121,0.00026593183,0.0007561813,0.0011895697,0.05208025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992506,0.00021515002,0.00006946893,0.00014347768,0.00020467301,0.00011666522],"domain_scores_gemma":[0.99944144,0.0002563464,0.000051030693,0.00010852412,0.000099769466,0.000042913263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012933076,0.0008281971,0.00082986197,0.0016234176,0.0014534025,0.003271362,0.0012348426,0.0012002238,0.010529603],"category_scores_gemma":[0.001837953,0.00050210813,0.0013640183,0.0013965798,0.0067129945,0.0071152346,0.0025312013,0.004531984,0.0019930378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008678474,0.0000052018004,0.000026696065,0.00002001553,0.0000020520506,0.000023409455,0.00009028588,0.00020752933,0.00019958052,0.99537414,0.0006976922,0.0033448115],"study_design_scores_gemma":[0.000010152699,0.000009699274,0.000057754056,0.00001926644,0.0000035423548,0.00005146274,0.000042779822,0.0010559798,0.00027786687,0.99062526,0.007838844,0.000007290697],"about_ca_topic_score_codex":0.0014075809,"about_ca_topic_score_gemma":0.0014201507,"teacher_disagreement_score":0.010529603,"about_ca_system_score_codex":0.0017117652,"about_ca_system_score_gemma":0.0006269735,"threshold_uncertainty_score":0.035225034},"labels":[],"label_agreement":null},{"id":"W1955809784","doi":"10.1007/11876663_5","title":"Awareness and Collaboration in the iHelp Courses Content Management System","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Content management system; Content management; Learning Management; Knowledge management; Content (measure theory); Multimedia; Management system; World Wide Web; Human–computer interaction; Management","score_opus":0.023472970289124043,"score_gpt":0.2685657729438873,"score_spread":0.24509280265476324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955809784","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.6204196,0.00065397564,0.2896273,0.0013455237,0.00013011876,0.00039733705,0.0007254888,0.022519765,0.064180896],"genre_scores_gemma":[0.92529094,0.00012914244,0.063227475,0.00014551537,0.00005124122,0.000106772044,0.0009287493,0.0004709115,0.009649198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988341,0.0003430325,0.00011107,0.00022591457,0.00035093262,0.00013498531],"domain_scores_gemma":[0.997398,0.0015753121,0.00012930055,0.0004403257,0.00019171298,0.00026548083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016750364,0.0002473958,0.00031651746,0.0007889058,0.00068218814,0.002744693,0.0009627949,0.0007832869,0.0028919245],"category_scores_gemma":[0.0047843955,0.00035654518,0.00024846807,0.0005572198,0.00039855108,0.0042148256,0.0027188447,0.0010197927,0.0007451327],"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.0015974877,0.0021594134,0.025672643,0.00023688385,0.00010793546,0.000606593,0.0066382904,0.011267456,0.04583609,0.025596922,0.01863262,0.8616478],"study_design_scores_gemma":[0.0004090005,0.0011932155,0.062004577,0.00021604692,0.00042570956,0.0016512473,0.004504143,0.5678798,0.15138286,0.07532733,0.13466284,0.00034327217],"about_ca_topic_score_codex":0.0023815902,"about_ca_topic_score_gemma":0.0026003234,"teacher_disagreement_score":0.0028919245,"about_ca_system_score_codex":0.0004980868,"about_ca_system_score_gemma":0.0007804277,"threshold_uncertainty_score":0.0096744895},"labels":[],"label_agreement":null},{"id":"W1955890204","doi":"10.1007/3-540-44798-9_11","title":"Register Transformations with Multiple Clock Domains","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Retiming; Digital clock manager; Abstraction; Clock skew; Clock domain crossing; Domain (mathematical analysis); Clock gating; Synchronous circuit; Range (aeronautics); Clock signal; Timing failure; Computer architecture; Parallel computing; Telecommunications","score_opus":0.019378182821370687,"score_gpt":0.22753063649278835,"score_spread":0.20815245367141766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955890204","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.052324638,0.0010922833,0.81652015,0.00039904847,0.00043916955,0.000115076524,0.0001314516,0.0029791335,0.12599906],"genre_scores_gemma":[0.7095281,0.0008713027,0.22008443,0.0003106595,0.00022994209,0.00011927622,0.00020589853,0.0007232169,0.067927144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961084,0.000064299755,0.000024816633,0.00008849626,0.00015013647,0.00006143382],"domain_scores_gemma":[0.99967957,0.0000899692,0.00003219515,0.00015792799,0.000028032702,0.000012340961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019299828,0.0005446079,0.00032837727,0.0005551208,0.00039150025,0.00089528115,0.00064909324,0.000408061,0.011479231],"category_scores_gemma":[0.0007995482,0.00031030443,0.00047583095,0.0006164549,0.000855844,0.0016818038,0.0010162552,0.0010166159,0.0026587092],"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.00023968836,0.00006228256,0.00013606512,0.0001708194,0.000022265,0.0003000348,0.00013729012,0.009945055,0.057481904,0.5624476,0.003943855,0.36511317],"study_design_scores_gemma":[0.000100440986,0.00032584,0.00029304504,0.00008332578,0.000074985015,0.0013886333,0.00008378444,0.052073278,0.21144669,0.6035154,0.1305544,0.00006023417],"about_ca_topic_score_codex":0.00014524994,"about_ca_topic_score_gemma":0.0003975309,"teacher_disagreement_score":0.011479231,"about_ca_system_score_codex":0.00030848157,"about_ca_system_score_gemma":0.0003049902,"threshold_uncertainty_score":0.038401842},"labels":[],"label_agreement":null},{"id":"W195598145","doi":"10.1007/978-3-540-88875-8_120","title":"Towards Semantically Enhanced Peer-to-Peer File-Sharing","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Carleton University","funders":"","keywords":"Computer science; File sharing; Peer-to-peer; Information retrieval; World Wide Web; Data sharing; Simple (philosophy); Database; The Internet","score_opus":0.021109929986230683,"score_gpt":0.25696606882393197,"score_spread":0.2358561388377013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195598145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076821176,0.00029395925,0.985002,0.0002408168,0.00012622222,0.0001411063,0.00015627014,0.0026478015,0.003709652],"genre_scores_gemma":[0.25109634,0.00068196404,0.7375746,0.00024703966,0.00016464268,0.00025076297,0.0011342202,0.0007494293,0.008101092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667275,0.0008192719,0.00021343144,0.000343723,0.001674812,0.00027605463],"domain_scores_gemma":[0.9960079,0.0009539473,0.00011762663,0.0020922981,0.0006930729,0.00013515637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031687145,0.000679566,0.0014644356,0.0008173803,0.0012332422,0.003098786,0.0035374004,0.0021625268,0.0033289175],"category_scores_gemma":[0.006639244,0.0006134576,0.0008695679,0.0015988583,0.0018525363,0.008009356,0.007098754,0.0027452088,0.0022708036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007473056,0.00039504818,0.00077430444,0.0009940218,0.00014488988,0.0006236449,0.0013100307,0.06983546,0.05688775,0.5860405,0.018542282,0.2637047],"study_design_scores_gemma":[0.000080433645,0.00011098678,0.0002673922,0.00009593242,0.000093061615,0.000696308,0.00031066083,0.49007213,0.04394004,0.4078986,0.05634207,0.00009237509],"about_ca_topic_score_codex":0.0010731887,"about_ca_topic_score_gemma":0.0012328053,"teacher_disagreement_score":0.0035374004,"about_ca_system_score_codex":0.0009793973,"about_ca_system_score_gemma":0.0012499302,"threshold_uncertainty_score":0.016757965},"labels":[],"label_agreement":null},{"id":"W1956195433","doi":"10.1007/11767589_25","title":"Geist3D, a Simulation Tool for Geometry-Driven Petri Nets","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Petri net; Computer science; Mechatronics; Python (programming language); Actuator; Formalism (music); Virtual machine; Control engineering; Programming language; Distributed computing; Artificial intelligence; Engineering","score_opus":0.02521170232369617,"score_gpt":0.2680541675079275,"score_spread":0.2428424651842313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956195433","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.009642408,0.00023967664,0.9437287,0.00013575389,0.00018228946,0.00012653413,0.002804506,0.025330417,0.017809628],"genre_scores_gemma":[0.18402892,0.0012980916,0.77416825,0.00029375337,0.00006440029,0.0009876816,0.008902403,0.009755828,0.020500647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967885,0.00004638079,0.00001900239,0.000042421238,0.000175623,0.000037749378],"domain_scores_gemma":[0.99960345,0.00020947457,0.000025925743,0.000057921385,0.000074489086,0.000028749175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043402912,0.0013189669,0.0008965331,0.0007898099,0.0006201264,0.0010021075,0.002613238,0.0012564654,0.01915212],"category_scores_gemma":[0.0012620264,0.0009659243,0.0014197796,0.00066108006,0.000534857,0.0009945973,0.0010812852,0.0013647141,0.0033563566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016475761,0.00009557636,0.0012774348,0.00058502017,0.00012627683,0.00036736374,0.0002478736,0.85088825,0.016376903,0.041929197,0.028039886,0.059901442],"study_design_scores_gemma":[0.00009958745,0.00003452617,0.0002016593,0.000039740746,0.00004327138,0.00015567323,0.000023459028,0.91712785,0.012268598,0.014025492,0.055940043,0.000040217477],"about_ca_topic_score_codex":0.008486294,"about_ca_topic_score_gemma":0.011677711,"teacher_disagreement_score":0.01915212,"about_ca_system_score_codex":0.0007832846,"about_ca_system_score_gemma":0.001371963,"threshold_uncertainty_score":0.064070284},"labels":[],"label_agreement":null},{"id":"W1956232549","doi":"10.1007/3-540-45452-7_17","title":"A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fractal and DNA sequence analysis","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":"Hidden Markov model; Minimum description length; Sequence (biology); Generalization; Algorithm; Computer science; Geometric distribution; Distribution (mathematics); Abstraction; Pattern recognition (psychology); Probability distribution; Artificial intelligence; Mathematics; Statistics; Biology; Mathematical analysis","score_opus":0.02209476496238248,"score_gpt":0.27669040962193675,"score_spread":0.25459564465955425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956232549","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.00043709032,0.000063335036,0.9982035,0.000061663486,0.00005084204,0.000010050623,0.000048070997,0.0010355887,0.00008982171],"genre_scores_gemma":[0.011955121,0.00018713817,0.9830663,0.00014682606,0.00013793216,0.00015387798,0.0004192002,0.00152522,0.002408347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682224,0.0011628103,0.00029474843,0.0008681387,0.0007352993,0.000116751995],"domain_scores_gemma":[0.98872185,0.006306862,0.00029593203,0.0031181965,0.0013252001,0.00023196159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005816526,0.0019666408,0.0027944578,0.0020631568,0.0016547746,0.0028963361,0.003750158,0.0046789013,0.011335809],"category_scores_gemma":[0.01986563,0.0022305823,0.0032131865,0.0031187271,0.0015712857,0.0069599417,0.0024286036,0.0071902056,0.0070163817],"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.00046934135,0.0003644948,0.0017709614,0.0004704671,0.0004030098,0.00037680892,0.0007091177,0.16645591,0.02653196,0.15654612,0.018225001,0.6276767],"study_design_scores_gemma":[0.00005990954,0.000049349852,0.00029067404,0.000042129283,0.00007307248,0.00030764547,0.00003356566,0.89261913,0.0082369745,0.08372654,0.014447458,0.00011357239],"about_ca_topic_score_codex":0.0038567425,"about_ca_topic_score_gemma":0.003812371,"teacher_disagreement_score":0.011335809,"about_ca_system_score_codex":0.001376062,"about_ca_system_score_gemma":0.0013073582,"threshold_uncertainty_score":0.037922084},"labels":[],"label_agreement":null},{"id":"W1956292792","doi":"10.1007/978-3-540-72665-4_19","title":"Managing Conditional and Composite CSPs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Computer science; Local consistency; Variable (mathematics); Constraint satisfaction problem; Mathematical optimization; Constraint (computer-aided design); A priori and a posteriori; Variable elimination; Constraint programming; Constraint satisfaction; Mathematics; Artificial intelligence; Stochastic programming; Probabilistic logic","score_opus":0.015318566796119681,"score_gpt":0.2457880747256831,"score_spread":0.23046950792956342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956292792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01592977,0.0005481013,0.9544378,0.00048205408,0.00019428198,0.00018505697,0.00038110098,0.0039639287,0.023877844],"genre_scores_gemma":[0.21201682,0.0011303279,0.74634606,0.00026382023,0.0003294644,0.0003956258,0.002148253,0.0022307702,0.035138857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971522,0.0006104488,0.00020195651,0.0003322024,0.0013602974,0.00034285814],"domain_scores_gemma":[0.99394906,0.0032393949,0.00027245097,0.001400512,0.00071225304,0.00042638605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031484729,0.000993795,0.0009902022,0.0015814623,0.0017288062,0.0037418138,0.0028487649,0.0009301216,0.012764978],"category_scores_gemma":[0.009487559,0.0010753998,0.0015944208,0.0032190015,0.0016720019,0.009891808,0.0069336,0.003615534,0.0025243724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020188544,0.00021135551,0.00097444456,0.00056827575,0.00007964877,0.0007479389,0.00070420327,0.04514836,0.0076139746,0.66373867,0.026434423,0.25357676],"study_design_scores_gemma":[0.00004315671,0.000054381955,0.00030448096,0.000099384655,0.00010405217,0.0006056026,0.00024525024,0.19878061,0.012555494,0.6983109,0.08883322,0.00006346778],"about_ca_topic_score_codex":0.0016111479,"about_ca_topic_score_gemma":0.0038964287,"teacher_disagreement_score":0.012764978,"about_ca_system_score_codex":0.0009213028,"about_ca_system_score_gemma":0.0020910117,"threshold_uncertainty_score":0.04270315},"labels":[],"label_agreement":null},{"id":"W1956656014","doi":"10.1007/3-540-44830-6_15","title":"Fault Diagnosis in Extended Finite State Machines","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Finite-state machine; Computer science; Test suite; State (computer science); Suite; Fault (geology); Finite state; Algorithm; Test case; Machine learning","score_opus":0.020160453791129414,"score_gpt":0.26465815315733293,"score_spread":0.24449769936620352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956656014","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.02155762,0.0006095934,0.9746606,0.0001047904,0.000058117872,0.000022528611,0.000043831573,0.0010313578,0.0019116962],"genre_scores_gemma":[0.6692845,0.0006938161,0.32471025,0.0001099435,0.00008410285,0.000078127065,0.00026865726,0.00015199285,0.004618567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990402,0.00025187054,0.00008050066,0.00019243543,0.00033606574,0.00009894265],"domain_scores_gemma":[0.99453247,0.0042245598,0.00021999715,0.0005724972,0.00038855642,0.00006186343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071955,0.0005531555,0.00079987774,0.00078047864,0.00032650054,0.0008322535,0.0012019932,0.0009066132,0.0024802478],"category_scores_gemma":[0.006440488,0.00051444146,0.00081672915,0.0006404879,0.0013222799,0.0031535309,0.0009128024,0.0015523126,0.00029895836],"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.0006363058,0.00012175737,0.0020818457,0.0006434998,0.00012699982,0.00095181353,0.0006758212,0.3799777,0.017174758,0.22591013,0.0033044245,0.36839494],"study_design_scores_gemma":[0.000038868635,0.00008517889,0.000455013,0.0000924489,0.00004096148,0.0002721275,0.000037826714,0.6829015,0.011730314,0.30113587,0.0031869193,0.000022968414],"about_ca_topic_score_codex":0.001041569,"about_ca_topic_score_gemma":0.0009942874,"teacher_disagreement_score":0.0024802478,"about_ca_system_score_codex":0.00064166496,"about_ca_system_score_gemma":0.0005041723,"threshold_uncertainty_score":0.008297205},"labels":[],"label_agreement":null},{"id":"W1956666728","doi":"10.1007/11889205_17","title":"Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Parametric statistics; Novelty; Machine learning; Local search (optimization); Artificial intelligence; Mathematics","score_opus":0.007564657004435706,"score_gpt":0.2255491661934901,"score_spread":0.2179845091890544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956666728","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.02909838,0.0005501824,0.96473753,0.00026819942,0.00010540177,0.000057094836,0.00007667608,0.0023337996,0.0027727326],"genre_scores_gemma":[0.72638553,0.00026515345,0.2698191,0.00014434387,0.00021185006,0.00021549177,0.00029557646,0.00060135365,0.002061557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913133,0.003974086,0.00041438072,0.0016154031,0.0019297628,0.0007530387],"domain_scores_gemma":[0.962976,0.024615336,0.002078506,0.007698261,0.002195411,0.0004365092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008953182,0.0012990908,0.0017624098,0.0013264378,0.0008037787,0.002309574,0.0035420407,0.0019972953,0.0036712913],"category_scores_gemma":[0.056920536,0.0008768402,0.000979027,0.0013243513,0.001898834,0.004180431,0.0024299326,0.002891226,0.001084961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006742442,0.00024103728,0.002314074,0.00012210586,0.000081458806,0.000046668552,0.00009292603,0.7361171,0.004783698,0.04727403,0.0036467132,0.20460594],"study_design_scores_gemma":[0.000024414725,0.00004386519,0.00023418329,0.0000089408595,0.000008285843,0.00001556645,0.000006586185,0.97816443,0.0012408822,0.019922553,0.0003195026,0.000010817193],"about_ca_topic_score_codex":0.0020741897,"about_ca_topic_score_gemma":0.0017635376,"teacher_disagreement_score":0.008953182,"about_ca_system_score_codex":0.001550641,"about_ca_system_score_gemma":0.0023634443,"threshold_uncertainty_score":0.047349513},"labels":[],"label_agreement":null},{"id":"W195714529","doi":"10.1007/978-3-642-23199-5_8","title":"Granular Instances Selection for Fuzzy Modeling","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Computer science; Granularity; Feature selection; Data mining; Selection (genetic algorithm); Particle swarm optimization; Granular computing; Fuzzy logic; Artificial intelligence; Task (project management); Machine learning; Rough set","score_opus":0.03361113244121725,"score_gpt":0.26160741342491217,"score_spread":0.22799628098369493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195714529","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.0060285926,0.0005437917,0.9908144,0.00012023924,0.0000509208,0.000050018454,0.00013593276,0.00034555185,0.0019105503],"genre_scores_gemma":[0.2845829,0.00087339943,0.7082712,0.0001337161,0.00018482497,0.00026870007,0.00081757957,0.00021215422,0.004655581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990483,0.00030355045,0.00006887797,0.00016745369,0.0003418672,0.00006991048],"domain_scores_gemma":[0.9987618,0.0007576467,0.00006409483,0.00022829199,0.00014516313,0.000043108328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019863737,0.0007126314,0.0015469475,0.0013786061,0.0005520289,0.0017487729,0.0015873142,0.0009218301,0.0048920936],"category_scores_gemma":[0.004613175,0.0005534685,0.0013854291,0.00193258,0.00057663565,0.0019075613,0.0013030141,0.0017772602,0.0008166712],"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.00025771448,0.00012404719,0.00081326114,0.00031607877,0.00017624222,0.00016269961,0.00014312331,0.39418128,0.0052621053,0.14818472,0.0084192045,0.4419595],"study_design_scores_gemma":[0.000006396496,0.0000161088,0.0001104827,0.000021687367,0.000015915935,0.00002724749,0.000010818919,0.9442818,0.0007917895,0.053272244,0.0014379907,0.0000074453983],"about_ca_topic_score_codex":0.0015852887,"about_ca_topic_score_gemma":0.0017407343,"teacher_disagreement_score":0.0048920936,"about_ca_system_score_codex":0.0007385063,"about_ca_system_score_gemma":0.0005323112,"threshold_uncertainty_score":0.016365647},"labels":[],"label_agreement":null},{"id":"W1957456020","doi":"10.1007/978-3-642-40760-4_24","title":"A Variational Formulation for Discrete Registration","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minification; Finite element method; Regularization (linguistics); Gaussian; Computer science; Energy minimization; Markov random field; Variational method; Energy functional; Random field; Mathematical optimization; Markov chain; Algorithm; Applied mathematics; Mathematics; Artificial intelligence; Mathematical analysis; Image segmentation; Segmentation; Physics","score_opus":0.015830043516821206,"score_gpt":0.29145217853284,"score_spread":0.2756221350160188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957456020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010176309,0.00012289955,0.997858,0.00013591447,0.000030362584,0.0000148729505,0.00003059754,0.00004490026,0.0007448297],"genre_scores_gemma":[0.13963526,0.00093323935,0.84117806,0.00033546923,0.00029014217,0.00022208803,0.00046587488,0.00054012187,0.016399715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00022081529,0.000030125146,0.0001260393,0.0001654267,0.000038763286],"domain_scores_gemma":[0.99914634,0.00050315866,0.00006839496,0.00008934576,0.00011745321,0.00007533784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015567413,0.00072804175,0.0013186302,0.00087260036,0.000435604,0.0014602579,0.0019524947,0.0020910713,0.003926619],"category_scores_gemma":[0.0029617865,0.0010318378,0.001303207,0.0010473027,0.0018378594,0.0017558009,0.0026876992,0.002681478,0.0008331418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008181443,0.00007278767,0.00026670098,0.00023710712,0.000089383626,0.000114465,0.0001444654,0.43115988,0.008179268,0.47100118,0.00458665,0.084066324],"study_design_scores_gemma":[0.000010509275,0.000020343445,0.000056504126,0.000009563951,0.0000095838905,0.000048299302,0.000011228815,0.9244086,0.0004707218,0.07184859,0.0030950166,0.000010895595],"about_ca_topic_score_codex":0.0038177841,"about_ca_topic_score_gemma":0.0041993596,"teacher_disagreement_score":0.003926619,"about_ca_system_score_codex":0.0008968901,"about_ca_system_score_gemma":0.001153465,"threshold_uncertainty_score":0.013135791},"labels":[],"label_agreement":null},{"id":"W1957600156","doi":"10.1007/978-3-642-39094-4_21","title":"Spectral Geometric Descriptor for Deformable 3D Shape Matching and Retrieval","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Matching (statistics); Graph; Artificial intelligence; Pattern recognition (psychology); Eigenfunction; Computer vision; Algorithm; Theoretical computer science; Mathematics; Eigenvalues and eigenvectors","score_opus":0.015236435905742076,"score_gpt":0.21068127298924974,"score_spread":0.19544483708350766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957600156","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.004755555,0.0013494003,0.99004704,0.000099292985,0.00018530374,0.000053144006,0.00025109784,0.0012099949,0.0020491711],"genre_scores_gemma":[0.17779878,0.0040244926,0.7911626,0.00038243126,0.00031242822,0.0002416081,0.003625064,0.00058690476,0.021865701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940467,0.00005371578,0.000035647914,0.00010526099,0.00034328215,0.00005754289],"domain_scores_gemma":[0.9996364,0.00004439329,0.000027560898,0.00013762272,0.00013506439,0.000019066496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045036967,0.0006133126,0.0012530151,0.0019416376,0.0003599457,0.0011408177,0.0017039712,0.0010401466,0.0072546164],"category_scores_gemma":[0.0011074233,0.00034458586,0.0008559214,0.0031809183,0.0005922339,0.0017360582,0.001470247,0.0007933506,0.004944081],"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.000115484705,0.00008038049,0.00023709914,0.00017585552,0.000040028004,0.00006732079,0.00003488223,0.017292,0.05395665,0.022372784,0.017236924,0.8883906],"study_design_scores_gemma":[0.00002652866,0.00013311891,0.0013192322,0.00005083174,0.000057282123,0.00077482505,0.00009833919,0.86141044,0.054596595,0.040293366,0.0411616,0.00007776229],"about_ca_topic_score_codex":0.002186814,"about_ca_topic_score_gemma":0.0031061692,"teacher_disagreement_score":0.0072546164,"about_ca_system_score_codex":0.00061507337,"about_ca_system_score_gemma":0.0006895054,"threshold_uncertainty_score":0.024269164},"labels":[],"label_agreement":null},{"id":"W1958165731","doi":"10.1007/978-3-642-40811-3_67","title":"Joint Segmentation of 3D Femoral Lumen and Outer Wall Surfaces from MR Images","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research; Canada Research Chairs; City University of Hong Kong","keywords":"Segmentation; Regular polygon; Lumen (anatomy); Computer science; Relaxation (psychology); Algorithm; Convex optimization; Artificial intelligence; Geometry; Mathematics","score_opus":0.015196312255101476,"score_gpt":0.2638009538905236,"score_spread":0.24860464163542212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958165731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12634881,0.001234798,0.86423624,0.00017660874,0.000057915142,0.0001322438,0.00069412263,0.0053758705,0.0017434065],"genre_scores_gemma":[0.44622225,0.0011321391,0.5471586,0.00012572139,0.00007844316,0.00013727702,0.001421177,0.0009157542,0.0028086472],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996221,0.00005483251,0.000031638134,0.00006151178,0.00015688631,0.000072896175],"domain_scores_gemma":[0.9994242,0.00018739737,0.000086236454,0.000096340154,0.00016346414,0.00004234346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009381718,0.00089563825,0.0010622669,0.0028837807,0.00042140455,0.0023143233,0.0006679316,0.0015811522,0.0016962343],"category_scores_gemma":[0.0020595754,0.0008494735,0.0011777304,0.0014889452,0.00043173152,0.00059150567,0.0009383525,0.0006340348,0.0014180108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010683057,0.00016357622,0.01152746,0.0006012553,0.00019107315,0.00083804986,0.00090571557,0.05596175,0.30844045,0.0032288122,0.0056560626,0.6114176],"study_design_scores_gemma":[0.00009069334,0.0003722724,0.047853872,0.00022122788,0.00032090937,0.0034472528,0.0005131488,0.7602238,0.1650824,0.0075801597,0.01409167,0.0002024977],"about_ca_topic_score_codex":0.004365115,"about_ca_topic_score_gemma":0.006231749,"teacher_disagreement_score":0.004365115,"about_ca_system_score_codex":0.00036218952,"about_ca_system_score_gemma":0.0014985251,"threshold_uncertainty_score":0.00867939},"labels":[],"label_agreement":null},{"id":"W1958345963","doi":"10.1007/978-3-540-88192-6_26","title":"Using Data Mining Methods to Predict Personally Identifiable Information in Emails","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Research and Productivity Council","funders":"","keywords":"Computer science; Private information retrieval; Information extraction; Data mining; Quality (philosophy); Information retrieval; Data science; Computer security","score_opus":0.07542289935797529,"score_gpt":0.3271868826411642,"score_spread":0.2517639832831889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958345963","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.6588563,0.0030349828,0.3223248,0.0013299567,0.00038794632,0.00047771915,0.0059318864,0.0025128375,0.00514359],"genre_scores_gemma":[0.8220407,0.0009990818,0.16787226,0.00014022614,0.00028536704,0.00018718737,0.0058188736,0.000062881176,0.0025934507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824524,0.0004017422,0.00024839005,0.00040222908,0.0005871983,0.000115350296],"domain_scores_gemma":[0.99000657,0.0072349436,0.00081746525,0.0006045304,0.0011307187,0.00020574224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020627994,0.00088203634,0.0009137,0.0057313116,0.00067447295,0.0020150114,0.0009681494,0.0014271275,0.00067322166],"category_scores_gemma":[0.01033395,0.000359094,0.0010374329,0.0032562965,0.0003579202,0.002104466,0.00062146626,0.0013630021,0.0011760164],"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.0006154115,0.0018241964,0.24184875,0.0004324697,0.0004974668,0.00059753656,0.00053020206,0.04720777,0.010003702,0.0027646183,0.007852535,0.6858254],"study_design_scores_gemma":[0.000028391783,0.0003252684,0.034488924,0.00009746965,0.00020904753,0.0007016979,0.00034529294,0.93451744,0.014639376,0.011019766,0.0035717785,0.00005558836],"about_ca_topic_score_codex":0.0018173747,"about_ca_topic_score_gemma":0.0022571846,"teacher_disagreement_score":0.0057313116,"about_ca_system_score_codex":0.0005066963,"about_ca_system_score_gemma":0.00054178975,"threshold_uncertainty_score":0.010909259},"labels":[],"label_agreement":null},{"id":"W1958941591","doi":"10.1007/3-540-40996-3_38","title":"An Improved Algorithm for Subdivision Traversal without Extra Storage","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Subdivision; Tree traversal; Computer science; Pointer (user interface); Algorithm; Running time; Planar; Constant (computer programming); Graph traversal; Computer graphics (images); Artificial intelligence; Programming language","score_opus":0.014245404066485858,"score_gpt":0.258003894340457,"score_spread":0.24375849027397115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958941591","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.007413194,0.00017315555,0.97949135,0.000107389504,0.00022095963,0.00012104436,0.00020443962,0.0064637666,0.0058045667],"genre_scores_gemma":[0.025423996,0.000095064046,0.96317565,0.00007885883,0.00004480049,0.00012945561,0.00066835125,0.0007703967,0.009613346],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903655,0.00008319588,0.000075858356,0.00017972899,0.00048965024,0.0001350776],"domain_scores_gemma":[0.9989723,0.00019756347,0.000031258034,0.0004199365,0.00032624908,0.000052720803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043756462,0.0014047989,0.0015204925,0.0018199147,0.00093120727,0.0014662909,0.002930724,0.0013396293,0.023526525],"category_scores_gemma":[0.0016445653,0.0009297219,0.0013075897,0.0028328327,0.0006460158,0.0023964574,0.0027365282,0.0019221068,0.007972362],"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.0005035228,0.00022320572,0.00036622124,0.00025804288,0.00006814346,0.00015807275,0.00021734611,0.015399799,0.06237759,0.023027709,0.023956563,0.87344384],"study_design_scores_gemma":[0.0005371033,0.00043854341,0.0015182692,0.000077387245,0.00026624723,0.0011367771,0.00016195842,0.7730435,0.0665355,0.046762817,0.10934661,0.00017526017],"about_ca_topic_score_codex":0.0060218005,"about_ca_topic_score_gemma":0.010349323,"teacher_disagreement_score":0.023526525,"about_ca_system_score_codex":0.0008204065,"about_ca_system_score_gemma":0.001408401,"threshold_uncertainty_score":0.07870406},"labels":[],"label_agreement":null},{"id":"W1959340037","doi":"10.1007/978-3-319-45477-1_10","title":"Using STPA in an ISO 26262 Compliant Process","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Automotive industry; Process (computing); Computer science; Hazard analysis; Original equipment manufacturer; Manufacturing engineering; Functional safety; Hazard; Risk analysis (engineering); Engineering; Reliability engineering; Business","score_opus":0.027392353679146234,"score_gpt":0.25684850503408296,"score_spread":0.22945615135493674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959340037","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.0293377,0.00015951376,0.928089,0.00019750347,0.000085810534,0.0002195045,0.0001170599,0.0032462974,0.038547594],"genre_scores_gemma":[0.3823601,0.00032228764,0.5786826,0.000155639,0.000027683578,0.00020819303,0.0003807674,0.0006729458,0.03718974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974874,0.00051204505,0.00018901634,0.00032757668,0.001307387,0.00017647755],"domain_scores_gemma":[0.9987834,0.00033942825,0.00008582537,0.00043592244,0.00031385862,0.000041557567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016037486,0.0005903877,0.00038965177,0.00048292018,0.0009787966,0.0026230034,0.0008410445,0.0014452491,0.0041483706],"category_scores_gemma":[0.0029313678,0.00048817,0.00057205866,0.00076746684,0.00083615445,0.0020844133,0.0015404621,0.0012717656,0.0022949087],"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.00061799603,0.00047595988,0.0019258277,0.00060972065,0.000054344684,0.0015112391,0.0025926796,0.04596053,0.16409764,0.30268028,0.007044657,0.47242922],"study_design_scores_gemma":[0.00010024835,0.00065120996,0.0014642951,0.00030473317,0.00013452415,0.001489205,0.00041142252,0.35665286,0.27550232,0.09447275,0.26870096,0.00011554746],"about_ca_topic_score_codex":0.0025218918,"about_ca_topic_score_gemma":0.002848811,"teacher_disagreement_score":0.0041483706,"about_ca_system_score_codex":0.00046527118,"about_ca_system_score_gemma":0.0018535207,"threshold_uncertainty_score":0.01387769},"labels":[],"label_agreement":null},{"id":"W1959619913","doi":"10.1007/3-540-44801-2_15","title":"RecTree: An Efficient Collaborative Filtering Method","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Collaborative filtering; Scalability; Clique; Cluster analysis; Filter (signal processing); Process (computing); Bloom filter; Data mining; Recommender system; Information overload; Face (sociological concept); Information retrieval; Artificial intelligence; Database; World Wide Web; Algorithm","score_opus":0.024643858814671016,"score_gpt":0.2969905545117863,"score_spread":0.2723466956971153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959619913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007492847,0.00016065862,0.99682945,0.000036015346,0.000068552836,0.00005836075,0.00010670628,0.0013303948,0.0006605491],"genre_scores_gemma":[0.013626085,0.00023357937,0.9790318,0.00008177478,0.00008236446,0.0001417175,0.0004712789,0.0003477214,0.0059836335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634475,0.0012385178,0.0001892754,0.0006134857,0.0014415944,0.00017241365],"domain_scores_gemma":[0.9952245,0.0022148464,0.00014484848,0.0014139338,0.00084601407,0.00015584585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030050757,0.0016410329,0.002737452,0.0034783,0.0014410691,0.002092693,0.0032336754,0.0023259758,0.011015373],"category_scores_gemma":[0.009072696,0.0011901055,0.0019611295,0.0044245827,0.00071975484,0.0028540904,0.002664281,0.0018474305,0.007701694],"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.00048103908,0.00024380241,0.0005621594,0.000332198,0.00029163418,0.00012541235,0.00020748033,0.04328615,0.0068920716,0.0250594,0.025865667,0.89665294],"study_design_scores_gemma":[0.0002673681,0.00020656313,0.00047947917,0.00006312322,0.00018157005,0.0005145891,0.00006804113,0.9067685,0.009148088,0.037993457,0.044202015,0.000107099884],"about_ca_topic_score_codex":0.008547967,"about_ca_topic_score_gemma":0.0146673545,"teacher_disagreement_score":0.011015373,"about_ca_system_score_codex":0.00058210053,"about_ca_system_score_gemma":0.0015820415,"threshold_uncertainty_score":0.036850154},"labels":[],"label_agreement":null},{"id":"W1959797194","doi":"10.1007/978-3-642-31057-7_30","title":"Application-Only Call Graph Construction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":100,"is_retracted":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":"Call graph; Computer science; Graph; Theoretical computer science; Programming language","score_opus":0.013995644423430504,"score_gpt":0.24472505283389454,"score_spread":0.23072940841046402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959797194","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.010282399,0.00015669428,0.93669474,0.00030235254,0.00020870812,0.0002476018,0.00041176256,0.020883093,0.030812636],"genre_scores_gemma":[0.2515215,0.00040121365,0.6940723,0.00061894965,0.0001333429,0.00037795096,0.0026801429,0.009512159,0.040682495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984871,0.00023852113,0.00007052082,0.00029816706,0.00065635145,0.0002493727],"domain_scores_gemma":[0.99669826,0.0006410283,0.000084692794,0.0019048111,0.000542235,0.0001289464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954176,0.0009853579,0.0008607149,0.001564376,0.0009733699,0.0016419832,0.0021626346,0.0011670402,0.022659468],"category_scores_gemma":[0.00418896,0.00097164465,0.0013177709,0.0013418287,0.0011590498,0.002925879,0.003744458,0.0029071802,0.010296748],"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.00025456707,0.00037520606,0.0018029083,0.0007564115,0.000108593995,0.0005929249,0.0004748183,0.010827838,0.052434053,0.19179223,0.055589832,0.6849906],"study_design_scores_gemma":[0.00010344329,0.00024887442,0.0028208848,0.00025317664,0.0003403493,0.0022084417,0.0002858353,0.17876962,0.15165572,0.36937213,0.2937928,0.0001487637],"about_ca_topic_score_codex":0.0012834362,"about_ca_topic_score_gemma":0.0024906218,"teacher_disagreement_score":0.022659468,"about_ca_system_score_codex":0.00051161717,"about_ca_system_score_gemma":0.002039242,"threshold_uncertainty_score":0.07580352},"labels":[],"label_agreement":null},{"id":"W195980548","doi":"10.1007/978-3-642-03722-1_2","title":"A Universal Metamodel and Its Dictionary","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metamodeling; Schema (genetic algorithms); Semi-structured model; XML; Document Structure Description; Unified Modeling Language; Relational database; Relational model; Database schema; Programming language; Representation (politics); XML Schema (W3C); Class diagram; Information retrieval; Entity–relationship model; Natural language processing; Artificial intelligence; Theoretical computer science; Database design; Database model; Document type definition; Software; World Wide Web","score_opus":0.01986922022753037,"score_gpt":0.23266272811304622,"score_spread":0.21279350788551585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195980548","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.0043135635,0.0058705923,0.8979143,0.004029233,0.0013487587,0.0001534199,0.0014124967,0.0019904708,0.08296717],"genre_scores_gemma":[0.119716845,0.010675516,0.7947919,0.0028736298,0.0011130616,0.0006462104,0.0037064815,0.002366515,0.06410982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835855,0.00036578364,0.00036428703,0.00042282828,0.00036096177,0.00012759192],"domain_scores_gemma":[0.9985499,0.00038832737,0.0000822071,0.0006209411,0.00027566345,0.00008283748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022612184,0.00087624224,0.0014403317,0.004762847,0.0026275183,0.0051336433,0.0023251737,0.0021866113,0.0078065237],"category_scores_gemma":[0.0036542693,0.0010371899,0.0018745798,0.006894677,0.005565484,0.015604824,0.0037246908,0.0046652933,0.0033411137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054258567,0.000008964874,0.00003591158,0.00007176828,0.0000042651036,0.000032564516,0.00033902956,0.00020736523,0.0002528456,0.9749566,0.0042527243,0.019832538],"study_design_scores_gemma":[0.000006502625,0.000011071513,0.000066545996,0.00022242776,0.000020029303,0.00028869484,0.00015160357,0.0017241469,0.0006221434,0.6722585,0.32460815,0.000020214598],"about_ca_topic_score_codex":0.0031253847,"about_ca_topic_score_gemma":0.0026704622,"teacher_disagreement_score":0.0078065237,"about_ca_system_score_codex":0.0022315173,"about_ca_system_score_gemma":0.0025557724,"threshold_uncertainty_score":0.026115358},"labels":[],"label_agreement":null},{"id":"W196019468","doi":"10.1007/978-3-642-16373-9","title":"Conceptual Modeling – ER 2010","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Statistical and Computational Modeling","field":"Computer Science","cited_by":94,"is_retracted":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; Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.027273939598829258,"score_gpt":0.2609919015891631,"score_spread":0.23371796199033382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196019468","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.0020944558,0.00823762,0.63746923,0.003631819,0.0016886515,0.00007939365,0.0014232849,0.0048883776,0.3404872],"genre_scores_gemma":[0.05411298,0.013801679,0.23523179,0.00092448154,0.0011147459,0.00019794695,0.0072656358,0.0035439897,0.6838067],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936324,0.00013299404,0.000036289857,0.00020268594,0.00022997092,0.000034883975],"domain_scores_gemma":[0.9993538,0.00017165256,0.000022178554,0.00026430443,0.00015462255,0.00003339406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011239054,0.0014126793,0.00089800055,0.0010726741,0.00057881867,0.0031194168,0.0019225376,0.0010188028,0.079972714],"category_scores_gemma":[0.0018799335,0.0008616705,0.0012220005,0.0017151282,0.0010638863,0.004580795,0.0013125226,0.0021972333,0.045531236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050180246,0.00005858603,0.00008876582,0.0002463958,0.000031896325,0.00006767298,0.00014118143,0.005361012,0.0013957787,0.32890958,0.2560356,0.40761337],"study_design_scores_gemma":[0.000014954859,0.000019779573,0.00021563182,0.00015549561,0.000033836743,0.0002986736,0.00006655531,0.018826185,0.0016104346,0.23906061,0.739674,0.0000238877],"about_ca_topic_score_codex":0.0028532664,"about_ca_topic_score_gemma":0.0029236625,"teacher_disagreement_score":0.079972714,"about_ca_system_score_codex":0.00152041,"about_ca_system_score_gemma":0.0010667827,"threshold_uncertainty_score":0.2675354},"labels":[],"label_agreement":null},{"id":"W1960477652","doi":"10.1007/978-3-540-89689-0_64","title":"An Efficient Algorithm for Optimal Multilevel Thresholding of Irregularly Sampled Histograms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Windsor","funders":"","keywords":"Thresholding; Histogram; Algorithm; Computer science; Balanced histogram thresholding; Artificial intelligence; Pattern recognition (psychology); Histogram matching; Image (mathematics)","score_opus":0.03515733186120595,"score_gpt":0.29049898290316956,"score_spread":0.2553416510419636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960477652","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.0013851397,0.00007293686,0.99754804,0.000034994755,0.000029102617,0.000024694526,0.000033757533,0.00045331757,0.00041798427],"genre_scores_gemma":[0.01442941,0.000086134576,0.9842547,0.000027817881,0.000024867488,0.00005880156,0.000109398694,0.0001574431,0.0008515264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994388,0.00007537039,0.000041511375,0.000080120495,0.0003060374,0.000058112117],"domain_scores_gemma":[0.9991092,0.00031639653,0.00005826312,0.00020708772,0.00025337446,0.00005567613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069755426,0.00064962235,0.0011228175,0.0012859072,0.0005037546,0.0014049761,0.0015221925,0.0012618827,0.009060152],"category_scores_gemma":[0.0032052747,0.0007175089,0.000992807,0.0018213547,0.0005005498,0.0011823633,0.0022209543,0.0017325132,0.0030566277],"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.0001784613,0.00007693479,0.00029594,0.00019360006,0.00006903214,0.00009051398,0.00013567791,0.030854858,0.05753579,0.027994517,0.0069494722,0.87562513],"study_design_scores_gemma":[0.00006259299,0.000094081915,0.000744656,0.000035311317,0.000059271002,0.00036045065,0.000044431657,0.92835927,0.027518364,0.03133866,0.011333742,0.000049181737],"about_ca_topic_score_codex":0.0015352367,"about_ca_topic_score_gemma":0.0036924195,"teacher_disagreement_score":0.009060152,"about_ca_system_score_codex":0.0005891181,"about_ca_system_score_gemma":0.00090202544,"threshold_uncertainty_score":0.0303092},"labels":[],"label_agreement":null},{"id":"W1960513303","doi":"10.1007/978-3-642-39310-5_18","title":"Shortest Repetition-Free Words Accepted by Automata","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Repetition (rhetorical device); Automaton; Discrete mathematics; Combinatorics; Upper and lower bounds; Mathematics; Computer science; Arithmetic; Theoretical computer science; Linguistics","score_opus":0.010964330751629505,"score_gpt":0.2452820866756373,"score_spread":0.2343177559240078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960513303","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.7288839,0.000755255,0.23377551,0.001519164,0.0004317221,0.00011983867,0.0006615227,0.002402318,0.03145073],"genre_scores_gemma":[0.9361528,0.0002538727,0.046583463,0.0002975169,0.00027658674,0.00012435879,0.0006651704,0.0005235506,0.015122648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776065,0.0004898253,0.0002585342,0.0005495109,0.0006013847,0.0003400913],"domain_scores_gemma":[0.99181855,0.004453812,0.000698869,0.0010584441,0.0013516627,0.0006187032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009824941,0.0005984226,0.0007750737,0.00088589685,0.0015859983,0.003167174,0.0015285377,0.0013618519,0.004434424],"category_scores_gemma":[0.0069772755,0.00067519455,0.0009886266,0.00096726324,0.0016507171,0.0038865767,0.0017132685,0.0016660001,0.0016309058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017445642,0.0002019388,0.004408132,0.0005404024,0.00014951263,0.0017300629,0.005413882,0.017327692,0.067725234,0.82549214,0.007484093,0.06778234],"study_design_scores_gemma":[0.00010316111,0.00012267391,0.00043820546,0.00003512837,0.00007767258,0.00045365616,0.0004156134,0.02895271,0.010012291,0.95165366,0.007677656,0.000057646652],"about_ca_topic_score_codex":0.00048272638,"about_ca_topic_score_gemma":0.00083506,"teacher_disagreement_score":0.004434424,"about_ca_system_score_codex":0.0007699405,"about_ca_system_score_gemma":0.000914927,"threshold_uncertainty_score":0.014834642},"labels":[],"label_agreement":null},{"id":"W1960819344","doi":"10.1007/978-3-540-76650-6_19","title":"Efficient Symbolic Execution of Large Quantifications in a Process Algebra","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Interpreter; Programmer; Process calculus; Programming language; Process (computing); Logarithm; Symbolic computation; Constant (computer programming); Theoretical computer science; Mathematics","score_opus":0.03466933902380891,"score_gpt":0.326966042265499,"score_spread":0.2922967032416901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960819344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023303807,0.000094130424,0.9680038,0.0001948825,0.000033473956,0.00007568037,0.00008175822,0.0037574244,0.0044548893],"genre_scores_gemma":[0.5304363,0.0001820005,0.46407145,0.00007938723,0.000036266694,0.00011194305,0.00017137392,0.00071770645,0.0041935914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809796,0.0006154937,0.00010009574,0.00025126894,0.0006908424,0.0002444625],"domain_scores_gemma":[0.99398994,0.0048014163,0.00018625509,0.0006790045,0.00023714198,0.00010627911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019056585,0.0008809957,0.0011202359,0.00061394856,0.0013281242,0.0020565866,0.0018540545,0.0009704104,0.006942388],"category_scores_gemma":[0.0071179504,0.00083610386,0.0011243969,0.0012067443,0.0031806054,0.003771995,0.002894709,0.0022845436,0.0009162491],"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.00048018282,0.00017647358,0.00071606826,0.0004021631,0.000068118425,0.00034793065,0.0007414172,0.22656633,0.019790577,0.5952081,0.0029060896,0.15259647],"study_design_scores_gemma":[0.00008065511,0.000059102087,0.00013366017,0.000036753987,0.00005416808,0.00006505553,0.000085217376,0.64757925,0.021530727,0.3261667,0.0041755484,0.00003330128],"about_ca_topic_score_codex":0.0035883475,"about_ca_topic_score_gemma":0.0058258916,"teacher_disagreement_score":0.006942388,"about_ca_system_score_codex":0.0013110696,"about_ca_system_score_gemma":0.0022788348,"threshold_uncertainty_score":0.023224592},"labels":[],"label_agreement":null},{"id":"W1960913922","doi":"10.1007/3-540-44886-1_41","title":"Feature Selection Strategies for Text Categorization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Feature selection; Categorization; Computer science; Selection (genetic algorithm); Text categorization; Feature (linguistics); Rank (graph theory); Artificial intelligence; Set (abstract data type); Filter (signal processing); Function (biology); Representation (politics); Machine learning; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.018434168115925784,"score_gpt":0.2540111248480112,"score_spread":0.2355769567320854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960913922","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.017527409,0.0026864556,0.97440183,0.00022945713,0.00016706309,0.00017751985,0.0004362455,0.0024179553,0.0019560603],"genre_scores_gemma":[0.19521554,0.001547232,0.7884749,0.00026226058,0.0003760878,0.0005928451,0.0031749306,0.00044738626,0.009908844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992136,0.00023375353,0.000094953335,0.00015528189,0.00022834125,0.00007403511],"domain_scores_gemma":[0.9982754,0.0010004691,0.000060252605,0.00020148336,0.0004116729,0.000050792198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016432365,0.0009862849,0.0013224342,0.0024677282,0.00074723247,0.0012813812,0.0016862216,0.00088317425,0.0044779778],"category_scores_gemma":[0.0034885905,0.0003949352,0.00090946275,0.0026328894,0.00038537872,0.0018218716,0.00087404164,0.0009872472,0.002495321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015878073,0.00011440387,0.00046536478,0.00011604755,0.000057729936,0.00007733833,0.00007926731,0.0054471293,0.0097666625,0.0030728637,0.009604596,0.9710397],"study_design_scores_gemma":[0.0002283097,0.00044397588,0.0044191317,0.00010577346,0.00028896442,0.000740144,0.00031578421,0.8501797,0.037157476,0.083215125,0.022817003,0.00008865974],"about_ca_topic_score_codex":0.0019722718,"about_ca_topic_score_gemma":0.002656563,"teacher_disagreement_score":0.0044779778,"about_ca_system_score_codex":0.00038340563,"about_ca_system_score_gemma":0.0006250866,"threshold_uncertainty_score":0.014980316},"labels":[],"label_agreement":null},{"id":"W1960936669","doi":"10.1007/978-3-642-14785-2_8","title":"Joint Scheduling and Spectrum Allocation in Wireless Networks with Frequency-Agile Radios","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"Concordia University","funders":"","keywords":"Computer science; Frequency allocation; Mathematical optimization; Scheduling (production processes); Simulated annealing; Wireless network; Wireless; Computation; Cognitive radio; Algorithm; Computer network; Telecommunications; Mathematics","score_opus":0.017308381414065235,"score_gpt":0.24229499108501565,"score_spread":0.2249866096709504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960936669","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.022257796,0.002698842,0.96524453,0.00017438109,0.00027287117,0.000024694316,0.000018153984,0.00020922237,0.009099559],"genre_scores_gemma":[0.75865525,0.0028836466,0.22110099,0.00011256272,0.00057653437,0.000101962585,0.000054458207,0.0001252433,0.01638939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.00010097256,0.000011315417,0.00004544736,0.00010374559,0.000046495217],"domain_scores_gemma":[0.99948454,0.00036060344,0.000031282056,0.000048443395,0.000049234615,0.000025816376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370689,0.0004620205,0.00049282174,0.0002576237,0.00031490866,0.00072768587,0.0006459176,0.00041986658,0.0014232046],"category_scores_gemma":[0.0013205801,0.00032986014,0.00021112086,0.0006087689,0.00046087382,0.0007441063,0.0005451023,0.00069127925,0.00032200062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033998524,0.00009279769,0.00036827417,0.00011724094,0.00005498558,0.00014492837,0.00010967523,0.5809985,0.029540312,0.093483336,0.0040029134,0.29074714],"study_design_scores_gemma":[0.000023958612,0.000068901674,0.0001852239,0.000010174149,0.000016116714,0.000100286525,0.000025379775,0.9494632,0.0033177605,0.042133685,0.0046427534,0.000012579978],"about_ca_topic_score_codex":0.00050398754,"about_ca_topic_score_gemma":0.00092969625,"teacher_disagreement_score":0.0014232046,"about_ca_system_score_codex":0.0003599327,"about_ca_system_score_gemma":0.0004289003,"threshold_uncertainty_score":0.0047611},"labels":[],"label_agreement":null},{"id":"W196093984","doi":"10.1007/978-3-319-10443-0_14","title":"Optimized PatchMatch for Near Real Time and Accurate Label Fusion","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":47,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Segmentation; Dice; Artificial intelligence; Computer science; Pattern recognition (psychology); Fusion; Sørensen–Dice coefficient; Computation; Image segmentation; Computer vision; Mathematics; Algorithm; Statistics","score_opus":0.014225481475771589,"score_gpt":0.2902908348874141,"score_spread":0.2760653534116425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196093984","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.020246083,0.00031640776,0.97301435,0.00013528018,0.00012765951,0.0000615589,0.00020782294,0.00477427,0.0011165098],"genre_scores_gemma":[0.16336495,0.00018552106,0.82886803,0.0001782373,0.000087277636,0.00008670975,0.00089224364,0.0007085117,0.0056284135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987852,0.00016578696,0.0000455252,0.0003670502,0.0004781146,0.0001583875],"domain_scores_gemma":[0.99891746,0.0002596971,0.00008002663,0.00038436052,0.00028794273,0.00007049823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011087296,0.0011665707,0.0015521471,0.0011008662,0.0007300583,0.0018414372,0.0023711133,0.0022621136,0.008382054],"category_scores_gemma":[0.0027033237,0.00081246835,0.0008138504,0.0013375476,0.00065565604,0.0020120535,0.00321716,0.0015274181,0.004925452],"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.00090018753,0.00023058023,0.0011508227,0.00012943742,0.00013017301,0.00017196756,0.00012766533,0.037760813,0.10771726,0.0041643702,0.010831108,0.8366856],"study_design_scores_gemma":[0.000039536695,0.0001217528,0.0010895774,0.000012627471,0.000040465788,0.00029909355,0.0000856825,0.9243317,0.06037045,0.008157936,0.0054171504,0.000034011457],"about_ca_topic_score_codex":0.0043052197,"about_ca_topic_score_gemma":0.008025353,"teacher_disagreement_score":0.008382054,"about_ca_system_score_codex":0.000672597,"about_ca_system_score_gemma":0.0014607573,"threshold_uncertainty_score":0.028040767},"labels":[],"label_agreement":null},{"id":"W196245569","doi":"10.1007/978-3-642-32973-9_17","title":"On Fulton’s Algorithm for Computing Intersection Multiplicities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Intersection (aeronautics); Constructive; Bivariate analysis; Point (geometry); Algorithm; Field (mathematics); Computer science; Plane (geometry); Discrete mathematics; Mathematics; Combinatorics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.01688801256639084,"score_gpt":0.24732127400229634,"score_spread":0.2304332614359055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196245569","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.025699964,0.00089763955,0.9166916,0.000906175,0.0005963185,0.00029937376,0.00039299694,0.00665104,0.047864925],"genre_scores_gemma":[0.16369678,0.0006189193,0.7750122,0.00069455104,0.00033395918,0.0004565863,0.0019047267,0.0017386504,0.055543683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978574,0.00028110246,0.00016484928,0.0005510696,0.00081652903,0.00032904852],"domain_scores_gemma":[0.9980715,0.000623252,0.000071270115,0.00068235985,0.00046013674,0.00009159883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821924,0.0021395762,0.0015885397,0.0041727186,0.0022275248,0.0042237206,0.0036478457,0.0020745934,0.032358855],"category_scores_gemma":[0.0057121026,0.0009399676,0.001748991,0.0057225116,0.0022083435,0.00937436,0.005497084,0.0026187745,0.011288505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053089426,0.00016036733,0.0011114153,0.00024552832,0.00006257441,0.00018131733,0.00041836847,0.00977785,0.008801869,0.15851526,0.025912762,0.7942819],"study_design_scores_gemma":[0.00026729508,0.0002544368,0.0016271126,0.0002162223,0.00016149822,0.0008415193,0.0005309917,0.15369081,0.029112192,0.70172685,0.111375906,0.00019505649],"about_ca_topic_score_codex":0.005802117,"about_ca_topic_score_gemma":0.007877545,"teacher_disagreement_score":0.032358855,"about_ca_system_score_codex":0.0022761563,"about_ca_system_score_gemma":0.0018811603,"threshold_uncertainty_score":0.108251154},"labels":[],"label_agreement":null},{"id":"W1962978359","doi":"10.1007/978-3-642-11805-0_30","title":"Drawing Planar 3-Trees with Given Face-Areas","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Planar graph; Outerplanar graph; Combinatorics; Vertex (graph theory); Planar; Planar straight-line graph; Computer science; Face (sociological concept); Graph; Book embedding; Graph drawing; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","score_opus":0.01253370707415435,"score_gpt":0.22935394521670596,"score_spread":0.2168202381425516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1962978359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043797303,0.000420762,0.914347,0.00030647425,0.00019926044,0.00023895547,0.0009954713,0.0036205547,0.03607412],"genre_scores_gemma":[0.20531109,0.00095475104,0.7734772,0.0001497948,0.00007396141,0.0001957415,0.0014800383,0.0013865855,0.016970802],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999744,0.00003050864,0.000017186645,0.000057943835,0.000112796915,0.000037605983],"domain_scores_gemma":[0.9996513,0.00013259223,0.000023917928,0.00007603611,0.00007598869,0.00004008503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023796153,0.0011284353,0.00091850024,0.0008843855,0.0004895194,0.0015413366,0.0013313568,0.0011417788,0.018038595],"category_scores_gemma":[0.0014392355,0.0009032363,0.00085925293,0.0011631642,0.00056131795,0.0017385919,0.0017772805,0.001955693,0.0036138596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038947508,0.00017071867,0.000888239,0.00096333295,0.00010869282,0.0004410409,0.00072992855,0.116586156,0.053427156,0.19277176,0.03348217,0.6000414],"study_design_scores_gemma":[0.00015819818,0.0002564418,0.0010175915,0.0002465396,0.00011547786,0.0010398139,0.00046576382,0.5411292,0.043066546,0.30643088,0.10598778,0.000085884305],"about_ca_topic_score_codex":0.0011889605,"about_ca_topic_score_gemma":0.0037642103,"teacher_disagreement_score":0.018038595,"about_ca_system_score_codex":0.0005490797,"about_ca_system_score_gemma":0.00035279713,"threshold_uncertainty_score":0.060345113},"labels":[],"label_agreement":null},{"id":"W196301943","doi":"10.1007/978-3-642-39310-5_16","title":"Syntactic Complexity of ${\\mathcal R}$ - and ${\\mathcal J}$ -Trivial Regular Languages","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Class (philosophy); Complexity class; Regular language; Discrete mathematics; Computer science; Combinatorics; Function (biology); Mathematics; Time complexity; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.019651194461230665,"score_gpt":0.24759844860240657,"score_spread":0.2279472541411759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196301943","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.7050405,0.0013441003,0.10869422,0.00698611,0.00026705628,0.00009198406,0.0013377791,0.0007670326,0.17547123],"genre_scores_gemma":[0.97307116,0.00041787868,0.011783124,0.00034706108,0.00026921366,0.00010007935,0.00100272,0.00035099863,0.01265766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751174,0.00054048223,0.0001783309,0.00042638104,0.0008464935,0.00049645425],"domain_scores_gemma":[0.9927331,0.0051602162,0.00049174787,0.000573249,0.0006726049,0.000368953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012346485,0.00048925466,0.00098545,0.001498986,0.00285437,0.006537388,0.0022154863,0.0015643485,0.01277942],"category_scores_gemma":[0.006583519,0.000941042,0.0018841425,0.0017136543,0.004738136,0.010916616,0.0028533102,0.004609887,0.0015006084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052787047,0.00002600405,0.00037688756,0.000050069317,0.000008899697,0.000069598274,0.00050108414,0.0010502043,0.0007459446,0.991751,0.0013582549,0.004009213],"study_design_scores_gemma":[0.0000129238015,0.000008499158,0.00041025135,0.000012913576,0.000013463809,0.00008362465,0.00015785565,0.004357497,0.00067797594,0.9926717,0.001569689,0.000023566774],"about_ca_topic_score_codex":0.0021419975,"about_ca_topic_score_gemma":0.0019547048,"teacher_disagreement_score":0.01277942,"about_ca_system_score_codex":0.0028096053,"about_ca_system_score_gemma":0.0015389902,"threshold_uncertainty_score":0.04275137},"labels":[],"label_agreement":null},{"id":"W196339419","doi":"10.1007/978-3-642-23974-8_57","title":"Examining Learners’ Emotional Responses to Virtual Pedagogical Agents’ Tutoring Strategies","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"McGill University","funders":"","keywords":"Embodied cognition; Affect (linguistics); Computer science; Human–computer interaction; Virtual agent; Multimedia; Cognitive science; Cognitive psychology; Psychology; Mathematics education; Artificial intelligence; Communication","score_opus":0.14970453718772764,"score_gpt":0.3154676988933558,"score_spread":0.16576316170562816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196339419","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.99846494,0.000031668973,0.00040672376,0.000014918418,0.000005315629,0.000009322273,0.000009813088,0.0000069032963,0.0010502838],"genre_scores_gemma":[0.998451,0.00004961226,0.0004015647,0.000015880443,0.0000030961473,0.000030338471,0.000023286506,0.00000431598,0.0010209763],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996389,0.0001704193,0.00002489178,0.000051479474,0.00006846705,0.000045747638],"domain_scores_gemma":[0.99751234,0.0017435113,0.00025256403,0.0000809522,0.00021944231,0.00019119302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072330254,0.00021648378,0.00020299257,0.00017635929,0.00017290658,0.000766662,0.00023458026,0.00032139977,0.0025157328],"category_scores_gemma":[0.0067238174,0.000105443236,0.00013101494,0.00011987122,0.0002405025,0.00036366563,0.00053487683,0.00047086706,0.00041425627],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004626504,0.0037525683,0.34339845,0.00065537356,0.00031795906,0.0009776611,0.096888706,0.0033495384,0.3078625,0.0010458138,0.0023915665,0.23473334],"study_design_scores_gemma":[0.00022388775,0.0073042465,0.8403691,0.00012923099,0.00041839847,0.0015517313,0.04518738,0.008741184,0.08714267,0.001274427,0.0075463355,0.00011142097],"about_ca_topic_score_codex":0.00022063561,"about_ca_topic_score_gemma":0.00023660007,"teacher_disagreement_score":0.0025157328,"about_ca_system_score_codex":0.00010779475,"about_ca_system_score_gemma":0.00009430709,"threshold_uncertainty_score":0.008415937},"labels":[],"label_agreement":null},{"id":"W1964693405","doi":"10.1007/11557432_42","title":"A Domain Model for Dynamic System Reconfiguration","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Carleton University","funders":"","keywords":"Control reconfiguration; Computer science; Key (lock); Domain (mathematical analysis); Domain model; Conceptual model; Formal description; Domain-specific language; Metamodeling; Software engineering; Programming language; Embedded system; Domain knowledge; Database; Computer security","score_opus":0.030200656980408767,"score_gpt":0.2779620840821349,"score_spread":0.24776142710172613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964693405","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.003990812,0.00021494606,0.9827247,0.00031197013,0.00005265415,0.000075497075,0.00045579215,0.0010010544,0.01117256],"genre_scores_gemma":[0.34956884,0.0012657039,0.6247941,0.00033464527,0.00010218131,0.0005536131,0.0019542873,0.0006093614,0.020817224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995851,0.00012112107,0.000039220984,0.00008284139,0.00011793578,0.00005376058],"domain_scores_gemma":[0.99950695,0.00021480765,0.000035736903,0.00011989986,0.000091299604,0.00003136078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254814,0.00082869997,0.0005790739,0.00071270065,0.0004626929,0.0019007382,0.0013986316,0.0011471753,0.007916139],"category_scores_gemma":[0.0017121384,0.0005490763,0.0010786996,0.00089925015,0.0007591271,0.0027696905,0.001205329,0.0018322904,0.0022349725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009627472,0.00007624802,0.0003537545,0.00021191282,0.000029752362,0.00035794152,0.0002557484,0.39841682,0.004331878,0.5317131,0.006023754,0.058132872],"study_design_scores_gemma":[0.000029850338,0.000024139445,0.00006668751,0.000036896046,0.000025189995,0.00011778844,0.00005115421,0.8255648,0.0013403427,0.14851373,0.024215784,0.000013559454],"about_ca_topic_score_codex":0.004052971,"about_ca_topic_score_gemma":0.0048051737,"teacher_disagreement_score":0.007916139,"about_ca_system_score_codex":0.00090329576,"about_ca_system_score_gemma":0.0010787736,"threshold_uncertainty_score":0.026482165},"labels":[],"label_agreement":null},{"id":"W1965163560","doi":"10.1007/11591191_31","title":"Model Checking Abstract State Machines with Answer Set Programming","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Answer set programming; Computer science; Abstract state machines; Model checking; Programming language; Set (abstract data type); State (computer science); Bounded function; Theoretical computer science; Logic programming; Logic program; Property (philosophy); Stable model semantics; Finite-state machine; Semantics (computer science); Mathematics","score_opus":0.03801049610129808,"score_gpt":0.29402019239511457,"score_spread":0.2560096962938165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965163560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010336935,0.00013709352,0.98302126,0.00018620548,0.00007875779,0.000069444664,0.00008949688,0.003180094,0.002900626],"genre_scores_gemma":[0.39003283,0.00027878446,0.6015845,0.00027379542,0.00013526165,0.00042401956,0.00075348985,0.0011006347,0.0054167546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99324256,0.002582911,0.00038719154,0.0008410648,0.0023980304,0.0005482083],"domain_scores_gemma":[0.9927921,0.0052152076,0.0003073469,0.0011377749,0.00046510837,0.00008236517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003385728,0.0016128992,0.0021010772,0.0016365609,0.0008362353,0.0030675684,0.0036782327,0.0022641628,0.0048531964],"category_scores_gemma":[0.011957644,0.0013532696,0.0029599594,0.0014476804,0.0031282145,0.00651124,0.0036954489,0.004654328,0.0012184702],"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.00060784124,0.00024753393,0.00075828243,0.000591124,0.00023767314,0.00025555718,0.00053509924,0.26203564,0.014724797,0.57691884,0.005438787,0.13764876],"study_design_scores_gemma":[0.00008435384,0.000076942284,0.00006891566,0.000046207984,0.00006821612,0.000051672178,0.000033644126,0.48062506,0.01284127,0.50301343,0.0030625002,0.000027763354],"about_ca_topic_score_codex":0.0011004511,"about_ca_topic_score_gemma":0.0013476805,"teacher_disagreement_score":0.0048531964,"about_ca_system_score_codex":0.0011199324,"about_ca_system_score_gemma":0.0010620954,"threshold_uncertainty_score":0.017905653},"labels":[],"label_agreement":null},{"id":"W1966288006","doi":"10.1007/978-3-540-87531-4_7","title":"Extensional Uniformity for Boolean Circuits","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Montréal; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Circuit complexity; Duality (order theory); Extensional definition; Order (exchange); Connection (principal bundle); Class (philosophy); Bounded function; Property (philosophy); Coupling (piping); Boolean circuit; Discrete mathematics; Combinatorics; Computer science; Electronic circuit; Complexity class; Boolean function; Topology (electrical circuits); Mathematics; Physics; Geometry; Time complexity; Mathematical analysis; Materials science; Quantum mechanics; Artificial intelligence; Composite material","score_opus":0.04206150276281763,"score_gpt":0.2832405391224276,"score_spread":0.24117903635960997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966288006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054397132,0.005450334,0.707181,0.0013685134,0.00054666377,0.00012322766,0.00044048243,0.000649808,0.22984287],"genre_scores_gemma":[0.8161385,0.0044309557,0.12205133,0.00080262026,0.0013522309,0.00048536976,0.00085248024,0.00053289393,0.053353585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871254,0.00035834502,0.00010700854,0.0003042772,0.00038341302,0.00013445668],"domain_scores_gemma":[0.9982998,0.0010499792,0.000062784726,0.00036259796,0.00017220422,0.000052605286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906727,0.0005807381,0.0009212392,0.0011602018,0.0010201625,0.0018709619,0.0010218506,0.0006506394,0.004965938],"category_scores_gemma":[0.0035441972,0.0006370015,0.0013553307,0.0015597875,0.0035495867,0.005625934,0.0020466626,0.0036896716,0.0008212552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018610168,0.000007905044,0.000059553273,0.000042311305,0.000006571399,0.000025599844,0.00011394371,0.0005578915,0.0005236367,0.98291045,0.00094712985,0.014786503],"study_design_scores_gemma":[0.000009886397,0.000010796831,0.000110404544,0.000014459803,0.000011109927,0.00006956424,0.00001583122,0.0014385681,0.00066804053,0.98953843,0.00810593,0.0000068811155],"about_ca_topic_score_codex":0.00043722833,"about_ca_topic_score_gemma":0.00042058446,"teacher_disagreement_score":0.004965938,"about_ca_system_score_codex":0.0013965108,"about_ca_system_score_gemma":0.00046463162,"threshold_uncertainty_score":0.016612709},"labels":[],"label_agreement":null},{"id":"W196669307","doi":"10.1007/978-3-642-33454-2_19","title":"A Hierarchical Scheme for Geodesic Anatomical Labeling of Airway Trees","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Chronic Obstructive Pulmonary Disease (COPD) Research","field":"Medicine","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"H. Lundbeck A/S; Lundbeckfonden; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Villum Fonden; Strategiske Forskningsråd; AstraZeneca","keywords":"Geodesic; Robustness (evolution); Computer science; Tree (set theory); Artificial intelligence; Pattern recognition (psychology); Airway; Computer vision; Mathematics; Medicine; Surgery; Combinatorics; Biology; Geometry","score_opus":0.022307453833012615,"score_gpt":0.3168078543845046,"score_spread":0.29450040055149196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196669307","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.002228468,0.00006680897,0.9959239,0.000033073913,0.000018638972,0.00008605317,0.00017851713,0.00071851764,0.00074597925],"genre_scores_gemma":[0.01862696,0.000105855775,0.97948426,0.000019735908,0.000012439186,0.00008222997,0.00045052916,0.00024353641,0.00097441615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872845,0.00022536778,0.00015230864,0.00025894714,0.0005028156,0.0001321516],"domain_scores_gemma":[0.99771273,0.00043931266,0.0001704727,0.00082629896,0.0006984483,0.00015283012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013564264,0.00074033876,0.0010884046,0.0029901923,0.0013131822,0.0023658662,0.0028290558,0.0019266439,0.007563037],"category_scores_gemma":[0.0044347756,0.0011536248,0.0012901298,0.0032674228,0.00081976294,0.0016137986,0.0032048405,0.0025766126,0.003297614],"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.00023699242,0.00011360887,0.0009905774,0.00043053555,0.000054677625,0.0001718695,0.0006342407,0.07197713,0.046500742,0.08310246,0.01144783,0.7843392],"study_design_scores_gemma":[0.00006233369,0.00020696162,0.0013146916,0.00013848813,0.0000668454,0.00046128602,0.00018575501,0.87890863,0.018568434,0.06691959,0.03306137,0.000105677726],"about_ca_topic_score_codex":0.0105313165,"about_ca_topic_score_gemma":0.01897276,"teacher_disagreement_score":0.0105313165,"about_ca_system_score_codex":0.0011671187,"about_ca_system_score_gemma":0.0023394446,"threshold_uncertainty_score":0.02530086},"labels":[],"label_agreement":null},{"id":"W196866328","doi":"10.1007/978-3-642-33944-8_3","title":"The Expansion Era of the Communicability: First Nations for the Local and Global Promotion of Cultural and Natural Heritage","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Archaeology and Cultural Heritage","field":"Social Sciences","cited_by":1,"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":"Promotion (chess); Cultural heritage; Context (archaeology); Natural (archaeology); Computer science; Quality (philosophy); Work (physics); Natural heritage; World Wide Web; Geography; Political science; Archaeology; Epistemology; Law; Engineering","score_opus":0.02566345605259601,"score_gpt":0.2965911872215963,"score_spread":0.27092773116900026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196866328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057284306,0.051644787,0.0030108707,0.026139822,0.0031634977,0.000037999926,0.00006387838,0.00008768239,0.91012305],"genre_scores_gemma":[0.25979328,0.076446414,0.010151382,0.013271224,0.002093495,0.00023203128,0.00018195357,0.00036174455,0.6374685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993285,0.00022849625,0.00001843867,0.000077691904,0.00020541858,0.00014151818],"domain_scores_gemma":[0.9995369,0.00018608205,0.000040100513,0.000045885794,0.000063513755,0.00012753265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010002733,0.0008280598,0.00032849092,0.0012264327,0.0043951254,0.009464657,0.00062183803,0.003358152,0.016642582],"category_scores_gemma":[0.0011377566,0.00024917076,0.00023914383,0.0026681316,0.006724008,0.010631008,0.0044057923,0.005835682,0.0020591402],"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.000015314074,0.000022905375,0.00015691064,0.00013174108,0.0000024141211,0.00012629715,0.005611842,0.000056472913,0.00025519586,0.89540344,0.051376767,0.04684066],"study_design_scores_gemma":[0.0000034771426,0.000012268559,0.0005125654,0.00046452897,0.0000032820517,0.0002312842,0.0032738943,0.00008448346,0.00019104662,0.05418071,0.94103163,0.0000109045595],"about_ca_topic_score_codex":0.008506849,"about_ca_topic_score_gemma":0.0180436,"teacher_disagreement_score":0.016642582,"about_ca_system_score_codex":0.004131423,"about_ca_system_score_gemma":0.0057285707,"threshold_uncertainty_score":0.05567497},"labels":[],"label_agreement":null},{"id":"W1969798922","doi":"10.1007/978-3-540-69903-3_35","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Spanner; Greedy algorithm; Computer science; Dimension (graph theory); Logarithm; Quadratic equation; Time complexity; Euclidean space; Upper and lower bounds; Metric (unit); Combinatorics; Algorithm; Mathematical optimization; Mathematics","score_opus":0.015365779787296101,"score_gpt":0.23340404781381055,"score_spread":0.21803826802651444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969798922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093315914,0.0013881,0.8601084,0.001904255,0.0005606257,0.00024388108,0.0017076512,0.0071202014,0.033650957],"genre_scores_gemma":[0.37165585,0.00057106203,0.60193527,0.00065832725,0.0002950837,0.00035332408,0.0036370347,0.001957275,0.018936759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982834,0.00036092944,0.000098638564,0.00048503332,0.00043881376,0.00033328953],"domain_scores_gemma":[0.9968399,0.0019525058,0.00012761402,0.0006337435,0.0002163587,0.00022982336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101833,0.0018524034,0.0023635735,0.0011718621,0.0010402373,0.003007757,0.0027466696,0.0019727047,0.029571345],"category_scores_gemma":[0.008080897,0.0008731959,0.001410112,0.0022918887,0.0016353483,0.0066185645,0.0031478535,0.002695156,0.0066286456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002380331,0.0005469225,0.0024785579,0.0009524226,0.00024290167,0.00025618784,0.000339352,0.3095192,0.011941216,0.14830764,0.06444227,0.458593],"study_design_scores_gemma":[0.00023121871,0.00017305164,0.0003640447,0.000042240263,0.000062091174,0.00014049317,0.00018728393,0.66891104,0.0027133,0.32228842,0.0048611704,0.000025680089],"about_ca_topic_score_codex":0.0027559914,"about_ca_topic_score_gemma":0.0070175882,"teacher_disagreement_score":0.029571345,"about_ca_system_score_codex":0.0015241374,"about_ca_system_score_gemma":0.002138597,"threshold_uncertainty_score":0.09892601},"labels":[],"label_agreement":null},{"id":"W197109976","doi":"10.1007/978-3-642-24574-9_28","title":"Unintended Consequences of Class-Based Ontological Commitment","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Memorial University of Newfoundland","funders":"","keywords":"Ontology; Computer science; Domain (mathematical analysis); Class (philosophy); Semantics (computer science); Quality (philosophy); Property (philosophy); Knowledge management; Data science; Information retrieval; Artificial intelligence; Epistemology; Programming language; Mathematics","score_opus":0.05036609004990111,"score_gpt":0.26961363013848455,"score_spread":0.21924754008858344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197109976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23958598,0.0006533123,0.45339936,0.019689195,0.0010645428,0.00016578172,0.0008602119,0.0010654477,0.2835162],"genre_scores_gemma":[0.9608982,0.00030672207,0.02221059,0.0013583018,0.00020976317,0.0001533048,0.00032234986,0.00030498742,0.014235778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916367,0.0028762543,0.0005737573,0.001203076,0.0026280638,0.0010820624],"domain_scores_gemma":[0.9713306,0.015777206,0.0012434404,0.008581387,0.002410923,0.0006564539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070528076,0.00045920632,0.0007867515,0.00096101046,0.002911925,0.004852142,0.0023826985,0.003655023,0.008715664],"category_scores_gemma":[0.038007867,0.000997189,0.0010202203,0.0012935972,0.00782799,0.011678493,0.007206065,0.008431228,0.0011458592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050272924,0.000029760764,0.00045763064,0.000025856081,0.000020336325,0.00025643923,0.0006072339,0.0019048988,0.00056984404,0.9887332,0.0018256968,0.005518853],"study_design_scores_gemma":[0.000010310219,0.0000035491644,0.00015965346,0.000011112086,0.000012279554,0.00006337859,0.0001512457,0.0042688665,0.0005305678,0.99310523,0.0016734661,0.0000103692155],"about_ca_topic_score_codex":0.0031937351,"about_ca_topic_score_gemma":0.0029642633,"teacher_disagreement_score":0.008715664,"about_ca_system_score_codex":0.0021008784,"about_ca_system_score_gemma":0.0018696444,"threshold_uncertainty_score":0.037299275},"labels":[],"label_agreement":null},{"id":"W1972160534","doi":"10.1007/3-540-39799-x_26","title":"An M3 Public-Key Encryption Scheme","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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 Manitoba","funders":"","keywords":"Computer science; Key (lock); Public-key cryptography; Encryption; Scheme (mathematics); Computer security; Computer network; Mathematics","score_opus":0.015816510688001204,"score_gpt":0.26450771388122,"score_spread":0.2486912031932188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972160534","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.21435104,0.0020668176,0.5779933,0.005117465,0.00071440084,0.0008147346,0.005910908,0.004909413,0.18812197],"genre_scores_gemma":[0.88881826,0.0004963946,0.07135538,0.0008926598,0.00007531124,0.00027324053,0.0017363713,0.0001815845,0.036170833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00010667002,0.000033536544,0.000064421576,0.00019000054,0.00016910525],"domain_scores_gemma":[0.99949145,0.00008677116,0.000063856016,0.00022840148,0.000083413994,0.00004613465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004939512,0.00043279628,0.00044156727,0.0003630764,0.0010040662,0.0011732196,0.00057401805,0.000913983,0.007460287],"category_scores_gemma":[0.00090880005,0.00017010047,0.0005389251,0.0009014257,0.00058902096,0.00128705,0.001499767,0.0010071588,0.00437204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002328577,0.00021794174,0.0011684927,0.00066638074,0.000071806666,0.0011574926,0.0004287132,0.0061559943,0.105962954,0.653672,0.04731475,0.1808549],"study_design_scores_gemma":[0.0005783801,0.0005745762,0.0026747724,0.00016924035,0.00011435124,0.003554984,0.00019652548,0.056256466,0.21161215,0.4246265,0.29948193,0.00016006004],"about_ca_topic_score_codex":0.0003951875,"about_ca_topic_score_gemma":0.00038842086,"teacher_disagreement_score":0.007460287,"about_ca_system_score_codex":0.0008711586,"about_ca_system_score_gemma":0.001034555,"threshold_uncertainty_score":0.02495718},"labels":[],"label_agreement":null},{"id":"W197261603","doi":"10.1007/978-3-642-40843-4_23","title":"Volume Visualization for Neurovascular Augmented Reality Surgery","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Visualization; Computer science; Neurovascular bundle; Volume rendering; Augmented reality; Computer vision; Rendering (computer graphics); Computer graphics (images); Data visualization; Context (archaeology); Artificial intelligence; Medicine; Surgery; Geology","score_opus":0.03035119389467701,"score_gpt":0.2872511140463489,"score_spread":0.2568999201516719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197261603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005321699,0.026337001,0.9293916,0.00074609474,0.0010369252,0.00004510891,0.000290617,0.0035140004,0.033316944],"genre_scores_gemma":[0.23451829,0.06407915,0.5960305,0.0006910398,0.002174081,0.00021398251,0.0013141675,0.003081755,0.09789709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963796,0.00007930957,0.000014366332,0.00003510213,0.00021170506,0.000021393262],"domain_scores_gemma":[0.9995975,0.00022406461,0.0000189773,0.00005589667,0.00008384637,0.000019746034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040674987,0.0010305532,0.000553945,0.0008793565,0.00020183671,0.0016496583,0.0012898983,0.00080201245,0.016676906],"category_scores_gemma":[0.0012727386,0.00052614097,0.00056242384,0.0009774812,0.00037404586,0.0012816199,0.0011351785,0.0013681354,0.0032078093],"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.0001317855,0.000031723135,0.00015698797,0.0008383526,0.00005303493,0.00027511548,0.0003082539,0.02822265,0.033941295,0.045500614,0.05241453,0.8381257],"study_design_scores_gemma":[0.000069300615,0.0002992013,0.0010978428,0.000853405,0.000125091,0.004866552,0.00020067109,0.26496533,0.050853286,0.110857755,0.5656266,0.00018498379],"about_ca_topic_score_codex":0.00046382446,"about_ca_topic_score_gemma":0.0006014956,"teacher_disagreement_score":0.016676906,"about_ca_system_score_codex":0.00026025614,"about_ca_system_score_gemma":0.0002596665,"threshold_uncertainty_score":0.05578977},"labels":[],"label_agreement":null},{"id":"W197365134","doi":"10.1007/978-3-642-31295-3_10","title":"Biologically Motivated Local Contextual Modulation Improves Low-Level Visual Feature Representations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"Artificial intelligence; Computation; Feature (linguistics); Computer science; Context (archaeology); Representation (politics); Pattern recognition (psychology); Modulation (music); Computer vision; Pixel; Human visual system model; Variety (cybernetics); Image (mathematics); Algorithm; Geography","score_opus":0.03076143432868427,"score_gpt":0.29002283883636326,"score_spread":0.259261404507679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197365134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43299586,0.0038891018,0.54217386,0.0006828929,0.00072885375,0.00009028446,0.0004938853,0.004213455,0.014731776],"genre_scores_gemma":[0.93975514,0.0007627752,0.055132702,0.00023883782,0.00016644874,0.000032946373,0.00028352416,0.00034181005,0.0032857917],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999167,0.000008983333,0.0000034578325,0.000034988443,0.00002022565,0.000015641263],"domain_scores_gemma":[0.9998006,0.0000793171,0.000025212295,0.00004934346,0.00002206229,0.000023361521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013149504,0.0005226207,0.000515774,0.00018178138,0.00012288368,0.00049593835,0.00048669826,0.00045859543,0.0042582205],"category_scores_gemma":[0.0010136033,0.00018593603,0.00031745734,0.00023191007,0.00019390894,0.00065800035,0.0005318662,0.00070933974,0.0006253497],"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.00029273698,0.00012527032,0.00027959596,0.00015553655,0.0000454225,0.0000667479,0.00002187241,0.009854608,0.8249487,0.0022140485,0.0017694974,0.16022597],"study_design_scores_gemma":[0.00013618289,0.00091592374,0.020088548,0.000052818923,0.00030157834,0.00055329246,0.000056918507,0.58801407,0.35466206,0.0258954,0.009263519,0.000059684557],"about_ca_topic_score_codex":0.0006432637,"about_ca_topic_score_gemma":0.0011292088,"teacher_disagreement_score":0.0042582205,"about_ca_system_score_codex":0.00026723786,"about_ca_system_score_gemma":0.0001780284,"threshold_uncertainty_score":0.0142451525},"labels":[],"label_agreement":null},{"id":"W197454497","doi":"10.1007/3-540-36209-6_43","title":"Software Engineering Process Benchmarking","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmarking; Benchmark (surveying); Process (computing); Software; Computer science; Engineering; Software engineering; Systems engineering; Manufacturing engineering; Engineering management; Business; Operating system","score_opus":0.014511437689936004,"score_gpt":0.237329131979644,"score_spread":0.222817694289708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197454497","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.08093667,0.003696093,0.6393285,0.0019675177,0.00080415845,0.00072692434,0.0013887062,0.010489385,0.26066205],"genre_scores_gemma":[0.66208076,0.002363544,0.24397324,0.00047754304,0.00018263502,0.000603386,0.0052321567,0.0027902739,0.08229645],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.984169,0.005342973,0.0009025438,0.001243702,0.007566443,0.0007752383],"domain_scores_gemma":[0.9835428,0.0038488102,0.0009148773,0.005034905,0.006232704,0.0004258122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008903667,0.0010370516,0.0010523505,0.003960957,0.0011897043,0.00468274,0.001794915,0.001307464,0.015119995],"category_scores_gemma":[0.02729619,0.00048381678,0.00065946346,0.005462245,0.00061675993,0.005422791,0.0027293116,0.0017948261,0.0053732763],"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.0002395656,0.0005584234,0.0025326011,0.00033570587,0.000039291266,0.000078830344,0.00039038985,0.019187313,0.0059937695,0.069415845,0.015465697,0.88576263],"study_design_scores_gemma":[0.0001355145,0.002289164,0.015822317,0.0015545107,0.00018277987,0.00091478054,0.0015215927,0.3023707,0.13697234,0.19634199,0.3416604,0.00023390146],"about_ca_topic_score_codex":0.0011734024,"about_ca_topic_score_gemma":0.0013346398,"teacher_disagreement_score":0.015119995,"about_ca_system_score_codex":0.0015919768,"about_ca_system_score_gemma":0.0028476976,"threshold_uncertainty_score":0.050581455},"labels":[],"label_agreement":null},{"id":"W1974929802","doi":"10.1007/978-3-642-11389-5","title":"Transactions on Computational Science VII","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.05801850605865168,"score_gpt":0.35115996266025246,"score_spread":0.2931414566016008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974929802","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039823293,0.050278828,0.20623448,0.023746816,0.045034323,0.00024798658,0.003414578,0.00199638,0.6650643],"genre_scores_gemma":[0.050518323,0.042092398,0.06146967,0.0026307763,0.0093968995,0.00045494438,0.0053768293,0.0015263244,0.82653385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859494,0.0002756554,0.00008708386,0.00021155075,0.00075180747,0.00007891959],"domain_scores_gemma":[0.99792105,0.00055952265,0.000048860715,0.0007842513,0.000562967,0.00012332882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377078,0.0011381633,0.0019070848,0.0014463376,0.0007385605,0.003946642,0.0013111633,0.0011433157,0.14062329],"category_scores_gemma":[0.005401538,0.00039185103,0.00081106985,0.003067659,0.0014112298,0.0023258873,0.0023288047,0.0028816673,0.07123564],"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.00006666764,0.00004470888,0.00031368207,0.00043764862,0.000057812467,0.000057285375,0.000059575377,0.0029255538,0.0009072832,0.15067272,0.49033523,0.3541219],"study_design_scores_gemma":[0.000022993094,0.000022398044,0.0003915407,0.00019120562,0.000034250657,0.00014537807,0.000058275615,0.008575548,0.0006995275,0.16005598,0.82979274,0.000010222554],"about_ca_topic_score_codex":0.0016130967,"about_ca_topic_score_gemma":0.0015316694,"teacher_disagreement_score":0.14062329,"about_ca_system_score_codex":0.0015782011,"about_ca_system_score_gemma":0.0019146667,"threshold_uncertainty_score":0.47043175},"labels":[],"label_agreement":null},{"id":"W197550184","doi":"10.1007/978-3-642-21538-4_35","title":"Diastolic Timed Vibrator: Applying Direct Vibration in Diastole to Patients with Acute Coronary Ischemia during the Pre-hospitalization Phase","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Phonocardiography and Auscultation Techniques","field":"Medicine","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":"Vibrator (electronic); Diastole; Cardiology; Medicine; Internal medicine; Ischemia; Materials science; Acoustics; Blood pressure; Physics","score_opus":0.006959749182957225,"score_gpt":0.23693296901071173,"score_spread":0.2299732198277545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197550184","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.6041238,0.06976881,0.18095843,0.0045804717,0.0059454637,0.0007243938,0.0016202016,0.002094888,0.1301836],"genre_scores_gemma":[0.7869035,0.03626576,0.10737514,0.00301327,0.0019334962,0.00042881208,0.0011766691,0.00030879327,0.06259456],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999448,0.0000118182315,0.0000050542217,0.000012531766,0.000018230605,0.000007604736],"domain_scores_gemma":[0.9999405,0.00003249202,0.000004230072,0.000002989153,0.0000057375287,0.000014064423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024188781,0.0003681391,0.0002447648,0.00027055523,0.00008539966,0.00024157621,0.00034923162,0.0003701125,0.0044755894],"category_scores_gemma":[0.00044497146,0.00008906054,0.00017285184,0.0001527845,0.00011723227,0.00017663918,0.0002961002,0.00041771278,0.00085798407],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008863795,0.00030760138,0.0036843985,0.00039180124,0.00002955693,0.001134847,0.00034277796,0.00019021532,0.043387912,0.00056254654,0.009064648,0.9400174],"study_design_scores_gemma":[0.0018797227,0.03284203,0.4870523,0.0020918369,0.00067008584,0.064693205,0.002527078,0.0071267104,0.11324558,0.007136368,0.2804125,0.00032264934],"about_ca_topic_score_codex":0.0002162818,"about_ca_topic_score_gemma":0.0008634552,"teacher_disagreement_score":0.0044755894,"about_ca_system_score_codex":0.000074647505,"about_ca_system_score_gemma":0.0001595213,"threshold_uncertainty_score":0.014972329},"labels":[],"label_agreement":null},{"id":"W1975747310","doi":"10.1007/978-3-642-31454-4_7","title":"A Framework for Modeling Trustworthiness of Users in Mobile Vehicular Ad-Hoc Networks and Its Validation through Simulated Traffic Flow","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Testbed; Unison; Representation (politics); Trustworthiness; Vehicular ad hoc network; Wireless ad hoc network; Human–computer interaction; Distributed computing; Computer security; Computer network","score_opus":0.02971910354746987,"score_gpt":0.30175856758226566,"score_spread":0.2720394640347958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975747310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024747327,0.00030557337,0.9721959,0.00023884342,0.00007468585,0.00010620325,0.00009779499,0.00022565546,0.002008029],"genre_scores_gemma":[0.8288437,0.00068701885,0.1664139,0.0001123982,0.00013053225,0.00038018584,0.00020381724,0.00010411981,0.003124368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820304,0.00079655234,0.00009796756,0.0002797765,0.00039548252,0.0002271051],"domain_scores_gemma":[0.99455357,0.0037788216,0.000407431,0.0003158168,0.0007994693,0.00014490027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137403,0.0013627354,0.0015387703,0.0015580368,0.0012759696,0.002051455,0.00418553,0.0031885945,0.0010916636],"category_scores_gemma":[0.011106632,0.00090206583,0.0015267238,0.0012212651,0.0025419076,0.0024003272,0.0021670032,0.0019334503,0.00026004037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009533103,0.000015469492,0.00019578474,0.000012588283,0.000012869464,0.00002597287,0.000039714414,0.9815213,0.00027618054,0.016193865,0.00011894905,0.0015777919],"study_design_scores_gemma":[0.000001806379,0.0000057580637,0.00001855552,0.000002384939,0.0000033118356,0.0000041688786,0.00000424197,0.99699163,0.000041791984,0.002855535,0.00006830248,0.0000024910348],"about_ca_topic_score_codex":0.023853991,"about_ca_topic_score_gemma":0.009994628,"teacher_disagreement_score":0.023853991,"about_ca_system_score_codex":0.0029362414,"about_ca_system_score_gemma":0.0027369277,"threshold_uncertainty_score":0.047430277},"labels":[],"label_agreement":null},{"id":"W1976140212","doi":"10.1007/978-3-642-00982-2_21","title":"Decision Problems for Convex Languages","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Regular polygon; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.013195413668358918,"score_gpt":0.2554913312474427,"score_spread":0.2422959175790838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976140212","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.06694774,0.004731145,0.73982453,0.00961021,0.0005759887,0.00034692386,0.0013165215,0.00047162658,0.1761752],"genre_scores_gemma":[0.6396174,0.0052105486,0.22082101,0.0017174651,0.0016216027,0.0012669453,0.0030745917,0.00058757165,0.12608296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976291,0.00093155087,0.00013643775,0.00047727206,0.0005289494,0.0002966546],"domain_scores_gemma":[0.9904689,0.007855926,0.00034267834,0.00041072152,0.00049908616,0.00042269006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029716457,0.0013031457,0.0019970292,0.0009994311,0.0016443463,0.0052683414,0.002103167,0.0019573038,0.019277722],"category_scores_gemma":[0.01175793,0.0011052212,0.0019139324,0.0020337899,0.003794942,0.0079844585,0.0026218137,0.007853258,0.0017785634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052369727,0.00005520005,0.00008519526,0.00011439495,0.000020507849,0.00003510911,0.00014286106,0.009396905,0.0002657972,0.9667553,0.0070089535,0.01606739],"study_design_scores_gemma":[0.000021011601,0.000011529184,0.000040617077,0.000020460628,0.0000070495716,0.000019565212,0.000040759875,0.02256564,0.00014921688,0.9745344,0.002582467,0.000007316301],"about_ca_topic_score_codex":0.0022943278,"about_ca_topic_score_gemma":0.0018337397,"teacher_disagreement_score":0.019277722,"about_ca_system_score_codex":0.0037039926,"about_ca_system_score_gemma":0.0019964562,"threshold_uncertainty_score":0.06449038},"labels":[],"label_agreement":null},{"id":"W197655159","doi":"10.1007/978-3-319-11740-9_49","title":"An Addition Strategy for Reduct Construction","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Reduct; Computer science; Class (philosophy); Data mining; Rough set; Algorithm; Artificial intelligence","score_opus":0.025262258679509084,"score_gpt":0.26060405879587095,"score_spread":0.23534180011636185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197655159","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.009837629,0.0007245945,0.9340951,0.00083634397,0.0006073523,0.00019195156,0.00029389924,0.0011624884,0.052250747],"genre_scores_gemma":[0.15030932,0.0013321046,0.8016205,0.0006143092,0.00045567748,0.0003703035,0.0009676416,0.0012862924,0.04304384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852496,0.00031191952,0.00014352397,0.000386605,0.00048735805,0.00014566602],"domain_scores_gemma":[0.99847883,0.00062061165,0.000036405618,0.00051406166,0.000277384,0.0000727151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014180696,0.0014078886,0.0015432326,0.0027317798,0.0021014991,0.0031047135,0.0022448536,0.0013833415,0.013608733],"category_scores_gemma":[0.0038779373,0.0010684446,0.0034576566,0.0030842624,0.0025173486,0.006257455,0.004362146,0.005205687,0.0048576295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006251145,0.000063457854,0.00011531382,0.0002676449,0.000041894386,0.00018075958,0.00046386407,0.0025392035,0.0034566466,0.8632581,0.009361252,0.1201893],"study_design_scores_gemma":[0.000017035074,0.000039231803,0.000105494386,0.00006909589,0.00009454147,0.00032045098,0.000134333,0.010264818,0.005245109,0.94934964,0.034324713,0.00003546506],"about_ca_topic_score_codex":0.0007828694,"about_ca_topic_score_gemma":0.0009646051,"teacher_disagreement_score":0.013608733,"about_ca_system_score_codex":0.0009603533,"about_ca_system_score_gemma":0.0008288804,"threshold_uncertainty_score":0.04552573},"labels":[],"label_agreement":null},{"id":"W1977051245","doi":"10.1007/978-3-642-04744-2_16","title":"A Statistically Fair Comparison of Ancestral Genome Reconstructions, Based on Breakpoint and Rearrangement Distances","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Breakpoint; Computer science; Algorithm; Genome; Biology; Genetics; Chromosome; Gene","score_opus":0.013677446150213548,"score_gpt":0.26061034126603,"score_spread":0.24693289511581645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977051245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35248965,0.0040613133,0.6281381,0.0013385416,0.00075952895,0.00020208763,0.0030550503,0.002850753,0.0071050776],"genre_scores_gemma":[0.63300854,0.0010176069,0.35443312,0.0003255862,0.00026995674,0.00026489416,0.0064929817,0.0013796085,0.0028076912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98544127,0.008317447,0.0007650161,0.002035643,0.0029006486,0.0005399604],"domain_scores_gemma":[0.86639494,0.10371965,0.0024281465,0.019606281,0.00608137,0.001769615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035877448,0.0011159839,0.002019679,0.0060476284,0.0020380577,0.005078533,0.0040043136,0.003297443,0.009312458],"category_scores_gemma":[0.15275738,0.0008429696,0.0018537545,0.0047507677,0.005683834,0.0066864286,0.0052741943,0.002521826,0.0013794906],"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.01242866,0.00043193754,0.057663746,0.001566032,0.0025799759,0.0010635166,0.0017169332,0.2839749,0.029816912,0.24974655,0.018864637,0.34014627],"study_design_scores_gemma":[0.00056788017,0.0009867558,0.02338882,0.00021666208,0.0005217905,0.0013671478,0.00085759285,0.51557064,0.018340047,0.42914647,0.008754816,0.00028138288],"about_ca_topic_score_codex":0.001301698,"about_ca_topic_score_gemma":0.0020639747,"teacher_disagreement_score":0.035877448,"about_ca_system_score_codex":0.0018105297,"about_ca_system_score_gemma":0.0017005355,"threshold_uncertainty_score":0.18974036},"labels":[],"label_agreement":null},{"id":"W1977752801","doi":"10.1007/978-3-642-35668-1_3","title":"Dealing with Undependable Workers in Decentralized Network Supercomputing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bounded function; Set (abstract data type); Binary logarithm; Supercomputer; Logarithm; Adversary; Parallel computing; Time complexity; Upper and lower bounds; Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.012401873487014934,"score_gpt":0.2237348427862167,"score_spread":0.21133296929920176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977752801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21501294,0.0030013148,0.74285465,0.0040543145,0.0007930304,0.00013988573,0.00011817884,0.0008834792,0.033142157],"genre_scores_gemma":[0.8819192,0.0012560139,0.093779825,0.00023447408,0.00048960675,0.00014545741,0.00013218255,0.0002093007,0.0218339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986224,0.00046821916,0.000053421205,0.0001767825,0.00041238588,0.00026674327],"domain_scores_gemma":[0.9965771,0.0017829512,0.00020115208,0.0009619722,0.0002647642,0.00021198436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022935802,0.00039083368,0.0008678056,0.00041198317,0.0021581878,0.0019711207,0.0023576678,0.001360538,0.003056885],"category_scores_gemma":[0.007040452,0.0005965246,0.0003588806,0.0011163891,0.0018891797,0.002949863,0.0030532265,0.0019789387,0.0004688297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062291435,0.00021668806,0.002886983,0.00039037192,0.00007272288,0.0008851434,0.0013041786,0.38075197,0.007965703,0.44615334,0.017722182,0.14102776],"study_design_scores_gemma":[0.000047880072,0.000044237335,0.0005190116,0.000030475056,0.000022725782,0.00017698412,0.00029042392,0.66633457,0.0035865132,0.31622314,0.012701411,0.000022572682],"about_ca_topic_score_codex":0.0012714305,"about_ca_topic_score_gemma":0.002000264,"teacher_disagreement_score":0.003056885,"about_ca_system_score_codex":0.00081680156,"about_ca_system_score_gemma":0.0011318517,"threshold_uncertainty_score":0.012129784},"labels":[],"label_agreement":null},{"id":"W198033559","doi":"10.1007/978-3-642-29011-4_29","title":"Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":442,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Homomorphic encryption; Secure multi-party computation; Theoretical computer science; Computation; Encryption; Plaintext; Universal composability; Public-key cryptography; Cryptography; Computer security; Algorithm; Cryptographic protocol","score_opus":0.015507205510936888,"score_gpt":0.25655463518230315,"score_spread":0.24104742967136625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198033559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049760938,0.0011309619,0.8525059,0.0023895472,0.00043616683,0.00015994532,0.0001861827,0.0006040282,0.09282634],"genre_scores_gemma":[0.8637528,0.0005740542,0.0896296,0.00065930374,0.00047823138,0.0003525897,0.0001453753,0.00023393738,0.04417424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972796,0.00087937276,0.00012891658,0.0004115822,0.0009061824,0.00039452795],"domain_scores_gemma":[0.99549687,0.002527989,0.00020227954,0.0012570241,0.00026469876,0.0002511551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018231319,0.0007303732,0.0014846999,0.0011886741,0.0017048257,0.003525264,0.0015778608,0.0028086717,0.0081416415],"category_scores_gemma":[0.0077227713,0.00057845004,0.0010541134,0.0010871876,0.004190826,0.005119113,0.005837381,0.005474397,0.0022397297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052239142,0.000022742615,0.00004936831,0.00004650971,0.000008803376,0.000039832506,0.000080485595,0.0029474234,0.002011078,0.98640126,0.0011081356,0.007232139],"study_design_scores_gemma":[0.000016869762,0.00002817991,0.000058646223,0.000018115694,0.000007906081,0.00009239581,0.0000147995925,0.04059201,0.001874236,0.9553019,0.0019787243,0.000016324062],"about_ca_topic_score_codex":0.00021307946,"about_ca_topic_score_gemma":0.00016584052,"teacher_disagreement_score":0.0081416415,"about_ca_system_score_codex":0.0014908769,"about_ca_system_score_gemma":0.000771021,"threshold_uncertainty_score":0.027236462},"labels":[],"label_agreement":null},{"id":"W1982107955","doi":"10.1007/978-3-642-10665-1_36","title":"CloudWF: A Computational Workflow System for Clouds Based on Hadoop","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workflow; Workflow management system; Workflow technology; Workflow engine; Scalability; Executable; Database; Cloud computing; Distributed computing; Windows Workflow Foundation; Block (permutation group theory); Operating system","score_opus":0.06857625932955096,"score_gpt":0.3305669634792053,"score_spread":0.2619907041496543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982107955","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.030907031,0.0008560977,0.80887115,0.00084274233,0.0007418,0.00064844877,0.004195879,0.14097072,0.011966133],"genre_scores_gemma":[0.24624974,0.0014382012,0.69640195,0.0006719523,0.0002390677,0.00038046823,0.018275747,0.013492425,0.02285047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993216,0.000058021687,0.00006722352,0.00013248417,0.00025298714,0.00016772152],"domain_scores_gemma":[0.9991609,0.00012029982,0.00003740362,0.00024805922,0.000179124,0.00025422263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014052846,0.0008180848,0.0008858286,0.0008745564,0.001451082,0.0027861944,0.0028938404,0.0007540639,0.0055251555],"category_scores_gemma":[0.0016719748,0.0008618367,0.0012063087,0.0017893882,0.000757565,0.0032720447,0.0021436377,0.0021974558,0.0020276478],"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.0026216586,0.0007992824,0.005661152,0.00091401004,0.00057946536,0.0009833509,0.0012207354,0.05061492,0.0773102,0.05940412,0.3099951,0.48989597],"study_design_scores_gemma":[0.0011143062,0.00043702763,0.007208083,0.00017232461,0.00035064152,0.0011850063,0.000454024,0.48850933,0.075516306,0.084199764,0.34023753,0.0006157123],"about_ca_topic_score_codex":0.02161871,"about_ca_topic_score_gemma":0.012031098,"teacher_disagreement_score":0.02161871,"about_ca_system_score_codex":0.00097099494,"about_ca_system_score_gemma":0.003987914,"threshold_uncertainty_score":0.042985797},"labels":[],"label_agreement":null},{"id":"W198383578","doi":"10.1007/978-3-642-39310-5_22","title":"Finite Nondeterminism vs. DFAs with Multiple Initial States","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Deterministic finite automaton; Automaton; Deterministic automaton; Upper and lower bounds; Computer science; Finite-state machine; Branching (polymer chemistry); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Automata theory","score_opus":0.012662829003552407,"score_gpt":0.2283965026510504,"score_spread":0.21573367364749801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198383578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1578382,0.005146004,0.6266427,0.0059176814,0.0009452681,0.00018377975,0.0012355398,0.0022048904,0.19988602],"genre_scores_gemma":[0.9092116,0.0013257099,0.06801264,0.00038619086,0.00022813755,0.00014938228,0.00052431045,0.0002949052,0.019867007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831855,0.00040038378,0.00017402065,0.00046067176,0.00037181453,0.00027464508],"domain_scores_gemma":[0.9917908,0.005225519,0.00026838988,0.0020134484,0.00046356415,0.00023824607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023467634,0.0005105355,0.00088007195,0.0008200231,0.0013525384,0.0036866285,0.0018727784,0.0017622607,0.00933459],"category_scores_gemma":[0.008653041,0.0005662736,0.0016856093,0.0010184369,0.0037212789,0.010168064,0.0021561175,0.0043503717,0.0013503111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014826478,0.00002816955,0.0002043815,0.000112012545,0.000012232825,0.0000682721,0.00013347794,0.0047900025,0.0014201582,0.9660471,0.0011437396,0.025892125],"study_design_scores_gemma":[0.000028166636,0.000032423526,0.00009298736,0.000053704214,0.000027611599,0.00012420096,0.000045142388,0.026626937,0.0030279187,0.9627705,0.0071531804,0.000017216737],"about_ca_topic_score_codex":0.0012931235,"about_ca_topic_score_gemma":0.0015501981,"teacher_disagreement_score":0.00933459,"about_ca_system_score_codex":0.0024850718,"about_ca_system_score_gemma":0.0013668734,"threshold_uncertainty_score":0.03122735},"labels":[],"label_agreement":null},{"id":"W198434069","doi":"10.1007/978-3-642-22935-0_26","title":"Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cover (algebra); Combinatorics; Bounded function; Tree (set theory); Mathematics; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Graph; Vertex cover; Algorithm","score_opus":0.033483422496557655,"score_gpt":0.2419623660101153,"score_spread":0.20847894351355767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198434069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03767296,0.0060204663,0.9298982,0.0018751103,0.0005426738,0.00027274512,0.0011473463,0.0026884573,0.01988203],"genre_scores_gemma":[0.20816164,0.0027214664,0.7698247,0.00062884035,0.00086608896,0.0005953161,0.003238399,0.0011151984,0.012848311],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964605,0.00088269915,0.00018004426,0.0006163232,0.0012747468,0.0005856645],"domain_scores_gemma":[0.99131536,0.005593882,0.00040048725,0.001673111,0.00066306774,0.0003540225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034960483,0.0025841307,0.003592179,0.0025165956,0.0014142212,0.0043467386,0.0071668047,0.0027828773,0.012762083],"category_scores_gemma":[0.015824167,0.0014407487,0.0028204126,0.0065734503,0.001426423,0.010115017,0.004006267,0.0067157843,0.0026706504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001759296,0.0007874398,0.0013883547,0.0009064275,0.00020079856,0.000110555135,0.00038757353,0.29073334,0.003700348,0.14546785,0.04689814,0.5076599],"study_design_scores_gemma":[0.00016289989,0.0000865305,0.00041279226,0.0000589748,0.000098449935,0.00013671782,0.00006657327,0.866586,0.0013856193,0.12491301,0.0060671614,0.000025183755],"about_ca_topic_score_codex":0.005308656,"about_ca_topic_score_gemma":0.0083544785,"teacher_disagreement_score":0.012762083,"about_ca_system_score_codex":0.0054910393,"about_ca_system_score_gemma":0.0028929613,"threshold_uncertainty_score":0.042693377},"labels":[],"label_agreement":null},{"id":"W19852337","doi":"10.1007/978-3-642-24855-9_5","title":"New Gene Subset Selection Approaches Based on Linear Separating Genes and Gene-Pairs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Windsor","funders":"","keywords":"Computer science; Gene selection; Selection (genetic algorithm); Gene; Computational biology; Genetics; Artificial intelligence; Biology; Gene expression","score_opus":0.03725056152781208,"score_gpt":0.25066663342163,"score_spread":0.2134160718938179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19852337","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.01880578,0.00093081716,0.97671366,0.00017113074,0.00013854045,0.00012111309,0.00033993853,0.0013791955,0.0013997474],"genre_scores_gemma":[0.11060023,0.0006962967,0.8754378,0.00034586294,0.0003200305,0.00043452188,0.002874434,0.0005028791,0.008787898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900323,0.0002341992,0.00007739732,0.00023698834,0.00039356845,0.000054601845],"domain_scores_gemma":[0.99864966,0.0007103783,0.000058965008,0.00020103174,0.00032589587,0.00005411862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016474137,0.0012651134,0.0019021056,0.0018815177,0.0006298021,0.001163484,0.0022310768,0.0006743688,0.0030510167],"category_scores_gemma":[0.0019076504,0.00048458154,0.0016721253,0.0024066565,0.00048173926,0.0010021003,0.0012386899,0.0011045818,0.0010925744],"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.0004385586,0.00030253487,0.0020888865,0.00020548183,0.000400919,0.0001532795,0.00012921,0.050494473,0.028500918,0.0050573773,0.009033264,0.90319514],"study_design_scores_gemma":[0.00010770286,0.0002418245,0.0024232138,0.00003127503,0.00032098437,0.0002876665,0.0000908977,0.9610166,0.013845469,0.013784343,0.007810512,0.00003957269],"about_ca_topic_score_codex":0.0019610063,"about_ca_topic_score_gemma":0.0042005023,"teacher_disagreement_score":0.0030510167,"about_ca_system_score_codex":0.00041543238,"about_ca_system_score_gemma":0.0006618652,"threshold_uncertainty_score":0.01020664},"labels":[],"label_agreement":null},{"id":"W1985364899","doi":"10.1007/11880240_18","title":"Semantic Variations Among UML StateMachines","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Unified Modeling Language; Operational semantics; Formal semantics (linguistics); Software","score_opus":0.012046240363190424,"score_gpt":0.25105087878341886,"score_spread":0.23900463842022843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985364899","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.02706055,0.00066210085,0.9477716,0.0005021161,0.00024349941,0.00011018115,0.0004823071,0.0044800066,0.01868755],"genre_scores_gemma":[0.48315513,0.0009836574,0.49850738,0.00030558713,0.00020606449,0.00024203553,0.0016542675,0.0031301896,0.011815677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551255,0.00148204,0.0004869352,0.000659969,0.0016127961,0.0002456889],"domain_scores_gemma":[0.9957016,0.002211382,0.00029684906,0.0011585957,0.0005447137,0.00008684215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030992932,0.0008558097,0.00066276564,0.002591063,0.0012310429,0.004045827,0.0016393516,0.0014870862,0.003716027],"category_scores_gemma":[0.008566054,0.0013977116,0.0013586929,0.0030458998,0.0024935424,0.008358944,0.0028295885,0.0025666605,0.0011036588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068118,0.000031334625,0.00042437192,0.00012994904,0.00002210418,0.00025669349,0.0015788643,0.0044611515,0.0045017973,0.89939976,0.002375287,0.08675061],"study_design_scores_gemma":[0.000020995425,0.00003956636,0.0004862477,0.00019496949,0.00010512911,0.0004648274,0.00030160756,0.046751264,0.016513946,0.8401945,0.09486789,0.000059076003],"about_ca_topic_score_codex":0.0014906838,"about_ca_topic_score_gemma":0.0021042798,"teacher_disagreement_score":0.004045827,"about_ca_system_score_codex":0.001678733,"about_ca_system_score_gemma":0.0009766606,"threshold_uncertainty_score":0.0163908},"labels":[],"label_agreement":null},{"id":"W198617518","doi":"10.1007/978-3-642-21619-0_66","title":"An Interface for Opportunistic Discovery of Information for Young People","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Interface (matter); Task (project management); Metric (unit); World Wide Web; Computer science; Exploratory search; Information retrieval; Search engine; Human–computer interaction; Engineering","score_opus":0.031637202752411636,"score_gpt":0.27991274377274783,"score_spread":0.2482755410203362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198617518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15055363,0.0019405226,0.5602519,0.0023263807,0.0008157032,0.0027024657,0.013098147,0.21756616,0.05074511],"genre_scores_gemma":[0.44080403,0.0011758349,0.44980285,0.002219928,0.00050459494,0.0034645083,0.013277221,0.0045575947,0.08419342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992574,0.00028791852,0.00007798924,0.000103669445,0.00020863304,0.00006438019],"domain_scores_gemma":[0.99347657,0.004528224,0.00022080578,0.0005607446,0.0005565512,0.0006571718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019336481,0.0009514467,0.0008947934,0.0018270124,0.0006851318,0.0018497646,0.0015193904,0.0022262607,0.034760486],"category_scores_gemma":[0.007837966,0.00038349684,0.0004149859,0.0010763269,0.00025024355,0.002651566,0.0032713497,0.00064809714,0.009329904],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057955272,0.0016914181,0.016929787,0.0014522676,0.00016989882,0.0023574498,0.005790232,0.0013977101,0.03595041,0.0113608325,0.22316785,0.69393665],"study_design_scores_gemma":[0.0024012506,0.0030892107,0.025384076,0.00080238254,0.0007935301,0.0048780576,0.004184959,0.15991923,0.052774724,0.0396568,0.70544696,0.0006689098],"about_ca_topic_score_codex":0.0010837425,"about_ca_topic_score_gemma":0.0015954488,"teacher_disagreement_score":0.034760486,"about_ca_system_score_codex":0.00034248194,"about_ca_system_score_gemma":0.0005285401,"threshold_uncertainty_score":0.11628538},"labels":[],"label_agreement":null},{"id":"W1987752844","doi":"10.1007/11864127_5","title":"Paths and Cycles in Breakpoint Graphs of Random Multichromosomal Genomes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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 Ottawa","funders":"","keywords":"Breakpoint; Combinatorics; Genome; Order (exchange); Random graph; Graph; Computer science; Discrete mathematics; Mathematics; Biology; Genetics; Gene; Chromosome","score_opus":0.006534572382703496,"score_gpt":0.21486821583470628,"score_spread":0.20833364345200278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987752844","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.79690737,0.0021795863,0.18357338,0.0010020734,0.00006617577,0.00014685057,0.0020448905,0.0006229793,0.013456682],"genre_scores_gemma":[0.90662336,0.0023589768,0.07556103,0.00020568329,0.0000791283,0.00023779694,0.0027932245,0.00039739403,0.01174344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968755,0.00006153711,0.000014125702,0.00012567945,0.000070418944,0.00004068115],"domain_scores_gemma":[0.99595416,0.00282133,0.00049760245,0.00028721453,0.00019606944,0.00024372163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033857845,0.00041741008,0.0005129349,0.002288329,0.0009948105,0.0013141292,0.0010768131,0.0010260859,0.004735423],"category_scores_gemma":[0.004862715,0.0007493754,0.0007070939,0.002384288,0.0010567144,0.002228779,0.0007776953,0.0010377582,0.00034379063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000583028,0.00012786368,0.012769906,0.0007646526,0.00018988854,0.00093107217,0.0018109591,0.2086022,0.017187536,0.6249088,0.012092349,0.1200318],"study_design_scores_gemma":[0.000038752936,0.000049731672,0.0047109905,0.000057475685,0.000058000154,0.0005710376,0.00031732177,0.12277598,0.0022980738,0.8632536,0.00583786,0.000031229563],"about_ca_topic_score_codex":0.002492985,"about_ca_topic_score_gemma":0.003452388,"teacher_disagreement_score":0.004735423,"about_ca_system_score_codex":0.0008568301,"about_ca_system_score_gemma":0.00045447057,"threshold_uncertainty_score":0.015841544},"labels":[],"label_agreement":null},{"id":"W1989636449","doi":"10.1007/978-3-642-33666-9_44","title":"Transition to Model-Driven Engineering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Model-driven architecture; Computer science; Domain (mathematical analysis); Relevance (law); Metamodeling; Process management; Software development; Knowledge management; Software; Software engineering; Political science; Engineering","score_opus":0.01404450023726394,"score_gpt":0.2226218320670154,"score_spread":0.20857733182975147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989636449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038474004,0.0014967312,0.9612432,0.0014769431,0.00046839158,0.00007291616,0.00010206124,0.00091004453,0.03038223],"genre_scores_gemma":[0.40903574,0.004854128,0.52593607,0.0018637107,0.0005255116,0.00046995495,0.00082678674,0.0017196428,0.05476847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876714,0.0004053879,0.00006720538,0.00024394986,0.00043343208,0.00008306199],"domain_scores_gemma":[0.998111,0.0009651974,0.000057752342,0.00056834455,0.00022887919,0.00006883277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014616442,0.0007043506,0.00070058793,0.000685905,0.0005045812,0.0023984953,0.0013858059,0.0010152217,0.009158127],"category_scores_gemma":[0.0059655774,0.00061252626,0.0014346001,0.00068235723,0.0018385934,0.0034204146,0.0031967468,0.004544375,0.0030857332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003622554,0.000057547633,0.00016370001,0.00017941213,0.000023605928,0.00007281769,0.00025773994,0.009013403,0.0011983821,0.9090181,0.006861683,0.07311738],"study_design_scores_gemma":[0.000014717787,0.000026336087,0.00006795837,0.00008332859,0.000013832768,0.00008160263,0.000040728482,0.04256243,0.0017759101,0.9094279,0.045892805,0.000012436693],"about_ca_topic_score_codex":0.00087400625,"about_ca_topic_score_gemma":0.00043020918,"teacher_disagreement_score":0.009158127,"about_ca_system_score_codex":0.0011388487,"about_ca_system_score_gemma":0.0008749098,"threshold_uncertainty_score":0.030637026},"labels":[],"label_agreement":null},{"id":"W198982133","doi":"10.1007/978-3-642-28472-4_18","title":"Verifying Resource Requirements for Ontology-Driven Rule-Based Agents","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Programming language; Semantic Web Rule Language; Ontology; Rewriting; Ontology language; Semantic Web; Web Ontology Language; RuleML; Rule-based system; Software engineering; Model checking; Inference engine; Inference; Artificial intelligence; XML; Web service; World Wide Web; Semantic Web Stack; Semantic analytics; Markup language","score_opus":0.06258688654848463,"score_gpt":0.2956569003980839,"score_spread":0.23307001384959927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198982133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15232213,0.00011591906,0.8348956,0.00043914176,0.00011451503,0.00086722174,0.0007519077,0.005791522,0.004701925],"genre_scores_gemma":[0.6094482,0.000086200744,0.38620436,0.0001901345,0.000029944731,0.00031220604,0.0014390666,0.00067982136,0.0016100942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98005646,0.0053182873,0.0023002569,0.0021213456,0.008725434,0.0014780967],"domain_scores_gemma":[0.9500528,0.0331177,0.002714794,0.007180404,0.006142407,0.0007919144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009958368,0.0009488672,0.0015130413,0.0012869138,0.0012666013,0.0041961703,0.004568709,0.0025230714,0.0030219147],"category_scores_gemma":[0.05331316,0.0015698307,0.0026442914,0.00087989337,0.0023564938,0.00492811,0.0034301302,0.0021048547,0.0009922453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022087242,0.0011451483,0.0118296435,0.0010611914,0.00059281685,0.0028415525,0.0017358817,0.66172093,0.07335905,0.091390766,0.00501515,0.14709911],"study_design_scores_gemma":[0.00013514986,0.00013813165,0.00051647075,0.000046284902,0.00010224458,0.0001732222,0.0002149323,0.9360587,0.030039446,0.030702285,0.001834394,0.000038713664],"about_ca_topic_score_codex":0.011437814,"about_ca_topic_score_gemma":0.01185388,"teacher_disagreement_score":0.011437814,"about_ca_system_score_codex":0.0017084408,"about_ca_system_score_gemma":0.0045636934,"threshold_uncertainty_score":0.05266553},"labels":[],"label_agreement":null},{"id":"W199161082","doi":"10.1007/978-3-642-33418-4_11","title":"3D Ultrasound-CT Registration in Orthopaedic Trauma Using GMM Registration with Optimized Particle Simulation-Based Data Reduction","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Pelvic and Acetabular Injuries","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Imaging phantom; Robustness (evolution); Artificial intelligence; Computer science; 3D ultrasound; Reduction (mathematics); Computer vision; Image registration; Point set registration; Mixture model; Point (geometry); Ultrasound; Mathematics; Radiology; Medicine; Image (mathematics)","score_opus":0.04670652191205026,"score_gpt":0.3217434683369713,"score_spread":0.27503694642492105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199161082","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.010815844,0.00010392383,0.9870948,0.000089758214,0.000034768847,0.00006874568,0.0000732245,0.0013967206,0.00032224742],"genre_scores_gemma":[0.115118526,0.00015906942,0.8822557,0.0000705022,0.000035435995,0.00017799341,0.0003842682,0.0007184311,0.0010800269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989318,0.00029833685,0.000100226,0.00016769304,0.00039862073,0.0001033463],"domain_scores_gemma":[0.9990024,0.00045779612,0.00008400808,0.00016254655,0.0002485249,0.00004479632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018341786,0.0009512958,0.0017286408,0.0019603802,0.00084653986,0.0015253955,0.0015935518,0.0013192301,0.0024038453],"category_scores_gemma":[0.0034975007,0.0012707477,0.002384153,0.0022606011,0.00054217747,0.0009821628,0.0024701874,0.0013345311,0.0012151015],"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.0007898337,0.00030639218,0.004312753,0.00028671662,0.0004054133,0.00020891191,0.00046041407,0.3895912,0.0462836,0.0067341225,0.0037536838,0.54686695],"study_design_scores_gemma":[0.000023577772,0.000047615238,0.0016204342,0.000008549326,0.000059614827,0.00012094191,0.00003531849,0.98301286,0.011886676,0.0014358202,0.0017124069,0.000036187685],"about_ca_topic_score_codex":0.013191651,"about_ca_topic_score_gemma":0.014469534,"teacher_disagreement_score":0.013191651,"about_ca_system_score_codex":0.0008619028,"about_ca_system_score_gemma":0.0030951016,"threshold_uncertainty_score":0.02622974},"labels":[],"label_agreement":null},{"id":"W1991650290","doi":"10.1007/978-3-642-38171-3_19","title":"Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wind Energy Research and Development","field":"Engineering","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 Toronto","funders":"","keywords":"Mathematical optimization; Computer science; Nonlinear programming; Wind power; Integer programming; Constraint programming; Stochastic programming; Constraint (computer-aided design); Aerodynamics; Nonlinear system; Linear programming; Integer (computer science); Algorithm; Mathematics; Engineering","score_opus":0.010148551239565486,"score_gpt":0.20587502809055222,"score_spread":0.19572647685098674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991650290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008260329,0.0007494848,0.975817,0.00030321052,0.000121574936,0.00009500339,0.00022648362,0.0002813647,0.014145492],"genre_scores_gemma":[0.1603428,0.0008955567,0.82486165,0.00020847464,0.0001524497,0.0005495478,0.0004895073,0.0004019247,0.01209805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939203,0.00028212715,0.00002625916,0.00009516793,0.00014383283,0.000060678412],"domain_scores_gemma":[0.9985447,0.0011814365,0.0000822142,0.0000465244,0.00011262454,0.000032541335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054251,0.0018734836,0.0015696969,0.0006642577,0.00048569788,0.001816209,0.0017145134,0.0019184657,0.0072759707],"category_scores_gemma":[0.003334618,0.001951748,0.0014650619,0.0016423943,0.0005316693,0.0014791102,0.0011111912,0.0021248923,0.00086866814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026722591,0.00003808917,0.000113055496,0.00013954155,0.000032822896,0.00004376342,0.000016448152,0.9685407,0.00045318494,0.006190185,0.0017552503,0.02265007],"study_design_scores_gemma":[0.000010760743,0.000016202914,0.00003399499,0.0000136719145,0.00000617113,0.000011192678,0.000009340558,0.99494296,0.00019155924,0.0039620125,0.0007981814,0.00000384024],"about_ca_topic_score_codex":0.0054340228,"about_ca_topic_score_gemma":0.007713587,"teacher_disagreement_score":0.0072759707,"about_ca_system_score_codex":0.0006989441,"about_ca_system_score_gemma":0.0013036293,"threshold_uncertainty_score":0.02434057},"labels":[],"label_agreement":null},{"id":"W1994065834","doi":"10.1007/978-3-540-73951-7_27","title":"On a Family of Strong Geometric Spanners That Admit Local Routing Strategies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Lambda; Combinatorics; Graph; Degree (music); Unit disk graph; Mathematics; Discrete mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.03851076679963982,"score_gpt":0.27603752910532187,"score_spread":0.23752676230568204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994065834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33612183,0.0013793831,0.53861153,0.0007922117,0.00019305678,0.000120712226,0.00037812348,0.00057849917,0.121824704],"genre_scores_gemma":[0.8426364,0.0018820979,0.10117981,0.0005937233,0.0002532142,0.00027102002,0.0006703327,0.00033601592,0.052177407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.00007836124,0.000018915229,0.00010656253,0.00010682943,0.00008155082],"domain_scores_gemma":[0.99865615,0.0006736879,0.00018539134,0.00015365673,0.00013384742,0.00019732077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005522633,0.0011398628,0.00096673396,0.0011649278,0.0013235512,0.0018480152,0.0012769081,0.0012388794,0.0073140874],"category_scores_gemma":[0.0026669162,0.0005952127,0.0008347748,0.0015782762,0.0016237485,0.0028744913,0.00243298,0.002053635,0.001126171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004947852,0.000031971213,0.00026873683,0.00006065479,0.000016371741,0.00011477318,0.00016243833,0.010144929,0.0023130511,0.97056246,0.002069733,0.014205452],"study_design_scores_gemma":[0.000021373578,0.000060426275,0.0002225004,0.000029116034,0.00001690212,0.00026081243,0.00009401703,0.033204168,0.00072950305,0.9613697,0.0039771576,0.000014313214],"about_ca_topic_score_codex":0.0004207669,"about_ca_topic_score_gemma":0.0005420036,"teacher_disagreement_score":0.0073140874,"about_ca_system_score_codex":0.00058668345,"about_ca_system_score_gemma":0.0004160877,"threshold_uncertainty_score":0.024468064},"labels":[],"label_agreement":null},{"id":"W1994975735","doi":"10.1007/978-3-642-27216-5_6","title":"Modelling Culture in Multi-agent Organizations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Perspective (graphical); Curse of dimensionality; Knowledge management; Point (geometry); Transformation (genetics); Complex system; Artificial intelligence; Management science","score_opus":0.039740583902699654,"score_gpt":0.25805794509673646,"score_spread":0.2183173611940368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994975735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13371003,0.0032418747,0.72389674,0.005058435,0.00037539005,0.00020323996,0.00017654694,0.00016081774,0.13317695],"genre_scores_gemma":[0.88554645,0.0019281104,0.09638334,0.0002025845,0.000118540105,0.0003576281,0.00014120442,0.000058525453,0.015263587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908805,0.0006230041,0.000039046416,0.000076227414,0.00007860769,0.00009504032],"domain_scores_gemma":[0.9971732,0.0020485555,0.00022670966,0.00018980275,0.00016235527,0.00019937726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157022,0.0005851625,0.0005396306,0.0007003396,0.0011202503,0.0029888179,0.001968019,0.0018945625,0.004945566],"category_scores_gemma":[0.0057819155,0.00055444,0.0008700871,0.0012370723,0.0029323017,0.004632589,0.0023968676,0.0020218464,0.00051316957],"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.000018901084,0.00005772424,0.00059619313,0.00007537913,0.000022580767,0.00016230361,0.0012698062,0.13648099,0.00031838386,0.85310507,0.000689966,0.0072026365],"study_design_scores_gemma":[0.000021903626,0.000022884336,0.00019655483,0.000045300574,0.000014398228,0.000044073367,0.0007464124,0.2650994,0.00017325616,0.7277471,0.005870448,0.00001825957],"about_ca_topic_score_codex":0.007219426,"about_ca_topic_score_gemma":0.0055330866,"teacher_disagreement_score":0.007219426,"about_ca_system_score_codex":0.0018487728,"about_ca_system_score_gemma":0.001329413,"threshold_uncertainty_score":0.01654458},"labels":[],"label_agreement":null},{"id":"W1996060760","doi":"10.1007/11557432_16","title":"A Modelling and Simulation Based Approach to Dependable System Design","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dependability; DEVS; Computer science; Formalism (music); Fault tolerance; Reliability engineering; Modularity (biology); Distributed computing; Software fault tolerance; Modeling and simulation; Software engineering; Simulation; Engineering","score_opus":0.03826800514568109,"score_gpt":0.24333912242165512,"score_spread":0.20507111727597402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996060760","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.00082721683,0.00018967026,0.9949824,0.00010893561,0.000040151524,0.000042710883,0.000024960316,0.00035589503,0.0034281365],"genre_scores_gemma":[0.13123421,0.0015339482,0.85269076,0.0002203034,0.000105802756,0.0005346015,0.00024965833,0.00039437923,0.013036403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908173,0.00024846807,0.00006315892,0.000083724815,0.0004775715,0.000045365377],"domain_scores_gemma":[0.99900585,0.00054663006,0.000061063554,0.00019618914,0.00015589588,0.000034307755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010239835,0.0014702849,0.0012299101,0.000810168,0.0005594179,0.0017052322,0.0028243635,0.0014880805,0.005938659],"category_scores_gemma":[0.002263007,0.0013408784,0.0019084903,0.0008195114,0.0013577194,0.0017390555,0.001363095,0.0025257599,0.0012995605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044063814,0.000079079444,0.00012945839,0.00023618534,0.00008691691,0.00012938853,0.00014473592,0.7561952,0.005634819,0.18112597,0.0019572661,0.054236937],"study_design_scores_gemma":[0.000015600057,0.000036041438,0.000045849716,0.00003101415,0.000036686106,0.000056711844,0.0000108961,0.90406376,0.0024017396,0.08107729,0.01221164,0.000012747948],"about_ca_topic_score_codex":0.0031560264,"about_ca_topic_score_gemma":0.0035687315,"teacher_disagreement_score":0.005938659,"about_ca_system_score_codex":0.001136569,"about_ca_system_score_gemma":0.0011117058,"threshold_uncertainty_score":0.019866765},"labels":[],"label_agreement":null},{"id":"W199823152","doi":"10.1007/978-3-642-33140-4_12","title":"Improving Image Acquisition: A Fish-Inspired Solution","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Cichlid; Rendering (computer graphics); Fish <Actinopterygii>; Biology","score_opus":0.013941694772282714,"score_gpt":0.25365691402026896,"score_spread":0.23971521924798625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199823152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007912972,0.00032836164,0.985352,0.00021840687,0.00006284972,0.00003891294,0.00004342953,0.0010673654,0.004975684],"genre_scores_gemma":[0.105199106,0.00051361375,0.88554674,0.00024758696,0.000056867604,0.00005532795,0.00012208044,0.00032899695,0.007929791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971443,0.000030784162,0.0000091489455,0.00008487054,0.00011639258,0.000044251552],"domain_scores_gemma":[0.999666,0.00007707532,0.000028058264,0.000098967146,0.000107156164,0.000022804443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046806026,0.00096222584,0.0009161029,0.0006222827,0.0004698654,0.00083615206,0.0018915038,0.0015977427,0.006610804],"category_scores_gemma":[0.001045008,0.00057083915,0.0007542162,0.0007286314,0.00074277713,0.0015372356,0.0018164815,0.0013115099,0.0017572389],"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.00028513177,0.00012251288,0.0010442644,0.00042279463,0.00018698863,0.0001731154,0.00020495946,0.081039816,0.24428143,0.034785256,0.009294481,0.6281592],"study_design_scores_gemma":[0.00006438085,0.00018264452,0.0008068236,0.000050470688,0.00011640157,0.0005693651,0.00008348378,0.8601894,0.085511915,0.029808514,0.022571487,0.00004509199],"about_ca_topic_score_codex":0.0026653619,"about_ca_topic_score_gemma":0.003519537,"teacher_disagreement_score":0.006610804,"about_ca_system_score_codex":0.00050861033,"about_ca_system_score_gemma":0.00065751956,"threshold_uncertainty_score":0.02211535},"labels":[],"label_agreement":null},{"id":"W199912135","doi":"10.1007/978-3-319-06880-0_10","title":"The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Generalization; Mathematical proof; Probabilistic logic; Probabilistic automaton; Automaton; Computer science; Simple (philosophy); State space; Computation; Theoretical computer science; Discrete mathematics; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.06364226179145153,"score_gpt":0.30335162303579205,"score_spread":0.2397093612443405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199912135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3235584,0.0012352162,0.63032967,0.006866103,0.00037167,0.0002882679,0.0011109873,0.0011261632,0.03511356],"genre_scores_gemma":[0.8499678,0.00074604945,0.13706486,0.00039378638,0.00053384906,0.00036127292,0.0010421438,0.00053811335,0.009352097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99040633,0.0025662882,0.00065081485,0.0018022709,0.0036465996,0.00092778885],"domain_scores_gemma":[0.95974773,0.032975446,0.001108918,0.0039422647,0.0013218037,0.00090390025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034778076,0.0010901567,0.0021984775,0.0014254269,0.0022486814,0.007990882,0.003913916,0.0027986357,0.011041841],"category_scores_gemma":[0.02973327,0.0013725929,0.0035665415,0.0029800253,0.0048340117,0.021708393,0.0061408444,0.006143141,0.0010475162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007685673,0.00021239147,0.0020156926,0.00050262414,0.00016138778,0.00019202523,0.0006757097,0.12269335,0.0052165724,0.8012732,0.0045855693,0.061702814],"study_design_scores_gemma":[0.000045023877,0.000039729603,0.00035273752,0.000025151285,0.00004395469,0.00007398947,0.000080406855,0.18859346,0.0017596303,0.8078295,0.0011230328,0.00003333736],"about_ca_topic_score_codex":0.0031271218,"about_ca_topic_score_gemma":0.003677417,"teacher_disagreement_score":0.011041841,"about_ca_system_score_codex":0.0057596075,"about_ca_system_score_gemma":0.0037476204,"threshold_uncertainty_score":0.041789114},"labels":[],"label_agreement":null},{"id":"W2001684807","doi":"10.1007/978-3-540-27868-9_30","title":"Understanding Human-Computer Interactions in Map Revision","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parsing; XML; Hidden Markov model; Representation (politics); Sequence (biology); Action (physics); Artificial intelligence; Human–computer interaction; Information retrieval; Natural language processing; World Wide Web","score_opus":0.09040075668457893,"score_gpt":0.3304532366347978,"score_spread":0.2400524799502189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001684807","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.5270949,0.0012959349,0.39006057,0.003233909,0.000119040065,0.0001698613,0.00048118236,0.001521172,0.07602354],"genre_scores_gemma":[0.9660948,0.00017565112,0.0295069,0.00005480331,0.000017602415,0.000028559198,0.00023226537,0.00011967188,0.0037697714],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9988348,0.0006464549,0.000047973994,0.00017090711,0.00020429304,0.000095501804],"domain_scores_gemma":[0.9885684,0.009197139,0.00064077706,0.0006299932,0.0007636088,0.0002000987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016109501,0.00036598893,0.00021577385,0.00070909713,0.0007277941,0.0034763848,0.00097187655,0.0012114513,0.008030323],"category_scores_gemma":[0.022567745,0.00036050635,0.0003426508,0.0007989712,0.0012647171,0.008025337,0.0011889809,0.0010104419,0.0006745543],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062573265,0.0005000903,0.09043551,0.00055810605,0.00016827558,0.0021776364,0.037242047,0.09818831,0.01451096,0.33033934,0.020375917,0.40487802],"study_design_scores_gemma":[0.000041097876,0.00014055156,0.03281737,0.00011985575,0.00008998054,0.0007811426,0.016956061,0.5923301,0.0074737454,0.31538564,0.033777576,0.000086887114],"about_ca_topic_score_codex":0.01255084,"about_ca_topic_score_gemma":0.012031121,"teacher_disagreement_score":0.01255084,"about_ca_system_score_codex":0.00086138723,"about_ca_system_score_gemma":0.00093294133,"threshold_uncertainty_score":0.026864111},"labels":[],"label_agreement":null},{"id":"W2003554962","doi":"10.1007/978-3-642-31454-4_11","title":"Exploring Gaze Data for Determining User Learning with an Interactive Simulation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Gaze; Java applet; Human–computer interaction; Eye tracking; Constraint (computer-aided design); Multimedia; Artificial intelligence; Machine learning; Java; Programming language","score_opus":0.12380876276647533,"score_gpt":0.3333037402556657,"score_spread":0.20949497748919038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003554962","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.82178783,0.0005156192,0.16200992,0.00016571146,0.000038725542,0.00019891693,0.002484275,0.002905872,0.009893173],"genre_scores_gemma":[0.96510404,0.00017361551,0.032543804,0.000020319603,0.000009124562,0.0000890791,0.0007890071,0.00014253656,0.0011285709],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995876,0.00014213411,0.000018297758,0.000072850984,0.00013769872,0.000041288822],"domain_scores_gemma":[0.99748033,0.001803968,0.00009271885,0.00019262244,0.00033586004,0.00009438855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046129705,0.00045259923,0.00043718418,0.0020772715,0.00046125555,0.000717738,0.0004297233,0.00063527114,0.005491832],"category_scores_gemma":[0.0044180932,0.00026692593,0.00044576245,0.00093694014,0.00021143856,0.0009686461,0.00090291584,0.00048819117,0.0009914251],"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.0030340478,0.00073887064,0.1305148,0.0012953548,0.00038478698,0.0005307344,0.007522938,0.03916807,0.33545947,0.0031893211,0.008218977,0.46994272],"study_design_scores_gemma":[0.00010529852,0.001604559,0.2982582,0.00030248027,0.00036355594,0.0011290425,0.0038757802,0.5705328,0.10744354,0.00474411,0.01138074,0.0002599434],"about_ca_topic_score_codex":0.006186191,"about_ca_topic_score_gemma":0.009346552,"teacher_disagreement_score":0.006186191,"about_ca_system_score_codex":0.00036140153,"about_ca_system_score_gemma":0.00035488064,"threshold_uncertainty_score":0.018372},"labels":[],"label_agreement":null},{"id":"W200414342","doi":"10.1007/978-3-642-24571-8_2","title":"A Pattern-Based Model for Generating Text to Express Emotion","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Sentence; Representation (politics); Natural language processing; Artificial intelligence; Class (philosophy)","score_opus":0.04712581315086143,"score_gpt":0.25549651621048153,"score_spread":0.2083707030596201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W200414342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010986312,0.00013311945,0.98104596,0.00036818825,0.00010929868,0.00027978863,0.0013595464,0.0033836025,0.0023342283],"genre_scores_gemma":[0.2582725,0.00033005793,0.72537905,0.00025540788,0.00011354017,0.0010558142,0.0035131036,0.00056024455,0.010520376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929225,0.000180128,0.00006596004,0.0002472333,0.00017179314,0.000042529125],"domain_scores_gemma":[0.99832815,0.0009119519,0.00009561645,0.00016769099,0.0004404044,0.000056158195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009872302,0.0007281139,0.000479795,0.0010835242,0.00039549617,0.0012628129,0.0014405504,0.0010684661,0.0058473293],"category_scores_gemma":[0.004564523,0.00037261247,0.0010078959,0.00095515704,0.0003844046,0.002099861,0.0006053656,0.0009927687,0.0030226286],"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.0010869431,0.00041465374,0.006206022,0.00071291864,0.00021698793,0.000826814,0.001302905,0.077818766,0.058386322,0.04927116,0.03486234,0.7688942],"study_design_scores_gemma":[0.000053036198,0.0001271211,0.0011243221,0.000035498455,0.00009321627,0.0002863208,0.00009765405,0.94688934,0.011656953,0.029710528,0.009894577,0.00003139673],"about_ca_topic_score_codex":0.003753086,"about_ca_topic_score_gemma":0.0042014,"teacher_disagreement_score":0.0058473293,"about_ca_system_score_codex":0.00064887304,"about_ca_system_score_gemma":0.00065638975,"threshold_uncertainty_score":0.01956129},"labels":[],"label_agreement":null},{"id":"W2005044873","doi":"10.1007/978-3-540-73545-8_7","title":"A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Western University","funders":"","keywords":"Merge (version control); Phylogenetic tree; Set (abstract data type); Algorithm; Computer science; Tree (set theory); Simple (philosophy); Inference; Artificial intelligence; Mathematics; Pattern recognition (psychology); Combinatorics; Biology","score_opus":0.033580736406852336,"score_gpt":0.2852742579581239,"score_spread":0.25169352155127156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005044873","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.0013244603,0.00028630532,0.9963934,0.000039141785,0.00011404883,0.000033061555,0.00011033959,0.0012732771,0.0004259162],"genre_scores_gemma":[0.014373735,0.00037287606,0.9814571,0.00009410456,0.00010378695,0.00012114845,0.0009251727,0.001357373,0.0011946824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756527,0.00077594665,0.00018872415,0.0007234074,0.0006267744,0.00011990352],"domain_scores_gemma":[0.99569416,0.0022747724,0.00018830963,0.0009182491,0.0007029303,0.00022156916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003052775,0.0014628209,0.0023223383,0.0032589517,0.001910987,0.002492052,0.0037783578,0.0022514928,0.013559222],"category_scores_gemma":[0.009014177,0.0014177428,0.002118269,0.0050491067,0.00086955255,0.0035323515,0.0029379574,0.0047707055,0.005864451],"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.0002908241,0.00022899001,0.0010593157,0.0007402533,0.00042235278,0.00032502835,0.0004802146,0.026739055,0.021908157,0.023535417,0.014131553,0.9101388],"study_design_scores_gemma":[0.00019772266,0.0002416863,0.0015266524,0.00017335365,0.00033690035,0.0011889462,0.00022555114,0.75370556,0.015333583,0.1699523,0.056922752,0.00019506199],"about_ca_topic_score_codex":0.0008509738,"about_ca_topic_score_gemma":0.0014597944,"teacher_disagreement_score":0.013559222,"about_ca_system_score_codex":0.00040171936,"about_ca_system_score_gemma":0.00087648514,"threshold_uncertainty_score":0.04536009},"labels":[],"label_agreement":null},{"id":"W2007666940","doi":"10.1007/978-3-642-21311-3_13","title":"On Counting Lattice Points and Chvátal-Gomory Cutting Planes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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","funders":"","keywords":"Hyperplane; Combinatorics; Lattice (music); Computer science; Integer programming; Set (abstract data type); Counting problem; Mathematics; Algorithm; Physics","score_opus":0.015720405695315368,"score_gpt":0.20746679450639208,"score_spread":0.1917463888110767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007666940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1014343,0.008002448,0.68761647,0.0031098407,0.0012733132,0.00025516146,0.0006332402,0.0007307888,0.19694452],"genre_scores_gemma":[0.48028684,0.006943099,0.42927793,0.0010165436,0.0012946841,0.00064037106,0.0013761837,0.00080206775,0.07836225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979048,0.0005151758,0.00011706944,0.00027679311,0.0008773529,0.00030889522],"domain_scores_gemma":[0.99715,0.0017036607,0.00022418355,0.0003373742,0.00038860543,0.00019621052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018567566,0.0016076441,0.0023434388,0.005062032,0.0025083811,0.004723242,0.0042643775,0.002672692,0.013803645],"category_scores_gemma":[0.010260668,0.0013240529,0.0015248292,0.009234198,0.0037948252,0.008510594,0.003776827,0.005799416,0.0020562988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039916602,0.000026731606,0.00021178846,0.00008679298,0.000012176894,0.000030126324,0.000095622265,0.007000046,0.00035763544,0.95289284,0.0049227406,0.034323614],"study_design_scores_gemma":[0.000010298482,0.0000113403285,0.00013314046,0.00003787677,0.000008832084,0.000048443737,0.00004747813,0.018299488,0.0003087047,0.9770184,0.0040630572,0.000012854823],"about_ca_topic_score_codex":0.0034034683,"about_ca_topic_score_gemma":0.0038353025,"teacher_disagreement_score":0.013803645,"about_ca_system_score_codex":0.00323489,"about_ca_system_score_gemma":0.0012535773,"threshold_uncertainty_score":0.046177745},"labels":[],"label_agreement":null},{"id":"W2009149513","doi":"10.1007/11880240_17","title":"Mappings, Maps and Tables: Towards Formal Semantics for Associations in UML2","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Queen's University","funders":"","keywords":"Computer science; Programming language; Semantics (computer science); Formal semantics (linguistics); Operational semantics; Formal methods; Theoretical computer science","score_opus":0.02082883432110313,"score_gpt":0.24927097661600248,"score_spread":0.22844214229489934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009149513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011973883,0.00045724385,0.9947758,0.00035220044,0.000095963325,0.00007130348,0.00036607322,0.0014067536,0.0012772179],"genre_scores_gemma":[0.043856565,0.0012626812,0.9488544,0.0003644298,0.00014063495,0.00040276512,0.0015482162,0.0010132464,0.00255706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943435,0.0025826292,0.0008854164,0.0006643844,0.0012893573,0.00023468965],"domain_scores_gemma":[0.99441576,0.0031274,0.0004034087,0.001032875,0.0008280015,0.00019247508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007628307,0.0019403266,0.0013765196,0.0035296986,0.0018955247,0.008690331,0.0031570538,0.002872662,0.00446743],"category_scores_gemma":[0.013430112,0.0022144841,0.0026062923,0.004352671,0.0045200004,0.01841368,0.0050501437,0.005038355,0.002276583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069640715,0.000043941032,0.0003796169,0.00036154775,0.00004411344,0.00014364686,0.0023136605,0.008519139,0.001639816,0.89750934,0.009439802,0.07953564],"study_design_scores_gemma":[0.000029568368,0.000017743634,0.00009679343,0.00018622652,0.000053929023,0.00015045571,0.00037823172,0.046355527,0.0026466977,0.8783123,0.07173068,0.000041856856],"about_ca_topic_score_codex":0.006733378,"about_ca_topic_score_gemma":0.007420842,"teacher_disagreement_score":0.008690331,"about_ca_system_score_codex":0.0019499608,"about_ca_system_score_gemma":0.0030226386,"threshold_uncertainty_score":0.040342808},"labels":[],"label_agreement":null},{"id":"W201142559","doi":"10.1007/978-3-642-38977-1_5","title":"An Assessment of Test-Driven Reuse: Promises and Pitfalls","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Calgary","funders":"","keywords":"Reuse; Computer science; Software engineering; Code reuse; Source code; Test (biology); Code (set theory); Work (physics); Test case; Programming language; Data science; Software; Machine learning; Engineering","score_opus":0.017282294242032262,"score_gpt":0.2994893514469103,"score_spread":0.28220705720487804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201142559","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.47323212,0.01586932,0.41848704,0.01044925,0.0003492152,0.00050991285,0.00090882735,0.0037018938,0.07649243],"genre_scores_gemma":[0.9264423,0.0017719491,0.06713116,0.00046963667,0.000076148346,0.00011551837,0.000383702,0.00032249917,0.0032871643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9664302,0.012459998,0.0011770052,0.0010369373,0.018160658,0.00073528185],"domain_scores_gemma":[0.7652925,0.16454422,0.009623151,0.025944509,0.03224273,0.0023528386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030045968,0.0009918049,0.0008767905,0.004656135,0.0008014308,0.004145222,0.0037029264,0.0020133685,0.003726379],"category_scores_gemma":[0.12524264,0.00037840588,0.0011317687,0.0040223156,0.0025434534,0.006490815,0.0028089187,0.0016201431,0.0009891372],"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.0008441078,0.0006690456,0.039473847,0.00097326527,0.0002979139,0.00017357554,0.0015428878,0.022145612,0.004846347,0.060414664,0.0053499076,0.86326885],"study_design_scores_gemma":[0.0004316826,0.009893026,0.1141018,0.0023145145,0.0011274037,0.0033062657,0.0045042336,0.40608704,0.04851285,0.35613924,0.05311005,0.00047195636],"about_ca_topic_score_codex":0.003722416,"about_ca_topic_score_gemma":0.0040797694,"teacher_disagreement_score":0.030045968,"about_ca_system_score_codex":0.0021497163,"about_ca_system_score_gemma":0.0036083711,"threshold_uncertainty_score":0.1589002},"labels":[],"label_agreement":null},{"id":"W2012034102","doi":"10.1007/978-3-540-75555-5_15","title":"Different Binding Strategies for the Different Stages of Visual Recognition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","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":"York University","funders":"","keywords":"Task (project management); Computer science; Hierarchy; Resource (disambiguation); Visual processing; Visual cortex; Artificial intelligence; Neuroscience; Psychology; Engineering; Perception; Political science","score_opus":0.10997979921423964,"score_gpt":0.3485677356905428,"score_spread":0.23858793647630314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012034102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1000936,0.00583464,0.7643212,0.002146321,0.0008445958,0.00035117115,0.0005939624,0.003674969,0.12213946],"genre_scores_gemma":[0.6298433,0.0048682373,0.2859425,0.0014625388,0.00015137998,0.00061543094,0.0008348902,0.0024851875,0.07379658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999022,0.00014064663,0.00006952752,0.00023303568,0.00025078712,0.00028396747],"domain_scores_gemma":[0.99805176,0.0008887663,0.00009170024,0.0004195343,0.00034996055,0.00019829269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016499646,0.0009398051,0.0011219489,0.0010813207,0.00091923174,0.0050768545,0.004265635,0.0036402252,0.02407939],"category_scores_gemma":[0.005673205,0.0018280292,0.0018389988,0.0009324289,0.002323462,0.007968555,0.002012968,0.0031801625,0.007880102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062842545,0.00015781191,0.0010785583,0.00064691645,0.000096407966,0.00022307786,0.0015920331,0.0036218355,0.31108758,0.45198014,0.008232001,0.22065517],"study_design_scores_gemma":[0.00021745083,0.00033077164,0.016709495,0.00034692913,0.00038546635,0.0022301944,0.0012451594,0.0856843,0.31722164,0.5418177,0.03317885,0.0006319956],"about_ca_topic_score_codex":0.0016897515,"about_ca_topic_score_gemma":0.0018533831,"teacher_disagreement_score":0.02407939,"about_ca_system_score_codex":0.00085167674,"about_ca_system_score_gemma":0.0006559076,"threshold_uncertainty_score":0.08055353},"labels":[],"label_agreement":null},{"id":"W2012058332","doi":"10.1007/978-3-642-33666-9_23","title":"An Exploratory Study of Forces and Frictions Affecting Large-Scale Model-Driven Development","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Traceability; Point (geometry); Exploratory research; Context (archaeology); Software development; Software; Software engineering; Automotive industry; Scale (ratio); Product (mathematics); Programming language; Engineering","score_opus":0.021296627009455844,"score_gpt":0.2524642050949047,"score_spread":0.23116757808544885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012058332","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.98693603,0.00005653094,0.010735614,0.000036865735,0.0000029200503,0.000047294398,0.00003681581,0.000072036986,0.0020757972],"genre_scores_gemma":[0.9961767,0.000028535764,0.0034890587,0.000003092892,6.8797783e-7,0.000017565526,0.000024090396,0.000011602366,0.00024858533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9994822,0.00018373296,0.000017180113,0.000047915535,0.00020162962,0.000067388704],"domain_scores_gemma":[0.99113035,0.007537371,0.000393598,0.00045770558,0.00033425356,0.00014676465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009226714,0.00027486685,0.000280051,0.00046429422,0.00049360946,0.0006446019,0.0005334688,0.0005175721,0.0011752689],"category_scores_gemma":[0.009021118,0.00026829043,0.00028075543,0.0006116935,0.000547311,0.00062893535,0.000431967,0.0005270675,0.00009166779],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018945113,0.0035240292,0.09047139,0.0008439162,0.00014826206,0.0019133027,0.006478048,0.57992756,0.10215907,0.023451783,0.002116783,0.18707138],"study_design_scores_gemma":[0.00009116097,0.0013412816,0.05855922,0.000038808972,0.000065490305,0.0004556627,0.0019835888,0.9067128,0.020970412,0.0074232495,0.0022962263,0.000062112806],"about_ca_topic_score_codex":0.0017907575,"about_ca_topic_score_gemma":0.0021503782,"teacher_disagreement_score":0.0017907575,"about_ca_system_score_codex":0.0004595415,"about_ca_system_score_gemma":0.00049527455,"threshold_uncertainty_score":0.004879594},"labels":[],"label_agreement":null},{"id":"W2013662449","doi":"10.1007/3-540-47555-9_12","title":"Suffix trees and string complexity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Suffix tree; Suffix; String (physics); Mathematics; Combinatorics; Generalized suffix tree; Tree (set theory); Discrete mathematics; Shift register; Order (exchange); Computer science; Data structure","score_opus":0.0454359545678276,"score_gpt":0.27756268553565316,"score_spread":0.23212673096782557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013662449","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035319768,0.04553494,0.41404736,0.011088238,0.002065801,0.000099839555,0.0011502763,0.0012150109,0.48947883],"genre_scores_gemma":[0.5501611,0.049345087,0.15884386,0.0024357992,0.008342923,0.00038161146,0.0031221225,0.0010670099,0.22630043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920815,0.00013491244,0.00004778513,0.00012662481,0.00042504683,0.000057519723],"domain_scores_gemma":[0.99832624,0.00114653,0.00007809921,0.00023989652,0.00015463274,0.000054689044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051894935,0.0006918072,0.0010756478,0.0017450409,0.00096133107,0.0032577096,0.0009901914,0.001143723,0.015143731],"category_scores_gemma":[0.0035176591,0.00052326196,0.00067484716,0.0046829223,0.0024551642,0.00932197,0.0016697628,0.003792787,0.004362548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018372182,0.000020413721,0.00013248235,0.00015528454,0.000011036116,0.00003960225,0.00011062033,0.003527646,0.0005661905,0.9174782,0.013544519,0.06439559],"study_design_scores_gemma":[0.0000027585295,0.0000051943343,0.000087776694,0.000018133484,0.0000038626868,0.000072223665,0.000016726965,0.0029519992,0.0002831924,0.97572803,0.02082465,0.0000054709753],"about_ca_topic_score_codex":0.0004860381,"about_ca_topic_score_gemma":0.0005032679,"teacher_disagreement_score":0.015143731,"about_ca_system_score_codex":0.0016275739,"about_ca_system_score_gemma":0.0006711013,"threshold_uncertainty_score":0.05066079},"labels":[],"label_agreement":null},{"id":"W201498424","doi":"10.1007/978-3-642-37899-7_16","title":"Using Semantic-Based Association Rule Mining for Improving Clinical Text Retrieval","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"York University","funders":"","keywords":"Computer science; Information retrieval; Query expansion; Association rule learning; Ranking (information retrieval); Context (archaeology); Data mining; Unified Medical Language System; Ontology; Probabilistic logic; Artificial intelligence","score_opus":0.048396626243005496,"score_gpt":0.3171973309148056,"score_spread":0.2688007046718001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201498424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13445202,0.012084754,0.8262753,0.0026204695,0.0018618152,0.0009464492,0.007302493,0.00642628,0.008030422],"genre_scores_gemma":[0.3316412,0.0033540535,0.64897126,0.0008869737,0.0011430882,0.00045402852,0.011208116,0.00022648564,0.0021147495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955562,0.0009840546,0.0010112583,0.0007603847,0.0014718507,0.00021628337],"domain_scores_gemma":[0.9921823,0.004402131,0.00057229394,0.0005625223,0.0021188364,0.00016181727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038786745,0.0011841282,0.0023197245,0.0089161815,0.0008428869,0.0025122722,0.001512319,0.0014179143,0.0028208497],"category_scores_gemma":[0.01526421,0.00042027523,0.0023017225,0.007112153,0.00040030282,0.0030639702,0.0016511133,0.0015644365,0.0035137648],"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.0008402731,0.0010300716,0.020266104,0.0010744284,0.0006950826,0.0006602166,0.0002180728,0.0064934613,0.021995157,0.003036892,0.018027961,0.92566216],"study_design_scores_gemma":[0.0005694176,0.0017079988,0.034167584,0.00088018354,0.0035881186,0.009067952,0.0009396296,0.7809162,0.06692608,0.059758004,0.041085627,0.00039325558],"about_ca_topic_score_codex":0.0012911655,"about_ca_topic_score_gemma":0.00231833,"teacher_disagreement_score":0.0089161815,"about_ca_system_score_codex":0.0003863171,"about_ca_system_score_gemma":0.001595707,"threshold_uncertainty_score":0.02051258},"labels":[],"label_agreement":null},{"id":"W2017352617","doi":"10.1007/978-3-540-24595-7_32","title":"Experiments with the Fixed-Parameter Approach for Two-Layer Planarization","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Chemical-mechanical planarization; Layer (electronics); Integer programming; Linear programming; Integer (computer science); Algorithm; Running time; Mathematical optimization; Parallel computing; Theoretical computer science; Mathematics; Programming language","score_opus":0.02651714170800634,"score_gpt":0.2639572316062054,"score_spread":0.23744008989819904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017352617","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.6731862,0.00070586917,0.30211633,0.0004995035,0.00032020418,0.00037900478,0.0015774872,0.006708836,0.014506621],"genre_scores_gemma":[0.8681135,0.00037786955,0.12439871,0.0000792675,0.00001843064,0.00011418776,0.0013309674,0.0010884776,0.00447846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00009538702,0.000036379024,0.00009961025,0.00021028207,0.00010812425],"domain_scores_gemma":[0.99757487,0.0012689121,0.000098037,0.0006121846,0.00031697596,0.00012914451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897738,0.0011720458,0.0009494039,0.0008102244,0.0005205056,0.0010035473,0.0015375688,0.001361562,0.008343531],"category_scores_gemma":[0.004026209,0.0005053195,0.0006535193,0.0013392965,0.00061146007,0.0016738693,0.0013571093,0.0014028796,0.0012496718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026005162,0.0017819987,0.0010601676,0.00094554573,0.00020372927,0.0003197215,0.0005178051,0.63811296,0.21754903,0.0064716446,0.0056164186,0.12482043],"study_design_scores_gemma":[0.00020225128,0.0009975024,0.00076612015,0.00003483972,0.00006867387,0.000107357075,0.00027655863,0.87580377,0.115289964,0.003059108,0.0033437584,0.000050131024],"about_ca_topic_score_codex":0.0045358385,"about_ca_topic_score_gemma":0.0023890552,"teacher_disagreement_score":0.008343531,"about_ca_system_score_codex":0.00044705966,"about_ca_system_score_gemma":0.00058113236,"threshold_uncertainty_score":0.027911842},"labels":[],"label_agreement":null},{"id":"W201798103","doi":"10.1007/978-3-319-07557-0_16","title":"A $\\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Approximation algorithm; Integer (computer science); Relaxation (psychology); Linear programming relaxation; Discrete mathematics; Linear programming; Algorithm; Computer science","score_opus":0.041494969496302866,"score_gpt":0.2730944437374828,"score_spread":0.23159947424117994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201798103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11201744,0.0033884656,0.6174705,0.0063750525,0.0019299411,0.00045383084,0.0031205425,0.0088964,0.2463478],"genre_scores_gemma":[0.354769,0.0021558562,0.50406075,0.0031597354,0.0008406786,0.0007357764,0.0052259043,0.0047782003,0.124274164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.00021959093,0.000070878705,0.00037423082,0.0005799676,0.00047784968],"domain_scores_gemma":[0.99746823,0.0012110359,0.000112901784,0.0007449123,0.0002716933,0.0001913334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013075361,0.0024961059,0.002309037,0.0019620052,0.002301149,0.0046981736,0.0039457274,0.0025100424,0.039669283],"category_scores_gemma":[0.0057190373,0.00095982826,0.0025594146,0.0035342164,0.0017397949,0.006570232,0.0049624336,0.0073298635,0.009818024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010303161,0.00066883274,0.0013185001,0.00086152495,0.00013513169,0.0002445868,0.00049732166,0.029500382,0.0080861645,0.58072615,0.08825604,0.28867513],"study_design_scores_gemma":[0.0001765002,0.00010534163,0.0005418912,0.00022413529,0.00017114199,0.00031580118,0.00015988284,0.12488007,0.005452433,0.8246862,0.043232094,0.000054398533],"about_ca_topic_score_codex":0.0048313127,"about_ca_topic_score_gemma":0.009550758,"teacher_disagreement_score":0.039669283,"about_ca_system_score_codex":0.0037604978,"about_ca_system_score_gemma":0.0030857832,"threshold_uncertainty_score":0.13270694},"labels":[],"label_agreement":null},{"id":"W201949388","doi":"10.1007/978-3-319-07863-2_60","title":"Factors Influencing the Adoption of Cloud Computing by Small and Medium Size Enterprises (SMEs)","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":117,"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":"Cloud computing; Computer science; Small and medium-sized enterprises; Order (exchange); Logistic regression; Knowledge management; Test (biology); Reliability (semiconductor); Decision maker; Field (mathematics); Operations research; Business; Machine learning; Mathematics","score_opus":0.013539076035480711,"score_gpt":0.2193380223482756,"score_spread":0.20579894631279488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201949388","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.99869376,0.00007818408,0.000038702634,0.00014928078,0.000002748468,0.0000051697943,0.000035907804,0.0000013864613,0.0009947688],"genre_scores_gemma":[0.99966455,0.000054099586,0.000027542572,0.000023194829,0.0000031985837,0.0000022637294,0.000029770426,9.862282e-7,0.00019440992],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991744,0.00020713384,0.00008048323,0.00006931686,0.00020059735,0.00026805775],"domain_scores_gemma":[0.98584217,0.006684264,0.003559797,0.00020277318,0.0014030247,0.002307984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010023911,0.00010556045,0.00013483941,0.00062841194,0.0006213789,0.0012977893,0.00023958381,0.0004907367,0.0030604184],"category_scores_gemma":[0.008453833,0.000115357194,0.00028247756,0.001188374,0.0004713689,0.00065301347,0.0006935787,0.00060180266,0.0003257919],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086159256,0.00010685035,0.9925283,0.00002072088,0.00001887489,0.00027970067,0.0019783415,0.00008704844,0.0005058281,0.00018198267,0.00019096663,0.0040152506],"study_design_scores_gemma":[0.000002523521,0.00007356497,0.9911578,0.00002057593,0.000014444044,0.00016325912,0.0076743467,0.00025021355,0.00017510253,0.000065501335,0.0003961618,0.0000063845296],"about_ca_topic_score_codex":0.01360865,"about_ca_topic_score_gemma":0.021415526,"teacher_disagreement_score":0.01360865,"about_ca_system_score_codex":0.00050341425,"about_ca_system_score_gemma":0.0009557215,"threshold_uncertainty_score":0.0270589},"labels":[],"label_agreement":null},{"id":"W2019944300","doi":"10.1007/978-3-642-31454-4_23","title":"Towards Adaptive Information Visualization: On the Influence of User Characteristics","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; Information visualization; Human–computer interaction; Adaptation (eye); Context (archaeology); Bar chart; Perception; Visual analytics; Preference; Task (project management); Artificial intelligence","score_opus":0.022580442224785523,"score_gpt":0.27201706650679996,"score_spread":0.24943662428201444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019944300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42553848,0.004693731,0.5579417,0.0022950782,0.0001716779,0.00011287542,0.0005190692,0.0023083717,0.0064191553],"genre_scores_gemma":[0.9199417,0.0010992208,0.076551095,0.00016915376,0.00012509974,0.00005206982,0.00032820052,0.00039072672,0.0013426801],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9967024,0.0020455166,0.00009784146,0.00050268666,0.0005030756,0.00014859489],"domain_scores_gemma":[0.9095815,0.078119464,0.0023293197,0.0051131686,0.0038924222,0.00096417515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004714521,0.0010085516,0.0011140147,0.0014550615,0.0005673587,0.0033090163,0.0012717352,0.0011782635,0.0017536525],"category_scores_gemma":[0.056311354,0.00065358664,0.0006207438,0.0026099004,0.0011381747,0.0062258225,0.0017275442,0.0020239777,0.0004296692],"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.002579688,0.0009355275,0.09912166,0.0010073577,0.00061512867,0.00039727357,0.004304949,0.11215684,0.0420931,0.032595914,0.016331792,0.6878608],"study_design_scores_gemma":[0.00007071661,0.00032109814,0.032801487,0.0000991297,0.00029520132,0.00032145326,0.0006269637,0.9018412,0.013867432,0.04606056,0.003602436,0.00009222016],"about_ca_topic_score_codex":0.004064189,"about_ca_topic_score_gemma":0.0033030896,"teacher_disagreement_score":0.004714521,"about_ca_system_score_codex":0.0005422338,"about_ca_system_score_gemma":0.0006307085,"threshold_uncertainty_score":0.02493304},"labels":[],"label_agreement":null},{"id":"W2020287344","doi":"10.1007/978-3-642-19222-7_23","title":"Skip Lift: A Probabilistic Alternative to Red-Black Trees","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Lift (data mining); Computer science; Pointer (user interface); Data structure; Probabilistic logic; Algorithm; Combinatorics; Theoretical computer science; Mathematics; Data mining; Artificial intelligence; Programming language","score_opus":0.025907399158147843,"score_gpt":0.2531766838766929,"score_spread":0.22726928471854504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020287344","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.007160877,0.0002677994,0.982477,0.00033279075,0.00020202168,0.000053733827,0.00025736363,0.0018228567,0.007425484],"genre_scores_gemma":[0.26790118,0.0006955604,0.70247453,0.0008083993,0.0006321534,0.00026328978,0.0011641243,0.0022953246,0.023765502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984615,0.00034441808,0.00006123002,0.00025605524,0.0006712743,0.00020555513],"domain_scores_gemma":[0.99662894,0.0012567003,0.0001387399,0.0012955533,0.00043872875,0.00024132094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019548286,0.00073051767,0.0012999343,0.001203361,0.0014752791,0.0019280877,0.0024570439,0.0015144626,0.013151753],"category_scores_gemma":[0.008200516,0.0006142623,0.0011089029,0.0020151772,0.0013967361,0.003892605,0.0045864056,0.0030925586,0.0033975616],"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.0007177084,0.00015920217,0.0006642591,0.00019511867,0.00006050631,0.00016861701,0.00025160785,0.05893139,0.004246151,0.51103604,0.02460975,0.39895964],"study_design_scores_gemma":[0.000055128436,0.00007074123,0.00022456929,0.000048241283,0.000039742452,0.0001423908,0.00003901452,0.34173828,0.002145808,0.6384177,0.017043935,0.000034340672],"about_ca_topic_score_codex":0.001610158,"about_ca_topic_score_gemma":0.0029410531,"teacher_disagreement_score":0.013151753,"about_ca_system_score_codex":0.0006261372,"about_ca_system_score_gemma":0.0015108457,"threshold_uncertainty_score":0.04399705},"labels":[],"label_agreement":null},{"id":"W202072731","doi":"10.1007/978-3-642-39112-5_7","title":"Aligning and Comparing Data on Emotions Experienced during Learning with MetaTutor","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"McGill University","funders":"","keywords":"Facial expression; Session (web analytics); Computer science; Expression (computer science); Emotional expression; Psychology; Cognitive psychology; Artificial intelligence; World Wide Web","score_opus":0.07232392833344306,"score_gpt":0.35508944560589545,"score_spread":0.28276551727245236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202072731","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.8962007,0.0008084981,0.087910354,0.0001608336,0.00022549265,0.00029308934,0.0061709206,0.0027414556,0.005488572],"genre_scores_gemma":[0.8505869,0.0003282688,0.13338123,0.00009131966,0.00011687919,0.00076946587,0.011512522,0.00066634314,0.002546973],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99853337,0.00060036447,0.00013700585,0.00034728512,0.00028200573,0.00009993086],"domain_scores_gemma":[0.9914854,0.0054275286,0.00062172045,0.001295017,0.000968481,0.00020181824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002237804,0.00035156443,0.000388544,0.002220503,0.00034124168,0.0012182994,0.0005244676,0.00064093305,0.0029363183],"category_scores_gemma":[0.012115991,0.00017755186,0.0006330476,0.0021517691,0.00025823872,0.0012917067,0.0015724959,0.0004523394,0.0015849242],"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.0026693046,0.00032804805,0.14665027,0.0008732773,0.00066558976,0.00021620076,0.0039907326,0.0025525019,0.081662335,0.0008594748,0.009194621,0.75033766],"study_design_scores_gemma":[0.00013055712,0.0017495775,0.8681518,0.00023964902,0.000747401,0.0021102102,0.006152426,0.037967905,0.059606194,0.0056441086,0.017321471,0.00017862784],"about_ca_topic_score_codex":0.00035217646,"about_ca_topic_score_gemma":0.0010010522,"teacher_disagreement_score":0.0029363183,"about_ca_system_score_codex":0.00018908606,"about_ca_system_score_gemma":0.0001834089,"threshold_uncertainty_score":0.011834741},"labels":[],"label_agreement":null},{"id":"W20210422","doi":"10.1007/978-3-642-33415-3_80","title":"Stochastic 3D Motion Compensation of Coronary Arteries from Monoplane Angiograms","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer vision; Computer science; Artificial intelligence; Coronary arteries; Cardiac cycle; Probabilistic logic; Motion estimation; Feature (linguistics); Deformation (meteorology); Artery; Medicine; Cardiology; Geology","score_opus":0.01618943971228354,"score_gpt":0.2629971043616236,"score_spread":0.24680766464934006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20210422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11110794,0.0005606699,0.88635665,0.00016093692,0.000049426882,0.000042582313,0.00022686894,0.00064174633,0.0008531286],"genre_scores_gemma":[0.7090863,0.0011146648,0.28572348,0.0001102766,0.00013248344,0.000078762445,0.00088827056,0.00022599728,0.0026397945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978715,0.000040396815,0.000012183987,0.000033256114,0.00010391342,0.000023119224],"domain_scores_gemma":[0.9996834,0.00011631949,0.000056083023,0.00004332913,0.000077991994,0.000022894534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036889865,0.00046065505,0.0005240334,0.00084796036,0.00016354391,0.00063702546,0.00041466107,0.0006681781,0.0011713576],"category_scores_gemma":[0.0013518648,0.00050602155,0.00050309044,0.0005609513,0.00022198776,0.00025809597,0.0004772307,0.00047109282,0.00040044897],"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.00085266377,0.00014168538,0.0038642695,0.00037093536,0.00013375685,0.00039868435,0.00018652096,0.30286846,0.33481485,0.004294852,0.0021983683,0.349875],"study_design_scores_gemma":[0.000019392382,0.00008934219,0.00766996,0.000024044406,0.00003250711,0.0004561025,0.000015766045,0.9614536,0.02752684,0.0013778319,0.0013050905,0.000029432998],"about_ca_topic_score_codex":0.001770496,"about_ca_topic_score_gemma":0.0038495134,"teacher_disagreement_score":0.001770496,"about_ca_system_score_codex":0.00025263074,"about_ca_system_score_gemma":0.0005207138,"threshold_uncertainty_score":0.0039185286},"labels":[],"label_agreement":null},{"id":"W202515706","doi":"10.1007/978-3-642-41019-2_19","title":"Column Generation Based Heuristic for the Three Dimensional Vehicle Loading Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Concordia University","funders":"","keywords":"Column generation; Computer science; Heuristic; Set (abstract data type); Mathematical optimization; Column (typography); Greedy algorithm; Decomposition; Integer programming; Integer (computer science); Set cover problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.022216607706858082,"score_gpt":0.21634171917539294,"score_spread":0.19412511146853487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202515706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10352047,0.0015198394,0.8697523,0.00044472463,0.00036230273,0.00034916957,0.00054649735,0.0027273633,0.02077738],"genre_scores_gemma":[0.49776012,0.00065763725,0.48929772,0.00037720223,0.00009760531,0.00039792727,0.0010798834,0.0004356091,0.009896234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997644,0.000060819344,0.000007860088,0.000026703774,0.00006831004,0.00007198415],"domain_scores_gemma":[0.9996019,0.00020355229,0.00003492856,0.00003928888,0.00007771939,0.00004270498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026044753,0.0009967478,0.0011845755,0.00096771034,0.00072466925,0.00083001546,0.0013588986,0.0010460025,0.008436639],"category_scores_gemma":[0.00065132376,0.0005855363,0.00073704426,0.001582852,0.0004956479,0.0006292114,0.00083862006,0.00096965954,0.0009256472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002613753,0.00025547767,0.00038556795,0.00019821736,0.000042730408,0.00022540428,0.00006275808,0.8126924,0.0067158397,0.0046429825,0.011145273,0.16337186],"study_design_scores_gemma":[0.00003621476,0.00006630947,0.00015339947,0.000010127638,0.00001351204,0.00004387836,0.000020210657,0.9951898,0.001384244,0.0018664034,0.0012030867,0.000012750104],"about_ca_topic_score_codex":0.008038118,"about_ca_topic_score_gemma":0.010490323,"teacher_disagreement_score":0.008436639,"about_ca_system_score_codex":0.0007058239,"about_ca_system_score_gemma":0.0010717823,"threshold_uncertainty_score":0.028223395},"labels":[],"label_agreement":null},{"id":"W202532017","doi":"10.1007/978-3-642-23211-4_4","title":"The Generative Power of Probabilistic and Weighted Context-Free Grammars","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Rule-based machine translation; Probabilistic logic; Context-free grammar; Generative grammar; Tree-adjoining grammar; Context-sensitive grammar; Artificial intelligence; Natural language processing; Programming language; Theoretical computer science","score_opus":0.013371662320256817,"score_gpt":0.2353362324880736,"score_spread":0.22196457016781676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202532017","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.03416733,0.0013117664,0.9415339,0.0008842732,0.00009527758,0.000029415747,0.00020734308,0.00038223725,0.021388479],"genre_scores_gemma":[0.760517,0.0019468395,0.2176989,0.00049627695,0.0005249453,0.00016291665,0.00062254496,0.00072706916,0.01730354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964934,0.0015600654,0.00019778417,0.0005076128,0.0009796047,0.0002615753],"domain_scores_gemma":[0.97706443,0.01960591,0.00057148293,0.0017011539,0.000769827,0.00028731432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00363073,0.00074093445,0.0010731536,0.0018140664,0.001291345,0.0037469903,0.0024682684,0.0016387413,0.004756536],"category_scores_gemma":[0.022338113,0.0017369493,0.0019476449,0.002018014,0.0049505876,0.007916873,0.002597704,0.0029983646,0.0008269417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025850628,0.000013687253,0.00023197904,0.00004300206,0.000021713695,0.000071631795,0.00026097355,0.024311962,0.0006989292,0.9580634,0.00042537422,0.015831467],"study_design_scores_gemma":[0.0000046924188,0.0000027693036,0.00004798264,0.0000073740284,0.000007509034,0.000029104358,0.000008780993,0.03748439,0.0001968694,0.9612821,0.00091975543,0.000008721803],"about_ca_topic_score_codex":0.0026904177,"about_ca_topic_score_gemma":0.0029507438,"teacher_disagreement_score":0.004756536,"about_ca_system_score_codex":0.0013461392,"about_ca_system_score_gemma":0.0012007201,"threshold_uncertainty_score":0.019201338},"labels":[],"label_agreement":null},{"id":"W202684314","doi":"10.1007/978-3-642-39159-0_12","title":"Experimental Determination of Intrinsic Drosophila Embryo Coordinates by Evolutionary Computation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","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":"British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; National Science Foundation","keywords":"Computer science; Drosophila (subgenus); Computation; Evolutionary computation; Artificial intelligence; Algorithm; Biology; Genetics","score_opus":0.02321039020220768,"score_gpt":0.27655210807361824,"score_spread":0.2533417178714106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202684314","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.69394743,0.0012721737,0.26107252,0.00035570833,0.00016971394,0.00009171748,0.0011293472,0.0005556623,0.04140564],"genre_scores_gemma":[0.9080407,0.00064548803,0.08427511,0.000079412166,0.000019076831,0.00009927326,0.00065844983,0.00037088618,0.005811714],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996131,0.00007348729,0.000032483953,0.00009668957,0.00014369462,0.000040552273],"domain_scores_gemma":[0.99892175,0.00053213356,0.0001180912,0.00030666712,0.00008364246,0.000037737627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046894053,0.0003610916,0.00026659196,0.00035079962,0.00036783633,0.000797678,0.0010383065,0.00044940625,0.0062839026],"category_scores_gemma":[0.0017663614,0.00043360214,0.00022426494,0.00045731288,0.00094055524,0.0007039265,0.0006536819,0.000885729,0.0007678333],"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.00014429555,0.00004172009,0.0015257781,0.00011626852,0.000014236464,0.00008802763,0.00008899632,0.004010267,0.93374693,0.029031338,0.0005699468,0.030622227],"study_design_scores_gemma":[0.000054755164,0.00012983117,0.006942222,0.0000330081,0.000020023594,0.00049509667,0.000053070573,0.024912436,0.9552378,0.006749471,0.005340629,0.00003169258],"about_ca_topic_score_codex":0.0005192371,"about_ca_topic_score_gemma":0.001076028,"teacher_disagreement_score":0.0062839026,"about_ca_system_score_codex":0.00063264347,"about_ca_system_score_gemma":0.0002794634,"threshold_uncertainty_score":0.021021783},"labels":[],"label_agreement":null},{"id":"W2027028382","doi":"10.1007/bfb0030345","title":"The implementation of elliptic curve cryptosystems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"University of Waterloo","funders":"","keywords":"Hessian form of an elliptic curve; Elliptic curve cryptography; Curve25519; ElGamal encryption; Elliptic curve; Elliptic Curve Digital Signature Algorithm; Elliptic curve point multiplication; Schoof's algorithm; Tripling-oriented Doche–Icart–Kohel curve; Cryptosystem; Arithmetic; Factoring; Computation; Mathematics; Counting points on elliptic curves; Computer science; Supersingular elliptic curve; Cryptography; Algorithm; Pure mathematics; Public-key cryptography; Encryption; Quarter period; Computer security","score_opus":0.009510247810006096,"score_gpt":0.2485987547670173,"score_spread":0.2390885069570112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027028382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037750065,0.0075257174,0.7466028,0.001905276,0.0010452465,0.00028673396,0.00023108242,0.0046248077,0.20002833],"genre_scores_gemma":[0.45468372,0.008565631,0.39282554,0.00055685715,0.0005395736,0.00027105786,0.00069120474,0.00079217314,0.14107423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925786,0.0001464859,0.00005443221,0.000060811606,0.00038518148,0.000095144635],"domain_scores_gemma":[0.99955887,0.000102369595,0.000025468273,0.00017525075,0.000117723,0.000020229678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060258585,0.00074394885,0.0005360229,0.00068810716,0.00059923937,0.002642951,0.0013225967,0.0009639023,0.011306588],"category_scores_gemma":[0.0019811655,0.00067955075,0.0003407888,0.0010773102,0.00086547906,0.0028291997,0.0010171076,0.0016108389,0.005380325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022953002,0.00012035479,0.0002373096,0.00038042627,0.000025724083,0.00016429996,0.00024527265,0.0089164665,0.025467621,0.5580587,0.015082886,0.39107144],"study_design_scores_gemma":[0.00023714911,0.00029165528,0.00048052176,0.0004280424,0.000060579485,0.0011405145,0.00013165518,0.080096684,0.11533345,0.36436936,0.43735263,0.0000777122],"about_ca_topic_score_codex":0.00030959732,"about_ca_topic_score_gemma":0.00033494658,"teacher_disagreement_score":0.011306588,"about_ca_system_score_codex":0.00069572625,"about_ca_system_score_gemma":0.00076443836,"threshold_uncertainty_score":0.037824273},"labels":[],"label_agreement":null},{"id":"W2028921197","doi":"10.1007/978-3-540-77255-2_32","title":"Video Multicast over Wireless Ad Hoc Networks Using Distributed Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multicast; Computer network; Wireless ad hoc network; Source-specific multicast; Protocol Independent Multicast; Xcast; Pragmatic General Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; Linear network coding; Reliable multicast; Optimized Link State Routing Protocol; Wireless; Routing (electronic design automation); Network packet; Routing protocol","score_opus":0.042493849402785534,"score_gpt":0.2917538287261767,"score_spread":0.2492599793233912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028921197","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008928989,0.0005266489,0.9877301,0.00012346529,0.0000494351,0.000030697527,0.000012791899,0.00017886228,0.0024189844],"genre_scores_gemma":[0.59486246,0.0009830147,0.39601862,0.000119201475,0.00023461298,0.00022064362,0.00008859222,0.00013609888,0.0073367655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00019779256,0.000021458418,0.000059501475,0.00018312929,0.000043454645],"domain_scores_gemma":[0.9994881,0.00034457396,0.00003567157,0.00003887801,0.00007656663,0.000016228389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008495613,0.000591493,0.00097156316,0.0004961376,0.00040772237,0.00062802876,0.0010120991,0.0007049718,0.0011487708],"category_scores_gemma":[0.0017165584,0.0003221959,0.00038652704,0.0008141595,0.00039160904,0.0009156155,0.00081561547,0.00073780573,0.00016545736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088416404,0.00008493497,0.00016973935,0.00007259775,0.00005475943,0.0000310669,0.00003851992,0.84471637,0.0058100643,0.020511378,0.001731985,0.12669006],"study_design_scores_gemma":[0.000009395376,0.000019128125,0.00002486671,0.000002635791,0.0000060901834,0.000008467648,0.000003381761,0.9947056,0.00045976863,0.0044803517,0.00027772464,0.0000025398049],"about_ca_topic_score_codex":0.001099109,"about_ca_topic_score_gemma":0.0013477004,"teacher_disagreement_score":0.0011487708,"about_ca_system_score_codex":0.00074741343,"about_ca_system_score_gemma":0.00045668078,"threshold_uncertainty_score":0.00542289},"labels":[],"label_agreement":null},{"id":"W2029392249","doi":"10.1007/978-3-319-03578-9_12","title":"Influence Diffusion in Social Networks under Time Window Constraints","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Bounded function; Computer science; Node (physics); Set (abstract data type); Time complexity; Integer (computer science); Discrete mathematics; Interval (graph theory); Graph; Combinatorics; Window (computing); Algorithm; Theoretical computer science; Mathematics; Data mining","score_opus":0.008503308808419811,"score_gpt":0.23784666845535943,"score_spread":0.2293433596469396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029392249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.172701,0.0050339974,0.79616654,0.003765737,0.00028231248,0.00015851033,0.0009885837,0.0003458765,0.020557446],"genre_scores_gemma":[0.9136095,0.006528431,0.04396605,0.0002746557,0.0010771829,0.0004381746,0.0007431308,0.00028394363,0.033078916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.00060585694,0.00007947182,0.0003833078,0.00031896506,0.00024245826],"domain_scores_gemma":[0.97353697,0.021667872,0.0018674018,0.0008899678,0.0010133424,0.0010243725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035648255,0.0011640298,0.002147607,0.0019850591,0.0011832663,0.0030678893,0.003105217,0.0029201144,0.005746466],"category_scores_gemma":[0.028335199,0.0015122866,0.0012936662,0.002797992,0.0019049621,0.0069562388,0.0020260774,0.0027745743,0.0006081327],"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.00019172962,0.00007240194,0.0018678779,0.00030900523,0.00012956037,0.00033412402,0.00029873464,0.36622494,0.0016449322,0.60628206,0.0040622912,0.01858233],"study_design_scores_gemma":[0.000019707772,0.000019634872,0.00055166864,0.000023082419,0.000032648273,0.00005841492,0.00003308656,0.8316471,0.00020899707,0.16626905,0.0011174289,0.000019189689],"about_ca_topic_score_codex":0.010139587,"about_ca_topic_score_gemma":0.0068288464,"teacher_disagreement_score":0.010139587,"about_ca_system_score_codex":0.0025887573,"about_ca_system_score_gemma":0.0009951926,"threshold_uncertainty_score":0.020161152},"labels":[],"label_agreement":null},{"id":"W2030796019","doi":"10.1007/978-3-642-16181-0_1","title":"Genome Aliquoting Revisited","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Genome; Computer science; Breakpoint; Approximation algorithm; Time complexity; Polyploid; Ancestor; Algorithm; Combinatorics; Mathematics; Genetics; Biology; Gene; Chromosome","score_opus":0.009926857533070866,"score_gpt":0.23363157966796966,"score_spread":0.22370472213489878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030796019","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.07545936,0.022336325,0.57003236,0.022814706,0.0068314164,0.00013183104,0.0005066009,0.0025203035,0.29936713],"genre_scores_gemma":[0.7312104,0.012418074,0.13287301,0.0066500353,0.0024760151,0.00027298238,0.0007290437,0.0020013487,0.11136918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907553,0.00015314341,0.00003979474,0.000333265,0.00027206106,0.0001262113],"domain_scores_gemma":[0.99719846,0.0011949337,0.00010948112,0.0011337652,0.00022373586,0.00013961857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017071717,0.00057076267,0.0012536675,0.0011992331,0.0017973584,0.002748763,0.0026291606,0.0020279237,0.015279269],"category_scores_gemma":[0.009048035,0.00048082194,0.00093494786,0.0016064652,0.003644347,0.0071669025,0.004657645,0.004009556,0.0021051744],"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.000043973192,0.000016394079,0.00021734092,0.00006574118,0.000009034047,0.00014485871,0.00014897164,0.0027134912,0.0021181442,0.94022745,0.004987743,0.049306937],"study_design_scores_gemma":[0.000020140356,0.000034534267,0.00031532743,0.000069879265,0.000020440631,0.00040141205,0.00013297226,0.015167448,0.009399284,0.92295027,0.05146432,0.000024077119],"about_ca_topic_score_codex":0.001004581,"about_ca_topic_score_gemma":0.0007424874,"teacher_disagreement_score":0.015279269,"about_ca_system_score_codex":0.0015087266,"about_ca_system_score_gemma":0.00094119896,"threshold_uncertainty_score":0.0511142},"labels":[],"label_agreement":null},{"id":"W2030886449","doi":"10.1007/978-3-319-09174-7_33","title":"Fixed-parameter algorithms for scaffold filling","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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":"Universität Duisburg-Essen; Universidade Federal do Rio de Janeiro; Université de Bordeaux; Universidad de Buenos Aires; Centre National de la Recherche Scientifique; Universidad de Chile; Università di Bologna; Universidade de Lisboa; Qatar University; Athens University of Economics and Business; Université Pierre et Marie Curie; Universität Wien; Università di Pisa; Universitat de València; Universidad de La Laguna; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Universidade de Aveiro","keywords":"Genome; Multiset; Parameterized complexity; Computational biology; Algorithm; Biology; Computer science; Gene; Mathematics; Genetics; Combinatorics","score_opus":0.014568712315176946,"score_gpt":0.2603904553116907,"score_spread":0.24582174299651374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030886449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007050575,0.00023629164,0.9860902,0.00017954512,0.0000545756,0.00006206536,0.00018505135,0.0027859781,0.0033557175],"genre_scores_gemma":[0.10988459,0.00022425172,0.88195264,0.00012435271,0.00006165982,0.0003832207,0.00095527316,0.0014704844,0.0049435417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971468,0.0008909186,0.00020249463,0.00071987795,0.0006698316,0.00037003116],"domain_scores_gemma":[0.9861239,0.0092381025,0.00036927185,0.003067403,0.0008853194,0.00031604868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033869864,0.0021532981,0.0024224701,0.0022538172,0.0018114684,0.003398403,0.007786826,0.004046238,0.023844521],"category_scores_gemma":[0.023058599,0.0015383045,0.0027538864,0.0044986256,0.0026791438,0.007236435,0.00600733,0.004580262,0.0069058365],"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.0009710896,0.00033847857,0.00091237086,0.00048707484,0.00011599826,0.000116233685,0.0005187563,0.26373485,0.004477876,0.1760488,0.021349048,0.53092945],"study_design_scores_gemma":[0.00022773506,0.00008458362,0.00013713914,0.000056944948,0.00004051247,0.000079070116,0.00010069884,0.65705466,0.003206086,0.33336687,0.0055988985,0.000046842088],"about_ca_topic_score_codex":0.0034445517,"about_ca_topic_score_gemma":0.004619003,"teacher_disagreement_score":0.023844521,"about_ca_system_score_codex":0.0023154588,"about_ca_system_score_gemma":0.0026708662,"threshold_uncertainty_score":0.07976782},"labels":[],"label_agreement":null},{"id":"W2033419776","doi":"10.1007/978-3-642-25011-8_27","title":"Efficient Codon Optimization with Motif Engineering","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Codon usage bias; Motif (music); Computer science; Gene; Computational biology; Coding region; Genome; Translational efficiency; Start codon; Genetics; Biology; Translation (biology); Base sequence; Messenger RNA","score_opus":0.00829634454521514,"score_gpt":0.19023543294709178,"score_spread":0.18193908840187664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033419776","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.13252844,0.0018064117,0.84467477,0.00021355141,0.00020926802,0.00009717482,0.00021997397,0.0040766173,0.016173715],"genre_scores_gemma":[0.41882762,0.0009439836,0.56969726,0.000104824016,0.000052684052,0.00014678446,0.0004924141,0.00081595965,0.008918404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.0000383801,0.000009853977,0.00003634625,0.000053106865,0.000028878603],"domain_scores_gemma":[0.9999038,0.000036485886,0.000010989875,0.000028748487,0.000013611201,0.0000064125875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018416681,0.000644981,0.00078320666,0.00031783467,0.00025066524,0.00048544793,0.00066974293,0.00049587805,0.0029849098],"category_scores_gemma":[0.00046946807,0.00032843486,0.00046502156,0.0006691356,0.00022683566,0.0004850023,0.00060711143,0.0008257932,0.0014088128],"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.0005500654,0.00023244006,0.00039469276,0.0004018997,0.00007225318,0.00022432087,0.000060447564,0.076405324,0.42108652,0.0357123,0.005035167,0.4598245],"study_design_scores_gemma":[0.00013009268,0.00046106425,0.00034488412,0.000036566227,0.00007354514,0.0003993986,0.000032788947,0.55656016,0.3754905,0.042353347,0.024074089,0.000043673987],"about_ca_topic_score_codex":0.00014587314,"about_ca_topic_score_gemma":0.00036472478,"teacher_disagreement_score":0.0029849098,"about_ca_system_score_codex":0.00018431245,"about_ca_system_score_gemma":0.00020420781,"threshold_uncertainty_score":0.009985507},"labels":[],"label_agreement":null},{"id":"W2035311548","doi":"10.1007/978-3-642-14455-4_38","title":"The Averaging Trick and the Černý Conjecture","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Conjecture; Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.006640741697130185,"score_gpt":0.20873273415921692,"score_spread":0.20209199246208673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035311548","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.09365198,0.009551458,0.16736221,0.053870466,0.006440561,0.00003511055,0.00037032695,0.0010008435,0.667717],"genre_scores_gemma":[0.88694763,0.003344728,0.020915864,0.007072538,0.0061178654,0.000091885726,0.00031724136,0.00054616004,0.074646115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876285,0.00034498854,0.000054935063,0.00032627338,0.00031783865,0.0001930812],"domain_scores_gemma":[0.99745184,0.0013505492,0.00014527445,0.00067482784,0.00024787404,0.00012953958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018630516,0.000611266,0.0013075168,0.0008588961,0.002279042,0.002598333,0.0012147438,0.0021730112,0.010291235],"category_scores_gemma":[0.007429705,0.00047138977,0.00093747844,0.0008667426,0.006376793,0.013317452,0.0030547292,0.0055488013,0.0020435727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017046275,0.0000067969327,0.0000529756,0.000022293978,0.0000024973513,0.000026318827,0.00005254299,0.00021871252,0.00010555902,0.99103886,0.0044176322,0.0040386007],"study_design_scores_gemma":[0.0000045581305,0.00000218695,0.000039922965,0.0000051560814,0.0000014664716,0.000028405842,0.000010585111,0.0005808555,0.00007876761,0.9956762,0.003568747,0.0000031892364],"about_ca_topic_score_codex":0.00070850604,"about_ca_topic_score_gemma":0.00069200364,"teacher_disagreement_score":0.010291235,"about_ca_system_score_codex":0.0011247982,"about_ca_system_score_gemma":0.0006150951,"threshold_uncertainty_score":0.034427643},"labels":[],"label_agreement":null},{"id":"W203615609","doi":"10.1007/978-3-642-31900-6_46","title":"An Information-Theoretic Interpretation of Thresholds in Probabilistic Rough Sets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":74,"is_retracted":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":"Probabilistic logic; Rough set; Entropy (arrow of time); Computer science; Interpretation (philosophy); Information theory; Principle of maximum entropy; Minification; Measure (data warehouse); Boundary (topology); Algorithm; Artificial intelligence; Mathematics; Data mining; Mathematical optimization; Statistics","score_opus":0.011934272400314366,"score_gpt":0.24487417755211977,"score_spread":0.2329399051518054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203615609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017920835,0.0031816775,0.9488858,0.0026622652,0.00043605425,0.00005468602,0.00027034097,0.00017065305,0.026417747],"genre_scores_gemma":[0.6946159,0.003246527,0.29252926,0.0009411645,0.0016028768,0.00027743218,0.00039660477,0.00015968051,0.006230645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511886,0.0015689215,0.0005221025,0.00067647285,0.0018301716,0.0002835213],"domain_scores_gemma":[0.990967,0.006286528,0.00080300507,0.0008409532,0.0008285458,0.00027398785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057644728,0.0009232888,0.0014676431,0.0038065442,0.0013205047,0.007762655,0.002466597,0.0019879548,0.003943721],"category_scores_gemma":[0.01887087,0.0010613453,0.0021662565,0.0041162656,0.0061161807,0.014082086,0.0026654378,0.0046750414,0.0005497555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011319927,0.0000072856665,0.00008387026,0.00005628893,0.000012365319,0.00004598469,0.00019346157,0.0031163439,0.0003280655,0.9905782,0.00046613812,0.0051007564],"study_design_scores_gemma":[0.000003828163,0.000008866611,0.000069568254,0.000022409828,0.000009112637,0.000046690508,0.00003155886,0.009904607,0.00014101826,0.9886098,0.0011427813,0.000009809699],"about_ca_topic_score_codex":0.00066979043,"about_ca_topic_score_gemma":0.00041395627,"teacher_disagreement_score":0.007762655,"about_ca_system_score_codex":0.002224264,"about_ca_system_score_gemma":0.00073365355,"threshold_uncertainty_score":0.030485809},"labels":[],"label_agreement":null},{"id":"W2036901448","doi":"10.1007/978-3-642-02777-2_38","title":"Beyond CNF: A Circuit-Based QBF Solver","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":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":"Conjunctive normal form; Boolean satisfiability problem; Computer science; True quantified Boolean formula; Solver; Satisfiability; Representation (politics); Theoretical computer science; DPLL algorithm; Algorithm; Programming language","score_opus":0.027845319325573346,"score_gpt":0.26944593295650254,"score_spread":0.2416006136309292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036901448","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.0020296646,0.0002461356,0.97900873,0.00040706954,0.00014415932,0.00014222309,0.0003675677,0.0020224962,0.015632076],"genre_scores_gemma":[0.08717882,0.00069579686,0.88714623,0.00065598154,0.000119775286,0.0003453483,0.0013732592,0.0011419646,0.021342838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988673,0.00030173187,0.000062900144,0.00022383645,0.0004125106,0.00013182807],"domain_scores_gemma":[0.9984971,0.00096286176,0.00004576896,0.00018942199,0.00025971903,0.000045034078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216426,0.0012518018,0.0011260433,0.0010849538,0.0008820616,0.002285723,0.0030752644,0.0016405485,0.027879177],"category_scores_gemma":[0.0050488194,0.00068350596,0.0011011537,0.0018028377,0.0011909492,0.0041295122,0.0019725394,0.00305179,0.0048566433],"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.0003075529,0.00014640192,0.0002227907,0.0007756199,0.000063330306,0.00017800536,0.00018833666,0.05859356,0.006639248,0.5019922,0.039552674,0.39134032],"study_design_scores_gemma":[0.00019739562,0.00006608805,0.00006692168,0.00015622354,0.00005497084,0.00019840592,0.00005143419,0.33046392,0.009766483,0.6053487,0.05359348,0.000035900965],"about_ca_topic_score_codex":0.004660924,"about_ca_topic_score_gemma":0.006437666,"teacher_disagreement_score":0.027879177,"about_ca_system_score_codex":0.0016288736,"about_ca_system_score_gemma":0.0026874025,"threshold_uncertainty_score":0.093265116},"labels":[],"label_agreement":null},{"id":"W2036975612","doi":"10.1007/978-3-540-74970-7_52","title":"Solution Counting Algorithms for Constraint-Centered Search Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Benchmark (surveying); Computer science; Exploit; Constraint (computer-aided design); Key (lock); Inference; Counting problem; Constraint programming; Search algorithm; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.052600282241201765,"score_gpt":0.2967685776612226,"score_spread":0.24416829542002083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036975612","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.0034568384,0.0005306884,0.9889414,0.00016500606,0.00008710978,0.00018500892,0.00012215707,0.0012301318,0.005281755],"genre_scores_gemma":[0.039056845,0.00038360173,0.9543443,0.00020151759,0.00006568682,0.00045999582,0.0006097074,0.0005428329,0.0043355455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963187,0.0013188676,0.00023033695,0.0005304436,0.0011521021,0.0004495758],"domain_scores_gemma":[0.989239,0.0073126783,0.0005243114,0.0014147715,0.0012372616,0.00027194014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003812733,0.002243755,0.0026400778,0.0035053836,0.001452091,0.0034794062,0.006596986,0.0026965942,0.017324805],"category_scores_gemma":[0.021725986,0.0017575794,0.0019030899,0.007672381,0.0014053409,0.0056398436,0.0028982372,0.004774964,0.0036950025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041683708,0.00039722407,0.0005105385,0.0005160959,0.00011250378,0.000069261485,0.00016630975,0.2512099,0.0023326236,0.12823682,0.022804629,0.5932272],"study_design_scores_gemma":[0.00009657919,0.000060991417,0.00014119394,0.000076406905,0.000043800832,0.000050580205,0.000033515014,0.90695155,0.0017293252,0.08589337,0.0048984247,0.00002429243],"about_ca_topic_score_codex":0.0054374496,"about_ca_topic_score_gemma":0.008464715,"teacher_disagreement_score":0.017324805,"about_ca_system_score_codex":0.0028327908,"about_ca_system_score_gemma":0.0038024508,"threshold_uncertainty_score":0.057957232},"labels":[],"label_agreement":null},{"id":"W203732173","doi":"10.1007/978-3-319-09584-4_6","title":"Evaluating Instance Generators by Configuration","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Benchmark (surveying); Generator (circuit theory); Metric (unit); Computer science; Solver; Satisfiability; Set (abstract data type); Development (topology); Boolean satisfiability problem; Theoretical computer science; Artificial intelligence; Algorithm; Programming language; Mathematics; Power (physics); Engineering","score_opus":0.029301859252895888,"score_gpt":0.2975607159534128,"score_spread":0.2682588567005169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203732173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3399439,0.008676419,0.5652923,0.0033244716,0.0015539688,0.00087829767,0.0058376743,0.05560832,0.01888463],"genre_scores_gemma":[0.73135597,0.0010120918,0.24336386,0.00067728333,0.0004886922,0.0003096134,0.012880827,0.0028793344,0.007032361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537486,0.0017431625,0.00024847314,0.0012459502,0.0011328191,0.00025476023],"domain_scores_gemma":[0.9790075,0.016249696,0.00051182427,0.0029273604,0.0007230085,0.0005805897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004255171,0.0026730974,0.0022975872,0.0034502822,0.00056109886,0.0030259225,0.004198576,0.0030875527,0.01085392],"category_scores_gemma":[0.02189623,0.0011558154,0.0019859239,0.0022491778,0.0010943532,0.005007031,0.0018211337,0.0030706208,0.0038981948],"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.002121467,0.00081195764,0.011232925,0.00053929683,0.0006114689,0.00053176837,0.00007958916,0.25512424,0.006903066,0.009770966,0.04531065,0.6669626],"study_design_scores_gemma":[0.00015282666,0.00026261623,0.0009849143,0.00005738421,0.00014496519,0.00027321314,0.00004100525,0.964895,0.007739707,0.022912242,0.002509397,0.000026711294],"about_ca_topic_score_codex":0.001841275,"about_ca_topic_score_gemma":0.002961011,"teacher_disagreement_score":0.01085392,"about_ca_system_score_codex":0.0014902069,"about_ca_system_score_gemma":0.0015376485,"threshold_uncertainty_score":0.036309958},"labels":[],"label_agreement":null},{"id":"W20386448","doi":"10.1007/978-3-319-07230-2_53","title":"Body Image and Body Schema: Interaction Design for and through Embodied Cognition","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Action Observation and Synchronization","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Embodied cognition; Body schema; Image schema; Perception; Cognition; Computer science; Schema (genetic algorithms); Realm; Cognitive science; Perspective (graphical); Human–computer interaction; Cognitive psychology; Psychology; Artificial intelligence","score_opus":0.04909531501787774,"score_gpt":0.32363719553416376,"score_spread":0.27454188051628603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20386448","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06684632,0.0015136291,0.8764769,0.0009054869,0.0001084864,0.0000803578,0.000079608835,0.0006719379,0.05331731],"genre_scores_gemma":[0.7055314,0.0012557852,0.26642922,0.0001730791,0.00003260995,0.00031404573,0.00013106928,0.0003630093,0.02576975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.00013620837,0.0000136725475,0.000054712837,0.000063184634,0.000021513079],"domain_scores_gemma":[0.99964046,0.0002455507,0.00001813805,0.00003912505,0.00003186063,0.000024969066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615122,0.00038613298,0.00021558056,0.00020475178,0.00026895912,0.0020424274,0.00066619355,0.00065905537,0.010664382],"category_scores_gemma":[0.0017285642,0.00028774265,0.00032896543,0.0002125541,0.0011863902,0.0022865857,0.0014767351,0.0006410598,0.0009697423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004191279,0.0001487993,0.0028445264,0.0010972369,0.00010788051,0.00047975,0.027174303,0.0075512026,0.09512289,0.35775855,0.006667167,0.5006286],"study_design_scores_gemma":[0.00026967417,0.0006840977,0.019170696,0.0010986554,0.0004738371,0.0028010753,0.01679582,0.10553896,0.06965672,0.53519154,0.24811764,0.0002012934],"about_ca_topic_score_codex":0.00038852397,"about_ca_topic_score_gemma":0.00049172586,"teacher_disagreement_score":0.010664382,"about_ca_system_score_codex":0.0002673482,"about_ca_system_score_gemma":0.00026107082,"threshold_uncertainty_score":0.035675883},"labels":[],"label_agreement":null},{"id":"W2038890262","doi":"10.1007/11557432_14","title":"Representing and Applying Design Patterns: What Is the Problem?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering and Design Patterns","field":"Social Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science","score_opus":0.03164773738064358,"score_gpt":0.27302970602942306,"score_spread":0.24138196864877948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038890262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018025601,0.017433923,0.8300338,0.114806674,0.00074953615,0.00037708477,0.0006274224,0.0018903913,0.0160556],"genre_scores_gemma":[0.13065293,0.020867467,0.831601,0.005883208,0.0009931508,0.00051462644,0.0008450879,0.0006753038,0.007967232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9759822,0.0121530825,0.0020195267,0.0029835114,0.0059088403,0.00095274305],"domain_scores_gemma":[0.89934844,0.0631756,0.0051785987,0.017501924,0.01309072,0.0017047038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03151315,0.0016722415,0.0023623146,0.004478282,0.0022806711,0.018747408,0.0068907407,0.007902351,0.0069589335],"category_scores_gemma":[0.12310361,0.0019461467,0.0019064803,0.008472315,0.009355957,0.07090304,0.006486705,0.0062648715,0.0040517743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088347966,0.0003512854,0.0056598317,0.00240124,0.00017797727,0.00016128835,0.0063353023,0.004505912,0.0008593973,0.18294924,0.024661802,0.7718484],"study_design_scores_gemma":[0.000053752734,0.000086528315,0.0012387796,0.0018724182,0.000120269884,0.0010434317,0.008686893,0.030169686,0.0013895397,0.86271334,0.09251946,0.00010595697],"about_ca_topic_score_codex":0.007126542,"about_ca_topic_score_gemma":0.0072756023,"teacher_disagreement_score":0.03151315,"about_ca_system_score_codex":0.002056933,"about_ca_system_score_gemma":0.005941289,"threshold_uncertainty_score":0.16665947},"labels":[],"label_agreement":null},{"id":"W204239758","doi":"10.1007/978-3-319-10590-1_22","title":"Probabilistic Temporal Head Pose Estimation Using a Hierarchical Graphical Model","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Pose; Graphical model; Probabilistic logic; Classifier (UML); Pattern recognition (psychology); Hierarchical database model; Feature (linguistics); Statistical model; Face (sociological concept); Computer vision; Data mining","score_opus":0.031243916756723965,"score_gpt":0.27739531072781887,"score_spread":0.2461513939710949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204239758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027861882,0.00015694974,0.9956993,0.00006240875,0.000021006976,0.000014964136,0.00015228683,0.0007246712,0.00038226382],"genre_scores_gemma":[0.35092813,0.0010085402,0.63764817,0.00030795397,0.0002001038,0.00021166456,0.0023246463,0.00064840243,0.006722383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924064,0.0001939309,0.000036117268,0.00025958795,0.0001765894,0.00009328782],"domain_scores_gemma":[0.99883574,0.00072449073,0.00009084428,0.00015035938,0.00015052265,0.000048045553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008465395,0.0010545237,0.0013934983,0.0013424885,0.0003819952,0.0009737177,0.0022097237,0.0012090057,0.0035411406],"category_scores_gemma":[0.0029212588,0.0012776544,0.0021426447,0.0016735508,0.0005728143,0.0015123147,0.0016336233,0.0017635955,0.0021926924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046452237,0.0001371228,0.0017183437,0.00020936823,0.0002895166,0.0002323118,0.00013356649,0.53702885,0.018439269,0.013554137,0.006105071,0.42168793],"study_design_scores_gemma":[0.0000074395075,0.000020116844,0.0004060445,0.0000089332,0.000028080773,0.000066541616,0.0000067574183,0.9904883,0.0012793749,0.007142582,0.0005307724,0.000015026011],"about_ca_topic_score_codex":0.01153626,"about_ca_topic_score_gemma":0.021985663,"teacher_disagreement_score":0.01153626,"about_ca_system_score_codex":0.00059480924,"about_ca_system_score_gemma":0.00096241006,"threshold_uncertainty_score":0.022938251},"labels":[],"label_agreement":null},{"id":"W204293210","doi":"10.1007/978-3-642-19861-8_6","title":"Faster Alias Set Analysis Using Summaries","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Alias; Computer science; Pointer analysis; Aliasing; Set (abstract data type); Pointer (user interface); Programming language; Static analysis; Data mining; Algorithm; Artificial intelligence","score_opus":0.06045631422111657,"score_gpt":0.28057932595178015,"score_spread":0.22012301173066356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204293210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014730904,0.0009636618,0.9159351,0.00041231108,0.00036572816,0.00031750445,0.0026249497,0.0519807,0.012669052],"genre_scores_gemma":[0.19138032,0.0006781095,0.7662464,0.00036919562,0.0003638538,0.00033647445,0.0062158885,0.008504892,0.025904927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958947,0.000560653,0.0004312908,0.0008370619,0.00191687,0.00035940128],"domain_scores_gemma":[0.99110764,0.0028202254,0.00047941567,0.0038158814,0.0015835405,0.00019332717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016772059,0.0022791037,0.0020580941,0.0062998105,0.0015603423,0.004816207,0.0027774018,0.001206118,0.04253628],"category_scores_gemma":[0.013761484,0.0015218484,0.0027935768,0.005720396,0.0007558171,0.00990048,0.004502302,0.0023169706,0.013980345],"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.000892713,0.00015381128,0.001578736,0.00073038763,0.0001712492,0.00020275499,0.00040121627,0.007853163,0.019633561,0.07600375,0.03775473,0.8546239],"study_design_scores_gemma":[0.00024190948,0.00037110317,0.0014371519,0.00042701006,0.0005986937,0.00071181136,0.0005395458,0.30287427,0.13044365,0.39716956,0.16497049,0.00021488784],"about_ca_topic_score_codex":0.0016010558,"about_ca_topic_score_gemma":0.0025648286,"teacher_disagreement_score":0.04253628,"about_ca_system_score_codex":0.0013131703,"about_ca_system_score_gemma":0.0015606907,"threshold_uncertainty_score":0.14229804},"labels":[],"label_agreement":null},{"id":"W204411587","doi":"10.1007/978-3-642-40148-0_12","title":"Distributed B-Tree with Weak Consistency","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Consistency (knowledge bases); Tree (set theory); Search engine indexing; B-tree; Cloud computing; Tree structure; R-tree; Data consistency; Distributed computing; Theoretical computer science; Data mining; Algorithm; Binary tree; Information retrieval; Mathematics; Artificial intelligence","score_opus":0.013474698375992309,"score_gpt":0.21483600062383063,"score_spread":0.20136130224783833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204411587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023700278,0.0010145251,0.96039987,0.000909708,0.00032173118,0.0001292842,0.00033987255,0.0019728886,0.01121169],"genre_scores_gemma":[0.36545503,0.0008136067,0.6151876,0.0005795287,0.00037387683,0.00032617734,0.0011307192,0.00083939015,0.015294082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984648,0.00036723213,0.00013246367,0.00024505664,0.000638713,0.00015174424],"domain_scores_gemma":[0.9953147,0.0017870569,0.00017580253,0.0017842378,0.00072444725,0.00021369176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092941,0.0004411427,0.0013059916,0.0008698845,0.0011298265,0.0019090044,0.0022759736,0.0012776058,0.0050521092],"category_scores_gemma":[0.008457703,0.0005789139,0.00055193494,0.0024921016,0.0010685882,0.0038748777,0.0033148606,0.0023650604,0.0016804849],"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.0014538373,0.00026947955,0.0011705944,0.0007038824,0.000107805194,0.00029116936,0.00031413426,0.052237764,0.015074298,0.46122032,0.034222744,0.43293387],"study_design_scores_gemma":[0.00026666684,0.00015798675,0.00027860134,0.00005834599,0.00007149839,0.00036269886,0.00006459563,0.24838978,0.007737617,0.72210383,0.02047809,0.000030366507],"about_ca_topic_score_codex":0.0005907442,"about_ca_topic_score_gemma":0.000662982,"teacher_disagreement_score":0.0050521092,"about_ca_system_score_codex":0.0007717965,"about_ca_system_score_gemma":0.0012524269,"threshold_uncertainty_score":0.016901016},"labels":[],"label_agreement":null},{"id":"W204746936","doi":"10.1007/978-3-642-21878-1_65","title":"Automatic MPI to AMPI Program Transformation Using Photran","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Alberta","funders":"","keywords":"Computer science; Message Passing Interface; Fortran; Parallel computing; Task (project management); Message passing; Programming language; Operating system","score_opus":0.032754610174247814,"score_gpt":0.2839519831186513,"score_spread":0.2511973729444035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204746936","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012028089,0.00012901204,0.7588888,0.0003064521,0.00038431675,0.00018798695,0.0015774133,0.18626375,0.040234238],"genre_scores_gemma":[0.20138489,0.0002549977,0.6498924,0.0005660666,0.00022941314,0.0007061255,0.006781766,0.09069519,0.049489208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993542,0.000092204864,0.000038232272,0.00009932749,0.00031020472,0.00010578641],"domain_scores_gemma":[0.99905044,0.00025253117,0.000041608615,0.00037974332,0.000233416,0.000042341435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522016,0.001176757,0.0007139539,0.0011714185,0.0011079267,0.0014775688,0.0015905118,0.0005597168,0.053018868],"category_scores_gemma":[0.0023227402,0.00070268824,0.0010374705,0.0011350272,0.00051223324,0.0013476163,0.0020611146,0.0022979665,0.025194705],"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.0007087317,0.00030090447,0.0016396152,0.00079427566,0.00015036666,0.00076040486,0.0006813096,0.016439954,0.06608032,0.063126564,0.17624448,0.67307305],"study_design_scores_gemma":[0.00037020055,0.00018431366,0.0020691098,0.00015864937,0.00014046497,0.0009993155,0.00022627693,0.2126648,0.27664936,0.08168812,0.42469802,0.00015145735],"about_ca_topic_score_codex":0.00066347286,"about_ca_topic_score_gemma":0.0009561254,"teacher_disagreement_score":0.053018868,"about_ca_system_score_codex":0.00047232152,"about_ca_system_score_gemma":0.00072265003,"threshold_uncertainty_score":0.17736578},"labels":[],"label_agreement":null},{"id":"W204776251","doi":"10.1007/978-3-642-21043-3_18","title":"Compact Features for Sentiment Analysis","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.029125070847994126,"score_gpt":0.276080730006287,"score_spread":0.2469556591582929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204776251","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.0145549,0.0012051801,0.969106,0.000227215,0.00039847003,0.00014512776,0.0028566986,0.007099667,0.0044066757],"genre_scores_gemma":[0.23272705,0.0013857489,0.73239493,0.00023636087,0.0007324608,0.0007644892,0.014541115,0.0014352709,0.015782584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953675,0.00007852975,0.0000506611,0.00010523194,0.00017856703,0.000050204188],"domain_scores_gemma":[0.99910444,0.00032690645,0.00008915468,0.00021137789,0.0002344531,0.000033668497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005385728,0.000920961,0.0008769404,0.0015876922,0.00045685473,0.0011481767,0.00068490626,0.00055519096,0.011152614],"category_scores_gemma":[0.0028653215,0.0003831367,0.00066033954,0.0021224236,0.00023082078,0.0021393837,0.0011288325,0.0010552915,0.0062542646],"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.00028792312,0.00009108027,0.0004507878,0.0002049791,0.000050941937,0.00010265354,0.000056564677,0.005133556,0.03576137,0.012478551,0.031430695,0.9139509],"study_design_scores_gemma":[0.00014121165,0.00041629758,0.004796448,0.00014889044,0.00017574376,0.00072201935,0.00014362924,0.6927676,0.05964617,0.13665298,0.10429233,0.0000966618],"about_ca_topic_score_codex":0.0005773811,"about_ca_topic_score_gemma":0.0008435899,"teacher_disagreement_score":0.011152614,"about_ca_system_score_codex":0.00028291956,"about_ca_system_score_gemma":0.0003173366,"threshold_uncertainty_score":0.03730923},"labels":[],"label_agreement":null},{"id":"W204793957","doi":"10.1007/978-3-642-22688-5_19","title":"Supporting Ontology Design through Large-Scale FCA-Based Ontology Restructuring","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université du Québec à Montréal","funders":"","keywords":"Ontology; Computer science; Restructuring; Workflow; Ontology-based data integration; Process ontology; Ontology engineering; Upper ontology; Code refactoring; Suggested Upper Merged Ontology; Software engineering; Quality (philosophy); Task (project management); Information retrieval; Database; Systems engineering; Software; Programming language; Domain knowledge; Engineering","score_opus":0.040904359418576924,"score_gpt":0.28263772378065544,"score_spread":0.2417333643620785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204793957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081945965,0.00011924692,0.9792499,0.0003057829,0.000055030345,0.00023968625,0.00040412144,0.0057905503,0.0056411377],"genre_scores_gemma":[0.09235251,0.00016500056,0.90121293,0.00014915643,0.000026114274,0.00020221245,0.0023035055,0.0013754683,0.0022131354],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962682,0.0009846837,0.00043040197,0.00053087616,0.001447726,0.00033813613],"domain_scores_gemma":[0.987939,0.004890323,0.0004284945,0.0049006664,0.0015610979,0.00028049064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004856415,0.0007877658,0.0009862126,0.0025496557,0.0024079024,0.005315648,0.0035122891,0.0012987687,0.0050768666],"category_scores_gemma":[0.019423122,0.0009930775,0.0026128166,0.003052897,0.0018078595,0.007403182,0.006601554,0.003338628,0.0019808619],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026483048,0.0005562683,0.0043078773,0.0008074609,0.0003404227,0.0009351876,0.0037403866,0.049849637,0.03933003,0.2747891,0.02994047,0.5951384],"study_design_scores_gemma":[0.00006636285,0.000041351283,0.0008688229,0.00022020591,0.00021071032,0.0005324815,0.0010531112,0.5961655,0.048995286,0.23099254,0.12076504,0.000088657085],"about_ca_topic_score_codex":0.010839324,"about_ca_topic_score_gemma":0.019742945,"teacher_disagreement_score":0.010839324,"about_ca_system_score_codex":0.0020671221,"about_ca_system_score_gemma":0.004512189,"threshold_uncertainty_score":0.025683522},"labels":[],"label_agreement":null},{"id":"W2048290165","doi":"10.1007/3-540-44499-8_21","title":"Montgomery Multiplier and Squarer in GF(2m)","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; GF(2); Multiplier (economics); Finite field; Primitive polynomial; Mathematics; Multiplication (music); Polynomial basis; Arithmetic; Discrete mathematics; Basis (linear algebra); Irreducible polynomial; Standard basis; Combinatorics; Polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.009078973731472182,"score_gpt":0.21648151473383287,"score_spread":0.2074025410023607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048290165","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13639204,0.01589508,0.27688125,0.004371244,0.0028530932,0.00017136992,0.00023040076,0.002511951,0.5606936],"genre_scores_gemma":[0.52895,0.006616627,0.12712298,0.0010266692,0.0017283127,0.00016995578,0.00019193532,0.00046176874,0.33373183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983084,0.000040443723,0.0000075691846,0.000030149356,0.000063405874,0.000027513312],"domain_scores_gemma":[0.999835,0.00007500882,0.000020062176,0.000030083507,0.000027776221,0.000012106882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022616207,0.00056333776,0.0003709762,0.0008949886,0.00062908133,0.0010616123,0.00032904884,0.0005727597,0.012831],"category_scores_gemma":[0.00096089154,0.00024067338,0.00022792767,0.00096348074,0.0010259589,0.0015286665,0.0007134879,0.0010587147,0.0044888644],"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.0003066217,0.000043788128,0.00019015146,0.0002256223,0.0000142639565,0.00056126446,0.0005016622,0.0020891193,0.02007867,0.77504677,0.020501371,0.18044068],"study_design_scores_gemma":[0.00012758057,0.0004787576,0.0007081753,0.00015197106,0.0000328816,0.0026099996,0.00015535968,0.009066498,0.038062338,0.63421947,0.3143157,0.00007128829],"about_ca_topic_score_codex":0.00027896187,"about_ca_topic_score_gemma":0.0006185807,"teacher_disagreement_score":0.012831,"about_ca_system_score_codex":0.00050053955,"about_ca_system_score_gemma":0.00037052875,"threshold_uncertainty_score":0.042923987},"labels":[],"label_agreement":null},{"id":"W2049142911","doi":"10.1007/11880240_14","title":"Package Merge in UML 2: Practice vs. Theory?","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Merge (version control); Interoperability; Unified Modeling Language; Programming language; Software engineering; Information retrieval; World Wide Web; Software","score_opus":0.009490148093058643,"score_gpt":0.24077827600386767,"score_spread":0.23128812791080902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049142911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019010512,0.006924853,0.89038396,0.01421021,0.00046613283,0.00005712499,0.000100671095,0.0033189799,0.065527685],"genre_scores_gemma":[0.40920204,0.011298877,0.54458296,0.0026929795,0.0011064283,0.00028512746,0.00046021433,0.0028841433,0.027487265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927955,0.003919722,0.00027653654,0.00069986534,0.0018993096,0.0004090127],"domain_scores_gemma":[0.9871417,0.008006576,0.000514289,0.003323945,0.0007947916,0.00021876812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009409286,0.00074242294,0.0007211489,0.0016098759,0.0009826303,0.0073366323,0.0027170442,0.0032819083,0.007743547],"category_scores_gemma":[0.019698944,0.0014389079,0.0008168653,0.0024224562,0.0052241758,0.027542463,0.0034322878,0.0043878034,0.0031546643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038585586,0.00003262926,0.00056729716,0.00019602069,0.000013736403,0.000046540215,0.0016616043,0.0025258875,0.00081919925,0.8513108,0.008165134,0.13462245],"study_design_scores_gemma":[0.00004181291,0.000090890746,0.0004982523,0.0005364191,0.000040029874,0.000493906,0.0011393998,0.024219545,0.005663152,0.81074625,0.15646712,0.000063332984],"about_ca_topic_score_codex":0.00149168,"about_ca_topic_score_gemma":0.0021914565,"teacher_disagreement_score":0.009409286,"about_ca_system_score_codex":0.0020437906,"about_ca_system_score_gemma":0.0024445483,"threshold_uncertainty_score":0.049761713},"labels":[],"label_agreement":null},{"id":"W205097626","doi":"10.1007/978-3-319-13835-0_12","title":"Analysis and Improvement of Release Readiness – A Genetic Optimization Approach","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Calgary","funders":"","keywords":"Computer science; Identification (biology); Portfolio; Software deployment; Context (archaeology); Genetic algorithm; Product (mathematics); Process (computing); Interval (graph theory); Risk analysis (engineering); Operations research; Engineering; Machine learning; Mathematics; Business","score_opus":0.009495749141357611,"score_gpt":0.22542203081375534,"score_spread":0.21592628167239772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205097626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06939003,0.0006062865,0.92274284,0.00023764155,0.000046139663,0.00013964459,0.00006943288,0.00080982264,0.0059581944],"genre_scores_gemma":[0.659286,0.00049402606,0.33604723,0.00007603597,0.00003677231,0.0001732421,0.00016778009,0.00028203978,0.0034368655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.0002708373,0.000035340036,0.00017728827,0.00028614717,0.00015769518],"domain_scores_gemma":[0.997358,0.0017603186,0.0003426123,0.00013002242,0.00035029155,0.000058699785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021910155,0.0014543724,0.0013899243,0.0024382644,0.0005832143,0.001356148,0.0016857585,0.0013675081,0.0024838687],"category_scores_gemma":[0.005534834,0.00078027154,0.0018280265,0.0017086717,0.00080535456,0.0012506311,0.00068862055,0.0014045018,0.00041121608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057886024,0.00008407536,0.00071348046,0.00006858079,0.000046589215,0.000044127835,0.00004038645,0.9468331,0.0032028027,0.0041348925,0.00031601934,0.044458065],"study_design_scores_gemma":[0.0000071065415,0.000048472553,0.0003037004,0.000009399441,0.000029768189,0.000016090742,0.00001459559,0.99700934,0.0008794808,0.0014889406,0.000186274,0.0000068389627],"about_ca_topic_score_codex":0.0075778584,"about_ca_topic_score_gemma":0.0040044067,"teacher_disagreement_score":0.0075778584,"about_ca_system_score_codex":0.0013970374,"about_ca_system_score_gemma":0.0021259745,"threshold_uncertainty_score":0.015067518},"labels":[],"label_agreement":null},{"id":"W205148524","doi":"10.1007/978-3-642-34281-3_11","title":"Quantitative Analysis of Information Flow Using Theorem Proving","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Information leakage; Computer science; Information flow; Anonymity; Leakage (economics); Theoretical computer science; Information theory; Measure (data warehouse); Automated theorem proving; Divergence (linguistics); Data mining; Computer security; Mathematics; Statistics","score_opus":0.03273897725590663,"score_gpt":0.2801080632057037,"score_spread":0.24736908594979706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205148524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036379294,0.00026126855,0.99175733,0.00021936068,0.000028149081,0.00006445017,0.00010835886,0.00035014647,0.0035729434],"genre_scores_gemma":[0.37230605,0.0012295133,0.61998975,0.0002175248,0.00028359098,0.00050213584,0.00051740377,0.00047532833,0.0044785812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99090415,0.0035408358,0.00046866818,0.0010924238,0.0034056122,0.0005882196],"domain_scores_gemma":[0.9597936,0.031859253,0.0012538205,0.00488349,0.0018893282,0.0003204915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008196019,0.0014634806,0.0014737711,0.0031422458,0.0010177371,0.00409135,0.0034070313,0.0010250839,0.007848063],"category_scores_gemma":[0.030960854,0.0011698741,0.0024227456,0.0022989516,0.0044400506,0.010157253,0.0022124788,0.0035457655,0.00083853054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000701303,0.00008819587,0.0004209464,0.0004346385,0.00006914709,0.000052320993,0.00014477625,0.062724605,0.0027218326,0.8883042,0.0014372667,0.043531958],"study_design_scores_gemma":[0.000016418455,0.0000341871,0.00018732423,0.00005125948,0.000034105753,0.000041677158,0.000021434626,0.2294347,0.0038502659,0.7641736,0.0021350584,0.000019990817],"about_ca_topic_score_codex":0.0009861998,"about_ca_topic_score_gemma":0.00060069584,"teacher_disagreement_score":0.008196019,"about_ca_system_score_codex":0.0026591618,"about_ca_system_score_gemma":0.0021460033,"threshold_uncertainty_score":0.043345153},"labels":[],"label_agreement":null},{"id":"W2054624343","doi":"10.1007/978-3-540-73074-3_8","title":"Software Implementation of Arithmetic in","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Arithmetic; Software; Programming language; Parallel computing; Operating system; Mathematics","score_opus":0.01772805092297768,"score_gpt":0.28099584037428516,"score_spread":0.26326778945130747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054624343","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.019136865,0.00067045883,0.9171646,0.000280971,0.0003493774,0.000089536996,0.00017487213,0.013806349,0.048327025],"genre_scores_gemma":[0.3461953,0.0010836854,0.5848401,0.0005053037,0.00020970206,0.00025717972,0.0011326175,0.0029401786,0.06283583],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921584,0.00014800328,0.000061252555,0.00011296388,0.00036410976,0.000097855824],"domain_scores_gemma":[0.99933356,0.0001874272,0.000033709093,0.00023137989,0.00019245871,0.000021368502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533451,0.0007789885,0.00049200223,0.000716796,0.0004961002,0.0023262203,0.0012972412,0.00072097644,0.013483375],"category_scores_gemma":[0.0018024637,0.00045140358,0.00060109125,0.0007528971,0.00066401303,0.0020043575,0.0011156789,0.0010264922,0.00509445],"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.00038101999,0.00015645554,0.0007821651,0.0005334439,0.000075591044,0.0002817605,0.00062672584,0.0109015815,0.048314247,0.39896747,0.027770275,0.51120937],"study_design_scores_gemma":[0.00019518308,0.00027749763,0.00089965406,0.0003425099,0.00016608584,0.0009592183,0.00016638976,0.19169235,0.21311347,0.22165868,0.37044492,0.00008415857],"about_ca_topic_score_codex":0.0006010741,"about_ca_topic_score_gemma":0.0007492776,"teacher_disagreement_score":0.013483375,"about_ca_system_score_codex":0.00054594956,"about_ca_system_score_gemma":0.0007835799,"threshold_uncertainty_score":0.04510641},"labels":[],"label_agreement":null},{"id":"W205596015","doi":"10.1007/978-3-642-04238-6_65","title":"Optimal Multicore Scheduling: An Application of ASP Techniques","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Computer science; Multi-core processor; Solver; Scheduling (production processes); Graph; Vertex cover; Answer set programming; Parallel computing; Theoretical computer science; Set (abstract data type); Mathematical optimization; Programming language; Mathematics","score_opus":0.017391979314482327,"score_gpt":0.2668498456944376,"score_spread":0.24945786637995526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205596015","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.010132237,0.0006206677,0.9699725,0.00028952555,0.00017700098,0.000069438436,0.00011587722,0.0014874213,0.017135331],"genre_scores_gemma":[0.1647815,0.0008178678,0.8274496,0.00015457995,0.00020417439,0.00009301667,0.000236195,0.00054569653,0.005717261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00014442138,0.000048461363,0.000097984026,0.00024884313,0.00008351393],"domain_scores_gemma":[0.9990231,0.0005238376,0.00005833821,0.0002185336,0.00012977864,0.000046336354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011024751,0.0009367852,0.0009811256,0.00077118335,0.0010201436,0.0017006333,0.0016931727,0.0008016679,0.006268566],"category_scores_gemma":[0.0025958747,0.0005543798,0.00096159434,0.0018989334,0.00057737314,0.0019747438,0.0013917563,0.0017893687,0.0007887483],"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.00036081157,0.00021090446,0.0006293977,0.0003443604,0.00008166412,0.00014289767,0.0001548894,0.32962117,0.006990184,0.19616333,0.013952005,0.45134845],"study_design_scores_gemma":[0.00004271587,0.000037375557,0.00012301766,0.000020751251,0.000029632469,0.00007431153,0.000028207818,0.8616329,0.0024597256,0.12730281,0.008238362,0.000010158282],"about_ca_topic_score_codex":0.0034006224,"about_ca_topic_score_gemma":0.0059657237,"teacher_disagreement_score":0.006268566,"about_ca_system_score_codex":0.0010590648,"about_ca_system_score_gemma":0.0015666628,"threshold_uncertainty_score":0.020970404},"labels":[],"label_agreement":null},{"id":"W2056558440","doi":"10.1007/978-3-642-33542-6_53","title":"The Empathy Machine","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Conversation; Empathy; Computer science; Visitor pattern; Interpersonal communication; Facial expression; Key (lock); Human–computer interaction; Component (thermodynamics); State (computer science); Multimedia; Artificial intelligence; Psychology; Communication; Social psychology; Computer security; Programming language","score_opus":0.028483168839261983,"score_gpt":0.29263969774119575,"score_spread":0.26415652890193375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056558440","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017217468,0.008486863,0.7059058,0.010828497,0.0016074752,0.000106976564,0.00087644643,0.0034547085,0.25151584],"genre_scores_gemma":[0.49631023,0.0042297,0.28434843,0.0021229372,0.0011764079,0.00035351457,0.0019135948,0.0007295029,0.20881559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.00014303255,0.000015621856,0.00014277987,0.000084132225,0.00004189398],"domain_scores_gemma":[0.99942005,0.00031841017,0.000023014687,0.00014736629,0.000058880076,0.00003235516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005200692,0.0005633574,0.00042648465,0.00068638794,0.0008048671,0.001742403,0.0007412667,0.0011807054,0.027960854],"category_scores_gemma":[0.0030482274,0.0002566526,0.0005003869,0.00052754756,0.0013541332,0.0036329771,0.0020381343,0.0016640748,0.00715709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274886,0.000047671714,0.00071362837,0.000107799846,0.000022222133,0.000060933693,0.00017049134,0.0041739205,0.0012130305,0.3868418,0.064278625,0.5423072],"study_design_scores_gemma":[0.000013830726,0.00003264416,0.0009985012,0.00009187765,0.000023488701,0.0002439167,0.00013544662,0.06975198,0.003145148,0.76256996,0.16297036,0.00002285448],"about_ca_topic_score_codex":0.00053183804,"about_ca_topic_score_gemma":0.0005470648,"teacher_disagreement_score":0.027960854,"about_ca_system_score_codex":0.0004412283,"about_ca_system_score_gemma":0.00042594792,"threshold_uncertainty_score":0.0935384},"labels":[],"label_agreement":null},{"id":"W205730280","doi":"10.1007/978-3-642-21070-9_24","title":"Splitting Atoms in Relational Algebras","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Brock University","funders":"","keywords":"Bijection, injection and surjection; Identity (music); Relation (database); Computer science; Algebra over a field; Mathematics; Pure mathematics; Discrete mathematics; Bijection; Physics; Data mining","score_opus":0.017610534335305114,"score_gpt":0.22606149864555242,"score_spread":0.2084509643102473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205730280","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.09999946,0.0058677285,0.61890525,0.0027844412,0.000906729,0.00020049352,0.0006847122,0.0012505018,0.26940066],"genre_scores_gemma":[0.68984044,0.0036766948,0.21572895,0.00081493746,0.00065674,0.00021279523,0.0015022216,0.00067998416,0.086887166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990201,0.0002503809,0.000079433834,0.00017204226,0.00036617668,0.00011186636],"domain_scores_gemma":[0.99931574,0.00027455259,0.000038946335,0.00016808642,0.00014881552,0.00005387634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012368602,0.00065088074,0.00097576453,0.0014943036,0.002001281,0.0027164035,0.0013262224,0.0008773061,0.011714101],"category_scores_gemma":[0.0017199725,0.0010189222,0.0011629243,0.0024808827,0.0027117324,0.008788733,0.0023356937,0.0033329069,0.0027170922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139743515,0.000010995027,0.000043800504,0.000027355522,0.0000063547013,0.000020739319,0.00020448917,0.00024746874,0.00042804988,0.98811275,0.0013385906,0.009545474],"study_design_scores_gemma":[0.000005187459,0.000005134485,0.000031792228,0.00000962034,0.000006792662,0.00002988652,0.00005066352,0.0012398508,0.00036951166,0.99162126,0.0066250013,0.0000052838936],"about_ca_topic_score_codex":0.0011975471,"about_ca_topic_score_gemma":0.0011020766,"teacher_disagreement_score":0.011714101,"about_ca_system_score_codex":0.0014271534,"about_ca_system_score_gemma":0.00062250363,"threshold_uncertainty_score":0.03918755},"labels":[],"label_agreement":null},{"id":"W2058849440","doi":"10.1007/978-3-642-20036-6_10","title":"A Probabilistic Model for Sequence Alignment with Context-Sensitive Indels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Indel; Alignment-free sequence analysis; Multiple sequence alignment; Probabilistic logic; Context (archaeology); Hidden Markov model; Context-free grammar; Markov chain; Sequence (biology); Tree (set theory); Statistical model; Artificial intelligence; Graphical model; Sequence alignment; Data mining; Rule-based machine translation; Machine learning; Genetics; Mathematics; Biology","score_opus":0.033105788016500985,"score_gpt":0.24180414992670565,"score_spread":0.20869836191020466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058849440","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.003400724,0.00034569565,0.99458164,0.00023531652,0.000051888062,0.000042224303,0.00026830556,0.00054726243,0.00052692794],"genre_scores_gemma":[0.27616593,0.0022232316,0.7022022,0.00067644456,0.00069197937,0.0012457968,0.00296642,0.001226313,0.012601724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996089,0.0014908885,0.0002821701,0.0010649755,0.00078078505,0.00029231506],"domain_scores_gemma":[0.98435867,0.012793057,0.00071598205,0.0011666565,0.00067992933,0.00028572645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006621365,0.001623232,0.0038104355,0.0022345835,0.0015680536,0.0032321434,0.0080605,0.004713747,0.0063643334],"category_scores_gemma":[0.019438952,0.002589123,0.0035156705,0.004188339,0.0027804435,0.0073844627,0.0036219745,0.0046723285,0.0027048835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024736582,0.00008437116,0.00078942504,0.00026121308,0.00015817316,0.00024900225,0.0002003755,0.7673575,0.0016198328,0.1752536,0.0029632775,0.050815847],"study_design_scores_gemma":[0.00001785203,0.000019453688,0.00008817616,0.000013872912,0.00002584719,0.00006164506,0.000006583266,0.8743919,0.00025185497,0.12434091,0.0007587265,0.000023204011],"about_ca_topic_score_codex":0.0060405694,"about_ca_topic_score_gemma":0.0073422072,"teacher_disagreement_score":0.0080605,"about_ca_system_score_codex":0.0020283975,"about_ca_system_score_gemma":0.002045609,"threshold_uncertainty_score":0.03501755},"labels":[],"label_agreement":null},{"id":"W2060701768","doi":"10.1007/978-3-540-85209-4_23","title":"A Prediction Based Cross-Layer MAC/PHY Interface for CDMA Ad Hoc Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; PHY; Computer network; Wireless ad hoc network; Quality of service; Physical layer; Code division multiple access; Media access control; Access control; Vehicular ad hoc network; Interference (communication); Channel (broadcasting); Distributed computing; Wireless; Telecommunications","score_opus":0.04567971231807329,"score_gpt":0.310166660195523,"score_spread":0.26448694787744975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060701768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012525057,0.00080657576,0.96872544,0.00019972262,0.0004640246,0.00018791268,0.00012388601,0.01144784,0.0055195773],"genre_scores_gemma":[0.45338812,0.0007787603,0.51883334,0.00071652094,0.00043552296,0.00034604853,0.00063626515,0.00062823,0.024237325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995136,0.00010844185,0.000030458563,0.00007155432,0.00021552645,0.00006031946],"domain_scores_gemma":[0.9991959,0.00024339028,0.00003460638,0.00016248999,0.00031426712,0.00004940823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012164725,0.00060342293,0.00060810836,0.0004472108,0.0005532715,0.0010407789,0.0016683683,0.00067151873,0.007817094],"category_scores_gemma":[0.0016909658,0.00039279336,0.00023944929,0.00032169712,0.00028503244,0.0007705127,0.00076867815,0.0014973405,0.0022736737],"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.0012724382,0.00069924525,0.002145837,0.00021492275,0.00014396697,0.0002979832,0.00021542837,0.07390473,0.112285815,0.025762893,0.042771384,0.74028534],"study_design_scores_gemma":[0.000055331147,0.00025172837,0.0006182074,0.000022334621,0.000051064235,0.00015666315,0.000018991157,0.9533745,0.028334,0.0034816607,0.013603701,0.000031774853],"about_ca_topic_score_codex":0.0026336773,"about_ca_topic_score_gemma":0.0033921136,"teacher_disagreement_score":0.007817094,"about_ca_system_score_codex":0.00047700666,"about_ca_system_score_gemma":0.0006002657,"threshold_uncertainty_score":0.026150763},"labels":[],"label_agreement":null},{"id":"W2061420542","doi":"10.1007/11557432_8","title":"UML Vs. Classical Vs. Rhapsody Statecharts: Not All Models Are Created Equal","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"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":"Technische Universität München","keywords":"Rotation formalisms in three dimensions; Formalism (music); Computer science; Unified Modeling Language; Programming language; Theoretical computer science; Artificial intelligence; Natural language processing; Mathematics; Software","score_opus":0.05355840429574359,"score_gpt":0.29486514653325696,"score_spread":0.24130674223751336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061420542","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.026344186,0.0036493079,0.7904265,0.010461796,0.0010997624,0.0000885477,0.00046250646,0.00445239,0.16301507],"genre_scores_gemma":[0.6564128,0.0033393933,0.27687994,0.0022209266,0.0004701818,0.00020077742,0.0007211356,0.0017647606,0.05799015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972692,0.0012380709,0.00012414125,0.0005326298,0.0006241771,0.00021179116],"domain_scores_gemma":[0.9948795,0.002516837,0.0002687691,0.0015288633,0.0005496543,0.00025631068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040077535,0.00041483404,0.00038080607,0.0006293698,0.00080895924,0.0040269564,0.0010865161,0.0010791374,0.007420133],"category_scores_gemma":[0.01018953,0.0004454247,0.0005014366,0.0007032881,0.0037042547,0.011647619,0.0021464056,0.0017513984,0.0021850097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043057462,0.0000079842675,0.00017109257,0.0000819586,0.000008410323,0.000021746604,0.00038610265,0.0009816862,0.0007897942,0.94615614,0.0055733784,0.045778617],"study_design_scores_gemma":[0.000020930682,0.00003228787,0.0002038536,0.00010274176,0.000035109206,0.000113942086,0.00019060775,0.0062506134,0.003839161,0.8917078,0.09748367,0.000019253877],"about_ca_topic_score_codex":0.0015936533,"about_ca_topic_score_gemma":0.0017442561,"teacher_disagreement_score":0.007420133,"about_ca_system_score_codex":0.001422554,"about_ca_system_score_gemma":0.0015015805,"threshold_uncertainty_score":0.024822772},"labels":[],"label_agreement":null},{"id":"W2061434485","doi":"10.1007/978-3-642-31454-4_28","title":"Automating the Modeling of Learners’ Erroneous Behaviors in Model-Tracing Tutors","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Tracing; Human–computer interaction; Artificial intelligence; Programming language; Software engineering","score_opus":0.030792139576008647,"score_gpt":0.2591446919094001,"score_spread":0.22835255233339144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061434485","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.17390294,0.000111761554,0.813947,0.00018857307,0.00004782766,0.00015773234,0.00015147215,0.010164794,0.0013279166],"genre_scores_gemma":[0.86392283,0.000056429708,0.1338614,0.000044639528,0.000009506734,0.00008034771,0.00017895226,0.00044016624,0.00140571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794525,0.00078910193,0.00014747602,0.00048275676,0.00049810694,0.00013729665],"domain_scores_gemma":[0.98757577,0.0069526914,0.0011446035,0.002061118,0.0019167499,0.00034916963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026177245,0.001189727,0.0011204302,0.0007905738,0.00055047835,0.0020530508,0.002675009,0.001410143,0.002196047],"category_scores_gemma":[0.023150774,0.0006754842,0.00066341565,0.0004078199,0.0006572655,0.002276452,0.0025350861,0.0018142642,0.0007302347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012005081,0.00047116276,0.031058712,0.00029949,0.00016119675,0.00046335737,0.002469643,0.66804427,0.021833723,0.0076428275,0.0022803792,0.26407477],"study_design_scores_gemma":[0.000009395809,0.00003952469,0.0004024694,0.000008996138,0.00001654247,0.0000348709,0.000039608723,0.9909055,0.006383547,0.0017938529,0.00035649518,0.000009043716],"about_ca_topic_score_codex":0.008316668,"about_ca_topic_score_gemma":0.007015053,"teacher_disagreement_score":0.008316668,"about_ca_system_score_codex":0.0013749446,"about_ca_system_score_gemma":0.002251932,"threshold_uncertainty_score":0.016536534},"labels":[],"label_agreement":null},{"id":"W2062254807","doi":"10.1007/3-540-36124-3_11","title":"An Extended Alternating-Offers Bargaining Protocol for Automated Negotiation in Multi-agent Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Negotiation; Computer science; Protocol (science); Context (archaeology); Law","score_opus":0.06171737930374424,"score_gpt":0.3294013823257079,"score_spread":0.2676840030219637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062254807","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.004960083,0.00019919607,0.98737866,0.00022234394,0.00014674048,0.00024612425,0.000080474354,0.0005373537,0.0062289927],"genre_scores_gemma":[0.18913014,0.00042823094,0.79585433,0.00019308196,0.00014575118,0.00091798976,0.0003654068,0.00023970935,0.012725339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963491,0.0018990969,0.0002681904,0.0003170935,0.00093997864,0.00022649553],"domain_scores_gemma":[0.99709857,0.0016059902,0.00012339416,0.0006042977,0.0003931625,0.00017460146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004994361,0.00089344435,0.0013052666,0.0006604579,0.0017723553,0.0028302316,0.0046376446,0.0020420076,0.008882241],"category_scores_gemma":[0.007651574,0.0006785299,0.0009858608,0.0012712816,0.0015574027,0.0053160214,0.0039052332,0.0033287816,0.001720657],"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.00072171335,0.0002614776,0.0002026952,0.00038775013,0.000114848284,0.0004672474,0.0008502171,0.14876267,0.0067850538,0.655234,0.010184796,0.1760275],"study_design_scores_gemma":[0.00020685868,0.00011183255,0.00008747003,0.00006247464,0.00006487772,0.00017986272,0.00008162789,0.69370455,0.002887688,0.27870625,0.023846578,0.000059929916],"about_ca_topic_score_codex":0.001159571,"about_ca_topic_score_gemma":0.0012546118,"teacher_disagreement_score":0.008882241,"about_ca_system_score_codex":0.0008389697,"about_ca_system_score_gemma":0.0020167746,"threshold_uncertainty_score":0.029714108},"labels":[],"label_agreement":null},{"id":"W2062256","doi":"10.1007/978-3-642-39437-9_6","title":"Towards Interoperable BioNLP Semantic Web Services Using the SADI Framework","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 New Brunswick","funders":"","keywords":"Interoperability; Computer science; Semantic Web; Information retrieval; World Wide Web; Semantic interoperability; Biomedical text mining; Natural language processing; Text mining","score_opus":0.07640220972441282,"score_gpt":0.34037073427635156,"score_spread":0.26396852455193875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062256","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.004908944,0.0008395911,0.9534297,0.0012113707,0.00043597867,0.0002116858,0.0016480046,0.021834629,0.0154800955],"genre_scores_gemma":[0.045882873,0.0018831915,0.92166615,0.0010252283,0.00014114802,0.00038990655,0.015167239,0.0041127237,0.009731498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985359,0.00026149326,0.00019479415,0.00022838275,0.0006190498,0.00016039232],"domain_scores_gemma":[0.99858403,0.0003804846,0.00008221109,0.00046638848,0.0003052378,0.00018160684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053063277,0.0010683363,0.0013203293,0.0023317703,0.0012775498,0.006109419,0.0029910326,0.002094497,0.0038573418],"category_scores_gemma":[0.0038117298,0.0009502464,0.0020844133,0.0027109433,0.0015474468,0.0060744407,0.00656513,0.0042149955,0.0048294165],"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.0006102875,0.000553166,0.001392158,0.0010930498,0.0002699048,0.0013846834,0.0017296143,0.018243864,0.036577243,0.5952336,0.067790404,0.27512202],"study_design_scores_gemma":[0.00011584804,0.0000607275,0.00058257824,0.0003513346,0.0001700994,0.0006712069,0.0005613032,0.15911731,0.030330086,0.34642002,0.46149075,0.0001286229],"about_ca_topic_score_codex":0.004823265,"about_ca_topic_score_gemma":0.0055582924,"teacher_disagreement_score":0.006109419,"about_ca_system_score_codex":0.0013787649,"about_ca_system_score_gemma":0.0029305094,"threshold_uncertainty_score":0.02806288},"labels":[],"label_agreement":null},{"id":"W2062592724","doi":"10.1007/978-3-540-25940-4_31","title":"Design of Walking Gaits for Tao-Pie-Pie, a Small Humanoid Robot","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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 Manitoba","funders":"","keywords":"Gyroscope; Computer science; Robot; Humanoid robot; Gait; Computer vision; SIGNAL (programming language); Artificial intelligence; Simulation; Engineering","score_opus":0.022668831660836823,"score_gpt":0.2174705857599863,"score_spread":0.19480175409914946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062592724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06273269,0.00030865028,0.931007,0.00008931386,0.000053430093,0.0002616752,0.00007900915,0.00060754566,0.004860574],"genre_scores_gemma":[0.57927376,0.00030367373,0.4162073,0.000053273914,0.000012704473,0.0004911728,0.00017548272,0.00011437647,0.0033682738],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994755,0.0000099642275,0.0000053511358,0.000013511473,0.000015982427,0.000007670311],"domain_scores_gemma":[0.99990547,0.000018444194,0.000015514206,0.000012116377,0.000029294757,0.000019179679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018611482,0.00043888693,0.00034408557,0.00037227818,0.0002960841,0.00022637997,0.00046663874,0.0003894293,0.0022689947],"category_scores_gemma":[0.00039044657,0.00028655888,0.00026258384,0.00023228097,0.00020297282,0.00020228927,0.0003424643,0.00025633004,0.0005048234],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039707203,0.00023341503,0.0016260929,0.0010144939,0.000087776905,0.0005017379,0.00034987522,0.23910192,0.3103473,0.017281225,0.0040187826,0.4250403],"study_design_scores_gemma":[0.00016286175,0.001057279,0.0018828559,0.00008273606,0.00006372858,0.00066570105,0.00012283068,0.95673966,0.020458162,0.0073658815,0.011362804,0.000035526762],"about_ca_topic_score_codex":0.0006037427,"about_ca_topic_score_gemma":0.0013123496,"teacher_disagreement_score":0.0022689947,"about_ca_system_score_codex":0.00012401008,"about_ca_system_score_gemma":0.00038411227,"threshold_uncertainty_score":0.0075905323},"labels":[],"label_agreement":null},{"id":"W206307230","doi":"10.1007/978-3-642-23866-6_12","title":"Detecting Separation of Moving Objects Based on Non-parametric Bayesian Scheme for Tracking by Particle Filter","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Particle filter; Computer vision; Computer science; Tracking (education); Object (grammar); Artificial intelligence; Parametric statistics; Video tracking; Separation (statistics); Object detection; Scheme (mathematics); Filter (signal processing); Bayesian probability; Group (periodic table); Process (computing); Pattern recognition (psychology); Mathematics; Machine learning; Physics","score_opus":0.024333563301011035,"score_gpt":0.2610276205054576,"score_spread":0.23669405720444656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206307230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027407126,0.00017036877,0.9966595,0.000018892477,0.000020977099,0.00001154897,0.000009587425,0.00013224207,0.00023611508],"genre_scores_gemma":[0.14572592,0.00078935287,0.8501314,0.000062828985,0.000060342285,0.00007752257,0.00022534389,0.000071176575,0.0028560944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992343,0.0001311362,0.00005153761,0.00021187584,0.00031432,0.000056735505],"domain_scores_gemma":[0.9993099,0.00032065582,0.00007542984,0.00011348484,0.00015711981,0.000023383125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278501,0.0007385834,0.0014605675,0.00090365554,0.0004457981,0.0011431827,0.0014968015,0.0016867075,0.00093568256],"category_scores_gemma":[0.0026132318,0.0007356878,0.0011110187,0.0013075715,0.0005761401,0.0019068668,0.0013964177,0.0015116826,0.0005333076],"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.00038208353,0.00015475451,0.0015809456,0.0003703587,0.00020261998,0.00016850767,0.00020946792,0.18544957,0.06902094,0.022839462,0.0028090477,0.7168123],"study_design_scores_gemma":[0.000013462712,0.000045467514,0.0006387498,0.000010234606,0.000034484856,0.00013494687,0.000009889824,0.9835185,0.008301665,0.006047965,0.0012204254,0.000024248555],"about_ca_topic_score_codex":0.0021435632,"about_ca_topic_score_gemma":0.0019840854,"teacher_disagreement_score":0.0021435632,"about_ca_system_score_codex":0.00047202987,"about_ca_system_score_gemma":0.00082643435,"threshold_uncertainty_score":0.005964756},"labels":[],"label_agreement":null},{"id":"W2064449485","doi":"10.1007/978-3-642-13495-1_50","title":"Biogeography Migration Algorithm for Traveling Salesman Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"Department of National Defence","funders":"","keywords":"Travelling salesman problem; Computer science; Algorithm; Mathematical optimization; Optimization problem; Operator (biology); Optimization algorithm; Mathematics","score_opus":0.019123667480578303,"score_gpt":0.26789473001227876,"score_spread":0.24877106253170045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064449485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058523577,0.002360812,0.90750337,0.0007493223,0.0005916535,0.0001522605,0.000120970595,0.00087968,0.029118406],"genre_scores_gemma":[0.3520959,0.0016887975,0.6187093,0.0002330317,0.00016778226,0.00038662893,0.00047501325,0.00021325934,0.026030358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990726,0.000020450214,0.0000046384243,0.000023088336,0.000028744997,0.00001588099],"domain_scores_gemma":[0.9999279,0.000023174778,0.000006878346,0.000007341182,0.000026955611,0.000007784055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948908,0.0004921132,0.0006893428,0.0005659102,0.00059025397,0.0005648144,0.00085513195,0.00079193176,0.0039636553],"category_scores_gemma":[0.0004174097,0.000186421,0.000499337,0.00066853955,0.00026047014,0.0005754774,0.00055189733,0.00068962737,0.00061669556],"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.00014884624,0.00016784316,0.0014953965,0.00024127227,0.00011013189,0.00024122467,0.00020399695,0.45805928,0.010621801,0.038971804,0.012074549,0.47766384],"study_design_scores_gemma":[0.00006131549,0.00007275773,0.0004226631,0.00002733689,0.000024675894,0.00012497736,0.000044441516,0.9781674,0.0017444494,0.0104696825,0.008828539,0.000011773494],"about_ca_topic_score_codex":0.0044114515,"about_ca_topic_score_gemma":0.002870308,"teacher_disagreement_score":0.0044114515,"about_ca_system_score_codex":0.000422608,"about_ca_system_score_gemma":0.0006802736,"threshold_uncertainty_score":0.013259709},"labels":[],"label_agreement":null},{"id":"W206636664","doi":"10.1007/978-3-642-39038-8_16","title":"Averroes: Whole-Program Analysis without the Whole Program","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Call graph; Programming language; Java; Bytecode; Graph; Reflection (computer programming); Construct (python library); Factor (programming language); Theoretical computer science","score_opus":0.016689303761848795,"score_gpt":0.27751539794085317,"score_spread":0.2608260941790044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206636664","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.0030582512,0.00028737844,0.97521573,0.00024612545,0.0001429395,0.00006333044,0.00022978768,0.0053339596,0.015422478],"genre_scores_gemma":[0.1559897,0.00079459714,0.7858018,0.0008204543,0.00038733217,0.00040537442,0.0014229824,0.013584858,0.04079288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874747,0.0003183191,0.000058594287,0.00027450296,0.0004467098,0.00015436215],"domain_scores_gemma":[0.9983652,0.00070596766,0.000072538176,0.00055459567,0.0002466137,0.0000551834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001312802,0.0016511148,0.0010162441,0.0014878248,0.00089189934,0.0018476845,0.0024020337,0.00077834964,0.028325561],"category_scores_gemma":[0.0046633184,0.0010459243,0.002589262,0.0011362025,0.0015511387,0.005579216,0.002798468,0.0039707893,0.0058487267],"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.00026668422,0.00014734185,0.0009952913,0.0006383529,0.00017755319,0.0002448518,0.00048286768,0.02968782,0.007674625,0.5648113,0.043454785,0.3514185],"study_design_scores_gemma":[0.000048701153,0.000060704257,0.0004251703,0.00013140298,0.00013567891,0.00018226972,0.000118666285,0.1777413,0.013386553,0.73254335,0.075179614,0.00004660882],"about_ca_topic_score_codex":0.0011930742,"about_ca_topic_score_gemma":0.0018974519,"teacher_disagreement_score":0.028325561,"about_ca_system_score_codex":0.0005730663,"about_ca_system_score_gemma":0.0010057009,"threshold_uncertainty_score":0.09475845},"labels":[],"label_agreement":null},{"id":"W206771271","doi":"10.1007/978-3-642-53974-9_3","title":"Big Data Generation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Big data; Computer science; Benchmarking; Pipeline (software); Benchmark (surveying); Generator (circuit theory); Focus (optics); Database; Pipeline transport; Data science; Data mining; Operating system; Engineering; Power (physics)","score_opus":0.07375689493781114,"score_gpt":0.2628777619710696,"score_spread":0.18912086703325848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206771271","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013715906,0.0032261892,0.82208574,0.0038224426,0.0035025892,0.00083027704,0.017209262,0.04551078,0.09009691],"genre_scores_gemma":[0.17402893,0.0032633122,0.6613299,0.002459402,0.0014138775,0.001272326,0.048104156,0.008399807,0.09972834],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992786,0.000103332684,0.00004269117,0.0001773223,0.00033075607,0.00006735095],"domain_scores_gemma":[0.9979073,0.00042085722,0.000054331384,0.0010871035,0.00041862574,0.00011182575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352302,0.0012111755,0.00084481825,0.0017304677,0.0008989812,0.0019966804,0.0019267062,0.00077544304,0.041126247],"category_scores_gemma":[0.004027077,0.00077532855,0.0010576501,0.0022206435,0.0006602313,0.0032598192,0.0029710256,0.0017818022,0.01670895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045240475,0.00013861123,0.0015423368,0.00049795717,0.00012765812,0.00020717716,0.00016095505,0.013613456,0.011226492,0.06477526,0.38701916,0.5202385],"study_design_scores_gemma":[0.00016384371,0.00012366819,0.0017128666,0.0001542972,0.00010192332,0.000608892,0.00014993749,0.1872564,0.049985576,0.30642527,0.45321813,0.000099246485],"about_ca_topic_score_codex":0.00086964795,"about_ca_topic_score_gemma":0.0011256498,"teacher_disagreement_score":0.041126247,"about_ca_system_score_codex":0.0005790132,"about_ca_system_score_gemma":0.001009336,"threshold_uncertainty_score":0.13758099},"labels":[],"label_agreement":null},{"id":"W206773402","doi":"10.1007/978-3-642-21504-9_17","title":"Panorama Ultrasound for Guiding Epidural Anesthesia: A Feasibility Study","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anesthesia and Pain Management","field":"Medicine","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Panorama; Sonographer; Transducer; Computer science; Computer vision; 3D ultrasound; Artificial intelligence; Trajectory; Medicine; Ultrasound; Radiology; Acoustics; Physics","score_opus":0.06494516066118411,"score_gpt":0.29513505368409115,"score_spread":0.23018989302290704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206773402","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.9777245,0.003226178,0.010056283,0.0005253395,0.00010967958,0.0012214762,0.00018325007,0.00013197925,0.0068213735],"genre_scores_gemma":[0.9855359,0.0022211245,0.009850763,0.0004951437,0.00021450214,0.00028900005,0.00015042421,0.000046912224,0.0011961848],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99868065,0.0006594932,0.000090441645,0.00020018278,0.00017903213,0.00019008425],"domain_scores_gemma":[0.9975667,0.0016476206,0.00010632983,0.00027689998,0.0002048637,0.00019763253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026237022,0.0013684762,0.0007956803,0.0010910346,0.0007402495,0.0008681034,0.0014904843,0.0027273654,0.0050072283],"category_scores_gemma":[0.005552268,0.000756714,0.0007858325,0.0005374288,0.0018708907,0.0022988599,0.0008202576,0.0014164344,0.0016609391],"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.048389114,0.059114147,0.10908201,0.0019693163,0.00041226513,0.15655898,0.005928256,0.0024718635,0.28587267,0.0015937466,0.0032674216,0.3253402],"study_design_scores_gemma":[0.010659945,0.30805293,0.244433,0.00051172596,0.0019797485,0.2998861,0.011204674,0.019689694,0.08441613,0.0025393902,0.016099187,0.00052753097],"about_ca_topic_score_codex":0.0017685218,"about_ca_topic_score_gemma":0.0016866864,"teacher_disagreement_score":0.0050072283,"about_ca_system_score_codex":0.00045198898,"about_ca_system_score_gemma":0.0012186778,"threshold_uncertainty_score":0.016750872},"labels":[],"label_agreement":null},{"id":"W206858993","doi":"10.1007/978-3-642-33868-7_29","title":"Facial Landmarking: Comparing Automatic Landmarking Methods with Applications in Soft Biometrics","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"Institute of Aging","funders":"","keywords":"Biometrics; Landmark; Computer science; Face (sociological concept); Artificial intelligence; Analytics; Facial recognition system; Computer vision; Pattern recognition (psychology); Data mining","score_opus":0.03885513636561194,"score_gpt":0.30346597973712397,"score_spread":0.26461084337151203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206858993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39460966,0.01926339,0.5650751,0.00047525877,0.0012462175,0.000610953,0.002631966,0.003554473,0.012532987],"genre_scores_gemma":[0.7237202,0.004641072,0.2597407,0.00012815838,0.00019842615,0.000251874,0.0031251009,0.0010628337,0.0071316846],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974577,0.0007685407,0.00016627455,0.00040709967,0.0010654716,0.00013498867],"domain_scores_gemma":[0.99443614,0.0032897766,0.0003046923,0.0005932821,0.0012880432,0.00008808769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038196454,0.000919466,0.0012015004,0.0028567757,0.00042223808,0.001567203,0.0010053129,0.00092847197,0.005037062],"category_scores_gemma":[0.010151309,0.0002934758,0.0008431588,0.0021974987,0.0005246996,0.0017809921,0.0012574554,0.0005524389,0.0016206654],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023651859,0.00016792133,0.005411296,0.0007356548,0.00033498605,0.00004619603,0.00014399116,0.018876426,0.019308634,0.0017560787,0.006276977,0.9445767],"study_design_scores_gemma":[0.00036316522,0.0029821538,0.09175577,0.00034094878,0.0010746268,0.0016617129,0.0012699851,0.79285043,0.07530223,0.014120026,0.017968113,0.0003108584],"about_ca_topic_score_codex":0.0032652186,"about_ca_topic_score_gemma":0.0034098818,"teacher_disagreement_score":0.005037062,"about_ca_system_score_codex":0.00047499323,"about_ca_system_score_gemma":0.00055482483,"threshold_uncertainty_score":0.020200431},"labels":[],"label_agreement":null},{"id":"W2069517117","doi":"10.1007/11557432_12","title":"Performance Analysis of UML Models Using Aspect-Oriented Modeling Techniques","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Aspect-oriented programming; Applications of UML; UML tool; Parameterized complexity; Context (archaeology); Software engineering; Programming language; Software; Data mining; Algorithm","score_opus":0.025223080115334834,"score_gpt":0.26185023974018073,"score_spread":0.2366271596248459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069517117","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.07570518,0.00030106545,0.9150405,0.0002081378,0.000041522373,0.00014342614,0.00024857887,0.0041410103,0.004170505],"genre_scores_gemma":[0.6503655,0.0005594805,0.34461418,0.000045570177,0.000048894744,0.0002608814,0.0009981412,0.0013949042,0.0017124366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955048,0.0016409286,0.00033785572,0.00025919173,0.0019973593,0.00025983696],"domain_scores_gemma":[0.9878308,0.008610492,0.0010334266,0.0011377839,0.0012921935,0.000095250936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040345564,0.0015888324,0.0009463856,0.002452012,0.0006205592,0.0026562714,0.0018085558,0.0009566862,0.0030555252],"category_scores_gemma":[0.016796298,0.0012394926,0.0017287164,0.0016144234,0.00042094864,0.0032247915,0.000827218,0.00125826,0.00062359154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033402958,0.0003262685,0.00474877,0.0004670011,0.00021215026,0.00023153512,0.0006483356,0.8112827,0.024416614,0.044371095,0.0018240188,0.111137435],"study_design_scores_gemma":[0.000011477712,0.000040190338,0.0002920352,0.000016387074,0.000055243858,0.000031688924,0.000027857464,0.98726964,0.007118774,0.004241284,0.0008835048,0.000011834422],"about_ca_topic_score_codex":0.0040159044,"about_ca_topic_score_gemma":0.0033524667,"teacher_disagreement_score":0.0040345564,"about_ca_system_score_codex":0.0015484706,"about_ca_system_score_gemma":0.0011769397,"threshold_uncertainty_score":0.021337092},"labels":[],"label_agreement":null},{"id":"W2072291888","doi":"10.1007/11880240_48","title":"Framework-Specific Modeling Languages with Round-Trip Engineering","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workbench; Eclipse; Programming language; Domain-specific language; Software engineering; Modeling language; Domain (mathematical analysis); Model-driven architecture; Unified Modeling Language; Reverse engineering; Object-oriented programming; Code generation; Theoretical computer science; Artificial intelligence; Visualization; Software; Operating system","score_opus":0.028569873123433197,"score_gpt":0.2632215568695757,"score_spread":0.2346516837461425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072291888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005517545,0.000031030417,0.990694,0.000086299,0.000047917467,0.0000630733,0.00014236878,0.0051215235,0.0032621296],"genre_scores_gemma":[0.034451645,0.00030576793,0.9440641,0.0002794937,0.000048305606,0.0004623852,0.0013295513,0.0071539297,0.011904878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729246,0.00075593375,0.00041041733,0.00042948124,0.0008279328,0.00028376258],"domain_scores_gemma":[0.99693894,0.0007973803,0.00019899878,0.0014916344,0.00042454532,0.0001485603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003651848,0.0022596172,0.0011064205,0.0011570045,0.001174128,0.0056809327,0.004877278,0.0024716542,0.01754175],"category_scores_gemma":[0.006617298,0.0027887723,0.0037931274,0.0013116946,0.0018327702,0.0075558503,0.004794698,0.006988954,0.008612201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088057954,0.000086381195,0.00032804575,0.00045089523,0.00009082956,0.00032205222,0.0009812325,0.028004376,0.004215189,0.8600548,0.015905363,0.08947277],"study_design_scores_gemma":[0.000072603034,0.000067401656,0.00010561423,0.00034625822,0.00021998651,0.0006280193,0.00026426846,0.16190742,0.01901654,0.3912631,0.42598987,0.00011888441],"about_ca_topic_score_codex":0.0023674457,"about_ca_topic_score_gemma":0.004173838,"teacher_disagreement_score":0.01754175,"about_ca_system_score_codex":0.0012113624,"about_ca_system_score_gemma":0.0029133335,"threshold_uncertainty_score":0.05868298},"labels":[],"label_agreement":null},{"id":"W207293074","doi":"10.1007/978-3-540-87991-6_31","title":"Reflective Analysis of the Syntax and Semantics of the i* Framework","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Toronto","funders":"","keywords":"Computer science; Syntax; Semantics (computer science); Abstract syntax; Notation; Consistency (knowledge bases); Syntax error; Programming language; Abstract syntax tree; Natural language processing; Software engineering; Artificial intelligence; Linguistics","score_opus":0.027965219746183868,"score_gpt":0.28421558249401846,"score_spread":0.2562503627478346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207293074","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.013698587,0.00023729164,0.95263773,0.00079823553,0.00010976394,0.00007446269,0.0001505696,0.0022682003,0.03002513],"genre_scores_gemma":[0.49927756,0.00053681305,0.48229223,0.00043613467,0.00014423972,0.0001818866,0.00053819676,0.002933987,0.013658973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684,0.0011719147,0.00020196203,0.0005091886,0.00085806195,0.00041878683],"domain_scores_gemma":[0.99633104,0.0012909062,0.00027652085,0.0012977172,0.0006439845,0.00015986654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00360898,0.00073886284,0.00068763515,0.0011225962,0.0017939534,0.007436903,0.0028805456,0.0012169009,0.009018971],"category_scores_gemma":[0.009269888,0.0009948398,0.0019834454,0.0011926929,0.004990993,0.009487433,0.004918469,0.003870766,0.0017377043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028508823,0.000015750435,0.00016965739,0.0000471814,0.000009067601,0.00006187923,0.00058942876,0.0022888572,0.0013130903,0.9837127,0.0011323784,0.010631499],"study_design_scores_gemma":[0.000026142026,0.000038726153,0.00019715194,0.00008815298,0.00004949326,0.00014933944,0.00058510836,0.031132355,0.0071039004,0.926697,0.033888083,0.000044411696],"about_ca_topic_score_codex":0.0045217774,"about_ca_topic_score_gemma":0.003342003,"teacher_disagreement_score":0.009018971,"about_ca_system_score_codex":0.0019734418,"about_ca_system_score_gemma":0.0034560717,"threshold_uncertainty_score":0.030171394},"labels":[],"label_agreement":null},{"id":"W207418988","doi":"10.1007/978-3-642-20798-3_2","title":"Enhancing Peer-to-Peer Traffic Locality through Selective Tracker Blocking","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Blocking (statistics); Locality; Peer-to-peer; Computer network","score_opus":0.025854159240142952,"score_gpt":0.26183584712629543,"score_spread":0.23598168788615248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207418988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18325351,0.0016574211,0.80467147,0.0003363006,0.00007548396,0.00016703799,0.00005651153,0.003274469,0.006507876],"genre_scores_gemma":[0.9466029,0.00032667277,0.05154009,0.00007894738,0.000038072325,0.000067451,0.000049900773,0.000116248375,0.0011798481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.0004303126,0.000065557004,0.0002610309,0.00040114476,0.00021529495],"domain_scores_gemma":[0.9941585,0.002582257,0.00091176777,0.0010222559,0.00087847316,0.00044683827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020294085,0.00079970056,0.0009876098,0.0006222472,0.0011789415,0.0011398868,0.0026119146,0.0008735005,0.00091227517],"category_scores_gemma":[0.0062803184,0.00034357634,0.00041890112,0.0006509756,0.00095684483,0.002123251,0.0019863304,0.0011399855,0.0005534695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063401787,0.00073052465,0.012113357,0.00046903142,0.00016100532,0.0004600306,0.0010524679,0.62774724,0.10621383,0.03373926,0.005639451,0.21103974],"study_design_scores_gemma":[0.000042605778,0.00022118527,0.0010498958,0.000021880476,0.00006150053,0.00042809529,0.00015582347,0.9687895,0.018382533,0.0072893132,0.003524552,0.00003307507],"about_ca_topic_score_codex":0.0027172226,"about_ca_topic_score_gemma":0.002622991,"teacher_disagreement_score":0.0027172226,"about_ca_system_score_codex":0.00093034795,"about_ca_system_score_gemma":0.0018311866,"threshold_uncertainty_score":0.010732651},"labels":[],"label_agreement":null},{"id":"W2074270833","doi":"10.1007/11557432_39","title":"Uniform Support for Modeling Crosscutting Structure","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Programming language","score_opus":0.040460718698965226,"score_gpt":0.2992605261390747,"score_spread":0.2587998074401095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074270833","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.005800761,0.00007279146,0.9860989,0.000042452768,0.000025987883,0.00006371226,0.0003548214,0.0052225892,0.0023180407],"genre_scores_gemma":[0.20149775,0.00029876968,0.78390175,0.00015878875,0.00007415096,0.00039898552,0.0028658442,0.0028925885,0.007911276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996977,0.00050291966,0.00054387137,0.00064918114,0.0010136972,0.00031339913],"domain_scores_gemma":[0.99269426,0.0017218239,0.0004865185,0.004057733,0.00087152456,0.00016811352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037576477,0.0014592739,0.001264466,0.0014138792,0.0008115538,0.0031736104,0.005536748,0.0018813878,0.008932343],"category_scores_gemma":[0.01094372,0.0016670916,0.0028786603,0.002155137,0.001130003,0.006480933,0.00346065,0.0028021978,0.002497266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036867405,0.00034682226,0.004665015,0.0005637279,0.00016484286,0.00041429282,0.0006080863,0.15672766,0.014423144,0.5502884,0.01034421,0.26108524],"study_design_scores_gemma":[0.00007049887,0.00011863527,0.00067235884,0.000116303934,0.00016701625,0.0002667291,0.000065533306,0.7099139,0.018942114,0.22652525,0.043087214,0.00005437442],"about_ca_topic_score_codex":0.00336816,"about_ca_topic_score_gemma":0.005472611,"teacher_disagreement_score":0.008932343,"about_ca_system_score_codex":0.00094929215,"about_ca_system_score_gemma":0.0013063212,"threshold_uncertainty_score":0.029881716},"labels":[],"label_agreement":null},{"id":"W207560109","doi":"10.1007/978-3-642-21881-1_42","title":"Learning Inverted Dirichlet Mixtures for Positive Data Clustering","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Cluster analysis; Computer science; Dirichlet distribution; Expectation–maximization algorithm; Maximization; Model selection; Selection (genetic algorithm); Algorithm; Minimum description length; Latent Dirichlet allocation; Artificial intelligence; Data mining; Pattern recognition (psychology); Maximum likelihood; Mathematical optimization; Topic model; Mathematics; Statistics","score_opus":0.048641573033388764,"score_gpt":0.288367066147882,"score_spread":0.23972549311449323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207560109","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.0017783445,0.00031855408,0.99669385,0.00013252336,0.000039342274,0.000036373407,0.00008576728,0.00048595332,0.0004291837],"genre_scores_gemma":[0.06836862,0.00060722855,0.9232102,0.0003294993,0.0003210172,0.00042244644,0.0017082115,0.00057338836,0.004459459],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937443,0.0027372777,0.0004027582,0.0013690494,0.0014441562,0.0003023665],"domain_scores_gemma":[0.98594,0.009330961,0.0005280323,0.002647832,0.0012601893,0.000293023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007875037,0.00187381,0.0035814014,0.003137291,0.0020616278,0.0035617186,0.0066054543,0.0035410612,0.0046822582],"category_scores_gemma":[0.03197809,0.0024072784,0.0038980502,0.004079488,0.0027019817,0.006019318,0.0062365136,0.005631261,0.0037032429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052227604,0.00024215445,0.001937899,0.0005028529,0.0003041396,0.00013564217,0.00067625835,0.22340508,0.0038730192,0.123266585,0.015631381,0.6295027],"study_design_scores_gemma":[0.000017490129,0.000022921688,0.00015332122,0.00003305347,0.000031247964,0.00009678059,0.000054218413,0.8493763,0.0014453509,0.14624462,0.0024981974,0.000026478761],"about_ca_topic_score_codex":0.0036957648,"about_ca_topic_score_gemma":0.0062382906,"teacher_disagreement_score":0.007875037,"about_ca_system_score_codex":0.00223456,"about_ca_system_score_gemma":0.0016117846,"threshold_uncertainty_score":0.041647673},"labels":[],"label_agreement":null},{"id":"W207646885","doi":"10.1007/978-3-642-38457-8_11","title":"Selective Retrieval for Categorization of Semi-structured Web Resources","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Categorization; Information retrieval; Ranking (information retrieval); Directory; Set (abstract data type); Process (computing); Task (project management); Entity linking; World Wide Web; Web page; Data mining; Artificial intelligence; Knowledge base","score_opus":0.01253512869794304,"score_gpt":0.2330384927091037,"score_spread":0.22050336401116066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207646885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609951,0.0060514617,0.78705347,0.0005602065,0.000208424,0.0008288503,0.0042731236,0.007010245,0.007914694],"genre_scores_gemma":[0.45967066,0.0022484623,0.5128947,0.00029967175,0.00032459619,0.0006554818,0.013668632,0.0004144417,0.009823339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879706,0.00024254902,0.00014271973,0.0002494775,0.0004263157,0.00014172946],"domain_scores_gemma":[0.99748826,0.0011390622,0.00020691942,0.00056470116,0.00047100367,0.00013010342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471736,0.0007610726,0.0013904136,0.0060925675,0.00094413816,0.0017354459,0.001536569,0.00090671825,0.0034523783],"category_scores_gemma":[0.0034706048,0.0003126909,0.0009769775,0.0047294125,0.0007899021,0.0029816623,0.0018996315,0.00070386817,0.0037078762],"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.0006273712,0.00032899217,0.0037011902,0.0011708342,0.00017308071,0.00031069535,0.000764538,0.0026978129,0.07857682,0.007950078,0.018994398,0.8847041],"study_design_scores_gemma":[0.0002985239,0.0014031489,0.03410978,0.00046231237,0.0010766444,0.0045705554,0.003839328,0.611559,0.16366316,0.10628339,0.07244467,0.0002895597],"about_ca_topic_score_codex":0.002104992,"about_ca_topic_score_gemma":0.0039776294,"teacher_disagreement_score":0.0060925675,"about_ca_system_score_codex":0.0006855956,"about_ca_system_score_gemma":0.0014306518,"threshold_uncertainty_score":0.011549413},"labels":[],"label_agreement":null},{"id":"W2079686199","doi":"10.1007/11415770_46","title":"Stability of Rearrangement Measures in the Comparison of Genome Sequences","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Genome; Computer science; Resolution (logic); Tree (set theory); Gene rearrangement; Independence (probability theory); Biology; Evolutionary biology; Genetics; Mathematics; Artificial intelligence; Statistics; Combinatorics; Gene","score_opus":0.034748471050933656,"score_gpt":0.27701866142005477,"score_spread":0.24227019036912112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079686199","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.40340897,0.00513985,0.5847478,0.0006713266,0.000108077686,0.00008505903,0.0005990683,0.0008991588,0.004340609],"genre_scores_gemma":[0.8963793,0.0010695298,0.09901539,0.00010546758,0.000288059,0.00017926222,0.0011817437,0.0003235206,0.0014577246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947566,0.0021618193,0.0003219272,0.0012463632,0.0012677291,0.00024551337],"domain_scores_gemma":[0.93370193,0.05722046,0.0036324817,0.0024736763,0.0020721797,0.00089926226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009485547,0.00057578605,0.0015973435,0.0073618097,0.0010786302,0.003334225,0.0025313688,0.0016574559,0.0018960031],"category_scores_gemma":[0.05503546,0.0007196475,0.0008950589,0.0060044574,0.0041752774,0.006695632,0.00257436,0.0019969693,0.00042635255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016374661,0.00020477807,0.03690632,0.00074222777,0.0003923635,0.0003739325,0.001461239,0.26199386,0.02137997,0.40159523,0.0043150275,0.26899758],"study_design_scores_gemma":[0.00003578598,0.0002374127,0.008144095,0.00007214593,0.000060665076,0.00040071917,0.00019507881,0.59351975,0.006016452,0.38972592,0.0015226805,0.00006925553],"about_ca_topic_score_codex":0.00081619737,"about_ca_topic_score_gemma":0.0007038467,"teacher_disagreement_score":0.009485547,"about_ca_system_score_codex":0.0017324225,"about_ca_system_score_gemma":0.00064573664,"threshold_uncertainty_score":0.050164938},"labels":[],"label_agreement":null},{"id":"W2081986160","doi":"10.1007/978-3-642-33666-9_4","title":"T □: A Domain Specific Language for Rapid Workflow Development","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Executable; Workflow; Software engineering; Workflow management system; Programming language; Workflow technology; Workflow engine; Windows Workflow Foundation; Model transformation; XPDL; Database; Artificial intelligence","score_opus":0.02276595777823725,"score_gpt":0.22625642439549612,"score_spread":0.20349046661725886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081986160","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.00069372635,0.000049309685,0.9575594,0.0001056462,0.00008803665,0.00011757945,0.0011099045,0.03817303,0.0021033792],"genre_scores_gemma":[0.019143742,0.00046651624,0.92870945,0.0005664364,0.00007643828,0.00075127766,0.0085172085,0.029168312,0.012600596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987411,0.00026697095,0.00030576423,0.00023277983,0.00031552263,0.00013795918],"domain_scores_gemma":[0.99743205,0.0013911573,0.00018521304,0.00038548734,0.00043814615,0.0001678861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022770618,0.0020330169,0.0009311643,0.0010952293,0.00087476266,0.0033045763,0.002703479,0.0019643744,0.021114152],"category_scores_gemma":[0.0042057554,0.0023618888,0.0029375886,0.0012849016,0.0010548327,0.0038396572,0.0022476537,0.0045195823,0.014680253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082820613,0.00024908572,0.0010737607,0.0031581349,0.00021417759,0.0011723085,0.0022783473,0.025924627,0.04900034,0.23038462,0.27500406,0.41071233],"study_design_scores_gemma":[0.00029145408,0.0001547864,0.000235539,0.0005199203,0.00013218539,0.0012054737,0.00017402871,0.1091622,0.053526282,0.06888959,0.7654523,0.0002563275],"about_ca_topic_score_codex":0.0029577087,"about_ca_topic_score_gemma":0.0025764632,"teacher_disagreement_score":0.021114152,"about_ca_system_score_codex":0.00068830425,"about_ca_system_score_gemma":0.0028121036,"threshold_uncertainty_score":0.07063383},"labels":[],"label_agreement":null},{"id":"W2083035285","doi":"10.1007/11618058_8","title":"Drawing K n in Three Dimensions with One Bend Per Edge","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Lethbridge","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Geometry; Mathematics; Computer science; Artificial intelligence","score_opus":0.01796937553261109,"score_gpt":0.230563612036428,"score_spread":0.21259423650381692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083035285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025584,0.00023926033,0.85608643,0.0005845879,0.0002452968,0.00018240423,0.00081537676,0.0029618354,0.068628915],"genre_scores_gemma":[0.25545827,0.0004875905,0.7030078,0.00022145551,0.000034065884,0.00015616971,0.0008049257,0.0006528373,0.039176777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997074,0.000036824233,0.000023548795,0.00007695755,0.000111658956,0.000043583354],"domain_scores_gemma":[0.99972445,0.00009998968,0.000029539338,0.00006855204,0.000042741958,0.000034683777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023718277,0.0012389601,0.00073150545,0.0005355319,0.0006439148,0.0009595343,0.0012233678,0.0010123526,0.019737013],"category_scores_gemma":[0.0007359297,0.00073665346,0.00061106094,0.00091613166,0.00066125585,0.0011255558,0.0016834474,0.0012265648,0.0041332734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086006615,0.00023518653,0.0016117162,0.0007584663,0.0001492441,0.0008813773,0.00093763985,0.26012242,0.067783244,0.103332736,0.049512427,0.51381546],"study_design_scores_gemma":[0.0002633968,0.0003375103,0.0015741026,0.00015012994,0.000081009115,0.0010704192,0.00061337976,0.6619621,0.032362085,0.17848776,0.12298106,0.00011703221],"about_ca_topic_score_codex":0.0031481814,"about_ca_topic_score_gemma":0.009515548,"teacher_disagreement_score":0.019737013,"about_ca_system_score_codex":0.0005917924,"about_ca_system_score_gemma":0.00045886263,"threshold_uncertainty_score":0.06602687},"labels":[],"label_agreement":null},{"id":"W2087402722","doi":"10.1007/978-3-642-31606-7_16","title":"Automatic Theorem-Proving in Combinatorics on Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Combinatorics on words; Computer science; Automaton; Function (biology); Combinatorics; Computation; Discrete mathematics; Extremal combinatorics; Algorithm; Mathematics; Theoretical computer science; Word (group theory); Programming language","score_opus":0.0130593615674536,"score_gpt":0.23081741752669982,"score_spread":0.21775805595924622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087402722","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.024123695,0.009850468,0.80407536,0.0042028977,0.0013749206,0.00018686468,0.0004215269,0.0018315177,0.15393274],"genre_scores_gemma":[0.5521667,0.010201174,0.3647658,0.001131936,0.0028260981,0.00047121,0.0014508311,0.0013249118,0.0656613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659014,0.0013659514,0.00028561073,0.00046561687,0.0010340649,0.00025867924],"domain_scores_gemma":[0.9921029,0.0063206544,0.00016861789,0.0008509386,0.00041831072,0.00013852601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025847207,0.0015162432,0.0015042265,0.003065315,0.0024522685,0.0062572914,0.0035399022,0.0015391096,0.011957582],"category_scores_gemma":[0.007961799,0.0017360267,0.0029544916,0.0039080926,0.0076993657,0.015950115,0.0042557125,0.005124249,0.0032475789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031262596,0.00002813925,0.00013745892,0.00033625273,0.000027597198,0.00007871395,0.00034898176,0.0018978587,0.0007410312,0.9601866,0.0046543106,0.031531673],"study_design_scores_gemma":[0.000008735426,0.0000064409273,0.00005453449,0.000041750845,0.000012069578,0.00004932159,0.000028128467,0.0026694993,0.0006477181,0.9860064,0.010465047,0.000010240329],"about_ca_topic_score_codex":0.000958395,"about_ca_topic_score_gemma":0.0009322198,"teacher_disagreement_score":0.011957582,"about_ca_system_score_codex":0.0027667538,"about_ca_system_score_gemma":0.0013515855,"threshold_uncertainty_score":0.040002108},"labels":[],"label_agreement":null},{"id":"W2089209847","doi":"10.1007/978-3-642-02737-6_10","title":"Closures in Formal Languages and Kuratowski’s Theorem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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 Waterloo","funders":"","keywords":"Closure (psychology); Axiom; Mathematics; Complement (music); Regular language; Discrete mathematics; Separation axiom; Formal language; Partition (number theory); Abstract family of languages; Concatenation (mathematics); Topological space; Computer science; Combinatorics; Algorithm; Theoretical computer science; Programming language; Second-generation programming language","score_opus":0.009009903572359495,"score_gpt":0.25068908042776605,"score_spread":0.24167917685540655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089209847","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.17362861,0.016360212,0.3685167,0.016274871,0.0019888151,0.00016825032,0.00078896567,0.0011240594,0.4211495],"genre_scores_gemma":[0.91256326,0.003309911,0.04390095,0.0012009484,0.0009666341,0.00027080183,0.00037402348,0.00036853744,0.037045017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870586,0.00030155337,0.00015549248,0.0002881292,0.0003564503,0.00019256394],"domain_scores_gemma":[0.9985128,0.00087484356,0.00012211093,0.00018243055,0.00021464188,0.00009315401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017201222,0.00060364266,0.0011309454,0.0023254836,0.0030324792,0.003661243,0.0010367379,0.0012189494,0.0052624145],"category_scores_gemma":[0.0036056377,0.0010172543,0.0013883085,0.0017734575,0.008065431,0.01634399,0.0034903218,0.0042071394,0.00096472545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001145164,0.000008090791,0.000034857232,0.000026167605,0.000002713619,0.00003241954,0.00044181428,0.00009625244,0.00026163078,0.99593323,0.00082092034,0.0023305072],"study_design_scores_gemma":[0.000014831602,0.000004549262,0.00007844623,0.000013304678,0.0000061035657,0.00005667853,0.00012514052,0.00031169478,0.00025481283,0.9893939,0.009731084,0.000009316088],"about_ca_topic_score_codex":0.0015490582,"about_ca_topic_score_gemma":0.0010803965,"teacher_disagreement_score":0.0052624145,"about_ca_system_score_codex":0.002600229,"about_ca_system_score_gemma":0.0009545198,"threshold_uncertainty_score":0.018866003},"labels":[],"label_agreement":null},{"id":"W2089763102","doi":"10.1007/978-3-540-77004-6_8","title":"A Spatial Web Graph Model with Local Influence Regions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Dalhousie University; Wilfrid Laurier University; University of British Columbia","funders":"","keywords":"Degree distribution; Preferential attachment; Embedding; Computer science; Exponent; Graph; Metric space; Theoretical computer science; Metric (unit); Range (aeronautics); Degree (music); Node (physics); Complex network; Topology (electrical circuits); Data mining; Mathematics; World Wide Web; Discrete mathematics; Combinatorics; Artificial intelligence; Physics; Engineering","score_opus":0.014413974156930036,"score_gpt":0.25068082550353266,"score_spread":0.2362668513466026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089763102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10978285,0.0014353805,0.85947347,0.0021138485,0.00020438875,0.00019133533,0.002166583,0.0011323657,0.023499748],"genre_scores_gemma":[0.8782428,0.001605729,0.08309688,0.00032741236,0.00024689035,0.0003661369,0.0012989101,0.00033216138,0.034483187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.00030226976,0.00002397767,0.00023200328,0.00012529049,0.00009607382],"domain_scores_gemma":[0.9974529,0.0016104674,0.00024982603,0.00020334804,0.0003051274,0.00017830796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236561,0.0011259479,0.0019499849,0.0021767467,0.00095782126,0.0021992538,0.0039062407,0.0030626433,0.005845345],"category_scores_gemma":[0.004911664,0.0010675123,0.0013943844,0.0030467194,0.001369641,0.0037911332,0.0013862804,0.0016033936,0.0013951953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001305284,0.000095181014,0.00088902976,0.00011088358,0.000087003486,0.00028219013,0.000104884406,0.87588763,0.0007889451,0.107140064,0.0034784754,0.011005181],"study_design_scores_gemma":[0.000015401163,0.000010548352,0.000090320704,0.000005116757,0.000024448498,0.00002979532,0.000010787939,0.98184913,0.00006217059,0.017334856,0.0005608419,0.0000065509894],"about_ca_topic_score_codex":0.024579333,"about_ca_topic_score_gemma":0.019746535,"teacher_disagreement_score":0.024579333,"about_ca_system_score_codex":0.0018590541,"about_ca_system_score_gemma":0.0012262523,"threshold_uncertainty_score":0.04887253},"labels":[],"label_agreement":null},{"id":"W2091876488","doi":"10.1007/3-540-45665-1_5","title":"A Fast SVM Training Algorithm","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Concordia University","funders":"","keywords":"MNIST database; Computer science; Support vector machine; Kernel (algebra); Scalability; Artificial intelligence; Principal component analysis; Algorithm; Scheme (mathematics); Pattern recognition (psychology); Machine learning; Digit recognition; Deep learning; Artificial neural network; Mathematics; Database","score_opus":0.03404040626412898,"score_gpt":0.24908833323087898,"score_spread":0.21504792696675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091876488","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.0028756172,0.00044047128,0.9901334,0.00012554556,0.00032208575,0.000068440844,0.00018643936,0.0035843563,0.0022635432],"genre_scores_gemma":[0.041494343,0.00039833886,0.9392182,0.0002065335,0.00019730018,0.00020403662,0.0014159201,0.00040858024,0.016456757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00009890838,0.000043031356,0.00015571162,0.00028857024,0.00005280288],"domain_scores_gemma":[0.99925894,0.00018357039,0.000028046921,0.00013899422,0.0003556688,0.000034848745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081063877,0.0009755373,0.0011118614,0.00086983305,0.00072051253,0.0012022881,0.0012662767,0.00126338,0.014994297],"category_scores_gemma":[0.0016599052,0.00065932516,0.000839222,0.001096143,0.00018944933,0.0014730296,0.0012552823,0.001803023,0.012825843],"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.00012391512,0.000062211715,0.00018083391,0.000066592365,0.000045068795,0.000029899198,0.000013707033,0.014016988,0.0121159395,0.0038633444,0.01839111,0.9510904],"study_design_scores_gemma":[0.000063485815,0.00012021334,0.00079665624,0.000033823148,0.00005577659,0.00026580683,0.000018887402,0.9251733,0.02073711,0.011924168,0.04077753,0.000033334734],"about_ca_topic_score_codex":0.0014498872,"about_ca_topic_score_gemma":0.0024206836,"teacher_disagreement_score":0.014994297,"about_ca_system_score_codex":0.0003533471,"about_ca_system_score_gemma":0.0009807298,"threshold_uncertainty_score":0.050160885},"labels":[],"label_agreement":null},{"id":"W2093549400","doi":"10.1007/bfb0105123","title":"A methodology for programming with concurrency","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"University of Toronto","funders":"","keywords":"Concurrency; Computer science; Correctness; Programming language; Mathematical proof; Deadlock; Concurrent object-oriented programming; Theoretical computer science; Programming paradigm; Mathematics; Procedural programming; Inductive programming","score_opus":0.08823775316025535,"score_gpt":0.3238388774395125,"score_spread":0.23560112427925717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093549400","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.0008552402,0.00038913835,0.9890147,0.00065127964,0.00015390888,0.00006280099,0.000050911363,0.00071419845,0.008107788],"genre_scores_gemma":[0.066698216,0.00094675616,0.9121319,0.00068035,0.0003387851,0.000480896,0.00019257673,0.0010315526,0.017498907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961514,0.0014934526,0.00036078945,0.00073188357,0.00095722714,0.00030518204],"domain_scores_gemma":[0.9964864,0.001593374,0.00016366602,0.0011321584,0.00039475705,0.0002296595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049351486,0.0014027362,0.0012419471,0.0019009,0.0035793723,0.006515325,0.0036330633,0.0017274455,0.008951375],"category_scores_gemma":[0.006502313,0.0018350686,0.003464202,0.0022493429,0.009061591,0.012740832,0.0065715266,0.0067712613,0.0028183628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008905423,0.000013853894,0.00006379827,0.000064323736,0.00000930906,0.00002971304,0.00038910052,0.0005995814,0.00037932585,0.9800869,0.0020651913,0.016289938],"study_design_scores_gemma":[0.000017899742,0.000014686985,0.00003001456,0.00004735617,0.000022233397,0.00010105839,0.00008963547,0.0037073744,0.0008715626,0.9507041,0.04437665,0.000017341068],"about_ca_topic_score_codex":0.002347412,"about_ca_topic_score_gemma":0.0027626967,"teacher_disagreement_score":0.008951375,"about_ca_system_score_codex":0.0017490408,"about_ca_system_score_gemma":0.002913325,"threshold_uncertainty_score":0.029945314},"labels":[],"label_agreement":null},{"id":"W2093651580","doi":"10.1007/3-540-44723-7_2","title":"Multi-attribute Utility Theoretic Negotiation for Electronic Commerce","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Negotiation; E-commerce; Operations research; World Wide Web","score_opus":0.017120652848805006,"score_gpt":0.2549448080695675,"score_spread":0.23782415522076247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093651580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008250837,0.0027963456,0.9699929,0.001047815,0.00020758007,0.000113865506,0.000056540553,0.00015315207,0.017380971],"genre_scores_gemma":[0.6225218,0.0027994104,0.34954602,0.00031096002,0.00059947715,0.00043835244,0.00022150691,0.00013530752,0.023427092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946449,0.002998624,0.00025371206,0.00042044898,0.0013965226,0.0002858119],"domain_scores_gemma":[0.996335,0.0025786164,0.00016222158,0.00042484223,0.0002939642,0.00020529113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006685149,0.0010107605,0.002185592,0.0011972146,0.0017362548,0.005645786,0.0040202,0.0027286278,0.0061912416],"category_scores_gemma":[0.0106738,0.0011589498,0.0014137897,0.002967749,0.0033792611,0.010340422,0.0033691286,0.0051072417,0.0010881424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010955452,0.00012956311,0.00011017911,0.00014735146,0.000057447563,0.0000831739,0.0002554096,0.07448842,0.0005549326,0.8845606,0.0032131418,0.036290195],"study_design_scores_gemma":[0.000023679242,0.000027616357,0.00005654492,0.000025688381,0.000016307706,0.000050264865,0.000048841743,0.28006512,0.00025092784,0.71615416,0.0032597857,0.000021158714],"about_ca_topic_score_codex":0.0012245167,"about_ca_topic_score_gemma":0.00091517717,"teacher_disagreement_score":0.006685149,"about_ca_system_score_codex":0.0033169563,"about_ca_system_score_gemma":0.0013525821,"threshold_uncertainty_score":0.035354912},"labels":[],"label_agreement":null},{"id":"W2094536036","doi":"10.1007/978-3-540-79299-4","title":"Transactions on Computational Science I","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":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":"Pleasure; Computer science; Volume (thermodynamics); Series (stratigraphy); Data science; Psychology; Geology","score_opus":0.016204287122543144,"score_gpt":0.24590869321671666,"score_spread":0.2297044060941735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094536036","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035625536,0.052511074,0.11630778,0.030520601,0.049363866,0.00024399963,0.0031967843,0.0018602352,0.7424331],"genre_scores_gemma":[0.04584423,0.047168862,0.04878039,0.003950553,0.010840414,0.00046487642,0.00509043,0.001315851,0.8365444],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986436,0.00027160128,0.00009291174,0.00027540707,0.00062257913,0.0000939254],"domain_scores_gemma":[0.9976701,0.0005288665,0.000073570096,0.0010300281,0.0005336059,0.0001637236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017131364,0.0012006464,0.0021311184,0.001350124,0.0008744848,0.0048066746,0.0016662072,0.0015911191,0.18638444],"category_scores_gemma":[0.005376843,0.00052907737,0.0010132104,0.0033721,0.001909337,0.0031894147,0.0026852025,0.003938311,0.09623902],"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.00007407288,0.00005807835,0.00036234604,0.00045027223,0.00006176827,0.000041632473,0.00007663777,0.001565261,0.00067411235,0.16184454,0.5628595,0.2719319],"study_design_scores_gemma":[0.00003073636,0.000026461374,0.0003515534,0.00017813992,0.000037028025,0.00009571604,0.00006511803,0.0032672319,0.0003485599,0.120613106,0.8749757,0.000010756959],"about_ca_topic_score_codex":0.0017326486,"about_ca_topic_score_gemma":0.0016429011,"teacher_disagreement_score":0.18638444,"about_ca_system_score_codex":0.001569904,"about_ca_system_score_gemma":0.0021872104,"threshold_uncertainty_score":0.6235181},"labels":[],"label_agreement":null},{"id":"W2094810043","doi":"10.1007/11561347_28","title":"Mapping Features to Models: A Template Approach Based on Superimposed Variants","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":579,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Feature (linguistics); Unified Modeling Language; Semantics (computer science); Feature model; Artificial intelligence; Class (philosophy); Data mining; Programming language; Software","score_opus":0.021646126893033277,"score_gpt":0.23190287547305766,"score_spread":0.21025674858002438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094810043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021287217,0.000042344214,0.99400663,0.000035835765,0.000028844814,0.00006570107,0.00011252124,0.0016830214,0.0018962227],"genre_scores_gemma":[0.062229898,0.0002186853,0.93163747,0.000048296857,0.000024862893,0.00016821832,0.0008488695,0.0015500465,0.0032737216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769336,0.0004152035,0.0002238215,0.0004762175,0.0010692202,0.00012215636],"domain_scores_gemma":[0.9966235,0.0009075146,0.00015021535,0.0016394358,0.00057133456,0.000108001834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001605206,0.0010038964,0.0014817317,0.00174388,0.0006895649,0.0034991216,0.004409963,0.001674118,0.007613781],"category_scores_gemma":[0.008722344,0.0012321913,0.0029002235,0.0028977026,0.001274747,0.0055680606,0.0034658439,0.0021658537,0.0025374673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032991866,0.000251863,0.0023266168,0.0005152237,0.00027421422,0.0012325932,0.0011511736,0.10374215,0.02498968,0.28891173,0.008697651,0.56757724],"study_design_scores_gemma":[0.00003536173,0.00013068158,0.000375502,0.00010945379,0.00027140416,0.00078598893,0.00024472043,0.78117394,0.025509888,0.15051241,0.04076485,0.00008586965],"about_ca_topic_score_codex":0.004124358,"about_ca_topic_score_gemma":0.0045446125,"teacher_disagreement_score":0.007613781,"about_ca_system_score_codex":0.00056895294,"about_ca_system_score_gemma":0.001245845,"threshold_uncertainty_score":0.025470614},"labels":[],"label_agreement":null},{"id":"W2095507388","doi":"10.1007/978-3-642-17697-5_1","title":"SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Dynamic Source Routing; Wireless mesh network; Zone Routing Protocol; Routing protocol; Wireless network; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.013870629479442582,"score_gpt":0.2701755145176838,"score_spread":0.2563048850382412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095507388","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.032194015,0.00634174,0.90550715,0.0009352702,0.0017905057,0.00035897372,0.0013919547,0.008662455,0.042817976],"genre_scores_gemma":[0.32984936,0.008773535,0.53712064,0.00070040167,0.00043069912,0.00042752348,0.006051014,0.0013170032,0.11532984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998443,0.000021126758,0.0000119995875,0.000017891749,0.000089142115,0.00001546814],"domain_scores_gemma":[0.9998337,0.00003807352,0.000010992931,0.000030235187,0.00007420473,0.000012738347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001946735,0.0003337379,0.00031350076,0.00044333423,0.00033337157,0.0005008285,0.00075686764,0.0003702466,0.0027515497],"category_scores_gemma":[0.00051796297,0.00018884228,0.00023955276,0.00053567917,0.00016188025,0.0008688966,0.00055889715,0.00060357765,0.0010507846],"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.00023387911,0.00010214713,0.00076205423,0.0006697385,0.00008049898,0.00020334791,0.00014969347,0.02611933,0.055439092,0.03309867,0.07025499,0.81288666],"study_design_scores_gemma":[0.000110442445,0.00031647042,0.0013992818,0.00011846055,0.00013965694,0.0009311541,0.00013855215,0.20908003,0.0612788,0.032263856,0.6941288,0.000094506795],"about_ca_topic_score_codex":0.00081473653,"about_ca_topic_score_gemma":0.0017447344,"teacher_disagreement_score":0.0027515497,"about_ca_system_score_codex":0.00029532716,"about_ca_system_score_gemma":0.0005204478,"threshold_uncertainty_score":0.0092048645},"labels":[],"label_agreement":null},{"id":"W2096041685","doi":"10.1007/3-540-39205-x_79","title":"Comparison of BPL and RBF Network in Intrusion Detection System","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 Waterloo","funders":"","keywords":"Intrusion detection system; Radial basis function; Computer science; Backpropagation; Artificial neural network; Artificial intelligence; Multilayer perceptron; Pattern recognition (psychology); False positive rate; Anomaly detection; Data mining; Machine learning","score_opus":0.020652328561455255,"score_gpt":0.2636001056972439,"score_spread":0.24294777713578863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096041685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32365638,0.009312741,0.6527121,0.00064614235,0.0005562791,0.00016465876,0.00022559735,0.0047138426,0.008012352],"genre_scores_gemma":[0.9044212,0.0019212303,0.0905676,0.00009965031,0.00012575313,0.00009192543,0.0003155018,0.00010705598,0.0023501578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774784,0.00081800745,0.00014879488,0.00029043993,0.0008548618,0.0001401206],"domain_scores_gemma":[0.995656,0.002391433,0.000121213314,0.0001828771,0.0015478681,0.00010067008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031415187,0.000620821,0.0011961204,0.0012375377,0.0004002637,0.001303962,0.001159566,0.00095604704,0.0016848801],"category_scores_gemma":[0.0061065787,0.0002889134,0.0004437983,0.0008903892,0.0003417556,0.002012041,0.00041934938,0.0008652148,0.00042952056],"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.005144996,0.0008130941,0.008782552,0.0007085217,0.00032577701,0.00014651091,0.0001602741,0.20052047,0.017644778,0.003878012,0.0037084003,0.7581666],"study_design_scores_gemma":[0.00008348466,0.0005320652,0.0025124955,0.000019668953,0.00012446476,0.00007894398,0.00004079538,0.9859919,0.008875013,0.00069111324,0.0010300915,0.000019951143],"about_ca_topic_score_codex":0.0071142646,"about_ca_topic_score_gemma":0.0033477112,"teacher_disagreement_score":0.0071142646,"about_ca_system_score_codex":0.00095404836,"about_ca_system_score_gemma":0.0006518765,"threshold_uncertainty_score":0.01661414},"labels":[],"label_agreement":null},{"id":"W2096107368","doi":"10.1007/3-540-48071-4_14","title":"Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Zero-knowledge proof; Gas meter prover; Permutation (music); Cryptography; Computer science; Theoretical computer science; Time complexity; Cryptographic protocol; Zero (linguistics); Polynomial; Mathematics; Cryptographic primitive; Discrete mathematics; Algorithm","score_opus":0.06504781997517334,"score_gpt":0.31057065287793156,"score_spread":0.24552283290275823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096107368","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.019693887,0.002775578,0.57510716,0.035706718,0.0016000454,0.0003222055,0.0010625011,0.0008357697,0.3628962],"genre_scores_gemma":[0.79835445,0.0058385623,0.11253762,0.0069122785,0.0029262176,0.0011068139,0.0014796237,0.0007561605,0.0700882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946315,0.001391358,0.00027817395,0.0009162305,0.0020258902,0.0007567864],"domain_scores_gemma":[0.9663862,0.025779696,0.00080926705,0.005260781,0.0012584658,0.00050562166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005354273,0.0019842535,0.0021032419,0.0022135337,0.004080205,0.00735741,0.004402075,0.00574374,0.018974924],"category_scores_gemma":[0.023600996,0.0015073854,0.00405016,0.00258706,0.010808896,0.051008087,0.00952545,0.018047998,0.004232562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003561471,0.000021843247,0.000053544834,0.00013533254,0.000015968582,0.000042481683,0.00008121418,0.0016461699,0.00013746029,0.9893175,0.003821325,0.0046916488],"study_design_scores_gemma":[0.0000072348785,0.0000036941326,0.000020232865,0.000021157703,0.000007632975,0.00002881116,0.000016563881,0.001712659,0.0001497582,0.9957837,0.0022435791,0.0000050176277],"about_ca_topic_score_codex":0.0007287063,"about_ca_topic_score_gemma":0.00071951345,"teacher_disagreement_score":0.018974924,"about_ca_system_score_codex":0.004128542,"about_ca_system_score_gemma":0.0017203236,"threshold_uncertainty_score":0.06347746},"labels":[],"label_agreement":null},{"id":"W2096113448","doi":"10.1007/978-3-642-02384-2_13","title":"Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":211,"is_retracted":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":"Credential; Scheme (mathematics); Computer science; Merkle signature scheme; Signature (topology); Computer security; Issuer; Authentication (law); Schnorr signature; Blind signature; Digital signature; Theoretical computer science; Mathematics; Hash function","score_opus":0.01146492847783279,"score_gpt":0.2295075769623096,"score_spread":0.21804264848447683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096113448","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.015154271,0.0020425087,0.96204466,0.000858751,0.00044193733,0.00011721436,0.00009289829,0.00046538847,0.0187823],"genre_scores_gemma":[0.56674606,0.004401634,0.40295297,0.00042516366,0.0010352554,0.00027260318,0.00013380601,0.00025217107,0.02378033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966354,0.000986033,0.0002568561,0.00038648714,0.0015111777,0.00022412404],"domain_scores_gemma":[0.9896567,0.0073381965,0.00049956655,0.001308596,0.00086027797,0.00033673437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036400172,0.0005759199,0.001311879,0.0017283041,0.0016981742,0.0062759602,0.0020030015,0.002911255,0.0049666497],"category_scores_gemma":[0.022485953,0.0008137414,0.0010849377,0.005006342,0.0045267595,0.00862245,0.00388467,0.005682091,0.0012953164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004326373,0.000029513967,0.00008721279,0.00005037093,0.0000075496796,0.00006160379,0.00026558415,0.008691522,0.0007093275,0.9606905,0.0011369367,0.028226519],"study_design_scores_gemma":[0.0000109948205,0.000016281972,0.00003862754,0.00001864558,0.000007285799,0.000101281934,0.000041906253,0.07844833,0.00075744657,0.9160487,0.0044890237,0.000021493683],"about_ca_topic_score_codex":0.0007090126,"about_ca_topic_score_gemma":0.0004921481,"teacher_disagreement_score":0.0062759602,"about_ca_system_score_codex":0.0018616997,"about_ca_system_score_gemma":0.001458493,"threshold_uncertainty_score":0.019250453},"labels":[],"label_agreement":null},{"id":"W2096184752","doi":"10.1007/11880240_39","title":"Model-Driven Assessment of Use Cases for Dependable Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"McGill University","funders":"","keywords":"Computer science","score_opus":0.026569030680823773,"score_gpt":0.2435252163680583,"score_spread":0.21695618568723452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096184752","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.33426687,0.00034316807,0.6517856,0.00032477395,0.000057650235,0.0006965293,0.00086119457,0.003827628,0.007836519],"genre_scores_gemma":[0.84786564,0.000120200784,0.14942288,0.000034389726,0.000008507525,0.00022435893,0.0009187619,0.00019136486,0.0012139027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944031,0.001925682,0.00023398164,0.00035699498,0.0028106475,0.00026949824],"domain_scores_gemma":[0.9819535,0.012732179,0.0007997203,0.0014944911,0.0027415785,0.00027846656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037403246,0.0010274348,0.0006952,0.0022814267,0.0004422288,0.0026066902,0.001873256,0.0015827051,0.0033586593],"category_scores_gemma":[0.030243224,0.0005713911,0.0010623671,0.00084392435,0.0007164962,0.0023608373,0.0012946294,0.0009794538,0.0005269641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097502157,0.0008518714,0.012940987,0.00043413174,0.00018439497,0.0006592188,0.0008298427,0.692528,0.025437407,0.026642032,0.004109585,0.23440745],"study_design_scores_gemma":[0.000012158982,0.00004430785,0.00057085126,0.00001738821,0.000015527832,0.00004492232,0.00005465709,0.98954517,0.0043360926,0.004863273,0.00048458955,0.0000110068295],"about_ca_topic_score_codex":0.0049215322,"about_ca_topic_score_gemma":0.007712452,"teacher_disagreement_score":0.0049215322,"about_ca_system_score_codex":0.0017391334,"about_ca_system_score_gemma":0.0013547228,"threshold_uncertainty_score":0.019780993},"labels":[],"label_agreement":null},{"id":"W2096196167","doi":"10.1007/978-3-642-13025-0_51","title":"On How Ants Put Advertisements on the Web","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"World Wide Web; Advertising; Computer science; Art; Business","score_opus":0.018549140194182995,"score_gpt":0.2630203748880114,"score_spread":0.2444712346938284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096196167","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51834476,0.004457978,0.1065874,0.027692288,0.00097507366,0.000085479165,0.0008127071,0.001824266,0.33922002],"genre_scores_gemma":[0.8698509,0.0015932107,0.03990959,0.0018941566,0.00010614433,0.00003722958,0.0005000835,0.0006203185,0.085488416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996457,0.0001730365,0.00001108534,0.00006188576,0.000057155823,0.00005104969],"domain_scores_gemma":[0.99842995,0.00097602187,0.000110057736,0.00017183505,0.0001915124,0.00012055921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044376953,0.00033082668,0.0003148075,0.00058108225,0.0012492524,0.0032384945,0.00081066997,0.0021020332,0.012168428],"category_scores_gemma":[0.004678282,0.0003519343,0.00046611973,0.0007207649,0.0014541923,0.0039146934,0.0010765503,0.0015316263,0.0034972613],"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.00073984487,0.00040255638,0.030103106,0.0005783002,0.00030368677,0.0013118655,0.01061662,0.04309478,0.02228379,0.46551457,0.095478304,0.32957262],"study_design_scores_gemma":[0.00012108581,0.00023125474,0.02234013,0.00029644746,0.00029073027,0.0015327716,0.009243623,0.16821788,0.011975673,0.5660104,0.21953695,0.0002029694],"about_ca_topic_score_codex":0.0077307816,"about_ca_topic_score_gemma":0.012841792,"teacher_disagreement_score":0.012168428,"about_ca_system_score_codex":0.000552081,"about_ca_system_score_gemma":0.0003602382,"threshold_uncertainty_score":0.04070747},"labels":[],"label_agreement":null},{"id":"W2096202410","doi":"10.1007/978-3-540-87744-8_67","title":"On the Size of the 3D Visibility Skeleton: Experimental Results","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Visibility; Skeleton (computer programming); Polytope; Combinatorics; Regular polygon; Set (abstract data type); Computer science; Mathematics; Geometry; Physics; Optics","score_opus":0.018876014687877463,"score_gpt":0.25185402980843297,"score_spread":0.2329780151205555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096202410","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.7702873,0.00372473,0.19494787,0.00034011176,0.00022318434,0.00023863031,0.0029030286,0.007586318,0.019748826],"genre_scores_gemma":[0.93401986,0.0009089236,0.057724643,0.000042824897,0.000029902982,0.00006261939,0.002248921,0.0016356921,0.0033265343],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850285,0.0002484935,0.00008778757,0.00027477148,0.0007029562,0.00018304372],"domain_scores_gemma":[0.98901933,0.007064562,0.0006677337,0.0017263379,0.0011741674,0.00034781054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012047298,0.0010307049,0.0009075471,0.0014856565,0.0005197917,0.001066162,0.0013339822,0.0011026604,0.012858129],"category_scores_gemma":[0.009407132,0.0005072578,0.00044838357,0.0015165363,0.0008793017,0.0017482684,0.0013983853,0.00064746983,0.0013791353],"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.0060514966,0.0025202052,0.0049584885,0.0015257564,0.00014708044,0.000228737,0.000509279,0.097524986,0.5740397,0.0046841647,0.0075463355,0.30026382],"study_design_scores_gemma":[0.00034957172,0.0017199098,0.008780927,0.00011953038,0.00019780755,0.0004409945,0.00042247443,0.3978185,0.5832562,0.0034423799,0.003375143,0.0000765841],"about_ca_topic_score_codex":0.0031755012,"about_ca_topic_score_gemma":0.0019491322,"teacher_disagreement_score":0.012858129,"about_ca_system_score_codex":0.00039434512,"about_ca_system_score_gemma":0.0004600017,"threshold_uncertainty_score":0.043014705},"labels":[],"label_agreement":null},{"id":"W2096348991","doi":"10.1007/11866565_23","title":"A Novel Quantitative Validation of the Cortical Surface Reconstruction Algorithm Using MRI Phantom: Issues on Local Geometric Accuracy and Cortical Thickness","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Imaging phantom; Metric (unit); Surface reconstruction; Computer science; Surface (topology); Measure (data warehouse); Cortex (anatomy); Cortical neurons; Artificial intelligence; Algorithm; Computer vision; Mathematics; Geometry; Neuroscience; Physics; Optics; Biology; Data mining","score_opus":0.032879602937274995,"score_gpt":0.35134884997505256,"score_spread":0.31846924703777757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096348991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12053468,0.0007652382,0.8723196,0.00040619425,0.00012472326,0.00021388943,0.00051628996,0.0024850757,0.0026343963],"genre_scores_gemma":[0.44160768,0.00043331902,0.553957,0.00018123283,0.00003848273,0.00015040369,0.0005925588,0.0012228388,0.0018165105],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975184,0.0008929037,0.00015760565,0.00029490422,0.0010638997,0.00007228124],"domain_scores_gemma":[0.9870323,0.006202922,0.0009723993,0.0027018643,0.0028886516,0.00020188022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006161615,0.0011449276,0.00067545165,0.0015400713,0.00049218,0.0023892485,0.001924755,0.0020949645,0.0028119376],"category_scores_gemma":[0.025687696,0.00062729086,0.00043009067,0.0011115618,0.00096738635,0.001801118,0.0013772465,0.0009830124,0.00072635844],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027980972,0.000674489,0.011547227,0.0013923813,0.00051067903,0.0007131606,0.00096606824,0.14004149,0.52794236,0.0135095995,0.0040326044,0.29587185],"study_design_scores_gemma":[0.00016657898,0.0006776536,0.007959102,0.00013143544,0.00019517484,0.0036556462,0.00018095362,0.66513544,0.31320325,0.0034225485,0.0051279096,0.00014423304],"about_ca_topic_score_codex":0.0020060942,"about_ca_topic_score_gemma":0.0019378203,"teacher_disagreement_score":0.006161615,"about_ca_system_score_codex":0.0006130411,"about_ca_system_score_gemma":0.0011959478,"threshold_uncertainty_score":0.032586098},"labels":[],"label_agreement":null},{"id":"W2096437854","doi":"10.1007/978-3-540-88582-5_14","title":"Multi-path GEM for Routing in Wireless Sensor Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Prince Edward Island","funders":"","keywords":"Computer science; Wireless sensor network; Network packet; Computer network; Routing (electronic design automation); Enhanced Data Rates for GSM Evolution; Routing protocol; Path (computing); Wireless; Disjoint sets; Distributed computing; Telecommunications","score_opus":0.019724695825990624,"score_gpt":0.2374328176512826,"score_spread":0.21770812182529198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096437854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002143085,0.0067280633,0.98059833,0.00035744935,0.00052429736,0.000037225625,0.00008621424,0.0011266586,0.008398595],"genre_scores_gemma":[0.092171185,0.011089099,0.8632042,0.0003915782,0.00053040864,0.0002077232,0.00045874837,0.0008628554,0.031084241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997421,0.00007182503,0.000015643469,0.000047016132,0.00010788242,0.000015614212],"domain_scores_gemma":[0.99972314,0.0001213281,0.000015757734,0.00008455007,0.00004308128,0.000012232908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050359016,0.0008238712,0.0006066999,0.0006802071,0.00040083248,0.00079520384,0.0013064774,0.00086252677,0.005560219],"category_scores_gemma":[0.0013071968,0.00039055024,0.00045742493,0.0014394802,0.0005380238,0.0020680616,0.00089368277,0.001631249,0.0019075586],"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.00009427461,0.000043222826,0.00016062414,0.00086574274,0.00005974485,0.00015443258,0.00016318035,0.086822614,0.009774342,0.29231483,0.032805175,0.5767418],"study_design_scores_gemma":[0.000023497054,0.00016630244,0.0002586729,0.0001731279,0.00005522295,0.00069109915,0.000069750065,0.50583315,0.0068847733,0.3261765,0.15963121,0.000036701582],"about_ca_topic_score_codex":0.00028467152,"about_ca_topic_score_gemma":0.000654916,"teacher_disagreement_score":0.005560219,"about_ca_system_score_codex":0.000533877,"about_ca_system_score_gemma":0.00030810767,"threshold_uncertainty_score":0.018600762},"labels":[],"label_agreement":null},{"id":"W2096609671","doi":"10.1007/978-3-642-16108-7_14","title":"PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Countable set; Learnability; Uncountable set; Mathematics; Discrete mathematics; Dimension (graph theory); Axiom; Class (philosophy); VC dimension; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.010013552157859299,"score_gpt":0.23918485540342774,"score_spread":0.22917130324556845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096609671","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.10987642,0.005686457,0.85691,0.012408726,0.0004260751,0.000093230534,0.00035904002,0.0005120255,0.013728044],"genre_scores_gemma":[0.8061915,0.003902335,0.17237467,0.0015532232,0.0012240477,0.00028945063,0.0006948369,0.0003658085,0.013404175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956441,0.0012175586,0.00024643505,0.001457607,0.0012099998,0.00022425887],"domain_scores_gemma":[0.9624278,0.031795677,0.0007946899,0.0028573337,0.0015697047,0.0005547425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005010339,0.0010032906,0.003062916,0.0013957348,0.0026563874,0.0051182364,0.0028178096,0.0031455813,0.002124588],"category_scores_gemma":[0.034593686,0.0014121924,0.002941463,0.0031686483,0.0075352504,0.01921191,0.006001843,0.013546631,0.0004123924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002352639,0.000076762815,0.001514164,0.00028902295,0.00012417321,0.000125321,0.00066647015,0.025378123,0.0012613918,0.89323467,0.005171571,0.07192308],"study_design_scores_gemma":[0.000016826201,0.000038581806,0.0003311494,0.000026350383,0.000031855634,0.00007956914,0.000061878214,0.07421062,0.0008712149,0.9219354,0.002370768,0.00002571706],"about_ca_topic_score_codex":0.0026933802,"about_ca_topic_score_gemma":0.0013931758,"teacher_disagreement_score":0.0051182364,"about_ca_system_score_codex":0.00321244,"about_ca_system_score_gemma":0.0018881632,"threshold_uncertainty_score":0.026497483},"labels":[],"label_agreement":null},{"id":"W2096634448","doi":"10.1007/978-3-540-69733-6_29","title":"Haplotype Inferring Via Galled-Tree Networks Is NP-Complete","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Mapping and Diversity in Plants and Animals","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Haplotype; Phylogenetic tree; Tree (set theory); Phylogenetic network; Computer science; International HapMap Project; Theoretical computer science; Biology; Combinatorics; Computational biology; Algorithm; Genetics; Mathematics; Genotype; Gene","score_opus":0.01831020583454654,"score_gpt":0.21662768321710366,"score_spread":0.19831747738255712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096634448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054107036,0.0009428208,0.91160643,0.0039935745,0.00015127053,0.00055437523,0.010646868,0.007887302,0.010110217],"genre_scores_gemma":[0.25035986,0.00084271666,0.7178767,0.0010850797,0.00021305772,0.0005029824,0.01838131,0.0010356639,0.00970269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845207,0.0003431388,0.00013593235,0.00053398625,0.00035561182,0.00017918635],"domain_scores_gemma":[0.9844558,0.012801178,0.00044361575,0.0015070562,0.00053236884,0.0002599988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018446496,0.0012948008,0.0023410902,0.0013630372,0.001492747,0.0035009992,0.0033626198,0.0029835338,0.018060932],"category_scores_gemma":[0.012380344,0.0016175637,0.0028716363,0.0025762427,0.001471425,0.009785414,0.0037537406,0.003155557,0.003177453],"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.0008802449,0.00046070296,0.0045242165,0.0014346236,0.00040867898,0.0006580901,0.0006597695,0.350173,0.0055042254,0.049965944,0.06636927,0.51896113],"study_design_scores_gemma":[0.0001715929,0.00005463364,0.0006128412,0.000068223504,0.00012671015,0.00031629525,0.00020066544,0.7657508,0.002235555,0.2243019,0.0061310055,0.000029808822],"about_ca_topic_score_codex":0.00619836,"about_ca_topic_score_gemma":0.012535184,"teacher_disagreement_score":0.018060932,"about_ca_system_score_codex":0.0016257385,"about_ca_system_score_gemma":0.002152831,"threshold_uncertainty_score":0.060419798},"labels":[],"label_agreement":null},{"id":"W2096692332","doi":"10.1007/978-3-642-23199-5_11","title":"GENCCS: A Correlated Group Difference Approach to Contrast Set Mining","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Contrast (vision); Computer science; Set (abstract data type); Data mining; Group (periodic table); Property (philosophy); Task (project management); Artificial intelligence; Space (punctuation); Value (mathematics); Machine learning","score_opus":0.0331577624955423,"score_gpt":0.2398708847056504,"score_spread":0.2067131222101081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096692332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008056972,0.00020269224,0.9875767,0.000098992634,0.00009343109,0.00020358164,0.00048981904,0.0023943565,0.0008833797],"genre_scores_gemma":[0.073342405,0.00011715218,0.9219626,0.00015040128,0.00010956847,0.00038722082,0.0017472204,0.00041961632,0.0017639091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804235,0.00062670885,0.000108470434,0.00045833513,0.00063974404,0.0001244049],"domain_scores_gemma":[0.99702114,0.0014964339,0.00011791867,0.00067317754,0.00057121593,0.000120154305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026187566,0.0010814922,0.0019675414,0.002540473,0.0010309677,0.0016493929,0.0040313387,0.001193883,0.0060276203],"category_scores_gemma":[0.00746538,0.0005989076,0.0017088312,0.0028954602,0.00081289164,0.0013975365,0.0031190473,0.0021440163,0.0018723498],"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.00087640557,0.00053963234,0.0039578285,0.0002798425,0.0004992573,0.00023945948,0.00028930337,0.042820927,0.014793295,0.026666243,0.019086866,0.8899508],"study_design_scores_gemma":[0.00013383258,0.00027131604,0.002379969,0.000031673277,0.00011556185,0.00023571872,0.00012318448,0.924838,0.008859265,0.05216856,0.010788374,0.000054522206],"about_ca_topic_score_codex":0.0033233943,"about_ca_topic_score_gemma":0.0064358637,"teacher_disagreement_score":0.0060276203,"about_ca_system_score_codex":0.00060581206,"about_ca_system_score_gemma":0.0016986026,"threshold_uncertainty_score":0.02016437},"labels":[],"label_agreement":null},{"id":"W2096724800","doi":"10.1007/978-3-319-02786-9_2","title":"A True Random Generator Using Human Gameplay","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Generator (circuit theory); Theoretical computer science; Programming language; Power (physics); Physics","score_opus":0.023723392996917118,"score_gpt":0.2605503918274431,"score_spread":0.236826998830526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096724800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013354362,0.000058965117,0.974376,0.00031010254,0.000119144504,0.00016644546,0.000045607925,0.0011803093,0.010388963],"genre_scores_gemma":[0.59149855,0.00011125576,0.38206324,0.0002883958,0.00008326784,0.00049283495,0.0001389056,0.00047383932,0.024849739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826294,0.0009705275,0.000051094623,0.00024269691,0.00037165466,0.00010115781],"domain_scores_gemma":[0.9955249,0.0032437916,0.00010275562,0.00068903976,0.00027116115,0.00016832267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021699527,0.0006946235,0.00059415394,0.0004260848,0.0005584102,0.0015399313,0.0016919973,0.0011252761,0.013869296],"category_scores_gemma":[0.010554333,0.00039346397,0.00037807034,0.00024130021,0.0015119726,0.0021594472,0.001962289,0.001088089,0.0021828606],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010163495,0.0002879735,0.0015173823,0.00028397137,0.00009809179,0.0004445263,0.00074878166,0.13021548,0.017357709,0.6160221,0.01351889,0.21848883],"study_design_scores_gemma":[0.00014838473,0.00018278946,0.00013769121,0.00003371454,0.000026612797,0.0002880455,0.00006967558,0.80146265,0.006073898,0.18300328,0.008543045,0.000030232415],"about_ca_topic_score_codex":0.00046743386,"about_ca_topic_score_gemma":0.0005486432,"teacher_disagreement_score":0.013869296,"about_ca_system_score_codex":0.00042881485,"about_ca_system_score_gemma":0.0007533395,"threshold_uncertainty_score":0.046397388},"labels":[],"label_agreement":null},{"id":"W2096938398","doi":"10.1007/978-3-540-77366-5_11","title":"Using a Personal Device to Strengthen Password Authentication from an Untrusted Computer","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canada Research Chairs","keywords":"Password; Computer science; Authentication (law); Computer security; S/KEY; One-time password","score_opus":0.06924603919829157,"score_gpt":0.309095303838302,"score_spread":0.23984926464001044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096938398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11602782,0.002641689,0.7505659,0.0014212698,0.0017196588,0.0003200513,0.00019138402,0.007191028,0.11992118],"genre_scores_gemma":[0.7755959,0.0017152515,0.14705196,0.00083004317,0.00041712343,0.00013950223,0.00020789262,0.00049688923,0.073545545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990982,0.00017998365,0.00006517432,0.00016948162,0.0003387824,0.00014852482],"domain_scores_gemma":[0.9975586,0.0005146291,0.00011418242,0.0013628566,0.00035026093,0.00009954961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006548742,0.000806311,0.00055252237,0.0008180022,0.0009794347,0.001654221,0.0012762236,0.0017623177,0.014769913],"category_scores_gemma":[0.0023858547,0.00052025885,0.00064684753,0.0005853575,0.0011839067,0.004864596,0.0031022588,0.0022196537,0.009498826],"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.001125088,0.0002849273,0.0019090193,0.0008902556,0.00012506284,0.001728881,0.0015142905,0.0022292365,0.43491727,0.09918329,0.018092388,0.43800035],"study_design_scores_gemma":[0.00015561351,0.0017363427,0.0028006358,0.00039641955,0.0004068824,0.009021077,0.0004582751,0.039540034,0.69357675,0.030006299,0.2217178,0.00018389443],"about_ca_topic_score_codex":0.00016044267,"about_ca_topic_score_gemma":0.00024394724,"teacher_disagreement_score":0.014769913,"about_ca_system_score_codex":0.00023816197,"about_ca_system_score_gemma":0.00030088332,"threshold_uncertainty_score":0.049410284},"labels":[],"label_agreement":null},{"id":"W2097049847","doi":"10.1007/3-540-44985-x_12","title":"On Graph Powers for Leaf-Labeled Trees","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Graph; Gomory–Hu tree; Combinatorics; Computer science; K-ary tree; Path (computing); Basis (linear algebra); Spanning tree; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Mathematics; Artificial intelligence; Binary tree; Physics","score_opus":0.020033376454771587,"score_gpt":0.2843146293703784,"score_spread":0.2642812529156068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097049847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045313474,0.0046123,0.63050705,0.0049116504,0.0013523776,0.00021008741,0.00080045074,0.0012482068,0.31104442],"genre_scores_gemma":[0.53528553,0.008634308,0.26527658,0.0025384275,0.003275055,0.00065486296,0.002324511,0.003322514,0.17868815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835277,0.0006083628,0.000100126075,0.00031045204,0.00045687234,0.00017144218],"domain_scores_gemma":[0.9938725,0.0041826153,0.00024173231,0.00094314234,0.00041727026,0.00034270532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017619468,0.0013764461,0.0014965499,0.00263967,0.0019966566,0.0034911563,0.002177472,0.0015479642,0.021802995],"category_scores_gemma":[0.009490051,0.0013579677,0.0018956492,0.0036703236,0.004888738,0.015609659,0.004575395,0.0070744357,0.0059547094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040222185,0.0000270251,0.00014331687,0.00010513414,0.000007617656,0.00007307153,0.00040656724,0.0011294783,0.0005572282,0.9710189,0.006906033,0.019585446],"study_design_scores_gemma":[0.000005213796,0.0000036909419,0.00004253305,0.000016075588,0.000004601848,0.000047094705,0.000031464064,0.0016928343,0.00017261408,0.99202347,0.005956424,0.000004016407],"about_ca_topic_score_codex":0.0012816021,"about_ca_topic_score_gemma":0.0018941351,"teacher_disagreement_score":0.021802995,"about_ca_system_score_codex":0.0014894145,"about_ca_system_score_gemma":0.00048009836,"threshold_uncertainty_score":0.07293826},"labels":[],"label_agreement":null},{"id":"W2097100778","doi":"10.1007/978-3-642-33515-0_40","title":"Modeling and Autonomous Control of Multiple Mobile Manipulators Handling Rigid Objects","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Computer science; Nonholonomic system; MATLAB; Mobile robot; Terrain; Control engineering; Mobile manipulator; Unmanned ground vehicle; Simulation; Artificial intelligence; Robot; Engineering","score_opus":0.0189640485867582,"score_gpt":0.23666944338876683,"score_spread":0.21770539480200862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097100778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037730634,0.0008029937,0.9540436,0.00011111451,0.00006179896,0.000038154438,0.000053501983,0.00035171784,0.0068065827],"genre_scores_gemma":[0.9011717,0.0010681829,0.08366931,0.000036871166,0.00004875519,0.00022437466,0.0001780877,0.000069929294,0.013532768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998536,0.000017365868,0.000006591359,0.00003277166,0.00007167121,0.000018009661],"domain_scores_gemma":[0.9999163,0.000026680465,0.000024078749,0.000009991264,0.000016657228,0.0000062708127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014597444,0.00056928326,0.0005618417,0.0002981662,0.00033906105,0.00070378464,0.0011113987,0.0007624014,0.0014253713],"category_scores_gemma":[0.00031076514,0.0005000448,0.00061860785,0.0003987198,0.00044927903,0.0006056582,0.0006156916,0.0005319397,0.00033512386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002144091,0.00001627259,0.00010383529,0.00004129747,0.000011843009,0.00005072458,0.000034819757,0.97147655,0.0053453324,0.0047552367,0.00022373456,0.017918821],"study_design_scores_gemma":[0.0000035733551,0.000023329574,0.00009951223,0.0000025627155,0.0000035800545,0.000014002145,0.0000053871167,0.99678564,0.00052616093,0.001920714,0.0006121275,0.0000034407776],"about_ca_topic_score_codex":0.007515971,"about_ca_topic_score_gemma":0.005952931,"teacher_disagreement_score":0.007515971,"about_ca_system_score_codex":0.00039550636,"about_ca_system_score_gemma":0.0005399303,"threshold_uncertainty_score":0.014944434},"labels":[],"label_agreement":null},{"id":"W2097166518","doi":"10.1007/978-3-540-73105-4_19","title":"Emotional Experiences and Quality Perceptions of Interactive Products","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color perception and design","field":"Psychology","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":"Carleton University","funders":"","keywords":"Perception; Feeling; Context (archaeology); Usability; Quality (philosophy); Psychology; Cognitive psychology; Cognition; Human–computer interaction; Social psychology; Computer science; Epistemology","score_opus":0.0775238649921577,"score_gpt":0.3788457071520859,"score_spread":0.3013218421599282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097166518","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.98922414,0.00051937293,0.0006637141,0.0000995677,0.000014161785,0.00001153981,0.000026147361,0.000006211455,0.009435164],"genre_scores_gemma":[0.99737966,0.0002637856,0.00034217126,0.000053366784,0.000015883837,0.000009943512,0.000036746165,0.000009251153,0.0018891303],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99949586,0.00016336817,0.00002190558,0.000036250425,0.00022105947,0.0000616098],"domain_scores_gemma":[0.9971495,0.0015257942,0.00073096226,0.00007132573,0.000291309,0.00023104381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008347167,0.00023540366,0.00015501991,0.0003609068,0.00032952536,0.0021640346,0.00023551118,0.0004669787,0.0047816443],"category_scores_gemma":[0.0058579915,0.00019376037,0.0002845258,0.0003148084,0.00044757366,0.00079644116,0.0009845645,0.0006762349,0.00019525219],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006664382,0.0028361843,0.4051187,0.0016966248,0.0009212398,0.0019715843,0.13045952,0.0024004213,0.16937535,0.012350305,0.004199897,0.26200584],"study_design_scores_gemma":[0.000057035726,0.0008632444,0.9628385,0.000118589356,0.0001413914,0.000588006,0.024319276,0.0012598076,0.0038194961,0.002310693,0.0036329133,0.000051050243],"about_ca_topic_score_codex":0.00083541306,"about_ca_topic_score_gemma":0.0008083008,"teacher_disagreement_score":0.0047816443,"about_ca_system_score_codex":0.00027671322,"about_ca_system_score_gemma":0.00009044636,"threshold_uncertainty_score":0.015996158},"labels":[],"label_agreement":null},{"id":"W2097241528","doi":"10.1007/978-3-642-36594-2_29","title":"On the Feasibility of Extending Oblivious Transfer","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"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":"Azrieli Foundation; Israel Science Foundation","keywords":"Oblivious transfer; Computer science; Extension (predicate logic); Cryptography; Protocol (science); Theoretical computer science; Transfer (computing); Algorithm","score_opus":0.03246745879794471,"score_gpt":0.2591633127104742,"score_spread":0.2266958539125295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097241528","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.12121776,0.004065942,0.409863,0.013000257,0.00094184524,0.00021311388,0.0007572177,0.0011579825,0.44878286],"genre_scores_gemma":[0.9013239,0.0029496588,0.052798536,0.0015355775,0.0011341551,0.00043240358,0.0005793173,0.000509086,0.038737357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651283,0.0011617683,0.00018340841,0.00059153995,0.00094028725,0.0006102296],"domain_scores_gemma":[0.97454745,0.01950254,0.000665176,0.003953332,0.0009790779,0.00035232102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039980784,0.0009835908,0.0013717343,0.0011901594,0.0024684302,0.00353892,0.002489185,0.0026404005,0.015492189],"category_scores_gemma":[0.019796276,0.0009944362,0.0016216919,0.0018348162,0.0069869724,0.024744522,0.007398751,0.008388256,0.0023436083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020846038,0.000026003518,0.00010507508,0.00009485476,0.000009072436,0.00004775782,0.00013566224,0.0033075516,0.0006322333,0.9826354,0.0025952433,0.010202565],"study_design_scores_gemma":[0.000021428512,0.000015817957,0.00004189458,0.00002346306,0.00000758352,0.000032207234,0.000023224544,0.005283057,0.000506032,0.9914278,0.002610125,0.000007335312],"about_ca_topic_score_codex":0.00088398374,"about_ca_topic_score_gemma":0.00047521113,"teacher_disagreement_score":0.015492189,"about_ca_system_score_codex":0.0018066405,"about_ca_system_score_gemma":0.0016023039,"threshold_uncertainty_score":0.051826596},"labels":[],"label_agreement":null},{"id":"W2097410395","doi":"10.1007/978-3-642-40498-6_14","title":"Evaluating the Effect of Phrase Set in Hindi Text Entry","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Phrase; Hindi; Computer science; Natural language processing; Set (abstract data type); Variety (cybernetics); Selection (genetic algorithm); Artificial intelligence; Text entry; Speech recognition; Human–computer interaction","score_opus":0.02251315131832635,"score_gpt":0.31180825738141443,"score_spread":0.28929510606308806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097410395","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.9789773,0.0033014952,0.0058601266,0.00031849684,0.0007166924,0.00028433092,0.00205921,0.0024853991,0.005996862],"genre_scores_gemma":[0.96103936,0.0015589263,0.022459248,0.0002521687,0.00042493313,0.00023007566,0.008288952,0.0008736765,0.004872702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941796,0.0026540984,0.00078829395,0.00087316794,0.0012613707,0.00024356272],"domain_scores_gemma":[0.8573977,0.13125354,0.0032591776,0.0027540703,0.0033559427,0.0019795946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004584051,0.002416927,0.0015475412,0.0014874812,0.001014111,0.0035798908,0.001439862,0.0017041604,0.007445458],"category_scores_gemma":[0.05715786,0.000706547,0.0010878205,0.0018346763,0.0009108116,0.0043356083,0.0024325645,0.0020811765,0.0031749245],"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.082482316,0.007325397,0.026333023,0.0062952065,0.0013587177,0.0011826007,0.0025483784,0.02217714,0.15006277,0.0007738053,0.015540816,0.68391985],"study_design_scores_gemma":[0.00835788,0.110643454,0.25175968,0.0015262102,0.006053625,0.0030745305,0.008553796,0.32541788,0.25474232,0.006835199,0.0216668,0.0013685375],"about_ca_topic_score_codex":0.0036405863,"about_ca_topic_score_gemma":0.0042967047,"teacher_disagreement_score":0.007445458,"about_ca_system_score_codex":0.0005632073,"about_ca_system_score_gemma":0.0012194227,"threshold_uncertainty_score":0.02490753},"labels":[],"label_agreement":null},{"id":"W2097589562","doi":"10.1007/3-540-36189-8_19","title":"On Requirements for Ontologies in Management of Web Services","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":50,"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":"World Wide Web; Knowledge management; Computer science; Business; Process management","score_opus":0.02242831749674804,"score_gpt":0.2587669016454911,"score_spread":0.23633858414874306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097589562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015649883,0.0012535366,0.9074479,0.008453038,0.0003269609,0.0010419684,0.00046141937,0.0006312267,0.064734064],"genre_scores_gemma":[0.24081226,0.0024915487,0.73593074,0.0014762196,0.00035513082,0.0012427667,0.002030233,0.00063533365,0.015025721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98288363,0.0062411143,0.0024878196,0.0008247885,0.006257199,0.0013054531],"domain_scores_gemma":[0.97711986,0.01542483,0.0009220887,0.0022541517,0.0037258475,0.0005531907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0146789085,0.0010134488,0.0012905778,0.002399601,0.0025545135,0.007061789,0.0034686085,0.004417327,0.0059444155],"category_scores_gemma":[0.039825417,0.0017769978,0.002018644,0.0025226872,0.004021813,0.016112132,0.004683523,0.005631464,0.0019124055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071741124,0.0001207011,0.00033196624,0.0003042629,0.000027539278,0.0007058528,0.0028871296,0.011247127,0.003238377,0.9316455,0.006863704,0.042555977],"study_design_scores_gemma":[0.00008027474,0.00007536592,0.00057416735,0.00091061194,0.00008582296,0.0008539275,0.0026073551,0.08213537,0.007270186,0.76187015,0.14343734,0.000099461955],"about_ca_topic_score_codex":0.008958946,"about_ca_topic_score_gemma":0.0076102833,"teacher_disagreement_score":0.0146789085,"about_ca_system_score_codex":0.0032805123,"about_ca_system_score_gemma":0.0038117715,"threshold_uncertainty_score":0.0776304},"labels":[],"label_agreement":null},{"id":"W2097734862","doi":"10.1007/978-3-319-14974-5_3","title":"Constant Approximation for Broadcasting in k-cycle Graph","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Computer science; Time complexity; Vertex (graph theory); Discrete mathematics; Graph; Butterfly graph; Mathematics; Line graph; Voltage graph","score_opus":0.043736498008255215,"score_gpt":0.2718830829612063,"score_spread":0.22814658495295106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097734862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17536254,0.00869865,0.6910919,0.009614012,0.0012149512,0.00078513427,0.00439808,0.0094671175,0.09936754],"genre_scores_gemma":[0.59152085,0.0053586676,0.34994364,0.0017862968,0.0009955654,0.0010198115,0.0052099125,0.0025215915,0.04164368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779594,0.0003784543,0.00007565737,0.0005705632,0.00063455064,0.0005448089],"domain_scores_gemma":[0.9936492,0.0037749854,0.00028820432,0.001446401,0.00039359572,0.00044757186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529187,0.0026388564,0.002951695,0.0019254888,0.0021621182,0.0044197543,0.007440153,0.0029331925,0.022029871],"category_scores_gemma":[0.010665716,0.0010328164,0.002051738,0.0057423627,0.0022585692,0.009922023,0.003983783,0.0055933874,0.0045541697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002636325,0.0009261417,0.0019015431,0.0022666727,0.00029700308,0.00026995593,0.001059031,0.26063418,0.012261985,0.32073647,0.11033007,0.28668073],"study_design_scores_gemma":[0.0004215442,0.0001630342,0.00068296376,0.00018482964,0.00025364547,0.00034628616,0.0002685662,0.53800327,0.0041448465,0.44039965,0.015070435,0.0000609248],"about_ca_topic_score_codex":0.010175026,"about_ca_topic_score_gemma":0.011803627,"teacher_disagreement_score":0.022029871,"about_ca_system_score_codex":0.008288694,"about_ca_system_score_gemma":0.004689132,"threshold_uncertainty_score":0.07369727},"labels":[],"label_agreement":null},{"id":"W2097890722","doi":"10.1007/978-3-540-74999-8_90","title":"CINDI at ImageCLEF 2006: Image Retrieval &amp; Annotation Tasks for the General Photographic and Medical Image Collections","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Image retrieval; Automatic image annotation; Annotation; Information retrieval; Relevance feedback; Artificial intelligence; Support vector machine; Visual Word; Image (mathematics); Computer vision; Pattern recognition (psychology)","score_opus":0.02355815309158841,"score_gpt":0.29460326321179386,"score_spread":0.27104511012020543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097890722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013035312,0.034530174,0.58667415,0.0077342447,0.006661717,0.0022181752,0.10499181,0.15210845,0.09204594],"genre_scores_gemma":[0.021781282,0.009401623,0.5667075,0.0031129252,0.0016675058,0.0011990886,0.23495342,0.019306159,0.14187054],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99687696,0.00040961656,0.00016218695,0.0008965968,0.0013528353,0.0003017953],"domain_scores_gemma":[0.9964904,0.0008125375,0.00013238126,0.0008696613,0.001279871,0.00041516923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040602554,0.004374498,0.0036328475,0.008243883,0.0015960223,0.003930362,0.0067049335,0.0038948802,0.040877793],"category_scores_gemma":[0.0057623168,0.0016698375,0.0019132402,0.008475144,0.0008162631,0.00486799,0.002816,0.0049831113,0.040525068],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010203244,0.00014078827,0.00014787854,0.0005523178,0.00004691602,0.00009348365,0.000064205036,0.0005652553,0.009163282,0.0018661085,0.72016126,0.26709646],"study_design_scores_gemma":[0.00012930181,0.00026049884,0.003606674,0.00035164374,0.00019069281,0.0015959976,0.00009654004,0.019947527,0.06789778,0.012308356,0.89336574,0.00024910175],"about_ca_topic_score_codex":0.012283586,"about_ca_topic_score_gemma":0.02282166,"teacher_disagreement_score":0.040877793,"about_ca_system_score_codex":0.0026107684,"about_ca_system_score_gemma":0.0031743483,"threshold_uncertainty_score":0.1367498},"labels":[],"label_agreement":null},{"id":"W2097928083","doi":"10.1007/3-540-45512-4_1","title":"Panel Discussion: How Will Media Distribution Work in the Internet?","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","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 Ottawa","funders":"","keywords":"Computer science; Provisioning; The Internet; Multimedia; Work (physics); Video streaming; Minor (academic); World Wide Web; Panel discussion; Internet traffic; Computer network","score_opus":0.04007506912388005,"score_gpt":0.28539574087608405,"score_spread":0.245320671752204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097928083","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044501615,0.001149769,0.001185319,0.9146252,0.005886798,0.00012866042,0.00070381066,0.000051929208,0.071818404],"genre_scores_gemma":[0.1300652,0.00495776,0.0024368865,0.5806223,0.015241483,0.0009360326,0.0009939453,0.00023754389,0.2645089],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983335,0.00052565464,0.00006495101,0.00028120624,0.00047612286,0.00031855365],"domain_scores_gemma":[0.9894003,0.0059950124,0.0003597573,0.00027163562,0.002550913,0.0014223916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009893952,0.00064506615,0.00061265705,0.0006443789,0.0055221426,0.0076751406,0.002129972,0.024228077,0.04874561],"category_scores_gemma":[0.020423908,0.0004217982,0.0010024504,0.0010559538,0.0014155492,0.007919124,0.0025544444,0.011446411,0.014167642],"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.00009271685,0.00007867636,0.0017686692,0.00011093812,0.000015141818,0.00018764558,0.0010083249,0.0003632432,0.0004654821,0.029317815,0.94855684,0.018034585],"study_design_scores_gemma":[0.0000787257,0.00006714937,0.0044717565,0.00046399285,0.00008224521,0.00014485575,0.009141477,0.0008737287,0.0015223442,0.028632741,0.9544271,0.000093795294],"about_ca_topic_score_codex":0.0067443666,"about_ca_topic_score_gemma":0.0068992334,"teacher_disagreement_score":0.04874561,"about_ca_system_score_codex":0.003060219,"about_ca_system_score_gemma":0.0046933666,"threshold_uncertainty_score":0.16307026},"labels":[],"label_agreement":null},{"id":"W2098058209","doi":"10.1007/978-3-642-33415-3_37","title":"Oriented Pattern Analysis for Streak Detection in Dermoscopy Images","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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 British Columbia; Canadian Centre for Applied Research in Cancer Control; Simon Fraser University","funders":"Canadian Institutes of Health Research","keywords":"Streak; Computer science; Artificial intelligence; Visualization; Pattern recognition (psychology); Computer vision; Ridge; Cartography; Geology; Geography","score_opus":0.011756773911734209,"score_gpt":0.27451858298535636,"score_spread":0.2627618090736222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098058209","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.14110275,0.00071913184,0.8528806,0.00018167439,0.00006401549,0.00017095463,0.00051787496,0.002158117,0.0022048391],"genre_scores_gemma":[0.45694226,0.0011798659,0.537402,0.00008800879,0.000056321216,0.00013208698,0.00090015045,0.00031515505,0.0029841554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.00003289119,0.000022378797,0.00004159252,0.000100984704,0.00003765147],"domain_scores_gemma":[0.9992902,0.00022763145,0.00008554932,0.00007385553,0.00027909916,0.000043599084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003279674,0.0005347706,0.00047922917,0.0033532558,0.00025671255,0.0008059595,0.0003829702,0.00046551158,0.0024811917],"category_scores_gemma":[0.001164255,0.00019329609,0.0004992554,0.001733642,0.00020272566,0.00052216556,0.0003661655,0.00041568198,0.0010383467],"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.00060738606,0.00014393317,0.007390746,0.00032311695,0.00006913211,0.00034375617,0.00011496482,0.005438279,0.21991348,0.0013707799,0.001876302,0.7624082],"study_design_scores_gemma":[0.00007451045,0.00038356977,0.050082162,0.00008692697,0.00021473697,0.0030371237,0.00040292108,0.7471938,0.18479462,0.005498283,0.008159631,0.00007166967],"about_ca_topic_score_codex":0.0015588817,"about_ca_topic_score_gemma":0.0019156612,"teacher_disagreement_score":0.0033532558,"about_ca_system_score_codex":0.00023000529,"about_ca_system_score_gemma":0.00047632764,"threshold_uncertainty_score":0.008300424},"labels":[],"label_agreement":null},{"id":"W2098244846","doi":"10.1007/978-3-642-31454-4_33","title":"Improving Matrix Factorization Techniques of Student Test Data with Partial Order Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Polytechnique Montréal","funders":"","keywords":"Factorization; Computer science; Matrix decomposition; Matrix (chemical analysis); Dixon's factorization method; Incomplete Cholesky factorization; Order (exchange); Incomplete LU factorization; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.030206322679963142,"score_gpt":0.28834290615691033,"score_spread":0.2581365834769472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098244846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009524941,0.00034403615,0.988345,0.00011116467,0.000054069507,0.00008248242,0.00034321917,0.0008311803,0.00036396208],"genre_scores_gemma":[0.1279286,0.0004499827,0.863845,0.00013225783,0.00025107298,0.00033995076,0.0036090794,0.00043184293,0.0030121817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577963,0.0020592427,0.00030400231,0.00056421146,0.00093945925,0.0003534714],"domain_scores_gemma":[0.97143835,0.022115773,0.0008168188,0.002558758,0.0025950007,0.00047542492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054439306,0.0016811577,0.0021787975,0.001994256,0.00076959544,0.001429712,0.0024213572,0.0012662382,0.0058388696],"category_scores_gemma":[0.028579755,0.000929311,0.0022231615,0.0027655342,0.00068395975,0.0032298015,0.0018229655,0.0033794842,0.0026199517],"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.000803367,0.00053599494,0.0047023515,0.00045397464,0.00034268064,0.00021364981,0.00034277985,0.104759656,0.010338956,0.011615075,0.014339469,0.8515522],"study_design_scores_gemma":[0.00005623065,0.00020285074,0.0016547098,0.000032848977,0.00006038384,0.00018274187,0.00010536935,0.97795206,0.0039199805,0.012729118,0.0030713342,0.000032422184],"about_ca_topic_score_codex":0.009227505,"about_ca_topic_score_gemma":0.012737456,"teacher_disagreement_score":0.009227505,"about_ca_system_score_codex":0.00055404037,"about_ca_system_score_gemma":0.0023358925,"threshold_uncertainty_score":0.028790593},"labels":[],"label_agreement":null},{"id":"W2098324440","doi":"10.1007/978-3-642-00727-9_15","title":"Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"Probabilistic logic; Hamming distance; Computer science; Motif (music); Sequence motif; Sequence (biology); Set (abstract data type); Algorithm; Artificial intelligence; Pattern recognition (psychology); Data mining; Genetics; DNA; Biology","score_opus":0.03155034304489479,"score_gpt":0.2733723973246741,"score_spread":0.24182205427977932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098324440","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.014667375,0.0011408255,0.98283017,0.00020613233,0.000019612482,0.00003005924,0.00024196033,0.0005872363,0.00027667754],"genre_scores_gemma":[0.10859359,0.0011740628,0.8879039,0.00011481827,0.000101557314,0.000102968195,0.0010348161,0.00020375864,0.0007704717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981865,0.0004006748,0.00018314636,0.00059506996,0.0005517087,0.000082893224],"domain_scores_gemma":[0.98880905,0.00930772,0.00058384,0.0007547429,0.0003799596,0.00016480313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028975783,0.000905227,0.0016459126,0.0034044192,0.0006074141,0.0020767702,0.0029445118,0.001498909,0.0016862876],"category_scores_gemma":[0.01417859,0.001304977,0.0019968867,0.0043229656,0.0012261507,0.0035140605,0.0022207852,0.0020543847,0.0007648881],"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.00031386185,0.00025771325,0.016480448,0.0010000188,0.0004325009,0.0004928326,0.00045991936,0.11904315,0.03158114,0.02365335,0.00503871,0.80124635],"study_design_scores_gemma":[0.000025515934,0.0000842472,0.003075751,0.000046870067,0.000095852396,0.0008445656,0.000088359724,0.8603823,0.005328682,0.12720084,0.0027747068,0.000052322754],"about_ca_topic_score_codex":0.001297282,"about_ca_topic_score_gemma":0.0027002643,"teacher_disagreement_score":0.0034044192,"about_ca_system_score_codex":0.00053823437,"about_ca_system_score_gemma":0.00071123877,"threshold_uncertainty_score":0.015324056},"labels":[],"label_agreement":null},{"id":"W2098337892","doi":"10.1007/3-540-45401-2_10","title":"Correcting Errors in Message Passing Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Debugger; Message passing; Debugging; Abstraction; Programming language; Distributed computing; Parallel computing; Theoretical computer science","score_opus":0.02131431841208247,"score_gpt":0.26051443355630816,"score_spread":0.23920011514422568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098337892","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.02131808,0.0016152071,0.9683908,0.00045259614,0.0004131262,0.000060055667,0.000044555163,0.0023883916,0.005317072],"genre_scores_gemma":[0.6703164,0.002672776,0.29356897,0.00029545717,0.000716369,0.00021163172,0.00023110268,0.00085655274,0.031130789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961475,0.0012688517,0.0002093886,0.00033604505,0.0016528434,0.0003853009],"domain_scores_gemma":[0.98874795,0.0064250263,0.00072364375,0.0024430994,0.0014810298,0.00017928821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030286482,0.0013622722,0.0016045184,0.001244915,0.0013366351,0.0023013023,0.001845215,0.0020439015,0.0035490843],"category_scores_gemma":[0.019261,0.0009572077,0.00053011626,0.0019074298,0.0021295273,0.0035857128,0.0023635377,0.0025427626,0.0013490372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056778034,0.00010844775,0.001142473,0.0004911768,0.00008493616,0.00024840323,0.0006814744,0.35325247,0.007954479,0.33411396,0.010891058,0.29046333],"study_design_scores_gemma":[0.00007344888,0.00012792487,0.00021720302,0.000076658325,0.000053412226,0.00016551265,0.000069951195,0.5427343,0.01960363,0.422871,0.013959275,0.000047690337],"about_ca_topic_score_codex":0.0011966571,"about_ca_topic_score_gemma":0.00095086725,"teacher_disagreement_score":0.0035490843,"about_ca_system_score_codex":0.00092555414,"about_ca_system_score_gemma":0.0011782337,"threshold_uncertainty_score":0.016017199},"labels":[],"label_agreement":null},{"id":"W2098375093","doi":"10.1007/978-3-642-27654-5_30","title":"State Complexity of Kleene-Star Operations on Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Star (game theory); Iterated function; String (physics); Computer science; State (computer science); Tree (set theory); Algorithm; Regular language; Discrete mathematics; Extension (predicate logic); Combinatorics; Mathematics; Theoretical computer science; Automaton","score_opus":0.03429629418638434,"score_gpt":0.25736712697763525,"score_spread":0.2230708327912509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098375093","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.82321763,0.0010148714,0.12365782,0.0017017646,0.00007610097,0.000070791924,0.001252844,0.00034393626,0.048664305],"genre_scores_gemma":[0.98136044,0.00048332626,0.009587483,0.000054770837,0.0000950875,0.00007085399,0.0007416178,0.00010972124,0.0074967025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984285,0.00027009493,0.00010589767,0.00024203675,0.00063939276,0.0003140189],"domain_scores_gemma":[0.9904944,0.00722934,0.00050034764,0.00074781786,0.0006472331,0.00038080578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009419211,0.00042670403,0.0010806961,0.0011596676,0.0012819995,0.0054818294,0.0014652635,0.0012706788,0.009012155],"category_scores_gemma":[0.0070984787,0.0006142468,0.0012173171,0.0021572588,0.0020351084,0.010556037,0.0016615767,0.0028337422,0.0006158342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026716894,0.0001168587,0.0013155572,0.0001330984,0.00003079884,0.00009220037,0.00064822915,0.02863388,0.003614565,0.9468491,0.0019525306,0.01634601],"study_design_scores_gemma":[0.00002255728,0.000026687909,0.0006683406,0.000011172032,0.000018816243,0.000049004397,0.00010562523,0.065684155,0.0016291402,0.93094295,0.0008213966,0.000020157968],"about_ca_topic_score_codex":0.0022147063,"about_ca_topic_score_gemma":0.002588867,"teacher_disagreement_score":0.009012155,"about_ca_system_score_codex":0.0022706913,"about_ca_system_score_gemma":0.0013507149,"threshold_uncertainty_score":0.030148685},"labels":[],"label_agreement":null},{"id":"W2098379865","doi":"10.1007/978-3-642-14192-8_11","title":"Validation of the Effectiveness of an Optimized EPMcreate as an Aid for Creative Requirements Elicitation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Waterloo","funders":"","keywords":"Brainstorming; Creativity; Computer science; Requirements elicitation; Context (archaeology); Principal (computer security); Quality (philosophy); Management science; Human–computer interaction; Artificial intelligence; Requirements analysis; Psychology; Engineering","score_opus":0.022037807489777714,"score_gpt":0.3059368114280506,"score_spread":0.2838990039382729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098379865","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.70161784,0.00011988226,0.28355443,0.00015858571,0.00006280689,0.00088034594,0.00074367336,0.0058237696,0.0070386725],"genre_scores_gemma":[0.62023133,0.00006756821,0.3756662,0.00006087699,0.0000054867833,0.0004532341,0.0006698104,0.0003072718,0.0025382314],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974947,0.0010516985,0.00023042306,0.00032339667,0.00076368643,0.00013616864],"domain_scores_gemma":[0.9759294,0.01790206,0.0005358767,0.0029618093,0.0023970979,0.00027376143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031357568,0.0006772572,0.00037668512,0.0006453804,0.0002823257,0.0009130851,0.001425174,0.000882518,0.0050318935],"category_scores_gemma":[0.02169206,0.00033272037,0.00025068293,0.00048762577,0.0003850154,0.000873426,0.0011642016,0.00048197716,0.001208757],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005106341,0.002535467,0.0055783396,0.0015284314,0.00012949311,0.000662152,0.002072475,0.06588493,0.29197708,0.0055691353,0.0040387725,0.61491734],"study_design_scores_gemma":[0.00067785644,0.0031083326,0.010082785,0.00017719167,0.00019475922,0.0007567791,0.0007299422,0.51178885,0.45956576,0.0014348674,0.011366672,0.000116189396],"about_ca_topic_score_codex":0.0014912545,"about_ca_topic_score_gemma":0.0011844423,"teacher_disagreement_score":0.0050318935,"about_ca_system_score_codex":0.0004002652,"about_ca_system_score_gemma":0.00074522,"threshold_uncertainty_score":0.016833305},"labels":[],"label_agreement":null},{"id":"W2098386377","doi":"10.1007/978-3-540-72522-0_11","title":"From Annotated Software Designs (UML SPT/MARTE) to Model Formalisms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Computer science; Rotation formalisms in three dimensions; Unified Modeling Language; Component (thermodynamics); Context (archaeology); Annotation; Software engineering; Software; Programming language; Artificial intelligence","score_opus":0.0361011823049563,"score_gpt":0.27257101893990543,"score_spread":0.23646983663494914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098386377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001633176,0.000889342,0.9843369,0.00082931726,0.00015369001,0.000056081106,0.0006442212,0.0026313004,0.008825924],"genre_scores_gemma":[0.03157254,0.0027140211,0.950519,0.00035835072,0.0001343108,0.00022665241,0.0031707948,0.0023163895,0.008987885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972754,0.0009474155,0.0003809833,0.00041238338,0.00089679344,0.00008697244],"domain_scores_gemma":[0.9934861,0.0030550843,0.00037465672,0.0020741855,0.0008665801,0.00014343012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035429278,0.0011715757,0.00074386835,0.0032285522,0.0008293711,0.0054434403,0.0019756847,0.0016457333,0.012544672],"category_scores_gemma":[0.015876906,0.002209259,0.0017283034,0.0035892532,0.0027489692,0.010389835,0.004800702,0.0038778437,0.0053106532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038095073,0.000036975052,0.00014800885,0.0005666989,0.000025544132,0.00015979401,0.0012268904,0.010536956,0.0027858939,0.7999992,0.011915433,0.17256048],"study_design_scores_gemma":[0.000021634492,0.000027456621,0.00009196119,0.0004375151,0.00002773342,0.00014623249,0.00015941942,0.025657536,0.0036120324,0.8128407,0.15694638,0.00003144527],"about_ca_topic_score_codex":0.0028405304,"about_ca_topic_score_gemma":0.003215812,"teacher_disagreement_score":0.012544672,"about_ca_system_score_codex":0.0019397517,"about_ca_system_score_gemma":0.001992922,"threshold_uncertainty_score":0.04196608},"labels":[],"label_agreement":null},{"id":"W2098411952","doi":"10.1007/978-3-642-04840-1_11","title":"Modeling Domain Variability in Requirements Engineering with Contexts","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Domain model; Domain (mathematical analysis); Notation; Requirements engineering; Domain analysis; Context (archaeology); Requirements elicitation; Software engineering; Goal modeling; Domain engineering; Requirements analysis; Systems engineering; Programming language; Domain knowledge; Software development; Engineering","score_opus":0.028367385846839364,"score_gpt":0.2683405315890225,"score_spread":0.23997314574218312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098411952","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.022772064,0.00039915345,0.9705057,0.00024109929,0.000020109945,0.000054138065,0.00004003828,0.0002686061,0.0056990758],"genre_scores_gemma":[0.5262643,0.0004917765,0.47061825,0.000096677635,0.000046247475,0.00017248596,0.00012344639,0.00018948718,0.0019972995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476165,0.0028446615,0.00031038438,0.0005897609,0.0012442123,0.00024936852],"domain_scores_gemma":[0.9894667,0.007796438,0.0007372243,0.0014297818,0.00043674506,0.00013306769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035610064,0.0010224058,0.0006504745,0.0011195851,0.0006157646,0.0023612552,0.0018165678,0.0011214168,0.0017257377],"category_scores_gemma":[0.012626269,0.0011723293,0.0013748208,0.0013688868,0.0018744647,0.0045798994,0.0029162436,0.0027791457,0.00036455688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009971631,0.00008802183,0.0025105784,0.000239786,0.00009837334,0.0005667102,0.0014224739,0.31688836,0.0033596132,0.5737887,0.00079075026,0.100146934],"study_design_scores_gemma":[0.000022812834,0.00006424094,0.0005546777,0.0001446552,0.00007183689,0.00024164801,0.00030745854,0.55978227,0.0024989971,0.42751747,0.0087574385,0.00003647682],"about_ca_topic_score_codex":0.0018663452,"about_ca_topic_score_gemma":0.0026171883,"teacher_disagreement_score":0.0035610064,"about_ca_system_score_codex":0.0008247768,"about_ca_system_score_gemma":0.00092287763,"threshold_uncertainty_score":0.018832624},"labels":[],"label_agreement":null},{"id":"W2098551021","doi":"10.1007/3-540-45820-4_11","title":"Merging Example-Based and Statistical Machine Translation: An Experiment","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Machine translation; Computer science; Translation (biology); Natural language processing; Task (project management); Artificial intelligence; Field (mathematics); Point (geometry); Example-based machine translation; Machine translation software usability; Computer-assisted translation","score_opus":0.0299062382411443,"score_gpt":0.2857405022603446,"score_spread":0.2558342640192003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098551021","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.9528243,0.0022649975,0.025014237,0.0006773228,0.00053466717,0.000671102,0.0036333583,0.0063206716,0.008059305],"genre_scores_gemma":[0.894458,0.0007820752,0.08611007,0.00055382197,0.00021913789,0.00041089652,0.012173405,0.0014175402,0.003875221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99174374,0.005182057,0.0008800538,0.0010108552,0.00091279956,0.00027045913],"domain_scores_gemma":[0.94883454,0.040231995,0.00080423494,0.0054871105,0.0040176846,0.0006245113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076264697,0.0013533372,0.0017530274,0.0012866877,0.0012676091,0.0018590525,0.0019553702,0.0031476049,0.010356485],"category_scores_gemma":[0.038007237,0.0010305543,0.0011948796,0.002397163,0.00084874773,0.004450623,0.0019672287,0.0015616042,0.005314922],"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.053194035,0.008181333,0.01860489,0.0070176427,0.0030618454,0.0032492003,0.0071152844,0.043656748,0.14750692,0.0038858843,0.02759749,0.67692876],"study_design_scores_gemma":[0.015739966,0.035479087,0.06561679,0.00056993833,0.007541659,0.00914232,0.008599535,0.43425608,0.33559972,0.018677475,0.067753315,0.0010241471],"about_ca_topic_score_codex":0.0026622266,"about_ca_topic_score_gemma":0.0023679312,"teacher_disagreement_score":0.010356485,"about_ca_system_score_codex":0.00040703377,"about_ca_system_score_gemma":0.0014683568,"threshold_uncertainty_score":0.04033315},"labels":[],"label_agreement":null},{"id":"W2098574494","doi":"10.1007/978-3-540-73580-9_31","title":"What’s Your Problem? The Problem of Problem Definition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abstraction; Process (computing); Computer science; Mathematical optimization; Mathematics; Calculus (dental); Programming language; Epistemology","score_opus":0.043297582746145445,"score_gpt":0.2620005646056397,"score_spread":0.21870298185949424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098574494","genre_codex":"commentary","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.0044213952,0.024793597,0.19111966,0.7251856,0.00606793,0.00022328275,0.00038592436,0.0002720391,0.04753058],"genre_scores_gemma":[0.28510025,0.033155724,0.5242203,0.106321394,0.018306702,0.0017153467,0.0018240277,0.00086572795,0.0284906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9593924,0.028307108,0.0022210367,0.0042787767,0.0044895066,0.0013110542],"domain_scores_gemma":[0.907421,0.07008669,0.0025181423,0.0068908557,0.0102827,0.0028006227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036006354,0.0012472116,0.002938047,0.0032869596,0.00638035,0.012699245,0.0071596494,0.011198515,0.009709893],"category_scores_gemma":[0.11004454,0.0012583662,0.0024170738,0.004461818,0.035965163,0.05362212,0.008354182,0.022271328,0.0029125037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028386887,0.000046843867,0.0003261805,0.00037407124,0.000037375547,0.00008353674,0.0012615151,0.00040199692,0.000055329583,0.91505474,0.045044955,0.037285097],"study_design_scores_gemma":[0.000014082444,0.0000049486334,0.000059313676,0.00022794922,0.000007838786,0.00012346574,0.0013431188,0.000774659,0.00004628054,0.9556668,0.04171522,0.000016284233],"about_ca_topic_score_codex":0.0052484,"about_ca_topic_score_gemma":0.0031383678,"teacher_disagreement_score":0.036006354,"about_ca_system_score_codex":0.005370316,"about_ca_system_score_gemma":0.008424502,"threshold_uncertainty_score":0.19042206},"labels":[],"label_agreement":null},{"id":"W2098583040","doi":"10.1007/978-3-642-23951-9_8","title":"Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":28,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Computer science; Edwards curve; Arithmetic; Elliptic curve point multiplication; Elliptic curve cryptography; Elliptic curve; Parallel computing; Binary number; Curve25519; Side channel attack; Multiplier (economics); Multiplication (music); Algorithm; Mathematics; Cryptography; Public-key cryptography; Encryption; Operating system; Pure mathematics","score_opus":0.019906092385966717,"score_gpt":0.2741551563047373,"score_spread":0.25424906391877056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098583040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37497866,0.00969769,0.5388125,0.0011376452,0.0007454217,0.00015260885,0.0001601806,0.006689466,0.06762576],"genre_scores_gemma":[0.85168314,0.0026168916,0.11873388,0.00024487416,0.00025270463,0.00004444553,0.00021367126,0.00054613466,0.02566422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994542,0.000113772054,0.000035095578,0.000058007034,0.000266394,0.00007249891],"domain_scores_gemma":[0.9988117,0.00045322828,0.000089242705,0.00027254436,0.0003175682,0.000055709523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970552,0.0005765197,0.00030787688,0.00069327635,0.00027837817,0.0014990931,0.0009840337,0.00046286336,0.0073848157],"category_scores_gemma":[0.002524375,0.0003183396,0.0002660141,0.00093360554,0.000347759,0.0016315317,0.0005081272,0.0007707088,0.0015747149],"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.001225961,0.00021370487,0.0014560259,0.0007191701,0.00007127202,0.00030169397,0.00029721524,0.028063366,0.1325937,0.09796532,0.0066565443,0.73043597],"study_design_scores_gemma":[0.00039319953,0.0021662575,0.0024139604,0.0006144587,0.00027120204,0.0017863234,0.00019265796,0.40365788,0.4044899,0.06621935,0.11766014,0.000134714],"about_ca_topic_score_codex":0.00052855595,"about_ca_topic_score_gemma":0.0006699698,"teacher_disagreement_score":0.0073848157,"about_ca_system_score_codex":0.0004454188,"about_ca_system_score_gemma":0.0007151193,"threshold_uncertainty_score":0.024704635},"labels":[],"label_agreement":null},{"id":"W2098900782","doi":"10.1007/3-540-45253-2_21","title":"I/O-Efficient Well-Separated Pair Decomposition and Its Applications","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Computer science; Decomposition; Algorithm; Chemistry; Organic chemistry","score_opus":0.011352390769116972,"score_gpt":0.2565343242452294,"score_spread":0.2451819334761124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098900782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026100665,0.001050337,0.9509411,0.0001456145,0.00017153966,0.000035448837,0.00011847512,0.0013987215,0.020038128],"genre_scores_gemma":[0.29338285,0.0009938843,0.67760396,0.00017081518,0.00018371745,0.00012786975,0.0005389009,0.0008086089,0.02618953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997944,0.000040816893,0.000009429779,0.00004030783,0.0000742935,0.000040781448],"domain_scores_gemma":[0.9997644,0.000059799844,0.00001964974,0.00007189942,0.00005053765,0.000033750104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025328554,0.0011006696,0.0008076444,0.00083198154,0.00042697336,0.00083567016,0.0009024496,0.0005628145,0.009404919],"category_scores_gemma":[0.0007754361,0.00037227073,0.00049921114,0.0013462001,0.00033734573,0.0015554307,0.001711582,0.0009996593,0.0028674353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012046298,0.00038508154,0.0005574092,0.00036521812,0.00006296844,0.0002836047,0.00028314526,0.06827708,0.09828844,0.15885393,0.027509598,0.6439289],"study_design_scores_gemma":[0.00011406396,0.00025228047,0.00049615756,0.000041460415,0.000056601395,0.00041801197,0.00014351237,0.7717748,0.04491201,0.15909967,0.022642735,0.000048664355],"about_ca_topic_score_codex":0.00026464654,"about_ca_topic_score_gemma":0.00049777207,"teacher_disagreement_score":0.009404919,"about_ca_system_score_codex":0.00021946174,"about_ca_system_score_gemma":0.00024186358,"threshold_uncertainty_score":0.03146261},"labels":[],"label_agreement":null},{"id":"W2099098003","doi":"10.1007/978-3-642-21590-2_1","title":"Subsumption of Vertical Viewpoint Patterns","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Computer science; Pattern matching; Representation (politics); Polyphony; Semantics (computer science); Matching (statistics); Artificial intelligence; Inference; Translation (biology); Relational database; Natural language processing; Relational calculus; Theoretical computer science; Programming language; Relational model; Data mining; Mathematics","score_opus":0.030069267441165063,"score_gpt":0.2556152944534851,"score_spread":0.22554602701232002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099098003","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.26639232,0.0025665406,0.65749174,0.00068367954,0.00017600271,0.00021300677,0.0034205173,0.0016822115,0.06737398],"genre_scores_gemma":[0.72886664,0.0013718656,0.23746946,0.00021233417,0.00013495893,0.0001403332,0.009078377,0.00046832775,0.022257643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982222,0.0002235166,0.00014388139,0.00035736282,0.00082509086,0.0002279692],"domain_scores_gemma":[0.99739635,0.00093031715,0.00025340656,0.0007109464,0.00058289454,0.00012616377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069300155,0.00053592125,0.00057780003,0.0029920791,0.000845481,0.0022360554,0.0009816716,0.0005592795,0.0054517793],"category_scores_gemma":[0.004588958,0.00059134525,0.000994351,0.0045841467,0.00076147163,0.0042223693,0.0016025191,0.0009824815,0.0010503363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032336934,0.0001061754,0.0153897805,0.0003750966,0.00020910558,0.0015777879,0.0017387773,0.0053486554,0.01769348,0.4917606,0.00951661,0.4559606],"study_design_scores_gemma":[0.000046574307,0.00013572801,0.012701588,0.00026486613,0.0002798515,0.002883783,0.0016422253,0.06902544,0.02146764,0.8182986,0.07319201,0.00006184155],"about_ca_topic_score_codex":0.005810603,"about_ca_topic_score_gemma":0.0082901865,"teacher_disagreement_score":0.005810603,"about_ca_system_score_codex":0.0008761287,"about_ca_system_score_gemma":0.00067265664,"threshold_uncertainty_score":0.018238008},"labels":[],"label_agreement":null},{"id":"W2099119688","doi":"10.1007/978-3-319-09698-8_4","title":"State Complexity of Deletion","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Regular language; Upper and lower bounds; State (computer science); Finite-state machine; Computer science; Deterministic finite automaton; Automaton; Matching (statistics); Time complexity; Computational complexity theory; Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","score_opus":0.022515380925277356,"score_gpt":0.23972131822434914,"score_spread":0.21720593729907178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099119688","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.48200706,0.001887372,0.19915922,0.00622883,0.00032574357,0.00011388411,0.0022611583,0.00074768165,0.30726913],"genre_scores_gemma":[0.9664883,0.00065973884,0.00832323,0.00016969514,0.00019632635,0.00010039329,0.00094222947,0.000197546,0.022922581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813724,0.0003346561,0.00010195848,0.00035616226,0.00075006206,0.000319905],"domain_scores_gemma":[0.9920765,0.005502922,0.0003848187,0.0010281464,0.00066692696,0.00034065844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096275134,0.00049875764,0.000968535,0.0013118228,0.0015648477,0.004922195,0.0016451621,0.0013888592,0.01600962],"category_scores_gemma":[0.007867627,0.00058885536,0.001191065,0.0020246587,0.002565097,0.008822193,0.0026445414,0.003910789,0.00141046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000799939,0.000025708738,0.00038522657,0.00005888286,0.000008982979,0.00004410488,0.000260586,0.0066341786,0.0007934475,0.9787385,0.0023242517,0.010646204],"study_design_scores_gemma":[0.00001090897,0.000009119176,0.00029180906,0.000011371197,0.000011814592,0.00005714556,0.00005929416,0.01629067,0.00081238116,0.9801152,0.0023186149,0.0000117203035],"about_ca_topic_score_codex":0.0015399277,"about_ca_topic_score_gemma":0.001158548,"teacher_disagreement_score":0.01600962,"about_ca_system_score_codex":0.002522138,"about_ca_system_score_gemma":0.001424766,"threshold_uncertainty_score":0.053557515},"labels":[],"label_agreement":null},{"id":"W2099127348","doi":"10.1007/978-3-642-12659-8_19","title":"Domain Decomposition of Stochastic PDEs: A Novel Preconditioner and Its Parallel Performance","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Preconditioner; Computer science; Domain decomposition methods; Domain (mathematical analysis); Decomposition; Parallel computing; Computational science; Algorithm; Mathematics; Iterative method; Finite element method","score_opus":0.03650840049300456,"score_gpt":0.2893831063925972,"score_spread":0.2528747058995926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099127348","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.0043641212,0.00016571542,0.99335206,0.00011359851,0.00007936582,0.000014989134,0.000042580836,0.00034133415,0.0015261341],"genre_scores_gemma":[0.08495956,0.00049301365,0.9066938,0.00012574923,0.00018690286,0.00011275895,0.00019684255,0.00032430072,0.0069070826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996836,0.00009191107,0.000017336113,0.000048810994,0.00012988377,0.00002849369],"domain_scores_gemma":[0.99957496,0.00017638622,0.00003556773,0.000090701506,0.000082371895,0.000040095158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678967,0.0006206695,0.0006941391,0.0003137247,0.00027262702,0.0005409946,0.0005110221,0.0008455652,0.0029191375],"category_scores_gemma":[0.0010597657,0.00027335915,0.0005767544,0.0004991776,0.00048976863,0.000745631,0.0010909464,0.0015242172,0.0011298949],"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.0004503303,0.00025862647,0.00054492225,0.00043982835,0.000087369925,0.00025897374,0.000189781,0.26054162,0.1475146,0.13109793,0.017909572,0.44070637],"study_design_scores_gemma":[0.000035345,0.00004639694,0.0001373688,0.000010413851,0.0000121961875,0.00009316147,0.000008610109,0.9657467,0.014967029,0.01208619,0.0068449043,0.000011707613],"about_ca_topic_score_codex":0.00056317943,"about_ca_topic_score_gemma":0.0009134132,"teacher_disagreement_score":0.0029191375,"about_ca_system_score_codex":0.00016574157,"about_ca_system_score_gemma":0.0005577543,"threshold_uncertainty_score":0.009765506},"labels":[],"label_agreement":null},{"id":"W2099188592","doi":"10.1007/978-3-540-30551-4_62","title":"Boundary-Optimal Triangulation Flooding","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"","keywords":"Triangulation; Combinatorics; Boundary (topology); Planar; Mathematics; Flooding (psychology); Point set triangulation; Sequence (biology); Physics; Geometry; Discrete mathematics; Computer science; Mathematical analysis; Delaunay triangulation; Computer graphics (images)","score_opus":0.017610401689547018,"score_gpt":0.25038856005308996,"score_spread":0.23277815836354293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099188592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013514719,0.000798613,0.9479521,0.0003352126,0.00015061854,0.00007381488,0.00022903134,0.001378567,0.035567306],"genre_scores_gemma":[0.36232886,0.001397206,0.59602845,0.000267,0.00017209783,0.00022950237,0.0010617357,0.0012600033,0.037255168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955696,0.000079136094,0.000018065135,0.00008687348,0.00020365478,0.000055270455],"domain_scores_gemma":[0.9996008,0.00014954295,0.00003188919,0.00011453113,0.00007536421,0.000027898135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034698803,0.00065915333,0.0010654138,0.0009807718,0.00055796094,0.0009769431,0.0014541397,0.0012350202,0.0074622296],"category_scores_gemma":[0.0027436295,0.0006199861,0.00046904155,0.001075741,0.0008774754,0.0017698364,0.003492676,0.0012854682,0.001841411],"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.00035986624,0.00008205685,0.00033299363,0.00046352373,0.000048020298,0.00016607982,0.00031729203,0.2376583,0.020469794,0.3417793,0.028054463,0.37026832],"study_design_scores_gemma":[0.000046948484,0.0000385414,0.00014728721,0.00004044909,0.000017406446,0.00020337343,0.00005177565,0.73090905,0.004939412,0.25027487,0.013310981,0.000019925761],"about_ca_topic_score_codex":0.0016585452,"about_ca_topic_score_gemma":0.001576029,"teacher_disagreement_score":0.0074622296,"about_ca_system_score_codex":0.0006763242,"about_ca_system_score_gemma":0.00060848496,"threshold_uncertainty_score":0.024963677},"labels":[],"label_agreement":null},{"id":"W2099605862","doi":"10.1007/978-3-540-27773-6_6","title":"Hyphenation Patterns for Ancient and Modern Greek","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Historical and Literary Studies","field":"Social Sciences","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":"McGill University","keywords":"Modern Greek; Computer science; Stress (linguistics); Linguistics; Ancient Greek; Consonant; Grammar; Greek language; Natural language processing; Word (group theory); Vowel; Artificial intelligence; Speech recognition; Philosophy","score_opus":0.024244942603819358,"score_gpt":0.26105882964482824,"score_spread":0.2368138870410089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099605862","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7619413,0.002599078,0.01830511,0.0013079222,0.0001487335,0.00008078938,0.001671507,0.0003540648,0.21359149],"genre_scores_gemma":[0.9779415,0.0003711903,0.005681991,0.00004814227,0.000040582097,0.00003536377,0.00080959254,0.00014463735,0.014927013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999343,0.00024983223,0.0000814846,0.00010648413,0.00014395395,0.000075246244],"domain_scores_gemma":[0.99617165,0.0023914662,0.00038976702,0.00045837174,0.00047077422,0.00011807647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059207703,0.00021876248,0.00019731873,0.0022561057,0.0011172588,0.002205387,0.00044218497,0.00049144565,0.019653047],"category_scores_gemma":[0.0055782907,0.00016271515,0.00016899564,0.004035189,0.0016532518,0.002586857,0.0008942433,0.000862524,0.0018029673],"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.0008102191,0.00015194072,0.0326568,0.0004030517,0.0000415201,0.0011258796,0.09834078,0.00079301995,0.007965969,0.6016148,0.013868852,0.24222708],"study_design_scores_gemma":[0.00020214292,0.00038522284,0.21445169,0.00063875987,0.000111302405,0.008426028,0.074255876,0.013859104,0.0073777223,0.38211936,0.29804212,0.00013078103],"about_ca_topic_score_codex":0.0014787018,"about_ca_topic_score_gemma":0.002117869,"teacher_disagreement_score":0.019653047,"about_ca_system_score_codex":0.00065794424,"about_ca_system_score_gemma":0.00041529775,"threshold_uncertainty_score":0.06574601},"labels":[],"label_agreement":null},{"id":"W2099682955","doi":"10.1007/11889205_64","title":"Global Grammar Constraints","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constraint (computer-aided design); Theoretical computer science; Automaton; String (physics); Range (aeronautics); Constraint programming; Grammar; Algorithm; Programming language; Mathematical optimization; Mathematics","score_opus":0.01069113556998131,"score_gpt":0.2301512477673699,"score_spread":0.2194601121973886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099682955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073209065,0.00068502425,0.4962508,0.0018423827,0.0008070003,0.00022994165,0.0038689885,0.0047483197,0.48424655],"genre_scores_gemma":[0.28873986,0.0020233495,0.34392372,0.0022213026,0.00075224217,0.0007371853,0.016870255,0.010171582,0.33456048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979734,0.00044505417,0.0001293692,0.00069400057,0.00057752396,0.00018082373],"domain_scores_gemma":[0.9978624,0.0008078546,0.00006253627,0.0007763451,0.00040102517,0.0000898713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011021417,0.0015012188,0.0012381603,0.0018088415,0.0016539035,0.0036410552,0.0020536399,0.0016892145,0.105993755],"category_scores_gemma":[0.00441014,0.0012217078,0.0014170179,0.0018914946,0.0024826212,0.006612855,0.0042589465,0.004443561,0.03597006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043057265,0.00003836344,0.00019496336,0.00021065334,0.000020377216,0.00018536342,0.0004405172,0.0013245192,0.0029541831,0.8352182,0.045471862,0.113897964],"study_design_scores_gemma":[0.000018815375,0.000020783962,0.00018480324,0.00011211654,0.00003744708,0.00028695495,0.00017390255,0.0038285882,0.0042063594,0.72965306,0.26145023,0.000026914458],"about_ca_topic_score_codex":0.0014170477,"about_ca_topic_score_gemma":0.002243139,"teacher_disagreement_score":0.105993755,"about_ca_system_score_codex":0.0010021405,"about_ca_system_score_gemma":0.0017928,"threshold_uncertainty_score":0.3545844},"labels":[],"label_agreement":null},{"id":"W2099970613","doi":"10.1007/978-3-319-10470-6_93","title":"Maximum Entropy Estimation of Glutamate and Glutamine in MR Spectroscopic Imaging","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health; National Institutes of Health","keywords":"Glutamine; Nuclear magnetic resonance; Metabolite; Magnetic resonance spectroscopic imaging; Spectral density; Glutamate receptor; Imaging phantom; Magnetic resonance imaging; Physics; Computer science; Chemistry; Mathematics; Optics; Amino acid; Biochemistry; Statistics","score_opus":0.006472457406113143,"score_gpt":0.28424780549393736,"score_spread":0.2777753480878242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099970613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20860432,0.0012977399,0.788166,0.00030070674,0.00005020323,0.000020504884,0.00016770947,0.00019780257,0.0011950873],"genre_scores_gemma":[0.90199834,0.0008043858,0.09516829,0.00005361161,0.000094846,0.000026929292,0.00029672592,0.000057178815,0.0014996545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998447,0.00006474409,0.0000102181275,0.000030704014,0.000030071149,0.000019570993],"domain_scores_gemma":[0.9992632,0.00056349783,0.000056429828,0.000032074375,0.00005692565,0.000027775008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009385702,0.0004216858,0.0005298324,0.00054305204,0.00022388271,0.0006277182,0.00043284887,0.00063249515,0.0004562946],"category_scores_gemma":[0.0027236922,0.00027901906,0.00043986202,0.00041753164,0.0003455377,0.0011465619,0.00069687323,0.00037808547,0.00013648902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001299798,0.00018872258,0.008857857,0.0004139003,0.00026278562,0.00054988224,0.00017174926,0.54142255,0.1304517,0.019754201,0.0013321354,0.29529467],"study_design_scores_gemma":[0.0000062856784,0.00003409217,0.002200493,0.000009082367,0.00002139689,0.00009347185,0.0000117198315,0.97910607,0.011477822,0.0067960992,0.00022759399,0.000015849071],"about_ca_topic_score_codex":0.0009622378,"about_ca_topic_score_gemma":0.0013198917,"teacher_disagreement_score":0.0009622378,"about_ca_system_score_codex":0.00025308205,"about_ca_system_score_gemma":0.00033443765,"threshold_uncertainty_score":0.0049636364},"labels":[],"label_agreement":null},{"id":"W2100122922","doi":"10.1007/bfb0022469","title":"On the absence of livelocks in parallel programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Extension (predicate logic); Computer science; Reduction (mathematics); Set (abstract data type); Programming language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.023720028309824087,"score_gpt":0.24529131590823458,"score_spread":0.2215712875984105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100122922","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2975664,0.0038148318,0.60894144,0.007266157,0.00092819624,0.00019024817,0.00039196463,0.0021685055,0.07873224],"genre_scores_gemma":[0.959135,0.0010239352,0.029432043,0.0007873787,0.00065079937,0.00021120504,0.00025353744,0.0005574567,0.007948595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947802,0.0014181313,0.00039756644,0.00094076694,0.0014887211,0.0009746098],"domain_scores_gemma":[0.91644,0.059070263,0.004635046,0.01309857,0.004464406,0.0022916524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007430725,0.00076658017,0.0021428363,0.0017964143,0.0028127735,0.004129442,0.0027985706,0.0026916745,0.005204658],"category_scores_gemma":[0.06791892,0.0015560478,0.0010909801,0.001938444,0.009756257,0.017653847,0.007566406,0.008637136,0.0005950712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007021978,0.00010262414,0.0015241881,0.00020750306,0.00003165056,0.00025029265,0.0005788311,0.011076671,0.0017565915,0.9535203,0.0028842266,0.027364925],"study_design_scores_gemma":[0.00006690752,0.00005207783,0.00017122332,0.000032706823,0.000024290815,0.00011025213,0.00007634779,0.021680936,0.0009367633,0.9751883,0.0016458969,0.000014325379],"about_ca_topic_score_codex":0.0009911645,"about_ca_topic_score_gemma":0.0008402426,"teacher_disagreement_score":0.007430725,"about_ca_system_score_codex":0.0012823793,"about_ca_system_score_gemma":0.0018255278,"threshold_uncertainty_score":0.03929788},"labels":[],"label_agreement":null},{"id":"W2100383275","doi":"10.1007/978-3-642-23638-9_9","title":"Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia","funders":"","keywords":"Realization (probability); Binary number; Molecule; Chemistry; Computer science; Physics; Materials science; Arithmetic; Mathematics; Organic chemistry","score_opus":0.029249507770418612,"score_gpt":0.2698135721318919,"score_spread":0.24056406436147326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100383275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1956989,0.12786485,0.47467718,0.016628113,0.0017980303,0.00021300773,0.00030209078,0.0013115826,0.18150625],"genre_scores_gemma":[0.79436284,0.032458138,0.0708244,0.0032659613,0.0005980217,0.00038657052,0.00021432826,0.00066563964,0.097224176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984987,0.00036520354,0.0000762435,0.00034221215,0.00054772047,0.00016981467],"domain_scores_gemma":[0.9955966,0.003355642,0.00016020777,0.000572753,0.0002185491,0.000096342395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029933783,0.00074846647,0.0015016255,0.00065015256,0.0012232758,0.0037045185,0.0020937806,0.002956088,0.009958903],"category_scores_gemma":[0.0056581213,0.00094297534,0.00064239034,0.0007990421,0.005121763,0.012874142,0.0036799368,0.0029770643,0.0024119825],"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.00042626692,0.000116513445,0.00025949697,0.0009042037,0.000027459031,0.00011517381,0.00068788417,0.010394664,0.036623377,0.8245182,0.0027082027,0.123218596],"study_design_scores_gemma":[0.00003118986,0.00039281097,0.00016617887,0.0001990413,0.000033049007,0.0003013605,0.0002448754,0.01773495,0.085596256,0.849862,0.045364853,0.00007337314],"about_ca_topic_score_codex":0.00051846134,"about_ca_topic_score_gemma":0.000491507,"teacher_disagreement_score":0.009958903,"about_ca_system_score_codex":0.0016943348,"about_ca_system_score_gemma":0.00073781837,"threshold_uncertainty_score":0.033315837},"labels":[],"label_agreement":null},{"id":"W2100477061","doi":"10.1007/11768012_24","title":"Visualizing Personal Relations in Online Communities","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Knowledge Management and Sharing","field":"Social Sciences","cited_by":33,"is_retracted":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":"World Wide Web; Computer science; Sociology","score_opus":0.046873604462598105,"score_gpt":0.31571672214596486,"score_spread":0.2688431176833668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100477061","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.76607364,0.0026865692,0.20505345,0.00095962925,0.00016835393,0.00014882893,0.004198249,0.0072744815,0.013436812],"genre_scores_gemma":[0.89241344,0.00080375967,0.09788837,0.000060042603,0.00008574409,0.00009506042,0.0022185787,0.00041993297,0.0060149725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976736,0.00007179549,0.000010294742,0.00005303994,0.00005972251,0.000037841466],"domain_scores_gemma":[0.99897087,0.0006043076,0.00007921205,0.00008717483,0.000106298095,0.0001521634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039780312,0.00042241145,0.0003849113,0.0031026055,0.0009232418,0.0021344055,0.00053077,0.00078404596,0.0066823415],"category_scores_gemma":[0.0016905005,0.0003232275,0.00044992578,0.0032654484,0.00030184063,0.002499639,0.0015286832,0.0006097807,0.0008879919],"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.002185524,0.0008980241,0.06599574,0.0012940621,0.0003228832,0.0020202557,0.028794399,0.045836862,0.07749419,0.050339453,0.05185127,0.6729674],"study_design_scores_gemma":[0.00015388257,0.00028426337,0.07272598,0.00030294736,0.00020684763,0.001767694,0.017116599,0.70130825,0.022966057,0.12727165,0.055754516,0.00014135004],"about_ca_topic_score_codex":0.0061355936,"about_ca_topic_score_gemma":0.010596598,"teacher_disagreement_score":0.0066823415,"about_ca_system_score_codex":0.00032187754,"about_ca_system_score_gemma":0.00025705915,"threshold_uncertainty_score":0.022354662},"labels":[],"label_agreement":null},{"id":"W2100499323","doi":"10.1007/978-3-642-03730-6_11","title":"TidFP: Mining Frequent Patterns in Different Databases with Transaction ID","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; Database transaction; Identifier; Database; Data mining; Bitmap; Online analytical processing; Online transaction processing; Apriori algorithm; Transaction processing; Association rule learning; Set (abstract data type); Transaction data; Information retrieval; Data warehouse; Artificial intelligence","score_opus":0.023951022885895765,"score_gpt":0.2522751124825563,"score_spread":0.22832408959666053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100499323","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.04594909,0.002207649,0.8985549,0.00049690844,0.00035878492,0.0005166995,0.015407575,0.03353709,0.0029711667],"genre_scores_gemma":[0.088388175,0.0007574588,0.8859338,0.00015649467,0.000105667146,0.000402253,0.02050093,0.0007618915,0.0029932873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989274,0.00009301511,0.00016136748,0.00030179063,0.00044483118,0.000071512906],"domain_scores_gemma":[0.9986014,0.0006404431,0.00010049927,0.00031949813,0.00026200817,0.00007622619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011375254,0.0012152421,0.0015192522,0.004479315,0.0007705729,0.0023053368,0.0024841619,0.0010148701,0.0050889235],"category_scores_gemma":[0.0049880366,0.00089639897,0.001335273,0.0062351017,0.00042147667,0.0036591091,0.0016684644,0.0009562447,0.0034214014],"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.0006988779,0.0002006417,0.007982616,0.0011350294,0.00027188432,0.0007220081,0.00025858558,0.0072893403,0.011342741,0.0063735326,0.04330806,0.9204166],"study_design_scores_gemma":[0.000514028,0.00090129935,0.012930934,0.00041762847,0.0007050994,0.007204947,0.00081208814,0.7263708,0.0514005,0.090090044,0.1084499,0.00020276828],"about_ca_topic_score_codex":0.0015344329,"about_ca_topic_score_gemma":0.0015802362,"teacher_disagreement_score":0.0050889235,"about_ca_system_score_codex":0.00040646904,"about_ca_system_score_gemma":0.00083813514,"threshold_uncertainty_score":0.01702416},"labels":[],"label_agreement":null},{"id":"W2100527225","doi":"10.1007/978-3-540-74958-5_73","title":"Roulette Sampling for Cost-Sensitive Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Western University","funders":"","keywords":"Activity-based costing; Roulette; Computer science; Sampling (signal processing); Preprocessor; Sample (material); Artificial intelligence; Machine learning; Rejection sampling; Data mining; Mathematics","score_opus":0.04985687444367841,"score_gpt":0.3132162319413482,"score_spread":0.26335935749766975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100527225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031787255,0.0005723084,0.9939494,0.00016271495,0.00009680507,0.00011024239,0.000078594865,0.000898228,0.0009529699],"genre_scores_gemma":[0.14780058,0.0005974165,0.8380542,0.00057316385,0.00046725877,0.0010614236,0.0009318685,0.0009822346,0.009531843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936266,0.0037040617,0.0002479374,0.0008394288,0.0012038719,0.00037805687],"domain_scores_gemma":[0.98744893,0.008801391,0.00025774483,0.0023747184,0.00086680247,0.00025031858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010543682,0.0017890153,0.0052489103,0.0023892815,0.0013492408,0.0020332006,0.0074447845,0.0036925513,0.009472747],"category_scores_gemma":[0.030169338,0.0015438322,0.0017193248,0.0028693585,0.0026112287,0.0036034903,0.0035616409,0.004738566,0.0028503432],"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.00068718044,0.00044582973,0.001015171,0.00036185503,0.00024140217,0.00015331905,0.00016082278,0.39496213,0.0027141434,0.12880018,0.021925336,0.44853258],"study_design_scores_gemma":[0.000043947435,0.000051159826,0.00010437938,0.000020536474,0.000019848732,0.000041378607,0.0000063883986,0.94649774,0.0007148011,0.050935987,0.0015474684,0.000016309272],"about_ca_topic_score_codex":0.0044865566,"about_ca_topic_score_gemma":0.004842254,"teacher_disagreement_score":0.010543682,"about_ca_system_score_codex":0.0018692235,"about_ca_system_score_gemma":0.0021812164,"threshold_uncertainty_score":0.05576104},"labels":[],"label_agreement":null},{"id":"W2100570185","doi":"10.1007/978-3-540-24654-1_24","title":"More Generalized Mersenne Numbers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"University of Waterloo","funders":"","keywords":"Mersenne prime; Mathematics; Modular arithmetic; Integer (computer science); Arithmetic; Moduli; Modular design; Discrete mathematics; Algorithm; Computer science; Cryptography; Physics","score_opus":0.011402160427876925,"score_gpt":0.23700942566528713,"score_spread":0.2256072652374102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100570185","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0503291,0.008798254,0.06948961,0.0059542605,0.005136836,0.000059320704,0.00025275542,0.00039917146,0.8595808],"genre_scores_gemma":[0.36145025,0.007368514,0.049475,0.0030507206,0.0032151153,0.00008402452,0.00033978422,0.00043647992,0.57458013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964726,0.000078500394,0.000018205585,0.00007252439,0.00013657693,0.000046906833],"domain_scores_gemma":[0.99969995,0.00007435531,0.000023012024,0.00010596035,0.00006611722,0.000030621708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627123,0.001011049,0.00091655605,0.0017052005,0.0010031894,0.0022129463,0.0005818709,0.0009331146,0.023597024],"category_scores_gemma":[0.0012007533,0.00033188338,0.0006456139,0.0015514762,0.0019063387,0.005708056,0.0012268634,0.0032774361,0.0043779053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022131453,0.000015563524,0.000035361038,0.00006328929,0.0000046522377,0.00004475898,0.00017802321,0.0004198228,0.0011316476,0.9732503,0.0053588906,0.019475495],"study_design_scores_gemma":[0.000013743315,0.00003127324,0.00013434835,0.00004449145,0.000008350557,0.00024835867,0.00007809901,0.00076387264,0.00063634594,0.8654508,0.13257347,0.000016879823],"about_ca_topic_score_codex":0.00033894423,"about_ca_topic_score_gemma":0.0007364706,"teacher_disagreement_score":0.023597024,"about_ca_system_score_codex":0.0011346482,"about_ca_system_score_gemma":0.00035011183,"threshold_uncertainty_score":0.078939915},"labels":[],"label_agreement":null},{"id":"W2100655974","doi":"10.1007/978-3-540-85097-7_29","title":"The Robot Cleans Up","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Dalhousie University","funders":"","keywords":"Computer science; Eulerian path; Enhanced Data Rates for GSM Evolution; Robot; Weighting; Property (philosophy); Graph; Artificial intelligence; Theoretical computer science; Mathematics; Lagrangian; Physics","score_opus":0.020224242576590497,"score_gpt":0.23309797980103883,"score_spread":0.21287373722444833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100655974","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.02058106,0.003995913,0.29039922,0.019511128,0.006917065,0.0001526315,0.00037571794,0.007170333,0.6508969],"genre_scores_gemma":[0.20568064,0.0032413804,0.08206431,0.0060747424,0.0010999949,0.0002011149,0.00045260412,0.0019627227,0.6992224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960834,0.000059770842,0.000008942992,0.00010605841,0.0001474358,0.00006949168],"domain_scores_gemma":[0.9996636,0.000061027367,0.000018265917,0.00012482857,0.000066703615,0.00006562809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042406967,0.0008852856,0.00070020615,0.00063540286,0.0018753409,0.0024534445,0.0010026103,0.0018969805,0.04036276],"category_scores_gemma":[0.0011891904,0.0005344689,0.00081200636,0.00030741552,0.0038524366,0.0041618804,0.0031423953,0.0032771106,0.023795325],"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.00022561359,0.000100905054,0.0005130981,0.00034620916,0.00006054364,0.0005488866,0.0014900896,0.00414636,0.02675641,0.5783152,0.14726594,0.24023068],"study_design_scores_gemma":[0.000026716565,0.00022500982,0.00050939486,0.00013931593,0.000030172718,0.00052519207,0.00077799143,0.004728956,0.008585434,0.11849987,0.865881,0.00007094963],"about_ca_topic_score_codex":0.0015506446,"about_ca_topic_score_gemma":0.0012391219,"teacher_disagreement_score":0.04036276,"about_ca_system_score_codex":0.00050913513,"about_ca_system_score_gemma":0.0011359141,"threshold_uncertainty_score":0.13502681},"labels":[],"label_agreement":null},{"id":"W2100695230","doi":"10.1007/978-3-642-25286-0_9","title":"BUPLE: Securing Passive RFID Communication through Physical Layer Enhancements","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RFID technology advancements","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eavesdropping; Computer science; Physical layer; Computer network; Relay; Exploit; Channel (broadcasting); Transmission (telecommunications); Computer security; Telecommunications; Wireless","score_opus":0.014568243598575531,"score_gpt":0.25651642247384693,"score_spread":0.2419481788752714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100695230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04174397,0.0072986367,0.89770675,0.00081259623,0.00091160653,0.00015547618,0.00028079227,0.011011846,0.040078368],"genre_scores_gemma":[0.5330563,0.006812343,0.23492339,0.0012903375,0.00066759466,0.00023787911,0.0009945272,0.0013401895,0.22067738],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994816,0.000052557578,0.000026160853,0.00006985574,0.0003158246,0.000053954293],"domain_scores_gemma":[0.9995665,0.000104191124,0.00006137997,0.00013819888,0.000109543995,0.000020226129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039740666,0.00078501075,0.00042834255,0.0004128906,0.00027606287,0.0012939612,0.001166953,0.0007705483,0.006434169],"category_scores_gemma":[0.0007410213,0.0004670771,0.00023171162,0.00031128552,0.00049107894,0.0023914466,0.0015139219,0.0013093487,0.004249915],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061254494,0.00010763178,0.0007583303,0.00074575655,0.00006998846,0.00058181916,0.00030664745,0.004371212,0.5049939,0.018439256,0.017753338,0.4512596],"study_design_scores_gemma":[0.00006335793,0.00085454853,0.0015197205,0.00018143067,0.00011948638,0.0032764538,0.000117051655,0.053664755,0.7108053,0.008439426,0.22086605,0.00009232619],"about_ca_topic_score_codex":0.000109806184,"about_ca_topic_score_gemma":0.00018287332,"teacher_disagreement_score":0.006434169,"about_ca_system_score_codex":0.00025677303,"about_ca_system_score_gemma":0.00016817261,"threshold_uncertainty_score":0.02152443},"labels":[],"label_agreement":null},{"id":"W2100908575","doi":"10.1007/11896548_27","title":"Semantically Correct Query Answers in the Presence of Null Values","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":48,"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":"Null (SQL); Computer science; Information retrieval; Natural language processing; Data mining","score_opus":0.013479258034750025,"score_gpt":0.2379310757544465,"score_spread":0.22445181771969647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100908575","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.031842865,0.00066185626,0.9406935,0.0046519316,0.0005061581,0.00019770113,0.0010937202,0.007918898,0.012433375],"genre_scores_gemma":[0.5843519,0.0010692264,0.39435336,0.0022763484,0.00061990344,0.00031331103,0.004082469,0.0031918404,0.009741635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96190035,0.011900235,0.003902164,0.0038505355,0.015434969,0.0030118406],"domain_scores_gemma":[0.86772346,0.08720804,0.0035232091,0.027013846,0.013708894,0.0008226145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019428775,0.0017149942,0.002976525,0.0023573157,0.0023159105,0.010346148,0.0040895357,0.006519419,0.0068557085],"category_scores_gemma":[0.12975541,0.0018671608,0.0020225921,0.0026666601,0.0065483134,0.024855189,0.009528573,0.0055449926,0.0034572738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026851979,0.000318031,0.00539616,0.0015323175,0.00028931588,0.0029785766,0.004302633,0.023581289,0.018168068,0.7476382,0.03543054,0.1576797],"study_design_scores_gemma":[0.00021286136,0.00006524944,0.00028572988,0.00018774024,0.00019277004,0.0012907549,0.00074428174,0.06531987,0.026131954,0.8869077,0.018564641,0.000096491385],"about_ca_topic_score_codex":0.0016755419,"about_ca_topic_score_gemma":0.001725079,"teacher_disagreement_score":0.019428775,"about_ca_system_score_codex":0.0017744057,"about_ca_system_score_gemma":0.0040579727,"threshold_uncertainty_score":0.10275042},"labels":[],"label_agreement":null},{"id":"W2100934002","doi":"10.1007/978-3-642-03761-0_20","title":"Exploiting User Navigation to Improve Focused Retrieval","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information retrieval; Boosting (machine learning); Ranking (information retrieval); XML; Key (lock); Process (computing); Data mining; Machine learning; World Wide Web","score_opus":0.017349114839110186,"score_gpt":0.24645950088438867,"score_spread":0.22911038604527847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100934002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12775128,0.007251634,0.8304285,0.00034415175,0.00044208512,0.00020768798,0.00093252637,0.021113588,0.011528559],"genre_scores_gemma":[0.4436168,0.0033995893,0.5238686,0.000575512,0.00040388393,0.00017804677,0.0033546358,0.0014732855,0.023129726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957234,0.00010614009,0.000023185436,0.0000844689,0.00015883797,0.00005493195],"domain_scores_gemma":[0.9988569,0.00046898387,0.000044893804,0.00021361599,0.00037133342,0.000044209763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797363,0.0011654089,0.001158892,0.001615282,0.0005550124,0.0011967038,0.0010984506,0.0012309074,0.008388855],"category_scores_gemma":[0.0032348684,0.00042536325,0.0006462328,0.001904807,0.00030022225,0.0027137024,0.0012008391,0.00076830573,0.005193929],"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.0011078101,0.00041824524,0.0022281716,0.00045092346,0.00013043903,0.00015583677,0.0003604286,0.008718247,0.10612942,0.0030201161,0.025410848,0.8518695],"study_design_scores_gemma":[0.0003386334,0.002068443,0.0063624876,0.00013774326,0.0007717804,0.002199745,0.00040285836,0.7364069,0.18589228,0.01912093,0.0460893,0.00020884955],"about_ca_topic_score_codex":0.003910516,"about_ca_topic_score_gemma":0.006798018,"teacher_disagreement_score":0.008388855,"about_ca_system_score_codex":0.00027716736,"about_ca_system_score_gemma":0.0005707771,"threshold_uncertainty_score":0.028063476},"labels":[],"label_agreement":null},{"id":"W2100976923","doi":"10.1007/978-3-540-87353-2_9","title":"Trust Management for Host-Based Collaborative Intrusion Detection","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":94,"is_retracted":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":"Correctness; Intrusion detection system; Trustworthiness; Computer science; Collaborative network; Host (biology); Intrusion; Computer security; Robustness (evolution); Network security; Intrusion prevention system; Knowledge management","score_opus":0.011364506853528576,"score_gpt":0.2283058256537196,"score_spread":0.21694131880019102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100976923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020916473,0.00051270204,0.9743998,0.00026024808,0.00009020511,0.000117825584,0.000045131277,0.00095377496,0.0027037582],"genre_scores_gemma":[0.81096953,0.00029341198,0.18405664,0.000074902404,0.000097962635,0.00014105652,0.0001322186,0.00009085233,0.004143443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752694,0.0008337434,0.00020653018,0.00036850758,0.00077106827,0.00029317767],"domain_scores_gemma":[0.99534863,0.0021737122,0.00044705864,0.0011555293,0.0006441144,0.00023093731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002653202,0.00059702457,0.0011803478,0.00053618825,0.0010609911,0.0021645578,0.0021939073,0.0011650088,0.0022777815],"category_scores_gemma":[0.008672665,0.0004560552,0.0006292927,0.00068443356,0.00089478696,0.0035468524,0.0024114042,0.0019410535,0.0006265547],"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.000797788,0.0004914314,0.0037263911,0.00027557064,0.00028471867,0.00062049,0.0009895711,0.2972371,0.017235683,0.10291826,0.011066317,0.5643566],"study_design_scores_gemma":[0.000018994819,0.00006830909,0.00029986745,0.0000114384475,0.000029754281,0.0001003667,0.00006386568,0.96555704,0.0032680116,0.028555475,0.002009874,0.000016981827],"about_ca_topic_score_codex":0.0019753021,"about_ca_topic_score_gemma":0.0025140177,"teacher_disagreement_score":0.002653202,"about_ca_system_score_codex":0.0010662855,"about_ca_system_score_gemma":0.00089359295,"threshold_uncertainty_score":0.014031589},"labels":[],"label_agreement":null},{"id":"W2101039650","doi":"10.1007/3-540-44963-9_56","title":"Purpose-Based User Modelling in a Multi-agent Portfolio Management System","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Variety (cybernetics); Representation (politics); User modeling; Context (archaeology); Distributed computing; Human–computer interaction; User agent; Scheme (mathematics); User interface; Artificial intelligence; World Wide Web; Programming language","score_opus":0.04567397486799251,"score_gpt":0.2512206922072559,"score_spread":0.20554671733926339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101039650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07506427,0.00012343121,0.9155955,0.00030280024,0.000028486458,0.00018607346,0.00013151432,0.0035359382,0.0050319647],"genre_scores_gemma":[0.7278257,0.0001453589,0.26679605,0.00010424307,0.000014891253,0.0002120206,0.0002762264,0.0001781343,0.004447331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987839,0.0005630978,0.00013656807,0.00014841327,0.0002958494,0.000072191084],"domain_scores_gemma":[0.9985814,0.0007095342,0.00010929899,0.00022050974,0.0002635004,0.00011572956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019970986,0.0006277161,0.0007717689,0.00067703164,0.00072076794,0.002400623,0.0015527066,0.0011635836,0.0018418974],"category_scores_gemma":[0.0043406608,0.0005759309,0.0006706908,0.0005057288,0.00032378573,0.002682169,0.0015456805,0.00078855327,0.0008688188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015402945,0.0013722349,0.02011564,0.00024315408,0.00033731293,0.0010136677,0.002926671,0.580458,0.025898285,0.032847192,0.0064590634,0.3267885],"study_design_scores_gemma":[0.000011298651,0.000029766135,0.00042564707,0.0000069476528,0.000027612577,0.00005630076,0.000041201125,0.9929686,0.0021887515,0.0029339022,0.0012937158,0.000016097276],"about_ca_topic_score_codex":0.0040639145,"about_ca_topic_score_gemma":0.0058006947,"teacher_disagreement_score":0.0040639145,"about_ca_system_score_codex":0.0005412413,"about_ca_system_score_gemma":0.00078733836,"threshold_uncertainty_score":0.010561764},"labels":[],"label_agreement":null},{"id":"W2101155486","doi":"10.1007/11527862_9","title":"Hierarchical Heuristic Search Revisited","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristic; Key (lock); Ideal (ethics); Incremental heuristic search; Hierarchical database model; Data mining; Theoretical computer science; Search algorithm; Artificial intelligence; Algorithm; Beam search","score_opus":0.02079301094900387,"score_gpt":0.2614477346103344,"score_spread":0.2406547236613305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101155486","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.024324033,0.006516189,0.73567986,0.0049036946,0.0005706443,0.0001360665,0.0003202087,0.0006607965,0.22688852],"genre_scores_gemma":[0.5824669,0.0031719678,0.3451312,0.0013395982,0.00033475683,0.00029719362,0.0006117443,0.0003612901,0.066285335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999044,0.00042195705,0.000028403263,0.00014866045,0.00024480483,0.000112186346],"domain_scores_gemma":[0.99774253,0.0014463358,0.0000804857,0.00047023763,0.00018042467,0.00007991436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309398,0.00053641596,0.0009463969,0.0012309895,0.001008922,0.0015701521,0.0017998241,0.0012886126,0.0233623],"category_scores_gemma":[0.011050175,0.0005390913,0.0007453479,0.0025265035,0.0020691415,0.003058237,0.001697113,0.0021781174,0.0016255884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050940253,0.00004140264,0.00022962158,0.00012577366,0.00002902657,0.000039021877,0.00015258025,0.0370057,0.00017422503,0.86931825,0.011380935,0.08145248],"study_design_scores_gemma":[0.000043226763,0.000029172304,0.00033836352,0.000074711876,0.000028664977,0.00006514522,0.00009681749,0.14660081,0.00032909485,0.83583623,0.016544629,0.000013052187],"about_ca_topic_score_codex":0.005287269,"about_ca_topic_score_gemma":0.0079688635,"teacher_disagreement_score":0.0233623,"about_ca_system_score_codex":0.0017510451,"about_ca_system_score_gemma":0.001804334,"threshold_uncertainty_score":0.07815468},"labels":[],"label_agreement":null},{"id":"W2101178343","doi":"10.1007/978-3-319-08644-6_29","title":"Vehicle Accident Severity Rules Mining Using Fuzzy Granular Decision Tree","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decision tree; Redundancy (engineering); ID3; Accident (philosophy); Fuzzy logic; Road accident; Data mining; Vehicle accident; Decision tree learning; Computer science; Traffic accident; Engineering; Transport engineering; Artificial intelligence; Reliability engineering","score_opus":0.013820926304388564,"score_gpt":0.23122005347923677,"score_spread":0.21739912717484822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101178343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13975562,0.0014549779,0.8506945,0.00022467018,0.00015947186,0.00023587732,0.002338341,0.0013316708,0.0038049452],"genre_scores_gemma":[0.7159885,0.00068180996,0.2789186,0.000058034395,0.000082498686,0.00013681667,0.0029145095,0.00004339824,0.001175701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889237,0.00014859084,0.00022163377,0.00019343966,0.0004520197,0.00009202471],"domain_scores_gemma":[0.9986926,0.000692622,0.0001458751,0.00014679744,0.00027061117,0.000051628336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010883238,0.0006303101,0.0012019422,0.0027920138,0.00045435925,0.0013354446,0.0010193645,0.0004474097,0.0012452084],"category_scores_gemma":[0.0028514995,0.00038944455,0.0012522503,0.0030081517,0.000190075,0.0013443449,0.0007499372,0.00074160093,0.00034732014],"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.00041679142,0.00039558794,0.01555863,0.0005766001,0.0005055981,0.00082396984,0.00020855964,0.22614093,0.008446541,0.0076559763,0.0059513575,0.7333194],"study_design_scores_gemma":[0.000024297198,0.00008263463,0.0048651416,0.00006943868,0.00015913087,0.00024558805,0.00009075327,0.97519433,0.0029008368,0.014531098,0.0018030396,0.00003371605],"about_ca_topic_score_codex":0.002795743,"about_ca_topic_score_gemma":0.002776389,"teacher_disagreement_score":0.002795743,"about_ca_system_score_codex":0.00039542472,"about_ca_system_score_gemma":0.00053044077,"threshold_uncertainty_score":0.005755663},"labels":[],"label_agreement":null},{"id":"W2101229568","doi":"10.1007/978-3-642-20036-6_38","title":"Efficient Traversal of Beta-Sheet Protein Folding Pathways Using Ensemble Models","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","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":"McGill University","funders":"","keywords":"Computer science; Folding (DSP implementation); Algorithm; Protein folding; Computation; Markov chain; Tree traversal; Sequence (biology); Molecular dynamics; Population; Biological system; Statistical physics; Theoretical computer science; Physics; Chemistry; Computational chemistry; Machine learning","score_opus":0.025567796112533823,"score_gpt":0.22840564213845613,"score_spread":0.2028378460259223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101229568","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.21856093,0.00045149444,0.7663719,0.00021146606,0.000043434586,0.00010386566,0.0008857854,0.006653628,0.0067174397],"genre_scores_gemma":[0.5605545,0.00028746141,0.4335668,0.00007603441,0.00001569659,0.00012516197,0.0020560308,0.00068405987,0.0026341875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979204,0.000057919493,0.000012393929,0.00003970167,0.000060967952,0.000036982143],"domain_scores_gemma":[0.999308,0.00034013455,0.000040523697,0.00016761516,0.000091100876,0.000052632808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043019833,0.0006172627,0.0009291565,0.00063343777,0.00067025656,0.0010375911,0.0013647928,0.00082245923,0.0032712207],"category_scores_gemma":[0.0015780395,0.00063814054,0.0009650067,0.00086988905,0.00033307928,0.0020187085,0.0013691762,0.0011731723,0.00058596034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039136785,0.00013149247,0.0022489645,0.00013124444,0.000101100326,0.00016131552,0.00017230248,0.801382,0.008064031,0.030696107,0.0042764973,0.15224357],"study_design_scores_gemma":[0.000009083101,0.000013130782,0.00007988683,0.000004196642,0.000005515466,0.000018583163,0.000010306449,0.987428,0.0009431204,0.010936826,0.00054769043,0.000003701797],"about_ca_topic_score_codex":0.0054977126,"about_ca_topic_score_gemma":0.01120488,"teacher_disagreement_score":0.0054977126,"about_ca_system_score_codex":0.0007940684,"about_ca_system_score_gemma":0.00090699986,"threshold_uncertainty_score":0.010943353},"labels":[],"label_agreement":null},{"id":"W2101621888","doi":"10.1007/978-3-642-37064-9_28","title":"Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences","year":2013,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg; University of Waterloo","funders":"","keywords":"Sequence (biology); Factorization; Combinatorics; Mathematics; Generating function; Bounded function; Function (biology); Word (group theory); Discrete mathematics; Algorithm; Biology; Genetics; Geometry","score_opus":0.014585523774755393,"score_gpt":0.26000766732399133,"score_spread":0.24542214354923594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101621888","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5938246,0.0021896707,0.31386483,0.0016358949,0.00065471156,0.00011121422,0.0006014277,0.0006406672,0.086476944],"genre_scores_gemma":[0.95366144,0.00045251712,0.025091585,0.0002669105,0.00036507,0.00014308644,0.0003625478,0.00013909845,0.019517785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987129,0.00034728344,0.00012196568,0.00029242845,0.00030809405,0.00021741947],"domain_scores_gemma":[0.997138,0.0015711592,0.00037218144,0.00028785362,0.00038153437,0.00024917736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213681,0.0006611673,0.0008031272,0.0016765482,0.0021821703,0.0039833975,0.0010528283,0.0016735849,0.007164525],"category_scores_gemma":[0.004931649,0.00067175523,0.0008794499,0.0016401995,0.0040383134,0.0050077937,0.0019137621,0.0021995238,0.0012328341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053823638,0.000012625309,0.00021862156,0.000028957664,0.000004372512,0.00015925714,0.00059640413,0.0003255908,0.0015334295,0.99285877,0.00038713843,0.003820876],"study_design_scores_gemma":[0.000014955864,0.000018455597,0.00014326286,0.00000937751,0.000006930532,0.00014408046,0.00013740677,0.0021598367,0.0006393711,0.9947836,0.0019283055,0.000014338377],"about_ca_topic_score_codex":0.00062363286,"about_ca_topic_score_gemma":0.0008013181,"teacher_disagreement_score":0.007164525,"about_ca_system_score_codex":0.0012337697,"about_ca_system_score_gemma":0.00080708857,"threshold_uncertainty_score":0.023967743},"labels":[],"label_agreement":null},{"id":"W2101628359","doi":"10.1007/978-3-540-76843-2_36","title":"Toward Sound-Assisted Intrusion Detection Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"Ontario Tech University","funders":"","keywords":"Intrusion detection system; Computer science; Denial-of-service attack; Host-based intrusion detection system; Set (abstract data type); Intrusion; Task (project management); Anomaly-based intrusion detection system; Port (circuit theory); Software; Human–computer interaction; Computer security; Intrusion prevention system; Engineering; Operating system; The Internet","score_opus":0.04171735066611499,"score_gpt":0.26171868213678834,"score_spread":0.22000133147067336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101628359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005604263,0.0006821802,0.9878647,0.00031443647,0.00018392448,0.00008132991,0.00006869139,0.0029924542,0.002208093],"genre_scores_gemma":[0.12359549,0.001131856,0.8651845,0.00058400363,0.00030355726,0.00018167056,0.00039779616,0.00017499502,0.008446163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998774,0.00022392743,0.00007787156,0.0002225954,0.0005951233,0.0001064963],"domain_scores_gemma":[0.9975647,0.0009476279,0.00012522192,0.00030761628,0.0009785325,0.000076280645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014706496,0.0013775699,0.0013239395,0.0019697056,0.0005935271,0.0024119732,0.00206479,0.0014803798,0.0031322397],"category_scores_gemma":[0.0048629665,0.0005542315,0.00066664134,0.0010581017,0.0008658742,0.0025256118,0.002095185,0.0019425312,0.0023985433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027579776,0.0002681662,0.0012885967,0.00022156684,0.00009310549,0.00014025232,0.00012187704,0.031085419,0.05949157,0.01499334,0.008662047,0.88335836],"study_design_scores_gemma":[0.00005721704,0.00035012103,0.0007437308,0.000057077734,0.00009240983,0.00042492832,0.00015215127,0.8803273,0.05840602,0.043078654,0.016268373,0.000042098647],"about_ca_topic_score_codex":0.0010643074,"about_ca_topic_score_gemma":0.0018539618,"teacher_disagreement_score":0.0031322397,"about_ca_system_score_codex":0.00049731607,"about_ca_system_score_gemma":0.0007346404,"threshold_uncertainty_score":0.010478437},"labels":[],"label_agreement":null},{"id":"W2101737843","doi":"10.1007/978-3-540-88313-5_30","title":"Structured Peer-to-Peer Overlay Networks: Ideal Botnets Command and Control Infrastructures?","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":48,"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; École de Technologie Supérieure; University of Victoria; Polytechnique Montréal","funders":"","keywords":"Computer science; Botnet; Overlay network; Overlay; Resilience (materials science); Peer-to-peer; The Internet; Command and control; Computer network; Distributed computing; Network topology; Node (physics); Computer security; World Wide Web; Telecommunications; Engineering","score_opus":0.009577313000847259,"score_gpt":0.23135061119489034,"score_spread":0.22177329819404307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101737843","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103945404,0.0022611788,0.7123433,0.0104797175,0.000976256,0.00013131904,0.0002194052,0.00091411604,0.16872923],"genre_scores_gemma":[0.9268285,0.0014798837,0.0431656,0.00042906203,0.00026080053,0.00007374325,0.00010277268,0.00007585662,0.027583703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995413,0.0001077752,0.000014235847,0.00010140633,0.00014483125,0.00009065383],"domain_scores_gemma":[0.9988802,0.00038023014,0.000107467116,0.0002158577,0.0002449485,0.00017127693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008313773,0.00031005254,0.00044538968,0.00034583628,0.0006590205,0.0023168714,0.0011424839,0.0015598298,0.004110884],"category_scores_gemma":[0.0046132053,0.00036105563,0.00020215796,0.00041414396,0.0020368584,0.0055885096,0.0010589482,0.0009962688,0.0011264441],"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.00007275444,0.000031545016,0.00028979414,0.00008757292,0.000014402034,0.0001281318,0.00025280128,0.02392518,0.0019386655,0.9456628,0.007552898,0.020043407],"study_design_scores_gemma":[0.000029016615,0.00004082274,0.00018442317,0.000032018004,0.000011131754,0.00019700668,0.00024177135,0.16205736,0.0012492437,0.8191679,0.016774636,0.00001468918],"about_ca_topic_score_codex":0.0007512204,"about_ca_topic_score_gemma":0.000732518,"teacher_disagreement_score":0.004110884,"about_ca_system_score_codex":0.00090346404,"about_ca_system_score_gemma":0.00082988496,"threshold_uncertainty_score":0.013752222},"labels":[],"label_agreement":null},{"id":"W2101903803","doi":"10.1007/978-3-642-23447-7_8","title":"The Concept of a Mobile Cloud Computing to Reduce Energy Cost of Smartphones and ICT Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Green IT and Sustainability","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 Waterloo","funders":"","keywords":"Cloud computing; Information and Communications Technology; Green computing; Computer science; Data center; Energy consumption; The Internet; Mobile cloud computing; Internet of Things; Distributed computing; Computer network; Computer security; World Wide Web; Engineering; Operating system; Electrical engineering","score_opus":0.01011915017157591,"score_gpt":0.21439054405910077,"score_spread":0.20427139388752485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101903803","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.04841105,0.033362117,0.31396797,0.024225969,0.0057334555,0.00042560374,0.00039792224,0.00074180897,0.5727341],"genre_scores_gemma":[0.6712391,0.023107585,0.14950937,0.0053254,0.0024009112,0.0003956582,0.00018658992,0.00033731243,0.14749801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968255,0.00004796766,0.000010700439,0.000054920874,0.00013473317,0.00006909188],"domain_scores_gemma":[0.9997849,0.000056303146,0.000014482283,0.000035687943,0.00006496113,0.000043659908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003171107,0.0005513356,0.00030023197,0.0005906361,0.0008452072,0.0022383982,0.0008395143,0.0012070385,0.005571914],"category_scores_gemma":[0.0005226359,0.00021722027,0.0005795222,0.0011906147,0.0014322421,0.003807025,0.0013317455,0.001954835,0.0008385046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005012548,0.000055295743,0.00025682154,0.00021177465,0.00001765229,0.0001522314,0.0002577468,0.0026666825,0.0070631313,0.8808009,0.017713193,0.09075434],"study_design_scores_gemma":[0.00003550656,0.00021314567,0.001588972,0.0003993776,0.00006401631,0.0014043782,0.0005447996,0.042451814,0.011978282,0.35893875,0.5823174,0.00006351528],"about_ca_topic_score_codex":0.0025188627,"about_ca_topic_score_gemma":0.002594411,"teacher_disagreement_score":0.005571914,"about_ca_system_score_codex":0.0012700671,"about_ca_system_score_gemma":0.0016310968,"threshold_uncertainty_score":0.018639863},"labels":[],"label_agreement":null},{"id":"W2101917791","doi":"10.1007/3-540-45551-5_46","title":"Intelligent Traffic Conditioners for Assured Forwarding Based Differentiated Services Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Enhanced Data Rates for GSM Evolution; Conditioners; Intelligent Network; Service (business); Telecommunications; Engineering","score_opus":0.01109782146976253,"score_gpt":0.22499016505556452,"score_spread":0.21389234358580198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101917791","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.03314057,0.0015890658,0.9513596,0.0002578232,0.00032224398,0.00013002502,0.00007811248,0.0037532183,0.009369361],"genre_scores_gemma":[0.76636505,0.0010902816,0.2140486,0.00025638923,0.0002634079,0.00012533092,0.00016724858,0.00015521768,0.017528575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000025659578,0.000011633622,0.000044550747,0.00011285575,0.000029013898],"domain_scores_gemma":[0.9996941,0.00011049131,0.000037750026,0.00004814705,0.00009354294,0.000015976852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039936803,0.00050826214,0.0005408842,0.00039492297,0.0004330061,0.0009422187,0.0012723312,0.00064486,0.003537397],"category_scores_gemma":[0.00085553946,0.00032370642,0.00018893665,0.00023588535,0.0003938561,0.0007611985,0.00038952476,0.00093090616,0.000646936],"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.0007774527,0.00024496167,0.0004943035,0.0002087846,0.000033899574,0.00021035952,0.00032379094,0.10513145,0.17310584,0.060538482,0.013397012,0.64553374],"study_design_scores_gemma":[0.0001099847,0.00043986161,0.00062942255,0.000046246616,0.000081078375,0.0002439752,0.00003716119,0.8827144,0.06242373,0.022858417,0.03036555,0.000050109487],"about_ca_topic_score_codex":0.00087790017,"about_ca_topic_score_gemma":0.0016725775,"teacher_disagreement_score":0.003537397,"about_ca_system_score_codex":0.0006105996,"about_ca_system_score_gemma":0.00028597398,"threshold_uncertainty_score":0.011833727},"labels":[],"label_agreement":null},{"id":"W2101921719","doi":"10.1007/978-3-642-21458-5_14","title":"Fast Error-Tolerant Quartet Phylogeny Algorithms","year":2011,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 Waterloo","funders":"","keywords":"Heuristics; Probabilistic logic; Algorithm; Phylogenetic tree; Tree (set theory); Consistency (knowledge bases); Computer science; Topology (electrical circuits); Mathematics; Phylogenetics; Combinatorics; Theoretical computer science; Discrete mathematics; Artificial intelligence; Mathematical optimization; Biology","score_opus":0.020386713884251565,"score_gpt":0.2574871588415872,"score_spread":0.23710044495733562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101921719","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.043555703,0.0009014735,0.9426309,0.00072402076,0.00039428743,0.00023868842,0.00071861385,0.00841683,0.0024195546],"genre_scores_gemma":[0.17102621,0.00023542083,0.81950635,0.0003947346,0.00017881166,0.00026114684,0.0031855518,0.0016044524,0.0036073185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701893,0.00083876686,0.000245519,0.00074082246,0.0008623637,0.0002935741],"domain_scores_gemma":[0.98676807,0.00603614,0.0005888084,0.004024546,0.0020145688,0.0005678435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040784515,0.001828419,0.003008256,0.0021514343,0.0019996967,0.0024186405,0.0049208156,0.0031926075,0.018380586],"category_scores_gemma":[0.020801844,0.0013321673,0.0017993734,0.0034424576,0.0009326195,0.0042595025,0.005265718,0.0041091447,0.0062052365],"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.0017736168,0.00037996258,0.0021022705,0.00045666337,0.00022201067,0.00024122068,0.0004588465,0.12117137,0.012389955,0.015043773,0.02046751,0.8252928],"study_design_scores_gemma":[0.0005081211,0.00038826882,0.0008773181,0.000057283254,0.000083748375,0.00027986366,0.0002136217,0.89786893,0.006774416,0.08644077,0.0064578154,0.000049863378],"about_ca_topic_score_codex":0.0015463657,"about_ca_topic_score_gemma":0.0035783963,"teacher_disagreement_score":0.018380586,"about_ca_system_score_codex":0.0010212639,"about_ca_system_score_gemma":0.0016349846,"threshold_uncertainty_score":0.061489165},"labels":[],"label_agreement":null},{"id":"W2101995394","doi":"10.1007/978-3-540-75292-9_8","title":"A Complete and Compact Propositional Deontic Logic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Propositional variable; Zeroth-order logic; Computer science; Autoepistemic logic; Programming language; Intermediate logic; Philosophy; Linguistics; Multimodal logic; Description logic","score_opus":0.0332965171951564,"score_gpt":0.26533941998612304,"score_spread":0.23204290279096662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101995394","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.03408257,0.003051395,0.8198724,0.0026568219,0.00055972213,0.00015629765,0.001742574,0.0015331721,0.13634515],"genre_scores_gemma":[0.46414185,0.002272349,0.46080247,0.0009103797,0.00064061914,0.0002265815,0.0019891188,0.00040865576,0.06860803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926716,0.0001242983,0.0000607804,0.00017017324,0.0003092013,0.00006834532],"domain_scores_gemma":[0.99916553,0.00037844933,0.000055533965,0.00017949472,0.00016156012,0.000059483016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333689,0.0006759675,0.0007485353,0.00083406444,0.001445437,0.0036517838,0.0011970304,0.0011774208,0.009762538],"category_scores_gemma":[0.0021886493,0.00067762256,0.00080918544,0.001331939,0.0020581863,0.006308046,0.0021931233,0.0025807887,0.001958339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025969706,0.00001709165,0.000045327015,0.000060713974,0.0000062057306,0.00004164994,0.0001111571,0.0012359214,0.0008316351,0.9719663,0.0033773181,0.022280617],"study_design_scores_gemma":[0.000015957383,0.00001197896,0.0000675196,0.000019603487,0.000010886515,0.0000739535,0.000031401956,0.007100529,0.0006912876,0.96669155,0.025276577,0.000008753235],"about_ca_topic_score_codex":0.001224977,"about_ca_topic_score_gemma":0.0014324854,"teacher_disagreement_score":0.009762538,"about_ca_system_score_codex":0.0012047143,"about_ca_system_score_gemma":0.0010207313,"threshold_uncertainty_score":0.032658875},"labels":[],"label_agreement":null},{"id":"W2102282930","doi":"10.1007/978-3-642-31368-4_22","title":"Features’ Weight Learning towards Improved Query Classification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Weighting; Support vector machine; Naive Bayes classifier; k-nearest neighbors algorithm; Artificial intelligence; Data mining; Entropy (arrow of time); Machine learning; Pattern recognition (psychology); Scheme (mathematics); Mathematics","score_opus":0.021257727760830295,"score_gpt":0.25452082845845103,"score_spread":0.23326310069762074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102282930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07683186,0.0019458837,0.91317457,0.00042392968,0.0002397223,0.00011648531,0.0005268979,0.0048511233,0.0018895039],"genre_scores_gemma":[0.5195877,0.0008807993,0.46757764,0.00027868376,0.00040579005,0.00015241439,0.002714593,0.0006396574,0.0077627627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987846,0.00020547856,0.00009699587,0.0002978926,0.0004585076,0.00015651078],"domain_scores_gemma":[0.99809617,0.00066751445,0.00011670226,0.00042580126,0.0006237874,0.00006996519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770884,0.0008914245,0.0012612735,0.0016815107,0.00041160497,0.0013836622,0.0015484779,0.0010589992,0.0033278512],"category_scores_gemma":[0.005249849,0.000348207,0.000799039,0.0022382075,0.00040419854,0.0023757515,0.0012234581,0.0016033386,0.0018926106],"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.0005379433,0.00024672778,0.0017195941,0.00015679353,0.000076415796,0.000056805595,0.00007854685,0.015042257,0.056064744,0.003320725,0.010757503,0.911942],"study_design_scores_gemma":[0.000047595164,0.00016722419,0.0019186971,0.000020168614,0.00008516932,0.00019255407,0.00004355594,0.9451007,0.03884761,0.0072929263,0.0062582297,0.00002541817],"about_ca_topic_score_codex":0.0031774594,"about_ca_topic_score_gemma":0.0031575896,"teacher_disagreement_score":0.0033278512,"about_ca_system_score_codex":0.0006023225,"about_ca_system_score_gemma":0.0007492037,"threshold_uncertainty_score":0.011132777},"labels":[],"label_agreement":null},{"id":"W2102379606","doi":"10.1007/978-3-642-23556-6_1","title":"Quantifying Privacy Violations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Information privacy; Privacy software; Privacy by Design; Computer security; Internet privacy; Privacy policy; Privacy protection; Work (physics); Data science","score_opus":0.0764992450530536,"score_gpt":0.29437970996574603,"score_spread":0.21788046491269242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102379606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024937088,0.002401904,0.873961,0.0043399767,0.0005734809,0.00021601669,0.001025908,0.0011817373,0.09136293],"genre_scores_gemma":[0.7851495,0.002521668,0.17876935,0.0012890886,0.0006129845,0.00036000568,0.001688387,0.0006360077,0.028972998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98248184,0.0062409197,0.00095057394,0.0027789564,0.0063567953,0.001190906],"domain_scores_gemma":[0.97320694,0.013472882,0.0019397129,0.007931803,0.0028916332,0.0005569714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007023389,0.0015308638,0.0013705291,0.0032660037,0.0018562513,0.008746227,0.0024147388,0.0027664131,0.01208262],"category_scores_gemma":[0.042850085,0.0009971728,0.0014294792,0.0030277555,0.0042491686,0.01516013,0.006048164,0.0059221555,0.0022661444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006213032,0.00005371529,0.0009569537,0.00016878257,0.000059910362,0.00007745173,0.00020505245,0.012364936,0.0012579627,0.91337603,0.00546209,0.06595508],"study_design_scores_gemma":[0.000004906267,0.00002767251,0.0002638703,0.00008268666,0.000029949264,0.000115154115,0.00009377288,0.03801323,0.0026162106,0.95204103,0.0066915927,0.000019877396],"about_ca_topic_score_codex":0.0010340391,"about_ca_topic_score_gemma":0.0006910428,"teacher_disagreement_score":0.01208262,"about_ca_system_score_codex":0.0030699347,"about_ca_system_score_gemma":0.0020275456,"threshold_uncertainty_score":0.040420353},"labels":[],"label_agreement":null},{"id":"W2102465478","doi":"10.1007/978-3-642-23719-5_44","title":"Improved Algorithms for Partial Curve Matching","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Algorithm; Computer science; Matching (statistics); Simple (philosophy); Graph; Directed acyclic graph; Data structure; Jordan curve theorem; Mathematics; Combinatorics; Theoretical computer science; Statistics","score_opus":0.03105627783576869,"score_gpt":0.2677941876615241,"score_spread":0.23673790982575538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102465478","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.00553666,0.0005608933,0.98228574,0.00013236389,0.00019721857,0.000086571396,0.00019009515,0.0024570515,0.0085534295],"genre_scores_gemma":[0.0495905,0.00060163264,0.9347317,0.000101573736,0.00017786602,0.0001742635,0.00084047817,0.0008579579,0.012923972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975932,0.00033088066,0.00016283216,0.0004379245,0.0012692919,0.00020585171],"domain_scores_gemma":[0.99710983,0.000727667,0.000116605945,0.0013376424,0.0006135558,0.00009464928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012573621,0.0019456891,0.002219129,0.0031778174,0.0010848462,0.0026257494,0.0044528674,0.0018377334,0.026252558],"category_scores_gemma":[0.006708428,0.0011525655,0.0018626784,0.0052589937,0.0013680513,0.005876164,0.0050259545,0.003513521,0.009014097],"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.00028197133,0.00013695085,0.00035991374,0.0002968431,0.000073936324,0.00006512791,0.00012801774,0.04062132,0.00921522,0.10231276,0.018052697,0.8284553],"study_design_scores_gemma":[0.00016368546,0.00016212228,0.0007792042,0.00008078959,0.000114386974,0.00051082927,0.00011603949,0.64192533,0.017262805,0.28585598,0.052944556,0.000084249295],"about_ca_topic_score_codex":0.002571965,"about_ca_topic_score_gemma":0.0033253233,"teacher_disagreement_score":0.026252558,"about_ca_system_score_codex":0.001348311,"about_ca_system_score_gemma":0.0011700289,"threshold_uncertainty_score":0.08782357},"labels":[],"label_agreement":null},{"id":"W2102501261","doi":"10.1007/978-3-642-13036-6_9","title":"On Generalizations of Network Design Problems with Degree Bounds","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Spanning tree; Degree (music); Matroid; Computer science; Relaxation (psychology); Combinatorial optimization; Mathematical optimization; Intersection (aeronautics); Network planning and design; Algorithm; Mathematics; Discrete mathematics","score_opus":0.04049474481597431,"score_gpt":0.2365318855826842,"score_spread":0.1960371407667099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102501261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06632829,0.008933495,0.82143176,0.00829212,0.0010501316,0.0002517126,0.0008440475,0.0003961948,0.092472225],"genre_scores_gemma":[0.6024093,0.02137503,0.29219282,0.0033422236,0.0062015867,0.0008867568,0.0025908148,0.0008083528,0.07019306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968828,0.0014594671,0.00014616197,0.0006325226,0.00056817534,0.00031087542],"domain_scores_gemma":[0.98202723,0.014007771,0.001011643,0.0014995753,0.0006329704,0.0008207949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00465077,0.0028599275,0.002564447,0.0027101494,0.0017150979,0.0035310276,0.004148528,0.0033924538,0.009877355],"category_scores_gemma":[0.02414409,0.0016016893,0.0034001814,0.004961188,0.0033016456,0.011769719,0.004826349,0.008070607,0.0009125737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000960145,0.00012522844,0.0005325374,0.0003322848,0.000066918685,0.00013895553,0.00024048479,0.097678475,0.0005592751,0.8582147,0.012473469,0.02954171],"study_design_scores_gemma":[0.000020437554,0.000016688296,0.00012221134,0.0000457012,0.000022655473,0.0000613747,0.000040553863,0.07475651,0.00010815787,0.92040306,0.00439241,0.000010267361],"about_ca_topic_score_codex":0.002528689,"about_ca_topic_score_gemma":0.0024824666,"teacher_disagreement_score":0.009877355,"about_ca_system_score_codex":0.0030599802,"about_ca_system_score_gemma":0.0010480104,"threshold_uncertainty_score":0.033043027},"labels":[],"label_agreement":null},{"id":"W2102938053","doi":"10.1007/978-3-540-39964-3_16","title":"A Cooperative Approach to the Development of Expert Knowledge Bases Applied to Define Standard of Care in Glaucoma","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Calgary","funders":"","keywords":"Computer science; Glaucoma; Expert system; Set (abstract data type); Fuzzy logic; Knowledge base; Core (optical fiber); Artificial intelligence; Transfer of learning; Data mining; Medicine","score_opus":0.02242480579105687,"score_gpt":0.2530064761311247,"score_spread":0.23058167034006782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102938053","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.021881666,0.00030903803,0.9653085,0.00062675163,0.00003226115,0.000427666,0.00010859112,0.00037766685,0.0109278355],"genre_scores_gemma":[0.10910322,0.00014816991,0.8878864,0.00007276606,0.000015153855,0.00025584747,0.00027572783,0.000056664205,0.0021860576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898121,0.004983012,0.0010527975,0.000832084,0.0030176921,0.0003023269],"domain_scores_gemma":[0.9737108,0.01592206,0.00088918285,0.0036934314,0.005300747,0.00048389906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016713282,0.0006077454,0.0008375304,0.003501919,0.0016021392,0.004052367,0.004136442,0.0017894793,0.0036705486],"category_scores_gemma":[0.04060751,0.0008430644,0.001233406,0.002425784,0.0014357659,0.0043466473,0.0045578093,0.0017622514,0.00065355236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026574603,0.0007601928,0.003938726,0.00059472735,0.0003059138,0.00088021834,0.013284799,0.06006936,0.009892311,0.14884132,0.007023732,0.754143],"study_design_scores_gemma":[0.0001487095,0.000560922,0.004041278,0.000854461,0.00052358425,0.0012509549,0.00650586,0.637337,0.019678755,0.26355043,0.065371126,0.00017688278],"about_ca_topic_score_codex":0.006086357,"about_ca_topic_score_gemma":0.010382566,"teacher_disagreement_score":0.016713282,"about_ca_system_score_codex":0.0015976735,"about_ca_system_score_gemma":0.0041710087,"threshold_uncertainty_score":0.08838934},"labels":[],"label_agreement":null},{"id":"W2102984158","doi":"10.1007/978-3-642-12678-9_16","title":"Differential Fault Analysis of HC-128","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Differential (mechanical device); Fault (geology); Geology; Physics; Seismology; Thermodynamics","score_opus":0.014926078705883555,"score_gpt":0.2713883217053996,"score_spread":0.25646224299951603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102984158","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.6129929,0.001419618,0.35858357,0.0007996462,0.00019747004,0.00009121509,0.00047877413,0.0015276776,0.023909215],"genre_scores_gemma":[0.9805211,0.000100926096,0.01430145,0.000054365795,0.000031827145,0.000011365485,0.00013940423,0.000049719674,0.0047899103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993843,0.000090788126,0.000025400595,0.00008300939,0.00032264082,0.00009385337],"domain_scores_gemma":[0.9988739,0.0005010032,0.00008827497,0.00024233045,0.00026941928,0.000025049552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038232034,0.00031480688,0.00038702632,0.000764186,0.0003372544,0.0005633061,0.00050819793,0.00043390045,0.003436699],"category_scores_gemma":[0.0021904525,0.00013425515,0.00024046237,0.00055002514,0.0005577461,0.001081451,0.000495002,0.00045580853,0.00035871507],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016177426,0.00016200969,0.009603656,0.00044394576,0.00012332278,0.0012508155,0.0005715564,0.1932254,0.09893936,0.37563837,0.009682118,0.30874175],"study_design_scores_gemma":[0.000039339862,0.0002809586,0.0032697495,0.000058559453,0.00004403419,0.000893503,0.00008113653,0.73500055,0.07188578,0.1822541,0.006146356,0.000045974277],"about_ca_topic_score_codex":0.00085325993,"about_ca_topic_score_gemma":0.001028859,"teacher_disagreement_score":0.003436699,"about_ca_system_score_codex":0.0010914879,"about_ca_system_score_gemma":0.00066213525,"threshold_uncertainty_score":0.011496842},"labels":[],"label_agreement":null},{"id":"W2103198845","doi":"10.1007/978-3-642-12307-8_16","title":"Vehicle Headlights Detection Using Markov Random Fields","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Reflection (computer programming); Computer vision; Gaussian; Markov chain; Blob detection; Iterated function; Markov random field; Markov process; Pattern recognition (psychology); Image (mathematics); Image processing; Edge detection; Image segmentation; Machine learning; Mathematics; Physics; Statistics","score_opus":0.021776555399991154,"score_gpt":0.2751182808512244,"score_spread":0.25334172545123324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103198845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03846439,0.0005045932,0.95802164,0.00008720297,0.000065916036,0.00003220706,0.000113681315,0.0011158629,0.0015944763],"genre_scores_gemma":[0.7846703,0.0005954641,0.20837554,0.000118789176,0.000093675146,0.000046234913,0.00050962146,0.00009959872,0.005490781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963796,0.00006223559,0.000010952744,0.000098414166,0.00010872708,0.00008167758],"domain_scores_gemma":[0.9993913,0.00032651916,0.00005985688,0.00006353092,0.00012744771,0.00003130606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064666354,0.00048874755,0.0010336413,0.0013130358,0.00029566692,0.0006687119,0.00090702705,0.00073273585,0.0010393863],"category_scores_gemma":[0.0011984817,0.00055953837,0.00080916466,0.00083313585,0.00032280618,0.0007538408,0.0006959069,0.0006494416,0.00057787856],"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.00068686914,0.00018043548,0.0058248537,0.00015190452,0.00019052277,0.00021757907,0.00008100145,0.29315495,0.04049349,0.005831143,0.0044464553,0.64874077],"study_design_scores_gemma":[0.000007932897,0.000033807813,0.0011581418,0.000006649488,0.000017968725,0.00006921581,0.0000076284905,0.9910569,0.005356516,0.0017818736,0.0004904391,0.000012932086],"about_ca_topic_score_codex":0.005196571,"about_ca_topic_score_gemma":0.0054809535,"teacher_disagreement_score":0.005196571,"about_ca_system_score_codex":0.0005243934,"about_ca_system_score_gemma":0.0005793913,"threshold_uncertainty_score":0.010332644},"labels":[],"label_agreement":null},{"id":"W2103220413","doi":"10.1007/978-3-540-85209-4_4","title":"Adaptive MANET Routing: A Case Study","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Carleton University","funders":"","keywords":"Computer science; Mobile ad hoc network; Routing (electronic design automation); Computer network","score_opus":0.026035516037074928,"score_gpt":0.25007033558363057,"score_spread":0.22403481954655563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103220413","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.8822823,0.0019072776,0.05661765,0.0026388883,0.00027933842,0.00055669225,0.0008855744,0.00043567285,0.0543965],"genre_scores_gemma":[0.95701504,0.0016353969,0.027556252,0.00023020712,0.00009402819,0.00011002669,0.00027374976,0.000073524665,0.013011734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00044881186,0.000041573618,0.00009803003,0.00018850139,0.00015015676],"domain_scores_gemma":[0.9965288,0.0025760808,0.00018845186,0.00026510356,0.00023372206,0.00020792727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063788,0.00054983416,0.00032997967,0.00075654744,0.001029287,0.0013342726,0.0016710423,0.0030592692,0.0028378572],"category_scores_gemma":[0.0037862773,0.00024470224,0.00046022318,0.0014724887,0.0008141858,0.0009825059,0.00068651576,0.0006832464,0.00055528356],"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.0025949785,0.0063457796,0.05387539,0.0026148886,0.00040435675,0.1980141,0.00638618,0.2870844,0.01827007,0.06538729,0.039143212,0.3198793],"study_design_scores_gemma":[0.000952123,0.0047771176,0.02842764,0.00049450406,0.0004922615,0.15105917,0.021345703,0.6022564,0.027368769,0.040195417,0.122371815,0.0002591442],"about_ca_topic_score_codex":0.003370485,"about_ca_topic_score_gemma":0.0060515734,"teacher_disagreement_score":0.003370485,"about_ca_system_score_codex":0.00055603083,"about_ca_system_score_gemma":0.0003485091,"threshold_uncertainty_score":0.009493589},"labels":[],"label_agreement":null},{"id":"W2103350836","doi":"10.1007/978-3-642-32663-9_8","title":"Analysis of Inverse Snyder Optimizations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Historical Geography and Cartography","field":"Social Sciences","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 Calgary","funders":"","keywords":"Computer science; Inverse; Projection (relational algebra); Algorithm; Polynomial; Planar; Inverse problem; Plane (geometry); Root-finding algorithm; Mathematical optimization; Applied mathematics; Mathematics; Computer graphics (images); Geometry; Mathematical analysis","score_opus":0.017894295127090464,"score_gpt":0.259629531059698,"score_spread":0.24173523593260754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103350836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11879992,0.0011635761,0.7527258,0.00082987937,0.0003563447,0.0000856396,0.00028593835,0.00083666254,0.12491628],"genre_scores_gemma":[0.7734632,0.0008257719,0.16383351,0.00042457826,0.0003079101,0.00020526213,0.0007163471,0.0017988229,0.058424734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.00022351136,0.000028226892,0.000095745854,0.00026932918,0.000119435244],"domain_scores_gemma":[0.99859303,0.000729089,0.00009993741,0.00023861331,0.0002584988,0.000080724414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010789216,0.00091891474,0.0011763553,0.0015748716,0.0010019691,0.0015152444,0.0017589269,0.0009004823,0.015506187],"category_scores_gemma":[0.0059117475,0.0005785953,0.0013237327,0.0013138502,0.0019679544,0.0028124056,0.0018018305,0.0019650615,0.0013582899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009193816,0.00005591156,0.00028855712,0.00008153088,0.000027488568,0.000056726116,0.00007745211,0.050145328,0.0010326239,0.91759664,0.0048810043,0.025664767],"study_design_scores_gemma":[0.000015887303,0.000022564263,0.00018868197,0.000019606417,0.000014643385,0.00004049968,0.000034396948,0.22193784,0.0007619661,0.7746478,0.0023024923,0.000013688216],"about_ca_topic_score_codex":0.002162827,"about_ca_topic_score_gemma":0.0034039582,"teacher_disagreement_score":0.015506187,"about_ca_system_score_codex":0.0011568492,"about_ca_system_score_gemma":0.0010839243,"threshold_uncertainty_score":0.051873326},"labels":[],"label_agreement":null},{"id":"W2103419120","doi":"10.1007/978-3-642-01818-3_8","title":"Statistical Parsing with Context-Free Filtering Grammar","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parsing; Grammar; Context-free grammar; Artificial intelligence; Natural language processing; Context (archaeology); Programming language; Linguistics","score_opus":0.0131304933314721,"score_gpt":0.251016197908207,"score_spread":0.2378857045767349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103419120","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.0021467088,0.00020511296,0.9890469,0.00014553484,0.000062662795,0.00003425631,0.00038160267,0.005392115,0.0025850763],"genre_scores_gemma":[0.12287785,0.000567832,0.859538,0.00031275972,0.00021306657,0.00019934942,0.0044942684,0.00521015,0.006586636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977507,0.0006556429,0.00021731235,0.0006381457,0.00059276924,0.00014543861],"domain_scores_gemma":[0.9953517,0.002938786,0.00014944958,0.0009905848,0.00050823204,0.00006128651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023939745,0.0012920371,0.0019080525,0.002479651,0.0012388243,0.0025428315,0.0026566477,0.001791148,0.0092525],"category_scores_gemma":[0.0066931234,0.0016159844,0.0024793255,0.0033380648,0.0019155444,0.0040559326,0.0019146403,0.0024472696,0.0054986333],"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.00015834537,0.00010545129,0.0010171352,0.00051263673,0.0001653094,0.0005991848,0.00042782334,0.06599164,0.01233737,0.39275712,0.027585115,0.4983429],"study_design_scores_gemma":[0.000029715538,0.000034541514,0.00038908556,0.00005968944,0.00008690305,0.00032822118,0.000036890706,0.24294886,0.012460778,0.7226654,0.020885523,0.000074368916],"about_ca_topic_score_codex":0.0030957314,"about_ca_topic_score_gemma":0.0036650891,"teacher_disagreement_score":0.0092525,"about_ca_system_score_codex":0.0010029571,"about_ca_system_score_gemma":0.0022082124,"threshold_uncertainty_score":0.030952632},"labels":[],"label_agreement":null},{"id":"W2103431968","doi":"10.1007/3-540-45665-1_2","title":"Scaling Large Learning Problems with Hard Parallel Mixtures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","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":"Université de Montréal","funders":"","keywords":"Computer science; Parallelizable manifold; Probabilistic logic; Generalization; Quadratic equation; Support vector machine; Algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics","score_opus":0.01503603747282623,"score_gpt":0.218231011784099,"score_spread":0.20319497431127279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103431968","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.024982475,0.0011219332,0.9623272,0.00213003,0.00041621894,0.000080226506,0.00009138819,0.0008446567,0.008005829],"genre_scores_gemma":[0.45323026,0.0017457801,0.51898456,0.0012056743,0.0022103249,0.0006582146,0.00042932775,0.0010108339,0.02052501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719113,0.001102081,0.00019407284,0.00047965534,0.0007975751,0.00023550927],"domain_scores_gemma":[0.9835159,0.012371466,0.0006275701,0.0019842428,0.0008154258,0.00068529235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062856027,0.001749403,0.0025794671,0.0012340812,0.0011591712,0.003224781,0.0027943023,0.0028516175,0.007669147],"category_scores_gemma":[0.03419003,0.0019813597,0.0012080646,0.001985782,0.0028111995,0.00859013,0.0075157904,0.0051463842,0.0013600878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038949892,0.00026858374,0.00063608424,0.0004061917,0.00016853832,0.00013895126,0.0001574578,0.74425787,0.0026760516,0.14288864,0.011424269,0.09658783],"study_design_scores_gemma":[0.00003781739,0.000027173668,0.000076194156,0.000010085075,0.000014425057,0.00002796533,0.00001646479,0.8397377,0.0005472109,0.15844482,0.0010492821,0.000010718463],"about_ca_topic_score_codex":0.001038273,"about_ca_topic_score_gemma":0.0011758865,"teacher_disagreement_score":0.007669147,"about_ca_system_score_codex":0.0011791538,"about_ca_system_score_gemma":0.0009109717,"threshold_uncertainty_score":0.033241868},"labels":[],"label_agreement":null},{"id":"W2103754897","doi":"10.1007/978-3-319-07176-3_12","title":"Computer-Aided System for Automatic Classification of Suspicious Lesions in Breast Ultrasound Images","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Breast ultrasound; Ultrasound; Computer vision; Pattern recognition (psychology); Breast cancer; Fuzzy logic; Image segmentation; Computer-aided diagnosis; Radiology; Mammography; Cancer; Medicine","score_opus":0.017157810705378793,"score_gpt":0.24966478001952436,"score_spread":0.23250696931414555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103754897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14001727,0.0043231505,0.81018126,0.000521007,0.00051119074,0.00067481847,0.003352447,0.0307981,0.009620772],"genre_scores_gemma":[0.3426002,0.00198306,0.62134206,0.00077024393,0.000224335,0.0005780356,0.0046091084,0.0003887476,0.027504195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974734,0.000030877643,0.000021250127,0.00007782475,0.000096731324,0.000025914394],"domain_scores_gemma":[0.99951637,0.00015025865,0.000023824374,0.00004355317,0.00024302898,0.000022885317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053437724,0.0004578961,0.0005795073,0.0013011303,0.00025632858,0.0006356824,0.0008851349,0.00090956583,0.0097805085],"category_scores_gemma":[0.00087766896,0.0002710484,0.0003270326,0.00056007353,0.00010865192,0.0004133683,0.00046298406,0.00029377392,0.0050819945],"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.0007690592,0.00016302681,0.0047245612,0.00035161775,0.00009494409,0.00026277165,0.00008606425,0.0016132614,0.19386016,0.0006808557,0.016047211,0.7813465],"study_design_scores_gemma":[0.00025547802,0.001450185,0.06345595,0.00026422125,0.00073432043,0.006191446,0.00024155484,0.3874453,0.48091942,0.0017170258,0.05710898,0.00021612938],"about_ca_topic_score_codex":0.0014827945,"about_ca_topic_score_gemma":0.0026966955,"teacher_disagreement_score":0.0097805085,"about_ca_system_score_codex":0.0002639465,"about_ca_system_score_gemma":0.00044686583,"threshold_uncertainty_score":0.032719016},"labels":[],"label_agreement":null},{"id":"W2103846476","doi":"10.1007/978-3-642-39112-5_133","title":"Towards Evaluating and Modelling the Impacts of Mobile-Based Augmented Reality Applications on Learning and Engagement","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Brock University; McGill University","funders":"","keywords":"Augmented reality; Computer science; Mobile device; Human–computer interaction; Multimedia; World Wide Web","score_opus":0.07278676677790809,"score_gpt":0.37470435501381544,"score_spread":0.30191758823590736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103846476","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.6689141,0.0029195028,0.3081917,0.00048231392,0.00007272552,0.00053815194,0.00055500073,0.000652821,0.017673714],"genre_scores_gemma":[0.94113594,0.00079752016,0.055491522,0.000030806765,0.00000934779,0.00020995383,0.00024574168,0.000042039326,0.0020372123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980565,0.00085110427,0.00011533134,0.00026290238,0.0005836818,0.00013053643],"domain_scores_gemma":[0.9935062,0.0052582566,0.0003893797,0.00030358662,0.00046402574,0.00007856424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024840732,0.0010131143,0.00067772594,0.00086825155,0.00028414224,0.0055256556,0.0014611114,0.0017632347,0.0031276809],"category_scores_gemma":[0.010858498,0.000685459,0.0010387468,0.0009293203,0.0006697171,0.0038262717,0.0014438019,0.001142684,0.00066998036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011315687,0.0010683292,0.017229816,0.0013601057,0.00035481123,0.00016525136,0.0017386499,0.7438391,0.035769477,0.013364575,0.0009949182,0.18298341],"study_design_scores_gemma":[0.000046512978,0.00069877045,0.008599254,0.00018126462,0.0001855747,0.00005938784,0.00060550467,0.9660343,0.013563373,0.007901109,0.002065093,0.00005986447],"about_ca_topic_score_codex":0.006703327,"about_ca_topic_score_gemma":0.0057547903,"teacher_disagreement_score":0.006703327,"about_ca_system_score_codex":0.0010845745,"about_ca_system_score_gemma":0.00071600167,"threshold_uncertainty_score":0.013328612},"labels":[],"label_agreement":null},{"id":"W2104010043","doi":"10.1007/978-3-540-30125-7_15","title":"Hierarchical MCMC Sampling","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scale (ratio); Hierarchical database model; Computational complexity theory; Markov chain Monte Carlo; Ising model; Sampling (signal processing); Range (aeronautics); Algorithm; Key (lock); Gibbs sampling; Theoretical computer science; Artificial intelligence; Data mining; Statistical physics; Bayesian probability; Computer vision","score_opus":0.013031302050908258,"score_gpt":0.24734028912055267,"score_spread":0.23430898706964443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104010043","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.0060912836,0.00057760824,0.98427814,0.00037910673,0.00020870536,0.00016486902,0.00079274,0.0016711905,0.00583635],"genre_scores_gemma":[0.1625704,0.00053987367,0.8050846,0.0006968126,0.0004674597,0.0008643932,0.004821417,0.0012903383,0.023664694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715865,0.0014423168,0.00010223135,0.0006124604,0.00042942277,0.0002548267],"domain_scores_gemma":[0.98729914,0.00835579,0.00032238604,0.002820957,0.0008559681,0.0003457903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048247855,0.0013146482,0.0029225382,0.00214797,0.001992541,0.0029602987,0.005227215,0.003265985,0.029298238],"category_scores_gemma":[0.025028663,0.0022077912,0.002224792,0.0027040294,0.0019665333,0.0024486738,0.00290156,0.0039681178,0.0065944996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038219956,0.00015830164,0.002216195,0.00025899825,0.0002746238,0.00016633086,0.00014932998,0.52785265,0.0009864703,0.2601277,0.029695278,0.17773195],"study_design_scores_gemma":[0.00005732638,0.000013398144,0.00019877033,0.000024191408,0.000028843719,0.000031046122,0.000010434933,0.9099711,0.00034356932,0.08623266,0.003072749,0.00001595509],"about_ca_topic_score_codex":0.012171597,"about_ca_topic_score_gemma":0.02252469,"teacher_disagreement_score":0.029298238,"about_ca_system_score_codex":0.0019574845,"about_ca_system_score_gemma":0.0032577328,"threshold_uncertainty_score":0.09801239},"labels":[],"label_agreement":null},{"id":"W2104071065","doi":"10.1007/978-3-642-28496-0_18","title":"Another Look at Tightness","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Encryption; Computer security; Authentication (law); Scheme (mathematics); Theoretical computer science; Network security; Computer network; Mathematics","score_opus":0.016664275577869016,"score_gpt":0.23279366904240242,"score_spread":0.21612939346453341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104071065","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.009823321,0.026009945,0.14117248,0.028246753,0.004088853,0.000037754733,0.00033920855,0.0005274217,0.7897543],"genre_scores_gemma":[0.4553997,0.026285877,0.059144344,0.02322789,0.011463029,0.00028898072,0.00061903015,0.0039380523,0.4196331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980584,0.0004655117,0.00008622215,0.00051322766,0.0005980273,0.00027859354],"domain_scores_gemma":[0.9967618,0.0014841729,0.00015987862,0.000747031,0.00058997376,0.00025708426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015467441,0.001455643,0.0017940396,0.0031757501,0.0045352057,0.005102323,0.0018671872,0.0019485089,0.04751846],"category_scores_gemma":[0.007892029,0.0010572583,0.001118575,0.0037978622,0.013214724,0.031038761,0.0050785094,0.013352905,0.006672252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009704506,0.00000620758,0.000020278676,0.00003291008,0.0000031261336,0.000009152335,0.00020218726,0.000117053736,0.000101633574,0.9878889,0.0063696573,0.005239133],"study_design_scores_gemma":[0.0000056896147,0.000011761856,0.000054183332,0.00006445257,0.000006477568,0.000037473044,0.00018621517,0.00022849462,0.000101389036,0.9488954,0.050398547,0.000010003113],"about_ca_topic_score_codex":0.00327067,"about_ca_topic_score_gemma":0.0025782282,"teacher_disagreement_score":0.04751846,"about_ca_system_score_codex":0.0037235601,"about_ca_system_score_gemma":0.0010560674,"threshold_uncertainty_score":0.15896511},"labels":[],"label_agreement":null},{"id":"W2104103390","doi":"10.1007/11408079_77","title":"Finding and Analyzing Database User Sessions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Database; World Wide Web; Information retrieval","score_opus":0.02282801602035875,"score_gpt":0.2754174075454001,"score_spread":0.25258939152504134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104103390","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.751363,0.0021930353,0.2171776,0.00046435435,0.00006974272,0.0004014626,0.010458176,0.008454142,0.009418505],"genre_scores_gemma":[0.8833127,0.0007777262,0.09869848,0.00007677983,0.000103903025,0.0001360089,0.008252001,0.00042790713,0.008214469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770916,0.0004532725,0.0001648622,0.0005257028,0.0009198898,0.00022712872],"domain_scores_gemma":[0.99386346,0.0032848248,0.00053627,0.0007933088,0.0010398275,0.00048233976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013231491,0.00054109923,0.0006447425,0.0065502245,0.0007960822,0.0020303666,0.00096367445,0.00056758587,0.0020349931],"category_scores_gemma":[0.007386214,0.00040193577,0.00067823764,0.0038156922,0.00030776716,0.0029901622,0.0011064601,0.0007378261,0.0013982675],"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.0006825148,0.000880051,0.24654472,0.00046253283,0.00022173864,0.0003484887,0.00278802,0.0051847924,0.03864632,0.0050497237,0.014016349,0.68517476],"study_design_scores_gemma":[0.00007336603,0.00091590115,0.2952566,0.0002203765,0.00054367294,0.0029631492,0.007896586,0.5296265,0.0875267,0.022166343,0.052585978,0.00022487417],"about_ca_topic_score_codex":0.004717644,"about_ca_topic_score_gemma":0.008661418,"teacher_disagreement_score":0.0065502245,"about_ca_system_score_codex":0.00051515223,"about_ca_system_score_gemma":0.0010683256,"threshold_uncertainty_score":0.0093804},"labels":[],"label_agreement":null},{"id":"W2104327860","doi":"10.1007/978-3-540-31880-4_53","title":"A Multi-objective Memetic Algorithm for Intelligent Feature Extraction","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Memetic algorithm; Domain (mathematical analysis); Coding (social sciences); Artificial intelligence; Genetic algorithm; Set (abstract data type); Optimization problem; Context (archaeology); Representation (politics); Machine learning; Algorithm; Mathematics","score_opus":0.023686369001430257,"score_gpt":0.2906340616218436,"score_spread":0.2669476926204133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104327860","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.009574392,0.00040533394,0.9864884,0.00011524068,0.00012525612,0.00006984689,0.000024838784,0.00042184498,0.0027749096],"genre_scores_gemma":[0.21550943,0.00027591898,0.77776533,0.00021763801,0.00012285424,0.0004313772,0.000089091736,0.000117726784,0.005470592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.00010941253,0.00002683953,0.00006055689,0.00010596468,0.000036606936],"domain_scores_gemma":[0.99934036,0.00038788465,0.000040519408,0.000057472003,0.00015257021,0.000021101736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013295505,0.0008476631,0.0010763264,0.0010277168,0.000751171,0.0009456555,0.002047175,0.0015997385,0.0027590336],"category_scores_gemma":[0.0019984352,0.0005265905,0.00089301326,0.0010271745,0.0006662307,0.00089830265,0.0010380993,0.00089656503,0.00048999046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017008929,0.00015033549,0.0004222617,0.00015955234,0.00019324753,0.00012353188,0.00012249529,0.6246969,0.008053509,0.0108725885,0.0035456717,0.35148987],"study_design_scores_gemma":[0.000022192211,0.0000411962,0.00006416748,0.000006773362,0.000016034053,0.00003255129,0.000007811914,0.99579996,0.00094798213,0.0023545597,0.00069923786,0.0000074499885],"about_ca_topic_score_codex":0.0017024396,"about_ca_topic_score_gemma":0.0018101033,"teacher_disagreement_score":0.0027590336,"about_ca_system_score_codex":0.0005105201,"about_ca_system_score_gemma":0.00057878863,"threshold_uncertainty_score":0.009229898},"labels":[],"label_agreement":null},{"id":"W2104409964","doi":"10.1007/11527954_18","title":"Search Engines and Web Information Retrieval","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Search engine; Human–computer information retrieval; World Wide Web; Web search engine; Adversarial information retrieval; Web crawler; Metasearch engine; Web intelligence; Cognitive models of information retrieval; Web modeling; Web search query; Web page","score_opus":0.012759789983990123,"score_gpt":0.2401844063563452,"score_spread":0.22742461637235506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104409964","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014053654,0.40468872,0.2275549,0.011165176,0.002569146,0.000121833364,0.0012928245,0.0025317317,0.336022],"genre_scores_gemma":[0.17293034,0.266209,0.10944232,0.0026418357,0.0053572864,0.00023864592,0.0036425549,0.00076632295,0.43877164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949646,0.00013982973,0.000031075957,0.00005465309,0.00023775724,0.00004027173],"domain_scores_gemma":[0.9992379,0.00047881508,0.000050714392,0.0000912819,0.00011670413,0.000024595218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005404024,0.000695779,0.0009540057,0.0027525537,0.0005889761,0.0038973265,0.0009150883,0.0016201239,0.023505265],"category_scores_gemma":[0.003009681,0.00055945705,0.00038278569,0.0072577256,0.0010142298,0.0081011485,0.00085808703,0.001271534,0.010231199],"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.000077620374,0.00007262431,0.000318436,0.00080636295,0.000045415072,0.00015305575,0.00020918065,0.004826873,0.0018433977,0.46714112,0.112020925,0.41248497],"study_design_scores_gemma":[0.000023419958,0.000039065268,0.0005823015,0.00031594458,0.000056621382,0.00067432236,0.00020609258,0.021899967,0.0017348545,0.6378201,0.33661184,0.000035497455],"about_ca_topic_score_codex":0.0022859897,"about_ca_topic_score_gemma":0.0028495926,"teacher_disagreement_score":0.023505265,"about_ca_system_score_codex":0.0008883965,"about_ca_system_score_gemma":0.0006792147,"threshold_uncertainty_score":0.07863295},"labels":[],"label_agreement":null},{"id":"W2104443771","doi":"10.1007/978-3-642-15874-2_17","title":"Appended m-Sequences with Merit Factor Greater than 3.34","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Figure of merit; Sequence (biology); Pseudorandom binary sequence; Binary number; Conjecture; Rotation (mathematics); Legendre polynomials; Fraction (chemistry); Factor (programming language); Mathematics; Combinatorics; Algorithm; Computer science; Arithmetic; Geometry; Mathematical analysis","score_opus":0.016252238362898595,"score_gpt":0.22415227324000536,"score_spread":0.20790003487710676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104443771","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06776297,0.00707013,0.37018073,0.005995574,0.028198818,0.00067125954,0.0073348526,0.0060783653,0.5067074],"genre_scores_gemma":[0.27546445,0.0034117629,0.24135822,0.0026546775,0.0026073875,0.00071631017,0.008442894,0.0019111909,0.46343306],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999522,0.00008418438,0.00005066958,0.00008442799,0.0001544372,0.00010440729],"domain_scores_gemma":[0.99883884,0.00023268076,0.00010090572,0.000312945,0.0003778619,0.00013691687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038537872,0.0008698857,0.00091565744,0.0012063277,0.0012378172,0.0012657878,0.00091195485,0.0016151789,0.074409865],"category_scores_gemma":[0.0037868891,0.00033259887,0.0006158694,0.0010939211,0.0006018718,0.0016225205,0.0017022475,0.0019717717,0.045909073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017974579,0.00017669502,0.0006246331,0.0012849947,0.000057805737,0.0020707713,0.00036231335,0.003367256,0.088071935,0.2901016,0.18254276,0.42954183],"study_design_scores_gemma":[0.000099315206,0.0003658847,0.00077753566,0.00042228898,0.00003927137,0.0026770765,0.00010630506,0.005496929,0.05786287,0.23046997,0.7016012,0.00008131422],"about_ca_topic_score_codex":0.00024242137,"about_ca_topic_score_gemma":0.00036584993,"teacher_disagreement_score":0.074409865,"about_ca_system_score_codex":0.00054676016,"about_ca_system_score_gemma":0.0006308985,"threshold_uncertainty_score":0.2489258},"labels":[],"label_agreement":null},{"id":"W2104451739","doi":"10.1007/978-3-642-38288-8_46","title":"Automatic Argumentation Extraction","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":13,"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":"Queen's University; Queen's University Belfast; Invest Northern Ireland","keywords":"Argumentation theory; Computer science; Process (computing); Artificial intelligence; Decision maker; State (computer science); Natural language processing; Operations research; Epistemology; Programming language; Mathematics","score_opus":0.02097277629048928,"score_gpt":0.26601347832449024,"score_spread":0.24504070203400097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104451739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010748758,0.0017624152,0.86741275,0.0009231283,0.0008230072,0.0007972281,0.009867128,0.027703995,0.07996162],"genre_scores_gemma":[0.115153104,0.0012892807,0.7816637,0.000250082,0.00024908778,0.0005248329,0.03425147,0.002603979,0.06401435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820685,0.00045938353,0.00019169087,0.00039517658,0.00062813284,0.000118731965],"domain_scores_gemma":[0.99813336,0.0007696344,0.00008177404,0.00038997293,0.000574945,0.000050367224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013952226,0.0015785324,0.000997065,0.0042697364,0.0014172939,0.0037170066,0.0015507326,0.0013702831,0.05302913],"category_scores_gemma":[0.0071325903,0.0008056026,0.0018658573,0.0023597337,0.00037780087,0.0038988874,0.0024019307,0.0019286522,0.03812513],"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.00021404427,0.00013932816,0.00057722,0.0006875155,0.000078138415,0.00030211257,0.0002215714,0.002463549,0.013119681,0.027147213,0.07178743,0.8832621],"study_design_scores_gemma":[0.0001387591,0.00014879028,0.002705923,0.00087248645,0.00027468932,0.0021302649,0.0006260829,0.19228242,0.084184915,0.14160119,0.57489246,0.00014194514],"about_ca_topic_score_codex":0.00062068814,"about_ca_topic_score_gemma":0.0010837023,"teacher_disagreement_score":0.05302913,"about_ca_system_score_codex":0.0005978408,"about_ca_system_score_gemma":0.0011294737,"threshold_uncertainty_score":0.17740011},"labels":[],"label_agreement":null},{"id":"W2104639126","doi":"10.1007/978-3-642-03869-3_10","title":"Grouping MPI Processes for Partial Checkpoint and Co-migration","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Manitoba","funders":"","keywords":"Computer science; Process (computing); Node (physics); Process migration; Block (permutation group theory); Distributed computing; Resource (disambiguation); Computer network; Operating system","score_opus":0.019077199212550806,"score_gpt":0.26157027669127225,"score_spread":0.24249307747872145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104639126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01839055,0.00061311503,0.962013,0.00020998229,0.00028285568,0.00017295715,0.00015152263,0.006662938,0.011503167],"genre_scores_gemma":[0.2943673,0.0005481089,0.67767936,0.00009930072,0.00018711253,0.00042207175,0.0007700426,0.0013071576,0.024619533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.00005834755,0.000023744466,0.000049497394,0.00012236991,0.00005984886],"domain_scores_gemma":[0.99920577,0.0001271628,0.00004309904,0.00046570366,0.00011308605,0.000045287616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039808135,0.0006639156,0.000737818,0.0007245502,0.0012244076,0.0007630018,0.0014490369,0.00067581225,0.009151363],"category_scores_gemma":[0.0014941741,0.00039386668,0.000550253,0.0013741938,0.00051366485,0.0008364305,0.0013246433,0.0010334679,0.0032921126],"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.0006225325,0.00023594778,0.0007767464,0.00048337475,0.00006957437,0.00032342272,0.0006855954,0.04902345,0.07806306,0.094766885,0.033665426,0.74128395],"study_design_scores_gemma":[0.00020987906,0.00053416134,0.0024507635,0.00012227167,0.00019348743,0.00076836196,0.0003780858,0.52773184,0.10131244,0.20455086,0.16160585,0.00014200206],"about_ca_topic_score_codex":0.0008880342,"about_ca_topic_score_gemma":0.0015835365,"teacher_disagreement_score":0.009151363,"about_ca_system_score_codex":0.00032455465,"about_ca_system_score_gemma":0.0005505935,"threshold_uncertainty_score":0.030614376},"labels":[],"label_agreement":null},{"id":"W2104648658","doi":"10.1007/978-3-642-38911-5_9","title":"An IMS DSL Developed at Ericsson","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Ericsson (Canada)","funders":"","keywords":"Digital subscriber line; Computer science; Domain-specific language; Scala; Syntax; Readability; Programming language; Domain (mathematical analysis); Abstract syntax; Software engineering; Java; Telecommunications; Artificial intelligence","score_opus":0.01793822780997239,"score_gpt":0.24400254878108243,"score_spread":0.22606432097111004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104648658","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.013669853,0.00030354602,0.5989059,0.0003934729,0.00039655613,0.00042209437,0.015089077,0.25941697,0.11140252],"genre_scores_gemma":[0.1021678,0.0011725934,0.47431338,0.0006314405,0.00021681169,0.0007312202,0.0653944,0.087576054,0.26779628],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933785,0.00012059913,0.00006604891,0.00011456152,0.00030466236,0.000056385146],"domain_scores_gemma":[0.99914443,0.00019931505,0.00003464409,0.00028964598,0.00026906238,0.00006291879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010090647,0.0010959138,0.0006514703,0.0013164561,0.00045260869,0.0022561776,0.0013577234,0.00078301894,0.043912183],"category_scores_gemma":[0.002351864,0.0007000573,0.0005268571,0.00078646065,0.00033777248,0.002592599,0.0011773305,0.0014218768,0.032617364],"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.0009444615,0.00043288092,0.0013342549,0.0008728812,0.000099126315,0.0005335893,0.00084155455,0.013201147,0.06809694,0.115724556,0.26373795,0.5341807],"study_design_scores_gemma":[0.00014649403,0.00009388009,0.0005558396,0.000102180595,0.00006480565,0.00049028965,0.000090912516,0.03619193,0.05895213,0.01289204,0.89035,0.00006938575],"about_ca_topic_score_codex":0.0020410032,"about_ca_topic_score_gemma":0.0018518418,"teacher_disagreement_score":0.043912183,"about_ca_system_score_codex":0.0007377196,"about_ca_system_score_gemma":0.0013615406,"threshold_uncertainty_score":0.14690083},"labels":[],"label_agreement":null},{"id":"W2104662059","doi":"10.1007/978-3-642-21593-3_1","title":"Enhancing Video Denoising Algorithms by Fusion from Multiple Views","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Video denoising; Computer science; Noise reduction; Artificial intelligence; Computer vision; Video tracking; Data compression; Noise (video); Algorithm; Segmentation; Scheme (mathematics); Object (grammar); Multiview Video Coding; Image (mathematics); Mathematics","score_opus":0.032107603947671225,"score_gpt":0.26937515981369553,"score_spread":0.2372675558660243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104662059","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.0037305825,0.00071397383,0.9941801,0.000058812217,0.00007298534,0.0000152322455,0.000026794096,0.00022606473,0.0009754362],"genre_scores_gemma":[0.06852457,0.0024080023,0.9242313,0.00014573126,0.00018851401,0.000038312683,0.00021186247,0.00020602146,0.004045715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994586,0.00008210492,0.00003663767,0.00010004301,0.0002876611,0.00003496511],"domain_scores_gemma":[0.99933016,0.00021836827,0.000059040423,0.000127122,0.00023804799,0.00002724881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095924555,0.0011855524,0.0011131173,0.00105856,0.00021141616,0.0011103447,0.00066106993,0.0013383229,0.0022013036],"category_scores_gemma":[0.0018982495,0.00059811043,0.0010899184,0.0009460633,0.0004283836,0.0017948792,0.0011971685,0.0012997369,0.0015229022],"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.00025289785,0.00007033913,0.0003602464,0.00038160768,0.000182949,0.00014342397,0.000105679195,0.035935964,0.27749735,0.008689946,0.0027441056,0.67363554],"study_design_scores_gemma":[0.000029843784,0.00021507495,0.0009877373,0.000090774505,0.00026630174,0.0012150095,0.000049631628,0.70904046,0.26037583,0.01172645,0.015932776,0.00007018191],"about_ca_topic_score_codex":0.000387338,"about_ca_topic_score_gemma":0.0006593249,"teacher_disagreement_score":0.0022013036,"about_ca_system_score_codex":0.0002234741,"about_ca_system_score_gemma":0.00023070528,"threshold_uncertainty_score":0.0073640347},"labels":[],"label_agreement":null},{"id":"W2104859809","doi":"10.1007/978-3-319-08404-6_9","title":"Competitive Online Routing on Delaunay Triangulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Computer science; Bowyer–Watson algorithm; Combinatorics; Competitive analysis; Pitteway triangulation; Shortest path problem; Algorithm; Graph; Mathematics; Theoretical computer science","score_opus":0.026425287501370364,"score_gpt":0.27531310677312987,"score_spread":0.24888781927175951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104859809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052916184,0.0027118814,0.85501206,0.0013034833,0.00042287825,0.00027567608,0.00076016935,0.001010659,0.08558696],"genre_scores_gemma":[0.35049936,0.0037483503,0.57481647,0.0004706143,0.00057650317,0.0005639536,0.0016289392,0.00086522574,0.066830575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985362,0.00039595424,0.000057822366,0.00024072765,0.00056070485,0.00020856001],"domain_scores_gemma":[0.9973666,0.0014260378,0.00020580966,0.0004728936,0.00031767992,0.0002110213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093933375,0.00130769,0.001976725,0.0015888717,0.0013334462,0.0026585942,0.0038690695,0.0020385163,0.016690783],"category_scores_gemma":[0.0054821908,0.0009212989,0.001002841,0.0031843025,0.0013284184,0.0040901764,0.0034040583,0.002463499,0.003167862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033234,0.00013801915,0.00031654543,0.0005276847,0.0000640905,0.00013513978,0.00017958302,0.27729645,0.004049012,0.50730425,0.03292138,0.17673554],"study_design_scores_gemma":[0.000060090108,0.000094199684,0.0001818193,0.00007070399,0.000024885916,0.00019590797,0.00008508616,0.645568,0.0013671397,0.3318585,0.020467207,0.000026596073],"about_ca_topic_score_codex":0.0028523214,"about_ca_topic_score_gemma":0.003820253,"teacher_disagreement_score":0.016690783,"about_ca_system_score_codex":0.0021259887,"about_ca_system_score_gemma":0.0009639206,"threshold_uncertainty_score":0.05583626},"labels":[],"label_agreement":null},{"id":"W2104895830","doi":"10.1007/978-3-642-21593-3_8","title":"Wavelet Domain Blur Invariants for 1D Discrete Signals","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Windsor","funders":"","keywords":"Wavelet; Computer science; Property (philosophy); Domain (mathematical analysis); Range (aeronautics); Discrete wavelet transform; Algorithm; Artificial intelligence; Energy (signal processing); Computer vision; Wavelet transform; Mathematics; Mathematical analysis","score_opus":0.03460395177834962,"score_gpt":0.27815485897740266,"score_spread":0.24355090719905303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104895830","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.018730141,0.0022397223,0.97341365,0.0001201565,0.0002258909,0.000020581836,0.00012817702,0.0005234859,0.004598196],"genre_scores_gemma":[0.3761573,0.0068289107,0.59490275,0.00016123807,0.00064703275,0.000055495777,0.00079272897,0.00068963406,0.019764839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997892,0.000026924075,0.000012692562,0.000039431536,0.00010641307,0.000025394507],"domain_scores_gemma":[0.99959546,0.00011239727,0.00007515709,0.000089830384,0.00009588073,0.000031219246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039181852,0.00059132976,0.0005516662,0.0017016667,0.00016217705,0.0010917464,0.00046561254,0.0004453479,0.0028917333],"category_scores_gemma":[0.0012557099,0.00023979018,0.0005427827,0.0011603549,0.0006816783,0.0015210971,0.00066184567,0.0010022885,0.0009643776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019664415,0.00006351211,0.00055180263,0.00042926546,0.000044715944,0.00018232632,0.00022007409,0.025466982,0.11623705,0.20533213,0.006984991,0.6442905],"study_design_scores_gemma":[0.000025018093,0.00038635224,0.0050109103,0.0001137314,0.000099325516,0.00228138,0.00020275298,0.6075077,0.12330728,0.20107153,0.059829764,0.00016425998],"about_ca_topic_score_codex":0.00020916869,"about_ca_topic_score_gemma":0.00026764916,"teacher_disagreement_score":0.0028917333,"about_ca_system_score_codex":0.00031017253,"about_ca_system_score_gemma":0.0001993009,"threshold_uncertainty_score":0.009673774},"labels":[],"label_agreement":null},{"id":"W2104978289","doi":"10.1007/978-3-642-02611-9_90","title":"Registration of the Prokudin-Gorskii Colour Photographs Using a Multiresolution SSIM Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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 Guelph","funders":"","keywords":"Computer science; Photography; Computer vision; Artificial intelligence; Frame (networking); Similarity (geometry); Computer graphics (images); Resolution (logic); Index (typography); Algorithm; Image (mathematics); Art; Visual arts; Telecommunications","score_opus":0.02796457951153011,"score_gpt":0.2806506785717003,"score_spread":0.2526860990601702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104978289","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.028066384,0.0003644415,0.9638772,0.00015999918,0.00010354825,0.00010697051,0.00021926852,0.0011554105,0.005946744],"genre_scores_gemma":[0.12649769,0.00091590086,0.8644473,0.000049068673,0.000053936332,0.000077818826,0.00044064666,0.0006993723,0.00681828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996799,0.000044724817,0.000022696971,0.00006430431,0.00016103385,0.000027432448],"domain_scores_gemma":[0.9995989,0.00006700641,0.00004724486,0.00014827496,0.00011529739,0.000023260402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048967643,0.000546787,0.00057873566,0.0022026866,0.00031512248,0.0018029732,0.0006305772,0.0006481669,0.005179968],"category_scores_gemma":[0.0013837551,0.0005248459,0.0005885044,0.0017862882,0.00040742708,0.0014803375,0.0007886006,0.0010182123,0.002893663],"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.0003758798,0.00007842811,0.0010669966,0.00051633624,0.00007672743,0.0003364292,0.00030056367,0.016980043,0.31895554,0.018586926,0.004424892,0.6383012],"study_design_scores_gemma":[0.000059428283,0.00030714553,0.013044191,0.0001406852,0.00023516384,0.0044806385,0.0003931191,0.3650883,0.5210136,0.017401218,0.07760172,0.00023482273],"about_ca_topic_score_codex":0.0006653719,"about_ca_topic_score_gemma":0.0010554197,"teacher_disagreement_score":0.005179968,"about_ca_system_score_codex":0.0003536238,"about_ca_system_score_gemma":0.00065584347,"threshold_uncertainty_score":0.01732874},"labels":[],"label_agreement":null},{"id":"W2105215219","doi":"10.1007/978-3-642-14785-2_9","title":"Towards Modeling Realistic Mobility for Performance Evaluations in MANET","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Mobile ad hoc network; TRACE (psycholinguistics); Mobility model; Credibility; Field (mathematics); Software; Distributed computing; Modeling and simulation; Vehicular ad hoc network; Interpretation (philosophy); Wireless ad hoc network; Isolation (microbiology); Simulation; Computer network; Telecommunications; Wireless","score_opus":0.03356952027849705,"score_gpt":0.2913661998675793,"score_spread":0.25779667958908226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105215219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03175756,0.0010336412,0.959144,0.00046781037,0.00015227462,0.00015872064,0.00041163267,0.0008746569,0.0059997537],"genre_scores_gemma":[0.7113886,0.0023952874,0.27808917,0.00026914582,0.00021405239,0.00044173875,0.0009935435,0.00046951056,0.005738996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989851,0.0005114088,0.000054040753,0.00008278938,0.00028753496,0.000079120626],"domain_scores_gemma":[0.99729127,0.001730238,0.00017084327,0.00025583734,0.00047569975,0.00007615668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017542179,0.0011109593,0.0011821525,0.000750491,0.00051744824,0.0015425112,0.0024208226,0.0014563646,0.0017502267],"category_scores_gemma":[0.0077291094,0.0007005258,0.00061583304,0.0010596965,0.00046872802,0.0022132231,0.00091226946,0.0013012295,0.0007143275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020937434,0.000030509227,0.00016240976,0.000037171307,0.00001163457,0.000020417085,0.000020557056,0.98816746,0.00066360505,0.004066198,0.0004700119,0.0063290945],"study_design_scores_gemma":[0.0000019955492,0.000009384863,0.000024098195,0.0000042641077,0.0000033082654,0.000007920547,0.000004526997,0.99785346,0.00017835287,0.0016173959,0.00029328789,0.0000019895408],"about_ca_topic_score_codex":0.0063618184,"about_ca_topic_score_gemma":0.004205026,"teacher_disagreement_score":0.0063618184,"about_ca_system_score_codex":0.0010843679,"about_ca_system_score_gemma":0.0008423569,"threshold_uncertainty_score":0.012649536},"labels":[],"label_agreement":null},{"id":"W2105217716","doi":"10.1007/978-3-642-23211-4_10","title":"Approximate Bit Vectors for Fast Unification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Toronto; University of Manitoba","funders":"","keywords":"Unification; Bit (key); Computer science; Bit array; Algorithm; Parsing; Theoretical computer science; Artificial intelligence; Programming language; Type (biology)","score_opus":0.022249397841903044,"score_gpt":0.23346618057427146,"score_spread":0.2112167827323684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105217716","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.020350413,0.002107121,0.9561233,0.00056434673,0.00055123813,0.00014657373,0.0008628545,0.006830345,0.0124637885],"genre_scores_gemma":[0.2856481,0.0016870967,0.6806455,0.0005754097,0.00045559954,0.0007600132,0.0027734083,0.002113011,0.025341827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723417,0.00075263216,0.00027827112,0.00041383997,0.0010133734,0.00030780895],"domain_scores_gemma":[0.995375,0.0018487485,0.00015937537,0.0020011156,0.00051908835,0.00009664226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018501705,0.0012128102,0.0017922941,0.0020422244,0.0013175482,0.0031043123,0.0023812752,0.0015234142,0.022390557],"category_scores_gemma":[0.008968299,0.0010180934,0.0011941708,0.0041106087,0.001585331,0.009612258,0.004295008,0.0029496427,0.0070264754],"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.00066866,0.00011012301,0.00036193756,0.00034992216,0.000067193825,0.00006868005,0.00021207999,0.020337053,0.005266442,0.41325113,0.020210233,0.53909653],"study_design_scores_gemma":[0.00005515767,0.00006429309,0.00011564879,0.000087024484,0.000045679066,0.000080927435,0.00007187278,0.12753206,0.0076287207,0.8478738,0.016402079,0.000042757016],"about_ca_topic_score_codex":0.001397088,"about_ca_topic_score_gemma":0.0021190122,"teacher_disagreement_score":0.022390557,"about_ca_system_score_codex":0.0013852793,"about_ca_system_score_gemma":0.0014094885,"threshold_uncertainty_score":0.074903846},"labels":[],"label_agreement":null},{"id":"W2105244911","doi":"10.1007/978-3-642-13772-3_5","title":"Denoising of Three Dimensional Data Cube Using Bivariate Wavelet Shrinking","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Concordia University","funders":"","keywords":"Wavelet; Noise reduction; Thresholding; Computer science; Bivariate analysis; Artificial intelligence; Video denoising; Pattern recognition (psychology); Data cube; White noise; Step detection; Additive white Gaussian noise; Computer vision; Cube (algebra); Noise (video); Non-local means; Wavelet transform; Image (mathematics); Image denoising; Mathematics; Data mining; Video processing; Machine learning; Telecommunications","score_opus":0.06432663772056893,"score_gpt":0.30206173006448067,"score_spread":0.23773509234391174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105244911","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.015773369,0.00020733473,0.98265,0.000076104094,0.000043618795,0.000009865385,0.000050248465,0.00015341127,0.0010360343],"genre_scores_gemma":[0.24472417,0.0019548908,0.747733,0.00013077368,0.000115013594,0.00007772315,0.00045101525,0.00023112986,0.004582335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977225,0.000042248714,0.000015561804,0.0000377984,0.00011092281,0.000021099906],"domain_scores_gemma":[0.99949276,0.00018884371,0.00004058809,0.00011400844,0.00014062908,0.000023091663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005355584,0.00046934435,0.0007642738,0.0005757885,0.00019556166,0.0007974553,0.00047430102,0.00052262645,0.0012405869],"category_scores_gemma":[0.0013870457,0.0002592707,0.00075821293,0.0010476904,0.0005580048,0.0007041959,0.0010324937,0.0010343589,0.00042736903],"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.00032274137,0.00008060559,0.0011476984,0.0004305318,0.00012309724,0.00041369422,0.0004746521,0.22604524,0.25328737,0.071337655,0.005155809,0.44118088],"study_design_scores_gemma":[0.000008395224,0.00004514957,0.00077542604,0.000020950414,0.00003029765,0.00024421504,0.000052963795,0.9464935,0.03325128,0.014596597,0.0044574416,0.000023758954],"about_ca_topic_score_codex":0.00058529834,"about_ca_topic_score_gemma":0.0005313848,"teacher_disagreement_score":0.0012405869,"about_ca_system_score_codex":0.00020042753,"about_ca_system_score_gemma":0.0003413341,"threshold_uncertainty_score":0.004150152},"labels":[],"label_agreement":null},{"id":"W2105283873","doi":"10.1007/978-3-540-30076-2_13","title":"A Partial Pre-aggregation Scheme for HOLAP Engines","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Aggregate (composite); Overhead (engineering); Scheme (mathematics); Online aggregation; Cube (algebra); Greedy algorithm; Algorithm; Theoretical computer science; Search engine; Information retrieval; Web search query; Sargable; Mathematics; Programming language","score_opus":0.017649390009643866,"score_gpt":0.24943202107536577,"score_spread":0.23178263106572192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105283873","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.027332101,0.00047223608,0.9481598,0.00033039277,0.00026620997,0.00030067546,0.0008549842,0.010301966,0.011981661],"genre_scores_gemma":[0.3108224,0.00038598065,0.65856606,0.00024674565,0.00023440477,0.00034381662,0.0020043843,0.0014894545,0.025906801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798006,0.00030354413,0.00036874603,0.00025675906,0.000763016,0.00032782037],"domain_scores_gemma":[0.9943334,0.00055180205,0.00017863943,0.004139297,0.00057807274,0.00021883562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032490056,0.00066976075,0.0012512691,0.0013190454,0.0020808568,0.004830327,0.0028544758,0.0010510049,0.010825646],"category_scores_gemma":[0.0038877733,0.0009834765,0.0010473387,0.0023628406,0.0013446918,0.0075665456,0.0047373087,0.0022344496,0.0030571392],"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.0013249519,0.00028114454,0.0017836746,0.0005625163,0.00011751063,0.00025626007,0.0008680144,0.018187286,0.018201966,0.48487988,0.02287078,0.45066607],"study_design_scores_gemma":[0.00023788527,0.00049290736,0.0013449583,0.00018022384,0.00032945024,0.0005823314,0.0004562458,0.25705507,0.06413532,0.55084455,0.12411658,0.00022456724],"about_ca_topic_score_codex":0.001530474,"about_ca_topic_score_gemma":0.0025258667,"teacher_disagreement_score":0.010825646,"about_ca_system_score_codex":0.0011695215,"about_ca_system_score_gemma":0.0019307524,"threshold_uncertainty_score":0.036215365},"labels":[],"label_agreement":null},{"id":"W2105401484","doi":"10.1007/11682462_12","title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Voronoi diagram; Pointer (user interface); Data structure; Time complexity; Combinatorics; Point location; Computer science; Line segment; Computational geometry; Binary logarithm; Algorithm; Mathematics; Point (geometry); Discrete mathematics; Geometry","score_opus":0.029638551381710336,"score_gpt":0.2644702082896593,"score_spread":0.23483165690794894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105401484","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.018920211,0.001781635,0.9342333,0.0009425819,0.00026856703,0.00042209701,0.015479069,0.019633688,0.0083187325],"genre_scores_gemma":[0.22992074,0.0019931768,0.7000238,0.00058208016,0.00029969576,0.0014708018,0.048418626,0.0052273506,0.012063795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997138,0.0002607161,0.00052185776,0.00045067494,0.0013620734,0.00026670084],"domain_scores_gemma":[0.98978746,0.0031154903,0.0005832256,0.0047447733,0.0014611816,0.0003077962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015764448,0.00137277,0.0030942294,0.0033105623,0.001667872,0.006355769,0.0045878952,0.0021008165,0.02068288],"category_scores_gemma":[0.017055986,0.0015378344,0.0016368827,0.008811201,0.001292213,0.013437986,0.0064662984,0.0028835395,0.0073971855],"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.0012758363,0.00035129493,0.0029000829,0.0013993337,0.00013423857,0.00027445404,0.0011207606,0.028948192,0.010881951,0.28310946,0.1145527,0.5550518],"study_design_scores_gemma":[0.00048967963,0.0002322784,0.0011354164,0.00034889972,0.00014318453,0.0007956271,0.0008729292,0.23576109,0.03230151,0.5614808,0.1662482,0.00019032645],"about_ca_topic_score_codex":0.0027729562,"about_ca_topic_score_gemma":0.0042711394,"teacher_disagreement_score":0.02068288,"about_ca_system_score_codex":0.0020831611,"about_ca_system_score_gemma":0.0018805759,"threshold_uncertainty_score":0.0691911},"labels":[],"label_agreement":null},{"id":"W2105494211","doi":"10.1007/978-3-642-22450-8_15","title":"Improved Access Control Mechanism in Vehicular Ad Hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Access control; Computer science; Encryption; Computer network; Vehicular ad hoc network; Wireless ad hoc network; Scheme (mathematics); Control (management); Access time; Computer security; Telecommunications; Wireless; Artificial intelligence; Computer hardware","score_opus":0.01468769262553094,"score_gpt":0.23222651974793454,"score_spread":0.2175388271224036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105494211","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.043173254,0.0061776484,0.9387747,0.0003649393,0.0007271919,0.00011046645,0.00006911587,0.0014171388,0.009185513],"genre_scores_gemma":[0.88235044,0.0021559054,0.10325095,0.00013075845,0.0003629859,0.00010077218,0.00014868639,0.00007506442,0.01142449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982358,0.00046560625,0.00011535966,0.00019647944,0.00074535055,0.000241327],"domain_scores_gemma":[0.99849355,0.00047857547,0.00009446966,0.00044576818,0.0004301929,0.000057429108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064688,0.0004945952,0.00081038766,0.00097195426,0.0005671119,0.0014072908,0.002176172,0.00086884614,0.0016437827],"category_scores_gemma":[0.0024378817,0.0002591716,0.00037547993,0.001008443,0.0007777616,0.0021711881,0.0011244612,0.0012243796,0.00045385907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005835886,0.00024031654,0.0008600749,0.00040787022,0.00011024875,0.0003942168,0.00030850677,0.12245419,0.07478552,0.40063345,0.007803867,0.3914182],"study_design_scores_gemma":[0.0000825268,0.00039603913,0.00086005474,0.00005636992,0.00013616469,0.0008724268,0.000097618315,0.8527148,0.026911326,0.08606115,0.03170791,0.00010364574],"about_ca_topic_score_codex":0.0008651171,"about_ca_topic_score_gemma":0.00064161356,"teacher_disagreement_score":0.002176172,"about_ca_system_score_codex":0.0006906323,"about_ca_system_score_gemma":0.0006135435,"threshold_uncertainty_score":0.0074382424},"labels":[],"label_agreement":null},{"id":"W2105568982","doi":"10.1007/3-540-44503-x_3","title":"Scalar Aggregation in FD-Inconsistent Databases","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalar (mathematics); Graph database; Graph; Set (abstract data type); Theoretical computer science; Database; Database query; Database theory; Characterization (materials science); Relational database; Mathematics; Programming language","score_opus":0.024882359239949733,"score_gpt":0.2599877209056143,"score_spread":0.23510536166566454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105568982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0332853,0.001947098,0.95472175,0.00053623534,0.0001668932,0.00006269779,0.0002356576,0.0015891569,0.007455161],"genre_scores_gemma":[0.43987772,0.00180521,0.54572034,0.00021514982,0.00031259054,0.000093881215,0.0007864515,0.00033216874,0.010856628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977621,0.0005435102,0.000323804,0.00028563946,0.00090014294,0.00018483734],"domain_scores_gemma":[0.99605787,0.0017202358,0.00028737017,0.0013099307,0.00054098887,0.000083637475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00396594,0.0004011,0.0010199988,0.0011991668,0.00108184,0.0029088503,0.0016466798,0.000731602,0.0032368076],"category_scores_gemma":[0.008653294,0.00078398286,0.00067830813,0.004043103,0.0012592509,0.005882092,0.0018264427,0.001389823,0.0004997165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052400946,0.000102438615,0.0026675665,0.0005379047,0.00006298259,0.0005130797,0.0007934288,0.032118212,0.0047578723,0.6790121,0.0129864365,0.2659239],"study_design_scores_gemma":[0.00007357388,0.00008955098,0.0007478865,0.000079998994,0.00011263778,0.0007818008,0.0002631274,0.24789304,0.008639098,0.716328,0.024944128,0.0000471229],"about_ca_topic_score_codex":0.0014624365,"about_ca_topic_score_gemma":0.001442596,"teacher_disagreement_score":0.00396594,"about_ca_system_score_codex":0.0009681494,"about_ca_system_score_gemma":0.0008277549,"threshold_uncertainty_score":0.02097416},"labels":[],"label_agreement":null},{"id":"W2105659243","doi":"10.1007/978-3-642-31594-7_13","title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Submodular set function; Set function; Rank (graph theory); Maximization; Matroid partitioning; Combinatorics; Function (biology); Set (abstract data type); Weighted matroid; Computer science; Mathematics; Online algorithm; Competitive analysis; Constraint (computer-aided design); Discrete mathematics; Mathematical optimization; Algorithm; Graphic matroid; Upper and lower bounds","score_opus":0.03343926846114101,"score_gpt":0.2580674556177863,"score_spread":0.22462818715664531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105659243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006215808,0.00088190485,0.98643523,0.0005223479,0.0001269304,0.00015428667,0.00036577354,0.0013801254,0.003917536],"genre_scores_gemma":[0.13149361,0.0010664045,0.8538486,0.0004930315,0.00049970276,0.000849307,0.0018165774,0.0010160746,0.008916714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962303,0.0012543396,0.00019738189,0.00081314234,0.00094782305,0.0005569709],"domain_scores_gemma":[0.9905003,0.006199713,0.0006046208,0.0014750719,0.00082923117,0.00039099492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045541786,0.0039600786,0.004905268,0.0023201008,0.0011836591,0.005233541,0.008278825,0.0049912957,0.015374376],"category_scores_gemma":[0.019342806,0.0022743228,0.0025079015,0.00685256,0.0019739002,0.010119998,0.004689083,0.006991198,0.0051610894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007068914,0.000826979,0.0008046953,0.0007453164,0.00019650286,0.00013349146,0.00024771012,0.52496135,0.0019971216,0.09199373,0.030819,0.34656727],"study_design_scores_gemma":[0.00008350495,0.000040395997,0.00007334503,0.000028896626,0.000029941784,0.00004967489,0.000033830198,0.93543607,0.0004257323,0.0626828,0.0011011219,0.000014701793],"about_ca_topic_score_codex":0.004987705,"about_ca_topic_score_gemma":0.007784719,"teacher_disagreement_score":0.015374376,"about_ca_system_score_codex":0.0036687704,"about_ca_system_score_gemma":0.0036204997,"threshold_uncertainty_score":0.05143237},"labels":[],"label_agreement":null},{"id":"W2105687001","doi":"10.1007/978-3-642-13731-0_1","title":"Optimal Exploration of Terrains with Obstacles","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Terrain; Computer science; Point (geometry); Artificial intelligence; Computer vision; Mobile robot; Robot; Convex hull; Trajectory; Regular polygon; Algorithm; Mathematics; Geography; Geometry; Cartography","score_opus":0.02995620708004124,"score_gpt":0.2577156093518895,"score_spread":0.22775940227184824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105687001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098464765,0.004655363,0.8507987,0.00043975387,0.00014976304,0.000050057813,0.00034444037,0.00049233047,0.044604886],"genre_scores_gemma":[0.70285386,0.0035546515,0.2703494,0.000090329486,0.000106267595,0.00010561091,0.00058244256,0.00029429255,0.022063162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987197,0.00002476216,0.0000051821858,0.000020663216,0.00005319281,0.000024269326],"domain_scores_gemma":[0.99985564,0.00009094519,0.000010282964,0.000014914255,0.000014603558,0.000013568815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001511892,0.0005766994,0.0007535891,0.00044780306,0.00029555953,0.00072820066,0.000771581,0.00060063426,0.0028094212],"category_scores_gemma":[0.0009021874,0.00043123995,0.0004721417,0.00066424,0.0005166006,0.0010018784,0.0012166835,0.000619456,0.00033458945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016018105,0.000042362997,0.00036644383,0.00026418007,0.00004141798,0.00011448563,0.00013220629,0.8325943,0.006728562,0.0509998,0.00509284,0.103463255],"study_design_scores_gemma":[0.000027170086,0.000047907015,0.00021725366,0.000035068548,0.000009998729,0.00010052871,0.000041831932,0.92699414,0.0014544098,0.06551694,0.0055421744,0.000012575829],"about_ca_topic_score_codex":0.0015392262,"about_ca_topic_score_gemma":0.0017953311,"teacher_disagreement_score":0.0028094212,"about_ca_system_score_codex":0.0002776048,"about_ca_system_score_gemma":0.00039205674,"threshold_uncertainty_score":0.00939852},"labels":[],"label_agreement":null},{"id":"W2105817301","doi":"10.1007/978-3-642-23629-7_43","title":"Vertex-Wise Shape Analysis of the Hippocampus: Disentangling Positional Differences from Volume Changes","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Craniofacial Disorders and Treatments","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Spherical harmonics; Shape analysis (program analysis); Point distribution model; Iterative closest point; Computer vision; Mathematics; Mathematical analysis; Point cloud","score_opus":0.013010973341329835,"score_gpt":0.23042995268257968,"score_spread":0.21741897934124985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105817301","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.86726594,0.0016198416,0.12648734,0.00029238063,0.00006711611,0.00004295562,0.0013467575,0.0007659424,0.0021117392],"genre_scores_gemma":[0.96056306,0.0008593363,0.036654457,0.000046915637,0.00003771655,0.000017868153,0.0006966651,0.0003238762,0.00080005813],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99987566,0.000022563367,0.0000076220567,0.000025410756,0.00004389869,0.00002483931],"domain_scores_gemma":[0.99942446,0.00019954973,0.00009263257,0.00008529717,0.0001422598,0.00005571978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036331688,0.000370859,0.00040857578,0.0016774756,0.0002517231,0.0009793848,0.0003807719,0.00037282266,0.0009830854],"category_scores_gemma":[0.001920363,0.00023134227,0.00047900013,0.0014510681,0.00026164844,0.0004577357,0.0004416081,0.0003773139,0.00041420397],"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.0018978534,0.00007665437,0.06399306,0.0003216814,0.00052339764,0.00041737652,0.00040944287,0.018077506,0.49899083,0.0015306739,0.0020911759,0.4116704],"study_design_scores_gemma":[0.00009577578,0.0005393866,0.41815382,0.000076777964,0.00091623905,0.0052365744,0.0013286218,0.33109096,0.22648801,0.010489023,0.0053782915,0.00020652678],"about_ca_topic_score_codex":0.0040715258,"about_ca_topic_score_gemma":0.009275831,"teacher_disagreement_score":0.0040715258,"about_ca_system_score_codex":0.00016739922,"about_ca_system_score_gemma":0.00066449004,"threshold_uncertainty_score":0.008095682},"labels":[],"label_agreement":null},{"id":"W2105986440","doi":"10.1007/11590316_78","title":"Applications of the Discrete Hodge Helmholtz Decomposition to Image and Video Processing","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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 Alberta","funders":"","keywords":"Artificial intelligence; Computer vision; Computer science; Orientation (vector space); Image processing; Field (mathematics); Noise (video); Pattern recognition (psychology); Image (mathematics); Mathematics; Geometry","score_opus":0.006429905138181798,"score_gpt":0.2621638983224486,"score_spread":0.25573399318426676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105986440","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.004400005,0.003221963,0.9843758,0.00018308485,0.00015841152,0.000012545858,0.000040724633,0.00019484932,0.0074127237],"genre_scores_gemma":[0.19425395,0.010396682,0.76949286,0.00019556172,0.00058007496,0.000043518565,0.00022160556,0.00026676717,0.024548907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981374,0.000052450243,0.000010612801,0.00002359343,0.00008286738,0.000016744914],"domain_scores_gemma":[0.9997533,0.000107954445,0.000017073186,0.00003818831,0.00005901441,0.00002453594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030765007,0.0005856044,0.00062029104,0.0011988945,0.0002142245,0.0009493469,0.00033261886,0.00042054654,0.003296921],"category_scores_gemma":[0.0010359999,0.00033386168,0.00049392105,0.0015448543,0.0006370398,0.00072682067,0.00094241754,0.0009432795,0.00080731855],"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.0001026261,0.000048703318,0.00029684353,0.0003004628,0.000065901186,0.0001442912,0.00017133598,0.06976278,0.02737642,0.3769963,0.007868812,0.5168655],"study_design_scores_gemma":[0.000014709564,0.0000409303,0.00066230993,0.000044530843,0.000020366895,0.00040789455,0.00006214239,0.5768274,0.009193598,0.38434824,0.028341644,0.000036240763],"about_ca_topic_score_codex":0.0006448077,"about_ca_topic_score_gemma":0.0008358179,"teacher_disagreement_score":0.003296921,"about_ca_system_score_codex":0.00028262465,"about_ca_system_score_gemma":0.00028725804,"threshold_uncertainty_score":0.0110292435},"labels":[],"label_agreement":null},{"id":"W2106128382","doi":"10.1007/11422778_129","title":"SWATCH: A StepWise AdapTive Clustering Hierarchy in Wireless Sensor Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Queen's University","funders":"","keywords":"Computer science; Cluster analysis; Wireless sensor network; Hierarchy; Markov chain; Scheme (mathematics); Adaptation (eye); Distributed computing; Hierarchical clustering; Computer network; Artificial intelligence; Machine learning; Mathematics","score_opus":0.015855727046031103,"score_gpt":0.22531733202182475,"score_spread":0.20946160497579364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106128382","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.006241732,0.00022044638,0.99025273,0.0000856979,0.000058964728,0.000110320936,0.00010442905,0.0018521415,0.001073501],"genre_scores_gemma":[0.09715419,0.00035597387,0.89631695,0.00014879585,0.00005756852,0.00031161198,0.00063239527,0.0005477092,0.0044747787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918276,0.00022894671,0.000058116068,0.00012376336,0.00032800072,0.00007830433],"domain_scores_gemma":[0.99877316,0.00041654712,0.00009225343,0.00032392849,0.00028191507,0.000112159774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012525271,0.0008527584,0.0012105458,0.0010360862,0.00086141686,0.00083158404,0.003476717,0.00079880754,0.0038487564],"category_scores_gemma":[0.0034087996,0.0006733978,0.0009270024,0.001652052,0.00058175414,0.0015707009,0.0026047954,0.0013422825,0.0013918219],"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.0003836581,0.0002217475,0.0010336402,0.000507603,0.00019476782,0.00016103267,0.00033656423,0.37147647,0.017786123,0.0292989,0.017598594,0.56100094],"study_design_scores_gemma":[0.00005531885,0.00013138846,0.00025537037,0.000024031946,0.00005098302,0.00009166264,0.000050770068,0.9676614,0.0050581833,0.020213485,0.0063816113,0.000025921292],"about_ca_topic_score_codex":0.00460025,"about_ca_topic_score_gemma":0.0083573945,"teacher_disagreement_score":0.00460025,"about_ca_system_score_codex":0.0006492578,"about_ca_system_score_gemma":0.0014737134,"threshold_uncertainty_score":0.012875378},"labels":[],"label_agreement":null},{"id":"W2106226474","doi":"10.1007/978-3-642-31866-5_19","title":"Blunder Cost in Go and Hex","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Tournament; Computer science; Point (geometry); Fixed point; Mathematical economics; Operations research; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.037397928329448805,"score_gpt":0.2816853625290097,"score_spread":0.24428743419956092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106226474","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.04474459,0.0035338267,0.1320581,0.0052511594,0.00077356945,0.000053791948,0.00039357637,0.00044023432,0.8127512],"genre_scores_gemma":[0.66479963,0.0021802646,0.031845905,0.00080796913,0.00030564214,0.00009196237,0.00027063573,0.00060603,0.29909185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00011320578,0.000016610831,0.00008371634,0.0002233217,0.00013676754],"domain_scores_gemma":[0.999134,0.000421431,0.000043865042,0.0001949036,0.00012617881,0.00007975366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072259,0.0006193288,0.0008055473,0.0009507422,0.0011210184,0.0025382242,0.0012358757,0.0013864236,0.04796218],"category_scores_gemma":[0.004617471,0.0002627659,0.00050634146,0.0012825411,0.0022529305,0.004255007,0.0017416626,0.00198208,0.003988571],"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.000038665505,0.0000077496525,0.00008006828,0.000022660583,0.000003306061,0.000022306689,0.000042631546,0.0023525993,0.0001167045,0.97471875,0.0040851436,0.018509371],"study_design_scores_gemma":[0.000007531261,0.000017220593,0.00026915435,0.000053584852,0.000008451835,0.00010459426,0.00009832105,0.007299754,0.00029835285,0.9660769,0.025754856,0.000011283529],"about_ca_topic_score_codex":0.0048434143,"about_ca_topic_score_gemma":0.005359777,"teacher_disagreement_score":0.04796218,"about_ca_system_score_codex":0.0021362323,"about_ca_system_score_gemma":0.0008330204,"threshold_uncertainty_score":0.1604495},"labels":[],"label_agreement":null},{"id":"W2106378227","doi":"10.1007/3-540-45071-8_45","title":"On Constrained Minimum Pseudotriangulations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Memorial University of Newfoundland","funders":"","keywords":"Triangulation; Minimum-weight triangulation; Combinatorics; Computer science; Set (abstract data type); Line (geometry); Algorithm; Mathematics; Discrete mathematics; Delaunay triangulation; Constrained Delaunay triangulation; Geometry","score_opus":0.01779878287417115,"score_gpt":0.24986154309309805,"score_spread":0.2320627602189269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106378227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039243415,0.0012690359,0.877453,0.0006876774,0.00036482868,0.00016916571,0.00049485185,0.0003614509,0.07995662],"genre_scores_gemma":[0.37691545,0.003514693,0.5402483,0.0007288664,0.00035794056,0.00081681414,0.0017436299,0.0016688175,0.07400554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996092,0.00012567965,0.000016243517,0.000061208164,0.00014890764,0.00003880182],"domain_scores_gemma":[0.99907947,0.0005953698,0.00006569096,0.00012352993,0.0000929296,0.000042962078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004545336,0.0011840459,0.0011325425,0.0012518764,0.00075749896,0.0012341182,0.0017392997,0.0013350613,0.025706895],"category_scores_gemma":[0.0043389527,0.0007847232,0.0006110988,0.0018490182,0.0011253393,0.0025287468,0.003122455,0.002274392,0.0021167235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015052964,0.000075848584,0.00019846771,0.00032232006,0.00002416414,0.00011032031,0.00015357838,0.16882205,0.00309707,0.64109904,0.015661126,0.17028554],"study_design_scores_gemma":[0.00003996733,0.00005544053,0.00015285639,0.000115304385,0.000010306854,0.00013137769,0.00007385063,0.32258156,0.0012607995,0.6607523,0.014805266,0.000020957337],"about_ca_topic_score_codex":0.00094418315,"about_ca_topic_score_gemma":0.0012069455,"teacher_disagreement_score":0.025706895,"about_ca_system_score_codex":0.00054179574,"about_ca_system_score_gemma":0.00040671864,"threshold_uncertainty_score":0.08599812},"labels":[],"label_agreement":null},{"id":"W2106629558","doi":"10.1007/11795018_24","title":"A Model for Interactive Web Information Retrieval","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Regina","funders":"","keywords":"Computer science; Information retrieval; World Wide Web; Search engine; Web page; Web search engine; Web navigation; Human–computer information retrieval; Visualization; Data mining","score_opus":0.018116103017700103,"score_gpt":0.2503018270429477,"score_spread":0.23218572402524756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106629558","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.0071663377,0.00036165706,0.9764133,0.0007368192,0.000076059805,0.00012326373,0.00059133704,0.0017974295,0.01273388],"genre_scores_gemma":[0.40869123,0.0012535666,0.5338006,0.000739823,0.00032733192,0.001099536,0.002218102,0.0010810909,0.05078875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985598,0.00042084392,0.000099586054,0.00029877684,0.00043974599,0.00018125362],"domain_scores_gemma":[0.9975114,0.0013967471,0.00011009803,0.00047292124,0.00038328543,0.00012556993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016319606,0.0008059012,0.0010376475,0.0017179562,0.0011664912,0.003857604,0.0036813866,0.002787363,0.018767413],"category_scores_gemma":[0.007878149,0.0007189929,0.0017060798,0.002133517,0.001464621,0.007939718,0.0020765935,0.0020418998,0.00604468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029830405,0.00022604913,0.0008478431,0.00025314372,0.000086381006,0.0003976595,0.0007198867,0.1316527,0.0036721835,0.7617604,0.014969989,0.08511553],"study_design_scores_gemma":[0.00004282723,0.00004519645,0.000107987245,0.000023891063,0.000050013696,0.00016858258,0.00005312995,0.68226594,0.00087430637,0.30651602,0.009824927,0.000027088236],"about_ca_topic_score_codex":0.0075196535,"about_ca_topic_score_gemma":0.0051622307,"teacher_disagreement_score":0.018767413,"about_ca_system_score_codex":0.001984979,"about_ca_system_score_gemma":0.0014117393,"threshold_uncertainty_score":0.06278324},"labels":[],"label_agreement":null},{"id":"W2106713193","doi":"10.1007/3-540-45675-9_8","title":"Calculating Aggregates with Range-Encoded Bit-Sliced Index","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Windsor","funders":"","keywords":"Bitmap; Computer science; Range (aeronautics); Index (typography); Population; Aggregate (composite); Algorithm; Range query (database); Data mining; Information retrieval; Artificial intelligence; Search engine; Web search query; Sargable; Programming language","score_opus":0.01510223831996642,"score_gpt":0.23033694610440972,"score_spread":0.21523470778444329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106713193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08013963,0.0009330621,0.8998071,0.00017327434,0.00018846728,0.00009434375,0.00095456623,0.011279323,0.0064302566],"genre_scores_gemma":[0.2973832,0.00037691274,0.6964524,0.0000919246,0.0000746141,0.000103244056,0.0017917429,0.0009290016,0.0027969882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986753,0.00012507832,0.00014355613,0.0001478063,0.0007817202,0.00012657467],"domain_scores_gemma":[0.9971916,0.0006393252,0.00018986256,0.0009419216,0.0009022239,0.00013501407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010831733,0.0007598277,0.00111963,0.0020977745,0.00071445416,0.002863306,0.001527165,0.0007168507,0.0035090814],"category_scores_gemma":[0.0068303957,0.0005568842,0.0005879497,0.0036036237,0.0006098287,0.004162586,0.002138833,0.0006642409,0.0016980699],"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.0019701077,0.00018352183,0.010736885,0.0006037488,0.00021677926,0.00060095463,0.0006918621,0.06137816,0.09005416,0.09423185,0.022755116,0.7165768],"study_design_scores_gemma":[0.000120478086,0.00029325034,0.0032211412,0.00010749914,0.00017110264,0.0006124021,0.00030871757,0.7424211,0.13105676,0.10480247,0.01675412,0.000130898],"about_ca_topic_score_codex":0.0025610414,"about_ca_topic_score_gemma":0.0044795386,"teacher_disagreement_score":0.0035090814,"about_ca_system_score_codex":0.0011312821,"about_ca_system_score_gemma":0.0012366034,"threshold_uncertainty_score":0.011739016},"labels":[],"label_agreement":null},{"id":"W2106715314","doi":"10.1007/978-3-642-14274-1_19","title":"Case Retrieval with Combined Adaptability and Similarity Criteria: Application to Case Retrieval Nets","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université du Québec à Montréal","funders":"","keywords":"Adaptability; Information retrieval; Similarity (geometry); Computer science; Artificial intelligence; Biology; Ecology; Image (mathematics)","score_opus":0.01710110320431864,"score_gpt":0.25347889028259596,"score_spread":0.2363777870782773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106715314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024469018,0.00048583705,0.9689029,0.00023287298,0.000031071704,0.00036023624,0.00014394868,0.00071762764,0.0046565933],"genre_scores_gemma":[0.2400192,0.00046874685,0.75569856,0.000107756256,0.00009650093,0.00031621376,0.000341584,0.00012669731,0.0028246604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980804,0.00080550165,0.00021991305,0.0002232765,0.0005960918,0.000074888536],"domain_scores_gemma":[0.99093807,0.0072176605,0.00033208838,0.000610668,0.0006914771,0.00020995688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052380613,0.00053510995,0.0012670157,0.004158212,0.00076890155,0.0020496314,0.0017074781,0.0010918727,0.0045655565],"category_scores_gemma":[0.019508637,0.00044142565,0.0010098803,0.0046960446,0.0009933463,0.0032556697,0.00220424,0.00088903535,0.00077276793],"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.000497033,0.0002757797,0.0030818938,0.00036244027,0.00012688484,0.0003861318,0.0004404716,0.09091631,0.0046616765,0.050894435,0.0037675644,0.8445893],"study_design_scores_gemma":[0.00010023581,0.0001703107,0.0016295369,0.000074625525,0.00014431383,0.00050953723,0.00013710832,0.9016361,0.0044338405,0.08494988,0.0061731325,0.000041326224],"about_ca_topic_score_codex":0.002759119,"about_ca_topic_score_gemma":0.0026764008,"teacher_disagreement_score":0.0052380613,"about_ca_system_score_codex":0.0011908398,"about_ca_system_score_gemma":0.0010104905,"threshold_uncertainty_score":0.027701795},"labels":[],"label_agreement":null},{"id":"W2106824622","doi":"10.1007/978-3-540-85912-3_5","title":"A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Pseudorandom number generator; Randomness; Pseudorandom binary sequence; Binary number; Computer science; Algorithm; Order (exchange); Function (biology); Period (music); Mathematics; Discrete mathematics; Combinatorics; Statistics; Arithmetic; Physics","score_opus":0.03315556871134891,"score_gpt":0.23189349797111103,"score_spread":0.19873792925976214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106824622","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.5141841,0.004042934,0.38693306,0.0014635193,0.0002821216,0.0001331087,0.0002866014,0.00023330435,0.09244126],"genre_scores_gemma":[0.9621831,0.0022998324,0.023621578,0.00020646643,0.0004893055,0.000090362686,0.00021447439,0.00010596071,0.010788956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845123,0.0005714208,0.000080953316,0.0001780636,0.0005796338,0.00013868758],"domain_scores_gemma":[0.9834379,0.013163447,0.0010109956,0.001278782,0.0007736801,0.00033519874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019366662,0.0006634656,0.0007430423,0.0017182187,0.0007647054,0.0024879186,0.00091949897,0.00093192223,0.003422766],"category_scores_gemma":[0.013653722,0.00045205292,0.0009130334,0.0016309198,0.0027948776,0.0045136325,0.0010753506,0.0022256041,0.00043284454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045610304,0.000028558536,0.00048776285,0.000063582935,0.000009796151,0.00011519752,0.00020547562,0.0051030656,0.0018289731,0.98473847,0.00036043525,0.0070131025],"study_design_scores_gemma":[0.00003587576,0.00023248346,0.0012635549,0.000082129205,0.00003921468,0.0009052669,0.00015571747,0.069571905,0.003867234,0.9191986,0.00460942,0.000038641003],"about_ca_topic_score_codex":0.00027966464,"about_ca_topic_score_gemma":0.00021951654,"teacher_disagreement_score":0.003422766,"about_ca_system_score_codex":0.00084396097,"about_ca_system_score_gemma":0.000746056,"threshold_uncertainty_score":0.011450291},"labels":[],"label_agreement":null},{"id":"W2106865935","doi":"10.1007/978-3-642-22012-8_27","title":"Generic Expression Hardness Results for Primitive Positive Formula Comparison","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McMaster University","funders":"","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Expression (computer science); Computer science; Containment (computer programming); Algorithm; Mathematics; Discrete mathematics; Programming language","score_opus":0.03159664891861386,"score_gpt":0.2631389996122832,"score_spread":0.23154235069366935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106865935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11654682,0.00362913,0.6520361,0.0081799,0.0010503264,0.00040565044,0.0018284647,0.0030130504,0.2133106],"genre_scores_gemma":[0.78533006,0.0024207197,0.14767668,0.002592705,0.0016386884,0.00065366784,0.0029852495,0.0017660802,0.054936126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946896,0.0008463419,0.00029166453,0.0014709448,0.0021050898,0.00059634197],"domain_scores_gemma":[0.98910064,0.007728167,0.00031575028,0.0019270529,0.00062751095,0.000300918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025886588,0.0016433157,0.0026021851,0.0018155057,0.0028651142,0.005325255,0.006150613,0.002644095,0.022880211],"category_scores_gemma":[0.011136408,0.0013387799,0.003981576,0.0043302495,0.005773285,0.022752179,0.006989252,0.013311951,0.0023261032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028982942,0.00015699957,0.0004609838,0.0005699305,0.00008537506,0.00019217195,0.0004374948,0.0066184667,0.0027146633,0.93538696,0.010776308,0.04231093],"study_design_scores_gemma":[0.000040017043,0.000037311624,0.0003037245,0.000037168673,0.00007481447,0.00016547106,0.000054592485,0.010216928,0.0016944939,0.98023796,0.0071113706,0.000026210379],"about_ca_topic_score_codex":0.00097391853,"about_ca_topic_score_gemma":0.0011830493,"teacher_disagreement_score":0.022880211,"about_ca_system_score_codex":0.0036323746,"about_ca_system_score_gemma":0.0014678122,"threshold_uncertainty_score":0.07654196},"labels":[],"label_agreement":null},{"id":"W2106886536","doi":"10.1007/978-3-540-68825-9_19","title":"Selective Sampling for Classification","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Université Laval","funders":"","keywords":"Computer science; Classifier (UML); Machine learning; Artificial intelligence; Task (project management); Active learning (machine learning); Set (abstract data type); Semi-supervised learning; Process (computing)","score_opus":0.036737260978105625,"score_gpt":0.2871909328080159,"score_spread":0.25045367182991024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106886536","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.0032715674,0.0018648901,0.98765707,0.0004282656,0.0002713963,0.000088736284,0.00038493247,0.0011854263,0.0048477463],"genre_scores_gemma":[0.17248303,0.0027215083,0.7690356,0.0010648837,0.0017553223,0.000952792,0.0043269945,0.0008683109,0.0467916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978125,0.00088346784,0.000090852714,0.00052747614,0.000528623,0.00015706714],"domain_scores_gemma":[0.9962921,0.0019956855,0.00010075621,0.0011880008,0.00033513765,0.00008829629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482272,0.001125943,0.0021209014,0.0016421981,0.0010828535,0.0017825782,0.0028264888,0.0015781042,0.012498365],"category_scores_gemma":[0.008060725,0.00072032196,0.0014149831,0.0022701803,0.0013116959,0.0021158867,0.0018530868,0.0025375192,0.006260248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021552267,0.00011373267,0.0010288251,0.00034861738,0.00014926927,0.000117737734,0.00011688545,0.03500128,0.0032063872,0.22031772,0.06848329,0.6709007],"study_design_scores_gemma":[0.000050419443,0.00007313045,0.0005310406,0.00005069997,0.000057533387,0.00023474077,0.000030394913,0.60195774,0.0030947155,0.36498916,0.028904522,0.00002583406],"about_ca_topic_score_codex":0.0022752036,"about_ca_topic_score_gemma":0.0032567978,"teacher_disagreement_score":0.012498365,"about_ca_system_score_codex":0.0010848297,"about_ca_system_score_gemma":0.0009104593,"threshold_uncertainty_score":0.041811228},"labels":[],"label_agreement":null},{"id":"W2106899111","doi":"10.1007/978-3-642-39112-5_120","title":"Impact of Different Pedagogical Agents’ Adaptive Self-regulated Prompting Strategies on Learning with MetaTutor","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Adaptive hypermedia; Adaptive strategies; Metacognition; Computer science; Perception; Adaptive learning; Quality (philosophy); Cognition; Multimedia; Hypermedia; Human–computer interaction; Psychology; Artificial intelligence","score_opus":0.09253748708540813,"score_gpt":0.38818896676791903,"score_spread":0.29565147968251093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106899111","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.9964993,0.00015081107,0.0012696182,0.000028276929,0.000035107438,0.00003590501,0.000049302816,0.00015828865,0.0017733566],"genre_scores_gemma":[0.9950964,0.00015743694,0.0025556418,0.00002781706,0.000016786596,0.00010749616,0.000097193726,0.00009804182,0.0018431952],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992142,0.0003037074,0.00008722683,0.00017364637,0.00011476143,0.00010649793],"domain_scores_gemma":[0.9849207,0.01315202,0.0005387845,0.0004674376,0.00038822813,0.00053276756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010288601,0.0005819197,0.0005740145,0.00035917206,0.00019435264,0.0014603839,0.0006102133,0.00071469176,0.00835528],"category_scores_gemma":[0.014420291,0.00024299644,0.0003415014,0.00024480492,0.00028026442,0.0012564043,0.0009560803,0.0007322273,0.0010897191],"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.09277275,0.017366055,0.025092516,0.0025932845,0.00068664225,0.000571807,0.006058485,0.025754761,0.2501166,0.0024575633,0.0020756882,0.5744539],"study_design_scores_gemma":[0.008859281,0.09957812,0.22017288,0.0008367956,0.0068547484,0.0012065042,0.006474231,0.17122218,0.4582904,0.00810356,0.017899841,0.0005014216],"about_ca_topic_score_codex":0.00042903543,"about_ca_topic_score_gemma":0.00026102155,"teacher_disagreement_score":0.00835528,"about_ca_system_score_codex":0.00019353585,"about_ca_system_score_gemma":0.00038014844,"threshold_uncertainty_score":0.02795124},"labels":[],"label_agreement":null},{"id":"W2107057919","doi":"10.1007/978-3-540-72823-8_76","title":"3D Object Recognition by Eigen-Scale-Space of Contours","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Simon Fraser University","funders":"","keywords":"Scale space; Computer vision; Artificial intelligence; Object (grammar); Cognitive neuroscience of visual object recognition; Computer science; Rotation (mathematics); Curvature; Pattern recognition (psychology); Invariant (physics); Representation (politics); Translation (biology); Boundary (topology); 3D single-object recognition; Matching (statistics); Scale (ratio); Mathematics; Image (mathematics); Geometry; Image processing; Geography","score_opus":0.02567587094500922,"score_gpt":0.2640982230058952,"score_spread":0.23842235206088597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107057919","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.015086111,0.00036498433,0.9823956,0.000065466484,0.000028870307,0.000018147859,0.00007567495,0.00093223696,0.0010328877],"genre_scores_gemma":[0.22983046,0.0008885509,0.7657762,0.000077084354,0.000042484,0.000050978946,0.00040024295,0.0003704549,0.0025636004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974746,0.00003708924,0.000014868095,0.00006211551,0.00010673254,0.000031600186],"domain_scores_gemma":[0.9996896,0.0000862346,0.000034458903,0.000084076215,0.00008453514,0.000021230002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003442396,0.0004901173,0.00064881705,0.0011887697,0.00020417801,0.0013370075,0.00069005135,0.000567439,0.0025946442],"category_scores_gemma":[0.0009386636,0.00041691875,0.0007645221,0.0016789425,0.000535077,0.0013685132,0.00076148286,0.00062943995,0.0016995368],"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.00017654157,0.000046429253,0.001042704,0.00016265368,0.000050062772,0.0000745586,0.00015880719,0.02436093,0.16508098,0.019771846,0.0031075494,0.7859669],"study_design_scores_gemma":[0.00001458304,0.000092425376,0.0036857694,0.000036048237,0.000031814277,0.0005284514,0.00009437522,0.90036386,0.05476873,0.03126544,0.009064407,0.000054118376],"about_ca_topic_score_codex":0.00086142257,"about_ca_topic_score_gemma":0.0010165722,"teacher_disagreement_score":0.0025946442,"about_ca_system_score_codex":0.00022911558,"about_ca_system_score_gemma":0.00028679366,"threshold_uncertainty_score":0.008679986},"labels":[],"label_agreement":null},{"id":"W2107184547","doi":"10.1007/978-3-642-05148-7_14","title":"Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Intersection (aeronautics); Peer-to-peer; Load balancing (electrical power); Theoretical computer science; Computer network","score_opus":0.011264694821669995,"score_gpt":0.24241836309950568,"score_spread":0.23115366827783568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107184547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053971607,0.0013466977,0.93603677,0.00043222183,0.00023056922,0.00025336357,0.00023645561,0.00095205865,0.00654025],"genre_scores_gemma":[0.67041147,0.0007865931,0.31843847,0.00015330232,0.00016925558,0.0003269679,0.00044511267,0.00013575745,0.009133111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985133,0.00047112672,0.00011874804,0.00018281133,0.00053713843,0.00017676625],"domain_scores_gemma":[0.9954331,0.0029016044,0.00021843301,0.0007324042,0.0005505574,0.00016380203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019426543,0.0004466512,0.0016756711,0.00071260356,0.0016080077,0.0014166307,0.0020466433,0.001104897,0.003555204],"category_scores_gemma":[0.0070326333,0.0006103893,0.0003317818,0.0013534153,0.00083157455,0.0028621748,0.00231648,0.0009331133,0.00081171154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010661699,0.00035045017,0.0012189926,0.0006801177,0.000094653944,0.00027004106,0.00087270053,0.4200124,0.029667167,0.20141731,0.014102806,0.3302471],"study_design_scores_gemma":[0.00010344158,0.0001579474,0.00020902372,0.000029667786,0.000024798626,0.00010501566,0.00011589606,0.9047713,0.005163987,0.08486375,0.004426436,0.000028746343],"about_ca_topic_score_codex":0.0016955611,"about_ca_topic_score_gemma":0.0021689567,"teacher_disagreement_score":0.003555204,"about_ca_system_score_codex":0.0008473373,"about_ca_system_score_gemma":0.0011020094,"threshold_uncertainty_score":0.011893332},"labels":[],"label_agreement":null},{"id":"W2107241286","doi":"10.1007/11795018_25","title":"Representing and Querying Line Graphs in Natural Language: The iGraph System","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","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":"Carleton University","funders":"","keywords":"Computer science; Natural language; Architecture; Natural (archaeology); Graph; Interface (matter); User interface; Human–computer interaction; Artificial intelligence; Natural language processing; World Wide Web; Theoretical computer science; Programming language","score_opus":0.009458823394421336,"score_gpt":0.22874835825665282,"score_spread":0.2192895348622315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107241286","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.02685479,0.0006863614,0.81421095,0.00058237015,0.000083408144,0.00016738512,0.0034851818,0.1472133,0.006716209],"genre_scores_gemma":[0.21350989,0.0009751377,0.75708723,0.00074749254,0.000085406755,0.0002190562,0.012651586,0.00797973,0.0067445724],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993643,0.00018780872,0.000057063222,0.00017789904,0.00015152144,0.000061327366],"domain_scores_gemma":[0.9987771,0.00063231465,0.00006218686,0.00033883878,0.00010719176,0.00008238075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845218,0.0010287184,0.0013341417,0.0017477508,0.0007170475,0.003394642,0.003355427,0.0016206206,0.008671409],"category_scores_gemma":[0.0029551843,0.0007840314,0.0012011342,0.0018864251,0.0012804308,0.005785683,0.003044668,0.0011973411,0.0031851926],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002019395,0.00062012736,0.0049291835,0.0014465399,0.0003038171,0.0013289454,0.0025093588,0.050523408,0.027329145,0.08448556,0.14346501,0.68103945],"study_design_scores_gemma":[0.0005626386,0.0002310927,0.0011302828,0.00024636218,0.00028671086,0.0006867297,0.0010267706,0.6581615,0.03686886,0.19791457,0.10272158,0.00016294685],"about_ca_topic_score_codex":0.010532474,"about_ca_topic_score_gemma":0.012483795,"teacher_disagreement_score":0.010532474,"about_ca_system_score_codex":0.0008483443,"about_ca_system_score_gemma":0.0010092994,"threshold_uncertainty_score":0.029008746},"labels":[],"label_agreement":null},{"id":"W2107365122","doi":"10.1007/978-3-642-29280-4_36","title":"Performance Analysis of AODV and DSR Routing Protocols for Ad-Hoc Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Dynamic Source Routing; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Routing protocol; Distance-vector routing protocol; Ad hoc wireless distribution service; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Network packet","score_opus":0.019711026975257197,"score_gpt":0.26430836267073027,"score_spread":0.24459733569547307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107365122","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.79621536,0.021666354,0.14788206,0.00082977896,0.00044567703,0.0003027384,0.00083760155,0.0014211991,0.030399272],"genre_scores_gemma":[0.98258865,0.002378377,0.0104379915,0.000036832207,0.000088865265,0.00005399299,0.00051673775,0.00007922034,0.0038193078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978277,0.0004591427,0.00010239091,0.00019512458,0.0011728819,0.00024271652],"domain_scores_gemma":[0.99497026,0.0030717053,0.00023539724,0.00030979054,0.0013037819,0.00010902002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020325475,0.00090398453,0.0008861945,0.0018607359,0.00062475837,0.0011494593,0.001113576,0.0005820398,0.0017757473],"category_scores_gemma":[0.0044586947,0.00029509945,0.0004906845,0.0013929291,0.000585377,0.0015290428,0.0005098046,0.0004852823,0.00040183045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024339836,0.00065120106,0.008302266,0.0009261754,0.00033368974,0.00033344224,0.00033448532,0.66600496,0.061249442,0.026532829,0.0069475416,0.22594996],"study_design_scores_gemma":[0.000036456404,0.0009466502,0.003884261,0.00002779576,0.00012644177,0.00028025458,0.0001670133,0.9719234,0.016227348,0.0040845727,0.0022541112,0.00004155031],"about_ca_topic_score_codex":0.0029824674,"about_ca_topic_score_gemma":0.0024440645,"teacher_disagreement_score":0.0029824674,"about_ca_system_score_codex":0.0024816887,"about_ca_system_score_gemma":0.0008306848,"threshold_uncertainty_score":0.018005967},"labels":[],"label_agreement":null},{"id":"W2107415975","doi":"10.1007/11527503_10","title":"Finding All Frequent Patterns Starting from the Closure","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Closure (psychology)","score_opus":0.031212176330043133,"score_gpt":0.26666680672615317,"score_spread":0.23545463039611003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107415975","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.4092728,0.0024790268,0.5612596,0.0013197401,0.0005941725,0.001185592,0.011818127,0.0030544952,0.009016464],"genre_scores_gemma":[0.41319838,0.0010796405,0.55553436,0.00023307191,0.00036383208,0.0005522847,0.022854507,0.0004464105,0.005737546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988475,0.00008964408,0.0001621487,0.00042463702,0.00034058088,0.00013553588],"domain_scores_gemma":[0.9952578,0.0022248398,0.00051639683,0.00061154715,0.0010500478,0.0003394197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974492,0.001153787,0.00168975,0.0040474106,0.0012357851,0.0020015675,0.0014108274,0.0010697092,0.0056976243],"category_scores_gemma":[0.008600613,0.0006974709,0.0021703464,0.002528362,0.0006582324,0.0039878855,0.0010914407,0.001656809,0.0025430552],"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.0025889648,0.0011977613,0.03784191,0.0026530335,0.00043640853,0.0070997374,0.001398395,0.0050752354,0.071712375,0.04113267,0.021274474,0.807589],"study_design_scores_gemma":[0.000842428,0.0036361546,0.034615546,0.0016512378,0.0012217844,0.022421576,0.0040275403,0.2063213,0.09967477,0.54081297,0.084481776,0.00029298058],"about_ca_topic_score_codex":0.00056282955,"about_ca_topic_score_gemma":0.0007850695,"teacher_disagreement_score":0.0056976243,"about_ca_system_score_codex":0.0003147787,"about_ca_system_score_gemma":0.0014945106,"threshold_uncertainty_score":0.019060493},"labels":[],"label_agreement":null},{"id":"W2107696224","doi":"10.1007/978-3-642-04447-2_86","title":"Clustering for Photo Retrieval at Image CLEF 2008","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Ottawa","funders":"","keywords":"Clef; Cluster analysis; Computer science; Image retrieval; Information retrieval; Artificial intelligence; Image (mathematics); Engineering","score_opus":0.020504618584861797,"score_gpt":0.2650788852796645,"score_spread":0.2445742666948027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107696224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028164927,0.0075946115,0.7697683,0.0042060753,0.0025866278,0.0012306679,0.030774405,0.11899076,0.03668361],"genre_scores_gemma":[0.070665255,0.0011084623,0.8097077,0.00094012363,0.0004850877,0.00050950696,0.052190527,0.007351724,0.05704164],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977836,0.00048746742,0.00008142987,0.00049405196,0.0009314388,0.00022198036],"domain_scores_gemma":[0.9986778,0.00023607572,0.00003894379,0.00047805088,0.00047919885,0.00008999708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018768053,0.0017366118,0.0017309117,0.0036809598,0.0015130176,0.0020666744,0.0028317259,0.00287824,0.045426674],"category_scores_gemma":[0.0035847367,0.00085440296,0.0012999976,0.002323766,0.00048036317,0.0025063655,0.0011453299,0.0016873322,0.029294003],"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.00026348757,0.00012583596,0.00024300942,0.00028342698,0.00008641282,0.000059800725,0.00003279035,0.00795558,0.017881608,0.0043038335,0.58948445,0.37927976],"study_design_scores_gemma":[0.0002916402,0.00026682264,0.00372105,0.00013098115,0.00010274281,0.00072835205,0.0001392667,0.44932985,0.14346793,0.032226864,0.36940354,0.00019097935],"about_ca_topic_score_codex":0.013733314,"about_ca_topic_score_gemma":0.028361045,"teacher_disagreement_score":0.045426674,"about_ca_system_score_codex":0.0029481426,"about_ca_system_score_gemma":0.0015082958,"threshold_uncertainty_score":0.15196735},"labels":[],"label_agreement":null},{"id":"W2107699024","doi":"10.1007/978-3-642-05445-7_18","title":"New Results on Impossible Differential Cryptanalysis of Reduced–Round Camellia–128","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":31,"is_retracted":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":"Impossible differential cryptanalysis; Boomerang attack; Block cipher; Computer science; Differential cryptanalysis; Key schedule; Camellia; Slide attack; Arithmetic; Cryptography; Cryptanalysis; Cipher; Redundancy (engineering); Algorithm; Computer security; Mathematics; Encryption; Operating system","score_opus":0.020844210974065136,"score_gpt":0.27856124265477655,"score_spread":0.2577170316807114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107699024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20898412,0.0073527526,0.4834947,0.0055610444,0.0021090975,0.00028374596,0.00048133024,0.0016594201,0.29007372],"genre_scores_gemma":[0.86378664,0.0026069283,0.091850586,0.0011685877,0.0015289852,0.00021048494,0.0006565162,0.0004598061,0.037731394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728084,0.0005438997,0.00017625232,0.00046904813,0.0011800525,0.00034978328],"domain_scores_gemma":[0.99767345,0.0011940198,0.00016480882,0.00064939156,0.00019722251,0.0001211334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018286869,0.002005676,0.0013822491,0.0023338676,0.0014879629,0.0039497884,0.0019136118,0.0013353372,0.010432221],"category_scores_gemma":[0.0064875074,0.00095248705,0.0017947834,0.0017829541,0.0045862775,0.007430859,0.0045336843,0.0043039243,0.0027275574],"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.00039941358,0.00008242113,0.00051602063,0.00031625442,0.00007901773,0.000377018,0.00035713104,0.007005873,0.00644485,0.9278178,0.005899253,0.05070488],"study_design_scores_gemma":[0.00007649269,0.000113678085,0.00038004926,0.00008371463,0.00007797951,0.0009032532,0.000063730055,0.02643773,0.011586802,0.93981105,0.020384371,0.00008105053],"about_ca_topic_score_codex":0.00034145356,"about_ca_topic_score_gemma":0.0003252327,"teacher_disagreement_score":0.010432221,"about_ca_system_score_codex":0.0018669813,"about_ca_system_score_gemma":0.0008707635,"threshold_uncertainty_score":0.034899235},"labels":[],"label_agreement":null},{"id":"W2108183197","doi":"10.1007/11774303_46","title":"Automatic Recognition of Learner Groups in Exploratory Learning Environments","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cluster analysis; Artificial intelligence; Classifier (UML); Unsupervised learning; Identification (biology); Machine learning","score_opus":0.022687937716209066,"score_gpt":0.22252513405018245,"score_spread":0.1998371963339734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108183197","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.7527462,0.00043727458,0.23743218,0.00009837624,0.000073671115,0.00017855984,0.0007889057,0.004820323,0.0034244638],"genre_scores_gemma":[0.897173,0.00013668541,0.0982052,0.00002887754,0.000038546536,0.00015786379,0.0010520685,0.00017965141,0.0030281418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995388,0.00011238393,0.000023052615,0.00013895096,0.0001137167,0.00007329174],"domain_scores_gemma":[0.99824584,0.00085336773,0.00016571718,0.00017292376,0.0003327349,0.00022943791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067170087,0.00038526856,0.0006058932,0.0016311746,0.0003998993,0.00081553304,0.0007980783,0.00074719545,0.0016648744],"category_scores_gemma":[0.002023889,0.00018609689,0.00030419976,0.00070058793,0.00022497681,0.00092108076,0.0014200453,0.0005177564,0.0012518663],"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.002034687,0.0005461448,0.043694206,0.00019450394,0.00008132773,0.00023763851,0.0016073181,0.003971081,0.117233306,0.00089292676,0.004516469,0.8249904],"study_design_scores_gemma":[0.00022514543,0.0015438907,0.21905243,0.00011670821,0.00026593602,0.0015183642,0.0037043341,0.6179016,0.13905695,0.0076767784,0.008817062,0.00012073559],"about_ca_topic_score_codex":0.0005668592,"about_ca_topic_score_gemma":0.0011673438,"teacher_disagreement_score":0.0016648744,"about_ca_system_score_codex":0.00014607496,"about_ca_system_score_gemma":0.00024274796,"threshold_uncertainty_score":0.005569577},"labels":[],"label_agreement":null},{"id":"W2108187156","doi":"10.1007/3-540-47772-1_13","title":"Integrating Conversational Interaction and Constraint Based Reasoning in an Agent Building Shell","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Negotiation; Shell (structure); Java; Maximization; Constraint (computer-aided design); Constraint satisfaction; Human–computer interaction; Artificial intelligence; Knowledge management; Programming language; Mathematical optimization","score_opus":0.027175142532816554,"score_gpt":0.2739870649160286,"score_spread":0.24681192238321203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108187156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046309032,0.000024630614,0.9865797,0.00011364496,0.000022530658,0.00009468933,0.000024534964,0.003155796,0.005353525],"genre_scores_gemma":[0.098466806,0.00006549557,0.8929505,0.00008486175,0.000020892996,0.00013483698,0.00016150439,0.0009269248,0.0071882526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795866,0.0007356846,0.00016824408,0.00027593353,0.00067967654,0.00018182799],"domain_scores_gemma":[0.9962161,0.002426132,0.000113831986,0.00066477474,0.00038684995,0.0001923132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033489782,0.00070609397,0.0010426149,0.0007880154,0.0020214077,0.0039024,0.00401452,0.0017600325,0.010044921],"category_scores_gemma":[0.008087015,0.0015741788,0.0016066565,0.0006605658,0.0017900321,0.0046379194,0.0046736635,0.0024249926,0.0025838471],"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.00076726306,0.0009199038,0.001210655,0.0006025126,0.00027827703,0.0014912941,0.005180619,0.14058585,0.050737686,0.3519378,0.010197574,0.43609053],"study_design_scores_gemma":[0.0000710861,0.00008143613,0.00023642974,0.0000818267,0.00014541586,0.0003101637,0.00028459018,0.81106895,0.037861224,0.11149573,0.03825195,0.00011122552],"about_ca_topic_score_codex":0.0051597944,"about_ca_topic_score_gemma":0.006293563,"teacher_disagreement_score":0.010044921,"about_ca_system_score_codex":0.0007808581,"about_ca_system_score_gemma":0.0020801676,"threshold_uncertainty_score":0.03360367},"labels":[],"label_agreement":null},{"id":"W2108323282","doi":"10.1007/978-3-642-40319-4_13","title":"On the Application of Multi-class Classification in Physical Therapy Recommendation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Class (philosophy); Machine learning; Artificial intelligence; Intervention (counseling); Rehabilitation; Decision support system; Referral; Clinical decision support system; Medicine; Physical therapy; Nursing","score_opus":0.04274484403340551,"score_gpt":0.2946739266865733,"score_spread":0.25192908265316777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108323282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053287894,0.011535886,0.92069876,0.0031741513,0.0012906002,0.00022158417,0.0008130497,0.000981887,0.00799616],"genre_scores_gemma":[0.57935447,0.0046855886,0.39877006,0.0010448651,0.0018056148,0.00029230586,0.0017853347,0.00014790213,0.012113829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721515,0.0011457892,0.00023520092,0.00043775415,0.0007771546,0.000188966],"domain_scores_gemma":[0.99144405,0.006150883,0.00022073979,0.00076268724,0.0012828555,0.00013872978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005770945,0.00083058863,0.0020203576,0.0021999686,0.0010496485,0.0018786248,0.00206652,0.001508876,0.0034173569],"category_scores_gemma":[0.012604981,0.0003238376,0.0013591452,0.0033624123,0.0006010048,0.0024501954,0.0013041326,0.0024708444,0.0011322809],"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.00036701525,0.0003672164,0.0051029306,0.00014980734,0.00018133847,0.00007116774,0.00015308593,0.052301094,0.0014833241,0.012350824,0.015963105,0.9115091],"study_design_scores_gemma":[0.000017227978,0.000060330294,0.0020510284,0.000041994765,0.000048967984,0.0000577084,0.000059838945,0.97995454,0.0007928718,0.014312651,0.002584622,0.000018208766],"about_ca_topic_score_codex":0.012119563,"about_ca_topic_score_gemma":0.009613188,"teacher_disagreement_score":0.012119563,"about_ca_system_score_codex":0.0011017612,"about_ca_system_score_gemma":0.0008372419,"threshold_uncertainty_score":0.030520082},"labels":[],"label_agreement":null},{"id":"W2108349057","doi":"10.1007/978-3-642-38883-5_2","title":"Genetic-Programming Approach to Learn Model Transformation Rules from Examples","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":31,"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 à Montréal; Université de Montréal","funders":"","keywords":"Transformation (genetics); Computer science; Genetic programming; Model transformation; Nesting (process); Theoretical computer science; Program transformation; Artificial intelligence; Programming language","score_opus":0.0249204869988375,"score_gpt":0.2263868353393492,"score_spread":0.2014663483405117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108349057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010046763,0.00012964102,0.98524565,0.00014310499,0.000020438827,0.00006381189,0.00012854706,0.0011394987,0.0030827057],"genre_scores_gemma":[0.19159018,0.00024804292,0.80174124,0.00020764349,0.000027502821,0.00025395973,0.0007452406,0.0002561364,0.0049301316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996891,0.00008292535,0.000017404724,0.00009214617,0.00009731703,0.000021054133],"domain_scores_gemma":[0.9989262,0.0008145967,0.000030951007,0.00008802797,0.000119884615,0.000020281024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066742866,0.00073786546,0.0006791458,0.0008752796,0.00030516938,0.000667271,0.0018311962,0.0011330761,0.003858159],"category_scores_gemma":[0.003298982,0.00047939274,0.0010475707,0.00086429605,0.00058570376,0.0009421558,0.00082399714,0.0021214848,0.00073950284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006220045,0.00016470173,0.0011420416,0.00013306546,0.00011037692,0.00013984562,0.00011039881,0.56170934,0.0031635992,0.02545986,0.0036510637,0.40415338],"study_design_scores_gemma":[0.0000088759925,0.000015688642,0.00008769837,0.000013847357,0.00001908662,0.00002440101,0.000010268287,0.9808116,0.0011277675,0.016847236,0.0010291865,0.0000042839056],"about_ca_topic_score_codex":0.0059102457,"about_ca_topic_score_gemma":0.0077401074,"teacher_disagreement_score":0.0059102457,"about_ca_system_score_codex":0.0006701806,"about_ca_system_score_gemma":0.0007671933,"threshold_uncertainty_score":0.01290679},"labels":[],"label_agreement":null},{"id":"W2108475409","doi":"10.1007/978-3-540-70939-8_16","title":"A Generalized Approach to Word Segmentation Using Maximum Length Descending Frequency and Entropy Rate","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Ottawa","funders":"","keywords":"Computer science; Principle of maximum entropy; Segmentation; Word (group theory); Entropy (arrow of time); Matching (statistics); Text segmentation; Algorithm; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Word lists by frequency; Word length; Natural language processing; Mathematics; Statistics; Sentence","score_opus":0.034352980930623424,"score_gpt":0.2905912693922288,"score_spread":0.25623828846160535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108475409","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.0030780612,0.0003001033,0.9953252,0.00004826439,0.00004908259,0.00003672101,0.00007231323,0.00031115106,0.0007791417],"genre_scores_gemma":[0.07630874,0.0006341677,0.91629463,0.000103816295,0.00039659112,0.00019912921,0.0004758052,0.0005180281,0.0050690663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980508,0.0005514417,0.00017533013,0.00046848695,0.00062677334,0.00012714257],"domain_scores_gemma":[0.99672747,0.0017739013,0.00015728378,0.00052710273,0.0007193224,0.00009489311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022319856,0.0010824637,0.0023218421,0.0040484774,0.001005929,0.0024713122,0.0030439978,0.001381758,0.0046005803],"category_scores_gemma":[0.006826205,0.00089261896,0.0018491459,0.004364425,0.0014483326,0.004752028,0.0019864787,0.0018464915,0.0020089603],"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.00027011673,0.00018102606,0.0014033567,0.00047475417,0.00019722323,0.00035242966,0.00065712375,0.13119107,0.023280375,0.27094823,0.0045684213,0.56647587],"study_design_scores_gemma":[0.000011726609,0.000051428724,0.0006119095,0.000028891356,0.00004296334,0.00011787217,0.000058987167,0.832821,0.0032469425,0.15862443,0.00434022,0.000043711807],"about_ca_topic_score_codex":0.004596812,"about_ca_topic_score_gemma":0.0050477223,"teacher_disagreement_score":0.0046005803,"about_ca_system_score_codex":0.0012090683,"about_ca_system_score_gemma":0.0014010553,"threshold_uncertainty_score":0.015390515},"labels":[],"label_agreement":null},{"id":"W2108491359","doi":"10.1007/978-3-642-41184-7_30","title":"Training Binary Descriptors for Improved Robustness and Efficiency in Real-Time Matching","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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 Ottawa","funders":"","keywords":"FREAK; Computer science; Robustness (evolution); Scale-invariant feature transform; Artificial intelligence; Preprocessor; Pattern recognition (psychology); Orb (optics); Computer vision; Feature extraction; Image (mathematics)","score_opus":0.02734655339676561,"score_gpt":0.27343038623726823,"score_spread":0.24608383284050261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108491359","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.052931454,0.0011243541,0.939164,0.00018505519,0.000272318,0.00014664278,0.00027318468,0.0037239282,0.002179082],"genre_scores_gemma":[0.37255695,0.0007750405,0.61582285,0.00026875018,0.00015933486,0.00014656696,0.0016530138,0.00045025986,0.008167231],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890673,0.00016027784,0.00007730488,0.00026706772,0.00043296895,0.0001556196],"domain_scores_gemma":[0.9984847,0.00049482856,0.00011398593,0.00046910942,0.00038162174,0.000055732085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012645562,0.0009581576,0.0014808387,0.0014245611,0.0004490855,0.0011942538,0.002084579,0.001451751,0.007510389],"category_scores_gemma":[0.004448804,0.00053696893,0.00061367365,0.0027592739,0.0005017335,0.0017468827,0.0013870113,0.0011669891,0.004107867],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058798556,0.00028831733,0.00096476957,0.0001558448,0.000055692642,0.000073223135,0.000037242615,0.01916801,0.08865138,0.0031175234,0.0068987515,0.8800012],"study_design_scores_gemma":[0.00012583943,0.00033258938,0.0022141354,0.000028687668,0.00007981506,0.00062175,0.000058485282,0.8285409,0.15734863,0.0033620622,0.0072444333,0.000042633597],"about_ca_topic_score_codex":0.0031262925,"about_ca_topic_score_gemma":0.0032249219,"teacher_disagreement_score":0.007510389,"about_ca_system_score_codex":0.0004958842,"about_ca_system_score_gemma":0.0009752547,"threshold_uncertainty_score":0.025124788},"labels":[],"label_agreement":null},{"id":"W2108589375","doi":"10.1007/978-3-642-15705-9_42","title":"A Parameterization of Deformation Fields for Diffeomorphic Image Registration and Its Application to Myocardial Delineation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St Joseph's Health Care; University Hospital","funders":"","keywords":"Jacobian matrix and determinant; Diffeomorphism; Regularization (linguistics); Image registration; Vector field; Transformation (genetics); Curl (programming language); Computer science; Artificial intelligence; Computer vision; Algorithm; Mathematics; Topology (electrical circuits); Image (mathematics); Applied mathematics; Geometry; Mathematical analysis","score_opus":0.012164838408317892,"score_gpt":0.3041541133962783,"score_spread":0.2919892749879604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108589375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017832232,0.0000893546,0.9976312,0.00004766742,0.000013073584,0.000024250456,0.000031832056,0.00019045906,0.00018882197],"genre_scores_gemma":[0.07476449,0.00058844144,0.92174673,0.000068094436,0.00007809821,0.0002489264,0.00030963204,0.0008594438,0.001336148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915564,0.00031396482,0.00009609719,0.00018986478,0.00020440428,0.00004002135],"domain_scores_gemma":[0.9982248,0.0007277183,0.00022412273,0.0004383865,0.00031514184,0.000069934045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020402553,0.0009775623,0.0012430648,0.002163491,0.00056679844,0.001692347,0.0011894737,0.0015938294,0.0020550075],"category_scores_gemma":[0.006602936,0.0008589743,0.0013962993,0.0027865043,0.0010802072,0.0016456649,0.0013650424,0.0022025106,0.0012260345],"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.00016898381,0.00011662446,0.00061265595,0.0002397275,0.00007555377,0.00013478938,0.00023334248,0.15402852,0.06716047,0.09167247,0.003669139,0.68188775],"study_design_scores_gemma":[0.00003260887,0.00018507936,0.0012655238,0.000062788735,0.000059148995,0.00056829484,0.00006557544,0.91405636,0.01989064,0.04776357,0.015937813,0.000112493566],"about_ca_topic_score_codex":0.0012909386,"about_ca_topic_score_gemma":0.0010659909,"teacher_disagreement_score":0.002163491,"about_ca_system_score_codex":0.00067476166,"about_ca_system_score_gemma":0.000899443,"threshold_uncertainty_score":0.01078999},"labels":[],"label_agreement":null},{"id":"W2108594175","doi":"10.1007/11508380_30","title":"International Grid CA Interworking, Peer Review and Policy Management Through the European DataGrid Certification Authority Coordination Group","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canarie","funders":"","keywords":"Certification; Interoperability; Computer science; Certificate authority; Authentication (law); Trust management (information system); Public key infrastructure; Computer security; World Wide Web; Knowledge management; Public-key cryptography; Management","score_opus":0.03441567508990615,"score_gpt":0.29245477914428764,"score_spread":0.25803910405438146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108594175","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017831093,0.0035149588,0.25305,0.013279542,0.0022164432,0.0012403259,0.0018278231,0.014621682,0.6924181],"genre_scores_gemma":[0.25911266,0.0035987264,0.15286244,0.00218086,0.0012041355,0.00091241836,0.0055569173,0.0039522448,0.5706195],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970035,0.0009914476,0.00022958263,0.00047719572,0.0009070753,0.0003911184],"domain_scores_gemma":[0.994729,0.0008871693,0.00038310714,0.0017652331,0.0014085018,0.000826999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007233171,0.0005891866,0.00056534354,0.0019045396,0.0011560858,0.006268581,0.0014060155,0.0020350078,0.025191046],"category_scores_gemma":[0.0072427476,0.0004747606,0.00044181588,0.0027407412,0.0012236784,0.0042820233,0.002630957,0.0018492056,0.013358561],"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.00024999378,0.00028059992,0.0015865897,0.00019240205,0.000039131755,0.00013433218,0.00057664356,0.004658082,0.0027141643,0.3044918,0.33179086,0.3532854],"study_design_scores_gemma":[0.0001007089,0.00006121203,0.001492723,0.00009828052,0.000020639474,0.0001827708,0.00012206993,0.01430216,0.0029589352,0.026182832,0.9544445,0.00003302689],"about_ca_topic_score_codex":0.009817824,"about_ca_topic_score_gemma":0.005756291,"teacher_disagreement_score":0.025191046,"about_ca_system_score_codex":0.0027441294,"about_ca_system_score_gemma":0.009665774,"threshold_uncertainty_score":0.084272444},"labels":[],"label_agreement":null},{"id":"W2108683550","doi":"10.1007/978-3-540-44400-8_12","title":"On the Face Lattice of the Metric Polytope","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; McMaster University","funders":"","keywords":"Polytope; Enumeration; Combinatorics; Conjecture; Lattice (music); Vertex (graph theory); Face (sociological concept); Mathematics; Computer science; Discrete mathematics; Graph; Physics","score_opus":0.01118062854159397,"score_gpt":0.1971345960277889,"score_spread":0.18595396748619494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108683550","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.21799712,0.0030646524,0.24542995,0.0036551163,0.0013005757,0.00014189046,0.001448137,0.00032842005,0.52663404],"genre_scores_gemma":[0.75097656,0.003123304,0.09254093,0.0007794618,0.0014299555,0.0002229137,0.0017442725,0.00042423836,0.14875834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994979,0.000111728325,0.00001599753,0.00008149202,0.0002122833,0.00008055198],"domain_scores_gemma":[0.99960226,0.00012504694,0.000039821152,0.000038701914,0.00008070881,0.00011359591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737752,0.0006920789,0.0010276042,0.0013278447,0.0016863438,0.003244139,0.0010560825,0.0008889379,0.014037943],"category_scores_gemma":[0.0011440597,0.00046274957,0.0006068488,0.0011433342,0.0021629517,0.002526989,0.001625795,0.0030190083,0.0022784641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029530096,0.000014273804,0.00006849871,0.000041901978,0.000004293464,0.000059300935,0.000072601266,0.0026471352,0.00057148194,0.98225594,0.00404791,0.010187218],"study_design_scores_gemma":[0.000010436407,0.000018298097,0.00016257547,0.000014541177,0.0000028812037,0.0001377504,0.00009923662,0.009449911,0.00026523965,0.97765416,0.012172881,0.000012144976],"about_ca_topic_score_codex":0.0024628874,"about_ca_topic_score_gemma":0.0021209416,"teacher_disagreement_score":0.014037943,"about_ca_system_score_codex":0.0011616694,"about_ca_system_score_gemma":0.00051550765,"threshold_uncertainty_score":0.046961606},"labels":[],"label_agreement":null},{"id":"W2108687116","doi":"10.1007/978-3-540-85958-1_32","title":"Exploiting Decomposition in Constraint Optimization Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; Bounding overwatch; Search tree; Recursion (computer science); Component (thermodynamics); Decomposition; Mathematical optimization; Tree (set theory); Decomposition method (queueing theory); Tree decomposition; Constraint (computer-aided design); Branch and bound; Depth-first search; Algorithm; Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence","score_opus":0.017851611222918996,"score_gpt":0.24075462219781338,"score_spread":0.22290301097489437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108687116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020125431,0.0009564176,0.98626584,0.00025193294,0.000082689454,0.000042028645,0.0000874962,0.0002299917,0.010071126],"genre_scores_gemma":[0.0619323,0.0019771263,0.92802435,0.00021901538,0.00017667645,0.00016451621,0.0006435256,0.00037289257,0.006489555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986922,0.0005825171,0.00006444831,0.0001389028,0.00042777814,0.00009418958],"domain_scores_gemma":[0.9981127,0.0012743641,0.00008375935,0.00029490324,0.0001752106,0.000059026333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016287914,0.0014634333,0.001204623,0.0011728314,0.00047292924,0.0017112975,0.0012412055,0.00079336425,0.0072263605],"category_scores_gemma":[0.005410904,0.0010403458,0.0016504689,0.0028828173,0.00093843834,0.0027608473,0.0026362173,0.003765106,0.0016495609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012725737,0.00016051729,0.00038903372,0.0007053526,0.0001579011,0.00017078815,0.00018204853,0.16025978,0.0052297395,0.40406471,0.023345098,0.4052078],"study_design_scores_gemma":[0.000031528776,0.000032317053,0.0001365058,0.00012851924,0.000043016546,0.0001141797,0.00003731366,0.49724784,0.0018663354,0.47435117,0.025991878,0.000019351097],"about_ca_topic_score_codex":0.0015217672,"about_ca_topic_score_gemma":0.0021047136,"teacher_disagreement_score":0.0072263605,"about_ca_system_score_codex":0.00064783124,"about_ca_system_score_gemma":0.0008535432,"threshold_uncertainty_score":0.024174571},"labels":[],"label_agreement":null},{"id":"W2108770334","doi":"10.1007/3-540-45787-9_32","title":"Needle Insertion Modelling for the Interactive Simulation of Percutaneous Procedures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Haptic technology; Computer science; Flexibility (engineering); Simulation; Computation; Planar; Virtual reality; Interface (matter); Interactive simulation; Deformation (meteorology); Surgical simulation; Computer graphics (images); Artificial intelligence; Algorithm; Materials science; Surgery","score_opus":0.025026619598309312,"score_gpt":0.23795569684442391,"score_spread":0.2129290772461146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108770334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018028203,0.00044621457,0.9708954,0.00017057691,0.00006189162,0.00007636001,0.00032871662,0.0018095602,0.008183036],"genre_scores_gemma":[0.6303929,0.0013882902,0.35016724,0.00016195224,0.000075565506,0.0003946739,0.000757288,0.0013710911,0.015290927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997012,0.00007837431,0.000021450449,0.000033343855,0.00013850424,0.000027068423],"domain_scores_gemma":[0.9993303,0.00044241556,0.000053777538,0.00005494573,0.00009187297,0.00002679292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035981313,0.00080408476,0.0009267415,0.00047622525,0.00042115635,0.0013104415,0.0021284197,0.0026592454,0.008584868],"category_scores_gemma":[0.0017934308,0.0009306463,0.0011200545,0.0005679584,0.00040764306,0.0008137879,0.00075732364,0.000962506,0.0014405169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005080468,0.000029290983,0.0002287239,0.00011718695,0.000020520352,0.00011599744,0.00012462857,0.9741732,0.0044831834,0.0054271333,0.000815275,0.014414119],"study_design_scores_gemma":[0.000007684988,0.000016317194,0.00006214291,0.000011757385,0.000007781838,0.00005714024,0.000007136562,0.99614656,0.0009649362,0.0010592093,0.0016504059,0.000008861223],"about_ca_topic_score_codex":0.0059685125,"about_ca_topic_score_gemma":0.0056284848,"teacher_disagreement_score":0.008584868,"about_ca_system_score_codex":0.00052201754,"about_ca_system_score_gemma":0.0007988875,"threshold_uncertainty_score":0.028719187},"labels":[],"label_agreement":null},{"id":"W2108865692","doi":"10.1007/978-3-319-07221-0_23","title":"Beyond Knowledge Tracing: Modeling Skill Topologies with Bayesian Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":63,"is_retracted":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":"Interpretability; Computer science; Network topology; Artificial intelligence; Bayesian network; Machine learning; Hierarchy; Domain knowledge; Bayesian probability; Domain (mathematical analysis); Task (project management); Tracing; Mathematics","score_opus":0.01730247966605262,"score_gpt":0.24128907590184656,"score_spread":0.22398659623579395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108865692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03944752,0.0005488178,0.95554423,0.00058121927,0.000031759064,0.000053707696,0.0003848366,0.00025520645,0.0031528159],"genre_scores_gemma":[0.7752285,0.0015569837,0.2138252,0.00015565494,0.00011458049,0.00026910004,0.0009021169,0.00019372735,0.007754129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998654,0.0006622263,0.000054471424,0.0003442943,0.00015435359,0.00013048535],"domain_scores_gemma":[0.97739136,0.019058708,0.0012968838,0.0010301617,0.0007657725,0.00045714568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037057512,0.00085663906,0.00144528,0.0021373944,0.00080258126,0.003134557,0.0030636964,0.002637065,0.005068934],"category_scores_gemma":[0.0395315,0.0015805312,0.0013774446,0.0029106806,0.0018231076,0.007443178,0.0022102103,0.0034233807,0.0007622481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010519444,0.000063138,0.0030868263,0.000060584334,0.00006500915,0.000055839468,0.00026337776,0.8583093,0.00013324023,0.09630179,0.0010317174,0.04052393],"study_design_scores_gemma":[0.0000063679568,0.000006352345,0.00022224162,0.000016202386,0.000009414274,0.0000120920295,0.000014384079,0.9131093,0.000045616696,0.08626211,0.00028972534,0.0000061933274],"about_ca_topic_score_codex":0.018186444,"about_ca_topic_score_gemma":0.016591249,"teacher_disagreement_score":0.018186444,"about_ca_system_score_codex":0.0018892544,"about_ca_system_score_gemma":0.0012156392,"threshold_uncertainty_score":0.036161184},"labels":[],"label_agreement":null},{"id":"W2108904442","doi":"10.1007/3-540-47867-1_7","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Ottawa","funders":"","keywords":"Travelling salesman problem; Conjecture; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Graph; Relaxation (psychology); Computer science; Exponential function; Combinatorial optimization; Metric (unit); Exact solutions in general relativity; Upper and lower bounds; Mathematics; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.08844292964791423,"score_gpt":0.30615174587006055,"score_spread":0.21770881622214633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108904442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42200232,0.005987627,0.42639253,0.006284885,0.00077467656,0.00018333917,0.0006102663,0.0011147797,0.13664955],"genre_scores_gemma":[0.90631247,0.0023686828,0.07505626,0.0006788234,0.0005447149,0.00025828704,0.0006105319,0.00056609145,0.013604147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990969,0.00023608563,0.000035567537,0.00019809224,0.00023117161,0.00020213512],"domain_scores_gemma":[0.98585284,0.01198095,0.00049119216,0.00054172,0.0004382631,0.00069503806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023173387,0.0013881114,0.002112778,0.0022166627,0.0014223007,0.003149928,0.0034743226,0.0018647246,0.012012307],"category_scores_gemma":[0.023734784,0.0011385705,0.0010990629,0.0019295306,0.003103626,0.0114423325,0.0032569263,0.006442563,0.0008706672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047893904,0.00036083837,0.0012156921,0.000662118,0.000067526635,0.00015739782,0.00050613785,0.050384764,0.002874566,0.8846143,0.009650722,0.049027022],"study_design_scores_gemma":[0.00003647189,0.00004653944,0.00030890087,0.00005736571,0.000032118965,0.00009705815,0.00012720075,0.1022492,0.0007513496,0.8945017,0.0017768067,0.000015403444],"about_ca_topic_score_codex":0.0008585055,"about_ca_topic_score_gemma":0.0007907064,"teacher_disagreement_score":0.012012307,"about_ca_system_score_codex":0.002207727,"about_ca_system_score_gemma":0.0012804619,"threshold_uncertainty_score":0.040185153},"labels":[],"label_agreement":null},{"id":"W2108958132","doi":"10.1007/11788911_17","title":"Efficient Update of Data Warehouse Views with Generalised Referential Integrity Differential Files","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Manitoba","funders":"","keywords":"Computer science; Star schema; Joins; Schema (genetic algorithms); Tuple; Data warehouse; Information retrieval; Information schema; Data source; Database; Data mining; Theoretical computer science; Relational database; Database schema; Programming language; Semi-structured model; Database design; Database model","score_opus":0.043000614226424684,"score_gpt":0.2718704064846981,"score_spread":0.22886979225827345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108958132","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.13161975,0.0014976024,0.8280634,0.00042532157,0.00018839902,0.00028318263,0.0018714595,0.031209426,0.004841402],"genre_scores_gemma":[0.6073511,0.0005197347,0.3819092,0.0001798139,0.00009395378,0.00013551762,0.0032747542,0.0018758635,0.0046599964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711764,0.0005529648,0.0003102419,0.00038205995,0.0013135374,0.0003235628],"domain_scores_gemma":[0.99065393,0.0018411595,0.00038014882,0.0062460895,0.000748278,0.00013045964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031133,0.000705571,0.0014121151,0.0016705355,0.0006423505,0.003114108,0.0034760695,0.0008855167,0.0031693608],"category_scores_gemma":[0.009369641,0.000829008,0.00089499506,0.00376633,0.00093458896,0.0056883395,0.0046665487,0.0011295273,0.0009664375],"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.0022009143,0.0002509567,0.0056427824,0.0006149179,0.00025720857,0.0006673582,0.0011330508,0.039637435,0.05015675,0.02561981,0.022011379,0.8518074],"study_design_scores_gemma":[0.0006468223,0.000664945,0.0060304846,0.00014254158,0.0005578305,0.0017248102,0.0008530457,0.646123,0.22115733,0.0738148,0.048039652,0.00024478984],"about_ca_topic_score_codex":0.002364057,"about_ca_topic_score_gemma":0.0035889563,"teacher_disagreement_score":0.0034760695,"about_ca_system_score_codex":0.0009028638,"about_ca_system_score_gemma":0.0011865862,"threshold_uncertainty_score":0.01074177},"labels":[],"label_agreement":null},{"id":"W2109157377","doi":"10.1007/11589976_13","title":"Synthesizing B Specifications from eb 3 Attribute Definitions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Programming language; Specification language; Formal specification; Language Of Temporal Ordering Specification; Formal methods; Formal language; B-Method; Simple (philosophy); Formal verification; State (computer science); Theoretical computer science","score_opus":0.10859320255770162,"score_gpt":0.2820982728755352,"score_spread":0.17350507031783358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109157377","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.046466902,0.000120074095,0.9293541,0.00015275709,0.00007844835,0.00018156378,0.00037703285,0.0038964662,0.019372756],"genre_scores_gemma":[0.33077994,0.00031041296,0.65070415,0.00021832096,0.000018169621,0.00029844564,0.0010909648,0.002404675,0.01417489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.0002042804,0.000071378796,0.00009154352,0.00032133222,0.00010208688],"domain_scores_gemma":[0.99849164,0.00087135454,0.00008260136,0.0002739361,0.00023499271,0.000045455516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475223,0.00048826676,0.00033075886,0.0007527023,0.00041288667,0.0015616749,0.00073072646,0.0008216004,0.006716936],"category_scores_gemma":[0.0035491805,0.0007043083,0.0007167531,0.00057217316,0.0007184617,0.0013552901,0.0014462969,0.0010694335,0.0018048527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039694482,0.00015385542,0.0024275375,0.00073952513,0.00006254641,0.0011287283,0.0015735126,0.06466144,0.17787234,0.49712607,0.007374085,0.24648343],"study_design_scores_gemma":[0.0001935104,0.0002494783,0.001025592,0.000324691,0.000115738156,0.00064196467,0.0007531789,0.21850875,0.41599238,0.22322577,0.13887447,0.000094435796],"about_ca_topic_score_codex":0.0023597786,"about_ca_topic_score_gemma":0.003285857,"teacher_disagreement_score":0.006716936,"about_ca_system_score_codex":0.00052577024,"about_ca_system_score_gemma":0.0010362694,"threshold_uncertainty_score":0.022470415},"labels":[],"label_agreement":null},{"id":"W2109220404","doi":"10.1007/978-3-642-21869-9_65","title":"Physiological Evaluation of Attention Getting Strategies during Serious Game Play","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mind wandering and attention","field":"Neuroscience","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é de Montréal","funders":"","keywords":"Computer science; Electroencephalography; Skin conductance; Artificial intelligence; Human–computer interaction; Machine learning; Psychology; Neuroscience; Medicine","score_opus":0.06747854724535972,"score_gpt":0.29127475033188527,"score_spread":0.22379620308652554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109220404","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.98421985,0.0012329437,0.0062887957,0.00007273477,0.00010793983,0.0004062912,0.0016164369,0.00011950129,0.00593546],"genre_scores_gemma":[0.9922616,0.0006604098,0.0026058734,0.0001667747,0.00006602665,0.00044987316,0.0005958408,0.00007783596,0.0031158535],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99970466,0.000060280436,0.000014191743,0.00008652876,0.00007775956,0.00005657727],"domain_scores_gemma":[0.99946517,0.00024462093,0.00007223606,0.000035110497,0.00008753912,0.00009536143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025862633,0.0005867299,0.00051323953,0.00037335543,0.00023209302,0.00065142376,0.00029947583,0.0004289322,0.0034400309],"category_scores_gemma":[0.0021215472,0.00027604602,0.00021817029,0.0004416384,0.00046031995,0.00021579237,0.0004206201,0.0007414787,0.00051832746],"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.011360115,0.0008949656,0.031489406,0.0006599132,0.00037964134,0.0003981661,0.0019221462,0.00045062788,0.880587,0.0006983815,0.0014740642,0.06968557],"study_design_scores_gemma":[0.00018728357,0.0046386896,0.94584525,0.0000850675,0.000252907,0.000863733,0.0006074447,0.002570831,0.0427326,0.00050442206,0.0016751376,0.00003658973],"about_ca_topic_score_codex":0.001875082,"about_ca_topic_score_gemma":0.0021965078,"teacher_disagreement_score":0.0034400309,"about_ca_system_score_codex":0.00016101157,"about_ca_system_score_gemma":0.0002508058,"threshold_uncertainty_score":0.011508048},"labels":[],"label_agreement":null},{"id":"W2109248581","doi":"10.1007/978-3-540-87779-0_41","title":"Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Spin (aerodynamics); Algorithm; Physics; Theoretical computer science","score_opus":0.01660293086506761,"score_gpt":0.2428399060668806,"score_spread":0.226236975201813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109248581","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.008445461,0.10637247,0.27057135,0.10862889,0.25190318,0.0005430223,0.002645908,0.006128082,0.24476166],"genre_scores_gemma":[0.08376035,0.059754044,0.08486323,0.016951872,0.14457239,0.00064591167,0.006896962,0.0024325638,0.6001227],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.00027161796,0.000058429912,0.00019174918,0.00040041786,0.00012626965],"domain_scores_gemma":[0.9976707,0.0012223161,0.00007749249,0.00022109055,0.00057783735,0.00023041294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017179446,0.0013169233,0.001303356,0.0011959734,0.0014724545,0.0029593713,0.0022949032,0.0031169786,0.052857798],"category_scores_gemma":[0.0050365627,0.00073697965,0.00074456906,0.0032564278,0.001078715,0.0065641655,0.0009733309,0.0046808845,0.016005106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010689422,0.00011292994,0.000091649636,0.00044179638,0.000018775367,0.00005224649,0.000059291462,0.0012437053,0.00065057323,0.052176565,0.8128279,0.13221769],"study_design_scores_gemma":[0.000097059776,0.0002504142,0.000545179,0.00020617199,0.000052932934,0.00030231336,0.00010295105,0.010153713,0.0020961494,0.16633308,0.81977975,0.000080315884],"about_ca_topic_score_codex":0.0010623514,"about_ca_topic_score_gemma":0.0022210893,"teacher_disagreement_score":0.052857798,"about_ca_system_score_codex":0.0015669849,"about_ca_system_score_gemma":0.0011778247,"threshold_uncertainty_score":0.17682695},"labels":[],"label_agreement":null},{"id":"W2109446578","doi":"10.1007/978-3-642-13681-8_40","title":"Turbo Code Using Adaptive Puncturing for Pixel Domain Distributed Video Coding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Communications Research Centre Canada; Université Laval","funders":"","keywords":"Puncturing; Computer science; Encoder; Parity bit; Turbo code; Distributed source coding; Coding (social sciences); Decoding methods; Algorithm; Coding tree unit; Codec; Real-time computing; Theoretical computer science; Computer engineering; Variable-length code; Computer hardware; Telecommunications; Mathematics","score_opus":0.027385590623205808,"score_gpt":0.2580633238110887,"score_spread":0.2306777331878829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109446578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115942005,0.00043916187,0.98438466,0.0000863496,0.00008212331,0.000026359563,0.000029651497,0.0004415948,0.002915859],"genre_scores_gemma":[0.4276494,0.0009391347,0.55767137,0.00015852448,0.00017690434,0.00009650805,0.00015096882,0.00018302958,0.012974153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.00006285416,0.000011958861,0.000028471244,0.00011555645,0.000021672962],"domain_scores_gemma":[0.99937075,0.000283368,0.00003225806,0.00014003472,0.00015696597,0.000016615213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031229143,0.0003688213,0.00035550198,0.0003576867,0.00024051854,0.00044907417,0.00056837243,0.00071116426,0.0021840567],"category_scores_gemma":[0.0014074858,0.0001826137,0.0002978951,0.0005940871,0.00044179545,0.00062004727,0.00053596083,0.0007906751,0.0007981521],"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.00054480025,0.00008811752,0.00059465406,0.00028863346,0.00008075452,0.00047999562,0.00017306724,0.12532061,0.19500726,0.12875398,0.005923693,0.5427444],"study_design_scores_gemma":[0.000039909468,0.00017296166,0.00043540943,0.000039362174,0.000034995024,0.000720316,0.000012097578,0.8965231,0.075000994,0.020203881,0.0067802723,0.000036688183],"about_ca_topic_score_codex":0.0006312308,"about_ca_topic_score_gemma":0.0010354251,"teacher_disagreement_score":0.0021840567,"about_ca_system_score_codex":0.0003462998,"about_ca_system_score_gemma":0.00048504645,"threshold_uncertainty_score":0.007306397},"labels":[],"label_agreement":null},{"id":"W2109550637","doi":"10.1007/3-540-45404-7_22","title":"Surface Expansion from Range Data Sequences","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Western University","funders":"","keywords":"Computer science; Range (aeronautics); Sequence (biology); Vector field; Grid; Algorithm; Surface (topology); Constraint (computer-aided design); Field (mathematics); Process (computing); Set (abstract data type); Mathematics; Geometry","score_opus":0.048830713180016916,"score_gpt":0.30116237008126656,"score_spread":0.25233165690124965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109550637","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.010732035,0.00032231695,0.98381793,0.00010209736,0.00006052807,0.000040883424,0.00019722634,0.0013530166,0.0033740038],"genre_scores_gemma":[0.17064528,0.0018772234,0.80917335,0.00010913753,0.00016501607,0.00010539084,0.0020955047,0.0008588774,0.0149701275],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999796,0.000023403913,0.0000075773564,0.000033633565,0.00012061322,0.000018785498],"domain_scores_gemma":[0.99969554,0.00011495125,0.000022487471,0.0000777587,0.00007158305,0.000017681401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022359431,0.00079446915,0.0006488604,0.0011761396,0.0001592974,0.0006233135,0.0005257151,0.00056378497,0.005068504],"category_scores_gemma":[0.0010588398,0.00044084445,0.00049399637,0.0015611746,0.00038768505,0.0011741817,0.0010904243,0.0010062573,0.002468853],"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.00014260304,0.00003619474,0.00024319415,0.0002543886,0.000023868773,0.00022604397,0.00011073763,0.06978085,0.117195025,0.017761651,0.0071854163,0.7870401],"study_design_scores_gemma":[0.000013222205,0.000058031692,0.0007301501,0.00003368901,0.000015668475,0.0005559506,0.000054898468,0.9265113,0.041305117,0.01770865,0.012991524,0.00002180385],"about_ca_topic_score_codex":0.0009723943,"about_ca_topic_score_gemma":0.0013082686,"teacher_disagreement_score":0.005068504,"about_ca_system_score_codex":0.0001689676,"about_ca_system_score_gemma":0.0002169216,"threshold_uncertainty_score":0.016955853},"labels":[],"label_agreement":null},{"id":"W2109571426","doi":"10.1007/978-3-642-34123-6_4","title":"A Framework of Gene Subset Selection Using Multiobjective Evolutionary Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Gene selection; Computer science; Discriminative model; Feature selection; Curse of dimensionality; Minimum redundancy feature selection; Redundancy (engineering); Evolutionary algorithm; Selection (genetic algorithm); Artificial intelligence; Machine learning; Data mining; Algorithm; Gene; Microarray analysis techniques; Gene expression; Biology; Genetics","score_opus":0.018385945462680853,"score_gpt":0.27573146987199576,"score_spread":0.2573455244093149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109571426","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.0034773245,0.00030903568,0.9949169,0.000047159152,0.000023414193,0.000029230252,0.000015818014,0.000108306296,0.0010728257],"genre_scores_gemma":[0.12603523,0.00062081334,0.869977,0.00009719223,0.00007184435,0.00035193595,0.00013905557,0.00009339686,0.0026135582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946815,0.0001956143,0.000025250078,0.000099436445,0.00016525039,0.00004629254],"domain_scores_gemma":[0.999747,0.000118638425,0.000017304785,0.000023365303,0.00007687169,0.000016845468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012248433,0.0009653134,0.0015986825,0.0011804816,0.0006196384,0.0010824343,0.002342662,0.0011341803,0.0016576761],"category_scores_gemma":[0.0011151694,0.00048163478,0.0011003708,0.0016172434,0.00059056043,0.0007485521,0.0013237756,0.00082449114,0.00034839177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036351175,0.000061472536,0.00041177514,0.000090820715,0.00009171871,0.00010560777,0.00007283507,0.85724676,0.004243867,0.029008072,0.0011009653,0.10752977],"study_design_scores_gemma":[0.000007746064,0.000024827645,0.000065929,0.000006415505,0.000013245528,0.000023546256,0.0000057470443,0.9941645,0.00030319733,0.004719912,0.0006602162,0.000004671013],"about_ca_topic_score_codex":0.002418751,"about_ca_topic_score_gemma":0.0017681271,"teacher_disagreement_score":0.002418751,"about_ca_system_score_codex":0.00060297933,"about_ca_system_score_gemma":0.0010049078,"threshold_uncertainty_score":0.006477654},"labels":[],"label_agreement":null},{"id":"W2109628644","doi":"10.1007/978-3-642-04268-3_27","title":"A Statistical Model of Right Ventricle in Tetralogy of Fallot for Prediction of Remodelling and Therapy Planning","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Congenital Heart Disease Studies","field":"Medicine","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"European Commission","keywords":"Tetralogy of Fallot; Ventricle; Cardiology; Pulmonary valve; Internal medicine; Medicine; Multivariate statistics; Computer science; Machine learning; Heart disease","score_opus":0.033914406306919706,"score_gpt":0.3085480460475471,"score_spread":0.2746336397406274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109628644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4152283,0.0007466685,0.5781017,0.0016823154,0.00016566624,0.00007865608,0.0019450671,0.0008030854,0.0012484523],"genre_scores_gemma":[0.98426473,0.00028527857,0.011982047,0.000098622266,0.00012021098,0.00010366264,0.0010959294,0.00003765119,0.0020117466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999503,0.00017665685,0.000033045144,0.00013260279,0.00007406545,0.000080628175],"domain_scores_gemma":[0.995413,0.003653509,0.00031824608,0.00015798435,0.00030911516,0.00014811562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020232257,0.0006057529,0.0012941739,0.0010114001,0.0003773252,0.0009226834,0.0013358899,0.0012635461,0.0014585006],"category_scores_gemma":[0.0053698295,0.0005900124,0.0011718152,0.0006805689,0.00058473623,0.00061112654,0.0005448296,0.0010447238,0.0005068482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013004658,0.00008169632,0.0074211815,0.000018270053,0.00007841582,0.00011117863,0.000028288796,0.97523844,0.000895153,0.0025533156,0.0006338173,0.012810178],"study_design_scores_gemma":[0.000006050431,0.000025791682,0.0012218227,0.000002184125,0.000010150042,0.000022890732,0.0000029379655,0.99755955,0.00007106515,0.0010264592,0.000044902627,0.000006115111],"about_ca_topic_score_codex":0.014863405,"about_ca_topic_score_gemma":0.012215046,"teacher_disagreement_score":0.014863405,"about_ca_system_score_codex":0.00074138114,"about_ca_system_score_gemma":0.0012620968,"threshold_uncertainty_score":0.029553771},"labels":[],"label_agreement":null},{"id":"W2109761230","doi":"10.1007/978-3-642-13772-3_2","title":"Structural Similarity-Based Approximation of Signals and Images Using Orthogonal Bases","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthonormal basis; Similarity (geometry); Representation (politics); Computer science; Algorithm; Basis (linear algebra); Basis function; Approximation error; Simple (philosophy); Image quality; Mean squared error; Scaling; Mathematics; Image (mathematics); Artificial intelligence; Pattern recognition (psychology); Statistics; Mathematical analysis","score_opus":0.03713553090442003,"score_gpt":0.30094652128357213,"score_spread":0.2638109903791521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109761230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006124298,0.00011485775,0.99307126,0.000025583175,0.000022901377,0.000012922162,0.000015085007,0.00009920421,0.0005140483],"genre_scores_gemma":[0.158419,0.0008046283,0.8376189,0.000050973078,0.00008469364,0.00007478194,0.000286897,0.00010161318,0.0025586414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995772,0.00009083356,0.000023806835,0.00006143486,0.00021387528,0.00003278942],"domain_scores_gemma":[0.99940526,0.00022165962,0.00005533427,0.00010995889,0.00018014992,0.000027722477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006122983,0.0006021598,0.0008402758,0.0009166708,0.0002142682,0.0009687985,0.0008116713,0.00070789893,0.0016258778],"category_scores_gemma":[0.0022013455,0.0003782571,0.00079235825,0.0015625077,0.0004302006,0.0014433551,0.00089711195,0.0011124866,0.000756417],"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.00033855363,0.00016013447,0.0005508897,0.00020966656,0.00008831851,0.00008155976,0.00014464598,0.18326367,0.086706206,0.05050213,0.0023085393,0.6756457],"study_design_scores_gemma":[0.00001183446,0.000079919904,0.00027118105,0.000009741503,0.000021232723,0.000117542455,0.000020811503,0.9814581,0.010362471,0.006262056,0.0013726539,0.000012520773],"about_ca_topic_score_codex":0.0012121756,"about_ca_topic_score_gemma":0.0012614237,"teacher_disagreement_score":0.0016258778,"about_ca_system_score_codex":0.00030793677,"about_ca_system_score_gemma":0.00049603666,"threshold_uncertainty_score":0.005439043},"labels":[],"label_agreement":null},{"id":"W2109807035","doi":"10.1007/3-540-45071-8_29","title":"Perturbation of the Hyper-Linked Environment","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; PageRank; Stability (learning theory); Link (geometry); Link analysis; Perturbation (astronomy); Data mining; Theoretical computer science; Algorithm; Machine learning; Computer network","score_opus":0.01148093721732509,"score_gpt":0.21841780307538025,"score_spread":0.20693686585805515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109807035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4229174,0.0007671742,0.5115381,0.0019713677,0.00046089687,0.00011022687,0.0005081648,0.00064459303,0.061082084],"genre_scores_gemma":[0.942088,0.00070545496,0.027445529,0.00036072457,0.00028988832,0.00011679454,0.00023097635,0.00017940128,0.028583279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964166,0.00012459261,0.000008749459,0.00007329509,0.00009462186,0.000057084064],"domain_scores_gemma":[0.9979545,0.00082600437,0.00027978577,0.00021710813,0.00021694503,0.0005055286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045949,0.000491548,0.00054235087,0.0013797968,0.00094094296,0.0014343256,0.0012787569,0.001054252,0.0077057146],"category_scores_gemma":[0.004428603,0.00038573195,0.00044889335,0.0008585476,0.0013135693,0.0025300232,0.0015758646,0.0012521817,0.0007038913],"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.0002197966,0.00011377197,0.0007439999,0.000092524184,0.00005386352,0.0002839074,0.00017318052,0.14335369,0.010723274,0.82809335,0.0039488776,0.012199649],"study_design_scores_gemma":[0.000029528606,0.000047880272,0.00069033756,0.000012115823,0.000014902234,0.0001356277,0.000086141685,0.42133862,0.0013671572,0.57415366,0.0020984297,0.000025584994],"about_ca_topic_score_codex":0.0014059378,"about_ca_topic_score_gemma":0.001101768,"teacher_disagreement_score":0.0077057146,"about_ca_system_score_codex":0.0007115595,"about_ca_system_score_gemma":0.00055283477,"threshold_uncertainty_score":0.025778174},"labels":[],"label_agreement":null},{"id":"W2109823739","doi":"10.1007/978-3-642-29627-7_10","title":"Evolution of Genome Organization by Duplication and Loss: An Alignment Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McGill University; Université de Montréal","funders":"","keywords":"Genome; Gene duplication; Heuristic; Phylogenetic tree; Computational biology; Gene; Biology; Comparative genomics; Computer science; Genome evolution; Genomics; Genetics; Algorithm; Artificial intelligence","score_opus":0.007321950418532535,"score_gpt":0.20728510171778303,"score_spread":0.1999631512992505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109823739","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.20727523,0.007977104,0.7656491,0.0017858,0.0002126389,0.000100440244,0.0009049796,0.0008530681,0.015241741],"genre_scores_gemma":[0.59428644,0.006532105,0.39110073,0.0005086692,0.0002024904,0.00015803671,0.0017505134,0.0008449388,0.0046161623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920887,0.00026960886,0.000042384072,0.00029597216,0.0001262015,0.000056978708],"domain_scores_gemma":[0.9987935,0.00064582366,0.0002220324,0.00018196637,0.000091026115,0.00006550696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016736973,0.00064478285,0.0013383159,0.002302188,0.00087602885,0.002317136,0.0017386418,0.0011399563,0.0026083481],"category_scores_gemma":[0.004551646,0.00084273063,0.0012488841,0.005496735,0.0012354503,0.00362435,0.001317877,0.0023425329,0.000914771],"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.001059974,0.00027831135,0.029993728,0.0011139967,0.0010619131,0.0012007729,0.0021545843,0.18123417,0.07566727,0.2162192,0.0057850988,0.48423102],"study_design_scores_gemma":[0.00014823349,0.00039277461,0.02577727,0.00017811223,0.00059186935,0.0015933767,0.0007862999,0.45251995,0.010864461,0.4848129,0.022188222,0.00014656366],"about_ca_topic_score_codex":0.0012821832,"about_ca_topic_score_gemma":0.001364744,"teacher_disagreement_score":0.0026083481,"about_ca_system_score_codex":0.0009734283,"about_ca_system_score_gemma":0.00063037203,"threshold_uncertainty_score":0.008851469},"labels":[],"label_agreement":null},{"id":"W2109864447","doi":"10.1007/978-3-540-69057-3_45","title":"The Effects of Hand Motion on Haptic Perception of Force Direction","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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 Alberta","funders":"","keywords":"Haptic technology; Haptic perception; Perception; Movement (music); Computer science; Motion (physics); Computer vision; Artificial intelligence; Simulation; Acoustics; Physics; Psychology","score_opus":0.01935923853252627,"score_gpt":0.2539214594206455,"score_spread":0.2345622208881192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109864447","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.9234531,0.013404907,0.018263992,0.00048128623,0.00032315683,0.000094039024,0.00059575227,0.00020238699,0.043181393],"genre_scores_gemma":[0.9836638,0.0037887136,0.0038355608,0.00013811437,0.00010023827,0.000045478653,0.00013006892,0.00008938687,0.0082085915],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999884,0.000026818914,0.0000060459465,0.000021764981,0.00003977722,0.000021510015],"domain_scores_gemma":[0.99845827,0.0013835671,0.00004730743,0.000039504226,0.00002998252,0.000041366682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032519642,0.00051141897,0.0002962414,0.00022188111,0.00016750286,0.0005812055,0.000373948,0.0005202221,0.011191258],"category_scores_gemma":[0.0034262647,0.0004697521,0.0003296344,0.0002189624,0.00055829796,0.0007532362,0.00040961802,0.00059402286,0.0006189537],"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.0033769906,0.00006911328,0.00046182756,0.000368299,0.000028799714,0.00034536349,0.00022413065,0.00068222644,0.9355721,0.0014148765,0.00048260242,0.056973666],"study_design_scores_gemma":[0.0009893777,0.0035653608,0.40237194,0.00042634518,0.00040784563,0.005935837,0.0006449385,0.020151256,0.52838254,0.02389229,0.013045674,0.00018658667],"about_ca_topic_score_codex":0.0006513539,"about_ca_topic_score_gemma":0.0004582808,"teacher_disagreement_score":0.011191258,"about_ca_system_score_codex":0.00013660907,"about_ca_system_score_gemma":0.00015727781,"threshold_uncertainty_score":0.037438452},"labels":[],"label_agreement":null},{"id":"W2110045670","doi":"10.1007/11674399_7","title":"An Improved Safety Solver for Computer Go","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Heuristics; Solver; Computer science; Problem solver; Position (finance); Function (biology); Algorithm; Mathematical optimization; Computational science; Mathematics; Programming language","score_opus":0.021593454050595744,"score_gpt":0.27291674599836024,"score_spread":0.2513232919477645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110045670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011091909,0.00015011754,0.9456417,0.0006106135,0.00026510653,0.00026485987,0.0005177571,0.008120735,0.033337206],"genre_scores_gemma":[0.21175694,0.00023325713,0.7406916,0.000821355,0.00018987014,0.0005045098,0.0018819883,0.0024487406,0.041471664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876934,0.00025157232,0.00008115949,0.00025361552,0.0004330498,0.00021125701],"domain_scores_gemma":[0.998621,0.00071327726,0.000059867354,0.00027980047,0.00026623285,0.000059921676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011275895,0.0014539985,0.0011188036,0.0011627953,0.0012158516,0.00168141,0.0029370442,0.0016428307,0.03155714],"category_scores_gemma":[0.0040392284,0.000729144,0.0017649822,0.0010179761,0.0011765071,0.003043403,0.003906127,0.003966571,0.0055312975],"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.0007773384,0.0005037345,0.0006309569,0.0007635653,0.00012286758,0.00033508512,0.00046414277,0.106547505,0.010001886,0.41503844,0.050394103,0.41442043],"study_design_scores_gemma":[0.00033773246,0.00014195619,0.000162088,0.00008911232,0.00010720977,0.00013551718,0.00013278659,0.5143045,0.010206664,0.43654785,0.037798975,0.00003556522],"about_ca_topic_score_codex":0.0027795183,"about_ca_topic_score_gemma":0.006016845,"teacher_disagreement_score":0.03155714,"about_ca_system_score_codex":0.0010502037,"about_ca_system_score_gemma":0.0022315565,"threshold_uncertainty_score":0.105569184},"labels":[],"label_agreement":null},{"id":"W2110116210","doi":"10.1007/11424918_31","title":"Incorporating Evidence in Bayesian Networks with the Select Operator","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Bayesian network; Operator (biology); Probabilistic logic; Relational database; Bayesian probability; Knowledge base; Expert system; Artificial intelligence; Data mining; Theoretical computer science; Machine learning","score_opus":0.025179498417776867,"score_gpt":0.24842414446488875,"score_spread":0.2232446460471119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110116210","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.0027571125,0.00052884605,0.99476385,0.00033792862,0.000027239996,0.000017070284,0.000058746045,0.0000906191,0.0014186965],"genre_scores_gemma":[0.2955961,0.0034465468,0.6912973,0.00039691592,0.0005944508,0.00037427526,0.0004503183,0.00029379386,0.007550322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961222,0.002614381,0.00016675318,0.0004308497,0.0005387059,0.00012713976],"domain_scores_gemma":[0.9745705,0.02282936,0.00076750765,0.00092430844,0.0006148171,0.00029352086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009529221,0.001339861,0.002305124,0.0018370468,0.00086047995,0.0036488792,0.003012495,0.0023352958,0.004305786],"category_scores_gemma":[0.0317179,0.001845575,0.0017516544,0.00265661,0.0030701272,0.00965831,0.003342251,0.0047098543,0.0006407388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114524686,0.000040588417,0.00045992417,0.00018368539,0.00010343681,0.00010616882,0.00017599188,0.2677264,0.00035753305,0.6830136,0.0016585235,0.04605967],"study_design_scores_gemma":[0.000016713444,0.0000126033665,0.00005498712,0.00002380721,0.000025900881,0.000022637756,0.000009207981,0.44203377,0.00015523362,0.55663323,0.0009973679,0.0000144800415],"about_ca_topic_score_codex":0.004387708,"about_ca_topic_score_gemma":0.004541645,"teacher_disagreement_score":0.009529221,"about_ca_system_score_codex":0.0015618852,"about_ca_system_score_gemma":0.001513014,"threshold_uncertainty_score":0.050395906},"labels":[],"label_agreement":null},{"id":"W2110395857","doi":"10.1007/978-3-540-30469-2_21","title":"Performance Evaluation of JXTA Rendezvous","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rendezvous; Computer science; Scalability; Distributed computing; Computer network; Peer-to-peer; Cache; Overlay network; Database; Operating system; The Internet","score_opus":0.02998033245907782,"score_gpt":0.2666480941658179,"score_spread":0.2366677617067401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110395857","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.95805335,0.0017918772,0.010968171,0.00024183458,0.00036687526,0.0001176281,0.0006868417,0.012560507,0.015212977],"genre_scores_gemma":[0.9879552,0.00021490529,0.0060885274,0.000035202913,0.000053435622,0.000028351582,0.0011411613,0.0004791814,0.0040041017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972729,0.00050584,0.00017077058,0.00047660896,0.0011061623,0.00046769524],"domain_scores_gemma":[0.99475175,0.0023033335,0.00023396748,0.0008760925,0.0013982239,0.0004366226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018496475,0.0010176688,0.001111738,0.0012070162,0.001395507,0.0017342832,0.0017595876,0.00097061764,0.005998729],"category_scores_gemma":[0.006026963,0.00035083553,0.00028891038,0.0011915881,0.0007413279,0.0015775671,0.0010828495,0.0007739507,0.0014308903],"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.034369778,0.002295906,0.02344975,0.0016566522,0.0008248606,0.0010694962,0.0012778336,0.31226563,0.2266919,0.008287595,0.032113608,0.35569698],"study_design_scores_gemma":[0.0011017367,0.0036698314,0.0150182955,0.000052105574,0.00030022228,0.00067048566,0.0008556975,0.8298101,0.13637404,0.0014972497,0.010508886,0.0001414933],"about_ca_topic_score_codex":0.008053759,"about_ca_topic_score_gemma":0.005349537,"teacher_disagreement_score":0.008053759,"about_ca_system_score_codex":0.0008633726,"about_ca_system_score_gemma":0.0008207948,"threshold_uncertainty_score":0.020067751},"labels":[],"label_agreement":null},{"id":"W2110484413","doi":"10.1007/978-3-540-85988-8_17","title":"Streamline Flows for White Matter Fibre Pathway Segmentation in Diffusion MRI","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Voxel; Tractography; Computer science; Segmentation; Diffusion MRI; Artificial intelligence; White matter; Pairwise comparison; Consistency (knowledge bases); Algorithm; Pattern recognition (psychology); Computer vision; Magnetic resonance imaging","score_opus":0.031290538802596725,"score_gpt":0.31535869955669005,"score_spread":0.2840681607540933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110484413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009302349,0.00027862954,0.98778766,0.000106997155,0.00002940276,0.00007802396,0.00022563418,0.0019155253,0.0002758034],"genre_scores_gemma":[0.081716575,0.0006108924,0.9148522,0.00003719739,0.00007563724,0.0001712105,0.00043447802,0.00056647055,0.0015353381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976236,0.000065819615,0.000018433942,0.00005424686,0.00007046385,0.000028677121],"domain_scores_gemma":[0.9978656,0.0012927274,0.000177288,0.00013364661,0.0004129447,0.00011794992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015643047,0.0012472318,0.001134343,0.0033956135,0.0010638842,0.0019137347,0.0011762853,0.0017358771,0.0041619614],"category_scores_gemma":[0.0046441555,0.0010511867,0.0010286405,0.0020930008,0.0007153176,0.0019675358,0.0010649784,0.0014557268,0.0013255582],"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.000770245,0.00014636615,0.002432035,0.00041339052,0.0001024809,0.00017301216,0.00042400623,0.20592485,0.026207624,0.022231814,0.010044083,0.7311301],"study_design_scores_gemma":[0.000019631556,0.000026842652,0.00026025614,0.000020043282,0.000012125556,0.000047534046,0.000022834462,0.98314637,0.006735139,0.008111931,0.0015815697,0.000015678412],"about_ca_topic_score_codex":0.012374014,"about_ca_topic_score_gemma":0.010201184,"teacher_disagreement_score":0.012374014,"about_ca_system_score_codex":0.0010743334,"about_ca_system_score_gemma":0.0021235875,"threshold_uncertainty_score":0.024603963},"labels":[],"label_agreement":null},{"id":"W2110516820","doi":"10.1007/978-3-540-85990-1_49","title":"Models of Normal Variation and Local Contrasts in Hippocampal Anatomy","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","field":"Mathematics","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":"Université de Montréal","funders":"National Center for Research Resources; National Institutes of Health; National Science Foundation","keywords":"Geodesic; Computer science; Metric (unit); Hippocampal formation; Variation (astronomy); Visualization; Shape analysis (program analysis); Artificial intelligence; Anatomy; Pattern recognition (psychology); Geometry; Neuroscience; Mathematics; Biology; Static analysis; Physics","score_opus":0.027349652771430935,"score_gpt":0.27120176399321505,"score_spread":0.24385211122178413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110516820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29424083,0.00095514447,0.6880478,0.0025784299,0.00009245881,0.00004035272,0.00033739043,0.00044347148,0.013264128],"genre_scores_gemma":[0.97421855,0.00038765738,0.016572567,0.00010716116,0.0001066518,0.00005173432,0.0001375806,0.0001877153,0.008230506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992799,0.0003347281,0.000025856572,0.00015313369,0.00010087359,0.000105490224],"domain_scores_gemma":[0.99394244,0.0043307752,0.0005505083,0.00039338067,0.00043815406,0.00034470932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029427118,0.00070220587,0.0010980499,0.0015163291,0.0005529541,0.0019751189,0.0023982362,0.001822842,0.003147816],"category_scores_gemma":[0.01289719,0.00082238246,0.0013519368,0.0009092981,0.0029997248,0.0034511907,0.0015518677,0.0017697328,0.00037328264],"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.00009572513,0.000020209747,0.0011969152,0.00003278486,0.000032821714,0.00013056652,0.00018501123,0.4039002,0.00088470516,0.58542633,0.0011791182,0.0069156205],"study_design_scores_gemma":[0.000011935985,0.000013518743,0.0005367716,0.000004611674,0.00001028136,0.000092851085,0.000028171477,0.68767613,0.00009408843,0.31118447,0.0003310883,0.000016100084],"about_ca_topic_score_codex":0.007435918,"about_ca_topic_score_gemma":0.0052609346,"teacher_disagreement_score":0.007435918,"about_ca_system_score_codex":0.00189861,"about_ca_system_score_gemma":0.00078581943,"threshold_uncertainty_score":0.015562713},"labels":[],"label_agreement":null},{"id":"W2110579213","doi":"10.1007/978-3-642-16587-0_59","title":"Manipulating a Micro Stream by ‘Hydro Tweezers’ for Integration of Nanodevices","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Microfluidic and Capillary Electrophoresis Applications","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":"Western University","funders":"","keywords":"Nanowire; Nanotechnology; Tweezers; Nanoscopic scale; Computer science; Position (finance); Materials science; Electrical engineering; Engineering","score_opus":0.010093256259173948,"score_gpt":0.22094445129950616,"score_spread":0.2108511950403322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110579213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3971042,0.023210766,0.5258745,0.0012950365,0.0017573293,0.00027843888,0.0003622251,0.0022955541,0.04782194],"genre_scores_gemma":[0.6010628,0.010400657,0.32551134,0.00038385423,0.00034460227,0.00022723706,0.0004169449,0.0004470778,0.061205532],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984574,0.0000073673486,0.000010153628,0.00003233017,0.0000870786,0.000017230328],"domain_scores_gemma":[0.9999372,0.000024090528,0.000012562411,0.000011129594,0.000009894204,0.00000513423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001373849,0.0003628458,0.00031026424,0.0002303907,0.00022761385,0.0004811773,0.0007787703,0.000475253,0.001918725],"category_scores_gemma":[0.00016984681,0.00044552388,0.00022096255,0.00029211774,0.00033349684,0.0010386122,0.0005870613,0.00070704205,0.0007991007],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018723389,0.000019028583,0.000054194614,0.00014522996,0.000005893605,0.000085777734,0.00009229292,0.00033928148,0.9690479,0.0038604897,0.0008227398,0.02550843],"study_design_scores_gemma":[0.000008561373,0.00006235851,0.00024276224,0.000010998179,0.00001068331,0.00021867351,0.000019338888,0.0049552643,0.95869184,0.00091446063,0.034851708,0.0000134138745],"about_ca_topic_score_codex":0.00014073768,"about_ca_topic_score_gemma":0.00048185774,"teacher_disagreement_score":0.001918725,"about_ca_system_score_codex":0.00026608005,"about_ca_system_score_gemma":0.00013534438,"threshold_uncertainty_score":0.006418824},"labels":[],"label_agreement":null},{"id":"W2110815577","doi":"10.1007/978-3-540-24598-8_43","title":"Performance Gestures of Musicians: What Structural and Emotional Information Do They Convey?","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroscience and Music Perception","field":"Neuroscience","cited_by":78,"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":"Gesture; Computer science; Loudness; Perception; Phrase; Speech recognition; Component (thermodynamics); Affect (linguistics); Musical; Cognitive psychology; Human–computer interaction; Artificial intelligence; Psychology; Computer vision; Communication","score_opus":0.018824931411669816,"score_gpt":0.24077205610266839,"score_spread":0.22194712469099856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110815577","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.9044329,0.007104633,0.01401066,0.0016257579,0.00024745785,0.00007177847,0.0008322312,0.00021279005,0.07146176],"genre_scores_gemma":[0.9832162,0.003012751,0.005560235,0.0002144005,0.00020325609,0.0000530843,0.00041441392,0.00011387323,0.007211671],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99969983,0.000074578435,0.000015569094,0.00005020984,0.00008210124,0.00007772293],"domain_scores_gemma":[0.9992593,0.0003081424,0.0001718591,0.00005061734,0.000118312506,0.00009177021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004293617,0.0004793146,0.00038839143,0.00056956796,0.00053895975,0.0016343178,0.0003477769,0.0009876837,0.006878104],"category_scores_gemma":[0.0054871403,0.000270873,0.0003081576,0.0007328088,0.00078021584,0.0016447431,0.0007129272,0.0006711237,0.0015880443],"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.0024208722,0.00011723957,0.076254115,0.001280245,0.00014773353,0.0012262599,0.01563502,0.0009253392,0.3512521,0.009859183,0.005755963,0.5351259],"study_design_scores_gemma":[0.0000815802,0.0006471006,0.92562824,0.0009093026,0.00028934114,0.002878239,0.018408576,0.004348891,0.024192348,0.008816929,0.013664035,0.00013532414],"about_ca_topic_score_codex":0.0011133415,"about_ca_topic_score_gemma":0.0019978182,"teacher_disagreement_score":0.006878104,"about_ca_system_score_codex":0.00023096475,"about_ca_system_score_gemma":0.0002577151,"threshold_uncertainty_score":0.023009539},"labels":[],"label_agreement":null},{"id":"W2110994944","doi":"10.1007/978-3-540-72990-7_89","title":"Algorithms for Designing WDM Networks and Grooming the Traffic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"Polytechnique Montréal","funders":"","keywords":"Traffic grooming; Wavelength-division multiplexing; Tabu search; Computer science; Heuristic; Node (physics); Routing (electronic design automation); Computer network; Network topology; Topology (electrical circuits); Set (abstract data type); Distributed computing; Mathematical optimization; Algorithm; Mathematics; Engineering; Wavelength; Combinatorics; Artificial intelligence","score_opus":0.02254709580145196,"score_gpt":0.24414029960991177,"score_spread":0.22159320380845982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110994944","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.0015168801,0.0002681128,0.9950867,0.000110383895,0.000043607557,0.00007204338,0.000040322666,0.00026336923,0.0025986163],"genre_scores_gemma":[0.023179272,0.000646249,0.9730977,0.00007452137,0.00005645633,0.00021939256,0.00013383423,0.000116612224,0.0024759842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927086,0.00019005244,0.000058578273,0.00014281004,0.00026492195,0.00007272352],"domain_scores_gemma":[0.9982705,0.00097784,0.00012455943,0.00033597482,0.0002494775,0.00004167383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001639717,0.0019668029,0.0010437131,0.0013684259,0.00095434976,0.0021992477,0.0023628238,0.0015996379,0.0054646935],"category_scores_gemma":[0.0051562586,0.0012050408,0.0010129686,0.0018042233,0.0011597394,0.0030614717,0.0014402878,0.002473642,0.001528005],"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.000080384845,0.00013535732,0.0004030906,0.00040440747,0.000062769206,0.000052168976,0.00014253033,0.32715508,0.006395294,0.2595222,0.00993727,0.39570948],"study_design_scores_gemma":[0.000044691955,0.00004259724,0.00010174884,0.00009192242,0.000044046177,0.00009003931,0.000045504807,0.7364554,0.0044429675,0.24673244,0.011881263,0.000027510872],"about_ca_topic_score_codex":0.0010754378,"about_ca_topic_score_gemma":0.0023475965,"teacher_disagreement_score":0.0054646935,"about_ca_system_score_codex":0.0013968367,"about_ca_system_score_gemma":0.00150829,"threshold_uncertainty_score":0.018281281},"labels":[],"label_agreement":null},{"id":"W2111163140","doi":"10.1007/978-3-319-10404-1_45","title":"Robust Bone Detection in Ultrasound Using Combined Strain Imaging and Envelope Signal Power Detection","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Imaging phantom; Computer science; Reduction (mathematics); Envelope (radar); Cadaveric spasm; Fiducial marker; Finite element method; Artificial intelligence; Biomedical engineering; Acoustics; Computer vision; Materials science; Physics; Mathematics; Optics; Medicine; Anatomy; Telecommunications","score_opus":0.009644204321173121,"score_gpt":0.22850398750397483,"score_spread":0.2188597831828017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111163140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024889424,0.00049846654,0.9732545,0.000113255875,0.000033399512,0.00002767631,0.00005395281,0.00041347134,0.0007158327],"genre_scores_gemma":[0.30905908,0.0010322619,0.68589395,0.00019599727,0.00013983801,0.00007351944,0.00024672065,0.00025231083,0.0031062714],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917597,0.00017220256,0.000048782487,0.00013021322,0.00041972857,0.00005300442],"domain_scores_gemma":[0.9986129,0.0008361066,0.00012112646,0.00011075076,0.00027108318,0.000048165843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009040258,0.00096210296,0.0008820431,0.0012087409,0.0001864162,0.0009524104,0.00071123574,0.0013390688,0.001736931],"category_scores_gemma":[0.0031571877,0.0006787343,0.0006360042,0.0007992697,0.00047249286,0.0014998583,0.0011381318,0.0007526704,0.0010353033],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056485645,0.00016738324,0.0023499657,0.00030288988,0.000138719,0.00022541036,0.00009277641,0.026406784,0.4330325,0.0022916254,0.000800108,0.53362703],"study_design_scores_gemma":[0.000059696333,0.00033305056,0.0071418784,0.000054479722,0.00014930966,0.001424703,0.00006572524,0.77934784,0.2042586,0.004680559,0.0023995172,0.000084627565],"about_ca_topic_score_codex":0.0004081122,"about_ca_topic_score_gemma":0.00087949267,"teacher_disagreement_score":0.001736931,"about_ca_system_score_codex":0.00013813944,"about_ca_system_score_gemma":0.00030874813,"threshold_uncertainty_score":0.0058106184},"labels":[],"label_agreement":null},{"id":"W2111209963","doi":"10.1007/978-3-642-10445-9_20","title":"Automatic Stress Testing of Multi-tier Systems by Dynamic Bottleneck Switch Generation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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 Calgary","funders":"","keywords":"Burstiness; Computer science; Bottleneck; Testbed; Distributed computing; Computer network; Queueing theory; Session (web analytics); Throughput; Service (business); Real-time computing; Embedded system; Operating system; Wireless","score_opus":0.017089369859310487,"score_gpt":0.23317847025448563,"score_spread":0.21608910039517515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111209963","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.66852427,0.0004963444,0.32176527,0.00012705187,0.000104972794,0.00010665719,0.00032413166,0.0062859138,0.002265397],"genre_scores_gemma":[0.98497784,0.000025334559,0.014485202,0.00002283371,0.0000106428715,0.000025287103,0.0000714172,0.0000522631,0.00032914538],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.0001782765,0.00003189367,0.00014710834,0.00017784977,0.000097175296],"domain_scores_gemma":[0.998355,0.0007628893,0.00017950378,0.00031011365,0.00029211436,0.00010045455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567805,0.0009700296,0.00069478306,0.0008814722,0.00038464557,0.000617208,0.0012369491,0.00038479723,0.002349632],"category_scores_gemma":[0.0013814153,0.00026465763,0.00031614443,0.00042284472,0.00046630236,0.00096097245,0.00055876747,0.00041378225,0.00022926349],"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.0029051478,0.0005234323,0.020798516,0.00034157615,0.00023509565,0.0005423694,0.00035515896,0.19009398,0.41204098,0.0036310782,0.00376545,0.36476722],"study_design_scores_gemma":[0.000056348254,0.0007304225,0.00815711,0.000016063725,0.00007274967,0.00024976637,0.000058456226,0.91902155,0.066684075,0.0042624394,0.0006550213,0.000036066012],"about_ca_topic_score_codex":0.0014869311,"about_ca_topic_score_gemma":0.00237075,"teacher_disagreement_score":0.002349632,"about_ca_system_score_codex":0.00064823084,"about_ca_system_score_gemma":0.00047195607,"threshold_uncertainty_score":0.0078603625},"labels":[],"label_agreement":null},{"id":"W2111290490","doi":"10.1007/3-540-47922-8_16","title":"On the Role of Contextual Weak Independence in Probabilistic Inference","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Independence (probability theory); Inference; Probabilistic logic; Computer science; Context (archaeology); Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.025580608954740836,"score_gpt":0.24476444485086415,"score_spread":0.2191838358961233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111290490","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.006225167,0.004598407,0.95921385,0.0048067924,0.0003527372,0.000037445603,0.00016446222,0.00017195876,0.0244292],"genre_scores_gemma":[0.5051157,0.011125009,0.45981964,0.0041821515,0.0050420454,0.00048349725,0.0006187351,0.00058705657,0.013026128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894298,0.0065477346,0.0005930743,0.0012329773,0.0017874946,0.00040901857],"domain_scores_gemma":[0.892586,0.09708648,0.001562878,0.0054982337,0.0023832645,0.00088316505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016723087,0.0015170678,0.0025305962,0.0028946523,0.0028433355,0.004914102,0.004271829,0.004002604,0.0066831447],"category_scores_gemma":[0.06464781,0.0029489486,0.0027181515,0.0042375852,0.0155297695,0.021556012,0.005774319,0.012146701,0.0011037635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002738148,0.000013266439,0.00016536644,0.0001147489,0.000032302214,0.00005103995,0.00018470948,0.004065864,0.000107835906,0.9839129,0.0012777846,0.010046907],"study_design_scores_gemma":[0.0000045556803,0.0000043160453,0.000051190294,0.000019525176,0.000011946603,0.000018305804,0.000009839716,0.0076054977,0.000043674696,0.9914589,0.0007647894,0.0000073998117],"about_ca_topic_score_codex":0.0032382219,"about_ca_topic_score_gemma":0.0028407653,"teacher_disagreement_score":0.016723087,"about_ca_system_score_codex":0.0019638052,"about_ca_system_score_gemma":0.0014038734,"threshold_uncertainty_score":0.08844119},"labels":[],"label_agreement":null},{"id":"W2111691418","doi":"10.1007/978-3-319-18356-5_20","title":"Rule Extraction from Random Forest: the RF+HC Methods","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Random forest; Computer science; Scalability; Radio frequency; Set (abstract data type); Data mining; Tree (set theory); Artificial intelligence; Machine learning; Pattern recognition (psychology); Mathematics; Database; Telecommunications","score_opus":0.03265197163391107,"score_gpt":0.33212424000882446,"score_spread":0.29947226837491336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111691418","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.003876842,0.0015944629,0.9842933,0.00015359325,0.00018316503,0.00022927618,0.0011692512,0.0068581835,0.001641944],"genre_scores_gemma":[0.03630394,0.0008227382,0.9519148,0.00019920939,0.0002647245,0.00023778071,0.004620864,0.0007126479,0.0049232766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981115,0.00046009943,0.00018265311,0.0005151302,0.00059845514,0.00013217935],"domain_scores_gemma":[0.99551255,0.002787252,0.00011130171,0.00064598804,0.0008558245,0.00008702179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266415,0.0015081879,0.0022877466,0.0035120773,0.00069310557,0.0017562613,0.003480605,0.0016512893,0.0096443305],"category_scores_gemma":[0.008055153,0.0007914678,0.0024149455,0.002920002,0.00041356852,0.0019060848,0.001043294,0.0021576479,0.009903201],"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.000103351806,0.00009893456,0.00057037955,0.00025247733,0.00012225214,0.000090211186,0.000026731328,0.014133627,0.0028472114,0.0015709323,0.013383753,0.96680003],"study_design_scores_gemma":[0.0001016854,0.00018566076,0.002015074,0.00017768088,0.0003496428,0.00075331895,0.0000709072,0.9304325,0.014865687,0.026745116,0.024200192,0.00010254354],"about_ca_topic_score_codex":0.005730703,"about_ca_topic_score_gemma":0.009278124,"teacher_disagreement_score":0.0096443305,"about_ca_system_score_codex":0.00040730374,"about_ca_system_score_gemma":0.0012822127,"threshold_uncertainty_score":0.032263517},"labels":[],"label_agreement":null},{"id":"W2111741778","doi":"10.1007/978-3-540-31856-9_31","title":"Approximate Range Mode and Range Median Queries","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University","funders":"","keywords":"Combinatorics; Rank (graph theory); Data structure; Binary logarithm; Range (aeronautics); Sequence (biology); Space (punctuation); Mathematics; Element (criminal law); Algorithm; Discrete mathematics; Computer science","score_opus":0.014519397415170937,"score_gpt":0.24254774722105643,"score_spread":0.2280283498058855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111741778","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.019736553,0.0020450072,0.9579664,0.00058504764,0.0002088969,0.00013399219,0.00068822736,0.0024891119,0.016146775],"genre_scores_gemma":[0.31646475,0.0020493516,0.64969957,0.0006270666,0.0007059099,0.0004481372,0.0028768347,0.0009726026,0.026155837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711084,0.00045274003,0.00017906087,0.00040046562,0.0015790475,0.00027794682],"domain_scores_gemma":[0.99544036,0.0018967958,0.00022974465,0.0017470861,0.0005758969,0.0001100812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017483982,0.0011244976,0.0023899546,0.0021683038,0.00083098124,0.003233394,0.0026365097,0.0018495375,0.012599279],"category_scores_gemma":[0.01155316,0.0006410485,0.0010740095,0.0045888275,0.0011400454,0.007387686,0.004789886,0.0021137693,0.003769546],"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.0020453313,0.00027399606,0.001692899,0.00050722883,0.000104019186,0.00025122592,0.00039535717,0.056519102,0.013253454,0.22806284,0.037792016,0.6591025],"study_design_scores_gemma":[0.00015527291,0.00022600501,0.0006706066,0.00009714581,0.000077256635,0.0012200892,0.00026963366,0.5202148,0.017444002,0.42780867,0.031747047,0.00006936139],"about_ca_topic_score_codex":0.0008884041,"about_ca_topic_score_gemma":0.0009931898,"teacher_disagreement_score":0.012599279,"about_ca_system_score_codex":0.0010162537,"about_ca_system_score_gemma":0.0008520384,"threshold_uncertainty_score":0.04214883},"labels":[],"label_agreement":null},{"id":"W2111838425","doi":"10.1007/11504894_87","title":"The Coordination of Parallel Search with Common Components","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.021478151606717767,"score_gpt":0.2510388984967862,"score_spread":0.22956074689006842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111838425","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.030832293,0.00072475267,0.94158554,0.0004646927,0.00016037143,0.00012047172,0.00007195465,0.0015701937,0.024469716],"genre_scores_gemma":[0.6059838,0.0007225058,0.37541312,0.0001704786,0.00016615793,0.00045907174,0.00030122747,0.00071715907,0.016066464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978161,0.00074107514,0.00014072856,0.00046187342,0.0005479053,0.00029235287],"domain_scores_gemma":[0.99429554,0.002497172,0.00030086658,0.0018686373,0.00064687233,0.00039104046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021852425,0.0008752367,0.0014434163,0.0012327443,0.001705349,0.004190193,0.0033764585,0.0013781218,0.008845682],"category_scores_gemma":[0.01182894,0.001042757,0.0006968181,0.0021711644,0.0022669781,0.005098957,0.003946936,0.0017475446,0.0016282379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006478106,0.00010841168,0.0007757938,0.00022318475,0.00011296988,0.00019361949,0.00057508633,0.15416214,0.007187089,0.6989187,0.009616719,0.12747845],"study_design_scores_gemma":[0.00012624831,0.000080271275,0.0002578883,0.00003248134,0.000058217927,0.00013042442,0.00013710622,0.49458048,0.005339719,0.4846008,0.014621874,0.000034420358],"about_ca_topic_score_codex":0.002484469,"about_ca_topic_score_gemma":0.0023711731,"teacher_disagreement_score":0.008845682,"about_ca_system_score_codex":0.0013993996,"about_ca_system_score_gemma":0.0019373721,"threshold_uncertainty_score":0.029591799},"labels":[],"label_agreement":null},{"id":"W2111880148","doi":"10.1007/978-3-642-22212-2_15","title":"Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Bipartite graph; Asynchronous communication; Theoretical computer science; Distributed computing; Computer network; Graph","score_opus":0.01815095563036638,"score_gpt":0.24187740175512792,"score_spread":0.22372644612476156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111880148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08905804,0.00019195687,0.8997406,0.00045771565,0.00005328117,0.00017662086,0.00010130979,0.0006496261,0.009570807],"genre_scores_gemma":[0.8334115,0.00024337633,0.15487708,0.00019492344,0.00007551608,0.0003498975,0.0002091379,0.00019430873,0.010444253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891233,0.00041750062,0.00004497986,0.00024477957,0.00018307776,0.00019730872],"domain_scores_gemma":[0.9961365,0.0024910653,0.00033101442,0.00047948657,0.00025455674,0.0003073136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013746192,0.0008796226,0.0015991826,0.0008301265,0.0013020899,0.0016899962,0.002713372,0.0017048563,0.0029319853],"category_scores_gemma":[0.006485436,0.0008817843,0.00094338186,0.001108688,0.0015883764,0.0029995465,0.0036264155,0.0017607957,0.000560938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006682009,0.00025908084,0.0007924354,0.00043914016,0.00014703939,0.00031480935,0.00062643155,0.7013865,0.009470974,0.22705051,0.005526402,0.053318467],"study_design_scores_gemma":[0.00004333394,0.000053492262,0.00007784192,0.000009817826,0.000015503103,0.000034903216,0.00005103742,0.89984965,0.00089280336,0.09844788,0.00051293225,0.000010830695],"about_ca_topic_score_codex":0.0023607968,"about_ca_topic_score_gemma":0.0028029853,"teacher_disagreement_score":0.0029319853,"about_ca_system_score_codex":0.0011044856,"about_ca_system_score_gemma":0.001052586,"threshold_uncertainty_score":0.009808481},"labels":[],"label_agreement":null},{"id":"W2111880327","doi":"10.1007/978-3-642-01129-0_33","title":"Swarming for Games: Immersion in Complex Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Swarm behaviour; Swarming (honey bee); Swarm robotics; Computer science; Human–computer interaction; Metaphor; Swarm intelligence; Artificial intelligence; Particle swarm optimization; Machine learning; Ecology; Biology","score_opus":0.020955906069706026,"score_gpt":0.2479481345484154,"score_spread":0.2269922284787094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111880327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015257359,0.022436725,0.84662163,0.003469895,0.0011394118,0.00007978083,0.00014520033,0.00063948956,0.11021053],"genre_scores_gemma":[0.47002956,0.024047792,0.36829594,0.00078020996,0.0019095223,0.00041612468,0.00049782475,0.00065557944,0.13336745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985945,0.000051122537,0.000007536303,0.000027709593,0.000041183903,0.000012897591],"domain_scores_gemma":[0.99966526,0.00022460462,0.000012347824,0.000028201312,0.00003061057,0.00003894146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033158102,0.00087581814,0.0006301269,0.00028832204,0.0003701113,0.0019922452,0.0008527092,0.0009998969,0.008429151],"category_scores_gemma":[0.0012476008,0.00032013372,0.00053723255,0.00043583807,0.0012539141,0.002081445,0.0013765116,0.0016185228,0.0010683286],"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.00003556303,0.00005113561,0.00019995443,0.0005830201,0.000046599525,0.00009417772,0.0008564076,0.03572472,0.0029616253,0.7802428,0.03188946,0.1473145],"study_design_scores_gemma":[0.000020782525,0.000052647003,0.0002168937,0.00010698433,0.000013747601,0.0001386561,0.00020985623,0.15652665,0.0007683971,0.75717616,0.08474822,0.000021057764],"about_ca_topic_score_codex":0.00055202306,"about_ca_topic_score_gemma":0.0006652641,"teacher_disagreement_score":0.008429151,"about_ca_system_score_codex":0.00045308206,"about_ca_system_score_gemma":0.00030937692,"threshold_uncertainty_score":0.028198302},"labels":[],"label_agreement":null},{"id":"W2112168226","doi":"10.1007/11922155_20","title":"Optimization of a Billiard Player – Position Play","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Ball (mathematics); Dynamical billiards; Focus (optics); Plan (archaeology); Optimization problem; Artificial intelligence; Human–computer interaction; Mathematical optimization; Operations research; Simulation; Algorithm; Mathematics","score_opus":0.01893790826202742,"score_gpt":0.254161185421682,"score_spread":0.23522327715965455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112168226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19994967,0.00056348933,0.68953145,0.0018445133,0.00044363755,0.00033202936,0.00035328235,0.00064157567,0.10634029],"genre_scores_gemma":[0.8469867,0.00020239536,0.09021353,0.00019301064,0.000084896215,0.00029612312,0.00025029105,0.00027264195,0.061500467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948186,0.00018062099,0.000019724517,0.00008407213,0.0001042472,0.00012945953],"domain_scores_gemma":[0.9993861,0.0003468583,0.000036526864,0.000041260224,0.000051948424,0.00013729309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010533083,0.0012613252,0.0019732174,0.0008486996,0.001019345,0.0019604128,0.0020292192,0.0036298211,0.018653918],"category_scores_gemma":[0.0027216375,0.0011033434,0.00083271525,0.0005847845,0.0014897585,0.0012362017,0.002615517,0.0015128676,0.0014324405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008222729,0.00025056725,0.0006186256,0.00014035859,0.000087939596,0.00021999552,0.00010978526,0.88299805,0.0033454609,0.07950715,0.005983675,0.025916073],"study_design_scores_gemma":[0.000057065132,0.0000969114,0.00013054168,0.000013297752,0.000011298039,0.000023458288,0.000025451347,0.98708296,0.00039583826,0.011126132,0.001026524,0.000010604279],"about_ca_topic_score_codex":0.004933716,"about_ca_topic_score_gemma":0.0027676537,"teacher_disagreement_score":0.018653918,"about_ca_system_score_codex":0.0014077619,"about_ca_system_score_gemma":0.0016263933,"threshold_uncertainty_score":0.06240362},"labels":[],"label_agreement":null},{"id":"W2112246948","doi":"10.1007/978-3-642-23765-2_9","title":"BendFlip: Examining Input Techniques for Electronic Book Readers with Flexible Form Factors","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Affordance; Task (project management); Human–computer interaction; Capacitive sensing; Engineering; Systems engineering","score_opus":0.0286345956729102,"score_gpt":0.2576830676473565,"score_spread":0.22904847197444628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112246948","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.69516045,0.0035896187,0.109661125,0.00078381004,0.00016534171,0.00092121796,0.00087492337,0.0024135613,0.18642998],"genre_scores_gemma":[0.7817512,0.003649563,0.11411501,0.00036752096,0.00005122401,0.00065076654,0.0013912575,0.0016557935,0.09636758],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988819,0.00034505883,0.000053830772,0.00012749601,0.00049008586,0.00010160468],"domain_scores_gemma":[0.99135077,0.0067921705,0.0003404664,0.00036414023,0.0010065833,0.00014582308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014167036,0.00066801667,0.00035364286,0.0009649581,0.0007415755,0.0030859238,0.0015182246,0.0008662398,0.026853975],"category_scores_gemma":[0.016223019,0.00031313516,0.000403834,0.0012466545,0.00060663366,0.003042155,0.0014692268,0.0009096763,0.0041335463],"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.0010356857,0.0006645557,0.0139443325,0.0020310138,0.000034824345,0.0008271759,0.023398837,0.0009856073,0.03059266,0.0065061497,0.012774402,0.9072047],"study_design_scores_gemma":[0.000638724,0.0073838085,0.28262895,0.006649153,0.0007602866,0.013505691,0.12636644,0.033769865,0.16025957,0.02284792,0.3447461,0.0004433913],"about_ca_topic_score_codex":0.0013685335,"about_ca_topic_score_gemma":0.0030468844,"teacher_disagreement_score":0.026853975,"about_ca_system_score_codex":0.0005477301,"about_ca_system_score_gemma":0.000806542,"threshold_uncertainty_score":0.089835525},"labels":[],"label_agreement":null},{"id":"W2112263237","doi":"10.1007/978-3-540-31833-0_17","title":"Order-Preserving Transformations and Greedy-Like Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Greedy algorithm; Mathematical proof; Scheduling (production processes); Mathematical optimization; Graph; Class (philosophy); Set (abstract data type); Expressive power; Dominating set; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.02120697823112742,"score_gpt":0.24489360703774543,"score_spread":0.22368662880661802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112263237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023865217,0.0008825822,0.9130878,0.0012715756,0.00030167357,0.00010412842,0.00020768492,0.0016049152,0.058674388],"genre_scores_gemma":[0.4365843,0.00228346,0.49481794,0.0010171053,0.0004886628,0.00032314722,0.0009800917,0.0011382146,0.06236719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998833,0.00033555174,0.000060511826,0.0002314639,0.000390568,0.00014898002],"domain_scores_gemma":[0.9979101,0.0010278426,0.00011910749,0.00066337263,0.0001719944,0.00010763237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009425612,0.0009362127,0.0009797259,0.0011010551,0.001116078,0.0022465,0.0017978633,0.0012458212,0.007370199],"category_scores_gemma":[0.004685855,0.0005959816,0.001307797,0.0030172893,0.0023206805,0.0046019843,0.002108942,0.003945746,0.0021262555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007905455,0.000070167625,0.00010980873,0.000083745465,0.00001606152,0.00003705276,0.0000950765,0.014622724,0.0015876807,0.90268177,0.0068636285,0.073753305],"study_design_scores_gemma":[0.000019387026,0.000017619663,0.000043147946,0.000006959728,0.000007519543,0.000059738115,0.000018789511,0.02266952,0.0012967959,0.97001183,0.0058405176,0.0000082241695],"about_ca_topic_score_codex":0.0007680027,"about_ca_topic_score_gemma":0.00089127955,"teacher_disagreement_score":0.007370199,"about_ca_system_score_codex":0.0011843764,"about_ca_system_score_gemma":0.0009497535,"threshold_uncertainty_score":0.02465576},"labels":[],"label_agreement":null},{"id":"W2112299333","doi":"10.1007/3-540-44842-x_76","title":"An Efficient Algorithm for Real-Time 3D Terrain Walkthrough","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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 Calgary","funders":"","keywords":"Computer science; Terrain; Software walkthrough; Rendering (computer graphics); Computer graphics (images); Visualization; Raised-relief map; Algorithm; Terrain rendering; Representation (politics); Real-time rendering; Computer vision; Artificial intelligence; Software","score_opus":0.01505993426672987,"score_gpt":0.2874284161871382,"score_spread":0.27236848192040836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112299333","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.002500559,0.00008293647,0.9927504,0.000026354779,0.00003539611,0.00005241214,0.00006566498,0.003279272,0.0012068929],"genre_scores_gemma":[0.033759907,0.00011238952,0.9623763,0.000027651326,0.0000134706415,0.00012066653,0.0003617908,0.00039654845,0.0028311796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943787,0.000048346148,0.000033170327,0.000108386994,0.00030388552,0.00006837956],"domain_scores_gemma":[0.9995178,0.00015645951,0.000028109302,0.000095158044,0.00016140498,0.00004098852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043358296,0.0017538229,0.001203247,0.0014637322,0.00077279663,0.001518866,0.0023124975,0.001238995,0.01665404],"category_scores_gemma":[0.0013879825,0.00085635134,0.00089450233,0.0016313384,0.0005074977,0.0013898112,0.0023268424,0.00117245,0.004374569],"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.00030077092,0.00013041022,0.00040872183,0.00019226404,0.000052632287,0.00012474688,0.00019594994,0.062004823,0.028193982,0.012491166,0.011824092,0.88408035],"study_design_scores_gemma":[0.000119777156,0.00009561168,0.00030208557,0.00002680896,0.000032046493,0.00021713406,0.000068679845,0.95782727,0.01595075,0.008505208,0.016819699,0.00003500124],"about_ca_topic_score_codex":0.007186626,"about_ca_topic_score_gemma":0.0124271605,"teacher_disagreement_score":0.01665404,"about_ca_system_score_codex":0.0007495668,"about_ca_system_score_gemma":0.0010994284,"threshold_uncertainty_score":0.055713356},"labels":[],"label_agreement":null},{"id":"W2112322240","doi":"10.1007/978-3-642-24690-6_13","title":"Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ode; Predicative expression; Ordinary differential equation; Enclosure; Modulo; Mathematics; Computer science; State (computer science); Monotonic function; Algorithm; Domain (mathematical analysis); Theoretical computer science; Applied mathematics; Differential equation; Discrete mathematics","score_opus":0.03437690028281664,"score_gpt":0.2992385995798528,"score_spread":0.2648616992970362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112322240","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.004618301,0.000085658605,0.99228996,0.000040221188,0.00003044547,0.000029195671,0.000031298434,0.000830056,0.0020447718],"genre_scores_gemma":[0.17259675,0.00025681895,0.82044923,0.00012118041,0.00006256892,0.00015328299,0.00025233944,0.0009370207,0.005170717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986071,0.00043084437,0.00011567163,0.0002565157,0.00048661415,0.00010320762],"domain_scores_gemma":[0.99777067,0.0013180333,0.000087765206,0.0005850854,0.00019262357,0.000045915716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014641498,0.0011240457,0.0010272465,0.0009786871,0.0005332177,0.0008602295,0.0018268644,0.00077850616,0.006020436],"category_scores_gemma":[0.0046002655,0.0006236498,0.0021041126,0.000651276,0.0013126907,0.003688829,0.0031639345,0.0025201126,0.0012183656],"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.00035399885,0.0002889304,0.0014426654,0.0008125486,0.0002481102,0.00028333292,0.00043243694,0.2085767,0.05071657,0.27242044,0.0036224253,0.46080184],"study_design_scores_gemma":[0.00006208544,0.00010963545,0.0003005119,0.00006745207,0.00009645731,0.00011412815,0.000031232576,0.79797494,0.023493998,0.16898118,0.0087365005,0.000031842144],"about_ca_topic_score_codex":0.00073999946,"about_ca_topic_score_gemma":0.0015602317,"teacher_disagreement_score":0.006020436,"about_ca_system_score_codex":0.0004914885,"about_ca_system_score_gemma":0.0005579224,"threshold_uncertainty_score":0.02014035},"labels":[],"label_agreement":null},{"id":"W2112448133","doi":"10.1007/978-3-642-38771-5_14","title":"Extremal Words in the Shift Orbit Closure of a Morphic Sequence","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg","funders":"","keywords":"Lexicographical order; Morphism; Word (group theory); Closure (psychology); Combinatorics; Alphabet; Mathematics; Sequence (biology); Omega; Orbit (dynamics); Binary number; Simple (philosophy); Arithmetic; Discrete mathematics; Physics; Geometry; Linguistics; Quantum mechanics; Philosophy","score_opus":0.023976390785037844,"score_gpt":0.24207488351782636,"score_spread":0.2180984927327885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112448133","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.7982462,0.0010401778,0.093647026,0.0007328887,0.0002634477,0.00004369912,0.00025817775,0.00030179895,0.105466455],"genre_scores_gemma":[0.9744573,0.0002419056,0.008858114,0.0000900054,0.00015372262,0.000030181227,0.00016901201,0.00010297719,0.015896764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964154,0.00005859469,0.00002936399,0.00008824429,0.00010370891,0.0000785998],"domain_scores_gemma":[0.9994137,0.00026009337,0.000080158985,0.000058002912,0.00009378777,0.000094209456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034799628,0.0003882524,0.0005913219,0.0013909109,0.0014346985,0.0022362715,0.00049108296,0.00090576574,0.0061429488],"category_scores_gemma":[0.0015335754,0.0003514046,0.00046729442,0.0007899499,0.0020972725,0.0032132952,0.0013661673,0.0014258493,0.00058865314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007253033,0.000011540707,0.00017579237,0.00003059122,0.0000046752375,0.00021181608,0.00038097816,0.00060873805,0.0028083466,0.99036026,0.00047478112,0.0048599252],"study_design_scores_gemma":[0.000014063475,0.000032123044,0.0003993913,0.000019760484,0.00000950921,0.00028701787,0.00029271483,0.0040053506,0.0017412866,0.9899985,0.0031848238,0.000015479636],"about_ca_topic_score_codex":0.00042599728,"about_ca_topic_score_gemma":0.00048059193,"teacher_disagreement_score":0.0061429488,"about_ca_system_score_codex":0.0008252292,"about_ca_system_score_gemma":0.00030227433,"threshold_uncertainty_score":0.020550191},"labels":[],"label_agreement":null},{"id":"W2112527940","doi":"10.1007/978-3-540-88636-5_65","title":"On the Definition of Essential and Contingent Properties of Subjective Belief Bases","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Belief revision; Belief structure; Generalization; Probabilistic logic; Computer science; Subjective logic; Knowledge base; Base (topology); Artificial intelligence; Mathematics; Epistemology; Philosophy","score_opus":0.026405093118350466,"score_gpt":0.21442909301677707,"score_spread":0.1880239998984266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112527940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024854692,0.0035741986,0.9005082,0.0043791807,0.00038865066,0.00014711462,0.0006763292,0.00016657701,0.065305024],"genre_scores_gemma":[0.64993405,0.0029807042,0.33362737,0.0014124714,0.0009942154,0.0007348387,0.0009457317,0.00020988467,0.009160657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958008,0.0018239326,0.0005513583,0.00064503733,0.00090745365,0.00027136592],"domain_scores_gemma":[0.98005074,0.014617996,0.00087900064,0.0020542564,0.0018171183,0.0005809047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01005776,0.0009999413,0.0014930427,0.00277027,0.0019167135,0.005976445,0.0026222926,0.0027458784,0.005974522],"category_scores_gemma":[0.022170113,0.001442221,0.002368322,0.0027982313,0.010819985,0.019031398,0.0041846377,0.008026673,0.0006278286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006983574,0.0000047226686,0.000039859435,0.000018539968,0.00000624005,0.000014120533,0.00011633609,0.00030672117,0.00009610719,0.9974717,0.00021709519,0.0017015722],"study_design_scores_gemma":[0.0000047402264,0.0000055086684,0.00007681936,0.000022199383,0.000006082544,0.000031187847,0.000028797207,0.0023189962,0.00007426667,0.9961171,0.0013077311,0.0000065847375],"about_ca_topic_score_codex":0.0013453439,"about_ca_topic_score_gemma":0.0012904562,"teacher_disagreement_score":0.01005776,"about_ca_system_score_codex":0.0027207008,"about_ca_system_score_gemma":0.001304944,"threshold_uncertainty_score":0.053191185},"labels":[],"label_agreement":null},{"id":"W2112574687","doi":"10.1007/3-540-46416-6_31","title":"Enumerating Nondegenerate Permutations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Block cipher; Combinatorics; Mathematics; Cryptosystem; Block (permutation group theory); Discrete mathematics; Physics; Cryptography; Algorithm","score_opus":0.0248043449733415,"score_gpt":0.2623609242255619,"score_spread":0.2375565792522204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112574687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08131703,0.0037764683,0.7106573,0.0018576209,0.0008321809,0.00020758157,0.0016096281,0.0023935838,0.19734865],"genre_scores_gemma":[0.29092073,0.0049349885,0.525627,0.0009183765,0.00052584126,0.00044530083,0.005019438,0.0013597944,0.17024864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883217,0.0002479599,0.00008776369,0.00019413693,0.0005046196,0.00013332545],"domain_scores_gemma":[0.9976399,0.0012763444,0.00009119913,0.0006762053,0.00024591992,0.00007036457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095913804,0.001165576,0.0011178566,0.0024207018,0.0014231035,0.0030322832,0.0020250925,0.001269547,0.013139178],"category_scores_gemma":[0.004486938,0.0007848436,0.0010717926,0.0038275388,0.0017665034,0.0064984704,0.003254336,0.0035513954,0.0052036433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000805856,0.000071004855,0.00050857454,0.00033838846,0.000021462365,0.00009961418,0.0003205735,0.0049822847,0.0035871747,0.7209526,0.012564369,0.25647345],"study_design_scores_gemma":[0.00001045667,0.000017436969,0.00014476856,0.00008288573,0.000015246088,0.00020597907,0.00004541079,0.00685404,0.00266983,0.9666844,0.023254836,0.000014790929],"about_ca_topic_score_codex":0.00045718168,"about_ca_topic_score_gemma":0.001123504,"teacher_disagreement_score":0.013139178,"about_ca_system_score_codex":0.0013165546,"about_ca_system_score_gemma":0.0012857199,"threshold_uncertainty_score":0.04395497},"labels":[],"label_agreement":null},{"id":"W2112621043","doi":"10.1007/978-3-642-02498-6_51","title":"Oriented Morphometry of Folds on Surfaces","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.02767357696830822,"score_gpt":0.29727460711271286,"score_spread":0.2696010301444046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112621043","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.76466656,0.0004054474,0.2220743,0.0002533342,0.00012171905,0.000053152453,0.00016952364,0.00028475118,0.011971278],"genre_scores_gemma":[0.97286904,0.00025060808,0.023449102,0.000027546981,0.0000342466,0.000013098693,0.00010083794,0.00009505753,0.003160534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998474,0.000028153829,0.000010612986,0.000038721413,0.000054724493,0.000020335496],"domain_scores_gemma":[0.9996382,0.000071601055,0.000066046334,0.00007649747,0.00008852451,0.000059135386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020785099,0.000340879,0.00030724297,0.0013731975,0.0003847215,0.0014178413,0.0003978331,0.0005199577,0.0022428487],"category_scores_gemma":[0.0009871785,0.0003029217,0.0003220313,0.0005610532,0.0010439636,0.0011085845,0.00092199165,0.00059522095,0.0003498616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032247437,0.000084388754,0.011698812,0.00023439532,0.000052440362,0.00086374115,0.0016610952,0.0333517,0.18194562,0.5207765,0.0022649493,0.2467439],"study_design_scores_gemma":[0.000037303278,0.00029147248,0.042084355,0.00009610944,0.000059392798,0.0031874753,0.0019849068,0.29262754,0.039159328,0.6021218,0.01825982,0.00009053876],"about_ca_topic_score_codex":0.00045678156,"about_ca_topic_score_gemma":0.0004001742,"teacher_disagreement_score":0.0022428487,"about_ca_system_score_codex":0.0003400941,"about_ca_system_score_gemma":0.0001967799,"threshold_uncertainty_score":0.007503152},"labels":[],"label_agreement":null},{"id":"W2112731217","doi":"10.1007/978-3-642-31770-5_3","title":"Stretch Factor in Wireless Sensor Networks with Directional Antennae","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Omnidirectional antenna; Computer science; Antenna (radio); Wireless sensor network; Orientation (vector space); Directional antenna; Transmission (telecommunications); Wireless; Telecommunications; Computer network; Geometry; Mathematics","score_opus":0.012805181829521799,"score_gpt":0.22119193616409913,"score_spread":0.20838675433457732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112731217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051223032,0.029368024,0.8934032,0.00064675324,0.0004911679,0.000051147294,0.00008408062,0.0004090381,0.024323585],"genre_scores_gemma":[0.8719142,0.022610037,0.08492686,0.000114876406,0.0006567207,0.00012282551,0.00011297177,0.00017899781,0.019362466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969316,0.000086374166,0.000011877961,0.000059152397,0.000120220495,0.00002922888],"domain_scores_gemma":[0.9994357,0.00037811583,0.00004511318,0.00005796681,0.000059999966,0.00002299857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043166117,0.000565443,0.0005207597,0.0005036417,0.0002559003,0.0005059458,0.00065235444,0.00056975585,0.0020477185],"category_scores_gemma":[0.002066519,0.00029648776,0.00023299985,0.0009387558,0.0007985051,0.0015395324,0.0006306917,0.00077989354,0.00036461858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022987908,0.000087582295,0.0010385882,0.0007367363,0.000049211656,0.00023775073,0.00021606653,0.42229113,0.038866054,0.20798576,0.004671707,0.3235895],"study_design_scores_gemma":[0.000023930075,0.00024102989,0.0011323517,0.00008704526,0.000028408615,0.00048365837,0.00014590133,0.7943436,0.006570688,0.18158273,0.015309319,0.000051273753],"about_ca_topic_score_codex":0.00055077096,"about_ca_topic_score_gemma":0.0004253302,"teacher_disagreement_score":0.0020477185,"about_ca_system_score_codex":0.00066262926,"about_ca_system_score_gemma":0.00021533734,"threshold_uncertainty_score":0.006850302},"labels":[],"label_agreement":null},{"id":"W2112751189","doi":"10.1007/978-3-642-04271-3_60","title":"Functional Segmentation of fMRI Data Using Adaptive Non-negative Sparse PCA (ANSPCA)","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Voxel; Pooling; Segmentation","score_opus":0.09865117344980583,"score_gpt":0.3073481192246539,"score_spread":0.20869694577484804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112751189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009149945,0.0000814962,0.9895494,0.00011322225,0.000021268293,0.000028036904,0.00006673121,0.00052848936,0.0004614072],"genre_scores_gemma":[0.10271722,0.00032717397,0.8945635,0.000069338435,0.000053090156,0.00010802108,0.00033560413,0.0002842209,0.0015418588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971944,0.00007980504,0.000015973816,0.00006192392,0.000085537926,0.00003727013],"domain_scores_gemma":[0.99954575,0.00017792048,0.000051280742,0.000079519756,0.000119875476,0.000025634392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061136857,0.0006187815,0.0006101112,0.0008700756,0.00049120747,0.00085077685,0.00046657491,0.0007350564,0.0014774969],"category_scores_gemma":[0.0023951968,0.00040272108,0.00082011375,0.0012005017,0.00050719886,0.00071208016,0.0006580141,0.001103935,0.0005881461],"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.0002644729,0.00010335724,0.0010315602,0.00026656018,0.0000916569,0.00023154798,0.00032151208,0.07892796,0.25139895,0.0153418705,0.005343894,0.64667666],"study_design_scores_gemma":[0.000017029517,0.000065799715,0.0035540883,0.000021157814,0.0000413222,0.0003644794,0.000050279592,0.91133904,0.06149926,0.017303139,0.0057032905,0.000041061357],"about_ca_topic_score_codex":0.0033318582,"about_ca_topic_score_gemma":0.0052214107,"teacher_disagreement_score":0.0033318582,"about_ca_system_score_codex":0.00030671293,"about_ca_system_score_gemma":0.0011469623,"threshold_uncertainty_score":0.006624937},"labels":[],"label_agreement":null},{"id":"W2112798242","doi":"10.1007/978-3-642-39146-0_31","title":"Extending the AAT Tool with a User-Friendly and Powerful Mechanism to Retrieve Complex Information from Educational Log Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Athabasca University","funders":"","keywords":"Computer science; Learning analytics; Mechanism (biology); Learning Management; Domain (mathematical analysis); User Friendly; World Wide Web; Analytics; Multimedia; Human–computer interaction; Data science; Programming language","score_opus":0.018633979296356674,"score_gpt":0.26122122385050023,"score_spread":0.24258724455414354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112798242","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038826459,0.0003381147,0.69969,0.00041852234,0.0005051594,0.00034032407,0.008588524,0.2763741,0.009862622],"genre_scores_gemma":[0.0747652,0.0009118455,0.8299224,0.0013111742,0.0006089043,0.00081378047,0.025477897,0.02767145,0.03851733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727553,0.00033525814,0.00044711193,0.00048422074,0.00134664,0.000111283174],"domain_scores_gemma":[0.9885794,0.0060638264,0.00048618918,0.0028234005,0.0016167273,0.00043043008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027327805,0.001995948,0.0015685242,0.0065963236,0.0008854268,0.0061048577,0.0020279007,0.0016158489,0.03113635],"category_scores_gemma":[0.014652449,0.0010665313,0.0021315303,0.0040912856,0.0005670254,0.0057090465,0.0039366693,0.0022312468,0.025383415],"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.00065794657,0.00033269072,0.004987506,0.0014111033,0.00027273636,0.0011218871,0.0010263127,0.002184376,0.025012247,0.0086830575,0.17819276,0.7761173],"study_design_scores_gemma":[0.0002199417,0.00018335923,0.006729946,0.0006227507,0.00032768262,0.0039172685,0.00045463763,0.090599425,0.08462746,0.03581068,0.77596116,0.0005456728],"about_ca_topic_score_codex":0.002481305,"about_ca_topic_score_gemma":0.0027791695,"teacher_disagreement_score":0.03113635,"about_ca_system_score_codex":0.00042814194,"about_ca_system_score_gemma":0.0012299798,"threshold_uncertainty_score":0.1041615},"labels":[],"label_agreement":null},{"id":"W2112848454","doi":"10.1007/978-3-642-40790-1_20","title":"Serious Game Modules for Entertainment Games","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"The King's University","funders":"","keywords":"Entertainment; Computer science; Competition (biology); Simple (philosophy); Work (physics); Order (exchange); Multimedia; Ecology; Simulation; Engineering; Visual arts","score_opus":0.012265406925220173,"score_gpt":0.2079717964832339,"score_spread":0.19570638955801373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112848454","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012477927,0.004335143,0.5184444,0.0007410351,0.0007832932,0.0008178418,0.0017170188,0.01400977,0.44667357],"genre_scores_gemma":[0.06392184,0.0037777922,0.1955189,0.00060159026,0.00020965977,0.00097459165,0.0048363856,0.0040240264,0.72613525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981207,0.000035740413,0.000011435521,0.000027864253,0.00008859734,0.000024354698],"domain_scores_gemma":[0.9997482,0.000090851,0.000012736967,0.000029030245,0.00006223492,0.0000569296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022586792,0.0015182674,0.00034497734,0.0008231873,0.0003223898,0.001393493,0.0014859586,0.00066153414,0.12362968],"category_scores_gemma":[0.001055282,0.00040407895,0.00042137684,0.0006664501,0.00023630496,0.0016076869,0.0015474969,0.0010129339,0.031972047],"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.00022082786,0.00033366296,0.0002713345,0.00068468676,0.000025454983,0.00012838734,0.00047665354,0.0017444008,0.01715846,0.06091168,0.1797731,0.73827136],"study_design_scores_gemma":[0.00006784345,0.00022723028,0.0015135177,0.00031909448,0.000028433285,0.0005326386,0.00014407345,0.008602498,0.007084774,0.036058508,0.9453923,0.000029058137],"about_ca_topic_score_codex":0.0006144257,"about_ca_topic_score_gemma":0.0018257336,"teacher_disagreement_score":0.12362968,"about_ca_system_score_codex":0.00035546656,"about_ca_system_score_gemma":0.00036238655,"threshold_uncertainty_score":0.4135825},"labels":[],"label_agreement":null},{"id":"W2112907681","doi":"10.1007/978-3-319-07455-9_12","title":"A Genertic Algorithm Application on Wireless Sensor Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Acadia University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Wireless sensor network; Base station; Algorithm; Genetic algorithm; Cluster (spacecraft); Wireless; Energy (signal processing); Routing (electronic design automation); Computer network; Real-time computing; Shortest path problem; Theoretical computer science; Telecommunications; Mathematics","score_opus":0.008620078642029464,"score_gpt":0.2150987535294324,"score_spread":0.20647867488740293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112907681","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.0047195926,0.0010696054,0.9778823,0.00019220095,0.00035821533,0.000044738867,0.000038732443,0.0012030295,0.014491613],"genre_scores_gemma":[0.09765612,0.0020687932,0.8659019,0.0002603577,0.00030019603,0.00014520429,0.00019194864,0.00045002336,0.03302537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982846,0.000043671513,0.000011871595,0.00003304796,0.00007024239,0.0000127018775],"domain_scores_gemma":[0.9998166,0.0000671838,0.000007665518,0.000034170378,0.000066009,0.000008372709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027119185,0.00059469556,0.0004638253,0.00069460104,0.00040576753,0.00069455896,0.0006990207,0.0009712253,0.0055739963],"category_scores_gemma":[0.00087837083,0.00020467662,0.0004288774,0.00092987693,0.00038543917,0.0006808852,0.0008031727,0.0007298573,0.0018206214],"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.00011111599,0.00008007599,0.0005498597,0.0003514484,0.00005765232,0.0003182857,0.00012157563,0.115763076,0.03169437,0.09397499,0.017784955,0.7391926],"study_design_scores_gemma":[0.00002577562,0.00011268726,0.00035378197,0.000070456306,0.000026110461,0.0008626118,0.000037256686,0.8797261,0.014497141,0.03870874,0.0655566,0.000022749877],"about_ca_topic_score_codex":0.00059992913,"about_ca_topic_score_gemma":0.00077646354,"teacher_disagreement_score":0.0055739963,"about_ca_system_score_codex":0.0003102092,"about_ca_system_score_gemma":0.0002721489,"threshold_uncertainty_score":0.018646836},"labels":[],"label_agreement":null},{"id":"W2112952684","doi":"10.1007/978-3-642-33418-4_76","title":"Real-Time Quantitative Elasticity Imaging of Deep Tissue Using Free-Hand Conventional Ultrasound","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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 British Columbia","funders":"","keywords":"Magnetic resonance elastography; Elastography; Elasticity (physics); Ultrasound; Magnetic resonance imaging; Biomedical engineering; Ultrasound elastography; Soft tissue; Materials science; Medicine; Radiology","score_opus":0.014193634978940805,"score_gpt":0.29188807156900476,"score_spread":0.27769443659006393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112952684","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.62793064,0.0044376664,0.35978734,0.0004119603,0.00011473332,0.00020170516,0.000745129,0.0010345008,0.005336371],"genre_scores_gemma":[0.8730443,0.0018970064,0.12083462,0.00018708663,0.00010530943,0.00010221434,0.00021899109,0.0002456976,0.0033647378],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996265,0.00009765035,0.000022332177,0.0000796853,0.00013851938,0.000035364657],"domain_scores_gemma":[0.9985291,0.0009834246,0.00011095585,0.00015619834,0.00015123592,0.000068994916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008815612,0.00055106345,0.0005389043,0.00066825515,0.00018728671,0.0010648775,0.00053312344,0.0011607578,0.0044851215],"category_scores_gemma":[0.0022224688,0.00056134525,0.00024310163,0.00044606952,0.00060994027,0.001494145,0.0007894875,0.00053431175,0.0005371965],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001652815,0.000054947537,0.0013594874,0.0005089744,0.00003601201,0.00026311685,0.00011466792,0.0018843599,0.93196917,0.00033465895,0.00033202136,0.061489772],"study_design_scores_gemma":[0.0004715061,0.0023532333,0.049438965,0.00027081507,0.00039422978,0.015245713,0.0004624459,0.12257118,0.79981756,0.0028989564,0.005684838,0.00039054555],"about_ca_topic_score_codex":0.00059583964,"about_ca_topic_score_gemma":0.00094964594,"teacher_disagreement_score":0.0044851215,"about_ca_system_score_codex":0.00016387452,"about_ca_system_score_gemma":0.00031654254,"threshold_uncertainty_score":0.015004277},"labels":[],"label_agreement":null},{"id":"W2112971308","doi":"10.1007/978-3-319-06608-0_4","title":"Fast Vertical Mining of Sequential Patterns Using Co-occurrence Information","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":242,"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 Moncton","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Pruning; Bottleneck; Data mining; Representation (politics); Sequential Pattern Mining; Information bottleneck method; State (computer science); Pattern recognition (psychology); Artificial intelligence; Algorithm; Cluster analysis","score_opus":0.028075066088250885,"score_gpt":0.2794808825966699,"score_spread":0.25140581650841903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112971308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1411406,0.003559109,0.8349794,0.00034311315,0.0002556377,0.00036571853,0.008043376,0.006679707,0.004633316],"genre_scores_gemma":[0.3204465,0.0012847338,0.65488195,0.000082693914,0.00016329048,0.00021520555,0.017736776,0.000292523,0.004896363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.00007849128,0.00012807686,0.00022743178,0.0004574138,0.000119720986],"domain_scores_gemma":[0.9974541,0.0011436443,0.00029566465,0.00030915317,0.00064835994,0.00014898746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802197,0.0010399746,0.001231359,0.00585938,0.00082747807,0.0015113393,0.0012211151,0.0006289563,0.0026076238],"category_scores_gemma":[0.0031809348,0.0005523649,0.0012016452,0.0074207857,0.00026224207,0.0017907013,0.0010584424,0.00083382044,0.0020608676],"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.0005458505,0.0002932385,0.014686032,0.0006352427,0.00024387814,0.0005987593,0.00020011723,0.008186978,0.027609084,0.0038590736,0.012011942,0.9311298],"study_design_scores_gemma":[0.00014811177,0.00059878844,0.017095933,0.0002398156,0.000460945,0.0029962272,0.00053861446,0.8784603,0.037863966,0.036297046,0.025202129,0.000098082426],"about_ca_topic_score_codex":0.0041108,"about_ca_topic_score_gemma":0.007662056,"teacher_disagreement_score":0.00585938,"about_ca_system_score_codex":0.00033158323,"about_ca_system_score_gemma":0.0012489686,"threshold_uncertainty_score":0.008723319},"labels":[],"label_agreement":null},{"id":"W2113001271","doi":"10.1007/978-3-540-73814-5_5","title":"New Algorithms for the Spaced Seeds","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Running time; Algorithm; Combinatorics; Exponential function; Set (abstract data type); Monte Carlo method; Mathematics; Computer science; Statistics","score_opus":0.035057950650731536,"score_gpt":0.2858264778234328,"score_spread":0.25076852717270126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113001271","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.0017173057,0.0003845073,0.99299663,0.00015788877,0.00024921348,0.00003616046,0.000046033565,0.00042324455,0.0039889943],"genre_scores_gemma":[0.029773135,0.0006765374,0.9552056,0.00016964968,0.00036994935,0.00017826162,0.00020554508,0.0004908758,0.012930395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854666,0.00033273455,0.00009151344,0.0003001274,0.000645064,0.000083799125],"domain_scores_gemma":[0.99693066,0.0015925854,0.0001876446,0.0007362238,0.00040503725,0.00014794347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017159365,0.0017097847,0.0014587458,0.0022338012,0.0010062319,0.0024264636,0.0031239514,0.002019721,0.01474282],"category_scores_gemma":[0.0111667365,0.001040494,0.0014394966,0.0028931869,0.0020416442,0.0052059046,0.0037182926,0.003967976,0.005951964],"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.00018592103,0.00007831119,0.00031392806,0.00018346589,0.000039880848,0.00010928087,0.0001768245,0.034721855,0.005974414,0.6228045,0.014887723,0.3205239],"study_design_scores_gemma":[0.000088101326,0.00005816665,0.0001318725,0.000050367176,0.00003682963,0.00039493915,0.000053157564,0.37081015,0.0036442222,0.59896654,0.025724573,0.00004102691],"about_ca_topic_score_codex":0.0006374618,"about_ca_topic_score_gemma":0.0012984995,"teacher_disagreement_score":0.01474282,"about_ca_system_score_codex":0.0010734638,"about_ca_system_score_gemma":0.00099017,"threshold_uncertainty_score":0.049319625},"labels":[],"label_agreement":null},{"id":"W2113087971","doi":"10.1007/978-3-642-40760-4_68","title":"Adaptive Voxel, Texture and Temporal Conditional Random Fields for Detection of Gad-Enhancing Multiple Sclerosis Lesions in Brain MRI","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NeuroRx Research (Canada); Montreal Neurological Institute and Hospital; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voxel; Conditional random field; Pattern recognition (psychology); Multiple sclerosis; Artificial intelligence; Probabilistic logic; Computer science; Medicine","score_opus":0.023090805883596764,"score_gpt":0.265599434616264,"score_spread":0.24250862873266724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113087971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15034223,0.0012834378,0.84615517,0.00039731947,0.000052303094,0.00008423949,0.00035389335,0.0008046959,0.0005267994],"genre_scores_gemma":[0.6923157,0.0013635623,0.30321872,0.00016623648,0.000118342716,0.00012694394,0.00074628595,0.00022410903,0.0017200604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998228,0.000059211317,0.000009777852,0.000026241683,0.000056364268,0.000025597861],"domain_scores_gemma":[0.9989774,0.00068640796,0.00010907332,0.000045881854,0.00012670513,0.000054481116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145646,0.0003922797,0.00046421256,0.0010011647,0.00019814131,0.00049856846,0.0007516823,0.00061186636,0.0006730638],"category_scores_gemma":[0.0032444596,0.00031953456,0.0006103329,0.00052672654,0.00032091598,0.00042141014,0.0005496298,0.0006573895,0.00018669317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001978602,0.00030127724,0.007656728,0.00033284453,0.0002339965,0.00028566658,0.00011594908,0.4723875,0.1023125,0.0073583596,0.0026708248,0.40436578],"study_design_scores_gemma":[0.00003321603,0.00007169868,0.004503092,0.000009756057,0.000051464303,0.0002005873,0.000016972228,0.9834983,0.008704665,0.0024997331,0.00038264634,0.000027914106],"about_ca_topic_score_codex":0.006560681,"about_ca_topic_score_gemma":0.009208786,"teacher_disagreement_score":0.006560681,"about_ca_system_score_codex":0.0004280397,"about_ca_system_score_gemma":0.0009699182,"threshold_uncertainty_score":0.013045013},"labels":[],"label_agreement":null},{"id":"W2113324328","doi":"10.1007/978-3-540-28634-9_23","title":"Progress Based Localized Power and Cost Aware Routing Algorithms for Ad Hoc and Sensor Wireless Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":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":"Computer science; Wireless ad hoc network; Computer network; Network packet; Routing (electronic design automation); Node (physics); Geographic routing; Mobile ad hoc network; Shortest path problem; Algorithm; Path (computing); Power (physics); Wireless; Routing algorithm; Routing protocol; Dynamic Source Routing; Theoretical computer science; Telecommunications","score_opus":0.013640820818336888,"score_gpt":0.250059138114633,"score_spread":0.2364183172962961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113324328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018129993,0.0019414581,0.9748594,0.00027493955,0.0002247568,0.00010034027,0.00006565419,0.0013347913,0.0030686734],"genre_scores_gemma":[0.46562582,0.0026555008,0.5095337,0.0001329528,0.00038758598,0.0003050506,0.0003409599,0.00036652916,0.020651901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.00010205454,0.00003382097,0.000090696936,0.0002663792,0.000054025553],"domain_scores_gemma":[0.99800164,0.0009883193,0.0001591655,0.00028380327,0.00048253432,0.000084475345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529216,0.0015302546,0.0013832524,0.0015033954,0.00079683587,0.0011001927,0.0027832892,0.0008508717,0.0028143465],"category_scores_gemma":[0.0041263816,0.00048451967,0.00044824896,0.0013656757,0.00091502466,0.0034798572,0.0017596085,0.0014656507,0.0007776613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056994846,0.00019297432,0.0008795761,0.00026200747,0.000055265038,0.00007413192,0.00023155507,0.5062857,0.00909631,0.057018198,0.007473075,0.41786122],"study_design_scores_gemma":[0.000040446834,0.00016924682,0.0002212417,0.000016823966,0.000030606992,0.00006303705,0.00005038459,0.96890175,0.0038255474,0.023325406,0.0033408748,0.000014556431],"about_ca_topic_score_codex":0.001215164,"about_ca_topic_score_gemma":0.0021796527,"teacher_disagreement_score":0.0028143465,"about_ca_system_score_codex":0.000995505,"about_ca_system_score_gemma":0.00070332503,"threshold_uncertainty_score":0.009414971},"labels":[],"label_agreement":null},{"id":"W2113435633","doi":"10.1007/978-3-319-07668-3_41","title":"Heuristic Inspection to Assess Persuasiveness: A Case Study of a Mathematics E-learning Program","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Polytechnique Montréal","funders":"","keywords":"Heuristic; Categorization; Usability; Perspective (graphical); Computer science; Heuristic evaluation; Focus (optics); Artificial intelligence; Machine learning; Human–computer interaction","score_opus":0.05278255586896766,"score_gpt":0.31238911930632823,"score_spread":0.25960656343736055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113435633","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.9856808,0.00015702941,0.008835176,0.00012150817,0.000010383708,0.00038582232,0.000045319324,0.00007240406,0.004691651],"genre_scores_gemma":[0.967139,0.0001596432,0.029844157,0.00005732327,0.0000073456113,0.00014948272,0.00007421203,0.000048023812,0.0025207342],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99499243,0.0031435182,0.000266878,0.00031906288,0.0010086766,0.00026946492],"domain_scores_gemma":[0.8958949,0.09488639,0.0019851336,0.0022633453,0.0040682056,0.0009019587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007611328,0.00055042404,0.0006111163,0.0020196654,0.0018887259,0.001647794,0.001773497,0.0016870928,0.0023539583],"category_scores_gemma":[0.039831333,0.0003897242,0.000426307,0.0013576729,0.0011189347,0.0011308774,0.001314083,0.0011870051,0.00048046824],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002759332,0.023067515,0.13642518,0.0027215818,0.00023173941,0.010485843,0.20624073,0.00533305,0.04097877,0.0040794914,0.0029825622,0.5646943],"study_design_scores_gemma":[0.0014270479,0.03859003,0.45739242,0.0017523995,0.0012433421,0.018504888,0.22556579,0.09715501,0.117610715,0.013646979,0.026377676,0.0007336932],"about_ca_topic_score_codex":0.0027860936,"about_ca_topic_score_gemma":0.006092293,"teacher_disagreement_score":0.007611328,"about_ca_system_score_codex":0.0007540452,"about_ca_system_score_gemma":0.0014267212,"threshold_uncertainty_score":0.040253043},"labels":[],"label_agreement":null},{"id":"W2113717903","doi":"10.1007/978-3-642-55220-5_30","title":"Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":432,"is_retracted":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":"Ciphertext; Homomorphic encryption; Learning with errors; Plaintext; Key (lock); Encryption; Attribute-based encryption; Computer science; Public-key cryptography; Construct (python library); Arithmetic; Theoretical computer science; Key size; Multilinear map; Electronic circuit; Cryptography; Algorithm; Mathematics; Computer security; Computer network","score_opus":0.017410080012410265,"score_gpt":0.22436992740088307,"score_spread":0.2069598473884728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113717903","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.079137646,0.023833226,0.73300785,0.0021221724,0.0010422156,0.00016532594,0.00045702668,0.0009955694,0.15923902],"genre_scores_gemma":[0.7554826,0.013592643,0.15344565,0.00057678856,0.00077555084,0.00019068872,0.00058335246,0.0002635245,0.07508917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960476,0.00007443549,0.000025611715,0.000074947646,0.00016644236,0.0000538385],"domain_scores_gemma":[0.9997168,0.00011684806,0.00002940235,0.000096843934,0.000030224677,0.000009782952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032272158,0.00074505137,0.00070942193,0.00048380642,0.00038433622,0.0018709546,0.00058039365,0.0009224469,0.0042562475],"category_scores_gemma":[0.0010930331,0.00037097107,0.00047604076,0.0009958071,0.0012678655,0.005225388,0.0011218998,0.002061158,0.0014086303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009147751,0.000033796943,0.00004672637,0.00021986502,0.000014423685,0.000081631704,0.00006669985,0.0049620545,0.0061588357,0.9275509,0.0027447361,0.058028884],"study_design_scores_gemma":[0.000019915142,0.000070965456,0.00013132881,0.000058877555,0.000013800869,0.0004513272,0.000023248636,0.015849886,0.0069210115,0.95451415,0.021923097,0.000022442848],"about_ca_topic_score_codex":0.0001138068,"about_ca_topic_score_gemma":0.00013516369,"teacher_disagreement_score":0.0042562475,"about_ca_system_score_codex":0.0006281144,"about_ca_system_score_gemma":0.00034214352,"threshold_uncertainty_score":0.014238596},"labels":[],"label_agreement":null},{"id":"W2113761519","doi":"10.1007/978-3-642-19074-2_2","title":"Efficient Secure Two-Party Exponentiation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"Computer science; Exponentiation; Homomorphic encryption; Commitment scheme; Secure multi-party computation; Discrete logarithm; Oblivious transfer; Theoretical computer science; Multiplicative function; Encryption; Cryptography; Protocol (science); Public-key cryptography; Algorithm; Computer network; Mathematics","score_opus":0.01667961719754958,"score_gpt":0.2324526908362975,"score_spread":0.21577307363874793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113761519","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.022082461,0.001304388,0.9293895,0.0006128029,0.00032096985,0.00015422716,0.00040489665,0.0024494426,0.043281324],"genre_scores_gemma":[0.5474181,0.0020016723,0.3592237,0.00032671963,0.00034569288,0.00022030903,0.0014487383,0.00072840985,0.088286705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813205,0.00028663702,0.00014965182,0.00018689627,0.0009630937,0.00028172845],"domain_scores_gemma":[0.99823284,0.0005425602,0.000064616295,0.00091644266,0.00020021824,0.00004319852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282461,0.0011889356,0.0011252445,0.0008271036,0.0007920129,0.002757747,0.0013576283,0.0009699396,0.017253252],"category_scores_gemma":[0.0025966885,0.00058645254,0.0008203443,0.0015931207,0.0008538768,0.0049415664,0.004077958,0.0023391787,0.009609748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007845381,0.00030649413,0.00040114508,0.00063167146,0.00009630783,0.00035050767,0.00023578292,0.021389242,0.03869826,0.37369147,0.018569592,0.54484504],"study_design_scores_gemma":[0.0003274971,0.0002905376,0.00069855055,0.00015985093,0.0001320058,0.0019274285,0.00010705021,0.20332646,0.115885295,0.58738065,0.08965335,0.00011133583],"about_ca_topic_score_codex":0.000114933806,"about_ca_topic_score_gemma":0.00024777092,"teacher_disagreement_score":0.017253252,"about_ca_system_score_codex":0.0006772543,"about_ca_system_score_gemma":0.0007860415,"threshold_uncertainty_score":0.05771786},"labels":[],"label_agreement":null},{"id":"W2113965694","doi":"10.1007/978-3-662-45550-0_37","title":"Incorporating Policy-Based Authorization Framework in Audit Rule Ontology for Continuous Process Auditing in Complex Distributed Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Windsor","funders":"","keywords":"Audit; Authorization; Computer science; Ontology; Process (computing); Process management; Software engineering; Distributed computing; Computer security; Accounting; Business; Programming language; Epistemology; Philosophy","score_opus":0.023643417401849536,"score_gpt":0.313688743941371,"score_spread":0.2900453265395214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113965694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005486232,0.00047952152,0.9857351,0.0005233329,0.0001812795,0.00016711674,0.00016506568,0.0021163365,0.005145972],"genre_scores_gemma":[0.1362766,0.0011605248,0.85588187,0.00033632477,0.00011663269,0.00018690573,0.001016029,0.00039540615,0.004629704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996557,0.0006862,0.0006235633,0.0005304209,0.0013040006,0.0002988195],"domain_scores_gemma":[0.9978758,0.0005630644,0.0001766859,0.0006855892,0.0005319986,0.00016696058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044469438,0.0004582714,0.00080133765,0.0018075833,0.0012337392,0.0055417386,0.0021012463,0.0013102769,0.0015602183],"category_scores_gemma":[0.0045297025,0.0005669659,0.002029341,0.0019129954,0.0017104847,0.0075357673,0.002941074,0.0036942533,0.0006700018],"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.00014621617,0.000636506,0.0028721471,0.0005865768,0.00016989431,0.0009045458,0.0020134996,0.031102775,0.0141024515,0.56589144,0.010335401,0.37123853],"study_design_scores_gemma":[0.000041722018,0.00008908281,0.001189799,0.00047695392,0.00026485012,0.0011390861,0.00062851136,0.48694706,0.020141482,0.33949146,0.14941363,0.00017630376],"about_ca_topic_score_codex":0.007957684,"about_ca_topic_score_gemma":0.0074058804,"teacher_disagreement_score":0.007957684,"about_ca_system_score_codex":0.0015203614,"about_ca_system_score_gemma":0.0046374286,"threshold_uncertainty_score":0.023517966},"labels":[],"label_agreement":null},{"id":"W2114078774","doi":"10.1007/978-3-540-78499-9_7","title":"A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Dalhousie University","funders":"","keywords":"Linear logic; Monad (category theory); Lambda calculus; Mathematics; Simply typed lambda calculus; Operator (biology); Algebra over a field; Categorical variable; Calculus (dental); Typed lambda calculus; Discrete mathematics; Pure mathematics; Functor","score_opus":0.023988883625357695,"score_gpt":0.27258825112380214,"score_spread":0.24859936749844444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114078774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009068119,0.00056654343,0.9489135,0.001936303,0.00020510195,0.0000945331,0.00034638558,0.0011266589,0.0377429],"genre_scores_gemma":[0.512195,0.00085914246,0.41742676,0.0013510828,0.0005352686,0.000550501,0.0008059713,0.0007793206,0.06549687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894506,0.00026882175,0.00006672945,0.00022322286,0.00031745556,0.00017870605],"domain_scores_gemma":[0.9992537,0.00030502072,0.000055566783,0.0001631676,0.00013726782,0.00008531213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328494,0.0008679839,0.00082063675,0.00066339696,0.0019022216,0.0062929373,0.003269001,0.0021722275,0.011996917],"category_scores_gemma":[0.0017549753,0.0010089335,0.00218052,0.0012773758,0.0049046865,0.0068097464,0.0026128239,0.004567861,0.0029974151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128258835,0.000017537408,0.000034997018,0.000026873835,0.0000037601694,0.000043695487,0.00013407158,0.002131525,0.0004287634,0.99445504,0.00076909154,0.001941879],"study_design_scores_gemma":[0.000020697256,0.0000131984025,0.000038115995,0.00001607722,0.000012561066,0.0000408831,0.000038022725,0.024032624,0.00060634135,0.96709096,0.008076386,0.000014144055],"about_ca_topic_score_codex":0.0048013236,"about_ca_topic_score_gemma":0.0048220456,"teacher_disagreement_score":0.011996917,"about_ca_system_score_codex":0.0028106235,"about_ca_system_score_gemma":0.0020955577,"threshold_uncertainty_score":0.040133715},"labels":[],"label_agreement":null},{"id":"W2114469058","doi":"10.1007/978-3-540-73595-3_9","title":"Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Sequent; Sequent calculus; Natural deduction; Modal logic; Propositional calculus; Propositional variable; Mathematics; Modal; Intuitionistic logic; Calculus (dental); Proof calculus; Context (archaeology); Mathematical proof; Rule of inference; Algorithm; Discrete mathematics; Computer science; Intermediate logic; Theoretical computer science; Artificial intelligence","score_opus":0.0322580257941768,"score_gpt":0.2830085204254982,"score_spread":0.2507504946313214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114469058","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.016024182,0.000533968,0.9246908,0.0011451268,0.00021125702,0.00017175141,0.0005003738,0.0010159218,0.055706613],"genre_scores_gemma":[0.42670503,0.00094686,0.52854395,0.0005023108,0.00027521735,0.00047404013,0.0014304401,0.00061153993,0.040510546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981111,0.00069851126,0.0001362059,0.00026391234,0.0005595679,0.00023058613],"domain_scores_gemma":[0.99773383,0.0013907537,0.00008471525,0.00032424138,0.0003717914,0.00009460705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027575267,0.00068317674,0.00065272104,0.0010309652,0.0015940737,0.0034329793,0.0016367143,0.0011031191,0.019612443],"category_scores_gemma":[0.005031848,0.00056398514,0.0019285604,0.0011115898,0.0018552231,0.005428712,0.0022526605,0.0029507142,0.0032020235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007142555,0.00004557597,0.00010097363,0.00008952152,0.000016501846,0.000015990952,0.00011686379,0.0018006394,0.0009444619,0.94353795,0.003977183,0.04928294],"study_design_scores_gemma":[0.00002663392,0.000021181826,0.00009155267,0.00005106283,0.000035079145,0.00003537795,0.000059509322,0.024200195,0.003398655,0.96022826,0.011833133,0.00001933242],"about_ca_topic_score_codex":0.0015615007,"about_ca_topic_score_gemma":0.0021468715,"teacher_disagreement_score":0.019612443,"about_ca_system_score_codex":0.0016718243,"about_ca_system_score_gemma":0.0022885196,"threshold_uncertainty_score":0.06561011},"labels":[],"label_agreement":null},{"id":"W2114482060","doi":"10.1007/978-3-642-12659-8_11","title":"Nonlinear Time-Dependent Density Functional Theory Studies of Ionization in CO2 and N2 by Intense Laser Pulses and Molecular Orbital Reconstruction","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Laser-Matter Interactions and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Ionization; Molecular orbital; Time-dependent density functional theory; Atomic physics; Atomic orbital; Density functional theory; Physics; Laser; Dipole; Molecular physics; Optics; Molecule; Electron; Quantum mechanics; Ion","score_opus":0.007659331911971908,"score_gpt":0.23197083465024565,"score_spread":0.22431150273827374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114482060","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.8988839,0.0031741941,0.044500243,0.0014567305,0.00015853014,0.0000764825,0.0003509231,0.000208649,0.051190484],"genre_scores_gemma":[0.97795063,0.0010641201,0.009427776,0.00011304992,0.00006539565,0.00004984123,0.00018986923,0.00009817106,0.011041117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985945,0.000035609824,0.000005500327,0.000012291144,0.00005714439,0.00003008717],"domain_scores_gemma":[0.9995952,0.00026161567,0.000029978299,0.0000378018,0.0000507635,0.000024579718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005179124,0.00042660584,0.00052940275,0.0004625218,0.0008502156,0.0005968567,0.0016093809,0.00070616766,0.0031308106],"category_scores_gemma":[0.0008171183,0.00030838538,0.0005447021,0.0006805855,0.0012821173,0.0011126254,0.00073435693,0.0012788117,0.00020619428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082369504,0.0005118269,0.0019744688,0.0005931738,0.0001536915,0.00082625274,0.001160339,0.4795327,0.09146411,0.39767253,0.0054633096,0.019823972],"study_design_scores_gemma":[0.000029811714,0.000019781177,0.0009599969,0.000009511673,0.000005371794,0.00004652868,0.0000640491,0.9813556,0.004749906,0.012158569,0.0005728584,0.000027998942],"about_ca_topic_score_codex":0.0067068455,"about_ca_topic_score_gemma":0.0069448114,"teacher_disagreement_score":0.0067068455,"about_ca_system_score_codex":0.0010492107,"about_ca_system_score_gemma":0.00043405252,"threshold_uncertainty_score":0.013335586},"labels":[],"label_agreement":null},{"id":"W2114557229","doi":"10.1007/978-3-540-87875-9_14","title":"Detecting Patterns of Poor Design Solutions Using Constraint Propagation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Constraint satisfaction problem; Representation (politics); Constraint (computer-aided design); Constraint satisfaction; Pattern matching; Local consistency; Context (archaeology); Matching (statistics); Software design pattern; Solver; Theoretical computer science; Design pattern; Artificial intelligence; Programming language; Mathematics","score_opus":0.048048809938583396,"score_gpt":0.24974731238823408,"score_spread":0.20169850244965068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114557229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43969825,0.0012628234,0.533861,0.0011750206,0.00014671398,0.0008157982,0.005359836,0.009795955,0.0078845555],"genre_scores_gemma":[0.5399732,0.0003845133,0.45164534,0.00027796865,0.000040952254,0.00033389035,0.004160384,0.0009738272,0.0022098974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940427,0.0007731425,0.00042196576,0.0008583389,0.0034949929,0.0004088434],"domain_scores_gemma":[0.9546139,0.026709687,0.009373943,0.0035153662,0.005098703,0.0006883107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023621507,0.001890763,0.0013233646,0.007464055,0.0010092297,0.0015858888,0.0026313423,0.001729705,0.0041279104],"category_scores_gemma":[0.028209357,0.0010642846,0.0014571318,0.0061706,0.0009245428,0.0026804172,0.0015788865,0.0021400545,0.00068611884],"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.0014625376,0.0012542999,0.13002847,0.0031230943,0.00091591716,0.0029911022,0.0011463142,0.13645035,0.050049886,0.01732497,0.020340469,0.63491255],"study_design_scores_gemma":[0.00015426835,0.00044449602,0.022271382,0.0003354186,0.00047936515,0.0016419212,0.00070712634,0.9082672,0.031249264,0.026425425,0.007883165,0.00014089023],"about_ca_topic_score_codex":0.007317023,"about_ca_topic_score_gemma":0.020229362,"teacher_disagreement_score":0.007464055,"about_ca_system_score_codex":0.0008791688,"about_ca_system_score_gemma":0.0027518913,"threshold_uncertainty_score":0.014548898},"labels":[],"label_agreement":null},{"id":"W2114600785","doi":"10.1007/978-3-540-74970-7_49","title":"Hierarchical Hardness Models for SAT","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":47,"is_retracted":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":"Classifier (UML); Computer science; Boolean satisfiability problem; Solver; Class (philosophy); Artificial intelligence; Machine learning; Algorithm","score_opus":0.06872056972064919,"score_gpt":0.32058859081652596,"score_spread":0.2518680210958768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114600785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026208874,0.0019942168,0.7028537,0.007978446,0.0004404732,0.00037354606,0.002260952,0.002308075,0.2555817],"genre_scores_gemma":[0.73212,0.0018224913,0.1670233,0.002309419,0.0010844911,0.0011884719,0.0058040465,0.0013321054,0.08731572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975309,0.0006347863,0.00014382273,0.0005231285,0.00081772584,0.00034970485],"domain_scores_gemma":[0.9946226,0.0031471828,0.00024459133,0.0013632299,0.0003513373,0.00027105157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585107,0.001431824,0.001438843,0.0018202523,0.0022779633,0.004207607,0.0038233101,0.0021121416,0.039211836],"category_scores_gemma":[0.0075124907,0.0014179603,0.002990933,0.0024630409,0.0039382605,0.011288042,0.0044814316,0.009088133,0.004904365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002337306,0.000028713956,0.00007943291,0.00006955656,0.000010195375,0.000017406297,0.00009288552,0.004771327,0.00015867827,0.98254436,0.005236289,0.006967744],"study_design_scores_gemma":[0.000012302815,0.0000066317784,0.000074742034,0.000014527634,0.000006866578,0.000015872574,0.000021748992,0.011658558,0.00012896642,0.98443246,0.0036208783,0.0000063575026],"about_ca_topic_score_codex":0.0024662649,"about_ca_topic_score_gemma":0.0036432182,"teacher_disagreement_score":0.039211836,"about_ca_system_score_codex":0.003991922,"about_ca_system_score_gemma":0.0015311044,"threshold_uncertainty_score":0.13117665},"labels":[],"label_agreement":null},{"id":"W2114629782","doi":"10.1007/978-3-642-39112-5_97","title":"Modelling Students’ Knowledge of Ethics","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Law","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Ambiguity; Computer science; Representation (politics); Task (project management); Domain knowledge; Quality (philosophy); Domain (mathematical analysis); Affect (linguistics); Knowledge representation and reasoning; Knowledge management; Artificial intelligence; Mathematics education; Psychology; Epistemology; Mathematics; Management; Programming language","score_opus":0.12060973906278714,"score_gpt":0.38879849090429625,"score_spread":0.2681887518415091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114629782","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.5776197,0.00028766997,0.118566856,0.0048382403,0.00006782915,0.00006594062,0.00022276261,0.00011832062,0.29821274],"genre_scores_gemma":[0.9884149,0.000063295956,0.003730923,0.00004197198,0.000005901539,0.000026185486,0.00006579629,0.000014821844,0.007636275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989579,0.0006305411,0.000026124064,0.00010427635,0.00015818753,0.0001231113],"domain_scores_gemma":[0.9914215,0.006614337,0.0004123153,0.0005866005,0.00053109234,0.00043404388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017044303,0.00025513506,0.00022594287,0.00056208007,0.0005790584,0.002936194,0.0009033883,0.0013924146,0.013085766],"category_scores_gemma":[0.01624236,0.00022508325,0.00034943243,0.00055392925,0.0019075877,0.0042171315,0.0016549675,0.0019785762,0.0005245076],"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.00004497211,0.00018521748,0.007863148,0.000034581753,0.000021407177,0.00010861709,0.0033540665,0.046020683,0.00016753889,0.9200316,0.0022087998,0.019959323],"study_design_scores_gemma":[0.000019202611,0.000039937953,0.002228429,0.000039916245,0.000011385257,0.000058526835,0.0016688104,0.18568286,0.00023128791,0.80140114,0.008602773,0.000015678244],"about_ca_topic_score_codex":0.0077881385,"about_ca_topic_score_gemma":0.0065402533,"teacher_disagreement_score":0.013085766,"about_ca_system_score_codex":0.0021752394,"about_ca_system_score_gemma":0.0014230907,"threshold_uncertainty_score":0.043776214},"labels":[],"label_agreement":null},{"id":"W2114745453","doi":"10.1007/978-3-642-15711-0_26","title":"Predicting Target Vessel Location for Improved Planning of Robot-Assisted CABG Procedures","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac and Coronary Surgery Techniques","field":"Medicine","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":"Western University; Robarts Clinical Trials","funders":"","keywords":"Computer science; Robot; Artificial intelligence; Computer vision","score_opus":0.012081291725021202,"score_gpt":0.2816329721924041,"score_spread":0.26955168046738287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114745453","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.23520479,0.0008218871,0.7574198,0.00029242248,0.00006343137,0.000088112436,0.00058883504,0.003305268,0.0022154888],"genre_scores_gemma":[0.88229793,0.00030872025,0.11561767,0.000037692298,0.000027793114,0.00006729755,0.00035425834,0.00010447731,0.0011842274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988616,0.00003391005,0.0000081659655,0.000024535902,0.000029930312,0.000017216913],"domain_scores_gemma":[0.9996356,0.00022169907,0.00003491788,0.000019829971,0.00006701449,0.000020942949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002252928,0.00059325027,0.00047899032,0.00056083367,0.00024957565,0.000488415,0.00044267546,0.00054012536,0.0016827575],"category_scores_gemma":[0.0014675697,0.0004921976,0.00037684225,0.00030143917,0.00014367615,0.0003040562,0.0002797244,0.00039912955,0.0004315377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093775097,0.00010116715,0.012519443,0.000117659416,0.000059622223,0.00028223707,0.000087790744,0.74192303,0.024568165,0.00078752066,0.0030159645,0.21559972],"study_design_scores_gemma":[0.000021169637,0.00010861737,0.003189854,0.0000065668905,0.000026165855,0.00008864965,0.000014529185,0.989518,0.006086422,0.00061279075,0.00031464445,0.000012623175],"about_ca_topic_score_codex":0.008576633,"about_ca_topic_score_gemma":0.013491979,"teacher_disagreement_score":0.008576633,"about_ca_system_score_codex":0.0003012958,"about_ca_system_score_gemma":0.00080075744,"threshold_uncertainty_score":0.017053425},"labels":[],"label_agreement":null},{"id":"W2114896656","doi":"10.1007/978-3-642-13797-6_9","title":"On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":40,"is_retracted":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":"Type (biology); Computer science; Cryptographic protocol; Protocol (science); Cryptographic primitive; Cryptography; Elliptic curve; Security analysis; Theoretical computer science; Hash function; Signature (topology); Focus (optics); Genus; Computer security; Mathematics; Pure mathematics; Physics; Geometry","score_opus":0.012356515870563987,"score_gpt":0.2477839964129268,"score_spread":0.23542748054236282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114896656","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.2736712,0.015909258,0.49526766,0.009910824,0.00096519047,0.0005625027,0.0011831548,0.00065126625,0.20187896],"genre_scores_gemma":[0.8802179,0.007014062,0.085739724,0.0007965786,0.0012402191,0.000670686,0.00068347465,0.00046959874,0.0231677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9799597,0.009535023,0.0011202173,0.0019593586,0.0046968134,0.0027289498],"domain_scores_gemma":[0.9317403,0.05171802,0.0022267934,0.011594609,0.0018389617,0.0008814323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016853122,0.0026163803,0.0038748058,0.0034197061,0.0035594534,0.010105906,0.005037473,0.0045037256,0.00945451],"category_scores_gemma":[0.03288595,0.001994854,0.0031859584,0.0047474992,0.010964349,0.031116283,0.00915128,0.011718485,0.002454856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006580758,0.00011593594,0.0006212446,0.00016596988,0.00007003,0.00010518584,0.0003348394,0.011117502,0.001670308,0.96429205,0.002410185,0.018438693],"study_design_scores_gemma":[0.000083043844,0.00008140424,0.00025424772,0.00008322373,0.00005964602,0.0001685545,0.000087433255,0.034337826,0.0019492966,0.9603069,0.0025429295,0.000045623372],"about_ca_topic_score_codex":0.0006153569,"about_ca_topic_score_gemma":0.00044962307,"teacher_disagreement_score":0.016853122,"about_ca_system_score_codex":0.0051102033,"about_ca_system_score_gemma":0.0034325502,"threshold_uncertainty_score":0.08912891},"labels":[],"label_agreement":null},{"id":"W2114943251","doi":"10.1007/978-3-540-30189-9_15","title":"Automated Validation of Service Configuration on Network Devices","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Formalism (music); Service (business); Data mining; Distributed computing; Tree (set theory); Data validation; Model checking; Network service; Software engineering; Database; Theoretical computer science; Computer network","score_opus":0.013358117516101255,"score_gpt":0.2419084413593327,"score_spread":0.22855032384323146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114943251","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.24194323,0.0005736488,0.65989786,0.0004910919,0.00033065383,0.0003628133,0.00080088887,0.08755001,0.008049776],"genre_scores_gemma":[0.91241467,0.000121072095,0.08215683,0.00013167015,0.000041812003,0.00012303078,0.0009598242,0.0016580323,0.0023931742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898817,0.0037877164,0.0005596998,0.0011688162,0.0037796784,0.0008224783],"domain_scores_gemma":[0.9720062,0.011327212,0.001597805,0.011567868,0.0031092137,0.0003917216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036052195,0.0015693427,0.0017727156,0.0021059527,0.0012769275,0.0036649255,0.0034254119,0.0020952078,0.0038855467],"category_scores_gemma":[0.018681085,0.0010664271,0.0010068418,0.0011392658,0.0019288476,0.0034985607,0.0029968212,0.0016780524,0.0017223778],"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.003712876,0.00071560184,0.02230335,0.0007612647,0.0003990715,0.001849338,0.0011279447,0.28852603,0.11605868,0.038834944,0.021415934,0.504295],"study_design_scores_gemma":[0.00008316892,0.00012794344,0.0024104177,0.00007064919,0.000053897107,0.00024863775,0.00012226171,0.9031993,0.07223184,0.016830692,0.0045632105,0.000057976657],"about_ca_topic_score_codex":0.004442694,"about_ca_topic_score_gemma":0.004279655,"teacher_disagreement_score":0.004442694,"about_ca_system_score_codex":0.0019003791,"about_ca_system_score_gemma":0.0022586745,"threshold_uncertainty_score":0.019066453},"labels":[],"label_agreement":null},{"id":"W2114946268","doi":"10.1007/11553939_2","title":"A Novel Approach for Developing Autonomous and Collaborative Agents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Adaptation (eye); Component (thermodynamics); Process (computing); Human–computer interaction; Collaborative learning; Product (mathematics); Multi-agent system; Autonomous agent; Artificial intelligence; Knowledge management","score_opus":0.038476634898069774,"score_gpt":0.27054261433176535,"score_spread":0.23206597943369559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114946268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025626742,0.0000880017,0.9866954,0.00019035598,0.00006286433,0.00009904115,0.000017040038,0.00055614463,0.009728447],"genre_scores_gemma":[0.042152673,0.00014958724,0.9447965,0.00010126948,0.00002184174,0.00027762778,0.00006127923,0.00012156812,0.012317644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986412,0.00029541246,0.000066537155,0.00027944852,0.0006211922,0.00009622961],"domain_scores_gemma":[0.99920064,0.00028216917,0.000065164466,0.00024225627,0.000115948744,0.000093953786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011280462,0.00067279703,0.0004942267,0.000545599,0.00130568,0.002268986,0.002597683,0.0017030817,0.0046669007],"category_scores_gemma":[0.002288143,0.0006662599,0.00079004816,0.0005829575,0.001814335,0.0030425685,0.0046762796,0.0019252094,0.0016052435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009194513,0.00020310574,0.00046993527,0.00033872935,0.00007588509,0.00046123128,0.0023132626,0.023555946,0.03373073,0.68094754,0.0075588054,0.25025293],"study_design_scores_gemma":[0.00012588405,0.00026753126,0.0002689868,0.0001093518,0.00013688883,0.001300238,0.0005595521,0.3077824,0.034192298,0.37687472,0.27830198,0.000080121994],"about_ca_topic_score_codex":0.001117724,"about_ca_topic_score_gemma":0.0022235783,"teacher_disagreement_score":0.0046669007,"about_ca_system_score_codex":0.0005552896,"about_ca_system_score_gemma":0.0015663152,"threshold_uncertainty_score":0.015612304},"labels":[],"label_agreement":null},{"id":"W2115030409","doi":"10.1007/978-3-642-23765-2_32","title":"The Continuous Interaction Space: Interaction Techniques Unifying Touch and Gesture on and above a Digital Surface","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":115,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Gesture; Modalities; Computer science; Human–computer interaction; Space (punctuation); Leverage (statistics); Interaction technique; Artificial intelligence","score_opus":0.014328832199052103,"score_gpt":0.25332379654930104,"score_spread":0.23899496435024895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115030409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01484372,0.007373941,0.94096303,0.0002050999,0.00036000716,0.000079180514,0.00009220953,0.001611548,0.03447128],"genre_scores_gemma":[0.35147923,0.008479585,0.56350315,0.00031466986,0.000308849,0.00056821085,0.00036196713,0.0010641753,0.07392015],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995135,0.000100230725,0.000019634585,0.000097963144,0.00021698078,0.0000516624],"domain_scores_gemma":[0.9995652,0.00026142056,0.000016406017,0.00008467461,0.000039931627,0.00003230686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003737429,0.0010415195,0.0005237572,0.00064634555,0.00055302685,0.0026605495,0.0015640447,0.0010949486,0.014985713],"category_scores_gemma":[0.0010065737,0.0004590584,0.0005955231,0.000911997,0.0018549865,0.003682718,0.0029092957,0.001473397,0.0020749213],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043781704,0.00012808165,0.00023959926,0.0010266725,0.000072725205,0.000352305,0.003752815,0.0036865466,0.217658,0.15689762,0.013065114,0.6026827],"study_design_scores_gemma":[0.0003334109,0.0013909887,0.0033220674,0.0007471352,0.0003020444,0.005379589,0.0033729426,0.0921019,0.16808727,0.1685992,0.556056,0.0003074667],"about_ca_topic_score_codex":0.00030620396,"about_ca_topic_score_gemma":0.00044504658,"teacher_disagreement_score":0.014985713,"about_ca_system_score_codex":0.0001901497,"about_ca_system_score_gemma":0.0002942364,"threshold_uncertainty_score":0.050132215},"labels":[],"label_agreement":null},{"id":"W2115083386","doi":"10.1007/978-3-642-04174-7_43","title":"Learning the Difference between Partially Observable Dynamical Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Université Laval; McGill University","funders":"","keywords":"Observable; Computer science; Markov decision process; Divergence (linguistics); Reinforcement learning; Dynamical systems theory; Key (lock); Temporal difference learning; Markov process; Markov chain; Artificial intelligence; Process (computing); Mathematical optimization; Machine learning; Mathematics; Statistics","score_opus":0.025984326590315347,"score_gpt":0.24446419850116202,"score_spread":0.21847987191084667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115083386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07526908,0.00040296628,0.91992664,0.00042758632,0.00013687584,0.000032609696,0.000089739086,0.00035460794,0.0033598158],"genre_scores_gemma":[0.90827775,0.00024335111,0.08763633,0.000115745155,0.00007163843,0.000081640625,0.00024520454,0.000055981218,0.0032723416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930847,0.0002287291,0.000041336654,0.00020071842,0.00017035028,0.000050377635],"domain_scores_gemma":[0.9952094,0.003888085,0.0002211517,0.00030373377,0.00022132746,0.00015622623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015077788,0.0004567291,0.0008455677,0.0003645122,0.00019346812,0.0008867414,0.0012036219,0.0008923366,0.0028486603],"category_scores_gemma":[0.00962594,0.0004553697,0.00039868202,0.00026918488,0.0011309098,0.0026883804,0.001929607,0.0022464243,0.0002730841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042921584,0.000134629,0.0025479149,0.00031549082,0.00010198163,0.000087096014,0.00019641426,0.5602937,0.005422303,0.19682899,0.0016406063,0.23200166],"study_design_scores_gemma":[0.000019749557,0.00007824954,0.00024277467,0.000011435094,0.000006387787,0.000017142225,0.00000879917,0.92143553,0.0006715333,0.07705445,0.00044469934,0.000009319168],"about_ca_topic_score_codex":0.00069306593,"about_ca_topic_score_gemma":0.0007601373,"teacher_disagreement_score":0.0028486603,"about_ca_system_score_codex":0.00059249956,"about_ca_system_score_gemma":0.00044110362,"threshold_uncertainty_score":0.00952971},"labels":[],"label_agreement":null},{"id":"W2115161547","doi":"10.1007/978-3-642-00602-9_1","title":"Applications of MetiTarski in the Verification of Control and Hybrid Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Hybrid system; Inverted pendulum; Trigonometry; Control system; Maple; Trigonometric functions; Stability (learning theory); Control (management); Control theory (sociology); Algorithm; Control engineering; Mathematics; Artificial intelligence; Machine learning","score_opus":0.015217009148785066,"score_gpt":0.2601215772770818,"score_spread":0.24490456812829672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115161547","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.0034665647,0.008396283,0.9521675,0.0007922188,0.00039792014,0.00007019656,0.00009408463,0.00077492645,0.03384036],"genre_scores_gemma":[0.2817149,0.011069991,0.66998404,0.0006051868,0.00055762636,0.00037377182,0.0002758653,0.00069507933,0.03472363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869424,0.00041541317,0.00013248969,0.00022087249,0.0004674011,0.00006960514],"domain_scores_gemma":[0.99873286,0.00083658635,0.000081277656,0.00020960934,0.00011163109,0.000027896143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020371918,0.0014004109,0.0013938686,0.0017677038,0.0009977986,0.0018030608,0.0013152293,0.0010605343,0.0048700487],"category_scores_gemma":[0.0037291949,0.0012927166,0.0020559966,0.0014339937,0.0025516332,0.0031886718,0.0021248427,0.003528592,0.0019930026],"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.00010183479,0.000046097506,0.0002678293,0.0007487239,0.000089135014,0.00034023297,0.00050239457,0.023156658,0.0054701488,0.85244226,0.004536972,0.1122977],"study_design_scores_gemma":[0.00004640592,0.00008496729,0.00029384263,0.0003116317,0.000066822664,0.0005391522,0.00006745469,0.09141821,0.0086907735,0.82359576,0.0748211,0.00006396991],"about_ca_topic_score_codex":0.0010798187,"about_ca_topic_score_gemma":0.0014077238,"teacher_disagreement_score":0.0048700487,"about_ca_system_score_codex":0.0012473227,"about_ca_system_score_gemma":0.0008107839,"threshold_uncertainty_score":0.016291976},"labels":[],"label_agreement":null},{"id":"W2115185960","doi":"10.1007/978-3-319-19315-1_27","title":"Kinetic Reverse k-Nearest Neighbor Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Combinatorics; Integer (computer science); Dimension (graph theory); Kinetic energy; Set (abstract data type); Nearest-neighbor chain algorithm; Point (geometry); Computer science; Nearest neighbor search; Nearest neighbor graph; Algorithm; Mathematics; Discrete mathematics; Physics; Geometry; Artificial intelligence; Cluster analysis; Quantum mechanics","score_opus":0.02665015439700633,"score_gpt":0.254776265792872,"score_spread":0.22812611139586567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115185960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271581,0.0019417313,0.8599668,0.0037518642,0.0011704366,0.00020106148,0.0016053327,0.00055181206,0.06809517],"genre_scores_gemma":[0.6303889,0.0023617407,0.26581037,0.0010751768,0.0007824831,0.00039034983,0.004306527,0.0005006392,0.094383724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.00019963154,0.000060295206,0.00023892401,0.0002558755,0.00009359951],"domain_scores_gemma":[0.99841595,0.0007815082,0.00013324777,0.0002812743,0.0002825842,0.00010537711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096037483,0.0005598363,0.0015078821,0.0006533272,0.0010284891,0.0022764585,0.0033958103,0.002641149,0.012407951],"category_scores_gemma":[0.005793022,0.00040057002,0.0008600238,0.001064779,0.0011400861,0.0044784625,0.0021576693,0.002437485,0.0022871785],"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.00047562242,0.00020531983,0.00089897297,0.0009813732,0.00009071805,0.0003739202,0.00019227296,0.19625464,0.0027088847,0.59864765,0.047509775,0.15166089],"study_design_scores_gemma":[0.000095025716,0.00006023388,0.0002251057,0.00006731851,0.00003698832,0.00051070884,0.00017425195,0.57338494,0.0019230536,0.40627393,0.01720819,0.00004020263],"about_ca_topic_score_codex":0.0016365586,"about_ca_topic_score_gemma":0.001411137,"teacher_disagreement_score":0.012407951,"about_ca_system_score_codex":0.0008504433,"about_ca_system_score_gemma":0.00091087545,"threshold_uncertainty_score":0.041508734},"labels":[],"label_agreement":null},{"id":"W2115612901","doi":"10.1007/978-3-642-15579-6_15","title":"Linking Feature Models to Code Artifacts Using Executable Acceptance Tests","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Traceability; Computer science; Feature model; Executable; Feature (linguistics); Software engineering; Reuse; Consistency (knowledge bases); Source code; Code (set theory); Program comprehension; Programming language; Process (computing); Data mining; Artificial intelligence; Software system; Software","score_opus":0.06988090815732995,"score_gpt":0.3075037199701438,"score_spread":0.23762281181281386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115612901","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.11706384,0.000079664096,0.8617327,0.00024963394,0.000077777724,0.00035709087,0.0002861077,0.0138434805,0.006309725],"genre_scores_gemma":[0.67698145,0.00009708099,0.31556723,0.00010714654,0.000019856443,0.00028710198,0.001185925,0.0023960911,0.0033580638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99316835,0.0022545347,0.00038250608,0.0006321887,0.003203231,0.0003591351],"domain_scores_gemma":[0.9604608,0.024972063,0.002015963,0.00692769,0.0052676406,0.0003558805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004469708,0.001319291,0.0005936196,0.002709254,0.0004871113,0.0030204696,0.00247044,0.002295365,0.0068853325],"category_scores_gemma":[0.05104382,0.00096910953,0.0014407735,0.0010804738,0.0009917459,0.004677807,0.0025096103,0.0021386528,0.001570212],"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.0010438318,0.0018541869,0.03213624,0.0010103118,0.00034212714,0.0023116586,0.0033962496,0.26621607,0.05822402,0.06782597,0.0077429647,0.55789644],"study_design_scores_gemma":[0.00007387281,0.0002891385,0.0023808838,0.0001339967,0.00012739608,0.00023271183,0.00027086723,0.92825323,0.030471057,0.032364734,0.005325997,0.00007597743],"about_ca_topic_score_codex":0.002753343,"about_ca_topic_score_gemma":0.0037881252,"teacher_disagreement_score":0.0068853325,"about_ca_system_score_codex":0.00086575985,"about_ca_system_score_gemma":0.0011832499,"threshold_uncertainty_score":0.023638368},"labels":[],"label_agreement":null},{"id":"W2115672204","doi":"10.1007/978-3-642-03007-9_7","title":"Privacy-Preserving Telemonitoring for eHealth","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":31,"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":"eHealth; Protocol (science); Computer science; Internet privacy; Telemedicine; Process (computing); Health care; Computer security; Medical emergency; Medicine","score_opus":0.03560888224501386,"score_gpt":0.2943824187099434,"score_spread":0.25877353646492957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115672204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006273159,0.0064502642,0.95029336,0.002195649,0.00042439371,0.00007722771,0.00022685589,0.0011854175,0.03287361],"genre_scores_gemma":[0.562092,0.01450553,0.32768223,0.0014013501,0.0010572172,0.00024352626,0.0008066025,0.00029805722,0.09191353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893326,0.0002917672,0.00007881348,0.00017244516,0.00043742094,0.00008633296],"domain_scores_gemma":[0.9988833,0.0005467019,0.000075804855,0.00035756748,0.00011360507,0.000022980752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010810533,0.00046912336,0.0004474986,0.0003916811,0.00047914262,0.0020179371,0.0012164987,0.0015186216,0.006034543],"category_scores_gemma":[0.0023748735,0.00033066428,0.000536994,0.0007466182,0.0009132792,0.003352666,0.0013410758,0.0015953014,0.0020637822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002455469,0.00008517161,0.0004328483,0.000564711,0.000042914147,0.0005870069,0.0004949991,0.013133115,0.018470673,0.40535203,0.021299873,0.5392912],"study_design_scores_gemma":[0.000053854157,0.00025985643,0.0010564206,0.0003871356,0.00009899006,0.002894902,0.00028371284,0.15126958,0.06900635,0.5061877,0.26841754,0.00008394994],"about_ca_topic_score_codex":0.00031197985,"about_ca_topic_score_gemma":0.000274412,"teacher_disagreement_score":0.006034543,"about_ca_system_score_codex":0.0005664061,"about_ca_system_score_gemma":0.00039499204,"threshold_uncertainty_score":0.020187616},"labels":[],"label_agreement":null},{"id":"W2115923606","doi":"10.1007/978-3-540-85230-8_14","title":"Weighing Down “The Unbearable Lightness of PIN Cracking”","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Carleton University","funders":"","keywords":"Computer science; Issuer; Cracking; ATM card; Operating system; Computer network; Embedded system; Payment; Chemistry; World Wide Web; Finance","score_opus":0.01618204368452554,"score_gpt":0.23417412414593197,"score_spread":0.21799208046140645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115923606","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031768847,0.07147321,0.17539255,0.067373656,0.029084744,0.00016793601,0.00025503448,0.0029800604,0.6215039],"genre_scores_gemma":[0.3197285,0.04290584,0.055264764,0.023457237,0.007097124,0.000119578275,0.00022933283,0.0017071924,0.5494905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903,0.00014634317,0.000027751556,0.00013496353,0.00055916345,0.000101766476],"domain_scores_gemma":[0.9975555,0.0008500076,0.00014673507,0.0004024072,0.0009094689,0.00013578386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787237,0.0008404376,0.0004343789,0.0012742232,0.002077753,0.0023136672,0.0015720954,0.0023961985,0.03081671],"category_scores_gemma":[0.007485656,0.00054115313,0.00046536233,0.0007487451,0.0036260572,0.00726827,0.0028066838,0.0038962807,0.007003388],"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.0002765375,0.000055404264,0.0009567572,0.00072593946,0.000041736384,0.001007087,0.0015249749,0.0026402355,0.01240528,0.20248328,0.24245206,0.5354308],"study_design_scores_gemma":[0.000018747878,0.00016803,0.0012118293,0.00058475486,0.00004479037,0.0035960453,0.0013503043,0.0034886324,0.014874202,0.12063372,0.85392237,0.00010645268],"about_ca_topic_score_codex":0.001594713,"about_ca_topic_score_gemma":0.0026413526,"teacher_disagreement_score":0.03081671,"about_ca_system_score_codex":0.0008527255,"about_ca_system_score_gemma":0.0006655973,"threshold_uncertainty_score":0.103092134},"labels":[],"label_agreement":null},{"id":"W2116094893","doi":"10.1007/978-3-540-74260-9_65","title":"Iterated Fourier Transform Systems: A Method for Frequency Extrapolation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Extrapolation; Fourier transform; Fractal; Iterated function system; Frequency domain; Algorithm; Fourier analysis; Iterated function; Mathematics; Grayscale; Computer science; Artificial intelligence; Image (mathematics); Mathematical analysis","score_opus":0.03906538429664404,"score_gpt":0.3195791047730406,"score_spread":0.28051372047639656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116094893","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.0013507617,0.0003269425,0.9952868,0.00005479459,0.00010086478,0.000017463652,0.000033650962,0.00036181058,0.0024667939],"genre_scores_gemma":[0.03734802,0.0013026638,0.9443584,0.000103645274,0.00022581803,0.000120364166,0.00017350863,0.0005074129,0.015860155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969184,0.00008305133,0.00001674332,0.000047746747,0.0001427385,0.00001792478],"domain_scores_gemma":[0.9996606,0.0001502931,0.000024094756,0.00007014974,0.00007698948,0.000017920975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651852,0.0009075038,0.00081861083,0.00093348767,0.0004312733,0.0010635301,0.0011673066,0.0013179196,0.0063803717],"category_scores_gemma":[0.0018526695,0.00043624372,0.00082346424,0.0007900335,0.00069824804,0.0014457633,0.0012929289,0.0018223171,0.0032277405],"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.00017964136,0.00010268296,0.00042599687,0.00043423407,0.00011328007,0.00042981608,0.00037219413,0.079472475,0.042330015,0.34285238,0.018503781,0.51478356],"study_design_scores_gemma":[0.000025416055,0.00008699295,0.0002666321,0.000070695896,0.000051445906,0.000580719,0.00005465989,0.82939476,0.013465639,0.114500396,0.04144838,0.000054322154],"about_ca_topic_score_codex":0.0006650631,"about_ca_topic_score_gemma":0.00097329385,"teacher_disagreement_score":0.0063803717,"about_ca_system_score_codex":0.00024836336,"about_ca_system_score_gemma":0.00044353417,"threshold_uncertainty_score":0.021344483},"labels":[],"label_agreement":null},{"id":"W2116129845","doi":"10.1007/3-540-45357-1_46","title":"Hierarchical Classification of Documents with Error Control","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Data mining; One-class classification; Machine learning; Pattern recognition (psychology); Software","score_opus":0.020458997378542176,"score_gpt":0.2710244702270422,"score_spread":0.2505654728485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116129845","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.016127082,0.000706379,0.9788103,0.00018473151,0.00014952582,0.00024908507,0.00044031587,0.0027654234,0.0005671121],"genre_scores_gemma":[0.22301194,0.00040330083,0.76539814,0.00019136436,0.0003374525,0.00053476344,0.003440496,0.00047069552,0.0062118866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9879017,0.0034108388,0.0013942058,0.0023020748,0.0041806893,0.00081045745],"domain_scores_gemma":[0.9729375,0.011965383,0.0012499096,0.0075493013,0.0058584968,0.00043925212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014000928,0.001266544,0.0029023585,0.0043551787,0.0013714071,0.00284972,0.003506853,0.0017294161,0.0032415234],"category_scores_gemma":[0.030793063,0.00081973086,0.0018990013,0.004311123,0.0012944575,0.0039727115,0.0029373108,0.0025215573,0.002055256],"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.00073376636,0.00044575243,0.00373816,0.00035424333,0.00025602916,0.00007417537,0.00024018981,0.06447671,0.009029213,0.007417584,0.008391387,0.90484285],"study_design_scores_gemma":[0.00007703906,0.0002182635,0.0019976955,0.000048203747,0.00015553343,0.00008012332,0.000061236075,0.95434797,0.013240777,0.026681183,0.0030564694,0.000035533183],"about_ca_topic_score_codex":0.0053825276,"about_ca_topic_score_gemma":0.007819606,"teacher_disagreement_score":0.014000928,"about_ca_system_score_codex":0.0017343484,"about_ca_system_score_gemma":0.0029380652,"threshold_uncertainty_score":0.07404482},"labels":[],"label_agreement":null},{"id":"W211616019","doi":"10.1007/978-3-319-18032-8_13","title":"Contextual Anomaly Detection Using Log-Linear Tensor Factorization","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","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":"École de Technologie Supérieure","funders":"","keywords":"Factorization; Tensor (intrinsic definition); Anomaly detection; Anomaly (physics); Computer science; Mathematics; Artificial intelligence; Algorithm; Pure mathematics; Physics; Quantum mechanics","score_opus":0.09141878481234107,"score_gpt":0.3309313722778271,"score_spread":0.23951258746548604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W211616019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063498123,0.00036868,0.9901224,0.00015515502,0.00011660372,0.000029859393,0.00017308777,0.0019661367,0.00071833323],"genre_scores_gemma":[0.2528743,0.0009385172,0.7376226,0.00020732677,0.00044464285,0.00011396608,0.0020599556,0.0006463777,0.005092302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830365,0.00025786183,0.00008633765,0.00050549814,0.00061514805,0.00023151163],"domain_scores_gemma":[0.99759644,0.0005693515,0.00028038005,0.00068723294,0.00072883425,0.00013768258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013068003,0.0019294912,0.0019306347,0.0021903838,0.00084177725,0.001616109,0.0021513104,0.0011981917,0.0024771271],"category_scores_gemma":[0.0051142243,0.00061065983,0.0014860046,0.0023708956,0.0010096226,0.0026273348,0.0024656057,0.002454737,0.0023452411],"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.0004260921,0.00024497212,0.0051347967,0.00027660673,0.00022057742,0.00038183812,0.00014721973,0.07424916,0.03917292,0.021374661,0.02284688,0.8355243],"study_design_scores_gemma":[0.000009207893,0.000051076597,0.000889439,0.000018486884,0.000040687653,0.00034689414,0.000045594355,0.9582346,0.007905061,0.028292933,0.0041375537,0.000028431987],"about_ca_topic_score_codex":0.004368529,"about_ca_topic_score_gemma":0.0063187554,"teacher_disagreement_score":0.004368529,"about_ca_system_score_codex":0.0005847814,"about_ca_system_score_gemma":0.0012623973,"threshold_uncertainty_score":0.0086862445},"labels":[],"label_agreement":null},{"id":"W2116187412","doi":"10.1007/978-3-642-13681-8_46","title":"Multi-Objective Genetic Algorithm Optimization for Image Watermarking Based on Singular Value Decomposition and Lifting Wavelet Transform","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Watermark; Robustness (evolution); Digital watermarking; Singular value decomposition; Computer science; Algorithm; Wavelet transform; Wavelet; Singular value; Scaling; Genetic algorithm; Optimization problem; Mathematical optimization; Artificial intelligence; Image (mathematics); Mathematics","score_opus":0.008342040467620684,"score_gpt":0.24955381085144077,"score_spread":0.24121177038382008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116187412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023052506,0.00046028337,0.9729469,0.00010874187,0.000050287843,0.000043385204,0.000017625678,0.00014074259,0.003179534],"genre_scores_gemma":[0.4403773,0.00055789435,0.5535173,0.000077500255,0.000048107424,0.0002856403,0.00008740088,0.000089783374,0.0049591437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997445,0.00009383384,0.000011043656,0.000036875397,0.00008690254,0.000026863292],"domain_scores_gemma":[0.99939406,0.00040519075,0.000059737402,0.000023612734,0.00010341561,0.000014074618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008904312,0.0007737959,0.0011217833,0.0006616164,0.00035522706,0.0007573446,0.00087005977,0.0015067531,0.0015154817],"category_scores_gemma":[0.0018827763,0.00045050555,0.00082185597,0.00083545956,0.00056963175,0.0006419472,0.0006033536,0.00097514974,0.00021786866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027955813,0.000032354896,0.00013010057,0.0000424873,0.0000310652,0.000019861467,0.000020211119,0.9682363,0.0014879248,0.0036946328,0.00019168132,0.026085466],"study_design_scores_gemma":[0.00000411948,0.000013452838,0.000028343477,0.0000026970235,0.0000038770117,0.0000031055104,0.000001960314,0.9992656,0.00016309145,0.00044103197,0.000071148206,0.0000015513987],"about_ca_topic_score_codex":0.0044639744,"about_ca_topic_score_gemma":0.0033265012,"teacher_disagreement_score":0.0044639744,"about_ca_system_score_codex":0.000656835,"about_ca_system_score_gemma":0.0009412572,"threshold_uncertainty_score":0.008875966},"labels":[],"label_agreement":null},{"id":"W2116199281","doi":"10.1007/978-3-540-87875-9_35","title":"Integrating Performance Analysis in the Model Driven Development of Software Product Lines","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Model transformation; Transformation (genetics); Software engineering; Software; Programming language; Artificial intelligence","score_opus":0.04460411314962655,"score_gpt":0.27663368423069934,"score_spread":0.2320295710810728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116199281","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.02160461,0.00040628036,0.97051144,0.0003002548,0.000036818084,0.00008188252,0.00006649013,0.0017167749,0.0052753408],"genre_scores_gemma":[0.52936476,0.0007811496,0.46656305,0.00008680516,0.000053082058,0.00015764049,0.0002704206,0.0006163161,0.002106812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952766,0.0018619525,0.00025037932,0.00028439713,0.0021025331,0.00022424343],"domain_scores_gemma":[0.98946756,0.007217876,0.0008019109,0.00094647106,0.0014648804,0.0001013185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048577148,0.0012347426,0.0007474112,0.0014686652,0.00045340887,0.0028117022,0.001636652,0.000988498,0.0019887998],"category_scores_gemma":[0.016258856,0.0009880842,0.0009572442,0.0011807515,0.00067476195,0.0036055124,0.0010721086,0.0015926537,0.00057967025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018230827,0.0002349334,0.0022029702,0.0003903419,0.00011106023,0.000091720474,0.00023913584,0.7360143,0.010008875,0.040659536,0.0015689727,0.20829582],"study_design_scores_gemma":[0.000013729708,0.000095628,0.0002856455,0.000045914243,0.00004510582,0.000034546683,0.00003238154,0.96960497,0.0060449042,0.021909768,0.0018646609,0.000022718297],"about_ca_topic_score_codex":0.0035759348,"about_ca_topic_score_gemma":0.0027358944,"teacher_disagreement_score":0.0048577148,"about_ca_system_score_codex":0.0016870792,"about_ca_system_score_gemma":0.0020827993,"threshold_uncertainty_score":0.025690377},"labels":[],"label_agreement":null},{"id":"W2116497114","doi":"10.1007/978-3-540-72927-3_19","title":"Strategies for Prediction Under Imperfect Monitoring","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Imperfect; Computer science; Constructive; Logarithm; Consistency (knowledge bases); Convergence (economics); Simple (philosophy); Asymptotically optimal algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.14308238564303533,"score_gpt":0.4279685929098571,"score_spread":0.2848862072668218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116497114","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.037836604,0.0013766977,0.9406677,0.0029485791,0.00020402553,0.00007472083,0.0002214165,0.00040257297,0.016267668],"genre_scores_gemma":[0.9237632,0.0012970525,0.058553237,0.00035701718,0.00040082872,0.00019579279,0.0001736134,0.00008726783,0.015171928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895537,0.00047364016,0.000056390072,0.00019665538,0.00016983484,0.00014801382],"domain_scores_gemma":[0.9911754,0.0071895192,0.00046490703,0.00063652673,0.0003421019,0.00019149491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031801458,0.0012298832,0.0015195003,0.0006810387,0.00049072824,0.0024910849,0.0019018773,0.0022558803,0.004196842],"category_scores_gemma":[0.015129009,0.0005797819,0.0005514538,0.000999437,0.0014455671,0.0036830625,0.0015101654,0.002080034,0.00063928345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015519225,0.000057559904,0.0007595314,0.00012985298,0.00008665307,0.00015080975,0.00015475655,0.2703404,0.0006803174,0.6650471,0.0065301717,0.055907693],"study_design_scores_gemma":[0.000022108337,0.000022384178,0.00011219479,0.000016878748,0.000014372976,0.000029031526,0.00001567333,0.528026,0.00023015401,0.47079024,0.00070983014,0.000011261656],"about_ca_topic_score_codex":0.0013601338,"about_ca_topic_score_gemma":0.00084851886,"teacher_disagreement_score":0.004196842,"about_ca_system_score_codex":0.0012769714,"about_ca_system_score_gemma":0.00083596486,"threshold_uncertainty_score":0.016818404},"labels":[],"label_agreement":null},{"id":"W2116566096","doi":"10.1007/3-540-35828-5_1","title":"Taming Agents and Objects in Software Engineering","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software engineering; Software development; Social software engineering; Software system; Component-based software engineering; Software construction; Software framework; Context (archaeology); Resource-oriented architecture; Software; Systems engineering; Programming language; Engineering","score_opus":0.015863372002610877,"score_gpt":0.22334671492138342,"score_spread":0.20748334291877255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116566096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06954577,0.019796154,0.6721177,0.011607985,0.0012938372,0.00012101013,0.0000367303,0.00063044025,0.22485045],"genre_scores_gemma":[0.84240973,0.0076459064,0.09223867,0.0009779395,0.00038743042,0.00018888443,0.000035855606,0.00024956535,0.055866048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985259,0.00082811917,0.000055440065,0.00012179339,0.00037707586,0.000091642454],"domain_scores_gemma":[0.9961146,0.0027285547,0.0001755888,0.0006749963,0.00018337149,0.0001228942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019339361,0.0007711308,0.0006829206,0.0009320986,0.0012992258,0.003731715,0.0011408731,0.001971633,0.0030511792],"category_scores_gemma":[0.0058522406,0.00054198655,0.00038711523,0.0009844871,0.008279534,0.010289389,0.003110352,0.0032454252,0.00068628293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013947468,0.000015152862,0.00010888669,0.000069050475,0.0000054659977,0.00009680021,0.0024924034,0.001053125,0.00033708036,0.97137964,0.0011685091,0.023259865],"study_design_scores_gemma":[0.000010786419,0.000033691125,0.00005603769,0.00007823432,0.0000123083555,0.00019895128,0.0007727318,0.0028349555,0.00076966156,0.9565053,0.038716577,0.000010779437],"about_ca_topic_score_codex":0.00046808796,"about_ca_topic_score_gemma":0.00038874836,"teacher_disagreement_score":0.003731715,"about_ca_system_score_codex":0.0009511599,"about_ca_system_score_gemma":0.000772239,"threshold_uncertainty_score":0.01022774},"labels":[],"label_agreement":null},{"id":"W2116595874","doi":"10.1007/11562214_25","title":"Document Clustering with Grouping and Chaining Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Chaining; Cluster analysis; Document clustering; Event (particle physics); Backward chaining; Set (abstract data type); Data mining; Algorithm; Canopy clustering algorithm; Correlation clustering; Artificial intelligence; Information retrieval; Expert system; Programming language","score_opus":0.014362959641179852,"score_gpt":0.2329629422753225,"score_spread":0.21859998263414265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116595874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002250296,0.0005286386,0.99379057,0.00006319429,0.00008708013,0.000096205426,0.0001382779,0.0016492087,0.0013965891],"genre_scores_gemma":[0.014866257,0.00034975694,0.97992146,0.0000347998,0.0000952577,0.00009649801,0.0005883044,0.00025552086,0.0037922258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720925,0.00067240745,0.00028198655,0.0007251212,0.0009873087,0.00012392903],"domain_scores_gemma":[0.99575114,0.0014741648,0.00015132259,0.0015487751,0.0009594504,0.00011505375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028775611,0.0013308205,0.0022581029,0.0044436203,0.0018577803,0.0026052238,0.0033773219,0.0018854206,0.0071365116],"category_scores_gemma":[0.008142639,0.0011519333,0.0018736102,0.011127752,0.00094309385,0.004225528,0.0022807699,0.0017344729,0.0059033795],"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.00017587871,0.00012584958,0.000539314,0.00027279777,0.00014062651,0.000044140714,0.00014719622,0.042249616,0.0048632557,0.015136373,0.012443696,0.9238613],"study_design_scores_gemma":[0.00009934912,0.0001874921,0.00093463523,0.00007139121,0.00021180353,0.0005001649,0.00012384886,0.8108919,0.024360837,0.11963026,0.04289793,0.0000903521],"about_ca_topic_score_codex":0.003929589,"about_ca_topic_score_gemma":0.005064665,"teacher_disagreement_score":0.0071365116,"about_ca_system_score_codex":0.0009187336,"about_ca_system_score_gemma":0.0015087704,"threshold_uncertainty_score":0.023874044},"labels":[],"label_agreement":null},{"id":"W2116598432","doi":"10.1007/11569510_35","title":"A New Protocol for Protecting a Mobile Agent Using a Reference Clone","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; clone (Java method); Protocol (science); Mobile agent; Computer security; Computer network; Biology; Gene; Genetics; Medicine","score_opus":0.05696431785835083,"score_gpt":0.3124680990815269,"score_spread":0.2555037812231761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116598432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011596534,0.0007353606,0.9731617,0.00047382805,0.0005718639,0.0005285351,0.00010240885,0.005542158,0.007287674],"genre_scores_gemma":[0.23585472,0.0012971814,0.6966338,0.0009889144,0.00067640573,0.0016052468,0.00088391016,0.0017916253,0.06026816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947877,0.0008912843,0.00065633375,0.00089506886,0.0022934487,0.0004760562],"domain_scores_gemma":[0.9852187,0.0025705388,0.00085586944,0.0081819305,0.002760039,0.00041301284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045314548,0.0011580775,0.0020790505,0.0021252604,0.0030121114,0.0040639862,0.0043447576,0.0045289025,0.0067610582],"category_scores_gemma":[0.008899557,0.0010882056,0.0011662128,0.0015205881,0.0032736498,0.013238529,0.008128929,0.0051374855,0.0035101923],"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.001261435,0.00041919586,0.0012692194,0.0007701946,0.00021248187,0.0017128058,0.0031364046,0.008128843,0.11400999,0.3824442,0.02929372,0.4573415],"study_design_scores_gemma":[0.0007085222,0.0019002256,0.0016551238,0.0004751298,0.0011195603,0.007643569,0.0010000521,0.1960559,0.26955616,0.16122137,0.35803053,0.0006339836],"about_ca_topic_score_codex":0.0012858883,"about_ca_topic_score_gemma":0.0010762126,"teacher_disagreement_score":0.0067610582,"about_ca_system_score_codex":0.0016381643,"about_ca_system_score_gemma":0.0018694069,"threshold_uncertainty_score":0.023964942},"labels":[],"label_agreement":null},{"id":"W2116766394","doi":"10.1007/978-3-642-02247-0_43","title":"Adaptive Tips for Helping Domain Experts","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual and Cognitive Learning Processes","field":"Psychology","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 Guelph","funders":"","keywords":"Computer science; Domain (mathematical analysis); Mathematics","score_opus":0.044717735826521124,"score_gpt":0.3303373912036407,"score_spread":0.2856196553771196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116766394","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.027762173,0.0074904575,0.55618197,0.0066733486,0.0025082782,0.00039779735,0.00038975425,0.012671081,0.3859251],"genre_scores_gemma":[0.1846537,0.00567996,0.45002562,0.0019866521,0.00056218443,0.00050791673,0.00076429336,0.0011000861,0.35471958],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969006,0.00009495794,0.000009062639,0.000057437257,0.00011285592,0.000035684698],"domain_scores_gemma":[0.9991462,0.00047466694,0.000035417142,0.00011694331,0.00012457387,0.000102207945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047814316,0.00086354656,0.00028182604,0.0005322131,0.0005777717,0.0011156247,0.0013268966,0.0014803375,0.038729966],"category_scores_gemma":[0.00305189,0.00020834465,0.00021238982,0.00046219784,0.0005176843,0.0023131708,0.001665579,0.0017884304,0.013026369],"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.00008154228,0.00019580853,0.000307875,0.00028814646,0.000008744035,0.00016160315,0.00081721763,0.0008572368,0.0050445893,0.021811089,0.12677278,0.8436533],"study_design_scores_gemma":[0.00013133322,0.0003286584,0.0022092445,0.00060875004,0.000045787783,0.0015458558,0.0020493516,0.01742951,0.012629104,0.19453208,0.7684147,0.000075634554],"about_ca_topic_score_codex":0.00024713035,"about_ca_topic_score_gemma":0.0008960082,"teacher_disagreement_score":0.038729966,"about_ca_system_score_codex":0.00023102465,"about_ca_system_score_gemma":0.00031934117,"threshold_uncertainty_score":0.12956464},"labels":[],"label_agreement":null},{"id":"W2116871579","doi":"10.1007/3-540-44870-5_16","title":"Tool Support for Complex Refactoring to Design Patterns","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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 Calgary","funders":"","keywords":"Code refactoring; Maintainability; Computer science; Software design pattern; Agile software development; Software engineering; Structural pattern; Software design; Design pattern; Software system; Architectural pattern; Software; Software development; Programming language","score_opus":0.06321337205430425,"score_gpt":0.29854956235159047,"score_spread":0.23533619029728622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116871579","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.008622602,0.0002796071,0.92923576,0.00016356005,0.000056623034,0.00009662106,0.00037678104,0.05754214,0.0036263617],"genre_scores_gemma":[0.10426567,0.00063397794,0.86937076,0.00025488724,0.00006310075,0.00025969863,0.0030305395,0.011855716,0.010265693],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982352,0.00032236482,0.00031922598,0.00029389944,0.0007044299,0.00012470288],"domain_scores_gemma":[0.98879963,0.0067481343,0.0005169976,0.002993894,0.0007658183,0.00017555185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002493611,0.0015101151,0.0010485466,0.0022327981,0.00047850108,0.0023653733,0.003138668,0.00152756,0.013743847],"category_scores_gemma":[0.012820098,0.0014960999,0.0014546592,0.0020240673,0.0005846624,0.0038612464,0.002682372,0.0021628693,0.005001656],"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.0002562484,0.00026331772,0.0019339942,0.00095999683,0.00012220714,0.00091486634,0.0012742063,0.008080241,0.03391715,0.027167387,0.032779273,0.89233106],"study_design_scores_gemma":[0.0006660435,0.000353112,0.0026761128,0.0011250498,0.0005038448,0.0042182812,0.00039751158,0.38150617,0.18488835,0.11349617,0.30986252,0.00030685661],"about_ca_topic_score_codex":0.00082005316,"about_ca_topic_score_gemma":0.0013049472,"teacher_disagreement_score":0.013743847,"about_ca_system_score_codex":0.00042320765,"about_ca_system_score_gemma":0.000610211,"threshold_uncertainty_score":0.04597777},"labels":[],"label_agreement":null},{"id":"W2117316380","doi":"10.1007/978-3-642-13681-8_59","title":"3D Head Trajectory Using a Single Camera","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer vision; Trajectory; Artificial intelligence; Head (geology); Particle filter; Computer science; Track (disk drive); Ellipsoid; Computer graphics (images); Filter (signal processing); Geography; Geodesy; Physics; Geology","score_opus":0.04710556304365567,"score_gpt":0.3000020744309095,"score_spread":0.25289651138725383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117316380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010065606,0.00013801806,0.98248404,0.000081787344,0.00006418619,0.000045707046,0.0005699656,0.0032665336,0.0032842134],"genre_scores_gemma":[0.2227487,0.0007527125,0.76542807,0.0000764586,0.00007023352,0.000117146374,0.0014658667,0.00061713706,0.008723669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997607,0.000026331627,0.000008826907,0.00008174458,0.00009856555,0.000023847018],"domain_scores_gemma":[0.9996531,0.000057896534,0.000031851283,0.000098121294,0.00012505797,0.00003408798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022446453,0.0010284602,0.0008378772,0.000976549,0.0004204311,0.0009857297,0.0009247881,0.00092533417,0.010077612],"category_scores_gemma":[0.000851411,0.0009751674,0.00075680454,0.0013089565,0.00028875287,0.000869495,0.0013896213,0.0007395796,0.0059966366],"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.00066313887,0.00007241983,0.0028197046,0.00040257344,0.00018503812,0.0007429382,0.00052237394,0.08240795,0.12963523,0.0047282674,0.013048493,0.7647718],"study_design_scores_gemma":[0.00006988543,0.00023228965,0.00901941,0.0000866706,0.00010927203,0.002517678,0.0002517175,0.89139336,0.07426882,0.00615149,0.015765822,0.00013346068],"about_ca_topic_score_codex":0.008774646,"about_ca_topic_score_gemma":0.013487823,"teacher_disagreement_score":0.010077612,"about_ca_system_score_codex":0.00035938303,"about_ca_system_score_gemma":0.0008914095,"threshold_uncertainty_score":0.033713043},"labels":[],"label_agreement":null},{"id":"W2117523749","doi":"10.1007/11766247_16","title":"An Improved LAZY-AR Approach to Bayesian Network Inference","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Inference; Lazy evaluation; Bayesian network; Variable elimination; Bayesian inference; Artificial intelligence; Probabilistic logic; Algorithm; Theoretical computer science; Bayesian probability","score_opus":0.018911131273988812,"score_gpt":0.2518183820688694,"score_spread":0.23290725079488062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117523749","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.0007623174,0.00017026055,0.9965947,0.00010327308,0.000053973174,0.000020661904,0.000058075042,0.0005496977,0.0016870471],"genre_scores_gemma":[0.068978265,0.00058072974,0.9142534,0.00033083349,0.00057298533,0.00018305557,0.00043683854,0.00070907985,0.013954718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528533,0.0017980312,0.00027557547,0.0007700042,0.0016176587,0.0002533433],"domain_scores_gemma":[0.9902962,0.0056591243,0.00023124184,0.002256112,0.001349825,0.0002074294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005594759,0.0014024022,0.003214922,0.0024413757,0.0016134253,0.0035726337,0.00661785,0.001998203,0.015989607],"category_scores_gemma":[0.020784838,0.0013737523,0.0026008612,0.003422813,0.0021231086,0.006958822,0.00473365,0.00650097,0.0054774797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025161324,0.00018109684,0.00054986007,0.0002944562,0.0002149717,0.00021952858,0.00030104571,0.15835138,0.0023715666,0.55799454,0.011919953,0.26734993],"study_design_scores_gemma":[0.000035495923,0.000027089403,0.00009768787,0.000017001368,0.0000611784,0.000059545247,0.0000143595635,0.66755617,0.0005847432,0.326168,0.0053513893,0.000027373593],"about_ca_topic_score_codex":0.008910423,"about_ca_topic_score_gemma":0.013451452,"teacher_disagreement_score":0.015989607,"about_ca_system_score_codex":0.0017658855,"about_ca_system_score_gemma":0.002125225,"threshold_uncertainty_score":0.05349052},"labels":[],"label_agreement":null},{"id":"W2117631199","doi":"10.1007/3-540-45110-2_125","title":"A Linear Genetic Programming Approach to Intrusion Detection","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":57,"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":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Benchmark (surveying); Computer science; Genetic programming; Intrusion detection system; Selection (genetic algorithm); Decoding methods; Class (philosophy); Linear programming; Artificial intelligence; Genetic algorithm; Machine learning; Data mining; Algorithm","score_opus":0.014860952163029312,"score_gpt":0.22661726612921199,"score_spread":0.21175631396618266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117631199","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.0031950288,0.0001809081,0.99228233,0.00020667962,0.00004140149,0.00002652866,0.000021266385,0.00021123089,0.0038345412],"genre_scores_gemma":[0.14798416,0.0005754015,0.8362041,0.00043982963,0.00014147547,0.00023827048,0.00012407491,0.00015650486,0.014136183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.00027357158,0.000022847418,0.00010618954,0.0001780402,0.000056433044],"domain_scores_gemma":[0.99871516,0.0009917181,0.000050721228,0.000050129587,0.0001644699,0.000027909515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011845,0.0007560152,0.0009095537,0.0009647733,0.0004976262,0.0012460237,0.002286764,0.0017941274,0.0034431529],"category_scores_gemma":[0.003129959,0.000695413,0.0010692888,0.0014242722,0.0011722891,0.0009034477,0.00092419755,0.0016918379,0.0005007906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015677768,0.000073341915,0.0002730258,0.000050204944,0.000056858244,0.000066928405,0.00006943158,0.8544517,0.0008527457,0.05881852,0.0016807076,0.08359089],"study_design_scores_gemma":[0.00000690807,0.000012658137,0.00004205576,0.000007902246,0.000012015702,0.000014905745,0.000008230306,0.96929425,0.00022099365,0.029544905,0.0008292979,0.0000058326773],"about_ca_topic_score_codex":0.011492748,"about_ca_topic_score_gemma":0.008448435,"teacher_disagreement_score":0.011492748,"about_ca_system_score_codex":0.0012057855,"about_ca_system_score_gemma":0.0011823385,"threshold_uncertainty_score":0.022851706},"labels":[],"label_agreement":null},{"id":"W2117674034","doi":"10.1007/978-3-540-25969-5_71","title":"Resource Allocation in User-Controlled Circuit-Switched Optical Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science; Synchronous optical networking; Computer network; Circuit switching; Distributed computing; Resource allocation; Bandwidth (computing)","score_opus":0.009856245400088523,"score_gpt":0.21303807048041168,"score_spread":0.20318182508032315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117674034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11955508,0.0051818006,0.83751154,0.00072030496,0.0004403327,0.00013390798,0.00012634351,0.0008629028,0.03546783],"genre_scores_gemma":[0.9419396,0.0012515271,0.046229597,0.00010891191,0.00014783794,0.00007907453,0.00004766956,0.000065580985,0.010130213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999474,0.00020572926,0.000020118086,0.00006422243,0.00012664837,0.00010932608],"domain_scores_gemma":[0.9995123,0.00032216526,0.000027532731,0.00003758128,0.00007244085,0.000027950258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006633075,0.0005369515,0.0006261417,0.00031522708,0.0005580231,0.0013951488,0.001599992,0.00051845243,0.0038958702],"category_scores_gemma":[0.0017686179,0.0002919629,0.0001613786,0.00090817077,0.00055258715,0.0012468065,0.0006063316,0.0005046074,0.00025246746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005985737,0.00020345394,0.00037488737,0.00023321102,0.000049789152,0.00017533808,0.00016043408,0.5563894,0.020820092,0.15944561,0.009066502,0.2524828],"study_design_scores_gemma":[0.000017249868,0.000050938386,0.00014364906,0.000008209052,0.00001062539,0.000057149733,0.000026532776,0.9630055,0.0028159409,0.03135554,0.002496561,0.000012075815],"about_ca_topic_score_codex":0.0026413817,"about_ca_topic_score_gemma":0.0040538027,"teacher_disagreement_score":0.0038958702,"about_ca_system_score_codex":0.0009438301,"about_ca_system_score_gemma":0.0006787983,"threshold_uncertainty_score":0.013033032},"labels":[],"label_agreement":null},{"id":"W2118070810","doi":"10.1007/11493648_2","title":"Biometric Gait Recognition","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":142,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"","keywords":"Biometrics; Gait; Computer science; Identification (biology); Gait analysis; Artificial intelligence; Computer vision; Pattern recognition (psychology); Physical medicine and rehabilitation; Medicine","score_opus":0.019451299272318603,"score_gpt":0.2209886885321086,"score_spread":0.20153738925978998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118070810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00907088,0.008061355,0.8337283,0.00048725333,0.0016788878,0.00029780198,0.0036724347,0.01497644,0.12802668],"genre_scores_gemma":[0.08393718,0.009644077,0.3556639,0.0007642992,0.00058207504,0.00034192868,0.0154564595,0.0012812297,0.5323288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966764,0.000021408287,0.000019172812,0.000096972995,0.00016729484,0.000027449252],"domain_scores_gemma":[0.9997857,0.000019895713,0.000014639655,0.00006755004,0.00009852056,0.000013579826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034180708,0.00088949036,0.0010104794,0.0013638982,0.0003369674,0.00089161005,0.0009992032,0.000881198,0.05013015],"category_scores_gemma":[0.0005845719,0.00038767932,0.00047439485,0.0016805376,0.00021299579,0.00091922295,0.0008218051,0.00052101293,0.07222691],"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.00004845546,0.00005795096,0.00023708738,0.000163383,0.000017299551,0.00007572653,0.000020081863,0.0007872617,0.039633952,0.002914212,0.059956905,0.89608777],"study_design_scores_gemma":[0.000033038556,0.00039971946,0.010034064,0.00036034893,0.00012127569,0.005200005,0.00010787019,0.058791388,0.14578365,0.014960369,0.7640649,0.00014347161],"about_ca_topic_score_codex":0.0004921969,"about_ca_topic_score_gemma":0.0010470264,"teacher_disagreement_score":0.05013015,"about_ca_system_score_codex":0.00020254134,"about_ca_system_score_gemma":0.00025563812,"threshold_uncertainty_score":0.16770208},"labels":[],"label_agreement":null},{"id":"W2118094092","doi":"10.1007/978-3-540-72584-8_110","title":"A New Constitutive Model for the Analysis of Semi-flexible Polymers with Internal Viscosity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rheology and Fluid Dynamics Studies","field":"Chemical 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":"Wilfrid Laurier University","funders":"","keywords":"Constitutive equation; Context (archaeology); Extensional viscosity; Nonlinear system; Moment (physics); Tensor (intrinsic definition); Extensional definition; Viscosity; Computer science; Statistical physics; Classical mechanics; Mathematics; Physics; Shear viscosity; Thermodynamics; Geometry; Finite element method; Geology","score_opus":0.018012126806134707,"score_gpt":0.25699452429433245,"score_spread":0.23898239748819775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118094092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080140345,0.0013174607,0.9845322,0.00026321225,0.00029187804,0.000055642133,0.00010033194,0.00011987702,0.005305386],"genre_scores_gemma":[0.3291403,0.006284103,0.60014427,0.00077754026,0.00088119914,0.0008792441,0.0006568766,0.00069434306,0.060542066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964607,0.00006136478,0.000025330844,0.000066308196,0.00016798156,0.000032794676],"domain_scores_gemma":[0.99967265,0.000107782274,0.000050861254,0.000055526605,0.00007392319,0.000039238897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065863715,0.0011613407,0.0012690496,0.0010654188,0.0005655384,0.0016090774,0.00243516,0.002577331,0.001596802],"category_scores_gemma":[0.0010944199,0.0007200042,0.0018696177,0.00088801264,0.0012622639,0.0031766214,0.0012375508,0.0022540607,0.00072406634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005166774,0.00020963667,0.00029658023,0.0002926482,0.00007311287,0.00040976147,0.0002041652,0.38349652,0.07182149,0.49723706,0.0038657475,0.042041566],"study_design_scores_gemma":[0.000009249218,0.00002533219,0.00011450374,0.000018002658,0.00001694674,0.00012099082,0.000012578168,0.94404775,0.001746071,0.048075605,0.0057905065,0.0000225445],"about_ca_topic_score_codex":0.0010040724,"about_ca_topic_score_gemma":0.0013269249,"teacher_disagreement_score":0.002577331,"about_ca_system_score_codex":0.000816647,"about_ca_system_score_gemma":0.00097551494,"threshold_uncertainty_score":0.0059251785},"labels":[],"label_agreement":null},{"id":"W2118231664","doi":"10.1007/978-3-642-30950-2_12","title":"Cognitive Priming: Assessing the Use of Non-conscious Perception to Enhance Learner’s Reasoning Ability","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Science and Education Research","field":"Neuroscience","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":"Université de Montréal","funders":"","keywords":"Computer science; Cognition; Subliminal stimuli; Perception; Priming (agriculture); Unconscious mind; Cognitive science; Logical reasoning; Cognitive psychology; Artificial intelligence; Psychology","score_opus":0.11224161907766368,"score_gpt":0.3995042642802006,"score_spread":0.2872626452025369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118231664","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.9706915,0.00057554763,0.018263102,0.00019393295,0.00018823192,0.0005190905,0.00028830578,0.00035495343,0.008925396],"genre_scores_gemma":[0.9787067,0.00048587535,0.015904559,0.00016511318,0.00005238519,0.00055144593,0.0002147727,0.00009775535,0.0038213613],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994179,0.00012323556,0.000042273074,0.00016131313,0.00021515692,0.000040123774],"domain_scores_gemma":[0.99678195,0.0018997598,0.0005560907,0.00026721196,0.00021822164,0.00027677635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011942686,0.00065402524,0.0003336132,0.00033199126,0.00014252355,0.0005486369,0.0005955807,0.0007734498,0.0058804555],"category_scores_gemma":[0.0066089034,0.00030239366,0.00027596156,0.00019606801,0.0003373152,0.0013318254,0.0006765882,0.0012561824,0.0011060301],"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.012747209,0.010543105,0.028705042,0.0014108812,0.00025847513,0.00041627762,0.00283702,0.0012152184,0.6179561,0.0030356483,0.0033628491,0.31751218],"study_design_scores_gemma":[0.0019880738,0.057397693,0.44648165,0.0002982448,0.00088487513,0.003434458,0.00095258694,0.011114676,0.45382738,0.016294066,0.0070691314,0.00025712172],"about_ca_topic_score_codex":0.00016883007,"about_ca_topic_score_gemma":0.00014445587,"teacher_disagreement_score":0.0058804555,"about_ca_system_score_codex":0.00012037626,"about_ca_system_score_gemma":0.00043987916,"threshold_uncertainty_score":0.019672036},"labels":[],"label_agreement":null},{"id":"W2118336583","doi":"10.1007/11823728_4","title":"Dynamic View Selection for OLAP","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Dalhousie University","funders":"","keywords":"Online analytical processing; Computer science; Materialized view; Data warehouse; Selection (genetic algorithm); Aggregate (composite); Task (project management); Set (abstract data type); Data mining; Information retrieval; Artificial intelligence; View","score_opus":0.011363035304567927,"score_gpt":0.252280441725159,"score_spread":0.2409174064205911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118336583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01604042,0.0026804917,0.9555698,0.0003052316,0.00024805524,0.00010145711,0.0010584372,0.01248994,0.011506145],"genre_scores_gemma":[0.27984023,0.0016984552,0.6980116,0.0002527032,0.0002393187,0.00015613802,0.0037886146,0.001887905,0.014125078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991856,0.0001465755,0.000053009582,0.00013059778,0.00039308323,0.000091150374],"domain_scores_gemma":[0.9990589,0.00028133517,0.000040500425,0.00038818145,0.0001685591,0.00006261031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006912704,0.0007284022,0.0008169631,0.0008359983,0.0007249643,0.001984586,0.0015679142,0.0005220952,0.009477097],"category_scores_gemma":[0.0017951876,0.000545055,0.0005510708,0.0018012347,0.00045575382,0.0027919873,0.001789022,0.0014017125,0.0023620753],"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.00070008537,0.00016788866,0.0010766367,0.00032292175,0.00008090454,0.00027308828,0.00019635417,0.020827623,0.022183497,0.058059484,0.056329668,0.83978176],"study_design_scores_gemma":[0.00016135766,0.00023604883,0.0012445461,0.00013355655,0.00010884425,0.0009146277,0.00031663207,0.5869222,0.044262577,0.24491097,0.12065896,0.00012963807],"about_ca_topic_score_codex":0.0017672773,"about_ca_topic_score_gemma":0.002468503,"teacher_disagreement_score":0.009477097,"about_ca_system_score_codex":0.0004915602,"about_ca_system_score_gemma":0.0005509854,"threshold_uncertainty_score":0.03170407},"labels":[],"label_agreement":null},{"id":"W2118409148","doi":"10.1007/978-3-319-11659-4_10","title":"Isogeny-Based Quantum-Resistant Undeniable Signatures","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":50,"is_retracted":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":"Isogeny; Computer science; Scheme (mathematics); Post-quantum cryptography; Signature (topology); Quantum; Theoretical computer science; Elliptic curve; Cryptography; Computational complexity theory; Quantum algorithm; Quantum computer; Algorithm; Mathematics; Quantum mechanics; Physics; Pure mathematics","score_opus":0.013090216124037076,"score_gpt":0.23115940871573634,"score_spread":0.21806919259169927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118409148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11105038,0.0036881682,0.6765665,0.00467305,0.0016219894,0.00036799762,0.00061294204,0.0028743239,0.1985446],"genre_scores_gemma":[0.86037403,0.0015694692,0.081274875,0.00095359713,0.00049502554,0.00019786872,0.0005949655,0.00047327782,0.05406702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563783,0.00087313866,0.00020806752,0.0005516475,0.0021325403,0.00059684104],"domain_scores_gemma":[0.99646217,0.0011949153,0.00022008669,0.0014719367,0.0004994489,0.00015133985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017511409,0.0007802946,0.0014892359,0.0014047661,0.0015335068,0.003948007,0.0021087264,0.0021917422,0.011096581],"category_scores_gemma":[0.0052340575,0.00063032814,0.0010141636,0.0018577626,0.003594229,0.007789538,0.0053377645,0.005558751,0.004141608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029275013,0.00011781094,0.00017222551,0.00014103028,0.000027222422,0.00007595413,0.00020699095,0.008261501,0.006685482,0.92148864,0.005438356,0.057092085],"study_design_scores_gemma":[0.00009355915,0.00012988943,0.0001553063,0.00007001125,0.000037401733,0.00034982114,0.00009062566,0.04649083,0.016951596,0.9142675,0.021296052,0.0000673422],"about_ca_topic_score_codex":0.00025786378,"about_ca_topic_score_gemma":0.00026418193,"teacher_disagreement_score":0.011096581,"about_ca_system_score_codex":0.0018956872,"about_ca_system_score_gemma":0.0016127011,"threshold_uncertainty_score":0.037121713},"labels":[],"label_agreement":null},{"id":"W2118414897","doi":"10.1007/978-3-642-38326-7_3","title":"Using Constraint Logic Programming to Implement Iterative Actions and Numerical Measures during Mitigation of Concurrently Applied Clinical Practice Guidelines","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical practice guidelines implementation","field":"Medicine","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":"Children's Hospital of Eastern Ontario; McGill University; University of Ottawa","funders":"","keywords":"Computer science; Clinical Practice; Logic programming; Process (computing); Constraint (computer-aided design); Constraint logic programming; Iterative and incremental development; Software engineering; Machine learning; Constraint satisfaction; Algorithm; Artificial intelligence; Programming language; Medicine; Mathematics","score_opus":0.35182506632714544,"score_gpt":0.5217212558944098,"score_spread":0.16989618956726432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118414897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070883036,0.00007018518,0.9815637,0.0005133976,0.000053910542,0.00032353084,0.00010924598,0.0024338025,0.007843912],"genre_scores_gemma":[0.07005906,0.000059961145,0.9275149,0.00022627393,0.000010692629,0.00022415728,0.00018114159,0.00022676282,0.0014971199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99187285,0.0033493761,0.00061020703,0.0010786363,0.0025615469,0.000527336],"domain_scores_gemma":[0.9695841,0.02371717,0.0017891458,0.0015356935,0.0028931182,0.0004807042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077635986,0.001265296,0.0006198998,0.0011507948,0.001046164,0.0037449652,0.0030326291,0.001512903,0.007998749],"category_scores_gemma":[0.035875168,0.00097025424,0.0009537971,0.0011308026,0.0014021612,0.002452567,0.0032788336,0.0033122858,0.0009757371],"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.00043156213,0.0006415605,0.0030153692,0.00076473865,0.00019430782,0.0005544505,0.0033264365,0.24188079,0.01190026,0.12651004,0.011341628,0.59943885],"study_design_scores_gemma":[0.00010196287,0.00012478212,0.0005619361,0.00029912533,0.00010428623,0.00015645455,0.00065298914,0.8877829,0.014790864,0.07544964,0.0198839,0.00009119441],"about_ca_topic_score_codex":0.01701835,"about_ca_topic_score_gemma":0.0219932,"teacher_disagreement_score":0.01701835,"about_ca_system_score_codex":0.0019700038,"about_ca_system_score_gemma":0.006724849,"threshold_uncertainty_score":0.041058302},"labels":[],"label_agreement":null},{"id":"W2118437143","doi":"10.1007/978-3-319-03680-9_42","title":"Ultimate Order Statistics-Based Prototype Reduction Schemes","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Carleton University","funders":"","keywords":"Computer science; Naive Bayes classifier; Parametric statistics; Artificial intelligence; Machine learning; Classifier (UML); Data mining; Pattern recognition (psychology); Bayes' theorem; Algorithm; Bayesian probability; Support vector machine; Statistics; Mathematics","score_opus":0.017386322631367704,"score_gpt":0.2692044193975189,"score_spread":0.2518180967661512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118437143","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.009380681,0.00028071468,0.9846048,0.00008641044,0.00007449245,0.00005648708,0.00007113686,0.0012180341,0.0042273076],"genre_scores_gemma":[0.26547423,0.00041972622,0.718637,0.00015513484,0.00016480601,0.00019310966,0.0005929444,0.000518222,0.013844805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807847,0.0004270676,0.00013845717,0.0002870073,0.0009010297,0.00016795406],"domain_scores_gemma":[0.9965425,0.00095053285,0.00014007324,0.0016067985,0.0006601965,0.000099905825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016694114,0.00063902454,0.0012198131,0.0014019101,0.0007770872,0.0017042039,0.002686223,0.0009942865,0.0074333386],"category_scores_gemma":[0.0063940436,0.0005574769,0.0010821559,0.001424648,0.0011790983,0.0030369586,0.002812657,0.0020065773,0.0027777534],"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.00038935046,0.00014482641,0.00038199165,0.00020708719,0.000049864047,0.00006210803,0.00021759147,0.03264139,0.018101636,0.26346797,0.0073417416,0.6769945],"study_design_scores_gemma":[0.00006434542,0.00024173952,0.000565622,0.00004294479,0.00007120337,0.00033340428,0.0000736599,0.67461735,0.026975993,0.28299123,0.013950996,0.00007150346],"about_ca_topic_score_codex":0.00048254515,"about_ca_topic_score_gemma":0.00085591327,"teacher_disagreement_score":0.0074333386,"about_ca_system_score_codex":0.0006073192,"about_ca_system_score_gemma":0.00080124254,"threshold_uncertainty_score":0.024866939},"labels":[],"label_agreement":null},{"id":"W2118553653","doi":"10.1007/3-540-45785-2_27","title":"Expressing Graphical User’s Input for Test Specifications","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Windsor","funders":"","keywords":"Computer science; Graphical user interface testing; Graphical user interface; Scalability; Human–computer interaction; Graphical model; Software engineering; Programming language; User experience design; User interface design; Artificial intelligence; Operating system","score_opus":0.05880410136687744,"score_gpt":0.27540840828355595,"score_spread":0.2166043069166785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118553653","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.0051992987,0.000073835814,0.93992525,0.00026287095,0.00012607418,0.00011185446,0.0011462186,0.034905244,0.018249426],"genre_scores_gemma":[0.29489836,0.0004250295,0.6302258,0.0008757276,0.00015567531,0.0007170215,0.0066269585,0.026762059,0.03931343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978818,0.0007881185,0.00020167223,0.00023259241,0.00069810107,0.00019766274],"domain_scores_gemma":[0.9916005,0.0057039233,0.00028840144,0.0011830336,0.0011002639,0.00012387453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024868797,0.0023326345,0.00075479294,0.0014237346,0.00046569094,0.003409106,0.0019266411,0.002449453,0.0440012],"category_scores_gemma":[0.011818388,0.00097597647,0.0013012537,0.0008586736,0.0012887691,0.0025877908,0.0017694741,0.0018671163,0.013687669],"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.0015482021,0.00029711958,0.002473126,0.002387529,0.00014048166,0.0036506015,0.004914999,0.041536596,0.067537814,0.43032947,0.11221204,0.33297202],"study_design_scores_gemma":[0.00028798284,0.00031592735,0.0008212945,0.0009483602,0.00017809153,0.0021168597,0.00034601075,0.30986068,0.19771527,0.12807389,0.3591637,0.00017195537],"about_ca_topic_score_codex":0.0011230893,"about_ca_topic_score_gemma":0.0011426508,"teacher_disagreement_score":0.0440012,"about_ca_system_score_codex":0.0009592427,"about_ca_system_score_gemma":0.0005651267,"threshold_uncertainty_score":0.14719868},"labels":[],"label_agreement":null},{"id":"W2118899311","doi":"10.1007/978-3-642-15105-7_14","title":"The NOX Framework: Native Language Queries for Business Intelligence Applications","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; SQL; Online analytical processing; Relational database management system; Programming language; Software engineering; Database; Object-oriented programming; Query language; Flexibility (engineering); Relational database; Query by Example; Domain (mathematical analysis); World Wide Web; Data warehouse; Web search query","score_opus":0.014164071897745682,"score_gpt":0.2832514141021563,"score_spread":0.26908734220441066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118899311","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.006596081,0.0010767785,0.8959129,0.000611447,0.00030253944,0.0002489527,0.0018633057,0.079654455,0.0137337],"genre_scores_gemma":[0.1801056,0.0027363421,0.7288641,0.0019994283,0.0004243189,0.0005674284,0.016743077,0.02703029,0.041529436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979292,0.00033952144,0.00021115341,0.00026924614,0.0010719297,0.00017889433],"domain_scores_gemma":[0.9986926,0.00042529576,0.000070966766,0.00043381797,0.00026684397,0.00011060665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027878666,0.00096611155,0.0011850202,0.001032926,0.0007196681,0.004768422,0.003349048,0.0012928741,0.00910105],"category_scores_gemma":[0.005001819,0.0009819046,0.0011269823,0.0011505213,0.0011970613,0.0058408636,0.0033757044,0.0020552296,0.0051871114],"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.0009926417,0.0002973522,0.002269098,0.0010062649,0.00012109215,0.00052644045,0.0012838255,0.009838026,0.02155495,0.31563938,0.2663288,0.38014203],"study_design_scores_gemma":[0.00024305502,0.00012945822,0.00075464475,0.00023551757,0.00017219868,0.0008004886,0.00033602357,0.16658224,0.028388087,0.18707842,0.6151258,0.00015408082],"about_ca_topic_score_codex":0.004426068,"about_ca_topic_score_gemma":0.004370807,"teacher_disagreement_score":0.00910105,"about_ca_system_score_codex":0.0011895405,"about_ca_system_score_gemma":0.0016532526,"threshold_uncertainty_score":0.030446112},"labels":[],"label_agreement":null},{"id":"W2119038203","doi":"10.1007/978-3-319-07467-2_52","title":"Constraint and Qualitative Preference Specification in Multi-Attribute Reverse Auctions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Regina","funders":"","keywords":"Common value auction; Computer science; Preference; Context (archaeology); Reverse auction; Constraint (computer-aided design); Process (computing); Product (mathematics); Outcome (game theory); Task (project management); Operations research; Microeconomics; Economics; Engineering; Mathematics; Systems engineering","score_opus":0.2340004342799485,"score_gpt":0.4053648708442709,"score_spread":0.17136443656432243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119038203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015537139,0.0003912325,0.96978533,0.0008025327,0.000064575994,0.0000797712,0.00021559496,0.00008079246,0.013043055],"genre_scores_gemma":[0.64788723,0.00091602944,0.3402211,0.00033481585,0.0001161689,0.00048513766,0.0006367965,0.0001045075,0.009298246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932019,0.0041853394,0.00047056522,0.0004483746,0.0014267822,0.00026699775],"domain_scores_gemma":[0.9904343,0.0065504666,0.00063402316,0.0010718132,0.0010899343,0.00021946871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074594044,0.00076548086,0.0011191873,0.0009139407,0.0007024616,0.0036538267,0.0025078692,0.0013093475,0.0045420546],"category_scores_gemma":[0.018429646,0.0008464414,0.0015568273,0.0025336358,0.0027288846,0.0077231405,0.0017261895,0.0033082645,0.00065436104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032648277,0.000025547111,0.00013459165,0.000096860495,0.000013678283,0.00005974178,0.0001385277,0.014565118,0.00045101612,0.97338426,0.00076403574,0.010334057],"study_design_scores_gemma":[0.000015475,0.000013390402,0.00006654614,0.000025625744,0.0000069637103,0.0000549382,0.000063927255,0.070101745,0.0003712467,0.92791957,0.0013429229,0.000017648179],"about_ca_topic_score_codex":0.0016692342,"about_ca_topic_score_gemma":0.0013307001,"teacher_disagreement_score":0.0074594044,"about_ca_system_score_codex":0.0018746689,"about_ca_system_score_gemma":0.001305371,"threshold_uncertainty_score":0.039449573},"labels":[],"label_agreement":null},{"id":"W2119076930","doi":"10.1007/978-3-540-30217-9_100","title":"A Neuroevolutionary Approach to Emergent Task Decomposition","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Toronto","funders":"","keywords":"Computer science; Decomposition; Task (project management); Modular design; Artificial neural network; Artificial intelligence; Scalability; Reinforcement learning; Exploit; Function (biology); Distributed computing; Programming language","score_opus":0.016081137430461346,"score_gpt":0.24822591734682667,"score_spread":0.2321447799163653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119076930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022936355,0.00038492083,0.96130425,0.00048170102,0.00007315671,0.00003099364,0.000045904326,0.00021200598,0.014530675],"genre_scores_gemma":[0.51402,0.00066771766,0.46718496,0.00016500453,0.00008433918,0.00021282687,0.0001432611,0.0002693631,0.017252546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987614,0.000034649296,0.000006746385,0.000029002025,0.000034743007,0.000018668023],"domain_scores_gemma":[0.9997398,0.0001292839,0.000020532358,0.000037366946,0.00004546523,0.00002759231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034361548,0.00044379532,0.00050032727,0.00039086404,0.0005186363,0.0007947796,0.001261619,0.001019277,0.0048129396],"category_scores_gemma":[0.0015754985,0.0004224235,0.0006324976,0.00042116822,0.001042447,0.0010307069,0.0012321444,0.0014952373,0.0003502023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021330614,0.00002840887,0.0003421854,0.000047948037,0.000048750975,0.00007890652,0.00021809658,0.666089,0.004353404,0.25531518,0.0023674285,0.0710894],"study_design_scores_gemma":[0.000005801056,0.000012047128,0.00012751398,0.000006640999,0.0000068985623,0.00002342787,0.00002118737,0.8863809,0.00030381727,0.11160821,0.0014959844,0.0000075032235],"about_ca_topic_score_codex":0.0035501397,"about_ca_topic_score_gemma":0.0037063195,"teacher_disagreement_score":0.0048129396,"about_ca_system_score_codex":0.0007971484,"about_ca_system_score_gemma":0.00050649664,"threshold_uncertainty_score":0.016100824},"labels":[],"label_agreement":null},{"id":"W2119173390","doi":"10.1007/978-3-319-22960-7_12","title":"Serious Games Opportunities for the Primary Education Curriculum in Quebec","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Curriculum; Computer science; Process (computing); Mathematics education; Primary education; Selection (genetic algorithm); Pedagogy; Sociology; Psychology; Artificial intelligence","score_opus":0.05365310082794805,"score_gpt":0.32335623274472225,"score_spread":0.2697031319167742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119173390","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24959578,0.027699176,0.009171031,0.025544472,0.0024197097,0.0005296833,0.003293095,0.001080577,0.6806665],"genre_scores_gemma":[0.3777232,0.00895545,0.0056767357,0.0010259325,0.000060613318,0.00013243977,0.001161547,0.00013289574,0.6051312],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997681,0.000029087303,0.000005030436,0.00002481327,0.00006851764,0.0001044614],"domain_scores_gemma":[0.9995535,0.000032219777,0.000009622879,0.000005641929,0.00010073448,0.00029824305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040468495,0.0004012174,0.00019663846,0.0006654169,0.003108924,0.0022415963,0.00080465846,0.0007009141,0.029726641],"category_scores_gemma":[0.00055381306,0.00019144572,0.00021672295,0.0008428106,0.0005261026,0.00060539565,0.00092076435,0.00083901733,0.001646537],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001390011,0.00051200594,0.008498409,0.000439826,0.000016371654,0.00054444873,0.0076497137,0.0013234087,0.0020067983,0.04064003,0.39553437,0.54269564],"study_design_scores_gemma":[0.000030048417,0.00011264918,0.051198877,0.0005889081,0.000008698592,0.00014129278,0.0059014605,0.0015386506,0.0006402659,0.0029576765,0.9368473,0.000034164856],"about_ca_topic_score_codex":0.924527,"about_ca_topic_score_gemma":0.98771554,"teacher_disagreement_score":0.07547301,"about_ca_system_score_codex":0.017653309,"about_ca_system_score_gemma":0.04421638,"threshold_uncertainty_score":0.1518349},"labels":[],"label_agreement":null},{"id":"W211925862","doi":"10.1007/978-3-319-07467-2_51","title":"Considering Multiple Instances of Items in Combinatorial Reverse Auctions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Regina","funders":"","keywords":"Computer science; Combinatorial auction; Crossover; Operator (biology); Consistency (knowledge bases); Procurement; Reverse auction; Mathematical optimization; Genetic algorithm; Quality (philosophy); Common value auction; Artificial intelligence; Machine learning; Mathematics","score_opus":0.05694815604600356,"score_gpt":0.32072249423650395,"score_spread":0.2637743381905004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W211925862","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.26230893,0.0019598657,0.68761855,0.0026177973,0.000512479,0.00028031095,0.00045959922,0.00025946018,0.043983046],"genre_scores_gemma":[0.80545497,0.0013552636,0.16284762,0.00035467857,0.00074784766,0.00022648774,0.00069206103,0.00038081966,0.027940182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954098,0.0022056934,0.00020730018,0.00077929185,0.00069949,0.0006984198],"domain_scores_gemma":[0.9856208,0.011330428,0.000797834,0.00087389746,0.0006800665,0.0006970415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005119873,0.002025824,0.0049735946,0.001335626,0.001718725,0.008346803,0.007092461,0.0057790764,0.011534617],"category_scores_gemma":[0.021994876,0.003438388,0.0037699006,0.003700104,0.0022634196,0.011892521,0.0032115714,0.0060333936,0.0009848784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068754336,0.00034934035,0.0020294837,0.00055113493,0.0004163066,0.0024224306,0.00027436763,0.6871141,0.0010681106,0.27352276,0.0059854323,0.02557893],"study_design_scores_gemma":[0.000051648403,0.000058789235,0.00022171912,0.00004193419,0.00009999927,0.00037872608,0.00015610573,0.8313105,0.00022608414,0.16633575,0.0010846643,0.000034101784],"about_ca_topic_score_codex":0.003006276,"about_ca_topic_score_gemma":0.0031339538,"teacher_disagreement_score":0.011534617,"about_ca_system_score_codex":0.0020826685,"about_ca_system_score_gemma":0.0011744284,"threshold_uncertainty_score":0.038587213},"labels":[],"label_agreement":null},{"id":"W2119410807","doi":"10.1007/978-3-642-34123-6_22","title":"Aligning Discovered Patterns from Protein Family Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Glycosylation and Glycoproteins Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Protein function prediction; Protein family; Computer science; Representation (politics); Computational biology; Set (abstract data type); Annotation; Protein sequencing; Task (project management); Protein function; Function (biology); Data mining; Pattern recognition (psychology); Artificial intelligence; Peptide sequence; Biology; Genetics","score_opus":0.021164617493399922,"score_gpt":0.2683647348309629,"score_spread":0.24720011733756297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119410807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3514736,0.0036041706,0.5879562,0.0007119987,0.0005805171,0.0004897394,0.022818709,0.020227844,0.012137236],"genre_scores_gemma":[0.22527148,0.002684073,0.7082161,0.0001482418,0.00013897465,0.0002198958,0.054587577,0.0023316895,0.0064019454],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954814,0.000040420913,0.000062530846,0.00018995331,0.00012077322,0.00003808051],"domain_scores_gemma":[0.99882776,0.0004569851,0.00014304079,0.00026867073,0.00022468755,0.00007891887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970879,0.00072820135,0.00067399006,0.003947555,0.00069333677,0.0012739822,0.0010396835,0.00069082784,0.006494226],"category_scores_gemma":[0.0031754877,0.00047757334,0.0012384623,0.004273872,0.00032015753,0.0019052966,0.0010293169,0.0008640984,0.003601025],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008658599,0.00024107419,0.015131578,0.0015471056,0.00033849548,0.0018326311,0.0006196023,0.0059151147,0.16378236,0.007307599,0.017535465,0.78488314],"study_design_scores_gemma":[0.0002229383,0.0008106537,0.056716654,0.0006904986,0.0011674796,0.011667388,0.0020831546,0.30848724,0.3080631,0.08253432,0.22736225,0.00019435727],"about_ca_topic_score_codex":0.0011594655,"about_ca_topic_score_gemma":0.0024138074,"teacher_disagreement_score":0.006494226,"about_ca_system_score_codex":0.0003652375,"about_ca_system_score_gemma":0.00077536,"threshold_uncertainty_score":0.021725357},"labels":[],"label_agreement":null},{"id":"W2119670089","doi":"10.1007/978-3-540-74915-8_39","title":"Game Characterizations and the PSPACE-Completeness of Tree Resolution Space","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Toronto","funders":"","keywords":"Completeness (order theory); PSPACE; Tree (set theory); Computer science; Space (punctuation); Resolution (logic); Mathematics; Programming language; Algorithm; Combinatorics; Operating system; Computational complexity theory","score_opus":0.037834759826331055,"score_gpt":0.2752767526982613,"score_spread":0.23744199287193024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119670089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110381424,0.0023333612,0.6828599,0.008309286,0.0002655293,0.00025623987,0.001534296,0.0010591596,0.19300081],"genre_scores_gemma":[0.83118504,0.0019164897,0.1274559,0.001351383,0.0004264007,0.0006205463,0.0025239708,0.00057592697,0.033944342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965983,0.0011769327,0.00025820418,0.00062045467,0.0008506437,0.00049554853],"domain_scores_gemma":[0.99292165,0.005128675,0.00028694715,0.0007738782,0.0005462761,0.0003426404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024659224,0.0011034486,0.0015512236,0.0017504543,0.00259981,0.0055683665,0.0032133656,0.0022399484,0.011368792],"category_scores_gemma":[0.0084173465,0.0011932418,0.002388944,0.003418374,0.0053245276,0.017188787,0.0042922758,0.010233629,0.0011978899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041972802,0.000037417853,0.000092449474,0.00007793116,0.00001506151,0.00002766666,0.0002895676,0.0050738105,0.00033578114,0.98557556,0.002407504,0.0060254023],"study_design_scores_gemma":[0.000015392188,0.0000071562094,0.000052021067,0.000009792608,0.000007327123,0.00002237121,0.00004940922,0.0062761777,0.00021401212,0.9915514,0.0017878339,0.000007098441],"about_ca_topic_score_codex":0.0034530936,"about_ca_topic_score_gemma":0.0032335368,"teacher_disagreement_score":0.011368792,"about_ca_system_score_codex":0.002530264,"about_ca_system_score_gemma":0.0015443292,"threshold_uncertainty_score":0.038032353},"labels":[],"label_agreement":null},{"id":"W2119675638","doi":"10.1007/3-540-44886-1_4","title":"The Structure Model Interpretation of Wright’s NESS Test","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Causal Inference Techniques","field":"Mathematics","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 Saskatchewan","funders":"","keywords":"Wright; Causation; Overdetermination; Epistemology; Test (biology); Interpretation (philosophy); Pearl; Terminology; Philosophy; Computer science; Linguistics; Theology","score_opus":0.049103651438285316,"score_gpt":0.3350629119220473,"score_spread":0.28595926048376197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119675638","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.11441063,0.0008829955,0.5415585,0.017343033,0.000741559,0.00011435843,0.0008649033,0.00036258876,0.3237214],"genre_scores_gemma":[0.9451928,0.00036143276,0.033992622,0.001210748,0.00040317775,0.000118536416,0.00033532942,0.00013103367,0.018254325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996545,0.0018645041,0.00014883123,0.0006377989,0.00057938363,0.00022448169],"domain_scores_gemma":[0.98961323,0.0073730564,0.00047325663,0.001535784,0.00079906976,0.00020564145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049372474,0.00073606195,0.0011700256,0.0018164649,0.0011631292,0.002187348,0.0017838546,0.0024923508,0.024285762],"category_scores_gemma":[0.028185824,0.00057421153,0.0014691765,0.0012748592,0.0061941314,0.0076221223,0.0022278118,0.0033745512,0.0010360852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016599246,0.000010413828,0.00021780493,0.000017969456,0.000011336772,0.00005154489,0.00010315316,0.0006064996,0.00009004793,0.9943929,0.00090321037,0.0035785134],"study_design_scores_gemma":[0.000010975166,0.000006975096,0.00015010955,0.000007611714,0.000006308726,0.000027865894,0.00003238014,0.0028678162,0.00008589523,0.99586844,0.00093197945,0.0000035615485],"about_ca_topic_score_codex":0.0010036664,"about_ca_topic_score_gemma":0.0011172428,"teacher_disagreement_score":0.024285762,"about_ca_system_score_codex":0.0013394698,"about_ca_system_score_gemma":0.001060651,"threshold_uncertainty_score":0.08124399},"labels":[],"label_agreement":null},{"id":"W2119786326","doi":"10.1007/978-3-319-21840-3_7","title":"Generation of Colourings and Distinguishing Colourings of Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","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","funders":"","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.043798299287756484,"score_gpt":0.2535629484291135,"score_spread":0.209764649141357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119786326","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.12589943,0.0006996705,0.83337885,0.0009190407,0.00050334184,0.0002562731,0.0008490287,0.0015402084,0.035954185],"genre_scores_gemma":[0.45661375,0.0004990042,0.5209112,0.00035973336,0.000119563636,0.00019178276,0.00243969,0.0010862075,0.01777908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991732,0.00016366843,0.0000456543,0.00031013053,0.00020966858,0.000097661934],"domain_scores_gemma":[0.9966744,0.001759858,0.00015950916,0.000915313,0.00034358562,0.0001472857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926496,0.0006057061,0.0005480852,0.0012017104,0.00076697953,0.0017493316,0.0015330936,0.0011102643,0.0060612927],"category_scores_gemma":[0.003578034,0.000796459,0.0013667268,0.0010906387,0.0014977896,0.002430403,0.0024626262,0.0022752783,0.0013439301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016732252,0.00009840211,0.0013452072,0.00043820715,0.000032982087,0.00030413733,0.0009128933,0.014079774,0.025195988,0.72905797,0.012434165,0.21593297],"study_design_scores_gemma":[0.00003598306,0.00003775771,0.00047830355,0.000055182154,0.00003093777,0.000310861,0.00015011441,0.039247867,0.016270969,0.92536557,0.017986778,0.000029729501],"about_ca_topic_score_codex":0.00039358233,"about_ca_topic_score_gemma":0.0007269966,"teacher_disagreement_score":0.0060612927,"about_ca_system_score_codex":0.00086450815,"about_ca_system_score_gemma":0.0005001969,"threshold_uncertainty_score":0.020277023},"labels":[],"label_agreement":null},{"id":"W2119879833","doi":"10.1007/978-3-540-24615-2_10","title":"Approximation Operators in Qualitative Data Analysis","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":134,"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":"Computer science; Set (abstract data type); Basis (linear algebra); Qualitative analysis; Modal; Theoretical computer science; Algebra over a field; Algorithm; Mathematics; Qualitative research; Pure mathematics; Programming language; Geometry","score_opus":0.05495417404853264,"score_gpt":0.31722387130758073,"score_spread":0.2622696972590481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119879833","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.0012632844,0.0023571905,0.99389344,0.00029504698,0.000085892076,0.00002827899,0.00005095313,0.000089437046,0.001936396],"genre_scores_gemma":[0.10339684,0.0058427737,0.88493335,0.00027177655,0.0003457885,0.0003980468,0.00024821996,0.00012398488,0.0044391444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950789,0.0025548195,0.000429734,0.0004144509,0.0014077408,0.000114315044],"domain_scores_gemma":[0.98903507,0.008667852,0.00039781624,0.00096368487,0.00082026096,0.00011533584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008442029,0.0009371874,0.0019024505,0.0022280992,0.0006975812,0.0030706222,0.0014202056,0.00086809555,0.0026452309],"category_scores_gemma":[0.0141348,0.0007833395,0.0018206822,0.004520041,0.0036938759,0.0045305407,0.0021335497,0.0030133573,0.00058356236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030725456,0.000021880627,0.00019611526,0.0005515358,0.000059956496,0.00009511176,0.0007004245,0.016008213,0.00092965626,0.8677205,0.00301624,0.11066967],"study_design_scores_gemma":[0.000007580369,0.000019130792,0.000117224066,0.000107651525,0.000039957948,0.00009791954,0.00015869252,0.06431108,0.00061095704,0.9261735,0.008338363,0.000017934462],"about_ca_topic_score_codex":0.0019062399,"about_ca_topic_score_gemma":0.0010410963,"teacher_disagreement_score":0.008442029,"about_ca_system_score_codex":0.0016989326,"about_ca_system_score_gemma":0.0014047025,"threshold_uncertainty_score":0.044646263},"labels":[],"label_agreement":null},{"id":"W2119908317","doi":"10.1007/978-3-642-23623-5_16","title":"Direct Surgeon Control of the Computer in the Operating Room","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston General Hospital; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; California HIV/AIDS Research Program","keywords":"Dictation; Joystick; Computer science; Input device; Control (management); Human–computer interaction; Operating system; Simulation; Artificial intelligence; Speech recognition","score_opus":0.019943280088024352,"score_gpt":0.24323994744681632,"score_spread":0.22329666735879197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119908317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24158892,0.0024141434,0.7173458,0.000684924,0.0006055569,0.00015838983,0.00022160249,0.0020602262,0.03492042],"genre_scores_gemma":[0.90746135,0.0009459517,0.066533275,0.00026275392,0.00019565527,0.00006613585,0.00009815102,0.00015217476,0.02428462],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996319,0.000051374744,0.000013514746,0.00006802738,0.00016852633,0.00006669431],"domain_scores_gemma":[0.99943453,0.00027903673,0.000044895267,0.00006112432,0.00010746586,0.000072888615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522199,0.00041941516,0.00028227188,0.00023239128,0.00035369932,0.00095334,0.0005065678,0.00042518097,0.007886614],"category_scores_gemma":[0.001337452,0.00025825965,0.00025172046,0.00013275958,0.00041732672,0.00045477194,0.0013826209,0.0005614576,0.00091913674],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020398132,0.00012942862,0.004446127,0.00035497462,0.00004068863,0.0009651079,0.0008997018,0.0074273194,0.63094366,0.004056345,0.0064613023,0.34223548],"study_design_scores_gemma":[0.00065909105,0.006773223,0.04478119,0.00028386785,0.0003580466,0.019185456,0.0012576868,0.1691619,0.6127633,0.0074000843,0.13698904,0.00038710286],"about_ca_topic_score_codex":0.00164265,"about_ca_topic_score_gemma":0.003131449,"teacher_disagreement_score":0.007886614,"about_ca_system_score_codex":0.00013904787,"about_ca_system_score_gemma":0.0007063783,"threshold_uncertainty_score":0.02638334},"labels":[],"label_agreement":null},{"id":"W2120066393","doi":"10.1007/11549345_44","title":"Basic Mereology with Equivalence Relations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"McMaster University","funders":"","keywords":"Mereology; Axiom; Computer science; Equivalence (formal languages); Equivalence relation; Theoretical computer science; Algebra over a field; Software; Algorithm; Artificial intelligence; Calculus (dental); Programming language; Discrete mathematics; Mathematics; Pure mathematics; Epistemology; Philosophy; Geometry","score_opus":0.020036968508959887,"score_gpt":0.24483930487263741,"score_spread":0.22480233636367752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120066393","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.025897656,0.012924642,0.27970007,0.0049240207,0.0023395196,0.00015398757,0.00084402657,0.00074230507,0.6724738],"genre_scores_gemma":[0.66224897,0.013055136,0.15983588,0.002531463,0.0069174254,0.00053522916,0.0024030455,0.0007455197,0.15172742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998939,0.000287832,0.000112290785,0.00023682285,0.00031766712,0.000106337495],"domain_scores_gemma":[0.9992188,0.00038497933,0.00004403278,0.00016552204,0.00013478876,0.00005169383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012671744,0.0008872557,0.0011321903,0.002908633,0.0023576366,0.0036230038,0.0013269319,0.0018400458,0.013986762],"category_scores_gemma":[0.0018501036,0.0009742058,0.0013595244,0.0032819612,0.006161244,0.015196483,0.0028253626,0.0044155396,0.0035837356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047333087,0.0000080991385,0.000014616955,0.000042075902,0.0000037582608,0.000028523025,0.00011574002,0.00004730355,0.00018302981,0.99339783,0.0014730791,0.0046812412],"study_design_scores_gemma":[0.0000038505923,0.0000035471355,0.000046784946,0.000011089266,0.0000041977146,0.00008303247,0.000017676677,0.00014733637,0.0000991492,0.984992,0.014586614,0.0000046508],"about_ca_topic_score_codex":0.00038121393,"about_ca_topic_score_gemma":0.00040330004,"teacher_disagreement_score":0.013986762,"about_ca_system_score_codex":0.0011168917,"about_ca_system_score_gemma":0.00058421126,"threshold_uncertainty_score":0.04679042},"labels":[],"label_agreement":null},{"id":"W2120128214","doi":"10.1007/3-540-44686-9_28","title":"Experiments on Extracting Knowledge from a Machine-Readable Dictionary of Synonym Differences","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Toronto","funders":"","keywords":"Computer science; Synonym (taxonomy); Natural language processing; Artificial intelligence; Word (group theory); Sentence; Knowledge base; Set (abstract data type); Part of speech; Machine translation; Bilingual dictionary; Linguistics; Programming language","score_opus":0.024582961851504867,"score_gpt":0.28740466966711753,"score_spread":0.26282170781561265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120128214","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.94513786,0.0025366968,0.023346484,0.0006988359,0.00040317007,0.0010174166,0.011806749,0.0053444146,0.009708396],"genre_scores_gemma":[0.8278163,0.0016319022,0.11212359,0.0004266592,0.0001385998,0.0007956791,0.050035503,0.0005937484,0.006438007],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99685514,0.0012066129,0.0006165605,0.0007781671,0.00038150867,0.00016213313],"domain_scores_gemma":[0.93183964,0.059759397,0.001162618,0.0039974735,0.0024632162,0.00077770127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031510722,0.0017353112,0.0014717025,0.0020031817,0.0010398993,0.0015133482,0.0025541952,0.0024956437,0.008088108],"category_scores_gemma":[0.031998783,0.00075321714,0.0012415,0.0032055383,0.00090075686,0.006491916,0.0016243575,0.0020171853,0.0030560496],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013756188,0.0143374065,0.021955308,0.00960255,0.0014786727,0.0034538733,0.0067768465,0.025643025,0.07320584,0.0026678015,0.043674868,0.78344756],"study_design_scores_gemma":[0.007691179,0.021568023,0.09713891,0.0014716703,0.0045552957,0.007360591,0.015215398,0.49171612,0.25113449,0.019194216,0.08205715,0.000897055],"about_ca_topic_score_codex":0.0062590265,"about_ca_topic_score_gemma":0.0058598383,"teacher_disagreement_score":0.008088108,"about_ca_system_score_codex":0.0007106267,"about_ca_system_score_gemma":0.0010291983,"threshold_uncertainty_score":0.02705741},"labels":[],"label_agreement":null},{"id":"W2120182417","doi":"10.1007/978-3-642-17653-1_27","title":"Fast Local-Spin Abortable Mutual Exclusion with Bounded Space","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Bounded function; Critical section; Theoretical computer science; Suzuki-Kasami algorithm; Abort; Algorithm; Discrete mathematics; Distributed computing; Mathematics; Programming language","score_opus":0.00772564879268011,"score_gpt":0.22497021202419698,"score_spread":0.21724456323151686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120182417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07105995,0.0005599674,0.8993226,0.00035284183,0.0002603363,0.00014125704,0.00016251238,0.008676607,0.019463826],"genre_scores_gemma":[0.83638734,0.00018886998,0.14697227,0.00016088563,0.00008695964,0.00026801578,0.00031275913,0.0007672921,0.014855612],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844426,0.00031777666,0.00006431787,0.00014841344,0.0006514213,0.00037382837],"domain_scores_gemma":[0.99654937,0.0012438743,0.0001570159,0.0013647192,0.0004631033,0.00022192768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359861,0.0007936988,0.0013729086,0.00064742815,0.002170273,0.00190721,0.002331089,0.000838917,0.008548921],"category_scores_gemma":[0.0035192238,0.00054704375,0.00050951063,0.0009678787,0.001395024,0.0026854873,0.0044329357,0.0019297411,0.0013086537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00521503,0.0005208469,0.0021293845,0.0005772603,0.00017502013,0.00040189744,0.0011904739,0.18515977,0.03331781,0.3117354,0.024456847,0.43512028],"study_design_scores_gemma":[0.0003733106,0.00035963487,0.0004872895,0.000046854508,0.00009329264,0.00016435931,0.00018938308,0.7779224,0.027703054,0.18061815,0.011971852,0.000070386195],"about_ca_topic_score_codex":0.002157226,"about_ca_topic_score_gemma":0.0063889474,"teacher_disagreement_score":0.008548921,"about_ca_system_score_codex":0.0011164454,"about_ca_system_score_gemma":0.0018932465,"threshold_uncertainty_score":0.028598964},"labels":[],"label_agreement":null},{"id":"W2120251759","doi":"10.1007/11422778_68","title":"Peer Collaboration in Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Network packet; Peer-to-peer; Wireless; Relay; Mobile ad hoc network; Vehicular ad hoc network; Computer security; Cryptography; Scheme (mathematics); Wireless network; Distributed computing; Telecommunications","score_opus":0.009726385614746627,"score_gpt":0.24216987799602663,"score_spread":0.23244349238128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120251759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019130422,0.047466747,0.8138911,0.0011766949,0.0017706981,0.00023785821,0.0000613943,0.0006751194,0.11558989],"genre_scores_gemma":[0.47578272,0.061983343,0.2974259,0.00041589304,0.0032045636,0.00070877786,0.00029326518,0.00028499545,0.1599005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991504,0.00027627047,0.00002819996,0.000105373605,0.00038015822,0.000059547274],"domain_scores_gemma":[0.9988557,0.00084374583,0.00003098627,0.00009475643,0.00013565338,0.000039175255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086901506,0.00067219394,0.0009381916,0.00043349035,0.0007214562,0.0012759981,0.0013499813,0.0012580281,0.0035698998],"category_scores_gemma":[0.0028645084,0.00039259662,0.00027801958,0.0011618233,0.0007517722,0.003209336,0.0011842551,0.0010591813,0.0013959948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009573577,0.00010692408,0.00034370035,0.0010967178,0.00005836414,0.00041553928,0.00081402645,0.043214504,0.0045305025,0.47380903,0.02083644,0.45467848],"study_design_scores_gemma":[0.00006203374,0.0002464257,0.0003436999,0.0001903938,0.000079083846,0.001106544,0.00037926575,0.14998555,0.003601958,0.64264446,0.20131801,0.000042546333],"about_ca_topic_score_codex":0.00028246464,"about_ca_topic_score_gemma":0.0003615711,"teacher_disagreement_score":0.0035698998,"about_ca_system_score_codex":0.00034262333,"about_ca_system_score_gemma":0.0004423865,"threshold_uncertainty_score":0.011942506},"labels":[],"label_agreement":null},{"id":"W2120371201","doi":"10.1007/11407386_2","title":"Here’s Your LegoTM Security Kit: How to Give Developers All Protection Mechanisms They Will Ever Need","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","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 British Columbia","funders":"","keywords":"Computer science; Middleware (distributed applications); Extensibility; Architecture; Software engineering; Computer security; Web service; World Wide Web; Database; Distributed computing; Operating system","score_opus":0.025587362312253798,"score_gpt":0.2684642529200341,"score_spread":0.2428768906077803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120371201","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.0066465177,0.0062617804,0.5785256,0.047773622,0.007065094,0.0003530161,0.0007616114,0.03787873,0.31473407],"genre_scores_gemma":[0.03445801,0.0037493,0.34775048,0.010614606,0.0005983755,0.00035997105,0.0007457195,0.012945843,0.5887777],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889815,0.00025048188,0.000047293528,0.00011576903,0.0005789655,0.00010928748],"domain_scores_gemma":[0.9975454,0.00064493757,0.00011660705,0.0006560408,0.0006673959,0.00036960057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016840317,0.0008501237,0.00043633708,0.00085494533,0.0012128593,0.002928352,0.0009852444,0.0025332854,0.042839378],"category_scores_gemma":[0.0072696917,0.0010696525,0.0005832093,0.00050725567,0.0010429452,0.006507977,0.0026914696,0.0050388714,0.043783],"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.000034684064,0.00007973847,0.00047257158,0.00021500356,0.000013957983,0.00017320835,0.0011598378,0.00032446615,0.0050234804,0.04509611,0.5035465,0.4438604],"study_design_scores_gemma":[0.000015381365,0.000039447823,0.00026713772,0.00024105386,0.000014896235,0.0005096729,0.00018205991,0.0010380918,0.0023651186,0.033330068,0.9619639,0.000033017088],"about_ca_topic_score_codex":0.0011460109,"about_ca_topic_score_gemma":0.0035685315,"teacher_disagreement_score":0.042839378,"about_ca_system_score_codex":0.00084438006,"about_ca_system_score_gemma":0.0016677831,"threshold_uncertainty_score":0.14331198},"labels":[],"label_agreement":null},{"id":"W2120399696","doi":"10.1007/3-540-47987-2_71","title":"Hierarchical Representation and Evaluation of the Student in an Intelligent Tutoring System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":31,"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 à Montréal","funders":"","keywords":"Granularity; Computer science; Relevance (law); Knowledge representation and reasoning; Representation (politics); Domain (mathematical analysis); Bayesian network; Artificial intelligence; Domain knowledge; Intelligent tutoring system; Natural language processing; Artificial neural network; Machine learning; Mathematics; Programming language","score_opus":0.05879284054232082,"score_gpt":0.3168170523255987,"score_spread":0.2580242117832779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120399696","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.6040085,0.00027889936,0.38258544,0.00022217917,0.00004587487,0.00031896096,0.000505587,0.0023322504,0.009702287],"genre_scores_gemma":[0.9517577,0.000041313036,0.045817547,0.000022027129,0.000008685736,0.00007320938,0.00032776847,0.000074983815,0.001876726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875295,0.0006067585,0.00007840788,0.00016336837,0.0002994129,0.00009903974],"domain_scores_gemma":[0.99639773,0.0017430836,0.00025728118,0.00029881822,0.0011001003,0.00020297065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014746091,0.00033696936,0.00037189436,0.0010063032,0.0003825863,0.0010834989,0.00063930143,0.00068718975,0.0021973231],"category_scores_gemma":[0.008580948,0.00016237247,0.0001979657,0.0004511334,0.00035663167,0.0011023028,0.000853416,0.00041210925,0.0005402448],"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.0036943266,0.0006421084,0.038213015,0.0002464153,0.00009067758,0.00040423687,0.0030348573,0.10705422,0.10100615,0.013364042,0.0059916535,0.72625834],"study_design_scores_gemma":[0.00004312413,0.000395771,0.017583473,0.00002079984,0.00006192015,0.0000906983,0.00036348653,0.9537446,0.021868048,0.0042629163,0.0015337295,0.000031502484],"about_ca_topic_score_codex":0.0052481564,"about_ca_topic_score_gemma":0.00667999,"teacher_disagreement_score":0.0052481564,"about_ca_system_score_codex":0.00081309077,"about_ca_system_score_gemma":0.0006263628,"threshold_uncertainty_score":0.010435224},"labels":[],"label_agreement":null},{"id":"W2120468118","doi":"10.1007/978-3-540-71701-0_5","title":"Hierarchical Density-Based Clustering of Categorical Data and a Simplification","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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":"York University","funders":"","keywords":"Categorical variable; Cluster analysis; Data mining; Computer science; CURE data clustering algorithm; Outlier; Pattern recognition (psychology); Basis (linear algebra); Hierarchical clustering; Single-linkage clustering; Canopy clustering algorithm; Artificial intelligence; Correlation clustering; Algorithm; Mathematics; Machine learning","score_opus":0.06047806953614623,"score_gpt":0.33107722062942646,"score_spread":0.27059915109328025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120468118","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.0031519611,0.0003088859,0.9944622,0.00021459002,0.00004758766,0.000052084397,0.00019347215,0.00019482935,0.0013744126],"genre_scores_gemma":[0.11312783,0.0010307058,0.87678546,0.00023759059,0.00020532536,0.00037456964,0.0017342858,0.00029333823,0.006210853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99403787,0.0022173298,0.0003918144,0.0008867842,0.002215981,0.00025028715],"domain_scores_gemma":[0.9900878,0.0044384673,0.0003168407,0.0032213747,0.0017696224,0.00016596478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005645031,0.0005863712,0.0022060291,0.0036518497,0.0016948162,0.0026367176,0.0050120577,0.0013234288,0.0039045953],"category_scores_gemma":[0.034223948,0.0012950932,0.0030672038,0.007533182,0.002215559,0.0042029163,0.0043411064,0.003419992,0.0019491146],"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.000103728635,0.00008394739,0.0020371105,0.00041637203,0.00016302441,0.00019355232,0.0009836281,0.097563244,0.0029654813,0.605687,0.014733083,0.27506977],"study_design_scores_gemma":[0.000023750645,0.000044317363,0.0025741947,0.00007372838,0.0000730208,0.0004425906,0.00025744535,0.42045188,0.0016200272,0.55973226,0.014637747,0.00006902798],"about_ca_topic_score_codex":0.009517566,"about_ca_topic_score_gemma":0.010255883,"teacher_disagreement_score":0.009517566,"about_ca_system_score_codex":0.0021878632,"about_ca_system_score_gemma":0.0019890147,"threshold_uncertainty_score":0.029854178},"labels":[],"label_agreement":null},{"id":"W2120481501","doi":"10.1007/978-3-540-70540-6_87","title":"EnACT: A Software Tool for Creating Animated Text Captions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Toronto Metropolitan University","funders":"","keywords":"Lyrics; Closed captioning; Computer science; Animation; Style (visual arts); Software; Representation (politics); Multimedia; Human–computer interaction; World Wide Web; Visual arts; Artificial intelligence; Computer graphics (images); Art; Literature","score_opus":0.041443228501453565,"score_gpt":0.2546977553438822,"score_spread":0.21325452684242865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120481501","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033283744,0.0002607326,0.6954678,0.00012337121,0.00034820606,0.00036003705,0.003759274,0.27608797,0.020264208],"genre_scores_gemma":[0.053808574,0.0007246811,0.7553487,0.0004437064,0.0001934391,0.0016276676,0.019425495,0.080600366,0.08782739],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994179,0.00009552121,0.00004481192,0.00011049556,0.0002954021,0.000035915855],"domain_scores_gemma":[0.99871933,0.00073557964,0.000049401722,0.00018136662,0.00021152262,0.00010274525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009412949,0.0022846763,0.001046304,0.0016177247,0.0008550684,0.0027408039,0.0028047375,0.0017768058,0.098033786],"category_scores_gemma":[0.0036426142,0.0013275936,0.0013416646,0.00084316323,0.0008604197,0.0026054147,0.002983331,0.0018109021,0.029434707],"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.00087558356,0.00027829251,0.0007000161,0.0020299903,0.00017372561,0.0010884532,0.0015855451,0.0118509205,0.07006735,0.016914966,0.31799084,0.57644427],"study_design_scores_gemma":[0.0003606649,0.00018128348,0.0009179842,0.0002893219,0.00013727705,0.0012098015,0.00040056516,0.14998183,0.12637755,0.014300651,0.7055988,0.0002441852],"about_ca_topic_score_codex":0.0018290804,"about_ca_topic_score_gemma":0.002132774,"teacher_disagreement_score":0.098033786,"about_ca_system_score_codex":0.00056485186,"about_ca_system_score_gemma":0.00058606727,"threshold_uncertainty_score":0.32795566},"labels":[],"label_agreement":null},{"id":"W2120779021","doi":"10.1007/11766247_36","title":"Classification Based on Logical Concept Analysis","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Intension; Computer science; Extension (predicate logic); Partition (number theory); Classification rule; Formal concept analysis; Class (philosophy); One-class classification; Set (abstract data type); Theoretical computer science; Artificial intelligence; Data mining; Algorithm; Classifier (UML); Mathematics; Combinatorics","score_opus":0.027799445371030636,"score_gpt":0.2526625112476324,"score_spread":0.22486306587660176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120779021","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.008274794,0.0012609698,0.9795166,0.0005722682,0.00027205233,0.00013569689,0.00013120109,0.00041764966,0.009418651],"genre_scores_gemma":[0.22066772,0.0014932409,0.76988167,0.00031568043,0.00035129953,0.0005004174,0.0007665711,0.00008670469,0.0059367456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826825,0.0005243236,0.00014853128,0.00024820332,0.00073552976,0.0000751133],"domain_scores_gemma":[0.99781173,0.0013690338,0.00011693244,0.00020075256,0.00044742186,0.000054241274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019174106,0.00047082527,0.001111637,0.002642579,0.00085952325,0.0033048466,0.0015577563,0.00066865614,0.005418464],"category_scores_gemma":[0.006407715,0.00030030354,0.0013068564,0.0022585737,0.0013910917,0.0038199734,0.0015831391,0.0012677925,0.0015535399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017285395,0.000120680954,0.0012013402,0.00040021728,0.0001410509,0.0001263867,0.0004100662,0.013387295,0.00479041,0.38949677,0.01088598,0.5788669],"study_design_scores_gemma":[0.000038749276,0.00009567919,0.0011206814,0.00014963969,0.00013345057,0.00036273134,0.00019067524,0.43303582,0.0035089348,0.5395569,0.021748548,0.000058137557],"about_ca_topic_score_codex":0.00082198053,"about_ca_topic_score_gemma":0.00062632875,"teacher_disagreement_score":0.005418464,"about_ca_system_score_codex":0.0009529077,"about_ca_system_score_gemma":0.0011025083,"threshold_uncertainty_score":0.018126547},"labels":[],"label_agreement":null},{"id":"W2120783719","doi":"10.1007/11427469_93","title":"Fault Detection in Reaction Wheel of a Satellite Using Observer-Based Dynamic Neural Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","field":"Engineering","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":"","keywords":"Artificial neural network; Computer science; Fault detection and isolation; Control theory (sociology); Residual; Observer (physics); Nonlinear system; Satellite; State observer; Actuator; Attitude control; Fault (geology); Reaction wheel; Control engineering; Artificial intelligence; Control (management); Algorithm; Engineering","score_opus":0.012403777381004451,"score_gpt":0.22376093344726727,"score_spread":0.21135715606626282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120783719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13858448,0.00045939485,0.85622627,0.000156176,0.00014571092,0.000046494173,0.00005229774,0.0009116621,0.0034176235],"genre_scores_gemma":[0.9803469,0.00011566806,0.017567374,0.000018503342,0.000011339812,0.00002300583,0.00004279539,0.000018327299,0.0018561145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998565,0.0000183123,0.000010423104,0.000041615393,0.00004909513,0.000024133515],"domain_scores_gemma":[0.99965763,0.00011954604,0.00006009954,0.00002567979,0.00012245642,0.000014531613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027029664,0.00048665813,0.00064393476,0.0002902148,0.0002999839,0.00053252105,0.00056924694,0.0007844917,0.0010118348],"category_scores_gemma":[0.0009129385,0.00027744682,0.00037717074,0.00025300917,0.000305572,0.0005052829,0.00034438126,0.0005400695,0.00019575511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007095594,0.00008007236,0.00543077,0.00030612084,0.00010363487,0.0003877552,0.00023966846,0.79134446,0.051237024,0.0031849493,0.0011553309,0.14582074],"study_design_scores_gemma":[0.0000109504235,0.000052432915,0.00100792,0.000008171291,0.000017024295,0.000030031142,0.000013307912,0.99474216,0.0033966552,0.00045666884,0.00025830718,0.0000064736223],"about_ca_topic_score_codex":0.009962412,"about_ca_topic_score_gemma":0.0074974974,"teacher_disagreement_score":0.009962412,"about_ca_system_score_codex":0.00041048368,"about_ca_system_score_gemma":0.00036015012,"threshold_uncertainty_score":0.019808829},"labels":[],"label_agreement":null},{"id":"W2120829706","doi":"10.1007/11596448_131","title":"A Novel Multi-stage 3D Medical Image Segmentation: Methodology and Validation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Robarts Clinical Trials","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Centroid; Image segmentation; Scale-space segmentation; Computer vision; Segmentation-based object categorization; Measure (data warehouse); Pattern recognition (psychology); Data mining","score_opus":0.08461493616461994,"score_gpt":0.36923633067801553,"score_spread":0.2846213945133956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120829706","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.01502548,0.00020313647,0.98232746,0.000058008678,0.000039432758,0.00013881388,0.00017907133,0.0014252393,0.0006034017],"genre_scores_gemma":[0.10542401,0.00026506934,0.8910598,0.00007696174,0.000029103354,0.00020835374,0.0005021289,0.0003277672,0.002106846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987888,0.0001755299,0.00006718146,0.00029458222,0.00060985005,0.00006408745],"domain_scores_gemma":[0.9984848,0.00038000385,0.0001588379,0.00030261406,0.000611234,0.00006259307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019911323,0.0008280962,0.0009456826,0.0013105028,0.0005508919,0.0014891877,0.0016851199,0.0021442203,0.0030529539],"category_scores_gemma":[0.002800658,0.0008479956,0.0009397061,0.0011157889,0.0007003533,0.00095643103,0.0013208337,0.00081912766,0.0012117225],"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.0007559653,0.00025485634,0.0049115075,0.0008125645,0.00035649573,0.00026622086,0.00030569974,0.060414482,0.39938575,0.005194579,0.0034813827,0.5238605],"study_design_scores_gemma":[0.000060899503,0.00045848975,0.008329876,0.00005256282,0.0001896642,0.0018510276,0.000058191563,0.7920706,0.18764491,0.0015108297,0.007690105,0.00008275628],"about_ca_topic_score_codex":0.0022020473,"about_ca_topic_score_gemma":0.0029498714,"teacher_disagreement_score":0.0030529539,"about_ca_system_score_codex":0.00058135454,"about_ca_system_score_gemma":0.0013376507,"threshold_uncertainty_score":0.010530293},"labels":[],"label_agreement":null},{"id":"W2120943353","doi":"10.1007/3-540-47922-8_29","title":"RFCT: An Association-Based Causality Miner","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Regina","funders":"","keywords":"Causality (physics); Computer science; Association rule learning; Association (psychology); Raw data; Causal model; Data mining; Artificial intelligence; Granger causality; Causal analysis; Data science; Machine learning; Econometrics; Programming language; Statistics; Psychology; Mathematics","score_opus":0.02304092670617294,"score_gpt":0.2579760302973366,"score_spread":0.23493510359116368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120943353","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.0059605124,0.00078149943,0.96599233,0.00029502102,0.00019044938,0.0003602027,0.0049204887,0.019950543,0.0015489636],"genre_scores_gemma":[0.058769975,0.0006577783,0.9256589,0.0002833372,0.00016043306,0.00043563155,0.007595296,0.00090186734,0.005536739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979388,0.00040818864,0.00021195297,0.00046506213,0.0008812218,0.000094708645],"domain_scores_gemma":[0.99556667,0.002377321,0.00031243096,0.0008240547,0.00076187745,0.0001574726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032521884,0.001767151,0.0020649238,0.0054841465,0.00093435525,0.0020964195,0.0038081992,0.0016413485,0.01120153],"category_scores_gemma":[0.013519984,0.0012136764,0.0020272445,0.0037818647,0.0005622003,0.0028416677,0.002323797,0.00232113,0.005787151],"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.00078378397,0.00049010845,0.0110716885,0.0010872785,0.0008265428,0.00070813403,0.00017458748,0.048595436,0.0077372314,0.011553177,0.055067644,0.86190444],"study_design_scores_gemma":[0.000438085,0.00040798433,0.0026856263,0.0002394339,0.00070388237,0.001942442,0.00009774625,0.8633172,0.01600048,0.06264774,0.051389564,0.00012981967],"about_ca_topic_score_codex":0.0033061914,"about_ca_topic_score_gemma":0.0077234074,"teacher_disagreement_score":0.01120153,"about_ca_system_score_codex":0.0003411594,"about_ca_system_score_gemma":0.0029432673,"threshold_uncertainty_score":0.037472844},"labels":[],"label_agreement":null},{"id":"W2120982338","doi":"10.1007/978-3-642-31368-4_20","title":"Enhancement of the ROVER’s Voting Scheme Using Pattern Matching","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Lakehead University; University of Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Voting; Matching (statistics); Pattern matching; Artificial intelligence; Algorithm; Computer vision; Mathematics; Statistics","score_opus":0.020152074465840122,"score_gpt":0.24720004062223097,"score_spread":0.22704796615639083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120982338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04072775,0.00023523165,0.9528597,0.00012959147,0.00017868706,0.00016223223,0.00006875735,0.0008021422,0.0048358873],"genre_scores_gemma":[0.57197976,0.00022568599,0.41706342,0.00011903959,0.00013475401,0.00011826346,0.00031948483,0.00009973922,0.009939919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984231,0.0005209069,0.000084058,0.00025860913,0.00054047944,0.0001728938],"domain_scores_gemma":[0.99843913,0.00031702375,0.00007756564,0.00075095997,0.0003698668,0.00004541335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173735,0.000401362,0.0010810369,0.00077634404,0.0005625174,0.000737456,0.0015594749,0.0009142491,0.0035408477],"category_scores_gemma":[0.0026150702,0.00023990637,0.0006839725,0.001039874,0.00042067363,0.001537379,0.0011402027,0.00078325847,0.0012032957],"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.00096390885,0.0003189242,0.0013297376,0.00016122135,0.00015272402,0.00019914105,0.00012566055,0.04753236,0.106993094,0.06056042,0.0045769317,0.77708596],"study_design_scores_gemma":[0.00012433119,0.0005249652,0.0011080198,0.000015552037,0.00009875813,0.0008555624,0.000036512436,0.9086963,0.053281892,0.021796387,0.01341298,0.000048777143],"about_ca_topic_score_codex":0.00066701754,"about_ca_topic_score_gemma":0.0006280437,"teacher_disagreement_score":0.0035408477,"about_ca_system_score_codex":0.0003343522,"about_ca_system_score_gemma":0.0006668882,"threshold_uncertainty_score":0.011845291},"labels":[],"label_agreement":null},{"id":"W2120995736","doi":"10.1007/11528043_41","title":"The Impact of E-Learning on the Use of Campus Instructional Space","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online and Blended Learning","field":"Social Sciences","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 British Columbia","funders":"","keywords":"Perspective (graphical); Computer science; Space (punctuation); E learning; Mathematics education; Artificial intelligence; World Wide Web; Psychology; The Internet","score_opus":0.028783277701344288,"score_gpt":0.3027392375251864,"score_spread":0.2739559598238421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120995736","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.9699864,0.0005434831,0.00019783,0.000445405,0.000022236272,0.000007776561,0.00020965273,0.000016759626,0.028570537],"genre_scores_gemma":[0.996003,0.00024221513,0.00011396359,0.000025992966,0.000009747688,0.0000053465214,0.00006368937,0.000009822884,0.0035262788],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99912244,0.000328835,0.000035357072,0.00007734738,0.0002770495,0.0001589369],"domain_scores_gemma":[0.9921834,0.0047646286,0.0007265186,0.00023485166,0.0009892085,0.0011015115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075469294,0.0001536831,0.00015118833,0.0005624421,0.0005077953,0.0020679838,0.0006038665,0.0004830629,0.016414747],"category_scores_gemma":[0.007117546,0.00009993508,0.00031894198,0.00085905247,0.00045826114,0.0012190865,0.0014664871,0.00063421007,0.0014358656],"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.0037754893,0.005872528,0.42639828,0.0002846826,0.00018516472,0.0006080368,0.0066162795,0.004941096,0.013809704,0.010801279,0.009268943,0.5174385],"study_design_scores_gemma":[0.000039079627,0.0008032361,0.9744947,0.00007527754,0.00010619813,0.0001709779,0.007335957,0.0019729515,0.0049648834,0.0024255398,0.0075840205,0.000027284757],"about_ca_topic_score_codex":0.0057844818,"about_ca_topic_score_gemma":0.008343539,"teacher_disagreement_score":0.016414747,"about_ca_system_score_codex":0.0009840145,"about_ca_system_score_gemma":0.00092514197,"threshold_uncertainty_score":0.054912746},"labels":[],"label_agreement":null},{"id":"W2121061011","doi":"10.1007/3-540-47922-8_39","title":"cbCPT: Knowledge Engineering Support for CPTs in Bayesian Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Bayesian network; Computer science; Usability; Graphical model; Probabilistic logic; Artificial intelligence; Conditional probability; Human–computer interaction; Simple (philosophy); Knowledge acquisition; Machine learning; Software engineering; Data science","score_opus":0.022032094400336485,"score_gpt":0.24606464950636545,"score_spread":0.22403255510602896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121061011","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.00079157756,0.000076763165,0.9670167,0.00024614396,0.00008289382,0.00009002572,0.0013342117,0.0262557,0.0041059186],"genre_scores_gemma":[0.04141452,0.0003714424,0.94156694,0.00033195803,0.00012078755,0.00037552117,0.0045553194,0.0055434243,0.0057200594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831223,0.00040971718,0.00017279283,0.00026219973,0.0007487412,0.00009427522],"domain_scores_gemma":[0.99126315,0.0058567794,0.00028509373,0.001433431,0.00091572374,0.00024578723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029078242,0.0013160162,0.0010434595,0.0016192294,0.00089178205,0.004040481,0.0037700026,0.00211001,0.049802784],"category_scores_gemma":[0.02653892,0.0014928011,0.0016993977,0.0020817113,0.0009837332,0.005802994,0.0029774152,0.0039502745,0.0139898015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004898533,0.00019773508,0.000724824,0.00079683744,0.00013925781,0.00063522696,0.00045336338,0.059759222,0.0034955882,0.16775008,0.14330105,0.62225693],"study_design_scores_gemma":[0.00021757063,0.000025788937,0.00018698716,0.0001688834,0.00007730246,0.00035959098,0.00005443593,0.62074375,0.009240687,0.2809885,0.087874696,0.000061734194],"about_ca_topic_score_codex":0.0058456915,"about_ca_topic_score_gemma":0.007666317,"teacher_disagreement_score":0.049802784,"about_ca_system_score_codex":0.0010165278,"about_ca_system_score_gemma":0.0018354973,"threshold_uncertainty_score":0.1666069},"labels":[],"label_agreement":null},{"id":"W2121078160","doi":"10.1007/3-540-45415-2_7","title":"Active Page Generation via Customizing XML for Data Beans in E-Commerce Applications","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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":"IBM (Canada)","funders":"","keywords":"Computer science; XML; Streaming XML; XML validation; XML Schema Editor; Programming language; Efficient XML Interchange; XML Schema (W3C); cXML; XML framework; Database; Document Structure Description; Software engineering; RELAX NG; XML Encryption; World Wide Web","score_opus":0.05156349024137903,"score_gpt":0.2902692375539837,"score_spread":0.2387057473126047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121078160","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.040447023,0.00047047334,0.91416866,0.00029750585,0.00014730543,0.000148191,0.00016388802,0.03686118,0.007295842],"genre_scores_gemma":[0.3676678,0.00052911486,0.5930813,0.00035004842,0.00012289172,0.00014194995,0.0013645799,0.010081735,0.026660526],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921584,0.00025638606,0.00008739468,0.00014622947,0.00021917568,0.00007490198],"domain_scores_gemma":[0.99743867,0.0012285628,0.00008911271,0.000882606,0.00026999807,0.00009105064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024842648,0.00055643433,0.0005811318,0.0008088359,0.0005222823,0.0023221779,0.0017651108,0.001289244,0.0048641223],"category_scores_gemma":[0.0036456785,0.0009709358,0.00079829164,0.000923966,0.0006071864,0.0027597279,0.0012087137,0.0015610467,0.0021731467],"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.0012016955,0.00087667844,0.004631805,0.00042317333,0.00008828783,0.001013343,0.0020727993,0.014214811,0.09989663,0.067353174,0.025187634,0.78304005],"study_design_scores_gemma":[0.00027904546,0.00037785288,0.004285235,0.00018804429,0.0003076892,0.002023884,0.00034425096,0.4641777,0.30005324,0.08813253,0.1396112,0.00021938089],"about_ca_topic_score_codex":0.0009209948,"about_ca_topic_score_gemma":0.0010211271,"teacher_disagreement_score":0.0048641223,"about_ca_system_score_codex":0.00037609503,"about_ca_system_score_gemma":0.0003018084,"threshold_uncertainty_score":0.016272128},"labels":[],"label_agreement":null},{"id":"W2121315965","doi":"10.1007/978-3-319-09274-4_6","title":"Increasing Accuracy in a Bidirectional Associative Memory through Expended Databases","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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 Ottawa","funders":"","keywords":"Recall; Computer science; Association (psychology); Associative property; Association rule learning; Artificial intelligence; Precision and recall; Point (geometry); Artificial neural network; Process (computing); Machine learning; Pattern recognition (psychology); Natural language processing; Cognitive psychology; Psychology; Mathematics","score_opus":0.03794630838851651,"score_gpt":0.29481448363673035,"score_spread":0.2568681752482138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121315965","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.5480857,0.0024167292,0.4244249,0.0014790755,0.00060721696,0.00006327086,0.00063925993,0.004178257,0.018105624],"genre_scores_gemma":[0.94471836,0.0005343165,0.047902323,0.00018460029,0.000120574834,0.000033092212,0.00025373514,0.00010868901,0.0061441776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934536,0.0000814614,0.00008598043,0.00019831298,0.00018472536,0.000104116625],"domain_scores_gemma":[0.99459064,0.0021615266,0.0003651415,0.0018762858,0.00074308075,0.00026336798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010257068,0.00047631585,0.0010004592,0.0008402458,0.0006145551,0.002141016,0.0025772585,0.0009470761,0.0066658775],"category_scores_gemma":[0.0066434285,0.0005399246,0.00033420976,0.0016038441,0.0008486179,0.00668217,0.0021419474,0.0014298529,0.0013689173],"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.002016244,0.00078421546,0.003628895,0.00042140062,0.00018839461,0.00029882902,0.00031743653,0.07586537,0.049160678,0.09426574,0.009630408,0.76342237],"study_design_scores_gemma":[0.00011421042,0.0005233213,0.001643847,0.000066309796,0.00021967784,0.00045705526,0.00015694069,0.7223346,0.05615364,0.21330917,0.0049485695,0.000072597875],"about_ca_topic_score_codex":0.0017636367,"about_ca_topic_score_gemma":0.0023317426,"teacher_disagreement_score":0.0066658775,"about_ca_system_score_codex":0.00050511915,"about_ca_system_score_gemma":0.0007432916,"threshold_uncertainty_score":0.022299588},"labels":[],"label_agreement":null},{"id":"W2121665983","doi":"10.1007/978-3-642-24965-5_58","title":"Spatial Finite Non-gaussian Mixture for Color Image Segmentation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Mixture model; Image segmentation; Pattern recognition (psychology); Segmentation; Computer vision; Expectation–maximization algorithm; Scale-space segmentation; Maximization; Pixel; Gaussian; Image (mathematics); Maximum likelihood; Mathematics; Mathematical optimization; Statistics","score_opus":0.01966009758619449,"score_gpt":0.2684416241560063,"score_spread":0.2487815265698118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121665983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005813157,0.00049078325,0.99815995,0.000031364547,0.000017031902,0.0000109924085,0.000030683426,0.0003185915,0.0003592592],"genre_scores_gemma":[0.03523682,0.0013531231,0.9580867,0.00008077428,0.00006227839,0.000099097524,0.0003569628,0.0003839179,0.0043402407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.000113356175,0.000025479405,0.00010850306,0.0001580652,0.000033507316],"domain_scores_gemma":[0.9994481,0.00028682506,0.000027844706,0.0001008819,0.00011594307,0.000020377023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309532,0.00077170675,0.0013597641,0.0012870848,0.00036582747,0.0011589399,0.0020341286,0.0015467295,0.004657457],"category_scores_gemma":[0.0016366597,0.0008433087,0.0014877022,0.0020328455,0.0007419487,0.0014640292,0.0012528558,0.0014769926,0.0023265546],"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.00018883465,0.00007305164,0.0002902762,0.00053597824,0.00016386535,0.000109850545,0.0001303417,0.24092437,0.036048334,0.0803298,0.008293054,0.63291216],"study_design_scores_gemma":[0.0000035701667,0.0000084881785,0.00013900937,0.000014711503,0.000021142,0.00009111773,0.000008944951,0.96451765,0.0046348437,0.026757816,0.0037870556,0.000015548289],"about_ca_topic_score_codex":0.0054657226,"about_ca_topic_score_gemma":0.0072615775,"teacher_disagreement_score":0.0054657226,"about_ca_system_score_codex":0.000956308,"about_ca_system_score_gemma":0.00069994596,"threshold_uncertainty_score":0.015580714},"labels":[],"label_agreement":null},{"id":"W2121944353","doi":"10.1007/978-3-642-39074-6_13","title":"Hypergraph Automata: A Theoretical Model for Patterned Self-assembly","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Western University","funders":"","keywords":"Hypergraph; Automaton; Computer science; Expressive power; Mobile automaton; Theoretical computer science; Existential quantification; Regular language; Automata theory; Algorithm; Discrete mathematics; Mathematics","score_opus":0.012181823205912682,"score_gpt":0.2427925638809109,"score_spread":0.2306107406749982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121944353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062266253,0.0023312648,0.8659888,0.0020190119,0.000344212,0.000115960465,0.0004567038,0.0008650943,0.0656128],"genre_scores_gemma":[0.8068517,0.0027922443,0.14524895,0.0005840021,0.00036425248,0.00053216564,0.00051422784,0.00038805255,0.042724468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967086,0.00009283947,0.000020413661,0.00007190161,0.000093267394,0.000050688923],"domain_scores_gemma":[0.9991499,0.0005060531,0.000056825796,0.00012748521,0.000089459056,0.000070246555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122492,0.0005787428,0.0007157285,0.00075823494,0.0010666471,0.0029187403,0.0018947347,0.00192259,0.0067399917],"category_scores_gemma":[0.0019309629,0.0005685529,0.0009476664,0.0010917182,0.0024210394,0.0033519892,0.0011053666,0.0019812314,0.0011848407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008260592,0.000013139285,0.000060980376,0.00003559363,0.000006588003,0.000047837257,0.00012205436,0.0164076,0.00066707167,0.97740865,0.0012773444,0.0039448566],"study_design_scores_gemma":[0.0000073738047,0.000006567235,0.00002684108,0.000010197621,0.0000049846094,0.000035793553,0.000027134822,0.09717526,0.0002682129,0.90000963,0.0024202205,0.000007790726],"about_ca_topic_score_codex":0.0019289182,"about_ca_topic_score_gemma":0.0017141855,"teacher_disagreement_score":0.0067399917,"about_ca_system_score_codex":0.0013534867,"about_ca_system_score_gemma":0.0009073633,"threshold_uncertainty_score":0.022547543},"labels":[],"label_agreement":null},{"id":"W2122172746","doi":"10.1007/978-3-540-75221-9_3","title":"A Denotational Semantics for Handel-C","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Trinity College","funders":"","keywords":"Denotational semantics of the Actor model; Denotational semantics; Normalisation by evaluation; Assertion; Action semantics; Programming language; Computer science; Operational semantics; Semantics (computer science); Construct (python library); Domain theory; Mathematics; Discrete mathematics","score_opus":0.028121117244248824,"score_gpt":0.32303307329081465,"score_spread":0.29491195604656584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122172746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010761269,0.00026085,0.9596384,0.00060650334,0.00021514964,0.000106723885,0.00020876757,0.0019977721,0.026204607],"genre_scores_gemma":[0.40564075,0.00041582997,0.57673484,0.00055911706,0.0002552885,0.00036002498,0.0005184693,0.00087843137,0.014637281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980996,0.00031627493,0.00017895117,0.00046261682,0.0006056242,0.00033691383],"domain_scores_gemma":[0.9979825,0.0008406804,0.00012330749,0.0003680813,0.00054024754,0.00014518813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014256007,0.0011787849,0.00071789394,0.0016888822,0.0023263851,0.0040940903,0.0020570387,0.0018532682,0.009305981],"category_scores_gemma":[0.0031747387,0.0009165866,0.0013934267,0.0016183648,0.0054875202,0.0058252015,0.0037522644,0.0028048826,0.001694846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031319592,0.000024954015,0.00009532812,0.00006838108,0.000007970702,0.00011007825,0.000278649,0.0016839746,0.001771705,0.9823682,0.0010478472,0.012511535],"study_design_scores_gemma":[0.000042506064,0.000041032083,0.00012796963,0.00005029413,0.00003344638,0.0002202421,0.00017158526,0.01831163,0.005523664,0.9463034,0.029126804,0.000047335718],"about_ca_topic_score_codex":0.0037617986,"about_ca_topic_score_gemma":0.0032391036,"teacher_disagreement_score":0.009305981,"about_ca_system_score_codex":0.001753519,"about_ca_system_score_gemma":0.0017782307,"threshold_uncertainty_score":0.031131625},"labels":[],"label_agreement":null},{"id":"W2122324098","doi":"10.1007/978-3-642-20798-3_16","title":"Adaptive Transmission of Variable-Bit-Rate Video Streams to Mobile Devices","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Variable bitrate; Real-time computing; Testbed; Base station; Transmission (telecommunications); Bitstream; Mobile device; Video processing; Key (lock); Computer network; Computer hardware; Bit rate; Algorithm; Telecommunications; Decoding methods","score_opus":0.02771851928253827,"score_gpt":0.2762212806035182,"score_spread":0.24850276132097993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122324098","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.02952266,0.0006895908,0.96738565,0.00008566629,0.00009501848,0.00009016817,0.00002811587,0.000966816,0.0011363068],"genre_scores_gemma":[0.33645228,0.00084130384,0.6579869,0.0001593076,0.0001846077,0.00015984816,0.00020875229,0.00013819913,0.0038689163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997012,0.000049019443,0.000021668126,0.00006848321,0.00012819728,0.000031383457],"domain_scores_gemma":[0.9994618,0.00016558425,0.000089184025,0.00008649083,0.00016533652,0.000031519354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040876024,0.0005835081,0.0005584291,0.0005952005,0.00036499556,0.0006613765,0.0014792524,0.00046962628,0.0009662869],"category_scores_gemma":[0.0012568927,0.00024466633,0.00020168645,0.00044815795,0.0003094663,0.0009865274,0.0005211408,0.0006966909,0.0004348135],"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.00049531774,0.00015684275,0.0015338501,0.00016113189,0.000072416886,0.00018982936,0.00023059295,0.063217565,0.16838741,0.0050025084,0.0028377406,0.75771487],"study_design_scores_gemma":[0.000114639784,0.00049588195,0.0014101145,0.00003040861,0.000046179553,0.0006219175,0.000056100987,0.9055758,0.07947747,0.0023910857,0.009734895,0.000045523826],"about_ca_topic_score_codex":0.0011405656,"about_ca_topic_score_gemma":0.0013346545,"teacher_disagreement_score":0.0014792524,"about_ca_system_score_codex":0.00034438336,"about_ca_system_score_gemma":0.00036134524,"threshold_uncertainty_score":0.0032325387},"labels":[],"label_agreement":null},{"id":"W2122437698","doi":"10.1007/978-3-319-06028-6_102","title":"Information Access in Smart Cities (i-ASC)","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014446084031605265,"score_gpt":0.23481252711606262,"score_spread":0.22036644308445735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122437698","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.00688927,0.14575942,0.049404867,0.008717239,0.009049141,0.00014450897,0.00092951645,0.0007426092,0.77836335],"genre_scores_gemma":[0.1104646,0.15303427,0.031734608,0.0021677045,0.0068741096,0.0002153331,0.001850918,0.00040720464,0.69325125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997446,0.00003256279,0.000011992191,0.00006056971,0.000107043044,0.000043223485],"domain_scores_gemma":[0.99978226,0.00004731291,0.000014419072,0.000037221853,0.000063508334,0.000055233748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030603266,0.0005189926,0.00030050575,0.0015132295,0.00058769697,0.0022525813,0.0005431022,0.0011084218,0.014892219],"category_scores_gemma":[0.0005034814,0.00029436493,0.00033102607,0.0036521624,0.00092508463,0.002712353,0.0018037483,0.0016466022,0.0058174855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018067207,0.00005430782,0.0003630135,0.00040587786,0.00000884584,0.000066911794,0.00030735144,0.0019077543,0.0009392965,0.1953669,0.25323692,0.5473247],"study_design_scores_gemma":[0.0000020809198,0.000018923995,0.0007383112,0.00020815452,0.0000042085117,0.00015512222,0.000105022424,0.001276404,0.00045738285,0.0359317,0.9610931,0.000009591531],"about_ca_topic_score_codex":0.0043218434,"about_ca_topic_score_gemma":0.0057498026,"teacher_disagreement_score":0.014892219,"about_ca_system_score_codex":0.0014680743,"about_ca_system_score_gemma":0.0012058814,"threshold_uncertainty_score":0.04981947},"labels":[],"label_agreement":null},{"id":"W2122545758","doi":"10.1007/978-3-540-73420-8_30","title":"A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Victoria","funders":"","keywords":"Zero-knowledge proof; Computer science; Protocol (science); Complement (music); Theoretical computer science; Characterization (materials science); Monotone polygon; Property (philosophy); Discrete mathematics; Algorithm; Mathematics; Cryptography","score_opus":0.016604501674200793,"score_gpt":0.2607432510228545,"score_spread":0.2441387493486537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122545758","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.12413984,0.0014467977,0.6969322,0.0051672156,0.0004701123,0.0008426411,0.0017828133,0.0014831763,0.16773526],"genre_scores_gemma":[0.84770405,0.0011799474,0.10597078,0.0012059463,0.00058459054,0.0011780865,0.0017248185,0.00052400463,0.039927796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921687,0.0013934824,0.0005955879,0.0016057043,0.0029413668,0.0012950855],"domain_scores_gemma":[0.9784908,0.008465329,0.0019971386,0.0072443364,0.0023348024,0.001467568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004733506,0.0010828406,0.0014449079,0.0016275884,0.0033647236,0.00923563,0.007460149,0.0038034099,0.008858133],"category_scores_gemma":[0.018625854,0.001200225,0.0015777496,0.003743263,0.0052225753,0.015872972,0.008148861,0.011712163,0.002117207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012426646,0.00005319204,0.00031502426,0.00009492387,0.000013056097,0.00005242274,0.00025266915,0.003343947,0.000939628,0.98519206,0.002191148,0.0074276384],"study_design_scores_gemma":[0.000040239975,0.000052073407,0.0003587188,0.00006988816,0.000036839538,0.00030632774,0.00014209647,0.048339132,0.0024604315,0.9342221,0.0139287505,0.000043267064],"about_ca_topic_score_codex":0.0010646071,"about_ca_topic_score_gemma":0.0007673754,"teacher_disagreement_score":0.00923563,"about_ca_system_score_codex":0.0064315717,"about_ca_system_score_gemma":0.005062774,"threshold_uncertainty_score":0.046664476},"labels":[],"label_agreement":null},{"id":"W2122556580","doi":"10.1007/978-3-540-77046-6_75","title":"Confidence Measure for Temporal Registration of Recurrent Non-uniform Samples","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Alberta","funders":"","keywords":"Measure (data warehouse); Aliasing; Sample (material); Computer science; Sampling (signal processing); Artificial intelligence; Set (abstract data type); Confidence interval; Data set; Sample size determination; Pattern recognition (psychology); Statistics; Mathematics; Data mining; Computer vision","score_opus":0.05603150275463625,"score_gpt":0.3167239732039491,"score_spread":0.2606924704493129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122556580","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.016173884,0.00035073742,0.98244506,0.00012660894,0.000046938596,0.000024596891,0.00012118126,0.0002875922,0.00042344164],"genre_scores_gemma":[0.6151388,0.0009343877,0.37602267,0.00028247054,0.0004613681,0.00028348863,0.0023817958,0.0005863457,0.003908602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622345,0.0009200471,0.0003423282,0.00096899696,0.0012109557,0.00033409309],"domain_scores_gemma":[0.9649383,0.02578065,0.0024094575,0.0033806453,0.0026631376,0.0008278412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010703362,0.00094707974,0.0020591433,0.0025758885,0.0006384575,0.0027141569,0.0037291576,0.0033716322,0.0029870935],"category_scores_gemma":[0.05739081,0.0008833517,0.001570769,0.0020734663,0.0019004043,0.0048727645,0.0038542503,0.003155752,0.0008744027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020237968,0.0002731158,0.009639347,0.00065534754,0.00048318563,0.000361894,0.0002846283,0.4160577,0.017929597,0.13793609,0.004976311,0.40937898],"study_design_scores_gemma":[0.000022349432,0.00008722154,0.0016510059,0.000033680146,0.000034756962,0.00011886455,0.00001603391,0.97275317,0.00288229,0.02185251,0.0005175743,0.000030586038],"about_ca_topic_score_codex":0.0021287845,"about_ca_topic_score_gemma":0.0019413208,"teacher_disagreement_score":0.010703362,"about_ca_system_score_codex":0.0012685824,"about_ca_system_score_gemma":0.0012593097,"threshold_uncertainty_score":0.05660546},"labels":[],"label_agreement":null},{"id":"W2122624539","doi":"10.1007/978-3-642-00602-9_38","title":"The Sensitivity of Hybrid Systems Optimal Cost Functions with Respect to Switching Manifold Parameters","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"McGill University","funders":"","keywords":"Manifold (fluid mechanics); Sensitivity (control systems); Computer science; Optimal control; Mathematical optimization; Control theory (sociology); Set (abstract data type); Center manifold; Function (biology); State (computer science); Variation (astronomy); Topology (electrical circuits); Applied mathematics; Mathematics; Control (management); Algorithm; Artificial intelligence; Nonlinear system; Bifurcation","score_opus":0.008988712908217797,"score_gpt":0.20586205605711422,"score_spread":0.19687334314889643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122624539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19323657,0.001252321,0.7654041,0.0010455204,0.00018974612,0.00009053382,0.00027125588,0.00043588787,0.03807404],"genre_scores_gemma":[0.9800029,0.0006603915,0.013260525,0.000108816675,0.00006187866,0.000082316365,0.00012608469,0.00016205366,0.005535075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993025,0.00027895623,0.00003055622,0.00013357204,0.00018394449,0.00007039934],"domain_scores_gemma":[0.9925015,0.0063801203,0.0003670541,0.00030656852,0.00036778225,0.000077072305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020373974,0.0009310188,0.0010032128,0.0008700826,0.0003323393,0.0016623829,0.00076176086,0.0013688189,0.003868946],"category_scores_gemma":[0.01727448,0.0011588042,0.0010689324,0.0006428938,0.0018724292,0.00183271,0.001593982,0.0014914349,0.00025688077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011708947,0.00002865802,0.00041546518,0.00015341793,0.00006207844,0.0001223201,0.00013656873,0.93970263,0.0071494454,0.036182545,0.0006441838,0.015285626],"study_design_scores_gemma":[0.00000543183,0.0000418831,0.0011317186,0.000023636729,0.000018800343,0.00007921198,0.000028967645,0.96368223,0.0022567147,0.032357167,0.00034439814,0.000029952487],"about_ca_topic_score_codex":0.0016419408,"about_ca_topic_score_gemma":0.00063335535,"teacher_disagreement_score":0.003868946,"about_ca_system_score_codex":0.0010705247,"about_ca_system_score_gemma":0.0006142878,"threshold_uncertainty_score":0.01294291},"labels":[],"label_agreement":null},{"id":"W2122742496","doi":"10.1007/978-3-642-12261-3_10","title":"Report of the 14th International Workshop on Aspect-Oriented Modeling","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software engineering; Software; Engineering management; Systems engineering; Engineering; Programming language","score_opus":0.036482351946802695,"score_gpt":0.2934454916267024,"score_spread":0.2569631396798997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122742496","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041370705,0.028925704,0.6477374,0.039957833,0.039919984,0.0014471137,0.0046463353,0.0059531815,0.19004172],"genre_scores_gemma":[0.103475384,0.04711274,0.35546178,0.0048898826,0.010098347,0.0010033889,0.02809915,0.007702559,0.44215676],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950504,0.0013926874,0.00030443104,0.0005000829,0.0023254885,0.00042691018],"domain_scores_gemma":[0.99352527,0.0014594593,0.00019830094,0.0014092526,0.0027176263,0.00069013983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010668498,0.0017081293,0.0015660609,0.0017466281,0.0009360135,0.005851628,0.0020730412,0.001528238,0.028618604],"category_scores_gemma":[0.008337182,0.0009777518,0.002010566,0.002177276,0.00078750233,0.004969608,0.0024693685,0.004274761,0.009199086],"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.0008427199,0.0011442243,0.0023828563,0.00079109526,0.00015039556,0.0004920119,0.001115453,0.00738956,0.019003255,0.03232108,0.3859188,0.5484487],"study_design_scores_gemma":[0.00014473057,0.00035538737,0.002608152,0.00040687507,0.00022378375,0.00048310054,0.000366347,0.015201005,0.026264662,0.017100822,0.93677443,0.00007071865],"about_ca_topic_score_codex":0.005646313,"about_ca_topic_score_gemma":0.007294911,"teacher_disagreement_score":0.028618604,"about_ca_system_score_codex":0.0012892226,"about_ca_system_score_gemma":0.0033869157,"threshold_uncertainty_score":0.09573877},"labels":[],"label_agreement":null},{"id":"W2122840332","doi":"10.1007/3-540-36400-5_37","title":"Error Detection in Polynomial Basis Multipliers over Binary Extension Fields","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Finite field; Computer science; Polynomial basis; Finite field arithmetic; Multiplier (economics); Binary number; Normal basis; Arithmetic; Multiplication (music); Error detection and correction; Basis (linear algebra); Polynomial; Algorithm; Cryptography; Theoretical computer science; Galois theory; Mathematics; Discrete mathematics","score_opus":0.01494533657790721,"score_gpt":0.2364174286268894,"score_spread":0.2214720920489822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122840332","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.16793591,0.001559049,0.8143275,0.0014237679,0.00028143366,0.000105521365,0.00015950477,0.00081649027,0.013390823],"genre_scores_gemma":[0.8330745,0.0010455329,0.1493127,0.00025118858,0.00030574563,0.00010388641,0.0002068088,0.00009224089,0.0156073505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757856,0.0007124256,0.00012720536,0.00033936623,0.00087579637,0.00036651903],"domain_scores_gemma":[0.9915733,0.0057004797,0.00086414773,0.0008876811,0.0008113249,0.00016303668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028361508,0.00083569204,0.0010879185,0.0013113692,0.00089525816,0.0022121714,0.0010292958,0.0013964536,0.0022397905],"category_scores_gemma":[0.013946619,0.000640108,0.00036887947,0.0016999543,0.0012812976,0.0033134776,0.0022605688,0.0016270161,0.00060255424],"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.0017595289,0.0002101179,0.003641443,0.0004582548,0.00008919422,0.00048522718,0.0005422644,0.10222538,0.024837375,0.55313766,0.0073190196,0.3052945],"study_design_scores_gemma":[0.00011707471,0.00021111466,0.0005691627,0.00013035568,0.00003959376,0.0005458202,0.00008994905,0.51703775,0.024967628,0.4525035,0.003738184,0.000049845614],"about_ca_topic_score_codex":0.00044833974,"about_ca_topic_score_gemma":0.00046065205,"teacher_disagreement_score":0.0028361508,"about_ca_system_score_codex":0.0010504898,"about_ca_system_score_gemma":0.0010850235,"threshold_uncertainty_score":0.014999211},"labels":[],"label_agreement":null},{"id":"W2122859589","doi":"10.1007/11548706_73","title":"Behavioral Pattern Identification Through Rough Set Modelling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Identification (biology); Rough set; Set (abstract data type); Artificial intelligence; Pattern recognition (psychology); Programming language","score_opus":0.05712942653691443,"score_gpt":0.28686761830325685,"score_spread":0.22973819176634241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122859589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009697938,0.00007517647,0.9889021,0.000076352604,0.000009538238,0.000035659355,0.00006865658,0.00017725512,0.0009574479],"genre_scores_gemma":[0.47485515,0.00032520053,0.52203643,0.000051456675,0.000017759157,0.00020416184,0.00032831437,0.00006361642,0.0021179372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989446,0.00036471282,0.000078595054,0.00018646175,0.00035370086,0.00007203633],"domain_scores_gemma":[0.9973035,0.0016903678,0.00028845711,0.00035912625,0.00031322564,0.000045326542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014588375,0.00048692126,0.0010454477,0.001215143,0.00031470816,0.0015306947,0.0011332715,0.00061374356,0.0016212512],"category_scores_gemma":[0.0073301895,0.00041436788,0.0016976092,0.0011012706,0.00073385955,0.0020675992,0.00078687107,0.0009337545,0.00048820977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028002865,0.00016661978,0.0066595622,0.00045535874,0.00037653738,0.00041057338,0.00083711685,0.48261598,0.009921459,0.19644743,0.0023895002,0.2994398],"study_design_scores_gemma":[0.0000067602837,0.00003398884,0.0008735514,0.000019450752,0.000040618605,0.00008446017,0.000064213666,0.889594,0.0014576223,0.10707543,0.00072698307,0.000022840799],"about_ca_topic_score_codex":0.0018900478,"about_ca_topic_score_gemma":0.00167188,"teacher_disagreement_score":0.0018900478,"about_ca_system_score_codex":0.0006069014,"about_ca_system_score_gemma":0.00064916717,"threshold_uncertainty_score":0.0077151656},"labels":[],"label_agreement":null},{"id":"W2123006201","doi":"10.1007/11552413_116","title":"Relative Magnitude of Gaussian Curvature from Shading Images Using Neural Network","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Gaussian curvature; Artificial neural network; Curvature; Gaussian; Magnitude (astronomy); Artificial intelligence; Point (geometry); Mathematics; Sign (mathematics); Computer vision; Geometry; Computer science; Physics; Mathematical analysis; Astrophysics","score_opus":0.02085153606537435,"score_gpt":0.280954541261462,"score_spread":0.26010300519608764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123006201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08429242,0.00029930545,0.9093729,0.0002229055,0.000079961326,0.000066172026,0.0002319431,0.002922423,0.0025118634],"genre_scores_gemma":[0.6603111,0.0004142381,0.33462527,0.00008957664,0.000061688486,0.000047295725,0.00046821183,0.0003969244,0.0035856178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998492,0.00002087081,0.00000742884,0.00004291292,0.000059374546,0.00002021472],"domain_scores_gemma":[0.99961877,0.000099747595,0.00004121508,0.000054505854,0.00015741662,0.000028308536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042055716,0.0005996696,0.00049180974,0.0008382569,0.00018860098,0.0006888286,0.0005714921,0.00062883465,0.0020540915],"category_scores_gemma":[0.0014352751,0.00039606326,0.00052071153,0.0008394891,0.00025920323,0.00079583115,0.0006020278,0.00076558045,0.00063864427],"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.0004283864,0.00010149454,0.0027802852,0.00018821868,0.00007800723,0.000077467594,0.0001082126,0.19111575,0.097256385,0.0031473483,0.0027714511,0.70194703],"study_design_scores_gemma":[0.000006777879,0.000022148613,0.0019550857,0.000010014344,0.000010869866,0.000040217375,0.000009042599,0.9858585,0.010707006,0.000981864,0.00038530427,0.0000131486],"about_ca_topic_score_codex":0.0057480717,"about_ca_topic_score_gemma":0.0099085225,"teacher_disagreement_score":0.0057480717,"about_ca_system_score_codex":0.0006845819,"about_ca_system_score_gemma":0.00065348635,"threshold_uncertainty_score":0.011429191},"labels":[],"label_agreement":null},{"id":"W2123060712","doi":"10.1007/11424918_20","title":"Privacy Compliance Enforcement in Email","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"University of Guelph","keywords":"Computer science; Enforcement; Compliance (psychology); Computer security; Internet privacy; Information privacy; World Wide Web; Law; Political science","score_opus":0.04806259338967786,"score_gpt":0.3144971398352871,"score_spread":0.26643454644560927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123060712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07836593,0.0017473694,0.7680457,0.0076347766,0.00054274086,0.0003280473,0.0002662853,0.0044154855,0.13865362],"genre_scores_gemma":[0.8514186,0.00062921323,0.10379696,0.0012836,0.00030659878,0.00022870609,0.0003726936,0.00035879487,0.041604843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9874572,0.0062641194,0.00097297796,0.0011524413,0.0030341435,0.0011189979],"domain_scores_gemma":[0.97362775,0.015367264,0.0017340333,0.006851535,0.0020268306,0.00039265264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009212429,0.00047977857,0.0007889445,0.0015823676,0.0031745364,0.0060234964,0.0019123554,0.0038922245,0.008536651],"category_scores_gemma":[0.030736372,0.00063873775,0.00076571316,0.0017020223,0.0022817065,0.008648012,0.004295944,0.0035937084,0.0024065592],"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.00047043338,0.00042720648,0.0036511577,0.00021911864,0.000043118267,0.0007630693,0.002736742,0.013493048,0.0037416173,0.6251741,0.021610634,0.3276698],"study_design_scores_gemma":[0.00007854523,0.00016171028,0.002099234,0.00038443186,0.000106273714,0.0012316434,0.0014333646,0.17422259,0.02026084,0.7159658,0.083974406,0.00008100267],"about_ca_topic_score_codex":0.0011303374,"about_ca_topic_score_gemma":0.0008493253,"teacher_disagreement_score":0.009212429,"about_ca_system_score_codex":0.0014184357,"about_ca_system_score_gemma":0.0018947094,"threshold_uncertainty_score":0.0487206},"labels":[],"label_agreement":null},{"id":"W2123075577","doi":"10.1007/978-3-642-13059-5_33","title":"Using Classifier Performance Visualization to Improve Collective Ranking Techniques for Biomedical Abstracts Classification","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa; University of New Brunswick","funders":"","keywords":"Computer science; Classifier (UML); Cluster analysis; Workload; Machine learning; Artificial intelligence; Data mining; Visualization; Ranking (information retrieval)","score_opus":0.03871160874918192,"score_gpt":0.32331913398872597,"score_spread":0.284607525239544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123075577","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.08883728,0.0025009206,0.8344015,0.002095987,0.0010846091,0.00029909628,0.0033318824,0.06051079,0.0069379346],"genre_scores_gemma":[0.40091023,0.0006277398,0.5847431,0.00021328614,0.00056254055,0.00029318332,0.004248482,0.0029220271,0.005479389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966478,0.0008808819,0.0003708936,0.00041794888,0.0014639652,0.00021849232],"domain_scores_gemma":[0.9749552,0.011536337,0.0017290335,0.0025972938,0.008506925,0.0006752875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063660857,0.0019264945,0.001760929,0.007354068,0.0011033902,0.00473658,0.0014694849,0.0013697566,0.006163057],"category_scores_gemma":[0.025612619,0.0006096148,0.0011295845,0.0056364085,0.000320506,0.0038450947,0.0017882822,0.0024052272,0.0030485434],"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.00054149836,0.00029515507,0.008754197,0.00032514683,0.00023829803,0.00013026063,0.0005671846,0.017146785,0.01535942,0.003935739,0.04806835,0.90463793],"study_design_scores_gemma":[0.00014443665,0.0003631892,0.007964532,0.00014351397,0.0002905156,0.00029023646,0.0002825517,0.9176525,0.03229102,0.022624807,0.017793953,0.00015882518],"about_ca_topic_score_codex":0.0035657976,"about_ca_topic_score_gemma":0.0058827694,"teacher_disagreement_score":0.007354068,"about_ca_system_score_codex":0.00084718387,"about_ca_system_score_gemma":0.0011301839,"threshold_uncertainty_score":0.033667505},"labels":[],"label_agreement":null},{"id":"W2123092006","doi":"10.1007/978-3-540-78671-9_16","title":"A Comparison of Cartesian Genetic Programming and Linear Genetic Programming","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Verafin (Canada); Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Computer science; Directed acyclic graph; Graph; Linear programming; Implementation; Directed graph; Symbolic regression; Genetic algorithm; Theoretical computer science; Cartesian coordinate system; Benchmark (surveying); Algorithm; Artificial intelligence; Programming language; Mathematics; Machine learning","score_opus":0.021446460331969376,"score_gpt":0.2759214630943454,"score_spread":0.254475002762376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123092006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1287514,0.00877548,0.7724427,0.0014372076,0.00033447432,0.00010344628,0.00013437467,0.0012544367,0.08676645],"genre_scores_gemma":[0.5986072,0.003742554,0.38831142,0.00020112481,0.000107446765,0.00007785538,0.00019329316,0.00031214373,0.008446983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988017,0.0006149545,0.000029194185,0.0001021922,0.00038439332,0.000067678135],"domain_scores_gemma":[0.99661416,0.0025996629,0.00009941591,0.00023061519,0.0003974051,0.000058728434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017873793,0.00037444616,0.00066599646,0.0006505914,0.00030722274,0.0015606255,0.0008313943,0.0006721254,0.005190385],"category_scores_gemma":[0.007982411,0.00018476113,0.00026848924,0.0017475786,0.0010155921,0.0015063665,0.00095743395,0.00064227893,0.00042942964],"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.0005929642,0.00013218081,0.0023133887,0.000554656,0.0000778207,0.00006145731,0.00038850657,0.26590046,0.0018591873,0.32096,0.0037555287,0.40340376],"study_design_scores_gemma":[0.00008331431,0.00039004922,0.0018561444,0.00011967814,0.00007537345,0.00017301149,0.0002271159,0.8606319,0.0014324137,0.12353508,0.011449872,0.000026080854],"about_ca_topic_score_codex":0.004432431,"about_ca_topic_score_gemma":0.00427645,"teacher_disagreement_score":0.005190385,"about_ca_system_score_codex":0.0009882296,"about_ca_system_score_gemma":0.0013001547,"threshold_uncertainty_score":0.017363548},"labels":[],"label_agreement":null},{"id":"W2123225485","doi":"10.1007/978-3-540-73208-2_4","title":"Information Distance and Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Distance measures; Computer science; Artificial intelligence; Data mining","score_opus":0.014417032696940574,"score_gpt":0.24659524130601762,"score_spread":0.23217820860907704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123225485","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.020628441,0.17839298,0.41733736,0.008618598,0.003376342,0.00006948411,0.0008270169,0.0006008095,0.370149],"genre_scores_gemma":[0.58503824,0.108168595,0.13749832,0.0021495356,0.008123395,0.00024319769,0.0012049834,0.0004137544,0.15715997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.0001880103,0.000059708447,0.00023258789,0.0003835611,0.00006356731],"domain_scores_gemma":[0.99787486,0.0012299777,0.000120374236,0.0002994519,0.0003628524,0.000112571746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419164,0.0007682139,0.0012435539,0.003335691,0.0009213743,0.0028800333,0.001118485,0.0015247567,0.011729955],"category_scores_gemma":[0.005598737,0.0003304503,0.0005098828,0.0063255313,0.0022477305,0.0050195353,0.002400479,0.0024278944,0.003502901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152470175,0.000017564931,0.0002168453,0.00017610815,0.000011931691,0.000035634836,0.00007725696,0.0026418124,0.00022242485,0.8809537,0.011920115,0.103711344],"study_design_scores_gemma":[0.0000029395028,0.000013350449,0.00021996847,0.0000560344,0.000009212165,0.00017987563,0.00004275155,0.0086872205,0.0003416501,0.94612783,0.044309355,0.000009787258],"about_ca_topic_score_codex":0.00082617457,"about_ca_topic_score_gemma":0.00046693685,"teacher_disagreement_score":0.011729955,"about_ca_system_score_codex":0.001681775,"about_ca_system_score_gemma":0.00062428106,"threshold_uncertainty_score":0.0392406},"labels":[],"label_agreement":null},{"id":"W2123264045","doi":"10.1007/978-3-540-74198-5_5","title":"Simulating Classic Mosaics with Graph Cuts","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Western University","funders":"","keywords":"Tile; Heuristics; Computer science; Mosaic; Orientation (vector space); Enhanced Data Rates for GSM Evolution; Graph; Algorithm; Field (mathematics); Cut; Artificial intelligence; Computer vision; Mathematical optimization; Image (mathematics); Theoretical computer science; Mathematics; Image segmentation; Geometry","score_opus":0.027910713733555793,"score_gpt":0.29146595775485795,"score_spread":0.26355524402130215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123264045","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.19903746,0.00048019152,0.7733052,0.00045533394,0.00033003723,0.0001488475,0.0005303506,0.0024847456,0.023227792],"genre_scores_gemma":[0.75486696,0.00027660848,0.23613203,0.00013893808,0.00006983667,0.00009673695,0.0004854797,0.0007140545,0.00721932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974376,0.00006639137,0.00001059423,0.000046507383,0.000089705274,0.000043046643],"domain_scores_gemma":[0.9988456,0.0007272318,0.00006981209,0.00014323964,0.00011281233,0.00010136764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049523445,0.0007008594,0.0006963043,0.00077107974,0.0005551494,0.0010424615,0.0014660395,0.0016365609,0.0075884084],"category_scores_gemma":[0.0030693437,0.00091416197,0.00089924416,0.001098472,0.0010494251,0.0011352645,0.0012747773,0.0010612594,0.0004756602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009035427,0.00003167909,0.00039185834,0.000042955682,0.000030767682,0.000085433276,0.00008370307,0.977674,0.0015276504,0.012542338,0.0012957974,0.0062035983],"study_design_scores_gemma":[0.000017366589,0.000007138594,0.00004433496,0.000002985385,0.0000035085138,0.000018736297,0.000013064036,0.9945997,0.00037079403,0.0045529855,0.00036508247,0.0000041914113],"about_ca_topic_score_codex":0.0085603045,"about_ca_topic_score_gemma":0.008461971,"teacher_disagreement_score":0.0085603045,"about_ca_system_score_codex":0.0008843257,"about_ca_system_score_gemma":0.0006109006,"threshold_uncertainty_score":0.025385797},"labels":[],"label_agreement":null},{"id":"W2123269682","doi":"10.1007/978-3-540-78135-6_52","title":"Real-Word Spelling Correction with Trigrams: A Reconsideration of the Mays, Damerau, and Mercer Model","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":93,"is_retracted":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":"Trigram; Spelling; WordNet; Computer science; Artificial intelligence; Word (group theory); Natural language processing; Speech recognition; Mathematics; Linguistics","score_opus":0.018039904374920597,"score_gpt":0.24648636253333012,"score_spread":0.22844645815840953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123269682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016252166,0.0038461846,0.95333815,0.0061759804,0.0010972555,0.00008404909,0.0005048952,0.0028671445,0.01583423],"genre_scores_gemma":[0.49155632,0.005345786,0.47374094,0.0025819277,0.0016931688,0.0001216474,0.0008469917,0.0016845164,0.0224287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765956,0.00083693827,0.00018607508,0.00041431966,0.000790309,0.00011280579],"domain_scores_gemma":[0.988267,0.0063013965,0.00045330223,0.0030740178,0.0017145438,0.00018975834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042994227,0.000922337,0.0018644655,0.0021220471,0.0010147416,0.0036780927,0.005849073,0.001788192,0.0049971985],"category_scores_gemma":[0.02370256,0.00062848954,0.001192318,0.0024540317,0.0019571967,0.008832628,0.002056199,0.0032861196,0.003396007],"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.00040096522,0.00017202346,0.0037040792,0.0005143068,0.000247911,0.0005553033,0.0011651306,0.024106983,0.0046377573,0.30741858,0.023075668,0.6340013],"study_design_scores_gemma":[0.000059486407,0.00016170915,0.0017751395,0.00021399929,0.00016459188,0.0009932667,0.00035813788,0.46741256,0.007258431,0.50031096,0.021166215,0.00012563428],"about_ca_topic_score_codex":0.0055743903,"about_ca_topic_score_gemma":0.007847086,"teacher_disagreement_score":0.005849073,"about_ca_system_score_codex":0.00080268877,"about_ca_system_score_gemma":0.0021756059,"threshold_uncertainty_score":0.022737741},"labels":[],"label_agreement":null},{"id":"W2123284635","doi":"10.1007/978-3-642-24500-8_32","title":"ZenTrader, an Emotion-Reactive Interface","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bluetooth; Computer science; Dilemma; Human–computer interaction; Android (operating system); Phone; Wearable computer; Software; Consistency (knowledge bases); Embedded system; Artificial intelligence; Operating system","score_opus":0.050591882143520464,"score_gpt":0.3109056931906935,"score_spread":0.26031381104717305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123284635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008960681,0.0013038404,0.8799813,0.00028780312,0.00053009816,0.00021130072,0.0011765346,0.07720282,0.03034562],"genre_scores_gemma":[0.20862734,0.0022009723,0.57823396,0.0023989012,0.00030614718,0.0009856508,0.0048044506,0.014232294,0.18821025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971515,0.000048598868,0.000023340684,0.00007319751,0.00011676443,0.000022847187],"domain_scores_gemma":[0.9997882,0.00011684203,0.000011266607,0.00003034378,0.000032571425,0.000020740494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344062,0.0008900576,0.0006579922,0.0003858377,0.00026392916,0.0015063141,0.0016338333,0.0010761331,0.048887104],"category_scores_gemma":[0.0014796575,0.00042603078,0.00053387776,0.00027842622,0.00033370036,0.001574981,0.0013668259,0.0009502532,0.013793379],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002466452,0.00022682833,0.00073842,0.0013223601,0.0002243383,0.00047601835,0.00095503894,0.0051253815,0.18227074,0.027329799,0.12624499,0.65261966],"study_design_scores_gemma":[0.00087098597,0.00084507867,0.004064717,0.00033708612,0.00064643397,0.0027481948,0.0004802474,0.24705082,0.1776,0.06737955,0.4976367,0.00034022148],"about_ca_topic_score_codex":0.0004163776,"about_ca_topic_score_gemma":0.00078925875,"teacher_disagreement_score":0.048887104,"about_ca_system_score_codex":0.0002064398,"about_ca_system_score_gemma":0.00022699272,"threshold_uncertainty_score":0.16354364},"labels":[],"label_agreement":null},{"id":"W2123319826","doi":"10.1007/11569596_93","title":"Generalizing Redundancy Elimination in Checking Sequences","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Redundancy (engineering); Computer science; Prime (order theory); Set (abstract data type); Finite-state machine; Algorithm; Model checking; State (computer science); Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Programming language","score_opus":0.03110914949709723,"score_gpt":0.27836388576723836,"score_spread":0.24725473627014113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123319826","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.005324724,0.00034231358,0.9860504,0.00014249614,0.00010988139,0.000078566954,0.00006580411,0.0017000537,0.006185681],"genre_scores_gemma":[0.16358507,0.0008320858,0.8199379,0.000472167,0.00029727796,0.00022911883,0.0005062029,0.001483025,0.012657186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957081,0.0012150003,0.00033295358,0.0008888662,0.0015140432,0.00034100882],"domain_scores_gemma":[0.99023086,0.005300561,0.0002997321,0.0032246865,0.0008493649,0.000094860276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002976614,0.0018090137,0.001362219,0.0029666093,0.0009551498,0.0014086075,0.0033942228,0.0013883335,0.00684548],"category_scores_gemma":[0.012331267,0.0016126849,0.0029700284,0.002774837,0.0031277507,0.0066821133,0.0035919042,0.0037836472,0.0023229292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001987778,0.000102292324,0.000896622,0.00077356223,0.000094620285,0.0004913259,0.00072229735,0.040071018,0.009785899,0.5364479,0.007458762,0.402957],"study_design_scores_gemma":[0.00003756396,0.00009261046,0.00032212734,0.00020879567,0.00014664253,0.0005576871,0.00005298934,0.10737945,0.0136721525,0.856976,0.020502636,0.00005125935],"about_ca_topic_score_codex":0.002156997,"about_ca_topic_score_gemma":0.0024200687,"teacher_disagreement_score":0.00684548,"about_ca_system_score_codex":0.0010706179,"about_ca_system_score_gemma":0.0010783493,"threshold_uncertainty_score":0.022900403},"labels":[],"label_agreement":null},{"id":"W2123475790","doi":"10.1007/3-540-45417-9_54","title":"Evaluating the DIPORSI Framework: Distributed Processing of Remotely Sensed Imagery","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Computer science; Workbench; Workstation; Distributed computing; Software; Set (abstract data type); Distributed Computing Environment; Computer cluster; Real-time computing; Data mining; Visualization; Operating system","score_opus":0.04623052880494671,"score_gpt":0.3153723775476723,"score_spread":0.26914184874272556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123475790","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.24378684,0.0033465787,0.7030718,0.0010722561,0.00061998033,0.00053234183,0.002129615,0.029086506,0.016354188],"genre_scores_gemma":[0.4808395,0.00074461347,0.5080505,0.00020621301,0.00014892186,0.00016296856,0.0036919604,0.0014442498,0.004711075],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997835,0.00078665855,0.000088888686,0.00030954563,0.00083937333,0.00014060887],"domain_scores_gemma":[0.99683374,0.0016469895,0.00013064474,0.0006402631,0.00060308265,0.00014540405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004688825,0.0016814731,0.0014792716,0.0012183442,0.0007343391,0.0022532607,0.002905414,0.0013666761,0.004551302],"category_scores_gemma":[0.008580686,0.00058145425,0.00094402797,0.0014006877,0.00078104896,0.0024542978,0.0019451141,0.0011571004,0.0011642888],"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.0031488803,0.0006103795,0.004900196,0.0004033608,0.00062554044,0.00022407716,0.0001438101,0.44876423,0.011110843,0.010123733,0.026283598,0.49366143],"study_design_scores_gemma":[0.00019601545,0.00013771064,0.000785752,0.000013070033,0.00007019231,0.000040692285,0.000054974233,0.98736167,0.004948252,0.004501651,0.0018714238,0.00001856815],"about_ca_topic_score_codex":0.01794781,"about_ca_topic_score_gemma":0.021232182,"teacher_disagreement_score":0.01794781,"about_ca_system_score_codex":0.0013518017,"about_ca_system_score_gemma":0.0018948348,"threshold_uncertainty_score":0.03568673},"labels":[],"label_agreement":null},{"id":"W2123515711","doi":"10.1007/978-3-642-01818-3_10","title":"An Iterative Hybrid Filter-Wrapper Approach to Feature Selection for Document Clustering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Feature selection; Artificial intelligence; Cluster analysis; Maximization; Feature (linguistics); Filter (signal processing); Pattern recognition (psychology); Data mining; Greedy algorithm; Set (abstract data type); Selection (genetic algorithm); Machine learning; Algorithm; Mathematics; Mathematical optimization","score_opus":0.017006082730740172,"score_gpt":0.2600075452697171,"score_spread":0.24300146253897692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123515711","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.002260362,0.0001478726,0.99585176,0.00002771624,0.00002784675,0.000043146843,0.00006000781,0.001422638,0.00015877644],"genre_scores_gemma":[0.034099124,0.00013875842,0.96204126,0.00008653957,0.00007473301,0.00021544023,0.0006357776,0.00033467833,0.0023736868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974033,0.0006352381,0.00025045697,0.0005280191,0.0009389007,0.00024400526],"domain_scores_gemma":[0.99652207,0.0014452054,0.00013907327,0.0004695908,0.0013231094,0.000100889374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027417787,0.0016597568,0.0035398973,0.003186904,0.0013541585,0.0020042993,0.0042263325,0.0022249636,0.004189105],"category_scores_gemma":[0.0050069527,0.001051703,0.0026824817,0.0043211663,0.0007338798,0.0018688597,0.00181277,0.0015809647,0.0032268493],"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.00033650894,0.0002002197,0.0005105997,0.00015349883,0.00025837022,0.00008992126,0.00011720709,0.05120145,0.018786412,0.002011724,0.008037466,0.91829675],"study_design_scores_gemma":[0.0000452791,0.00010515485,0.0006529574,0.000012726935,0.000086561806,0.00013881235,0.000042189913,0.97995305,0.012239929,0.0038311805,0.0028502622,0.000041909243],"about_ca_topic_score_codex":0.012265312,"about_ca_topic_score_gemma":0.0139333205,"teacher_disagreement_score":0.012265312,"about_ca_system_score_codex":0.0009826808,"about_ca_system_score_gemma":0.001828633,"threshold_uncertainty_score":0.024387836},"labels":[],"label_agreement":null},{"id":"W2123532216","doi":"10.1007/11566465_2","title":"Bone Enhancement Filtering: Application to Sinus Bone Segmentation and Simulation of Pituitary Surgery","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"McGill University","funders":"","keywords":"Computer science; Segmentation; Measure (data warehouse); Sinus (botany); Bone structure; Computation; Artificial intelligence; Computer vision; Biomedical engineering; Medicine; Data mining; Algorithm","score_opus":0.014710865874149718,"score_gpt":0.29115812438604916,"score_spread":0.27644725851189944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123532216","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.2453374,0.0004920603,0.74450374,0.00035282766,0.00008195376,0.00017027756,0.00030137232,0.0027997596,0.0059606205],"genre_scores_gemma":[0.78252494,0.0004977639,0.21278259,0.000086001746,0.00002897853,0.00009539155,0.00014108772,0.00034239667,0.0035007459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999062,0.000024948373,0.000006380795,0.0000121753665,0.000036720343,0.00001348994],"domain_scores_gemma":[0.9993771,0.00048380453,0.000036389265,0.000024071387,0.00005394891,0.000024770401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005087124,0.00047278567,0.00051148504,0.00038854918,0.00029071604,0.0006400229,0.00052489794,0.0012497635,0.0025749712],"category_scores_gemma":[0.0016203746,0.0004130081,0.00046480773,0.00041242543,0.0002715344,0.0001889781,0.00034222804,0.00039237904,0.0002801057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047067684,0.00011645912,0.0023209685,0.00018005095,0.00004568998,0.00050737074,0.000252277,0.8589633,0.05712881,0.0023612455,0.00094371807,0.07670936],"study_design_scores_gemma":[0.000020643953,0.00005781337,0.0004840388,0.000006193316,0.00001195136,0.0001154909,0.000014735794,0.9884758,0.009910526,0.00030858433,0.00058807724,0.000006116441],"about_ca_topic_score_codex":0.008068881,"about_ca_topic_score_gemma":0.00657687,"teacher_disagreement_score":0.008068881,"about_ca_system_score_codex":0.00032760898,"about_ca_system_score_gemma":0.00072937127,"threshold_uncertainty_score":0.016043842},"labels":[],"label_agreement":null},{"id":"W2123567890","doi":"10.1007/978-3-540-69839-5_54","title":"Deriving and Mining Spatiotemporal Event Schemas in In-Situ Sensor Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Granularity; Computer science; Data mining; Construct (python library); Event (particle physics); Hierarchical database model; Tree (set theory); Tree structure; Axiom; Schema (genetic algorithms); Theoretical computer science; Algorithm; Binary tree; Information retrieval; Mathematics","score_opus":0.04023980359721857,"score_gpt":0.2652922379323274,"score_spread":0.22505243433510885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123567890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037740484,0.000672937,0.9543532,0.00023784119,0.00006269876,0.0002091444,0.0034008701,0.0021714936,0.0011513205],"genre_scores_gemma":[0.20455034,0.0016565298,0.7753571,0.00011577447,0.000049391307,0.00015309289,0.016806824,0.00029790576,0.0010130598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985397,0.00020633252,0.0002500188,0.00034467306,0.0005740529,0.00008523044],"domain_scores_gemma":[0.9960995,0.001777568,0.0004280786,0.00096419523,0.0006398064,0.00009086356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443689,0.0010449756,0.0010184,0.0032574122,0.00056366326,0.0029753072,0.00267479,0.0011020745,0.0010000155],"category_scores_gemma":[0.009112798,0.00098807,0.002296538,0.004798841,0.0007208442,0.0045828894,0.00198374,0.0011583962,0.0007924349],"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.00033765857,0.00056534825,0.04028316,0.0022695512,0.00079875893,0.0029871743,0.0029353192,0.1977681,0.041909654,0.062514454,0.010979192,0.6366517],"study_design_scores_gemma":[0.00004771316,0.00017893009,0.0072469693,0.0003292789,0.00058642175,0.002054354,0.0024657228,0.8080017,0.065306254,0.08268818,0.031003235,0.000091299866],"about_ca_topic_score_codex":0.0036101528,"about_ca_topic_score_gemma":0.006396974,"teacher_disagreement_score":0.0036101528,"about_ca_system_score_codex":0.0007141965,"about_ca_system_score_gemma":0.0014788278,"threshold_uncertainty_score":0.012923598},"labels":[],"label_agreement":null},{"id":"W2123752633","doi":"10.1007/978-3-540-30192-9_47","title":"Query Answering in Peer-to-Peer Data Exchange Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Peer-to-peer; Data exchange; Semantics (computer science); Information exchange; Information retrieval; Theoretical computer science; World Wide Web; Programming language","score_opus":0.050054585259528515,"score_gpt":0.2824427266735389,"score_spread":0.2323881414140104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123752633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037453346,0.0044918777,0.9457213,0.0022597653,0.000285798,0.00047285925,0.0002542197,0.0022718532,0.006789004],"genre_scores_gemma":[0.5491006,0.0036019336,0.4295698,0.00054823473,0.0005830335,0.0006533418,0.0015506772,0.0005652084,0.013827172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9905377,0.0037038666,0.0009127169,0.0012923623,0.0028108004,0.0007425681],"domain_scores_gemma":[0.98329043,0.012947863,0.0004230777,0.0015840847,0.0013578569,0.00039670346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010897834,0.0009319107,0.0038229015,0.0017626908,0.0041099642,0.0073382473,0.0053881826,0.0051845186,0.0038229942],"category_scores_gemma":[0.025683532,0.0015020423,0.00094545283,0.004403147,0.0028713155,0.013392258,0.0045060758,0.0029887483,0.0014538864],"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.0013075981,0.0006565564,0.0030900368,0.0014945215,0.00025806064,0.0015197152,0.004340016,0.22520378,0.010693014,0.3654148,0.030116137,0.3559058],"study_design_scores_gemma":[0.0001280057,0.00012762065,0.0004352711,0.000067263674,0.00011323332,0.00070175435,0.001258846,0.6127256,0.007756187,0.35697564,0.019626008,0.00008462598],"about_ca_topic_score_codex":0.006349851,"about_ca_topic_score_gemma":0.0043538455,"teacher_disagreement_score":0.010897834,"about_ca_system_score_codex":0.0020248785,"about_ca_system_score_gemma":0.0019024559,"threshold_uncertainty_score":0.057633936},"labels":[],"label_agreement":null},{"id":"W2123784540","doi":"10.1007/3-540-44683-4_11","title":"Refined Search Tree Technique for Dominating Set on Planar Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Planar graph; Dominating set; Combinatorics; Reduction (mathematics); Search tree; Computer science; Graph; Mathematics; Tree (set theory); Set (abstract data type); Discrete mathematics; Algorithm; Search algorithm; Vertex (graph theory)","score_opus":0.03720729722806748,"score_gpt":0.31655558615372115,"score_spread":0.27934828892565366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123784540","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.017724806,0.000900698,0.9743575,0.00021386966,0.000094611925,0.00013168779,0.00030312623,0.00059072766,0.0056829723],"genre_scores_gemma":[0.14651659,0.0014099502,0.8389411,0.00016626736,0.00014073378,0.00023802828,0.0010144155,0.0003773575,0.011195564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992167,0.00017534003,0.00004595946,0.00013881535,0.00035355182,0.00006965903],"domain_scores_gemma":[0.99852717,0.0007387519,0.00005667562,0.00039159958,0.00023402016,0.000051748975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106534,0.000636803,0.0013539348,0.0020194491,0.00062896323,0.0010048604,0.0022042738,0.0007579521,0.0054162005],"category_scores_gemma":[0.0033027236,0.0006248843,0.001328154,0.0029021725,0.0006752956,0.0029523408,0.0017488669,0.0020832017,0.0011644618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052447576,0.00023184804,0.0006398643,0.0012399101,0.00017772897,0.00025301514,0.0006812164,0.10239111,0.061450478,0.37519214,0.01846188,0.4387563],"study_design_scores_gemma":[0.0001547483,0.00030303595,0.00086523604,0.00011389649,0.00022533318,0.0006093763,0.00015434434,0.6169104,0.022703337,0.3267517,0.031142106,0.00006657127],"about_ca_topic_score_codex":0.0015300004,"about_ca_topic_score_gemma":0.0021850076,"teacher_disagreement_score":0.0054162005,"about_ca_system_score_codex":0.00081226835,"about_ca_system_score_gemma":0.00075240474,"threshold_uncertainty_score":0.018119037},"labels":[],"label_agreement":null},{"id":"W2123888963","doi":"10.1007/978-3-642-00582-4_8","title":"Spatiotemporal Saliency: Towards a Hierarchical Representation of Visual Saliency","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Representation (politics); Artificial intelligence; Coding (social sciences); Computation; Domain (mathematical analysis); Visualization; Neural coding; Hierarchical database model; Computer vision; Pattern recognition (psychology); Data mining; Algorithm","score_opus":0.02330903080035441,"score_gpt":0.3066207366192354,"score_spread":0.283311705818881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123888963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01776947,0.0009006576,0.97804135,0.00012533949,0.000050802617,0.00004043379,0.0002928302,0.00077067607,0.0020083573],"genre_scores_gemma":[0.48854634,0.0014944549,0.5037282,0.00013099649,0.00020368551,0.00013812626,0.0008049111,0.00045135038,0.004501972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986386,0.000019704712,0.000006191245,0.00005055459,0.000036653295,0.000022958033],"domain_scores_gemma":[0.9997718,0.00007130981,0.000036621932,0.000032756983,0.000059233316,0.000028285018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331545,0.0006087486,0.0007214707,0.0014146994,0.00029395882,0.001281037,0.0012050965,0.0006363525,0.0029989064],"category_scores_gemma":[0.0012550851,0.0004274122,0.00064619066,0.0014538227,0.00045770517,0.0015973435,0.0008684348,0.0006943333,0.0006865279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034702002,0.00008612601,0.0025273936,0.0005009881,0.00016637424,0.00020291055,0.0006707911,0.08306732,0.1393495,0.143233,0.016478138,0.61337036],"study_design_scores_gemma":[0.000025955063,0.00011176358,0.0040159603,0.000039822306,0.000079227684,0.00019983994,0.00009233022,0.84874016,0.01579061,0.12271894,0.008151284,0.000034100827],"about_ca_topic_score_codex":0.0041352697,"about_ca_topic_score_gemma":0.0042029023,"teacher_disagreement_score":0.0041352697,"about_ca_system_score_codex":0.00059409306,"about_ca_system_score_gemma":0.00041203757,"threshold_uncertainty_score":0.010032356},"labels":[],"label_agreement":null},{"id":"W2123893735","doi":"10.1007/978-3-642-39750-9_34","title":"MISSED – Studying Students’ Development of Misconceptions in Hybrid Courses","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Ontario Tech University","funders":"","keywords":"Mathematics education; Computer science; Psychology","score_opus":0.05534476816647035,"score_gpt":0.3424870936628058,"score_spread":0.28714232549633545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123893735","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.99515593,0.00021570707,0.0005367411,0.00045825823,0.00005656114,0.000020503167,0.000031258107,0.000031415904,0.0034935437],"genre_scores_gemma":[0.99174434,0.00017478476,0.0009019399,0.00031394867,0.000015821772,0.000036997182,0.00008959302,0.000024830517,0.0066976803],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99732757,0.0008585623,0.00014558737,0.00036661432,0.0009733268,0.00032822267],"domain_scores_gemma":[0.97048044,0.012555181,0.005953846,0.0016085005,0.0045233816,0.004878639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041081477,0.00038448098,0.0004192946,0.0011333547,0.0014269596,0.004919496,0.0015947015,0.0011735221,0.006206228],"category_scores_gemma":[0.04019382,0.00043235507,0.0005228636,0.0004887159,0.0011221204,0.00345419,0.0036473505,0.0032184247,0.0013820226],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068273593,0.0046524126,0.43007606,0.00033561132,0.00022020152,0.0016497688,0.3190375,0.00051383895,0.006494945,0.0027471273,0.007712015,0.22587775],"study_design_scores_gemma":[0.00009489263,0.0028467192,0.5736444,0.00096137135,0.0002718187,0.0047643534,0.34909475,0.003598153,0.008123512,0.008270832,0.04808081,0.0002483352],"about_ca_topic_score_codex":0.0020772002,"about_ca_topic_score_gemma":0.0039796834,"teacher_disagreement_score":0.006206228,"about_ca_system_score_codex":0.0015423108,"about_ca_system_score_gemma":0.0014522867,"threshold_uncertainty_score":0.021726191},"labels":[],"label_agreement":null},{"id":"W2124022325","doi":"10.1007/3-540-36415-3_23","title":"Detection of LSB Steganography via Sample Pair Analysis","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":133,"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":"Least significant bit; Steganography; Steganalysis; Computer science; Robustness (evolution); Embedding; Artificial intelligence; Sample (material); Pattern recognition (psychology); Algorithm","score_opus":0.013505195233384427,"score_gpt":0.22923035044164922,"score_spread":0.2157251552082648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124022325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30892724,0.00048814868,0.6840931,0.00015566907,0.00008868158,0.000093732095,0.00014572496,0.0019625386,0.0040450715],"genre_scores_gemma":[0.76429766,0.00031760428,0.23055348,0.00007258894,0.0000675323,0.00008254747,0.00018033088,0.00014752774,0.004280686],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995946,0.000094501804,0.000010872946,0.00006132021,0.00020734787,0.00003141682],"domain_scores_gemma":[0.99936324,0.00034590447,0.00008611983,0.00006770817,0.00011154912,0.00002555064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028310495,0.0006104224,0.0007372164,0.0011340291,0.00023746246,0.00055619463,0.0004331927,0.0005868434,0.0021947674],"category_scores_gemma":[0.0011691377,0.00035689425,0.00030015814,0.0006521204,0.0003486727,0.0007849023,0.0006021458,0.0004902846,0.0012268901],"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.0009205995,0.000109068606,0.0033152949,0.00015600608,0.000062497325,0.00025248207,0.00012737508,0.0053286264,0.6791188,0.002763647,0.00096804363,0.3068776],"study_design_scores_gemma":[0.000057040288,0.0008413242,0.010482324,0.000023137665,0.000087209875,0.00254567,0.000085587526,0.3845273,0.5942339,0.003271512,0.0037945332,0.000050471514],"about_ca_topic_score_codex":0.00013435312,"about_ca_topic_score_gemma":0.00024823812,"teacher_disagreement_score":0.0021947674,"about_ca_system_score_codex":0.00019400715,"about_ca_system_score_gemma":0.00017359346,"threshold_uncertainty_score":0.0073422194},"labels":[],"label_agreement":null},{"id":"W2124169059","doi":"10.1007/3-540-45491-8_137","title":"IMPACT: An Example of Information, Awareness, and Legislation, Leading toward a More Accessible Workplace","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","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":"Impact","funders":"","keywords":"Legislation; Champion; Government (linguistics); Service (business); Business; Information technology; Public relations; Knowledge management; Computer science; Marketing; Political science; Law","score_opus":0.05358427953963726,"score_gpt":0.3264031028442601,"score_spread":0.27281882330462287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124169059","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010589801,0.001563873,0.011213662,0.012592928,0.0006166743,0.00009203119,0.00010732603,0.00017507191,0.96304864],"genre_scores_gemma":[0.66827434,0.005451492,0.014639121,0.007270726,0.0005132843,0.00034907003,0.00038441786,0.00046823127,0.30264932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943709,0.0014876005,0.000098521254,0.00024513932,0.0028550897,0.0009427724],"domain_scores_gemma":[0.99593616,0.0021175137,0.00021013987,0.00031224304,0.00083364046,0.0005902746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031322783,0.00084157556,0.0004891878,0.004742561,0.009903588,0.014743705,0.0018361361,0.0043035275,0.028348504],"category_scores_gemma":[0.008771552,0.00036083642,0.0007975112,0.0064339275,0.010741499,0.007775145,0.010855532,0.005261037,0.0035757788],"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.00007610704,0.00019059896,0.001495346,0.00026159917,0.000011099979,0.0006773566,0.012850912,0.0006724528,0.00065444806,0.90151936,0.036776565,0.04481405],"study_design_scores_gemma":[0.00007355295,0.00013967311,0.00593718,0.00057968724,0.000086133936,0.0007174875,0.02343444,0.0012356315,0.0023503422,0.26204503,0.70333076,0.0000701342],"about_ca_topic_score_codex":0.013487151,"about_ca_topic_score_gemma":0.019433863,"teacher_disagreement_score":0.028348504,"about_ca_system_score_codex":0.0060054027,"about_ca_system_score_gemma":0.009449897,"threshold_uncertainty_score":0.09483522},"labels":[],"label_agreement":null},{"id":"W2124224842","doi":"10.1007/11531371_14","title":"WIT: A Framework for In-container Testing of Web-Portal Applications","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Calgary","funders":"","keywords":"Computer science; Container (type theory); Debugging; Code (set theory); Software engineering; Web application; Test case; Test strategy; White-box testing; Programming language; Operating system; Software; Software development; Software construction; Set (abstract data type)","score_opus":0.041856490224850655,"score_gpt":0.30455837631799854,"score_spread":0.2627018860931479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124224842","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.002483792,0.00009565497,0.92914695,0.00011554003,0.00006131828,0.00017054913,0.00034568837,0.06522616,0.002354386],"genre_scores_gemma":[0.13956586,0.00042174937,0.8238477,0.00037039726,0.00012645521,0.00064374786,0.0027832394,0.02138739,0.010853317],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955058,0.001316553,0.00048345735,0.000614611,0.0015868578,0.00049262046],"domain_scores_gemma":[0.9929173,0.0033376263,0.00050394604,0.0021765907,0.00076507084,0.0002994401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053484207,0.0026851774,0.0013269875,0.0023472244,0.000900783,0.0045431606,0.0065004774,0.0025505265,0.017609255],"category_scores_gemma":[0.012839622,0.0020504352,0.0028738629,0.0011584085,0.0020233672,0.008318382,0.0045323884,0.0034230032,0.0057084966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009628446,0.0008510885,0.009136809,0.0020866143,0.0006948886,0.0020009424,0.0013703809,0.14003015,0.027436614,0.18380064,0.081489116,0.5501399],"study_design_scores_gemma":[0.00016774067,0.00020613734,0.0011858562,0.00038601577,0.00024793754,0.00091268856,0.00025325225,0.7358541,0.04140106,0.14592278,0.0732783,0.00018418496],"about_ca_topic_score_codex":0.004155306,"about_ca_topic_score_gemma":0.0050790035,"teacher_disagreement_score":0.017609255,"about_ca_system_score_codex":0.0010150403,"about_ca_system_score_gemma":0.0021590968,"threshold_uncertainty_score":0.05890888},"labels":[],"label_agreement":null},{"id":"W2124258125","doi":"10.1007/978-3-540-68825-9_18","title":"A Reputation Model Framework for Artificial Societies: A Case Study in Child Vehicle Safety Simulation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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 Windsor","funders":"","keywords":"Reputation; Computer science; Intervention (counseling); Convergence (economics); Perspective (graphical); Outcome (game theory); Computer security; Knowledge management; Artificial intelligence; Psychology; Sociology","score_opus":0.02961855152779408,"score_gpt":0.31626639585737,"score_spread":0.2866478443295759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124258125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4210002,0.00085118384,0.51664674,0.004022194,0.00013697028,0.00028586067,0.00025322352,0.0004043175,0.05639928],"genre_scores_gemma":[0.9428768,0.0001786045,0.049396563,0.00006818178,0.000018896328,0.000099330755,0.000050593942,0.000053728203,0.0072572767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987583,0.0009108217,0.000035382698,0.00008982948,0.00011784789,0.000087775035],"domain_scores_gemma":[0.9954085,0.003485914,0.00016567345,0.0002850855,0.000400013,0.00025479682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002813121,0.000385423,0.00063778,0.00043579336,0.001361584,0.0023208195,0.0017527597,0.0025262511,0.0041852836],"category_scores_gemma":[0.007127979,0.0003067369,0.0006275462,0.00063506054,0.0012557774,0.0020949037,0.0014736833,0.0014645674,0.00037777098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013022413,0.00028151006,0.0027479478,0.00009504603,0.000047851347,0.00060606614,0.0014278902,0.7107306,0.0012444621,0.25615242,0.003274832,0.023261013],"study_design_scores_gemma":[0.000025546118,0.000074895775,0.00037989716,0.000012556859,0.00001721412,0.00007346054,0.00030160326,0.96126103,0.00023339166,0.034805357,0.0027963084,0.000018587005],"about_ca_topic_score_codex":0.013745494,"about_ca_topic_score_gemma":0.015042863,"teacher_disagreement_score":0.013745494,"about_ca_system_score_codex":0.0018804488,"about_ca_system_score_gemma":0.0013204381,"threshold_uncertainty_score":0.027330935},"labels":[],"label_agreement":null},{"id":"W2124269824","doi":"10.1007/11766247_37","title":"Machine Learning in a Quantum World","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":164,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Intuition; Computer science; Quantum; Artificial intelligence; Quantum machine learning; Quantum computer; Quantum mechanics; Cognitive science; Physics; Psychology","score_opus":0.010798071406027142,"score_gpt":0.22809096435578702,"score_spread":0.21729289294975987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124269824","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013808499,0.029994331,0.7246987,0.014978324,0.0020457758,0.00004576758,0.00019293015,0.0005247532,0.21371095],"genre_scores_gemma":[0.45901513,0.029975047,0.2999057,0.002707786,0.004212169,0.0002336185,0.00030470756,0.000490635,0.20315531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997516,0.00008260785,0.000010730764,0.000032672084,0.00010484951,0.0000174426],"domain_scores_gemma":[0.999509,0.0003271224,0.000016092396,0.00007240201,0.000054754775,0.000020598765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577267,0.00033116242,0.0005988046,0.0005603144,0.0005378459,0.0013782949,0.0005995527,0.0008770332,0.005374266],"category_scores_gemma":[0.0013532006,0.00029580138,0.0003017221,0.0008872996,0.002006689,0.0030624862,0.0008330211,0.0020779595,0.0014146899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059628896,0.0000112955,0.000044591146,0.000076395336,0.000008324722,0.00001237569,0.00004670327,0.0056978283,0.0005324343,0.94461614,0.008386263,0.040561616],"study_design_scores_gemma":[0.0000030836895,0.000006557698,0.00007063022,0.0000295078,0.0000036593328,0.00002629521,0.000012012572,0.029832097,0.00054214615,0.93581206,0.033654485,0.0000075075964],"about_ca_topic_score_codex":0.00040522518,"about_ca_topic_score_gemma":0.0005468089,"teacher_disagreement_score":0.005374266,"about_ca_system_score_codex":0.00070362806,"about_ca_system_score_gemma":0.00042027782,"threshold_uncertainty_score":0.017978668},"labels":[],"label_agreement":null},{"id":"W2124342026","doi":"10.1007/11925903_10","title":"DNA Codes and Their Properties","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Computational biology; Computer science; Genetics; Biology","score_opus":0.016149814994548994,"score_gpt":0.21396516235836513,"score_spread":0.19781534736381615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124342026","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.12888364,0.04371695,0.18365762,0.007875685,0.0025422,0.00013425793,0.0011954018,0.0005342309,0.63146],"genre_scores_gemma":[0.8529646,0.015284829,0.050758306,0.0014769618,0.003567575,0.00048002793,0.00080788595,0.00025150887,0.07440838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995981,0.000085224485,0.000020339152,0.00009658231,0.00015490434,0.000044884713],"domain_scores_gemma":[0.9989379,0.0005995353,0.00009104839,0.00015966297,0.00014563596,0.00006615319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047298134,0.00055234047,0.0006537483,0.0019719696,0.0014721896,0.0033129249,0.00055023155,0.0011177378,0.005630316],"category_scores_gemma":[0.0031433546,0.00033681036,0.0003363156,0.0020588073,0.0041058757,0.0031805872,0.0011375638,0.0019603393,0.0015488627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036394208,0.000003050048,0.000045546352,0.000016421505,0.0000010277251,0.000009541254,0.000054086908,0.00021810709,0.00013726631,0.9934048,0.0011790381,0.004927437],"study_design_scores_gemma":[0.000003060118,0.000005359469,0.000074117386,0.00001496605,0.0000019528354,0.00006467717,0.000025049008,0.0007522464,0.0002657014,0.98534817,0.01344064,0.000003887197],"about_ca_topic_score_codex":0.0005291099,"about_ca_topic_score_gemma":0.0003351165,"teacher_disagreement_score":0.005630316,"about_ca_system_score_codex":0.00086206215,"about_ca_system_score_gemma":0.0005812892,"threshold_uncertainty_score":0.018835306},"labels":[],"label_agreement":null},{"id":"W2124344355","doi":"10.1007/978-3-540-27817-7_160","title":"Creating Sign Language Web Pages","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hearing Impairment and Communication","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Computer science; Gesture; Hyperlink; Sign (mathematics); Sign language; Meaning (existential); Entertainment; World Wide Web; Human–computer interaction; Multimedia; Space (punctuation); Web page; Artificial intelligence; Linguistics","score_opus":0.028436719197998932,"score_gpt":0.30722417749188524,"score_spread":0.2787874582938863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124344355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024480676,0.0010022887,0.7130147,0.00057729817,0.0008375266,0.0005142334,0.0012631798,0.04233639,0.21597372],"genre_scores_gemma":[0.08284124,0.0018027818,0.4999907,0.00029328404,0.00013462924,0.00038211892,0.0058188187,0.0115978,0.39713866],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956554,0.00007261667,0.000029335448,0.000049525883,0.00023982214,0.000043156153],"domain_scores_gemma":[0.9991652,0.0003176981,0.00002354581,0.00021145203,0.00017700043,0.000105091545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007102387,0.0007617943,0.00042967492,0.0015221208,0.0008194026,0.003975214,0.0010649068,0.001233735,0.06181274],"category_scores_gemma":[0.0023724062,0.0005933803,0.0007799459,0.0010482545,0.00044661117,0.004628349,0.0028609475,0.0011205235,0.03184415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007436478,0.00019439003,0.00082383066,0.0005070087,0.000029949424,0.0009126396,0.0013013066,0.0016058912,0.03296291,0.037004188,0.10084029,0.8237433],"study_design_scores_gemma":[0.00003296807,0.00007789894,0.0010653125,0.0002915092,0.000055775865,0.0016806967,0.0009054448,0.012589158,0.052997153,0.027014837,0.9032164,0.0000729515],"about_ca_topic_score_codex":0.00059618044,"about_ca_topic_score_gemma":0.0016608948,"teacher_disagreement_score":0.06181274,"about_ca_system_score_codex":0.00028430726,"about_ca_system_score_gemma":0.00043589497,"threshold_uncertainty_score":0.20678425},"labels":[],"label_agreement":null},{"id":"W2124422284","doi":"10.1007/3-540-44886-1_45","title":"Explanation-Oriented Association Mining Using a Combination of Unsupervised and Supervised Learning Algorithms","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Association rule learning; Association (psychology); Machine learning; Artificial intelligence; Unsupervised learning; Focus (optics); Task (project management); Simple (philosophy); Supervised learning; Process (computing); Data mining; Artificial neural network","score_opus":0.01959039365315557,"score_gpt":0.24910181309963952,"score_spread":0.22951141944648396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124422284","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.005693422,0.00017952635,0.9920168,0.0001208463,0.000027607559,0.0001257382,0.00011975502,0.0009951392,0.00072114734],"genre_scores_gemma":[0.056584038,0.00018930492,0.94057286,0.00014698664,0.00008300683,0.00024350273,0.0008161755,0.00011574627,0.0012484931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968695,0.0009826088,0.0003834573,0.00071234984,0.0009383221,0.0001137692],"domain_scores_gemma":[0.99132043,0.005543087,0.00046270931,0.0011668532,0.0013435952,0.0001633507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038194892,0.0011876571,0.0020568685,0.0037643546,0.0010322025,0.002180461,0.0027543486,0.0012709305,0.0029060843],"category_scores_gemma":[0.009175702,0.0007524058,0.001994972,0.003868191,0.00077336683,0.0031378847,0.0021902067,0.0018216218,0.0013482396],"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.00022366368,0.00071450433,0.009645027,0.00043466265,0.0007082223,0.00023558953,0.00027834676,0.037096865,0.004933965,0.013479587,0.0077878754,0.9244616],"study_design_scores_gemma":[0.00008886002,0.00016084625,0.0025993283,0.000075118645,0.0003735706,0.00063009956,0.00010948121,0.9373665,0.005204046,0.048428707,0.00490075,0.00006264336],"about_ca_topic_score_codex":0.0014348507,"about_ca_topic_score_gemma":0.0039391005,"teacher_disagreement_score":0.0038194892,"about_ca_system_score_codex":0.00040677568,"about_ca_system_score_gemma":0.0017535099,"threshold_uncertainty_score":0.020199656},"labels":[],"label_agreement":null},{"id":"W2124425762","doi":"10.1007/978-3-540-73078-1_31","title":"Push-Poll Recommender System: Supporting Word of Mouth","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Saskatchewan","funders":"","keywords":"RSS; Recommender system; Word of mouth; Computer science; Collaborative filtering; Word (group theory); World Wide Web; Information retrieval; Artificial intelligence; Advertising","score_opus":0.035811943904601795,"score_gpt":0.28309608891956783,"score_spread":0.24728414501496604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124425762","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.066109024,0.0064825886,0.73498815,0.0023530754,0.0035988272,0.0018196794,0.009307118,0.11890641,0.056435116],"genre_scores_gemma":[0.34683365,0.0019488948,0.4965348,0.0014562373,0.0015348927,0.0007653342,0.010864456,0.0038570755,0.13620473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985436,0.00045698145,0.000092853545,0.00020010455,0.00060777855,0.00009866221],"domain_scores_gemma":[0.9957359,0.0017851529,0.00015713449,0.0007623472,0.0012142829,0.0003450814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023105424,0.0010106994,0.0020027806,0.0014893962,0.0011216193,0.0025988966,0.0020010057,0.0025510166,0.02389563],"category_scores_gemma":[0.008756647,0.0007394665,0.000557682,0.0013732447,0.0001985023,0.0029269753,0.0020612776,0.0012739538,0.025079291],"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.0028202927,0.0007812684,0.0025195545,0.00087422517,0.00032469622,0.00035603507,0.0003503829,0.0026472504,0.035542767,0.0069263563,0.25159702,0.69526017],"study_design_scores_gemma":[0.0012637962,0.0012153394,0.0042989035,0.00013898955,0.0006677584,0.0013159174,0.00039015285,0.59661865,0.08098573,0.017417643,0.29512835,0.0005587408],"about_ca_topic_score_codex":0.0021926882,"about_ca_topic_score_gemma":0.0042897942,"teacher_disagreement_score":0.02389563,"about_ca_system_score_codex":0.00029251905,"about_ca_system_score_gemma":0.0007559785,"threshold_uncertainty_score":0.07993883},"labels":[],"label_agreement":null},{"id":"W2124451406","doi":"10.1007/978-3-642-24500-8_41","title":"Tippy the Telepresence Robot","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Computer science; Interfacing; Robot; Remote control; Mobile robot; Wireless; Telerobotics; Software; Real-time computing; Computer hardware; Embedded system; Computer vision; Artificial intelligence; Telecommunications","score_opus":0.023702303500245693,"score_gpt":0.22007198094686548,"score_spread":0.1963696774466198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124451406","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.019457681,0.013936819,0.3508474,0.0020809998,0.0018390276,0.0001448832,0.0006423898,0.0062363017,0.6048145],"genre_scores_gemma":[0.087812506,0.0071360623,0.12235863,0.0006137333,0.000355299,0.00015168468,0.00070349977,0.00073172635,0.7801369],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994516,0.0000046402497,0.000001408679,0.00001160715,0.00003102504,0.000006149244],"domain_scores_gemma":[0.9999602,0.0000098010805,0.0000026639746,0.000007425769,0.000011257383,0.000008721643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006710754,0.00052252604,0.00030128084,0.00037155065,0.0004897455,0.0006390495,0.00053264847,0.00081864273,0.03353365],"category_scores_gemma":[0.00018242888,0.0002308177,0.00020493772,0.00036188352,0.0004206504,0.0010683775,0.0007148185,0.001071842,0.008334848],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010360225,0.00005036868,0.00018671202,0.00040140667,0.000011156842,0.00024973298,0.00025050272,0.005826791,0.032647934,0.069550395,0.09104227,0.799679],"study_design_scores_gemma":[0.000015472424,0.00015046091,0.00061326695,0.00011401065,0.000011024917,0.00086023443,0.00006618067,0.0145708695,0.014370053,0.013670544,0.95553184,0.000026113117],"about_ca_topic_score_codex":0.00054941006,"about_ca_topic_score_gemma":0.0007487508,"teacher_disagreement_score":0.03353365,"about_ca_system_score_codex":0.00023644084,"about_ca_system_score_gemma":0.00030026634,"threshold_uncertainty_score":0.112181306},"labels":[],"label_agreement":null},{"id":"W2124471971","doi":"10.1007/978-3-642-04271-3_71","title":"Multiple Sclerosis Lesion Segmentation Using an Automatic Multimodal Graph Cuts","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":57,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Graph; Cut; Image segmentation; Pattern recognition (psychology); Computer vision; Theoretical computer science","score_opus":0.048247356477776546,"score_gpt":0.31362364812890453,"score_spread":0.26537629165112797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124471971","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.025673226,0.00028062213,0.9704918,0.00023692945,0.000049777955,0.00014515135,0.00023558075,0.001509061,0.0013779039],"genre_scores_gemma":[0.12310922,0.00025380446,0.8740796,0.00009431909,0.0000644091,0.00012643938,0.0003427828,0.00040013273,0.001529279],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994702,0.0000980503,0.000030718136,0.00014936464,0.00019902308,0.000052765146],"domain_scores_gemma":[0.99948955,0.00016895401,0.00004907487,0.000082713246,0.00017479362,0.00003491974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006242343,0.00093370787,0.0008870689,0.0030203706,0.0006211811,0.0014464332,0.00089051935,0.0020037643,0.0035094968],"category_scores_gemma":[0.001563464,0.0008087577,0.0013661048,0.0016180644,0.00050435204,0.0010183355,0.001097353,0.0009693788,0.0009336531],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008274373,0.00020855153,0.0021320481,0.00045073626,0.00029584722,0.0006497873,0.00022130436,0.050963107,0.26301605,0.0054390924,0.0052568964,0.6705392],"study_design_scores_gemma":[0.00007252259,0.00027746795,0.00513806,0.00006661105,0.00027842168,0.0022711896,0.00014804276,0.887341,0.08748262,0.010375293,0.006468647,0.000080067075],"about_ca_topic_score_codex":0.0026367716,"about_ca_topic_score_gemma":0.0041819084,"teacher_disagreement_score":0.0035094968,"about_ca_system_score_codex":0.0005145393,"about_ca_system_score_gemma":0.0008729176,"threshold_uncertainty_score":0.011740446},"labels":[],"label_agreement":null},{"id":"W2124609709","doi":"10.1007/978-3-540-30232-2_9","title":"Towards Design Recovery from Observations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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 Ottawa","funders":"","keywords":"Realizability; Computer science; Graph; Set (abstract data type); Theoretical computer science; Algorithm; Programming language","score_opus":0.0556561337394983,"score_gpt":0.26140968793430663,"score_spread":0.20575355419480834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124609709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029438888,0.000098951714,0.9923316,0.00028300344,0.000037592807,0.000054546148,0.000075236865,0.0016019152,0.002573221],"genre_scores_gemma":[0.18832657,0.00061662117,0.7926787,0.000452119,0.000081858765,0.0003256893,0.0011337592,0.0012162202,0.015168507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967873,0.0009796609,0.00021358953,0.00058580574,0.0011905573,0.00024319663],"domain_scores_gemma":[0.99102193,0.0034761142,0.00043873378,0.0041633286,0.0008156896,0.000084306965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024409553,0.0015410372,0.0011201276,0.0012537177,0.0007708846,0.0019800419,0.0022886514,0.001544063,0.007821622],"category_scores_gemma":[0.018091701,0.0012762077,0.001878176,0.0007818051,0.002192708,0.003971853,0.0062158434,0.004745249,0.003646685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003930188,0.0002028292,0.001323868,0.00081411155,0.00015448792,0.0005226882,0.0012598876,0.093279414,0.016119646,0.23605154,0.013837181,0.6360412],"study_design_scores_gemma":[0.00006252448,0.000082334685,0.00035134976,0.00020042698,0.00008829719,0.0002406653,0.00035423716,0.39514613,0.019110894,0.55664456,0.027682958,0.000035626803],"about_ca_topic_score_codex":0.0010836073,"about_ca_topic_score_gemma":0.0013466573,"teacher_disagreement_score":0.007821622,"about_ca_system_score_codex":0.0007288727,"about_ca_system_score_gemma":0.0013605503,"threshold_uncertainty_score":0.026165903},"labels":[],"label_agreement":null},{"id":"W2124651213","doi":"10.1007/978-3-540-31856-9_50","title":"Quantum Interactive Proofs with Competing Provers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical proof; Disjoint sets; Quantum; Quantum computer; Quantum algorithm; TRACE (psycholinguistics); Gas meter prover; Quantum information","score_opus":0.008653341012039715,"score_gpt":0.22946625398409354,"score_spread":0.22081291297205383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124651213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035007354,0.0024223858,0.7977794,0.0032920246,0.0007577786,0.00017757666,0.000196872,0.000853883,0.15951274],"genre_scores_gemma":[0.710453,0.0015462933,0.22253314,0.00056884135,0.000589185,0.00041976263,0.00020604112,0.0004009561,0.063282795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932822,0.0029731372,0.00026597935,0.0005262084,0.0023641707,0.00058837974],"domain_scores_gemma":[0.9775288,0.018100595,0.0004147828,0.0023661293,0.0010161535,0.00057358877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005779496,0.0011183753,0.0015744278,0.001351644,0.0027425233,0.0049900035,0.0044307564,0.0039035287,0.021629557],"category_scores_gemma":[0.02383913,0.0015597445,0.0014881372,0.001972085,0.0047079837,0.008630312,0.0062744017,0.0051236027,0.0035060933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000529066,0.000019854077,0.000042327378,0.00006792578,0.000011201422,0.000046373112,0.00011505643,0.003112741,0.00047907274,0.9875409,0.0013481749,0.00716345],"study_design_scores_gemma":[0.000044401528,0.000017735178,0.00002677991,0.000026356178,0.000012503749,0.0000664098,0.000018172143,0.025764834,0.0011956922,0.9671614,0.0056471694,0.000018468667],"about_ca_topic_score_codex":0.0003393765,"about_ca_topic_score_gemma":0.00039191137,"teacher_disagreement_score":0.021629557,"about_ca_system_score_codex":0.002007453,"about_ca_system_score_gemma":0.0012240334,"threshold_uncertainty_score":0.07235801},"labels":[],"label_agreement":null},{"id":"W2124756729","doi":"10.1007/978-3-540-30482-1_12","title":"Formal Models for Web Navigations with Session Control and Browser Cache","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Session (web analytics); Web modeling; Web application security; World Wide Web; Web page; Web service; Web navigation; Web API; Static web page; Cache; Web development; Operating system","score_opus":0.018218756490812737,"score_gpt":0.249842034535426,"score_spread":0.23162327804461327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124756729","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.0108181685,0.0005928342,0.97096205,0.00090310554,0.00010138078,0.00010463597,0.000382535,0.0010167242,0.015118606],"genre_scores_gemma":[0.52661407,0.0014559586,0.44066486,0.00055304036,0.0002987346,0.00090009556,0.001349402,0.0008413803,0.02732231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977252,0.00078081485,0.00025197936,0.0003135578,0.0006142085,0.00031417495],"domain_scores_gemma":[0.9958406,0.0022961313,0.00035636,0.0007746886,0.00056875177,0.00016337444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022574156,0.0013481753,0.00078058685,0.0011492305,0.0013234522,0.0044560665,0.0027702278,0.0027239758,0.006514085],"category_scores_gemma":[0.006315905,0.0015246405,0.002149022,0.0012120168,0.0043659084,0.007157467,0.0016731931,0.004589544,0.0016891194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019459761,0.000042107265,0.00014483536,0.000058822035,0.000012166648,0.00007343966,0.00033811704,0.0239673,0.0005984583,0.96898973,0.0009779059,0.0047776597],"study_design_scores_gemma":[0.00003950228,0.00001941416,0.00008230078,0.00005765533,0.000032556778,0.00008450943,0.00009801601,0.10203111,0.00089921604,0.885279,0.011349592,0.000027156433],"about_ca_topic_score_codex":0.011841503,"about_ca_topic_score_gemma":0.011935845,"teacher_disagreement_score":0.011841503,"about_ca_system_score_codex":0.0033935437,"about_ca_system_score_gemma":0.002522966,"threshold_uncertainty_score":0.024622023},"labels":[],"label_agreement":null},{"id":"W2124959221","doi":"10.1007/978-3-642-10677-4_49","title":"Learning Gaussian Process Models from Uncertain Data","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Gaussian process; Process (computing); Artificial intelligence; Machine learning; Data mining; Gaussian; Programming language","score_opus":0.0355781656894634,"score_gpt":0.2738262277310314,"score_spread":0.23824806204156798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124959221","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.0014526504,0.00050268107,0.9972384,0.00012233201,0.000025134592,0.000007005331,0.000046450863,0.00015426007,0.00045108926],"genre_scores_gemma":[0.24061295,0.005602805,0.7427518,0.00035698776,0.00041752376,0.0002355153,0.0015074569,0.0003223733,0.008192677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990803,0.00028754235,0.00006395466,0.0002220826,0.00030322772,0.000042859072],"domain_scores_gemma":[0.99527055,0.003909574,0.0001841094,0.0003254511,0.00025755446,0.000052751446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002528742,0.0010680112,0.0018163658,0.0009622501,0.00031338749,0.0018889075,0.002334574,0.0021004635,0.002454634],"category_scores_gemma":[0.0135201365,0.0013677009,0.0015151679,0.0016952488,0.0012339266,0.004052954,0.0018044208,0.0029996461,0.001168591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007662855,0.000038486745,0.0005036312,0.0002610652,0.00011891813,0.000126502,0.0001319705,0.68935037,0.00095914403,0.11052461,0.0037162164,0.19419251],"study_design_scores_gemma":[0.0000060583825,0.000008976624,0.00007926062,0.000019226254,0.000015103686,0.000038980554,0.0000062956074,0.8885232,0.00035689058,0.10962811,0.0013039734,0.000013962327],"about_ca_topic_score_codex":0.0023956732,"about_ca_topic_score_gemma":0.0019392541,"teacher_disagreement_score":0.002528742,"about_ca_system_score_codex":0.00071162765,"about_ca_system_score_gemma":0.0006305048,"threshold_uncertainty_score":0.013373435},"labels":[],"label_agreement":null},{"id":"W2125046550","doi":"10.1007/11856290_12","title":"An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Computer science; Root (linguistics); Parametric statistics; Algorithm; Polynomial; Mathematics","score_opus":0.025102144402294066,"score_gpt":0.2632862951510971,"score_spread":0.238184150748803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125046550","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.033667024,0.00061776565,0.93826985,0.00057148014,0.00026412326,0.0003356025,0.0010597884,0.009933664,0.0152807],"genre_scores_gemma":[0.13830712,0.0002601971,0.8436271,0.00023244954,0.00014172273,0.00029163892,0.004394498,0.001040782,0.011704405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987349,0.00014186789,0.000086239466,0.00046983574,0.00039024442,0.00017688372],"domain_scores_gemma":[0.99782985,0.0007584948,0.00011907781,0.00071928813,0.0004205794,0.0001527015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108181,0.0016957105,0.0019493846,0.0022688112,0.0017140582,0.004122682,0.002840363,0.001970404,0.017601578],"category_scores_gemma":[0.004262578,0.00081327785,0.001630423,0.003037243,0.0011627537,0.005239664,0.0039709285,0.0028693215,0.008543882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056500454,0.00025269674,0.001539258,0.00038200125,0.00008306727,0.00010504514,0.00030311118,0.008950394,0.013873909,0.06367826,0.03490265,0.87536466],"study_design_scores_gemma":[0.00058870413,0.00056466,0.0030789215,0.00017512935,0.00030580608,0.0009692174,0.00073725526,0.34612104,0.03578379,0.5259822,0.08550974,0.00018351595],"about_ca_topic_score_codex":0.0020910306,"about_ca_topic_score_gemma":0.0039900835,"teacher_disagreement_score":0.017601578,"about_ca_system_score_codex":0.0018923924,"about_ca_system_score_gemma":0.0024522848,"threshold_uncertainty_score":0.05888313},"labels":[],"label_agreement":null},{"id":"W2125139512","doi":"10.1007/978-3-642-10871-6_16","title":"Reasoning about Partially Ordered Web Service Activities in PSL","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Toronto","funders":"","keywords":"Computer science; Ontology; Description logic; Web service; Semantic Web; Service (business); Process (computing); Programming language; World Wide Web; Artificial intelligence; Theoretical computer science; Natural language processing","score_opus":0.010529019621548992,"score_gpt":0.23342644220021597,"score_spread":0.222897422578667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125139512","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.07661213,0.00034574233,0.90152305,0.0014074539,0.00009818113,0.0003502628,0.0018608005,0.0058193654,0.011983044],"genre_scores_gemma":[0.5762657,0.00056396535,0.41161105,0.00041890264,0.00012256941,0.00022767327,0.0041845804,0.0005824796,0.006023167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953649,0.0012817696,0.00053109234,0.00058128394,0.0017448532,0.000496049],"domain_scores_gemma":[0.98758173,0.0098111555,0.0005999956,0.00090359076,0.0008401731,0.0002633616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034436844,0.0014124095,0.0009738749,0.0029936386,0.0012261373,0.004957889,0.0023383908,0.0018394032,0.0056215264],"category_scores_gemma":[0.015589325,0.0015653558,0.003125245,0.002276256,0.0027349605,0.012858051,0.0036001666,0.0029987039,0.0010536314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007320049,0.00048768477,0.0098317,0.0012822812,0.00037343052,0.004689375,0.0037105277,0.29190072,0.009528897,0.5046583,0.009270491,0.16353464],"study_design_scores_gemma":[0.00012072036,0.000058786954,0.00049031596,0.00016589192,0.00018800778,0.0004160779,0.00097264757,0.5892527,0.012811784,0.38369054,0.01177819,0.00005436013],"about_ca_topic_score_codex":0.017800003,"about_ca_topic_score_gemma":0.021311712,"teacher_disagreement_score":0.017800003,"about_ca_system_score_codex":0.0028182783,"about_ca_system_score_gemma":0.0020597118,"threshold_uncertainty_score":0.03539282},"labels":[],"label_agreement":null},{"id":"W2125264722","doi":"10.1007/978-3-540-87353-2_1","title":"SOON: A Scalable Self-organized Overlay Network for Distributed Information Retrieval","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Overlay network; Scalability; Overlay; Distributed computing; Information retrieval; Computer network; World Wide Web; Database; Operating system; The Internet","score_opus":0.010437612924810864,"score_gpt":0.2180584741621273,"score_spread":0.20762086123731646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125264722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030982776,0.0032395045,0.9303191,0.0007959234,0.0005504807,0.0004547209,0.0010157401,0.022608384,0.010033436],"genre_scores_gemma":[0.27285433,0.003104626,0.68901485,0.00043431853,0.0003678025,0.00049245014,0.0037776215,0.0009186591,0.029035252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.000076935336,0.0000268013,0.00003883415,0.00018310579,0.00003431271],"domain_scores_gemma":[0.99931216,0.00019355972,0.000041704938,0.00020344148,0.00014864704,0.00010044476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097080716,0.00036155543,0.0010568253,0.0012258049,0.00074517843,0.0011161258,0.0013223548,0.00061552646,0.0048673158],"category_scores_gemma":[0.0020324374,0.00037232577,0.00028430644,0.0015457525,0.00026062116,0.0027453601,0.0019444645,0.0007974705,0.0017703064],"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.0007489029,0.00034064133,0.001034962,0.0005596235,0.00015030608,0.00040127328,0.00033338086,0.03256343,0.04705755,0.022028409,0.09017723,0.80460435],"study_design_scores_gemma":[0.0004725742,0.00061728124,0.0019494052,0.00007443976,0.00021182891,0.0007871405,0.0002619138,0.7379613,0.030382497,0.06649683,0.16064839,0.00013643081],"about_ca_topic_score_codex":0.0016930954,"about_ca_topic_score_gemma":0.004375682,"teacher_disagreement_score":0.0048673158,"about_ca_system_score_codex":0.00044274025,"about_ca_system_score_gemma":0.00089832826,"threshold_uncertainty_score":0.016282797},"labels":[],"label_agreement":null},{"id":"W2125291716","doi":"10.1007/978-3-642-02172-5_1","title":"Inference and Learning for Active Sensing, Experimental Design and Control","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Optimal control; Nonlinear system; Machine learning; Gaussian; Range (aeronautics); Active learning (machine learning); Control (management); Actuator; Mathematical optimization; Engineering; Mathematics","score_opus":0.014819154625114316,"score_gpt":0.2671591383307689,"score_spread":0.2523399837056546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125291716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030459868,0.00033457702,0.9987889,0.000084267005,0.000022838301,0.000015965337,0.000021642796,0.00010116296,0.0003260374],"genre_scores_gemma":[0.10690555,0.001370839,0.8842417,0.0002606394,0.00031621393,0.0006952737,0.00024968083,0.00015727122,0.0058028484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668545,0.001741498,0.0002568401,0.00063442346,0.00057037926,0.00011138716],"domain_scores_gemma":[0.98252386,0.014531267,0.0005839189,0.0015168831,0.0007096147,0.00013441526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008280795,0.0017874782,0.0027706283,0.0011401632,0.000757665,0.0026094103,0.003906265,0.0030492612,0.0053487075],"category_scores_gemma":[0.023792112,0.0017248105,0.0019304327,0.0012330103,0.003729569,0.0039759236,0.0024179213,0.0035180538,0.00113119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016962207,0.00015570637,0.0004947961,0.00087269384,0.00021134294,0.000074345604,0.00021447425,0.25089425,0.0020770892,0.5241015,0.003987254,0.21674699],"study_design_scores_gemma":[0.000021130962,0.00003101001,0.000094103525,0.000027375558,0.000025288304,0.000027533937,0.000011299904,0.6990688,0.00079737644,0.29776824,0.0021144229,0.0000134074435],"about_ca_topic_score_codex":0.0028466037,"about_ca_topic_score_gemma":0.0029586342,"teacher_disagreement_score":0.008280795,"about_ca_system_score_codex":0.0017837196,"about_ca_system_score_gemma":0.0017725307,"threshold_uncertainty_score":0.04379356},"labels":[],"label_agreement":null},{"id":"W2125343508","doi":"10.1007/978-3-642-23716-4_22","title":"A Fast Algorithm to Locate Concepts in Execution Traces","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Dynamic programming; TRACE (psycholinguistics); Genetic programming; Algorithm; Identification (biology); Genetic algorithm; Segmentation; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.02557422175582425,"score_gpt":0.2716429627880335,"score_spread":0.24606874103220927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125343508","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.0041139806,0.0002062934,0.9849508,0.000074553165,0.000061084924,0.00018322849,0.00044422157,0.008849259,0.0011166355],"genre_scores_gemma":[0.017957604,0.00012959709,0.97760314,0.000036865382,0.00002079782,0.00017200783,0.0009847186,0.0005049843,0.0025901848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985405,0.00013025607,0.00015501428,0.0003850351,0.0006376172,0.0001515832],"domain_scores_gemma":[0.99604034,0.0017157173,0.00024256935,0.00076382124,0.0010862127,0.00015136336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010283926,0.0025293808,0.0014851856,0.0061015915,0.001709963,0.0029117255,0.0029770234,0.0021131109,0.013326834],"category_scores_gemma":[0.0066440515,0.0012282565,0.0018817686,0.0056073745,0.0011806694,0.0055581657,0.0037811624,0.0024407313,0.0069838334],"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.0004312409,0.00017363578,0.0010019735,0.00050376914,0.00008087197,0.00017036246,0.00027570085,0.012385171,0.025749896,0.032082118,0.015232778,0.91191256],"study_design_scores_gemma":[0.0003258117,0.00039720294,0.0012924786,0.0002573469,0.00021615908,0.0010423827,0.00049883476,0.6881991,0.087605365,0.15942068,0.060586575,0.00015805068],"about_ca_topic_score_codex":0.0045826305,"about_ca_topic_score_gemma":0.0062910016,"teacher_disagreement_score":0.013326834,"about_ca_system_score_codex":0.0012927381,"about_ca_system_score_gemma":0.0030955032,"threshold_uncertainty_score":0.044582665},"labels":[],"label_agreement":null},{"id":"W2125496637","doi":"10.1007/978-3-540-88693-8_4","title":"Light-Efficient Photography","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Aperture (computer memory); Photography; Computational photography; Sequence (biology); Focus (optics); Computer science; Multiple exposure; Depth of field; Point (geometry); Light field; Optics; Computer vision; Shot (pellet); Computer graphics (images); Field (mathematics); Artificial intelligence; Mathematics; Image (mathematics); Physics; Image processing; Geometry; Materials science; Art","score_opus":0.010675426768652754,"score_gpt":0.2240307061827771,"score_spread":0.21335527941412435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125496637","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018843707,0.044863664,0.35642,0.0011193361,0.0013677487,0.00015621685,0.00052448915,0.0026131875,0.5740916],"genre_scores_gemma":[0.18460998,0.04683756,0.17480338,0.00056978327,0.00063791283,0.00011433068,0.0007407021,0.00082108116,0.5908652],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983525,0.000008230771,0.000003946215,0.000029302957,0.00010290716,0.00002038686],"domain_scores_gemma":[0.9999025,0.000023895343,0.0000083209525,0.000027735638,0.000029747991,0.0000077458535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012194402,0.0005995964,0.00041574796,0.00089187984,0.0004058333,0.001124065,0.00086196855,0.0005056664,0.031627696],"category_scores_gemma":[0.0001792873,0.00045098722,0.0003012981,0.0008134177,0.0005186956,0.0013454977,0.00093148375,0.0009778673,0.010056987],"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.00010845991,0.00006786866,0.00023805487,0.0010472331,0.000028668474,0.00017728836,0.00017269923,0.0020637442,0.33708274,0.11485282,0.05710394,0.48705655],"study_design_scores_gemma":[0.000017136157,0.000082229635,0.0013074926,0.00020940439,0.000036877427,0.0011436401,0.000084859385,0.0067326995,0.2839783,0.02145757,0.6849074,0.000042422427],"about_ca_topic_score_codex":0.00035210076,"about_ca_topic_score_gemma":0.0010588771,"teacher_disagreement_score":0.031627696,"about_ca_system_score_codex":0.0005228412,"about_ca_system_score_gemma":0.00024894136,"threshold_uncertainty_score":0.10580516},"labels":[],"label_agreement":null},{"id":"W2125600874","doi":"10.1007/11908029_18","title":"Association Reducts: Complexity and Heuristics","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Heuristics; Computer science; Heuristic; Association rule learning; Association (psychology); Data mining; Artificial intelligence; Machine learning","score_opus":0.023905642916551464,"score_gpt":0.2380908619574802,"score_spread":0.21418521904092874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125600874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03736714,0.015709745,0.91078347,0.00471198,0.00045471662,0.0002675808,0.0007023639,0.00075448316,0.029248577],"genre_scores_gemma":[0.24132437,0.010585149,0.73298544,0.00046726275,0.00092271966,0.00032042392,0.0013360868,0.00037627487,0.011682265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996381,0.0014624236,0.00028783816,0.00059223163,0.0010618933,0.0002147428],"domain_scores_gemma":[0.9736458,0.022585092,0.0005086273,0.0022128248,0.000802378,0.000245333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00473001,0.0011178012,0.0031534682,0.003498029,0.0016720704,0.0076768696,0.0029382175,0.0023253772,0.007508513],"category_scores_gemma":[0.02695711,0.0017369617,0.003092337,0.0052801194,0.0037590638,0.011525466,0.0027994397,0.004897484,0.0011491056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018151973,0.00015072802,0.0011032221,0.0007183231,0.00017391278,0.00014711136,0.0005640909,0.08453758,0.00043685906,0.6762514,0.019923782,0.21581145],"study_design_scores_gemma":[0.000029550274,0.000014195248,0.00014914812,0.00007740028,0.000046580037,0.00015978354,0.00010504515,0.0707928,0.00033999688,0.9229537,0.0053139087,0.000017912656],"about_ca_topic_score_codex":0.0022150099,"about_ca_topic_score_gemma":0.0029525233,"teacher_disagreement_score":0.0076768696,"about_ca_system_score_codex":0.002265074,"about_ca_system_score_gemma":0.0020148272,"threshold_uncertainty_score":0.02511847},"labels":[],"label_agreement":null},{"id":"W2125722086","doi":"10.1007/978-3-540-78671-9_23","title":"GP Classification under Imbalanced Data sets: Active Sub-sampling and AUC Approximation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Computer science; Artificial intelligence; Machine learning; Statistic; Classifier (UML); Binary classification; Estimator; Naive Bayes classifier; Boosting (machine learning); Support vector machine; Mathematics; Statistics","score_opus":0.07612656226787208,"score_gpt":0.30491862664142827,"score_spread":0.2287920643735562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125722086","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.027178513,0.0018568767,0.96746576,0.0010588563,0.00014431315,0.00008980558,0.00010369813,0.0005290524,0.0015732612],"genre_scores_gemma":[0.5649504,0.0015283735,0.42513815,0.0009846103,0.0008950029,0.0004805085,0.0011126887,0.000441394,0.00446881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971174,0.0014756302,0.00014153807,0.00040398215,0.0006513546,0.00021007353],"domain_scores_gemma":[0.98186505,0.0143731,0.00046235358,0.0014540169,0.0014905094,0.00035509092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011042611,0.0014063945,0.0038865528,0.0026403945,0.00089804584,0.0023857686,0.004243434,0.0035199912,0.0014944203],"category_scores_gemma":[0.037718266,0.00092545635,0.001683651,0.0029482702,0.0021447674,0.004376037,0.003452357,0.0047075166,0.00044300893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005337803,0.00028722774,0.0054323245,0.0003053569,0.00021744864,0.00019344046,0.00038502194,0.5801538,0.0013308205,0.046697143,0.012166146,0.35229748],"study_design_scores_gemma":[0.000009350261,0.000014480339,0.00011484999,0.0000103551665,0.000008888484,0.000018989915,0.00000984162,0.98848593,0.000115521165,0.010970316,0.00023893507,0.000002471293],"about_ca_topic_score_codex":0.004954002,"about_ca_topic_score_gemma":0.0032735674,"teacher_disagreement_score":0.011042611,"about_ca_system_score_codex":0.0017061156,"about_ca_system_score_gemma":0.0013199672,"threshold_uncertainty_score":0.058399618},"labels":[],"label_agreement":null},{"id":"W2126044817","doi":"10.1007/11505877_3","title":"Locally Consistent Parsing and Applications to Approximate String Comparisons","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Simon Fraser University","funders":"","keywords":"Parsing; Computer science; String (physics); Partition (number theory); Context (archaeology); Consistency (knowledge bases); Algorithm; Block (permutation group theory); Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.02532809756415999,"score_gpt":0.26341016933158784,"score_spread":0.23808207176742785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126044817","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.0024843598,0.00091762823,0.9912646,0.00017831344,0.00011306837,0.000047506037,0.000096606964,0.002264873,0.0026330096],"genre_scores_gemma":[0.065338165,0.0009996775,0.9242793,0.00027493798,0.0003185983,0.00024630615,0.0005447506,0.0017392877,0.0062590507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946503,0.0018700047,0.00042316853,0.00087728567,0.0019432283,0.00023596965],"domain_scores_gemma":[0.9850691,0.008608262,0.000570215,0.0041655623,0.0014281496,0.00015868539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038286918,0.0014627255,0.0035236164,0.003763375,0.0020251223,0.0040832483,0.004642787,0.003040469,0.013481048],"category_scores_gemma":[0.027611295,0.0018855525,0.0016091657,0.012431709,0.0030878787,0.008049913,0.0040068873,0.004373628,0.0042655296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002575637,0.0001262368,0.0005001836,0.00035677507,0.00006238825,0.00022136662,0.0003586428,0.04630626,0.0063156425,0.3481698,0.015723854,0.5816013],"study_design_scores_gemma":[0.000046218564,0.000066950306,0.0002595949,0.000083851904,0.000067797664,0.0003668807,0.00011675239,0.3058954,0.009734392,0.66372067,0.019566752,0.000074783406],"about_ca_topic_score_codex":0.0021161947,"about_ca_topic_score_gemma":0.00306374,"teacher_disagreement_score":0.013481048,"about_ca_system_score_codex":0.0015799241,"about_ca_system_score_gemma":0.0018554307,"threshold_uncertainty_score":0.045098603},"labels":[],"label_agreement":null},{"id":"W2126182348","doi":"10.1007/978-3-319-09284-3_2","title":"Cores in Core Based MaxSat Algorithms: An Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Cardinality (data modeling); Core (optical fiber); Algorithm; Computer science; Characterization (materials science); Satisfiability; Construct (python library); Theoretical computer science; Boolean function; Data mining","score_opus":0.019886095028331236,"score_gpt":0.25706543432108314,"score_spread":0.2371793392927519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126182348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27395448,0.007128766,0.618539,0.0027545332,0.00036927368,0.0005198806,0.0006597817,0.0011380257,0.09493633],"genre_scores_gemma":[0.86413074,0.002779202,0.11313808,0.00082454854,0.0004911079,0.0004561535,0.0006124019,0.0007256138,0.0168422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720925,0.000933321,0.00010068146,0.0002827524,0.0008934386,0.000580463],"domain_scores_gemma":[0.9780638,0.018376626,0.0007578561,0.0010889908,0.0011895023,0.0005231881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004377573,0.0013855386,0.0014477645,0.0015337301,0.0011418093,0.0037316491,0.0034593577,0.0014710804,0.010669077],"category_scores_gemma":[0.021590328,0.00121788,0.0013280564,0.002359554,0.0021345294,0.006640827,0.002840783,0.0031057305,0.0007723645],"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.001218546,0.00044369773,0.005205055,0.0007825478,0.000103659506,0.0001472852,0.00046008042,0.23137298,0.0037834013,0.6151472,0.0146407485,0.12669481],"study_design_scores_gemma":[0.00005402829,0.00021546717,0.0011778921,0.00012503949,0.0000758165,0.00016683931,0.00017822356,0.72690266,0.0013236591,0.26669163,0.0030674408,0.000021296937],"about_ca_topic_score_codex":0.0013457867,"about_ca_topic_score_gemma":0.0030914298,"teacher_disagreement_score":0.010669077,"about_ca_system_score_codex":0.0027657396,"about_ca_system_score_gemma":0.0023948106,"threshold_uncertainty_score":0.03569162},"labels":[],"label_agreement":null},{"id":"W2126358107","doi":"10.1007/978-3-642-04241-6_32","title":"A Unifying View on Approximation and FPT of Agreement Forests","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":60,"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":"Bisection; Tree (set theory); Time complexity; Combinatorics; Computer science; Physics; Mathematics; Geometry","score_opus":0.021241457129045623,"score_gpt":0.25593671734083606,"score_spread":0.23469526021179044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126358107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012909365,0.003627549,0.9347997,0.00567796,0.00091883214,0.00007369036,0.00044123418,0.0005387214,0.04101303],"genre_scores_gemma":[0.44777963,0.009044221,0.47574678,0.0036996885,0.007249485,0.00046143946,0.0015642939,0.0014062382,0.05304832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569017,0.0009577717,0.00028257325,0.0009141266,0.0016292199,0.000526115],"domain_scores_gemma":[0.989588,0.0066933488,0.0002973344,0.0023886955,0.00065133284,0.00038140858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041006496,0.001495416,0.0031774926,0.0029394708,0.0025149765,0.006987617,0.0058489954,0.0031655112,0.011847403],"category_scores_gemma":[0.013733812,0.0012637832,0.003221495,0.006598027,0.0071642506,0.029442023,0.006553161,0.013386425,0.0020736656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035904173,0.000018274473,0.00009019011,0.00006173426,0.0000080191685,0.000032454165,0.00010134373,0.002965502,0.00021430764,0.97714466,0.002436507,0.016891014],"study_design_scores_gemma":[0.000007942271,0.000007957935,0.000034032193,0.000014291548,0.000010321922,0.00005067456,0.000019679499,0.009455569,0.00016787376,0.9867003,0.0035248103,0.00000655896],"about_ca_topic_score_codex":0.00300778,"about_ca_topic_score_gemma":0.002189496,"teacher_disagreement_score":0.011847403,"about_ca_system_score_codex":0.0035327175,"about_ca_system_score_gemma":0.0017310624,"threshold_uncertainty_score":0.039633512},"labels":[],"label_agreement":null},{"id":"W2126393089","doi":"10.1007/978-3-540-28634-9_12","title":"Connectivity of Wireless Sensor Networks with Constant Density","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Constant (computer programming); Square (algebra); Wireless sensor network; RADIUS; Fraction (chemistry); Computer science; Wireless; Topology (electrical circuits); Combinatorics; Mathematics; Telecommunications; Computer network; Geometry","score_opus":0.009789113678247734,"score_gpt":0.2119327028476343,"score_spread":0.20214358916938657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126393089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07989738,0.022990368,0.8149345,0.0019665689,0.0007147467,0.0001948313,0.00051333435,0.0008323395,0.077955976],"genre_scores_gemma":[0.8292511,0.027585853,0.11185968,0.00034260913,0.0011679495,0.00055432064,0.0008629723,0.00029633613,0.028079195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995459,0.00013257927,0.00002153907,0.00010575303,0.00015704034,0.00003717616],"domain_scores_gemma":[0.99872977,0.00091551046,0.00010002394,0.000098832796,0.000115291434,0.000040636318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033188114,0.0004726404,0.00058356434,0.0013583914,0.00048507488,0.001020234,0.001294717,0.0008005007,0.0034159285],"category_scores_gemma":[0.0034053773,0.0004947541,0.00037848434,0.0023145217,0.00086627854,0.0022847468,0.00086199766,0.0007979555,0.0003940206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020047455,0.00006710431,0.0011650042,0.00091289065,0.000074502874,0.00042844488,0.000395984,0.2588512,0.006822706,0.50449944,0.0187242,0.20785813],"study_design_scores_gemma":[0.00007284106,0.00017021467,0.0013021919,0.00011110663,0.00007348057,0.0014336348,0.00013746136,0.53033906,0.0017615117,0.43266645,0.031897154,0.000034892968],"about_ca_topic_score_codex":0.0009031851,"about_ca_topic_score_gemma":0.0007785655,"teacher_disagreement_score":0.0034159285,"about_ca_system_score_codex":0.00051515,"about_ca_system_score_gemma":0.00031085845,"threshold_uncertainty_score":0.011427462},"labels":[],"label_agreement":null},{"id":"W2126821874","doi":"10.1007/978-3-540-30175-2_24","title":"A Generative Framework for Managed Services","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Ottawa","funders":"","keywords":"Computer science; Domain (mathematical analysis); Generative grammar; Key (lock); Software engineering; Aspect-oriented programming; Software; Artificial intelligence; Programming language; Computer security","score_opus":0.012099133196694855,"score_gpt":0.24744019698466513,"score_spread":0.23534106378797026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126821874","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.0022363013,0.00015309732,0.97457916,0.00064788904,0.000060777755,0.000097998825,0.000095205,0.0017454686,0.020384226],"genre_scores_gemma":[0.19520304,0.00045692467,0.77160716,0.0003392307,0.00011337498,0.0006463014,0.0006438284,0.0017243994,0.02926578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980106,0.00080047175,0.00013660386,0.0002933797,0.00054729317,0.00021172699],"domain_scores_gemma":[0.9976023,0.0010291119,0.00007975764,0.0008444964,0.0002676712,0.00017666056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003119255,0.0007156603,0.0006391823,0.0015576977,0.0025517547,0.0065622437,0.0032729344,0.0025199603,0.014624848],"category_scores_gemma":[0.005753022,0.0014818854,0.0023129939,0.0017410293,0.0055022375,0.0069981334,0.0049274527,0.0032182902,0.003372204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006490128,0.000011337653,0.00006332657,0.000021491234,0.000004925972,0.000062234416,0.0004890116,0.0025933888,0.000311988,0.9877752,0.0012562211,0.007404252],"study_design_scores_gemma":[0.000024712057,0.000013431061,0.000049285427,0.00005290036,0.00001967228,0.00012301322,0.00018566029,0.049697712,0.0011535382,0.8670908,0.08156796,0.000021227623],"about_ca_topic_score_codex":0.0063952254,"about_ca_topic_score_gemma":0.0069937115,"teacher_disagreement_score":0.014624848,"about_ca_system_score_codex":0.002579948,"about_ca_system_score_gemma":0.0025455954,"threshold_uncertainty_score":0.048924923},"labels":[],"label_agreement":null},{"id":"W2126848223","doi":"10.1007/978-3-642-15880-3_19","title":"Smarter Sampling in Model-Based Bayesian Reinforcement Learning","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Markov decision process; Approximate Bayesian computation; Bellman equation; Bayesian probability; Computation; Sample (material); Sampling (signal processing); Artificial intelligence; Posterior probability; Bayesian inference; Machine learning; Markov process; Algorithm; Mathematical optimization; Mathematics; Statistics","score_opus":0.02126356525934251,"score_gpt":0.25524624714224586,"score_spread":0.23398268188290336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126848223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006517508,0.000269849,0.9912019,0.00018557473,0.000043361073,0.000026518002,0.00002083362,0.00016759717,0.001566914],"genre_scores_gemma":[0.6128083,0.00059130025,0.37838686,0.00039106296,0.00021283684,0.00037906968,0.0001919607,0.00028624324,0.006752436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731463,0.0015440088,0.00011869771,0.00033689983,0.0005280192,0.00015780205],"domain_scores_gemma":[0.98769116,0.0103512,0.00034211396,0.00085326855,0.00049306545,0.00026909975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052216756,0.0009284764,0.0025375434,0.00066245557,0.0005498362,0.0013700619,0.0027284848,0.0019691535,0.004748029],"category_scores_gemma":[0.020964045,0.0013190642,0.00095867435,0.00097168115,0.0024874867,0.0034260121,0.0027728807,0.003723845,0.00058555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020108119,0.000100349156,0.00041879795,0.00011657114,0.00005785148,0.000042928397,0.00009519006,0.81131196,0.00063646195,0.13241461,0.0015335765,0.053070564],"study_design_scores_gemma":[0.000015421514,0.000012790603,0.000025073708,0.000004750031,0.000004394222,0.0000053162626,0.000002131448,0.9549452,0.000100408535,0.04472211,0.00015855281,0.000003952769],"about_ca_topic_score_codex":0.0035926295,"about_ca_topic_score_gemma":0.003777498,"teacher_disagreement_score":0.0052216756,"about_ca_system_score_codex":0.0014621706,"about_ca_system_score_gemma":0.0012482337,"threshold_uncertainty_score":0.02761519},"labels":[],"label_agreement":null},{"id":"W2126943286","doi":"10.1007/11527886_43","title":"User- and Community-Adaptive Rewards Mechanism for Sustainable Online Community","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","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 Saskatchewan","funders":"","keywords":"Mechanism (biology); Information overload; Quality (philosophy); Computer science; Sustainability; Online community; Business; Internet privacy; World Wide Web; Ecology; Biology","score_opus":0.023963896440107477,"score_gpt":0.25689988208573067,"score_spread":0.23293598564562318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126943286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09582869,0.00017888834,0.89196783,0.001062905,0.00016726977,0.00044042908,0.00021659698,0.0015331177,0.0086042695],"genre_scores_gemma":[0.89989847,0.00007541093,0.088400096,0.00012894333,0.00008226426,0.00027736853,0.00009632509,0.00008243665,0.010958573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998287,0.000569813,0.00007204543,0.00036177956,0.00040369472,0.00030574182],"domain_scores_gemma":[0.99232966,0.0036987935,0.00041911457,0.0012092172,0.0012590903,0.0010840759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034542966,0.00062937965,0.001372889,0.0011012104,0.0018669494,0.0016697644,0.0043621026,0.002147268,0.008266108],"category_scores_gemma":[0.011941142,0.00046822854,0.0006939301,0.0010386661,0.001091186,0.003398264,0.0036529757,0.001954584,0.00094266084],"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.00156554,0.0017575304,0.0036715504,0.000314118,0.00021664417,0.00046001252,0.00097603985,0.28061077,0.018506458,0.43266577,0.022568434,0.23668708],"study_design_scores_gemma":[0.00011723108,0.00012369407,0.00045376603,0.000010645461,0.000030943753,0.00011447143,0.0000816196,0.9064311,0.0017193352,0.08864848,0.0022314005,0.000037287937],"about_ca_topic_score_codex":0.0022423058,"about_ca_topic_score_gemma":0.0030515927,"teacher_disagreement_score":0.008266108,"about_ca_system_score_codex":0.0014639986,"about_ca_system_score_gemma":0.002275559,"threshold_uncertainty_score":0.02765292},"labels":[],"label_agreement":null},{"id":"W2127039509","doi":"10.1007/978-3-642-33509-9_10","title":"Wavelet-Based Linearization for Single-Degree-Of-Freedom Nonlinear Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Structural Health Monitoring Techniques","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":"Concordia University","funders":"","keywords":"Linearization; Wavelet; Nonlinear system; Control theory (sociology); Computer science; Feedback linearization; Wavelet transform; Bilinear interpolation; Algorithm; Mathematics; Applied mathematics; Artificial intelligence; Physics; Computer vision","score_opus":0.042587199742224,"score_gpt":0.27047672707815473,"score_spread":0.22788952733593074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127039509","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.008101535,0.0006534967,0.9860533,0.00009647639,0.00007011983,0.000016556005,0.000030902975,0.00025686904,0.0047208066],"genre_scores_gemma":[0.73639894,0.004659031,0.22130296,0.00018915847,0.00028186574,0.00017348806,0.0004239477,0.00025303246,0.03631762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990535,0.000026749394,0.0000058348173,0.000016341506,0.00003758301,0.0000081961525],"domain_scores_gemma":[0.9999051,0.000048745973,0.000008729675,0.00001139616,0.000022693772,0.000003374872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023702634,0.00050084665,0.00045878039,0.00019152332,0.00015596318,0.00046612523,0.00046463625,0.00045623476,0.0029939944],"category_scores_gemma":[0.00044672927,0.00021448632,0.0004553808,0.00026343844,0.000298866,0.00062295917,0.00058115204,0.00073981856,0.0010288032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020706371,0.00011078567,0.0002671329,0.00093739835,0.000111856316,0.00016787939,0.00031479323,0.43862975,0.121287264,0.054707654,0.006396453,0.3768619],"study_design_scores_gemma":[0.0000056460494,0.00005829601,0.0001247974,0.000018081146,0.000011623786,0.000053873053,0.000017012933,0.9865362,0.0053005773,0.005673567,0.0021875456,0.000012720487],"about_ca_topic_score_codex":0.0006250205,"about_ca_topic_score_gemma":0.0007636506,"teacher_disagreement_score":0.0029939944,"about_ca_system_score_codex":0.00017057799,"about_ca_system_score_gemma":0.00014897394,"threshold_uncertainty_score":0.010015905},"labels":[],"label_agreement":null},{"id":"W2127117841","doi":"10.1007/978-3-642-15558-1_18","title":"Human Attributes from 3D Pose Tracking","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Artificial intelligence; Inference; Sadness; Benchmark (surveying); Ground truth; Pose; Computer vision; Gait; Machine learning; Motion capture; Video tracking; Task (project management); Motion (physics); Video processing","score_opus":0.029009127909680604,"score_gpt":0.26105135663976364,"score_spread":0.23204222873008304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127117841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043129448,0.0019846593,0.9407491,0.0001626723,0.00036218207,0.00010591539,0.0037168455,0.0032044633,0.0065847454],"genre_scores_gemma":[0.62907416,0.005868225,0.32872066,0.000251874,0.0005014691,0.00017082368,0.014907759,0.0008108037,0.01969429],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993236,0.00006725194,0.000026460753,0.00021439171,0.0003018988,0.00006646246],"domain_scores_gemma":[0.99934727,0.00013579315,0.000076613236,0.00021616631,0.00017414335,0.000050043393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004755831,0.0010042666,0.0016005642,0.001853915,0.00030424353,0.001369364,0.00090744294,0.00083511055,0.003689579],"category_scores_gemma":[0.0017991576,0.00054404547,0.0008210028,0.0035988053,0.00045146726,0.0012836838,0.0015256157,0.00085747574,0.005322667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040709853,0.00011475439,0.004856003,0.00019389724,0.000087636785,0.00020217344,0.00009990288,0.028089087,0.046842918,0.0016917019,0.007949931,0.90946496],"study_design_scores_gemma":[0.00003893202,0.000288845,0.050811734,0.00014781783,0.00015708589,0.0020168256,0.00030954604,0.8314177,0.065517396,0.026918069,0.022238974,0.00013700126],"about_ca_topic_score_codex":0.0025580078,"about_ca_topic_score_gemma":0.003960075,"teacher_disagreement_score":0.003689579,"about_ca_system_score_codex":0.00027809883,"about_ca_system_score_gemma":0.00036741403,"threshold_uncertainty_score":0.01234287},"labels":[],"label_agreement":null},{"id":"W2127265401","doi":"10.1007/978-3-540-73273-0_36","title":"Maximum Likelihood Estimators in Magnetic Resonance Imaging","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Estimator; Monte Carlo method; Statistics; SIGNAL (programming language); Nuisance parameter; Mathematics; Maximum likelihood; Mean squared error; M-estimator; Algorithm; Computer science","score_opus":0.008355712348237935,"score_gpt":0.2964077349553573,"score_spread":0.2880520226071194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127265401","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.00037156147,0.00097144576,0.99793845,0.00018673996,0.000033133954,0.000012387078,0.000026803233,0.00012498748,0.00033452208],"genre_scores_gemma":[0.039551403,0.0034250803,0.94858515,0.0002421017,0.0005269904,0.00036078657,0.00043484877,0.00047149233,0.00640214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946045,0.0038939088,0.00025806366,0.00047356024,0.0006521005,0.00011779665],"domain_scores_gemma":[0.9615816,0.034156326,0.0012256621,0.0013752773,0.0014561788,0.00020500574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010074396,0.0016212472,0.0038220775,0.0021667567,0.0008220365,0.0031537677,0.003384211,0.0045477175,0.0046239337],"category_scores_gemma":[0.052117083,0.0031426984,0.0016370807,0.0034135787,0.0028649631,0.0061156787,0.0034979708,0.0040252893,0.0028250604],"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.00013737171,0.00010350135,0.0009224553,0.0010958032,0.000268154,0.00021556695,0.000302974,0.33008227,0.0014910841,0.4132341,0.00987784,0.24226892],"study_design_scores_gemma":[0.000053091557,0.00002110753,0.00028489827,0.0001308047,0.00004558274,0.00014210517,0.000029959592,0.63047075,0.0010894283,0.36064664,0.007039253,0.000046331883],"about_ca_topic_score_codex":0.001639166,"about_ca_topic_score_gemma":0.0011496859,"teacher_disagreement_score":0.010074396,"about_ca_system_score_codex":0.001053629,"about_ca_system_score_gemma":0.0014536994,"threshold_uncertainty_score":0.0532791},"labels":[],"label_agreement":null},{"id":"W2127312575","doi":"10.1007/978-3-540-24767-8_26","title":"Reverse Subdivision Multiresolution for Polygonal Silhouette Error Correction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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 Calgary","funders":"","keywords":"Silhouette; Subdivision; Polygon mesh; Computer science; Computer graphics (images); Multiresolution analysis; Ribbon; Chaining; Artifact (error); Computer vision; Backward chaining; Object (grammar); Artificial intelligence; Algorithm; Geometry; Mathematics; Wavelet","score_opus":0.012844936841818595,"score_gpt":0.2536795068239025,"score_spread":0.2408345699820839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127312575","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.0084816925,0.00047633555,0.9878798,0.000036234364,0.0000602123,0.000015737229,0.000024487486,0.0005797987,0.0024456226],"genre_scores_gemma":[0.16004962,0.000811828,0.8289299,0.000067538334,0.00007643016,0.00003672717,0.0001704471,0.0006310894,0.009226393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995838,0.000052266332,0.000016024193,0.000050257713,0.00026625177,0.000031546177],"domain_scores_gemma":[0.9994838,0.00016528166,0.00003505046,0.00020486687,0.00009582103,0.000015141885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003349341,0.0004699252,0.000587424,0.0006396332,0.00020003023,0.0006723669,0.0008314961,0.0005709877,0.004676468],"category_scores_gemma":[0.0016826149,0.0004402408,0.00052125234,0.0006473137,0.00036503366,0.00071448035,0.0009226051,0.001391258,0.00116252],"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.00013038711,0.000057797934,0.000405109,0.00023801018,0.00004652196,0.00015168,0.00027046792,0.051175993,0.1622743,0.048931554,0.005001942,0.73131627],"study_design_scores_gemma":[0.00002435354,0.00007649531,0.0005965844,0.00004477422,0.00005545893,0.00075595645,0.00004726936,0.8707876,0.084285505,0.017154265,0.026137834,0.000033901786],"about_ca_topic_score_codex":0.0008276823,"about_ca_topic_score_gemma":0.0011964958,"teacher_disagreement_score":0.004676468,"about_ca_system_score_codex":0.00021160553,"about_ca_system_score_gemma":0.00018507108,"threshold_uncertainty_score":0.015644312},"labels":[],"label_agreement":null},{"id":"W2127407751","doi":"10.1007/978-3-319-07521-1_27","title":"Filter-Based Speckle Tracking for Freehand Prostate Biopsy: Theory, ex vivo and in vivo Results","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Photoacoustic and Ultrasonic Imaging","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":"University of British Columbia","funders":"","keywords":"Computer science; Speckle noise; Speckle pattern; Computer vision; Artificial intelligence; Prostate biopsy; Filter (signal processing); Noise (video); Prostate; 3D ultrasound; Ultrasound; Acoustics; Physics; Medicine","score_opus":0.011292905020549634,"score_gpt":0.21903622940696343,"score_spread":0.2077433243864138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127407751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044895865,0.0025615618,0.9481176,0.000104132814,0.000041080842,0.000040261988,0.00009665269,0.00041687937,0.0037259592],"genre_scores_gemma":[0.34593758,0.0045650466,0.63093823,0.0001674576,0.0000784219,0.000075068514,0.00048752397,0.00033213303,0.017418493],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996332,0.00007838872,0.000012042068,0.000050793904,0.00020556725,0.000020048526],"domain_scores_gemma":[0.999017,0.00069400086,0.00005358419,0.00006918878,0.00014520742,0.000021045496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082141446,0.0004158623,0.0006184345,0.00040888242,0.00020996656,0.00065565476,0.000513141,0.0011759071,0.0025816457],"category_scores_gemma":[0.0012606845,0.00033747088,0.0005849908,0.0005409038,0.00041444646,0.0008490628,0.00032339024,0.00041672186,0.000559692],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059666415,0.00026223823,0.0018777485,0.0005288993,0.00013911624,0.00013493988,0.00025516286,0.07949758,0.45867842,0.0077223247,0.0019480457,0.44835886],"study_design_scores_gemma":[0.00003299325,0.00033455133,0.005700516,0.000070449925,0.00010246612,0.00085267273,0.00004054846,0.79972893,0.18606955,0.0029270975,0.004049274,0.00009105186],"about_ca_topic_score_codex":0.0021053005,"about_ca_topic_score_gemma":0.0033405137,"teacher_disagreement_score":0.0025816457,"about_ca_system_score_codex":0.00045560894,"about_ca_system_score_gemma":0.0004812112,"threshold_uncertainty_score":0.008636475},"labels":[],"label_agreement":null},{"id":"W2127556423","doi":"10.1007/978-3-642-02568-6_55","title":"A Generic Episodic Learning Model Implemented in a Cognitive Agent by Means of Temporal Pattern Mining","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mechanism (biology); Artificial intelligence; Cognition; Machine learning","score_opus":0.035288329692277465,"score_gpt":0.2719699384589305,"score_spread":0.23668160876665306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127556423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015505592,0.00007700919,0.97997904,0.00012575737,0.000034738874,0.00007705877,0.00016738997,0.001813875,0.0022195033],"genre_scores_gemma":[0.29009038,0.00020546591,0.70463425,0.000093727795,0.00003294557,0.0002113879,0.00048231683,0.00011973376,0.0041297358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997545,0.000036980684,0.000029620003,0.00008954051,0.00006529648,0.000024028013],"domain_scores_gemma":[0.9995449,0.00014371568,0.00003287547,0.0001214843,0.000111743175,0.000045158486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058452203,0.00036742716,0.0005777139,0.0004516642,0.00039599382,0.0014141398,0.002324352,0.00090940204,0.0037290053],"category_scores_gemma":[0.0018175755,0.00030242538,0.0005478927,0.0006639694,0.0004672886,0.0018035595,0.00082945765,0.00061512383,0.0011119383],"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.00058283773,0.00059188507,0.005965754,0.00041271167,0.00028310344,0.00053759216,0.00053630886,0.3602418,0.02284485,0.09772194,0.006979101,0.50330204],"study_design_scores_gemma":[0.000020234233,0.000038396505,0.00026136258,0.000009858312,0.00003781525,0.00009360641,0.000019198484,0.97524095,0.004121806,0.017346893,0.0027975687,0.000012335978],"about_ca_topic_score_codex":0.0037879148,"about_ca_topic_score_gemma":0.0032825852,"teacher_disagreement_score":0.0037879148,"about_ca_system_score_codex":0.00041412225,"about_ca_system_score_gemma":0.0010769387,"threshold_uncertainty_score":0.012474775},"labels":[],"label_agreement":null},{"id":"W2127587972","doi":"10.1007/978-3-540-24709-8_42","title":"Molecular Simulation of Reaction and Adsorption in Nanochemical Devices: Increase of Reaction Conversion by Separation of a Product from the Reaction Mixture","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Phase Equilibria and Thermodynamics","field":"Engineering","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":"Ontario Tech University","funders":"","keywords":"Materials science; Molecular dynamics; Porosity; Syngas; Membrane reactor; Membrane; Porous medium; Mass transfer; Reaction rate; Nanoscopic scale; Adsorption; Control volume; Permeation; Chemical engineering; Semipermeable membrane; Chemistry; Nanotechnology; Thermodynamics; Catalysis; Chromatography; Physical chemistry; Computational chemistry; Physics; Organic chemistry","score_opus":0.006665546405052592,"score_gpt":0.2235604138065236,"score_spread":0.21689486740147101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127587972","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.8117103,0.0018291175,0.12806624,0.002841424,0.000571278,0.00011440804,0.0009160816,0.0010295162,0.05292157],"genre_scores_gemma":[0.94995284,0.0007588204,0.036835816,0.0002907351,0.000062596475,0.00019655807,0.00035026716,0.00030065197,0.011251663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999318,0.000012379206,0.0000022828144,0.000012408969,0.000025864065,0.00001527915],"domain_scores_gemma":[0.9998481,0.00009312544,0.000009850505,0.000014874146,0.00001842308,0.000015428392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014960156,0.0003858741,0.0007134706,0.00015437309,0.000439853,0.00050887046,0.001053779,0.0011601748,0.0043011317],"category_scores_gemma":[0.0004327837,0.00038845788,0.00043758776,0.0003373885,0.00041048974,0.0006633034,0.00027015133,0.0009879689,0.00036005347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018603461,0.00020187338,0.00050326105,0.00016891636,0.000053878175,0.000072886316,0.00011484356,0.9354329,0.027634619,0.024997093,0.0026649993,0.007968691],"study_design_scores_gemma":[0.000023890707,0.000021351272,0.00012812304,0.0000029206908,0.000005986134,0.0000065650465,0.000007461482,0.9910568,0.005786662,0.0019233143,0.0010302975,0.000006590848],"about_ca_topic_score_codex":0.0030841832,"about_ca_topic_score_gemma":0.0025748904,"teacher_disagreement_score":0.0043011317,"about_ca_system_score_codex":0.0007491219,"about_ca_system_score_gemma":0.0004658283,"threshold_uncertainty_score":0.01438874},"labels":[],"label_agreement":null},{"id":"W2128116119","doi":"10.1007/978-3-642-14215-4_9","title":"An Online Adaptive Approach to Alert Correlation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":58,"is_retracted":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":"Computer science; Honeypot; Intrusion detection system; System administrator; Network administrator; Bayesian network; Data mining; Context (archaeology); Set (abstract data type); Correlation; Focus (optics); Machine learning; Computer security","score_opus":0.0246716460367167,"score_gpt":0.23955077422664015,"score_spread":0.21487912818992344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128116119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048091584,0.00015160104,0.9911171,0.0001224814,0.00015139011,0.00007042591,0.000044721306,0.0015664857,0.00196658],"genre_scores_gemma":[0.34680754,0.00029916732,0.6364353,0.00049335224,0.00047593817,0.00023009205,0.00023275167,0.00029045306,0.014735464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821043,0.00036211335,0.00009027147,0.00047306425,0.0007057216,0.00015829786],"domain_scores_gemma":[0.9959726,0.0018843604,0.00023087832,0.0007895289,0.00094945624,0.00017311177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014643325,0.0010319484,0.0013638163,0.0013335148,0.0006790888,0.0015295539,0.0027275328,0.0011152017,0.0065297494],"category_scores_gemma":[0.00744209,0.0005322782,0.0005471527,0.001497014,0.00062892423,0.0018520021,0.0018639882,0.0018420675,0.0016649036],"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.00052037014,0.0006334584,0.0012110801,0.000074337724,0.000105095765,0.00014959858,0.00010742962,0.09050573,0.017818602,0.017638637,0.0094197625,0.86181575],"study_design_scores_gemma":[0.000025167148,0.00007546873,0.00031649106,0.000006095982,0.000028151591,0.00011316208,0.000015935044,0.9857917,0.0039767637,0.0077841016,0.0018522491,0.00001473575],"about_ca_topic_score_codex":0.003393115,"about_ca_topic_score_gemma":0.0046689548,"teacher_disagreement_score":0.0065297494,"about_ca_system_score_codex":0.0007249308,"about_ca_system_score_gemma":0.0014336141,"threshold_uncertainty_score":0.021844208},"labels":[],"label_agreement":null},{"id":"W2128248047","doi":"10.1007/3-540-44886-1_17","title":"Efficient Mining of Indirect Associations Using HI-Mine","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"York University","funders":"","keywords":"Computer science; Association rule learning; Data mining; struct; Set (abstract data type)","score_opus":0.030633662295016437,"score_gpt":0.26933802142846597,"score_spread":0.23870435913344953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128248047","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.13082261,0.0027212875,0.84691554,0.0005529391,0.00021442852,0.000354298,0.0058746138,0.0068970197,0.005647293],"genre_scores_gemma":[0.35803503,0.00078099227,0.6157052,0.00030300848,0.0002452255,0.00030212238,0.01667356,0.00028400938,0.0076707737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984831,0.00028535642,0.00018171738,0.00035467485,0.0005563564,0.00013874016],"domain_scores_gemma":[0.9939499,0.0033501415,0.00040339702,0.0011547443,0.00093964697,0.00020218527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018162376,0.001057353,0.0018843433,0.004041276,0.0011490503,0.002159434,0.00251183,0.001068177,0.0036057045],"category_scores_gemma":[0.008191101,0.00075433054,0.0012167542,0.0040780394,0.00057756086,0.0030525024,0.0023704648,0.001478102,0.0025422086],"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.0011530566,0.0007145024,0.044112947,0.000845358,0.0007129169,0.0012177636,0.00045456097,0.01653666,0.013279736,0.01255416,0.026093094,0.8823253],"study_design_scores_gemma":[0.00028379925,0.0007235363,0.018855786,0.00035975923,0.0012482917,0.0038593882,0.0009227049,0.7983101,0.035470292,0.10498256,0.03483568,0.00014806686],"about_ca_topic_score_codex":0.0012934209,"about_ca_topic_score_gemma":0.003968939,"teacher_disagreement_score":0.004041276,"about_ca_system_score_codex":0.00023287282,"about_ca_system_score_gemma":0.0015504047,"threshold_uncertainty_score":0.012062252},"labels":[],"label_agreement":null},{"id":"W2128418623","doi":"10.1007/978-3-540-85988-8_55","title":"Simulation of Ground-Truth Validation Data Via Physically- and Statistically-Based Warps","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":39,"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":"Computer science; Ground truth; Upload; Landmark; Segmentation; Computation; Artificial intelligence; Data mining; Computer vision; Algorithm","score_opus":0.03501184614019765,"score_gpt":0.29030545211526004,"score_spread":0.2552936059750624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128418623","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.792536,0.00026815964,0.19868514,0.0006630388,0.00022121565,0.00019447997,0.0016800216,0.0011935306,0.004558379],"genre_scores_gemma":[0.9831156,0.000041168572,0.015096109,0.000055121855,0.0000092136315,0.00007079454,0.0008596444,0.0000763991,0.00067591865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938774,0.00018586931,0.000041679068,0.000121772326,0.00014716982,0.00011581837],"domain_scores_gemma":[0.9923699,0.0057919673,0.0003945381,0.00054141285,0.000749547,0.00015259444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022585713,0.0009289073,0.0008787593,0.0008722965,0.00070323684,0.0010926567,0.0017722618,0.002497622,0.0029584358],"category_scores_gemma":[0.011541035,0.00088413496,0.0010018799,0.0011877646,0.0014905639,0.0013345922,0.001063049,0.0016824708,0.00042891584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008006763,0.0000235172,0.00089369103,0.000013062831,0.0000076142956,0.000051639574,0.000028794042,0.99655306,0.0003011468,0.00055892195,0.00014680726,0.0013417101],"study_design_scores_gemma":[0.000013750012,0.000020293177,0.00028565218,0.0000035057762,0.000002744228,0.0000097682,0.0000110992105,0.998492,0.0005381322,0.00054443633,0.00007156672,0.000006925964],"about_ca_topic_score_codex":0.019048288,"about_ca_topic_score_gemma":0.009513989,"teacher_disagreement_score":0.019048288,"about_ca_system_score_codex":0.0011239097,"about_ca_system_score_gemma":0.0013419943,"threshold_uncertainty_score":0.037874818},"labels":[],"label_agreement":null},{"id":"W2128454801","doi":"10.1007/978-3-642-23863-5_36","title":"Improved Travel Time Prediction Algorithms for Intelligent Transportation Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Intelligent transportation system; Travel time; Intelligent decision support system; Algorithm; Machine learning; Data mining; Transport engineering; Engineering","score_opus":0.01607053279998348,"score_gpt":0.21182147661125442,"score_spread":0.19575094381127095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128454801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010204896,0.0014976119,0.98539156,0.00013948425,0.00025937252,0.000025320509,0.00015350513,0.0011001241,0.00122814],"genre_scores_gemma":[0.23580651,0.0016107789,0.75351727,0.00012344564,0.0003824534,0.00013157059,0.00088128814,0.00025521428,0.007291536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.00008599527,0.000029672497,0.000090604946,0.0001593611,0.000037563175],"domain_scores_gemma":[0.99901533,0.0004180868,0.00004362289,0.00014022582,0.0003618426,0.000020910378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008421976,0.0008572674,0.0013149844,0.0006789785,0.00038433843,0.0007400626,0.0018105005,0.00080848334,0.0036323904],"category_scores_gemma":[0.00280398,0.0005119145,0.0005601347,0.0014864829,0.00027867476,0.0015600526,0.0006200233,0.0017817045,0.0010974287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013191295,0.00007233653,0.00043049053,0.00007058839,0.000053887296,0.000019036857,0.000029696905,0.57920474,0.002513861,0.0057582846,0.006331396,0.40538386],"study_design_scores_gemma":[0.000004331091,0.000009900397,0.00011316755,0.000003234869,0.0000062959452,0.000005685542,0.0000017797812,0.9969656,0.00045408084,0.0017794123,0.000653574,0.0000029174703],"about_ca_topic_score_codex":0.00943974,"about_ca_topic_score_gemma":0.0071630627,"teacher_disagreement_score":0.00943974,"about_ca_system_score_codex":0.0006114595,"about_ca_system_score_gemma":0.0006505663,"threshold_uncertainty_score":0.018769562},"labels":[],"label_agreement":null},{"id":"W2128500803","doi":"10.1007/978-3-540-24840-8_65","title":"Coarsening Classification Rules on Basis of Granular Computing","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Overfitting; Computer science; Granular computing; Predictability; Task (project management); Artificial intelligence; Field (mathematics); Machine learning; Data mining; Rough set; Mathematics; Engineering; Artificial neural network","score_opus":0.030034156871434972,"score_gpt":0.25117831214499076,"score_spread":0.2211441552735558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128500803","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.036652748,0.00057096034,0.959024,0.0001564394,0.00015855086,0.00020350669,0.00010102664,0.0006235053,0.002509314],"genre_scores_gemma":[0.42269728,0.00045795308,0.57464164,0.00012954911,0.00012739851,0.00018772716,0.0004378721,0.000092510774,0.001228038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975097,0.00042905973,0.0004246543,0.0005290385,0.0009153798,0.00019212194],"domain_scores_gemma":[0.99386746,0.0029158988,0.00035676066,0.0012858206,0.0014310644,0.00014297801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034385223,0.0006559273,0.0022941248,0.0026512344,0.0007028717,0.0028033599,0.0013834218,0.000771681,0.0019037069],"category_scores_gemma":[0.013458035,0.00055123674,0.0014277895,0.002044747,0.0011030381,0.002204817,0.0017083724,0.0017438981,0.0004850793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004777451,0.00019299594,0.003327937,0.000497087,0.00029791903,0.00035330272,0.0005095829,0.3003644,0.017953422,0.053852897,0.0035219244,0.6186508],"study_design_scores_gemma":[0.0000357298,0.000082530896,0.0011574966,0.00008864243,0.00014720473,0.00010727167,0.00007015016,0.90209234,0.005639082,0.08769928,0.0028453225,0.000034877034],"about_ca_topic_score_codex":0.0039044858,"about_ca_topic_score_gemma":0.0038926087,"teacher_disagreement_score":0.0039044858,"about_ca_system_score_codex":0.0007080484,"about_ca_system_score_gemma":0.0011325257,"threshold_uncertainty_score":0.01818484},"labels":[],"label_agreement":null},{"id":"W2128619633","doi":"10.1007/978-3-540-30115-8_53","title":"Batch Reinforcement Learning with State Importance","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Classifier (UML); Machine learning; Process (computing); State (computer science); Learning classifier system; Q-learning; Quality (philosophy); Function (biology); Bellman equation; Mathematical optimization; Algorithm; Mathematics","score_opus":0.011927894267546134,"score_gpt":0.22735911585792695,"score_spread":0.2154312215903808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128619633","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.006421003,0.00028860598,0.98754764,0.00012549253,0.00012203844,0.00004824861,0.000037402442,0.00072285696,0.0046865824],"genre_scores_gemma":[0.66342723,0.00040671125,0.31166562,0.0002666588,0.00021816717,0.00034513415,0.00025034684,0.00029100568,0.023129033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.00011447781,0.000025410622,0.000115598916,0.00015707932,0.000055643824],"domain_scores_gemma":[0.99856263,0.00095887453,0.00006873401,0.00017324163,0.00017251637,0.000064051615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013667659,0.00083223014,0.0011228797,0.00036550098,0.00026223183,0.0005931002,0.0015927341,0.0008964766,0.0072989245],"category_scores_gemma":[0.003479426,0.00052955066,0.00041215424,0.0004411987,0.00076331117,0.0012456984,0.0012991731,0.0018626943,0.0010611219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004194579,0.00022653058,0.00042052448,0.00017391394,0.000082187325,0.000080958824,0.000050045146,0.61917096,0.0058142594,0.042174395,0.0071413084,0.3242455],"study_design_scores_gemma":[0.000025339747,0.00004351665,0.000060574283,0.000004577035,0.000009102373,0.000014494247,0.0000015569873,0.986206,0.0010498927,0.0119749755,0.00060461415,0.000005250054],"about_ca_topic_score_codex":0.002108066,"about_ca_topic_score_gemma":0.0022401027,"teacher_disagreement_score":0.0072989245,"about_ca_system_score_codex":0.0007020369,"about_ca_system_score_gemma":0.0008109084,"threshold_uncertainty_score":0.024417281},"labels":[],"label_agreement":null},{"id":"W2128893014","doi":"10.1007/978-3-319-16480-9_55","title":"Transport Properties of RNA Nanotubes Using Molecular Dynamics Simulation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nanopore and Nanochannel Transport Studies","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":"Wilfrid Laurier University","funders":"","keywords":"Autocorrelation; Molecular dynamics; RNA; Nanotube; Diffusion; Atom (system on chip); Chemical physics; Ion; Materials science; Dynamics (music); Nanotechnology; Chemistry; Computer science; Physics; Computational chemistry; Carbon nanotube; Thermodynamics; Quantum mechanics; Mathematics","score_opus":0.02884587108535763,"score_gpt":0.23039796524892134,"score_spread":0.2015520941635637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128893014","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.8589972,0.0018901324,0.091580234,0.0010804195,0.00023776866,0.00019021875,0.0013763391,0.0009422965,0.04370534],"genre_scores_gemma":[0.96176726,0.0007085099,0.030486904,0.000107318345,0.000052692143,0.00020016178,0.00067525264,0.0002650686,0.0057368213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988484,0.00003236759,0.00000489252,0.000015123378,0.000043762117,0.000019064943],"domain_scores_gemma":[0.9996916,0.00016910021,0.000025026273,0.000027712074,0.00006043979,0.000026180653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003068018,0.00049274776,0.00069729245,0.0004852201,0.0007882648,0.0007061108,0.0009955993,0.001105594,0.0024383187],"category_scores_gemma":[0.00077652454,0.00040244553,0.0007735935,0.00061488553,0.0004591192,0.00071437616,0.00036027664,0.0007803819,0.00033125147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057159814,0.00008354456,0.00047327083,0.00007649493,0.000034559453,0.00007994947,0.000055165943,0.97728944,0.009315471,0.008676976,0.00055383495,0.0033039867],"study_design_scores_gemma":[0.0000073852148,0.000007252186,0.00009077912,0.0000033035153,0.0000025505053,0.0000039766383,0.0000030135986,0.99820495,0.0008706729,0.0005812879,0.00022038311,0.000004390853],"about_ca_topic_score_codex":0.009538023,"about_ca_topic_score_gemma":0.0057807895,"teacher_disagreement_score":0.009538023,"about_ca_system_score_codex":0.0011762354,"about_ca_system_score_gemma":0.00079311745,"threshold_uncertainty_score":0.018965006},"labels":[],"label_agreement":null},{"id":"W2129081249","doi":"10.1007/3-540-44864-0_25","title":"An Adaptive Load Balancing Algorithm for Large Data Parallel Processing with Communication Delay","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Computer science; Load balancing (electrical power); Transfer (computing); Novelty; Data processing; Algorithm; Distributed computing; Parallel computing; Parallel processing; Load distribution; Database","score_opus":0.027744034000897734,"score_gpt":0.2807065179659685,"score_spread":0.25296248396507076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129081249","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.020566534,0.00040143772,0.9745696,0.00015680982,0.00023772357,0.000086267326,0.00004982263,0.002077772,0.0018539896],"genre_scores_gemma":[0.22652285,0.00023663236,0.7654861,0.00016431895,0.0001984238,0.0002492362,0.00023834391,0.00035789353,0.006546216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996675,0.000056991383,0.000026295073,0.000061703184,0.00014506397,0.000042415373],"domain_scores_gemma":[0.99942625,0.00019640276,0.000042890475,0.00010131191,0.00019069006,0.000042467622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463151,0.00075641304,0.0007704874,0.00072389696,0.001065328,0.00085914665,0.0022194267,0.00067675003,0.0038162428],"category_scores_gemma":[0.0017838496,0.00042990723,0.00033752059,0.0013066174,0.0005032351,0.0012569412,0.0011346693,0.0008834389,0.0008313987],"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.001025872,0.00025827702,0.00068324734,0.00015397399,0.00008660262,0.00007757939,0.00014863278,0.23821498,0.030592142,0.015489879,0.011567394,0.70170146],"study_design_scores_gemma":[0.000114868104,0.000065984976,0.0001742599,0.0000049199466,0.000024015813,0.0000320189,0.0000139596905,0.9858202,0.0043095187,0.0064081517,0.0030189187,0.0000131206325],"about_ca_topic_score_codex":0.0032954453,"about_ca_topic_score_gemma":0.005183417,"teacher_disagreement_score":0.0038162428,"about_ca_system_score_codex":0.00069646694,"about_ca_system_score_gemma":0.000993883,"threshold_uncertainty_score":0.0127666},"labels":[],"label_agreement":null},{"id":"W2129155132","doi":"10.1007/3-540-39963-1_29","title":"Learning Relational Clichés with Contextual LGG","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Generalization; Computer science; Cliché; Context (archaeology); Artificial intelligence; Greedy algorithm; Theoretical computer science; Natural language processing; Algorithm; Mathematics; Linguistics","score_opus":0.013323387383803963,"score_gpt":0.22247425904750187,"score_spread":0.20915087166369792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129155132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17383787,0.0007141108,0.7799953,0.0012975878,0.0002720504,0.00030085878,0.0023310184,0.0059651625,0.035286132],"genre_scores_gemma":[0.7648708,0.00029507055,0.220846,0.00033412257,0.00006906671,0.0001552573,0.0040490204,0.0002967958,0.009083948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.0002102147,0.00004537644,0.0002972863,0.00014781285,0.0000682164],"domain_scores_gemma":[0.9983637,0.0008300078,0.000099735465,0.00039316423,0.00022040006,0.00009302878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662266,0.0008089557,0.0007108201,0.0009929248,0.0006215513,0.0016448199,0.0017701708,0.0010708562,0.01423957],"category_scores_gemma":[0.0070364536,0.00036403732,0.0008327203,0.001153153,0.001006032,0.005577005,0.0033724573,0.0017145282,0.0025239643],"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.0005014237,0.00033981164,0.0069352686,0.00038963498,0.000109674074,0.00029322942,0.0007786954,0.040719498,0.0048340773,0.13007277,0.0287116,0.7863143],"study_design_scores_gemma":[0.00007607658,0.00014480966,0.0016896487,0.00015720077,0.000057385267,0.00012725615,0.0010013401,0.46066502,0.0036736522,0.518644,0.013719393,0.000044317138],"about_ca_topic_score_codex":0.0021409518,"about_ca_topic_score_gemma":0.004883322,"teacher_disagreement_score":0.01423957,"about_ca_system_score_codex":0.0007304348,"about_ca_system_score_gemma":0.0007251543,"threshold_uncertainty_score":0.04763615},"labels":[],"label_agreement":null},{"id":"W2129252388","doi":"10.1007/978-3-642-00219-9_5","title":"Crossing and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Crossing number (knot theory); Planar graph; Planar; Combinatorics; Book embedding; Graph; Computer science; Mathematics; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.013661287680244159,"score_gpt":0.2622508273205566,"score_spread":0.24858953964031244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129252388","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.80000216,0.002051153,0.1327729,0.0004054816,0.00026734133,0.00005699826,0.0007040827,0.00037169928,0.06336823],"genre_scores_gemma":[0.94867444,0.0012941877,0.036298662,0.00007932074,0.00017183827,0.00006897554,0.00065648573,0.00019994112,0.012556296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.00009767817,0.00002776952,0.00015768586,0.00019144641,0.00007071928],"domain_scores_gemma":[0.9972475,0.001347747,0.0004788401,0.00023934997,0.00028176646,0.00040479907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074546575,0.0005877315,0.00058324344,0.0038717112,0.0008999955,0.001873193,0.0013724798,0.00077916146,0.005199177],"category_scores_gemma":[0.0051849047,0.0005185471,0.0004267431,0.0032497563,0.001194882,0.0029680114,0.00097589334,0.00121653,0.00043681968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003959103,0.00012928489,0.004798423,0.0002838635,0.00007989051,0.0002947781,0.0005041157,0.075746015,0.012573229,0.81750685,0.006666002,0.081021555],"study_design_scores_gemma":[0.000023850384,0.000083675906,0.005452734,0.00006270635,0.00007432444,0.00066521467,0.00023935684,0.15436031,0.0043669716,0.8270422,0.0075791734,0.00004944837],"about_ca_topic_score_codex":0.0006958828,"about_ca_topic_score_gemma":0.00077025715,"teacher_disagreement_score":0.005199177,"about_ca_system_score_codex":0.0009333969,"about_ca_system_score_gemma":0.00029670805,"threshold_uncertainty_score":0.017392933},"labels":[],"label_agreement":null},{"id":"W2129306751","doi":"10.1007/978-3-540-72606-7_49","title":"Peer-Assisted On-Demand Streaming of Stored Media Using BitTorrent-Like Protocols","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":44,"is_retracted":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":"BitTorrent; Computer science; On demand; Video on demand; Computer network; Peer-to-peer; Multimedia","score_opus":0.0581833418029555,"score_gpt":0.3118027656632388,"score_spread":0.2536194238602833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129306751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123781726,0.001917028,0.8360365,0.000318759,0.000534646,0.0004677962,0.0003422372,0.009387666,0.027213639],"genre_scores_gemma":[0.6687867,0.00201164,0.29018605,0.00015513877,0.000378135,0.000174584,0.0010951615,0.00057733804,0.03663536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963367,0.000052808362,0.00001982587,0.000050583647,0.00020833514,0.00003481497],"domain_scores_gemma":[0.9993104,0.00020905779,0.000025254329,0.00017393658,0.0002229621,0.00005836384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043216342,0.00055231806,0.0009731084,0.0006233937,0.00059479364,0.0010445735,0.0020235386,0.0008542137,0.0028887996],"category_scores_gemma":[0.0012338697,0.00031565412,0.00038979627,0.0007450979,0.0003107506,0.0015307677,0.0010412193,0.0009481677,0.0011922256],"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.0010350654,0.00052910607,0.0007665188,0.00068019796,0.0002390521,0.0008348266,0.0005434782,0.052432664,0.3249887,0.028305631,0.024866974,0.5647778],"study_design_scores_gemma":[0.000103018516,0.0003771421,0.0009508195,0.000049067512,0.00010024083,0.0013553086,0.000110636734,0.8025166,0.14572069,0.017002318,0.03161265,0.000101549995],"about_ca_topic_score_codex":0.0009543052,"about_ca_topic_score_gemma":0.0014254657,"teacher_disagreement_score":0.0028887996,"about_ca_system_score_codex":0.00031131966,"about_ca_system_score_gemma":0.00036550447,"threshold_uncertainty_score":0.009663999},"labels":[],"label_agreement":null},{"id":"W2129306832","doi":"10.1007/978-3-642-02059-9_6","title":"AspectOptima: A Case Study on Aspect Dependencies and Interactions","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Aspect-oriented programming; Computer science; Programming language; Separation of concerns; Structuring; Consistency (knowledge bases); Atomicity; Software engineering; Set (abstract data type); Concurrency; Software; Artificial intelligence; Database transaction","score_opus":0.050714020083532554,"score_gpt":0.31714382007058833,"score_spread":0.2664297999870558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129306832","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.880765,0.0008006044,0.06643948,0.0014436156,0.00007274516,0.00023164952,0.00043139502,0.0013572447,0.04845815],"genre_scores_gemma":[0.92900246,0.0005571096,0.056005977,0.00024776228,0.000026816137,0.00008060058,0.00045301372,0.0006747986,0.012951464],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99834776,0.0006782855,0.000052718005,0.00014313357,0.00061003235,0.00016808927],"domain_scores_gemma":[0.9938366,0.004611686,0.0003609884,0.0006010841,0.00034606532,0.0002436271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016649211,0.00047414278,0.00027232486,0.00072015484,0.0014027208,0.0018184157,0.00121909,0.0016042457,0.0022064627],"category_scores_gemma":[0.0063830805,0.00037982714,0.0004363421,0.0011373553,0.0010394928,0.0018900054,0.0010785712,0.0013821931,0.00049330964],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020543158,0.0038736782,0.05971205,0.0017593375,0.00025151778,0.04466714,0.037816815,0.049865868,0.06824357,0.10997604,0.043746483,0.57803327],"study_design_scores_gemma":[0.00061489874,0.0015939937,0.06388747,0.00079799554,0.0006601712,0.03935163,0.039087497,0.29188278,0.10852345,0.07074445,0.38255802,0.00029764578],"about_ca_topic_score_codex":0.005211481,"about_ca_topic_score_gemma":0.012790921,"teacher_disagreement_score":0.005211481,"about_ca_system_score_codex":0.0007444843,"about_ca_system_score_gemma":0.0010533223,"threshold_uncertainty_score":0.0103622675},"labels":[],"label_agreement":null},{"id":"W2129513032","doi":"10.1007/11823728_39","title":"Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":93,"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":"Anonymity; Cluster analysis; k-anonymity; Tuple; Computer science; Hierarchical clustering; Data mining; Set (abstract data type); Scalability; Metric (unit); Data set; Cluster (spacecraft); Constraint (computer-aided design); Theoretical computer science; Mathematics; Artificial intelligence; Database; Discrete mathematics; Computer security; Engineering","score_opus":0.021724901495406408,"score_gpt":0.2582102302687089,"score_spread":0.23648532877330247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129513032","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.028932825,0.00022814295,0.9656792,0.00047866188,0.000040516352,0.000057207497,0.00020570564,0.0005691427,0.0038085303],"genre_scores_gemma":[0.6163793,0.0005186797,0.37619817,0.00029864893,0.00013167417,0.00017648474,0.00064027833,0.00020847126,0.0054483353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919545,0.0028615484,0.00048317123,0.0012684821,0.002549579,0.0008827207],"domain_scores_gemma":[0.98590255,0.0056762476,0.0010322019,0.006035449,0.0009786425,0.0003748491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038401005,0.0008489997,0.0018834486,0.0013256347,0.0031556725,0.004161845,0.0035415478,0.0019715447,0.0018224005],"category_scores_gemma":[0.009751434,0.0009930624,0.0014996399,0.0036547347,0.0030606394,0.010227409,0.007422609,0.003409837,0.001122075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082105707,0.00027503565,0.0017326104,0.000437283,0.00022762203,0.00025148605,0.0014613033,0.21784593,0.017264416,0.58142024,0.012601181,0.16566189],"study_design_scores_gemma":[0.000045451714,0.00008583345,0.00043317812,0.000030548672,0.000043998807,0.00034795486,0.0003317806,0.35445297,0.013658906,0.62518954,0.0053066174,0.000073176445],"about_ca_topic_score_codex":0.0009496499,"about_ca_topic_score_gemma":0.0012347449,"teacher_disagreement_score":0.004161845,"about_ca_system_score_codex":0.0019432461,"about_ca_system_score_gemma":0.0022333814,"threshold_uncertainty_score":0.020308673},"labels":[],"label_agreement":null},{"id":"W2129526759","doi":"10.1007/3-540-44886-1_30","title":"An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ant colony optimization algorithms; Computer science; Protein structure prediction; Benchmark (surveying); Algorithm; Protein folding; Ant colony; Focus (optics); Folding (DSP implementation); Protein structure; Chemistry","score_opus":0.02395973256592805,"score_gpt":0.28334347114580616,"score_spread":0.2593837385798781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129526759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023319574,0.0005082967,0.9633207,0.00026017663,0.0002251594,0.00013775182,0.000102315564,0.0011169689,0.0110090645],"genre_scores_gemma":[0.13430552,0.00029153703,0.8586441,0.00017985741,0.000101112986,0.00032864796,0.00021929463,0.00029112305,0.0056388555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996935,0.00008909239,0.000013189755,0.00004363182,0.00012964079,0.000030953343],"domain_scores_gemma":[0.9995554,0.00022765735,0.000027591957,0.000049812243,0.00011026137,0.000029210223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061428954,0.00095144176,0.0015604397,0.0005890951,0.00058987323,0.0007574993,0.0017338555,0.0016924258,0.0047857803],"category_scores_gemma":[0.001404322,0.0005362074,0.0007509975,0.00088938355,0.0004644275,0.0007633127,0.0012205341,0.0011699136,0.0010916569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012737428,0.00008878786,0.0002828006,0.00010214275,0.000040733674,0.00009199211,0.0000497201,0.83683455,0.0031773287,0.005149676,0.0033282053,0.15072669],"study_design_scores_gemma":[0.000021711734,0.000017635091,0.000045402652,0.000003130916,0.0000050663966,0.000014544492,0.000004287102,0.9978508,0.00021770693,0.0011225869,0.0006939716,0.0000031398686],"about_ca_topic_score_codex":0.004528993,"about_ca_topic_score_gemma":0.0043979953,"teacher_disagreement_score":0.0047857803,"about_ca_system_score_codex":0.00045191482,"about_ca_system_score_gemma":0.00088902185,"threshold_uncertainty_score":0.016009986},"labels":[],"label_agreement":null},{"id":"W2129630717","doi":"10.1007/978-3-540-92803-4_8","title":"A Trust-Based Incentive Mechanism for E-Marketplaces","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Incentive; Trustworthiness; Mechanism (biology); Order (exchange); Computer science; Profit (economics); Business; Context (archaeology); Electronic markets; Forward auction; Internet privacy; Microeconomics; Marketing; The Internet; World Wide Web; Bidding","score_opus":0.01469078150418554,"score_gpt":0.23623748679862075,"score_spread":0.2215467052944352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129630717","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.019697329,0.0003700975,0.96054703,0.0015581063,0.00024893883,0.00033825796,0.0001292345,0.00079769286,0.016313288],"genre_scores_gemma":[0.69373244,0.00054677227,0.28291115,0.00030304622,0.0002919728,0.00045064194,0.0001615017,0.00013639357,0.021466037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546057,0.0017673216,0.00040006696,0.0005728561,0.001263161,0.0005361343],"domain_scores_gemma":[0.99168396,0.00379513,0.0007906336,0.0018901436,0.001089405,0.0007506901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00626383,0.0008040725,0.0015741797,0.0009356354,0.0020172237,0.0045543816,0.004508891,0.0043822885,0.010326598],"category_scores_gemma":[0.018880196,0.0009201707,0.0014961212,0.0018237924,0.002545909,0.012510565,0.005138565,0.004107707,0.0018396343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003808104,0.00020408598,0.00029895996,0.00017700972,0.000041479867,0.00018120599,0.00027555617,0.025877716,0.0032566292,0.90514016,0.005392651,0.058773864],"study_design_scores_gemma":[0.0002628197,0.00021454586,0.00015186299,0.00006154215,0.00004521095,0.00033624435,0.00007814874,0.32363486,0.0027614217,0.65390325,0.018483082,0.000067052424],"about_ca_topic_score_codex":0.00075330614,"about_ca_topic_score_gemma":0.00058686774,"teacher_disagreement_score":0.010326598,"about_ca_system_score_codex":0.0020436961,"about_ca_system_score_gemma":0.0023495727,"threshold_uncertainty_score":0.0345459},"labels":[],"label_agreement":null},{"id":"W2129787199","doi":"10.1007/978-3-642-39995-4_4","title":"A Framework for Composing Personalized Web Resources","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"IBM (Canada); Queen's University","funders":"","keywords":"Computer science; World Wide Web; Web modeling; Web resource; Web standards; The Internet; Data Web; Web development; Web service; Web application; Web engineering; Web navigation; Process (computing); Web Accessibility Initiative; Web intelligence","score_opus":0.024940329847421165,"score_gpt":0.2672150106315403,"score_spread":0.24227468078411912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129787199","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.002138708,0.00015507947,0.98284274,0.000120639015,0.000048112626,0.00021335855,0.00023999781,0.011764387,0.0024770296],"genre_scores_gemma":[0.028128993,0.00023647455,0.96334237,0.0000909516,0.000035546134,0.0002344882,0.0008606527,0.0012477618,0.0058228015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976313,0.0003075905,0.0003030598,0.0005278923,0.0009968337,0.00023326567],"domain_scores_gemma":[0.9977932,0.0004936652,0.00011268552,0.00101807,0.000341245,0.00024120849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030889048,0.001311082,0.0014438638,0.0029950081,0.0022798434,0.0060818586,0.0035620048,0.0020587386,0.008653557],"category_scores_gemma":[0.0059939995,0.0016418252,0.002519766,0.0033893709,0.0016237105,0.008834094,0.005812355,0.0028022046,0.0043111965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031116654,0.00043294363,0.0026073116,0.00064584776,0.00023320015,0.0009363786,0.0018417169,0.04114699,0.016355967,0.33425134,0.037194584,0.5640426],"study_design_scores_gemma":[0.000084476414,0.000116052426,0.0006318112,0.0002486587,0.0002840939,0.00071722176,0.00055457366,0.45591787,0.028545951,0.30296546,0.20975679,0.00017701638],"about_ca_topic_score_codex":0.010454336,"about_ca_topic_score_gemma":0.018578859,"teacher_disagreement_score":0.010454336,"about_ca_system_score_codex":0.0011918474,"about_ca_system_score_gemma":0.002075899,"threshold_uncertainty_score":0.028949022},"labels":[],"label_agreement":null},{"id":"W2129864673","doi":"10.1007/3-540-36498-6_11","title":"Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Simon Fraser University","funders":"","keywords":"Computer science; Distributed computing; Computer network; Adaptive quality of service multi-hop routing; Link-state routing protocol; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless ad hoc network; Wireless Routing Protocol; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.015546403062880989,"score_gpt":0.22878434803105735,"score_spread":0.21323794496817636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129864673","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.0035404733,0.00032671378,0.9854455,0.0005496697,0.0001363214,0.00019909712,0.00028118677,0.00058850134,0.0089324545],"genre_scores_gemma":[0.23602575,0.0009813542,0.74429196,0.0005210109,0.00030929723,0.0010044749,0.0012883116,0.00036360073,0.015214177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978667,0.0005757333,0.00025343997,0.00025371034,0.0008226482,0.00022776004],"domain_scores_gemma":[0.9981839,0.0008931088,0.00012819793,0.00030292012,0.00039713242,0.00009482726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021409437,0.0007831275,0.00065032265,0.00096126646,0.0012604953,0.0045541525,0.0026853585,0.0016254251,0.0059354906],"category_scores_gemma":[0.0037755228,0.00078514125,0.0013182567,0.0011097091,0.0028417448,0.0033321623,0.0021813533,0.0023842924,0.001403296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045686895,0.00008708839,0.00022729622,0.0002057047,0.000024490375,0.00032684178,0.00047880143,0.029678043,0.00322378,0.94019026,0.0034991165,0.02201297],"study_design_scores_gemma":[0.00016689539,0.000088620414,0.0001803264,0.00016394685,0.00007339215,0.00043832208,0.00025301188,0.2298109,0.0046233255,0.6685805,0.095568106,0.000052683667],"about_ca_topic_score_codex":0.005996656,"about_ca_topic_score_gemma":0.0051432527,"teacher_disagreement_score":0.005996656,"about_ca_system_score_codex":0.0018599072,"about_ca_system_score_gemma":0.002733564,"threshold_uncertainty_score":0.019856215},"labels":[],"label_agreement":null},{"id":"W2129867629","doi":"10.1007/978-3-540-24677-0_76","title":"Facilitating E-learning with a MARC to IEEE LOM Metadata Crosswalk Application","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"Athabasca University","funders":"","keywords":"Schema crosswalk; Metadata; Computer science; Meta Data Services; Metadata repository; World Wide Web; Learning object; Cataloging; Flexibility (engineering); Multimedia","score_opus":0.013866501396730192,"score_gpt":0.2696775059032724,"score_spread":0.2558110045065422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129867629","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.103013664,0.0004132386,0.5879221,0.001242767,0.0004697958,0.00068336766,0.0007734621,0.11621933,0.18926229],"genre_scores_gemma":[0.41632676,0.0005227116,0.36742553,0.0004398773,0.00013525027,0.00033909947,0.0022076115,0.0057580727,0.20684509],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995388,0.000074688476,0.000038900307,0.000051771174,0.00023569344,0.000060206778],"domain_scores_gemma":[0.99894315,0.00037330424,0.0000636395,0.00026594716,0.00020943306,0.00014455628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008035034,0.00046964287,0.00023498543,0.0009850345,0.0005300124,0.0014842806,0.0008197297,0.0006295303,0.02532826],"category_scores_gemma":[0.0033246912,0.0002853212,0.00024774185,0.0006283569,0.00019729917,0.0023884224,0.0025911925,0.0007782347,0.009067505],"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.0005290959,0.0010759378,0.003332758,0.00034651003,0.000020033787,0.0008535648,0.0010518068,0.0014674762,0.092815794,0.018079571,0.05534418,0.82508326],"study_design_scores_gemma":[0.00020691716,0.00068238925,0.010551789,0.00036686898,0.000112371854,0.002278392,0.0010732587,0.09432143,0.20863116,0.010705217,0.6708719,0.00019835311],"about_ca_topic_score_codex":0.0018585816,"about_ca_topic_score_gemma":0.0047842884,"teacher_disagreement_score":0.02532826,"about_ca_system_score_codex":0.00035634672,"about_ca_system_score_gemma":0.0006739833,"threshold_uncertainty_score":0.08473146},"labels":[],"label_agreement":null},{"id":"W2129905147","doi":"10.1007/978-3-540-30142-4_1","title":"Error Analysis of Digital Filters Using Theorem Proving","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fixed-point arithmetic; Automated theorem proving; Computer science; Digital filter; Algorithm; Fixed point; Mathematical proof; Parametric statistics; Floating point; Arithmetic; Filter (signal processing); Mathematics; Discrete mathematics; Programming language","score_opus":0.030259835712247527,"score_gpt":0.29045335749546014,"score_spread":0.2601935217832126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129905147","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.003501291,0.00044118337,0.9933494,0.00014224295,0.00006666843,0.000013098054,0.00002359411,0.00012567233,0.0023368343],"genre_scores_gemma":[0.47155765,0.0034075354,0.5057395,0.00041331231,0.000657715,0.00020855306,0.00029322633,0.00057025027,0.017152231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958443,0.0012786362,0.00023573573,0.00044999557,0.0019362164,0.00025506254],"domain_scores_gemma":[0.9748062,0.019893179,0.0008755234,0.0017749583,0.0024629429,0.00018720014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050098156,0.001581799,0.0015619552,0.0022762248,0.0007221134,0.002784107,0.0022502323,0.0015633374,0.00443334],"category_scores_gemma":[0.026086187,0.00071266165,0.0014304543,0.001648115,0.002661867,0.004758545,0.002722712,0.0031074584,0.00071612356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002876081,0.00008571444,0.0008867664,0.0005436614,0.00014790142,0.00015819774,0.0002525573,0.21728571,0.006772544,0.64024013,0.0036703502,0.12966883],"study_design_scores_gemma":[0.000021295196,0.000044352786,0.0001940264,0.000057129564,0.000040484898,0.00009141292,0.000025308937,0.67097753,0.0048653767,0.32138082,0.002280043,0.00002219621],"about_ca_topic_score_codex":0.0013979418,"about_ca_topic_score_gemma":0.001037344,"teacher_disagreement_score":0.0050098156,"about_ca_system_score_codex":0.0016842418,"about_ca_system_score_gemma":0.00094925606,"threshold_uncertainty_score":0.026494741},"labels":[],"label_agreement":null},{"id":"W2130017876","doi":"10.1007/978-3-642-23629-7_46","title":"Hippocampal Surface Mapping of Genetic Risk Factors in AD via Sparse Learning Models","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"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":"National Center for Advancing Translational Sciences; National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; School of Medicine, Indiana University; National Institute on Aging; National Institutes of Health; Alzheimer's Disease Neuroimaging Initiative","keywords":"SNP; Single-nucleotide polymorphism; Computational biology; Artificial intelligence; Computer science; Multivariate statistics; Hippocampal formation; Pattern recognition (psychology); Biology; Genetics; Machine learning; Neuroscience; Genotype; Gene","score_opus":0.034022032330623814,"score_gpt":0.24373723942290973,"score_spread":0.20971520709228592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130017876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29277986,0.0010669798,0.7016139,0.0014211609,0.00007275022,0.00003687772,0.00092024595,0.0007611556,0.0013271277],"genre_scores_gemma":[0.9667631,0.0004798691,0.030216767,0.0000823499,0.00007475204,0.000036820165,0.0006077678,0.00004195225,0.0016965559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990904,0.000031456384,0.0000047296876,0.00002268832,0.000015764257,0.000016293045],"domain_scores_gemma":[0.99926895,0.00049484597,0.00007560824,0.000055528006,0.000076692915,0.000028346736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044766374,0.00043358974,0.0008124762,0.0008344607,0.00017205319,0.00064830494,0.00062008126,0.0006483337,0.0008913573],"category_scores_gemma":[0.0027082814,0.00030370883,0.0007880113,0.0010112566,0.0003091882,0.0005142113,0.00046287,0.0008024265,0.00023871871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005671669,0.00013613433,0.018285975,0.00014091375,0.00022868067,0.00027182658,0.00013004841,0.70358956,0.0070328554,0.010389838,0.0056747906,0.25355217],"study_design_scores_gemma":[0.000015097369,0.000020165035,0.0016533231,0.000005271286,0.000019423527,0.000052657215,0.000012144458,0.9879749,0.00046499737,0.009602821,0.00017201246,0.0000072216553],"about_ca_topic_score_codex":0.009403311,"about_ca_topic_score_gemma":0.008340506,"teacher_disagreement_score":0.009403311,"about_ca_system_score_codex":0.00036859684,"about_ca_system_score_gemma":0.0005484902,"threshold_uncertainty_score":0.018697143},"labels":[],"label_agreement":null},{"id":"W2130189990","doi":"10.1007/978-3-642-02882-3_23","title":"Approximation Algorithms for a Network Design Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Computer science; Path (computing); Tree (set theory); Mathematical optimization; Constraint (computer-aided design); Routing (electronic design automation); Integer (computer science); Class (philosophy); Algorithm; Mathematics; Combinatorics","score_opus":0.03091854809030773,"score_gpt":0.26336024853421175,"score_spread":0.23244170044390403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130189990","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.0024199062,0.0008145245,0.98715186,0.0003820535,0.00011400577,0.000055714583,0.00006677746,0.00015597284,0.008839329],"genre_scores_gemma":[0.1288357,0.0032307738,0.8457327,0.00032750636,0.00037512678,0.00058076944,0.00046561917,0.0003398163,0.020111943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989801,0.00044336505,0.000036542053,0.00015313755,0.00029868633,0.00008817446],"domain_scores_gemma":[0.9972869,0.0021520325,0.000109773864,0.00020344977,0.00019206747,0.000055747252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022864584,0.0022505994,0.0017538305,0.0011694155,0.0006896901,0.0019598475,0.0023533292,0.002717326,0.008580183],"category_scores_gemma":[0.0076579927,0.0011256658,0.0017029649,0.002392317,0.001140432,0.0027530799,0.001653917,0.004053795,0.0015123831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010397004,0.00011464672,0.00024017316,0.00026351638,0.000053922846,0.0000530409,0.00009215971,0.6937091,0.0005170217,0.13724378,0.011492092,0.15611672],"study_design_scores_gemma":[0.000036262813,0.000025568981,0.0000525156,0.000048964022,0.00002073892,0.00004598994,0.00002103616,0.9063834,0.00022250175,0.08773188,0.005403971,0.0000072436183],"about_ca_topic_score_codex":0.0035015412,"about_ca_topic_score_gemma":0.0030792332,"teacher_disagreement_score":0.008580183,"about_ca_system_score_codex":0.0020494012,"about_ca_system_score_gemma":0.0012195371,"threshold_uncertainty_score":0.02870357},"labels":[],"label_agreement":null},{"id":"W2130324230","doi":"10.1007/3-540-45486-1_9","title":"Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Partition (number theory); Base (topology); Simple (philosophy); Data mining; Point (geometry); Process (computing); Artificial intelligence; Mathematics","score_opus":0.011208826655194036,"score_gpt":0.23306893811667656,"score_spread":0.22186011146148252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130324230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039166942,0.00025145552,0.9463187,0.001588506,0.00016627727,0.00071844895,0.00025994107,0.003335339,0.00819447],"genre_scores_gemma":[0.30863586,0.00014748148,0.68600976,0.00034633421,0.00009995394,0.00025330367,0.00053759135,0.00029295112,0.0036767724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753976,0.00042155845,0.00019366693,0.0005578456,0.0011023749,0.00018476778],"domain_scores_gemma":[0.99313825,0.002913005,0.0005795899,0.0015775423,0.0013947504,0.0003967672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003965657,0.00060013926,0.0010023372,0.0030557532,0.002029735,0.0021604963,0.004665501,0.0023994104,0.007072965],"category_scores_gemma":[0.015989674,0.00083160785,0.00063262595,0.0023614676,0.0010106541,0.0051329834,0.0023039598,0.0016532345,0.0016026496],"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.0007554689,0.001065231,0.0050939834,0.00014475927,0.00014054654,0.00050699856,0.00068368384,0.10672405,0.009010713,0.02967946,0.026310518,0.8198846],"study_design_scores_gemma":[0.00019051839,0.00018452948,0.0034207862,0.00007400911,0.00019460573,0.000947792,0.0003796615,0.9029439,0.011843401,0.062069308,0.017637437,0.00011405106],"about_ca_topic_score_codex":0.0060984176,"about_ca_topic_score_gemma":0.009265767,"teacher_disagreement_score":0.007072965,"about_ca_system_score_codex":0.0013975105,"about_ca_system_score_gemma":0.0019034831,"threshold_uncertainty_score":0.023661375},"labels":[],"label_agreement":null},{"id":"W2130404621","doi":"10.1007/978-3-540-39432-7_94","title":"Low-Level Visual Homing","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Snapshot (computer storage); Computer science; sort; Computer vision; Artificial intelligence; Information retrieval","score_opus":0.02223544003339328,"score_gpt":0.28469461504430704,"score_spread":0.26245917501091376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130404621","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035236444,0.00070033205,0.8639305,0.00017519074,0.0001816155,0.000054109183,0.0001584482,0.0056802877,0.09388299],"genre_scores_gemma":[0.60740995,0.0009887308,0.26467294,0.0002917378,0.000105021194,0.00009085871,0.00068486703,0.0010853297,0.12467053],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999018,0.000008527717,0.0000031713107,0.000024860741,0.00003793939,0.000023706118],"domain_scores_gemma":[0.9998658,0.000032707023,0.000007746774,0.000050015286,0.00002621567,0.000017500848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113819384,0.00053390145,0.0003732597,0.00036957697,0.00036311033,0.0011276202,0.000843054,0.00062562333,0.02504105],"category_scores_gemma":[0.00044383827,0.00020860463,0.00027389842,0.00027205655,0.0005382526,0.0013708423,0.00153904,0.00072117435,0.0049619013],"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.00022125652,0.000062898696,0.0005033112,0.00031643698,0.000028635983,0.00029550737,0.00023052389,0.010570659,0.19518453,0.087877266,0.016484773,0.68822426],"study_design_scores_gemma":[0.000048825063,0.000548523,0.0049101547,0.000284942,0.000070066984,0.0025757493,0.00051562686,0.37376907,0.19002734,0.28140485,0.14573829,0.0001065172],"about_ca_topic_score_codex":0.00039225057,"about_ca_topic_score_gemma":0.0005932961,"teacher_disagreement_score":0.02504105,"about_ca_system_score_codex":0.00021642559,"about_ca_system_score_gemma":0.00013294048,"threshold_uncertainty_score":0.08377063},"labels":[],"label_agreement":null},{"id":"W2130492096","doi":"10.1007/978-3-642-39200-9_32","title":"A Framework for Migrating Web Applications to Web Services","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Web service; Legacy system; Service-oriented architecture; Computer science; Web modeling; World Wide Web; Web development; WS-Policy; Web engineering; Web application; Web standards; Business Process Execution Language; Restructuring; Data Web; Web application security; Software engineering; Software; Business; Operating system","score_opus":0.013901587840865388,"score_gpt":0.26264815575052636,"score_spread":0.24874656790966096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130492096","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.0019850838,0.00032154954,0.971199,0.00031770734,0.00023458617,0.00035851487,0.00014107751,0.020917851,0.004524636],"genre_scores_gemma":[0.029220209,0.0007929279,0.94590276,0.00031621568,0.00010890117,0.0006089854,0.0009545468,0.0037382464,0.018357273],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980242,0.00027978,0.0002843293,0.00029094846,0.0008153267,0.00030544982],"domain_scores_gemma":[0.9988034,0.00023554002,0.00008115211,0.00038560672,0.00025385115,0.00024047236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035573586,0.001643965,0.0015303261,0.0022092285,0.002717703,0.0068961955,0.005917295,0.003551922,0.008996637],"category_scores_gemma":[0.0041616885,0.0023246007,0.002706246,0.0016408813,0.0018534588,0.006623702,0.00557002,0.0050040623,0.00553632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042897312,0.0006086793,0.0013035029,0.00095536624,0.00025666822,0.0012791611,0.0019746947,0.05170334,0.030488214,0.40970728,0.06919688,0.43209735],"study_design_scores_gemma":[0.00021014534,0.0001998638,0.0005472546,0.00050410145,0.00031135685,0.0010148847,0.00039294743,0.36097732,0.030806035,0.16558863,0.43913934,0.00030816454],"about_ca_topic_score_codex":0.012608963,"about_ca_topic_score_gemma":0.0138040995,"teacher_disagreement_score":0.012608963,"about_ca_system_score_codex":0.0017488461,"about_ca_system_score_gemma":0.0042130607,"threshold_uncertainty_score":0.03009677},"labels":[],"label_agreement":null},{"id":"W2130518870","doi":"10.1007/978-3-540-69134-1_30","title":"Improving Situated Agents Adaptability Using Interruption Theory of Emotions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Université de Sherbrooke","funders":"","keywords":"Adaptability; Situated; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.11392416125194073,"score_gpt":0.36690075677989675,"score_spread":0.25297659552795604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130518870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08457353,0.00026035338,0.90884286,0.000090940186,0.00007225659,0.00006828217,0.000017365393,0.0015786294,0.0044958615],"genre_scores_gemma":[0.846698,0.00013740247,0.14977063,0.00004821809,0.000027319322,0.00008314004,0.000049914077,0.00018337103,0.0030019935],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996401,0.000099990204,0.000023333414,0.00008724437,0.00009197335,0.00005734638],"domain_scores_gemma":[0.9991691,0.0003986679,0.000060257393,0.0002172673,0.000098111304,0.00005651429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061728095,0.00063519244,0.000633978,0.00022550081,0.00031182286,0.0007437227,0.0010690821,0.0004950334,0.002756901],"category_scores_gemma":[0.002762284,0.00027119677,0.0005442716,0.0001987845,0.00034454858,0.0012077626,0.00153472,0.0011598725,0.0005512315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006051208,0.0006961495,0.0041723163,0.00032152177,0.00018218417,0.00033775237,0.000932791,0.26038337,0.13052185,0.025671866,0.0029069823,0.5732681],"study_design_scores_gemma":[0.000060041493,0.0002621284,0.001386834,0.0000130501085,0.000084095474,0.00010690515,0.00016069697,0.9582991,0.019678311,0.01727787,0.0026495818,0.000021362157],"about_ca_topic_score_codex":0.0006759775,"about_ca_topic_score_gemma":0.0006560292,"teacher_disagreement_score":0.002756901,"about_ca_system_score_codex":0.00028225276,"about_ca_system_score_gemma":0.00022791354,"threshold_uncertainty_score":0.009222746},"labels":[],"label_agreement":null},{"id":"W2130550680","doi":"10.1007/978-3-642-14295-6_43","title":"Abstract Analysis of Symbolic Executions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Computer science; Symbolic execution; Matching (statistics); Programming language; Theoretical computer science; Symbolic data analysis; Model checking; Software; Mathematics","score_opus":0.0242290981888959,"score_gpt":0.29092688373530423,"score_spread":0.26669778554640833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130550680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043434348,0.0005241051,0.9275628,0.00035752298,0.00007304223,0.00010087175,0.0003727533,0.0023645042,0.025210112],"genre_scores_gemma":[0.8019946,0.00076898717,0.18035382,0.00010276289,0.0001450782,0.00022208196,0.0011258338,0.0011081385,0.014178729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752206,0.0005192118,0.00012372437,0.00033405772,0.0011948381,0.00030618368],"domain_scores_gemma":[0.99422944,0.0039151134,0.00032184625,0.0008294071,0.00061492505,0.00008930557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615763,0.0011246487,0.00092812575,0.0023068003,0.0008097571,0.0023391296,0.0013961582,0.00069489825,0.011384968],"category_scores_gemma":[0.008758079,0.00062614103,0.0015641765,0.0019600014,0.002799437,0.0035213716,0.0017392683,0.001961864,0.0014241488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003253471,0.00007813806,0.0015361855,0.00047176023,0.00009691238,0.00029737942,0.00057101314,0.113085985,0.013680471,0.75209033,0.0033886903,0.11437777],"study_design_scores_gemma":[0.000023788098,0.00004547025,0.0005549102,0.00008961453,0.000066479544,0.00008411218,0.00009662557,0.35814154,0.015644467,0.6193876,0.0058399714,0.000025412437],"about_ca_topic_score_codex":0.0013956479,"about_ca_topic_score_gemma":0.0014611079,"teacher_disagreement_score":0.011384968,"about_ca_system_score_codex":0.0015774365,"about_ca_system_score_gemma":0.0013844715,"threshold_uncertainty_score":0.038086474},"labels":[],"label_agreement":null},{"id":"W2130572687","doi":"10.1007/11566489_21","title":"Maximum a Posteriori Local Histogram Estimation for Image Registration","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Maximum a posteriori estimation; Artificial intelligence; Histogram; Image registration; Estimator; Pattern recognition (psychology); Principle of maximum entropy; Computer science; A priori and a posteriori; Image histogram; Mathematics; Computer vision; Histogram matching; Context (archaeology); Image (mathematics); Maximum likelihood; Image processing; Statistics; Image texture; Geography","score_opus":0.012797552459452731,"score_gpt":0.29649503772293184,"score_spread":0.2836974852634791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130572687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019928084,0.00017216601,0.9969529,0.000026010413,0.000010515984,0.000016613818,0.000026318872,0.00056505133,0.00023769311],"genre_scores_gemma":[0.10631696,0.0005229552,0.88765615,0.00006692103,0.000059450675,0.00015494436,0.00036684965,0.00070307247,0.004152654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891984,0.00045531165,0.000052821106,0.00020203087,0.0002957145,0.00007434244],"domain_scores_gemma":[0.9981034,0.0011273797,0.00014533871,0.00033003042,0.00024981165,0.000043949913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017189059,0.00070634874,0.001703371,0.0016527198,0.0005375561,0.001067909,0.0014499901,0.001497799,0.0042069573],"category_scores_gemma":[0.0056331144,0.0010550136,0.0011254112,0.001756539,0.00082076306,0.001632579,0.0016862289,0.00152712,0.0024034018],"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.000660598,0.0001522536,0.0005531987,0.00036751322,0.00021745996,0.00010865447,0.0001388374,0.17465767,0.073208764,0.0130758025,0.0042739427,0.7325853],"study_design_scores_gemma":[0.00004130396,0.00008192212,0.0009957121,0.000021120075,0.00006438824,0.00016717643,0.00002860035,0.9518245,0.027211362,0.01630937,0.0032104333,0.00004417285],"about_ca_topic_score_codex":0.0028978111,"about_ca_topic_score_gemma":0.0035342148,"teacher_disagreement_score":0.0042069573,"about_ca_system_score_codex":0.00049081387,"about_ca_system_score_gemma":0.0011456296,"threshold_uncertainty_score":0.01407367},"labels":[],"label_agreement":null},{"id":"W2130628061","doi":"10.1007/978-3-319-08434-3_19","title":"Realms: A Structure for Consolidating Knowledge about Mathematical Theories","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Realm; Computer science; Mathematical theory; Mathematical structure; Theoretical computer science; Mathematics; Mathematics education","score_opus":0.020010870312411423,"score_gpt":0.2717112692055878,"score_spread":0.25170039889317636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130628061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056338646,0.0027689706,0.90473855,0.0029036724,0.000547273,0.00015687048,0.0019309195,0.0053093606,0.07601053],"genre_scores_gemma":[0.16327664,0.004354291,0.7814089,0.0012999829,0.0008131718,0.00054599164,0.005153156,0.0026784213,0.040469494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747664,0.0007912621,0.00033296875,0.00055758073,0.00067304785,0.00016860219],"domain_scores_gemma":[0.99536777,0.0022008969,0.00022608392,0.001591841,0.00037293354,0.00024052327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035286222,0.0010053081,0.0015842076,0.0050258976,0.002664684,0.009170411,0.003972751,0.0018065331,0.02214716],"category_scores_gemma":[0.009171378,0.002249913,0.0031353335,0.0046188296,0.008868668,0.036834627,0.010905547,0.0075308825,0.006796334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151472195,0.000007892176,0.00008612582,0.000091504975,0.000011848553,0.00003417606,0.0005551066,0.0003131439,0.00023001737,0.9703958,0.0039276746,0.024331573],"study_design_scores_gemma":[0.0000073646956,0.0000067632604,0.00005835777,0.00007355975,0.000016820764,0.00007377409,0.000135234,0.0021627105,0.0005607956,0.9155315,0.0813571,0.000015950995],"about_ca_topic_score_codex":0.0015806358,"about_ca_topic_score_gemma":0.0023595518,"teacher_disagreement_score":0.02214716,"about_ca_system_score_codex":0.0016016603,"about_ca_system_score_gemma":0.0018541806,"threshold_uncertainty_score":0.07408959},"labels":[],"label_agreement":null},{"id":"W2130637684","doi":"10.1007/11559573_57","title":"Image Space I 3 and Eigen Curvature for Illumination Insensitive Face Detection","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"York University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Curvature; Face (sociological concept); Brightness; Image (mathematics); Facial recognition system; Image processing; Principal component analysis; Face detection; Space (punctuation); Pattern recognition (psychology); Optics; Mathematics; Physics; Geometry","score_opus":0.011242801045293122,"score_gpt":0.23729067603101314,"score_spread":0.22604787498572002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130637684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004674286,0.00070389244,0.9911341,0.000101523416,0.00006761086,0.000022326187,0.00008161713,0.0011881742,0.0020264331],"genre_scores_gemma":[0.17795052,0.0016743026,0.8009179,0.00018459103,0.00017737679,0.00013232937,0.00068926584,0.00091638416,0.01735727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.000095009746,0.000025761225,0.000110465255,0.0002103658,0.000038034734],"domain_scores_gemma":[0.9995478,0.000099323704,0.000044407643,0.00018071629,0.00010800494,0.000019720737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191983,0.00081357977,0.00073186215,0.0010330658,0.00034913674,0.0010006297,0.001081248,0.00093663385,0.0047362996],"category_scores_gemma":[0.0015789932,0.0004859063,0.0009035208,0.0011559312,0.0007394997,0.0014393822,0.0011636972,0.0011584492,0.0029094368],"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.00023508238,0.00009650164,0.000688414,0.0002395878,0.000061341285,0.0001794777,0.00016252979,0.03797292,0.074876055,0.08587726,0.013452148,0.78615874],"study_design_scores_gemma":[0.0000067467204,0.000084341766,0.0018127833,0.000030995725,0.000020648193,0.0005430586,0.000058531812,0.8993716,0.03268953,0.054815482,0.010507916,0.000058388367],"about_ca_topic_score_codex":0.002289199,"about_ca_topic_score_gemma":0.0024404586,"teacher_disagreement_score":0.0047362996,"about_ca_system_score_codex":0.00039787916,"about_ca_system_score_gemma":0.00037465934,"threshold_uncertainty_score":0.015844524},"labels":[],"label_agreement":null},{"id":"W2130815094","doi":"10.1007/978-3-642-21593-3_11","title":"A Class of Image Metrics Based on the Structural Similarity Quality Index","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":30,"is_retracted":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":"Metric (unit); Computer science; Norm (philosophy); Similarity (geometry); Index (typography); Class (philosophy); Scalar (mathematics); Pattern recognition (psychology); Feature (linguistics); Algorithm; Image (mathematics); Structural similarity; Artificial intelligence; Data mining; Mathematics; Geometry","score_opus":0.025887249203038608,"score_gpt":0.27116588431453476,"score_spread":0.24527863511149614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130815094","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.01268244,0.0070026666,0.973842,0.00025464763,0.0002681734,0.00013903993,0.00045735968,0.00058579986,0.0047677886],"genre_scores_gemma":[0.30727643,0.008599588,0.67293787,0.0003977389,0.0014969818,0.0006438792,0.0023129457,0.0006779004,0.0056567374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960898,0.0006261763,0.00031435688,0.0005865579,0.0022775703,0.000105533414],"domain_scores_gemma":[0.9947643,0.0014891687,0.0011342306,0.00078501145,0.0016442131,0.0001830653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023985682,0.0017251455,0.0019709622,0.006819474,0.00048623595,0.0029537643,0.0017443831,0.0015655794,0.0015910395],"category_scores_gemma":[0.010639011,0.00037466647,0.0011297555,0.006535756,0.00128349,0.00469063,0.0015150583,0.0016839308,0.00093356636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002665591,0.00020231033,0.0062738727,0.0010166203,0.00042111424,0.00014088817,0.00018830512,0.03192136,0.035646755,0.13448796,0.011360207,0.7780741],"study_design_scores_gemma":[0.00007172344,0.0012334172,0.018112691,0.00037977143,0.0003682124,0.0022952608,0.00024700488,0.64280725,0.031744935,0.25205952,0.05038042,0.00029983517],"about_ca_topic_score_codex":0.000764182,"about_ca_topic_score_gemma":0.0007573374,"teacher_disagreement_score":0.006819474,"about_ca_system_score_codex":0.0009475613,"about_ca_system_score_gemma":0.000640857,"threshold_uncertainty_score":0.012685001},"labels":[],"label_agreement":null},{"id":"W2130851214","doi":"10.1007/978-3-642-55195-6_12","title":"Effects of Segmented Finite Difference Time Domain on GPU","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","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 Manitoba","funders":"","keywords":"Finite-difference time-domain method; Computer science; Computational science; Bounded function; Redundancy (engineering); Computational electromagnetics; Algorithm; Parallel computing; Finite difference method; Memory hierarchy; Electromagnetic field; Mathematics; Optics","score_opus":0.006773701036972015,"score_gpt":0.22558638880636872,"score_spread":0.21881268776939672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130851214","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.5211057,0.003304625,0.3788798,0.0007700538,0.0011816537,0.00011328107,0.0005969656,0.0044073323,0.089640595],"genre_scores_gemma":[0.9206328,0.00052776275,0.063019,0.0001676463,0.000065938366,0.00002875457,0.00028687975,0.00091831194,0.014352868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.00008123455,0.000009944028,0.000029239196,0.000118967735,0.000037998994],"domain_scores_gemma":[0.99830186,0.0011125566,0.00006386206,0.00015575276,0.00028746878,0.00007837792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026887428,0.0006281988,0.00046058837,0.0003624021,0.00042477183,0.0008630419,0.00054392696,0.00066678046,0.010921663],"category_scores_gemma":[0.0027098544,0.0002843376,0.00033674264,0.0005931813,0.00042625424,0.00080741785,0.0005607896,0.00065678085,0.0006917406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002404133,0.00040342464,0.0031464933,0.0008031427,0.00012898297,0.001034269,0.0007602835,0.49074778,0.3068063,0.032791246,0.011922248,0.14905179],"study_design_scores_gemma":[0.00008327424,0.00020364196,0.0017656138,0.00005508775,0.00008269587,0.00027564188,0.00012837745,0.9020682,0.08020699,0.0037487384,0.011349332,0.000032419153],"about_ca_topic_score_codex":0.0030907877,"about_ca_topic_score_gemma":0.0027407543,"teacher_disagreement_score":0.010921663,"about_ca_system_score_codex":0.00039777943,"about_ca_system_score_gemma":0.00037794694,"threshold_uncertainty_score":0.036536574},"labels":[],"label_agreement":null},{"id":"W2130970968","doi":"10.1007/11866763_12","title":"Evaluation of Texture Features for Analysis of Ovarian Follicular Development","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Reproductive Biology and Fertility","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canadian Institutes of Health Research","keywords":"Ovulation; Follicular phase; Follicle; Ovary; Ovarian follicle; Texture (cosmology); Menstrual cycle; Biology; Gynecology; Andrology; Medicine; Endocrinology; Computer science; Artificial intelligence; Image (mathematics); Hormone","score_opus":0.030133468011574818,"score_gpt":0.32249419185093103,"score_spread":0.29236072383935624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130970968","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.7801303,0.002151626,0.21337217,0.00013453062,0.0000806274,0.00015782495,0.0010485383,0.0009677396,0.0019565553],"genre_scores_gemma":[0.8992247,0.0009737443,0.097530395,0.00003192103,0.000051382085,0.00008254455,0.0008502234,0.00013260912,0.00112257],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980813,0.00003097615,0.000015542844,0.000027677639,0.00007498599,0.000042811178],"domain_scores_gemma":[0.99902236,0.00047275602,0.00007688113,0.000049552815,0.0002944121,0.00008405119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057347503,0.00038934321,0.00061041256,0.0019809222,0.00017182465,0.00069281267,0.00031171553,0.00041395728,0.0013191572],"category_scores_gemma":[0.001296516,0.00017425498,0.00040352752,0.0010601494,0.00014014843,0.00040842293,0.00024762732,0.00025682052,0.0003419984],"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.002179008,0.0001902504,0.015189954,0.0003421667,0.00010670767,0.0001918738,0.00007290459,0.0062811053,0.5144746,0.00025068704,0.0010706465,0.45965],"study_design_scores_gemma":[0.0001954819,0.0012693558,0.1668014,0.00006786527,0.00057219045,0.0018769081,0.0003106549,0.5354167,0.28927568,0.0006040931,0.0035174515,0.000092210714],"about_ca_topic_score_codex":0.001669255,"about_ca_topic_score_gemma":0.0018680877,"teacher_disagreement_score":0.0019809222,"about_ca_system_score_codex":0.00017910941,"about_ca_system_score_gemma":0.0002746536,"threshold_uncertainty_score":0.0044130683},"labels":[],"label_agreement":null},{"id":"W2131091367","doi":"10.1007/3-540-39799-x_27","title":"Trapdoor Rings And Their Use In Cryptography","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"National Circus School","funders":"","keywords":"Cryptosystem; Public key cryptosystem; Cryptography; Public-key cryptography; Computer science; Factorization; Key (lock); Hybrid cryptosystem; Theoretical computer science; Computer security; Basis (linear algebra); Algebra over a field; Arithmetic; Mathematics; Encryption; Algorithm; Pure mathematics","score_opus":0.02449634652615153,"score_gpt":0.24023737550854432,"score_spread":0.21574102898239278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131091367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037754204,0.13478401,0.42774782,0.0038549083,0.0025561126,0.00016104066,0.00028218646,0.0009395323,0.39192018],"genre_scores_gemma":[0.644871,0.086063534,0.14161234,0.0011187115,0.003486942,0.00034858528,0.00019043022,0.0003465418,0.121961914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927753,0.0002424374,0.00004004685,0.00009887144,0.0002679796,0.00007308527],"domain_scores_gemma":[0.998804,0.0008535888,0.00006198083,0.00017519524,0.00007119582,0.00003395307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010485137,0.0008705055,0.0008486422,0.0018052652,0.0013568908,0.003957762,0.00083830085,0.0013692322,0.0059806365],"category_scores_gemma":[0.0034191487,0.0007659164,0.0006136558,0.0023883667,0.00445934,0.0053443382,0.001629716,0.0035852357,0.0017695465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026440286,0.000018217692,0.000035776877,0.00009981953,0.0000068586482,0.00005346604,0.00022249766,0.0010364796,0.0006716465,0.9730204,0.0025123649,0.022296095],"study_design_scores_gemma":[0.000013681269,0.00003860096,0.000058080022,0.000072059986,0.000012281786,0.00039454657,0.000056612287,0.004081387,0.0009923285,0.944005,0.050253205,0.000022191309],"about_ca_topic_score_codex":0.00020577556,"about_ca_topic_score_gemma":0.00016322329,"teacher_disagreement_score":0.0059806365,"about_ca_system_score_codex":0.0007389569,"about_ca_system_score_gemma":0.0004391324,"threshold_uncertainty_score":0.020007253},"labels":[],"label_agreement":null},{"id":"W2131198707","doi":"10.1007/3-540-36261-4_10","title":"Experimenting with Gnutella Communities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Java; The Internet; Distributed computing; Host (biology); Software; Peer-to-peer; World Wide Web; Operating system","score_opus":0.026088979673936814,"score_gpt":0.2371510652515974,"score_spread":0.2110620855776606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131198707","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.9193626,0.0003519693,0.056653004,0.001364965,0.0002445058,0.0003228933,0.00051484973,0.006535207,0.014650047],"genre_scores_gemma":[0.9411937,0.00011845811,0.052744783,0.00021546599,0.000040704992,0.00017163578,0.000612272,0.00053866784,0.004364318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99455726,0.0029556863,0.00014866986,0.0006622551,0.0011584986,0.0005177051],"domain_scores_gemma":[0.9755163,0.016393287,0.0006787846,0.0046530417,0.0015800152,0.0011785238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005700486,0.00071307604,0.0008147423,0.0009934485,0.0024139015,0.0016858388,0.0024126333,0.0021144212,0.0032401478],"category_scores_gemma":[0.027237829,0.0005973718,0.0006174769,0.0014633079,0.0014764062,0.003916235,0.0027241611,0.0019612527,0.0010126502],"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.011626292,0.008475751,0.041477025,0.001925738,0.0013160539,0.0019914345,0.0075441403,0.41403267,0.12856007,0.08220976,0.037904665,0.26293644],"study_design_scores_gemma":[0.00135828,0.0013591558,0.0028105376,0.00006579412,0.00015122052,0.00050907035,0.0016055906,0.89981395,0.041260656,0.036293756,0.014663388,0.00010866213],"about_ca_topic_score_codex":0.005240134,"about_ca_topic_score_gemma":0.007078553,"teacher_disagreement_score":0.005700486,"about_ca_system_score_codex":0.00092035613,"about_ca_system_score_gemma":0.0011965996,"threshold_uncertainty_score":0.030147374},"labels":[],"label_agreement":null},{"id":"W2131202735","doi":"10.1007/978-3-642-33418-4_55","title":"Fast 3D Spine Reconstruction of Postoperative Patients Using a Multilevel Statistical Model","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Scoliosis diagnosis and treatment","field":"Medicine","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":"Centre Hospitalier Universitaire Sainte-Justine; National Research Council Canada","funders":"","keywords":"Computer science; Statistical model; Scoliosis; Algorithm; Artificial intelligence; Medicine; Surgery","score_opus":0.0369946291370032,"score_gpt":0.31908922533635803,"score_spread":0.28209459619935484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131202735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03113749,0.00011744478,0.967072,0.000111299196,0.00002676648,0.000024353823,0.00025198926,0.0010250165,0.00023355214],"genre_scores_gemma":[0.49010268,0.0003104886,0.50665873,0.00007971224,0.000048849393,0.00018100953,0.0009859424,0.0003263869,0.0013061946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996793,0.00009339947,0.000025537232,0.000054229262,0.00010817874,0.000039338265],"domain_scores_gemma":[0.9988475,0.0007242882,0.00008482557,0.00013460328,0.00016142799,0.000047323883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009047144,0.000521113,0.001114795,0.00065364916,0.00037656553,0.00073753187,0.0010966758,0.00080218446,0.0028849165],"category_scores_gemma":[0.0022896,0.00078934414,0.0017814644,0.0007878311,0.00018323725,0.00065301877,0.0012273998,0.0012507001,0.00071227323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005773176,0.00009530152,0.0051345075,0.00013460848,0.00025203923,0.00016928377,0.00007499309,0.7606722,0.008002228,0.0044993265,0.0021015082,0.2182866],"study_design_scores_gemma":[0.000005533158,0.00002037379,0.00026816485,0.0000021820015,0.000010226001,0.000023146695,0.0000033902509,0.9986504,0.00041862376,0.00047595362,0.00011692417,0.0000051100974],"about_ca_topic_score_codex":0.0073734154,"about_ca_topic_score_gemma":0.010482471,"teacher_disagreement_score":0.0073734154,"about_ca_system_score_codex":0.00032757243,"about_ca_system_score_gemma":0.0012734582,"threshold_uncertainty_score":0.014661014},"labels":[],"label_agreement":null},{"id":"W2131239890","doi":"10.1007/978-3-319-20125-2_15","title":"Art Forgery Detection via Craquelure Pattern Matching","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing and 3D Reconstruction","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 Windsor","funders":"","keywords":"Computer science; Matching (statistics); Pattern matching; Artificial intelligence; Pattern recognition (psychology); Computer vision; Mathematics","score_opus":0.015019745686800522,"score_gpt":0.23373820763123285,"score_spread":0.2187184619444323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131239890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060417987,0.0013275234,0.9248776,0.00014444541,0.00023038987,0.00014108371,0.00018119552,0.0027614753,0.009918418],"genre_scores_gemma":[0.33160248,0.0011866692,0.6433881,0.00017051425,0.00012294314,0.00007284369,0.00066130375,0.00032731713,0.022467801],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991535,0.00006298528,0.00003881677,0.00019423568,0.0004412269,0.00010923486],"domain_scores_gemma":[0.99929154,0.00010152457,0.00007050378,0.00027041015,0.00023685627,0.000029196635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255751,0.0009213967,0.0010500872,0.0028261542,0.000575433,0.0013073363,0.0016601353,0.001393718,0.0057080695],"category_scores_gemma":[0.0014137351,0.00051304244,0.0010083162,0.0017803438,0.00056524255,0.0014679065,0.0013837335,0.0007069107,0.004235525],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038576903,0.000097191434,0.0012342819,0.0001654771,0.00006942826,0.00030463206,0.00007126726,0.0060276506,0.13264664,0.0037271997,0.0046247873,0.8506457],"study_design_scores_gemma":[0.000047243993,0.00044799346,0.0074300896,0.00007221899,0.00014682599,0.0051132357,0.00013649555,0.5937475,0.36205375,0.0053780708,0.025328897,0.00009770381],"about_ca_topic_score_codex":0.001080326,"about_ca_topic_score_gemma":0.0019533164,"teacher_disagreement_score":0.0057080695,"about_ca_system_score_codex":0.00029414357,"about_ca_system_score_gemma":0.00054178614,"threshold_uncertainty_score":0.01909542},"labels":[],"label_agreement":null},{"id":"W2131325046","doi":"10.1007/978-3-642-38457-8_30","title":"Classifying Organizational Roles Using Email Social Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Knowledge management; World Wide Web; Artificial intelligence","score_opus":0.01814002854880201,"score_gpt":0.2544399838711365,"score_spread":0.23629995532233447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131325046","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.9204771,0.0015183721,0.051343765,0.000711265,0.00020718672,0.00026920694,0.0035756282,0.00031419678,0.021583294],"genre_scores_gemma":[0.9663135,0.00050761545,0.025507005,0.000053742926,0.00014526208,0.00014674637,0.0026760285,0.00003824835,0.004611841],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.0005956257,0.00013247372,0.00018902455,0.00043470776,0.00018661543],"domain_scores_gemma":[0.99367416,0.0040682373,0.00076126726,0.0003607895,0.0006237856,0.00051176344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011666046,0.0005960799,0.00029909378,0.007003494,0.0007625987,0.0017927333,0.00059691904,0.000731003,0.0031956453],"category_scores_gemma":[0.0068367645,0.00016605051,0.0004128286,0.0036306665,0.0003521318,0.0028795637,0.0010034579,0.0005474845,0.0018692333],"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.00053393375,0.0007207288,0.49778387,0.00042259519,0.0001365649,0.00026780163,0.002103759,0.004188745,0.008049292,0.012820058,0.011626603,0.46134612],"study_design_scores_gemma":[0.000064103806,0.0005790476,0.49778575,0.00061098405,0.00036323996,0.0014808434,0.021241149,0.35756502,0.014262091,0.056611132,0.04930857,0.0001280575],"about_ca_topic_score_codex":0.0016626567,"about_ca_topic_score_gemma":0.0037993381,"teacher_disagreement_score":0.007003494,"about_ca_system_score_codex":0.0005298402,"about_ca_system_score_gemma":0.00036355475,"threshold_uncertainty_score":0.01069051},"labels":[],"label_agreement":null},{"id":"W2131651363","doi":"10.1007/978-3-540-92182-0_56","title":"A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Shortest path problem; Bounded function; Longest path problem; Euclidean shortest path; Curvature; Mathematics; Path (computing); Distance; Yen's algorithm; K shortest path routing; Widest path problem; Combinatorics; Algorithm; Discrete mathematics; Computer science; Dijkstra's algorithm; Graph; Geometry; Mathematical analysis","score_opus":0.029715775452179155,"score_gpt":0.2537242041369665,"score_spread":0.22400842868478735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131651363","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.008372912,0.0003189712,0.98191845,0.00017197542,0.00008968007,0.0001316812,0.00033643484,0.0022215294,0.006438316],"genre_scores_gemma":[0.08140734,0.0003095776,0.90999603,0.000092076465,0.00005610231,0.00025232407,0.0013265666,0.0005568625,0.006003067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852043,0.00019347758,0.00007554064,0.0003590229,0.000658151,0.00019331712],"domain_scores_gemma":[0.9984761,0.0006277114,0.00007039688,0.00040811248,0.00031343996,0.00010429069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008356427,0.0019760646,0.002583058,0.0013532264,0.0012391944,0.0024750717,0.0037944736,0.002184733,0.013134726],"category_scores_gemma":[0.0050451485,0.0012433254,0.00186399,0.0028144831,0.001132829,0.0038567004,0.0033841063,0.003403727,0.0029628922],"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.00055759,0.00027343468,0.00040284783,0.00037553662,0.00008837204,0.00010307264,0.00023885886,0.35797352,0.0047986656,0.08367426,0.02456539,0.52694845],"study_design_scores_gemma":[0.00012748674,0.000084805986,0.00014731388,0.000037972753,0.000036556503,0.00010921691,0.000063568994,0.92242706,0.0024301126,0.06580715,0.008702148,0.00002662019],"about_ca_topic_score_codex":0.006462752,"about_ca_topic_score_gemma":0.0068284385,"teacher_disagreement_score":0.013134726,"about_ca_system_score_codex":0.0020477246,"about_ca_system_score_gemma":0.0023614124,"threshold_uncertainty_score":0.043940008},"labels":[],"label_agreement":null},{"id":"W2131684748","doi":"10.1007/978-3-642-38616-9_2","title":"Quantum Algorithms for the Subset-Sum Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Lorentz Center","keywords":"Computer science; Heuristic; Exponent; Algorithm; Quantum algorithm; Quantum walk; Quantum; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.01990679447945905,"score_gpt":0.24691054623585224,"score_spread":0.22700375175639317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131684748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025744207,0.0045473445,0.8712808,0.0048040003,0.0010228633,0.0001707255,0.00038082732,0.00062755065,0.09142161],"genre_scores_gemma":[0.42473865,0.006767569,0.51493305,0.0015181587,0.0022311276,0.00065092475,0.00091668434,0.000634965,0.047608905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861395,0.00047761636,0.00007065581,0.0001726151,0.00053470937,0.00013039267],"domain_scores_gemma":[0.9981799,0.0011307207,0.00006906649,0.0003768873,0.00016742882,0.00007603366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013202683,0.0008687178,0.0016322489,0.000923896,0.0017055472,0.003099567,0.002469123,0.0015572321,0.012295753],"category_scores_gemma":[0.004558898,0.0006114134,0.0013544635,0.0021686184,0.0021296437,0.0063406997,0.0036522404,0.005111488,0.0024781346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043886055,0.00004505602,0.000044734563,0.000095377676,0.000018346287,0.00001132673,0.00006130815,0.0070210155,0.0004953438,0.9436753,0.006758516,0.041729692],"study_design_scores_gemma":[0.000018744806,0.000009023194,0.000027150134,0.00001426963,0.000005547008,0.000020166224,0.000013457452,0.023784593,0.00031425746,0.97289795,0.0028878413,0.000006950921],"about_ca_topic_score_codex":0.0005344896,"about_ca_topic_score_gemma":0.000708367,"teacher_disagreement_score":0.012295753,"about_ca_system_score_codex":0.0015323836,"about_ca_system_score_gemma":0.0011710235,"threshold_uncertainty_score":0.041133404},"labels":[],"label_agreement":null},{"id":"W2131712034","doi":"10.1007/978-3-540-30125-7_21","title":"BayesShrink Ridgelets for Image Denoising","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Image denoising; Artificial intelligence; Noise reduction; Wavelet; Biorthogonal system; Thresholding; Wavelet transform; Pattern recognition (psychology); Biorthogonal wavelet; Mathematics; Non-local means; Image (mathematics); Computer science; Computer vision","score_opus":0.020674178018725967,"score_gpt":0.281440908010867,"score_spread":0.26076672999214107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131712034","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.0015913146,0.00087945163,0.9946477,0.00011240733,0.00010495397,0.000009690761,0.00004346918,0.00048918923,0.0021217032],"genre_scores_gemma":[0.04127718,0.002582158,0.922317,0.00017921795,0.00024339101,0.000058998783,0.00036380434,0.0005780892,0.032400053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996221,0.000079670055,0.000018843375,0.000054743843,0.00020399365,0.000020566134],"domain_scores_gemma":[0.9995372,0.00016574495,0.000027308313,0.00011957428,0.00013458477,0.000015600608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007257253,0.0006572956,0.0007849303,0.0004895075,0.0002340539,0.00076896464,0.00066199293,0.001159819,0.006413711],"category_scores_gemma":[0.001519266,0.0005682335,0.0004360762,0.00079650595,0.0005219173,0.0008886572,0.0006194887,0.0016927989,0.005733097],"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.00017098611,0.00007961837,0.00023468814,0.00025142272,0.000052084746,0.00011764813,0.00008768124,0.030819343,0.057875466,0.09675331,0.02235512,0.79120255],"study_design_scores_gemma":[0.000028379174,0.0000851016,0.00054233416,0.00006076627,0.000051159594,0.000463371,0.00002380631,0.8025755,0.053018,0.09027226,0.05283665,0.00004269321],"about_ca_topic_score_codex":0.00047485225,"about_ca_topic_score_gemma":0.0010325434,"teacher_disagreement_score":0.006413711,"about_ca_system_score_codex":0.0002592863,"about_ca_system_score_gemma":0.0002888404,"threshold_uncertainty_score":0.021455944},"labels":[],"label_agreement":null},{"id":"W2131850161","doi":"10.1007/978-3-319-15579-1_53","title":"Bounding Clique-Width via Perfect Graphs","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Mathematics; Treewidth; Split graph; Block graph; Cograph; Discrete mathematics; Clique-sum; Chordal graph; Bounding overwatch; Induced subgraph; Graph isomorphism; Induced subgraph isomorphism problem; Perfect graph; Pathwidth; Graph; Line graph; 1-planar graph; Computer science; Vertex (graph theory); Voltage graph","score_opus":0.031815726654958944,"score_gpt":0.3255480907228837,"score_spread":0.29373236406792474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131850161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18242654,0.00292847,0.75733894,0.006385319,0.00046940357,0.00020199668,0.0022622978,0.00246943,0.045517683],"genre_scores_gemma":[0.83328134,0.0017210292,0.15026475,0.0010062319,0.00086908054,0.0002989344,0.0015814414,0.0009554523,0.010021771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99423295,0.0015754168,0.00017063494,0.0017377513,0.0014188767,0.00086436677],"domain_scores_gemma":[0.9594777,0.031465232,0.0017586531,0.004247675,0.0011663851,0.0018842977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047098696,0.0020647114,0.0023284268,0.0027374197,0.0018149293,0.004870363,0.0060278485,0.0031296483,0.008935919],"category_scores_gemma":[0.044051442,0.002372694,0.0018539893,0.0033919187,0.0041104113,0.015319569,0.007480418,0.005541846,0.0012016292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009952973,0.00028288737,0.005361577,0.0008018219,0.00024460867,0.00022192734,0.0006282466,0.20250984,0.0075222077,0.695751,0.021590605,0.064089954],"study_design_scores_gemma":[0.000059381928,0.00004617178,0.0005854605,0.000050540024,0.000058109836,0.00010934849,0.00007626812,0.33153418,0.0018019632,0.66260636,0.0030490325,0.000023080374],"about_ca_topic_score_codex":0.0024855505,"about_ca_topic_score_gemma":0.003607245,"teacher_disagreement_score":0.008935919,"about_ca_system_score_codex":0.0028209384,"about_ca_system_score_gemma":0.0016493386,"threshold_uncertainty_score":0.029893637},"labels":[],"label_agreement":null},{"id":"W2132052807","doi":"10.1007/978-3-540-74377-4_84","title":"Security Contexts in Autonomic Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Concordia University","funders":"","keywords":"Autonomic computing; Computer science; Context (archaeology); Computer security; Computer security model; Risk analysis (engineering); Business; Cloud computing; Geography","score_opus":0.027926840302810944,"score_gpt":0.2656843266129577,"score_spread":0.23775748631014676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132052807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061525714,0.02811074,0.5050252,0.008724467,0.0019371957,0.00012366528,0.00008481285,0.0006704442,0.39379773],"genre_scores_gemma":[0.92483,0.006752888,0.043842826,0.000508309,0.00088497304,0.00013919453,0.000068145804,0.00008372314,0.022889841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.00024954038,0.000043489017,0.0001168298,0.00014765191,0.00009547463],"domain_scores_gemma":[0.9991924,0.00040762938,0.00006401047,0.00015102107,0.000088811714,0.000096120886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081598316,0.00046986158,0.00043090506,0.00051276473,0.0011572852,0.004501082,0.0006460848,0.00094101916,0.0032980214],"category_scores_gemma":[0.002034998,0.0004888666,0.0003159585,0.0006254829,0.002656227,0.0055301483,0.0022002219,0.0024286753,0.0005869511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001486005,0.000013832795,0.00023789966,0.000042252854,0.0000068435647,0.00010702074,0.0004417706,0.0036305145,0.00038446626,0.9678853,0.0018646105,0.025370585],"study_design_scores_gemma":[0.0000069700986,0.00002064796,0.0002902753,0.00009250624,0.000013320244,0.00020992839,0.00041745367,0.01654671,0.00045019772,0.94317377,0.038764887,0.000013287801],"about_ca_topic_score_codex":0.00065291417,"about_ca_topic_score_gemma":0.00077000144,"teacher_disagreement_score":0.004501082,"about_ca_system_score_codex":0.0008698497,"about_ca_system_score_gemma":0.0005587877,"threshold_uncertainty_score":0.011032939},"labels":[],"label_agreement":null},{"id":"W2132124019","doi":"10.1007/978-3-540-85110-3_19","title":"High-Level Theories","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"McMaster University","funders":"","keywords":"Psychology; Computer science","score_opus":0.02640862028976003,"score_gpt":0.23673749192805923,"score_spread":0.21032887163829922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132124019","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00694905,0.005883417,0.26671675,0.0051027127,0.00076027255,0.00007462885,0.0011711864,0.0010259785,0.71231604],"genre_scores_gemma":[0.43890446,0.009507198,0.17844553,0.003210995,0.001952172,0.0003376411,0.0054463884,0.0012343074,0.36096138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991258,0.00024067918,0.00004884092,0.00018584877,0.00029798952,0.0001008411],"domain_scores_gemma":[0.9992397,0.00028586062,0.000034487508,0.0002520523,0.00013950813,0.00004842917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774915,0.0008570852,0.0008275179,0.0015162635,0.0017978761,0.0055132653,0.0014756958,0.0012616604,0.03564249],"category_scores_gemma":[0.0023383442,0.00068480906,0.001029871,0.0015807541,0.0037565983,0.007673518,0.0021515328,0.0043954276,0.010022215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033341653,0.000004032578,0.000032611333,0.000017747863,0.0000029064745,0.00000915078,0.00007381563,0.00013107044,0.00006112701,0.98916805,0.004547372,0.0059487033],"study_design_scores_gemma":[0.0000042908655,0.000002592588,0.000035998113,0.000019412691,0.0000038909416,0.000031292762,0.000038286766,0.00048239736,0.00015859197,0.9611755,0.038044944,0.0000028185066],"about_ca_topic_score_codex":0.0009464807,"about_ca_topic_score_gemma":0.0011425104,"teacher_disagreement_score":0.03564249,"about_ca_system_score_codex":0.0016365079,"about_ca_system_score_gemma":0.00087327865,"threshold_uncertainty_score":0.11923593},"labels":[],"label_agreement":null},{"id":"W2132190651","doi":"10.1007/978-3-642-54423-1_14","title":"Drawing HV-Restricted Planar Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Planar graph; Book embedding; Combinatorics; Planar straight-line graph; Outerplanar graph; Embedding; Graph drawing; Vertex (graph theory); Pathwidth; Planar; Graph; 1-planar graph; Mathematics; Graph embedding; Computer science; Discrete mathematics; Line graph; Artificial intelligence; Computer graphics (images)","score_opus":0.014444525577706322,"score_gpt":0.23467275329984832,"score_spread":0.220228227722142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132190651","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03908357,0.00052104366,0.85371995,0.00025258047,0.00021071552,0.00013329186,0.0007703049,0.0029870786,0.102321446],"genre_scores_gemma":[0.33311346,0.001529392,0.5944083,0.00024667484,0.00014856625,0.00016368712,0.0028511179,0.0022016775,0.06533712],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997788,0.0000384062,0.000008610574,0.00005387073,0.00009483351,0.000025420606],"domain_scores_gemma":[0.99974257,0.00007802421,0.00001638244,0.000086862354,0.000047235746,0.000029038942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015809065,0.0008026065,0.0005255666,0.00078278093,0.00030646854,0.0009871959,0.0011638941,0.00051122013,0.024161989],"category_scores_gemma":[0.0008411486,0.0006930392,0.0004654175,0.0008910792,0.0005482427,0.0012725409,0.0014555639,0.0016473798,0.0050092028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019404666,0.000091134345,0.00037733736,0.00063857,0.00006432135,0.00026633244,0.00037651727,0.07949364,0.038527593,0.22573373,0.037542637,0.61669415],"study_design_scores_gemma":[0.00008082014,0.00012768585,0.0009224665,0.00021750899,0.00006318962,0.0007668455,0.00041664444,0.3050378,0.025818886,0.48794436,0.17855467,0.00004910687],"about_ca_topic_score_codex":0.0010773224,"about_ca_topic_score_gemma":0.0022031467,"teacher_disagreement_score":0.024161989,"about_ca_system_score_codex":0.0003136628,"about_ca_system_score_gemma":0.00017845005,"threshold_uncertainty_score":0.08082992},"labels":[],"label_agreement":null},{"id":"W2132296708","doi":"10.1007/3-540-46885-4_36","title":"Cryptanalysis of Short RSA Secret Exponents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Exponent; Cryptanalysis; Mathematics; Fraction (chemistry); Discrete mathematics; Cryptography; Combinatorics; Algorithm","score_opus":0.021641674141118165,"score_gpt":0.25785824164665744,"score_spread":0.23621656750553927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132296708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24896944,0.012883226,0.610585,0.004141742,0.0025148562,0.00026160228,0.00049500243,0.0024551426,0.11769411],"genre_scores_gemma":[0.79419374,0.0045732637,0.12256549,0.00041255282,0.00094450585,0.00008620355,0.0004888661,0.00051063864,0.07622472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990578,0.0001627979,0.000052798183,0.000083354425,0.00052721176,0.00011598912],"domain_scores_gemma":[0.9988379,0.00053946907,0.00009421805,0.0003697958,0.00011363024,0.00004502844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007961004,0.0010499301,0.0007064824,0.0011875989,0.0005979178,0.0017603993,0.00069438916,0.00072978524,0.009115347],"category_scores_gemma":[0.003084126,0.00040331387,0.00066415576,0.001191083,0.0012321151,0.003070844,0.0014752826,0.0017930442,0.0036593492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017192474,0.00013979702,0.0015373941,0.00057771686,0.00015637722,0.000991776,0.0005894466,0.015731266,0.07888186,0.49190474,0.015138443,0.39263195],"study_design_scores_gemma":[0.00020051925,0.0005004868,0.0016185204,0.0003106956,0.0001347611,0.004017656,0.00019419056,0.08329196,0.20645407,0.615332,0.08784179,0.00010345409],"about_ca_topic_score_codex":0.000082613355,"about_ca_topic_score_gemma":0.00014182444,"teacher_disagreement_score":0.009115347,"about_ca_system_score_codex":0.0006362831,"about_ca_system_score_gemma":0.00048649646,"threshold_uncertainty_score":0.030493855},"labels":[],"label_agreement":null},{"id":"W2132474528","doi":"10.1007/978-3-319-11743-0_2","title":"MID: A MetaCASE Tool for a Better Reuse of Visual Notations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Reuse; Metamodeling; Programming language; Software engineering; Notation; Unified Modeling Language; Formal specification; Visual modeling; Redundancy (engineering); Code reuse; Coding (social sciences); Software; Operating system","score_opus":0.0158865372529544,"score_gpt":0.26479991501663835,"score_spread":0.24891337776368394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132474528","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.0036037834,0.00028725356,0.9403045,0.00024202744,0.00019573064,0.000119092074,0.0009630809,0.047230516,0.007053965],"genre_scores_gemma":[0.036774028,0.00051738956,0.90431,0.00032623185,0.000092731185,0.00036260913,0.0052257692,0.033259936,0.019131303],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99783915,0.0004080875,0.00028468188,0.00040314684,0.0009283393,0.00013673249],"domain_scores_gemma":[0.9943575,0.0025077355,0.00024683066,0.0017767844,0.0008057391,0.0003054476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026653202,0.0018015992,0.0010676745,0.0032005599,0.00087363814,0.00540337,0.0037636436,0.0022392182,0.028939247],"category_scores_gemma":[0.012280995,0.0015668194,0.0023008424,0.001978127,0.0007538627,0.0073904386,0.005973619,0.0044003613,0.0112819495],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006070361,0.00050731935,0.0017501916,0.0019333359,0.00024683765,0.00111367,0.00348907,0.0031530624,0.071825944,0.07430105,0.0814905,0.759582],"study_design_scores_gemma":[0.00031156463,0.000188989,0.0016306319,0.00081474386,0.00030827182,0.0030231506,0.00070527324,0.062083982,0.09964099,0.06097095,0.7699862,0.0003351169],"about_ca_topic_score_codex":0.0016413899,"about_ca_topic_score_gemma":0.0023124074,"teacher_disagreement_score":0.028939247,"about_ca_system_score_codex":0.0006587499,"about_ca_system_score_gemma":0.0011720391,"threshold_uncertainty_score":0.096811414},"labels":[],"label_agreement":null},{"id":"W2132608063","doi":"10.1007/11539087_15","title":"A Game-Theoretic Approach to Competitive Learning in Self-Organizing Maps","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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 Regina","funders":"","keywords":"Computer science; Self-organizing map; Cluster analysis; Competitive learning; Artificial intelligence; Process (computing); Quality (philosophy); Machine learning; Game theory; Feature (linguistics); Data mining; Unsupervised learning; Mathematics","score_opus":0.010786045639498002,"score_gpt":0.22288940402546117,"score_spread":0.21210335838596317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132608063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011246593,0.0017605353,0.948784,0.0020356125,0.00020091116,0.00009267009,0.00010449729,0.0000844369,0.03569083],"genre_scores_gemma":[0.7666767,0.0031267502,0.20486273,0.00069925364,0.0007509065,0.0005412798,0.00014509502,0.00009929691,0.023097979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984744,0.00089039904,0.00005724625,0.0001386313,0.00031408275,0.0001252329],"domain_scores_gemma":[0.99768746,0.0017583268,0.000102578626,0.000089176436,0.00021567871,0.00014691972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998147,0.0010592343,0.0016264074,0.000993787,0.0011610544,0.0034833632,0.0037679435,0.0028487407,0.006426321],"category_scores_gemma":[0.0060806507,0.0006166247,0.0012701893,0.0015767614,0.0035713473,0.003950111,0.0022515291,0.0024594748,0.0005615039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009785232,0.000026380447,0.00007713273,0.00006531709,0.000024600726,0.000027913411,0.00007497079,0.06234315,0.00015776802,0.930473,0.001383002,0.005336893],"study_design_scores_gemma":[0.000012241903,0.00001601122,0.000042030148,0.000012088968,0.000008360124,0.000017718614,0.000025555108,0.22690517,0.00005155307,0.7714165,0.0014825148,0.000010281687],"about_ca_topic_score_codex":0.0037726113,"about_ca_topic_score_gemma":0.0036302044,"teacher_disagreement_score":0.006426321,"about_ca_system_score_codex":0.0024804354,"about_ca_system_score_gemma":0.0016504594,"threshold_uncertainty_score":0.021498203},"labels":[],"label_agreement":null},{"id":"W2132852182","doi":"10.1007/978-3-642-13059-5_36","title":"Notes on Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"MacEwan University; University of Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Preprocessor; Isomorphism (crystallography); Computer science; Combinatorics; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Graph","score_opus":0.019263700183633534,"score_gpt":0.24087385403856237,"score_spread":0.22161015385492883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132852182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008501389,0.002230125,0.8912321,0.0024297622,0.0017677257,0.00048943714,0.0022936047,0.005222466,0.08583344],"genre_scores_gemma":[0.084234916,0.0031307018,0.83751184,0.0016034703,0.0014469268,0.00093314436,0.01006185,0.00330201,0.05777507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821967,0.00035032933,0.00012655626,0.00042048737,0.0007897459,0.00009306452],"domain_scores_gemma":[0.99682933,0.0020871174,0.00004716089,0.0007960032,0.00018754898,0.000052878422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011675217,0.0021008993,0.0015662361,0.0014879162,0.00085284613,0.0016333153,0.0030527797,0.0012607703,0.05835878],"category_scores_gemma":[0.005819712,0.0014623132,0.0030277788,0.003310015,0.0011610847,0.0033820437,0.0027045412,0.00426866,0.011499755],"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.00029858836,0.00044101948,0.00048593036,0.00091757573,0.00023126652,0.00038361372,0.0002253879,0.07200044,0.008246549,0.16385143,0.1318102,0.62110806],"study_design_scores_gemma":[0.00036206335,0.00022268711,0.0013150023,0.00019334332,0.00020415128,0.0005984826,0.000102735,0.22068182,0.008470875,0.6522542,0.115475774,0.00011888556],"about_ca_topic_score_codex":0.0037947495,"about_ca_topic_score_gemma":0.0064303875,"teacher_disagreement_score":0.05835878,"about_ca_system_score_codex":0.0014722891,"about_ca_system_score_gemma":0.0012387867,"threshold_uncertainty_score":0.19522959},"labels":[],"label_agreement":null},{"id":"W2132896555","doi":"10.1007/978-3-642-30850-5_8","title":"Compact Relaxations for Polynomial Programming Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Linearization; Relaxation (psychology); Extension (predicate logic); Mathematical optimization; Computer science; Quadratic programming; Constraint programming; Integer programming; Constraint (computer-aided design); Polynomial; Regular polygon; Constraint satisfaction; Linear programming; Class (philosophy); Linear inequality; Quadratic equation; Convex optimization; Mathematics; Stochastic programming; Inequality; Nonlinear system; Programming language; Artificial intelligence","score_opus":0.06770075026149787,"score_gpt":0.34969639258899227,"score_spread":0.2819956423274944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132896555","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.0068382174,0.012538256,0.87534153,0.0024052705,0.00077691965,0.00013139303,0.00047030053,0.0003939737,0.101104185],"genre_scores_gemma":[0.21065831,0.024767049,0.65753704,0.001345608,0.003057097,0.0013608126,0.0026046422,0.0013667445,0.09730264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991768,0.00027185105,0.00004697476,0.000100939,0.00034686158,0.00005666384],"domain_scores_gemma":[0.99870384,0.00084168965,0.00008938893,0.00017444082,0.00012977862,0.000060878017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013105772,0.0016973392,0.0012577329,0.0010360196,0.000685138,0.0022228654,0.0015122037,0.0009854927,0.015700283],"category_scores_gemma":[0.004832007,0.0010176261,0.0010166813,0.0025715516,0.0013699979,0.0043520783,0.0020421448,0.0072798566,0.003469426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009031154,0.00010585661,0.000060486193,0.00055506756,0.000028827892,0.00005318223,0.00022571934,0.029211769,0.0015226419,0.79455614,0.025857938,0.14773206],"study_design_scores_gemma":[0.000046975245,0.000047459813,0.00010945951,0.00018874744,0.000017105374,0.000094955074,0.00007496786,0.069484204,0.0005420373,0.86657935,0.062798545,0.000016249327],"about_ca_topic_score_codex":0.00077398063,"about_ca_topic_score_gemma":0.0010100015,"teacher_disagreement_score":0.015700283,"about_ca_system_score_codex":0.001181871,"about_ca_system_score_gemma":0.00060959626,"threshold_uncertainty_score":0.05252266},"labels":[],"label_agreement":null},{"id":"W2132911866","doi":"10.1007/11564096_58","title":"Using Rewards for Belief State Updates in Partially Observable Markov Decision Processes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; State (computer science); Action (physics); Observable; Artificial intelligence; Markov chain; Markov process; Markov model; Machine learning; Algorithm; Mathematics","score_opus":0.04877212309381557,"score_gpt":0.29700766222746905,"score_spread":0.24823553913365348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132911866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104146805,0.0003331811,0.9872335,0.00030838704,0.00008930119,0.000029697521,0.00006533732,0.0003190538,0.0012068079],"genre_scores_gemma":[0.63209087,0.00097422017,0.359871,0.00020690107,0.0003038854,0.00030163015,0.00042504526,0.0003991193,0.005427279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605995,0.002348438,0.00024109946,0.0004138968,0.00068983465,0.00024675907],"domain_scores_gemma":[0.940722,0.05455948,0.0013816846,0.001534987,0.0012232843,0.0005785872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007583967,0.0014104613,0.0021992214,0.0012143325,0.00089785084,0.0031634413,0.0024347987,0.0023996332,0.004449727],"category_scores_gemma":[0.051034965,0.0015151945,0.0010427048,0.0014108832,0.0022528663,0.007244778,0.0030490465,0.00448591,0.0005502517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040808998,0.00011107564,0.0008982703,0.00023896182,0.00008745074,0.00010574116,0.00027867386,0.62166184,0.0005961476,0.29876652,0.0019761494,0.07487109],"study_design_scores_gemma":[0.000017165989,0.000014358829,0.00005113745,0.000014188214,0.000009673925,0.0000068830714,0.0000063477705,0.871107,0.00018569634,0.12836604,0.00021120781,0.000010313142],"about_ca_topic_score_codex":0.00496387,"about_ca_topic_score_gemma":0.0040876116,"teacher_disagreement_score":0.007583967,"about_ca_system_score_codex":0.0021206078,"about_ca_system_score_gemma":0.0015460639,"threshold_uncertainty_score":0.040108323},"labels":[],"label_agreement":null},{"id":"W2133022776","doi":"10.1007/978-3-642-32940-1_30","title":"Modeling Interval Order Structures with Partially Commutative Monoids","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Interval (graph theory); Commutative property; Order (exchange); Computer science; Algorithm; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.037364793366591965,"score_gpt":0.29349729631196175,"score_spread":0.25613250294536977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133022776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03427515,0.0005842879,0.94946414,0.00011784646,0.00007276391,0.000060841074,0.00016259695,0.0006755472,0.014586861],"genre_scores_gemma":[0.6351042,0.0010428617,0.3489565,0.00006560855,0.00013885011,0.00018834048,0.0004729193,0.00017504623,0.013855647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994129,0.00017212695,0.000051881983,0.000112996284,0.00018091228,0.00006928277],"domain_scores_gemma":[0.99903905,0.00048083693,0.0001166799,0.00019824009,0.000114112096,0.000051040217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096043065,0.00055190787,0.00034740707,0.0005885981,0.00040312708,0.0021255,0.0013704252,0.00061092933,0.004208764],"category_scores_gemma":[0.0022573369,0.0005476051,0.0008091122,0.00067308405,0.001140067,0.0042362595,0.0010648658,0.00095881644,0.00072240084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088041605,0.000051600957,0.00050012197,0.00011124506,0.000020880867,0.00022373152,0.0004963516,0.061933205,0.0050609736,0.905342,0.0007113453,0.025460484],"study_design_scores_gemma":[0.000039135295,0.00009153156,0.00027931275,0.00006866841,0.00005494316,0.0002203109,0.00016958534,0.30305287,0.007798702,0.6680506,0.020140555,0.000033877404],"about_ca_topic_score_codex":0.0010358879,"about_ca_topic_score_gemma":0.0011948182,"teacher_disagreement_score":0.004208764,"about_ca_system_score_codex":0.0006527826,"about_ca_system_score_gemma":0.00054618716,"threshold_uncertainty_score":0.01407975},"labels":[],"label_agreement":null},{"id":"W2133402615","doi":"10.1007/978-3-319-03089-0_21","title":"Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Line (geometry); Mathematics; Telecommunications; Geometry","score_opus":0.023383649100682028,"score_gpt":0.268899586946496,"score_spread":0.245515937845814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133402615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08632514,0.00018112025,0.899206,0.0004942355,0.000047716214,0.00010458303,0.00006825281,0.00076413836,0.012808783],"genre_scores_gemma":[0.80766773,0.00018944536,0.18022811,0.00017443157,0.000052704454,0.00031193718,0.00012695929,0.00015570203,0.011093073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989416,0.00037098984,0.0000669363,0.00022759348,0.00022617796,0.00016679925],"domain_scores_gemma":[0.9958125,0.0026385807,0.0003674002,0.0005524016,0.00031660945,0.00031247264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013414896,0.00074456556,0.0012256725,0.0006609988,0.0012934795,0.002328683,0.0023815813,0.0014675718,0.0044602887],"category_scores_gemma":[0.0061960607,0.0006970539,0.00086349226,0.00075836247,0.0018369429,0.004357123,0.0038196777,0.002006582,0.0006982553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007533221,0.0002277206,0.0007689525,0.00034453877,0.00013173418,0.00048022266,0.00089337426,0.5524508,0.010931335,0.38095233,0.003477942,0.048587713],"study_design_scores_gemma":[0.00005836604,0.00007008141,0.00004939527,0.000014402286,0.000016875098,0.00004715672,0.00006940148,0.84354186,0.0010868192,0.15402275,0.0010076298,0.00001531207],"about_ca_topic_score_codex":0.0013671181,"about_ca_topic_score_gemma":0.0014394769,"teacher_disagreement_score":0.0044602887,"about_ca_system_score_codex":0.0011825102,"about_ca_system_score_gemma":0.0009445133,"threshold_uncertainty_score":0.014921129},"labels":[],"label_agreement":null},{"id":"W2133482720","doi":"10.1007/978-3-540-72665-4_46","title":"Hierarchical Shortest Pathfinding Applied to Route-Planning for Wheelchair Users","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pathfinding; Computer science; Dijkstra's algorithm; Shortest path problem; Mathematical optimization; Motion planning; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Robot","score_opus":0.04220036228549223,"score_gpt":0.2939609903223324,"score_spread":0.2517606280368402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133482720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04676086,0.0003947011,0.9420495,0.00008928641,0.00007321925,0.00014355374,0.00028152278,0.0030928978,0.0071144924],"genre_scores_gemma":[0.45513824,0.0004769825,0.5373949,0.000039598788,0.00002314425,0.00015590228,0.00044154772,0.0001808305,0.006148982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985373,0.000026323532,0.000007680057,0.000035501387,0.000052509597,0.000024187964],"domain_scores_gemma":[0.9998072,0.000086475105,0.0000094186835,0.00002762366,0.000055901786,0.000013472586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025335242,0.00042227935,0.00045687973,0.00043421204,0.00043861635,0.0003897638,0.00071206386,0.0003410924,0.005547433],"category_scores_gemma":[0.0009331226,0.0002845193,0.0003482354,0.0008094712,0.00023311473,0.0004891537,0.00061923673,0.0003438847,0.00058800576],"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.00024485833,0.00008400623,0.0014059772,0.00026662686,0.000042618958,0.00014080087,0.000421904,0.31621784,0.019974068,0.011004014,0.0068958197,0.6433014],"study_design_scores_gemma":[0.00001874246,0.000072985786,0.0013440565,0.000017866774,0.00002724007,0.00005084938,0.0000903739,0.98207045,0.0052636764,0.0075034355,0.0035272038,0.000013203099],"about_ca_topic_score_codex":0.041344076,"about_ca_topic_score_gemma":0.044319227,"teacher_disagreement_score":0.041344076,"about_ca_system_score_codex":0.0006684615,"about_ca_system_score_gemma":0.0013106825,"threshold_uncertainty_score":0.082206845},"labels":[],"label_agreement":null},{"id":"W2133502277","doi":"10.1007/978-3-642-15892-6_15","title":"DelsArtMap: Applying Delsarte’s Aesthetic System to Virtual Agents","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Animation; Character (mathematics); Computer science; Character animation; Computer graphics (images); Computer animation; Metaverse; Human–computer interaction; Skeletal animation; Computer facial animation; Multimedia; Virtual reality; Mathematics","score_opus":0.014911348105472455,"score_gpt":0.22399525564204104,"score_spread":0.20908390753656858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133502277","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.0050354768,0.00011577372,0.9151961,0.00018342983,0.00023349606,0.00013410994,0.0002223484,0.028722385,0.050156794],"genre_scores_gemma":[0.13723059,0.00041913168,0.7679145,0.00030465532,0.00009085795,0.00042450966,0.0012958727,0.012110473,0.08020945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999647,0.00007619744,0.00002112408,0.00005768367,0.0001602344,0.00003777371],"domain_scores_gemma":[0.9996892,0.00010329129,0.000009203433,0.00009147584,0.00007195616,0.000034929515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054500205,0.0009825063,0.00044022925,0.00089131226,0.0006483179,0.0019976567,0.0015227492,0.000975205,0.04315205],"category_scores_gemma":[0.0018745459,0.0006375898,0.0010306657,0.00045445908,0.00087347627,0.0016917677,0.00341456,0.0015604969,0.008251263],"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.00024639603,0.0002162604,0.00051677,0.00058235653,0.000053491258,0.00039491683,0.0018466148,0.023688423,0.027260672,0.13241917,0.07393835,0.7388366],"study_design_scores_gemma":[0.00017128869,0.00018708486,0.0005473468,0.00020508216,0.0000711367,0.0010348691,0.0004492256,0.24260785,0.031707805,0.10351927,0.6193824,0.00011664855],"about_ca_topic_score_codex":0.0010711511,"about_ca_topic_score_gemma":0.0018378175,"teacher_disagreement_score":0.04315205,"about_ca_system_score_codex":0.00037835646,"about_ca_system_score_gemma":0.00040410957,"threshold_uncertainty_score":0.14435804},"labels":[],"label_agreement":null},{"id":"W2133530124","doi":"10.1007/978-3-642-39521-5_2","title":"When Almost Is Not Even Close: Remarks on the Approximability of HDTP","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Toronto","funders":"","keywords":"Computer science; Heuristic; Analogy; Computational complexity theory; Theoretical computer science; Cognition; Projection (relational algebra); Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Epistemology","score_opus":0.020406032629037712,"score_gpt":0.23454690847582296,"score_spread":0.21414087584678526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133530124","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0783125,0.0027824626,0.66980374,0.048832893,0.002836944,0.00013100106,0.001093514,0.0014785384,0.19472846],"genre_scores_gemma":[0.8401068,0.0016455173,0.11595083,0.00448491,0.0019764851,0.0002396674,0.00071493693,0.0008068704,0.034074046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721175,0.0006370211,0.00022616495,0.00091545196,0.0005775145,0.0004320336],"domain_scores_gemma":[0.9823612,0.01217516,0.0004718927,0.0029939697,0.0015354617,0.0004622474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043437863,0.0005051459,0.0016456061,0.0008814714,0.003058535,0.0048286105,0.0029354556,0.004129285,0.01562572],"category_scores_gemma":[0.03662938,0.00079122087,0.0023513227,0.0018101697,0.006846212,0.02005292,0.0048260265,0.009403106,0.0016980327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013989459,0.00001996619,0.00046018555,0.000100161385,0.00002216189,0.00025666316,0.00055316824,0.007845752,0.00040723511,0.97115695,0.0070593017,0.011978612],"study_design_scores_gemma":[0.000017675055,0.000012789008,0.00018534511,0.000029006818,0.000015496911,0.000118741744,0.00027857715,0.014437426,0.00038022766,0.9782235,0.0062842183,0.000016902204],"about_ca_topic_score_codex":0.006763758,"about_ca_topic_score_gemma":0.0036496904,"teacher_disagreement_score":0.01562572,"about_ca_system_score_codex":0.0022584994,"about_ca_system_score_gemma":0.001279079,"threshold_uncertainty_score":0.052273214},"labels":[],"label_agreement":null},{"id":"W2133553774","doi":"10.1007/3-540-45113-7_38","title":"Concept-Based Retrieval of Art Documents","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Generative grammar; Lexicon; Grammar; Information retrieval; Natural language processing; Artificial intelligence; Linguistics","score_opus":0.015654103714286455,"score_gpt":0.2587860773159438,"score_spread":0.2431319736016573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133553774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15572344,0.037567005,0.7346218,0.0011096165,0.0019231127,0.001199742,0.0062432275,0.0057220035,0.055890057],"genre_scores_gemma":[0.33147338,0.01321252,0.60514015,0.0004275206,0.00095030764,0.00049889146,0.012199726,0.00038447234,0.035713073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931526,0.00007333421,0.000048263846,0.000110638146,0.00039127638,0.000061171435],"domain_scores_gemma":[0.9994836,0.00017385776,0.00003214555,0.00006366058,0.00021791828,0.00002871734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060032436,0.00068735087,0.0011521418,0.0062809936,0.0006483779,0.0018295193,0.0014397866,0.0010339086,0.010200163],"category_scores_gemma":[0.0019253533,0.0002525934,0.0008717124,0.0060758605,0.00047689033,0.002237227,0.0008703898,0.0006312008,0.0043609426],"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.00041310673,0.00025190506,0.0006120922,0.00078208314,0.00009558457,0.00020029988,0.0001857366,0.0033252598,0.05747631,0.008400007,0.031336702,0.8969208],"study_design_scores_gemma":[0.00066803035,0.0019438667,0.030944213,0.00079518487,0.0011839466,0.011418641,0.001391789,0.39443672,0.2395793,0.046977315,0.27024284,0.00041807778],"about_ca_topic_score_codex":0.0030434409,"about_ca_topic_score_gemma":0.0043320716,"teacher_disagreement_score":0.010200163,"about_ca_system_score_codex":0.00071670354,"about_ca_system_score_gemma":0.0008765703,"threshold_uncertainty_score":0.034123003},"labels":[],"label_agreement":null},{"id":"W2133556763","doi":"10.1007/3-540-47922-8_14","title":"Topic Discovery from Text Using Aggregation of Different Clustering Methods","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":30,"is_retracted":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":"Cluster analysis; Computer science; Document clustering; Measure (data warehouse); Clustering high-dimensional data; Data mining; Process (computing); Cluster (spacecraft); Vocabulary; Artificial intelligence; Correlation clustering; Machine learning; Information retrieval","score_opus":0.03332615904962769,"score_gpt":0.3142565827528983,"score_spread":0.2809304237032706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133556763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0917286,0.003619302,0.8905331,0.0004455349,0.0004352691,0.0006850226,0.0031533288,0.0063946014,0.0030051805],"genre_scores_gemma":[0.20864116,0.0011113514,0.77503055,0.000098363234,0.00050263753,0.00050821673,0.009695867,0.00069290685,0.003719025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954222,0.0010662035,0.0005107737,0.0012759604,0.0013420472,0.0003828142],"domain_scores_gemma":[0.99063045,0.0046436614,0.00042982373,0.0013199412,0.002638512,0.00033754532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048128897,0.0015615709,0.0022679542,0.014453964,0.0018063217,0.003806309,0.0020000392,0.0015993052,0.0019191918],"category_scores_gemma":[0.012228522,0.0006508968,0.00283672,0.013726076,0.00048437237,0.0029748403,0.0024602965,0.0012402772,0.0020478142],"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.0013706306,0.000431924,0.0135754505,0.00091039756,0.00091743586,0.00021677242,0.0014854845,0.010210137,0.03961224,0.0022266633,0.012404026,0.9166389],"study_design_scores_gemma":[0.00033457766,0.0006283208,0.044186212,0.00024224512,0.0026654552,0.0010267409,0.0022427666,0.809357,0.07135933,0.037249316,0.030327778,0.0003802708],"about_ca_topic_score_codex":0.0044249524,"about_ca_topic_score_gemma":0.009474416,"teacher_disagreement_score":0.014453964,"about_ca_system_score_codex":0.00077877694,"about_ca_system_score_gemma":0.0012457347,"threshold_uncertainty_score":0.02545333},"labels":[],"label_agreement":null},{"id":"W2133575460","doi":"10.1007/978-3-642-17928-0_7","title":"Computational Experiments with the RAVE Heuristic","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Heuristic; Game tree; Estimator; Algorithm; Monte Carlo method; Artificial intelligence; Game theory; Sequential game; Statistics; Mathematics; Mathematical economics","score_opus":0.03771057346889833,"score_gpt":0.2762934676243007,"score_spread":0.23858289415540235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133575460","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.8184899,0.005717299,0.07134001,0.00314433,0.00073282304,0.0006310637,0.002815016,0.0010424404,0.096087165],"genre_scores_gemma":[0.90782225,0.0006809302,0.081859455,0.00032229992,0.00014568151,0.00044022728,0.0019997025,0.00046356829,0.0062659234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917681,0.006342492,0.00040960792,0.0006166281,0.0005355481,0.00032750622],"domain_scores_gemma":[0.77274513,0.21139199,0.0020824645,0.010315473,0.0025379595,0.0009270318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011711683,0.0016651968,0.0016613504,0.0019115647,0.0013390561,0.0021540257,0.0035648833,0.002916299,0.01593899],"category_scores_gemma":[0.08816391,0.0008968932,0.0014213482,0.002655785,0.0023937125,0.005925876,0.0016618131,0.0033222493,0.0017767695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014717562,0.010914517,0.008555588,0.0037098497,0.0012117225,0.00033896964,0.0023413165,0.51121604,0.002046039,0.1715378,0.051496122,0.22191449],"study_design_scores_gemma":[0.0038844799,0.002665856,0.0036393583,0.000378594,0.00050882297,0.00023465138,0.0011459489,0.79637426,0.0032835181,0.17504361,0.012671355,0.00016957149],"about_ca_topic_score_codex":0.00377411,"about_ca_topic_score_gemma":0.0053433245,"teacher_disagreement_score":0.01593899,"about_ca_system_score_codex":0.0020970271,"about_ca_system_score_gemma":0.0010562812,"threshold_uncertainty_score":0.061938047},"labels":[],"label_agreement":null},{"id":"W2133659107","doi":"10.1007/978-3-540-25984-8_35","title":"Formalizing Undefinedness Arising in Calculus","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"Leibniz-Gemeinschaft","keywords":"Computer science; Calculus (dental); Pi calculus; Programming language","score_opus":0.025885404553376266,"score_gpt":0.25317031870776163,"score_spread":0.22728491415438537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133659107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027814873,0.0015732782,0.92785335,0.0014320723,0.00044655908,0.00005688228,0.000092044116,0.00081321853,0.039917763],"genre_scores_gemma":[0.6628073,0.0019760528,0.31618395,0.0008111862,0.0007277798,0.00019019784,0.00029446775,0.00072002463,0.016289053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940461,0.0019197455,0.00056392414,0.00095409027,0.0017346862,0.00078135583],"domain_scores_gemma":[0.9913395,0.0056159073,0.00032709315,0.0015055843,0.0009430481,0.00026877917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067911213,0.0016540926,0.0018011291,0.0026690061,0.003802832,0.008592855,0.0042577498,0.0027498454,0.0038984907],"category_scores_gemma":[0.013112222,0.0019647167,0.0024607866,0.002583949,0.014871297,0.018434478,0.008972283,0.011112755,0.0007665276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010296446,0.000009869432,0.00012286709,0.00004232552,0.0000064616643,0.000104842016,0.0006109546,0.00068589416,0.0004062219,0.99317557,0.0003849606,0.0044397814],"study_design_scores_gemma":[0.000008178661,0.000006444329,0.00003907179,0.00003068351,0.000021289145,0.000071120114,0.00010590268,0.003309679,0.00087396643,0.99152607,0.0039922935,0.0000151609],"about_ca_topic_score_codex":0.0021478278,"about_ca_topic_score_gemma":0.0022033416,"teacher_disagreement_score":0.008592855,"about_ca_system_score_codex":0.002962764,"about_ca_system_score_gemma":0.0021419534,"threshold_uncertainty_score":0.035915256},"labels":[],"label_agreement":null},{"id":"W2133757854","doi":"10.1007/978-3-642-33024-7_19","title":"Impact of Indoor Location Information Reliability on Users’ Trust of an Indoor Positioning System","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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 Saskatchewan","funders":"","keywords":"Computer science; Global Positioning System; Positioning system; Reliability (semiconductor); Variance (accounting); Hybrid positioning system; Real-time computing; Simulation; Telecommunications","score_opus":0.007737748100624088,"score_gpt":0.22339996820360422,"score_spread":0.21566222010298014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133757854","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.9886641,0.00032152378,0.007914147,0.00032915885,0.000030417219,0.00001023596,0.00014492324,0.000070835216,0.0025146515],"genre_scores_gemma":[0.9996582,0.000018757097,0.00017555157,0.000004337801,0.000003894729,0.0000010147943,0.000022355687,0.000004017606,0.000111818845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9968682,0.0013535758,0.00017034805,0.0003054238,0.00078107364,0.0005214589],"domain_scores_gemma":[0.8922309,0.08564111,0.0074782236,0.0052605285,0.0077359425,0.0016533117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027579318,0.0003887813,0.0004998532,0.0004132214,0.0004885831,0.0010945742,0.00066981436,0.00086843845,0.0022860593],"category_scores_gemma":[0.049611587,0.00042181287,0.000415871,0.00059170387,0.00069296884,0.002158192,0.0010150699,0.0011722177,0.0003551727],"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.008979839,0.0005772474,0.34476236,0.00048572427,0.00095675525,0.0018308496,0.0025563526,0.5153864,0.030015973,0.008144,0.003276751,0.083027706],"study_design_scores_gemma":[0.00010819967,0.0022756723,0.2479026,0.00006927639,0.0005982079,0.0012986598,0.0023883402,0.724044,0.014099202,0.005943898,0.001044137,0.00022782128],"about_ca_topic_score_codex":0.007670283,"about_ca_topic_score_gemma":0.004746355,"teacher_disagreement_score":0.007670283,"about_ca_system_score_codex":0.00094732066,"about_ca_system_score_gemma":0.00050720805,"threshold_uncertainty_score":0.015251279},"labels":[],"label_agreement":null},{"id":"W2133882911","doi":"10.1007/978-3-642-02115-2_21","title":"GPSel: A Gestural Perceptual-Based Path Selection Technique","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"York University","funders":"","keywords":"Gestalt psychology; Computer science; Salient; Perception; Selection (genetic algorithm); Path (computing); Artificial intelligence; Closure (psychology); Computer vision","score_opus":0.01749811212321442,"score_gpt":0.2722831060053896,"score_spread":0.2547849938821751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133882911","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.0063834633,0.00015308532,0.98560625,0.00004229767,0.00006451151,0.00005613062,0.00019342665,0.0060552084,0.0014457327],"genre_scores_gemma":[0.07188481,0.00026486043,0.9214678,0.00008789201,0.000042403255,0.00011728655,0.00062302424,0.00122265,0.0042892722],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954754,0.00005862501,0.000015102425,0.00010976487,0.00022681968,0.000042012798],"domain_scores_gemma":[0.9995358,0.00017240855,0.00003079413,0.00010549017,0.00011623402,0.00003946578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037541514,0.0013963053,0.0010340814,0.0013578417,0.0005636949,0.00093822414,0.0019718101,0.0007544984,0.014181475],"category_scores_gemma":[0.001350196,0.0005697406,0.00073761627,0.0015640307,0.00050824805,0.0011302071,0.001996095,0.0012924697,0.0032886474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005931272,0.00014773519,0.0004920242,0.00038598967,0.00008881792,0.0001956035,0.00020469417,0.011360772,0.1035376,0.0061566723,0.011971482,0.8648654],"study_design_scores_gemma":[0.0003777406,0.00072547287,0.0030355174,0.00013361282,0.00021234305,0.0013087416,0.00037696163,0.744255,0.16348289,0.02130708,0.064633384,0.0001512424],"about_ca_topic_score_codex":0.0017343657,"about_ca_topic_score_gemma":0.004015311,"teacher_disagreement_score":0.014181475,"about_ca_system_score_codex":0.00025662666,"about_ca_system_score_gemma":0.00059324066,"threshold_uncertainty_score":0.04744172},"labels":[],"label_agreement":null},{"id":"W2133956363","doi":"10.1007/978-3-540-39869-1_18","title":"Improving Evolutionary Learning of Cooperative Behavior by Including Accountability of Strategy Components","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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 Calgary","funders":"","keywords":"Accountability; Computer science; Evolutionary algorithm; Artificial intelligence; Action (physics); Process (computing); Evolutionary computation; Measure (data warehouse); Machine learning; Data mining","score_opus":0.026676161430804687,"score_gpt":0.2755858887287938,"score_spread":0.2489097272979891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133956363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13185269,0.0001302744,0.8587669,0.00060210883,0.0000703722,0.00006022251,0.000027506925,0.00036681443,0.008123111],"genre_scores_gemma":[0.90972364,0.00007636234,0.08728608,0.00012114196,0.000029229059,0.000088947214,0.00003829624,0.000051457002,0.0025848115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990439,0.00041971792,0.00005736336,0.0001720306,0.00020680163,0.00010013806],"domain_scores_gemma":[0.9887002,0.007999807,0.0006444958,0.0015324439,0.0008077885,0.00031529332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028157278,0.00063683366,0.0007525636,0.0003889969,0.000432674,0.0009017513,0.0014296835,0.001581558,0.0028639077],"category_scores_gemma":[0.0219477,0.00041682852,0.00043103902,0.00047643413,0.0010524417,0.0028601207,0.0020599,0.0021060128,0.0003116145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020635224,0.00040753922,0.0049843667,0.00012014172,0.0001133268,0.00011635366,0.00032008885,0.61613846,0.0074783857,0.14634813,0.0017063,0.22206058],"study_design_scores_gemma":[0.00003224053,0.00008542682,0.00045768303,0.000010799574,0.000022002449,0.000030804644,0.000020499228,0.93321157,0.0013902322,0.06425934,0.00046962313,0.000009741113],"about_ca_topic_score_codex":0.00077285,"about_ca_topic_score_gemma":0.001119918,"teacher_disagreement_score":0.0028639077,"about_ca_system_score_codex":0.00069405575,"about_ca_system_score_gemma":0.0010125325,"threshold_uncertainty_score":0.014891148},"labels":[],"label_agreement":null},{"id":"W2133956949","doi":"10.1007/978-3-642-00468-1_25","title":"Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"is_retracted":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":"Scalar multiplication; Scalar (mathematics); Computer science; Window (computing); Elliptic curve; Elliptic curve point multiplication; Point (geometry); Multiplication (music); Algorithm; Parallel computing; Applied mathematics; Mathematics; Geometry; Mathematical analysis","score_opus":0.01859475332476348,"score_gpt":0.2981308735236749,"score_spread":0.27953612019891144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133956949","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.036179833,0.0035114419,0.9110386,0.0004953965,0.0007400261,0.00014574494,0.00030955946,0.009620905,0.03795857],"genre_scores_gemma":[0.23025183,0.0017274354,0.6907799,0.00036716033,0.00046201132,0.00023438234,0.00073928403,0.0042715417,0.07116643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927205,0.00012869506,0.000049853385,0.000105991385,0.0003469886,0.00009630629],"domain_scores_gemma":[0.99928135,0.0001418489,0.000045029705,0.00035141667,0.0001452982,0.000035025983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060922885,0.0013231364,0.0012040236,0.0013303142,0.001255369,0.0017191293,0.0013409314,0.0006664917,0.019717216],"category_scores_gemma":[0.0021214182,0.00054193643,0.00094679504,0.0023826929,0.0006567104,0.0033506784,0.0018708967,0.0017331864,0.006854475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006735908,0.00016159657,0.00058292475,0.00034122085,0.000064990185,0.00016368944,0.00032443195,0.0066927155,0.031009689,0.14249595,0.023384545,0.79410464],"study_design_scores_gemma":[0.0003650054,0.00054858666,0.0023270682,0.00024358039,0.00020969484,0.0013667662,0.00036668903,0.14063847,0.16050747,0.45423198,0.23898995,0.00020483142],"about_ca_topic_score_codex":0.00045941645,"about_ca_topic_score_gemma":0.0010868096,"teacher_disagreement_score":0.019717216,"about_ca_system_score_codex":0.0007268165,"about_ca_system_score_gemma":0.00069044705,"threshold_uncertainty_score":0.065960646},"labels":[],"label_agreement":null},{"id":"W2134021948","doi":"10.1007/978-3-540-78913-0_22","title":"Solving Linear Equations in *-continuous Action Lattices","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Action (physics); Algebraic equation; Linear equation; Algebraic number; Algebra over a field; Sign (mathematics); Applied mathematics; Lattice (music); Pure mathematics; Nonlinear system; Mathematical analysis","score_opus":0.058569033436331054,"score_gpt":0.31306149589153615,"score_spread":0.25449246245520507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134021948","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.057350125,0.00021665604,0.9121958,0.0006058945,0.0001330481,0.00007861083,0.0001913705,0.00072502583,0.028503377],"genre_scores_gemma":[0.5971721,0.00038933448,0.37510833,0.00022496127,0.0001512166,0.00020986423,0.00051873724,0.0004441237,0.025781237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989454,0.00028573556,0.000083355226,0.00015293184,0.00037117087,0.00016140474],"domain_scores_gemma":[0.997954,0.0016399305,0.00009755384,0.00010939618,0.00012858147,0.00007045737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012461477,0.00069708907,0.0008599074,0.00047588674,0.00072971993,0.0023678613,0.0013307977,0.0008346647,0.010382292],"category_scores_gemma":[0.0043712654,0.00079922826,0.0014089644,0.00080671336,0.0022660193,0.0031536974,0.0023955149,0.003042703,0.0010665165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006317558,0.00005430103,0.00025200803,0.00018119444,0.000030663174,0.00015205314,0.00038163725,0.0628087,0.0018097151,0.900078,0.0020044972,0.032184064],"study_design_scores_gemma":[0.000060115286,0.000024026549,0.00004447579,0.000027157781,0.000011686567,0.000055139375,0.00017556178,0.17604381,0.0026328843,0.81626385,0.004644902,0.000016321505],"about_ca_topic_score_codex":0.001979356,"about_ca_topic_score_gemma":0.0025222194,"teacher_disagreement_score":0.010382292,"about_ca_system_score_codex":0.0010558175,"about_ca_system_score_gemma":0.0010051242,"threshold_uncertainty_score":0.034732223},"labels":[],"label_agreement":null},{"id":"W2134114433","doi":"10.1007/11559573_50","title":"Envelope Detection of Multi-object Shapes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Object (grammar); Envelope (radar); Artificial intelligence; Matching (statistics); Computer science; Pattern recognition (psychology); Set (abstract data type); Computer vision; Representation (politics); Cluster analysis; Image (mathematics); Tree (set theory); Mathematics","score_opus":0.022787817759852176,"score_gpt":0.2587272217576448,"score_spread":0.23593940399779262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134114433","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.044704713,0.0008250162,0.94936657,0.00007456453,0.000064261476,0.000033312263,0.00006151178,0.0008761618,0.0039938404],"genre_scores_gemma":[0.36042833,0.001863671,0.6260784,0.0001378432,0.00008648272,0.000039497034,0.0004920788,0.00043436777,0.010439302],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996207,0.000053669417,0.000017296608,0.000060054695,0.00019559806,0.000052771178],"domain_scores_gemma":[0.9992748,0.00027545344,0.000052353276,0.00017690139,0.00017572806,0.00004489905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063295104,0.00053828774,0.0007085841,0.001552184,0.00024277018,0.0010383239,0.0008008777,0.0009624844,0.0040762],"category_scores_gemma":[0.0019686804,0.00045997676,0.0006167205,0.0014495205,0.0003620112,0.0014039228,0.0013430301,0.00060302677,0.0024599724],"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.0004192749,0.000068561814,0.0009417639,0.00018613639,0.000047956433,0.00023496522,0.00015440995,0.011972148,0.23773591,0.004998295,0.0014464349,0.74179405],"study_design_scores_gemma":[0.00004142992,0.00028500028,0.009338573,0.000109668654,0.00009238955,0.0029181272,0.00016327246,0.7454543,0.21193735,0.01585479,0.013743818,0.00006119238],"about_ca_topic_score_codex":0.0003383676,"about_ca_topic_score_gemma":0.0003893707,"teacher_disagreement_score":0.0040762,"about_ca_system_score_codex":0.00025001887,"about_ca_system_score_gemma":0.00018606975,"threshold_uncertainty_score":0.013636291},"labels":[],"label_agreement":null},{"id":"W2134209982","doi":"10.1007/978-3-642-04428-1_3","title":"Manipulating Tournaments in Cup and Round Robin Competitions","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Throwing; Tournament; Polynomial; Time complexity","score_opus":0.0356173220076139,"score_gpt":0.2829765906785324,"score_spread":0.2473592686709185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134209982","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.7845975,0.00042675048,0.09479722,0.0006638315,0.00042087885,0.00024273458,0.00018691969,0.0008447275,0.11781945],"genre_scores_gemma":[0.9794937,0.00006751769,0.011551462,0.000076235025,0.000030808493,0.0000649263,0.00008073739,0.00011351146,0.0085210875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.00045347537,0.00003056573,0.00012275619,0.00019408102,0.00020679903],"domain_scores_gemma":[0.9965767,0.002234658,0.00028418616,0.00028487135,0.00017422589,0.00044524565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121865,0.00057862647,0.0005090888,0.0003805027,0.000838893,0.0019524058,0.0013357862,0.0006734934,0.013497616],"category_scores_gemma":[0.0067989933,0.000369784,0.00030383657,0.00047932076,0.0007409733,0.0012144512,0.0011703668,0.001274137,0.0007752126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006594396,0.0026898594,0.007330343,0.0004932904,0.00034659822,0.00065754936,0.0022944917,0.18511325,0.042356353,0.4661966,0.027492588,0.25843474],"study_design_scores_gemma":[0.0011672749,0.001482768,0.008867042,0.00009559123,0.00021761443,0.0002294462,0.0013529736,0.59631854,0.0122450255,0.34041983,0.037462197,0.00014167945],"about_ca_topic_score_codex":0.0014061702,"about_ca_topic_score_gemma":0.003909398,"teacher_disagreement_score":0.013497616,"about_ca_system_score_codex":0.000696846,"about_ca_system_score_gemma":0.0004619567,"threshold_uncertainty_score":0.045154035},"labels":[],"label_agreement":null},{"id":"W2134226588","doi":"10.1007/978-3-642-14192-8","title":"Requirements Engineering: Foundation for Software Quality","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Namur; Università di Pisa; Universidad Politécnica de Madrid; Universitetet i Bergen; RWTH Aachen University; University of Waterloo; Vlaamse regering; Universidade Nova de Lisboa; Kungliga Tekniska Högskolan; University of Technology Sydney; Linköpings Universitet; Universität Duisburg-Essen; Lunds Universitet; Blekinge Tekniska Högskola; Universiteit Utrecht; University College London; University of Toronto; École Polytechnique Fédérale de Lausanne; Bournemouth University; Universität Heidelberg; Tartu Ülikool; Université du Luxembourg; Universitat Politècnica de Catalunya; University of East London","keywords":"Computer science; Software engineering; Foundation (evidence); Software quality; Software; Software development; Programming language","score_opus":0.0343203955477861,"score_gpt":0.3167152354746055,"score_spread":0.2823948399268194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134226588","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024329235,0.012778757,0.8817322,0.0075420095,0.0006584637,0.00010245501,0.00017831294,0.0010184698,0.09355636],"genre_scores_gemma":[0.18895496,0.028034227,0.7179047,0.0022996895,0.002346232,0.0005892883,0.00074550445,0.0011647792,0.05796066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967167,0.00071578665,0.00022386227,0.00032621287,0.0018630618,0.00015441392],"domain_scores_gemma":[0.9947744,0.0032203787,0.00026305817,0.000793254,0.00086002034,0.000088932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032656607,0.0010944105,0.000849365,0.0016503109,0.0006599501,0.0032867251,0.001396036,0.0017396774,0.008910306],"category_scores_gemma":[0.010771786,0.0009437671,0.0010819348,0.0016736517,0.00324975,0.00666836,0.0018302988,0.0031963198,0.003556003],"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.000011973991,0.000023013741,0.00010820916,0.00041484847,0.000019366304,0.00005132923,0.00022461139,0.004481913,0.0009592988,0.8365467,0.015707036,0.14145157],"study_design_scores_gemma":[0.000017217986,0.000022493268,0.00014325633,0.0002533881,0.000019779642,0.00013125381,0.000055744476,0.0108088795,0.0010125428,0.8857422,0.10177848,0.000014882378],"about_ca_topic_score_codex":0.001304093,"about_ca_topic_score_gemma":0.0007838831,"teacher_disagreement_score":0.008910306,"about_ca_system_score_codex":0.0014218349,"about_ca_system_score_gemma":0.0018394915,"threshold_uncertainty_score":0.029807925},"labels":[],"label_agreement":null},{"id":"W2134250998","doi":"10.1007/11866565_94","title":"Comparison of Different Targeting Methods for Subthalamic Nucleus Deep Brain Stimulation","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","cited_by":22,"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; London Health Sciences Centre; Robarts Clinical Trials","funders":"Canadian Institutes of Health Research; Ontario Innovation Trust","keywords":"Subthalamic nucleus; Deep brain stimulation; Computer science; Nucleus; Stimulation; Neuroscience; Artificial intelligence; Parkinson's disease; Medicine; Psychology","score_opus":0.028902040197219574,"score_gpt":0.37054766955395135,"score_spread":0.34164562935673176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134250998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32726863,0.011787857,0.651246,0.00036572124,0.00027902733,0.0002859442,0.00033666397,0.0015227932,0.0069073173],"genre_scores_gemma":[0.8611467,0.0038217339,0.13018788,0.0003286778,0.000107803266,0.00025497537,0.00031576998,0.00045795788,0.0033785081],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99956006,0.00012005109,0.000040205097,0.000041218005,0.00019956195,0.00003890863],"domain_scores_gemma":[0.9987029,0.00095197547,0.00007022557,0.00007236472,0.00015924027,0.000043173794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091431785,0.00053113315,0.0005645431,0.0007377094,0.00019292763,0.0006401797,0.00039302948,0.0007070589,0.0021427528],"category_scores_gemma":[0.0030010098,0.00028512158,0.0005343125,0.00045756667,0.00024073766,0.0007283634,0.00044349255,0.00027822665,0.0004107479],"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.00886923,0.0003980001,0.0025311895,0.0013149251,0.00076074887,0.00015425174,0.00036541148,0.03209702,0.16711707,0.0018069138,0.0016696677,0.78291553],"study_design_scores_gemma":[0.0031790303,0.015527891,0.059813187,0.0004253106,0.0038146437,0.0074143065,0.00060056365,0.4593005,0.422473,0.009075504,0.01793943,0.0004366615],"about_ca_topic_score_codex":0.0009087169,"about_ca_topic_score_gemma":0.0015666218,"teacher_disagreement_score":0.0021427528,"about_ca_system_score_codex":0.0002296792,"about_ca_system_score_gemma":0.00029966576,"threshold_uncertainty_score":0.0071682334},"labels":[],"label_agreement":null},{"id":"W2134366841","doi":"10.1007/978-3-540-85988-8_89","title":"Spherical Demons: Fast Surface Registration","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Ellison Medical Foundation; National Institute of Biomedical Imaging and Bioengineering; National Center for Research Resources; National Institute of Neurological Disorders and Stroke; National Institutes of Health; National Science Foundation","keywords":"Computer science; Artificial intelligence; Image registration; Computer vision; Surface (topology); Interpolation (computer graphics); Spline (mechanical); Convolution (computer science); Signed distance function; Algorithm; Mathematics; Geometry; Image (mathematics); Artificial neural network; Physics","score_opus":0.021221607152094157,"score_gpt":0.2804948580389244,"score_spread":0.25927325088683023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134366841","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.0023927575,0.00012738573,0.9868292,0.0000974211,0.00009764759,0.000057147605,0.00025348613,0.008380183,0.0017647144],"genre_scores_gemma":[0.055964965,0.00032438597,0.9320284,0.00011873214,0.00006520322,0.00017483348,0.0012178131,0.0034031675,0.0067024394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915373,0.00015711293,0.000034452325,0.000098072655,0.00048941793,0.00006722351],"domain_scores_gemma":[0.99913365,0.0003146986,0.000048624355,0.0002678005,0.00018242511,0.000052846823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084490323,0.0016540918,0.0011182815,0.002207918,0.000527843,0.001811165,0.0019187871,0.0014949548,0.01979959],"category_scores_gemma":[0.002443353,0.0012371971,0.0010540728,0.0023694208,0.00046740758,0.001602201,0.00333154,0.0015096413,0.0081821075],"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.0004568846,0.00007563148,0.00043673094,0.00022813627,0.000113831076,0.00021001251,0.00014386083,0.031251557,0.029964982,0.024616502,0.042597007,0.8699048],"study_design_scores_gemma":[0.00011070071,0.00009744431,0.00074336934,0.000038493523,0.000034729437,0.00058284437,0.00009776061,0.8570695,0.060172155,0.026863554,0.05411963,0.00006978059],"about_ca_topic_score_codex":0.0025682575,"about_ca_topic_score_gemma":0.0052537303,"teacher_disagreement_score":0.01979959,"about_ca_system_score_codex":0.0004606509,"about_ca_system_score_gemma":0.0008486224,"threshold_uncertainty_score":0.0662362},"labels":[],"label_agreement":null},{"id":"W2134862753","doi":"10.1007/978-3-540-87536-9_99","title":"Analysis-by-Synthesis by Learning to Invert Generative Black Boxes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generative grammar; Computer science; Generative model; Artificial neural network; Set (abstract data type); Artificial intelligence; Black box; Graphics; Generative Design; Machine learning; Computer graphics (images); Compatibility (geochemistry); Programming language","score_opus":0.015249339516700378,"score_gpt":0.23369425334000507,"score_spread":0.2184449138233047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134862753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023233849,0.00004400622,0.99470216,0.000048021808,0.000026033966,0.000018836949,0.0000141547725,0.0009568825,0.0018665032],"genre_scores_gemma":[0.18016171,0.00021816502,0.8090312,0.00018331836,0.00008357941,0.00015631854,0.00018910685,0.0012688505,0.008707784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.00020797369,0.000030301446,0.00018645344,0.00014983483,0.00006139973],"domain_scores_gemma":[0.99813557,0.0012474807,0.00005812053,0.0003918815,0.000120120785,0.00004684957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250125,0.0012677255,0.0008483766,0.00063512375,0.0005187691,0.0013074477,0.0013731989,0.0011951836,0.01168457],"category_scores_gemma":[0.0035610502,0.00088031846,0.0017899045,0.00044005073,0.0017302387,0.002103385,0.002540299,0.002215639,0.003835244],"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.0002546247,0.000091354545,0.0007818296,0.00028692756,0.00012383891,0.00024754784,0.00049529993,0.17414431,0.03536577,0.17984383,0.0048726513,0.60349214],"study_design_scores_gemma":[0.000028147262,0.000057621848,0.00008378039,0.000034721583,0.000050276503,0.00014457892,0.00005426609,0.7848771,0.019625265,0.18786207,0.007159617,0.000022566739],"about_ca_topic_score_codex":0.0006190013,"about_ca_topic_score_gemma":0.0011634629,"teacher_disagreement_score":0.01168457,"about_ca_system_score_codex":0.00044926812,"about_ca_system_score_gemma":0.00063182035,"threshold_uncertainty_score":0.039088786},"labels":[],"label_agreement":null},{"id":"W2134909806","doi":"10.1007/3-540-44629-x_6","title":"Examination Timetables and Tabu Search with Longer-Term Memory","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":60,"is_retracted":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":"Tabu search; Computer science; Term (time); Scheduling (production processes); Relaxation (psychology); Algorithm; Mathematical optimization; Mathematics","score_opus":0.07418487081622242,"score_gpt":0.33057451720133596,"score_spread":0.2563896463851135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134909806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015108264,0.004459606,0.94971657,0.0005547897,0.00048221307,0.00015180666,0.00094751036,0.0035736253,0.025005568],"genre_scores_gemma":[0.12410368,0.0018772008,0.83102685,0.0002260833,0.00027929601,0.00040542916,0.0021000528,0.0013578525,0.03862354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.000521808,0.000078689474,0.00022050347,0.0003065928,0.00016701383],"domain_scores_gemma":[0.9965959,0.0021983408,0.00017581141,0.0006710455,0.00025406768,0.000104763756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017746363,0.0011174902,0.001398091,0.0013711145,0.001036728,0.002674421,0.004002804,0.0012857475,0.052232184],"category_scores_gemma":[0.008536631,0.0009867154,0.001314729,0.0054176524,0.000959117,0.00592696,0.001571051,0.0024757911,0.005640392],"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.00077256904,0.00025741066,0.00050918735,0.00055935927,0.00008629375,0.00009142007,0.00021587394,0.16007462,0.0018884211,0.20084544,0.03635309,0.59834635],"study_design_scores_gemma":[0.0002195158,0.00019951585,0.0004981698,0.00012720021,0.00008437936,0.00013239475,0.000116540046,0.50085896,0.0025172147,0.4599751,0.03521133,0.000059598493],"about_ca_topic_score_codex":0.00868443,"about_ca_topic_score_gemma":0.010875457,"teacher_disagreement_score":0.052232184,"about_ca_system_score_codex":0.0015068838,"about_ca_system_score_gemma":0.002125219,"threshold_uncertainty_score":0.17473406},"labels":[],"label_agreement":null},{"id":"W2135097260","doi":"10.1007/3-540-44886-1_26","title":"Model-Based Least-Squares Policy Evaluation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Estimator; Computation; Least-squares function approximation; Basis (linear algebra); Algorithm; Set (abstract data type); Markov decision process; Mathematical optimization; Markov process; Mathematics; Statistics","score_opus":0.03695932473739669,"score_gpt":0.29243450260143466,"score_spread":0.25547517786403795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135097260","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.011803143,0.00025903856,0.98315465,0.00025917694,0.00010116523,0.00009034839,0.000070943875,0.0017283027,0.0025332707],"genre_scores_gemma":[0.60628825,0.0001863423,0.3857311,0.0003383873,0.0001038313,0.00036958006,0.00046222494,0.00060726056,0.0059129368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997829,0.0010717843,0.00012418382,0.0003072908,0.00044785993,0.00021982203],"domain_scores_gemma":[0.99094373,0.0064854864,0.0003165701,0.00043543798,0.001583503,0.00023522892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00447492,0.0016914787,0.003368322,0.0012860456,0.0009250512,0.0020428377,0.0022376315,0.003436327,0.008252558],"category_scores_gemma":[0.016656836,0.0013967282,0.0010184898,0.00085397693,0.0010662291,0.0018975448,0.00187127,0.0023934552,0.0017963364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002642635,0.00008439445,0.00036023525,0.00008455896,0.000055614586,0.00003218612,0.000021681562,0.9292284,0.0005290694,0.002878066,0.0017487945,0.064712696],"study_design_scores_gemma":[0.000012168946,0.0000130901935,0.0000202146,0.000003425568,0.000003933445,0.00000366173,0.0000023430266,0.99886346,0.00021744914,0.00079593837,0.00006168731,0.0000026382907],"about_ca_topic_score_codex":0.01230198,"about_ca_topic_score_gemma":0.00945727,"teacher_disagreement_score":0.01230198,"about_ca_system_score_codex":0.0017067612,"about_ca_system_score_gemma":0.0036499908,"threshold_uncertainty_score":0.02760756},"labels":[],"label_agreement":null},{"id":"W2135275739","doi":"10.1007/978-3-540-45221-8_22","title":"Towards Automated Support for Deriving Test Data from UML Statecharts","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automation; Unified Modeling Language; Test case; Programming language; Normalization (sociology); Path (computing); Set (abstract data type); Event (particle physics); Data mining; Software engineering; Software; Machine learning","score_opus":0.04968096074950672,"score_gpt":0.30316102955412755,"score_spread":0.2534800688046208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135275739","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.009578518,0.00008510385,0.9360114,0.00015821897,0.000029907358,0.00015610493,0.0008395717,0.052195,0.00094625825],"genre_scores_gemma":[0.14398196,0.0001640562,0.841667,0.00019465422,0.000053511336,0.00040746914,0.005823443,0.005498395,0.002209529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941446,0.0017115081,0.0007296622,0.00082391733,0.002238998,0.00035122404],"domain_scores_gemma":[0.9503201,0.03446885,0.0024576832,0.0075872107,0.004741727,0.0004243741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046421746,0.0018803406,0.0016487223,0.004819785,0.0006945173,0.0035678619,0.004446965,0.0025354056,0.008338333],"category_scores_gemma":[0.037457474,0.0018860258,0.002289931,0.0026885709,0.0011602632,0.0049804663,0.0038895851,0.002851497,0.0044474737],"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.0006632724,0.00061241374,0.0070506646,0.0010803427,0.00024111099,0.0009583787,0.0013034572,0.038296692,0.036973383,0.028383322,0.021588149,0.86284876],"study_design_scores_gemma":[0.00040125035,0.00021348952,0.0021893978,0.00033997407,0.00021498633,0.0008025615,0.0002880904,0.79051363,0.116447456,0.062514074,0.025919212,0.00015586491],"about_ca_topic_score_codex":0.004547173,"about_ca_topic_score_gemma":0.0064887796,"teacher_disagreement_score":0.008338333,"about_ca_system_score_codex":0.0010026523,"about_ca_system_score_gemma":0.0018861988,"threshold_uncertainty_score":0.027894497},"labels":[],"label_agreement":null},{"id":"W2135471427","doi":"10.1007/978-3-642-04271-3_58","title":"A Fuzzy Region-Based Hidden Markov Model for Partial-Volume Classification in Brain MRI","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Partial volume; Voxel; Computer science; Pattern recognition (psychology); Artificial intelligence; Fuzzy logic; Computation; Contextual image classification; Image (mathematics); Algorithm","score_opus":0.02816207240631424,"score_gpt":0.30161384798780283,"score_spread":0.2734517755814886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135471427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02562012,0.0005751056,0.97266835,0.0002032697,0.000056367473,0.000027347958,0.00017220259,0.00041415403,0.00026310925],"genre_scores_gemma":[0.7898588,0.0008895682,0.20477419,0.00022957969,0.00018249603,0.00023497584,0.0006649238,0.00014749834,0.0030179508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993806,0.0001720331,0.000046212797,0.00018946394,0.00012327597,0.00008838564],"domain_scores_gemma":[0.9978002,0.0016375651,0.0001464746,0.00010089649,0.00025583833,0.000059016747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302955,0.00056473905,0.0016733308,0.0009629086,0.0006254945,0.0010950706,0.0028215556,0.0021533761,0.0015795061],"category_scores_gemma":[0.0038737422,0.0008398387,0.001689118,0.0008805844,0.0008528726,0.0015199273,0.00076090085,0.001661321,0.000608342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043165745,0.000104251114,0.0016539124,0.00012454638,0.00014662517,0.000140078,0.00011791409,0.87294364,0.0058976985,0.013079639,0.001080483,0.10427942],"study_design_scores_gemma":[0.0000036065192,0.000010113498,0.00012533207,0.000003858191,0.000011289851,0.000013053038,0.0000020017615,0.9978841,0.00022479406,0.0016748953,0.000040564446,0.0000064242226],"about_ca_topic_score_codex":0.018498465,"about_ca_topic_score_gemma":0.016421892,"teacher_disagreement_score":0.018498465,"about_ca_system_score_codex":0.0012850203,"about_ca_system_score_gemma":0.0011316178,"threshold_uncertainty_score":0.03678161},"labels":[],"label_agreement":null},{"id":"W2135915282","doi":"10.1007/11731139_66","title":"A Nonparametric Outlier Detection for Effectively Discovering Top-N Outliers from Engineering Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Outlier; Anomaly detection; Computer science; Nonparametric statistics; Data mining; Artificial intelligence; Pattern recognition (psychology); Statistics; Mathematics","score_opus":0.015691901354641755,"score_gpt":0.24531839966522867,"score_spread":0.2296264983105869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135915282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00453523,0.00008366265,0.9944904,0.000032814798,0.000024436054,0.00002451654,0.000043382173,0.0006234101,0.00014209186],"genre_scores_gemma":[0.09930131,0.00015427885,0.8985596,0.0000516496,0.00009548801,0.00012642024,0.00039380617,0.0001234291,0.0011941455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719894,0.000505368,0.00019729233,0.00051577354,0.0014116039,0.00017094269],"domain_scores_gemma":[0.9959747,0.0016727063,0.00039882204,0.00065116736,0.0011636296,0.00013895711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028636095,0.0012852424,0.0025750569,0.002350761,0.00091864384,0.0014994643,0.002959557,0.0016129006,0.0011832645],"category_scores_gemma":[0.009312647,0.0006839494,0.001552124,0.003389658,0.0010755248,0.001988851,0.002794556,0.0019434053,0.0009910766],"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.0005008201,0.00028964767,0.0039838543,0.00021194016,0.0002147401,0.00022910887,0.00014875691,0.11531232,0.027808737,0.0070484336,0.0045704264,0.83968115],"study_design_scores_gemma":[0.000021263964,0.00008939496,0.0008527682,0.0000085042675,0.000028388546,0.00017196444,0.000028912262,0.9854439,0.006452512,0.005465944,0.0014110069,0.000025412623],"about_ca_topic_score_codex":0.0023556007,"about_ca_topic_score_gemma":0.0032315135,"teacher_disagreement_score":0.002959557,"about_ca_system_score_codex":0.00046362376,"about_ca_system_score_gemma":0.0012073973,"threshold_uncertainty_score":0.015144408},"labels":[],"label_agreement":null},{"id":"W2136278229","doi":"10.1007/978-3-642-21928-3_25","title":"Fuzzy Logic Approach for Spatially Variable Nitrogen Fertilization of Corn Based on Soil, Crop and Precipitation Information","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"Agriculture and Agri-Food Canada","funders":"","keywords":"Irrigation; Nitrogen; Precipitation; Nitrogen fertilizer; Fuzzy logic; Fertilizer; Variable (mathematics); Fuzzy inference; Agricultural engineering; Environmental science; Computer science; Mathematics; Agronomy; Artificial intelligence; Geography; Adaptive neuro fuzzy inference system; Fuzzy control system; Meteorology; Physics; Engineering; Biology","score_opus":0.019608603519719946,"score_gpt":0.20076817656740345,"score_spread":0.18115957304768351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136278229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032054033,0.00069641555,0.95965695,0.00016409364,0.00006441233,0.00003110823,0.00007506079,0.00016487009,0.0070930677],"genre_scores_gemma":[0.8344392,0.000816586,0.15932925,0.000081387734,0.00006132323,0.00006150561,0.00012871082,0.000020764453,0.0050614066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998847,0.000019928524,0.0000069928815,0.000028367775,0.00004699397,0.000012970076],"domain_scores_gemma":[0.99988866,0.0000582064,0.000010873283,0.0000051842003,0.00003245717,0.0000046249584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026869026,0.00029844462,0.00043291447,0.00041344555,0.00030704352,0.00062526384,0.0008194322,0.0004759657,0.0016091993],"category_scores_gemma":[0.00039493255,0.0001733756,0.0005842229,0.0003976126,0.00019155857,0.00053258374,0.00023166055,0.00035240653,0.00014261343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015802919,0.000086843684,0.0008139069,0.0001787685,0.00008758392,0.00028420292,0.00010439405,0.81884617,0.017093098,0.026291132,0.0010881965,0.13496758],"study_design_scores_gemma":[0.0000058771298,0.000024636764,0.00016772533,0.00000547358,0.000017951957,0.000028339035,0.000012328259,0.99221534,0.0010169579,0.006100985,0.0003980488,0.000006385322],"about_ca_topic_score_codex":0.006786335,"about_ca_topic_score_gemma":0.0071201916,"teacher_disagreement_score":0.006786335,"about_ca_system_score_codex":0.0007411209,"about_ca_system_score_gemma":0.0004811346,"threshold_uncertainty_score":0.013493717},"labels":[],"label_agreement":null},{"id":"W2136322450","doi":"10.1007/11558590_52","title":"Robot Security and Failure Detection Using Bayesian Fusion","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Correctness; Fuse (electrical); Computer science; Bayesian probability; Sensor fusion; Artificial intelligence; Robot; Formalism (music); Data mining; Machine learning; Engineering; Algorithm","score_opus":0.011331376757613055,"score_gpt":0.24071784395063042,"score_spread":0.22938646719301736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136322450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072855824,0.00034335107,0.9903972,0.000083711995,0.00003335147,0.00001312703,0.00002145531,0.00026972225,0.0015524384],"genre_scores_gemma":[0.6567606,0.0011046681,0.33424526,0.000097907054,0.0001330684,0.00010552247,0.00023469642,0.00012478014,0.0071934625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878496,0.0002139529,0.00005047981,0.00021454197,0.00062545313,0.00011064726],"domain_scores_gemma":[0.9985078,0.0007987013,0.00016023965,0.0001735031,0.00032187614,0.00003788252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632921,0.0009886854,0.0015759944,0.0014965271,0.00055043667,0.0012131649,0.0014118112,0.0016012455,0.0020037051],"category_scores_gemma":[0.00503646,0.0008190922,0.0010899237,0.0013461392,0.0011838992,0.0025786553,0.0016605945,0.0013418014,0.00081564113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005111513,0.00009753986,0.0019686623,0.00017647874,0.00016350001,0.0001726509,0.00014463447,0.5096223,0.019210571,0.03941232,0.002290026,0.42623016],"study_design_scores_gemma":[0.000009307797,0.000052495478,0.0007250946,0.000012854379,0.000028945698,0.00011658644,0.000014644281,0.9661063,0.004468216,0.027579103,0.0008578267,0.000028562345],"about_ca_topic_score_codex":0.0020303812,"about_ca_topic_score_gemma":0.0018389252,"teacher_disagreement_score":0.0020303812,"about_ca_system_score_codex":0.0007224449,"about_ca_system_score_gemma":0.00060374767,"threshold_uncertainty_score":0.008635759},"labels":[],"label_agreement":null},{"id":"W2136390208","doi":"10.1007/11915355_22","title":"Objective Scoring for Computing Competition Tasks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Olympiad; Computer science; Competition (biology); Informatics; Artificial intelligence; Machine learning; Mathematics education","score_opus":0.016077286610039394,"score_gpt":0.25738217320312845,"score_spread":0.24130488659308905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136390208","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.03847037,0.0015063884,0.8955786,0.00041280966,0.00036250215,0.00034149928,0.00082453864,0.0017409257,0.060762394],"genre_scores_gemma":[0.46743438,0.0010493472,0.45228222,0.00014132871,0.00027100107,0.00080814987,0.0032322542,0.000951644,0.073829606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972792,0.00093650905,0.00014361474,0.00020191638,0.0012237104,0.00021502374],"domain_scores_gemma":[0.9952756,0.002577816,0.0002677497,0.00044095784,0.0011550314,0.00028283728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028308427,0.00095039036,0.00069704856,0.0012151418,0.00046762213,0.0014671925,0.001438306,0.0005879785,0.0153867975],"category_scores_gemma":[0.011586086,0.0002663745,0.0003971561,0.0015530835,0.00035989805,0.0015750756,0.0013166305,0.001438573,0.0030093102],"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.00039208573,0.00027548347,0.002302296,0.00022164572,0.000040976964,0.000027005583,0.00010624886,0.037188984,0.002110728,0.02528231,0.03988956,0.8921628],"study_design_scores_gemma":[0.00013742642,0.0006627689,0.021433212,0.00017829661,0.000057553607,0.00019051805,0.00022742197,0.81687313,0.0052607213,0.12285671,0.031999126,0.00012313035],"about_ca_topic_score_codex":0.0023661354,"about_ca_topic_score_gemma":0.006328553,"teacher_disagreement_score":0.0153867975,"about_ca_system_score_codex":0.0009196776,"about_ca_system_score_gemma":0.0010982717,"threshold_uncertainty_score":0.051473916},"labels":[],"label_agreement":null},{"id":"W2136427556","doi":"10.1007/11555261_10","title":"TractorBeam Selection Aids: Improving Target Acquisition for Pointing Input on Tabletop Displays","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia; Dalhousie University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Cursor (databases); Human–computer interaction; Target acquisition; Input device; Interaction technique; Artificial intelligence; Computer hardware","score_opus":0.010706750591856499,"score_gpt":0.24746616543862301,"score_spread":0.23675941484676652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136427556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12175702,0.0014519506,0.83425254,0.000099011355,0.00013591036,0.00022359673,0.0007521412,0.02933323,0.011994592],"genre_scores_gemma":[0.2818996,0.001604072,0.67422825,0.00024936715,0.000075008276,0.00031463508,0.0020686556,0.0034501487,0.036110274],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975437,0.000040209805,0.000013772871,0.000047943166,0.00011735287,0.000026247972],"domain_scores_gemma":[0.99937195,0.00032926927,0.00003618539,0.00007950502,0.00014513065,0.00003800462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026311187,0.0011511999,0.00063580356,0.00043308534,0.0002772887,0.0008484659,0.0013851764,0.00083362625,0.026395237],"category_scores_gemma":[0.001573542,0.0004087086,0.00035745167,0.00049670663,0.0001713201,0.0009937547,0.0011626735,0.00068926654,0.00555723],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015774138,0.00012740154,0.00056476943,0.00048855215,0.00005120847,0.00034256614,0.00024972396,0.0022201336,0.35991797,0.00078682764,0.0073332284,0.62634027],"study_design_scores_gemma":[0.0005006809,0.0023224426,0.011400107,0.00033154793,0.00043037263,0.0045111976,0.000329298,0.20541532,0.7029837,0.0019605104,0.06964079,0.00017401364],"about_ca_topic_score_codex":0.0014776981,"about_ca_topic_score_gemma":0.002627832,"teacher_disagreement_score":0.026395237,"about_ca_system_score_codex":0.00013220766,"about_ca_system_score_gemma":0.00021460844,"threshold_uncertainty_score":0.088300824},"labels":[],"label_agreement":null},{"id":"W2136481517","doi":"10.1007/978-3-642-02611-9_70","title":"Modeling of Elastic Behavior of 3D Deformable Objects from Range and Tactile Imaging","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Deformation (meteorology); Range (aeronautics); Computer science; Joint (building); Artificial intelligence; Computer vision; Materials science; Engineering; Structural engineering","score_opus":0.0240527139527208,"score_gpt":0.24809740137679684,"score_spread":0.22404468742407604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136481517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052484233,0.0007079643,0.9386517,0.00012542805,0.000038572103,0.00005879984,0.00017457292,0.00051294675,0.0072457558],"genre_scores_gemma":[0.83050615,0.0019382951,0.15514994,0.00009275696,0.000038672126,0.00015643913,0.00040845695,0.0002672625,0.011441953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983466,0.000018921726,0.000010674648,0.000026314949,0.00009515771,0.000014201781],"domain_scores_gemma":[0.99982184,0.000083055325,0.000030403256,0.000027197455,0.000025893647,0.0000116978135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021316114,0.0006369056,0.0005386208,0.0005375048,0.00024703494,0.00083405216,0.00116374,0.0015228667,0.0021161363],"category_scores_gemma":[0.00079466036,0.00084388454,0.0009323414,0.0005800489,0.00046822452,0.0011838322,0.00061983836,0.00057287957,0.0005757361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015556385,0.00002620771,0.00025063858,0.000053693147,0.000014161209,0.00012321609,0.000053737513,0.96891236,0.012817603,0.0034838468,0.0001488853,0.01410007],"study_design_scores_gemma":[0.0000011984644,0.0000069024827,0.00019516342,0.0000046871055,0.0000030402612,0.000060571754,0.0000054683906,0.9972301,0.0012131849,0.0009946298,0.00027944223,0.000005605271],"about_ca_topic_score_codex":0.0029718974,"about_ca_topic_score_gemma":0.0030480726,"teacher_disagreement_score":0.0029718974,"about_ca_system_score_codex":0.00039189137,"about_ca_system_score_gemma":0.00042700657,"threshold_uncertainty_score":0.007079184},"labels":[],"label_agreement":null},{"id":"W2136501818","doi":"10.1007/978-3-642-40579-2_12","title":"Suffix Conjugates for a Class of Morphic Subshifts","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg","funders":"","keywords":"Combinatorics; Bijection; Conjugacy class; Morphism; Alphabet; Closure (psychology); Mathematics; Discrete mathematics","score_opus":0.01596543641131196,"score_gpt":0.23155511198402745,"score_spread":0.2155896755727155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136501818","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.52832544,0.0016530901,0.26271883,0.0010537831,0.0010129027,0.00016035452,0.00070452417,0.0015359432,0.2028352],"genre_scores_gemma":[0.9076654,0.00055068353,0.037375238,0.00029145984,0.0003337937,0.000115771734,0.0005651664,0.00046433846,0.052638166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953735,0.00006721488,0.000046980334,0.00013182471,0.00013902049,0.00007765822],"domain_scores_gemma":[0.9995347,0.00014250865,0.00006339719,0.00010401368,0.00008663666,0.00006878321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003608084,0.0005236267,0.0005438697,0.0010681185,0.0014691945,0.0025788415,0.0005168944,0.0011248961,0.009085162],"category_scores_gemma":[0.0011173924,0.00037025262,0.00078929565,0.0010371859,0.0016366668,0.0024554445,0.0013313377,0.0014114059,0.0021167658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061506995,0.000020401816,0.00017900077,0.000030469611,0.0000055760192,0.00026768915,0.00030034248,0.0003089189,0.0039284895,0.9806817,0.00121842,0.0129974345],"study_design_scores_gemma":[0.000033389202,0.00006346046,0.00040542494,0.000020104866,0.000018501345,0.0010454063,0.0002326027,0.0035449637,0.004964652,0.96396583,0.025675213,0.000030416937],"about_ca_topic_score_codex":0.00017945645,"about_ca_topic_score_gemma":0.00019319345,"teacher_disagreement_score":0.009085162,"about_ca_system_score_codex":0.0006683841,"about_ca_system_score_gemma":0.00039175575,"threshold_uncertainty_score":0.030392826},"labels":[],"label_agreement":null},{"id":"W2136523134","doi":"10.5555/1765175.1765214","title":"Consistent behaviour representation in activity and sequence diagrams","year":2000,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Carleton University","funders":"","keywords":"Sequence diagram; Computer science; Story-driven modeling; Activity diagram; Communication diagram; Interaction overview diagram; Graph rewriting; Block diagram; Sequence (biology); Unified Modeling Language; Programming language; Theoretical computer science; Diagram; Consistency (knowledge bases); Representation (politics); Graph; Class diagram; Artificial intelligence","score_opus":0.022846751082445285,"score_gpt":0.27951511566636855,"score_spread":0.2566683645839233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136523134","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.0070101335,0.00005816006,0.99084985,0.00007839409,0.000015939051,0.00006881144,0.00014847571,0.0009892337,0.0007809882],"genre_scores_gemma":[0.25475857,0.00018959606,0.7403556,0.00009542268,0.0000319987,0.0004771252,0.001339583,0.0005030515,0.0022490968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937966,0.002258177,0.0006687147,0.0009805575,0.0019621074,0.0003338553],"domain_scores_gemma":[0.98687774,0.007563576,0.001121249,0.002308553,0.0018606882,0.000268113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046791234,0.0008095758,0.0009676564,0.0025080827,0.0008302009,0.003354668,0.0020846673,0.0021615566,0.0026223413],"category_scores_gemma":[0.019540116,0.0010424238,0.0015872159,0.001956448,0.001694196,0.0050763125,0.0017679024,0.0019202096,0.00065832183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004001414,0.00025881233,0.003735516,0.0004854222,0.00011288347,0.00062963954,0.0019405235,0.13779896,0.00869981,0.6689861,0.002732838,0.17421934],"study_design_scores_gemma":[0.000090967565,0.0001167599,0.00052002154,0.00013855798,0.00014342522,0.0001955942,0.00021695207,0.55877846,0.010343957,0.41437638,0.015030939,0.00004797477],"about_ca_topic_score_codex":0.0054461155,"about_ca_topic_score_gemma":0.0055079106,"teacher_disagreement_score":0.0054461155,"about_ca_system_score_codex":0.0012888385,"about_ca_system_score_gemma":0.0022546796,"threshold_uncertainty_score":0.024745882},"labels":[],"label_agreement":null},{"id":"W2136612619","doi":"10.1007/978-3-540-73086-6_10","title":"Rule-Based Simplification in Vector-Product Spaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Western University","funders":"","keywords":"Cartesian product; Scalar (mathematics); Computer science; Vector space; Cross product; Scalar multiplication; Representation (politics); Product (mathematics); Axiom; Space (punctuation); Component (thermodynamics); Algebra over a field; Theoretical computer science; Algorithm; Mathematics; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.025028450120509034,"score_gpt":0.26177172669665255,"score_spread":0.23674327657614352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136612619","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.0071045496,0.000362478,0.9835976,0.00008251955,0.000067518864,0.00005880816,0.00012336734,0.0008234763,0.0077796797],"genre_scores_gemma":[0.18174843,0.000913284,0.8037798,0.00010026885,0.00008557218,0.00011352018,0.0009760704,0.0006197312,0.011663399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760073,0.00053854246,0.00023295773,0.0002943253,0.0012072527,0.00012608472],"domain_scores_gemma":[0.9972277,0.0012840148,0.00009466336,0.00080923125,0.00052331126,0.00006110936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611833,0.0005712775,0.0012817187,0.0012899596,0.00081403076,0.0023210403,0.0021131218,0.0006439335,0.0074719293],"category_scores_gemma":[0.0049550366,0.0006764495,0.0017025782,0.0021283946,0.001819756,0.0039361776,0.001975886,0.0018656744,0.0025467288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013362095,0.00009366667,0.00033528838,0.00036083336,0.00009040944,0.00026284377,0.00038488282,0.08009708,0.0061560413,0.47993806,0.0074764127,0.42467085],"study_design_scores_gemma":[0.000030190477,0.000060339706,0.00022085752,0.000052653475,0.000066190616,0.00026700346,0.00007804131,0.30163383,0.010085061,0.6609589,0.026509007,0.000037857048],"about_ca_topic_score_codex":0.0019994073,"about_ca_topic_score_gemma":0.002136093,"teacher_disagreement_score":0.0074719293,"about_ca_system_score_codex":0.0006629551,"about_ca_system_score_gemma":0.0006420852,"threshold_uncertainty_score":0.024996042},"labels":[],"label_agreement":null},{"id":"W2136631923","doi":"10.1007/978-3-319-08506-7_4","title":"The Best of Both Worlds: Combining Information-Theoretic and Computational PIR for Communication Efficiency","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Server; Scheme (mathematics); Private information retrieval; Component (thermodynamics); Certificate; Computer network; Database; Computer security; Theoretical computer science","score_opus":0.009545955394705275,"score_gpt":0.23722258951430839,"score_spread":0.22767663411960312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136631923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017470611,0.0073420997,0.88351953,0.009470566,0.00071779185,0.00010622859,0.00017223421,0.00037134037,0.08082956],"genre_scores_gemma":[0.80796504,0.006964106,0.16583823,0.0018724476,0.002869388,0.0002507889,0.00019662731,0.00035982206,0.013683564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99042517,0.005061699,0.0003583348,0.0007977258,0.0027819995,0.0005750343],"domain_scores_gemma":[0.95959634,0.029661106,0.0012186302,0.0072201355,0.0018700345,0.00043379643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010946069,0.0015324171,0.0031244876,0.002729065,0.0018261585,0.007163769,0.004065683,0.0040462343,0.0076604323],"category_scores_gemma":[0.03681041,0.0009784176,0.0013985158,0.0029905546,0.012169798,0.02669953,0.008825992,0.0073865284,0.0018291032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009204864,0.000070573114,0.0001940018,0.00017428926,0.00003352023,0.000044070508,0.00008492325,0.021103842,0.0004890819,0.9420728,0.0032589964,0.032381967],"study_design_scores_gemma":[0.0000074127875,0.000025072306,0.000047382448,0.000042695454,0.0000122487845,0.000058668476,0.000026021444,0.060204502,0.0005669144,0.9374724,0.0015196699,0.000017075241],"about_ca_topic_score_codex":0.00030967084,"about_ca_topic_score_gemma":0.0003183669,"teacher_disagreement_score":0.010946069,"about_ca_system_score_codex":0.0023763664,"about_ca_system_score_gemma":0.001873669,"threshold_uncertainty_score":0.057889044},"labels":[],"label_agreement":null},{"id":"W2136663225","doi":"10.1007/11424918_30","title":"Comparing Dimension Reduction Techniques for Document Clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Cluster analysis; Computer science; Random projection; Dimensionality reduction; Dimension (graph theory); Projection (relational algebra); Pattern recognition (psychology); Document clustering; Projection pursuit; Clustering high-dimensional data; Data mining; Artificial intelligence; Benchmark (surveying); Reduction (mathematics); Algorithm; Mathematics","score_opus":0.024464175119349015,"score_gpt":0.28357909744573234,"score_spread":0.25911492232638333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136663225","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.2301123,0.017911935,0.73115206,0.0009717226,0.0009625656,0.00037983916,0.001652412,0.0052172104,0.011639895],"genre_scores_gemma":[0.2586778,0.004187467,0.725045,0.00014911812,0.0003140479,0.00024163853,0.004215157,0.0006307009,0.006539047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958448,0.0015725506,0.00031029418,0.00039842466,0.0016323768,0.00024155366],"domain_scores_gemma":[0.9815865,0.013108097,0.00030259247,0.002238437,0.0025643772,0.00019992456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004187403,0.001260924,0.0016691468,0.0042576063,0.0010460035,0.0022086892,0.0014926873,0.0012995171,0.0032719604],"category_scores_gemma":[0.017843623,0.00047199635,0.0015825906,0.005205421,0.0006267596,0.003385897,0.0016435721,0.0012477961,0.0014144307],"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.0026385796,0.0003637597,0.002079918,0.00053385756,0.00054691336,0.000043517924,0.00031948212,0.06756013,0.007838436,0.0063913553,0.01286068,0.8988235],"study_design_scores_gemma":[0.00047610435,0.0011143775,0.010204262,0.00012021957,0.00066361023,0.0004125144,0.000888922,0.92040825,0.026290195,0.028574143,0.010667491,0.00017996087],"about_ca_topic_score_codex":0.005760623,"about_ca_topic_score_gemma":0.006564576,"teacher_disagreement_score":0.005760623,"about_ca_system_score_codex":0.0011105705,"about_ca_system_score_gemma":0.001020826,"threshold_uncertainty_score":0.02214539},"labels":[],"label_agreement":null},{"id":"W2136686792","doi":"10.1007/978-3-642-10631-6_87","title":"Reconstructing Polygons from Scanner Data","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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 Manitoba; University of Waterloo","funders":"","keywords":"Scanner; Computer science; Point in polygon; Visibility; Point (geometry); Range (aeronautics); Polygon (computer graphics); Set (abstract data type); Computational geometry; Plane (geometry); Computer vision; Algorithm; Topology (electrical circuits); Polygon mesh; Computer graphics (images); Artificial intelligence; Geometry; Combinatorics; Mathematics; Geography","score_opus":0.023818106881254655,"score_gpt":0.225317209159352,"score_spread":0.20149910227809734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136686792","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.007635768,0.00016863296,0.9880604,0.00004802552,0.000028856684,0.00005534413,0.00028449038,0.002300648,0.0014178971],"genre_scores_gemma":[0.0775593,0.000685591,0.9159348,0.000029886753,0.00002138056,0.000057687004,0.0018404066,0.0009015857,0.0029694797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994653,0.00005580087,0.000030114428,0.00012252196,0.00028292922,0.000043279168],"domain_scores_gemma":[0.9990996,0.00034550237,0.000057149828,0.00034581192,0.0001243315,0.000027621332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004641374,0.0016527112,0.0010659477,0.0015151809,0.000265376,0.0015785993,0.001580851,0.0012012366,0.004199541],"category_scores_gemma":[0.0023841248,0.0019957237,0.0012692007,0.00192188,0.0007997783,0.0015315776,0.0016726061,0.001705923,0.0037080806],"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.00015645502,0.00005222794,0.0010786885,0.0005038038,0.00009180988,0.00052766694,0.0002534391,0.21710098,0.038658906,0.011864742,0.005399639,0.72431165],"study_design_scores_gemma":[0.000020521422,0.00006668945,0.0007159133,0.00006679243,0.000041791816,0.0010150513,0.00015425232,0.91336775,0.048830803,0.02050867,0.015168269,0.000043529864],"about_ca_topic_score_codex":0.0024931782,"about_ca_topic_score_gemma":0.0030972695,"teacher_disagreement_score":0.004199541,"about_ca_system_score_codex":0.00028831107,"about_ca_system_score_gemma":0.0007193643,"threshold_uncertainty_score":0.014048815},"labels":[],"label_agreement":null},{"id":"W2136689788","doi":"10.1007/978-3-319-10602-1_5","title":"Spectral Edge Image Fusion: Theory and Applications","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Structure tensor; Rendering (computer graphics); Artificial intelligence; Contrast (vision); Computer vision; Image fusion; Image (mathematics); Image gradient; Algorithm; Image processing; Edge detection","score_opus":0.005407876286158084,"score_gpt":0.22661171584089917,"score_spread":0.2212038395547411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136689788","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.0035947934,0.049558237,0.9101692,0.0008230863,0.00066326774,0.000029408073,0.00013681522,0.00040811062,0.03461711],"genre_scores_gemma":[0.1882745,0.104170576,0.6349113,0.0009814949,0.0022870495,0.00015379724,0.00054475205,0.00030156883,0.06837497],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999711,0.000037247853,0.000017340504,0.00005902182,0.00015583789,0.000019476884],"domain_scores_gemma":[0.99972326,0.000116305826,0.000020190751,0.00003814156,0.00009337267,0.000008790907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044728667,0.00052267825,0.00072004774,0.001324828,0.00029838827,0.0015849726,0.00078313536,0.0011977741,0.0049630646],"category_scores_gemma":[0.0007421202,0.0004520441,0.00053068553,0.0026933749,0.00088552514,0.0017660889,0.00088011514,0.001356761,0.002402572],"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.000044799217,0.00005111383,0.00020791123,0.0006102238,0.000040035313,0.00008331878,0.00011362529,0.01680646,0.014586905,0.22093171,0.018929312,0.7275946],"study_design_scores_gemma":[0.000011311868,0.0001330246,0.001399928,0.00028437548,0.00007434408,0.0017768908,0.00013624258,0.2867558,0.02308496,0.4762212,0.21002616,0.00009578425],"about_ca_topic_score_codex":0.00026455623,"about_ca_topic_score_gemma":0.0003385202,"teacher_disagreement_score":0.0049630646,"about_ca_system_score_codex":0.0004141481,"about_ca_system_score_gemma":0.00026451083,"threshold_uncertainty_score":0.016603112},"labels":[],"label_agreement":null},{"id":"W2136902017","doi":"10.1007/978-3-540-73110-8_30","title":"Can Virtual Humans Be More Engaging Than Real Ones?","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language, Metaphor, and Cognition","field":"Psychology","cited_by":106,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Research, Development and Engineering Command","keywords":"Computer science; Active listening; Feeling; Phenomenon; Social connectedness; Simple (philosophy); Negotiation; Human–computer interaction; Face-to-face interaction; Character (mathematics); Face (sociological concept); Instant messaging; Virtual actor; Multimedia; Cognitive psychology; Internet privacy; Psychology; Social psychology; Communication; Virtual reality; World Wide Web; Epistemology; Sociology","score_opus":0.035676219454473544,"score_gpt":0.3097197950192084,"score_spread":0.27404357556473485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136902017","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.21529669,0.034719072,0.08638919,0.055957608,0.0054672775,0.00008989705,0.00026421846,0.00066023594,0.6011558],"genre_scores_gemma":[0.9529976,0.004195575,0.013964206,0.0025675937,0.00047702747,0.0001295975,0.00009845831,0.00019831565,0.025371687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99775654,0.0013345211,0.00004791544,0.0002650826,0.00032687443,0.0002691431],"domain_scores_gemma":[0.9966035,0.0018611305,0.0003088203,0.00040067453,0.00028532217,0.0005405131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216809,0.0006093935,0.00047899032,0.0005050576,0.0012676307,0.0100409165,0.0011866756,0.002666337,0.018623244],"category_scores_gemma":[0.011295916,0.00046353493,0.0003247345,0.00039305646,0.0074520507,0.017332714,0.0033358603,0.0020762912,0.0025408936],"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.00021979601,0.00008084895,0.001311638,0.0007786146,0.00003098106,0.00014280879,0.018212458,0.00052532135,0.003969314,0.88488865,0.016085522,0.07375402],"study_design_scores_gemma":[0.000062388586,0.00024862494,0.0038657924,0.0006369671,0.000045243283,0.0009788261,0.027033957,0.0014753758,0.0020543018,0.71078175,0.25272542,0.000091373106],"about_ca_topic_score_codex":0.00038972608,"about_ca_topic_score_gemma":0.00042850795,"teacher_disagreement_score":0.018623244,"about_ca_system_score_codex":0.00042654906,"about_ca_system_score_gemma":0.00039166244,"threshold_uncertainty_score":0.06230092},"labels":[],"label_agreement":null},{"id":"W2136978097","doi":"10.1007/978-3-540-69554-7_16","title":"Mixed-Fidelity Prototyping of User Interfaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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 Saskatchewan","funders":"","keywords":"Fidelity; Commit; Computer science; Rapid prototyping; Interface (matter); Process (computing); Human–computer interaction; User interface; Software engineering; Engineering; Programming language; Operating system; Database","score_opus":0.055027689131631564,"score_gpt":0.28618182071152876,"score_spread":0.2311541315798972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136978097","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.04092537,0.0011368223,0.94428927,0.000088227345,0.00020679687,0.00038961606,0.00010089822,0.0018885782,0.010974481],"genre_scores_gemma":[0.34550607,0.00066669553,0.6322905,0.00008571106,0.00005111812,0.0006793293,0.00018659398,0.000509249,0.02002474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954181,0.0017727761,0.00022989466,0.00032428262,0.0020202082,0.00023484157],"domain_scores_gemma":[0.98810995,0.006977777,0.00031086217,0.0026604456,0.0016976006,0.00024337618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033861739,0.0011083675,0.0009923778,0.0007350438,0.0006024466,0.002966729,0.0028521384,0.0016454128,0.012800156],"category_scores_gemma":[0.013569278,0.0015615233,0.0007567266,0.00038591216,0.0007629374,0.0022466637,0.0029925671,0.0012089665,0.00237162],"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.0010311663,0.0005154037,0.0015388954,0.001894154,0.00019245505,0.0007313204,0.0024614895,0.02662523,0.338177,0.024984643,0.0049783997,0.59686995],"study_design_scores_gemma":[0.00031924606,0.005992912,0.004957276,0.0007238607,0.0002672047,0.00419606,0.00065066654,0.3095778,0.5619873,0.016746579,0.094185926,0.0003951825],"about_ca_topic_score_codex":0.00040671168,"about_ca_topic_score_gemma":0.00063322316,"teacher_disagreement_score":0.012800156,"about_ca_system_score_codex":0.00037818428,"about_ca_system_score_gemma":0.00034517175,"threshold_uncertainty_score":0.04282081},"labels":[],"label_agreement":null},{"id":"W2137031274","doi":"10.1007/3-540-45414-4_14","title":"Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Calgary","funders":"","keywords":"Spanning tree; Computer science; Distributed minimum spanning tree; Minimum spanning tree; Message passing; Atomicity; Identifier; Self-stabilization; Tree (set theory); Distributed computing; Connected dominating set; Euclidean minimum spanning tree; Theoretical computer science; Distributed algorithm; Algorithm; Computer network; Discrete mathematics; Combinatorics; Mathematics; Database transaction","score_opus":0.014065851578548462,"score_gpt":0.2336594783033897,"score_spread":0.21959362672484126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137031274","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.071222275,0.0002444913,0.92313856,0.00021493823,0.00005597932,0.000053542426,0.000049825423,0.00072883593,0.0042915693],"genre_scores_gemma":[0.62611634,0.00035377184,0.3676031,0.000059825958,0.00005486196,0.0001374142,0.00021702757,0.0001347777,0.0053228633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997743,0.000068976944,0.000012149566,0.000035468383,0.00008328917,0.000025776226],"domain_scores_gemma":[0.9995216,0.00018809891,0.000044878376,0.00011997208,0.00009184991,0.000033561195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036283906,0.00026335378,0.00051157916,0.0005560213,0.0006109518,0.00054864626,0.0010311636,0.00055620045,0.0010751494],"category_scores_gemma":[0.0013208601,0.00030021652,0.00030361128,0.00073811476,0.00038269337,0.0010712459,0.000988757,0.00067819405,0.00027427785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031077614,0.00017624996,0.00087254343,0.00031832565,0.00007542543,0.00017827643,0.00042208654,0.35095295,0.062559016,0.24205303,0.0063474253,0.33573392],"study_design_scores_gemma":[0.000034808003,0.00008198925,0.0003253186,0.000019675545,0.000028002696,0.00010221084,0.000040160317,0.87508994,0.0136574125,0.10728425,0.0033214742,0.000014746199],"about_ca_topic_score_codex":0.0004942448,"about_ca_topic_score_gemma":0.0006244855,"teacher_disagreement_score":0.0010751494,"about_ca_system_score_codex":0.0004030264,"about_ca_system_score_gemma":0.00039925324,"threshold_uncertainty_score":0.003596723},"labels":[],"label_agreement":null},{"id":"W2137111319","doi":"10.1007/978-3-642-23623-5_34","title":"Automated Planning of Computer Assisted Mosaic Arthroplasty","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Osteoarthritis Treatment and Mechanisms","field":"Medicine","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 Guelph; Kingston General Hospital; Queen's University","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Mosaic; Plan (archaeology); Set (abstract data type); Joint (building); Engineering drawing; Programming language; Engineering; Geology","score_opus":0.027229902381614213,"score_gpt":0.27080129079833526,"score_spread":0.24357138841672105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137111319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07434795,0.0006093005,0.916904,0.0001732239,0.00005384558,0.0001950445,0.0003526275,0.0030021928,0.004361804],"genre_scores_gemma":[0.6052688,0.0003046079,0.391112,0.000046630532,0.000023878656,0.00015438502,0.00039585747,0.00032965964,0.0023641854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995869,0.000117989875,0.000025268979,0.000062698746,0.000159066,0.000048106365],"domain_scores_gemma":[0.9994012,0.00036450668,0.00004648546,0.00008578816,0.00007428433,0.00002764285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004965087,0.0006426708,0.0008286558,0.0007332423,0.00046819882,0.0010745223,0.00077539985,0.0007719197,0.0039414885],"category_scores_gemma":[0.0015402018,0.0010542982,0.00076518324,0.00058703637,0.0004903813,0.00046559237,0.000864278,0.0004828732,0.000519596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049550296,0.00007018089,0.002523288,0.00015541085,0.000058267848,0.00030825555,0.00017883381,0.79407007,0.012901362,0.0047442997,0.0033182227,0.18117626],"study_design_scores_gemma":[0.000021837706,0.000059123977,0.0005803917,0.000009896385,0.000011789012,0.00014832387,0.000024727813,0.9925135,0.0026147808,0.0023476281,0.0016540082,0.000014029856],"about_ca_topic_score_codex":0.007900688,"about_ca_topic_score_gemma":0.013059047,"teacher_disagreement_score":0.007900688,"about_ca_system_score_codex":0.0005061569,"about_ca_system_score_gemma":0.0020652716,"threshold_uncertainty_score":0.0157094},"labels":[],"label_agreement":null},{"id":"W2137162229","doi":"10.1007/978-3-642-00672-2_1","title":"Distributed XML Processing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Efficient XML Interchange; Streaming XML; XML Schema Editor; XML database; XML; XML validation; XML Schema (W3C); XML framework; Database; Data exchange; XML Signature; XML Encryption; Focus (optics); External Data Representation; Information retrieval; World Wide Web; Operating system","score_opus":0.014627140083384936,"score_gpt":0.2493476856381141,"score_spread":0.23472054555472915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137162229","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.004268185,0.0017175007,0.8339847,0.00078756374,0.0006521774,0.00018917759,0.0009386501,0.02096762,0.13649449],"genre_scores_gemma":[0.082636625,0.0030161317,0.52481264,0.000674321,0.00049793493,0.00027009432,0.008366948,0.0038706772,0.3758547],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999446,0.00007101773,0.000040921055,0.0001430521,0.00026079948,0.000038324564],"domain_scores_gemma":[0.9995054,0.000084592306,0.000011324425,0.00027789464,0.00009896749,0.000021773054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063858676,0.00087822066,0.0006763573,0.0010041627,0.00083424756,0.0021625534,0.0017279119,0.0007435633,0.04353909],"category_scores_gemma":[0.0010748042,0.00065319426,0.00061811134,0.0015611686,0.00053906895,0.00261733,0.001394099,0.0012208719,0.023238136],"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.00017333053,0.00014269531,0.00028242308,0.00023735662,0.00004054687,0.00014749872,0.00022520187,0.004234185,0.017161204,0.12560594,0.12557502,0.7261746],"study_design_scores_gemma":[0.00007217739,0.00009180584,0.0007658893,0.00011072747,0.00007223062,0.0008688486,0.000118149466,0.07393517,0.047575362,0.170186,0.70615715,0.000046511675],"about_ca_topic_score_codex":0.0010051146,"about_ca_topic_score_gemma":0.0011830949,"teacher_disagreement_score":0.04353909,"about_ca_system_score_codex":0.00055117265,"about_ca_system_score_gemma":0.0006123847,"threshold_uncertainty_score":0.14565271},"labels":[],"label_agreement":null},{"id":"W2137313206","doi":"10.1007/3-540-44569-2_12","title":"Issues in Managing Soft QoS Requirements in Distributed Systems Using a Policy-Based Framework","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Quality of service; Scheduling (production processes); Database transaction; Distributed computing; Architecture; Service-oriented architecture; Multimedia; Software engineering; Computer network; Database; Web service; World Wide Web","score_opus":0.029456120765986544,"score_gpt":0.28982302124582754,"score_spread":0.260366900479841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137313206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017738197,0.0050174193,0.9051918,0.026788717,0.0011323289,0.00022251377,0.0000482743,0.00071525946,0.04314549],"genre_scores_gemma":[0.5974482,0.0034794412,0.38094884,0.0017830197,0.0017084224,0.00050773233,0.00007827943,0.00042410244,0.013621979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986902,0.00484002,0.0008615556,0.00078842964,0.005287187,0.0013207963],"domain_scores_gemma":[0.98194,0.011500443,0.00074829,0.00243957,0.0020337107,0.0013379084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03241223,0.00089022965,0.0015314792,0.0012356427,0.003119458,0.014949894,0.0060981717,0.0063263164,0.004123988],"category_scores_gemma":[0.026144156,0.0016020377,0.0012320699,0.0016394594,0.008018128,0.019263957,0.0036712687,0.009344676,0.0010490363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007405467,0.00011438264,0.00029798894,0.00014663844,0.000037209902,0.00016158575,0.00069107657,0.027849842,0.0012386988,0.909619,0.0033044287,0.05646506],"study_design_scores_gemma":[0.000059138718,0.00008410663,0.0002596603,0.00022407611,0.0000712222,0.00030270606,0.00082455564,0.22855367,0.0028139153,0.7378431,0.028873151,0.000090806876],"about_ca_topic_score_codex":0.004164387,"about_ca_topic_score_gemma":0.0036461737,"teacher_disagreement_score":0.03241223,"about_ca_system_score_codex":0.0039325575,"about_ca_system_score_gemma":0.00476338,"threshold_uncertainty_score":0.17141432},"labels":[],"label_agreement":null},{"id":"W2137515077","doi":"10.1007/978-3-642-14577-3_30","title":"Using Sphinx to Improve Onion Routing Circuit Construction","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Routing (electronic design automation); Sphinx; Computer network; Geography","score_opus":0.019811094395101404,"score_gpt":0.24671091145305643,"score_spread":0.22689981705795503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137515077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061886728,0.0001835032,0.88793594,0.0003422597,0.00038627247,0.00017901165,0.00020028002,0.0055891126,0.043296956],"genre_scores_gemma":[0.48206663,0.00026595182,0.47992155,0.0003277443,0.00017241156,0.00024761196,0.00090992294,0.0017172652,0.034371037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994118,0.00012290968,0.00003600899,0.00010446052,0.00020995077,0.000114898576],"domain_scores_gemma":[0.9990702,0.00025128693,0.00004727489,0.00044544836,0.00014586694,0.000039917566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058215717,0.00078791514,0.00069206004,0.00078566704,0.0008247151,0.0010932116,0.0010171991,0.0004552517,0.015446393],"category_scores_gemma":[0.0017858504,0.00036759692,0.0006933292,0.00079772546,0.0006229737,0.002031803,0.0016856968,0.0014275713,0.002734157],"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.000658595,0.00028230582,0.0015070711,0.00025577302,0.00006884103,0.0002545677,0.00023628103,0.059583828,0.06924612,0.20970766,0.01906813,0.6391309],"study_design_scores_gemma":[0.0003297765,0.000666163,0.0014409294,0.00010610606,0.00014607543,0.0004947705,0.000169773,0.4824349,0.15250173,0.27201712,0.089604236,0.000088446846],"about_ca_topic_score_codex":0.0009348896,"about_ca_topic_score_gemma":0.0019775068,"teacher_disagreement_score":0.015446393,"about_ca_system_score_codex":0.00078534667,"about_ca_system_score_gemma":0.0008668533,"threshold_uncertainty_score":0.051673353},"labels":[],"label_agreement":null},{"id":"W2137637395","doi":"10.1007/978-3-540-28629-5_65","title":"An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Trent University","funders":"","keywords":"Argument (complex analysis); Oracle; Quantum complexity theory; Generalization; Quantum algorithm; Quantum computer; Computational complexity theory; Theoretical computer science; Computer science; Quantum; Complexity class; Mathematics; Time complexity; Computation; Discrete mathematics; Algorithm; Quantum mechanics","score_opus":0.02209990278930636,"score_gpt":0.27215878532121346,"score_spread":0.2500588825319071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137637395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036452632,0.0012873985,0.8664178,0.01434503,0.0008313688,0.000248498,0.00044494192,0.0014128389,0.07855951],"genre_scores_gemma":[0.6790826,0.0014135386,0.25463122,0.0073333667,0.0025502024,0.0014599441,0.00093668746,0.0016383753,0.05095412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896763,0.0027688115,0.00038247716,0.001767629,0.004202505,0.0012022839],"domain_scores_gemma":[0.9342098,0.048167467,0.0013083898,0.011726681,0.0029542777,0.0016332272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008927806,0.0024490254,0.0028450408,0.0027157292,0.0034155648,0.0072573964,0.0090518845,0.0058141,0.020853387],"category_scores_gemma":[0.050416287,0.0020061429,0.003691655,0.003696655,0.011145964,0.024369147,0.014168529,0.02236491,0.0036923583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013756687,0.000077654004,0.00023982617,0.000086494416,0.000019614805,0.000030003424,0.00015011689,0.0063068746,0.0012429275,0.9781065,0.004153108,0.009449334],"study_design_scores_gemma":[0.000033366483,0.000026221818,0.00015232072,0.000021309183,0.000019702471,0.000033168068,0.000025320318,0.057649437,0.00082717504,0.93912107,0.0020711378,0.000019793151],"about_ca_topic_score_codex":0.001230643,"about_ca_topic_score_gemma":0.0012114178,"teacher_disagreement_score":0.020853387,"about_ca_system_score_codex":0.0051003844,"about_ca_system_score_gemma":0.0030757205,"threshold_uncertainty_score":0.069761574},"labels":[],"label_agreement":null},{"id":"W2137679685","doi":"10.1007/3-540-47887-6_26","title":"WebFrame: In Pursuit of Computationally and Cognitively Efficient Web Mining","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Alberta","funders":"","keywords":"Computer science; Software deployment; Web mining; Data science; Data mining; Human–computer interaction; World Wide Web; Web service; Software engineering","score_opus":0.016972485408829216,"score_gpt":0.2414058275206697,"score_spread":0.22443334211184046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137679685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060805203,0.00078988855,0.972452,0.0012896347,0.00022410256,0.00011106511,0.0007454042,0.014307836,0.003999633],"genre_scores_gemma":[0.051831976,0.0009915745,0.93650985,0.00048348386,0.00028395947,0.00015182044,0.0023552922,0.001442843,0.005949231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984224,0.00031952493,0.00007589651,0.0003267805,0.0007502262,0.00010520127],"domain_scores_gemma":[0.9960771,0.0016981143,0.0001306487,0.0011003965,0.0007678958,0.00022589338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026905139,0.0009605249,0.0015679746,0.002802707,0.0012588107,0.003931775,0.0037888628,0.0014596323,0.0067346185],"category_scores_gemma":[0.008732608,0.00086349057,0.0012821602,0.0047165086,0.0013390464,0.007421362,0.0030328324,0.0020503385,0.0036870346],"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.00066118385,0.00038430924,0.0015208636,0.00050627615,0.00013347999,0.0001343725,0.00034201585,0.010575982,0.0074824165,0.0890753,0.10150522,0.78767854],"study_design_scores_gemma":[0.00017720305,0.0001543754,0.001166868,0.00011964081,0.00011905476,0.0004572527,0.0002557249,0.57093483,0.021365806,0.29194993,0.11323782,0.00006153714],"about_ca_topic_score_codex":0.010818306,"about_ca_topic_score_gemma":0.013484429,"teacher_disagreement_score":0.010818306,"about_ca_system_score_codex":0.00095124054,"about_ca_system_score_gemma":0.0025533657,"threshold_uncertainty_score":0.022529542},"labels":[],"label_agreement":null},{"id":"W2137815516","doi":"10.1007/978-3-642-03367-4_20","title":"Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba; University of Toronto; University of Waterloo","funders":"","keywords":"Hausdorff distance; Hausdorff space; Polygon covering; Polygon (computer graphics); Rectilinear polygon; Combinatorics; Mathematics; Regular polygon; Krein–Milman theorem; Monotone polygon; Core (optical fiber); Bounded function; Discrete mathematics; Simple polygon; Convex set; Computer science; Convex optimization; Geometry; Mathematical analysis","score_opus":0.01974554928092759,"score_gpt":0.25061121552652094,"score_spread":0.23086566624559335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137815516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040389437,0.0007677741,0.9514528,0.0002590844,0.000048620754,0.00007983812,0.00013045286,0.00022062163,0.0066515026],"genre_scores_gemma":[0.39776126,0.0013852154,0.5900305,0.00023088013,0.00026280453,0.00029961855,0.0010992633,0.0008005178,0.008130071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834776,0.00043861175,0.000104102604,0.00039219158,0.00058344804,0.00013393427],"domain_scores_gemma":[0.9925248,0.004964486,0.0005261191,0.0007615261,0.00074046245,0.00048265734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018616485,0.0013767168,0.002990441,0.0025209659,0.0011215551,0.0031158347,0.0029557056,0.001658523,0.0033010382],"category_scores_gemma":[0.01388493,0.0014866883,0.0015126574,0.0022688154,0.004166015,0.008272361,0.0069173304,0.0034138106,0.00067639607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033908506,0.00010774687,0.0019977023,0.0006028645,0.000069130256,0.0005850618,0.0015991398,0.110952325,0.0101498375,0.77529657,0.0061571593,0.09214342],"study_design_scores_gemma":[0.00002342434,0.00012882908,0.0007616433,0.000118470656,0.000039243463,0.0003468309,0.00033571423,0.5668543,0.0063118762,0.4178131,0.007209647,0.00005696364],"about_ca_topic_score_codex":0.0019218223,"about_ca_topic_score_gemma":0.0012484156,"teacher_disagreement_score":0.0033010382,"about_ca_system_score_codex":0.0013954233,"about_ca_system_score_gemma":0.00065889047,"threshold_uncertainty_score":0.011043012},"labels":[],"label_agreement":null},{"id":"W2138106527","doi":"10.1007/11562948_8","title":"An Approach for the Verification of SystemC Designs Using AsmL","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"SystemC; Computer science; Correctness; Programming language; Formal verification; Embedded system; Model checking; Assertion; Functional verification; Software engineering","score_opus":0.09503968511718412,"score_gpt":0.3246511646376925,"score_spread":0.22961147952050837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138106527","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.00083175575,0.00006594731,0.9943268,0.00010480829,0.00003195418,0.000095926596,0.000042797845,0.0025278574,0.0019721924],"genre_scores_gemma":[0.038671616,0.00020679196,0.95638025,0.00017802388,0.00004007744,0.00033030738,0.00017705339,0.0005694912,0.0034463666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99362,0.0021097865,0.0005179295,0.0004698927,0.0029087453,0.00037366003],"domain_scores_gemma":[0.995843,0.0017485796,0.00022270462,0.0013955431,0.0007255963,0.00006455615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004153474,0.0016424763,0.001007535,0.002150811,0.0014985437,0.0030717829,0.0030346627,0.0020976178,0.008104184],"category_scores_gemma":[0.0071431273,0.0016674314,0.0029370904,0.0013272004,0.0028996293,0.0035056218,0.0038111326,0.0042073373,0.003738406],"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.00022383485,0.00021218356,0.00072810886,0.0014767249,0.00014325192,0.0005790785,0.0009604111,0.04944478,0.04327252,0.5498527,0.009627414,0.34347898],"study_design_scores_gemma":[0.00017519474,0.00025857572,0.0002615722,0.00043092496,0.00021880097,0.0007633736,0.00017623571,0.43054652,0.08092149,0.3633827,0.1227369,0.00012773542],"about_ca_topic_score_codex":0.0027405315,"about_ca_topic_score_gemma":0.0043587717,"teacher_disagreement_score":0.008104184,"about_ca_system_score_codex":0.0015951846,"about_ca_system_score_gemma":0.0034492214,"threshold_uncertainty_score":0.027111173},"labels":[],"label_agreement":null},{"id":"W2138178581","doi":"10.1007/978-3-642-29344-3_31","title":"Decidability Classes for Mobile Agents Computing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Decidability; Computer science; Certificate; Decision problem; Focus (optics); Protocol (science); Mobile agent; Existential quantification; Theoretical computer science; Artificial intelligence; Algorithm; Distributed computing; Mathematics; Discrete mathematics","score_opus":0.03967317163642082,"score_gpt":0.3066049741150857,"score_spread":0.2669318024786649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138178581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047607318,0.006250636,0.80860484,0.010983906,0.0006625011,0.00035700592,0.0015559315,0.001912213,0.12206563],"genre_scores_gemma":[0.641069,0.0041774805,0.2925222,0.0021580714,0.0016700069,0.0013730546,0.0042555635,0.001156828,0.051617846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979506,0.0004960572,0.00016748776,0.0005277408,0.0005510817,0.00030711052],"domain_scores_gemma":[0.9932433,0.005624638,0.00015783707,0.0005660767,0.00024382996,0.0001643553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021145572,0.0011083839,0.0010012047,0.001115572,0.002225636,0.0049934704,0.0030763377,0.0021856616,0.009392852],"category_scores_gemma":[0.008638226,0.0010346663,0.00270039,0.0012864402,0.0034617174,0.010485553,0.0027617838,0.00818779,0.0011560897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004458862,0.00006783493,0.00021602289,0.00019601005,0.000023011367,0.00006323442,0.00039204644,0.005957787,0.00056019786,0.95807964,0.0071155047,0.027284054],"study_design_scores_gemma":[0.000020627545,0.000005246089,0.00007330109,0.000031376672,0.0000126775285,0.00003365898,0.00005233999,0.015353518,0.0004616625,0.97709787,0.0068499832,0.0000077023515],"about_ca_topic_score_codex":0.0036965373,"about_ca_topic_score_gemma":0.0036421176,"teacher_disagreement_score":0.009392852,"about_ca_system_score_codex":0.003912054,"about_ca_system_score_gemma":0.001913314,"threshold_uncertainty_score":0.031422257},"labels":[],"label_agreement":null},{"id":"W2138211541","doi":"10.1007/978-3-642-31178-9_10","title":"Learning Good Decompositions of Complex Questions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Training set; Classifier (UML); Set (abstract data type); Simple (philosophy); Machine learning; Transformation (genetics); Natural language processing; Data mining; Information retrieval","score_opus":0.02919150543798983,"score_gpt":0.27164587961385434,"score_spread":0.24245437417586452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138211541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022259625,0.00072486827,0.965977,0.0010273673,0.000074939555,0.00005609872,0.0003659764,0.00086382957,0.008650397],"genre_scores_gemma":[0.2624151,0.001072285,0.71769816,0.0004210461,0.00020363215,0.0002877675,0.0026279858,0.0005709243,0.014703199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985721,0.00065589166,0.00009241765,0.00035576854,0.00023828517,0.00008555717],"domain_scores_gemma":[0.9935777,0.004462581,0.00023365568,0.0009953524,0.0004368586,0.00029385183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022348661,0.0010505464,0.0008839732,0.0011251116,0.0005746114,0.0019663516,0.0011012964,0.0007748983,0.013920034],"category_scores_gemma":[0.014848213,0.0009341674,0.0016460858,0.0009750401,0.0014503662,0.00664582,0.002897511,0.0038480726,0.0030204856],"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.00026184547,0.00014775834,0.0025145295,0.00056551077,0.00015417968,0.000077276105,0.0013707278,0.02932434,0.005257464,0.47594544,0.029073218,0.45530763],"study_design_scores_gemma":[0.000037927202,0.000039863527,0.0004754128,0.000086657245,0.000037030994,0.00004853536,0.00020354213,0.12624638,0.0012277357,0.86079544,0.010786284,0.000015305908],"about_ca_topic_score_codex":0.0006144251,"about_ca_topic_score_gemma":0.0017490201,"teacher_disagreement_score":0.013920034,"about_ca_system_score_codex":0.0009561418,"about_ca_system_score_gemma":0.000764083,"threshold_uncertainty_score":0.046567142},"labels":[],"label_agreement":null},{"id":"W2138255982","doi":"10.1007/3-540-36151-0_39","title":"Camera Position Reconstruction and Tight Direction Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"McGill University; National Science Foundation","keywords":"Computer science; Implementation; Dimension (graph theory); Graph; Simple (philosophy); Position (finance); Computer vision; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.010457293919729644,"score_gpt":0.22156271338722167,"score_spread":0.21110541946749203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138255982","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.0022285858,0.00017860738,0.9962649,0.000044840035,0.000017674696,0.000008904881,0.00003244042,0.00018939529,0.0010347684],"genre_scores_gemma":[0.16142574,0.001351624,0.8250097,0.00012380513,0.0001193378,0.00007681432,0.0005800017,0.00030437278,0.011008664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.00022641996,0.000033710407,0.00022587948,0.00022414241,0.00007632589],"domain_scores_gemma":[0.99905413,0.00040841027,0.00010512317,0.0002530152,0.0001415942,0.000037721038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086175173,0.001277635,0.0011931065,0.0011379258,0.00049926585,0.0014557962,0.0014416277,0.0013731178,0.0037306657],"category_scores_gemma":[0.004336982,0.001249867,0.00072188466,0.0017072464,0.0009185685,0.0033773766,0.0021032149,0.0019219302,0.0011640599],"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.00033099364,0.00006518578,0.00075055857,0.000155264,0.00009675321,0.00012180711,0.0001280853,0.42785868,0.011214288,0.101534866,0.005098928,0.4526446],"study_design_scores_gemma":[0.000012944899,0.000026007403,0.00021514179,0.000015430582,0.000014387712,0.0001267232,0.000023129389,0.9410519,0.0036979208,0.051887285,0.0029122552,0.00001690047],"about_ca_topic_score_codex":0.005758698,"about_ca_topic_score_gemma":0.0054151993,"teacher_disagreement_score":0.005758698,"about_ca_system_score_codex":0.0007520012,"about_ca_system_score_gemma":0.0006118235,"threshold_uncertainty_score":0.012480259},"labels":[],"label_agreement":null},{"id":"W2138339216","doi":"10.1007/978-3-540-40031-8_24","title":"Using Abstraction for Planning in Sokoban","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Heuristic; Domain (mathematical analysis); Reduction (mathematics); Space (punctuation); Decomposition; Theoretical computer science; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.052063391063229755,"score_gpt":0.29534679806984443,"score_spread":0.24328340700661466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138339216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040119667,0.0016814411,0.8199612,0.0012546277,0.00040671884,0.00011954006,0.00038332338,0.0024100007,0.1336634],"genre_scores_gemma":[0.5608668,0.0014583828,0.40344295,0.0001886834,0.00005269734,0.00022792167,0.000816737,0.000723492,0.032222334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995734,0.00016874338,0.000042529366,0.00007726726,0.00008024614,0.000057826142],"domain_scores_gemma":[0.9997665,0.00009409812,0.000017405406,0.000070119575,0.000028399149,0.000023519708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048543775,0.0006625819,0.0006840605,0.0006014778,0.0014298529,0.002454466,0.0007341607,0.00055161415,0.012169401],"category_scores_gemma":[0.0010448049,0.00057757075,0.001101967,0.0011273453,0.0014259089,0.0036738878,0.00290216,0.0016415376,0.0018246477],"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.00027379225,0.00003881397,0.00064272044,0.00034961736,0.000035972138,0.0004515667,0.0023840207,0.047498845,0.00272204,0.81866723,0.0053007933,0.12163461],"study_design_scores_gemma":[0.0000479204,0.000057311165,0.0003611605,0.00014041377,0.000065042586,0.0003043574,0.0009380444,0.09100497,0.0034274645,0.77233595,0.13126363,0.0000537212],"about_ca_topic_score_codex":0.0035700866,"about_ca_topic_score_gemma":0.005887211,"teacher_disagreement_score":0.012169401,"about_ca_system_score_codex":0.0008060756,"about_ca_system_score_gemma":0.001072505,"threshold_uncertainty_score":0.040710688},"labels":[],"label_agreement":null},{"id":"W2138429996","doi":"10.1007/978-3-642-03073-4_3","title":"Structures of Some Strong Reducibilities","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computability; Computer science; Aside; Degree (music); Theoretical computer science; Philosophy; Physics; Linguistics","score_opus":0.02196815810384595,"score_gpt":0.2561865649574795,"score_spread":0.23421840685363354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138429996","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.3840631,0.0020510335,0.24718276,0.0051484015,0.0003895988,0.00020628239,0.0021840844,0.001065865,0.3577089],"genre_scores_gemma":[0.90898556,0.0008730359,0.040990144,0.00074406044,0.00044242377,0.0002677707,0.0015715673,0.00030810933,0.045817327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988433,0.00022949994,0.000090748596,0.00028870528,0.0003230239,0.0002246332],"domain_scores_gemma":[0.99726176,0.0015365458,0.00021445761,0.00040666273,0.00038130704,0.00019931626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011824617,0.0007157128,0.0010650271,0.002743679,0.0033808132,0.0039465106,0.0011270441,0.0010405445,0.01351552],"category_scores_gemma":[0.003921296,0.0009928023,0.0016449544,0.0026303364,0.0039566117,0.007029334,0.003013717,0.0048910743,0.0016642847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024529669,0.000012761932,0.000112163136,0.000026912914,0.000009629547,0.000041037798,0.0001945056,0.00024312551,0.00031305075,0.9953181,0.0008584953,0.0028456731],"study_design_scores_gemma":[0.000012060261,0.000007307457,0.00014049411,0.000008370509,0.000011677574,0.00006022711,0.0000623829,0.00061988406,0.0002827396,0.9965301,0.0022579136,0.000006873794],"about_ca_topic_score_codex":0.00079393486,"about_ca_topic_score_gemma":0.00087787554,"teacher_disagreement_score":0.01351552,"about_ca_system_score_codex":0.0012613703,"about_ca_system_score_gemma":0.00063148385,"threshold_uncertainty_score":0.045213938},"labels":[],"label_agreement":null},{"id":"W2138556501","doi":"10.1007/978-3-540-24855-2_75","title":"On Naïve Crossover Biases with Reproduction for Simple Solutions to Classification Problems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Crossover; Computer science; Simple (philosophy); Reproduction; Artificial intelligence; Algorithm; Biology; Philosophy; Epistemology; Genetics","score_opus":0.24845640802621244,"score_gpt":0.4061652919485467,"score_spread":0.1577088839223343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138556501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08032225,0.0018959467,0.8948755,0.0011667518,0.00025670795,0.00021971637,0.0001242236,0.00067639886,0.020462502],"genre_scores_gemma":[0.61422026,0.0009387035,0.36918205,0.00075206894,0.00047921514,0.00036632575,0.0002473799,0.0004212788,0.01339276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972458,0.0015880193,0.000110228066,0.00035344655,0.00054657366,0.00015589617],"domain_scores_gemma":[0.9668599,0.028513314,0.0006730212,0.0027956327,0.0008312874,0.000326887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077480576,0.0006723448,0.0012994187,0.0011816516,0.00064604566,0.0018286261,0.0024275803,0.002082488,0.008619223],"category_scores_gemma":[0.053903922,0.00048439592,0.0010833188,0.001355232,0.0025394885,0.0036508802,0.0024370318,0.0028313394,0.00058644137],"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.00044210977,0.00019050708,0.0025172345,0.00044323888,0.00012646616,0.00025108116,0.00053183996,0.13991107,0.004175788,0.44844896,0.0074637984,0.39549783],"study_design_scores_gemma":[0.00019503519,0.00014154702,0.00087570824,0.000090993235,0.000058526013,0.00021608964,0.000047438953,0.4028963,0.0013227756,0.5913431,0.0027779173,0.000034450586],"about_ca_topic_score_codex":0.00092427415,"about_ca_topic_score_gemma":0.0009406467,"teacher_disagreement_score":0.008619223,"about_ca_system_score_codex":0.0010010784,"about_ca_system_score_gemma":0.0005868854,"threshold_uncertainty_score":0.040976107},"labels":[],"label_agreement":null},{"id":"W2138801591","doi":"10.1007/978-3-642-22300-6_26","title":"On Rectilinear Partitions with Minimum Stabbing Number","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Partition (number theory); Hyperplane; Combinatorics; Bounding overwatch; Partition problem; Mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.024096210405924745,"score_gpt":0.24811051834533537,"score_spread":0.22401430793941063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138801591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121688485,0.0015976947,0.79837304,0.00066796056,0.00037564652,0.00016982987,0.0006842199,0.0010236105,0.075419545],"genre_scores_gemma":[0.36916202,0.0017331972,0.57135904,0.00039226422,0.00018542154,0.00026538383,0.001576468,0.0014598804,0.05386636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950695,0.00012828498,0.000027167893,0.00009582562,0.00014928129,0.00009247461],"domain_scores_gemma":[0.99879694,0.0006005542,0.00010288169,0.00028974438,0.00012571833,0.000084115294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004603779,0.0011169481,0.0012573609,0.0012046496,0.0009783733,0.0017031003,0.0014975714,0.0010811744,0.017874377],"category_scores_gemma":[0.003130934,0.00083870953,0.00073852565,0.0020937717,0.0011806249,0.0027551346,0.00229488,0.0017312166,0.0027129916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084893516,0.00014310222,0.0007781071,0.00048886146,0.000039707254,0.00020000181,0.00048749847,0.15613547,0.020261526,0.5203239,0.021606253,0.27868667],"study_design_scores_gemma":[0.00010094939,0.0001823594,0.0007585657,0.00013738785,0.000032479285,0.000288908,0.00022154406,0.30114773,0.005687114,0.66712105,0.024276067,0.000045875],"about_ca_topic_score_codex":0.002160292,"about_ca_topic_score_gemma":0.0032643387,"teacher_disagreement_score":0.017874377,"about_ca_system_score_codex":0.00082874775,"about_ca_system_score_gemma":0.0005690492,"threshold_uncertainty_score":0.059795797},"labels":[],"label_agreement":null},{"id":"W2138942340","doi":"10.1007/978-3-540-75757-3_49","title":"Real-Time Synthesis of Image Slices in Deformed Tissue from Nominal Volume Images","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Pixel; Interpolation (computer graphics); Voxel; Intersection (aeronautics); Computer vision; Volume (thermodynamics); Artificial intelligence; Deformation (meteorology); Computer science; Imaging phantom; Image (mathematics); Algorithm; Geometry; Mathematics; Materials science; Optics; Physics; Engineering","score_opus":0.007265543374456992,"score_gpt":0.2771822098489601,"score_spread":0.2699166664745031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138942340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04197536,0.00026573075,0.9518922,0.00016241595,0.00012997576,0.00010489383,0.00027536132,0.003150842,0.0020431906],"genre_scores_gemma":[0.31958854,0.00043575335,0.6748724,0.000086081374,0.000058431175,0.00009617342,0.00056071626,0.0012874121,0.0030144732],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983597,0.00002489505,0.000008600578,0.000027948645,0.000085320484,0.000017252538],"domain_scores_gemma":[0.9995646,0.00019233474,0.000048583206,0.000071940536,0.00008341643,0.000039089115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044843482,0.00070701516,0.00039046665,0.00051669223,0.00021166082,0.0010464041,0.0005238214,0.0006627262,0.0055364068],"category_scores_gemma":[0.0017254369,0.0005234328,0.00041825545,0.00046023988,0.00033878302,0.00042061153,0.000597476,0.00066407066,0.0011316965],"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.0018928928,0.00006545971,0.0011600943,0.00056253263,0.00010560567,0.00061834883,0.0005434541,0.11596344,0.5496524,0.006654489,0.0037962177,0.31898504],"study_design_scores_gemma":[0.00011216475,0.00040330456,0.0034101936,0.000067404864,0.000086275715,0.0014765123,0.00025234447,0.5903998,0.38527694,0.0056648054,0.012758734,0.00009159511],"about_ca_topic_score_codex":0.0010200304,"about_ca_topic_score_gemma":0.0013621685,"teacher_disagreement_score":0.0055364068,"about_ca_system_score_codex":0.0003248317,"about_ca_system_score_gemma":0.00054411497,"threshold_uncertainty_score":0.01852113},"labels":[],"label_agreement":null},{"id":"W2138972108","doi":"10.1007/11790273_19","title":"An Integrated Dynamic Jaw and Laryngeal Model Constructed from CT Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Voice and Speech Disorders","field":"Medicine","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 British Columbia","funders":"","keywords":"Computer science; Context (archaeology); Larynx; Flexibility (engineering); Vocal tract; Set (abstract data type); Computational model; Displacement (psychology); Artificial intelligence; Anatomy; Speech recognition; Medicine; Geology","score_opus":0.01914831661675646,"score_gpt":0.2730651312693923,"score_spread":0.2539168146526358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138972108","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.009929787,0.000107509324,0.9843508,0.00008528533,0.00007081983,0.000084442836,0.0007940076,0.003062853,0.0015144793],"genre_scores_gemma":[0.30022505,0.00072557316,0.68248427,0.00016119704,0.00005885906,0.00033512732,0.0029493468,0.0012852697,0.011775355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983,0.000011991282,0.000013433737,0.000040342184,0.00009251969,0.000011655282],"domain_scores_gemma":[0.9998789,0.00004263753,0.00001104513,0.000018684068,0.00003874912,0.000009973678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033484216,0.0005708168,0.00053270534,0.00077189057,0.00026529553,0.001010762,0.0010256725,0.001133907,0.005216873],"category_scores_gemma":[0.0008936899,0.0005655923,0.0010989881,0.00058653165,0.00024341125,0.00053512957,0.0006704106,0.0005072146,0.002271345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039291743,0.00008791529,0.0026425724,0.00033353167,0.00014734769,0.0010559064,0.0002060892,0.506347,0.13466156,0.0064453054,0.006913992,0.34076583],"study_design_scores_gemma":[0.000021448857,0.00008821742,0.0016965162,0.000030318984,0.000094870935,0.0008382801,0.000034528224,0.96950847,0.01697166,0.0020330944,0.008627736,0.00005483471],"about_ca_topic_score_codex":0.0061146123,"about_ca_topic_score_gemma":0.0077759763,"teacher_disagreement_score":0.0061146123,"about_ca_system_score_codex":0.00036914772,"about_ca_system_score_gemma":0.0012425765,"threshold_uncertainty_score":0.01745218},"labels":[],"label_agreement":null},{"id":"W2139006047","doi":"10.1007/978-3-642-33418-4_65","title":"Regional Heart Motion Abnormality Detection via Multiview Fusion","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","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":"London Health Sciences Centre; St Joseph's Health Care; CARE Canada","funders":"","keywords":"Computer science; Abnormality; Computer vision; Artificial intelligence; Fusion; Motion (physics); Sensor fusion; Medicine","score_opus":0.01972272470476733,"score_gpt":0.2887052493985719,"score_spread":0.26898252469380457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139006047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060035843,0.001295243,0.9354049,0.00017489398,0.00011003633,0.00005195999,0.00049572176,0.001194967,0.0012365083],"genre_scores_gemma":[0.5899974,0.0012812378,0.40441763,0.00018576662,0.00036086162,0.000070499715,0.0012918885,0.00024284772,0.0021518143],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994123,0.00011049261,0.00004892155,0.00015645509,0.00018047862,0.000091343296],"domain_scores_gemma":[0.9993399,0.00021412547,0.00010107898,0.00011411174,0.0001776043,0.000053223448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010479869,0.00104717,0.0014031036,0.0022755892,0.00025232453,0.0010896666,0.0005833535,0.00089272443,0.0014972935],"category_scores_gemma":[0.001999532,0.00055980537,0.0010157045,0.0010789371,0.00024933496,0.00086379424,0.0012410153,0.0007494307,0.00094575103],"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.0014183001,0.0002189933,0.008239849,0.00025413072,0.00044648655,0.00039985898,0.00010319602,0.025157925,0.223692,0.0011778844,0.004159718,0.7347317],"study_design_scores_gemma":[0.00007883035,0.00037628377,0.021721011,0.00004624727,0.0004516861,0.0018414368,0.00009467657,0.8833678,0.084953204,0.0036735951,0.003307529,0.00008775404],"about_ca_topic_score_codex":0.0009106415,"about_ca_topic_score_gemma":0.0012402779,"teacher_disagreement_score":0.0022755892,"about_ca_system_score_codex":0.00016229924,"about_ca_system_score_gemma":0.00035422656,"threshold_uncertainty_score":0.005542338},"labels":[],"label_agreement":null},{"id":"W2139056146","doi":"10.1007/978-3-642-13338-1_8","title":"Verifiable Semantic Model for Agent Interactions Using Social Commitments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Axiom; Semantics (computer science); Model checking; Delegation; Theoretical computer science; Protocol (science); Verifiable secret sharing; Programming language; Artificial intelligence; Software engineering","score_opus":0.06729214240359305,"score_gpt":0.31118991980869787,"score_spread":0.24389777740510482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139056146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004383823,0.00009828737,0.98634154,0.0008891933,0.00011378907,0.00014277342,0.00040308925,0.0008477827,0.0067796907],"genre_scores_gemma":[0.45275298,0.00037614937,0.5204337,0.0005714605,0.00029008914,0.001226153,0.0018589286,0.0006534233,0.021837134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939739,0.0022858563,0.00060197787,0.0008518021,0.0018019673,0.00048448116],"domain_scores_gemma":[0.9906046,0.004950243,0.0004833171,0.002580896,0.0011165645,0.00026442154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005159278,0.0013251347,0.0015167949,0.0016394727,0.00183038,0.00589351,0.0056860233,0.0044886936,0.009656016],"category_scores_gemma":[0.014224451,0.0014912935,0.0028159758,0.0015888679,0.0045548705,0.0153312115,0.004917382,0.006958947,0.0025178732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005223815,0.000042684314,0.00007016739,0.00006615699,0.000022060794,0.000102392296,0.00024731943,0.0272831,0.0005031271,0.9620951,0.0012508285,0.00826483],"study_design_scores_gemma":[0.00004425185,0.000018588547,0.000030601597,0.000023973242,0.00002873707,0.000045434383,0.00005213625,0.26007566,0.00089294795,0.7342722,0.0044923564,0.00002322906],"about_ca_topic_score_codex":0.0046870294,"about_ca_topic_score_gemma":0.0045941537,"teacher_disagreement_score":0.009656016,"about_ca_system_score_codex":0.0031948555,"about_ca_system_score_gemma":0.0031965189,"threshold_uncertainty_score":0.03230256},"labels":[],"label_agreement":null},{"id":"W2139061136","doi":"10.1007/11863878_56","title":"MedSearch: A Retrieval System for Medical Information Based on Semantic Similarity","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Dalhousie University","funders":"","keywords":"Information retrieval; Similarity (geometry); National library; Computer science; Semantic similarity; Medical information; World Wide Web; Artificial intelligence; Library science","score_opus":0.025050280224039736,"score_gpt":0.2595427266373837,"score_spread":0.23449244641334396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139061136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06086662,0.021317754,0.7322534,0.0024179735,0.001095746,0.0015073471,0.03226345,0.12364104,0.024636727],"genre_scores_gemma":[0.16464898,0.008270001,0.7338249,0.002231741,0.0014649479,0.0012980748,0.057955008,0.004479198,0.02582712],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994455,0.000121223864,0.00008541521,0.000084233834,0.00022499898,0.000038670358],"domain_scores_gemma":[0.9990239,0.00047386557,0.000113390495,0.00009915461,0.0001822357,0.000107451626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012626118,0.0011299353,0.001677419,0.007118975,0.00046946,0.0014715932,0.0010226171,0.0013865299,0.020123437],"category_scores_gemma":[0.0038967985,0.00047337465,0.00088871346,0.0037904398,0.00034004287,0.0030179652,0.0020420484,0.00058817305,0.009971352],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018511151,0.00030904645,0.0031812708,0.0024296115,0.0004916561,0.0005908355,0.00040514767,0.0023504447,0.04638469,0.007212909,0.21924749,0.71554583],"study_design_scores_gemma":[0.0025127276,0.0021155376,0.01952568,0.0008427693,0.002520529,0.011907998,0.00097588566,0.1794783,0.12598279,0.056297354,0.5972515,0.0005889726],"about_ca_topic_score_codex":0.0009985123,"about_ca_topic_score_gemma":0.0014969099,"teacher_disagreement_score":0.020123437,"about_ca_system_score_codex":0.00050334877,"about_ca_system_score_gemma":0.00070428016,"threshold_uncertainty_score":0.06731963},"labels":[],"label_agreement":null},{"id":"W2139099332","doi":"10.1007/11839569_37","title":"Ubisafe Computing: Vision and Challenges (I)","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Ubiquitous computing; Computer science; End-user computing; Variety (cybernetics); Human–computer interaction; Construct (python library); Data science; Internet privacy; Artificial intelligence; Utility computing; Cloud computing; Cloud computing security","score_opus":0.0349413565202185,"score_gpt":0.2588513379474491,"score_spread":0.22390998142723056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139099332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021046354,0.2502123,0.4046298,0.03678298,0.008084997,0.00018130285,0.00048979017,0.0042991685,0.2742733],"genre_scores_gemma":[0.30683935,0.14850771,0.32529113,0.0067972546,0.003596157,0.0003496368,0.001391528,0.001183487,0.20604374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956137,0.000083657236,0.00002085221,0.000081217106,0.00017640652,0.000076524055],"domain_scores_gemma":[0.99956197,0.000096367214,0.000015081155,0.00008769943,0.00015556047,0.00008319218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008130795,0.00059402594,0.0006066351,0.0010021362,0.0015565576,0.0058042407,0.0014978709,0.0015293668,0.010059233],"category_scores_gemma":[0.0016045459,0.000440044,0.00031997904,0.0021029697,0.0021511375,0.0082103,0.0025258004,0.0026165158,0.004011739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099186786,0.000046302965,0.0005287962,0.000393544,0.000009900284,0.0000740657,0.0005544044,0.001667077,0.002313064,0.20627433,0.117397934,0.6706414],"study_design_scores_gemma":[0.000008026974,0.00004221489,0.0008223451,0.0004520716,0.000009058754,0.0006023145,0.0005422263,0.016084606,0.003057248,0.17350964,0.804835,0.000035297875],"about_ca_topic_score_codex":0.004492002,"about_ca_topic_score_gemma":0.0050754794,"teacher_disagreement_score":0.010059233,"about_ca_system_score_codex":0.0013273743,"about_ca_system_score_gemma":0.0012290657,"threshold_uncertainty_score":0.03365153},"labels":[],"label_agreement":null},{"id":"W2139128755","doi":"10.1007/978-3-642-14052-5_17","title":"Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McGill University; University of Ottawa","funders":"","keywords":"Variety (cybernetics); Computer science; Axiom; Syntax; Set (abstract data type); Inference; Context (archaeology); Formal system; Artificial intelligence; Abstract syntax; Theoretical computer science; Programming language; Mathematics","score_opus":0.016521363022694708,"score_gpt":0.24980441810161602,"score_spread":0.2332830550789213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139128755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045574382,0.05496172,0.77729154,0.0072737974,0.0005922806,0.00013371371,0.00063040364,0.001689018,0.1118532],"genre_scores_gemma":[0.6926514,0.023725547,0.26721385,0.0017750761,0.0011537244,0.00020676656,0.0010755006,0.0009312814,0.011266926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98402417,0.0077631497,0.0012994648,0.0015832013,0.004301407,0.0010286041],"domain_scores_gemma":[0.9668783,0.022152323,0.0012282586,0.006725666,0.00208995,0.0009256134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014357543,0.0013843892,0.002473884,0.004102397,0.001517846,0.018615967,0.006354589,0.0046933424,0.011768872],"category_scores_gemma":[0.029753197,0.0016115308,0.0029039544,0.0055799675,0.009041774,0.052521296,0.007830464,0.0046527972,0.0017381492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017468704,0.000041471954,0.0007851975,0.0005432761,0.000063844476,0.0000614319,0.0016728881,0.0019705321,0.00026784747,0.9374648,0.0017664392,0.055187598],"study_design_scores_gemma":[0.000032470074,0.0000405462,0.00047501855,0.00019132378,0.000048178008,0.00018523677,0.00061074726,0.0062225414,0.0005884777,0.97893447,0.01263878,0.000032303935],"about_ca_topic_score_codex":0.0021557882,"about_ca_topic_score_gemma":0.0020563595,"teacher_disagreement_score":0.018615967,"about_ca_system_score_codex":0.0029595133,"about_ca_system_score_gemma":0.0023483268,"threshold_uncertainty_score":0.075930834},"labels":[],"label_agreement":null},{"id":"W2139478688","doi":"10.1007/978-3-540-39715-1_5","title":"Value-Added Metatagging: Ontology and Rule Based Methods for Smarter Metadata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Simon Fraser University","funders":"","keywords":"Computer science; Metadata; Ontology; Information retrieval; World Wide Web","score_opus":0.04224071274964007,"score_gpt":0.3220160147674683,"score_spread":0.2797753020178282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139478688","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.0031802382,0.0002651336,0.99041754,0.00020279858,0.000091633665,0.000088563276,0.00030296855,0.0034625696,0.0019884692],"genre_scores_gemma":[0.047665298,0.00039327508,0.9460998,0.00020624137,0.00005204836,0.00012301198,0.0012819438,0.0006639287,0.0035145548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950714,0.001395479,0.0005828283,0.00073680835,0.002069005,0.00014449826],"domain_scores_gemma":[0.9907414,0.004769285,0.00047258678,0.0026509801,0.0011957682,0.00017008273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072274213,0.0007555867,0.001300965,0.00349834,0.000772966,0.0046564047,0.0042174337,0.0015650623,0.0048326515],"category_scores_gemma":[0.015088323,0.000824677,0.0015899538,0.0048270435,0.0016486723,0.009439446,0.002926796,0.0026506456,0.0027044679],"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.00024038064,0.0002991326,0.0014364816,0.00041297977,0.00015908552,0.00028558652,0.0012049332,0.00967222,0.010487073,0.11581634,0.010776649,0.8492092],"study_design_scores_gemma":[0.000091135946,0.00008291449,0.00096338737,0.00034759345,0.00031364098,0.0005423648,0.0005527356,0.45776552,0.05173206,0.40123415,0.086185634,0.00018884671],"about_ca_topic_score_codex":0.002834269,"about_ca_topic_score_gemma":0.0055519966,"teacher_disagreement_score":0.0072274213,"about_ca_system_score_codex":0.00089988316,"about_ca_system_score_gemma":0.0013368102,"threshold_uncertainty_score":0.03822273},"labels":[],"label_agreement":null},{"id":"W2139495959","doi":"10.1007/978-3-540-87877-3_51","title":"Role and Request Based Conceptual Modeling – A Methodology and a CASE Tool","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visual modeling; Software engineering; Abstraction; Consistency (knowledge bases); Completeness (order theory); Semantics (computer science); Unified Modeling Language; Modeling language; Domain (mathematical analysis); Domain model; Process (computing); Programming language; Software; Artificial intelligence; Domain knowledge","score_opus":0.05902076066564571,"score_gpt":0.25999140832919426,"score_spread":0.20097064766354855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139495959","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.011525289,0.0001086231,0.96466774,0.0011935303,0.000040751576,0.000549302,0.0001615941,0.00084548624,0.020907732],"genre_scores_gemma":[0.22330657,0.00026056115,0.7618277,0.00027290627,0.000024585444,0.0007547224,0.00037579588,0.00042480102,0.012752378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991524,0.0054722745,0.0003872398,0.00062060344,0.0015866876,0.00040920547],"domain_scores_gemma":[0.98940873,0.007621417,0.00037315555,0.0014121174,0.0008218447,0.00036264997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0087312795,0.0012837363,0.00069729245,0.0026493564,0.0023751615,0.0076346914,0.0053605926,0.0043782294,0.009736638],"category_scores_gemma":[0.011697844,0.0014130964,0.0015874299,0.0028321042,0.0046067904,0.0133468695,0.005151467,0.0034744283,0.0025882057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010905165,0.00032571497,0.0007164684,0.00021728169,0.000022367018,0.0010057492,0.006623581,0.016640354,0.0029099237,0.91358495,0.0034426646,0.054401822],"study_design_scores_gemma":[0.00009701652,0.00017999,0.00035607177,0.00029038405,0.00009656256,0.0018487617,0.005026155,0.5277153,0.01415635,0.3485619,0.10152322,0.00014825526],"about_ca_topic_score_codex":0.006158254,"about_ca_topic_score_gemma":0.005270538,"teacher_disagreement_score":0.009736638,"about_ca_system_score_codex":0.0030450139,"about_ca_system_score_gemma":0.0047245068,"threshold_uncertainty_score":0.046175957},"labels":[],"label_agreement":null},{"id":"W2139531029","doi":"10.1007/b136502","title":"Transactions on Rough Sets III","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":161,"is_retracted":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":"Computer science","score_opus":0.016176073423895737,"score_gpt":0.24724132721702324,"score_spread":0.2310652537931275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139531029","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006129319,0.08722565,0.67039365,0.008712893,0.021179019,0.00019486794,0.0013958409,0.0008177032,0.20395106],"genre_scores_gemma":[0.25386405,0.0956533,0.38886142,0.0019709363,0.011438218,0.0007061116,0.0026543469,0.0006441727,0.24420738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977483,0.0005379392,0.0002870024,0.00022235388,0.0011291426,0.00007522066],"domain_scores_gemma":[0.99808806,0.0006510439,0.000103057326,0.0006553837,0.00045127491,0.00005114085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002238068,0.0010295586,0.0030903353,0.0017031343,0.0007453425,0.0045991717,0.0008382366,0.00087780284,0.017286636],"category_scores_gemma":[0.006320851,0.00059945724,0.0017221852,0.0028862844,0.001479039,0.0022715945,0.0014008217,0.0023547804,0.0072938474],"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.00006656903,0.00002944212,0.00025884854,0.00051416946,0.00018376898,0.00011255287,0.00022308383,0.007114002,0.0008015041,0.6270902,0.06930229,0.29430357],"study_design_scores_gemma":[0.000026332718,0.000052918396,0.0005818246,0.0002596402,0.00012594955,0.00021924342,0.0001257575,0.014592871,0.00078528316,0.65681523,0.32638592,0.000029008701],"about_ca_topic_score_codex":0.0011519421,"about_ca_topic_score_gemma":0.000673264,"teacher_disagreement_score":0.017286636,"about_ca_system_score_codex":0.0011594832,"about_ca_system_score_gemma":0.0011086896,"threshold_uncertainty_score":0.05782956},"labels":[],"label_agreement":null},{"id":"W2139555094","doi":"10.1007/11804192_16","title":"Beyond Assertions: Advanced Specification and Verification with JML and ESC/Java2","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":194,"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; Programming language; Software engineering","score_opus":0.013484859210941494,"score_gpt":0.22725399037166216,"score_spread":0.21376913116072066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139555094","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.0055343937,0.00012925269,0.9820864,0.00037845556,0.00007860332,0.000102328464,0.00023501577,0.006621513,0.0048341313],"genre_scores_gemma":[0.13881014,0.00038873844,0.84793514,0.0004165332,0.000099522586,0.00018522103,0.0011622439,0.003463526,0.007538922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426585,0.0016755065,0.00051666825,0.0006300884,0.0023868247,0.0005250889],"domain_scores_gemma":[0.9878033,0.0063210507,0.0007237098,0.0030063854,0.0019324399,0.00021315212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008870688,0.0009466995,0.00083271955,0.0009748914,0.0011923698,0.005162142,0.0039535365,0.0016777224,0.008200912],"category_scores_gemma":[0.018005941,0.0014253088,0.0020135744,0.000843955,0.0028005182,0.008504779,0.003525351,0.0033802055,0.0031576212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004594673,0.00035669276,0.0026208323,0.0009191551,0.0001152966,0.0007770974,0.0015977364,0.03327372,0.023204688,0.6215381,0.020276796,0.29486045],"study_design_scores_gemma":[0.00015457348,0.00010877211,0.0006626459,0.00039196125,0.0001339388,0.00043804027,0.00023798991,0.37734264,0.07345865,0.47477984,0.07218695,0.00010392478],"about_ca_topic_score_codex":0.0032232378,"about_ca_topic_score_gemma":0.0036866334,"teacher_disagreement_score":0.008870688,"about_ca_system_score_codex":0.0008343363,"about_ca_system_score_gemma":0.0024950171,"threshold_uncertainty_score":0.046913266},"labels":[],"label_agreement":null},{"id":"W2139660932","doi":"10.1007/11507840_3","title":"Countering Identity Theft Through Digital Uniqueness, Location Cross-Checking, and Funneling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Identity theft; Identity (music); Computer security; Internet privacy; Authentication (law); Uniqueness; Computer science; Digital identity; Process (computing); The Internet; Personally identifiable information; Business; World Wide Web; Political science; Access control; Law","score_opus":0.016394359227420698,"score_gpt":0.26952553322610684,"score_spread":0.2531311739986861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139660932","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07779305,0.0014202457,0.8936964,0.0012247826,0.0003135663,0.00013933102,0.000111354435,0.0013302759,0.023970956],"genre_scores_gemma":[0.9234204,0.0005284101,0.069758855,0.00017911811,0.00010881172,0.00005006463,0.00005396556,0.00008088036,0.0058195083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932126,0.0021606241,0.00037815765,0.0012023706,0.0020936036,0.0009527181],"domain_scores_gemma":[0.97616404,0.010054079,0.0022653877,0.009433866,0.001622609,0.00046010804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050654146,0.0009656896,0.002138369,0.0023670471,0.0023827031,0.004702296,0.0027972015,0.0031111815,0.0031581782],"category_scores_gemma":[0.03068335,0.00075627817,0.0010831362,0.0025613033,0.006714038,0.0133413635,0.010361646,0.0036667557,0.0008899778],"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.0009622357,0.000182188,0.003071016,0.00022530173,0.00012879685,0.00038161976,0.00084986235,0.048546564,0.008027763,0.64401174,0.00456084,0.28905207],"study_design_scores_gemma":[0.00012673155,0.0002675339,0.0006154239,0.00012709224,0.00016714101,0.0013777948,0.00041764838,0.3266724,0.022828221,0.63830715,0.008955642,0.00013725601],"about_ca_topic_score_codex":0.00079828897,"about_ca_topic_score_gemma":0.00066768413,"teacher_disagreement_score":0.0050654146,"about_ca_system_score_codex":0.00095061125,"about_ca_system_score_gemma":0.0018433934,"threshold_uncertainty_score":0.026788771},"labels":[],"label_agreement":null},{"id":"W2139824189","doi":"10.1007/978-3-642-41071-0_10","title":"Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Concordia University","funders":"","keywords":"Computer science; Mathematical proof; HOL; Entropy (arrow of time); Information leakage; Information flow; Theoretical computer science; Min entropy; Mutual information; Information theory; Algorithm; Data mining; Artificial intelligence; Entropy rate; Mathematics; Principle of maximum entropy; Programming language; Joint quantum entropy; Computer security; Statistics","score_opus":0.015551351272618717,"score_gpt":0.2389230685451928,"score_spread":0.22337171727257407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139824189","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.0111428285,0.00072448084,0.9798418,0.0007605741,0.00006441961,0.000038985894,0.00017251572,0.000098828605,0.0071554887],"genre_scores_gemma":[0.6892053,0.0020176324,0.29992086,0.00032032438,0.0006483866,0.00032900792,0.0004589006,0.00022987246,0.0068696258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604285,0.0017059598,0.00029061295,0.00052536663,0.0011299506,0.0003053217],"domain_scores_gemma":[0.9828205,0.013708447,0.0007598019,0.0011861771,0.0012266891,0.00029835393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006348113,0.000897802,0.0010803482,0.0023809082,0.0010418053,0.004268911,0.0020036595,0.0012184364,0.0063712485],"category_scores_gemma":[0.017426973,0.0007793174,0.0021319846,0.0021459411,0.00377357,0.010672425,0.0022887483,0.003224948,0.00045150903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018045877,0.000011393556,0.0001345811,0.000044872195,0.000016438797,0.000028529876,0.00007268107,0.019908067,0.00024928464,0.97386307,0.00029853793,0.0053545046],"study_design_scores_gemma":[0.0000044515914,0.000009858465,0.000069946494,0.000019523353,0.000010283739,0.000024451252,0.000013197192,0.092058234,0.00026675832,0.9068652,0.00064917543,0.000009014847],"about_ca_topic_score_codex":0.0012530646,"about_ca_topic_score_gemma":0.0008844071,"teacher_disagreement_score":0.0063712485,"about_ca_system_score_codex":0.0026939143,"about_ca_system_score_gemma":0.001693775,"threshold_uncertainty_score":0.033572435},"labels":[],"label_agreement":null},{"id":"W2139836297","doi":"10.1007/978-3-642-00528-2_4","title":"Mining Research Communities in Bibliographical Data","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Alberta","funders":"","keywords":"Computer science; Exploit; Data science; Social network (sociolinguistics); Social network analysis; Information retrieval; Knowledge extraction; World Wide Web; Data mining; Social media","score_opus":0.10668408608785356,"score_gpt":0.3666192580311923,"score_spread":0.2599351719433387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139836297","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.5282884,0.030551346,0.3214353,0.0030532267,0.0010027675,0.0015084083,0.077014476,0.0048478604,0.032298196],"genre_scores_gemma":[0.54999,0.0078087146,0.35471666,0.00031191157,0.0010006527,0.00091810216,0.075032204,0.0005827059,0.009639091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693906,0.00052926294,0.00044444264,0.00079206435,0.0010719075,0.0002233379],"domain_scores_gemma":[0.98880225,0.005722617,0.0017107883,0.0009800518,0.001983151,0.0008011134],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0021114412,0.00091816427,0.0012103366,0.04587173,0.0024910576,0.00375434,0.0017369798,0.0011737702,0.0029747696],"category_scores_gemma":[0.016317649,0.0006158063,0.0018940839,0.037787013,0.00078676647,0.005805058,0.0031227146,0.0010330791,0.0022167028],"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.0004969101,0.00052494684,0.14847852,0.004101447,0.0011239116,0.0011274264,0.0035871796,0.006246094,0.013564502,0.01692574,0.043487605,0.76033574],"study_design_scores_gemma":[0.00023553,0.0005047679,0.20992811,0.0037086366,0.0032765374,0.007268791,0.014599648,0.23455824,0.025785036,0.17312877,0.32665431,0.00035163248],"about_ca_topic_score_codex":0.0049081924,"about_ca_topic_score_gemma":0.015372535,"teacher_disagreement_score":0.95412827,"about_ca_system_score_codex":0.00096827204,"about_ca_system_score_gemma":0.0018817979,"threshold_uncertainty_score":0.011166453},"labels":[],"label_agreement":null},{"id":"W2140148213","doi":"10.1007/978-3-642-04744-2_2","title":"Natural Parameter Values for Generalized Gene Adjacency","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Adjacency list; Probabilistic logic; Computer science; Class (philosophy); Value (mathematics); Gene; Computational biology; Theoretical computer science; Biology; Algorithm; Genetics; Artificial intelligence; Machine learning","score_opus":0.01418708943590188,"score_gpt":0.25423753411011996,"score_spread":0.24005044467421807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140148213","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.21862136,0.00084437296,0.7161548,0.0018592962,0.00020449092,0.00015012096,0.00083253207,0.0016719693,0.059661012],"genre_scores_gemma":[0.84277624,0.00039955846,0.14833456,0.00043280053,0.00015304894,0.00052181893,0.00062731514,0.00066126446,0.006093437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989242,0.0004419674,0.000052722895,0.00026900205,0.00019831353,0.00011373394],"domain_scores_gemma":[0.9891649,0.00785762,0.00054660166,0.0013427703,0.0005452636,0.0005428739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021215442,0.000615383,0.0007935756,0.0021942984,0.0011694445,0.0017929452,0.0021426415,0.0019546293,0.011397435],"category_scores_gemma":[0.02283746,0.00040377997,0.0005659782,0.0016763964,0.002576478,0.0051952945,0.001965577,0.0026079759,0.0010257136],"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.0000731065,0.00003779702,0.0004705571,0.00009264931,0.000012777918,0.00007609649,0.00020912201,0.01360469,0.002053004,0.9638692,0.002843384,0.01665762],"study_design_scores_gemma":[0.000013508722,0.000009096769,0.00014171508,0.000017043729,0.0000052591004,0.000092481554,0.000055333436,0.026825225,0.0003592329,0.9712545,0.0012108946,0.000015600786],"about_ca_topic_score_codex":0.00032118167,"about_ca_topic_score_gemma":0.0006407315,"teacher_disagreement_score":0.011397435,"about_ca_system_score_codex":0.00095310487,"about_ca_system_score_gemma":0.0005497741,"threshold_uncertainty_score":0.038128197},"labels":[],"label_agreement":null},{"id":"W2140172400","doi":"10.1007/978-3-642-11355-0_9","title":"Declarative and Numerical Analysis of Edge Creation Process in Trust-Based Social Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Computer science; Homophily; Enhanced Data Rates for GSM Evolution; Process (computing); Population; Social network (sociolinguistics); Architecture; Quality (philosophy); Data science; Social network analysis; Theoretical computer science; Distributed computing; Artificial intelligence; World Wide Web; Social media; Programming language; Epistemology","score_opus":0.014644818095800491,"score_gpt":0.3016751949283282,"score_spread":0.28703037683252774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140172400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019721007,0.000121499506,0.9766095,0.00030081224,0.000024627243,0.000037855283,0.00014256981,0.00014302468,0.0028990572],"genre_scores_gemma":[0.6579,0.00034213028,0.33449483,0.0001341518,0.00014299927,0.00019557972,0.0005449,0.000194999,0.006050483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851674,0.00056354154,0.000102635895,0.00021945137,0.00046175384,0.00013591732],"domain_scores_gemma":[0.9861942,0.010531212,0.0007415086,0.0010465906,0.0011608314,0.000325691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037765596,0.000499867,0.00075200974,0.00087389426,0.00091680663,0.0028717334,0.0028885454,0.0012743536,0.00414422],"category_scores_gemma":[0.017873172,0.000570615,0.0013129371,0.00095369393,0.0022835298,0.0046661636,0.0019752288,0.0023949735,0.00044725917],"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.00003618365,0.000055627115,0.0011123274,0.00008612064,0.00002317309,0.00009919707,0.00046422624,0.25603333,0.0010897842,0.72998124,0.0010716758,0.009947071],"study_design_scores_gemma":[0.0000039369484,0.000005279958,0.00013159135,0.000008443902,0.0000057863926,0.000018140972,0.000037853406,0.82118547,0.0002827103,0.17773874,0.0005767653,0.0000053475283],"about_ca_topic_score_codex":0.0058315755,"about_ca_topic_score_gemma":0.005476817,"teacher_disagreement_score":0.0058315755,"about_ca_system_score_codex":0.0020317526,"about_ca_system_score_gemma":0.0014417542,"threshold_uncertainty_score":0.019972622},"labels":[],"label_agreement":null},{"id":"W2140274514","doi":"10.1007/11559573_10","title":"Image Denoising Using Complex Wavelets and Markov Prior Models","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Wavelet transform; Pattern recognition (psychology); Artificial intelligence; Computer science; Second-generation wavelet transform; Stationary wavelet transform; Discrete wavelet transform; Lifting scheme; Wavelet packet decomposition; Harmonic wavelet transform; Markov chain; Noise reduction; Computer vision; Machine learning","score_opus":0.04359024041683383,"score_gpt":0.2908381490699,"score_spread":0.2472479086530662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140274514","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.0029537505,0.00038831113,0.9954081,0.000090313166,0.0000334698,0.0000047317235,0.000019856241,0.0000646902,0.0010367518],"genre_scores_gemma":[0.22671206,0.0050517446,0.7488607,0.00020651634,0.0002567362,0.00007426461,0.00038762903,0.00037757828,0.018072763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974936,0.00006254046,0.000013905467,0.000050028684,0.000106258354,0.000017769666],"domain_scores_gemma":[0.9990988,0.00055811193,0.00007665843,0.000120781,0.0001199577,0.000025714678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009925095,0.0006186473,0.0008710573,0.0007287293,0.0002214831,0.0011152161,0.00079856976,0.0011006817,0.0017562229],"category_scores_gemma":[0.0028660886,0.0006398622,0.00083927874,0.0009145069,0.0007921948,0.0015806283,0.0007908092,0.0016733762,0.0006207917],"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.00014508993,0.0000681676,0.0004911134,0.00027013003,0.00011553896,0.00018101666,0.00013409402,0.29897928,0.025694983,0.48130113,0.004957613,0.18766184],"study_design_scores_gemma":[0.000008056863,0.000013547661,0.00015312449,0.000013449361,0.000016787173,0.00010475517,0.000007826366,0.9061502,0.0026980296,0.08880784,0.0020109701,0.000015368005],"about_ca_topic_score_codex":0.0011540992,"about_ca_topic_score_gemma":0.0014240838,"teacher_disagreement_score":0.0017562229,"about_ca_system_score_codex":0.00048040322,"about_ca_system_score_gemma":0.00038342664,"threshold_uncertainty_score":0.00587517},"labels":[],"label_agreement":null},{"id":"W2140341164","doi":"10.1007/3-540-45787-9_20","title":"Interactive Intra-operative 3D Ultrasound Reconstruction and Visualization","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":71,"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":"Computer science; 3D ultrasound; Modality (human–computer interaction); Computer vision; Ultrasound; Imaging phantom; Volume (thermodynamics); Visualization; Artificial intelligence; 3D reconstruction; Feature (linguistics); Modal; Computer graphics (images); Radiology; Medicine","score_opus":0.015410424849089145,"score_gpt":0.3104891244163362,"score_spread":0.295078699567247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140341164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008899135,0.0013962135,0.9626161,0.0003412973,0.0001868259,0.00009257377,0.0004926908,0.009049739,0.016925495],"genre_scores_gemma":[0.12167784,0.0030392602,0.824143,0.00040125696,0.0002319421,0.00026771813,0.0011830857,0.004649199,0.044406693],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961436,0.000068572605,0.00002196374,0.000039833903,0.00021014779,0.000045111257],"domain_scores_gemma":[0.99908936,0.00056899927,0.000026738784,0.00017919559,0.000074958814,0.00006070911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072208693,0.0011314852,0.00060122076,0.000782382,0.0002518998,0.0014367499,0.0014915514,0.0012441884,0.031718895],"category_scores_gemma":[0.0017395937,0.001011337,0.0009431523,0.00045361294,0.00041877292,0.0008532546,0.0025009746,0.0013188029,0.00531529],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007049825,0.00016044147,0.0010455576,0.00093721744,0.00009531178,0.0015522274,0.00062016747,0.029751353,0.19390689,0.009619607,0.04942664,0.71217966],"study_design_scores_gemma":[0.00023831164,0.00063639105,0.008199284,0.00073878147,0.00023007776,0.025879595,0.00039256975,0.35723358,0.25525331,0.026731683,0.32401368,0.0004527625],"about_ca_topic_score_codex":0.0005190708,"about_ca_topic_score_gemma":0.001008775,"teacher_disagreement_score":0.031718895,"about_ca_system_score_codex":0.00019448092,"about_ca_system_score_gemma":0.00034569882,"threshold_uncertainty_score":0.106110215},"labels":[],"label_agreement":null},{"id":"W2140405153","doi":"10.1007/978-3-540-78791-4_7","title":"Control Flow Emulation on Tiled SIMD Architectures","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Control flow; SIMD; Cache; Programmer; Emulation; Memory bandwidth; Computer architecture; Embedded system; Programming language","score_opus":0.013719684377009609,"score_gpt":0.2428361197946809,"score_spread":0.2291164354176713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140405153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15870564,0.00019507245,0.8157114,0.000195545,0.00012176103,0.000046694233,0.00013459299,0.0023628916,0.022526419],"genre_scores_gemma":[0.8696585,0.00011404057,0.124212004,0.00008197562,0.000024145787,0.00006487886,0.00016286265,0.0002887378,0.0053927843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981755,0.00005034676,0.000007880606,0.000023184026,0.000074361575,0.000026752787],"domain_scores_gemma":[0.99958307,0.00017505755,0.000030065403,0.00011498799,0.000076264456,0.000020612533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034255834,0.00030249142,0.00031637715,0.00025073648,0.00023559901,0.00046506853,0.0007220656,0.00034404802,0.004284447],"category_scores_gemma":[0.0011272797,0.00019554805,0.00028352928,0.00032942268,0.00035880774,0.0005889789,0.00050733035,0.00045636916,0.0002919089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002911973,0.000055928223,0.000750576,0.00006803041,0.00002854266,0.00011544288,0.00009781368,0.88479215,0.016579753,0.03214396,0.0019026833,0.06317389],"study_design_scores_gemma":[0.000010023523,0.000023079436,0.00007290979,0.0000031609825,0.0000026842956,0.000014804444,0.000007737384,0.98938936,0.006135906,0.0033955679,0.00094175723,0.0000029453258],"about_ca_topic_score_codex":0.0011589559,"about_ca_topic_score_gemma":0.0011538002,"teacher_disagreement_score":0.004284447,"about_ca_system_score_codex":0.00036055996,"about_ca_system_score_gemma":0.0003570055,"threshold_uncertainty_score":0.0143328905},"labels":[],"label_agreement":null},{"id":"W2140414285","doi":"10.1007/978-3-642-36763-2_33","title":"The Visible Perimeter of an Arrangement of Disks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; École Polytechnique Fédérale de Lausanne; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Perimeter; Stacking; Combinatorics; Opacity; Order (exchange); Plane (geometry); Point (geometry); Square (algebra); Mathematics; Set (abstract data type); Square tiling; Upper and lower bounds; Geometry; Computer science; Grid; Physics; Optics; Mathematical analysis","score_opus":0.018032913260998183,"score_gpt":0.2567467583968348,"score_spread":0.23871384513583663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140414285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2568432,0.0016531697,0.43260562,0.0008914201,0.00072852935,0.000086914966,0.00061012775,0.0007832335,0.30579782],"genre_scores_gemma":[0.8252048,0.0010092907,0.119594835,0.00014496804,0.0002583886,0.00008052989,0.00049850927,0.00038337498,0.052825276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970835,0.000048902595,0.000010302198,0.00007453372,0.00012496614,0.000032962158],"domain_scores_gemma":[0.99962413,0.00012517137,0.000052342366,0.00007532113,0.000053359203,0.000069669826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017939022,0.00044207304,0.00036992136,0.00065852515,0.00059432077,0.0015692591,0.0007127655,0.0008090182,0.006920679],"category_scores_gemma":[0.0011759811,0.00045204643,0.00021415159,0.0005748089,0.0019155756,0.0016808233,0.001528663,0.0013292657,0.0014261799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018488822,0.000026614192,0.0004674996,0.00016026276,0.000009425419,0.00046799053,0.0004557946,0.008560514,0.012484747,0.8981016,0.006181017,0.072899565],"study_design_scores_gemma":[0.00007640496,0.00017233487,0.0012522505,0.00010259971,0.000016557964,0.001607319,0.00050634984,0.05536872,0.0065011987,0.8629528,0.07140815,0.00003539194],"about_ca_topic_score_codex":0.00019860112,"about_ca_topic_score_gemma":0.00016445825,"teacher_disagreement_score":0.006920679,"about_ca_system_score_codex":0.00021800288,"about_ca_system_score_gemma":0.00020407545,"threshold_uncertainty_score":0.023151934},"labels":[],"label_agreement":null},{"id":"W2140426549","doi":"10.1007/978-3-642-12334-4_21","title":"OpenTM: Traffic Matrix Estimator for OpenFlow Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":281,"is_retracted":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":"OpenFlow; Computer science; Overhead (engineering); Estimator; Matrix (chemical analysis); Controller (irrigation); Scheme (mathematics); Routing (electronic design automation); Distributed computing; Computer network; Algorithm; Real-time computing; Software-defined networking; Mathematics","score_opus":0.01483916119289619,"score_gpt":0.26045663919923095,"score_spread":0.24561747800633477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140426549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033884458,0.00015464371,0.9898087,0.000040564944,0.00007746206,0.000026460559,0.00025634043,0.005910817,0.0003366034],"genre_scores_gemma":[0.14873238,0.0002820911,0.84173775,0.00013342625,0.00027096862,0.00025183888,0.002247863,0.0010221043,0.00532146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915993,0.00018328859,0.00003667083,0.00017835984,0.0003712757,0.000070486356],"domain_scores_gemma":[0.9989415,0.0003764504,0.000114767536,0.00016504302,0.00034213657,0.000060114933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012162704,0.0008887241,0.0009779731,0.0015243248,0.0003529051,0.0009895241,0.001352541,0.001065967,0.0043947957],"category_scores_gemma":[0.005812416,0.0005042237,0.00046009288,0.0010559205,0.00025533,0.0019245773,0.0012117143,0.0013116504,0.0019359584],"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.00061105733,0.00014288601,0.0023320485,0.00020853452,0.0001383663,0.000078851146,0.00008990196,0.12621862,0.024214406,0.016887715,0.034110934,0.79496664],"study_design_scores_gemma":[0.000026593349,0.000049810627,0.0007246709,0.000016457914,0.000014830519,0.000093914125,0.000008429771,0.97548306,0.009945173,0.00789274,0.0057210457,0.000023367911],"about_ca_topic_score_codex":0.0018174249,"about_ca_topic_score_gemma":0.0018174914,"teacher_disagreement_score":0.0043947957,"about_ca_system_score_codex":0.00053340604,"about_ca_system_score_gemma":0.0006809575,"threshold_uncertainty_score":0.014702082},"labels":[],"label_agreement":null},{"id":"W2140469741","doi":"10.1007/978-3-642-54429-3_5","title":"Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Sherman Fairchild Foundation; National Science Foundation","keywords":"Invariant (physics); Torus; Qubit; Fibonacci number; Mathematics; Covariant transformation; Quantum computer; Bracket polynomial; Quantum; Discrete mathematics; Computer science; Pure mathematics; Polynomial; Physics; Quantum mechanics; Mathematical physics; Geometry; Matrix polynomial; Mathematical analysis; Alternating polynomial","score_opus":0.07622366708683276,"score_gpt":0.2888334859056354,"score_spread":0.21260981881880264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140469741","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.6736736,0.0012045333,0.25884667,0.0020662472,0.0003290967,0.00008794364,0.000717771,0.0007058035,0.06236832],"genre_scores_gemma":[0.9638173,0.00056194374,0.02234217,0.0002713265,0.00024119832,0.000099509496,0.00065162726,0.00038417583,0.011630811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902296,0.00029300922,0.000038529717,0.00016408246,0.00027171924,0.00020958247],"domain_scores_gemma":[0.9978097,0.0012263679,0.00017875865,0.0004051934,0.00015179733,0.00022813767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014943428,0.0014079651,0.001788913,0.0011620412,0.0014260963,0.0029525738,0.0024254415,0.001505623,0.0051499642],"category_scores_gemma":[0.005487531,0.0006031875,0.0011298308,0.00094825844,0.0042591323,0.0052617956,0.0028014623,0.0038166835,0.0007569275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015244196,0.000054174452,0.0003823494,0.00012953246,0.000020420777,0.000048334987,0.00021734479,0.030092828,0.0012741954,0.95719457,0.0025817484,0.00785198],"study_design_scores_gemma":[0.000015761234,0.000033304124,0.0001873065,0.000016929294,0.000008668526,0.000025797355,0.000058205642,0.0982648,0.000672673,0.9000833,0.0006153093,0.000017971352],"about_ca_topic_score_codex":0.0020046905,"about_ca_topic_score_gemma":0.001617717,"teacher_disagreement_score":0.0051499642,"about_ca_system_score_codex":0.001685395,"about_ca_system_score_gemma":0.0011198694,"threshold_uncertainty_score":0.017228305},"labels":[],"label_agreement":null},{"id":"W2140509667","doi":"10.1007/978-3-642-02611-9_18","title":"Implicit Active-Contouring with MRF","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Markov random field; Artificial intelligence; Active contour model; Cut; Segmentation; Image segmentation; Contouring; Computer vision; Algorithm; Computer graphics (images)","score_opus":0.01258313461399542,"score_gpt":0.26081993714436585,"score_spread":0.24823680253037045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140509667","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.0009964192,0.00025020764,0.9969541,0.00003543403,0.000037912017,0.000015883363,0.00001929475,0.0003878919,0.0013028958],"genre_scores_gemma":[0.049781106,0.0004986668,0.94266003,0.00006907006,0.00006067781,0.00007672772,0.00011658092,0.0005221156,0.0062151565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960536,0.00007539265,0.000021209475,0.00007309684,0.00019778823,0.000027177693],"domain_scores_gemma":[0.99909174,0.0004917897,0.00005387885,0.00020458369,0.00013436517,0.000023686775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009957312,0.0010493122,0.0010979834,0.0007883624,0.0003813452,0.0015744172,0.0022712476,0.0019417641,0.0056097647],"category_scores_gemma":[0.0030591208,0.001155974,0.00082947186,0.0009905678,0.00083195535,0.0020444442,0.0014610981,0.0019769066,0.0024423422],"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.00014169818,0.00007188424,0.00017980121,0.00048582314,0.00006233148,0.00014664957,0.00022194716,0.19741634,0.041691367,0.050059013,0.005722158,0.703801],"study_design_scores_gemma":[0.000012259455,0.00002742864,0.00007368241,0.000036426005,0.000018025268,0.00020074085,0.000010707346,0.95749074,0.0155960815,0.014797707,0.01171331,0.000022870696],"about_ca_topic_score_codex":0.0010585953,"about_ca_topic_score_gemma":0.0014613346,"teacher_disagreement_score":0.0056097647,"about_ca_system_score_codex":0.00037652068,"about_ca_system_score_gemma":0.00046864114,"threshold_uncertainty_score":0.018766463},"labels":[],"label_agreement":null},{"id":"W2140511449","doi":"10.1007/978-3-540-24840-8_37","title":"Distributed Data Mining vs. Sampling Techniques: A Comparison","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université Laval","funders":"","keywords":"Computer science; Data mining; Download; Aggregate (composite); Sampling (signal processing); Distributed database; Set (abstract data type); Volume (thermodynamics); Database; World Wide Web","score_opus":0.060641999652649735,"score_gpt":0.3188307178509959,"score_spread":0.2581887181983462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140511449","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.09874184,0.0726612,0.80178046,0.0034997303,0.0013337147,0.0009914399,0.00077008386,0.0038635603,0.016357968],"genre_scores_gemma":[0.5125848,0.03688411,0.43923393,0.0010918077,0.0017461785,0.0006004991,0.001383286,0.00097306323,0.0055023553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99048877,0.00360014,0.00051910855,0.0010121166,0.0040841214,0.00029580793],"domain_scores_gemma":[0.94836855,0.039089534,0.0011211935,0.0052565155,0.00533995,0.0008243406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011896611,0.0011878886,0.0033671951,0.004035045,0.0007454573,0.0026243788,0.0036372808,0.0018367987,0.0043053445],"category_scores_gemma":[0.033876363,0.00063348905,0.0015387455,0.005981235,0.0008989126,0.0049174097,0.001749856,0.0015728769,0.0012879224],"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.0032793866,0.0005141418,0.005910326,0.0018725473,0.0006967035,0.000052218787,0.00023864598,0.014980315,0.0028661548,0.011139917,0.00545691,0.95299274],"study_design_scores_gemma":[0.002849925,0.006186087,0.0364757,0.001569163,0.0028413034,0.002864637,0.0020806629,0.7391214,0.020421488,0.13338959,0.051958073,0.00024197531],"about_ca_topic_score_codex":0.0019348033,"about_ca_topic_score_gemma":0.0036228143,"teacher_disagreement_score":0.011896611,"about_ca_system_score_codex":0.001336495,"about_ca_system_score_gemma":0.0018186434,"threshold_uncertainty_score":0.06291604},"labels":[],"label_agreement":null},{"id":"W2140542500","doi":"10.1007/978-3-642-37192-9_49","title":"On GPU Based Fitness Evaluation with Decoupled Training Partition Cardinality","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Partition (number theory); Genetic programming; Implementation; Evolutionary computation; Computation; Population; Parallel computing; Pareto principle; Programming style; Evolutionary algorithm; Theoretical computer science; Artificial intelligence; Mathematical optimization; Algorithm; Programming language","score_opus":0.038098832401498195,"score_gpt":0.27502090626496234,"score_spread":0.23692207386346414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140542500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15663591,0.0010709944,0.8071635,0.0005996478,0.00038111574,0.00015286317,0.00026329773,0.004537504,0.029195162],"genre_scores_gemma":[0.649726,0.00016277799,0.3358603,0.0002820873,0.000090779045,0.00012043922,0.00049476215,0.0006813648,0.01258151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991868,0.00024943112,0.000036110367,0.00010303892,0.00031869492,0.000105843064],"domain_scores_gemma":[0.9985581,0.0007138758,0.000049812774,0.0002750145,0.00032694556,0.0000762732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083049363,0.00074412575,0.0010053675,0.00083922636,0.00059195794,0.0014398504,0.0013891436,0.0013331503,0.010303301],"category_scores_gemma":[0.004189441,0.0003303117,0.00045594393,0.0009883303,0.00042434968,0.0012114807,0.0014940881,0.0010048016,0.0011650216],"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.0007795267,0.00029254003,0.0020318932,0.00010334464,0.00010257924,0.00014872605,0.00009093921,0.44302824,0.01661437,0.009516127,0.00903831,0.51825345],"study_design_scores_gemma":[0.000020957645,0.000037193244,0.0005509004,0.000012568681,0.000011960134,0.00003022581,0.000013027027,0.99496907,0.001831263,0.0018035908,0.0007143538,0.000004889638],"about_ca_topic_score_codex":0.007432192,"about_ca_topic_score_gemma":0.012646747,"teacher_disagreement_score":0.010303301,"about_ca_system_score_codex":0.0007982582,"about_ca_system_score_gemma":0.00097407115,"threshold_uncertainty_score":0.034467936},"labels":[],"label_agreement":null},{"id":"W2140591634","doi":"10.1007/11523468_46","title":"Cache-Oblivious Planar Shortest Paths","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Cache; Parallel computing; Planar; Operating system","score_opus":0.02048433727542831,"score_gpt":0.23870999180391878,"score_spread":0.21822565452849046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140591634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15871415,0.0030057775,0.6801125,0.0029414105,0.00039485746,0.00042862352,0.0033989113,0.007779997,0.14322373],"genre_scores_gemma":[0.65775055,0.00263819,0.26137662,0.00056568166,0.00025852327,0.0005057018,0.003916661,0.0012511972,0.0717369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00012042113,0.000030590512,0.00014833723,0.00030587203,0.00016050786],"domain_scores_gemma":[0.9979163,0.00080764055,0.0001377982,0.0008718672,0.00019139142,0.00007503306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465054,0.0007213304,0.0010209477,0.0008205434,0.0011778319,0.0016823307,0.0026287006,0.001154578,0.011585327],"category_scores_gemma":[0.004320752,0.00063749467,0.00054765464,0.0028008458,0.0008595274,0.005252604,0.0023918094,0.0019225724,0.0028099942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011024037,0.00029353308,0.00074622047,0.0010498079,0.00011320772,0.00016672371,0.00048222867,0.22221255,0.013803992,0.34821972,0.08090376,0.33090594],"study_design_scores_gemma":[0.00021349451,0.00020054307,0.00044079422,0.00009827721,0.00009596365,0.0002707888,0.0001687644,0.32857135,0.011863434,0.6224373,0.035603356,0.0000359932],"about_ca_topic_score_codex":0.0019683207,"about_ca_topic_score_gemma":0.0038435787,"teacher_disagreement_score":0.011585327,"about_ca_system_score_codex":0.0016226054,"about_ca_system_score_gemma":0.0017335518,"threshold_uncertainty_score":0.038756788},"labels":[],"label_agreement":null},{"id":"W2140896141","doi":"10.1007/978-3-642-15883-4_2","title":"Learning an Affine Transformation for Non-linear Dimensionality Reduction","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimensionality reduction; Affine transformation; Diffusion map; Embedding; Curse of dimensionality; Computer science; Transformation (genetics); Data point; Algorithm; Linear map; Feature vector; Reduction (mathematics); Space (punctuation); Affine space; Nearest neighbor search; Geometric transformation; Artificial intelligence; Nonlinear dimensionality reduction; Mathematics; Image (mathematics)","score_opus":0.020143282381011842,"score_gpt":0.26878885763192967,"score_spread":0.24864557525091782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140896141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004945944,0.00032120294,0.9930033,0.00009990214,0.00006448488,0.00003228575,0.00011081544,0.000853568,0.000568465],"genre_scores_gemma":[0.1406076,0.0009811613,0.84632754,0.00020531217,0.00018500799,0.0002496373,0.0017064561,0.00027920533,0.00945811],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993119,0.00013131296,0.00005396458,0.00021793133,0.00021892852,0.0000659038],"domain_scores_gemma":[0.99943954,0.0001710941,0.000045340046,0.00019997873,0.000121438825,0.00002254445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061366573,0.0010345811,0.0011427837,0.0006198836,0.0004701873,0.00088744715,0.0013296987,0.00086041726,0.0041074106],"category_scores_gemma":[0.002244151,0.0004851387,0.0012253077,0.0012466147,0.0006262121,0.001607371,0.0018447847,0.0018309226,0.0030034475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090174944,0.00009377256,0.0004482614,0.00013296145,0.000070144575,0.00006186673,0.00006716691,0.051851362,0.014817045,0.011641216,0.009394604,0.9113313],"study_design_scores_gemma":[0.000013265048,0.0001259667,0.00064578437,0.000019427547,0.000030079502,0.00017353854,0.00005243247,0.95853657,0.014537649,0.019031648,0.0068103652,0.000023257806],"about_ca_topic_score_codex":0.0018094684,"about_ca_topic_score_gemma":0.0023799865,"teacher_disagreement_score":0.0041074106,"about_ca_system_score_codex":0.00036879175,"about_ca_system_score_gemma":0.0006667967,"threshold_uncertainty_score":0.013740659},"labels":[],"label_agreement":null},{"id":"W2140920152","doi":"10.1007/978-3-540-68825-9_27","title":"A Statistical Model for Topic Segmentation and Clustering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Dalhousie University","funders":"","keywords":"Computer science; Cluster analysis; Segmentation; Document clustering; Artificial intelligence; Statistical model; Brown clustering; Hierarchical clustering; Topic model; Bayesian probability; Natural language processing; Pattern recognition (psychology); Data mining; Fuzzy clustering; Canopy clustering algorithm","score_opus":0.0366026267238402,"score_gpt":0.2742441229591897,"score_spread":0.2376414962353495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140920152","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.0019459656,0.0004412885,0.99583673,0.00018931822,0.00005498687,0.00004602618,0.0002905944,0.0006152461,0.00057992147],"genre_scores_gemma":[0.13779785,0.0019096687,0.84024435,0.00034710584,0.0007115449,0.001069882,0.0044975635,0.0011150978,0.012306969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966348,0.0013397308,0.00024486374,0.00089206337,0.0006476075,0.00024095006],"domain_scores_gemma":[0.9906703,0.0067075808,0.00042515868,0.001078736,0.00090192637,0.00021633397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053362614,0.0013421611,0.0023150248,0.00342689,0.0015242521,0.0035101287,0.00498053,0.0032321096,0.0055051944],"category_scores_gemma":[0.01682482,0.0015845983,0.0031882613,0.005929234,0.0015786919,0.005286216,0.002320199,0.0035276182,0.0043664183],"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.00034163124,0.00019547806,0.0022767577,0.00046357658,0.0003758618,0.0002338087,0.0008905799,0.31437677,0.005269645,0.28469017,0.024597926,0.36628786],"study_design_scores_gemma":[0.00002055683,0.000023474398,0.00041072277,0.000025697926,0.000048106613,0.00010442228,0.000035275898,0.8550005,0.00064881996,0.139152,0.004498846,0.000031712432],"about_ca_topic_score_codex":0.010155239,"about_ca_topic_score_gemma":0.012791855,"teacher_disagreement_score":0.010155239,"about_ca_system_score_codex":0.002196394,"about_ca_system_score_gemma":0.0020762654,"threshold_uncertainty_score":0.02822113},"labels":[],"label_agreement":null},{"id":"W2141294623","doi":"10.1007/978-3-642-22673-1_23","title":"MathScheme: Project Description","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Leverage (statistics); Axiom; Symbolic computation; Computer science; Computation; Term (time); Axiomatic system; Automated theorem proving; Process (computing); Software; Software engineering; Theoretical computer science; Mathematics; Programming language; Artificial intelligence","score_opus":0.04594360053285044,"score_gpt":0.25267262040069755,"score_spread":0.2067290198678471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141294623","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039820555,0.0011398753,0.14068425,0.003513438,0.0015331458,0.0020232818,0.1610805,0.16358267,0.5224609],"genre_scores_gemma":[0.03028735,0.0015846145,0.13493305,0.0016529922,0.00061638345,0.004236616,0.22646715,0.08810113,0.5121208],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979146,0.00051145285,0.00010566204,0.0003844257,0.0007835656,0.00030026314],"domain_scores_gemma":[0.9965957,0.00035654622,0.00012353345,0.001097512,0.0008409264,0.0009857785],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032543037,0.0011552877,0.0007603655,0.0023194829,0.0010931576,0.0035053368,0.003109168,0.0013061496,0.5491544],"category_scores_gemma":[0.0064593935,0.00087455264,0.0006521313,0.002413408,0.0006061147,0.0042418106,0.0050007873,0.0022058045,0.5346564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020620701,0.00012583022,0.0002571062,0.00046540293,0.000009329311,0.000021282709,0.00010889781,0.00023323036,0.0027001454,0.028676309,0.8597883,0.107408084],"study_design_scores_gemma":[0.0000640898,0.000052419484,0.00029363853,0.00007308502,0.00000609754,0.00005227935,0.000038546532,0.0004042251,0.0021419919,0.006156025,0.99069995,0.000017747823],"about_ca_topic_score_codex":0.0009826734,"about_ca_topic_score_gemma":0.0012119856,"teacher_disagreement_score":0.5491544,"about_ca_system_score_codex":0.001346933,"about_ca_system_score_gemma":0.0025902563,"threshold_uncertainty_score":0.64307654},"labels":[],"label_agreement":null},{"id":"W2141304223","doi":"10.1007/978-3-642-31223-6_15","title":"Interpreting Effect Size Estimates through Graphic Analysis of Raw Data Distributions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Meta-analysis and systematic reviews","field":"Decision Sciences","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":"Normality; Computer science; Econometrics; Raw data; Null hypothesis; Statistics; Distortion (music); Statistical hypothesis testing; Sample size determination; Null (SQL); Mathematics; Data mining","score_opus":0.3935157874980481,"score_gpt":0.47357126884861717,"score_spread":0.08005548135056906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141304223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067304033,0.0025344659,0.9650863,0.0024536357,0.00072681246,0.0009923133,0.0068486664,0.010128755,0.004498686],"genre_scores_gemma":[0.08446149,0.001798349,0.899564,0.0016674636,0.0004889988,0.00357016,0.0028719096,0.004221502,0.0013561154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.87296546,0.101228826,0.008808417,0.007420364,0.009068915,0.0005080269],"domain_scores_gemma":[0.30032519,0.6621679,0.011016073,0.018993521,0.007182508,0.0003146896],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.10808415,0.0036141016,0.0037367975,0.019536927,0.0008579943,0.009611794,0.0040740576,0.0044686412,0.031801306],"category_scores_gemma":[0.53752875,0.0025606307,0.005943945,0.012176913,0.0036880036,0.0071114562,0.004569639,0.0081742285,0.0044780863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002080988,0.00026195048,0.01719651,0.025550384,0.008503882,0.0017085162,0.0070859673,0.02356978,0.010236277,0.15472278,0.121689476,0.62739354],"study_design_scores_gemma":[0.0016964987,0.0008791831,0.020409709,0.0062161135,0.005274438,0.0028617866,0.0018696953,0.076653995,0.00909007,0.8001685,0.07431849,0.0005614248],"about_ca_topic_score_codex":0.0016357881,"about_ca_topic_score_gemma":0.001658748,"teacher_disagreement_score":0.89191586,"about_ca_system_score_codex":0.0015839346,"about_ca_system_score_gemma":0.0019707333,"threshold_uncertainty_score":0.57161045},"labels":[],"label_agreement":null},{"id":"W2141682399","doi":"10.1007/978-3-642-30885-7_8","title":"Preventing Arithmetic Overflows in Alloy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Counterexample; Spurious relationship; Computer science; Bounded function; Semantics (computer science); Programming language; Arithmetic; Range (aeronautics); Key (lock); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Operating system","score_opus":0.02226271050203656,"score_gpt":0.27457102186265875,"score_spread":0.2523083113606222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141682399","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.14983246,0.005425873,0.7501958,0.0010978286,0.0009356319,0.00017662895,0.00029813827,0.010081257,0.08195636],"genre_scores_gemma":[0.76913106,0.001884254,0.19862826,0.00043446987,0.00018785207,0.00009103384,0.00044725346,0.0014318896,0.027763875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785197,0.00033456585,0.00018124125,0.0002180571,0.0010870318,0.00032716958],"domain_scores_gemma":[0.99672794,0.0013920292,0.00024112844,0.00096426904,0.00059053744,0.00008412345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015053342,0.000984617,0.0013761917,0.0013101583,0.0013436774,0.0022570805,0.002053727,0.000986122,0.006970569],"category_scores_gemma":[0.008071022,0.00079408084,0.0008209637,0.0016834586,0.0018764534,0.0040107504,0.003067039,0.0013483032,0.0017732101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009596821,0.00013629385,0.0016134355,0.0010177323,0.00009406558,0.00048182544,0.0007457301,0.051354516,0.018633775,0.47754896,0.020270428,0.42714363],"study_design_scores_gemma":[0.000109701556,0.00025721898,0.00046533544,0.00033928695,0.00024195657,0.0006661415,0.0003636052,0.12887569,0.06725468,0.7391205,0.06220248,0.00010351172],"about_ca_topic_score_codex":0.0011226401,"about_ca_topic_score_gemma":0.0016083185,"teacher_disagreement_score":0.006970569,"about_ca_system_score_codex":0.0007550112,"about_ca_system_score_gemma":0.0015005814,"threshold_uncertainty_score":0.023318827},"labels":[],"label_agreement":null},{"id":"W2141829440","doi":"10.1007/978-3-642-33515-0_33","title":"Optimization of a Compliant Mechanical Amplifier Based on a Symmetric Five-Bar Topology","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Piezoelectric Actuators and Control","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Amplifier; Actuator; Bar (unit); Computer science; Displacement (psychology); Topology optimization; Topology (electrical circuits); Electronic engineering; Electrical engineering; Physics; Structural engineering; Engineering; Finite element method; Telecommunications; Bandwidth (computing)","score_opus":0.010778881450678474,"score_gpt":0.2123568430829866,"score_spread":0.20157796163230812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141829440","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.13264175,0.000576621,0.79213417,0.00051148527,0.00019274197,0.00012378735,0.000083111096,0.00044604926,0.07329042],"genre_scores_gemma":[0.9168188,0.00022097952,0.07259629,0.000074762924,0.000042115033,0.00010387469,0.000039972092,0.00006595565,0.010037237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987125,0.000029356399,0.000004394317,0.000022476628,0.000052143583,0.000020373951],"domain_scores_gemma":[0.99986935,0.000048257185,0.000025302503,0.000011414449,0.00003329633,0.000012444444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024638386,0.0005632146,0.00052510086,0.00029009086,0.0003100442,0.0008038695,0.00078886445,0.001238677,0.0044992385],"category_scores_gemma":[0.00046766628,0.00031552804,0.00036916143,0.00029589166,0.00037139817,0.00046604106,0.00043103204,0.00031884987,0.00074739277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020998578,0.00014762796,0.0003899399,0.00031243364,0.00008900919,0.00027333468,0.0001001331,0.81162226,0.08620375,0.05093545,0.0018497052,0.047866326],"study_design_scores_gemma":[0.000022939003,0.00012499804,0.00014882651,0.000010730541,0.000019990322,0.000064858024,0.000017655922,0.9933889,0.0027812915,0.0020768724,0.0013326933,0.000010192545],"about_ca_topic_score_codex":0.00043522363,"about_ca_topic_score_gemma":0.00080729,"teacher_disagreement_score":0.0044992385,"about_ca_system_score_codex":0.00034676466,"about_ca_system_score_gemma":0.00031665087,"threshold_uncertainty_score":0.0150514245},"labels":[],"label_agreement":null},{"id":"W2141921295","doi":"10.1007/978-3-540-68123-6_4","title":"Boosting Support Vector Machines for Imbalanced Data Sets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Boosting (machine learning); Support vector machine; Artificial intelligence; Computer science; Machine learning; Pattern recognition (psychology); Data mining","score_opus":0.04956617104562905,"score_gpt":0.3038860867448879,"score_spread":0.2543199156992588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141921295","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.011983431,0.0019531962,0.98380834,0.00022296683,0.00020537728,0.00004543652,0.000084056206,0.000744049,0.00095307996],"genre_scores_gemma":[0.34147057,0.0024233286,0.64769197,0.00023080809,0.0009791236,0.0002653229,0.0013088135,0.0002903753,0.005339701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977012,0.0006514623,0.00016013648,0.00033042548,0.0009975155,0.00015934189],"domain_scores_gemma":[0.9940118,0.0034145862,0.00031977936,0.00087572896,0.001210789,0.00016719493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044462453,0.001005503,0.002463397,0.0014612421,0.0004893594,0.0011467251,0.0020429145,0.001149456,0.0016766695],"category_scores_gemma":[0.0148818195,0.000812602,0.0009798962,0.002021345,0.00054667157,0.0022023942,0.0017292252,0.0025204194,0.001357395],"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.000272623,0.00014490902,0.0015316183,0.0002804806,0.00013483633,0.00009104552,0.00009461234,0.18841182,0.0053710663,0.015267821,0.012509894,0.77588934],"study_design_scores_gemma":[0.000009600566,0.000038014674,0.00028443523,0.000012516891,0.000016936046,0.000043521737,0.000007834133,0.98465294,0.0012368605,0.012151512,0.0015397024,0.000005993146],"about_ca_topic_score_codex":0.0007934852,"about_ca_topic_score_gemma":0.0008866058,"teacher_disagreement_score":0.0044462453,"about_ca_system_score_codex":0.0004792043,"about_ca_system_score_gemma":0.00052194914,"threshold_uncertainty_score":0.023514211},"labels":[],"label_agreement":null},{"id":"W2141924422","doi":"10.1007/978-3-642-21593-3_12","title":"Structural Fidelity vs. Naturalness - Objective Assessment of Tone Mapped Images","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Naturalness; Tone mapping; Computer science; Fidelity; Measure (data warehouse); Tone (literature); Brightness; Artificial intelligence; High dynamic range; Range (aeronautics); Similarity (geometry); Similarity measure; Computer vision; Pattern recognition (psychology); Dynamic range; Image (mathematics); Data mining","score_opus":0.01601109477786206,"score_gpt":0.29577368326102355,"score_spread":0.2797625884831615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141924422","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.7022085,0.0026187727,0.27151984,0.00023230638,0.00020076717,0.00034622,0.00052508805,0.000356152,0.021992356],"genre_scores_gemma":[0.9654336,0.00095123606,0.029139176,0.000051184474,0.00007300446,0.000058650723,0.00020788948,0.00008844777,0.0039969133],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994862,0.000091915615,0.000029304043,0.000056715126,0.0002994787,0.00003628574],"domain_scores_gemma":[0.997544,0.0014058194,0.000268371,0.00015186057,0.000516174,0.000113698836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092283107,0.00034974352,0.00023904555,0.0008390153,0.00013186294,0.0010236888,0.00025515672,0.0005294969,0.004439979],"category_scores_gemma":[0.0058777407,0.00015108817,0.00023471315,0.00030117057,0.000445454,0.0011004522,0.00058286084,0.00039202123,0.00047591125],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024538941,0.00024047098,0.014820436,0.0014938433,0.00016880936,0.00029207222,0.0005732743,0.011533893,0.53231776,0.0049472195,0.0011054451,0.43005297],"study_design_scores_gemma":[0.00016826096,0.00614365,0.24465409,0.00060845807,0.00062153366,0.0054737735,0.0014981191,0.18311356,0.5340217,0.013594078,0.009813972,0.00028888843],"about_ca_topic_score_codex":0.00042101645,"about_ca_topic_score_gemma":0.0006362673,"teacher_disagreement_score":0.004439979,"about_ca_system_score_codex":0.00017611934,"about_ca_system_score_gemma":0.00013421189,"threshold_uncertainty_score":0.014853239},"labels":[],"label_agreement":null},{"id":"W2142185590","doi":"10.1007/11427834_10","title":"Rough Sets and Bayes Factor","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":120,"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","keywords":"Rough set; Computer science; Bayes' theorem; Bayesian probability; Data mining; Dominance-based rough set approach; Naive Bayes classifier; Set (abstract data type); Bayes factor; Artificial intelligence; Inverse; Factor (programming language); Machine learning; Algorithm; Mathematics","score_opus":0.020131498321967756,"score_gpt":0.24447617600746377,"score_spread":0.224344677685496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142185590","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.013286262,0.06686726,0.8387641,0.00950227,0.0022486069,0.00010268306,0.00040971735,0.00027204215,0.06854706],"genre_scores_gemma":[0.5988327,0.058833696,0.30481136,0.0019739335,0.006910714,0.0004104093,0.00047252688,0.00014555415,0.027609078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949478,0.0026505722,0.00025298534,0.00054488564,0.0014520552,0.00015163775],"domain_scores_gemma":[0.98641807,0.0112213865,0.0005762395,0.0008396442,0.00082112686,0.0001235783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008276958,0.0011718431,0.002611131,0.0039565437,0.00090154813,0.0044608833,0.0012201378,0.0020308343,0.0055468176],"category_scores_gemma":[0.032408208,0.00071675575,0.0010239946,0.003321771,0.0033877124,0.00676544,0.0010792465,0.0027399503,0.0010953742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016338996,0.000011910259,0.00021725989,0.00014542733,0.000060499362,0.00005287467,0.00015735951,0.005041464,0.00005381566,0.94768757,0.0038713538,0.042684242],"study_design_scores_gemma":[0.000002730623,0.0000043467394,0.000098363205,0.000033924527,0.000012249738,0.000043255895,0.000024692272,0.00473959,0.000030217476,0.9923307,0.0026707882,0.000008983029],"about_ca_topic_score_codex":0.0016297936,"about_ca_topic_score_gemma":0.0009121708,"teacher_disagreement_score":0.008276958,"about_ca_system_score_codex":0.0016911275,"about_ca_system_score_gemma":0.0011349774,"threshold_uncertainty_score":0.043773234},"labels":[],"label_agreement":null},{"id":"W2142256070","doi":"10.1007/978-3-642-34487-9_4","title":"Nonparametric Localized Feature Selection via a Dirichlet Process Mixture of Generalized Dirichlet Distributions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Overfitting; Dirichlet process; Hierarchical Dirichlet process; Feature selection; Cluster analysis; Dirichlet distribution; Artificial intelligence; Nonparametric statistics; Computer science; Pattern recognition (psychology); Feature (linguistics); Model selection; Mixture model; Bayesian inference; Selection (genetic algorithm); Generalized Dirichlet distribution; Inference; Bhattacharyya distance; Latent Dirichlet allocation; Bayesian probability; Mathematics; Topic model; Dirichlet's principle; Statistics; Artificial neural network","score_opus":0.014398182293352314,"score_gpt":0.2728300052774227,"score_spread":0.25843182298407036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142256070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030983314,0.00013210131,0.9963253,0.000053777545,0.0000125167235,0.000012871923,0.000015218123,0.00010694565,0.00024293952],"genre_scores_gemma":[0.27072772,0.0006906772,0.7217182,0.000254559,0.00021270571,0.00044487364,0.00045420986,0.00028978256,0.0052072415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997569,0.0013102388,0.00009225195,0.0004037248,0.0004737977,0.00015087293],"domain_scores_gemma":[0.9958923,0.003187873,0.0001446314,0.00032563953,0.0003600701,0.00008954609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003080053,0.00078505266,0.0027577784,0.0012256526,0.00072412536,0.0018538338,0.0025130813,0.0017490435,0.002724209],"category_scores_gemma":[0.010094283,0.0011169891,0.0023140658,0.002057064,0.0014235129,0.0027893852,0.0025918507,0.001919983,0.001222688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006212761,0.00017427882,0.0010649605,0.00033961594,0.00029430928,0.0002154507,0.00033534467,0.47099042,0.009386059,0.12745142,0.006226997,0.38289988],"study_design_scores_gemma":[0.000021742791,0.000023382023,0.00015913777,0.000013934696,0.000023382068,0.000062913474,0.000015392443,0.9541983,0.0008991804,0.043777388,0.0007845667,0.00002079559],"about_ca_topic_score_codex":0.0015694869,"about_ca_topic_score_gemma":0.00201615,"teacher_disagreement_score":0.003080053,"about_ca_system_score_codex":0.0008219151,"about_ca_system_score_gemma":0.0008651649,"threshold_uncertainty_score":0.016289055},"labels":[],"label_agreement":null},{"id":"W2142700165","doi":"10.1007/978-3-642-23605-1_9","title":"The Role of Lateral Inferior Prefrontal Cortex during Information Retrieval","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural and Behavioral Psychology Studies","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Task (project management); Computer science; Prefrontal cortex; Matching (statistics); Word (group theory); Cognitive psychology; Artificial intelligence; Neuroscience; Psychology; Cognition; Mathematics; Statistics","score_opus":0.035971159733045946,"score_gpt":0.2765331090757301,"score_spread":0.24056194934268416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142700165","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.8404306,0.023358742,0.049058262,0.00432035,0.0005368938,0.00015143034,0.0010990615,0.00039315817,0.0806514],"genre_scores_gemma":[0.97985464,0.0032983834,0.008020092,0.0003441926,0.00016613895,0.00005378897,0.0002729702,0.00010532313,0.007884423],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998592,0.000023640494,0.000006038691,0.000035392357,0.00004979166,0.000025818938],"domain_scores_gemma":[0.9994574,0.00030770712,0.00008626219,0.0000524412,0.000046316858,0.000049797287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043058398,0.00024221437,0.00026041974,0.0002318159,0.00021850545,0.000978653,0.0004887934,0.00053636817,0.00434131],"category_scores_gemma":[0.0017239478,0.00029139922,0.00025539988,0.0003331679,0.0005422413,0.0013250641,0.00026418446,0.000634702,0.00049811194],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016723038,0.00017885398,0.0061739823,0.0007600536,0.0002031666,0.000510039,0.0009532517,0.0019738711,0.75898576,0.015042771,0.0034758872,0.21007012],"study_design_scores_gemma":[0.0007487778,0.0016085827,0.6781274,0.00042426228,0.00060162717,0.0033194828,0.0009501788,0.038455423,0.15447982,0.09829398,0.022836898,0.00015362143],"about_ca_topic_score_codex":0.0026155591,"about_ca_topic_score_gemma":0.0039431644,"teacher_disagreement_score":0.00434131,"about_ca_system_score_codex":0.00057297567,"about_ca_system_score_gemma":0.0005906026,"threshold_uncertainty_score":0.014523089},"labels":[],"label_agreement":null},{"id":"W2142740132","doi":"10.1007/978-3-642-04271-3_20","title":"Topological Characterization of Signal in Brain Images Using Min-Max Diagrams","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Robustness (evolution); Pairing; Pattern recognition (psychology); Representation (politics); Artificial intelligence; SIGNAL (programming language); Inference; Image (mathematics); Algorithm; Theoretical computer science; Physics","score_opus":0.017073176524273388,"score_gpt":0.2669546916604068,"score_spread":0.2498815151361334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142740132","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.13135833,0.00042786347,0.86397314,0.00029397992,0.0000325243,0.00004224436,0.00038396308,0.00042328786,0.00306465],"genre_scores_gemma":[0.79186404,0.00044216285,0.20504934,0.0000695797,0.00011943489,0.000117743,0.0004760726,0.00026024136,0.0016013727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995234,0.00016028214,0.000038859514,0.00012615218,0.00010357459,0.000047746402],"domain_scores_gemma":[0.99741167,0.0013617529,0.00043495814,0.00020000471,0.00036960669,0.00022193846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205291,0.0004807381,0.00067261106,0.004182204,0.00065293565,0.0026128003,0.00070929684,0.0006476979,0.0035273232],"category_scores_gemma":[0.0051862723,0.0003257801,0.0006419191,0.0015019816,0.0011475747,0.0033649555,0.0009558361,0.0007017245,0.00035142805],"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.0008406925,0.000108316905,0.0069193165,0.00052775024,0.000097654236,0.00045843664,0.00086882536,0.06038169,0.05350438,0.69141394,0.0022535722,0.18262543],"study_design_scores_gemma":[0.00003053973,0.00024670074,0.006745433,0.000072555486,0.00007566805,0.0012416368,0.0003217882,0.47714537,0.02006777,0.48644885,0.0075285775,0.00007503582],"about_ca_topic_score_codex":0.00042801336,"about_ca_topic_score_gemma":0.00036194889,"teacher_disagreement_score":0.004182204,"about_ca_system_score_codex":0.00074016344,"about_ca_system_score_gemma":0.000399607,"threshold_uncertainty_score":0.011800051},"labels":[],"label_agreement":null},{"id":"W2142756199","doi":"10.1007/978-3-642-03685-9_1","title":"Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","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 Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Planar graph; Approximation algorithm; Discrete mathematics; Mathematics; Cardinality (data modeling); Computer science; Graph; Algorithm","score_opus":0.017948463206996036,"score_gpt":0.23337833848091166,"score_spread":0.21542987527391563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142756199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13137946,0.012806151,0.76155835,0.009655045,0.00088271935,0.00047941544,0.0034013938,0.002187762,0.07764972],"genre_scores_gemma":[0.4702369,0.013504969,0.46351323,0.0019119804,0.0023125734,0.0009745667,0.009917064,0.0015640291,0.036064755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958775,0.00097388006,0.00025634203,0.0008508914,0.0014092106,0.00063223595],"domain_scores_gemma":[0.9846676,0.0116256485,0.0007005262,0.0020149213,0.0005486516,0.00044267206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025658535,0.0033784807,0.0041205115,0.0027047535,0.0027821155,0.008635891,0.007828078,0.0044015334,0.01756754],"category_scores_gemma":[0.017225292,0.0028692356,0.0042631994,0.008335703,0.0039543477,0.018555058,0.0046831714,0.0124424435,0.0031408018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023412753,0.0016017932,0.0030586903,0.0032223375,0.0005663844,0.00051096716,0.0015202203,0.3306369,0.0071573886,0.35597822,0.06919861,0.22420725],"study_design_scores_gemma":[0.00031487513,0.00016781292,0.0011740754,0.00019826462,0.0002403203,0.00054834055,0.00051878794,0.34060657,0.003007336,0.6411605,0.011982712,0.00008034057],"about_ca_topic_score_codex":0.002780835,"about_ca_topic_score_gemma":0.003105304,"teacher_disagreement_score":0.01756754,"about_ca_system_score_codex":0.0038156393,"about_ca_system_score_gemma":0.0020715639,"threshold_uncertainty_score":0.058769286},"labels":[],"label_agreement":null},{"id":"W2142773709","doi":"10.1007/978-3-319-24589-8_6","title":"A Battle of Wit: Applying Computational Humour to Game Design","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Humor Studies and Applications","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Wilfrid Laurier University","funders":"","keywords":"Computer science; Laughter; Computational creativity; Game design; Comics; Scripting language; Battle; Multimedia; Human–computer interaction; Creativity; Artificial intelligence; Psychology; Art; Literature","score_opus":0.08080563895884758,"score_gpt":0.34698938196476575,"score_spread":0.2661837430059182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142773709","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035600796,0.0025449407,0.8267953,0.0036182338,0.00029401126,0.00010661206,0.00007931013,0.0009923921,0.1299683],"genre_scores_gemma":[0.7162909,0.0015469793,0.22532965,0.0005529824,0.00012293566,0.00017025124,0.00010622903,0.0004044379,0.055475656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995283,0.0002850548,0.000012417939,0.000044437704,0.00009739357,0.000032513984],"domain_scores_gemma":[0.998478,0.0012029753,0.000031653806,0.0001381656,0.000094477014,0.000054739623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010637748,0.00058990164,0.00038841605,0.00063543196,0.0010202067,0.003370977,0.001191869,0.00093423465,0.010195697],"category_scores_gemma":[0.0051432136,0.00036691787,0.0003763712,0.0005321981,0.0040038647,0.0045123193,0.0019744197,0.0018828085,0.001070467],"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.000056197387,0.000053415217,0.00048031352,0.0001815881,0.000025771966,0.00006582646,0.002830416,0.011368995,0.0014727956,0.81735235,0.007446794,0.1586655],"study_design_scores_gemma":[0.000013049093,0.000037670645,0.0002491506,0.00009513642,0.000011279906,0.000074731426,0.00084950664,0.057599835,0.0017366797,0.9016404,0.037671976,0.000020698188],"about_ca_topic_score_codex":0.0014638187,"about_ca_topic_score_gemma":0.002048319,"teacher_disagreement_score":0.010195697,"about_ca_system_score_codex":0.00086671405,"about_ca_system_score_gemma":0.0006563638,"threshold_uncertainty_score":0.034108043},"labels":[],"label_agreement":null},{"id":"W2142798202","doi":"10.1007/978-3-642-04409-0_34","title":"A Web Recommender System for Recommending, Predicting and Personalizing Music Playlists","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"Dalhousie University","funders":"","keywords":"Computer science; Recommender system; Personalization; Information retrieval; Collaborative filtering; World Wide Web; Similarity (geometry); Matching (statistics); Ontology; Semantic Web; Set (abstract data type); Multimedia; Artificial intelligence; Image (mathematics)","score_opus":0.03277520918000163,"score_gpt":0.2556927464889884,"score_spread":0.22291753730898675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142798202","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.1918952,0.006654379,0.74126804,0.0012341923,0.001033314,0.001421953,0.009230244,0.034793954,0.012468717],"genre_scores_gemma":[0.2676341,0.0017741686,0.6926604,0.00059357303,0.0004171758,0.00060025614,0.008946896,0.000353511,0.027019877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993963,0.000088812376,0.000060252416,0.00014614199,0.00027355563,0.00003486447],"domain_scores_gemma":[0.99864143,0.00047090463,0.000059196096,0.00020254766,0.0005188994,0.00010703195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012041877,0.00080628373,0.0016877789,0.002511258,0.0008074705,0.0009657789,0.0016625301,0.0015522165,0.0060897525],"category_scores_gemma":[0.0024108973,0.0006101397,0.0010035369,0.0021701718,0.00013519115,0.0014904084,0.0006830892,0.00097374874,0.004502402],"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.0012428875,0.0014076503,0.015020179,0.00045539238,0.0006266828,0.0005220097,0.00015369333,0.014083425,0.022562478,0.0015170347,0.057985067,0.88442355],"study_design_scores_gemma":[0.0005065856,0.00091597304,0.020628735,0.00008742573,0.0007874141,0.0012934105,0.0001432275,0.9240342,0.015178224,0.0024194699,0.03380645,0.0001989067],"about_ca_topic_score_codex":0.019584522,"about_ca_topic_score_gemma":0.04596464,"teacher_disagreement_score":0.019584522,"about_ca_system_score_codex":0.00036307902,"about_ca_system_score_gemma":0.000574638,"threshold_uncertainty_score":0.038941085},"labels":[],"label_agreement":null},{"id":"W2142806209","doi":"10.1007/978-3-540-30125-7_30","title":"Parameterized Hierarchical Annealing for Scientific Models","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Simulated annealing; Computational complexity theory; Binary number; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04154809855304583,"score_gpt":0.29514569779073985,"score_spread":0.25359759923769404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142806209","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.0022860756,0.0007548868,0.9911259,0.00022261444,0.000059781276,0.000026180993,0.00009263751,0.0004625199,0.0049693673],"genre_scores_gemma":[0.21987373,0.0018037658,0.75299615,0.00029650272,0.00023639461,0.0006214478,0.0009068023,0.0020315864,0.021233665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992932,0.0003498449,0.000030538395,0.00011112201,0.0001681737,0.000047053145],"domain_scores_gemma":[0.99807525,0.0012990014,0.00010488244,0.00032752723,0.00011583903,0.00007737442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014227864,0.0009152444,0.0019797527,0.0009314159,0.00091109244,0.0017316971,0.0023934883,0.002339162,0.0081100315],"category_scores_gemma":[0.005366861,0.0014167615,0.001987813,0.0013874281,0.0017177215,0.002131499,0.0019567693,0.003026246,0.001534701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025713387,0.000026445274,0.000110720284,0.00013555607,0.00004173277,0.00003940996,0.00008826473,0.5142073,0.0013597888,0.45495847,0.004045768,0.024960734],"study_design_scores_gemma":[0.000007929511,0.0000059451913,0.00005121194,0.000009919276,0.0000065439417,0.0000127017765,0.0000066738107,0.73237574,0.00018061536,0.26444772,0.0028856776,0.0000093461],"about_ca_topic_score_codex":0.004954519,"about_ca_topic_score_gemma":0.005841065,"teacher_disagreement_score":0.0081100315,"about_ca_system_score_codex":0.0025355346,"about_ca_system_score_gemma":0.0011379188,"threshold_uncertainty_score":0.027130723},"labels":[],"label_agreement":null},{"id":"W2142917246","doi":"10.1007/978-3-642-31037-9_1","title":"Determining the Determinants of Health Behaviour Change through an Online Social Network","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Social network (sociolinguistics); Data science; World Wide Web; Social media","score_opus":0.23709296569577837,"score_gpt":0.43992559454604435,"score_spread":0.20283262885026598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142917246","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.9856512,0.00032191334,0.005674286,0.00041498963,0.00004301845,0.00008646449,0.00074646785,0.000036221292,0.007025483],"genre_scores_gemma":[0.9918035,0.0003440341,0.0053978823,0.00003282438,0.000034029184,0.000084376916,0.0003988803,0.0000061825112,0.0018981675],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999424,0.00033493605,0.000018821323,0.000070425485,0.00009958046,0.00005231073],"domain_scores_gemma":[0.99483275,0.004196158,0.0004104117,0.00015544881,0.00016737435,0.00023783815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329781,0.0002667654,0.0002587827,0.00078768283,0.00036258713,0.000781279,0.00043582995,0.00038140806,0.004204024],"category_scores_gemma":[0.006905414,0.00019616897,0.0003964342,0.0010804315,0.00017147783,0.0010729486,0.0004359515,0.0006207405,0.00048097505],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020164064,0.0008575192,0.8840117,0.00007145534,0.000224923,0.00009504649,0.00067665265,0.0016596222,0.0008367063,0.0017119786,0.0011330129,0.10851983],"study_design_scores_gemma":[0.00002036649,0.00061463745,0.95673156,0.00006637381,0.0002459991,0.00020106565,0.0013141045,0.033454504,0.0007988489,0.004514468,0.0020132496,0.00002478884],"about_ca_topic_score_codex":0.006286267,"about_ca_topic_score_gemma":0.012032209,"teacher_disagreement_score":0.006286267,"about_ca_system_score_codex":0.0003582561,"about_ca_system_score_gemma":0.0004280083,"threshold_uncertainty_score":0.014063895},"labels":[],"label_agreement":null},{"id":"W2142926897","doi":"10.1007/978-3-540-74260-9_3","title":"Subband-Adaptive and Spatially-Adaptive Wavelet Thresholding for Denoising and Feature Preservation of Texture Images","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Wavelet; Computer vision; Thresholding; Texture (cosmology); Image texture; Texture filtering; Feature extraction; Noise reduction; Wavelet transform; Image processing; Image (mathematics)","score_opus":0.040079058609901935,"score_gpt":0.2890534802254565,"score_spread":0.24897442161555458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142926897","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.009082392,0.0022508232,0.9825373,0.00009296851,0.00014484845,0.000021826425,0.00005495368,0.00039229664,0.0054225703],"genre_scores_gemma":[0.11554157,0.005279846,0.8469426,0.0001245945,0.00019751585,0.000056893026,0.00027584456,0.00046505933,0.031116134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998976,0.000008478984,0.000005343311,0.000019296655,0.00006138549,0.000007910205],"domain_scores_gemma":[0.99986446,0.000048052814,0.000010424578,0.00003187029,0.000037778856,0.0000073908504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017460293,0.00033335376,0.00042447002,0.0003720804,0.00010599377,0.00046060284,0.00049931556,0.00041103797,0.0032474694],"category_scores_gemma":[0.00050692697,0.00019863463,0.0003432756,0.00065040356,0.0002859511,0.0005355153,0.00028823575,0.0005737369,0.001123565],"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.00012094772,0.00004655147,0.00015784397,0.00034687098,0.00003444775,0.0001439018,0.00008857285,0.01235642,0.33129856,0.031663798,0.0060181245,0.6177241],"study_design_scores_gemma":[0.000028240245,0.00020553046,0.0022915225,0.00006113772,0.000114816045,0.0016002165,0.00006457947,0.55252934,0.32806128,0.060051635,0.05494583,0.00004582258],"about_ca_topic_score_codex":0.00025956501,"about_ca_topic_score_gemma":0.0006937294,"teacher_disagreement_score":0.0032474694,"about_ca_system_score_codex":0.00014416112,"about_ca_system_score_gemma":0.0001498594,"threshold_uncertainty_score":0.010863841},"labels":[],"label_agreement":null},{"id":"W2142989929","doi":"10.1007/978-3-642-21043-3_10","title":"Automatic Semantic Web Annotation of Named Entities","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Information retrieval; Annotation; Entity linking; Semantic similarity; Semantic Web Stack; Semantic Web; RDF; Social Semantic Web; Set (abstract data type); Context (archaeology); Semantic annotation; Natural language processing; Artificial intelligence; Knowledge base; Programming language","score_opus":0.013889539820225304,"score_gpt":0.24719479246439624,"score_spread":0.23330525264417093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142989929","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.022015452,0.0021299787,0.92025274,0.000825908,0.0006145754,0.00024666087,0.008783657,0.02261597,0.022515045],"genre_scores_gemma":[0.1159197,0.002662494,0.8111941,0.0003429864,0.00020404912,0.00029430017,0.049459647,0.0030579432,0.01686471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882597,0.00024075799,0.00014940866,0.00022924876,0.00048374114,0.000070829316],"domain_scores_gemma":[0.9975526,0.0009642223,0.00015470728,0.0005927454,0.0006669884,0.00006869848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014596928,0.00079698925,0.0008613491,0.005505829,0.0014601877,0.002875522,0.0015216868,0.0011498925,0.008370196],"category_scores_gemma":[0.0038568585,0.00066570326,0.0011862054,0.0054523847,0.0006887659,0.005477999,0.002521056,0.0014605355,0.006449016],"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.00027550038,0.00029886293,0.0022032494,0.0014386597,0.0001135221,0.0009595525,0.00090975396,0.0061858967,0.033225153,0.10451805,0.09161276,0.758259],"study_design_scores_gemma":[0.00006836054,0.00006689661,0.004658185,0.0009051444,0.0002612844,0.0015117569,0.0008562155,0.24179785,0.08927034,0.22578786,0.43467993,0.00013620553],"about_ca_topic_score_codex":0.002988437,"about_ca_topic_score_gemma":0.005347576,"teacher_disagreement_score":0.008370196,"about_ca_system_score_codex":0.00076828484,"about_ca_system_score_gemma":0.0015884935,"threshold_uncertainty_score":0.02800107},"labels":[],"label_agreement":null},{"id":"W2143114469","doi":"10.1007/3-540-44763-6_24","title":"Selecting the QoS Parameters for Multicast Applications Based on User Profile and Device Capability","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Bandwidth (computing); Quality of service; Computer network; Partition (number theory); Real-time computing; Distributed computing","score_opus":0.01877266087804563,"score_gpt":0.2497167665430904,"score_spread":0.23094410566504478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143114469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3949587,0.0027695368,0.57937974,0.0005242987,0.00023434404,0.00038701025,0.00028042428,0.0043631494,0.017102813],"genre_scores_gemma":[0.91370505,0.00066947826,0.0812076,0.000118762946,0.000127091,0.00007402676,0.00019847233,0.00034721076,0.0035522624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999597,0.000101586986,0.00003202792,0.00006256271,0.00013256657,0.00007426913],"domain_scores_gemma":[0.9976144,0.0013232775,0.00013241725,0.00024775323,0.00047766577,0.0002044632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009754253,0.00073470693,0.0009319445,0.0012005103,0.00044918718,0.0014872716,0.00068287406,0.00069707015,0.0019549895],"category_scores_gemma":[0.0052785343,0.00043057205,0.00026988078,0.00063232577,0.00019446683,0.0012185583,0.00044268204,0.0009240456,0.0010696154],"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.002118932,0.00030799612,0.020592455,0.0002619052,0.00010420383,0.00073279114,0.00045979428,0.020534722,0.3552939,0.0062140054,0.0077060116,0.5856734],"study_design_scores_gemma":[0.00016357293,0.0006061424,0.03120684,0.00014854122,0.00026324688,0.004202804,0.00061226235,0.64513993,0.28057566,0.019477645,0.017351603,0.00025174723],"about_ca_topic_score_codex":0.00044764107,"about_ca_topic_score_gemma":0.0007534483,"teacher_disagreement_score":0.0019549895,"about_ca_system_score_codex":0.0003414021,"about_ca_system_score_gemma":0.00022696328,"threshold_uncertainty_score":0.0065401196},"labels":[],"label_agreement":null},{"id":"W2143187586","doi":"10.1007/978-3-540-75757-3_34","title":"Statistical Shape Modeling Using MDL Incorporating Shape, Appearance, and Expert Knowledge","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Landmark; Artificial intelligence; Computer science; Classifier (UML); Pattern recognition (psychology); Minimum description length; Key (lock); Point (geometry); Computer vision; Machine learning; Mathematics; Geometry","score_opus":0.03743228647253435,"score_gpt":0.3184479332582311,"score_spread":0.2810156467856968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143187586","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.0068389853,0.000096260315,0.9913607,0.00012448066,0.000023566217,0.000032110936,0.00017566748,0.00049061,0.00085769047],"genre_scores_gemma":[0.5553919,0.0004359237,0.43350118,0.00048389568,0.0001449999,0.00043589188,0.0015033438,0.0004977482,0.00760503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991049,0.0002385017,0.000062983185,0.0001796856,0.00033502714,0.00007881282],"domain_scores_gemma":[0.99637526,0.0020799926,0.00035225053,0.00045314422,0.0006072811,0.0001320151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016488526,0.0006266363,0.0016052099,0.001678666,0.00050779287,0.0016152028,0.003112893,0.002020072,0.0030358832],"category_scores_gemma":[0.005118914,0.0012340735,0.0018337091,0.0016348399,0.0008222445,0.0018862231,0.001347411,0.0015929769,0.0015927244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032516076,0.00003637414,0.00048244811,0.000036946632,0.00003901527,0.000052955667,0.000021618753,0.9620636,0.0010638018,0.008473872,0.00062351074,0.027073266],"study_design_scores_gemma":[0.0000010147296,0.0000027271817,0.000016311988,9.508461e-7,0.0000015112666,0.000005886703,7.7420106e-7,0.9987018,0.000095517506,0.0010937406,0.00007802495,0.0000017394639],"about_ca_topic_score_codex":0.011943489,"about_ca_topic_score_gemma":0.012510972,"teacher_disagreement_score":0.011943489,"about_ca_system_score_codex":0.0016958751,"about_ca_system_score_gemma":0.0014160891,"threshold_uncertainty_score":0.023747921},"labels":[],"label_agreement":null},{"id":"W2143300918","doi":"10.1007/978-3-642-41939-3_67","title":"One-to-Two Digital Earth","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Quadrilateral; Digital Earth; Polyhedron; Projection (relational algebra); Search engine indexing; Computer graphics (images); Cube (algebra); Algorithm; Computational science; Theoretical computer science; Artificial intelligence; Geometry; Geology; Remote sensing; Mathematics","score_opus":0.020994596987593823,"score_gpt":0.2703804536275938,"score_spread":0.24938585663999996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143300918","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014367677,0.0022143454,0.25580886,0.0020387757,0.0039454973,0.0001465491,0.001484601,0.0057225716,0.7142711],"genre_scores_gemma":[0.26410982,0.006415443,0.19000852,0.001019474,0.000605917,0.00013087214,0.002316446,0.0013545475,0.5340389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998325,0.000017088254,0.000008784259,0.000039731684,0.00007134904,0.000030427656],"domain_scores_gemma":[0.9997788,0.00003194899,0.000008169934,0.00008607624,0.000047363857,0.000047669644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001895124,0.00059138954,0.00043232393,0.0010332385,0.0009802347,0.0023952888,0.000966147,0.000856526,0.075306326],"category_scores_gemma":[0.0006869471,0.00027593446,0.00047014898,0.0010233519,0.001125706,0.0036524069,0.0028059846,0.0011422911,0.014318082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016545987,0.00005300695,0.0004940251,0.0004562587,0.000030536383,0.00031850825,0.00028880005,0.004349045,0.008239263,0.5167886,0.09873661,0.37007993],"study_design_scores_gemma":[0.000028167566,0.0000468122,0.00041467205,0.000092627015,0.000017138687,0.00056919566,0.0002802049,0.005263416,0.0046594497,0.13732253,0.85127604,0.000029782563],"about_ca_topic_score_codex":0.000937303,"about_ca_topic_score_gemma":0.0016207905,"teacher_disagreement_score":0.075306326,"about_ca_system_score_codex":0.00047372948,"about_ca_system_score_gemma":0.00060865114,"threshold_uncertainty_score":0.25192475},"labels":[],"label_agreement":null},{"id":"W2143443880","doi":"10.1007/978-3-540-92182-0_70","title":"Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","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":"Carleton University; Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Tree (set theory); Path (computing); Distributed computing; Real-time computing; Mathematical optimization; Computer network; Mathematics; Combinatorics","score_opus":0.00946704179049813,"score_gpt":0.18617303362142043,"score_spread":0.1767059918309223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143443880","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.17620444,0.0024585307,0.7900298,0.0012898523,0.00039766388,0.00057537144,0.0016287814,0.00046046375,0.026954994],"genre_scores_gemma":[0.69168085,0.0031986684,0.2606067,0.00031414075,0.00047514882,0.0006797513,0.0014296471,0.00058274664,0.041032303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935466,0.00018080928,0.00003176461,0.00016594098,0.00011888844,0.00014783721],"domain_scores_gemma":[0.9977272,0.0016594311,0.00023422237,0.000083478255,0.0001137438,0.00018203928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016269486,0.0018147263,0.0026983235,0.0012112961,0.0008322781,0.0021614733,0.0027254117,0.0021805118,0.007960248],"category_scores_gemma":[0.0032068898,0.001534199,0.0016187347,0.0037226211,0.0010774179,0.0029746096,0.0010722623,0.0016860225,0.00065181527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016337121,0.0000699583,0.00016928563,0.00022222339,0.000047386566,0.00010338399,0.00003924358,0.9613135,0.0013418449,0.017299434,0.0024151874,0.016815232],"study_design_scores_gemma":[0.00004443165,0.00009939285,0.00017477192,0.000018212137,0.00002344364,0.000049637147,0.000034422177,0.96084386,0.0007007811,0.036776524,0.0012211266,0.000013417612],"about_ca_topic_score_codex":0.0057953373,"about_ca_topic_score_gemma":0.0049233353,"teacher_disagreement_score":0.007960248,"about_ca_system_score_codex":0.001955265,"about_ca_system_score_gemma":0.001659703,"threshold_uncertainty_score":0.026629746},"labels":[],"label_agreement":null},{"id":"W2143451091","doi":"10.1007/978-3-642-22006-7_51","title":"Automatizability and Simple Stochastic Games","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Time complexity; Computational complexity theory; Computer science; Discrete mathematics; Connection (principal bundle); Mathematics; Theoretical computer science; Algorithm","score_opus":0.0653638619749691,"score_gpt":0.33283740400414724,"score_spread":0.26747354202917817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143451091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15157934,0.0061545176,0.56596595,0.0034663281,0.0004841454,0.0001584349,0.0003692638,0.00029994722,0.2715221],"genre_scores_gemma":[0.88084257,0.00398207,0.039582394,0.00039584778,0.0007471931,0.00029724574,0.00042147,0.00012884171,0.07360248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873716,0.00048130032,0.000084426094,0.0001836116,0.00038892415,0.00012460673],"domain_scores_gemma":[0.9977149,0.0016175322,0.00017946349,0.00019789314,0.00018105448,0.00010918758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011142832,0.0010544227,0.0011258433,0.000878789,0.0010605317,0.0029149682,0.0009632087,0.0016452381,0.0073875887],"category_scores_gemma":[0.0044368226,0.00058774796,0.0014925692,0.0013142945,0.0033571033,0.0033010382,0.0013375704,0.002733108,0.0009893803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009802319,0.000013172084,0.000051849176,0.000037493657,0.000011003925,0.000028891483,0.00006813503,0.004929633,0.00034065466,0.9898427,0.0008976052,0.0037689582],"study_design_scores_gemma":[0.000006016996,0.0000058538267,0.000042119307,0.0000055762866,0.0000028548814,0.000017212706,0.000006482439,0.0061506014,0.00006982644,0.99217755,0.0015108829,0.000005131632],"about_ca_topic_score_codex":0.0014408454,"about_ca_topic_score_gemma":0.0010082008,"teacher_disagreement_score":0.0073875887,"about_ca_system_score_codex":0.0015312758,"about_ca_system_score_gemma":0.0008038151,"threshold_uncertainty_score":0.024713933},"labels":[],"label_agreement":null},{"id":"W2143497908","doi":"10.1007/978-3-319-06483-3_1","title":"A Novel Particle Swarm-Based Approach for 3D Motif Matching and Protein Structure Classification","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Particle swarm optimization; Motif (music); Computer science; Pattern recognition (psychology); Artificial intelligence; Pattern matching; Algorithm","score_opus":0.01429931309546476,"score_gpt":0.24404978799078272,"score_spread":0.22975047489531797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143497908","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.008477442,0.00023772185,0.98852575,0.00008408579,0.00009115839,0.000087801294,0.00010215869,0.0014636724,0.00093012594],"genre_scores_gemma":[0.082879744,0.00020828204,0.9122683,0.00022594511,0.00008398278,0.00020860409,0.000618755,0.00021913496,0.003287255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993469,0.000087466346,0.000043174412,0.00017464672,0.00028581958,0.00006201334],"domain_scores_gemma":[0.9993849,0.0002320158,0.000049358467,0.00009205823,0.00018354539,0.00005807142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008187048,0.0013384133,0.0022049062,0.0023501273,0.00076072937,0.001285835,0.0028218452,0.002260744,0.0031908657],"category_scores_gemma":[0.0013900462,0.00077054277,0.0017837697,0.0026329397,0.00051271834,0.0012840109,0.0019043249,0.0011220884,0.0015285464],"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.0003163607,0.00035663036,0.0014935053,0.0001522498,0.00020279955,0.00015393169,0.000100417186,0.16794287,0.023031564,0.004594274,0.0075641023,0.79409134],"study_design_scores_gemma":[0.000010060698,0.00002276801,0.00016105485,0.0000025548068,0.000008350544,0.00002848369,0.000010051816,0.9969625,0.001137221,0.0010940946,0.0005567778,0.0000061156375],"about_ca_topic_score_codex":0.008451075,"about_ca_topic_score_gemma":0.0075062206,"teacher_disagreement_score":0.008451075,"about_ca_system_score_codex":0.0006057497,"about_ca_system_score_gemma":0.0009247481,"threshold_uncertainty_score":0.016803741},"labels":[],"label_agreement":null},{"id":"W2143516822","doi":"10.1007/978-3-642-21593-3_32","title":"Real-Time People Detection in Videos Using Geometrical Features and Adaptive Boosting","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Silhouette; Computer science; Boosting (machine learning); AdaBoost; Artificial intelligence; Pedestrian detection; Computer vision; Pattern recognition (psychology); Feature (linguistics); Object detection; Pedestrian; Support vector machine","score_opus":0.032860726538263794,"score_gpt":0.2736301474736156,"score_spread":0.24076942093535178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143516822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028400822,0.0005888846,0.96851707,0.000066733824,0.00009650879,0.000047746937,0.00005166004,0.0008779444,0.0013526712],"genre_scores_gemma":[0.48256478,0.00064715795,0.5134548,0.00010666031,0.00015421184,0.00006928833,0.0002949172,0.00014279956,0.002565324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993781,0.000118531105,0.00002309558,0.00016823196,0.00021084337,0.00010111727],"domain_scores_gemma":[0.9994593,0.0001985146,0.000050633895,0.000067852496,0.00018235357,0.000041242314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647343,0.0008851337,0.0016132441,0.001280001,0.0003222045,0.0006423426,0.0012933563,0.0008148355,0.0011848724],"category_scores_gemma":[0.0015935124,0.0005252363,0.00096369284,0.0010929877,0.0004634702,0.0010342933,0.0009280157,0.0007544786,0.00089092297],"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.0005357619,0.00016025935,0.0019347004,0.00014600634,0.00012558488,0.000088203065,0.000058878024,0.06806536,0.08506744,0.0025668559,0.0029763668,0.83827454],"study_design_scores_gemma":[0.0000147101355,0.00013553182,0.002678082,0.000010108267,0.00005099466,0.00021250833,0.000015007321,0.9726309,0.020856095,0.0021132615,0.0012658498,0.000016901657],"about_ca_topic_score_codex":0.0014215641,"about_ca_topic_score_gemma":0.0018726421,"teacher_disagreement_score":0.0016132441,"about_ca_system_score_codex":0.00040378261,"about_ca_system_score_gemma":0.0003723261,"threshold_uncertainty_score":0.0072175264},"labels":[],"label_agreement":null},{"id":"W2143536938","doi":"10.1007/11506157_25","title":"Key Management for Role Hierarchy in Distributed Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Key management; Key (lock); Hierarchy; Computer security; Distributed computing; Role-based access control; Cryptography; Domain (mathematical analysis); Variety (cybernetics); Distributed management; Access control","score_opus":0.014218313694126315,"score_gpt":0.2670388406751662,"score_spread":0.2528205269810399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143536938","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008174659,0.002264263,0.9688185,0.0011837708,0.00032511086,0.00016449502,0.00011226555,0.0008059966,0.018151006],"genre_scores_gemma":[0.49695522,0.0028739197,0.46255168,0.0004408734,0.00048989366,0.00049149035,0.00035566677,0.00031171183,0.035529595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982876,0.00052501075,0.00015394948,0.00021969329,0.000546452,0.00026718513],"domain_scores_gemma":[0.9979115,0.0009858096,0.00013880283,0.0005717814,0.00024064265,0.00015134258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367805,0.0006144178,0.00097165845,0.00057371584,0.0015633397,0.0032096119,0.0023276717,0.0011985548,0.009108398],"category_scores_gemma":[0.0062069274,0.00048194343,0.0005332817,0.0009026006,0.0017425856,0.006069883,0.002496247,0.0030530787,0.0023905288],"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.00022112993,0.00009754529,0.0002476878,0.00046338866,0.000032560103,0.00019720217,0.0010011028,0.018103465,0.007525788,0.7676642,0.017255286,0.18719067],"study_design_scores_gemma":[0.00008912078,0.00009233273,0.00017706872,0.0001137802,0.000041517527,0.00033123157,0.0003315574,0.19201837,0.0045312434,0.7490352,0.053193912,0.000044618668],"about_ca_topic_score_codex":0.001196428,"about_ca_topic_score_gemma":0.0016387921,"teacher_disagreement_score":0.009108398,"about_ca_system_score_codex":0.0013100392,"about_ca_system_score_gemma":0.0012478788,"threshold_uncertainty_score":0.03047061},"labels":[],"label_agreement":null},{"id":"W2143659673","doi":"10.1007/3-540-45482-9_3","title":"Towards a Computational Model for Object Recognition in IT Cortex","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Cognitive neuroscience of visual object recognition; 3D single-object recognition; Computer vision; Pattern recognition (psychology); Hough transform; Object detection; Invariant (physics); Affine transformation; Feature vector; Object (grammar); Search engine indexing; Object model; Image (mathematics); Mathematics","score_opus":0.040054508829233545,"score_gpt":0.2828938794442189,"score_spread":0.24283937061498534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143659673","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.007887325,0.00054896553,0.9816483,0.0012565113,0.00013652432,0.000032023545,0.00024187182,0.00081340596,0.0074350582],"genre_scores_gemma":[0.50997317,0.0016936035,0.46641356,0.0011110017,0.00031864262,0.00029336807,0.0009319253,0.00055146415,0.018713197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998166,0.000041269654,0.000012170328,0.000057866808,0.000040574956,0.000031613585],"domain_scores_gemma":[0.99951875,0.00019599468,0.00003765704,0.00011104115,0.00009957025,0.000036914673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046485668,0.00059095793,0.00090492,0.0005382659,0.0005145425,0.002685554,0.0029792632,0.00160685,0.004570149],"category_scores_gemma":[0.0012803229,0.00062526565,0.0017305902,0.0007768232,0.0011469814,0.0037442339,0.0010565036,0.0023782821,0.0018865437],"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.00007565713,0.000072133356,0.0010862565,0.0003412283,0.0001435564,0.00017262455,0.00040285048,0.1507678,0.014193988,0.71716464,0.010164342,0.10541493],"study_design_scores_gemma":[0.000009974524,0.00003270433,0.00049419736,0.00002841651,0.00004017832,0.00010931114,0.00005431111,0.56157863,0.0023204042,0.42959842,0.005716943,0.000016511953],"about_ca_topic_score_codex":0.004553033,"about_ca_topic_score_gemma":0.004657026,"teacher_disagreement_score":0.004570149,"about_ca_system_score_codex":0.0010035875,"about_ca_system_score_gemma":0.00096325454,"threshold_uncertainty_score":0.015288711},"labels":[],"label_agreement":null},{"id":"W2143708942","doi":"10.1007/978-3-642-32512-0_2","title":"Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Treewidth; Pathwidth; Combinatorics; Partial k-tree; Computer science; Chordal graph; Conjecture; Graph; Discrete mathematics; Mathematics; Line graph","score_opus":0.048832930724603034,"score_gpt":0.2910973016065226,"score_spread":0.24226437088191954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143708942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32138214,0.01583114,0.50657517,0.020621797,0.0010613227,0.00037869954,0.0028155355,0.0029925907,0.12834167],"genre_scores_gemma":[0.6997689,0.009446172,0.21742633,0.0024188033,0.0027698136,0.0006312236,0.0033049393,0.0013577959,0.06287605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996506,0.00093931286,0.00014059016,0.00087662745,0.0008734584,0.0006640468],"domain_scores_gemma":[0.9774869,0.01853336,0.0010984851,0.0015200248,0.00066136057,0.0006997922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029378906,0.0029253769,0.0036967797,0.0016364355,0.002925804,0.007771673,0.007729034,0.0053497856,0.016489033],"category_scores_gemma":[0.018106567,0.0023983254,0.0032817023,0.004694623,0.0041710366,0.01634166,0.0035304152,0.009899961,0.0023772449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012478562,0.0013062079,0.0017102383,0.002107213,0.00029774904,0.0006003226,0.0010138337,0.2053403,0.0077768355,0.557093,0.053175382,0.16833095],"study_design_scores_gemma":[0.00018876634,0.00013064728,0.00031115275,0.00008836422,0.00010862125,0.00035655263,0.00021494603,0.12968272,0.0017986968,0.86321074,0.0038661351,0.00004255682],"about_ca_topic_score_codex":0.0033526325,"about_ca_topic_score_gemma":0.0039410694,"teacher_disagreement_score":0.016489033,"about_ca_system_score_codex":0.00390008,"about_ca_system_score_gemma":0.0026931162,"threshold_uncertainty_score":0.055161297},"labels":[],"label_agreement":null},{"id":"W2143964524","doi":"10.1007/978-3-540-68083-3_15","title":"A Fuzzy Grid-QoS Framework for Obtaining Higher Grid Resources Availability","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quality of service; Computer science; Grid; Vagueness; Grid computing; Fuzzy logic; Service-level agreement; Distributed computing; Mobile QoS; Scalability; Quality (philosophy); Service (business); Database; Service provider; Computer network; Business; Artificial intelligence","score_opus":0.02916161999711185,"score_gpt":0.26080339144015435,"score_spread":0.2316417714430425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143964524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050770533,0.0000724127,0.99162966,0.00008834972,0.00003108687,0.000036754733,0.00005105006,0.0006610797,0.002352582],"genre_scores_gemma":[0.28699315,0.00012677014,0.7090515,0.00008663799,0.000057783345,0.00007772218,0.00013839564,0.00010073501,0.0033673707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994777,0.00009716487,0.00003973509,0.00008607576,0.00024221462,0.000057139892],"domain_scores_gemma":[0.9995023,0.00013554587,0.00003259386,0.000077799814,0.00019479831,0.00005689823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011945001,0.00037266416,0.0005480996,0.0005658509,0.00072800944,0.00141327,0.0014849557,0.0007343884,0.0039229314],"category_scores_gemma":[0.0016038113,0.00020844756,0.00063551916,0.0006199597,0.0004554279,0.0011463428,0.0010106383,0.0010059697,0.0006110144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034115207,0.0002600727,0.0012965694,0.00025833098,0.00008477625,0.0004308135,0.0002837277,0.39160967,0.03199587,0.27526036,0.007924948,0.2902537],"study_design_scores_gemma":[0.000013964152,0.000025254265,0.00015484991,0.000010056476,0.000016946618,0.0000661852,0.000024070709,0.9697806,0.0038576068,0.022817088,0.0032196012,0.000013778489],"about_ca_topic_score_codex":0.005392738,"about_ca_topic_score_gemma":0.0068359356,"teacher_disagreement_score":0.005392738,"about_ca_system_score_codex":0.00090712914,"about_ca_system_score_gemma":0.0012083546,"threshold_uncertainty_score":0.013123512},"labels":[],"label_agreement":null},{"id":"W2143973853","doi":"10.1007/978-3-319-03841-4_33","title":"Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Combinatorics; Planar graph; Embedding; Vertex (graph theory); Book embedding; Vertex cover; Planar; Approximation algorithm; Time complexity; Planar straight-line graph; Discrete mathematics; Mathematics; Graph; Computer science; 1-planar graph; Chordal graph","score_opus":0.01653059770991138,"score_gpt":0.2465548600993402,"score_spread":0.2300242623894288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143973853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33272687,0.001871796,0.5908747,0.0012068407,0.0002877023,0.00012066181,0.0021816383,0.0012210027,0.0695088],"genre_scores_gemma":[0.63489276,0.002283363,0.3126952,0.0001720089,0.00021299587,0.00024398204,0.0029760906,0.0010954128,0.04542827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963784,0.00007387143,0.00002017307,0.00008717614,0.00013937059,0.00004150844],"domain_scores_gemma":[0.9987563,0.000539838,0.00022620933,0.0002267664,0.00013811307,0.00011276234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022337782,0.0013309936,0.00078045524,0.0008325775,0.0005296857,0.0010907119,0.0021575564,0.0012281412,0.007935103],"category_scores_gemma":[0.002766888,0.0009469715,0.0005105155,0.0011818751,0.0007099007,0.003075238,0.0022646226,0.002232114,0.001894228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085092575,0.00021028853,0.00094933773,0.0012150753,0.000092646726,0.00044171023,0.00068384566,0.30052015,0.043169532,0.40790644,0.01926596,0.22469413],"study_design_scores_gemma":[0.00011068361,0.0002652927,0.0009134124,0.00014692634,0.000057186582,0.00033071986,0.00025585596,0.33405524,0.011586443,0.6351494,0.017066868,0.000061862105],"about_ca_topic_score_codex":0.00080630335,"about_ca_topic_score_gemma":0.0013497518,"teacher_disagreement_score":0.007935103,"about_ca_system_score_codex":0.0007264505,"about_ca_system_score_gemma":0.0003228893,"threshold_uncertainty_score":0.026545584},"labels":[],"label_agreement":null},{"id":"W2144029070","doi":"10.1007/978-3-642-27576-0_26","title":"Mercury: Recovering Forgotten Passwords Using Personal Devices","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Carleton University; University of Toronto","funders":"","keywords":"Password; Computer science; Computer security; Password strength; Android (operating system); Password cracking; Encryption; Cognitive password; S/KEY; One-time password; Internet privacy; Operating system","score_opus":0.03335566789345874,"score_gpt":0.26357788973946805,"score_spread":0.23022222184600932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144029070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04687094,0.0031679715,0.84305364,0.0009076212,0.0009114921,0.00016352949,0.000440827,0.061322104,0.043161817],"genre_scores_gemma":[0.41732538,0.0027624927,0.36988673,0.0006639673,0.00032097046,0.00012213508,0.0013586921,0.004997715,0.20256194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992748,0.00008045908,0.000024658837,0.00007849831,0.00046156658,0.00007997322],"domain_scores_gemma":[0.9994287,0.00014742957,0.000031316908,0.0002652626,0.00009463671,0.000032619566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039084023,0.0010616452,0.00069239916,0.00081115216,0.0007282885,0.0009933548,0.001689048,0.0012884917,0.012179736],"category_scores_gemma":[0.0015300573,0.0005046471,0.0005178003,0.0007025104,0.0010450379,0.0023171392,0.0029775782,0.0014821289,0.0058231996],"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.0006604403,0.000090186855,0.00062130374,0.00040876516,0.00008867854,0.0007729183,0.0007433051,0.004016775,0.053337414,0.022708256,0.067852095,0.84869987],"study_design_scores_gemma":[0.0002707746,0.00082152034,0.002682739,0.00032667103,0.0002467195,0.007378855,0.00061888486,0.12908877,0.43035358,0.09000193,0.33794668,0.00026285928],"about_ca_topic_score_codex":0.0007685397,"about_ca_topic_score_gemma":0.0013438348,"teacher_disagreement_score":0.012179736,"about_ca_system_score_codex":0.00030326383,"about_ca_system_score_gemma":0.00050109497,"threshold_uncertainty_score":0.04074526},"labels":[],"label_agreement":null},{"id":"W2144085981","doi":"10.1007/3-540-44839-x_54","title":"Simulation of Chemical Reaction Fronts in Anaerobic Digestion of Solid Waste","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Guelph","funders":"","keywords":"Numerical integration; Ordinary differential equation; Nonlinear system; Computer science; Numerical analysis; Quadrature (astronomy); Partial differential equation; Applied mathematics; Differential equation; Computational science; Mathematics; Mathematical analysis; Physics","score_opus":0.016913371205055573,"score_gpt":0.2543564485352024,"score_spread":0.23744307733014683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144085981","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.9412319,0.0003310533,0.039591935,0.00046120156,0.00011169475,0.000095834155,0.00044858368,0.00035160244,0.01737614],"genre_scores_gemma":[0.98974985,0.00012921775,0.0063083423,0.00004866153,0.000011703452,0.000045740533,0.0001631871,0.000042236203,0.0035011652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987614,0.000024361208,0.000005975815,0.000018190158,0.000035470504,0.000039833507],"domain_scores_gemma":[0.9991555,0.00061685074,0.00004250587,0.00003317889,0.000075925505,0.00007604261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003411129,0.0007185456,0.0010908745,0.00051469554,0.00082802825,0.0010963937,0.0011712121,0.002090943,0.0031331733],"category_scores_gemma":[0.0014178602,0.00070361595,0.00094569515,0.0005185889,0.00079636334,0.0006462261,0.000707549,0.0010069271,0.00025698708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107593114,0.00005415428,0.0004978048,0.000020524207,0.000007952876,0.00004532533,0.00002698569,0.9956092,0.0015937638,0.00087033195,0.000087901906,0.001078462],"study_design_scores_gemma":[0.000011956734,0.000011672586,0.000072364186,0.0000010369774,0.0000014257529,0.0000030411366,0.0000063692664,0.99912614,0.0005275496,0.00019266941,0.0000436224,0.0000021707779],"about_ca_topic_score_codex":0.028672336,"about_ca_topic_score_gemma":0.009781773,"teacher_disagreement_score":0.028672336,"about_ca_system_score_codex":0.0013712315,"about_ca_system_score_gemma":0.0010787509,"threshold_uncertainty_score":0.05701089},"labels":[],"label_agreement":null},{"id":"W2144697110","doi":"10.1007/978-3-642-15369-3_41","title":"Periodicity in Streams","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Simon Fraser University","funders":"","keywords":"Computer science; STREAMS; Operating system","score_opus":0.01191302391728481,"score_gpt":0.23794899230911204,"score_spread":0.22603596839182724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144697110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08925427,0.0101119215,0.75802654,0.0015202747,0.0017261473,0.00011783122,0.0006720095,0.0014094261,0.1371616],"genre_scores_gemma":[0.79790944,0.006445388,0.11649681,0.00047219679,0.0024680884,0.00025312082,0.0013092684,0.00072840176,0.07391721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941754,0.00012434534,0.000049694445,0.00013013606,0.00022097913,0.000057308574],"domain_scores_gemma":[0.9986526,0.00065016525,0.00013219754,0.00028303018,0.00018347212,0.00009858277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061470125,0.0004973531,0.00079257495,0.0015524898,0.0007926003,0.0019631146,0.0005469835,0.00060593855,0.0067176674],"category_scores_gemma":[0.004401713,0.00046910215,0.00055013713,0.001672243,0.001099861,0.0024982851,0.0012204342,0.0015047101,0.001665936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081062266,0.000015515625,0.00044753106,0.00010448391,0.000012743855,0.00012407711,0.00020173017,0.0029903657,0.0019916834,0.9375111,0.00562828,0.050891466],"study_design_scores_gemma":[0.000017149498,0.000036076242,0.00040578077,0.00003375058,0.00001643807,0.00038196068,0.00006755683,0.03612478,0.0017614524,0.9437031,0.01743296,0.000019005625],"about_ca_topic_score_codex":0.00033892208,"about_ca_topic_score_gemma":0.00023997613,"teacher_disagreement_score":0.0067176674,"about_ca_system_score_codex":0.0005779711,"about_ca_system_score_gemma":0.00037960216,"threshold_uncertainty_score":0.022472858},"labels":[],"label_agreement":null},{"id":"W2144771597","doi":"10.1007/978-3-642-15711-0_72","title":"Nonlinear Embedding towards Articulated Spine Shape Inference Using Higher-Order MRFs","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":13,"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":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Embedding; Nonlinear dimensionality reduction; Markov random field; Manifold (fluid mechanics); Mathematics; Inference; Representation (politics); Artificial intelligence; Image warping; Pattern recognition (psychology); Algorithm; Computer science; Topology (electrical circuits); Segmentation; Image segmentation; Combinatorics","score_opus":0.014772238219325938,"score_gpt":0.2880158342036172,"score_spread":0.27324359598429127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144771597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057232557,0.00008797294,0.99349123,0.00007494523,0.000016685488,0.000009733822,0.000039374936,0.00030880774,0.00024800719],"genre_scores_gemma":[0.37480214,0.0005129581,0.6177024,0.00019074352,0.00014484455,0.000105062274,0.0005624686,0.00041802207,0.005561307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995042,0.00014992732,0.00002928585,0.00013262154,0.00013840287,0.00004543085],"domain_scores_gemma":[0.9977864,0.0012907025,0.00021084792,0.00038079376,0.00026256894,0.00006869663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010653995,0.0010860773,0.0012360688,0.0009480895,0.0003883368,0.0010687603,0.0014028123,0.002015839,0.002244041],"category_scores_gemma":[0.005387191,0.0011125332,0.0013465598,0.00083358254,0.0009102065,0.0018052085,0.0015708184,0.002412709,0.0012164175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021533493,0.000072002054,0.0007969054,0.00016690319,0.00008473841,0.00014514552,0.0001277813,0.7125137,0.015044097,0.011244123,0.0019577295,0.2576316],"study_design_scores_gemma":[0.0000026102593,0.000009946295,0.000067991525,0.0000041992735,0.000003702204,0.000020164553,0.0000042657935,0.99594194,0.0008302768,0.0028838888,0.00022687716,0.000004068403],"about_ca_topic_score_codex":0.004610255,"about_ca_topic_score_gemma":0.006611937,"teacher_disagreement_score":0.004610255,"about_ca_system_score_codex":0.00049366406,"about_ca_system_score_gemma":0.00082652067,"threshold_uncertainty_score":0.009166837},"labels":[],"label_agreement":null},{"id":"W2144792489","doi":"10.1007/978-3-642-04893-7_21","title":"Dynamic Epistemic Temporal Logic","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Temporal logic; Epistemic modal logic; Dynamic logic (digital electronics); Artificial intelligence; Programming language; Multimodal logic; Description logic; Electrical engineering","score_opus":0.015262000565845996,"score_gpt":0.24641862588764663,"score_spread":0.23115662532180062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144792489","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031286196,0.00783532,0.32386672,0.004251598,0.00081600953,0.000055957426,0.00044752174,0.00063253153,0.6589657],"genre_scores_gemma":[0.4121601,0.015284567,0.15865141,0.0022456332,0.0014755577,0.0002673943,0.0019998434,0.00070559623,0.40720978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953175,0.00012587023,0.000031012652,0.00011234949,0.00015592009,0.00004310073],"domain_scores_gemma":[0.9995666,0.00019876628,0.000026021886,0.00008279144,0.000095174764,0.000030680752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071532273,0.00077323016,0.0004415645,0.0011063131,0.0011864428,0.0034547006,0.0008964369,0.0010228339,0.01662323],"category_scores_gemma":[0.0016434228,0.00044789317,0.0006598586,0.0012425624,0.0025381579,0.0049207313,0.0012721883,0.0026942294,0.004264232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075812213,0.000006502422,0.000018605704,0.000028906421,0.000002987757,0.000019879544,0.00008815291,0.0004260139,0.00020538902,0.9778657,0.006478002,0.014852247],"study_design_scores_gemma":[0.0000041307667,0.0000035708733,0.000028696726,0.000041143583,0.0000062550403,0.000060851635,0.00003172418,0.0017278265,0.00039301792,0.9163027,0.0813948,0.0000052739874],"about_ca_topic_score_codex":0.001363502,"about_ca_topic_score_gemma":0.0013670849,"teacher_disagreement_score":0.01662323,"about_ca_system_score_codex":0.0021181412,"about_ca_system_score_gemma":0.0010776771,"threshold_uncertainty_score":0.05561024},"labels":[],"label_agreement":null},{"id":"W2145001295","doi":"10.1007/978-3-642-30353-1_10","title":"Preference-Based Planning via MaxSAT","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Formalism (music); Computer science; Encoding (memory); Planner; Algorithm; Artificial intelligence","score_opus":0.04569257288611066,"score_gpt":0.24585186237095552,"score_spread":0.20015928948484485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145001295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033235787,0.00052060955,0.9729503,0.00022074206,0.000047930007,0.000057096393,0.00018065909,0.0005574326,0.022141697],"genre_scores_gemma":[0.24545078,0.0015173536,0.73393995,0.00019472532,0.000094371855,0.00033796922,0.0007585961,0.0003511148,0.017355196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991073,0.0003494337,0.000049107217,0.00015892176,0.0002513744,0.00008378399],"domain_scores_gemma":[0.99948406,0.00032185152,0.000032244217,0.000089598536,0.000045929602,0.000026292828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291194,0.0010209384,0.0011249176,0.0007283266,0.0005664048,0.0017495262,0.0016856029,0.0007802121,0.012813358],"category_scores_gemma":[0.0024615184,0.0009080275,0.0010807888,0.0021949648,0.00083953195,0.002869578,0.001830209,0.0022543513,0.002264319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001931739,0.00010619374,0.0001257226,0.000411393,0.000072354254,0.0000635922,0.000104602004,0.25852308,0.0020358332,0.48717535,0.012407529,0.23878114],"study_design_scores_gemma":[0.000045412606,0.00004328547,0.00006612639,0.00003765222,0.000023398397,0.000048953858,0.000018617968,0.3773231,0.0015884045,0.6127684,0.008018107,0.000018568124],"about_ca_topic_score_codex":0.0012739064,"about_ca_topic_score_gemma":0.0023774959,"teacher_disagreement_score":0.012813358,"about_ca_system_score_codex":0.0010433338,"about_ca_system_score_gemma":0.0010918264,"threshold_uncertainty_score":0.04286498},"labels":[],"label_agreement":null},{"id":"W2145007102","doi":"10.1007/978-3-540-71035-6_6","title":"Adaptive Job Scheduling Via Predictive Job Resource Allocation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Windsor","funders":"","keywords":"Computer science; Scheduling (production processes); Job scheduler; Job queue; Job shop scheduling; Distributed computing; Mathematical optimization; Mathematics; Schedule; Operating system","score_opus":0.024133496735287512,"score_gpt":0.2516241988619923,"score_spread":0.22749070212670477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145007102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03714973,0.0007149965,0.95425385,0.00017466587,0.00029675782,0.00005783984,0.00004387112,0.002053529,0.0052547483],"genre_scores_gemma":[0.86128557,0.00037546997,0.1338248,0.00010286691,0.000198748,0.00010091711,0.00008221813,0.00017238206,0.0038568801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960774,0.00008333353,0.000015183314,0.00007664578,0.00015524495,0.000061901],"domain_scores_gemma":[0.99918956,0.0004251478,0.00006433422,0.00015614658,0.000109247136,0.000055660643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006613652,0.00053250353,0.0007988201,0.0005130938,0.0005700831,0.00085997465,0.0015130615,0.00044532432,0.001979033],"category_scores_gemma":[0.0020120621,0.0004708612,0.00033012126,0.0008111147,0.00058758724,0.000771241,0.00082944456,0.0009769166,0.0005793127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005500013,0.00016591225,0.00048437883,0.00010672453,0.00004984654,0.00007470161,0.000065636246,0.7872536,0.025519345,0.016025674,0.0039776145,0.16572653],"study_design_scores_gemma":[0.0000072648136,0.00001743759,0.00007318544,0.000001619806,0.0000036927083,0.000008790333,0.0000030124093,0.9952603,0.0013193451,0.0030546773,0.00024588636,0.00000480589],"about_ca_topic_score_codex":0.0018549734,"about_ca_topic_score_gemma":0.0020090386,"teacher_disagreement_score":0.001979033,"about_ca_system_score_codex":0.0005425445,"about_ca_system_score_gemma":0.00065776776,"threshold_uncertainty_score":0.0066204667},"labels":[],"label_agreement":null},{"id":"W2145008766","doi":"10.1007/978-3-642-39229-0_43","title":"The Dimensions of Positive and Negative User Experiences with Interactive Products","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Usability; Computer science; Product (mathematics); Perception; Grid; Human–computer interaction; Point (geometry); Measure (data warehouse); Order (exchange); Psychology; Mathematics; Data mining","score_opus":0.010908139982243562,"score_gpt":0.24425911115244373,"score_spread":0.23335097117020015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145008766","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.9224551,0.00054180896,0.002983248,0.0004942091,0.000043008575,0.00003909512,0.000052707517,0.00003423708,0.07335674],"genre_scores_gemma":[0.99850154,0.000115430536,0.0005504397,0.000041991734,0.000008317905,0.0000195292,0.000019795165,0.000007610072,0.00073528424],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9966809,0.0016263167,0.00012645776,0.00013349963,0.0011307899,0.0003021002],"domain_scores_gemma":[0.98987514,0.0063395086,0.0013842621,0.00034776342,0.000942892,0.0011104405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021386987,0.0003474253,0.00019954982,0.0011451091,0.0011275134,0.00428174,0.00043342737,0.0007449559,0.0025962451],"category_scores_gemma":[0.010268205,0.00031185852,0.00033387504,0.00059326156,0.0032486906,0.0025339902,0.0026870295,0.0013576975,0.00018589084],"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.0020896944,0.0006805652,0.22817507,0.0009990889,0.00027519115,0.0015248435,0.4657535,0.0010968068,0.036873903,0.07315942,0.003962483,0.18540946],"study_design_scores_gemma":[0.00009381004,0.00092373055,0.6039621,0.00049051753,0.00015438734,0.002940844,0.33699313,0.0026988501,0.004493593,0.02804031,0.018980926,0.0002277785],"about_ca_topic_score_codex":0.0007055905,"about_ca_topic_score_gemma":0.0015153035,"teacher_disagreement_score":0.00428174,"about_ca_system_score_codex":0.0007531414,"about_ca_system_score_gemma":0.00053110503,"threshold_uncertainty_score":0.011310697},"labels":[],"label_agreement":null},{"id":"W2145061105","doi":"10.1007/978-3-642-20036-6_5","title":"Hapsembler: An Assembler for Highly Polymorphic Genomes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Sequence assembly; Shotgun sequencing; Biology; 1000 Genomes Project; Haplotype; Computational biology; Computer science; Genetics; Gene; Single-nucleotide polymorphism","score_opus":0.025698497038947284,"score_gpt":0.24545573366767684,"score_spread":0.21975723662872956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145061105","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005530193,0.0020858604,0.79755217,0.00022969463,0.00070952356,0.00029503112,0.017435346,0.16535164,0.010810542],"genre_scores_gemma":[0.015733842,0.0019245673,0.87970674,0.0003855376,0.00016603999,0.0007964023,0.052865658,0.033947725,0.014473525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953413,0.00009185387,0.000041347765,0.00011916909,0.00017585147,0.000037633137],"domain_scores_gemma":[0.9994742,0.00025016308,0.00004362058,0.0000973726,0.00009186272,0.000042834934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090603164,0.0027480717,0.0015230051,0.0018101411,0.0008581717,0.0012513966,0.0024040637,0.0010653782,0.020725986],"category_scores_gemma":[0.0016930116,0.0019339572,0.0013955362,0.0018254693,0.00039937906,0.0014951036,0.001359452,0.0031333044,0.027409693],"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.00054240733,0.00018839353,0.00061000255,0.0030051304,0.00028871902,0.00049596553,0.0004928063,0.006617719,0.10351457,0.014605261,0.405021,0.46461803],"study_design_scores_gemma":[0.00024375047,0.00024081217,0.0016167565,0.0004469584,0.00021899093,0.0021914209,0.00014627729,0.043709666,0.14066204,0.06610037,0.7441675,0.00025546463],"about_ca_topic_score_codex":0.0004535695,"about_ca_topic_score_gemma":0.00072875986,"teacher_disagreement_score":0.020725986,"about_ca_system_score_codex":0.0002820911,"about_ca_system_score_gemma":0.00047649682,"threshold_uncertainty_score":0.06933534},"labels":[],"label_agreement":null},{"id":"W2145148249","doi":"10.1007/978-3-540-71703-4_35","title":"CST-Trees: Cache Sensitive T-Trees","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prompt (Canada)","funders":"","keywords":"Cache; Computer science; Cache coloring; Cache invalidation; Cache algorithms; Cache pollution; Parallel computing; Smart Cache; Page cache; Cache-oblivious algorithm; CPU cache","score_opus":0.02087411720460818,"score_gpt":0.25713916011291765,"score_spread":0.23626504290830946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145148249","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.011265721,0.003966871,0.8988129,0.00060683663,0.0008919954,0.00031293626,0.0057153595,0.034006648,0.044420794],"genre_scores_gemma":[0.23479822,0.006898074,0.65583724,0.0012362747,0.0006558587,0.0007218679,0.020088952,0.009633008,0.07013057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994999,0.0000624438,0.000041755044,0.00006973202,0.00026400798,0.00006220481],"domain_scores_gemma":[0.9989267,0.00027401443,0.00007089681,0.0003262015,0.0002946797,0.000107465356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042795687,0.00072567654,0.0007221685,0.0010007008,0.0006232306,0.001681663,0.0019867641,0.0010824683,0.021372218],"category_scores_gemma":[0.0028807153,0.0005949031,0.0004831465,0.0034737182,0.0004948362,0.0024027033,0.0012036115,0.0014413072,0.009856029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048102695,0.00013213295,0.00039350742,0.0009715552,0.00006116356,0.0002040643,0.00016092046,0.029142864,0.018863518,0.14089777,0.25654656,0.5521449],"study_design_scores_gemma":[0.00025246685,0.00021226202,0.00044099524,0.00025861742,0.00010089832,0.0010439382,0.0000841738,0.15361708,0.03211212,0.29565188,0.51613855,0.00008704285],"about_ca_topic_score_codex":0.00094030175,"about_ca_topic_score_gemma":0.0014442586,"teacher_disagreement_score":0.021372218,"about_ca_system_score_codex":0.00053779024,"about_ca_system_score_gemma":0.0008958704,"threshold_uncertainty_score":0.0714972},"labels":[],"label_agreement":null},{"id":"W2145173052","doi":"10.1007/978-3-540-24840-8_11","title":"On Customizing Evolutionary Learning of Agent Behavior","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fitness function; Computer science; Fitness approximation; Artificial intelligence; Evolutionary algorithm; Function (biology); Representation (politics); Machine learning; Encoding (memory); Feature (linguistics); Genetic algorithm","score_opus":0.01602664295265665,"score_gpt":0.2507713468589779,"score_spread":0.23474470390632124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145173052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01808317,0.0001728695,0.9738139,0.00020385155,0.00006112468,0.000044060856,0.0000143456,0.00053608,0.007070495],"genre_scores_gemma":[0.570487,0.0005466309,0.4158772,0.00037667653,0.000104837876,0.00020635368,0.0001263435,0.0005455861,0.011729423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940836,0.00019368787,0.00003774971,0.000118206095,0.00018324293,0.000058696394],"domain_scores_gemma":[0.9959169,0.0028275813,0.00013284457,0.0008270132,0.00022281718,0.00007282892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017553103,0.0006284087,0.00079878396,0.00042574413,0.0003747324,0.0007783044,0.0017094389,0.0012586442,0.0040012756],"category_scores_gemma":[0.009037849,0.00044009625,0.0005606474,0.00068040553,0.0014646874,0.0021376812,0.00218332,0.0017938337,0.00040870334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006731727,0.00010670115,0.0009947458,0.00007533283,0.00005261778,0.00007603815,0.00016286407,0.7102152,0.0036891077,0.09576006,0.0016099089,0.18719016],"study_design_scores_gemma":[0.00001090199,0.000023691244,0.0001743467,0.000008501336,0.000009071901,0.00003065471,0.000012169777,0.9439231,0.0009104139,0.053838987,0.0010512782,0.000006756082],"about_ca_topic_score_codex":0.0018434831,"about_ca_topic_score_gemma":0.0018850727,"teacher_disagreement_score":0.0040012756,"about_ca_system_score_codex":0.00066653744,"about_ca_system_score_gemma":0.00045026213,"threshold_uncertainty_score":0.0133856535},"labels":[],"label_agreement":null},{"id":"W2145350315","doi":"10.1007/978-3-642-37119-6_2","title":"Proofs of Retrievability via Fountain Code","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","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 Calgary","funders":"","keywords":"Retrievability; Mathematical proof; Security parameter; Computer science; Fountain code; Theoretical computer science; Protocol (science); Scheme (mathematics); Gas meter prover; Chaining; Overhead (engineering); Set (abstract data type); Mathematics; Algorithm; Cryptography; Block code; Linear code; Programming language; Decoding methods","score_opus":0.01837433778645371,"score_gpt":0.25439297149301476,"score_spread":0.23601863370656107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145350315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049577363,0.0032546574,0.8096066,0.007002932,0.0010990467,0.00018063323,0.0009264103,0.010034061,0.11831822],"genre_scores_gemma":[0.82562464,0.0027113687,0.14021143,0.0019571122,0.0013502316,0.00041138325,0.0010463595,0.0039658444,0.022721669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99104285,0.002434541,0.00050513033,0.0009857109,0.003889909,0.0011417785],"domain_scores_gemma":[0.9520907,0.032636505,0.0012617499,0.009952658,0.003546887,0.00051152235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041203373,0.0017343648,0.0015799053,0.0023528712,0.002946401,0.0049335826,0.003598132,0.0030693277,0.012206315],"category_scores_gemma":[0.034238853,0.001808573,0.0027547039,0.0027548138,0.0075502703,0.012863862,0.0058580386,0.009137654,0.00394185],"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.00023502173,0.00008242143,0.0003131166,0.0006407291,0.00007419942,0.00029833574,0.00067982776,0.0065173707,0.0027488878,0.9200268,0.016814388,0.05156882],"study_design_scores_gemma":[0.000060483704,0.000030096367,0.00013284943,0.00013471108,0.000054397166,0.00018576732,0.000033427194,0.012113683,0.0051407157,0.97209567,0.0099692345,0.00004892321],"about_ca_topic_score_codex":0.0014271098,"about_ca_topic_score_gemma":0.0010006793,"teacher_disagreement_score":0.012206315,"about_ca_system_score_codex":0.0020950942,"about_ca_system_score_gemma":0.0025309958,"threshold_uncertainty_score":0.04083419},"labels":[],"label_agreement":null},{"id":"W2145440955","doi":"10.1007/978-3-540-39701-4_19","title":"Rigid Registration of Echoplanar and Conventional Magnetic Resonance Images by Minimizing the Kullback-Leibler Distance","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Center for Research Resources; National Cancer Institute","keywords":"Magnetic resonance imaging; Kullback–Leibler divergence; Computer science; Mutual information; Functional magnetic resonance imaging; Artificial intelligence; Entropy (arrow of time); Computer vision; Nuclear magnetic resonance; Physics; Medicine; Radiology","score_opus":0.01017162605989944,"score_gpt":0.2747459883835297,"score_spread":0.26457436232363024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145440955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01138097,0.00019416436,0.98705345,0.00008759563,0.000044596174,0.000041358708,0.00007081727,0.0005301513,0.00059680466],"genre_scores_gemma":[0.19316436,0.00074189063,0.79872054,0.00013809314,0.00008936427,0.00020905261,0.00071576796,0.0009909522,0.00522999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832684,0.0004240174,0.00012360085,0.00047144885,0.00055652246,0.00009760415],"domain_scores_gemma":[0.9984225,0.00046949933,0.00033657267,0.0003628259,0.00034975115,0.0000587305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020486377,0.0010866962,0.0012042377,0.0019308471,0.0006506509,0.0024986607,0.0014698502,0.0011435237,0.0015062023],"category_scores_gemma":[0.0064984085,0.00071007904,0.0010121246,0.0019607795,0.0010615744,0.0018625533,0.0019438982,0.0014032371,0.001869301],"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.00063340156,0.00019487149,0.0023323875,0.0005249246,0.0003620415,0.0003204931,0.00039106823,0.15222253,0.13294783,0.036395434,0.007825711,0.6658494],"study_design_scores_gemma":[0.00006226117,0.00041283394,0.005253858,0.000067354544,0.00018833925,0.0012325755,0.00024564442,0.8408367,0.098025456,0.038390476,0.015105412,0.0001791733],"about_ca_topic_score_codex":0.0025081998,"about_ca_topic_score_gemma":0.0047489326,"teacher_disagreement_score":0.0025081998,"about_ca_system_score_codex":0.000566604,"about_ca_system_score_gemma":0.0019232349,"threshold_uncertainty_score":0.010834396},"labels":[],"label_agreement":null},{"id":"W2145570103","doi":"10.1007/11958239_15","title":"Discrete Logarithm Variants of VSH","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Bell (Canada)","funders":"","keywords":"Hash function; Modular exponentiation; Computer science; Discrete logarithm; Logarithm; Exponentiation; Reduction (mathematics); Modular design; Algorithm; Arithmetic; Mathematics; Public-key cryptography; Computer network; Computer security; Mathematical analysis; Programming language","score_opus":0.014664099660678966,"score_gpt":0.26036152858252837,"score_spread":0.2456974289218494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145570103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053360347,0.006057366,0.64933276,0.0055813715,0.0032381213,0.00021987346,0.0010369322,0.0020911088,0.27908206],"genre_scores_gemma":[0.7792073,0.003203901,0.11236927,0.001379621,0.0022868998,0.00021593182,0.000984051,0.0006563889,0.099696666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769175,0.00067376334,0.00013037752,0.00033741782,0.00091623596,0.0002504138],"domain_scores_gemma":[0.99801576,0.0006711977,0.000092681345,0.000891207,0.00025351698,0.00007557746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015074938,0.0006207435,0.0009595078,0.000928319,0.0010221505,0.003651005,0.0015811109,0.00077454874,0.012225015],"category_scores_gemma":[0.004667931,0.0003546074,0.00072129606,0.0022977982,0.0021453847,0.0053947824,0.0028297096,0.0035405348,0.0040451833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011589257,0.000032116288,0.00010389049,0.000059462982,0.000011996735,0.000041304767,0.00009360641,0.0020382404,0.00079932716,0.9350097,0.008713739,0.052980743],"study_design_scores_gemma":[0.000038280843,0.00004555597,0.00012648573,0.000026531743,0.000014134334,0.00020757876,0.000042603995,0.010957426,0.001687902,0.9534643,0.03336741,0.000021651957],"about_ca_topic_score_codex":0.00038072403,"about_ca_topic_score_gemma":0.0004051468,"teacher_disagreement_score":0.012225015,"about_ca_system_score_codex":0.0013518262,"about_ca_system_score_gemma":0.0009879933,"threshold_uncertainty_score":0.040896714},"labels":[],"label_agreement":null},{"id":"W2145651273","doi":"10.1007/978-3-540-87781-3_2","title":"A Unifying Framework for Building Social Computing Applications","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Computer science; Novelty; Social computing; Reputation; Data science; Social network (sociolinguistics); Focus (optics); Selection (genetic algorithm); Knowledge management; World Wide Web; Artificial intelligence; Social media","score_opus":0.02443119515785624,"score_gpt":0.3071611910079315,"score_spread":0.28272999585007524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145651273","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.0025364012,0.00014112561,0.9900305,0.0003637248,0.00005916642,0.0001872937,0.00017716925,0.0023367181,0.0041678217],"genre_scores_gemma":[0.059816297,0.00036838415,0.93046683,0.0001543628,0.00010092937,0.0005805279,0.0006048715,0.0006675087,0.007240396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798393,0.0006096065,0.0001916358,0.00037193456,0.0006452442,0.00019759606],"domain_scores_gemma":[0.99832946,0.0005331071,0.000067863824,0.0006757621,0.00023848232,0.00015532302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002917235,0.00097325206,0.0011044834,0.0019765743,0.0025704352,0.0045174714,0.0030874088,0.0017971301,0.008138531],"category_scores_gemma":[0.005343466,0.001005097,0.0023390772,0.0024158543,0.0021200115,0.008193167,0.005933569,0.0028109923,0.0032572683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003747539,0.00009698857,0.0005533723,0.00014083157,0.000059602447,0.00013246933,0.00052067376,0.017755097,0.0019647125,0.86019284,0.011353819,0.10719214],"study_design_scores_gemma":[0.000020700974,0.000038142956,0.00016114765,0.00005233988,0.000060283128,0.000107772554,0.0001521764,0.24873339,0.0021375325,0.67255896,0.07594911,0.000028462999],"about_ca_topic_score_codex":0.004376087,"about_ca_topic_score_gemma":0.007460788,"teacher_disagreement_score":0.008138531,"about_ca_system_score_codex":0.0011417989,"about_ca_system_score_gemma":0.0018157501,"threshold_uncertainty_score":0.02722609},"labels":[],"label_agreement":null},{"id":"W2145838433","doi":"10.1007/11496656_2","title":"On the Longest Common Rigid Subsequence Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest common subsequence problem; Substring; Subsequence; Time complexity; Longest increasing subsequence; Combinatorics; Computer science; Similarity (geometry); Algorithm; Mathematics; Artificial intelligence; Data structure","score_opus":0.018614437664633728,"score_gpt":0.24358034591822328,"score_spread":0.22496590825358956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145838433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025739027,0.004912957,0.9183976,0.0041020312,0.0010837865,0.00013745305,0.00077908335,0.00077490637,0.044073187],"genre_scores_gemma":[0.2819195,0.0122173205,0.6382513,0.0016785628,0.004483627,0.0005209843,0.007203334,0.001254988,0.05247028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979925,0.00051947497,0.00016167191,0.0005069262,0.00060347223,0.00021601393],"domain_scores_gemma":[0.99448085,0.0035263167,0.00031042643,0.0010206923,0.0005056556,0.00015613539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022024016,0.0013133154,0.002417053,0.0023301945,0.001971631,0.0027112658,0.0031433946,0.0027433266,0.012940436],"category_scores_gemma":[0.012426652,0.0008083878,0.001448378,0.006879834,0.0026523354,0.010053194,0.0040601934,0.003983725,0.003705078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003077371,0.00016567389,0.000487196,0.0005288808,0.00009606921,0.00034989693,0.0002744117,0.064386375,0.0022646901,0.6246374,0.041076288,0.26542538],"study_design_scores_gemma":[0.000033979424,0.00003953277,0.0001492882,0.000048832335,0.000020248057,0.00018739514,0.00008353324,0.08086205,0.00087208935,0.9064388,0.011243194,0.000021026915],"about_ca_topic_score_codex":0.0017481003,"about_ca_topic_score_gemma":0.0011809837,"teacher_disagreement_score":0.012940436,"about_ca_system_score_codex":0.0010283142,"about_ca_system_score_gemma":0.0014463753,"threshold_uncertainty_score":0.04329008},"labels":[],"label_agreement":null},{"id":"W2145846051","doi":"10.1007/978-3-642-33415-3_81","title":"A Fast Convex Optimization Approach to Segmenting 3D Scar Tissue from Delayed-Enhancement Cardiac MR Images","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Robarts Clinical Trials","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Segmentation; Solver; Regular polygon; Relaxation (psychology); Algorithm; Artificial intelligence; Operator (biology); Pattern recognition (psychology); Mathematical optimization; Mathematics; Medicine","score_opus":0.012357015133411586,"score_gpt":0.271404154268908,"score_spread":0.25904713913549643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145846051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014529979,0.00011007177,0.99778146,0.00006272442,0.000014966555,0.000029664965,0.000037376067,0.00029393536,0.00021693969],"genre_scores_gemma":[0.03880253,0.00034713335,0.95711833,0.0000893844,0.00007345747,0.00018742376,0.0003583087,0.00042668803,0.0025968424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992669,0.00015432523,0.000049471113,0.00014856266,0.00031259877,0.000068227826],"domain_scores_gemma":[0.99848527,0.0008932383,0.00008630832,0.00011797207,0.00034580333,0.00007150701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014591543,0.0017010438,0.0022623376,0.0012637248,0.0006780693,0.001774235,0.0029595036,0.0021679623,0.003198151],"category_scores_gemma":[0.0028363573,0.0019695773,0.00198435,0.0013056446,0.00083683635,0.0011347061,0.0018604022,0.0023668353,0.0014554766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020361984,0.00013320734,0.00028192854,0.0002424282,0.00012225004,0.00022157935,0.00011746294,0.64455307,0.021734167,0.0076693846,0.0046565393,0.3200644],"study_design_scores_gemma":[0.0000050286612,0.000015271684,0.000055023724,0.0000035367389,0.0000058203404,0.00003152072,0.0000056814365,0.9969223,0.0012717317,0.0011796907,0.0004983335,0.000006030763],"about_ca_topic_score_codex":0.011824599,"about_ca_topic_score_gemma":0.013454402,"teacher_disagreement_score":0.011824599,"about_ca_system_score_codex":0.0009611144,"about_ca_system_score_gemma":0.0016169009,"threshold_uncertainty_score":0.023511589},"labels":[],"label_agreement":null},{"id":"W2145855952","doi":"10.1007/978-3-540-24693-0_31","title":"Call Admission Control for Voice/Data Integration in Broadband Wireless Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Handover; Call Admission Control; Quality of service; Wireless broadband; Bandwidth (computing); Wireless; Broadband; Wireless network; Broadband networks; Bandwidth allocation; Real-time computing; Telecommunications","score_opus":0.03491081284959967,"score_gpt":0.3010319449645259,"score_spread":0.2661211321149262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145855952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036418833,0.0032856066,0.93192303,0.00061844295,0.0006622432,0.00010390126,0.000042103955,0.0029559182,0.023989884],"genre_scores_gemma":[0.9122224,0.0011010427,0.0632204,0.00028383016,0.0007392352,0.000109389024,0.0000681462,0.00017971262,0.022075897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992933,0.00013070405,0.000031136762,0.00008747433,0.00031978966,0.00013766947],"domain_scores_gemma":[0.999228,0.00044735734,0.00004553839,0.00006499966,0.00016956894,0.000044478744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064220856,0.00059560087,0.00059910055,0.0004886241,0.0009974968,0.0017946424,0.0011619793,0.0007589477,0.005590002],"category_scores_gemma":[0.0023945428,0.00027584317,0.00021048432,0.00041467173,0.0006837835,0.0008706466,0.0007448345,0.0016674362,0.00083909126],"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.0006817228,0.00032326617,0.0007945305,0.00018132862,0.000053049935,0.00029924905,0.00042920318,0.091916285,0.09403779,0.08834962,0.016172083,0.70676184],"study_design_scores_gemma":[0.000048215457,0.00017020953,0.00077334995,0.000043446973,0.00006989897,0.00027678316,0.00007741797,0.9320864,0.023330798,0.028340857,0.014725358,0.00005735838],"about_ca_topic_score_codex":0.0022164613,"about_ca_topic_score_gemma":0.0030443103,"teacher_disagreement_score":0.005590002,"about_ca_system_score_codex":0.0009174468,"about_ca_system_score_gemma":0.000519837,"threshold_uncertainty_score":0.018700361},"labels":[],"label_agreement":null},{"id":"W2146149474","doi":"10.1007/11566489_106","title":"Spectral Clustering Algorithms for Ultrasound Image Segmentation","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Center for Research Resources; U.S. National Library of Medicine; National Institute of Mental Health","keywords":"Segmentation-based object categorization; Artificial intelligence; Image segmentation; Scale-space segmentation; Computer science; Segmentation; Pattern recognition (psychology); Cluster analysis; Spectral clustering; Computer vision; Minimum spanning tree-based segmentation; Region growing","score_opus":0.017301420795834768,"score_gpt":0.30902466448877397,"score_spread":0.2917232436929392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146149474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026513508,0.0004902656,0.9956449,0.0000668985,0.00002893813,0.000021751785,0.000030766754,0.0004792369,0.000585936],"genre_scores_gemma":[0.06445997,0.00095014507,0.93027747,0.00006707025,0.000083398736,0.00012660616,0.00029724246,0.00042664417,0.0033114841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990951,0.0002637121,0.000054514716,0.0001532421,0.00037653846,0.00005698043],"domain_scores_gemma":[0.9984263,0.0005820112,0.00011589458,0.00025330877,0.0005776147,0.000044798937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000995148,0.0008154289,0.0012466308,0.0026224535,0.0009939413,0.0012205952,0.001531159,0.0012652309,0.0031016439],"category_scores_gemma":[0.0037834786,0.0006988465,0.0011022236,0.0033825084,0.00077398354,0.0013910639,0.0010790172,0.0012606004,0.0026125556],"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.00022198101,0.0001095648,0.0004847406,0.00026835303,0.00012865545,0.00006104134,0.00018275129,0.17535289,0.033078868,0.028055772,0.006945476,0.7551099],"study_design_scores_gemma":[0.000013682201,0.000030727846,0.0007368093,0.000026934209,0.000034601464,0.00012556673,0.000051358802,0.9534949,0.009298579,0.030320436,0.0058341217,0.000032214604],"about_ca_topic_score_codex":0.0049946625,"about_ca_topic_score_gemma":0.0052963626,"teacher_disagreement_score":0.0049946625,"about_ca_system_score_codex":0.00078733836,"about_ca_system_score_gemma":0.0010308945,"threshold_uncertainty_score":0.010376036},"labels":[],"label_agreement":null},{"id":"W2146578043","doi":"10.1007/978-3-642-39310-5_1","title":"Blum Static Complexity and Encoding Spaces","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI 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 Prince Edward Island","funders":"","keywords":"Axiom; Computer science; Connection (principal bundle); Descriptive complexity theory; Theoretical computer science; Computational complexity theory; Discrete mathematics; Algorithm; Mathematics","score_opus":0.035875674263548485,"score_gpt":0.2571888878426765,"score_spread":0.22131321357912803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146578043","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.0653935,0.015817806,0.39735442,0.024183724,0.0007066658,0.00007525084,0.0011096991,0.00069780846,0.49466112],"genre_scores_gemma":[0.85622424,0.009494033,0.05358926,0.0018338626,0.0016898937,0.00026595063,0.0013086817,0.0004981527,0.07509591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981134,0.00064532546,0.00009805981,0.00027624518,0.00064524973,0.00022177945],"domain_scores_gemma":[0.99398017,0.004337222,0.0002652798,0.00089877343,0.00039082736,0.00012782542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016452256,0.00075122225,0.00086578424,0.002349991,0.0018560711,0.0047586155,0.0015373813,0.0020518007,0.017439803],"category_scores_gemma":[0.011153129,0.0006796573,0.00096333394,0.004845798,0.005185084,0.015216577,0.002472576,0.005470175,0.0022037232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073117794,0.0000055391,0.000053801123,0.0000220792,0.0000023579887,0.000009116778,0.000060432623,0.00096470455,0.000051430496,0.99016035,0.0020717576,0.006591135],"study_design_scores_gemma":[0.0000011335254,0.0000012008675,0.000029627077,0.000008542425,0.0000018617624,0.00001292657,0.000013556906,0.0011313794,0.00006186932,0.99645007,0.0022853513,0.0000024496924],"about_ca_topic_score_codex":0.0015171133,"about_ca_topic_score_gemma":0.0012017671,"teacher_disagreement_score":0.017439803,"about_ca_system_score_codex":0.0045424425,"about_ca_system_score_gemma":0.001264366,"threshold_uncertainty_score":0.05834198},"labels":[],"label_agreement":null},{"id":"W2146625634","doi":"10.1007/978-3-540-24698-5_59","title":"On the Competitiveness of AIMD-TCP within a General Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"York University","funders":"","keywords":"Bottleneck; Computer science; Multiplicative function; Scheduling (production processes); Distributed computing; Mathematical optimization; Mathematics","score_opus":0.019571879034526476,"score_gpt":0.24416942167640399,"score_spread":0.2245975426418775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146625634","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.5217091,0.008925768,0.18671167,0.01795994,0.0009894101,0.0003525721,0.0015515948,0.0019319166,0.25986812],"genre_scores_gemma":[0.9595906,0.002140601,0.026822455,0.0007249848,0.00069442,0.0001892997,0.00052946334,0.00077301805,0.008535042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99373335,0.0023816412,0.00014983516,0.00077267905,0.0011930661,0.0017694348],"domain_scores_gemma":[0.93864053,0.048797984,0.0017360469,0.0040019215,0.0031949524,0.0036286092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009805538,0.0015554345,0.0036464026,0.002476862,0.0034112954,0.0075814375,0.004810444,0.003238068,0.019478546],"category_scores_gemma":[0.051844954,0.0009055915,0.001546982,0.0031262834,0.0051201642,0.01218823,0.0059696897,0.0061182505,0.0018201502],"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.0032795386,0.00040876825,0.0041675176,0.0006580988,0.00019377467,0.00028601932,0.0005662537,0.30735433,0.005991944,0.59267837,0.031121153,0.05329427],"study_design_scores_gemma":[0.00021846818,0.00035173888,0.001463888,0.00011584249,0.0001594021,0.0002686259,0.00042780317,0.6682829,0.0025247864,0.31996813,0.006157285,0.000061114835],"about_ca_topic_score_codex":0.0054185134,"about_ca_topic_score_gemma":0.0051508658,"teacher_disagreement_score":0.019478546,"about_ca_system_score_codex":0.0047338274,"about_ca_system_score_gemma":0.005147038,"threshold_uncertainty_score":0.0651623},"labels":[],"label_agreement":null},{"id":"W2146812507","doi":"10.1007/978-3-540-30500-2_33","title":"Does Hausdorff Dimension Measure Texture Complexity?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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 Saskatchewan","funders":"","keywords":"Computer science; Measure (data warehouse); Hausdorff dimension; Dimension (graph theory); Hausdorff measure; Texture (cosmology); Artificial intelligence; Theoretical computer science; Mathematics; Data mining; Combinatorics; Image (mathematics)","score_opus":0.018253809367721387,"score_gpt":0.22057540271547157,"score_spread":0.20232159334775018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146812507","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.84090614,0.0033838665,0.11202544,0.0043016174,0.0002762868,0.0000366801,0.0008385159,0.00027377353,0.03795768],"genre_scores_gemma":[0.99213225,0.0008779804,0.0034701393,0.00018325288,0.00022339838,0.00001807022,0.00018645548,0.000058337784,0.002850128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995179,0.00008342463,0.000029227045,0.00013850683,0.00014166237,0.000089337314],"domain_scores_gemma":[0.9916426,0.004592382,0.001943269,0.0007026438,0.0006540129,0.00046516256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008364162,0.00037073155,0.00080880546,0.002044135,0.00034318122,0.0036165044,0.0006536458,0.0011754659,0.0054784953],"category_scores_gemma":[0.012881912,0.0004105966,0.0004401766,0.0021658796,0.0024389126,0.007966749,0.000845938,0.0008502136,0.00078965526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054135406,0.0001763927,0.0839323,0.0003507098,0.00036236018,0.0004035875,0.0011366097,0.020126509,0.01220733,0.675307,0.007945644,0.19751021],"study_design_scores_gemma":[0.000040596176,0.00016171692,0.13360123,0.000064592474,0.00009915544,0.0007430774,0.0011012807,0.050702795,0.0037782534,0.80193084,0.0076205214,0.00015595413],"about_ca_topic_score_codex":0.0013714541,"about_ca_topic_score_gemma":0.0009342453,"teacher_disagreement_score":0.0054784953,"about_ca_system_score_codex":0.00084924564,"about_ca_system_score_gemma":0.00022419181,"threshold_uncertainty_score":0.018327415},"labels":[],"label_agreement":null},{"id":"W2146936171","doi":"10.1007/3-540-45468-3_141","title":"Minimally Invasive Excision of Deep Bone Tumors","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bone Tumor Diagnosis and Treatments","field":"Medicine","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Osteoid osteoma; Osteoid; Medicine; Lesion; Osteoma; Surgical excision; Computer science; Radiology; Surgery; Anatomy","score_opus":0.017518121463363054,"score_gpt":0.25771805555718746,"score_spread":0.2401999340938244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146936171","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16258667,0.2178577,0.38996422,0.0022450294,0.0016339225,0.00012767996,0.00044573206,0.0011102223,0.22402883],"genre_scores_gemma":[0.4411293,0.10330959,0.11993568,0.0015289915,0.0016639043,0.00013804015,0.00079064775,0.00035432633,0.33114958],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999372,0.0000043227587,0.0000027970339,0.000006910825,0.000039611135,0.0000093199],"domain_scores_gemma":[0.9999585,0.000022214632,0.000004137402,0.0000053485815,0.0000033787849,0.0000063740495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009700572,0.0003643845,0.00030834277,0.00031909984,0.00016073254,0.0002490565,0.00039699467,0.0002521622,0.0038880506],"category_scores_gemma":[0.00018614942,0.00013637038,0.00028470706,0.00019449445,0.00022088482,0.00036465612,0.00043764676,0.00066914863,0.0009256887],"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.00010272585,0.00006891585,0.00048365624,0.00047702374,0.000027692966,0.0021647615,0.00014709005,0.0017987328,0.09807329,0.0075158565,0.0088355,0.8803049],"study_design_scores_gemma":[0.00004133561,0.0009648977,0.017690795,0.00067789434,0.00012878946,0.17316997,0.00022106724,0.00573129,0.08429709,0.030029984,0.68698204,0.000064871965],"about_ca_topic_score_codex":0.00020272177,"about_ca_topic_score_gemma":0.0010519635,"teacher_disagreement_score":0.0038880506,"about_ca_system_score_codex":0.00010740895,"about_ca_system_score_gemma":0.00014206102,"threshold_uncertainty_score":0.013006806},"labels":[],"label_agreement":null},{"id":"W2147038737","doi":"10.1007/978-3-642-21869-9_27","title":"Modelling and Identifying Collaborative Situations in a Collocated Multi-display Groupware Setting","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Exploit; Classifier (UML); Collaborative software; Collaborative learning; Set (abstract data type); Human–computer interaction; Computer-supported cooperative work; Code (set theory); Artificial intelligence; Machine learning; Multimedia; Work (physics); World Wide Web; Programming language","score_opus":0.07773747553355065,"score_gpt":0.36037846373538873,"score_spread":0.2826409882018381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147038737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4179929,0.00015635906,0.57607263,0.00016228655,0.000015588936,0.00017235341,0.00008748459,0.00038814632,0.004952262],"genre_scores_gemma":[0.89577025,0.000080080805,0.10187575,0.0000132180285,0.00000720043,0.00009778423,0.00010617475,0.000040814226,0.002008689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985524,0.0006795661,0.00006690632,0.0003678813,0.00019342177,0.00013978015],"domain_scores_gemma":[0.9918276,0.006763379,0.00038801998,0.0004944837,0.00024110706,0.00028541606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014651561,0.00079317257,0.000792771,0.00076773856,0.0011083954,0.0033427386,0.002621573,0.0028680353,0.0030690695],"category_scores_gemma":[0.007943591,0.0007846704,0.0010012276,0.0008456982,0.0013598845,0.00447186,0.002756052,0.0014903345,0.00047752712],"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.00077302824,0.0005882185,0.014117364,0.00026056572,0.00013461045,0.0009815306,0.009461833,0.87990403,0.0071604582,0.021129921,0.0007983415,0.06469016],"study_design_scores_gemma":[0.000013865021,0.00007193692,0.00096117763,0.000013137032,0.000016836975,0.00009198828,0.000996356,0.98948205,0.00078892626,0.007171677,0.00037272493,0.000019283116],"about_ca_topic_score_codex":0.012736298,"about_ca_topic_score_gemma":0.0108386185,"teacher_disagreement_score":0.012736298,"about_ca_system_score_codex":0.0008349427,"about_ca_system_score_gemma":0.0009877157,"threshold_uncertainty_score":0.025324285},"labels":[],"label_agreement":null},{"id":"W2147060737","doi":"10.1007/978-3-642-14455-4_25","title":"Schema for Parallel Insertion and Deletion","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Catenation; Computer science; Schema (genetic algorithms); Parallel computing; Regular language; Theoretical computer science; Genetics; Information retrieval; Automaton","score_opus":0.013283973227594005,"score_gpt":0.2348000085035534,"score_spread":0.2215160352759594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147060737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041348115,0.00041162016,0.92193985,0.0009351734,0.0006736283,0.00047542143,0.006182643,0.014856823,0.050390113],"genre_scores_gemma":[0.069847964,0.0014044439,0.83950126,0.0010218354,0.00032458955,0.0010262512,0.018284898,0.0061947466,0.06239413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820876,0.00030573594,0.00031434913,0.00048187652,0.0005289295,0.00016030476],"domain_scores_gemma":[0.9981371,0.0004062319,0.000074599746,0.000868637,0.00044890147,0.00006441838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020455439,0.0010698482,0.0011745817,0.0013111283,0.001405814,0.0039581754,0.0026210407,0.0016647849,0.0359033],"category_scores_gemma":[0.0028470287,0.0014421399,0.0019896529,0.0024531307,0.001689376,0.008990343,0.0029720298,0.0030892764,0.019597515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018919978,0.00010396916,0.0004500599,0.00048927026,0.000040064806,0.0003141211,0.0007940813,0.0017265028,0.005792137,0.7819617,0.05927017,0.14886868],"study_design_scores_gemma":[0.00008386744,0.00005219445,0.00016943789,0.00013924083,0.000083098756,0.0010009739,0.00030479833,0.008417024,0.01458351,0.457711,0.5173906,0.00006416611],"about_ca_topic_score_codex":0.0018357133,"about_ca_topic_score_gemma":0.0016322177,"teacher_disagreement_score":0.0359033,"about_ca_system_score_codex":0.0010397587,"about_ca_system_score_gemma":0.0025739989,"threshold_uncertainty_score":0.120108545},"labels":[],"label_agreement":null},{"id":"W2147121279","doi":"10.1007/11609773_14","title":"A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transitive closure; Computer science; Predicate abstraction; Predicate (mathematical logic); Heap (data structure); Predicate variable; Programming language; Theoretical computer science; Transitive relation; Predicate logic; Model checking; Mathematics; Description logic; Discrete mathematics; Multimodal logic","score_opus":0.04989235046967225,"score_gpt":0.3150562467343075,"score_spread":0.2651638962646352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147121279","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.00338556,0.000075781354,0.9897856,0.00025063776,0.00005631082,0.00018888485,0.00012336217,0.0021420182,0.0039918413],"genre_scores_gemma":[0.12144103,0.00030806282,0.8679292,0.00039332194,0.00017556206,0.00041307442,0.0006540017,0.00082276633,0.007862959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963812,0.00090105576,0.00040664148,0.0007011867,0.00112878,0.00048114132],"domain_scores_gemma":[0.99546707,0.0031662616,0.00018204587,0.00058703515,0.0004236631,0.00017396254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047612535,0.00095521164,0.0012700846,0.0021839454,0.0022228241,0.00537092,0.0033104601,0.002163701,0.00890666],"category_scores_gemma":[0.009719669,0.0014437869,0.003885117,0.0017417968,0.005255699,0.0065516275,0.004423138,0.00512652,0.0024048977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021363416,0.00017521091,0.000331024,0.0002544538,0.00005968703,0.00027680714,0.0006674709,0.0071186638,0.007196367,0.88404757,0.0051734145,0.094485626],"study_design_scores_gemma":[0.00012924454,0.0001086728,0.00025362035,0.00008975657,0.00016031967,0.00023699882,0.0001249817,0.08700964,0.020118339,0.8692275,0.022432083,0.00010883916],"about_ca_topic_score_codex":0.002693489,"about_ca_topic_score_gemma":0.0019682157,"teacher_disagreement_score":0.00890666,"about_ca_system_score_codex":0.0019105315,"about_ca_system_score_gemma":0.0036211675,"threshold_uncertainty_score":0.029795766},"labels":[],"label_agreement":null},{"id":"W2147290904","doi":"10.1007/978-3-319-12214-4_15","title":"Applying Formal Methods into Safety-Critical Health Applications","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Correctness; Stateflow; Formal methods; Formal verification; Construct (python library); Model checking; Life-critical system; Software engineering; Key (lock); Programming language; Software; Computer security","score_opus":0.03300731199408783,"score_gpt":0.36993222658219005,"score_spread":0.3369249145881022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147290904","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.0017230555,0.0016475029,0.98165715,0.00050192093,0.00021104774,0.000078161655,0.000025434563,0.0007487817,0.013407005],"genre_scores_gemma":[0.12769382,0.005972414,0.8402995,0.00043711616,0.00029156503,0.00023426904,0.00015863353,0.0005500277,0.024362661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867344,0.00047221745,0.000102026584,0.00015025254,0.00052192196,0.000080201964],"domain_scores_gemma":[0.9954823,0.0036399493,0.0001227663,0.000452067,0.00024353137,0.00005929218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026740436,0.0010366327,0.00042664728,0.00092186785,0.0004538476,0.0021160739,0.0014210619,0.001243159,0.009839607],"category_scores_gemma":[0.0074731885,0.0007359182,0.0010394433,0.00048199945,0.0026677777,0.002325718,0.002177096,0.0027226422,0.0016866253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053125466,0.00008787289,0.00026530251,0.0010204088,0.00004422101,0.00020180091,0.0010032657,0.032032054,0.011070937,0.6213154,0.0063980916,0.3265075],"study_design_scores_gemma":[0.00004835354,0.000107945714,0.000154876,0.0007970945,0.00004558221,0.00030845773,0.00016561094,0.09406355,0.016271459,0.73984206,0.14815578,0.000039315386],"about_ca_topic_score_codex":0.0007552476,"about_ca_topic_score_gemma":0.0006197489,"teacher_disagreement_score":0.009839607,"about_ca_system_score_codex":0.0008681312,"about_ca_system_score_gemma":0.0013143083,"threshold_uncertainty_score":0.032916725},"labels":[],"label_agreement":null},{"id":"W2147298591","doi":"10.1007/978-3-540-68825-9_34","title":"Seller Bidding in a Trust-Based Incentive Mechanism for Dynamic E-Marketplaces","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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 Waterloo","funders":"","keywords":"Reputation; Bidding; Incentive; Computer science; Forward auction; Order (exchange); Profit (economics); Trustworthiness; Ask price; Mechanism (biology); Business; Microeconomics; Internet privacy; Marketing; Auction theory; Economics","score_opus":0.04150012122368789,"score_gpt":0.32793968851210803,"score_spread":0.2864395672884201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147298591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057916,0.0003027551,0.9250689,0.0009932109,0.00011785457,0.00021236352,0.00008293322,0.00033439085,0.014971616],"genre_scores_gemma":[0.8769695,0.0002776206,0.10603344,0.00009951059,0.00010961543,0.00019829508,0.00006488716,0.00007907856,0.016167985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996653,0.0015938402,0.000248908,0.0004634614,0.00064281974,0.0003980047],"domain_scores_gemma":[0.9943329,0.0033465265,0.00049906154,0.00070688006,0.0006638288,0.00045089182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005269078,0.0007212809,0.0022194225,0.0006938752,0.0014423501,0.004109656,0.0041974797,0.0035511337,0.0082834],"category_scores_gemma":[0.014441458,0.0011263867,0.0014774111,0.0014608254,0.0020433685,0.007856826,0.0034404083,0.002809063,0.0010757389],"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.00074028206,0.000307737,0.0006230261,0.00026367078,0.00008467333,0.00043182983,0.00050520967,0.13479912,0.0035999434,0.8167845,0.003442577,0.0384174],"study_design_scores_gemma":[0.00021184758,0.00016014994,0.00013423679,0.000026577962,0.000043108135,0.00025498949,0.00007432593,0.6731499,0.00085978274,0.32240197,0.0026381358,0.00004498257],"about_ca_topic_score_codex":0.0010833895,"about_ca_topic_score_gemma":0.00083256006,"teacher_disagreement_score":0.0082834,"about_ca_system_score_codex":0.0017020669,"about_ca_system_score_gemma":0.001880668,"threshold_uncertainty_score":0.027865887},"labels":[],"label_agreement":null},{"id":"W2147301117","doi":"10.1007/978-3-540-24852-1_8","title":"S-RIP: A Secure Distance Vector Routing Protocol","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Distance-vector routing protocol; Routing protocol; Dynamic Source Routing; Zone Routing Protocol; Wireless Routing Protocol; Interior gateway protocol; Routing Information Protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Geographic routing; Destination-Sequenced Distance Vector routing; Path vector protocol; Distributed computing; Computer security; Routing (electronic design automation)","score_opus":0.011607321180328083,"score_gpt":0.247982931501988,"score_spread":0.2363756103216599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147301117","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.016657723,0.0018250797,0.9163992,0.00084524177,0.00096757483,0.00046544088,0.0009987527,0.023048598,0.038792565],"genre_scores_gemma":[0.35912606,0.0032958905,0.5617664,0.0012606509,0.00057585764,0.00067368156,0.0041166074,0.0021801381,0.06700473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993155,0.000110271176,0.000057084544,0.00008885382,0.00034493822,0.000083313294],"domain_scores_gemma":[0.99938715,0.00014290908,0.000056707395,0.00024154474,0.000120834986,0.00005086191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599521,0.00070773036,0.0007315002,0.0009076941,0.00070456875,0.0011103521,0.0014633016,0.00076508627,0.007063966],"category_scores_gemma":[0.0013227441,0.00037760966,0.00044054285,0.0009251473,0.00092017854,0.002375219,0.0021527768,0.0016243901,0.0049666897],"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.0010985909,0.00029017654,0.00044834602,0.00076058495,0.00009145836,0.00046046186,0.0002360987,0.038807366,0.052958284,0.20328495,0.12672044,0.5748432],"study_design_scores_gemma":[0.00044677872,0.00088248006,0.00050002075,0.00014008951,0.0001609212,0.0015590914,0.0001398381,0.34617177,0.0812992,0.20107621,0.3674109,0.00021264098],"about_ca_topic_score_codex":0.00035949118,"about_ca_topic_score_gemma":0.0005819738,"teacher_disagreement_score":0.007063966,"about_ca_system_score_codex":0.00041442888,"about_ca_system_score_gemma":0.00081369956,"threshold_uncertainty_score":0.023631275},"labels":[],"label_agreement":null},{"id":"W2147321602","doi":"10.1007/978-3-540-78199-8_1","title":"Visual Recognition of Arabic Handwriting: Challenges and New Directions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Handwriting; Arabic; Computer science; Intelligent character recognition; Natural language processing; Arabic script; Handwriting recognition; Speech recognition; Artificial intelligence; Linguistics; Character recognition; Image (mathematics); Feature extraction","score_opus":0.043749658325244446,"score_gpt":0.2699760798265204,"score_spread":0.22622642150127595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147321602","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024088629,0.41715565,0.48376685,0.015266825,0.0037367984,0.00014948192,0.00084169867,0.005213915,0.049780235],"genre_scores_gemma":[0.1647031,0.27274704,0.4456998,0.0029573943,0.0050633308,0.00019619038,0.0025515934,0.00095698435,0.1051246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953115,0.00005998361,0.00004214522,0.00013041675,0.00018193483,0.000054299675],"domain_scores_gemma":[0.9982066,0.00065948383,0.00007215941,0.00018602767,0.0007259423,0.00014980008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241013,0.0007089704,0.0011152533,0.0011842229,0.00026403385,0.004306553,0.001992688,0.001439657,0.0125859855],"category_scores_gemma":[0.0019016187,0.00052486995,0.00051033986,0.0018551429,0.0009408775,0.004504709,0.00087213324,0.0014296984,0.006682449],"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.00009481575,0.000053445372,0.0004057471,0.00069798937,0.00002417337,0.000060001654,0.00011906949,0.0010847115,0.017423047,0.0054250862,0.025991214,0.9486208],"study_design_scores_gemma":[0.0000698468,0.00061266,0.0076722205,0.0014797233,0.00012327275,0.002729329,0.0018507763,0.14685784,0.071348175,0.07038866,0.6966401,0.00022747142],"about_ca_topic_score_codex":0.0041262056,"about_ca_topic_score_gemma":0.0040515084,"teacher_disagreement_score":0.0125859855,"about_ca_system_score_codex":0.00063760404,"about_ca_system_score_gemma":0.00084309734,"threshold_uncertainty_score":0.042104363},"labels":[],"label_agreement":null},{"id":"W2147420447","doi":"10.1007/978-3-642-11811-1_2","title":"Formal Probabilistic Analysis: A Higher-Order Logic Based Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Probabilistic logic; Computer science; Probabilistic CTL; Probabilistic analysis of algorithms; Theoretical computer science; Probabilistic argumentation; Scale (ratio); Artificial intelligence","score_opus":0.03217981723058657,"score_gpt":0.2749233640525519,"score_spread":0.24274354682196533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147420447","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.00071084633,0.0002241349,0.9920597,0.00029343282,0.00006628525,0.000024755667,0.000053081472,0.00018138696,0.0063862302],"genre_scores_gemma":[0.18088849,0.0019554563,0.7927715,0.0005843055,0.0007878562,0.00025143792,0.00038797743,0.00055578543,0.021817211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966239,0.0009358753,0.00024350021,0.00044568986,0.001525902,0.00022511477],"domain_scores_gemma":[0.9948939,0.003231352,0.00033649534,0.0008616039,0.0005393554,0.00013724415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036967166,0.0014657121,0.0013248767,0.0030564535,0.0013366466,0.005345631,0.00339061,0.0016575537,0.012630776],"category_scores_gemma":[0.0077727516,0.0011280257,0.0036169463,0.0025163526,0.0048938813,0.009583344,0.0027559681,0.0043588895,0.0027303682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008566969,0.000018705574,0.000081441205,0.000079262005,0.000015770445,0.000051315903,0.000082444916,0.007751601,0.0005718535,0.9766714,0.0008737837,0.013793818],"study_design_scores_gemma":[0.0000045952447,0.000009431708,0.000050684084,0.000020541967,0.000019601022,0.00007639454,0.000018280321,0.034960303,0.0008981656,0.9556955,0.008231954,0.000014519406],"about_ca_topic_score_codex":0.0016488582,"about_ca_topic_score_gemma":0.0016099726,"teacher_disagreement_score":0.012630776,"about_ca_system_score_codex":0.00243488,"about_ca_system_score_gemma":0.0018464978,"threshold_uncertainty_score":0.04225421},"labels":[],"label_agreement":null},{"id":"W2147423818","doi":"10.1007/11569510_3","title":"APHIDS++: Evolution of A Programmable Hybrid Intrusion Detection System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 British Columbia","funders":"","keywords":"Intrusion detection system; Computer science; XML; Computer security; Honeypot; The Internet; Popularity; Operating system","score_opus":0.00799562030582554,"score_gpt":0.20555882733975972,"score_spread":0.19756320703393418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147423818","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.16571723,0.0009248596,0.6931528,0.0005812761,0.0007935019,0.00036676184,0.0010981774,0.11094831,0.026417095],"genre_scores_gemma":[0.41019112,0.00040340927,0.55262786,0.00072677474,0.000092905524,0.0002478857,0.0020731143,0.0029685243,0.030668417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.000043119864,0.000022230524,0.00008784431,0.00012167211,0.000029776878],"domain_scores_gemma":[0.9997278,0.0000652801,0.000020071275,0.000077143704,0.000068734975,0.00004101332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040258633,0.00050117593,0.000397148,0.00031225212,0.00020336937,0.0007985066,0.0017414985,0.0005351814,0.0047301175],"category_scores_gemma":[0.0007630508,0.00038284552,0.00039276484,0.00016675467,0.00030007542,0.0009907925,0.0009717622,0.00077642285,0.0016129307],"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.0017894589,0.0004277007,0.0064717783,0.0006579342,0.0003563483,0.00067537074,0.00044690334,0.08369534,0.1881677,0.0147089735,0.049557526,0.65304494],"study_design_scores_gemma":[0.00033606598,0.0008178562,0.0032390968,0.00006194344,0.00025487918,0.0013734715,0.00007838716,0.6302011,0.20452999,0.008027491,0.15096033,0.00011941186],"about_ca_topic_score_codex":0.0010005006,"about_ca_topic_score_gemma":0.000917831,"teacher_disagreement_score":0.0047301175,"about_ca_system_score_codex":0.00028248562,"about_ca_system_score_gemma":0.00032655377,"threshold_uncertainty_score":0.015823781},"labels":[],"label_agreement":null},{"id":"W2147425931","doi":"10.1007/3-540-44674-5_3","title":"Fast Implementations of Automata Computations","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Automaton; Edit distance; Sequence (biology); Computation; Algorithm; Implementation; Theoretical computer science; Class (philosophy); Parallel computing; Bit array; Programming language; Artificial intelligence; Type (biology)","score_opus":0.022314547805681227,"score_gpt":0.28873630459525357,"score_spread":0.26642175678957236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147425931","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.020850625,0.001296032,0.94099665,0.00045451743,0.00054322067,0.000108909495,0.00043226886,0.009880397,0.025437344],"genre_scores_gemma":[0.38413948,0.0010958696,0.5899381,0.00036757305,0.00029598048,0.0005436202,0.0013152536,0.0021791891,0.020125011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978282,0.0005701271,0.0001680018,0.00039592845,0.0007388873,0.00029887757],"domain_scores_gemma":[0.9955836,0.0019680178,0.000113261754,0.0016076593,0.0005982816,0.00012921558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011400203,0.0013561635,0.0013177489,0.0012897066,0.0013041575,0.0040925667,0.002976439,0.0015308886,0.02472009],"category_scores_gemma":[0.006975891,0.0011172881,0.0013437592,0.0023556151,0.0013063698,0.006393559,0.0026827087,0.0027793637,0.0066448664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072753814,0.00014619519,0.0004827679,0.0004887678,0.000098011806,0.00012324496,0.00034327162,0.03171922,0.012252122,0.531893,0.02650733,0.39521852],"study_design_scores_gemma":[0.00017654206,0.00009176515,0.0001942974,0.000097841905,0.00007350691,0.00013653384,0.00011315685,0.24889928,0.018275985,0.7021964,0.029692017,0.000052671876],"about_ca_topic_score_codex":0.0015941375,"about_ca_topic_score_gemma":0.0032603785,"teacher_disagreement_score":0.02472009,"about_ca_system_score_codex":0.0016859415,"about_ca_system_score_gemma":0.0015049938,"threshold_uncertainty_score":0.082696974},"labels":[],"label_agreement":null},{"id":"W2147483970","doi":"10.1007/3-540-45333-4_46","title":"On the Performance of Informative Wavelets for Classification and Diagnosis of Machine Faults","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wavelet; Computer science; Pattern recognition (psychology); Mutual information; Artificial intelligence; Wavelet packet decomposition; Entropy (arrow of time); Feature extraction; Feature selection; Gabor wavelet; Data mining; Wavelet transform; Discrete wavelet transform","score_opus":0.012657052023901303,"score_gpt":0.2172379386362104,"score_spread":0.2045808866123091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147483970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15385555,0.004353103,0.83654827,0.0007877795,0.00023801601,0.000041159634,0.00015706608,0.0005261692,0.0034928734],"genre_scores_gemma":[0.8284292,0.003055708,0.16521472,0.00017777368,0.00039549812,0.000043566553,0.0004913729,0.00016224371,0.0020298257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775165,0.001048854,0.0001344728,0.0001770841,0.00072152773,0.00016643573],"domain_scores_gemma":[0.9585087,0.03722134,0.00057662907,0.0016620995,0.0017465437,0.00028472889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008903435,0.0013808412,0.0012918266,0.0011103558,0.00036514938,0.0013230294,0.0011536721,0.0020674663,0.0013283785],"category_scores_gemma":[0.043831617,0.00049443496,0.0004594581,0.0010491173,0.0012290879,0.0023725643,0.0013156891,0.0018028455,0.00052037387],"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.002416935,0.00017859267,0.0024208175,0.0002869634,0.00013804864,0.00015335716,0.00022669951,0.4480961,0.021530194,0.018607225,0.0032095294,0.50273556],"study_design_scores_gemma":[0.000024519652,0.00012763907,0.00090708147,0.00001794452,0.00002875945,0.000053502597,0.000024525614,0.9878906,0.0037848426,0.0069253556,0.00020332071,0.000011985932],"about_ca_topic_score_codex":0.0014849728,"about_ca_topic_score_gemma":0.0010100718,"teacher_disagreement_score":0.008903435,"about_ca_system_score_codex":0.00047065003,"about_ca_system_score_gemma":0.00037157154,"threshold_uncertainty_score":0.047086418},"labels":[],"label_agreement":null},{"id":"W2147756878","doi":"10.1007/978-3-540-24840-8_22","title":"Spatio-temporal Reasoning for Vague Regions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Yolk; Computer science; Process (computing); Artificial intelligence; Dimension (graph theory); Motion (physics); Egg white; Cognitive science; Mathematics; Ecology; Biology; Psychology; Programming language","score_opus":0.025420382561230408,"score_gpt":0.25277925047638816,"score_spread":0.22735886791515775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147756878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077865426,0.0011852914,0.9862503,0.00033758246,0.00005192704,0.00003732582,0.00017352034,0.00027588962,0.0039015913],"genre_scores_gemma":[0.28569263,0.0027782917,0.705171,0.00017727181,0.00017337351,0.00011867125,0.0008873372,0.000089020294,0.0049123974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867743,0.00034270505,0.00015552052,0.0002856281,0.00045420227,0.00008449886],"domain_scores_gemma":[0.9979563,0.0012261964,0.00017665079,0.0003529545,0.00021218785,0.00007570887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022694005,0.000833197,0.00092351664,0.0019685484,0.0009179792,0.0034046408,0.002251,0.0015623069,0.0042832247],"category_scores_gemma":[0.005950012,0.0008913068,0.0032796504,0.0020338346,0.0025702678,0.00931234,0.0026290321,0.0018782128,0.0006952063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023256999,0.00006376235,0.00088412495,0.0009636164,0.00022347594,0.001289058,0.0020312138,0.1025294,0.010375059,0.7529002,0.004736051,0.12377157],"study_design_scores_gemma":[0.00002989887,0.000037384783,0.00041805892,0.00013719565,0.00012475172,0.0005912118,0.0004692276,0.3040388,0.004807494,0.6766826,0.012617528,0.000045888122],"about_ca_topic_score_codex":0.003513643,"about_ca_topic_score_gemma":0.0033692855,"teacher_disagreement_score":0.0042832247,"about_ca_system_score_codex":0.0011390668,"about_ca_system_score_gemma":0.00058191665,"threshold_uncertainty_score":0.014328778},"labels":[],"label_agreement":null},{"id":"W2147953023","doi":"10.1007/978-3-540-24670-1_3","title":"A Boosted Particle Filter: Multitarget Detection and Tracking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":1029,"is_retracted":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":"AdaBoost; Particle filter; Artificial intelligence; Tracking (education); Computer science; Computer vision; Filter (signal processing); Mixture model; Video tracking; Gaussian; Context (archaeology); Pattern recognition (psychology); Object detection; Object (grammar); Classifier (UML)","score_opus":0.018661353301527822,"score_gpt":0.23390726482571605,"score_spread":0.21524591152418823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147953023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047777715,0.0009291917,0.9970675,0.000049910617,0.00017599712,0.000012774174,0.000021403164,0.00055195804,0.00071351],"genre_scores_gemma":[0.035381116,0.002134716,0.9502252,0.00017936638,0.00030914776,0.00010278341,0.00021781836,0.00020670179,0.0112431785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993594,0.00011512189,0.000029769544,0.00015040221,0.00031499614,0.000030306968],"domain_scores_gemma":[0.9993486,0.00024515053,0.000025670015,0.00012859315,0.00022190763,0.00003006609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009959921,0.0009645462,0.0012623486,0.00073797797,0.00038341293,0.0010382521,0.0016592811,0.0023302808,0.004540222],"category_scores_gemma":[0.0023176894,0.0009248252,0.0007654772,0.0017055682,0.00048510378,0.0016207263,0.0011559883,0.0019943386,0.004431722],"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.00018059736,0.000089524176,0.00024757747,0.0002848349,0.00012124548,0.00010753192,0.000055980126,0.1180748,0.018180497,0.018016983,0.016770225,0.8278703],"study_design_scores_gemma":[0.000020564197,0.00004187238,0.00022785417,0.000012725687,0.000035438952,0.00011460604,0.0000053101603,0.97150135,0.006667161,0.00847392,0.012878121,0.00002113053],"about_ca_topic_score_codex":0.002786384,"about_ca_topic_score_gemma":0.0028519363,"teacher_disagreement_score":0.004540222,"about_ca_system_score_codex":0.0004577412,"about_ca_system_score_gemma":0.0006065857,"threshold_uncertainty_score":0.015188575},"labels":[],"label_agreement":null},{"id":"W2148004487","doi":"10.1007/3-540-45105-6_46","title":"Coevolving Communication and Cooperation for Lattice Formation Tasks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cellular automaton; Automaton; Lattice (music); Distributed computing; Theoretical computer science; Human–computer interaction; Artificial intelligence","score_opus":0.019347911653475276,"score_gpt":0.25159275266616454,"score_spread":0.23224484101268927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148004487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17205052,0.00032587931,0.80485266,0.000509797,0.000117460804,0.00011658051,0.000070622715,0.00035735537,0.021599188],"genre_scores_gemma":[0.92664045,0.00022349384,0.06276465,0.00007424576,0.000052240714,0.00020540736,0.00009298918,0.00009893145,0.009847685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.0003166366,0.000055413984,0.00015408255,0.00019048496,0.00017489737],"domain_scores_gemma":[0.99080527,0.007125186,0.0003865469,0.00063871604,0.0004094286,0.00063485856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001554185,0.00071044796,0.0010840642,0.00060299627,0.0011230359,0.0016257826,0.0019191115,0.0016526568,0.005543978],"category_scores_gemma":[0.010742568,0.00049566134,0.0005423514,0.00081965985,0.0018076254,0.0026944114,0.0032668188,0.0019671032,0.0006977189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007167113,0.00031137318,0.0005656602,0.00021580009,0.000039520393,0.00023110233,0.0005620963,0.5069848,0.010106576,0.36279866,0.0037553061,0.11371235],"study_design_scores_gemma":[0.000041308045,0.00006312863,0.00006577128,0.000007657473,0.000008298374,0.000043867305,0.00005201126,0.8576182,0.0013493977,0.14021637,0.0005222885,0.000011642517],"about_ca_topic_score_codex":0.0013420153,"about_ca_topic_score_gemma":0.0016067221,"teacher_disagreement_score":0.005543978,"about_ca_system_score_codex":0.00071023335,"about_ca_system_score_gemma":0.000985348,"threshold_uncertainty_score":0.018546462},"labels":[],"label_agreement":null},{"id":"W2148055031","doi":"10.1007/11559573_140","title":"A Step Towards Practical Steganography Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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":"Western University","funders":"","keywords":"Steganography; Computer science; Key (lock); Computer security; Key exchange; Protocol (science); Steganography tools; Secure communication; Key-agreement protocol; Focus (optics); Computer network; Key distribution; Public-key cryptography; Artificial intelligence; Encryption; Embedding","score_opus":0.020987625649059802,"score_gpt":0.2756468313092704,"score_spread":0.2546592056602106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148055031","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.010674868,0.0042291046,0.9116474,0.0068937014,0.00066232885,0.00020869405,0.00008962859,0.0019244407,0.063669816],"genre_scores_gemma":[0.21392865,0.0064919735,0.69220716,0.0013536758,0.00053692795,0.000287084,0.0002824039,0.0004142945,0.084497884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917954,0.00023785372,0.000040137587,0.00008754039,0.0003964926,0.000058358753],"domain_scores_gemma":[0.9987826,0.00038859146,0.000038340717,0.00047047067,0.00026670875,0.000053331827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011130463,0.0009859975,0.00062750315,0.00050968776,0.0006327378,0.0018218568,0.0011835379,0.0025365648,0.021613397],"category_scores_gemma":[0.0024842715,0.00061871164,0.0003665637,0.00039173188,0.0014577119,0.005189866,0.001996668,0.0027750202,0.007872877],"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.00021999571,0.00020813406,0.0002798243,0.0007180994,0.00005184904,0.0001943291,0.00029989745,0.0139664,0.038012665,0.5244248,0.019256487,0.40236756],"study_design_scores_gemma":[0.00016204263,0.00075453,0.00032787528,0.00040312568,0.000060100847,0.0012135998,0.00024160765,0.08574534,0.048837095,0.48743063,0.37476122,0.00006287916],"about_ca_topic_score_codex":0.0002456204,"about_ca_topic_score_gemma":0.00027183435,"teacher_disagreement_score":0.021613397,"about_ca_system_score_codex":0.00051773194,"about_ca_system_score_gemma":0.00052077137,"threshold_uncertainty_score":0.07230401},"labels":[],"label_agreement":null},{"id":"W2148172295","doi":"10.1007/978-3-642-02611-9_8","title":"Image Resolution Enhancement with Hierarchical Hidden Fields","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Scale (ratio); Fractal; Image processing; Scale space; Markov chain; Pattern recognition (psychology); Key (lock); Mathematical morphology; Grayscale; Hidden Markov model; Hierarchical database model; Image (mathematics); Computer vision; Algorithm; Data mining; Machine learning; Mathematics; Cartography","score_opus":0.016056503934177357,"score_gpt":0.26540567543317223,"score_spread":0.24934917149899488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148172295","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.013539849,0.00040776894,0.9838509,0.00008429658,0.000038046936,0.000017168293,0.000037087048,0.00031988404,0.0017050804],"genre_scores_gemma":[0.29609743,0.000971618,0.6912606,0.00016800617,0.000092481816,0.000033880242,0.00020124954,0.00016930899,0.01100549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990857,0.000015153998,0.0000043847645,0.000019129977,0.000037736736,0.000014927639],"domain_scores_gemma":[0.9997942,0.000092353905,0.000018738978,0.00004651434,0.00003368866,0.000014575905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003507961,0.0004262481,0.00040823728,0.00039903997,0.00014459327,0.0004432322,0.0005090796,0.00055622275,0.0025147267],"category_scores_gemma":[0.0005869833,0.00031289968,0.0004264891,0.00035129406,0.0003583169,0.00089666847,0.000692374,0.0008176854,0.00050113513],"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.0004392086,0.00013803958,0.00046862278,0.00035722548,0.00010693415,0.00022369677,0.00012219301,0.1643063,0.2837844,0.045406967,0.0040626414,0.50058377],"study_design_scores_gemma":[0.000020533356,0.00007392118,0.00040190425,0.000023054767,0.00003410161,0.00019785429,0.000010587473,0.92525744,0.05689233,0.014050992,0.0030227567,0.000014392071],"about_ca_topic_score_codex":0.00059109816,"about_ca_topic_score_gemma":0.0010571278,"teacher_disagreement_score":0.0025147267,"about_ca_system_score_codex":0.00023103369,"about_ca_system_score_gemma":0.00020758204,"threshold_uncertainty_score":0.0084126},"labels":[],"label_agreement":null},{"id":"W2148177244","doi":"10.1007/978-3-319-07425-2_18","title":"Energy Efficient Stable Routing Using Adjustable Transmission Ranges in Mobile Ad Hoc Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Routing protocol; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Ad hoc wireless distribution service; Distributed computing; Dynamic Source Routing; Routing (electronic design automation); Wireless; Telecommunications; Network packet","score_opus":0.01203748230677721,"score_gpt":0.22565510370088873,"score_spread":0.21361762139411153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148177244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029513516,0.017013285,0.92990345,0.00040248613,0.0005206437,0.000043132364,0.000065500404,0.00081199047,0.021725936],"genre_scores_gemma":[0.7720718,0.014209744,0.1863346,0.00015107897,0.00057861407,0.000094449264,0.00017222672,0.00031284697,0.026074603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975234,0.000058317135,0.000013619968,0.000045185177,0.00010351851,0.000026989279],"domain_scores_gemma":[0.99967504,0.0001832193,0.000025240302,0.000052127933,0.000053019266,0.000011292437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029652537,0.0005737435,0.0004708998,0.00050325185,0.00028623478,0.00086435856,0.0011496034,0.0004719554,0.0021767407],"category_scores_gemma":[0.0008664276,0.0003145078,0.0002581831,0.0009911493,0.00040101208,0.0014010079,0.00066355156,0.00072577613,0.00077885087],"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.00022303329,0.00009191564,0.00036828232,0.0005541314,0.00006738141,0.00023246308,0.00018805571,0.23400939,0.059180852,0.092333525,0.0074589974,0.60529196],"study_design_scores_gemma":[0.000038492257,0.0003657418,0.0006781399,0.0001081104,0.00009342729,0.00080689316,0.0001297357,0.84452206,0.023604836,0.08924458,0.040340465,0.00006754893],"about_ca_topic_score_codex":0.00019643834,"about_ca_topic_score_gemma":0.00025829586,"teacher_disagreement_score":0.0021767407,"about_ca_system_score_codex":0.00027713747,"about_ca_system_score_gemma":0.00016280159,"threshold_uncertainty_score":0.0072818995},"labels":[],"label_agreement":null},{"id":"W2148327938","doi":"10.1007/978-3-540-30139-4_60","title":"The Massive User Modelling System (MUMS)","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ontology; Domain (mathematical analysis); Architecture; Software engineering; Human–computer interaction; System integration; World Wide Web; Database","score_opus":0.020371748327623288,"score_gpt":0.2263691553743082,"score_spread":0.20599740704668493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148327938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008453687,0.00039362197,0.64196944,0.00023613566,0.00014714456,0.00024798355,0.004200288,0.33405364,0.010297982],"genre_scores_gemma":[0.2922548,0.0013439105,0.5730053,0.0007047174,0.0001448688,0.0014590294,0.02807781,0.05196267,0.051046908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927646,0.00021805103,0.00007340244,0.00014621312,0.00023046731,0.000055389908],"domain_scores_gemma":[0.9983321,0.00058633497,0.00006274544,0.0006936561,0.00016665949,0.00015859005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011787433,0.0014250103,0.0010550809,0.0007591535,0.00049720047,0.0018490498,0.002780042,0.0013827764,0.034123],"category_scores_gemma":[0.0058993124,0.001227425,0.0010544272,0.0005765032,0.00041030897,0.0027352753,0.0039613238,0.0021505551,0.016295902],"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.0026252018,0.0004446181,0.003167753,0.0010899489,0.00034275217,0.00049802754,0.0013274947,0.046634417,0.03135284,0.04338289,0.25597304,0.613161],"study_design_scores_gemma":[0.000458835,0.00029759554,0.0014331178,0.000205323,0.00023084933,0.00073630956,0.00010984763,0.53598714,0.039062385,0.038782302,0.38245252,0.00024376702],"about_ca_topic_score_codex":0.002861289,"about_ca_topic_score_gemma":0.0040243375,"teacher_disagreement_score":0.034123,"about_ca_system_score_codex":0.0005209424,"about_ca_system_score_gemma":0.0010503372,"threshold_uncertainty_score":0.11415279},"labels":[],"label_agreement":null},{"id":"W2148556617","doi":"10.1007/11805816_31","title":"Combining Multiple Similarity Metrics Using a Multicriteria Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université Laval","funders":"","keywords":"ELECTRE; Ranking (information retrieval); Similarity (geometry); Pairwise comparison; Computer science; Data mining; Metric (unit); Aggregate (composite); Machine learning; Similitude; Artificial intelligence; Mathematics; Mathematical optimization; Multiple-criteria decision analysis; Image (mathematics)","score_opus":0.0506338763157039,"score_gpt":0.269587851224461,"score_spread":0.2189539749087571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148556617","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.0051930267,0.0007297264,0.99238825,0.00006477799,0.00007491816,0.00006482582,0.00004049534,0.00044341007,0.0010006027],"genre_scores_gemma":[0.12826584,0.00071157014,0.86825794,0.000100269026,0.00016770809,0.00017112122,0.00038090802,0.0002520686,0.0016925717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99046344,0.0031408533,0.00097565586,0.0014220275,0.003691154,0.0003069162],"domain_scores_gemma":[0.99017525,0.0033915567,0.00080963963,0.0017506821,0.0037006473,0.00017229511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005481471,0.001381774,0.0033178756,0.009631464,0.00075855403,0.0036130855,0.0027860182,0.0018017362,0.0018791085],"category_scores_gemma":[0.018058551,0.0010567347,0.00234315,0.00911436,0.0007883019,0.006083401,0.0030753158,0.0012314563,0.0013459995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029237874,0.0002451876,0.0029288651,0.00070425484,0.0011108812,0.0002732817,0.00029770017,0.03496967,0.029018728,0.025694614,0.0048636375,0.89960074],"study_design_scores_gemma":[0.000072667106,0.00048269515,0.0034400607,0.00019532783,0.0008549169,0.0013962971,0.00034751036,0.8823904,0.02721861,0.07060718,0.012750982,0.0002433977],"about_ca_topic_score_codex":0.00090828625,"about_ca_topic_score_gemma":0.0017427903,"teacher_disagreement_score":0.009631464,"about_ca_system_score_codex":0.0006760268,"about_ca_system_score_gemma":0.00083908765,"threshold_uncertainty_score":0.028989136},"labels":[],"label_agreement":null},{"id":"W2148565121","doi":"10.1007/978-3-642-02843-4_7","title":"A Data Privacy Taxonomy","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Taxonomy (biology); Information retrieval; Ecology; Biology","score_opus":0.07212130180163709,"score_gpt":0.28324141871931535,"score_spread":0.21112011691767826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148565121","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.0049049603,0.03812949,0.75408417,0.018597912,0.0017979797,0.00057370507,0.001732454,0.0010863382,0.17909302],"genre_scores_gemma":[0.13397689,0.072683856,0.6689557,0.0087695215,0.003395716,0.0016867261,0.006494217,0.0008024616,0.10323486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938391,0.0014470404,0.0007608434,0.0011248054,0.0024195537,0.000408632],"domain_scores_gemma":[0.9938851,0.0023379587,0.0003137619,0.0017852493,0.0012481498,0.00042977103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047028963,0.0013133629,0.0014690044,0.008557132,0.0049184645,0.0127228815,0.0024843332,0.0031394765,0.009466753],"category_scores_gemma":[0.008100501,0.0012938943,0.0021329953,0.012431563,0.006224495,0.02738599,0.0062979152,0.009477084,0.0048008636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000663872,0.000022531569,0.00016289564,0.000109853936,0.0000051674997,0.0000321937,0.0002560673,0.00041084294,0.0001392219,0.95207864,0.009686887,0.03708887],"study_design_scores_gemma":[0.0000044165677,0.000021430707,0.000163698,0.00019945628,0.000009865495,0.00037036734,0.00027653202,0.0031823772,0.00028930863,0.74885046,0.24661773,0.000014314592],"about_ca_topic_score_codex":0.0021479076,"about_ca_topic_score_gemma":0.0012510795,"teacher_disagreement_score":0.0127228815,"about_ca_system_score_codex":0.0036697763,"about_ca_system_score_gemma":0.0036451987,"threshold_uncertainty_score":0.031669497},"labels":[],"label_agreement":null},{"id":"W2148652035","doi":"10.1007/978-3-319-59876-5_29","title":"Development of an Active Shape Model Using the Discrete Cosine Transform","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Discrete cosine transform; Landmark; Artificial intelligence; Computer science; Computer vision; Face (sociological concept); Feature (linguistics); Pattern recognition (psychology); Property (philosophy); Image (mathematics); Set (abstract data type)","score_opus":0.0433817104011967,"score_gpt":0.28764330924108183,"score_spread":0.24426159883988513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148652035","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.00086807366,0.00007422893,0.9980198,0.000030182553,0.000035407254,0.000019038076,0.00002498287,0.00024444313,0.000683888],"genre_scores_gemma":[0.0775911,0.0006432484,0.9113208,0.0001253072,0.00007091763,0.00016045706,0.0005900505,0.00048108827,0.009016995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.000037146663,0.000019335499,0.000067832356,0.00022443665,0.000021764838],"domain_scores_gemma":[0.9995915,0.00010064766,0.000023389981,0.000070733346,0.00018894921,0.000024775974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005364392,0.0006383099,0.00079935015,0.00065483956,0.00029396333,0.001146398,0.0018702095,0.001166988,0.0029086648],"category_scores_gemma":[0.0011019622,0.00072245416,0.00118306,0.0008960271,0.00043236616,0.0015495516,0.00093649153,0.0016066969,0.0037265294],"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.00010184288,0.00014212244,0.00066027837,0.00022674246,0.00008665371,0.0001790266,0.00012476077,0.3340031,0.099678494,0.052584972,0.00567848,0.50653344],"study_design_scores_gemma":[0.000004587811,0.000023393297,0.00009102577,0.000008628785,0.00000961018,0.00009232177,0.0000089409195,0.9823667,0.010011069,0.0020364244,0.005332413,0.000014767396],"about_ca_topic_score_codex":0.0033892086,"about_ca_topic_score_gemma":0.0028421609,"teacher_disagreement_score":0.0033892086,"about_ca_system_score_codex":0.00042469995,"about_ca_system_score_gemma":0.0008651081,"threshold_uncertainty_score":0.009730518},"labels":[],"label_agreement":null},{"id":"W2148717184","doi":"10.1007/978-3-540-24840-8_59","title":"Scheduling Using Constraint-Directed Search","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Job shop scheduling; Computer science; Constraint satisfaction problem; Schedule; Mathematical optimization; Scheduling (production processes); Constraint satisfaction; Constraint programming; Constraint satisfaction dual problem; Constraint (computer-aided design); Local consistency; Mathematics; Artificial intelligence","score_opus":0.023723774562969,"score_gpt":0.2514761038039608,"score_spread":0.22775232924099179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148717184","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.0031124083,0.00045051108,0.9800197,0.00017643631,0.000104484825,0.00015843395,0.0002721469,0.0016390708,0.014066891],"genre_scores_gemma":[0.10034671,0.0008816095,0.8854979,0.00021718079,0.00007277587,0.00045403186,0.001129895,0.0005872544,0.010812574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00016855708,0.000028303219,0.000103487015,0.00017595309,0.00006591518],"domain_scores_gemma":[0.999022,0.0006220295,0.000053176285,0.00013349966,0.00012254086,0.000046645375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090911967,0.0013054892,0.0014280832,0.0012102638,0.0008096687,0.0014525634,0.002260019,0.001142468,0.0116817355],"category_scores_gemma":[0.0024424747,0.0009491,0.0009336549,0.0025977867,0.000608797,0.0012202227,0.0010813902,0.0014862219,0.0021130755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109947025,0.0001623578,0.00016532194,0.00037412535,0.00008383743,0.00006692024,0.000057223708,0.7156834,0.0020449793,0.046259094,0.020317739,0.21467502],"study_design_scores_gemma":[0.000035681976,0.000021147262,0.000038326358,0.000022454602,0.000015543661,0.000019235236,0.000011248441,0.9599019,0.0009510866,0.03342013,0.00555468,0.000008586178],"about_ca_topic_score_codex":0.00954889,"about_ca_topic_score_gemma":0.013625488,"teacher_disagreement_score":0.0116817355,"about_ca_system_score_codex":0.0014690231,"about_ca_system_score_gemma":0.002581561,"threshold_uncertainty_score":0.03907931},"labels":[],"label_agreement":null},{"id":"W2148774687","doi":"10.1007/978-3-642-15277-1_23","title":"A Dynamic, Distributed, Hierarchical Load Balancing for HLA-Based Simulations on Large-Scale Environments","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Load balancing (electrical power); High-level architecture; Synchronization (alternating current); Overhead (engineering); Load management; Fault tolerance; Grid; Computer network","score_opus":0.009538164969032268,"score_gpt":0.24391971832851106,"score_spread":0.2343815533594788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148774687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022256559,0.00015135255,0.96325266,0.00028222683,0.0001623449,0.00014561153,0.00010345314,0.0050364514,0.008609293],"genre_scores_gemma":[0.38218683,0.00021113797,0.60599744,0.00020770924,0.00010705974,0.000251286,0.00040711922,0.0009818304,0.009649516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995864,0.000111336885,0.00003244637,0.000055294597,0.00016830345,0.000046346526],"domain_scores_gemma":[0.99944097,0.0000898452,0.00002853648,0.0002476144,0.00010507034,0.00008788354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008162631,0.0003103015,0.00058003975,0.00032153892,0.0009737539,0.0012813812,0.0018572932,0.0006781129,0.00622011],"category_scores_gemma":[0.0014692498,0.00037567114,0.00044925418,0.0005525497,0.0005486272,0.0010854717,0.0018758463,0.0010925344,0.0016405189],"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.0006811672,0.00044252948,0.0026590638,0.0002121743,0.00018736375,0.0003509618,0.00046870855,0.40564036,0.08397135,0.068779096,0.020479979,0.41612718],"study_design_scores_gemma":[0.000078474026,0.00007383914,0.0005002058,0.0000115205485,0.00002400491,0.00009664463,0.000052112304,0.9610404,0.009620851,0.015749766,0.012731417,0.000020766081],"about_ca_topic_score_codex":0.0015949468,"about_ca_topic_score_gemma":0.00177478,"teacher_disagreement_score":0.00622011,"about_ca_system_score_codex":0.0004310737,"about_ca_system_score_gemma":0.00077502977,"threshold_uncertainty_score":0.02080834},"labels":[],"label_agreement":null},{"id":"W2148785652","doi":"10.1007/3-540-46406-9_6","title":"From the Sea to the Sidewalk: The Evolution of Hexapod Walking Gaits by a Genetic Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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 Toronto","funders":"","keywords":"Hexapod; Computer science; Robot; Genetic algorithm; Automaton; Cellular automaton; Simple (philosophy); Basis (linear algebra); Algorithm; Simulation; Artificial intelligence; Mathematics; Machine learning","score_opus":0.007830676883573674,"score_gpt":0.20243574661929833,"score_spread":0.19460506973572467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148785652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1849548,0.0016171152,0.79382265,0.0004009,0.0002722751,0.000111274116,0.000094133095,0.0008866572,0.017840153],"genre_scores_gemma":[0.6395887,0.0010807797,0.3506257,0.00016586232,0.000037509257,0.00013396109,0.00019608533,0.0003073029,0.007864059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994564,0.000012189207,0.000003471781,0.0000145618005,0.000015242919,0.000008949082],"domain_scores_gemma":[0.9999157,0.000032434127,0.0000072069406,0.000012664967,0.000020136484,0.000011846539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020197684,0.00037165498,0.00054372667,0.00034059424,0.00045430593,0.00074622204,0.0008087133,0.00096024084,0.0018719069],"category_scores_gemma":[0.0005013881,0.00035256715,0.00049765635,0.00067328097,0.00070761336,0.0005912252,0.0006325886,0.0006710943,0.0004140865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001195722,0.000070323316,0.0011042024,0.00013059663,0.00008420243,0.00021798375,0.00044639088,0.7703072,0.016064035,0.031458423,0.0025664452,0.17743069],"study_design_scores_gemma":[0.00003636926,0.00006601719,0.00035618956,0.00003086725,0.000031262327,0.00009403574,0.00008087046,0.9734702,0.0018231479,0.02072121,0.003271169,0.00001864215],"about_ca_topic_score_codex":0.0023957551,"about_ca_topic_score_gemma":0.0019051506,"teacher_disagreement_score":0.0023957551,"about_ca_system_score_codex":0.00026892248,"about_ca_system_score_gemma":0.0004097055,"threshold_uncertainty_score":0.006262183},"labels":[],"label_agreement":null},{"id":"W2148824790","doi":"10.1007/3-540-45848-4_26","title":"Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Grid; Integer (computer science); Planar graph; Planar; Plane (geometry); Line (geometry); Graph; Prism; Discrete mathematics; Geometry; Computer science; Physics; Computer graphics (images); Optics","score_opus":0.023111314092956158,"score_gpt":0.26273113543295257,"score_spread":0.2396198213399964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148824790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044094082,0.0007132166,0.8583167,0.00023352698,0.00022933561,0.00013337245,0.0005774939,0.0021936418,0.09350868],"genre_scores_gemma":[0.30351287,0.0021533521,0.6306906,0.000105962084,0.000079972786,0.00019254473,0.001131564,0.0011639473,0.060969193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976367,0.000059041256,0.000015341331,0.00003403477,0.00009718914,0.00003076375],"domain_scores_gemma":[0.99955636,0.0001525527,0.000040057297,0.00014009078,0.00008012495,0.000030846382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020279079,0.00076300104,0.00047119704,0.0008429066,0.00045157722,0.0012166597,0.001098976,0.0005321636,0.021098634],"category_scores_gemma":[0.0011540712,0.000606154,0.00038265562,0.0013509857,0.00064337556,0.0012263282,0.0009593597,0.0011037482,0.003867039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001415758,0.00006914662,0.00034123735,0.00031858808,0.000016394106,0.00029706696,0.0004655063,0.09618615,0.017037058,0.60442793,0.02386523,0.25683403],"study_design_scores_gemma":[0.00009782132,0.000110781926,0.00065216207,0.0001108335,0.000027193732,0.000708787,0.0003459307,0.3348307,0.016519438,0.5043673,0.14215408,0.000074937496],"about_ca_topic_score_codex":0.001145443,"about_ca_topic_score_gemma":0.0021067637,"teacher_disagreement_score":0.021098634,"about_ca_system_score_codex":0.0003005559,"about_ca_system_score_gemma":0.00022823451,"threshold_uncertainty_score":0.07058197},"labels":[],"label_agreement":null},{"id":"W2148893137","doi":"10.1007/11780441_10","title":"New Bounds for Motif Finding in Strong Instances","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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 Waterloo","funders":"","keywords":"Computer science; Motif (music); Theoretical computer science; Artificial intelligence; Art","score_opus":0.017515912395388925,"score_gpt":0.23473080709281618,"score_spread":0.21721489469742727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148893137","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.016929768,0.006622844,0.9330014,0.004995489,0.0012240016,0.00030353805,0.001777615,0.0025460608,0.03259924],"genre_scores_gemma":[0.23644775,0.006225465,0.7112455,0.0034044902,0.005555458,0.0021230755,0.0066065243,0.0041122446,0.02427949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856581,0.003635042,0.00094687834,0.0031097827,0.004754822,0.0018952229],"domain_scores_gemma":[0.8824689,0.09381067,0.0035082838,0.011496711,0.0047829263,0.003932565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012527348,0.0063517503,0.0075725135,0.008384698,0.0037989211,0.011461512,0.019937554,0.006578136,0.035373453],"category_scores_gemma":[0.098318286,0.0038666073,0.005606364,0.01340018,0.007049335,0.037507318,0.019471198,0.023644999,0.0079940995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019850517,0.0009401115,0.0035819176,0.0021657534,0.0004974127,0.0003865163,0.000679756,0.14114095,0.0044200104,0.5092102,0.07654529,0.25844714],"study_design_scores_gemma":[0.00016654203,0.00018248358,0.0005084128,0.00028669,0.00024587018,0.000309536,0.00013951435,0.33704123,0.0013102194,0.65084475,0.008887932,0.00007684373],"about_ca_topic_score_codex":0.0020082777,"about_ca_topic_score_gemma":0.0032898525,"teacher_disagreement_score":0.035373453,"about_ca_system_score_codex":0.0047504674,"about_ca_system_score_gemma":0.00321911,"threshold_uncertainty_score":0.11833596},"labels":[],"label_agreement":null},{"id":"W2148966262","doi":"10.1007/978-3-642-03573-9_24","title":"Annotating Atomic Components of Papers in Digital Libraries: The Semantic and Social Web Heading towards a Living Document Supporting eSciences","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Terry Fox Research Institute","funders":"","keywords":"Computer science; World Wide Web; Semantic Web; Social Semantic Web; Social web; Heading (navigation); Information retrieval; Social media","score_opus":0.016426914862594875,"score_gpt":0.24885903795049924,"score_spread":0.23243212308790437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148966262","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.0678965,0.025732758,0.7142413,0.007889807,0.0049167722,0.0004924764,0.0051141875,0.008227776,0.16548838],"genre_scores_gemma":[0.14071888,0.01823232,0.7083108,0.0012475087,0.0010443812,0.0002678158,0.015413384,0.0039604683,0.11080452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782795,0.00053670356,0.0003453016,0.00035986587,0.00082585943,0.00010425103],"domain_scores_gemma":[0.99323636,0.0028231768,0.00053659896,0.0017273079,0.0012954348,0.00038113742],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032633503,0.00093883276,0.00072552206,0.009838445,0.0031850017,0.011257424,0.002279426,0.0019958643,0.008222057],"category_scores_gemma":[0.010773118,0.0007541458,0.0017635445,0.019434122,0.0026192938,0.01129551,0.004305502,0.001595066,0.0041927206],"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.00012720998,0.00015493999,0.0061033336,0.0019293915,0.00016842733,0.0011036474,0.008373489,0.0038510885,0.009011196,0.2571251,0.060620256,0.6514319],"study_design_scores_gemma":[0.0000126320365,0.000035257213,0.004158051,0.0007065222,0.00020472374,0.0010647392,0.0020357205,0.007052032,0.008067826,0.16411598,0.812467,0.00007954707],"about_ca_topic_score_codex":0.0052068033,"about_ca_topic_score_gemma":0.0070049395,"teacher_disagreement_score":0.9887426,"about_ca_system_score_codex":0.0017104375,"about_ca_system_score_gemma":0.0029337646,"threshold_uncertainty_score":0.027505457},"labels":[],"label_agreement":null},{"id":"W2149364930","doi":"10.1007/978-3-319-02297-0_3","title":"Computing the Limit Points of the Quasi-component of a Regular Chain in Dimension One","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Dimension (graph theory); Component (thermodynamics); Chain (unit); Limit (mathematics); Ideal (ethics); Computer science; Set (abstract data type); Series (stratigraphy); Mathematics; Algorithm; Discrete mathematics; Combinatorics; Mathematical analysis; Physics","score_opus":0.014756817602010001,"score_gpt":0.21473131819295138,"score_spread":0.19997450059094138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149364930","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.8800745,0.0003076446,0.10448459,0.00018262521,0.00005308922,0.00003792773,0.00038416722,0.0005867775,0.013888566],"genre_scores_gemma":[0.9355889,0.00024272234,0.05604426,0.000029766095,0.000040259434,0.00003219364,0.0008722284,0.00022247637,0.0069271284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981266,0.000024599958,0.0000118540875,0.00005442536,0.00005493808,0.00004161206],"domain_scores_gemma":[0.99917656,0.00032161354,0.00008858225,0.00010981228,0.00013897468,0.00016437523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038452385,0.000579694,0.0007175759,0.0018616538,0.00093575526,0.0026904612,0.0011626646,0.00074731227,0.008997232],"category_scores_gemma":[0.0019456623,0.00046111704,0.00046882787,0.0010785465,0.0017736347,0.0030986567,0.0013559536,0.001197558,0.001458798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008724635,0.0002447734,0.01453155,0.0005389364,0.00009275341,0.00083086285,0.0017484186,0.030660704,0.02417988,0.83055514,0.004783846,0.09096062],"study_design_scores_gemma":[0.000055866025,0.00015731184,0.0032978381,0.00011322493,0.000052705327,0.00032992958,0.00096603774,0.15603985,0.0120785935,0.8220897,0.004775104,0.000043849665],"about_ca_topic_score_codex":0.0012310089,"about_ca_topic_score_gemma":0.0021660023,"teacher_disagreement_score":0.008997232,"about_ca_system_score_codex":0.00070684904,"about_ca_system_score_gemma":0.00035058864,"threshold_uncertainty_score":0.030098736},"labels":[],"label_agreement":null},{"id":"W2149458512","doi":"10.1007/978-3-642-21458-5_35","title":"Approximation Algorithms for Orienting Mixed Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Logarithm; Computer science; Undirected graph; Approximation algorithm; Graph; Vertex (graph theory); Directed graph; Block graph; Combinatorics; Algorithm; Discrete mathematics; Line graph; Mathematics; Theoretical computer science; Pathwidth","score_opus":0.04011783219635234,"score_gpt":0.28845202270077064,"score_spread":0.2483341905044183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149458512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05969884,0.0025544786,0.90313804,0.0009615694,0.00028515537,0.00023906556,0.00086454564,0.0031046965,0.02915365],"genre_scores_gemma":[0.18706836,0.0018019238,0.7901967,0.00040037747,0.00023942313,0.00045202806,0.0032387339,0.0011536678,0.015448759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987607,0.00030292728,0.00007557396,0.00028433808,0.0003923914,0.00018398612],"domain_scores_gemma":[0.9970299,0.0016274643,0.00016906223,0.00073842396,0.00027195102,0.00016318531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011607009,0.0023672285,0.0019062953,0.0021378023,0.0010373006,0.0037384627,0.004546116,0.0018881236,0.013896949],"category_scores_gemma":[0.0065146587,0.0013286006,0.001954118,0.0047897906,0.0011280328,0.007730599,0.0033476145,0.0041615544,0.003144665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065631256,0.0005878698,0.0014912859,0.0009809198,0.00017646136,0.00015359693,0.000519233,0.11515097,0.005413482,0.27077907,0.040369652,0.5637211],"study_design_scores_gemma":[0.00019978952,0.00010963453,0.00044255567,0.00013828395,0.00013316456,0.00026295544,0.00024153378,0.46723726,0.0032138312,0.5137214,0.014266306,0.0000333073],"about_ca_topic_score_codex":0.0027200137,"about_ca_topic_score_gemma":0.004070646,"teacher_disagreement_score":0.013896949,"about_ca_system_score_codex":0.0022553029,"about_ca_system_score_gemma":0.0011199265,"threshold_uncertainty_score":0.046489894},"labels":[],"label_agreement":null},{"id":"W2149488367","doi":"10.1007/978-3-642-38911-5_12","title":"Traceability Links in Model Transformations between Software and Performance Models","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Traceability; Computer science; Software engineering; Software; Programming language","score_opus":0.02255300894512314,"score_gpt":0.23429099579332022,"score_spread":0.21173798684819709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149488367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01112613,0.00016264425,0.97829926,0.00040520122,0.000078400255,0.00009920253,0.00015890026,0.0016031408,0.008067028],"genre_scores_gemma":[0.48468032,0.0009843076,0.49287865,0.0003753517,0.00015131629,0.00051870185,0.0014110479,0.0027920078,0.016208282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943685,0.0021514634,0.0004714921,0.00076283223,0.0019740525,0.0002716494],"domain_scores_gemma":[0.9805321,0.012261221,0.0009527258,0.0047766874,0.0012961951,0.00018109454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052043074,0.0009911555,0.0006205802,0.0021727982,0.0011008254,0.00331122,0.0024064046,0.0018990906,0.0071096714],"category_scores_gemma":[0.033060834,0.0012916563,0.001988008,0.0020127983,0.0020235144,0.011014621,0.004281801,0.00601812,0.0012341229],"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.0001402213,0.00017861692,0.0011813578,0.00032679783,0.00007595969,0.0004026254,0.0013385075,0.1029903,0.0034814843,0.7645704,0.002564564,0.12274918],"study_design_scores_gemma":[0.000020731868,0.000078441255,0.00028983701,0.00016444353,0.00009086892,0.000117220596,0.00015647258,0.2079171,0.010285251,0.7660723,0.014775047,0.00003228452],"about_ca_topic_score_codex":0.0030083535,"about_ca_topic_score_gemma":0.002033815,"teacher_disagreement_score":0.0071096714,"about_ca_system_score_codex":0.0014051099,"about_ca_system_score_gemma":0.0017534583,"threshold_uncertainty_score":0.027523339},"labels":[],"label_agreement":null},{"id":"W2149576378","doi":"10.1007/11949619_31","title":"Clickstream Visualization Based on Usage Patterns","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Clickstream; Cluster analysis; Visualization; Data mining; Point cloud; Data visualization; Cloud computing; Set (abstract data type); Web server; Point (geometry); The Internet; Information retrieval; World Wide Web; Machine learning; Artificial intelligence; Web API","score_opus":0.01858013505904765,"score_gpt":0.283507413163195,"score_spread":0.26492727810414735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149576378","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.25826478,0.003941453,0.53623986,0.0016374334,0.0016147814,0.00040884802,0.0357282,0.124988526,0.037176155],"genre_scores_gemma":[0.61627525,0.0030964275,0.33664384,0.00022039437,0.0006004668,0.00030750493,0.016023379,0.004968974,0.021863777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977773,0.00002079119,0.00002063303,0.000039000737,0.00011004425,0.000031845957],"domain_scores_gemma":[0.9986939,0.00053081085,0.00010488403,0.00012541235,0.0003911931,0.00015386724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029706894,0.0011697164,0.00063734094,0.0046755606,0.00039642115,0.002548669,0.00046909633,0.0005437031,0.016071763],"category_scores_gemma":[0.0021013492,0.00035232425,0.00046109615,0.004134979,0.00013623729,0.0018592009,0.00095571514,0.00086895947,0.0026101214],"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.0016037589,0.00021783305,0.019138347,0.00095033756,0.00015073869,0.0008669653,0.00084716995,0.0058923312,0.07441831,0.0070415046,0.10622086,0.78265184],"study_design_scores_gemma":[0.00027993895,0.0004395142,0.07298467,0.0005375774,0.00042683032,0.0027985182,0.0012308051,0.65503895,0.11819153,0.029618692,0.118135564,0.00031736156],"about_ca_topic_score_codex":0.0032164643,"about_ca_topic_score_gemma":0.0052195587,"teacher_disagreement_score":0.016071763,"about_ca_system_score_codex":0.00025025572,"about_ca_system_score_gemma":0.00033685338,"threshold_uncertainty_score":0.053765416},"labels":[],"label_agreement":null},{"id":"W2149611697","doi":"10.1007/11942634_46","title":"Dynamic Virtual Clustering with Xen and Moab","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Operating system; Virtual machine; Cluster analysis; Software; Workload; Overhead (engineering); Cluster (spacecraft); Distributed computing; Embedded system","score_opus":0.007866975412079178,"score_gpt":0.2135521885573914,"score_spread":0.2056852131453122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149611697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11350705,0.0018636395,0.77631885,0.0011494927,0.0010493034,0.0002993348,0.00044467562,0.03799249,0.06737516],"genre_scores_gemma":[0.7386023,0.00044546853,0.23143184,0.00029934506,0.00013483419,0.00016950135,0.0007454792,0.0026658513,0.025505496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.0002011003,0.000032792734,0.00012146378,0.0002541387,0.00020970433],"domain_scores_gemma":[0.9988852,0.00013679102,0.000044378718,0.0005702594,0.00020779237,0.00015552588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912164,0.00071874075,0.0009112279,0.0006553346,0.0016759104,0.0025361534,0.0024537386,0.0006485219,0.009991359],"category_scores_gemma":[0.002150415,0.00047527882,0.00041541716,0.0008827376,0.0008202814,0.0024715152,0.0032619257,0.001250319,0.002432369],"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.002767684,0.0006578554,0.0025511002,0.000294906,0.00017731413,0.0003133476,0.00047142297,0.26640156,0.024940677,0.13643658,0.06730365,0.49768388],"study_design_scores_gemma":[0.00015273516,0.00017347414,0.0009585288,0.00004444613,0.0000644616,0.00030535043,0.00030136603,0.83748263,0.027281022,0.078470446,0.054683942,0.00008150684],"about_ca_topic_score_codex":0.0022346387,"about_ca_topic_score_gemma":0.0033114296,"teacher_disagreement_score":0.009991359,"about_ca_system_score_codex":0.00089849695,"about_ca_system_score_gemma":0.0011946372,"threshold_uncertainty_score":0.033424377},"labels":[],"label_agreement":null},{"id":"W2149677346","doi":"10.1007/11889663_2","title":"A Protocol for Secure Public Instant Messaging","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"Carleton University","funders":"","keywords":"Computer science; Instant messaging; Protocol (science); Instant; Computer network","score_opus":0.03546533642443162,"score_gpt":0.31433076002508203,"score_spread":0.2788654236006504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149677346","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.0048365095,0.00055792363,0.94675905,0.0012501741,0.0010581604,0.0007825274,0.00048801783,0.008402542,0.035865147],"genre_scores_gemma":[0.22951575,0.0021161942,0.611493,0.001426235,0.0010659485,0.00370926,0.0022749929,0.003424673,0.14497402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686015,0.0006174095,0.00033085138,0.00033299407,0.001442215,0.0004163792],"domain_scores_gemma":[0.99703264,0.0008776066,0.00018972716,0.0012985147,0.00039149108,0.00021004306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002579926,0.0013690667,0.0012292853,0.0014558946,0.0031594923,0.0043782755,0.002407362,0.0027094535,0.017949712],"category_scores_gemma":[0.005251067,0.0013018257,0.0010838149,0.0019859485,0.0026371402,0.008899397,0.006648998,0.004908204,0.011405375],"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.0003456367,0.00012282444,0.0001044031,0.0003617952,0.000031173306,0.00035791774,0.00076658616,0.0023668914,0.012509152,0.8260086,0.035184383,0.12184065],"study_design_scores_gemma":[0.0002725675,0.0002549137,0.00020774263,0.00022023094,0.00014494601,0.00089048204,0.00023804331,0.037524603,0.035539847,0.6162915,0.3082318,0.00018320027],"about_ca_topic_score_codex":0.0005027091,"about_ca_topic_score_gemma":0.00059524336,"teacher_disagreement_score":0.017949712,"about_ca_system_score_codex":0.0010787011,"about_ca_system_score_gemma":0.0019410547,"threshold_uncertainty_score":0.060047746},"labels":[],"label_agreement":null},{"id":"W2149707951","doi":"10.1007/978-3-540-75759-7_114","title":"Global Registration of Multiple Point Sets: Feasibility and Applications in Multi-fragment Fracture Fixation","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Queen's University","funders":"","keywords":"Point set registration; Kalman filter; Computer science; Algorithm; Artificial intelligence; Gaussian; Point (geometry); Computer vision; Mathematics","score_opus":0.016946286125797724,"score_gpt":0.26797206615390745,"score_spread":0.2510257800281097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149707951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033878256,0.00050665095,0.96411896,0.00020789623,0.000034087956,0.000060572955,0.00003419935,0.00030440209,0.0008549434],"genre_scores_gemma":[0.48479202,0.00072246394,0.51231134,0.000057292913,0.00007924079,0.00014784909,0.00014992467,0.00022514538,0.0015147278],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856347,0.0004841664,0.000089441346,0.0002756827,0.00050933985,0.00007793627],"domain_scores_gemma":[0.99653,0.0017859376,0.00031339997,0.000659791,0.0006095407,0.000101428304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025510422,0.00083086494,0.0014957978,0.0020966977,0.00057604484,0.0011941412,0.0013208973,0.0017311367,0.002170079],"category_scores_gemma":[0.010625208,0.0009737626,0.0013163283,0.002260357,0.0012002982,0.0027142963,0.0025072824,0.0014035587,0.00073420303],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014537727,0.00024442075,0.005502071,0.0004296528,0.00012629812,0.0003967953,0.0005059596,0.15170838,0.070296876,0.013871239,0.0014793634,0.7539852],"study_design_scores_gemma":[0.00014058391,0.0008873127,0.005723163,0.00007819333,0.00015111262,0.001782233,0.00029266832,0.92904365,0.036719292,0.021787426,0.0032929727,0.00010141255],"about_ca_topic_score_codex":0.0010088495,"about_ca_topic_score_gemma":0.0010349103,"teacher_disagreement_score":0.0025510422,"about_ca_system_score_codex":0.0003118951,"about_ca_system_score_gemma":0.0007748153,"threshold_uncertainty_score":0.013491392},"labels":[],"label_agreement":null},{"id":"W2149832588","doi":"10.1007/978-3-642-15711-0_48","title":"MRI-Guided Robotic Prostate Biopsy: A Clinical Accuracy Validation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","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":"Queen's University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Cancer Institute; National Institutes of Health","keywords":"Prostate cancer; Magnetic resonance imaging; Prostate; Displacement (psychology); Medicine; Computer science; Biopsy; Computer vision; Prostate biopsy; Artificial intelligence; Radiology; Cancer","score_opus":0.02650892056530584,"score_gpt":0.31541395284752866,"score_spread":0.2889050322822228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149832588","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.9511246,0.010495442,0.03129311,0.0003397651,0.00017523978,0.00017794986,0.000968805,0.0007287647,0.004696243],"genre_scores_gemma":[0.9828467,0.0010926267,0.013787578,0.00017796353,0.00005237655,0.000045738787,0.0008016792,0.00015152637,0.0010439707],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963498,0.0017897286,0.00025131923,0.00043429,0.0010769108,0.00009785071],"domain_scores_gemma":[0.9846073,0.00971411,0.0010909599,0.0015443682,0.0027328492,0.0003104061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046454254,0.00067377306,0.0008083882,0.000823629,0.00042268515,0.0010568363,0.0011317929,0.0010526644,0.0018793519],"category_scores_gemma":[0.021669274,0.00062804937,0.000506711,0.00046827988,0.0006998602,0.00063640287,0.000875029,0.000404135,0.0008699649],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.022699798,0.0011147943,0.21012454,0.0021985585,0.0024159534,0.0007901125,0.0015806599,0.030176828,0.2235841,0.0010172626,0.0058261943,0.4984711],"study_design_scores_gemma":[0.0018577866,0.014624884,0.58812493,0.00045356335,0.0053476193,0.014289806,0.0006313351,0.1935279,0.16541176,0.00083437236,0.014450069,0.00044589146],"about_ca_topic_score_codex":0.0023031423,"about_ca_topic_score_gemma":0.0028521437,"teacher_disagreement_score":0.0046454254,"about_ca_system_score_codex":0.000435085,"about_ca_system_score_gemma":0.0005206805,"threshold_uncertainty_score":0.024567664},"labels":[],"label_agreement":null},{"id":"W2149862294","doi":"10.1007/978-3-540-68073-4_20","title":"Exploiting COTS-Based RE Methods: An Experience Report","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ERP Systems Implementation and Impact","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 Toronto","funders":"","keywords":"Computer science; Oracle; Enterprise resource planning; Key (lock); Engineering management; Exploratory research; Software engineering; Process management; Knowledge management; Computer security; Engineering","score_opus":0.09339868420462548,"score_gpt":0.3666603421874178,"score_spread":0.2732616579827923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149862294","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.7922224,0.00411222,0.13987522,0.0004809655,0.00010137412,0.0006642371,0.00036016197,0.0015582963,0.060625132],"genre_scores_gemma":[0.7567774,0.0054044323,0.1880929,0.0001853856,0.00008068015,0.00017374093,0.0011946126,0.0009833721,0.0471075],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99592894,0.0021365406,0.00022554574,0.00035697105,0.001096568,0.00025547668],"domain_scores_gemma":[0.98870814,0.0058164485,0.000524183,0.0022904903,0.0022442697,0.00041654275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006967998,0.0008779366,0.00050231925,0.0010680401,0.0005899047,0.0017638325,0.0014086846,0.00076450326,0.008279523],"category_scores_gemma":[0.008572378,0.0004479382,0.0006641507,0.0017184141,0.0005782692,0.0027986213,0.00076806376,0.0009719057,0.0019580333],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071907166,0.0029954533,0.009180409,0.0004831861,0.00007819728,0.0004175546,0.0056915022,0.0022310817,0.035121005,0.0030780926,0.0030587704,0.93694574],"study_design_scores_gemma":[0.00094800204,0.023924088,0.14771807,0.0015140421,0.001187325,0.010713839,0.018389886,0.08991369,0.2667848,0.00604735,0.4323966,0.00046233778],"about_ca_topic_score_codex":0.00465717,"about_ca_topic_score_gemma":0.0050917123,"teacher_disagreement_score":0.008279523,"about_ca_system_score_codex":0.0006091046,"about_ca_system_score_gemma":0.0009785636,"threshold_uncertainty_score":0.03685069},"labels":[],"label_agreement":null},{"id":"W2150429539","doi":"10.1007/11691730_5","title":"Frequent Subsequence-Based Protein Localization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Subsequence; Computer science; Support vector machine; Boosting (machine learning); Extracellular; Artificial intelligence; Computational biology; Biochemistry; Biology; Mathematics","score_opus":0.007828164709343928,"score_gpt":0.22877188275417537,"score_spread":0.22094371804483146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150429539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09080822,0.0020197674,0.89878166,0.00014794397,0.00014917541,0.00007813084,0.0014957415,0.0039019582,0.0026174337],"genre_scores_gemma":[0.4897975,0.0013877527,0.49494955,0.00008072583,0.00015067686,0.00010040966,0.008540712,0.00034318512,0.0046494114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.00006372326,0.0000423155,0.00013701322,0.00019796246,0.000040230367],"domain_scores_gemma":[0.99921286,0.0002534428,0.00011701358,0.0001604308,0.00021581883,0.000040432486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004162329,0.0004910174,0.0009365317,0.002959999,0.00040913236,0.0006909272,0.0011323397,0.00056633184,0.0020962958],"category_scores_gemma":[0.0014662804,0.0003025987,0.0006018821,0.0039765695,0.00036315827,0.00098483,0.00056482514,0.0004490262,0.0017690178],"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.0007766483,0.00021144573,0.0060080355,0.00046715655,0.00021217657,0.0008695593,0.000104686005,0.05142143,0.0965923,0.015360088,0.010628009,0.81734854],"study_design_scores_gemma":[0.00004194527,0.00018760971,0.0064861975,0.0000354618,0.000093074814,0.0021115849,0.000065099186,0.9225431,0.028626949,0.03149661,0.008264596,0.000047794576],"about_ca_topic_score_codex":0.0011361073,"about_ca_topic_score_gemma":0.0019267952,"teacher_disagreement_score":0.002959999,"about_ca_system_score_codex":0.000354347,"about_ca_system_score_gemma":0.000334719,"threshold_uncertainty_score":0.0070127845},"labels":[],"label_agreement":null},{"id":"W2150773524","doi":"10.1007/3-540-45065-3_9","title":"A Fast Parallel Optimization for Training Support Vector Machine","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":62,"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":"MNIST database; Computer science; Support vector machine; Sequential minimal optimization; Factor (programming language); Speedup; Kernel (algebra); Generalization; Word error rate; Training (meteorology); Artificial intelligence; Pattern recognition (psychology); Algorithm; Parallel computing; Machine learning; Artificial neural network; Mathematics","score_opus":0.040654412084353365,"score_gpt":0.30539895726532623,"score_spread":0.26474454518097285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150773524","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.007105371,0.0005319134,0.98431003,0.00019041097,0.00022800665,0.000112486996,0.00016378722,0.005356405,0.0020014679],"genre_scores_gemma":[0.0767409,0.00025584106,0.914544,0.00020355803,0.00018837515,0.00045010573,0.0008768065,0.0006421794,0.0060983314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988422,0.00032509444,0.000092834285,0.00022013232,0.00039711283,0.00012263513],"domain_scores_gemma":[0.99856937,0.00067553006,0.00005706848,0.0002284562,0.0003981346,0.00007139386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014842298,0.0020242773,0.0022608978,0.00088188256,0.00092492293,0.0010727819,0.0026403342,0.0015663883,0.012718564],"category_scores_gemma":[0.004379616,0.0012744603,0.0013503098,0.0019861413,0.0006252198,0.0016943453,0.0016052604,0.0025943113,0.0051022964],"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.00042845434,0.00017457346,0.00028118424,0.00018488902,0.00013769208,0.00010827858,0.000047067922,0.28177214,0.0053187087,0.0048106764,0.015482604,0.69125366],"study_design_scores_gemma":[0.000067604764,0.000059295584,0.00007934807,0.0000063641664,0.000016269705,0.000023661672,0.000009151658,0.99313277,0.0015182558,0.0035868958,0.0014919353,0.000008415318],"about_ca_topic_score_codex":0.009865699,"about_ca_topic_score_gemma":0.012367972,"teacher_disagreement_score":0.012718564,"about_ca_system_score_codex":0.00072346075,"about_ca_system_score_gemma":0.00206364,"threshold_uncertainty_score":0.042547822},"labels":[],"label_agreement":null},{"id":"W2150799478","doi":"10.1007/11734673_12","title":"Control-Flow Semantics for Assembly-Level Data-Flow Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"McMaster University","funders":"","keywords":"Computer science; Data flow diagram; Semantics (computer science); Control flow graph; Control flow; Data-flow analysis; Theoretical computer science; Flow (mathematics); Programming language; Algorithm; Database; Mathematics","score_opus":0.023524140955035706,"score_gpt":0.23168102131680451,"score_spread":0.2081568803617688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150799478","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.005166511,0.00031799517,0.9857292,0.00018106485,0.00006380498,0.00008509323,0.00035885017,0.0013025397,0.006794852],"genre_scores_gemma":[0.2399218,0.0012261467,0.74370104,0.00037961223,0.0001715731,0.0005738564,0.0023298531,0.0013348149,0.010361239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990847,0.00017528326,0.0001281021,0.00015065238,0.00035939112,0.00010172858],"domain_scores_gemma":[0.99902296,0.0004088496,0.000080635575,0.00018781047,0.000260459,0.00003934777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011139447,0.0010683602,0.0005842207,0.0012514294,0.000816472,0.0031023058,0.0015322727,0.001301416,0.0038410693],"category_scores_gemma":[0.0018619604,0.0008074355,0.0012645501,0.0012884132,0.0017168729,0.0038982653,0.0010695129,0.0023182803,0.0011497264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008603611,0.00007631993,0.00023096106,0.00031932627,0.000023950495,0.00018773208,0.00055691536,0.029019812,0.008027326,0.8810204,0.0043981983,0.07605307],"study_design_scores_gemma":[0.000050795457,0.00005147908,0.00019282897,0.00014516084,0.000051850137,0.000197173,0.00012159124,0.09019926,0.011984437,0.8444579,0.052511405,0.000035981673],"about_ca_topic_score_codex":0.0026563723,"about_ca_topic_score_gemma":0.0030955386,"teacher_disagreement_score":0.0038410693,"about_ca_system_score_codex":0.00093859294,"about_ca_system_score_gemma":0.0011084091,"threshold_uncertainty_score":0.0128496885},"labels":[],"label_agreement":null},{"id":"W2151053705","doi":"10.1007/11554714_2","title":"Genes Order and Phylogenetic Reconstruction: Application to γ-Proteobacteria","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Phylogenetic tree; Genome; Phylogenetic network; Phylogenetics; Biology; Computational biology; Gene; Phylogenetic relationship; Genetics; Evolutionary biology","score_opus":0.007438903979484146,"score_gpt":0.22311328112350712,"score_spread":0.21567437714402296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151053705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132141635,0.0010525102,0.97769076,0.00024040235,0.000081953,0.000037178237,0.0002121507,0.005093297,0.0023776253],"genre_scores_gemma":[0.049330253,0.0013330731,0.9453118,0.000066424385,0.00005422838,0.00006691198,0.00042197498,0.0010859629,0.002329323],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965286,0.000114486975,0.000028070772,0.00009290334,0.00009175043,0.00001991583],"domain_scores_gemma":[0.9980044,0.0014861847,0.000059717746,0.0001800955,0.00019927378,0.000070358394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014582388,0.0011525513,0.0014336673,0.0017368053,0.0012811621,0.0018649715,0.001840737,0.0011253254,0.008328678],"category_scores_gemma":[0.005257395,0.0012785717,0.001493438,0.00271718,0.00086387247,0.0015690147,0.0015300434,0.002691325,0.0026160544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000361883,0.000115179646,0.0023816337,0.00054530776,0.00012606102,0.0003670623,0.0007013425,0.11676007,0.014962757,0.034276772,0.008008881,0.8213931],"study_design_scores_gemma":[0.00008312635,0.00004796631,0.00096778997,0.000052991127,0.00006925743,0.0003026258,0.00019002876,0.9024745,0.0073463875,0.078008056,0.010418548,0.00003867615],"about_ca_topic_score_codex":0.003913998,"about_ca_topic_score_gemma":0.005007694,"teacher_disagreement_score":0.008328678,"about_ca_system_score_codex":0.00057910726,"about_ca_system_score_gemma":0.000822921,"threshold_uncertainty_score":0.027862191},"labels":[],"label_agreement":null},{"id":"W2151077859","doi":"10.1007/11523468_76","title":"How Well Can Primal-Dual and Local-Ratio Algorithms Perform?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Steiner tree problem; Combinatorics; Scheduling (production processes); Approximation algorithm; Dual (grammatical number); Computer science; Mathematics; Set cover problem; Set (abstract data type); Tree (set theory); Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.01625972781171476,"score_gpt":0.22452684843186915,"score_spread":0.2082671206201544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151077859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068797775,0.015298614,0.75479734,0.022471333,0.002051314,0.00014139927,0.0007152819,0.0039430032,0.13178396],"genre_scores_gemma":[0.6688237,0.005958883,0.29331842,0.0027134295,0.0016578804,0.00022125499,0.0008805306,0.00211446,0.024311457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924017,0.004295329,0.00020921465,0.0010303477,0.0013412314,0.00072229083],"domain_scores_gemma":[0.98141265,0.01228649,0.00076638855,0.0031254892,0.0018292348,0.00057968975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013459327,0.002166805,0.002716429,0.001403429,0.0013362399,0.0071526095,0.0027161038,0.0041282927,0.011627791],"category_scores_gemma":[0.057045355,0.00084091263,0.0013302724,0.002158193,0.0026033523,0.015330299,0.00259449,0.0036279713,0.00912565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014989394,0.00073884096,0.0033947797,0.00051942904,0.00031275756,0.00007145177,0.00021550799,0.13148667,0.0015156859,0.34525785,0.05588973,0.45909828],"study_design_scores_gemma":[0.00012755752,0.0001658006,0.0007469909,0.00012155209,0.000074350086,0.00016058807,0.00023788838,0.418604,0.0028023904,0.56537443,0.011544761,0.0000397334],"about_ca_topic_score_codex":0.0013889173,"about_ca_topic_score_gemma":0.0011534975,"teacher_disagreement_score":0.013459327,"about_ca_system_score_codex":0.0014008691,"about_ca_system_score_gemma":0.0019194748,"threshold_uncertainty_score":0.07118058},"labels":[],"label_agreement":null},{"id":"W2151258819","doi":"10.1007/978-3-540-74742-0_21","title":"Comparing Direct-to-Cache Transfer Policies to TCP/IP and M-VIA During Receive Operations in MPI Environments","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Thread (computing); Overhead (engineering); Latency (audio); Copying; Embedded system; Message passing; Operating system; Computer network; Parallel computing; Telecommunications","score_opus":0.02582684437176289,"score_gpt":0.2637553639606001,"score_spread":0.23792851958883723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151258819","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.9703409,0.00103087,0.015942235,0.0003817944,0.00012664878,0.000051616298,0.00027504563,0.0018308166,0.01001997],"genre_scores_gemma":[0.9943123,0.00014288248,0.003760342,0.000038044498,0.000025728892,0.000014396955,0.00010952255,0.000218588,0.0013783234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979729,0.0007612785,0.000080569574,0.00016560996,0.0005081975,0.000511401],"domain_scores_gemma":[0.9772246,0.016571421,0.0010634945,0.0021288954,0.002246838,0.0007648033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031398986,0.0005150111,0.0005952235,0.0010332691,0.000989459,0.0013482486,0.0013340305,0.00081861624,0.002869283],"category_scores_gemma":[0.016294358,0.00026853124,0.0002561539,0.0012256701,0.0006212942,0.0021528238,0.0005969615,0.00075885653,0.00057246553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02134152,0.0027594941,0.033503756,0.0008001426,0.00029932553,0.00036499323,0.0010696354,0.5383769,0.06929121,0.02145234,0.027137062,0.28360367],"study_design_scores_gemma":[0.00030976307,0.0021541647,0.01675335,0.000035604495,0.0002472225,0.00013246856,0.0011824969,0.9178823,0.051856127,0.006361987,0.002995136,0.000089341695],"about_ca_topic_score_codex":0.005223395,"about_ca_topic_score_gemma":0.0058820974,"teacher_disagreement_score":0.005223395,"about_ca_system_score_codex":0.0014187915,"about_ca_system_score_gemma":0.0013825505,"threshold_uncertainty_score":0.016605556},"labels":[],"label_agreement":null},{"id":"W2151283635","doi":"10.1007/978-3-642-15246-7_31","title":"Learning Automaton Based On-Line Discovery and Tracking of Spatio-temporal Event Patterns","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Event (particle physics); Correctness; Artificial intelligence; Automaton; Theoretical computer science; Machine learning; Distributed computing; Algorithm","score_opus":0.016983084757080828,"score_gpt":0.24390611818024155,"score_spread":0.22692303342316072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151283635","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.12891479,0.0002560478,0.86587113,0.00025058247,0.000077006356,0.00007859867,0.00060024654,0.0027346257,0.001217014],"genre_scores_gemma":[0.86219454,0.00013475797,0.13448988,0.00008994486,0.000039395607,0.00012185914,0.0011242589,0.00010887305,0.0016964934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908376,0.00014302423,0.00008849786,0.00041701575,0.00016651543,0.000101180565],"domain_scores_gemma":[0.9924539,0.0054348665,0.0005351688,0.00070986984,0.00064806646,0.00021818631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695765,0.00068458094,0.0017804132,0.0013840017,0.0004862983,0.0014740566,0.0028697364,0.0013712654,0.0025140257],"category_scores_gemma":[0.0070086326,0.0006486585,0.0010323604,0.00135732,0.0006882243,0.001722404,0.0014639965,0.0012337726,0.00075907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087944284,0.00045547987,0.02031783,0.0002806889,0.00022814405,0.00037142882,0.0002784379,0.66262305,0.009313027,0.010437444,0.002593512,0.29222155],"study_design_scores_gemma":[0.000005965707,0.00001748541,0.00019408883,0.000002489209,0.000007632416,0.00002104845,0.000006594084,0.99741024,0.00048171403,0.0017763122,0.00007337585,0.000003030004],"about_ca_topic_score_codex":0.008356253,"about_ca_topic_score_gemma":0.01031879,"teacher_disagreement_score":0.008356253,"about_ca_system_score_codex":0.0009071883,"about_ca_system_score_gemma":0.0011146405,"threshold_uncertainty_score":0.016615212},"labels":[],"label_agreement":null},{"id":"W2151290127","doi":"10.1007/978-3-642-30950-2_9","title":"Mental Workload, Engagement and Emotions: An Exploratory Study for Intelligent Tutoring Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Workload; Computer science; Perspective (graphical); Process (computing); Intelligent tutoring system; Human–computer interaction; Exploratory research; Multimedia; Artificial intelligence","score_opus":0.06837685906468567,"score_gpt":0.288293857104745,"score_spread":0.21991699804005932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151290127","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.99948007,0.000022747166,0.00014829819,0.000010442985,0.0000020965094,0.000031950258,0.000022969736,0.0000024833732,0.00027889063],"genre_scores_gemma":[0.9989845,0.00003805479,0.0002196367,0.00002610638,0.000010609694,0.00018337442,0.00007426646,0.000005127118,0.00045826254],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99917775,0.00036331234,0.000041795203,0.00013243771,0.00015584809,0.00012892405],"domain_scores_gemma":[0.99542975,0.0028520962,0.00045705665,0.00022529643,0.0003158925,0.0007198466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015211203,0.0004053214,0.00062191807,0.0005324617,0.00089129864,0.0012682339,0.0005280056,0.00064357487,0.0014605124],"category_scores_gemma":[0.008392278,0.0003248447,0.00035743546,0.0003968089,0.0006693801,0.00076331774,0.0010416842,0.0012734643,0.00039334415],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058563445,0.033743322,0.64706665,0.0006603777,0.0003689248,0.0016169692,0.21520555,0.001714388,0.034153767,0.0008690056,0.0020161043,0.056728598],"study_design_scores_gemma":[0.00018054416,0.0114952205,0.9494794,0.000032384727,0.0000935856,0.00067782524,0.031384572,0.0018196338,0.0026155554,0.00046077848,0.0016984865,0.000062078274],"about_ca_topic_score_codex":0.00089200307,"about_ca_topic_score_gemma":0.00116069,"teacher_disagreement_score":0.0015211203,"about_ca_system_score_codex":0.00038007472,"about_ca_system_score_gemma":0.00029634478,"threshold_uncertainty_score":0.0080446005},"labels":[],"label_agreement":null},{"id":"W2151481988","doi":"10.1007/3-540-39205-x_21","title":"Explanation Oriented Association Mining Using Rough Set Theory","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":28,"is_retracted":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":"Rough set; Construct (python library); Association rule learning; Association (psychology); Data mining; Set (abstract data type); Computer science; Mathematics; Epistemology; Philosophy","score_opus":0.040149703336530174,"score_gpt":0.2784028063645356,"score_spread":0.23825310302800545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151481988","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.013178475,0.0006823787,0.98308706,0.00016327045,0.000055619308,0.00012039047,0.00016894034,0.00063451467,0.0019093655],"genre_scores_gemma":[0.13455434,0.0007860802,0.8612422,0.00012339665,0.00008227972,0.00018087449,0.0008337169,0.00007567381,0.0021213987],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803656,0.00052450347,0.00021966068,0.00029760308,0.00082358817,0.00009815705],"domain_scores_gemma":[0.9965821,0.0021781565,0.00022553938,0.0005227396,0.00043986394,0.000051663344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018974411,0.00071297004,0.0015592389,0.002925879,0.0006941718,0.002202608,0.0014943605,0.0007684189,0.0026871918],"category_scores_gemma":[0.0060277744,0.0006154616,0.001885734,0.0034081552,0.00048364248,0.0027763494,0.0016819071,0.0012368384,0.0009142891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026106866,0.0002566848,0.005118849,0.0006127702,0.00064450543,0.000544994,0.00044911698,0.04183982,0.0058068424,0.061269607,0.0070154527,0.87618023],"study_design_scores_gemma":[0.000090922964,0.00019787018,0.003544303,0.00014897117,0.0006829494,0.0014569579,0.00027503364,0.7383434,0.010640994,0.22876267,0.015748717,0.00010727454],"about_ca_topic_score_codex":0.0006017995,"about_ca_topic_score_gemma":0.0009337314,"teacher_disagreement_score":0.002925879,"about_ca_system_score_codex":0.0003318261,"about_ca_system_score_gemma":0.000902273,"threshold_uncertainty_score":0.01003474},"labels":[],"label_agreement":null},{"id":"W2151508451","doi":"10.1007/978-3-540-85990-1_76","title":"Prostate Brachytherapy Seed Localization with Gaussian Blurring and Camera Self-calibration","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Cancer Institute; National Institutes of Health","keywords":"Computer science; Imaging phantom; Computer vision; Prostate brachytherapy; Artificial intelligence; Brachytherapy; Calibration; Gaussian; Gaussian process; Tomosynthesis; Mathematics; Nuclear medicine; Mammography; Physics; Medicine; Statistics; Radiology","score_opus":0.005025093996183084,"score_gpt":0.23148928972857089,"score_spread":0.2264641957323878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151508451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022455666,0.0010659536,0.97306055,0.00015256794,0.000054526507,0.00005717687,0.00006358814,0.0013796536,0.0017103925],"genre_scores_gemma":[0.35606793,0.0007918417,0.63813627,0.00012956964,0.000038869854,0.000072762705,0.0002041278,0.00043697242,0.0041217497],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989017,0.00026381077,0.00006578139,0.00020489092,0.000463658,0.000100103956],"domain_scores_gemma":[0.99906176,0.0002738563,0.00016725836,0.0002228688,0.00022443305,0.00004992857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011538519,0.0010109575,0.0008762401,0.00085365516,0.00048215917,0.0011008632,0.0007973608,0.0011146644,0.0017420232],"category_scores_gemma":[0.004431421,0.0010743431,0.0010342505,0.0012175362,0.00033891867,0.0010257942,0.0013746991,0.0009318193,0.00094279204],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017012934,0.00014397927,0.0045556296,0.000781675,0.0003444755,0.0004301363,0.00054541894,0.10960833,0.26213557,0.0053462815,0.0037695204,0.61063766],"study_design_scores_gemma":[0.0001746286,0.00047698,0.014954932,0.0000841715,0.00048020325,0.004601283,0.000112844646,0.70674264,0.25776994,0.0027998593,0.011578198,0.00022434926],"about_ca_topic_score_codex":0.004732619,"about_ca_topic_score_gemma":0.0077914996,"teacher_disagreement_score":0.004732619,"about_ca_system_score_codex":0.0008665192,"about_ca_system_score_gemma":0.0017758969,"threshold_uncertainty_score":0.009410143},"labels":[],"label_agreement":null},{"id":"W2151573035","doi":"10.1007/978-3-540-24687-9_18","title":"Finite Element Model of Fracture Formation on Growing Surfaces","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":28,"is_retracted":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":"Finite element method; Shrinkage; Fracture (geology); Computer science; Layer (electronics); Growth model; Element (criminal law); Composite material; Structural engineering; Materials science; Mathematics; Engineering","score_opus":0.029855631189433587,"score_gpt":0.2804901799059046,"score_spread":0.250634548716471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151573035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12552707,0.00078648335,0.82931644,0.0011154835,0.00026718012,0.000107359985,0.000492207,0.00051774934,0.041869916],"genre_scores_gemma":[0.8662814,0.0007447417,0.087113336,0.00022528888,0.000085027474,0.00021378964,0.00042804863,0.00021456988,0.044693902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998411,0.000031829208,0.000008893647,0.000029465238,0.0000688463,0.000019762338],"domain_scores_gemma":[0.99969876,0.00013187768,0.000034059252,0.000030542687,0.00007295073,0.000031862703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000280677,0.00055289775,0.0010741983,0.00091198477,0.00057505304,0.0011687813,0.0023840906,0.003645017,0.004416042],"category_scores_gemma":[0.0010197927,0.000718972,0.00082267757,0.00073933124,0.0013742403,0.0011259206,0.00087855,0.0011510267,0.0007701464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023187817,0.00003045279,0.0001791543,0.00003111383,0.000013328068,0.000099996745,0.000056489705,0.96120566,0.003074042,0.032059822,0.00033607666,0.0028906872],"study_design_scores_gemma":[0.0000042833326,0.0000062112254,0.000054184544,0.0000028245727,0.0000028010609,0.000023926466,0.000010296181,0.9952246,0.00024605298,0.00406135,0.00035903393,0.0000044466906],"about_ca_topic_score_codex":0.006452142,"about_ca_topic_score_gemma":0.0033736324,"teacher_disagreement_score":0.006452142,"about_ca_system_score_codex":0.00078472163,"about_ca_system_score_gemma":0.00083659287,"threshold_uncertainty_score":0.01477313},"labels":[],"label_agreement":null},{"id":"W2151661660","doi":"10.1007/978-3-540-77028-2_23","title":"Spam Filtering and Email-Mediated Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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 Regina","funders":"","keywords":"Computer science; World Wide Web; Process (computing); Order (exchange); Email authentication; Electronic mail; Collaborative filtering; Filter (signal processing); Recommender system; Information retrieval; Key (lock); Computer security","score_opus":0.020758639135534388,"score_gpt":0.24669452035511374,"score_spread":0.22593588121957936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151661660","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06491383,0.18369895,0.40900153,0.008714024,0.0017398001,0.00014534433,0.00021935489,0.0013261407,0.33024105],"genre_scores_gemma":[0.60112554,0.07502463,0.06519232,0.0012973329,0.0049880887,0.00016817196,0.00038397012,0.00020968236,0.25161034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925023,0.00028792853,0.000025768146,0.00009981737,0.00026252345,0.000073771545],"domain_scores_gemma":[0.99808985,0.0013599389,0.00010380014,0.00017695231,0.0002297699,0.000039724215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062743796,0.0007637175,0.00076729344,0.0016001216,0.0009601122,0.003161833,0.00071101345,0.002823507,0.006690664],"category_scores_gemma":[0.003654415,0.00049914164,0.0005250894,0.0020383496,0.001349933,0.003913379,0.0007779047,0.0011321639,0.0022085705],"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.00007745503,0.00015574768,0.0018134916,0.0007038422,0.00006198654,0.00059172657,0.0007669168,0.011613581,0.0033407868,0.56072116,0.041714393,0.37843892],"study_design_scores_gemma":[0.00001092565,0.00008506118,0.0023568177,0.00024240414,0.00006330742,0.0015755347,0.0002232878,0.07162935,0.0032292313,0.7961961,0.12434345,0.00004457021],"about_ca_topic_score_codex":0.0011645744,"about_ca_topic_score_gemma":0.0013337358,"teacher_disagreement_score":0.006690664,"about_ca_system_score_codex":0.00086976757,"about_ca_system_score_gemma":0.00040556217,"threshold_uncertainty_score":0.022382438},"labels":[],"label_agreement":null},{"id":"W2151670649","doi":"10.1007/978-3-642-23944-1_11","title":"A PET/CT Directed, 3D Ultrasound-Guided Biopsy System for Prostate Cancer","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials","funders":"National Center for Research Resources; National Cancer Institute","keywords":"Prostate cancer; Biopsy; Prostate biopsy; Ultrasound; Medicine; Segmentation; Radiology; Prostate; Imaging phantom; 3D ultrasound; Image registration; Computer science; Cancer; Artificial intelligence; Image (mathematics)","score_opus":0.02483587470806197,"score_gpt":0.2926995473445426,"score_spread":0.26786367263648064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151670649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34546065,0.0077101476,0.6026088,0.002767148,0.0007820783,0.0016398631,0.0046207714,0.024087349,0.010323242],"genre_scores_gemma":[0.4901728,0.0017632089,0.49429062,0.0030506654,0.00024676658,0.0005133019,0.001858482,0.00077289523,0.007331236],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996649,0.000054567816,0.000028116281,0.00012033261,0.00010517299,0.000026832759],"domain_scores_gemma":[0.9996928,0.00008756481,0.000020835907,0.000048171605,0.00008281951,0.00006783787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053277623,0.0007320065,0.0009670748,0.00084655435,0.00064620085,0.0011148338,0.0013165309,0.002369246,0.0054362686],"category_scores_gemma":[0.00087330694,0.00085637096,0.0005757526,0.0005746851,0.00025076946,0.0005533221,0.00088500173,0.0006159554,0.0022699058],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017793748,0.00049398874,0.010061621,0.0006549323,0.0003538819,0.003835612,0.0001847427,0.005260745,0.7103494,0.0004595363,0.0109383175,0.25562784],"study_design_scores_gemma":[0.0013400754,0.004586742,0.1168326,0.0003601883,0.0025628307,0.054685652,0.00029809756,0.32454073,0.44199458,0.0020105503,0.049963616,0.0008244124],"about_ca_topic_score_codex":0.0028356963,"about_ca_topic_score_gemma":0.0055075972,"teacher_disagreement_score":0.0054362686,"about_ca_system_score_codex":0.00049550197,"about_ca_system_score_gemma":0.0011103436,"threshold_uncertainty_score":0.018186152},"labels":[],"label_agreement":null},{"id":"W2151708137","doi":"10.1007/978-3-540-72200-7_25","title":"Using Answer Sets to Solve Belief Change Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Belief revision; Computer science; Path (computing); Transition (genetics); Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.08867244043153139,"score_gpt":0.3034429093995342,"score_spread":0.21477046896800284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151708137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015236605,0.0003187929,0.97526324,0.0009889595,0.00016574982,0.0001733882,0.00018750023,0.0011862201,0.0064794915],"genre_scores_gemma":[0.2996513,0.00026380483,0.6919358,0.00054258696,0.00022005361,0.00050949946,0.0009662813,0.00030149586,0.0056091524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960537,0.0017621104,0.0002801633,0.0005186396,0.0010712455,0.00031412428],"domain_scores_gemma":[0.9808383,0.016755393,0.00045364266,0.00087780756,0.0008305729,0.0002442432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049144733,0.0012840604,0.0016168393,0.0015388868,0.0012249396,0.002871594,0.0036809545,0.0027010401,0.010230228],"category_scores_gemma":[0.030547356,0.0010232453,0.0023055617,0.0011093382,0.0021714752,0.0060000513,0.003913067,0.0052782763,0.001199257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079907884,0.00069846405,0.0013293363,0.00069817906,0.00034658783,0.00027922593,0.0012240038,0.21930826,0.0028612812,0.3626063,0.015159634,0.39468968],"study_design_scores_gemma":[0.00012731178,0.00005617851,0.0001298323,0.00005057568,0.000067369925,0.00003386061,0.00010358649,0.4370056,0.0017119668,0.5579234,0.002764764,0.000025524765],"about_ca_topic_score_codex":0.0036212949,"about_ca_topic_score_gemma":0.0043222024,"teacher_disagreement_score":0.010230228,"about_ca_system_score_codex":0.0014419106,"about_ca_system_score_gemma":0.0011336743,"threshold_uncertainty_score":0.034223497},"labels":[],"label_agreement":null},{"id":"W2151936745","doi":"10.1007/978-3-642-13122-6_32","title":"Symmetric Monotone Venn Diagrams with Seven Curves","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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 Victoria","funders":"","keywords":"Venn diagram; Monotone polygon; Diagram; Simple (philosophy); Mathematics; Combinatorics; Stereographic projection; Projection (relational algebra); Point (geometry); Geometry; Algorithm","score_opus":0.006845742146870528,"score_gpt":0.18858550222509537,"score_spread":0.18173976007822484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151936745","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.15213631,0.001149531,0.34652072,0.0009860687,0.00042423594,0.0003049718,0.0010680436,0.0006892054,0.49672085],"genre_scores_gemma":[0.7262433,0.0013535235,0.15467918,0.0003272016,0.00016483762,0.000256142,0.0009355526,0.00032154686,0.1157187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990387,0.00026281553,0.000046697478,0.00016147648,0.00032907317,0.00016131284],"domain_scores_gemma":[0.99884015,0.00033457857,0.00009793469,0.00012399271,0.00042086956,0.00018254257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792517,0.00057050574,0.0005053024,0.0020807092,0.001466584,0.0021214383,0.0009999074,0.0010214628,0.015523799],"category_scores_gemma":[0.002097482,0.0004407344,0.00045464627,0.0017391674,0.001142917,0.003047303,0.0013203897,0.0014855088,0.0026493212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030798827,0.0000138855075,0.000101173144,0.000062872816,0.000004993289,0.00010715823,0.00013795232,0.0008310058,0.0020828163,0.97923297,0.0019961959,0.015398174],"study_design_scores_gemma":[0.000026504391,0.000027648106,0.00028852827,0.00007307943,0.000014768259,0.00062950596,0.0002914064,0.007405307,0.0041681062,0.9161295,0.07091772,0.000027864395],"about_ca_topic_score_codex":0.0008886462,"about_ca_topic_score_gemma":0.0009217242,"teacher_disagreement_score":0.015523799,"about_ca_system_score_codex":0.0010622937,"about_ca_system_score_gemma":0.0006014171,"threshold_uncertainty_score":0.051932275},"labels":[],"label_agreement":null},{"id":"W2151985067","doi":"10.1007/978-3-540-31807-1_23","title":"Constraint-Based Melody Representation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Constraint (computer-aided design); Key (lock); Representation (politics); Interval (graph theory); Context (archaeology); Speech recognition; Singing; Factor (programming language); Artificial intelligence; Mathematics; Programming language","score_opus":0.02441399699700177,"score_gpt":0.2688557407626647,"score_spread":0.24444174376566294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151985067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026394108,0.00016185344,0.9881391,0.00005497802,0.00004388655,0.00004491384,0.00026875443,0.0013422882,0.007304774],"genre_scores_gemma":[0.17412426,0.0005044677,0.80570334,0.00010174655,0.000073464566,0.00018206652,0.0026859783,0.00088885403,0.015735758],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960667,0.00007864092,0.000030925163,0.00008782471,0.00015798215,0.000037852093],"domain_scores_gemma":[0.9995646,0.00014807725,0.000024097268,0.000121187215,0.0001230251,0.00001911831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042665968,0.0007717181,0.0007248012,0.00080833974,0.0004744839,0.0016643355,0.0021314886,0.0006710719,0.018538633],"category_scores_gemma":[0.0017684234,0.0004297237,0.0008242865,0.0012402086,0.00054058654,0.0018228325,0.0013942245,0.0012096778,0.0041403826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039510347,0.00010116737,0.00024028761,0.00041897898,0.00008495797,0.00021291806,0.00020704934,0.10445101,0.041606955,0.15126483,0.01774012,0.68327665],"study_design_scores_gemma":[0.000051338513,0.00005360481,0.00020196183,0.00005756268,0.0000446743,0.00017815217,0.000088966444,0.8837764,0.014923805,0.070480935,0.030105479,0.000037042722],"about_ca_topic_score_codex":0.0028878695,"about_ca_topic_score_gemma":0.003572089,"teacher_disagreement_score":0.018538633,"about_ca_system_score_codex":0.0004179404,"about_ca_system_score_gemma":0.0005965266,"threshold_uncertainty_score":0.062017858},"labels":[],"label_agreement":null},{"id":"W2152027696","doi":"10.1007/978-3-642-24500-8_30","title":"The Looking Glass: Visually Projecting Yourself to the Past","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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 Calgary","funders":"","keywords":"Documentation; Computer science; Human–computer interaction; Multimedia; Visual arts; Programming language; Art","score_opus":0.02692575523886601,"score_gpt":0.2822986820291171,"score_spread":0.2553729267902511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152027696","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10433212,0.016287515,0.20198849,0.015671864,0.00787952,0.00011594896,0.00075621775,0.0049483115,0.64802],"genre_scores_gemma":[0.5797116,0.011881286,0.101768754,0.0041236314,0.00073422346,0.00015403947,0.00056741264,0.0025418503,0.29851723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999149,0.000027555878,0.0000018983335,0.000017374387,0.000021408701,0.000016807615],"domain_scores_gemma":[0.9997886,0.00007909837,0.000012637189,0.000029814923,0.000029397675,0.000060449456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021830929,0.0006402724,0.00021881859,0.00044589626,0.0013462129,0.0031744023,0.00068904564,0.0010975819,0.026559321],"category_scores_gemma":[0.0013932468,0.0003481245,0.00054658484,0.0003943141,0.0017255733,0.004496928,0.002856178,0.0016488832,0.004873542],"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.00063470704,0.00008202233,0.002623029,0.00088550994,0.00007678744,0.002053242,0.075060956,0.0019246914,0.0377757,0.16034389,0.36030972,0.35822973],"study_design_scores_gemma":[0.000069835456,0.0002994686,0.0053109345,0.0013116307,0.00011376502,0.0034682974,0.047261935,0.005824913,0.0064078383,0.13372643,0.7959474,0.00025747158],"about_ca_topic_score_codex":0.0034759673,"about_ca_topic_score_gemma":0.0065421807,"teacher_disagreement_score":0.026559321,"about_ca_system_score_codex":0.00029537248,"about_ca_system_score_gemma":0.0006223082,"threshold_uncertainty_score":0.08884978},"labels":[],"label_agreement":null},{"id":"W2152039024","doi":"10.1007/11534310_106","title":"A Privacy Enhanced Role-Based Access Control Model for Enterprises","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Regina; Toronto Metropolitan University","funders":"","keywords":"Role-based access control; Computer science; Access control; Computer security; Information flow; Invocation; Argument (complex analysis); Information sensitivity; Hierarchy; Mandatory access control; Key (lock); Information privacy; Privacy software; Law","score_opus":0.028728741647433848,"score_gpt":0.28942988582738455,"score_spread":0.2607011441799507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152039024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00798042,0.00011403701,0.9839893,0.00063663,0.00005625196,0.00014038503,0.00017554773,0.0005741422,0.0063333],"genre_scores_gemma":[0.60146296,0.00038051396,0.37983322,0.00037717365,0.00012105043,0.00050624995,0.00046810738,0.00014138618,0.016709358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610114,0.0012742445,0.00032832343,0.00059368403,0.0013092856,0.0003933795],"domain_scores_gemma":[0.99716836,0.00095143873,0.0002041803,0.0009926097,0.00046602477,0.00021738092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039021128,0.00064078526,0.0008037811,0.0007274828,0.0010315311,0.0044155265,0.003285009,0.002481187,0.0045443103],"category_scores_gemma":[0.004672568,0.0005977306,0.0014855971,0.0009428351,0.0022042664,0.0082502095,0.0025847699,0.0039859125,0.0013881279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012557354,0.000104822815,0.00021713867,0.00006311128,0.000022414795,0.00016628146,0.00028893416,0.039050333,0.0035196668,0.940108,0.0016488874,0.014684879],"study_design_scores_gemma":[0.00009615438,0.000107279324,0.000117256415,0.000036525333,0.00005635481,0.00021350081,0.000089151676,0.46918678,0.0042080414,0.51123595,0.014605935,0.00004712709],"about_ca_topic_score_codex":0.0029230593,"about_ca_topic_score_gemma":0.0021744808,"teacher_disagreement_score":0.0045443103,"about_ca_system_score_codex":0.0014863365,"about_ca_system_score_gemma":0.0020625826,"threshold_uncertainty_score":0.020636559},"labels":[],"label_agreement":null},{"id":"W2152067717","doi":"10.1007/3-540-44864-0_74","title":"3D Visualization of Complex Surfaces Using Dynamic Delaunay Tessellation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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 Calgary","funders":"","keywords":"Delaunay triangulation; Computer science; Visualization; Computer graphics (images); Skeletonization; Rendering (computer graphics); Computer graphics; Voronoi diagram; Data visualization; Scientific visualization; Bowyer–Watson algorithm; Tessellation (computer graphics); Artificial intelligence; Algorithm","score_opus":0.031099158771494197,"score_gpt":0.3100874185907443,"score_spread":0.2789882598192501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152067717","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.031778503,0.0008375363,0.9526345,0.0003955551,0.00010426602,0.000048402646,0.00039703073,0.0044554225,0.009348772],"genre_scores_gemma":[0.29052365,0.0019258192,0.6984525,0.00014518827,0.0000901131,0.0001478666,0.00077411556,0.0018758539,0.0060649267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997441,0.000041896255,0.000012661718,0.000029544737,0.00013973186,0.000032143813],"domain_scores_gemma":[0.99950624,0.00024363544,0.000030008208,0.00007636776,0.000100010104,0.000043780354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022364035,0.001007895,0.0008732321,0.0010804423,0.00048644337,0.0021344675,0.00083313027,0.0006437003,0.010540469],"category_scores_gemma":[0.0009287582,0.000710168,0.00070835016,0.0009836738,0.00042238383,0.0014079704,0.002311655,0.000996573,0.0011302533],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004368721,0.000112034446,0.0015587172,0.00077098946,0.0001641118,0.0006964034,0.0022163317,0.27509788,0.15176173,0.06405993,0.029872166,0.47325277],"study_design_scores_gemma":[0.00006128983,0.000059366535,0.00092159695,0.00011032443,0.000038650807,0.0007943651,0.00031063167,0.88735396,0.033371076,0.027495664,0.04938609,0.00009703071],"about_ca_topic_score_codex":0.0029950594,"about_ca_topic_score_gemma":0.0037842153,"teacher_disagreement_score":0.010540469,"about_ca_system_score_codex":0.0005505744,"about_ca_system_score_gemma":0.00045721914,"threshold_uncertainty_score":0.035261333},"labels":[],"label_agreement":null},{"id":"W2152125436","doi":"10.1007/11559573_122","title":"A Narrow-Band Level-Set Method with Dynamic Velocity for Neural Stem Cell Cluster Segmentation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Set (abstract data type); Cluster (spacecraft); Segmentation; Neural stem cell; Computer science; Level set (data structures); Artificial intelligence; Pattern recognition (psychology); Stem cell; Biology; Cell biology","score_opus":0.028489496141003032,"score_gpt":0.30564687059436246,"score_spread":0.2771573744533594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152125436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018799088,0.000059563972,0.99718374,0.000039554914,0.000019251695,0.000027113536,0.000021326723,0.000431827,0.00033762414],"genre_scores_gemma":[0.03515772,0.00010210729,0.9625937,0.00006680878,0.000019911276,0.00015422211,0.0001245875,0.00028558535,0.0014953503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996487,0.00007073214,0.000024179017,0.00005198428,0.00017192194,0.00003243292],"domain_scores_gemma":[0.99937207,0.00029718166,0.000035802655,0.00005697046,0.00019048252,0.00004749486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011303626,0.00074335566,0.0013183829,0.0012245266,0.00065048196,0.001411746,0.0028693571,0.0020923256,0.003831273],"category_scores_gemma":[0.00199734,0.0011191149,0.0011934646,0.0010717185,0.0006282314,0.0009033022,0.0013518165,0.0016751544,0.0012438281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020933553,0.00013595786,0.000535051,0.0002045687,0.00013265107,0.00009732635,0.00013597356,0.55601794,0.025840161,0.01433656,0.004730124,0.39762437],"study_design_scores_gemma":[0.0000049038435,0.0000064012484,0.000033877786,0.0000031961326,0.000005771476,0.000010159518,0.0000027648357,0.99738973,0.0012529978,0.0008616164,0.00042399584,0.0000046479204],"about_ca_topic_score_codex":0.0067932517,"about_ca_topic_score_gemma":0.0076200054,"teacher_disagreement_score":0.0067932517,"about_ca_system_score_codex":0.0009429353,"about_ca_system_score_gemma":0.001992539,"threshold_uncertainty_score":0.013507426},"labels":[],"label_agreement":null},{"id":"W2152178992","doi":"10.1007/11422778_8","title":"Batch Scheduling Algorithms for Optical Burst Switching Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Reservation; Scheduling (production processes); Distributed computing; Real-time computing; Dynamic priority scheduling; Algorithm; Computer network; Parallel computing; Mathematical optimization; Quality of service; Mathematics","score_opus":0.014602224415486498,"score_gpt":0.24447995890209123,"score_spread":0.22987773448660473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152178992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010302296,0.0010385148,0.98162764,0.00035991633,0.0004427106,0.00012881978,0.00017723552,0.00092938135,0.004993471],"genre_scores_gemma":[0.26381013,0.0019666245,0.7035437,0.0003526429,0.00081118237,0.0005103882,0.0008910812,0.00068976707,0.027424457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930084,0.00019916592,0.00004039388,0.00011484649,0.0002460023,0.0000987552],"domain_scores_gemma":[0.99840444,0.0009512673,0.00008649496,0.00023373269,0.00024233117,0.00008176202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019694497,0.0011435366,0.0013730818,0.0006344873,0.0008778885,0.001321359,0.0026696902,0.0009492808,0.005402102],"category_scores_gemma":[0.0040965877,0.0008637423,0.00049957883,0.0016243653,0.0006497106,0.0021934772,0.0008643693,0.0022309483,0.0011415102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011338914,0.00034176727,0.00025649014,0.00029502175,0.00006251915,0.00004081474,0.00014756194,0.512145,0.009985206,0.09925573,0.03469365,0.34164232],"study_design_scores_gemma":[0.00008142686,0.000057954785,0.0000772865,0.000011412333,0.000009588077,0.000009087709,0.000010566395,0.949381,0.0012564779,0.046650272,0.002444056,0.000010883059],"about_ca_topic_score_codex":0.004836125,"about_ca_topic_score_gemma":0.0039990777,"teacher_disagreement_score":0.005402102,"about_ca_system_score_codex":0.0017568358,"about_ca_system_score_gemma":0.0016986926,"threshold_uncertainty_score":0.01807177},"labels":[],"label_agreement":null},{"id":"W2152272665","doi":"10.1007/978-3-540-45227-0_72","title":"Using User Access Patterns for Semantic Query Caching","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Query optimization; Query language; Web query classification; Query expansion; Sargable; Web search query; Information retrieval; Semantic query; Cache; Selection (genetic algorithm); Online aggregation; RDF query language; Database query; Search engine; Artificial intelligence; Computer network","score_opus":0.05447718944837764,"score_gpt":0.2942570346944909,"score_spread":0.23977984524611323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152272665","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.065442674,0.00048177264,0.9149318,0.00051009835,0.000099083954,0.0001441766,0.0006039361,0.013603325,0.004183094],"genre_scores_gemma":[0.5611096,0.00045773826,0.4315026,0.00021082291,0.000094595656,0.00014034903,0.0012552332,0.0017316461,0.0034975023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676466,0.000821241,0.00038509333,0.00043950463,0.0013104252,0.00027907698],"domain_scores_gemma":[0.9848577,0.0057152514,0.00074211886,0.0067212773,0.0016135466,0.00035003817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034968657,0.001009347,0.0015517598,0.0024280907,0.0011271863,0.0037291113,0.0019974103,0.0013481419,0.0031845353],"category_scores_gemma":[0.019378394,0.0011787433,0.0009721151,0.0042310087,0.0013938268,0.01017686,0.0020493828,0.0019311135,0.0008515782],"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.0022400746,0.00070395076,0.01955349,0.0004940923,0.00026074226,0.0004106322,0.0012852282,0.03784308,0.034462333,0.12497264,0.020628596,0.7571452],"study_design_scores_gemma":[0.00012584381,0.00017459341,0.0019368333,0.00006716402,0.0002625125,0.00078313187,0.00028763784,0.8035125,0.054722156,0.121127926,0.016871275,0.00012837788],"about_ca_topic_score_codex":0.0061547565,"about_ca_topic_score_gemma":0.00930493,"teacher_disagreement_score":0.0061547565,"about_ca_system_score_codex":0.0012087937,"about_ca_system_score_gemma":0.0014451307,"threshold_uncertainty_score":0.018493414},"labels":[],"label_agreement":null},{"id":"W2152283194","doi":"10.1007/978-3-540-72990-7_14","title":"A Robust Routing Plan to Optimize Throughput in Core Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality of service; Benchmark (surveying); Distributed computing; Routing (electronic design automation); Criticality; Static routing; Path (computing); Shortest path problem; Equal-cost multi-path routing; Computer network; Traffic engineering; Throughput; Core (optical fiber); Graph; Routing protocol; Theoretical computer science","score_opus":0.04606247519529978,"score_gpt":0.2517556950536331,"score_spread":0.20569321985833333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152283194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026194738,0.00017363095,0.9686414,0.00015332657,0.000052612402,0.00008634389,0.00011003277,0.0010665123,0.0035214801],"genre_scores_gemma":[0.5816429,0.00023170478,0.41331923,0.00010587418,0.00006826317,0.00021934751,0.00024526758,0.00036643384,0.0038009312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995977,0.00011399073,0.000018518931,0.00007315067,0.00011236762,0.00008432955],"domain_scores_gemma":[0.99943846,0.00025038302,0.00006826277,0.00007890932,0.00011856608,0.0000454059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910083,0.0010674406,0.0010101055,0.00064417906,0.00046511376,0.000850116,0.0013219808,0.0009255167,0.0028182678],"category_scores_gemma":[0.0022402925,0.00061333505,0.00049562403,0.0006703933,0.00068295444,0.0010128138,0.00093723735,0.00096598134,0.00037166208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011286486,0.000036820857,0.00013105993,0.00003356784,0.000018440925,0.0000308156,0.000031712578,0.9399184,0.0041805287,0.013796871,0.0020375582,0.039671376],"study_design_scores_gemma":[0.000008339249,0.000035976576,0.00003178433,0.0000025425654,0.000005754523,0.000006165071,0.000004677957,0.99457955,0.0005439668,0.00460174,0.00017626339,0.0000032490645],"about_ca_topic_score_codex":0.002201356,"about_ca_topic_score_gemma":0.0026186598,"teacher_disagreement_score":0.0028182678,"about_ca_system_score_codex":0.0009341879,"about_ca_system_score_gemma":0.0012218405,"threshold_uncertainty_score":0.009428024},"labels":[],"label_agreement":null},{"id":"W2152325113","doi":"10.1007/3-540-45153-6_7","title":"Concept-Learning in the Presence of Between-Class and Within-Class Imbalances","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":136,"is_retracted":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":"Computer science; Class (philosophy); Focus (optics); Sampling (signal processing); Artificial intelligence; Mechanism (biology); Order (exchange); Machine learning; Theoretical computer science; Epistemology; Telecommunications","score_opus":0.02099275441995642,"score_gpt":0.2643135857297962,"score_spread":0.24332083130983978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152325113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038967334,0.0013289729,0.9569432,0.0008367594,0.00014746952,0.000058545247,0.00010447186,0.00029672758,0.001316538],"genre_scores_gemma":[0.5945489,0.0012596913,0.39721617,0.00050038606,0.0009775887,0.00034028894,0.0006887812,0.00020695564,0.004261263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919891,0.0037229822,0.00041689994,0.0014814093,0.0019425701,0.00044711313],"domain_scores_gemma":[0.90931934,0.08008317,0.0023635786,0.0039001598,0.0033595243,0.000974307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026441028,0.0010885613,0.0031172228,0.0017509934,0.001247521,0.0035103823,0.00368997,0.002514319,0.0015595447],"category_scores_gemma":[0.072056375,0.0011597847,0.0010368855,0.0027652713,0.002224645,0.010309823,0.00505912,0.005573648,0.0004887932],"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.0010322221,0.00037503344,0.009493275,0.00069688854,0.0004154691,0.00073152495,0.0012629074,0.3135857,0.0028451807,0.15581559,0.010159822,0.5035863],"study_design_scores_gemma":[0.000032859272,0.00004997532,0.0005368082,0.000020564376,0.000030684867,0.0001357421,0.00006362559,0.8724151,0.00076122204,0.1250221,0.0009152671,0.000016118674],"about_ca_topic_score_codex":0.001250955,"about_ca_topic_score_gemma":0.0011848193,"teacher_disagreement_score":0.026441028,"about_ca_system_score_codex":0.0012216002,"about_ca_system_score_gemma":0.001240634,"threshold_uncertainty_score":0.13983518},"labels":[],"label_agreement":null},{"id":"W2152337449","doi":"10.1007/978-3-540-74835-9_24","title":"Graphical Password Authentication Using Cued Click Points","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":340,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cued speech; Password; Point (geometry); Usability; Image (mathematics); Authentication (law); Workload; Computer vision; Computer security; Artificial intelligence; Human–computer interaction; Operating system; Mathematics","score_opus":0.04030825148284347,"score_gpt":0.2915846542011033,"score_spread":0.25127640271825985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152337449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04142213,0.0014855557,0.8726802,0.00029501528,0.00089347386,0.0003971845,0.00060142146,0.043541163,0.038683925],"genre_scores_gemma":[0.7421219,0.0013489224,0.19827819,0.00053018593,0.00023895105,0.00024066171,0.0008468667,0.0009246999,0.05546972],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899095,0.00016175896,0.00006097804,0.00019491954,0.00041992107,0.00017143256],"domain_scores_gemma":[0.9985152,0.00040180984,0.0001085916,0.00053176,0.00033170264,0.00011096383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046206565,0.0015100776,0.0010626895,0.0010968717,0.0005600383,0.0015601803,0.0014788897,0.0015033402,0.03887947],"category_scores_gemma":[0.0030513764,0.00053146505,0.00054861227,0.00083503535,0.00047355107,0.0024338865,0.0025326996,0.0011630788,0.01907297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032036647,0.00035333532,0.00095270696,0.00075643015,0.00007472333,0.0010159785,0.00026836814,0.0037100199,0.21935873,0.019113725,0.037091125,0.7141012],"study_design_scores_gemma":[0.00045966505,0.002145934,0.0038583698,0.0005218343,0.00029547198,0.0070195207,0.00024805657,0.24884441,0.5819993,0.020478094,0.13373217,0.00039715535],"about_ca_topic_score_codex":0.00060284865,"about_ca_topic_score_gemma":0.00075208,"teacher_disagreement_score":0.03887947,"about_ca_system_score_codex":0.00032502715,"about_ca_system_score_gemma":0.00034158299,"threshold_uncertainty_score":0.13006485},"labels":[],"label_agreement":null},{"id":"W2152434295","doi":"10.1007/3-540-45995-2_42","title":"On the Spanning Ratio of Gabriel Graphs and β-skeletons","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University; Carleton University","funders":"","keywords":"Combinatorics; Spanning tree; Spanner; Minimum spanning tree; Mathematics; Euclidean geometry; Delaunay triangulation; Euclidean minimum spanning tree; Minimum degree spanning tree; Graph; Discrete mathematics; Computer science; Geometry","score_opus":0.019683777115230446,"score_gpt":0.23207563186094182,"score_spread":0.21239185474571137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152434295","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.5599381,0.01675416,0.19024058,0.0026946974,0.0005361824,0.000108018496,0.0009134079,0.0006200416,0.22819483],"genre_scores_gemma":[0.91304696,0.010466935,0.05057519,0.0005157256,0.0009007182,0.00013491369,0.00096095575,0.00057298224,0.022825612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927586,0.00021694286,0.00004035583,0.00016063047,0.00021741675,0.00008883014],"domain_scores_gemma":[0.9959031,0.0027606385,0.00046231638,0.00019638891,0.0003529254,0.00032465757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014327604,0.0013959728,0.0012323997,0.0065877084,0.0011661318,0.0026573287,0.0019053265,0.0012373197,0.009790682],"category_scores_gemma":[0.010048004,0.0008953242,0.0007453507,0.004140296,0.002467977,0.004848257,0.0017265395,0.0022702387,0.0014509239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012264294,0.000043791617,0.0011072911,0.00021593423,0.000033477434,0.000117274285,0.0004410548,0.010929769,0.0029839533,0.92822593,0.005559569,0.050219256],"study_design_scores_gemma":[0.000018619043,0.000046289857,0.001544729,0.00008622291,0.000044905137,0.00042444008,0.00028035723,0.033926554,0.0011786523,0.9560844,0.0063371253,0.000027757775],"about_ca_topic_score_codex":0.0014061875,"about_ca_topic_score_gemma":0.001094896,"teacher_disagreement_score":0.009790682,"about_ca_system_score_codex":0.0011723466,"about_ca_system_score_gemma":0.00025911722,"threshold_uncertainty_score":0.03275311},"labels":[],"label_agreement":null},{"id":"W2152436566","doi":"10.1007/3-540-44886-1_34","title":"Formal Theory for Describing Action Concepts in Terminological Knowledge Bases","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Manitoba","funders":"","keywords":"Computer science; Precondition; Notation; Object (grammar); Action (physics); Action theory (sociology); Taxonomy (biology); Relation (database); Extensional definition; Theoretical computer science; Artificial intelligence; Programming language; Epistemology; Mathematics; Data mining","score_opus":0.08697123633195086,"score_gpt":0.3143453539604392,"score_spread":0.22737411762848836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152436566","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.0015300572,0.00079120067,0.9877973,0.0006384361,0.00019153769,0.00010484865,0.00040804126,0.00040773532,0.008130855],"genre_scores_gemma":[0.11657762,0.002117178,0.8661658,0.0007750694,0.0004602758,0.0011677501,0.002726065,0.0003510856,0.009659252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960532,0.0010765716,0.0007616158,0.0004570059,0.0013226949,0.0003288864],"domain_scores_gemma":[0.99555135,0.0027155941,0.00023636008,0.00069744716,0.0006623925,0.00013689038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050957166,0.0014586805,0.0015265536,0.005270728,0.002863287,0.0072506517,0.0054978426,0.0034485792,0.008539432],"category_scores_gemma":[0.008652894,0.0018433549,0.0035577335,0.006259328,0.0069828676,0.017886762,0.003172862,0.006501516,0.002819843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008514411,0.000014559671,0.000037702874,0.00009896479,0.000013837744,0.000043235792,0.00021565575,0.002519437,0.00017852915,0.98688006,0.001245344,0.00874398],"study_design_scores_gemma":[0.000014847351,0.000007826616,0.000024561175,0.00007963757,0.000038910912,0.000057720332,0.0000876973,0.016375313,0.0005125698,0.96944225,0.01334312,0.00001555265],"about_ca_topic_score_codex":0.0056191785,"about_ca_topic_score_gemma":0.0049563367,"teacher_disagreement_score":0.008539432,"about_ca_system_score_codex":0.004166264,"about_ca_system_score_gemma":0.0032570548,"threshold_uncertainty_score":0.030228496},"labels":[],"label_agreement":null},{"id":"W2152515727","doi":"10.1007/978-3-319-24258-3_5","title":"Evaluation of Expert-Based Q-Matrices Predictive Quality in Matrix Factorization Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"National Research Council Canada","keywords":"Computer science; Matrix decomposition; Recommender system; Collaborative filtering; Machine learning; Artificial intelligence; Key (lock); Matrix (chemical analysis); Quality (philosophy); Data mining; Factorization; Algorithm","score_opus":0.10740618159850972,"score_gpt":0.3610080678437402,"score_spread":0.25360188624523045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152515727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36002594,0.0037892228,0.62382966,0.0009176231,0.00034156235,0.00058644486,0.001015815,0.0017453212,0.007748425],"genre_scores_gemma":[0.85050344,0.00034594611,0.14643927,0.00014909482,0.000064417625,0.00016638743,0.0012603311,0.00012935844,0.00094174687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98277587,0.011168693,0.00080099405,0.0017510925,0.0031208044,0.0003826166],"domain_scores_gemma":[0.842313,0.12620428,0.0037778313,0.008664201,0.017757814,0.0012829016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036711194,0.0015812884,0.0014656493,0.002702123,0.0009840679,0.0022240586,0.0019250547,0.0026452874,0.0022116357],"category_scores_gemma":[0.14193788,0.00045780482,0.0008779061,0.0019492722,0.0013361762,0.0036907801,0.0017942702,0.0019098888,0.000635531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023279141,0.00075695466,0.034911674,0.0006989999,0.00077984954,0.00018921736,0.000841411,0.69781214,0.0025883738,0.01114571,0.0055002626,0.24244744],"study_design_scores_gemma":[0.000065670945,0.00031197685,0.0038850035,0.000053162275,0.000057794507,0.000059410228,0.00008187571,0.9905896,0.0012867738,0.0029946805,0.00057931064,0.000034726698],"about_ca_topic_score_codex":0.012136687,"about_ca_topic_score_gemma":0.008520696,"teacher_disagreement_score":0.036711194,"about_ca_system_score_codex":0.0015109004,"about_ca_system_score_gemma":0.0014010378,"threshold_uncertainty_score":0.19414973},"labels":[],"label_agreement":null},{"id":"W2152637167","doi":"10.1007/978-3-540-92185-1_55","title":"Efficiency, Fairness and Competitiveness in Nash Bargaining Games","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bargaining problem; Mathematical economics; Nash equilibrium; Class (philosophy); Computer science; Property (philosophy); Game theory; Mathematical optimization; Microeconomics; Mathematics; Economics; Artificial intelligence","score_opus":0.04870399202765213,"score_gpt":0.31960528577446795,"score_spread":0.2709012937468158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152637167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095354475,0.008589597,0.5767647,0.006577957,0.0006710002,0.00018099607,0.00017251933,0.00014489851,0.31154382],"genre_scores_gemma":[0.89157206,0.003630318,0.07171763,0.000442437,0.0010666369,0.00045481938,0.00015477683,0.000121592464,0.03083974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372876,0.003344538,0.00027685167,0.00069317553,0.0012753517,0.0006813139],"domain_scores_gemma":[0.99177635,0.0066979122,0.00034014412,0.00044909198,0.00045343747,0.0002830577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007607806,0.001159402,0.0020187632,0.0012338674,0.0018186244,0.007272875,0.0023681757,0.0026105088,0.0047594444],"category_scores_gemma":[0.01595049,0.0007779151,0.0011554115,0.0023130015,0.008317229,0.008623314,0.002355149,0.0041277735,0.0007290248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004101915,0.000020395713,0.00012631896,0.000040947038,0.000013048152,0.000017066155,0.00013241409,0.005563478,0.00017416528,0.9865589,0.00090615975,0.006406129],"study_design_scores_gemma":[0.000013502275,0.000010835671,0.00013853822,0.000012153524,0.0000071694108,0.000020992578,0.000046607485,0.006890959,0.00010315817,0.9911283,0.0016200992,0.0000075410217],"about_ca_topic_score_codex":0.0018060387,"about_ca_topic_score_gemma":0.0015163898,"teacher_disagreement_score":0.007607806,"about_ca_system_score_codex":0.0031323528,"about_ca_system_score_gemma":0.0028610458,"threshold_uncertainty_score":0.040234387},"labels":[],"label_agreement":null},{"id":"W2152831615","doi":"10.1007/978-3-642-39712-7_6","title":"Improving the Efficiency of Distributed Data Mining Using an Adjustment Work Flow","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Calgary","funders":"","keywords":"Computer science; Data mining; Work (physics); Work flow; Set (abstract data type); Data flow diagram; Cluster analysis; Extension (predicate logic); Data set; Information flow; Flow (mathematics); Industrial engineering; Artificial intelligence; Database","score_opus":0.04298936272471931,"score_gpt":0.26897268766176474,"score_spread":0.22598332493704543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152831615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024093142,0.00026877763,0.9688693,0.0002765653,0.000120515746,0.00014424878,0.00009521087,0.004784632,0.0013476242],"genre_scores_gemma":[0.22084329,0.00015343071,0.7747217,0.00015874211,0.00011528685,0.00021008446,0.00034255415,0.00043912543,0.0030157864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708956,0.0007929523,0.0002775388,0.0007497333,0.00082812284,0.0002621415],"domain_scores_gemma":[0.99125624,0.003972102,0.00037320136,0.0029053728,0.0012096175,0.00028338507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031694255,0.0012654924,0.0017391391,0.001804973,0.0016863967,0.0021704102,0.003926324,0.0010602382,0.0049775466],"category_scores_gemma":[0.01585899,0.00079506857,0.0011787394,0.0032773302,0.0009300205,0.004382328,0.003136866,0.0017345877,0.001785224],"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.0015845484,0.00070647,0.003828394,0.00023618856,0.00012268174,0.00013036806,0.0003701539,0.071487255,0.018741237,0.010767132,0.008250472,0.8837751],"study_design_scores_gemma":[0.00022995418,0.00019941514,0.0009221232,0.00002158252,0.00007189372,0.00011943389,0.00010426642,0.95631003,0.01517867,0.02252085,0.0042875493,0.000034333807],"about_ca_topic_score_codex":0.003918362,"about_ca_topic_score_gemma":0.0032174613,"teacher_disagreement_score":0.0049775466,"about_ca_system_score_codex":0.00090479496,"about_ca_system_score_gemma":0.0028717825,"threshold_uncertainty_score":0.01676178},"labels":[],"label_agreement":null},{"id":"W2152878344","doi":"10.1007/3-540-44886-1_52","title":"A New Inference Axiom for Probabilistic Conditional Independence","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Hypergraph; Inference; Axiom; Conditional independence; Probabilistic logic; Computer science; Theoretical computer science; Independence (probability theory); Mathematics; Graph; Algorithm; Axiom independence; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.03206287091481262,"score_gpt":0.27642466531079957,"score_spread":0.24436179439598693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152878344","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.0012572693,0.0005666773,0.9711558,0.0027617342,0.00059006875,0.00004137378,0.0004757762,0.00027896144,0.022872264],"genre_scores_gemma":[0.14056556,0.0031518065,0.81423384,0.007097391,0.00478301,0.00094160414,0.0024552569,0.00075453153,0.02601712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928423,0.0021788746,0.0007369692,0.0018339148,0.0020850308,0.00032285243],"domain_scores_gemma":[0.98356485,0.010746503,0.00056670996,0.0022983449,0.0024764845,0.00034722593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008938846,0.0013363404,0.0017681303,0.003182933,0.0030225466,0.0049620825,0.0038952427,0.004013342,0.0145639395],"category_scores_gemma":[0.024132708,0.0023138314,0.0041059344,0.003265614,0.0073542316,0.01961154,0.004954907,0.014576289,0.004074524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007091142,0.000008768759,0.00008303159,0.000047056546,0.000015755102,0.00004072335,0.00013673103,0.00053338765,0.00015306372,0.9859871,0.0034747957,0.009512532],"study_design_scores_gemma":[0.000008124143,0.0000038778253,0.00005472985,0.00002263112,0.000017134342,0.00013110277,0.000015865866,0.0034780516,0.00015006687,0.9879808,0.00812394,0.0000136286],"about_ca_topic_score_codex":0.0018336402,"about_ca_topic_score_gemma":0.0015968932,"teacher_disagreement_score":0.0145639395,"about_ca_system_score_codex":0.0017476602,"about_ca_system_score_gemma":0.0019282677,"threshold_uncertainty_score":0.048721254},"labels":[],"label_agreement":null},{"id":"W2152896605","doi":"10.1007/978-3-642-04271-3_79","title":"Intra-retinal Layer Segmentation in Optical Coherence Tomography Using an Active Contour Approach","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":98,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; McGill University; Michael Smith Health Research BC; California HIV/AIDS Research Program","keywords":"Optical coherence tomography; Computer science; Artificial intelligence; Segmentation; Retinal; Computer vision; Pattern recognition (psychology); Active contour model; Glaucoma; Contrast (vision); Image segmentation; Optics; Physics; Ophthalmology","score_opus":0.025965448620848496,"score_gpt":0.31540747274582204,"score_spread":0.28944202412497355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152896605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013140156,0.00028932307,0.9856021,0.000083121544,0.000018147217,0.00004435107,0.000031885218,0.00041764244,0.00037336609],"genre_scores_gemma":[0.122148834,0.0004638596,0.8757671,0.000053383243,0.000027393698,0.000087892884,0.00009509787,0.00029057078,0.0010657774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954516,0.000120001576,0.000039064205,0.00008347497,0.0001670843,0.000045252655],"domain_scores_gemma":[0.9986853,0.00079787977,0.00012146285,0.00012707208,0.0002220831,0.000046300596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013694682,0.00095885986,0.0011156162,0.0019467061,0.0006221297,0.0020314017,0.0013142476,0.0021136305,0.0011024321],"category_scores_gemma":[0.00321379,0.0014239887,0.0012130967,0.0015046132,0.0005910018,0.0016848769,0.0010788518,0.0011391003,0.00044321612],"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.0006435683,0.00016966395,0.0026535164,0.00039566203,0.00014949034,0.00022555068,0.00056840957,0.25207436,0.0983657,0.010680604,0.0018418736,0.6322316],"study_design_scores_gemma":[0.000012482294,0.000023793891,0.00044670323,0.000016296195,0.000028555638,0.00007196668,0.000018425779,0.98473525,0.011836384,0.001892414,0.00089963933,0.000018050929],"about_ca_topic_score_codex":0.004791816,"about_ca_topic_score_gemma":0.0061134733,"teacher_disagreement_score":0.004791816,"about_ca_system_score_codex":0.0006950039,"about_ca_system_score_gemma":0.0013676846,"threshold_uncertainty_score":0.009527862},"labels":[],"label_agreement":null},{"id":"W2153113544","doi":"10.1007/978-3-642-54423-1_45","title":"Semantic Word Cloud Representations: Hardness and Approximation Algorithms","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Adjacency list; Combinatorics; Bounded function; Vertex (graph theory); Theoretical computer science; Discrete mathematics; Algorithm; Graph; Mathematics","score_opus":0.019508694708693222,"score_gpt":0.2656033699389722,"score_spread":0.246094675230279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153113544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048629116,0.003219812,0.9253483,0.0036640365,0.00043867514,0.00022588363,0.0035488969,0.002975581,0.011949711],"genre_scores_gemma":[0.45438772,0.0045650266,0.50506157,0.0010178125,0.0010996029,0.0007015101,0.013968049,0.0013056159,0.017893199],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976248,0.00039317872,0.00021190873,0.0005719675,0.00087196124,0.00032611706],"domain_scores_gemma":[0.9944348,0.003022376,0.00032942818,0.0015539575,0.00046663784,0.00019289256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017658544,0.0016282597,0.0030309414,0.0024488368,0.0015466278,0.0064475676,0.0045873923,0.0033206728,0.012569706],"category_scores_gemma":[0.01374642,0.0012928206,0.0026456572,0.008073779,0.001820708,0.017123742,0.004270428,0.006446044,0.0031376923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077527104,0.0004571945,0.001215962,0.00073941087,0.00014663237,0.00016653523,0.0003381996,0.14095022,0.0024548785,0.29451445,0.068916574,0.48932478],"study_design_scores_gemma":[0.00006334043,0.000032524422,0.00027338663,0.000066736924,0.000047234465,0.00015709983,0.00012583996,0.41875294,0.0012353087,0.5743063,0.004920319,0.00001890059],"about_ca_topic_score_codex":0.004863931,"about_ca_topic_score_gemma":0.005526371,"teacher_disagreement_score":0.012569706,"about_ca_system_score_codex":0.0031983836,"about_ca_system_score_gemma":0.0027108828,"threshold_uncertainty_score":0.042049825},"labels":[],"label_agreement":null},{"id":"W2153145027","doi":"10.1007/978-3-540-24840-8_21","title":"The Structural Model Interpretation of the NESS Test","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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 Saskatchewan","funders":"","keywords":"Causation; Counterfactual thinking; Overdetermination; Counterfactual conditional; Causality (physics); Counterintuitive; Test (biology); Interpretation (philosophy); Attribution; Epistemology; Psychology; Conformity; Causal model; Analogy; Mathematics; Social psychology; Philosophy; Statistics; Linguistics","score_opus":0.009563536490076534,"score_gpt":0.24650943021512847,"score_spread":0.23694589372505193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153145027","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.11489838,0.0008533451,0.7216152,0.015332932,0.0008684369,0.00016239838,0.0013599733,0.00064034824,0.144269],"genre_scores_gemma":[0.9560687,0.00041238635,0.026151454,0.0015464977,0.00061996473,0.00022625577,0.0008491509,0.00023455883,0.013890962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932586,0.003672203,0.00027966662,0.0011312087,0.0011326574,0.00052563165],"domain_scores_gemma":[0.9552816,0.03394412,0.0026981877,0.005124046,0.0021908586,0.00076105184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011598931,0.0010021625,0.0018672459,0.0021164748,0.0011505587,0.0022428806,0.0027948031,0.0036878511,0.03191156],"category_scores_gemma":[0.073453106,0.0005472038,0.0013860506,0.0012564332,0.006896454,0.008919242,0.0035394027,0.004569971,0.0016261123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012544994,0.00003983456,0.0012522838,0.000080040256,0.000045224257,0.00017710571,0.00009694713,0.007923835,0.0004224556,0.9708307,0.003948636,0.0150575545],"study_design_scores_gemma":[0.000033088472,0.000053842105,0.00059211865,0.000022689968,0.00001167622,0.00009840369,0.000039057824,0.0339907,0.00044611588,0.9634933,0.0012061837,0.000012727713],"about_ca_topic_score_codex":0.00071738206,"about_ca_topic_score_gemma":0.00066646124,"teacher_disagreement_score":0.03191156,"about_ca_system_score_codex":0.0014976127,"about_ca_system_score_gemma":0.0015050826,"threshold_uncertainty_score":0.10675478},"labels":[],"label_agreement":null},{"id":"W2153340200","doi":"10.1007/978-3-642-01957-9_14","title":"A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Computer network; Adversarial system; Wireless ad hoc network; State (computer science); Computer security; Artificial intelligence; Algorithm; Wireless; Medicine; Telecommunications","score_opus":0.01781583462142252,"score_gpt":0.27510878721889387,"score_spread":0.25729295259747137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153340200","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.008000812,0.00091913604,0.97908235,0.00034959926,0.00064994517,0.00033995844,0.00006914886,0.004558999,0.0060301274],"genre_scores_gemma":[0.21025562,0.0014389573,0.7459246,0.00072758866,0.00068709,0.0013004006,0.00059595215,0.0010291014,0.038040806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980064,0.00040736498,0.0002193888,0.00026179664,0.00088599295,0.00021904489],"domain_scores_gemma":[0.99789953,0.0005381998,0.00016235611,0.00084947323,0.0004234927,0.00012691713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018669314,0.00096105173,0.0013136694,0.0011659614,0.0011258229,0.0018352756,0.0030095463,0.0018740989,0.004772735],"category_scores_gemma":[0.0031543826,0.0006040432,0.00072962465,0.0009628476,0.0013441029,0.005767324,0.0030363104,0.0035106458,0.0024122417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010548674,0.00053682737,0.00037638453,0.0007649768,0.00013378245,0.000902309,0.00052328425,0.016891364,0.10607115,0.26791355,0.02793409,0.5768974],"study_design_scores_gemma":[0.0004978285,0.0011769792,0.0007252427,0.0001959434,0.00043824976,0.0033543059,0.00022980006,0.5268282,0.12842883,0.12341907,0.21432577,0.00037986395],"about_ca_topic_score_codex":0.00056880974,"about_ca_topic_score_gemma":0.00064944563,"teacher_disagreement_score":0.004772735,"about_ca_system_score_codex":0.0006224559,"about_ca_system_score_gemma":0.0008688817,"threshold_uncertainty_score":0.015966356},"labels":[],"label_agreement":null},{"id":"W2153360418","doi":"10.1007/978-3-540-77018-3_19","title":"Translation and Rotation Invariant Mining of Frequent Trajectories: Application to Protein Unfolding Pathways","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Translation (biology); Invariant (physics); Wavelet; Rotation (mathematics); Computer science; Transformation (genetics); Artificial intelligence; Data mining; Noisy data; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.03614689279289869,"score_gpt":0.2617671007059255,"score_spread":0.22562020791302684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153360418","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.17127807,0.0016046923,0.81858015,0.00035627637,0.00010713503,0.00014939721,0.0011575887,0.0056557506,0.0011109826],"genre_scores_gemma":[0.3863139,0.0009633506,0.60832304,0.00006046242,0.000105229235,0.00011209662,0.0022463573,0.0003852265,0.0014903678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994048,0.000112480586,0.000072376846,0.00017910385,0.00016859961,0.00006258541],"domain_scores_gemma":[0.99795747,0.0010621599,0.00024017294,0.00026321074,0.00034804837,0.00012882779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011815605,0.00078231713,0.0013333288,0.0025109225,0.0009363962,0.001236087,0.0011501493,0.0007915372,0.001932717],"category_scores_gemma":[0.004175676,0.00043766954,0.001285546,0.00439188,0.00052213424,0.0006611349,0.00096623955,0.0007992556,0.00090276357],"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.00089337997,0.00026998634,0.011382347,0.00043848713,0.00024853006,0.0007615061,0.00034469794,0.06527737,0.038866565,0.0054427655,0.0047591184,0.8713153],"study_design_scores_gemma":[0.000056023746,0.00014446709,0.0062265354,0.000020653668,0.000082182865,0.0006964158,0.0001458182,0.96710134,0.012796763,0.009947955,0.0027405028,0.00004136719],"about_ca_topic_score_codex":0.0037361854,"about_ca_topic_score_gemma":0.0044694724,"teacher_disagreement_score":0.0037361854,"about_ca_system_score_codex":0.00041067705,"about_ca_system_score_gemma":0.00085500855,"threshold_uncertainty_score":0.0074288845},"labels":[],"label_agreement":null},{"id":"W2153399392","doi":"10.1007/978-3-319-19992-4_5","title":"A Compressed-Sensing Approach for Super-Resolution Reconstruction of Diffusion MRI","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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 Waterloo","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health","keywords":"Computer science; Compressed sensing; Diffusion; Computer vision; Artificial intelligence; Resolution (logic); Algorithm; Physics","score_opus":0.07223077402635684,"score_gpt":0.33255021830840115,"score_spread":0.2603194442820443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153399392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014706437,0.00016551085,0.9975926,0.00015542627,0.000024524043,0.00001449363,0.00002892354,0.00007135049,0.00047647447],"genre_scores_gemma":[0.06949915,0.0010387902,0.92608804,0.0001899486,0.00016707843,0.00008389789,0.00021232839,0.000106813684,0.0026139675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967384,0.00009657453,0.000023543467,0.000044386274,0.00014196226,0.000019675696],"domain_scores_gemma":[0.9990414,0.0006119915,0.000061059334,0.00010349038,0.00013317431,0.00004889281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007970671,0.0007389784,0.0006512959,0.0005684104,0.0002960251,0.0007580352,0.0010786087,0.0013251347,0.0031688458],"category_scores_gemma":[0.002982541,0.0004347724,0.0006630206,0.00080287736,0.00064270693,0.0012030327,0.0014491224,0.0016559638,0.00072106096],"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.00026376083,0.00014302158,0.0003276364,0.0006126605,0.00009892304,0.00042262083,0.00029640386,0.3592441,0.099343374,0.15150434,0.0059713647,0.38177177],"study_design_scores_gemma":[0.0000070446054,0.000032660555,0.00006399836,0.000010621811,0.000008464684,0.00014681778,0.000010723634,0.9797529,0.004834581,0.01333447,0.0017840785,0.000013632302],"about_ca_topic_score_codex":0.001666987,"about_ca_topic_score_gemma":0.0019314728,"teacher_disagreement_score":0.0031688458,"about_ca_system_score_codex":0.0002645396,"about_ca_system_score_gemma":0.000658796,"threshold_uncertainty_score":0.010600865},"labels":[],"label_agreement":null},{"id":"W2153581430","doi":"10.1007/978-3-540-70872-8_1","title":"Data Mining Spontaneous Facial Behavior with Automatic Expression Coding","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Sleep and Work-Related Fatigue","field":"Psychology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Facial Action Coding System; Facial expression; Computer science; Toolbox; Artificial intelligence; Coding (social sciences); Computer vision; Machine learning; Speech recognition","score_opus":0.0476686690096171,"score_gpt":0.31118068933326987,"score_spread":0.2635120203236528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153581430","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.5250957,0.0018083891,0.44112685,0.00049355836,0.0003544147,0.0011459632,0.019559471,0.0050642923,0.005351273],"genre_scores_gemma":[0.7616478,0.00065441773,0.21268228,0.000118889366,0.00014852088,0.0011827175,0.019595932,0.00013885874,0.003830468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898773,0.00023727186,0.00010467772,0.0003197623,0.00022995555,0.00012053227],"domain_scores_gemma":[0.998412,0.0006706677,0.00015030132,0.000243868,0.0004616609,0.00006140304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973513,0.00079801324,0.0006903404,0.0017810498,0.0002619547,0.0004464815,0.0007364524,0.0005788256,0.0022306575],"category_scores_gemma":[0.0032740186,0.00021269845,0.0007673363,0.0016042794,0.00025239072,0.0004758532,0.00066168327,0.00050169835,0.0019013445],"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.0009642031,0.0005173011,0.051422395,0.0005557444,0.00024802962,0.00027530018,0.00017982797,0.0079437895,0.0860299,0.0006912846,0.0079823835,0.84318984],"study_design_scores_gemma":[0.0001407333,0.0011105768,0.2136698,0.0001554152,0.00045431868,0.0022155487,0.00069592765,0.6825946,0.0833127,0.0037990056,0.011729275,0.0001220814],"about_ca_topic_score_codex":0.002425888,"about_ca_topic_score_gemma":0.003212466,"teacher_disagreement_score":0.002425888,"about_ca_system_score_codex":0.00024973298,"about_ca_system_score_gemma":0.0004880369,"threshold_uncertainty_score":0.007462263},"labels":[],"label_agreement":null},{"id":"W2153611381","doi":"10.1007/11880561_11","title":"Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Compressed suffix array; Suffix array; Inverted index; Suffix; String searching algorithm; Pattern matching; Data structure; Word (group theory); Matching (statistics); Algorithm; Information retrieval; Artificial intelligence; Mathematics; Programming language; Search engine indexing","score_opus":0.020712010630244544,"score_gpt":0.24183024024776845,"score_spread":0.2211182296175239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153611381","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.108136386,0.0055919955,0.841226,0.000924339,0.001137426,0.00033849743,0.0028118854,0.016996041,0.022837473],"genre_scores_gemma":[0.22890525,0.002713202,0.7393513,0.00039014776,0.000440872,0.0003275753,0.0036296942,0.0018664324,0.022375638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991398,0.00012186362,0.000121101526,0.00017006006,0.00032785372,0.00011926655],"domain_scores_gemma":[0.9944377,0.002208675,0.00030393153,0.0019508103,0.00094511703,0.00015365735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862879,0.0010214619,0.0012577729,0.003136997,0.00094230176,0.0035064332,0.0027805732,0.0017227107,0.019460548],"category_scores_gemma":[0.007867724,0.00063285575,0.00060164754,0.006563183,0.00089989125,0.007649699,0.0017415681,0.001035362,0.0070908563],"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.0017833227,0.00011909033,0.0016270292,0.000780013,0.000056774712,0.00041488867,0.0004470871,0.0059150564,0.059565954,0.041940033,0.02125981,0.86609095],"study_design_scores_gemma":[0.0004248308,0.0022802674,0.002217015,0.0006734359,0.0005136915,0.006489447,0.0023238452,0.21117793,0.46932715,0.1628086,0.14147857,0.00028518992],"about_ca_topic_score_codex":0.00087247515,"about_ca_topic_score_gemma":0.0015534688,"teacher_disagreement_score":0.019460548,"about_ca_system_score_codex":0.0007282034,"about_ca_system_score_gemma":0.0008296307,"threshold_uncertainty_score":0.06510204},"labels":[],"label_agreement":null},{"id":"W2153705082","doi":"10.1007/978-3-642-12659-8_8","title":"Efficient Numerical Methods for the Time-Dependent Schroedinger Equation for Molecules in Intense Laser Fields","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Laser-Matter Interactions and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Eigenvalues and eigenvectors; Polar coordinate system; Discretization; Floquet theory; Schrödinger equation; Complex plane; Operator (biology); Mathematical analysis; Physics; Linear system; Cylindrical coordinate system; Mathematics; Nonlinear system; Quantum mechanics; Geometry","score_opus":0.02024608432357832,"score_gpt":0.3203222547578919,"score_spread":0.30007617043431356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153705082","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.0087970495,0.00097160053,0.97895914,0.0003805646,0.00023627326,0.00008834379,0.00012408692,0.00038050167,0.010062469],"genre_scores_gemma":[0.14617275,0.0013423909,0.8282233,0.00027930786,0.00029798519,0.00061744504,0.00041822848,0.0007786312,0.021870065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994173,0.00017243117,0.00003921844,0.000031283384,0.00028891387,0.000050903378],"domain_scores_gemma":[0.99845064,0.00093696365,0.00007757186,0.00014745787,0.000324879,0.000062411396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012839565,0.00088168425,0.001163295,0.00091485074,0.0009139547,0.0014312378,0.002497703,0.0019237724,0.0071623754],"category_scores_gemma":[0.0038820473,0.00064480404,0.0009406449,0.0014142495,0.0012054116,0.0017302583,0.001694017,0.0021627683,0.0019701575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013829225,0.0001856641,0.0004656964,0.00035772813,0.00010662565,0.00014415804,0.0002825831,0.60137886,0.0091830585,0.2768934,0.0067637144,0.10410022],"study_design_scores_gemma":[0.00002701186,0.000010017511,0.000052313746,0.000012745331,0.0000054254256,0.00001542325,0.000011558565,0.9737065,0.0005162635,0.023603385,0.0020295223,0.000009944987],"about_ca_topic_score_codex":0.0035398384,"about_ca_topic_score_gemma":0.006165847,"teacher_disagreement_score":0.0071623754,"about_ca_system_score_codex":0.0012098881,"about_ca_system_score_gemma":0.0014604172,"threshold_uncertainty_score":0.023960471},"labels":[],"label_agreement":null},{"id":"W2153757740","doi":"10.1007/11585978_14","title":"Linear Programming Matching and Appearance-Adaptive Object Tracking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Matching (statistics); Video tracking; Linear programming; Artificial intelligence; Tracking (education); Relaxation (psychology); Scheme (mathematics); Template; Set (abstract data type); Graph; Algorithm; Template matching; Pattern recognition (psychology); Object (grammar); Computer vision; Theoretical computer science; Mathematics; Image (mathematics)","score_opus":0.02891550542285065,"score_gpt":0.28608242247904864,"score_spread":0.257166917056198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153757740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009856249,0.0003247945,0.99730325,0.000059615213,0.000027037046,0.000011101379,0.00001595726,0.00023106489,0.001041581],"genre_scores_gemma":[0.11616049,0.001483621,0.85379434,0.00023326403,0.00018196409,0.00019461874,0.0002833401,0.00034993942,0.027318377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990977,0.00020743262,0.00003903421,0.0002927591,0.00028868436,0.00007436978],"domain_scores_gemma":[0.99925953,0.0003654138,0.00006825302,0.00010913035,0.00017315468,0.000024455043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008937462,0.0006488424,0.0012963761,0.0010139782,0.0004364028,0.0017163171,0.0021022162,0.0014304557,0.0054280194],"category_scores_gemma":[0.0035304741,0.0009910011,0.00077947456,0.0025482422,0.0008501829,0.0021222066,0.0017043639,0.0015281251,0.002941161],"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.00013304575,0.00013508642,0.00035406128,0.0002353115,0.00008746332,0.00009374053,0.00007581962,0.18025777,0.012533227,0.059609734,0.0067414436,0.73974335],"study_design_scores_gemma":[0.00000987742,0.000028163036,0.00019574878,0.000009935531,0.000015403428,0.000087258624,0.00001442386,0.95714575,0.0050043534,0.034198888,0.00327523,0.000015097434],"about_ca_topic_score_codex":0.0034679275,"about_ca_topic_score_gemma":0.003054234,"teacher_disagreement_score":0.0054280194,"about_ca_system_score_codex":0.0008065638,"about_ca_system_score_gemma":0.00077408686,"threshold_uncertainty_score":0.018158495},"labels":[],"label_agreement":null},{"id":"W2154187212","doi":"10.1007/3-540-39205-x_17","title":"Comparison of Conventional and Rough K-Means Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":30,"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":"Cluster analysis; Data mining; Computer science; Rough set; Web mining; Set (abstract data type); Representation (politics); Interval (graph theory); Information retrieval; Web service; Machine learning; Mathematics; World Wide Web; Combinatorics","score_opus":0.04711995937113412,"score_gpt":0.30352311786640895,"score_spread":0.25640315849527484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154187212","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.4363599,0.023284001,0.5002102,0.001162245,0.0014146356,0.00035391853,0.001835818,0.0029038428,0.03247538],"genre_scores_gemma":[0.7422223,0.0037159007,0.24513946,0.00010195157,0.0001565751,0.0001325239,0.0019990732,0.0003815493,0.006150622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635184,0.00097046606,0.00023038173,0.0002940833,0.002013089,0.00014013394],"domain_scores_gemma":[0.993256,0.0031000816,0.00018804085,0.00067783886,0.0026858682,0.00009216441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038933705,0.00057158177,0.0011751122,0.0026902119,0.00090451655,0.0026220782,0.001759466,0.0009877217,0.0035911074],"category_scores_gemma":[0.013304776,0.00021447036,0.00063943025,0.0034328634,0.0005605339,0.0023686625,0.0008696694,0.00037568706,0.00087574136],"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.0067083132,0.0003120549,0.006128971,0.0032238201,0.00080370146,0.00016915143,0.0009693058,0.13393833,0.009013296,0.029602086,0.018056626,0.7910743],"study_design_scores_gemma":[0.00045994227,0.0011796675,0.024161106,0.00030784783,0.0009166038,0.0005811449,0.0021488252,0.8992023,0.014819753,0.027658932,0.02827612,0.0002878045],"about_ca_topic_score_codex":0.0062107705,"about_ca_topic_score_gemma":0.010266417,"teacher_disagreement_score":0.0062107705,"about_ca_system_score_codex":0.0013416219,"about_ca_system_score_gemma":0.0013010727,"threshold_uncertainty_score":0.020590365},"labels":[],"label_agreement":null},{"id":"W2154244688","doi":"10.1007/978-3-540-77120-3_43","title":"On the Relative Dominance of Paging Algorithms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Paging; Computer science; Algorithm; Demand paging; Thrashing; Interval (graph theory); Virtual memory; Mathematics; Parallel computing; Operating system; Combinatorics; Memory management","score_opus":0.03338256575521329,"score_gpt":0.2782120725851762,"score_spread":0.24482950682996293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154244688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057404887,0.010725468,0.75397646,0.0043212613,0.00087139953,0.00023108318,0.0005200968,0.00064064306,0.17130865],"genre_scores_gemma":[0.65690196,0.011662528,0.25655785,0.0021746857,0.0027578496,0.00068697316,0.00095719035,0.0012530783,0.06704785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99286324,0.0032302663,0.00027653217,0.0005692544,0.0021357294,0.0009250297],"domain_scores_gemma":[0.9730075,0.021408899,0.0008029171,0.0021243358,0.0017720134,0.0008843248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066263354,0.0021953646,0.003379263,0.0024744903,0.0023343263,0.0061196364,0.004285509,0.002458247,0.014017683],"category_scores_gemma":[0.037508182,0.0012957081,0.0016340299,0.005668349,0.0038638297,0.012091793,0.0039769285,0.0065326667,0.002563603],"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.00038700926,0.00016043008,0.00047115466,0.00037030602,0.000058754755,0.00007720759,0.0003055364,0.048917543,0.0017604571,0.83203536,0.017626133,0.09783023],"study_design_scores_gemma":[0.0000827804,0.0001233536,0.00026446712,0.00010797515,0.00005564805,0.0002134966,0.000078008394,0.121773615,0.0008834011,0.86494476,0.0114442995,0.000028197883],"about_ca_topic_score_codex":0.0023439038,"about_ca_topic_score_gemma":0.0020764195,"teacher_disagreement_score":0.014017683,"about_ca_system_score_codex":0.0031431543,"about_ca_system_score_gemma":0.00277664,"threshold_uncertainty_score":0.046893775},"labels":[],"label_agreement":null},{"id":"W2154274494","doi":"10.1007/978-3-540-74610-2_12","title":"Logic Programming Approach to Automata-Based Decision Procedures","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Datalog; Computer science; Logic programming; Automaton; Programming language; Theoretical computer science; Focus (optics); Decision problem","score_opus":0.05198899101779367,"score_gpt":0.3219868572395209,"score_spread":0.2699978662217273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154274494","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.0016408057,0.00017239411,0.9822994,0.00031712817,0.000065958004,0.00005912325,0.0000556517,0.00036004058,0.015029536],"genre_scores_gemma":[0.17849767,0.00071260426,0.7940304,0.0005919718,0.00024063885,0.0004391189,0.00025945326,0.00022984488,0.024998257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981205,0.00062787783,0.00014289861,0.000305435,0.0006431165,0.00016010265],"domain_scores_gemma":[0.99782157,0.0015794033,0.000079387275,0.00018890537,0.00026902257,0.00006168935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015190438,0.0008419044,0.0007069377,0.0011528505,0.0008812614,0.003629011,0.0026649665,0.0014607204,0.01191428],"category_scores_gemma":[0.004205697,0.00068871735,0.0016729557,0.0011575939,0.002883404,0.0038062965,0.0015103293,0.003957572,0.002351694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020183938,0.000038252703,0.00004829451,0.000071930684,0.000015046177,0.00005299417,0.00011392409,0.01103779,0.0008901462,0.9641708,0.0011666921,0.022373967],"study_design_scores_gemma":[0.00002372156,0.000025299776,0.000026014406,0.000037478472,0.000028740838,0.00006227191,0.000031820673,0.08523736,0.0019479591,0.90035754,0.0122081535,0.000013541284],"about_ca_topic_score_codex":0.0015922269,"about_ca_topic_score_gemma":0.0016947476,"teacher_disagreement_score":0.01191428,"about_ca_system_score_codex":0.0015318547,"about_ca_system_score_gemma":0.0015365558,"threshold_uncertainty_score":0.03985727},"labels":[],"label_agreement":null},{"id":"W2154641672","doi":"10.1007/3-540-44886-1_29","title":"Understanding “Not-Understood”: Towards an Ontology of Error Conditions for Agent Communication","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Interdependence; Task (project management); Abstraction; Set (abstract data type); Predicate (mathematical logic); Predicate abstraction; Message passing; Multi-agent system; Models of communication; Ontology; Domain (mathematical analysis); Artificial intelligence; Human–computer interaction; Theoretical computer science; Distributed computing; Model checking; Programming language; Communication","score_opus":0.18871458990107204,"score_gpt":0.33729125445887953,"score_spread":0.1485766645578075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154641672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007921009,0.00053072313,0.9594437,0.00491359,0.00033761817,0.00011291129,0.00014839192,0.00033995928,0.026252164],"genre_scores_gemma":[0.59721786,0.00090743246,0.38800344,0.0013918071,0.0007368981,0.00058271625,0.00051034265,0.00057795603,0.010071604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885771,0.0050513293,0.0016352835,0.001455242,0.0023610867,0.0009198943],"domain_scores_gemma":[0.97273433,0.015231221,0.0023497217,0.0042682765,0.004613154,0.00080323697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009844756,0.001487769,0.0013743527,0.00320306,0.0033352585,0.010399213,0.004798577,0.0071802028,0.0063367984],"category_scores_gemma":[0.030070165,0.0016502519,0.0023538454,0.002184569,0.019853605,0.03803141,0.00626475,0.009748741,0.0012842085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010423107,0.000011286178,0.0001524941,0.000045826953,0.000006354211,0.00008948478,0.00166936,0.0011514669,0.00021565268,0.9918715,0.0007360291,0.0040401807],"study_design_scores_gemma":[0.000008033807,0.000011576165,0.000098368226,0.00006318741,0.00001740314,0.00015954896,0.00088186003,0.012346497,0.0005623235,0.9780418,0.0077869976,0.000022445049],"about_ca_topic_score_codex":0.0060673053,"about_ca_topic_score_gemma":0.0025468476,"teacher_disagreement_score":0.010399213,"about_ca_system_score_codex":0.003760005,"about_ca_system_score_gemma":0.0042781318,"threshold_uncertainty_score":0.052064657},"labels":[],"label_agreement":null},{"id":"W2154656254","doi":"10.1007/978-3-642-00525-1_5","title":"Using the iCat as Avatar in Remote Meetings","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Theoretical Astrophysics","keywords":"Avatar; Computer science; Connection (principal bundle); Multimedia; Human–computer interaction; Engineering","score_opus":0.19716548502510484,"score_gpt":0.4065628015064701,"score_spread":0.20939731648136528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154656254","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22539923,0.0010111876,0.23714998,0.0022887147,0.0015568804,0.0002251046,0.0002331512,0.004993028,0.5271427],"genre_scores_gemma":[0.6698904,0.0006067306,0.09905662,0.00055828,0.00034180027,0.00019433448,0.00027001637,0.0006892937,0.22839251],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932015,0.00032697732,0.000014766872,0.00011967185,0.00012151885,0.00009697683],"domain_scores_gemma":[0.99926287,0.0002886514,0.00004928918,0.000099719306,0.00008204846,0.00021735276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007644114,0.00079012493,0.00030152628,0.00032681535,0.0013338792,0.0021099881,0.0012226484,0.0016468271,0.028671188],"category_scores_gemma":[0.0020080723,0.00029366865,0.0004261043,0.00032907864,0.0006194191,0.0024199327,0.0019640604,0.0016502669,0.012560069],"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.0019992627,0.0015413197,0.009614507,0.000744036,0.00008581252,0.006043311,0.03921361,0.0037057684,0.14782472,0.05215422,0.08904906,0.64802444],"study_design_scores_gemma":[0.00025116914,0.0032537896,0.010991977,0.00053192995,0.00027913364,0.01939375,0.026010137,0.052577093,0.07022878,0.027466113,0.7887171,0.0002990325],"about_ca_topic_score_codex":0.0005114478,"about_ca_topic_score_gemma":0.0009704771,"teacher_disagreement_score":0.028671188,"about_ca_system_score_codex":0.0002272747,"about_ca_system_score_gemma":0.0002689863,"threshold_uncertainty_score":0.09591466},"labels":[],"label_agreement":null},{"id":"W2154880593","doi":"10.1007/978-3-642-27872-3_33","title":"A Wireless Sensors Based Feedback System for Human Body Movement Practices","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Northern British Columbia","funders":"","keywords":"Computer science; Trainer; Wireless sensor network; Wireless; Human–computer interaction; Movement (music); Simple (philosophy); Human body; Tracking (education); Real-time computing; Tracking system; Artificial intelligence; Telecommunications; Computer network","score_opus":0.022587523014624567,"score_gpt":0.2607318230901296,"score_spread":0.23814430007550502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154880593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12040747,0.0013738401,0.84352255,0.00039226105,0.00083174225,0.00078969286,0.0009619241,0.016243992,0.015476599],"genre_scores_gemma":[0.7233299,0.00085481623,0.23502652,0.0007208971,0.00025330277,0.0011285135,0.0008486219,0.00051539403,0.037321985],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961215,0.00005416561,0.000022266888,0.00010351456,0.00018354546,0.000024398201],"domain_scores_gemma":[0.99962485,0.00012813603,0.00003095777,0.000039097362,0.0001409491,0.00003590973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045126484,0.00064627134,0.0005781898,0.00047080152,0.00043937776,0.00059963815,0.0011427276,0.0007595754,0.009742129],"category_scores_gemma":[0.00097230024,0.000267219,0.00022219573,0.0003486546,0.00020894823,0.0005205721,0.0006944435,0.00040702504,0.0022319963],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013893257,0.00041114126,0.0014487777,0.00051440124,0.000052850846,0.00025181973,0.0004477019,0.0029129132,0.5176328,0.001241719,0.00991468,0.4637819],"study_design_scores_gemma":[0.0009212121,0.005475012,0.04456515,0.00036446302,0.0006187704,0.0026603853,0.00055086776,0.31822997,0.5306175,0.0040920996,0.09156332,0.00034131444],"about_ca_topic_score_codex":0.0009101007,"about_ca_topic_score_gemma":0.0020051408,"teacher_disagreement_score":0.009742129,"about_ca_system_score_codex":0.0002448544,"about_ca_system_score_gemma":0.0003306271,"threshold_uncertainty_score":0.032590687},"labels":[],"label_agreement":null},{"id":"W2154896738","doi":"10.1007/978-3-642-24873-3_11","title":"Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regret; Computer science; Ranking (information retrieval); Voting; Preference elicitation; Probabilistic logic; Preference; Exploit; Majority rule; Data mining; Machine learning; Artificial intelligence; Mathematics; Statistics; Computer security","score_opus":0.10948409458443553,"score_gpt":0.24760170507490611,"score_spread":0.13811761049047058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154896738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27669036,0.0013087479,0.71234536,0.001101616,0.00006938221,0.00030102264,0.000756886,0.00022420805,0.007202395],"genre_scores_gemma":[0.90014714,0.0007285189,0.092155755,0.0001479074,0.00010201684,0.00047360643,0.0013573426,0.00011562415,0.004772031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97828877,0.0178671,0.0005437661,0.0012421571,0.0015177071,0.000540514],"domain_scores_gemma":[0.65763366,0.31907618,0.006518789,0.013601264,0.0025149938,0.0006550216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032937065,0.0013151134,0.00263149,0.0014381257,0.0008052525,0.0040533273,0.0033729896,0.0028986754,0.01202107],"category_scores_gemma":[0.19822623,0.0018884176,0.002145636,0.0038614757,0.0018077854,0.0085843,0.0024686628,0.0039802073,0.001258655],"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.003725438,0.0010152652,0.037542086,0.0010636408,0.0009791736,0.00022252554,0.0015330735,0.30527687,0.0019101693,0.371454,0.008914997,0.26636282],"study_design_scores_gemma":[0.0001700783,0.00017744357,0.0055899965,0.00008316279,0.00015290976,0.00015731755,0.00024065534,0.7560587,0.0009957523,0.23494013,0.001365033,0.00006886067],"about_ca_topic_score_codex":0.0017517356,"about_ca_topic_score_gemma":0.002217952,"teacher_disagreement_score":0.032937065,"about_ca_system_score_codex":0.0015393625,"about_ca_system_score_gemma":0.00083249505,"threshold_uncertainty_score":0.17418993},"labels":[],"label_agreement":null},{"id":"W2155043600","doi":"10.1007/978-3-642-04447-2_75","title":"Image Retrieval by Inter-media Fusion and Pseudo-relevance Feedback","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relevance feedback; Computer science; Relevance (law); Information retrieval; Task (project management); Block (permutation group theory); Image retrieval; Fusion; Visual Word; Image (mathematics); Artificial intelligence; Mathematics","score_opus":0.010530697749462302,"score_gpt":0.2551118158272845,"score_spread":0.24458111807782218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155043600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012719808,0.0032970998,0.9796316,0.00019320511,0.00029331387,0.00013026752,0.00011341663,0.0011359985,0.0024852604],"genre_scores_gemma":[0.29193485,0.0030010382,0.6933975,0.00031180988,0.00081842043,0.00027006946,0.00071527075,0.00026866264,0.009282347],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975109,0.00066974974,0.00016362194,0.0003548875,0.0011240506,0.00017675727],"domain_scores_gemma":[0.9980634,0.00064062746,0.000121612116,0.00030516103,0.0008228542,0.000046384514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002882713,0.0013880573,0.002169186,0.0027022003,0.00070670695,0.0018166379,0.0013138771,0.0016585191,0.0028120459],"category_scores_gemma":[0.005121207,0.00056593417,0.0016615908,0.0026680885,0.0009480399,0.003938289,0.0018081468,0.00091450865,0.0022272228],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011729909,0.00027074106,0.0004651239,0.0007855972,0.00030555323,0.00021392516,0.00012237823,0.028146423,0.12964405,0.008677697,0.0057471194,0.82444847],"study_design_scores_gemma":[0.00012964598,0.00073333975,0.0017476332,0.000052760348,0.0004462359,0.0010625487,0.00007917954,0.85645366,0.116279,0.01590267,0.00695186,0.00016149669],"about_ca_topic_score_codex":0.0011783667,"about_ca_topic_score_gemma":0.0016651097,"teacher_disagreement_score":0.002882713,"about_ca_system_score_codex":0.0005538894,"about_ca_system_score_gemma":0.00071699213,"threshold_uncertainty_score":0.015245438},"labels":[],"label_agreement":null},{"id":"W2155100327","doi":"10.1007/978-3-642-31770-5_10","title":"Crossing Angles of Geometric Graphs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Calgary","funders":"","keywords":"Combinatorics; Bounded function; Crossing number (knot theory); Vertex (graph theory); Graph drawing; 1-planar graph; Mathematics; Graph; Spatial network; Computer science; Line graph; Mathematical analysis","score_opus":0.021919141543357588,"score_gpt":0.2545826128338116,"score_spread":0.23266347129045403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155100327","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.21878412,0.0047086594,0.23024684,0.0006330806,0.0018220909,0.00014150962,0.000755628,0.00083783607,0.5420702],"genre_scores_gemma":[0.8227758,0.005353643,0.07662381,0.00027330502,0.0008837,0.00015465594,0.0016703836,0.0011484163,0.091116294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.000074351956,0.000020222647,0.00011146582,0.00017885145,0.00005844986],"domain_scores_gemma":[0.9993901,0.00019651033,0.00008853816,0.00005793377,0.00012207167,0.0001447453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003179659,0.0008917604,0.0005578107,0.003466878,0.0008287699,0.002244088,0.00083981355,0.0006062467,0.01263083],"category_scores_gemma":[0.0017611309,0.00061801326,0.00041571425,0.0025733428,0.0012167924,0.0020241896,0.0012284354,0.0023492388,0.002324049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051031224,0.000029729426,0.00035769356,0.00009965079,0.000009146097,0.000096043295,0.00027281113,0.0049360534,0.002879854,0.9249098,0.0063831727,0.059974983],"study_design_scores_gemma":[0.000015580474,0.000039812247,0.000676945,0.000060370643,0.0000121990615,0.00032122363,0.00023153072,0.011215739,0.0018380524,0.94533587,0.04023036,0.000022366386],"about_ca_topic_score_codex":0.0005728462,"about_ca_topic_score_gemma":0.0006310976,"teacher_disagreement_score":0.01263083,"about_ca_system_score_codex":0.0007030684,"about_ca_system_score_gemma":0.00024680354,"threshold_uncertainty_score":0.04225433},"labels":[],"label_agreement":null},{"id":"W21551052","doi":"10.1007/bfb0018398","title":"From utterance to belief via presupposition","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Utterance; Presupposition; Computer science; Meaning (existential); CLARITY; Linguistics; Artificial intelligence; Natural (archaeology); Natural language; Default logic; Natural language processing; Epistemology; Autoepistemic logic; Philosophy; Description logic; Multimodal logic","score_opus":0.012952447574566409,"score_gpt":0.24105035934747407,"score_spread":0.22809791177290767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21551052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016498512,0.0018364874,0.83116466,0.0071764044,0.0008563606,0.00007111306,0.0005293908,0.0016827801,0.14018436],"genre_scores_gemma":[0.8175885,0.0023304934,0.15208577,0.0014353263,0.0009624455,0.00022539833,0.0010525234,0.001217371,0.023102133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630797,0.0020235623,0.00018075609,0.0006521069,0.00061010214,0.00022548401],"domain_scores_gemma":[0.99140257,0.006651668,0.00019644338,0.0010475855,0.00058302697,0.00011871282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210909,0.00082678016,0.0007860056,0.0010711878,0.0016514079,0.0075689233,0.0024566045,0.0028554953,0.016681926],"category_scores_gemma":[0.0200062,0.0017319435,0.0013515056,0.0011593617,0.005305122,0.019542396,0.0051538306,0.0050823996,0.0048090178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015167026,0.000020208918,0.00020783998,0.00021992615,0.000042688214,0.0004214096,0.002900518,0.0011128036,0.0026077917,0.94983023,0.003638117,0.038846776],"study_design_scores_gemma":[0.000012515295,0.000017624938,0.00010986588,0.000055320164,0.000028506676,0.00016942472,0.00034500827,0.006751277,0.0023091533,0.9831284,0.0070504597,0.000022414146],"about_ca_topic_score_codex":0.0015706351,"about_ca_topic_score_gemma":0.0007174487,"teacher_disagreement_score":0.016681926,"about_ca_system_score_codex":0.0013561028,"about_ca_system_score_gemma":0.0011276439,"threshold_uncertainty_score":0.055806637},"labels":[],"label_agreement":null},{"id":"W2155220104","doi":"10.1007/978-3-319-24912-4_14","title":"Towards the Generation of Tests in the Test Description Language from Use Case Map Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Ottawa","funders":"","keywords":"Test (biology); Computer science; Natural language processing; Artificial intelligence; Geology; Paleontology","score_opus":0.17620583505475879,"score_gpt":0.3119388174333214,"score_spread":0.13573298237856263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155220104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055367504,0.00014064988,0.9801713,0.000295979,0.00004413648,0.00036816145,0.0009266636,0.010115783,0.0024005403],"genre_scores_gemma":[0.09046358,0.00032836985,0.8955671,0.00030574674,0.000039532377,0.00051791663,0.0056309975,0.0043367404,0.0028100773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497163,0.0019846873,0.0004875007,0.0005540679,0.0017082955,0.0002937336],"domain_scores_gemma":[0.9839281,0.01061488,0.000889873,0.0022173212,0.0020607305,0.00028904967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049703415,0.0017530308,0.0012910961,0.0030604315,0.00059899496,0.005002256,0.0042664474,0.0023179993,0.009093408],"category_scores_gemma":[0.02461289,0.002057254,0.0034209464,0.0017822956,0.0018356816,0.004174645,0.004263165,0.004130764,0.0040344354],"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.0005385014,0.0006366312,0.0039360467,0.002817232,0.000357636,0.002388969,0.002540044,0.15913442,0.023903498,0.21086438,0.031329133,0.5615536],"study_design_scores_gemma":[0.00018713753,0.00018681283,0.00061691494,0.0007321607,0.00017089548,0.0007709584,0.00037449287,0.79185474,0.031838898,0.12796383,0.045179594,0.00012361405],"about_ca_topic_score_codex":0.0045330254,"about_ca_topic_score_gemma":0.00571495,"teacher_disagreement_score":0.009093408,"about_ca_system_score_codex":0.0013162042,"about_ca_system_score_gemma":0.0026476914,"threshold_uncertainty_score":0.030420482},"labels":[],"label_agreement":null},{"id":"W2155379435","doi":"10.1007/3-540-47884-1_8","title":"Translating Statecharts to B","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language; Notation; Translation (biology); Code (set theory); Code generation; Class diagram; Theoretical computer science; Unified Modeling Language; Software; Operating system; Arithmetic; Set (abstract data type); Mathematics","score_opus":0.038511489866800176,"score_gpt":0.28295324781612824,"score_spread":0.24444175794932807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155379435","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.0070751323,0.00012557596,0.94686,0.00030345726,0.00039744182,0.00022134304,0.0010472415,0.011497888,0.032471903],"genre_scores_gemma":[0.17689021,0.0007741243,0.7662232,0.00044257162,0.000107384156,0.0005541161,0.0041299015,0.006946817,0.04393161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937576,0.00015454735,0.000060345028,0.00014900396,0.00018564581,0.00007466569],"domain_scores_gemma":[0.9987771,0.00067739,0.00005254638,0.00022777487,0.0002191764,0.000046071214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007609483,0.0007922771,0.00041852688,0.0014569196,0.00082264614,0.0024903729,0.0008212117,0.001063718,0.024660569],"category_scores_gemma":[0.0035182172,0.0010615678,0.0012124273,0.0011884244,0.0013250117,0.0023716276,0.0024424025,0.0017570935,0.009295137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019251174,0.00016417853,0.00041459582,0.00052962115,0.000044045766,0.0006099885,0.0011736619,0.016931705,0.01980851,0.704028,0.03406122,0.22204186],"study_design_scores_gemma":[0.00011490086,0.00008902624,0.0003973654,0.00024148247,0.000054464163,0.00026041223,0.00035074513,0.07385979,0.041291703,0.64231056,0.24096638,0.000063172185],"about_ca_topic_score_codex":0.004747452,"about_ca_topic_score_gemma":0.0033249082,"teacher_disagreement_score":0.024660569,"about_ca_system_score_codex":0.00082603603,"about_ca_system_score_gemma":0.0009916481,"threshold_uncertainty_score":0.082497776},"labels":[],"label_agreement":null},{"id":"W2155444699","doi":"10.1007/978-3-540-72397-4_22","title":"Solving a Stochastic Queueing Control Problem with Constraint Programming","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Mathematical optimization; Constraint programming; Staffing; Heuristic; Constraint (computer-aided design); Stochastic programming; Concurrent constraint logic programming; Constraint satisfaction; Operations research; Constraint logic programming; Artificial intelligence; Mathematics; Computer network","score_opus":0.01278232178409479,"score_gpt":0.23312548162427615,"score_spread":0.22034315984018135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155444699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013090745,0.00021734629,0.98047733,0.0006000185,0.00009915012,0.00009582413,0.00011199835,0.00019304836,0.005114526],"genre_scores_gemma":[0.4880894,0.0006093138,0.49958086,0.00045045876,0.00030123245,0.0005309023,0.00040993074,0.0002538449,0.00977409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982597,0.0005911534,0.00009081778,0.00036619225,0.0004372027,0.00025494758],"domain_scores_gemma":[0.994922,0.004233544,0.00020987322,0.00014345303,0.00032575225,0.00016529807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026806123,0.001252428,0.0018410123,0.000672184,0.00097137666,0.0026776067,0.0024558427,0.0029514143,0.0051282668],"category_scores_gemma":[0.008664384,0.0012501993,0.0014074463,0.0019195909,0.0014511109,0.0016539334,0.0018641053,0.0026584475,0.0003275109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053681866,0.000052587813,0.0001390109,0.00007770367,0.000033275104,0.00006980148,0.000034903584,0.9633111,0.00047684732,0.022846205,0.0013034552,0.0116014555],"study_design_scores_gemma":[0.000017125474,0.000011700777,0.000026774405,0.000004698743,0.0000057034817,0.0000074143504,0.000007956934,0.9922214,0.00016569706,0.007190016,0.00033693542,0.0000045731927],"about_ca_topic_score_codex":0.021800987,"about_ca_topic_score_gemma":0.011879691,"teacher_disagreement_score":0.021800987,"about_ca_system_score_codex":0.0018462314,"about_ca_system_score_gemma":0.00413147,"threshold_uncertainty_score":0.043348193},"labels":[],"label_agreement":null},{"id":"W2155575074","doi":"10.1007/11551188_1","title":"Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University","funders":"","keywords":"Trie; Beam search; Computer science; Benchmark (surveying); Pruning; Heuristic; A priori and a posteriori; String (physics); Levenshtein distance; Algorithm; Quadrilateral; Search tree; Search algorithm; Tree (set theory); Artificial intelligence; Combinatorics; Mathematics; Finite element method; Data structure; Physics","score_opus":0.03541699996764469,"score_gpt":0.28766361145974956,"score_spread":0.25224661149210487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155575074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041300856,0.00031810233,0.94354016,0.0001979693,0.000099709876,0.00015890283,0.00019848766,0.0054578283,0.008727983],"genre_scores_gemma":[0.27806014,0.00036098194,0.71180135,0.00033231973,0.00007259296,0.00021212676,0.00092234573,0.00063982856,0.0075983084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994728,0.00010571959,0.000051211417,0.00011556464,0.0001983986,0.000056360932],"domain_scores_gemma":[0.9980452,0.0009703135,0.00009528345,0.0002791614,0.00055908284,0.000050968152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061435456,0.00094348117,0.00123198,0.002054856,0.000468724,0.0014716604,0.0015482154,0.0012073807,0.008513106],"category_scores_gemma":[0.0034890831,0.0004358688,0.00080473704,0.0018237949,0.0005126777,0.0023648818,0.0009162381,0.0010917531,0.0033053006],"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.00030073148,0.00029926465,0.00086374424,0.0002680463,0.00009946376,0.00028273696,0.0001898905,0.05900735,0.0485196,0.011070692,0.006942651,0.87215585],"study_design_scores_gemma":[0.000035261062,0.00007432922,0.00023874796,0.00001588542,0.000049787806,0.00022600818,0.00010178073,0.9709533,0.017528493,0.008303205,0.0024536643,0.000019502948],"about_ca_topic_score_codex":0.0027758083,"about_ca_topic_score_gemma":0.00447392,"teacher_disagreement_score":0.008513106,"about_ca_system_score_codex":0.00044133136,"about_ca_system_score_gemma":0.0009602742,"threshold_uncertainty_score":0.028479159},"labels":[],"label_agreement":null},{"id":"W2155595226","doi":"10.1007/978-3-642-15711-0_53","title":"Rotational Encoding of C-arm Fluoroscope with Tilt Sensing Accelerometer","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Queen's University","funders":"","keywords":"Accelerometer; Tilt (camera); Computer vision; Tracking (education); Fiducial marker; Rotation (mathematics); Computer science; Robotic arm; Encoding (memory); Artificial intelligence; Ground truth; Engineering; Mechanical engineering","score_opus":0.016199069287926315,"score_gpt":0.2672321228287932,"score_spread":0.2510330535408669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155595226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25006315,0.0011311678,0.7256091,0.00086441415,0.0011520137,0.00021190573,0.0012750273,0.004046516,0.015646819],"genre_scores_gemma":[0.88152754,0.00056621147,0.10800937,0.00023965002,0.00015926028,0.00008971274,0.00064015127,0.0001328624,0.008635179],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955577,0.000055666496,0.00002318054,0.00008141797,0.00023160025,0.00005224219],"domain_scores_gemma":[0.99937004,0.00008191722,0.000075669624,0.00009120191,0.00033266773,0.000048574213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695804,0.00078297005,0.0003945743,0.00063019566,0.00024290006,0.0006146972,0.0004344615,0.0006722897,0.004343551],"category_scores_gemma":[0.0013605173,0.00026314246,0.00020692399,0.00069215667,0.00021950461,0.0005792392,0.0006433498,0.00047302575,0.0011293541],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001520647,0.00008895653,0.007659339,0.00052150246,0.000042237967,0.00082826236,0.0005057136,0.004154027,0.6359524,0.0021655767,0.00722773,0.33933368],"study_design_scores_gemma":[0.00018687347,0.0015710358,0.056913484,0.0002625263,0.0002109282,0.004275825,0.00052358053,0.16238445,0.7415924,0.0013836223,0.030450335,0.00024490463],"about_ca_topic_score_codex":0.0017422255,"about_ca_topic_score_gemma":0.0022173822,"teacher_disagreement_score":0.004343551,"about_ca_system_score_codex":0.00019937086,"about_ca_system_score_gemma":0.0005831042,"threshold_uncertainty_score":0.014530599},"labels":[],"label_agreement":null},{"id":"W2156166258","doi":"10.1007/978-3-540-24855-2_28","title":"The Shifting Balance Genetic Algorithm as More than Just Another Island Model GA","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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 Guelph","funders":"","keywords":"Genetic algorithm; Balance (ability); Computer science; Population; Mechanism (biology); Extension (predicate logic); Diversity (politics); Algorithm; Machine learning; Biology; Sociology; Demography; Physics","score_opus":0.02227296970483767,"score_gpt":0.2779428918105858,"score_spread":0.2556699221057481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156166258","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.05921451,0.0013003404,0.8456698,0.001157394,0.00041966635,0.00006684574,0.000056167122,0.00059425295,0.091521114],"genre_scores_gemma":[0.6239295,0.0015125826,0.30788344,0.00058209075,0.00016611512,0.00015160521,0.000123192,0.0003614894,0.06529007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998969,0.000029356397,0.0000030037907,0.000020708236,0.000039218925,0.000010817808],"domain_scores_gemma":[0.9999286,0.00002276647,0.000005534199,0.000019705836,0.000013398492,0.000010100806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002072397,0.00033672046,0.0004431154,0.0002735281,0.00036866608,0.0011170305,0.0008376385,0.00083643297,0.004563923],"category_scores_gemma":[0.00056218775,0.00018936698,0.00034765387,0.000599593,0.00061522704,0.0012918396,0.00077767984,0.001002382,0.0006272006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091265494,0.00010268646,0.0004969845,0.00007253393,0.00006693473,0.0001542883,0.0002115125,0.43065244,0.012792178,0.3138297,0.007117467,0.23441209],"study_design_scores_gemma":[0.000030384494,0.00007983527,0.00019769635,0.000017864098,0.00003646602,0.00013826131,0.000051917657,0.8629413,0.0020450435,0.115815,0.018628832,0.000017281553],"about_ca_topic_score_codex":0.0021671888,"about_ca_topic_score_gemma":0.0018937142,"teacher_disagreement_score":0.004563923,"about_ca_system_score_codex":0.00042176462,"about_ca_system_score_gemma":0.0005334614,"threshold_uncertainty_score":0.015267849},"labels":[],"label_agreement":null},{"id":"W215621206","doi":"10.1007/978-3-319-03680-9_36","title":"Conjunctive Query Answering in ${\\mathcal{CFD}}_{nc}$ : A PTIME Description Logic with Functional Constraints and Disjointness","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Negation; P; Disjoint sets; Computer science; Conjunctive query; Theoretical computer science; Computational complexity theory; Programming language; Algebra over a field; Discrete mathematics; Information retrieval; Mathematics; Algorithm; Time complexity; Pure mathematics; Relational database","score_opus":0.025815512098021215,"score_gpt":0.21846470189321188,"score_spread":0.19264918979519066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W215621206","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.016958896,0.0006534673,0.952404,0.0041111824,0.00028793502,0.0003655196,0.0032917117,0.0041976664,0.017729582],"genre_scores_gemma":[0.2670486,0.00077376014,0.6994419,0.0024712635,0.00029590735,0.0004973993,0.006831861,0.001365754,0.021273576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955577,0.0011726894,0.0004645912,0.0009443488,0.0013624429,0.0004982276],"domain_scores_gemma":[0.9958539,0.0026296356,0.00018689324,0.0005893751,0.00060960633,0.000130674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037996792,0.0011018751,0.0016091228,0.0014611641,0.0014516943,0.006117868,0.0043673036,0.0022444404,0.016226824],"category_scores_gemma":[0.00840073,0.001644989,0.0040835855,0.0028345047,0.003036716,0.012442461,0.005411536,0.004284199,0.0026757545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034370122,0.00021827861,0.00056430115,0.0008272088,0.00015479792,0.00044170345,0.00060463906,0.03324074,0.004325073,0.8336424,0.026467806,0.09916929],"study_design_scores_gemma":[0.00015539226,0.000043477245,0.00022449865,0.00010862445,0.0001837288,0.00032204905,0.00026710174,0.22483459,0.0071947314,0.7363932,0.030180175,0.0000923753],"about_ca_topic_score_codex":0.023576474,"about_ca_topic_score_gemma":0.02908743,"teacher_disagreement_score":0.023576474,"about_ca_system_score_codex":0.004163776,"about_ca_system_score_gemma":0.003053643,"threshold_uncertainty_score":0.054284155},"labels":[],"label_agreement":null},{"id":"W2156357077","doi":"10.1007/3-540-36285-1_7","title":"On Reasoning about Structural Equality in XML: A Description Logic Approach","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ackermann function; Computer science; Datalog; Satisfiability; Description logic; XML; Feature (linguistics); Theoretical computer science; Boolean satisfiability problem; Programming language; Algorithm; Mathematics","score_opus":0.04983831591513789,"score_gpt":0.26929634867961094,"score_spread":0.21945803276447307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156357077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049899896,0.0011758717,0.98326796,0.0020842545,0.00015390513,0.00013453963,0.00043472004,0.0006628569,0.007095947],"genre_scores_gemma":[0.16376007,0.0036932975,0.8184435,0.0018963724,0.00048456606,0.00037240266,0.0029702357,0.00055584253,0.007823741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899809,0.0031201716,0.0014363785,0.0013923469,0.0031578229,0.00091233436],"domain_scores_gemma":[0.98762614,0.009266392,0.0004359809,0.0014165435,0.0009973975,0.00025751736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009517485,0.0019315998,0.0024657687,0.004931544,0.0028581223,0.008349407,0.00868008,0.004663923,0.0089581255],"category_scores_gemma":[0.019225698,0.0027081047,0.00674561,0.007592844,0.007798175,0.041452106,0.008982724,0.0063643996,0.001229561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000767129,0.00012668027,0.0004505603,0.00046249636,0.00014249567,0.00048801675,0.0008958317,0.012294337,0.00090060814,0.9199635,0.0044716657,0.059727196],"study_design_scores_gemma":[0.000039644972,0.00001838304,0.00010142214,0.00012535087,0.00016037728,0.00023890265,0.00030717102,0.037097547,0.00211828,0.9505377,0.009211282,0.00004397964],"about_ca_topic_score_codex":0.012400871,"about_ca_topic_score_gemma":0.009406891,"teacher_disagreement_score":0.012400871,"about_ca_system_score_codex":0.0038473948,"about_ca_system_score_gemma":0.00247107,"threshold_uncertainty_score":0.050333917},"labels":[],"label_agreement":null},{"id":"W2156411090","doi":"10.1007/978-3-642-12476-1_3","title":"Fast Intersection Algorithms for Sorted Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Algorithm; Theoretical computer science; Cartography","score_opus":0.02275534578046922,"score_gpt":0.2680858875064642,"score_spread":0.245330541725995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156411090","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.018157007,0.0020857698,0.95728093,0.00026551372,0.00029119875,0.00015040649,0.00060600834,0.005479395,0.015683811],"genre_scores_gemma":[0.09709387,0.0013891994,0.8817075,0.00014246457,0.00024590472,0.00034229227,0.0031823725,0.0013859692,0.014510553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708706,0.0003658022,0.00027911612,0.00046438878,0.0014511321,0.0003524867],"domain_scores_gemma":[0.99551374,0.0021125348,0.00020085432,0.0008927897,0.0011166147,0.00016357645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018746493,0.0018549769,0.0024628383,0.0048465137,0.0023587663,0.0050227484,0.0032203132,0.0013356863,0.025229122],"category_scores_gemma":[0.007605787,0.0014939137,0.0018881498,0.009672431,0.0014632159,0.010957509,0.0051899813,0.0037211129,0.007435435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006044635,0.00014855542,0.00060317764,0.0004421287,0.000069276866,0.000057848672,0.00046950244,0.012510522,0.005338871,0.22231385,0.020263156,0.7371786],"study_design_scores_gemma":[0.00023273332,0.00028074684,0.0005321629,0.00025691377,0.00011023201,0.00044498275,0.0005639691,0.2262967,0.02631895,0.6828001,0.062052682,0.00010974982],"about_ca_topic_score_codex":0.0021947871,"about_ca_topic_score_gemma":0.0028177036,"teacher_disagreement_score":0.025229122,"about_ca_system_score_codex":0.0024257887,"about_ca_system_score_gemma":0.0026453815,"threshold_uncertainty_score":0.08439982},"labels":[],"label_agreement":null},{"id":"W2156413802","doi":"10.1007/11424918_10","title":"Modelling an Academic Curriculum Plan as a Mixed-Initiative Constraint Satisfaction Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backtracking; Computer science; Constraint satisfaction; Flexibility (engineering); Scheduling (production processes); Constraint satisfaction problem; Curriculum; Plan (archaeology); Process (computing); Operations research; Mathematical optimization; Artificial intelligence; Programming language; Mathematics","score_opus":0.02668433257560479,"score_gpt":0.2584488897330694,"score_spread":0.2317645571574646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156413802","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.08396756,0.00039838805,0.87297535,0.0023766786,0.00012668301,0.00047657438,0.0013564486,0.00056331244,0.037758987],"genre_scores_gemma":[0.6621451,0.0004932761,0.30686298,0.00021597873,0.00007591327,0.00091086834,0.0013126717,0.00016653643,0.02781667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840647,0.00061470625,0.00006324843,0.00032555038,0.00027849994,0.00031154635],"domain_scores_gemma":[0.9979924,0.0013110612,0.00019400072,0.00008686598,0.00019159065,0.00022405175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841191,0.0006298798,0.00079060765,0.0008906704,0.0008077645,0.0035191218,0.0026036594,0.002526935,0.012207719],"category_scores_gemma":[0.0055189854,0.0010527817,0.0011645161,0.0019358183,0.0011663178,0.003060424,0.0021772336,0.0016716222,0.00090424425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012416454,0.00011756066,0.0010724727,0.00010115167,0.000036593363,0.0002631759,0.0002676333,0.8234687,0.0004360167,0.15390982,0.002685591,0.017517114],"study_design_scores_gemma":[0.0000537429,0.000048938415,0.00015141594,0.000021748394,0.000020404925,0.000026399563,0.00014067425,0.9494374,0.00024670764,0.04617717,0.0036590665,0.000016247974],"about_ca_topic_score_codex":0.030469723,"about_ca_topic_score_gemma":0.027102029,"teacher_disagreement_score":0.030469723,"about_ca_system_score_codex":0.0022324042,"about_ca_system_score_gemma":0.003114511,"threshold_uncertainty_score":0.060584724},"labels":[],"label_agreement":null},{"id":"W2156860687","doi":"10.1007/11867586_4","title":"Frozen-State Hierarchical Annealing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Simulated annealing; Annealing (glass); Binary number; Computational complexity theory; Porous medium; Hierarchical database model; Algorithm; Data mining; Porosity; Materials science; Mathematics","score_opus":0.014056310435531084,"score_gpt":0.23990679398889078,"score_spread":0.2258504835533597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156860687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018206555,0.00063355785,0.93028235,0.00040738183,0.0003365829,0.0001271739,0.00022451648,0.0013392939,0.0484425],"genre_scores_gemma":[0.54151934,0.00045814412,0.41105685,0.0004791054,0.00010237669,0.00052495534,0.000876084,0.0011764874,0.043806624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.00012363764,0.000011915242,0.00007142358,0.00007181912,0.000049033915],"domain_scores_gemma":[0.9992403,0.00035506094,0.0000223244,0.00025539374,0.000080457066,0.000046602116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007510472,0.00048404117,0.0010747423,0.00044402276,0.00093095365,0.0012323986,0.002040979,0.0014027387,0.019028848],"category_scores_gemma":[0.0029592856,0.00068721594,0.0008204139,0.0006840729,0.001335642,0.0015550088,0.0017856244,0.0020803884,0.0023823301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016581836,0.00007336011,0.00021679822,0.00014436943,0.00005265705,0.00004698769,0.00015107958,0.4745696,0.003112383,0.4401034,0.0117096,0.0696539],"study_design_scores_gemma":[0.000024462417,0.000022496733,0.00007756604,0.000016335005,0.000011099495,0.0000116483225,0.000014551103,0.82369107,0.000863945,0.17185819,0.0033977835,0.000010969031],"about_ca_topic_score_codex":0.0019653076,"about_ca_topic_score_gemma":0.003872346,"teacher_disagreement_score":0.019028848,"about_ca_system_score_codex":0.0011266522,"about_ca_system_score_gemma":0.0009294678,"threshold_uncertainty_score":0.06365782},"labels":[],"label_agreement":null},{"id":"W2156885983","doi":"10.1007/978-3-319-18263-6_22","title":"Primal-Dual Algorithms for Precedence Constrained Covering Problems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Knapsack problem; Combinatorics; Mathematics; Cover (algebra); Bounded function; Upper and lower bounds; Antichain; Order (exchange); Discrete mathematics; Integer (computer science); Algorithm; Partially ordered set; Computer science","score_opus":0.05693307988904808,"score_gpt":0.29515101427188606,"score_spread":0.23821793438283798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156885983","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.0071708243,0.0020420845,0.9732945,0.00039781607,0.00020337613,0.000073197734,0.0001385901,0.0002834957,0.016396258],"genre_scores_gemma":[0.19056149,0.003231777,0.78674066,0.0003238733,0.00039855263,0.00043676552,0.00056147657,0.00060730363,0.017138168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992155,0.00031136285,0.000031443564,0.00009520404,0.00023733363,0.000109261855],"domain_scores_gemma":[0.998582,0.000963368,0.00007733947,0.00012921967,0.00015003518,0.00009802018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018470823,0.001829199,0.0016354799,0.00097249437,0.00073281646,0.0022814146,0.002062033,0.0016725216,0.009753322],"category_scores_gemma":[0.0050988146,0.001255418,0.00115256,0.0024233414,0.0010505214,0.0023018639,0.0024996353,0.004444253,0.0015390143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001773292,0.0002876475,0.00030191377,0.00044576684,0.000064504406,0.0000805611,0.000119347154,0.608785,0.0011805109,0.18539898,0.016212089,0.18694642],"study_design_scores_gemma":[0.000038361326,0.00002611902,0.00006632827,0.000046017743,0.000011742053,0.00004599721,0.00002231772,0.89799184,0.00036179507,0.09767019,0.0037116099,0.000007571889],"about_ca_topic_score_codex":0.002004451,"about_ca_topic_score_gemma":0.0023128528,"teacher_disagreement_score":0.009753322,"about_ca_system_score_codex":0.0015023636,"about_ca_system_score_gemma":0.0015006614,"threshold_uncertainty_score":0.03262812},"labels":[],"label_agreement":null},{"id":"W2156959062","doi":"10.1007/978-3-540-73101-6_53","title":"Learning More About “Software Best Practices”","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"IBM (Canada)","funders":"","keywords":"Best practice; Agile software development; Extreme programming practices; Software; Computer science; Business; Engineering management; Process management; Knowledge management; Software engineering; Software development; Engineering; Management; Software development process; Economics; Operating system","score_opus":0.15401388453343892,"score_gpt":0.4044535851050993,"score_spread":0.25043970057166043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156959062","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04957106,0.006028461,0.29250622,0.11510558,0.0025042344,0.00006442698,0.00034641044,0.0011326002,0.53274095],"genre_scores_gemma":[0.5325236,0.016220404,0.2446262,0.031478934,0.0030739768,0.00017721926,0.0018670304,0.0013687366,0.168664],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791914,0.00085960096,0.0000977679,0.00027109127,0.00075313443,0.00009930345],"domain_scores_gemma":[0.9912122,0.0050281286,0.0005674564,0.0012481881,0.0014075387,0.0005365214],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003367451,0.00060766,0.0004218346,0.001022548,0.0008433894,0.004436125,0.0011274026,0.0014866904,0.026510943],"category_scores_gemma":[0.017010733,0.00028504114,0.0005141478,0.0013504332,0.0025074445,0.022060813,0.0019140035,0.0036845114,0.0047616246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003490839,0.000240748,0.0023643658,0.0003892814,0.000038856873,0.000103156184,0.008907913,0.0017850525,0.0018220361,0.4028458,0.10620234,0.4752656],"study_design_scores_gemma":[0.000011662201,0.00006217406,0.0011710112,0.0004038354,0.000020874098,0.00017051664,0.004332197,0.002101458,0.001481778,0.7071248,0.28309447,0.000025122723],"about_ca_topic_score_codex":0.00075763476,"about_ca_topic_score_gemma":0.0014612331,"teacher_disagreement_score":0.9966326,"about_ca_system_score_codex":0.0012151032,"about_ca_system_score_gemma":0.0014011093,"threshold_uncertainty_score":0.08868796},"labels":[],"label_agreement":null},{"id":"W2156963961","doi":"10.1007/978-3-642-35311-6_33","title":"Truthful Mechanism Design for Multidimensional Covering Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Covering problems; Set cover problem; Cover (algebra); Graph; Vertex cover; Mathematics; Facility location problem; Combinatorics; Vertex (graph theory); Computer science; Mechanism design; Mathematical optimization; Set (abstract data type); Discrete mathematics; Mathematical economics","score_opus":0.105812878856606,"score_gpt":0.33155948841233046,"score_spread":0.22574660955572445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156963961","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.009592613,0.0007040167,0.9839939,0.0005822982,0.00007548881,0.0001777519,0.000098969314,0.00016666202,0.0046082414],"genre_scores_gemma":[0.55157197,0.0017807089,0.43393555,0.000482788,0.00037356952,0.0013793795,0.00038295606,0.00015214231,0.0099409325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904047,0.0061570145,0.0005197967,0.0009457913,0.0014398384,0.0005328945],"domain_scores_gemma":[0.9794151,0.015200619,0.0011879124,0.002664491,0.00088711106,0.0006447927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01315816,0.0016707749,0.0026287744,0.001218596,0.0008346444,0.0047401492,0.0040926794,0.0037126092,0.0073322644],"category_scores_gemma":[0.03146299,0.0016715229,0.0018293599,0.002034362,0.0025280134,0.007644343,0.0037080613,0.004141348,0.00087164884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005075967,0.00024869418,0.00036763138,0.00055518415,0.0001657871,0.0000960316,0.00025777885,0.104196146,0.0021315175,0.80120736,0.004318538,0.085947774],"study_design_scores_gemma":[0.00016138633,0.00016786902,0.00007244325,0.00006490278,0.000041573803,0.00007742116,0.000022585959,0.2215433,0.00066030433,0.775468,0.0016957258,0.000024463343],"about_ca_topic_score_codex":0.00018487991,"about_ca_topic_score_gemma":0.00020092886,"teacher_disagreement_score":0.01315816,"about_ca_system_score_codex":0.0020651508,"about_ca_system_score_gemma":0.0016191045,"threshold_uncertainty_score":0.06958783},"labels":[],"label_agreement":null},{"id":"W2157082519","doi":"10.1007/978-3-319-06028-6_38","title":"Integrating Multiple Resources for Diversified Query Expansion","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Query expansion; Information retrieval; Resource (disambiguation); Relevance (law); Query optimization; Sargable; Principal (computer security); Web search query; Web query classification; Data mining; Search engine","score_opus":0.02062620191132638,"score_gpt":0.23480755195424038,"score_spread":0.214181350042914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157082519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05973681,0.0042649773,0.89716905,0.00093230186,0.00030326008,0.0005531318,0.0011191176,0.0203073,0.015614034],"genre_scores_gemma":[0.30535698,0.001645844,0.672298,0.000746879,0.00024225005,0.0003678398,0.004025838,0.002302504,0.013013925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714595,0.0006469258,0.00024395234,0.00043235376,0.0012017239,0.00032903568],"domain_scores_gemma":[0.99684983,0.0011672903,0.00008435637,0.0012564646,0.0005085346,0.00013352124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022370524,0.001253557,0.0020805704,0.0030146225,0.0009107587,0.0025662517,0.0027012776,0.0013599,0.00920212],"category_scores_gemma":[0.0064389138,0.0007398049,0.0011011458,0.004451107,0.00097593566,0.0067887073,0.005081389,0.0018567966,0.0030560032],"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.0011665298,0.0005304347,0.002755574,0.000817257,0.00022878904,0.0010203522,0.0009855548,0.029976746,0.06897085,0.03564153,0.04149955,0.8164069],"study_design_scores_gemma":[0.00022408836,0.00037999416,0.0018804742,0.00026904815,0.0005623908,0.0025428988,0.0009397306,0.6968979,0.10757199,0.084505826,0.10399537,0.00023026936],"about_ca_topic_score_codex":0.0029712983,"about_ca_topic_score_gemma":0.004332872,"teacher_disagreement_score":0.00920212,"about_ca_system_score_codex":0.0009044183,"about_ca_system_score_gemma":0.0010642374,"threshold_uncertainty_score":0.03078419},"labels":[],"label_agreement":null},{"id":"W2157085031","doi":"10.1007/11809678_39","title":"An Edge Ordering Problem of Regular Hypergraphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Permutation (music); Conjecture; Hypergraph; Mathematics; Integer (computer science); K-edge; Discrete mathematics; Constant (computer programming); Enhanced Data Rates for GSM Evolution; Physics; Computer science; Quantum mechanics","score_opus":0.006256702997084994,"score_gpt":0.18882510219296872,"score_spread":0.18256839919588372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157085031","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42919335,0.0032993397,0.4322082,0.00781767,0.0005239938,0.000428386,0.0027928257,0.00061879196,0.123117484],"genre_scores_gemma":[0.6638268,0.0051376354,0.2637505,0.0009175397,0.0010155531,0.00028844282,0.004667038,0.00063148775,0.059764978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892944,0.00035946246,0.0000662836,0.00024124078,0.00022030067,0.00018320123],"domain_scores_gemma":[0.9936231,0.0045549264,0.00036594868,0.000532406,0.00036594362,0.00055772794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011681914,0.00086394657,0.0013603786,0.0013711394,0.0017711916,0.004184425,0.0020105324,0.0026546952,0.011404745],"category_scores_gemma":[0.008381175,0.001195745,0.0010143265,0.0040194057,0.0015488,0.0086256545,0.0015784588,0.0034713983,0.00097263977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005801302,0.00047817244,0.0014659206,0.0008345736,0.00009217028,0.00057758694,0.00081128685,0.05551493,0.0047072605,0.80110717,0.025497233,0.10833363],"study_design_scores_gemma":[0.00007999443,0.00004740833,0.0004343947,0.00007213612,0.000033628574,0.00019558893,0.00034409607,0.059271764,0.0015175752,0.92859983,0.009381817,0.00002170669],"about_ca_topic_score_codex":0.002472716,"about_ca_topic_score_gemma":0.0025359339,"teacher_disagreement_score":0.011404745,"about_ca_system_score_codex":0.0014260603,"about_ca_system_score_gemma":0.0012952423,"threshold_uncertainty_score":0.038152695},"labels":[],"label_agreement":null},{"id":"W2157100124","doi":"10.1007/978-3-642-14527-8_5","title":"Privacy-Preserving Queries over Relational Databases","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; SQL; Relational database; Overhead (engineering); Private information retrieval; Information retrieval; Conjunctive query; Database; View; Data mining; Database design; Computer security; Programming language","score_opus":0.024207677916608644,"score_gpt":0.25685387146811356,"score_spread":0.23264619355150493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157100124","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.02946199,0.0018025379,0.9531531,0.0018916078,0.00015619582,0.0001393402,0.0009997134,0.0027156929,0.009679871],"genre_scores_gemma":[0.6864156,0.003909733,0.28915596,0.0011631093,0.00071022497,0.00025666517,0.003224623,0.0007866569,0.014377329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99179614,0.0017379167,0.0011138908,0.0009376386,0.003747544,0.00066686404],"domain_scores_gemma":[0.98760104,0.00550953,0.00053279835,0.00542425,0.0007342415,0.00019811527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046959333,0.0008043503,0.0017072107,0.0012489478,0.0010723568,0.0062426105,0.0024514569,0.0015113666,0.0037663996],"category_scores_gemma":[0.014325256,0.0008836616,0.0011203053,0.0039942223,0.0021478503,0.014193066,0.003929505,0.0029138706,0.0018079551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008620294,0.00019947371,0.0014407529,0.00059764925,0.0001336557,0.00050547294,0.0010593904,0.03240735,0.0150222825,0.6772051,0.017936254,0.25263056],"study_design_scores_gemma":[0.0001354716,0.00015118759,0.00036918005,0.00008841144,0.00012920875,0.0011193015,0.00035249052,0.12634422,0.02875965,0.7983083,0.044181626,0.00006084803],"about_ca_topic_score_codex":0.0005636262,"about_ca_topic_score_gemma":0.000335381,"teacher_disagreement_score":0.0062426105,"about_ca_system_score_codex":0.0010195383,"about_ca_system_score_gemma":0.0010623104,"threshold_uncertainty_score":0.024834812},"labels":[],"label_agreement":null},{"id":"W2157103903","doi":"10.1007/978-3-319-03841-4_6","title":"Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; sort; Graph drawing; Graph; Through-the-lens metering; Information visualization; Human–computer interaction; Lens (geology); Data science; Theoretical computer science; Information retrieval; Data mining","score_opus":0.0492574776147342,"score_gpt":0.3713611336227908,"score_spread":0.32210365600805657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157103903","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.0005963707,0.0005180076,0.995089,0.000522911,0.00004473853,0.000044807617,0.000108540335,0.0006970565,0.0023785247],"genre_scores_gemma":[0.017036691,0.00070667197,0.9795076,0.00009262476,0.00006312594,0.00015848746,0.00025487255,0.0004642975,0.0017156138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966127,0.0018825388,0.00022854104,0.0005149987,0.0006254782,0.00013558364],"domain_scores_gemma":[0.9917115,0.005170592,0.00042905897,0.0013120681,0.001049156,0.00032759775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058809207,0.0019595714,0.0009657058,0.007953495,0.0025564434,0.0125782015,0.0029478623,0.0019676557,0.0125276605],"category_scores_gemma":[0.01654159,0.0011871256,0.0026382543,0.008029051,0.006346365,0.010015684,0.003108497,0.0045388066,0.00218783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021494898,0.000019432991,0.00039852067,0.00030927648,0.00003648474,0.000060938255,0.0019838037,0.0041958895,0.0011650886,0.91481274,0.0078436425,0.06915261],"study_design_scores_gemma":[0.000013624949,0.000017881393,0.00028383982,0.00026897492,0.00003921099,0.00012838129,0.0007146776,0.03273844,0.0013219778,0.8949264,0.06951549,0.00003107808],"about_ca_topic_score_codex":0.008276751,"about_ca_topic_score_gemma":0.007940845,"teacher_disagreement_score":0.0125782015,"about_ca_system_score_codex":0.0026805573,"about_ca_system_score_gemma":0.0030215124,"threshold_uncertainty_score":0.041909218},"labels":[],"label_agreement":null},{"id":"W2157140780","doi":"10.1007/978-3-642-16108-7_20","title":"Toward a Classification of Finite Partial-Monitoring Games","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.1545661084896942,"score_gpt":0.40540969760175927,"score_spread":0.25084358911206506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157140780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19289507,0.0013383658,0.74190587,0.0022431288,0.00018599037,0.00032837188,0.0010731973,0.00063254515,0.05939753],"genre_scores_gemma":[0.81303555,0.0015144582,0.15643129,0.00076577853,0.00052569085,0.0006599006,0.0021405506,0.0002580834,0.024668682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998058,0.00053938164,0.00016985892,0.00042969984,0.00045798448,0.0003450796],"domain_scores_gemma":[0.99152094,0.0056442833,0.00069922616,0.0007045383,0.0005898582,0.0008411971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00245328,0.0013724283,0.0021430075,0.0021995616,0.0014348454,0.006085284,0.0032270763,0.0023629665,0.0073269703],"category_scores_gemma":[0.009946678,0.00080143724,0.0018838492,0.0021315091,0.0028583098,0.00662261,0.0024173993,0.005589872,0.0008378772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005197865,0.00006539504,0.0007436402,0.0000640089,0.000018234776,0.000033828124,0.00015793389,0.0062717125,0.0005081056,0.9758779,0.0026290503,0.013578226],"study_design_scores_gemma":[0.000028146611,0.000035510682,0.00038803468,0.000040858948,0.000015416983,0.000070307135,0.00005179789,0.07408147,0.00020978927,0.9229431,0.0021185933,0.000016955157],"about_ca_topic_score_codex":0.0016066242,"about_ca_topic_score_gemma":0.0014315248,"teacher_disagreement_score":0.0073269703,"about_ca_system_score_codex":0.0025819943,"about_ca_system_score_gemma":0.0019617195,"threshold_uncertainty_score":0.024511099},"labels":[],"label_agreement":null},{"id":"W2157251189","doi":"10.1007/978-3-540-30572-9_10","title":"Towards a Biologically Plausible Active Visual Search Model","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"York University","funders":"","keywords":"Foveal; Computer science; Macaque; Saccade; Visual search; Active vision; Representation (politics); Artificial intelligence; Eye movement; Computer vision; Neuroscience; Psychology","score_opus":0.04917503931131579,"score_gpt":0.2986314486069408,"score_spread":0.24945640929562501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157251189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00901486,0.00023355318,0.98481005,0.0004888669,0.00005158625,0.000021628162,0.00007115311,0.00024166887,0.005066662],"genre_scores_gemma":[0.6401245,0.0005809622,0.34000066,0.00043602553,0.00012019571,0.00025520916,0.00026707916,0.0003485203,0.017866904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999101,0.000025610936,0.0000044350313,0.000019641157,0.000029839113,0.000010362944],"domain_scores_gemma":[0.99971634,0.0001752314,0.000018001798,0.000026168942,0.000045106226,0.00001924411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036997529,0.00046469763,0.0007552419,0.00033685484,0.00033261377,0.0010305803,0.0018100559,0.0023293123,0.0033021024],"category_scores_gemma":[0.0014179433,0.0005217529,0.0006990583,0.00039032992,0.0007428072,0.0017314466,0.0010248233,0.0015335112,0.00083757704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063203566,0.00003158402,0.00011380384,0.00007927057,0.000030074347,0.0001036777,0.000084308595,0.7929085,0.006897081,0.17526135,0.0016978901,0.022729179],"study_design_scores_gemma":[0.000005599229,0.000006012563,0.000012960499,0.000002696972,0.0000026103576,0.000013963001,0.0000036584945,0.96765447,0.0002307289,0.031719297,0.00034503386,0.000002906981],"about_ca_topic_score_codex":0.0023729245,"about_ca_topic_score_gemma":0.0019943442,"teacher_disagreement_score":0.0033021024,"about_ca_system_score_codex":0.0005414983,"about_ca_system_score_gemma":0.00055768416,"threshold_uncertainty_score":0.011046588},"labels":[],"label_agreement":null},{"id":"W2157639579","doi":"10.1007/11678564_13","title":"An Abstract Machine Architecture for Web Service Based Business Process Management","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Simon Fraser University","funders":"","keywords":"Business Process Execution Language; Computer science; Business process; Abstract state machines; Web service; Software engineering; Service-oriented architecture; Formalism (music); Programming language; Key (lock); Process (computing); Architecture; Finite-state machine; Work in process; Operating system","score_opus":0.00956149422318499,"score_gpt":0.24165636253625863,"score_spread":0.23209486831307363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157639579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058806445,0.00012591488,0.9850176,0.00022053886,0.00007589734,0.000064988184,0.00006103747,0.0034695587,0.0050837942],"genre_scores_gemma":[0.23169647,0.00033795252,0.7510029,0.00022404749,0.000093537994,0.00027696358,0.0004729059,0.00054901507,0.015346192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994974,0.00011770084,0.00004742916,0.000082528735,0.00018745435,0.00006746677],"domain_scores_gemma":[0.9996848,0.00009905684,0.00001898131,0.00009385473,0.00007981461,0.000023457866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006047492,0.000468233,0.00061573385,0.0006044815,0.0007885683,0.0020072048,0.0011896952,0.0010971581,0.0056861066],"category_scores_gemma":[0.0013271606,0.00045512716,0.0007732512,0.0007060516,0.0009755489,0.0025480737,0.0010924408,0.0012817754,0.001923323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017040744,0.00012602018,0.0004907844,0.00018896449,0.00004686258,0.00022289615,0.00042793466,0.0661293,0.016655829,0.7518081,0.008086952,0.15564597],"study_design_scores_gemma":[0.000025012778,0.000074927746,0.00023274744,0.00004133344,0.000048679056,0.0000922942,0.000044766242,0.6720659,0.0072483495,0.28435627,0.035743076,0.000026595206],"about_ca_topic_score_codex":0.0027363396,"about_ca_topic_score_gemma":0.0026653935,"teacher_disagreement_score":0.0056861066,"about_ca_system_score_codex":0.0007735342,"about_ca_system_score_gemma":0.0009894124,"threshold_uncertainty_score":0.019021928},"labels":[],"label_agreement":null},{"id":"W2157797249","doi":"10.1007/11548669_35","title":"The Computational Complexity of Inference Using Rough Set Flow Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Inference; Bayesian network; Computer science; Graphical model; Bayes' theorem; Domain (mathematical analysis); Influence diagram; Set (abstract data type); Bayesian inference; Theoretical computer science; Mathematics; Rule of inference; Algorithm; Data mining; Bayesian probability; Machine learning; Artificial intelligence; Decision tree","score_opus":0.06452109091838701,"score_gpt":0.2905594270035479,"score_spread":0.2260383360851609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157797249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0673782,0.0012772748,0.9148863,0.004567589,0.00014310224,0.00016414403,0.00068962516,0.00069296104,0.010200834],"genre_scores_gemma":[0.62436986,0.0017958969,0.36637616,0.0005195468,0.00045652146,0.00036969004,0.0010897726,0.0003151532,0.004707339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930287,0.0032797675,0.00040329903,0.0008305709,0.00200802,0.0004496374],"domain_scores_gemma":[0.9005151,0.09139936,0.0014415701,0.004429416,0.0016139509,0.0006005454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007503316,0.0008587897,0.002851741,0.0023427978,0.0017888885,0.0071949833,0.0035025615,0.00232112,0.011108684],"category_scores_gemma":[0.057237808,0.0015909972,0.0037795927,0.0030564563,0.0034792472,0.020915011,0.0036340908,0.0048113437,0.00077947974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000520668,0.00018052374,0.0015361919,0.0004606146,0.00022086127,0.00020931984,0.0005523818,0.3888898,0.00092709943,0.47976464,0.0065162224,0.12022166],"study_design_scores_gemma":[0.000030915762,0.000017240953,0.00019641109,0.000022213742,0.000040565672,0.000033269018,0.0000663562,0.45235968,0.00026239868,0.5464303,0.0005214354,0.000019199219],"about_ca_topic_score_codex":0.008493062,"about_ca_topic_score_gemma":0.006342497,"teacher_disagreement_score":0.011108684,"about_ca_system_score_codex":0.0037810006,"about_ca_system_score_gemma":0.0026255234,"threshold_uncertainty_score":0.039681792},"labels":[],"label_agreement":null},{"id":"W2158033910","doi":"10.1007/978-3-540-68123-6_56","title":"Agent-Based Assistant for e-Negotiations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Saskatchewan","funders":"","keywords":"Negotiation; Reservation; Function (biology); Style (visual arts); Knowledge management; Computer science; Mode (computer interface); Operations research; Engineering; Human–computer interaction; Political science; Geography; Law","score_opus":0.034533555395809566,"score_gpt":0.2612747898887094,"score_spread":0.22674123449289982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158033910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039575878,0.0012564036,0.95670855,0.00022545569,0.00037656142,0.00015807789,0.00010779852,0.0041550207,0.03305465],"genre_scores_gemma":[0.15014063,0.0013312052,0.7671017,0.00023610439,0.00024527474,0.0004364409,0.000594424,0.00038051768,0.07953366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924433,0.00026634746,0.000055222146,0.00012761503,0.00024722473,0.00005922782],"domain_scores_gemma":[0.9993142,0.00035900655,0.000026301952,0.00014101231,0.00010359499,0.000055820903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082404306,0.0006513567,0.0007430649,0.00045391248,0.0009730282,0.002058919,0.0020723883,0.0014885298,0.02572136],"category_scores_gemma":[0.0025318915,0.00032787485,0.00040264623,0.00072067627,0.0004940642,0.0026907672,0.0019073534,0.0015738859,0.008549648],"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.00050120335,0.0003507436,0.00017973199,0.000728739,0.000043931657,0.00052687706,0.0006173237,0.013448951,0.017822094,0.24443224,0.034931496,0.6864166],"study_design_scores_gemma":[0.00024648604,0.00030296668,0.00027963766,0.00015724338,0.00006286721,0.0013616978,0.00030381343,0.3269702,0.030631142,0.20523007,0.434374,0.00007995738],"about_ca_topic_score_codex":0.00040644812,"about_ca_topic_score_gemma":0.00046026308,"teacher_disagreement_score":0.02572136,"about_ca_system_score_codex":0.00033455118,"about_ca_system_score_gemma":0.0005773908,"threshold_uncertainty_score":0.08604658},"labels":[],"label_agreement":null},{"id":"W2158148130","doi":"10.1007/bfb0053042","title":"Integrating constraints with an object-oriented language","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Kaleidoscope; Programming language; Constraint programming; Object-oriented programming; Object Constraint Language; Domain-specific language; Domain (mathematical analysis); Inheritance (genetic algorithm); Theoretical computer science; Mathematics","score_opus":0.007816275971165196,"score_gpt":0.22994008049353298,"score_spread":0.2221238045223678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158148130","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.0013520485,0.00014452347,0.98984665,0.0001845589,0.00007273121,0.000057257384,0.00005527081,0.0011718627,0.007115129],"genre_scores_gemma":[0.025545675,0.00040139235,0.96642804,0.00019086592,0.000069974725,0.00016143016,0.00022510657,0.0010459068,0.005931555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981958,0.0004505719,0.00021197824,0.00023901138,0.0007873596,0.00011526277],"domain_scores_gemma":[0.99671966,0.0020270029,0.00024554454,0.00049865065,0.00037129107,0.00013780712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025518527,0.0011896215,0.0009971504,0.0014646156,0.0012058452,0.004218321,0.0029420727,0.0012797371,0.010122257],"category_scores_gemma":[0.006278489,0.0014052264,0.0014973226,0.0021327508,0.0018610061,0.005729706,0.0035156787,0.002928313,0.002364181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060280938,0.00011075252,0.00039002104,0.000618098,0.0000626831,0.0004784091,0.000793391,0.013438413,0.005728839,0.7861414,0.008644833,0.18353286],"study_design_scores_gemma":[0.0000845681,0.00007210077,0.0002132778,0.00036984397,0.00019346575,0.00058092637,0.00017084074,0.09759358,0.0122636175,0.5789263,0.30944037,0.00009103984],"about_ca_topic_score_codex":0.002365525,"about_ca_topic_score_gemma":0.0039815283,"teacher_disagreement_score":0.010122257,"about_ca_system_score_codex":0.00056846807,"about_ca_system_score_gemma":0.0016248124,"threshold_uncertainty_score":0.033862352},"labels":[],"label_agreement":null},{"id":"W2158155425","doi":"10.1007/978-3-540-30125-7_71","title":"Motion-Compensated Wavelet Video Denoising","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Computer science; Noise reduction; Artificial intelligence; Video denoising; Estimator; Motion estimation; Kalman filter; Computer vision; Noise (video); Wavelet transform; Pattern recognition (psychology); Algorithm; Mathematics; Video processing; Video tracking; Image (mathematics); Statistics","score_opus":0.02112498679464196,"score_gpt":0.2625420182531446,"score_spread":0.24141703145850263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158155425","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.009515817,0.0027618022,0.9764454,0.00015111973,0.0002583583,0.000017936252,0.00006950609,0.0004248415,0.010355178],"genre_scores_gemma":[0.14624032,0.009813136,0.6834008,0.00024791362,0.000470398,0.000048606304,0.0008031345,0.00054768415,0.15842806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999212,0.000006967634,0.0000033690158,0.000016990089,0.000045749082,0.000005668856],"domain_scores_gemma":[0.99990404,0.000023963661,0.0000074586446,0.000018305836,0.000041368356,0.0000048115226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016520952,0.00047240185,0.00038625614,0.00040110748,0.00009262061,0.00034416743,0.00043353724,0.00051829655,0.004316864],"category_scores_gemma":[0.00040790174,0.0002208962,0.000278623,0.00046500735,0.000229603,0.00045694574,0.0002975738,0.0005425458,0.0025680463],"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.00012477454,0.000050961346,0.00014921713,0.00024120786,0.000035020945,0.00014938116,0.000058941572,0.01849629,0.2787936,0.02168454,0.010206165,0.67000985],"study_design_scores_gemma":[0.000023043542,0.00018634748,0.001450525,0.0000885816,0.00009417393,0.0014686574,0.000038185768,0.5357785,0.35583764,0.017840803,0.08715601,0.000037548536],"about_ca_topic_score_codex":0.00033702765,"about_ca_topic_score_gemma":0.00058327714,"teacher_disagreement_score":0.004316864,"about_ca_system_score_codex":0.00014255849,"about_ca_system_score_gemma":0.0001207279,"threshold_uncertainty_score":0.014441371},"labels":[],"label_agreement":null},{"id":"W2158331236","doi":"10.1007/978-3-319-20609-7_8","title":"Design and Evaluation of a Learning Assistant System with Optical Head-Mounted Display (OHMD)","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Carleton University","funders":"","keywords":"Computer science; Usability; Distraction; Focus (optics); Human–computer interaction; Wearable computer; Multimedia; Presentation (obstetrics); Optical head-mounted display; Adaptation (eye); Projection (relational algebra); Head (geology); Control (management); Artificial intelligence; Embedded system","score_opus":0.04737809472747771,"score_gpt":0.3146109065726513,"score_spread":0.26723281184517356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158331236","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.6783194,0.0004681981,0.31068206,0.00020555107,0.0002014543,0.0019551874,0.00045511522,0.0036431851,0.004069867],"genre_scores_gemma":[0.8053642,0.00026979003,0.1852598,0.00017725622,0.000029704132,0.00061384175,0.00039673498,0.00012417533,0.0077645388],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939764,0.0001441701,0.000051852505,0.00013686693,0.00018841866,0.0000810571],"domain_scores_gemma":[0.9990509,0.00022380929,0.00004162082,0.00007981505,0.00046321188,0.00014073886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729362,0.00053022034,0.00052549044,0.00039623905,0.00048006495,0.0007724396,0.0014598672,0.000842237,0.0070763184],"category_scores_gemma":[0.0015118307,0.00028988047,0.0003431565,0.00017803433,0.00020107394,0.0006490057,0.00056527596,0.0002739953,0.0013313936],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003934203,0.0019101583,0.009153121,0.0013717111,0.00020781082,0.00059514533,0.0010434592,0.00558869,0.7053437,0.0010022646,0.0027401708,0.2671095],"study_design_scores_gemma":[0.0018570451,0.037084665,0.05563249,0.00013391124,0.0015020357,0.0024063806,0.001635359,0.15214045,0.70449746,0.0005150309,0.042419907,0.00017533074],"about_ca_topic_score_codex":0.0017268683,"about_ca_topic_score_gemma":0.0016433133,"teacher_disagreement_score":0.0070763184,"about_ca_system_score_codex":0.00035573778,"about_ca_system_score_gemma":0.00079998374,"threshold_uncertainty_score":0.02367264},"labels":[],"label_agreement":null},{"id":"W2158424251","doi":"10.1007/978-3-540-30139-4_6","title":"Evaluating a Probabilistic Model of Student Affect","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Affect (linguistics); Probabilistic logic; Bayesian network; Focus (optics); Statistical model; Dynamic Bayesian network; Machine learning; Arousal; Bayesian probability; Artificial intelligence; Empirical research; Emotion detection; Affective computing; Emotion recognition; Psychology; Social psychology; Statistics","score_opus":0.0724588039669964,"score_gpt":0.33149469008571114,"score_spread":0.25903588611871475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158424251","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.8152854,0.00022609779,0.17903918,0.00046093873,0.000061866136,0.00008863267,0.00017235047,0.0003331098,0.004332491],"genre_scores_gemma":[0.99309385,0.000048833346,0.006119609,0.000035600002,0.000022479166,0.00003536435,0.00013872837,0.000019888656,0.00048564837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977283,0.0012741552,0.00006615152,0.0004470503,0.00036455374,0.00011990105],"domain_scores_gemma":[0.9678611,0.028831983,0.0010113794,0.0010009101,0.0007853192,0.00050935824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064710667,0.00059601257,0.00080284674,0.00072352897,0.00039261385,0.0023458079,0.0009116013,0.0015099187,0.0022034517],"category_scores_gemma":[0.032009494,0.00054800505,0.00065566663,0.0005982852,0.00082869845,0.0025834083,0.0013283292,0.0014567142,0.00040302754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036481905,0.00094314996,0.11809938,0.00013797043,0.0007030921,0.00015689108,0.0010138905,0.71292824,0.004195191,0.01824853,0.0021746357,0.13775086],"study_design_scores_gemma":[0.000025570791,0.00015759561,0.012372735,0.0000061512696,0.000040022554,0.00002327814,0.000045061817,0.98105836,0.00031667342,0.0058633587,0.00007499193,0.000016192778],"about_ca_topic_score_codex":0.0033144257,"about_ca_topic_score_gemma":0.0035863821,"teacher_disagreement_score":0.0064710667,"about_ca_system_score_codex":0.0011784155,"about_ca_system_score_gemma":0.00056266674,"threshold_uncertainty_score":0.034222662},"labels":[],"label_agreement":null},{"id":"W2158452540","doi":"10.1007/978-3-642-02976-9_23","title":"Integrating Healthcare Knowledge Artifacts for Clinical Decision Support: Towards Semantic Web Based Healthcare Knowledge Morphing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Health care; Semantic Web; Knowledge management; Clinical decision support system; Ontology; Knowledge-based systems; Open Knowledge Base Connectivity; Knowledge integration; Medical knowledge; Domain knowledge; Data science; Decision support system; Information retrieval; Personal knowledge management; Artificial intelligence; Medicine; Organizational learning","score_opus":0.07929079979139456,"score_gpt":0.3778479465919996,"score_spread":0.2985571468006051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158452540","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.012544853,0.0014070264,0.96927476,0.0018316683,0.000136309,0.00019652845,0.0003705427,0.0015033013,0.012734922],"genre_scores_gemma":[0.12972647,0.0020140437,0.8613631,0.00048707862,0.000056845267,0.00010980173,0.0017729095,0.00037900312,0.0040907385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974734,0.00089807186,0.00043913483,0.00028419975,0.0007947057,0.000110461195],"domain_scores_gemma":[0.99543864,0.0021220704,0.00027887663,0.001433175,0.0005769829,0.0001503582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045608585,0.0005753335,0.00067258393,0.003334618,0.00079453504,0.0060475506,0.0017590616,0.0016724182,0.0023346872],"category_scores_gemma":[0.0069897184,0.0007122417,0.0017173984,0.0041261544,0.0017476503,0.0074326736,0.0053225732,0.0017499444,0.00116374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012765347,0.0003956314,0.00267324,0.0013510298,0.0002742736,0.000961814,0.0039392724,0.014819691,0.014160234,0.25760925,0.009351895,0.694336],"study_design_scores_gemma":[0.000055401033,0.0001269345,0.002164239,0.0012023243,0.0004684613,0.0018990969,0.0020945903,0.15573213,0.041272394,0.5318394,0.2630325,0.00011261829],"about_ca_topic_score_codex":0.0013296264,"about_ca_topic_score_gemma":0.001725984,"teacher_disagreement_score":0.0060475506,"about_ca_system_score_codex":0.0007906299,"about_ca_system_score_gemma":0.0019177959,"threshold_uncertainty_score":0.02412039},"labels":[],"label_agreement":null},{"id":"W2158481811","doi":"10.1007/978-3-642-40811-3_26","title":"Left-Invariant Metrics for Diffeomorphic Image Registration with Spatially-Varying Regularisation","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Baycrest Hospital","funders":"","keywords":"Diffeomorphism; Invariant (physics); Computer science; Artificial intelligence; Computer vision; Metric (unit); Image registration; Image (mathematics); Pattern recognition (psychology); Algorithm; Mathematics; Pure mathematics","score_opus":0.01618200912438223,"score_gpt":0.2599516482335468,"score_spread":0.24376963910916455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158481811","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.013157833,0.00033538172,0.9848534,0.00019496393,0.000045812725,0.00003911536,0.00007308875,0.00024811493,0.0010521638],"genre_scores_gemma":[0.39331105,0.0012952181,0.5941141,0.0002185445,0.0002463544,0.000306916,0.00077337207,0.0012949303,0.008439506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879634,0.00044139888,0.00010335228,0.00026475117,0.0003312096,0.000062857056],"domain_scores_gemma":[0.9978442,0.00069872855,0.0003882875,0.00045360916,0.00045256517,0.00016257518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018186666,0.0009723702,0.0010813139,0.0019426395,0.000514078,0.0017684485,0.0010458714,0.0013296828,0.0019462724],"category_scores_gemma":[0.008822572,0.00055075623,0.00090171694,0.0011655649,0.0017350311,0.0024455125,0.0029783598,0.0016516219,0.00083008624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002618046,0.00011345923,0.00094389357,0.0003518932,0.00013894105,0.0003158179,0.00034955985,0.13623686,0.042623784,0.5345154,0.0047851037,0.27936345],"study_design_scores_gemma":[0.000021687816,0.00018817767,0.00074409,0.000034279867,0.000033915083,0.00033447682,0.00006311006,0.75751805,0.0101186875,0.22408164,0.006795578,0.00006631423],"about_ca_topic_score_codex":0.0019866594,"about_ca_topic_score_gemma":0.0019332995,"teacher_disagreement_score":0.0019866594,"about_ca_system_score_codex":0.0010305493,"about_ca_system_score_gemma":0.00094691466,"threshold_uncertainty_score":0.009618163},"labels":[],"label_agreement":null},{"id":"W2158668414","doi":"10.1007/3-540-45244-3_10","title":"Data Mining with Calendar Attributes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Generalization; Probabilistic logic; Granularity; Data mining; Graph; Theoretical computer science; Probability distribution; Domain (mathematical analysis); Set (abstract data type); Artificial intelligence; Mathematics; Statistics; Programming language","score_opus":0.045830102197593814,"score_gpt":0.26138535238206634,"score_spread":0.21555525018447252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158668414","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.03356081,0.003246861,0.9288891,0.0010222165,0.0006920545,0.00029468213,0.008837292,0.008295069,0.015161925],"genre_scores_gemma":[0.27084273,0.002822659,0.69395083,0.00035352525,0.0005429971,0.0002607955,0.014793358,0.0003823168,0.016050782],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908304,0.00015790995,0.00013795879,0.0002692838,0.00030357405,0.000048231053],"domain_scores_gemma":[0.99794465,0.0007412484,0.00017794661,0.0007986335,0.0002256202,0.00011177492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014394699,0.00048172916,0.0007200488,0.0022013895,0.0006746729,0.0023372998,0.0011481007,0.00036857402,0.005175346],"category_scores_gemma":[0.006423095,0.00042325025,0.0011186885,0.00568777,0.00029800704,0.0027244785,0.0014120217,0.00081539166,0.0033800786],"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.000404226,0.00016613981,0.012129806,0.0004778213,0.00015772239,0.00022300959,0.00017329254,0.010035351,0.0034172079,0.02716664,0.034235857,0.9114129],"study_design_scores_gemma":[0.000116747455,0.0003289935,0.010529831,0.00029075917,0.0002745048,0.002097808,0.00048852904,0.4166314,0.024703765,0.25203314,0.29241684,0.00008771333],"about_ca_topic_score_codex":0.00089532766,"about_ca_topic_score_gemma":0.0013849766,"teacher_disagreement_score":0.005175346,"about_ca_system_score_codex":0.00029680878,"about_ca_system_score_gemma":0.0008846717,"threshold_uncertainty_score":0.017313302},"labels":[],"label_agreement":null},{"id":"W2158742238","doi":"10.1007/978-3-540-72990-7_12","title":"Adaptive Congestion Control Under Dynamic Weather Condition for Wireless and Satellite Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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; Eion (Canada)","funders":"","keywords":"Network congestion; Computer science; Computer network; Quality of service; Random early detection; Communications satellite; Satellite; Real-time computing; Active queue management; Engineering; Network packet","score_opus":0.012652753148347748,"score_gpt":0.24077163891073664,"score_spread":0.2281188857623889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158742238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12130409,0.0026728234,0.8550214,0.0003644055,0.00056214345,0.00006584315,0.00007868836,0.00112085,0.01880975],"genre_scores_gemma":[0.98679304,0.0004936449,0.008324993,0.000024634366,0.000112042326,0.000020244323,0.000030586212,0.00003314932,0.00416772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999913,0.0000124462695,0.0000034848597,0.000019071915,0.000029147946,0.00002284663],"domain_scores_gemma":[0.9998436,0.00007364443,0.000020839867,0.00001106987,0.000040028553,0.000010710301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017453634,0.00042347502,0.00034981125,0.00025027932,0.0002570128,0.00043138512,0.0005945219,0.00030376617,0.0015182361],"category_scores_gemma":[0.00076437683,0.00014531077,0.0001682411,0.00027408075,0.0002759897,0.00049666566,0.00032996392,0.00050015707,0.000111483714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018041964,0.00006141796,0.00059679383,0.00011357004,0.0000398016,0.000118252145,0.000110902794,0.78721565,0.022451935,0.015311831,0.005067134,0.16873232],"study_design_scores_gemma":[0.000010313788,0.000038362898,0.00042866674,0.0000038962767,0.000013426031,0.000019452238,0.000012939731,0.99382704,0.0011258613,0.003513907,0.0009992153,0.0000069290995],"about_ca_topic_score_codex":0.003747145,"about_ca_topic_score_gemma":0.004334386,"teacher_disagreement_score":0.003747145,"about_ca_system_score_codex":0.0003813237,"about_ca_system_score_gemma":0.00020237146,"threshold_uncertainty_score":0.00745064},"labels":[],"label_agreement":null},{"id":"W2158770844","doi":"10.1007/978-3-540-30126-4_92","title":"A Secure and Localizing Watermarking Technique for Image Authentication","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Digital watermarking; Computer science; Hash function; String (physics); Pixel; Image (mathematics); Algorithm; Authentication (law); Signature (topology); Cryptography; Watermark; Encryption; Statistic; Theoretical computer science; Pattern recognition (psychology); Artificial intelligence; Mathematics; Statistics; Computer security","score_opus":0.011841279393440356,"score_gpt":0.25266451405629203,"score_spread":0.2408232346628517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158770844","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.023290496,0.0016060552,0.9602385,0.00021477255,0.00021439722,0.00010572599,0.000055307904,0.0021523975,0.0121223545],"genre_scores_gemma":[0.34201932,0.003236345,0.5795341,0.00022587574,0.00034349944,0.00013717772,0.00020982696,0.0004291774,0.07386467],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999801,0.000017239056,0.000008706934,0.000033086664,0.00011874456,0.00002129194],"domain_scores_gemma":[0.9997718,0.00005683964,0.000030559077,0.000090536916,0.00003863807,0.000011742875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013265076,0.000578162,0.00045081272,0.000666728,0.00053230743,0.00041229176,0.0006274144,0.00065587636,0.0045928652],"category_scores_gemma":[0.00038183134,0.00030573693,0.0003888621,0.00075509545,0.0007417723,0.0012617637,0.0008605222,0.0010087346,0.0026079526],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013444546,0.00005568527,0.000083484185,0.00015098936,0.00001701143,0.00031320262,0.00012999511,0.002359498,0.68521506,0.026356693,0.0028733197,0.2823106],"study_design_scores_gemma":[0.000039586397,0.0005708669,0.00083107554,0.00004608651,0.00011912972,0.0039788513,0.00006407895,0.06588701,0.84405017,0.014223907,0.07012545,0.000063741776],"about_ca_topic_score_codex":0.00015265228,"about_ca_topic_score_gemma":0.00032848216,"teacher_disagreement_score":0.0045928652,"about_ca_system_score_codex":0.00016094832,"about_ca_system_score_gemma":0.0002226491,"threshold_uncertainty_score":0.015364647},"labels":[],"label_agreement":null},{"id":"W2159111594","doi":"10.1007/11534273_3","title":"Heap Building Bounds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heap (data structure); Computer science; Programming language","score_opus":0.020962658027573466,"score_gpt":0.2585022915845295,"score_spread":0.237539633556956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159111594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069354987,0.0048068613,0.5253119,0.0024686444,0.001138002,0.00016938959,0.002572233,0.009241675,0.4473558],"genre_scores_gemma":[0.20701692,0.008940041,0.45238423,0.001682868,0.001441591,0.00059988484,0.011210794,0.010583459,0.3061402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976152,0.00029526942,0.00014968864,0.00052482676,0.0010201806,0.00039483918],"domain_scores_gemma":[0.9957283,0.0013856938,0.00011681433,0.001953441,0.0006321424,0.00018356313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014152593,0.0019550407,0.0014001343,0.002668737,0.002198488,0.006382676,0.004193977,0.0018482035,0.09241145],"category_scores_gemma":[0.0077327937,0.0017448989,0.001492381,0.004439024,0.0015533328,0.013752472,0.0059206737,0.005951171,0.041145343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001500944,0.000117481715,0.00033035557,0.00043804673,0.00002977959,0.00006909081,0.0003139433,0.005196861,0.0025255107,0.632215,0.09078821,0.26782554],"study_design_scores_gemma":[0.000026493333,0.00003690269,0.0003797832,0.0003433847,0.00007346602,0.00022162867,0.00012110893,0.014778028,0.009494212,0.72718096,0.2472958,0.000048250957],"about_ca_topic_score_codex":0.0016845849,"about_ca_topic_score_gemma":0.00242935,"teacher_disagreement_score":0.09241145,"about_ca_system_score_codex":0.0023416001,"about_ca_system_score_gemma":0.0019208156,"threshold_uncertainty_score":0.30914712},"labels":[],"label_agreement":null},{"id":"W2159315530","doi":"10.1007/3-540-45153-6_31","title":"The Bottom-Up Freezing: An Approach to Neural Engineering","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Computer science; Node (physics); Pruning; Artificial neural network; Generalization; Reduction (mathematics); Training (meteorology); Process (computing); Artificial intelligence; Layer (electronics); Algorithm; Machine learning; Mathematics; Materials science","score_opus":0.020903927110734372,"score_gpt":0.23625487459041905,"score_spread":0.21535094747968467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159315530","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.0016949638,0.0005320948,0.9863231,0.00031506276,0.0001278714,0.000022158205,0.000033373984,0.00019007738,0.010761286],"genre_scores_gemma":[0.31122336,0.004118135,0.6298323,0.0010077065,0.00067145616,0.00033701834,0.0002587581,0.00075381517,0.051797334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969447,0.00008149445,0.00001566488,0.000048393485,0.00012655988,0.000033483233],"domain_scores_gemma":[0.99958426,0.00019012782,0.000024914618,0.00009573939,0.000076839104,0.000028077893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115402,0.00092979864,0.001040425,0.00064968556,0.0006964563,0.0015930338,0.0026956648,0.0010896018,0.0062832083],"category_scores_gemma":[0.0024844997,0.0005415662,0.0009401735,0.0008680881,0.0018108133,0.002620643,0.0031592278,0.0031313626,0.0011380597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037505157,0.00003110645,0.0001241649,0.00013025779,0.000034315854,0.00006502534,0.00008447969,0.14904596,0.0016697446,0.7389746,0.005507977,0.104294896],"study_design_scores_gemma":[0.000004538005,0.000016191445,0.000029108769,0.000020414102,0.0000107043925,0.000024783532,0.000011924338,0.40322694,0.00075300987,0.59144694,0.0044454797,0.000009928148],"about_ca_topic_score_codex":0.0022650633,"about_ca_topic_score_gemma":0.002374406,"teacher_disagreement_score":0.0062832083,"about_ca_system_score_codex":0.00063538196,"about_ca_system_score_gemma":0.0007874198,"threshold_uncertainty_score":0.0210194},"labels":[],"label_agreement":null},{"id":"W2159384568","doi":"10.1007/3-540-36124-3_14","title":"Supporting Peer-to-Peer User Communities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"File sharing; Software deployment; Peer-to-peer; Computer science; World Wide Web; Internet privacy; Coping (psychology); Peer review; Knowledge management; Psychology; Political science; The Internet; Software engineering","score_opus":0.028798004251518385,"score_gpt":0.2731503917317483,"score_spread":0.24435238748022994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159384568","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07736582,0.0010598454,0.8840799,0.0007652076,0.0004275801,0.00067110226,0.00022101264,0.0050488384,0.030360723],"genre_scores_gemma":[0.7029315,0.0009969716,0.26325893,0.00019437862,0.00046280236,0.00053700607,0.00057535194,0.0004739091,0.030569073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834,0.00046356837,0.00006644887,0.00027486793,0.000671216,0.00018395703],"domain_scores_gemma":[0.99174964,0.0041865436,0.0003285296,0.001333539,0.001589771,0.0008120127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606433,0.0007359904,0.0010821724,0.0009086845,0.0022634754,0.002243234,0.0030760202,0.0019814144,0.006123544],"category_scores_gemma":[0.0104193315,0.0006241749,0.00046057184,0.0012220045,0.0006860152,0.005074396,0.0041961144,0.0012239331,0.0034603951],"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.0010518873,0.0011079275,0.0032184448,0.0015915016,0.00021809957,0.0019266844,0.0042418335,0.051642746,0.07377058,0.17581917,0.04060295,0.64480823],"study_design_scores_gemma":[0.000320386,0.00043781174,0.00086508144,0.00011768495,0.00014136692,0.0014376778,0.0011479385,0.60912603,0.039227206,0.25888476,0.08816283,0.00013122447],"about_ca_topic_score_codex":0.0009593625,"about_ca_topic_score_gemma":0.0013706131,"teacher_disagreement_score":0.006123544,"about_ca_system_score_codex":0.00032849688,"about_ca_system_score_gemma":0.00082452147,"threshold_uncertainty_score":0.020485282},"labels":[],"label_agreement":null},{"id":"W2159447498","doi":"10.1007/978-3-319-09704-6_9","title":"Most Complex Regular Right-Ideal Languages","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Quotient; Semigroup; Regular language; Mathematics; Alphabet; Discrete mathematics; State (computer science); Combinatorics; Computer science; Algorithm; Automaton; Linguistics; Theoretical computer science; Law","score_opus":0.011298781156436755,"score_gpt":0.23732970020095248,"score_spread":0.22603091904451572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159447498","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.1669521,0.0025093257,0.20467152,0.0030727957,0.00041648038,0.00013234843,0.001175786,0.0013638921,0.61970574],"genre_scores_gemma":[0.80872416,0.0016064611,0.037355207,0.0006434954,0.00053233193,0.00015439943,0.001062079,0.00076983566,0.14915194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928826,0.0001002176,0.000046273966,0.0001711222,0.00027005258,0.00012414122],"domain_scores_gemma":[0.9991032,0.00040804842,0.00007447396,0.00016852237,0.00015516866,0.000090679365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006769248,0.0005735819,0.0006579073,0.0009176435,0.0013792069,0.0037322592,0.00079356163,0.000622695,0.018781768],"category_scores_gemma":[0.0014719681,0.00063408917,0.0005972913,0.0008084964,0.0025020048,0.0064448374,0.0015826826,0.00202005,0.0056527853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000465764,0.000014400472,0.00008177337,0.00007514086,0.000005453161,0.00006134257,0.00035736608,0.00032925387,0.0024085848,0.9841427,0.002780789,0.009696567],"study_design_scores_gemma":[0.000015670419,0.000012404434,0.00013329169,0.000025198913,0.000008160054,0.0002597726,0.00013171606,0.0011097129,0.0026653232,0.9704451,0.025177091,0.000016592638],"about_ca_topic_score_codex":0.00027207937,"about_ca_topic_score_gemma":0.00035032537,"teacher_disagreement_score":0.018781768,"about_ca_system_score_codex":0.00083388964,"about_ca_system_score_gemma":0.00043970149,"threshold_uncertainty_score":0.06283134},"labels":[],"label_agreement":null},{"id":"W2159482394","doi":"10.1007/978-3-540-30189-9_26","title":"Mobility Prediction in Wireless Networks Using Neural Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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":"","keywords":"Computer science; Wireless network; Resource (disambiguation); Artificial neural network; Computer network; Wireless; Distributed computing; Resource allocation; Machine learning; Artificial intelligence; Telecommunications","score_opus":0.020528751301627308,"score_gpt":0.25443952094178357,"score_spread":0.23391076964015625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159482394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087513514,0.0040274034,0.9029482,0.0008837548,0.00022962216,0.000037476926,0.00024919404,0.0008418067,0.0032690014],"genre_scores_gemma":[0.92812693,0.0018787578,0.06438216,0.0001152035,0.00020332113,0.00006867244,0.00030936408,0.00005294534,0.004862626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998658,0.00002922367,0.000011863731,0.00003853715,0.000026840376,0.000027707758],"domain_scores_gemma":[0.99889356,0.0008000774,0.000081499464,0.000042632735,0.00015327141,0.00002903604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068138895,0.0005410139,0.00070999004,0.0006175446,0.0003314233,0.00065235724,0.0009811289,0.000976755,0.001122638],"category_scores_gemma":[0.0027841772,0.00046842452,0.00042711693,0.000921348,0.000398587,0.0013361011,0.00051465555,0.0011118047,0.00028475537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005087167,0.000027731345,0.0012010403,0.000026920596,0.000024464098,0.000023240602,0.000013086036,0.93642503,0.00036549722,0.0019287609,0.00073602644,0.05917719],"study_design_scores_gemma":[8.909966e-7,0.0000024852725,0.0000950067,0.0000022522477,0.0000021358615,0.0000025070349,0.0000013434724,0.9987708,0.000085208136,0.0009995081,0.000036665708,0.000001194794],"about_ca_topic_score_codex":0.01461578,"about_ca_topic_score_gemma":0.011305842,"teacher_disagreement_score":0.01461578,"about_ca_system_score_codex":0.00075652223,"about_ca_system_score_gemma":0.00034134058,"threshold_uncertainty_score":0.029061377},"labels":[],"label_agreement":null},{"id":"W2159593426","doi":"10.1007/978-3-642-15711-0_3","title":"Extraction of the Plane of Minimal Cross-Sectional Area of the Corpus Callosum Using Template-Driven Segmentation","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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 British Columbia; Western University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Corpus callosum; Segmentation; Computer science; Artificial intelligence; Bottleneck; Plane (geometry); Pattern recognition (psychology); Cross section (physics); Magnetic resonance imaging; Artificial neural network; Computer vision; Anatomy; Mathematics; Physics; Geometry; Medicine; Radiology","score_opus":0.061906115286102466,"score_gpt":0.37233952337964477,"score_spread":0.3104334080935423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159593426","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.057461053,0.0010460992,0.9294867,0.0003997262,0.000097874385,0.00034065443,0.0023323807,0.006298374,0.0025371097],"genre_scores_gemma":[0.15743382,0.00087829464,0.8365172,0.00011059963,0.000076188844,0.0002987999,0.002138412,0.001178008,0.0013686549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.00005564473,0.000041321808,0.00012871943,0.00012731437,0.000077082186],"domain_scores_gemma":[0.99896073,0.00034705785,0.00011953495,0.0001713115,0.00034665925,0.000054724533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696938,0.0012340712,0.0013585525,0.0042028264,0.0006925892,0.0028912975,0.0011963386,0.0023695922,0.0024220967],"category_scores_gemma":[0.0038509306,0.0010191144,0.0016981765,0.0030026624,0.00045860198,0.000850086,0.00088852213,0.0012083079,0.00207137],"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.00071307545,0.00013091527,0.008786119,0.000918338,0.00035967023,0.0016819276,0.0007158308,0.036906924,0.28501612,0.012052927,0.017609127,0.63510895],"study_design_scores_gemma":[0.00013316727,0.00020481671,0.02920666,0.00029072093,0.0005484055,0.006027677,0.00047077687,0.6639377,0.23987065,0.022618128,0.036410853,0.00028050685],"about_ca_topic_score_codex":0.009393721,"about_ca_topic_score_gemma":0.0073296167,"teacher_disagreement_score":0.009393721,"about_ca_system_score_codex":0.0005758516,"about_ca_system_score_gemma":0.0043154955,"threshold_uncertainty_score":0.01867807},"labels":[],"label_agreement":null},{"id":"W2159605714","doi":"10.1007/978-3-642-04268-3_70","title":"Asymmetric Image-Template Registration","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Center for Research Resources; National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institutes of Health; National Science Foundation","keywords":"Pairwise comparison; Image registration; Computer science; Artificial intelligence; Image (mathematics); Computer vision; Constraint (computer-aided design); Function (biology); Domain (mathematical analysis); Pattern recognition (psychology); Mathematics; Geometry","score_opus":0.01433333251436369,"score_gpt":0.29520530832694236,"score_spread":0.28087197581257867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159605714","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.0039186827,0.000068767746,0.9938291,0.00008367817,0.000041804284,0.0000445626,0.000038413862,0.00040138868,0.0015736343],"genre_scores_gemma":[0.28314346,0.00033236275,0.70595783,0.0003653925,0.00012207817,0.00028577412,0.0005465489,0.0008591349,0.0083874455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963445,0.0008540593,0.00023599587,0.0007559989,0.0016227186,0.00018679604],"domain_scores_gemma":[0.9953778,0.0010317919,0.00043797493,0.0023896492,0.00064336596,0.00011946148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031576948,0.0009398727,0.00148697,0.0010028004,0.0006064779,0.0018805608,0.0026232842,0.0017873768,0.0056557343],"category_scores_gemma":[0.011805909,0.0006662237,0.0011076592,0.0014354173,0.001297421,0.003009535,0.0040057534,0.002065302,0.003542017],"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.00038833512,0.00016901332,0.0018353179,0.00038342088,0.00016562469,0.0007397929,0.000410806,0.10028582,0.18310072,0.17440926,0.009742629,0.5283693],"study_design_scores_gemma":[0.000053619067,0.00023818777,0.0020783946,0.00004206891,0.00009760208,0.0035026215,0.00012541814,0.73490226,0.1207804,0.10364298,0.034436453,0.00009991276],"about_ca_topic_score_codex":0.00085702766,"about_ca_topic_score_gemma":0.0011082556,"teacher_disagreement_score":0.0056557343,"about_ca_system_score_codex":0.00061812135,"about_ca_system_score_gemma":0.0013399746,"threshold_uncertainty_score":0.018920302},"labels":[],"label_agreement":null},{"id":"W2159636735","doi":"10.1007/978-3-642-28412-0_6","title":"Towards a First-Order Deontic Action Logic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Action (physics); Extension (predicate logic); Normal modal logic; Accessibility relation; Dynamic logic (digital electronics); Propositional calculus; Order (exchange); Artificial intelligence; Programming language; Theoretical computer science; Algorithm; Description logic; Intermediate logic; Epistemology; Multimodal logic; Philosophy","score_opus":0.0559099361370329,"score_gpt":0.3075559766692313,"score_spread":0.2516460405321984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159636735","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.0032065113,0.00044535554,0.95561194,0.0009927569,0.00027631246,0.000055643995,0.00016148425,0.00055758015,0.038692404],"genre_scores_gemma":[0.16532438,0.0013847706,0.77461636,0.0010094261,0.00038804457,0.00020766273,0.0006463861,0.0005748748,0.055848084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00029195115,0.00010598797,0.0002789382,0.0005207113,0.00013045361],"domain_scores_gemma":[0.99881136,0.000549826,0.000057823407,0.0002098052,0.0002848938,0.00008623504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023955693,0.00086600863,0.00078517414,0.0011101892,0.0014367548,0.0038365617,0.0019143221,0.0017420225,0.0071807154],"category_scores_gemma":[0.002383991,0.001088373,0.0020701252,0.0009214024,0.0040079607,0.0064920573,0.002329022,0.0062128133,0.0031992549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067360425,0.000008652475,0.000019101777,0.000028386748,0.0000030573192,0.000018584697,0.00011621265,0.000740603,0.0005086788,0.99115235,0.0008121779,0.006585499],"study_design_scores_gemma":[0.000007867598,0.000010751402,0.00002449199,0.000028504106,0.000009227155,0.000037968937,0.00002991207,0.006714458,0.0012654014,0.9645962,0.027266568,0.00000866869],"about_ca_topic_score_codex":0.0024661524,"about_ca_topic_score_gemma":0.0024264986,"teacher_disagreement_score":0.0071807154,"about_ca_system_score_codex":0.0024465572,"about_ca_system_score_gemma":0.0019359778,"threshold_uncertainty_score":0.024021924},"labels":[],"label_agreement":null},{"id":"W2159691688","doi":"10.1007/978-3-642-29952-0_34","title":"The Worst Case Behavior of Randomized Gossip","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","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":"Concordia University","funders":"","keywords":"Gossip; Rumor; Computer science; Node (physics); Phone; Randomized algorithm; Point (geometry); Theoretical computer science; Combinatorics; Algorithm; Discrete mathematics; Mathematics","score_opus":0.02149200284039755,"score_gpt":0.25031227203030243,"score_spread":0.2288202691899049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159691688","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.53260416,0.003337135,0.38017073,0.009376965,0.00042172748,0.00022442026,0.0015372026,0.0030252,0.06930254],"genre_scores_gemma":[0.9737084,0.00065470504,0.019167073,0.0003531832,0.0002100077,0.00016199933,0.0003736469,0.0005007839,0.0048702876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918224,0.0039082295,0.0002918009,0.0010263089,0.0016731272,0.0012781284],"domain_scores_gemma":[0.88006306,0.10208587,0.0046578553,0.006972442,0.003319562,0.0029011793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011199391,0.0014381319,0.0020375126,0.0020564485,0.0026186113,0.0051780003,0.0044366685,0.0032086738,0.006657194],"category_scores_gemma":[0.07590529,0.001666618,0.0013036515,0.0018726528,0.0049977032,0.0074728313,0.0030450022,0.003710315,0.00091732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020957664,0.0002856182,0.002400091,0.0004218666,0.00026539675,0.00052430376,0.0005531227,0.5872745,0.0072491015,0.36998567,0.012999455,0.015945127],"study_design_scores_gemma":[0.00009660103,0.000084734274,0.00031895688,0.000037054746,0.00005360115,0.00019396386,0.000120074095,0.84382373,0.0013418057,0.15328902,0.00059763825,0.00004279472],"about_ca_topic_score_codex":0.002083181,"about_ca_topic_score_gemma":0.001610559,"teacher_disagreement_score":0.011199391,"about_ca_system_score_codex":0.00332215,"about_ca_system_score_gemma":0.0027593118,"threshold_uncertainty_score":0.05922872},"labels":[],"label_agreement":null},{"id":"W2159777963","doi":"10.1007/978-3-642-14527-8_6","title":"Achieving Efficient Query Privacy for Location Based Services","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mobile device; Private information retrieval; Cloaking; Component (thermodynamics); Computer network; Computer security; World Wide Web","score_opus":0.019473138622566236,"score_gpt":0.2611812050922398,"score_spread":0.24170806646967358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159777963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01879723,0.00074002927,0.97258747,0.0009970027,0.00006473417,0.00009049789,0.00019370303,0.00095159205,0.0055776443],"genre_scores_gemma":[0.77366465,0.0013101127,0.21204011,0.0005398397,0.0002846659,0.00019247281,0.0006609175,0.00031437638,0.010992824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99365956,0.0014652172,0.0003824778,0.00059265795,0.0026285048,0.0012716455],"domain_scores_gemma":[0.9938956,0.0025240178,0.00027259978,0.0027313037,0.00045620493,0.000120297365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031847716,0.000981134,0.0019241734,0.0008198423,0.001380024,0.0040173884,0.002630898,0.0019485442,0.0036808618],"category_scores_gemma":[0.009446716,0.00084329693,0.0011529053,0.0022844002,0.0020941144,0.0075448803,0.00669717,0.0032858597,0.0014882479],"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.0009799415,0.00027299064,0.0012294784,0.0004026843,0.00014932056,0.00039739156,0.00093731744,0.10537036,0.03124518,0.6098343,0.019070955,0.2301102],"study_design_scores_gemma":[0.000089923495,0.0001706152,0.0003259434,0.00003461501,0.000086372915,0.0006303853,0.00031608818,0.52914554,0.025609212,0.4299599,0.0135915205,0.00003987683],"about_ca_topic_score_codex":0.0011969277,"about_ca_topic_score_gemma":0.0010251675,"teacher_disagreement_score":0.0040173884,"about_ca_system_score_codex":0.0015055062,"about_ca_system_score_gemma":0.0015777195,"threshold_uncertainty_score":0.016842842},"labels":[],"label_agreement":null},{"id":"W2159979920","doi":"10.1007/978-3-319-10515-4_13","title":"On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Parallel computing; Computer science; Fast Fourier transform; Univariate; Multi-core processor; Tree (set theory); Interpolation (computer graphics); Algorithm; Theoretical computer science; Mathematics; Multivariate statistics; Artificial intelligence; Machine learning","score_opus":0.015527440102147053,"score_gpt":0.23534509221781305,"score_spread":0.219817652115666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159979920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047666036,0.0070067886,0.87172973,0.00091686746,0.0005551521,0.00015025809,0.00022647805,0.0049385387,0.06681028],"genre_scores_gemma":[0.2602939,0.00483948,0.7003644,0.0005672321,0.000425887,0.0002387338,0.00089106656,0.0014849133,0.030894332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995009,0.0001042634,0.000024586681,0.000068335234,0.0002266945,0.00007524823],"domain_scores_gemma":[0.9992349,0.00030736445,0.000028293725,0.00023441485,0.00016305705,0.000031925036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053153094,0.0008760977,0.00072450156,0.00057820557,0.00063144084,0.0010785378,0.0013254464,0.0005463314,0.008775906],"category_scores_gemma":[0.0016430614,0.00044365198,0.0007737247,0.0012736801,0.00059190294,0.0024173672,0.0011378374,0.0016206816,0.0028840015],"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.00047988954,0.00019444675,0.0005851093,0.0006873641,0.00009047893,0.00014810883,0.00025166592,0.059861213,0.047654707,0.18045454,0.044335824,0.6652566],"study_design_scores_gemma":[0.00011958743,0.000309226,0.00086236733,0.00013685424,0.00008196338,0.00042886927,0.00009329462,0.5812818,0.03682167,0.30908448,0.07073805,0.00004191313],"about_ca_topic_score_codex":0.0010176407,"about_ca_topic_score_gemma":0.0024619366,"teacher_disagreement_score":0.008775906,"about_ca_system_score_codex":0.0005962771,"about_ca_system_score_gemma":0.00081622927,"threshold_uncertainty_score":0.029358387},"labels":[],"label_agreement":null},{"id":"W2160036254","doi":"10.1007/978-3-540-73437-6_16","title":"Finding Compact Structural Motifs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","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 Waterloo","funders":"","keywords":"Computer science; Motif (music); Structural motif; Heuristic; Time complexity; Sequence (biology); Theoretical computer science; Algorithm; Computational complexity theory; Artificial intelligence","score_opus":0.015313774925654555,"score_gpt":0.2704756108475321,"score_spread":0.2551618359218775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160036254","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.40371242,0.0038883425,0.5662923,0.00050122046,0.00023293073,0.00021981103,0.0020026746,0.0045021544,0.018648103],"genre_scores_gemma":[0.68024933,0.0016700084,0.29279223,0.00018604225,0.0001775307,0.00018378171,0.0077819442,0.0006898327,0.016269352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976605,0.000030171619,0.000014141153,0.00010014606,0.00006033567,0.000029138911],"domain_scores_gemma":[0.99942434,0.00023070264,0.00009030163,0.00014853252,0.00005445281,0.000051664247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019129354,0.00066484953,0.0008597272,0.001482023,0.00049929915,0.0008684463,0.00087673037,0.00073780393,0.006601582],"category_scores_gemma":[0.0014244425,0.00051155937,0.0006285342,0.0014876483,0.00043839295,0.0014952389,0.0010579746,0.0007370338,0.001615575],"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.0009430328,0.0003186476,0.005697552,0.00087605993,0.00023108206,0.00090281374,0.00040046228,0.043972477,0.1304126,0.08747561,0.024167685,0.704602],"study_design_scores_gemma":[0.00014672377,0.00065674866,0.005866273,0.00014619732,0.00023055475,0.0024448503,0.0004585719,0.5634411,0.06113722,0.3269305,0.038458496,0.000082856015],"about_ca_topic_score_codex":0.0003152526,"about_ca_topic_score_gemma":0.00069522223,"teacher_disagreement_score":0.006601582,"about_ca_system_score_codex":0.00022991803,"about_ca_system_score_gemma":0.00016534206,"threshold_uncertainty_score":0.022084475},"labels":[],"label_agreement":null},{"id":"W2160178038","doi":"10.1007/978-3-540-77018-3_33","title":"Deploying Mobile Agents in Distributed Data Mining","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Mobile agent; The Internet; World Wide Web; Distributed computing; Computer security; Data science","score_opus":0.06769768335938084,"score_gpt":0.30137709137925595,"score_spread":0.2336794080198751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160178038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054026138,0.0010249059,0.94039863,0.0004487421,0.0001400742,0.00014095125,0.000047091118,0.0018187772,0.001954595],"genre_scores_gemma":[0.27878496,0.00051719206,0.7169701,0.00010534806,0.00007533598,0.00013379518,0.00014008289,0.00019048655,0.0030826526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.00025843637,0.00008672425,0.00015019043,0.0001861128,0.000060719347],"domain_scores_gemma":[0.99748874,0.0016992928,0.000110570814,0.00037794758,0.00020000758,0.00012343196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018184364,0.0005174818,0.00084476266,0.0006765015,0.0007327788,0.0012740672,0.0014599208,0.00096771127,0.0009760216],"category_scores_gemma":[0.00452223,0.00067498256,0.00046090438,0.0009979355,0.0004947725,0.0019226694,0.0015657829,0.0011253897,0.00046173963],"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.0006304988,0.00054903864,0.006718842,0.00032090643,0.00017155682,0.00058354996,0.00075905723,0.19312136,0.026457328,0.022529569,0.006442253,0.741716],"study_design_scores_gemma":[0.0000634237,0.000082177714,0.00063453557,0.000025634536,0.000046674366,0.00021275351,0.00016177978,0.9629143,0.011480388,0.01793288,0.0064319163,0.000013525105],"about_ca_topic_score_codex":0.001574212,"about_ca_topic_score_gemma":0.0025989113,"teacher_disagreement_score":0.0018184364,"about_ca_system_score_codex":0.00036125103,"about_ca_system_score_gemma":0.0005401076,"threshold_uncertainty_score":0.009616911},"labels":[],"label_agreement":null},{"id":"W2160324138","doi":"10.1007/3-540-45545-0_108","title":"GEA: A Complete, Modular System for Generating Evaluative Arguments","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 British Columbia","funders":"","keywords":"Computer science; Modular design; Argument (complex analysis); Generator (circuit theory); Focus (optics); Natural language generation; Natural language; Architecture; Programming language; Sample (material); Natural language processing; Artificial intelligence; Power (physics)","score_opus":0.046311253311698344,"score_gpt":0.2818428311172609,"score_spread":0.23553157780556255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160324138","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.0034360865,0.00012470712,0.9232444,0.00020905196,0.00009919087,0.000358231,0.0010133812,0.064345114,0.0071697873],"genre_scores_gemma":[0.07113212,0.00018992559,0.9016654,0.00031440883,0.0000866893,0.00076830416,0.0027089107,0.008330786,0.014803499],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809307,0.000660601,0.00015301091,0.00035762324,0.0006054146,0.0001303469],"domain_scores_gemma":[0.9964761,0.0020351259,0.00014404053,0.0007789075,0.00040430643,0.00016139886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032784736,0.0015627056,0.0011960275,0.0020083531,0.0008734521,0.0036042964,0.0029137973,0.0022641832,0.04655767],"category_scores_gemma":[0.012188126,0.0012602151,0.0012950506,0.0010846468,0.0013011098,0.005757483,0.0054711034,0.0022199538,0.021362541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011957297,0.00032284658,0.0015558874,0.0010586722,0.00018155498,0.0005379912,0.0013146244,0.011228574,0.027417582,0.13202167,0.104997784,0.71816707],"study_design_scores_gemma":[0.0005095951,0.00026356397,0.0012134034,0.00028666516,0.00018023752,0.00094969396,0.00036934012,0.34012902,0.061235186,0.31615233,0.27845925,0.00025174225],"about_ca_topic_score_codex":0.000598056,"about_ca_topic_score_gemma":0.000890945,"teacher_disagreement_score":0.04655767,"about_ca_system_score_codex":0.0006294544,"about_ca_system_score_gemma":0.0011561502,"threshold_uncertainty_score":0.15575093},"labels":[],"label_agreement":null},{"id":"W2160340816","doi":"10.1007/978-3-642-31653-1_22","title":"Unambiguous Constrained Automata","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université de Montréal","funders":"","keywords":"Decidability; Automaton; Computer science; Class (philosophy); Bounded function; Closure (psychology); Set (abstract data type); Discrete mathematics; Tree automaton; Theoretical computer science; Mathematics; Programming language; Artificial intelligence","score_opus":0.014430594525762862,"score_gpt":0.23289091132539946,"score_spread":0.2184603167996366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160340816","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.020451134,0.0055071716,0.31377783,0.0014699163,0.0011247841,0.00016346473,0.0008289408,0.0013808745,0.65529585],"genre_scores_gemma":[0.54569584,0.0066626254,0.108871534,0.0009664343,0.0007351508,0.00043196604,0.0020404349,0.0012235659,0.33337247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.00008833165,0.000036187026,0.00013486242,0.00020331079,0.000058230908],"domain_scores_gemma":[0.9994885,0.00018144243,0.000025639083,0.0001594198,0.00010961226,0.00003536382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966625,0.0007655129,0.00052024965,0.00085785124,0.0012956643,0.0025510653,0.0008253267,0.0007844065,0.028009623],"category_scores_gemma":[0.0016052703,0.000538464,0.00047293352,0.0013967715,0.0016498899,0.004242596,0.002070213,0.001670577,0.005781474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018065844,0.000016389013,0.00004180908,0.00008954375,0.00000360968,0.000056738623,0.0001700782,0.0009122133,0.0015941556,0.9510456,0.006733903,0.039317887],"study_design_scores_gemma":[0.0000054135535,0.00000940778,0.00007183543,0.00004817847,0.0000067978276,0.00010450179,0.00006197009,0.0021357425,0.0020765853,0.88645905,0.10900787,0.000012638683],"about_ca_topic_score_codex":0.0008143415,"about_ca_topic_score_gemma":0.0010253233,"teacher_disagreement_score":0.028009623,"about_ca_system_score_codex":0.0009434439,"about_ca_system_score_gemma":0.0008732067,"threshold_uncertainty_score":0.09370154},"labels":[],"label_agreement":null},{"id":"W2160367117","doi":"10.1007/978-3-642-02256-2_51","title":"A Scale-Space Approach to Landmark Constrained Image Registration","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Landmark; Computer science; Discretization; Maxima and minima; Constraint (computer-aided design); Image registration; TRACE (psycholinguistics); Grid; Mathematical optimization; Transformation (genetics); Image (mathematics); Scale (ratio); Artificial intelligence; Algorithm; Mathematics","score_opus":0.015403675333586114,"score_gpt":0.26467109133929173,"score_spread":0.24926741600570562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160367117","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.00042818923,0.00016787116,0.9986234,0.000033952794,0.000021728276,0.000013115072,0.000013434297,0.00023301358,0.00046533725],"genre_scores_gemma":[0.04260391,0.00079394586,0.95075333,0.00010730726,0.00011638744,0.00013081299,0.00016674148,0.00037576596,0.004951863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.00029620284,0.000083282546,0.00025127621,0.00057970977,0.000061902014],"domain_scores_gemma":[0.999257,0.00026613096,0.00005860551,0.00018802725,0.00019779475,0.000032412234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010613434,0.00094536185,0.001571707,0.0020342555,0.0007815697,0.0020026136,0.0031757848,0.0016941524,0.005023735],"category_scores_gemma":[0.003035332,0.0011416945,0.0016290925,0.0038019377,0.0016028442,0.0021474324,0.003127327,0.0021512595,0.0025790134],"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.00011013399,0.000099653305,0.00025689288,0.0002630382,0.00019604524,0.00020573146,0.00024047881,0.1635739,0.027797911,0.16255614,0.007952003,0.63674814],"study_design_scores_gemma":[0.000015041955,0.000058946862,0.0003577841,0.000019345794,0.00005246029,0.00028026957,0.000048514645,0.8775633,0.006591234,0.10240303,0.012551423,0.00005870698],"about_ca_topic_score_codex":0.004382909,"about_ca_topic_score_gemma":0.0045139305,"teacher_disagreement_score":0.005023735,"about_ca_system_score_codex":0.000654375,"about_ca_system_score_gemma":0.00074498466,"threshold_uncertainty_score":0.016806126},"labels":[],"label_agreement":null},{"id":"W2160396196","doi":"10.1007/11759966_38","title":"Absolute Stability of Hopfield Neural Network","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Western University","funders":"","keywords":"Sigmoid function; Artificial neural network; Hopfield network; Stability (learning theory); Nonlinear system; Control theory (sociology); Computer science; Relation (database); Control (management); Mathematics; Artificial intelligence; Physics; Machine learning","score_opus":0.01888646881446816,"score_gpt":0.23654674372322293,"score_spread":0.21766027490875478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160396196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35021925,0.005072803,0.5563898,0.0012573862,0.0003287002,0.000045150548,0.00020592517,0.0004917083,0.08598928],"genre_scores_gemma":[0.9812641,0.00065190153,0.00749936,0.000040861578,0.0000492366,0.00003246786,0.000044924247,0.00003114359,0.010386094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985147,0.000034136196,0.0000071544346,0.00003490601,0.000051993782,0.000020370166],"domain_scores_gemma":[0.9997249,0.00010848133,0.00003971453,0.000020352229,0.00008245248,0.000024059107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041920447,0.000286891,0.0003817045,0.0005276112,0.0005449693,0.00086592615,0.0006490478,0.0004932052,0.0036681443],"category_scores_gemma":[0.001670286,0.0001756841,0.00029077008,0.00036576082,0.0008942875,0.0009970013,0.0005631196,0.0005988625,0.0003915859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025371075,0.00003104836,0.00091845274,0.00023169265,0.000070262366,0.00015096902,0.00037241474,0.2964665,0.022561515,0.6024183,0.0038184747,0.072706714],"study_design_scores_gemma":[0.000015826996,0.000074875,0.0006342308,0.000024157813,0.000013787198,0.00008875826,0.000055613724,0.6962951,0.0025382529,0.29825047,0.001988527,0.000020416033],"about_ca_topic_score_codex":0.0024497432,"about_ca_topic_score_gemma":0.001238237,"teacher_disagreement_score":0.0036681443,"about_ca_system_score_codex":0.0007873346,"about_ca_system_score_gemma":0.0004772216,"threshold_uncertainty_score":0.012271225},"labels":[],"label_agreement":null},{"id":"W2160471209","doi":"10.1007/978-3-540-39763-2_21","title":"Distance Corrections on Recombinant Sequences","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"McGill University","funders":"","keywords":"Pairwise comparison; Phylogenetic tree; Computer science; Sequence (biology); Tree (set theory); Recombination; Mosaic; Algorithm; Multiple sequence alignment; Theoretical computer science; Sequence alignment; Combinatorics; Artificial intelligence; Mathematics; Biology; Genetics","score_opus":0.013402692222546609,"score_gpt":0.23363404880147962,"score_spread":0.220231356578933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160471209","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.016156502,0.00035363584,0.9697121,0.00024916744,0.0006505047,0.00006952594,0.00024133238,0.0032281573,0.009339046],"genre_scores_gemma":[0.11465311,0.00041736575,0.8538567,0.00016642775,0.00023336317,0.00012605781,0.0014676213,0.0022455943,0.026833845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978174,0.0005705578,0.00012336379,0.00041312154,0.0009132743,0.00016226103],"domain_scores_gemma":[0.99590284,0.0010889039,0.00021412985,0.0018406912,0.0008407863,0.000112663656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014592431,0.0010439642,0.00093247736,0.0020746456,0.0010135339,0.0011203075,0.0020530517,0.0010816054,0.0154353455],"category_scores_gemma":[0.008146206,0.0006064299,0.0010673124,0.0022606256,0.00079841184,0.0017771086,0.002225098,0.0022431433,0.008190486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034288975,0.00013901493,0.00071644544,0.0003251222,0.00007005218,0.0003841661,0.00021794661,0.023911217,0.05354698,0.19610293,0.02310041,0.70114285],"study_design_scores_gemma":[0.00011002722,0.00024032427,0.0018977966,0.00012897339,0.000093711824,0.0013249792,0.00017272854,0.33288905,0.19165659,0.3356467,0.13573834,0.000100829144],"about_ca_topic_score_codex":0.0008466339,"about_ca_topic_score_gemma":0.0015482133,"teacher_disagreement_score":0.0154353455,"about_ca_system_score_codex":0.00079254364,"about_ca_system_score_gemma":0.00064066367,"threshold_uncertainty_score":0.05163634},"labels":[],"label_agreement":null},{"id":"W2160564268","doi":"10.1007/978-3-642-40313-2_68","title":"Feasible Combinatorial Matrix Theory","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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":"McMaster University","funders":"","keywords":"Mathematical proof; Equivalence (formal languages); Computer science; Combinatorial proof; Matrix (chemical analysis); Computational complexity theory; Algebra over a field; Discrete mathematics; Algorithm; Mathematics; Pure mathematics","score_opus":0.007842766955186044,"score_gpt":0.20771588873961172,"score_spread":0.19987312178442568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160564268","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00902909,0.0037065118,0.31119013,0.0024074586,0.00068417616,0.00006971812,0.0006086774,0.00025728648,0.6720469],"genre_scores_gemma":[0.47205913,0.012132114,0.15763862,0.001556578,0.0022946347,0.00064769795,0.0024501444,0.0007343398,0.3504868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00016978607,0.00001753519,0.00007538804,0.00025172278,0.000054789554],"domain_scores_gemma":[0.9995259,0.00020684382,0.000033053624,0.00009238698,0.00010187508,0.000039937906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045949308,0.0011440308,0.00073361973,0.001457451,0.0010481043,0.0029863932,0.0014223373,0.00093388266,0.026342014],"category_scores_gemma":[0.0016681388,0.00058129797,0.0007277636,0.0025715712,0.0016120232,0.002624355,0.001326942,0.0032759348,0.005864032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008511513,0.000011808527,0.000016527514,0.00005116766,0.0000046883897,0.000013105449,0.000026701911,0.0017656724,0.00023267811,0.9757371,0.008651486,0.013480428],"study_design_scores_gemma":[0.00000557481,0.0000060565494,0.00003338949,0.000026658809,0.000003922047,0.000032374082,0.00001730023,0.0044243503,0.00018584625,0.9728223,0.022436813,0.0000054707752],"about_ca_topic_score_codex":0.0006676717,"about_ca_topic_score_gemma":0.000828216,"teacher_disagreement_score":0.026342014,"about_ca_system_score_codex":0.0014989054,"about_ca_system_score_gemma":0.000720379,"threshold_uncertainty_score":0.088122785},"labels":[],"label_agreement":null},{"id":"W2160580401","doi":"10.1007/978-3-642-03298-1_1","title":"Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.008764984741395598,"score_gpt":0.22045521406982346,"score_spread":0.21169022932842788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160580401","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09233228,0.023400139,0.34875238,0.034362,0.0038240717,0.00020154219,0.0006752102,0.0004925246,0.49595982],"genre_scores_gemma":[0.77934605,0.010554611,0.08505445,0.0022704087,0.0022564188,0.00020947633,0.00039516145,0.00018299991,0.11973039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981205,0.00055926794,0.000090297086,0.00024210219,0.00075700926,0.00023087193],"domain_scores_gemma":[0.9978728,0.0011867482,0.00014347894,0.00044916433,0.0002387828,0.000109001776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001930519,0.00061481935,0.00079788064,0.0011550571,0.0024244518,0.0032368447,0.0010849,0.0021427567,0.007401164],"category_scores_gemma":[0.0062419213,0.00048815718,0.00051612593,0.0026689235,0.005337448,0.011269304,0.003402965,0.005504085,0.0021088608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003491726,0.000009170614,0.000026417982,0.000028104421,0.0000027492276,0.000025169153,0.00008646606,0.0006389114,0.00016918824,0.9845999,0.0026427559,0.011736316],"study_design_scores_gemma":[0.000007682749,0.0000057936495,0.000022302398,0.000010951927,0.000001965384,0.000039367707,0.000024691919,0.0013212073,0.00030117776,0.9878984,0.010360888,0.0000056629865],"about_ca_topic_score_codex":0.00064996484,"about_ca_topic_score_gemma":0.00045355954,"teacher_disagreement_score":0.007401164,"about_ca_system_score_codex":0.0018965933,"about_ca_system_score_gemma":0.0018104013,"threshold_uncertainty_score":0.024759352},"labels":[],"label_agreement":null},{"id":"W2160715871","doi":"10.1007/978-3-540-39611-6_7","title":"Delivering Messages in Disconnected Mobile Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Protocol (science); Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Scheme (mathematics); Ad hoc wireless distribution service; Wireless Routing Protocol; Vehicular ad hoc network; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Mathematics; Network packet","score_opus":0.010127019722640133,"score_gpt":0.2252859922444902,"score_spread":0.21515897252185007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160715871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04161424,0.007725349,0.91519624,0.00079695927,0.0005730552,0.00017818385,0.00010526199,0.0014852094,0.03232551],"genre_scores_gemma":[0.58258307,0.014326109,0.3256808,0.00045003646,0.0008071142,0.0005026046,0.00067230075,0.00065510283,0.074322864],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999553,0.000118987824,0.00002742889,0.000058335707,0.00019766645,0.000044585177],"domain_scores_gemma":[0.99820566,0.001254804,0.000095486634,0.00016867714,0.00018911203,0.0000863142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634251,0.0007018011,0.00076325197,0.0010161017,0.000982854,0.0014685525,0.0016872751,0.0011239471,0.0036220502],"category_scores_gemma":[0.0040745256,0.0005903184,0.00026111488,0.0015222678,0.0009365897,0.003176612,0.0016855667,0.0009715432,0.0012041401],"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.00052010355,0.0001834405,0.0009699926,0.0012186813,0.0000576639,0.0010146529,0.0018124984,0.130899,0.021118414,0.28306445,0.018903503,0.54023767],"study_design_scores_gemma":[0.0000948555,0.00035133827,0.00043912136,0.00017461127,0.00009160112,0.0009792782,0.00061131304,0.49742204,0.012124221,0.41187888,0.07578076,0.000051919502],"about_ca_topic_score_codex":0.0005827564,"about_ca_topic_score_gemma":0.0005417531,"teacher_disagreement_score":0.0036220502,"about_ca_system_score_codex":0.0005705201,"about_ca_system_score_gemma":0.0003583562,"threshold_uncertainty_score":0.012116969},"labels":[],"label_agreement":null},{"id":"W2160720539","doi":"10.1007/978-3-642-14031-0_32","title":"Auspicious Tatami Mat Arrangements","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Rectangle; Combinatorics; Square (algebra); Constraint (computer-aided design); Mathematics; Function (biology); Discrete mathematics; Computer science; Geometry","score_opus":0.03010547604139334,"score_gpt":0.29743889552900543,"score_spread":0.2673334194876121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160720539","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.049226657,0.0013908772,0.066641636,0.0009865848,0.00090870727,0.00004663536,0.00051727204,0.0004967616,0.87978494],"genre_scores_gemma":[0.37787244,0.0028790585,0.028944142,0.0005618112,0.00071463076,0.00014102296,0.00072593096,0.0007077625,0.5874532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999796,0.000027709206,0.000008991127,0.000037586713,0.00008446983,0.00004534545],"domain_scores_gemma":[0.9998338,0.000045029858,0.000013051068,0.00004809549,0.000031809315,0.00002821925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021541104,0.00065237185,0.00057543715,0.0011369972,0.0016486102,0.0018383294,0.000724289,0.00047182987,0.033701092],"category_scores_gemma":[0.0005763107,0.0004243505,0.00042703527,0.001292186,0.0014368506,0.003169617,0.00161123,0.002153004,0.0078094946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014665218,0.0000054698367,0.000036562713,0.000035091936,0.0000030521464,0.000028745817,0.00012611147,0.0002452078,0.00084971066,0.97959703,0.0063858796,0.0126724895],"study_design_scores_gemma":[0.000008394422,0.000018064931,0.00021706642,0.000025369904,0.00001346395,0.00028336945,0.000096179625,0.0010085499,0.0014587354,0.86434025,0.13251919,0.000011381398],"about_ca_topic_score_codex":0.00029058885,"about_ca_topic_score_gemma":0.00065644697,"teacher_disagreement_score":0.033701092,"about_ca_system_score_codex":0.0007937215,"about_ca_system_score_gemma":0.00034278672,"threshold_uncertainty_score":0.11274141},"labels":[],"label_agreement":null},{"id":"W2160734993","doi":"10.1007/978-3-540-24687-9_9","title":"Solving Differential Equations in Developmental Models of Multicellular Structures Expressed Using L-systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicellular organism; Formalism (music); Computer science; Differential equation; Parametric statistics; Applied mathematics; Parametric equation; Context (archaeology); Mathematical optimization; Mathematics; Mathematical analysis; Biology; Geometry","score_opus":0.04516285738803241,"score_gpt":0.22309485117056752,"score_spread":0.1779319937825351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160734993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037364375,0.00082855,0.94984454,0.0007113391,0.00009261244,0.000056265253,0.00016489638,0.0001873785,0.0107500935],"genre_scores_gemma":[0.6326219,0.0009927384,0.3455997,0.000343162,0.00014156743,0.00040975382,0.00037507774,0.00030050392,0.019215623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998266,0.000063900035,0.000012449634,0.00003583985,0.00003978795,0.000021530659],"domain_scores_gemma":[0.99885094,0.0009132329,0.00008103803,0.000029045963,0.0000900241,0.00003565889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067817234,0.00051023724,0.0010567493,0.00039056683,0.000640537,0.0010791821,0.001081466,0.0018782807,0.0035361669],"category_scores_gemma":[0.0025931553,0.00068876654,0.0011610681,0.00065410195,0.0010604863,0.00087850355,0.0013375175,0.0014662637,0.00037295825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014443041,0.000025211968,0.0005391472,0.00011692546,0.000026596505,0.00009778399,0.00017701395,0.909301,0.0017383223,0.07687702,0.0009217539,0.010164751],"study_design_scores_gemma":[0.000009656994,0.0000056987465,0.00004852932,0.000006828023,0.0000049624687,0.000010780762,0.000020663903,0.9823147,0.00027333837,0.016713351,0.0005864686,0.000005024342],"about_ca_topic_score_codex":0.01694836,"about_ca_topic_score_gemma":0.015968066,"teacher_disagreement_score":0.01694836,"about_ca_system_score_codex":0.0014713304,"about_ca_system_score_gemma":0.0012635774,"threshold_uncertainty_score":0.033699453},"labels":[],"label_agreement":null},{"id":"W2160742160","doi":"10.1007/11814764_22","title":"Threats to Security in DSRC/WAVE","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":61,"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":"Instituto de Telecomunicações","keywords":"Dedicated short-range communications; Computer security; Vehicular ad hoc network; Computer science; Wireless; Telecommunications; Vehicular communication systems; Architecture; Computer network; Wireless ad hoc network; Geography","score_opus":0.010623674594516524,"score_gpt":0.21392843431675704,"score_spread":0.20330475972224052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160742160","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038300693,0.025936253,0.13620698,0.01750232,0.0014053638,0.00012471956,0.00013292026,0.00050097227,0.77988976],"genre_scores_gemma":[0.7186068,0.029394183,0.03534878,0.003123297,0.0017626884,0.0001357361,0.0001998928,0.0002322739,0.21119624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877244,0.00029471118,0.000046108584,0.00008782576,0.00065680075,0.00014214178],"domain_scores_gemma":[0.9981254,0.0011071485,0.00016259198,0.00030761812,0.00022436665,0.000072896226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013587414,0.0005169132,0.00032789866,0.000923054,0.00094918325,0.0040167035,0.0009534336,0.0025852693,0.0056423503],"category_scores_gemma":[0.0030409081,0.00051783957,0.00038966312,0.00080049195,0.0027049233,0.0055249506,0.0016570647,0.002891736,0.001594473],"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.000075676406,0.000040062012,0.0003962189,0.00012618082,0.000010652331,0.0004447442,0.0007029262,0.008710986,0.001511965,0.8871042,0.016659101,0.08421726],"study_design_scores_gemma":[0.000019133744,0.000089503286,0.00041826846,0.00033939327,0.000021892845,0.0015494475,0.0007963154,0.03180868,0.0036778115,0.6427957,0.31845257,0.000031263782],"about_ca_topic_score_codex":0.00093932706,"about_ca_topic_score_gemma":0.00077427423,"teacher_disagreement_score":0.0056423503,"about_ca_system_score_codex":0.0010488848,"about_ca_system_score_gemma":0.00056975905,"threshold_uncertainty_score":0.01887554},"labels":[],"label_agreement":null},{"id":"W2160767434","doi":"10.1007/978-3-319-11164-3_1","title":"First International Competition on Software for Runtime Verification","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":45,"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; University of Waterloo","funders":"","keywords":"Computer science; Java; Competition (biology); Runtime verification; Event (particle physics); Software; Software engineering; Process (computing); Operating system; Programming language; Formal verification","score_opus":0.016734453758752005,"score_gpt":0.2545581799950946,"score_spread":0.2378237262363426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160767434","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069479854,0.034077525,0.13903514,0.015130856,0.048114058,0.00032941138,0.0021677758,0.005925378,0.74827194],"genre_scores_gemma":[0.022314116,0.011787857,0.028369792,0.0019209813,0.0041169566,0.00015196379,0.004119162,0.004855036,0.92236406],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99740773,0.00040444135,0.000108546184,0.00027651942,0.0014487284,0.00035406303],"domain_scores_gemma":[0.9975969,0.0004965174,0.000058092875,0.00036500074,0.0009879147,0.00049562374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036732575,0.0017105932,0.0012190406,0.0028229991,0.0012277873,0.004486636,0.0022999516,0.0020867346,0.09634419],"category_scores_gemma":[0.003645713,0.00069231895,0.0014216217,0.0029196965,0.0010087515,0.0041390085,0.0036834036,0.0033786544,0.042307295],"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.00011061931,0.0000856346,0.00011411006,0.0002896495,0.00002503982,0.00007261368,0.000115851115,0.0014104628,0.002809684,0.062292926,0.6243999,0.3082735],"study_design_scores_gemma":[0.000017356093,0.00006446468,0.0002509168,0.00017635037,0.000013783182,0.0001338777,0.000035687935,0.0016289628,0.002138358,0.018411797,0.97711086,0.000017657208],"about_ca_topic_score_codex":0.0013847373,"about_ca_topic_score_gemma":0.0029577876,"teacher_disagreement_score":0.09634419,"about_ca_system_score_codex":0.0020751206,"about_ca_system_score_gemma":0.003758421,"threshold_uncertainty_score":0.3223034},"labels":[],"label_agreement":null},{"id":"W2160802334","doi":"10.1007/3-540-44888-8_4","title":"Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":31,"is_retracted":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":"Coding (social sciences); Markov chain; Computer science; Hidden Markov model; Markov model; Computational biology; Artificial intelligence; Biology; Mathematics; Machine learning; Statistics","score_opus":0.01756825757284889,"score_gpt":0.24319839916902644,"score_spread":0.22563014159617756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160802334","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.0065374994,0.0002147498,0.99220896,0.00006153108,0.000022856542,0.00002868138,0.000040013838,0.00036731004,0.0005184105],"genre_scores_gemma":[0.19780736,0.0006069312,0.7979114,0.000085534506,0.000102862665,0.00021534729,0.00038116673,0.0005169609,0.002372413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919087,0.000380943,0.000038885726,0.00016650232,0.00016121008,0.00006169447],"domain_scores_gemma":[0.9907719,0.007586049,0.00038204083,0.00059687876,0.00044268658,0.00022041897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026052499,0.0010348398,0.0017587537,0.0014169101,0.0009067195,0.001440148,0.0022481445,0.0025750324,0.0028520068],"category_scores_gemma":[0.016087538,0.0010656574,0.0011200064,0.0017109253,0.0016707997,0.002755706,0.0020169597,0.0018571226,0.0010847006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038046678,0.00012179145,0.0005694557,0.0001844585,0.00003218749,0.0002575484,0.00027799874,0.68479556,0.005646043,0.17348734,0.0026460048,0.13160115],"study_design_scores_gemma":[0.000014145074,0.000015334766,0.000035481913,0.000009559167,0.000005971213,0.000028902217,0.000011536904,0.9476186,0.00062514434,0.05126995,0.0003570083,0.000008340604],"about_ca_topic_score_codex":0.002435538,"about_ca_topic_score_gemma":0.0027392323,"teacher_disagreement_score":0.0028520068,"about_ca_system_score_codex":0.0011391687,"about_ca_system_score_gemma":0.0014951257,"threshold_uncertainty_score":0.013778031},"labels":[],"label_agreement":null},{"id":"W2160912526","doi":"10.1007/978-3-642-38844-6_15","title":"Combining Collaborative Filtering and Text Similarity for Expert Profile Recommendations in Social Websites","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Similarity (geometry); Collaborative filtering; Information retrieval; World Wide Web; Artificial intelligence; Recommender system","score_opus":0.03347223620220518,"score_gpt":0.29450138283458377,"score_spread":0.2610291466323786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160912526","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.1301329,0.003943094,0.85436904,0.00047322092,0.00036685704,0.000491641,0.0011303906,0.002247426,0.0068453914],"genre_scores_gemma":[0.56517345,0.0012632099,0.42262232,0.00024831132,0.0007034762,0.00027467686,0.0021391357,0.00017909652,0.0073963436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963941,0.0008710492,0.00034301562,0.0007671833,0.001437687,0.00018696627],"domain_scores_gemma":[0.9899804,0.0063499827,0.00051376375,0.00088145223,0.0020093515,0.00026507804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028368686,0.0011127165,0.0023121093,0.007635869,0.0013244451,0.0023541152,0.0016821633,0.0022121146,0.002217821],"category_scores_gemma":[0.013793815,0.0005609617,0.001807092,0.0058332705,0.00037901368,0.0041298713,0.0012562692,0.0012040111,0.0019569919],"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.00089151575,0.0015810877,0.014536847,0.00078680686,0.00085039105,0.00027695548,0.0005150312,0.040666856,0.01876163,0.0041256053,0.013387393,0.9036199],"study_design_scores_gemma":[0.00007683253,0.00044647214,0.007435464,0.00007400957,0.0004955979,0.00042207266,0.00021782849,0.9650038,0.011601095,0.010356178,0.0037666762,0.00010400994],"about_ca_topic_score_codex":0.0075795148,"about_ca_topic_score_gemma":0.0151489,"teacher_disagreement_score":0.007635869,"about_ca_system_score_codex":0.0007141794,"about_ca_system_score_gemma":0.00082440826,"threshold_uncertainty_score":0.015070796},"labels":[],"label_agreement":null},{"id":"W2160938825","doi":"10.1007/978-3-540-78157-8_14","title":"Camera Self-calibration under the Constraint of Distant Plane","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Windsor","funders":"","keywords":"Homography; Initialization; Camera resectioning; Computer vision; Constraint (computer-aided design); Artificial intelligence; Camera auto-calibration; Computer science; Quadratic equation; Mathematics; Mathematical optimization; Geometry","score_opus":0.015176177248766819,"score_gpt":0.24687862579064493,"score_spread":0.2317024485418781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160938825","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.021530297,0.00039414826,0.96868515,0.000116204166,0.000060136692,0.00001852034,0.000103700186,0.00027541106,0.00881642],"genre_scores_gemma":[0.66155356,0.001120854,0.32164773,0.00013525505,0.00013309653,0.00006363596,0.0005670767,0.00030790849,0.014470842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914527,0.000117819705,0.000024490846,0.0003111148,0.00035234698,0.00004890834],"domain_scores_gemma":[0.9994436,0.00014404094,0.0000808897,0.00019189138,0.00011471522,0.000024854779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049550197,0.000750265,0.00096284295,0.0003967705,0.00034919832,0.000838684,0.0009105053,0.0008932438,0.0030504747],"category_scores_gemma":[0.0016050861,0.0005654231,0.00056420156,0.00085556065,0.0007520087,0.0017011466,0.002041479,0.0014082487,0.0010228003],"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.00054199505,0.00007422383,0.0022605667,0.0008147541,0.00021831748,0.00062588154,0.0006105718,0.19540145,0.21418703,0.16154724,0.008187041,0.41553098],"study_design_scores_gemma":[0.00005150652,0.00016973105,0.004451598,0.000064522,0.000090773494,0.0019475801,0.000118425734,0.8487036,0.07654146,0.050907083,0.016857013,0.00009663885],"about_ca_topic_score_codex":0.0010118965,"about_ca_topic_score_gemma":0.001120539,"teacher_disagreement_score":0.0030504747,"about_ca_system_score_codex":0.00026211084,"about_ca_system_score_gemma":0.00056299986,"threshold_uncertainty_score":0.010204852},"labels":[],"label_agreement":null},{"id":"W2160950619","doi":"10.1007/978-3-642-03356-8_16","title":"Message Authentication Codes from Unpredictable Block Ciphers","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":50,"is_retracted":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":"Block cipher mode of operation; CBC-MAC; Computer science; Block cipher; Pseudorandom function family; Stream cipher; Block (permutation group theory); Message authentication code; Pseudorandom number generator; Block size; Triple DES; Hash function; Cryptography; Theoretical computer science; Computer security; Algorithm; Mathematics; Combinatorics","score_opus":0.015164146378421542,"score_gpt":0.25708130287677694,"score_spread":0.2419171564983554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160950619","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.05743367,0.0028753344,0.84675205,0.0013832881,0.0008307176,0.00026602656,0.00031404174,0.0010565404,0.08908841],"genre_scores_gemma":[0.7298269,0.005152166,0.16707745,0.00051150925,0.000782402,0.0005487918,0.0006765955,0.00071798684,0.09470619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.00017065564,0.000050796672,0.00008489061,0.00049342285,0.000103514976],"domain_scores_gemma":[0.9979856,0.0010758191,0.00018579165,0.00047864026,0.00021944051,0.00005455486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059072365,0.0009660256,0.00055714813,0.0010763869,0.0007055286,0.0016974735,0.0006409073,0.0012366563,0.0060972613],"category_scores_gemma":[0.0035991236,0.00058101246,0.00055796385,0.0010879636,0.0017568751,0.0027802994,0.0019312724,0.0026187918,0.0023495324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007456051,0.000012607888,0.00006946842,0.00012375701,0.000009320326,0.00010575781,0.00014077588,0.009384575,0.0052440567,0.94494814,0.0025348023,0.037352208],"study_design_scores_gemma":[0.00004366959,0.000073805,0.000119684286,0.00012241483,0.000021671745,0.00046150482,0.000034437006,0.050113592,0.017424436,0.9019267,0.02961997,0.000038252776],"about_ca_topic_score_codex":0.00019993071,"about_ca_topic_score_gemma":0.0002007948,"teacher_disagreement_score":0.0060972613,"about_ca_system_score_codex":0.0006567893,"about_ca_system_score_gemma":0.0008280511,"threshold_uncertainty_score":0.020397365},"labels":[],"label_agreement":null},{"id":"W2161035123","doi":"10.1007/978-3-642-13675-7_8","title":"A Characterization of Combined Traces Using Labeled Stratified Order Structures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Characterization (materials science); Quotient; Representation (politics); Dependency (UML); Graph; Mathematics; Order (exchange); Class (philosophy); Computer science; Pure mathematics; Discrete mathematics; Artificial intelligence; Materials science; Nanotechnology","score_opus":0.01463442094236324,"score_gpt":0.23834881888907516,"score_spread":0.2237143979467119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161035123","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.1546427,0.0002529558,0.8165854,0.0004029971,0.00010684931,0.00018320695,0.0005731415,0.0014935364,0.025759194],"genre_scores_gemma":[0.8059675,0.00036573858,0.1651862,0.00020796414,0.00024018042,0.00025361334,0.0011088209,0.00079418364,0.025875717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760485,0.00035139266,0.00024249274,0.00052747974,0.00089869654,0.00037503266],"domain_scores_gemma":[0.99317366,0.0030158698,0.00062307704,0.0013082707,0.0012283128,0.0006507787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014189829,0.00090369734,0.0009444949,0.0028977396,0.0020604813,0.0059240563,0.0021556201,0.0014177117,0.008462647],"category_scores_gemma":[0.0064303293,0.0011816539,0.0018446003,0.0031522946,0.0035413273,0.012147215,0.0036736014,0.0029459596,0.0015909978],"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.00014670173,0.0000762701,0.0014533801,0.00008392288,0.000030097806,0.00037973915,0.0010954656,0.0037595506,0.006740211,0.9671689,0.00085780554,0.018207831],"study_design_scores_gemma":[0.000031002808,0.00011673678,0.00074275513,0.00007091634,0.000085621665,0.0004487301,0.0006215736,0.057022367,0.009052631,0.9217396,0.0100074485,0.000060651826],"about_ca_topic_score_codex":0.0019197791,"about_ca_topic_score_gemma":0.0021371727,"teacher_disagreement_score":0.008462647,"about_ca_system_score_codex":0.0015252496,"about_ca_system_score_gemma":0.0014156664,"threshold_uncertainty_score":0.028310359},"labels":[],"label_agreement":null},{"id":"W2161112350","doi":"10.1007/11957959_4","title":"What and Where: 3D Object Recognition with Accurate Pose","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":142,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Augmented reality; Object (grammar); Pose; Viewpoints; Cognitive neuroscience of visual object recognition; Feature (linguistics); 3D pose estimation; Metric (unit); Object model; Mobile device; 3d model; Computer graphics (images)","score_opus":0.011576666810718868,"score_gpt":0.20236552687119883,"score_spread":0.19078886006047996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161112350","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.0016580998,0.0038629426,0.978558,0.0006067089,0.0005747737,0.000027997568,0.00029776993,0.0070177903,0.0073959455],"genre_scores_gemma":[0.06181485,0.007147447,0.8882013,0.0010446795,0.0005570394,0.00012949726,0.0019240946,0.0017735466,0.03740762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993772,0.00007647742,0.000040532883,0.00017277636,0.0002851245,0.00004798915],"domain_scores_gemma":[0.99958533,0.00011826107,0.000032005013,0.00013494291,0.00010532753,0.000024136682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057741883,0.0014438363,0.0013980602,0.00097137294,0.00036571152,0.002183399,0.0019014955,0.0014015724,0.007471544],"category_scores_gemma":[0.0015511623,0.0009541847,0.00078122533,0.002003543,0.0013115042,0.0046259663,0.001860797,0.0010961111,0.011143972],"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.00008987579,0.000033919496,0.00023255097,0.00023320169,0.00003172893,0.00013327457,0.000120822144,0.0077539138,0.01427376,0.01765771,0.04855305,0.9108861],"study_design_scores_gemma":[0.00003368487,0.000131393,0.0017024473,0.00026655276,0.00013599785,0.0020291682,0.00030541353,0.4032471,0.087342896,0.21868435,0.28594276,0.00017825134],"about_ca_topic_score_codex":0.0024645939,"about_ca_topic_score_gemma":0.0029308454,"teacher_disagreement_score":0.007471544,"about_ca_system_score_codex":0.00031250378,"about_ca_system_score_gemma":0.00049959077,"threshold_uncertainty_score":0.02499479},"labels":[],"label_agreement":null},{"id":"W2161393602","doi":"10.1007/978-3-642-14061-7_3","title":"Retrieving Articulated 3D Objects Using Normalized Distance Function","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Concordia University","funders":"","keywords":"Skeletonization; Computer science; Graph; Artificial intelligence; Benchmark (surveying); Medial axis; Distance transform; Algorithm; Computer vision; Pattern recognition (psychology); Theoretical computer science; Image (mathematics)","score_opus":0.011664042363048787,"score_gpt":0.21064817433884125,"score_spread":0.19898413197579246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161393602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024751205,0.0012524292,0.9650204,0.00005785449,0.00011299845,0.00010814116,0.00066594203,0.0050902823,0.0029407325],"genre_scores_gemma":[0.15026096,0.0021089218,0.83181036,0.00012802237,0.00010178176,0.00014243256,0.0054875524,0.0009728414,0.008987098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988807,0.00006110893,0.00008077778,0.00027988126,0.00060600566,0.00009166749],"domain_scores_gemma":[0.9994199,0.000107266475,0.00003770377,0.00020166549,0.00019645884,0.000037107442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005061132,0.0021200306,0.0029854495,0.0052387347,0.00068930665,0.0026222963,0.0025828357,0.0022694925,0.007313297],"category_scores_gemma":[0.0018276176,0.0009414442,0.0017548375,0.006363082,0.0006341466,0.0033909755,0.0026368168,0.0007453496,0.008771618],"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.00034997027,0.00011786388,0.0010003613,0.00041182226,0.00013575821,0.0005616202,0.00013281713,0.016576355,0.13858682,0.0032978647,0.006330082,0.8324988],"study_design_scores_gemma":[0.00006410755,0.00028400324,0.004454487,0.0001017872,0.00024975272,0.0036827028,0.00039699854,0.7584671,0.19408381,0.01515797,0.022885723,0.00017151916],"about_ca_topic_score_codex":0.0031696665,"about_ca_topic_score_gemma":0.004316981,"teacher_disagreement_score":0.007313297,"about_ca_system_score_codex":0.00060186174,"about_ca_system_score_gemma":0.0009137231,"threshold_uncertainty_score":0.024465442},"labels":[],"label_agreement":null},{"id":"W2161536662","doi":"10.1007/978-3-642-13284-1_12","title":"Distributed Tree Comparison with Nodes of Limited Memory","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Asynchronous communication; Tree (set theory); Task (project management); Automaton; Class (philosophy); Theoretical computer science; Distributed algorithm; Timed automaton; Enhanced Data Rates for GSM Evolution; Shared memory; Parallel computing; State (computer science); Distributed memory; Discrete mathematics; Distributed computing; Algorithm; Combinatorics; Mathematics; Computer network; Artificial intelligence","score_opus":0.014641470582872304,"score_gpt":0.23756665015031236,"score_spread":0.22292517956744007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161536662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2884206,0.0050602225,0.67463785,0.0012735976,0.0011305541,0.00021366439,0.0008812795,0.0032737309,0.025108514],"genre_scores_gemma":[0.7570807,0.0005129808,0.23233317,0.00017168406,0.00029846636,0.00013982355,0.00065172184,0.00043329757,0.008378152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.00032389906,0.00006647597,0.00016797765,0.00039654734,0.00010743682],"domain_scores_gemma":[0.9938315,0.003194931,0.00022357558,0.0015291634,0.0009698011,0.0002509792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017439821,0.0004273568,0.0013492928,0.0013827981,0.000771039,0.0013196793,0.0024388072,0.0009546089,0.0099176075],"category_scores_gemma":[0.010911699,0.000274941,0.00036002038,0.002108077,0.0005414274,0.004167728,0.0016915881,0.000717724,0.00080807594],"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.007785852,0.00038301345,0.0034775916,0.000771668,0.00026069826,0.0003390807,0.0003488944,0.17989387,0.029796423,0.12729965,0.021549739,0.6280936],"study_design_scores_gemma":[0.00044668387,0.00068459293,0.0013396612,0.000098352204,0.0001781246,0.0003445634,0.000121237215,0.79493403,0.020324983,0.17018564,0.011304707,0.000037455953],"about_ca_topic_score_codex":0.0006154821,"about_ca_topic_score_gemma":0.0014014242,"teacher_disagreement_score":0.0099176075,"about_ca_system_score_codex":0.0009777928,"about_ca_system_score_gemma":0.00106567,"threshold_uncertainty_score":0.033177733},"labels":[],"label_agreement":null},{"id":"W2161876704","doi":"10.1007/978-3-540-73133-7_12","title":"Empirical Analysis of a Dynamic Social Network Built from PGP Keyrings","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Snapshot (computer storage); Computer science; Social network (sociolinguistics); Dynamic network analysis; Focus (optics); Data science; Set (abstract data type); Key (lock); Data mining; Empirical research; Computer security; World Wide Web; Social media; Database; Computer network","score_opus":0.018329284280746174,"score_gpt":0.2884802352072239,"score_spread":0.27015095092647773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161876704","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.9893912,0.00011043297,0.0043758894,0.0001675866,0.00001086637,0.00004998883,0.002392432,0.00005088734,0.0034507],"genre_scores_gemma":[0.99453545,0.00004893726,0.002120873,0.000009341381,0.000008710737,0.000028027445,0.0022529894,0.0000100602965,0.0009856765],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99912053,0.00037528717,0.000039046492,0.00016838408,0.00020234531,0.00009439872],"domain_scores_gemma":[0.98966473,0.006916372,0.0010008988,0.0008866428,0.0010586097,0.0004727855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011993723,0.00021383942,0.00026272557,0.002078629,0.0007806702,0.0009464343,0.0008495135,0.000528038,0.004828759],"category_scores_gemma":[0.01543652,0.00017809206,0.0002968784,0.0034483825,0.00061334705,0.0021272942,0.00066768535,0.0005549653,0.0012533517],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012354777,0.0006734064,0.75252104,0.00046894123,0.0003107198,0.0016453859,0.0045825364,0.07699247,0.0064129927,0.041506793,0.015139583,0.09851065],"study_design_scores_gemma":[0.00007293123,0.0004492814,0.42041397,0.000097710305,0.00020420409,0.001240773,0.005894161,0.5269523,0.0033876735,0.023927232,0.017274024,0.00008579274],"about_ca_topic_score_codex":0.011949044,"about_ca_topic_score_gemma":0.011844997,"teacher_disagreement_score":0.011949044,"about_ca_system_score_codex":0.00083201367,"about_ca_system_score_gemma":0.00046990928,"threshold_uncertainty_score":0.023758948},"labels":[],"label_agreement":null},{"id":"W2161919146","doi":"10.1007/3-540-39205-x_114","title":"Critical Remarks on the Computational Complexity in Probabilistic Inference","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Inference; Probabilistic logic; Computer science; Perspective (graphical); Bayesian inference; Statistical inference; Bayesian network; Artificial intelligence; Machine learning; Bayesian probability; Theoretical computer science; Mathematics; Statistics","score_opus":0.08754241583774404,"score_gpt":0.3279802744718454,"score_spread":0.2404378586341014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161919146","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009890392,0.012392573,0.450644,0.37835056,0.0063625025,0.0001269759,0.001300514,0.00049708376,0.14043543],"genre_scores_gemma":[0.52199507,0.016313588,0.2626771,0.07578597,0.06091016,0.0013050223,0.0013402221,0.0013890777,0.058283933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874325,0.0068821493,0.0005436615,0.0013720565,0.0032823242,0.0004872267],"domain_scores_gemma":[0.75751495,0.2238764,0.0023668208,0.008513663,0.006635805,0.0010923032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018515134,0.0014695479,0.0019199006,0.0024221658,0.0032148748,0.006513859,0.005031924,0.0058734715,0.02919602],"category_scores_gemma":[0.11946047,0.0012558906,0.002419804,0.0027460298,0.015013689,0.025146436,0.0044449368,0.014471221,0.0030659356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022994496,0.000012177535,0.000076247554,0.00009506789,0.000014400448,0.00004989671,0.000094593815,0.0018299465,0.00004225336,0.9806455,0.013221432,0.003895516],"study_design_scores_gemma":[0.000011740847,0.0000029621656,0.000058948615,0.000025590572,0.00000494348,0.000021679347,0.000022337465,0.0028306902,0.00004032602,0.9925639,0.0044084038,0.000008510466],"about_ca_topic_score_codex":0.002787757,"about_ca_topic_score_gemma":0.0014180918,"teacher_disagreement_score":0.02919602,"about_ca_system_score_codex":0.003763445,"about_ca_system_score_gemma":0.0018074,"threshold_uncertainty_score":0.09791857},"labels":[],"label_agreement":null},{"id":"W2162105624","doi":"10.1007/3-540-46419-0_32","title":"VIP: A Visual Editor and Compiler for v-Promela","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Promela; Programming language; Computer science; Validator; Model checking; Compiler","score_opus":0.012330673812065152,"score_gpt":0.26516929688204544,"score_spread":0.2528386230699803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162105624","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001249208,0.00024996957,0.6043482,0.00024568613,0.0006033291,0.00022301025,0.0077097197,0.35562244,0.029748447],"genre_scores_gemma":[0.036208928,0.0011542946,0.45004904,0.0011971566,0.00044007262,0.00096098694,0.021455536,0.38906157,0.099472426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937457,0.00006372664,0.000076254946,0.00013230232,0.00025134214,0.00010180362],"domain_scores_gemma":[0.9989447,0.0004650909,0.00005615426,0.00016394652,0.00023644327,0.00013358104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087615824,0.0022198386,0.001205592,0.0014127997,0.0006845229,0.003304991,0.003990265,0.0011689506,0.14869268],"category_scores_gemma":[0.003317092,0.0025277464,0.0018351916,0.0011262692,0.00074103824,0.0030122874,0.0027276482,0.003557274,0.072574444],"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.0008579247,0.00011961948,0.00045480853,0.0020319212,0.00009807366,0.00066607574,0.00042858472,0.008068289,0.021619935,0.0331762,0.6410567,0.2914219],"study_design_scores_gemma":[0.00047338742,0.000078364435,0.00029039854,0.00036329895,0.00008618649,0.00074535684,0.00008924127,0.036887277,0.037805915,0.029300356,0.8937518,0.00012833132],"about_ca_topic_score_codex":0.0014412132,"about_ca_topic_score_gemma":0.0019174161,"teacher_disagreement_score":0.14869268,"about_ca_system_score_codex":0.00066229084,"about_ca_system_score_gemma":0.0013146882,"threshold_uncertainty_score":0.49742657},"labels":[],"label_agreement":null},{"id":"W2162130997","doi":"10.1007/11408031_7","title":"Discrete Representation of Top Points via Scale Space Tessellation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Toronto","funders":"","keywords":"Tessellation (computer graphics); Representation (politics); Scale (ratio); Computer science; Space (punctuation); Scale space; Computer graphics (images); Mathematics; Theoretical computer science; Geography; Computer vision; Cartography; Political science; Image (mathematics); Image processing","score_opus":0.0152624863091417,"score_gpt":0.27104737761172404,"score_spread":0.25578489130258236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162130997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01845242,0.00023131396,0.9774464,0.00006659288,0.000032045784,0.000017561753,0.00016308077,0.00059872976,0.0029918242],"genre_scores_gemma":[0.48190445,0.0010009074,0.50942576,0.000083806706,0.00010105702,0.00006446639,0.0006698439,0.00041956536,0.006330127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998062,0.00002673022,0.000008720808,0.000039984363,0.00008615719,0.00003223994],"domain_scores_gemma":[0.99968946,0.000074635725,0.000024979005,0.000089487476,0.00008384256,0.000037493857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017296115,0.00042875393,0.000704116,0.0010884902,0.00026901733,0.0018213626,0.0007618215,0.00046491963,0.0036160287],"category_scores_gemma":[0.00090512866,0.00029729732,0.0005220439,0.0019015743,0.00055166776,0.0010229738,0.0010129759,0.0009182486,0.0014065366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031004954,0.00007213949,0.0012165057,0.00023149718,0.00005744341,0.00019343272,0.00044443892,0.19082716,0.097030945,0.1523092,0.009166746,0.54814047],"study_design_scores_gemma":[0.000016034815,0.000048445567,0.0010558064,0.000015443255,0.000020616577,0.00031342296,0.00012304742,0.9251809,0.011906908,0.051865865,0.009413586,0.000039886927],"about_ca_topic_score_codex":0.0021630258,"about_ca_topic_score_gemma":0.0020280762,"teacher_disagreement_score":0.0036160287,"about_ca_system_score_codex":0.00041846902,"about_ca_system_score_gemma":0.00029254137,"threshold_uncertainty_score":0.012096822},"labels":[],"label_agreement":null},{"id":"W2162149512","doi":"10.1007/978-3-662-44848-9_10","title":"Density-Based Subspace Clustering in Heterogeneous Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Computer science; Vertex (graph theory); Data mining; Exploit; Subspace topology; Similarity (geometry); Correlation clustering; Clustering high-dimensional data; Theoretical computer science; Artificial intelligence; Graph","score_opus":0.01063671099295312,"score_gpt":0.23663686362435168,"score_spread":0.22600015263139855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162149512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017425504,0.00054992916,0.9797385,0.00014587452,0.000033513053,0.000029778943,0.000075668315,0.00024020707,0.00176104],"genre_scores_gemma":[0.5888089,0.0017426613,0.3998492,0.000114538736,0.00019221677,0.00016465508,0.0007993809,0.00025186568,0.008076595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921215,0.00034685052,0.000029500838,0.0001343656,0.00020613977,0.00007084704],"domain_scores_gemma":[0.99808276,0.0010681498,0.00013976745,0.00025446856,0.00035636962,0.00009846546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671586,0.0006736337,0.0012331124,0.0013847491,0.0008184856,0.0011576522,0.001826927,0.0009964677,0.0012669675],"category_scores_gemma":[0.0042851144,0.000608469,0.0008596306,0.0022206584,0.0009743465,0.002162505,0.0021213081,0.0010234544,0.00050404685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011462769,0.000056142853,0.0008421309,0.00011073201,0.00007671075,0.000051646595,0.00017555497,0.8403171,0.002421664,0.044205494,0.00364671,0.107981496],"study_design_scores_gemma":[0.0000021134313,0.000007824526,0.00016041778,0.0000035665528,0.000003728498,0.000016360318,0.000018519195,0.98398685,0.00026880507,0.015144775,0.00038078005,0.000006263407],"about_ca_topic_score_codex":0.005528987,"about_ca_topic_score_gemma":0.005213724,"teacher_disagreement_score":0.005528987,"about_ca_system_score_codex":0.0011152363,"about_ca_system_score_gemma":0.00061541,"threshold_uncertainty_score":0.0109936},"labels":[],"label_agreement":null},{"id":"W2162199371","doi":"10.1007/3-540-44685-0_17","title":"An Algebraic Characterization of Data and Timed Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Computer science; Automaton; Closure (psychology); Abstract family of languages; Regular language; Programming language; Characterization (materials science); Class (philosophy); Algebraic number; Theoretical computer science; Algebra over a field; Second-generation programming language; Artificial intelligence; Mathematics; Fifth-generation programming language; Pure mathematics","score_opus":0.016158389950387916,"score_gpt":0.2599235246412766,"score_spread":0.24376513469088867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162199371","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.04978241,0.0016515474,0.87520516,0.0019623977,0.00049930654,0.000139204,0.0009229732,0.00078000035,0.06905707],"genre_scores_gemma":[0.70214885,0.0026064825,0.25376633,0.00081356394,0.0016069907,0.0005203845,0.0014674738,0.0005825085,0.036487453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985506,0.00021593159,0.00020562996,0.00036776767,0.0004766369,0.0001834469],"domain_scores_gemma":[0.9963218,0.0018603507,0.00035992888,0.0005313913,0.00066824164,0.00025842688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014036308,0.00082253094,0.00092182576,0.0024552587,0.0019687384,0.006160829,0.0016795243,0.00090306083,0.006238562],"category_scores_gemma":[0.0046601677,0.00096057524,0.0016354425,0.003396832,0.004875112,0.013506012,0.0033823377,0.0038951135,0.0013192684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001925653,0.000008270867,0.00007756001,0.000032558317,0.0000033150213,0.000039038245,0.00018953258,0.00045442875,0.00060702703,0.9930443,0.00055143953,0.004973204],"study_design_scores_gemma":[0.00001386967,0.000018856077,0.000075489355,0.000019336218,0.00001587526,0.00015911371,0.00011531684,0.0058300234,0.0009493533,0.9790213,0.013767637,0.000013841946],"about_ca_topic_score_codex":0.0012707568,"about_ca_topic_score_gemma":0.0008983001,"teacher_disagreement_score":0.006238562,"about_ca_system_score_codex":0.0017206232,"about_ca_system_score_gemma":0.0010988414,"threshold_uncertainty_score":0.02087003},"labels":[],"label_agreement":null},{"id":"W2162251555","doi":"10.1007/978-3-540-77010-7_27","title":"Web Service Search: Who, When, What, and How","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Windsor","funders":"","keywords":"Web service; World Wide Web; Computer science; WS-Policy; Service (business); Web standards; Web modeling; Service-oriented architecture; Service design; Web development; Data Web; Point (geometry); Service delivery framework; Web application security; Business; Marketing; Mathematics","score_opus":0.027451603089222013,"score_gpt":0.24877421370750596,"score_spread":0.22132261061828395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162251555","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036927994,0.19153176,0.23622048,0.07551017,0.0030273665,0.00026671303,0.0010528219,0.0039040395,0.45155865],"genre_scores_gemma":[0.39432806,0.13954821,0.11034927,0.009606546,0.0034118092,0.00018559444,0.0025697993,0.0019810782,0.33801964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876934,0.00026639583,0.00006777295,0.0001575633,0.0005428145,0.0001960935],"domain_scores_gemma":[0.998346,0.0009155449,0.00008122595,0.00014775728,0.00035524016,0.00015419594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316628,0.00071514794,0.00127168,0.0016797547,0.0010905941,0.008386574,0.0010389794,0.0025311245,0.010775232],"category_scores_gemma":[0.004459194,0.0005235955,0.0006067118,0.004843844,0.0023033428,0.014355336,0.0013647018,0.0021649306,0.0070898295],"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.0001170746,0.00010356716,0.0016037148,0.00086834683,0.000056842204,0.00013051688,0.0019971624,0.0017598065,0.002347414,0.36912543,0.12562573,0.4962644],"study_design_scores_gemma":[0.000031886208,0.00005369123,0.0014511034,0.0009531959,0.000082314975,0.0007801442,0.0024471472,0.01958265,0.0026440849,0.4341694,0.5377216,0.000082815524],"about_ca_topic_score_codex":0.01123257,"about_ca_topic_score_gemma":0.011837314,"teacher_disagreement_score":0.01123257,"about_ca_system_score_codex":0.0023961323,"about_ca_system_score_gemma":0.0035024001,"threshold_uncertainty_score":0.036046743},"labels":[],"label_agreement":null},{"id":"W2162291696","doi":"10.1007/978-3-642-33718-5_43","title":"Hausdorff Distance Constraint for Multi-surface Segmentation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hausdorff distance; Computer science; Submodular set function; Segmentation; Surface (topology); Constraint (computer-aided design); Hausdorff space; Mathematical optimization; Image segmentation; Artificial intelligence; Process (computing); Algorithm; Mathematics; Combinatorics; Geometry","score_opus":0.039277610875061944,"score_gpt":0.3017740785252674,"score_spread":0.26249646765020546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162291696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078088907,0.0010269206,0.986537,0.00016377342,0.00007287083,0.000037506255,0.00034475757,0.0004998112,0.0035084372],"genre_scores_gemma":[0.18288961,0.0018088997,0.8007185,0.00018850568,0.00022089151,0.00020485294,0.0026233033,0.0011196133,0.010225787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.000111474554,0.000073454205,0.0002305427,0.00029338477,0.000072787276],"domain_scores_gemma":[0.99881494,0.0005147436,0.00008965246,0.00022835487,0.0002945259,0.00005772763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261324,0.0008456136,0.0021303662,0.0015232741,0.0005623882,0.0024847125,0.002389859,0.001972637,0.005313377],"category_scores_gemma":[0.0033117065,0.00088767643,0.0011408721,0.0021493756,0.00093088404,0.0032054773,0.0018775512,0.0020931053,0.001572734],"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.00041720236,0.00008818241,0.0006809518,0.0009484011,0.00013299764,0.00039857024,0.0001986958,0.30368415,0.046240326,0.19220328,0.014149984,0.44085726],"study_design_scores_gemma":[0.000010415132,0.000039439936,0.0004348075,0.00004249522,0.00002174282,0.00017809359,0.000026721895,0.93477863,0.009531835,0.04509858,0.009809314,0.000027980788],"about_ca_topic_score_codex":0.004218207,"about_ca_topic_score_gemma":0.0037541417,"teacher_disagreement_score":0.005313377,"about_ca_system_score_codex":0.0011729174,"about_ca_system_score_gemma":0.0011699499,"threshold_uncertainty_score":0.017775},"labels":[],"label_agreement":null},{"id":"W2162351824","doi":"10.1007/978-3-540-77566-9_17","title":"A Useful Bounded Resource Functional Language","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Compiler; Programming language; Functional programming; Recursion (computer science); Static analysis; Traverse; Software; Theoretical computer science","score_opus":0.03113242641672817,"score_gpt":0.26262491647131353,"score_spread":0.23149249005458536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162351824","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.0034198207,0.0010315028,0.9030037,0.0010852284,0.00048797892,0.00007565122,0.0002860782,0.0015776162,0.08903236],"genre_scores_gemma":[0.24891742,0.0022400673,0.5930239,0.0012488237,0.0006919032,0.00051019347,0.0007086483,0.002301047,0.15035799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00014047137,0.000035493253,0.00008095299,0.0001515044,0.000058342954],"domain_scores_gemma":[0.99944526,0.00026790344,0.00003241695,0.00012437452,0.00009680673,0.00003314562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956514,0.0009112157,0.00053108175,0.0008144846,0.001001962,0.0017766816,0.0012054249,0.00091089314,0.0145940455],"category_scores_gemma":[0.0019327325,0.00057275675,0.00073539687,0.00081407727,0.002109204,0.0034537502,0.0012640788,0.0018776202,0.004461741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011103167,0.0000065507184,0.000012327472,0.00006277349,0.0000020544983,0.000061011247,0.00016166501,0.0007633744,0.0016736239,0.97456294,0.0039436547,0.018738924],"study_design_scores_gemma":[0.0000114520735,0.00002587068,0.00002501673,0.000063058826,0.000010680372,0.00019637495,0.000041512576,0.005827505,0.002806939,0.85481584,0.13615866,0.000017079756],"about_ca_topic_score_codex":0.00057124655,"about_ca_topic_score_gemma":0.00065616297,"teacher_disagreement_score":0.0145940455,"about_ca_system_score_codex":0.000687099,"about_ca_system_score_gemma":0.0007263113,"threshold_uncertainty_score":0.048821926},"labels":[],"label_agreement":null},{"id":"W2162446442","doi":"10.1007/978-3-642-30743-0_29","title":"The Truth about Defaults","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Default; Artificial intelligence; Finance; Business","score_opus":0.016012102116677206,"score_gpt":0.23975165715641353,"score_spread":0.22373955503973633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162446442","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.034012925,0.01916888,0.1456348,0.048262913,0.0016918436,0.000062990526,0.0011465149,0.00031603943,0.74970305],"genre_scores_gemma":[0.90526205,0.006765049,0.029747447,0.004901892,0.0028524518,0.00015774411,0.0009889047,0.0002556309,0.04906891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962256,0.0014496535,0.0002810003,0.0009958307,0.00079655135,0.00025137732],"domain_scores_gemma":[0.9932903,0.004699606,0.00023405971,0.0011022545,0.00051747286,0.000156224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004780507,0.0006149972,0.0010732797,0.0018167893,0.00263436,0.0072097704,0.0016976859,0.005132976,0.0145064425],"category_scores_gemma":[0.014299829,0.0013489769,0.0010232306,0.0014626614,0.014499667,0.025356358,0.0029142809,0.008243876,0.0024787853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020521053,0.0000058763585,0.00006725624,0.0000325584,0.0000046750793,0.000026258216,0.00028153724,0.00010981798,0.0000909484,0.9916821,0.0023803113,0.0052980823],"study_design_scores_gemma":[0.000005154889,0.0000020434534,0.00003505388,0.000021073878,0.0000030419417,0.000025408848,0.000043339296,0.00015727869,0.000058637896,0.99428564,0.0053606736,0.0000027974334],"about_ca_topic_score_codex":0.0009885357,"about_ca_topic_score_gemma":0.00079259765,"teacher_disagreement_score":0.0145064425,"about_ca_system_score_codex":0.002541892,"about_ca_system_score_gemma":0.001048204,"threshold_uncertainty_score":0.04852885},"labels":[],"label_agreement":null},{"id":"W2162572672","doi":"10.1007/978-3-540-30141-7_40","title":"Simulating Complex Dynamical Systems in a Distributed Programming Environment","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Multiset; Computer science; Theoretical computer science; Genetic programming; Grid; Swarm intelligence; Grid computing; Computation; Dynamical systems theory; Distributed computing; Artificial intelligence; Algorithm; Particle swarm optimization; Mathematics","score_opus":0.020976174686012993,"score_gpt":0.24422751499600343,"score_spread":0.22325134030999044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162572672","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.10059291,0.00011866926,0.8854071,0.0002642737,0.00008496866,0.00006090033,0.000064000116,0.0013193638,0.012087902],"genre_scores_gemma":[0.5973964,0.0002150486,0.39383605,0.00008626478,0.000059112714,0.00021635322,0.00013892303,0.00050769694,0.0075441664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997893,0.00008138769,0.0000111022855,0.0000312567,0.000065889966,0.000021128135],"domain_scores_gemma":[0.99900836,0.0006562646,0.00004836894,0.00014723775,0.000076658514,0.00006314452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641454,0.00044323536,0.00066493667,0.00018887162,0.0004963516,0.0009120053,0.0013594752,0.0009460359,0.0042653517],"category_scores_gemma":[0.0020040122,0.00040999582,0.00045467593,0.00036402934,0.0007797052,0.0011759402,0.0010591379,0.0013438303,0.00044438927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008419137,0.00008414377,0.0006752833,0.000056070337,0.000023770379,0.00009249259,0.00012308592,0.9387375,0.0037044787,0.04024274,0.0008202799,0.015355906],"study_design_scores_gemma":[0.00002899581,0.000013103731,0.000043908392,0.0000018910365,0.000004783522,0.000013860575,0.000008868186,0.98729205,0.0007958297,0.0110901045,0.0007035806,0.0000030175593],"about_ca_topic_score_codex":0.001148314,"about_ca_topic_score_gemma":0.0014240891,"teacher_disagreement_score":0.0042653517,"about_ca_system_score_codex":0.00030733025,"about_ca_system_score_gemma":0.00045601345,"threshold_uncertainty_score":0.014268994},"labels":[],"label_agreement":null},{"id":"W2162583946","doi":"10.1007/978-3-540-75696-5_12","title":"GlobeCon – A Scalable Framework for Context Aware Computing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Computer science; Scalability; Context (archaeology); Context model; Distributed computing; Ubiquitous computing; Context management; Server; Directory; Key (lock); Context awareness; World Wide Web; Database; Human–computer interaction; Computer security; Artificial intelligence; Operating system; Object (grammar); Geography","score_opus":0.046423675226954265,"score_gpt":0.29922563776963074,"score_spread":0.25280196254267645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162583946","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.00428037,0.000842455,0.92821985,0.00038015321,0.00026473403,0.00023906144,0.0010197606,0.058124144,0.006629456],"genre_scores_gemma":[0.16090865,0.0010269692,0.8173219,0.0006914701,0.0001758393,0.0007000407,0.0057721287,0.0045979656,0.00880508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988727,0.00023051637,0.00007030453,0.00022620054,0.0004622421,0.00013802855],"domain_scores_gemma":[0.9990219,0.00018099953,0.000034782315,0.000468126,0.00017426355,0.00011997982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010146468,0.0017651401,0.001681522,0.0013308149,0.0013192571,0.0032920341,0.0037725791,0.001381441,0.008224056],"category_scores_gemma":[0.002657933,0.0010061283,0.0012189494,0.0019097978,0.00083833403,0.004484977,0.0045148325,0.0026836898,0.0025206376],"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.00092539075,0.00049393234,0.0015124402,0.0006313952,0.00037927687,0.00052235194,0.00048670796,0.119577914,0.018694313,0.12386016,0.20287958,0.53003645],"study_design_scores_gemma":[0.00010003754,0.000064902706,0.00040486394,0.000073552255,0.000094247895,0.00018642886,0.000097568656,0.7894454,0.012236558,0.11390096,0.08330344,0.0000920319],"about_ca_topic_score_codex":0.01123033,"about_ca_topic_score_gemma":0.018146435,"teacher_disagreement_score":0.01123033,"about_ca_system_score_codex":0.0010632408,"about_ca_system_score_gemma":0.001730826,"threshold_uncertainty_score":0.027512252},"labels":[],"label_agreement":null},{"id":"W2162588452","doi":"10.1007/978-3-540-28634-9_26","title":"Lifetime-Extended, Power-Aware, Non-position Base Localized Routing in Hybrid Ad-Hoc/Infrastructure Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc 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":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Routing (electronic design automation); Base (topology); Base station; Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Wireless","score_opus":0.0055256614143444575,"score_gpt":0.21888714078620314,"score_spread":0.21336147937185868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162588452","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.0528636,0.006125601,0.92431134,0.00043718136,0.00023370616,0.000040296916,0.00006926931,0.0010695761,0.0148493815],"genre_scores_gemma":[0.82490975,0.0031032166,0.15293728,0.00011127358,0.00019108262,0.00005477022,0.00016393306,0.00015794708,0.018370703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998735,0.000029570634,0.000005594707,0.000027008104,0.0000483962,0.000015867528],"domain_scores_gemma":[0.99979836,0.00007504099,0.000020796575,0.000050529492,0.000041576,0.000013726886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032245895,0.00034616847,0.0003803645,0.00025862706,0.00025522,0.00047792858,0.0012564516,0.0003870846,0.0010335802],"category_scores_gemma":[0.00047498825,0.00022064886,0.00023361939,0.00031720442,0.0002910169,0.0010599031,0.00061603024,0.00048801457,0.00029460862],"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.00026029113,0.00009218002,0.0007856649,0.00036398982,0.000059656308,0.00036635413,0.00025540934,0.39672065,0.052975085,0.07400466,0.008327636,0.46578842],"study_design_scores_gemma":[0.000017313381,0.00029580665,0.00065907056,0.00003518999,0.000056207173,0.00077133515,0.00007133939,0.9434123,0.011382344,0.030590197,0.012677497,0.00003133883],"about_ca_topic_score_codex":0.00035032904,"about_ca_topic_score_gemma":0.00092705013,"teacher_disagreement_score":0.0012564516,"about_ca_system_score_codex":0.0003527514,"about_ca_system_score_gemma":0.00027016085,"threshold_uncertainty_score":0.0034576654},"labels":[],"label_agreement":null},{"id":"W2162824303","doi":"10.1007/978-3-540-77294-1_4","title":"Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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; Dalhousie University","funders":"","keywords":"Combinatorics; Greedy algorithm; Degree (music); Graph; Random graph; Mathematics; Discrete mathematics; Algorithm; Physics","score_opus":0.042706764647804936,"score_gpt":0.29052877326854437,"score_spread":0.24782200862073944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162824303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025520222,0.00025717862,0.9689042,0.00020618054,0.00015325675,0.00015682605,0.00012836969,0.0017980592,0.002875652],"genre_scores_gemma":[0.11371489,0.00019384924,0.8785407,0.0001681638,0.00007345481,0.00019503545,0.0003938472,0.0006040047,0.0061159795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886,0.00018398264,0.00006614425,0.0003409487,0.00041104635,0.00013798456],"domain_scores_gemma":[0.99621814,0.0016083856,0.00016128599,0.0014360206,0.0003239437,0.0002521791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644081,0.0011899875,0.002769743,0.0019182384,0.0014597081,0.0013815331,0.0031531712,0.00258793,0.007741935],"category_scores_gemma":[0.0075247693,0.0013531445,0.002365935,0.002032213,0.0013454574,0.0024890369,0.0050328863,0.0021246,0.0022424872],"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.00087334693,0.000432017,0.0021116943,0.0006997118,0.00023535645,0.00027804886,0.00040251037,0.2920723,0.042521924,0.0728759,0.016814487,0.5706828],"study_design_scores_gemma":[0.00012964431,0.000120205696,0.0003297972,0.000034266857,0.00005364393,0.00019755356,0.00010906156,0.9257614,0.0077714846,0.06030539,0.005152097,0.000035478086],"about_ca_topic_score_codex":0.0017446023,"about_ca_topic_score_gemma":0.003008003,"teacher_disagreement_score":0.007741935,"about_ca_system_score_codex":0.00073131104,"about_ca_system_score_gemma":0.00094209705,"threshold_uncertainty_score":0.02589935},"labels":[],"label_agreement":null},{"id":"W2162892932","doi":"10.1007/978-3-642-32241-9_21","title":"Monotone Paths in Planar Convex Subdivisions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Monotone polygon; Subdivision; Computer science; Planar; Regular polygon; Algorithm; Mathematics; Computer graphics (images); Geometry; Geography","score_opus":0.01972377283854687,"score_gpt":0.2497572131925377,"score_spread":0.23003344035399084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162892932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08515508,0.0025296598,0.8459579,0.0005446769,0.0001934672,0.000110902496,0.0003198287,0.00041863986,0.064770006],"genre_scores_gemma":[0.46066645,0.00503128,0.47162414,0.0001924481,0.00018635695,0.00028482784,0.0007823363,0.000675578,0.06055669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996177,0.00009428981,0.000019473155,0.000056249457,0.00017401016,0.0000383479],"domain_scores_gemma":[0.99906975,0.0005873678,0.0000667101,0.00007567467,0.00012382821,0.00007664692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046094498,0.0006218525,0.00060875266,0.0012292151,0.00069182465,0.001195014,0.0011039107,0.00079789845,0.0070516686],"category_scores_gemma":[0.0030349179,0.00070670556,0.0005638459,0.0014764111,0.0015727452,0.002123465,0.001818433,0.0022516972,0.00084650645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005068041,0.000020319092,0.00019497614,0.00014941215,0.0000068816357,0.00005769274,0.00018742662,0.024929244,0.0021067797,0.89727664,0.0032930258,0.07172692],"study_design_scores_gemma":[0.000018246848,0.000036510664,0.00017153504,0.000053412317,0.000008281483,0.0001416199,0.0000648236,0.09139896,0.0009600098,0.8921922,0.014943186,0.000011245525],"about_ca_topic_score_codex":0.001383381,"about_ca_topic_score_gemma":0.0015913668,"teacher_disagreement_score":0.0070516686,"about_ca_system_score_codex":0.0009137661,"about_ca_system_score_gemma":0.00044515348,"threshold_uncertainty_score":0.023590207},"labels":[],"label_agreement":null},{"id":"W2162977162","doi":"10.1007/3-540-48199-0_4","title":"An Algebraic Approach to French Sentence Structure","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Linguistics and Discourse Analysis","field":"Arts and Humanities","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Generalization; Sentence; Algebraic structure; Set (abstract data type); Algebraic number; Order (exchange); Artificial intelligence; Natural language processing; Programming language; Mathematics; Pure mathematics","score_opus":0.02694912161506588,"score_gpt":0.24856344410842546,"score_spread":0.22161432249335958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162977162","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.018126389,0.0016720587,0.9331961,0.0033008466,0.00022203248,0.000092155366,0.0008007678,0.0009371762,0.04165253],"genre_scores_gemma":[0.4862663,0.002376149,0.4884948,0.0007345854,0.0013532061,0.00024171152,0.001611487,0.00049120496,0.018430602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854773,0.0006461169,0.00014428356,0.0002656949,0.00028390036,0.0001122907],"domain_scores_gemma":[0.99813676,0.0010801938,0.0001269323,0.00015779573,0.0004475168,0.00005071168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013837004,0.0008419292,0.0009159214,0.003444958,0.0026509608,0.0051601445,0.0017999508,0.0010888003,0.009817212],"category_scores_gemma":[0.004001325,0.001022906,0.0023284038,0.0032015154,0.0032349252,0.011951263,0.0022065372,0.0021924085,0.0018593223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013283849,0.000009593444,0.00010443854,0.00006453698,0.000011917903,0.000081721766,0.00040118056,0.0011878758,0.0003774415,0.9788497,0.0018523432,0.017045995],"study_design_scores_gemma":[0.000012304865,0.000021417884,0.00020633289,0.00003470993,0.000034255525,0.00018077866,0.00024567402,0.01434188,0.0005364817,0.959583,0.024776004,0.000027346072],"about_ca_topic_score_codex":0.010158964,"about_ca_topic_score_gemma":0.0094563505,"teacher_disagreement_score":0.010158964,"about_ca_system_score_codex":0.0029805382,"about_ca_system_score_gemma":0.0011684329,"threshold_uncertainty_score":0.03284186},"labels":[],"label_agreement":null},{"id":"W2163231910","doi":"10.1007/11549468_136","title":"High Performance Computing for a Financial Application Using Fast Fourier Transform","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fourier transform; Computer science; Mathematics; Mathematical analysis","score_opus":0.021767198747029762,"score_gpt":0.22700581427398486,"score_spread":0.2052386155269551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163231910","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015855534,0.003316984,0.93383926,0.0013776228,0.00076805544,0.00008305237,0.00018308284,0.005002873,0.039573476],"genre_scores_gemma":[0.21556929,0.0022448534,0.7470767,0.00034834383,0.0003983555,0.0001975293,0.0004473924,0.0008791936,0.0328383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997377,0.00004665601,0.000016079583,0.000029633235,0.00014454205,0.000025382498],"domain_scores_gemma":[0.99953055,0.00021662308,0.000015573749,0.00008485023,0.000126057,0.00002634003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003686471,0.0005912024,0.00047448595,0.0005367617,0.00047570257,0.0011394905,0.00073967763,0.000750941,0.01175383],"category_scores_gemma":[0.001800662,0.0002686398,0.00030972986,0.0010430013,0.00040945483,0.0014007343,0.00078162487,0.0013451397,0.0028855598],"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.00034635692,0.00014957754,0.00074204704,0.00039813385,0.0000764479,0.00041206364,0.00021645274,0.047482025,0.038456388,0.2759047,0.086137116,0.54967874],"study_design_scores_gemma":[0.00006513478,0.00009211222,0.0005593764,0.00008219128,0.000043259173,0.00032730855,0.00004293825,0.75906736,0.025161784,0.12089218,0.09362186,0.000044591947],"about_ca_topic_score_codex":0.000576429,"about_ca_topic_score_gemma":0.0007577665,"teacher_disagreement_score":0.01175383,"about_ca_system_score_codex":0.00033211568,"about_ca_system_score_gemma":0.0004296336,"threshold_uncertainty_score":0.03932047},"labels":[],"label_agreement":null},{"id":"W2163328856","doi":"10.1007/978-3-642-12683-3_13","title":"Towards Automated Structure-Based NMR Resonance Assignment","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Molecular spectroscopy and chirality","field":"Chemistry","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":"Computer science; Resonance (particle physics); Nuclear magnetic resonance; Artificial intelligence; Physics; Atomic physics","score_opus":0.009256205758182864,"score_gpt":0.2517010223974729,"score_spread":0.24244481663929002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163328856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00207178,0.00035797298,0.9881743,0.00014553659,0.000059973754,0.000041950203,0.00029674286,0.0072907116,0.0015610089],"genre_scores_gemma":[0.0160323,0.0004442047,0.9795767,0.00015093728,0.00005372758,0.0000612336,0.0010858715,0.00063011475,0.0019649218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839103,0.00031794887,0.00008201605,0.0004310645,0.000646692,0.00013122497],"domain_scores_gemma":[0.9973562,0.0010918757,0.00015312793,0.00068922056,0.0006451822,0.00006442928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017317522,0.002056516,0.0022629318,0.0022990818,0.0009898371,0.0030868778,0.0038516535,0.0019206465,0.00814061],"category_scores_gemma":[0.0042911675,0.0015481277,0.0016255218,0.002440411,0.0011180345,0.002658732,0.0032425001,0.0023869437,0.012091093],"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.00026889954,0.00017056587,0.00031304677,0.00049174903,0.00009727572,0.00016053188,0.0001223798,0.02106587,0.12664592,0.013051886,0.020214424,0.8173974],"study_design_scores_gemma":[0.00009605979,0.00013504796,0.00064065703,0.000089681394,0.00012103703,0.0006663733,0.00015305361,0.7274878,0.12541564,0.09688295,0.048227243,0.00008448828],"about_ca_topic_score_codex":0.0016918033,"about_ca_topic_score_gemma":0.00343022,"teacher_disagreement_score":0.00814061,"about_ca_system_score_codex":0.00065967656,"about_ca_system_score_gemma":0.0012030613,"threshold_uncertainty_score":0.027233124},"labels":[],"label_agreement":null},{"id":"W2163359684","doi":"10.1007/978-3-642-21292-5_12","title":"Software Certification: Is There a Case against Safety Cases?","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Certification; Computer science; Domain (mathematical analysis); Analogy; Safety case; Process (computing); Risk analysis (engineering); Safety engineering; Cornerstone; Structuring; Software engineering; Underpinning; Software; Engineering management; Systems engineering; Engineering; Reliability engineering; Business","score_opus":0.02375891222213366,"score_gpt":0.21490506863995293,"score_spread":0.19114615641781926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163359684","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02975345,0.014637367,0.2565826,0.34605932,0.005295367,0.00016012079,0.00010878684,0.0007336101,0.34666935],"genre_scores_gemma":[0.8578132,0.00595649,0.06242404,0.031708412,0.0026887476,0.00018702119,0.00014484205,0.0003806927,0.038696643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97578514,0.011039071,0.0010078438,0.0017791749,0.008906431,0.0014822908],"domain_scores_gemma":[0.8705702,0.105122566,0.00426023,0.0076721082,0.010367129,0.0020077194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024393203,0.0006451575,0.00096885196,0.0023739869,0.0033719572,0.0094367135,0.0033025055,0.0104178805,0.007807943],"category_scores_gemma":[0.119288735,0.00078171084,0.0009817277,0.0012775,0.022753164,0.02461546,0.004965648,0.012777015,0.0018772815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030119927,0.00003916006,0.00080719,0.00014334472,0.000013732754,0.0003969146,0.0012823483,0.00062240195,0.00016411545,0.9096708,0.023904987,0.062924854],"study_design_scores_gemma":[0.000020698883,0.000031631876,0.00030007513,0.00053750584,0.000020211895,0.0007365136,0.001375782,0.0029474131,0.00060527475,0.9239886,0.06941077,0.000025502395],"about_ca_topic_score_codex":0.0025808292,"about_ca_topic_score_gemma":0.0026777773,"teacher_disagreement_score":0.024393203,"about_ca_system_score_codex":0.002764597,"about_ca_system_score_gemma":0.0048575327,"threshold_uncertainty_score":0.12900513},"labels":[],"label_agreement":null},{"id":"W2163398904","doi":"10.1007/978-3-540-77560-7_18","title":"Turbo-ROB: A Low Cost Checkpoint/Restore Accelerator","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Out-of-order execution; Operating system; Speculative execution; Embedded system","score_opus":0.02375913372544606,"score_gpt":0.25653136486213735,"score_spread":0.2327722311366913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163398904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088485375,0.004131173,0.5669691,0.0012765293,0.0016891647,0.00048118696,0.0037033677,0.1756704,0.15759371],"genre_scores_gemma":[0.52850705,0.0011618275,0.317795,0.0008423883,0.0002523208,0.0003809887,0.005094389,0.0072496175,0.13871643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982506,0.000015914373,0.0000071054524,0.00002177923,0.00009647204,0.000033681346],"domain_scores_gemma":[0.9997887,0.000036069836,0.00001710893,0.00005217743,0.00006700034,0.000038868384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020968007,0.00068218494,0.0005876259,0.0006338146,0.00045449263,0.0007779908,0.0020040637,0.000584845,0.032266624],"category_scores_gemma":[0.0005056038,0.00044632048,0.00034041298,0.00064816413,0.00028421998,0.0010398062,0.0007568795,0.0009806447,0.008401958],"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.0028973608,0.00027692475,0.0012437232,0.0011259541,0.00019683797,0.00048645344,0.00018541011,0.043853734,0.10623006,0.021913737,0.2729479,0.5486419],"study_design_scores_gemma":[0.000697503,0.001540566,0.0032570066,0.00013151403,0.0002523489,0.0011763624,0.00012501056,0.427028,0.20172001,0.020455366,0.34333128,0.0002850084],"about_ca_topic_score_codex":0.0012233153,"about_ca_topic_score_gemma":0.0020077303,"teacher_disagreement_score":0.032266624,"about_ca_system_score_codex":0.0003676924,"about_ca_system_score_gemma":0.00087605434,"threshold_uncertainty_score":0.10794258},"labels":[],"label_agreement":null},{"id":"W2163444875","doi":"10.1007/978-3-642-21793-7_5","title":"Giving UI Developers the Power of UI Design Patterns","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Persona Design and Applications","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Human–computer interaction","score_opus":0.039248518691852335,"score_gpt":0.24104933945477797,"score_spread":0.20180082076292563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163444875","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.009241605,0.00046023267,0.9623667,0.0037907816,0.0002533987,0.00007117938,0.0000747717,0.0036504592,0.020090776],"genre_scores_gemma":[0.135721,0.0014163093,0.83462995,0.001251746,0.00023156231,0.00025867994,0.0002555548,0.003261156,0.022973914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948119,0.001885623,0.00043042825,0.0005841588,0.0019623314,0.0003255553],"domain_scores_gemma":[0.9772389,0.01112398,0.00085431914,0.008397506,0.0017500811,0.00063521427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054640095,0.0011954933,0.00063032063,0.0011141447,0.0013074931,0.0044654026,0.0018813511,0.0028385308,0.00964439],"category_scores_gemma":[0.039551575,0.0018288488,0.0012080669,0.0010378339,0.0024920946,0.01465313,0.005620801,0.005864699,0.0038793932],"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.00016707873,0.00016261905,0.0025377253,0.00069217576,0.00006830869,0.00035020307,0.005117878,0.0040134327,0.015637934,0.27437973,0.027504379,0.6693685],"study_design_scores_gemma":[0.0002231007,0.0003002503,0.0010135319,0.0007755259,0.0002436041,0.0020090535,0.0010070126,0.035815783,0.028495608,0.51442814,0.4155435,0.00014493398],"about_ca_topic_score_codex":0.0008407977,"about_ca_topic_score_gemma":0.0015446042,"teacher_disagreement_score":0.00964439,"about_ca_system_score_codex":0.0005454087,"about_ca_system_score_gemma":0.0013431375,"threshold_uncertainty_score":0.032263696},"labels":[],"label_agreement":null},{"id":"W2163495392","doi":"10.1007/978-3-540-87608-3_21","title":"Probing the 4-3-2 Edge Template in Hex","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Theoretical computer science; Computer graphics (images); Artificial intelligence","score_opus":0.04070927090552214,"score_gpt":0.27140185748464785,"score_spread":0.2306925865791257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163495392","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.37945423,0.00048418163,0.3094517,0.0019555264,0.001116088,0.00018409833,0.0018618354,0.0027889952,0.30270338],"genre_scores_gemma":[0.8510644,0.00022763693,0.096031256,0.0007356723,0.000041224775,0.00009796324,0.001295486,0.0009792061,0.049527194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996202,0.0000724401,0.0000140269185,0.00006717932,0.00010950633,0.000116627474],"domain_scores_gemma":[0.999624,0.000108803455,0.000026917136,0.00013174527,0.000057188277,0.000051233816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023105704,0.00043567186,0.0005878743,0.00043521923,0.001015051,0.0017753273,0.00084736786,0.0015427815,0.029355526],"category_scores_gemma":[0.001410814,0.00036215238,0.00041136544,0.00071251154,0.0007430802,0.001959011,0.0016119212,0.0013466182,0.0062903995],"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.0007524747,0.00014662097,0.0027894243,0.00022241636,0.000026586074,0.00088003586,0.00052276946,0.032307953,0.022274364,0.7897263,0.034857035,0.115494125],"study_design_scores_gemma":[0.000095361385,0.00021758399,0.0011575018,0.000112160305,0.000029874762,0.0007947515,0.0014553105,0.22502813,0.033703808,0.643287,0.09403915,0.00007930784],"about_ca_topic_score_codex":0.0010847161,"about_ca_topic_score_gemma":0.001667253,"teacher_disagreement_score":0.029355526,"about_ca_system_score_codex":0.0004979966,"about_ca_system_score_gemma":0.0004325995,"threshold_uncertainty_score":0.09820402},"labels":[],"label_agreement":null},{"id":"W2163518692","doi":"10.1007/978-3-642-13437-1_48","title":"Exploring the Relationship between Learner EEG Mental Engagement and Affect","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Science and Mapping","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":"Université de Montréal","funders":"","keywords":"Electroencephalography; Task (project management); Affect (linguistics); Computer science; Index (typography); Cognitive psychology; Psychology; Communication; World Wide Web; Neuroscience","score_opus":0.14226086298415064,"score_gpt":0.29507854486631213,"score_spread":0.1528176818821615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163518692","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.995327,0.000070423455,0.002040128,0.000033590564,0.0000054205548,0.000010096909,0.00009395136,0.000021525082,0.0023978546],"genre_scores_gemma":[0.9980963,0.00006762524,0.0008254992,0.000012068311,0.0000055041223,0.000015268597,0.000075640746,0.000010699969,0.00089146686],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997316,0.000102816055,0.000012604297,0.000058823887,0.0000644035,0.000029709257],"domain_scores_gemma":[0.99461323,0.004536145,0.00038575707,0.00011821745,0.00017390186,0.00017279638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068506587,0.00018374516,0.00016839115,0.00023325613,0.00014515109,0.0013559775,0.00018976048,0.0003139943,0.0042116903],"category_scores_gemma":[0.010267483,0.0001488548,0.00016064383,0.00030773837,0.00020878133,0.0006571349,0.0006242242,0.00047950997,0.00038261348],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024163332,0.001213865,0.7613903,0.0004911746,0.000621177,0.00041748342,0.016454821,0.003056086,0.08628278,0.0017481655,0.0010444977,0.12486327],"study_design_scores_gemma":[0.00003399358,0.00083246565,0.97799677,0.00003725178,0.00016687543,0.00030511385,0.0029649702,0.0065321047,0.008686938,0.0014592932,0.0009488289,0.00003530481],"about_ca_topic_score_codex":0.00056731974,"about_ca_topic_score_gemma":0.0006922807,"teacher_disagreement_score":0.0042116903,"about_ca_system_score_codex":0.000098381184,"about_ca_system_score_gemma":0.00009923654,"threshold_uncertainty_score":0.014089525},"labels":[],"label_agreement":null},{"id":"W2163538620","doi":"10.1007/978-3-642-38980-1_32","title":"Batch Proofs of Partial Knowledge","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Zero-knowledge proof; Computer science; Exploit; Logarithm; Discrete logarithm; Theoretical computer science; Simple (philosophy); Computation; Discrete mathematics; Algorithm; Mathematics; Cryptography; Public-key cryptography; Computer security; Encryption","score_opus":0.017102533764732926,"score_gpt":0.2479451974313729,"score_spread":0.23084266366663997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163538620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01962619,0.0037557466,0.814036,0.0031338958,0.00055236206,0.00017889099,0.0011087956,0.0019156708,0.1556924],"genre_scores_gemma":[0.6125335,0.003947243,0.22222951,0.00083838566,0.0014838796,0.0006051884,0.002316786,0.0012185358,0.15482682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968284,0.0010230129,0.00016857409,0.00044266917,0.0012735439,0.00026375093],"domain_scores_gemma":[0.98764867,0.0078184875,0.00043308956,0.0031884285,0.0006521919,0.00025925902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029647846,0.0012080312,0.0012250311,0.00122279,0.0011231407,0.0036312994,0.0023982134,0.0011763619,0.021110209],"category_scores_gemma":[0.010680604,0.0011992638,0.0012156159,0.001974603,0.0031536687,0.0098805735,0.003228962,0.004429242,0.0050491784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014813186,0.000027787268,0.00008085226,0.00022509632,0.000028273726,0.000049562008,0.00016970109,0.0039889934,0.0015303558,0.94146687,0.009140242,0.043144066],"study_design_scores_gemma":[0.00002548117,0.000021967397,0.00006377876,0.000038097838,0.000016411715,0.00005702041,0.00001358441,0.009506099,0.0020806678,0.9740825,0.014078422,0.00001591065],"about_ca_topic_score_codex":0.00057148974,"about_ca_topic_score_gemma":0.0005438503,"teacher_disagreement_score":0.021110209,"about_ca_system_score_codex":0.0024062446,"about_ca_system_score_gemma":0.0014011072,"threshold_uncertainty_score":0.070620656},"labels":[],"label_agreement":null},{"id":"W2163571449","doi":"10.1007/978-3-319-10816-2_11","title":"A Topic Model Scoring Approach for Personalized QA Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Lakehead University; Université Laval","funders":"","keywords":"Mean reciprocal rank; Computer science; Latent Dirichlet allocation; Personalization; Similarity (geometry); Information retrieval; Question answering; Rank (graph theory); Set (abstract data type); Topic model; Probabilistic logic; Reciprocal; Ranking (information retrieval); Data mining; Artificial intelligence; World Wide Web","score_opus":0.04480884360883672,"score_gpt":0.2528119084833199,"score_spread":0.2080030648744832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163571449","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.006328967,0.00070607924,0.984705,0.00031244347,0.00015734561,0.00019222045,0.0004745304,0.00443016,0.0026934403],"genre_scores_gemma":[0.20013908,0.000827761,0.7763966,0.00027036015,0.00046375292,0.00051850174,0.0038507918,0.001357614,0.016175536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995449,0.001980131,0.00029534343,0.0006552395,0.0013273929,0.00029280642],"domain_scores_gemma":[0.9941397,0.00263196,0.00017404415,0.0010804561,0.001731703,0.00024215358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052334964,0.0012504036,0.0017011443,0.002915728,0.0017046958,0.0029768846,0.0027131373,0.002105613,0.011549768],"category_scores_gemma":[0.01630263,0.0008677974,0.0015582036,0.0035563477,0.0004971064,0.003952125,0.0027539546,0.0031187644,0.0073710396],"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.00038166074,0.00032639474,0.002057652,0.00033193838,0.00023285951,0.00013456916,0.00046973376,0.045602757,0.011233178,0.017618751,0.041744854,0.8798657],"study_design_scores_gemma":[0.000046148125,0.00012022597,0.0013239154,0.000045112352,0.00013094838,0.00021880613,0.000113274946,0.94559973,0.0063588712,0.03220162,0.013771389,0.00007002193],"about_ca_topic_score_codex":0.0052759885,"about_ca_topic_score_gemma":0.007836175,"teacher_disagreement_score":0.011549768,"about_ca_system_score_codex":0.0011331928,"about_ca_system_score_gemma":0.0019297327,"threshold_uncertainty_score":0.038637817},"labels":[],"label_agreement":null},{"id":"W2163630478","doi":"10.1007/978-3-642-04346-8_20","title":"Chance Encounters in the Digital Library","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Novelty; Computer science; Digital library; Interface (matter); Focus (optics); Human–computer interaction; Value (mathematics); Data science; World Wide Web; Machine learning; Psychology","score_opus":0.009265452476631342,"score_gpt":0.23472269564367335,"score_spread":0.225457243167042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163630478","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030758297,0.0067923274,0.0009016462,0.012982691,0.0010152613,0.000028912007,0.00013723056,0.0001416775,0.94724196],"genre_scores_gemma":[0.24502061,0.0058851033,0.00064838666,0.0027622909,0.00091230485,0.000036886453,0.0001751804,0.00020939812,0.74434996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973043,0.00093179534,0.000091411,0.00024169876,0.00066339935,0.00076735887],"domain_scores_gemma":[0.9966672,0.00059488765,0.00023319453,0.00009620531,0.00015554043,0.002252939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013945583,0.0004455944,0.0007346394,0.0020434686,0.021584984,0.021630954,0.0012395391,0.0029226104,0.13566124],"category_scores_gemma":[0.0048526344,0.00057280913,0.00055459223,0.003126315,0.006196739,0.016828874,0.012882307,0.004588015,0.022456069],"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.00023304234,0.00019420419,0.0067413687,0.00033853954,0.000019976767,0.0023001123,0.13524522,0.00012523102,0.00043160334,0.34613034,0.39603493,0.11220549],"study_design_scores_gemma":[0.0000072936637,0.00003546597,0.0017150249,0.00025452496,0.0000059603904,0.0011474063,0.07074772,0.00006140039,0.00010723747,0.012742201,0.9131522,0.000023555374],"about_ca_topic_score_codex":0.0062264623,"about_ca_topic_score_gemma":0.026956566,"teacher_disagreement_score":0.13566124,"about_ca_system_score_codex":0.0043373443,"about_ca_system_score_gemma":0.00444168,"threshold_uncertainty_score":0.4538321},"labels":[],"label_agreement":null},{"id":"W2163636154","doi":"10.1007/978-3-540-85287-2_9","title":"An Efficient Statistical Approach for Automatic Organic Chemistry Summarization","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Polytechnique Montréal","funders":"","keywords":"Automatic summarization; Computer science; Sentence; Natural language processing; Information retrieval; Artificial intelligence","score_opus":0.01678369904806987,"score_gpt":0.24083519758218888,"score_spread":0.22405149853411901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163636154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003785722,0.00047726455,0.98719424,0.00014361863,0.00013146811,0.00011075129,0.00076173106,0.0062504397,0.0011447507],"genre_scores_gemma":[0.05922479,0.00055924576,0.9264702,0.00016459382,0.00039374243,0.00042970452,0.005922237,0.00074142875,0.0060940417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986733,0.00029385742,0.00013078589,0.0002531934,0.0005312339,0.00011757778],"domain_scores_gemma":[0.9978284,0.0010301593,0.00012593248,0.0002657036,0.0006861784,0.00006355503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692145,0.0015041176,0.0017632893,0.003550322,0.0009282407,0.002005135,0.0023786556,0.0011373146,0.007847962],"category_scores_gemma":[0.0041537127,0.0007276127,0.0016046322,0.003939922,0.00043703333,0.0019670958,0.0018167893,0.0013739982,0.0064456463],"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.00024135735,0.000144068,0.0003867421,0.00025310367,0.00012314625,0.000118111195,0.000072699055,0.031807784,0.024275813,0.008241505,0.019417048,0.91491854],"study_design_scores_gemma":[0.00006248182,0.00013987691,0.00090696756,0.000020841351,0.00010475449,0.00017053347,0.000070176284,0.94234425,0.017503269,0.023461442,0.015165263,0.000050226146],"about_ca_topic_score_codex":0.0029832274,"about_ca_topic_score_gemma":0.0061708395,"teacher_disagreement_score":0.007847962,"about_ca_system_score_codex":0.00056312385,"about_ca_system_score_gemma":0.0017490666,"threshold_uncertainty_score":0.026254058},"labels":[],"label_agreement":null},{"id":"W2164005335","doi":"10.1007/11422778_77","title":"Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Randomized algorithm; Distributed computing; Wireless network; Heuristic; Energy consumption; Efficient energy use; Wireless; Computer network; Mathematical optimization; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.014813500375333775,"score_gpt":0.24284729264367727,"score_spread":0.2280337922683435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164005335","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.03297533,0.0008601813,0.96098596,0.00058130774,0.00024372218,0.00019417149,0.00018918069,0.0007821157,0.0031880434],"genre_scores_gemma":[0.76662576,0.00077914726,0.22723486,0.0003435532,0.0003959724,0.000415944,0.0003429466,0.0002003647,0.0036613971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644464,0.001580149,0.00015878554,0.00046378298,0.0009088504,0.00044380088],"domain_scores_gemma":[0.990248,0.005937519,0.0007583987,0.0022407225,0.0004909477,0.00032426673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040527075,0.0010677589,0.0016434157,0.00086810836,0.0011002215,0.00121269,0.0035047957,0.0011999792,0.0022515066],"category_scores_gemma":[0.0115188835,0.0007567951,0.00070224836,0.0019846815,0.001513364,0.0026218074,0.002354625,0.0019395365,0.0003525255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001535175,0.00032575816,0.00040028148,0.00030616744,0.00011492277,0.00008930431,0.00021660826,0.7145341,0.014285505,0.115155235,0.008252343,0.1447846],"study_design_scores_gemma":[0.00013972617,0.00016607503,0.00011246065,0.000013800869,0.000021622383,0.000041284304,0.000025065618,0.9500532,0.0023107613,0.04588118,0.0012173739,0.000017499422],"about_ca_topic_score_codex":0.0010838804,"about_ca_topic_score_gemma":0.0016691486,"teacher_disagreement_score":0.0040527075,"about_ca_system_score_codex":0.0022341497,"about_ca_system_score_gemma":0.002333558,"threshold_uncertainty_score":0.021433055},"labels":[],"label_agreement":null},{"id":"W2164014144","doi":"10.1007/11941378_23","title":"A Simple and Unified Method of Proving Indistinguishability","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":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":"Hash function; Computer science; Simple (philosophy); PMAC; Function (biology); Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Programming language","score_opus":0.019341120802635673,"score_gpt":0.29333394727670087,"score_spread":0.2739928264740652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164014144","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.0012585591,0.00020866876,0.98693174,0.00032066146,0.0002540837,0.00015808978,0.00009374669,0.001141922,0.0096325325],"genre_scores_gemma":[0.09526905,0.0006287992,0.88253635,0.0007991278,0.0005804305,0.0009367052,0.0005344533,0.0010561513,0.017658958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98483306,0.0032375932,0.0011411461,0.002472988,0.007342741,0.000972532],"domain_scores_gemma":[0.9838684,0.00666309,0.00040482052,0.00668861,0.0019119176,0.000463126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061997934,0.0028153344,0.003917104,0.0045367344,0.0036900048,0.008833537,0.0073662754,0.004158832,0.015644956],"category_scores_gemma":[0.023183012,0.0026430339,0.0049921437,0.0033904521,0.010552197,0.020625781,0.01783395,0.012417258,0.008986753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011811029,0.00015349567,0.00021353363,0.00027561272,0.00008596149,0.00015979345,0.00038329096,0.0019253432,0.005266817,0.89804417,0.0083536245,0.08502025],"study_design_scores_gemma":[0.000066776425,0.00007431453,0.00015209008,0.00007382923,0.0000940137,0.00031853662,0.00007086369,0.017549397,0.009964809,0.94915324,0.022385502,0.000096640964],"about_ca_topic_score_codex":0.0007715844,"about_ca_topic_score_gemma":0.0009636424,"teacher_disagreement_score":0.015644956,"about_ca_system_score_codex":0.0022028564,"about_ca_system_score_gemma":0.0029475624,"threshold_uncertainty_score":0.052337646},"labels":[],"label_agreement":null},{"id":"W2164052165","doi":"10.1007/978-3-642-12993-3_9","title":"Hex, Braids, the Crossing Rule, and XH-Search","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Braid; Computer science; Connection (principal bundle); Algorithm; Mathematics; Geometry; Materials science","score_opus":0.030826282254413074,"score_gpt":0.2931463569686589,"score_spread":0.26232007471424584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164052165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05668357,0.010331556,0.53020984,0.002279721,0.00096499914,0.00011567952,0.0006196519,0.0008837478,0.39791125],"genre_scores_gemma":[0.69334596,0.006006268,0.15958837,0.00085724914,0.00040580993,0.00020247747,0.000950509,0.00073982426,0.13790347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922824,0.00020102931,0.00007246903,0.0001612298,0.00020818869,0.000128803],"domain_scores_gemma":[0.99875236,0.00070611417,0.000085628606,0.00026294196,0.00012604623,0.00006683445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074048905,0.0004967625,0.0010380984,0.0013092116,0.0017466688,0.0034624445,0.0012367795,0.0017977597,0.020466331],"category_scores_gemma":[0.0044383854,0.0004675243,0.00068543875,0.0032198126,0.003913193,0.009792218,0.0017695315,0.0022808297,0.0030148374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037641727,0.000010805063,0.00010463686,0.000051801715,0.000004225258,0.00003863048,0.00008712656,0.0013219021,0.00020045866,0.96859163,0.0033806036,0.026170364],"study_design_scores_gemma":[0.0000065998483,0.000008222414,0.000055709992,0.000020316076,0.000004189669,0.0000978335,0.000057336565,0.0032398128,0.0002513513,0.9877863,0.008464338,0.000007967993],"about_ca_topic_score_codex":0.0025415546,"about_ca_topic_score_gemma":0.002700688,"teacher_disagreement_score":0.020466331,"about_ca_system_score_codex":0.0008715508,"about_ca_system_score_gemma":0.000782174,"threshold_uncertainty_score":0.06846666},"labels":[],"label_agreement":null},{"id":"W2164116039","doi":"10.1007/978-3-642-03767-2_38","title":"Directional Force Field-Based Maps: Implementation and Application","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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 Guelph","funders":"","keywords":"Computer science; Object (grammar); Raster graphics; Point (geometry); Field (mathematics); Domain (mathematical analysis); Matching (statistics); Raster data; Algorithm; Computer vision; Image (mathematics); Force field (fiction); Artificial intelligence; Mathematics; Geometry; Mathematical analysis","score_opus":0.0071651299622749265,"score_gpt":0.23212794198255363,"score_spread":0.2249628120202787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164116039","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.006024859,0.00030227375,0.983108,0.000088720975,0.000091799724,0.00005066912,0.00025828474,0.0046074763,0.005467878],"genre_scores_gemma":[0.15258418,0.0006618803,0.83427745,0.00005152712,0.000031126954,0.00013492104,0.00050224626,0.00036261394,0.01139405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988484,0.000015108703,0.0000045148367,0.000016091599,0.00006851082,0.000010833856],"domain_scores_gemma":[0.9997886,0.00005680125,0.0000086554055,0.000036424393,0.00009709929,0.0000123641485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002001407,0.0005501041,0.00025853486,0.0005341038,0.00028229906,0.000519644,0.0010998683,0.00061516865,0.012088706],"category_scores_gemma":[0.0007858363,0.00029868458,0.000241602,0.00080419506,0.00019001433,0.00054525846,0.0006175908,0.00032852445,0.0024158796],"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.00016638289,0.000107154636,0.00061101443,0.00021063801,0.00002941185,0.00013585747,0.00013723728,0.06260866,0.024535224,0.017246483,0.016347894,0.87786406],"study_design_scores_gemma":[0.00008466847,0.00014357966,0.0008954776,0.000047401492,0.00003834716,0.00061070465,0.00009830101,0.865238,0.05307182,0.015397989,0.064316235,0.000057425044],"about_ca_topic_score_codex":0.004009284,"about_ca_topic_score_gemma":0.0045487755,"teacher_disagreement_score":0.012088706,"about_ca_system_score_codex":0.00021607136,"about_ca_system_score_gemma":0.00030175803,"threshold_uncertainty_score":0.040440798},"labels":[],"label_agreement":null},{"id":"W2164278564","doi":"10.1007/3-540-36285-1_16","title":"New Rewritings and Optimizations for Regular Path Queries","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Concordia University","funders":"","keywords":"Computer science; Path (computing); Conjunctive query; Regular expression; Path expression; Database query; Theoretical computer science; Query language; Algorithm; Relational database; Database; Programming language","score_opus":0.011993411357859278,"score_gpt":0.2162608945504441,"score_spread":0.2042674831925848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164278564","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.022471817,0.0012626644,0.94365925,0.000909929,0.0005173787,0.00030325976,0.00059541804,0.0077932617,0.02248698],"genre_scores_gemma":[0.16748607,0.0010730467,0.80031466,0.0005052302,0.0006430674,0.00032402508,0.0014812733,0.0043204376,0.02385214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535805,0.0008712167,0.0005238211,0.0008180695,0.0019615719,0.00046713033],"domain_scores_gemma":[0.9951767,0.0020630853,0.00020708686,0.0018325389,0.0005929261,0.00012767014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001829932,0.0010798255,0.0014442806,0.001510243,0.0011825733,0.0027460742,0.0027335212,0.0011458113,0.0108743645],"category_scores_gemma":[0.008488133,0.0012302211,0.002297173,0.0027142614,0.0020284343,0.008470477,0.0025136347,0.0041527837,0.0029079681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045595653,0.00033819795,0.0006265583,0.0006246861,0.00011902881,0.0004237303,0.0009858792,0.014426927,0.023473995,0.4996734,0.025936509,0.43291506],"study_design_scores_gemma":[0.0001309443,0.00012172396,0.0006073419,0.00009104826,0.00028377815,0.0006904687,0.00025240873,0.10947312,0.028632652,0.8000177,0.05957147,0.00012744451],"about_ca_topic_score_codex":0.0012736627,"about_ca_topic_score_gemma":0.0029324288,"teacher_disagreement_score":0.0108743645,"about_ca_system_score_codex":0.001396951,"about_ca_system_score_gemma":0.00093921745,"threshold_uncertainty_score":0.036378384},"labels":[],"label_agreement":null},{"id":"W2164283902","doi":"10.1007/11558651_42","title":"User Experiences with a Virtual Swimming Interface Exhibit","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Avatar; Exhibition; Computer science; BitTorrent tracker; Virtual reality; Computer graphics (images); Interface (matter); Human–computer interaction; Computer vision; Visual arts; Art; Eye tracking","score_opus":0.010775760634056641,"score_gpt":0.2480132097675383,"score_spread":0.23723744913348166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164283902","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.9496839,0.00021194987,0.014377981,0.00041149041,0.00009784452,0.00016469783,0.00051704486,0.0014126307,0.033122405],"genre_scores_gemma":[0.91419154,0.0003106551,0.013543814,0.00016101303,0.00005533641,0.00016448618,0.00071100733,0.0005020903,0.07035996],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99977094,0.00008175501,0.000008285778,0.000023859775,0.000053956635,0.00006111074],"domain_scores_gemma":[0.9994887,0.00023515942,0.000016812635,0.000058546808,0.000050391965,0.00015037449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005830456,0.00085173233,0.00044533794,0.00051133684,0.0015959722,0.0013071651,0.0009202018,0.0011685665,0.026727395],"category_scores_gemma":[0.001220164,0.0003929094,0.0008342985,0.00027765718,0.00037516863,0.0010136304,0.0027026692,0.0007017583,0.0027150875],"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.008595304,0.007484815,0.04071155,0.002465442,0.0005723557,0.019971104,0.29729366,0.0077458452,0.3068442,0.009610381,0.070975944,0.22772938],"study_design_scores_gemma":[0.0007145337,0.016908292,0.26950747,0.0010167961,0.0011800228,0.014798609,0.1625471,0.049444657,0.08624754,0.004605758,0.39197308,0.001056047],"about_ca_topic_score_codex":0.0016266844,"about_ca_topic_score_gemma":0.004364458,"teacher_disagreement_score":0.026727395,"about_ca_system_score_codex":0.0001587111,"about_ca_system_score_gemma":0.00016553371,"threshold_uncertainty_score":0.08941209},"labels":[],"label_agreement":null},{"id":"W2164380903","doi":"10.1007/3-540-36159-6_30","title":"Message Authentication Codes with Error Correcting Capabilities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication (law); Message authentication code; Computer security; Computer network; Cryptography","score_opus":0.017450033132082515,"score_gpt":0.22968309769738973,"score_spread":0.21223306456530722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164380903","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.03271602,0.00617091,0.8250306,0.0020170498,0.0013744123,0.00028632142,0.00041766628,0.0025404936,0.12944649],"genre_scores_gemma":[0.5784612,0.007604791,0.26009828,0.00091609807,0.0011778523,0.0006111203,0.0005260064,0.0005593753,0.15004526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893016,0.00021995383,0.00006475209,0.000108700464,0.0005146287,0.000161666],"domain_scores_gemma":[0.9966276,0.001473347,0.00031490414,0.0008547151,0.0006450707,0.000084165134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081035524,0.0011362701,0.00062508095,0.0020096295,0.0011358351,0.002182433,0.0008568921,0.0018216694,0.0077943676],"category_scores_gemma":[0.0041788695,0.00051212194,0.00053940224,0.002318017,0.0016929093,0.0027427294,0.0018563865,0.0022289124,0.00390849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010307035,0.000029497472,0.00016257793,0.00032205938,0.000016524757,0.00019528597,0.00029274132,0.010174167,0.008468973,0.83758944,0.009646388,0.13299933],"study_design_scores_gemma":[0.00006118388,0.00021480318,0.0003051561,0.00047014924,0.00007484612,0.001645872,0.000101202495,0.06269939,0.060300335,0.6987153,0.17529836,0.00011337677],"about_ca_topic_score_codex":0.00046442394,"about_ca_topic_score_gemma":0.000429383,"teacher_disagreement_score":0.0077943676,"about_ca_system_score_codex":0.00088464975,"about_ca_system_score_gemma":0.0013051125,"threshold_uncertainty_score":0.026074827},"labels":[],"label_agreement":null},{"id":"W2164399703","doi":"10.1007/978-3-540-92862-1_11","title":"Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"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":"Asynchronous communication; Visibility; Computer science; RADIUS; Software deployment; Mobile robot; Space (punctuation); Distributed computing; Real-time computing; Robot; Artificial intelligence; Computer network; Physics; Operating system","score_opus":0.018289782234800583,"score_gpt":0.23551771006421018,"score_spread":0.2172279278294096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164399703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08753444,0.0002908151,0.9049108,0.00017610354,0.00012423373,0.00003884656,0.00006787079,0.0003285811,0.00652844],"genre_scores_gemma":[0.8231354,0.00047860475,0.16961177,0.000058146346,0.000094635274,0.000088616776,0.00013254199,0.000049892453,0.0063504167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958795,0.00010561235,0.000020075551,0.00011157973,0.00011554841,0.000059309525],"domain_scores_gemma":[0.99935824,0.00025915145,0.00010448601,0.0001106216,0.00009001761,0.00007750743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004935688,0.00064404367,0.00062113645,0.00031339496,0.00040583464,0.0006804772,0.00090947445,0.0006021463,0.0010512026],"category_scores_gemma":[0.0018926564,0.00046976286,0.0002401249,0.00058004056,0.0006374017,0.0013492152,0.0017679073,0.00057567545,0.0004048188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010015895,0.00017020419,0.0017722665,0.00021027136,0.00005299711,0.00029983016,0.000245377,0.73589116,0.054011006,0.04229393,0.002713363,0.16133809],"study_design_scores_gemma":[0.000045080065,0.00019944432,0.00045400998,0.000010309756,0.000014933294,0.00007671567,0.00005779812,0.98019284,0.0071227276,0.009929923,0.0018814664,0.000014639319],"about_ca_topic_score_codex":0.00071292586,"about_ca_topic_score_gemma":0.0012368131,"teacher_disagreement_score":0.0010512026,"about_ca_system_score_codex":0.00032389996,"about_ca_system_score_gemma":0.0004041974,"threshold_uncertainty_score":0.003516674},"labels":[],"label_agreement":null},{"id":"W2164764197","doi":"10.1007/11590323_4","title":"Generating Ambient Behaviors in Computer Role-Playing Games","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Scripting language; Computer science; Computer game; Human–computer interaction; Code (set theory); Programming language; Multimedia","score_opus":0.024243061859419032,"score_gpt":0.2738307188121801,"score_spread":0.24958765695276103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164764197","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07643001,0.00007971205,0.9118731,0.00009286669,0.000040574865,0.000119804,0.000069725815,0.0017629919,0.009531248],"genre_scores_gemma":[0.7434072,0.00008979558,0.2491223,0.000049525926,0.000017084718,0.00021399352,0.00025041605,0.00033290274,0.006516801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995703,0.00018189425,0.000020338819,0.00007333166,0.000110281624,0.000043746262],"domain_scores_gemma":[0.99904996,0.00068476074,0.00003147387,0.00009295877,0.00009377778,0.00004714674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006457779,0.0004826728,0.0003434853,0.00022519528,0.00032154965,0.0006818378,0.0010736969,0.00051183766,0.003909112],"category_scores_gemma":[0.0032950288,0.00031922248,0.00048762144,0.00016779444,0.0007094649,0.0009471046,0.0011854914,0.0007942879,0.00057357695],"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.000604088,0.00062033854,0.0036512488,0.00045294914,0.0000756627,0.0005377042,0.0026126094,0.28419942,0.04354366,0.33078307,0.005435315,0.32748398],"study_design_scores_gemma":[0.000058219055,0.000110212626,0.00043814039,0.00003128638,0.00002327504,0.00008688465,0.00016220429,0.8231254,0.007700711,0.16464217,0.0036064705,0.000014995472],"about_ca_topic_score_codex":0.00073974003,"about_ca_topic_score_gemma":0.0012507817,"teacher_disagreement_score":0.003909112,"about_ca_system_score_codex":0.00026493333,"about_ca_system_score_gemma":0.00027397778,"threshold_uncertainty_score":0.013077259},"labels":[],"label_agreement":null},{"id":"W2164833019","doi":"10.1007/978-3-642-16599-3_15","title":"Towards Web Services Tagging by Similarity Detection","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Similarity (geometry); Information retrieval; World Wide Web; Web service; Artificial intelligence","score_opus":0.00668578898758164,"score_gpt":0.21958503315040576,"score_spread":0.2128992441628241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164833019","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.0057952045,0.0002271276,0.98851556,0.00010623807,0.0001018649,0.00011010473,0.00015936805,0.0036790657,0.0013056184],"genre_scores_gemma":[0.07848856,0.00038946257,0.91253895,0.00021518301,0.00010128935,0.00012166481,0.0016209286,0.0008890359,0.0056350026],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959265,0.000906742,0.0003246324,0.00089868583,0.0016816598,0.0002618639],"domain_scores_gemma":[0.9949698,0.0014058745,0.0002566808,0.0016804083,0.0014714068,0.00021587395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027075268,0.001171722,0.0018922088,0.0066456413,0.0015085528,0.0040061492,0.002924095,0.0025099232,0.0030044443],"category_scores_gemma":[0.008078344,0.0011802611,0.0020548813,0.0062338193,0.0012577316,0.0056184484,0.0051249103,0.0021860944,0.0071825855],"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.00056559726,0.0005697553,0.0027318445,0.0005684281,0.00020276134,0.0005400607,0.0005761493,0.014462537,0.07845873,0.06295317,0.01795331,0.82041764],"study_design_scores_gemma":[0.000057884365,0.00013029375,0.0014155546,0.00012562702,0.00015598195,0.0010545528,0.00037991954,0.7188222,0.09923565,0.135408,0.04307289,0.00014144547],"about_ca_topic_score_codex":0.0037566805,"about_ca_topic_score_gemma":0.0034177778,"teacher_disagreement_score":0.0066456413,"about_ca_system_score_codex":0.0010303918,"about_ca_system_score_gemma":0.0016693892,"threshold_uncertainty_score":0.014318943},"labels":[],"label_agreement":null},{"id":"W2165456429","doi":"10.1007/978-3-540-74974-5_21","title":"Service License Composition and Compatibility Analysis","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":33,"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":"License; Computer science; Interoperability; Web service; Compatibility (geochemistry); Merge (version control); Service composition; Composability; Services computing; Service-oriented architecture; Service (business); Service design; Differentiated service; World Wide Web; Computer security; Software engineering; Service provider; Distributed computing; Business; Engineering; Operating system","score_opus":0.016570466360819575,"score_gpt":0.2556848462552581,"score_spread":0.23911437989443854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165456429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043214258,0.00018949591,0.89756966,0.00042836985,0.0000901165,0.0001690471,0.00014924869,0.0010968118,0.05709299],"genre_scores_gemma":[0.68784237,0.00036348874,0.2792381,0.00019910476,0.00017849711,0.0002198003,0.000664929,0.0010052376,0.030288428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964012,0.00069774676,0.0001517947,0.00043551647,0.0018018058,0.0005119116],"domain_scores_gemma":[0.9946126,0.0027685345,0.0002496857,0.000869597,0.0013261295,0.0001734863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023882396,0.0008388458,0.0009520498,0.0043778573,0.0028572078,0.0034611155,0.0017944827,0.0013529138,0.011132354],"category_scores_gemma":[0.00960409,0.0008734622,0.0018514134,0.0034739675,0.0023755536,0.007220295,0.0030007944,0.002871082,0.0021179616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021808996,0.00022775038,0.0022056333,0.00008827477,0.000036419875,0.00044350978,0.00036589312,0.016505115,0.005275025,0.8793232,0.0030908189,0.0922202],"study_design_scores_gemma":[0.000021720227,0.00004201639,0.0010492674,0.000046003657,0.00006641327,0.0005230927,0.0003311524,0.27434453,0.017054887,0.69327325,0.013199181,0.000048572907],"about_ca_topic_score_codex":0.0042637275,"about_ca_topic_score_gemma":0.0028551177,"teacher_disagreement_score":0.011132354,"about_ca_system_score_codex":0.001496555,"about_ca_system_score_gemma":0.0021585894,"threshold_uncertainty_score":0.03724146},"labels":[],"label_agreement":null},{"id":"W2165498702","doi":"10.1007/978-3-642-20520-0_32","title":"Evolution of Architectural Floor Plans","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":33,"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":"Computer science; Flexibility (engineering); Scope (computer science); Variety (cybernetics); Process (computing); Representation (politics); Sizing; Ranking (information retrieval); Evolutionary computation; Operations research; Industrial engineering; Software engineering; Artificial intelligence; Programming language; Engineering","score_opus":0.012354334558981833,"score_gpt":0.20340970287033455,"score_spread":0.19105536831135272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165498702","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.7906756,0.00062837335,0.083420776,0.0005072953,0.000116644485,0.000036217712,0.00077517575,0.00036698603,0.1234728],"genre_scores_gemma":[0.97260916,0.0002413614,0.013126704,0.00001767402,0.000009998962,0.00001233109,0.00045156194,0.00012656115,0.01340462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984705,0.00003593388,0.00000424942,0.000034214427,0.0000433638,0.00003510703],"domain_scores_gemma":[0.99971527,0.000054506385,0.00003782506,0.000053674135,0.000076164935,0.00006260963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018713267,0.0002902397,0.00021842818,0.00068496336,0.0005884697,0.001477836,0.0005600383,0.00048535637,0.012370665],"category_scores_gemma":[0.001646139,0.00046192497,0.00044298318,0.0007065133,0.00063273904,0.00065948983,0.00074565306,0.0005762925,0.001258378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016575822,0.00007200233,0.011049305,0.00009826265,0.000056398818,0.00052238465,0.0006818715,0.53544253,0.022319397,0.3031247,0.008937813,0.11752956],"study_design_scores_gemma":[0.000028611246,0.00008920884,0.022329444,0.000049971666,0.000038351234,0.00040698284,0.0011206933,0.753538,0.004436535,0.18120591,0.036702882,0.000053406322],"about_ca_topic_score_codex":0.008968964,"about_ca_topic_score_gemma":0.009550663,"teacher_disagreement_score":0.012370665,"about_ca_system_score_codex":0.0012157526,"about_ca_system_score_gemma":0.0005379825,"threshold_uncertainty_score":0.04138404},"labels":[],"label_agreement":null},{"id":"W2165570403","doi":"10.1007/11550518_40","title":"Separable Linear Discriminant Classification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"York University","funders":"","keywords":"Linear discriminant analysis; Separable space; Computer science; Discriminant; Artificial intelligence; Pattern recognition (psychology); Object (grammar); Optimal discriminant analysis; Binary classification; Sample (material); Binary number; Machine learning; Support vector machine; Mathematics","score_opus":0.032904859021884635,"score_gpt":0.2738893529282073,"score_spread":0.24098449390632268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165570403","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.010873287,0.003939394,0.93630725,0.0005611406,0.00070524815,0.000093482864,0.00078097614,0.0051280744,0.04161112],"genre_scores_gemma":[0.14612453,0.0042515662,0.64928085,0.000436853,0.0007446518,0.0002092808,0.0075918417,0.0011685553,0.1901919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960846,0.000052903408,0.000019075056,0.00011348703,0.00016344548,0.00004257761],"domain_scores_gemma":[0.9996171,0.00006719845,0.00001826059,0.00012510749,0.00014910365,0.000023248205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056488416,0.0009143536,0.000978647,0.0012914626,0.0005358347,0.0011849429,0.00084003684,0.00067188876,0.020166159],"category_scores_gemma":[0.00097460585,0.00039993704,0.0006267949,0.0013722111,0.00041358965,0.0011787539,0.0011248629,0.0012919725,0.021492224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007180713,0.000063872554,0.00020457002,0.00008797776,0.000022202063,0.00002757332,0.00001956461,0.004421927,0.011089536,0.010784515,0.031287648,0.9419188],"study_design_scores_gemma":[0.00003461568,0.00017926288,0.0029906768,0.00012016504,0.0000992678,0.0008113957,0.000096219344,0.5861792,0.071589544,0.07399604,0.2638167,0.00008681484],"about_ca_topic_score_codex":0.0008284122,"about_ca_topic_score_gemma":0.0016527884,"teacher_disagreement_score":0.020166159,"about_ca_system_score_codex":0.00035291622,"about_ca_system_score_gemma":0.0005296019,"threshold_uncertainty_score":0.067462504},"labels":[],"label_agreement":null},{"id":"W2165602610","doi":"10.1007/978-3-642-12200-2_35","title":"Ambiguity and Deficiency in Costas Arrays and APN Permutations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Carleton University","funders":"","keywords":"Permutation (music); Ambiguity; Upper and lower bounds; Abelian group; Permutation group; Combinatorics; Computer science; Mathematics; Discrete mathematics","score_opus":0.012580546011538355,"score_gpt":0.23460573121406253,"score_spread":0.22202518520252418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165602610","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.39944157,0.0033010656,0.24104959,0.0054753246,0.0011690146,0.00012362425,0.00064449065,0.00044676958,0.34834853],"genre_scores_gemma":[0.9108433,0.0012263802,0.03917457,0.00047141055,0.00053611776,0.00010792377,0.00022296715,0.00016082313,0.04725658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989214,0.00035036315,0.00007260635,0.00013878517,0.00036659857,0.00015017939],"domain_scores_gemma":[0.99695694,0.0016533302,0.0002861898,0.00056261296,0.00034432355,0.00019660387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198174,0.0005956148,0.00077644875,0.0017999902,0.0016342027,0.0030916356,0.0007717222,0.0014319433,0.0067888997],"category_scores_gemma":[0.008328616,0.00052697334,0.0005459207,0.002324468,0.0039466834,0.0039503756,0.0020213856,0.002407119,0.0014448225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047352714,0.000007631867,0.00014677367,0.0000181621,0.0000014341631,0.00006618453,0.00011725578,0.0007983406,0.00048038154,0.9898102,0.00094172393,0.0075645833],"study_design_scores_gemma":[0.000009394367,0.000009384858,0.00006670252,0.000008541327,0.0000019687363,0.00018086913,0.00004866801,0.0021407465,0.00027818867,0.99447364,0.0027746959,0.000007156358],"about_ca_topic_score_codex":0.0003647286,"about_ca_topic_score_gemma":0.00030077834,"teacher_disagreement_score":0.0067888997,"about_ca_system_score_codex":0.00097313576,"about_ca_system_score_gemma":0.00081035297,"threshold_uncertainty_score":0.022711158},"labels":[],"label_agreement":null},{"id":"W2165908632","doi":"10.1007/978-3-319-02937-5_2","title":"Revisiting MAC Forgeries, Weak Keys and Provable Security of Galois/Counter Mode of Operation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Block cipher; Hash function; Computer security; Provable security; Block cipher mode of operation; Authentication (law); GCM transcription factors; Construct (python library); Theoretical computer science; Mode (computer interface); Block (permutation group theory); Authenticated encryption; Encryption; Algorithm; Arithmetic; Computer network; Mathematics; Operating system","score_opus":0.012198484480009163,"score_gpt":0.2581925368093427,"score_spread":0.24599405232933352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165908632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024492757,0.044382125,0.62769026,0.018660417,0.004824519,0.00013022387,0.0003155994,0.0008516464,0.2786525],"genre_scores_gemma":[0.6538957,0.03596089,0.2022556,0.007687613,0.008281978,0.00028636423,0.00048263886,0.0011188798,0.09003037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618113,0.0012543866,0.00023218074,0.00068929116,0.0013232963,0.00031971745],"domain_scores_gemma":[0.99518895,0.0029439952,0.0001779153,0.0011920492,0.0004100312,0.00008707776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045842035,0.0018591062,0.0012838268,0.0018212142,0.0017462341,0.007062732,0.0026151438,0.0034688571,0.0064828186],"category_scores_gemma":[0.009764539,0.0015119065,0.0014112984,0.001816293,0.014175198,0.026591416,0.0050857686,0.01235556,0.0029640927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013559069,0.000008072559,0.000031232485,0.000072165916,0.0000043908244,0.000042404376,0.00018071021,0.0003941529,0.00036804215,0.9895921,0.0014495963,0.007843681],"study_design_scores_gemma":[0.000004899392,0.000011827026,0.000031180814,0.00006036194,0.000006069874,0.00010426545,0.0000324347,0.0009750386,0.0004735726,0.98110735,0.017182568,0.000010554607],"about_ca_topic_score_codex":0.0008110301,"about_ca_topic_score_gemma":0.00063840573,"teacher_disagreement_score":0.007062732,"about_ca_system_score_codex":0.0029815063,"about_ca_system_score_gemma":0.0014588486,"threshold_uncertainty_score":0.024243891},"labels":[],"label_agreement":null},{"id":"W2166021602","doi":"10.1007/978-3-319-22960-7_4","title":"Identifying Pedagogical Uses of Serious Games for Learning English as a Second Language","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EFL/ESL Teaching and Learning","field":"Arts and Humanities","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":"Université Laval","funders":"","keywords":"Computer science; Taxonomy (biology); Context (archaeology); Language acquisition; English language; English as a second language; Mathematics education; Artificial intelligence; Linguistics; Multimedia; Natural language processing; Psychology","score_opus":0.08805196069414571,"score_gpt":0.32468139335596063,"score_spread":0.2366294326618149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166021602","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.9217144,0.0013316877,0.016867118,0.00049562805,0.000064771084,0.0002083263,0.00017220808,0.00033408124,0.058811814],"genre_scores_gemma":[0.95372,0.0013794847,0.0263958,0.00014567726,0.00001451073,0.00020947157,0.00044845743,0.00014316852,0.017543348],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9971048,0.0013125124,0.0001887281,0.00029246198,0.0008276949,0.00027383832],"domain_scores_gemma":[0.98773986,0.009055741,0.0009078746,0.0005500683,0.0009228076,0.0008237073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002195977,0.0006917999,0.0002593199,0.0025710736,0.0008127475,0.005312994,0.0011359748,0.0006888729,0.0024030851],"category_scores_gemma":[0.017778233,0.00038732047,0.00047459546,0.0014033981,0.00084422884,0.0039386665,0.0032947892,0.0012887107,0.00078310136],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007069481,0.0016477293,0.13919917,0.0011971719,0.00014902902,0.0012665637,0.13077432,0.0007157515,0.017620608,0.028237952,0.0065633804,0.6719214],"study_design_scores_gemma":[0.00023135603,0.0026887404,0.4240711,0.0035644153,0.0006356839,0.0092506455,0.198497,0.017961312,0.03362015,0.03976202,0.26943374,0.00028385627],"about_ca_topic_score_codex":0.0027393561,"about_ca_topic_score_gemma":0.008821488,"teacher_disagreement_score":0.005312994,"about_ca_system_score_codex":0.0011484737,"about_ca_system_score_gemma":0.0015390847,"threshold_uncertainty_score":0.011613607},"labels":[],"label_agreement":null},{"id":"W2166045895","doi":"10.1007/11731139_15","title":"Boosting Prediction Accuracy on Imbalanced Datasets with SVM Ensembles","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":149,"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":"Boosting (machine learning); Computer science; Support vector machine; Artificial intelligence; Machine learning; Data mining; Sampling (signal processing); Context (archaeology); Ensemble learning; Oversampling; Pattern recognition (psychology); Data sampling; Bandwidth (computing)","score_opus":0.017473232998650397,"score_gpt":0.25374102670363796,"score_spread":0.23626779370498757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166045895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3218287,0.003910728,0.6611638,0.0010138326,0.0011521089,0.00015777955,0.00054061477,0.0034319093,0.0068004997],"genre_scores_gemma":[0.88470525,0.0006056139,0.110226095,0.00022501792,0.00062967703,0.00008557748,0.00093959854,0.00019565412,0.0023876573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978362,0.00078627846,0.0001229278,0.00034413376,0.00071715016,0.00019338631],"domain_scores_gemma":[0.99117017,0.004976322,0.00032011166,0.0015342606,0.0017933082,0.00020590586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068789,0.0013023274,0.0020999887,0.0014905895,0.00038550678,0.0010550382,0.00125803,0.0011769566,0.000983529],"category_scores_gemma":[0.014545677,0.0005235376,0.0008439003,0.0011581271,0.00035396835,0.0023502703,0.0014440536,0.0021992445,0.0010419794],"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.0009591361,0.00048771675,0.014321994,0.00015469178,0.00037795125,0.00009737578,0.00009083235,0.3001433,0.0070797973,0.0024508252,0.015445608,0.65839076],"study_design_scores_gemma":[0.0000144356845,0.00008399004,0.0013570425,0.000011627463,0.000039021987,0.000031088974,0.000009164651,0.99360996,0.0020811239,0.0023494677,0.0004059249,0.00000709808],"about_ca_topic_score_codex":0.0011059864,"about_ca_topic_score_gemma":0.0014734722,"teacher_disagreement_score":0.0068789,"about_ca_system_score_codex":0.00042610226,"about_ca_system_score_gemma":0.00045845273,"threshold_uncertainty_score":0.036379516},"labels":[],"label_agreement":null},{"id":"W2166270257","doi":"10.1007/978-3-642-28509-7_22","title":"Recommending Services in a Trust-Based Decentralized User Modeling System","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Saskatchewan","funders":"","keywords":"Computer science; Service provider; Reputation; Service (business); Quality (philosophy); Preference; Computational trust; Reputation system; Knowledge management; Internet privacy; Business; Marketing","score_opus":0.032970771542109825,"score_gpt":0.2648530019396814,"score_spread":0.2318822303975716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166270257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095652424,0.00022428036,0.8981955,0.0007515242,0.000037442995,0.00016055856,0.00018741611,0.003073249,0.0017176741],"genre_scores_gemma":[0.81886125,0.00016110812,0.17680024,0.00013569213,0.000048094123,0.00011907577,0.00033904114,0.00011651022,0.0034190174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709594,0.0009114284,0.00027989483,0.0006465943,0.0008302252,0.00023589024],"domain_scores_gemma":[0.9958162,0.0017940328,0.0003331949,0.0010469132,0.00061603455,0.00039369252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040051616,0.0006138547,0.0020892753,0.00097005133,0.0019829085,0.002872192,0.0031756852,0.0022777922,0.0019626122],"category_scores_gemma":[0.007047984,0.000871034,0.0011637388,0.0016622238,0.0008295659,0.0040410836,0.0026543126,0.0014964752,0.00085323147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002058683,0.0009913406,0.010917038,0.00017613088,0.00037973045,0.0009050136,0.0013754584,0.72030747,0.017961372,0.041430652,0.0074896114,0.19600748],"study_design_scores_gemma":[0.000013503124,0.000021932414,0.000111225316,0.0000017687803,0.000013956243,0.000041507792,0.000025043733,0.9956606,0.0006885625,0.0030433347,0.00036930403,0.0000092829605],"about_ca_topic_score_codex":0.019108366,"about_ca_topic_score_gemma":0.01963653,"teacher_disagreement_score":0.019108366,"about_ca_system_score_codex":0.0019941241,"about_ca_system_score_gemma":0.0020278909,"threshold_uncertainty_score":0.037994266},"labels":[],"label_agreement":null},{"id":"W2166526587","doi":"10.1007/3-540-44886-1_6","title":"Patttern-Based AI Scripting Using ScriptEase","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Dialog box; Programming language; Interface (matter); Plot (graphics); Simple (philosophy); Character (mathematics); Human–computer interaction; Code (set theory); Artificial intelligence; World Wide Web; Operating system","score_opus":0.023622183307807416,"score_gpt":0.2693468416890865,"score_spread":0.2457246583812791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166526587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03726398,0.00021292518,0.84190065,0.00012913505,0.00017105216,0.00018037201,0.00020583755,0.104240164,0.015695896],"genre_scores_gemma":[0.4277561,0.00027768896,0.53555113,0.00028054658,0.000072181,0.00019816098,0.0009890716,0.0063091414,0.028565953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966717,0.0000531147,0.000028213875,0.00009341223,0.00011922986,0.000038755323],"domain_scores_gemma":[0.99889636,0.000513411,0.00006985653,0.00028140962,0.00016942927,0.00006944073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039155735,0.00075657526,0.0004962717,0.0005281752,0.00037035288,0.00079722813,0.0011370449,0.00055306614,0.009061856],"category_scores_gemma":[0.0020358262,0.00037599594,0.0004223643,0.00030489222,0.000491056,0.001306057,0.00080520497,0.00094647135,0.002124291],"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.00043063107,0.00033039902,0.002147516,0.0003951983,0.00006978133,0.00058171275,0.0006578406,0.02318454,0.1311287,0.012786733,0.023760796,0.8045261],"study_design_scores_gemma":[0.00006499125,0.0002486055,0.0015770495,0.000061466024,0.00006292402,0.0010565255,0.0001209706,0.7370398,0.19702941,0.017295329,0.045372993,0.00006990314],"about_ca_topic_score_codex":0.0009783016,"about_ca_topic_score_gemma":0.0015009443,"teacher_disagreement_score":0.009061856,"about_ca_system_score_codex":0.00025426038,"about_ca_system_score_gemma":0.00031673303,"threshold_uncertainty_score":0.030314863},"labels":[],"label_agreement":null},{"id":"W2166557989","doi":"10.1007/978-3-642-21538-4_21","title":"Question Type Classification Using a Part-of-Speech Hierarchy","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Lakehead University","funders":"","keywords":"Computer science; Hierarchy; Type (biology); Artificial intelligence; Natural language processing; Task (project management)","score_opus":0.048633084525883524,"score_gpt":0.30054311330116584,"score_spread":0.25191002877528235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166557989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06308928,0.0025484576,0.8868565,0.0010221823,0.0004947181,0.0016391587,0.011179078,0.017489934,0.015680697],"genre_scores_gemma":[0.22855233,0.0009294403,0.7362159,0.00034595543,0.00029847305,0.0006387597,0.020662205,0.00071268645,0.0116441995],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972784,0.00039666335,0.0004017667,0.0008311742,0.00077182427,0.00032025494],"domain_scores_gemma":[0.99438584,0.0025698585,0.00034700485,0.0005122338,0.0018071862,0.00037797066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025941138,0.0013863596,0.0019174223,0.009384253,0.0017405562,0.0037122208,0.0026160458,0.0020421096,0.012897888],"category_scores_gemma":[0.0065202164,0.00058538426,0.0025402422,0.0049924045,0.0007923627,0.0051387236,0.0019021509,0.0020378463,0.008213534],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010077752,0.0005503328,0.01406734,0.0010101132,0.00019042594,0.0005244551,0.0009586667,0.00398656,0.06730761,0.011541429,0.02485213,0.8740032],"study_design_scores_gemma":[0.00021539924,0.000676852,0.029779345,0.0005616156,0.0011152957,0.002128159,0.0023058585,0.69250786,0.10484946,0.09087343,0.07465676,0.00032998022],"about_ca_topic_score_codex":0.0075831455,"about_ca_topic_score_gemma":0.010245076,"teacher_disagreement_score":0.012897888,"about_ca_system_score_codex":0.0014321669,"about_ca_system_score_gemma":0.0025360002,"threshold_uncertainty_score":0.043147683},"labels":[],"label_agreement":null},{"id":"W2166642883","doi":"10.1007/978-3-642-11269-0_26","title":"Improved Parameterized Algorithms for the Kemeny Aggregation Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Combinatorics; Preference; Running time; Notation; Mathematics; Algorithm; Pairwise comparison; Time complexity; Discrete mathematics; Set (abstract data type); Computer science; Statistics; Arithmetic","score_opus":0.03607595728339694,"score_gpt":0.23831189161738128,"score_spread":0.20223593433398435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166642883","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.014672165,0.00036776945,0.973958,0.0006979846,0.00014531954,0.00016817925,0.00034707505,0.00094295444,0.008700654],"genre_scores_gemma":[0.17010684,0.00041691732,0.8142883,0.00034805073,0.0003190237,0.000626687,0.0014401551,0.0008525732,0.011601321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554527,0.001576493,0.00030651086,0.0010684852,0.00091792265,0.0005852616],"domain_scores_gemma":[0.9883259,0.0069895433,0.0005496202,0.0030784388,0.00066903344,0.00038734058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051288093,0.0017766022,0.003322998,0.0018948808,0.0024120158,0.0052459114,0.0063316394,0.0037184567,0.018179277],"category_scores_gemma":[0.022717154,0.0012411322,0.0026755063,0.0046199127,0.0020039093,0.011407434,0.00555444,0.0067439647,0.0039556646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000825403,0.000667076,0.0010802164,0.00029744362,0.00017399924,0.00010956625,0.00047039404,0.24499556,0.002690713,0.43618378,0.026686158,0.2858197],"study_design_scores_gemma":[0.00019127471,0.00004519185,0.00019665634,0.000024870491,0.000036472637,0.000039322265,0.00006226414,0.54134846,0.0007939829,0.45409662,0.0031392723,0.000025654585],"about_ca_topic_score_codex":0.0042563993,"about_ca_topic_score_gemma":0.006507518,"teacher_disagreement_score":0.018179277,"about_ca_system_score_codex":0.004185438,"about_ca_system_score_gemma":0.0042840955,"threshold_uncertainty_score":0.060815692},"labels":[],"label_agreement":null},{"id":"W2166669788","doi":"10.1007/11841920_8","title":"Efficient Incremental Validation of XML Documents After Composite Updates","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; XML validation; RELAX NG; XML; XML Schema (W3C); Document Structure Description; Scalability; Streaming XML; Schema (genetic algorithms); Efficient XML Interchange; Programming language; XML Schema Editor; Database; Information retrieval; Document type definition; World Wide Web","score_opus":0.006390539843762291,"score_gpt":0.24618337710327273,"score_spread":0.23979283725951045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166669788","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.11157799,0.001225126,0.82751954,0.00053210347,0.000528161,0.00066052686,0.0016112971,0.050711315,0.005633876],"genre_scores_gemma":[0.52451104,0.0004091646,0.44969416,0.0003333047,0.00018319553,0.00032302257,0.0050322977,0.007524458,0.011989367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98913366,0.0026629656,0.0010034551,0.0014214868,0.0048716697,0.00090680475],"domain_scores_gemma":[0.9347841,0.03286778,0.0023016525,0.022293933,0.007204689,0.00054775947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00786305,0.0014739829,0.0020711687,0.0026070534,0.0015089083,0.004954949,0.0049332944,0.0021948162,0.0057866536],"category_scores_gemma":[0.033859678,0.0018277002,0.0020455536,0.002608193,0.0018959588,0.007573678,0.004853144,0.002144955,0.0025941394],"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.0033433167,0.0005276998,0.008475868,0.00116425,0.00029782104,0.0016221472,0.0018430105,0.06406957,0.09468793,0.031528387,0.026168132,0.7662719],"study_design_scores_gemma":[0.0003142681,0.00041597465,0.0035787255,0.00024014869,0.0004454117,0.0009851684,0.0005135249,0.59384775,0.31065828,0.05899124,0.029763516,0.0002460193],"about_ca_topic_score_codex":0.0042034034,"about_ca_topic_score_gemma":0.0056271534,"teacher_disagreement_score":0.00786305,"about_ca_system_score_codex":0.0012264409,"about_ca_system_score_gemma":0.0027236973,"threshold_uncertainty_score":0.041584253},"labels":[],"label_agreement":null},{"id":"W2166872798","doi":"10.1007/11566465_49","title":"Predicting Clinical Variable from MRI Features: Application to MMSE in MCI","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","cited_by":30,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Linear regression; Principal component analysis; Projection (relational algebra); Cohort; Linear discriminant analysis; Stepwise regression; Medicine; Variable (mathematics); Mathematics; Statistics; Feature selection; Algorithm; Artificial intelligence; Computer science","score_opus":0.016475330377391142,"score_gpt":0.35219371337521876,"score_spread":0.33571838299782764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166872798","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.98395073,0.0015540353,0.011938901,0.0003164192,0.000051925865,0.0000726683,0.0008842871,0.00028108736,0.0009499356],"genre_scores_gemma":[0.98974705,0.0005551868,0.0086770505,0.000037650265,0.00006509448,0.0000356102,0.00045437677,0.00001813913,0.00040984177],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.00016787209,0.000034157332,0.00006205939,0.000045614634,0.00002078507],"domain_scores_gemma":[0.99534935,0.0035383694,0.00024030972,0.00014337745,0.00047906334,0.000249617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022904715,0.00092706736,0.0012456913,0.0020415734,0.00031527816,0.0012163445,0.0005901617,0.00096851843,0.0011009485],"category_scores_gemma":[0.008393683,0.0003076369,0.0005421142,0.0013140667,0.00020907576,0.00044049416,0.0003743669,0.0009105045,0.00038623423],"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.0033481547,0.00054754916,0.7558566,0.00011965232,0.0003338992,0.0002744561,0.00016029645,0.016552243,0.0037110897,0.00013277882,0.0016519974,0.21731137],"study_design_scores_gemma":[0.0002524631,0.0011608938,0.65093774,0.00005564266,0.00047759217,0.0005613684,0.00034272508,0.34052816,0.0030894908,0.0018724417,0.00064987165,0.00007163162],"about_ca_topic_score_codex":0.007039999,"about_ca_topic_score_gemma":0.00769718,"teacher_disagreement_score":0.007039999,"about_ca_system_score_codex":0.0002344613,"about_ca_system_score_gemma":0.0005089226,"threshold_uncertainty_score":0.013998032},"labels":[],"label_agreement":null},{"id":"W2167298577","doi":"10.1007/978-3-662-43880-0_4","title":"Soliton Solutions as Inverse Problem for Coefficient Identification","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Inverse problem; Computer science; Identification (biology); Inverse; Applied mathematics; Parameter identification problem; Algorithm; Mathematical optimization; Mathematical analysis; Mathematics; Geometry; Model parameter","score_opus":0.01798184850722243,"score_gpt":0.2646756925232204,"score_spread":0.24669384401599795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167298577","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.03186212,0.0016123595,0.8880802,0.0014781444,0.0009645218,0.00008569284,0.00013342738,0.00019487005,0.07558881],"genre_scores_gemma":[0.4079405,0.0042011184,0.41070223,0.0007725458,0.0013831962,0.00041897173,0.0005920022,0.0005659725,0.17342345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961406,0.00015202876,0.000021040429,0.00006196594,0.00012704756,0.000023914596],"domain_scores_gemma":[0.9994305,0.00032713416,0.00004603739,0.00005271924,0.0000976096,0.000046092737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071321573,0.0011617856,0.0009149109,0.0011928566,0.00058340357,0.0020008686,0.0012734273,0.002308748,0.0059458246],"category_scores_gemma":[0.002718546,0.0005540134,0.0009505135,0.00085708604,0.0018084206,0.0026583956,0.0024565824,0.0038072134,0.0013233658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000409068,0.000033616685,0.00007720677,0.00017170567,0.000017820788,0.00013451574,0.00025075377,0.011296896,0.005464893,0.95716286,0.004129217,0.021219566],"study_design_scores_gemma":[0.000016564114,0.000030062982,0.00006933599,0.00005097418,0.0000107273245,0.000236706,0.00014658271,0.1703318,0.0014526269,0.8189318,0.008698067,0.000024655992],"about_ca_topic_score_codex":0.00028745006,"about_ca_topic_score_gemma":0.0003046743,"teacher_disagreement_score":0.0059458246,"about_ca_system_score_codex":0.00043617617,"about_ca_system_score_gemma":0.0004776273,"threshold_uncertainty_score":0.019890785},"labels":[],"label_agreement":null},{"id":"W2167383591","doi":"10.1007/978-3-540-72665-4_16","title":"Probability Based Metrics for Locally Weighted Naive Bayes","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Euclidean distance; Metric (unit); Euclidean geometry; Computer science; Naive Bayes classifier; Artificial intelligence; Mathematics; Bayes' theorem; Classifier (UML); Pattern recognition (psychology); Statistics; Bayesian probability","score_opus":0.053574323598486975,"score_gpt":0.27740961236539363,"score_spread":0.22383528876690667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167383591","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.0044111605,0.0023211667,0.98829263,0.00043992462,0.0001264665,0.000092040835,0.0002111345,0.00028529443,0.0038202],"genre_scores_gemma":[0.2111052,0.0035974982,0.7689243,0.000621197,0.0009846857,0.0011395048,0.0019230932,0.000928423,0.010776153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98562014,0.0069677425,0.0010936595,0.0015787449,0.0042949235,0.00044482521],"domain_scores_gemma":[0.96293175,0.024647163,0.001860112,0.0041146837,0.0053114067,0.0011349733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012795728,0.002028943,0.0038502961,0.0055291285,0.0018329342,0.0056334157,0.0046544205,0.0035086998,0.0073648],"category_scores_gemma":[0.06776566,0.0013047179,0.0017147526,0.00481506,0.0031151653,0.013857373,0.004337719,0.004534728,0.001546851],"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.00010597398,0.00007090196,0.0011993244,0.00041161093,0.00014622456,0.00006767241,0.00029808906,0.06755395,0.0007589211,0.76956904,0.007443856,0.1523744],"study_design_scores_gemma":[0.000008404903,0.000032520547,0.00018735981,0.00005626833,0.000023408755,0.00005248963,0.000023074204,0.15849055,0.00015775263,0.8378028,0.0031409618,0.000024379286],"about_ca_topic_score_codex":0.004252896,"about_ca_topic_score_gemma":0.003982077,"teacher_disagreement_score":0.012795728,"about_ca_system_score_codex":0.004239648,"about_ca_system_score_gemma":0.0021759744,"threshold_uncertainty_score":0.06767112},"labels":[],"label_agreement":null},{"id":"W2167462877","doi":"10.1007/11744085_9","title":"Robust Visual Tracking for Multiple Targets","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer vision; Particle filter; Artificial intelligence; Clutter; Tracking (education); Video tracking; Tracking system; Frame (networking); Filter (signal processing); Radar; Video processing","score_opus":0.04229944082357135,"score_gpt":0.29179060562894904,"score_spread":0.2494911648053777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167462877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031869758,0.0005885286,0.99413246,0.000036253507,0.00005294732,0.000009627335,0.000030968247,0.0007118724,0.0012503912],"genre_scores_gemma":[0.21284638,0.0017674927,0.76643765,0.00014961619,0.00014207371,0.00008482654,0.0006007369,0.0005937438,0.017377464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.000054843633,0.000022825496,0.00017130883,0.0002570686,0.00005510157],"domain_scores_gemma":[0.9994815,0.00018159194,0.0000685871,0.00013284004,0.00011509314,0.000020379532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899815,0.0008952223,0.0009457529,0.0010412218,0.00027146374,0.00092358975,0.0013425114,0.0011787702,0.0025575394],"category_scores_gemma":[0.0023640606,0.0007368638,0.0007516723,0.0010857478,0.00044893206,0.0011687374,0.0013785148,0.0009861176,0.0015871532],"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.00021191259,0.00004489624,0.00019745325,0.00014694498,0.0000901125,0.00010825469,0.00006199115,0.14998433,0.078710355,0.011079298,0.005880051,0.7534843],"study_design_scores_gemma":[0.000015773052,0.0000610859,0.0005031821,0.000021610154,0.000031856336,0.0001989901,0.000011217146,0.9546823,0.027221942,0.01250998,0.004718217,0.000023901059],"about_ca_topic_score_codex":0.0028053003,"about_ca_topic_score_gemma":0.002511791,"teacher_disagreement_score":0.0028053003,"about_ca_system_score_codex":0.0004971559,"about_ca_system_score_gemma":0.00038675228,"threshold_uncertainty_score":0.0085558295},"labels":[],"label_agreement":null},{"id":"W2167565009","doi":"10.1007/978-3-642-53917-6_28","title":"Utility Enhancement for Privacy Preserving Health Data Publishing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Custodians; Computer science; Data publishing; Data anonymization; Field (mathematics); Publishing; Data science; Information privacy; Data mining; Internet privacy; Law","score_opus":0.09427616479741288,"score_gpt":0.3202887735095125,"score_spread":0.22601260871209963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167565009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034203,0.0022258945,0.9644313,0.0010028206,0.00021454133,0.00014817624,0.00020320057,0.0006627515,0.010769303],"genre_scores_gemma":[0.7720568,0.0022346263,0.20873976,0.0003724942,0.00042308384,0.00017406564,0.0004386568,0.00016387407,0.015396598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978333,0.00079855847,0.00015151483,0.00025163876,0.00074815436,0.00021673301],"domain_scores_gemma":[0.9953406,0.0021589068,0.00019759023,0.0016512407,0.0005305736,0.00012106287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002936032,0.00045571665,0.00091433746,0.0007808715,0.0005467688,0.0022398534,0.0018672495,0.00079662673,0.003923673],"category_scores_gemma":[0.008242913,0.0002920765,0.00083085895,0.0015576072,0.0012360393,0.0033568721,0.002156637,0.0018419157,0.00078128604],"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.0006901369,0.0002020117,0.0011536226,0.00046233204,0.00007590104,0.0005037781,0.00037979617,0.04049021,0.008368256,0.62226343,0.009119016,0.31629154],"study_design_scores_gemma":[0.000055988075,0.0002254685,0.00058636826,0.00008874535,0.00008612099,0.0013433878,0.00012499344,0.4364105,0.017358063,0.52343446,0.020253628,0.00003237728],"about_ca_topic_score_codex":0.000367937,"about_ca_topic_score_gemma":0.00027736722,"teacher_disagreement_score":0.003923673,"about_ca_system_score_codex":0.0009852288,"about_ca_system_score_gemma":0.0007821822,"threshold_uncertainty_score":0.015527427},"labels":[],"label_agreement":null},{"id":"W2167737301","doi":"10.1007/11678779_2","title":"The Safety Simple Subset","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Automaton; Regular expression; Translation (biology); Prefix; Simple (philosophy); Büchi automaton; Linear temporal logic; Expression (computer science); Theoretical computer science; Algorithm; Deterministic automaton; Programming language","score_opus":0.019851094047621313,"score_gpt":0.26954455614006717,"score_spread":0.24969346209244586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167737301","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.05085751,0.001688601,0.2650276,0.0029962026,0.0012044074,0.00020482905,0.0008451769,0.001119138,0.67605656],"genre_scores_gemma":[0.66775006,0.0018410654,0.05165571,0.0016587802,0.0011938714,0.0005030594,0.0017939581,0.0007493419,0.2728542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.00009177123,0.000043924025,0.00017630924,0.00020762206,0.00007180956],"domain_scores_gemma":[0.99938846,0.00019529078,0.000036513575,0.00019116026,0.00014142561,0.000047168876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055822154,0.0007381735,0.0007421867,0.0009452992,0.0017031125,0.0016516361,0.00056143216,0.00066434033,0.01534901],"category_scores_gemma":[0.0012120797,0.00048481324,0.00081344915,0.0006112526,0.0022877054,0.0038244145,0.0020760717,0.0025473272,0.005155787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005713509,0.000024392495,0.00012582293,0.00008324102,0.000010951988,0.00011637541,0.00030513614,0.0004049111,0.0030517546,0.95132446,0.009500858,0.034994997],"study_design_scores_gemma":[0.00001292312,0.00004447026,0.00015134047,0.000025188892,0.000014895756,0.00025196568,0.00009559965,0.0010561767,0.0030434965,0.93305516,0.062240545,0.000008222986],"about_ca_topic_score_codex":0.00029318215,"about_ca_topic_score_gemma":0.00029452043,"teacher_disagreement_score":0.01534901,"about_ca_system_score_codex":0.0005153251,"about_ca_system_score_gemma":0.0006690686,"threshold_uncertainty_score":0.051347494},"labels":[],"label_agreement":null},{"id":"W2167974132","doi":"10.1007/978-3-540-39964-3_6","title":"A Distributed Rule Mechanism for Multidatabase Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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 Ottawa; University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Mechanism (biology); Active database; Distributed database; Distributed Computing Environment; Exception handling; Database; Data mining; Programming language","score_opus":0.018615448546552147,"score_gpt":0.24925304291487949,"score_spread":0.23063759436832734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167974132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038828219,0.00033369559,0.98545665,0.0002096041,0.00018236772,0.00016415074,0.00012423999,0.0075967535,0.0020496391],"genre_scores_gemma":[0.11619343,0.00044772073,0.8680714,0.00040664963,0.0003473828,0.00037868417,0.0008493079,0.0019459483,0.01135954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918399,0.0014512714,0.0014643554,0.0011656869,0.0035096882,0.000569093],"domain_scores_gemma":[0.9833598,0.0038287006,0.00052864844,0.009908284,0.0016373283,0.0007371885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010624451,0.00077914627,0.0021635373,0.002062716,0.002666541,0.0075497557,0.011289964,0.0035384512,0.009306226],"category_scores_gemma":[0.014378679,0.0020367226,0.0021377748,0.0029957301,0.002679484,0.014246185,0.008483041,0.004786048,0.0033947004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009917252,0.0006089927,0.0018227925,0.0005384931,0.0002918829,0.0008894364,0.0012558618,0.025353732,0.018414553,0.3694602,0.024881747,0.5554906],"study_design_scores_gemma":[0.0006616522,0.00038848887,0.0007518172,0.00021808842,0.00047816036,0.0015841511,0.00022104196,0.3280057,0.043027233,0.4856934,0.13867635,0.00029386437],"about_ca_topic_score_codex":0.0016732272,"about_ca_topic_score_gemma":0.0019070766,"teacher_disagreement_score":0.011289964,"about_ca_system_score_codex":0.0009917978,"about_ca_system_score_gemma":0.0018107807,"threshold_uncertainty_score":0.056188166},"labels":[],"label_agreement":null},{"id":"W2167999092","doi":"10.1007/978-3-540-89722-4_5","title":"Regularized Fitted Q-Iteration: Application to Planning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","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":"McGill University; University of Alberta","funders":"","keywords":"Subroutine; Computer science; Mathematical optimization; Hilbert space; Reproducing kernel Hilbert space; Kernel (algebra); Markov decision process; Simple (philosophy); Function (biology); Algorithm; Applied mathematics; Markov process; Mathematics; Discrete mathematics; Statistics","score_opus":0.010057463297514294,"score_gpt":0.2141080455470367,"score_spread":0.20405058224952238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167999092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002748126,0.000113405185,0.99582195,0.00005692802,0.000031307678,0.000015913041,0.00001846595,0.0002745407,0.0009192003],"genre_scores_gemma":[0.15998267,0.00018075343,0.83535606,0.000074177726,0.00005572168,0.00014475783,0.00009270254,0.00040678913,0.0037063076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.00051450095,0.00005032802,0.00015606507,0.00019689753,0.000063657906],"domain_scores_gemma":[0.9936773,0.004867421,0.00017496033,0.00033493136,0.00076850364,0.00017680624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003007391,0.0008017176,0.0019232358,0.00064300623,0.000617752,0.0012947023,0.0018985324,0.0020669468,0.005232531],"category_scores_gemma":[0.012095016,0.0010639906,0.0009238911,0.0012459803,0.0016583407,0.0013701193,0.002001199,0.0022986007,0.0007415939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013931707,0.00005865655,0.00023626667,0.00013324468,0.000030536205,0.00005329058,0.00011818083,0.87792236,0.0008107251,0.04440263,0.0023150195,0.07377976],"study_design_scores_gemma":[0.0000071518093,0.000009700966,0.000011885646,0.000003369183,0.000001886598,0.0000045813504,0.0000030694582,0.9919525,0.00015018009,0.0075804354,0.0002721748,0.0000030065237],"about_ca_topic_score_codex":0.008837162,"about_ca_topic_score_gemma":0.0066882656,"teacher_disagreement_score":0.008837162,"about_ca_system_score_codex":0.0010188062,"about_ca_system_score_gemma":0.0018013408,"threshold_uncertainty_score":0.01757145},"labels":[],"label_agreement":null},{"id":"W2168066985","doi":"10.1007/978-3-540-68083-3_37","title":"Node Placement of Linear Wireless Multimedia Sensor Networks for Maximum Network Lifetime","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"St. Francis Xavier University","funders":"","keywords":"Wireless sensor network; Node (physics); Computer science; Computer network; Energy consumption; Key distribution in wireless sensor networks; Scheme (mathematics); Power consumption; Wireless; Wireless network; Energy (signal processing); Power (physics); Telecommunications; Engineering; Electrical engineering; Mathematics","score_opus":0.013552859570019369,"score_gpt":0.22992923846460384,"score_spread":0.21637637889458447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168066985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018925019,0.00085150375,0.9732473,0.00022090909,0.00006352456,0.00007423892,0.00010279244,0.00035811015,0.00615656],"genre_scores_gemma":[0.64713883,0.0018990694,0.33277074,0.00019536473,0.00015054607,0.00033886402,0.00023150805,0.00028400338,0.016991107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997954,0.00007015606,0.000008984351,0.000042665615,0.00005742611,0.000025401521],"domain_scores_gemma":[0.9996018,0.00022273995,0.000051450465,0.00002822831,0.00007257741,0.000023208375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004177152,0.0007218462,0.0005419168,0.00036596085,0.00038470316,0.0005101439,0.0014140933,0.00058226835,0.0040992266],"category_scores_gemma":[0.0018964317,0.00042205845,0.00029307848,0.0007084821,0.0003690161,0.0009369414,0.0007132901,0.0005076218,0.00076781685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021759208,0.00005533719,0.00031564466,0.0005105148,0.000030550425,0.000106454056,0.00014994701,0.7660101,0.024968108,0.027013665,0.0054516434,0.17517042],"study_design_scores_gemma":[0.0000085165675,0.00007807662,0.000082938095,0.000017264178,0.000008151684,0.000044965545,0.00003054744,0.9850817,0.0028927212,0.010429151,0.0013189398,0.0000070671313],"about_ca_topic_score_codex":0.001310398,"about_ca_topic_score_gemma":0.0020578464,"teacher_disagreement_score":0.0040992266,"about_ca_system_score_codex":0.00083147513,"about_ca_system_score_gemma":0.00047292904,"threshold_uncertainty_score":0.013713241},"labels":[],"label_agreement":null},{"id":"W2168204328","doi":"10.1007/978-3-642-00434-6_16","title":"A Practical Evaluation of Using TXL for Model Transformation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Transformation (genetics); Artificial intelligence; Computer graphics (images)","score_opus":0.08288288948716212,"score_gpt":0.34321542578951275,"score_spread":0.26033253630235065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168204328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3051358,0.0005975904,0.55600274,0.0014452912,0.00027174535,0.0010409964,0.0021805232,0.08527932,0.04804598],"genre_scores_gemma":[0.5398933,0.00029603989,0.4408861,0.00024324976,0.000030367604,0.00025937892,0.0021055897,0.0080353655,0.008250533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99155617,0.004071568,0.0005360544,0.0005396148,0.002918997,0.00037752662],"domain_scores_gemma":[0.9485213,0.035019837,0.000719817,0.010818349,0.0044032196,0.00051734457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069269943,0.0010979736,0.00048447715,0.0011480673,0.00071149506,0.0023029011,0.002424905,0.0015482206,0.02631045],"category_scores_gemma":[0.040879384,0.0005468373,0.0007257443,0.0015219925,0.0009447987,0.0041800956,0.0029208253,0.0015995336,0.0046685645],"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.0073244195,0.0019171613,0.009299796,0.0024234185,0.0002568024,0.0009530745,0.0025580819,0.05409458,0.04378839,0.034244675,0.020254513,0.822885],"study_design_scores_gemma":[0.0018247032,0.0031683964,0.0048193415,0.00044681234,0.00039064503,0.0012239406,0.003191534,0.74639446,0.14908406,0.01891835,0.070396096,0.00014163103],"about_ca_topic_score_codex":0.0037056946,"about_ca_topic_score_gemma":0.0037990275,"teacher_disagreement_score":0.02631045,"about_ca_system_score_codex":0.00084803347,"about_ca_system_score_gemma":0.0013164317,"threshold_uncertainty_score":0.088017225},"labels":[],"label_agreement":null},{"id":"W2168236595","doi":"10.1007/978-3-319-18681-8_17","title":"A Higher Order Key Partitioning Attack with Application to LBlock","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Cryptanalysis; Ciphertext; Plaintext; Key (lock); Cipher; Theoretical computer science; Block cipher; Algorithm; Cryptography; Encryption; Computer security","score_opus":0.03151126186858777,"score_gpt":0.29470118633753917,"score_spread":0.2631899244689514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168236595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14445472,0.0009864871,0.7640149,0.0027266894,0.0006129463,0.00033023336,0.00022960317,0.0036160594,0.08302837],"genre_scores_gemma":[0.8800385,0.00041990005,0.0979818,0.00037835198,0.00018149476,0.000096924676,0.00015002427,0.0002853076,0.020467736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986992,0.00026244574,0.000054678385,0.00015161883,0.0005312861,0.00030074405],"domain_scores_gemma":[0.9979107,0.000842146,0.00012661655,0.000855432,0.00017661139,0.000088455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069702737,0.00060657127,0.0006971512,0.001037132,0.0012710014,0.0020252292,0.00078927085,0.0019422818,0.0058221593],"category_scores_gemma":[0.0036928176,0.00034664068,0.00069432036,0.0013898271,0.0015358829,0.0037441894,0.0026727174,0.002305601,0.0017616617],"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.0012568486,0.00031632747,0.0019035253,0.00027598807,0.000070605456,0.0012128488,0.00070202304,0.030843353,0.06563609,0.6480439,0.01780463,0.23193383],"study_design_scores_gemma":[0.00015302363,0.00031151396,0.0009819469,0.00009237624,0.00009291139,0.0028650444,0.00023192941,0.4726837,0.07459726,0.4115903,0.036303885,0.00009606663],"about_ca_topic_score_codex":0.00040037383,"about_ca_topic_score_gemma":0.00036763915,"teacher_disagreement_score":0.0058221593,"about_ca_system_score_codex":0.0009509741,"about_ca_system_score_gemma":0.0006038026,"threshold_uncertainty_score":0.01947701},"labels":[],"label_agreement":null},{"id":"W2168480783","doi":"10.1007/978-3-540-31996-2_18","title":"The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Tabu search; Simulated annealing; Heuristics; Mathematical optimization; Computer science; Scheduling (production processes); Job shop scheduling; Mathematics; Schedule","score_opus":0.03834756714255014,"score_gpt":0.23679867176615116,"score_spread":0.19845110462360102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168480783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04611216,0.0053824927,0.9290603,0.00062425,0.00035970088,0.00012652097,0.00010489547,0.00056014326,0.017669478],"genre_scores_gemma":[0.4641902,0.0025994515,0.52831596,0.00021724273,0.00013924607,0.0001918984,0.00014521545,0.00015715332,0.004043654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995895,0.00023140076,0.000021740774,0.000034647095,0.00008455321,0.000038141185],"domain_scores_gemma":[0.9987909,0.0008996526,0.000077221644,0.00010167791,0.000097128854,0.00003329367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001517502,0.0007275219,0.0007726486,0.0009285025,0.00041227235,0.0009936417,0.0011334557,0.00083477807,0.0015052409],"category_scores_gemma":[0.002812193,0.00078418496,0.00095589814,0.0012256369,0.0004231213,0.0012075267,0.0005717992,0.0011974336,0.00023260278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001533588,0.0000883358,0.00040485215,0.00014972012,0.00014508258,0.000084986226,0.000043757675,0.8667187,0.0018686454,0.026060045,0.002379875,0.10190264],"study_design_scores_gemma":[0.000036107504,0.000055837692,0.00013846638,0.00003046455,0.000042364423,0.00004092394,0.000012129245,0.9799514,0.0010332512,0.016031964,0.0026172749,0.000009855797],"about_ca_topic_score_codex":0.0016732757,"about_ca_topic_score_gemma":0.0023586168,"teacher_disagreement_score":0.0016732757,"about_ca_system_score_codex":0.0007078683,"about_ca_system_score_gemma":0.00085187564,"threshold_uncertainty_score":0.008025408},"labels":[],"label_agreement":null},{"id":"W2168531074","doi":"10.1007/978-3-540-77105-0_46","title":"The Wi-Fi Roaming Game","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ICT Impact and Policies","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":"Roaming; Wireless; Computer science; Computer network; Wireless network; Telecommunications","score_opus":0.01663091672249375,"score_gpt":0.24509286929246893,"score_spread":0.22846195256997517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168531074","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031432793,0.0015273546,0.28704897,0.0018368737,0.0002956593,0.00011425837,0.00020353396,0.00041473279,0.6771258],"genre_scores_gemma":[0.5658804,0.002845318,0.076249614,0.0004631396,0.00013606543,0.00027371765,0.00027512433,0.0001461467,0.35373047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982125,0.00006539532,0.0000046938917,0.000020962107,0.000055835117,0.000032053933],"domain_scores_gemma":[0.99985814,0.000078255085,0.0000073150572,0.000017255108,0.000017149507,0.000021851123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002354802,0.00052802044,0.00023808522,0.00020303439,0.00053479534,0.0012483656,0.000695642,0.00080950785,0.014833036],"category_scores_gemma":[0.0007769695,0.00016155936,0.00020032494,0.00024410337,0.00061425095,0.0013488105,0.0008533713,0.0007932985,0.002010633],"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.00012263875,0.000075057054,0.00024480838,0.000105658015,0.000022362501,0.00015971025,0.0004146919,0.024715522,0.0061189076,0.8365049,0.020244889,0.11127078],"study_design_scores_gemma":[0.000044391305,0.00015886073,0.0010713242,0.00020738145,0.000026348602,0.00066730025,0.0006163349,0.18486124,0.0055582854,0.43907166,0.3676493,0.000067581],"about_ca_topic_score_codex":0.001980665,"about_ca_topic_score_gemma":0.0028117476,"teacher_disagreement_score":0.014833036,"about_ca_system_score_codex":0.0004942698,"about_ca_system_score_gemma":0.00037922853,"threshold_uncertainty_score":0.049621463},"labels":[],"label_agreement":null},{"id":"W2168541843","doi":"10.1007/11752578_98","title":"Porting CFD Codes Towards Grids: A Case Study","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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":"Western University","funders":"","keywords":"Computer science; Porting; Grid; Load balancing (electrical power); Computational fluid dynamics; Parallel computing; Heuristic; Code (set theory); Graph; Distributed computing; Algorithm; Theoretical computer science; Programming language; Artificial intelligence; Software","score_opus":0.023671156914614373,"score_gpt":0.2695759246102245,"score_spread":0.24590476769561012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168541843","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.8820047,0.00034135944,0.07091588,0.0016069022,0.00019256264,0.00042651867,0.00033994365,0.0019407052,0.042231433],"genre_scores_gemma":[0.9445653,0.0002528308,0.045254685,0.0001224666,0.000021652377,0.00007864953,0.00016606307,0.00037447558,0.0091638705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841344,0.00064114504,0.00007497442,0.00011155326,0.0005933129,0.00016557406],"domain_scores_gemma":[0.99233234,0.00523802,0.00022877585,0.0011675269,0.0007178141,0.00031549786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022519,0.00075717096,0.0005050913,0.0007683548,0.0016413009,0.0020701657,0.0016160927,0.0028980635,0.004660234],"category_scores_gemma":[0.009587118,0.00050532265,0.00058767176,0.0011818086,0.0014869891,0.0016043901,0.00155306,0.0013443795,0.0010659224],"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.0025448145,0.0030970848,0.036159832,0.0012342249,0.00016442988,0.054506045,0.008831598,0.48009557,0.049479634,0.039108578,0.023829307,0.30094886],"study_design_scores_gemma":[0.0005403916,0.0016284809,0.008871208,0.00027681707,0.00016141284,0.014054118,0.00616168,0.77719766,0.106787354,0.018314162,0.06580582,0.0002009118],"about_ca_topic_score_codex":0.004519548,"about_ca_topic_score_gemma":0.0044325613,"teacher_disagreement_score":0.004660234,"about_ca_system_score_codex":0.00067381444,"about_ca_system_score_gemma":0.0006711809,"threshold_uncertainty_score":0.015590012},"labels":[],"label_agreement":null},{"id":"W2168774808","doi":"10.1007/978-3-319-21840-3_42","title":"Reconfiguration on Sparse Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Control reconfiguration; Theoretical computer science; Embedded system","score_opus":0.05107203587201308,"score_gpt":0.3020614445279913,"score_spread":0.2509894086559782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168774808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19659054,0.004885757,0.40396476,0.0017636872,0.0011043417,0.00018137923,0.00075803325,0.0040386124,0.3867129],"genre_scores_gemma":[0.8287835,0.0038694907,0.084749535,0.0004647845,0.00057932636,0.0002015918,0.0018730031,0.0010124446,0.078466184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982446,0.000036239908,0.000007960016,0.00004127254,0.000052634456,0.00003743867],"domain_scores_gemma":[0.99967146,0.00010934789,0.000036065987,0.00010473048,0.00003649606,0.000041936262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012212171,0.0005256342,0.00046557796,0.0007202166,0.0004257212,0.00077035447,0.0005023774,0.00036460135,0.012351534],"category_scores_gemma":[0.000796804,0.0003185117,0.00034211483,0.0010987441,0.0005597875,0.0014797358,0.001105783,0.00092137663,0.001779871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024272266,0.00007615503,0.00037820742,0.00052513706,0.00003773901,0.00040170667,0.00030010627,0.06239188,0.030024538,0.49547806,0.040983874,0.3691599],"study_design_scores_gemma":[0.000037396287,0.00009483361,0.00060705317,0.00006562852,0.000023485794,0.00051186397,0.0001503949,0.096314974,0.009005572,0.83348924,0.05967336,0.00002616973],"about_ca_topic_score_codex":0.000383161,"about_ca_topic_score_gemma":0.00054776535,"teacher_disagreement_score":0.012351534,"about_ca_system_score_codex":0.00044963058,"about_ca_system_score_gemma":0.00016596312,"threshold_uncertainty_score":0.041320026},"labels":[],"label_agreement":null},{"id":"W2168975319","doi":"10.1007/978-3-642-14518-6_19","title":"A Subexponential Algorithm for Evaluating Large Degree Isogenies","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Isogeny; Degree (music); Elliptic curve; Morphism; Endomorphism ring; Prime ideal; Prime (order theory); Principal ideal; Supersingular elliptic curve; Kernel (algebra); Modular elliptic curve; Homomorphism; Discrete mathematics; Pure mathematics; Combinatorics; Endomorphism","score_opus":0.0306241494359271,"score_gpt":0.2842703214134102,"score_spread":0.25364617197748307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168975319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030473888,0.0005625389,0.9444446,0.00045516665,0.00024474418,0.0001655872,0.00032076752,0.0055093584,0.01782335],"genre_scores_gemma":[0.18878168,0.00052904553,0.7752613,0.00028633745,0.00027358194,0.00027430584,0.0011209843,0.001541857,0.03193091],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822086,0.00026155464,0.00013942491,0.00034724013,0.00083643856,0.00019445193],"domain_scores_gemma":[0.9968573,0.0010121127,0.00013068882,0.0011710274,0.0006610395,0.00016774042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016244272,0.0015791247,0.0014901401,0.0020339477,0.001102557,0.0035432996,0.0023568638,0.001216749,0.018265398],"category_scores_gemma":[0.0067512156,0.00067971105,0.001199313,0.0028071627,0.0011995804,0.006195009,0.0036773118,0.0025946319,0.008611931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072017295,0.00019940225,0.0011744335,0.00025410464,0.000069279326,0.00013813771,0.00025879734,0.010122036,0.01683107,0.16985899,0.02022203,0.7801515],"study_design_scores_gemma":[0.0003420497,0.00026370093,0.0012552179,0.00008912286,0.00017158987,0.0006460264,0.00024951753,0.19313534,0.030632932,0.72444296,0.048684254,0.00008733374],"about_ca_topic_score_codex":0.0012315648,"about_ca_topic_score_gemma":0.0019745352,"teacher_disagreement_score":0.018265398,"about_ca_system_score_codex":0.0016199904,"about_ca_system_score_gemma":0.0016240776,"threshold_uncertainty_score":0.06110382},"labels":[],"label_agreement":null},{"id":"W2168987938","doi":"10.1007/11536482_24","title":"Picturing Causality – The Serendipitous Semiotics of Causal Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Saskatchewan","funders":"","keywords":"Causality (physics); Computer science; Causal inference; Bayesian network; Semantics (computer science); Visualization; Causal model; Knowledge representation and reasoning; Representation (politics); Data science; Artificial intelligence; Data visualization; Causal reasoning; Theoretical computer science; Epistemology; Programming language; Cognition; Mathematics; Psychology; Econometrics; Philosophy","score_opus":0.023031522613331773,"score_gpt":0.25407601728897866,"score_spread":0.2310444946756469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168987938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004124342,0.008923221,0.84608144,0.0083625335,0.001036814,0.00006537398,0.0003271657,0.00050907803,0.13057004],"genre_scores_gemma":[0.38602525,0.020076282,0.5409231,0.003508586,0.001916266,0.0003957981,0.0009816616,0.0009866062,0.04518633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979291,0.0014080208,0.00009896304,0.0002531722,0.0002537192,0.00005699252],"domain_scores_gemma":[0.9939936,0.004504666,0.00027969904,0.00074395246,0.00036190433,0.00011626591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028495276,0.0009706357,0.00065610424,0.0026256132,0.0018268514,0.0063128714,0.001531544,0.0022538118,0.010617971],"category_scores_gemma":[0.010170502,0.0009070349,0.0010282109,0.0029107525,0.012255369,0.0143196555,0.0017255085,0.004274958,0.002095846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024151161,0.0000016277456,0.000021492937,0.00002911371,0.0000026977018,0.000014463208,0.00030133352,0.0004879876,0.00006247441,0.994655,0.0011279028,0.0032934973],"study_design_scores_gemma":[0.0000014609323,0.0000021740277,0.000016243435,0.000025491545,0.0000022834276,0.000027250517,0.00006160197,0.00083860854,0.0000637487,0.9837015,0.015256163,0.0000034244065],"about_ca_topic_score_codex":0.0020473679,"about_ca_topic_score_gemma":0.0016501326,"teacher_disagreement_score":0.010617971,"about_ca_system_score_codex":0.0015033274,"about_ca_system_score_gemma":0.0013355414,"threshold_uncertainty_score":0.035520673},"labels":[],"label_agreement":null},{"id":"W2169161032","doi":"10.1007/978-3-540-24672-5_1","title":"A Constrained Semi-supervised Learning Approach to Data Association","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Matching (statistics); Association (psychology); Object (grammar); Pattern recognition (psychology); Probabilistic logic; Image (mathematics); Machine learning; Cognitive neuroscience of visual object recognition; Data mining; Mathematics","score_opus":0.033806070273559655,"score_gpt":0.26288659863053265,"score_spread":0.229080528356973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169161032","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.0008562728,0.00012700055,0.99838877,0.00006980126,0.00001866619,0.000030912888,0.000040994382,0.00031495202,0.00015262856],"genre_scores_gemma":[0.07007171,0.0003370156,0.9244565,0.0003204041,0.00023303194,0.0005048013,0.0009904546,0.00027361675,0.0028125227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990153,0.0044293315,0.0007746104,0.0018291975,0.0025248595,0.00028889425],"domain_scores_gemma":[0.9772066,0.014744511,0.00090159837,0.003639528,0.0031422542,0.00036546384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007344623,0.0012740089,0.00383837,0.002121322,0.0014309823,0.0025079981,0.007188212,0.002955866,0.0030389067],"category_scores_gemma":[0.024066428,0.0018139078,0.0022554188,0.004472378,0.0021805284,0.0038780423,0.0054905554,0.0037676252,0.001566078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037821222,0.00040425416,0.0014820937,0.00042997784,0.00047611416,0.00027174217,0.0003561913,0.27900937,0.00406958,0.041632768,0.013550088,0.6579396],"study_design_scores_gemma":[0.000014745127,0.000036755526,0.0001308244,0.000014943787,0.000022322967,0.00008028673,0.000016554126,0.97361124,0.0008949664,0.02352517,0.0016366929,0.00001546305],"about_ca_topic_score_codex":0.005673953,"about_ca_topic_score_gemma":0.00826175,"teacher_disagreement_score":0.007344623,"about_ca_system_score_codex":0.0010289821,"about_ca_system_score_gemma":0.00291678,"threshold_uncertainty_score":0.0388425},"labels":[],"label_agreement":null},{"id":"W2169189590","doi":"10.1007/11499053_15","title":"Examining Usage Patterns of the FIT Acceptance Testing Framework","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Acceptance testing; Executable; Computer science; Test (biology); Software; Observational study; Software engineering; Statistics; Programming language; Mathematics","score_opus":0.04884192614826906,"score_gpt":0.2762676015509501,"score_spread":0.22742567540268105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169189590","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.9571689,0.00028459812,0.035310507,0.00040698293,0.00001464049,0.00008315265,0.00016364102,0.0003553699,0.006212194],"genre_scores_gemma":[0.9844263,0.00006628926,0.014199536,0.000032110314,0.0000049585824,0.000050749164,0.00019529801,0.00011438399,0.0009102652],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98946756,0.00416688,0.00071697496,0.00063062034,0.0043732044,0.0006448188],"domain_scores_gemma":[0.8958449,0.078763716,0.007190953,0.0065411115,0.010745781,0.00091369794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007481523,0.00056071155,0.0003626687,0.004100862,0.00059737725,0.002204471,0.0014472152,0.0012588947,0.0015474778],"category_scores_gemma":[0.08651495,0.000503149,0.0007237845,0.0033857825,0.00072965876,0.0042305305,0.0014241284,0.0015484485,0.00047410573],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005340206,0.00069237413,0.5596518,0.0002467649,0.00019671221,0.000719009,0.011868562,0.0063271015,0.011128188,0.012923434,0.0019931982,0.39371875],"study_design_scores_gemma":[0.000084810825,0.0016899725,0.6864596,0.00046666022,0.00034057916,0.00492808,0.01056714,0.24363954,0.011293872,0.029924864,0.010405113,0.0001996653],"about_ca_topic_score_codex":0.004844846,"about_ca_topic_score_gemma":0.008241093,"teacher_disagreement_score":0.007481523,"about_ca_system_score_codex":0.0007053767,"about_ca_system_score_gemma":0.0008445768,"threshold_uncertainty_score":0.039566576},"labels":[],"label_agreement":null},{"id":"W2169227645","doi":"10.1007/978-3-642-40483-2_4","title":"A One-Handed Multi-touch Method for 3D Rotations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Rotation (mathematics); Computer science; Task (project management); Computer vision; Artificial intelligence; Mental rotation; Computer graphics (images); Engineering; Psychology","score_opus":0.03730520007264556,"score_gpt":0.31488969119762805,"score_spread":0.2775844911249825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169227645","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.007695631,0.0017771674,0.9791763,0.00008731926,0.00025324489,0.00012668688,0.000102393686,0.0036185079,0.0071628354],"genre_scores_gemma":[0.13175872,0.0016965463,0.8454447,0.00024771199,0.0001723112,0.00027808515,0.0002750423,0.0008867194,0.019240169],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990804,0.0001342987,0.000040164425,0.00016456158,0.00052356493,0.00005703151],"domain_scores_gemma":[0.99890566,0.0003899698,0.00008853881,0.00038129216,0.00016096467,0.00007346869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042914975,0.0009802119,0.000647377,0.0006185631,0.00044531666,0.0008242708,0.0015029751,0.0008104403,0.019094734],"category_scores_gemma":[0.0015549865,0.00047488912,0.000679195,0.00068282883,0.00057347014,0.0010972824,0.0016256387,0.0007368588,0.006765184],"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.0001860872,0.00005728804,0.00029415614,0.00046763942,0.000032811186,0.0002420708,0.00024605574,0.001647739,0.36632288,0.004748413,0.007795399,0.61795944],"study_design_scores_gemma":[0.0002007497,0.001555566,0.0064969626,0.0003218611,0.00015125285,0.014812439,0.00031469448,0.10326335,0.48887908,0.008400991,0.3750975,0.0005055383],"about_ca_topic_score_codex":0.0002486292,"about_ca_topic_score_gemma":0.0005056163,"teacher_disagreement_score":0.019094734,"about_ca_system_score_codex":0.00018956228,"about_ca_system_score_gemma":0.00028843508,"threshold_uncertainty_score":0.06387824},"labels":[],"label_agreement":null},{"id":"W2169279485","doi":"10.1007/978-3-642-04271-3_109","title":"Left Ventricle Segmentation via Graph Cut Distribution Matching","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":50,"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; St Joseph's Health Care; CARE Canada","funders":"","keywords":"Computer science; Cut; Bhattacharyya distance; Segmentation; Active contour model; Image segmentation; Artificial intelligence; Matching (statistics); Kernel density estimation; Algorithm; Pattern recognition (psychology); Mathematics","score_opus":0.008528817064882666,"score_gpt":0.27544496817248554,"score_spread":0.26691615110760286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169279485","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.024685152,0.00023148111,0.9720543,0.0001712855,0.00002602457,0.000053599415,0.00017539192,0.0017270459,0.0008756567],"genre_scores_gemma":[0.35870185,0.0003805617,0.6356484,0.0001786682,0.000096362295,0.00010280855,0.0007893442,0.0009395259,0.003162355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.00009026772,0.000026095566,0.00017695589,0.00018970913,0.000073502706],"domain_scores_gemma":[0.9992699,0.00028795755,0.00008013691,0.0001252353,0.0001847063,0.000052032814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059793284,0.0006074582,0.0013228619,0.0038268496,0.00052897254,0.0015206345,0.0012402016,0.0016451755,0.0026318205],"category_scores_gemma":[0.0018332037,0.0007281878,0.0008062553,0.0025198213,0.00053509156,0.001160612,0.0010748729,0.00094828696,0.0014328251],"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.0006928171,0.00027132878,0.0046836743,0.00019210519,0.00021595774,0.00048524368,0.00009822071,0.1094261,0.081832886,0.00791191,0.00617644,0.7880134],"study_design_scores_gemma":[0.000044183005,0.000046647685,0.0023664203,0.0000133166695,0.000048803722,0.0005628677,0.000029194494,0.960761,0.023883048,0.010513548,0.0017103665,0.000020616648],"about_ca_topic_score_codex":0.004354488,"about_ca_topic_score_gemma":0.006262687,"teacher_disagreement_score":0.004354488,"about_ca_system_score_codex":0.00067698135,"about_ca_system_score_gemma":0.0011502205,"threshold_uncertainty_score":0.008804321},"labels":[],"label_agreement":null},{"id":"W2169283658","doi":"10.1007/978-3-642-15294-8_7","title":"Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McGill University; Université de Montréal","funders":"","keywords":"Gene duplication; Genome; Computer science; Genetic algorithm; Subject (documents); Gene rearrangement; Biology; Evolutionary biology; Genetics; Gene","score_opus":0.009919362723931286,"score_gpt":0.22878160918426516,"score_spread":0.21886224646033386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169283658","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.36349872,0.0018434632,0.60826373,0.0006924121,0.00019229927,0.00007121964,0.0045713345,0.0033761049,0.017490711],"genre_scores_gemma":[0.7073473,0.0017446541,0.27350715,0.000121084115,0.000060024788,0.00007135847,0.008690534,0.0010139162,0.00744401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998827,0.000026069718,0.000006174975,0.000044515993,0.000024519935,0.000015898375],"domain_scores_gemma":[0.99974185,0.00010659899,0.000018087612,0.00007236812,0.000038985207,0.00002207998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031146305,0.00040627012,0.0005749398,0.0012449393,0.00046750717,0.0012726482,0.0010334374,0.0008448875,0.0063856514],"category_scores_gemma":[0.0013252009,0.00062744395,0.0010996321,0.0012731222,0.00052319415,0.0008809118,0.0005863908,0.0009802366,0.0015257101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023447226,0.00013483371,0.017946988,0.0013088718,0.00049685757,0.0027634688,0.0014371121,0.40135562,0.13570584,0.18715018,0.008945898,0.24040961],"study_design_scores_gemma":[0.00018751327,0.00028235358,0.01546324,0.00014702766,0.00037449275,0.0031980437,0.000644553,0.6853234,0.035539962,0.22678159,0.03195472,0.00010304574],"about_ca_topic_score_codex":0.0011671309,"about_ca_topic_score_gemma":0.0010520658,"teacher_disagreement_score":0.0063856514,"about_ca_system_score_codex":0.0005205944,"about_ca_system_score_gemma":0.0005240169,"threshold_uncertainty_score":0.021362126},"labels":[],"label_agreement":null},{"id":"W2169393467","doi":"10.1007/3-540-46029-2_9","title":"Software Performance Models from System Scenarios in Use Case Maps","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Notation; Unified Modeling Language; Sequence diagram; Software; Sequence (biology); Software engineering; Activity diagram; Resource (disambiguation); Programming language","score_opus":0.025109850589888592,"score_gpt":0.21507261937951594,"score_spread":0.18996276878962734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169393467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076618284,0.0005152181,0.8701745,0.00071931933,0.000054934568,0.00031286583,0.002046498,0.002643165,0.046915054],"genre_scores_gemma":[0.81981784,0.00076724845,0.16932721,0.000050046292,0.00003388398,0.0004517722,0.0023800742,0.00035667047,0.006815172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895406,0.00047008292,0.0000611232,0.00011008044,0.00031254112,0.00009211504],"domain_scores_gemma":[0.99369687,0.0050661303,0.00029384642,0.0003034576,0.00055406196,0.000085593405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013612983,0.00116867,0.00049662945,0.0020647654,0.00040949526,0.002590532,0.001564213,0.0012862019,0.0069223046],"category_scores_gemma":[0.010996159,0.0008352419,0.0009317491,0.0018700379,0.0007096146,0.0036044626,0.000977498,0.0012190134,0.0017778202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007433002,0.00007255763,0.0011858499,0.00012380927,0.000028185148,0.00020795697,0.00037104829,0.8896786,0.00058852375,0.0710078,0.0023643617,0.034296993],"study_design_scores_gemma":[0.000006396366,0.000014555612,0.00039115516,0.000025506606,0.000013443165,0.000060180668,0.00006831535,0.94973934,0.0003736373,0.046094332,0.0032004183,0.000012609333],"about_ca_topic_score_codex":0.005905865,"about_ca_topic_score_gemma":0.005771402,"teacher_disagreement_score":0.0069223046,"about_ca_system_score_codex":0.0014283912,"about_ca_system_score_gemma":0.0006076003,"threshold_uncertainty_score":0.023157418},"labels":[],"label_agreement":null},{"id":"W2169433752","doi":"10.1007/978-3-540-73101-6_6","title":"Using Horizontal Displays for Distributed and Collocated Agile Planning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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 Calgary","funders":"","keywords":"Agile software development; Computer science; Architecture; Software engineering; Work (physics); Engineering","score_opus":0.07226834250222114,"score_gpt":0.3122931949224977,"score_spread":0.24002485242027655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169433752","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05288979,0.0002764903,0.9155386,0.0002559403,0.000171526,0.00009957391,0.00014142807,0.00626861,0.024357986],"genre_scores_gemma":[0.5224045,0.00020699183,0.46719617,0.00007702603,0.00003460781,0.00019391971,0.00019214739,0.0007529495,0.00894163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989409,0.0005092059,0.000053753098,0.00012790532,0.00026905682,0.00009924902],"domain_scores_gemma":[0.9941223,0.003773622,0.0002536092,0.0010918697,0.00053629046,0.00022235501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012772469,0.00073233515,0.00035901324,0.00051504787,0.00066138693,0.0022406357,0.0008687766,0.000770052,0.019099794],"category_scores_gemma":[0.005967755,0.0006131384,0.00032921106,0.0009953158,0.00049210986,0.0025088976,0.0024581158,0.001170772,0.0020436621],"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.0019836735,0.00028842592,0.0023583332,0.00045402042,0.00006522157,0.00052516424,0.003913124,0.052790493,0.0526944,0.05781733,0.015119228,0.8119907],"study_design_scores_gemma":[0.00060304126,0.0020441054,0.007001685,0.00051521487,0.0001928342,0.0008490436,0.0040072775,0.7012492,0.0972397,0.074217804,0.11175917,0.00032102782],"about_ca_topic_score_codex":0.0018455865,"about_ca_topic_score_gemma":0.0028721457,"teacher_disagreement_score":0.019099794,"about_ca_system_score_codex":0.00038120578,"about_ca_system_score_gemma":0.0006685682,"threshold_uncertainty_score":0.063895226},"labels":[],"label_agreement":null},{"id":"W2169465650","doi":"10.1007/11880561_31","title":"A New Algorithm for Fast All-Against-All Substring Matching","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Victoria","funders":"","keywords":"Substring; Algorithm; Matching (statistics); Computer science; Graph; String searching algorithm; Mathematics; Theoretical computer science; Pattern matching; Data structure; Artificial intelligence; Statistics","score_opus":0.018427564062573225,"score_gpt":0.2523865924585631,"score_spread":0.23395902839598987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169465650","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.005411331,0.00070703746,0.9800544,0.00023243554,0.000490592,0.0002554164,0.000444604,0.008629891,0.0037741368],"genre_scores_gemma":[0.024492672,0.00032154197,0.96382517,0.00022084867,0.00017596009,0.00023645409,0.00163919,0.00077669736,0.008311406],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973157,0.00025434355,0.00028672453,0.0007064904,0.0011951174,0.00024158445],"domain_scores_gemma":[0.99749184,0.0006018998,0.00013388123,0.00095417025,0.0006888142,0.00012936018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013513512,0.0022147705,0.0028330914,0.00362113,0.0018741657,0.002697002,0.0045737927,0.002393701,0.01630316],"category_scores_gemma":[0.0046175276,0.0010987923,0.0015283615,0.0051540383,0.0010099823,0.0066491705,0.0048745526,0.0022707267,0.0103855105],"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.00052476383,0.00019383148,0.00038408788,0.00026059605,0.000089473935,0.00013592848,0.000103893384,0.007313495,0.025525017,0.012069834,0.025819354,0.9275797],"study_design_scores_gemma":[0.0006883081,0.0008797668,0.0015029177,0.0001309325,0.00037380712,0.0031237716,0.00034176267,0.5925707,0.110011145,0.13786644,0.15224847,0.0002619723],"about_ca_topic_score_codex":0.0017080861,"about_ca_topic_score_gemma":0.0034971102,"teacher_disagreement_score":0.01630316,"about_ca_system_score_codex":0.0010447014,"about_ca_system_score_gemma":0.002212202,"threshold_uncertainty_score":0.0545395},"labels":[],"label_agreement":null},{"id":"W2169494088","doi":"10.1007/978-3-642-13059-5_30","title":"Comparison of Feature Selection Methods for Sentiment Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Feature selection; Sentiment analysis; Selection (genetic algorithm); Computer science; Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Data mining; Machine learning; Linguistics; Philosophy","score_opus":0.03444674095231112,"score_gpt":0.3749346063561996,"score_spread":0.3404878654038884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169494088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46639588,0.02205351,0.48876813,0.0009848807,0.001542557,0.00085000956,0.0034948322,0.005176771,0.0107335225],"genre_scores_gemma":[0.67872196,0.0059153773,0.2957228,0.0002482777,0.0006245655,0.00074861816,0.009555387,0.0005802255,0.007882816],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982838,0.0005692094,0.000193289,0.00017513004,0.0006370364,0.00014148098],"domain_scores_gemma":[0.99271625,0.005313403,0.00016162173,0.00027248904,0.0014165393,0.00011966724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043629496,0.0012684719,0.0016103642,0.0029922654,0.0005272804,0.0012867068,0.000914761,0.0007181516,0.0037479387],"category_scores_gemma":[0.008107631,0.00023782658,0.0013325581,0.0027642776,0.00020614869,0.0017703141,0.0006964755,0.0006941662,0.001069888],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003273119,0.0004160903,0.00497748,0.00068358035,0.0008253715,0.00007424926,0.000121873505,0.009475791,0.010951768,0.0007816261,0.010919032,0.9574999],"study_design_scores_gemma":[0.001284494,0.0037794588,0.06389916,0.00018814932,0.0019004338,0.0005889117,0.00075757754,0.87640136,0.031078735,0.005573822,0.014359101,0.00018882232],"about_ca_topic_score_codex":0.0018083921,"about_ca_topic_score_gemma":0.0021213172,"teacher_disagreement_score":0.0043629496,"about_ca_system_score_codex":0.0004116134,"about_ca_system_score_gemma":0.00054360746,"threshold_uncertainty_score":0.023073792},"labels":[],"label_agreement":null},{"id":"W2169504979","doi":"10.1007/978-3-642-15705-9_80","title":"Biomarkers for Identifying First-Episode Schizophrenia Patients Using Diffusion Weighted Imaging","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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 Waterloo","funders":"National Center for Research Resources; National Institute of General Medical Sciences; National Institute of Mental Health","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Diffusion MRI; Classifier (UML); Support vector machine; Affine transformation; Feature selection; Population; Kernel (algebra); Magnetic resonance imaging; Mathematics; Medicine","score_opus":0.03512895276646575,"score_gpt":0.3378100518769688,"score_spread":0.302681099110503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169504979","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.98804736,0.0058184257,0.0020076316,0.00065320346,0.00017849503,0.00013976259,0.0017159848,0.00008776701,0.0013514602],"genre_scores_gemma":[0.9909033,0.0018749519,0.0047263536,0.00015999757,0.000110679306,0.0000959541,0.0013779735,0.00000968495,0.00074108737],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996562,0.0000710965,0.00007783525,0.000055656852,0.00008002116,0.000059289203],"domain_scores_gemma":[0.9978064,0.0006507823,0.00084214914,0.000069737725,0.00032086848,0.00031007276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008104275,0.001470175,0.0014948444,0.0026396334,0.0006522882,0.0016478044,0.0005341379,0.0014133562,0.001858074],"category_scores_gemma":[0.0038936888,0.000398526,0.00092180906,0.0010886327,0.0002694694,0.0010691895,0.0004449136,0.0010184422,0.0004584442],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016467646,0.00038132697,0.95668465,0.0001537581,0.00032941383,0.00043767784,0.00010647435,0.0005262216,0.012986753,0.00021695302,0.0009780037,0.025551908],"study_design_scores_gemma":[0.00034929896,0.0026612612,0.961465,0.00034655075,0.0013136453,0.002645176,0.0009414771,0.009218543,0.016086986,0.0020860727,0.0027780011,0.00010795235],"about_ca_topic_score_codex":0.0020467143,"about_ca_topic_score_gemma":0.0032984712,"teacher_disagreement_score":0.0026396334,"about_ca_system_score_codex":0.0005651515,"about_ca_system_score_gemma":0.0010581268,"threshold_uncertainty_score":0.00621593},"labels":[],"label_agreement":null},{"id":"W2169527116","doi":"10.1007/978-3-540-85093-9_13","title":"Theory of Quantum Key Distribution: The Road Ahead (Invited Talk)","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Communication source; Quantum key distribution; Key (lock); Computer science; Qubit; Protocol (science); Channel (broadcasting); Implementation; Quantum channel; Theoretical computer science; Quantum cryptography; Quantum; Computer network; Computer security; Quantum information; Physics; Quantum mechanics","score_opus":0.015469994155966008,"score_gpt":0.22596566036866084,"score_spread":0.21049566621269483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169527116","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101786,0.3148088,0.22713494,0.1884029,0.036477946,0.000070348804,0.00052415585,0.00078769156,0.2216145],"genre_scores_gemma":[0.3793367,0.23734549,0.082388684,0.030490326,0.10748193,0.00030268444,0.00096420414,0.00065058644,0.16103943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00031397972,0.000020356356,0.00010782333,0.00022462285,0.00010432771],"domain_scores_gemma":[0.9991239,0.00049840024,0.000041178962,0.00010922422,0.00013190194,0.00009542473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015869334,0.00071099726,0.0013842356,0.00086214225,0.0012195574,0.0047699246,0.0014010445,0.0033375209,0.010972119],"category_scores_gemma":[0.0023758984,0.00072323915,0.0007417108,0.0015638139,0.0042057014,0.009175156,0.002066646,0.0057573877,0.0034580496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015248587,0.000018113224,0.000041767526,0.000105212544,0.000013051531,0.000017222304,0.00005764364,0.000667307,0.0002197436,0.91495126,0.06551591,0.018377464],"study_design_scores_gemma":[0.000007891561,0.0000079417,0.00006243539,0.000047059813,0.0000039598244,0.000038339313,0.000023576416,0.0019269965,0.00010078826,0.948758,0.049013697,0.000009427611],"about_ca_topic_score_codex":0.000905541,"about_ca_topic_score_gemma":0.0008011623,"teacher_disagreement_score":0.010972119,"about_ca_system_score_codex":0.0031107112,"about_ca_system_score_gemma":0.0011389891,"threshold_uncertainty_score":0.036705375},"labels":[],"label_agreement":null},{"id":"W2169801072","doi":"10.1007/3-540-45551-5_29","title":"Indirect RSVP for Virtual Cluster Cellular Mobile IP Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Datagram; Computer science; User Datagram Protocol; Resource Reservation Protocol; Network packet; Cellular network; Internet protocol suite; Operating system; The Internet","score_opus":0.00867380918393256,"score_gpt":0.21161498421916058,"score_spread":0.20294117503522802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169801072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049012866,0.0043403534,0.8507196,0.00041378135,0.0006232841,0.0001257151,0.00021967066,0.0028770014,0.09166783],"genre_scores_gemma":[0.75772715,0.0021550234,0.17373529,0.00010863257,0.0003309603,0.00018384245,0.00047417026,0.00034091814,0.06494396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983776,0.000032027936,0.0000057444836,0.000018251232,0.000076391414,0.000029806835],"domain_scores_gemma":[0.9998388,0.000054520086,0.0000063982316,0.000045921985,0.0000430282,0.000011286298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019873277,0.00029655476,0.00024925295,0.0002484645,0.00043694023,0.0007759676,0.0008478775,0.00031789404,0.005200132],"category_scores_gemma":[0.0006694726,0.00020853821,0.00013441245,0.00034174486,0.00029729304,0.00078662747,0.0005269206,0.0007508197,0.00092065084],"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.00032683343,0.00010395266,0.000346611,0.0003064487,0.00003041557,0.0002161025,0.00022027188,0.06938378,0.03955753,0.27569234,0.029664902,0.58415085],"study_design_scores_gemma":[0.000047783666,0.00024030815,0.00081577507,0.00005908502,0.00005952226,0.0005487295,0.00008742699,0.6439244,0.027369,0.17833818,0.1484643,0.000045461282],"about_ca_topic_score_codex":0.0008915858,"about_ca_topic_score_gemma":0.0018699255,"teacher_disagreement_score":0.005200132,"about_ca_system_score_codex":0.00053872913,"about_ca_system_score_gemma":0.00040441228,"threshold_uncertainty_score":0.017396152},"labels":[],"label_agreement":null},{"id":"W2169829403","doi":"10.1007/978-3-642-03367-4_34","title":"The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Cograph; Interval graph; Indifference graph; Bipartite graph; Pathwidth; Discrete mathematics; Vertex (graph theory); Comparability graph; Comparability; Graph; Line graph; 1-planar graph","score_opus":0.024769139751420123,"score_gpt":0.3134125907609353,"score_spread":0.28864345100951516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169829403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21771424,0.0015264829,0.6736903,0.005441872,0.00062381575,0.00044530435,0.002053736,0.0012522226,0.09725193],"genre_scores_gemma":[0.7786995,0.00175281,0.18319482,0.00049316895,0.00069480744,0.00044641248,0.003935166,0.00056837284,0.030214978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975725,0.0006685231,0.00016915602,0.0007177867,0.0005133723,0.0003587144],"domain_scores_gemma":[0.9901626,0.0067976005,0.00058123196,0.0016101063,0.00046976723,0.00037873784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018232882,0.0013024253,0.0015636313,0.0010829804,0.0021166056,0.0067079384,0.003856129,0.003998394,0.021543093],"category_scores_gemma":[0.015040397,0.0011309395,0.002075095,0.0045187087,0.0024512853,0.01773535,0.0038281241,0.004799941,0.0019181424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040549744,0.0002616002,0.00056846207,0.0006753623,0.000080264195,0.00027646738,0.00073513406,0.028483333,0.0027069864,0.81396115,0.016192708,0.13565315],"study_design_scores_gemma":[0.00006554411,0.00004874812,0.00014867897,0.00003855875,0.00003357427,0.00017338229,0.0003150711,0.029101571,0.0010982469,0.96377444,0.0051838956,0.0000183385],"about_ca_topic_score_codex":0.0014403653,"about_ca_topic_score_gemma":0.0012500029,"teacher_disagreement_score":0.021543093,"about_ca_system_score_codex":0.0015339741,"about_ca_system_score_gemma":0.0017985769,"threshold_uncertainty_score":0.07206881},"labels":[],"label_agreement":null},{"id":"W2169890399","doi":"10.1007/978-3-642-25020-0_32","title":"Comparative Evaluation of Feature Normalization Techniques for Speaker Verification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Normalization (sociology); NIST; Computer science; Speaker verification; Linear discriminant analysis; Speech recognition; Pattern recognition (psychology); Artificial intelligence; Probabilistic logic; Feature vector; Feature (linguistics); Speaker recognition","score_opus":0.07976696728653544,"score_gpt":0.3120268597436664,"score_spread":0.23225989245713097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169890399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28325835,0.026015641,0.6717182,0.000305811,0.000717915,0.00041128066,0.0011519644,0.007895978,0.008524912],"genre_scores_gemma":[0.57609683,0.008826321,0.3996212,0.00015130131,0.00029732636,0.000257236,0.005392863,0.0010440777,0.008312884],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958845,0.001269158,0.0003062223,0.00059658766,0.001691921,0.00025159723],"domain_scores_gemma":[0.9899002,0.006992546,0.0002481986,0.00070417626,0.0020505171,0.00010452726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048416657,0.0014211636,0.0014380176,0.0019615802,0.0006122651,0.0012289609,0.0017243811,0.0011722355,0.0053603486],"category_scores_gemma":[0.011643476,0.00043920797,0.0010581914,0.0016304556,0.0005112167,0.001971205,0.0012906546,0.00071593485,0.0021012852],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00396914,0.00021568923,0.0015408596,0.0007428087,0.00044229807,0.00010490752,0.00013565677,0.008634699,0.09307662,0.00061684835,0.0016537019,0.88886684],"study_design_scores_gemma":[0.0005134107,0.004616369,0.033954535,0.0002260741,0.0024473467,0.0032452128,0.00051713403,0.39244848,0.5475624,0.0020642756,0.012151475,0.00025324748],"about_ca_topic_score_codex":0.0028553728,"about_ca_topic_score_gemma":0.0037420772,"teacher_disagreement_score":0.0053603486,"about_ca_system_score_codex":0.0005157256,"about_ca_system_score_gemma":0.0005512168,"threshold_uncertainty_score":0.0256055},"labels":[],"label_agreement":null},{"id":"W2169924623","doi":"10.1007/978-3-540-73053-8_31","title":"Requirements for Machine Lifelong Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Lifelong learning; Artificial intelligence; Human–computer interaction; Pedagogy; Sociology","score_opus":0.04658765491235223,"score_gpt":0.30104778339089955,"score_spread":0.2544601284785473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169924623","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.009123402,0.0013276667,0.9622519,0.006590384,0.00044266597,0.0002596326,0.0008293997,0.0014931466,0.017681904],"genre_scores_gemma":[0.30276734,0.0026773615,0.6513455,0.0022705954,0.0016297136,0.0017916047,0.0052805482,0.0017963438,0.030441012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928807,0.0017867989,0.00084233383,0.0008223305,0.003261252,0.000406406],"domain_scores_gemma":[0.9354757,0.03937808,0.0012875767,0.0109223295,0.011369547,0.0015667379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072095967,0.0006740409,0.0013503651,0.00072501163,0.000931976,0.0026593315,0.0027850857,0.0026305579,0.015168506],"category_scores_gemma":[0.07072047,0.0008253645,0.0008795203,0.00085347827,0.0015519956,0.010532206,0.005025249,0.0054008365,0.011466208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042017686,0.00040744012,0.0019362182,0.001005112,0.000052979645,0.0003709788,0.00048787432,0.022965262,0.012663561,0.67402506,0.03174338,0.25392196],"study_design_scores_gemma":[0.000044549102,0.00013869537,0.0006810198,0.00013723687,0.000021779686,0.00047841846,0.0001678699,0.17320417,0.008488934,0.76792276,0.04867977,0.00003483585],"about_ca_topic_score_codex":0.0011170151,"about_ca_topic_score_gemma":0.0010670796,"teacher_disagreement_score":0.015168506,"about_ca_system_score_codex":0.00092552556,"about_ca_system_score_gemma":0.0015571143,"threshold_uncertainty_score":0.05074376},"labels":[],"label_agreement":null},{"id":"W2170134580","doi":"10.1007/978-3-642-21323-6_12","title":"Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RFID technology advancements","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Computer security; Cryptographic protocol; Security analysis; Architecture; Cryptography","score_opus":0.03669319887491355,"score_gpt":0.28739301647097604,"score_spread":0.25069981759606247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170134580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40295997,0.009799793,0.5560795,0.002297015,0.00042694778,0.000522013,0.0006957754,0.0013089958,0.025909955],"genre_scores_gemma":[0.8889334,0.0033497415,0.09976129,0.00030015007,0.00066588726,0.0004158909,0.0008903102,0.00025819583,0.0054251114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99427646,0.0013487492,0.00040482005,0.0005956085,0.002632754,0.00074165827],"domain_scores_gemma":[0.9843152,0.009600337,0.0014464859,0.0029141563,0.0013921602,0.0003317175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042300927,0.0011117586,0.0010624536,0.0031584215,0.0016999559,0.0032708894,0.0024923116,0.0015842001,0.003466682],"category_scores_gemma":[0.012456784,0.00056730997,0.002242928,0.0029229228,0.0022535052,0.006720863,0.0025983157,0.0031027808,0.00057576626],"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.0033986284,0.0009329345,0.0064823306,0.0012446531,0.0003705283,0.00068817503,0.00083693967,0.19603838,0.04251281,0.53812164,0.008656991,0.20071605],"study_design_scores_gemma":[0.00016057494,0.00065151794,0.0027946446,0.0001006071,0.0003756035,0.0010226237,0.00025539275,0.7060439,0.018747086,0.26385716,0.0058555305,0.00013538565],"about_ca_topic_score_codex":0.00053452724,"about_ca_topic_score_gemma":0.00061566813,"teacher_disagreement_score":0.0042300927,"about_ca_system_score_codex":0.0028904632,"about_ca_system_score_gemma":0.0023881975,"threshold_uncertainty_score":0.022371173},"labels":[],"label_agreement":null},{"id":"W2170185828","doi":"10.1007/978-3-540-30475-3_25","title":"Applying Semantic Web Services to Bioinformatics: Experiences Gained, Lessons Learnt","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Paul's Hospital; University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Genome Prairie; National Research Council Canada; Genome Canada; National Science Foundation","keywords":"Computer science; Social Semantic Web; Semantic Web; World Wide Web; Semantic Web Stack; Web service; Interoperability; Semantic grid; Web standards; Data Web; Semantic analytics","score_opus":0.06471890325720234,"score_gpt":0.3402472191199058,"score_spread":0.27552831586270343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170185828","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39497975,0.03542354,0.33472067,0.043548968,0.0017665139,0.0005138067,0.00048016585,0.002201598,0.18636501],"genre_scores_gemma":[0.4304274,0.07309033,0.423141,0.004829669,0.00063596474,0.00016396359,0.001317166,0.0008747627,0.06551974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996702,0.0018071543,0.00010706785,0.00020129725,0.0008734011,0.0003090014],"domain_scores_gemma":[0.99722445,0.0017733327,0.00003771441,0.0002529194,0.00041531323,0.00029633046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008521252,0.00086623227,0.0004392586,0.0006085609,0.0008523263,0.0046760645,0.0018827127,0.0018875943,0.0036243706],"category_scores_gemma":[0.0056008454,0.00032428495,0.0008602914,0.001683247,0.0019796037,0.0052222405,0.0025253082,0.001865053,0.0012893314],"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.00035536147,0.0015307013,0.004974239,0.0015342695,0.00011543821,0.0013579088,0.009983892,0.007556514,0.017829059,0.038829267,0.02673771,0.88919556],"study_design_scores_gemma":[0.00032397665,0.0019812845,0.006188158,0.0025857189,0.00022861832,0.0053107794,0.033355266,0.0385166,0.059968278,0.12398905,0.7273362,0.00021607282],"about_ca_topic_score_codex":0.0035563633,"about_ca_topic_score_gemma":0.0037604533,"teacher_disagreement_score":0.008521252,"about_ca_system_score_codex":0.00092354266,"about_ca_system_score_gemma":0.0017557399,"threshold_uncertainty_score":0.045065284},"labels":[],"label_agreement":null},{"id":"W2170271350","doi":"10.1007/978-3-540-85238-4_21","title":"On a Special Class of Primitive Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Complement (music); Word (group theory); Complementarity (molecular biology); Mathematics; Combinatorics; Class (philosophy); Sequence (biology); Combinatorics on words; Discrete mathematics; Computer science; Biology; Artificial intelligence; Genetics","score_opus":0.013332276532949107,"score_gpt":0.2273662514768892,"score_spread":0.21403397494394008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170271350","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.26065555,0.004410755,0.26447254,0.0026745542,0.0017163954,0.00012717793,0.000635903,0.0007569712,0.4645501],"genre_scores_gemma":[0.8494706,0.0025579866,0.043824162,0.0006598157,0.0017859814,0.00021463777,0.0007569565,0.00035203327,0.10037786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958414,0.000071142116,0.000023778139,0.000113675014,0.00010920589,0.000098064855],"domain_scores_gemma":[0.9990677,0.0004891304,0.00006197994,0.00017334182,0.00010332301,0.00010452618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040774353,0.0006198768,0.00092925964,0.0012826675,0.0021285028,0.0025674785,0.0008904863,0.001281928,0.008441934],"category_scores_gemma":[0.00173937,0.0004920501,0.0009959836,0.0014815002,0.003000221,0.006004313,0.0019653076,0.0023020608,0.0014181776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015243068,0.00000465845,0.000061134015,0.000028219585,0.0000025715074,0.000068404785,0.00014049732,0.00011424323,0.0005321974,0.9917139,0.001222745,0.00609621],"study_design_scores_gemma":[0.000006238534,0.000009257577,0.00009608559,0.0000115811235,0.0000049771666,0.00021363515,0.00004388907,0.0008440877,0.00036366115,0.9904847,0.007916558,0.000005464904],"about_ca_topic_score_codex":0.00038545276,"about_ca_topic_score_gemma":0.00034422695,"teacher_disagreement_score":0.008441934,"about_ca_system_score_codex":0.0007165246,"about_ca_system_score_gemma":0.00048448783,"threshold_uncertainty_score":0.028241038},"labels":[],"label_agreement":null},{"id":"W2170324793","doi":"10.1007/3-540-44444-0_7","title":"Architecture for a Grid Operating System","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Distributed computing; Scalability; Grid; Architecture; Scheduling (production processes); Computer network; Grid computing; Operating system; Engineering","score_opus":0.01507700877981644,"score_gpt":0.23597654251534628,"score_spread":0.22089953373552984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170324793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033702113,0.0008503028,0.82054025,0.0027511558,0.0010002428,0.0005210433,0.0006894748,0.06892626,0.071019046],"genre_scores_gemma":[0.2918401,0.0011160512,0.60184443,0.0012636072,0.0004703575,0.0007716853,0.002943509,0.007559773,0.092190556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996001,0.000076421275,0.000041372776,0.000057433077,0.0001502324,0.000074408534],"domain_scores_gemma":[0.9994479,0.00004758974,0.000017699,0.0002111078,0.00016444479,0.000111228386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000666065,0.0004698217,0.00047196573,0.0006079733,0.0010720595,0.0020611717,0.001801882,0.0010628287,0.014005741],"category_scores_gemma":[0.0010137057,0.0006291823,0.00048248397,0.0007981848,0.00064359786,0.002302819,0.0019079936,0.0021588483,0.007451881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011845878,0.000430481,0.0040022456,0.0005746722,0.00015198642,0.00081463036,0.001236291,0.021825327,0.06663859,0.3122758,0.22034267,0.3705227],"study_design_scores_gemma":[0.00034470207,0.00045091248,0.0028509935,0.00013667696,0.00016673535,0.0007659585,0.00031230965,0.21260615,0.035856094,0.12932758,0.6170381,0.00014378763],"about_ca_topic_score_codex":0.0029040815,"about_ca_topic_score_gemma":0.0021682675,"teacher_disagreement_score":0.014005741,"about_ca_system_score_codex":0.00069523905,"about_ca_system_score_gemma":0.0011667747,"threshold_uncertainty_score":0.0468539},"labels":[],"label_agreement":null},{"id":"W2170337736","doi":"10.1007/978-3-540-87700-4_1","title":"On the Behaviour of the (1+1)-ES for a Simple Constrained Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Constraint (computer-aided design); Computer science; Markov chain; Simple (philosophy); Mathematical optimization; Limit (mathematics); Applied mathematics; Algorithm; Mathematics; Geometry; Mathematical analysis","score_opus":0.03279748623791293,"score_gpt":0.27825102728650414,"score_spread":0.2454535410485912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170337736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21578427,0.009307976,0.6406187,0.0042236433,0.00071920117,0.00014700857,0.0003535017,0.0005944803,0.12825127],"genre_scores_gemma":[0.784474,0.0026654922,0.18129736,0.0008356213,0.0003625966,0.00015266259,0.00030676625,0.0004392108,0.029466368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.00039133072,0.000028541832,0.00008989411,0.00013010991,0.00007390617],"domain_scores_gemma":[0.9911187,0.008061246,0.00022440973,0.00022846511,0.00022404792,0.00014314581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026734676,0.0010699583,0.0011326672,0.0007283995,0.0008045833,0.0018008858,0.001665859,0.0027829953,0.008197302],"category_scores_gemma":[0.018008944,0.00047654656,0.0009865528,0.0012151414,0.0023339142,0.0026437568,0.0016496708,0.0024652444,0.0006481811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002473997,0.0000777548,0.00070456375,0.00043339204,0.000061704166,0.00016929781,0.00023419088,0.59820116,0.003075269,0.3478541,0.0060287444,0.04291242],"study_design_scores_gemma":[0.000029107683,0.00004261404,0.00022942154,0.000037068025,0.000012660083,0.00007052552,0.000030120435,0.8570267,0.00034945144,0.1412049,0.0009518173,0.000015657957],"about_ca_topic_score_codex":0.0030448851,"about_ca_topic_score_gemma":0.0022773945,"teacher_disagreement_score":0.008197302,"about_ca_system_score_codex":0.0009857025,"about_ca_system_score_gemma":0.0006527493,"threshold_uncertainty_score":0.027422726},"labels":[],"label_agreement":null},{"id":"W2170479010","doi":"10.1007/978-3-540-68825-9_23","title":"Mathematically Clinching a Playoff Spot in the NHL and the Effect of Scoring Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; League; Solver; Heuristic; Operations research; Constraint (computer-aided design); Hot spot (computer programming); Artificial intelligence; Newspaper; Machine learning; Simulation; Mathematics; Programming language","score_opus":0.0106162438047289,"score_gpt":0.2299818879855886,"score_spread":0.21936564418085971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170479010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20305124,0.0013949752,0.51688135,0.006493093,0.00071518734,0.00014402163,0.000285485,0.00086533837,0.27016932],"genre_scores_gemma":[0.87375253,0.00053523615,0.054701813,0.0004789033,0.00020254123,0.0001354712,0.0001353289,0.00034397186,0.06971419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773717,0.0013621271,0.00006576789,0.00021061345,0.00035049106,0.00027378422],"domain_scores_gemma":[0.98987216,0.0077360785,0.00045493676,0.0007704012,0.00070204516,0.0004645509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032770203,0.00078210206,0.0012014294,0.00085836224,0.0019927903,0.0047886996,0.0023596876,0.0023313432,0.042504337],"category_scores_gemma":[0.028506914,0.00081754633,0.0007596257,0.0012067518,0.0052179173,0.009671368,0.0035129169,0.0036435402,0.002543804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019163202,0.00008505784,0.00043001527,0.00008305857,0.000014428254,0.000082014296,0.0003159508,0.02558233,0.0010821888,0.9463451,0.005305452,0.02048282],"study_design_scores_gemma":[0.000066451794,0.00010194792,0.00035776728,0.000040595223,0.000016485554,0.000058253656,0.0002954936,0.10699731,0.0007050898,0.8881472,0.003180531,0.00003295855],"about_ca_topic_score_codex":0.0043028696,"about_ca_topic_score_gemma":0.0047745854,"teacher_disagreement_score":0.042504337,"about_ca_system_score_codex":0.0017091394,"about_ca_system_score_gemma":0.001702524,"threshold_uncertainty_score":0.14219117},"labels":[],"label_agreement":null},{"id":"W2170505565","doi":"10.1007/3-540-48017-x_31","title":"On P Systems with Global Rules","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Rewriting; Membrane computing; Universality (dynamical systems); Computer science; P system; String (physics); Theoretical computer science; Turing machine; Algorithm; Programming language; Mathematics","score_opus":0.013085861484728532,"score_gpt":0.22715342041083375,"score_spread":0.2140675589261052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170505565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079669274,0.0035267873,0.67317915,0.005544046,0.0009740037,0.00014947055,0.00049637083,0.00072060066,0.2357404],"genre_scores_gemma":[0.84956104,0.002815321,0.085283145,0.0010383938,0.00081659836,0.00033458968,0.00059863896,0.0003301354,0.05922219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992428,0.0002441545,0.000052436295,0.00016637414,0.00019135288,0.00010297208],"domain_scores_gemma":[0.9980762,0.0012278376,0.00008550211,0.00034770323,0.00015735262,0.000105268955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095345406,0.0008828368,0.0010774055,0.00087765773,0.001464513,0.0027143257,0.0011445977,0.0014711398,0.011132596],"category_scores_gemma":[0.004927656,0.0006080455,0.000954618,0.0013168355,0.0036270719,0.0064115776,0.0035773457,0.002860016,0.0011935123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018561737,0.0000067609612,0.00010528042,0.00003533161,0.00000831963,0.00009721241,0.0000984393,0.00447996,0.0002101565,0.9841351,0.0018040357,0.009000768],"study_design_scores_gemma":[0.0000053998842,0.0000031624534,0.000020292937,0.000004136549,0.0000024987878,0.00002860314,0.000010105548,0.005284466,0.000055018965,0.9933297,0.0012540831,0.0000023335042],"about_ca_topic_score_codex":0.0010178636,"about_ca_topic_score_gemma":0.00084624346,"teacher_disagreement_score":0.011132596,"about_ca_system_score_codex":0.0007021995,"about_ca_system_score_gemma":0.0005381507,"threshold_uncertainty_score":0.037242234},"labels":[],"label_agreement":null},{"id":"W2170513277","doi":"10.1007/978-3-540-30560-6_14","title":"Simultaneous Localization and Surveying with Multiple Agents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Inference; Robot; Mobile robot; Belief propagation; Hidden Markov model; Robotics; Machine learning; Theoretical computer science; Algorithm","score_opus":0.0173696781247954,"score_gpt":0.26483388577992867,"score_spread":0.24746420765513327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170513277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023349227,0.00018184118,0.9739991,0.00010249707,0.00004351853,0.000032641743,0.000027853315,0.00063413323,0.0016291722],"genre_scores_gemma":[0.5237715,0.00026405626,0.4691905,0.00008159255,0.00006649788,0.000146847,0.00012483096,0.00013225366,0.0062219277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991716,0.00020382415,0.000040298088,0.0002323101,0.00024760078,0.000104332685],"domain_scores_gemma":[0.99866486,0.00059721776,0.00014531691,0.00032085893,0.00018632476,0.00008535322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075870403,0.0011443768,0.0020026136,0.0010583038,0.00090843905,0.0011924914,0.0015717489,0.0016771731,0.0018409367],"category_scores_gemma":[0.003020813,0.0015112617,0.0009938239,0.001853653,0.0011039018,0.0026007933,0.004049729,0.0010424942,0.0007655391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006241567,0.00013413474,0.0030672858,0.00023959354,0.00024555725,0.00047366312,0.00056775805,0.5610553,0.06627552,0.01520661,0.0024839304,0.34962642],"study_design_scores_gemma":[0.000033969907,0.00009801249,0.00054923457,0.000007221934,0.000031899755,0.00013695331,0.00009121152,0.9818718,0.0075353244,0.007624457,0.0019954876,0.00002439233],"about_ca_topic_score_codex":0.0047692386,"about_ca_topic_score_gemma":0.006286574,"teacher_disagreement_score":0.0047692386,"about_ca_system_score_codex":0.00053186517,"about_ca_system_score_gemma":0.000813784,"threshold_uncertainty_score":0.00948298},"labels":[],"label_agreement":null},{"id":"W2170543182","doi":"10.1007/978-3-540-79549-0_80","title":"On the Probability of Finding Non-interfering Paths in Wireless Multihop Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Multipath routing; Computer network; Multipath propagation; Wireless network; Distributed computing; Wireless; Topology (electrical circuits); Routing (electronic design automation); Routing protocol; Dynamic Source Routing; Algorithm; Telecommunications; Mathematics","score_opus":0.019200683630686385,"score_gpt":0.23003433965046563,"score_spread":0.21083365601977924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170543182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07778084,0.017421754,0.8750336,0.005722801,0.0011867469,0.00024920158,0.0007402339,0.00071974954,0.021145072],"genre_scores_gemma":[0.8707906,0.022266706,0.08434181,0.0009906379,0.0044209547,0.00079251477,0.0009277595,0.0006635041,0.014805605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906317,0.0033543953,0.000505946,0.0012409221,0.0033312268,0.0009357833],"domain_scores_gemma":[0.75717,0.22814988,0.0044471244,0.0039534406,0.004371713,0.0019077729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01513807,0.0026739812,0.0052005537,0.004675463,0.002204385,0.0053761825,0.008588838,0.0053326,0.006580211],"category_scores_gemma":[0.097836964,0.0029378638,0.0017632607,0.0070998906,0.009328494,0.011325184,0.0050684744,0.006301996,0.0009258986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012313891,0.00021156986,0.0060693324,0.0015488033,0.0003025957,0.00058216765,0.0008736909,0.5839585,0.0030172851,0.34175116,0.0080238255,0.05242974],"study_design_scores_gemma":[0.00010342078,0.0002361082,0.0021089863,0.00026483356,0.000191819,0.0010606823,0.0002615291,0.7440232,0.0013738717,0.24792306,0.0023146463,0.00013786565],"about_ca_topic_score_codex":0.0017337566,"about_ca_topic_score_gemma":0.001295388,"teacher_disagreement_score":0.01513807,"about_ca_system_score_codex":0.0035436063,"about_ca_system_score_gemma":0.0016724151,"threshold_uncertainty_score":0.08005875},"labels":[],"label_agreement":null},{"id":"W2170568320","doi":"10.1007/11562436_29","title":"Submodule Construction for Extended State Machine Models","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Ottawa","funders":"","keywords":"Parameterized complexity; Finite-state machine; Computer science; Automaton; State (computer science); Simple (philosophy); Variable (mathematics); Context (archaeology); Theoretical computer science; State variable; Algorithm; Mathematics","score_opus":0.028443257186956908,"score_gpt":0.27774211977457613,"score_spread":0.24929886258761924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170568320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006891907,0.00005226365,0.9877538,0.00007964225,0.000039878185,0.0000622919,0.00009846048,0.0009014753,0.00412029],"genre_scores_gemma":[0.2489666,0.000277641,0.7329664,0.00016554899,0.00006362755,0.0006159532,0.0011542891,0.00079125486,0.014998646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999008,0.0002766766,0.000088903435,0.00020419678,0.00030308755,0.00011909342],"domain_scores_gemma":[0.998665,0.00053924735,0.000044904016,0.000558892,0.00014026492,0.00005174812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147251,0.0005801592,0.00092422304,0.00066365814,0.0007301282,0.001283762,0.0019524142,0.0009556887,0.0073428713],"category_scores_gemma":[0.0027085943,0.0007346954,0.0021301645,0.00072244246,0.0014105003,0.0041516162,0.0043379413,0.0030323782,0.001744482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008729724,0.00007620186,0.00028242392,0.00025237945,0.00004427085,0.00022700628,0.0003870861,0.024369782,0.007963353,0.8784913,0.0028571612,0.08496165],"study_design_scores_gemma":[0.000023577617,0.000058075242,0.000085773594,0.000048934577,0.000032838212,0.00012385391,0.000048021797,0.09782608,0.010164634,0.8791903,0.012371698,0.000026131465],"about_ca_topic_score_codex":0.00045228977,"about_ca_topic_score_gemma":0.0006751048,"teacher_disagreement_score":0.0073428713,"about_ca_system_score_codex":0.00059611455,"about_ca_system_score_gemma":0.00089675473,"threshold_uncertainty_score":0.024564385},"labels":[],"label_agreement":null},{"id":"W2170631384","doi":"10.1007/978-3-642-17461-2_5","title":"Time Optimal Algorithms for Black Hole Search in Rings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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; Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Computer science; Focus (optics); Black hole (networking); Ring (chemistry); Algorithm; Upper and lower bounds; Search problem; Ring network; Asymptotically optimal algorithm; Time complexity; Mathematics; Physics; Routing (electronic design automation); Network topology; Computer network","score_opus":0.02585653393387138,"score_gpt":0.28064994063781584,"score_spread":0.25479340670394446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170631384","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.04464845,0.0020706854,0.91604644,0.0010774682,0.0002854492,0.00024591095,0.00044581623,0.002253914,0.032925848],"genre_scores_gemma":[0.29287606,0.0011786622,0.68529546,0.00036829416,0.00024897847,0.00043354314,0.00077941973,0.0008172908,0.018002344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854386,0.00045060305,0.00007974724,0.00027595717,0.00036181914,0.0002879979],"domain_scores_gemma":[0.99642533,0.0024554124,0.00016675114,0.0005993422,0.0001785263,0.00017459044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018090095,0.001574682,0.0018249864,0.0012117173,0.001293267,0.0028950365,0.0031591181,0.0020815728,0.012409109],"category_scores_gemma":[0.0086091235,0.000829407,0.0013179384,0.002199504,0.0021239188,0.006271385,0.0026733023,0.0030112178,0.002085348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010013068,0.000333743,0.00052828353,0.00064027467,0.00012271281,0.00006662782,0.00046048322,0.21932182,0.0037411074,0.55320185,0.027049063,0.19353268],"study_design_scores_gemma":[0.00025221953,0.00007952343,0.00013866196,0.000046713045,0.000047517948,0.00004949121,0.000101395315,0.41111422,0.0013569092,0.58221555,0.0045743287,0.000023362034],"about_ca_topic_score_codex":0.002245314,"about_ca_topic_score_gemma":0.0033876994,"teacher_disagreement_score":0.012409109,"about_ca_system_score_codex":0.0021278365,"about_ca_system_score_gemma":0.002087127,"threshold_uncertainty_score":0.041512668},"labels":[],"label_agreement":null},{"id":"W2170870849","doi":"10.1007/978-3-642-45249-9_24","title":"Impairment-Aware Dynamic Routing and Wavelength Assignment in Translucent Optical WDM Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","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 Windsor","funders":"","keywords":"Routing and wavelength assignment; Computer science; Wavelength-division multiplexing; Routing (electronic design automation); Computer network; Transmission (telecommunications); SIGNAL (programming language); Physical layer; Telecommunications; Wavelength; Optics; Wireless; Physics","score_opus":0.0060000006839045035,"score_gpt":0.20864029822055183,"score_spread":0.20264029753664733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170870849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09780054,0.0017483331,0.8905839,0.00022959422,0.00014547429,0.000040934494,0.00007508111,0.001007514,0.008368702],"genre_scores_gemma":[0.890719,0.0012766656,0.097578995,0.000073231226,0.0001282311,0.000035976558,0.00013757987,0.00018895221,0.009861339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971336,0.000058596277,0.000011388238,0.00006021649,0.00010185153,0.000054500353],"domain_scores_gemma":[0.9995982,0.00015215501,0.000071202776,0.00008199822,0.000071399154,0.000024973486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042453158,0.0007443513,0.00057025126,0.00040731873,0.00035971895,0.0009097904,0.0017041034,0.00038805557,0.0012651164],"category_scores_gemma":[0.0009908864,0.00028560017,0.0003104009,0.00051805924,0.0005043143,0.0011608684,0.0010371524,0.000827904,0.00033058863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018394136,0.00009959164,0.0005241893,0.0001425423,0.000029796423,0.00019818105,0.00011316907,0.7175987,0.05380255,0.015291299,0.0021595897,0.20985644],"study_design_scores_gemma":[0.0000025514285,0.0000445105,0.00019880063,0.000008257032,0.000008841538,0.00009096523,0.000017470837,0.98575497,0.005884437,0.0067611067,0.0012179118,0.000010169135],"about_ca_topic_score_codex":0.0011302588,"about_ca_topic_score_gemma":0.0017977366,"teacher_disagreement_score":0.0017041034,"about_ca_system_score_codex":0.0008672948,"about_ca_system_score_gemma":0.0003661748,"threshold_uncertainty_score":0.006292701},"labels":[],"label_agreement":null},{"id":"W2171033649","doi":"10.1007/978-3-540-30134-9_94","title":"Stochastic Local Search for Incremental SAT and Incremental MAX-SAT","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Boolean satisfiability problem; Maximum satisfiability problem; Satisfiability; Conjunctive normal form; Set (abstract data type); Local search (optimization); True quantified Boolean formula; Mathematics; Computer science; Algorithm; Boolean function; Combinatorics; Discrete mathematics; Programming language","score_opus":0.017442964766918197,"score_gpt":0.2524938784654792,"score_spread":0.23505091369856101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171033649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009960973,0.0010356759,0.9767016,0.0003040442,0.000095831645,0.00007908717,0.00016327215,0.00093911483,0.0107203],"genre_scores_gemma":[0.35834315,0.0009555363,0.6201148,0.00030946266,0.0002729996,0.0006067375,0.0009733994,0.0007389585,0.017684914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880743,0.00049641356,0.00005563315,0.00018616805,0.00035302757,0.00010133053],"domain_scores_gemma":[0.9973556,0.0019243853,0.000113814036,0.00031042338,0.00021407624,0.000081765116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398286,0.00087375846,0.0015787496,0.0009581353,0.00064046774,0.0011263636,0.0027893719,0.0010547016,0.0080401255],"category_scores_gemma":[0.0061298274,0.0007620161,0.0013391881,0.0019183462,0.0011471971,0.0023616562,0.0022042517,0.0025344796,0.0011869039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027314117,0.00017783332,0.00047446898,0.00042874576,0.00010371175,0.00010267802,0.000135618,0.463155,0.002699321,0.32301152,0.015382396,0.19405547],"study_design_scores_gemma":[0.00003266505,0.000038238075,0.000112343485,0.000014527911,0.000022329397,0.000032580865,0.000010469233,0.86862934,0.00063433615,0.12785704,0.0026051395,0.000010905648],"about_ca_topic_score_codex":0.0020124756,"about_ca_topic_score_gemma":0.005751686,"teacher_disagreement_score":0.0080401255,"about_ca_system_score_codex":0.0015042502,"about_ca_system_score_gemma":0.0012212528,"threshold_uncertainty_score":0.026896894},"labels":[],"label_agreement":null},{"id":"W2171042173","doi":"10.1007/978-3-540-76856-2_1","title":"Visible and Infrared Sensors Fusion by Matching Feature Points of Foreground Blobs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Polytechnique Montréal","funders":"","keywords":"RANSAC; Epipolar geometry; Artificial intelligence; Feature (linguistics); Matching (statistics); Computer vision; Computer science; Background subtraction; Subtraction; Mathematics; Pattern recognition (psychology); Image (mathematics); Pixel","score_opus":0.013148551281369662,"score_gpt":0.267186711347059,"score_spread":0.25403816006568936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171042173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14787556,0.0017116902,0.8395975,0.00020368145,0.00033726415,0.000088898036,0.00044978678,0.0030692706,0.0066662403],"genre_scores_gemma":[0.6144443,0.0012195938,0.37554136,0.0001342035,0.00017540851,0.00006061377,0.0010093378,0.00020848388,0.00720666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.00003343177,0.000014225544,0.00011164602,0.000201714,0.00008733971],"domain_scores_gemma":[0.99978536,0.00002446791,0.000037612488,0.00004165857,0.000096410266,0.000014498777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030380208,0.0008681344,0.00096388796,0.0014253652,0.00029236206,0.0010488309,0.00085890834,0.00087438733,0.0016743555],"category_scores_gemma":[0.0007764602,0.00053190143,0.0007526299,0.0018037476,0.00029112876,0.001374608,0.0010197243,0.00061545835,0.0016996429],"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.0008412231,0.0001274908,0.001970749,0.00019931328,0.00012311686,0.00009510368,0.00010739478,0.013085784,0.40215153,0.0015061758,0.002970579,0.57682157],"study_design_scores_gemma":[0.00007357633,0.00034375853,0.02820213,0.00007493997,0.0003875755,0.00059950264,0.00018971306,0.5980802,0.35650074,0.005262485,0.010169795,0.00011555482],"about_ca_topic_score_codex":0.002212661,"about_ca_topic_score_gemma":0.0031321906,"teacher_disagreement_score":0.002212661,"about_ca_system_score_codex":0.00034833784,"about_ca_system_score_gemma":0.00036450702,"threshold_uncertainty_score":0.005601287},"labels":[],"label_agreement":null},{"id":"W2171359430","doi":"10.1007/978-3-540-39964-3_95","title":"Porting OMTTs to CORBA","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Computer science; Common Object Request Broker Architecture; Distributed transaction; Transaction processing; Thread (computing); Nested transaction; Online transaction processing; Transaction processing system; Operating system; Database transaction; Distributed computing; Distributed object; Programmer; Compensating transaction; Programming language","score_opus":0.016387851111540046,"score_gpt":0.2478705031778207,"score_spread":0.23148265206628066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171359430","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.021743642,0.00024315185,0.7336836,0.00076086045,0.0010082609,0.00035575428,0.0007479319,0.17005359,0.07140321],"genre_scores_gemma":[0.26592958,0.0008211825,0.49349606,0.0017304894,0.0005226722,0.00046801416,0.0056421743,0.07169723,0.1596926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902046,0.00014522523,0.000069898604,0.0001048637,0.00045599265,0.00020357207],"domain_scores_gemma":[0.9976548,0.00031697477,0.0000683676,0.0014316543,0.0003972112,0.00013088109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016888462,0.0007904747,0.0005117818,0.00095346273,0.00089387863,0.002419104,0.0017115372,0.0008495095,0.029381158],"category_scores_gemma":[0.0042780885,0.0008367458,0.001066987,0.0009776787,0.00069115346,0.0029493847,0.0029090522,0.0023092006,0.010450317],"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.0007750403,0.00068341126,0.0030143985,0.00064041547,0.00014152568,0.0007289424,0.0015796141,0.008982762,0.070948295,0.09228049,0.13416544,0.68605965],"study_design_scores_gemma":[0.00020504178,0.000160288,0.0017076267,0.00024061621,0.00012574265,0.0006205207,0.00028300975,0.070859,0.08116731,0.086662725,0.7578377,0.00013044068],"about_ca_topic_score_codex":0.004804836,"about_ca_topic_score_gemma":0.0045929328,"teacher_disagreement_score":0.029381158,"about_ca_system_score_codex":0.0007396783,"about_ca_system_score_gemma":0.0010166009,"threshold_uncertainty_score":0.09828979},"labels":[],"label_agreement":null},{"id":"W2171374746","doi":"10.1007/978-3-319-07626-3_13","title":"A Study of Cultural Reflection in Egyptian Government Websites","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Communication and Language","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hofstede's cultural dimensions theory; Government (linguistics); Reflection (computer programming); Cultural values; Sociology; Advertising; Political science; Marketing; Public relations; Psychology; Social psychology; Business; Computer science; Social science; Linguistics","score_opus":0.025470713003640295,"score_gpt":0.2801793235120257,"score_spread":0.2547086105083854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171374746","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.98719317,0.00014966493,0.00015230072,0.00056293525,0.00001148337,0.000019794461,0.00001593913,0.0000051484303,0.0118895285],"genre_scores_gemma":[0.9974171,0.00013637441,0.00009275675,0.00012170653,0.0000052489368,0.000011542844,0.000014296611,0.000010283066,0.0021907417],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99633706,0.0021597103,0.00014254957,0.00020981507,0.00050246983,0.0006483155],"domain_scores_gemma":[0.9851281,0.009447776,0.0022049833,0.00062976073,0.0016916579,0.00089766656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004226999,0.00033004384,0.0003021513,0.0020776314,0.007004104,0.007164654,0.0012740338,0.001638218,0.0033978797],"category_scores_gemma":[0.018497232,0.00039804855,0.00020509723,0.0039488394,0.0058934344,0.0052278223,0.003837978,0.0026740027,0.00041619127],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003423217,0.000071616596,0.009129845,0.000043821958,0.000004195719,0.00039124987,0.98100543,0.000017746464,0.0003214072,0.0027299111,0.00043546897,0.0058150394],"study_design_scores_gemma":[0.000002712345,0.000026733425,0.010982814,0.00006512682,0.000005070015,0.00009905657,0.98341227,0.000054416803,0.00023743045,0.00019674779,0.004910156,0.000007394437],"about_ca_topic_score_codex":0.023247248,"about_ca_topic_score_gemma":0.030115146,"teacher_disagreement_score":0.023247248,"about_ca_system_score_codex":0.00767273,"about_ca_system_score_gemma":0.005097726,"threshold_uncertainty_score":0.055669785},"labels":[],"label_agreement":null},{"id":"W2171445608","doi":"10.1007/978-3-540-78913-0_27","title":"An Ordered Category of Processes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Brock University","funders":"","keywords":"Dedekind cut; Monotone polygon; Mathematics; Pure mathematics; Lattice (music); Equivalence relation; Equivalence (formal languages); Algebra over a field; Geometry; Physics","score_opus":0.019056314321870767,"score_gpt":0.24493987322207905,"score_spread":0.22588355890020828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171445608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036653657,0.0038789492,0.57542807,0.0028857754,0.0007149863,0.00021294705,0.0010735232,0.0010473407,0.37810478],"genre_scores_gemma":[0.6483083,0.0028825514,0.21913128,0.0011972903,0.0007969799,0.00084696274,0.0022910957,0.00038708682,0.12415849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975817,0.0006976822,0.00018863405,0.00054243417,0.00070917746,0.00028035746],"domain_scores_gemma":[0.99808204,0.0007508973,0.00010148711,0.00034263206,0.0004825164,0.00024051811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018900458,0.0012018455,0.0008872362,0.003499993,0.0035584422,0.007072004,0.001605715,0.002022265,0.014339416],"category_scores_gemma":[0.0030283274,0.0009281686,0.0013482114,0.0037671758,0.006043167,0.012773045,0.0039094887,0.0031723147,0.003009426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036948325,0.000003285525,0.000019528987,0.000009974593,0.0000017495881,0.000017370387,0.000109942004,0.00006843082,0.00008779697,0.9977387,0.0004199883,0.0015194078],"study_design_scores_gemma":[0.0000062423624,0.000006190843,0.00003151027,0.000009654272,0.000003476539,0.00004811808,0.00008021183,0.000515302,0.00012977728,0.98569715,0.013467472,0.000004751349],"about_ca_topic_score_codex":0.0016127696,"about_ca_topic_score_gemma":0.0010710552,"teacher_disagreement_score":0.014339416,"about_ca_system_score_codex":0.0019144736,"about_ca_system_score_gemma":0.0014771431,"threshold_uncertainty_score":0.047970116},"labels":[],"label_agreement":null},{"id":"W2171491412","doi":"10.1007/11564126_16","title":"Support Vector Random Fields for Spatial Classification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":61,"is_retracted":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":"Conditional random field; Support vector machine; Computer science; Discriminative model; Kernel (algebra); Artificial intelligence; Generalization; Pattern recognition (psychology); Random field; Multivariate random variable; Inference; Spatial analysis; Consistency (knowledge bases); Machine learning; Mathematics; Random variable; Statistics","score_opus":0.028772525054208544,"score_gpt":0.2823242950158188,"score_spread":0.2535517699616103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171491412","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.001399439,0.003709147,0.9924764,0.00027757543,0.00011238573,0.000021146278,0.00019515163,0.0005722788,0.0012365845],"genre_scores_gemma":[0.08919965,0.0067064576,0.88536656,0.0002585068,0.0007407446,0.00036070964,0.0017533624,0.00032380832,0.0152901905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910575,0.00031315789,0.000055151122,0.00016499727,0.00031271295,0.000048202535],"domain_scores_gemma":[0.9980404,0.0012265244,0.00010863213,0.0002857052,0.00030452455,0.000034208315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622936,0.0010048308,0.0023388134,0.001422762,0.00039482772,0.0015063394,0.0023425817,0.0019773233,0.0065814555],"category_scores_gemma":[0.005606508,0.00063771737,0.0010499621,0.0030872193,0.00072656095,0.00250285,0.0010890227,0.0023672204,0.0036551945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007209086,0.00007513426,0.0003896139,0.0003504217,0.000073950796,0.00006199419,0.00006417877,0.11485631,0.0015018729,0.11875816,0.02822022,0.7355762],"study_design_scores_gemma":[0.0000122124275,0.000014373996,0.00020345292,0.000042919168,0.000017836344,0.00007091416,0.000017315742,0.7835071,0.0005313799,0.2059375,0.009626553,0.00001847838],"about_ca_topic_score_codex":0.0031104095,"about_ca_topic_score_gemma":0.002576358,"teacher_disagreement_score":0.0065814555,"about_ca_system_score_codex":0.00071008474,"about_ca_system_score_gemma":0.00069207157,"threshold_uncertainty_score":0.02201718},"labels":[],"label_agreement":null},{"id":"W2171511087","doi":"10.1007/978-3-319-11653-2_19","title":"Three Cases of Feature-Based Variability Modeling in Industry","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software versioning; Feature (linguistics); Notation; Constraint (computer-aided design); Software engineering; Industrial engineering; Product (mathematics); Data mining; Software; Programming language","score_opus":0.06094764478730784,"score_gpt":0.28744412566178557,"score_spread":0.2264964808744777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171511087","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.33174032,0.0004282965,0.5661751,0.0023719245,0.00007838276,0.0001961017,0.00039556174,0.0013979962,0.09721637],"genre_scores_gemma":[0.93373823,0.00013166385,0.0568815,0.00013660354,0.000020291956,0.00006721474,0.0001909052,0.00010895463,0.008724592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976997,0.00055147696,0.0001231299,0.0002936527,0.00097012793,0.00036197173],"domain_scores_gemma":[0.9943515,0.0030301283,0.0004826818,0.0014252074,0.00045714475,0.0002532239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030422038,0.0005807586,0.0004390215,0.0012497182,0.0015129541,0.0039361287,0.0016631569,0.0041317074,0.0045246524],"category_scores_gemma":[0.010061322,0.00048027182,0.001756621,0.0021875375,0.0017867167,0.0030279616,0.0024180962,0.0020178775,0.00068408565],"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.0005437828,0.0004982028,0.024863303,0.00013611227,0.000100634126,0.008731991,0.004026734,0.17326215,0.0062056324,0.6698407,0.005572213,0.10621855],"study_design_scores_gemma":[0.00010836844,0.0003477112,0.010297305,0.00017239156,0.00014982239,0.0042064777,0.0022773198,0.5924408,0.009432344,0.3401791,0.040188055,0.00020044876],"about_ca_topic_score_codex":0.006682556,"about_ca_topic_score_gemma":0.0047231033,"teacher_disagreement_score":0.006682556,"about_ca_system_score_codex":0.0013562016,"about_ca_system_score_gemma":0.0009416859,"threshold_uncertainty_score":0.016088903},"labels":[],"label_agreement":null},{"id":"W2171519600","doi":"10.1007/978-3-642-30353-1_14","title":"Domain Adaptation Techniques for Machine Translation and Their Evaluation in a Real-World Setting","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Machine translation; Adaptation (eye); Artificial intelligence; Domain (mathematical analysis); Machine learning; Context (archaeology); Word (group theory); Domain adaptation; BLEU; Quality (philosophy); Evaluation of machine translation; Baseline (sea); Natural language processing; Machine translation software usability; Example-based machine translation","score_opus":0.03277191709911327,"score_gpt":0.3040883991362745,"score_spread":0.27131648203716124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171519600","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.49419284,0.023090318,0.42795303,0.0010738118,0.0014924255,0.0014319689,0.0040581445,0.025509609,0.021197826],"genre_scores_gemma":[0.5948863,0.005817453,0.37914324,0.00044603704,0.00027470058,0.000842436,0.010886409,0.0015373601,0.0061659715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937484,0.0038436342,0.0004658837,0.0008346596,0.0008582399,0.0002490594],"domain_scores_gemma":[0.98768485,0.008708501,0.00040196662,0.001614616,0.0013548292,0.00023517842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057250033,0.0020902317,0.0013668186,0.0023788796,0.0010510004,0.0016867853,0.0017110939,0.002410927,0.0041581686],"category_scores_gemma":[0.017070998,0.00050735235,0.0010129551,0.0044261124,0.0008709515,0.0023102136,0.0021510443,0.0020086963,0.0026342948],"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.0031785402,0.0014877038,0.003263173,0.0019980494,0.0008660193,0.0007205858,0.00066007953,0.078068785,0.021298736,0.0018559108,0.017234512,0.8693679],"study_design_scores_gemma":[0.0016514795,0.0036307645,0.015944678,0.00039605165,0.0014458597,0.0030583928,0.0016088242,0.8649913,0.06816617,0.010859814,0.027911674,0.00033502566],"about_ca_topic_score_codex":0.0041090744,"about_ca_topic_score_gemma":0.0039813016,"teacher_disagreement_score":0.0057250033,"about_ca_system_score_codex":0.0006523927,"about_ca_system_score_gemma":0.0009462576,"threshold_uncertainty_score":0.030277014},"labels":[],"label_agreement":null},{"id":"W2171629073","doi":"10.1007/11935308_4","title":"A Security Analysis of the Precise Time Protocol (Short Paper)","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Protocol (science); Security analysis; Intrusion detection system; Computer network; Protocol analysis; Hierarchy; Synchronization (alternating current); State (computer science); Network security; Cryptographic protocol; Computer security; Time synchronization; Cryptography; Algorithm","score_opus":0.007101185903265391,"score_gpt":0.2323832157468812,"score_spread":0.2252820298436158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171629073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043204762,0.004331858,0.8951175,0.0050729383,0.0014847739,0.00019600763,0.00027251273,0.00046248408,0.049857184],"genre_scores_gemma":[0.82426107,0.007279983,0.113702275,0.0015821614,0.003034893,0.00041378255,0.00055998284,0.0004807883,0.048685204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768853,0.00043536592,0.00009161233,0.00049347064,0.00094333163,0.00034768454],"domain_scores_gemma":[0.99411607,0.003651149,0.00040992443,0.0009734521,0.0006311808,0.00021823889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024966244,0.0011871357,0.0011112462,0.0019424546,0.0015440182,0.0031767164,0.001234812,0.0021425518,0.0100699365],"category_scores_gemma":[0.008656487,0.0009308068,0.002426121,0.0019478792,0.0043210206,0.008977127,0.002657823,0.0064100525,0.0018661149],"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.00017835145,0.00005314857,0.00032030384,0.00015777496,0.000056325058,0.00022231936,0.0002217098,0.023627553,0.0060504116,0.93489385,0.0076505197,0.026567638],"study_design_scores_gemma":[0.00003117243,0.00011480856,0.00045506918,0.00008985835,0.000091815054,0.00030682917,0.00007551521,0.102999724,0.0054757977,0.87775975,0.012546483,0.0000532481],"about_ca_topic_score_codex":0.0009897198,"about_ca_topic_score_gemma":0.00055319525,"teacher_disagreement_score":0.0100699365,"about_ca_system_score_codex":0.0020982889,"about_ca_system_score_gemma":0.0015962517,"threshold_uncertainty_score":0.033687294},"labels":[],"label_agreement":null},{"id":"W2171752028","doi":"10.1007/3-540-45391-1_8","title":"Visualizing Mobile Agent Executions","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Carleton University","funders":"","keywords":"Computer science; Tracing; Visualization; Code (set theory); Distributed computing; Sequence diagram; Context (archaeology); Mobile agent; Human–computer interaction; Programming language; Artificial intelligence; Unified Modeling Language; Software","score_opus":0.01721575054109702,"score_gpt":0.25751153704574936,"score_spread":0.24029578650465233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171752028","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11119958,0.0011757306,0.780141,0.0008059956,0.0002755147,0.00022663319,0.005889239,0.049811225,0.050475147],"genre_scores_gemma":[0.59937876,0.0013307863,0.36337563,0.00010511961,0.000083258026,0.00029551814,0.007824857,0.0062223934,0.02138365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973303,0.00006852472,0.00001675786,0.00005013098,0.00009763226,0.000033835993],"domain_scores_gemma":[0.99889356,0.00061366794,0.0000891481,0.0001782429,0.00013178114,0.00009355302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042117806,0.0011651914,0.00040103387,0.0013809563,0.0006664742,0.002493572,0.00075677026,0.0007391784,0.019689197],"category_scores_gemma":[0.0023019428,0.00045683602,0.0005896279,0.0010876345,0.00046316744,0.0018472993,0.0012863225,0.0010828731,0.0024961508],"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.00160675,0.00031485106,0.009125192,0.0011067052,0.0001514148,0.0022599318,0.0068320935,0.21516751,0.054911166,0.22722898,0.07481314,0.4064822],"study_design_scores_gemma":[0.00012878727,0.00013991451,0.0031903943,0.00027550972,0.00007515822,0.00071229966,0.0013326204,0.7400776,0.025776206,0.09165577,0.13655116,0.00008457215],"about_ca_topic_score_codex":0.004644662,"about_ca_topic_score_gemma":0.005150113,"teacher_disagreement_score":0.019689197,"about_ca_system_score_codex":0.00049523986,"about_ca_system_score_gemma":0.0005385328,"threshold_uncertainty_score":0.06586695},"labels":[],"label_agreement":null},{"id":"W2171888989","doi":"10.1007/3-540-45512-4_18","title":"QoS-Aware Adaptive Services in Mobile Ad-Hoc Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Quality of service; Wireless ad hoc network; Computer network; Vehicular ad hoc network; Mobile computing; Mobile QoS; Distributed computing; Optimized Link State Routing Protocol; Telecommunications; Service (business); Wireless","score_opus":0.011379264124026579,"score_gpt":0.22950865630725065,"score_spread":0.21812939218322408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171888989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024488047,0.034762427,0.88590574,0.001208238,0.0017338997,0.000096250384,0.000096842785,0.00195699,0.049751565],"genre_scores_gemma":[0.63816744,0.036113016,0.24285933,0.0006010309,0.0020878487,0.00015103453,0.00034374348,0.00034188016,0.07933476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979573,0.000033934095,0.000011425141,0.000026534879,0.0001115477,0.000020770634],"domain_scores_gemma":[0.99972504,0.00014313638,0.000012103127,0.00003363715,0.000069297406,0.00001673618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029326658,0.00051460136,0.00037116793,0.00038401558,0.00028098706,0.00081061287,0.0009118037,0.0005626724,0.0021933496],"category_scores_gemma":[0.0007706643,0.00027180946,0.00015819196,0.000880618,0.00040203563,0.0012387849,0.00042549867,0.0009807434,0.00072122837],"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.00017542164,0.00011549349,0.0005218728,0.00047700896,0.00003980025,0.0003007573,0.00024108197,0.06610411,0.03887716,0.12379317,0.021637376,0.74771667],"study_design_scores_gemma":[0.000043050684,0.00023423738,0.0011726057,0.00017120142,0.00007891395,0.0012011152,0.00016438833,0.6611795,0.023056282,0.1389634,0.17367245,0.00006291305],"about_ca_topic_score_codex":0.0007534903,"about_ca_topic_score_gemma":0.0007674159,"teacher_disagreement_score":0.0021933496,"about_ca_system_score_codex":0.00040386154,"about_ca_system_score_gemma":0.00022446581,"threshold_uncertainty_score":0.0073375106},"labels":[],"label_agreement":null},{"id":"W2171916652","doi":"10.1007/978-3-642-15294-8_9","title":"Listing All Sorting Reversals in Quadratic Time","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal; University of Ottawa","funders":"","keywords":"Permutation (music); Computer science; Sorting; Listing (finance); Identity (music); Algorithm; Time complexity; Quadratic equation; Sorting algorithm; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.013114758895020085,"score_gpt":0.24658099505152317,"score_spread":0.23346623615650308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171916652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14019783,0.0037837366,0.56098735,0.0049930653,0.0020028576,0.0012635913,0.019278064,0.047775365,0.21971813],"genre_scores_gemma":[0.26402012,0.0015970857,0.5946678,0.0019685796,0.00035480104,0.0006452672,0.024771713,0.009124235,0.10285045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815196,0.00023606308,0.00019727909,0.0003651293,0.0006442466,0.0004053471],"domain_scores_gemma":[0.9966536,0.0014931328,0.00018845819,0.0009654085,0.0005385692,0.00016085622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000900511,0.0024366272,0.001886481,0.0018107943,0.0017173642,0.0035773134,0.0026210968,0.0014421076,0.078103654],"category_scores_gemma":[0.0043430254,0.0011003929,0.0016984886,0.0054853037,0.0010039873,0.006005181,0.001864052,0.002523776,0.017527958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079923746,0.0004211133,0.000899901,0.00083219016,0.000070163536,0.00016126067,0.00016354104,0.008758256,0.012850245,0.04883768,0.11506523,0.8111412],"study_design_scores_gemma":[0.0011786993,0.000652738,0.002136418,0.0003481007,0.00036641766,0.0013359593,0.0006534973,0.07085168,0.057900716,0.6167751,0.24755357,0.0002470926],"about_ca_topic_score_codex":0.0036308789,"about_ca_topic_score_gemma":0.009537654,"teacher_disagreement_score":0.078103654,"about_ca_system_score_codex":0.0021528935,"about_ca_system_score_gemma":0.0039603305,"threshold_uncertainty_score":0.2612828},"labels":[],"label_agreement":null},{"id":"W2172038329","doi":"10.1007/978-3-540-76858-6_50","title":"Comparing a Transferable Belief Model Capable of Recognizing Facial Expressions with the Latest Human Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Université de Montréal","funders":"","keywords":"Facial expression; Computer science; Artificial intelligence; Observer (physics); Task (project management); Pattern recognition (psychology); Gaussian; Mixture model; Computer vision; Machine learning; Speech recognition; Engineering","score_opus":0.09897695843539747,"score_gpt":0.2903498281996686,"score_spread":0.19137286976427112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172038329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44966635,0.00086051575,0.54319566,0.00060889137,0.00030323985,0.00010517545,0.0005013471,0.0019857646,0.002773029],"genre_scores_gemma":[0.9514789,0.00021354684,0.046084426,0.00010738875,0.000037328802,0.000044873363,0.00060386903,0.00007415864,0.0013555889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993549,0.00019970279,0.00003417356,0.00018499511,0.0001485355,0.00007763367],"domain_scores_gemma":[0.99733883,0.0018470167,0.0000898113,0.00031903572,0.00031157277,0.00009374653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026885786,0.00065310276,0.00065707945,0.00062324485,0.00029513912,0.0012445949,0.0012469657,0.0011738082,0.0023563157],"category_scores_gemma":[0.0077777095,0.00035247422,0.0008913174,0.00051943085,0.00044487455,0.0017185115,0.0009405579,0.0012119337,0.0005738124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023599193,0.00045111313,0.008171078,0.00015925795,0.00045354676,0.00015146409,0.0001741035,0.6284198,0.013328518,0.002572089,0.002396902,0.34136218],"study_design_scores_gemma":[0.000012533877,0.000105648396,0.0014598143,0.000005021918,0.000026255715,0.000021190017,0.00002338318,0.9945311,0.002116019,0.0015813451,0.000105091895,0.000012611501],"about_ca_topic_score_codex":0.016686574,"about_ca_topic_score_gemma":0.010045826,"teacher_disagreement_score":0.016686574,"about_ca_system_score_codex":0.0010236504,"about_ca_system_score_gemma":0.0008339845,"threshold_uncertainty_score":0.033178866},"labels":[],"label_agreement":null},{"id":"W2172068854","doi":"10.1007/978-3-540-74260-9_18","title":"Constrained Sampling Using Simulated Annealing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simulated annealing; Computer science; Porous medium; Gibbs sampling; Sampling (signal processing); Image processing; Image (mathematics); Iterative reconstruction; Algorithm; Artificial intelligence; Computer vision; Porosity; Materials science","score_opus":0.06941341918312119,"score_gpt":0.34529893350136975,"score_spread":0.2758855143182486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172068854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026983672,0.0001881307,0.9922476,0.00007116101,0.000053540083,0.000068529116,0.000039400467,0.0003839037,0.00424937],"genre_scores_gemma":[0.1392531,0.00022436414,0.8493503,0.00017456309,0.00007140114,0.00070135837,0.00024743666,0.0010312353,0.008946295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.00048476993,0.000031091844,0.00014675932,0.00025644878,0.000060988765],"domain_scores_gemma":[0.9972899,0.0020862077,0.00009609436,0.000285271,0.00016872035,0.000073843126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015244096,0.00092279416,0.002144354,0.0010721332,0.000873962,0.0014813944,0.0019852463,0.0021413951,0.010940821],"category_scores_gemma":[0.0061797504,0.0015789053,0.0014283246,0.0015144222,0.0014352622,0.0012084541,0.0022800812,0.0018461611,0.0017927395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105997155,0.000060964205,0.00023331463,0.00013337044,0.00007070003,0.000055066794,0.00008784037,0.87680537,0.0018167662,0.07781958,0.0026898272,0.040121235],"study_design_scores_gemma":[0.000016238562,0.000009209038,0.000030518473,0.000008573679,0.000005146624,0.00001047477,0.0000040215805,0.98235464,0.00036771482,0.01599354,0.0011937376,0.000006199872],"about_ca_topic_score_codex":0.0039012583,"about_ca_topic_score_gemma":0.0048150984,"teacher_disagreement_score":0.010940821,"about_ca_system_score_codex":0.0013502571,"about_ca_system_score_gemma":0.001228505,"threshold_uncertainty_score":0.03660071},"labels":[],"label_agreement":null},{"id":"W2172572831","doi":"10.1007/978-3-642-00528-2_8","title":"A Recommender System Based on Local Random Walks and Spectral Methods","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Recommender system; Adjacency matrix; Spectral clustering; Random walk; Link analysis; Theoretical computer science; Cluster analysis; Clustering coefficient; Eigenvalues and eigenvectors; Graph; Data mining; Algorithm; Artificial intelligence; Information retrieval; Mathematics","score_opus":0.02127466562521927,"score_gpt":0.28424273153781715,"score_spread":0.26296806591259786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172572831","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.010243734,0.00042705433,0.9867091,0.00022820868,0.0001368053,0.00007062453,0.00007297842,0.0004075622,0.0017039545],"genre_scores_gemma":[0.2691455,0.00066488865,0.7186533,0.00025467534,0.00033713723,0.00022309012,0.0003568116,0.0001300881,0.01023453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798846,0.0008792458,0.00010338319,0.00036968608,0.00056543655,0.00009379954],"domain_scores_gemma":[0.9959667,0.002068521,0.0001264912,0.00063180126,0.001032423,0.00017415064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002500217,0.00070239365,0.0026946997,0.0014021678,0.001312512,0.0016973158,0.0021169703,0.002047697,0.0037405184],"category_scores_gemma":[0.0070660803,0.0005884133,0.0015076539,0.0018326394,0.0006420696,0.002653823,0.0014735823,0.0014609938,0.0023375044],"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.0005010824,0.00059904373,0.0028032192,0.00036506186,0.00064498355,0.00026477152,0.00027334256,0.37621605,0.0082292715,0.09846999,0.017898701,0.49373448],"study_design_scores_gemma":[0.000028809125,0.00005977946,0.00018994721,0.000009539006,0.000047189205,0.00008479797,0.000012500366,0.9883576,0.00061623415,0.009071295,0.00149697,0.000025365356],"about_ca_topic_score_codex":0.0058875345,"about_ca_topic_score_gemma":0.009923962,"teacher_disagreement_score":0.0058875345,"about_ca_system_score_codex":0.0006288397,"about_ca_system_score_gemma":0.000904879,"threshold_uncertainty_score":0.013222575},"labels":[],"label_agreement":null},{"id":"W2172716504","doi":"10.1007/978-3-642-01591-5_10","title":"Robustness of Boolean Operations on Subdivision-Surface Models","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"Université de Montréal","funders":"","keywords":"Polygon mesh; Subdivision; Robustness (evolution); Computer science; A priori and a posteriori; Subdivision surface; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Computer graphics (images)","score_opus":0.01465681710401791,"score_gpt":0.24395637234872442,"score_spread":0.2292995552447065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172716504","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.36261985,0.0010686364,0.6115961,0.00071893213,0.00010773163,0.00007628534,0.000492644,0.0008531568,0.022466687],"genre_scores_gemma":[0.97198355,0.0004900786,0.021898977,0.00009607767,0.000091360074,0.00006744454,0.0004921229,0.00021779629,0.004662589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795437,0.0005494216,0.00012235787,0.0002677473,0.0008598757,0.00024611966],"domain_scores_gemma":[0.98712164,0.008798801,0.0014599719,0.0013578831,0.0007818457,0.0004799305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023999263,0.00083709037,0.0015589322,0.0022447256,0.00066161674,0.003328954,0.0018812759,0.0014803538,0.004838154],"category_scores_gemma":[0.016259162,0.00067676354,0.0013327916,0.0013840167,0.0027933284,0.004228567,0.0027403866,0.0019486989,0.0003862648],"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.0004714623,0.000063311956,0.0009808249,0.00014525183,0.000071329654,0.00012380534,0.00019621034,0.28892523,0.008927298,0.6680486,0.0014192868,0.030627333],"study_design_scores_gemma":[0.000022025464,0.000060743547,0.0003446585,0.000019840878,0.000020054875,0.00006589664,0.000044446857,0.563902,0.0023181422,0.4325267,0.00065405463,0.000021405385],"about_ca_topic_score_codex":0.001960313,"about_ca_topic_score_gemma":0.0009579002,"teacher_disagreement_score":0.004838154,"about_ca_system_score_codex":0.0020292667,"about_ca_system_score_gemma":0.0005819688,"threshold_uncertainty_score":0.016185284},"labels":[],"label_agreement":null},{"id":"W2172778996","doi":"10.1007/978-3-319-07455-9_21","title":"Particle Filter-Based Method for Prognostics with Application to Auxiliary Power Unit","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Fault Diagnosis 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":"Carleton University; National Research Council Canada","funders":"","keywords":"Prognostics; Particle filter; Reliability engineering; Computer science; Component (thermodynamics); Auxiliary power unit; Power (physics); Filter (signal processing); Engineering; Physics","score_opus":0.012093685972846904,"score_gpt":0.28610583917990606,"score_spread":0.2740121532070592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172778996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017584615,0.00040636145,0.9964065,0.000047555135,0.00012933211,0.0000146873535,0.000023373335,0.0003213232,0.0008924002],"genre_scores_gemma":[0.3971399,0.0021946458,0.58199406,0.00024099203,0.00035477916,0.00022303917,0.00031424678,0.00016162106,0.01737675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998808,0.000024592367,0.000009199413,0.00003033788,0.000045239703,0.00000974905],"domain_scores_gemma":[0.9997303,0.000119409444,0.000016826627,0.000021735874,0.0001045963,0.0000071491754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034667292,0.0005738452,0.0008306876,0.00032001533,0.0003383002,0.0006336959,0.0005766011,0.0010574325,0.0027260599],"category_scores_gemma":[0.00092287804,0.00029941503,0.0004691663,0.00052574696,0.00023594114,0.0005586261,0.00034613727,0.0011223279,0.0009861139],"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.00019538925,0.000106928856,0.0005480679,0.0004063345,0.00008293651,0.00013270201,0.00010406558,0.44714248,0.01382831,0.009016598,0.0072502545,0.52118593],"study_design_scores_gemma":[0.0000058187293,0.000025054831,0.00015794525,0.000007396601,0.00000898376,0.000020329087,0.0000042260876,0.9961427,0.0012334085,0.0010017895,0.0013860498,0.000006409239],"about_ca_topic_score_codex":0.0047199726,"about_ca_topic_score_gemma":0.004082839,"teacher_disagreement_score":0.0047199726,"about_ca_system_score_codex":0.0003049585,"about_ca_system_score_gemma":0.0005365924,"threshold_uncertainty_score":0.00938499},"labels":[],"label_agreement":null},{"id":"W2172820611","doi":"10.1007/978-3-319-24318-4_6","title":"SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Boolean satisfiability problem; Maximum satisfiability problem; Heuristic; Branching (polymer chemistry); Theoretical computer science; Solver; Satisfiability; Boolean data type; Heuristics; True quantified Boolean formula; Algorithm; Boolean function; Artificial intelligence; Programming language","score_opus":0.023222380151059263,"score_gpt":0.2810982460035222,"score_spread":0.2578758658524629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172820611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05638147,0.002636024,0.7135773,0.0024849027,0.00073753315,0.00019102945,0.03032807,0.15174565,0.041918088],"genre_scores_gemma":[0.27789122,0.0015134637,0.6538847,0.0006012027,0.000111225054,0.0003491972,0.029133527,0.020027645,0.016487792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995763,0.00012778823,0.00002516458,0.00007797456,0.00014587057,0.00004699215],"domain_scores_gemma":[0.99786264,0.0014080587,0.000102236416,0.00021200917,0.0003036202,0.000111583184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068879215,0.00111919,0.0005440792,0.0021197523,0.00060452905,0.002912544,0.0016656964,0.0012008059,0.045775983],"category_scores_gemma":[0.004884196,0.0006064984,0.00088151585,0.0019285373,0.0004364384,0.0028955608,0.0013704149,0.0024235882,0.005063252],"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.00093264243,0.00027663365,0.008320312,0.0019299962,0.00018817674,0.00064774277,0.003283006,0.10068183,0.02589371,0.114853375,0.36915538,0.37383714],"study_design_scores_gemma":[0.00020870079,0.00011528333,0.0034060585,0.00036114297,0.000072926756,0.00032989832,0.00068089174,0.7156905,0.022843432,0.10798163,0.14820246,0.0001071165],"about_ca_topic_score_codex":0.0071167136,"about_ca_topic_score_gemma":0.01272632,"teacher_disagreement_score":0.045775983,"about_ca_system_score_codex":0.00080302,"about_ca_system_score_gemma":0.001186623,"threshold_uncertainty_score":0.1531359},"labels":[],"label_agreement":null},{"id":"W2172846679","doi":"10.1007/978-3-540-77343-6_21","title":"Modeling the Dynamics of Feature Binding During Object-Selective Attention","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Percept; Feature (linguistics); Artificial intelligence; Neurophysiology; Hierarchy; Information processing; Theoretical computer science; Human–computer interaction; Pattern recognition (psychology); Neuroscience; Perception","score_opus":0.04357012094155706,"score_gpt":0.30223855325919113,"score_spread":0.2586684323176341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172846679","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.5003824,0.0013341816,0.47973806,0.0015045566,0.00021719755,0.000049712697,0.00031140746,0.0006066704,0.015855819],"genre_scores_gemma":[0.98328525,0.00037463807,0.011961136,0.00005785773,0.00003656322,0.00003461878,0.00007482171,0.00008844777,0.004086608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992776,0.000011505599,0.0000028672277,0.000017806275,0.000014179825,0.000025916775],"domain_scores_gemma":[0.99951494,0.0003370838,0.000044160777,0.00002504718,0.000034445755,0.000044326644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035892235,0.00032054388,0.00062471465,0.0002743388,0.00028806872,0.0008418755,0.0013913965,0.0010538663,0.0033376701],"category_scores_gemma":[0.0024533232,0.0005784715,0.00039214065,0.00043792912,0.00047759223,0.001286344,0.0005478181,0.00087100826,0.00034828385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001665601,0.00005665728,0.001533154,0.00007043974,0.00004629077,0.00016233705,0.00015296414,0.9240025,0.016222084,0.03695916,0.0015599456,0.019067895],"study_design_scores_gemma":[0.000003187483,0.0000037225561,0.00029098216,0.0000011247114,0.0000028119377,0.000009859499,0.0000040626473,0.99493045,0.00026951672,0.0044061304,0.000075292606,0.0000029222383],"about_ca_topic_score_codex":0.013028281,"about_ca_topic_score_gemma":0.010828281,"teacher_disagreement_score":0.013028281,"about_ca_system_score_codex":0.00089411496,"about_ca_system_score_gemma":0.00065379095,"threshold_uncertainty_score":0.025904894},"labels":[],"label_agreement":null},{"id":"W2173160516","doi":"10.1007/10719839_12","title":"The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Computer science; Expressive power; Factorization; Simple (philosophy); Range (aeronautics); Theoretical computer science; Discrete mathematics; Graph; Algorithm; Mathematics","score_opus":0.013625297980357658,"score_gpt":0.20251689179391552,"score_spread":0.18889159381355786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173160516","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.38706315,0.002650869,0.31440675,0.0044034533,0.0008005156,0.00021876793,0.0011752468,0.00052270613,0.28875867],"genre_scores_gemma":[0.76318395,0.0024162151,0.13384257,0.0010043986,0.000678992,0.00021766558,0.0011875352,0.00035999008,0.09710876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996822,0.00007715961,0.000013636662,0.000074097734,0.00007780446,0.00007517336],"domain_scores_gemma":[0.9993979,0.00025638877,0.000076150034,0.000115646704,0.000076560806,0.000077305944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044172426,0.00078042364,0.0007336672,0.0010591137,0.0016010023,0.0021118543,0.0008399431,0.0013536164,0.01302051],"category_scores_gemma":[0.001962952,0.0006549297,0.00075598207,0.0013983859,0.0013628062,0.0036177302,0.0013102313,0.0023173918,0.0017534549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010683555,0.000036323876,0.00012038839,0.00012499634,0.000012677958,0.00008214827,0.0003578529,0.0040959385,0.0025359264,0.95404524,0.01237166,0.02611017],"study_design_scores_gemma":[0.000024672945,0.000012528778,0.00008762297,0.000016043725,0.000006015881,0.0000845526,0.00008015202,0.0063787634,0.00053087133,0.9872164,0.005552705,0.0000096991225],"about_ca_topic_score_codex":0.001171626,"about_ca_topic_score_gemma":0.0022050005,"teacher_disagreement_score":0.01302051,"about_ca_system_score_codex":0.0007111436,"about_ca_system_score_gemma":0.00062441407,"threshold_uncertainty_score":0.043557942},"labels":[],"label_agreement":null},{"id":"W2173266544","doi":"10.1007/978-3-642-01551-9_17","title":"Rearrangement Phylogeny of Genomes in Contig Form","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Contig; Genome; Phylogenetic tree; Phylogenetic network; Phylogenetics; DNA sequencing; Biology; Computational biology; Genetics; Computer science; Gene","score_opus":0.010978752870814238,"score_gpt":0.23249390881743448,"score_spread":0.22151515594662025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173266544","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.40524402,0.004691549,0.48880282,0.0007911954,0.00017277828,0.00013968625,0.009195346,0.0043477085,0.086614996],"genre_scores_gemma":[0.7023989,0.0038134097,0.22899134,0.00023345533,0.00008418791,0.00011545277,0.030187398,0.0015530166,0.032622892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978584,0.00005413603,0.000009873178,0.000074118005,0.000039687264,0.000036282014],"domain_scores_gemma":[0.9995389,0.00017609229,0.000045111512,0.000117041935,0.000081716236,0.000041056053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022077069,0.0003089828,0.00053144206,0.0016803873,0.0010547613,0.0012724119,0.0007115971,0.00055599265,0.010655844],"category_scores_gemma":[0.0011879948,0.0004109506,0.0004632779,0.0036261983,0.00064054405,0.0011721055,0.00065510074,0.0012218683,0.0027990087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078877655,0.000109873625,0.016163627,0.0011844169,0.00011137974,0.0012104202,0.0043803793,0.05961953,0.12230897,0.27014452,0.023518175,0.50046],"study_design_scores_gemma":[0.000080810874,0.00040994908,0.05287694,0.000533594,0.00019077516,0.003204515,0.0020997862,0.14119391,0.022682415,0.45141932,0.3251932,0.00011467253],"about_ca_topic_score_codex":0.0020866473,"about_ca_topic_score_gemma":0.0027901835,"teacher_disagreement_score":0.010655844,"about_ca_system_score_codex":0.0004641646,"about_ca_system_score_gemma":0.00042870632,"threshold_uncertainty_score":0.035647392},"labels":[],"label_agreement":null},{"id":"W2173378820","doi":"10.1007/3-540-45982-0_9","title":"Formal Conversations for the Contract Net Protocol","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Calgary","funders":"","keywords":"Contract Net Protocol; Protocol (science); Net (polyhedron); Computer science; Social contract; Computer security; Artificial intelligence; Political science; Multi-agent system; Law; Medicine; Mathematics","score_opus":0.0336096880609247,"score_gpt":0.27321615772009555,"score_spread":0.23960646965917085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173378820","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.009731932,0.0016201357,0.82441133,0.0055725165,0.00075839565,0.0005003417,0.0008658012,0.0008187109,0.15572084],"genre_scores_gemma":[0.43863922,0.002467705,0.46514314,0.0015380273,0.0008922668,0.0024695178,0.00249983,0.001146238,0.085204005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551743,0.002132378,0.00032268142,0.00042253215,0.0011925872,0.0004124237],"domain_scores_gemma":[0.9956163,0.0027789134,0.00020381642,0.0006083123,0.0005523091,0.00024026784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054906025,0.0012715941,0.0009120761,0.001315188,0.0048035984,0.006821057,0.0024167842,0.0027364565,0.020187777],"category_scores_gemma":[0.0111264875,0.0011672259,0.0012461084,0.0022080936,0.004256836,0.012373815,0.0038955421,0.0056420905,0.0034010152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022592516,0.00001229174,0.000018768207,0.0000317842,0.0000023673151,0.000027031914,0.00016695757,0.0011429171,0.0001338282,0.9929188,0.0019042431,0.0036185118],"study_design_scores_gemma":[0.000025602956,0.0000062168033,0.00002218868,0.00004519809,0.0000067464357,0.000033477114,0.00007293172,0.011380629,0.0003484389,0.96467584,0.023367928,0.000014779764],"about_ca_topic_score_codex":0.0061616227,"about_ca_topic_score_gemma":0.0040856614,"teacher_disagreement_score":0.020187777,"about_ca_system_score_codex":0.0048007523,"about_ca_system_score_gemma":0.0041300906,"threshold_uncertainty_score":0.067534804},"labels":[],"label_agreement":null},{"id":"W2173579249","doi":"10.1007/978-3-540-69355-0_24","title":"Fast Radio Broadcasting with Advice","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","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":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Broadcasting (networking); Computer science; Advice (programming); Constant (computer programming); Radio broadcasting; Radio networks; Computer network; Broadcast communication network; Theoretical computer science; Telecommunications; Algorithm; Wireless network; Wireless","score_opus":0.027069239064189454,"score_gpt":0.2479054523564685,"score_spread":0.22083621329227904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173579249","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.011619156,0.003132512,0.6213245,0.0015426105,0.0015631977,0.00014334485,0.00037628142,0.0077618533,0.35253656],"genre_scores_gemma":[0.25119323,0.0034899665,0.25884008,0.0010458563,0.0013440489,0.0001791268,0.00067515415,0.0011691195,0.48206347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.00004337125,0.0000067471806,0.0000386422,0.00011894601,0.000032866188],"domain_scores_gemma":[0.99942386,0.00025654826,0.000020577005,0.00012840175,0.00013946253,0.000031093736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034968735,0.0005716978,0.0004009471,0.0008446263,0.0005298066,0.0007991905,0.00063625124,0.00070986827,0.030595861],"category_scores_gemma":[0.0019410464,0.0002625926,0.00023165594,0.000714701,0.00045417456,0.00071580865,0.0006502923,0.0009640552,0.010137343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035744102,0.000054522712,0.00026490344,0.00026633884,0.000026790289,0.00019369619,0.0002870264,0.008333062,0.025958462,0.21062054,0.07081822,0.68281895],"study_design_scores_gemma":[0.0002073027,0.00027881665,0.00088617293,0.00023525098,0.00011060816,0.0011048934,0.00012851639,0.103401914,0.031494476,0.23311667,0.6289655,0.000069872076],"about_ca_topic_score_codex":0.0011812258,"about_ca_topic_score_gemma":0.0016697056,"teacher_disagreement_score":0.030595861,"about_ca_system_score_codex":0.0004452176,"about_ca_system_score_gemma":0.00049034646,"threshold_uncertainty_score":0.102353394},"labels":[],"label_agreement":null},{"id":"W2173731825","doi":"10.1007/978-3-642-35926-2_11","title":"Acyclic Coloring with Few Division Vertices","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Planar graph; Wheel graph; Subdivision; Mathematics; Graph; Directed acyclic graph; Path graph; Discrete mathematics; Graph power; Line graph","score_opus":0.025242310899883862,"score_gpt":0.2823510836079752,"score_spread":0.2571087727080913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173731825","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.09723517,0.0013703281,0.37691087,0.0015894623,0.0012939346,0.00036758982,0.002323957,0.0020948844,0.5168139],"genre_scores_gemma":[0.4145331,0.002409249,0.32577,0.001137678,0.00045217123,0.0004666095,0.0031600003,0.0012843006,0.2507869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996878,0.00006988155,0.000011296415,0.00009488032,0.00006163832,0.0000745919],"domain_scores_gemma":[0.99896955,0.0003494087,0.000061025716,0.0002833839,0.00016585756,0.00017077537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026553342,0.0007000343,0.00043315822,0.00064594776,0.0015036695,0.0012429571,0.0011205289,0.00049364055,0.022353446],"category_scores_gemma":[0.0010138081,0.0005606616,0.00042131275,0.0012733708,0.00071655156,0.0017245584,0.00094279787,0.0016646556,0.005437498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024124136,0.00014162481,0.00044469486,0.0005192766,0.000027004213,0.00024353655,0.00029939314,0.00817783,0.01246321,0.7957521,0.04762736,0.13406272],"study_design_scores_gemma":[0.00006475198,0.000070724935,0.00063027075,0.000100557794,0.000047966554,0.00049262185,0.00017299896,0.013836235,0.008234792,0.8261207,0.15020023,0.000028135333],"about_ca_topic_score_codex":0.001768878,"about_ca_topic_score_gemma":0.0040268954,"teacher_disagreement_score":0.022353446,"about_ca_system_score_codex":0.0009337523,"about_ca_system_score_gemma":0.0008933086,"threshold_uncertainty_score":0.07477969},"labels":[],"label_agreement":null},{"id":"W2174092017","doi":"10.1007/978-3-540-78808-9_13","title":"Characterization of Graphs Using Degree Cores","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Dalhousie University","funders":"","keywords":"Computer science; Degree (music); Characterization (materials science); Physics; Optics","score_opus":0.03173046588125576,"score_gpt":0.23717080196243975,"score_spread":0.205440336081184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174092017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47675493,0.0019396996,0.39911434,0.0021290586,0.00031746365,0.000411666,0.0030407284,0.0012987076,0.11499333],"genre_scores_gemma":[0.85576963,0.0015984669,0.113515176,0.00053343317,0.0005008456,0.00025050744,0.0036021338,0.00063063094,0.023599243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922407,0.00013052896,0.000051170555,0.00024329202,0.0002280144,0.00012291555],"domain_scores_gemma":[0.99640036,0.0018357277,0.00042611486,0.0004984168,0.00048750703,0.0003519807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064368406,0.0010032143,0.0009188898,0.0036020025,0.0010976645,0.0032444997,0.001328829,0.0008992708,0.0057104],"category_scores_gemma":[0.0046154,0.0006281931,0.0007709846,0.0032261023,0.0014762761,0.005700029,0.0016303229,0.0018578724,0.00080306135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028272986,0.00012463584,0.003333678,0.0004917794,0.000036443842,0.00025452304,0.0006775616,0.011301147,0.015085651,0.87134093,0.011163999,0.08590689],"study_design_scores_gemma":[0.000027576833,0.00008989337,0.0022771142,0.00012464424,0.000044116554,0.0008362607,0.00041079623,0.047755938,0.006996375,0.9224429,0.01895964,0.00003478884],"about_ca_topic_score_codex":0.00055830536,"about_ca_topic_score_gemma":0.0008628449,"teacher_disagreement_score":0.0057104,"about_ca_system_score_codex":0.001030323,"about_ca_system_score_gemma":0.00050116953,"threshold_uncertainty_score":0.01910317},"labels":[],"label_agreement":null},{"id":"W2174150962","doi":"10.1007/978-3-642-23623-5_58","title":"Model-Based Deformable Registration of Preoperative 3D to Intraoperative Low-Resolution 3D and 2D Sequences of MR Images","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Image registration; Computer science; Computer vision; Artificial intelligence; Imaging phantom; Mutual information; Process (computing); Nuclear medicine; Image (mathematics); Medicine","score_opus":0.023999614694377926,"score_gpt":0.28027574685743345,"score_spread":0.2562761321630555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174150962","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.054123126,0.0004995115,0.9401079,0.00022052716,0.00011898613,0.00015000172,0.0004069801,0.0027412286,0.0016318614],"genre_scores_gemma":[0.542041,0.0011538262,0.44946247,0.00021156247,0.000056921068,0.00024204596,0.0016491663,0.0013117003,0.0038713135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.00007370512,0.000037079502,0.000094887226,0.00016741334,0.000042806445],"domain_scores_gemma":[0.9996191,0.000093470204,0.000072169314,0.000116929165,0.00007926028,0.000018990964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058665633,0.0005961154,0.00070931646,0.0013700154,0.00031105767,0.0015149458,0.0007995226,0.0010857919,0.0021571817],"category_scores_gemma":[0.0022081104,0.0007651716,0.0011396257,0.0012360958,0.00042080018,0.00078176125,0.0009127676,0.0010237508,0.0011244869],"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.00081814633,0.00020671525,0.0033656151,0.0004415162,0.00019529734,0.0004796079,0.00043353927,0.26712775,0.24078965,0.004082838,0.0052617188,0.47679758],"study_design_scores_gemma":[0.00003767161,0.00018217659,0.006367479,0.000050429706,0.00009926037,0.0013934657,0.00010420856,0.89542,0.08605597,0.0035336358,0.0066565247,0.00009915157],"about_ca_topic_score_codex":0.0055689584,"about_ca_topic_score_gemma":0.0094582215,"teacher_disagreement_score":0.0055689584,"about_ca_system_score_codex":0.00060829706,"about_ca_system_score_gemma":0.001605492,"threshold_uncertainty_score":0.011073053},"labels":[],"label_agreement":null},{"id":"W2174629870","doi":"","title":"Fault model-driven test derivation from finite state models: annotated bibliography","year":2001,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Test suite; Fault coverage; Fault model; Automaton; Stuck-at fault; Conformance testing; Finite-state machine; Fault (geology); Equivalence (formal languages); TRACE (psycholinguistics); Equivalence relation; Algorithm; Fault injection; Fault detection and isolation; Theoretical computer science; Test case; Programming language; Software; Mathematics; Discrete mathematics; Artificial intelligence; Standardization; Engineering","score_opus":0.029094367605719408,"score_gpt":0.2628401739598293,"score_spread":0.23374580635410988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174629870","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035219805,0.10985539,0.82894176,0.0015523895,0.002047403,0.00031705745,0.003179563,0.0040920395,0.046492428],"genre_scores_gemma":[0.12390659,0.17595991,0.6276676,0.0012783576,0.0012712941,0.0008472877,0.01899899,0.0025299427,0.047540028],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926716,0.00010779601,0.00013079964,0.00013818596,0.00032657263,0.000029595458],"domain_scores_gemma":[0.996861,0.0017662906,0.000114519,0.0003314713,0.00090208044,0.000024634299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008868517,0.0009016293,0.00087785005,0.004813422,0.00050802936,0.0013594131,0.0017355377,0.0013069857,0.014628284],"category_scores_gemma":[0.0056442553,0.00081326393,0.0010339642,0.006351214,0.00052461284,0.001964465,0.00063756877,0.0010590506,0.005031822],"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.00007660805,0.00015041098,0.00044968448,0.008867049,0.00010739182,0.00069928425,0.00032784673,0.041860677,0.004247834,0.062016543,0.09224398,0.7889527],"study_design_scores_gemma":[0.00007098106,0.00014434347,0.0013022432,0.006154228,0.0003859028,0.0020292148,0.00014086414,0.06448158,0.020018956,0.28555614,0.61956275,0.00015286983],"about_ca_topic_score_codex":0.0032038991,"about_ca_topic_score_gemma":0.004131156,"teacher_disagreement_score":0.014628284,"about_ca_system_score_codex":0.000951188,"about_ca_system_score_gemma":0.0016203853,"threshold_uncertainty_score":0.048936486},"labels":[],"label_agreement":null},{"id":"W2174703538","doi":"10.1007/978-3-642-41230-1_37","title":"Automatically Training Form Classifiers","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Computer science; Web crawler; Domain (mathematical analysis); Machine learning; Training set; Quality (philosophy); Training (meteorology); Data mining; Artificial intelligence; State (computer science); Information retrieval; World Wide Web; Mathematics","score_opus":0.02991305767942924,"score_gpt":0.24679241226717488,"score_spread":0.21687935458774565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174703538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024109764,0.0016637418,0.9233162,0.0006566629,0.0006138805,0.0003276016,0.0014985747,0.026599618,0.021213941],"genre_scores_gemma":[0.16213188,0.0013662573,0.77142817,0.0004765061,0.00038967308,0.000348241,0.008162202,0.0023091605,0.05338795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855655,0.00018709722,0.000077183795,0.0005367641,0.0004915175,0.00015093878],"domain_scores_gemma":[0.9987871,0.0003513134,0.0000693122,0.0003261727,0.00041249223,0.000053639236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010327651,0.0019311843,0.001652118,0.0024093897,0.0012706564,0.0028490343,0.0020141706,0.0016976504,0.021377336],"category_scores_gemma":[0.003717565,0.00084083725,0.0014769026,0.0018905847,0.0006680064,0.004907445,0.0028549454,0.0020336853,0.023224028],"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.00014266587,0.00008099598,0.0011267061,0.00010349738,0.000028395953,0.00011631586,0.000070972186,0.00383879,0.009697177,0.0070047867,0.029030062,0.94875973],"study_design_scores_gemma":[0.00007089021,0.0002400656,0.0025655443,0.00022371304,0.000173545,0.0014485066,0.00036372553,0.6943678,0.086853474,0.07275118,0.14088774,0.000053710173],"about_ca_topic_score_codex":0.0014167365,"about_ca_topic_score_gemma":0.003215648,"teacher_disagreement_score":0.021377336,"about_ca_system_score_codex":0.0008723073,"about_ca_system_score_gemma":0.00092017517,"threshold_uncertainty_score":0.07151425},"labels":[],"label_agreement":null},{"id":"W2174864496","doi":"10.1007/3-540-45753-4_5","title":"On the Power of Priority Algorithms for Facility Location and Set Cover","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set cover problem; Greedy algorithm; Facility location problem; Cover (algebra); Computer science; Focus (optics); Class (philosophy); Covering problems; Set (abstract data type); Approximation algorithm; Mathematical optimization; Algorithm; Point (geometry); Time complexity; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03618592476905767,"score_gpt":0.25942953066477664,"score_spread":0.22324360589571896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174864496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036822382,0.006092395,0.87384766,0.0078104055,0.0010501858,0.00021699975,0.00036845863,0.0014893387,0.0723022],"genre_scores_gemma":[0.5940554,0.00711027,0.35858858,0.0027887989,0.003850578,0.00046434547,0.0008471902,0.0017166502,0.030578006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99111885,0.0035496845,0.00038856445,0.001084266,0.0026035365,0.0012550021],"domain_scores_gemma":[0.91660595,0.06954191,0.001839446,0.008177366,0.0021930838,0.0016422839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012859528,0.0024034772,0.0043648994,0.0031121592,0.003783025,0.008068122,0.0076911114,0.004261641,0.01551776],"category_scores_gemma":[0.066052176,0.0020076002,0.0031070034,0.006297271,0.007855896,0.029396188,0.007189311,0.009627494,0.0028498853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007232605,0.00017068461,0.0006398461,0.00030806992,0.00007175623,0.000057604542,0.00030113905,0.051034145,0.0009175866,0.8628406,0.012374203,0.07056122],"study_design_scores_gemma":[0.000107535474,0.000050131453,0.000104679704,0.00003760589,0.000037034093,0.00004813781,0.00004266364,0.11891429,0.00046210465,0.8769563,0.0032195165,0.000020039819],"about_ca_topic_score_codex":0.006410156,"about_ca_topic_score_gemma":0.0054518287,"teacher_disagreement_score":0.01551776,"about_ca_system_score_codex":0.005750358,"about_ca_system_score_gemma":0.004393688,"threshold_uncertainty_score":0.06800848},"labels":[],"label_agreement":null},{"id":"W2175050464","doi":"10.1007/978-3-540-24775-3_82","title":"Extracting and Explaining Biological Knowledge in Microarray Data","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Computer science; Ontology; Cluster analysis; Gene ontology; Data mining; Information retrieval; Microarray databases; Microarray analysis techniques; Knowledge extraction; Cluster (spacecraft); Artificial intelligence; Gene","score_opus":0.03353268016443724,"score_gpt":0.2719235415709762,"score_spread":0.23839086140653898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175050464","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.03435079,0.0017377969,0.9538248,0.0015840546,0.00008868842,0.00013991822,0.0028210778,0.003078618,0.0023741224],"genre_scores_gemma":[0.1605095,0.0032653399,0.8233978,0.0003029063,0.000192737,0.00016525068,0.009386711,0.00027287565,0.002506871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993105,0.0001667212,0.00009065408,0.00018402193,0.00020606609,0.000042046042],"domain_scores_gemma":[0.995824,0.0033890603,0.00016595899,0.00041454373,0.00016593716,0.00004052605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643663,0.0009916621,0.00067521736,0.0026752506,0.0005321253,0.0022864714,0.0012998669,0.0010284465,0.0021829074],"category_scores_gemma":[0.0066581024,0.00054424646,0.0014321649,0.0023420816,0.0009819597,0.003929212,0.0014057959,0.0012855479,0.0009002909],"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.00016404023,0.0001743645,0.008017261,0.0012055914,0.0002272063,0.0013782039,0.001387418,0.06849442,0.027803348,0.06919327,0.015536479,0.80641836],"study_design_scores_gemma":[0.00002477869,0.00006466248,0.0063329632,0.00029711993,0.00036791462,0.00081826164,0.00053258456,0.5111484,0.03478773,0.40598583,0.039567832,0.00007196311],"about_ca_topic_score_codex":0.0027061198,"about_ca_topic_score_gemma":0.004098016,"teacher_disagreement_score":0.0027061198,"about_ca_system_score_codex":0.0008559937,"about_ca_system_score_gemma":0.0009329218,"threshold_uncertainty_score":0.008692622},"labels":[],"label_agreement":null},{"id":"W2175490177","doi":"10.1007/978-3-540-85760-0_84","title":"An Interactive and Dynamic Fusion-Based Image Retrieval Approach by CINDI","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Computer vision; Computer science; Image fusion; Fusion; Image (mathematics); Artificial intelligence; Information retrieval; Philosophy; Linguistics","score_opus":0.009680557742722622,"score_gpt":0.2505438903886174,"score_spread":0.2408633326458948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175490177","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.0059708855,0.0049002385,0.965492,0.00064047804,0.00069660484,0.00011569119,0.0002531984,0.00492685,0.017004028],"genre_scores_gemma":[0.12119329,0.005271275,0.8176241,0.00072009565,0.00038291214,0.00021301399,0.0013389736,0.0012087818,0.052047566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.00004619361,0.000020242407,0.000121557336,0.00019447181,0.000047534762],"domain_scores_gemma":[0.999744,0.00004656686,0.0000071491845,0.000061021678,0.00012782078,0.000013356117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049583055,0.000778843,0.00081858935,0.0016877732,0.0007204068,0.0016554657,0.0016431818,0.000727541,0.011341518],"category_scores_gemma":[0.00081918936,0.00043962078,0.0007021758,0.002006397,0.00046693062,0.0017939089,0.0013924808,0.0012924408,0.003281041],"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.00031491285,0.00007100339,0.00018325879,0.00031312692,0.00006298494,0.00021170503,0.00014185459,0.011421273,0.09734134,0.034244664,0.03428806,0.82140577],"study_design_scores_gemma":[0.000088196284,0.0002081343,0.0012072802,0.00009904087,0.00017986826,0.0018451182,0.00014202138,0.45963863,0.19559442,0.03628563,0.30450162,0.00021003497],"about_ca_topic_score_codex":0.005258527,"about_ca_topic_score_gemma":0.0042434544,"teacher_disagreement_score":0.011341518,"about_ca_system_score_codex":0.0009617763,"about_ca_system_score_gemma":0.00062098104,"threshold_uncertainty_score":0.037941158},"labels":[],"label_agreement":null},{"id":"W2175612905","doi":"10.1007/978-3-642-03262-2_5","title":"A Conceptual Framework for Ontology Based Automating and Merging of Clinical Pathways of Comorbidities","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Dalhousie University","funders":"","keywords":"Computer science; Ontology; Software engineering; Information retrieval; Data science; Epistemology","score_opus":0.0533534947781595,"score_gpt":0.3349154529542947,"score_spread":0.2815619581761352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175612905","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.0018142856,0.00042153764,0.9850048,0.00076292397,0.00009983316,0.00043493215,0.0028257698,0.006603892,0.0020320157],"genre_scores_gemma":[0.01200369,0.0003257786,0.9815252,0.00022981162,0.00002875703,0.00025715207,0.0046974365,0.00025512604,0.0006769462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957742,0.0007253034,0.0010990173,0.0008753044,0.0012526539,0.00027353654],"domain_scores_gemma":[0.9942918,0.0020229158,0.0005582084,0.0008782366,0.0017743455,0.00047451287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008319531,0.0013166468,0.0015478728,0.007733207,0.002400833,0.0071748267,0.004282881,0.0022189228,0.004557128],"category_scores_gemma":[0.011987443,0.0011450715,0.004498303,0.007186854,0.0014743998,0.0065604323,0.0053394255,0.0030200877,0.0022232123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028739628,0.00042329406,0.0065876725,0.0021304626,0.00074933737,0.0018729736,0.0043395604,0.02655961,0.010733926,0.37600636,0.048538033,0.5217714],"study_design_scores_gemma":[0.00015400282,0.00014809429,0.0035033284,0.0017757501,0.0011514358,0.0021133274,0.0016285442,0.21929757,0.015533512,0.35341287,0.40100127,0.00028032533],"about_ca_topic_score_codex":0.028407643,"about_ca_topic_score_gemma":0.037084073,"teacher_disagreement_score":0.028407643,"about_ca_system_score_codex":0.0026205685,"about_ca_system_score_gemma":0.009518299,"threshold_uncertainty_score":0.05648458},"labels":[],"label_agreement":null},{"id":"W2175650819","doi":"10.1007/978-3-540-85760-0_88","title":"Model Fusion Experiments for the CLSR Task at CLEF 2007","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","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 Ottawa","funders":"","keywords":"Clef; Computer science; Information retrieval; Query expansion; Search engine indexing; Task (project management); Thesaurus; Natural language processing; Artificial intelligence; Relevance feedback; Image retrieval","score_opus":0.03839992547543713,"score_gpt":0.2800932661691769,"score_spread":0.24169334069373977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175650819","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.66391116,0.004460637,0.15692668,0.010935369,0.0046371827,0.0011792382,0.051137444,0.050935086,0.05587731],"genre_scores_gemma":[0.7195859,0.00049759896,0.12006136,0.0022302659,0.00054186076,0.00057539856,0.12761506,0.0054514385,0.02344115],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764806,0.0010153672,0.0000716215,0.00044482487,0.0005410053,0.00027909185],"domain_scores_gemma":[0.99681854,0.0011991089,0.00010922743,0.0008645477,0.0007701299,0.00023848069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064616404,0.0018340339,0.0016304152,0.00093395024,0.002525874,0.001641172,0.0020319452,0.0042699086,0.011116334],"category_scores_gemma":[0.005581611,0.00068824657,0.0018314517,0.0011077959,0.0009528229,0.002790291,0.00166291,0.0037431081,0.0059434604],"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.009724298,0.003482621,0.0070724157,0.0007119026,0.0015691392,0.0011607945,0.00048305243,0.15645863,0.05056267,0.013101116,0.59753984,0.15813349],"study_design_scores_gemma":[0.0035641298,0.002504815,0.014700851,0.00008216913,0.0003968942,0.0006624522,0.0005089508,0.8063612,0.084235765,0.024851337,0.061694957,0.00043642084],"about_ca_topic_score_codex":0.015500977,"about_ca_topic_score_gemma":0.022837881,"teacher_disagreement_score":0.015500977,"about_ca_system_score_codex":0.0012607469,"about_ca_system_score_gemma":0.0018045066,"threshold_uncertainty_score":0.037187815},"labels":[],"label_agreement":null},{"id":"W2176071742","doi":"10.1007/978-3-642-18302-7_14","title":"A Note on Attribute Reduction in the Decision-Theoretic Rough Set Model","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":43,"is_retracted":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":"Rough set; Reduction (mathematics); Computer science; Probabilistic logic; Attribute domain; Decision rule; Set (abstract data type); Dominance-based rough set approach; Decision table; Influence diagram; Weighted sum model; Monotonic function; Interpretation (philosophy); Data mining; Artificial intelligence; Decision tree; Mathematics","score_opus":0.03852241151003558,"score_gpt":0.26722283184936985,"score_spread":0.22870042033933427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176071742","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.0035527567,0.009462271,0.9555672,0.0059256,0.0014466363,0.00008557393,0.0002235995,0.00014788556,0.02358852],"genre_scores_gemma":[0.20942894,0.01745843,0.74645126,0.002405963,0.004541596,0.00040733803,0.0005420613,0.00028754305,0.018476866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463,0.0023622264,0.00030813442,0.0005856796,0.0019155588,0.00019835772],"domain_scores_gemma":[0.9952218,0.003370338,0.00014250072,0.00082144164,0.000360204,0.00008371811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062283305,0.0010984354,0.002520392,0.0023255376,0.0012604203,0.0048067225,0.0027379992,0.001712331,0.004103332],"category_scores_gemma":[0.01005956,0.0009731817,0.004923027,0.0040789205,0.0045796493,0.007845089,0.0038325926,0.008282617,0.001332185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002459069,0.000035113117,0.00007835352,0.0001591236,0.00006381151,0.000073585834,0.00017610454,0.013706296,0.00030127607,0.95338386,0.003858022,0.028139945],"study_design_scores_gemma":[0.000004296871,0.000013819043,0.00004166675,0.000025678537,0.000020226018,0.000031674783,0.000015703336,0.014581954,0.00013929585,0.97790945,0.0071995677,0.000016631457],"about_ca_topic_score_codex":0.0022752914,"about_ca_topic_score_gemma":0.0015270829,"teacher_disagreement_score":0.0062283305,"about_ca_system_score_codex":0.002070533,"about_ca_system_score_gemma":0.0014418069,"threshold_uncertainty_score":0.032938957},"labels":[],"label_agreement":null},{"id":"W2176225957","doi":"10.1007/978-3-319-07566-2_25","title":"On Hardness of Several String Indexing Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Substring; String (physics); Combinatorics; Search engine indexing; Upper and lower bounds; Pattern matching; Linear space; Connection (principal bundle); Space (punctuation); Integer (computer science); String searching algorithm; Simple (philosophy); Mathematics; Discrete mathematics; Data structure; Computer science; Information retrieval; Artificial intelligence","score_opus":0.016802981142046387,"score_gpt":0.23483356280543555,"score_spread":0.21803058166338915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176225957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11518323,0.02361926,0.41457278,0.06864855,0.003359857,0.00050067285,0.0053944774,0.002376143,0.3663451],"genre_scores_gemma":[0.65739244,0.021859163,0.18407616,0.009480539,0.01229873,0.0013195857,0.011001231,0.0027142751,0.09985785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936998,0.0015694448,0.00039388894,0.0012808958,0.0022530043,0.0008030608],"domain_scores_gemma":[0.9608692,0.033625185,0.000911608,0.0028522832,0.0009764819,0.000765218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004408947,0.002345829,0.004143671,0.00349837,0.0048073884,0.00933856,0.0060713673,0.0054991753,0.025947992],"category_scores_gemma":[0.024532706,0.0019364606,0.0047385544,0.008493785,0.008724072,0.02787543,0.0068399347,0.019468224,0.003457867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046690335,0.00029208386,0.0005398903,0.0010301669,0.000104153296,0.00019800443,0.0004915475,0.013719847,0.0011511992,0.8630695,0.052544463,0.06639216],"study_design_scores_gemma":[0.000057974594,0.00002066974,0.00016527936,0.000060461487,0.00002908775,0.00010192708,0.00006139347,0.010106186,0.00032856214,0.9840561,0.004992763,0.000019588613],"about_ca_topic_score_codex":0.0018559756,"about_ca_topic_score_gemma":0.0015308377,"teacher_disagreement_score":0.025947992,"about_ca_system_score_codex":0.0056107654,"about_ca_system_score_gemma":0.0026600675,"threshold_uncertainty_score":0.08680469},"labels":[],"label_agreement":null},{"id":"W2176580510","doi":"10.1007/978-3-540-25935-0_4","title":"DSL Implementation in MetaOCaml, Template Haskell, and C++","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Haskell; Computer science; Programming language; Domain-specific language; Embedding; Digital subscriber line; Functional programming; Template; Generative grammar; Generic programming; Interpreter; Domain (mathematical analysis); Range (aeronautics); Artificial intelligence; Mathematics","score_opus":0.024000085596537088,"score_gpt":0.2772864200667095,"score_spread":0.2532863344701724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176580510","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.0036931997,0.00021676846,0.86788845,0.0004895091,0.00043136446,0.00011614824,0.0019854768,0.103872314,0.021306686],"genre_scores_gemma":[0.08799086,0.0005584181,0.82790536,0.0009054145,0.00015613805,0.0003204871,0.0061533526,0.03609663,0.039913364],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878114,0.00017013751,0.00015724872,0.0002011449,0.00059119513,0.00009912995],"domain_scores_gemma":[0.99810684,0.00055183226,0.000070640686,0.00070797047,0.0004551533,0.000107601445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011695782,0.00068725715,0.00070954155,0.0010208888,0.000653307,0.004491426,0.0026231722,0.0011497692,0.023359386],"category_scores_gemma":[0.0041332105,0.0009956525,0.001313453,0.00086078705,0.00073603424,0.003246443,0.0017166834,0.0026745014,0.009373036],"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.00044982054,0.00022529572,0.0009222847,0.0010469104,0.00011555807,0.0004846472,0.00069991825,0.012591352,0.032700844,0.33306864,0.11830333,0.4993914],"study_design_scores_gemma":[0.00021830773,0.00009206331,0.00039343047,0.00025785185,0.00011652474,0.0006717608,0.00013683487,0.13667764,0.12548415,0.10256408,0.63324064,0.00014661072],"about_ca_topic_score_codex":0.0029965634,"about_ca_topic_score_gemma":0.0033412217,"teacher_disagreement_score":0.023359386,"about_ca_system_score_codex":0.0011082096,"about_ca_system_score_gemma":0.0016537146,"threshold_uncertainty_score":0.07814497},"labels":[],"label_agreement":null},{"id":"W21766410","doi":"10.1007/978-3-642-31087-4_5","title":"Model Fusion-Based Batch Learning with Application to Oil Spills Detection","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Water Quality Monitoring Technologies","field":"Environmental 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; National Research Council Canada","funders":"National Natural Science Foundation of China","keywords":"Computer science; Oil spill; Handwriting; Identification (biology); Process (computing); Radar; Artificial intelligence; Data mining; Machine learning; Petroleum engineering; Telecommunications; Engineering","score_opus":0.01726694330751488,"score_gpt":0.23234115079190273,"score_spread":0.21507420748438785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21766410","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.025378771,0.0007344176,0.9693625,0.00019539983,0.00015951811,0.000049684717,0.000107959124,0.0028541985,0.0011575599],"genre_scores_gemma":[0.55824834,0.0005197088,0.43351406,0.00017555484,0.00017782202,0.00015819196,0.00051370275,0.0004138924,0.006278751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.000105684994,0.000032368465,0.00010164024,0.00011979345,0.00005641244],"domain_scores_gemma":[0.99863845,0.0008376057,0.000050112496,0.00013056672,0.00030686505,0.000036398804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018221308,0.0009606521,0.0016898924,0.00047020975,0.0005943813,0.00079116505,0.0016596201,0.0014069879,0.0024422249],"category_scores_gemma":[0.0028176794,0.0006249758,0.0010195047,0.0009840801,0.0004550994,0.0011470633,0.0014256748,0.0020951738,0.00087495317],"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.00058734947,0.00028260367,0.000721706,0.0001480834,0.00015961353,0.00011508675,0.00009569548,0.46785027,0.016492777,0.002898666,0.005142835,0.5055053],"study_design_scores_gemma":[0.0000038909193,0.000019736253,0.00009142337,9.900402e-7,0.0000069387424,0.000007655792,0.0000023539064,0.99749726,0.0016329888,0.0005822207,0.0001501821,0.0000042292686],"about_ca_topic_score_codex":0.011583716,"about_ca_topic_score_gemma":0.009231555,"teacher_disagreement_score":0.011583716,"about_ca_system_score_codex":0.00068225473,"about_ca_system_score_gemma":0.00088023546,"threshold_uncertainty_score":0.023032606},"labels":[],"label_agreement":null},{"id":"W2176758301","doi":"10.1007/978-3-642-24431-5_6","title":"A SAT-Based Approach for the Construction of Reusable Control System Components","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Modular design; Supervisor; Component (thermodynamics); Construct (python library); Interface (matter); Control (management); Observer (physics); Control system; Distributed computing; Software engineering; Programming language; Artificial intelligence; Operating system","score_opus":0.03344981855326438,"score_gpt":0.2260523571430561,"score_spread":0.19260253858979173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176758301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022878265,0.00007096534,0.99340534,0.000073562165,0.00002035094,0.00011233505,0.00011579786,0.0006734198,0.0032403548],"genre_scores_gemma":[0.056845214,0.00016127425,0.9379598,0.00011012128,0.000025927562,0.00038036302,0.0007697355,0.00029605557,0.0034514377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.0006341822,0.0001531256,0.00032866848,0.00063781714,0.00016859148],"domain_scores_gemma":[0.99716216,0.0017229349,0.00011304489,0.0005945511,0.00035359577,0.000053591106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001591113,0.0016055278,0.0011318355,0.0014699992,0.0011926555,0.0024258937,0.0038142672,0.0016226728,0.013422666],"category_scores_gemma":[0.0061747977,0.0016347232,0.003310608,0.0021028747,0.0021236583,0.0031313195,0.0028726754,0.002791739,0.0025527535],"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.00022381255,0.0002113134,0.00076468074,0.00089247926,0.00024274009,0.0004341132,0.00044808636,0.27587155,0.016605457,0.39830664,0.0074265874,0.2985726],"study_design_scores_gemma":[0.000077760196,0.00010452776,0.00020050514,0.00011458985,0.00015804761,0.00019298137,0.00008392252,0.73368716,0.009914552,0.24343345,0.011991079,0.00004145581],"about_ca_topic_score_codex":0.005205631,"about_ca_topic_score_gemma":0.008629692,"teacher_disagreement_score":0.013422666,"about_ca_system_score_codex":0.0012770516,"about_ca_system_score_gemma":0.002193693,"threshold_uncertainty_score":0.04490328},"labels":[],"label_agreement":null},{"id":"W2177203915","doi":"10.1007/978-3-319-16865-4_8","title":"Age Estimation Based on Complexity-Aware Features","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Classifier (UML); Pattern recognition (psychology); Estimator; Feature extraction; Gabor wavelet; Computation; Face (sociological concept); Facial recognition system; Feature selection; Computational complexity theory; Feature (linguistics); Wavelet; Machine learning; Wavelet transform; Algorithm; Mathematics; Statistics; Discrete wavelet transform","score_opus":0.04693579858047709,"score_gpt":0.28315985146722206,"score_spread":0.23622405288674497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177203915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08207483,0.0015479714,0.9105148,0.00012760065,0.00024342755,0.000054562173,0.00074033666,0.000916737,0.0037796835],"genre_scores_gemma":[0.7157658,0.0016170759,0.27282128,0.000116155294,0.000429228,0.000084062776,0.0017834599,0.00017546942,0.007207537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.000041234805,0.000017811279,0.000121056415,0.00011384188,0.000055176904],"domain_scores_gemma":[0.9993262,0.00020491859,0.00007739755,0.000085323525,0.0002648583,0.00004124469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004117007,0.0006832155,0.001003206,0.0014530454,0.00020877917,0.000574667,0.00076323224,0.0006336838,0.0019143971],"category_scores_gemma":[0.0017453016,0.00024827104,0.0006368127,0.0009831486,0.00016821238,0.0013157066,0.0007225984,0.0005050619,0.0017936544],"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.0005151714,0.00011393984,0.017748484,0.00017814751,0.00012238201,0.00023912612,0.000103914506,0.030156737,0.06455652,0.0036830597,0.007723906,0.8748586],"study_design_scores_gemma":[0.000015741572,0.00017629465,0.030001165,0.00004049189,0.0001399758,0.0013693403,0.00006755812,0.9238154,0.034038056,0.0049043205,0.0053675715,0.00006415775],"about_ca_topic_score_codex":0.001398021,"about_ca_topic_score_gemma":0.0019995836,"teacher_disagreement_score":0.0019143971,"about_ca_system_score_codex":0.00025216438,"about_ca_system_score_gemma":0.00031536384,"threshold_uncertainty_score":0.0064043403},"labels":[],"label_agreement":null},{"id":"W2177386141","doi":"10.1007/bfb0022679","title":"Knowledge representation: Features of knowledge","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Representation (politics); Computer science; Political science","score_opus":0.024820775580343384,"score_gpt":0.2843790529783177,"score_spread":0.2595582773979743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177386141","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016405134,0.012564182,0.82411647,0.004618443,0.00029693334,0.00015948588,0.0022117232,0.0025369504,0.13709073],"genre_scores_gemma":[0.50737727,0.010149443,0.44074145,0.0010067691,0.00064447353,0.00039923989,0.0064565316,0.0006571314,0.0325678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993793,0.00015817246,0.00007049357,0.0001583714,0.0001858305,0.00004773774],"domain_scores_gemma":[0.9986131,0.00068511144,0.00012806091,0.00037058556,0.00013421515,0.0000689479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079277286,0.0005912965,0.00055309664,0.0020566443,0.0008043381,0.008350553,0.0017310765,0.0013657934,0.0089063905],"category_scores_gemma":[0.0050205356,0.00054471585,0.0008282074,0.0037722297,0.002515709,0.014090224,0.0016931413,0.0015922012,0.002408363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034978686,0.000023026489,0.0004830312,0.00028031148,0.000024787523,0.00015152851,0.00087304524,0.0015284417,0.0010748337,0.8792502,0.010221925,0.10605387],"study_design_scores_gemma":[0.000008240404,0.000009953845,0.00038399547,0.00013422374,0.000030982857,0.0003065642,0.00020383442,0.0071330545,0.000918862,0.9209778,0.069877975,0.000014557036],"about_ca_topic_score_codex":0.0018236561,"about_ca_topic_score_gemma":0.0011055424,"teacher_disagreement_score":0.0089063905,"about_ca_system_score_codex":0.0009344496,"about_ca_system_score_gemma":0.0008177438,"threshold_uncertainty_score":0.029794872},"labels":[],"label_agreement":null},{"id":"W2177425930","doi":"10.1007/978-3-319-23192-1_18","title":"Confidence Based Rank Level Fusion for Multimodal Biometric Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and 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 Calgary","funders":"","keywords":"Biometrics; Computer science; Rank (graph theory); Identification (biology); Artificial intelligence; Fingerprint (computing); Variance (accounting); Word error rate; Selection (genetic algorithm); Pattern recognition (psychology); Mathematics","score_opus":0.08379366309774533,"score_gpt":0.2964665696396887,"score_spread":0.21267290654194337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177425930","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.0077586873,0.0012634578,0.98816305,0.00013040192,0.00006404761,0.000034318982,0.0001233558,0.0005990382,0.0018636945],"genre_scores_gemma":[0.4186143,0.0018167598,0.5666079,0.00021571151,0.00025194255,0.00012677482,0.00082216435,0.00023360684,0.011310859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780697,0.00045943473,0.0001369144,0.00026449448,0.0011530553,0.00017910969],"domain_scores_gemma":[0.99854636,0.0004842627,0.00015754285,0.00027743692,0.0004909933,0.000043453594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017481727,0.0009191806,0.0013707627,0.00095463893,0.0005215416,0.0021173984,0.0012766332,0.0014221607,0.0056009837],"category_scores_gemma":[0.0047572223,0.00044638323,0.0009830423,0.0014292676,0.00057996844,0.0019218827,0.0023189764,0.0015435589,0.0026214023],"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.000581564,0.000120367265,0.0004994412,0.0003731591,0.00012320935,0.00010639995,0.00012828827,0.081696264,0.063255474,0.021187425,0.0064482884,0.82548016],"study_design_scores_gemma":[0.000017683784,0.00030576633,0.0012453672,0.00005979792,0.000071498405,0.00033696904,0.0000461429,0.9386852,0.03448365,0.01957736,0.0050791577,0.00009139467],"about_ca_topic_score_codex":0.000872501,"about_ca_topic_score_gemma":0.0012452293,"teacher_disagreement_score":0.0056009837,"about_ca_system_score_codex":0.000586062,"about_ca_system_score_gemma":0.0005483274,"threshold_uncertainty_score":0.018737197},"labels":[],"label_agreement":null},{"id":"W2177646325","doi":"10.1007/978-3-642-30642-6_4","title":"The Complexity of Intersecting Finite Automata Having Few Final States","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université de Montréal","funders":"","keywords":"Intersection (aeronautics); Automaton; Commutative property; Quantum finite automata; Computer science; Limiting; Finite-state machine; Deterministic finite automaton; Transformation (genetics); DFA minimization; Computational complexity theory; Discrete mathematics; ω-automaton; Automata theory; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics","score_opus":0.04821360167386302,"score_gpt":0.2649948956859152,"score_spread":0.2167812940120522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177646325","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.7233971,0.004119705,0.16050507,0.008072547,0.0003019966,0.00010306655,0.0022794085,0.00062609115,0.10059511],"genre_scores_gemma":[0.967747,0.0011929213,0.019772705,0.0002673921,0.00045915702,0.00013827793,0.0011720943,0.0002131047,0.009037445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965437,0.0009089069,0.00026342605,0.0006614142,0.0011560905,0.00046643158],"domain_scores_gemma":[0.96256536,0.03166277,0.0015831161,0.0023076837,0.00090261275,0.000978387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580257,0.00085142965,0.0016132032,0.0013983101,0.002182351,0.00788627,0.0034074555,0.0030072837,0.00919405],"category_scores_gemma":[0.020376557,0.0014382093,0.0020210643,0.002622133,0.0050282828,0.019396624,0.0033810586,0.0057448647,0.0008580302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003396762,0.00010298161,0.0021437926,0.0002761461,0.0000612472,0.0002514286,0.0009136896,0.041276757,0.001915321,0.9319173,0.0033658426,0.017435798],"study_design_scores_gemma":[0.00002319106,0.000014330363,0.0003126085,0.000013545065,0.000015840225,0.00009365894,0.00008956503,0.028767683,0.00042089546,0.96939564,0.00083417975,0.000018834842],"about_ca_topic_score_codex":0.0019165741,"about_ca_topic_score_gemma":0.0014836766,"teacher_disagreement_score":0.00919405,"about_ca_system_score_codex":0.0029906228,"about_ca_system_score_gemma":0.001546036,"threshold_uncertainty_score":0.03075713},"labels":[],"label_agreement":null},{"id":"W2177717561","doi":"10.1007/978-3-540-75869-3_14","title":"Autonomic Resource Management for Multimedia Services Using Inventory Control","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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 Toronto","funders":"","keywords":"Computer science; Key (lock); Multimedia; Control (management); Service (business); Resource (disambiguation); Inventory control; IP Multimedia Subsystem; Inventory management; Service provider; Quality of service; Operations research; Telecommunications; Computer network; Computer security; Operations management; Business","score_opus":0.021904092183915286,"score_gpt":0.2509043260788932,"score_spread":0.2290002338949779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177717561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10166263,0.0041676103,0.8397272,0.00052935246,0.00050766586,0.00019534034,0.00015152279,0.0040554805,0.049003042],"genre_scores_gemma":[0.9556955,0.00055859314,0.038299978,0.00008193008,0.00012867819,0.000054150358,0.00009062763,0.000071121016,0.0050194315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997559,0.000033064098,0.000019256418,0.000040383457,0.0000937977,0.00005753836],"domain_scores_gemma":[0.9997775,0.000070824615,0.000030524654,0.00004235415,0.000053784162,0.000025094292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224902,0.00053355197,0.0005423705,0.0007244266,0.00064848113,0.001660242,0.0012234144,0.0003438878,0.0023643281],"category_scores_gemma":[0.00082257245,0.0002061424,0.00030167002,0.00077431253,0.0003281047,0.0011046134,0.0006794624,0.00046501288,0.0003248159],"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.0005244358,0.00031962426,0.0017562622,0.0002208456,0.00012985468,0.00045653086,0.00022598299,0.28393477,0.047805406,0.053100947,0.010499179,0.6010262],"study_design_scores_gemma":[0.000029477233,0.00010146912,0.00076170894,0.000023816496,0.00005605181,0.00018419512,0.000057480884,0.96165764,0.0103260055,0.018702144,0.008069822,0.000030222172],"about_ca_topic_score_codex":0.0021908674,"about_ca_topic_score_gemma":0.0031012294,"teacher_disagreement_score":0.0023643281,"about_ca_system_score_codex":0.00081028574,"about_ca_system_score_gemma":0.000402585,"threshold_uncertainty_score":0.007909477},"labels":[],"label_agreement":null},{"id":"W2178305005","doi":"10.1007/978-3-319-19312-0_38","title":"SmartHealth and Internet of Things","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Western University","funders":"","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.03796038204253452,"score_gpt":0.27494144651778574,"score_spread":0.23698106447525122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178305005","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025428035,0.35481626,0.05564287,0.010592488,0.007650563,0.0000939307,0.0003327409,0.00038528044,0.5679431],"genre_scores_gemma":[0.031747293,0.30255413,0.03577922,0.008089046,0.0055801664,0.00014494425,0.0006908967,0.00025417205,0.61516017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976116,0.00004613825,0.000014138684,0.00005048455,0.00010618768,0.000021832882],"domain_scores_gemma":[0.9997832,0.00012241236,0.000015803393,0.000028858904,0.00003041928,0.000019337698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032042107,0.0007995828,0.00043013945,0.0012174676,0.00055300526,0.002152068,0.0005093968,0.0019016414,0.021845382],"category_scores_gemma":[0.00052835746,0.00038071637,0.0004086385,0.0020773099,0.0011335879,0.0052189967,0.0013755994,0.002813461,0.0075611155],"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.000019203015,0.000046203568,0.00015629601,0.0005726418,0.000015187764,0.00013803063,0.00029306381,0.0008468696,0.001474774,0.5393751,0.0997199,0.3573427],"study_design_scores_gemma":[0.000002828278,0.000026171132,0.00024030312,0.0004430925,0.000006708751,0.00040776408,0.00009258028,0.00070296717,0.0004136888,0.09400087,0.903649,0.0000140688335],"about_ca_topic_score_codex":0.00049057015,"about_ca_topic_score_gemma":0.0011266919,"teacher_disagreement_score":0.021845382,"about_ca_system_score_codex":0.00069048256,"about_ca_system_score_gemma":0.0003855992,"threshold_uncertainty_score":0.07308006},"labels":[],"label_agreement":null},{"id":"W2178307261","doi":"10.1007/11847465_14","title":"Rough Set Approximations in Formal Concept Analysis","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":86,"is_retracted":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":"Rough set; Formal concept analysis; Computer science; Set (abstract data type); Dominance-based rough set approach; Formal methods; Lattice Miner; Formal system; Approximations of π; Theoretical computer science; Mathematics; Algebra over a field; Algorithm; Artificial intelligence; Applied mathematics; Pure mathematics","score_opus":0.018020992422195712,"score_gpt":0.24434586622664425,"score_spread":0.22632487380444855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178307261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025700848,0.014005508,0.9746611,0.0006439311,0.00045743192,0.000048800735,0.00006216047,0.00014083117,0.007410146],"genre_scores_gemma":[0.16105737,0.018218227,0.8048661,0.00035035648,0.0012835824,0.0004193437,0.00032643953,0.0001700797,0.013308561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499077,0.0023205597,0.0003903303,0.0003802369,0.0017567737,0.00016133634],"domain_scores_gemma":[0.9947519,0.0038980197,0.0002083456,0.00069031084,0.00037306195,0.0000783595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005547957,0.0011661735,0.003148955,0.0025583482,0.0008651492,0.0042680297,0.0019895288,0.0013455964,0.00400948],"category_scores_gemma":[0.011620386,0.0013366803,0.0021438764,0.0044687004,0.004145517,0.008075273,0.0022786332,0.0046299947,0.001264949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017059523,0.000018025185,0.00006729083,0.0002869716,0.000050149432,0.000063422995,0.00035457106,0.013391024,0.00026969472,0.92752147,0.0029057013,0.055054523],"study_design_scores_gemma":[0.0000067595615,0.000012949471,0.000060738028,0.00007552686,0.000027534585,0.000054872344,0.00006289981,0.031588018,0.00022341193,0.9577386,0.010132688,0.000016065667],"about_ca_topic_score_codex":0.0014809656,"about_ca_topic_score_gemma":0.0010548794,"teacher_disagreement_score":0.005547957,"about_ca_system_score_codex":0.0020246154,"about_ca_system_score_gemma":0.0011052623,"threshold_uncertainty_score":0.029340744},"labels":[],"label_agreement":null},{"id":"W2178552022","doi":"10.1007/978-3-642-24983-9_5","title":"Common Unfoldings of Polyominoes and Polycubes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Carleton University","funders":"","keywords":"Polyomino; Computer science; Mathematics; Geometry","score_opus":0.01768021704871947,"score_gpt":0.22612820055581212,"score_spread":0.20844798350709265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178552022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530493,0.002602401,0.51669955,0.0013302529,0.0012815105,0.00019802392,0.00068252836,0.000685222,0.23121564],"genre_scores_gemma":[0.76906216,0.0021389152,0.1376226,0.000482528,0.00059660047,0.00025802752,0.00094288087,0.0006791639,0.088217154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999348,0.00012489704,0.00003431754,0.00017297805,0.0001864588,0.00013335104],"domain_scores_gemma":[0.99918145,0.0002403256,0.000091555805,0.00017028688,0.00016072913,0.00015569341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004666908,0.00055140356,0.00068193366,0.0010918316,0.0020438014,0.002575221,0.0008623834,0.00066331506,0.011104714],"category_scores_gemma":[0.001992726,0.0005940435,0.00092198513,0.0011859671,0.0025217612,0.0038575726,0.0019464422,0.0023844219,0.0014104089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032370783,0.00001307409,0.00008825579,0.000037252146,0.0000046822324,0.00007576057,0.0002397822,0.0014633192,0.0009851388,0.9867944,0.0016176912,0.008648227],"study_design_scores_gemma":[0.000006920414,0.000011893305,0.00013320067,0.000013153169,0.00000475143,0.00006870113,0.0001184412,0.003493464,0.00051342516,0.9851933,0.01043493,0.000007772747],"about_ca_topic_score_codex":0.0010452071,"about_ca_topic_score_gemma":0.0016938637,"teacher_disagreement_score":0.011104714,"about_ca_system_score_codex":0.0009649566,"about_ca_system_score_gemma":0.0005468451,"threshold_uncertainty_score":0.037148952},"labels":[],"label_agreement":null},{"id":"W2178728987","doi":"10.1007/978-3-642-29627-7_11","title":"LoopWeaver – Loop Modeling by the Weighted Scaling of Verified Proteins","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scaling; Computer science; Loop (graph theory); Algorithm; Limit (mathematics); Data mining; Mathematics; Geometry; Combinatorics","score_opus":0.010258966215543949,"score_gpt":0.22626244914050886,"score_spread":0.2160034829249649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178728987","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.03830012,0.00016857235,0.9563487,0.00008657292,0.00005105382,0.000031232394,0.000037498037,0.00050750445,0.0044686534],"genre_scores_gemma":[0.7145674,0.00028655454,0.2801744,0.00006138339,0.0000464341,0.00014464476,0.00016910363,0.00061245833,0.0039375597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.00016903262,0.00002060431,0.00005429077,0.0001386579,0.00002896643],"domain_scores_gemma":[0.9987515,0.0005738462,0.0001238446,0.00031695602,0.00017665791,0.000057157817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870234,0.0006602146,0.00076977874,0.0005979377,0.00043187517,0.00074939895,0.0017448333,0.00083328347,0.0026462374],"category_scores_gemma":[0.0041041113,0.0005137836,0.0007184497,0.0005703399,0.00080344407,0.0020472023,0.00087653316,0.0008450219,0.00045239602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078113495,0.00005302281,0.00033791584,0.00006254548,0.00003195723,0.00008987585,0.000086397165,0.7971268,0.005449679,0.16760768,0.0008623603,0.02821366],"study_design_scores_gemma":[0.0000019065787,0.000004640847,0.000013254628,0.0000017404985,0.000001427602,0.000004078302,0.0000018723646,0.9787936,0.0003266493,0.020621818,0.00022694407,0.000001977083],"about_ca_topic_score_codex":0.001522265,"about_ca_topic_score_gemma":0.0012299125,"teacher_disagreement_score":0.0026462374,"about_ca_system_score_codex":0.0005089716,"about_ca_system_score_gemma":0.000547118,"threshold_uncertainty_score":0.008852541},"labels":[],"label_agreement":null},{"id":"W2178828915","doi":"10.1007/978-3-319-27261-0_13","title":"Small-Area Orthogonal Drawings of 3-Connected Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Approx; Combinatorics; Planar graph; Graph; Computer science; Outerplanar graph; Discrete mathematics; Mathematics; Line graph; Pathwidth","score_opus":0.037818409343440565,"score_gpt":0.24690534692133578,"score_spread":0.2090869375778952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178828915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609545,0.001374822,0.6488112,0.0004096836,0.00030507386,0.00021256338,0.0008314395,0.0013146208,0.1606452],"genre_scores_gemma":[0.59292173,0.0029712173,0.34336817,0.0001546151,0.00014968457,0.00023227705,0.0012944284,0.0006043032,0.058303565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.000046832065,0.0000093309645,0.000031773798,0.00007728227,0.000021520911],"domain_scores_gemma":[0.9996038,0.00014922074,0.000046295685,0.000074554206,0.00007127404,0.00005482696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537621,0.0006927553,0.0003459019,0.00089370407,0.00037220775,0.0010260752,0.0007633225,0.0005515261,0.011805458],"category_scores_gemma":[0.0010201756,0.0005580181,0.0003352811,0.0011311533,0.00042198805,0.00097211124,0.00093720615,0.0010800281,0.001746152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002130652,0.000087244865,0.0006072743,0.0003474595,0.000033188462,0.00037190682,0.0003795562,0.05701326,0.030864194,0.64191234,0.015087298,0.25308323],"study_design_scores_gemma":[0.000102102604,0.00013583715,0.0014594606,0.00012399389,0.000053927633,0.0009176484,0.00030527124,0.20808394,0.015308398,0.67207295,0.10139329,0.00004325742],"about_ca_topic_score_codex":0.00060144195,"about_ca_topic_score_gemma":0.00138952,"teacher_disagreement_score":0.011805458,"about_ca_system_score_codex":0.00029914937,"about_ca_system_score_gemma":0.0001812936,"threshold_uncertainty_score":0.039493144},"labels":[],"label_agreement":null},{"id":"W2179003284","doi":"10.1007/978-3-540-85449-4_2","title":"Distributed Coordination of Massively Multi-Agent Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Saskatchewan","funders":"","keywords":"Computer science; Distributed computing; Scalability; Massively parallel; Resource (disambiguation); Key (lock); Computer network; Computer security; Parallel computing","score_opus":0.026282226043159936,"score_gpt":0.24609931310037203,"score_spread":0.2198170870572121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179003284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037755884,0.0010632258,0.94422984,0.0006559787,0.0003375678,0.000066388995,0.00003537928,0.0008841523,0.014971575],"genre_scores_gemma":[0.83523095,0.00077202875,0.15064919,0.00008543669,0.00020031292,0.00015873916,0.0000964731,0.00012882863,0.012677982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999537,0.00015311554,0.00002692537,0.00008965747,0.00014618026,0.000047074765],"domain_scores_gemma":[0.9993376,0.00028945645,0.000057185145,0.00015793511,0.00008464653,0.00007303559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006976334,0.0004230318,0.0007844514,0.0002581703,0.0006612287,0.0015144352,0.0013339797,0.0007693941,0.0022839536],"category_scores_gemma":[0.0016851496,0.0003556976,0.00026125956,0.0003855641,0.00081335695,0.0010999291,0.0015312203,0.0009815422,0.00041311915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000263378,0.00008810384,0.00043194403,0.0001477061,0.0000650232,0.00024431664,0.00025183085,0.73191977,0.015285103,0.15065144,0.005339797,0.095311634],"study_design_scores_gemma":[0.000042521835,0.00003508716,0.00012232347,0.000007618635,0.000008865892,0.000042230135,0.000027506969,0.92856234,0.0019287405,0.06393083,0.0052852053,0.0000068228624],"about_ca_topic_score_codex":0.00072497845,"about_ca_topic_score_gemma":0.0008797592,"teacher_disagreement_score":0.0022839536,"about_ca_system_score_codex":0.00047963017,"about_ca_system_score_gemma":0.0005004386,"threshold_uncertainty_score":0.0076406},"labels":[],"label_agreement":null},{"id":"W2179061649","doi":"10.1007/978-3-642-33509-9_34","title":"Structural Design and Analysis of 3-DOF Bionic Eye Based on Spherical Ultrasonic Motor","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Piezoelectric Actuators and Control","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":"Concordia University","funders":"","keywords":"Ultrasonic motor; Voice coil; Computer science; Actuator; Torque; Robot; Mechanism (biology); Rotor (electric); Computer vision; Artificial intelligence; Control theory (sociology); Acoustics; Simulation; Magnet; Mechanical engineering; Engineering; Piezoelectricity; Physics","score_opus":0.00856867403069498,"score_gpt":0.20512762711183147,"score_spread":0.1965589530811365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179061649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059774317,0.0007877807,0.9194737,0.00014958128,0.000053052587,0.00007282269,0.00008426498,0.000536808,0.019067608],"genre_scores_gemma":[0.87637985,0.0006135075,0.11042782,0.00006082373,0.000022564416,0.00014099319,0.00009224653,0.00005771892,0.01220444],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987423,0.000016037104,0.000004998993,0.000026509846,0.00006409051,0.000014014116],"domain_scores_gemma":[0.9999082,0.000020772914,0.000018291743,0.000012941418,0.000032985514,0.00000677925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016084324,0.00031060516,0.0004819002,0.00022365402,0.00026734566,0.00034872175,0.0008127232,0.0007849943,0.003325695],"category_scores_gemma":[0.0002125383,0.00024788384,0.00052768737,0.00015828371,0.0002774082,0.0003645687,0.00029572047,0.00020341689,0.00058766484],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027924243,0.00007535955,0.0016550943,0.00051957293,0.00009124804,0.00050637085,0.00034459418,0.36539838,0.4427681,0.042207096,0.0020461616,0.14410888],"study_design_scores_gemma":[0.000019908142,0.00033502464,0.0021435912,0.00003431571,0.00003316241,0.00040023847,0.00007738131,0.96109384,0.022729233,0.0022537669,0.010847146,0.00003232199],"about_ca_topic_score_codex":0.001533225,"about_ca_topic_score_gemma":0.0012448948,"teacher_disagreement_score":0.003325695,"about_ca_system_score_codex":0.0003844861,"about_ca_system_score_gemma":0.00039567758,"threshold_uncertainty_score":0.011125565},"labels":[],"label_agreement":null},{"id":"W2179373239","doi":"10.1007/978-3-540-92865-2_5","title":"Improving the Believability of Virtual Characters Using Qualitative Gesture Analysis","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Computer science; Gesture; Human–computer interaction; Qualitative analysis; Artificial intelligence; Computer vision; Computer graphics (images); Qualitative research","score_opus":0.031868758923964284,"score_gpt":0.2954108610700222,"score_spread":0.2635421021460579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179373239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1568905,0.0002254762,0.831188,0.00022305257,0.000055732784,0.00013127225,0.00015016773,0.0017519383,0.009383798],"genre_scores_gemma":[0.8546908,0.00017986668,0.14088891,0.00005187556,0.000013079459,0.0001549603,0.00018909876,0.00029471068,0.0035366665],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99784505,0.0006599816,0.0000800883,0.0002561027,0.0010207335,0.00013811266],"domain_scores_gemma":[0.99470794,0.0034671726,0.0002268828,0.0007305297,0.0007551287,0.00011243023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569806,0.0008887321,0.0007717432,0.0006548124,0.0004830889,0.0026348447,0.001359867,0.0008544604,0.007046602],"category_scores_gemma":[0.010974628,0.00054040086,0.0007833742,0.00034251623,0.001564175,0.00255779,0.0026692348,0.0010577857,0.0011297292],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010800252,0.00028403813,0.003211996,0.0010225654,0.00010988541,0.00037294324,0.005207487,0.09803243,0.408324,0.02928181,0.0020067762,0.4510661],"study_design_scores_gemma":[0.00012011823,0.0009498184,0.005505464,0.00022328689,0.000119140626,0.00063537515,0.0026384576,0.69456625,0.25017664,0.03438755,0.010509207,0.00016866282],"about_ca_topic_score_codex":0.0011838932,"about_ca_topic_score_gemma":0.0009769719,"teacher_disagreement_score":0.007046602,"about_ca_system_score_codex":0.00067162566,"about_ca_system_score_gemma":0.0005369295,"threshold_uncertainty_score":0.02357328},"labels":[],"label_agreement":null},{"id":"W2179916386","doi":"10.1007/978-3-540-89778-1_1","title":"Ambiguity in Natural Language Requirements Documents","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":48,"is_retracted":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":"Ambiguity; Natural (archaeology); Computer science; Linguistics; Natural language; Natural language processing; Programming language; History; Philosophy; Archaeology","score_opus":0.015582989552096003,"score_gpt":0.2882899828273541,"score_spread":0.27270699327525805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179916386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025666729,0.0028887063,0.9048654,0.0023141021,0.0003104845,0.00028523713,0.00055318995,0.0016269069,0.061489213],"genre_scores_gemma":[0.49815404,0.002894182,0.46201405,0.00080812536,0.0004424506,0.00038011698,0.002597705,0.0017021418,0.031007165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9882882,0.0041828873,0.001309008,0.00095784914,0.0047318386,0.0005301675],"domain_scores_gemma":[0.9767973,0.01712197,0.0011836499,0.0023055898,0.002338831,0.00025263225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056367693,0.000821854,0.0011195969,0.0033101737,0.0019102368,0.005762046,0.0014939778,0.0018178066,0.006054046],"category_scores_gemma":[0.0314485,0.0018194839,0.0011828888,0.003396703,0.0027772763,0.012941245,0.0030857096,0.0037514856,0.0024062707],"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.0001378815,0.00006777481,0.00076556765,0.0005371257,0.000021189266,0.00093952485,0.003981256,0.008285034,0.004411249,0.7896033,0.010399202,0.1808509],"study_design_scores_gemma":[0.000028300268,0.000041866067,0.00038056867,0.0003396309,0.000028679773,0.001279213,0.001222512,0.026425848,0.009165588,0.87645787,0.08455548,0.000074434094],"about_ca_topic_score_codex":0.0016280458,"about_ca_topic_score_gemma":0.0012229041,"teacher_disagreement_score":0.006054046,"about_ca_system_score_codex":0.0019278665,"about_ca_system_score_gemma":0.0021004756,"threshold_uncertainty_score":0.029810429},"labels":[],"label_agreement":null},{"id":"W2179921374","doi":"10.1007/978-3-642-39310-5_11","title":"Nondeterministic State Complexity of Proportional Removals","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; State (computer science); Computer science; Mathematics; Theoretical computer science; Algorithm","score_opus":0.030457535285911327,"score_gpt":0.25548739443683566,"score_spread":0.22502985915092433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179921374","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.47060022,0.0010785683,0.42750818,0.0037182902,0.00030055296,0.00015707404,0.00096031313,0.0012276525,0.0944492],"genre_scores_gemma":[0.95855695,0.00038607777,0.025141897,0.00015583236,0.00019202176,0.0001468185,0.0004826529,0.00034460472,0.014593202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554706,0.0010938476,0.0002841767,0.0006730935,0.0016966725,0.00070511847],"domain_scores_gemma":[0.9759532,0.018283052,0.00072098034,0.003382422,0.0011073503,0.00055294536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024712957,0.0006230067,0.0013922235,0.0010192057,0.0015932043,0.0050097164,0.003008897,0.0015994947,0.011905023],"category_scores_gemma":[0.01972157,0.0008553426,0.0017832095,0.0014965857,0.0031250669,0.009608182,0.0029577385,0.0048111062,0.0010795529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026411368,0.000092903276,0.00051640824,0.000134191,0.000028974433,0.00009305569,0.00034658122,0.05083657,0.002835363,0.918522,0.0024072034,0.02392266],"study_design_scores_gemma":[0.000026947751,0.000015907972,0.00023166447,0.000009489378,0.000017930268,0.0000437947,0.00003774288,0.10879024,0.0015295536,0.8882331,0.0010440326,0.000019544294],"about_ca_topic_score_codex":0.0017179153,"about_ca_topic_score_gemma":0.0017691576,"teacher_disagreement_score":0.011905023,"about_ca_system_score_codex":0.0026974024,"about_ca_system_score_gemma":0.00206594,"threshold_uncertainty_score":0.039826214},"labels":[],"label_agreement":null},{"id":"W2179967332","doi":"10.1007/978-3-540-85035-9_31","title":"Focus-Plus-Context Audio Interaction Design","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Focus (optics); Computer science; Context (archaeology); Metaphor; Human–computer interaction; Window (computing); Domain (mathematical analysis); Audio visual; Multimedia; World Wide Web; Linguistics","score_opus":0.05871029895743476,"score_gpt":0.31567286981984033,"score_spread":0.2569625708624056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179967332","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.02407355,0.00055258675,0.94768274,0.00012191041,0.000115509676,0.0003427861,0.00010162981,0.0018919446,0.025117228],"genre_scores_gemma":[0.4139503,0.00049153157,0.55160373,0.000274015,0.00005932512,0.0012642159,0.00026596664,0.0004959864,0.031594913],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892634,0.00040410005,0.000051407318,0.00018809916,0.0003397839,0.00009024984],"domain_scores_gemma":[0.9992489,0.00036429116,0.00003192198,0.000115556046,0.00017989821,0.00005944471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546776,0.0012585986,0.0004459943,0.0005104131,0.00057957444,0.0013641423,0.0019187097,0.0010831521,0.019905802],"category_scores_gemma":[0.0026682585,0.0005687271,0.0005749867,0.00028011372,0.00045080626,0.0016519758,0.002071641,0.0005830589,0.002406406],"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.0018320393,0.0006168576,0.0014596591,0.0016417487,0.00019735818,0.00055797445,0.0064263204,0.011585373,0.20154423,0.078820966,0.009944893,0.68537265],"study_design_scores_gemma":[0.0014814395,0.0065913787,0.006986679,0.0006793822,0.0012586532,0.006593567,0.005235596,0.28142822,0.31875744,0.09278352,0.27785718,0.000346964],"about_ca_topic_score_codex":0.0005298947,"about_ca_topic_score_gemma":0.00072288496,"teacher_disagreement_score":0.019905802,"about_ca_system_score_codex":0.00034268197,"about_ca_system_score_gemma":0.00038095308,"threshold_uncertainty_score":0.06659156},"labels":[],"label_agreement":null},{"id":"W2180211925","doi":"10.1007/978-3-642-34191-5_25","title":"Meshes Preserving Minimum Feature Size","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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); Polygon mesh; Triangulation; Computer science; Combinatorics; Graph; Feature (linguistics); Planar graph; Algorithm; Mathematics; Geometry; Computer graphics (images)","score_opus":0.0172671400611577,"score_gpt":0.24559672507108687,"score_spread":0.22832958500992917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180211925","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.03523632,0.00034097422,0.9193974,0.00029133906,0.00027416056,0.000081963226,0.0003109425,0.0011255301,0.042941332],"genre_scores_gemma":[0.55838996,0.0010417933,0.36799142,0.0003061506,0.00030505564,0.00018274569,0.0007131774,0.0023158705,0.068753876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996252,0.00003312327,0.000017399561,0.00007361121,0.00020891991,0.00004175801],"domain_scores_gemma":[0.9993262,0.0001576244,0.000063621184,0.00029108394,0.00011876416,0.000042648113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023539894,0.0005927907,0.0007176573,0.00083869597,0.00040620877,0.0011628512,0.0010254688,0.000787824,0.007389641],"category_scores_gemma":[0.0015788076,0.0004882889,0.0005224247,0.00063573936,0.00075962243,0.0013317708,0.0014122785,0.0013971493,0.0021313021],"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.0003558993,0.00006939905,0.00033036084,0.00041118189,0.00004694736,0.00024419616,0.00022580662,0.049509857,0.1448949,0.4249901,0.010856566,0.36806485],"study_design_scores_gemma":[0.000100567064,0.00032823478,0.0011523163,0.00010782667,0.000079833415,0.0016771947,0.00016395711,0.22476506,0.12071374,0.56725603,0.083599105,0.000056154615],"about_ca_topic_score_codex":0.00029433996,"about_ca_topic_score_gemma":0.0003832021,"teacher_disagreement_score":0.007389641,"about_ca_system_score_codex":0.0003947741,"about_ca_system_score_gemma":0.00026420283,"threshold_uncertainty_score":0.024720788},"labels":[],"label_agreement":null},{"id":"W2180437877","doi":"10.1007/978-3-642-23038-7_2","title":"Towards a Practical O(n logn) Phylogeny Algorithm","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 Waterloo","funders":"","keywords":"Phylogenetic tree; Tree (set theory); Algorithm; Variety (cybernetics); Phylogenetics; Constant (computer programming); Mathematics; Computer science; Asymptotically optimal algorithm; Combinatorics; Statistics; Biology","score_opus":0.02261420963006867,"score_gpt":0.2613312287166072,"score_spread":0.23871701908653853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180437877","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.009317594,0.0006467762,0.9684128,0.0015550115,0.00036158974,0.00019407256,0.0005109926,0.006086589,0.0129144965],"genre_scores_gemma":[0.03567829,0.00028234723,0.9518708,0.00057849527,0.00019402905,0.00021901721,0.0013925598,0.00087385305,0.008910636],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974667,0.0005367421,0.0001693185,0.0007003241,0.0008072389,0.000319684],"domain_scores_gemma":[0.99453676,0.002120065,0.00017911699,0.0022145172,0.0006982836,0.00025128142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022653618,0.0018018493,0.0019015445,0.0013963579,0.0019058416,0.0037401987,0.005938068,0.0037956308,0.031817384],"category_scores_gemma":[0.010197641,0.0012904075,0.0019007609,0.0038203564,0.0016970395,0.00930956,0.0063542062,0.005178101,0.016663024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009681828,0.00032824322,0.0010471613,0.00059869647,0.00010010051,0.00019220957,0.00028856687,0.049672194,0.014897236,0.0771821,0.073934,0.78079134],"study_design_scores_gemma":[0.0007113818,0.00027894002,0.0009824159,0.00012398811,0.00012608581,0.0006069326,0.0003053467,0.56134427,0.009330677,0.36651006,0.059620097,0.000059859267],"about_ca_topic_score_codex":0.0028489002,"about_ca_topic_score_gemma":0.005203915,"teacher_disagreement_score":0.031817384,"about_ca_system_score_codex":0.0020948828,"about_ca_system_score_gemma":0.0027882513,"threshold_uncertainty_score":0.10643971},"labels":[],"label_agreement":null},{"id":"W2180500182","doi":"10.1007/978-3-319-12475-9_14","title":"RCCA-Secure Multi-use Bidirectional Proxy Re-encryption with Master Secret Security","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Ontario Tech University","funders":"","keywords":"Proxy re-encryption; Random oracle; Ciphertext; Plaintext; Computer science; Proxy (statistics); Encryption; Computer security; Alice and Bob; Alice (programming language); Theoretical computer science; Public-key cryptography","score_opus":0.022225372027223144,"score_gpt":0.23565529303105534,"score_spread":0.2134299210038322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180500182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056479443,0.0031892203,0.86291873,0.00084970193,0.0008465862,0.00058348104,0.00081983116,0.009848311,0.06446462],"genre_scores_gemma":[0.821805,0.0008212271,0.13315526,0.00030569272,0.00019064815,0.00029107017,0.0008360322,0.00061421364,0.04198085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974458,0.0003865035,0.00019561993,0.00033274927,0.0010147588,0.0006246193],"domain_scores_gemma":[0.9980003,0.00020984649,0.00013099561,0.0012564209,0.00032474886,0.00007759561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512553,0.00075348635,0.0014206134,0.0008915501,0.0013174729,0.0028589321,0.0016788976,0.001104556,0.007754598],"category_scores_gemma":[0.0017840303,0.0005311407,0.0011832747,0.0012891311,0.0010888599,0.004251118,0.0038487785,0.0023863257,0.0055824844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013906441,0.0003467524,0.0007732914,0.0007374907,0.0002095203,0.000984638,0.0004897299,0.02639345,0.09653693,0.59148985,0.029530058,0.2511176],"study_design_scores_gemma":[0.00027001815,0.0004908852,0.00097041717,0.0002291704,0.00028700416,0.0038450146,0.000337109,0.4110438,0.2315471,0.2265611,0.12409488,0.0003234955],"about_ca_topic_score_codex":0.00052288926,"about_ca_topic_score_gemma":0.00063787604,"teacher_disagreement_score":0.007754598,"about_ca_system_score_codex":0.001122792,"about_ca_system_score_gemma":0.0019526427,"threshold_uncertainty_score":0.02594173},"labels":[],"label_agreement":null},{"id":"W2181205465","doi":"10.1007/978-3-319-03859-9_32","title":"A Novel Architecture for Financial Investment Services on a Private Cloud","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Manitoba","funders":"","keywords":"Software as a service; Cloud computing; Computer science; Finance; Architecture; Derivative (finance); Financial modeling; Service provider; Service (business); Software; Business; Operating system; Software development; Marketing","score_opus":0.022329849290885787,"score_gpt":0.21805562528978734,"score_spread":0.19572577599890156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181205465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16390464,0.0016577102,0.7663092,0.003147076,0.0013419796,0.000717655,0.00066908944,0.025546096,0.036706652],"genre_scores_gemma":[0.72680736,0.0007141331,0.2351346,0.0012645045,0.00036695166,0.00025178175,0.0008361959,0.00074866985,0.033875834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928826,0.00009817383,0.00005382463,0.0001307363,0.00021128617,0.00021767463],"domain_scores_gemma":[0.9993011,0.00008391956,0.00003942356,0.00022678777,0.00019819982,0.00015055128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007003426,0.00053216616,0.00064366014,0.00066685735,0.0011184653,0.0030252812,0.0026180844,0.001202752,0.009568487],"category_scores_gemma":[0.0012174874,0.0005138247,0.00055884203,0.0010392735,0.0006128366,0.0035520482,0.0028363531,0.0014092088,0.002577738],"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.0025778841,0.0013836442,0.008781403,0.0006048958,0.00042000547,0.0016909643,0.0009534733,0.06282702,0.11018478,0.19780073,0.16781059,0.44496462],"study_design_scores_gemma":[0.00022221032,0.00036265998,0.001929634,0.00007036844,0.00021832925,0.0006797735,0.00022927015,0.8148914,0.036999915,0.04833086,0.09593425,0.00013130717],"about_ca_topic_score_codex":0.005316165,"about_ca_topic_score_gemma":0.007094772,"teacher_disagreement_score":0.009568487,"about_ca_system_score_codex":0.0017379855,"about_ca_system_score_gemma":0.0019307194,"threshold_uncertainty_score":0.03200978},"labels":[],"label_agreement":null},{"id":"W2181598850","doi":"10.1007/978-3-642-41527-2_3","title":"Use Knowledge to Learn Faster: Topology Recognition with Advice","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Advice (programming); Computer science; Topology (electrical circuits); Artificial intelligence; Programming language; Electrical engineering; Engineering","score_opus":0.021133910231674588,"score_gpt":0.2543838681498512,"score_spread":0.2332499579181766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181598850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022754721,0.0008199754,0.93699354,0.00089896267,0.00029355485,0.000090435016,0.0003950789,0.0153308725,0.022422927],"genre_scores_gemma":[0.20827006,0.00087735296,0.76389825,0.0004493628,0.00016637066,0.00010955658,0.0010800697,0.0017628123,0.02338614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995505,0.00006588868,0.000026797905,0.00014518786,0.00017204153,0.000039451195],"domain_scores_gemma":[0.99795437,0.0009305194,0.0000974146,0.0006004136,0.00033341523,0.00008374798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066291663,0.00094398967,0.00075853814,0.0008847775,0.00039189775,0.0014967844,0.0021576807,0.0013488651,0.017219659],"category_scores_gemma":[0.0050800806,0.0006292753,0.00070434384,0.00082107284,0.0007862284,0.004254373,0.0012487153,0.001813192,0.0063141338],"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.00015700569,0.000103561666,0.00077825255,0.00022178586,0.000040748087,0.00013679216,0.00022565499,0.040323965,0.008833074,0.019434646,0.025203051,0.9045414],"study_design_scores_gemma":[0.00006792851,0.00009113144,0.0006163108,0.0001122424,0.000089257905,0.00034388385,0.00015205742,0.77282697,0.022815054,0.15885618,0.0439792,0.000049777103],"about_ca_topic_score_codex":0.003267679,"about_ca_topic_score_gemma":0.0042572767,"teacher_disagreement_score":0.017219659,"about_ca_system_score_codex":0.0005313813,"about_ca_system_score_gemma":0.00067846105,"threshold_uncertainty_score":0.057605505},"labels":[],"label_agreement":null},{"id":"W2182991436","doi":"10.1007/978-3-642-22092-0_23","title":"Anisotropic Diffusion of Tensor Fields for Fold Shape Analysis on Surfaces","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Diffusion MRI; Sulcus; Anisotropy; Isotropy; Geometry; Anisotropic diffusion; Surface (topology); Fold (higher-order function); Tractography; Computer science; Physics; Anatomy; Mathematics; Optics; Biology; Magnetic resonance imaging","score_opus":0.06319671666251693,"score_gpt":0.3342538968793565,"score_spread":0.2710571802168396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182991436","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.008220218,0.00037793876,0.9902862,0.0001939078,0.000037260772,0.000022323791,0.0000887999,0.0002159498,0.0005575145],"genre_scores_gemma":[0.14438802,0.0018339198,0.8477454,0.000083738785,0.000109575274,0.00009143533,0.00049589796,0.00051054737,0.004741477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996896,0.00009326309,0.000025264417,0.000054013148,0.00010935822,0.000028516479],"domain_scores_gemma":[0.99840003,0.0006580851,0.00016936948,0.0002885045,0.00034478662,0.00013927318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300443,0.00093957,0.0010693336,0.0019436807,0.00053119037,0.0021335273,0.0011422591,0.0012108006,0.0022769407],"category_scores_gemma":[0.0046274643,0.00058419956,0.0012767749,0.0015840182,0.00096701214,0.0020128933,0.0014813337,0.0020412782,0.0007932407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032126013,0.00011162778,0.001845103,0.0005857247,0.00015595942,0.00021251176,0.00045951334,0.16465722,0.10039777,0.26207754,0.0085903555,0.46058547],"study_design_scores_gemma":[0.000010749954,0.00003501125,0.0005009334,0.000023844446,0.000018876546,0.00016899724,0.000058493795,0.91754997,0.006217916,0.07066294,0.0047174287,0.00003483802],"about_ca_topic_score_codex":0.0036477507,"about_ca_topic_score_gemma":0.004190002,"teacher_disagreement_score":0.0036477507,"about_ca_system_score_codex":0.00067383685,"about_ca_system_score_gemma":0.0011380033,"threshold_uncertainty_score":0.0076170564},"labels":[],"label_agreement":null},{"id":"W2183031293","doi":"10.1007/978-3-642-34159-5_2","title":"On the Security of Hummingbird-2 against Side Channel Cube Attacks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Initialization; Hummingbird; Cipher; Side channel attack; Cryptography; Algorithm; Encryption; Theoretical computer science; Computer network","score_opus":0.025865510246706865,"score_gpt":0.2700881439843144,"score_spread":0.24422263373760755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183031293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29219297,0.007987253,0.37147886,0.0038563989,0.000985507,0.000350049,0.0006120942,0.0026500572,0.3198868],"genre_scores_gemma":[0.9338382,0.0022841892,0.035875823,0.00050548854,0.00029953604,0.00013650423,0.00031559655,0.00020129183,0.02654329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872357,0.0002854877,0.0000431346,0.0001408235,0.00044363306,0.00036336508],"domain_scores_gemma":[0.9982901,0.0009411562,0.00010802697,0.0004129408,0.00016731385,0.00008045158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093828497,0.0010095398,0.00092186214,0.0011075891,0.0014111928,0.0018636261,0.00093318,0.0018960905,0.007851916],"category_scores_gemma":[0.00328994,0.0004226974,0.0005810211,0.0009128876,0.0029368054,0.0035999834,0.0036076016,0.0025745218,0.0028533265],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013168764,0.00009413261,0.00075987284,0.00036898258,0.00010128459,0.00048433463,0.00067743554,0.062108587,0.021698043,0.7071615,0.020362226,0.18486676],"study_design_scores_gemma":[0.000105184154,0.00029690337,0.0007205576,0.00020409645,0.000045868015,0.00087421556,0.00021649427,0.12541549,0.020842351,0.82239866,0.028767936,0.00011233824],"about_ca_topic_score_codex":0.0007454562,"about_ca_topic_score_gemma":0.00050741545,"teacher_disagreement_score":0.007851916,"about_ca_system_score_codex":0.0009490236,"about_ca_system_score_gemma":0.0007176029,"threshold_uncertainty_score":0.02626729},"labels":[],"label_agreement":null},{"id":"W2184216761","doi":"10.1007/978-3-031-38906-1","title":"Algorithms and Data Structures","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Concordia University","keywords":"Computer science; Data structure; Programming language","score_opus":0.036449678339465635,"score_gpt":0.289143112668365,"score_spread":0.25269343432889935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184216761","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023640213,0.046984438,0.5127898,0.0042926325,0.004491912,0.00018086625,0.0015666572,0.0038924117,0.42343724],"genre_scores_gemma":[0.038401634,0.04073868,0.30597496,0.0022591772,0.004768473,0.0005576024,0.0042967573,0.0033840414,0.5996187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988662,0.00017366622,0.00007829385,0.00022326464,0.00060154905,0.000056947167],"domain_scores_gemma":[0.998868,0.0004569449,0.000038703518,0.00038303263,0.00020222222,0.00005113437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007648909,0.0018853912,0.001949972,0.0026499373,0.0013309739,0.005595141,0.0016284015,0.001071322,0.053255063],"category_scores_gemma":[0.0029419777,0.0010784931,0.0010284069,0.0076245284,0.0023522098,0.006963103,0.0021031038,0.0038738044,0.042478904],"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.00002375081,0.000031226104,0.00011036904,0.0003913142,0.000024518931,0.000034770117,0.00018258192,0.0016029795,0.0009152441,0.51843315,0.16783719,0.31041297],"study_design_scores_gemma":[0.000012498578,0.000019857122,0.00016028294,0.00012529567,0.000019232459,0.00020714322,0.00004468032,0.0040404093,0.0006827811,0.5019397,0.49273503,0.000013052348],"about_ca_topic_score_codex":0.0009096373,"about_ca_topic_score_gemma":0.00092868076,"teacher_disagreement_score":0.053255063,"about_ca_system_score_codex":0.0015477659,"about_ca_system_score_gemma":0.0013283272,"threshold_uncertainty_score":0.17815596},"labels":[],"label_agreement":null},{"id":"W2184491627","doi":"10.1007/3-540-47721-7_34","title":"Is there an ultimate use of cryptography? (Extended Abstract)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université de Montréal","funders":"UC Berkeley College of Chemistry","keywords":"Cryptography; Computer security; Computer science; Software; Strong cryptography; Operating system","score_opus":0.039522078227292076,"score_gpt":0.3000660191818127,"score_spread":0.2605439409545206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184491627","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.0046638665,0.20625883,0.035468183,0.05791498,0.028403908,0.000071764895,0.00051302364,0.00044818126,0.6662574],"genre_scores_gemma":[0.10364689,0.16258991,0.0133546125,0.033918448,0.040727362,0.00016366821,0.00073193846,0.00041928398,0.6444479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996178,0.0000768817,0.000017352933,0.00007178201,0.000174237,0.000041852072],"domain_scores_gemma":[0.99942625,0.0003133731,0.0000514378,0.000063802116,0.00012531808,0.000019775422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551956,0.000946222,0.00088639377,0.00094134023,0.0008480699,0.003495155,0.0007127489,0.0016165598,0.024500957],"category_scores_gemma":[0.0015773351,0.0003381298,0.00065302744,0.00107466,0.0027354679,0.0065563247,0.0011857467,0.0025049725,0.012798721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003971445,0.000037817343,0.00017665661,0.0005335163,0.00003101498,0.00009569627,0.00046092202,0.00048193964,0.00095917744,0.58428943,0.26622486,0.14666922],"study_design_scores_gemma":[0.000010252807,0.000038567476,0.0005830484,0.00040280147,0.000015591437,0.00040264096,0.00012858289,0.0004666943,0.0008737618,0.37185112,0.6252054,0.00002158382],"about_ca_topic_score_codex":0.001293514,"about_ca_topic_score_gemma":0.0010665003,"teacher_disagreement_score":0.024500957,"about_ca_system_score_codex":0.001269078,"about_ca_system_score_gemma":0.00047077728,"threshold_uncertainty_score":0.0819639},"labels":[],"label_agreement":null},{"id":"W2184665873","doi":"10.1007/978-3-319-24318-4_9","title":"Constructing SAT Filters with a Quantum Annealer","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Constraint satisfaction problem; Context (archaeology); Filter (signal processing); Constraint satisfaction; Flexibility (engineering); Bloom filter; Algorithm; Constraint (computer-aided design); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.019629166364344086,"score_gpt":0.2389272044149647,"score_spread":0.21929803805062062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184665873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06966619,0.00021983922,0.90823823,0.0007709407,0.00014355051,0.00026555939,0.00049183733,0.0028747558,0.017329145],"genre_scores_gemma":[0.37212527,0.0002221988,0.61197025,0.00048464842,0.00006256932,0.00041695955,0.00079341285,0.00052674813,0.013397938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888664,0.00027990935,0.000084102,0.00022242994,0.00040204558,0.00012500235],"domain_scores_gemma":[0.9979151,0.0011240304,0.00008771682,0.00056527584,0.00022810281,0.00007990882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012842102,0.00040445026,0.0007917393,0.000899482,0.0011752795,0.0023616394,0.0012077619,0.0013561847,0.010606347],"category_scores_gemma":[0.005060128,0.0005931135,0.001033244,0.0013514187,0.0013077976,0.0038415072,0.0020589973,0.0015483187,0.0023212966],"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.00039174536,0.00025474245,0.0013581141,0.00024899258,0.00009807607,0.00018513725,0.00043382772,0.05875239,0.03832884,0.71514827,0.011021885,0.17377791],"study_design_scores_gemma":[0.0001145587,0.00015168633,0.00035921874,0.000046592064,0.000035262863,0.00015977478,0.00014560888,0.68546283,0.046894476,0.24038458,0.026187582,0.000057795663],"about_ca_topic_score_codex":0.0012353455,"about_ca_topic_score_gemma":0.0018013282,"teacher_disagreement_score":0.010606347,"about_ca_system_score_codex":0.0012525014,"about_ca_system_score_gemma":0.0011345678,"threshold_uncertainty_score":0.03548175},"labels":[],"label_agreement":null},{"id":"W2184977027","doi":"10.1007/978-3-319-24912-4_11","title":"On the Reuse of Goal Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"McGill University","funders":"","keywords":"Computer science; Reuse; Goal modeling; Goal orientation; Workflow; Feature (linguistics); Isolation (microbiology); Feature model; Mechanism (biology); Software engineering; Artificial intelligence; Machine learning; Programming language; Requirements engineering; Database; Software","score_opus":0.07888203164101738,"score_gpt":0.2927435530799985,"score_spread":0.21386152143898113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184977027","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.009024814,0.004025844,0.88491535,0.002387477,0.00015497692,0.000075550895,0.00013697929,0.0005979778,0.09868107],"genre_scores_gemma":[0.34930515,0.009308442,0.5767446,0.0009630668,0.00033210422,0.0002860194,0.00096545415,0.0013034458,0.06079174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517184,0.0020977615,0.00033503288,0.0005270405,0.0015386636,0.00032969372],"domain_scores_gemma":[0.98858833,0.005894247,0.00038287224,0.004204594,0.00074358954,0.00018625833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005124784,0.0012969428,0.0010771762,0.0023316836,0.0014566004,0.004869381,0.0029575117,0.0020833148,0.008353211],"category_scores_gemma":[0.017778466,0.0014843359,0.0026006051,0.004084216,0.005269141,0.012950262,0.0066985628,0.0048166392,0.0021432585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019533309,0.000022238155,0.000138778,0.000121500474,0.00002432198,0.0000925177,0.0007103692,0.005039584,0.0003275939,0.9449176,0.0022410168,0.046345018],"study_design_scores_gemma":[0.000008113749,0.000013590073,0.000080897706,0.0001413053,0.000024173381,0.00012059196,0.000121207195,0.013971713,0.00056115456,0.95675457,0.028189112,0.000013563815],"about_ca_topic_score_codex":0.005440139,"about_ca_topic_score_gemma":0.0045384164,"teacher_disagreement_score":0.008353211,"about_ca_system_score_codex":0.0023009167,"about_ca_system_score_gemma":0.0017518264,"threshold_uncertainty_score":0.027944267},"labels":[],"label_agreement":null},{"id":"W2185042433","doi":"10.1007/978-3-319-24021-3_4","title":"A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Tangent; Basis (linear algebra); Tangent cone; Cone (formal languages); Tangent space; Irrational number; Series (stratigraphy); Space (punctuation); Computer science; Tangent vector; Mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.025054740826858744,"score_gpt":0.26272386589726127,"score_spread":0.23766912507040253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185042433","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.007888522,0.0002059562,0.9767776,0.00012801668,0.000121225945,0.00008465405,0.0002879414,0.0038116148,0.010694506],"genre_scores_gemma":[0.0812687,0.00026717165,0.8991151,0.00011639318,0.000085645195,0.00018212156,0.0015894708,0.0013061375,0.016069252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991517,0.0000886534,0.000050775343,0.00018863566,0.000399831,0.00012036331],"domain_scores_gemma":[0.99921036,0.00017679267,0.000023627157,0.0003037706,0.00022728529,0.00005818101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005967857,0.0013426476,0.0012426487,0.0019179618,0.0011059812,0.0029337713,0.002549339,0.0011230995,0.02302875],"category_scores_gemma":[0.0021821412,0.00066124956,0.0014657401,0.002461221,0.0009597026,0.0035978088,0.0035728952,0.0029625935,0.009873314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028482068,0.00014421309,0.0005185137,0.00025262343,0.00006664769,0.0000772437,0.00020514433,0.00951146,0.012377688,0.21760376,0.02413631,0.73482156],"study_design_scores_gemma":[0.00021883332,0.00019025245,0.00071666064,0.000109167486,0.00008672802,0.0003775011,0.00026023295,0.1889865,0.021151049,0.7250228,0.06278303,0.000097305434],"about_ca_topic_score_codex":0.0021140904,"about_ca_topic_score_gemma":0.003449966,"teacher_disagreement_score":0.02302875,"about_ca_system_score_codex":0.001002224,"about_ca_system_score_gemma":0.0014560465,"threshold_uncertainty_score":0.077038884},"labels":[],"label_agreement":null},{"id":"W2185208441","doi":"10.1007/978-3-319-14249-4_17","title":"Efficient Object Localization and Segmentation in Weakly Labeled Videos","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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 Manitoba","funders":"","keywords":"Computer science; Artificial intelligence; Object (grammar); Computer vision; Segmentation; Frame (networking); Consistency (knowledge bases); Object detection; Video tracking; Pixel; Image segmentation; Pattern recognition (psychology)","score_opus":0.010472504659782568,"score_gpt":0.26130921019408043,"score_spread":0.2508367055342979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185208441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013115672,0.0005935358,0.98321366,0.00011694068,0.000038441038,0.00004159711,0.00022106971,0.0018148273,0.00084428425],"genre_scores_gemma":[0.16655709,0.00096404273,0.82288456,0.00013710758,0.00016290128,0.00011996716,0.0021877033,0.00054106786,0.006445553],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991327,0.00013090059,0.00004815894,0.00029491083,0.00023546898,0.00015789714],"domain_scores_gemma":[0.9988967,0.00054460275,0.00009623074,0.000222805,0.00017826456,0.000061428174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058849266,0.0012938966,0.0020409992,0.0015934227,0.00055781944,0.001884172,0.0022815284,0.0020098446,0.0032396195],"category_scores_gemma":[0.0022798814,0.0010360073,0.0009904267,0.0022473831,0.0007034396,0.0018524545,0.0019689454,0.0011792161,0.0029127267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067578844,0.00013344834,0.00080542074,0.00036515621,0.00008945415,0.00022803196,0.00015174595,0.067728184,0.1256678,0.0056800176,0.006776788,0.79169816],"study_design_scores_gemma":[0.000019655143,0.00006598926,0.0008606401,0.000018466762,0.000031060794,0.00019701205,0.00006230981,0.95118487,0.03477938,0.010264222,0.0024975773,0.000018700273],"about_ca_topic_score_codex":0.006981185,"about_ca_topic_score_gemma":0.010725418,"teacher_disagreement_score":0.006981185,"about_ca_system_score_codex":0.0007929773,"about_ca_system_score_gemma":0.001177427,"threshold_uncertainty_score":0.013881147},"labels":[],"label_agreement":null},{"id":"W2185337446","doi":"10.1007/978-3-642-54943-4_13","title":"Looking at Vector Space and Language Models for IR Using Density Matrices","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université de Montréal","funders":"","keywords":"Computer science; Space (punctuation); Density matrix; Vector space; Theoretical computer science; Vector space model; Work (physics); Matrix (chemical analysis); Joint (building); Quantum; Algorithm; Algebra over a field; Artificial intelligence; Mathematics; Pure mathematics; Physics","score_opus":0.02338043740809482,"score_gpt":0.25326273663821425,"score_spread":0.22988229923011944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185337446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066564796,0.0036027816,0.9795694,0.0033074021,0.00022583171,0.000026370704,0.00025111454,0.00063975883,0.0057209954],"genre_scores_gemma":[0.42949176,0.009622948,0.5095029,0.0025045301,0.0020955927,0.0003379209,0.0018655803,0.0012465945,0.043332256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972994,0.0016715345,0.00011652928,0.0003697031,0.0003970315,0.00014584896],"domain_scores_gemma":[0.9900034,0.007769228,0.00032825934,0.001038399,0.00065168925,0.0002089895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313299,0.0011484344,0.0016403157,0.001283863,0.000982444,0.0040984927,0.0022508095,0.002214148,0.010448498],"category_scores_gemma":[0.018179152,0.0011417603,0.002014365,0.0022527967,0.0019842177,0.012437975,0.0018012525,0.0053576827,0.003814927],"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.000097137985,0.000065817425,0.0007354171,0.00032072476,0.00011183179,0.00008337942,0.00044591862,0.037005648,0.0014828607,0.84967536,0.011300764,0.09867508],"study_design_scores_gemma":[0.000009550823,0.000033523454,0.0001889155,0.000051231607,0.000019935753,0.00008151745,0.00007385235,0.1361949,0.0004715198,0.8580778,0.004765396,0.00003182727],"about_ca_topic_score_codex":0.005057135,"about_ca_topic_score_gemma":0.003727394,"teacher_disagreement_score":0.010448498,"about_ca_system_score_codex":0.0015152019,"about_ca_system_score_gemma":0.0010234022,"threshold_uncertainty_score":0.034953654},"labels":[],"label_agreement":null},{"id":"W2185453861","doi":"10.1007/978-3-319-42432-3_34","title":"DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Heuristics; Jacobian matrix and determinant; Suite; Computer science; Software; Sparse matrix; Exploit; Algorithm; Sparse approximation; Graph; Theoretical computer science; Parallel computing; Programming language; Mathematics","score_opus":0.015376201355193046,"score_gpt":0.24697260672696203,"score_spread":0.23159640537176898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185453861","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015349494,0.00014747513,0.9019362,0.00006584309,0.00012401963,0.00006314665,0.0020281756,0.08728981,0.0068104267],"genre_scores_gemma":[0.03883519,0.00037611037,0.8871539,0.00020342195,0.00008449182,0.00039422905,0.008672734,0.04339177,0.020888077],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932945,0.00008323814,0.00006051258,0.000103701546,0.00036034675,0.00006278232],"domain_scores_gemma":[0.9986327,0.000596216,0.00007577521,0.00021061361,0.0004065879,0.00007808318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082709145,0.0016448825,0.0011574262,0.001550604,0.0008689016,0.0019023309,0.0032433465,0.001328016,0.098053865],"category_scores_gemma":[0.0046726945,0.0013256113,0.0013172288,0.0012926846,0.00047099972,0.0018550218,0.0024725928,0.002396203,0.036308747],"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.00032351413,0.00014581784,0.0017966968,0.0017133281,0.00022659876,0.00070856867,0.0007397844,0.036069226,0.024392297,0.04671157,0.3103832,0.5767894],"study_design_scores_gemma":[0.00036292194,0.00010394804,0.0010144324,0.00025315816,0.00009555534,0.0011216046,0.00028121538,0.4777251,0.04685264,0.062296286,0.40969452,0.00019860856],"about_ca_topic_score_codex":0.0029778457,"about_ca_topic_score_gemma":0.007012861,"teacher_disagreement_score":0.098053865,"about_ca_system_score_codex":0.00041429757,"about_ca_system_score_gemma":0.0013254237,"threshold_uncertainty_score":0.3280229},"labels":[],"label_agreement":null},{"id":"W2185733285","doi":"10.1007/978-3-662-47074-9_7","title":"A Hybrid Method for Context-Based Gait Recognition Based on Behavioral and Social Traits","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gait Recognition and Analysis","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 Calgary","funders":"","keywords":"Computer science; Gait; Context (archaeology); Artificial intelligence; Human–computer interaction; Computer vision; Pattern recognition (psychology); Physical medicine and rehabilitation","score_opus":0.05142468127840965,"score_gpt":0.2887082086572491,"score_spread":0.23728352737883945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185733285","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.03998955,0.0012468915,0.9514295,0.00008448012,0.0003807779,0.00020188007,0.0008094274,0.003171472,0.0026860146],"genre_scores_gemma":[0.28271082,0.0009729255,0.7043382,0.00022312632,0.0002989488,0.00037131622,0.0018487636,0.0002728455,0.008962989],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995739,0.000035908786,0.00002214915,0.00017016071,0.00014454195,0.000053375403],"domain_scores_gemma":[0.9997037,0.00005635557,0.000021660431,0.000037045764,0.00014875777,0.00003245407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035555454,0.0008919117,0.0013943744,0.0020849293,0.00036200587,0.00062020356,0.00094226986,0.0008217698,0.003010654],"category_scores_gemma":[0.0006054104,0.00029428297,0.0008773399,0.0020250615,0.0002136782,0.00057995407,0.00079500006,0.00053965603,0.0025087046],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027061198,0.00022772694,0.0039710547,0.00015946796,0.00013044747,0.00015913694,0.00006088122,0.0036703944,0.08844869,0.00069458055,0.0039085476,0.8982985],"study_design_scores_gemma":[0.00007389747,0.0005197544,0.038082264,0.00009135603,0.00037212187,0.001971982,0.00018890401,0.88477284,0.05976271,0.0030812088,0.0109055955,0.0001774132],"about_ca_topic_score_codex":0.0026843715,"about_ca_topic_score_gemma":0.006038431,"teacher_disagreement_score":0.003010654,"about_ca_system_score_codex":0.00017806301,"about_ca_system_score_gemma":0.00042678378,"threshold_uncertainty_score":0.010071635},"labels":[],"label_agreement":null},{"id":"W2186075603","doi":"10.1007/978-3-319-09129-7_20","title":"A Multi-start Tabu Search Approach for Solving the Information Routing Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"Tabu search; Computer science; Routing (electronic design automation); Guided Local Search; Vehicle routing problem; Mathematical optimization; Algorithm; Computer network; Mathematics","score_opus":0.030398284504125416,"score_gpt":0.26339126101884625,"score_spread":0.23299297651472084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186075603","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.0080765635,0.0008074707,0.97602606,0.00019281737,0.00017450625,0.00016056318,0.00017675062,0.0010336111,0.013351613],"genre_scores_gemma":[0.07877069,0.0004767745,0.91196364,0.00017633679,0.000085555264,0.00035993019,0.00034398932,0.0003494035,0.007473783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994654,0.00020235359,0.000018834853,0.00006412249,0.00018421974,0.00006507404],"domain_scores_gemma":[0.9994031,0.0003569142,0.0000325194,0.000054615994,0.00012523192,0.000027579757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008927049,0.0011157608,0.0012223783,0.0013363467,0.00097535923,0.0012176093,0.0023902229,0.00201662,0.013050151],"category_scores_gemma":[0.0024581158,0.00075479975,0.001230809,0.0026119668,0.0006946579,0.00119651,0.0011237235,0.0019587444,0.002135669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008355363,0.00010735877,0.00016932176,0.00015789962,0.000054417156,0.000063091305,0.00007472562,0.8198252,0.0013647641,0.01983034,0.0079465015,0.1503228],"study_design_scores_gemma":[0.000028196177,0.0000497336,0.00007239219,0.000019761013,0.0000134025295,0.000022997187,0.000020605405,0.98927003,0.00038055584,0.0076081203,0.0025038791,0.000010374239],"about_ca_topic_score_codex":0.006959464,"about_ca_topic_score_gemma":0.008316089,"teacher_disagreement_score":0.013050151,"about_ca_system_score_codex":0.00083782285,"about_ca_system_score_gemma":0.001482186,"threshold_uncertainty_score":0.043657064},"labels":[],"label_agreement":null},{"id":"W2186560469","doi":"10.1007/978-3-319-07455-9_20","title":"Developing Data-driven Models to Predict BEMS Energy Consumption for Demand Response Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Load and Power Forecasting","field":"Engineering","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":"National Research Council Canada","funders":"","keywords":"Computer science; Energy consumption; Building management system; Smart grid; Key (lock); Energy modeling; Chiller; Data modeling; Demand response; Building automation; Energy (signal processing); Consumption (sociology); Energy management; Database; Artificial intelligence; Engineering; Electricity; Computer security; Control (management)","score_opus":0.052694841814471975,"score_gpt":0.2520939832018173,"score_spread":0.19939914138734532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186560469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09940086,0.000706682,0.8865711,0.000748607,0.00022493169,0.00017232104,0.001643424,0.003406441,0.007125666],"genre_scores_gemma":[0.8168156,0.0005140727,0.17159815,0.00018779168,0.000090907866,0.00036999173,0.0027912625,0.00031256542,0.0073196455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998454,0.00003878006,0.000010833781,0.00003735714,0.000045586,0.000022091703],"domain_scores_gemma":[0.9990835,0.000608517,0.00003990634,0.00004895058,0.00019253574,0.000026481657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061224523,0.0007977057,0.00066443114,0.00038573268,0.00030756328,0.001009521,0.001076949,0.000932936,0.0026316766],"category_scores_gemma":[0.002531139,0.00088781724,0.00084483594,0.00045887532,0.00017326752,0.0009772452,0.00047214347,0.0016991566,0.00092094386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024025117,0.000035029392,0.00046124755,0.000025397349,0.000022455357,0.00001544559,0.00000922235,0.98345494,0.00052117766,0.00080186786,0.0008050819,0.01382417],"study_design_scores_gemma":[0.0000014376435,0.000002897779,0.000045676697,0.0000013211545,0.0000016440608,0.0000011684259,0.0000015327561,0.99917066,0.00018488921,0.00044939542,0.00013825619,0.0000012211552],"about_ca_topic_score_codex":0.0206385,"about_ca_topic_score_gemma":0.023347596,"teacher_disagreement_score":0.0206385,"about_ca_system_score_codex":0.0009526155,"about_ca_system_score_gemma":0.001041143,"threshold_uncertainty_score":0.041036725},"labels":[],"label_agreement":null},{"id":"W218666475","doi":"10.1007/978-3-642-42045-0_24","title":"A Heuristic for Finding Compatible Differential Paths with Application to HAS-160","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Collision; Algorithm; Differential (mechanical device); Theoretical computer science; Artificial intelligence; Programming language; Physics","score_opus":0.023922052616810286,"score_gpt":0.27056490531882027,"score_spread":0.24664285270200997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W218666475","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.069967486,0.0002226561,0.91411716,0.00035961202,0.00012341938,0.0004947479,0.00030761093,0.0015875044,0.012819825],"genre_scores_gemma":[0.21013118,0.000084677224,0.7850156,0.0001166705,0.000027841872,0.00015919433,0.00052468263,0.00021687045,0.0037233243],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990909,0.00020336734,0.00006480835,0.00020902343,0.00027024117,0.00016168786],"domain_scores_gemma":[0.9976476,0.0012712571,0.00011662211,0.00044353522,0.00038470858,0.0001362229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012008493,0.0010437255,0.0011987808,0.0028296919,0.0016286402,0.0015144857,0.0018372183,0.0014136833,0.011897873],"category_scores_gemma":[0.0062847477,0.0006301293,0.0014585998,0.0024745492,0.0014816159,0.0024080996,0.003028706,0.0013578455,0.0014315092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086106017,0.00056077243,0.003878231,0.0006248141,0.0001328621,0.00050628337,0.0006665952,0.087940425,0.017875114,0.21382622,0.009873849,0.6632538],"study_design_scores_gemma":[0.00021288577,0.00048055552,0.00092063926,0.00012639808,0.00016539985,0.0006703275,0.00057783676,0.6075954,0.018131208,0.35756734,0.013466689,0.000085351756],"about_ca_topic_score_codex":0.0014722352,"about_ca_topic_score_gemma":0.0024708607,"teacher_disagreement_score":0.011897873,"about_ca_system_score_codex":0.0010543821,"about_ca_system_score_gemma":0.002015016,"threshold_uncertainty_score":0.039802313},"labels":[],"label_agreement":null},{"id":"W2186752618","doi":"10.1007/978-3-642-30353-1_36","title":"Dsharp: Fast d-DNNF Compilation with sharpSAT","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Exploit; Programming language; Negation; Representation (politics); Theoretical computer science; De facto; Algorithm","score_opus":0.02359578920508502,"score_gpt":0.23590839074299244,"score_spread":0.21231260153790743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186752618","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.018073602,0.0011651171,0.7483744,0.00081114296,0.0009939322,0.00030944057,0.009943276,0.1683753,0.051953815],"genre_scores_gemma":[0.21940929,0.00066046644,0.7114186,0.0010480786,0.000247584,0.0005792118,0.018252695,0.024615064,0.023769068],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991684,0.0001299106,0.00009021999,0.00028255698,0.00020593582,0.00012300402],"domain_scores_gemma":[0.9983462,0.0006990333,0.00005010108,0.000605468,0.00025005336,0.000049104638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354053,0.0018484639,0.0008159629,0.0012359669,0.00090261776,0.0018921006,0.0022985416,0.0009139312,0.0415824],"category_scores_gemma":[0.0029288186,0.0010767345,0.0016211639,0.0017038089,0.00084225903,0.0040747058,0.0028925242,0.0021654025,0.0145127075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083700113,0.00022944345,0.0012367204,0.0018045594,0.00013688808,0.00027361367,0.00033968902,0.027515614,0.020900898,0.07307726,0.18270952,0.69093883],"study_design_scores_gemma":[0.0007019727,0.00021946702,0.00079303514,0.00042869154,0.00025760377,0.00042128345,0.00038065176,0.285162,0.08309728,0.36800218,0.26035312,0.0001826996],"about_ca_topic_score_codex":0.0042543467,"about_ca_topic_score_gemma":0.010745615,"teacher_disagreement_score":0.0415824,"about_ca_system_score_codex":0.0014250415,"about_ca_system_score_gemma":0.0017156197,"threshold_uncertainty_score":0.13910699},"labels":[],"label_agreement":null},{"id":"W2186952700","doi":"10.1007/978-3-319-06251-8_23","title":"Refinements of the RCC25 Composition Table","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Table (database); Composition (language); Connection (principal bundle); Binary relation; Relation algebra; Computer science; Boolean algebra; Algebra over a field; Algebraic number; Algebraic structure; Two-element Boolean algebra; Discrete mathematics; Pure mathematics; Algorithm; Mathematics; Algebra representation; Geometry; Data mining; Mathematical analysis","score_opus":0.010090059713814463,"score_gpt":0.22035399814584708,"score_spread":0.21026393843203262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186952700","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.029707715,0.0012524012,0.82149523,0.00059322314,0.0008577618,0.00058377156,0.0038568997,0.01004709,0.13160601],"genre_scores_gemma":[0.17332816,0.0008090107,0.7513228,0.00038021567,0.00022088118,0.00032594008,0.007291618,0.0029779687,0.06334333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967788,0.0006075572,0.00024585298,0.00062080676,0.0014238767,0.00032317778],"domain_scores_gemma":[0.9973586,0.00076492113,0.00006757867,0.001217424,0.0005095741,0.000081872575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023445585,0.0008978033,0.0010880734,0.001751667,0.0020017084,0.002745907,0.0034270852,0.0009001906,0.040765405],"category_scores_gemma":[0.0063270717,0.0009238044,0.0027282618,0.0022954731,0.0018155193,0.0033739468,0.0028040945,0.0018073035,0.0121784285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004741391,0.00009701916,0.0006657396,0.0005253783,0.00008795581,0.00051713956,0.0006238854,0.024785543,0.0096733,0.6892562,0.025925286,0.24736838],"study_design_scores_gemma":[0.00015823994,0.00013213174,0.0006899582,0.00020259127,0.00023022237,0.0006085548,0.00032445666,0.07639491,0.037882257,0.5050188,0.37817615,0.00018183091],"about_ca_topic_score_codex":0.015173037,"about_ca_topic_score_gemma":0.015683623,"teacher_disagreement_score":0.040765405,"about_ca_system_score_codex":0.0018067318,"about_ca_system_score_gemma":0.0024643478,"threshold_uncertainty_score":0.13637388},"labels":[],"label_agreement":null},{"id":"W2186984900","doi":"10.1007/978-3-642-29142-5_7","title":"Populations of Populations: Composing with Multiple Evolutionary Algorithms","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Fitness function; Population; Musical; Context (archaeology); Evolutionary algorithm; Genetic algorithm; Evolutionary music; Fitness approximation; Artificial intelligence; Machine learning; Algorithm; Interactive evolutionary computation; Evolutionary programming; Biology","score_opus":0.03802979222167941,"score_gpt":0.264422588407563,"score_spread":0.2263927961858836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186984900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010919099,0.0003442221,0.98408496,0.00011547646,0.000070815564,0.000052167343,0.000009133429,0.0002655889,0.0041385237],"genre_scores_gemma":[0.13968316,0.0004139736,0.85294425,0.00012519796,0.000104369334,0.00022091132,0.00004917807,0.00023777435,0.0062210676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989862,0.00036695568,0.0000656373,0.00019199443,0.0003326297,0.0000566264],"domain_scores_gemma":[0.99756384,0.0016682231,0.0001166497,0.0003581712,0.00022461735,0.000068487374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019783466,0.00079631247,0.0014947057,0.0009004171,0.0007937559,0.0018958452,0.0021434186,0.001856125,0.0049706483],"category_scores_gemma":[0.008369982,0.0011326693,0.0012116936,0.0011706103,0.0011933879,0.0035913924,0.0025112687,0.001858657,0.0007895499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012400241,0.000093148854,0.00093413953,0.00029817413,0.00019359069,0.00024124986,0.0008176577,0.56846136,0.009743946,0.08908606,0.0014861115,0.32852057],"study_design_scores_gemma":[0.000022468863,0.0000581404,0.00013554012,0.000037265432,0.000056367626,0.000098879405,0.000071552735,0.9507337,0.0019575527,0.04346824,0.0033443854,0.000015897534],"about_ca_topic_score_codex":0.0006124063,"about_ca_topic_score_gemma":0.0008858695,"teacher_disagreement_score":0.0049706483,"about_ca_system_score_codex":0.000509533,"about_ca_system_score_gemma":0.0003876551,"threshold_uncertainty_score":0.016628444},"labels":[],"label_agreement":null},{"id":"W21870292","doi":"10.1007/978-3-642-22012-8_22","title":"A Progress Measure for Explicit-State Probabilistic Model-Checkers","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"York University","funders":"Medical Research and Materiel Command","keywords":"Computer science; Measure (data warehouse); Model checking; Probabilistic logic; Property (philosophy); Theoretical computer science; Set (abstract data type); Interval (graph theory); State space; Algorithm; State (computer science); Programming language; Mathematics; Artificial intelligence; Data mining","score_opus":0.06402134570840635,"score_gpt":0.2911511280380323,"score_spread":0.22712978232962594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21870292","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.015407707,0.0003933304,0.9764214,0.00035656957,0.00013559718,0.00012262855,0.00021162203,0.0019165766,0.005034507],"genre_scores_gemma":[0.5541755,0.0005781062,0.43586686,0.00020486167,0.00050102855,0.00077167765,0.0008044191,0.0012195697,0.005877855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97616404,0.0070002475,0.0019968073,0.00401019,0.008886709,0.0019420706],"domain_scores_gemma":[0.9111642,0.055665966,0.00603324,0.01523424,0.008934767,0.0029674466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021053676,0.0031517178,0.0033174595,0.007350466,0.0020628327,0.0074672773,0.005452377,0.0031802605,0.0045736255],"category_scores_gemma":[0.07771518,0.0016678674,0.0026983556,0.004041078,0.008181167,0.016832536,0.0081658745,0.007803828,0.0013320404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004853795,0.00016053247,0.0014303601,0.00034604254,0.000108198954,0.00008733678,0.00037071275,0.13747668,0.0029948044,0.7744285,0.0031650432,0.07894644],"study_design_scores_gemma":[0.00004934518,0.00021186387,0.0003129491,0.000090111294,0.00011045479,0.000074377735,0.000052752177,0.59116846,0.0060709515,0.39918333,0.0026072704,0.000068178684],"about_ca_topic_score_codex":0.001243143,"about_ca_topic_score_gemma":0.0009940687,"teacher_disagreement_score":0.021053676,"about_ca_system_score_codex":0.0044398564,"about_ca_system_score_gemma":0.0039508916,"threshold_uncertainty_score":0.1113438},"labels":[],"label_agreement":null},{"id":"W2187039192","doi":"10.1007/978-3-642-40450-4_54","title":"Better Approximation Algorithms for Technology Diffusion","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Cascade; Algorithm; Computer science; Vertex (graph theory); Graph; Upgrade; Approximation algorithm; Combinatorics; Binary logarithm; Discrete mathematics; Mathematics; Theoretical computer science","score_opus":0.020519532145419746,"score_gpt":0.2565089051580965,"score_spread":0.23598937301267675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187039192","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.006686496,0.0038309474,0.9717747,0.0020580855,0.00058922364,0.000059227346,0.00025235472,0.00070474506,0.014044351],"genre_scores_gemma":[0.1969434,0.006667522,0.7493474,0.0011559877,0.0011608637,0.00036286502,0.0010390979,0.00095723086,0.04236567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791926,0.0008368856,0.000116691815,0.00031716222,0.0005866067,0.00022337718],"domain_scores_gemma":[0.9942075,0.003488728,0.00027969683,0.0012724542,0.0005568566,0.00019477053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035902334,0.001858112,0.0025591918,0.001928619,0.0009157142,0.003374787,0.0033632815,0.0029627488,0.014445972],"category_scores_gemma":[0.017687742,0.0008741706,0.0021327252,0.004249935,0.001750066,0.008464339,0.0023310683,0.0065187677,0.0024611696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018389722,0.00014236657,0.00042502402,0.00026782573,0.00009512608,0.000044212386,0.00014963349,0.17812756,0.0008596864,0.62880987,0.027146196,0.16374853],"study_design_scores_gemma":[0.000058418434,0.00002577986,0.00014226507,0.000044125118,0.00003540724,0.00005245877,0.000031977925,0.50265616,0.00036898025,0.48607072,0.010499257,0.00001446424],"about_ca_topic_score_codex":0.004208432,"about_ca_topic_score_gemma":0.0036502834,"teacher_disagreement_score":0.014445972,"about_ca_system_score_codex":0.0032200774,"about_ca_system_score_gemma":0.0017660555,"threshold_uncertainty_score":0.048326552},"labels":[],"label_agreement":null},{"id":"W2187340853","doi":"10.1007/978-3-642-38911-5_11","title":"FTG+PM: An Integrated Framework for Investigating Model Transformation Chains","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Model transformation; Chaining; Graph rewriting; Transformation (genetics); Formalism (music); Model-driven architecture; Software engineering; Graph; Domain model; Domain (mathematical analysis); Theoretical computer science; Process (computing); Software; Programming language; Software development; Artificial intelligence; Mathematics","score_opus":0.03068143417916601,"score_gpt":0.2648019439113187,"score_spread":0.2341205097321527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187340853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011557927,0.000054086257,0.9954165,0.00006129624,0.000010380204,0.00008054249,0.00015155446,0.0012727616,0.0017971297],"genre_scores_gemma":[0.036339596,0.00017242643,0.96053207,0.000035518846,0.000016302845,0.00025312943,0.00059799367,0.00066313555,0.0013899321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979387,0.000896205,0.00013835699,0.00028292983,0.0005936142,0.00015022077],"domain_scores_gemma":[0.9966943,0.0016642719,0.00024926206,0.0009866228,0.00031088185,0.00009459974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032026174,0.0020143373,0.001064879,0.002574157,0.0014349499,0.0036010956,0.003756033,0.0020477867,0.013103155],"category_scores_gemma":[0.009025877,0.0012009271,0.00290233,0.0029695216,0.0018450095,0.006281428,0.0044461777,0.0034988802,0.0020683291],"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.00011650219,0.00012715877,0.0016104425,0.0006939248,0.0001797426,0.0004127184,0.0006799704,0.14519502,0.0049284734,0.66180146,0.0048612123,0.17939344],"study_design_scores_gemma":[0.000034643417,0.000064646985,0.00035759687,0.00015216148,0.000109732195,0.0002177076,0.00017775709,0.53942055,0.0041096183,0.4279567,0.027353471,0.000045406512],"about_ca_topic_score_codex":0.0070182458,"about_ca_topic_score_gemma":0.0073418636,"teacher_disagreement_score":0.013103155,"about_ca_system_score_codex":0.0012006429,"about_ca_system_score_gemma":0.0025806476,"threshold_uncertainty_score":0.043834448},"labels":[],"label_agreement":null},{"id":"W218744301","doi":"10.1007/978-3-319-08019-2_36","title":"Metric-Driven Grammars and Morphogenesis (Extended Abstract)","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Plant Molecular Biology Research","field":"Agricultural and Biological 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 Calgary","funders":"","keywords":"Rule-based machine translation; Computer science; Metric (unit); Metric space; Tree-adjoining grammar; Theoretical computer science; Space (punctuation); Division (mathematics); Artificial intelligence; Mathematics; Context-free grammar; Discrete mathematics","score_opus":0.019937856107518772,"score_gpt":0.23543336632182726,"score_spread":0.2154955102143085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W218744301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015224069,0.014169747,0.79865193,0.0040592123,0.0026698525,0.00006359154,0.0011682981,0.0008816001,0.16311167],"genre_scores_gemma":[0.4317213,0.019062068,0.31326213,0.0017624423,0.0027822761,0.0003112335,0.0039886073,0.0012813136,0.22582863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997334,0.0000618674,0.000022244882,0.000068678426,0.00009538793,0.000018374505],"domain_scores_gemma":[0.9997352,0.00011396663,0.000020871557,0.00004733167,0.00006597669,0.000016606029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002901719,0.0005269377,0.0004928901,0.0006277738,0.00044011133,0.0016314681,0.00069275557,0.0007396561,0.010709145],"category_scores_gemma":[0.001081336,0.00033542226,0.0008919868,0.0016051196,0.0012705275,0.0015864545,0.0011356858,0.001303104,0.0029910326],"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.00000740146,0.000010700899,0.000079458085,0.00011367516,0.000014520185,0.00012299903,0.0001426792,0.0064642294,0.0017912672,0.92000353,0.011575051,0.059674345],"study_design_scores_gemma":[0.000004109737,0.0000089615405,0.00017615934,0.000028010918,0.0000057759767,0.00012651888,0.00001871495,0.0056867898,0.00065123517,0.94991726,0.043363407,0.00001313722],"about_ca_topic_score_codex":0.0020351463,"about_ca_topic_score_gemma":0.002351079,"teacher_disagreement_score":0.010709145,"about_ca_system_score_codex":0.00089962897,"about_ca_system_score_gemma":0.0004694204,"threshold_uncertainty_score":0.03582561},"labels":[],"label_agreement":null},{"id":"W2187552326","doi":"10.1007/978-3-319-06483-3_37","title":"Toward a Computational Model for Collective Emotion Regulation Based on Emotion Contagion Phenomenon","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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 Windsor","funders":"","keywords":"Computer science; Emotional contagion; Process (computing); Population; Computational model; Phenomenon; Affect (linguistics); Fuzzy logic; Cognitive appraisal; Regulator; Cognitive psychology; Artificial intelligence; Psychology; Cognition; Social psychology; Neuroscience; Communication","score_opus":0.02328767783303597,"score_gpt":0.26116928433271475,"score_spread":0.23788160649967877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187552326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037985303,0.00036081043,0.9367642,0.0017008632,0.00014112996,0.000059806018,0.00014790757,0.00023844349,0.02260163],"genre_scores_gemma":[0.84291834,0.0004784257,0.14610438,0.00044477396,0.00019453578,0.00037796574,0.00020169209,0.00012532595,0.009154574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997452,0.00010541059,0.000012798614,0.00006329043,0.000044813,0.000028497485],"domain_scores_gemma":[0.99923754,0.00053767726,0.00005307137,0.00006258998,0.00006820402,0.00004080186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063163316,0.00040489796,0.0008095256,0.00040288962,0.0005872323,0.0017495713,0.0019453542,0.001381199,0.0060636946],"category_scores_gemma":[0.0023584757,0.00041006948,0.0010367018,0.00048026882,0.0013474515,0.0027438723,0.0011469164,0.0019125128,0.0006945083],"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.00003654489,0.000082883,0.0009336351,0.00008435692,0.00007471713,0.0001519611,0.0005467871,0.21627519,0.0026243217,0.76485145,0.0018667103,0.012471371],"study_design_scores_gemma":[0.00000841242,0.000011103452,0.00014345502,0.0000058835903,0.000012199467,0.000020446558,0.00003371068,0.8073734,0.00012352191,0.19157596,0.0006847094,0.0000072574317],"about_ca_topic_score_codex":0.0025816972,"about_ca_topic_score_gemma":0.0019370781,"teacher_disagreement_score":0.0060636946,"about_ca_system_score_codex":0.0006978029,"about_ca_system_score_gemma":0.00070236315,"threshold_uncertainty_score":0.02028507},"labels":[],"label_agreement":null},{"id":"W2187858173","doi":"10.1007/978-3-642-33284-5_10","title":"Keeping Up with Friends’ Updates on Facebook","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; World Wide Web; Human–computer interaction; Information retrieval","score_opus":0.022084584638760694,"score_gpt":0.2936356871836124,"score_spread":0.2715511025448517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187858173","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.19788985,0.0074583725,0.07802304,0.009291791,0.004961564,0.00028492787,0.0012813963,0.0082327,0.69257635],"genre_scores_gemma":[0.5222871,0.004223937,0.03147069,0.0011024623,0.0023487364,0.00015813616,0.0014010989,0.0015382089,0.43546966],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999286,0.00022838131,0.000039685892,0.00010741352,0.00025685024,0.00008169899],"domain_scores_gemma":[0.9974782,0.00094466476,0.00022515845,0.0007336937,0.00032186642,0.00029638325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006802288,0.0005510111,0.00035142017,0.0011587748,0.002047788,0.00326111,0.0007195059,0.0009420105,0.019404154],"category_scores_gemma":[0.005547938,0.0004403982,0.00035872086,0.0010546539,0.00041004585,0.008220719,0.00247383,0.0011801774,0.012479094],"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.00011214788,0.0001462065,0.00820256,0.00026843676,0.000062809144,0.00045384065,0.013568213,0.00045342773,0.0066108718,0.01553833,0.14940092,0.8051822],"study_design_scores_gemma":[0.000013642034,0.00010663646,0.012225936,0.00030595055,0.00014751097,0.0017799902,0.007888522,0.0043603107,0.0094530545,0.010748421,0.9528788,0.00009135036],"about_ca_topic_score_codex":0.0010187184,"about_ca_topic_score_gemma":0.0035430845,"teacher_disagreement_score":0.019404154,"about_ca_system_score_codex":0.0002630065,"about_ca_system_score_gemma":0.00033276412,"threshold_uncertainty_score":0.06491333},"labels":[],"label_agreement":null},{"id":"W2187876642","doi":"10.1007/978-3-319-24912-4_15","title":"Describing Early Security Requirements Using Use Case Maps","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber 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":"Concordia University","funders":"","keywords":"Computer science; Metamodeling; Usability; Software engineering; Non-functional requirement; Software security assurance; Requirements elicitation; Functional requirement; Security testing; Security engineering; Requirements analysis; Computer security model; Software development; Software; Security service; Security information and event management; Computer security; Information security; Programming language; Software construction; Cloud computing security; Human–computer interaction","score_opus":0.09930801027156809,"score_gpt":0.2850977133612816,"score_spread":0.1857897030897135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187876642","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.023274828,0.00055577455,0.85798126,0.0011147545,0.00013914128,0.00077436736,0.0012723547,0.0037945486,0.11109298],"genre_scores_gemma":[0.25035155,0.0014312404,0.6786835,0.00043704553,0.00006916562,0.0010340424,0.003643255,0.0030905504,0.061259583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99610573,0.00085462444,0.0003465604,0.00028504425,0.0019794959,0.00042843886],"domain_scores_gemma":[0.9917446,0.0050968123,0.00041867915,0.0009952686,0.0015795935,0.0001650687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002786662,0.0016467551,0.00049185613,0.0042027566,0.0015122397,0.007204039,0.002088964,0.002433281,0.016325066],"category_scores_gemma":[0.011226741,0.0016056502,0.0014172015,0.0027065086,0.001665014,0.0084518185,0.0029930964,0.0041015064,0.004805539],"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.00015421116,0.00026959795,0.0025773998,0.0010575954,0.000041725198,0.0056710537,0.011144859,0.02685603,0.023101462,0.6561486,0.018287601,0.25468987],"study_design_scores_gemma":[0.000033670538,0.00010418484,0.0017278359,0.0013000799,0.00009563894,0.0035299014,0.0043017315,0.100706644,0.040830314,0.27113065,0.5760904,0.00014903978],"about_ca_topic_score_codex":0.0068529528,"about_ca_topic_score_gemma":0.0067550666,"teacher_disagreement_score":0.016325066,"about_ca_system_score_codex":0.0022559317,"about_ca_system_score_gemma":0.0021786825,"threshold_uncertainty_score":0.054612756},"labels":[],"label_agreement":null},{"id":"W2188063272","doi":"10.1007/978-3-642-27901-0_3","title":"Automated Verification of Block Cipher Modes of Operation, an Improved Method","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Assertion; CBC-MAC; Block cipher; Block cipher mode of operation; Set (abstract data type); Theoretical computer science; Block (permutation group theory); Cipher; Chaining; Programming language; Encryption; Algorithm; Computer security; Mathematics","score_opus":0.025241393100882834,"score_gpt":0.3130831843726585,"score_spread":0.2878417912717756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188063272","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.014236873,0.00014915719,0.97853285,0.00006439984,0.00006945251,0.00013616387,0.0001739602,0.0037535415,0.0028835556],"genre_scores_gemma":[0.3938052,0.00018126673,0.5976711,0.000111478,0.000085852625,0.00026955808,0.0004954583,0.000521543,0.00685851],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996828,0.00068302825,0.00020431023,0.0006322054,0.0013473395,0.00030517855],"domain_scores_gemma":[0.99439126,0.0021384226,0.00027760857,0.0023177331,0.00080779183,0.00006726648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011241672,0.0011942345,0.0012347156,0.0014975386,0.00078048237,0.0017328637,0.0018729887,0.0011352018,0.006936319],"category_scores_gemma":[0.0048988555,0.0008636227,0.0013992098,0.0006885999,0.0013636753,0.0032182017,0.0024268955,0.0018096243,0.0028514888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014934696,0.00029115996,0.001826757,0.00049655384,0.00023567474,0.00051532924,0.0003489251,0.06388826,0.17914093,0.1496659,0.008739632,0.59335744],"study_design_scores_gemma":[0.00025006876,0.0004203657,0.0010541992,0.000089280904,0.00015425136,0.0007185463,0.000057546808,0.7288391,0.121016,0.13379644,0.013491838,0.00011233761],"about_ca_topic_score_codex":0.0010673038,"about_ca_topic_score_gemma":0.0012541243,"teacher_disagreement_score":0.006936319,"about_ca_system_score_codex":0.0006626144,"about_ca_system_score_gemma":0.0014300919,"threshold_uncertainty_score":0.023204267},"labels":[],"label_agreement":null},{"id":"W2188082489","doi":"10.1007/978-3-642-41071-0_14","title":"Formal Analysis of Memory Contention in a Multiprocessor System","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; HOL; Multiprocessing; Parallel computing; Scalability; Automated theorem proving; Distributed memory; Theoretical computer science; Shared memory; Programming language; Operating system","score_opus":0.02587207319668973,"score_gpt":0.26855053189223715,"score_spread":0.24267845869554744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188082489","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.024542412,0.0005850145,0.9648679,0.00055552105,0.00012529951,0.00008513572,0.000084376974,0.00054228725,0.008611922],"genre_scores_gemma":[0.72359717,0.0007430459,0.2661497,0.0002811272,0.00021643592,0.00026527036,0.00021603213,0.00037776984,0.008153423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982876,0.00048363354,0.00011739905,0.00016308372,0.00068488484,0.00026328623],"domain_scores_gemma":[0.9959194,0.0029004388,0.00023080104,0.0004288089,0.00043716092,0.00008345582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023771035,0.00077480637,0.00060158875,0.0012126518,0.0008998815,0.0021293387,0.0021065,0.0010521199,0.0043487838],"category_scores_gemma":[0.0060654883,0.0006922042,0.0013279244,0.0007698719,0.0031934648,0.0036301906,0.0016243273,0.00232523,0.00037929055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104318315,0.00010831489,0.00060456485,0.00024067405,0.000046118417,0.00032714847,0.00034329202,0.104911,0.010905825,0.8610093,0.0013213854,0.020078173],"study_design_scores_gemma":[0.000041358533,0.000048279253,0.00024000774,0.00006870509,0.00004185855,0.00017817822,0.0000849815,0.50961757,0.0065540355,0.47725984,0.005833034,0.000032063712],"about_ca_topic_score_codex":0.0020814687,"about_ca_topic_score_gemma":0.0022127882,"teacher_disagreement_score":0.0043487838,"about_ca_system_score_codex":0.0017052134,"about_ca_system_score_gemma":0.0018540977,"threshold_uncertainty_score":0.014548123},"labels":[],"label_agreement":null},{"id":"W2188097151","doi":"","title":"Magnetothermoelastic Problem of a Half-Space Subjected to Moving Heat Source and Moving Load","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Thermoelastic and Magnetoelastic Phenomena","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Constant (computer programming); Mathematical analysis; Space (punctuation); Thermal; Mechanics; Physics; Thermodynamics; Computer science","score_opus":0.004393761528327102,"score_gpt":0.18932089272228134,"score_spread":0.18492713119395424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188097151","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.70209926,0.0020951205,0.1521913,0.009882644,0.00078833726,0.00034883225,0.001248216,0.0003503225,0.13099608],"genre_scores_gemma":[0.93185747,0.0005704155,0.007087338,0.00058679236,0.00041676764,0.00012741303,0.00033222104,0.0001629451,0.058858648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962544,0.00012716951,0.0000138570695,0.00007079811,0.00009500117,0.0000677868],"domain_scores_gemma":[0.9991109,0.0005031967,0.00010908269,0.00003783274,0.00007336817,0.00016559257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973347,0.00091145706,0.0012898939,0.0013457752,0.0013253847,0.0024071364,0.001676433,0.0048815683,0.011788447],"category_scores_gemma":[0.002363134,0.00095797953,0.00080205686,0.0007965242,0.0038424763,0.0019007918,0.0024411248,0.0014521325,0.000677861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010151447,0.0004605649,0.0021299005,0.00047004118,0.00019906803,0.003804073,0.00051658053,0.87384576,0.018185562,0.08605058,0.0039080493,0.009414741],"study_design_scores_gemma":[0.00012814657,0.00015902579,0.002348675,0.000025460096,0.000047099973,0.0003101518,0.00026977697,0.9807552,0.0011062205,0.013025044,0.0017759451,0.000049232192],"about_ca_topic_score_codex":0.0078064688,"about_ca_topic_score_gemma":0.0039718603,"teacher_disagreement_score":0.011788447,"about_ca_system_score_codex":0.0011527989,"about_ca_system_score_gemma":0.001538561,"threshold_uncertainty_score":0.03943634},"labels":[],"label_agreement":null},{"id":"W2188407888","doi":"10.1007/978-3-642-25264-8_10","title":"Towards a Model Based Approach for Integration Testing","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Integration testing; Unit testing; Computer science; Unified Modeling Language; Test (biology); Test case; Model-based testing; Programming language; Software engineering; Software; Machine learning","score_opus":0.05176971646638298,"score_gpt":0.2523704830172054,"score_spread":0.2006007665508224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188407888","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.00089488423,0.000067547495,0.9963387,0.00014052246,0.000021111191,0.000058832153,0.000025756777,0.00094005937,0.0015125638],"genre_scores_gemma":[0.046110995,0.00020985908,0.9497943,0.00024088747,0.000035298235,0.00026926785,0.00022248195,0.000497836,0.0026190903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939944,0.0017593128,0.0004497117,0.0005002301,0.0029795808,0.0003167106],"domain_scores_gemma":[0.99396634,0.0027980036,0.00027648537,0.0016582446,0.0011583393,0.00014258725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142902,0.0017170585,0.0014464746,0.0023606408,0.00090594956,0.0038518985,0.0054341517,0.0028625585,0.0057989657],"category_scores_gemma":[0.011113504,0.0019250454,0.002918675,0.0015467581,0.0020943775,0.0057193306,0.004400593,0.005435005,0.0016493481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015522429,0.00055470236,0.0016972645,0.000613373,0.00029481645,0.0006464174,0.00060996576,0.18244259,0.013919505,0.44405258,0.00797306,0.3470405],"study_design_scores_gemma":[0.000045526285,0.00009069046,0.00022641533,0.00017154262,0.00013526081,0.00031829276,0.00008144441,0.69169253,0.0064426726,0.287167,0.013585264,0.00004337062],"about_ca_topic_score_codex":0.0037294517,"about_ca_topic_score_gemma":0.0063628983,"teacher_disagreement_score":0.0057989657,"about_ca_system_score_codex":0.0015804125,"about_ca_system_score_gemma":0.0025079278,"threshold_uncertainty_score":0.021910012},"labels":[],"label_agreement":null},{"id":"W2188416243","doi":"10.1007/3-540-45007-6_32","title":"Boolean Grammars","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Tree-adjoining grammar; L-attributed grammar; Indexed grammar; Computer science; Context-sensitive grammar; Phrase structure grammar; Context-free grammar; Programming language; Rule-based machine translation; Definite clause grammar; Extended Affix Grammar; Parsing; Theoretical computer science; Artificial intelligence","score_opus":0.01178501727695145,"score_gpt":0.22222122782973502,"score_spread":0.21043621055278358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188416243","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.006044461,0.0022467193,0.11705822,0.0021244101,0.00053084735,0.000068587455,0.0013286639,0.0015662588,0.86903185],"genre_scores_gemma":[0.22958559,0.0043376056,0.058960076,0.0012264205,0.0005209479,0.00021662787,0.004373475,0.0013694749,0.69940984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997441,0.000047714377,0.000014233143,0.000058992264,0.00010593775,0.000029050316],"domain_scores_gemma":[0.99981457,0.00006671756,0.000007831898,0.000048041205,0.000044667115,0.000018081942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021642826,0.000556324,0.00046167604,0.0008733627,0.0010033771,0.002409471,0.00066609104,0.00058140326,0.061506566],"category_scores_gemma":[0.0009159427,0.00036467196,0.0004632231,0.0012360405,0.0013746624,0.003012176,0.0011841541,0.0013709924,0.019083442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008773406,0.00001010227,0.000038093844,0.000048668895,0.0000028206978,0.00003479254,0.00015178509,0.0002673264,0.00077858876,0.93642926,0.02180097,0.04042889],"study_design_scores_gemma":[0.000007134486,0.000005005091,0.00006137219,0.000027482993,0.000006402097,0.00012030586,0.00006118781,0.0008458603,0.0010657299,0.7760475,0.2217449,0.0000070999918],"about_ca_topic_score_codex":0.0012601046,"about_ca_topic_score_gemma":0.0014866982,"teacher_disagreement_score":0.061506566,"about_ca_system_score_codex":0.0011054112,"about_ca_system_score_gemma":0.0006417393,"threshold_uncertainty_score":0.20576},"labels":[],"label_agreement":null},{"id":"W2188524736","doi":"10.1007/978-3-319-10160-6_23","title":"Building Smart Cubes for Reliable and Faster Access to Data","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Online analytical processing; Computer science; Materialized view; Data warehouse; Partition (number theory); Data cube; Set (abstract data type); Cube (algebra); Data mining; Computation; Query optimization; Information retrieval; Theoretical computer science; View; Algorithm; Mathematics; Programming language","score_opus":0.050541103832412414,"score_gpt":0.31498475450503033,"score_spread":0.26444365067261794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188524736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015113296,0.0011654106,0.9711354,0.00077041605,0.0002743674,0.00014491082,0.0011349758,0.006231845,0.0040294067],"genre_scores_gemma":[0.13261604,0.0016695885,0.85576296,0.0004349546,0.0001343728,0.00037846423,0.0038326231,0.00061108463,0.004559933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986759,0.00025905253,0.00010711611,0.00017089702,0.00065132737,0.00013564034],"domain_scores_gemma":[0.9975904,0.0008561546,0.00015980231,0.00081906875,0.00047355716,0.00010097308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013040731,0.0010767396,0.0010731815,0.0010994336,0.00052420894,0.0018552975,0.0022496434,0.0009819841,0.008879917],"category_scores_gemma":[0.0053997915,0.0007859456,0.00095256104,0.0023935498,0.0009368396,0.004735949,0.0046106377,0.001691238,0.0028145702],"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.0008492309,0.00020814572,0.0028084107,0.0010654962,0.00028516806,0.0005689408,0.0005714918,0.1162644,0.048733883,0.10251914,0.08352416,0.64260167],"study_design_scores_gemma":[0.000084359635,0.00022495871,0.00066310284,0.000126106,0.00007931319,0.0005094869,0.00039656615,0.6653768,0.043318756,0.2223083,0.0668383,0.000074052776],"about_ca_topic_score_codex":0.0014502689,"about_ca_topic_score_gemma":0.002023188,"teacher_disagreement_score":0.008879917,"about_ca_system_score_codex":0.00042372456,"about_ca_system_score_gemma":0.0008469195,"threshold_uncertainty_score":0.0297063},"labels":[],"label_agreement":null},{"id":"W2188887891","doi":"10.1007/978-3-642-38899-6_52","title":"Atlases of Cardiac Fiber Differential Geometry","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"McGill University","funders":"","keywords":"Helicoid; Normalization (sociology); Curvature; Computer science; Artificial intelligence; Geometry; Algorithm; Mathematics; Pattern recognition (psychology)","score_opus":0.03304658311309931,"score_gpt":0.30185528153546654,"score_spread":0.2688086984223672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188887891","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036171523,0.002071896,0.9649729,0.00025857103,0.00017550388,0.00006397794,0.0013009856,0.0014769686,0.026061926],"genre_scores_gemma":[0.09825336,0.008396833,0.8560406,0.00019370143,0.00035663965,0.00016254169,0.0030157347,0.0012525296,0.03232811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998666,0.000021979322,0.000009283989,0.000032551397,0.00005901834,0.000010511744],"domain_scores_gemma":[0.99973184,0.00007709754,0.000021520345,0.00005946884,0.00008937775,0.00002060487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359911,0.00061204424,0.00041857458,0.0015605399,0.00032574096,0.0016681325,0.00075307034,0.00056418753,0.009774124],"category_scores_gemma":[0.000969043,0.00048933417,0.00040070005,0.0014031142,0.0004694432,0.0010458376,0.00077423954,0.0011530344,0.003946715],"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.000059522317,0.000016830014,0.0006745969,0.00045620571,0.000041630024,0.00033866992,0.0003832255,0.040597305,0.014502821,0.38675693,0.040244084,0.51592815],"study_design_scores_gemma":[0.000022801549,0.00006816477,0.002003192,0.0002744932,0.000049238755,0.003898559,0.0001828662,0.20920706,0.016399745,0.35244662,0.4153594,0.000087805114],"about_ca_topic_score_codex":0.0014057403,"about_ca_topic_score_gemma":0.0023077137,"teacher_disagreement_score":0.009774124,"about_ca_system_score_codex":0.00043169796,"about_ca_system_score_gemma":0.00052325224,"threshold_uncertainty_score":0.032697678},"labels":[],"label_agreement":null},{"id":"W2189221899","doi":"10.1007/978-3-319-05579-4_47","title":"Frabjous: A Declarative Domain-Specific Language for Agent-Based Modeling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Modeling language; Programming language; Domain (mathematical analysis); Declarative programming; Software engineering; Software; Artificial intelligence; Human–computer interaction; Programming paradigm; Inductive programming","score_opus":0.032567559592327947,"score_gpt":0.2633704460378559,"score_spread":0.230802886445528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189221899","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.00054022647,0.00014532726,0.98328584,0.00016240236,0.00006787198,0.00007187467,0.0010895508,0.009431934,0.0052050566],"genre_scores_gemma":[0.037097923,0.0009085378,0.9316986,0.0006796255,0.0000866453,0.0007039727,0.0073090526,0.007422784,0.014092821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.00029216774,0.00017324253,0.00015868577,0.000351246,0.000093817755],"domain_scores_gemma":[0.9989317,0.00054750167,0.000078705954,0.0002311012,0.000153597,0.000057354402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173403,0.0016134628,0.00104315,0.0011328436,0.0009917619,0.003896686,0.004235125,0.0017909885,0.01476715],"category_scores_gemma":[0.0036197896,0.0016449733,0.0022951947,0.0012452945,0.0014698949,0.004418156,0.0030902575,0.004385321,0.0064143306],"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.0001474163,0.00009605449,0.00044314965,0.0012703082,0.00010122589,0.00045901412,0.0016221091,0.039005887,0.0078094266,0.75595224,0.067125455,0.12596765],"study_design_scores_gemma":[0.000061938714,0.000036908936,0.00014534271,0.00033152374,0.000074441086,0.0005293785,0.00014434374,0.12329719,0.009998985,0.20953788,0.65575236,0.00008977219],"about_ca_topic_score_codex":0.0042784424,"about_ca_topic_score_gemma":0.005868896,"teacher_disagreement_score":0.01476715,"about_ca_system_score_codex":0.0008559781,"about_ca_system_score_gemma":0.0018607094,"threshold_uncertainty_score":0.049400985},"labels":[],"label_agreement":null},{"id":"W2189936489","doi":"10.1007/978-3-642-38553-7_15","title":"Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Computer science; Homomorphic encryption; Mathematical proof; Multiplication (music); Protocol (science); Theoretical computer science; Arithmetic; Covert; Commitment scheme; Encryption; Cryptography; Algorithm; Computer security; Mathematics; Combinatorics","score_opus":0.018080736637273196,"score_gpt":0.24687782885867943,"score_spread":0.22879709222140623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189936489","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.11897031,0.0015806492,0.75234336,0.004462316,0.00076175004,0.00036658152,0.0005666744,0.001637774,0.11931066],"genre_scores_gemma":[0.88581353,0.0005776901,0.0863135,0.00047819645,0.0003839292,0.00030475968,0.00037272126,0.00028476736,0.025470853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969062,0.00066623074,0.0001280138,0.000497456,0.0012581256,0.0005439739],"domain_scores_gemma":[0.99711347,0.0014552685,0.00013590633,0.0010424947,0.00016161485,0.000091228576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961583,0.00095164124,0.0014987777,0.00081200484,0.0017064072,0.0040159556,0.0018180566,0.002220858,0.009122844],"category_scores_gemma":[0.0053626704,0.0006020037,0.0014274475,0.0011585883,0.001800758,0.0057491427,0.005055523,0.004038676,0.002431364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004783943,0.00014413058,0.00028234147,0.00020995087,0.00009943772,0.00019133116,0.0001987032,0.029701458,0.01412824,0.8701448,0.009678528,0.07474266],"study_design_scores_gemma":[0.000068515,0.00008063007,0.00018626972,0.000051027877,0.00004995146,0.00017261488,0.000029936213,0.1638694,0.011218723,0.81795853,0.0062868795,0.00002756504],"about_ca_topic_score_codex":0.00017307945,"about_ca_topic_score_gemma":0.0003405837,"teacher_disagreement_score":0.009122844,"about_ca_system_score_codex":0.0017378242,"about_ca_system_score_gemma":0.0011046034,"threshold_uncertainty_score":0.030518949},"labels":[],"label_agreement":null},{"id":"W2190165019","doi":"10.1007/978-3-642-29142-5_2","title":"Aesthetic 3D Model Evolution","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Computer science; Realm; Genetic programming; Evolutionary algorithm; Artificial intelligence; Entropy (arrow of time); Normality; Machine learning; Theoretical computer science; Mathematics; Statistics","score_opus":0.016613435031731957,"score_gpt":0.237412830465703,"score_spread":0.22079939543397104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190165019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015771247,0.0009744894,0.81991524,0.0005733141,0.0006904249,0.00008556541,0.0003321025,0.002222037,0.15943554],"genre_scores_gemma":[0.38777527,0.0019892522,0.44877774,0.00062043074,0.00023077532,0.00021925148,0.0011978114,0.0026719726,0.15651754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.000023820416,0.0000047765066,0.000028431297,0.00011202217,0.0000145449585],"domain_scores_gemma":[0.9998667,0.00003715095,0.000006406726,0.00005217016,0.0000230529,0.000014528041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022367277,0.0005554429,0.00043812787,0.00062188896,0.00035137328,0.0012169644,0.00089946354,0.00092387316,0.02579125],"category_scores_gemma":[0.00066550664,0.00044841625,0.00082622975,0.00044303722,0.00068373594,0.00079955277,0.0018204369,0.0011213196,0.003397778],"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.00009109501,0.000045612687,0.00038678828,0.00029195656,0.000068031964,0.00024973904,0.00024511732,0.3193453,0.028831553,0.33526376,0.031088136,0.2840929],"study_design_scores_gemma":[0.00003566471,0.000074690484,0.0003707201,0.00008442493,0.000029877263,0.00085695524,0.000057778074,0.6858844,0.00751698,0.1647949,0.14024325,0.000050289305],"about_ca_topic_score_codex":0.0004774566,"about_ca_topic_score_gemma":0.00089598435,"teacher_disagreement_score":0.02579125,"about_ca_system_score_codex":0.0004611401,"about_ca_system_score_gemma":0.0002051962,"threshold_uncertainty_score":0.086280346},"labels":[],"label_agreement":null},{"id":"W2192492580","doi":"10.1007/978-3-662-44753-6_27","title":"Reconstructing Mutational History in Multiply Sampled Tumors Using Perfect Phylogeny Mixtures","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cancer Genomics and Diagnostics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Phylogenetics; Algorithm; Biology; Genetics","score_opus":0.017779739836329994,"score_gpt":0.23938476007445558,"score_spread":0.2216050202381256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192492580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33919188,0.000978578,0.65619886,0.00038230733,0.000050434333,0.000033734563,0.0009180877,0.0011277277,0.0011184209],"genre_scores_gemma":[0.80778086,0.00041021,0.1862043,0.00011148479,0.00009457504,0.00005581679,0.0025206245,0.00039980022,0.002422276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.0002351952,0.000036380996,0.0002723869,0.00010873838,0.000065919456],"domain_scores_gemma":[0.9943581,0.004222714,0.0003704384,0.0006619258,0.00017517405,0.00021163805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00230458,0.0006418628,0.00083442806,0.0013100522,0.0006127762,0.0013374252,0.001837395,0.0017006511,0.0016950526],"category_scores_gemma":[0.008486198,0.0014883681,0.0016539957,0.0011836337,0.0011442809,0.0023529353,0.0019372855,0.001850188,0.00064330874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096446514,0.000087190965,0.040782347,0.0002557436,0.00045396635,0.0006057268,0.0006917092,0.7681014,0.023628654,0.0275354,0.0021136166,0.13477975],"study_design_scores_gemma":[0.000016329841,0.000037555892,0.0035100516,0.000014115947,0.000051173865,0.0002454863,0.00004315243,0.9631499,0.003933565,0.028106187,0.0008675939,0.000024751353],"about_ca_topic_score_codex":0.0021208215,"about_ca_topic_score_gemma":0.0034894429,"teacher_disagreement_score":0.00230458,"about_ca_system_score_codex":0.00066022563,"about_ca_system_score_gemma":0.00038863902,"threshold_uncertainty_score":0.012187958},"labels":[],"label_agreement":null},{"id":"W2192545815","doi":"10.1007/978-3-319-01928-4_8","title":"3-Color Bounded Patterned Self-assembly","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Computer science; Bounded function; Computer graphics (images); Mathematics","score_opus":0.008362530833501284,"score_gpt":0.2481691635486593,"score_spread":0.23980663271515804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192545815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25012743,0.002644249,0.46248013,0.00044766386,0.00096696446,0.000107069456,0.00043499732,0.0031861921,0.2796054],"genre_scores_gemma":[0.7238288,0.0012174917,0.1526683,0.000468475,0.000080757,0.00015977479,0.0004906456,0.0006583879,0.12042738],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999031,0.000008463141,0.0000036070744,0.000021415495,0.000042690768,0.00002075736],"domain_scores_gemma":[0.99993825,0.000012780641,0.000007487429,0.000014997862,0.000013139582,0.000013353413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006508611,0.00043734192,0.00027269823,0.00029246605,0.0002718828,0.0006858217,0.0005244736,0.00045711218,0.006420588],"category_scores_gemma":[0.00010450461,0.00031056313,0.00028528747,0.00018731975,0.0004281676,0.00031388088,0.0006836642,0.0004184894,0.002113165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013723233,0.00006814595,0.00022716573,0.00028351299,0.000023067629,0.0004554355,0.00018006915,0.023130368,0.62345546,0.26584303,0.0094015505,0.07679506],"study_design_scores_gemma":[0.00007315505,0.00026788548,0.001085786,0.00009542156,0.00003088053,0.0012921172,0.0000981926,0.32743698,0.4335357,0.14370269,0.09226146,0.00011971466],"about_ca_topic_score_codex":0.00026106284,"about_ca_topic_score_gemma":0.00046018852,"teacher_disagreement_score":0.006420588,"about_ca_system_score_codex":0.00029157347,"about_ca_system_score_gemma":0.0001435959,"threshold_uncertainty_score":0.02147901},"labels":[],"label_agreement":null},{"id":"W2196446647","doi":"10.1007/978-3-642-00955-6_20","title":"Adaptive Read Validation in Time-Based Software Transactional Memory","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Software; Programming language; Database transaction","score_opus":0.01510676393870801,"score_gpt":0.2296993702201134,"score_spread":0.21459260628140542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196446647","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.16490424,0.0018683661,0.8225173,0.00029073795,0.0002802342,0.00010921217,0.00008399493,0.0050509092,0.004894898],"genre_scores_gemma":[0.90649766,0.0003140937,0.08638278,0.00012890859,0.00007015352,0.000082685336,0.00011656097,0.0004952247,0.0059120334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969151,0.0009265452,0.00025585917,0.00044467274,0.0011328065,0.00032503804],"domain_scores_gemma":[0.9858466,0.007528603,0.00083700777,0.0040978077,0.0014919427,0.00019802338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031275144,0.0005645746,0.0008900626,0.00061571476,0.0007252535,0.0018230052,0.0031138787,0.00142964,0.0027819208],"category_scores_gemma":[0.013086147,0.0007064611,0.0004790524,0.0006989677,0.0013700221,0.003351914,0.001596812,0.0016859551,0.00049124047],"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.0032331655,0.00045468519,0.0066224225,0.00058840855,0.00014387458,0.0008210256,0.0013297121,0.22689173,0.090287544,0.09959928,0.0052600633,0.5647681],"study_design_scores_gemma":[0.00007696687,0.00030770604,0.0007362916,0.000062420564,0.00007709013,0.00032079563,0.00011720275,0.8881759,0.06019001,0.045779068,0.0041042008,0.00005234223],"about_ca_topic_score_codex":0.00089669577,"about_ca_topic_score_gemma":0.001058159,"teacher_disagreement_score":0.0031275144,"about_ca_system_score_codex":0.0006849643,"about_ca_system_score_gemma":0.0010394754,"threshold_uncertainty_score":0.01654005},"labels":[],"label_agreement":null},{"id":"W2198515109","doi":"10.1007/978-3-319-24021-3_9","title":"Simplification of Cylindrical Algebraic Formulas","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Heuristic; Algebraic number; Transformation (genetics); Computer science; Set (abstract data type); Algebra over a field; Decomposition; Algorithm; Mathematics; Artificial intelligence; Pure mathematics; Mathematical analysis; Programming language","score_opus":0.02759925014916455,"score_gpt":0.2626467179261751,"score_spread":0.23504746777701055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198515109","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071650885,0.0057352534,0.4126221,0.0014785326,0.00095016515,0.00015893109,0.0009493563,0.0015024858,0.50495225],"genre_scores_gemma":[0.7184849,0.0074129896,0.14615992,0.0005162538,0.00086832594,0.00016396133,0.0031784906,0.0013155988,0.121899515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00012930749,0.000036597095,0.00008257845,0.00032856042,0.00008617309],"domain_scores_gemma":[0.9995839,0.0001581866,0.000025965073,0.00011692438,0.000092388735,0.000022710663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045564893,0.0007240832,0.00096116663,0.0012556148,0.001100548,0.0018112899,0.0011427657,0.00038946126,0.010850362],"category_scores_gemma":[0.001932373,0.00052065076,0.0012055334,0.0018344073,0.0018749125,0.0034634008,0.0018120464,0.0023922771,0.003080589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004017646,0.0000132440655,0.00006616086,0.00013633036,0.0000124289345,0.00009120722,0.00032598208,0.001658688,0.002542229,0.9334024,0.008512835,0.053198323],"study_design_scores_gemma":[0.000020348029,0.000025799533,0.00027486033,0.00004853253,0.00002638527,0.00022853035,0.00010672703,0.0064894673,0.0046749744,0.88751453,0.10056873,0.000021043074],"about_ca_topic_score_codex":0.0014149824,"about_ca_topic_score_gemma":0.0015083604,"teacher_disagreement_score":0.010850362,"about_ca_system_score_codex":0.0012468043,"about_ca_system_score_gemma":0.0005292781,"threshold_uncertainty_score":0.036298096},"labels":[],"label_agreement":null},{"id":"W2198975870","doi":"10.1007/978-3-319-22747-4_9","title":"Exploiting the Use of Wikis to Support Collaborative Writing: A Case Study of an Undergraduate Computer Science Class","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Collaborative writing; Argumentation theory; Class (philosophy); Perception; Mathematics education; Collaborative learning; Computer science; Quality (philosophy); Psychology","score_opus":0.09745425929887302,"score_gpt":0.36806149253061804,"score_spread":0.270607233231745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198975870","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.9785297,0.000265191,0.0045711407,0.0008910449,0.000059385235,0.00020053225,0.000064814296,0.0001638369,0.01525438],"genre_scores_gemma":[0.97093594,0.00040004338,0.01566113,0.00021781358,0.000038047598,0.00015070163,0.00009782691,0.00011494312,0.01238357],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99544334,0.002734643,0.0001940561,0.00040588426,0.00078236836,0.0004397363],"domain_scores_gemma":[0.97729003,0.016702902,0.0013186092,0.0013061884,0.0010113551,0.0023709761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048012715,0.0007470495,0.00050265784,0.0015153576,0.007410554,0.0059900633,0.002611353,0.002639926,0.0024280883],"category_scores_gemma":[0.018572448,0.00045832165,0.00043297617,0.0014641944,0.0026605711,0.0038674118,0.0051717237,0.0020313738,0.0010054015],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037345593,0.0059796926,0.02254718,0.0008512971,0.00007826949,0.016325327,0.7210408,0.0007336954,0.011517071,0.004593065,0.0062818057,0.20967838],"study_design_scores_gemma":[0.00023071334,0.0027118477,0.03634135,0.0007342771,0.00019563625,0.015513676,0.7447487,0.008389108,0.0154169835,0.006417263,0.16905268,0.00024773867],"about_ca_topic_score_codex":0.0026143505,"about_ca_topic_score_gemma":0.008763807,"teacher_disagreement_score":0.007410554,"about_ca_system_score_codex":0.0010882615,"about_ca_system_score_gemma":0.002497185,"threshold_uncertainty_score":0.025391877},"labels":[],"label_agreement":null},{"id":"W2199284227","doi":"10.1007/978-3-319-10470-6_66","title":"Variational Bayesian Electrophysiological Imaging of Myocardial Infarction","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","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":"Queen Elizabeth II Health Sciences Centre","funders":"Dalhousie University; National Science Foundation","keywords":"Computer science; Bayesian probability; Regularization (linguistics); Prior probability; Data set; Pattern recognition (psychology); Inverse problem; Myocardial infarction; Divergence (linguistics); Artificial intelligence; Cardiology; Medicine; Mathematics","score_opus":0.004996498294180172,"score_gpt":0.23866851647546708,"score_spread":0.2336720181812869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199284227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12334324,0.0031392027,0.8676641,0.0024298097,0.000047024856,0.000035833044,0.0003134914,0.00014417172,0.0028830527],"genre_scores_gemma":[0.9005143,0.0028064137,0.09168318,0.0002563098,0.00019421522,0.000054636654,0.0004368784,0.00009496044,0.0039590253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998271,0.00008492253,0.000008408461,0.000027447008,0.000028252074,0.000023871313],"domain_scores_gemma":[0.9992661,0.0005531923,0.000058864043,0.000029658886,0.00004939823,0.000042783315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088218594,0.0003495554,0.0006260059,0.0003826596,0.00016380922,0.0012036029,0.0008098948,0.0009852096,0.0008786304],"category_scores_gemma":[0.0047679306,0.00064650294,0.0004253095,0.00036434893,0.00046533768,0.00077722745,0.00085509766,0.00086632516,0.00014341144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005559615,0.000100965604,0.009030983,0.0002721855,0.00020455959,0.0006833783,0.00022959369,0.7070606,0.015952563,0.09145495,0.0046673757,0.16978687],"study_design_scores_gemma":[0.000019427369,0.00001585629,0.0019596384,0.000018420971,0.00001545217,0.00016098922,0.000015831089,0.97147703,0.0006453204,0.025094826,0.00056405296,0.000013239586],"about_ca_topic_score_codex":0.0051404326,"about_ca_topic_score_gemma":0.0062426194,"teacher_disagreement_score":0.0051404326,"about_ca_system_score_codex":0.00046388083,"about_ca_system_score_gemma":0.0005760693,"threshold_uncertainty_score":0.0102210045},"labels":[],"label_agreement":null},{"id":"W2200387973","doi":"10.1007/978-3-642-30950-2_1","title":"Implicit Strategies for Intelligent Tutoring Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Subliminal stimuli; Cognition; Intelligent tutoring system; Priming (agriculture); Human–computer interaction; Psychological intervention; Cognitive psychology; Psychology","score_opus":0.03615354413109114,"score_gpt":0.2715253767133938,"score_spread":0.23537183258230263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200387973","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.034781154,0.0063241506,0.9131577,0.0007889967,0.00024811827,0.000112896996,0.00012480348,0.0008413998,0.04362084],"genre_scores_gemma":[0.7136044,0.0028420535,0.24757804,0.0001294688,0.0001785208,0.0003366576,0.00032179253,0.00022238235,0.034786664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933237,0.00029066796,0.000055790788,0.00007517014,0.00019971315,0.000046404613],"domain_scores_gemma":[0.99860173,0.0009103155,0.00005759489,0.00018093533,0.00020736347,0.0000419897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007972,0.00074251357,0.0005659779,0.00033112927,0.00037428894,0.0022291627,0.0013596034,0.001185696,0.0076024835],"category_scores_gemma":[0.005773528,0.00039409765,0.0002940065,0.00035802135,0.0008761462,0.003077897,0.0011816077,0.001534858,0.0013969503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021928377,0.00015242313,0.000434972,0.0004831073,0.000046960893,0.00012204869,0.00077326625,0.03218796,0.0074154167,0.55301815,0.005012947,0.40013352],"study_design_scores_gemma":[0.00011815143,0.00015962246,0.0005102738,0.00012948607,0.000050263472,0.00015706175,0.00020096704,0.27884114,0.0075781234,0.6848668,0.027342226,0.00004586726],"about_ca_topic_score_codex":0.0007943265,"about_ca_topic_score_gemma":0.0011672471,"teacher_disagreement_score":0.0076024835,"about_ca_system_score_codex":0.0006600347,"about_ca_system_score_gemma":0.0005002288,"threshold_uncertainty_score":0.025432825},"labels":[],"label_agreement":null},{"id":"W2200988010","doi":"10.1007/978-3-642-40104-6_20","title":"The Art of Shaving Logs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Affine transformation; Point (geometry); Set (abstract data type); Selection (genetic algorithm); Theoretical computer science; Matrix (chemical analysis); Table (database); Degeneracy (biology); Algorithm; Matrix multiplication; Multiplication (music); Time complexity; Combinatorics; Mathematics; Artificial intelligence; Data mining; Programming language","score_opus":0.012593554849907365,"score_gpt":0.22457541660283803,"score_spread":0.21198186175293066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200988010","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.014896242,0.018938107,0.34504667,0.042558398,0.004096861,0.000093622366,0.00094933016,0.0028716393,0.5705491],"genre_scores_gemma":[0.53896886,0.016352516,0.13153017,0.009476623,0.0050458093,0.0003877044,0.00088481995,0.0017522929,0.29560116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983423,0.00055841525,0.00008205726,0.0002854898,0.0005943834,0.00013740735],"domain_scores_gemma":[0.99565434,0.0023217034,0.000118252865,0.0013426854,0.00043039565,0.00013271735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019756171,0.0009376447,0.0009273933,0.0015046477,0.0033810218,0.0069525936,0.001609896,0.0024196808,0.024617907],"category_scores_gemma":[0.010646281,0.0008228344,0.0007673936,0.0017965442,0.011841476,0.025735969,0.004218606,0.0073636156,0.00811932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022218164,0.000008887693,0.00006531515,0.000046383444,0.000003745038,0.00001656138,0.00030913937,0.0004042329,0.00017479139,0.96236515,0.015623446,0.020960268],"study_design_scores_gemma":[0.0000061085684,0.0000062249815,0.000026834621,0.00004502692,0.0000029432952,0.000048403723,0.0001133128,0.0011627689,0.00029296154,0.94950026,0.048785247,0.0000098476185],"about_ca_topic_score_codex":0.0012694545,"about_ca_topic_score_gemma":0.0013639312,"teacher_disagreement_score":0.024617907,"about_ca_system_score_codex":0.0017724246,"about_ca_system_score_gemma":0.0011563363,"threshold_uncertainty_score":0.08235514},"labels":[],"label_agreement":null},{"id":"W2202178721","doi":"10.1007/978-3-642-41515-9_16","title":"Symplectic Numerical Schemes for Stochastic Systems Preserving Hamiltonian Functions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; MacEwan University","funders":"","keywords":"Symplectic geometry; Hamiltonian system; Symplectic integrator; Hamiltonian (control theory); Taylor series; Generating function; Applied mathematics; Invariant (physics); Computer science; Hamiltonian mechanics; Mathematics; Mathematical optimization; Pure mathematics; Mathematical analysis; Mathematical physics; Symplectic manifold; Physics; Phase space; Quantum mechanics","score_opus":0.06992112125776385,"score_gpt":0.3300762764714886,"score_spread":0.2601551552137248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202178721","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.023444748,0.00133026,0.9553023,0.0005126408,0.00043481457,0.00006406406,0.00006877633,0.00016778005,0.018674532],"genre_scores_gemma":[0.5429185,0.002534669,0.4076578,0.00027396623,0.00043299329,0.0003218603,0.00027172494,0.00041754308,0.045170985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996222,0.00012872113,0.000023658298,0.000029902156,0.00017039792,0.000024995103],"domain_scores_gemma":[0.9993266,0.00029915516,0.00007567737,0.0001280912,0.00011330419,0.00005720093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008750228,0.0005858182,0.00067961554,0.0006530464,0.0005743941,0.001146528,0.0009801165,0.0008951375,0.0042913957],"category_scores_gemma":[0.0028430896,0.00035367234,0.0005567765,0.00064570864,0.0017621364,0.0013843033,0.0025768455,0.0018931509,0.00059267355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003164686,0.000030265457,0.000113867936,0.00008972611,0.000016836735,0.000039591447,0.00015119198,0.06262081,0.0027142786,0.9019602,0.0014710857,0.030760538],"study_design_scores_gemma":[0.000029445593,0.000036422512,0.00009284526,0.000026538275,0.0000060111156,0.000038809514,0.000027444243,0.63623184,0.0008717322,0.35610205,0.006523565,0.000013267714],"about_ca_topic_score_codex":0.00060718815,"about_ca_topic_score_gemma":0.00094526453,"teacher_disagreement_score":0.0042913957,"about_ca_system_score_codex":0.00079334836,"about_ca_system_score_gemma":0.00052487693,"threshold_uncertainty_score":0.014356136},"labels":[],"label_agreement":null},{"id":"W2202321577","doi":"10.1007/978-3-642-28891-3_6","title":"Symbolic Execution of Communicating and Hierarchically Composed UML-RT State Machines","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Reachability; Unified Modeling Language; Modular design; Programming language; Reuse; Symbolic execution; Finite-state machine; State (computer science); Theoretical computer science; Software","score_opus":0.019748807224966396,"score_gpt":0.2626622974765419,"score_spread":0.24291349025157552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202321577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08436523,0.00012423263,0.900416,0.00011693413,0.000044529417,0.00009582665,0.00017610668,0.0055092312,0.009151765],"genre_scores_gemma":[0.6703657,0.000118748714,0.32386798,0.000040450643,0.000015335843,0.0001284281,0.000374136,0.0005771901,0.004511993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984835,0.0005375152,0.000078698395,0.000181077,0.00054227916,0.00017698549],"domain_scores_gemma":[0.9969785,0.002157666,0.0002064182,0.00035415072,0.00023715623,0.00006618634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010410888,0.00073164597,0.000595897,0.00053205277,0.00075025536,0.0011694017,0.0014911905,0.000872284,0.006207793],"category_scores_gemma":[0.004890731,0.000661939,0.0009033577,0.00053223333,0.0016738239,0.0014002069,0.0014100114,0.001001004,0.00066919066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005132812,0.00014674384,0.0017576168,0.00046175992,0.00008621132,0.0008407213,0.0013105881,0.6778632,0.040446147,0.17833024,0.0018355275,0.09640798],"study_design_scores_gemma":[0.0000463154,0.00005503343,0.00024003666,0.000039808696,0.000035683333,0.00006104171,0.00005731424,0.9377686,0.02131949,0.03775548,0.0026029642,0.000018245888],"about_ca_topic_score_codex":0.004511107,"about_ca_topic_score_gemma":0.0065303403,"teacher_disagreement_score":0.006207793,"about_ca_system_score_codex":0.001027332,"about_ca_system_score_gemma":0.0013176543,"threshold_uncertainty_score":0.020767152},"labels":[],"label_agreement":null},{"id":"W2202720387","doi":"10.1007/978-3-662-46078-8_16","title":"Deterministic Rendezvous in Restricted Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Rendezvous; Traverse; Robot; Computer science; Asynchronous communication; Graph; Discrete mathematics; Topology (electrical circuits); Mobile robot; Theoretical computer science; Node (physics); Combinatorics; Reachability; Algorithm; Mathematics; Artificial intelligence; Computer network; Physics","score_opus":0.03973797012185137,"score_gpt":0.28057701449587374,"score_spread":0.24083904437402237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202720387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23615289,0.002293593,0.62568206,0.00118706,0.00031705253,0.00018722731,0.00096655305,0.0024679492,0.13074557],"genre_scores_gemma":[0.8773852,0.0016660198,0.06875574,0.00018294368,0.00011228391,0.00020965177,0.0008060414,0.0008101715,0.05007196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929595,0.00015851654,0.000027920447,0.00020530574,0.0001533283,0.00015899588],"domain_scores_gemma":[0.9978855,0.0012131657,0.00012872736,0.0005299585,0.00010783767,0.00013475197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047935755,0.00065822556,0.0011513836,0.00070451945,0.0012759757,0.0014782773,0.0019015807,0.001049485,0.009027622],"category_scores_gemma":[0.0036063278,0.0007424166,0.0007469901,0.0010808649,0.0018693694,0.0031218494,0.0025814774,0.0018516505,0.0017903493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032782674,0.000044382312,0.00030004795,0.0003576121,0.000046153342,0.00019776337,0.00034908493,0.13788722,0.0055064904,0.80329144,0.007850004,0.043842074],"study_design_scores_gemma":[0.000055297976,0.0000336052,0.00016382344,0.000054061475,0.000024277742,0.00016157841,0.00013781693,0.18885946,0.0031275302,0.79695123,0.01040152,0.000029749426],"about_ca_topic_score_codex":0.0025260001,"about_ca_topic_score_gemma":0.0029526073,"teacher_disagreement_score":0.009027622,"about_ca_system_score_codex":0.0010687648,"about_ca_system_score_gemma":0.00062191446,"threshold_uncertainty_score":0.030200422},"labels":[],"label_agreement":null},{"id":"W2203069020","doi":"10.1007/978-3-642-37996-3_22","title":"When Mommy Blogs Are Semantically Tagged","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Ontology; Scope (computer science); Axiom; Feature (linguistics); Expression (computer science); Component (thermodynamics); Natural language processing; Artificial intelligence; World Wide Web; Linguistics; Programming language; Epistemology","score_opus":0.019377114308599605,"score_gpt":0.23363880508898935,"score_spread":0.21426169078038976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203069020","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.48062024,0.002675012,0.104684725,0.01991421,0.006082292,0.00035117997,0.0100347735,0.00904805,0.36658952],"genre_scores_gemma":[0.90955365,0.0007424108,0.025276136,0.002000247,0.0008022722,0.00014322542,0.007556243,0.0025407728,0.051384974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733955,0.00045410972,0.00017291908,0.0007004045,0.00087864813,0.00045446327],"domain_scores_gemma":[0.98717636,0.006899801,0.0009960213,0.0019463918,0.0020712523,0.0009100861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022029614,0.00032021734,0.00041950413,0.0028178308,0.0023635072,0.00940886,0.00085107447,0.002469163,0.020744067],"category_scores_gemma":[0.036437172,0.00076016405,0.0005179906,0.0028334348,0.0016157659,0.022789294,0.0040731756,0.0017282515,0.0074487566],"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.0023567856,0.00037061694,0.1105474,0.0008286227,0.00016704727,0.0043815435,0.028117482,0.0018080893,0.02762631,0.44419253,0.15637943,0.22322412],"study_design_scores_gemma":[0.000115319104,0.00015298657,0.06517125,0.0010442319,0.00025487578,0.0034068567,0.05494127,0.020767914,0.021846848,0.3641402,0.46790937,0.000248853],"about_ca_topic_score_codex":0.0036348207,"about_ca_topic_score_gemma":0.0052888296,"teacher_disagreement_score":0.020744067,"about_ca_system_score_codex":0.0015089328,"about_ca_system_score_gemma":0.0011575762,"threshold_uncertainty_score":0.06939578},"labels":[],"label_agreement":null},{"id":"W2203092815","doi":"10.1007/978-3-319-22723-8_83","title":"How to Design and Build New Musical Interfaces","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Musical; Flexibility (engineering); New Interfaces for Musical Expression; Human–computer interaction; Field (mathematics); Interface (matter); Multimedia; Musical instrument; Key (lock); Computer music; Musical composition; Visual arts; Art","score_opus":0.04100959169405834,"score_gpt":0.25767528279438406,"score_spread":0.21666569110032574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203092815","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.0048510698,0.0025979977,0.9363788,0.0016480577,0.0007022716,0.00015103228,0.0001380518,0.0027441878,0.0507885],"genre_scores_gemma":[0.040533874,0.003218796,0.89540637,0.00085844425,0.00017794783,0.00027393995,0.00028199356,0.0012628919,0.0579858],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905163,0.00009798682,0.000055184388,0.00014393833,0.00055766257,0.00009373198],"domain_scores_gemma":[0.9991917,0.00023566127,0.000042429485,0.00020859126,0.00026106974,0.000060557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012656872,0.0010559371,0.0005344386,0.0007530503,0.00069869135,0.0042317463,0.0017332557,0.002179511,0.028096054],"category_scores_gemma":[0.0036998333,0.0010486646,0.00084245246,0.00043211898,0.0013040942,0.009325356,0.0021062624,0.0021349133,0.01580375],"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.000060251165,0.0000998858,0.0005838496,0.0010969917,0.00008787368,0.00026107297,0.00088492356,0.006543568,0.06681193,0.1357404,0.031739555,0.7560896],"study_design_scores_gemma":[0.00005920652,0.00018018119,0.0008230291,0.0005725426,0.00014427671,0.0012195943,0.00070408324,0.042606436,0.061365664,0.13922565,0.753002,0.000097318734],"about_ca_topic_score_codex":0.000613661,"about_ca_topic_score_gemma":0.00083616044,"teacher_disagreement_score":0.028096054,"about_ca_system_score_codex":0.00048298252,"about_ca_system_score_gemma":0.00057914923,"threshold_uncertainty_score":0.093990624},"labels":[],"label_agreement":null},{"id":"W2203395391","doi":"10.1007/978-3-642-39420-1_27","title":"Making Sense of Large Datasets in the Context of Complex Situation Understanding","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Université Laval; Defence Research and Development Canada","funders":"","keywords":"Computer science; Scripting language; Visualization; Human–computer interaction; Context (archaeology); Representation (politics); Data science; Artificial intelligence; Programming language","score_opus":0.11680419041401993,"score_gpt":0.3311663098152717,"score_spread":0.21436211940125174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203395391","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.17757791,0.0044330875,0.7955639,0.0055115973,0.00018439711,0.00053996604,0.0035773867,0.0014536746,0.0111581115],"genre_scores_gemma":[0.6169042,0.00181488,0.37435752,0.00041467708,0.00009452978,0.0003169254,0.0046985396,0.00016262343,0.0012361307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965,0.0018637114,0.0002390016,0.00074250565,0.0004977833,0.00015705246],"domain_scores_gemma":[0.96925294,0.025721917,0.0012070157,0.002623048,0.0006473648,0.0005477496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048476867,0.0011358308,0.0012460824,0.0023229183,0.00090657827,0.0066604335,0.002089843,0.0024255845,0.00359666],"category_scores_gemma":[0.039182242,0.0008686922,0.0012901612,0.0033544288,0.0020261758,0.016576076,0.0068832333,0.0034025074,0.00079076743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012395015,0.00085170433,0.025803441,0.0028161544,0.0010719249,0.0020337023,0.02723368,0.07042162,0.013267319,0.08404658,0.024808263,0.746406],"study_design_scores_gemma":[0.000049288676,0.00016736612,0.00885168,0.00039969257,0.00019918937,0.0005468211,0.015574371,0.3991131,0.004676417,0.5503854,0.019913893,0.0001227623],"about_ca_topic_score_codex":0.0033286328,"about_ca_topic_score_gemma":0.006262515,"teacher_disagreement_score":0.0066604335,"about_ca_system_score_codex":0.0009146324,"about_ca_system_score_gemma":0.0011075283,"threshold_uncertainty_score":0.025637329},"labels":[],"label_agreement":null},{"id":"W2203621808","doi":"10.1007/3-540-35828-5_17","title":"Towards Monitored Data Consistency and Business Processing Based on Declarative Software Agents1","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Consistency (knowledge bases); Database; Business process; Software engineering; Distributed computing","score_opus":0.0540937834612881,"score_gpt":0.28213533894076487,"score_spread":0.22804155547947677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203621808","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.008328528,0.00017047278,0.9882953,0.0003948011,0.00004285299,0.00006916857,0.000032202282,0.0011513444,0.0015153555],"genre_scores_gemma":[0.22941503,0.00032276587,0.7663275,0.00035205198,0.00011941251,0.00016993513,0.0002914355,0.00063068146,0.002371177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9865971,0.0054008565,0.0011688541,0.0016367527,0.004382731,0.0008138319],"domain_scores_gemma":[0.9555685,0.021229962,0.0027602953,0.015244416,0.0044838297,0.0007129644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018691149,0.00079755444,0.0014637358,0.0013475193,0.001594388,0.007756744,0.0058809742,0.0025749137,0.0020337715],"category_scores_gemma":[0.050107446,0.0022109444,0.0016864536,0.0017628964,0.0046505015,0.012599486,0.007913024,0.007361699,0.0007157858],"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.0007608137,0.00027535786,0.0037745624,0.00033884283,0.00018853293,0.0005070515,0.002326321,0.06434285,0.013184736,0.77911866,0.004815342,0.13036698],"study_design_scores_gemma":[0.000119212746,0.000108753746,0.00046099524,0.00009401751,0.00013518278,0.00025046468,0.00026744875,0.5509996,0.026411347,0.40724888,0.013841469,0.000062617095],"about_ca_topic_score_codex":0.0032831111,"about_ca_topic_score_gemma":0.0025056575,"teacher_disagreement_score":0.018691149,"about_ca_system_score_codex":0.0014612838,"about_ca_system_score_gemma":0.0031447068,"threshold_uncertainty_score":0.098849416},"labels":[],"label_agreement":null},{"id":"W2204082285","doi":"10.1007/978-3-642-21786-9_59","title":"Simultaneous Non-gaussian Data Clustering, Feature Selection and Outliers Rejection","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outlier; Computer science; Cluster analysis; Pattern recognition (psychology); Mixture model; Artificial intelligence; Feature selection; Expectation–maximization algorithm; Feature (linguistics); Gaussian; Selection (genetic algorithm); Model selection; Maximization; Data mining; Maximum likelihood; Mathematics; Statistics; Mathematical optimization","score_opus":0.024897277439985387,"score_gpt":0.26769799672131944,"score_spread":0.24280071928133407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204082285","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.00101601,0.00014638106,0.9984799,0.000025886751,0.00001820848,0.000012859386,0.000013195018,0.00016496218,0.00012267288],"genre_scores_gemma":[0.073990256,0.00058797584,0.92133015,0.00006925732,0.00012091058,0.00016584793,0.00034668198,0.0002959693,0.0030929002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947148,0.001513706,0.0003192791,0.0011274114,0.002042978,0.00028171472],"domain_scores_gemma":[0.9942483,0.003042418,0.0003903996,0.0010550667,0.0011293732,0.0001344293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004597659,0.0018461188,0.0042491425,0.001736893,0.0010896501,0.0024179975,0.003912288,0.0023085964,0.0017570732],"category_scores_gemma":[0.013166484,0.0018303397,0.0027158235,0.004214337,0.0018539018,0.0027886396,0.0046389187,0.002628357,0.0016320935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006775152,0.00016333754,0.0010053343,0.0006905724,0.00045150216,0.0002480436,0.00030254055,0.15022731,0.024735874,0.02364584,0.0048354003,0.7930167],"study_design_scores_gemma":[0.000027501083,0.00011858491,0.00124886,0.000022294302,0.00008930803,0.0003301095,0.00006495284,0.9479342,0.012421348,0.03377586,0.0039094617,0.000057654554],"about_ca_topic_score_codex":0.0023095973,"about_ca_topic_score_gemma":0.003621902,"teacher_disagreement_score":0.004597659,"about_ca_system_score_codex":0.00072606467,"about_ca_system_score_gemma":0.0015158188,"threshold_uncertainty_score":0.02431506},"labels":[],"label_agreement":null},{"id":"W2204311550","doi":"10.1007/978-3-319-07127-5_27","title":"Stop Clicking on “Update Later”: Persuading Users They Need Up-to-Date Antivirus Protection","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sexuality, Behavior, and Technology","field":"Psychology","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Advice (programming); Mainstream; Infographic; Computer security; Software; Comics; Multimedia; World Wide Web; Internet privacy; Artificial intelligence","score_opus":0.05102273059217875,"score_gpt":0.3234157256165409,"score_spread":0.27239299502436215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204311550","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.034252487,0.0200781,0.2770647,0.01517261,0.004497966,0.00023890204,0.00027696605,0.008596193,0.6398221],"genre_scores_gemma":[0.24465965,0.0141139375,0.107222304,0.006116163,0.0015371992,0.00014784659,0.00044936335,0.0012884879,0.62446505],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99972504,0.00007774853,0.00000882469,0.00003445536,0.00011809681,0.000035819878],"domain_scores_gemma":[0.9992507,0.00048546024,0.000047389425,0.00006454378,0.00009389534,0.000057984824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046898992,0.00084526197,0.00028289072,0.00047830888,0.00062179536,0.0019781468,0.0010051032,0.0016003356,0.021839362],"category_scores_gemma":[0.0020817749,0.00034151456,0.00024807017,0.00029051295,0.00073505356,0.003725151,0.0008841643,0.001951983,0.011413151],"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.00012354832,0.00022041092,0.00082205114,0.00035525445,0.000019705823,0.00019241383,0.0020889244,0.0007951921,0.0072949533,0.070583425,0.18960877,0.7278954],"study_design_scores_gemma":[0.00003908631,0.0002511809,0.002576343,0.0005543998,0.000085355496,0.0018115768,0.0017477239,0.020447416,0.01565371,0.095416635,0.8613119,0.000104523606],"about_ca_topic_score_codex":0.0008148608,"about_ca_topic_score_gemma":0.0014662001,"teacher_disagreement_score":0.021839362,"about_ca_system_score_codex":0.00036838537,"about_ca_system_score_gemma":0.0004350378,"threshold_uncertainty_score":0.07305992},"labels":[],"label_agreement":null},{"id":"W2204352964","doi":"10.1007/978-3-319-24912-4_13","title":"Generating Software Documentation in Use Case Maps from Filtered Execution Traces","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Documentation; Software; Software documentation; Software construction; Software engineering; Notation; Software development; Software system; Programming language; Software framework; Software maintenance; Verification and validation; Data mining","score_opus":0.04242136738001418,"score_gpt":0.28739411155629774,"score_spread":0.24497274417628356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204352964","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.079609305,0.0004203605,0.83986294,0.0002646785,0.0001480062,0.0004502603,0.004516994,0.06883701,0.005890434],"genre_scores_gemma":[0.32905307,0.00055347505,0.64319795,0.000059565493,0.000050018545,0.0004354332,0.012874235,0.0076859114,0.006090427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989261,0.00016313573,0.00006896064,0.0002037832,0.0005503197,0.000087702756],"domain_scores_gemma":[0.9936107,0.0032637385,0.0004358031,0.0010442509,0.001496972,0.00014857907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011106695,0.0016545674,0.00097488123,0.005726409,0.0007954941,0.0024247805,0.0014935483,0.0011949098,0.006124282],"category_scores_gemma":[0.012301557,0.0010766176,0.0016366434,0.0033945662,0.00049788837,0.0021607052,0.0019865714,0.0013408349,0.002918783],"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.000623127,0.00040408038,0.011978348,0.0014786948,0.00019660727,0.002202123,0.0023461517,0.111239314,0.021789016,0.01785997,0.027053485,0.802829],"study_design_scores_gemma":[0.00006835496,0.00013132383,0.0040557515,0.00034889483,0.00016150506,0.00065029954,0.0006172403,0.8930401,0.04333735,0.032704003,0.024794184,0.00009098289],"about_ca_topic_score_codex":0.0064802673,"about_ca_topic_score_gemma":0.008622161,"teacher_disagreement_score":0.0064802673,"about_ca_system_score_codex":0.00081309304,"about_ca_system_score_gemma":0.0020503816,"threshold_uncertainty_score":0.020487785},"labels":[],"label_agreement":null},{"id":"W2205402206","doi":"10.1007/978-3-642-54906-9_37","title":"An Investigation on the Influence of Genres and Textual Organisation on the Use of Discourse Relations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Notice; Newspaper; Linguistics; Natural language processing; Genre analysis; Sociology; Political science; Media studies","score_opus":0.029410020510172784,"score_gpt":0.26562836702912523,"score_spread":0.23621834651895246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205402206","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.985415,0.0008060943,0.0010839584,0.00014940619,0.000022340178,0.000054643082,0.00033224004,0.000048254507,0.012088124],"genre_scores_gemma":[0.99500847,0.00041406878,0.0018209403,0.000031887164,0.00003759556,0.00003842235,0.00037989297,0.00008398257,0.002184645],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.995329,0.003103564,0.00024066442,0.0004253069,0.0007423811,0.00015907934],"domain_scores_gemma":[0.8454857,0.14121729,0.00575955,0.0024177616,0.0034093384,0.0017104209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895391,0.00032780893,0.0003789183,0.0023186645,0.0008518614,0.0041242484,0.0005473329,0.00042828542,0.005791786],"category_scores_gemma":[0.05386444,0.00030788773,0.00036127583,0.0022018054,0.0008071174,0.0019983058,0.0010606474,0.00075004157,0.0009320874],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005924872,0.0020612192,0.41786674,0.0022744706,0.00041930837,0.0014798979,0.08989622,0.0011250527,0.12790918,0.0068510524,0.0038016615,0.34039032],"study_design_scores_gemma":[0.00017618577,0.0021109811,0.9048689,0.00040844738,0.00072109443,0.0016678524,0.033093642,0.010630059,0.024581071,0.0043487437,0.017267298,0.00012569127],"about_ca_topic_score_codex":0.0021520108,"about_ca_topic_score_gemma":0.0022128378,"teacher_disagreement_score":0.005791786,"about_ca_system_score_codex":0.00059955043,"about_ca_system_score_gemma":0.00052318367,"threshold_uncertainty_score":0.025889575},"labels":[],"label_agreement":null},{"id":"W2206135998","doi":"10.1007/3-540-45391-1_9","title":"Towards Policy-Driven Agent System Development and Management","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"National Research Council Canada","funders":"","keywords":"Computer science; Variety (cybernetics); Directory; Multi-agent system; Work (physics); Development (topology); Computer security; Engineering management; Artificial intelligence; Engineering","score_opus":0.019018390162105415,"score_gpt":0.26875692738802415,"score_spread":0.24973853722591874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206135998","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.0024742922,0.00016629529,0.99132854,0.00074122194,0.00004454762,0.00012330376,0.000030478432,0.0008862893,0.004205017],"genre_scores_gemma":[0.066539675,0.00044157973,0.9275209,0.00025531632,0.00002872355,0.00031571195,0.00017892246,0.00030358508,0.0044156057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663615,0.0013895481,0.00022631632,0.0003063853,0.0012246616,0.0002168755],"domain_scores_gemma":[0.9948467,0.0025622023,0.00023975149,0.0010445762,0.0010891561,0.00021759991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00675419,0.0006701279,0.0006794264,0.00070473296,0.0007566481,0.0032389762,0.0026972226,0.0021536753,0.0038642224],"category_scores_gemma":[0.012002747,0.0012326216,0.0007548648,0.00068745896,0.0015872151,0.0037744273,0.0029851042,0.0032992926,0.0016869243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012280833,0.00044508584,0.001696588,0.00056893047,0.00013105333,0.00035226805,0.0010650492,0.21860631,0.012526697,0.422262,0.016275674,0.32594758],"study_design_scores_gemma":[0.000036465393,0.000042972388,0.00014807154,0.000078190984,0.000033182143,0.00012326475,0.00014470922,0.7524318,0.010478463,0.19351557,0.042946007,0.000021313834],"about_ca_topic_score_codex":0.0025685434,"about_ca_topic_score_gemma":0.003682228,"teacher_disagreement_score":0.00675419,"about_ca_system_score_codex":0.0013245606,"about_ca_system_score_gemma":0.0042034015,"threshold_uncertainty_score":0.03571999},"labels":[],"label_agreement":null},{"id":"W2206212529","doi":"10.1007/978-3-662-49529-2_19","title":"Improved Spanning Ratio for Low Degree Plane Spanners","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Spanner; Degree (music); Computer science; Plane (geometry); Graph; Approx; Spanning tree; Combinatorics; Mathematics; Theoretical computer science; Physics; Geometry; Distributed computing","score_opus":0.024979081227070352,"score_gpt":0.2514166378433761,"score_spread":0.22643755661630574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206212529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30919576,0.002082694,0.59980595,0.00040737406,0.00032823687,0.00010001098,0.0005285376,0.0018791184,0.08567238],"genre_scores_gemma":[0.78906214,0.0011716711,0.19034468,0.00018384948,0.00019988327,0.00011713688,0.0006866865,0.00085752434,0.017376449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993043,0.0001828189,0.000032959055,0.00012839593,0.00025422883,0.00009731139],"domain_scores_gemma":[0.99896693,0.00052093423,0.0000731375,0.00022406467,0.00011850495,0.00009645977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006897574,0.0008790817,0.0009549377,0.0014302384,0.00042449372,0.0012762205,0.0014865962,0.00073112466,0.011365588],"category_scores_gemma":[0.003303182,0.00032373078,0.00043633272,0.0012636954,0.0006060232,0.0020064989,0.0017994035,0.0013703868,0.0023614585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079232093,0.0003091937,0.0012044477,0.0006608016,0.00007677969,0.00036537976,0.0003503171,0.1271511,0.0800784,0.4015956,0.015234149,0.3721815],"study_design_scores_gemma":[0.000083324725,0.00039083077,0.0011469532,0.000085219726,0.00009185137,0.0008592523,0.0001859312,0.6045106,0.03076195,0.3456834,0.016145188,0.000055538956],"about_ca_topic_score_codex":0.00032493484,"about_ca_topic_score_gemma":0.00053878926,"teacher_disagreement_score":0.011365588,"about_ca_system_score_codex":0.0005084821,"about_ca_system_score_gemma":0.00022064739,"threshold_uncertainty_score":0.038021684},"labels":[],"label_agreement":null},{"id":"W2206432400","doi":"10.1007/978-3-319-19992-4_40","title":"IMaGe: Iterative Multilevel Probabilistic Graphical Model for Detection and Segmentation of Multiple Sclerosis Lesions in Brain MRI","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Graphical model; Segmentation; Artificial intelligence; Multiple sclerosis; Image segmentation; Magnetic resonance imaging; Pattern recognition (psychology); Computer vision; Radiology; Medicine","score_opus":0.053347355381493766,"score_gpt":0.31040283762043647,"score_spread":0.2570554822389427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206432400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003475069,0.0000798825,0.99270636,0.0002383589,0.00002047436,0.00003665458,0.00054511125,0.0025742785,0.0003239329],"genre_scores_gemma":[0.20879625,0.00029252458,0.7823454,0.00035709384,0.000108016575,0.00042744167,0.0023065358,0.0011346157,0.004232113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995468,0.00017372704,0.000018643783,0.00010321867,0.000118783464,0.000038846643],"domain_scores_gemma":[0.9992041,0.00045219657,0.000078599725,0.0000915132,0.00013260954,0.000040971358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010685638,0.00066955975,0.0009694826,0.0010306824,0.00034094122,0.0010924455,0.002213122,0.002288036,0.006735805],"category_scores_gemma":[0.0044240053,0.0009821127,0.002095784,0.0007761513,0.00044901227,0.00076548266,0.0014255417,0.001771145,0.0021809463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004927392,0.00012197592,0.0018210317,0.000291741,0.00030039548,0.0002265551,0.00012054004,0.7347317,0.009163563,0.022364425,0.014144295,0.21622108],"study_design_scores_gemma":[0.000013998912,0.000022403356,0.00019726568,0.000007667582,0.000017745988,0.000046716075,0.000003351783,0.99307185,0.0009004072,0.0047415243,0.00096815405,0.000008866468],"about_ca_topic_score_codex":0.013036524,"about_ca_topic_score_gemma":0.01598848,"teacher_disagreement_score":0.013036524,"about_ca_system_score_codex":0.0007895119,"about_ca_system_score_gemma":0.0011668953,"threshold_uncertainty_score":0.025921285},"labels":[],"label_agreement":null},{"id":"W2206534536","doi":"10.1007/978-3-642-39146-0_32","title":"Automating the E-learning Personalization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"Athabasca University","funders":"","keywords":"Personalization; Computer science; Metadata; Learning object; Ontology; Automation; Representation (politics); World Wide Web; Object (grammar); Information retrieval; Human–computer interaction; Artificial intelligence","score_opus":0.01748640200816843,"score_gpt":0.25797019931711823,"score_spread":0.2404837973089498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206534536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06605399,0.00060775166,0.88363,0.00025281205,0.000246463,0.00025634427,0.0005892422,0.031319093,0.017044354],"genre_scores_gemma":[0.5294206,0.0006919847,0.43004233,0.0002205496,0.00009766485,0.00019317513,0.0015637676,0.002113301,0.035656568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.00007305329,0.00003770653,0.00021160355,0.0002305087,0.00007496937],"domain_scores_gemma":[0.9989687,0.00024612868,0.00003876439,0.0004690198,0.00022480093,0.000052426207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004398922,0.0008519637,0.000672831,0.0008297995,0.00042977938,0.0016500618,0.0010061623,0.0007953077,0.015132235],"category_scores_gemma":[0.0022773393,0.0004907472,0.00063600694,0.00086741085,0.0002904271,0.0020857975,0.0027070632,0.0010667021,0.008434454],"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.0003640735,0.0002462007,0.002002114,0.00019967186,0.000033469612,0.00015734426,0.00028354747,0.0050997925,0.046732496,0.0027117357,0.009926651,0.93224293],"study_design_scores_gemma":[0.00008671045,0.00030220102,0.012110978,0.00013088231,0.00017210096,0.0014356116,0.0006171453,0.4894117,0.3608248,0.019904288,0.11488752,0.000116028314],"about_ca_topic_score_codex":0.001263829,"about_ca_topic_score_gemma":0.0011612595,"teacher_disagreement_score":0.015132235,"about_ca_system_score_codex":0.00030479775,"about_ca_system_score_gemma":0.00042471592,"threshold_uncertainty_score":0.050622404},"labels":[],"label_agreement":null},{"id":"W2206668277","doi":"10.1007/978-3-642-01364-5_2","title":"Modelling and Analysis of Time-Constrained Flexible Workflows with Time Recursive ECATNets","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Workflow; Formalism (music); Theoretical computer science; Graph; Distributed computing; Model checking; Time complexity; Algorithm; Programming language; Database","score_opus":0.009272401060163997,"score_gpt":0.21383622972854127,"score_spread":0.20456382866837727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206668277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04305194,0.00027414062,0.95260614,0.00010628668,0.000024735677,0.00004288624,0.000097202086,0.0002526629,0.003543895],"genre_scores_gemma":[0.7605672,0.0005869035,0.22753751,0.000050693583,0.000040928608,0.00017078342,0.00041805088,0.00023470631,0.010393197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990325,0.00022824522,0.00008286092,0.00022401912,0.00024610682,0.00018633505],"domain_scores_gemma":[0.9978744,0.0012763705,0.00026666195,0.00019900173,0.00026148456,0.00012202703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823491,0.0007903746,0.00094238424,0.0009940994,0.0007477357,0.0025938312,0.0021898607,0.0013847854,0.0023343128],"category_scores_gemma":[0.0037898584,0.00086771307,0.0019108587,0.0013069658,0.0018131024,0.0026686548,0.0015615247,0.001353927,0.0003461145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047901798,0.000020346695,0.0004348919,0.000039941013,0.000025598694,0.00018357104,0.0001005518,0.8406693,0.0021108536,0.15034659,0.0001789916,0.005841503],"study_design_scores_gemma":[0.000004334172,0.000006166178,0.0000725275,0.0000062452923,0.000008088138,0.000027424621,0.000015852245,0.96480113,0.00044908636,0.034024462,0.00057923957,0.000005540488],"about_ca_topic_score_codex":0.015665693,"about_ca_topic_score_gemma":0.011698294,"teacher_disagreement_score":0.015665693,"about_ca_system_score_codex":0.0018674219,"about_ca_system_score_gemma":0.0017339801,"threshold_uncertainty_score":0.03114897},"labels":[],"label_agreement":null},{"id":"W2207822899","doi":"10.1007/978-3-319-25591-0_13","title":"An Analysis Tool for the Contextual Information from Field Experiments on Driving Fatigue","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Context (archaeology); Field (mathematics); Visualization; Human–computer interaction; Cognition; Data visualization; Cloud computing; Data science; Artificial intelligence","score_opus":0.054969139084020874,"score_gpt":0.31003004826779107,"score_spread":0.2550609091837702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207822899","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.0118501205,0.00043313458,0.87207246,0.000083160645,0.000091250775,0.00037025538,0.01575713,0.0963898,0.0029527736],"genre_scores_gemma":[0.08434382,0.00044294834,0.88169646,0.00013403731,0.000114533985,0.0012480528,0.021235708,0.006276801,0.0045076795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990681,0.000111205416,0.0001236379,0.00023878261,0.00039240852,0.00006587924],"domain_scores_gemma":[0.9943849,0.0033058792,0.00047775707,0.00073291373,0.00095136743,0.00014719098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017244812,0.0025388508,0.0013781467,0.008755091,0.00067704904,0.0019675535,0.0013966197,0.0012094554,0.011747157],"category_scores_gemma":[0.008325489,0.0007950641,0.0014564487,0.005019204,0.00038574665,0.0022452648,0.0018036497,0.001009148,0.0069752014],"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.0006884906,0.00047455175,0.010519825,0.0016215637,0.00041368685,0.0012864592,0.0015198985,0.008281651,0.06308429,0.0042721066,0.045382,0.8624554],"study_design_scores_gemma":[0.00034747345,0.000772869,0.060962267,0.0009735158,0.0008969551,0.0041421894,0.0018801101,0.53067505,0.14417629,0.044680014,0.20987608,0.00061708933],"about_ca_topic_score_codex":0.0026990331,"about_ca_topic_score_gemma":0.0039886944,"teacher_disagreement_score":0.011747157,"about_ca_system_score_codex":0.00035476306,"about_ca_system_score_gemma":0.00077777094,"threshold_uncertainty_score":0.039298117},"labels":[],"label_agreement":null},{"id":"W2208753292","doi":"10.1007/978-3-642-32024-8_12","title":"Plural Quantifications and Generalized Quantifiers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Plural; Computer science; Programming language; Algorithm; Theoretical computer science; Linguistics; Philosophy","score_opus":0.03244236520865941,"score_gpt":0.2625550003105009,"score_spread":0.2301126351018415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208753292","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.07243712,0.04361361,0.2856369,0.012373211,0.0016706554,0.00009084551,0.0006199396,0.0007919437,0.5827659],"genre_scores_gemma":[0.8293709,0.011442839,0.072027035,0.0018463068,0.0023093026,0.00011250553,0.0005216593,0.0003825589,0.081986986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896896,0.0003213655,0.000087909335,0.00027161962,0.00024793402,0.000102192644],"domain_scores_gemma":[0.9990854,0.0004969575,0.000082576895,0.00019130889,0.00010510271,0.000038682785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014517135,0.0010572372,0.0009561513,0.0016216377,0.0020582569,0.00489211,0.0014793673,0.001595492,0.009303001],"category_scores_gemma":[0.0028455171,0.0009809742,0.0012939293,0.0017885043,0.009357517,0.0136817545,0.0029300048,0.0035708635,0.0013403122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004891477,0.0000031024115,0.0000320511,0.000030770312,0.000004939423,0.00003426805,0.00024653593,0.00011786357,0.00012299453,0.99385226,0.0010488329,0.0045016096],"study_design_scores_gemma":[0.0000030053925,0.0000016592686,0.00003845512,0.00001522181,0.0000031849372,0.000038035752,0.00003873748,0.00016861426,0.000064646214,0.993246,0.006378915,0.0000036271838],"about_ca_topic_score_codex":0.0012506215,"about_ca_topic_score_gemma":0.0015703636,"teacher_disagreement_score":0.009303001,"about_ca_system_score_codex":0.0017917278,"about_ca_system_score_gemma":0.0005151633,"threshold_uncertainty_score":0.031121671},"labels":[],"label_agreement":null},{"id":"W2208792883","doi":"10.1007/978-3-642-41707-8_14","title":"Challenges of Testing Periodic Messages in Avionics Systems Using TTCN-3","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Avionics; Computer science; Certification; Conformance testing; Embedded system; Test (biology); Layer (electronics); Programming language; Reliability engineering; Software engineering; Operating system; Engineering","score_opus":0.0933684558747225,"score_gpt":0.3042184143432304,"score_spread":0.21084995846850788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208792883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07780244,0.0021371795,0.8744231,0.00789199,0.0007962512,0.00036960642,0.00037422258,0.0059992047,0.030206012],"genre_scores_gemma":[0.56845194,0.0008278837,0.4173599,0.0010732182,0.00027949963,0.00026524597,0.0005813806,0.00083718606,0.010323761],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.981191,0.008191502,0.0010597053,0.0015088894,0.006937483,0.0011114092],"domain_scores_gemma":[0.933339,0.047823787,0.001666611,0.008028752,0.008118892,0.0010230144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014212422,0.0010683469,0.0013068726,0.00096383295,0.00082323747,0.0031691573,0.0046801385,0.0024861642,0.006785136],"category_scores_gemma":[0.037856773,0.00068848435,0.0011587819,0.0007946365,0.0028589526,0.005305477,0.0026490137,0.0035032837,0.0015184705],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085334975,0.00064065866,0.006846217,0.0011529179,0.00018574254,0.0007597446,0.000805005,0.225011,0.023765853,0.2145472,0.01912096,0.5063113],"study_design_scores_gemma":[0.00011557683,0.00055111706,0.0010699447,0.00034450108,0.00008526305,0.0004898403,0.0005143277,0.7249617,0.03173939,0.21521388,0.024836313,0.00007814952],"about_ca_topic_score_codex":0.008862944,"about_ca_topic_score_gemma":0.009730189,"teacher_disagreement_score":0.014212422,"about_ca_system_score_codex":0.001933003,"about_ca_system_score_gemma":0.004984348,"threshold_uncertainty_score":0.075163305},"labels":[],"label_agreement":null},{"id":"W2209539344","doi":"10.1007/978-3-662-46739-8_6","title":"Permutation Steganography in FAT Filesystems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Steganography; Permutation (music); Focus (optics); Scheme (mathematics); Theoretical computer science; Embedding; Computer security; Artificial intelligence; Mathematics","score_opus":0.02325736205847543,"score_gpt":0.26130160541533026,"score_spread":0.23804424335685484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209539344","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.11705306,0.013954327,0.74822253,0.0006712042,0.00035186246,0.00008942538,0.00011645084,0.00066124887,0.11887979],"genre_scores_gemma":[0.82274485,0.011784177,0.095481664,0.0001127458,0.00023922384,0.000071804265,0.00012605586,0.00011911555,0.06932039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99988437,0.000027381728,0.000005050462,0.000014106726,0.000052560958,0.000016583026],"domain_scores_gemma":[0.9997588,0.00014479356,0.000016178721,0.000048637292,0.0000261933,0.0000054048496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001431599,0.0003386172,0.00023408783,0.00038403517,0.00018855298,0.0006073508,0.0003285517,0.00045547914,0.00338451],"category_scores_gemma":[0.0006497035,0.0002017253,0.00017779208,0.00052826054,0.00067433127,0.0011898634,0.0005116447,0.00061658095,0.00072769355],"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.00014054328,0.00004743008,0.0003051275,0.000325512,0.000014251609,0.0003361496,0.0001997679,0.04312399,0.033055454,0.6284245,0.0036166862,0.29041064],"study_design_scores_gemma":[0.000025418212,0.00018431517,0.0007453802,0.00014052347,0.000022839016,0.0017717684,0.00013123472,0.24970189,0.049249906,0.6552923,0.04269322,0.000041332147],"about_ca_topic_score_codex":0.00023438195,"about_ca_topic_score_gemma":0.00022680039,"teacher_disagreement_score":0.00338451,"about_ca_system_score_codex":0.00032977588,"about_ca_system_score_gemma":0.00015815366,"threshold_uncertainty_score":0.01132226},"labels":[],"label_agreement":null},{"id":"W2209593929","doi":"10.1007/978-3-319-24571-3_9","title":"Ultrasound-Based Detection of Prostate Cancer Using Automatic Feature Selection with Deep Belief Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Deep belief network; Feature selection; Pattern recognition (psychology); Prostate cancer; Classifier (UML); Support vector machine; Ultrasound; Feature (linguistics); Deep learning; Cancer; Radiology; Medicine","score_opus":0.01596044621308901,"score_gpt":0.26378902073509736,"score_spread":0.24782857452200835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209593929","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.04147777,0.002565194,0.95091134,0.00040704635,0.00011298424,0.000063861735,0.00045910673,0.0016116354,0.0023909837],"genre_scores_gemma":[0.6037842,0.0021963553,0.38512465,0.00041894356,0.00021583772,0.000119113945,0.0010298308,0.00023334105,0.0068778303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997768,0.000031945514,0.000011539276,0.000058158053,0.00008096993,0.0000405956],"domain_scores_gemma":[0.99961424,0.00022266075,0.00003187691,0.000024931198,0.00008608636,0.000020179927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041893165,0.00075445126,0.00079584745,0.00090128876,0.00018256983,0.0006855515,0.00092865207,0.000755959,0.0017026771],"category_scores_gemma":[0.0011345823,0.00048269532,0.0007684368,0.00057496235,0.00019460947,0.00059831364,0.0006979446,0.00077599345,0.0007536695],"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.00029517684,0.00016815895,0.0040356186,0.00018796897,0.00010425973,0.00022066798,0.00004520066,0.079760104,0.043455172,0.0014700337,0.0067411736,0.8635165],"study_design_scores_gemma":[0.000009498451,0.00005780929,0.0025730953,0.000026977561,0.00004471307,0.00031933497,0.000012029861,0.9803617,0.0134857455,0.0019943768,0.0010960383,0.000018770506],"about_ca_topic_score_codex":0.0031373685,"about_ca_topic_score_gemma":0.0062634884,"teacher_disagreement_score":0.0031373685,"about_ca_system_score_codex":0.00033368284,"about_ca_system_score_gemma":0.00037280272,"threshold_uncertainty_score":0.006238222},"labels":[],"label_agreement":null},{"id":"W2210299414","doi":"10.1007/978-3-642-13131-8_1","title":"Overview of the Ninth Annual Meeting of the BioLINK SIG at ISMB: Linking Literature, Information and Knowledge for Biology","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Queen's University","funders":"","keywords":"Automatic summarization; Computer science; Information extraction; Identification (biology); Knowledge extraction; Domain (mathematical analysis); Data science; Information retrieval; Key (lock); Artificial intelligence; Biology; Ecology","score_opus":0.01710943575321675,"score_gpt":0.27772978818555255,"score_spread":0.2606203524323358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2210299414","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050375704,0.32721692,0.089991875,0.121034585,0.19989523,0.0024114992,0.020769438,0.006109881,0.2275329],"genre_scores_gemma":[0.0081452215,0.1296164,0.06631972,0.016509056,0.02638722,0.0010982666,0.0316191,0.0023925586,0.7179125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985044,0.00025267855,0.00011780277,0.00026647176,0.00068682135,0.00017176988],"domain_scores_gemma":[0.99646854,0.00028917813,0.00013980555,0.00014567966,0.0016516038,0.0013051737],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004926265,0.0018140095,0.0015702223,0.0064128414,0.0015540237,0.007084649,0.0018992128,0.0022073246,0.08048338],"category_scores_gemma":[0.0034425799,0.0007385398,0.0011681564,0.006010392,0.0005869522,0.005079724,0.004110445,0.0023724977,0.057148464],"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.00010621067,0.00008933189,0.0002201366,0.0005556363,0.000019400113,0.000077036515,0.00007947047,0.00019262868,0.0016477795,0.0013950795,0.79841506,0.1972022],"study_design_scores_gemma":[0.000008379335,0.000029790019,0.00043322673,0.00020326862,0.000012581318,0.00007823672,0.000044980556,0.00014825781,0.00038182535,0.0008099598,0.99783474,0.00001483249],"about_ca_topic_score_codex":0.0047634053,"about_ca_topic_score_gemma":0.0155763915,"teacher_disagreement_score":0.99291533,"about_ca_system_score_codex":0.00192491,"about_ca_system_score_gemma":0.0051328107,"threshold_uncertainty_score":0.26924372},"labels":[],"label_agreement":null},{"id":"W2211222829","doi":"10.1007/978-3-642-33415-3_64","title":"Vertebral Body Segmentation in MRI via Convex Relaxation and Distribution Matching","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Western University; CARE Canada","funders":"","keywords":"Computer science; Relaxation (psychology); Segmentation; Matching (statistics); Augmented Lagrangian method; Algorithm; Convex optimization; Regular polygon; Mathematical optimization; Pattern recognition (psychology); Artificial intelligence; Mathematics","score_opus":0.005275450567518291,"score_gpt":0.22908143355846916,"score_spread":0.22380598299095086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211222829","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.004190946,0.000158535,0.99469596,0.0001829494,0.000010597365,0.0000265668,0.000050614803,0.00032345025,0.00036038],"genre_scores_gemma":[0.18844405,0.00066250656,0.8052224,0.00030126772,0.00013164531,0.00024151197,0.00056181685,0.00096935086,0.003465476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992323,0.0002581716,0.000050686063,0.00017004026,0.00020246871,0.00008622409],"domain_scores_gemma":[0.99812084,0.0012438977,0.00018889806,0.0001630235,0.00020532732,0.00007794215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022894756,0.001080975,0.0022548414,0.0019458826,0.0006632323,0.0022680578,0.0024410354,0.0030332073,0.0021926651],"category_scores_gemma":[0.0066874702,0.0021109954,0.0017530575,0.002026465,0.0012810499,0.0023373298,0.0023517346,0.0022881832,0.00093007454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003692005,0.0001145165,0.0007609491,0.00030131114,0.00012049646,0.00014033559,0.00014561493,0.7492879,0.014471392,0.013974019,0.003142027,0.2171722],"study_design_scores_gemma":[0.000012385596,0.000014657625,0.00012370008,0.000008858055,0.000010629939,0.000043383618,0.000008821509,0.99259335,0.0017516919,0.0050260676,0.00039784555,0.000008549245],"about_ca_topic_score_codex":0.008426757,"about_ca_topic_score_gemma":0.008233508,"teacher_disagreement_score":0.008426757,"about_ca_system_score_codex":0.0010666858,"about_ca_system_score_gemma":0.0024538473,"threshold_uncertainty_score":0.016755402},"labels":[],"label_agreement":null},{"id":"W2211589933","doi":"10.1007/978-3-642-36089-3_1","title":"Addressing Cognitive and Social Challenges in Designing and Using Ontologies in the Biomedical Domain","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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 Victoria","funders":"","keywords":"Computer science; Conceptualization; Ontology; Interoperability; Categorization; Domain (mathematical analysis); Data science; Vocabulary; Reuse; Semantic interoperability; IDEF5; Information retrieval; Ontology-based data integration; Artificial intelligence; World Wide Web; Epistemology","score_opus":0.10774980924205195,"score_gpt":0.3228602348282431,"score_spread":0.21511042558619115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211589933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134940995,0.0068113455,0.91433185,0.032539938,0.00056295993,0.00017230197,0.00022587818,0.00046734067,0.031394336],"genre_scores_gemma":[0.102855094,0.007619545,0.8780246,0.0027732486,0.0006247731,0.00033441855,0.0006198792,0.00032364836,0.00682494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98952824,0.005744127,0.0011071356,0.00086904457,0.002335677,0.00041582648],"domain_scores_gemma":[0.9697772,0.024496112,0.0011691883,0.0023549811,0.0015777068,0.00062474445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02130128,0.0008692138,0.0011866258,0.0036175528,0.0038085268,0.01522386,0.0030003053,0.0034684748,0.0030407798],"category_scores_gemma":[0.029494269,0.0010980013,0.0018478726,0.0046886583,0.00776681,0.03555679,0.008875444,0.0056336084,0.0012250452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000247051,0.000106641324,0.0009977889,0.0008762874,0.00010479194,0.00038820494,0.00833784,0.0043236497,0.0026461023,0.7741553,0.01201653,0.19602203],"study_design_scores_gemma":[0.0000068773265,0.00001576724,0.00039546686,0.00038469964,0.00004905313,0.00046116655,0.0043778596,0.016335735,0.0016476136,0.86695033,0.10933141,0.000044062792],"about_ca_topic_score_codex":0.0035003552,"about_ca_topic_score_gemma":0.0057935137,"teacher_disagreement_score":0.02130128,"about_ca_system_score_codex":0.0025316097,"about_ca_system_score_gemma":0.0041996627,"threshold_uncertainty_score":0.112653315},"labels":[],"label_agreement":null},{"id":"W2211790732","doi":"10.1007/978-3-319-11164-3_7","title":"Portable Runtime Verification with Smartphones and Optical Codes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Android (operating system); Java; Operating system; Phone; XML; Programming language; Window (computing); Architecture; Mobile device; Embedded system","score_opus":0.008322117261393081,"score_gpt":0.22365785340369085,"score_spread":0.21533573614229776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211790732","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.0924428,0.0025561075,0.7542619,0.00063272746,0.00084827066,0.0002823171,0.0013297447,0.10700527,0.040640905],"genre_scores_gemma":[0.7285174,0.0005613411,0.23556253,0.00046521946,0.0001735395,0.00016714633,0.0012996307,0.0066979122,0.026555235],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985441,0.00017153638,0.000082846476,0.000331047,0.00067517936,0.00019527435],"domain_scores_gemma":[0.9969375,0.0008251689,0.00027544625,0.0013397569,0.0005466511,0.000075347925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058902067,0.001147812,0.00065995543,0.0009853932,0.0005352977,0.0013905957,0.0013716853,0.000851394,0.016935866],"category_scores_gemma":[0.004156743,0.00064320205,0.0007088515,0.00046810872,0.0006322875,0.0023014797,0.0018304756,0.00097137573,0.0060392097],"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.0012630789,0.00019144348,0.0058337036,0.0007840459,0.00014983027,0.00093727285,0.00060989126,0.011743479,0.16144957,0.025350643,0.057525165,0.73416185],"study_design_scores_gemma":[0.00016110999,0.0005112078,0.004399981,0.0005096462,0.00019573407,0.002201343,0.000338399,0.22223127,0.6174362,0.0329604,0.11884791,0.00020692061],"about_ca_topic_score_codex":0.0015041985,"about_ca_topic_score_gemma":0.0031418845,"teacher_disagreement_score":0.016935866,"about_ca_system_score_codex":0.0006459391,"about_ca_system_score_gemma":0.00091338885,"threshold_uncertainty_score":0.056656063},"labels":[],"label_agreement":null},{"id":"W2212590794","doi":"10.1007/978-3-642-36675-8_7","title":"A Geometric Procedure with Prover9","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Geometry","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":"University of Manitoba","funders":"","keywords":"Chord (peer-to-peer); Automated theorem proving; Tangent; Lemma (botany); Morphism; Mathematics; Gas meter prover; Algebraic curve; Connection (principal bundle); Discrete mathematics; Algebra over a field; Computer science; Calculus (dental); Pure mathematics; Algorithm; Geometry; Mathematical proof","score_opus":0.017935280709860637,"score_gpt":0.25692040755952966,"score_spread":0.23898512684966902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212590794","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.0038237143,0.00064276444,0.6598211,0.0018347012,0.0010714073,0.00016413837,0.001036892,0.0094203595,0.32218495],"genre_scores_gemma":[0.1192565,0.0023580203,0.4619198,0.0016239994,0.00079013134,0.00038294218,0.00403498,0.015171301,0.3944624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808264,0.0005283286,0.000111557354,0.00041528526,0.00063617463,0.0002259378],"domain_scores_gemma":[0.9990601,0.00042109273,0.000024998732,0.00030126073,0.00015196812,0.000040530653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017356004,0.0016556784,0.0013012418,0.0017925492,0.0032915901,0.0038265444,0.0030102003,0.0017236607,0.102554835],"category_scores_gemma":[0.0029825582,0.0015157928,0.0023864566,0.0024995974,0.0035413257,0.009018481,0.0058908476,0.0054816445,0.05928003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006716787,0.000033692733,0.000058128062,0.00023579458,0.000016100606,0.000105454455,0.00029223287,0.00058809307,0.0016108779,0.8816364,0.036233943,0.07912219],"study_design_scores_gemma":[0.00004725771,0.000038857117,0.00012771318,0.00009775574,0.000037921534,0.00035670918,0.00011358351,0.0023446337,0.0075001162,0.5815682,0.4077222,0.000045140605],"about_ca_topic_score_codex":0.00093734404,"about_ca_topic_score_gemma":0.0010028029,"teacher_disagreement_score":0.102554835,"about_ca_system_score_codex":0.0015341348,"about_ca_system_score_gemma":0.0014144172,"threshold_uncertainty_score":0.3430801},"labels":[],"label_agreement":null},{"id":"W2213036792","doi":"10.1007/978-3-319-13365-2_9","title":"Application of Game-Theoretic Rough Sets in Recommender Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Generality; Recommender system; Computer science; Property (philosophy); Set (abstract data type); Rough set; sort; Data mining; Artificial intelligence; Machine learning; Information retrieval","score_opus":0.015422617797209442,"score_gpt":0.24191708057993921,"score_spread":0.22649446278272978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213036792","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.007940821,0.0028334754,0.9776102,0.0012902735,0.0002255512,0.00007047117,0.00006859957,0.00006106244,0.009899543],"genre_scores_gemma":[0.53371453,0.00482043,0.4535513,0.0003314011,0.0006196846,0.0002415822,0.00012672362,0.000050474424,0.006543854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935737,0.004337632,0.00029983328,0.00041192098,0.0012081737,0.00016879976],"domain_scores_gemma":[0.98729867,0.010352346,0.00043246092,0.00084943854,0.000808791,0.0002583575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006528454,0.0009962522,0.0021435337,0.0015961925,0.0010185568,0.004201286,0.002662861,0.00179357,0.0026482972],"category_scores_gemma":[0.02026961,0.00090011343,0.0020654348,0.0022749095,0.0026604002,0.00482151,0.0029028875,0.0032597124,0.0003968577],"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.00003940044,0.00007963814,0.0004627519,0.0002063215,0.0001657296,0.000087295724,0.00032750962,0.1375487,0.00034263913,0.8158848,0.0019677435,0.042887364],"study_design_scores_gemma":[0.000014540045,0.00003898231,0.00016573258,0.000055064746,0.000035336307,0.000048556158,0.00006751507,0.3557169,0.00017356403,0.64069575,0.0029557934,0.000032148586],"about_ca_topic_score_codex":0.0039419923,"about_ca_topic_score_gemma":0.0031213611,"teacher_disagreement_score":0.006528454,"about_ca_system_score_codex":0.0022996005,"about_ca_system_score_gemma":0.0013687055,"threshold_uncertainty_score":0.03452617},"labels":[],"label_agreement":null},{"id":"W2213402020","doi":"10.1007/978-3-642-32796-4_2","title":"Supporting Sounds: Design and Evaluation of an Audio-Haptic Interface","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Haptic technology; Computer science; Interface (matter); Task (project management); Orientation (vector space); Human–computer interaction; Auditory feedback; Stereotaxy; Virtual reality; Virtual machine; Modal; Simulation; Engineering","score_opus":0.08635376685539252,"score_gpt":0.35007995653585444,"score_spread":0.2637261896804619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213402020","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.50507784,0.0012105843,0.48179466,0.00034407328,0.00044372873,0.0014444027,0.0005974366,0.0029157514,0.006171466],"genre_scores_gemma":[0.65952104,0.0005641711,0.3302383,0.0002825426,0.000059743885,0.0006515853,0.00033835857,0.0003146808,0.008029458],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910384,0.00018497102,0.000068873385,0.00012741567,0.00043193044,0.00008288123],"domain_scores_gemma":[0.9983432,0.00080040103,0.00007774206,0.00011849253,0.0005090508,0.00015109504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016069763,0.0007757506,0.00044475394,0.00049101975,0.000313731,0.0013409895,0.0024225323,0.0015272603,0.008240598],"category_scores_gemma":[0.0037132208,0.0003847609,0.00041990244,0.00025263216,0.0004063596,0.0010581964,0.0010280722,0.00040976724,0.0010328237],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037080818,0.0010009697,0.0018737288,0.0018264067,0.0001136688,0.00066256855,0.0011932661,0.0048227212,0.7527531,0.0016625953,0.0022239753,0.2281589],"study_design_scores_gemma":[0.0018620807,0.023929557,0.014520651,0.00039647045,0.0011532893,0.0035259398,0.001388369,0.12518118,0.7815713,0.00239344,0.043855324,0.00022242755],"about_ca_topic_score_codex":0.00038752117,"about_ca_topic_score_gemma":0.00041044867,"teacher_disagreement_score":0.008240598,"about_ca_system_score_codex":0.00021401647,"about_ca_system_score_gemma":0.00043015528,"threshold_uncertainty_score":0.027567565},"labels":[],"label_agreement":null},{"id":"W2213664160","doi":"10.1007/978-3-642-40787-1_18","title":"Reducing Monitoring Overhead by Integrating Event- and Time-Triggered Techniques","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Event (particle physics); Instrumentation (computer programming); Set (abstract data type); Runtime verification; Embedded system; State (computer science); Event monitoring; Real-time computing; Distributed computing; Program analysis; Execution time; Formal verification; Operating system; Wireless sensor network; Programming language","score_opus":0.017917282363314482,"score_gpt":0.28394053372725336,"score_spread":0.2660232513639389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213664160","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.010822023,0.00038373002,0.98115015,0.000117948155,0.00009885698,0.00010421323,0.00004906552,0.0046254955,0.0026486262],"genre_scores_gemma":[0.4106971,0.00055793993,0.581751,0.00023734846,0.00017038739,0.00015036964,0.00026135074,0.0010249778,0.005149571],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703276,0.00058571366,0.00025119763,0.00056242885,0.0013204468,0.0002474825],"domain_scores_gemma":[0.99189866,0.0038474167,0.0007949446,0.0024755523,0.0008023753,0.00018098792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017616182,0.0013878028,0.0008090429,0.0010926792,0.00038710874,0.001348515,0.0028745213,0.0009509474,0.005097656],"category_scores_gemma":[0.007438329,0.00058998377,0.0009059168,0.0010228485,0.0004609674,0.0032509442,0.0013320196,0.0018627333,0.0010323564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083953876,0.0006059399,0.001968872,0.0006804246,0.0001838071,0.00034232636,0.0002415767,0.052665584,0.18893117,0.035970263,0.005324956,0.71224546],"study_design_scores_gemma":[0.0002349257,0.00049416913,0.0021398584,0.00013700612,0.0005071386,0.0009418381,0.00009668226,0.6909611,0.218913,0.064946845,0.020521697,0.00010572231],"about_ca_topic_score_codex":0.0005505069,"about_ca_topic_score_gemma":0.001042308,"teacher_disagreement_score":0.005097656,"about_ca_system_score_codex":0.0004979213,"about_ca_system_score_gemma":0.0010635579,"threshold_uncertainty_score":0.017053366},"labels":[],"label_agreement":null},{"id":"W2214033462","doi":"10.1007/978-3-642-30353-1_20","title":"Analysis of Important Factors for Measuring Similarity of Symbolic Music Using n-gram-Based, Bag-of-Words Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Weighting; n-gram; Computer science; Similarity (geometry); Similarity measure; Measure (data warehouse); Gram; Artificial intelligence; Music information retrieval; Term (time); Feature (linguistics); Pattern recognition (psychology); Feature extraction; Data mining; Image (mathematics); Language model","score_opus":0.07157737518831658,"score_gpt":0.2709314573491997,"score_spread":0.19935408216088313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214033462","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.49932364,0.003969684,0.48590702,0.00025347443,0.00033908305,0.00042299676,0.0030820987,0.0030094904,0.0036925322],"genre_scores_gemma":[0.7404206,0.0008259231,0.2522088,0.000055409884,0.000117185766,0.00029848763,0.0045207697,0.0002391625,0.0013137064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753463,0.0004430817,0.00031498916,0.00036235494,0.0011091493,0.00023581609],"domain_scores_gemma":[0.9950895,0.0022419028,0.0004460876,0.00025230116,0.001680466,0.0002897426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015008429,0.0015020095,0.0013335433,0.006919149,0.0009838627,0.0013510359,0.0007761103,0.00091275765,0.0023675496],"category_scores_gemma":[0.008098061,0.00023754807,0.0014368534,0.0057513155,0.0005660124,0.0020772992,0.0011530531,0.0008095762,0.0018832281],"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.0031635389,0.0007590928,0.044591077,0.001639911,0.0007108102,0.0008137667,0.0009426166,0.010885877,0.1862468,0.0029826732,0.0059648887,0.741299],"study_design_scores_gemma":[0.00021902798,0.0026628224,0.19640517,0.00035270708,0.0014434267,0.003945887,0.0036617566,0.65630496,0.114358984,0.008644725,0.011457738,0.00054277765],"about_ca_topic_score_codex":0.004011082,"about_ca_topic_score_gemma":0.0056678546,"teacher_disagreement_score":0.006919149,"about_ca_system_score_codex":0.00040503632,"about_ca_system_score_gemma":0.0011909027,"threshold_uncertainty_score":0.007975519},"labels":[],"label_agreement":null},{"id":"W2214516423","doi":"10.1007/978-3-319-03161-3_19","title":"An Experimental Approach to Identifying Prominent Factors in Video Game Difficulty","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","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":"Western University","funders":"","keywords":"Testbed; Computer science; Set (abstract data type); Usability; Game design; Video game; Factorial analysis; Human–computer interaction; Game play; Factor (programming language); Video game design; Game Developer; Artificial intelligence; Multimedia; World Wide Web; Statistics; Mathematics","score_opus":0.039043146918219064,"score_gpt":0.3029832592117592,"score_spread":0.26394011229354014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214516423","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.9446254,0.00009873394,0.0321751,0.00019928567,0.00012516782,0.005082296,0.00061426853,0.00015817519,0.01692149],"genre_scores_gemma":[0.883527,0.00011033041,0.070611104,0.00030122488,0.00010163437,0.031727783,0.0006014348,0.00015024368,0.01286931],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99352694,0.002992624,0.0005120281,0.0012136749,0.001484311,0.0002704998],"domain_scores_gemma":[0.94192386,0.04615824,0.0030790044,0.004994201,0.0026668527,0.0011778229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055690217,0.001120799,0.0008442775,0.0010866098,0.002014972,0.0021952875,0.0023456383,0.0011533326,0.012354095],"category_scores_gemma":[0.035697825,0.001034655,0.0005476082,0.0010312638,0.002127058,0.0018380064,0.0025324866,0.0020221246,0.00096839055],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04898374,0.22889613,0.12664066,0.0023076676,0.00066322106,0.0003936898,0.031903446,0.0045679184,0.30385694,0.06853446,0.0050282865,0.17822385],"study_design_scores_gemma":[0.01753473,0.09891167,0.6404861,0.00028301697,0.0012396191,0.0006828672,0.016136987,0.045064088,0.10765087,0.051827706,0.019546723,0.0006356451],"about_ca_topic_score_codex":0.0018130522,"about_ca_topic_score_gemma":0.002433135,"teacher_disagreement_score":0.012354095,"about_ca_system_score_codex":0.0012887709,"about_ca_system_score_gemma":0.0017180878,"threshold_uncertainty_score":0.04132861},"labels":[],"label_agreement":null},{"id":"W2216859873","doi":"10.1007/978-3-319-66396-8","title":"Combinatorics on Words","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Université de La Réunion; Università di Bologna; Université de Liège; Università degli Studi di Firenze; University of Waterloo; Christian-Albrechts-Universität zu Kiel; Freie Universität Berlin; Université de Bordeaux; Grantová Agentura České Republiky; Université du Québec à Montréal; King's College London; Aix-Marseille Université; Université de Lyon; Université Savoie Mont Blanc; Dartmouth College; Université Paris Diderot; Murdoch University; Università degli Studi di Napoli Federico II","keywords":"Computer science; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.013754323225868849,"score_gpt":0.25010344606168783,"score_spread":0.236349122835819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216859873","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011433883,0.012846856,0.040529747,0.0030903046,0.0018146826,0.000042748936,0.00049925526,0.00040473032,0.9293378],"genre_scores_gemma":[0.26236004,0.02036438,0.018872323,0.0014536605,0.0035233367,0.00027050308,0.0017424168,0.0010660371,0.6903473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957746,0.00009214739,0.000025892206,0.00008172126,0.0001685374,0.000054327622],"domain_scores_gemma":[0.99972016,0.00009333098,0.000022020324,0.00007091889,0.00006116564,0.00003239301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020322244,0.0010246998,0.0008017791,0.0020956823,0.0017094933,0.0042788666,0.0006523914,0.0005092237,0.03068743],"category_scores_gemma":[0.00093693915,0.00049288495,0.000701139,0.0026924505,0.0030365228,0.005914567,0.0022789596,0.0021215,0.012922826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009654004,0.0000056311524,0.00003028221,0.00006988497,0.000004389408,0.000021624077,0.0001945553,0.0002225628,0.0003217586,0.9639531,0.01350043,0.021666113],"study_design_scores_gemma":[0.0000037119592,0.0000045938887,0.00005379476,0.00003484525,0.0000045417805,0.00006375937,0.00008186224,0.00022487732,0.00020787878,0.87086684,0.12844826,0.000005100596],"about_ca_topic_score_codex":0.0009201067,"about_ca_topic_score_gemma":0.00086366956,"teacher_disagreement_score":0.03068743,"about_ca_system_score_codex":0.00179716,"about_ca_system_score_gemma":0.0008554967,"threshold_uncertainty_score":0.10265964},"labels":[],"label_agreement":null},{"id":"W2217207442","doi":"10.1007/978-3-642-32115-3_23","title":"Optimization of Quadtree Representation and Compression","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"McMaster University","funders":"","keywords":"Quadtree; Computer science; Representation (politics); Node (physics); Heuristic; Data compression; Algorithm; Compression (physics); R-tree; Theoretical computer science; Spatial analysis; Artificial intelligence; Spatial database; Mathematics; Statistics","score_opus":0.023680281446400418,"score_gpt":0.26125002521301244,"score_spread":0.23756974376661202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217207442","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.02275829,0.00086309534,0.962128,0.00023173208,0.00009925042,0.000058316167,0.00022228995,0.0010668392,0.012572146],"genre_scores_gemma":[0.23108707,0.0008412672,0.7542715,0.000109679495,0.000086325774,0.000121247234,0.00063773827,0.0008550312,0.011990052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.00006283206,0.000017608074,0.000049914164,0.00022351168,0.000058864436],"domain_scores_gemma":[0.999445,0.00022887602,0.000035934303,0.00011962234,0.00014964276,0.00002088726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004044244,0.00064759015,0.0007167708,0.00088686054,0.00027062235,0.0011755532,0.00096647104,0.0007424817,0.010442376],"category_scores_gemma":[0.0026198258,0.00034325663,0.0004225248,0.0019028779,0.00037811827,0.0015586866,0.00095890823,0.0008138031,0.001687272],"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.00015238655,0.00011712498,0.00037543205,0.00017191318,0.000025860476,0.00006723164,0.000056019417,0.2803176,0.02870157,0.04668885,0.012001484,0.6313246],"study_design_scores_gemma":[0.000014981122,0.000047916874,0.00024725465,0.000016666922,0.0000111744885,0.000108118875,0.000025293173,0.9657965,0.008543985,0.02058926,0.004588607,0.000010312639],"about_ca_topic_score_codex":0.0018894459,"about_ca_topic_score_gemma":0.0030038017,"teacher_disagreement_score":0.010442376,"about_ca_system_score_codex":0.0006487608,"about_ca_system_score_gemma":0.00080793654,"threshold_uncertainty_score":0.03493321},"labels":[],"label_agreement":null},{"id":"W2217696398","doi":"10.1007/978-3-642-33415-3_56","title":"Development of an MRI-Compatible Device for Prostate Focal Therapy","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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 Health Network; Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Computer vision","score_opus":0.03666491014856499,"score_gpt":0.3221327239815275,"score_spread":0.2854678138329625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217696398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09272457,0.0038943712,0.8771308,0.001604343,0.0019291558,0.0015201134,0.0009263502,0.005673046,0.0145972585],"genre_scores_gemma":[0.28406733,0.0018014066,0.68430936,0.0012863702,0.00023347832,0.0006692865,0.0008817049,0.00058728416,0.026163772],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994506,0.0000613739,0.000037023532,0.000091023125,0.00030950003,0.000050366645],"domain_scores_gemma":[0.99933404,0.00014495307,0.00007617205,0.00007747274,0.0002688374,0.00009855234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085494167,0.00066968135,0.00052867614,0.00060058385,0.0003422866,0.0007662968,0.0018634816,0.0013328119,0.005599682],"category_scores_gemma":[0.0010947848,0.00042552908,0.0005442854,0.00032264774,0.00022890966,0.000928737,0.0007247433,0.000658997,0.0024704684],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039838717,0.00019604039,0.0017631752,0.00057228253,0.00006867236,0.000772546,0.0001944994,0.0007750366,0.8508558,0.0034896992,0.007246454,0.13366736],"study_design_scores_gemma":[0.00019987772,0.0038235656,0.008447727,0.0001643585,0.00024430163,0.007260798,0.00012077107,0.015036458,0.81426245,0.00076101435,0.14946738,0.00021140507],"about_ca_topic_score_codex":0.00029860798,"about_ca_topic_score_gemma":0.00033220212,"teacher_disagreement_score":0.005599682,"about_ca_system_score_codex":0.0002432129,"about_ca_system_score_gemma":0.00083603297,"threshold_uncertainty_score":0.018732786},"labels":[],"label_agreement":null},{"id":"W2218431329","doi":"10.1007/978-3-642-30353-1_15","title":"Applying Least Angle Regression to ELM","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and ELM","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 Ottawa","funders":"","keywords":"Outlier; Computer science; Extreme learning machine; Collinearity; Artificial neural network; Regularization (linguistics); Algorithm; Artificial intelligence; Pattern recognition (psychology); Data mining; Machine learning; Statistics; Mathematics","score_opus":0.017596948029440198,"score_gpt":0.26169933853983623,"score_spread":0.24410239051039603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218431329","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.0014428247,0.00023795385,0.99637944,0.00007326424,0.00007502382,0.00001010642,0.000038987862,0.000643197,0.001099311],"genre_scores_gemma":[0.10046758,0.00075184065,0.8794009,0.0002592464,0.00030288097,0.00009947066,0.0006022933,0.0011587987,0.016957061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991905,0.0003092401,0.0000454107,0.00017845615,0.00022183423,0.000054622185],"domain_scores_gemma":[0.9985638,0.00077739445,0.000077453944,0.00020589563,0.00033932048,0.00003604544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018831625,0.0010753486,0.001211269,0.0010699537,0.0004702922,0.0013731669,0.0017532109,0.0012810676,0.008350825],"category_scores_gemma":[0.0059183557,0.00069082517,0.00091717974,0.0017678519,0.0006505489,0.0014539493,0.0016830516,0.002373282,0.004721949],"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.000102246966,0.00010239665,0.00088971003,0.00017571553,0.00013560476,0.00008715787,0.00007355931,0.3515883,0.006738608,0.02878369,0.010962449,0.6003606],"study_design_scores_gemma":[0.0000052587525,0.000011838231,0.00015506332,0.000010018186,0.000009252805,0.000020549753,0.000011361364,0.9813095,0.0015717803,0.013496562,0.0033910426,0.000007753321],"about_ca_topic_score_codex":0.002949435,"about_ca_topic_score_gemma":0.0032941957,"teacher_disagreement_score":0.008350825,"about_ca_system_score_codex":0.00054829154,"about_ca_system_score_gemma":0.00059821905,"threshold_uncertainty_score":0.02793628},"labels":[],"label_agreement":null},{"id":"W2218492333","doi":"10.1007/978-3-319-07956-1_18","title":"Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta","funders":"","keywords":"Digraph; Combinatorics; Shortest path problem; Undirected graph; Floyd–Warshall algorithm; Mathematics; Arc (geometry); Algorithm; Discrete mathematics; Computer science; K shortest path routing; Graph","score_opus":0.011084221733546137,"score_gpt":0.24170862491285053,"score_spread":0.23062440317930438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218492333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150312,0.001333795,0.7189349,0.0015972336,0.00029031513,0.00029859497,0.0033152122,0.0010028885,0.058195855],"genre_scores_gemma":[0.7233083,0.0022512511,0.23199116,0.00031317587,0.0002310903,0.00040487156,0.0031170526,0.00046443127,0.037918713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934286,0.0001130856,0.00003903433,0.00022024373,0.00018291247,0.00010182563],"domain_scores_gemma":[0.9972146,0.0015989719,0.00027802878,0.00030050924,0.0003697674,0.00023812312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004227244,0.0011225776,0.0010363656,0.0016825228,0.0012444876,0.0022122704,0.0017185909,0.0011487079,0.00672794],"category_scores_gemma":[0.0039517214,0.0008846885,0.0008242944,0.0034087026,0.00089107704,0.0044357227,0.0017374692,0.002009291,0.0011436086],"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.00030920134,0.00015069853,0.000887304,0.0012382116,0.00013201343,0.0006772919,0.0005993953,0.14959347,0.011429044,0.67879444,0.017001491,0.1391875],"study_design_scores_gemma":[0.00005478868,0.00005809792,0.00034252892,0.00010398354,0.000056902692,0.00043451317,0.00020564745,0.15834525,0.0030952215,0.82620525,0.011062633,0.00003511944],"about_ca_topic_score_codex":0.0015823308,"about_ca_topic_score_gemma":0.0030898107,"teacher_disagreement_score":0.00672794,"about_ca_system_score_codex":0.001551853,"about_ca_system_score_gemma":0.0010777017,"threshold_uncertainty_score":0.02250719},"labels":[],"label_agreement":null},{"id":"W2219295561","doi":"10.1007/978-3-662-44733-8_20","title":"A Hybrid Method for Solving Buffer Sizing and Inspection Stations Allocation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Sizing; Tabu search; Mathematical optimization; Computer science; Genetic algorithm; Generalization; Buffer (optical fiber); Economic shortage; Algorithm; Mathematics","score_opus":0.013520965354946879,"score_gpt":0.25070116524739877,"score_spread":0.2371801998924519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219295561","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.0042755036,0.00016863731,0.99263364,0.00004412806,0.00007552435,0.000051912575,0.00005459018,0.00042793708,0.0022681565],"genre_scores_gemma":[0.116070725,0.00017449025,0.8752612,0.0001184149,0.00009470383,0.0003938778,0.00017231813,0.00020485876,0.0075093717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959046,0.00009978701,0.000020173038,0.000086240114,0.00015681134,0.00004657299],"domain_scores_gemma":[0.9992067,0.0005034799,0.000039923558,0.00004612683,0.0001669989,0.000036801404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086301356,0.0011697325,0.0013467431,0.00087471266,0.0005409518,0.0008920251,0.002507682,0.001860334,0.006998058],"category_scores_gemma":[0.0013873087,0.0010267969,0.0011946463,0.0011519135,0.0005722743,0.0008847627,0.0010905509,0.0012064782,0.0009043352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001284704,0.00010716696,0.00029766015,0.0002092865,0.000089655674,0.00007636217,0.00005697883,0.853903,0.005570645,0.00660794,0.0021661196,0.13078666],"study_design_scores_gemma":[0.000013800943,0.000018470699,0.000033326683,0.0000040430855,0.000006330843,0.000009514096,0.0000040890004,0.9982339,0.00028272485,0.0009058929,0.00048405505,0.0000037664754],"about_ca_topic_score_codex":0.009226271,"about_ca_topic_score_gemma":0.011738083,"teacher_disagreement_score":0.009226271,"about_ca_system_score_codex":0.0006778238,"about_ca_system_score_gemma":0.001467532,"threshold_uncertainty_score":0.023410857},"labels":[],"label_agreement":null},{"id":"W2220109089","doi":"10.1007/978-3-319-16214-0_6","title":"Operand-Value-Based Modeling of Dynamic Energy Consumption of Soft Processors in FPGA","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Concordia University","funders":"","keywords":"Operand; Computer science; Field-programmable gate array; Parallel computing; Energy consumption; Software; Energy (signal processing); Value (mathematics); Soft error; Embedded system; Computer hardware; Programming language; Electronic engineering; Mathematics","score_opus":0.028123439084828093,"score_gpt":0.27682106088749653,"score_spread":0.24869762180266844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220109089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17520384,0.0033254616,0.7653382,0.0004903223,0.0001990905,0.00006843665,0.00045558217,0.00086482044,0.054054294],"genre_scores_gemma":[0.96387786,0.0009630374,0.018051611,0.000067979854,0.00003037613,0.000041480853,0.00013605304,0.00013113224,0.016700517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998796,0.000018433167,0.000005548471,0.000018159522,0.00005338389,0.000024800564],"domain_scores_gemma":[0.99983346,0.00008208607,0.00001690127,0.000021832982,0.000038258848,0.000007453689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016239322,0.0005001177,0.00039248096,0.00031959216,0.0002003498,0.0007600351,0.0011864048,0.0005154185,0.004164492],"category_scores_gemma":[0.0006069483,0.00029164104,0.0004153069,0.00048415354,0.00028761372,0.0008762188,0.00025592005,0.00053478923,0.0006818456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033003853,0.000015640862,0.00025100025,0.000039849143,0.000009634089,0.000054322125,0.000019648744,0.9758245,0.0036098151,0.011301412,0.00036817143,0.008473025],"study_design_scores_gemma":[8.292349e-7,0.0000042369356,0.00005853334,0.000002496054,0.0000020954499,0.000009956139,0.0000021102842,0.9980369,0.0004941005,0.001162278,0.00022511039,0.000001410346],"about_ca_topic_score_codex":0.0045907665,"about_ca_topic_score_gemma":0.005149095,"teacher_disagreement_score":0.0045907665,"about_ca_system_score_codex":0.00083991844,"about_ca_system_score_gemma":0.00048833404,"threshold_uncertainty_score":0.013931572},"labels":[],"label_agreement":null},{"id":"W2220266781","doi":"10.1007/978-3-319-24574-4_3","title":"Multimodal Cortical Parcellation Based on Anatomical and Functional Brain Connectivity","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Human Connectome Project; Functional magnetic resonance imaging; Spurious relationship; Robustness (evolution); Pattern recognition (psychology); Cluster analysis; Connectome; Weighting; Functional connectivity; Machine learning; Neuroscience; Psychology","score_opus":0.06352721780385819,"score_gpt":0.330669639901175,"score_spread":0.2671424220973168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220266781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04493168,0.0019302631,0.9395496,0.00037143848,0.00013447597,0.00011236101,0.0009987878,0.002763032,0.009208262],"genre_scores_gemma":[0.49452302,0.0036577429,0.486814,0.00018841596,0.0004047822,0.00027458186,0.002370741,0.001347732,0.0104190055],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977595,0.000036664893,0.000009125213,0.000066110326,0.00006998422,0.000042205986],"domain_scores_gemma":[0.99970967,0.000113560665,0.000031372707,0.00005313094,0.00007180435,0.000020376487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353461,0.0010587822,0.0007247329,0.0015965269,0.00033500599,0.0017271438,0.00080913724,0.00066731765,0.0062123393],"category_scores_gemma":[0.0016652801,0.000348991,0.0009287613,0.0021867736,0.0004886234,0.0012892976,0.0009110607,0.0004950617,0.0029639516],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040427182,0.00004189955,0.00240163,0.00029380588,0.00025450095,0.00038722582,0.00030192616,0.020060698,0.19472864,0.007835388,0.010356925,0.7629331],"study_design_scores_gemma":[0.000065312626,0.00032745645,0.04864909,0.00015200766,0.0007841129,0.0038120502,0.0006158733,0.6631434,0.1836388,0.06537725,0.03322865,0.00020604683],"about_ca_topic_score_codex":0.001472142,"about_ca_topic_score_gemma":0.003118662,"teacher_disagreement_score":0.0062123393,"about_ca_system_score_codex":0.00031071092,"about_ca_system_score_gemma":0.00026394476,"threshold_uncertainty_score":0.020782411},"labels":[],"label_agreement":null},{"id":"W2220384749","doi":"10.1007/978-3-540-77120-3_10","title":"Dilation-Optimal Edge Deletion in Polygonal Cycles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Dilation (metric space); Convex polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Path (computing); Time complexity; Running time; Enhanced Data Rates for GSM Evolution; Time dilation; Mathematics; Polygonal chain; Computer science; Algorithm; Geometry; Physics; Artificial intelligence","score_opus":0.02255068646276365,"score_gpt":0.2673628671819231,"score_spread":0.24481218071915944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220384749","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.16358349,0.0013214181,0.8029477,0.0005698944,0.00039649915,0.00025112016,0.00035802252,0.0012598962,0.02931205],"genre_scores_gemma":[0.44552386,0.0012911183,0.5302787,0.00021370043,0.00013300293,0.00019219186,0.0008095277,0.0008919152,0.02066612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947447,0.00009468122,0.000035768266,0.00010786012,0.00018117843,0.0001060076],"domain_scores_gemma":[0.9986494,0.00070326735,0.00010843729,0.00028607753,0.00014861394,0.000104180945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005536785,0.00090788695,0.0016977466,0.0009207666,0.0007820663,0.0011212517,0.0020656206,0.0010386489,0.006226035],"category_scores_gemma":[0.00396811,0.0007690657,0.00068070577,0.0016527522,0.0009864386,0.0018633434,0.0023899034,0.0013763201,0.0009995846],"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.00076521665,0.00026983843,0.001101236,0.00073350075,0.00005479965,0.0004960753,0.0004989796,0.23344423,0.028342886,0.16624029,0.018233567,0.5498194],"study_design_scores_gemma":[0.00017850348,0.00024117042,0.0007314777,0.00012580014,0.000074743184,0.0005822026,0.00032301003,0.724143,0.019957721,0.23194948,0.021646842,0.000046059446],"about_ca_topic_score_codex":0.0012958866,"about_ca_topic_score_gemma":0.0017671731,"teacher_disagreement_score":0.006226035,"about_ca_system_score_codex":0.0006398524,"about_ca_system_score_gemma":0.00059624726,"threshold_uncertainty_score":0.020828128},"labels":[],"label_agreement":null},{"id":"W2220646374","doi":"10.1007/978-3-319-29221-2_8","title":"Linear-Time Fitting of a k-Step Function","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Histogram; Computer science; Algorithm; Function (biology); Constant (computer programming); Set (abstract data type); Point (geometry); Plane (geometry); Line (geometry); Center (category theory); Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Image (mathematics)","score_opus":0.013193087199052449,"score_gpt":0.2330798873075431,"score_spread":0.21988680010849063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220646374","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.008427152,0.000052553998,0.98608714,0.0000695236,0.000055763776,0.00002975296,0.00007697852,0.0017112065,0.0034899074],"genre_scores_gemma":[0.14886926,0.000106995816,0.83411694,0.000108994325,0.000033485816,0.000078156285,0.0005335199,0.0014219886,0.014730586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956626,0.000076745295,0.000023311539,0.00008790085,0.0001940857,0.00005161977],"domain_scores_gemma":[0.99895704,0.00038918084,0.000046180612,0.00032040293,0.00022929415,0.000057899055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076613325,0.00078172726,0.0007278343,0.00054934353,0.00052843854,0.001163853,0.0016306652,0.0016273445,0.016744303],"category_scores_gemma":[0.003971302,0.00053249137,0.0007896699,0.0008362688,0.0005018966,0.0014320953,0.0014479388,0.0014983774,0.008028359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004830667,0.00020247693,0.0017417615,0.0003599736,0.00011050828,0.0002498663,0.00034836572,0.25611064,0.052789964,0.05824808,0.014815191,0.61454016],"study_design_scores_gemma":[0.000011076433,0.000023382732,0.00027935163,0.000012081491,0.0000096214635,0.00009373774,0.000041603726,0.97747576,0.009571609,0.006756392,0.0057087853,0.000016636675],"about_ca_topic_score_codex":0.003530677,"about_ca_topic_score_gemma":0.004397219,"teacher_disagreement_score":0.016744303,"about_ca_system_score_codex":0.0006878767,"about_ca_system_score_gemma":0.00092054997,"threshold_uncertainty_score":0.056015313},"labels":[],"label_agreement":null},{"id":"W2220865352","doi":"10.1007/978-3-642-25832-9_81","title":"Tracking the Preferences of Users Using Weak Estimators","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Estimator; Computer science; Range (aeronautics); Recommender system; Stationary distribution; Tracking (education); Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.06010385224687988,"score_gpt":0.2823053588958295,"score_spread":0.2222015066489496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220865352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092733584,0.0006760694,0.90444326,0.00035102677,0.000088804816,0.00006161393,0.0003318503,0.00022846508,0.0010853084],"genre_scores_gemma":[0.83222365,0.0010307383,0.1604638,0.0002328799,0.00037594212,0.00015312963,0.0008827015,0.000091166905,0.004545999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777406,0.0009743319,0.00013634335,0.0005083219,0.00042382345,0.00018313075],"domain_scores_gemma":[0.98438174,0.011653082,0.0008181367,0.001336448,0.0013804581,0.00043011192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005463004,0.001085887,0.0017682735,0.0015319583,0.00039935467,0.0023724989,0.0016988986,0.0012582798,0.0013766238],"category_scores_gemma":[0.024725782,0.0006335697,0.0007659208,0.0019859124,0.0007172778,0.0044063274,0.0015965566,0.0022371109,0.0009019111],"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.0023476917,0.00088384445,0.12205915,0.00070696906,0.000897181,0.000356513,0.0009025549,0.21673056,0.025760803,0.043913495,0.0076883715,0.5777528],"study_design_scores_gemma":[0.000018623392,0.00015312574,0.00322949,0.000016665299,0.000049723607,0.00008885774,0.00009624595,0.9770477,0.002736912,0.015807917,0.00073418743,0.000020562222],"about_ca_topic_score_codex":0.0014305231,"about_ca_topic_score_gemma":0.002003828,"teacher_disagreement_score":0.005463004,"about_ca_system_score_codex":0.00042799397,"about_ca_system_score_gemma":0.0005386732,"threshold_uncertainty_score":0.028891444},"labels":[],"label_agreement":null},{"id":"W2220966158","doi":"10.1007/978-3-319-19066-2_20","title":"Integrating TCP-Nets and CSPs: The Constrained TCP-Net (CTCP-Net) Model","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Net (polyhedron); Computer science; Mathematics; Geometry","score_opus":0.02496630554524978,"score_gpt":0.25208001702801275,"score_spread":0.22711371148276296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220966158","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.006864265,0.000816166,0.94661623,0.0009794622,0.00026551186,0.00013863426,0.0005017939,0.00055082433,0.0432671],"genre_scores_gemma":[0.31932005,0.0043840376,0.6230083,0.0007009818,0.0004292575,0.000701367,0.0020579034,0.00070207036,0.04869604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989247,0.00030480194,0.00006824948,0.00018084874,0.00039072902,0.0001307613],"domain_scores_gemma":[0.99881893,0.00045145597,0.00009434097,0.00024968668,0.0002487842,0.00013683503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297767,0.00081597996,0.0006211018,0.00077442214,0.0010574678,0.0031839544,0.00238683,0.0014503725,0.0070054666],"category_scores_gemma":[0.0031873505,0.00066915946,0.001110424,0.0025826565,0.0019296895,0.006312848,0.0028145516,0.0034975256,0.0013437184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040108862,0.000036791254,0.0001935422,0.00012745694,0.000016390886,0.0001570264,0.00008021593,0.08008572,0.0008279063,0.88476,0.005313085,0.028361697],"study_design_scores_gemma":[0.00001805535,0.000022649292,0.00008976346,0.00007240394,0.000030303274,0.00016144576,0.00006195513,0.34042588,0.0013960999,0.61962056,0.038075935,0.00002486765],"about_ca_topic_score_codex":0.010130183,"about_ca_topic_score_gemma":0.0108515695,"teacher_disagreement_score":0.010130183,"about_ca_system_score_codex":0.0018579572,"about_ca_system_score_gemma":0.0035629459,"threshold_uncertainty_score":0.023435593},"labels":[],"label_agreement":null},{"id":"W2221045997","doi":"10.1007/978-3-642-32946-3_9","title":"Congestion-Aware Path Selection for Tor","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Selection (genetic algorithm); Path (computing); Computer network; Artificial intelligence","score_opus":0.01610249273095795,"score_gpt":0.24214260598931286,"score_spread":0.2260401132583549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221045997","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.13376057,0.0020445625,0.8389953,0.00067759445,0.0003014611,0.0003224541,0.00054069445,0.0058069015,0.01755046],"genre_scores_gemma":[0.88995486,0.00038762586,0.10266865,0.00006609358,0.00008419359,0.00007532116,0.00033313758,0.00017538467,0.0062546935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994628,0.00012210151,0.000022452838,0.000093508184,0.0001201253,0.00017908981],"domain_scores_gemma":[0.99928916,0.00030357324,0.00004583026,0.00013845944,0.00014689633,0.000076017546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008239752,0.00081770873,0.0013536589,0.00083075877,0.0010456986,0.0010493521,0.0016411124,0.0005208002,0.0056333016],"category_scores_gemma":[0.0020576182,0.00030531283,0.00041570497,0.00072230515,0.00043123256,0.0011008641,0.0011022488,0.0006880715,0.000624703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001011527,0.00023244706,0.0013067002,0.00024630615,0.00009506591,0.00026460201,0.00020697695,0.50371975,0.013873651,0.022756733,0.020440534,0.43584567],"study_design_scores_gemma":[0.00002665164,0.00008504402,0.00023432507,0.0000115523,0.000025722262,0.00008849254,0.00006135138,0.98530585,0.0020238892,0.010407904,0.0017149614,0.000014286943],"about_ca_topic_score_codex":0.00502343,"about_ca_topic_score_gemma":0.010766346,"teacher_disagreement_score":0.0056333016,"about_ca_system_score_codex":0.0009807542,"about_ca_system_score_gemma":0.00130912,"threshold_uncertainty_score":0.01884526},"labels":[],"label_agreement":null},{"id":"W2221612124","doi":"10.1007/978-3-319-11164-3_8","title":"Robust Consistency Checking for Modern Filesystems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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 Toronto","funders":"","keywords":"Computer science; Consistency (knowledge bases); File system; Metadata; Model checking; Programming language; Weak consistency; Operating system; Data consistency; Database; Strong consistency; Artificial intelligence; Mathematics","score_opus":0.050179562670788894,"score_gpt":0.2545792941610283,"score_spread":0.20439973149023943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221612124","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.021520888,0.0012500369,0.9672088,0.0004995853,0.00016265761,0.00011494916,0.00024515306,0.0051002568,0.00389763],"genre_scores_gemma":[0.5761403,0.0009195647,0.4142427,0.00031200843,0.00030214747,0.00016016887,0.00075057225,0.0010424927,0.006130162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99033314,0.0019267098,0.0006436103,0.0013852724,0.0050624255,0.00064878876],"domain_scores_gemma":[0.98036355,0.00840278,0.0014032059,0.007766433,0.0018979411,0.00016608786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051996186,0.0010052429,0.0012089096,0.0017544975,0.0008894357,0.0027778312,0.0034959733,0.0017021933,0.0044389544],"category_scores_gemma":[0.020901695,0.00125487,0.0018629505,0.0017328423,0.0032704028,0.0058675245,0.0036693036,0.0034392232,0.0010025984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010567986,0.00015576447,0.0014625959,0.0008394698,0.00025079594,0.00032944878,0.00039237464,0.16417353,0.041630816,0.34124926,0.012519268,0.43593988],"study_design_scores_gemma":[0.00013586735,0.00015453024,0.00063783524,0.00016444169,0.0001061697,0.00033317818,0.00006675649,0.4037301,0.049641006,0.5340189,0.010929278,0.00008201984],"about_ca_topic_score_codex":0.0015501959,"about_ca_topic_score_gemma":0.0012903252,"teacher_disagreement_score":0.0051996186,"about_ca_system_score_codex":0.0018832298,"about_ca_system_score_gemma":0.001853376,"threshold_uncertainty_score":0.027498603},"labels":[],"label_agreement":null},{"id":"W2222013231","doi":"10.1007/978-3-642-41924-9_6","title":"Is Traditional Conceptual Modeling Becoming Obsolete?","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Conceptual model; Conceptual framework; Conceptual schema; Domain model; Domain (mathematical analysis); Data science; Management science; Systems modeling; Knowledge management; Software engineering; Domain knowledge; Engineering; Database; Epistemology","score_opus":0.06451264271496192,"score_gpt":0.25754507734681814,"score_spread":0.1930324346318562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222013231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021752521,0.023297722,0.468581,0.320709,0.0048860162,0.000057715857,0.00081752246,0.003425244,0.15647328],"genre_scores_gemma":[0.6022359,0.035065223,0.2542701,0.05044605,0.0075764447,0.00029173438,0.0022655881,0.0027793404,0.045069605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864166,0.005351959,0.00073189783,0.0016959151,0.0052296305,0.00057410577],"domain_scores_gemma":[0.94067043,0.033346366,0.0023319512,0.0138854245,0.008416203,0.001349568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024672914,0.0007096809,0.0011787422,0.0029637897,0.0016031883,0.013544101,0.0055358973,0.0033486504,0.013542299],"category_scores_gemma":[0.045559306,0.0009579782,0.0012598329,0.0039963056,0.0131393755,0.046404127,0.005026806,0.007193791,0.005443696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034291326,0.00003636266,0.0006145652,0.00021958892,0.000025519825,0.00003733373,0.0009473463,0.0005200633,0.00019583595,0.85600686,0.02036464,0.120997526],"study_design_scores_gemma":[0.0000150193255,0.00001429147,0.00022918003,0.00023900782,0.000022563801,0.00012877617,0.00083799084,0.0030688115,0.00026999117,0.84677607,0.14837915,0.000019035304],"about_ca_topic_score_codex":0.005016892,"about_ca_topic_score_gemma":0.0030478192,"teacher_disagreement_score":0.024672914,"about_ca_system_score_codex":0.0045384336,"about_ca_system_score_gemma":0.0052053193,"threshold_uncertainty_score":0.1304844},"labels":[],"label_agreement":null},{"id":"W2222770805","doi":"10.1007/978-3-642-41827-3_14","title":"An Arabic Optical Character Recognition System Using Restricted Boltzmann Machines","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hidden Markov model; Computer science; Character (mathematics); Arabic; Optical character recognition; Boltzmann machine; Artificial intelligence; Speech recognition; Natural language processing; Pattern recognition (psychology); Artificial neural network; Linguistics; Image (mathematics); Mathematics","score_opus":0.0263644193559066,"score_gpt":0.2605655171339826,"score_spread":0.23420109777807602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222770805","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.1089874,0.0011568088,0.8533835,0.0005294704,0.00090015575,0.0002915498,0.00038902846,0.020624569,0.013737438],"genre_scores_gemma":[0.5637464,0.000426939,0.41247427,0.0004841485,0.00014582137,0.00019469485,0.0005804462,0.000247181,0.021700049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997986,0.000020048745,0.000015210359,0.00006693229,0.0000637434,0.00003545044],"domain_scores_gemma":[0.9997466,0.00004761354,0.000014951393,0.00003841141,0.00012170621,0.00003075519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847106,0.0006947605,0.00073613034,0.00036754293,0.00062024227,0.00075726875,0.00080152164,0.0007322884,0.004944301],"category_scores_gemma":[0.00054734753,0.00031219586,0.00041923387,0.00045504209,0.0002082533,0.0009005518,0.0005366668,0.0006502077,0.002508923],"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.0006355467,0.00021606649,0.0010585128,0.0002091773,0.00008975239,0.00035211773,0.00010119166,0.02204669,0.20964088,0.0020099252,0.009196476,0.7544437],"study_design_scores_gemma":[0.00006890374,0.00043588848,0.0023194184,0.000040695995,0.00017078414,0.00046536492,0.00008446733,0.80084646,0.1753559,0.0024432773,0.017660541,0.000108332286],"about_ca_topic_score_codex":0.0031286147,"about_ca_topic_score_gemma":0.004065275,"teacher_disagreement_score":0.004944301,"about_ca_system_score_codex":0.00033244514,"about_ca_system_score_gemma":0.0005844429,"threshold_uncertainty_score":0.016540289},"labels":[],"label_agreement":null},{"id":"W2222821827","doi":"10.1007/978-3-662-49674-9_28","title":"Approaching the Coverability Problem Continuously","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"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":"Petri net; Computer science; Reachability; Reachability problem; Pruning; Theoretical computer science; Encoding (memory); Process architecture; Programming language; Algorithm; Artificial intelligence","score_opus":0.024608110521431154,"score_gpt":0.2624790926917302,"score_spread":0.23787098217029903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222821827","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.058179382,0.003495001,0.7069354,0.01097649,0.000959668,0.0001142113,0.00032091985,0.000551782,0.21846713],"genre_scores_gemma":[0.81474245,0.004281124,0.11255301,0.0017046597,0.0018438409,0.00034453036,0.00087499706,0.0010505625,0.06260483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788696,0.0005264468,0.00006323771,0.00041210552,0.0008158846,0.0002953225],"domain_scores_gemma":[0.9899906,0.0072322087,0.00034906983,0.0014557232,0.0006391746,0.0003332565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018737295,0.00095315883,0.0013684514,0.0013452221,0.00164265,0.0030430777,0.0021561403,0.0025322228,0.013534109],"category_scores_gemma":[0.017740702,0.0009684819,0.001349557,0.0011035537,0.004052638,0.012868484,0.0053695673,0.0067135673,0.0016640153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004165753,0.00002527732,0.00016993556,0.000101925514,0.000015811942,0.000117466465,0.00018652223,0.004397276,0.0014507385,0.9711159,0.0045500044,0.017827423],"study_design_scores_gemma":[0.000007058627,0.000011425225,0.000051271985,0.000032175027,0.0000068356317,0.00007970234,0.00004113695,0.016969359,0.00069456216,0.97445446,0.007646005,0.0000060430184],"about_ca_topic_score_codex":0.0008070981,"about_ca_topic_score_gemma":0.00079176994,"teacher_disagreement_score":0.013534109,"about_ca_system_score_codex":0.0015909456,"about_ca_system_score_gemma":0.00082274457,"threshold_uncertainty_score":0.045276046},"labels":[],"label_agreement":null},{"id":"W2222888818","doi":"10.1007/11574798","title":"Transactions on Rough Sets IV","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":63,"is_retracted":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":"Rough set; Computer science; Business; Artificial intelligence","score_opus":0.017096510347036374,"score_gpt":0.2481352235547547,"score_spread":0.23103871320771832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222888818","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075546256,0.1200667,0.63087445,0.0094145425,0.019289305,0.00018140118,0.0012400282,0.0007681039,0.21061082],"genre_scores_gemma":[0.2911589,0.11208925,0.35311404,0.0018335662,0.010876039,0.00062720315,0.0023332231,0.000561156,0.22740664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977404,0.00061161496,0.00025807394,0.00021020639,0.0011035529,0.00007617834],"domain_scores_gemma":[0.99826753,0.00062946306,0.000090718255,0.0006139268,0.0003500168,0.000048361617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021528802,0.0010767417,0.0033722394,0.0018410182,0.00081824814,0.004430317,0.00083180005,0.0010374038,0.015893081],"category_scores_gemma":[0.0060712285,0.0006926061,0.001759374,0.0031234645,0.0017568767,0.002506356,0.0015451786,0.0025641627,0.0054870103],"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.000054367647,0.000027502407,0.00021126372,0.0004721352,0.0001521317,0.00009276816,0.0002041056,0.007456943,0.0006465279,0.6925272,0.050271787,0.24788332],"study_design_scores_gemma":[0.00002114309,0.00004758357,0.00047236064,0.00021788558,0.00010240237,0.00018364855,0.00009686628,0.013207435,0.0005016377,0.75405324,0.23107146,0.000024350964],"about_ca_topic_score_codex":0.0011299289,"about_ca_topic_score_gemma":0.0007223227,"teacher_disagreement_score":0.015893081,"about_ca_system_score_codex":0.0012817095,"about_ca_system_score_gemma":0.001088005,"threshold_uncertainty_score":0.05316764},"labels":[],"label_agreement":null},{"id":"W2223539003","doi":"10.1007/978-3-319-26535-3_58","title":"On the Discovery of Time Distance Constrained Temporal Association Rules","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Bishop's University","funders":"","keywords":"Computer science; Association rule learning; Singleton; Multiset; Constraint (computer-aided design); Data mining; Knowledge extraction; Time constraint; Set (abstract data type); Event (particle physics); Artificial intelligence; Mathematics","score_opus":0.018159200885518242,"score_gpt":0.24324942796916096,"score_spread":0.22509022708364274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223539003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08527411,0.004362777,0.90186936,0.0016744907,0.0002605559,0.00030376436,0.0022827454,0.0008147729,0.0031573486],"genre_scores_gemma":[0.35289815,0.004272315,0.6263231,0.0010017718,0.0006484941,0.0005256042,0.008961452,0.00022100817,0.0051481887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992751,0.0015891929,0.0009272576,0.0016894758,0.002590311,0.00045274416],"domain_scores_gemma":[0.9308943,0.05815254,0.0031994304,0.0038414442,0.0030670157,0.00084525713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065322644,0.0012152351,0.0033506209,0.0045147664,0.0012177943,0.0037520917,0.004237249,0.0021066654,0.0025744874],"category_scores_gemma":[0.053137213,0.0011280209,0.0022088396,0.009270431,0.002036426,0.0070690718,0.0042351414,0.0032814012,0.0009850492],"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.0014724827,0.0008496919,0.021590877,0.0011564123,0.00066476484,0.0017707007,0.00096544117,0.15715756,0.005693776,0.10469092,0.012575287,0.69141203],"study_design_scores_gemma":[0.00008740956,0.00019095227,0.00235677,0.00017532292,0.00014858406,0.0006465606,0.0002487852,0.8077768,0.0019720613,0.18147244,0.0048700487,0.000054240663],"about_ca_topic_score_codex":0.0057353047,"about_ca_topic_score_gemma":0.0052088075,"teacher_disagreement_score":0.0065322644,"about_ca_system_score_codex":0.001052353,"about_ca_system_score_gemma":0.0026947972,"threshold_uncertainty_score":0.034546316},"labels":[],"label_agreement":null},{"id":"W2223611515","doi":"10.1007/978-3-319-08783-2_43","title":"Displacing Random Sensors to Avoid Interference","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","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":"Carleton University","funders":"","keywords":"Interference (communication); Computer science; Telecommunications","score_opus":0.011445154485956274,"score_gpt":0.23231634482387584,"score_spread":0.22087119033791958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223611515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0281498,0.0014847597,0.94549024,0.00036273088,0.0005196396,0.00007905661,0.0000562439,0.0012274276,0.02263003],"genre_scores_gemma":[0.6477542,0.0019180014,0.309749,0.00082077837,0.00017379905,0.00012252816,0.00014869081,0.00037421173,0.038938724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.00006499874,0.000017499446,0.00013403573,0.00013777461,0.000039310646],"domain_scores_gemma":[0.99939287,0.00024328394,0.000061286315,0.00017380204,0.00009220693,0.00003662073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170386,0.0009400406,0.0005637127,0.00034430754,0.00036526847,0.0006719947,0.0015000429,0.00085150066,0.005494887],"category_scores_gemma":[0.0017081137,0.00035657795,0.000404608,0.00043511612,0.00062639295,0.0015817154,0.0012954972,0.0008654094,0.001823295],"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.0005662152,0.00019207889,0.00076051964,0.00059535564,0.00011329304,0.00060331257,0.00034643908,0.11656784,0.41708848,0.07414983,0.0064383326,0.3825783],"study_design_scores_gemma":[0.00015862456,0.001406256,0.0010521443,0.0001650742,0.00017137376,0.0028678596,0.00034381854,0.569649,0.26331258,0.09569442,0.06503728,0.00014153802],"about_ca_topic_score_codex":0.00025595006,"about_ca_topic_score_gemma":0.00044691947,"teacher_disagreement_score":0.005494887,"about_ca_system_score_codex":0.00025410892,"about_ca_system_score_gemma":0.00026132283,"threshold_uncertainty_score":0.018382251},"labels":[],"label_agreement":null},{"id":"W2223648683","doi":"10.1007/978-3-662-48221-6_19","title":"Sparse RNA Folding Revisited: Space-Efficient Minimum Free Energy Prediction","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"National Institute for Nanotechnology; University of Alberta","funders":"","keywords":"Computer science; Algorithm; Folding (DSP implementation); Energy minimization; Efficient energy use; Minification; Theoretical computer science; Mathematical optimization; Mathematics; Physics","score_opus":0.017964320095432612,"score_gpt":0.23176209771804923,"score_spread":0.21379777762261662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223648683","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.031993486,0.0022158662,0.9584296,0.0010698275,0.00016901101,0.000028225913,0.00018521046,0.0009381718,0.0049706404],"genre_scores_gemma":[0.5674842,0.0019403114,0.42325503,0.0004467671,0.0003555527,0.00012143086,0.00070195156,0.0005135715,0.005181116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970526,0.00012812251,0.000012820115,0.00004603678,0.00008210992,0.000025540572],"domain_scores_gemma":[0.9986141,0.00092880026,0.00006187774,0.00021331837,0.00012938549,0.000052429794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093785016,0.00062372943,0.0016087872,0.00061082834,0.0003711582,0.0008782315,0.0016960559,0.001319068,0.0026298787],"category_scores_gemma":[0.00411228,0.000532466,0.00067876856,0.0010552558,0.00070907886,0.0016329101,0.0011351478,0.0016509191,0.00070138654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014316347,0.00006619196,0.00038262104,0.0001631273,0.0000474284,0.000059472997,0.000052274434,0.83586603,0.0030901935,0.043389034,0.005237339,0.111503065],"study_design_scores_gemma":[0.000004209545,0.00000682801,0.000025152802,0.0000037742107,0.000002606127,0.00000800806,0.0000028042627,0.9787193,0.0002638651,0.02071909,0.00024219231,0.0000021434962],"about_ca_topic_score_codex":0.0018343437,"about_ca_topic_score_gemma":0.0019607786,"teacher_disagreement_score":0.0026298787,"about_ca_system_score_codex":0.00046304121,"about_ca_system_score_gemma":0.0006116425,"threshold_uncertainty_score":0.008797824},"labels":[],"label_agreement":null},{"id":"W2223854644","doi":"10.1007/978-3-642-22006-7_21","title":"Range Majority in Constant Time and Linear Space","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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; University of Manitoba","funders":"","keywords":"Range (aeronautics); Linear space; Range query (database); Constant (computer programming); Logarithm; Upper and lower bounds; Space (punctuation); Mathematics; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Search engine; Sargable; Information retrieval; Web search query","score_opus":0.016534144034564536,"score_gpt":0.23071446030165912,"score_spread":0.21418031626709458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223854644","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.05766735,0.005410745,0.7284465,0.00754289,0.0012261313,0.00039703853,0.0021493174,0.0107945055,0.18636557],"genre_scores_gemma":[0.5380276,0.002850551,0.2975498,0.0022972766,0.0014358425,0.0007010455,0.002389462,0.003540406,0.15120795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601233,0.00062201155,0.00021205645,0.0009141835,0.0014388298,0.0008006232],"domain_scores_gemma":[0.99280566,0.0040444145,0.00024361008,0.002035677,0.0006061428,0.0002644844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015913532,0.0016013767,0.0022639697,0.0013174157,0.0025117574,0.005606508,0.0028573724,0.0015936269,0.02907897],"category_scores_gemma":[0.008671287,0.00090879045,0.0015958118,0.0028132643,0.0025724838,0.015879633,0.005454071,0.0046376223,0.009468171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012749099,0.00020472276,0.0005958226,0.00079675077,0.00009540792,0.00017002269,0.000610097,0.019113181,0.009541866,0.55503297,0.068173595,0.34439072],"study_design_scores_gemma":[0.0001826428,0.000096402255,0.00022601026,0.00009925857,0.00010318669,0.00029105577,0.00023281749,0.053139005,0.0104780225,0.90078336,0.0343147,0.000053548687],"about_ca_topic_score_codex":0.0015878372,"about_ca_topic_score_gemma":0.002946017,"teacher_disagreement_score":0.02907897,"about_ca_system_score_codex":0.0025715884,"about_ca_system_score_gemma":0.0025650226,"threshold_uncertainty_score":0.09727883},"labels":[],"label_agreement":null},{"id":"W2224038009","doi":"10.1007/978-3-319-25010-6_16","title":"Automatic Curation of Clinical Trials Data in LinkedCT","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XML; Raw data; Data quality; Quality (philosophy); Clinical trial; Source document; Data curation; Linked data; Data science; World Wide Web; Information retrieval; Database; Bioinformatics; Semantic Web","score_opus":0.2551144569738897,"score_gpt":0.4541076386840874,"score_spread":0.1989931817101977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224038009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016466321,0.014083708,0.5962127,0.004051704,0.0013865179,0.0026961663,0.2996827,0.0488088,0.016611421],"genre_scores_gemma":[0.046239346,0.006218303,0.6606217,0.0015379108,0.00042703812,0.0015509129,0.27347222,0.003962295,0.0059702396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99285805,0.0024835274,0.0014876409,0.0011003983,0.0018458985,0.00022449846],"domain_scores_gemma":[0.96254027,0.023355803,0.0030055866,0.007090939,0.0033112224,0.00069613016],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010454593,0.0014245354,0.0023265965,0.01941641,0.0014865204,0.0068905875,0.0020641545,0.0014852753,0.011625496],"category_scores_gemma":[0.04501898,0.0011306631,0.0039003822,0.013349601,0.00088165654,0.003729923,0.0061900117,0.0025034607,0.00685567],"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.00051870657,0.00032711076,0.011143444,0.014356266,0.0014877466,0.0015051119,0.002282309,0.013101043,0.015652806,0.054359,0.25129458,0.6339718],"study_design_scores_gemma":[0.00025229398,0.00018558037,0.012947273,0.0054573123,0.001779465,0.001979024,0.00054825266,0.053722132,0.032083232,0.1262112,0.7645824,0.00025184255],"about_ca_topic_score_codex":0.007611115,"about_ca_topic_score_gemma":0.021275945,"teacher_disagreement_score":0.9895454,"about_ca_system_score_codex":0.0022706804,"about_ca_system_score_gemma":0.009917775,"threshold_uncertainty_score":0.055289865},"labels":[],"label_agreement":null},{"id":"W2224492045","doi":"10.1007/978-3-540-89876-4","title":"Transactions on Rough Sets IX","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Manitoba","funders":"","keywords":"Computer science","score_opus":0.020334305176725884,"score_gpt":0.24447199627430474,"score_spread":0.22413769109757886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224492045","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082833115,0.13267055,0.60204196,0.009234042,0.020044792,0.00014213067,0.0012741623,0.0008693114,0.22543965],"genre_scores_gemma":[0.2532398,0.12873007,0.33113557,0.0015019816,0.012734742,0.0004713533,0.0022083176,0.0005673793,0.2694107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983084,0.0003642922,0.00018131931,0.00016066022,0.0009339008,0.00005145922],"domain_scores_gemma":[0.9985934,0.00055821805,0.00008301841,0.00041941306,0.0003046759,0.00004141531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016759592,0.0010547392,0.0030067677,0.001703226,0.0006998499,0.0035173849,0.00071975484,0.0008527848,0.018093642],"category_scores_gemma":[0.004773609,0.0005784164,0.0013227434,0.002967749,0.0013528797,0.002531535,0.0012742674,0.0022599546,0.0064152023],"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.000055307493,0.000029287881,0.00024321655,0.0005862779,0.0001515624,0.00011706408,0.0002263452,0.007271954,0.0008564391,0.595424,0.07081865,0.32421988],"study_design_scores_gemma":[0.000022820257,0.000050323368,0.0007433806,0.00024133828,0.000115102725,0.00026891398,0.00011774143,0.017221807,0.00055725744,0.70247793,0.27815565,0.000027764689],"about_ca_topic_score_codex":0.00087558245,"about_ca_topic_score_gemma":0.0006522254,"teacher_disagreement_score":0.018093642,"about_ca_system_score_codex":0.0010665938,"about_ca_system_score_gemma":0.00080444035,"threshold_uncertainty_score":0.06052929},"labels":[],"label_agreement":null},{"id":"W2224705717","doi":"10.1007/978-3-319-24132-6_15","title":"Global Stiffness and Well-Conditioned Workspace Optimization Analysis of 3UPU-UPU Robot Based on Pareto Front Theory","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Mechanisms and Dynamics","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":"Ontario Tech University","funders":"","keywords":"Workspace; Computer science; Front (military); Robot; Stiffness; Pareto principle; Mathematical optimization; Artificial intelligence; Mechanical engineering; Mathematics; Structural engineering; Engineering","score_opus":0.009457809491549896,"score_gpt":0.21806500957852767,"score_spread":0.20860720008697778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224705717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020827444,0.00044209504,0.9630683,0.00010810442,0.000030114368,0.000025369509,0.0000322354,0.00007852541,0.015387878],"genre_scores_gemma":[0.8720041,0.0008351012,0.10567197,0.000099232355,0.000049767565,0.00021193425,0.00014821718,0.00016820824,0.0208114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977106,0.000048582722,0.000007658461,0.000027003018,0.00011704255,0.00002873319],"domain_scores_gemma":[0.999658,0.00015062689,0.000041153384,0.000026448713,0.0001040145,0.00001982796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000649449,0.000699077,0.0007209294,0.0007547889,0.0005714145,0.0009679574,0.00072574575,0.00084298727,0.004174851],"category_scores_gemma":[0.0009294638,0.00042437174,0.0009296794,0.00046920698,0.00083615567,0.00084345206,0.001079216,0.0006904566,0.00055456767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004083436,0.000026363437,0.00025688918,0.00012496278,0.000021856265,0.00006477719,0.00008255418,0.9331529,0.005368968,0.039881438,0.0007310523,0.020247372],"study_design_scores_gemma":[0.0000019305176,0.000017395518,0.00015862552,0.000009715648,0.0000035256169,0.000019661687,0.0000151620225,0.99185574,0.00042352942,0.0071910275,0.00029708867,0.000006554011],"about_ca_topic_score_codex":0.0014630536,"about_ca_topic_score_gemma":0.0014837282,"teacher_disagreement_score":0.004174851,"about_ca_system_score_codex":0.00051451207,"about_ca_system_score_gemma":0.0006052277,"threshold_uncertainty_score":0.013966322},"labels":[],"label_agreement":null},{"id":"W2224945135","doi":"10.1007/978-3-642-38610-7_25","title":"White Blood Cell Differential Counts Using Convolutional Neural Networks for Low Resolution Images","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Convolutional neural network; Computer science; Support vector machine; Histogram; Feature extraction; White blood cell; Kernel (algebra); Blood smear; Feature (linguistics); Computer vision; Pathology; Image (mathematics); Medicine; Mathematics; Immunology","score_opus":0.01320722420003427,"score_gpt":0.22573643395195225,"score_spread":0.21252920975191797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224945135","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.079059966,0.001638517,0.90970635,0.00034694865,0.00012723955,0.000048909566,0.0009539196,0.0027985284,0.0053197145],"genre_scores_gemma":[0.4903284,0.0019479619,0.4879945,0.00021188417,0.00011380736,0.000080834376,0.0017131147,0.00031496456,0.017294602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998859,0.000011683868,0.0000059587555,0.000031599742,0.00004677837,0.00001812652],"domain_scores_gemma":[0.9997459,0.00008782647,0.00003284074,0.000028416984,0.00009363829,0.000011323802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031303125,0.0004991709,0.0003452139,0.0006883066,0.00015355142,0.0006997749,0.0005664023,0.00037799863,0.0024487518],"category_scores_gemma":[0.0009235739,0.0002634869,0.00035579933,0.00062958786,0.00013697782,0.0004742176,0.00046580235,0.000506486,0.0011335555],"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.0002003958,0.000066346474,0.007210542,0.00017009577,0.00008885551,0.0002112125,0.000052952495,0.04414021,0.0771315,0.0042878236,0.0075743394,0.85886574],"study_design_scores_gemma":[0.000008214741,0.000045616933,0.008670383,0.00003299855,0.00006031958,0.00043067266,0.000023596744,0.91946584,0.06008789,0.0056187185,0.005528088,0.000027620004],"about_ca_topic_score_codex":0.0042546517,"about_ca_topic_score_gemma":0.009168158,"teacher_disagreement_score":0.0042546517,"about_ca_system_score_codex":0.0005538017,"about_ca_system_score_gemma":0.00034672266,"threshold_uncertainty_score":0.008459747},"labels":[],"label_agreement":null},{"id":"W2225441821","doi":"10.1007/978-3-540-87993-0","title":"Scalable Uncertainty Management","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Database","score_opus":0.05691525305791073,"score_gpt":0.3553772469724204,"score_spread":0.29846199391450967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225441821","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071513574,0.0026973772,0.91547865,0.0015053954,0.00052697124,0.0000949843,0.0005111425,0.0017331648,0.07030084],"genre_scores_gemma":[0.55398077,0.005112709,0.34104225,0.0006566332,0.0013900044,0.00041400467,0.0023907304,0.00082223857,0.09419072],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993586,0.000117489246,0.000028521043,0.00011085566,0.0003244654,0.000060030245],"domain_scores_gemma":[0.9990828,0.00039150837,0.00006112572,0.00024251662,0.0001683252,0.000053720658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009368571,0.0009657876,0.0009823986,0.0006313517,0.00055276125,0.0015196538,0.0011196103,0.0006644787,0.01697372],"category_scores_gemma":[0.0031668504,0.00037586223,0.00062877144,0.0012048779,0.0006065663,0.0022026675,0.0020749636,0.0017370459,0.0024597638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014751768,0.00008951086,0.00032515323,0.00020080549,0.00010241049,0.00013056572,0.00006034549,0.19765003,0.004935963,0.23328587,0.048582736,0.51448905],"study_design_scores_gemma":[0.00002249889,0.000047742935,0.0002774833,0.000036635185,0.000030527397,0.00007973553,0.000031072846,0.52205247,0.003209607,0.4456547,0.028537085,0.000020415358],"about_ca_topic_score_codex":0.0010993289,"about_ca_topic_score_gemma":0.0012156091,"teacher_disagreement_score":0.01697372,"about_ca_system_score_codex":0.0008067998,"about_ca_system_score_gemma":0.000882328,"threshold_uncertainty_score":0.056782782},"labels":[],"label_agreement":null},{"id":"W2227271892","doi":"10.1007/978-3-319-24486-0_13","title":"Multi-task and Lifelong Learning of Kernels","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization error; Multi-task learning; Lifelong learning; Computer science; Kernel (algebra); Artificial intelligence; Task (project management); Classifier (UML); Machine learning; Generalization; Instance-based learning; Margin (machine learning); Support vector machine; Multiple kernel learning; Semi-supervised learning; Kernel method; Mathematics; Stability (learning theory); Discrete mathematics; Psychology; Engineering","score_opus":0.03340130369327997,"score_gpt":0.28944819858851745,"score_spread":0.25604689489523746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227271892","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.1117974,0.0015786603,0.88356596,0.00070467696,0.00015387793,0.0000507743,0.00021473854,0.0007647558,0.0011690686],"genre_scores_gemma":[0.90968055,0.0005001858,0.08090904,0.0002444243,0.00017011768,0.00009971276,0.00079073076,0.00018433268,0.0074208817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872607,0.00046265562,0.00005627276,0.0004350913,0.00013684071,0.00018309338],"domain_scores_gemma":[0.992591,0.0044521377,0.00038291205,0.0014129629,0.0007013621,0.0004596544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003739898,0.00084615964,0.0015258437,0.0006850446,0.0006209432,0.0013362246,0.0020213057,0.0023045233,0.0024435238],"category_scores_gemma":[0.015225446,0.0005903159,0.0008306599,0.00084146886,0.0009643027,0.003968278,0.0029834318,0.0031409962,0.0008433801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010449567,0.0009433836,0.007880007,0.0004955612,0.000384832,0.00038396378,0.00042421828,0.40523675,0.019939484,0.038634103,0.013278623,0.511354],"study_design_scores_gemma":[0.000011874418,0.000066295834,0.0010401277,0.000011831462,0.0000183272,0.00006338802,0.000027818382,0.9745138,0.0014712611,0.022245696,0.00051256455,0.000017006463],"about_ca_topic_score_codex":0.003382163,"about_ca_topic_score_gemma":0.0041095586,"teacher_disagreement_score":0.003739898,"about_ca_system_score_codex":0.00082946196,"about_ca_system_score_gemma":0.0009645545,"threshold_uncertainty_score":0.019778669},"labels":[],"label_agreement":null},{"id":"W2227501451","doi":"10.1007/978-3-642-17697-5","title":"Transactions on Computational Science XI","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Field (mathematics); Data science; Computational science; Mathematics","score_opus":0.06037924383558113,"score_gpt":0.3510801731390011,"score_spread":0.29070092930341995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227501451","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005991297,0.06343607,0.2347878,0.022332937,0.046172943,0.00024426487,0.0031644022,0.0029913504,0.62087893],"genre_scores_gemma":[0.045637354,0.037891965,0.062686,0.0020571018,0.0068976963,0.00034189134,0.0038092441,0.0012094438,0.8394693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990171,0.00017764044,0.00005957943,0.00016247517,0.0005219296,0.00006116677],"domain_scores_gemma":[0.99851006,0.0004013618,0.00004509676,0.0005956442,0.00034448376,0.00010337765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012553649,0.0011625777,0.0016516981,0.0012990723,0.0006483547,0.0030942997,0.0011134774,0.000998812,0.14763018],"category_scores_gemma":[0.003751252,0.00041198474,0.00067474204,0.0028573992,0.001149518,0.0021505388,0.0020450086,0.0025783204,0.06834013],"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.000074189906,0.000049756993,0.0003843579,0.0004785501,0.000058486392,0.00005421083,0.000060496044,0.0027355077,0.0010940585,0.09792639,0.4757011,0.42138287],"study_design_scores_gemma":[0.000033855715,0.000038100014,0.00077141315,0.00022627103,0.000046460736,0.00018970745,0.00006341926,0.012505638,0.000868728,0.11339421,0.87184876,0.00001352394],"about_ca_topic_score_codex":0.0014029986,"about_ca_topic_score_gemma":0.0017102462,"teacher_disagreement_score":0.14763018,"about_ca_system_score_codex":0.0011115103,"about_ca_system_score_gemma":0.0015425297,"threshold_uncertainty_score":0.49387217},"labels":[],"label_agreement":null},{"id":"W2227857838","doi":"10.1007/978-3-642-32873-2_1","title":"Tradeoff Analysis of Relational Database Storage of Privacy Preferences","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Western University","funders":"","keywords":"Computer science; Relational database; Database; Internet privacy","score_opus":0.054873442443395724,"score_gpt":0.27830012501934037,"score_spread":0.22342668257594464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227857838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46720695,0.010071491,0.49421483,0.00385387,0.00022968341,0.00032393239,0.0012888993,0.00095067214,0.02185961],"genre_scores_gemma":[0.9541535,0.0010146478,0.040154483,0.00012346436,0.00014149996,0.000081777674,0.00036402734,0.00014229104,0.00382425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895857,0.005054048,0.00045576034,0.00081912713,0.0031289912,0.00095650984],"domain_scores_gemma":[0.94313514,0.044271022,0.0014138939,0.0076898956,0.0027477252,0.0007422938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011174432,0.00071004353,0.0015803763,0.0013284365,0.00087549066,0.0061337124,0.0034133077,0.0015784588,0.009371446],"category_scores_gemma":[0.049899574,0.00092046487,0.0009463149,0.0033533592,0.0013362705,0.013134344,0.0023319954,0.0015931998,0.00070745114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007799853,0.00061852176,0.004028164,0.0005922929,0.00029585074,0.00038319465,0.0007075944,0.42055395,0.012550864,0.3467743,0.010443134,0.19525228],"study_design_scores_gemma":[0.00011429463,0.00035688013,0.000839794,0.00004841607,0.00011194701,0.0003020777,0.00027107864,0.8887645,0.0039233332,0.10333677,0.0018831793,0.000047762325],"about_ca_topic_score_codex":0.0015515463,"about_ca_topic_score_gemma":0.0015286308,"teacher_disagreement_score":0.011174432,"about_ca_system_score_codex":0.003899143,"about_ca_system_score_gemma":0.0018067979,"threshold_uncertainty_score":0.059096694},"labels":[],"label_agreement":null},{"id":"W2227982193","doi":"10.1007/978-3-642-15393-8_2","title":"Variable Selection by C p Statistic in Multiple Responses Regression with Fewer Sample Size Than the Dimension","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Toronto","funders":"","keywords":"Statistic; Statistics; Sample size determination; Dimension (graph theory); Mathematics; Regression; Sample (material); Variable (mathematics); Regression analysis; Linear regression; Selection (genetic algorithm); Feature selection; Econometrics; Computer science; Artificial intelligence; Combinatorics; Chromatography; Chemistry","score_opus":0.010732449231442148,"score_gpt":0.24326403236375072,"score_spread":0.23253158313230857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227982193","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.0040905955,0.00040390654,0.99357706,0.00036849396,0.00025089487,0.000107061736,0.00016025496,0.000645495,0.0003962065],"genre_scores_gemma":[0.05597174,0.0005081151,0.9367276,0.00037802858,0.00071586453,0.0011547911,0.0005198139,0.00072127103,0.0033028573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9478524,0.042571366,0.0014203173,0.004587865,0.0029686473,0.00059949135],"domain_scores_gemma":[0.80179685,0.18108493,0.0018019793,0.011346016,0.003365701,0.00060448586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.049180552,0.0028150412,0.004865364,0.0022730194,0.0018138369,0.001958145,0.0053744903,0.003971255,0.008623208],"category_scores_gemma":[0.13974905,0.002067727,0.004045769,0.004982078,0.0040291413,0.0037826425,0.0023548063,0.007620247,0.00232365],"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.0021362556,0.00062398874,0.012348346,0.0016012982,0.001641246,0.001239011,0.00049810763,0.077094294,0.007261829,0.11175438,0.039529443,0.7442718],"study_design_scores_gemma":[0.00050728273,0.0008563725,0.0063821776,0.00018043844,0.00052188494,0.0005430635,0.00014407802,0.8379149,0.0067517185,0.13410376,0.011928289,0.00016612023],"about_ca_topic_score_codex":0.002879887,"about_ca_topic_score_gemma":0.0031178617,"teacher_disagreement_score":0.049180552,"about_ca_system_score_codex":0.0010007328,"about_ca_system_score_gemma":0.0035968104,"threshold_uncertainty_score":0.2600947},"labels":[],"label_agreement":null},{"id":"W2228262070","doi":"10.1007/978-3-319-13835-0_15","title":"Envisioning a Requirements Specification Template for Medical Device Software","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Dependability; Computer science; Medical software; Software engineering; Software requirements specification; Functional requirement; Set (abstract data type); Process (computing); Software; Requirements analysis; Risk analysis (engineering); Software design; Software development; Software quality; Medicine; Programming language","score_opus":0.021719584015870742,"score_gpt":0.24778885660081001,"score_spread":0.22606927258493928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228262070","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.002986742,0.000071077244,0.9854333,0.0005010244,0.00005547752,0.0005208086,0.00050745753,0.002000714,0.007923364],"genre_scores_gemma":[0.044302154,0.00027152052,0.9429088,0.00027620065,0.000029035971,0.0007284361,0.0023665996,0.0010823556,0.008034796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566215,0.0012709833,0.0006032269,0.00047283882,0.0016764519,0.00031446593],"domain_scores_gemma":[0.99449795,0.0027175846,0.00036110272,0.0010248094,0.0011830666,0.00021555048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00673274,0.0013789029,0.0006409086,0.0018116366,0.000784331,0.0047910092,0.0028444782,0.0028099222,0.0070764325],"category_scores_gemma":[0.012240514,0.001713992,0.0021835994,0.00089102617,0.0013065148,0.0037692257,0.0029505093,0.0030463908,0.004273154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001897428,0.00027009635,0.0012604872,0.0008518723,0.000076933786,0.002708497,0.004479959,0.0984609,0.03167808,0.63666236,0.025851436,0.19750957],"study_design_scores_gemma":[0.00010760581,0.00021264034,0.00052290945,0.001006418,0.00008058534,0.0018158881,0.0010278719,0.42355207,0.036853265,0.22370256,0.3109737,0.00014454035],"about_ca_topic_score_codex":0.004393607,"about_ca_topic_score_gemma":0.0043264357,"teacher_disagreement_score":0.0070764325,"about_ca_system_score_codex":0.0015680842,"about_ca_system_score_gemma":0.003941972,"threshold_uncertainty_score":0.035606623},"labels":[],"label_agreement":null},{"id":"W2228330368","doi":"10.1007/978-3-642-21557-5_18","title":"Dynamic Ensemble Selection for Off-Line Signature Verification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Discriminative model; Computer science; Signature (topology); Selection (genetic algorithm); Artificial intelligence; Pattern recognition (psychology); Line (geometry); Machine learning; k-nearest neighbors algorithm; Data mining; Mathematics","score_opus":0.019692748215553873,"score_gpt":0.2584632837468577,"score_spread":0.2387705355313038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228330368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037875205,0.00043636936,0.9572299,0.00006773755,0.00011894343,0.00006761402,0.00012749407,0.002022134,0.0020546056],"genre_scores_gemma":[0.53874403,0.0004648222,0.44505385,0.00019386367,0.00019830682,0.00017667934,0.0014064119,0.0004897408,0.013272338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985973,0.00034046153,0.00007296214,0.00027686614,0.00051921484,0.00019308916],"domain_scores_gemma":[0.99874496,0.00043882747,0.00007825188,0.0003162079,0.0003654382,0.00005640944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011491621,0.0010800281,0.0015965179,0.0010365256,0.0007036361,0.00081526506,0.0011454157,0.00080267113,0.0040261536],"category_scores_gemma":[0.0018681528,0.00034362727,0.0006484904,0.0008699114,0.0002810747,0.001309251,0.001578779,0.000992294,0.0024932944],"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.0004344334,0.00018741874,0.0010840144,0.00004660512,0.000082768966,0.000093463976,0.000042330896,0.02844115,0.067680344,0.0015077353,0.003972452,0.8964273],"study_design_scores_gemma":[0.000015567308,0.00017445776,0.0015873051,0.000010061703,0.000045198605,0.00029942038,0.000032678574,0.9423291,0.04995815,0.0023578072,0.0031653626,0.000024921508],"about_ca_topic_score_codex":0.000813921,"about_ca_topic_score_gemma":0.001776499,"teacher_disagreement_score":0.0040261536,"about_ca_system_score_codex":0.000242923,"about_ca_system_score_gemma":0.0005692331,"threshold_uncertainty_score":0.013468802},"labels":[],"label_agreement":null},{"id":"W2229046451","doi":"10.1007/978-3-319-06605-9_13","title":"Topic Modeling Using Collapsed Typed Dependency Relations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"York University","funders":"","keywords":"Perplexity; Computer science; Bigram; Natural language processing; Dependency (UML); Topic model; Artificial intelligence; Thematic structure; Coherence (philosophical gambling strategy); Information retrieval; Language model; Programming language","score_opus":0.036461201158759435,"score_gpt":0.2591578996023134,"score_spread":0.22269669844355394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229046451","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.004410884,0.000619801,0.9899573,0.00020790928,0.00007487725,0.00006209597,0.0007083421,0.001631733,0.0023270287],"genre_scores_gemma":[0.2634887,0.0021188352,0.70930254,0.00018400466,0.00037589198,0.00050704635,0.006322336,0.0019918364,0.0157088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975298,0.0010947756,0.00020928218,0.0005436535,0.00045964847,0.00016285396],"domain_scores_gemma":[0.993171,0.0048727444,0.00022232364,0.00081564084,0.00073280965,0.00018545586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002687901,0.0010377903,0.00096349913,0.0033293955,0.0012967113,0.0030919325,0.0019376646,0.0010114103,0.008744306],"category_scores_gemma":[0.011973874,0.001331904,0.0029707304,0.0047230404,0.0005377813,0.006909097,0.0021291655,0.0026441629,0.0040189587],"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.00052805257,0.00028227363,0.005431399,0.00085962785,0.0005525859,0.0004042843,0.0022142509,0.10116892,0.008480315,0.2293148,0.038226575,0.6125369],"study_design_scores_gemma":[0.000031956537,0.00003258931,0.0008870652,0.000096433505,0.00019125783,0.00019629052,0.0001857208,0.7932708,0.0042591942,0.17479973,0.025991002,0.00005786747],"about_ca_topic_score_codex":0.008221046,"about_ca_topic_score_gemma":0.012102267,"teacher_disagreement_score":0.008744306,"about_ca_system_score_codex":0.0012773606,"about_ca_system_score_gemma":0.0015644052,"threshold_uncertainty_score":0.029252589},"labels":[],"label_agreement":null},{"id":"W2230463746","doi":"10.1007/978-3-642-03281-3","title":"Transactions on Rough Sets X","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.017209343336700104,"score_gpt":0.24858634440713398,"score_spread":0.23137700107043388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230463746","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010601688,0.11552179,0.516455,0.009017198,0.02229339,0.00020237756,0.0014361144,0.0010641785,0.32340822],"genre_scores_gemma":[0.22668132,0.118963614,0.25525588,0.0017293374,0.011014858,0.0005586436,0.0022346128,0.00041979106,0.383142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987379,0.00030121065,0.00015338541,0.00015638409,0.00060796546,0.000043245942],"domain_scores_gemma":[0.9990219,0.0003419661,0.00007935205,0.00034879526,0.0001700648,0.00003801341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267949,0.00093935884,0.0021446233,0.0014851311,0.00064696715,0.0036683115,0.0005605237,0.0008431479,0.028378638],"category_scores_gemma":[0.003377972,0.00044192263,0.0009864522,0.00259586,0.0013948034,0.0024186184,0.001392819,0.0016693566,0.009300122],"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.000063756364,0.00002688192,0.0002841976,0.00056216173,0.00013087073,0.00014713152,0.00025062176,0.004832684,0.0010084428,0.64422584,0.061949488,0.28651792],"study_design_scores_gemma":[0.00003141287,0.00007950159,0.0008097207,0.0002572864,0.00010390711,0.0003349302,0.00013580595,0.011077988,0.0006322994,0.56389385,0.42261717,0.000026097478],"about_ca_topic_score_codex":0.00063933333,"about_ca_topic_score_gemma":0.0004362279,"teacher_disagreement_score":0.028378638,"about_ca_system_score_codex":0.0006658914,"about_ca_system_score_gemma":0.00079014077,"threshold_uncertainty_score":0.09493601},"labels":[],"label_agreement":null},{"id":"W2230840043","doi":"10.1007/978-3-642-33167-1_39","title":"PE(AR)2: Privacy-Enhanced Anonymous Authentication with Reputation and Revocation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":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":"Blacklist; Computer science; Revocation; Computer security; Authentication (law); Blacklisting; Reputation; Anonymity; Benchmark (surveying); Vulnerability (computing); Scheme (mathematics); Internet privacy; Overhead (engineering); Operating system","score_opus":0.011987984929695994,"score_gpt":0.23541832147792385,"score_spread":0.22343033654822786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230840043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008895472,0.00045161406,0.9546918,0.00047309525,0.00067806646,0.00036921547,0.00033891315,0.006084427,0.028017381],"genre_scores_gemma":[0.53646725,0.0007803218,0.35835493,0.000552512,0.0004784052,0.00043987136,0.0011968894,0.001197616,0.10053211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730825,0.00072701817,0.00017776937,0.00052099105,0.0008142497,0.00045170306],"domain_scores_gemma":[0.9974483,0.00051177014,0.00012904147,0.0014834937,0.0003224525,0.00010497782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229411,0.0010844613,0.0011634141,0.0007497215,0.0010651321,0.002723309,0.0025577669,0.002001016,0.011596056],"category_scores_gemma":[0.0056077917,0.00052149163,0.0010172762,0.00092794665,0.0013034721,0.00548437,0.005341561,0.002493711,0.008993436],"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.0011809997,0.00035367114,0.0005284596,0.00057098654,0.000119013515,0.0005327004,0.00046913262,0.03113328,0.026134258,0.4824627,0.053234026,0.40328076],"study_design_scores_gemma":[0.00021712051,0.00055355387,0.0005914428,0.00011143541,0.00014614547,0.0023922366,0.00017995083,0.3867113,0.05201043,0.43610495,0.1207586,0.00022285031],"about_ca_topic_score_codex":0.00051803555,"about_ca_topic_score_gemma":0.00055505923,"teacher_disagreement_score":0.011596056,"about_ca_system_score_codex":0.0007098578,"about_ca_system_score_gemma":0.00137099,"threshold_uncertainty_score":0.03879267},"labels":[],"label_agreement":null},{"id":"W2231319185","doi":"10.1007/978-3-642-39437-9_10","title":"Putting It All Together: The Design of a Pipeline for Genome-Wide Functional Annotation of Fungi in the Modern Era of “-Omics” Data and Systems Biology","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Microbial Metabolic Engineering and Bioproduction","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":"Concordia University","funders":"","keywords":"Pipeline (software); Annotation; Computer science; Systems biology; Genome; Computational biology; Data science; Artificial intelligence; Biology; Programming language; Gene; Genetics","score_opus":0.033296482736077486,"score_gpt":0.24719111228220544,"score_spread":0.21389462954612795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231319185","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.011338013,0.0010831098,0.9034722,0.0014266445,0.0003430346,0.00036522758,0.0079667885,0.071251996,0.0027531555],"genre_scores_gemma":[0.025805665,0.0006330091,0.9474989,0.00088009663,0.00009793047,0.00033136352,0.017945737,0.0031480598,0.0036591936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905604,0.00012791932,0.00008419315,0.0003691223,0.00026439156,0.00009834084],"domain_scores_gemma":[0.99888295,0.00045791277,0.00008519698,0.00019795109,0.00025032644,0.00012580087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030102662,0.0017817944,0.0011259334,0.0019192338,0.0012189896,0.003882735,0.0025746222,0.0013696691,0.0050526937],"category_scores_gemma":[0.003482087,0.0011641257,0.0017250404,0.0025518418,0.00092650315,0.0030210542,0.0026029896,0.0020666185,0.006990874],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010791124,0.00035327114,0.0048633656,0.0011218468,0.0004070619,0.00073984335,0.0012394806,0.0074814577,0.16685809,0.010825896,0.13789585,0.66713476],"study_design_scores_gemma":[0.00031786057,0.0005041042,0.011505724,0.0003249661,0.0005375299,0.0014235242,0.0011148165,0.31716192,0.2861055,0.10768451,0.27284762,0.00047188683],"about_ca_topic_score_codex":0.0041905213,"about_ca_topic_score_gemma":0.0068825423,"teacher_disagreement_score":0.0050526937,"about_ca_system_score_codex":0.00074114243,"about_ca_system_score_gemma":0.0020933354,"threshold_uncertainty_score":0.016902924},"labels":[],"label_agreement":null},{"id":"W2231480743","doi":"10.1007/978-3-642-33122-0_4","title":"SibJoin: A Fast Heuristic for Half-Sibling Reconstruction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic and phenotypic traits in livestock","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Kinship; Heuristic; Partition (number theory); Inference; Cluster analysis; Sibling; Theoretical computer science; Data science; Artificial intelligence; Data mining; Mathematics; Psychology; Sociology","score_opus":0.015672631129516064,"score_gpt":0.23859025291861027,"score_spread":0.22291762178909422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231480743","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.01472519,0.0006154049,0.9602182,0.00035670574,0.00033189706,0.00035929226,0.0010855588,0.017571667,0.0047360547],"genre_scores_gemma":[0.04855619,0.00012203741,0.9414022,0.00021722846,0.000061439394,0.00033201725,0.0027165927,0.0028595116,0.0037327975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804664,0.00054623774,0.00017235948,0.00042350017,0.00053892785,0.00027225146],"domain_scores_gemma":[0.9954022,0.002561932,0.00014249558,0.0010249526,0.00060990534,0.0002583918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026211916,0.0024264408,0.0025966072,0.0032218564,0.0019607404,0.0026099999,0.005372711,0.003531643,0.037663262],"category_scores_gemma":[0.011498699,0.0017824034,0.0022681712,0.0037155095,0.0011005376,0.004526358,0.004435241,0.0030049172,0.010458525],"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.0014856439,0.00041314354,0.0018486087,0.00045001012,0.0002925451,0.00035548097,0.00042252912,0.0650157,0.005765328,0.016788606,0.059340004,0.84782237],"study_design_scores_gemma":[0.0007252895,0.00021673318,0.00065269426,0.00012171181,0.0001645238,0.00042275235,0.00039785344,0.88345814,0.007978307,0.085370794,0.020393075,0.00009816943],"about_ca_topic_score_codex":0.005928225,"about_ca_topic_score_gemma":0.011367918,"teacher_disagreement_score":0.037663262,"about_ca_system_score_codex":0.0012516666,"about_ca_system_score_gemma":0.0030192265,"threshold_uncertainty_score":0.12599611},"labels":[],"label_agreement":null},{"id":"W2232381307","doi":"10.1007/978-3-642-38067-9_12","title":"Single Classifier Based Multiple Classifications","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Classifier (UML); Computer science; Classification scheme; Artificial intelligence; Pattern recognition (psychology); Voting; Quadratic classifier; Machine learning; Data mining","score_opus":0.03900620790117855,"score_gpt":0.24153856043686922,"score_spread":0.20253235253569069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232381307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015335454,0.0021199933,0.9654934,0.0002749018,0.0013830777,0.0002031411,0.0005126322,0.005061467,0.009615925],"genre_scores_gemma":[0.21948822,0.0013824804,0.72179794,0.0004867238,0.0008370162,0.0003311959,0.0036711858,0.00082492485,0.051180266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996298,0.0004202234,0.00020663526,0.0013215723,0.0013663262,0.0003871918],"domain_scores_gemma":[0.99635315,0.000585569,0.00012930657,0.0012262628,0.0015825223,0.0001231535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021410424,0.0018426647,0.003724505,0.0024783504,0.0014800415,0.0036604116,0.00413239,0.0030132614,0.016955383],"category_scores_gemma":[0.003727565,0.0011184083,0.002551967,0.002434096,0.00066386786,0.004270523,0.002970856,0.0026233415,0.01759696],"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.00037777584,0.00019156128,0.00123467,0.00015983394,0.00025050435,0.000118994496,0.00006433643,0.0129714785,0.016281435,0.0037692906,0.013100548,0.9514796],"study_design_scores_gemma":[0.000029589915,0.000282323,0.0026158064,0.00008154727,0.0002819506,0.0007718594,0.00013189262,0.9305934,0.033991884,0.011923231,0.019193271,0.00010331403],"about_ca_topic_score_codex":0.003465292,"about_ca_topic_score_gemma":0.005617287,"teacher_disagreement_score":0.016955383,"about_ca_system_score_codex":0.0008329557,"about_ca_system_score_gemma":0.0013294511,"threshold_uncertainty_score":0.05672139},"labels":[],"label_agreement":null},{"id":"W2232698968","doi":"10.1007/978-3-319-07464-1_18","title":"Serious Games: Customizing the Audio-Visual Interface","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"Ontario Tech University","funders":"","keywords":"Computer science; Rendering (computer graphics); Human–computer interaction; Fidelity; Perception; High fidelity; Personalization; Multimedia; Modalities; Visualization; Metaverse; Virtual reality; Artificial intelligence; World Wide Web","score_opus":0.02560424738016179,"score_gpt":0.29055179658367325,"score_spread":0.26494754920351143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232698968","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.024382077,0.0021490585,0.9060491,0.0002563206,0.0005563317,0.00026777762,0.00041616586,0.016419787,0.04950348],"genre_scores_gemma":[0.30386242,0.0036155023,0.5707111,0.00062152446,0.00014879505,0.00060564093,0.0013351473,0.006989827,0.112110004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997538,0.00003440805,0.0000163617,0.000054479067,0.00010928141,0.00003170483],"domain_scores_gemma":[0.99967265,0.0001651035,0.000013231887,0.000050152532,0.000055937347,0.000043001484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035414487,0.0013546956,0.00030488058,0.00045886062,0.00017011586,0.001515813,0.0020356071,0.0009770795,0.018524965],"category_scores_gemma":[0.0014457646,0.0005347181,0.00048008462,0.00026412122,0.00038884915,0.0013561253,0.0016082933,0.0011755123,0.0044368347],"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.00044016624,0.00028466524,0.0009735485,0.00077185046,0.00009348708,0.0005049581,0.00090005377,0.012154904,0.18932617,0.02830469,0.042382214,0.7238633],"study_design_scores_gemma":[0.0002872168,0.0007262968,0.006130126,0.0006088918,0.00023167132,0.0036704703,0.00059029524,0.20556208,0.2005412,0.046017677,0.5353619,0.0002722024],"about_ca_topic_score_codex":0.001128768,"about_ca_topic_score_gemma":0.0018964137,"teacher_disagreement_score":0.018524965,"about_ca_system_score_codex":0.0002743882,"about_ca_system_score_gemma":0.00023727374,"threshold_uncertainty_score":0.0619722},"labels":[],"label_agreement":null},{"id":"W2232744440","doi":"10.1007/978-3-642-39094-4_78","title":"Image Reconstruction from Orthogonal Fourier-Mellin Moments","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Winnipeg","funders":"","keywords":"Cartesian coordinate system; Computer science; Fourier transform; Mellin transform; Velocity Moments; Algorithm; Harmonic; Applied mathematics; Mathematics; Mathematical analysis; Geometry; Optics; Zernike polynomials; Physics","score_opus":0.015864792915033045,"score_gpt":0.23784108252934288,"score_spread":0.22197628961430985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232744440","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.010815685,0.00061107974,0.9832592,0.00015482369,0.0000760111,0.000015968935,0.00007660448,0.00031602258,0.004674551],"genre_scores_gemma":[0.2116763,0.002694875,0.7691467,0.00018212514,0.00015784662,0.000043398093,0.00055852666,0.00035461813,0.015185605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997429,0.000048895796,0.000012060505,0.000033173837,0.00013344677,0.000029439117],"domain_scores_gemma":[0.999681,0.00011795598,0.000043359825,0.00007577594,0.00006514496,0.000016750597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004108838,0.0005465955,0.0005393624,0.0006985468,0.00018414714,0.0011581674,0.00047831752,0.00070474274,0.002755318],"category_scores_gemma":[0.0014259259,0.0003939031,0.0005056705,0.0009041892,0.0005721448,0.0015216664,0.0009257399,0.00093287457,0.0013907519],"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.00048437342,0.0000836132,0.00077129644,0.00044990526,0.00009108566,0.00033995902,0.0001878391,0.074755825,0.18298137,0.19177116,0.00825097,0.5398326],"study_design_scores_gemma":[0.00003043173,0.00006009924,0.0007313421,0.000050844515,0.00003527773,0.0011091302,0.00006796894,0.8351821,0.10326488,0.046104833,0.013306828,0.000056256788],"about_ca_topic_score_codex":0.0003718375,"about_ca_topic_score_gemma":0.0005984939,"teacher_disagreement_score":0.002755318,"about_ca_system_score_codex":0.00027896668,"about_ca_system_score_gemma":0.00030402376,"threshold_uncertainty_score":0.009217441},"labels":[],"label_agreement":null},{"id":"W2232963440","doi":"10.1007/978-3-642-36675-8_6","title":"Group Embedding of the Projective Plane PG(2, 3)","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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 Manitoba","funders":"","keywords":"Group (periodic table); Abelian group; Projective plane; Embedding; Line (geometry); Plane (geometry); Real projective plane; Combinatorics; Order (exchange); Blocking set; Point (geometry); Set (abstract data type); Projective space; Mathematics; Computer science; Discrete mathematics; Topology (electrical circuits); Projective test; Collineation; Pure mathematics; Geometry; Physics; Artificial intelligence; Quantum mechanics","score_opus":0.008292215418764315,"score_gpt":0.2005605530395908,"score_spread":0.19226833762082648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232963440","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.41422403,0.0026008121,0.15585642,0.002926313,0.001249482,0.0001375451,0.00089966954,0.00072423863,0.42138147],"genre_scores_gemma":[0.8760958,0.0013891171,0.02809938,0.00032548446,0.00046094693,0.000061902945,0.00053338235,0.00025876611,0.092775285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998035,0.000043854056,0.0000059457307,0.00003308441,0.0000669388,0.000046639947],"domain_scores_gemma":[0.9998952,0.00002164461,0.00001831928,0.00001794153,0.000017709403,0.000029043544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012494599,0.00066925545,0.00036813173,0.0009168263,0.00070550235,0.0014662001,0.00045153286,0.0004105974,0.009675163],"category_scores_gemma":[0.00024967917,0.0002443954,0.00023008822,0.00075264386,0.0010225562,0.0011178001,0.0009989153,0.0016672623,0.0017925629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001301981,0.00004213334,0.00016290444,0.00006963872,0.000012022301,0.00032169677,0.0005038338,0.002268527,0.0065720715,0.9457654,0.006488979,0.037662607],"study_design_scores_gemma":[0.00005738245,0.00014928782,0.0010935144,0.000038074475,0.0000206854,0.0007154986,0.00041444233,0.0066153808,0.005480577,0.8986384,0.08673944,0.000037200072],"about_ca_topic_score_codex":0.0008229151,"about_ca_topic_score_gemma":0.00073408795,"teacher_disagreement_score":0.009675163,"about_ca_system_score_codex":0.0004886846,"about_ca_system_score_gemma":0.00026307523,"threshold_uncertainty_score":0.032366693},"labels":[],"label_agreement":null},{"id":"W22334345","doi":"10.1007/978-3-642-32689-9_22","title":"PSOA2TPTP: A Reference Translator for Interoperating PSOA RuleML with TPTP Reasoners","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"National Research Council Canada; University of New Brunswick","funders":"","keywords":"Computer science; RuleML; Parsing; Programming language; Semantic reasoner; Artificial intelligence; Natural language processing; Markup language; XML; XHTML; World Wide Web","score_opus":0.031065961621513725,"score_gpt":0.25779070266685533,"score_spread":0.2267247410453416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22334345","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.0016188457,0.0001279208,0.8622519,0.00040405506,0.0003715228,0.00026416042,0.0057424,0.11971045,0.009508756],"genre_scores_gemma":[0.032441035,0.00044397492,0.82746625,0.0008073984,0.00019737826,0.00076359697,0.035581477,0.07749534,0.024803603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995449,0.000854492,0.0008750439,0.00083435944,0.0017545565,0.00023244684],"domain_scores_gemma":[0.99004704,0.0034272517,0.00039025082,0.0032617955,0.0026108986,0.0002626974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004977948,0.0019503466,0.0014124358,0.0036987138,0.0010621389,0.0073362743,0.0048305998,0.0034775347,0.035306],"category_scores_gemma":[0.014530238,0.0023529676,0.002847833,0.0028503907,0.0013459411,0.007085997,0.0042230305,0.0049589314,0.031229863],"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.00072262564,0.0005652656,0.0012064117,0.0028594206,0.00036565794,0.0022824667,0.0028900628,0.011858216,0.03778252,0.121371605,0.30451253,0.51358324],"study_design_scores_gemma":[0.00023695106,0.00011482248,0.0005676966,0.0005479857,0.00021711856,0.0014574872,0.00035812694,0.10513223,0.06918668,0.052732803,0.7691781,0.00026999332],"about_ca_topic_score_codex":0.002927056,"about_ca_topic_score_gemma":0.0026338,"teacher_disagreement_score":0.035306,"about_ca_system_score_codex":0.0010539985,"about_ca_system_score_gemma":0.0027923551,"threshold_uncertainty_score":0.11811036},"labels":[],"label_agreement":null},{"id":"W2233999953","doi":"10.1007/978-3-662-47854-7_16","title":"User Authentication Using Human Cognitive Abilities","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cognition; Computer science; Authentication (law); Human–computer interaction; Psychology; Cognitive psychology; Computer security; Neuroscience","score_opus":0.05557764297255902,"score_gpt":0.30483704779163123,"score_spread":0.24925940481907222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233999953","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09849091,0.014447427,0.42242247,0.0023143943,0.00042570112,0.0001384322,0.0002928221,0.002133572,0.45933434],"genre_scores_gemma":[0.9064963,0.005838691,0.048733033,0.00025152895,0.00010865045,0.00008405879,0.00012814306,0.000049225684,0.03831031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971014,0.00008326992,0.000013922809,0.0000486928,0.000104340834,0.00003950746],"domain_scores_gemma":[0.99911636,0.00057065854,0.00005907662,0.00010641491,0.00011198847,0.000035556666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000533251,0.00059832504,0.00019397626,0.00069550745,0.00024620586,0.0024081338,0.00041404905,0.0004255307,0.005886647],"category_scores_gemma":[0.0024692477,0.00016859874,0.00033655454,0.00053051737,0.0011387798,0.002608286,0.0011653256,0.0007055966,0.0012069892],"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.0001759,0.000119208686,0.003959661,0.0005272365,0.0000911443,0.00028456084,0.0013693366,0.008263726,0.015159029,0.2370647,0.010086744,0.72289884],"study_design_scores_gemma":[0.000049235,0.00046141483,0.0241561,0.0008329057,0.00023552317,0.0017920289,0.001410184,0.07477561,0.030496005,0.7154359,0.15014835,0.00020663397],"about_ca_topic_score_codex":0.0012942521,"about_ca_topic_score_gemma":0.00086581265,"teacher_disagreement_score":0.005886647,"about_ca_system_score_codex":0.00050678855,"about_ca_system_score_gemma":0.0005049567,"threshold_uncertainty_score":0.019692779},"labels":[],"label_agreement":null},{"id":"W2234078087","doi":"10.1007/978-3-642-30885-7_11","title":"Temporal Logic Model Checking in Alloy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Temporal logic; Transitive closure; Model checking; Description logic; Programming language; Computation tree logic; Semantics (computer science); Theoretical computer science; Transition system; Temporal logic of actions; Logic model; First-order logic; Interval temporal logic; Mathematics","score_opus":0.0604905728739901,"score_gpt":0.30076121105373504,"score_spread":0.24027063817974495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234078087","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.021461906,0.0007420478,0.9539882,0.0005504196,0.0001814527,0.0001117336,0.00020591466,0.0028518506,0.019906525],"genre_scores_gemma":[0.4496136,0.0010581271,0.5307055,0.00034401898,0.00013320078,0.00017937376,0.0006552822,0.0011290958,0.016181814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687517,0.0008825963,0.000184025,0.00032802095,0.0014656292,0.00026448196],"domain_scores_gemma":[0.99668956,0.0022259476,0.00014529985,0.0005283298,0.00036420373,0.00004670333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023420034,0.00095369306,0.0011895637,0.0012142018,0.0008772835,0.0030139578,0.0023759888,0.0010688056,0.0054264804],"category_scores_gemma":[0.0062594144,0.0011075505,0.0027009,0.001264254,0.0021408286,0.004178439,0.0017107715,0.0022259736,0.000963199],"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.0002940308,0.00010452627,0.00040318942,0.00044667875,0.00010058235,0.00028800569,0.00025873192,0.14721015,0.0101528745,0.73814946,0.0036568285,0.09893491],"study_design_scores_gemma":[0.000071509356,0.000049615443,0.00011083584,0.000121273166,0.00008673559,0.00013748526,0.00006930732,0.38909066,0.020274432,0.5790663,0.010886805,0.000035100707],"about_ca_topic_score_codex":0.0043885782,"about_ca_topic_score_gemma":0.0050727446,"teacher_disagreement_score":0.0054264804,"about_ca_system_score_codex":0.0019290136,"about_ca_system_score_gemma":0.0021048386,"threshold_uncertainty_score":0.01815331},"labels":[],"label_agreement":null},{"id":"W2234466563","doi":"10.1007/978-3-319-13909-8_10","title":"Confidence Weighted Local Phase Features for Robust Bone Surface Segmentation in Ultrasound","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Pelvic and Acetabular Injuries","field":"Medicine","cited_by":33,"is_retracted":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":"Ground truth; Artificial intelligence; Computer vision; Segmentation; Computer science; Imaging phantom; Visualization; Image segmentation; Image quality; Image (mathematics); Radiology; Medicine","score_opus":0.016843033189320792,"score_gpt":0.286022178079671,"score_spread":0.2691791448903502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234466563","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.005104683,0.0005886298,0.9928248,0.00008197152,0.00003711372,0.000021704762,0.000091794995,0.000742836,0.0005063603],"genre_scores_gemma":[0.1902452,0.0013105184,0.8024968,0.00012005681,0.00015159303,0.000103411774,0.00074098085,0.00080023374,0.004031218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999508,0.00007795332,0.00003307375,0.00008174793,0.00025387915,0.00004528205],"domain_scores_gemma":[0.9988287,0.000646283,0.00012155585,0.00012560668,0.00024790748,0.000029959683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766234,0.0007003189,0.001039021,0.0012173628,0.00023551568,0.0012481582,0.0015638423,0.0013248293,0.003389176],"category_scores_gemma":[0.0036012237,0.0007082877,0.00073575444,0.0015389271,0.0004510584,0.0012602948,0.0013224222,0.00137836,0.0014506266],"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.00022729479,0.000059008627,0.00037208878,0.00024209713,0.000043759497,0.000076068245,0.000059005473,0.08053288,0.049228374,0.0071801166,0.00534366,0.8566356],"study_design_scores_gemma":[0.000010258662,0.000058275626,0.0006929611,0.000026019929,0.000025530873,0.00016400871,0.000016385542,0.97228515,0.019007513,0.0049709114,0.0027234608,0.00001951801],"about_ca_topic_score_codex":0.0016891774,"about_ca_topic_score_gemma":0.0021947578,"teacher_disagreement_score":0.003389176,"about_ca_system_score_codex":0.00039241085,"about_ca_system_score_gemma":0.0005076061,"threshold_uncertainty_score":0.011337936},"labels":[],"label_agreement":null},{"id":"W2234489854","doi":"10.1007/978-3-319-07173-2_4","title":"Application of Support Vector Machines, Convolutional Neural Networks and Deep Belief Networks to Recognition of Partially Occluded Objects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Deep belief network; Convolutional neural network; Deep learning; Artificial neural network; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Generative grammar; Machine learning; Generative model; Object (grammar); Deep neural networks","score_opus":0.006511796528867622,"score_gpt":0.2342887773429512,"score_spread":0.22777698081408357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234489854","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.0145239495,0.006213798,0.97432095,0.00039632196,0.0002293742,0.00003292071,0.00017029265,0.0012097509,0.0029027269],"genre_scores_gemma":[0.2875291,0.00737461,0.6902551,0.00018837643,0.0002984493,0.00007931031,0.000668344,0.00020351399,0.01340326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996512,0.00006049847,0.000024541228,0.00007606786,0.0001535037,0.00003425594],"domain_scores_gemma":[0.99923897,0.00044038476,0.000048967628,0.00007864371,0.00016971433,0.000023261142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064369,0.0009997512,0.00091306254,0.0008782115,0.00022963999,0.0012738974,0.00089909934,0.000981364,0.0023046394],"category_scores_gemma":[0.002094829,0.0005829703,0.0006317674,0.0017737504,0.0004841097,0.0011845124,0.0010236738,0.0012587993,0.00068602955],"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.00008138962,0.00005708144,0.0004963313,0.00019317014,0.00008024778,0.00007287562,0.00004994216,0.17024155,0.008674306,0.008198245,0.0048404033,0.80701447],"study_design_scores_gemma":[0.0000025323327,0.000013302634,0.00023370476,0.000012176721,0.00000870665,0.000029580726,0.000009476802,0.98754334,0.002989091,0.007595609,0.0015553037,0.0000070973297],"about_ca_topic_score_codex":0.0059554633,"about_ca_topic_score_gemma":0.007619789,"teacher_disagreement_score":0.0059554633,"about_ca_system_score_codex":0.000584738,"about_ca_system_score_gemma":0.00059135404,"threshold_uncertainty_score":0.011841595},"labels":[],"label_agreement":null},{"id":"W2234524595","doi":"10.1007/978-3-319-24264-4_14","title":"A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Maritime Ports and Logistics","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Benchmark (surveying); Suite; Transit time; Port (circuit theory); Flow network; Revenue; Transit (satellite); Mathematical optimization; Heuristic; Network planning and design; Operator (biology); Operations research; Integer (computer science); Flow (mathematics); Integer programming; Scale (ratio); Class (philosophy); Transport engineering; Public transport; Algorithm; Telecommunications; Mathematics; Artificial intelligence; Engineering","score_opus":0.033595542698045364,"score_gpt":0.2199406000792333,"score_spread":0.18634505738118795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234524595","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.007751819,0.00054163224,0.93536377,0.0021813754,0.00023764197,0.00019185424,0.00028345728,0.00014338583,0.0533051],"genre_scores_gemma":[0.20181303,0.0030675025,0.7162302,0.001406003,0.0013567028,0.0009589045,0.0010714014,0.00039113918,0.07370517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990125,0.00036326508,0.00004770193,0.00023159251,0.00027455646,0.00007039266],"domain_scores_gemma":[0.997609,0.0017578013,0.00013089005,0.00019040724,0.00020791854,0.000103955055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017857569,0.0020298257,0.0011299197,0.0012652809,0.0009828794,0.002137006,0.0024748468,0.0026342925,0.01887834],"category_scores_gemma":[0.007123,0.00092841353,0.002428003,0.0015473835,0.0016717495,0.0048417803,0.0030949763,0.0052952655,0.0019184713],"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.00012752925,0.0002946623,0.00058857846,0.00064303546,0.00010413041,0.00029483886,0.00029978066,0.27991068,0.003057315,0.58578235,0.027070653,0.10182645],"study_design_scores_gemma":[0.000044051194,0.00009048161,0.00019839141,0.000092587754,0.000043808206,0.00015882426,0.000064956956,0.49594647,0.00055700133,0.4875814,0.015195677,0.000026396292],"about_ca_topic_score_codex":0.002084706,"about_ca_topic_score_gemma":0.0024322267,"teacher_disagreement_score":0.01887834,"about_ca_system_score_codex":0.0017281832,"about_ca_system_score_gemma":0.0012511231,"threshold_uncertainty_score":0.06315434},"labels":[],"label_agreement":null},{"id":"W2234789362","doi":"10.1007/978-3-319-25007-6_18","title":"Adding DL-Lite TBoxes to Proper Knowledge Bases","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Description logic; Negation; Conjunctive query; Computer science; Logical consequence; Property (philosophy); Ontology; Core (optical fiber); Theoretical computer science; Information retrieval; Programming language; Artificial intelligence; Relational database","score_opus":0.05036751089772788,"score_gpt":0.28884831003494366,"score_spread":0.23848079913721576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234789362","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.005411583,0.00061630004,0.97444147,0.000825221,0.0005800529,0.00013745743,0.0012869086,0.0038152135,0.012885678],"genre_scores_gemma":[0.050801244,0.0011089506,0.9297926,0.00072567124,0.00017050382,0.00012145389,0.0030881495,0.0014958844,0.012695606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997781,0.00043216333,0.0004741461,0.00041198262,0.0007251205,0.0001756713],"domain_scores_gemma":[0.996398,0.0010526272,0.00010938395,0.0014221448,0.00085136166,0.0001663647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030859283,0.00061459525,0.0007817511,0.0022639064,0.0009976365,0.00499131,0.0018336112,0.0010492617,0.012156695],"category_scores_gemma":[0.010464326,0.0016499755,0.0022610216,0.002290032,0.001411289,0.011786493,0.0051492923,0.0040622763,0.004766861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015191891,0.00015538874,0.00082995195,0.0010682946,0.00016333094,0.00048950454,0.0014033202,0.0049329554,0.008667995,0.5255839,0.029635653,0.42691776],"study_design_scores_gemma":[0.00007237332,0.000047276422,0.00038817473,0.00061519555,0.00030519324,0.0007072266,0.0005052161,0.0450238,0.023178985,0.5816964,0.34737444,0.00008567049],"about_ca_topic_score_codex":0.003549816,"about_ca_topic_score_gemma":0.0070312014,"teacher_disagreement_score":0.012156695,"about_ca_system_score_codex":0.0012979654,"about_ca_system_score_gemma":0.0017407476,"threshold_uncertainty_score":0.04066819},"labels":[],"label_agreement":null},{"id":"W2235559271","doi":"10.1007/978-3-319-24261-3_11","title":"Unsupervised Motion Segmentation Using Metric Embedding of Features","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Embedding; Computer vision; Motion (physics); Metric (unit); Image segmentation; A priori and a posteriori; Prior probability; Pattern recognition (psychology)","score_opus":0.05885663374578947,"score_gpt":0.3361807769074182,"score_spread":0.27732414316162873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235559271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009349702,0.00023724066,0.9886147,0.00003903189,0.000027957632,0.000035948055,0.00011578605,0.0008455386,0.00073418533],"genre_scores_gemma":[0.1845522,0.00050718745,0.80797714,0.00006174561,0.00007092177,0.000118142816,0.0016799186,0.00060789345,0.00442485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961567,0.00005831017,0.000021793821,0.00015989675,0.00009113206,0.000053160413],"domain_scores_gemma":[0.99956864,0.000117545664,0.00005745329,0.00009803911,0.00012799008,0.000030391093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033988437,0.0010110062,0.001303564,0.0014878524,0.00031379977,0.0009052318,0.0012494165,0.00081395934,0.0016525688],"category_scores_gemma":[0.0011291993,0.0005909072,0.00089524663,0.0019281594,0.00057476346,0.0011432759,0.0011057588,0.00086861436,0.0013033585],"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.00021876133,0.00008858976,0.0008442876,0.00016674511,0.000085737964,0.0000657939,0.000135818,0.09243432,0.077428095,0.011268818,0.0052471785,0.8120157],"study_design_scores_gemma":[0.000009797725,0.00007184612,0.0009954543,0.000022119708,0.000017946104,0.00009563422,0.00003311065,0.97102565,0.014873056,0.009577884,0.0032596467,0.00001788794],"about_ca_topic_score_codex":0.0035906327,"about_ca_topic_score_gemma":0.005442317,"teacher_disagreement_score":0.0035906327,"about_ca_system_score_codex":0.0005571441,"about_ca_system_score_gemma":0.00067964173,"threshold_uncertainty_score":0.007139504},"labels":[],"label_agreement":null},{"id":"W2235613556","doi":"10.1007/978-3-642-32790-2_25","title":"Supervised Distributional Semantic Relatedness","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Ottawa","funders":"","keywords":"Computer science; Word (group theory); Weighting; Semantic similarity; Natural language processing; Similarity (geometry); Artificial intelligence; Context (archaeology); Measure (data warehouse); Construct (python library); Similarity measure; Word Association; Variety (cybernetics); Association (psychology); Data mining; Mathematics; Image (mathematics)","score_opus":0.022791926180044872,"score_gpt":0.2386288397965285,"score_spread":0.2158369136164836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235613556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02145773,0.002558544,0.93565893,0.0008265594,0.0004905611,0.00012594963,0.0017331468,0.0042965496,0.03285206],"genre_scores_gemma":[0.41894865,0.0027854487,0.49737588,0.0005249872,0.0010454915,0.00038992052,0.02346977,0.0018362602,0.053623587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979907,0.00057599164,0.000121068195,0.0007067428,0.0005006789,0.000104815175],"domain_scores_gemma":[0.9983473,0.00048165646,0.00009496886,0.00066754455,0.00033793718,0.000070555885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844644,0.00089779816,0.0011014258,0.002353404,0.0011038639,0.0017498861,0.0015706358,0.0012568125,0.008916818],"category_scores_gemma":[0.0048766737,0.0005275023,0.0011596306,0.0028654796,0.0007646453,0.0045980453,0.0028512583,0.002032599,0.008621647],"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.00017126734,0.00027674765,0.0009488498,0.00029037552,0.00010527372,0.00009259105,0.00020651337,0.009861425,0.014700522,0.09187036,0.05590547,0.8255705],"study_design_scores_gemma":[0.000047910195,0.00016632487,0.0033059502,0.00014378579,0.00013174406,0.0010953385,0.00028735047,0.33722776,0.019234885,0.53490174,0.10337292,0.00008424964],"about_ca_topic_score_codex":0.0005922867,"about_ca_topic_score_gemma":0.0016190953,"teacher_disagreement_score":0.008916818,"about_ca_system_score_codex":0.00060854846,"about_ca_system_score_gemma":0.0010071563,"threshold_uncertainty_score":0.02982974},"labels":[],"label_agreement":null},{"id":"W2235750182","doi":"10.1007/978-3-662-48653-5_5","title":"Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Implementation; Computer science; Impossibility; Lock (firearm); Degrees of freedom (physics and chemistry); Theoretical computer science; Algorithm; Programming language","score_opus":0.031070026635925962,"score_gpt":0.2636655829254658,"score_spread":0.23259555628953987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235750182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13850436,0.001187844,0.8246378,0.00889481,0.00028379378,0.0001613623,0.00022961477,0.0014778046,0.024622591],"genre_scores_gemma":[0.92424375,0.0006977502,0.05696729,0.001656925,0.0005210398,0.00051269523,0.0002596442,0.00041890886,0.014722022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99156004,0.0019916839,0.0007163346,0.0024483134,0.0021332758,0.0011502794],"domain_scores_gemma":[0.9460453,0.040678117,0.0025733823,0.008018746,0.0018972625,0.00078729616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063241376,0.0007696754,0.0012804039,0.0005603328,0.0020226894,0.0042614024,0.001979778,0.0027220608,0.0059018238],"category_scores_gemma":[0.025624875,0.0010423602,0.0016497807,0.0010300546,0.008836344,0.014787686,0.0052146786,0.010826922,0.0010277001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033773005,0.0001058618,0.0015605044,0.000278893,0.000058595677,0.00026655517,0.0009649446,0.01611326,0.004748688,0.9392972,0.0027273104,0.03354033],"study_design_scores_gemma":[0.000058444493,0.00006615074,0.00023823928,0.000034646408,0.000023601327,0.00012940078,0.000096826356,0.026645822,0.0039606215,0.9656274,0.0030923446,0.00002643561],"about_ca_topic_score_codex":0.0005037493,"about_ca_topic_score_gemma":0.0003361835,"teacher_disagreement_score":0.0063241376,"about_ca_system_score_codex":0.0014568979,"about_ca_system_score_gemma":0.0017381939,"threshold_uncertainty_score":0.033445656},"labels":[],"label_agreement":null},{"id":"W2235825999","doi":"10.1007/978-3-662-44415-3_9","title":"A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Hasler Stiftung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Edit distance; Hausdorff distance; Computer science; Computation; Heuristic; Matching (statistics); Algorithm; Graph; Theoretical computer science; Computational complexity theory; Mathematics; Artificial intelligence","score_opus":0.009986013772851765,"score_gpt":0.23346017793738658,"score_spread":0.2234741641645348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235825999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01706234,0.00063849846,0.97567755,0.00015289323,0.00018211632,0.000114784205,0.00039257598,0.0029844495,0.0027948255],"genre_scores_gemma":[0.13640068,0.00029818798,0.85756373,0.00011890364,0.00013732661,0.00021948645,0.0015316085,0.0007896848,0.0029402857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783736,0.00055974093,0.00020561973,0.00052206643,0.00068059016,0.00019454803],"domain_scores_gemma":[0.99351716,0.0034653577,0.00024849048,0.0017482456,0.0007452521,0.00027556613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492315,0.0013852799,0.0025684764,0.004165649,0.0012599714,0.0033347069,0.0037286598,0.001800992,0.009517463],"category_scores_gemma":[0.012057028,0.0008508895,0.0016943977,0.0044418843,0.0013596022,0.0050092004,0.0025713143,0.0024701545,0.0028506562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006452005,0.00036774582,0.0015092526,0.0005726873,0.0002662498,0.00032093324,0.0004173161,0.16859898,0.013840434,0.14808756,0.021958992,0.6434147],"study_design_scores_gemma":[0.00008067318,0.00013668518,0.0005915484,0.000041120293,0.00007776969,0.00021807908,0.00011771677,0.83830315,0.0073396154,0.14656045,0.006462388,0.00007080592],"about_ca_topic_score_codex":0.0035058197,"about_ca_topic_score_gemma":0.0052159205,"teacher_disagreement_score":0.009517463,"about_ca_system_score_codex":0.0019473631,"about_ca_system_score_gemma":0.0019509195,"threshold_uncertainty_score":0.031839073},"labels":[],"label_agreement":null},{"id":"W2236111098","doi":"10.1007/978-3-642-31155-0_26","title":"Linear-Space Data Structures for Range Minority Query in Arrays","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Manitoba; University of Waterloo","funders":"","keywords":"Range query (database); Computer science; Query optimization; Data structure; Range (aeronautics); Preprocessor; Linear space; Algorithm; Web search query; Sargable; Theoretical computer science; Data mining; Information retrieval; Search engine; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.044450573550178285,"score_gpt":0.2879214141629149,"score_spread":0.2434708406127366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236111098","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.03483652,0.0031399208,0.93445426,0.0016857984,0.00031349505,0.00030250565,0.0024177006,0.008978522,0.013871313],"genre_scores_gemma":[0.34746847,0.0015628163,0.61975926,0.0011412657,0.00049841503,0.00096001296,0.0053816806,0.0015993769,0.021628698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998538,0.00023854988,0.00018346455,0.00016560705,0.0006865184,0.0001879242],"domain_scores_gemma":[0.99669826,0.0010627006,0.00021873043,0.0013916732,0.0005232524,0.000105448125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010372897,0.0005830467,0.0010713465,0.0012210464,0.0012049989,0.0025033308,0.0019732774,0.000905699,0.014050318],"category_scores_gemma":[0.005941529,0.00042583141,0.0007205853,0.003940871,0.0011328835,0.006002688,0.0037497855,0.001933755,0.003837781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013078711,0.00033933407,0.0020976937,0.0007964962,0.000079334444,0.00013678301,0.0009500239,0.01692661,0.02348559,0.26511234,0.07935839,0.60940945],"study_design_scores_gemma":[0.00041530942,0.00063584803,0.0012656497,0.0002769321,0.00012118638,0.000764064,0.0009884547,0.23027487,0.067099005,0.5843667,0.11362682,0.00016511064],"about_ca_topic_score_codex":0.0014695016,"about_ca_topic_score_gemma":0.002124685,"teacher_disagreement_score":0.014050318,"about_ca_system_score_codex":0.0013101422,"about_ca_system_score_gemma":0.0013041812,"threshold_uncertainty_score":0.04700297},"labels":[],"label_agreement":null},{"id":"W2236251086","doi":"10.1007/978-3-642-39094-4_29","title":"Color Correction Problem of Image Displayed on Non-white Projection Screen","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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":"Université de Sherbrooke","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Image (mathematics); Projection (relational algebra); Color balance; Contrast (vision); Color image; Computer graphics (images); Color constancy; Color correction; Image formation; Color histogram; Image processing; Algorithm","score_opus":0.008346806140764964,"score_gpt":0.2422769050084103,"score_spread":0.23393009886764532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236251086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052341837,0.0005973964,0.9296338,0.0011215677,0.00021259443,0.00006446382,0.00021430271,0.0007743967,0.015039663],"genre_scores_gemma":[0.6450714,0.0013023983,0.3134883,0.00024658756,0.00018627699,0.00008120876,0.0005530866,0.0005251642,0.03854561],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977547,0.00003970601,0.000007210976,0.00006644763,0.00007896671,0.00003206488],"domain_scores_gemma":[0.99944264,0.00024441024,0.00003949828,0.000060412636,0.00017451076,0.000038486105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031974268,0.0005636944,0.0005894978,0.0004826413,0.00047235616,0.0011393212,0.0009340063,0.0010168542,0.0056916224],"category_scores_gemma":[0.0021560367,0.00027960094,0.00042451033,0.0005483582,0.0005604754,0.0010529406,0.0006232843,0.001074836,0.00060014357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013511621,0.00018176186,0.0026749722,0.0012174819,0.00010674275,0.0018337457,0.00051153346,0.22252159,0.09018405,0.18341918,0.04572283,0.45027494],"study_design_scores_gemma":[0.00005681149,0.000061751845,0.00094049895,0.00003348341,0.000029340534,0.00061340636,0.000093118455,0.93981105,0.022108028,0.031103056,0.00511291,0.000036556943],"about_ca_topic_score_codex":0.0075814305,"about_ca_topic_score_gemma":0.0025069963,"teacher_disagreement_score":0.0075814305,"about_ca_system_score_codex":0.0006264482,"about_ca_system_score_gemma":0.0006771478,"threshold_uncertainty_score":0.019040346},"labels":[],"label_agreement":null},{"id":"W2236257122","doi":"10.1007/978-3-319-10581-9_4","title":"Stacked Multiscale Feature Learning for Domain Independent Medical Image Segmentation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Domain (mathematical analysis); Feature (linguistics); Image segmentation; Pattern recognition (psychology); Image (mathematics); Machine learning; Scale-space segmentation","score_opus":0.011355265691218537,"score_gpt":0.2845046924221303,"score_spread":0.27314942673091175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236257122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007836688,0.0003443371,0.9900553,0.00007298316,0.000024943436,0.000019720817,0.000112081216,0.00096514553,0.0005687477],"genre_scores_gemma":[0.2190715,0.00078899995,0.7750485,0.00017387143,0.00011126571,0.00010923274,0.0010156726,0.0005068747,0.0031740922],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997359,0.000043565142,0.000016401684,0.00006567078,0.000100188314,0.000038166272],"domain_scores_gemma":[0.99954647,0.00016188859,0.00004617676,0.0001116083,0.00010655254,0.00002723169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053739495,0.0007385024,0.0011187029,0.0009089715,0.00021994728,0.0007804355,0.0009869011,0.00097372744,0.0023846645],"category_scores_gemma":[0.0015009465,0.00056379836,0.001245253,0.0011003321,0.0003668054,0.0009879943,0.0015095514,0.0010312501,0.0009918512],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022682337,0.00009631217,0.0006774072,0.00016853189,0.00017535743,0.000118201344,0.0000567724,0.10548629,0.08508354,0.0072131422,0.0054104603,0.7952871],"study_design_scores_gemma":[0.000006238433,0.00004411664,0.0005887635,0.000009029519,0.00003537095,0.00013406778,0.000011264135,0.9777949,0.013676271,0.005915354,0.0017719122,0.000012756198],"about_ca_topic_score_codex":0.0018132826,"about_ca_topic_score_gemma":0.0033366994,"teacher_disagreement_score":0.0023846645,"about_ca_system_score_codex":0.0003836734,"about_ca_system_score_gemma":0.00063762226,"threshold_uncertainty_score":0.007977486},"labels":[],"label_agreement":null},{"id":"W2236298083","doi":"10.1007/978-3-319-21819-9_17","title":"Simulation of the 2JLP Gene Assembly Process in Ciliates","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protist diversity and phylogeny","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 Saskatchewan","funders":"","keywords":"Computer science; Process (computing); Engineering drawing; Programming language; Engineering","score_opus":0.02148236893000805,"score_gpt":0.2635986840902476,"score_spread":0.24211631516023957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236298083","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.9406177,0.00037564486,0.029421639,0.00095965405,0.0001547123,0.000051148727,0.0012586704,0.00072900904,0.02643184],"genre_scores_gemma":[0.98997223,0.00012279111,0.006426632,0.00010159819,0.000020152438,0.00005570085,0.0004587833,0.00010495371,0.0027370641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985933,0.000027502396,0.000006215212,0.000019155048,0.000033136246,0.000054622953],"domain_scores_gemma":[0.9990343,0.00062146335,0.0000607718,0.000052164367,0.00009428315,0.0001370125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028778517,0.0004422954,0.00073111313,0.000492348,0.0011219003,0.00093797484,0.0013984498,0.0024042572,0.006520871],"category_scores_gemma":[0.0016247698,0.00064606563,0.0011065761,0.0005977853,0.0010228768,0.00051915564,0.0010161409,0.000917539,0.00046813392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066340086,0.000024587256,0.0012994118,0.000032830765,0.000015834703,0.00013588509,0.000058097354,0.99303293,0.0008897609,0.0030977486,0.00038349573,0.0009630629],"study_design_scores_gemma":[0.00002183748,0.000011922188,0.00035274978,0.0000049768178,0.000004315127,0.000011620372,0.000016744223,0.9984242,0.00022586492,0.00076211063,0.00015795138,0.0000057681355],"about_ca_topic_score_codex":0.051127322,"about_ca_topic_score_gemma":0.017612621,"teacher_disagreement_score":0.051127322,"about_ca_system_score_codex":0.0016657361,"about_ca_system_score_gemma":0.001418626,"threshold_uncertainty_score":0.10165942},"labels":[],"label_agreement":null},{"id":"W2237248385","doi":"10.1007/978-3-642-33460-3_48","title":"Learning and Inference in Probabilistic Classifier Chains with Beam Search","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Inference; Classifier (UML); Probabilistic logic; Artificial intelligence; Machine learning; Beam search; Binary classification; Flexibility (engineering); sort; Algorithm; Search algorithm; Mathematics; Support vector machine; Information retrieval","score_opus":0.02746902263249762,"score_gpt":0.2691181450713802,"score_spread":0.2416491224388826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237248385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042819213,0.00030102683,0.9937896,0.0002778428,0.00002392229,0.000055095017,0.00010864917,0.00056310295,0.00059890916],"genre_scores_gemma":[0.12737338,0.00052597,0.8648536,0.00052166235,0.00025291924,0.0005752939,0.0013884517,0.000395199,0.004113509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99147964,0.004816509,0.0005948519,0.0013974782,0.00119837,0.0005131058],"domain_scores_gemma":[0.92706954,0.06483648,0.0014376441,0.0038478838,0.0021994254,0.0006089656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0149951475,0.0015502224,0.004875774,0.003343147,0.0024544985,0.0040085623,0.0062545286,0.0049407883,0.010394728],"category_scores_gemma":[0.05001458,0.004856129,0.0038096576,0.005949952,0.0046541006,0.010724529,0.006081265,0.007489037,0.0035666402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006678761,0.00029493164,0.0027955796,0.000347475,0.00034589312,0.00020256655,0.00055731466,0.60657936,0.0009928923,0.14744538,0.009013185,0.2307575],"study_design_scores_gemma":[0.00003661502,0.000021781476,0.00005324666,0.00002401835,0.000020272384,0.000020738074,0.000014953195,0.9011373,0.00026244437,0.0979967,0.00040133565,0.0000106417365],"about_ca_topic_score_codex":0.012367297,"about_ca_topic_score_gemma":0.014495615,"teacher_disagreement_score":0.0149951475,"about_ca_system_score_codex":0.002497848,"about_ca_system_score_gemma":0.003160084,"threshold_uncertainty_score":0.07930285},"labels":[],"label_agreement":null},{"id":"W2237544177","doi":"10.1007/978-3-642-35813-5_5","title":"Towards Practical Runtime Verification and Validation of Self-Adaptive Software Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Universidad ICESI; International Business Machines Corporation","keywords":"Computer science; Adaptation (eye); Software engineering; Verification and validation; Software; Software quality; Field (mathematics); Software system; Software development; Software verification; Software construction; Programming language","score_opus":0.039474960745032726,"score_gpt":0.28557474917394055,"score_spread":0.2460997884289078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237544177","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.009632853,0.00019484198,0.98364615,0.00020928108,0.000054254473,0.00008406632,0.000034215715,0.0036078407,0.002536566],"genre_scores_gemma":[0.31082943,0.00047622513,0.6810337,0.00022565373,0.00008029558,0.00016161571,0.0003423601,0.0013836616,0.005467086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925488,0.0027959489,0.000498664,0.0007932264,0.0028280797,0.0005352624],"domain_scores_gemma":[0.98671454,0.0056821005,0.00047971494,0.00524771,0.0016905825,0.00018530153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005541704,0.001210046,0.001005128,0.00076676614,0.0009051692,0.0029291795,0.00285299,0.002150497,0.005379501],"category_scores_gemma":[0.01873497,0.0013921227,0.0018188441,0.00050967606,0.0029317313,0.0038722996,0.0049863653,0.004202545,0.001956027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000573167,0.0003007759,0.002001914,0.0011770951,0.0001900305,0.00066540926,0.0013741145,0.15833053,0.08847956,0.29092407,0.008333142,0.44765016],"study_design_scores_gemma":[0.00012531457,0.00016230743,0.00045384138,0.0002616311,0.00007912232,0.00041673242,0.00015294267,0.65716755,0.08426806,0.23201962,0.024837641,0.00005515096],"about_ca_topic_score_codex":0.0011577747,"about_ca_topic_score_gemma":0.00162715,"teacher_disagreement_score":0.005541704,"about_ca_system_score_codex":0.0010814834,"about_ca_system_score_gemma":0.0022522598,"threshold_uncertainty_score":0.029307663},"labels":[],"label_agreement":null},{"id":"W2238074379","doi":"10.1007/978-3-319-24912-4_12","title":"Adding a Textual Syntax to an Existing Graphical Modeling Language: Experience Report with GRL","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Syntax; Abstract syntax; Programming language; Syntax error; Abstract syntax tree; Usability; Metamodeling; Notation; Feature (linguistics); Model transformation; Reuse; Natural language processing; Artificial intelligence; Linguistics; Human–computer interaction; Consistency (knowledge bases)","score_opus":0.03933042288733065,"score_gpt":0.29930153570005524,"score_spread":0.2599711128127246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238074379","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.006132529,0.0003230978,0.92848474,0.00082753785,0.00020694907,0.00022372369,0.0012637787,0.046789613,0.015748113],"genre_scores_gemma":[0.045723513,0.00075091707,0.9006552,0.0005122524,0.000059367747,0.00022302737,0.005403495,0.027457802,0.019214403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99695516,0.0010968801,0.0002938766,0.00039529146,0.0011469597,0.0001117862],"domain_scores_gemma":[0.99148166,0.0041001146,0.00026598378,0.0021387988,0.0018303538,0.00018313255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049199252,0.0014115148,0.0008599738,0.0012771271,0.0007321297,0.005167709,0.0038172167,0.001534698,0.02052559],"category_scores_gemma":[0.011534389,0.0016612799,0.0015621879,0.0017604311,0.0012615402,0.0069223735,0.0029011297,0.0038139902,0.020593379],"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.00047752436,0.0006136849,0.0017142564,0.0024701897,0.00011313618,0.0013007584,0.006772998,0.0138626145,0.05747867,0.09007815,0.11434385,0.7107742],"study_design_scores_gemma":[0.00030693974,0.0003491321,0.00090179645,0.0010094167,0.00034019,0.0019955044,0.0013190826,0.12596935,0.07426863,0.040239837,0.75300944,0.0002906844],"about_ca_topic_score_codex":0.004013839,"about_ca_topic_score_gemma":0.004173622,"teacher_disagreement_score":0.02052559,"about_ca_system_score_codex":0.00095400424,"about_ca_system_score_gemma":0.001931005,"threshold_uncertainty_score":0.06866497},"labels":[],"label_agreement":null},{"id":"W2238252738","doi":"10.1007/978-3-319-07293-7_13","title":"Understanding the Factors That Influence the Perceived Severity of Cyber-bullying","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bullying, Victimization, and Aggression","field":"Psychology","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":"McMaster University","funders":"","keywords":"Cyber bullying; Psychology; Computer security; Computer science; World Wide Web","score_opus":0.05558899055768354,"score_gpt":0.28590839139805146,"score_spread":0.23031940084036792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238252738","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.96227175,0.009096223,0.003722813,0.003615756,0.00007428586,0.000050343195,0.00018789798,0.000021423359,0.02095944],"genre_scores_gemma":[0.989175,0.0062910747,0.0013138737,0.00024259722,0.00005543616,0.000021522143,0.00015352172,0.00000688347,0.002740089],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99959916,0.000121467034,0.000020150776,0.000058662325,0.000093191884,0.00010735838],"domain_scores_gemma":[0.9979576,0.0011866402,0.0004581782,0.000038508457,0.00014177019,0.00021736383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009539729,0.0003590957,0.00033392312,0.0006324295,0.00040793634,0.0026977216,0.0004403315,0.00059531204,0.0055137333],"category_scores_gemma":[0.004185027,0.00032164317,0.0004264283,0.00050717127,0.0006023751,0.0019032449,0.0007467748,0.0015978242,0.0003207961],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013173891,0.00067194377,0.81112486,0.00029165408,0.000257812,0.0002783872,0.011052719,0.0007981245,0.0025793596,0.008862221,0.0027381403,0.16121295],"study_design_scores_gemma":[0.0000033550689,0.0000842983,0.98368514,0.00027287655,0.0000970125,0.00015135683,0.008101653,0.0010082284,0.00022181935,0.0045763077,0.0017797436,0.0000181337],"about_ca_topic_score_codex":0.010351447,"about_ca_topic_score_gemma":0.01963335,"teacher_disagreement_score":0.010351447,"about_ca_system_score_codex":0.0005029392,"about_ca_system_score_gemma":0.0013529564,"threshold_uncertainty_score":0.020582378},"labels":[],"label_agreement":null},{"id":"W2238809220","doi":"10.1007/978-3-662-48221-6_5","title":"Orthology Relation and Gene Tree Correction: Complexity Results","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"","keywords":"Tree (set theory); Converse; Relation (database); Set (abstract data type); Computer science; Similarity (geometry); Tree rearrangement; K-ary tree; Gene; Sequence (biology); Phylogenetic tree; Tree structure; Mathematics; Combinatorics; Algorithm; Biology; Binary tree; Data mining; Artificial intelligence; Genetics; Image (mathematics)","score_opus":0.03606159735357247,"score_gpt":0.25751579841251765,"score_spread":0.22145420105894517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238809220","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.032359973,0.0011802186,0.9571107,0.0010368368,0.00026707238,0.0001086793,0.0005898713,0.0012415265,0.006105165],"genre_scores_gemma":[0.32723808,0.0010432613,0.65189356,0.00052959507,0.0011589079,0.00032983272,0.0031685634,0.0023854142,0.01225281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922009,0.0022366785,0.00047631492,0.0017003515,0.002904814,0.00048089153],"domain_scores_gemma":[0.8955913,0.079820566,0.0029518818,0.01411131,0.0060630897,0.0014618493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008651074,0.0013950055,0.002484398,0.0046075513,0.0024174259,0.0044503356,0.0062581096,0.0025424482,0.010486963],"category_scores_gemma":[0.08275592,0.001082592,0.003656638,0.004918364,0.0034202975,0.010153073,0.0068931524,0.0066246153,0.002190487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001451494,0.00055093184,0.019966973,0.0010773543,0.00052393955,0.0010027773,0.0010011619,0.13030882,0.0171177,0.2655274,0.02110809,0.5403633],"study_design_scores_gemma":[0.0000679522,0.00010327734,0.005396864,0.000095408315,0.00018968672,0.00073883496,0.00014970664,0.5912096,0.0102428645,0.38596842,0.005763375,0.00007393269],"about_ca_topic_score_codex":0.0018345707,"about_ca_topic_score_gemma":0.0022503263,"teacher_disagreement_score":0.010486963,"about_ca_system_score_codex":0.0018574399,"about_ca_system_score_gemma":0.0018785105,"threshold_uncertainty_score":0.04575181},"labels":[],"label_agreement":null},{"id":"W2239064739","doi":"10.1007/978-3-319-27036-4_17","title":"Narrative Review Process: Getting Useful Feedback on Your Story","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Storytelling and Education","field":"Health Professions","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":"Ubisoft (Canada)","funders":"","keywords":"Computer science; Narrative; Process (computing); Human–computer interaction; Multimedia; Programming language; Linguistics; Philosophy","score_opus":0.10937618230598713,"score_gpt":0.40619581904881075,"score_spread":0.29681963674282363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239064739","genre_codex":"commentary","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.015146691,0.020643871,0.16167594,0.54647416,0.11503078,0.04766434,0.007972822,0.009372681,0.07601868],"genre_scores_gemma":[0.093131125,0.018305233,0.3398617,0.19197628,0.037708405,0.15478438,0.0051598917,0.008157574,0.15091532],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.89146733,0.07427838,0.009409792,0.0037706818,0.019229352,0.0018444888],"domain_scores_gemma":[0.5915983,0.19655071,0.024408419,0.020914692,0.15358685,0.01294106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0894713,0.0017690968,0.0019304327,0.0046524857,0.005292518,0.010866161,0.0027251188,0.007931605,0.04148362],"category_scores_gemma":[0.46038383,0.0014657667,0.0016898265,0.0021429178,0.0033736643,0.0069297627,0.010957639,0.008712591,0.04591352],"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.00021226998,0.000064468084,0.00020480005,0.0030635851,0.00006084584,0.0003480963,0.018083917,0.00008417884,0.001381667,0.0022099514,0.87731737,0.096968964],"study_design_scores_gemma":[0.00024145434,0.0001697394,0.00040154048,0.0060350094,0.00011813197,0.0005983329,0.012325504,0.00037989905,0.002023393,0.008972051,0.9685732,0.00016169332],"about_ca_topic_score_codex":0.0010539402,"about_ca_topic_score_gemma":0.0036361078,"teacher_disagreement_score":0.0894713,"about_ca_system_score_codex":0.0038505248,"about_ca_system_score_gemma":0.018271042,"threshold_uncertainty_score":0.4731751},"labels":[],"label_agreement":null},{"id":"W2240446007","doi":"10.1007/978-3-319-20801-5_10","title":"Attributed Relational Graph-Based Learning of Object Models for Object Segmentation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Artificial intelligence; Homogeneous; Computer science; Graph; Pattern recognition (psychology); Segmentation; Cognitive neuroscience of visual object recognition; Spatial relation; Object-based spatial database; Object (grammar); Mathematics; Computer vision; Spatial analysis; Theoretical computer science; Combinatorics; Spatial database","score_opus":0.051535554493965796,"score_gpt":0.30484897288585716,"score_spread":0.25331341839189137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240446007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011664258,0.0005201708,0.9847513,0.00013727337,0.000027501896,0.000052984804,0.0003806547,0.0019844496,0.00048141918],"genre_scores_gemma":[0.3645498,0.0010334135,0.6238067,0.0002704685,0.00011080855,0.00019561026,0.005089606,0.0008862516,0.0040573874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985624,0.0003797211,0.00009057248,0.00059821235,0.0002538013,0.00011529795],"domain_scores_gemma":[0.9963468,0.002104794,0.00023896142,0.000737563,0.0004491342,0.00012285839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019520918,0.0013461418,0.0027038034,0.0030613162,0.0007872671,0.0022261166,0.005764489,0.0024247677,0.003485269],"category_scores_gemma":[0.005842223,0.0013440613,0.0028291633,0.004265402,0.0012962994,0.00387436,0.0024916774,0.0031202442,0.0020260967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035130783,0.00021450395,0.0016793992,0.00026853196,0.0002565783,0.000114486356,0.00022332945,0.61247367,0.004923962,0.017595463,0.0056006913,0.35629815],"study_design_scores_gemma":[0.000004296639,0.000014938448,0.000089982525,0.000007174904,0.000015820802,0.000013872366,0.000011587281,0.9890324,0.0006720863,0.009787176,0.00034547277,0.0000051289735],"about_ca_topic_score_codex":0.021110164,"about_ca_topic_score_gemma":0.027877606,"teacher_disagreement_score":0.021110164,"about_ca_system_score_codex":0.0024012886,"about_ca_system_score_gemma":0.0014728205,"threshold_uncertainty_score":0.041974604},"labels":[],"label_agreement":null},{"id":"W2240584779","doi":"10.1007/11553762_26","title":"A General Multi-agent Modelling Framework for the Transit Assignment Problem – A Learning-Based Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation Planning and Optimization","field":"Social Sciences","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 Toronto","funders":"","keywords":"Computer science; Transit (satellite); Process (computing); Conceptual framework; Operations research; Public transport; Artificial intelligence; Transport engineering; Engineering","score_opus":0.03837403273412427,"score_gpt":0.27569354000828733,"score_spread":0.23731950727416307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240584779","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.0009897302,0.0002480007,0.9954217,0.00030699588,0.000030538034,0.000022822296,0.00005752745,0.00007594392,0.0028466901],"genre_scores_gemma":[0.25972775,0.0020579146,0.716623,0.00033826358,0.00031971786,0.00045024778,0.0004462453,0.00022075264,0.01981608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994343,0.00023667085,0.00003249537,0.00012322888,0.00012104495,0.000052247655],"domain_scores_gemma":[0.99945396,0.00027357714,0.000070822825,0.000049918457,0.00010236001,0.000049419297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124545,0.0012580185,0.0016310471,0.0008320815,0.0008123697,0.001993296,0.0040379856,0.0025219566,0.0057561817],"category_scores_gemma":[0.0019228616,0.000816022,0.0020239092,0.0015114493,0.0012034946,0.0030812758,0.0018116755,0.0023690828,0.001302872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016733191,0.000039189217,0.00011213993,0.0000982805,0.00004447959,0.00008870896,0.00006776245,0.8103695,0.0005519558,0.1698334,0.0017811514,0.01699669],"study_design_scores_gemma":[0.000005335678,0.000008159754,0.000025797877,0.000009973304,0.000008848085,0.00001934021,0.0000072572348,0.9346748,0.00007862317,0.06302986,0.0021249182,0.0000070455276],"about_ca_topic_score_codex":0.008752588,"about_ca_topic_score_gemma":0.00866191,"teacher_disagreement_score":0.008752588,"about_ca_system_score_codex":0.0013378629,"about_ca_system_score_gemma":0.0015049789,"threshold_uncertainty_score":0.019256294},"labels":[],"label_agreement":null},{"id":"W2242998248","doi":"10.1007/978-3-319-20801-5_1","title":"Modelling of Subjective Radiological Assessments with Objective Image Quality Measures of Brain and Body CT Images","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","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":"Hamilton Health Sciences; McMaster University; University of Waterloo","funders":"","keywords":"Computer science; Image quality; Mean squared error; Peak signal-to-noise ratio; Ground truth; Artificial intelligence; Receiver operating characteristic; Noise (video); Fidelity; Signal-to-noise ratio (imaging); Similarity (geometry); Pattern recognition (psychology); Image (mathematics); Computer vision; Statistics; Mathematics; Machine learning","score_opus":0.09043762229162151,"score_gpt":0.3481972463336286,"score_spread":0.2577596240420071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242998248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067365974,0.0006815285,0.9272267,0.0001449705,0.000051566556,0.00010148185,0.00024994466,0.00027408803,0.0039037622],"genre_scores_gemma":[0.9272126,0.00063298363,0.063130885,0.000049431095,0.00003691025,0.00018898904,0.00027866915,0.00013845999,0.008331135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994041,0.00017403287,0.000035485424,0.00014032508,0.00019447607,0.000051671475],"domain_scores_gemma":[0.9972887,0.0018179961,0.00034469215,0.00011030285,0.00036487717,0.00007349766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013518172,0.0006734546,0.0005639026,0.0005753447,0.00014256881,0.0013625115,0.0013560822,0.0012420482,0.0022075453],"category_scores_gemma":[0.006428142,0.00068206916,0.0011458386,0.00046944365,0.00058491214,0.0009378287,0.0005968738,0.0007158997,0.00045504665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051907376,0.000037456855,0.00091635593,0.00010070139,0.000029329458,0.00006972728,0.00007922534,0.97914827,0.0028936774,0.002805313,0.00024351163,0.013624632],"study_design_scores_gemma":[0.0000031954341,0.000024864965,0.0006584342,0.000009988271,0.00000999822,0.000031114392,0.000005405664,0.99758637,0.00047043987,0.0010313902,0.00016033303,0.000008416816],"about_ca_topic_score_codex":0.008474719,"about_ca_topic_score_gemma":0.0060293316,"teacher_disagreement_score":0.008474719,"about_ca_system_score_codex":0.00082518125,"about_ca_system_score_gemma":0.0005865308,"threshold_uncertainty_score":0.01685077},"labels":[],"label_agreement":null},{"id":"W2243081709","doi":"10.1007/978-3-540-69073-3_25","title":"Second International Workshop on Multi-Paradigm Modeling: Concepts and Tools","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Abstraction; Set (abstract data type); Field (mathematics); Software engineering; Task (project management); Paradigm shift; Data science; Management science; Human–computer interaction; Systems engineering; Programming language; Engineering","score_opus":0.042091437154824995,"score_gpt":0.28125585796724,"score_spread":0.239164420812415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243081709","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004323619,0.004107228,0.9483491,0.0020081853,0.0025259103,0.00013149317,0.00031407655,0.002121128,0.03611925],"genre_scores_gemma":[0.05447001,0.008230821,0.77892935,0.0010738771,0.0008580189,0.00039772337,0.0025546572,0.0022269518,0.15125863],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988423,0.0003130813,0.00007946894,0.00021993909,0.00041829154,0.00012701948],"domain_scores_gemma":[0.9986897,0.00033814885,0.00003998777,0.00035053922,0.0004247336,0.00015683626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028068158,0.0015128194,0.0011489864,0.0013073774,0.0007501932,0.0040452736,0.0028394784,0.0016738344,0.022545794],"category_scores_gemma":[0.0028114389,0.000861496,0.0019903935,0.0016614414,0.0005877048,0.005625523,0.0026251138,0.0031622115,0.0065258685],"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.00020201104,0.00039031132,0.0005842485,0.00057785225,0.00013768746,0.00034654504,0.00097192166,0.014397687,0.010065815,0.20060761,0.10689694,0.66482145],"study_design_scores_gemma":[0.000040912364,0.0001459675,0.00043806477,0.00040851912,0.00011850674,0.0007578528,0.00033710783,0.06858802,0.010162074,0.19583349,0.72310454,0.000064833126],"about_ca_topic_score_codex":0.0018814818,"about_ca_topic_score_gemma":0.0023112074,"teacher_disagreement_score":0.022545794,"about_ca_system_score_codex":0.0010901204,"about_ca_system_score_gemma":0.0023791874,"threshold_uncertainty_score":0.07542318},"labels":[],"label_agreement":null},{"id":"W2243405571","doi":"10.1007/978-3-319-09581-3_5","title":"Linearizability Is Not Always a Safety Property","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"York University","funders":"","keywords":"Linearizability; Property (philosophy); Computer science; Consistency (knowledge bases); Counterexample; Object (grammar); Zeno's paradoxes; Lemma (botany); Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.017653175369976837,"score_gpt":0.23456399840075864,"score_spread":0.2169108230307818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243405571","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.14460684,0.0030021353,0.49206904,0.012558281,0.0016008975,0.0001106506,0.000673985,0.0034891649,0.34188905],"genre_scores_gemma":[0.87857586,0.001138773,0.035949524,0.002179918,0.0009864061,0.00023750971,0.0005687727,0.0006854022,0.07967785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00014566723,0.00007623262,0.00037175446,0.00023612715,0.00017962563],"domain_scores_gemma":[0.99305564,0.0042786407,0.0005055911,0.0013048284,0.0006822258,0.0001730729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092348014,0.00050380407,0.00059644674,0.0004907416,0.001157202,0.0020106484,0.00086298265,0.0010970127,0.014209602],"category_scores_gemma":[0.0040154904,0.00057225797,0.0007208844,0.0006010609,0.0029836968,0.007719651,0.001711287,0.0032333436,0.0030071195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016852592,0.000079870566,0.0010508741,0.00042632403,0.000046881356,0.00028390152,0.0007127597,0.0025266248,0.009347295,0.91324395,0.014545886,0.057567023],"study_design_scores_gemma":[0.000026289554,0.000059654958,0.0004259044,0.000047413938,0.000026501457,0.00026560624,0.00013829603,0.0025398682,0.0059069144,0.9742396,0.016305586,0.00001842959],"about_ca_topic_score_codex":0.00029460806,"about_ca_topic_score_gemma":0.00043757295,"teacher_disagreement_score":0.014209602,"about_ca_system_score_codex":0.00054164854,"about_ca_system_score_gemma":0.0005664833,"threshold_uncertainty_score":0.047535837},"labels":[],"label_agreement":null},{"id":"W2244294681","doi":"10.1007/978-3-662-44199-2_73","title":"Computing Moore-Penrose Inverses of Ore Polynomial Matrices","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Maple; Quaternion; Polynomial; Moore–Penrose pseudoinverse; Inverse; Computation; Algebra over a field; Computer science; Symbolic computation; Algorithm; Mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.011679567542008306,"score_gpt":0.2356570233112701,"score_spread":0.22397745576926179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244294681","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.09598957,0.0004454486,0.87972414,0.00030935262,0.00021258979,0.000054815442,0.00047656812,0.0016970738,0.021090355],"genre_scores_gemma":[0.54710495,0.0005934065,0.4284887,0.00019869076,0.00025579956,0.000064944164,0.0018757428,0.0006784834,0.020739289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999015,0.00014617514,0.00006417959,0.00022734987,0.0004077506,0.00013950124],"domain_scores_gemma":[0.99791056,0.0008389419,0.00016312116,0.0005165927,0.00043990836,0.00013082454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006590962,0.000851872,0.00088815397,0.0009151463,0.0005446336,0.0021609038,0.001184957,0.0007842417,0.012453037],"category_scores_gemma":[0.006095421,0.0005159793,0.00080004014,0.0012540587,0.0010561901,0.004806807,0.0020021237,0.0017901865,0.0038605148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007021946,0.00025999284,0.0024043778,0.00042891884,0.00008672852,0.00038606397,0.00054994045,0.062356114,0.023587245,0.45924854,0.016595373,0.4333945],"study_design_scores_gemma":[0.00005419942,0.0001916218,0.0007890644,0.00006924672,0.000028611137,0.00050119194,0.00026428507,0.22251715,0.022985088,0.73969305,0.012847465,0.000059031812],"about_ca_topic_score_codex":0.00065459864,"about_ca_topic_score_gemma":0.0017666977,"teacher_disagreement_score":0.012453037,"about_ca_system_score_codex":0.00046844932,"about_ca_system_score_gemma":0.00059370504,"threshold_uncertainty_score":0.041659594},"labels":[],"label_agreement":null},{"id":"W2244411073","doi":"10.1007/978-3-319-09274-4_29","title":"System Factorial Technology Applied to Artificial Neural Network Information Processing","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Categorization; Computer science; Information processing; Factorial; Artificial neural network; Recall; Artificial intelligence; Architecture; Serial memory processing; Cognition; Task (project management); Process (computing); Parallel processing; Cognitive architecture; Machine learning; Pattern recognition (psychology); Parallel computing; Mathematics; Programming language; Psychology; Engineering; Cognitive psychology","score_opus":0.011777703639591571,"score_gpt":0.22514326148419767,"score_spread":0.2133655578446061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244411073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050146487,0.00058644597,0.989962,0.00012586823,0.00015328119,0.000052371197,0.00007131869,0.0004346118,0.0035995864],"genre_scores_gemma":[0.20484583,0.0008725023,0.78483975,0.0001076595,0.0001880588,0.00029806414,0.00023948094,0.0002205209,0.008388186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887234,0.0005182814,0.00007657567,0.00021182152,0.0002628329,0.00005815799],"domain_scores_gemma":[0.99850816,0.00094970356,0.00006308451,0.00015669025,0.00029531142,0.000026990776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017010731,0.00053229445,0.00083334505,0.0007090816,0.0005465457,0.0013916848,0.0007031364,0.000673669,0.011008607],"category_scores_gemma":[0.005163708,0.0004467527,0.0008806784,0.0014318144,0.00082754315,0.0013324509,0.0006976966,0.0012026563,0.0015929003],"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.00037649382,0.00013492069,0.0009866232,0.0007125831,0.00018729382,0.00015881693,0.0002454265,0.11215938,0.03279323,0.40728733,0.0057833754,0.43917453],"study_design_scores_gemma":[0.00002885438,0.00019878217,0.00089667854,0.000031522206,0.000059947117,0.0000871532,0.000028900286,0.8440891,0.011018922,0.13204047,0.0114802,0.000039445917],"about_ca_topic_score_codex":0.0018646838,"about_ca_topic_score_gemma":0.0020015722,"teacher_disagreement_score":0.011008607,"about_ca_system_score_codex":0.0009108342,"about_ca_system_score_gemma":0.00075802545,"threshold_uncertainty_score":0.036827505},"labels":[],"label_agreement":null},{"id":"W2244599202","doi":"10.1007/978-3-642-38457-8_35","title":"Shape-Based Analysis for Automatic Segmentation of Arabic Handwritten Text","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Scripting language; Segmentation; Spotting; Arabic; Artificial intelligence; Natural language processing; Text segmentation; Image segmentation; Market segmentation; Pattern recognition (psychology); Speech recognition; Linguistics","score_opus":0.018844337319278006,"score_gpt":0.26083554903246015,"score_spread":0.24199121171318214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244599202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12049769,0.0023206268,0.8550958,0.0002549917,0.00029996262,0.00030219535,0.0013430577,0.012241691,0.0076439283],"genre_scores_gemma":[0.29519862,0.0015927291,0.6857947,0.00021914975,0.00014822136,0.00023158747,0.0034102392,0.0016145787,0.011790165],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995975,0.000037444952,0.000031365747,0.000090039066,0.00016994464,0.00007373802],"domain_scores_gemma":[0.99921584,0.00017576964,0.00006795045,0.000079496545,0.0004074819,0.000053503543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034899014,0.00093601836,0.00085136684,0.0029982536,0.0005519394,0.0012331794,0.0010367562,0.00074651075,0.006974398],"category_scores_gemma":[0.0009285874,0.00043821096,0.0010665639,0.0022510493,0.00038952605,0.0008508867,0.00076908624,0.0007394725,0.0050044754],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004669817,0.00008376746,0.00087294605,0.00020852276,0.000038777715,0.00014777723,0.00011433396,0.0039189756,0.33443,0.0007950288,0.0038716285,0.6550513],"study_design_scores_gemma":[0.000050782466,0.0003117735,0.017387265,0.00008819583,0.00015442052,0.0008497187,0.00034607013,0.6129077,0.34812212,0.0026056683,0.01708317,0.000093047885],"about_ca_topic_score_codex":0.0034344625,"about_ca_topic_score_gemma":0.004480053,"teacher_disagreement_score":0.006974398,"about_ca_system_score_codex":0.000415871,"about_ca_system_score_gemma":0.0008220393,"threshold_uncertainty_score":0.023331702},"labels":[],"label_agreement":null},{"id":"W2245233763","doi":"10.1007/978-3-642-21563-6","title":"Transactions on Rough Sets XIV","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.025461559843558766,"score_gpt":0.24336895563469632,"score_spread":0.21790739579113755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245233763","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074265394,0.20145051,0.54999375,0.0072844466,0.02442159,0.00014908178,0.0013284992,0.0010025551,0.20694292],"genre_scores_gemma":[0.18324734,0.1790798,0.30756935,0.0016542856,0.012143166,0.000563978,0.002983389,0.00080845226,0.31195024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984255,0.0003207554,0.00016476483,0.0001337425,0.00089613954,0.000059220783],"domain_scores_gemma":[0.99879515,0.00046473756,0.00007628345,0.00035231287,0.0002734242,0.000038062783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012624731,0.0010905644,0.002954166,0.0017585277,0.00062107696,0.0033148308,0.000806376,0.000894058,0.017123012],"category_scores_gemma":[0.0034304452,0.0006051458,0.0013511499,0.0033691286,0.0011667935,0.0022028058,0.001225721,0.002134749,0.0074411915],"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.000065298824,0.000036464848,0.00029689522,0.0010082325,0.00018495962,0.00015083069,0.00027334972,0.009599737,0.0015572808,0.41225663,0.10960196,0.46496832],"study_design_scores_gemma":[0.000027454791,0.000064642954,0.0009922351,0.0004920519,0.0001238804,0.00035633906,0.0001492309,0.020653054,0.00089130027,0.5242261,0.45198333,0.000040354273],"about_ca_topic_score_codex":0.0009872124,"about_ca_topic_score_gemma":0.0007824468,"teacher_disagreement_score":0.017123012,"about_ca_system_score_codex":0.0009965065,"about_ca_system_score_gemma":0.0008576359,"threshold_uncertainty_score":0.05728221},"labels":[],"label_agreement":null},{"id":"W2245295779","doi":"10.1007/978-3-319-20801-5_7","title":"Structural Similarity Optimized Wiener Filter: A Way to Fight Image Noise","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Western University","funders":"","keywords":"Wiener filter; Similarity (geometry); Structural similarity; Image (mathematics); Filter (signal processing); Noise (video); Computer science; Computer vision; Artificial intelligence; Mathematics; Algorithm","score_opus":0.034056958939078945,"score_gpt":0.28914718664308703,"score_spread":0.2550902277040081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245295779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049036033,0.0002971376,0.9930253,0.000055966277,0.000060230534,0.000009537883,0.000017043863,0.00023655807,0.0013946482],"genre_scores_gemma":[0.13660984,0.0013037438,0.8380138,0.0002166752,0.00018981204,0.000057779638,0.00016714758,0.0003743926,0.023066783],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999729,0.000036773374,0.0000142969475,0.000058553844,0.00013866418,0.000022711098],"domain_scores_gemma":[0.999713,0.00007553111,0.000031512696,0.00005792939,0.000098563105,0.000023536264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039473834,0.000584353,0.0007270142,0.00054630515,0.0002652356,0.000862706,0.00064308284,0.0011585541,0.002842761],"category_scores_gemma":[0.000926934,0.00034370084,0.00067589537,0.00061523257,0.0004625385,0.0011028869,0.0008497074,0.0009708386,0.001589838],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032789828,0.00017690977,0.00060279533,0.0002829211,0.00016361385,0.00014365213,0.00014429264,0.047837764,0.2812567,0.10706088,0.006428419,0.5555741],"study_design_scores_gemma":[0.00003674155,0.00022809401,0.00077164086,0.00003210473,0.00013160579,0.0005761285,0.000043963395,0.8293099,0.10981571,0.041508097,0.01749675,0.000049242302],"about_ca_topic_score_codex":0.00046050185,"about_ca_topic_score_gemma":0.0008845192,"teacher_disagreement_score":0.002842761,"about_ca_system_score_codex":0.00024978968,"about_ca_system_score_gemma":0.00045261218,"threshold_uncertainty_score":0.009509981},"labels":[],"label_agreement":null},{"id":"W2245527669","doi":"10.1007/978-3-319-19662-6_14","title":"Rendezvous of Many Agents with Different Speeds in a Cycle","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Rendezvous; Generalization; Combinatorics; Domain (mathematical analysis); Mathematics; Computer science; Discrete mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.03558802351668162,"score_gpt":0.27119062136414945,"score_spread":0.23560259784746784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245527669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43654165,0.001273772,0.46396,0.0007507862,0.00059941807,0.00035549587,0.00029868825,0.0019656187,0.09425463],"genre_scores_gemma":[0.8580254,0.00044765553,0.09770635,0.00011925447,0.00007064225,0.00022983109,0.00028500697,0.00034366696,0.04277213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994375,0.00008994203,0.000026627513,0.00017717907,0.00014311365,0.00012563218],"domain_scores_gemma":[0.99913967,0.00022367382,0.00006931716,0.00031561448,0.000105383326,0.00014627677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050804485,0.0007379885,0.0009184854,0.0008644892,0.0018586232,0.0014094635,0.0020100838,0.001331223,0.011030967],"category_scores_gemma":[0.0027376371,0.00065564323,0.00081006426,0.00081767444,0.0013382521,0.0025416648,0.0031587789,0.0010648181,0.0019746546],"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.002663201,0.00026877577,0.003318851,0.00053785695,0.00047347732,0.001378472,0.0017248748,0.23681028,0.05497944,0.47348464,0.008582156,0.21577802],"study_design_scores_gemma":[0.00043869813,0.0006752221,0.0014820995,0.00014548948,0.00021726402,0.0010963271,0.0012762436,0.5671646,0.034671336,0.3160198,0.0766195,0.00019352668],"about_ca_topic_score_codex":0.0019396704,"about_ca_topic_score_gemma":0.0020705163,"teacher_disagreement_score":0.011030967,"about_ca_system_score_codex":0.0005690031,"about_ca_system_score_gemma":0.00062843144,"threshold_uncertainty_score":0.03690225},"labels":[],"label_agreement":null},{"id":"W2245738338","doi":"10.1007/978-3-642-25975-3_27","title":"Multi-Agent System for Semantic Web Service Composition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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 Calgary","funders":"","keywords":"Computer science; Web service; Semantic Web; Data Web; Social Semantic Web; Semantic Web Stack; Web modeling; World Wide Web; Flexibility (engineering); Composition (language); Database; Software engineering","score_opus":0.021871448353758406,"score_gpt":0.23697563476390895,"score_spread":0.21510418641015056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245738338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01074903,0.00044877795,0.96883607,0.00021433196,0.00022463252,0.00019313909,0.0000927251,0.00715349,0.012087776],"genre_scores_gemma":[0.18455265,0.0004433668,0.79252636,0.00015106102,0.00009439013,0.00037383146,0.0005839098,0.0005169278,0.020757599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995116,0.0001125776,0.000053939963,0.00008870106,0.00018506541,0.000048106504],"domain_scores_gemma":[0.99975497,0.000066539236,0.0000152542625,0.00005564622,0.000070238166,0.00003743164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723379,0.00047299036,0.0008495828,0.00078667095,0.0013076682,0.0017732937,0.0014434039,0.0012387702,0.004891562],"category_scores_gemma":[0.0009736383,0.00035501734,0.0006152258,0.0006402474,0.000439222,0.0013840635,0.0018161408,0.001176529,0.0021352659],"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.0008112302,0.00069750455,0.0010615325,0.00053122075,0.00018428382,0.0017908453,0.0008939683,0.063826345,0.09368867,0.31456015,0.026144937,0.49580935],"study_design_scores_gemma":[0.00011893345,0.000115718576,0.00033426532,0.00006206576,0.0001125846,0.00060336926,0.00011158559,0.81006175,0.03443061,0.065248765,0.08874583,0.00005458012],"about_ca_topic_score_codex":0.0013469093,"about_ca_topic_score_gemma":0.0016905159,"teacher_disagreement_score":0.004891562,"about_ca_system_score_codex":0.00057822483,"about_ca_system_score_gemma":0.0011496865,"threshold_uncertainty_score":0.016363919},"labels":[],"label_agreement":null},{"id":"W2246123910","doi":"10.1007/978-3-319-20801-5_14","title":"Adaptive Weighted Neighbors Lossless Image Coding","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossless compression; Coding (social sciences); Computer science; Adaptive coding; Artificial intelligence; Computer vision; Mathematics; Data compression; Statistics","score_opus":0.030259303705598917,"score_gpt":0.2843909619216404,"score_spread":0.25413165821604145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246123910","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.010798078,0.0008708809,0.9762967,0.00012244124,0.00014115618,0.000027488773,0.000076252625,0.00033550386,0.011331483],"genre_scores_gemma":[0.2900679,0.0027945738,0.64465445,0.0002531959,0.00016808709,0.00009860675,0.00059456204,0.0003141547,0.061054476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998388,0.000017722814,0.000005684109,0.000025367546,0.00010088131,0.000011494071],"domain_scores_gemma":[0.99983585,0.000039465995,0.00001257275,0.000051933257,0.00005378838,0.000006499471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001728863,0.0004294047,0.00032625935,0.0004324348,0.00012526475,0.00048861036,0.00087636744,0.0004107534,0.003281997],"category_scores_gemma":[0.0005797073,0.00016897146,0.00018371886,0.00055649533,0.00034035748,0.0010065142,0.00059796934,0.0008379718,0.0010217023],"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.00018737739,0.00007922293,0.00016535744,0.0001419741,0.00002881816,0.00007997856,0.000056882614,0.07578651,0.07502938,0.07668887,0.009397815,0.7623579],"study_design_scores_gemma":[0.000013986847,0.000069051224,0.0003003278,0.00004471038,0.000021883523,0.0003751818,0.000025176158,0.9010171,0.053363565,0.026603442,0.018143624,0.000022043843],"about_ca_topic_score_codex":0.00081398763,"about_ca_topic_score_gemma":0.0015754108,"teacher_disagreement_score":0.003281997,"about_ca_system_score_codex":0.00027034897,"about_ca_system_score_gemma":0.00022569182,"threshold_uncertainty_score":0.010979414},"labels":[],"label_agreement":null},{"id":"W2247311619","doi":"10.1007/978-3-642-35725-1_12","title":"Knowing Who You Are and Who You Know: Harnessing Social Networks to Identify People via Mobile Devices","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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 Ottawa","funders":"","keywords":"Computer science; Upload; Mobile phone; Social network (sociolinguistics); Face (sociological concept); World Wide Web; Probabilistic logic; Mobile social network; Mobile device; Multimedia; Data science; Human–computer interaction; Social media; Mobile computing; Artificial intelligence; Telecommunications","score_opus":0.013363311055038244,"score_gpt":0.26221603294703866,"score_spread":0.24885272189200042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2247311619","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.7105367,0.009551664,0.2041203,0.004409698,0.0006042499,0.00013516986,0.0012220882,0.000731201,0.06868896],"genre_scores_gemma":[0.94043916,0.0031275016,0.04308545,0.00034501514,0.00021987772,0.00006165609,0.00036663783,0.000051598094,0.012303085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998111,0.00005959705,0.000006534681,0.00004822125,0.000053193224,0.000021376592],"domain_scores_gemma":[0.999169,0.0006500981,0.00007474612,0.000038840106,0.00003793007,0.000029427662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035892715,0.0003801952,0.00022312453,0.0005993056,0.000328141,0.0011830718,0.0003031736,0.0005512872,0.0020368292],"category_scores_gemma":[0.00208435,0.0001757295,0.00017184661,0.00057235156,0.0002809943,0.002149305,0.0009133079,0.0005656117,0.0009123399],"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.00020331948,0.00022728786,0.026705518,0.00035273787,0.00012673187,0.00026025725,0.00610202,0.004211697,0.025562918,0.010564758,0.011243911,0.9144389],"study_design_scores_gemma":[0.00005940632,0.0008942823,0.16164628,0.00086213293,0.00057520956,0.002462743,0.029309686,0.30422947,0.050098643,0.27299598,0.17653567,0.00033053342],"about_ca_topic_score_codex":0.00072826206,"about_ca_topic_score_gemma":0.0020922578,"teacher_disagreement_score":0.0020368292,"about_ca_system_score_codex":0.00014063237,"about_ca_system_score_gemma":0.00015258709,"threshold_uncertainty_score":0.006813884},"labels":[],"label_agreement":null},{"id":"W2247396692","doi":"10.1007/978-3-319-22729-0_5","title":"Balancing Tree Size and Accuracy in Fast Mining of Uncertain Frequent Patterns","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Upper and lower bounds; Tree (set theory); Data mining; Space (punctuation); False positive paradox; Algorithm; Machine learning; Mathematics","score_opus":0.028343758306821735,"score_gpt":0.2752348080388703,"score_spread":0.24689104973204856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2247396692","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.29256946,0.0072656632,0.6896189,0.0024311615,0.00050339656,0.00025861926,0.00082676276,0.002450533,0.0040755393],"genre_scores_gemma":[0.6832435,0.0013290683,0.31180933,0.00029035393,0.00059641275,0.00015654578,0.0007687859,0.00034105004,0.0014648257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489504,0.0016336726,0.0005429937,0.0007789959,0.0017422267,0.00040708066],"domain_scores_gemma":[0.9200817,0.06829311,0.0019323238,0.004438658,0.0043214294,0.00093280006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007618347,0.00087633193,0.0018922024,0.002361062,0.0009357121,0.002542297,0.0028852194,0.0021240776,0.0015353272],"category_scores_gemma":[0.05953172,0.000893035,0.00077867456,0.0031281447,0.0008840026,0.0075420174,0.0020927556,0.0014459216,0.0007372922],"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.00316454,0.00040016507,0.01953134,0.0005347232,0.0002608461,0.0003109143,0.0007342036,0.18563657,0.018773068,0.015736237,0.010156656,0.7447608],"study_design_scores_gemma":[0.00014815106,0.00033383237,0.0025033418,0.000061442086,0.00012230793,0.0003949565,0.00020266348,0.95597905,0.004735096,0.03402525,0.0014580997,0.00003577878],"about_ca_topic_score_codex":0.00179423,"about_ca_topic_score_gemma":0.0028228275,"teacher_disagreement_score":0.007618347,"about_ca_system_score_codex":0.0009275618,"about_ca_system_score_gemma":0.0014368896,"threshold_uncertainty_score":0.040290177},"labels":[],"label_agreement":null},{"id":"W2247445003","doi":"10.1007/978-3-642-33555-6_1","title":"Spatio-temporal Regularization for Longitudinal Registration to an Unbiased 3D Individual Template","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Segmentation; Regularization (linguistics); Artificial intelligence; Pattern recognition (psychology); Noise (video)","score_opus":0.04918628857076704,"score_gpt":0.3082087489117299,"score_spread":0.2590224603409629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2247445003","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.0026926685,0.00014710834,0.99637645,0.00008061747,0.000017829661,0.000012692195,0.000045879373,0.00021277685,0.00041408878],"genre_scores_gemma":[0.11344329,0.00060356915,0.8762811,0.00018130886,0.00007232162,0.00024218323,0.0006677204,0.00075237197,0.0077562113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943167,0.00014575115,0.000035322242,0.0001466109,0.00018834244,0.00005228011],"domain_scores_gemma":[0.9991196,0.0003039058,0.00011687987,0.00024919916,0.00016847836,0.000041881864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020648332,0.0006395665,0.00073442137,0.0006463123,0.00058444653,0.0009741033,0.0015420347,0.0014584777,0.0022176923],"category_scores_gemma":[0.004044058,0.00081994967,0.0011440107,0.0010299472,0.00077233836,0.000965973,0.0018997977,0.0015633233,0.0014249472],"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.0003307045,0.00016589498,0.0025061856,0.00043642134,0.0003059246,0.00024104475,0.000524859,0.312927,0.120044276,0.113447405,0.013468836,0.4356014],"study_design_scores_gemma":[0.000009794523,0.00005118297,0.0011548036,0.00003067365,0.000047041474,0.00033287916,0.000043844546,0.9524397,0.018067857,0.017672155,0.010116346,0.000033709235],"about_ca_topic_score_codex":0.0057612024,"about_ca_topic_score_gemma":0.012438151,"teacher_disagreement_score":0.0057612024,"about_ca_system_score_codex":0.0010081024,"about_ca_system_score_gemma":0.0020392556,"threshold_uncertainty_score":0.011455357},"labels":[],"label_agreement":null},{"id":"W2248300774","doi":"10.1007/978-3-642-33284-5_12","title":"Using Collective Trust for Group Formation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Computer science; Task (project management); Group (periodic table); Heuristic; Human–computer interaction; Artificial intelligence; Management","score_opus":0.04922797823136423,"score_gpt":0.31045443065056766,"score_spread":0.26122645241920345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248300774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684471,0.0016753813,0.79797935,0.002914254,0.00048621697,0.00009091151,0.00010244711,0.00036290498,0.15954389],"genre_scores_gemma":[0.851312,0.0008824676,0.103809744,0.00016393994,0.00020538295,0.00014224928,0.00009135961,0.00012417288,0.043268636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987633,0.0005986353,0.00006506591,0.00017231588,0.00030029906,0.00010040462],"domain_scores_gemma":[0.99569464,0.0023825986,0.0002766984,0.0012176402,0.0002867388,0.00014171119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017526678,0.00042934003,0.00045797118,0.0005431463,0.0011624836,0.0031949389,0.0009747206,0.0014523497,0.011283052],"category_scores_gemma":[0.009341321,0.0003661762,0.0007318168,0.00076882687,0.00259353,0.007110311,0.0025419367,0.0019760947,0.0017317192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003362786,0.00003874794,0.00053281704,0.000119124175,0.000044840846,0.00013193896,0.0016229186,0.0059994822,0.0013684271,0.908759,0.004638455,0.0767106],"study_design_scores_gemma":[0.000012538891,0.000045478402,0.00042871243,0.000057320045,0.000029500263,0.00020471324,0.00049255264,0.045934122,0.0014566627,0.9311101,0.020202499,0.000025768844],"about_ca_topic_score_codex":0.00095911336,"about_ca_topic_score_gemma":0.0011610516,"teacher_disagreement_score":0.011283052,"about_ca_system_score_codex":0.00090843684,"about_ca_system_score_gemma":0.0005602703,"threshold_uncertainty_score":0.037745535},"labels":[],"label_agreement":null},{"id":"W2248589095","doi":"10.1007/978-3-662-48221-6_18","title":"Models and Algorithms for Genome Rearrangement with Positional Constraints","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Weighting; Generalization; Set (abstract data type); Binary number; Algorithm; Function (biology); Representation (politics); Combinatorics; Genome; Time complexity; Mathematics; Biology; Arithmetic","score_opus":0.030940958249045095,"score_gpt":0.2589133075014396,"score_spread":0.2279723492523945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248589095","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.0034595046,0.00076847966,0.99037874,0.00041930188,0.000064274405,0.00003051257,0.00023230023,0.00058689684,0.0040599145],"genre_scores_gemma":[0.12810878,0.0021959932,0.8535288,0.00030534118,0.00022907488,0.0005353197,0.0020386989,0.00068933866,0.0123686185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916136,0.0003305205,0.00004712381,0.00019120832,0.00020165871,0.000068055175],"domain_scores_gemma":[0.99697316,0.002359656,0.00013223753,0.0003075424,0.00016289756,0.0000644516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452672,0.0014437223,0.0016365765,0.0013034497,0.0009991889,0.002683071,0.004525005,0.0030725452,0.009169238],"category_scores_gemma":[0.008589935,0.0015644975,0.0024155946,0.002809906,0.0017334766,0.005450678,0.002457031,0.0034822659,0.0024430673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078568235,0.0000397596,0.00024299585,0.00016448855,0.00004471938,0.00005335666,0.00010150656,0.58929026,0.00038610102,0.33635297,0.0068937,0.066351585],"study_design_scores_gemma":[0.000019059547,0.000006586979,0.00002428277,0.000016589744,0.000009161456,0.000021110298,0.000014045201,0.62598425,0.00015835156,0.37121156,0.0025271047,0.0000078567045],"about_ca_topic_score_codex":0.004454102,"about_ca_topic_score_gemma":0.004487658,"teacher_disagreement_score":0.009169238,"about_ca_system_score_codex":0.0016534132,"about_ca_system_score_gemma":0.0011265777,"threshold_uncertainty_score":0.03067422},"labels":[],"label_agreement":null},{"id":"W224927278","doi":"10.1007/978-3-642-38844-6_18","title":"Comparing and Combining Eye Gaze and Interface Actions for Determining User Learning with an Interactive Simulation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"University of British Columbia","funders":"","keywords":"Computer science; Gaze; Human–computer interaction; Java applet; User interface; Eye tracking; Interface (matter); Machine learning; Artificial intelligence; Classifier (UML); Java; Programming language","score_opus":0.04010015664911529,"score_gpt":0.29838579849017743,"score_spread":0.2582856418410622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W224927278","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.91628087,0.0005706493,0.07902741,0.000043912503,0.000021970904,0.000115331175,0.00028788298,0.00084939005,0.0028026788],"genre_scores_gemma":[0.96606356,0.00027918268,0.032670237,0.000016772334,0.0000075562784,0.000059413658,0.00019023976,0.000074816366,0.00063827226],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991535,0.00037516214,0.00005531305,0.0001511012,0.00020801833,0.0000570656],"domain_scores_gemma":[0.9961719,0.0028306367,0.0001781425,0.00017001167,0.00051072304,0.00013855557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008883376,0.0005508534,0.00048785246,0.0015308617,0.00026803857,0.00061374,0.00036433345,0.0006798701,0.0016120416],"category_scores_gemma":[0.00733407,0.00026487725,0.000324417,0.00054528,0.0001993796,0.00072644843,0.00076968747,0.0002995261,0.0003819422],"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.0037876223,0.00042755157,0.12320063,0.00067840685,0.00034334292,0.00015958877,0.0018781365,0.0076027396,0.38215977,0.0003245415,0.0009231846,0.47851443],"study_design_scores_gemma":[0.0001428368,0.0033886877,0.64326245,0.00014342839,0.00078631076,0.0011845817,0.0015916395,0.18597151,0.16091655,0.0008399621,0.0015838104,0.00018828564],"about_ca_topic_score_codex":0.0035420507,"about_ca_topic_score_gemma":0.005785126,"teacher_disagreement_score":0.0035420507,"about_ca_system_score_codex":0.00020805879,"about_ca_system_score_gemma":0.00027379737,"threshold_uncertainty_score":0.007042885},"labels":[],"label_agreement":null},{"id":"W2251131053","doi":"10.1007/978-3-319-22804-4_23","title":"Adaptive Atlas of Connectivity Maps","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Atlas (anatomy); Cartography; Geography; Computer science; Geology; Paleontology","score_opus":0.02026085975850502,"score_gpt":0.24863008444857174,"score_spread":0.2283692246900667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251131053","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.04122298,0.0009406406,0.8924517,0.00039036723,0.00022707671,0.0000703255,0.0005366237,0.00086254015,0.063297816],"genre_scores_gemma":[0.700941,0.0026910906,0.2296054,0.00023620822,0.0005103645,0.00026328623,0.0014875815,0.0007306111,0.06353446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998211,0.000043388696,0.0000064461224,0.000054481075,0.000055869623,0.000018672532],"domain_scores_gemma":[0.9994791,0.00019626692,0.00004779194,0.00010016086,0.00009709017,0.00007960125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023135419,0.00047186995,0.00048523516,0.0011926232,0.00041176548,0.0013243115,0.0009267057,0.000538337,0.0069111846],"category_scores_gemma":[0.0016978395,0.00035150562,0.0003663595,0.00080383575,0.00078978395,0.0010896563,0.0018753107,0.001177478,0.0015049586],"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.000085038795,0.000019904346,0.00049429666,0.00015318986,0.000025103736,0.00012195332,0.00023950396,0.07500466,0.009980593,0.8032477,0.011251411,0.099376656],"study_design_scores_gemma":[0.00001950679,0.00006505817,0.00077231455,0.000039220115,0.000018821589,0.00038812327,0.000103188446,0.3346531,0.0036134897,0.6151355,0.045163058,0.000028511262],"about_ca_topic_score_codex":0.00093400455,"about_ca_topic_score_gemma":0.0008071578,"teacher_disagreement_score":0.0069111846,"about_ca_system_score_codex":0.0006000169,"about_ca_system_score_gemma":0.00031036243,"threshold_uncertainty_score":0.023120224},"labels":[],"label_agreement":null},{"id":"W2251728956","doi":"10.1007/978-3-642-32627-1_2","title":"Metrics for Measuring the Performance of the Mixed Workload CH-benCHmark","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Workload; Volume (thermodynamics); Metric (unit); Transaction processing; Database; Database transaction; Transaction data; Data mining; Distributed computing; Operating system","score_opus":0.02573232686720677,"score_gpt":0.23397248491671546,"score_spread":0.20824015804950868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251728956","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.6975305,0.012301798,0.1939331,0.00079790864,0.001040415,0.0014220069,0.034501012,0.022186136,0.036287155],"genre_scores_gemma":[0.8411573,0.0011277874,0.11555705,0.00023544265,0.00022792524,0.0009809455,0.033639774,0.0015291433,0.005544608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99091876,0.0015627034,0.0011448738,0.0010305736,0.004741719,0.0006013519],"domain_scores_gemma":[0.98296607,0.0060113496,0.0018027119,0.0029607357,0.0053368234,0.0009224129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003232635,0.0024746174,0.0009689323,0.0063562626,0.00072105095,0.0019958415,0.00257744,0.0011437568,0.0035776277],"category_scores_gemma":[0.014905187,0.00044079596,0.00056893425,0.007868085,0.00060591166,0.0022548083,0.0011572058,0.0012518502,0.0014615601],"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.0055853906,0.0024896448,0.07680732,0.003712676,0.0010728154,0.00035607014,0.00066139764,0.14695776,0.1544229,0.019049933,0.104468614,0.48441553],"study_design_scores_gemma":[0.0003957294,0.0062879627,0.08566003,0.00032406207,0.00043880608,0.0013268689,0.0007146891,0.66633993,0.18838137,0.013628372,0.036086734,0.00041548174],"about_ca_topic_score_codex":0.003304856,"about_ca_topic_score_gemma":0.0037674427,"teacher_disagreement_score":0.0063562626,"about_ca_system_score_codex":0.0012817406,"about_ca_system_score_gemma":0.0012511077,"threshold_uncertainty_score":0.017095983},"labels":[],"label_agreement":null},{"id":"W2251762750","doi":"10.1007/978-3-319-23727-5_28","title":"The Layered Architecture Recovery as a Quadratic Assignment Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Heuristic; Architecture; Software architecture; Set (abstract data type); Software; Process (computing); Reference architecture; Software system; Distributed computing; Software engineering; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.02207220847512984,"score_gpt":0.2611705950751626,"score_spread":0.23909838660003277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251762750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015315763,0.00030448558,0.97298765,0.0008704262,0.00009761195,0.000051982213,0.000106544474,0.00037858842,0.00988685],"genre_scores_gemma":[0.35279536,0.0009896508,0.6005718,0.0003986333,0.00029618823,0.0002732661,0.00069561874,0.00074076693,0.04323869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989716,0.00031176815,0.00004632862,0.00022806355,0.0002638423,0.0001784339],"domain_scores_gemma":[0.9981604,0.0010296326,0.00011157754,0.00036424378,0.00021202066,0.00012201802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013317626,0.000878347,0.0011655915,0.000602566,0.0008424268,0.0023339533,0.002961988,0.0021474508,0.0144744925],"category_scores_gemma":[0.006558543,0.00086592534,0.0012061261,0.0013204128,0.0015270232,0.0046886313,0.0034790756,0.004097753,0.0017242425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027766143,0.00016572207,0.0004336733,0.0004482639,0.000071177514,0.00020694992,0.00025352972,0.34615844,0.003994136,0.43067643,0.025499282,0.19181469],"study_design_scores_gemma":[0.000036390495,0.000042265277,0.00013298859,0.000035874727,0.000019341487,0.000093252456,0.00007701716,0.64411104,0.00095607154,0.35022393,0.0042540603,0.000017783852],"about_ca_topic_score_codex":0.0026284468,"about_ca_topic_score_gemma":0.0023294794,"teacher_disagreement_score":0.0144744925,"about_ca_system_score_codex":0.0011173759,"about_ca_system_score_gemma":0.0013170782,"threshold_uncertainty_score":0.04842198},"labels":[],"label_agreement":null},{"id":"W2252545675","doi":"10.1007/978-3-319-25252-0_18","title":"Ontology-Based Topic Labeling and Quality Prediction","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"York University","funders":"","keywords":"Computer science; Latent Dirichlet allocation; Topic model; Reliability (semiconductor); Probabilistic logic; Ontology; Coherence (philosophical gambling strategy); Quality (philosophy); Artificial intelligence; Information retrieval; Natural language processing; Semantics (computer science); Machine learning; Data mining","score_opus":0.0454640940380162,"score_gpt":0.31517178953091995,"score_spread":0.26970769549290374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252545675","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.043418653,0.0031246326,0.92805415,0.0006504987,0.0003480347,0.00041182875,0.0071149617,0.008203916,0.008673312],"genre_scores_gemma":[0.29016024,0.0020346693,0.67648613,0.000138092,0.00035242853,0.00043163693,0.020762416,0.001153326,0.008481096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969625,0.0004640749,0.00027009987,0.00072423345,0.0013169841,0.0002621508],"domain_scores_gemma":[0.99369276,0.002568817,0.0004890771,0.0007708321,0.002213885,0.00026470507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026688285,0.0010772331,0.0011443812,0.0078649735,0.0011903311,0.003012697,0.0018687361,0.001287579,0.0046787793],"category_scores_gemma":[0.011193294,0.00054934743,0.0017898167,0.007539602,0.0005827153,0.0048845364,0.0021039986,0.0017584714,0.00344136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005502708,0.0003872318,0.013971468,0.00089236966,0.00021865059,0.00022115816,0.00076690246,0.017948804,0.030087305,0.013892931,0.03521571,0.8858472],"study_design_scores_gemma":[0.00010979729,0.0001598788,0.018810201,0.00022491782,0.00048309017,0.0005512571,0.0007067506,0.8432064,0.03183243,0.051619284,0.052149218,0.00014676734],"about_ca_topic_score_codex":0.011201128,"about_ca_topic_score_gemma":0.01596886,"teacher_disagreement_score":0.011201128,"about_ca_system_score_codex":0.0016841976,"about_ca_system_score_gemma":0.0026638475,"threshold_uncertainty_score":0.022271872},"labels":[],"label_agreement":null},{"id":"W2252701011","doi":"10.1007/978-3-642-42001-6_7","title":"Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discrete logarithm; Logarithm; Basis (linear algebra); Elliptic curve; Polynomial; Descent (aeronautics); Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.02964404166457602,"score_gpt":0.3045504317449756,"score_spread":0.2749063900803996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252701011","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.78756386,0.0024792808,0.14499442,0.00090908876,0.0002687888,0.00023010992,0.00034540723,0.0014088146,0.06180027],"genre_scores_gemma":[0.8512429,0.0012565455,0.13123631,0.000101178426,0.00009687227,0.00009092855,0.0005676123,0.0002602518,0.015147398],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927133,0.00021078669,0.00002318679,0.00009365519,0.0003172919,0.00008370477],"domain_scores_gemma":[0.99896085,0.0005354563,0.00005616684,0.00024672176,0.00013617112,0.000064631975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084009604,0.00066728616,0.0009716483,0.0006593884,0.00088369485,0.0013825005,0.0007781727,0.0008343995,0.006390355],"category_scores_gemma":[0.0027065638,0.00022843284,0.00029180318,0.001156387,0.0008070359,0.003421852,0.0010424163,0.0015962388,0.0011184488],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024381555,0.0040711523,0.0034897646,0.00085623184,0.00017342846,0.0002454753,0.000852045,0.053856336,0.15268913,0.26164886,0.014509526,0.5051699],"study_design_scores_gemma":[0.00071389717,0.0035005359,0.0040100464,0.00012940273,0.00008704557,0.0009932468,0.00085480855,0.57920474,0.25265852,0.1292532,0.028457256,0.00013731474],"about_ca_topic_score_codex":0.00049602933,"about_ca_topic_score_gemma":0.00046721447,"teacher_disagreement_score":0.006390355,"about_ca_system_score_codex":0.00039599775,"about_ca_system_score_gemma":0.0007333345,"threshold_uncertainty_score":0.021377921},"labels":[],"label_agreement":null},{"id":"W2253268310","doi":"10.1007/978-3-642-38496-7_4","title":"A Hardware Collective Intelligence Agent","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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","funders":"","keywords":"Computer science; Software deployment; Emulation; Collective intelligence; Scalability; Cloud computing; Distributed computing; Software; Flexibility (engineering); Implementation; Software engineering; Artificial intelligence; Operating system","score_opus":0.02623419244355958,"score_gpt":0.24942234379547554,"score_spread":0.22318815135191594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253268310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07153858,0.0014221714,0.69209516,0.002635277,0.0014995738,0.00046688603,0.00039662133,0.009322381,0.22062337],"genre_scores_gemma":[0.43484816,0.00066316436,0.42256007,0.00059839274,0.00025939927,0.00037409982,0.00061151036,0.0002879615,0.13979721],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998247,0.00002746695,0.000008967425,0.00003870647,0.00007056899,0.000029667288],"domain_scores_gemma":[0.9997216,0.000059446345,0.000019502517,0.000076856326,0.00006945318,0.00005307131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023862836,0.00041704395,0.0003662584,0.00037219623,0.0008685544,0.0014250347,0.0013469459,0.00092041533,0.015057459],"category_scores_gemma":[0.00061070145,0.0002701946,0.0002751293,0.00037309286,0.0005500653,0.001169073,0.0013370336,0.00082835415,0.003818651],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007179102,0.0005140706,0.0017079017,0.0006155193,0.0001526377,0.0005053927,0.00055082765,0.05559565,0.10169547,0.30069053,0.06567984,0.4715743],"study_design_scores_gemma":[0.00027140323,0.0006785062,0.0011022154,0.00010131588,0.00015861013,0.0005692533,0.00029803367,0.49579197,0.06425471,0.076848485,0.3598397,0.000085692365],"about_ca_topic_score_codex":0.0009087889,"about_ca_topic_score_gemma":0.0013589116,"teacher_disagreement_score":0.015057459,"about_ca_system_score_codex":0.00038479854,"about_ca_system_score_gemma":0.000735788,"threshold_uncertainty_score":0.050372183},"labels":[],"label_agreement":null},{"id":"W2253367123","doi":"10.1007/978-3-662-44303-3_7","title":"On Diversity, Teaming, and Hierarchical Policies: Observations from the Keepaway Soccer Task","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Artificial intelligence; Benchmark (surveying); Diversity (politics); Champion; Evolutionary robotics; Field (mathematics); Machine learning; Evolutionary computation; Robotics; Function (biology); Evolutionary algorithm; Fitness function; Robot","score_opus":0.021963336922866943,"score_gpt":0.23709755532950846,"score_spread":0.21513421840664151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253367123","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.9861536,0.0006801432,0.0035480082,0.00040290118,0.000026675818,0.000025792315,0.000496574,0.000039930776,0.008626336],"genre_scores_gemma":[0.99503976,0.00022719582,0.0013348036,0.000073064475,0.000015980762,0.000021800828,0.00091949926,0.000052928768,0.002314952],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99965215,0.00011745901,0.000017452912,0.00005863193,0.00007513111,0.00007930146],"domain_scores_gemma":[0.995876,0.0028874709,0.0003319282,0.00027741707,0.00028409445,0.0003431467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081045565,0.00032229756,0.0005253006,0.0004389581,0.0007495683,0.0009772237,0.0007972806,0.0009150434,0.003822791],"category_scores_gemma":[0.010548354,0.00029297732,0.00022307964,0.00088075065,0.00069325516,0.00096849806,0.0012385313,0.0011078359,0.000748997],"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.0070766225,0.0032412969,0.26859155,0.0015044643,0.00051914586,0.0022600584,0.030346246,0.18924266,0.032517746,0.020095857,0.08277402,0.36183035],"study_design_scores_gemma":[0.00044407276,0.0017723971,0.6319802,0.00038719564,0.00012678276,0.0013115028,0.02414128,0.21145046,0.005361472,0.08455348,0.03817348,0.00029764883],"about_ca_topic_score_codex":0.011922749,"about_ca_topic_score_gemma":0.016414091,"teacher_disagreement_score":0.011922749,"about_ca_system_score_codex":0.0002982785,"about_ca_system_score_gemma":0.00032783425,"threshold_uncertainty_score":0.023706675},"labels":[],"label_agreement":null},{"id":"W2253474860","doi":"10.1007/978-3-319-20892-3_21","title":"Accessing InterACTion: Ageing with Technologies and the Place of Access","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"","keywords":"Situated; Computer science; Context (archaeology); Digital divide; World Wide Web; Internet privacy; Information and Communications Technology; Artificial intelligence; Geography","score_opus":0.03953615254594214,"score_gpt":0.3180118666613272,"score_spread":0.2784757141153851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253474860","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.46497282,0.1249857,0.008737648,0.010569366,0.001075223,0.00005631023,0.00042141165,0.00014106499,0.38904056],"genre_scores_gemma":[0.93653077,0.026858294,0.0016906873,0.0006636871,0.00029210633,0.0000419572,0.00010719818,0.000038565773,0.03377675],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99953437,0.00017317686,0.000039185234,0.000057849647,0.00010284146,0.00009263303],"domain_scores_gemma":[0.9990097,0.0004750912,0.00015287373,0.000053393684,0.00012145226,0.00018738309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065495155,0.0003754638,0.0003912342,0.000880814,0.0012522056,0.006813966,0.0006047546,0.0014530434,0.012030497],"category_scores_gemma":[0.002744886,0.00017539352,0.0003588825,0.0016184141,0.0023208526,0.006965817,0.0027040616,0.0012015365,0.0011110663],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027694713,0.00024583424,0.04007634,0.0011382479,0.00008336575,0.0026974375,0.35539564,0.0002041204,0.0037393072,0.12272713,0.019730056,0.45368555],"study_design_scores_gemma":[0.000032154025,0.0005460023,0.13835973,0.0023886424,0.00015720607,0.011364261,0.35104725,0.0005495641,0.0015559648,0.115760006,0.37810114,0.000138016],"about_ca_topic_score_codex":0.0032978863,"about_ca_topic_score_gemma":0.0040659783,"teacher_disagreement_score":0.012030497,"about_ca_system_score_codex":0.0006788611,"about_ca_system_score_gemma":0.0006716375,"threshold_uncertainty_score":0.04024607},"labels":[],"label_agreement":null},{"id":"W2253654199","doi":"10.1007/978-3-540-89020-1_11","title":"Programmed Graph Rewriting with DEVS","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"DEVS; Computer science; Graph rewriting; Modular design; Rewriting; Formalism (music); Theoretical computer science; Programming language; Distributed computing; Graph; Modeling and simulation; Simulation","score_opus":0.014339591771113295,"score_gpt":0.2213637160816807,"score_spread":0.2070241243105674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253654199","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.0064656343,0.00026026182,0.93076646,0.0002990634,0.00026323076,0.00007502405,0.00031733935,0.0048595127,0.05669349],"genre_scores_gemma":[0.25025877,0.0006865374,0.66426575,0.00039414203,0.00014751746,0.00019726472,0.0015089972,0.0050761295,0.07746487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00019279911,0.00003434353,0.00013903469,0.00022411333,0.00004870445],"domain_scores_gemma":[0.9993894,0.00022385993,0.000020795029,0.00025016093,0.00009415067,0.000021543052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124366,0.00048432758,0.00043052222,0.00056843634,0.00041894562,0.00096971914,0.0010532029,0.00039438327,0.012031496],"category_scores_gemma":[0.0016020103,0.00052231294,0.0008636856,0.00055248605,0.0009923308,0.001285382,0.0012992877,0.0017845045,0.0037571928],"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.00004378376,0.00004737599,0.00014830937,0.00026792043,0.000033244283,0.0002026509,0.00027281273,0.01579175,0.009901242,0.75053036,0.014856708,0.2079038],"study_design_scores_gemma":[0.0000309154,0.000041139843,0.00011455045,0.00006933883,0.00003988966,0.00029917402,0.000059189308,0.052693836,0.028091101,0.745009,0.17352024,0.00003153805],"about_ca_topic_score_codex":0.000853983,"about_ca_topic_score_gemma":0.0016643965,"teacher_disagreement_score":0.012031496,"about_ca_system_score_codex":0.00064207544,"about_ca_system_score_gemma":0.00048502933,"threshold_uncertainty_score":0.040249348},"labels":[],"label_agreement":null},{"id":"W2253782107","doi":"10.1007/978-3-662-43652-3_34","title":"Optimizing Alloy for Multi-objective Software Product Line Configuration","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Backtracking; Computer science; Integer (computer science); Software product line; Software; Reuse; Constraint satisfaction problem; Product (mathematics); Binary number; Computational science; Binary decision diagram; Algorithm; Theoretical computer science; Software development; Programming language; Mathematics; Artificial intelligence","score_opus":0.053984304059333264,"score_gpt":0.3041171251929969,"score_spread":0.25013282113366364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253782107","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.13522235,0.00074464845,0.83759636,0.00013121935,0.0000646192,0.00011591226,0.00014428003,0.0018936173,0.02408699],"genre_scores_gemma":[0.7715298,0.00020008445,0.22240876,0.000042556017,0.000013648965,0.00010599209,0.0001998514,0.00034655735,0.005152825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995815,0.00010902683,0.00001603218,0.000054846027,0.0001768472,0.000061714054],"domain_scores_gemma":[0.99964714,0.00016828558,0.00004294494,0.00004045639,0.00008500107,0.00001625253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051040726,0.0011410547,0.00087029114,0.0008707394,0.0004901962,0.00087782746,0.0011570585,0.0007234228,0.005017009],"category_scores_gemma":[0.0010908247,0.0005820925,0.00073395815,0.0008345366,0.0003896735,0.00064654055,0.0006349558,0.0006664387,0.00078828767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102534636,0.00006317053,0.00041002748,0.00011641788,0.0000306664,0.000075984295,0.000035955785,0.90786374,0.008637325,0.004068981,0.00083310046,0.07776205],"study_design_scores_gemma":[0.000011499342,0.000087181004,0.00017853733,0.000011914849,0.000015412123,0.000033235723,0.000018146296,0.9937802,0.0026694986,0.0024716507,0.0007165322,0.0000061610735],"about_ca_topic_score_codex":0.0027277584,"about_ca_topic_score_gemma":0.0037760052,"teacher_disagreement_score":0.005017009,"about_ca_system_score_codex":0.00088708027,"about_ca_system_score_gemma":0.0007972008,"threshold_uncertainty_score":0.016783595},"labels":[],"label_agreement":null},{"id":"W2255719842","doi":"10.1007/978-3-319-19773-9_31","title":"Exploring the Impact of a Learning Dashboard on Student Affect","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boredom; Dashboard; Affect (linguistics); Computer science; TUTOR; Intervention (counseling); Human–computer interaction; Multimedia; Cognitive psychology; Psychology; Data science; Social psychology","score_opus":0.07265436474543585,"score_gpt":0.33577309646765235,"score_spread":0.2631187317222165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255719842","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.99310726,0.000049632083,0.0015160986,0.0001473765,0.00008825088,0.000038085134,0.00014875326,0.00023317027,0.0046714623],"genre_scores_gemma":[0.99639916,0.00003846145,0.001402069,0.00006945486,0.000025087515,0.000056832636,0.00013435789,0.00005790953,0.001816624],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999084,0.00033813724,0.000042853426,0.00020421387,0.00023443109,0.000096366886],"domain_scores_gemma":[0.97691697,0.018912785,0.0009923738,0.0009747739,0.00076867756,0.001434558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015422513,0.0005182047,0.00038096236,0.0003295725,0.00038988862,0.0021286802,0.00058182655,0.0007116917,0.01018627],"category_scores_gemma":[0.022991424,0.00018982109,0.00027425613,0.0004264838,0.00030573842,0.0010686732,0.0009634198,0.0011574936,0.0013484984],"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.02160246,0.020667851,0.22445537,0.0016986454,0.00070547266,0.0007012668,0.01629028,0.017788313,0.12093875,0.0034316494,0.013894919,0.5578251],"study_design_scores_gemma":[0.0014583986,0.031584904,0.83547336,0.00033692794,0.0014820399,0.00022522264,0.011673895,0.059754636,0.03417617,0.0075456193,0.015966987,0.0003219045],"about_ca_topic_score_codex":0.0006944805,"about_ca_topic_score_gemma":0.000957433,"teacher_disagreement_score":0.01018627,"about_ca_system_score_codex":0.00021303457,"about_ca_system_score_gemma":0.00028203835,"threshold_uncertainty_score":0.03407651},"labels":[],"label_agreement":null},{"id":"W2255779533","doi":"10.1007/978-3-642-39884-1_9","title":"Unconditionally-Secure Robust Secret Sharing with Minimum Share Size","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Computer science; Secure multi-party computation; Cheating; Scheme (mathematics); Verifiable secret sharing; Shamir's Secret Sharing; Information-theoretic security; Homomorphic secret sharing; Robustness (evolution); Computer security; Set (abstract data type); Theoretical computer science; Cryptography; Mathematics","score_opus":0.01554854089249214,"score_gpt":0.21788748413896264,"score_spread":0.2023389432464705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255779533","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.025389545,0.00041381395,0.9640159,0.0005139924,0.00012160528,0.000099385165,0.00018167269,0.0010214525,0.008242637],"genre_scores_gemma":[0.851873,0.00051030354,0.13445161,0.00031341024,0.00023473053,0.00022214094,0.0002994023,0.0002870431,0.011808493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962282,0.0006030509,0.000246384,0.0005864957,0.0018840517,0.00045184584],"domain_scores_gemma":[0.99520135,0.0016700214,0.00045206829,0.002216853,0.0003495166,0.000110190245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016359175,0.0010337421,0.0015837875,0.0005799585,0.0007340291,0.0020103909,0.0023905025,0.0016711226,0.003661946],"category_scores_gemma":[0.005273126,0.0006666966,0.0012287152,0.0010567623,0.0019149755,0.0056586363,0.0050009983,0.003046023,0.0017310953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010265775,0.00015242992,0.0002341137,0.00045505908,0.00016619553,0.00033736572,0.0002825006,0.12003872,0.096758015,0.643846,0.0050427984,0.1316602],"study_design_scores_gemma":[0.000117509626,0.00040289038,0.00022680749,0.000054127653,0.000082723614,0.0005821469,0.00004413959,0.37334943,0.056060337,0.56267816,0.006305693,0.0000960475],"about_ca_topic_score_codex":0.00017533616,"about_ca_topic_score_gemma":0.00014298882,"teacher_disagreement_score":0.003661946,"about_ca_system_score_codex":0.0010385959,"about_ca_system_score_gemma":0.0011080761,"threshold_uncertainty_score":0.012250483},"labels":[],"label_agreement":null},{"id":"W2255980159","doi":"10.1007/978-3-642-33454-2_12","title":"Self-similarity Weighted Mutual Information: A New Nonrigid Image Registration Metric","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual information; Image registration; Similarity measure; Similarity (geometry); Artificial intelligence; Stochastic gradient descent; Computer science; Metric (unit); Gradient descent; Pattern recognition (psychology); Image (mathematics); Mathematics; Computer vision; Artificial neural network","score_opus":0.012906255453948141,"score_gpt":0.2776315261798159,"score_spread":0.26472527072586777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255980159","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.0065582334,0.0006185838,0.99117893,0.00009418272,0.00006936589,0.00004093903,0.000076461576,0.0002857205,0.0010776072],"genre_scores_gemma":[0.22861756,0.0013764835,0.7636452,0.00021589726,0.0002826674,0.0002741843,0.000657942,0.00064967107,0.0042803916],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964986,0.00095072715,0.00023866986,0.00044224918,0.0017783497,0.00009145412],"domain_scores_gemma":[0.9978131,0.0006862306,0.00038411576,0.00042067785,0.00058809214,0.00010779611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021472515,0.00086168566,0.0014233862,0.0028086342,0.00046852857,0.0016270524,0.0017601657,0.0013976356,0.0013072229],"category_scores_gemma":[0.006246807,0.0004803226,0.00095307536,0.002527268,0.0010009024,0.0032506692,0.0027222536,0.0010284813,0.0006825536],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053643534,0.00026802588,0.0024585624,0.0006037506,0.0004362253,0.0002573667,0.00026834584,0.14856754,0.09757559,0.07185383,0.007722098,0.6694523],"study_design_scores_gemma":[0.000021080008,0.00034372517,0.0023499164,0.000037485293,0.000111700996,0.00077313464,0.00005647628,0.93085074,0.030455096,0.023387458,0.011495518,0.00011776091],"about_ca_topic_score_codex":0.0006858197,"about_ca_topic_score_gemma":0.001148029,"teacher_disagreement_score":0.0028086342,"about_ca_system_score_codex":0.00071979023,"about_ca_system_score_gemma":0.0009508604,"threshold_uncertainty_score":0.0113559365},"labels":[],"label_agreement":null},{"id":"W2256150759","doi":"10.1007/978-3-319-19773-9_75","title":"An Integrated Emotion-Aware Framework for Intelligent Tutoring Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Computer science; Conceptual framework; Intelligent tutoring system; Human–computer interaction; Cognitive science; Artificial intelligence; Knowledge management; Psychology; Sociology","score_opus":0.049491827483057846,"score_gpt":0.2974369623662415,"score_spread":0.24794513488318365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256150759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007784976,0.0003335345,0.97877455,0.00012553204,0.000070652466,0.00012993788,0.0001392093,0.009480276,0.0031613698],"genre_scores_gemma":[0.26300207,0.0004547049,0.7270112,0.00022249848,0.00008609018,0.00036780533,0.00068799115,0.00074568175,0.0074219443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955505,0.00010096489,0.0000401642,0.00011218048,0.00013347068,0.000058187976],"domain_scores_gemma":[0.9997559,0.00006574522,0.00001658534,0.000043207692,0.00007696965,0.000041561074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006649053,0.0006637464,0.00070908054,0.0003821243,0.000446951,0.0018018004,0.0020603498,0.0009166469,0.004305095],"category_scores_gemma":[0.0012287281,0.000308279,0.00074395345,0.00028959374,0.00033883128,0.0015695833,0.0019571148,0.0013235135,0.0017439058],"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.00090726675,0.0008299616,0.0016393694,0.0005976564,0.0002745859,0.0004920963,0.0013402601,0.11258583,0.10793455,0.06842269,0.025836395,0.6791393],"study_design_scores_gemma":[0.00005509405,0.000127307,0.0006712399,0.000049457816,0.00012518624,0.00015006139,0.00012346114,0.9052015,0.025107598,0.040967725,0.027367698,0.000053752035],"about_ca_topic_score_codex":0.001794903,"about_ca_topic_score_gemma":0.0025581403,"teacher_disagreement_score":0.004305095,"about_ca_system_score_codex":0.0004382028,"about_ca_system_score_gemma":0.00056932913,"threshold_uncertainty_score":0.014401972},"labels":[],"label_agreement":null},{"id":"W2256407299","doi":"10.1007/978-3-642-37453-1_35","title":"Decisive Supervised Learning","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.012242736938922033,"score_gpt":0.23956161183013688,"score_spread":0.22731887489121486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256407299","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.007317404,0.0066567133,0.7665142,0.004963306,0.0017125275,0.000096854135,0.0006210614,0.0016436359,0.21047424],"genre_scores_gemma":[0.391064,0.005986491,0.30958837,0.004040192,0.004535597,0.0005273752,0.0028428375,0.0027010946,0.27871403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982791,0.00052072445,0.00007057792,0.00043814367,0.000590869,0.00010058744],"domain_scores_gemma":[0.9971156,0.0015802572,0.00009898258,0.0007822251,0.0002997939,0.0001230942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017223228,0.0011219723,0.0010838355,0.001220393,0.0009929494,0.0020579668,0.0014548635,0.0013656607,0.02274707],"category_scores_gemma":[0.0075191446,0.00072158925,0.000938192,0.0009239044,0.003094232,0.0035103054,0.0035035652,0.004950113,0.007450435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006062783,0.000027358235,0.00023588448,0.00018075028,0.000037527643,0.000043657466,0.000085866326,0.0035619938,0.0010257192,0.8272741,0.035159487,0.13230707],"study_design_scores_gemma":[0.000010374868,0.0000137632505,0.0001287323,0.000035388657,0.0000097090215,0.000058035428,0.000010814031,0.016090082,0.00090138,0.9496165,0.03311478,0.000010432951],"about_ca_topic_score_codex":0.00029855417,"about_ca_topic_score_gemma":0.0004918813,"teacher_disagreement_score":0.02274707,"about_ca_system_score_codex":0.0010522186,"about_ca_system_score_gemma":0.0008861329,"threshold_uncertainty_score":0.076096535},"labels":[],"label_agreement":null},{"id":"W2256644097","doi":"10.1007/978-3-319-20801-5_3","title":"Improving Image Quality of Tiled Displays","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Imaging Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distortion (music); Grid; Computer vision; Artificial intelligence; Image quality; Computer graphics (images); Image (mathematics); Quality (philosophy); Telecommunications","score_opus":0.025143787631972885,"score_gpt":0.2801724270244502,"score_spread":0.25502863939247733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256644097","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.21775717,0.0146305375,0.702543,0.0005657382,0.0006448203,0.00006347648,0.0004344798,0.0037449042,0.05961593],"genre_scores_gemma":[0.7578991,0.008835523,0.19848141,0.00024476994,0.00023306157,0.00003745773,0.0005087725,0.00093828066,0.03282153],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979776,0.000020565765,0.0000068614004,0.000028621958,0.00011213701,0.000034058467],"domain_scores_gemma":[0.99956983,0.00016418123,0.00004667305,0.000077989,0.000120190765,0.000021019925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015363314,0.0005409139,0.00039349624,0.00032632222,0.00012638295,0.0011298163,0.000736123,0.00041315498,0.007214633],"category_scores_gemma":[0.0009965773,0.00027506793,0.00036113826,0.00067591143,0.0002814917,0.00095335284,0.0008990377,0.0008399824,0.001109223],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004000163,0.000052845044,0.0005502622,0.00060420466,0.00006597924,0.00023176515,0.0002034656,0.024825398,0.61505,0.014046778,0.005910437,0.33805877],"study_design_scores_gemma":[0.00005434226,0.0005689741,0.003017063,0.0002361682,0.00015985992,0.001222691,0.00013927628,0.24340117,0.6887737,0.011789192,0.05055235,0.00008520303],"about_ca_topic_score_codex":0.00034216524,"about_ca_topic_score_gemma":0.00037128967,"teacher_disagreement_score":0.007214633,"about_ca_system_score_codex":0.00033960567,"about_ca_system_score_gemma":0.00010182947,"threshold_uncertainty_score":0.024135351},"labels":[],"label_agreement":null},{"id":"W2257522153","doi":"10.1007/978-3-319-23374-1_22","title":"Quantifying the Significance of Semantic Landmarks in Familiar and Unfamiliar Environments","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Salience (neuroscience); Landmark; Computer science; Exploratory research; Cognitive psychology; Artificial intelligence; Psychology; Sociology","score_opus":0.029085441605976963,"score_gpt":0.2432273909679705,"score_spread":0.21414194936199354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257522153","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.92902786,0.00067792094,0.0622932,0.000082480634,0.000046776455,0.000028002709,0.0004907806,0.00031676216,0.007036196],"genre_scores_gemma":[0.9833634,0.00025915657,0.0151020605,0.000009103347,0.000011157345,0.000009395911,0.00050550624,0.00010560476,0.00063465815],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994286,0.00012798765,0.000027334212,0.00017018174,0.00015133216,0.00009461098],"domain_scores_gemma":[0.9969066,0.0019714101,0.00027514235,0.0003417338,0.00035385456,0.0001511971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070975965,0.000545095,0.0006198153,0.0016020422,0.00034839593,0.0020994183,0.0005541605,0.00075731205,0.0024538555],"category_scores_gemma":[0.009223321,0.00040131612,0.00034568252,0.0018896366,0.00078047195,0.0029642335,0.0015143357,0.0005285514,0.00052322034],"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.0039031666,0.0002615416,0.19479866,0.0007747367,0.0004315404,0.00046324622,0.0021605375,0.073038146,0.11677677,0.019743633,0.0030224754,0.5846256],"study_design_scores_gemma":[0.00010599222,0.0014252663,0.5179032,0.0001970738,0.00056495913,0.0012874703,0.006070923,0.30537263,0.05987996,0.101559184,0.0053256964,0.00030761142],"about_ca_topic_score_codex":0.0032532704,"about_ca_topic_score_gemma":0.00612812,"teacher_disagreement_score":0.0032532704,"about_ca_system_score_codex":0.0003287588,"about_ca_system_score_gemma":0.0004801098,"threshold_uncertainty_score":0.00820899},"labels":[],"label_agreement":null},{"id":"W2257625122","doi":"10.1007/978-3-319-24704-5_16","title":"Investigating and Computing Bipartitions with Algebraic Means","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Brock University","funders":"","keywords":"Binary relation; Disjoint sets; Algebraic number; Mathematical proof; Mathematics; Relation (database); Set (abstract data type); Dedekind cut; Algebraic structure; Algebra over a field; Discrete mathematics; Bipartite graph; Computer science; Pure mathematics; Graph","score_opus":0.030317516764445857,"score_gpt":0.24980518052539447,"score_spread":0.2194876637609486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257625122","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.061451275,0.0014229361,0.9110923,0.0007053395,0.00011728492,0.00008019002,0.00037876645,0.0008715098,0.023880428],"genre_scores_gemma":[0.41249943,0.0013414352,0.5789066,0.00018601307,0.00023308737,0.00010635358,0.0012014358,0.00039120356,0.005134556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969695,0.00082697824,0.00027646913,0.0007975842,0.00085142156,0.00027808503],"domain_scores_gemma":[0.99318224,0.0039322134,0.00050308625,0.0015752548,0.00055078237,0.00025639028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240156,0.0011269683,0.0016301629,0.004181803,0.0026073484,0.007618015,0.0027958814,0.0018574576,0.010425395],"category_scores_gemma":[0.014263598,0.0010986734,0.002863257,0.0054533463,0.005654431,0.01817793,0.006536437,0.0037792372,0.00179128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058867347,0.00002083482,0.0005494657,0.00021492837,0.000030432433,0.000039799594,0.0004167387,0.005425916,0.0010983835,0.956291,0.0015303403,0.034323264],"study_design_scores_gemma":[0.0000037062373,0.0000107309515,0.00009786828,0.000028092756,0.0000120998975,0.00003628916,0.00011290705,0.009627185,0.0006179051,0.9861407,0.0033015588,0.000011012482],"about_ca_topic_score_codex":0.0010610102,"about_ca_topic_score_gemma":0.0015166879,"teacher_disagreement_score":0.010425395,"about_ca_system_score_codex":0.0014288396,"about_ca_system_score_gemma":0.00084231194,"threshold_uncertainty_score":0.034876406},"labels":[],"label_agreement":null},{"id":"W2258956855","doi":"10.1007/978-3-642-22688-5_30","title":"Trace of Objects to Retrieve Prediction Patterns of Activities in Smart Homes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université du Québec à Chicoutimi","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Tracing; Realization (probability); Home automation; Smart environment; Human–computer interaction; Activities of daily living; Artificial intelligence; Data science; Computer security; Telecommunications; Internet of Things; Psychology; Programming language","score_opus":0.026092604880343526,"score_gpt":0.23683380467225917,"score_spread":0.21074119979191563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258956855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47288188,0.0014598946,0.502078,0.00016060333,0.000120454744,0.0001843113,0.009241979,0.00886629,0.0050065853],"genre_scores_gemma":[0.898644,0.00060792785,0.08882212,0.00004629984,0.0000361326,0.000082756786,0.007819944,0.0001406298,0.003800307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998565,0.000010939664,0.000011059038,0.000051115072,0.00004974795,0.000020664627],"domain_scores_gemma":[0.99978,0.000060817507,0.000027196054,0.000043361513,0.000055656157,0.00003295157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001270148,0.000635663,0.00052069215,0.0017297643,0.00019846541,0.0005479368,0.0006261285,0.00039950834,0.002232777],"category_scores_gemma":[0.0007463568,0.00015525187,0.00035979322,0.001511666,0.00013274237,0.00062964694,0.0004584457,0.00029647534,0.0013833855],"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.0009710257,0.00054096023,0.055303484,0.00041226362,0.00019080628,0.0005726605,0.00048975705,0.026517378,0.046714533,0.0017416556,0.008068455,0.858477],"study_design_scores_gemma":[0.000054191936,0.0005593711,0.08802334,0.000114050505,0.00021681945,0.0010136034,0.00074818975,0.83592796,0.054991066,0.008584631,0.009704496,0.00006236604],"about_ca_topic_score_codex":0.009315851,"about_ca_topic_score_gemma":0.013193593,"teacher_disagreement_score":0.009315851,"about_ca_system_score_codex":0.00022136889,"about_ca_system_score_gemma":0.00032821827,"threshold_uncertainty_score":0.018523276},"labels":[],"label_agreement":null},{"id":"W2259386961","doi":"10.1007/978-3-642-40627-0_42","title":"Time-Table Extended-Edge-Finding for the Cumulative Constraint","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Constraint (computer-aided design); Table (database); Propagator; Task (project management); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Data mining; Geometry","score_opus":0.023322449762499652,"score_gpt":0.261160112566523,"score_spread":0.23783766280402335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259386961","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.020431304,0.0006227407,0.9597046,0.00044918945,0.0002657251,0.000350611,0.0019110107,0.0027710933,0.013493664],"genre_scores_gemma":[0.11905991,0.00037685843,0.86632496,0.00016973757,0.00014887602,0.00017336918,0.003094338,0.00078126584,0.009870777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.000117390606,0.00007530559,0.00027723584,0.00029211264,0.00017645053],"domain_scores_gemma":[0.9973592,0.0013907679,0.00012635422,0.0006705873,0.00033479693,0.00011825918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008515035,0.0012971392,0.0016354596,0.0016004895,0.0010193329,0.0017248745,0.003910856,0.0012718721,0.026966546],"category_scores_gemma":[0.0056284717,0.0006863084,0.0017949211,0.003600685,0.0007423773,0.0041597444,0.0020591444,0.0021190483,0.0029646084],"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.00068536506,0.00037685302,0.0010973848,0.0011434669,0.00012874593,0.00041878925,0.00025607485,0.15403473,0.009342786,0.099460326,0.04979469,0.6832608],"study_design_scores_gemma":[0.00021329772,0.00024502585,0.00059060624,0.00010226302,0.00013696446,0.00055866764,0.00017624194,0.7763486,0.00864878,0.19292438,0.019976234,0.00007896217],"about_ca_topic_score_codex":0.0059376294,"about_ca_topic_score_gemma":0.009869599,"teacher_disagreement_score":0.026966546,"about_ca_system_score_codex":0.0010186926,"about_ca_system_score_gemma":0.0024300828,"threshold_uncertainty_score":0.09021205},"labels":[],"label_agreement":null},{"id":"W2259546813","doi":"10.1007/978-3-642-21538-4_32","title":"Augmented HE-Book: A Multimedia Based Extension to Support Immersive Reading Experience","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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 Ottawa","funders":"","keywords":"Haptic technology; Emotive; Multimedia; Computer science; Rendering (computer graphics); Human–computer interaction; Augmented reality; Modalities; Reading (process); Artificial intelligence","score_opus":0.05151674168332459,"score_gpt":0.29669524492445326,"score_spread":0.24517850324112866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259546813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112949006,0.005196124,0.5594302,0.000791009,0.001628331,0.00064854004,0.0061102463,0.048144184,0.26510242],"genre_scores_gemma":[0.17968823,0.0038538058,0.24783048,0.00067752606,0.00059024384,0.00053959474,0.0067852377,0.0056215045,0.5544133],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999074,0.000013316783,0.000005556123,0.000020494672,0.000041699983,0.000011496897],"domain_scores_gemma":[0.99966764,0.0001517896,0.000011299948,0.000058709553,0.00005593179,0.000054711367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015089121,0.0008074385,0.00051399006,0.0005092997,0.0002999639,0.0016325326,0.0013872386,0.00079472625,0.09337842],"category_scores_gemma":[0.0006072512,0.00028306068,0.00054131565,0.00042935682,0.00019717525,0.0016985453,0.0014737123,0.0007309786,0.014294922],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096979056,0.0005982663,0.0006245426,0.0016675654,0.00007822862,0.0014139655,0.0011254371,0.0023622143,0.13328326,0.00800833,0.107551426,0.742317],"study_design_scores_gemma":[0.0002624654,0.001024499,0.008263336,0.00043179523,0.00029250182,0.0055947374,0.0007732745,0.0159528,0.089153074,0.00821512,0.86979795,0.00023839857],"about_ca_topic_score_codex":0.0002849985,"about_ca_topic_score_gemma":0.0008817128,"teacher_disagreement_score":0.09337842,"about_ca_system_score_codex":0.000106150444,"about_ca_system_score_gemma":0.00019647692,"threshold_uncertainty_score":0.31238192},"labels":[],"label_agreement":null},{"id":"W2260622622","doi":"10.1007/978-3-319-41114-9_6","title":"On the State Complexity of the Shuffle of Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Upper and lower bounds; Deterministic finite automaton; State (computer science); Finite-state machine; Nondeterministic finite automaton; Automaton","score_opus":0.01866464202560329,"score_gpt":0.23776755254319934,"score_spread":0.21910291051759606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260622622","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.71155965,0.00090392027,0.26044807,0.0016103438,0.00006439198,0.000117218915,0.000565448,0.00054716656,0.024183853],"genre_scores_gemma":[0.9608136,0.0005065819,0.031244121,0.00010682074,0.00009184782,0.00013168079,0.0004704503,0.00015974334,0.0064751613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980665,0.0004364799,0.00012966662,0.00043233606,0.0005575496,0.00037744732],"domain_scores_gemma":[0.9820608,0.015180246,0.00077136466,0.0012219191,0.00042023847,0.00034542498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013844881,0.00056058704,0.000845481,0.0007743709,0.0009466386,0.002897967,0.0013793198,0.00086969015,0.005418066],"category_scores_gemma":[0.008252414,0.0005906772,0.001629966,0.0008771694,0.0024582902,0.008781283,0.0021535892,0.0027248415,0.00048790313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092169293,0.00026337052,0.0050756414,0.0005206348,0.00011648662,0.00038350766,0.0013937562,0.23525202,0.028992249,0.6708879,0.0022499503,0.053942833],"study_design_scores_gemma":[0.000037944075,0.00020720389,0.0020562827,0.00004370578,0.00006187898,0.00019409411,0.00016436414,0.42820787,0.01726224,0.5488703,0.0028267985,0.00006725521],"about_ca_topic_score_codex":0.001614146,"about_ca_topic_score_gemma":0.0015524278,"teacher_disagreement_score":0.005418066,"about_ca_system_score_codex":0.0022918393,"about_ca_system_score_gemma":0.0010982387,"threshold_uncertainty_score":0.018125236},"labels":[],"label_agreement":null},{"id":"W2260986696","doi":"10.1007/978-3-642-40790-1_30","title":"A Serious Game for the Learning of Vibrotactile Feedbacks Presented under the Foot: How Many and How Fast?","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Avatar; Foot (prosody); Usability; Human–computer interaction; Serious game; Multimedia; Simulation","score_opus":0.029442211239863916,"score_gpt":0.2636568045649735,"score_spread":0.23421459332510958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260986696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08832761,0.0035236152,0.7569677,0.0021794573,0.00087759586,0.0011436613,0.0013679424,0.009454014,0.13615835],"genre_scores_gemma":[0.30846784,0.0036156867,0.55461025,0.0009758961,0.00019310262,0.001334276,0.0024640008,0.00080995954,0.12752894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997986,0.00004558156,0.000013480555,0.00004875575,0.00006121462,0.00003236202],"domain_scores_gemma":[0.9993839,0.00034826272,0.000026043544,0.000024705761,0.00007670327,0.00014022473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045314056,0.0020615906,0.0005635061,0.00037852494,0.00032483324,0.001525458,0.0019957998,0.0009798893,0.025408495],"category_scores_gemma":[0.0023282298,0.00031298143,0.00044579324,0.00023306628,0.00042628267,0.0018730289,0.0014262865,0.0013332354,0.004898453],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013714347,0.0014386906,0.0018709007,0.0011950652,0.00011472554,0.0005725595,0.001850893,0.010538848,0.054470602,0.059332404,0.10954763,0.7576962],"study_design_scores_gemma":[0.0007196276,0.0036679278,0.008518799,0.0010356077,0.00018394928,0.0034278838,0.002003909,0.19761886,0.04918747,0.20003968,0.53328025,0.00031607784],"about_ca_topic_score_codex":0.0010671288,"about_ca_topic_score_gemma":0.0021421532,"teacher_disagreement_score":0.025408495,"about_ca_system_score_codex":0.0004934396,"about_ca_system_score_gemma":0.0006285255,"threshold_uncertainty_score":0.08499992},"labels":[],"label_agreement":null},{"id":"W2261464827","doi":"10.1007/978-3-642-39634-2_22","title":"Formal Reasoning about Classified Markov Chains in HOL","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; HOL; Markov chain; Theoretical computer science; Probabilistic logic; Model checking; Scalability; State space; Formal verification; Formal methods; Markov model; Automated theorem proving; Computation; Markov process; Algorithm; Programming language; Artificial intelligence; Machine learning; Mathematics","score_opus":0.024989372464550366,"score_gpt":0.27105376374123474,"score_spread":0.2460643912766844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261464827","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.024940804,0.0002680907,0.9543539,0.0007668967,0.00012267802,0.00007674008,0.00037628502,0.0009515859,0.018143076],"genre_scores_gemma":[0.67657053,0.00059538626,0.30435443,0.00038300143,0.0002743863,0.00018772484,0.0015175544,0.00048475747,0.01563217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985499,0.00046067522,0.00012305139,0.00020940971,0.00047722855,0.00017969095],"domain_scores_gemma":[0.9942101,0.0044751014,0.00024406266,0.00056440086,0.00036273117,0.00014351685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344497,0.00074606313,0.000627898,0.0014515587,0.0011854125,0.0030117375,0.0020503572,0.0010485247,0.008951236],"category_scores_gemma":[0.00732842,0.00078820356,0.002162718,0.0012534801,0.0029694834,0.0074723475,0.0021349103,0.0034908375,0.0009073387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003375871,0.000029688043,0.00026083266,0.000083383515,0.000020776055,0.000099899175,0.00028571996,0.015197973,0.000617104,0.97056186,0.0012933463,0.011515674],"study_design_scores_gemma":[0.000015196714,0.000005323225,0.000054988144,0.000025083762,0.000012909811,0.000029230538,0.000052631476,0.05989179,0.0007941101,0.9366288,0.0024817586,0.000008015547],"about_ca_topic_score_codex":0.0029217657,"about_ca_topic_score_gemma":0.004366798,"teacher_disagreement_score":0.008951236,"about_ca_system_score_codex":0.0025880383,"about_ca_system_score_gemma":0.0009887199,"threshold_uncertainty_score":0.029944897},"labels":[],"label_agreement":null},{"id":"W2261562153","doi":"10.1007/978-3-319-24704-5_10","title":"Mechanised Relation-Algebraic Order Theory in Ordered Categories without Meets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"McMaster University","funders":"","keywords":"Converse; Computer science; Quotient; Relation (database); Algebraic theory; Algebra over a field; Algebraic number; Order (exchange); Duality (order theory); Algebraic structure; Formal concept analysis; Theoretical computer science; Programming language; Mathematics; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.022658764025412313,"score_gpt":0.2477078227876981,"score_spread":0.2250490587622858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261562153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04893696,0.0049029016,0.70959014,0.003778753,0.0015467457,0.00012752501,0.0005578718,0.00067479775,0.2298843],"genre_scores_gemma":[0.7569258,0.0025079935,0.18512972,0.0008229874,0.0013288216,0.00018250827,0.0007235375,0.00026777035,0.05211078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989085,0.00025052222,0.00009372775,0.00018140339,0.00046488762,0.00010100741],"domain_scores_gemma":[0.9993173,0.00027691305,0.000041420484,0.00018344444,0.0001382948,0.0000426109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125942,0.00056977395,0.00081518263,0.001720901,0.0014649553,0.0035647524,0.001236607,0.0010705343,0.006641072],"category_scores_gemma":[0.0016920834,0.0006755048,0.0014510854,0.001870603,0.0050437506,0.0093699675,0.0024315524,0.0043579624,0.0014600486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035845885,0.000002989973,0.000010711723,0.000016799995,0.0000022148106,0.000010402634,0.000056852947,0.00022134994,0.00013260386,0.9974866,0.0003729306,0.0016830321],"study_design_scores_gemma":[0.0000027994452,0.000004761372,0.000020464904,0.000006430093,0.0000023483578,0.000024611178,0.00001596999,0.00090924907,0.00012588028,0.99528825,0.0035953647,0.0000039811175],"about_ca_topic_score_codex":0.00069728773,"about_ca_topic_score_gemma":0.00073114136,"teacher_disagreement_score":0.006641072,"about_ca_system_score_codex":0.001674526,"about_ca_system_score_gemma":0.00078307156,"threshold_uncertainty_score":0.022216558},"labels":[],"label_agreement":null},{"id":"W2261923652","doi":"10.1007/978-3-319-06483-3_23","title":"Using Ensemble of Bayesian Classifying Algorithms for Medical Systematic Reviews","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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 Ottawa","funders":"","keywords":"Machine learning; Computer science; Artificial intelligence; Support vector machine; Naive Bayes classifier; Bayesian probability; Bayes' theorem; Discriminative model; Data mining","score_opus":0.08168163749375508,"score_gpt":0.3357261139570094,"score_spread":0.25404447646325434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261923652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013083138,0.01597062,0.964877,0.0008261025,0.00034002878,0.0006063675,0.0013453685,0.00153448,0.0014168245],"genre_scores_gemma":[0.109390214,0.005507611,0.8798474,0.00039015032,0.00041301627,0.00095641916,0.0025739232,0.00015888351,0.00076234783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97765756,0.012280189,0.0037499857,0.0021939825,0.003828452,0.00028980625],"domain_scores_gemma":[0.92026705,0.063557774,0.0036743283,0.004220266,0.007826136,0.00045443804],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0328699,0.0017115412,0.0039228513,0.011650936,0.001019381,0.0037272077,0.0020258778,0.002088325,0.0021260027],"category_scores_gemma":[0.098786384,0.0011112886,0.0050013093,0.008326154,0.00040431612,0.004436896,0.0019626513,0.0021761504,0.000961894],"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.0004992163,0.0002183664,0.011458626,0.0022242242,0.0053458996,0.000091988084,0.00028252997,0.04876912,0.0012751098,0.0066666715,0.01016198,0.91300625],"study_design_scores_gemma":[0.0002836342,0.0004438311,0.007466868,0.0018061852,0.005959181,0.0004507224,0.00016996067,0.87443817,0.0030238263,0.09082908,0.014960134,0.00016834028],"about_ca_topic_score_codex":0.0042708293,"about_ca_topic_score_gemma":0.009250748,"teacher_disagreement_score":0.9671301,"about_ca_system_score_codex":0.0012239482,"about_ca_system_score_gemma":0.0038228582,"threshold_uncertainty_score":0.17383474},"labels":[],"label_agreement":null},{"id":"W2263502697","doi":"10.1007/978-3-540-39903-2_30","title":"Laser Projection Augmented Reality System for Computer Assisted Surgery","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"Georgetown University","keywords":"Computer science; Projection (relational algebra); Computer vision; Artificial intelligence; Augmented reality; Fiducial marker; Visualization; Computer graphics (images); Craniotomy; Algorithm; Surgery","score_opus":0.04275643666646558,"score_gpt":0.27433354986487346,"score_spread":0.23157711319840787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263502697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009716504,0.001748588,0.9603571,0.00023928065,0.00037414103,0.00018070912,0.0009356978,0.013076602,0.013371406],"genre_scores_gemma":[0.14172386,0.004349459,0.7892813,0.0006337115,0.00029872046,0.00057106564,0.0025874746,0.0014264985,0.05912792],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940383,0.000104293846,0.000033128952,0.000076380624,0.0003497345,0.000032531276],"domain_scores_gemma":[0.9996363,0.00009825982,0.00001575704,0.00009936206,0.00012556769,0.000024747022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044771496,0.00078425405,0.0007635505,0.0008833623,0.00037872075,0.0012751926,0.0015257972,0.0015059549,0.03302733],"category_scores_gemma":[0.0006890571,0.0008730602,0.00084106886,0.0007447592,0.00023900247,0.0010377597,0.0012316228,0.0010986457,0.010930227],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071088405,0.00012893345,0.000548955,0.0004204492,0.00009920511,0.00055776513,0.00033099228,0.0049081207,0.14552769,0.0062427754,0.044075567,0.7964487],"study_design_scores_gemma":[0.00039001773,0.0021539042,0.010399868,0.00045808824,0.0008026552,0.017197426,0.0003157683,0.23997028,0.2898906,0.008006775,0.429736,0.00067863497],"about_ca_topic_score_codex":0.0010863919,"about_ca_topic_score_gemma":0.0014928267,"teacher_disagreement_score":0.03302733,"about_ca_system_score_codex":0.00018834184,"about_ca_system_score_gemma":0.00058826606,"threshold_uncertainty_score":0.1104874},"labels":[],"label_agreement":null},{"id":"W2264090060","doi":"10.1007/978-3-662-48350-3_74","title":"Compressed Data Structures for Dynamic Sequences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Substring; Symbol (formal); Computer science; String (physics); Data structure; Alphabet; Algorithm; Combinatorics; Representation (politics); Lossless compression; Entropy (arrow of time); Data compression; Mathematics; Physics","score_opus":0.05750524399227357,"score_gpt":0.3123359668703994,"score_spread":0.2548307228781258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264090060","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.013126323,0.004390604,0.956395,0.0008586818,0.00084507983,0.00017293349,0.0018526922,0.0039164927,0.01844236],"genre_scores_gemma":[0.1864193,0.005405673,0.7454279,0.0008459714,0.0011202358,0.0007917715,0.008753687,0.001813462,0.04942203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992704,0.00007724752,0.000068072404,0.000091237955,0.0004363272,0.0000567605],"domain_scores_gemma":[0.99841607,0.0005484607,0.000086342596,0.000547911,0.0003580967,0.000043092958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042584524,0.0008101167,0.00064698746,0.0016357164,0.00055392977,0.0014628718,0.0012162431,0.00077410525,0.01597583],"category_scores_gemma":[0.0036171044,0.00046951752,0.00039971215,0.0029150655,0.0008678814,0.0030013497,0.0016838785,0.0015872016,0.004374415],"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.00025783555,0.00006707695,0.00020853808,0.00040261165,0.000023997038,0.00023786335,0.00029042384,0.012757438,0.022795746,0.24646626,0.040313326,0.67617893],"study_design_scores_gemma":[0.000135847,0.000290188,0.00054369436,0.00045251774,0.0000568595,0.0017824639,0.0002616283,0.18889768,0.08162614,0.46024725,0.2656024,0.000103391605],"about_ca_topic_score_codex":0.0007112012,"about_ca_topic_score_gemma":0.000807552,"teacher_disagreement_score":0.01597583,"about_ca_system_score_codex":0.00072194764,"about_ca_system_score_gemma":0.0007627379,"threshold_uncertainty_score":0.053444505},"labels":[],"label_agreement":null},{"id":"W2264537082","doi":"10.1007/978-3-642-45046-4_31","title":"Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mechanism design; Mechanism (biology); Mathematical optimization; Theoretical computer science; Mathematical economics; Mathematics","score_opus":0.06572262632786496,"score_gpt":0.28123936224398194,"score_spread":0.21551673591611697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264537082","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.004885644,0.00038434498,0.992058,0.00018355329,0.000036644196,0.00009886237,0.000057782618,0.000113311566,0.0021818893],"genre_scores_gemma":[0.45041087,0.0018667156,0.5362437,0.00035072005,0.0004057621,0.001148565,0.00038879766,0.00028137243,0.008903479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937171,0.0036883317,0.00026698827,0.00084135425,0.0010726126,0.00041353353],"domain_scores_gemma":[0.9854049,0.010726055,0.0012327548,0.0012856213,0.00083833,0.00051228347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009571583,0.0029412305,0.003950967,0.0014643464,0.00069189025,0.0036525389,0.004555355,0.0042988085,0.0047316398],"category_scores_gemma":[0.028788198,0.002637045,0.0026619139,0.0020144419,0.0024389476,0.0051051825,0.0039298893,0.004115247,0.000904149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032255703,0.00020788083,0.00037132885,0.0005674638,0.00023089821,0.00013249055,0.00014356717,0.6623294,0.003175921,0.2754339,0.0035456512,0.053538974],"study_design_scores_gemma":[0.0000643346,0.00013573578,0.000076320284,0.00005528874,0.000036760935,0.00007194326,0.00001834169,0.7976331,0.000509073,0.20048524,0.00088656065,0.00002736451],"about_ca_topic_score_codex":0.0005949473,"about_ca_topic_score_gemma":0.0004675843,"teacher_disagreement_score":0.009571583,"about_ca_system_score_codex":0.0022342019,"about_ca_system_score_gemma":0.002594617,"threshold_uncertainty_score":0.05061996},"labels":[],"label_agreement":null},{"id":"W2265096785","doi":"10.1007/978-3-319-18714-3_35","title":"Guidelines for Establishing Instantiation Validity in IT Artifacts: A Survey of IS Research","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Systems Theories and Implementation","field":"Social Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Artifact (error); Computer science; Construct (python library); Design science research; Data science; Construct validity; Centrality; Knowledge management; Management science; Information system; Artificial intelligence; Programming language; Psychology; Psychometrics","score_opus":0.5304430898180588,"score_gpt":0.507802363240758,"score_spread":0.022640726577300763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265096785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07484366,0.116791725,0.63473153,0.05278432,0.0010451581,0.0031577032,0.0014618479,0.0011559362,0.114028126],"genre_scores_gemma":[0.39938548,0.035770103,0.552301,0.0035107115,0.00038058858,0.0027678602,0.0027317915,0.00054258545,0.0026098778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.8244034,0.093135566,0.03539876,0.0072416984,0.036996286,0.002824307],"domain_scores_gemma":[0.47265857,0.4339501,0.0182755,0.031910393,0.040991407,0.0022140238],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.13656065,0.001617616,0.0027744754,0.027092433,0.005841791,0.023532111,0.006535208,0.0069612176,0.0050305687],"category_scores_gemma":[0.31563506,0.0022588961,0.0036422973,0.029865747,0.021631474,0.038180795,0.008234805,0.0063425177,0.0013843318],"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.00012352523,0.0003465507,0.03392339,0.0055906186,0.00030588024,0.00024208843,0.018885884,0.0015438776,0.0008060643,0.5889203,0.0096013015,0.33971056],"study_design_scores_gemma":[0.000093307215,0.00021807129,0.02390833,0.023280457,0.00038835485,0.0011374194,0.02007305,0.008057688,0.002623884,0.8213386,0.098710015,0.00017082563],"about_ca_topic_score_codex":0.00628136,"about_ca_topic_score_gemma":0.0067248745,"teacher_disagreement_score":0.8634393,"about_ca_system_score_codex":0.008018348,"about_ca_system_score_gemma":0.014682426,"threshold_uncertainty_score":0.7222104},"labels":[],"label_agreement":null},{"id":"W2266339742","doi":"10.1007/978-3-319-30303-1_7","title":"Runtime Enforcement with Partial Control","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Enforcement; Set (abstract data type); Security policy; Field (mathematics); Distributed computing; Control (management); Computer security; Programming language; Artificial intelligence; Law","score_opus":0.013389206723684367,"score_gpt":0.2319555595913657,"score_spread":0.21856635286768133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266339742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016624868,0.00062749494,0.91046405,0.00049907865,0.00036006863,0.00010145361,0.00020239844,0.014896681,0.056223832],"genre_scores_gemma":[0.6391434,0.0006749411,0.29963967,0.00042811848,0.00029488848,0.00020255466,0.0009108265,0.004061623,0.054644015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969752,0.00059192115,0.00017696047,0.0004614153,0.0014236371,0.0003708085],"domain_scores_gemma":[0.9964038,0.0009781291,0.00017768881,0.0020449369,0.0003147734,0.000080679834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019767813,0.00084530225,0.00081439386,0.0007265322,0.0008357232,0.0026585248,0.0015057463,0.00083901495,0.011236971],"category_scores_gemma":[0.005867062,0.00074326043,0.000940248,0.00072014495,0.0022243953,0.0029383136,0.0030128604,0.0029910281,0.0023695966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046266703,0.00016096656,0.00060934166,0.00043094554,0.00006682612,0.00031759392,0.00045436647,0.035799887,0.013996292,0.6026285,0.016353551,0.3287191],"study_design_scores_gemma":[0.00013964731,0.00011339893,0.0004298223,0.00021831851,0.00011387675,0.0003332722,0.00009043184,0.3561202,0.05239387,0.50663954,0.08332607,0.00008151943],"about_ca_topic_score_codex":0.0010414912,"about_ca_topic_score_gemma":0.001444297,"teacher_disagreement_score":0.011236971,"about_ca_system_score_codex":0.00075234345,"about_ca_system_score_gemma":0.0011165433,"threshold_uncertainty_score":0.037591398},"labels":[],"label_agreement":null},{"id":"W2266481775","doi":"10.1007/978-3-319-25252-0_19","title":"Tweets as a Vote: Exploring Political Sentiments on Twitter for Opinion Mining","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Ottawa","funders":"","keywords":"Computer science; Sentiment analysis; Process (computing); Suspect; Data science; Order (exchange); Set (abstract data type); Domain (mathematical analysis); Aggregate (composite); Information retrieval; Artificial intelligence; Political science","score_opus":0.11443245735284817,"score_gpt":0.33066652893245413,"score_spread":0.21623407157960595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266481775","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.6548476,0.0037713118,0.2555677,0.002940775,0.0011458349,0.00066889677,0.045859236,0.0062884367,0.028910227],"genre_scores_gemma":[0.8144962,0.0014937043,0.13496135,0.00028687983,0.0009871334,0.00061273033,0.033059556,0.00054229645,0.013560211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970764,0.00007988474,0.000020402696,0.000058332105,0.00009026515,0.000043548956],"domain_scores_gemma":[0.9994041,0.00033815426,0.0000676006,0.00003562594,0.000108504544,0.000046012203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049704406,0.000763261,0.00043721625,0.0019433256,0.00048163044,0.0014632703,0.00045698494,0.00049675565,0.003756495],"category_scores_gemma":[0.0022745598,0.00023510263,0.0007904661,0.0021204764,0.0001378514,0.0013940174,0.00075508066,0.000675276,0.0033910307],"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.0009277998,0.00056144013,0.07762177,0.00066392974,0.00049800595,0.0004980977,0.0012812334,0.00843577,0.0310337,0.005356173,0.089379996,0.7837422],"study_design_scores_gemma":[0.00009188825,0.00042377127,0.09804018,0.00018169911,0.0005160093,0.000629512,0.0042293537,0.769571,0.026731543,0.029904885,0.06954439,0.00013577976],"about_ca_topic_score_codex":0.0014266173,"about_ca_topic_score_gemma":0.0036879529,"teacher_disagreement_score":0.003756495,"about_ca_system_score_codex":0.00021707118,"about_ca_system_score_gemma":0.00021628983,"threshold_uncertainty_score":0.012566745},"labels":[],"label_agreement":null},{"id":"W2266768517","doi":"10.1007/978-3-319-10470-6_62","title":"Laplacian Forests: Semantic Image Segmentation by Guided Bagging","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":36,"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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Random forest; Pattern recognition (psychology); Image segmentation; Tree (set theory); Segmentation; Decision tree; Embedding; Image (mathematics); Set (abstract data type); Machine learning; Mathematics","score_opus":0.009969215583919692,"score_gpt":0.2837641409203369,"score_spread":0.27379492533641725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266768517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051332247,0.00033871498,0.988313,0.000100239464,0.00007089777,0.00005099571,0.00019095701,0.005373751,0.0004281593],"genre_scores_gemma":[0.12404473,0.0004562118,0.8681146,0.0003356196,0.00015463597,0.00017532798,0.0021256113,0.001127572,0.003465694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985567,0.00031360847,0.00007379892,0.00044921672,0.00042518068,0.00018148932],"domain_scores_gemma":[0.9986964,0.00053487666,0.00009394489,0.00031044937,0.00028051066,0.00008394432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016751352,0.0016656076,0.0027398265,0.0028038053,0.0008890112,0.0019066654,0.0037049197,0.00221676,0.0036293215],"category_scores_gemma":[0.003035146,0.0014406794,0.002136069,0.0035092814,0.00081954617,0.0028226771,0.0025194592,0.002523027,0.002883504],"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.00047639536,0.0002920465,0.0007199724,0.00020419188,0.00025608198,0.00009952808,0.00010910213,0.09111568,0.01887558,0.0066450434,0.016824238,0.864382],"study_design_scores_gemma":[0.000025720617,0.000044185777,0.00020761575,0.000014925812,0.00003875964,0.00006178782,0.00002479328,0.9786689,0.0056538573,0.013306697,0.0019299473,0.000022781142],"about_ca_topic_score_codex":0.008228899,"about_ca_topic_score_gemma":0.015330039,"teacher_disagreement_score":0.008228899,"about_ca_system_score_codex":0.0008337577,"about_ca_system_score_gemma":0.001811165,"threshold_uncertainty_score":0.016362011},"labels":[],"label_agreement":null},{"id":"W2266772360","doi":"10.1007/978-3-319-26187-4_18","title":"A New Webpage Classification Model Based on Visual Information Using Gestalt Laws of Grouping","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Alberta","funders":"","keywords":"Web page; Computer science; Gestalt psychology; Information retrieval; Metric (unit); Similarity (geometry); Tree (set theory); Artificial intelligence; Block (permutation group theory); Representation (politics); World Wide Web; Image (mathematics); Mathematics","score_opus":0.05129109790495257,"score_gpt":0.29759793596758216,"score_spread":0.2463068380626296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266772360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06982451,0.00070018315,0.9232694,0.0004128446,0.00015134763,0.00013369329,0.00041403083,0.0023174414,0.0027765385],"genre_scores_gemma":[0.7016331,0.00059631007,0.28435093,0.00030780246,0.00027227975,0.000315155,0.001283559,0.00026810574,0.010972771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994603,0.000068789304,0.00004179518,0.00019553518,0.00016769907,0.000065810076],"domain_scores_gemma":[0.9992804,0.00020858351,0.000074287964,0.00009251037,0.0002808584,0.00006331744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073873013,0.00059947814,0.0011546467,0.0024918825,0.00052109855,0.001478592,0.0019537003,0.0010983722,0.0023420937],"category_scores_gemma":[0.0016315083,0.00041952688,0.0012227673,0.0019356848,0.00054177427,0.0033843652,0.00072260905,0.0009922496,0.0012272723],"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.00054110616,0.0010634456,0.0141338315,0.00021692437,0.0003406745,0.0002226358,0.00028494367,0.19553146,0.020883404,0.018350583,0.012633878,0.7357971],"study_design_scores_gemma":[0.0000056650374,0.000023479897,0.00094328786,0.0000068207546,0.000021956039,0.000031356205,0.000010695837,0.9947817,0.00077967515,0.0029425728,0.0004435113,0.000009281827],"about_ca_topic_score_codex":0.010109041,"about_ca_topic_score_gemma":0.009976041,"teacher_disagreement_score":0.010109041,"about_ca_system_score_codex":0.0010427455,"about_ca_system_score_gemma":0.0007658398,"threshold_uncertainty_score":0.020100415},"labels":[],"label_agreement":null},{"id":"W2266835854","doi":"10.1007/978-3-642-40843-4_28","title":"Calibration and Stereo Tracking of a Laparoscopic Ultrasound Transducer for Augmented Reality in Surgery","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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 British Columbia","funders":"","keywords":"Computer science; Augmented reality; Transducer; Computer vision; Tracking (education); Artificial intelligence; Calibration; Ultrasound; Acoustics; Radiology; Medicine; Physics","score_opus":0.036802671820332894,"score_gpt":0.27443428308688506,"score_spread":0.23763161126655216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266835854","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.037580542,0.0006835706,0.9466616,0.00026260738,0.00023220218,0.00010285697,0.00014767877,0.0017466177,0.012582228],"genre_scores_gemma":[0.44619104,0.0009701011,0.5394514,0.00027999165,0.00009441553,0.000090337475,0.00035238222,0.0004653655,0.0121049145],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991008,0.00013525,0.000037321235,0.00015591054,0.0005081982,0.000062623505],"domain_scores_gemma":[0.999047,0.00027759717,0.000065730375,0.00023815013,0.0003300222,0.00004150088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007988152,0.000516196,0.0004441231,0.0007464037,0.00041666446,0.00093551906,0.0011860377,0.0016106694,0.0055260276],"category_scores_gemma":[0.0028376605,0.0007748411,0.00045541747,0.00081328786,0.00036541317,0.0009486597,0.0011462611,0.0008378257,0.002281804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047997443,0.0001191099,0.0024770007,0.00021661395,0.000043160147,0.00046737283,0.00063643616,0.017142467,0.4696348,0.005802272,0.004689735,0.49829105],"study_design_scores_gemma":[0.00009350854,0.000974367,0.025910964,0.00019745907,0.00017451361,0.0085689975,0.0004310197,0.37257686,0.53878987,0.0059358175,0.046062164,0.0002845152],"about_ca_topic_score_codex":0.0016536658,"about_ca_topic_score_gemma":0.0021254485,"teacher_disagreement_score":0.0055260276,"about_ca_system_score_codex":0.00039314735,"about_ca_system_score_gemma":0.001126847,"threshold_uncertainty_score":0.01848644},"labels":[],"label_agreement":null},{"id":"W2266900713","doi":"10.1007/978-3-642-35975-0_14","title":"Ontology Enhancement through Inductive Decision Trees","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Computer science; Ontology; Ontology components; Semantics (computer science); Process ontology; Web Ontology Language; Semantic Web; Upper ontology; IDEF5; Domain (mathematical analysis); Information retrieval; Ontology-based data integration; Open Biomedical Ontologies; Description logic; Decision tree; Variety (cybernetics); Popularity; Ontology language; Ontology alignment; Data mining; Artificial intelligence; Programming language","score_opus":0.028272303428165526,"score_gpt":0.2741008378724973,"score_spread":0.24582853444433175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266900713","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.006501634,0.00022638145,0.9882748,0.00010616278,0.000039070303,0.00006270035,0.00011676736,0.0008797029,0.0037927476],"genre_scores_gemma":[0.13708347,0.00038301546,0.85617644,0.00013337652,0.000061887404,0.0001227504,0.0010688403,0.00025668822,0.0047135283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998618,0.00042352526,0.000091175956,0.00021295213,0.0005595128,0.00009482156],"domain_scores_gemma":[0.9966009,0.002294955,0.00012833098,0.0004164488,0.0005039814,0.000055397497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018885065,0.00057651335,0.00064282515,0.0016258546,0.0005433539,0.001094921,0.001421793,0.0005059989,0.004553965],"category_scores_gemma":[0.0055678734,0.00044541134,0.0012402347,0.001505869,0.0005665983,0.002539671,0.0019596908,0.001594801,0.0017054805],"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.00016268484,0.00026539253,0.0011962368,0.00032844007,0.00011287134,0.00020853041,0.00023884476,0.06917462,0.012301055,0.05442052,0.0073556458,0.8542352],"study_design_scores_gemma":[0.000028096005,0.00005769651,0.0004725858,0.00010251552,0.00010882644,0.0001803906,0.000105887804,0.80801576,0.022471286,0.14977838,0.018654285,0.00002423062],"about_ca_topic_score_codex":0.00095737964,"about_ca_topic_score_gemma":0.0019101877,"teacher_disagreement_score":0.004553965,"about_ca_system_score_codex":0.0005991683,"about_ca_system_score_gemma":0.00086434674,"threshold_uncertainty_score":0.01523453},"labels":[],"label_agreement":null},{"id":"W2269076036","doi":"10.1007/978-3-319-58163-7_10","title":"CSA-X: Modularized Constrained Multiple Sequence Alignment","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan","funders":"","keywords":"Multiple sequence alignment; Benchmark (surveying); Computer science; Sequence alignment; Sequence (biology); Wilcoxon signed-rank test; Rank (graph theory); Modular design; Algorithm; Data mining; Statistics; Mathematics; Peptide sequence; Combinatorics; Programming language; Mann–Whitney U test; Cartography","score_opus":0.0227114649682868,"score_gpt":0.251804757675161,"score_spread":0.22909329270687417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269076036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047982275,0.0009171107,0.84948695,0.00020440412,0.00058718876,0.00031290296,0.007849402,0.13317461,0.002669283],"genre_scores_gemma":[0.017188482,0.0006271762,0.94327503,0.0003078504,0.00014136956,0.0009135352,0.02133669,0.013345854,0.0028639818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861217,0.0004011319,0.00010569617,0.000441417,0.00033931475,0.000100320714],"domain_scores_gemma":[0.99883157,0.0005356083,0.00012654212,0.00025471972,0.00016833858,0.00008316248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018929599,0.0034569963,0.0024233887,0.0023203513,0.0012024782,0.0019347812,0.0039651655,0.001655986,0.026256802],"category_scores_gemma":[0.0042686234,0.0018769384,0.0022129146,0.0029913425,0.00078362954,0.0020089257,0.0027471413,0.0038207178,0.018402139],"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.0016751671,0.00032294434,0.0008904113,0.0025899005,0.0006920937,0.00055329804,0.00034132565,0.018934824,0.077508144,0.024751978,0.35089976,0.5208401],"study_design_scores_gemma":[0.0007226271,0.0006134272,0.0018154964,0.0006486572,0.00032647548,0.0014279241,0.0001939934,0.43173814,0.11026101,0.07100811,0.38085318,0.00039097518],"about_ca_topic_score_codex":0.0011247039,"about_ca_topic_score_gemma":0.001977426,"teacher_disagreement_score":0.026256802,"about_ca_system_score_codex":0.00055055704,"about_ca_system_score_gemma":0.0017698532,"threshold_uncertainty_score":0.087837756},"labels":[],"label_agreement":null},{"id":"W2269511331","doi":"10.1007/978-3-642-34710-8_36","title":"Treating Phobias with Computer Games","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mind wandering and attention","field":"Neuroscience","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":"York University","funders":"","keywords":"Phobias; Computer science; Anxiety; Exposure therapy; Software; Phobic disorder; Multimedia; Psychotherapist; Human–computer interaction; Psychology; Psychiatry; Operating system","score_opus":0.03103071968499383,"score_gpt":0.2467443501444604,"score_spread":0.21571363045946657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269511331","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.27316135,0.1253578,0.057778813,0.020620825,0.005451956,0.0008695678,0.00037644873,0.0015114981,0.51487166],"genre_scores_gemma":[0.56247747,0.124219604,0.053344067,0.013057504,0.002243947,0.00074019824,0.000559953,0.00023242422,0.24312481],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999168,0.00002076321,0.000003635266,0.0000069338034,0.000028208704,0.000023670553],"domain_scores_gemma":[0.99995923,0.000015672467,0.0000039853594,0.0000020261023,0.000004864735,0.000014198972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014334965,0.00057110336,0.00025686607,0.00039155697,0.00021858922,0.00035819903,0.00042412282,0.0004891101,0.0053616967],"category_scores_gemma":[0.00041284866,0.000059485006,0.0003131429,0.00015689795,0.00017616333,0.00034261387,0.000591518,0.00092155044,0.001101895],"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.00021958568,0.0015859216,0.000637223,0.0005115994,0.00007945778,0.00090379466,0.0002552401,0.00081405,0.0065131146,0.004637362,0.046845347,0.9369973],"study_design_scores_gemma":[0.0010737437,0.0057306075,0.0261435,0.0038554857,0.00035521868,0.030768378,0.0019351722,0.006586146,0.015642887,0.05947824,0.84833074,0.000099805744],"about_ca_topic_score_codex":0.00068694877,"about_ca_topic_score_gemma":0.0019297197,"teacher_disagreement_score":0.0053616967,"about_ca_system_score_codex":0.00016017625,"about_ca_system_score_gemma":0.00025794198,"threshold_uncertainty_score":0.017936707},"labels":[],"label_agreement":null},{"id":"W2269550524","doi":"10.1007/978-3-319-24486-0_16","title":"Information Preserving Dimensionality Reduction","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimensionality reduction; Computer science; Preprocessor; Task (project management); Curse of dimensionality; Machine learning; Reduction (mathematics); Artificial intelligence; Data pre-processing; Dimension (graph theory); Focus (optics); Data mining; Mathematics; Engineering","score_opus":0.029874116344784638,"score_gpt":0.27396011552098143,"score_spread":0.24408599917619678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269550524","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.0085626645,0.0026574535,0.9497551,0.00075578183,0.0005543436,0.00009604409,0.0010160645,0.0013746053,0.035228044],"genre_scores_gemma":[0.20591639,0.006383198,0.6943337,0.0008792555,0.00089784176,0.0003257814,0.004912976,0.00096607447,0.085384905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992459,0.0001203564,0.000051686166,0.00016058735,0.0003624394,0.00005908242],"domain_scores_gemma":[0.99940073,0.00009576081,0.000030042951,0.00034530734,0.00011008041,0.000018056233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047214708,0.0007715325,0.0009061965,0.0010960726,0.00054251996,0.0017098654,0.0007686045,0.00044540732,0.0072956914],"category_scores_gemma":[0.0016036478,0.00031234682,0.0009896453,0.001748772,0.0007825415,0.0015396241,0.0021566143,0.0016970501,0.004941271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095281976,0.00007323681,0.00020515868,0.00029936823,0.00006864416,0.00008060299,0.0001235589,0.010523732,0.010372663,0.20092109,0.043922085,0.7333146],"study_design_scores_gemma":[0.000036868125,0.0001802563,0.0010669713,0.000127298,0.00009239602,0.0011891375,0.00012958066,0.15764472,0.045811336,0.59647286,0.19717242,0.000076185555],"about_ca_topic_score_codex":0.00032269853,"about_ca_topic_score_gemma":0.00036302969,"teacher_disagreement_score":0.0072956914,"about_ca_system_score_codex":0.000320309,"about_ca_system_score_gemma":0.0005942975,"threshold_uncertainty_score":0.024406552},"labels":[],"label_agreement":null},{"id":"W2270200461","doi":"10.1007/978-3-642-35668-1_37","title":"POSTER: A New Approach to Impairment-Aware Static RWA in Optical WDM Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","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 Windsor","funders":"","keywords":"Computer science; Routing and wavelength assignment; Physical layer; Bit error rate; Wavelength-division multiplexing; Polarization mode dispersion; Computer network; Transmission (telecommunications); Optical communication; Electronic engineering; Telecommunications; Wavelength; Optics; Optical fiber; Physics; Engineering","score_opus":0.011930436905568047,"score_gpt":0.22175576212846024,"score_spread":0.20982532522289218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270200461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070317904,0.00079026626,0.9716684,0.00032708785,0.0009185618,0.00010137378,0.00012083579,0.0023277688,0.016713798],"genre_scores_gemma":[0.28788558,0.0017233507,0.63632387,0.0007116012,0.0014929107,0.0001799479,0.0005703803,0.0013189355,0.069793485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00010639546,0.000031262523,0.00016854648,0.00022468204,0.00005800763],"domain_scores_gemma":[0.99943584,0.000117635005,0.000028016437,0.0002378773,0.00013323044,0.000047367434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078124995,0.0011012129,0.00083530194,0.00057468866,0.00090090575,0.0016669148,0.0022356873,0.00102173,0.010537992],"category_scores_gemma":[0.0011972295,0.00048247614,0.000806721,0.00055594044,0.0005960697,0.0024584818,0.002007973,0.0015728485,0.0034010848],"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.00037303602,0.00038361448,0.00061345805,0.00049792574,0.00016959691,0.00031793065,0.00024759502,0.106484786,0.14050157,0.09726702,0.041589804,0.61155367],"study_design_scores_gemma":[0.000029552013,0.00019885188,0.00042542748,0.00005042197,0.00010571253,0.00038331494,0.00006425622,0.82428706,0.040555086,0.08203766,0.05178137,0.00008120247],"about_ca_topic_score_codex":0.00046963902,"about_ca_topic_score_gemma":0.0008923316,"teacher_disagreement_score":0.010537992,"about_ca_system_score_codex":0.0004807381,"about_ca_system_score_gemma":0.0005966338,"threshold_uncertainty_score":0.035253048},"labels":[],"label_agreement":null},{"id":"W2270306881","doi":"10.1007/978-3-642-36505-8_4","title":"The Concept of Reducts in Pawlak Three-Step Rough Set Analysis","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Reduct; Rough set; Computer science; Data mining; Set (abstract data type); Simple (philosophy); Algorithm; Mathematics; Theoretical computer science","score_opus":0.02078242503738074,"score_gpt":0.24399063113708266,"score_spread":0.22320820609970193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270306881","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.02441275,0.0030700963,0.96268225,0.00062723504,0.00026147405,0.0001268769,0.00015402905,0.000109511035,0.008555717],"genre_scores_gemma":[0.40942094,0.0026702739,0.582169,0.00020370836,0.0002579869,0.0003187962,0.00031995543,0.000072629395,0.004566764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971835,0.00087509316,0.00030435077,0.00030415464,0.0011862891,0.00014662762],"domain_scores_gemma":[0.99784815,0.001079358,0.00017806147,0.0004173539,0.00039571253,0.00008130028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037041157,0.00067173666,0.0013209871,0.0028298292,0.0011341133,0.0043042554,0.0014669892,0.00074380706,0.0010853021],"category_scores_gemma":[0.0071086423,0.0007421623,0.0030198912,0.002791143,0.0032607194,0.0042949747,0.002524094,0.003744789,0.0002981301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042665,0.000028478125,0.00039731912,0.00018514653,0.00009291046,0.00008352581,0.0003807796,0.027060583,0.00096039247,0.9310056,0.0009922213,0.038770325],"study_design_scores_gemma":[0.000008628131,0.000042816322,0.00039178628,0.000051291903,0.00006879001,0.00010960444,0.000106454376,0.07545443,0.000807421,0.918273,0.0046499935,0.00003589159],"about_ca_topic_score_codex":0.0013534958,"about_ca_topic_score_gemma":0.0007406348,"teacher_disagreement_score":0.0043042554,"about_ca_system_score_codex":0.001289337,"about_ca_system_score_gemma":0.0015120389,"threshold_uncertainty_score":0.019589484},"labels":[],"label_agreement":null},{"id":"W2271359107","doi":"10.1007/978-3-319-07887-8_62","title":"A Regional Web-Based Automated Quality Control Platform","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"BC Cancer Agency","funders":"","keywords":"Computer science; Upload; Software; Mammography; Vendor; Quality (philosophy); Operating system","score_opus":0.025931355102009734,"score_gpt":0.2735371386623486,"score_spread":0.24760578356033885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271359107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021793833,0.00064803497,0.66705,0.00040458736,0.00017178316,0.00062789547,0.003935944,0.27247897,0.032888968],"genre_scores_gemma":[0.44079503,0.00083317165,0.45152596,0.0008625835,0.00032792304,0.0008087014,0.023746805,0.016343098,0.06475687],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887747,0.00014014952,0.00007727136,0.00029673107,0.000484145,0.00012422564],"domain_scores_gemma":[0.997433,0.00035191057,0.00016687615,0.0010407995,0.0007377414,0.00026972583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020719552,0.00090841216,0.000940153,0.0022212183,0.0004682832,0.0024641894,0.0027123222,0.0009928723,0.019637752],"category_scores_gemma":[0.0028482068,0.00048158428,0.0006445346,0.0014609325,0.0004099313,0.002315406,0.0026466916,0.00095241,0.016887777],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002327742,0.00094700325,0.006771071,0.0006429282,0.00030836766,0.0007583348,0.00054075016,0.027567904,0.1041175,0.016151765,0.14764035,0.6922263],"study_design_scores_gemma":[0.00055541005,0.0007090164,0.013368083,0.00017422037,0.00030002254,0.0009554973,0.0002739426,0.502542,0.10831576,0.018084846,0.3543956,0.00032573426],"about_ca_topic_score_codex":0.0041382615,"about_ca_topic_score_gemma":0.0020266406,"teacher_disagreement_score":0.019637752,"about_ca_system_score_codex":0.0007806542,"about_ca_system_score_gemma":0.0014266546,"threshold_uncertainty_score":0.06569487},"labels":[],"label_agreement":null},{"id":"W2271862924","doi":"10.1007/b98175","title":"Transactions on Rough Sets I","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":238,"is_retracted":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":"Computer science; Business","score_opus":0.01650765411712709,"score_gpt":0.24490222369711478,"score_spread":0.2283945695799877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271862924","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054060314,0.16454193,0.5166497,0.0118964175,0.027291931,0.00020744692,0.0015606319,0.0010521053,0.27139387],"genre_scores_gemma":[0.1945959,0.16714685,0.3418838,0.0025511167,0.016095512,0.0006539072,0.0028056474,0.0006202629,0.27364695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977639,0.000528316,0.0002945689,0.00024409466,0.0010977782,0.00007137621],"domain_scores_gemma":[0.9979693,0.00073533016,0.00012738949,0.00069778826,0.0004122907,0.000057827798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021096747,0.0011076465,0.003131455,0.0018387598,0.00070586655,0.004669065,0.0009153748,0.0011265364,0.022582043],"category_scores_gemma":[0.006083418,0.00063724467,0.001496218,0.003604069,0.0016196935,0.0030025854,0.0014260842,0.0025985492,0.009449104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006318933,0.00003623685,0.00025445796,0.00071469415,0.00016266471,0.00010093438,0.00022999906,0.0055274526,0.00073743094,0.56273204,0.098119885,0.331321],"study_design_scores_gemma":[0.000029153738,0.0000612828,0.000596931,0.00031905892,0.00011343895,0.00023715149,0.0001362661,0.0100562945,0.00055141794,0.5861471,0.40172103,0.000030859483],"about_ca_topic_score_codex":0.0009851978,"about_ca_topic_score_gemma":0.0006860243,"teacher_disagreement_score":0.022582043,"about_ca_system_score_codex":0.0010878278,"about_ca_system_score_gemma":0.0011581982,"threshold_uncertainty_score":0.07554448},"labels":[],"label_agreement":null},{"id":"W2272257752","doi":"10.1007/978-3-642-36620-8_8","title":"Novel Vector-Valued Approach to Automatic Brain Tissue Classification","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Artificial intelligence; Pattern recognition (psychology); Computer science; Kernel Fisher discriminant analysis; Metric (unit); Maximization; Segmentation; Similarity measure; Kernel (algebra); Mathematics","score_opus":0.035947739083124534,"score_gpt":0.30034184936264885,"score_spread":0.2643941102795243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272257752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022442443,0.0002396476,0.99623716,0.0000627329,0.000065842025,0.000018376251,0.000054063366,0.0003269923,0.00075098395],"genre_scores_gemma":[0.08604279,0.0005922204,0.902064,0.00019183906,0.00015263737,0.000088563436,0.00051240675,0.00017621645,0.010179295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994824,0.000080232334,0.000036002195,0.00012181592,0.00023069537,0.000048843118],"domain_scores_gemma":[0.9995926,0.000098931385,0.00003372953,0.000042442218,0.00020305521,0.000029225774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066941493,0.0005992334,0.00083401793,0.0008839424,0.00031481922,0.0015836706,0.0018809062,0.0009860998,0.0040629767],"category_scores_gemma":[0.0009938873,0.00032255118,0.00074803655,0.0011553185,0.00039634993,0.0011119456,0.0011218789,0.0010074184,0.0018759193],"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.00015011849,0.00014924258,0.00044742363,0.00020621595,0.00007800271,0.00012456372,0.000076103264,0.043179013,0.099960424,0.033032272,0.008917421,0.8136792],"study_design_scores_gemma":[0.000007931196,0.00006586668,0.0004117082,0.000016386979,0.000019471692,0.0002371412,0.000029257752,0.9642514,0.014959248,0.014562141,0.0054173195,0.000022138429],"about_ca_topic_score_codex":0.0012151159,"about_ca_topic_score_gemma":0.0015791556,"teacher_disagreement_score":0.0040629767,"about_ca_system_score_codex":0.00044850772,"about_ca_system_score_gemma":0.0006368097,"threshold_uncertainty_score":0.013592005},"labels":[],"label_agreement":null},{"id":"W2273155963","doi":"10.1007/978-3-642-38868-2_31","title":"Group-Wise Cortical Correspondence via Sulcal Curve-Constrained Entropy Minimization","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health","keywords":"Spherical harmonics; Correspondence problem; Computer science; Entropy (arrow of time); Minification; Algorithm; Artificial intelligence; Mathematics; Pattern recognition (psychology); Mathematical analysis; Mathematical optimization; Physics","score_opus":0.025309178946464592,"score_gpt":0.3097011722853255,"score_spread":0.2843919933388609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273155963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009945874,0.00006850739,0.9882825,0.00010532628,0.00001527094,0.000037019923,0.000089857036,0.00048323165,0.0009724683],"genre_scores_gemma":[0.3605219,0.00025164516,0.63217795,0.000107049294,0.00008829845,0.00020243335,0.0006446489,0.0012537169,0.004752364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995372,0.0001224955,0.000020962425,0.000111198766,0.00016031646,0.000047822665],"domain_scores_gemma":[0.999025,0.00046786547,0.00013024746,0.00014831494,0.00016326894,0.00006521282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089326646,0.00083199464,0.0011946942,0.0016245284,0.0005934649,0.0015187279,0.0013741134,0.0012718351,0.0042217956],"category_scores_gemma":[0.0035841577,0.00065658276,0.00125011,0.001451478,0.0009121039,0.001362801,0.0022386687,0.0012532795,0.0015285312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038997954,0.00015406884,0.001353951,0.0004078521,0.00020429453,0.00024351092,0.00031623428,0.45315653,0.034421418,0.055889234,0.007824202,0.44563878],"study_design_scores_gemma":[0.00001615126,0.000038994032,0.00031534347,0.000011794469,0.000016216607,0.000101141755,0.000032593663,0.96778095,0.004915403,0.025505941,0.0012480726,0.000017449274],"about_ca_topic_score_codex":0.0019005825,"about_ca_topic_score_gemma":0.0033471163,"teacher_disagreement_score":0.0042217956,"about_ca_system_score_codex":0.000587713,"about_ca_system_score_gemma":0.0014916671,"threshold_uncertainty_score":0.014123321},"labels":[],"label_agreement":null},{"id":"W2274118206","doi":"10.1007/978-3-642-23678-5_53","title":"Contourlet-Based Texture Retrieval Using a Mixture of Generalized Gaussian Distributions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Contourlet; Histogram; Computer science; Pattern recognition (psychology); Artificial intelligence; Wavelet; Kullback–Leibler divergence; Gaussian; Probability density function; Probability distribution; Divergence (linguistics); Image texture; Texture (cosmology); Wavelet transform; Mathematics; Statistics; Image processing; Image (mathematics)","score_opus":0.01727781589384302,"score_gpt":0.24858097426819914,"score_spread":0.2313031583743561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274118206","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.007839159,0.00025167235,0.9911413,0.000051969015,0.00003122091,0.00001321258,0.00003360255,0.0002716824,0.00036617584],"genre_scores_gemma":[0.2081103,0.0012194677,0.7859838,0.00018162151,0.0001287328,0.000060352828,0.00042297953,0.0002634269,0.0036293538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.00007912297,0.000018639917,0.00006692077,0.00020080204,0.000040449384],"domain_scores_gemma":[0.9993599,0.00023736228,0.000048280734,0.00011456405,0.00020318246,0.000036741392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088461605,0.0005035527,0.00111764,0.0010132374,0.00025597494,0.0012429684,0.0010022961,0.00088918913,0.0012425168],"category_scores_gemma":[0.0017614136,0.00048021207,0.0009333262,0.0020509749,0.00047579355,0.0017369626,0.00097506284,0.0010086856,0.0010579384],"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.0008145742,0.00015122899,0.000792993,0.0002089878,0.00014680868,0.00012771683,0.00012216638,0.10296259,0.16624548,0.016503287,0.00425462,0.7076696],"study_design_scores_gemma":[0.00001797564,0.00004904853,0.00041380693,0.000008502078,0.000031059357,0.00015922505,0.000011339883,0.9778917,0.016751887,0.003447221,0.001195101,0.0000231353],"about_ca_topic_score_codex":0.0011211545,"about_ca_topic_score_gemma":0.0013902506,"teacher_disagreement_score":0.0012429684,"about_ca_system_score_codex":0.000469477,"about_ca_system_score_gemma":0.00042948985,"threshold_uncertainty_score":0.0046783686},"labels":[],"label_agreement":null},{"id":"W2274280163","doi":"10.1007/978-3-642-24412-4_34","title":"Learning a Classifier when the Labeling Is Known","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Classifier (UML); Artificial intelligence; Computer science","score_opus":0.03076799446700004,"score_gpt":0.23714233784831265,"score_spread":0.2063743433813126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274280163","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.057913918,0.0013994258,0.91532254,0.007852553,0.0017870257,0.00022446208,0.0014101851,0.0029030188,0.011186912],"genre_scores_gemma":[0.4882809,0.0016590705,0.4670485,0.0031754517,0.003728232,0.0005670212,0.008601577,0.0006909963,0.026248166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961272,0.0006495155,0.00030007568,0.0016286237,0.00094922335,0.0003453619],"domain_scores_gemma":[0.986953,0.007630982,0.0005183617,0.0032166094,0.001336734,0.00034422605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004220669,0.0011086774,0.0026647826,0.0014539037,0.0014939258,0.0044420487,0.003588987,0.0054531135,0.0047110165],"category_scores_gemma":[0.020170972,0.0010284837,0.0016465945,0.0015549962,0.0014866557,0.011788653,0.002878147,0.005411774,0.00426276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014087927,0.0005187705,0.010052099,0.0009082608,0.00033977313,0.0011653539,0.000567013,0.040733017,0.013119094,0.03974035,0.08125212,0.8101954],"study_design_scores_gemma":[0.000088534616,0.00016547149,0.0016733335,0.00019114999,0.0001567832,0.0010975031,0.00027403253,0.75913084,0.015023349,0.20380308,0.018337803,0.000058156405],"about_ca_topic_score_codex":0.0014816716,"about_ca_topic_score_gemma":0.00269073,"teacher_disagreement_score":0.0054531135,"about_ca_system_score_codex":0.0010737798,"about_ca_system_score_gemma":0.0016602642,"threshold_uncertainty_score":0.022321284},"labels":[],"label_agreement":null},{"id":"W2274327095","doi":"10.1007/978-3-319-20801-5_16","title":"Image Categorization Using a Heuristic Automatic Clustering Method Based on Hierarchical Clustering","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"National Research Council Canada; Université de Moncton","funders":"","keywords":"Cluster analysis; Computer science; Categorization; Artificial intelligence; Pattern recognition (psychology); Correlation clustering; Hierarchical clustering; Brown clustering; Canopy clustering algorithm; Single-linkage clustering; CURE data clustering algorithm; Set (abstract data type); Heuristic; Image (mathematics); Fuzzy clustering; Hierarchical clustering of networks; Data mining","score_opus":0.04139609649520615,"score_gpt":0.3135597932165064,"score_spread":0.27216369672130025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274327095","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.0077464525,0.00024129951,0.98782957,0.00006304178,0.00010209774,0.00023433632,0.00011885399,0.002142658,0.001521783],"genre_scores_gemma":[0.051784568,0.00013574745,0.9442862,0.0000909594,0.000069304464,0.00018491133,0.00047992318,0.00032257073,0.0026458735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798584,0.00022802284,0.00012554319,0.0006548181,0.000819095,0.00018667581],"domain_scores_gemma":[0.99827886,0.00036251344,0.00009228351,0.00031311723,0.00087706005,0.00007621923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012238951,0.0011177522,0.0021006083,0.0052961567,0.0019341002,0.002141392,0.003074554,0.0016524484,0.0052480865],"category_scores_gemma":[0.002506084,0.0007056453,0.0020653356,0.004656747,0.0008123058,0.001564359,0.0013901726,0.0011105399,0.0037494295],"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.00022718057,0.0002798313,0.0011492547,0.00031654112,0.00027941106,0.00011359955,0.00024552556,0.019761844,0.0477566,0.0060645337,0.0131202405,0.91068536],"study_design_scores_gemma":[0.0000757842,0.00021457564,0.0038864152,0.00005167427,0.00028143072,0.0007202551,0.00029259056,0.9321787,0.036650553,0.013255627,0.012228595,0.000163771],"about_ca_topic_score_codex":0.009475074,"about_ca_topic_score_gemma":0.014308844,"teacher_disagreement_score":0.009475074,"about_ca_system_score_codex":0.0011603019,"about_ca_system_score_gemma":0.0017348182,"threshold_uncertainty_score":0.018839836},"labels":[],"label_agreement":null},{"id":"W2274566957","doi":"10.1007/978-3-642-35261-4_61","title":"Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Regret; Minimax; Vertex (graph theory); Computer science; Tree (set theory); Combinatorics; Algorithm; Mathematical optimization; Theoretical computer science; Graph; Mathematics; Machine learning","score_opus":0.016303377568789718,"score_gpt":0.21345083590524613,"score_spread":0.19714745833645642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274566957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17884678,0.0024854227,0.79578,0.004857574,0.000375237,0.00028239252,0.0033643905,0.0027661435,0.011242145],"genre_scores_gemma":[0.5276252,0.0010632043,0.44405565,0.00093422784,0.00056836946,0.0005027523,0.004991868,0.0010399106,0.01921882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985196,0.00048695403,0.000055323202,0.00046328615,0.00021872343,0.0002560313],"domain_scores_gemma":[0.9914554,0.0067277164,0.00041066352,0.0005269002,0.00044315908,0.0004360003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030763538,0.0021547228,0.004145155,0.0015316111,0.0013388003,0.0034030715,0.00470665,0.0042198175,0.009935654],"category_scores_gemma":[0.013414705,0.001524636,0.0018331627,0.0024747986,0.0016760493,0.0049290736,0.0025661818,0.0036536027,0.001399701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004163936,0.0001302135,0.0007825965,0.00019284597,0.000080616956,0.000059713835,0.000060884213,0.94693696,0.0005538152,0.013687471,0.008113624,0.028984861],"study_design_scores_gemma":[0.000019386509,0.00003121946,0.00010827692,0.000011835352,0.000011207548,0.00001531287,0.000018516916,0.9742319,0.00016292097,0.025149712,0.00023449791,0.000005287628],"about_ca_topic_score_codex":0.008763252,"about_ca_topic_score_gemma":0.014409527,"teacher_disagreement_score":0.009935654,"about_ca_system_score_codex":0.0044398694,"about_ca_system_score_gemma":0.0022140266,"threshold_uncertainty_score":0.033238053},"labels":[],"label_agreement":null},{"id":"W2275078158","doi":"10.1007/978-3-319-20801-5_17","title":"Semantic Scene Classification with Generalized Gaussian Mixture Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Outlier; Artificial intelligence; Mixture model; Merge (version control); Pattern recognition (psychology); RGB color model; Gaussian; Expectation–maximization algorithm; Maximization; Segmentation; Contextual image classification; Computer vision; Image (mathematics); Maximum likelihood; Information retrieval; Mathematics","score_opus":0.04626655217691443,"score_gpt":0.2892165247759735,"score_spread":0.24294997259905904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275078158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045737606,0.00067392393,0.99247605,0.00008698767,0.000061701736,0.000034302906,0.00014682299,0.0011882482,0.00075811637],"genre_scores_gemma":[0.25514054,0.002280646,0.7300352,0.0003302762,0.0002910459,0.0002214469,0.0033856889,0.0006504523,0.0076647345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988306,0.00029622437,0.000055972698,0.00036075106,0.00031505054,0.00014139898],"domain_scores_gemma":[0.99940956,0.0002033649,0.000041282685,0.00016316364,0.00015569585,0.000026865257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013865379,0.00131909,0.0021592241,0.0023277015,0.000512076,0.0018522808,0.0022771389,0.0017123057,0.0025285303],"category_scores_gemma":[0.0021368403,0.0007783652,0.0033153489,0.00305641,0.0007145188,0.0022779992,0.0016439861,0.0020345014,0.0027341256],"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.00032295653,0.00013456387,0.0007710331,0.00021590042,0.00027901542,0.00008934323,0.000102675265,0.14060576,0.009786407,0.014987833,0.009221386,0.82348317],"study_design_scores_gemma":[0.0000069046823,0.0000232171,0.00032326524,0.00001576663,0.000036530364,0.0000718619,0.00002243685,0.9778431,0.0023236065,0.017508727,0.0018083861,0.000016228703],"about_ca_topic_score_codex":0.007003401,"about_ca_topic_score_gemma":0.007883189,"teacher_disagreement_score":0.007003401,"about_ca_system_score_codex":0.0007862891,"about_ca_system_score_gemma":0.0007349212,"threshold_uncertainty_score":0.013925254},"labels":[],"label_agreement":null},{"id":"W2275439971","doi":"10.1007/978-3-642-38326-7_36","title":"Learning to Identify Inappropriate Antimicrobial Prescriptions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Abstraction; Medical prescription; Artificial intelligence; Interval (graph theory); Data mining; Machine learning; Representation (politics); Function (biology); Raw data; Rule induction; Medicine; Mathematics","score_opus":0.01729735707791987,"score_gpt":0.24392834210953887,"score_spread":0.226630985031619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275439971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14104207,0.002988652,0.79887414,0.010420424,0.0005476286,0.00018707867,0.0017350405,0.0029970664,0.041207936],"genre_scores_gemma":[0.76942194,0.0018632336,0.2079047,0.0014837437,0.0004771834,0.00014840614,0.0019381734,0.0000701362,0.016692564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970514,0.00009801595,0.000024050692,0.000074224205,0.00007502748,0.000023430506],"domain_scores_gemma":[0.9968946,0.0023419606,0.00017868023,0.00014343933,0.00037510874,0.00006614032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796032,0.0005274666,0.00039094998,0.00044875432,0.00016409798,0.000647133,0.0006577016,0.00055857707,0.0043508387],"category_scores_gemma":[0.006684852,0.00016919411,0.0003972004,0.0003122313,0.000209201,0.0009348485,0.00060208526,0.0011489224,0.0011136343],"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.00009399585,0.00028904152,0.010226192,0.00011426032,0.00007804496,0.00004657674,0.000098061406,0.04669536,0.0010829691,0.0032061161,0.016134584,0.9219348],"study_design_scores_gemma":[0.000046202822,0.00034872777,0.0058061546,0.00016852215,0.000098345554,0.00019199711,0.00021317176,0.92778605,0.004194234,0.050147668,0.010966228,0.000032685217],"about_ca_topic_score_codex":0.0016215135,"about_ca_topic_score_gemma":0.002993509,"teacher_disagreement_score":0.0043508387,"about_ca_system_score_codex":0.00036096803,"about_ca_system_score_gemma":0.0006729323,"threshold_uncertainty_score":0.014555037},"labels":[],"label_agreement":null},{"id":"W2275448079","doi":"10.1007/978-3-319-10404-1_27","title":"Topology Preservation and Anatomical Feasibility in Random Walker Image Registration","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Image registration; Computer science; Smoothing; Regularization (linguistics); Computer vision; Artificial intelligence; Transformation (genetics); Image (mathematics); Topology (electrical circuits); Algorithm; Mathematics","score_opus":0.016081578850485976,"score_gpt":0.30357207305140727,"score_spread":0.28749049420092126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275448079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063842095,0.0002039927,0.9341233,0.00023430565,0.000022383554,0.000057649737,0.000046587575,0.00015039013,0.0013194445],"genre_scores_gemma":[0.69759876,0.00040377278,0.29837468,0.00005674261,0.00007415071,0.0001756079,0.00022374136,0.00022127478,0.0028713923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834466,0.00090659753,0.00010153638,0.00022150253,0.0003503007,0.000075523174],"domain_scores_gemma":[0.99177575,0.005666274,0.000989958,0.00079460663,0.0005460025,0.00022744811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041332734,0.0004612995,0.0009570486,0.0018517227,0.0005985296,0.0016194254,0.001071838,0.0015452022,0.001562037],"category_scores_gemma":[0.022844123,0.0010063268,0.0007836829,0.001359079,0.0015969481,0.0028023603,0.00224051,0.0013142544,0.00045714027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021197055,0.0002304662,0.004882181,0.00052534783,0.00012931545,0.0010369935,0.00068242464,0.4279164,0.06355678,0.24439943,0.0016939468,0.25282696],"study_design_scores_gemma":[0.000056369772,0.0002767461,0.0013430379,0.000029554481,0.000037912716,0.00073459523,0.00007012469,0.9184812,0.013589742,0.064137936,0.0012002115,0.000042562067],"about_ca_topic_score_codex":0.0007155239,"about_ca_topic_score_gemma":0.00080298714,"teacher_disagreement_score":0.0041332734,"about_ca_system_score_codex":0.00033465645,"about_ca_system_score_gemma":0.0007884481,"threshold_uncertainty_score":0.02185905},"labels":[],"label_agreement":null},{"id":"W2275529993","doi":"10.1007/978-3-319-09704-6_29","title":"State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Unary operation; Computer science; State (computer science); Programming language; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.022607566690483857,"score_gpt":0.2554334232022315,"score_spread":0.23282585651174764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275529993","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.6906768,0.0012587997,0.26444492,0.002114169,0.00013763571,0.0001325781,0.0011343193,0.0006257219,0.03947504],"genre_scores_gemma":[0.97297364,0.00042812957,0.019348541,0.0000772107,0.00011939096,0.00011446752,0.00058945315,0.00020894899,0.006140219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712926,0.0005743357,0.0001970841,0.0005143343,0.001004538,0.00058049284],"domain_scores_gemma":[0.97960657,0.01659495,0.0007980182,0.0017279856,0.0008328612,0.00043958967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666031,0.0005804805,0.0012493969,0.0011014789,0.0012716249,0.0058810185,0.0020608609,0.0012974011,0.008699817],"category_scores_gemma":[0.012960818,0.000715015,0.0021360647,0.0013473969,0.002423023,0.0120101,0.0021171044,0.0038021852,0.00060260564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005929338,0.000189128,0.0021797698,0.00036096037,0.000081265636,0.00019790337,0.0011494589,0.072603874,0.007103487,0.87156636,0.0032831326,0.04069169],"study_design_scores_gemma":[0.00002721973,0.000033497578,0.000516604,0.000022966651,0.000032250147,0.00006872562,0.00009843683,0.14309636,0.0021832013,0.8530788,0.0008112095,0.000030709747],"about_ca_topic_score_codex":0.0029033853,"about_ca_topic_score_gemma":0.0031030846,"teacher_disagreement_score":0.008699817,"about_ca_system_score_codex":0.0032907939,"about_ca_system_score_gemma":0.0020297389,"threshold_uncertainty_score":0.029103756},"labels":[],"label_agreement":null},{"id":"W2276650849","doi":"10.1007/978-3-642-21593-3_43","title":"From Optical Flow to Tracking Objects on Movie Videos","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Université Laval","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Tracking (education); Optical flow; Minimum bounding box; Motion (physics); Match moving; Bounding overwatch; Motion vector; Segmentation; Track (disk drive); Video tracking; Exploit; Motion estimation; Object (grammar); Tracking system; Image (mathematics)","score_opus":0.03960306121684678,"score_gpt":0.2844106236417969,"score_spread":0.24480756242495014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276650849","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.011039956,0.002721294,0.9822035,0.0002778564,0.00019695135,0.00005521201,0.00023853398,0.00085706107,0.0024096193],"genre_scores_gemma":[0.22439075,0.008714014,0.7522069,0.00030952235,0.0006561324,0.00014535924,0.0015814684,0.00044981542,0.011545948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997528,0.000042363125,0.000010357747,0.00009283,0.00007101129,0.00003053461],"domain_scores_gemma":[0.9995503,0.00021955621,0.00003711412,0.00006563993,0.00009939873,0.00002800511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004968712,0.0010173605,0.0009479242,0.001622675,0.0004249407,0.0011971308,0.0011563451,0.0012482194,0.001971051],"category_scores_gemma":[0.0024518135,0.0007901908,0.0005512386,0.0017998128,0.0005684115,0.0023899318,0.0011704124,0.0012266875,0.00064531434],"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.00017685984,0.000076815144,0.00056491664,0.0002408583,0.00004586045,0.00009905302,0.00012509944,0.057354167,0.019480659,0.015107037,0.010805371,0.8959233],"study_design_scores_gemma":[0.000016793338,0.00006147805,0.0010375925,0.000048775644,0.000025448127,0.00014916126,0.000054426244,0.92865145,0.0116613675,0.051742148,0.0065239156,0.000027431826],"about_ca_topic_score_codex":0.00832408,"about_ca_topic_score_gemma":0.005052375,"teacher_disagreement_score":0.00832408,"about_ca_system_score_codex":0.0005592755,"about_ca_system_score_gemma":0.00041495962,"threshold_uncertainty_score":0.016551256},"labels":[],"label_agreement":null},{"id":"W2276913102","doi":"10.1007/978-3-319-53058-1_2","title":"Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Manitoba; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Synchronization (alternating current); Real-time computing; Fault (geology); Time synchronization; Distributed computing; Computer network","score_opus":0.0199611810559998,"score_gpt":0.26729375602160327,"score_spread":0.24733257496560346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276913102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13998657,0.0005313177,0.84891105,0.00024722028,0.00018480589,0.000064746826,0.000043008196,0.0007899137,0.00924136],"genre_scores_gemma":[0.89232934,0.00028299398,0.09879624,0.000066089284,0.00004495779,0.000070360664,0.000035530906,0.00007768424,0.008296757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997613,0.000059327165,0.000016772308,0.000056044515,0.000073909796,0.00003259164],"domain_scores_gemma":[0.99950314,0.00022326599,0.00004247259,0.00012378873,0.00007871388,0.000028632114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037408812,0.00040138463,0.00069152866,0.00032089642,0.00063232786,0.0007860733,0.00088166795,0.0006654191,0.0018501793],"category_scores_gemma":[0.0013214432,0.0002529267,0.00034707075,0.00044272398,0.0005873249,0.001056403,0.00095944246,0.00084087654,0.00026026237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009266707,0.000108606815,0.00096519,0.00025521204,0.000113552895,0.00060375367,0.0005126386,0.6000877,0.07968242,0.19035065,0.002981022,0.123412594],"study_design_scores_gemma":[0.000028857012,0.00008041655,0.00015557179,0.000010119384,0.000019418962,0.000049363654,0.000024822952,0.9704818,0.005685121,0.022235133,0.0012170739,0.000012283532],"about_ca_topic_score_codex":0.0010461804,"about_ca_topic_score_gemma":0.0012228593,"teacher_disagreement_score":0.0018501793,"about_ca_system_score_codex":0.0003994697,"about_ca_system_score_gemma":0.00035083186,"threshold_uncertainty_score":0.0061894655},"labels":[],"label_agreement":null},{"id":"W2276913568","doi":"10.1007/978-3-319-25264-3_39","title":"Conceptual Modeling for Financial Investment with Text Mining","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Data science; Bridge (graph theory); Business intelligence; Analytics; Domain (mathematical analysis); Data analysis; Matching (statistics); Finance; Investment (military); Data mining; Business","score_opus":0.1920311914970709,"score_gpt":0.37699660217443043,"score_spread":0.18496541067735953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276913568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003393078,0.00074512896,0.9903526,0.0005467793,0.000056624907,0.00012286851,0.0012495163,0.001462995,0.0020703357],"genre_scores_gemma":[0.08357918,0.0014520934,0.9063096,0.00027829985,0.00008735664,0.00049432775,0.004508991,0.00020847691,0.00308169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992243,0.00024925076,0.00010472687,0.00017896053,0.0002097961,0.00003299506],"domain_scores_gemma":[0.99833435,0.001130557,0.00009540608,0.0001892555,0.0002054778,0.00004489882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013065634,0.0009854452,0.000571463,0.0015498955,0.00041529973,0.0020340811,0.0019484338,0.0007591796,0.0067293732],"category_scores_gemma":[0.005341153,0.0004128231,0.0019364716,0.0015798571,0.00047652746,0.0031130794,0.001122122,0.00146286,0.0025747116],"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.00012845884,0.00025692905,0.002199865,0.0012889437,0.0002441501,0.00043488698,0.0006815478,0.09771107,0.0063566943,0.23584366,0.027503693,0.6273501],"study_design_scores_gemma":[0.000012674794,0.000032811644,0.00042695273,0.00016457895,0.00006508376,0.00017796655,0.0001335794,0.72967714,0.0033209233,0.238049,0.02791736,0.000021818967],"about_ca_topic_score_codex":0.0020425024,"about_ca_topic_score_gemma":0.0027201534,"teacher_disagreement_score":0.0067293732,"about_ca_system_score_codex":0.00077190535,"about_ca_system_score_gemma":0.0008106986,"threshold_uncertainty_score":0.02251196},"labels":[],"label_agreement":null},{"id":"W2276971222","doi":"10.1007/978-3-319-22572-2_15","title":"An Openflow-Based Approach to Failure Detection and Protection for a Multicasting Tree","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","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":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; OpenFlow; Software-defined networking; Quality of service; Network packet; Tree (set theory); IP multicast; Forwarding plane; Network topology; Distributed computing","score_opus":0.0448074967778222,"score_gpt":0.2621359032243943,"score_spread":0.2173284064465721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276971222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028698351,0.00018721956,0.9934542,0.00011133226,0.00007558808,0.000048043137,0.000014632276,0.00046740234,0.0027717166],"genre_scores_gemma":[0.21429837,0.0005936816,0.77467144,0.00021980554,0.00028805598,0.0001394048,0.0001068816,0.00016419384,0.009518225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989479,0.00017861764,0.000058824375,0.00014573369,0.0005765721,0.000092317096],"domain_scores_gemma":[0.99891484,0.0004083806,0.0000636252,0.00023796562,0.00031024494,0.00006508373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510791,0.0005069028,0.00063497544,0.00095525215,0.0010906471,0.0016927836,0.0024254126,0.0012351696,0.0031001214],"category_scores_gemma":[0.0029757908,0.0004098426,0.00072604284,0.00061117107,0.00096305215,0.0024711052,0.0020345217,0.0024234715,0.00050258747],"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.00026224973,0.00023185741,0.0005395288,0.00020056308,0.000096349766,0.00023578819,0.00047014462,0.07479128,0.036304038,0.39801592,0.007433255,0.48141897],"study_design_scores_gemma":[0.000028925406,0.00016655616,0.00028178483,0.00005506768,0.00007050918,0.00030233146,0.000049154474,0.7557481,0.0142920725,0.20981005,0.019155595,0.000039881368],"about_ca_topic_score_codex":0.00088723283,"about_ca_topic_score_gemma":0.0012689697,"teacher_disagreement_score":0.0031001214,"about_ca_system_score_codex":0.001057821,"about_ca_system_score_gemma":0.00085781165,"threshold_uncertainty_score":0.01037097},"labels":[],"label_agreement":null},{"id":"W2277104430","doi":"10.1007/11520153_23","title":"A Quantitative Evaluation of a Bio-inspired Sound Segregation Technique for Two- and Three-Source Mixtures","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Source separation; Artificial neural network; Sound (geography); Artificial intelligence; Quantitative assessment; Pattern recognition (psychology); Speech recognition; Acoustics; Mathematics; Statistics","score_opus":0.04020518074533443,"score_gpt":0.31328531208135124,"score_spread":0.27308013133601683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277104430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2141201,0.0027751173,0.77000564,0.00024470277,0.00033443462,0.00025295417,0.00034824616,0.0031856755,0.008733069],"genre_scores_gemma":[0.56626886,0.0012036745,0.4257098,0.00012385692,0.00010180587,0.00010674182,0.0005285164,0.0004957885,0.0054609915],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909806,0.00017669643,0.00003390715,0.00011115849,0.00053862063,0.00004159953],"domain_scores_gemma":[0.9976393,0.0013249945,0.00012849679,0.00021985192,0.0006022383,0.00008515959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012204971,0.0006969051,0.0005096858,0.0010684909,0.00044245817,0.0010135556,0.0009774412,0.00095752423,0.0056161396],"category_scores_gemma":[0.0035683296,0.00024028179,0.0004970609,0.0007863063,0.0005489261,0.0010724585,0.00085337175,0.0004761567,0.0012733587],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002560914,0.000288813,0.000960189,0.0006082066,0.000119162585,0.00010949102,0.00014345991,0.010563127,0.70252925,0.0013936559,0.0009239275,0.27979988],"study_design_scores_gemma":[0.00027820945,0.0024637545,0.0072601996,0.00008555086,0.00037913164,0.0014774062,0.00020580011,0.2456625,0.73231536,0.0014027839,0.008374308,0.00009499775],"about_ca_topic_score_codex":0.00058041856,"about_ca_topic_score_gemma":0.0007900293,"teacher_disagreement_score":0.0056161396,"about_ca_system_score_codex":0.00031828406,"about_ca_system_score_gemma":0.00026561445,"threshold_uncertainty_score":0.018787801},"labels":[],"label_agreement":null},{"id":"W2277107861","doi":"10.1007/978-3-642-40104-6_31","title":"Planar Packing of Binary Trees","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Calgary","funders":"","keywords":"Combinatorics; Planar graph; Binary tree; Embedding; Trémaux tree; Colored; Mathematics; Time complexity; Book embedding; Tree (set theory); Spanning tree; Computer science; Graph; Discrete mathematics; 1-planar graph; Line graph; Pathwidth; Artificial intelligence","score_opus":0.024790430396237764,"score_gpt":0.27572010548139037,"score_spread":0.2509296750851526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277107861","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.15542452,0.009748857,0.21755478,0.0011339206,0.0008829732,0.000112445174,0.00087383226,0.0007795266,0.6134892],"genre_scores_gemma":[0.6265426,0.015848491,0.1421844,0.0004294326,0.00089704985,0.00018513648,0.003513094,0.0008290297,0.20957077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978036,0.00002613884,0.000009895114,0.000041585958,0.00010596432,0.000036040754],"domain_scores_gemma":[0.9998511,0.000054869506,0.000018455949,0.000031592706,0.000020836842,0.000023088667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008035759,0.0005620219,0.0006947453,0.0009485025,0.0006427584,0.0015667605,0.0006475729,0.00060900976,0.012726553],"category_scores_gemma":[0.0008638173,0.0006204312,0.00039625002,0.0025251254,0.0006065334,0.0016698923,0.001615635,0.0016608159,0.0030528582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013115493,0.00008665314,0.00027611156,0.00048791576,0.000027222814,0.0002574443,0.0003389846,0.013371998,0.008095241,0.69128233,0.030923104,0.25472185],"study_design_scores_gemma":[0.000036315818,0.00008874339,0.0011023212,0.00015923177,0.000029632787,0.0007883278,0.00022875951,0.03265502,0.004109447,0.8421439,0.11863368,0.000024551477],"about_ca_topic_score_codex":0.0006834835,"about_ca_topic_score_gemma":0.0007820104,"teacher_disagreement_score":0.012726553,"about_ca_system_score_codex":0.0005035395,"about_ca_system_score_gemma":0.00021378235,"threshold_uncertainty_score":0.042574525},"labels":[],"label_agreement":null},{"id":"W2277162327","doi":"10.1007/978-3-662-45803-7_33","title":"Drawing Planar Graphs with Reduced Height","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Planar; Vertex (graph theory); Mathematics; Embedding; Upper and lower bounds; Graph drawing; Polygonal chain; Graph; Book embedding; Planar straight-line graph; Geometry; 1-planar graph; Line graph; Computer science; Computer graphics (images); Artificial intelligence; Mathematical analysis","score_opus":0.012375233529359493,"score_gpt":0.22471033680183644,"score_spread":0.21233510327247695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277162327","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.03209,0.00064267905,0.900555,0.00046653676,0.00027992963,0.00015840298,0.0007333664,0.004850458,0.060223706],"genre_scores_gemma":[0.21730117,0.0015720507,0.7355,0.0002622802,0.00015045433,0.0001910979,0.0020635137,0.0025382538,0.040421203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967635,0.00003844272,0.000013985549,0.00007068844,0.00016337304,0.000037201087],"domain_scores_gemma":[0.9996475,0.00013070228,0.000023164966,0.000101213715,0.00006432786,0.000033167285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018795757,0.0012754787,0.0008240034,0.0010203895,0.00045870233,0.0012502654,0.0017779592,0.0007952053,0.026351793],"category_scores_gemma":[0.0011710598,0.0010623377,0.00082353404,0.0012644755,0.00066345476,0.0016412227,0.0019230419,0.0021303631,0.004771664],"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.00023461005,0.00011625076,0.000316535,0.0007991151,0.00010350814,0.00032796524,0.0004545424,0.1324418,0.042241957,0.21459699,0.048118412,0.5602484],"study_design_scores_gemma":[0.00015242609,0.00016326208,0.00058246794,0.00017246479,0.00011209468,0.0006431703,0.00031581253,0.42577448,0.029518602,0.41764727,0.124839954,0.000078007775],"about_ca_topic_score_codex":0.001520751,"about_ca_topic_score_gemma":0.0032794445,"teacher_disagreement_score":0.026351793,"about_ca_system_score_codex":0.000550662,"about_ca_system_score_gemma":0.000320968,"threshold_uncertainty_score":0.08815551},"labels":[],"label_agreement":null},{"id":"W2277190316","doi":"10.1007/978-3-642-30353-1_41","title":"Generalizing and Executing Plans","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Formalism (music); Sequence (biology); Representation (politics); Set (abstract data type); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.022831748787847037,"score_gpt":0.23961424723406072,"score_spread":0.21678249844621367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277190316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019642007,0.00076750957,0.9434172,0.0009378038,0.00011556022,0.00033938032,0.0003084143,0.0043106982,0.030161528],"genre_scores_gemma":[0.19356866,0.0016254197,0.78294605,0.00028802268,0.00011188112,0.00027091982,0.0016125984,0.0011966284,0.018379752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977664,0.00061607367,0.00018296018,0.00054149784,0.000634846,0.0002583656],"domain_scores_gemma":[0.99733305,0.0013536563,0.00011794859,0.0009503244,0.00017750917,0.000067566245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025434338,0.0014312105,0.0007494675,0.0011598107,0.00091498066,0.0031577353,0.002018887,0.0012945789,0.007875283],"category_scores_gemma":[0.008031793,0.0010958925,0.002416829,0.0012244228,0.003819404,0.0049673095,0.003945982,0.0031537993,0.0020765755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017431559,0.00010469329,0.0011535268,0.00046016244,0.00011306093,0.00042445082,0.002295978,0.05430355,0.006625003,0.6630348,0.0073954267,0.263915],"study_design_scores_gemma":[0.00004818617,0.00006721951,0.00035997396,0.00015606098,0.00011121543,0.00020095446,0.0003793488,0.09500455,0.010668464,0.8541331,0.038834564,0.00003639073],"about_ca_topic_score_codex":0.0056367056,"about_ca_topic_score_gemma":0.005928964,"teacher_disagreement_score":0.007875283,"about_ca_system_score_codex":0.001212611,"about_ca_system_score_gemma":0.0019634622,"threshold_uncertainty_score":0.026345491},"labels":[],"label_agreement":null},{"id":"W2277377986","doi":"10.1007/978-3-662-49619-0_1","title":"Pairwise Comparisons Rating Scale Paradox","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Pairwise comparison; Normalization (sociology); Computer science; Rating scale; Scale (ratio); Statistics; Data mining; Artificial intelligence; Mathematics; Cartography","score_opus":0.11996272760090089,"score_gpt":0.3812480764788608,"score_spread":0.2612853488779599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277377986","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093983784,0.0047817486,0.42554864,0.02353415,0.0025144704,0.000456487,0.0005409107,0.00053144654,0.44810843],"genre_scores_gemma":[0.8595238,0.0011221153,0.10506948,0.0024563104,0.0006814566,0.00056320895,0.00026202554,0.00014025765,0.03018137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97760576,0.0130589735,0.00097556354,0.001514444,0.006445958,0.00039936774],"domain_scores_gemma":[0.9366658,0.048866153,0.0017543104,0.006713227,0.005030368,0.0009701971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018631049,0.00091818965,0.0013684481,0.0018612038,0.001656466,0.0039418424,0.0022903006,0.0027467848,0.016250392],"category_scores_gemma":[0.11991064,0.00040885614,0.0010682956,0.0020170156,0.004960623,0.00843185,0.0037460024,0.0052249837,0.0017905555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014028467,0.00008010503,0.00034105842,0.00014454385,0.000055482364,0.00013620399,0.00038179726,0.0012376774,0.00070598186,0.9224273,0.009951564,0.06439812],"study_design_scores_gemma":[0.0000400344,0.000040290673,0.00033548387,0.000039255418,0.000020220257,0.00020525455,0.00015741854,0.005533244,0.00038601385,0.98640895,0.0068133348,0.000020373369],"about_ca_topic_score_codex":0.00038325434,"about_ca_topic_score_gemma":0.00031463077,"teacher_disagreement_score":0.018631049,"about_ca_system_score_codex":0.001748523,"about_ca_system_score_gemma":0.001087593,"threshold_uncertainty_score":0.098531604},"labels":[],"label_agreement":null},{"id":"W2277681113","doi":"10.1007/978-3-319-18356-5_34","title":"A Framework for Discovering Bursty Events and Their Relationships from Online News Articles","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Timestamp; Computer science; Set (abstract data type); Event (particle physics); Search engine indexing; Information retrieval; Data mining; Feature (linguistics); Computer security","score_opus":0.07314784756382184,"score_gpt":0.2881140631343033,"score_spread":0.21496621557048148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277681113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011526684,0.0014463624,0.98096085,0.00039759476,0.00006099177,0.0002345155,0.0019432128,0.0021165858,0.0013131825],"genre_scores_gemma":[0.12905152,0.0012994531,0.86094004,0.00015712103,0.00019381366,0.000379927,0.0042716237,0.00015905622,0.0035473693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984478,0.00031050324,0.00016425236,0.0004923968,0.00042727595,0.00015774799],"domain_scores_gemma":[0.99605834,0.0022443135,0.00045796263,0.00037128382,0.0005945407,0.00027357493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031819872,0.0011933463,0.0012563266,0.009872623,0.0013896134,0.00404498,0.0026844647,0.0018069906,0.0027242855],"category_scores_gemma":[0.008012108,0.00083856325,0.0021980256,0.0076821097,0.00097134657,0.0052658753,0.0022753566,0.002039635,0.0015657962],"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.0007490399,0.0011919002,0.03439337,0.0010588345,0.0008167293,0.0016598015,0.0018504764,0.079632565,0.015028292,0.17084989,0.024648806,0.6681204],"study_design_scores_gemma":[0.000057303958,0.00017216447,0.0062927688,0.0001350162,0.00024201453,0.0006831237,0.00048916024,0.80835986,0.0032814436,0.16187347,0.018304521,0.000109136],"about_ca_topic_score_codex":0.018162016,"about_ca_topic_score_gemma":0.02732577,"teacher_disagreement_score":0.018162016,"about_ca_system_score_codex":0.0011800751,"about_ca_system_score_gemma":0.0024344516,"threshold_uncertainty_score":0.036112607},"labels":[],"label_agreement":null},{"id":"W2277726991","doi":"10.1007/978-3-319-25660-3_13","title":"Evaluation of Community Mining Algorithms in the Presence of Attributes","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Alberta","funders":"","keywords":"Computer science; Variety (cybernetics); Cluster analysis; Data mining; Focus (optics); Point (geometry); Data science; Ground truth; Machine learning; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.09704232291428187,"score_gpt":0.34014078057350666,"score_spread":0.24309845765922478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277726991","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.85096097,0.0057565193,0.13171957,0.0010338301,0.0005736456,0.00047318698,0.0018940407,0.0028935191,0.004694717],"genre_scores_gemma":[0.84994984,0.0006234269,0.14280106,0.00010411598,0.00019668326,0.00014510745,0.0044404957,0.00020890794,0.0015304179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921674,0.0036567333,0.0005747617,0.0013416003,0.0018245084,0.00043490596],"domain_scores_gemma":[0.91251636,0.07163096,0.0019424923,0.004838934,0.0075592953,0.0015119608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014526265,0.0015564604,0.0019741904,0.0033615225,0.0013493167,0.0019936145,0.003126847,0.0028170873,0.0014011613],"category_scores_gemma":[0.053544376,0.00043805773,0.0010256696,0.0025641334,0.0006818021,0.003950665,0.0018260168,0.0011597201,0.0006040513],"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.008223172,0.0033502034,0.03410708,0.0015515409,0.0013486128,0.00033989348,0.00034579597,0.45371518,0.009603851,0.0046789157,0.012798148,0.4699376],"study_design_scores_gemma":[0.000115051895,0.0003577322,0.0013469184,0.000021498428,0.000072909286,0.000098241624,0.000064687505,0.9936547,0.0022708883,0.0016421803,0.0003428845,0.000012222224],"about_ca_topic_score_codex":0.005225279,"about_ca_topic_score_gemma":0.0045624636,"teacher_disagreement_score":0.014526265,"about_ca_system_score_codex":0.0011430668,"about_ca_system_score_gemma":0.0012018576,"threshold_uncertainty_score":0.076823115},"labels":[],"label_agreement":null},{"id":"W2277828988","doi":"10.1007/978-3-642-38457-8_32","title":"An Application of Answer Set Programming for Situational Analysis in a Maritime Traffic Domain","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Answer set programming; Domain (mathematical analysis); Delegate; Situation awareness; Solver; Abstraction; Set (abstract data type); Component (thermodynamics); Programming language; Situation analysis; Theoretical computer science; Artificial intelligence; Software engineering; Data mining","score_opus":0.013070988883505517,"score_gpt":0.2567934255036776,"score_spread":0.2437224366201721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277828988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008549749,0.00021348205,0.9737907,0.00066463795,0.0000723514,0.00012617419,0.00021418663,0.0015450002,0.01482363],"genre_scores_gemma":[0.11517588,0.0003157276,0.877604,0.00023990033,0.000080941536,0.00013595603,0.0004576672,0.0003910572,0.0055988077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987268,0.0005263946,0.0000853813,0.00022434969,0.00033700722,0.00010008165],"domain_scores_gemma":[0.9985146,0.0011494173,0.00004018316,0.00011445623,0.00013297732,0.000048354857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632715,0.00077640987,0.0007996678,0.0013228285,0.0011929657,0.0025716885,0.0020509758,0.0013688202,0.009700535],"category_scores_gemma":[0.0046293973,0.00048269442,0.0018973291,0.0015217955,0.0014205944,0.0026302414,0.0029940684,0.0021711881,0.0011334615],"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.00020647894,0.00034872378,0.0012077425,0.0004929617,0.0001194047,0.00048096193,0.001427292,0.085680485,0.006344512,0.53314894,0.013301497,0.35724092],"study_design_scores_gemma":[0.000044798857,0.000056526656,0.00043590923,0.00009024736,0.000075319826,0.0001895508,0.00038381948,0.50266653,0.0031510063,0.46806663,0.024803974,0.000035632558],"about_ca_topic_score_codex":0.004954496,"about_ca_topic_score_gemma":0.0062640132,"teacher_disagreement_score":0.009700535,"about_ca_system_score_codex":0.0008136174,"about_ca_system_score_gemma":0.00088750303,"threshold_uncertainty_score":0.03245151},"labels":[],"label_agreement":null},{"id":"W2277931218","doi":"10.1007/978-3-319-24704-5_18","title":"L-Fuzzy Databases in Arrow Categories","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Arrow; Fuzzy logic; Database; Semantics (computer science); Fuzzy set; Information retrieval; Data mining; Theoretical computer science; Artificial intelligence; Natural language processing; Programming language","score_opus":0.043052184250674363,"score_gpt":0.2719023573771973,"score_spread":0.22885017312652295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277931218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04553838,0.021071548,0.65886843,0.003680791,0.001284307,0.00011960685,0.0009856354,0.00075571146,0.2676956],"genre_scores_gemma":[0.58389866,0.013268956,0.2800099,0.0013181586,0.0012265703,0.00022577848,0.0010187534,0.00023805491,0.118795164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945575,0.000110435896,0.00006577746,0.00010408067,0.00021452416,0.000049366114],"domain_scores_gemma":[0.9994578,0.00017743326,0.000037911042,0.00009462872,0.00017668911,0.00005556213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066179835,0.0003397313,0.00051495933,0.0019266878,0.0011022036,0.0034140118,0.0009675421,0.0006246679,0.008021721],"category_scores_gemma":[0.0016394813,0.0003762012,0.00040529587,0.003796623,0.0014863902,0.0068696183,0.0018090663,0.0015053169,0.002522211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001840547,0.000008029267,0.00009280885,0.000101781676,0.0000049747096,0.00003535726,0.00021831068,0.00039170694,0.0007581726,0.9494329,0.0051497747,0.043787856],"study_design_scores_gemma":[0.000005204393,0.00001624089,0.00010166891,0.00004606725,0.000006246105,0.00014169293,0.000113356495,0.0020794645,0.00077262725,0.92938864,0.06731531,0.000013426421],"about_ca_topic_score_codex":0.00096247206,"about_ca_topic_score_gemma":0.0006873973,"teacher_disagreement_score":0.008021721,"about_ca_system_score_codex":0.0013016434,"about_ca_system_score_gemma":0.0006849973,"threshold_uncertainty_score":0.026835322},"labels":[],"label_agreement":null},{"id":"W2278007321","doi":"10.1007/978-3-319-20801-5_6","title":"Non-local Means for Stereo Image Denoising Using Structural Similarity","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Western University","funders":"","keywords":"Image denoising; Artificial intelligence; Similarity (geometry); Structural similarity; Noise reduction; Computer vision; Pattern recognition (psychology); Computer science; Image (mathematics); Mathematics","score_opus":0.053181251940574645,"score_gpt":0.32319426880329494,"score_spread":0.2700130168627203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278007321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029693134,0.0004061594,0.99514306,0.000037085298,0.00004237888,0.000013838654,0.000022810904,0.00020406935,0.0011613164],"genre_scores_gemma":[0.06795191,0.0010165212,0.9171458,0.00010467102,0.00012080373,0.0000870774,0.00025837834,0.0002744776,0.013040372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997514,0.000032179963,0.000013001744,0.000050110393,0.00013839487,0.000014910312],"domain_scores_gemma":[0.9997807,0.00006845601,0.000016834747,0.000051702784,0.00007490252,0.0000074495006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029442387,0.0005012469,0.00061611953,0.00048991456,0.00024020046,0.00044870126,0.000816426,0.0007890565,0.0032667988],"category_scores_gemma":[0.00074532407,0.0003058827,0.0007263037,0.0007438864,0.0003704913,0.0007232874,0.00067130214,0.0010279033,0.0015578045],"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.000120529825,0.0000830926,0.00021525178,0.00032678773,0.000080169135,0.000071489645,0.00010916141,0.042600676,0.1153348,0.036897026,0.006919212,0.7972419],"study_design_scores_gemma":[0.000016195683,0.000117121934,0.0007439457,0.000026205787,0.00006667573,0.00035383078,0.00003949894,0.8828705,0.07140348,0.026517572,0.01780936,0.000035537672],"about_ca_topic_score_codex":0.000905149,"about_ca_topic_score_gemma":0.002529678,"teacher_disagreement_score":0.0032667988,"about_ca_system_score_codex":0.00034832588,"about_ca_system_score_gemma":0.0003939885,"threshold_uncertainty_score":0.010928571},"labels":[],"label_agreement":null},{"id":"W2278408372","doi":"10.1007/3-540-45153-6_27","title":"Évaluation d’un Système pour le Résumé Automatique de Documents ÉLectroniques","year":2001,"lang":"fr","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Université Laval","funders":"","keywords":"Computer science; Valuation (finance); Business; Accounting","score_opus":0.024545233327482822,"score_gpt":0.2934102087685686,"score_spread":0.2688649754410858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278408372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30024704,0.0030248468,0.5664443,0.0015264841,0.0009202599,0.0015696274,0.0032259908,0.112072185,0.01096941],"genre_scores_gemma":[0.4645972,0.0009357813,0.49544632,0.00041935343,0.0002296612,0.0006681116,0.0059283413,0.0022389642,0.029536227],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99588674,0.0010538755,0.00039771234,0.000901599,0.0016086849,0.00015141451],"domain_scores_gemma":[0.9883145,0.0072901226,0.00028070563,0.0012521978,0.0025836385,0.00027884886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036955453,0.0012709746,0.0011816933,0.0018131005,0.00088888715,0.003468412,0.0014662071,0.0021424785,0.011385343],"category_scores_gemma":[0.012889998,0.0008071897,0.00087449065,0.0008698145,0.00074250076,0.0029717798,0.0009936747,0.0010220094,0.0045220694],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056735156,0.0011731925,0.0056854943,0.0015093649,0.00031546445,0.00061406376,0.0011717227,0.020851301,0.15375105,0.004055008,0.018847814,0.7863519],"study_design_scores_gemma":[0.0014753992,0.0021611718,0.014701883,0.00023152547,0.00046079876,0.0012178198,0.0008951877,0.5079019,0.3748596,0.0022305085,0.093665265,0.00019899596],"about_ca_topic_score_codex":0.015024905,"about_ca_topic_score_gemma":0.0072352192,"teacher_disagreement_score":0.015024905,"about_ca_system_score_codex":0.0010132316,"about_ca_system_score_gemma":0.001695319,"threshold_uncertainty_score":0.038087785},"labels":[],"label_agreement":null},{"id":"W2278630443","doi":"10.1007/978-3-642-40760-4_57","title":"Automatic Detection of Blue-White Veil by Discrete Colour Matching in Dermoscopy Images","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Pattern recognition (psychology); Feature (linguistics); Matching (statistics); Medicine; Pathology","score_opus":0.005285713260582714,"score_gpt":0.24087018158197504,"score_spread":0.23558446832139232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278630443","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.53093565,0.001974341,0.45951322,0.00025578137,0.00015110889,0.00018661575,0.00039791467,0.002148935,0.004436505],"genre_scores_gemma":[0.8654843,0.00087164313,0.13080749,0.00011348486,0.0000488668,0.000040975003,0.00023612297,0.00016789837,0.0022292219],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971586,0.000045308574,0.000014180769,0.00005637507,0.00010215481,0.000066125074],"domain_scores_gemma":[0.9994741,0.0001669227,0.000069190144,0.00005440169,0.00018361938,0.000051761115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040533263,0.0003670475,0.00042084753,0.0023236664,0.00018423339,0.0009757511,0.00042976977,0.0006303023,0.0010565917],"category_scores_gemma":[0.0009814888,0.00025193102,0.00033416643,0.0006584407,0.00024100151,0.00048507281,0.00053083274,0.00039044322,0.00064190314],"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.001368052,0.00013758874,0.010750173,0.00038136193,0.00007322218,0.000488173,0.00012034375,0.003623933,0.658188,0.000843487,0.0016478434,0.3223778],"study_design_scores_gemma":[0.00008392325,0.00039284985,0.08314824,0.00014396783,0.00021993692,0.0052739526,0.00028691092,0.33022738,0.57190925,0.0017100265,0.0065014036,0.000102191734],"about_ca_topic_score_codex":0.00086969964,"about_ca_topic_score_gemma":0.001277023,"teacher_disagreement_score":0.0023236664,"about_ca_system_score_codex":0.00021109631,"about_ca_system_score_gemma":0.00027923702,"threshold_uncertainty_score":0.003534615},"labels":[],"label_agreement":null},{"id":"W227870380","doi":"10.1007/978-3-319-09873-9_30","title":"Power-Aware L1 and L2 Caches for GPGPUs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; General-purpose computing on graphics processing units; Page cache; Cache pollution; CUDA; Cache invalidation; Cache algorithms; Idle; Smart Cache; Throughput; Embedded system; Graphics; CPU cache; Operating system","score_opus":0.015596233634441048,"score_gpt":0.25099358609407835,"score_spread":0.2353973524596373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227870380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22574197,0.04676338,0.5163102,0.003702082,0.0012205563,0.0003531357,0.0022810441,0.025300805,0.17832677],"genre_scores_gemma":[0.80677485,0.0037729072,0.13234574,0.0013562217,0.00021193096,0.00022140554,0.0015986338,0.0014864077,0.052231774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997445,0.000033776832,0.000010095817,0.00004642074,0.00009227114,0.000072972434],"domain_scores_gemma":[0.99968815,0.0000712999,0.000022711492,0.000091409725,0.00009510258,0.000031305983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018605147,0.00073070946,0.00043357717,0.00037260447,0.00067802763,0.001263596,0.0023244536,0.0006107943,0.009716612],"category_scores_gemma":[0.0007902368,0.00039603925,0.00035160902,0.0010892214,0.00032691166,0.0016799842,0.0010536787,0.0010407706,0.0016953939],"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.0014408936,0.0003250507,0.0021124352,0.0013397178,0.00017493415,0.0003594864,0.0005259493,0.10910438,0.07411451,0.06503734,0.15289158,0.59257376],"study_design_scores_gemma":[0.00028775597,0.000710938,0.0020690856,0.00029244603,0.00028995785,0.0006368764,0.00034292272,0.58217555,0.116932794,0.07082238,0.22530504,0.00013419776],"about_ca_topic_score_codex":0.0044773873,"about_ca_topic_score_gemma":0.0143544255,"teacher_disagreement_score":0.009716612,"about_ca_system_score_codex":0.0013425037,"about_ca_system_score_gemma":0.001530565,"threshold_uncertainty_score":0.032505274},"labels":[],"label_agreement":null},{"id":"W2279000668","doi":"10.1007/978-3-642-39094-4_46","title":"Multi-distributions Particle Filter for Eye Tracking Inside a Vehicle","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Particle filter; Computer vision; Artificial intelligence; Autoregressive model; Rotation (mathematics); Eye tracking; Face (sociological concept); Tracking (education); Similarity (geometry); Filter (signal processing); Image (mathematics); Mathematics","score_opus":0.03568826234325436,"score_gpt":0.2814927893074319,"score_spread":0.2458045269641775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279000668","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.00389094,0.00037295645,0.99453497,0.000052162475,0.0000834444,0.000013164474,0.00003749269,0.00041367204,0.00060119625],"genre_scores_gemma":[0.3705472,0.0011250708,0.6142149,0.00016482746,0.00017788749,0.00016386919,0.00042118152,0.00019106886,0.012994085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996947,0.00004466376,0.000014950872,0.000113704395,0.00009617599,0.000035833757],"domain_scores_gemma":[0.9996038,0.00018387014,0.000024436677,0.000039443858,0.00013152267,0.000016962811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541077,0.00077283604,0.0010559165,0.00055779127,0.00051944,0.00076380523,0.0009707758,0.0015417595,0.0018904301],"category_scores_gemma":[0.0014477499,0.00066931156,0.00095189334,0.00079436164,0.00030183286,0.0007744011,0.000907516,0.0013730185,0.0010464541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034376848,0.000096460855,0.00139046,0.00018262945,0.00017771129,0.00015087944,0.00016501635,0.50039524,0.018032378,0.0058962754,0.00497374,0.4681955],"study_design_scores_gemma":[0.000005425119,0.000011076197,0.00030574412,0.00000521034,0.000009572813,0.000015976882,0.0000051954785,0.99718213,0.0011969601,0.0006588978,0.0005976818,0.000006194694],"about_ca_topic_score_codex":0.019830134,"about_ca_topic_score_gemma":0.015488545,"teacher_disagreement_score":0.019830134,"about_ca_system_score_codex":0.0007127737,"about_ca_system_score_gemma":0.0009626871,"threshold_uncertainty_score":0.039429426},"labels":[],"label_agreement":null},{"id":"W2279033101","doi":"10.1007/978-3-540-85902-4_3","title":"XML Retrieval by Improving Structural Relevance Measures Obtained from Summary Models","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relevance (law); Information retrieval; Ranking (information retrieval); XML; Rank (graph theory); Data mining; Document Structure Description; World Wide Web","score_opus":0.01870901423863776,"score_gpt":0.22113036841028633,"score_spread":0.20242135417164858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279033101","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.08981417,0.0072911642,0.8852141,0.0008103167,0.0003128954,0.00027122468,0.0024408603,0.00952149,0.004323849],"genre_scores_gemma":[0.60882753,0.002784924,0.3700568,0.0003909301,0.001067763,0.00025516155,0.010507062,0.0010765891,0.0050331936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970126,0.00089465716,0.00040255772,0.0005487613,0.00096281664,0.00017853035],"domain_scores_gemma":[0.9923078,0.0043651816,0.0005650405,0.0012581365,0.0013629606,0.00014085737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029030805,0.0013392734,0.0018511158,0.008031961,0.00055816356,0.002411691,0.001505983,0.0016952197,0.0045887493],"category_scores_gemma":[0.017080553,0.0005917986,0.0017924809,0.004502744,0.00045032435,0.006076356,0.0012817956,0.0013003375,0.0029882225],"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.0016217995,0.0003612958,0.0052044364,0.0010435754,0.00052282354,0.0002688666,0.00023627003,0.041397743,0.03649137,0.01141878,0.021021444,0.88041157],"study_design_scores_gemma":[0.00016095968,0.0006642358,0.0038110204,0.00009927509,0.0008873868,0.0005142503,0.0001317481,0.92995316,0.026920285,0.026953291,0.009809843,0.00009445436],"about_ca_topic_score_codex":0.0023497918,"about_ca_topic_score_gemma":0.0035165106,"teacher_disagreement_score":0.008031961,"about_ca_system_score_codex":0.0007873267,"about_ca_system_score_gemma":0.0010311101,"threshold_uncertainty_score":0.015353084},"labels":[],"label_agreement":null},{"id":"W2279272802","doi":"10.1007/978-3-642-35632-2_21","title":"Path-Aware Time-Triggered Runtime Verification","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Sampling (signal processing); Execution time; Real-time computing; Set (abstract data type); Path (computing); Parallel computing; Embedded system; Operating system; Programming language; Telecommunications; Detector","score_opus":0.009377730707233394,"score_gpt":0.2167901030679255,"score_spread":0.20741237236069213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279272802","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.0131665245,0.00028014308,0.97460186,0.00010072837,0.0001572688,0.000079848076,0.00013703696,0.007414181,0.0040622717],"genre_scores_gemma":[0.6302696,0.00030114417,0.36071637,0.00020502433,0.00009191993,0.00014763717,0.00052923616,0.0015529955,0.0061860913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969015,0.00059130136,0.0001544922,0.0005507479,0.0013686722,0.00043333124],"domain_scores_gemma":[0.9948002,0.0023573101,0.00032179768,0.0016673458,0.0007253234,0.00012797162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443426,0.0013236778,0.0011483463,0.0010271516,0.00060129614,0.0014752089,0.0029215557,0.0010341362,0.0075860596],"category_scores_gemma":[0.0059405006,0.0008310371,0.001477841,0.00072997034,0.0011834562,0.0028843815,0.0031109715,0.0019845644,0.0017635075],"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.002146628,0.00026766668,0.0016310153,0.0011218574,0.00022173866,0.0008417635,0.00036230256,0.29166347,0.13709933,0.13436216,0.012879394,0.41740265],"study_design_scores_gemma":[0.00011103358,0.00017422663,0.00030754105,0.00006690217,0.00010224649,0.00033655073,0.00003598608,0.85371196,0.06196218,0.076454476,0.006681465,0.000055446548],"about_ca_topic_score_codex":0.0013198471,"about_ca_topic_score_gemma":0.0021202234,"teacher_disagreement_score":0.0075860596,"about_ca_system_score_codex":0.0009342893,"about_ca_system_score_gemma":0.0016375585,"threshold_uncertainty_score":0.02537793},"labels":[],"label_agreement":null},{"id":"W2279368206","doi":"10.1007/978-3-319-07046-9_24","title":"Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Quadratic programming; Solver; Binary number; Ellipsoid; Algorithm; Mathematical optimization; Local search (optimization); Theoretical computer science; Mathematics","score_opus":0.045436997734418755,"score_gpt":0.33138075023975544,"score_spread":0.28594375250533666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279368206","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.0051659746,0.0007409641,0.98807526,0.00015863411,0.00009785699,0.000049053822,0.00003973595,0.00038197785,0.005290576],"genre_scores_gemma":[0.17832753,0.00084624393,0.81480855,0.0002823767,0.00017963699,0.00023590714,0.00026507085,0.00035796702,0.0046967217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984818,0.00055590546,0.000067051384,0.00016393542,0.0006409951,0.00009038493],"domain_scores_gemma":[0.9980028,0.0013934443,0.00007738223,0.00018306098,0.0002593067,0.00008401877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024861866,0.0013321901,0.0024416477,0.001634086,0.00050353975,0.0016225498,0.0024573174,0.0016314177,0.005801487],"category_scores_gemma":[0.006357438,0.00093999674,0.0009984329,0.0034095047,0.00082372746,0.0025492543,0.0024903244,0.0029458702,0.0011126397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022677788,0.00029322004,0.00026124637,0.0003028354,0.000082836676,0.00003466655,0.00007023509,0.63528603,0.0022696643,0.04594747,0.008243669,0.3069814],"study_design_scores_gemma":[0.000018945348,0.00002397016,0.000033765617,0.000011481645,0.0000067736346,0.000008979797,0.0000037387515,0.98737437,0.00019595797,0.011658913,0.000658661,0.000004374088],"about_ca_topic_score_codex":0.002874997,"about_ca_topic_score_gemma":0.0035548883,"teacher_disagreement_score":0.005801487,"about_ca_system_score_codex":0.0009678403,"about_ca_system_score_gemma":0.0012264217,"threshold_uncertainty_score":0.019407928},"labels":[],"label_agreement":null},{"id":"W2279517711","doi":"10.1007/978-3-642-23963-2_21","title":"Indirect Elicitation of NIN-AND Trees in Causal Model Acquisition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Tree (set theory); Bayesian network; Causal model; Key (lock); Table (database); Bayes' theorem; Node (physics); Machine learning; Artificial intelligence; Tree diagram; Theoretical computer science; Network topology; Decision tree; Data mining; Mathematics; Posterior probability; Bayesian probability; Statistics","score_opus":0.031849710246047006,"score_gpt":0.25484277413595846,"score_spread":0.22299306388991147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279517711","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.06980903,0.00042623695,0.89452416,0.0010151778,0.00007103177,0.00020368428,0.00026020006,0.0005331932,0.033157352],"genre_scores_gemma":[0.67823386,0.00035556158,0.3130843,0.00019223194,0.000049308353,0.00029584393,0.000515506,0.00019420577,0.0070792534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934782,0.004271779,0.0002781255,0.00055565406,0.0012224226,0.00019385705],"domain_scores_gemma":[0.93997365,0.051463805,0.0014734786,0.004978958,0.0016801187,0.00042987356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006846173,0.00073521334,0.00079584133,0.00045982611,0.00071361475,0.002085092,0.001246955,0.0014743198,0.01042351],"category_scores_gemma":[0.050339546,0.000789901,0.00084007444,0.0006980035,0.0013830957,0.0060767275,0.0036272078,0.003760414,0.0010922676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009090781,0.00043802705,0.0048459964,0.00096468715,0.00014521313,0.00034707267,0.0060501057,0.018615033,0.016890876,0.6191614,0.0045454707,0.32708696],"study_design_scores_gemma":[0.000088475295,0.00023392645,0.0029252828,0.00023532649,0.00011668698,0.00032762956,0.0010201539,0.20122963,0.015938943,0.76309776,0.014718918,0.00006709132],"about_ca_topic_score_codex":0.00083751837,"about_ca_topic_score_gemma":0.0033332792,"teacher_disagreement_score":0.01042351,"about_ca_system_score_codex":0.0010754787,"about_ca_system_score_gemma":0.0015594073,"threshold_uncertainty_score":0.036206484},"labels":[],"label_agreement":null},{"id":"W2279683949","doi":"10.1007/978-3-642-38457-8_28","title":"Preference Thresholds Optimization by Interactive Variation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Weighting; Cluster analysis; Similarity (geometry); Preference; Computer science; Variation (astronomy); Cluster (spacecraft); Statistics; Data mining; Artificial intelligence; Mathematics; Physics","score_opus":0.017747836409253533,"score_gpt":0.22824435531297613,"score_spread":0.2104965189037226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279683949","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.0063216677,0.0002644914,0.9856845,0.00013017561,0.0000642952,0.00003370455,0.000032942313,0.00025339043,0.0072148573],"genre_scores_gemma":[0.47134903,0.00046314145,0.5076665,0.00024278126,0.00020866086,0.00034116267,0.00019332099,0.0007934373,0.018741826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987556,0.0005414235,0.000043469165,0.00019539245,0.00031842128,0.00014583088],"domain_scores_gemma":[0.998575,0.0009692716,0.000065544365,0.00016534631,0.00013878004,0.000085999156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016249035,0.0009052456,0.0016645043,0.0008752358,0.0005257309,0.0014426378,0.002313873,0.0010838897,0.00846514],"category_scores_gemma":[0.005890988,0.00068251137,0.001367344,0.0015927576,0.001089415,0.0017233775,0.0025930419,0.0022754287,0.0010582629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023934759,0.00015990887,0.00035889336,0.00023588327,0.00013280498,0.000096295356,0.00019193458,0.41561535,0.006253901,0.3122532,0.012104577,0.252358],"study_design_scores_gemma":[0.000026408643,0.000063702784,0.00009333026,0.000015132846,0.000015264644,0.000039958202,0.000013015951,0.8997794,0.00079024263,0.09646734,0.0026794581,0.000016776576],"about_ca_topic_score_codex":0.0016911301,"about_ca_topic_score_gemma":0.0013020843,"teacher_disagreement_score":0.00846514,"about_ca_system_score_codex":0.0011842708,"about_ca_system_score_gemma":0.00074417895,"threshold_uncertainty_score":0.028318703},"labels":[],"label_agreement":null},{"id":"W2279884163","doi":"10.1007/978-3-319-24704-5_12","title":"Relational Mathematics for Relative Correctness","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"Université Laval","funders":"","keywords":"Correctness; Computer science; Theoretical computer science; Relation (database); Algebraic number; Programming language; Program analysis; Algorithm; Algebra over a field; Mathematics; Data mining; Pure mathematics","score_opus":0.060012365732834784,"score_gpt":0.2942546414822602,"score_spread":0.23424227574942544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279884163","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011601809,0.019626128,0.38201106,0.007657828,0.0021480974,0.00006699614,0.00044318862,0.0009290974,0.57551575],"genre_scores_gemma":[0.62482655,0.02281847,0.100137144,0.002545859,0.0054334835,0.00029170117,0.0013370326,0.0015361907,0.2410736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988777,0.0002607678,0.000080885395,0.0002006939,0.00049279514,0.000087129294],"domain_scores_gemma":[0.99922585,0.00035250143,0.000050289666,0.00018324055,0.00015591535,0.000032259875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011023418,0.0008667599,0.0009122851,0.0018559456,0.0014889047,0.0036178932,0.0010620008,0.0008434682,0.02009763],"category_scores_gemma":[0.0024841959,0.0006182914,0.0009236967,0.002338078,0.0042448468,0.010187673,0.0021310567,0.0042290846,0.006179543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032429548,0.0000031422924,0.000015393769,0.000034322125,0.000002786541,0.0000069494154,0.000088737055,0.0001280237,0.00014743958,0.98925215,0.002771895,0.0075458903],"study_design_scores_gemma":[0.0000041574544,0.0000056539866,0.00004952664,0.000025550498,0.00000638768,0.000038625276,0.00002876333,0.0003308253,0.0002372916,0.95320195,0.04606632,0.000004898842],"about_ca_topic_score_codex":0.0006902865,"about_ca_topic_score_gemma":0.0005638255,"teacher_disagreement_score":0.02009763,"about_ca_system_score_codex":0.0024194506,"about_ca_system_score_gemma":0.0008073078,"threshold_uncertainty_score":0.067233324},"labels":[],"label_agreement":null},{"id":"W2279892936","doi":"10.1007/978-3-319-08434-3_38","title":"A Framework for Formal Reasoning about Geometrical Optics","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual and Cognitive Learning Processes","field":"Psychology","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.03549507103009585,"score_gpt":0.3459964824601414,"score_spread":0.31050141143004556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279892936","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.001611038,0.00048492936,0.98466474,0.0006134173,0.00010993299,0.00004860285,0.00022434372,0.0006274408,0.011615636],"genre_scores_gemma":[0.12352218,0.0011410334,0.8605818,0.0004558237,0.00033294308,0.00030910876,0.0009625244,0.0005203543,0.012174221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984969,0.0004416267,0.00017391337,0.00025506553,0.0004918041,0.00014068684],"domain_scores_gemma":[0.9984958,0.00087020226,0.000068401816,0.00029267874,0.00020933208,0.00006347817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021067506,0.0017506484,0.001283932,0.002365944,0.00192974,0.005225846,0.0049971347,0.0026158404,0.012475898],"category_scores_gemma":[0.004290829,0.0016590047,0.004421719,0.0023236389,0.005539626,0.014055074,0.003936624,0.005121758,0.0029432173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067280344,0.0000097127095,0.000032878608,0.00006940298,0.000011515607,0.00004674709,0.00013135199,0.002432479,0.00032538746,0.98497343,0.0014667083,0.010493639],"study_design_scores_gemma":[0.0000053592967,0.0000028661311,0.000016428643,0.000018697012,0.000007658688,0.000023730412,0.000022988066,0.008689881,0.00021590771,0.9845538,0.0064357924,0.0000069666353],"about_ca_topic_score_codex":0.005730749,"about_ca_topic_score_gemma":0.0053203525,"teacher_disagreement_score":0.012475898,"about_ca_system_score_codex":0.0027361,"about_ca_system_score_gemma":0.0011487112,"threshold_uncertainty_score":0.041736066},"labels":[],"label_agreement":null},{"id":"W2280444571","doi":"10.1007/978-3-642-40849-6_65","title":"A Novel Analytical Inverse Compensation Approach for Preisach Model","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Magnetic Properties and Applications","field":"Materials 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":"Concordia University","funders":"","keywords":"Inverse; Compensation (psychology); Invertible matrix; Hysteresis; Preisach model of hysteresis; Computer science; Function (biology); Differential (mechanical device); Dual (grammatical number); Control theory (sociology); Magnetic hysteresis; Mathematics; Physics; Artificial intelligence; Magnetic field; Magnetization","score_opus":0.049111547445033835,"score_gpt":0.2529581076923099,"score_spread":0.2038465602472761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280444571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008529011,0.00014825122,0.995047,0.000048362665,0.000058134185,0.000017425908,0.00001904216,0.0003281931,0.0034806626],"genre_scores_gemma":[0.13411634,0.0009948008,0.8303895,0.00031279773,0.00018556263,0.00020101777,0.00032874514,0.00058207347,0.032889236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997731,0.000040801857,0.000010760519,0.00004434105,0.0001137631,0.000017234303],"domain_scores_gemma":[0.9998504,0.00003672901,0.0000101531805,0.000039627383,0.000057059406,0.0000060405905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032050477,0.00091258937,0.00075422775,0.00053236884,0.0005749075,0.0009201584,0.0013412399,0.0011581156,0.006343921],"category_scores_gemma":[0.00071419374,0.00040382674,0.00092817296,0.00047934015,0.0004166746,0.0012942646,0.0007563655,0.0011894901,0.0035937955],"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.00015788476,0.00015236929,0.00035867436,0.00051353825,0.00010243091,0.0004288424,0.00037684638,0.21442991,0.14005588,0.21106735,0.01212419,0.4202322],"study_design_scores_gemma":[0.0000085111815,0.000042808933,0.00009066126,0.000024425035,0.000028222536,0.0002548042,0.000036563728,0.9494391,0.010851276,0.0213,0.017895076,0.000028562079],"about_ca_topic_score_codex":0.0018050881,"about_ca_topic_score_gemma":0.0033217,"teacher_disagreement_score":0.006343921,"about_ca_system_score_codex":0.0003743446,"about_ca_system_score_gemma":0.00066942256,"threshold_uncertainty_score":0.021222591},"labels":[],"label_agreement":null},{"id":"W2280565273","doi":"10.1007/978-3-642-40131-2_32","title":"MAF: A Method for Detecting Temporal Associations from Multiple Event Sequences","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Univariate; Computer science; Multivariate statistics; Event (particle physics); Data mining; Set (abstract data type); Multivariate analysis; Artificial intelligence; Pattern recognition (psychology); Machine learning","score_opus":0.030692933553815506,"score_gpt":0.27595514875124727,"score_spread":0.24526221519743177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280565273","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.004132933,0.0004581942,0.9884399,0.00005360484,0.00009898254,0.00007751533,0.0009632589,0.005435605,0.00033989982],"genre_scores_gemma":[0.05042534,0.00040651494,0.9425595,0.00009702699,0.00020326591,0.00030279136,0.0028051564,0.000727117,0.0024733224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812,0.00031778376,0.00019049496,0.0005648783,0.00065658963,0.00015019519],"domain_scores_gemma":[0.9945426,0.0035141977,0.0005275151,0.0005750872,0.00067123264,0.00016937348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032242169,0.002139235,0.0018583986,0.008002665,0.0010258562,0.0016792567,0.0028163495,0.002274693,0.005909141],"category_scores_gemma":[0.011638153,0.0009232875,0.0019724492,0.0047353576,0.00056486554,0.0026033523,0.0015389711,0.0019418678,0.0038250233],"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.0005910469,0.00018259157,0.0076151653,0.00037150446,0.0004295613,0.000561343,0.0002459976,0.0162069,0.026160968,0.004745137,0.017160716,0.9257291],"study_design_scores_gemma":[0.000116854004,0.00026277965,0.011596042,0.00014751502,0.00033932738,0.0025725774,0.00019914309,0.8811861,0.03011861,0.030929575,0.042276334,0.0002551737],"about_ca_topic_score_codex":0.004869111,"about_ca_topic_score_gemma":0.0054053282,"teacher_disagreement_score":0.008002665,"about_ca_system_score_codex":0.00036978786,"about_ca_system_score_gemma":0.0012030344,"threshold_uncertainty_score":0.01976806},"labels":[],"label_agreement":null},{"id":"W2280717170","doi":"10.1007/978-3-319-19773-9_63","title":"Towards Investigating Performance Differences in Clinical Reasoning in a Technology Rich Learning Environment","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical Reasoning and Diagnostic Skills","field":"Medicine","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":"McGill University","funders":"","keywords":"Correctness; Computer science; Metacognition; Artificial intelligence; Human–computer interaction; Cognition; Psychology; Programming language","score_opus":0.05251419946581889,"score_gpt":0.3267423188506005,"score_spread":0.27422811938478164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280717170","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.97312206,0.0005197091,0.0102385115,0.0002719761,0.00006923829,0.00014488002,0.00052569533,0.00012156474,0.0149863325],"genre_scores_gemma":[0.9661908,0.00041982217,0.016189069,0.00020016269,0.00003200661,0.00022264969,0.00082760653,0.000071918446,0.015846018],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99807394,0.0005648651,0.00011633408,0.00039511546,0.00070799515,0.00014160281],"domain_scores_gemma":[0.9841616,0.010927288,0.0012482746,0.000997567,0.0017039711,0.0009612456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273516,0.00040920434,0.00033406608,0.00072131085,0.00034110117,0.0035327661,0.0010729189,0.000823941,0.006649303],"category_scores_gemma":[0.0147536695,0.0002586897,0.00043800843,0.0008838157,0.00047769127,0.0020645326,0.0018201943,0.0011805743,0.0017804295],"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.0044856933,0.007920668,0.40663138,0.0008820926,0.0007199735,0.0005597486,0.018206308,0.0061167437,0.08715115,0.008800691,0.005572227,0.45295328],"study_design_scores_gemma":[0.00008698693,0.0032852143,0.96068585,0.00011788913,0.0001707174,0.0003129334,0.0042678453,0.0054388256,0.011286395,0.008985376,0.005292474,0.00006955756],"about_ca_topic_score_codex":0.0013347587,"about_ca_topic_score_gemma":0.0016492531,"teacher_disagreement_score":0.006649303,"about_ca_system_score_codex":0.00057855336,"about_ca_system_score_gemma":0.00066074403,"threshold_uncertainty_score":0.022244155},"labels":[],"label_agreement":null},{"id":"W2280760003","doi":"10.1007/978-3-319-19773-9_83","title":"Examining the Relationship Between Performance Feedback and Emotions in Diagnostic Reasoning: Toward a Predictive Framework for Emotional Support","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Toronto Western Hospital; Université de Montréal; University Health Network; McGill University","funders":"","keywords":"Cluster (spacecraft); Psychology; Context (archaeology); Negative emotion; Cognitive psychology; Developmental psychology; Computer science","score_opus":0.09056380144770047,"score_gpt":0.29127257874745377,"score_spread":0.20070877729975328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280760003","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.9389834,0.00088266237,0.049265265,0.0008527224,0.000035254743,0.00019279146,0.00025459443,0.00011937815,0.009414041],"genre_scores_gemma":[0.98659766,0.00026122856,0.012318252,0.000056282322,0.000016768661,0.000078974546,0.00013921762,0.000018353967,0.00051326514],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872357,0.0006773195,0.000061988256,0.00017548662,0.0002749565,0.00008662879],"domain_scores_gemma":[0.9664478,0.02848144,0.0023033188,0.0011892628,0.0010177097,0.0005605301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051680473,0.0007104039,0.00040992312,0.0007674752,0.00034734266,0.0029716329,0.0012237862,0.0009366768,0.0024883058],"category_scores_gemma":[0.042673744,0.00051785336,0.00065341406,0.0008163635,0.0009096689,0.0023319786,0.0012970442,0.0026134292,0.00031630177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019018411,0.0032876006,0.63767195,0.0004531585,0.0007261812,0.00031475583,0.006551681,0.028816516,0.015316676,0.014856646,0.0014602977,0.28864276],"study_design_scores_gemma":[0.00009206113,0.0010553899,0.7241988,0.00026649825,0.0006332753,0.00025520058,0.002630307,0.21234721,0.005453063,0.051906765,0.0010448948,0.000116471645],"about_ca_topic_score_codex":0.0026315628,"about_ca_topic_score_gemma":0.002481343,"teacher_disagreement_score":0.0051680473,"about_ca_system_score_codex":0.00058991375,"about_ca_system_score_gemma":0.0008906259,"threshold_uncertainty_score":0.02733159},"labels":[],"label_agreement":null},{"id":"W2280812555","doi":"10.1007/978-3-319-12976-1_27","title":"Waveform-Aligned Adaptive Windows for Spectral Component Tracking and Noise Rejection","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","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 Regina","funders":"","keywords":"Short-time Fourier transform; Computer science; Spectrogram; Upsampling; Pipeline (software); Waveform; Algorithm; SIGNAL (programming language); Noise (video); Speech recognition; Fourier transform; Fourier analysis; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.018996242112028393,"score_gpt":0.23917942157962915,"score_spread":0.22018317946760077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280812555","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.006034793,0.0004199188,0.99200845,0.00001656889,0.00006485195,0.00001697699,0.00004929237,0.0005104816,0.00087869127],"genre_scores_gemma":[0.11704638,0.0010406104,0.8734873,0.00006207866,0.000095755095,0.00009665431,0.00045501633,0.0003831055,0.0073330407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978334,0.000031325242,0.000013504321,0.000049510134,0.000100811085,0.00002150457],"domain_scores_gemma":[0.9996897,0.00012265588,0.000026084876,0.00005495773,0.000091726164,0.0000148918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026612953,0.00068624923,0.00038322457,0.00035469848,0.00019657699,0.00048170434,0.0006580505,0.00045385907,0.0039808387],"category_scores_gemma":[0.0011979247,0.00024951808,0.00033078127,0.00069724227,0.00015975694,0.0006774738,0.00055236917,0.0006968819,0.002335607],"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.00060881063,0.000075038646,0.00022263515,0.0001343454,0.000051489467,0.00007338452,0.000064684886,0.010522119,0.28441596,0.009513801,0.0029387928,0.6913789],"study_design_scores_gemma":[0.000058058347,0.0002510788,0.0014614079,0.000054325545,0.00010346822,0.00047513208,0.00004946525,0.6662864,0.2995294,0.0072160927,0.024473475,0.00004169465],"about_ca_topic_score_codex":0.0006362164,"about_ca_topic_score_gemma":0.0013814738,"teacher_disagreement_score":0.0039808387,"about_ca_system_score_codex":0.00016533086,"about_ca_system_score_gemma":0.0003306334,"threshold_uncertainty_score":0.013317227},"labels":[],"label_agreement":null},{"id":"W2280880808","doi":"10.1007/978-3-319-42634-1_16","title":"Minimum Cost Homomorphisms with Constrained Costs","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Graph homomorphism; Combinatorics; Bipartite graph; Interval graph; Discrete mathematics; Chordal graph; Graph; Line graph; Voltage graph","score_opus":0.0196663850493519,"score_gpt":0.2894151307590696,"score_spread":0.2697487457097177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280880808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1677585,0.00092868047,0.7806635,0.0033040363,0.00038602337,0.00021396122,0.0008743728,0.0011656146,0.044705234],"genre_scores_gemma":[0.7249463,0.00086063676,0.24227373,0.00068449345,0.0004524614,0.00041007754,0.00089140364,0.0010252637,0.028455615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975853,0.00067267066,0.00013890813,0.0006029304,0.0006602208,0.00033999098],"domain_scores_gemma":[0.9879265,0.0076421704,0.0006260931,0.001985401,0.0007482096,0.0010717147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021010083,0.0009778873,0.0014506647,0.0017953524,0.0014400965,0.0039442866,0.0031808713,0.0024791982,0.012671074],"category_scores_gemma":[0.018353265,0.0011592302,0.0012483353,0.002546644,0.0021158052,0.011472999,0.004585402,0.006128689,0.0013816468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021056262,0.00012218514,0.0003183275,0.00023814701,0.00003913235,0.00011207976,0.00024383355,0.018254058,0.0022744713,0.9327111,0.005468167,0.0400079],"study_design_scores_gemma":[0.000024798672,0.00002321489,0.00008886981,0.00001949013,0.00001940576,0.00010948148,0.00004871299,0.03137636,0.0009419425,0.9649508,0.0023843069,0.0000125933175],"about_ca_topic_score_codex":0.0006479121,"about_ca_topic_score_gemma":0.0007302037,"teacher_disagreement_score":0.012671074,"about_ca_system_score_codex":0.0017841911,"about_ca_system_score_gemma":0.0011846845,"threshold_uncertainty_score":0.042388976},"labels":[],"label_agreement":null},{"id":"W2280952051","doi":"10.1007/978-3-319-20916-6_39","title":"Trust-Based Individualization for Persuasive Presentation Builder","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Presentation (obstetrics); Personalization; Trustworthiness; Computer science; Face (sociological concept); Advice (programming); Content (measure theory); Multimedia; World Wide Web; Internet privacy; Psychology; Sociology; Medicine","score_opus":0.030936495857346813,"score_gpt":0.30787143241349296,"score_spread":0.27693493655614615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280952051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049715858,0.000363631,0.9320574,0.00045714644,0.00013386291,0.0002721402,0.00014323082,0.004993889,0.011862821],"genre_scores_gemma":[0.79581296,0.00012985509,0.19349004,0.000094325114,0.000080027115,0.00020791333,0.00024408253,0.00027894246,0.009661729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710447,0.0010889359,0.00018712383,0.00060061127,0.00078353373,0.00023537767],"domain_scores_gemma":[0.9871552,0.0067353384,0.0007182243,0.0028272138,0.0020701734,0.00049389957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032131274,0.0009116681,0.00092809874,0.00092830433,0.00086777465,0.0019299752,0.0017167822,0.0015289488,0.01032861],"category_scores_gemma":[0.01952195,0.00053169054,0.00064793957,0.00053694466,0.00077002705,0.004286714,0.0024669783,0.002013133,0.0026757873],"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.0016209718,0.0012545241,0.0038590468,0.0005167461,0.00020176929,0.0003371057,0.0025058202,0.06649316,0.040505227,0.07058069,0.015137445,0.7969875],"study_design_scores_gemma":[0.00007693086,0.00039706103,0.0015029401,0.000054232667,0.00013051432,0.0002267602,0.00041579964,0.89326185,0.020698732,0.07511253,0.008041103,0.000081495295],"about_ca_topic_score_codex":0.0010251142,"about_ca_topic_score_gemma":0.0012797748,"teacher_disagreement_score":0.01032861,"about_ca_system_score_codex":0.00075053104,"about_ca_system_score_gemma":0.00083000155,"threshold_uncertainty_score":0.034552693},"labels":[],"label_agreement":null},{"id":"W2281621524","doi":"10.1007/978-3-642-39112-5_101","title":"Can Online Peer-Review Systems Support Group Mentorship?","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Mentorship; Constructive; Peer feedback; Computer science; Context (archaeology); Publishing; Peer group; Quality (philosophy); Medical education; Multimedia; Mathematics education; Psychology; Medicine; Political science","score_opus":0.0680594612196334,"score_gpt":0.37238557581270726,"score_spread":0.30432611459307385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281621524","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32434192,0.015766498,0.124785185,0.044956516,0.01191178,0.0011903946,0.0007828923,0.011298768,0.46496606],"genre_scores_gemma":[0.7882443,0.004646633,0.0670812,0.002597491,0.0054471046,0.0007725357,0.00046969295,0.00080132455,0.1299397],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.997569,0.0012422709,0.000084553954,0.00017443713,0.00074294285,0.00018679604],"domain_scores_gemma":[0.97741115,0.01500692,0.0016192386,0.002434542,0.0019070253,0.0016210958],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005236238,0.0002994827,0.00036011974,0.0006139726,0.00073179905,0.0028798527,0.0016620102,0.0014520136,0.04386683],"category_scores_gemma":[0.030042922,0.0002062124,0.00039560252,0.00065092446,0.0002918755,0.0042701135,0.001644729,0.0009416873,0.011706198],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003241002,0.0008215237,0.0029455912,0.00033371145,0.000045111083,0.00008757105,0.0005989882,0.00043641677,0.0027042357,0.00547869,0.068161584,0.9180625],"study_design_scores_gemma":[0.0011930071,0.004500634,0.07409816,0.0011491056,0.00043635097,0.0015134584,0.004711962,0.03172237,0.020582642,0.080060065,0.779804,0.00022832183],"about_ca_topic_score_codex":0.00030331154,"about_ca_topic_score_gemma":0.00079698354,"teacher_disagreement_score":0.9947638,"about_ca_system_score_codex":0.00034235528,"about_ca_system_score_gemma":0.00085945235,"threshold_uncertainty_score":0.1467492},"labels":[],"label_agreement":null},{"id":"W2282178548","doi":"10.1007/978-3-319-20913-5_23","title":"HAVAS: The Haptic Audio Visual Sleep Alarm System","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sleep and Work-Related Fatigue","field":"Psychology","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 Ottawa","funders":"","keywords":"ALARM; Computer science; Sleep (system call); Haptic technology; Phone; Smart phone; Inertia; Audio visual; Speech recognition; Simulation; Computer vision; Human–computer interaction; Real-time computing; Artificial intelligence; Multimedia; Telecommunications; Operating system; Electrical engineering","score_opus":0.028443889585612305,"score_gpt":0.29253345919755197,"score_spread":0.2640895696119397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282178548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06962678,0.014136411,0.6863127,0.0011382989,0.0026497408,0.0004983936,0.003590098,0.12631367,0.095733896],"genre_scores_gemma":[0.6153835,0.004846356,0.13954216,0.002019495,0.000897143,0.00039909544,0.003137704,0.003500355,0.23027432],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998661,0.000012373554,0.0000065753247,0.000023622762,0.000074206066,0.000017083812],"domain_scores_gemma":[0.9998568,0.00005770447,0.000009868004,0.000015746873,0.00003574263,0.000024033476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023300386,0.0006065744,0.00031337616,0.00034520877,0.00012940112,0.00065210235,0.0010293468,0.00063500815,0.026833834],"category_scores_gemma":[0.0006057197,0.0002479408,0.00020222852,0.00016863442,0.00013356487,0.00049440033,0.000674355,0.00035432674,0.005269641],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012179734,0.00010870286,0.0009676364,0.00055388646,0.000056969937,0.0003325175,0.00019451868,0.0015704836,0.14997095,0.0025381865,0.07161866,0.77086955],"study_design_scores_gemma":[0.0007070849,0.0026512383,0.019063585,0.0004011314,0.00038963658,0.006122792,0.00031591955,0.09572517,0.17748787,0.0071050725,0.6896572,0.0003732792],"about_ca_topic_score_codex":0.00055847864,"about_ca_topic_score_gemma":0.0007584311,"teacher_disagreement_score":0.026833834,"about_ca_system_score_codex":0.00012494992,"about_ca_system_score_gemma":0.00016905348,"threshold_uncertainty_score":0.08976811},"labels":[],"label_agreement":null},{"id":"W2282572932","doi":"10.1007/3-540-45694-5_24","title":"Weak Bisimulation is Sound and Complete for PCTL*","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Discrete mathematics; Computer science; Countable set; Markov chain; Theoretical computer science; Artificial intelligence","score_opus":0.06391941755167309,"score_gpt":0.3009457811428017,"score_spread":0.2370263635911286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282572932","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.019576753,0.00019937458,0.9411847,0.0010911311,0.00027374324,0.00029420276,0.0005521205,0.009857545,0.026970373],"genre_scores_gemma":[0.51939607,0.0004362738,0.43362123,0.0010255716,0.00025048509,0.0010061775,0.0018423874,0.0053352346,0.037086587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656063,0.00045983383,0.0002588063,0.0006831564,0.0013281829,0.0007093217],"domain_scores_gemma":[0.99260265,0.0038711354,0.00044962196,0.0016410524,0.0011521761,0.00028333082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023821376,0.001609089,0.0012362335,0.0012197695,0.0024520212,0.004602456,0.0018706083,0.0016588428,0.008860557],"category_scores_gemma":[0.009584425,0.0016552678,0.0024051918,0.0014124345,0.005024636,0.007981543,0.0056524607,0.0072192485,0.0044456837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077055814,0.00038446498,0.0010170398,0.0008322159,0.00009087506,0.0003665469,0.0010247867,0.023074301,0.024290042,0.76103246,0.017935807,0.16918093],"study_design_scores_gemma":[0.0001592407,0.0001151469,0.00021169889,0.00006776009,0.0000878725,0.00015770222,0.00013507393,0.06169773,0.05107865,0.8662559,0.019962143,0.00007102056],"about_ca_topic_score_codex":0.002686084,"about_ca_topic_score_gemma":0.004241116,"teacher_disagreement_score":0.008860557,"about_ca_system_score_codex":0.0021426925,"about_ca_system_score_gemma":0.0039366675,"threshold_uncertainty_score":0.029641509},"labels":[],"label_agreement":null},{"id":"W2282911291","doi":"10.1007/978-3-319-24589-8_47","title":"The Impact of Sensor Noise on Player Experience in Magic Window Augmented Reality Aiming Games","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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 Saskatchewan","funders":"","keywords":"Augmented reality; Computer science; Android (operating system); Human–computer interaction; MAGIC (telescope); Computer graphics (images); Noise (video); Window (computing); Computer vision","score_opus":0.054613489707727426,"score_gpt":0.33234135789040864,"score_spread":0.2777278681826812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282911291","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.9792422,0.00044353498,0.010435381,0.00007641109,0.000051526597,0.000023343433,0.00007172266,0.00010279362,0.009553135],"genre_scores_gemma":[0.9958988,0.00013306746,0.0015459431,0.00002172681,0.0000060407847,0.000015297364,0.00004789035,0.000042818607,0.0022885066],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992756,0.00022663281,0.000025848178,0.00008114559,0.00029191285,0.00009878379],"domain_scores_gemma":[0.99724567,0.0021960135,0.00012797731,0.000073154915,0.00022779441,0.00012932025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052891,0.0005572804,0.0003694744,0.0002329852,0.00034739234,0.0017914011,0.00063953665,0.00058400695,0.0066281306],"category_scores_gemma":[0.006424729,0.0003114681,0.00024829022,0.00016630228,0.0003969765,0.0009093202,0.0013837663,0.00046634037,0.0005095364],"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.02339419,0.0026068445,0.04639341,0.0023021311,0.00044915715,0.0025216045,0.012069157,0.048690453,0.5160608,0.010244548,0.0039599915,0.33130777],"study_design_scores_gemma":[0.0004882,0.017772252,0.39028493,0.0009811891,0.0018018007,0.004485903,0.020829277,0.33041412,0.20147674,0.016512979,0.014467379,0.00048529205],"about_ca_topic_score_codex":0.0012055947,"about_ca_topic_score_gemma":0.0014542402,"teacher_disagreement_score":0.0066281306,"about_ca_system_score_codex":0.000275192,"about_ca_system_score_gemma":0.00023721739,"threshold_uncertainty_score":0.022173285},"labels":[],"label_agreement":null},{"id":"W2283099857","doi":"10.1007/978-3-319-10470-6_69","title":"Myocardial Infarct Segmentation and Reconstruction from 2D Late-Gadolinium Enhanced Magnetic Resonance Images","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"National Heart, Lung, and Blood Institute","keywords":"Segmentation; Computer science; Artificial intelligence; Image segmentation; Magnetic resonance imaging; Sørensen–Dice coefficient; Pattern recognition (psychology); Interpolation (computer graphics); Algorithm; Computer vision; Medicine; Image (mathematics); Radiology","score_opus":0.007478926554986211,"score_gpt":0.27098582925940257,"score_spread":0.26350690270441635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283099857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088163435,0.0010356483,0.904641,0.00032515102,0.00007054372,0.00020203725,0.0008665734,0.0029712098,0.0017243964],"genre_scores_gemma":[0.31021988,0.0021724666,0.67948896,0.00025447697,0.00018734646,0.0002139878,0.002490675,0.0009735814,0.0039985985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998061,0.000025131463,0.000016601696,0.000043529915,0.000062029,0.00004673611],"domain_scores_gemma":[0.999747,0.00008391859,0.000034024273,0.000044463875,0.000065707085,0.000025028685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714013,0.0010440517,0.0008552211,0.0021639534,0.00032709527,0.0020657158,0.00084192446,0.0018035913,0.0025030298],"category_scores_gemma":[0.0013668897,0.0012418979,0.0012250125,0.00111,0.00030630032,0.00052955747,0.0007640677,0.0008752555,0.0021385858],"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.0014868805,0.00032959532,0.0070682615,0.0005902941,0.0002399271,0.002375011,0.00040045,0.055121407,0.3266607,0.0028307037,0.0060557667,0.596841],"study_design_scores_gemma":[0.000119027995,0.00042247167,0.023161761,0.00013533095,0.00032720808,0.0061972854,0.00029225717,0.79635316,0.15731394,0.0047997916,0.010729907,0.00014785792],"about_ca_topic_score_codex":0.0019607944,"about_ca_topic_score_gemma":0.0033799342,"teacher_disagreement_score":0.0025030298,"about_ca_system_score_codex":0.00024066422,"about_ca_system_score_gemma":0.0008102209,"threshold_uncertainty_score":0.008373499},"labels":[],"label_agreement":null},{"id":"W2283577276","doi":"10.1007/978-3-642-35261-4_38","title":"The Canadian Traveller Problem Revisited","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"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":"Computer science","score_opus":0.02169896923223257,"score_gpt":0.2440577603377054,"score_spread":0.22235879110547283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283577276","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.042294662,0.008545713,0.02577106,0.031346336,0.0012791828,0.00008838795,0.0012289064,0.00013969389,0.8893062],"genre_scores_gemma":[0.6516061,0.013530682,0.016289983,0.0026535455,0.0008323634,0.00014867124,0.001181959,0.00019667398,0.31356004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00018958496,0.00001869235,0.000114069204,0.00022675552,0.00027285732],"domain_scores_gemma":[0.9990903,0.0003196448,0.000056014436,0.0000802976,0.00023408004,0.0002197094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079800724,0.0008757089,0.0011180722,0.0013610318,0.005393521,0.005663014,0.0029583783,0.0042519355,0.039467186],"category_scores_gemma":[0.0046636905,0.00038215998,0.0007776001,0.0050044563,0.0040976945,0.0040634978,0.0018781474,0.004011524,0.0016536226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032362674,0.0000163623,0.00011547398,0.000050951327,0.00001117697,0.00007712823,0.00011357189,0.0037374897,0.000033860724,0.9448184,0.041417476,0.009575732],"study_design_scores_gemma":[0.000058595917,0.000017243357,0.0006242451,0.000146246,0.000030226782,0.0002802213,0.0015970514,0.013504672,0.00013163629,0.80816203,0.17539324,0.00005457351],"about_ca_topic_score_codex":0.5202329,"about_ca_topic_score_gemma":0.51376337,"teacher_disagreement_score":0.5202329,"about_ca_system_score_codex":0.014297226,"about_ca_system_score_gemma":0.015566276,"threshold_uncertainty_score":0.96518505},"labels":[],"label_agreement":null},{"id":"W2283908050","doi":"10.1007/978-3-319-24704-5","title":"Relational and Algebraic Methods in Computer Science","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","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":"Brock University; McMaster University","funders":"","keywords":"Computer science; Algebraic number; Relational database; Algebra over a field; Information retrieval; Mathematics; Pure mathematics","score_opus":0.04685480116868425,"score_gpt":0.35898781661255985,"score_spread":0.3121330154438756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283908050","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00267103,0.16047533,0.19091372,0.0080397315,0.009015698,0.00011477471,0.00054483546,0.0009793538,0.6272455],"genre_scores_gemma":[0.05925945,0.14823437,0.124644995,0.0026931898,0.016079895,0.00035801242,0.0012227239,0.0012604423,0.64624697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989813,0.00017222187,0.00005480097,0.00013327492,0.00061111496,0.000047251928],"domain_scores_gemma":[0.99898165,0.0005917742,0.000040418006,0.00015372541,0.0001735952,0.0000588023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007154653,0.0011732454,0.0012180019,0.0029654077,0.0012189867,0.0044044266,0.0012458984,0.00075751956,0.03583944],"category_scores_gemma":[0.0022676836,0.00065782043,0.0008172491,0.0062171454,0.0026501832,0.007878808,0.0016996136,0.003337738,0.0136777265],"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.000009272921,0.000023703726,0.000061412466,0.0005005253,0.000015411266,0.000024388059,0.00022923914,0.00057398534,0.00046918992,0.76456034,0.11180152,0.12173101],"study_design_scores_gemma":[0.000008404045,0.000010551976,0.00016879715,0.00019816462,0.000012309691,0.00013536007,0.00007104447,0.0012415074,0.00019776402,0.52109826,0.47684595,0.000011946833],"about_ca_topic_score_codex":0.0010436325,"about_ca_topic_score_gemma":0.0017429654,"teacher_disagreement_score":0.03583944,"about_ca_system_score_codex":0.0019777045,"about_ca_system_score_gemma":0.0013007146,"threshold_uncertainty_score":0.11989486},"labels":[],"label_agreement":null},{"id":"W2284184122","doi":"10.1007/978-3-642-32241-9_35","title":"Lower Bounds against Weakly Uniform Circuits","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Succinctness; Boolean circuit; Electronic circuit; Mathematics; Polynomial; Discrete mathematics; Constant (computer programming); Combinatorics; Time complexity; Connection (principal bundle); Circuit complexity; Boolean function; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.022416987444804165,"score_gpt":0.23848588699634032,"score_spread":0.21606889955153616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284184122","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10674273,0.01704855,0.41857466,0.015170535,0.0021168506,0.0004620338,0.003862111,0.0046042744,0.4314183],"genre_scores_gemma":[0.76079786,0.0111499475,0.097434066,0.005177104,0.0036195542,0.0015384636,0.005724515,0.003359311,0.11119934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99399394,0.0014066827,0.00025174304,0.0010509992,0.0020249847,0.0012716381],"domain_scores_gemma":[0.97341126,0.019858254,0.0008853889,0.0033191054,0.0014360745,0.0010898636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033161098,0.0038415529,0.0032355096,0.004784409,0.0038124598,0.007975894,0.006752348,0.003040401,0.03351585],"category_scores_gemma":[0.023158817,0.0018835939,0.0026152509,0.006497451,0.004190193,0.017117545,0.008949598,0.010417237,0.0068535595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011517153,0.00028043563,0.0007284082,0.0009876966,0.00013016594,0.00012316965,0.00036981233,0.02405825,0.0040493933,0.83785295,0.036876135,0.09339194],"study_design_scores_gemma":[0.00006978954,0.00007251111,0.0002709174,0.00017013976,0.000119054785,0.00010808257,0.00006874085,0.032533284,0.0029288507,0.95192534,0.011701479,0.000031902684],"about_ca_topic_score_codex":0.001342535,"about_ca_topic_score_gemma":0.0021215796,"teacher_disagreement_score":0.03351585,"about_ca_system_score_codex":0.005475181,"about_ca_system_score_gemma":0.0019283886,"threshold_uncertainty_score":0.11212164},"labels":[],"label_agreement":null},{"id":"W2284456400","doi":"10.1007/978-3-642-29946-9_21","title":"A Framework for Computing Bounds for the Return of a Policy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lipschitz continuity; Computer science; Piecewise; Bounding overwatch; Bounded function; Constant (computer programming); Context (archaeology); Markov decision process; Representation (politics); State (computer science); Theoretical computer science; Mathematical optimization; Markov process; Algorithm; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.03357722234187318,"score_gpt":0.3053615565312778,"score_spread":0.2717843341894046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284456400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001336708,0.000280578,0.9969831,0.000090008754,0.000042557367,0.000019850746,0.000045598434,0.00039460632,0.0008070096],"genre_scores_gemma":[0.15526628,0.0008833462,0.83850735,0.00020754874,0.00032875597,0.00037634408,0.0004133889,0.00053419697,0.0034827073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942644,0.0017137635,0.0004105001,0.0012444332,0.0016265566,0.00074037863],"domain_scores_gemma":[0.982287,0.013043123,0.00094985263,0.0018319263,0.0011558719,0.0007321799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101970015,0.002992193,0.0036860015,0.0038491895,0.0015559619,0.00687465,0.006159892,0.004610756,0.007327657],"category_scores_gemma":[0.03514795,0.0024583614,0.003140354,0.0034308902,0.004181515,0.008012778,0.006278137,0.007742045,0.0015105343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026886456,0.000098134784,0.00046372702,0.00018094075,0.00012566458,0.00007884562,0.00015851637,0.59661114,0.0014014331,0.3121282,0.0034088667,0.08507569],"study_design_scores_gemma":[0.00002390508,0.000047707523,0.00006168374,0.0000354151,0.00002670841,0.000020233952,0.000011670266,0.83373946,0.0005016048,0.16419354,0.0013121095,0.000025885614],"about_ca_topic_score_codex":0.007943181,"about_ca_topic_score_gemma":0.0065069017,"teacher_disagreement_score":0.0101970015,"about_ca_system_score_codex":0.0045679067,"about_ca_system_score_gemma":0.0036208392,"threshold_uncertainty_score":0.05392754},"labels":[],"label_agreement":null},{"id":"W2284790019","doi":"10.1007/978-3-319-48472-3_53","title":"Processing Regular Path Queries on Arbitrarily Distributed Data","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University","funders":"","keywords":"Computer science; Path (computing); Query optimization; Graph; Path expression; Distributed database; Theoretical computer science; Matching (statistics); Node (physics); Enhanced Data Rates for GSM Evolution; Data mining; Query language; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.025579819898917777,"score_gpt":0.2560736317503194,"score_spread":0.2304938118514016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284790019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17490333,0.0010267289,0.80725616,0.00096348,0.0002769874,0.00034127675,0.00078343594,0.008404655,0.006043973],"genre_scores_gemma":[0.5596518,0.0006800102,0.42231712,0.00030228525,0.00033851148,0.0003101841,0.0031343477,0.0012026567,0.012063129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971877,0.00041175727,0.00022241913,0.000509374,0.0013063973,0.00036236472],"domain_scores_gemma":[0.99247026,0.0045306445,0.0002824961,0.002009501,0.0005286476,0.00017847348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017272203,0.0010903698,0.0020597146,0.0011155541,0.001058698,0.0022974757,0.0020875153,0.0015263212,0.0050290935],"category_scores_gemma":[0.008896429,0.0006614074,0.0007683288,0.0029811815,0.0013467086,0.005369888,0.003992697,0.0019627765,0.0017878447],"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.0029726762,0.00055937585,0.003936594,0.0009425614,0.0002489358,0.0010822847,0.0013956864,0.1637667,0.07827483,0.07995824,0.035558637,0.63130355],"study_design_scores_gemma":[0.00014049612,0.00024913708,0.00045572993,0.000033413107,0.00005045228,0.00051589037,0.000413445,0.80711854,0.028031476,0.15523598,0.007724118,0.000031331285],"about_ca_topic_score_codex":0.0013573037,"about_ca_topic_score_gemma":0.0018375237,"teacher_disagreement_score":0.0050290935,"about_ca_system_score_codex":0.00078238157,"about_ca_system_score_gemma":0.0011006618,"threshold_uncertainty_score":0.016823947},"labels":[],"label_agreement":null},{"id":"W2284821525","doi":"10.1007/978-3-319-22804-4_27","title":"CINPACT-splines: A Class of $${C^{{\\infty }}}$$ Curves with Compact Support","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Class (philosophy); Mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.018603174503164795,"score_gpt":0.26386780106039576,"score_spread":0.24526462655723097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284821525","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.030345585,0.00458764,0.83899975,0.0008854882,0.00075156643,0.00010806441,0.00088404317,0.0016349646,0.121802896],"genre_scores_gemma":[0.33375484,0.010670198,0.47355476,0.00071551994,0.00090420013,0.0003766033,0.0024191996,0.0018863364,0.17571837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996419,0.000036166388,0.000014576908,0.000076101474,0.00019262846,0.0000387698],"domain_scores_gemma":[0.9994635,0.0001384923,0.00006219448,0.00008834409,0.00015997721,0.00008746136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045983726,0.0009119175,0.0006244747,0.0020482575,0.0005748388,0.0022345653,0.0011302491,0.0008386808,0.0117324535],"category_scores_gemma":[0.002397123,0.00039627287,0.00053107465,0.002694068,0.0016173474,0.0014286988,0.0015164554,0.003335106,0.0027791734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630088,0.000030669053,0.00025346337,0.00020394808,0.000012000876,0.00008089271,0.000115344905,0.013137307,0.0035207341,0.7141986,0.013815061,0.2545557],"study_design_scores_gemma":[0.000037120906,0.00010416259,0.00079359143,0.00027311375,0.0000225002,0.00074571284,0.00008546228,0.14096878,0.005556289,0.5480876,0.30325484,0.000070883354],"about_ca_topic_score_codex":0.0012099354,"about_ca_topic_score_gemma":0.0011952246,"teacher_disagreement_score":0.0117324535,"about_ca_system_score_codex":0.0007380265,"about_ca_system_score_gemma":0.0008814491,"threshold_uncertainty_score":0.039249003},"labels":[],"label_agreement":null},{"id":"W2284853689","doi":"10.1007/978-3-642-21535-3_47","title":"Qualitative Spatial Activity Recognition Using a Complete Platform Based on Passive RFID Tags: Experimentations and Results","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Activity recognition; Process (computing); Context (archaeology); Spatial contextual awareness; Artificial intelligence; Machine learning; Facial recognition system; Ubiquitous computing; Spatial analysis; Human–computer interaction; Data mining; Pattern recognition (psychology); Remote sensing","score_opus":0.15278753937335707,"score_gpt":0.3429613825762379,"score_spread":0.19017384320288086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284853689","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.68428177,0.00029314714,0.31124863,0.00005445827,0.00008531784,0.0002685727,0.00034654248,0.0009934144,0.0024281542],"genre_scores_gemma":[0.9144984,0.00017847384,0.08192965,0.00002349627,0.000009920788,0.00021669934,0.00032656812,0.0000584372,0.0027583935],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898857,0.00022981848,0.000044869583,0.00023734855,0.00037257822,0.00012676166],"domain_scores_gemma":[0.99872595,0.0005598901,0.0000968761,0.00026170298,0.00027491833,0.000080573795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007577138,0.0007397132,0.0007987619,0.0003889444,0.0002972208,0.0007286609,0.001183379,0.00068824884,0.0030733938],"category_scores_gemma":[0.0018130151,0.00027169392,0.0005287046,0.00052171387,0.00075392524,0.000975587,0.0012077079,0.00034927722,0.00092130067],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002925834,0.0013541104,0.0034391142,0.0010109502,0.000093512805,0.00027905073,0.00090569543,0.045192987,0.8018189,0.002204166,0.0006331121,0.14014257],"study_design_scores_gemma":[0.00014861285,0.0060108504,0.0066992156,0.000050752693,0.00012961465,0.00040941074,0.00095550384,0.2717601,0.7085054,0.0023168623,0.0029114068,0.00010218484],"about_ca_topic_score_codex":0.0013197516,"about_ca_topic_score_gemma":0.0006946818,"teacher_disagreement_score":0.0030733938,"about_ca_system_score_codex":0.00039323448,"about_ca_system_score_gemma":0.00045145562,"threshold_uncertainty_score":0.010281503},"labels":[],"label_agreement":null},{"id":"W2284923418","doi":"10.1007/978-3-642-38171-3_29","title":"Constraint-Based Fitness Function for Search-Based Software Testing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Arity; Computer science; Fitness function; Software; Statement (logic); Constraint (computer-aided design); Function (biology); Theoretical computer science; Programming language; Machine learning; Mathematics","score_opus":0.044692900339624184,"score_gpt":0.26765899978498825,"score_spread":0.22296609944536405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284923418","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.014175922,0.00043244526,0.98067975,0.000113904,0.000045927904,0.000054285993,0.0000927379,0.00042703762,0.003977977],"genre_scores_gemma":[0.49312153,0.00039835428,0.4992051,0.000122016725,0.00006213026,0.00028475723,0.00047748705,0.00037994416,0.0059486683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989992,0.00032864272,0.000056073994,0.000099325065,0.00043713994,0.0000795524],"domain_scores_gemma":[0.99805695,0.0013062891,0.00009060083,0.00013332022,0.0003678438,0.000044985172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012418134,0.0009015863,0.0010331421,0.0011946908,0.00036768892,0.00078593806,0.0016159465,0.0013157562,0.0043467716],"category_scores_gemma":[0.0060963547,0.0002850977,0.0007303488,0.0014004243,0.00057118473,0.0009583621,0.0008086998,0.0010356831,0.00047150344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013609197,0.000120780955,0.00083390885,0.00015757387,0.000064003594,0.00013136705,0.000057536443,0.7281257,0.0076104756,0.026480455,0.0033964317,0.23288561],"study_design_scores_gemma":[0.000012750952,0.000028915843,0.00020556261,0.00001431292,0.000011639253,0.000041496896,0.000004078342,0.9928243,0.00073039875,0.0055106264,0.0006090979,0.0000068080094],"about_ca_topic_score_codex":0.0050160782,"about_ca_topic_score_gemma":0.0034647814,"teacher_disagreement_score":0.0050160782,"about_ca_system_score_codex":0.0008162549,"about_ca_system_score_gemma":0.0008343335,"threshold_uncertainty_score":0.014541328},"labels":[],"label_agreement":null},{"id":"W2285020644","doi":"10.1007/978-3-642-21640-4_45","title":"Understanding the Diversity of Services Based on Users’ Identities","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Diversity (politics); World Wide Web; Sociology; Anthropology","score_opus":0.04349536931616274,"score_gpt":0.22515719773018913,"score_spread":0.1816618284140264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285020644","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30006003,0.0025468848,0.59982204,0.0083238045,0.00017257144,0.000079487756,0.00029586419,0.00030597553,0.088393316],"genre_scores_gemma":[0.95528424,0.00057398604,0.04172792,0.0002433232,0.00009192977,0.00004481021,0.00014819395,0.000062593695,0.0018231411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99466395,0.0023397238,0.00021777728,0.0009119138,0.0013899239,0.00047661838],"domain_scores_gemma":[0.98540163,0.010279313,0.0007354211,0.0018962445,0.0010884383,0.00059888297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00502528,0.0004986711,0.0010439339,0.002852058,0.002110439,0.008908988,0.0017522991,0.0019333084,0.0031062192],"category_scores_gemma":[0.01998936,0.00072135584,0.0007941131,0.0026953085,0.0069390754,0.02819651,0.005023421,0.0032175544,0.00037310657],"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.000076739954,0.000024045567,0.0035983094,0.000043669264,0.000026839507,0.000087436,0.0044327443,0.003459312,0.0011881394,0.9607255,0.0007959374,0.025541449],"study_design_scores_gemma":[0.000008465657,0.000013278246,0.0012719963,0.000031220206,0.000020900274,0.00013904783,0.0020091548,0.02850052,0.00049528445,0.9619768,0.0055155684,0.000017695475],"about_ca_topic_score_codex":0.0032164492,"about_ca_topic_score_gemma":0.0019698022,"teacher_disagreement_score":0.008908988,"about_ca_system_score_codex":0.0022476322,"about_ca_system_score_gemma":0.0010318353,"threshold_uncertainty_score":0.026576579},"labels":[],"label_agreement":null},{"id":"W2285664202","doi":"10.1007/978-3-642-30353-1_31","title":"Curriculum Learning for Motor Skills","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","cited_by":43,"is_retracted":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":"Curriculum; Motor skill; Computer science; Set (abstract data type); Parameterized complexity; Process (computing); Motor learning; Mathematics education; Repertoire; Artificial intelligence; Psychology; Pedagogy; Programming language","score_opus":0.009425340843274387,"score_gpt":0.22418584361439578,"score_spread":0.21476050277112138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285664202","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031247552,0.015729683,0.08127845,0.0047483584,0.0011711657,0.00030747126,0.00028454117,0.001021926,0.8642108],"genre_scores_gemma":[0.24955793,0.02383366,0.074517794,0.0019752805,0.0006160305,0.0007126234,0.0010898834,0.00033400956,0.64736277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974495,0.00004164076,0.000010682875,0.000043968364,0.00010368996,0.000054989763],"domain_scores_gemma":[0.9995987,0.00011243612,0.000032930457,0.000034302328,0.00009854967,0.00012311417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565898,0.0006884765,0.00038266237,0.0007078474,0.000479117,0.0010798805,0.00094191526,0.0006721356,0.03552481],"category_scores_gemma":[0.0013436619,0.00018546557,0.00036766386,0.0005738558,0.00051276083,0.0013228877,0.0020910713,0.0015425634,0.007351872],"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.000045347355,0.00061080925,0.0005253342,0.00066467735,0.000012589516,0.00008242926,0.0005714464,0.0015141099,0.0035922045,0.07381741,0.054095805,0.8644678],"study_design_scores_gemma":[0.00006149538,0.0004942737,0.0089136455,0.0021168576,0.000035703353,0.000523962,0.00080040924,0.0036416955,0.008907732,0.1896159,0.78485966,0.00002875049],"about_ca_topic_score_codex":0.00062823587,"about_ca_topic_score_gemma":0.002248906,"teacher_disagreement_score":0.03552481,"about_ca_system_score_codex":0.0009758022,"about_ca_system_score_gemma":0.0017601798,"threshold_uncertainty_score":0.11884236},"labels":[],"label_agreement":null},{"id":"W2286276931","doi":"10.1007/978-3-642-38911-5_4","title":"Modeling Early Availability Requirements Using Aspect-Oriented Use Case Maps","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis 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; University of Ottawa","funders":"","keywords":"Computer science; Dependability; Requirements elicitation; Software engineering; Requirements analysis; Notation; Non-functional requirement; Functional requirement; Unified Modeling Language; Software development; Software; Programming language; Software construction","score_opus":0.06769988310583246,"score_gpt":0.3026688174043542,"score_spread":0.23496893429852173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286276931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12818183,0.0002825217,0.85215753,0.00028780175,0.000039101542,0.0003502811,0.00050537137,0.0022521878,0.01594334],"genre_scores_gemma":[0.6780947,0.00038242858,0.31476355,0.000047463393,0.000022688424,0.00026633605,0.0006751794,0.00048658354,0.005261177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997877,0.00058388244,0.00013572689,0.00018916375,0.0009981681,0.00021611791],"domain_scores_gemma":[0.993455,0.0043710703,0.00062720076,0.0006377741,0.00078173244,0.00012715039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002256695,0.0012408841,0.0005530867,0.0021425313,0.00050912256,0.0026922738,0.0021886064,0.0011867085,0.0032732638],"category_scores_gemma":[0.008383442,0.0011202829,0.0014510646,0.0012622854,0.00056943035,0.0030297716,0.0012679483,0.0014037985,0.00061275926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012740704,0.00021949853,0.006748859,0.00027623886,0.00009989874,0.0012150425,0.00084823556,0.86655754,0.011163524,0.043784644,0.001462255,0.06749684],"study_design_scores_gemma":[0.00000727936,0.00002864186,0.00068416825,0.000033334476,0.000037074264,0.00013131952,0.000090734,0.98125297,0.0033807715,0.010722221,0.003614609,0.000016946176],"about_ca_topic_score_codex":0.008659154,"about_ca_topic_score_gemma":0.011176487,"teacher_disagreement_score":0.008659154,"about_ca_system_score_codex":0.0010390962,"about_ca_system_score_gemma":0.0011852318,"threshold_uncertainty_score":0.017217517},"labels":[],"label_agreement":null},{"id":"W2286286503","doi":"10.1007/978-3-319-49487-6_3","title":"Theoretical Analysis of the k-Means Algorithm – A Survey","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Heuristics; Algorithm; Cluster analysis; Extension (predicate logic); Simplicity; k-means clustering; Artificial intelligence","score_opus":0.018668256590251276,"score_gpt":0.28678644875811515,"score_spread":0.26811819216786387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286286503","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035645673,0.1635648,0.79161525,0.004567097,0.001208053,0.00006718446,0.0004296143,0.00033935605,0.034644097],"genre_scores_gemma":[0.10652284,0.30794555,0.55424565,0.0036665692,0.010294799,0.00041365012,0.0017209644,0.0008169499,0.014372993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667716,0.00085582247,0.00021239439,0.00063440704,0.0014415407,0.00017861059],"domain_scores_gemma":[0.9941472,0.0041103377,0.00019613447,0.0005489387,0.00088350166,0.00011388064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032235826,0.0017918054,0.0026452346,0.0038696926,0.0016721331,0.0056586605,0.00467318,0.0030106625,0.0074631115],"category_scores_gemma":[0.012415451,0.0015304369,0.0018542866,0.010025845,0.003334873,0.00754407,0.0029901438,0.005484617,0.0045348783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006667871,0.0001413233,0.00079959416,0.0024856103,0.000118087024,0.000079882935,0.00022294138,0.042336185,0.00073436176,0.62500966,0.025873395,0.30213237],"study_design_scores_gemma":[0.000017150815,0.00005349837,0.00051221263,0.00051094947,0.000053506134,0.00032907745,0.00010400654,0.12743454,0.0007870167,0.78221893,0.08792611,0.000052992116],"about_ca_topic_score_codex":0.0032456703,"about_ca_topic_score_gemma":0.002310704,"teacher_disagreement_score":0.0074631115,"about_ca_system_score_codex":0.0036344668,"about_ca_system_score_gemma":0.0032596937,"threshold_uncertainty_score":0.026370049},"labels":[],"label_agreement":null},{"id":"W2286998371","doi":"10.1007/978-3-319-13969-2_32","title":"A live Augmented Reality Tool for Facilitating Interpretation of 2D Construction Drawings","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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 Sherbrooke; Bentley (Canada)","funders":"","keywords":"Computer science; Representation (politics); Augmented reality; Set (abstract data type); Technical drawing; Human–computer interaction; Process (computing); Computer graphics (images); Engineering drawing; Perception; Interpretation (philosophy); Programming language; Engineering","score_opus":0.016204272502389056,"score_gpt":0.2678364697294181,"score_spread":0.25163219722702906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286998371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008784176,0.0005687099,0.9528321,0.00013178217,0.0001776339,0.00016085425,0.0007884326,0.010284218,0.026272172],"genre_scores_gemma":[0.12100971,0.0015864652,0.8287882,0.0001496722,0.00008665098,0.00038433485,0.0020722784,0.0034743757,0.042448323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935204,0.00011074271,0.0000289074,0.000088525674,0.00037021574,0.00004942293],"domain_scores_gemma":[0.9990158,0.0004999849,0.000035292833,0.0002810884,0.00013026402,0.000037523587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048209776,0.001490087,0.00063657726,0.0013234686,0.0005310587,0.0026693323,0.0021621955,0.0012194592,0.054292064],"category_scores_gemma":[0.0020570122,0.0012066322,0.0009318153,0.00092181115,0.000676031,0.0018036807,0.0032703392,0.0013370005,0.0075043426],"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.00035502113,0.00014206371,0.00038237957,0.00088117935,0.000057501715,0.0012315884,0.0031306641,0.009648285,0.1069562,0.029543897,0.0350584,0.8126129],"study_design_scores_gemma":[0.00018724317,0.00046148148,0.0040485854,0.00061912555,0.00020032242,0.007501414,0.0017487421,0.12603116,0.15360291,0.022392662,0.68275994,0.00044640532],"about_ca_topic_score_codex":0.0009872726,"about_ca_topic_score_gemma":0.0018450816,"teacher_disagreement_score":0.054292064,"about_ca_system_score_codex":0.00028069387,"about_ca_system_score_gemma":0.00050378795,"threshold_uncertainty_score":0.18162507},"labels":[],"label_agreement":null},{"id":"W2287320187","doi":"10.1007/978-3-642-45278-9_34","title":"Circuit Complexity of Shuffle","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"","keywords":"Computer science; String (physics); Circuit complexity; Reduction (mathematics); Computational complexity theory; Combinatorics; Discrete mathematics; Upper and lower bounds; Parity (physics); Theoretical computer science; Mathematics; Algorithm; Electronic circuit; Physics; Quantum mechanics","score_opus":0.04321056273481346,"score_gpt":0.25380700085244984,"score_spread":0.21059643811763637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287320187","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.21413302,0.0056431848,0.16158205,0.0072301235,0.00068658363,0.00013533863,0.001933652,0.0005966888,0.6080594],"genre_scores_gemma":[0.89381164,0.0037085616,0.019150551,0.00074828067,0.0007177913,0.00019955626,0.0011689528,0.00031759753,0.08017704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929464,0.000109829336,0.000027047223,0.00011026151,0.00033194065,0.00012633856],"domain_scores_gemma":[0.99844104,0.0009576183,0.00007960856,0.00028501934,0.00014634801,0.00009026219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003943885,0.00046362885,0.00066152844,0.0008809499,0.00094657054,0.00307827,0.0011479914,0.0010201616,0.020957],"category_scores_gemma":[0.0028031548,0.00041312742,0.00065684406,0.0016393977,0.0013457445,0.0048466697,0.0013156672,0.002753699,0.0024110244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060856237,0.000031324555,0.00016485446,0.00009464943,0.000010688076,0.000033095737,0.00006829824,0.0060933568,0.0008791986,0.9618491,0.007427502,0.023287052],"study_design_scores_gemma":[0.00001115244,0.000010736781,0.0001538085,0.0000132708055,0.000007045457,0.000050678165,0.000015599728,0.0064001502,0.0007203239,0.98681474,0.00579459,0.000007958616],"about_ca_topic_score_codex":0.00087916845,"about_ca_topic_score_gemma":0.0010106277,"teacher_disagreement_score":0.020957,"about_ca_system_score_codex":0.0021528895,"about_ca_system_score_gemma":0.0012138058,"threshold_uncertainty_score":0.070108116},"labels":[],"label_agreement":null},{"id":"W22873392","doi":"10.1007/978-3-642-22092-0_50","title":"Generalized Sparse Regularization with Application to fMRI Brain Decoding","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Interpretability; Computer science; Curse of dimensionality; Regularization (linguistics); Lasso (programming language); Artificial intelligence; Machine learning; Neural coding; Sparse approximation; Support vector machine; Pattern recognition (psychology); Elastic net regularization; Feature selection","score_opus":0.02277957863194294,"score_gpt":0.2502469817624809,"score_spread":0.22746740313053795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22873392","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.0024405057,0.0001529439,0.99658716,0.00013256808,0.000019882338,0.000013214139,0.00003093203,0.00035392356,0.000268903],"genre_scores_gemma":[0.08520791,0.0005149279,0.9089982,0.00016974774,0.00011910894,0.00012967866,0.0002741501,0.00050133996,0.00408487],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.00019403074,0.000019553305,0.000059620423,0.0000800273,0.000027123318],"domain_scores_gemma":[0.99868745,0.000856799,0.00006120902,0.00015770493,0.00019206556,0.00004477259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181431,0.0009095308,0.0012404267,0.00067820697,0.0004138083,0.0007492637,0.0011254895,0.0019202305,0.0024178927],"category_scores_gemma":[0.0053789625,0.00066693145,0.0009688096,0.0012362807,0.0007162211,0.00094051904,0.0016852677,0.0018990004,0.00097445317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022176604,0.0001434917,0.00038428823,0.00029093854,0.00017716749,0.00018553188,0.00019346985,0.43563396,0.03660928,0.037956167,0.008195722,0.4800082],"study_design_scores_gemma":[0.000009831349,0.000017141861,0.00009197529,0.0000048566053,0.0000099831705,0.00004637254,0.0000062305776,0.98283285,0.0026425654,0.013293833,0.0010351914,0.000009176007],"about_ca_topic_score_codex":0.0031794368,"about_ca_topic_score_gemma":0.0046117455,"teacher_disagreement_score":0.0031794368,"about_ca_system_score_codex":0.00026819963,"about_ca_system_score_gemma":0.00093223655,"threshold_uncertainty_score":0.008088648},"labels":[],"label_agreement":null},{"id":"W2287431757","doi":"10.1007/3-540-44520-x_50","title":"Identifying and Validating Irregular Mutual Exclusion Synchronization in Explicitly Parallel Programs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Alberta","funders":"","keywords":"Semaphore; Mutual exclusion; Computer science; Lock (firearm); Compiler; Deadlock; Synchronization (alternating current); Code (set theory); Parallel computing; Distributed computing; Programming language; Computer network","score_opus":0.023040141872864635,"score_gpt":0.26301764083087753,"score_spread":0.2399774989580129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287431757","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.21689111,0.00025627218,0.76902205,0.0003907766,0.0001668699,0.00016917005,0.000119467244,0.007526055,0.005458239],"genre_scores_gemma":[0.8790271,0.00010659216,0.117751904,0.000098962,0.000047672147,0.0001029309,0.00022177062,0.0007064315,0.0019366335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99028325,0.0033259117,0.00060925755,0.0013474432,0.0032231905,0.0012109892],"domain_scores_gemma":[0.9518195,0.027308201,0.004476041,0.012779037,0.0031531618,0.00046407105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056279534,0.0007525284,0.001117832,0.0011439152,0.0017321158,0.0034816787,0.0026853664,0.0020277114,0.0015493392],"category_scores_gemma":[0.041285057,0.0011931156,0.00072954124,0.0010984129,0.0040687616,0.0053196177,0.0046627764,0.0029828714,0.00046971356],"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.0020435231,0.000509354,0.036148373,0.00067028194,0.00018430223,0.0012369385,0.0036152294,0.29325238,0.05677727,0.35999748,0.005385443,0.2401794],"study_design_scores_gemma":[0.00007134515,0.00017450342,0.002312698,0.00011059073,0.00008348989,0.0003376008,0.00036872385,0.7584,0.09010262,0.14172085,0.006244895,0.00007264679],"about_ca_topic_score_codex":0.0021098685,"about_ca_topic_score_gemma":0.002337033,"teacher_disagreement_score":0.0056279534,"about_ca_system_score_codex":0.0014531604,"about_ca_system_score_gemma":0.0029045797,"threshold_uncertainty_score":0.029763877},"labels":[],"label_agreement":null},{"id":"W2287461941","doi":"10.1007/978-3-319-20901-2_49","title":"Automatic Interpretation of Negotiators’ Affect and Involvement Based on Their Non-verbal Behavior","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language, Metaphor, and Cognition","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonverbal communication; Negotiation; Affect (linguistics); Interpretation (philosophy); Computer science; Cognitive psychology; Human–computer interaction; Psychology; Communication","score_opus":0.02263814476953049,"score_gpt":0.28914052936876133,"score_spread":0.26650238459923087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287461941","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.8509148,0.0005562929,0.065843605,0.0003766468,0.00012647046,0.00012591544,0.00044768924,0.00044369302,0.08116492],"genre_scores_gemma":[0.9900525,0.00009224545,0.0074220337,0.00004644417,0.000028379354,0.000060168197,0.00017268103,0.00011066066,0.002014946],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989496,0.00039314784,0.0000367392,0.00028936836,0.00023260072,0.00009856761],"domain_scores_gemma":[0.99393374,0.0040888125,0.0007806252,0.00053661456,0.00044574714,0.00021447988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013937285,0.0003428699,0.0002639863,0.0007022373,0.00033592706,0.0028907808,0.00048379533,0.000597599,0.005982161],"category_scores_gemma":[0.014147989,0.00037454878,0.00035812805,0.0004887086,0.0007461918,0.0016867499,0.0008939238,0.0009078758,0.0008201247],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030983668,0.00060253846,0.15502399,0.0007881625,0.0003711056,0.000806614,0.02539695,0.0051368778,0.42048392,0.07746211,0.0037079551,0.30712134],"study_design_scores_gemma":[0.00013285551,0.0004503957,0.79802203,0.00017362444,0.00023337893,0.0009865538,0.005321354,0.07269337,0.03584341,0.08081724,0.005130866,0.00019490987],"about_ca_topic_score_codex":0.0004170314,"about_ca_topic_score_gemma":0.0003619905,"teacher_disagreement_score":0.005982161,"about_ca_system_score_codex":0.00029340334,"about_ca_system_score_gemma":0.00024221689,"threshold_uncertainty_score":0.02001232},"labels":[],"label_agreement":null},{"id":"W2287897145","doi":"10.1007/978-3-642-23878-9_50","title":"From Alternative Clustering to Robust Clustering and Its Application to Gene Expression Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University; University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Correctness; Single-linkage clustering; Cluster (spacecraft); CURE data clustering algorithm; Determining the number of clusters in a data set; Clustering high-dimensional data; Correlation clustering; Homogeneity (statistics); Fuzzy clustering; Homogeneous; Centroid; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.044707279064960685,"score_gpt":0.2811377993605606,"score_spread":0.2364305202955999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287897145","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.0016544304,0.00075051823,0.9963863,0.00016141185,0.00007706828,0.000020166275,0.000069876565,0.0004726805,0.0004075742],"genre_scores_gemma":[0.03340529,0.0012566398,0.9617097,0.00016188032,0.00022368094,0.00014248198,0.00049370993,0.0006083424,0.0019984138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651754,0.001237238,0.00023799887,0.00065913907,0.0012352207,0.00011296253],"domain_scores_gemma":[0.9936156,0.0036925478,0.00024928036,0.001269931,0.0010598862,0.00011270998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004142817,0.0011340512,0.0018143868,0.0031512564,0.0008310125,0.0021292435,0.0033632065,0.0020531407,0.0029677334],"category_scores_gemma":[0.014614702,0.0011817659,0.0026911164,0.0057286494,0.0018249793,0.0024611473,0.0035672702,0.002999515,0.0017829218],"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.0002473134,0.00008516898,0.0009331988,0.00069857447,0.00035950888,0.00023380776,0.00046066733,0.11447112,0.013982859,0.09039476,0.012946852,0.76518625],"study_design_scores_gemma":[0.000020160971,0.000064219224,0.0009700199,0.000048033988,0.00007196342,0.00033574473,0.000075077805,0.7809338,0.004517526,0.200916,0.011963991,0.00008348635],"about_ca_topic_score_codex":0.0032090826,"about_ca_topic_score_gemma":0.0035224224,"teacher_disagreement_score":0.004142817,"about_ca_system_score_codex":0.0008463463,"about_ca_system_score_gemma":0.0009976166,"threshold_uncertainty_score":0.021909595},"labels":[],"label_agreement":null},{"id":"W2288073247","doi":"10.1007/978-3-642-28076-4_16","title":"On the Hardness of Point-Set Embeddability","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Set (abstract data type); Point (geometry); Algorithm; Programming language; Mathematics; Geometry","score_opus":0.02612102366593928,"score_gpt":0.2599388095595426,"score_spread":0.23381778589360336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288073247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.274419,0.010222809,0.37676007,0.014258109,0.0012736003,0.00018169628,0.0022198209,0.0011030925,0.31956184],"genre_scores_gemma":[0.8929979,0.0066751335,0.051272444,0.0012482512,0.0018479351,0.0003124252,0.0021828117,0.00070316956,0.04275991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984463,0.0003004019,0.00007825451,0.00035776605,0.0006164682,0.00020099866],"domain_scores_gemma":[0.98904115,0.0088170385,0.0003824692,0.0010390372,0.00040467616,0.00031566503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011070874,0.0011869005,0.0019908035,0.0017177884,0.0016565188,0.0039216815,0.002956435,0.00259721,0.017852709],"category_scores_gemma":[0.010999531,0.0010931169,0.0016439509,0.002517363,0.0055346447,0.013011706,0.005161168,0.008900184,0.002283419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026583372,0.00008655085,0.0007038054,0.00054270227,0.00005058384,0.00023831408,0.00053828687,0.018685622,0.0022365472,0.9282843,0.011244967,0.037122436],"study_design_scores_gemma":[0.000032075568,0.00002462328,0.000301785,0.00003512008,0.000014189511,0.00011579092,0.00008120474,0.011292136,0.00052169117,0.984185,0.0033820597,0.000014339503],"about_ca_topic_score_codex":0.0010119235,"about_ca_topic_score_gemma":0.0006362609,"teacher_disagreement_score":0.017852709,"about_ca_system_score_codex":0.0013529848,"about_ca_system_score_gemma":0.00045648534,"threshold_uncertainty_score":0.0597232},"labels":[],"label_agreement":null},{"id":"W2289089659","doi":"10.1007/978-3-319-26784-5_9","title":"Rumours Spread Slowly in a Small World Spatial Network","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Pacific Institute for the Mathematical Sciences; Dalhousie University","funders":"","keywords":"Computer science; Distance; Spatial network; Metric (unit); Random graph; Metric space; Graph; Theoretical computer science; Small-world network; Combinatorics; Discrete mathematics; Complex network; Mathematics; Shortest path problem; World Wide Web","score_opus":0.03563427540586068,"score_gpt":0.2445023864282399,"score_spread":0.20886811102237923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289089659","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.7845147,0.0015219348,0.20209204,0.0017480012,0.000113253256,0.00010629798,0.0003580562,0.00047380736,0.0090719545],"genre_scores_gemma":[0.9873679,0.0007802484,0.007110597,0.00008407802,0.00008110294,0.0000397634,0.00011372437,0.000047732596,0.004374842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994604,0.00023391208,0.00002033216,0.000097175514,0.00010158812,0.00008646696],"domain_scores_gemma":[0.98345584,0.012987794,0.0014019075,0.0007962334,0.00072839984,0.0006298079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014901373,0.00058331824,0.001022717,0.0018770295,0.0015037224,0.0018957432,0.0016042267,0.0019634268,0.001899464],"category_scores_gemma":[0.016403956,0.00079895026,0.00049370475,0.001663499,0.0019779173,0.0036673588,0.0014745825,0.0013796273,0.00039382683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010365241,0.00014422319,0.009099089,0.0003897258,0.00021517901,0.0017167064,0.001323655,0.7364656,0.009006766,0.20648393,0.006120951,0.027997741],"study_design_scores_gemma":[0.000064987864,0.000109022,0.0015988454,0.000027555092,0.000064747954,0.00037197335,0.0004080786,0.91751134,0.0009535726,0.07755769,0.0012973621,0.00003473888],"about_ca_topic_score_codex":0.0043389695,"about_ca_topic_score_gemma":0.0031567449,"teacher_disagreement_score":0.0043389695,"about_ca_system_score_codex":0.0012502522,"about_ca_system_score_gemma":0.00048254695,"threshold_uncertainty_score":0.009071231},"labels":[],"label_agreement":null},{"id":"W2289544687","doi":"10.1007/978-3-319-09940-8_2","title":"Detecting Program Execution Phases Using Heuristic Search","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","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":"Université de Montréal","funders":"","keywords":"Computer science; Heuristic; Artificial intelligence","score_opus":0.04170009338257575,"score_gpt":0.3274090775574338,"score_spread":0.28570898417485807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289544687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16429439,0.0011551268,0.8202557,0.0001878427,0.000043085158,0.00037992053,0.00072024507,0.008272653,0.0046909675],"genre_scores_gemma":[0.44874674,0.000256524,0.5470668,0.0000961455,0.000022945143,0.00020157873,0.0013962665,0.0004270109,0.0017859254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990414,0.00021116891,0.00006757762,0.0002301794,0.0003108624,0.00013891015],"domain_scores_gemma":[0.9958287,0.0029145218,0.00041557048,0.00032410468,0.00040947157,0.00010758502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076632964,0.0014743024,0.0014615101,0.003974208,0.0006962356,0.0010515879,0.0017391158,0.0011488141,0.0025501105],"category_scores_gemma":[0.0046796007,0.0007508479,0.001289964,0.002311202,0.00063536316,0.0013806156,0.0007361808,0.0007615885,0.00061889976],"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.0014281223,0.00062454806,0.01735535,0.0008345772,0.000316127,0.00040710447,0.00023093233,0.28564987,0.042043705,0.008789085,0.0054788063,0.6368417],"study_design_scores_gemma":[0.00007324754,0.0001793086,0.0015432144,0.000039672104,0.0001143704,0.00016215164,0.00009777517,0.9795028,0.009750519,0.007561384,0.0009519345,0.000023659788],"about_ca_topic_score_codex":0.005069379,"about_ca_topic_score_gemma":0.008306751,"teacher_disagreement_score":0.005069379,"about_ca_system_score_codex":0.0007113903,"about_ca_system_score_gemma":0.0021832928,"threshold_uncertainty_score":0.0100797415},"labels":[],"label_agreement":null},{"id":"W2290715051","doi":"10.1007/978-3-642-45346-5_17","title":"Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Carleton University","funders":"","keywords":"Robot; Asynchronous communication; Mobile robot; Computer science; Visibility; State space; RADIUS; Point (geometry); State (computer science); Space (punctuation); Distributed computing; Topology (electrical circuits); Algorithm; Artificial intelligence; Mathematics; Computer network; Geometry; Combinatorics; Physics","score_opus":0.014945474727716263,"score_gpt":0.2465486846677044,"score_spread":0.23160320993998815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290715051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2637039,0.0014106358,0.7176241,0.0007733247,0.0003606402,0.00009786892,0.00021837663,0.00036573195,0.015445346],"genre_scores_gemma":[0.97003704,0.00060637825,0.01927173,0.00009628239,0.0001363345,0.000091755704,0.0001227361,0.0000698307,0.009567833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996043,0.00010545606,0.000028655202,0.000109165085,0.00007746576,0.00007501926],"domain_scores_gemma":[0.9967109,0.0018501815,0.0005662119,0.0003137476,0.0002481758,0.0003108381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008045799,0.0006431999,0.0010712143,0.00093165325,0.0007330351,0.0012345256,0.0020297552,0.0015624675,0.0021285343],"category_scores_gemma":[0.006764043,0.0005842959,0.000801472,0.0006362673,0.002092887,0.0024351242,0.0026019253,0.00093393517,0.00030740554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028007713,0.000055054454,0.0012388659,0.00025633397,0.00007275565,0.00058677443,0.00033230468,0.61267114,0.007011445,0.3630555,0.0022943963,0.012145356],"study_design_scores_gemma":[0.000052938154,0.000060103885,0.0003148858,0.000017382541,0.00001760654,0.00009536231,0.000047126035,0.92234796,0.00053152547,0.075752705,0.00074385485,0.000018521627],"about_ca_topic_score_codex":0.002113859,"about_ca_topic_score_gemma":0.0011360754,"teacher_disagreement_score":0.0021285343,"about_ca_system_score_codex":0.0007847609,"about_ca_system_score_gemma":0.00046906527,"threshold_uncertainty_score":0.007120669},"labels":[],"label_agreement":null},{"id":"W2291671097","doi":"10.1007/978-3-642-40849-6_63","title":"A Prandtl-Ishlinskii Model for Characterizing Asymmetric and Saturated Hysteresis of Smart Material Actuators","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Piezoelectric Actuators and Control","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":"Concordia University","funders":"","keywords":"Actuator; Hysteresis; Amplitude; Control theory (sociology); Prandtl number; Saturation (graph theory); Nonlinear system; Asymmetry; Magnetostriction; Describing function; Range (aeronautics); Physics; Mechanics; Acoustics; Materials science; Mathematics; Engineering; Condensed matter physics; Computer science; Optics; Convection; Electrical engineering","score_opus":0.009533143134127417,"score_gpt":0.19635288602646264,"score_spread":0.18681974289233522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291671097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016826155,0.0015500662,0.95796144,0.00038443707,0.0001541074,0.00008044164,0.00018885508,0.00034663774,0.02250783],"genre_scores_gemma":[0.91089904,0.001747987,0.0568068,0.00028367256,0.0001727017,0.0003565866,0.00028988582,0.00014918858,0.029294077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998159,0.000046235084,0.00001132116,0.000038680515,0.00006570522,0.00002219467],"domain_scores_gemma":[0.99973625,0.00010841605,0.000032272474,0.00003877079,0.000066755616,0.00001752577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099205,0.00085234694,0.0011871962,0.0006084081,0.00043797106,0.0010033036,0.0018521583,0.001995396,0.003185088],"category_scores_gemma":[0.001045252,0.00043872718,0.00083290605,0.0005147784,0.00087724964,0.0018813226,0.0007974751,0.0013728825,0.00077248376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009628097,0.00016904624,0.00040832502,0.0004631754,0.000064906904,0.00025102397,0.00036287215,0.6380381,0.040777087,0.28676212,0.0035048027,0.029102229],"study_design_scores_gemma":[0.000004331052,0.00001629344,0.00007263645,0.000008844754,0.000007016321,0.000025452944,0.000011823789,0.9796459,0.0006914949,0.018621556,0.0008858679,0.000008759051],"about_ca_topic_score_codex":0.0014646462,"about_ca_topic_score_gemma":0.0017754077,"teacher_disagreement_score":0.003185088,"about_ca_system_score_codex":0.00066559797,"about_ca_system_score_gemma":0.0006021854,"threshold_uncertainty_score":0.010655224},"labels":[],"label_agreement":null},{"id":"W2292030126","doi":"10.1007/978-3-642-21043-3_35","title":"Granular State Space Search","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Granular computing; Abstraction; Computer science; Rough set; Theoretical computer science; State (computer science); Hierarchy; State space; Graph; Set (abstract data type); Space (punctuation); Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.02863960850834845,"score_gpt":0.24347502102491295,"score_spread":0.2148354125165645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292030126","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.019636976,0.0015038805,0.9520595,0.000448443,0.0001689771,0.00010000664,0.00029239646,0.0008852458,0.024904545],"genre_scores_gemma":[0.6144809,0.001642429,0.35226414,0.00027758896,0.00014228326,0.00034095408,0.0011617729,0.00031340445,0.029376516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996007,0.00008606369,0.000028070592,0.00009219331,0.00014033758,0.00005260732],"domain_scores_gemma":[0.99944013,0.0003113126,0.000038578244,0.0001160469,0.000058895806,0.00003508595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000818706,0.00064885884,0.001557766,0.0011031927,0.0005638849,0.002002023,0.0009616548,0.0010601671,0.0118688755],"category_scores_gemma":[0.0024428824,0.00054787967,0.0009510656,0.0019225624,0.00085879705,0.0022756346,0.0025190555,0.0015051399,0.0012027153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029022625,0.00010388946,0.0004978023,0.00024794767,0.00010437508,0.000083697065,0.00009844269,0.47049764,0.0020809057,0.1906715,0.008330027,0.3269935],"study_design_scores_gemma":[0.0000226629,0.000045992685,0.0001196463,0.00003071904,0.000017521634,0.000034503577,0.000022954373,0.890419,0.0007656315,0.10552715,0.0029826106,0.000011643275],"about_ca_topic_score_codex":0.001986027,"about_ca_topic_score_gemma":0.0022497515,"teacher_disagreement_score":0.0118688755,"about_ca_system_score_codex":0.00079314125,"about_ca_system_score_gemma":0.00092087814,"threshold_uncertainty_score":0.039705336},"labels":[],"label_agreement":null},{"id":"W2292427798","doi":"10.1007/978-3-319-23540-0_12","title":"Modeling and Forecasting Time Series of Compositional Data: A Generalized Dirichlet Power Steady Model","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"Concordia University","funders":"","keywords":"Dirichlet distribution; Computer science; Hierarchical Dirichlet process; Latent Dirichlet allocation; Series (stratigraphy); Generalized Dirichlet distribution; Applied mathematics; Beta distribution; Model selection; Exponential function; Algorithm; Dirichlet series; Mathematics; Topic model; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.0618116592716933,"score_gpt":0.2551744788355995,"score_spread":0.19336281956390622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292427798","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.045995753,0.0013567025,0.9482433,0.0012381189,0.00021720846,0.00006844218,0.0005943809,0.00038009172,0.0019059938],"genre_scores_gemma":[0.78745496,0.0033870256,0.1826177,0.0006545217,0.00087708683,0.0005993563,0.0018250656,0.00040232434,0.02218191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985966,0.0005940282,0.000091547176,0.00044219027,0.00014096736,0.00013466398],"domain_scores_gemma":[0.9903965,0.008120265,0.0004245996,0.00033863005,0.0005678612,0.00015209854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004881529,0.0012848104,0.0031493367,0.0017387178,0.00088009745,0.0026531718,0.004817174,0.0035923545,0.0037009106],"category_scores_gemma":[0.014105832,0.002056064,0.0030049626,0.002411746,0.0025151311,0.004516106,0.0020697087,0.0034940206,0.0010403175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000813192,0.000045017943,0.00090833224,0.00009314023,0.000106413514,0.0000714571,0.00015509086,0.93752664,0.0003931438,0.044547576,0.0011068543,0.014964937],"study_design_scores_gemma":[0.0000060294906,0.000005025438,0.000047562087,0.00000460877,0.000010824997,0.0000072530543,0.00000720189,0.9844706,0.000057291818,0.01520903,0.00016812094,0.000006396709],"about_ca_topic_score_codex":0.018638982,"about_ca_topic_score_gemma":0.011904758,"teacher_disagreement_score":0.018638982,"about_ca_system_score_codex":0.0021025434,"about_ca_system_score_gemma":0.0012103474,"threshold_uncertainty_score":0.037060976},"labels":[],"label_agreement":null},{"id":"W2292889201","doi":"10.1007/978-3-319-27122-4_26","title":"Bitwise Data Parallelism with LLVM: The ICgrep Case Study","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; SIMD; Unicode; Parallel computing; Bitwise operation; Parallelism (grammar); Compiler; Instruction-level parallelism; Programming language; Computer architecture; Artificial intelligence","score_opus":0.07006981858183572,"score_gpt":0.3014386979558672,"score_spread":0.23136887937403147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292889201","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.5764013,0.0063623795,0.20190127,0.004126447,0.0003966812,0.00047865952,0.002842122,0.0075138044,0.19997737],"genre_scores_gemma":[0.8377919,0.0010769732,0.13655908,0.00039513785,0.00013498888,0.00015120256,0.0011587462,0.0010891735,0.021642813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983082,0.00034152664,0.00007582018,0.0002401893,0.000702235,0.00033202974],"domain_scores_gemma":[0.99672616,0.0015623604,0.00017841917,0.00090809504,0.00047680055,0.00014812007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013026407,0.0005782565,0.0005238131,0.0006567924,0.001041571,0.0021735954,0.0018760667,0.0013635586,0.00544327],"category_scores_gemma":[0.00657328,0.00031250023,0.0005112538,0.0027277183,0.0013592797,0.0028580069,0.0010705333,0.0016821361,0.0012589205],"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.001807268,0.0013940562,0.010275706,0.0013612526,0.00014356406,0.00510666,0.0016196076,0.11940467,0.015102588,0.24647422,0.109136194,0.48817426],"study_design_scores_gemma":[0.00040211363,0.00096218026,0.003809329,0.00029180603,0.0001548841,0.00657181,0.0014473792,0.5514948,0.061067652,0.23342983,0.1402516,0.00011662301],"about_ca_topic_score_codex":0.0043010316,"about_ca_topic_score_gemma":0.0054605254,"teacher_disagreement_score":0.00544327,"about_ca_system_score_codex":0.0010347225,"about_ca_system_score_gemma":0.0012997548,"threshold_uncertainty_score":0.018209577},"labels":[],"label_agreement":null},{"id":"W2293000419","doi":"10.1007/978-3-319-26585-8_10","title":"Data Quality by Contract – Towards an Architectural View for Data Quality in Health Information Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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 Victoria; University of British Columbia","funders":"","keywords":"Computer science; Quality (philosophy); Health informatics; Informatics; Data quality; Realization (probability); Focus (optics); Health care; Data science; Risk analysis (engineering); Management science; Knowledge management; Engineering; Medicine; Operations management","score_opus":0.30303134500309575,"score_gpt":0.5204188889811162,"score_spread":0.21738754397802046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293000419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049559944,0.0019982364,0.9407545,0.02700753,0.00043163038,0.00018023499,0.00013424888,0.0006724008,0.02386529],"genre_scores_gemma":[0.19375168,0.0046685864,0.7757232,0.0034329956,0.00094097987,0.00044489812,0.0006201895,0.001182201,0.019235283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98047125,0.007907913,0.0022738923,0.001357458,0.0066821715,0.0013072181],"domain_scores_gemma":[0.9800038,0.0068539293,0.0013579939,0.004957584,0.0051591983,0.001667458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031780146,0.0009110008,0.0009831266,0.00277151,0.0031579246,0.019292869,0.004799128,0.00423497,0.005021924],"category_scores_gemma":[0.024616223,0.0019917986,0.00188534,0.0052470732,0.012680771,0.02789976,0.008906449,0.009696367,0.001364232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009359586,0.000022915196,0.00037805692,0.00008753542,0.000013034365,0.000038682985,0.0012017041,0.0024361971,0.000335515,0.97362804,0.004306872,0.017542157],"study_design_scores_gemma":[0.0000151555,0.00003842576,0.000353443,0.00034718224,0.000037272657,0.00017077227,0.0015509295,0.034319524,0.0013099866,0.8149341,0.1468773,0.000045785506],"about_ca_topic_score_codex":0.015058732,"about_ca_topic_score_gemma":0.007777463,"teacher_disagreement_score":0.031780146,"about_ca_system_score_codex":0.0074512465,"about_ca_system_score_gemma":0.014902051,"threshold_uncertainty_score":0.16807145},"labels":[],"label_agreement":null},{"id":"W2293067129","doi":"10.1007/978-3-319-25252-0_26","title":"MUSETS: Diversity-Aware Web Query Suggestions for Shortening User Sessions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Session (web analytics); Query optimization; Web query classification; Query expansion; Web search query; Information retrieval; Set (abstract data type); Sargable; Query language; Spatial query; Task (project management); Function (biology); Result set; Representation (politics); RDF query language; Search engine; World Wide Web; Programming language","score_opus":0.042894266190562975,"score_gpt":0.27658497074646765,"score_spread":0.23369070455590468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293067129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059384763,0.0019071096,0.80414706,0.0008886603,0.00043585763,0.0005450894,0.0029654065,0.123065546,0.0066605466],"genre_scores_gemma":[0.3259802,0.0007580229,0.6398629,0.0006649184,0.00041597156,0.00057418965,0.00635095,0.008905198,0.016487641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969489,0.0008106949,0.00020043917,0.0004765136,0.0013524016,0.00021112047],"domain_scores_gemma":[0.99269426,0.0033373397,0.00037737808,0.0018073493,0.0011377588,0.00064592535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029790732,0.0017227674,0.0015540526,0.002105141,0.0013802219,0.00203519,0.0031434528,0.0015924159,0.010845517],"category_scores_gemma":[0.012732631,0.00084710674,0.001116705,0.0018513306,0.00062643114,0.0047518993,0.0042086598,0.0019743745,0.0049232463],"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.004700232,0.0008140856,0.006039377,0.00091207266,0.00026297467,0.00047191523,0.0021467288,0.009422462,0.08826168,0.0090011135,0.098441824,0.7795255],"study_design_scores_gemma":[0.0010972214,0.0014425385,0.007210059,0.000325532,0.0007017747,0.0019243965,0.002443302,0.6232555,0.12054676,0.051588375,0.1889637,0.0005008974],"about_ca_topic_score_codex":0.001808776,"about_ca_topic_score_gemma":0.0040901555,"teacher_disagreement_score":0.010845517,"about_ca_system_score_codex":0.00060799683,"about_ca_system_score_gemma":0.0010475402,"threshold_uncertainty_score":0.036281824},"labels":[],"label_agreement":null},{"id":"W2293112637","doi":"10.1007/978-3-319-26181-2_25","title":"Design History Retrieval Based Structural Topology Optimization","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topology Optimization in Engineering","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 Alberta","funders":"","keywords":"Computer science; Topology optimization; Feature (linguistics); Sizing; Similarity (geometry); Mathematical optimization; Domain (mathematical analysis); Set (abstract data type); Boundary (topology); Topology (electrical circuits); Optimization problem; Algorithm; Artificial intelligence; Mathematics; Engineering; Image (mathematics)","score_opus":0.0223111171397743,"score_gpt":0.22156910160711285,"score_spread":0.19925798446733856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293112637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028922856,0.0028527163,0.94009525,0.00023136669,0.00018501907,0.00014054115,0.0009789404,0.0045915823,0.02200182],"genre_scores_gemma":[0.42442346,0.0034028504,0.5331436,0.00031841113,0.00027204165,0.0002476756,0.006192842,0.0011564003,0.030842762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995921,0.00006335302,0.000018445853,0.000085991414,0.0002060715,0.000034003955],"domain_scores_gemma":[0.99953747,0.00017375858,0.000037915004,0.00014012102,0.000095980926,0.000014723503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032990135,0.0010319568,0.0013823604,0.002098832,0.00034267642,0.000846675,0.0014049307,0.00077810197,0.010408044],"category_scores_gemma":[0.0016040249,0.00041789957,0.0011187759,0.0021231975,0.0003280503,0.0015983635,0.000707034,0.0006197619,0.0033818623],"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.00015382675,0.00014001504,0.0005149645,0.00043477447,0.00008163524,0.00013748812,0.00006363995,0.18560174,0.027435483,0.012620506,0.019641275,0.75317466],"study_design_scores_gemma":[0.00001888305,0.000097746415,0.0007115175,0.000037876925,0.00006814688,0.00021250812,0.000034176395,0.95813805,0.010771555,0.018676298,0.011205441,0.000027789478],"about_ca_topic_score_codex":0.0012729446,"about_ca_topic_score_gemma":0.0021648863,"teacher_disagreement_score":0.010408044,"about_ca_system_score_codex":0.00048135073,"about_ca_system_score_gemma":0.00040783876,"threshold_uncertainty_score":0.03481835},"labels":[],"label_agreement":null},{"id":"W2293128416","doi":"10.1007/978-3-319-30303-1_13","title":"A Closer Look at the HTTP and P2P Based Botnets from a Detector’s Perspective","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"","keywords":"Botnet; Computer science; Malware; Computer security; Perspective (graphical); The Internet; Artificial intelligence; World Wide Web","score_opus":0.010617466410094086,"score_gpt":0.22267000126669884,"score_spread":0.21205253485660475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293128416","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.0199747,0.19691485,0.110813454,0.13014771,0.0067335768,0.000063627405,0.00048252413,0.00032433931,0.5345451],"genre_scores_gemma":[0.39477685,0.20109057,0.06766744,0.037882764,0.015566784,0.00012395902,0.0005722573,0.0005878871,0.28173146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99910635,0.00026886896,0.000034146364,0.00013922929,0.00032980865,0.00012158303],"domain_scores_gemma":[0.99843544,0.001032095,0.000066182685,0.000100460726,0.0002573789,0.00010847611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010685434,0.0008151616,0.0008974539,0.0031854075,0.0015668187,0.0063585644,0.0012785193,0.005239761,0.007071268],"category_scores_gemma":[0.002171092,0.00068439444,0.0006493745,0.0027916236,0.004145157,0.017067213,0.0020527313,0.008377086,0.0017571109],"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.000013826293,0.00004272589,0.00027375738,0.0001282582,0.000008953007,0.00017834998,0.0004195014,0.0009888627,0.0006146863,0.9567597,0.0153188715,0.02525242],"study_design_scores_gemma":[0.0000051679303,0.00004663957,0.00083190727,0.00036870842,0.000013060202,0.00090095244,0.00084686594,0.008482485,0.0007198305,0.6472331,0.34051293,0.000038327176],"about_ca_topic_score_codex":0.0034892426,"about_ca_topic_score_gemma":0.0047362926,"teacher_disagreement_score":0.007071268,"about_ca_system_score_codex":0.0030292026,"about_ca_system_score_gemma":0.0010432363,"threshold_uncertainty_score":0.023655713},"labels":[],"label_agreement":null},{"id":"W2293144117","doi":"10.1007/978-3-319-26187-4_34","title":"Towards a Unified Framework for Data Cleaning and Data Privacy","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"McMaster University","funders":"","keywords":"Computer science; Information privacy; Data science; Computer security","score_opus":0.13659126972842223,"score_gpt":0.34886373614703625,"score_spread":0.21227246641861403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293144117","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.00019349983,0.00017751039,0.99814296,0.0003804305,0.000045403645,0.00004085582,0.00003113232,0.00025815985,0.0007299922],"genre_scores_gemma":[0.016955048,0.00074190175,0.9783588,0.00047403437,0.00020406248,0.00021894567,0.00029170534,0.00024404572,0.002511459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9817377,0.0062079183,0.0018799801,0.002279694,0.0067581283,0.0011365076],"domain_scores_gemma":[0.983898,0.004236176,0.00074583327,0.0074120485,0.0030628836,0.0006450926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021187581,0.0015731541,0.0026963197,0.003933389,0.0031868021,0.01337705,0.008237944,0.004664804,0.0042114644],"category_scores_gemma":[0.021957802,0.0021046775,0.0055838134,0.005368653,0.006117888,0.019078799,0.015532569,0.013012465,0.0026390548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003883356,0.00006524836,0.0002497633,0.00016885975,0.00007005958,0.000111327885,0.00035075084,0.008148387,0.0013201055,0.93705666,0.0052821315,0.047137883],"study_design_scores_gemma":[0.000022054543,0.00004096497,0.00013559184,0.00016133701,0.00008791037,0.00028491515,0.0001854744,0.13099398,0.0037838656,0.80915815,0.05508932,0.000056391124],"about_ca_topic_score_codex":0.0036900295,"about_ca_topic_score_gemma":0.0037484057,"teacher_disagreement_score":0.021187581,"about_ca_system_score_codex":0.0030837874,"about_ca_system_score_gemma":0.0066347523,"threshold_uncertainty_score":0.11205202},"labels":[],"label_agreement":null},{"id":"W2293244354","doi":"10.1007/978-3-319-27863-6_42","title":"JackVR: A Virtual Reality Training System for Landing Oil Rigs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 Calgary","funders":"","keywords":"Computer science; Training (meteorology); Marine engineering; Process (computing); Virtual reality; Task (project management); Simulation; Oil spill; Domain (mathematical analysis); Aeronautics; Human–computer interaction; Petroleum engineering; Systems engineering; Geology; Engineering; Meteorology","score_opus":0.08681396153898545,"score_gpt":0.3229985181598097,"score_spread":0.23618455662082422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293244354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11362112,0.00076296134,0.7647831,0.0003432544,0.00044808362,0.0004903064,0.0033097344,0.07342146,0.042820007],"genre_scores_gemma":[0.54815227,0.0012151717,0.33198646,0.0005334117,0.00010643428,0.00052665506,0.005476827,0.004715751,0.10728697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984753,0.000019020319,0.000008286571,0.00003177055,0.00006932169,0.000023996128],"domain_scores_gemma":[0.9998548,0.000033612585,0.000009415828,0.00002786895,0.00003723073,0.000037148588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024408054,0.0009835468,0.00047869977,0.0005583243,0.00026317532,0.00061048294,0.0015105443,0.0007164666,0.031124514],"category_scores_gemma":[0.00045033917,0.0005234989,0.00041720815,0.00027453946,0.0001652207,0.0005442423,0.0010834835,0.00050162355,0.007326314],"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.0011255203,0.0005748376,0.0022823426,0.0006723478,0.00011426022,0.00056619226,0.0006874756,0.025195282,0.2240042,0.0021982295,0.06832099,0.67425823],"study_design_scores_gemma":[0.00052492,0.0025553687,0.022333123,0.0004770216,0.00037444444,0.0033055781,0.0008557009,0.37852073,0.18055087,0.0032596411,0.40666988,0.0005727385],"about_ca_topic_score_codex":0.0021851293,"about_ca_topic_score_gemma":0.0030275527,"teacher_disagreement_score":0.031124514,"about_ca_system_score_codex":0.00014909843,"about_ca_system_score_gemma":0.0004012503,"threshold_uncertainty_score":0.104121804},"labels":[],"label_agreement":null},{"id":"W2293245479","doi":"10.1007/978-3-319-24126-5_8","title":"Meet-in-the-Middle Attacks on Round-Reduced Khudra","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Key (lock); Block (permutation group theory); Man-in-the-middle attack; Property (philosophy); Arithmetic; Algorithm; Theoretical computer science; Computer security; Cryptography; Mathematics","score_opus":0.07174770758530592,"score_gpt":0.3082569872142587,"score_spread":0.2365092796289528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293245479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28599578,0.0025881045,0.49369204,0.004736194,0.0010470403,0.00044454145,0.00055758154,0.0043029645,0.2066357],"genre_scores_gemma":[0.93903023,0.0004555459,0.032554187,0.00043373255,0.00013303026,0.0001442736,0.00021587755,0.00029029587,0.026742877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967783,0.0010211291,0.00012956979,0.0003413768,0.000953978,0.0007756977],"domain_scores_gemma":[0.9971003,0.0010140194,0.00014419084,0.0013733741,0.0002495825,0.00011843623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013767346,0.0007794942,0.001661409,0.0008745734,0.0027509192,0.003152413,0.001464071,0.0019245545,0.008058331],"category_scores_gemma":[0.004987014,0.0005885011,0.0012258728,0.0008029833,0.0029627034,0.0052656904,0.0059693786,0.0030463936,0.0033803629],"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.0014934768,0.00012680337,0.00070021825,0.00024063254,0.00011603362,0.00032329967,0.0013618072,0.014627981,0.012389568,0.8521323,0.016347975,0.100139916],"study_design_scores_gemma":[0.00014886407,0.0002566517,0.00073110475,0.00010574179,0.00014065471,0.0007090548,0.0005534913,0.103196695,0.023112096,0.83462757,0.036300343,0.00011758016],"about_ca_topic_score_codex":0.0005764104,"about_ca_topic_score_gemma":0.00057215785,"teacher_disagreement_score":0.008058331,"about_ca_system_score_codex":0.0011421714,"about_ca_system_score_gemma":0.0011619986,"threshold_uncertainty_score":0.02695781},"labels":[],"label_agreement":null},{"id":"W2293308404","doi":"10.1007/978-3-319-07221-0_91","title":"An Exploratory Study of Learners’ Brain States","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Workload; Distraction; Cognition; Task (project management); Mental state; Human–computer interaction; Exploratory research; Variation (astronomy); Cognitive psychology; Artificial intelligence; Psychology","score_opus":0.02594295829467111,"score_gpt":0.26363845807455316,"score_spread":0.23769549977988205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293308404","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.99808514,0.00003545928,0.0002596961,0.000016375396,0.0000024050714,0.000019127498,0.00005172888,0.0000080981035,0.0015220967],"genre_scores_gemma":[0.9981493,0.00004720834,0.0002957982,0.000017089857,0.0000036231793,0.000049742168,0.00007016463,0.0000065732306,0.0013605646],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997385,0.00010104633,0.000012679458,0.000054971948,0.0000581408,0.000034718418],"domain_scores_gemma":[0.99769574,0.0015567326,0.00014781153,0.0001278846,0.00022865045,0.0002431707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062714145,0.00022496845,0.00020657112,0.0004943871,0.0004172239,0.00067628134,0.00032618598,0.00039796354,0.003361655],"category_scores_gemma":[0.00486832,0.00010990508,0.000113319176,0.00036707427,0.0005906476,0.00069951784,0.00082467386,0.0005378874,0.0005837626],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039835894,0.007230092,0.39752296,0.0005882842,0.00017980745,0.0055824756,0.2405076,0.00095689326,0.15282957,0.0029522944,0.0027855178,0.18488097],"study_design_scores_gemma":[0.00015401094,0.010443965,0.81809205,0.00009608814,0.00010812725,0.005703987,0.1074541,0.0020839937,0.038368832,0.0031020485,0.014277229,0.00011554474],"about_ca_topic_score_codex":0.0004924071,"about_ca_topic_score_gemma":0.0005996407,"teacher_disagreement_score":0.003361655,"about_ca_system_score_codex":0.00012705503,"about_ca_system_score_gemma":0.00017352562,"threshold_uncertainty_score":0.011245787},"labels":[],"label_agreement":null},{"id":"W2293359051","doi":"10.1007/978-3-319-25524-8_37","title":"Real-Time Conditional Commitment Logic","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Concordia University","funders":"","keywords":"Temporal logic; Computer science; Executable; Interval temporal logic; Modalities; Linear temporal logic; Class (philosophy); Extension (predicate logic); Interval (graph theory); Point (geometry); Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.03137005660421021,"score_gpt":0.26670173282554416,"score_spread":0.23533167622133394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293359051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069926605,0.006563896,0.6932321,0.0039223344,0.0011507286,0.00008534823,0.00050678,0.0015513065,0.28599483],"genre_scores_gemma":[0.5523484,0.007294211,0.19096732,0.0020281929,0.0013023821,0.00024782913,0.0014766341,0.0009198301,0.24341519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.0001975747,0.000050861334,0.00016009765,0.00029479418,0.00008364818],"domain_scores_gemma":[0.9991769,0.00041570593,0.000049251532,0.00015465813,0.0001448891,0.00005861356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321751,0.000754254,0.00039232124,0.00058562367,0.000734729,0.0027495734,0.0020509874,0.0010755125,0.016554123],"category_scores_gemma":[0.0022140592,0.0005228519,0.0006743123,0.00095588405,0.0022520123,0.004577035,0.0012967169,0.00413452,0.003940773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021453716,0.000011555534,0.000018699991,0.000069300884,0.0000076236174,0.00003599825,0.000086862456,0.0012520636,0.0008231007,0.97287107,0.0068809274,0.017921356],"study_design_scores_gemma":[0.000017127168,0.000011383179,0.000049246504,0.000046188703,0.000010702158,0.00008134179,0.000028930792,0.0068202615,0.0014364021,0.9317234,0.059758477,0.000016578484],"about_ca_topic_score_codex":0.000990304,"about_ca_topic_score_gemma":0.00092282356,"teacher_disagreement_score":0.016554123,"about_ca_system_score_codex":0.0021376375,"about_ca_system_score_gemma":0.0009643156,"threshold_uncertainty_score":0.055379033},"labels":[],"label_agreement":null},{"id":"W2293413622","doi":"10.1007/978-3-319-30303-1_15","title":"Runtime Monitoring of Stream Logic Formulae","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Programming language; Parallel computing; Algorithm; Theoretical computer science","score_opus":0.03395117547719776,"score_gpt":0.29131269466324794,"score_spread":0.25736151918605016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293413622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081292845,0.0006000335,0.8864138,0.00036303813,0.0001971883,0.00012048455,0.00031055434,0.015860582,0.014841478],"genre_scores_gemma":[0.8184357,0.00043258816,0.16941343,0.000144052,0.00015586731,0.00011124876,0.00055177615,0.0014336613,0.009321525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807835,0.0003993011,0.000103153565,0.00035300324,0.0008732845,0.0001928155],"domain_scores_gemma":[0.99469453,0.0030095933,0.00042749316,0.0011902326,0.00053358986,0.00014460493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019059179,0.00069924153,0.0006680724,0.0010067088,0.0004101809,0.0017932011,0.0013617533,0.0006651148,0.0046041384],"category_scores_gemma":[0.008490239,0.0004688064,0.0006005636,0.0007388607,0.0010441049,0.002538026,0.0014023741,0.0014458611,0.00080536155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018667275,0.0003270354,0.0052485988,0.0005581654,0.00010109281,0.0008662134,0.00076935056,0.052927684,0.12197889,0.2379383,0.012347831,0.5650701],"study_design_scores_gemma":[0.00015406593,0.00023380519,0.0012983462,0.00013210473,0.00011868314,0.00048500896,0.000086954744,0.62259084,0.2171836,0.13896506,0.01869472,0.000056806373],"about_ca_topic_score_codex":0.0007069595,"about_ca_topic_score_gemma":0.0008097332,"teacher_disagreement_score":0.0046041384,"about_ca_system_score_codex":0.00093945506,"about_ca_system_score_gemma":0.00088753476,"threshold_uncertainty_score":0.015402377},"labels":[],"label_agreement":null},{"id":"W2293445795","doi":"10.1007/978-3-319-25040-3_62","title":"Computing Boundaries in Local Mixture Models","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Regular polygon; Polytope; Parameter space; Space (punctuation); Algorithm; Mathematical optimization; Theoretical computer science; Geometry; Mathematics","score_opus":0.03290359949436624,"score_gpt":0.27810936634850303,"score_spread":0.24520576685413678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293445795","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.0046478673,0.0005848773,0.9927804,0.000088350906,0.000027187263,0.000016798393,0.00003123171,0.0005820365,0.0012412778],"genre_scores_gemma":[0.11477559,0.00079792447,0.87847453,0.00015668148,0.000093187715,0.00017638126,0.0005653471,0.0012461859,0.003714025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763334,0.0009935339,0.00012412762,0.0004409783,0.0006531504,0.00015477218],"domain_scores_gemma":[0.98699063,0.010608117,0.00039112117,0.0008591788,0.00080865814,0.00034234798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004329084,0.0012951314,0.0027353899,0.0021321846,0.0010911314,0.003561573,0.0035232059,0.0030864784,0.004675108],"category_scores_gemma":[0.028897228,0.002098805,0.0015420618,0.0019055124,0.0021071567,0.0069249277,0.0060010524,0.0049617435,0.0021959634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004999857,0.00010565168,0.0015109307,0.00048808922,0.0001255243,0.0001510405,0.00061942573,0.41561168,0.0059032394,0.20993285,0.0071083684,0.35794315],"study_design_scores_gemma":[0.000012865987,0.000018878673,0.00012719509,0.000048109912,0.000017485947,0.000037486192,0.00003726026,0.84619176,0.0019161364,0.1495654,0.002009793,0.000017667953],"about_ca_topic_score_codex":0.0035043976,"about_ca_topic_score_gemma":0.002982398,"teacher_disagreement_score":0.004675108,"about_ca_system_score_codex":0.0015151182,"about_ca_system_score_gemma":0.00078159914,"threshold_uncertainty_score":0.02289468},"labels":[],"label_agreement":null},{"id":"W2293590087","doi":"10.1007/978-3-319-30303-1_1","title":"Optimization Problems in Infrastructure Security","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Task (project management); Critical infrastructure; Computer security; Process (computing); Order (exchange); Risk analysis (engineering); Management science; Systems engineering","score_opus":0.011637329829563964,"score_gpt":0.237086179571458,"score_spread":0.22544884974189403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293590087","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.010380725,0.03012878,0.6376781,0.011801995,0.0017920256,0.00011173147,0.00047062783,0.0002211973,0.3074149],"genre_scores_gemma":[0.42581517,0.058649033,0.20035852,0.0030177657,0.0059836125,0.00068760075,0.00094361807,0.0008600528,0.30368462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999281,0.000311282,0.000028365952,0.000110056615,0.00019766034,0.00007166112],"domain_scores_gemma":[0.9990563,0.000675681,0.00008305745,0.00006855909,0.00006791323,0.00004858546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011657597,0.0017271669,0.0015508247,0.0007877691,0.000628082,0.0029103223,0.0012536197,0.002208788,0.015438202],"category_scores_gemma":[0.003625759,0.0007265322,0.00096336973,0.0019897853,0.002037566,0.003233783,0.0013449768,0.00405147,0.0022808004],"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.000028861956,0.000054583794,0.0001187146,0.00027724498,0.00005135376,0.000051372077,0.00006184777,0.08621959,0.00024220109,0.8233558,0.03526004,0.054278433],"study_design_scores_gemma":[0.000018112458,0.000022416167,0.00013228637,0.00014579004,0.000019821857,0.000051313564,0.0000472812,0.07529022,0.00014491231,0.8904611,0.03365331,0.0000135704695],"about_ca_topic_score_codex":0.0012068277,"about_ca_topic_score_gemma":0.00093842985,"teacher_disagreement_score":0.015438202,"about_ca_system_score_codex":0.0019515017,"about_ca_system_score_gemma":0.0009751855,"threshold_uncertainty_score":0.051645935},"labels":[],"label_agreement":null},{"id":"W2293608128","doi":"10.1007/978-3-319-21500-6_31","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Upper and lower bounds; Alphabet; Nondeterministic algorithm; Deterministic finite automaton; Combinatorics; Edit distance; State (computer science); Automaton; String searching algorithm; String (physics); Time complexity; Finite-state machine; Computer science; Approximate string matching; Discrete mathematics; Mathematics; Pattern matching; Algorithm; Set (abstract data type); Theoretical computer science; Artificial intelligence","score_opus":0.03395389298181168,"score_gpt":0.2580642488607614,"score_spread":0.22411035587894973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293608128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43075085,0.001679652,0.51966774,0.003140521,0.00014636827,0.00015929835,0.0018198359,0.0008498468,0.04178587],"genre_scores_gemma":[0.9453736,0.0007889088,0.041902915,0.00014135652,0.0001557087,0.00017933775,0.0011518488,0.00021654925,0.010089832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971836,0.0006179498,0.00022535959,0.0005716641,0.0010383286,0.00036298097],"domain_scores_gemma":[0.9790846,0.015638804,0.0011926444,0.0026098625,0.000945399,0.00052875147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016914449,0.00053335365,0.0018311066,0.0014297747,0.0012886138,0.005030332,0.0029380932,0.002098839,0.012084458],"category_scores_gemma":[0.020487608,0.00082966156,0.0017282788,0.0028259044,0.0025603387,0.01177575,0.0035359615,0.0028882995,0.00088021957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038685574,0.00012180806,0.0017573722,0.00030698747,0.000062476145,0.00012337348,0.0004284133,0.09783499,0.0023730579,0.85013694,0.0032180047,0.043249704],"study_design_scores_gemma":[0.000018215447,0.000020886762,0.00027032485,0.000014372194,0.000020525933,0.00006137281,0.000055602184,0.17370807,0.00077664154,0.82435,0.00068981724,0.000014005868],"about_ca_topic_score_codex":0.0019519178,"about_ca_topic_score_gemma":0.0015955232,"teacher_disagreement_score":0.012084458,"about_ca_system_score_codex":0.0025414447,"about_ca_system_score_gemma":0.0014107568,"threshold_uncertainty_score":0.040426552},"labels":[],"label_agreement":null},{"id":"W2293673697","doi":"10.1007/978-3-662-49192-8_10","title":"Orthogonal Layout with Optimal Face Complexity","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba","funders":"","keywords":"Rectangle; Embedding; Planar graph; Time complexity; Face (sociological concept); Combinatorics; Computational complexity theory; Computer science; Graph embedding; Graph; Mathematics; Discrete mathematics; Algorithm; Geometry; Artificial intelligence","score_opus":0.026426689458918098,"score_gpt":0.25105196737060714,"score_spread":0.22462527791168904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293673697","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.036892366,0.00073553424,0.8811925,0.00057285785,0.0004534759,0.000096821954,0.00054689904,0.0013916119,0.07811789],"genre_scores_gemma":[0.34469253,0.0015305185,0.57444394,0.00044466986,0.00052877946,0.0002855556,0.0010872425,0.0016786564,0.075308144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.00013405396,0.000027533972,0.00011288163,0.0003319013,0.00009743373],"domain_scores_gemma":[0.9988306,0.00051080843,0.000091856826,0.00032785637,0.00015484859,0.00008414365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858112,0.00093019864,0.0009808247,0.0007529025,0.0004961991,0.0015719899,0.0014882364,0.00094518624,0.025008308],"category_scores_gemma":[0.003463468,0.00068725063,0.00051595666,0.0012647164,0.0007559385,0.0023466349,0.0024091217,0.0017066639,0.004478146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000258726,0.00015914919,0.0002922652,0.0003637708,0.000028775337,0.00011920814,0.00009438031,0.10131927,0.013673321,0.53032565,0.037015665,0.31634983],"study_design_scores_gemma":[0.000092893104,0.00012382436,0.000317938,0.000044487413,0.000025793765,0.00034074328,0.000058314316,0.32633737,0.006093007,0.64120686,0.025326332,0.00003233116],"about_ca_topic_score_codex":0.000692545,"about_ca_topic_score_gemma":0.0013172012,"teacher_disagreement_score":0.025008308,"about_ca_system_score_codex":0.0005898327,"about_ca_system_score_gemma":0.00065147155,"threshold_uncertainty_score":0.08366114},"labels":[],"label_agreement":null},{"id":"W2293693209","doi":"10.1007/978-3-319-27857-5_25","title":"UT-MARO: Unscented Transformation and Matrix Rank Optimization for Moving Objects Detection in Aerial Imagery","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Aerial image; Robustness (evolution); Artificial intelligence; Computer vision; Computation; Object detection; Aerial imagery; Transformation (genetics); Transformation matrix; Pattern recognition (psychology); Image (mathematics); Algorithm","score_opus":0.022586632583867203,"score_gpt":0.2855284726706321,"score_spread":0.26294184008676486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293693209","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.0010418872,0.0003049362,0.99591005,0.000066842455,0.00008966356,0.000024560437,0.00014207694,0.001444211,0.0009757856],"genre_scores_gemma":[0.021592114,0.00042248567,0.9697971,0.00009515655,0.000121080535,0.00012822873,0.0008762688,0.00076438236,0.006203238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.00013654072,0.000029385983,0.000118739794,0.00028746476,0.000049277587],"domain_scores_gemma":[0.9995111,0.0001786282,0.00003588257,0.00010544302,0.00014279954,0.000026256657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006680695,0.0014443933,0.0013509503,0.000675386,0.00034384045,0.0010287537,0.0014238104,0.0011215081,0.0077113025],"category_scores_gemma":[0.002370687,0.0006089958,0.0010330294,0.0011059875,0.0006086288,0.0013035062,0.001537975,0.0018485722,0.004462879],"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.00019809985,0.000089811816,0.00019231265,0.00031400242,0.000081712766,0.00007880168,0.000082193816,0.09179164,0.019207489,0.021227151,0.041363493,0.82537335],"study_design_scores_gemma":[0.000016805496,0.00006075352,0.00021412892,0.00002221285,0.00001023427,0.000086099826,0.000016176351,0.96780753,0.006665019,0.011388136,0.013692168,0.000020858804],"about_ca_topic_score_codex":0.002823135,"about_ca_topic_score_gemma":0.004457789,"teacher_disagreement_score":0.0077113025,"about_ca_system_score_codex":0.0003359687,"about_ca_system_score_gemma":0.00082411023,"threshold_uncertainty_score":0.02579683},"labels":[],"label_agreement":null},{"id":"W2293708710","doi":"10.1007/978-3-319-18032-8_28","title":"A Plane Moving Average Algorithm for Short-Term Traffic Flow Prediction","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Generalization; Term (time); Traffic flow (computer networking); Set (abstract data type); Algorithm; Flow (mathematics); Series (stratigraphy); Plane (geometry); Data set; Data mining; Time series; Artificial intelligence; Machine learning; Mathematics","score_opus":0.016038342570668333,"score_gpt":0.22555995717363425,"score_spread":0.20952161460296592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293708710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071537965,0.0003765314,0.9907855,0.00004135469,0.000099547164,0.000022302525,0.00009104876,0.0008347272,0.0005952597],"genre_scores_gemma":[0.12385378,0.00063413614,0.8710369,0.00006950791,0.00019234516,0.0001123675,0.00074558763,0.00017481355,0.003180622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999652,0.00006446794,0.000019747884,0.00010350279,0.00012425763,0.000035900604],"domain_scores_gemma":[0.99935037,0.0002916834,0.00002612092,0.00008123931,0.00022174892,0.000028882525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002483,0.00075852295,0.0015496012,0.00080739195,0.0005179521,0.00088492705,0.0017988151,0.0008543293,0.0025126513],"category_scores_gemma":[0.0020351599,0.00036006776,0.00071319833,0.0013126257,0.00026401572,0.0010969616,0.00068622734,0.0014176881,0.001222397],"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.00028894094,0.000114211296,0.0009497285,0.000039818653,0.000121628545,0.000033769782,0.00003180465,0.3296169,0.006341957,0.006248158,0.0052455566,0.65096754],"study_design_scores_gemma":[0.000003939268,0.000011884774,0.000090237794,0.0000010877357,0.0000065606105,0.0000058103783,0.0000016604853,0.9981178,0.0005083494,0.00082174514,0.0004279882,0.000003009249],"about_ca_topic_score_codex":0.011408348,"about_ca_topic_score_gemma":0.006033568,"teacher_disagreement_score":0.011408348,"about_ca_system_score_codex":0.00046759006,"about_ca_system_score_gemma":0.0009311722,"threshold_uncertainty_score":0.022683918},"labels":[],"label_agreement":null},{"id":"W2293751504","doi":"10.1007/978-3-319-26626-8_6","title":"A $$(5.83+\\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Facility location problem; 1-center problem; Computer science; Mathematical optimization; Connection (principal bundle); Set (abstract data type); Total cost; Approximation algorithm; Algorithm; Mathematics","score_opus":0.03383172713465637,"score_gpt":0.23829398532794374,"score_spread":0.20446225819328737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293751504","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.0096766725,0.001208064,0.91585547,0.0020686027,0.001061518,0.00036957892,0.0014101407,0.00672095,0.061628986],"genre_scores_gemma":[0.059828535,0.00053555804,0.8988224,0.000941536,0.0002933262,0.0006181673,0.0022307239,0.0017231912,0.035006635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984112,0.00028072062,0.00007898909,0.00038401372,0.00047796316,0.00036706953],"domain_scores_gemma":[0.9985662,0.0006766915,0.000063231535,0.0003887169,0.0001834363,0.00012170704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014633692,0.0025649802,0.0021100712,0.0011689429,0.0011619992,0.002663992,0.0043676896,0.002602221,0.06360694],"category_scores_gemma":[0.005615902,0.0008609626,0.002412165,0.0025270563,0.0009976284,0.0042218477,0.0034394276,0.005664413,0.018489243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000500396,0.00077736203,0.0005590112,0.00062746904,0.00010939789,0.00012876155,0.00013423242,0.11545906,0.0031589996,0.103555135,0.1755293,0.59946084],"study_design_scores_gemma":[0.00033105796,0.00020915756,0.0004971641,0.0001784669,0.00007652742,0.0003781284,0.00010036973,0.79817027,0.0029238076,0.1538287,0.043254495,0.000051861647],"about_ca_topic_score_codex":0.0064656734,"about_ca_topic_score_gemma":0.010133487,"teacher_disagreement_score":0.06360694,"about_ca_system_score_codex":0.0029992796,"about_ca_system_score_gemma":0.0035507726,"threshold_uncertainty_score":0.21278644},"labels":[],"label_agreement":null},{"id":"W2293773081","doi":"10.1007/978-3-319-29221-2_17","title":"A New Construction of Broadcast Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Computer science; Graph; Broadcasting (networking); Wheel graph; Dissemination; Upper and lower bounds; Discrete mathematics; Mathematics; Graph power; Line graph; Computer network; Telecommunications","score_opus":0.01244924480286898,"score_gpt":0.22259271533092423,"score_spread":0.21014347052805524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293773081","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.019901933,0.00087616604,0.8687283,0.000997233,0.000613505,0.00012159669,0.0004257296,0.001140975,0.107194506],"genre_scores_gemma":[0.26175886,0.0030285276,0.6057966,0.0008525328,0.0008166624,0.00061124313,0.0015805045,0.0017656983,0.123789355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948704,0.00013692839,0.000022509728,0.00012100771,0.00016483011,0.00006765033],"domain_scores_gemma":[0.99902165,0.00037698794,0.000049435905,0.00026745044,0.00017707142,0.0001073465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051169324,0.0006995941,0.0006222154,0.0012844403,0.001519852,0.0017153689,0.0013353691,0.0007771264,0.010997114],"category_scores_gemma":[0.0017467744,0.0007900993,0.00089737657,0.0014173203,0.001488298,0.0027314278,0.0023521371,0.0027112928,0.0027745517],"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.00004436507,0.000025785881,0.000075650845,0.00013481283,0.000011889687,0.00005270312,0.00023559856,0.0023615363,0.0040223673,0.934306,0.010045596,0.04868363],"study_design_scores_gemma":[0.0000416681,0.00003959077,0.00013850702,0.000064605665,0.000046124445,0.00018839433,0.00009377532,0.016631426,0.0040468117,0.8991638,0.07952201,0.000023356239],"about_ca_topic_score_codex":0.00097459427,"about_ca_topic_score_gemma":0.0012517959,"teacher_disagreement_score":0.010997114,"about_ca_system_score_codex":0.0011672465,"about_ca_system_score_gemma":0.0006687906,"threshold_uncertainty_score":0.036789},"labels":[],"label_agreement":null},{"id":"W2293779257","doi":"10.1007/978-3-319-24595-9_3","title":"Exploiting Fine- and Coarse-Grained Parallelism Using a Directive Based Approach","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Computer science; Exploit; Compiler; Parallel computing; Overhead (engineering); Multi-core processor; Directive; Cluster (spacecraft); Optimizing compiler; Programming paradigm; Distributed computing; Programming language","score_opus":0.05035961286907456,"score_gpt":0.27606304790178265,"score_spread":0.2257034350327081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293779257","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.033166546,0.0004453877,0.93868214,0.00039885024,0.00015379788,0.00012796486,0.0001024335,0.006424786,0.02049807],"genre_scores_gemma":[0.36691225,0.00032474208,0.61709243,0.00042756947,0.00006960317,0.00016568764,0.0003012145,0.0012676707,0.013438871],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941814,0.000089607405,0.00003399291,0.00009612775,0.00025411742,0.000108043365],"domain_scores_gemma":[0.99884295,0.00032197376,0.0000623789,0.0005129928,0.00017695635,0.00008277239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060848787,0.0007105478,0.0006972413,0.0006076234,0.0006025539,0.0012723985,0.0017289806,0.00078279886,0.0046536275],"category_scores_gemma":[0.0014164627,0.0004934389,0.00066232396,0.0008376888,0.0009966509,0.0017286005,0.0019827357,0.0020626169,0.0015006298],"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.00097038416,0.0007053208,0.002196877,0.00052413694,0.0001318372,0.0006520277,0.0006212698,0.09680902,0.22699611,0.19877468,0.016460516,0.4551578],"study_design_scores_gemma":[0.00018817437,0.0004647165,0.0008003159,0.000059203674,0.00010656885,0.00055243314,0.00014897462,0.7519396,0.08097763,0.124989815,0.03968026,0.000092254566],"about_ca_topic_score_codex":0.00080984074,"about_ca_topic_score_gemma":0.0022137845,"teacher_disagreement_score":0.0046536275,"about_ca_system_score_codex":0.00050211366,"about_ca_system_score_gemma":0.001036614,"threshold_uncertainty_score":0.015567958},"labels":[],"label_agreement":null},{"id":"W2293843830","doi":"10.1007/978-3-662-47804-2_6","title":"Mining Popular Patterns: A Novel Mining Problem and Its Application to Static Transactional Databases and Dynamic Data Streams","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Computer science; Popularity; Data stream mining; Data mining; Transactional leadership; STREAMS; Tree (set theory); Database; Mathematics","score_opus":0.05328995517311378,"score_gpt":0.30167461196281686,"score_spread":0.2483846567897031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293843830","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.04446996,0.0026264188,0.9454902,0.0029509095,0.00027619713,0.00016548636,0.0011820615,0.000593548,0.0022451296],"genre_scores_gemma":[0.28107524,0.00458185,0.70203507,0.000540936,0.001621535,0.00028275204,0.0023480156,0.00023251784,0.0072820936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711335,0.00035647344,0.00035610053,0.0009215824,0.0011092378,0.00014323977],"domain_scores_gemma":[0.9896824,0.005963896,0.0011077748,0.0010318111,0.001756105,0.0004579468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287336,0.0012709057,0.0019778975,0.00446539,0.001618538,0.004683827,0.0033409854,0.0030553988,0.0015773718],"category_scores_gemma":[0.016969783,0.0009961121,0.0018557318,0.011634857,0.0016507108,0.010060215,0.00286821,0.0029584316,0.00083891413],"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.0004968775,0.0006178382,0.031954262,0.0011147974,0.00032805098,0.002203093,0.0010183011,0.04461756,0.007925815,0.120024726,0.026053555,0.7636451],"study_design_scores_gemma":[0.000045616947,0.00014893156,0.0034777,0.00009402326,0.00014793825,0.003389261,0.0006118172,0.78756523,0.0044213193,0.18881561,0.011218185,0.00006422012],"about_ca_topic_score_codex":0.0014123772,"about_ca_topic_score_gemma":0.001833751,"teacher_disagreement_score":0.004683827,"about_ca_system_score_codex":0.0007772208,"about_ca_system_score_gemma":0.0010668031,"threshold_uncertainty_score":0.015195966},"labels":[],"label_agreement":null},{"id":"W2293956874","doi":"10.1007/978-3-319-27060-9_10","title":"Practical Measurements for Quality of Ontology Matching Applying to the OAEI Dataset","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Ontology alignment; Computer science; Ontology; Matching (statistics); Benchmark (surveying); Information retrieval; Data mining; Modalities; Process ontology; Semantic Web; Mathematics","score_opus":0.2389345480336807,"score_gpt":0.4028334714542066,"score_spread":0.16389892342052592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293956874","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.5984693,0.011340126,0.26117054,0.0033799745,0.0015297399,0.00084265746,0.08063675,0.01946043,0.023170514],"genre_scores_gemma":[0.6285072,0.0011372244,0.24099983,0.00044723466,0.0002934346,0.00033141684,0.124204524,0.0015939338,0.002485252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96346265,0.009968504,0.005009773,0.0068064206,0.013041714,0.0017108882],"domain_scores_gemma":[0.90598404,0.050775327,0.0039740633,0.02177904,0.0160373,0.0014502351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026300834,0.0012272204,0.0015320801,0.008228888,0.001753055,0.0056531364,0.0030699098,0.003311612,0.0041986834],"category_scores_gemma":[0.12046491,0.0004348002,0.0014799379,0.012988286,0.00160618,0.006545662,0.0035179283,0.0015574619,0.002023581],"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.0064141504,0.0012876476,0.17151631,0.0038413033,0.0024865703,0.00035622958,0.0013128665,0.078344114,0.026265934,0.028073441,0.14192317,0.53817827],"study_design_scores_gemma":[0.00075532484,0.0011790494,0.13559398,0.0008517294,0.0009322512,0.0017120598,0.003319796,0.65097904,0.064618625,0.06776781,0.07193571,0.00035468955],"about_ca_topic_score_codex":0.008145847,"about_ca_topic_score_gemma":0.013154786,"teacher_disagreement_score":0.026300834,"about_ca_system_score_codex":0.001890674,"about_ca_system_score_gemma":0.0023254792,"threshold_uncertainty_score":0.13909376},"labels":[],"label_agreement":null},{"id":"W2293979936","doi":"10.1007/978-3-319-24282-8_7","title":"Geo-Coordinated Parallel Coordinates (GCPC): A Case Study of Environmental Data Analysis","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 Regina","funders":"","keywords":"Geospatial analysis; Computer science; Parallel coordinates; Geovisualization; Curse of dimensionality; Visualization; Data science; Data mining; Data visualization; Knowledge extraction; Information retrieval; Machine learning; Cartography; Information visualization; Geography","score_opus":0.05141459868308177,"score_gpt":0.3120588057251402,"score_spread":0.26064420704205843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293979936","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.6409942,0.0012929993,0.25757146,0.003761607,0.00016170117,0.0005180511,0.0029133286,0.0022363132,0.090550266],"genre_scores_gemma":[0.8197846,0.0008590378,0.16653058,0.00013757587,0.000033885193,0.00009210248,0.000975174,0.00031422343,0.011272789],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985238,0.0006438925,0.00004449112,0.00015985026,0.00051309104,0.0001149891],"domain_scores_gemma":[0.9979248,0.0012941813,0.00010783246,0.0002496793,0.00032581063,0.000097663615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013195963,0.0004955565,0.00031725733,0.0009769631,0.0014635803,0.002293503,0.0010849847,0.0013044203,0.0023928587],"category_scores_gemma":[0.0034269602,0.00022235338,0.0003960087,0.0069059376,0.0012999343,0.0009957165,0.0013652126,0.00060648046,0.00056815177],"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.00048333415,0.00040078827,0.057775375,0.0010525965,0.00015570727,0.016861133,0.017094024,0.23542833,0.010476196,0.09836761,0.048251692,0.51365334],"study_design_scores_gemma":[0.00018077991,0.00046074178,0.049961634,0.0002968737,0.00027486423,0.0069637443,0.042708267,0.44032395,0.024893716,0.060044132,0.37373504,0.00015627602],"about_ca_topic_score_codex":0.04257824,"about_ca_topic_score_gemma":0.070141114,"teacher_disagreement_score":0.04257824,"about_ca_system_score_codex":0.0011676379,"about_ca_system_score_gemma":0.0020365869,"threshold_uncertainty_score":0.08466083},"labels":[],"label_agreement":null},{"id":"W2294022199","doi":"10.1007/978-3-319-06483-3_15","title":"Partial Satisfaction Planning under Time Uncertainty with Control on When Objectives Can Be Aborted","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abort; Computer science; Plan (archaeology); Control (management); Operations research; Mathematical optimization; Order (exchange); Artificial intelligence; Mathematics","score_opus":0.013102735579235032,"score_gpt":0.23088964101637782,"score_spread":0.2177869054371428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294022199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350775,0.0005567476,0.944377,0.00067141495,0.000108399996,0.00009289538,0.00025013436,0.00044231184,0.01999336],"genre_scores_gemma":[0.78925705,0.00069921854,0.1978264,0.00014969609,0.000121289806,0.0002063211,0.00044266903,0.00018908226,0.011108329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988912,0.00034258424,0.000056439763,0.00015954729,0.00037029933,0.00017995392],"domain_scores_gemma":[0.99761814,0.0016834226,0.00016690855,0.00014625138,0.00025150817,0.00013379555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013792404,0.0008391428,0.00079731777,0.0003847868,0.000507903,0.0012933409,0.0011484771,0.00069758686,0.0043318495],"category_scores_gemma":[0.00481397,0.00064889994,0.00085945893,0.0008249623,0.0013959289,0.0021504918,0.0013716964,0.0019472825,0.00033840953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029636736,0.000044973465,0.00037761114,0.00022898274,0.00007033708,0.00021127395,0.00028687966,0.7603847,0.002746441,0.16338314,0.0034888205,0.06848051],"study_design_scores_gemma":[0.000019217874,0.00007279172,0.00018401496,0.000030520325,0.000021262735,0.00003293174,0.00007279103,0.818574,0.0017089563,0.17729057,0.001976947,0.000016028143],"about_ca_topic_score_codex":0.004627596,"about_ca_topic_score_gemma":0.004385758,"teacher_disagreement_score":0.004627596,"about_ca_system_score_codex":0.0010506411,"about_ca_system_score_gemma":0.001638229,"threshold_uncertainty_score":0.0144914985},"labels":[],"label_agreement":null},{"id":"W2294069062","doi":"10.1007/978-3-319-26626-8_7","title":"Variants of Multi-resource Scheduling Problems with Equal Processing Times","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"","keywords":"Computer science; Time complexity; Monotonic function; Scheduling (production processes); Generalization; Job shop scheduling; Polynomial; Function (biology); Mathematical optimization; Algorithm; Set (abstract data type); Mathematics; Schedule","score_opus":0.02513931037187123,"score_gpt":0.23903700938180816,"score_spread":0.21389769900993694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294069062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02495042,0.0025088557,0.95244277,0.00084038096,0.00095950946,0.00015729714,0.0002307974,0.00017987037,0.017730083],"genre_scores_gemma":[0.44808966,0.0031749192,0.51396656,0.000565857,0.0016632364,0.00047997053,0.00076610915,0.0004960998,0.030797651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957742,0.0019393566,0.00024549625,0.0007972713,0.00080024597,0.00044351158],"domain_scores_gemma":[0.99417454,0.0034217304,0.00057008665,0.00075350655,0.00059886725,0.00048138786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054844557,0.002307829,0.0019841876,0.0010694402,0.00076592667,0.0030453308,0.004999971,0.0021975709,0.006142652],"category_scores_gemma":[0.01146924,0.0009873784,0.0026622,0.0022627057,0.0016787268,0.004856717,0.002460954,0.0043242653,0.0008920378],"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.0005955325,0.00024083981,0.00053678494,0.0005778193,0.0001875757,0.00039219848,0.0001338085,0.38210073,0.003602577,0.5365161,0.009329583,0.0657864],"study_design_scores_gemma":[0.00008498451,0.00014724575,0.00043919732,0.000045350578,0.000059636204,0.00029255482,0.000053719315,0.7396918,0.0011366936,0.25121626,0.0067907902,0.00004176656],"about_ca_topic_score_codex":0.0011634429,"about_ca_topic_score_gemma":0.0010809251,"teacher_disagreement_score":0.006142652,"about_ca_system_score_codex":0.0017632715,"about_ca_system_score_gemma":0.0012412646,"threshold_uncertainty_score":0.029004931},"labels":[],"label_agreement":null},{"id":"W2294136007","doi":"10.1007/978-3-319-20801-5_40","title":"Statistical Textural Distinctiveness in Multi-Parametric Prostate MRI for Suspicious Region Detection","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Optimal distinctiveness theory; Computer science; Artificial intelligence; Parametric statistics; Pattern recognition (psychology); Prostate cancer; Homogeneous; Computer vision; Texture (cosmology); Cancer; Image (mathematics); Medicine; Mathematics; Statistics","score_opus":0.04469763455020679,"score_gpt":0.3205198136397765,"score_spread":0.2758221790895697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294136007","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.16102815,0.0035983052,0.8305124,0.00023966483,0.00013948923,0.00007329685,0.00044509757,0.0010204964,0.002943112],"genre_scores_gemma":[0.77626926,0.0030675214,0.21366113,0.000117567135,0.00033527103,0.00007217154,0.0008491887,0.0004117512,0.0052160746],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978524,0.000036622285,0.000018458182,0.000044465327,0.000089745794,0.000025518904],"domain_scores_gemma":[0.9989826,0.00046259904,0.00015897423,0.00011491387,0.00021772784,0.000063205436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904865,0.00041074224,0.00041204857,0.0012988966,0.00015619742,0.00061213906,0.0004987595,0.00041790414,0.0018327641],"category_scores_gemma":[0.0020618003,0.00020081605,0.00058401027,0.0010659092,0.00035039466,0.0008348182,0.0005447465,0.0005401457,0.00091126695],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004664627,0.00008659465,0.0036411758,0.0003744692,0.00006927942,0.00034466563,0.0001094301,0.019988932,0.31123206,0.002403333,0.0019806663,0.65930295],"study_design_scores_gemma":[0.000021129159,0.00053373736,0.037872978,0.00007849865,0.00022031285,0.0034239506,0.00017768855,0.7779292,0.16487586,0.007916128,0.006846465,0.000104080544],"about_ca_topic_score_codex":0.00031701758,"about_ca_topic_score_gemma":0.0005542545,"teacher_disagreement_score":0.0018327641,"about_ca_system_score_codex":0.00014580932,"about_ca_system_score_gemma":0.00019755104,"threshold_uncertainty_score":0.006131172},"labels":[],"label_agreement":null},{"id":"W2294310578","doi":"10.1007/978-3-319-25258-2_27","title":"A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Consensus; Distributed computing; Theoretical computer science; Shared memory; Hierarchy; Process (computing); Scheduling (production processes); Set (abstract data type); Asynchronous system; Multi-agent system; Artificial intelligence; Programming language; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.026949547613479907,"score_gpt":0.2902424270642802,"score_spread":0.2632928794508003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294310578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007897725,0.00027874458,0.98556685,0.00014705388,0.00018897101,0.00005730335,0.000026578482,0.0003972398,0.005439568],"genre_scores_gemma":[0.47603202,0.0004775936,0.51126766,0.00024525635,0.00025732027,0.0002454274,0.00019970875,0.0002109553,0.011064134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.0002459836,0.00007387226,0.00022912936,0.0002912774,0.00011966467],"domain_scores_gemma":[0.9990908,0.00038203478,0.000057171073,0.00023027114,0.00016384186,0.000075871016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718713,0.0005691967,0.0011745251,0.00043555332,0.0007438567,0.0010771604,0.0018105342,0.0008611288,0.0030306114],"category_scores_gemma":[0.002121515,0.00041341383,0.00093641167,0.00068372226,0.00085609354,0.0015078103,0.00210513,0.0019745259,0.0008236588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091125636,0.00022393312,0.0003643567,0.00043999424,0.00011525353,0.00030829126,0.0003629205,0.20578644,0.05494019,0.49610326,0.0063481373,0.23409596],"study_design_scores_gemma":[0.00008239988,0.00015459662,0.00016594355,0.000027034725,0.000037262333,0.0001171487,0.000024259622,0.8467781,0.0077863242,0.13886695,0.0059306985,0.000029266655],"about_ca_topic_score_codex":0.0012879169,"about_ca_topic_score_gemma":0.0012644503,"teacher_disagreement_score":0.0030306114,"about_ca_system_score_codex":0.0009471844,"about_ca_system_score_gemma":0.0016323188,"threshold_uncertainty_score":0.010138333},"labels":[],"label_agreement":null},{"id":"W2294431252","doi":"10.1007/978-3-319-24069-5_21","title":"Enhancing History-Based Move Ordering in Game Playing Using Adaptive Data Structures","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Carleton University","funders":"","keywords":"Computer science; Heuristics; Heuristic; Variety (cybernetics); Field (mathematics); Ranking (information retrieval); Adversary; Perspective (graphical); Combinatorial game theory; Video game design; Artificial intelligence; Sequential game; Game theory; Game mechanics; Mathematical economics; Computer security; Mathematics","score_opus":0.12144958667199106,"score_gpt":0.3116613849646072,"score_spread":0.19021179829261614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294431252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07622784,0.00034741109,0.9136482,0.00015732466,0.00012709473,0.00016422577,0.00028406864,0.0039734757,0.0050704065],"genre_scores_gemma":[0.6560755,0.0002139322,0.33686146,0.00005882491,0.00004211073,0.00013206755,0.00053179695,0.00027396868,0.0058103995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00009957957,0.00005107482,0.000117920325,0.00022968212,0.00007525899],"domain_scores_gemma":[0.9973454,0.0013853564,0.00016273613,0.00048800829,0.00038193536,0.00023660137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611537,0.00063300354,0.00076157146,0.0008861025,0.000631374,0.0011989458,0.0018077606,0.00061428105,0.0070285387],"category_scores_gemma":[0.004340321,0.00042754767,0.00038753558,0.0009811635,0.0005738942,0.0029257273,0.0018935447,0.0013827974,0.0010394809],"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.002043406,0.0012467841,0.004478749,0.00033026727,0.0000807908,0.00019203019,0.00058911386,0.1652962,0.038125753,0.059746217,0.007342441,0.72052824],"study_design_scores_gemma":[0.00011345563,0.00022581535,0.0007935976,0.000025411182,0.000033538345,0.000067507855,0.00015349126,0.9516522,0.012826859,0.030237032,0.0038376094,0.000033515327],"about_ca_topic_score_codex":0.004581834,"about_ca_topic_score_gemma":0.009224737,"teacher_disagreement_score":0.0070285387,"about_ca_system_score_codex":0.0006416784,"about_ca_system_score_gemma":0.0016391167,"threshold_uncertainty_score":0.02351284},"labels":[],"label_agreement":null},{"id":"W2294439425","doi":"10.1007/978-3-319-22479-4_22","title":"Comparing Local e-Government Websites in Canada and the UK","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","field":"Social Sciences","cited_by":8,"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":"Local government; Conceptualization; E-Government; Government (linguistics); Computer science; World Wide Web; Public relations; Political science; Public administration; Artificial intelligence; Information and Communications Technology","score_opus":0.021744062501721766,"score_gpt":0.238185482797523,"score_spread":0.21644142029580124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294439425","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.9666477,0.0019735093,0.0001243688,0.001721175,0.00005023268,0.00005718999,0.0037948317,0.000044875156,0.025586158],"genre_scores_gemma":[0.99092555,0.0007333142,0.00010547702,0.00018734399,0.000009469909,0.00001732803,0.0015648667,0.000040022725,0.006416725],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99565613,0.0005388422,0.00020387046,0.00032079904,0.0016617577,0.0016184804],"domain_scores_gemma":[0.9770105,0.0036743896,0.0019578466,0.00036753112,0.013217166,0.0037725125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020370423,0.00033437452,0.0006844981,0.00650337,0.0063230884,0.008932216,0.0018922602,0.0010448139,0.009790937],"category_scores_gemma":[0.017407347,0.0003788901,0.0006150482,0.024409084,0.0033724061,0.0028338982,0.003418762,0.0014260563,0.0013062218],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014206042,0.00042579186,0.8490267,0.00056537596,0.00018954002,0.001093888,0.05021279,0.0016021354,0.0005156002,0.010189693,0.03230868,0.052449133],"study_design_scores_gemma":[0.00002423874,0.00006339298,0.86207646,0.00029314813,0.000088198976,0.00010452902,0.1223247,0.0007732442,0.0002546666,0.0002775112,0.013653402,0.000066574175],"about_ca_topic_score_codex":0.9953589,"about_ca_topic_score_gemma":0.99800307,"teacher_disagreement_score":0.08180379,"about_ca_system_score_codex":0.08180379,"about_ca_system_score_gemma":0.05225337,"threshold_uncertainty_score":0.59353083},"labels":[],"label_agreement":null},{"id":"W2294449021","doi":"10.1007/978-3-662-49192-8_20","title":"Pseudoknot-Generating Operation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"Queen's University","funders":"","keywords":"Pseudoknot; Undecidable problem; Computer science; String (physics); Automaton; Context (archaeology); Theoretical computer science; Algorithm; Closure (psychology); Recursively enumerable language; Time complexity; Decidability; Mathematics; Base sequence; DNA","score_opus":0.012799778838276418,"score_gpt":0.235933880385157,"score_spread":0.22313410154688057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294449021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028095286,0.00035419452,0.8783011,0.00031724715,0.0010562215,0.00016176995,0.00043371972,0.0027252017,0.08855535],"genre_scores_gemma":[0.5538532,0.00082020747,0.35890046,0.0005944136,0.0005441714,0.00033632028,0.001231589,0.00209448,0.081625156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992073,0.00014715054,0.00005821635,0.0002034345,0.0002881991,0.000095577976],"domain_scores_gemma":[0.99926716,0.00026731953,0.000044544755,0.00022221163,0.00014963697,0.00004912524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006518715,0.0007036847,0.00044761275,0.0007669236,0.0007598914,0.0009841523,0.0009921101,0.0007642483,0.011801298],"category_scores_gemma":[0.0015673707,0.0002643288,0.0006519013,0.00071191153,0.0012715287,0.001983977,0.001661651,0.0012878556,0.004791855],"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.00019771686,0.000039408333,0.00017496476,0.0002182842,0.000012448903,0.0003133293,0.00021103186,0.0030048462,0.025277488,0.7930553,0.011143239,0.16635199],"study_design_scores_gemma":[0.00006798967,0.00020039499,0.00045083047,0.00006988048,0.00005150988,0.0024684665,0.00006788536,0.032774173,0.11183967,0.7129527,0.13894086,0.00011563292],"about_ca_topic_score_codex":0.00011643159,"about_ca_topic_score_gemma":0.00012427382,"teacher_disagreement_score":0.011801298,"about_ca_system_score_codex":0.00035562826,"about_ca_system_score_gemma":0.00038539027,"threshold_uncertainty_score":0.039479315},"labels":[],"label_agreement":null},{"id":"W2294493990","doi":"10.1007/978-3-319-20801-5_51","title":"Color Space Identification for Image Display","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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":"Université de Sherbrooke","funders":"","keywords":"Color histogram; Computer vision; Color space; Artificial intelligence; RGB color model; Computer science; Color image; RGB color space; Color balance; False color; Color quantization; Color depth; ICC profile; Computer graphics (images); Color model; Image (mathematics); Image processing","score_opus":0.019429009378502577,"score_gpt":0.2890780565055603,"score_spread":0.26964904712705773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294493990","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035974632,0.004809191,0.9276141,0.00028552578,0.000880292,0.00007501429,0.00043585012,0.0067083915,0.055594243],"genre_scores_gemma":[0.12430768,0.008064541,0.6854737,0.00047701926,0.00040898114,0.00015529749,0.0014603208,0.0021341527,0.17751838],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997011,0.000034165256,0.000012652253,0.00006087073,0.0001536313,0.00003762725],"domain_scores_gemma":[0.9996401,0.00006756449,0.000018816992,0.00010092708,0.00015616856,0.000016388605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023267441,0.0008764104,0.0005030984,0.0010346308,0.00052786875,0.0016848664,0.0011749717,0.0007095902,0.039885733],"category_scores_gemma":[0.0007657095,0.00035713622,0.00034183508,0.0015345257,0.000518344,0.0016371631,0.0010630494,0.0011212571,0.017222604],"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.00016954761,0.000042612213,0.00018239762,0.00040614622,0.000016710386,0.00014403432,0.00011315696,0.0021566057,0.092702,0.0776055,0.057451256,0.76901],"study_design_scores_gemma":[0.000022733875,0.00012267569,0.0009729072,0.00026334423,0.000047779686,0.0017877307,0.0001661441,0.09666494,0.25858167,0.054039083,0.58723474,0.000096217096],"about_ca_topic_score_codex":0.00082895474,"about_ca_topic_score_gemma":0.000903668,"teacher_disagreement_score":0.039885733,"about_ca_system_score_codex":0.0005435266,"about_ca_system_score_gemma":0.00033208178,"threshold_uncertainty_score":0.13343108},"labels":[],"label_agreement":null},{"id":"W2294497255","doi":"10.1007/978-3-319-26187-4_35","title":"A Data Quality Framework for Customer Relationship Analytics","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Computer science; Data quality; Inefficiency; Key (lock); Quality (philosophy); Data analysis; Data science; Customer relationship management; Analytics; Set (abstract data type); Data management; Data set; Data modeling; Data mining; Database; Computer security; Business; Artificial intelligence; Marketing","score_opus":0.5334999294272715,"score_gpt":0.49637163349274754,"score_spread":0.03712829593452399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294497255","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.0006066527,0.00047291373,0.9932226,0.001217646,0.00008880834,0.00016662573,0.000457236,0.0010120689,0.002755416],"genre_scores_gemma":[0.031826377,0.00092155044,0.9609218,0.00054070173,0.00025636356,0.00036622817,0.0017441096,0.0004224555,0.0030003712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9835141,0.004523234,0.0023182535,0.0013696074,0.007537512,0.00073726266],"domain_scores_gemma":[0.9773228,0.007887516,0.0014881138,0.0050473767,0.007465517,0.000788659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022239478,0.0014280635,0.001501306,0.008164565,0.0018833731,0.011977513,0.004457315,0.0026647244,0.005678746],"category_scores_gemma":[0.03814236,0.0014028804,0.0037105072,0.009912996,0.0027900604,0.014428066,0.0066045746,0.0060022073,0.0026738832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000517478,0.00011555535,0.001912738,0.00037819534,0.00009710674,0.00012379177,0.00043148347,0.012820237,0.0011310809,0.8099225,0.025471175,0.14754434],"study_design_scores_gemma":[0.00002950614,0.00005472434,0.00097083015,0.00047332808,0.00010070636,0.00029101028,0.0003366596,0.20410825,0.0031872303,0.6724781,0.1178918,0.00007781132],"about_ca_topic_score_codex":0.011588921,"about_ca_topic_score_gemma":0.007597815,"teacher_disagreement_score":0.022239478,"about_ca_system_score_codex":0.0038840743,"about_ca_system_score_gemma":0.005396919,"threshold_uncertainty_score":0.117614985},"labels":[],"label_agreement":null},{"id":"W2294579401","doi":"10.1007/978-3-319-24282-8_21","title":"Evaluating the Effectiveness of Hashtags as Predictors of the Sentiment of Tweets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Regina","funders":"","keywords":"Sentiment analysis; Computer science; Natural language processing; Psychology","score_opus":0.044643203631588024,"score_gpt":0.3243244597088126,"score_spread":0.27968125607722455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294579401","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.98798954,0.0014029284,0.0056939754,0.000294117,0.00019071583,0.000065221815,0.0017618249,0.00045590848,0.0021457751],"genre_scores_gemma":[0.9882648,0.00040982864,0.0063129137,0.00004274571,0.00015293906,0.000032863154,0.0035669967,0.000038123017,0.001178762],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99829715,0.0007850387,0.00014232378,0.00025537907,0.00036610715,0.00015410283],"domain_scores_gemma":[0.9726299,0.02410384,0.0007974141,0.0005606158,0.0012800758,0.000628239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045570782,0.0012168834,0.00080374157,0.0019427948,0.00036912606,0.0013770347,0.00052798545,0.0012326878,0.0013486409],"category_scores_gemma":[0.013944127,0.00026523156,0.0006279728,0.0013912388,0.0002897426,0.0019259718,0.0006223758,0.0009615518,0.0013166901],"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.014980623,0.0037683176,0.3884425,0.001432994,0.0017749215,0.00032830413,0.0007258239,0.06136575,0.036319196,0.00090839627,0.018270588,0.47168264],"study_design_scores_gemma":[0.0003194034,0.00471407,0.099626586,0.000079815974,0.0007245284,0.00020127007,0.0006651234,0.86754704,0.022674039,0.0015759474,0.001777885,0.000094349845],"about_ca_topic_score_codex":0.00256352,"about_ca_topic_score_gemma":0.0030140982,"teacher_disagreement_score":0.0045570782,"about_ca_system_score_codex":0.00033671936,"about_ca_system_score_gemma":0.00046194394,"threshold_uncertainty_score":0.024100423},"labels":[],"label_agreement":null},{"id":"W2294590546","doi":"10.1007/978-3-319-24489-1_22","title":"Accurate Online Social Network User Profiling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Université du Québec à Montréal; Université de Moncton","funders":"","keywords":"Computer science; Profiling (computer programming); Inference; Social graph; Graph; Social network (sociolinguistics); Theoretical computer science; Data mining; Social media; Artificial intelligence; World Wide Web","score_opus":0.03514172732641399,"score_gpt":0.30271006616246376,"score_spread":0.2675683388360498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294590546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18404059,0.003146794,0.78115404,0.0013588369,0.0005967538,0.00021370137,0.009451782,0.004841408,0.015196095],"genre_scores_gemma":[0.8663896,0.0015536277,0.107758194,0.00019657149,0.0008367604,0.00014021882,0.007597437,0.00021415163,0.015313515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804974,0.000493246,0.00008260922,0.00039174227,0.00076878647,0.00021391982],"domain_scores_gemma":[0.99602014,0.0013949238,0.00037573377,0.0012699212,0.0007365622,0.00020279855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052553,0.0008779073,0.0012125745,0.0022996573,0.0005424426,0.0014987148,0.001251669,0.0011140406,0.0024041245],"category_scores_gemma":[0.008956686,0.0005921504,0.0004396444,0.0023685892,0.00027788334,0.0039825463,0.0018970219,0.0013204626,0.004135647],"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.0006048938,0.0006036793,0.061382737,0.00032629922,0.00027795075,0.000287949,0.00030408747,0.09856377,0.019078275,0.018214608,0.046854597,0.7535011],"study_design_scores_gemma":[0.000006424127,0.000052934196,0.010387163,0.000036663263,0.000035528272,0.00034395716,0.00010969475,0.9578083,0.0061625447,0.017597796,0.007431289,0.000027638484],"about_ca_topic_score_codex":0.0022270724,"about_ca_topic_score_gemma":0.0044164867,"teacher_disagreement_score":0.0024041245,"about_ca_system_score_codex":0.0005240541,"about_ca_system_score_gemma":0.00046429114,"threshold_uncertainty_score":0.008042574},"labels":[],"label_agreement":null},{"id":"W2294604582","doi":"10.1007/978-3-662-48971-0_8","title":"Multidimensional Range Selection","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Range (aeronautics); Selection (genetic algorithm); Artificial intelligence; Engineering","score_opus":0.025958850772309795,"score_gpt":0.26056020804899827,"score_spread":0.23460135727668846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294604582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009264719,0.004460327,0.9268476,0.00026986474,0.00047375608,0.00007594598,0.000513775,0.0024486596,0.05564537],"genre_scores_gemma":[0.16081767,0.005682519,0.74651664,0.0005260157,0.000681822,0.0002064334,0.0028821689,0.0012123996,0.08147433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.000044599863,0.000019876525,0.00009072733,0.00020360164,0.000033450007],"domain_scores_gemma":[0.99964774,0.0000955922,0.000020049372,0.00011806832,0.000095066185,0.000023531584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029715305,0.00066542067,0.0007487682,0.0011697036,0.00044384037,0.0011505472,0.0007196149,0.00045538033,0.022843713],"category_scores_gemma":[0.00089920004,0.00026536637,0.00050092593,0.0018588745,0.0003584809,0.0010805812,0.0015552739,0.0008110146,0.009490683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015256158,0.000032877913,0.00031138505,0.00027706384,0.000029545276,0.00014101635,0.00006399552,0.004344565,0.04557021,0.030898768,0.026782108,0.8913959],"study_design_scores_gemma":[0.000079716345,0.00036471177,0.002702615,0.00029886604,0.00012335388,0.0052870116,0.00024561211,0.2238904,0.17906761,0.081064515,0.50671285,0.00016272713],"about_ca_topic_score_codex":0.00015060646,"about_ca_topic_score_gemma":0.00022726145,"teacher_disagreement_score":0.022843713,"about_ca_system_score_codex":0.00016206171,"about_ca_system_score_gemma":0.00020464207,"threshold_uncertainty_score":0.07641983},"labels":[],"label_agreement":null},{"id":"W2294664220","doi":"10.1007/978-3-319-24126-5_9","title":"Improved Key Recovery Attack on Round-reduced Hierocrypt-L1 in the Single-Key Setting","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Key (lock); Differential cryptanalysis; Cryptanalysis; Linear cryptanalysis; Key schedule; Theoretical computer science; Computer security; Algorithm; Arithmetic; Cryptography; Mathematics","score_opus":0.05472513066745953,"score_gpt":0.299097783006187,"score_spread":0.24437265233872746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294664220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26839003,0.0018176825,0.62586707,0.0058231163,0.00062190706,0.00062989234,0.0012955685,0.005919596,0.089635074],"genre_scores_gemma":[0.9306669,0.0002884563,0.053904373,0.0006722781,0.0001300699,0.00014923628,0.00040479074,0.00019577156,0.013588177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969104,0.000649694,0.00010455583,0.00040411227,0.0011247464,0.000806576],"domain_scores_gemma":[0.9982912,0.0005823105,0.000105443854,0.0007810046,0.00015326943,0.000086783984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014407947,0.00076854194,0.0013738459,0.0007256945,0.0014191173,0.0017854023,0.0015446359,0.0021078165,0.0067547434],"category_scores_gemma":[0.0028600076,0.00045481574,0.0010397047,0.0007995977,0.0016785836,0.0033566693,0.0053998553,0.0032029978,0.0025780348],"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.0040751444,0.00058564026,0.0013558156,0.00078635756,0.0003234575,0.0014027788,0.0011268882,0.0561989,0.07703828,0.5839703,0.042784173,0.23035221],"study_design_scores_gemma":[0.00077971024,0.000757543,0.0015884169,0.00013858189,0.00024241942,0.0019417604,0.00030600152,0.38778496,0.10318702,0.47910723,0.023918206,0.0002481668],"about_ca_topic_score_codex":0.00060293596,"about_ca_topic_score_gemma":0.00067598943,"teacher_disagreement_score":0.0067547434,"about_ca_system_score_codex":0.0013773324,"about_ca_system_score_gemma":0.0017513661,"threshold_uncertainty_score":0.022596896},"labels":[],"label_agreement":null},{"id":"W2294665552","doi":"10.1007/978-3-319-24126-5_7","title":"Preimage Analysis of the Maelstrom-0 Hash Function","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and 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":"Concordia University","funders":"","keywords":"Hash function; Computer science; Chaining; Cryptographic hash function; SHA-2; Collision attack; Checksum; Collision resistance; Function (biology); Hash chain; Theoretical computer science; Algorithm; Perfect hash function; Double hashing; Computer security; Operating system","score_opus":0.028741353292752597,"score_gpt":0.2728298333949039,"score_spread":0.2440884801021513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294665552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44215932,0.0027132998,0.465447,0.0019738518,0.00075926486,0.00022362011,0.00050343346,0.0021778785,0.08404243],"genre_scores_gemma":[0.93170065,0.00051868736,0.038340315,0.00032502582,0.00037672906,0.00007661832,0.00045216692,0.00032316791,0.027886521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991135,0.00013927305,0.000041991592,0.00009799214,0.00046065488,0.0001464804],"domain_scores_gemma":[0.9985991,0.00064288295,0.000099987585,0.0003905242,0.00022125241,0.000046219837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594593,0.00064342277,0.00059291447,0.0012638728,0.00076658785,0.0016517155,0.00096854696,0.0009545729,0.008995799],"category_scores_gemma":[0.0034548577,0.00030369524,0.0008712133,0.0006328003,0.0015401982,0.0026715065,0.0017107186,0.0014477209,0.002103228],"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.0010990547,0.0001352556,0.0025306009,0.00029473327,0.00007827986,0.0010438539,0.0007222771,0.012813423,0.04071062,0.8100272,0.009534316,0.12101041],"study_design_scores_gemma":[0.00006951552,0.00040387514,0.003345051,0.00010402308,0.00008054595,0.0015387895,0.00023898207,0.150382,0.06721333,0.75818634,0.01833572,0.000101826416],"about_ca_topic_score_codex":0.00031888907,"about_ca_topic_score_gemma":0.00032448873,"teacher_disagreement_score":0.008995799,"about_ca_system_score_codex":0.00090450107,"about_ca_system_score_gemma":0.00081976136,"threshold_uncertainty_score":0.030093968},"labels":[],"label_agreement":null},{"id":"W2294736443","doi":"10.1007/978-3-319-26190-4_17","title":"A Mashup Architecture with Modeling and Simulation as a Service","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Carleton University","funders":"","keywords":"Mashup; Architecture; Computer science; Service (business); Service model; Service-oriented architecture; Computer architecture; Software engineering; World Wide Web; Web service; Business; Art; Web 2.0","score_opus":0.019773762851696713,"score_gpt":0.24927371017095468,"score_spread":0.22949994731925796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294736443","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.0075490247,0.00012737462,0.9698065,0.00030734908,0.000068175075,0.00013953069,0.00008987154,0.012062537,0.00984972],"genre_scores_gemma":[0.1313122,0.0005071983,0.849841,0.00023341746,0.00008775095,0.0003761231,0.0007121458,0.0017098348,0.015220311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935454,0.00015243115,0.000052547188,0.00012982803,0.00026107221,0.000049640155],"domain_scores_gemma":[0.9993911,0.00020923643,0.000031041076,0.0001836106,0.000089073845,0.00009584449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112957,0.00097466074,0.00079614064,0.0007853242,0.0010303172,0.0022219995,0.0018267349,0.0015073625,0.006651155],"category_scores_gemma":[0.0015715131,0.0007618284,0.0009955368,0.00074322784,0.000943279,0.0028520527,0.002505536,0.0020392586,0.0026163703],"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.0004146678,0.00067004934,0.0017759351,0.00042959396,0.0002370575,0.0014096681,0.0017507995,0.2228401,0.068568476,0.3222367,0.020026656,0.3596403],"study_design_scores_gemma":[0.000058388592,0.00008316075,0.00027728046,0.000076236865,0.000068972135,0.0004336968,0.000108808716,0.79911643,0.018819673,0.096022144,0.08487733,0.00005787644],"about_ca_topic_score_codex":0.0030866943,"about_ca_topic_score_gemma":0.0020791553,"teacher_disagreement_score":0.006651155,"about_ca_system_score_codex":0.00068482925,"about_ca_system_score_gemma":0.0012957737,"threshold_uncertainty_score":0.022250354},"labels":[],"label_agreement":null},{"id":"W2294742457","doi":"10.1007/978-3-319-28406-4_1","title":"How to Build a Recommendation System for Software Engineering","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 British Columbia; University of British Columbia Hospital","funders":"","keywords":"Computer science; Recommender system; Workflow; Software engineering; Software; Software development; Software system; Software construction; World Wide Web; Database; Programming language","score_opus":0.028953439651432284,"score_gpt":0.2633819535725717,"score_spread":0.23442851392113942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294742457","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.01064135,0.0017469029,0.88776344,0.0021279017,0.0007235603,0.00069750316,0.0049392134,0.06938595,0.021974161],"genre_scores_gemma":[0.034741074,0.0010376374,0.92571783,0.0005363356,0.00015826992,0.0002708223,0.005671503,0.0013045619,0.030561827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937963,0.000100831334,0.000059329635,0.00015506409,0.00025843314,0.00004665558],"domain_scores_gemma":[0.99880886,0.00029248724,0.000042297466,0.000353613,0.00042238267,0.00008041757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009578901,0.0007159925,0.0008135166,0.0016884948,0.00076928927,0.0018567682,0.0010889993,0.0016344073,0.021007882],"category_scores_gemma":[0.0046673263,0.0006221433,0.0011817511,0.0016619832,0.00016542817,0.0037952524,0.0008044936,0.0013878339,0.024050724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010507278,0.0001456828,0.0020567877,0.00026997263,0.00012252743,0.00011336443,0.00009334856,0.0028772803,0.0070322347,0.004238605,0.13824907,0.84469604],"study_design_scores_gemma":[0.00023214842,0.0003130833,0.00960106,0.0004210883,0.0005416356,0.0013616165,0.00037929928,0.36939737,0.040887482,0.049719945,0.52688557,0.00025971734],"about_ca_topic_score_codex":0.0077154413,"about_ca_topic_score_gemma":0.01317521,"teacher_disagreement_score":0.021007882,"about_ca_system_score_codex":0.00042286853,"about_ca_system_score_gemma":0.00060965086,"threshold_uncertainty_score":0.070278406},"labels":[],"label_agreement":null},{"id":"W2294802772","doi":"10.1007/978-3-642-21204-8_9","title":"An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Substring; Approximation algorithm; Combinatorics; Algorithm; STRIPS; Sequence (biology); Set (abstract data type); Mathematics; Computer science; Discrete mathematics","score_opus":0.018308779091921582,"score_gpt":0.24182019847335337,"score_spread":0.2235114193814318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294802772","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.023035545,0.0004177046,0.9618227,0.0006728061,0.00022349312,0.00026082783,0.0005507608,0.0025805098,0.010435522],"genre_scores_gemma":[0.09453342,0.0002710053,0.89562094,0.00025677454,0.00016131124,0.0003709704,0.0017485798,0.00051375316,0.0065232194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836844,0.00030631668,0.00009036829,0.00039049488,0.0005209769,0.00032346297],"domain_scores_gemma":[0.9972186,0.0013888257,0.00013839066,0.0007725597,0.00031889207,0.00016268287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014248176,0.0017240675,0.0024176477,0.001541231,0.0012296154,0.0028306136,0.004791755,0.0024746151,0.016196717],"category_scores_gemma":[0.0054587102,0.0008992057,0.0018742024,0.0035036448,0.0011410285,0.0045661917,0.0039301584,0.0040839445,0.0034698183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012998728,0.000810252,0.0009005956,0.0005932271,0.00015168665,0.00024605822,0.00031555502,0.22058576,0.011780989,0.08199736,0.048625316,0.6326933],"study_design_scores_gemma":[0.00031180892,0.00012886754,0.00030252052,0.000034395547,0.00006876279,0.00019070198,0.00012137452,0.909258,0.0031306888,0.079309925,0.0071099107,0.00003298878],"about_ca_topic_score_codex":0.004484992,"about_ca_topic_score_gemma":0.0054119052,"teacher_disagreement_score":0.016196717,"about_ca_system_score_codex":0.0016256573,"about_ca_system_score_gemma":0.0028295575,"threshold_uncertainty_score":0.054183424},"labels":[],"label_agreement":null},{"id":"W2294815481","doi":"10.1007/978-3-319-24282-8_3","title":"Discovery of Parameters for Animation of Midge Swarms","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Animal Behavior and Reproduction","field":"Agricultural and Biological 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 Regina","funders":"","keywords":"Computer science; Swarming (honey bee); Animation; Midge; Software; Computer animation; Artificial intelligence; Swarm behaviour; Machine learning; Data mining; Ecology; Computer graphics (images); Biology; Programming language","score_opus":0.05302356734730417,"score_gpt":0.26197442796515413,"score_spread":0.20895086061784995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294815481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03793779,0.00033537365,0.9535657,0.00018442086,0.000084341154,0.000058545844,0.00014768251,0.001644503,0.006041607],"genre_scores_gemma":[0.5460829,0.0003989187,0.4484298,0.000064546664,0.000048131467,0.00014501147,0.00046535156,0.0012090347,0.0031562846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998529,0.000039153976,0.000012072786,0.00003519097,0.000045198645,0.000015475973],"domain_scores_gemma":[0.99878937,0.0007357733,0.000078659315,0.00019355793,0.000113632304,0.00008903804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005421317,0.00074099307,0.00077840453,0.0008871234,0.00049416383,0.0012442364,0.001406213,0.0012988182,0.0047294395],"category_scores_gemma":[0.006174004,0.00079054106,0.0005709278,0.00050369004,0.0006725367,0.0012231529,0.0014803495,0.001499832,0.000892622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002700958,0.00007450415,0.0019778532,0.00029268363,0.00007940658,0.0002288978,0.00068835024,0.67458504,0.040862426,0.09721925,0.005814512,0.1779069],"study_design_scores_gemma":[0.000013080422,0.000007848856,0.00010275674,0.000012848151,0.0000049686378,0.000027409362,0.000016814842,0.98423684,0.0014151419,0.012806932,0.0013483219,0.0000071444747],"about_ca_topic_score_codex":0.0009184136,"about_ca_topic_score_gemma":0.0011193223,"teacher_disagreement_score":0.0047294395,"about_ca_system_score_codex":0.00050207175,"about_ca_system_score_gemma":0.0002669371,"threshold_uncertainty_score":0.015821576},"labels":[],"label_agreement":null},{"id":"W2294843272","doi":"10.1007/978-3-662-48899-7_29","title":"Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"is_retracted":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":"Preprocessor; Computer science; True quantified Boolean formula; Cube (algebra); Algorithm; Solver; Power (physics); Artificial intelligence; Mathematics; Combinatorics; Programming language","score_opus":0.02872134792203278,"score_gpt":0.29912275326076293,"score_spread":0.27040140533873014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294843272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009045248,0.00016061388,0.98132265,0.00019574045,0.000048393005,0.00011747154,0.00008690727,0.0012752071,0.007747782],"genre_scores_gemma":[0.23177534,0.0002656284,0.75842017,0.00019166399,0.00003686229,0.00014243938,0.00041597066,0.0005170496,0.008234884],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985972,0.00041981164,0.00006256389,0.00016917304,0.0005398025,0.0002113417],"domain_scores_gemma":[0.9976361,0.0014782265,0.0000787924,0.00034100746,0.0004150017,0.00005081973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011945576,0.00088948524,0.00084290694,0.0009088931,0.00067570247,0.0010852788,0.0021775113,0.00093719445,0.013875675],"category_scores_gemma":[0.005028032,0.00053768005,0.0010403785,0.0010627552,0.0009730092,0.0024365971,0.0024303915,0.0019594736,0.0020771082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005649832,0.00048010633,0.0005864517,0.0009687081,0.00010105401,0.00021802784,0.0004037533,0.23470712,0.033301648,0.15960214,0.013599277,0.5554668],"study_design_scores_gemma":[0.00014070774,0.00008363748,0.00014588126,0.000058574828,0.00006471553,0.000117582196,0.000084736275,0.8747015,0.018548079,0.09752741,0.008504368,0.00002279187],"about_ca_topic_score_codex":0.0043882034,"about_ca_topic_score_gemma":0.0075362017,"teacher_disagreement_score":0.013875675,"about_ca_system_score_codex":0.0008771226,"about_ca_system_score_gemma":0.0022740825,"threshold_uncertainty_score":0.046418726},"labels":[],"label_agreement":null},{"id":"W2294904483","doi":"10.1007/978-3-319-21470-2_47","title":"Modeling the Propagation of Forest Insect Infestation Using Machine Learning Techniques","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Forest Insect Ecology and Management","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Infestation; Computer science; Process (computing); Random forest; Machine learning; Artificial intelligence; Biology; Agronomy","score_opus":0.028452097144519094,"score_gpt":0.24921194149689652,"score_spread":0.22075984435237742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294904483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20471838,0.0015417552,0.78669536,0.00048565134,0.000112032874,0.0000464804,0.00046657317,0.00071300875,0.0052207913],"genre_scores_gemma":[0.9377629,0.0012094772,0.05148179,0.0000706428,0.0001085899,0.00007205136,0.00037780308,0.000119746,0.008796949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977344,0.000058427817,0.00001550911,0.000064737564,0.00004808992,0.00003988552],"domain_scores_gemma":[0.997614,0.001808105,0.00028687593,0.00007228472,0.00017592823,0.000042892436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009289153,0.00086304394,0.0007367191,0.0008680278,0.00038013994,0.00092443405,0.0013996783,0.0017347736,0.0019030255],"category_scores_gemma":[0.0037963903,0.0009651064,0.000965968,0.00094503944,0.00058631366,0.0015917532,0.00046636662,0.001310931,0.00043983874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008664451,0.0000110576775,0.0011033071,0.000014582263,0.00001173947,0.000017408931,0.000009903989,0.9923131,0.0002626251,0.0010709689,0.00011344777,0.0050633107],"study_design_scores_gemma":[4.4004474e-7,0.0000014928875,0.00010695297,0.0000010356424,0.0000014993752,0.000004868912,9.406656e-7,0.9994722,0.000040472536,0.00034527175,0.000023692044,0.0000011849762],"about_ca_topic_score_codex":0.022286046,"about_ca_topic_score_gemma":0.015960006,"teacher_disagreement_score":0.022286046,"about_ca_system_score_codex":0.00095051166,"about_ca_system_score_gemma":0.00055972964,"threshold_uncertainty_score":0.044312656},"labels":[],"label_agreement":null},{"id":"W2294919945","doi":"10.1007/978-3-319-23540-0_1","title":"The Mysterious World of Normal Numbers","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Analytic Number Theory Research","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":"Université Laval","funders":"","keywords":"Base (topology); Real number; Sequence (biology); Integer (computer science); Combinatorics; Computer science; Discrete mathematics; Mathematics; Arithmetic; Mathematical analysis","score_opus":0.05860721606925809,"score_gpt":0.3336354447264398,"score_spread":0.2750282286571817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294919945","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.01148103,0.02600751,0.045726914,0.019319303,0.0032646423,0.000017885028,0.00021917949,0.00025326698,0.8937102],"genre_scores_gemma":[0.5459248,0.029812183,0.032848373,0.005841276,0.0070790476,0.00011793109,0.0004110744,0.00062933535,0.3773359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945945,0.00019450353,0.000017990173,0.00007530498,0.00020333802,0.00004942947],"domain_scores_gemma":[0.9991239,0.00048953795,0.000043746037,0.00014372062,0.00013623698,0.00006290538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008635515,0.0005195844,0.00045803163,0.0012814502,0.0016964403,0.00570913,0.00073817524,0.0011291755,0.0076232157],"category_scores_gemma":[0.0034378245,0.00035195646,0.00028610026,0.0010595107,0.0097853495,0.012625055,0.0017769184,0.0039542466,0.0018949341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023673736,0.0000011338782,0.000011719456,0.000009532358,5.3666145e-7,0.000006205758,0.000104816594,0.00004746805,0.00003709784,0.99331456,0.0040023588,0.0024622718],"study_design_scores_gemma":[0.0000012598737,0.0000012494841,0.000020044552,0.000013613892,5.4462316e-7,0.000026700221,0.00004084941,0.00015512963,0.00003137414,0.9597102,0.039997052,0.0000020345967],"about_ca_topic_score_codex":0.0008451625,"about_ca_topic_score_gemma":0.0009520697,"teacher_disagreement_score":0.0076232157,"about_ca_system_score_codex":0.0016646208,"about_ca_system_score_gemma":0.00076706934,"threshold_uncertainty_score":0.025502205},"labels":[],"label_agreement":null},{"id":"W2295036975","doi":"10.1007/978-3-319-25754-9_28","title":"Statistical Interpretations of Three-Way Decisions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Percentile; Standard deviation; Disjoint sets; Computer science; Construct (python library); Basis (linear algebra); Percentile rank; Population; Function (biology); Statistical analysis; Statistics; Algorithm; Data mining; Mathematics; Discrete mathematics; Geometry","score_opus":0.04720581530086315,"score_gpt":0.2894468337700142,"score_spread":0.24224101846915103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295036975","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.016297454,0.0008934744,0.96300817,0.001519973,0.00016949158,0.000097118595,0.00033720606,0.0003272031,0.017349964],"genre_scores_gemma":[0.5982713,0.00095970364,0.39348668,0.00081335864,0.0003188293,0.000646017,0.0005384952,0.00017227951,0.004793305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98045427,0.009222692,0.0015030067,0.003185334,0.004803325,0.00083146],"domain_scores_gemma":[0.9710074,0.017148893,0.004127773,0.0031245754,0.0037531934,0.00083810656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016260985,0.001791489,0.0013267966,0.0047328365,0.0013335592,0.0090100765,0.0027617628,0.0020391955,0.0057345056],"category_scores_gemma":[0.039248742,0.0007689412,0.002795872,0.003774094,0.010293575,0.007991491,0.003229407,0.003688095,0.0011023979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008649729,0.00002530414,0.0012577164,0.00012643481,0.00006902284,0.00025393066,0.00093766063,0.030043587,0.00050846004,0.9451957,0.0011002173,0.02039543],"study_design_scores_gemma":[0.000016898886,0.00003953672,0.0004802993,0.000057164863,0.00002633387,0.00010553145,0.00023442644,0.053998426,0.00045652693,0.9397933,0.0047447938,0.00004672112],"about_ca_topic_score_codex":0.0023663447,"about_ca_topic_score_gemma":0.0012683752,"teacher_disagreement_score":0.016260985,"about_ca_system_score_codex":0.0040797787,"about_ca_system_score_gemma":0.0018695731,"threshold_uncertainty_score":0.08599734},"labels":[],"label_agreement":null},{"id":"W2295079971","doi":"10.1007/978-3-319-24489-1_23","title":"LewiSpace: An Educational Puzzle Game Combined with a Multimodal Machine Learning Environment","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Task (project management); Adaptation (eye); Human–computer interaction; Artificial intelligence; Game based learning; Educational game; Tracking (education); Eye tracking; Multimedia; Machine learning","score_opus":0.02061919418007002,"score_gpt":0.24343909967057759,"score_spread":0.22281990549050756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295079971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19640665,0.00090881163,0.5943896,0.0011265711,0.00056834647,0.00170357,0.002572388,0.047429353,0.15489477],"genre_scores_gemma":[0.51461244,0.0007475892,0.33709702,0.0008877558,0.000085436914,0.0019160736,0.003658595,0.0016972154,0.13929792],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999851,0.000038098948,0.00000815822,0.00002844405,0.000048285114,0.000026111986],"domain_scores_gemma":[0.9998491,0.00004739276,0.000008136372,0.000011193542,0.00002095955,0.00006326533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017662789,0.0014965486,0.0005002903,0.0005563365,0.00037323532,0.0011849626,0.0016380044,0.0008668842,0.028242258],"category_scores_gemma":[0.00075695594,0.00029730526,0.0005030773,0.00023707653,0.00031095537,0.001664074,0.0026955723,0.000809034,0.0051411497],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045343433,0.0035527053,0.0030593157,0.0012580367,0.00026362893,0.0015141354,0.0014651724,0.042148642,0.12833534,0.04643177,0.101938896,0.665498],"study_design_scores_gemma":[0.0017017303,0.00418467,0.007189456,0.00036407888,0.0003311497,0.0023074937,0.0010411293,0.3703397,0.057601914,0.041466247,0.5130374,0.00043506414],"about_ca_topic_score_codex":0.0019920357,"about_ca_topic_score_gemma":0.00332493,"teacher_disagreement_score":0.028242258,"about_ca_system_score_codex":0.00031117632,"about_ca_system_score_gemma":0.0006200026,"threshold_uncertainty_score":0.0944798},"labels":[],"label_agreement":null},{"id":"W2295089206","doi":"10.1007/978-3-319-17040-4_21","title":"Data Confirmation for Botnet Traffic Analysis","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"","keywords":"Botnet; ZEUS (particle detector); Sandbox (software development); Computer science; Benchmarking; Computer security; World Wide Web; Operating system; The Internet","score_opus":0.055447339991724534,"score_gpt":0.28856053225738526,"score_spread":0.23311319226566074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295089206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029017776,0.002560526,0.90964776,0.0007868347,0.00054891634,0.0007102415,0.0022032964,0.033843033,0.020681648],"genre_scores_gemma":[0.42094377,0.0015222725,0.52780914,0.000632207,0.00035046157,0.0006347801,0.0047219554,0.0017011119,0.041684385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837166,0.00033544027,0.00010139272,0.0002660816,0.0007836326,0.00014186025],"domain_scores_gemma":[0.99333256,0.0025831817,0.00034466045,0.0014437175,0.0021204362,0.0001753865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017304042,0.0010403874,0.0008836557,0.0024267975,0.0006807966,0.0014494475,0.0017272136,0.0009414657,0.012916532],"category_scores_gemma":[0.0071244403,0.0005255092,0.00043382187,0.0012838538,0.0005406737,0.0019301699,0.001315414,0.0011457157,0.00907607],"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.0006999764,0.0002239624,0.003914284,0.0005858754,0.00005107643,0.0003646204,0.00021768772,0.0047625657,0.04597983,0.012557812,0.04201693,0.88862526],"study_design_scores_gemma":[0.00012109554,0.0005631694,0.0066620917,0.00058498874,0.00015317228,0.0023091738,0.0003556885,0.4898035,0.2893395,0.039852913,0.17006254,0.0001920848],"about_ca_topic_score_codex":0.001384376,"about_ca_topic_score_gemma":0.0015282917,"teacher_disagreement_score":0.012916532,"about_ca_system_score_codex":0.00065258355,"about_ca_system_score_gemma":0.0010060861,"threshold_uncertainty_score":0.04321009},"labels":[],"label_agreement":null},{"id":"W2295306629","doi":"10.1007/978-3-319-27974-9_15","title":"Data Transfer Between Discovery Services and Library Catalogs: A Case Study at the University of the Fraser Valley","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Research Data Management Practices","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 the Fraser Valley","funders":"","keywords":"Computer science; Transfer (computing); Information retrieval; World Wide Web; Operating system","score_opus":0.0929410808206493,"score_gpt":0.2994277605932293,"score_spread":0.20648667977258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295306629","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.98242193,0.00020785377,0.0017269636,0.0019143821,0.000016335825,0.00010292157,0.00013044286,0.00010826424,0.013371006],"genre_scores_gemma":[0.98360807,0.000248628,0.0029463018,0.0002752127,0.000012781034,0.000039580147,0.000139958,0.00008022371,0.012649315],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9937364,0.0031235558,0.0002797051,0.0004133931,0.0015726505,0.0008741923],"domain_scores_gemma":[0.97187144,0.022290014,0.0011389041,0.0014469603,0.0018451196,0.0014076497],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0077260607,0.00022000035,0.00041586187,0.0021290013,0.0112254545,0.008001465,0.0022301567,0.0035453443,0.0071626054],"category_scores_gemma":[0.024308793,0.00055831653,0.0005360357,0.0060443357,0.002989649,0.006771697,0.0036738333,0.0018755142,0.0015359774],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012782379,0.0069728787,0.1792191,0.0006197183,0.00011638349,0.034941517,0.44212428,0.008586731,0.007056294,0.040330414,0.024069235,0.25468513],"study_design_scores_gemma":[0.0002568595,0.0012974006,0.08156951,0.00048090707,0.0001438609,0.0076051224,0.71490556,0.020818947,0.012764395,0.008083602,0.15189187,0.00018198421],"about_ca_topic_score_codex":0.07377765,"about_ca_topic_score_gemma":0.08555303,"teacher_disagreement_score":0.99199855,"about_ca_system_score_codex":0.009709939,"about_ca_system_score_gemma":0.007641888,"threshold_uncertainty_score":0.14669645},"labels":[],"label_agreement":null},{"id":"W2295402490","doi":"10.1007/978-3-319-28228-2_9","title":"Simplifying Probabilistic Programs Using Computer Algebra","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Denotational semantics; Computer science; Probabilistic logic; Denotational semantics of the Actor model; Continuation; Semantics (computer science); Normalisation by evaluation; Algebra over a field; Transformation (genetics); Programming language; Theoretical computer science; Program transformation; Operational semantics; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.04663639290688598,"score_gpt":0.27275466728843384,"score_spread":0.22611827438154786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295402490","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.0063203955,0.00037208982,0.9656871,0.0005425313,0.000077787015,0.000052176692,0.00014152411,0.0007853035,0.026021121],"genre_scores_gemma":[0.2555524,0.0021919205,0.7071762,0.00044373734,0.00048167876,0.00042664653,0.0011643118,0.0019396647,0.030623492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817216,0.0006366226,0.000097592376,0.00023837858,0.0007320546,0.00012322041],"domain_scores_gemma":[0.99786747,0.0013150705,0.0000907886,0.00050987146,0.00017969919,0.000037041213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015991763,0.0010000722,0.0012371766,0.0010539859,0.0010462771,0.002098833,0.0021249026,0.00064558315,0.01088544],"category_scores_gemma":[0.006520346,0.00082784647,0.0021004325,0.0019645577,0.002243142,0.0053635426,0.0025474024,0.004858003,0.0030994492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022875318,0.000032293756,0.00006713807,0.00010237322,0.000020282709,0.000026144375,0.00015673166,0.017965939,0.0006303081,0.9304644,0.004045616,0.046465922],"study_design_scores_gemma":[0.000008928668,0.0000044113735,0.000028152012,0.000012948548,0.000009334169,0.000017579234,0.000013352114,0.036491133,0.0005261741,0.9548451,0.00803643,0.0000065837307],"about_ca_topic_score_codex":0.001871954,"about_ca_topic_score_gemma":0.0022637642,"teacher_disagreement_score":0.01088544,"about_ca_system_score_codex":0.0012686551,"about_ca_system_score_gemma":0.0010796351,"threshold_uncertainty_score":0.036415458},"labels":[],"label_agreement":null},{"id":"W2295436983","doi":"10.1007/978-3-319-27857-5_73","title":"CINAPACT-Splines: A Family of Infinitely Smooth, Accurate and Compactly Supported Splines","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"Partition of unity; Box spline; Spline (mechanical); Cartesian coordinate system; Mathematics; Computer science; B-spline; Algorithm; Applied mathematics; Mathematical analysis; Geometry; Spline interpolation; Finite element method","score_opus":0.03248425669037186,"score_gpt":0.27951961355241833,"score_spread":0.24703535686204647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295436983","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.00746186,0.0028582208,0.9713093,0.00020476276,0.00032886816,0.00003960164,0.0002847109,0.0012317419,0.01628087],"genre_scores_gemma":[0.20094602,0.009671469,0.7334827,0.00035454915,0.0004389101,0.00022038698,0.0017870159,0.0018011382,0.051297706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993457,0.00007725511,0.000035214875,0.000100026744,0.00039246105,0.000049255956],"domain_scores_gemma":[0.99884534,0.00042292694,0.000084214895,0.00021232505,0.00032077037,0.00011439219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008416124,0.0009110811,0.000983083,0.0017225024,0.00047311597,0.002040241,0.001258947,0.0009829422,0.0072595635],"category_scores_gemma":[0.0041273106,0.00055800955,0.00088975776,0.0025981944,0.0012648344,0.0015675856,0.0017456157,0.0043499344,0.002807884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002601076,0.0000675804,0.0005549186,0.0006122161,0.000041006515,0.00019468679,0.00026492376,0.102181435,0.017108759,0.29971027,0.017238291,0.5617658],"study_design_scores_gemma":[0.000044648914,0.00017810272,0.00055833906,0.00029750407,0.00003926033,0.0008577653,0.0000716343,0.6862913,0.011763844,0.13666628,0.16313072,0.00010064256],"about_ca_topic_score_codex":0.00093849644,"about_ca_topic_score_gemma":0.00087443227,"teacher_disagreement_score":0.0072595635,"about_ca_system_score_codex":0.00057745597,"about_ca_system_score_gemma":0.00087512494,"threshold_uncertainty_score":0.024285734},"labels":[],"label_agreement":null},{"id":"W2295452827","doi":"10.1007/978-3-319-10470-6_73","title":"Direct Estimation of Cardiac Bi-ventricular Volumes with Regression Forests","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CARE Canada; London Health Sciences Centre; St Joseph's Health Care; Western University","funders":"","keywords":"Segmentation; Computer science; Regression; Ejection fraction; Estimation; Ventricle; Artificial intelligence; Left Ventricles; Cardiac Ventricle; Image segmentation; Pattern recognition (psychology); Representation (politics); Computer vision; Statistics; Mathematics; Cardiology; Medicine; Heart failure","score_opus":0.00706734484611754,"score_gpt":0.26195400550797937,"score_spread":0.25488666066186183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295452827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007754463,0.00035891013,0.9899103,0.00005721221,0.000031542473,0.000020644478,0.00012837072,0.0014064362,0.0003320139],"genre_scores_gemma":[0.3400516,0.00079824595,0.6534232,0.00013274468,0.00014444948,0.00012302755,0.0010351432,0.00059174857,0.003699905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948055,0.00011352609,0.000029554925,0.00014726633,0.00015512739,0.00007397238],"domain_scores_gemma":[0.99895334,0.000555092,0.00010879343,0.00012843337,0.0002227112,0.000031524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010230113,0.0010609598,0.0012883991,0.0011563479,0.00033506282,0.0011683133,0.0012123765,0.001175013,0.002022676],"category_scores_gemma":[0.0034549187,0.0010726077,0.0011078618,0.0011481686,0.00030484804,0.0009522244,0.0008980608,0.0014519183,0.0020634248],"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.00031279703,0.00013729608,0.0032809782,0.00023162496,0.00023814983,0.00013730237,0.00005558845,0.23907511,0.030685207,0.0027480582,0.005373752,0.7177242],"study_design_scores_gemma":[0.0000143893585,0.000026770473,0.0012846862,0.000020468242,0.000036088113,0.0001577207,0.000010387154,0.9862976,0.0076653357,0.0034176977,0.0010520776,0.000016846772],"about_ca_topic_score_codex":0.0046253144,"about_ca_topic_score_gemma":0.009610782,"teacher_disagreement_score":0.0046253144,"about_ca_system_score_codex":0.0002513497,"about_ca_system_score_gemma":0.0009439677,"threshold_uncertainty_score":0.009196818},"labels":[],"label_agreement":null},{"id":"W2295505655","doi":"10.1007/978-3-319-27929-9_6","title":"A Graph Based Classification Method for Multiple Sclerosis Clinical Forms Using Support Vector Machine","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Canadian Nautical Research Society","funders":"Agence Nationale de la Recherche","keywords":"Support vector machine; Computer science; Diffusion MRI; Pattern recognition (psychology); Artificial intelligence; Multiple sclerosis; Graph theory; Graph; Artificial neural network; Kernel (algebra); Machine learning; Data mining; Theoretical computer science; Magnetic resonance imaging; Mathematics; Medicine","score_opus":0.3312701000338951,"score_gpt":0.4433715667412938,"score_spread":0.11210146670739868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295505655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048541907,0.00094924535,0.9419299,0.00055586046,0.0003522096,0.00024268268,0.0013344353,0.0040148813,0.0020788743],"genre_scores_gemma":[0.31198838,0.00069282,0.67749935,0.00022641229,0.00023391192,0.00033444597,0.0031064476,0.00024038956,0.0056778924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996213,0.000082422855,0.000038795704,0.00008878443,0.00013268451,0.00003601166],"domain_scores_gemma":[0.99901724,0.00047457562,0.00006078241,0.0000759289,0.00032653954,0.000044975575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333164,0.00061760255,0.0007027227,0.0023452144,0.00041706284,0.00085773476,0.0011054308,0.0008716011,0.0038534245],"category_scores_gemma":[0.0020476962,0.00017752714,0.0009096252,0.0016113879,0.00017352826,0.0006763641,0.00063393934,0.00097427913,0.002014096],"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.0002282531,0.0001316185,0.0035463425,0.00008741591,0.000080179794,0.00014268424,0.000048667553,0.015940327,0.0071267495,0.0016977324,0.0098541,0.9611159],"study_design_scores_gemma":[0.000029087621,0.0001185746,0.0037500937,0.000034346496,0.00007515742,0.00034589693,0.000086816246,0.97965837,0.00476172,0.0066670333,0.0044403267,0.000032517797],"about_ca_topic_score_codex":0.0038822114,"about_ca_topic_score_gemma":0.00441403,"teacher_disagreement_score":0.0038822114,"about_ca_system_score_codex":0.00031401496,"about_ca_system_score_gemma":0.00052998087,"threshold_uncertainty_score":0.012890935},"labels":[],"label_agreement":null},{"id":"W2295568617","doi":"10.1007/978-3-319-20801-5_22","title":"Head Pose Classification Using a Bidimensional Correlation Filter","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Artificial intelligence; Optimal distinctiveness theory; Pattern recognition (psychology); Robustness (evolution); Computer science; Filter (signal processing); Computer vision; Correlation; Face (sociological concept); Pose; Composite image filter; Facial recognition system; Image (mathematics); Mathematics","score_opus":0.08099457627857419,"score_gpt":0.30500302149790764,"score_spread":0.22400844521933344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295568617","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.017502727,0.0005279449,0.9780783,0.00009646654,0.00019600076,0.0000834904,0.0002599611,0.0012181978,0.0020369003],"genre_scores_gemma":[0.18720393,0.0015028926,0.79603475,0.00034100178,0.0002678387,0.00024336344,0.0014684449,0.0002704826,0.012667343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993455,0.00008767416,0.000033286116,0.00018423541,0.00025677538,0.00009266112],"domain_scores_gemma":[0.9993591,0.00011010889,0.000039094346,0.00010225107,0.00035253935,0.00003692867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007623988,0.0009506449,0.0010931862,0.0015719052,0.00046291656,0.00083888264,0.0006201932,0.0007820566,0.005682398],"category_scores_gemma":[0.0011782118,0.0004406359,0.00085230835,0.0020285936,0.00027385217,0.00074594724,0.00095964083,0.00060047914,0.004977858],"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.00040594727,0.0001242851,0.0018056656,0.00011121788,0.000102817365,0.00007626839,0.000051121082,0.0054749106,0.11964301,0.0018554301,0.0068935226,0.86345583],"study_design_scores_gemma":[0.00006393593,0.0004922758,0.020560637,0.00006166022,0.0003303175,0.0011383728,0.00013060242,0.8053661,0.15290454,0.002376258,0.01646981,0.00010549669],"about_ca_topic_score_codex":0.0030429603,"about_ca_topic_score_gemma":0.005131104,"teacher_disagreement_score":0.005682398,"about_ca_system_score_codex":0.00032489208,"about_ca_system_score_gemma":0.0011854791,"threshold_uncertainty_score":0.01900953},"labels":[],"label_agreement":null},{"id":"W2295596715","doi":"10.1007/978-3-319-25754-9_29","title":"Decision-Level Sensor-Fusion Based on DTRS","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Sensor fusion; Artificial intelligence; Information fusion; Fusion","score_opus":0.05133945123774211,"score_gpt":0.2716169564113652,"score_spread":0.22027750517362307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295596715","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.0021280635,0.00041848488,0.9951375,0.00019223987,0.000052532952,0.000049199156,0.000047523023,0.00014086354,0.0018335917],"genre_scores_gemma":[0.5660211,0.0017927818,0.42713982,0.00036149885,0.00019370686,0.00032986442,0.0004190597,0.00007773421,0.0036644475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952981,0.0015023499,0.00040742036,0.00082564494,0.001658969,0.00030755755],"domain_scores_gemma":[0.9982316,0.0007052858,0.00023760111,0.0002292273,0.0005071328,0.00008912982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035968586,0.0011688125,0.0024180526,0.0015240982,0.00078234216,0.0032099993,0.0026626633,0.0014848837,0.0020266648],"category_scores_gemma":[0.004651254,0.0006107253,0.0026495366,0.0023058862,0.0014931082,0.004021613,0.0025859578,0.002015578,0.0005819754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017297492,0.00008117701,0.00077364733,0.0003923068,0.00020642001,0.0003712806,0.00031570756,0.68871444,0.0049825255,0.19734171,0.002963508,0.10368432],"study_design_scores_gemma":[0.000014025987,0.00007277736,0.00015906787,0.000029355786,0.00005641853,0.00010972485,0.000036965892,0.9410469,0.0019117311,0.053398013,0.0031257363,0.000039291677],"about_ca_topic_score_codex":0.0037962566,"about_ca_topic_score_gemma":0.0017394711,"teacher_disagreement_score":0.0037962566,"about_ca_system_score_codex":0.002086554,"about_ca_system_score_gemma":0.0018722658,"threshold_uncertainty_score":0.019022226},"labels":[],"label_agreement":null},{"id":"W2295742112","doi":"10.1007/978-3-319-24282-8_13","title":"Detecting Transmembrane Proteins Using Decision Trees","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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 Regina","funders":"","keywords":"Computer science; Decision tree; Artificial intelligence; Domain (mathematical analysis); Machine learning; Support vector machine; Pattern recognition (psychology); Mathematics","score_opus":0.02037081816447624,"score_gpt":0.27768060966106634,"score_spread":0.2573097914965901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295742112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15711229,0.0020121604,0.8296602,0.00046680018,0.00015829998,0.00020666125,0.0018508204,0.0044318177,0.0041010175],"genre_scores_gemma":[0.46592253,0.0007938048,0.5242184,0.00020552904,0.00012938965,0.00011251735,0.0051009203,0.00020788255,0.003308976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929225,0.00012848405,0.000069946764,0.00019144615,0.00021693174,0.00010090052],"domain_scores_gemma":[0.99794966,0.0013331968,0.00013853755,0.000119122444,0.00036102202,0.00009838372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010120147,0.0009098025,0.0011449194,0.0019464792,0.0005134022,0.001083932,0.0012797085,0.0011609492,0.0023056846],"category_scores_gemma":[0.002486733,0.0005094019,0.0010635838,0.0013935467,0.00031026953,0.0012485351,0.00072515465,0.0008219054,0.0017319724],"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.0008835737,0.00042441825,0.010670199,0.00040422063,0.00020097026,0.0005430582,0.00011469017,0.07398546,0.06961489,0.005077268,0.011946717,0.8261345],"study_design_scores_gemma":[0.000035925095,0.00015132618,0.0022328855,0.00004345088,0.00007344391,0.00030409129,0.000079478625,0.95824575,0.023371741,0.012627148,0.002807217,0.000027635819],"about_ca_topic_score_codex":0.0009899597,"about_ca_topic_score_gemma":0.0011905789,"teacher_disagreement_score":0.0023056846,"about_ca_system_score_codex":0.00034210226,"about_ca_system_score_gemma":0.00045490483,"threshold_uncertainty_score":0.007713318},"labels":[],"label_agreement":null},{"id":"W2295761717","doi":"10.1007/978-3-319-27947-3_18","title":"Parsing with Partially Known Grammar","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Natural language processing; Parsing; Artificial intelligence; Rule-based machine translation; Grammar; Context-free grammar; Constraint (computer-aided design); S-attributed grammar; Linguistics; Mathematics","score_opus":0.021210527231827855,"score_gpt":0.2648407256457872,"score_spread":0.24363019841395933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295761717","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.004142082,0.0012233682,0.9340806,0.0009444046,0.0002772167,0.00008071744,0.001680629,0.016299658,0.041271262],"genre_scores_gemma":[0.15461423,0.0028417818,0.76978195,0.0006952705,0.00043801844,0.00023049503,0.014080758,0.010160403,0.04715719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986651,0.00034266422,0.00012891347,0.00043245984,0.00034229842,0.00008860093],"domain_scores_gemma":[0.9984976,0.00072910066,0.00004187971,0.0005686753,0.00013852745,0.000024209678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010679399,0.0012408597,0.0014354666,0.0015659492,0.0011033977,0.0033139957,0.002152743,0.0014375466,0.027464012],"category_scores_gemma":[0.0035388512,0.0017492899,0.002152784,0.0024744764,0.0018934133,0.0067723133,0.0028852292,0.0032878455,0.0136676505],"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.0000790306,0.00006547257,0.00026227572,0.0006273603,0.000075177144,0.0003060904,0.0005968163,0.012419038,0.004500497,0.4776237,0.05382382,0.44962066],"study_design_scores_gemma":[0.000020394651,0.000017479442,0.000233065,0.00018389494,0.0000588843,0.0003291957,0.00007778111,0.042538702,0.008455275,0.8540272,0.09400121,0.00005692259],"about_ca_topic_score_codex":0.0014278364,"about_ca_topic_score_gemma":0.0019702888,"teacher_disagreement_score":0.027464012,"about_ca_system_score_codex":0.001117146,"about_ca_system_score_gemma":0.0013851284,"threshold_uncertainty_score":0.09187627},"labels":[],"label_agreement":null},{"id":"W2295883547","doi":"10.1007/978-3-319-27857-5_77","title":"An Interactive Node-Link Visualization of Convolutional Neural Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Convolutional neural network; Visualization; Link (geometry); Node (physics); Artificial neural network; Artificial intelligence; Computer graphics (images); Computer network","score_opus":0.030750413901685848,"score_gpt":0.31889527773733545,"score_spread":0.2881448638356496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295883547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040874567,0.0011681995,0.8135109,0.0012404977,0.0006389939,0.0002673256,0.012773842,0.10872199,0.020803696],"genre_scores_gemma":[0.2718855,0.0020439154,0.68034047,0.00040860946,0.00016157782,0.00053306576,0.010711646,0.012578153,0.021337066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998287,0.000038011363,0.00001071941,0.000024981557,0.00007436765,0.000023177101],"domain_scores_gemma":[0.9993293,0.00037746583,0.000025120004,0.00007041895,0.00013479593,0.00006278849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062489003,0.001377152,0.00048307554,0.0014332373,0.0004924057,0.0019359023,0.0015483835,0.000975825,0.038062796],"category_scores_gemma":[0.0022636964,0.0005111636,0.00072902936,0.001096845,0.00025224275,0.001176586,0.0017280811,0.0014322746,0.0029364468],"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.0011128943,0.0003992147,0.0034971614,0.002010074,0.00034656833,0.0009806937,0.0014645224,0.16458838,0.039412796,0.046743955,0.22832942,0.5111143],"study_design_scores_gemma":[0.00016005118,0.000068148685,0.0012901238,0.00024864127,0.000064698725,0.00021550288,0.00015227703,0.8774835,0.019879173,0.032065656,0.06829687,0.000075380354],"about_ca_topic_score_codex":0.008342813,"about_ca_topic_score_gemma":0.0153507255,"teacher_disagreement_score":0.038062796,"about_ca_system_score_codex":0.0005775418,"about_ca_system_score_gemma":0.0009558535,"threshold_uncertainty_score":0.12733269},"labels":[],"label_agreement":null},{"id":"W2295905810","doi":"10.1007/978-3-319-20801-5_47","title":"Vehicle Detection Using Approximation of Feature Pyramids in the DFT Domain","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Concordia University","funders":"","keywords":"Computer science; Domain (mathematical analysis); Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.042452697598906845,"score_gpt":0.29633818103801535,"score_spread":0.2538854834391085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295905810","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.014674579,0.000112137415,0.9838185,0.000041068513,0.000023255461,0.000011532464,0.0000647923,0.00028835973,0.0009659445],"genre_scores_gemma":[0.34685448,0.00060182484,0.6471474,0.000064746826,0.000052991174,0.000028915483,0.00052133464,0.00010846413,0.004619719],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998586,0.000016126141,0.000005780446,0.000027976746,0.000066903056,0.00002470046],"domain_scores_gemma":[0.99977165,0.00008082101,0.000019693896,0.00004074689,0.00007215699,0.000015050106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020356434,0.00032870396,0.00048262058,0.0006665028,0.00012705284,0.00065475306,0.00050236954,0.0004191767,0.001776531],"category_scores_gemma":[0.0009853143,0.00024983994,0.0005024912,0.00087370357,0.0002489677,0.0006657556,0.00042260718,0.00049290276,0.000865988],"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.00026725206,0.00008206292,0.0013828534,0.0001578328,0.00006139123,0.00016530784,0.00007838299,0.13531214,0.11340222,0.018109957,0.0032732638,0.72770745],"study_design_scores_gemma":[0.000005304818,0.000038791433,0.00078739226,0.000006131272,0.000010953173,0.00017038632,0.00001326185,0.9851458,0.009092572,0.0033613013,0.0013600377,0.000008071481],"about_ca_topic_score_codex":0.003346251,"about_ca_topic_score_gemma":0.002915122,"teacher_disagreement_score":0.003346251,"about_ca_system_score_codex":0.00030887945,"about_ca_system_score_gemma":0.00038368296,"threshold_uncertainty_score":0.0066535473},"labels":[],"label_agreement":null},{"id":"W2295994131","doi":"10.1007/978-3-319-07221-0_102","title":"A Rule-Based Recommender System to Suggest Learning Tasks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"Athabasca University","funders":"","keywords":"Computer science; Focus (optics); Recommender system; Artificial intelligence; Machine learning; Human–computer interaction","score_opus":0.017932321242968542,"score_gpt":0.2574647019835148,"score_spread":0.23953238074054625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295994131","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.07282174,0.0033190001,0.90648514,0.0009669808,0.000722328,0.0005706594,0.001583475,0.0061070328,0.0074237008],"genre_scores_gemma":[0.4363086,0.0012520998,0.5466555,0.00069354667,0.00030644692,0.0004356478,0.0024985494,0.00019021382,0.011659343],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894553,0.0001965001,0.00012090859,0.00030385517,0.00036801893,0.00006530714],"domain_scores_gemma":[0.9961849,0.0021081981,0.00011925101,0.00032060654,0.0011116418,0.00015538452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017279348,0.00088841125,0.0018222383,0.0017607221,0.00073291356,0.0013402802,0.0026223138,0.001961878,0.0044231797],"category_scores_gemma":[0.0063799666,0.00056192174,0.0009487564,0.0014343965,0.0002614472,0.0014792848,0.000705332,0.0017432825,0.0034655933],"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.00094248075,0.0012345439,0.00810846,0.0003401017,0.00045014193,0.000471219,0.00019478073,0.0516495,0.008564841,0.0022588507,0.027122274,0.89866275],"study_design_scores_gemma":[0.00019564983,0.00025946123,0.0031144586,0.00006802314,0.00022839254,0.00039762608,0.000053253963,0.9832303,0.004130336,0.0028396074,0.005409677,0.00007319501],"about_ca_topic_score_codex":0.02087146,"about_ca_topic_score_gemma":0.034015536,"teacher_disagreement_score":0.02087146,"about_ca_system_score_codex":0.0005661924,"about_ca_system_score_gemma":0.0009287117,"threshold_uncertainty_score":0.041499972},"labels":[],"label_agreement":null},{"id":"W2296055739","doi":"10.1007/978-3-319-24601-7_8","title":"An Iterative Closest Point Framework for Ultrasound Calibration","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Western University","funders":"","keywords":"Fiducial marker; Computer science; Imaging phantom; Calibration; Computer vision; Artificial intelligence; Segmentation; Iterative closest point; Standard deviation; Point (geometry); Tracking (education); Point cloud; Optics; Mathematics; Physics","score_opus":0.020918504189967997,"score_gpt":0.25841814276412783,"score_spread":0.23749963857415984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296055739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001824446,0.000114863535,0.99897265,0.000011702689,0.000014835971,0.000008191123,0.000010923232,0.00023713346,0.00044717413],"genre_scores_gemma":[0.02521144,0.0006004717,0.9702295,0.000036143658,0.000054450058,0.00008990132,0.00018355492,0.0003267329,0.0032678419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981658,0.00052082975,0.000081569895,0.00027878728,0.00087112834,0.00008186291],"domain_scores_gemma":[0.99905723,0.00030486798,0.000047396563,0.00020252305,0.00035668933,0.00003124001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475392,0.0017979153,0.001973114,0.0013859213,0.0007720922,0.0018393672,0.0037441521,0.0024276692,0.007221966],"category_scores_gemma":[0.004182041,0.0014236912,0.001945827,0.0031803756,0.0010023506,0.0024614797,0.003980729,0.003541699,0.005585331],"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.00009492802,0.00006928458,0.00016656623,0.00026829037,0.000100960104,0.00012843417,0.0001967688,0.3445189,0.011466307,0.05795599,0.0080901915,0.5769434],"study_design_scores_gemma":[0.00001244995,0.00003435572,0.00006748163,0.000024490184,0.000017517104,0.00015725661,0.0000283477,0.96278524,0.0033236886,0.024422575,0.009096217,0.000030381825],"about_ca_topic_score_codex":0.0067996345,"about_ca_topic_score_gemma":0.004996108,"teacher_disagreement_score":0.007221966,"about_ca_system_score_codex":0.0006604925,"about_ca_system_score_gemma":0.0012260554,"threshold_uncertainty_score":0.024159908},"labels":[],"label_agreement":null},{"id":"W2296063912","doi":"10.1007/978-3-540-68143-4_4","title":"On the Semantics of Conditional Commitment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Semantics (computer science); Action (physics); Situation calculus; Set (abstract data type); Theoretical computer science; Operational semantics; Artificial intelligence; Programming language","score_opus":0.02243968144272334,"score_gpt":0.2418859934976172,"score_spread":0.21944631205489384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296063912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01748962,0.0042854887,0.723256,0.0107004065,0.0013323654,0.00014232974,0.00056485,0.0008700995,0.24135889],"genre_scores_gemma":[0.7618015,0.003205287,0.17918457,0.0038329312,0.0019976993,0.00061831233,0.0010935402,0.0010925701,0.047173586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608445,0.0018593561,0.00028032323,0.0005551305,0.0007850434,0.00043570742],"domain_scores_gemma":[0.9940355,0.0037555292,0.00022259548,0.0010566552,0.00069986057,0.0002298687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053213593,0.0012476703,0.0014230927,0.0018589904,0.003967944,0.0076078633,0.0036412335,0.0039198454,0.014388386],"category_scores_gemma":[0.010994396,0.0020851237,0.0022190234,0.0030523676,0.010495483,0.023837887,0.004859506,0.009252084,0.0021956542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012108472,0.000005311618,0.000013744887,0.000012415942,0.000003377935,0.00001666793,0.00013331579,0.00029421822,0.00006953819,0.99694973,0.00081720663,0.0016723347],"study_design_scores_gemma":[0.0000074864415,0.000003066537,0.000015278023,0.000012195858,0.0000037015645,0.000016243079,0.000031948926,0.0011580448,0.000071341725,0.9956578,0.0030179746,0.000004932236],"about_ca_topic_score_codex":0.0032646845,"about_ca_topic_score_gemma":0.002223411,"teacher_disagreement_score":0.014388386,"about_ca_system_score_codex":0.004365063,"about_ca_system_score_gemma":0.0018503511,"threshold_uncertainty_score":0.04813391},"labels":[],"label_agreement":null},{"id":"W2296071099","doi":"10.1007/978-3-319-23540-0_28","title":"Matching Uncertain Identities Against Sparse Knowledge","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Matching (statistics); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.049366230257179025,"score_gpt":0.2870513695602417,"score_spread":0.23768513930306268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296071099","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.03903206,0.0007848035,0.9532877,0.00095068733,0.00012994901,0.00008450961,0.00036296438,0.00075337396,0.0046138437],"genre_scores_gemma":[0.6692133,0.0014537323,0.31803545,0.00043374812,0.0004138854,0.00015614285,0.0024134286,0.00024906007,0.007631223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959318,0.0010775076,0.00027985187,0.00078864174,0.0016561623,0.00026596294],"domain_scores_gemma":[0.99046904,0.006592511,0.000634386,0.0015752821,0.00059811637,0.00013065188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00278131,0.0007464877,0.0016485332,0.0022040748,0.00085208786,0.0027263812,0.0025007974,0.0023934643,0.002739692],"category_scores_gemma":[0.024939481,0.00073405745,0.0011056582,0.00330249,0.0014600897,0.0072960504,0.0050207735,0.0023229546,0.0010580824],"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.00054655987,0.00017999677,0.002109245,0.00034480751,0.0002014667,0.00060654787,0.0003814764,0.2932091,0.0035707082,0.117498726,0.010656877,0.5706945],"study_design_scores_gemma":[0.000012442224,0.000042840384,0.00024631436,0.000036948193,0.00003071227,0.00021524668,0.00010888351,0.7790235,0.002923994,0.21497603,0.0023678143,0.000015240751],"about_ca_topic_score_codex":0.0019887034,"about_ca_topic_score_gemma":0.0012674598,"teacher_disagreement_score":0.00278131,"about_ca_system_score_codex":0.0010877905,"about_ca_system_score_gemma":0.00074628886,"threshold_uncertainty_score":0.014709175},"labels":[],"label_agreement":null},{"id":"W2296088771","doi":"10.1007/978-3-319-07127-5_22","title":"Embedded Disruption: Facilitating Responsible Gambling with Persuasive Systems Design","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gambling Behavior and Treatments","field":"Psychology","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":"Carleton University","funders":"","keywords":"Computer science; Persuasive technology; Human–computer interaction; Computer security; Embedded system; Persuasion; Psychology; Social psychology","score_opus":0.10874963523419974,"score_gpt":0.36350467309701523,"score_spread":0.2547550378628155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296088771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23498933,0.0031356735,0.6949416,0.0016696682,0.0005598558,0.00052102125,0.00010242066,0.005940848,0.058139615],"genre_scores_gemma":[0.7766505,0.0010322494,0.2003129,0.00031724354,0.00010663627,0.00035066385,0.00012883365,0.0002832546,0.020817673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956566,0.0001943638,0.000020751088,0.000060789396,0.00012221614,0.00003618181],"domain_scores_gemma":[0.9981675,0.001403954,0.00008972499,0.00015778103,0.00008145623,0.00009945584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082156394,0.0007346884,0.0002509254,0.00042235703,0.00030916667,0.0015762248,0.0010999208,0.0010026423,0.0085622845],"category_scores_gemma":[0.004088569,0.000283372,0.00028429914,0.00018988879,0.0004951738,0.0018380798,0.001265149,0.0013309701,0.0011448811],"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.00094653136,0.0024242876,0.002362557,0.0011490079,0.00010572525,0.00045599169,0.0057980693,0.009332695,0.03694365,0.03704531,0.009209692,0.8942265],"study_design_scores_gemma":[0.0015064895,0.0071013994,0.012599992,0.0015111279,0.0010092471,0.0039106123,0.0058081206,0.29740804,0.12502387,0.3073623,0.23645449,0.0003043446],"about_ca_topic_score_codex":0.00012105921,"about_ca_topic_score_gemma":0.00021509519,"teacher_disagreement_score":0.0085622845,"about_ca_system_score_codex":0.00017357591,"about_ca_system_score_gemma":0.00032544264,"threshold_uncertainty_score":0.028643727},"labels":[],"label_agreement":null},{"id":"W2296242073","doi":"10.1007/978-3-319-24282-8_11","title":"Predictive Analysis on Tracking Emails for Targeted Marketing","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Feature (linguistics); Tracking (education); Artificial intelligence; Measure (data warehouse); Machine learning; Online advertising; Data mining; World Wide Web; The Internet","score_opus":0.026924618026270875,"score_gpt":0.26230483760284096,"score_spread":0.23538021957657007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296242073","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.74109626,0.0031522606,0.24062844,0.0013677885,0.00037226683,0.00016079971,0.0027369272,0.0029421586,0.0075431033],"genre_scores_gemma":[0.97832996,0.00051492226,0.013618707,0.00008289605,0.00028428002,0.00004246938,0.0018950041,0.00007277294,0.0051589524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989808,0.0002927025,0.00004635698,0.00027692964,0.0002593309,0.0001438735],"domain_scores_gemma":[0.9904146,0.0069238045,0.0006489405,0.0008931276,0.00091171236,0.0002077809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026798742,0.0010804738,0.0010057268,0.004589999,0.0006923352,0.0017217048,0.0011486494,0.0017733037,0.0025988505],"category_scores_gemma":[0.011319473,0.00053483684,0.00092606974,0.0022891425,0.00044229225,0.002046056,0.0007714741,0.0016761547,0.0022749028],"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.0009165832,0.0011249055,0.1454727,0.0003295306,0.00036118808,0.00044198966,0.00042159585,0.26268554,0.011184738,0.013432819,0.019642705,0.5439857],"study_design_scores_gemma":[0.000005040086,0.00006515488,0.011037085,0.000022143093,0.000047836787,0.00008929745,0.000030081794,0.9818657,0.0015244363,0.00467297,0.0006269689,0.000013275717],"about_ca_topic_score_codex":0.0049799676,"about_ca_topic_score_gemma":0.0058182636,"teacher_disagreement_score":0.0049799676,"about_ca_system_score_codex":0.00078296,"about_ca_system_score_gemma":0.0005122425,"threshold_uncertainty_score":0.014172673},"labels":[],"label_agreement":null},{"id":"W2296270269","doi":"10.1007/978-3-319-20621-9_2","title":"What Really Works in Hybrid Learning: A Cognitive Perspective","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Perspective (graphical); Cognition; Empirical research; Scale (ratio); Cognitive science; Knowledge management; Artificial intelligence; Data science; Management science; Engineering ethics; Psychology; Epistemology; Engineering","score_opus":0.026545163526483576,"score_gpt":0.29158841538604224,"score_spread":0.2650432518595587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296270269","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07116088,0.011439394,0.13866109,0.05981908,0.00082028774,0.000110034234,0.00013560735,0.0003868661,0.71746665],"genre_scores_gemma":[0.95782334,0.0023941607,0.022462023,0.0020623587,0.00031477658,0.00012638757,0.00006644626,0.00014179583,0.014608689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957301,0.0025204222,0.00012316207,0.0004949827,0.00068395387,0.00044734514],"domain_scores_gemma":[0.9920167,0.0057746945,0.00038813893,0.00062305346,0.00049855566,0.00069885893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005688277,0.00071855175,0.0006887272,0.0014561483,0.0031911917,0.01632013,0.0029732706,0.0055860193,0.0069391774],"category_scores_gemma":[0.007260169,0.0005869886,0.0008020392,0.0017562464,0.024337677,0.028901422,0.003909166,0.0041685477,0.00105378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053943888,0.00010814371,0.001096656,0.000321196,0.000054911918,0.00014824761,0.020592187,0.00076350133,0.00063732604,0.9414364,0.0033786483,0.031408783],"study_design_scores_gemma":[0.000019324836,0.00003784446,0.0005998829,0.00021670746,0.000031293028,0.00016520845,0.013080356,0.0017117846,0.0007098337,0.96311873,0.020279469,0.000029513405],"about_ca_topic_score_codex":0.0020804368,"about_ca_topic_score_gemma":0.001613009,"teacher_disagreement_score":0.01632013,"about_ca_system_score_codex":0.0026162672,"about_ca_system_score_gemma":0.0019119193,"threshold_uncertainty_score":0.030082881},"labels":[],"label_agreement":null},{"id":"W2296391375","doi":"10.1007/bfb0018372","title":"The platypus expert system shell","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backtracking; Computer science; Platypus; Domain (mathematical analysis); Expert system; Artificial intelligence; Shell (structure); Programming language; Representation (politics); Constraint (computer-aided design); Task (project management); Process (computing); Theoretical computer science; Mathematics; Engineering","score_opus":0.014670839722368482,"score_gpt":0.22896063741880365,"score_spread":0.21428979769643516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296391375","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056281374,0.0003121599,0.80222803,0.00038126833,0.00016128358,0.00020640272,0.001368757,0.124143034,0.06557091],"genre_scores_gemma":[0.11747722,0.0009403802,0.6916418,0.00093964505,0.00012055142,0.0003828083,0.008312556,0.030019708,0.15016536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956876,0.00005925931,0.000036451616,0.00009733659,0.0001906507,0.000047467165],"domain_scores_gemma":[0.999209,0.0002669338,0.00003529067,0.0002571559,0.00015041858,0.0000812461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006565202,0.00056526787,0.00046914173,0.0006240386,0.00038452644,0.0013376711,0.0017438941,0.0006408182,0.046703763],"category_scores_gemma":[0.0026622887,0.0008419866,0.0004901502,0.00039435487,0.0005233388,0.0024699746,0.0023127429,0.0013338883,0.03211702],"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.00045802133,0.00014901653,0.00069394754,0.00048568466,0.000047755115,0.0002695879,0.0004053885,0.008214271,0.015039615,0.05566945,0.17266725,0.74590003],"study_design_scores_gemma":[0.00017729487,0.00007895682,0.001077796,0.00025548888,0.000051060964,0.00084225903,0.00011009434,0.11256654,0.0328214,0.12404109,0.7279,0.00007806709],"about_ca_topic_score_codex":0.0013328482,"about_ca_topic_score_gemma":0.0013243929,"teacher_disagreement_score":0.046703763,"about_ca_system_score_codex":0.00031619234,"about_ca_system_score_gemma":0.00095639727,"threshold_uncertainty_score":0.15623963},"labels":[],"label_agreement":null},{"id":"W2296525102","doi":"10.1007/978-3-642-41575-3_10","title":"Planning System for Emergency Services","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science","score_opus":0.08652663191863594,"score_gpt":0.35410814686896336,"score_spread":0.26758151495032745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296525102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029605411,0.00082185824,0.7716689,0.00086801394,0.00053776,0.00080938666,0.010723097,0.085185505,0.09978007],"genre_scores_gemma":[0.42165267,0.0009826915,0.47878346,0.000492132,0.00013266994,0.00091669813,0.015307295,0.0016450804,0.08008728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988246,0.000022351493,0.000009081601,0.000029615321,0.00003850187,0.000017982826],"domain_scores_gemma":[0.9998939,0.000025832864,0.000008734316,0.000023165927,0.00002973764,0.000018716484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028172365,0.00058855943,0.00035113737,0.0005841194,0.0004865892,0.00076167885,0.0007279616,0.00033280157,0.030584946],"category_scores_gemma":[0.00052472187,0.00026607802,0.0003254591,0.00050895853,0.00012982504,0.00056594744,0.0005312792,0.0005554198,0.007845285],"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.00047942784,0.00024017273,0.0020508121,0.00037530978,0.00007602053,0.0004507761,0.00021966717,0.1911693,0.018357247,0.029225772,0.21522674,0.5421288],"study_design_scores_gemma":[0.00009981414,0.00013675973,0.0016660404,0.0000561799,0.00007528204,0.00024876941,0.0000986509,0.7887341,0.016766751,0.016523324,0.17553927,0.000055004348],"about_ca_topic_score_codex":0.0067041335,"about_ca_topic_score_gemma":0.0063017635,"teacher_disagreement_score":0.030584946,"about_ca_system_score_codex":0.0005070879,"about_ca_system_score_gemma":0.0012970417,"threshold_uncertainty_score":0.102316916},"labels":[],"label_agreement":null},{"id":"W2296555785","doi":"10.1007/978-3-319-25789-1_10","title":"Semi-extractive Multi-document Summarization via Submodular Functions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Submodular set function; Automatic summarization; Computer science; Monotone polygon; Knapsack problem; Scalability; Relevance (law); Greedy algorithm; Theoretical computer science; Data mining; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Database","score_opus":0.030237387980650392,"score_gpt":0.2617135266681185,"score_spread":0.23147613868746808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296555785","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.004005824,0.0010478013,0.9892675,0.0002057014,0.00011101416,0.000091349975,0.00075019826,0.0033545617,0.0011660904],"genre_scores_gemma":[0.08654568,0.0014063722,0.89012843,0.00028883753,0.0005161165,0.00043770674,0.008033839,0.0009436954,0.011699306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983022,0.0004410608,0.00019130608,0.00045340488,0.00046440566,0.00014761518],"domain_scores_gemma":[0.997071,0.0015165054,0.0002033268,0.00044958372,0.0006697979,0.00008971794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015633323,0.0023298042,0.002516372,0.0025377125,0.0007305469,0.0023587067,0.0017650619,0.0014466178,0.00621643],"category_scores_gemma":[0.0046631503,0.00086784334,0.0018552319,0.0029878633,0.0005770582,0.003593053,0.0026512824,0.002000382,0.008002696],"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.00035278435,0.0001495032,0.00024409489,0.00064096926,0.00014786984,0.00021751116,0.00020274926,0.038766533,0.024568217,0.008271413,0.021508401,0.90492994],"study_design_scores_gemma":[0.000058330552,0.00027425037,0.00046031273,0.00008442339,0.0001424469,0.00030623475,0.00022062185,0.92345226,0.023325086,0.035259746,0.01635261,0.00006370644],"about_ca_topic_score_codex":0.0012722113,"about_ca_topic_score_gemma":0.0027278531,"teacher_disagreement_score":0.00621643,"about_ca_system_score_codex":0.0005941868,"about_ca_system_score_gemma":0.00129851,"threshold_uncertainty_score":0.02079606},"labels":[],"label_agreement":null},{"id":"W2296592649","doi":"10.1007/978-3-319-20801-5_23","title":"Illumination Robust Facial Feature Detection via Decoupled Illumination and Texture Features","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Computer vision; Feature (linguistics); Face (sociological concept); Facial recognition system","score_opus":0.016422926645250954,"score_gpt":0.23839591052588566,"score_spread":0.2219729838806347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296592649","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.026857184,0.000519238,0.96718985,0.0000895566,0.00008623333,0.000046671852,0.00017602253,0.0012650389,0.00377017],"genre_scores_gemma":[0.310139,0.0012281758,0.6718278,0.00019655553,0.00013516139,0.00012750387,0.0008789339,0.00045357732,0.015013244],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966705,0.000026709196,0.000010101603,0.000065242275,0.00017616559,0.00005479948],"domain_scores_gemma":[0.9997781,0.000052538784,0.000020432915,0.00005055329,0.000084857646,0.000013554686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024819057,0.00061450445,0.0007956556,0.00062136765,0.00016903029,0.0006526417,0.00068716647,0.00048316052,0.0034369016],"category_scores_gemma":[0.00071455183,0.00040779292,0.0007177445,0.00056397927,0.00025587928,0.0007471275,0.00085470994,0.0005489063,0.0025256863],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027020884,0.00006394648,0.0006393718,0.000086004846,0.000058891663,0.000078725374,0.00002576199,0.006866176,0.39568627,0.0014971935,0.003073803,0.59165376],"study_design_scores_gemma":[0.000045650217,0.0002401688,0.00863201,0.000041367584,0.00015108562,0.0011477707,0.0000548091,0.58922064,0.38614044,0.0043682237,0.00988587,0.00007202336],"about_ca_topic_score_codex":0.0010131134,"about_ca_topic_score_gemma":0.0019418944,"teacher_disagreement_score":0.0034369016,"about_ca_system_score_codex":0.00021335656,"about_ca_system_score_gemma":0.00034672846,"threshold_uncertainty_score":0.011497557},"labels":[],"label_agreement":null},{"id":"W2296657386","doi":"10.1007/978-3-319-20801-5_28","title":"Dynamic Perceptual Attribute-Based Hidden Conditional Random Fields for Gesture Recognition","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition 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":"Dalhousie University","funders":"","keywords":"Computer science; Conditional random field; Speech recognition; Gesture; Perception; Gesture recognition; Artificial intelligence; Pattern recognition (psychology); Neuroscience","score_opus":0.0432341136597365,"score_gpt":0.2764038120661503,"score_spread":0.23316969840641377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296657386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049849893,0.00034400215,0.99353266,0.00006502015,0.000039644223,0.000011325733,0.00011049335,0.00056553463,0.0003463446],"genre_scores_gemma":[0.54502386,0.0013965181,0.44382867,0.00019223389,0.00019022943,0.00012386154,0.0015705774,0.00033337914,0.0073406673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945694,0.00013443646,0.000027996728,0.00016607829,0.00013565585,0.000078879464],"domain_scores_gemma":[0.99880266,0.0007915545,0.00007222805,0.00015970379,0.00013258736,0.00004118002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011186672,0.00063934794,0.0012225914,0.00047026083,0.00025621202,0.0007568337,0.0017299257,0.00085636566,0.0030952252],"category_scores_gemma":[0.0025589813,0.00057818263,0.0010001503,0.0009672831,0.0007189141,0.0015215796,0.0011982528,0.0021553822,0.00095592084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000361489,0.00013971415,0.0005283161,0.00015897623,0.000090331145,0.00008751114,0.000086775064,0.47761106,0.01298076,0.040493917,0.004237602,0.46322355],"study_design_scores_gemma":[0.0000036117567,0.000013871434,0.00016033679,0.000006506546,0.000005071364,0.00001534014,0.0000033941644,0.9885246,0.0012247278,0.009710373,0.00032354007,0.000008522178],"about_ca_topic_score_codex":0.0066167656,"about_ca_topic_score_gemma":0.007008393,"teacher_disagreement_score":0.0066167656,"about_ca_system_score_codex":0.00082419737,"about_ca_system_score_gemma":0.0007464319,"threshold_uncertainty_score":0.013156533},"labels":[],"label_agreement":null},{"id":"W2296668858","doi":"10.1007/978-3-319-25945-1_2","title":"Using Multiple Adaptive Distinguishing Sequences for Checking Sequence Generation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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 Ottawa","funders":"","keywords":"Sequence (biology); Identification (biology); State (computer science); Computer science; Construct (python library); Model checking; Finite-state machine; Algorithm; Programming language","score_opus":0.2198040413080693,"score_gpt":0.3446613266231766,"score_spread":0.12485728531510731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296668858","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.027571132,0.00014352244,0.96365523,0.00006086606,0.000072821356,0.00010533594,0.00010449409,0.0071919966,0.001094647],"genre_scores_gemma":[0.33499283,0.00006149152,0.6620518,0.00012686933,0.00003502943,0.00012595564,0.00032320071,0.00087459147,0.0014083216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428904,0.0015354013,0.0005295579,0.0015349649,0.0016852329,0.00042575118],"domain_scores_gemma":[0.97389245,0.014658666,0.0015341471,0.0065972055,0.0028705134,0.0004470212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183004,0.0013206243,0.0011018824,0.0029204683,0.00075924647,0.0012162472,0.003043801,0.0014128636,0.004317678],"category_scores_gemma":[0.016811432,0.00090748916,0.0010656117,0.0014723248,0.0015650004,0.0036761782,0.0027003468,0.0019797233,0.0011886214],"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.0020208247,0.00037901505,0.0090387,0.0005582718,0.00016181583,0.0005681578,0.0005023552,0.052182786,0.090610236,0.045653187,0.003824107,0.7945005],"study_design_scores_gemma":[0.000174282,0.00055548095,0.0016638822,0.00015798735,0.00017938284,0.0007635788,0.000090895104,0.76760375,0.1577051,0.06290137,0.008088905,0.00011540911],"about_ca_topic_score_codex":0.0011661873,"about_ca_topic_score_gemma":0.0021591585,"teacher_disagreement_score":0.004317678,"about_ca_system_score_codex":0.00087960286,"about_ca_system_score_gemma":0.0016499747,"threshold_uncertainty_score":0.016833544},"labels":[],"label_agreement":null},{"id":"W2296760178","doi":"10.1007/978-3-319-25754-9_34","title":"Combining Rough Clustering Schemes as a Rough Ensemble","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Rough set; Salient; Process (computing); Series (stratigraphy); Artificial intelligence; Pattern recognition (psychology); Geology","score_opus":0.03933396530524668,"score_gpt":0.27073877646740907,"score_spread":0.23140481116216238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296760178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008799599,0.00079310936,0.9850081,0.00025428642,0.00007579419,0.000075755015,0.000056987825,0.0002775166,0.004658889],"genre_scores_gemma":[0.13369134,0.0012944173,0.8593377,0.00014371719,0.00016159944,0.00012863059,0.00029044284,0.00012057801,0.004831665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975794,0.00073556986,0.0001477375,0.00031392634,0.0011110444,0.000112326015],"domain_scores_gemma":[0.9982102,0.0004948121,0.000117406074,0.0006238307,0.00046825758,0.000085534484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004067734,0.00077548705,0.0014319126,0.002494273,0.00076885545,0.0027439152,0.0013758302,0.0011175424,0.0023832177],"category_scores_gemma":[0.0047280304,0.00068402203,0.001752939,0.0028092554,0.00087852863,0.003426973,0.002665447,0.001534902,0.0012773325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011359096,0.00008875374,0.0014700219,0.0003047711,0.00045933563,0.0001925601,0.0007340117,0.37045592,0.010976719,0.24680543,0.0074088345,0.36099008],"study_design_scores_gemma":[0.000020349411,0.000117041585,0.0007199334,0.00009006641,0.00015988019,0.00014961454,0.00018731432,0.7679979,0.0042498764,0.19973893,0.026499648,0.00006937937],"about_ca_topic_score_codex":0.0009639458,"about_ca_topic_score_gemma":0.00148965,"teacher_disagreement_score":0.004067734,"about_ca_system_score_codex":0.0007105789,"about_ca_system_score_gemma":0.0007175978,"threshold_uncertainty_score":0.021512508},"labels":[],"label_agreement":null},{"id":"W2298168480","doi":"10.1007/978-3-540-72530-5","title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":573,"is_retracted":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; University of Regina; University of Winnipeg; York University","funders":"","keywords":"Granular computing; Rough set; Data mining; Computer science; Fuzzy set; Fuzzy logic; Artificial intelligence","score_opus":0.03682741232498869,"score_gpt":0.28338801343636444,"score_spread":0.24656060111137573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298168480","genre_codex":"review","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.008112621,0.54497546,0.3803786,0.0057800594,0.0030712832,0.00014467613,0.000641553,0.00061192375,0.056283772],"genre_scores_gemma":[0.2124926,0.34973148,0.392062,0.0021366635,0.0074097156,0.00049710093,0.001618669,0.00018935901,0.03386245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984213,0.00042123505,0.0001606594,0.0001915553,0.0007447358,0.000060484],"domain_scores_gemma":[0.99832004,0.0012190987,0.00014210626,0.00015256365,0.00012583075,0.00004034654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864666,0.001317084,0.0030480754,0.002966248,0.000592808,0.004905101,0.0012103204,0.0016893365,0.004208472],"category_scores_gemma":[0.005010284,0.00069273275,0.0010210922,0.008982767,0.002897438,0.0049741236,0.0013069422,0.002525087,0.0014212724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087667955,0.0000738801,0.00057746057,0.003531131,0.00018848678,0.00031440094,0.00046597864,0.019848827,0.0013174126,0.66417605,0.034738455,0.27468023],"study_design_scores_gemma":[0.00001668996,0.000033185748,0.00053878356,0.0003309509,0.000051589388,0.0003615683,0.00015177172,0.013325861,0.00029959346,0.92080295,0.06405124,0.000035747707],"about_ca_topic_score_codex":0.0011992964,"about_ca_topic_score_gemma":0.0012865628,"teacher_disagreement_score":0.004905101,"about_ca_system_score_codex":0.0010711959,"about_ca_system_score_gemma":0.0008759187,"threshold_uncertainty_score":0.014078736},"labels":[],"label_agreement":null},{"id":"W230214929","doi":"10.1007/978-3-319-11740-9_64","title":"Thresholds Determination for Probabilistic Rough Sets with Genetic Algorithms","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Probabilistic logic; Computer science; Algorithm; Set (abstract data type); Genetic algorithm; Process (computing); Artificial intelligence; Data mining; Machine learning","score_opus":0.020145397404832316,"score_gpt":0.24867044633783492,"score_spread":0.2285250489330026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W230214929","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.0038737035,0.00021041417,0.9946925,0.000040125855,0.00002475194,0.000030292544,0.000017776745,0.00018177902,0.00092869933],"genre_scores_gemma":[0.18922165,0.00036612223,0.80870414,0.00005127035,0.00004810207,0.00016885261,0.00014139022,0.0001733035,0.0011251146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979547,0.0005744801,0.00016498724,0.00032602675,0.0008348458,0.00014489016],"domain_scores_gemma":[0.9978459,0.0014124841,0.0001429209,0.00020415346,0.0003444875,0.00005011228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026068736,0.0009832282,0.0020122526,0.0020034877,0.00083297864,0.0027852089,0.0027958453,0.0017150497,0.0017316287],"category_scores_gemma":[0.010437352,0.00089253136,0.002310772,0.0020483725,0.0010079445,0.0025368796,0.0019137439,0.0020577319,0.0005861421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016191762,0.000081143124,0.000504042,0.0002765366,0.00013695496,0.00011902802,0.00030288994,0.5847443,0.006810359,0.09137156,0.00202942,0.3134619],"study_design_scores_gemma":[0.000013355887,0.000024779987,0.00011770393,0.000033441516,0.000028671477,0.000037944108,0.00002449391,0.9416756,0.0019020687,0.055290435,0.00083269674,0.000018816436],"about_ca_topic_score_codex":0.0027531309,"about_ca_topic_score_gemma":0.0016038006,"teacher_disagreement_score":0.0027958453,"about_ca_system_score_codex":0.0014775181,"about_ca_system_score_gemma":0.0013468227,"threshold_uncertainty_score":0.013786614},"labels":[],"label_agreement":null},{"id":"W2302430074","doi":"10.1007/978-3-319-63390-9_1","title":"Verified Compilation of Space-Efficient Reversible Circuits","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":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":"Space (punctuation); Electronic circuit; Computer science; Electrical engineering; Engineering; Operating system","score_opus":0.018899072874438205,"score_gpt":0.24428745840054578,"score_spread":0.22538838552610757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302430074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11231873,0.0014275562,0.840459,0.00052517507,0.0005468701,0.00018129377,0.0006625515,0.015400538,0.028478272],"genre_scores_gemma":[0.8108519,0.00057996926,0.17455016,0.00018169502,0.00013900649,0.00016200873,0.0008020867,0.0021867987,0.010546378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870336,0.00033715554,0.00007331671,0.00017862483,0.0005273256,0.00018022112],"domain_scores_gemma":[0.9964678,0.0017216374,0.00013343064,0.0011666814,0.00046143343,0.00004895857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089709315,0.00075027,0.00075230363,0.0005420442,0.0006243822,0.0013908573,0.0016196729,0.0006001316,0.007737123],"category_scores_gemma":[0.0043147453,0.00063224597,0.0009366,0.0005716193,0.0012450407,0.0019472584,0.001237513,0.0014429464,0.0012019422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007845862,0.00025292754,0.0010772686,0.0012723486,0.00017704115,0.00044626085,0.00046342486,0.20014563,0.05955491,0.39018023,0.013013972,0.33263138],"study_design_scores_gemma":[0.00026719135,0.0002891992,0.0007978366,0.00022302031,0.00019700683,0.0002643917,0.00010471259,0.46568373,0.16205837,0.33746326,0.03255868,0.000092608185],"about_ca_topic_score_codex":0.0012765798,"about_ca_topic_score_gemma":0.0028038013,"teacher_disagreement_score":0.007737123,"about_ca_system_score_codex":0.0012100771,"about_ca_system_score_gemma":0.0019055796,"threshold_uncertainty_score":0.025883257},"labels":[],"label_agreement":null},{"id":"W2307814545","doi":"10.1007/978-3-319-30671-1_30","title":"Toward Reproducible Baselines: The Open-Source IR Reproducibility Challenge","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Open source; Information retrieval; World Wide Web; Source code; Data science; Software; Programming language","score_opus":0.06459347854591166,"score_gpt":0.29740635539870164,"score_spread":0.23281287685278998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2307814545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04566764,0.02140775,0.7979408,0.012041038,0.005706161,0.0011357026,0.013078546,0.08376784,0.01925453],"genre_scores_gemma":[0.2331636,0.00399811,0.66902936,0.005533408,0.0033080867,0.0014668645,0.04603302,0.025498854,0.011968667],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.8577686,0.07060713,0.010214571,0.017655727,0.040770877,0.0029830828],"domain_scores_gemma":[0.64279795,0.12698022,0.010934897,0.17192417,0.043509778,0.003853039],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.10638748,0.003584481,0.004279277,0.0053859493,0.0037856859,0.01397727,0.0125772655,0.007196176,0.007318506],"category_scores_gemma":[0.3187569,0.0022930643,0.0031925014,0.006255355,0.004920019,0.01725592,0.016134415,0.010397229,0.013021551],"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.0021737819,0.001195657,0.0075527,0.005294164,0.0015612893,0.0004989238,0.0017349505,0.0139728235,0.033912044,0.038412884,0.21190234,0.6817885],"study_design_scores_gemma":[0.00142699,0.0016183027,0.013093771,0.0017422958,0.0011162785,0.0029244572,0.0018617022,0.29084876,0.09789767,0.36045003,0.2263255,0.0006942771],"about_ca_topic_score_codex":0.0028561866,"about_ca_topic_score_gemma":0.0038975263,"teacher_disagreement_score":0.8936125,"about_ca_system_score_codex":0.0021326025,"about_ca_system_score_gemma":0.0059932615,"threshold_uncertainty_score":0.5626375},"labels":[],"label_agreement":null},{"id":"W2308468229","doi":"10.1007/978-3-642-31915-0_1","title":"Logical Foundations for a Rational BDI Agent Programming Language (Extended Version)","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"York University","funders":"","keywords":"Rationality; Computer science; Programming language; Declarative programming; Key (lock); Artificial intelligence; Programming paradigm; Inductive programming; Epistemology; Computer security","score_opus":0.03754757790294123,"score_gpt":0.2916863343240805,"score_spread":0.25413875642113926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308468229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030393603,0.0017613886,0.8904845,0.0021504597,0.00053094886,0.0001292929,0.00053968903,0.0010109297,0.10035348],"genre_scores_gemma":[0.15618981,0.0027074208,0.76805246,0.0015196396,0.0007429275,0.0008486108,0.0014565039,0.00075388845,0.067728736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.0001227564,0.00007345193,0.00012008579,0.000251777,0.00006912592],"domain_scores_gemma":[0.9995128,0.00022867683,0.00003186419,0.00006738628,0.0001336978,0.0000255878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010577595,0.00089238764,0.0006295794,0.00090576534,0.0012314252,0.0048202677,0.0017127254,0.0012740939,0.014513814],"category_scores_gemma":[0.0015146378,0.00096716516,0.0016813811,0.0017031846,0.0028800468,0.0054281224,0.0019252909,0.004456534,0.005193537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010519272,0.000014472942,0.000020571964,0.00007413882,0.0000054597995,0.000037266684,0.00018100541,0.00090879714,0.00057676353,0.9803925,0.00416058,0.013617866],"study_design_scores_gemma":[0.000016699129,0.000009938231,0.000040370236,0.000041582232,0.000011590603,0.0000754737,0.000039333987,0.0065893275,0.00076371734,0.93657887,0.05581869,0.000014464591],"about_ca_topic_score_codex":0.0022272184,"about_ca_topic_score_gemma":0.00168198,"teacher_disagreement_score":0.014513814,"about_ca_system_score_codex":0.0021495537,"about_ca_system_score_gemma":0.0011668747,"threshold_uncertainty_score":0.048553586},"labels":[],"label_agreement":null},{"id":"W2310399702","doi":"10.1007/978-3-540-77343-6_11","title":"An Information Theoretic Model of Saliency and Visual Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Fixation (population genetics); Visual search; Psychophysics; Artificial intelligence; Range (aeronautics); Machine learning; Perception; Psychology; Neuroscience","score_opus":0.05428225470515005,"score_gpt":0.33877586404093113,"score_spread":0.28449360933578105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310399702","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.07328732,0.004108526,0.8507907,0.006896772,0.0002746786,0.000067040615,0.0004261111,0.0004249071,0.06372406],"genre_scores_gemma":[0.91408616,0.0016178436,0.06940981,0.00041720874,0.0004569685,0.00010511648,0.00020754452,0.00011445399,0.013584928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955684,0.00014489058,0.000018831563,0.00007206763,0.0001471873,0.000060200862],"domain_scores_gemma":[0.99828327,0.001206009,0.00010638288,0.00012255648,0.00021044596,0.00007137333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010515527,0.0004626071,0.0007716222,0.0011754642,0.00055483094,0.0023555781,0.0020892425,0.0020944732,0.007054307],"category_scores_gemma":[0.005139187,0.000471275,0.0008037132,0.0014431038,0.0016299458,0.005717454,0.00088276784,0.0012647695,0.0006503828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028152355,0.000019072304,0.00014045283,0.00006106391,0.000016167338,0.00007412363,0.000106697116,0.02600105,0.0010998442,0.9613523,0.0020477271,0.009053398],"study_design_scores_gemma":[0.000008454224,0.0000109166285,0.0001051614,0.0000063442462,0.0000059654008,0.000064584245,0.000017371196,0.13416848,0.00013243222,0.8646879,0.0007848075,0.000007551804],"about_ca_topic_score_codex":0.002056021,"about_ca_topic_score_gemma":0.0012386858,"teacher_disagreement_score":0.007054307,"about_ca_system_score_codex":0.0012655389,"about_ca_system_score_gemma":0.0006968819,"threshold_uncertainty_score":0.023598969},"labels":[],"label_agreement":null},{"id":"W231126777","doi":"10.1007/978-3-642-41278-3_22","title":"Deep Learning on Natural Viewing Behaviors to Differentiate Children with Fetal Alcohol Spectrum Disorder","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neonatal and fetal brain pathology","field":"Medicine","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":"Queen's University","funders":"","keywords":"Computer science; Fetal Alcohol Spectrum Disorder; Artificial intelligence; Gaze; Convolutional neural network; Visual attention; Eye tracking; AdaBoost; Neurodevelopmental disorder; Support vector machine; Classifier (UML); Fetal alcohol syndrome; Machine learning; Psychology; Cognition; Neuroscience; Developmental psychology; Autism","score_opus":0.009335898784630679,"score_gpt":0.23821779230357593,"score_spread":0.22888189351894525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W231126777","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.65795344,0.0035906627,0.30716777,0.0013090794,0.00032419528,0.00009093933,0.0024227914,0.001752446,0.025388718],"genre_scores_gemma":[0.9037885,0.0013914144,0.071882576,0.00022114169,0.000083690604,0.000063271444,0.0030334748,0.00010377065,0.019432137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999503,0.00001023938,0.0000023163045,0.000013074228,0.0000103399725,0.000013706667],"domain_scores_gemma":[0.9998394,0.000084118976,0.000010115551,0.0000124445,0.000040218103,0.000013644648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001813816,0.00042928747,0.00017565479,0.0002670575,0.000089558926,0.00026700177,0.00029088737,0.00022439647,0.0024088442],"category_scores_gemma":[0.000563969,0.00008800626,0.00033168565,0.00021435365,0.00008259162,0.00037140225,0.0003821735,0.0006458699,0.00048255158],"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.00017154834,0.00019985942,0.015916662,0.00004963426,0.000078648416,0.0000832694,0.00009533755,0.034737203,0.011753231,0.0017931102,0.009091475,0.92603004],"study_design_scores_gemma":[0.000018733652,0.0002844033,0.030757828,0.00010013244,0.00008481185,0.00015071739,0.00019034173,0.9392412,0.012182604,0.010556636,0.0064054155,0.000027294083],"about_ca_topic_score_codex":0.005223445,"about_ca_topic_score_gemma":0.010273169,"teacher_disagreement_score":0.005223445,"about_ca_system_score_codex":0.00024939107,"about_ca_system_score_gemma":0.0002665564,"threshold_uncertainty_score":0.010386109},"labels":[],"label_agreement":null},{"id":"W23180661","doi":"10.1007/978-3-642-28509-7_24","title":"Improving Access Control for Mobile Consumers of Services by Use of Context and Trust within the Call-Stack","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Stack (abstract data type); Control (management); Context (archaeology); Computer science; Business; Internet privacy; Access control; Telecommunications; Computer security; Geography; Operating system; Artificial intelligence","score_opus":0.019887717510736706,"score_gpt":0.2814385473603193,"score_spread":0.2615508298495826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23180661","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.62276846,0.0037211534,0.32205093,0.0033207184,0.00016824466,0.00014901173,0.0001222325,0.0012206709,0.046478536],"genre_scores_gemma":[0.98041886,0.00038190105,0.015404285,0.00007895695,0.000040309387,0.00002078223,0.00003894395,0.000053688196,0.0035622565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985285,0.00043920544,0.0000672222,0.00016486547,0.0005106378,0.0002895309],"domain_scores_gemma":[0.9959864,0.0021284483,0.00046954743,0.0005370722,0.00063639943,0.00024203815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017524068,0.00059000286,0.0005488984,0.00047641934,0.0009289512,0.0037514481,0.0009917686,0.001279095,0.0033032463],"category_scores_gemma":[0.009003199,0.0003752908,0.00052960264,0.0006072836,0.00088558084,0.0065575517,0.0020460568,0.0022570556,0.0005029519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001347748,0.0009895435,0.049192823,0.00045183316,0.00033427382,0.0008328795,0.009340249,0.04693109,0.06263746,0.14593768,0.008242615,0.67376167],"study_design_scores_gemma":[0.00013764271,0.0012310904,0.03666667,0.00032243098,0.0008104372,0.0013341153,0.0063320785,0.6320758,0.052674398,0.22916943,0.03887445,0.000371562],"about_ca_topic_score_codex":0.004647406,"about_ca_topic_score_gemma":0.004449657,"teacher_disagreement_score":0.004647406,"about_ca_system_score_codex":0.0009246992,"about_ca_system_score_gemma":0.0010110202,"threshold_uncertainty_score":0.011050522},"labels":[],"label_agreement":null},{"id":"W2337761774","doi":"10.1007/978-3-319-29516-9_11","title":"List Colouring and Partial List Colouring of Graphs On-line","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Pathwidth; Computer science; Planar graph; Outerplanar graph; Clique-sum; Conjecture; Cograph; Indifference graph; Split graph; Discrete mathematics; Mathematics; Line graph; 1-planar graph; Graph","score_opus":0.028487873025494964,"score_gpt":0.2919273367348818,"score_spread":0.26343946370938687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337761774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076282725,0.0016957546,0.7552391,0.0012948506,0.0007989685,0.00027715915,0.000993339,0.003498558,0.15991955],"genre_scores_gemma":[0.42867905,0.0027090653,0.46250284,0.000787894,0.0004174499,0.0003625963,0.0018986904,0.0021618304,0.100480646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994211,0.00013185112,0.000030896255,0.0001397604,0.00015782785,0.00011851824],"domain_scores_gemma":[0.9980342,0.0007186824,0.00012235178,0.0006496899,0.00034242845,0.00013274525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042939917,0.000726963,0.00064044696,0.0008697754,0.0012924981,0.0023803432,0.0015270043,0.0008407428,0.017352168],"category_scores_gemma":[0.0028307443,0.00060712104,0.0009169727,0.0020436854,0.0015702336,0.003782594,0.0015896866,0.0020128721,0.0028427097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025594907,0.000081795195,0.00042439136,0.0005951389,0.000027738424,0.00018139306,0.0006108238,0.018745154,0.011010784,0.6766126,0.025165288,0.26628888],"study_design_scores_gemma":[0.000028786548,0.00006974777,0.00041951722,0.0000998925,0.000038485847,0.00024743495,0.00014672763,0.031803828,0.008446213,0.9037594,0.05490321,0.00003683102],"about_ca_topic_score_codex":0.0021678074,"about_ca_topic_score_gemma":0.0025392675,"teacher_disagreement_score":0.017352168,"about_ca_system_score_codex":0.0013472494,"about_ca_system_score_gemma":0.00084006804,"threshold_uncertainty_score":0.058048785},"labels":[],"label_agreement":null},{"id":"W2337987574","doi":"10.1007/978-3-319-23528-8_45","title":"Erratum to: Scalable Metric Learning for Co-Embedding","year":2015,"lang":"en","type":"erratum","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Computer science; Embedding; Scalability; Metric (unit); Theoretical computer science; Artificial intelligence; Database; Engineering","score_opus":0.02565422652218614,"score_gpt":0.3180452750199855,"score_spread":0.29239104849779934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337987574","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005380015,0.0015018687,0.011781605,0.064278394,0.9095637,0.00005399284,0.0027854564,0.0016696593,0.007827327],"genre_scores_gemma":[0.04261516,0.010999171,0.07845889,0.098732546,0.25361004,0.00051315525,0.029027956,0.0069074556,0.47913563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948526,0.00061932264,0.0007896661,0.0007311109,0.0027327049,0.00027469906],"domain_scores_gemma":[0.97612894,0.0043020383,0.000925485,0.0026951202,0.01507957,0.00086894643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026968943,0.002182139,0.0020268972,0.0032163083,0.0036566171,0.0035520466,0.0032400077,0.0049281497,0.084054045],"category_scores_gemma":[0.05511467,0.0009301915,0.0011266673,0.0034913318,0.0022289783,0.0041705393,0.0028352018,0.0058183735,0.051615536],"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.00003318435,0.000007876009,0.000050438794,0.000052199346,0.00000629677,0.00006656416,0.000009109185,0.000101118334,0.00008925202,0.0013601361,0.9886199,0.009603998],"study_design_scores_gemma":[0.00006560456,0.000082369705,0.00073899515,0.000310323,0.000045073404,0.000773795,0.0001511191,0.0032756673,0.001714242,0.014702386,0.9780424,0.00009805732],"about_ca_topic_score_codex":0.008051268,"about_ca_topic_score_gemma":0.013033346,"teacher_disagreement_score":0.084054045,"about_ca_system_score_codex":0.0031268825,"about_ca_system_score_gemma":0.0040411013,"threshold_uncertainty_score":0.28118885},"labels":[],"label_agreement":null},{"id":"W2338813786","doi":"10.1007/978-3-319-41168-2_9","title":"Know When to Persist: Deriving Value from a Stream Buffer","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Data stream; Scheduling (production processes); Random permutation; Competitive analysis; Buffer (optical fiber); Online algorithm; Algorithm; Mathematical optimization; Upper and lower bounds; Mathematics; Discrete mathematics","score_opus":0.017708914270618627,"score_gpt":0.24411503559238928,"score_spread":0.22640612132177065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338813786","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.019949522,0.00047842666,0.9680301,0.00085858325,0.0001937919,0.00009902029,0.00045159727,0.004604823,0.005334136],"genre_scores_gemma":[0.43505606,0.0006806758,0.5506636,0.00050226995,0.00032246736,0.00015094476,0.00086096954,0.002150454,0.009612552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838066,0.0002771648,0.00013183839,0.00039696076,0.0006297748,0.00018353642],"domain_scores_gemma":[0.9924124,0.004666289,0.0003235184,0.0015582565,0.00075547857,0.00028396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028593864,0.00091489387,0.0012275412,0.0010698651,0.000990859,0.0042179204,0.0031957182,0.001661859,0.005284767],"category_scores_gemma":[0.019801803,0.0008563636,0.0011820794,0.001356325,0.002324801,0.010708039,0.004034585,0.002683006,0.0013886621],"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.0012342102,0.00020155354,0.004998158,0.0005107189,0.00013218918,0.0008440544,0.00203631,0.07225397,0.01402728,0.47152573,0.015908591,0.41632718],"study_design_scores_gemma":[0.0000923114,0.00011135114,0.00027906126,0.00013394275,0.00014322757,0.00022580747,0.00026536515,0.418164,0.026661234,0.536634,0.017219273,0.000070403774],"about_ca_topic_score_codex":0.0025206902,"about_ca_topic_score_gemma":0.0020868748,"teacher_disagreement_score":0.005284767,"about_ca_system_score_codex":0.0012405472,"about_ca_system_score_gemma":0.0018805409,"threshold_uncertainty_score":0.017679274},"labels":[],"label_agreement":null},{"id":"W2339653500","doi":"10.1007/978-3-540-39903-2_108","title":"Iterating Registration and Activation Detection to Overcome Activation Bias in fMRI Motion Estimates","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Stimulus (psychology); Contrast (vision); Motion (physics); Pattern recognition (psychology); Mathematics; Psychology; Cognitive psychology","score_opus":0.037056719958811705,"score_gpt":0.31182584554416515,"score_spread":0.27476912558535344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339653500","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.006933798,0.00020354353,0.9908727,0.000055792738,0.000043253145,0.00003502947,0.000035053763,0.0015045297,0.0003162888],"genre_scores_gemma":[0.03314937,0.0001933292,0.96340156,0.0000747933,0.000037141013,0.00007199527,0.00018671855,0.00080367865,0.0020814482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986237,0.00034631963,0.00012599309,0.00033099952,0.00043100954,0.00014200436],"domain_scores_gemma":[0.99727255,0.0015261454,0.00022739335,0.0004215985,0.000494835,0.000057458252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004079236,0.0016216078,0.0020747997,0.0016081847,0.00061888975,0.0017103213,0.0018710251,0.0017870715,0.0039779884],"category_scores_gemma":[0.0072188624,0.00144448,0.001888075,0.0022739377,0.00079880224,0.001638296,0.0017390315,0.0019840186,0.0029810937],"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.00034726973,0.00012750496,0.0010063823,0.0002860835,0.0004492316,0.000103554295,0.00028344587,0.024755796,0.15278329,0.0057353713,0.0030958971,0.8110262],"study_design_scores_gemma":[0.00007340739,0.00033873774,0.004479437,0.000043684075,0.00047416467,0.0009903272,0.00009735636,0.7809842,0.18843405,0.0136255035,0.010351185,0.0001078599],"about_ca_topic_score_codex":0.0025469337,"about_ca_topic_score_gemma":0.0068925456,"teacher_disagreement_score":0.004079236,"about_ca_system_score_codex":0.00042354024,"about_ca_system_score_gemma":0.001227725,"threshold_uncertainty_score":0.021573305},"labels":[],"label_agreement":null},{"id":"W2341303028","doi":"10.1007/978-3-319-24282-8_4","title":"No Sentiment is an Island:","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Sentiment analysis; Class (philosophy); Natural language processing; Artificial intelligence; Empirical research; Information retrieval; World Wide Web","score_opus":0.035289028624197576,"score_gpt":0.27978056681490887,"score_spread":0.2444915381907113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341303028","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.43086863,0.004413329,0.25606892,0.018929085,0.0029532446,0.00033085953,0.0013516124,0.0013419826,0.28374228],"genre_scores_gemma":[0.93771267,0.0010973263,0.032454174,0.0026846856,0.0010432083,0.00011928005,0.0007901736,0.00033219915,0.023766253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999127,0.00019038586,0.00004097414,0.00029482532,0.0002621006,0.000084760024],"domain_scores_gemma":[0.9975999,0.0009979289,0.00037197763,0.00026871794,0.0005429241,0.00021863934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014651547,0.00042306606,0.0005612254,0.0009106745,0.0014071998,0.0032769346,0.0005757572,0.00081259693,0.006272809],"category_scores_gemma":[0.0057141753,0.0002348779,0.00042360707,0.0009729475,0.0017358764,0.0059168437,0.0014473014,0.0013484881,0.0018303049],"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.0007445552,0.00021907045,0.07419045,0.001014678,0.00031980555,0.001345065,0.011954649,0.0019971845,0.020144003,0.2809614,0.051084567,0.5560246],"study_design_scores_gemma":[0.000068094276,0.00039651277,0.093194924,0.00077651715,0.00048600943,0.003389869,0.015517834,0.06514648,0.008846989,0.4812045,0.33080855,0.0001637043],"about_ca_topic_score_codex":0.0012620192,"about_ca_topic_score_gemma":0.001611777,"teacher_disagreement_score":0.006272809,"about_ca_system_score_codex":0.0005084935,"about_ca_system_score_gemma":0.00047424363,"threshold_uncertainty_score":0.02098471},"labels":[],"label_agreement":null},{"id":"W2345257595","doi":"10.1007/978-3-319-30282-9_9","title":"Deriving Metrics for Estimating the Effort Needed in Requirements Compliance Work","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Western University","funders":"","keywords":"Computer science; Context (archaeology); Requirements engineering; Principal (computer security); Work (physics); Process (computing); Risk analysis (engineering); Key (lock); Function point; Point (geometry); Quality (philosophy); Function (biology); Conformity assessment; Systems engineering; Industrial engineering; Software development; Software; Engineering; Computer security","score_opus":0.06287273047956483,"score_gpt":0.3144839275791002,"score_spread":0.2516111970995354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345257595","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.12803726,0.00074759044,0.8640259,0.00018205505,0.00005714555,0.00043388165,0.00069426786,0.00205611,0.0037658324],"genre_scores_gemma":[0.48345736,0.00030138722,0.5128937,0.000033449214,0.000030340738,0.00047778495,0.0016782326,0.00039238395,0.0007354822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9728347,0.008841471,0.002878462,0.0017699425,0.012710548,0.00096485973],"domain_scores_gemma":[0.92573744,0.046835296,0.008474688,0.007293038,0.010577919,0.0010815449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008985212,0.002450551,0.0016464689,0.009887536,0.0005868065,0.003293117,0.002087851,0.0017607395,0.001558878],"category_scores_gemma":[0.09265739,0.001041272,0.0014901366,0.005795258,0.0009518638,0.0045440793,0.0024465234,0.0014939237,0.0007070771],"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.00040291922,0.0005189398,0.04666694,0.0013323199,0.00034403216,0.0003233184,0.000810486,0.22965439,0.017796231,0.024421165,0.0026475713,0.6750818],"study_design_scores_gemma":[0.000036400597,0.0005999581,0.01330146,0.00023563878,0.00012993443,0.00025823154,0.00032607449,0.9563002,0.010267903,0.016653437,0.0018151427,0.00007561472],"about_ca_topic_score_codex":0.0032625038,"about_ca_topic_score_gemma":0.0040715295,"teacher_disagreement_score":0.009887536,"about_ca_system_score_codex":0.002019974,"about_ca_system_score_gemma":0.002136286,"threshold_uncertainty_score":0.04751891},"labels":[],"label_agreement":null},{"id":"W2345851102","doi":"10.1007/978-3-642-02614-0_21","title":"A Review of Mathematical Knowledge Management","year":2009,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Mathematics, Computing, and Information Processing","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":"McMaster University","funders":"","keywords":"Computer science; Operations research; Management science; Mathematics; Engineering","score_opus":0.0380784996615597,"score_gpt":0.3400177185244466,"score_spread":0.30193921886288694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345851102","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020587258,0.9894093,0.0026299797,0.003771895,0.0003600642,0.00001070119,0.000031542786,0.000022367289,0.0035582283],"genre_scores_gemma":[0.0031691173,0.9928227,0.0018654556,0.00062935177,0.00083205814,0.00001865871,0.000050404564,0.0000057766165,0.0006064831],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986702,0.000357999,0.0002173457,0.00013887142,0.0005402614,0.00007527179],"domain_scores_gemma":[0.99388945,0.003967495,0.0004989191,0.0002550763,0.0012234395,0.00016557421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003102943,0.0007402456,0.0016822201,0.006935143,0.0006452199,0.003092503,0.0023514547,0.0016532841,0.004150972],"category_scores_gemma":[0.008868303,0.00045327816,0.0005839212,0.007438216,0.002408803,0.0059872814,0.0017995866,0.0019065449,0.0022510386],"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.000030718842,0.00006661532,0.00034635758,0.011278949,0.0000817022,0.00010539808,0.00015114478,0.0007810982,0.0002169826,0.06677319,0.048531637,0.8716362],"study_design_scores_gemma":[0.000021959262,0.0000556806,0.0010203216,0.0071024294,0.00007815988,0.0008983223,0.00017043513,0.00067258463,0.00033872746,0.06267514,0.9269192,0.00004697182],"about_ca_topic_score_codex":0.002418683,"about_ca_topic_score_gemma":0.0026798039,"teacher_disagreement_score":0.006935143,"about_ca_system_score_codex":0.002692106,"about_ca_system_score_gemma":0.0048377016,"threshold_uncertainty_score":0.01953268},"labels":[],"label_agreement":null},{"id":"W2345999607","doi":"10.1007/978-3-642-02614-0_39","title":"A Knowledge Repository for Indefinite Integration Based on Transformation Rules","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics, Computing, and Information Processing","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":"Western University","funders":"","keywords":"Computer science; Transformation (genetics); Table (database); Domain (mathematical analysis); Set (abstract data type); Theoretical computer science; Programming language; Data mining; Mathematics","score_opus":0.02194205656868599,"score_gpt":0.25629637965812524,"score_spread":0.23435432308943926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345999607","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.006445155,0.0004974733,0.9336059,0.00020911507,0.00012836479,0.0003326159,0.0044629574,0.047606356,0.0067120353],"genre_scores_gemma":[0.08556279,0.00088599965,0.87372357,0.00022428065,0.00009425712,0.00043115407,0.02575683,0.005289981,0.008031118],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99679583,0.0004528254,0.0007120324,0.0006679325,0.0012150888,0.00015633789],"domain_scores_gemma":[0.9926313,0.0022477678,0.000375673,0.0032862336,0.0012207272,0.00023827293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036907152,0.0014301621,0.0024156314,0.008195635,0.001204883,0.0067564454,0.004617041,0.0017306809,0.012719612],"category_scores_gemma":[0.012421129,0.0013697918,0.002606224,0.0071064914,0.0013057645,0.010549499,0.0058466587,0.0026392872,0.008722732],"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.00068743166,0.0005690124,0.0022677276,0.0010083932,0.00033401517,0.0014469465,0.0012419499,0.01620406,0.007394578,0.08710794,0.04402447,0.83771336],"study_design_scores_gemma":[0.0004184989,0.0002258763,0.0019261105,0.0008327624,0.0010738668,0.002087362,0.0007806362,0.36909148,0.05998421,0.29374105,0.26940775,0.00043035037],"about_ca_topic_score_codex":0.0041954294,"about_ca_topic_score_gemma":0.0046273717,"teacher_disagreement_score":0.012719612,"about_ca_system_score_codex":0.00087619835,"about_ca_system_score_gemma":0.0023536773,"threshold_uncertainty_score":0.04255128},"labels":[],"label_agreement":null},{"id":"W2346198375","doi":"10.1007/978-3-642-02614-0_26","title":"The Characteristics of Writing Environments for Mathematics: Behavioral Consequences and Implications for Software Design and Usability","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","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":"Trent University","funders":"","keywords":"Mathematical notation; Computer science; Notation; Software; Usability; Diagrammatic reasoning; Digitization; Curse of dimensionality; Mathematical software; Mathematical theory; Theoretical computer science; Human–computer interaction; Artificial intelligence; Programming language; Arithmetic; Mathematics","score_opus":0.05550854923918153,"score_gpt":0.31671383459648383,"score_spread":0.2612052853573023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346198375","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.9937594,0.00010474689,0.0020959133,0.0000882914,0.000011096481,0.00005299402,0.00003810008,0.00006366139,0.0037858097],"genre_scores_gemma":[0.9964192,0.000060784994,0.002498279,0.000031970467,0.000006721279,0.00004708959,0.00006662505,0.000035588775,0.0008336849],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9955688,0.0015330233,0.0004821039,0.00040158356,0.0017703581,0.00024408128],"domain_scores_gemma":[0.8126049,0.14659443,0.019813022,0.008295412,0.007859573,0.0048327083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005016435,0.00036253012,0.00036386127,0.001059692,0.00071623275,0.0020625698,0.00072615186,0.00072903215,0.0034756218],"category_scores_gemma":[0.10952232,0.0004474894,0.00036604828,0.00075238076,0.0006885175,0.001919918,0.0013264213,0.0011851025,0.00054101646],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024104014,0.0044058687,0.75353974,0.0006373189,0.00014979109,0.0010939804,0.025584623,0.00096234574,0.061679766,0.0030583485,0.0014808687,0.14499696],"study_design_scores_gemma":[0.000116680494,0.0020428274,0.95839566,0.00013383532,0.0001427289,0.002314646,0.011321061,0.0030998888,0.015987853,0.003389992,0.002982684,0.000072078896],"about_ca_topic_score_codex":0.00056915527,"about_ca_topic_score_gemma":0.0010868732,"teacher_disagreement_score":0.005016435,"about_ca_system_score_codex":0.00034692948,"about_ca_system_score_gemma":0.0006041926,"threshold_uncertainty_score":0.02652973},"labels":[],"label_agreement":null},{"id":"W234643","doi":"10.1007/978-3-540-24627-5_18","title":"Challenges in Fixpoint Computation with Multisets","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Concordia University","funders":"","keywords":"Computer science; Computation; Formalism (music); Equivalence (formal languages); Fixed point; Theoretical computer science; Logic programming; Semantics (computer science); Context (archaeology); Programming language; Algorithm; Mathematics","score_opus":0.034256866764457196,"score_gpt":0.2560838604968646,"score_spread":0.2218269937324074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W234643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026184447,0.027903568,0.8691055,0.04039026,0.0016440765,0.00010390705,0.0004839157,0.00197002,0.032214276],"genre_scores_gemma":[0.3646986,0.021962665,0.57658,0.0049505983,0.005650063,0.00036905034,0.0011593205,0.0014371726,0.023192562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98859453,0.0040874137,0.00087108836,0.0021787973,0.0035188154,0.0007492026],"domain_scores_gemma":[0.9486034,0.040822133,0.0006797936,0.0064698253,0.0024712775,0.0009536451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017043695,0.0013247291,0.004234878,0.0027955994,0.0047204946,0.0136850225,0.009730249,0.006748955,0.019714622],"category_scores_gemma":[0.04646612,0.0024636174,0.004217236,0.0069579678,0.01268454,0.069828495,0.0135465935,0.013851483,0.0049146153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006139137,0.00003199501,0.00018689033,0.00029523586,0.000032369993,0.000043289037,0.0002555129,0.0039929547,0.00013882261,0.9537974,0.0052904133,0.035873853],"study_design_scores_gemma":[0.000006363139,0.0000043259543,0.000015076072,0.00003062003,0.000005240009,0.00002047321,0.000045928864,0.0029592756,0.00010156866,0.9931874,0.003614848,0.000008709564],"about_ca_topic_score_codex":0.0023542228,"about_ca_topic_score_gemma":0.002212101,"teacher_disagreement_score":0.019714622,"about_ca_system_score_codex":0.0038022213,"about_ca_system_score_gemma":0.0024510263,"threshold_uncertainty_score":0.09013677},"labels":[],"label_agreement":null},{"id":"W2346701391","doi":"10.1007/978-3-319-25420-3_1","title":"Utilizing Permission Norms in BDI Practical Normative Reasoning","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Memorial University of Newfoundland","funders":"","keywords":"Permission; Normative; Norm (philosophy); Deontic logic; Representation (politics); Computer science; Legal norm; Epistemology; Multi-agent system; Identification (biology); Artificial intelligence; Political science; Law; Philosophy","score_opus":0.059439818161248305,"score_gpt":0.31910694568639175,"score_spread":0.2596671275251434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346701391","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031201898,0.00017612419,0.9760736,0.0006157392,0.00010179764,0.00009962915,0.000109636916,0.00073097827,0.018972263],"genre_scores_gemma":[0.16582268,0.00054074434,0.8205898,0.00029226186,0.00014419194,0.00031289316,0.00046840744,0.0003198402,0.011509193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945247,0.0022478732,0.00051163795,0.00047865458,0.0019890643,0.00024809074],"domain_scores_gemma":[0.9919608,0.0049484386,0.00020094225,0.0016450955,0.0010937066,0.00015097203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005509418,0.0008300178,0.00070238987,0.0016695252,0.0015930419,0.0052390355,0.0025078382,0.001346724,0.01137633],"category_scores_gemma":[0.01658508,0.0011493379,0.0015787969,0.0016608008,0.003832673,0.011851574,0.0043638176,0.0049941624,0.0023613719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004464787,0.00004388438,0.00012187654,0.00013636409,0.000015495763,0.000062384715,0.00041644342,0.006299444,0.0008477806,0.92417854,0.0021264078,0.065706834],"study_design_scores_gemma":[0.000014997314,0.000014292194,0.00003349944,0.000068407455,0.000020675758,0.000057154215,0.000113095026,0.0704039,0.0030104504,0.9115078,0.014735081,0.000020580777],"about_ca_topic_score_codex":0.0034450595,"about_ca_topic_score_gemma":0.0054375036,"teacher_disagreement_score":0.01137633,"about_ca_system_score_codex":0.0020406584,"about_ca_system_score_gemma":0.001718725,"threshold_uncertainty_score":0.038057566},"labels":[],"label_agreement":null},{"id":"W2346770464","doi":"10.1007/978-3-319-73618-1_79","title":"A Unified Probabilistic Model for Aspect-Level Sentiment Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Guelph","funders":"","keywords":"Computer science; Probabilistic logic; Sentiment analysis; Artificial intelligence; Statistical model; Topic model; Natural language processing","score_opus":0.051898437707895914,"score_gpt":0.2836540105116508,"score_spread":0.23175557280375486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346770464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002293122,0.00015024218,0.9958723,0.00012330025,0.000036555117,0.000038023278,0.00020666873,0.0005064043,0.00077335135],"genre_scores_gemma":[0.23125242,0.0010593723,0.7552608,0.00037844188,0.00039665625,0.00056867284,0.0025180362,0.0006465101,0.007918994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859315,0.00038768,0.00012381033,0.00030655248,0.0004769057,0.000111932924],"domain_scores_gemma":[0.9981111,0.00095070625,0.00016281263,0.00026792142,0.00043932337,0.00006816276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023945167,0.00077462924,0.0011910899,0.0013159347,0.000668877,0.0026021665,0.0024526336,0.0012851176,0.0047900383],"category_scores_gemma":[0.0069879447,0.00079997454,0.0020981291,0.002117714,0.0005772518,0.0037360254,0.0018591984,0.0020694556,0.0029009846],"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.00028737696,0.000245665,0.0028606297,0.00031927944,0.00037060838,0.00023040113,0.00037544378,0.3108454,0.012763279,0.18005173,0.01931478,0.47233543],"study_design_scores_gemma":[0.000007642066,0.000013246419,0.00022340441,0.000009209989,0.000030080717,0.000038128826,0.000008307322,0.9571667,0.00043703392,0.040069096,0.0019844198,0.000012712767],"about_ca_topic_score_codex":0.0046321885,"about_ca_topic_score_gemma":0.008312897,"teacher_disagreement_score":0.0047900383,"about_ca_system_score_codex":0.0009247564,"about_ca_system_score_gemma":0.0013446964,"threshold_uncertainty_score":0.016024292},"labels":[],"label_agreement":null},{"id":"W2347121625","doi":"10.1007/978-3-319-30668-1_14","title":"Modelling Evolvability in Genetic Programming","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Computer science; Genetic programming; A priori and a posteriori; Fitness landscape; Artificial intelligence; Genetic algorithm; Tree (set theory); Theoretical computer science; Machine learning; Mathematics","score_opus":0.019790579970375106,"score_gpt":0.2436607517646063,"score_spread":0.2238701717942312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347121625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05464835,0.0020946006,0.8879652,0.0009402391,0.00014796022,0.000057577454,0.000062261424,0.00019193604,0.05389197],"genre_scores_gemma":[0.8440439,0.0026005607,0.1301128,0.00019885306,0.000113561386,0.00016892815,0.0001158783,0.00021894477,0.022426499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995484,0.00021599303,0.00002014003,0.00005210473,0.00011708715,0.000046267127],"domain_scores_gemma":[0.9986469,0.0010319899,0.00009123409,0.000103420425,0.00008620366,0.000040253424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212094,0.0005405039,0.00039446485,0.0004820206,0.00029646602,0.0014846793,0.0013111107,0.0014470526,0.0037774122],"category_scores_gemma":[0.0055980897,0.00038301453,0.0006894242,0.00067590666,0.0016139923,0.0018577335,0.0012820818,0.0015952111,0.0004978708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021245929,0.00002509614,0.00033583885,0.00009736753,0.000020944946,0.00013475423,0.00019297544,0.52418715,0.0013321637,0.45159647,0.000588472,0.021467498],"study_design_scores_gemma":[0.000008121882,0.00001580591,0.000082347506,0.00003189114,0.000007896231,0.000048081267,0.000027800406,0.6061361,0.000353974,0.3904384,0.0028408482,0.000008751191],"about_ca_topic_score_codex":0.0013824465,"about_ca_topic_score_gemma":0.0010098418,"teacher_disagreement_score":0.0037774122,"about_ca_system_score_codex":0.0009149435,"about_ca_system_score_gemma":0.00047912687,"threshold_uncertainty_score":0.012636721},"labels":[],"label_agreement":null},{"id":"W235840106","doi":"10.1007/978-3-642-40537-2_23","title":"Intelligent Tableau Algorithm for DL Reasoning","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Semantic reasoner; Computer science; Bottleneck; Set (abstract data type); State (computer science); Algorithm; Conjecture; Simple (philosophy); Theoretical computer science; Artificial intelligence; Programming language; Mathematics; Discrete mathematics","score_opus":0.023365965395223343,"score_gpt":0.2582048640257885,"score_spread":0.23483889863056517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W235840106","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.0033643816,0.00032669792,0.9859363,0.00023880565,0.00007697555,0.00008923225,0.0004362368,0.0031800556,0.0063512987],"genre_scores_gemma":[0.050121058,0.0002651295,0.93988025,0.00015706051,0.000043252272,0.0001259881,0.0015738228,0.0003979088,0.0074354927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876946,0.00029958322,0.00011595476,0.00026853773,0.00045146738,0.00009497587],"domain_scores_gemma":[0.99853957,0.00077605515,0.000034598554,0.00030182797,0.00031224018,0.000035732326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013777319,0.0007992218,0.0012338044,0.0020961731,0.0014455472,0.0032649252,0.003103319,0.0012729896,0.020443816],"category_scores_gemma":[0.0046704016,0.00066080573,0.0015006484,0.0026651982,0.0012534747,0.0053862785,0.0019970566,0.0020076223,0.00542223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026216963,0.0002059228,0.00043752356,0.0004096182,0.00008860093,0.00013238756,0.00034399555,0.03291396,0.005048305,0.3794889,0.032531314,0.54813737],"study_design_scores_gemma":[0.0000680336,0.0000387097,0.00013695605,0.00008281106,0.000068259375,0.000119533244,0.0001028967,0.4753254,0.008351066,0.4918715,0.023804542,0.000030293495],"about_ca_topic_score_codex":0.0076968926,"about_ca_topic_score_gemma":0.01085648,"teacher_disagreement_score":0.020443816,"about_ca_system_score_codex":0.0024734007,"about_ca_system_score_gemma":0.002470533,"threshold_uncertainty_score":0.06839144},"labels":[],"label_agreement":null},{"id":"W235895081","doi":"10.1007/978-3-319-15892-1_17","title":"An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GA","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Multi-objective optimization; Mathematical optimization; Evolutionary algorithm; Convergence (economics); Preference; Point (geometry); Optimization problem; Genetic algorithm; Evolutionary computation; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.021300083924614695,"score_gpt":0.31953897782211965,"score_spread":0.29823889389750496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W235895081","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.010633646,0.00030101262,0.9645454,0.000109699955,0.0001645096,0.00008545039,0.00012532645,0.0016948917,0.02233994],"genre_scores_gemma":[0.16799402,0.00029765212,0.81851083,0.00016188808,0.000052955438,0.00038142246,0.00024798643,0.00047231064,0.011880895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985373,0.000042532007,0.0000055909154,0.000020514242,0.000059847865,0.000017797181],"domain_scores_gemma":[0.99984634,0.00007277498,0.000007820817,0.000019164721,0.000041088228,0.000012741377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003999595,0.0007352627,0.00066529424,0.0004851059,0.0004507092,0.00059922395,0.0013984098,0.001126767,0.009416333],"category_scores_gemma":[0.0007478412,0.00033139897,0.00084833696,0.0005337099,0.00030210838,0.00047834328,0.0010849595,0.00089075963,0.0012843149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172215,0.0001348649,0.0005370941,0.00035279433,0.00011066631,0.0002873524,0.00014511813,0.68214935,0.016885336,0.025241006,0.0085819,0.26544276],"study_design_scores_gemma":[0.00003302783,0.000045197758,0.00013853046,0.00002651814,0.000022907445,0.00008641281,0.000015297326,0.9826178,0.0022643537,0.004887085,0.009848261,0.000014599485],"about_ca_topic_score_codex":0.0017518338,"about_ca_topic_score_gemma":0.0023808065,"teacher_disagreement_score":0.009416333,"about_ca_system_score_codex":0.00026410184,"about_ca_system_score_gemma":0.00043025368,"threshold_uncertainty_score":0.031500816},"labels":[],"label_agreement":null},{"id":"W2361580210","doi":"10.1007/978-3-319-29938-9_1","title":"Expert Password Management","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Password; Computer science; Password policy; Thematic analysis; Computer security; Cognitive password; Expert system; Internet privacy; Knowledge management; World Wide Web; Qualitative research; One-time password; Artificial intelligence","score_opus":0.017914724138308347,"score_gpt":0.24753499569479226,"score_spread":0.2296202715564839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361580210","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005475039,0.006197728,0.2620605,0.0016589998,0.0012760179,0.0002117884,0.0006449133,0.008075659,0.7143993],"genre_scores_gemma":[0.03134753,0.004287385,0.041882593,0.0006675891,0.00037011295,0.000073882096,0.001407826,0.0005450221,0.9194181],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995459,0.00004368378,0.00002750825,0.000118975404,0.00021793642,0.000045947734],"domain_scores_gemma":[0.9995401,0.000091782436,0.000025659807,0.0001572287,0.00013002152,0.000055271317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005115219,0.00073881255,0.00037141284,0.0013362685,0.00061431504,0.0016979922,0.00103748,0.000997512,0.10819544],"category_scores_gemma":[0.00123229,0.0004123146,0.0003476645,0.0008689719,0.00038727987,0.0033923923,0.0018106238,0.0012319712,0.0819982],"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.000045578312,0.00011233482,0.0002070967,0.0002192427,0.00000724841,0.00009656008,0.00028196242,0.0005306096,0.005380896,0.038865034,0.16931665,0.78493667],"study_design_scores_gemma":[0.000007699446,0.000042926862,0.000636333,0.00018472398,0.000009736297,0.0007848976,0.000105317515,0.003296951,0.0055069276,0.02618054,0.9632239,0.000020082764],"about_ca_topic_score_codex":0.00030144176,"about_ca_topic_score_gemma":0.00065241347,"teacher_disagreement_score":0.10819544,"about_ca_system_score_codex":0.000376511,"about_ca_system_score_gemma":0.0005247089,"threshold_uncertainty_score":0.3619498},"labels":[],"label_agreement":null},{"id":"W2369536682","doi":"10.1007/978-3-319-33461-5_4","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Rounding; Spanning tree; Degree (music); Approximation algorithm; Combinatorics; Minimum spanning tree; Mathematical optimization; Reduction (mathematics); Linear programming relaxation; Mathematics; Lagrangian relaxation; Computer science; Tree (set theory); Linear programming","score_opus":0.02235592030043055,"score_gpt":0.23873351660190054,"score_spread":0.21637759630147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369536682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031477805,0.0016356496,0.954457,0.0009098861,0.00022182602,0.00027216144,0.0007989039,0.0007444473,0.009482375],"genre_scores_gemma":[0.19174731,0.0018881754,0.7886991,0.0004966516,0.00048571895,0.00055188383,0.0024204107,0.0011857419,0.012525106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979955,0.0005301837,0.00010388926,0.00056327827,0.00059025065,0.0002170061],"domain_scores_gemma":[0.99416095,0.00388925,0.00033831084,0.0008569143,0.0004606713,0.00029390375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017624341,0.0024531458,0.003102061,0.001475662,0.000925735,0.0030486784,0.0060213837,0.0031486554,0.0111259315],"category_scores_gemma":[0.013112518,0.0016562854,0.0021255326,0.0052029965,0.0013223422,0.007045878,0.0038592864,0.0047339555,0.001954624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036053633,0.00050011807,0.0008617642,0.0013193062,0.00017424773,0.0001999245,0.0003408249,0.5902627,0.0032446105,0.09495852,0.02792602,0.27985147],"study_design_scores_gemma":[0.00004496081,0.000054185683,0.00016426622,0.00006200037,0.000050815383,0.00010836469,0.00008096404,0.84139776,0.00068469526,0.1538181,0.0035196876,0.000014130826],"about_ca_topic_score_codex":0.0038627707,"about_ca_topic_score_gemma":0.0051547815,"teacher_disagreement_score":0.0111259315,"about_ca_system_score_codex":0.0019997053,"about_ca_system_score_gemma":0.001750156,"threshold_uncertainty_score":0.03721994},"labels":[],"label_agreement":null},{"id":"W2373802572","doi":"10.1007/11520153_14","title":"Perceptive, Non-linear Speech Processing and Spiking Neural Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Speech recognition; Computer science; Speech processing; Artificial neural network; Source separation; Noise (video); Voice activity detection; Speech enhancement; Context (archaeology); Artificial intelligence; Pattern recognition (psychology); Noise reduction","score_opus":0.018266970111526244,"score_gpt":0.2722868730642513,"score_spread":0.2540199029527251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2373802572","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.012636925,0.120072015,0.79438335,0.0025509936,0.0024576033,0.00003608032,0.0002879952,0.0006137382,0.06696124],"genre_scores_gemma":[0.33956084,0.13572586,0.31768736,0.0010141531,0.004851894,0.00018216862,0.00083791086,0.00037515117,0.19976465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998994,0.000016732092,0.000008048277,0.000026737605,0.000041461564,0.0000074966697],"domain_scores_gemma":[0.9997998,0.00012665594,0.000014882449,0.000022345637,0.000029688372,0.000006678135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021010434,0.00059423014,0.0005742843,0.0004545949,0.00019285537,0.0012016561,0.0006109809,0.0011384424,0.003941605],"category_scores_gemma":[0.0008731646,0.00037624798,0.00038347012,0.0011084519,0.00081942556,0.0014613743,0.00043131152,0.001269789,0.0013425914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008388561,0.00007546584,0.0002757894,0.0011817126,0.000096998156,0.00022559652,0.00014811115,0.083666325,0.020101886,0.5466538,0.024368603,0.3231218],"study_design_scores_gemma":[0.000012265281,0.00004029082,0.0005931821,0.00010951344,0.000023265737,0.00030437915,0.000037708956,0.27676958,0.0045494363,0.67048067,0.04704539,0.000034363024],"about_ca_topic_score_codex":0.0007909091,"about_ca_topic_score_gemma":0.0010575725,"teacher_disagreement_score":0.003941605,"about_ca_system_score_codex":0.00040869575,"about_ca_system_score_gemma":0.00022346685,"threshold_uncertainty_score":0.013185978},"labels":[],"label_agreement":null},{"id":"W237421","doi":"10.1007/978-3-642-31374-5_6","title":"A Streaming Digital Ink Framework for Multi-party Collaboration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Western University","funders":"","keywords":"Computer science; Whiteboard; Multimedia; Inkwell; Domain (mathematical analysis); Channel (broadcasting); Human–computer interaction; World Wide Web; Speech recognition; Computer network","score_opus":0.04750518513662457,"score_gpt":0.3445323348663854,"score_spread":0.29702714972976085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W237421","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.0041531706,0.00017850653,0.97868484,0.00008804924,0.00008839419,0.00016677575,0.00016671214,0.00899789,0.0074756504],"genre_scores_gemma":[0.17859395,0.00039102588,0.79857236,0.00011647803,0.00010904845,0.00040958603,0.00068544695,0.0012301529,0.019891951],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990508,0.0002111121,0.00006750193,0.00013284347,0.00042341716,0.00011437318],"domain_scores_gemma":[0.99886,0.00035934697,0.00004321173,0.0003922215,0.00017866459,0.00016658184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276961,0.0007623513,0.0008288642,0.0007473176,0.0012787294,0.0029544905,0.0030984816,0.0015017749,0.016852347],"category_scores_gemma":[0.0024019813,0.00043955896,0.0009233887,0.0008102773,0.0008620207,0.0031055992,0.0053221746,0.0016896504,0.004090686],"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.0017980224,0.0006444707,0.00097032025,0.0006318036,0.00012937874,0.0007205673,0.0012127905,0.06926624,0.033813618,0.2990592,0.028511664,0.5632419],"study_design_scores_gemma":[0.00026250654,0.00017625604,0.00021536744,0.00008979504,0.00007075382,0.00037875527,0.00025913952,0.73080325,0.026581654,0.14091736,0.100154266,0.000090794616],"about_ca_topic_score_codex":0.0018629212,"about_ca_topic_score_gemma":0.0024446214,"teacher_disagreement_score":0.016852347,"about_ca_system_score_codex":0.0006317406,"about_ca_system_score_gemma":0.0009652679,"threshold_uncertainty_score":0.056376696},"labels":[],"label_agreement":null},{"id":"W237483582","doi":"10.1007/978-3-540-78524-8_6","title":"How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical proof; Zero-knowledge proof; Class (philosophy); Zero (linguistics); Computer science; Theoretical computer science; Discrete mathematics; Calculus (dental); Algorithm; Mathematics; Artificial intelligence; Geometry","score_opus":0.03665986228088879,"score_gpt":0.2944153413990113,"score_spread":0.2577554791181225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W237483582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017712979,0.0001787047,0.96848595,0.0025993842,0.00005030402,0.00007838251,0.00011554294,0.00039898526,0.01037972],"genre_scores_gemma":[0.64842373,0.00029326737,0.34189966,0.000546123,0.00010294172,0.00033084163,0.00032808434,0.00038535908,0.007689918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907857,0.0045166486,0.00046297428,0.0018653693,0.0014679305,0.00090142514],"domain_scores_gemma":[0.95036775,0.037768345,0.0015172057,0.007229478,0.001696041,0.0014212063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009894602,0.0012688979,0.0027327738,0.0007945797,0.0025423805,0.004774513,0.00371822,0.005106602,0.008717386],"category_scores_gemma":[0.0514059,0.0016434087,0.0026755051,0.00096700987,0.010210784,0.01426069,0.009032995,0.0066735917,0.0012573639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014130806,0.00007072951,0.00033337894,0.00014080026,0.00007400149,0.00007306001,0.00042222822,0.103680395,0.00041249965,0.8813511,0.0016038911,0.0116967],"study_design_scores_gemma":[0.00002161169,0.000013111201,0.000032599484,0.000016672053,0.000008579582,0.000016096708,0.00003822576,0.08071945,0.00034123886,0.91817856,0.0006019305,0.000011909752],"about_ca_topic_score_codex":0.0031596152,"about_ca_topic_score_gemma":0.0021239049,"teacher_disagreement_score":0.009894602,"about_ca_system_score_codex":0.0020723527,"about_ca_system_score_gemma":0.0040994072,"threshold_uncertainty_score":0.05232823},"labels":[],"label_agreement":null},{"id":"W237505231","doi":"10.1007/11839569","title":"Autonomic and Trusted Computing","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Direct Anonymous Attestation; Trusted Computing; Trusted Network Connect; Autonomic computing; Trusted Platform Module; Computer security; Theoretical computer science; Operating system; Cloud computing","score_opus":0.013934736101141085,"score_gpt":0.24350230747904347,"score_spread":0.2295675713779024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W237505231","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046491185,0.04721234,0.16276588,0.0047514234,0.0032332453,0.00006875897,0.00008034254,0.00096553075,0.7762733],"genre_scores_gemma":[0.28165326,0.042637695,0.048818838,0.0018995544,0.005112808,0.00022100878,0.00026257636,0.00062395073,0.6187703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994868,0.00009815036,0.000020646276,0.000071432674,0.00027820608,0.000044744545],"domain_scores_gemma":[0.9995425,0.00015193874,0.00003230615,0.00016075837,0.00007297662,0.00003960804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004833503,0.0006514827,0.0006354223,0.0007670987,0.0009298916,0.0032639785,0.0005986654,0.00088985445,0.009317857],"category_scores_gemma":[0.0012846757,0.00038567334,0.00029446767,0.0012174689,0.00248057,0.003565669,0.0012777421,0.0026295308,0.0042776563],"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.00001777997,0.000019672189,0.000075754535,0.000082378174,0.000010745773,0.00005599026,0.00019670003,0.002386884,0.0006669149,0.86072725,0.03527842,0.10048144],"study_design_scores_gemma":[0.0000055329715,0.00001640809,0.00015142756,0.00008932778,0.00000801498,0.00017895817,0.00005178699,0.005950491,0.00044645325,0.74891144,0.24418065,0.000009434008],"about_ca_topic_score_codex":0.0005921673,"about_ca_topic_score_gemma":0.0007672913,"teacher_disagreement_score":0.009317857,"about_ca_system_score_codex":0.0013791063,"about_ca_system_score_gemma":0.00076293707,"threshold_uncertainty_score":0.031171322},"labels":[],"label_agreement":null},{"id":"W238211858","doi":"10.1007/978-3-642-32973-9_19","title":"Inversion Modulo Zero-Dimensional Regular Chains","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Modulo; Computer science; Inversion (geology); Algorithm; Geometry; Geology; Discrete mathematics; Mathematics; Paleontology","score_opus":0.014039046651705982,"score_gpt":0.21737255985863618,"score_spread":0.2033335132069302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W238211858","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.26504037,0.00268613,0.096984915,0.0014131436,0.0011464772,0.0000883245,0.00030191237,0.0005373764,0.6318014],"genre_scores_gemma":[0.8621489,0.0029295196,0.020336866,0.00040565498,0.00089610904,0.000068664085,0.0003532703,0.00022183437,0.11263912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997267,0.000041297793,0.000013536357,0.000046632274,0.00010131657,0.0000704391],"domain_scores_gemma":[0.9997111,0.00010497363,0.00003169876,0.000057250232,0.000053052336,0.000041914333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031813994,0.00053619995,0.00048656165,0.0008202153,0.0009293416,0.0018973859,0.00052880944,0.00043974273,0.0071542617],"category_scores_gemma":[0.000875993,0.00030311267,0.00041743394,0.000786098,0.0022511927,0.002838813,0.0015436125,0.002062399,0.001759389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032998403,0.000020725221,0.00006674398,0.00004754862,0.0000036024858,0.000059449718,0.00013922955,0.0003576446,0.0016657544,0.98118263,0.0016215633,0.014802208],"study_design_scores_gemma":[0.0000146388575,0.000016610384,0.00005519228,0.000019365132,0.0000052429887,0.00010674394,0.000057670153,0.0009519815,0.0016754388,0.9862962,0.010793209,0.000007684398],"about_ca_topic_score_codex":0.00041364226,"about_ca_topic_score_gemma":0.0005714336,"teacher_disagreement_score":0.0071542617,"about_ca_system_score_codex":0.000630354,"about_ca_system_score_gemma":0.00052457635,"threshold_uncertainty_score":0.023933351},"labels":[],"label_agreement":null},{"id":"W23847682","doi":"10.1007/978-3-642-33418-4_13","title":"Uncertainty-Based Feature Learning for Skin Lesion Matching Using a High Order MRF Optimization Framework","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; BC Cancer Agency; Simon Fraser University","funders":"","keywords":"Markov random field; Computer science; Cut; Unary operation; Pattern recognition (psychology); Artificial intelligence; Markov chain; Matching (statistics); Leverage (statistics); Mathematics; Image (mathematics); Machine learning; Image segmentation; Combinatorics","score_opus":0.02069984440718491,"score_gpt":0.31405333626197557,"score_spread":0.29335349185479065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23847682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033336491,0.000077148965,0.9962239,0.000050781247,0.0000061822584,0.000011002647,0.0000156804,0.00013362258,0.00014803259],"genre_scores_gemma":[0.38574043,0.0003041749,0.61046016,0.00015773089,0.00009067939,0.00020390375,0.00026840527,0.0002635039,0.0025109896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933165,0.00017841277,0.000043040516,0.00012174656,0.00025352876,0.000071617265],"domain_scores_gemma":[0.9987079,0.00072759634,0.0001405784,0.00012673631,0.00024839715,0.000048804013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014974267,0.00066499657,0.0017663033,0.0010176479,0.0004867743,0.0010159971,0.0014994479,0.0016115468,0.0014590326],"category_scores_gemma":[0.0039320686,0.00080581754,0.0013748064,0.00094002177,0.0006817683,0.0014375021,0.0013008929,0.0012713386,0.00043896647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010621463,0.000057981488,0.00035025753,0.00007691547,0.00006290651,0.000056479883,0.00004050255,0.84704244,0.008679008,0.0069653816,0.0010241952,0.13553762],"study_design_scores_gemma":[0.0000019763559,0.000009511656,0.000056286077,0.0000014860778,0.0000037036393,0.000010800601,0.0000014379871,0.9980988,0.00062797917,0.0010704936,0.000113566726,0.000003949488],"about_ca_topic_score_codex":0.005262327,"about_ca_topic_score_gemma":0.004055345,"teacher_disagreement_score":0.005262327,"about_ca_system_score_codex":0.00081802165,"about_ca_system_score_gemma":0.0012240747,"threshold_uncertainty_score":0.010463357},"labels":[],"label_agreement":null},{"id":"W23905021","doi":"10.1007/978-3-642-39212-2_45","title":"Localization for a System of Colliding Robots","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Mobile robot; Visibility; Trajectory; Position (finance); Obstacle; Computer science; Simulation; Control theory (sociology); Topology (electrical circuits); Physics; Engineering; Artificial intelligence; Geography; Control (management); Electrical engineering; Optics","score_opus":0.02593684835541053,"score_gpt":0.25550442466648365,"score_spread":0.22956757631107313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23905021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018979171,0.0008097327,0.9728213,0.00036704534,0.00009688778,0.000023783801,0.000043182834,0.00033088017,0.0065280516],"genre_scores_gemma":[0.6064192,0.0027241004,0.34808782,0.0002098145,0.00026643078,0.00028048342,0.0002806852,0.00017926184,0.04155226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997341,0.000049985196,0.000016621918,0.000086192806,0.000078303834,0.000034846402],"domain_scores_gemma":[0.9997359,0.00013645233,0.000035500623,0.000028241899,0.000048721646,0.000015147741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035245655,0.0008059791,0.0007517837,0.0005802496,0.000801375,0.000948911,0.0012895837,0.0015633448,0.0039650863],"category_scores_gemma":[0.0013199527,0.00045112378,0.0005830089,0.0009815408,0.0011536201,0.0013180502,0.002253233,0.00095535954,0.00095025543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020358023,0.000036959696,0.00088385097,0.00059012056,0.000078809244,0.0008600025,0.00064121006,0.6625389,0.014823811,0.18497378,0.0048128674,0.12955613],"study_design_scores_gemma":[0.00004216516,0.000103228376,0.00031227153,0.000030488014,0.00002997872,0.00035827945,0.00010283456,0.8633565,0.0016456691,0.1289296,0.0050580655,0.000030932708],"about_ca_topic_score_codex":0.001929214,"about_ca_topic_score_gemma":0.0014311649,"teacher_disagreement_score":0.0039650863,"about_ca_system_score_codex":0.00047453932,"about_ca_system_score_gemma":0.00041725632,"threshold_uncertainty_score":0.013264537},"labels":[],"label_agreement":null},{"id":"W2390764","doi":"10.1007/978-3-642-20841-6_22","title":"Semi-supervised Parameter-Free Divisive Hierarchical Clustering of Categorical Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Computer science; Categorical variable; Hierarchical clustering; Artificial intelligence; Canopy clustering algorithm; CURE data clustering algorithm; Data mining; Single-linkage clustering; Correlation clustering; Constrained clustering; Pattern recognition (psychology); Data stream clustering; Constraint (computer-aided design); Dendrogram; Machine learning; Mathematics","score_opus":0.06073154317108151,"score_gpt":0.3008922138382473,"score_spread":0.24016067066716582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2390764","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.004204945,0.00012027474,0.99396837,0.000057626512,0.000020539133,0.000053496133,0.0001702854,0.0008610856,0.0005434073],"genre_scores_gemma":[0.14276037,0.00018442766,0.84936595,0.00015267267,0.00009861859,0.00031668652,0.0024208217,0.0006076072,0.004092796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627656,0.0013234849,0.00026292933,0.0009053106,0.0010440175,0.00018758482],"domain_scores_gemma":[0.99380314,0.0019464873,0.00037425553,0.0023052127,0.0014028206,0.00016811765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034254899,0.000775138,0.002051535,0.0013675204,0.0010507411,0.0016143111,0.005583869,0.0016063,0.0025876397],"category_scores_gemma":[0.011323871,0.0010400608,0.0019019608,0.0022429226,0.0012442191,0.002459833,0.0034609116,0.0020518661,0.0027931426],"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.00037386475,0.000179125,0.0015852585,0.00059589616,0.0003008919,0.00008322812,0.0005429014,0.22660038,0.015921988,0.020728374,0.014598472,0.7184896],"study_design_scores_gemma":[0.000016186228,0.000049488546,0.00053284084,0.000028794595,0.000027258926,0.00010549877,0.000066077635,0.9611602,0.0044053798,0.030613473,0.0029663607,0.000028467763],"about_ca_topic_score_codex":0.0028067026,"about_ca_topic_score_gemma":0.006609463,"teacher_disagreement_score":0.005583869,"about_ca_system_score_codex":0.0009814505,"about_ca_system_score_gemma":0.0019179033,"threshold_uncertainty_score":0.018115938},"labels":[],"label_agreement":null},{"id":"W2391037491","doi":"10.1007/978-3-319-30668-1_9","title":"A Genetic Programming Approach for the Traffic Signal Control Problem with Epigenetic Modifications","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Traffic signal; Genetic algorithm; Control (management); Epigenetics; Real-time computing; Artificial intelligence; Machine learning; Biology","score_opus":0.015855179646714398,"score_gpt":0.2243204114279859,"score_spread":0.2084652317812715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2391037491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008341713,0.00031200267,0.9807149,0.000549298,0.00007807717,0.00007955602,0.000055213994,0.000053646974,0.009815583],"genre_scores_gemma":[0.32106915,0.001010279,0.64654875,0.0006082225,0.00026112166,0.00092741486,0.00020164327,0.00017865797,0.029194778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954706,0.00019914433,0.000013748627,0.00008661005,0.00009956889,0.000053886604],"domain_scores_gemma":[0.9988612,0.0009140596,0.00005647258,0.000024634297,0.000098089295,0.000045614717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012568382,0.0011342878,0.0015049163,0.0008939485,0.000579099,0.0011621414,0.002583638,0.0030872796,0.0050769723],"category_scores_gemma":[0.0034314755,0.00070812093,0.0015181632,0.0011784098,0.0014991723,0.00095789885,0.0013871428,0.0025517861,0.0003828521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016774442,0.00004542813,0.00015781616,0.00005547259,0.00003484288,0.00007821889,0.000047767444,0.91893905,0.00061817135,0.0662828,0.0009046092,0.012819026],"study_design_scores_gemma":[0.000013899494,0.000015360269,0.000033699594,0.000009477239,0.000010059895,0.000014363966,0.0000088964725,0.97184575,0.00008859157,0.02735644,0.00059748435,0.000006077604],"about_ca_topic_score_codex":0.0069583305,"about_ca_topic_score_gemma":0.005281477,"teacher_disagreement_score":0.0069583305,"about_ca_system_score_codex":0.0015743152,"about_ca_system_score_gemma":0.0015642376,"threshold_uncertainty_score":0.016984165},"labels":[],"label_agreement":null},{"id":"W2394678233","doi":"10.1007/978-3-662-48054-0_22","title":"Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cryptosystem; Computer science; Public-key cryptography; Key (lock); Public key cryptosystem; Theoretical computer science; Oblivious transfer; Transfer (computing); Computer security; Cryptography; Encryption; Parallel computing","score_opus":0.024984137885280547,"score_gpt":0.23405994637808883,"score_spread":0.20907580849280827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394678233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20575525,0.0012519377,0.67035854,0.0029724685,0.00047012942,0.0005093438,0.00054067204,0.0021948973,0.11594675],"genre_scores_gemma":[0.93881977,0.00065969315,0.029731454,0.00031476837,0.0002463373,0.0002819567,0.00032972186,0.00023586709,0.02938043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985663,0.0004386588,0.00008708402,0.00016296955,0.00053604704,0.0002088886],"domain_scores_gemma":[0.9984875,0.00071326795,0.00008962485,0.00055351184,0.00009538342,0.000060805298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583185,0.00061664556,0.00090552674,0.0006891362,0.0008348738,0.0021819242,0.0010464416,0.0011428152,0.006316761],"category_scores_gemma":[0.0036507207,0.00042228663,0.00082252466,0.0006758103,0.0021083942,0.005087335,0.0031542731,0.0027290457,0.00183944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021050042,0.00007363653,0.00013470049,0.00016900964,0.000028054386,0.00010468827,0.00024726492,0.008596268,0.0063375016,0.95760673,0.0026572635,0.023834366],"study_design_scores_gemma":[0.00006854169,0.000065817025,0.00012385721,0.000035418267,0.000023595318,0.00015379464,0.000024924997,0.03149464,0.012545729,0.95084256,0.0046012085,0.00001983956],"about_ca_topic_score_codex":0.00009623438,"about_ca_topic_score_gemma":0.0000675476,"teacher_disagreement_score":0.006316761,"about_ca_system_score_codex":0.0011532793,"about_ca_system_score_gemma":0.00088060123,"threshold_uncertainty_score":0.021131635},"labels":[],"label_agreement":null},{"id":"W2395192821","doi":"10.1007/978-3-662-48971-0_30","title":"When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Patrolling; Computer science; Eulerian path; Enhanced Data Rates for GSM Evolution; Mobile robot; Domain (mathematical analysis); Robot; Graph; Line segment; Point (geometry); Algorithm; Robotics; Line (geometry); Combinatorics; Artificial intelligence; Theoretical computer science; Mathematics; Geometry","score_opus":0.05845675204202838,"score_gpt":0.305469587630638,"score_spread":0.2470128355886096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395192821","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.8115033,0.00040025244,0.18265004,0.001133296,0.00020400253,0.00006216672,0.00034221745,0.0011315626,0.0025731428],"genre_scores_gemma":[0.9791343,0.000082042316,0.019485416,0.000075407836,0.00002898718,0.000012404671,0.00020456906,0.00007515648,0.00090177683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993206,0.000109859226,0.000022353912,0.00022571743,0.00019022691,0.00013113314],"domain_scores_gemma":[0.99664515,0.0016493285,0.0005763143,0.00042660948,0.00040699795,0.00029544233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053318107,0.0006797415,0.00085188006,0.0007066308,0.0007609229,0.00084998115,0.002469943,0.0020367748,0.0010742034],"category_scores_gemma":[0.006039542,0.0005763109,0.0004183127,0.0007395124,0.0010235572,0.0020432158,0.0010197534,0.0010723007,0.00021351427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017982695,0.00034437294,0.042009324,0.0003941855,0.000265114,0.0049047456,0.0012958689,0.7981856,0.02869406,0.0066628656,0.008630451,0.10681515],"study_design_scores_gemma":[0.00002218583,0.00014835724,0.005731653,0.000017428278,0.000062131454,0.00043238103,0.0005321076,0.97805256,0.0061070034,0.008067167,0.00080687174,0.0000200679],"about_ca_topic_score_codex":0.005139065,"about_ca_topic_score_gemma":0.0063802293,"teacher_disagreement_score":0.005139065,"about_ca_system_score_codex":0.00053891813,"about_ca_system_score_gemma":0.00044271743,"threshold_uncertainty_score":0.010218263},"labels":[],"label_agreement":null},{"id":"W2395197407","doi":"10.1007/978-3-319-24574-4_81","title":"Fast Automatic Vertebrae Detection and Localization in Pathological CT Scans - A Deep Learning Approach","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Vertebra; Deep learning; Field (mathematics); Pattern recognition (psychology); Medicine; Anatomy; Mathematics","score_opus":0.012901400595629003,"score_gpt":0.21623456636655145,"score_spread":0.20333316577092245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395197407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016615786,0.0019326637,0.9755681,0.00029285564,0.00009070133,0.00007773953,0.0006368865,0.00330587,0.0014794469],"genre_scores_gemma":[0.20413685,0.0025312267,0.7811577,0.00026512815,0.00016141117,0.00012412407,0.0017858881,0.0005707314,0.009266948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995234,0.0000468434,0.000035413115,0.00012431061,0.00017432625,0.000095802534],"domain_scores_gemma":[0.999215,0.00030887133,0.00007876612,0.000118462616,0.00022715221,0.00005178808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086390786,0.0012148242,0.0012288545,0.0022240512,0.0003524129,0.0016606846,0.0019625505,0.0021009494,0.004425896],"category_scores_gemma":[0.0018494381,0.0011356976,0.0013677347,0.0014784884,0.00034813583,0.001122578,0.0016474373,0.0016833136,0.0030560917],"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.00027072558,0.00008633794,0.002329472,0.0002630158,0.00009366587,0.00019119319,0.000049607897,0.034146845,0.031971205,0.0016144695,0.0070044436,0.92197907],"study_design_scores_gemma":[0.00002495943,0.00007292347,0.0029690093,0.00006677687,0.000073187795,0.0008963425,0.000046013094,0.9674096,0.019721225,0.0051824036,0.0035008742,0.00003664875],"about_ca_topic_score_codex":0.00654658,"about_ca_topic_score_gemma":0.013313022,"teacher_disagreement_score":0.00654658,"about_ca_system_score_codex":0.0005793607,"about_ca_system_score_gemma":0.0012397465,"threshold_uncertainty_score":0.014806032},"labels":[],"label_agreement":null},{"id":"W2395766643","doi":"10.1007/978-3-319-13186-3_70","title":"BigSAM: Mining Interesting Patterns from Probabilistic Databases of Uncertain Big Data","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Big data; Uncertain data; Probabilistic logic; Database transaction; Data mining; Process (computing); Database; Artificial intelligence","score_opus":0.1140113605752562,"score_gpt":0.2911063442832601,"score_spread":0.17709498370800392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395766643","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.027178923,0.0025047276,0.9549916,0.0007037875,0.00019016123,0.00019089165,0.004121583,0.00808268,0.002035696],"genre_scores_gemma":[0.20670368,0.0022571424,0.77634555,0.00031424695,0.00032417043,0.0002979762,0.009924781,0.0006118587,0.0032205563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913675,0.00012670418,0.00007810472,0.00021277461,0.00039619103,0.000049547998],"domain_scores_gemma":[0.9976708,0.0014379774,0.00015515336,0.00043856585,0.00020473155,0.00009276415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012124556,0.0012419648,0.0012881149,0.0019271022,0.0005585281,0.0019863397,0.0025961834,0.00094346283,0.0034270268],"category_scores_gemma":[0.006484302,0.00096948683,0.0016078041,0.0030176248,0.00072695466,0.003927003,0.002209341,0.0017266498,0.0013944673],"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.0005677371,0.00025791195,0.009824943,0.0018042044,0.00054088124,0.0013856151,0.0005034236,0.1289048,0.007344864,0.033640902,0.047006745,0.7682179],"study_design_scores_gemma":[0.00005574986,0.00011349318,0.0018488847,0.00008636445,0.00010552691,0.0012250989,0.00016112262,0.8418678,0.005120886,0.13477847,0.014594336,0.00004225263],"about_ca_topic_score_codex":0.00092537334,"about_ca_topic_score_gemma":0.001664013,"teacher_disagreement_score":0.0034270268,"about_ca_system_score_codex":0.00029316873,"about_ca_system_score_gemma":0.0006090794,"threshold_uncertainty_score":0.011464536},"labels":[],"label_agreement":null},{"id":"W2395903628","doi":"10.1007/978-3-662-49521-6_4","title":"Data Driven Discovery of Attribute Dictionaries","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Computer science; Information retrieval; Product (mathematics); Laptop; Task (project management); Relevance (law); Data mining; Value (mathematics); Scope (computer science); String (physics); Machine learning; Programming language","score_opus":0.033790143420077634,"score_gpt":0.26049764693606653,"score_spread":0.2267075035159889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395903628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07814061,0.0017217539,0.90576094,0.0012252249,0.0002740759,0.0003723236,0.005078564,0.0041585467,0.0032679318],"genre_scores_gemma":[0.25778294,0.0010642707,0.7191808,0.00049695687,0.00016728789,0.0002699752,0.015923448,0.00049346447,0.0046207905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600106,0.0006237622,0.00035166452,0.00078474596,0.0019429162,0.00029576937],"domain_scores_gemma":[0.98443776,0.008969525,0.0005865247,0.002762396,0.0028570462,0.0003866407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035666705,0.0006686332,0.0017005728,0.005319686,0.0011141617,0.0044871853,0.0035686756,0.001271198,0.0025353765],"category_scores_gemma":[0.021409882,0.0009576141,0.0018413286,0.0075137024,0.00103773,0.0051195114,0.0036438517,0.0023742083,0.00239351],"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.00060928386,0.00073884043,0.019134315,0.0007458328,0.00029007657,0.00055478653,0.0006067861,0.028656283,0.014651849,0.037343316,0.021646932,0.87502176],"study_design_scores_gemma":[0.000054987304,0.00012769639,0.0031213528,0.00016269997,0.0001251322,0.00090799213,0.00046030627,0.8501614,0.027988698,0.097299166,0.019523881,0.000066681314],"about_ca_topic_score_codex":0.002137782,"about_ca_topic_score_gemma":0.0049686413,"teacher_disagreement_score":0.005319686,"about_ca_system_score_codex":0.0010964909,"about_ca_system_score_gemma":0.0028333555,"threshold_uncertainty_score":0.018862545},"labels":[],"label_agreement":null},{"id":"W2396424965","doi":"10.1007/978-3-319-24888-2_32","title":"Clustering Analysis for Semi-supervised Learning Improves Classification Performance of Digital Pathology","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sunnybrook Health Science Centre; University of Toronto","funders":"","keywords":"Cluster analysis; Computer science; Support vector machine; Artificial intelligence; Pattern recognition (psychology); Supervised learning; Semi-supervised learning; Decision boundary; Classifier (UML); Machine learning; Digital pathology; Artificial neural network","score_opus":0.03434446534795807,"score_gpt":0.2603556148830837,"score_spread":0.2260111495351256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396424965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05575279,0.0005939369,0.93703675,0.00017897996,0.000080744554,0.00010611303,0.00020034926,0.004121855,0.0019284771],"genre_scores_gemma":[0.37287557,0.0003545583,0.62256753,0.00010061953,0.000087314955,0.00014281798,0.0010237454,0.0004858778,0.0023619833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768996,0.00074061623,0.00015589423,0.0005496643,0.0007834411,0.000080394166],"domain_scores_gemma":[0.9944155,0.0026201766,0.00046356829,0.00071230606,0.0016825838,0.00010580369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024635964,0.000937998,0.00089527736,0.0018730368,0.00048030406,0.0009860614,0.001134431,0.0008674928,0.0018508638],"category_scores_gemma":[0.0059251236,0.00039637752,0.0010052841,0.0011720507,0.0005580518,0.0011282578,0.0007804515,0.0008968876,0.0018434189],"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.0004245402,0.00028705434,0.0056601632,0.0004833966,0.0002322327,0.00012462235,0.00026193025,0.0926806,0.066607185,0.002447186,0.008030997,0.82276005],"study_design_scores_gemma":[0.000012459857,0.00014311759,0.004624005,0.000034585966,0.00004687561,0.00016334397,0.000052664327,0.953247,0.035644013,0.0031402758,0.0028559878,0.000035772675],"about_ca_topic_score_codex":0.0010152222,"about_ca_topic_score_gemma":0.0015639515,"teacher_disagreement_score":0.0024635964,"about_ca_system_score_codex":0.0006187786,"about_ca_system_score_gemma":0.0006441324,"threshold_uncertainty_score":0.01302886},"labels":[],"label_agreement":null},{"id":"W2396434798","doi":"10.1007/978-3-319-19773-9_66","title":"Exploring Through Simulation an Instructional Planner for Dynamic Open-Ended Learning Environments","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Planner; Computer science; Path (computing); Architecture; Motion planning; Artificial intelligence; Human–computer interaction; Robot","score_opus":0.2457661087361334,"score_gpt":0.4206299630084757,"score_spread":0.17486385427234233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396434798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040448666,0.000114524286,0.93517494,0.00016789329,0.000031178453,0.00022676351,0.00008606906,0.0019801096,0.021769851],"genre_scores_gemma":[0.4622713,0.00024336518,0.52007437,0.00005945113,0.000008789219,0.00038332588,0.00027789068,0.0002335653,0.016447943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996902,0.00015280362,0.000014154246,0.00005822732,0.00006304701,0.000021590882],"domain_scores_gemma":[0.9989022,0.0008137331,0.000045989844,0.00008840772,0.000057907804,0.00009181645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046954709,0.0007092174,0.0002952748,0.0002374018,0.00041670358,0.0015648886,0.0014603323,0.0010010627,0.011439792],"category_scores_gemma":[0.0027205015,0.00035004457,0.00035027473,0.00016531337,0.00066811725,0.0021542727,0.0019812193,0.00089215394,0.0011471382],"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.0010490284,0.0011381932,0.0024748666,0.00085346424,0.000057140816,0.0010837927,0.008641358,0.28582156,0.054992292,0.23500769,0.007246977,0.40163356],"study_design_scores_gemma":[0.00023280247,0.00068716303,0.00081092934,0.000369159,0.000050001683,0.0006637303,0.0019888235,0.7252012,0.038795754,0.15705194,0.07405368,0.000094875126],"about_ca_topic_score_codex":0.0004949487,"about_ca_topic_score_gemma":0.00072177465,"teacher_disagreement_score":0.011439792,"about_ca_system_score_codex":0.00043321174,"about_ca_system_score_gemma":0.00085446285,"threshold_uncertainty_score":0.038269937},"labels":[],"label_agreement":null},{"id":"W2396569682","doi":"10.1007/978-3-319-26555-1_73","title":"Winner Determination in Multi-attribute Combinatorial Reverse Auctions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Regina","funders":"","keywords":"Computer science; Combinatorial auction; Common value auction; Reverse auction; Artificial intelligence; Theoretical computer science; Mathematics; Statistics","score_opus":0.12402442361850158,"score_gpt":0.37717089308054774,"score_spread":0.25314646946204616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396569682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060150124,0.0027149827,0.8864569,0.00063551444,0.00025402874,0.00015054077,0.00011692973,0.00025076052,0.04927015],"genre_scores_gemma":[0.7893196,0.0024443092,0.17396137,0.00012839281,0.00036594056,0.00023114344,0.00024556214,0.00018310478,0.033120696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948138,0.0025533726,0.00027830905,0.00052116055,0.0013985472,0.00043487115],"domain_scores_gemma":[0.99528944,0.0030875732,0.00030942715,0.00061449566,0.0005142261,0.00018480318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051234467,0.0011095068,0.0025441453,0.0010398865,0.0010673262,0.005869207,0.0039649582,0.0017365202,0.0054733637],"category_scores_gemma":[0.012631619,0.0011598234,0.0015141194,0.002565701,0.0019317598,0.005147141,0.0028890548,0.003661582,0.0014941919],"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.00040771885,0.00023460241,0.0005293741,0.0005189908,0.0001299172,0.00025573836,0.0003254151,0.115568675,0.0023947048,0.74835783,0.006224398,0.12505254],"study_design_scores_gemma":[0.000059516682,0.00007748778,0.00019288906,0.00004924798,0.000037947564,0.00023842097,0.000087634326,0.32254896,0.0011283683,0.6724967,0.0030452989,0.00003745878],"about_ca_topic_score_codex":0.00041543003,"about_ca_topic_score_gemma":0.00040430625,"teacher_disagreement_score":0.005869207,"about_ca_system_score_codex":0.0013339822,"about_ca_system_score_gemma":0.0011959773,"threshold_uncertainty_score":0.027095735},"labels":[],"label_agreement":null},{"id":"W2396583379","doi":"10.1007/978-3-642-40763-5_84","title":"Overlapping Replicator Dynamics for Functional Subnetwork Identification","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Subnetwork; Computer science; Identification (biology); Inference; Artificial intelligence","score_opus":0.027259722785857435,"score_gpt":0.2570288186166599,"score_spread":0.22976909583080246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396583379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02133502,0.00029465347,0.9765954,0.0001459055,0.000034448796,0.000039326,0.000056239463,0.00018815929,0.0013108948],"genre_scores_gemma":[0.78955734,0.0006134891,0.20226808,0.000117968026,0.00012138689,0.00050454756,0.0002926741,0.00022852652,0.006295962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.00032091967,0.000033209955,0.00013920579,0.00009369841,0.000042775824],"domain_scores_gemma":[0.989316,0.00892225,0.0004480219,0.00076612656,0.00033452437,0.00021312927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024984349,0.0013116203,0.0021410976,0.0015932255,0.0008025415,0.0011204131,0.0021970596,0.0024122864,0.004039353],"category_scores_gemma":[0.01594217,0.0011503428,0.0014189342,0.0010321499,0.0016293102,0.003033092,0.0023998467,0.0025922982,0.0006268851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013888613,0.000059204245,0.0009016242,0.00015614061,0.00014504744,0.00018147536,0.00023175066,0.8285761,0.0023660986,0.12111698,0.0008979249,0.045228835],"study_design_scores_gemma":[0.000002650039,0.0000044592352,0.00003266196,0.0000034606694,0.0000032485373,0.000007922851,0.000003992714,0.9826341,0.00006421228,0.017184738,0.00005533687,0.0000032552732],"about_ca_topic_score_codex":0.002609085,"about_ca_topic_score_gemma":0.0025768836,"teacher_disagreement_score":0.004039353,"about_ca_system_score_codex":0.0007489998,"about_ca_system_score_gemma":0.00064814533,"threshold_uncertainty_score":0.013512969},"labels":[],"label_agreement":null},{"id":"W2396626823","doi":"10.1007/978-3-319-43283-0_4","title":"Power Analysis Attacks Against IEEE 802.15.4 Nodes","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; IEEE 802.11b-1999; IEEE 802.1X; IEEE 802.15; Computer network; Embedded system; IEEE 802.11s; Inter-Access Point Protocol; IEEE 802.11g-2003; Advanced Encryption Standard; IEEE 802.11r-2008; IEEE 802.11w-2009; IEEE 802.11u; Encryption; NeuRFon; IEEE 802; IEEE 802.11; Wireless; Wireless network; Wireless sensor network; Wi-Fi; Wi-Fi array; Telecommunications","score_opus":0.01669764097324349,"score_gpt":0.2760203475502406,"score_spread":0.2593227065769971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396626823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17501877,0.005053692,0.69105804,0.004140778,0.0011275477,0.00022883067,0.00024264673,0.0054135825,0.117716126],"genre_scores_gemma":[0.9362312,0.0016115161,0.035198487,0.0006286364,0.0002707984,0.00009292482,0.00012270582,0.00021669515,0.025627038],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988431,0.00028444076,0.000051999334,0.00013460797,0.00054800883,0.00013781126],"domain_scores_gemma":[0.9985145,0.0005967797,0.00014875889,0.0005082993,0.00019659466,0.000034981887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085819996,0.0010150186,0.00053183857,0.0009349741,0.00074419135,0.0008927959,0.0008440816,0.000948568,0.004699512],"category_scores_gemma":[0.0031634532,0.00040084447,0.0005506675,0.0006491641,0.0010013336,0.0022433803,0.0016555925,0.0012132318,0.0015850548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016254017,0.00018319029,0.002529825,0.00048690417,0.00034894506,0.0011219721,0.0010061975,0.08001023,0.114506796,0.18615219,0.041035585,0.5709927],"study_design_scores_gemma":[0.00022810804,0.00085063116,0.002956159,0.00041169036,0.0003836714,0.0037144104,0.00043052057,0.42820364,0.20544286,0.25833237,0.09893025,0.00011566294],"about_ca_topic_score_codex":0.00035621627,"about_ca_topic_score_gemma":0.00033086012,"teacher_disagreement_score":0.004699512,"about_ca_system_score_codex":0.0007941577,"about_ca_system_score_gemma":0.0003283081,"threshold_uncertainty_score":0.01572138},"labels":[],"label_agreement":null},{"id":"W2396734478","doi":"10.1007/978-3-319-27659-5_27","title":"Human Assisted Randomness Generation Using Video Games","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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 Calgary","funders":"","keywords":"Randomness; Computer science; Entropy (arrow of time); Randomness tests; Set (abstract data type); Theoretical computer science; Human–computer interaction","score_opus":0.06719222483021323,"score_gpt":0.2991904790115262,"score_spread":0.23199825418131295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396734478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13768625,0.0004066784,0.8181281,0.00022455101,0.00017876238,0.0003604892,0.00009033622,0.0014922731,0.041432623],"genre_scores_gemma":[0.84547484,0.00015473129,0.13660935,0.000067022775,0.000021924663,0.00019982796,0.00007405412,0.000105889136,0.017292425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998104,0.00007631214,0.0000056937733,0.000027586786,0.000054497432,0.00002551054],"domain_scores_gemma":[0.99960893,0.00025942049,0.00001899682,0.000039582996,0.000042564923,0.00003054466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037759598,0.0004963895,0.00029194955,0.0002988871,0.00025693417,0.0005184238,0.00069671526,0.00038626458,0.007455635],"category_scores_gemma":[0.0012490763,0.000118375356,0.00026894014,0.00013269504,0.00044946966,0.0005383,0.0008559361,0.0003782014,0.0004990068],"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.0014034032,0.0007551107,0.00203839,0.00049609994,0.00013740956,0.00080161873,0.0010262817,0.24407737,0.11560854,0.14336544,0.010633318,0.4796571],"study_design_scores_gemma":[0.00017412375,0.00065286504,0.0008986158,0.00004968099,0.000035383313,0.00038249418,0.00014555425,0.9097303,0.03686314,0.033290118,0.0177269,0.000050770315],"about_ca_topic_score_codex":0.00045194433,"about_ca_topic_score_gemma":0.00067327684,"teacher_disagreement_score":0.007455635,"about_ca_system_score_codex":0.00023527263,"about_ca_system_score_gemma":0.00020945189,"threshold_uncertainty_score":0.024941623},"labels":[],"label_agreement":null},{"id":"W2396737989","doi":"10.1007/978-3-319-30303-1_22","title":"Security Enforcement by Rewriting: An Algebraic Approach","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Rewriting; Computer science; Process calculus; Security policy; Enforcement; Path (computing); Algebraic number; Polynomial; Theoretical computer science; Programming language; Algebra over a field; Computer security; Mathematics; Law","score_opus":0.023085630879702494,"score_gpt":0.2730735932959605,"score_spread":0.24998796241625798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396737989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037489813,0.00045864316,0.95726347,0.0007712044,0.00017179512,0.00008296702,0.000064805594,0.0005460145,0.03689211],"genre_scores_gemma":[0.2484569,0.0019236956,0.7196211,0.00055202073,0.00067662157,0.00025687143,0.0002664827,0.00068161625,0.027564775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961521,0.001165946,0.00039047815,0.0006569147,0.0014004459,0.00023416593],"domain_scores_gemma":[0.9965004,0.0017198368,0.00023781825,0.0009135252,0.000548698,0.00007971887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299327,0.00074753124,0.0008893302,0.0013667092,0.0014618196,0.0040297117,0.0024901715,0.0014328212,0.0066893054],"category_scores_gemma":[0.006121746,0.0010414682,0.0026372091,0.001455654,0.0044886894,0.0059231576,0.00294165,0.0035598017,0.0020610697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013011143,0.000026615655,0.00004981624,0.00007365615,0.000014743344,0.00008185527,0.0001751608,0.002904987,0.0012625182,0.9795076,0.001216235,0.014673807],"study_design_scores_gemma":[0.000022032951,0.000026341062,0.000049736143,0.000038468064,0.000042328225,0.00017211506,0.00005492525,0.02488488,0.0025581352,0.9519477,0.020179963,0.000023254464],"about_ca_topic_score_codex":0.0010021462,"about_ca_topic_score_gemma":0.0011013251,"teacher_disagreement_score":0.0066893054,"about_ca_system_score_codex":0.0012955625,"about_ca_system_score_gemma":0.0013455099,"threshold_uncertainty_score":0.022377968},"labels":[],"label_agreement":null},{"id":"W2396766533","doi":"10.1007/978-3-319-21978-3_58","title":"Binocular Endoscopic 3-D Scene Reconstruction Using Color and Gradient-Boosted Aggregation Stereo Matching for Robotic Surgery","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"St. Joseph's Hospital; Western University","funders":"","keywords":"Artificial intelligence; Computer vision; Computer science; Stereoscopy; Computer stereo vision; 3D reconstruction; Matching (statistics); Stereo cameras; Stereo camera; Iterative reconstruction; Mathematics","score_opus":0.047048125738032374,"score_gpt":0.2853996362638411,"score_spread":0.23835151052580875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396766533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014391252,0.00024686832,0.9819193,0.00003818934,0.0000322186,0.000027265036,0.00009481384,0.00088608847,0.0023640937],"genre_scores_gemma":[0.2345233,0.0004062843,0.76047814,0.00007077842,0.000032376367,0.000034388686,0.00047946375,0.00023101669,0.003744175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976593,0.000019344669,0.000008784763,0.00003507119,0.00014780399,0.00002299937],"domain_scores_gemma":[0.99991465,0.000014223886,0.00000996849,0.000022175218,0.000031893785,0.000007028728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024160292,0.000378884,0.0005130512,0.0005713968,0.00016494509,0.0005019213,0.0006894985,0.00040473393,0.003113432],"category_scores_gemma":[0.00036729197,0.00036008988,0.0006567148,0.0006998055,0.00015358465,0.0006128559,0.0008057868,0.0005162907,0.0007158731],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024024113,0.00012956242,0.0009746468,0.00018135978,0.00009275087,0.00012425947,0.00008662143,0.057117965,0.14161871,0.010749244,0.0069656163,0.78171897],"study_design_scores_gemma":[0.000014004319,0.00007659553,0.0013824846,0.000013623042,0.00002920602,0.00045886656,0.000023980521,0.9562663,0.034108628,0.0035223814,0.004077188,0.000026790194],"about_ca_topic_score_codex":0.002268389,"about_ca_topic_score_gemma":0.0044510686,"teacher_disagreement_score":0.003113432,"about_ca_system_score_codex":0.0002699688,"about_ca_system_score_gemma":0.00058882823,"threshold_uncertainty_score":0.010415435},"labels":[],"label_agreement":null},{"id":"W2397124290","doi":"10.1007/978-3-319-22053-6_47","title":"CKNNI: An Improved KNN-Based Missing Value Handling Technique","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Missing data; Data mining; Imputation (statistics); Cluster analysis; Centroid; k-nearest neighbors algorithm; Data set; Algorithm; Artificial intelligence; Machine learning","score_opus":0.03167907882061318,"score_gpt":0.28505840536179744,"score_spread":0.2533793265411843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397124290","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.002800121,0.00058281445,0.99010605,0.00013257297,0.00030204802,0.0001178891,0.0008359996,0.004338085,0.0007844395],"genre_scores_gemma":[0.029138168,0.00035333322,0.9631383,0.00022411492,0.00018505525,0.00017087285,0.0029534614,0.00047801813,0.003358627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950801,0.00068225217,0.00047861415,0.00096553395,0.0024007147,0.00039274924],"domain_scores_gemma":[0.99225736,0.002030432,0.0006067632,0.0018821788,0.0029519787,0.00027126246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060687517,0.0018989553,0.00280735,0.003946775,0.0015759298,0.0021117537,0.0060762605,0.0019873476,0.0082222745],"category_scores_gemma":[0.016753271,0.0010581702,0.0020056702,0.0050937226,0.0007815589,0.0029847454,0.0036663255,0.004341475,0.006558434],"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.0008139733,0.00025028887,0.002967145,0.00043345676,0.00031220095,0.00020788064,0.00012129872,0.021091696,0.011387352,0.0038512333,0.019997865,0.9385657],"study_design_scores_gemma":[0.00016802271,0.00027536298,0.0033901036,0.00019270129,0.00032443533,0.001019,0.00014072146,0.9149529,0.028215492,0.016530186,0.03459875,0.00019229374],"about_ca_topic_score_codex":0.010281972,"about_ca_topic_score_gemma":0.013983789,"teacher_disagreement_score":0.010281972,"about_ca_system_score_codex":0.0009276687,"about_ca_system_score_gemma":0.0034562638,"threshold_uncertainty_score":0.032095015},"labels":[],"label_agreement":null},{"id":"W2397202896","doi":"10.1007/978-3-319-24574-4_48","title":"Automatic Vessel Segmentation from Pulsatile Radial Distension","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Pulsatile flow; Computer science; Segmentation; Computer vision; Artificial intelligence; Motion estimation; Optical flow; Orientation (vector space); Computation; Image segmentation; Motion (physics); Algorithm; Image (mathematics); Mathematics","score_opus":0.023664648536692968,"score_gpt":0.2860762661996109,"score_spread":0.26241161766291793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397202896","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.039222483,0.0023035803,0.950883,0.00022694709,0.00013892645,0.00007603812,0.0003663238,0.003802612,0.0029800837],"genre_scores_gemma":[0.2157513,0.004400245,0.76781505,0.00021097531,0.0002718962,0.00008392938,0.0012543711,0.0011961526,0.00901612],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976724,0.000026210437,0.00001320597,0.0000668581,0.000083611856,0.000042842632],"domain_scores_gemma":[0.9996331,0.00015960398,0.000035664667,0.000054741053,0.00009433515,0.000022535463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049922994,0.0009790816,0.0009872551,0.0017544935,0.00034957405,0.0016436693,0.00084007846,0.0011297943,0.0020071818],"category_scores_gemma":[0.0007587362,0.00080677634,0.0007663845,0.0012865774,0.0003942254,0.0007945399,0.00077826803,0.00075549737,0.001994292],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003060499,0.000045769495,0.001135216,0.00025536647,0.00006546974,0.00039209257,0.000117273645,0.009882026,0.14520574,0.0015851886,0.0049420665,0.83606786],"study_design_scores_gemma":[0.000040223033,0.00018202073,0.007814392,0.00014613282,0.00026662214,0.0035792494,0.00013095465,0.74087894,0.21768929,0.008621686,0.020549232,0.000101271915],"about_ca_topic_score_codex":0.0014313189,"about_ca_topic_score_gemma":0.0022276435,"teacher_disagreement_score":0.0020071818,"about_ca_system_score_codex":0.00026432629,"about_ca_system_score_gemma":0.0005080679,"threshold_uncertainty_score":0.0067147017},"labels":[],"label_agreement":null},{"id":"W2397344958","doi":"10.1007/978-3-319-21966-0_21","title":"MOVTCHA: A CAPTCHA Based on Human Cognitive and Behavioral Features Analysis","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Alberta Innovates - Technology Futures","keywords":"CAPTCHA; Computer science; Usability; Cognition; Artificial intelligence; Human–computer interaction; Matching (statistics); Machine learning","score_opus":0.05095114200287299,"score_gpt":0.319930769796148,"score_spread":0.268979627793275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397344958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01003423,0.00036391913,0.97045714,0.00009289301,0.00023258149,0.00017840535,0.00045980373,0.012365777,0.0058152447],"genre_scores_gemma":[0.25195032,0.0006019534,0.7282367,0.00040089566,0.000199749,0.000529021,0.0021916265,0.0016665424,0.01422321],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960905,0.00005924062,0.0000148560175,0.00009692497,0.00018394564,0.000035977508],"domain_scores_gemma":[0.99929416,0.0002938506,0.00005124784,0.00012580311,0.00019419634,0.000040811956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033849134,0.0010716879,0.0005636888,0.0009041818,0.0003427199,0.0006463268,0.0011907585,0.000911931,0.009423319],"category_scores_gemma":[0.002011658,0.00027787857,0.00068364537,0.0006744945,0.00040750223,0.000925235,0.000986823,0.0010299025,0.003674137],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006340666,0.00014585101,0.00068869826,0.00031359188,0.000074983,0.00024494567,0.00019040453,0.014399833,0.09118833,0.005451874,0.017020917,0.86964655],"study_design_scores_gemma":[0.000091864415,0.0005298025,0.0041395365,0.00011460854,0.00013729306,0.0011646161,0.0001280315,0.81029576,0.12523763,0.011483775,0.046530288,0.00014675104],"about_ca_topic_score_codex":0.0013600147,"about_ca_topic_score_gemma":0.0013831866,"teacher_disagreement_score":0.009423319,"about_ca_system_score_codex":0.0002597673,"about_ca_system_score_gemma":0.0003736966,"threshold_uncertainty_score":0.03152412},"labels":[],"label_agreement":null},{"id":"W2397631926","doi":"10.1007/978-3-319-16628-5_44","title":"Efficient Detection for Spatially Local Coding","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Object detection; Artificial intelligence; Detector; Pedestrian detection; Cascade; Coding (social sciences); Classifier (UML); Computer vision; Gradient descent; Pattern recognition (psychology); Hough transform; Source code; Pedestrian; Image (mathematics); Artificial neural network; Mathematics","score_opus":0.02879591841921159,"score_gpt":0.28869752962209266,"score_spread":0.2599016112028811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397631926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055757035,0.00043421675,0.9910449,0.00009251252,0.000046213427,0.000028713403,0.00008836973,0.000608533,0.0020809115],"genre_scores_gemma":[0.14964673,0.0009504527,0.8361996,0.00018894719,0.000127719,0.00012769087,0.00057840947,0.00023893912,0.011941494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945,0.00010259769,0.000020389893,0.00009375683,0.00025916687,0.000074113246],"domain_scores_gemma":[0.99923706,0.00032056734,0.000057205678,0.00020207211,0.00015381034,0.000029347519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004955976,0.00086288614,0.0008753172,0.0011260144,0.00037731658,0.0010454954,0.0011945331,0.0009961383,0.0047116764],"category_scores_gemma":[0.0019396759,0.00045806306,0.00047470673,0.001118575,0.00062230346,0.0012475639,0.0018537694,0.0009554106,0.0024078304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030175116,0.00008851224,0.00045877986,0.000210516,0.00005397904,0.000133426,0.00009005679,0.03416937,0.16519195,0.06469147,0.009250452,0.7253597],"study_design_scores_gemma":[0.000026046482,0.000083257066,0.00063767476,0.000043381115,0.000039151895,0.00039893025,0.000031448544,0.8606444,0.08987501,0.03936648,0.00881762,0.000036559766],"about_ca_topic_score_codex":0.0018578662,"about_ca_topic_score_gemma":0.0035045156,"teacher_disagreement_score":0.0047116764,"about_ca_system_score_codex":0.00055971066,"about_ca_system_score_gemma":0.00077796995,"threshold_uncertainty_score":0.01576215},"labels":[],"label_agreement":null},{"id":"W2398022664","doi":"10.1007/978-3-319-25255-1_52","title":"Mining Weighted Frequent Itemsets with the Recency Constraint","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université de Moncton","funders":"","keywords":"Pruning; Computer science; Constraint (computer-aided design); Data mining; Property (philosophy); Projection (relational algebra); Algorithm; Mathematics","score_opus":0.02814096298749303,"score_gpt":0.255818271026008,"score_spread":0.227677308038515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398022664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28076243,0.007452566,0.6923693,0.00077118684,0.00039438627,0.00061336916,0.012078836,0.0011287245,0.004429261],"genre_scores_gemma":[0.5695617,0.0026031234,0.40162778,0.0002950005,0.0006260799,0.0006862867,0.019928224,0.00022722545,0.0044446257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995193,0.0007070848,0.0011442513,0.0012333808,0.0014270394,0.00029527588],"domain_scores_gemma":[0.98714906,0.007900736,0.0014377423,0.0014737821,0.0017579556,0.000280719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029686182,0.0010357748,0.002812371,0.0039666384,0.00079907896,0.0022196167,0.0032464017,0.0014024329,0.0021496005],"category_scores_gemma":[0.020175368,0.0010336442,0.002261297,0.007545598,0.0005258582,0.005120852,0.0011124844,0.0014512961,0.0010133736],"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.0042557325,0.0012720595,0.068554,0.003763358,0.002318752,0.006376754,0.0005688259,0.12662904,0.023429403,0.02739172,0.017697262,0.7177432],"study_design_scores_gemma":[0.00029701894,0.0010249283,0.01599796,0.00053628243,0.0009712576,0.004979107,0.0006610386,0.8845296,0.013770417,0.0617006,0.015325143,0.0002066452],"about_ca_topic_score_codex":0.0023703487,"about_ca_topic_score_gemma":0.0034666262,"teacher_disagreement_score":0.0039666384,"about_ca_system_score_codex":0.00051975646,"about_ca_system_score_gemma":0.0017316715,"threshold_uncertainty_score":0.015699744},"labels":[],"label_agreement":null},{"id":"W2398302544","doi":"10.1007/978-3-319-29221-2_2","title":"Algorithms for Problems on Maximum Density Segment","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor","funders":"","keywords":"Combinatorics; Subsequence; Simple (philosophy); Longest common subsequence problem; Mathematics; Space (punctuation); Physics; Computer science; Mathematical analysis","score_opus":0.026441973091158925,"score_gpt":0.2559641440294962,"score_spread":0.22952217093833727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398302544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005185972,0.0007532837,0.98131645,0.000386326,0.00011204654,0.00008888413,0.000160733,0.00062897324,0.011367353],"genre_scores_gemma":[0.096286744,0.001276708,0.8754146,0.00028641333,0.00033853485,0.0004818546,0.0014709078,0.0011743058,0.023269853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897647,0.0002457996,0.00005773322,0.00020981849,0.00040989477,0.00010026977],"domain_scores_gemma":[0.9968924,0.0021088205,0.00013967587,0.00041649016,0.00032337772,0.00011936974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013929901,0.0018642843,0.0015693024,0.002058533,0.0012639066,0.0023559772,0.0037811764,0.0024497886,0.02355319],"category_scores_gemma":[0.009690472,0.0011774236,0.0015729594,0.0032960298,0.0017882371,0.005761801,0.004911244,0.0038905258,0.004026867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031668044,0.00016900538,0.00073278503,0.00078102,0.000088799214,0.00008970614,0.00039325166,0.21102811,0.0031487716,0.38117117,0.027362144,0.37471852],"study_design_scores_gemma":[0.000045989327,0.00004368082,0.00018696989,0.000079332945,0.000025207042,0.00009315269,0.00008055384,0.6399459,0.0015958783,0.34291846,0.014970194,0.0000145765625],"about_ca_topic_score_codex":0.002002221,"about_ca_topic_score_gemma":0.002362101,"teacher_disagreement_score":0.02355319,"about_ca_system_score_codex":0.0016925049,"about_ca_system_score_gemma":0.0010054375,"threshold_uncertainty_score":0.07879329},"labels":[],"label_agreement":null},{"id":"W2398377652","doi":"10.1007/978-3-642-39112-5_144","title":"Supporting Lifelong Learning: Recommending Personalized Sources of Assistance to Graduate Students","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Lifelong learning; Computer science; Graduate students; Face (sociological concept); Recommender system; Multimedia; World Wide Web; Mathematics education; Medical education; Pedagogy; Psychology; Medicine","score_opus":0.04102392826732639,"score_gpt":0.3148835812635258,"score_spread":0.2738596529961994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398377652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31677386,0.013992368,0.594319,0.0043074843,0.00073365885,0.0004084879,0.0021071348,0.006697904,0.06066021],"genre_scores_gemma":[0.68894535,0.004814647,0.26077446,0.00043457924,0.0004003822,0.0002135734,0.0019476397,0.00029281023,0.042176608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999801,0.000047093443,0.0000073108313,0.000048256094,0.00007233569,0.000024130566],"domain_scores_gemma":[0.9992895,0.000310714,0.00006356129,0.00008729632,0.00014053278,0.000108251814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913154,0.0005600605,0.00048603205,0.00079222006,0.00039504722,0.0011004788,0.0011562384,0.0009625977,0.0051002707],"category_scores_gemma":[0.0024480938,0.0002517267,0.00036068234,0.00092074514,0.00013032129,0.0014865984,0.0007731019,0.0007412371,0.0035237833],"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.00025817708,0.00063223206,0.007072086,0.00028964636,0.00009336493,0.00010107583,0.00040577483,0.0061715255,0.0058970847,0.002188006,0.034084678,0.9428064],"study_design_scores_gemma":[0.00039504378,0.002551885,0.034323357,0.0006065757,0.00085437024,0.0017592412,0.00251065,0.6155005,0.05241813,0.07285948,0.21588992,0.00033083977],"about_ca_topic_score_codex":0.0010256002,"about_ca_topic_score_gemma":0.0028543372,"teacher_disagreement_score":0.0051002707,"about_ca_system_score_codex":0.0001956148,"about_ca_system_score_gemma":0.00036813662,"threshold_uncertainty_score":0.017062128},"labels":[],"label_agreement":null},{"id":"W2398403423","doi":"10.1007/978-3-319-27239-9_9","title":"Zero-Knowledge Interactive Proof Systems for New Lattice Problems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"McGill University","funders":"","keywords":"Zero-knowledge proof; Computer science; Graph isomorphism; Lattice (music); Lattice problem; Equivalence (formal languages); Time complexity; Rational number; Discrete mathematics; Theoretical computer science; Graph; Mathematics; Algorithm; Cryptography","score_opus":0.041052607278986616,"score_gpt":0.28535220976825393,"score_spread":0.2442996024892673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398403423","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.01598642,0.0017402092,0.9307793,0.0026750637,0.00040268773,0.00015789358,0.00028468558,0.0013503815,0.04662336],"genre_scores_gemma":[0.5654421,0.0021681963,0.3892662,0.0008484158,0.001025856,0.0006101648,0.0008006788,0.0008985129,0.038939938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362755,0.002182028,0.00034433926,0.0007296952,0.0025037208,0.00061271887],"domain_scores_gemma":[0.97705007,0.016692517,0.00062844064,0.0036808443,0.0013455086,0.0006025423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052973856,0.0011412449,0.0014908584,0.0017248621,0.0027773872,0.007504484,0.00428306,0.0023026655,0.015476109],"category_scores_gemma":[0.018909436,0.0013274192,0.0020050167,0.0017983504,0.0062168688,0.014807887,0.007734312,0.010556174,0.003475566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005882873,0.000032638676,0.000049116315,0.00011189697,0.000015697202,0.000028804578,0.00022178241,0.0032656582,0.000498014,0.9781316,0.0029019394,0.014684031],"study_design_scores_gemma":[0.000036739388,0.000009886556,0.00001895432,0.000031997635,0.000011666219,0.000029378954,0.000018665301,0.016260654,0.0008759789,0.9778857,0.0048020356,0.000018288316],"about_ca_topic_score_codex":0.00056383305,"about_ca_topic_score_gemma":0.0007067234,"teacher_disagreement_score":0.015476109,"about_ca_system_score_codex":0.0037823766,"about_ca_system_score_gemma":0.002364255,"threshold_uncertainty_score":0.051772714},"labels":[],"label_agreement":null},{"id":"W2398465054","doi":"10.1007/978-3-319-28472-9_7","title":"Deterministic Rendezvous with Detection Using Beeps","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Node (physics); Logarithm; Mobile agent; Real-time computing; Integer (computer science); Computer network; Distributed computing; Algorithm; Mathematics; Operating system","score_opus":0.047112980001445294,"score_gpt":0.27870269572671186,"score_spread":0.23158971572526657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398465054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038019396,0.0003975655,0.9484428,0.00016945171,0.00016959688,0.00008055364,0.00011597711,0.0018184155,0.010786122],"genre_scores_gemma":[0.77760226,0.0001905128,0.20905957,0.00012294063,0.000043607837,0.00012516054,0.00015872887,0.0002491575,0.012448154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923253,0.000110474524,0.00003205743,0.00022175114,0.00027591005,0.00012737156],"domain_scores_gemma":[0.9987532,0.000645866,0.00008249954,0.0003533105,0.000111485904,0.0000536411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049322663,0.0008274,0.0010946781,0.00047818714,0.00079764036,0.0008906276,0.0016277094,0.0010863614,0.0035357482],"category_scores_gemma":[0.002775865,0.0006804924,0.00051792123,0.00055329764,0.000993061,0.001350542,0.002353778,0.0010099977,0.0009972412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012267751,0.000137041,0.0016771146,0.000326628,0.00013895344,0.00040844036,0.00022776771,0.54712087,0.062696606,0.085764386,0.0068832915,0.29339212],"study_design_scores_gemma":[0.00003786355,0.000068814894,0.00027119735,0.000017127926,0.000014458623,0.0001354523,0.000022681903,0.9629772,0.012033988,0.022013295,0.002376525,0.000031455224],"about_ca_topic_score_codex":0.0023868324,"about_ca_topic_score_gemma":0.0028378195,"teacher_disagreement_score":0.0035357482,"about_ca_system_score_codex":0.0005369344,"about_ca_system_score_gemma":0.0006424044,"threshold_uncertainty_score":0.011828244},"labels":[],"label_agreement":null},{"id":"W2398731595","doi":"10.1007/978-3-642-32512-0_39","title":"A Discrepancy Lower Bound for Information Complexity","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Toronto","funders":"","keywords":"Omega; Upper and lower bounds; Communication complexity; Combinatorics; Function (biology); Corollary; Binary logarithm; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.022587209215418395,"score_gpt":0.27325572793982056,"score_spread":0.25066851872440216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398731595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06780413,0.020783188,0.7133738,0.047602236,0.0033129097,0.00028460834,0.0033851995,0.0019301008,0.14152375],"genre_scores_gemma":[0.7282073,0.013293733,0.1780786,0.012092063,0.009001674,0.0015716491,0.0039364947,0.0026385563,0.051179923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.985908,0.0033817906,0.0004886321,0.0025429078,0.005664949,0.0020137208],"domain_scores_gemma":[0.8930738,0.08701688,0.0021243617,0.009830615,0.004218569,0.00373582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010615512,0.0039031345,0.0056540715,0.006351163,0.0035647966,0.009220502,0.010039981,0.008541067,0.020280607],"category_scores_gemma":[0.08310652,0.0025105618,0.0044726077,0.007978248,0.009378137,0.028722743,0.014412764,0.024841862,0.004157535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070211955,0.00025210486,0.0012885905,0.00066095736,0.00010539504,0.000144848,0.0003707253,0.033085935,0.0024163008,0.89685774,0.026690269,0.03742492],"study_design_scores_gemma":[0.0000679904,0.00007323573,0.00047789086,0.00014368688,0.000058826867,0.00014552377,0.000044775494,0.088727765,0.00080133247,0.90263045,0.0067761834,0.000052310523],"about_ca_topic_score_codex":0.002113678,"about_ca_topic_score_gemma":0.0013825531,"teacher_disagreement_score":0.020280607,"about_ca_system_score_codex":0.011808529,"about_ca_system_score_gemma":0.0038840245,"threshold_uncertainty_score":0.085677266},"labels":[],"label_agreement":null},{"id":"W2398989400","doi":"10.1007/978-3-319-29078-2_1","title":"Meet-in-the-Middle Attacks on Reduced Round Piccolo","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Arithmetic; Slide attack; Algorithm; Cryptography; Stream cipher attack; Mathematics","score_opus":0.04241792472172777,"score_gpt":0.28906257466779683,"score_spread":0.24664464994606905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398989400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15024978,0.0013126004,0.5414705,0.004240148,0.00085213245,0.0004526807,0.0005322373,0.0053681624,0.29552168],"genre_scores_gemma":[0.8949714,0.0005295785,0.05406589,0.00061949965,0.00020021462,0.00029701166,0.0003869088,0.00062086416,0.04830852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967411,0.000734787,0.00009608921,0.00039464093,0.001237368,0.0007959245],"domain_scores_gemma":[0.99673516,0.001035368,0.00015892077,0.0016747819,0.00023993987,0.0001559378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011812306,0.0012344263,0.0015421779,0.0013959057,0.0024721068,0.0032219437,0.0017798734,0.0021990228,0.012701211],"category_scores_gemma":[0.006274232,0.00062602677,0.0011659291,0.0011259093,0.0030980795,0.005269791,0.0065654935,0.0033770904,0.0050546792],"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.001431699,0.00011883999,0.0006191018,0.00017630438,0.00007990769,0.00032164573,0.00052269036,0.020967714,0.008344458,0.8513029,0.02147456,0.0946402],"study_design_scores_gemma":[0.0001354411,0.00017432444,0.00041804108,0.00009796647,0.00008753128,0.00044409637,0.00017676411,0.16206524,0.017796488,0.77245957,0.04605519,0.0000893437],"about_ca_topic_score_codex":0.00088068633,"about_ca_topic_score_gemma":0.00084442674,"teacher_disagreement_score":0.012701211,"about_ca_system_score_codex":0.0016959673,"about_ca_system_score_gemma":0.0013615257,"threshold_uncertainty_score":0.042489767},"labels":[],"label_agreement":null},{"id":"W2399039179","doi":"10.1007/978-3-319-19773-9_113","title":"Supporting Students’ Interactions over Case Studies","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 Saskatchewan","funders":"","keywords":"Computer science; Class (philosophy); Mathematics education; Human–computer interaction; Artificial intelligence; Psychology","score_opus":0.06532796925036231,"score_gpt":0.3699387865124337,"score_spread":0.3046108172620714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399039179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3708089,0.00096428586,0.50162107,0.0028426177,0.00034121025,0.0016678583,0.001199389,0.013013944,0.10754072],"genre_scores_gemma":[0.7234897,0.00050825556,0.25728577,0.00020483597,0.00008819772,0.00053875044,0.0017516348,0.00055237353,0.01558041],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99450547,0.0030533858,0.0003846643,0.0007647614,0.001012512,0.00027926246],"domain_scores_gemma":[0.93645936,0.050180692,0.0024028125,0.005198841,0.003053619,0.002704678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049953754,0.001107129,0.00048285295,0.002002691,0.00091592956,0.0050326358,0.0028353487,0.0016912429,0.01835261],"category_scores_gemma":[0.04684381,0.00047610744,0.00045231826,0.0011572356,0.0005632908,0.0043111253,0.0043721683,0.001311315,0.0049260645],"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.00083738397,0.0025825952,0.012465841,0.00082799204,0.000070923335,0.0016236502,0.018164527,0.0056349225,0.025254175,0.0098225605,0.021204658,0.9015108],"study_design_scores_gemma":[0.000988857,0.0035616339,0.043042704,0.0038692616,0.00044654493,0.008569715,0.03619612,0.22522165,0.1040402,0.09370775,0.4798065,0.00054905436],"about_ca_topic_score_codex":0.0003895298,"about_ca_topic_score_gemma":0.00081173907,"teacher_disagreement_score":0.01835261,"about_ca_system_score_codex":0.00060942693,"about_ca_system_score_gemma":0.0010761177,"threshold_uncertainty_score":0.061395586},"labels":[],"label_agreement":null},{"id":"W2399232315","doi":"10.1007/978-3-319-69453-5_30","title":"Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Discrete logarithm; Finite field; Embedding; Pairing; Reduction (mathematics); Degree (music); Mathematics; Field (mathematics); Computation; Computer science; Cryptography; Theoretical computer science; Logarithm; Position (finance); Discrete mathematics; Algorithm; Pure mathematics; Public-key cryptography; Artificial intelligence; Encryption; Mathematical analysis; Physics; Geometry; Computer security; Quantum mechanics","score_opus":0.0196497490266571,"score_gpt":0.27695938077669513,"score_spread":0.257309631750038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399232315","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.4557613,0.0008689115,0.42691293,0.0066009853,0.00062850496,0.0004641497,0.0012083924,0.0038972807,0.10365751],"genre_scores_gemma":[0.87895864,0.00027173778,0.10215283,0.00035690825,0.00019809241,0.00011431791,0.0006358695,0.00039362386,0.016917946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981446,0.0003606254,0.000085133615,0.0002920361,0.0007563936,0.0003611847],"domain_scores_gemma":[0.99855405,0.0006464125,0.00008580795,0.00042112876,0.00017967181,0.00011293601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093090616,0.0007985089,0.0012614923,0.0007696754,0.001747889,0.002470957,0.0008772723,0.0012676965,0.011448288],"category_scores_gemma":[0.0042529227,0.00037985883,0.0010575942,0.0012764874,0.0015435235,0.0031313656,0.0030694955,0.0028100275,0.00357532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018131702,0.0005687059,0.003979887,0.0008690796,0.0001909251,0.0020514014,0.0014644106,0.1320842,0.024043212,0.5198639,0.04647841,0.26659268],"study_design_scores_gemma":[0.00035884595,0.00038142985,0.00085847627,0.00011123762,0.00008144149,0.0009995764,0.00065223256,0.25211054,0.030074688,0.68157727,0.032698814,0.00009545841],"about_ca_topic_score_codex":0.0011278366,"about_ca_topic_score_gemma":0.0012105204,"teacher_disagreement_score":0.011448288,"about_ca_system_score_codex":0.0015008278,"about_ca_system_score_gemma":0.0024362854,"threshold_uncertainty_score":0.03829837},"labels":[],"label_agreement":null},{"id":"W2399294503","doi":"10.1007/978-3-319-19992-4_63","title":"Functional Nonlinear Mixed Effects Models for Longitudinal Image Data","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Center for Research Resources; National Center for Advancing Translational Sciences; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health","keywords":"Covariance operator; Computer science; Nonlinear system; Covariance; Functional data analysis; Artificial intelligence; Random effects model; Covariate; Algorithm; Machine learning; Data mining; Statistics; Mathematics","score_opus":0.1640109882639426,"score_gpt":0.38354205146568476,"score_spread":0.21953106320174218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399294503","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.0053645945,0.0010596284,0.99147207,0.00047114227,0.000116508956,0.00006809576,0.00069344696,0.00048837246,0.00026618774],"genre_scores_gemma":[0.27438384,0.0041397004,0.6927731,0.0005852839,0.00083953503,0.0025473787,0.00577514,0.0009589098,0.017997127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570763,0.0027191353,0.00020690866,0.00084154954,0.00027062418,0.00025413165],"domain_scores_gemma":[0.9801853,0.016141113,0.001020534,0.0013839591,0.0009706174,0.00029839823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013861262,0.0022412818,0.0028307107,0.0020014027,0.0008670412,0.0024064952,0.0050838604,0.0038519243,0.0064711403],"category_scores_gemma":[0.029755592,0.0027998376,0.004217316,0.0028078547,0.00173841,0.0030355353,0.00279399,0.0044434112,0.0019135544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013706641,0.00034814837,0.0069162147,0.00087296375,0.002431404,0.00058841694,0.0006332204,0.65199816,0.0032759157,0.1654305,0.008357375,0.15777707],"study_design_scores_gemma":[0.0000645027,0.000083974526,0.00085124205,0.000044268938,0.00017653467,0.00010577257,0.000026665104,0.9331301,0.0004102173,0.062136177,0.0029196779,0.00005078422],"about_ca_topic_score_codex":0.016791865,"about_ca_topic_score_gemma":0.023684371,"teacher_disagreement_score":0.016791865,"about_ca_system_score_codex":0.0020788694,"about_ca_system_score_gemma":0.0027592487,"threshold_uncertainty_score":0.07330626},"labels":[],"label_agreement":null},{"id":"W2399317185","doi":"10.1007/978-3-319-18615-3_38","title":"Human Inspired Control of a Small Humanoid Robot in Highly Dynamic Environments or Jimmy Darwin Rocks the Bongo Board","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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":"University of Manitoba","funders":"","keywords":"Humanoid robot; Computer science; Jitter; Controller (irrigation); Latency (audio); Dynamic balance; Robot; Control theory (sociology); Simulation; Control (management); Engineering; Artificial intelligence; Telecommunications","score_opus":0.015402959581416376,"score_gpt":0.21885808024710884,"score_spread":0.20345512066569246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399317185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18417516,0.004184594,0.69303364,0.001518854,0.0013157368,0.00008301615,0.000067092165,0.00086662953,0.11475527],"genre_scores_gemma":[0.8881978,0.0010332364,0.050514653,0.00019455323,0.00011438645,0.00007595534,0.00004180774,0.000086415756,0.05974131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999802,0.0000035201008,5.757443e-7,0.000004482565,0.000007707069,0.0000034667892],"domain_scores_gemma":[0.9999809,0.000006654485,0.0000017060461,0.000001944119,0.000003048133,0.0000057589987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009095986,0.00028300696,0.00018843652,0.00008036112,0.00023278315,0.00029139922,0.00027261453,0.0002885019,0.0030066876],"category_scores_gemma":[0.000113171445,0.00010484469,0.00016172181,0.00006230047,0.00050341425,0.00018247671,0.00028961888,0.00032263022,0.00022095094],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043368663,0.00007567406,0.00049524906,0.00032770293,0.0000775875,0.00051358144,0.0004727381,0.49355036,0.15835027,0.083792366,0.014278092,0.24763265],"study_design_scores_gemma":[0.00007398029,0.00055539387,0.0019515235,0.00008616916,0.00002949853,0.00018896341,0.00013283691,0.87543005,0.010929232,0.042574875,0.068004765,0.000042740223],"about_ca_topic_score_codex":0.0011815678,"about_ca_topic_score_gemma":0.001596971,"teacher_disagreement_score":0.0030066876,"about_ca_system_score_codex":0.00016115487,"about_ca_system_score_gemma":0.00015085914,"threshold_uncertainty_score":0.010058403},"labels":[],"label_agreement":null},{"id":"W2400145601","doi":"10.1007/978-3-319-32152-3_17","title":"Parallel Ant Brood Graph Partitioning in Julia","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Manitoba","funders":"","keywords":"Computer science; Thread (computing); Graph partition; Parallel computing; Scalability; Parallel algorithm; Algorithm; Theoretical computer science; Graph; Programming language","score_opus":0.016753000184757935,"score_gpt":0.24985534209783675,"score_spread":0.23310234191307883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400145601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0675645,0.00081513345,0.8611284,0.00053841976,0.00041828008,0.00034216113,0.00035547925,0.006968072,0.061869483],"genre_scores_gemma":[0.20554547,0.00029031557,0.76033473,0.00018401019,0.00006814126,0.00017608145,0.00064433255,0.0012253415,0.03153158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963164,0.00006439387,0.000017074137,0.00010648178,0.000114129056,0.00006626988],"domain_scores_gemma":[0.9996867,0.00008089611,0.000016995034,0.00010247342,0.00007791724,0.00003498323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039650922,0.00058092555,0.0009121525,0.0006734202,0.001083064,0.0011686021,0.0016103175,0.0006544309,0.009185271],"category_scores_gemma":[0.0008819208,0.0005488911,0.0009200178,0.00061314105,0.00046814865,0.0009338982,0.0013861847,0.0009568389,0.0022133633],"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.0008490115,0.0003572778,0.0010035807,0.00039602324,0.00016901945,0.0003585083,0.0004324105,0.33604392,0.033503465,0.069694325,0.024587216,0.5326053],"study_design_scores_gemma":[0.0000830164,0.00010244442,0.0004510475,0.000030387762,0.00005209058,0.00018096101,0.00010978385,0.94102496,0.009405954,0.02434146,0.024190716,0.000027213136],"about_ca_topic_score_codex":0.005838286,"about_ca_topic_score_gemma":0.014366155,"teacher_disagreement_score":0.009185271,"about_ca_system_score_codex":0.00078460993,"about_ca_system_score_gemma":0.0012097768,"threshold_uncertainty_score":0.030727863},"labels":[],"label_agreement":null},{"id":"W2400147605","doi":"10.1007/978-3-319-21470-2_52","title":"Efficient Combined Text and Spatial Search","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Full text search; Rank (graph theory); Combinatorics; Suffix; Tree (set theory); Information retrieval; String (physics); Data structure; Suffix array; Search engine; Mathematics","score_opus":0.02579766932172315,"score_gpt":0.25610899734912235,"score_spread":0.2303113280273992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400147605","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.04397358,0.0034165136,0.88949287,0.000663477,0.00059768965,0.0003055572,0.003862054,0.018085444,0.039602857],"genre_scores_gemma":[0.19067997,0.0012864983,0.7161057,0.00033836352,0.0003909891,0.0002880615,0.0074664727,0.0013029218,0.08214107],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889416,0.000122796,0.00007696009,0.00017610042,0.00058827375,0.00014183152],"domain_scores_gemma":[0.998288,0.0006568497,0.000066148874,0.00043389996,0.0004782413,0.000076813405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004685759,0.0012212959,0.0019640753,0.0027593565,0.0009328435,0.0018639624,0.002720918,0.0014571839,0.03595065],"category_scores_gemma":[0.003517134,0.00050860137,0.0010060798,0.005278682,0.0005129847,0.004495972,0.002683025,0.00065505516,0.014939743],"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.0007668358,0.00023154833,0.00043693813,0.00045739664,0.000079057245,0.00022061291,0.000108390675,0.01827806,0.029189732,0.01696966,0.048947696,0.8843141],"study_design_scores_gemma":[0.00033032463,0.0004452218,0.0011905134,0.00008702471,0.00023479403,0.0012845171,0.0003431336,0.8004153,0.065559074,0.061180014,0.06883767,0.0000924892],"about_ca_topic_score_codex":0.0050129546,"about_ca_topic_score_gemma":0.009953132,"teacher_disagreement_score":0.03595065,"about_ca_system_score_codex":0.0006160822,"about_ca_system_score_gemma":0.0016999277,"threshold_uncertainty_score":0.120266914},"labels":[],"label_agreement":null},{"id":"W2400334113","doi":"10.1007/978-3-319-27863-6_52","title":"On Calibration and Alignment of Point Clouds in a Network of RGB-D Sensors for Tracking","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Sensing Technologies","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Point cloud; Computer science; Computer vision; Merge (version control); Artificial intelligence; Video tracking; Representation (politics); RGB color model; Object (grammar); Information retrieval","score_opus":0.022602892850748492,"score_gpt":0.26427483840515376,"score_spread":0.24167194555440527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400334113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043716864,0.00074698566,0.9915684,0.00011029225,0.00010991916,0.00004831402,0.00007404522,0.00058814033,0.0023822787],"genre_scores_gemma":[0.18029031,0.0038504035,0.8070801,0.00020254802,0.00025591676,0.00017011806,0.001184963,0.00034090958,0.006624796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998248,0.0003348717,0.00011474442,0.00041863232,0.0007792001,0.00010462405],"domain_scores_gemma":[0.9986123,0.0005845172,0.00010593706,0.00037854904,0.0002858678,0.00003283721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012276325,0.0017460644,0.001304429,0.0013951755,0.0008812412,0.0018222487,0.0028045522,0.0019565327,0.0037647374],"category_scores_gemma":[0.005889243,0.0010384268,0.0011114643,0.004387181,0.0011155801,0.0032773083,0.003372499,0.0019066955,0.001840631],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013379777,0.000075110605,0.0011863626,0.00024413009,0.00008581729,0.00014086624,0.00019073092,0.30803078,0.012866897,0.02219535,0.007874602,0.6469755],"study_design_scores_gemma":[0.000015668955,0.000056331017,0.0017245562,0.00006826579,0.000033453543,0.00028137723,0.00009459418,0.94584817,0.011293878,0.031061145,0.009487792,0.00003492436],"about_ca_topic_score_codex":0.013350713,"about_ca_topic_score_gemma":0.012862967,"teacher_disagreement_score":0.013350713,"about_ca_system_score_codex":0.0010220162,"about_ca_system_score_gemma":0.0011538102,"threshold_uncertainty_score":0.026546001},"labels":[],"label_agreement":null},{"id":"W2400415486","doi":"10.1007/978-3-319-26350-2_54","title":"Absorption for ABoxes and TBoxes with General Value Restrictions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Value (mathematics); Range (aeronautics); Domain (mathematical analysis); Work (physics); Base (topology); Theoretical computer science; Mathematics; Machine learning; Physics; Thermodynamics","score_opus":0.02610433299061919,"score_gpt":0.2565385743376311,"score_spread":0.23043424134701193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400415486","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.01199791,0.0043004067,0.92912984,0.0021139514,0.0005688304,0.00012502067,0.00043035715,0.0011336153,0.050200094],"genre_scores_gemma":[0.26842716,0.005775717,0.66405016,0.0016498646,0.001061113,0.0005231181,0.0014404344,0.0011818614,0.055890538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980793,0.0005030888,0.00025091416,0.00046884496,0.00045083734,0.00024699632],"domain_scores_gemma":[0.9964977,0.0021350763,0.00016899584,0.0007356778,0.0003704532,0.00009208188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030101587,0.001167777,0.00097586773,0.0015078355,0.0015170556,0.0044531906,0.0017879503,0.0019101141,0.011035599],"category_scores_gemma":[0.006328829,0.0014951684,0.00251268,0.0019208485,0.0031191378,0.01469641,0.003595138,0.006854602,0.0032207477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036983376,0.00003293714,0.00013256361,0.00025242285,0.000023597979,0.00013423564,0.0004901268,0.000623797,0.0015744295,0.94606066,0.004319387,0.046318978],"study_design_scores_gemma":[0.000015280562,0.000016504984,0.000089602676,0.00012080459,0.000030114777,0.00024656288,0.00009693323,0.002724854,0.0013980294,0.97029436,0.024951493,0.000015337619],"about_ca_topic_score_codex":0.000979013,"about_ca_topic_score_gemma":0.0009557965,"teacher_disagreement_score":0.011035599,"about_ca_system_score_codex":0.0013963418,"about_ca_system_score_gemma":0.0012319455,"threshold_uncertainty_score":0.036917746},"labels":[],"label_agreement":null},{"id":"W2400572038","doi":"10.1007/978-3-319-42547-4_7","title":"Incorporating Quotation and Evaluation into Church’s Type Theory: Syntax and Semantics","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Syntax; Sketch; Lisp; Semantics (computer science); Programming language; Type (biology); Computer science; Type theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.026185291209873555,"score_gpt":0.2905985882110671,"score_spread":0.26441329700119354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400572038","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.009616837,0.0012440145,0.9446904,0.007758089,0.00097195274,0.00007969813,0.00031314633,0.0010111429,0.034314677],"genre_scores_gemma":[0.5337609,0.0015619111,0.4376397,0.0020409557,0.0013846505,0.00027681308,0.00046204843,0.0022598528,0.020613272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98987144,0.005390664,0.00081213604,0.001275812,0.0020417878,0.000608209],"domain_scores_gemma":[0.9845233,0.0078358445,0.0007595633,0.0033771875,0.0031007489,0.00040335426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013935154,0.00086534047,0.0019505677,0.0032593296,0.004478314,0.010833405,0.0033025779,0.0032634202,0.010718596],"category_scores_gemma":[0.023585102,0.0022274093,0.0024137408,0.005581407,0.012212775,0.030728355,0.006610816,0.0057647927,0.002569368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011745473,0.00000608577,0.000091679896,0.00003937305,0.000005658697,0.000018840372,0.0005140286,0.00025475334,0.00013509169,0.99183625,0.0010386069,0.006047966],"study_design_scores_gemma":[0.000010683163,0.000005643295,0.000054702254,0.000039622948,0.000015823904,0.00003457742,0.00011505775,0.0031356877,0.0005025305,0.98343486,0.012627533,0.000023343322],"about_ca_topic_score_codex":0.004536842,"about_ca_topic_score_gemma":0.004398304,"teacher_disagreement_score":0.013935154,"about_ca_system_score_codex":0.0037844686,"about_ca_system_score_gemma":0.0031810105,"threshold_uncertainty_score":0.07369697},"labels":[],"label_agreement":null},{"id":"W2400880491","doi":"10.1007/978-3-662-48971-0_53","title":"Constant Query Time $$(1+\\epsilon )$$ -Approximate Distance Oracle for Planar Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Oracle; Binary logarithm; Time complexity; Graph; Constant (computer programming); Mathematics; Physics; Computer science","score_opus":0.03021250463092352,"score_gpt":0.25719653106098656,"score_spread":0.22698402643006305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400880491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116592735,0.008329487,0.6957428,0.01734517,0.0017435701,0.0006740196,0.012112301,0.022322714,0.12513715],"genre_scores_gemma":[0.54763687,0.0038424002,0.36129922,0.0027825017,0.0012982016,0.00068920146,0.013329065,0.0040138913,0.06510863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925936,0.0010511122,0.00042625857,0.0019590221,0.0025948868,0.0013751565],"domain_scores_gemma":[0.9847247,0.007285635,0.00055012037,0.0058833263,0.0010109469,0.0005452462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541794,0.0026341996,0.0042912997,0.0015396813,0.0019762348,0.006127036,0.009228534,0.003957134,0.04665676],"category_scores_gemma":[0.015352202,0.0012208284,0.0029309148,0.005690419,0.0026105386,0.020531872,0.0068595014,0.007996319,0.01308417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004118911,0.0009881606,0.0024029287,0.0027079023,0.00038489306,0.00027682015,0.0005172752,0.08725421,0.023855148,0.21419778,0.15276942,0.51052654],"study_design_scores_gemma":[0.00083176524,0.00037694172,0.0021464543,0.0002543305,0.0005437696,0.0010860644,0.00051154115,0.3592296,0.021292837,0.5666759,0.046866473,0.00018434634],"about_ca_topic_score_codex":0.0058035883,"about_ca_topic_score_gemma":0.009225731,"teacher_disagreement_score":0.04665676,"about_ca_system_score_codex":0.006720175,"about_ca_system_score_gemma":0.0050997627,"threshold_uncertainty_score":0.15608239},"labels":[],"label_agreement":null},{"id":"W2401115624","doi":"10.1007/978-3-642-54756-0","title":"Transactions on Rough Sets XVII","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Rough set; Computer science; Set theory; Set (abstract data type); Dominance-based rough set approach; Theoretical computer science; Algebra over a field; Data mining; Mathematics; Pure mathematics; Programming language","score_opus":0.01570651040765122,"score_gpt":0.24236136700408442,"score_spread":0.2266548565964332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401115624","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057871826,0.2289259,0.52632314,0.00562743,0.027923021,0.00012435032,0.0012776582,0.00088306627,0.20312832],"genre_scores_gemma":[0.13955516,0.21454728,0.2751519,0.0014640973,0.015772238,0.0004350835,0.0029275438,0.00085998286,0.3492867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986753,0.00023443734,0.00014377877,0.00011599183,0.00078469364,0.00004577835],"domain_scores_gemma":[0.9990025,0.00036385222,0.000066896915,0.00023639337,0.00029193467,0.000038470473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010741092,0.0011552233,0.0024179514,0.001936151,0.0004928161,0.0029989933,0.0007414769,0.0006933071,0.016053097],"category_scores_gemma":[0.0030910552,0.00057796424,0.0011599405,0.003420766,0.00089498266,0.0018347141,0.0011299256,0.0019704078,0.008311253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006405146,0.000040210758,0.00032900085,0.0010771743,0.00019985632,0.00017679106,0.0002772771,0.010872509,0.0021691653,0.32650575,0.15704185,0.5012464],"study_design_scores_gemma":[0.000018098539,0.00006100543,0.0010733957,0.0004997841,0.0001187807,0.0004296509,0.00014023455,0.019736048,0.0009097844,0.3855565,0.5914136,0.000043110653],"about_ca_topic_score_codex":0.0006177459,"about_ca_topic_score_gemma":0.00054560805,"teacher_disagreement_score":0.016053097,"about_ca_system_score_codex":0.0009028362,"about_ca_system_score_gemma":0.0006678429,"threshold_uncertainty_score":0.05370301},"labels":[],"label_agreement":null},{"id":"W2402414467","doi":"10.1007/978-3-319-25645-0_28","title":"New Message Authentication Code Based on APN Functions and Stream Ciphers","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","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":"Computer science; Message authentication code; Code (set theory); Authentication (law); Data Authentication Algorithm; Stream cipher attack; CBC-MAC; Stream cipher; Bounded function; Authentication protocol; Computer network; Theoretical computer science; Computer security; Cryptography; Programming language; Mathematics","score_opus":0.023151834648561607,"score_gpt":0.2530836571570288,"score_spread":0.2299318225084672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402414467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025035461,0.0022144485,0.94526726,0.00035804938,0.0015129257,0.00027637705,0.0001671822,0.0034129277,0.021755299],"genre_scores_gemma":[0.4163269,0.0021909429,0.5111137,0.00070149155,0.0010034885,0.00073277147,0.0007814644,0.0007933661,0.06635592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923265,0.00013125158,0.00006895561,0.00011884208,0.00035829167,0.00008996982],"domain_scores_gemma":[0.99902344,0.00022055877,0.00009953505,0.00020695466,0.00039613745,0.000053370182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089227,0.0008368185,0.00077360385,0.0013547726,0.0007433872,0.001080322,0.0008498819,0.00097259774,0.004904102],"category_scores_gemma":[0.0015475655,0.00031875778,0.00055857573,0.0008950278,0.0008790814,0.0024183607,0.0011825574,0.0019418944,0.0027296203],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014081971,0.00020248027,0.00063023745,0.0007569498,0.000086832035,0.0006921029,0.00027406838,0.010865416,0.17243649,0.30334342,0.017729066,0.4915748],"study_design_scores_gemma":[0.00031278186,0.0012550016,0.0017198967,0.00038244555,0.00024317206,0.004934467,0.00007478261,0.29869592,0.32202893,0.09512794,0.2749461,0.00027864348],"about_ca_topic_score_codex":0.0003084386,"about_ca_topic_score_gemma":0.00028411677,"teacher_disagreement_score":0.004904102,"about_ca_system_score_codex":0.0006888782,"about_ca_system_score_gemma":0.000936982,"threshold_uncertainty_score":0.01640582},"labels":[],"label_agreement":null},{"id":"W240282271","doi":"10.1007/978-3-319-17127-2_20","title":"Online Privacy: Risks, Challenges, and New Trends","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"Université de Montréal","funders":"","keywords":"Computer science; Information privacy; Internet privacy; Computer security","score_opus":0.12904019994286162,"score_gpt":0.3445373297535187,"score_spread":0.21549712981065708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W240282271","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009663065,0.370325,0.076793544,0.32153127,0.005025935,0.000058980837,0.0002679452,0.0004056101,0.21592866],"genre_scores_gemma":[0.2627735,0.52227825,0.047599636,0.04828804,0.02085838,0.00018517012,0.00050487625,0.00044826194,0.097063914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959674,0.0013637316,0.00016048538,0.0003681647,0.0018444927,0.00029570723],"domain_scores_gemma":[0.9876373,0.008652523,0.0004897126,0.0012748793,0.0012837392,0.00066186115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007486028,0.00063775416,0.0007225333,0.0016156319,0.0016535508,0.01274496,0.0019149364,0.0051871585,0.009811786],"category_scores_gemma":[0.010505967,0.0005080025,0.0007203807,0.0029564686,0.0072542946,0.028532807,0.0038836554,0.010362923,0.0022492465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030283041,0.000065404136,0.0008163686,0.0003875378,0.000015895721,0.00011770937,0.00079263264,0.00046928105,0.00029222574,0.703559,0.057975635,0.23547804],"study_design_scores_gemma":[0.000007326079,0.000040167437,0.0005344439,0.0015361408,0.000016050657,0.00090502016,0.0014992139,0.0019831469,0.0004695118,0.5641724,0.42880836,0.000028211341],"about_ca_topic_score_codex":0.0010982209,"about_ca_topic_score_gemma":0.0015944738,"teacher_disagreement_score":0.01274496,"about_ca_system_score_codex":0.0022926333,"about_ca_system_score_gemma":0.002927272,"threshold_uncertainty_score":0.03959036},"labels":[],"label_agreement":null},{"id":"W2402986172","doi":"10.1007/978-3-319-26561-2_43","title":"Ontology-based Information Extraction for Residential Land Use Suitability: A Case Study of the City of Regina, Canada","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Regina","funders":"","keywords":"Ontology; Computer science; Information extraction; Set (abstract data type); Identification (biology); Data mining; Information retrieval; Geographic information system; Cartography; Geography","score_opus":0.0481097363177739,"score_gpt":0.30098332897153995,"score_spread":0.2528735926537661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402986172","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.63475394,0.0030894952,0.22183564,0.0044728005,0.000103194834,0.0018511276,0.033605948,0.0024711601,0.09781666],"genre_scores_gemma":[0.67472684,0.002282497,0.2826422,0.00023278059,0.000012056791,0.00025477473,0.023291657,0.0003580589,0.016199134],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993105,0.00011316306,0.000052100277,0.00009447314,0.00032043745,0.00010935637],"domain_scores_gemma":[0.998934,0.00044162458,0.000044343484,0.000074840944,0.0004623117,0.000042930264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009148385,0.00052204914,0.0004129199,0.004912953,0.0024478878,0.0025366214,0.0010886551,0.0005571667,0.0024526417],"category_scores_gemma":[0.002409337,0.00021787283,0.0009726264,0.0080415895,0.00082782074,0.0011332203,0.0014949527,0.0004549725,0.0005335212],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019197329,0.00044451785,0.09022471,0.0024645245,0.00029976328,0.0052037598,0.026231816,0.025550434,0.020605795,0.026373263,0.049885023,0.75252444],"study_design_scores_gemma":[0.00007595103,0.00009391517,0.2477013,0.0016292175,0.0008685295,0.00288939,0.08831644,0.17225839,0.03048012,0.022558503,0.43284765,0.00028060842],"about_ca_topic_score_codex":0.82743573,"about_ca_topic_score_gemma":0.9167177,"teacher_disagreement_score":0.17256427,"about_ca_system_score_codex":0.006492894,"about_ca_system_score_gemma":0.01613792,"threshold_uncertainty_score":0.34716105},"labels":[],"label_agreement":null},{"id":"W2403530833","doi":"10.1007/978-3-319-29221-2_23","title":"Medians of Permutations: Building Constraints","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.022009729105714134,"score_gpt":0.29823651536144885,"score_spread":0.2762267862557347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403530833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011311559,0.0008214287,0.9229705,0.0009090401,0.00020451738,0.000103867395,0.0009932892,0.00045397552,0.06223177],"genre_scores_gemma":[0.21028908,0.0029518534,0.7350531,0.0005011369,0.00052636274,0.0007185705,0.0036022926,0.0013585915,0.044999007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974607,0.00081300223,0.000195521,0.00054845656,0.00078040623,0.00020196005],"domain_scores_gemma":[0.99404824,0.0038824969,0.00035327836,0.00093299075,0.0005295068,0.00025356468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021279429,0.0011457589,0.0017631021,0.0015882682,0.0014257751,0.0042794435,0.0032252653,0.0017393187,0.023091635],"category_scores_gemma":[0.012147982,0.0017216114,0.0017586773,0.003706332,0.0020436603,0.00919544,0.0043425984,0.0047350903,0.0039951443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006295891,0.000031722222,0.00020904826,0.00024138899,0.000020433765,0.000060074675,0.00015940421,0.026276752,0.00063066935,0.87440664,0.010132436,0.08776853],"study_design_scores_gemma":[0.000012163893,0.000015317588,0.00005940135,0.000057031713,0.000009614304,0.000049836395,0.00005321104,0.033039425,0.0006020703,0.9482331,0.017857626,0.000011056387],"about_ca_topic_score_codex":0.0015021411,"about_ca_topic_score_gemma":0.0022566067,"teacher_disagreement_score":0.023091635,"about_ca_system_score_codex":0.0013386765,"about_ca_system_score_gemma":0.0015312626,"threshold_uncertainty_score":0.07724923},"labels":[],"label_agreement":null},{"id":"W2403599882","doi":"10.1007/978-3-319-24571-3_39","title":"Crossing-Lines Registration for Direct Electromagnetic Navigation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"Fiducial marker; Computer vision; Orientation (vector space); Computer science; Artificial intelligence; Tracking (education); Image registration; Image-guided surgery; Medical physics; Medicine; Image (mathematics); Mathematics","score_opus":0.049853247548067615,"score_gpt":0.3269066331049954,"score_spread":0.27705338555692777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403599882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012342705,0.00031675692,0.9876204,0.00003850911,0.00016883377,0.000033234624,0.00006852498,0.001619914,0.008899503],"genre_scores_gemma":[0.04824563,0.0009878537,0.91419464,0.000094152805,0.00013125,0.000090969115,0.00079086726,0.0012366339,0.034228083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934024,0.00009995354,0.000034753804,0.00016470833,0.00031168727,0.000048705428],"domain_scores_gemma":[0.99953365,0.00011962826,0.000029518045,0.0001915397,0.00010632887,0.000019401117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006086421,0.0010616902,0.00065796054,0.00081528944,0.0003938644,0.0015240178,0.0016073297,0.0011353964,0.017319366],"category_scores_gemma":[0.0015864772,0.0005760704,0.00082760944,0.0012645586,0.0006323635,0.0015984921,0.0019573243,0.0018506602,0.0126815],"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.00015763749,0.000057575475,0.00026419634,0.00027699347,0.000033427164,0.00021458538,0.00018864541,0.019100321,0.036934044,0.06900718,0.024382219,0.8493831],"study_design_scores_gemma":[0.000054701726,0.00029299626,0.0012654802,0.00020810892,0.00009654347,0.0040316083,0.00017882563,0.4394222,0.11605301,0.062160034,0.37608546,0.00015103487],"about_ca_topic_score_codex":0.0009241878,"about_ca_topic_score_gemma":0.0012609739,"teacher_disagreement_score":0.017319366,"about_ca_system_score_codex":0.0003310412,"about_ca_system_score_gemma":0.0007841072,"threshold_uncertainty_score":0.057938993},"labels":[],"label_agreement":null},{"id":"W2403669625","doi":"10.1007/978-3-319-18615-3_23","title":"An Event-Driven Operating System for Servomotor Control","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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 Manitoba","funders":"","keywords":"Servomotor; Firmware; Microcontroller; Computer science; Control engineering; Humanoid robot; Polling; Event (particle physics); Servo; DC motor; Motor controller; Embedded system; Robot; Control system; Computer hardware; Engineering; Artificial intelligence; Operating system; Electrical engineering","score_opus":0.036114407392563816,"score_gpt":0.28297436819850696,"score_spread":0.24685996080594313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403669625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024603954,0.00038362053,0.9163499,0.000085773165,0.00023048892,0.00021315158,0.0003832108,0.049287796,0.008462065],"genre_scores_gemma":[0.59198034,0.00053482054,0.36953112,0.00047118368,0.00017993039,0.00057765713,0.0012912336,0.0033769172,0.032056853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.0000412174,0.000034262313,0.00008452698,0.0001456531,0.00004024525],"domain_scores_gemma":[0.9995586,0.0001718732,0.000033382687,0.00009648975,0.00009455059,0.00004510358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004507962,0.0007279679,0.0004808352,0.00037876316,0.00027686942,0.00085367175,0.0016762097,0.00067527924,0.012171071],"category_scores_gemma":[0.0010239015,0.00031276906,0.00029345788,0.00022484043,0.00026605875,0.00084337534,0.00078886334,0.0009016598,0.002930168],"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.0019689763,0.0004883803,0.0014689227,0.000581453,0.000091097,0.00080892444,0.0004604348,0.02355708,0.22547,0.01966332,0.027747251,0.6976941],"study_design_scores_gemma":[0.00038789978,0.000960569,0.002666811,0.00016425751,0.00015807853,0.0013574496,0.00008613092,0.6338632,0.22619519,0.019067576,0.11493084,0.00016205458],"about_ca_topic_score_codex":0.00053873734,"about_ca_topic_score_gemma":0.00050537323,"teacher_disagreement_score":0.012171071,"about_ca_system_score_codex":0.0002128358,"about_ca_system_score_gemma":0.00035959555,"threshold_uncertainty_score":0.04071623},"labels":[],"label_agreement":null},{"id":"W2404302917","doi":"10.1007/978-3-642-39094-4_81","title":"Chinese Character Recognition by Krawtchouk Moment Features","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Winnipeg","funders":"","keywords":"Moment (physics); Character (mathematics); Computer science; Feature (linguistics); Pattern recognition (psychology); Set (abstract data type); Artificial intelligence; Image moment; Character recognition; Algorithm; Mathematics; Image (mathematics); Image processing; Linguistics; Physics; Geometry","score_opus":0.013011743869470762,"score_gpt":0.2485811686802404,"score_spread":0.23556942481076965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404302917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30768663,0.0027594347,0.6653953,0.00024219631,0.00043001949,0.00013047227,0.0012077068,0.0039668255,0.01818132],"genre_scores_gemma":[0.8234674,0.0017993185,0.15265702,0.00006202787,0.00018917515,0.000080590806,0.0020887994,0.00031647025,0.019339308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998658,0.000010755145,0.000010565847,0.000034008783,0.000054193,0.000024601522],"domain_scores_gemma":[0.99986935,0.000022616865,0.000021230862,0.000024116227,0.000048731916,0.000013963751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008874407,0.00052952796,0.00045270278,0.0017965381,0.0003078672,0.00047802972,0.0003418742,0.0002683462,0.003531969],"category_scores_gemma":[0.00037241148,0.00016715392,0.00042663363,0.0021959427,0.00021447284,0.00090835034,0.0003469182,0.0003082499,0.0017843924],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030708112,0.000041422634,0.0016392511,0.00022584513,0.00003260584,0.00034210342,0.000094270785,0.0055672247,0.1984965,0.004394388,0.0065439236,0.7823154],"study_design_scores_gemma":[0.00004356463,0.00048042534,0.0412252,0.0000839385,0.00030359993,0.0030825494,0.00033208614,0.59879786,0.2983015,0.006210624,0.050931465,0.00020724814],"about_ca_topic_score_codex":0.0020249758,"about_ca_topic_score_gemma":0.0025724666,"teacher_disagreement_score":0.003531969,"about_ca_system_score_codex":0.0001601483,"about_ca_system_score_gemma":0.00025770502,"threshold_uncertainty_score":0.011815608},"labels":[],"label_agreement":null},{"id":"W2404387744","doi":"10.1007/978-3-319-19941-2_48","title":"Consensus-Based Prediction of RNA and DNA Binding Residues from Protein Sequences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Computer science; Support vector machine; Machine learning; Similarity (geometry); Artificial intelligence; Set (abstract data type); Naive Bayes classifier; Simple (philosophy); Binary classification; Sequence (biology); RNA; Bayes' theorem; Margin (machine learning); Data mining; Bayesian probability; Biology; Genetics; Gene","score_opus":0.025102181444558086,"score_gpt":0.24382710427226448,"score_spread":0.2187249228277064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404387744","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.33084533,0.0031693468,0.63724554,0.00017425699,0.00021780338,0.0003227332,0.009467884,0.012096115,0.0064609987],"genre_scores_gemma":[0.452787,0.001250475,0.510215,0.00014434163,0.00006848232,0.00026337957,0.030028785,0.0010459594,0.0041965446],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973506,0.00004129152,0.000023734781,0.000093344745,0.00007388883,0.000032681888],"domain_scores_gemma":[0.99943036,0.00021880397,0.000053349424,0.0000638414,0.00017717712,0.00005648757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040910058,0.0009886096,0.001147266,0.0012111922,0.00038574444,0.00046363883,0.0011062435,0.0006747967,0.0036189435],"category_scores_gemma":[0.0010387542,0.00045089505,0.0009987002,0.0011676342,0.00022406914,0.00049432233,0.00042337045,0.0008964826,0.003227909],"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.0026993132,0.0004094448,0.005696053,0.001419402,0.00028053936,0.0012203857,0.000117713695,0.07350934,0.5647729,0.004195641,0.016746858,0.32893246],"study_design_scores_gemma":[0.00020946772,0.00053236523,0.005780082,0.00009838838,0.0002962858,0.0009213494,0.000118000666,0.7638945,0.20715909,0.009706406,0.011195544,0.00008853659],"about_ca_topic_score_codex":0.0019646194,"about_ca_topic_score_gemma":0.003644226,"teacher_disagreement_score":0.0036189435,"about_ca_system_score_codex":0.00035587518,"about_ca_system_score_gemma":0.000733121,"threshold_uncertainty_score":0.012106597},"labels":[],"label_agreement":null},{"id":"W2404602184","doi":"10.1007/978-3-319-24553-9_82","title":"Direct and Simultaneous Four-Chamber Volume Estimation by Multi-Output Regression","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CARE Canada; London Health Sciences Centre; St Joseph's Health Care; Western University","funders":"","keywords":"Discriminative model; Segmentation; Artificial intelligence; Computer science; Pattern recognition (psychology); Lasso (programming language); Mathematics","score_opus":0.029372672749977957,"score_gpt":0.2914831438326214,"score_spread":0.26211047108264346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404602184","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.009510902,0.00028387102,0.9882967,0.00006285614,0.00003559398,0.000016244348,0.000100682926,0.00071401015,0.0009791418],"genre_scores_gemma":[0.23633581,0.0005834325,0.7541324,0.00008846539,0.00009955875,0.000072471914,0.0005131499,0.00044871456,0.007726096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992594,0.0001521757,0.000029202103,0.00020552566,0.0002759567,0.00007764017],"domain_scores_gemma":[0.9991285,0.0004640046,0.00007083671,0.00013274096,0.00017164367,0.000032219992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076031627,0.0011415428,0.0011686478,0.0006390066,0.00030678924,0.00131126,0.001297484,0.0014154986,0.0036559033],"category_scores_gemma":[0.002663399,0.0009989953,0.0012035794,0.00094696204,0.00039850187,0.001477708,0.0017781046,0.0013887006,0.0017710186],"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.0006213017,0.00014236788,0.003055069,0.00049207563,0.0002788877,0.00026423347,0.00022023612,0.14363872,0.18525593,0.0067903786,0.0032786857,0.6559621],"study_design_scores_gemma":[0.00001848924,0.000069731504,0.0025916465,0.000025805602,0.00006134184,0.00035028422,0.000031008272,0.95015997,0.040384922,0.0030213688,0.003242292,0.000043088592],"about_ca_topic_score_codex":0.0016386698,"about_ca_topic_score_gemma":0.0029766806,"teacher_disagreement_score":0.0036559033,"about_ca_system_score_codex":0.00026114972,"about_ca_system_score_gemma":0.0005620734,"threshold_uncertainty_score":0.012230217},"labels":[],"label_agreement":null},{"id":"W2404774344","doi":"10.1007/978-3-319-27677-9_15","title":"Modification of Polyp Size and Shape from Two Endoscope Images Using RBF Neural Network","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Artificial neural network; Computer science; Artificial intelligence; Point (geometry); Projection (relational algebra); Radial basis function; Computer vision; Mathematics; Geometry; Algorithm","score_opus":0.04571905883925296,"score_gpt":0.3148918077867552,"score_spread":0.2691727489475022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404774344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26001108,0.0012365979,0.7329362,0.00039368207,0.00023481189,0.00011550425,0.00028346365,0.002034182,0.0027544657],"genre_scores_gemma":[0.6901879,0.00084266625,0.30513847,0.00014819262,0.00006768544,0.00007160832,0.00025610995,0.00028324872,0.0030040964],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998492,0.000023143339,0.000009665481,0.000038158298,0.00006528598,0.000014466402],"domain_scores_gemma":[0.9994797,0.00018407029,0.00006118616,0.00006704162,0.0001849053,0.000023062159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037446615,0.00054661714,0.00041719823,0.00047855472,0.00012366314,0.00041520118,0.00033202133,0.0008059139,0.0014738567],"category_scores_gemma":[0.0013893003,0.0002706755,0.0005190513,0.00034795265,0.00018797244,0.000603882,0.00035827985,0.0004957476,0.00033337538],"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.0013796523,0.00011619954,0.0035148887,0.0005662177,0.00008807488,0.0004706566,0.00019547348,0.026238682,0.5028594,0.00048191947,0.0016852065,0.46240368],"study_design_scores_gemma":[0.000076373355,0.00053093815,0.028715804,0.00007447608,0.0002157451,0.0018983332,0.00012920081,0.7020724,0.2617604,0.0007115844,0.0036380258,0.00017666159],"about_ca_topic_score_codex":0.00085851725,"about_ca_topic_score_gemma":0.0011884272,"teacher_disagreement_score":0.0014738567,"about_ca_system_score_codex":0.00019566034,"about_ca_system_score_gemma":0.00022586017,"threshold_uncertainty_score":0.004930496},"labels":[],"label_agreement":null},{"id":"W2404992578","doi":"10.1007/978-3-319-27857-5_71","title":"Aperio: A System for Visualizing 3D Anatomy Data Using Virtual Mechanical Tools","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer graphics (images); Rendering (computer graphics); Visualization; Human–computer interaction; Computer vision; Artificial intelligence","score_opus":0.10676853597574758,"score_gpt":0.36217202540951243,"score_spread":0.25540348943376484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404992578","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.0059652175,0.0006697293,0.88857806,0.00020201279,0.00022298764,0.0002678341,0.0039352495,0.08463529,0.015523618],"genre_scores_gemma":[0.061253212,0.0019986103,0.84966266,0.00039034875,0.00017308797,0.00084761775,0.009668995,0.036116734,0.039888736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952674,0.000051682844,0.000041821168,0.000071303075,0.0002668685,0.000041565097],"domain_scores_gemma":[0.9989256,0.00055100257,0.000048937804,0.00020245582,0.00016935234,0.000102557155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089899835,0.0020800538,0.0009936653,0.0028881554,0.0005484181,0.0027241844,0.0026546095,0.0013353735,0.083240815],"category_scores_gemma":[0.0023798745,0.0015075922,0.0016947557,0.0013781558,0.00053008925,0.0020977168,0.0033708743,0.0014141593,0.01486249],"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.0008109219,0.00014481504,0.0017612464,0.0020486948,0.0002586985,0.0007095264,0.0010789544,0.010535564,0.090448864,0.015379704,0.1653959,0.71142715],"study_design_scores_gemma":[0.00059968565,0.00033182916,0.006416605,0.00068558916,0.00042446388,0.005242747,0.0003651748,0.162982,0.09276531,0.027752554,0.7018667,0.000567404],"about_ca_topic_score_codex":0.0012839864,"about_ca_topic_score_gemma":0.002171744,"teacher_disagreement_score":0.083240815,"about_ca_system_score_codex":0.00030453605,"about_ca_system_score_gemma":0.0009091318,"threshold_uncertainty_score":0.27846825},"labels":[],"label_agreement":null},{"id":"W2405894551","doi":"10.1007/978-3-319-30000-9_17","title":"Parallelogram Morphisms and Circular Codes","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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":"Université du Québec à Montréal","funders":"","keywords":"Parallelogram; Polyomino; Morphism; Conjecture; Mathematics; Combinatorics; Combinatorics on words; Discrete mathematics; Topology (electrical circuits); Computer science; Geometry; Artificial intelligence","score_opus":0.009193571575240474,"score_gpt":0.1955154666855668,"score_spread":0.18632189511032632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405894551","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.0764422,0.010187102,0.30359125,0.0020881079,0.0024834203,0.00010553474,0.0003418422,0.0006808927,0.6040796],"genre_scores_gemma":[0.5468569,0.0125273,0.10829414,0.000839415,0.0022399607,0.00022579044,0.0005652233,0.00079241564,0.32765895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.000075959586,0.000019470956,0.00008613704,0.00015866011,0.000052148935],"domain_scores_gemma":[0.9993476,0.00023804374,0.00007145597,0.00015119673,0.00013948728,0.00005212721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032421292,0.00056892476,0.00041491768,0.0016965896,0.0012651272,0.0019650094,0.0004997515,0.00096000254,0.010078263],"category_scores_gemma":[0.0016678046,0.00046247087,0.00045797596,0.0021330928,0.002478236,0.0029618598,0.0016841392,0.002141495,0.002452722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009606383,0.0000052898163,0.00002474788,0.000026567925,0.0000014756615,0.000032514876,0.00008756816,0.0004132366,0.00036746365,0.9821472,0.0018284343,0.015055839],"study_design_scores_gemma":[0.000004407672,0.000009541196,0.000064850305,0.000022630415,0.0000034365964,0.00016426314,0.000043441923,0.0012020259,0.00068203884,0.96186393,0.035930023,0.000009397394],"about_ca_topic_score_codex":0.0006484409,"about_ca_topic_score_gemma":0.0004322619,"teacher_disagreement_score":0.010078263,"about_ca_system_score_codex":0.000929006,"about_ca_system_score_gemma":0.0005957099,"threshold_uncertainty_score":0.03371513},"labels":[],"label_agreement":null},{"id":"W2405978955","doi":"10.1007/978-3-319-23264-5_37","title":"Clause-Learning for Modular Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Modular design; Programming language; Artificial intelligence","score_opus":0.032841658742845295,"score_gpt":0.25861655091564645,"score_spread":0.22577489217280117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405978955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011157789,0.0013513155,0.96021926,0.0010652655,0.00009778512,0.000065582186,0.00021139864,0.0009534938,0.024878165],"genre_scores_gemma":[0.4483011,0.0020011147,0.517631,0.0005622172,0.0004484591,0.00028659336,0.0017779163,0.00081447704,0.028177153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900997,0.0003731233,0.00005528654,0.00017916443,0.00029904154,0.00008337444],"domain_scores_gemma":[0.9964651,0.0027360364,0.00009494906,0.0004217248,0.00020951289,0.00007266428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707261,0.0007844316,0.00062154804,0.00090482045,0.0006463139,0.0014250632,0.001992836,0.0009705547,0.020725168],"category_scores_gemma":[0.00841679,0.00063156843,0.0011310627,0.0011591226,0.0021023082,0.0062152576,0.0031074304,0.0038318625,0.0024990612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004150806,0.000038592552,0.00023248712,0.00019885639,0.000025654253,0.000035521338,0.00015960299,0.01629751,0.0007924182,0.8533961,0.0077981423,0.12098361],"study_design_scores_gemma":[0.000011165156,0.0000075864323,0.000050553623,0.000022449964,0.00000737082,0.00001540442,0.000014598303,0.036760043,0.00041357876,0.9590988,0.003593339,0.0000051247744],"about_ca_topic_score_codex":0.0010686483,"about_ca_topic_score_gemma":0.0017918549,"teacher_disagreement_score":0.020725168,"about_ca_system_score_codex":0.00131738,"about_ca_system_score_gemma":0.0006091017,"threshold_uncertainty_score":0.0693326},"labels":[],"label_agreement":null},{"id":"W2406451447","doi":"10.1007/978-3-319-26626-8_47","title":"Approximating the Restricted 1-Center in Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Saddle point; Center (category theory); Approximation algorithm; Separable space; Vertex (graph theory); Binary logarithm; Mathematics; Matrix (chemical analysis); Scaling; Distance matrix; Shortest path problem; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.03875089561815854,"score_gpt":0.26109662159600944,"score_spread":0.2223457259778509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406451447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2798967,0.0023052285,0.6600149,0.0023042108,0.00037245787,0.00018496421,0.0011924388,0.004243554,0.04948549],"genre_scores_gemma":[0.6962687,0.0014294918,0.27823493,0.0007213681,0.00035670117,0.000211409,0.0019477498,0.0018250492,0.019004542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849033,0.00047593613,0.00004533545,0.00040244602,0.00031256562,0.0002733538],"domain_scores_gemma":[0.9947572,0.002897348,0.00040422933,0.0011660045,0.00037063478,0.00040468798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750869,0.0020570867,0.0021769602,0.0017239888,0.0014255736,0.003031551,0.004387176,0.002328253,0.01095238],"category_scores_gemma":[0.009498141,0.0010638366,0.0012002953,0.0025115006,0.0024948486,0.0062773637,0.0042647053,0.003640775,0.0030202745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013456867,0.00042250776,0.0026605192,0.0009829485,0.00011494237,0.00021002509,0.0007363471,0.26178208,0.009785781,0.5246081,0.040917177,0.15643394],"study_design_scores_gemma":[0.000093053255,0.00008406148,0.00038939292,0.000070525755,0.00004868605,0.00015423336,0.00015789768,0.3257788,0.0032346647,0.6639787,0.0059832353,0.000026653139],"about_ca_topic_score_codex":0.003343323,"about_ca_topic_score_gemma":0.005007734,"teacher_disagreement_score":0.01095238,"about_ca_system_score_codex":0.002720702,"about_ca_system_score_gemma":0.0011176788,"threshold_uncertainty_score":0.036639392},"labels":[],"label_agreement":null},{"id":"W2407196879","doi":"10.1007/978-3-319-19066-2_68","title":"Combining Constrained CP-Nets and Quantitative Preferences for Online Shopping","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.08148010704042642,"score_gpt":0.3099909860485635,"score_spread":0.2285108790081371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407196879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021537725,0.0002632644,0.970753,0.00040139907,0.00008408171,0.00006905208,0.00037193138,0.00019737931,0.006322122],"genre_scores_gemma":[0.61678064,0.000605035,0.36915866,0.00026723184,0.00023413931,0.00021494951,0.0011169757,0.00021649865,0.0114058545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973206,0.0013333695,0.00015861503,0.00041329404,0.00053738966,0.00023681468],"domain_scores_gemma":[0.9902588,0.0070150346,0.000511427,0.0008840147,0.0007976071,0.00053315243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043852963,0.0009685059,0.0012987859,0.0013045514,0.00065590296,0.0027693692,0.0022871601,0.0013491478,0.010337934],"category_scores_gemma":[0.018177038,0.000890239,0.0014277583,0.002536963,0.0013897186,0.007128182,0.0027743026,0.0029306195,0.000729747],"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.00033585192,0.00020621675,0.0017360135,0.0002591901,0.0000862053,0.00013130756,0.00014036044,0.32262623,0.00069592916,0.5953442,0.0030056874,0.07543278],"study_design_scores_gemma":[0.00001737445,0.000031213644,0.00017824961,0.000021952852,0.00001429426,0.000028698645,0.00003796891,0.56439555,0.00018448966,0.43386352,0.001210004,0.000016650118],"about_ca_topic_score_codex":0.0054242956,"about_ca_topic_score_gemma":0.006626615,"teacher_disagreement_score":0.010337934,"about_ca_system_score_codex":0.0015710442,"about_ca_system_score_gemma":0.0014469988,"threshold_uncertainty_score":0.034583807},"labels":[],"label_agreement":null},{"id":"W2407249295","doi":"10.1007/978-3-319-27857-5_74","title":"Vis3D+: An Integrated System for GPU-Accelerated Volume Image Processing and Rendering","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer graphics (images); Rendering (computer graphics); Volume rendering; Computer vision; Volume (thermodynamics); Image processing; Artificial intelligence; Computational science; Image (mathematics)","score_opus":0.043891775629539005,"score_gpt":0.3062030118822432,"score_spread":0.2623112362527042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407249295","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055950717,0.0007721784,0.7148894,0.00016735622,0.00042681576,0.0001952693,0.005021015,0.24941044,0.023522547],"genre_scores_gemma":[0.07151811,0.0013349414,0.78104186,0.0006598313,0.000288586,0.0006465841,0.01852188,0.08029067,0.045697603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996172,0.000031059677,0.000021652568,0.000059763905,0.00022555265,0.000044655102],"domain_scores_gemma":[0.99969566,0.00007188666,0.0000166356,0.00006416932,0.00010304607,0.000048516693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043796503,0.0016301142,0.000932656,0.0009588261,0.00044941975,0.0017988973,0.0029771323,0.0008784328,0.05047916],"category_scores_gemma":[0.0010011867,0.0011736121,0.0011291993,0.0010167597,0.00031065196,0.0011392393,0.0014867464,0.0017726767,0.021298433],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010817485,0.00019689625,0.0011337363,0.00079168455,0.00027209616,0.00032685688,0.00027939587,0.015126601,0.08259879,0.018653922,0.3718412,0.5076971],"study_design_scores_gemma":[0.0005760188,0.00022899207,0.0015118832,0.00014814449,0.00020504803,0.0010602126,0.000047383757,0.27741465,0.16047315,0.016172945,0.5419421,0.00021954514],"about_ca_topic_score_codex":0.0017116194,"about_ca_topic_score_gemma":0.0021972887,"teacher_disagreement_score":0.05047916,"about_ca_system_score_codex":0.00045530047,"about_ca_system_score_gemma":0.00083810795,"threshold_uncertainty_score":0.16886961},"labels":[],"label_agreement":null},{"id":"W2407310659","doi":"10.1007/978-3-319-25783-9_37","title":"Determining Three-Way Decision Regions by Combining Gini Objective Functions and GTRS","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Pareto principle; Gini coefficient; Mathematical optimization; Compromise; Decision problem; Mathematics; Nash equilibrium; Computer science; Inequality; Algorithm; Political science","score_opus":0.032022343660029574,"score_gpt":0.25514005278469404,"score_spread":0.22311770912466447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407310659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009986463,0.00037323963,0.9841113,0.00020008547,0.000028978957,0.00010006893,0.00007224892,0.00009295588,0.0050346665],"genre_scores_gemma":[0.29511932,0.0007394944,0.6992382,0.00014044323,0.00004673173,0.0004153516,0.0002585172,0.00020066748,0.0038413173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968925,0.0014609589,0.0001744885,0.00044503665,0.0008031769,0.0002237995],"domain_scores_gemma":[0.99636793,0.0022121698,0.0004018783,0.00025850296,0.00061002164,0.00014952173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062589194,0.0019974948,0.0022273848,0.002757039,0.00087258324,0.003464609,0.0019268896,0.00138102,0.0025989076],"category_scores_gemma":[0.009737281,0.00083193794,0.0027075165,0.0020985433,0.0015231386,0.0033889264,0.0022714313,0.0025029678,0.00052205985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056926292,0.000051085564,0.0011569812,0.00020629737,0.00013645884,0.00010580764,0.00022664813,0.8152279,0.0019702718,0.11431035,0.0019367847,0.0646144],"study_design_scores_gemma":[0.000007841448,0.000034603963,0.00021416094,0.000034949615,0.00003018223,0.000046360008,0.000058182533,0.9353699,0.0009354589,0.061352197,0.0018916272,0.000024643648],"about_ca_topic_score_codex":0.0051354486,"about_ca_topic_score_gemma":0.004164492,"teacher_disagreement_score":0.0062589194,"about_ca_system_score_codex":0.003543391,"about_ca_system_score_gemma":0.002952644,"threshold_uncertainty_score":0.033100724},"labels":[],"label_agreement":null},{"id":"W2407445265","doi":"10.1007/978-3-662-48221-6_22","title":"Graph-Theoretic Modelling of the Domain Chaining Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 Ottawa","funders":"","keywords":"Chaining; Computer science; Cluster analysis; Forward chaining; Markov chain; Clique; Backward chaining; Theoretical computer science; Graph; Computational biology; Algorithm; Combinatorics; Mathematics; Artificial intelligence; Biology; Inference; Machine learning","score_opus":0.022133480023284784,"score_gpt":0.2238261184612136,"score_spread":0.20169263843792884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407445265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042406555,0.0007879647,0.9037719,0.002716494,0.00009916472,0.000110130015,0.0005783507,0.0002836797,0.049245764],"genre_scores_gemma":[0.66395235,0.0023293993,0.29464805,0.00046014035,0.0003290068,0.00032209046,0.0021246846,0.00038381357,0.03545043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888176,0.00043174633,0.00006302956,0.00023233841,0.00024260128,0.00014866382],"domain_scores_gemma":[0.9957172,0.002897528,0.0002902261,0.0005033002,0.00030196647,0.00028978384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013771534,0.0007302333,0.00085093494,0.0014455216,0.0015543079,0.0036462208,0.0031487618,0.0024799,0.01278858],"category_scores_gemma":[0.0065838466,0.00082164776,0.0015865201,0.0028180385,0.0030171245,0.007474993,0.0029125425,0.0032440631,0.0014312733],"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.000022700971,0.000032533273,0.00015412373,0.00005335596,0.000011190665,0.00009210682,0.00012703457,0.048451398,0.00026400638,0.94094366,0.0019174424,0.007930422],"study_design_scores_gemma":[0.0000068808113,0.0000046044715,0.00003198674,0.000012710979,0.0000055846144,0.000030054263,0.00004088058,0.09585966,0.00012859186,0.9017094,0.0021644984,0.0000051748193],"about_ca_topic_score_codex":0.004426064,"about_ca_topic_score_gemma":0.0041233925,"teacher_disagreement_score":0.01278858,"about_ca_system_score_codex":0.0016844118,"about_ca_system_score_gemma":0.0013670314,"threshold_uncertainty_score":0.042782128},"labels":[],"label_agreement":null},{"id":"W2407605217","doi":"10.1007/978-3-319-27863-6_29","title":"A Study of Hand Motion/Posture Recognition in Two-Camera Views","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Gesture recognition; Scale-invariant feature transform; Trajectory; Gesture; Invariant (physics); Motion (physics); Support vector machine; Set (abstract data type); Feature (linguistics); Pattern recognition (psychology); Feature extraction; Mathematics","score_opus":0.07524949486069304,"score_gpt":0.3085320895191546,"score_spread":0.23328259465846157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407605217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23106496,0.013349419,0.7308251,0.0001937913,0.00013083247,0.0000797599,0.00023581691,0.0003573496,0.02376289],"genre_scores_gemma":[0.853006,0.005004974,0.12577844,0.000049547656,0.00011472167,0.00002178427,0.00029463877,0.00014361354,0.015586217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.000047549034,0.000011090282,0.000111128495,0.000094345465,0.000027849768],"domain_scores_gemma":[0.99945277,0.00033232995,0.000046873203,0.00005364265,0.000093517505,0.00002092147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022275634,0.00034267904,0.0005371714,0.0005728473,0.00022597454,0.0008764138,0.00052475586,0.0004345259,0.0037301658],"category_scores_gemma":[0.0011120702,0.00035855506,0.00051074283,0.0009769087,0.00041769727,0.0010114753,0.00029378204,0.00045858932,0.00071832887],"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.00040120928,0.00010392459,0.004262788,0.00078160875,0.00016391583,0.0010027244,0.0005071476,0.033548664,0.40990102,0.029142996,0.0022872714,0.5178967],"study_design_scores_gemma":[0.000016692946,0.00041085877,0.03547564,0.000108301225,0.00010574138,0.0029429207,0.00044577502,0.8496432,0.095334925,0.007112176,0.008325241,0.000078537174],"about_ca_topic_score_codex":0.004535886,"about_ca_topic_score_gemma":0.0035497183,"teacher_disagreement_score":0.004535886,"about_ca_system_score_codex":0.00036162522,"about_ca_system_score_gemma":0.00019858597,"threshold_uncertainty_score":0.012478709},"labels":[],"label_agreement":null},{"id":"W2407793835","doi":"10.1007/978-3-319-23219-5_31","title":"Machine Learning of Bayesian Networks Using Constraint Programming","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pruning; Bayesian network; Benchmark (surveying); Graphical model; Constraint (computer-aided design); Constraint programming; Branch and bound; Machine learning; Suite; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","score_opus":0.039596098904106085,"score_gpt":0.27316160384534555,"score_spread":0.23356550494123945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407793835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010501683,0.0005285637,0.9951794,0.00026174035,0.000023322544,0.000030720385,0.00012187913,0.00012024318,0.002684013],"genre_scores_gemma":[0.07044523,0.0022098548,0.92050254,0.00020563537,0.00020862161,0.00045243083,0.000992624,0.00032879232,0.004654268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705374,0.0017036685,0.00012988808,0.0004143742,0.0005791077,0.00011918804],"domain_scores_gemma":[0.9839537,0.014127482,0.00046514612,0.0005466546,0.0007074648,0.00019957646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042827143,0.0015556781,0.0023288224,0.0018339498,0.00090036343,0.00341897,0.0039051294,0.0018253912,0.008156796],"category_scores_gemma":[0.023679977,0.0019430527,0.0023710965,0.004390108,0.002223171,0.0041801333,0.002944359,0.0052285045,0.00125324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050215454,0.000050529245,0.00031804864,0.0003303904,0.00012599291,0.00006161575,0.00011330006,0.5750866,0.0003111148,0.30412236,0.0064218184,0.11300809],"study_design_scores_gemma":[0.0000093139815,0.0000050969675,0.000051126997,0.000044134882,0.000010478056,0.000014021548,0.000009505548,0.79790705,0.00012868167,0.19973403,0.002076395,0.000010191666],"about_ca_topic_score_codex":0.0116229765,"about_ca_topic_score_gemma":0.013444228,"teacher_disagreement_score":0.0116229765,"about_ca_system_score_codex":0.002612721,"about_ca_system_score_gemma":0.0025998533,"threshold_uncertainty_score":0.027287245},"labels":[],"label_agreement":null},{"id":"W2408200580","doi":"10.1007/978-3-319-26350-2_50","title":"On the Krom Extension of $$\\mathcal {CFDI}^{\\forall -}_{nc}$$","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"P; Extension (predicate logic); Satisfiability; Consistency (knowledge bases); Computer science; TRACE (psycholinguistics); Boolean satisfiability problem; Discrete mathematics; Theoretical computer science; Algebra over a field; Mathematics; Time complexity; Programming language; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.05103100254578412,"score_gpt":0.2707098404623995,"score_spread":0.21967883791661535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408200580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076454747,0.0016392524,0.88873434,0.0032893738,0.0010760409,0.00033982281,0.0033384538,0.006537167,0.08740012],"genre_scores_gemma":[0.097161055,0.0028497316,0.8257502,0.0031116914,0.00073606794,0.00053330726,0.009360543,0.0052256715,0.05527172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973224,0.00069912244,0.00027762927,0.00063638587,0.00079410354,0.00027049336],"domain_scores_gemma":[0.99759173,0.00082179304,0.00011267738,0.00079921685,0.00055360235,0.00012112326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883977,0.0012974037,0.0013329528,0.0020727532,0.002363938,0.0045032147,0.0029081989,0.0011170864,0.031121649],"category_scores_gemma":[0.0073569026,0.0010762766,0.0028325082,0.0038792677,0.002662338,0.014614867,0.008917791,0.004581334,0.011989223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010690876,0.00006119764,0.0001655829,0.000257213,0.000022864442,0.00008702809,0.00039027544,0.00128123,0.00095148163,0.8871218,0.026588472,0.08296583],"study_design_scores_gemma":[0.00003135701,0.000026942591,0.00018020603,0.00022983861,0.000036841186,0.00019442002,0.00015626707,0.008115617,0.0011781177,0.79863983,0.1911602,0.00005032828],"about_ca_topic_score_codex":0.008672467,"about_ca_topic_score_gemma":0.017089723,"teacher_disagreement_score":0.031121649,"about_ca_system_score_codex":0.0018027613,"about_ca_system_score_gemma":0.002250306,"threshold_uncertainty_score":0.10411227},"labels":[],"label_agreement":null},{"id":"W2408227341","doi":"10.1007/978-3-319-24553-9_61","title":"A System for MR-Ultrasound Guidance during Robot-Assisted Laparoscopic Radical Prostatectomy","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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 British Columbia","funders":"","keywords":"Magnetic resonance imaging; Prostatectomy; Ultrasound; Medicine; Laparoscopic radical prostatectomy; Brachytherapy; Image-guided surgery; Segmentation; Da Vinci Surgical System; Computer science; Prostate cancer; Radiology; Artificial intelligence; Robotic surgery; Surgery; Cancer; Radiation therapy","score_opus":0.02789771005834128,"score_gpt":0.28448373635364804,"score_spread":0.25658602629530675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408227341","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.051049042,0.006576079,0.87087506,0.00070977944,0.0013830706,0.0009480912,0.0018342334,0.0452085,0.021416234],"genre_scores_gemma":[0.2544665,0.0029678605,0.6787052,0.0018226373,0.00054754416,0.0007976428,0.0020897328,0.003100474,0.055502318],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997011,0.00004465655,0.000024205825,0.00008570718,0.00011686851,0.000027395095],"domain_scores_gemma":[0.99947983,0.00019338148,0.000031187483,0.00006266489,0.00017351273,0.00005944036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005145268,0.0006295573,0.000513882,0.00057225744,0.00039378594,0.00074013876,0.0013443384,0.0011964433,0.017685497],"category_scores_gemma":[0.0008020378,0.00046006707,0.0003077099,0.00035424717,0.0001858219,0.0007090346,0.0008347458,0.00052112615,0.005271946],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011082247,0.00014177564,0.001621336,0.0007470008,0.00007169631,0.0006397015,0.00032310223,0.001558354,0.52136266,0.0013808851,0.028261183,0.44278416],"study_design_scores_gemma":[0.000578321,0.0032181197,0.023881378,0.00053017586,0.0006470461,0.012202046,0.0002091812,0.08003224,0.5164097,0.0018187286,0.35996115,0.00051192025],"about_ca_topic_score_codex":0.0008608039,"about_ca_topic_score_gemma":0.0010499401,"teacher_disagreement_score":0.017685497,"about_ca_system_score_codex":0.00022021588,"about_ca_system_score_gemma":0.0005918922,"threshold_uncertainty_score":0.059163928},"labels":[],"label_agreement":null},{"id":"W240851389","doi":"10.1007/978-3-662-45174-8_21","title":"Space Bounds for Adaptive Renaming","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Asynchronous communication; Computer science; Upper and lower bounds; Combinatorics; Integer (computer science); Discrete mathematics; Space (punctuation); Arithmetic; Algorithm; Mathematics; Programming language; Telecommunications; Operating system","score_opus":0.017065302125838296,"score_gpt":0.24228609566146675,"score_spread":0.22522079353562846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W240851389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017208802,0.006947707,0.8840722,0.0020988581,0.0008558981,0.000102900856,0.00035286442,0.0019867327,0.08637412],"genre_scores_gemma":[0.6331099,0.0073118,0.2892582,0.0013465142,0.0018741445,0.0007416632,0.0009834224,0.002468208,0.06290599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919418,0.0018859728,0.00037931817,0.0012094964,0.0030884424,0.0014949809],"domain_scores_gemma":[0.9709089,0.018914802,0.00092384085,0.0062334375,0.0020848897,0.000934156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056031113,0.002492257,0.0029907764,0.0027519215,0.0022330212,0.006398289,0.0056188004,0.0027187467,0.028396958],"category_scores_gemma":[0.028559044,0.0011641225,0.0017168263,0.003858214,0.0039584744,0.017543862,0.008310845,0.009207073,0.004438992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002982277,0.000074314004,0.00018453333,0.00020974438,0.000036977726,0.00003498661,0.00024612574,0.050401293,0.0019001531,0.8587526,0.010631588,0.077229425],"study_design_scores_gemma":[0.00002386826,0.0000413432,0.0001270962,0.0000876858,0.00003666775,0.000056903693,0.00006661896,0.19730097,0.0015476298,0.7904713,0.010205511,0.000034424487],"about_ca_topic_score_codex":0.0026161552,"about_ca_topic_score_gemma":0.0024681839,"teacher_disagreement_score":0.028396958,"about_ca_system_score_codex":0.0043258257,"about_ca_system_score_gemma":0.0020545872,"threshold_uncertainty_score":0.09499729},"labels":[],"label_agreement":null},{"id":"W2408538353","doi":"10.1007/978-3-319-25645-0_37","title":"A Game Theoretic Framework for Cloud Security Transparency","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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 Victoria","funders":"","keywords":"Computer science; Cloud computing; Transparency (behavior); Computer security; Theoretical computer science; Distributed computing; Operating system","score_opus":0.022269169550661116,"score_gpt":0.262516828292509,"score_spread":0.2402476587418479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408538353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005224024,0.00054210395,0.8942206,0.0048887143,0.00024878667,0.00013609951,0.000118701086,0.00018941934,0.09443155],"genre_scores_gemma":[0.6957495,0.0011548292,0.2618491,0.0012745988,0.0006685207,0.00072913885,0.00012511812,0.0001997322,0.038249545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597305,0.0019961912,0.00016075437,0.0003697077,0.00097487617,0.0005253463],"domain_scores_gemma":[0.99624544,0.0024363152,0.00023335943,0.00046112813,0.00035215894,0.00027160285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003895357,0.0014145458,0.0011882195,0.001392317,0.002605214,0.007323395,0.0035904997,0.004494482,0.01228207],"category_scores_gemma":[0.007712397,0.0009793157,0.0019718918,0.0017142342,0.00801484,0.009844923,0.0040913094,0.00807873,0.0013442815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032216828,0.000007603933,0.000008560411,0.000011706398,0.0000026796506,0.000013403928,0.00003977293,0.0037692403,0.00007457319,0.99449193,0.0005279601,0.0010493083],"study_design_scores_gemma":[0.0000061798232,0.0000053037634,0.000009998838,0.000010658955,0.0000033618987,0.0000141706,0.000022056147,0.022877816,0.0000541343,0.9748434,0.0021462673,0.0000065596687],"about_ca_topic_score_codex":0.0042335005,"about_ca_topic_score_gemma":0.0027586964,"teacher_disagreement_score":0.01228207,"about_ca_system_score_codex":0.006194258,"about_ca_system_score_gemma":0.0039154226,"threshold_uncertainty_score":0.044942737},"labels":[],"label_agreement":null},{"id":"W2408647579","doi":"10.1007/978-3-319-24574-4_62","title":"Predictive Modeling of Anatomy with Genetic and Clinical Data","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Institute on Drug Abuse; National Institutes of Health; National Institute of Biomedical Imaging and Bioengineering; BrightFocus Foundation; American Health Assistance Foundation","keywords":"Contrast (vision); Population; Voxel; Parametric model; Artificial intelligence; Computer science; Parametric statistics; Focus (optics); Medicine; Mathematics; Statistics","score_opus":0.04373816388543649,"score_gpt":0.33711968139003495,"score_spread":0.29338151750459845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408647579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25988013,0.0017077322,0.7268804,0.0028866022,0.00018293905,0.00013358999,0.0040368703,0.002221167,0.0020706428],"genre_scores_gemma":[0.963785,0.0007614098,0.030488772,0.00018142108,0.0002022328,0.0001230766,0.0024780526,0.000077601384,0.0019025018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890447,0.00052674237,0.000059458853,0.00025437513,0.00015034895,0.0001045773],"domain_scores_gemma":[0.987206,0.0105747115,0.0006656135,0.00081751007,0.00046715295,0.00026895525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038874482,0.0011487866,0.0012611414,0.0026187818,0.000391956,0.0018781689,0.0020024488,0.0015269788,0.0021580749],"category_scores_gemma":[0.014914726,0.0009346077,0.0020573754,0.0019571828,0.0010042024,0.0012287409,0.0014388821,0.0022154462,0.0010638468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038591717,0.00022426964,0.048771407,0.00007847186,0.00018888855,0.00045658898,0.000091071764,0.87377477,0.0006133445,0.0056056716,0.002876601,0.06693306],"study_design_scores_gemma":[0.000011311118,0.000018756113,0.0014694771,0.000009203104,0.000020909652,0.00006791359,0.0000075351313,0.9910892,0.00011718581,0.006988425,0.00019337265,0.0000066094053],"about_ca_topic_score_codex":0.012324323,"about_ca_topic_score_gemma":0.011452147,"teacher_disagreement_score":0.012324323,"about_ca_system_score_codex":0.0007757842,"about_ca_system_score_gemma":0.0010512663,"threshold_uncertainty_score":0.024505198},"labels":[],"label_agreement":null},{"id":"W2409020049","doi":"10.1007/978-3-319-39077-2_12","title":"Optimizing I/O Intensive Domain Handling in Xen Hypervisor for Consolidated Server Environments","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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 Ottawa","funders":"","keywords":"Hypervisor; Computer science; Operating system; Virtualization; Virtual machine; Hardware virtualization; Server; Bottleneck; Scalability; Scheduling (production processes); Full virtualization; Distributed computing; Embedded system; Cloud computing","score_opus":0.017695270572037222,"score_gpt":0.22868426191011115,"score_spread":0.21098899133807392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409020049","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.73396134,0.0017839441,0.2294503,0.00038477234,0.00017964232,0.000103803846,0.00027417496,0.009424819,0.024437187],"genre_scores_gemma":[0.9317459,0.00032346236,0.057866696,0.00006761336,0.000023333661,0.000019757766,0.0003703471,0.00065106724,0.008931883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997185,0.000039211336,0.000012806086,0.00003749802,0.00009622929,0.00009583174],"domain_scores_gemma":[0.999741,0.000058785296,0.00002881712,0.00007233432,0.000059618167,0.000039369068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021917252,0.0005945216,0.0002250047,0.00026855938,0.00043774673,0.0010635327,0.001117551,0.0002352013,0.003171068],"category_scores_gemma":[0.0005918223,0.00021485823,0.00020083635,0.0004289465,0.00020859829,0.0008628741,0.0006300332,0.00064152305,0.0005076238],"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.0020415431,0.00067308376,0.008924939,0.00026168037,0.000090339236,0.00036175622,0.0004658106,0.27606443,0.24116015,0.01264539,0.018207036,0.43910384],"study_design_scores_gemma":[0.000036160644,0.00025693327,0.0035928292,0.00001838463,0.00004597365,0.00013165362,0.00017009531,0.89776474,0.088090695,0.0039676465,0.00590014,0.000024777237],"about_ca_topic_score_codex":0.0031616658,"about_ca_topic_score_gemma":0.0077614067,"teacher_disagreement_score":0.003171068,"about_ca_system_score_codex":0.00051030633,"about_ca_system_score_gemma":0.0009539448,"threshold_uncertainty_score":0.010608256},"labels":[],"label_agreement":null},{"id":"W2409819057","doi":"10.1007/978-3-030-45771-6_15","title":"Recognizing Even-Cycle and Even-Cut Matroids","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Binary number; Computer science; Class (philosophy); Oriented matroid; Time complexity; Discrete mathematics; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.023010251030053632,"score_gpt":0.2739879953730963,"score_spread":0.2509777443430427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409819057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44949606,0.001166692,0.49560377,0.00093125965,0.00022322625,0.00018602844,0.0025908323,0.0033757759,0.046426304],"genre_scores_gemma":[0.7444064,0.0007238897,0.22062613,0.0003332588,0.00013674228,0.000089654175,0.009367687,0.0006937508,0.023622409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966097,0.0000329616,0.00002765267,0.0001132615,0.00008442887,0.000080828475],"domain_scores_gemma":[0.9991763,0.00026989463,0.00009746461,0.00018825966,0.00017840002,0.000089688474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019081427,0.0007179884,0.0007549921,0.00082187605,0.0005633434,0.0022841666,0.0012651038,0.00084241875,0.0062653674],"category_scores_gemma":[0.0014966562,0.0005521075,0.0006796858,0.0010571837,0.00045564497,0.0040558535,0.0014547693,0.0012863826,0.0023885723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064707524,0.00035056417,0.012336511,0.00080728706,0.00009191904,0.0012585532,0.0011257889,0.050962027,0.070983715,0.25660434,0.044582285,0.56025],"study_design_scores_gemma":[0.000043337808,0.00013268366,0.004325676,0.000115380295,0.00007874084,0.0013217086,0.0010638523,0.2901226,0.03749028,0.61628956,0.048956756,0.000059516966],"about_ca_topic_score_codex":0.0020652234,"about_ca_topic_score_gemma":0.00415389,"teacher_disagreement_score":0.0062653674,"about_ca_system_score_codex":0.0005625469,"about_ca_system_score_gemma":0.00044941265,"threshold_uncertainty_score":0.020959735},"labels":[],"label_agreement":null},{"id":"W2414011888","doi":"10.1007/978-3-319-68792-6_28","title":"Robots as Individuals in the Humanoid League","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Robot; League; Humanoid robot; Competition (biology); Computer science; Field (mathematics); Scheme (mathematics); Artificial intelligence; Point (geometry); Focus (optics); Ranking (information retrieval); Human–computer interaction; Mathematics","score_opus":0.03316723841147458,"score_gpt":0.2856812481062277,"score_spread":0.2525140096947531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414011888","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.14947909,0.002537105,0.3734991,0.0020859886,0.000663722,0.00016681288,0.00025564586,0.0008885173,0.47042394],"genre_scores_gemma":[0.75945616,0.0012947692,0.082729585,0.00025079516,0.00013270523,0.00016935261,0.00034131535,0.00015877694,0.15546647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970454,0.000093532944,0.000009007977,0.00006930709,0.000072804294,0.00005072346],"domain_scores_gemma":[0.99974555,0.000047408554,0.00002141896,0.000040074203,0.00003806675,0.00010748188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032280618,0.00042354426,0.00036329558,0.00032514185,0.001204186,0.002490898,0.0008143014,0.00060181704,0.015657583],"category_scores_gemma":[0.0008142522,0.00019530953,0.0002798863,0.00034000623,0.002130788,0.0020204296,0.0020071054,0.0010830433,0.0023428614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023244294,0.000041100637,0.0006584706,0.00010469184,0.000019985131,0.00015664753,0.0020316667,0.017291471,0.0031074344,0.8360338,0.013270257,0.12705196],"study_design_scores_gemma":[0.000032252818,0.00013955073,0.00058811635,0.000088559806,0.000010918664,0.00016914554,0.0015406077,0.03144637,0.0014487094,0.8577768,0.106738605,0.000020289404],"about_ca_topic_score_codex":0.0039126375,"about_ca_topic_score_gemma":0.004761319,"teacher_disagreement_score":0.015657583,"about_ca_system_score_codex":0.00065462734,"about_ca_system_score_gemma":0.00072181725,"threshold_uncertainty_score":0.052379787},"labels":[],"label_agreement":null},{"id":"W2416294048","doi":"10.1007/978-3-319-32557-6_6","title":"Development of Krylov and AMG Linear Solvers for Large-Scale Sparse Matrices on GPUs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Krylov subspace; Computer science; Solver; Parallel computing; Computational science; Generalized minimal residual method; Linear system; Sparse matrix; Iterative method; CUDA; Algorithm; Mathematics; Programming language; Chemistry","score_opus":0.01598613731197933,"score_gpt":0.24586210336917785,"score_spread":0.2298759660571985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416294048","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.0051100734,0.00217542,0.9618298,0.0005678097,0.0003987395,0.00012224636,0.00030113917,0.004538046,0.024956807],"genre_scores_gemma":[0.027570222,0.0017398089,0.95293146,0.00020958621,0.00014782826,0.0001641026,0.0007279826,0.0013228796,0.015186198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943024,0.000082015176,0.000032950724,0.00007471677,0.00032947163,0.000050576247],"domain_scores_gemma":[0.99926203,0.00013136325,0.000027829486,0.00014067655,0.00037255615,0.000065391476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066288345,0.0010897025,0.00080879853,0.0007446951,0.0004642321,0.0012951518,0.002155009,0.0009916046,0.012209639],"category_scores_gemma":[0.0020609812,0.0008654893,0.00091622514,0.001509724,0.00050581514,0.001626035,0.0015777302,0.00323517,0.0075654853],"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.0001302553,0.00015415081,0.0007527481,0.0008093391,0.0001225713,0.00019461584,0.00028536865,0.10552509,0.027388107,0.1460879,0.06455492,0.653995],"study_design_scores_gemma":[0.000066197725,0.000073471594,0.00033098232,0.00013473062,0.000027549957,0.00017643352,0.00004512291,0.774415,0.017049184,0.04592181,0.16171305,0.000046532004],"about_ca_topic_score_codex":0.0027749108,"about_ca_topic_score_gemma":0.0043099914,"teacher_disagreement_score":0.012209639,"about_ca_system_score_codex":0.00071612117,"about_ca_system_score_gemma":0.0013323247,"threshold_uncertainty_score":0.040845275},"labels":[],"label_agreement":null},{"id":"W2416427035","doi":"10.1007/978-3-319-24486-0","title":"Algorithmic Learning Theory","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Regina","funders":"","keywords":"Computer science; Mathematics education; Cognitive science; Mathematical economics; Artificial intelligence; Psychology; Mathematics","score_opus":0.009753840205306272,"score_gpt":0.22391939115422574,"score_spread":0.21416555094891948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416427035","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.002772582,0.017391507,0.7717477,0.0072260075,0.00178144,0.0000653432,0.00056816597,0.0008320396,0.19761524],"genre_scores_gemma":[0.23716086,0.034942295,0.295596,0.004548268,0.0065888055,0.0007441265,0.0029609867,0.0014217806,0.41603696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904877,0.0003137331,0.00003782231,0.00017436748,0.00036076998,0.000064544285],"domain_scores_gemma":[0.99848276,0.0008970177,0.00005961569,0.0002946746,0.00020207485,0.00006385554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012119729,0.001198436,0.0012875814,0.0010394071,0.00070305733,0.0028420016,0.0013115166,0.0013365829,0.02287449],"category_scores_gemma":[0.004613869,0.0004956933,0.000852509,0.0016369716,0.001635251,0.002521993,0.0018682558,0.0038090313,0.008102536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002052206,0.000056148438,0.00027963435,0.00023761585,0.00007210124,0.000031049123,0.000058392932,0.01987722,0.00020780897,0.63552845,0.10170907,0.24192198],"study_design_scores_gemma":[0.000008715709,0.000010313762,0.0001614095,0.000072614734,0.000014111822,0.000035380184,0.000018725783,0.033363007,0.0001337782,0.910536,0.05563793,0.000007938332],"about_ca_topic_score_codex":0.000977396,"about_ca_topic_score_gemma":0.0012803167,"teacher_disagreement_score":0.02287449,"about_ca_system_score_codex":0.0013635922,"about_ca_system_score_gemma":0.0013058386,"threshold_uncertainty_score":0.07652283},"labels":[],"label_agreement":null},{"id":"W2417086276","doi":"10.1007/978-3-319-32557-6_2","title":"Large-Scale Reservoir Simulations on IBM Blue Gene/Q","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reservoir Engineering and Simulation 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 Calgary","funders":"","keywords":"Scalability; Computer science; IBM; Workstation; Grid; Scale (ratio); Parallel computing; Computational science; Simulation; Operating system; Geology","score_opus":0.019966273586942817,"score_gpt":0.2706605706825742,"score_spread":0.2506942970956314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417086276","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.7561167,0.00074802944,0.12301195,0.002337152,0.00044646373,0.00025940928,0.007954365,0.012649312,0.09647669],"genre_scores_gemma":[0.90439105,0.0002421111,0.078310415,0.00026682,0.000054798813,0.00030461221,0.0034243905,0.0020902385,0.010915489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997558,0.000075705626,0.000009462053,0.000032608157,0.000071241644,0.000055175162],"domain_scores_gemma":[0.99891484,0.0006381769,0.000035123136,0.000099500125,0.00020565376,0.0001066764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396077,0.0007125699,0.0011843414,0.00037267676,0.00090496306,0.0006875631,0.0021127327,0.0011630019,0.014277276],"category_scores_gemma":[0.0023129375,0.0006329447,0.00055783783,0.0009062535,0.0006677824,0.00087353744,0.0007366072,0.0016815637,0.0014478513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019265225,0.00015774631,0.002243522,0.00009893876,0.000047853107,0.0001743204,0.00016003223,0.9653366,0.0025222686,0.008082948,0.010830275,0.010152865],"study_design_scores_gemma":[0.00007639644,0.00002252448,0.0004055116,0.000005396567,0.000005977564,0.000011128085,0.00002428271,0.9944459,0.0009956799,0.0022224016,0.0017753333,0.000009456207],"about_ca_topic_score_codex":0.026893785,"about_ca_topic_score_gemma":0.02232428,"teacher_disagreement_score":0.026893785,"about_ca_system_score_codex":0.0009269896,"about_ca_system_score_gemma":0.0015778998,"threshold_uncertainty_score":0.053474486},"labels":[],"label_agreement":null},{"id":"W2419105324","doi":"10.1007/978-3-319-30695-7_1","title":"Towards Multicore Performance with Configurable Computing Units","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Computer science; Reconfigurability; Computer architecture; Compiler; Multi-core processor; Microarchitecture; Embedded system; Cache; Netlist; Energy consumption; Process (computing); Parallel computing; Operating system","score_opus":0.020305152423301834,"score_gpt":0.24093607471466036,"score_spread":0.22063092229135853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419105324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2015384,0.01603924,0.65936464,0.0030632843,0.0017081636,0.00014019127,0.0005233679,0.010659385,0.10696337],"genre_scores_gemma":[0.62933964,0.003232364,0.3426309,0.00079058413,0.00046620806,0.00013900196,0.0005812183,0.0010539102,0.02176622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00008510934,0.000031068485,0.00011277953,0.0001893817,0.000093825685],"domain_scores_gemma":[0.9990747,0.00022369043,0.00006002865,0.00034544003,0.00020394826,0.00009219859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014784,0.00075692567,0.00054817006,0.0003917093,0.00037500524,0.0014199804,0.0024195793,0.0007300517,0.009897516],"category_scores_gemma":[0.002009207,0.0005218091,0.00032854386,0.00092584034,0.00041597112,0.002822508,0.0014154589,0.0016741643,0.0022024265],"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.0011125209,0.0002825756,0.0023083685,0.00087448116,0.00016142217,0.00022988074,0.00027605085,0.11075348,0.18362446,0.13992858,0.037555672,0.5228925],"study_design_scores_gemma":[0.00012319848,0.00074539345,0.0029371814,0.0002869566,0.00015336275,0.00039461447,0.0001658068,0.5931356,0.13243364,0.115146264,0.15435888,0.00011914143],"about_ca_topic_score_codex":0.0006137956,"about_ca_topic_score_gemma":0.0011320814,"teacher_disagreement_score":0.009897516,"about_ca_system_score_codex":0.0007534458,"about_ca_system_score_gemma":0.00050365017,"threshold_uncertainty_score":0.03311056},"labels":[],"label_agreement":null},{"id":"W2423304707","doi":"10.1007/978-3-540-75666-8_8","title":"Protein Structure Prediction with Visuospatial Analogy","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","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":"Queen's University","funders":"","keywords":"Analogy; Similarity (geometry); Computer science; Metric (unit); Artificial intelligence; Similitude; Analogical reasoning; Theoretical computer science; Image (mathematics)","score_opus":0.006250009846741432,"score_gpt":0.22588182240225538,"score_spread":0.21963181255551395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423304707","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.29134798,0.0016770228,0.67008793,0.00039364977,0.00017088738,0.00021975314,0.001282784,0.009599476,0.025220485],"genre_scores_gemma":[0.7358619,0.0006655433,0.25669715,0.00017485193,0.000081685765,0.000115210445,0.0015323043,0.00018432202,0.004687056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998098,0.000028080854,0.00001025872,0.00007840968,0.00005269496,0.000020769741],"domain_scores_gemma":[0.9997211,0.00011566204,0.000021820228,0.00005764329,0.00006186127,0.000021928285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035175856,0.0005480272,0.00064796093,0.0011834145,0.0003942372,0.0006013798,0.0008728003,0.00059804315,0.0046047834],"category_scores_gemma":[0.00092711905,0.00026621352,0.00070272567,0.0011546996,0.00032194136,0.001000046,0.000964919,0.00034412937,0.0011262392],"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.00075740134,0.00030636706,0.0055139656,0.00020073827,0.00014275886,0.00046006983,0.000056181383,0.10142446,0.036794696,0.010027835,0.008556077,0.83575946],"study_design_scores_gemma":[0.000044079068,0.000124063,0.0018883054,0.0000151841505,0.00004495188,0.00016606654,0.00003373779,0.9671966,0.01172962,0.016259648,0.002485863,0.000011931481],"about_ca_topic_score_codex":0.0029365122,"about_ca_topic_score_gemma":0.0030595309,"teacher_disagreement_score":0.0046047834,"about_ca_system_score_codex":0.00030080386,"about_ca_system_score_gemma":0.0005033864,"threshold_uncertainty_score":0.015404522},"labels":[],"label_agreement":null},{"id":"W24235702","doi":"10.1007/978-3-642-22450-8_20","title":"Improving CS-MNS through a Bias Factor: Analysis, Simulation and Implementation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Testbed; Computer science; Divergence (linguistics); Clock synchronization; Protocol (science); Synchronization (alternating current); Factor (programming language); MATLAB; A priori and a posteriori; Convergence (economics); Real-time computing; Wireless sensor network; Algorithm; Computer network; Operating system","score_opus":0.03770061390782004,"score_gpt":0.29088051874264487,"score_spread":0.25317990483482483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24235702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08251547,0.0006515543,0.9067889,0.00043217503,0.00019370356,0.000079865924,0.00012123531,0.0026067416,0.0066102757],"genre_scores_gemma":[0.66955084,0.00027293488,0.32522702,0.00017840898,0.00006308807,0.00006328572,0.00013914183,0.00025206615,0.0042532454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890816,0.00035376134,0.0000442632,0.00012409128,0.00041922927,0.00015036657],"domain_scores_gemma":[0.9930795,0.004247066,0.00022782988,0.00085966924,0.0014225659,0.0001633923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021438103,0.00054206897,0.00059367024,0.00047114605,0.000503994,0.00089307583,0.0011688509,0.0008082299,0.0066649904],"category_scores_gemma":[0.011979686,0.00020481972,0.00027406245,0.0008032753,0.00057793804,0.0017743263,0.00087537133,0.0010153315,0.0010295837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017147684,0.00062773854,0.0049797874,0.00027032837,0.0001039032,0.0000757748,0.00016659133,0.56022084,0.021459257,0.05257174,0.00758351,0.35022578],"study_design_scores_gemma":[0.000046643054,0.00010023789,0.00020866243,0.000009657234,0.000016668931,0.000038898248,0.000020385529,0.9883692,0.0067984895,0.0030975589,0.0012850092,0.000008501893],"about_ca_topic_score_codex":0.008005206,"about_ca_topic_score_gemma":0.011843507,"teacher_disagreement_score":0.008005206,"about_ca_system_score_codex":0.0013098951,"about_ca_system_score_gemma":0.002009862,"threshold_uncertainty_score":0.022296607},"labels":[],"label_agreement":null},{"id":"W242452600","doi":"10.1007/978-3-642-23795-9","title":"Multiple Access Communications","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Satellite Communication Systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Telecommunications; Library science; Operations research; Engineering","score_opus":0.06745657451245905,"score_gpt":0.2910429325929162,"score_spread":0.22358635808045713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242452600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039117406,0.035289366,0.29624876,0.0010648064,0.0044156783,0.0001694837,0.0006002442,0.0041131102,0.65418684],"genre_scores_gemma":[0.02862239,0.015149034,0.03425272,0.00055689027,0.0013519735,0.000113967784,0.00069614674,0.00023300567,0.9190239],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996275,0.000037391837,0.000010975193,0.000084831765,0.00020693586,0.00003233772],"domain_scores_gemma":[0.9997037,0.000061115425,0.000020761694,0.00007505235,0.00011615292,0.000023136352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022113346,0.0013626108,0.00097169454,0.0011791555,0.00082005985,0.0015236367,0.00096950715,0.0011366719,0.07362574],"category_scores_gemma":[0.00066191726,0.0003279943,0.0003227533,0.0017928069,0.0004897742,0.0013998062,0.0013927049,0.0015255611,0.0519681],"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.00006034508,0.00006669248,0.00014390952,0.00039386016,0.000043732158,0.00021423302,0.000094935596,0.0019654846,0.019931467,0.04497559,0.14482264,0.7872871],"study_design_scores_gemma":[0.000010523292,0.0001334973,0.00062687625,0.00018892736,0.000040130697,0.001414996,0.000052399027,0.007273575,0.010336749,0.021217108,0.95866364,0.000041503255],"about_ca_topic_score_codex":0.00037626343,"about_ca_topic_score_gemma":0.000973445,"teacher_disagreement_score":0.07362574,"about_ca_system_score_codex":0.000401275,"about_ca_system_score_gemma":0.00033482717,"threshold_uncertainty_score":0.24630266},"labels":[],"label_agreement":null},{"id":"W24289143","doi":"10.1007/978-3-642-33509-9_42","title":"Parallel Tracking and Mapping with Multiple Cameras on an Unmanned Aerial Vehicle","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University; McGill University","funders":"","keywords":"Computer science; Tracking (education); Computer vision; Artificial intelligence; Tracking system; Cover (algebra); Vehicle tracking system; Field of view; Real-time computing; Kalman filter; Engineering","score_opus":0.016814016289466143,"score_gpt":0.2104383113188154,"score_spread":0.19362429502934927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24289143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052006226,0.0005637454,0.9379589,0.00014463783,0.00017748543,0.00006158785,0.00008134994,0.0010145201,0.007991516],"genre_scores_gemma":[0.50620556,0.0009743037,0.47657987,0.000057687495,0.000105926,0.00011103544,0.0002553556,0.00011364635,0.015596685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997181,0.000030097179,0.000010238096,0.000092586386,0.00012437158,0.000024503322],"domain_scores_gemma":[0.999816,0.00003833521,0.00002501719,0.000050949136,0.000054555563,0.000015169743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016573304,0.0007706166,0.00066536304,0.00053302257,0.0005834614,0.00072281295,0.0007857146,0.000727844,0.002196583],"category_scores_gemma":[0.00052791147,0.0006311258,0.0005030574,0.0010656787,0.00044859262,0.0014740146,0.0011664068,0.000665201,0.0005897701],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028863797,0.00007409574,0.0012959362,0.00016501042,0.00009559329,0.00039851473,0.00028136274,0.35696104,0.056098316,0.010555555,0.004276057,0.5695098],"study_design_scores_gemma":[0.000020256826,0.000114812436,0.0016855241,0.0000127959875,0.000023653805,0.00021183114,0.00006741626,0.9722435,0.01305781,0.0067823636,0.0057563614,0.000023724675],"about_ca_topic_score_codex":0.006982974,"about_ca_topic_score_gemma":0.007919822,"teacher_disagreement_score":0.006982974,"about_ca_system_score_codex":0.00042050725,"about_ca_system_score_gemma":0.0005564354,"threshold_uncertainty_score":0.013884664},"labels":[],"label_agreement":null},{"id":"W24306703","doi":"10.1007/978-3-642-22571-0_25","title":"Elements of Consumption: An Abstract Visualization of Household Consumption","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Simon Fraser University","funders":"","keywords":"Consumption (sociology); Computer science; Visualization; Sustainability; Key (lock); Electricity; Human–computer interaction; Water consumption; Environmental economics; Order (exchange); Multimedia; Computer graphics (images); Artificial intelligence; Computer security; Business; Economics; Aesthetics; Art; Engineering","score_opus":0.07154024682832955,"score_gpt":0.31530167461465036,"score_spread":0.24376142778632082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24306703","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.46959093,0.0021394144,0.29880044,0.0022781712,0.0004254863,0.00021768501,0.03695735,0.0152848875,0.17430563],"genre_scores_gemma":[0.85548604,0.0013272631,0.11208726,0.00014476036,0.00006899189,0.00014637347,0.0060913214,0.0015105106,0.023137413],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999404,0.000012192445,0.000003278218,0.000014895407,0.000019109071,0.0000100648085],"domain_scores_gemma":[0.9998054,0.00008656736,0.000015264959,0.00002322887,0.000043996275,0.000025570187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104978135,0.00049539097,0.00020430968,0.0011458369,0.00029544372,0.0017922472,0.00025924004,0.0004021717,0.023129998],"category_scores_gemma":[0.0006172465,0.00019334217,0.0003146497,0.0020117566,0.0002467941,0.0010476949,0.00072005566,0.0005217024,0.001599877],"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.0022854821,0.0002130697,0.054173272,0.0023598208,0.00029009342,0.001158553,0.034847658,0.02441514,0.07432658,0.1204611,0.11472618,0.570743],"study_design_scores_gemma":[0.00013596058,0.00034541864,0.2345697,0.00079355726,0.00035066,0.0011256634,0.019520404,0.10241366,0.026507333,0.11402391,0.49993986,0.0002738646],"about_ca_topic_score_codex":0.0051350784,"about_ca_topic_score_gemma":0.0069283517,"teacher_disagreement_score":0.023129998,"about_ca_system_score_codex":0.0002573578,"about_ca_system_score_gemma":0.00026554,"threshold_uncertainty_score":0.07737756},"labels":[],"label_agreement":null},{"id":"W2430843852","doi":"10.1007/978-3-319-41114-9_5","title":"Unrestricted State Complexity of Binary Operations on Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Alphabet; Binary number; State (computer science); Product (mathematics); Combinatorics; Discrete mathematics; Quotient; Intersection (aeronautics); Time complexity; Mathematics; Regular language; Computer science; Arithmetic; Algorithm; Theoretical computer science; Automaton","score_opus":0.02201696527997163,"score_gpt":0.25859836794947844,"score_spread":0.2365814026695068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2430843852","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.63313276,0.0031760505,0.25359046,0.0027313977,0.00036062687,0.00021575278,0.0014015383,0.00071710563,0.104674324],"genre_scores_gemma":[0.9515674,0.001532245,0.029034084,0.00017907463,0.00033377088,0.00023971655,0.0011836208,0.0002631351,0.015667027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977781,0.0003626616,0.00015291304,0.00049078354,0.0007106991,0.00050475],"domain_scores_gemma":[0.99174607,0.00626933,0.00047708923,0.0008464516,0.00037665054,0.00028446162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096420816,0.0007332108,0.0008382485,0.0011457648,0.001204785,0.0046089925,0.0015955999,0.0008815579,0.008070671],"category_scores_gemma":[0.00772146,0.00060134224,0.0022192714,0.0015749787,0.0025260372,0.010906658,0.0029557268,0.0039258655,0.00089015043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033303164,0.00018754983,0.0016275626,0.00030570265,0.000060023933,0.00014085359,0.0008912415,0.038305093,0.007058956,0.91127205,0.0030153592,0.03680259],"study_design_scores_gemma":[0.000025770969,0.000077585275,0.0007918246,0.00003840786,0.000046094534,0.00011007757,0.00013672594,0.08993596,0.0045594852,0.90021455,0.0040243,0.000039185412],"about_ca_topic_score_codex":0.0015232553,"about_ca_topic_score_gemma":0.0011109615,"teacher_disagreement_score":0.008070671,"about_ca_system_score_codex":0.0027374472,"about_ca_system_score_gemma":0.0014362617,"threshold_uncertainty_score":0.026999116},"labels":[],"label_agreement":null},{"id":"W2437182874","doi":"10.1007/978-3-319-33618-3_20","title":"Speaker Classification via Supervised Hierarchical Clustering Using ICA Mixture Model","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixture model; Computer science; Cluster analysis; Pattern recognition (psychology); Artificial intelligence; TIMIT; Independent component analysis; Hierarchical clustering; Machine learning; Speech recognition; Hidden Markov model","score_opus":0.05107048488582587,"score_gpt":0.26526251848876903,"score_spread":0.21419203360294314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2437182874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037947092,0.00031541756,0.99269485,0.000044513996,0.000056133053,0.000029762185,0.000101838756,0.0018046756,0.001158059],"genre_scores_gemma":[0.103795335,0.0006531603,0.88315445,0.000105621635,0.00016326223,0.00016375715,0.0016881968,0.0008238307,0.009452408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990508,0.00020732619,0.000045878707,0.00030310082,0.0002863304,0.000106579064],"domain_scores_gemma":[0.99939454,0.00020474211,0.00003425734,0.00013561697,0.00020409373,0.000026708463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007882433,0.0013511453,0.0016112017,0.0013567597,0.0007657854,0.0009937638,0.0013686019,0.0010195834,0.0038865805],"category_scores_gemma":[0.0014914391,0.0006303408,0.0024450785,0.0013019831,0.0004428633,0.0010355464,0.0012901064,0.0016374743,0.008533423],"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.00027110198,0.000099658406,0.0006162393,0.00012694558,0.00020218767,0.00008029457,0.0001353911,0.030512739,0.06576726,0.0033918791,0.0079083955,0.89088804],"study_design_scores_gemma":[0.000019014135,0.000074163596,0.0022368028,0.00002089063,0.000121427474,0.0003093685,0.00006616868,0.95300454,0.030450853,0.0075621908,0.006076744,0.00005783594],"about_ca_topic_score_codex":0.002980578,"about_ca_topic_score_gemma":0.005602617,"teacher_disagreement_score":0.0038865805,"about_ca_system_score_codex":0.00034787887,"about_ca_system_score_gemma":0.0006772146,"threshold_uncertainty_score":0.013001919},"labels":[],"label_agreement":null},{"id":"W24407101","doi":"10.1007/11505877_17","title":"A Note on a Result of Daurat and Nivat","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"Université du Québec à Montréal","funders":"Centre National de la Recherche Scientifique","keywords":"Corollary; Reentrancy; Mathematics; Polyomino; Salient; Combinatorics; Property (philosophy); Square lattice; Valuation (finance); Lattice (music); Discrete mathematics; Computer science; Geometry; Statistical physics; Physics; Artificial intelligence; Philosophy","score_opus":0.01660863708907274,"score_gpt":0.2659872466039845,"score_spread":0.24937860951491175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24407101","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.009512212,0.13091667,0.21644078,0.17385988,0.07476955,0.0001671383,0.0018243298,0.0017685214,0.39074084],"genre_scores_gemma":[0.2203903,0.10255105,0.20677902,0.109699555,0.08786971,0.00083252374,0.0029749903,0.004558827,0.264344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955592,0.0012508758,0.00029541104,0.0009461513,0.0014655661,0.00048277833],"domain_scores_gemma":[0.99365485,0.0036238926,0.00022453147,0.00095152296,0.0011970404,0.00034808798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004314297,0.0025862455,0.0038036196,0.0059863534,0.006241478,0.004447075,0.004956478,0.004397582,0.016646514],"category_scores_gemma":[0.0148754185,0.00091216684,0.0053764936,0.007105785,0.00605588,0.014904563,0.010290564,0.009417997,0.008205194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001731622,0.00007651588,0.00034712214,0.00071482064,0.00010229303,0.00025704355,0.0004210447,0.0008283713,0.0010801975,0.7737311,0.17712982,0.04513844],"study_design_scores_gemma":[0.000027587706,0.0000424899,0.00056492124,0.00017096801,0.00009817763,0.00031844006,0.000069361966,0.0015355127,0.0007184765,0.81458217,0.18181159,0.00006032079],"about_ca_topic_score_codex":0.004716045,"about_ca_topic_score_gemma":0.002883763,"teacher_disagreement_score":0.016646514,"about_ca_system_score_codex":0.003328513,"about_ca_system_score_gemma":0.0022518963,"threshold_uncertainty_score":0.055688083},"labels":[],"label_agreement":null},{"id":"W2442922754","doi":"10.1007/978-3-319-50106-2_13","title":"Drawing Planar Graphs with Many Collinear Vertices","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Treewidth; Book embedding; Outerplanar graph; 1-planar graph; Mathematics; Clique-sum; Planarity testing; Planar; Wheel graph; Pathwidth; Vertex (graph theory); Discrete mathematics; Polyhedral graph; Planar straight-line graph; Graph; Chordal graph; Line graph; Computer science; Graph power","score_opus":0.012792202388363642,"score_gpt":0.2292935949276749,"score_spread":0.21650139253931125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2442922754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031853855,0.0005386164,0.9207672,0.00043259957,0.0002874573,0.00013692761,0.00037761166,0.002942513,0.042663317],"genre_scores_gemma":[0.22749992,0.001308782,0.7372007,0.00021101991,0.00013576479,0.0001820039,0.0011556208,0.0016792701,0.030626964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.000066953784,0.000023034007,0.0001467349,0.00018399012,0.00004983176],"domain_scores_gemma":[0.99946684,0.00022077201,0.000038283026,0.00012975979,0.00008901893,0.00005535573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029468842,0.002046277,0.0010286699,0.0010314909,0.0008284248,0.0014874168,0.0020998348,0.0011879875,0.02118931],"category_scores_gemma":[0.0016900791,0.0013327644,0.0008629456,0.0016032883,0.000916308,0.0023770018,0.0031631796,0.002399786,0.004340733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003109141,0.000119158896,0.00062698656,0.00085981895,0.0001558829,0.0006547286,0.0005585299,0.16030405,0.040947605,0.19895451,0.034569945,0.5619379],"study_design_scores_gemma":[0.00012655425,0.00022648582,0.0005711345,0.00020523532,0.000120224824,0.00088449137,0.00040672306,0.47476235,0.031165803,0.39123005,0.10020379,0.00009722537],"about_ca_topic_score_codex":0.0012305066,"about_ca_topic_score_gemma":0.0023028564,"teacher_disagreement_score":0.02118931,"about_ca_system_score_codex":0.0005863402,"about_ca_system_score_gemma":0.00034847183,"threshold_uncertainty_score":0.0708853},"labels":[],"label_agreement":null},{"id":"W244376972","doi":"10.1007/978-3-319-11737-9_21","title":"On the Formal Analysis of HMM Using Theorem Proving","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Hidden Markov model; Computer science; Mathematics; Natural language processing; Artificial intelligence","score_opus":0.019743993375926982,"score_gpt":0.25327196177820066,"score_spread":0.2335279684022737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W244376972","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.0026057686,0.00045382546,0.99179685,0.00046108867,0.000099127086,0.000046407855,0.000112111455,0.0008094844,0.00361543],"genre_scores_gemma":[0.20062283,0.0017706023,0.7850916,0.0009791245,0.00080913614,0.00036073072,0.0011981763,0.0013367349,0.0078310985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930917,0.0029621797,0.0005664615,0.0009919386,0.0017722952,0.00061531016],"domain_scores_gemma":[0.9707506,0.024008231,0.00059115945,0.0028569885,0.0015264832,0.00026662726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008938703,0.0015731751,0.0017498278,0.0025469675,0.0016238048,0.004280883,0.004743417,0.0015782823,0.01183083],"category_scores_gemma":[0.028395602,0.0014324336,0.004817988,0.0022122914,0.0058339755,0.010496077,0.0055760187,0.005692599,0.0024907426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106292224,0.000101696525,0.00067049114,0.00033342972,0.00008293234,0.00030434274,0.00043939584,0.026528804,0.0016377455,0.8907854,0.004752554,0.07425682],"study_design_scores_gemma":[0.000025764117,0.00003038347,0.00019685815,0.00008445377,0.000044533943,0.00011454613,0.00005118405,0.081378296,0.0017386503,0.9102713,0.0060350434,0.000028912895],"about_ca_topic_score_codex":0.0034860473,"about_ca_topic_score_gemma":0.0031755206,"teacher_disagreement_score":0.01183083,"about_ca_system_score_codex":0.0028072083,"about_ca_system_score_gemma":0.0019480156,"threshold_uncertainty_score":0.04727292},"labels":[],"label_agreement":null},{"id":"W244636295","doi":"10.1007/11945529_15","title":"Incremental Construction of k-Dominating Sets in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","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":"Carleton University","funders":"","keywords":"Dominating set; Connected dominating set; Combinatorics; Vertex (graph theory); Monotone polygon; Discrete mathematics; Unit disk graph; Graph; Mathematics; Computer science; Set (abstract data type); Wireless sensor network; Wireless network; Wireless; Computer network; Telecommunications","score_opus":0.014188598628928932,"score_gpt":0.2589777498402869,"score_spread":0.24478915121135794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W244636295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05591967,0.00030698424,0.9388279,0.00027668677,0.00006937258,0.00021389996,0.00033859658,0.00059900084,0.003447939],"genre_scores_gemma":[0.32797512,0.00035586272,0.6679523,0.00010041867,0.000037774982,0.00035645018,0.00093208253,0.0001574881,0.002132476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986827,0.00046420487,0.00010288091,0.0002521536,0.0003403312,0.00015776433],"domain_scores_gemma":[0.9959124,0.0024753183,0.00018427259,0.00069207454,0.0005210419,0.00021490808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012341934,0.0006727973,0.0013168117,0.0010558114,0.00095259194,0.0012944365,0.0030967174,0.00079088996,0.0022662652],"category_scores_gemma":[0.006480933,0.00087358366,0.0011987351,0.0014029312,0.0008599308,0.0026236286,0.0038371978,0.0012382742,0.00046224034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069443235,0.00030972846,0.0030973777,0.0010602511,0.00015655685,0.0004163637,0.0010164374,0.5273538,0.020221058,0.12188935,0.0070716213,0.31671304],"study_design_scores_gemma":[0.000057895053,0.00013174284,0.0006435803,0.00006131346,0.00005730717,0.00020231656,0.00022198056,0.89539576,0.006447411,0.09175737,0.0049921013,0.000031250154],"about_ca_topic_score_codex":0.001237662,"about_ca_topic_score_gemma":0.002363884,"teacher_disagreement_score":0.0030967174,"about_ca_system_score_codex":0.00088846585,"about_ca_system_score_gemma":0.0011138126,"threshold_uncertainty_score":0.007581413},"labels":[],"label_agreement":null},{"id":"W245430726","doi":"10.1007/978-3-319-93000-8","title":"Image Analysis and Recognition","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Focus (optics); Artificial intelligence; Image (mathematics); Image processing; Deep learning; Pattern recognition (psychology); Computer vision","score_opus":0.013412399638546228,"score_gpt":0.27905493491657435,"score_spread":0.2656425352780281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W245430726","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.0017512294,0.021317339,0.7543267,0.0011522813,0.004030775,0.00018903079,0.0013501018,0.010577645,0.20530495],"genre_scores_gemma":[0.013161655,0.015988925,0.23127814,0.00079795107,0.0015163665,0.00020483368,0.0034794917,0.002013731,0.73155886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946064,0.000029279938,0.00002600422,0.00014296663,0.00030768965,0.000033539407],"domain_scores_gemma":[0.99951804,0.000082575,0.000017294436,0.0001755343,0.00017579364,0.000030820083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042888068,0.0016638024,0.0011837267,0.0022158003,0.0004894214,0.0025535831,0.0016768769,0.001052199,0.10466529],"category_scores_gemma":[0.0008688714,0.0006603304,0.0009011612,0.0022004743,0.00068779907,0.0019179299,0.001578283,0.0014597581,0.1232193],"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.00003480375,0.000026424552,0.00005814302,0.00029446447,0.000024853367,0.00004802432,0.000031512667,0.0010363959,0.013794364,0.0106580155,0.1529931,0.82099986],"study_design_scores_gemma":[0.000009346913,0.000059613547,0.00066961005,0.00012537008,0.000037327303,0.00073447655,0.00004510461,0.011204836,0.02387886,0.024179839,0.93901545,0.000040113624],"about_ca_topic_score_codex":0.0007823891,"about_ca_topic_score_gemma":0.0013279945,"teacher_disagreement_score":0.10466529,"about_ca_system_score_codex":0.00043518728,"about_ca_system_score_gemma":0.00055050483,"threshold_uncertainty_score":0.3501402},"labels":[],"label_agreement":null},{"id":"W2460072725","doi":"10.1007/978-3-319-34111-8_29","title":"Learning Statistically Significant Contrast Sets","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Contrast (vision); Association rule learning; Computer science; Classifier (UML); Artificial intelligence; Machine learning; Data mining; Set (abstract data type); Pattern recognition (psychology)","score_opus":0.01489813950887214,"score_gpt":0.2539503358103343,"score_spread":0.23905219630146218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460072725","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.054432515,0.0013237689,0.9340052,0.00068513496,0.00016482873,0.00009602189,0.00046814425,0.0024892993,0.006335082],"genre_scores_gemma":[0.4841314,0.00088145235,0.503282,0.00034266393,0.0003376604,0.00023777153,0.003351452,0.0004927861,0.0069428002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873096,0.00034560883,0.00006699971,0.00049599085,0.00027609602,0.00008435113],"domain_scores_gemma":[0.9952259,0.0033789736,0.00031322276,0.0006369806,0.0003186551,0.00012621054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023295106,0.001395822,0.0012517589,0.002685536,0.00071018055,0.0023455266,0.0022482204,0.0014110603,0.0059878407],"category_scores_gemma":[0.011258533,0.0008383771,0.0017902802,0.0015126409,0.0012178894,0.003050051,0.00321764,0.0029015692,0.002146129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057043624,0.00029343233,0.006837931,0.0004108477,0.00044089695,0.0004084254,0.00020837554,0.044372495,0.022498144,0.06620222,0.011047698,0.8467092],"study_design_scores_gemma":[0.000083356266,0.00039882853,0.003557284,0.00012939525,0.00022325618,0.0007018448,0.00016582702,0.73076546,0.022040002,0.23125173,0.010618159,0.00006484294],"about_ca_topic_score_codex":0.00040895105,"about_ca_topic_score_gemma":0.00085689337,"teacher_disagreement_score":0.0059878407,"about_ca_system_score_codex":0.0007086931,"about_ca_system_score_gemma":0.0007698437,"threshold_uncertainty_score":0.020031393},"labels":[],"label_agreement":null},{"id":"W2460464989","doi":"10.1007/978-3-319-28712-6_16","title":"Detecting Myocardial Infarction Using Medial Surfaces","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Context (archaeology); Medial axis; Endocardium; Myocardial infarction; RADIUS; Surface (topology); Geometry; Artificial intelligence; Computer science; Anatomy; Mathematics; Medicine; Cardiology; Geology","score_opus":0.023704478010662052,"score_gpt":0.281636014942724,"score_spread":0.25793153693206194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460464989","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.065868534,0.008654347,0.9086041,0.0005879393,0.0003253882,0.0001617949,0.0005743936,0.003661382,0.0115621835],"genre_scores_gemma":[0.34088635,0.0085039465,0.632614,0.0002311748,0.0006042368,0.00007686728,0.0012503759,0.00074828806,0.015084765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997209,0.000028403592,0.000017907361,0.00005373759,0.00014413286,0.00003506553],"domain_scores_gemma":[0.9996196,0.00016042373,0.00003681661,0.00005243896,0.000093376344,0.000037312744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046594266,0.0010758569,0.00075286726,0.0024232583,0.00024387703,0.0016457739,0.0008829235,0.001057684,0.0042263386],"category_scores_gemma":[0.0012858491,0.0006811649,0.0007770313,0.0013008831,0.00035118102,0.0010829918,0.00082118047,0.0005464132,0.003268018],"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.00034589012,0.00004680109,0.0029049043,0.00026461654,0.00007470767,0.0005309534,0.0001273595,0.0051498343,0.09418457,0.0030921483,0.0046902657,0.8885881],"study_design_scores_gemma":[0.00013327344,0.0009073529,0.024660697,0.00049226853,0.00053177914,0.016322846,0.0005304523,0.64821666,0.20131764,0.040321507,0.06634978,0.00021579233],"about_ca_topic_score_codex":0.0005139345,"about_ca_topic_score_gemma":0.00085918995,"teacher_disagreement_score":0.0042263386,"about_ca_system_score_codex":0.00014434614,"about_ca_system_score_gemma":0.00026758944,"threshold_uncertainty_score":0.01413846},"labels":[],"label_agreement":null},{"id":"W2460803088","doi":"10.1007/978-3-319-31808-0_9","title":"Left Atrial Wall Segmentation from CT for Radiofrequency Catheter Ablation Planning","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Atrial Fibrillation Management and Outcomes","field":"Medicine","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":"Western University","funders":"","keywords":"Computer science; Catheter; Ablation; Segmentation; Catheter ablation; Computer vision; Radiofrequency ablation; Artificial intelligence; Radiology; Medicine; Cardiology","score_opus":0.049811240328232816,"score_gpt":0.31964978591178633,"score_spread":0.2698385455835535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460803088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014959274,0.0057051177,0.964834,0.00059432304,0.000241123,0.00013647688,0.0007437609,0.002752875,0.01003299],"genre_scores_gemma":[0.13571878,0.007734293,0.84223986,0.0004138004,0.00036809364,0.00015610216,0.0018702913,0.001596239,0.009902587],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999261,0.000013733707,0.0000070782903,0.000016473976,0.000028430592,0.000008194705],"domain_scores_gemma":[0.9997223,0.00018319197,0.00001650795,0.000025849424,0.000037705213,0.000014426419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002625598,0.00063618,0.00030401332,0.00090278586,0.00014751458,0.0010661534,0.0005465973,0.0007037045,0.004934404],"category_scores_gemma":[0.0011279441,0.0005334134,0.0006403344,0.0005553915,0.00016378034,0.0005302393,0.00048114196,0.0006619081,0.0024268504],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013691287,0.000030198662,0.0012488685,0.00039683492,0.000050128787,0.0008185158,0.00012298778,0.040094197,0.0761891,0.0037629039,0.01978503,0.85736424],"study_design_scores_gemma":[0.000051241732,0.00018996121,0.0076952376,0.00072333135,0.00023023084,0.009497313,0.00013640948,0.7487309,0.11338998,0.023085505,0.09613439,0.00013546673],"about_ca_topic_score_codex":0.0012139017,"about_ca_topic_score_gemma":0.002094519,"teacher_disagreement_score":0.004934404,"about_ca_system_score_codex":0.00020288498,"about_ca_system_score_gemma":0.00037581407,"threshold_uncertainty_score":0.016507208},"labels":[],"label_agreement":null},{"id":"W2461678157","doi":"10.1007/978-3-319-49175-2_7","title":"Detecting Algebraic Manipulation in Leaky Storage Systems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Code word; Adversary; Code (set theory); Upper and lower bounds; Algebraic number; Binary logarithm; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm; Decoding methods; Computer security","score_opus":0.019638891446530308,"score_gpt":0.23647081967447642,"score_spread":0.2168319282279461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461678157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.270329,0.0010573,0.71200633,0.0010551163,0.0002512563,0.0001507573,0.00040850148,0.0060042827,0.008737437],"genre_scores_gemma":[0.91510874,0.00032401842,0.07984319,0.00016567647,0.00010437689,0.000058447877,0.0002966872,0.00029041237,0.0038083754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543035,0.00068836886,0.00034336722,0.0006435877,0.002360732,0.00053352653],"domain_scores_gemma":[0.9879903,0.00615166,0.0013547405,0.0029873298,0.0012899118,0.00022592941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014643715,0.00075121224,0.0010597277,0.0011613657,0.0010632651,0.0028178697,0.0015097298,0.001670868,0.0032620386],"category_scores_gemma":[0.015436187,0.00082813326,0.00073676126,0.0012691765,0.002661358,0.0070331558,0.0055824607,0.0026091225,0.0007900632],"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.0018844724,0.00027726765,0.014515593,0.0010613876,0.0002588711,0.001436397,0.0020632006,0.08970577,0.09212391,0.46449924,0.013911572,0.3182623],"study_design_scores_gemma":[0.00008236443,0.00031977726,0.0017801231,0.000149778,0.00008755999,0.0012027698,0.0004685933,0.4104906,0.119067386,0.45743278,0.0087912455,0.00012703738],"about_ca_topic_score_codex":0.0004917045,"about_ca_topic_score_gemma":0.0005288064,"teacher_disagreement_score":0.0032620386,"about_ca_system_score_codex":0.00090354064,"about_ca_system_score_gemma":0.0009061819,"threshold_uncertainty_score":0.010912597},"labels":[],"label_agreement":null},{"id":"W2462453985","doi":"10.1007/978-3-662-50539-7_13","title":"Toward the Formalization of BPEL","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université Laval","funders":"","keywords":"Business Process Execution Language; Orchestration; Computer science; Web service; Programming language; Programmer; Software engineering; Semantics (computer science); World Wide Web; Service-oriented architecture","score_opus":0.014670305615576995,"score_gpt":0.2279439522599892,"score_spread":0.2132736466444122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462453985","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.0019521088,0.0011930383,0.9866232,0.0009059415,0.00024071471,0.000039928236,0.000061957995,0.00089792156,0.008085164],"genre_scores_gemma":[0.07580682,0.0037023427,0.9060561,0.00063710375,0.000480019,0.00017114184,0.00033342125,0.00073830935,0.012074825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979086,0.0005422084,0.00020820722,0.00031334785,0.0008764827,0.00015120293],"domain_scores_gemma":[0.99764866,0.0010102729,0.000119669414,0.0004728519,0.00065957644,0.00008902486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00308138,0.0010807769,0.0006586868,0.0011968224,0.00089340226,0.0042675654,0.0026106094,0.0011794155,0.0051277704],"category_scores_gemma":[0.0059893276,0.001447098,0.0016042076,0.0012732678,0.0038210226,0.006081896,0.0025242597,0.006279244,0.0028286064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030314493,0.000041659496,0.00008289216,0.00025499173,0.000016004913,0.0000689369,0.0004088758,0.008063922,0.0024942276,0.91905576,0.0030799059,0.066402495],"study_design_scores_gemma":[0.000026635185,0.00003227594,0.00006932612,0.0002462437,0.00002592688,0.00011575712,0.00008370289,0.051262327,0.006106951,0.847893,0.09410838,0.00002954723],"about_ca_topic_score_codex":0.002870397,"about_ca_topic_score_gemma":0.0020542666,"teacher_disagreement_score":0.0051277704,"about_ca_system_score_codex":0.0017206284,"about_ca_system_score_gemma":0.0022530786,"threshold_uncertainty_score":0.017154038},"labels":[],"label_agreement":null},{"id":"W2462702302","doi":"10.1007/978-3-319-34111-8_18","title":"Poetry Chronological Classification: Hafez","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Islamic Studies and History","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Poetry; Computer science; Artificial intelligence; Art; Literature","score_opus":0.03771267464800707,"score_gpt":0.2823489563217367,"score_spread":0.2446362816737296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462702302","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013759243,0.06647652,0.010555705,0.016642949,0.022508655,0.00035654567,0.0024029429,0.00042097695,0.8668764],"genre_scores_gemma":[0.23667929,0.05099247,0.012249928,0.0033479778,0.008177642,0.0002878943,0.00454443,0.00068757514,0.6830328],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996455,0.00008640424,0.000036871188,0.00007951062,0.00009766599,0.000054016476],"domain_scores_gemma":[0.9993999,0.00012611086,0.00005217943,0.00005067726,0.00032659888,0.000044589393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006779501,0.00072503963,0.00048416396,0.0056190877,0.003642588,0.0036138836,0.00042302898,0.0007585294,0.030545669],"category_scores_gemma":[0.0015443137,0.00017104004,0.00018642403,0.00454778,0.0028808606,0.003920739,0.0010737323,0.0016168439,0.010877012],"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.00010761291,0.00003971965,0.0006735255,0.00041583047,0.000006533152,0.00017266358,0.005363759,0.00011516127,0.0008098965,0.2992933,0.39226148,0.30074057],"study_design_scores_gemma":[0.0000037641598,0.000013717035,0.0008535412,0.00015988345,0.0000021209069,0.00020341456,0.0012638425,0.000060688853,0.0002060313,0.0073588174,0.989869,0.000005304749],"about_ca_topic_score_codex":0.005106001,"about_ca_topic_score_gemma":0.004870629,"teacher_disagreement_score":0.030545669,"about_ca_system_score_codex":0.0019646185,"about_ca_system_score_gemma":0.0017222983,"threshold_uncertainty_score":0.10218549},"labels":[],"label_agreement":null},{"id":"W2462808032","doi":"10.1007/978-3-662-49784-5_3","title":"Dynamic Materialization for Building Personalized Smart Cubes","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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 Ottawa","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.00901626295365845,"score_gpt":0.22337936254085244,"score_spread":0.214363099587194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462808032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03300257,0.0014184534,0.9208135,0.00023571673,0.00018215246,0.00007308956,0.00040830442,0.0020899472,0.04177618],"genre_scores_gemma":[0.5560266,0.0024902367,0.4051878,0.00019305498,0.000093269955,0.00022539162,0.0014366859,0.0007512452,0.033595826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998394,0.000016219328,0.0000057947514,0.000031421816,0.00008291599,0.000024077195],"domain_scores_gemma":[0.99993336,0.000015713875,0.000006565941,0.000026367035,0.000011922947,0.000006035322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014136282,0.0007805642,0.0005817406,0.00044089384,0.00044186876,0.0009021724,0.001003512,0.00047067384,0.012415376],"category_scores_gemma":[0.0002672682,0.00040549706,0.0005714241,0.0006874412,0.00039952016,0.0012482093,0.0015690095,0.00074822543,0.0020820878],"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.00020457529,0.00016398316,0.0005423746,0.0004580008,0.00007312933,0.00026245575,0.00019361303,0.362729,0.17362839,0.07856647,0.014892783,0.3682853],"study_design_scores_gemma":[0.00003762884,0.00018651279,0.00065306335,0.00006856961,0.000045198645,0.00045728617,0.00017113384,0.7918144,0.066787176,0.053929288,0.08578922,0.000060585047],"about_ca_topic_score_codex":0.00054019666,"about_ca_topic_score_gemma":0.001142838,"teacher_disagreement_score":0.012415376,"about_ca_system_score_codex":0.0003290959,"about_ca_system_score_gemma":0.00024853062,"threshold_uncertainty_score":0.04153359},"labels":[],"label_agreement":null},{"id":"W2463733835","doi":"10.1007/978-3-319-34111-8_6","title":"Gaussian Neuron in Deep Belief Network for Sentiment Prediction","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Artificial intelligence; Gaussian; Gaussian process; Sentiment analysis; Deep belief network; Artificial neural network; Machine learning","score_opus":0.011674106813574982,"score_gpt":0.22216150511168256,"score_spread":0.2104873982981076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463733835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021624047,0.002419409,0.9685897,0.00068284915,0.00033810223,0.000027441563,0.00033643498,0.0011716167,0.0048103794],"genre_scores_gemma":[0.696894,0.0027726153,0.25969997,0.00045408614,0.00034890347,0.0001118333,0.001327692,0.0003962548,0.037994698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998826,0.000028683358,0.0000061852766,0.000034619396,0.000028211505,0.00001965883],"domain_scores_gemma":[0.99981517,0.00008721614,0.000011319986,0.000020686864,0.000054229444,0.000011388898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038699844,0.00048286535,0.00054543803,0.00025265434,0.00019091016,0.000598231,0.0008342361,0.00089776993,0.0034262678],"category_scores_gemma":[0.0012156073,0.00034994984,0.0004121719,0.00049860694,0.00030063238,0.00084332784,0.00083736796,0.0014289097,0.0013736391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021835024,0.000093804214,0.0010015445,0.0001630744,0.00010314372,0.00010058466,0.000076140925,0.48646483,0.010672021,0.04072122,0.018008295,0.44237697],"study_design_scores_gemma":[0.0000023320454,0.0000071283525,0.00007279662,0.000004612446,0.000006188969,0.000006428253,0.000002462065,0.9893668,0.0009239231,0.008852659,0.0007518068,0.0000028612797],"about_ca_topic_score_codex":0.004625275,"about_ca_topic_score_gemma":0.0058804946,"teacher_disagreement_score":0.004625275,"about_ca_system_score_codex":0.00054811995,"about_ca_system_score_gemma":0.00041443305,"threshold_uncertainty_score":0.011461973},"labels":[],"label_agreement":null},{"id":"W24640360","doi":"10.1007/978-3-319-06483-3_6","title":"Analysis of Feature Maps Selection in Supervised Learning Using Convolutional Neural Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":33,"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; Convolutional neural network; Artificial intelligence; Pattern recognition (psychology); Feature (linguistics); Kernel (algebra); Field (mathematics); Deep learning; Receptive field; Feature selection; Object (grammar); Machine learning; Mathematics","score_opus":0.016290564706748452,"score_gpt":0.24313048378361501,"score_spread":0.22683991907686657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24640360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21835716,0.0015014947,0.7760154,0.0003161726,0.00005898548,0.00006770113,0.00023576939,0.0011131356,0.0023341759],"genre_scores_gemma":[0.88261175,0.0003411661,0.11232218,0.000060477316,0.00006778152,0.00006971613,0.0007712616,0.00021437943,0.0035413196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.00025702358,0.000042314176,0.00014783515,0.0002630851,0.0000862518],"domain_scores_gemma":[0.99312395,0.005271328,0.00027532154,0.00041941486,0.00081687345,0.00009311729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021614167,0.00054404733,0.0008042932,0.0008515977,0.00039788027,0.0008712241,0.001130444,0.0006248956,0.0018908782],"category_scores_gemma":[0.007273794,0.00028995454,0.0005724045,0.00083487824,0.00043373567,0.0011929838,0.00060185685,0.00082120515,0.00027696582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072962174,0.00030168038,0.009957045,0.0002219694,0.00020638644,0.00018380968,0.00010411437,0.4920915,0.011484427,0.0139949275,0.005839296,0.46488535],"study_design_scores_gemma":[0.000003673921,0.000017518805,0.00094453536,0.0000038325925,0.000008856856,0.000014971045,0.000006242104,0.99552274,0.0013196634,0.0020235723,0.00013135296,0.0000030374015],"about_ca_topic_score_codex":0.0038145883,"about_ca_topic_score_gemma":0.0049730875,"teacher_disagreement_score":0.0038145883,"about_ca_system_score_codex":0.0008139303,"about_ca_system_score_gemma":0.0009468158,"threshold_uncertainty_score":0.0114308},"labels":[],"label_agreement":null},{"id":"W2464694747","doi":"10.1007/978-3-319-43681-4_9","title":"The Gene Family-Free Median of Three","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Breakpoint; Adjacency list; Computational biology; Gene family; Gene; Similarity (geometry); Comparative genomics; Genetics; Graph; Gene prediction; Sequence (biology); Extant taxon; Biology; Genomics; Combinatorics; Computer science; Mathematics; Artificial intelligence; Evolutionary biology","score_opus":0.013326989472017992,"score_gpt":0.24279449548607634,"score_spread":0.22946750601405835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464694747","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.09138888,0.00022403423,0.9038665,0.00029759383,0.00002537804,0.000049165752,0.0006218107,0.0004965948,0.0030299996],"genre_scores_gemma":[0.38303274,0.00023928269,0.6107511,0.00014680007,0.000034361856,0.00017826652,0.0016561947,0.0003264091,0.0036348568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993242,0.00015790001,0.000027986147,0.00028795534,0.00012156687,0.000080457066],"domain_scores_gemma":[0.99863005,0.00080944964,0.00017151482,0.00018858592,0.00008960081,0.00011077357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010431092,0.0006143604,0.0011962792,0.0011348326,0.0010510619,0.0014412552,0.0020590748,0.001532755,0.0072247186],"category_scores_gemma":[0.003533775,0.0006119253,0.0020078516,0.0014748914,0.0011580008,0.0035170976,0.0017048377,0.0016894853,0.0005884593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021218327,0.00011338574,0.0021270558,0.0001711099,0.00005857609,0.00015219064,0.0002023335,0.8176565,0.005229057,0.09855509,0.003242638,0.07227978],"study_design_scores_gemma":[0.000023001317,0.0000802394,0.00043819274,0.000019253028,0.000017476534,0.00010595449,0.00008531507,0.86050916,0.0025511328,0.13254127,0.0036042915,0.000024635427],"about_ca_topic_score_codex":0.0029429917,"about_ca_topic_score_gemma":0.003271651,"teacher_disagreement_score":0.0072247186,"about_ca_system_score_codex":0.0018022945,"about_ca_system_score_gemma":0.0011577173,"threshold_uncertainty_score":0.024169087},"labels":[],"label_agreement":null},{"id":"W2465284391","doi":"","title":"The winning entry of the SAM 2002 design contest: a case study of the effectiveness of SDL and MSC","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"CONTEST; Computer science; Software engineering; Strengths and weaknesses; Process (computing); Iterative and incremental development; Design process; Programming language; Operations research; Engineering management; Work in process; Operations management","score_opus":0.017996635828698926,"score_gpt":0.26976015517394314,"score_spread":0.2517635193452442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465284391","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.96301466,0.00014746751,0.0045944205,0.0036215235,0.0001437897,0.00026382157,0.000080554004,0.00017462453,0.02795909],"genre_scores_gemma":[0.98400855,0.0000449897,0.0058566914,0.00032114433,0.000022752189,0.00011552488,0.00008598387,0.0001112767,0.009433044],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9758616,0.015039397,0.00086110766,0.0011227796,0.004955689,0.0021594209],"domain_scores_gemma":[0.9245265,0.049280714,0.0035722055,0.0033736818,0.008563904,0.0106829535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032117594,0.0007486095,0.0008369668,0.001425188,0.008383818,0.008472071,0.0023042525,0.004225361,0.007077551],"category_scores_gemma":[0.052110277,0.0007905972,0.0007028985,0.0011703166,0.003131101,0.0039858613,0.0038002352,0.004054748,0.0010779087],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0117341885,0.018849881,0.059080943,0.0017997989,0.00028232828,0.008369627,0.31306538,0.014321005,0.02579188,0.08527107,0.04633228,0.41510165],"study_design_scores_gemma":[0.003646527,0.027575668,0.08958931,0.00095357274,0.000419407,0.0029809067,0.30986196,0.07765442,0.041925766,0.034689263,0.4099739,0.00072931754],"about_ca_topic_score_codex":0.010135577,"about_ca_topic_score_gemma":0.026934173,"teacher_disagreement_score":0.032117594,"about_ca_system_score_codex":0.006193272,"about_ca_system_score_gemma":0.007917994,"threshold_uncertainty_score":0.16985607},"labels":[],"label_agreement":null},{"id":"W2465323314","doi":"10.1007/978-3-319-33618-3_32","title":"Digital Watermarking Scheme Based on Arnold and Anti-Arnold Transforms","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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":"Concordia University","funders":"","keywords":"Digital watermarking; Watermark; Discrete cosine transform; Computer science; Cover (algebra); Singular value decomposition; Robustness (evolution); Image (mathematics); Scheme (mathematics); Embedding; Artificial intelligence; Computer vision; Digital image; Image processing; Algorithm; Mathematics","score_opus":0.010755080751678026,"score_gpt":0.22320149852731963,"score_spread":0.2124464177756416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465323314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2708616,0.0031251083,0.6881705,0.0004910181,0.00072689157,0.000158584,0.00017988216,0.0011356052,0.03515082],"genre_scores_gemma":[0.81434876,0.0016562012,0.16070803,0.00009383264,0.00018996155,0.000056083376,0.0001832321,0.000050855135,0.022713056],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998605,0.000016305967,0.000009682696,0.000027365018,0.00006834275,0.000017834273],"domain_scores_gemma":[0.9997979,0.00004342432,0.000029444078,0.000044271757,0.00007130378,0.000013698279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012595237,0.00030974613,0.00038803575,0.00058192573,0.00029703495,0.0004193268,0.000362409,0.00042658974,0.0019301911],"category_scores_gemma":[0.00038788526,0.00012273718,0.00027766434,0.00044043138,0.00028050394,0.0008766188,0.00033508393,0.00041645858,0.00055907696],"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.0006740203,0.00011819361,0.0006300888,0.000244325,0.000040347026,0.0003507613,0.00012819105,0.0068853875,0.62259674,0.050743427,0.0016183447,0.3159702],"study_design_scores_gemma":[0.0001692931,0.0008955212,0.0022265483,0.00005172857,0.00017303691,0.003439149,0.00009385218,0.2571343,0.6905394,0.016873984,0.028305698,0.00009743311],"about_ca_topic_score_codex":0.00010514785,"about_ca_topic_score_gemma":0.00017242863,"teacher_disagreement_score":0.0019301911,"about_ca_system_score_codex":0.00013186708,"about_ca_system_score_gemma":0.00022295162,"threshold_uncertainty_score":0.0064570904},"labels":[],"label_agreement":null},{"id":"W2465441781","doi":"10.1007/978-3-319-34111-8_28","title":"Flexible Approximators for Approximating Fixpoint Theory","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Rotation formalisms in three dimensions; Computer science; Fixed point; Non-monotonic logic; Operator (biology); Theoretical computer science; Knowledge representation and reasoning; Semantics (computer science); Default logic; Logical consequence; Algebra over a field; Negation; Algorithm; Artificial intelligence; Mathematics; Description logic; Programming language; Autoepistemic logic; Pure mathematics; Multimodal logic","score_opus":0.018962534733796284,"score_gpt":0.2474889166451792,"score_spread":0.22852638191138291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465441781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01310437,0.0009307036,0.9773548,0.00024823225,0.00014843192,0.000043647273,0.00012376784,0.001214065,0.0068319165],"genre_scores_gemma":[0.35554197,0.0014408126,0.6246254,0.00027554398,0.00029233148,0.00031265954,0.001060578,0.001232782,0.015218061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671906,0.00083747966,0.00022293242,0.0006443865,0.001257038,0.00031903764],"domain_scores_gemma":[0.99259126,0.0041995854,0.00024452776,0.002224092,0.00056119624,0.0001792222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033795168,0.00180724,0.0020431294,0.0023759753,0.0010518548,0.003601335,0.004070992,0.0019492778,0.009846644],"category_scores_gemma":[0.018239778,0.0011831429,0.0025523943,0.0026302014,0.00292943,0.0070546707,0.0053732255,0.007391397,0.0025181463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038550206,0.00008860781,0.00077730796,0.0003106284,0.00010935889,0.00010082734,0.00049404317,0.07029317,0.0030603854,0.74191666,0.0055981306,0.17686538],"study_design_scores_gemma":[0.0000393576,0.00006577231,0.00014297708,0.00010084745,0.00006805691,0.00009535796,0.00009558449,0.28047478,0.0022167838,0.708135,0.008535911,0.000029552071],"about_ca_topic_score_codex":0.0018491335,"about_ca_topic_score_gemma":0.002363006,"teacher_disagreement_score":0.009846644,"about_ca_system_score_codex":0.0027053542,"about_ca_system_score_gemma":0.001070643,"threshold_uncertainty_score":0.032940328},"labels":[],"label_agreement":null},{"id":"W2465986318","doi":"10.1007/978-3-319-40648-0_26","title":"Hierarchical Verification of Quantum Circuits","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automated theorem proving; HOL; Formal verification; Theoretical computer science; Electronic circuit; Quantum computer; Quantum; Quantum gate; Gas meter prover; Quantum circuit; Formal methods; Factoring; Quantum logic; Computer engineering; Programming language; Algorithm; Quantum network; Mathematics; Quantum mechanics; Physics","score_opus":0.015218145375567095,"score_gpt":0.23943304279271807,"score_spread":0.22421489741715098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465986318","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.07137533,0.0012997217,0.83746743,0.00160403,0.00033199164,0.00025587328,0.0005658964,0.0023721654,0.08472765],"genre_scores_gemma":[0.80021924,0.000728531,0.17878175,0.00040731265,0.00024775037,0.0001829286,0.0009841117,0.00037026993,0.018078128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799,0.00059473666,0.000101249236,0.00034523517,0.0006739628,0.00029484363],"domain_scores_gemma":[0.9957917,0.0021169037,0.00015451033,0.0013533797,0.00042806548,0.0001554118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567417,0.0006161891,0.0010131598,0.0009629573,0.0013556825,0.0021638412,0.002043885,0.0012056493,0.014194482],"category_scores_gemma":[0.005627273,0.00086746045,0.0013033274,0.0009083577,0.0033941437,0.0050287,0.0038853053,0.0032926365,0.0021506238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009292865,0.00003119156,0.00015120591,0.00012844641,0.000016213266,0.000040002127,0.00013274624,0.008275214,0.0052957507,0.95450836,0.0024782426,0.028849633],"study_design_scores_gemma":[0.000022430035,0.000023112132,0.00016080144,0.00002740543,0.000011631379,0.000026841883,0.000029135836,0.037020717,0.006201051,0.9506271,0.005834722,0.00001498129],"about_ca_topic_score_codex":0.0012028109,"about_ca_topic_score_gemma":0.0018654222,"teacher_disagreement_score":0.014194482,"about_ca_system_score_codex":0.0021519002,"about_ca_system_score_gemma":0.0014379682,"threshold_uncertainty_score":0.047485292},"labels":[],"label_agreement":null},{"id":"W2466075365","doi":"10.1007/978-3-319-34111-8_1","title":"Action Recognition by Pairwise Proximity Function Support Vector Machines with Dynamic Time Warping Kernels","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Dalhousie University","funders":"","keywords":"Dynamic time warping; Computer science; Artificial intelligence; Pattern recognition (psychology); Similarity measure; Support vector machine; Kernel (algebra); Similarity (geometry); Pairwise comparison; Outlier; k-nearest neighbors algorithm; Kernel method; Context (archaeology); Machine learning; Mathematics; Image (mathematics)","score_opus":0.016113775792575925,"score_gpt":0.23213213969321914,"score_spread":0.21601836390064322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466075365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0203518,0.00037960516,0.9767318,0.000078288,0.00009474981,0.000035023142,0.00007791521,0.0011712249,0.0010797466],"genre_scores_gemma":[0.49848357,0.0006731568,0.49042624,0.00013316493,0.000121919984,0.00013668214,0.0006217287,0.0002790188,0.009124478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931395,0.00008830805,0.000039331502,0.00024775392,0.00022354137,0.00008720459],"domain_scores_gemma":[0.9993869,0.00016564385,0.00006986898,0.00014556349,0.00018169341,0.000050394712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610019,0.0009768361,0.0014542505,0.00083751837,0.00035108146,0.0011218576,0.0014688253,0.0010554725,0.0030829783],"category_scores_gemma":[0.0017737352,0.0004888736,0.0010920126,0.0014173021,0.00042515062,0.0017306941,0.0019093099,0.0016241557,0.0022504218],"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.00019286541,0.00011475506,0.0006201511,0.00006911668,0.00007379265,0.00008389024,0.00004899494,0.04855649,0.02284223,0.00420845,0.0030923793,0.9200969],"study_design_scores_gemma":[0.000004439855,0.00006354818,0.0005162678,0.000007739774,0.0000166918,0.000106240936,0.000019016043,0.9847184,0.008776351,0.004500244,0.0012578389,0.0000133031435],"about_ca_topic_score_codex":0.00204759,"about_ca_topic_score_gemma":0.0019593579,"teacher_disagreement_score":0.0030829783,"about_ca_system_score_codex":0.00041635716,"about_ca_system_score_gemma":0.0005137324,"threshold_uncertainty_score":0.01031363},"labels":[],"label_agreement":null},{"id":"W2466150543","doi":"10.1007/978-3-319-48532-4_10","title":"Minimum Rectilinear Polygons for Given Angle Sequences","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 British Columbia","funders":"","keywords":"Rectilinear polygon; Monotone polygon; Polygon covering; Polygon (computer graphics); Star-shaped polygon; Point in polygon; Equiangular polygon; Simple polygon; Sequence (biology); Bounding overwatch; Minimum bounding box; Combinatorics; Mathematics; Boundary (topology); Computer science; Perimeter; Regular polygon; Geometry; Computer vision; Artificial intelligence; Mathematical analysis; Convex set","score_opus":0.02373237838531204,"score_gpt":0.2672468927582432,"score_spread":0.24351451437293117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466150543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089219,0.0007990273,0.8204137,0.000352929,0.00022460183,0.00019255877,0.0020459099,0.0010065002,0.08574577],"genre_scores_gemma":[0.28682822,0.0015497636,0.663159,0.00012649014,0.000096050746,0.00032040558,0.0044364817,0.0017637288,0.041719876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961424,0.00005789119,0.000029190138,0.00009438512,0.00015265876,0.00005164943],"domain_scores_gemma":[0.9993849,0.0002749329,0.00008628621,0.000110863024,0.00010298231,0.0000401386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026432757,0.00095399655,0.00092378503,0.0009620439,0.00043088762,0.0015325221,0.0011808472,0.0007968689,0.013711965],"category_scores_gemma":[0.0027395724,0.000761832,0.0006704454,0.0012909262,0.0006100612,0.0021707965,0.001108074,0.001877386,0.002719953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034850335,0.00010078996,0.0005935766,0.00090401276,0.000027129525,0.00022379811,0.00041599816,0.0972413,0.015939686,0.5596683,0.018943567,0.3055934],"study_design_scores_gemma":[0.00009046297,0.0001841835,0.0009834212,0.00024087804,0.000031966665,0.0007757484,0.00033811023,0.24328849,0.01537254,0.67311585,0.065526575,0.00005172971],"about_ca_topic_score_codex":0.00080726197,"about_ca_topic_score_gemma":0.0012480257,"teacher_disagreement_score":0.013711965,"about_ca_system_score_codex":0.00057224,"about_ca_system_score_gemma":0.0003887702,"threshold_uncertainty_score":0.04587108},"labels":[],"label_agreement":null},{"id":"W2466842698","doi":"10.1007/978-3-319-30024-5_14","title":"A Knowledge Based Framework for Link Prediction in Social Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Windsor","funders":"","keywords":"Computer science; State (computer science); Social network (sociolinguistics); Current (fluid); Data mining; Link (geometry); Artificial intelligence; Social network analysis; Machine learning; Algorithm; Computer network; Social media","score_opus":0.018080417114593197,"score_gpt":0.2841137369816817,"score_spread":0.2660333198670885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466842698","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.004055487,0.00044982065,0.9925442,0.00026650354,0.000050277522,0.000061546576,0.0006192926,0.00085780834,0.001095185],"genre_scores_gemma":[0.22870976,0.0012633796,0.7596772,0.00032081566,0.00035749047,0.00041629645,0.003225905,0.00019681404,0.0058324505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985985,0.00036390548,0.00011175305,0.00036249764,0.0004383269,0.00012502268],"domain_scores_gemma":[0.9961094,0.0027164426,0.0001891275,0.0003939294,0.0004483259,0.00014270646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021257328,0.0009719085,0.0016906528,0.0032452724,0.0011660119,0.0024269568,0.003728926,0.0023256738,0.004176457],"category_scores_gemma":[0.008205602,0.0007102171,0.0015182096,0.0041446434,0.0009485612,0.0049886373,0.0022904777,0.0024256676,0.0015298015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001746276,0.0004417303,0.0019244894,0.0002239536,0.00021037349,0.0002262698,0.00014958317,0.5919349,0.0013424304,0.08489918,0.011978813,0.30649358],"study_design_scores_gemma":[0.0000050699673,0.0000082220895,0.000100471996,0.000010244155,0.000015480404,0.000013463853,0.0000071445384,0.9600529,0.00017181005,0.038915116,0.0006935325,0.0000065360764],"about_ca_topic_score_codex":0.022587618,"about_ca_topic_score_gemma":0.025171468,"teacher_disagreement_score":0.022587618,"about_ca_system_score_codex":0.0014980492,"about_ca_system_score_gemma":0.0016501484,"threshold_uncertainty_score":0.04491228},"labels":[],"label_agreement":null},{"id":"W2466943523","doi":"10.1007/978-3-319-30858-6_17","title":"A Convolutional Neural Network Approach to Brain Tumor Segmentation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":103,"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 Sherbrooke","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Segmentation; Pattern recognition (psychology)","score_opus":0.034385408781722894,"score_gpt":0.25796188930739855,"score_spread":0.22357648052567566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466943523","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.00696578,0.0041464604,0.9774979,0.00039117175,0.00018488681,0.0000286116,0.00021954342,0.0011215752,0.009444184],"genre_scores_gemma":[0.22528231,0.009283167,0.6823204,0.00033863485,0.0004512628,0.0000820792,0.0011448513,0.00062013,0.08047716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999305,0.000007530725,0.0000039327124,0.000019825193,0.000025867164,0.000012358924],"domain_scores_gemma":[0.99990714,0.000033109085,0.0000061634,0.0000134883585,0.000034013698,0.0000061070145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021911548,0.0006522185,0.00042581925,0.00057920447,0.00021024622,0.00062588154,0.0010449382,0.0009817755,0.0035716256],"category_scores_gemma":[0.00038499263,0.00042071313,0.0005438536,0.0008624496,0.00028834707,0.00068851945,0.0005943556,0.0008776196,0.0012204023],"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.00006319958,0.000063282685,0.00038540488,0.00019023076,0.00009173535,0.00016328192,0.00004768972,0.30346492,0.0310515,0.041698463,0.01515694,0.60762346],"study_design_scores_gemma":[0.0000024208878,0.000014031368,0.0003993298,0.000016103146,0.000022247128,0.000105814026,0.000006343152,0.96566385,0.007466534,0.016696077,0.009597433,0.000009782992],"about_ca_topic_score_codex":0.009691075,"about_ca_topic_score_gemma":0.012603117,"teacher_disagreement_score":0.009691075,"about_ca_system_score_codex":0.0006342497,"about_ca_system_score_gemma":0.00049737276,"threshold_uncertainty_score":0.019269347},"labels":[],"label_agreement":null},{"id":"W2467452478","doi":"10.1007/978-3-319-34111-8_11","title":"Tolerance-Based Approach to Audio Signal Classification","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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 Winnipeg","funders":"","keywords":"Computer science; Artificial intelligence; Classifier (UML); Audio signal; Pattern recognition (psychology); Naive Bayes classifier; Support vector machine; Machine learning; Speech recognition; Speech coding","score_opus":0.031763970481138694,"score_gpt":0.24313312780233842,"score_spread":0.21136915732119974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467452478","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.0046744803,0.0003958091,0.99353516,0.00006962362,0.000066121174,0.000016706656,0.0000308144,0.0003568091,0.00085460086],"genre_scores_gemma":[0.2889182,0.0013105962,0.69026345,0.0003221509,0.0004951972,0.00013866405,0.0007207668,0.00042498708,0.017406067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988438,0.00015111214,0.00008831929,0.0002015729,0.00060085935,0.000114346636],"domain_scores_gemma":[0.9988146,0.0003373211,0.0001148986,0.00021469795,0.0004440227,0.00007448426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007613592,0.0008260424,0.0014724089,0.0014325407,0.00056379754,0.0015667285,0.002731402,0.001194491,0.0034635256],"category_scores_gemma":[0.0026033958,0.00036163814,0.0011023234,0.0018013383,0.0007362721,0.001245129,0.0022054561,0.0015787723,0.0019129943],"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.00039756185,0.0001817328,0.00084266166,0.00025005688,0.00012810422,0.00014871011,0.00015973448,0.13172102,0.062999345,0.024993451,0.00615117,0.7720265],"study_design_scores_gemma":[0.000011375198,0.000113369635,0.00050870737,0.000014919511,0.000031304222,0.0001795215,0.000048638176,0.96478456,0.012645331,0.01765668,0.0039783507,0.000027209462],"about_ca_topic_score_codex":0.002302015,"about_ca_topic_score_gemma":0.0017785837,"teacher_disagreement_score":0.0034635256,"about_ca_system_score_codex":0.0005384966,"about_ca_system_score_gemma":0.0006078638,"threshold_uncertainty_score":0.011586666},"labels":[],"label_agreement":null},{"id":"W2467861819","doi":"10.1007/978-3-319-34111-8_34","title":"Active Recruitment Mechanisms for Heterogeneous Robot Teams in Dangerous Environments","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Manitoba","funders":"","keywords":"Computer science; Robot; Domain (mathematical analysis); Work (physics); Human–computer interaction; Order (exchange); Team leader; Knowledge management; Risk analysis (engineering); Artificial intelligence; Engineering; Business","score_opus":0.03985467066519016,"score_gpt":0.2683409800496625,"score_spread":0.22848630938447234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467861819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04657567,0.000696196,0.9352842,0.00048260047,0.00031820056,0.00019009432,0.000031369134,0.00057468255,0.015846996],"genre_scores_gemma":[0.79615945,0.00040311847,0.17247577,0.00018790901,0.00019039074,0.00057148526,0.0000907098,0.00015464051,0.029766561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00039105795,0.00007048773,0.00019690575,0.00029658707,0.00020654054],"domain_scores_gemma":[0.9966635,0.0018668744,0.0003032631,0.00038822362,0.00034726807,0.00043092435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002690066,0.00074810744,0.0008497426,0.0006381892,0.0017958721,0.0019868747,0.0044529517,0.0016524704,0.0074497014],"category_scores_gemma":[0.0068215574,0.00058153016,0.000630683,0.00046304674,0.0013661309,0.0029020333,0.005178121,0.0020471145,0.001236249],"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.0009754304,0.00044494172,0.0010810106,0.00043851233,0.00011993176,0.00055419566,0.0018825955,0.20868473,0.023602718,0.51466155,0.012292015,0.23526236],"study_design_scores_gemma":[0.00018329511,0.00026019782,0.00038429757,0.000064725005,0.00004009622,0.00022897383,0.0003539652,0.76918817,0.0038289777,0.21447983,0.010938645,0.00004876567],"about_ca_topic_score_codex":0.0004942863,"about_ca_topic_score_gemma":0.0008030128,"teacher_disagreement_score":0.0074497014,"about_ca_system_score_codex":0.00077793404,"about_ca_system_score_gemma":0.0008423352,"threshold_uncertainty_score":0.024921775},"labels":[],"label_agreement":null},{"id":"W2467893958","doi":"10.1007/978-3-319-53637-8_5","title":"From Papers to Triples: An Open Source Workflow for Semantic Publishing Experiments","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Workflow; Information retrieval; Open source; Publishing; World Wide Web; Programming language; Database; Software","score_opus":0.04537517669073735,"score_gpt":0.29524975323443153,"score_spread":0.2498745765436942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467893958","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.0073424634,0.0005482954,0.62309694,0.0027354325,0.0012628185,0.0034614939,0.13496391,0.18477118,0.041817486],"genre_scores_gemma":[0.036708288,0.00069059257,0.7569564,0.00088180555,0.00028660815,0.0030900105,0.14138931,0.038545594,0.021451404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9881243,0.0032745528,0.0024031508,0.0016162697,0.004132311,0.00044942752],"domain_scores_gemma":[0.9600375,0.01859667,0.0013824347,0.012623918,0.005261504,0.0020979824],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.019912302,0.002351156,0.0019119205,0.0111401,0.003348749,0.012148195,0.0034727212,0.0030136483,0.062942885],"category_scores_gemma":[0.048128426,0.0019121688,0.00429659,0.008743677,0.001211944,0.009696601,0.010514967,0.002749193,0.038122203],"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.0025714878,0.0008358819,0.00509586,0.0036235547,0.00093154615,0.0011872684,0.0033104778,0.007051393,0.020936247,0.14172128,0.49148604,0.321249],"study_design_scores_gemma":[0.0005210539,0.00010567213,0.0021665979,0.00041368266,0.00021728198,0.00056235946,0.0010219984,0.015886758,0.036252055,0.21069376,0.7317832,0.00037559465],"about_ca_topic_score_codex":0.006677725,"about_ca_topic_score_gemma":0.008497524,"teacher_disagreement_score":0.9878518,"about_ca_system_score_codex":0.0023282676,"about_ca_system_score_gemma":0.008322597,"threshold_uncertainty_score":0.21056497},"labels":[],"label_agreement":null},{"id":"W2467912992","doi":"10.1007/978-3-319-31510-2_16","title":"Persuasive Patterns in Q&amp;A Social Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Persuasion; Computer science; Stack (abstract data type); Social network (sociolinguistics); World Wide Web; Social media; Programming language; Social psychology; Psychology","score_opus":0.023803608403164814,"score_gpt":0.2851390779987532,"score_spread":0.2613354695955884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467912992","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.882732,0.0009071254,0.051644005,0.0029430161,0.00008630155,0.00015167658,0.0015933323,0.00037342636,0.059569158],"genre_scores_gemma":[0.9870429,0.000097397606,0.006911397,0.000064142885,0.000037829184,0.00005070105,0.00029928389,0.000033080778,0.0054633073],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99849164,0.000659457,0.000096191165,0.0002901413,0.00036194344,0.000100560894],"domain_scores_gemma":[0.98083234,0.014355505,0.0018656818,0.0010229857,0.0012847523,0.0006387536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013208827,0.00015624256,0.00024214556,0.0023972508,0.0010359308,0.0036742734,0.0005671708,0.0010321175,0.008742582],"category_scores_gemma":[0.016380075,0.0002770078,0.00021633274,0.0025487766,0.00091528054,0.0051975176,0.0010680926,0.0006779966,0.0015314084],"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.0005966609,0.00054811453,0.25486064,0.0004849352,0.00017798628,0.00080467033,0.028533129,0.0068869,0.008876901,0.3045922,0.01703243,0.3766054],"study_design_scores_gemma":[0.00009779957,0.0003403337,0.2696105,0.0002291581,0.00013313051,0.0019288465,0.024571756,0.14582011,0.0063253003,0.488684,0.06213097,0.00012805],"about_ca_topic_score_codex":0.001978548,"about_ca_topic_score_gemma":0.0024106428,"teacher_disagreement_score":0.008742582,"about_ca_system_score_codex":0.0007376939,"about_ca_system_score_gemma":0.0003758694,"threshold_uncertainty_score":0.029246807},"labels":[],"label_agreement":null},{"id":"W2468065612","doi":"10.1007/978-3-319-50349-3_3","title":"MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Configurator; Computer science; Algorithm; Set (abstract data type); State (computer science); Range (aeronautics)","score_opus":0.015865622772823666,"score_gpt":0.27262503268348987,"score_spread":0.2567594099106662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468065612","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.0014537363,0.00012559112,0.98208296,0.000037130794,0.000038682854,0.00005661392,0.0001531814,0.013469626,0.0025825584],"genre_scores_gemma":[0.06322268,0.00013480087,0.92944825,0.00009396994,0.000041325628,0.0003419648,0.00057204126,0.0031566685,0.0029882377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920696,0.00023158877,0.000038723523,0.00012407952,0.00031780082,0.000080867],"domain_scores_gemma":[0.99929893,0.00032578793,0.00005655123,0.0001403276,0.00013256421,0.000045826077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012221908,0.0014707897,0.0010254214,0.0011026253,0.00066226244,0.0015725334,0.003088852,0.0012611474,0.01704495],"category_scores_gemma":[0.0026402462,0.00083663984,0.0014716197,0.000744886,0.0005947491,0.001637556,0.0021533414,0.002391185,0.00398788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034367703,0.00017002298,0.0004973249,0.00052510796,0.00015312864,0.00014508453,0.00007930266,0.5230846,0.009988798,0.037873752,0.021787036,0.40535212],"study_design_scores_gemma":[0.000045902114,0.000047622616,0.00010090182,0.00003097536,0.000016578682,0.00004462835,0.000008170479,0.9746651,0.003981175,0.012593762,0.008440993,0.000024187953],"about_ca_topic_score_codex":0.0014401473,"about_ca_topic_score_gemma":0.0027000166,"teacher_disagreement_score":0.01704495,"about_ca_system_score_codex":0.00054542423,"about_ca_system_score_gemma":0.0010858808,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2469016277","doi":"10.1007/978-3-319-34111-8_20","title":"Harnessing Open Information Extraction for Entity Classification in a French Corpus","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université de Montréal","funders":"","keywords":"Computer science; Open domain; Information extraction; Domain (mathematical analysis); Precision and recall; Information retrieval; Natural language processing; Recall; Named-entity recognition; Relationship extraction; Artificial intelligence; Entity linking; Question answering; Knowledge base; Task (project management); Linguistics","score_opus":0.0454656989705401,"score_gpt":0.2937363488754873,"score_spread":0.24827064990494718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469016277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21824592,0.015650274,0.6094315,0.006291649,0.002488177,0.0007997962,0.07285876,0.029397994,0.04483592],"genre_scores_gemma":[0.3881439,0.0038553807,0.39889368,0.00064665,0.0010487916,0.00074874057,0.18590088,0.0031928231,0.01756915],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99702877,0.0011009604,0.00029909532,0.0008675885,0.000491617,0.00021209741],"domain_scores_gemma":[0.9893923,0.006673234,0.00029879078,0.0012478316,0.0021887484,0.00019920105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032216252,0.0014866806,0.0010216973,0.007031884,0.0026002936,0.0038797394,0.0011216865,0.0012729306,0.0068972926],"category_scores_gemma":[0.011493762,0.00069820444,0.0011936818,0.005052744,0.0010463938,0.005197991,0.0029731393,0.0017511952,0.0048903343],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056780345,0.00027731803,0.007654846,0.00179539,0.00024023735,0.0017623708,0.004158619,0.008143332,0.040541194,0.022724105,0.1096199,0.802515],"study_design_scores_gemma":[0.00020182309,0.0002889312,0.034855157,0.00076290464,0.00068693276,0.00255461,0.004620643,0.16288094,0.076249264,0.040154193,0.6763362,0.0004083141],"about_ca_topic_score_codex":0.03338187,"about_ca_topic_score_gemma":0.041209307,"teacher_disagreement_score":0.03338187,"about_ca_system_score_codex":0.0018838051,"about_ca_system_score_gemma":0.0030968692,"threshold_uncertainty_score":0.06637514},"labels":[],"label_agreement":null},{"id":"W2469183066","doi":"10.1007/978-3-319-34111-8_8","title":"The Mismeasure of Machines","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroethics, Human Enhancement, Biomedical Innovations","field":"Neuroscience","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 Saskatchewan","funders":"","keywords":"Turing test; Turing; Test (biology); Computer science; Schema (genetic algorithms); Deception; Cognitive science; Artificial intelligence; Psychology; Programming language; Information retrieval; Social psychology","score_opus":0.05080783760285222,"score_gpt":0.3003665574283086,"score_spread":0.24955871982545635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469183066","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.04613325,0.036033195,0.1859901,0.10747408,0.004291566,0.00003605343,0.00049012346,0.000806095,0.6187455],"genre_scores_gemma":[0.85587734,0.012814232,0.037408013,0.007960579,0.0027909253,0.00011075756,0.0002382114,0.000644901,0.08215511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734783,0.0012443885,0.000082323604,0.00047563916,0.0006408096,0.0002090364],"domain_scores_gemma":[0.98686266,0.0077396818,0.0005127461,0.0036381239,0.0009158789,0.0003309646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004208526,0.0004685799,0.0004460019,0.0012199531,0.0013974028,0.0048009325,0.0013392211,0.0026562726,0.008232142],"category_scores_gemma":[0.02017255,0.0004215088,0.00045350852,0.0010199322,0.016179819,0.012666834,0.003080006,0.0041074497,0.0022346887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020815756,0.0000049497708,0.00029811665,0.000043510798,0.0000094983,0.00004582072,0.0005057761,0.00116294,0.00021858676,0.9616742,0.009271165,0.026744591],"study_design_scores_gemma":[0.000003881509,0.000009174124,0.00029296937,0.000065497414,0.000005652143,0.00012952124,0.00015731355,0.0014010872,0.0005138045,0.8790458,0.1183638,0.000011532306],"about_ca_topic_score_codex":0.0012610448,"about_ca_topic_score_gemma":0.0010664891,"teacher_disagreement_score":0.008232142,"about_ca_system_score_codex":0.0012820086,"about_ca_system_score_gemma":0.0011908346,"threshold_uncertainty_score":0.027539253},"labels":[],"label_agreement":null},{"id":"W2469683280","doi":"10.1007/978-3-319-34111-8_27","title":"A Simple Method for Testing Independencies in Bayesian Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Computer science; Undirected graph; Separation (statistics); Bayesian network; Directed acyclic graph; Simple (philosophy); Source separation; Pruning; Graph; Theoretical computer science; Artificial intelligence; Algorithm; Machine learning","score_opus":0.038785190929015535,"score_gpt":0.2916218200126371,"score_spread":0.25283662908362153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469683280","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.0015286633,0.0000892022,0.9968466,0.000057175817,0.00004696763,0.000116703864,0.00018979833,0.00042534687,0.00069957675],"genre_scores_gemma":[0.03975206,0.00015695518,0.9566539,0.000109437024,0.00013051786,0.00063105917,0.000634064,0.00021471608,0.0017173658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98326737,0.00885499,0.0010840263,0.002396105,0.004061063,0.00033647977],"domain_scores_gemma":[0.886512,0.09643823,0.0024493663,0.009618761,0.0039346395,0.001047136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015284026,0.0024326653,0.0029226157,0.0054336083,0.0015499583,0.0029447624,0.0052742045,0.003113605,0.01572546],"category_scores_gemma":[0.115879275,0.0016451136,0.003214262,0.005192976,0.0028648435,0.0059667933,0.0040850053,0.0053864606,0.003081318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010112362,0.00041082437,0.0091851335,0.0009054002,0.0014884253,0.00056833937,0.00040074904,0.052657213,0.008039839,0.20128602,0.013355474,0.7106914],"study_design_scores_gemma":[0.00038735196,0.00034955805,0.003944221,0.00014926601,0.0005179596,0.001018996,0.00010971695,0.36216003,0.004898797,0.6163111,0.009939539,0.00021346936],"about_ca_topic_score_codex":0.0019216302,"about_ca_topic_score_gemma":0.0027516754,"teacher_disagreement_score":0.01572546,"about_ca_system_score_codex":0.0008821885,"about_ca_system_score_gemma":0.002124023,"threshold_uncertainty_score":0.08083063},"labels":[],"label_agreement":null},{"id":"W2470470562","doi":"10.1007/978-3-319-34111-8_35","title":"Compression of General Bayesian Net CPTs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Bayesian network; Inference; Treebank; Pairwise comparison; Artificial intelligence; Nat; Tree (set theory); Algorithm; Machine learning; Data mining; Theoretical computer science; Mathematics","score_opus":0.0200460831404127,"score_gpt":0.25593887322118875,"score_spread":0.23589279008077604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470470562","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.020972531,0.0011979479,0.9447922,0.0014952674,0.0003987591,0.00010766798,0.002203991,0.0017980448,0.027033519],"genre_scores_gemma":[0.49402803,0.0031063142,0.46575797,0.0009651502,0.00094374415,0.00043892075,0.007885504,0.0012452042,0.025629142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806505,0.00063331303,0.000117216725,0.00029920982,0.00076648564,0.000118805256],"domain_scores_gemma":[0.99024713,0.006339242,0.00031312485,0.0021938174,0.0006957228,0.00021092151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073733,0.0009740897,0.0013008508,0.0019771417,0.00059575104,0.0023690467,0.0019656303,0.0015708093,0.020253163],"category_scores_gemma":[0.024058994,0.0007461929,0.0008360971,0.0031096884,0.001404544,0.0056136237,0.003240314,0.0034850766,0.0031997554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045816528,0.00008896763,0.00052911247,0.00023148049,0.000050204904,0.00021218762,0.0001565486,0.17676292,0.0012197194,0.545676,0.019084616,0.25553015],"study_design_scores_gemma":[0.000026489435,0.000016953982,0.00013844823,0.000057408215,0.00001216224,0.000100087804,0.00002007725,0.41184378,0.00071512477,0.58206373,0.0049912333,0.000014550133],"about_ca_topic_score_codex":0.0020202172,"about_ca_topic_score_gemma":0.0026517452,"teacher_disagreement_score":0.020253163,"about_ca_system_score_codex":0.0015674842,"about_ca_system_score_gemma":0.0015395252,"threshold_uncertainty_score":0.06775355},"labels":[],"label_agreement":null},{"id":"W2471483531","doi":"10.1007/978-3-540-87563-5_6","title":"On Reduct Construction Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Reduct; Computer science; Heuristics; Selection (genetic algorithm); Algorithm; Data mining; Rough set; Artificial intelligence","score_opus":0.019239655574859082,"score_gpt":0.2498058758665991,"score_spread":0.23056622029174004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471483531","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.007092805,0.002840968,0.9530535,0.0017617368,0.0005419849,0.00020186396,0.00062921736,0.002688318,0.031189661],"genre_scores_gemma":[0.07608454,0.0030409328,0.88281,0.0012327046,0.00087417394,0.0005035587,0.004530499,0.0021683925,0.028755141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950119,0.0015646053,0.0003102127,0.0010529915,0.001706834,0.00035343642],"domain_scores_gemma":[0.98914975,0.0060518314,0.00022079088,0.0035768023,0.0008182851,0.00018260322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039722663,0.002250407,0.0030199443,0.004174605,0.002525147,0.0043351334,0.004440784,0.0024289237,0.020007677],"category_scores_gemma":[0.019313358,0.0019396233,0.004618869,0.0072864145,0.0036100054,0.010904266,0.0074662566,0.009001476,0.0075412435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022336052,0.00022356106,0.00086715206,0.0004137604,0.00012480031,0.00010596979,0.0003450994,0.027545556,0.001151005,0.49364266,0.05123325,0.42412382],"study_design_scores_gemma":[0.000035653593,0.000033514,0.00023367941,0.00011127408,0.00006540667,0.00015546274,0.000062602354,0.06770188,0.0010849743,0.90596783,0.02452724,0.00002056174],"about_ca_topic_score_codex":0.0022300517,"about_ca_topic_score_gemma":0.002695479,"teacher_disagreement_score":0.020007677,"about_ca_system_score_codex":0.002144459,"about_ca_system_score_gemma":0.002047293,"threshold_uncertainty_score":0.06693232},"labels":[],"label_agreement":null},{"id":"W2472380137","doi":"10.1007/978-3-319-33954-2_21","title":"Balancing Nursing Workload by Constraint Programming","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Workload; Staffing; Computer science; Constraint (computer-aided design); Nursing; Constraint satisfaction; Constraint programming; Constraint satisfaction problem; Mathematical optimization; Medicine; Artificial intelligence; Mathematics","score_opus":0.05043044749838462,"score_gpt":0.3399339706376986,"score_spread":0.289503523139314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472380137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076310234,0.00068846106,0.94726044,0.0008418393,0.00023405509,0.00018074374,0.00023807946,0.0004506288,0.042474702],"genre_scores_gemma":[0.3189632,0.0022895348,0.64368683,0.00062813476,0.00034529722,0.0005870638,0.00078231253,0.0006677098,0.03204995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917346,0.00024740674,0.00002920867,0.000114883995,0.0002969433,0.0001381282],"domain_scores_gemma":[0.9985909,0.0009022307,0.00008285945,0.000086345855,0.00023145747,0.00010619759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012090143,0.0009504891,0.00059775164,0.00065503427,0.00053330074,0.0020014446,0.0017974525,0.0006162516,0.010457854],"category_scores_gemma":[0.0039666025,0.00042008437,0.0005865154,0.0019763862,0.00035351375,0.0011764533,0.0009341198,0.0014357106,0.0011276213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015614161,0.00016514916,0.00044049873,0.0002874158,0.00004490489,0.000089582616,0.00012247225,0.557458,0.004032587,0.07428244,0.023196084,0.33972472],"study_design_scores_gemma":[0.0000256787,0.00004518811,0.00025268187,0.000056155357,0.000017368815,0.000060712682,0.0000883789,0.9329637,0.0015355528,0.04714579,0.017791027,0.000017733018],"about_ca_topic_score_codex":0.006868392,"about_ca_topic_score_gemma":0.0075992933,"teacher_disagreement_score":0.010457854,"about_ca_system_score_codex":0.0011334195,"about_ca_system_score_gemma":0.0024923366,"threshold_uncertainty_score":0.034984946},"labels":[],"label_agreement":null},{"id":"W2472686974","doi":"10.1007/978-3-319-38851-9_13","title":"On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","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":"Wilfrid Laurier University","funders":"","keywords":"Circulant matrix; Computer science; Core (optical fiber); Algorithm; Metaheuristic; Multi-core processor; Quality (philosophy); Mathematical optimization; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.02593344252193497,"score_gpt":0.22819292685329495,"score_spread":0.20225948433135998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472686974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014187368,0.00056884665,0.9738124,0.00030066783,0.00014436852,0.000106975196,0.000053947402,0.0003069057,0.010518567],"genre_scores_gemma":[0.16174155,0.00079503347,0.8255567,0.00029051455,0.00020405283,0.00035877046,0.0002109182,0.00031703227,0.010525519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.0004187932,0.000044411983,0.00014043182,0.00027767898,0.00014594928],"domain_scores_gemma":[0.9969771,0.0023155427,0.00010696265,0.00022370624,0.0002791532,0.00009759069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014705447,0.00182323,0.0017347323,0.0007368055,0.0007351047,0.0016357983,0.001785552,0.001912187,0.008510482],"category_scores_gemma":[0.008753598,0.00084413996,0.0008971457,0.0016534769,0.00089020893,0.0024459846,0.0024650407,0.0022745046,0.0013452646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021511747,0.00019854553,0.00034457076,0.0002754926,0.000069954476,0.000094752264,0.00009407238,0.73457944,0.0027385126,0.059763424,0.008447686,0.19317837],"study_design_scores_gemma":[0.0000310449,0.000056032113,0.00005215784,0.00001622199,0.000007829964,0.000026152678,0.000022231417,0.9631799,0.00052732916,0.034931876,0.0011420597,0.0000071654167],"about_ca_topic_score_codex":0.0023161012,"about_ca_topic_score_gemma":0.004070445,"teacher_disagreement_score":0.008510482,"about_ca_system_score_codex":0.00070446276,"about_ca_system_score_gemma":0.0016961746,"threshold_uncertainty_score":0.028470337},"labels":[],"label_agreement":null},{"id":"W2473093952","doi":"10.1007/978-3-319-33618-3_16","title":"Computer Vision Color Constancy from Maximal Projections Mean Assumption","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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":"Université de Sherbrooke","funders":"","keywords":"Standard illuminant; Color constancy; Computer science; Artificial intelligence; Computer vision; Maximization; Pattern recognition (psychology); Image (mathematics); Algorithm; Mathematics; Mathematical optimization","score_opus":0.013971590318785898,"score_gpt":0.2632708177408372,"score_spread":0.24929922742205132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473093952","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.026059123,0.0018164591,0.9459256,0.0011795888,0.00020539029,0.000023117627,0.00035037682,0.0007140097,0.023726467],"genre_scores_gemma":[0.79298306,0.0031698102,0.17902136,0.00090533553,0.0006866024,0.0000977989,0.00096224336,0.0007554467,0.021418305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995586,0.000088320565,0.000014734434,0.00015708862,0.00013385215,0.00004737122],"domain_scores_gemma":[0.99915683,0.00028317227,0.000064619504,0.00026216242,0.00018126515,0.000051865823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871213,0.00050582935,0.00063528266,0.000524113,0.00032414988,0.0012626522,0.0013587704,0.00065549545,0.005266617],"category_scores_gemma":[0.0027172226,0.0004600403,0.0005792213,0.0007913735,0.0012009998,0.0020327615,0.0016457002,0.0027338618,0.0013784972],"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.00040847165,0.000036074918,0.0007561419,0.00039013784,0.00007838467,0.00019107304,0.00016015364,0.028938165,0.0536896,0.6728913,0.019473264,0.2229872],"study_design_scores_gemma":[0.000018683088,0.00004662941,0.0013168721,0.000031498694,0.000038127455,0.00039142356,0.000034456723,0.3226962,0.020750448,0.641091,0.013546394,0.000038217484],"about_ca_topic_score_codex":0.0014812625,"about_ca_topic_score_gemma":0.0007710066,"teacher_disagreement_score":0.005266617,"about_ca_system_score_codex":0.0006027001,"about_ca_system_score_gemma":0.00036814646,"threshold_uncertainty_score":0.017618537},"labels":[],"label_agreement":null},{"id":"W2474482100","doi":"10.1007/978-3-319-30139-6_12","title":"A General Framework for Searching on a Line","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":"University of Ottawa; Carleton University","funders":"","keywords":"Competitive analysis; Constant (computer programming); Search cost; Computer science; Line (geometry); Mathematical optimization; Search problem; Alpha (finance); Upper and lower bounds; Mathematics; Statistics; Geometry","score_opus":0.041626329975788655,"score_gpt":0.3133174656662515,"score_spread":0.2716911356904629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474482100","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.0014433486,0.00047548668,0.9570434,0.00040946482,0.000114891845,0.00004320307,0.00014260023,0.0004068638,0.039920676],"genre_scores_gemma":[0.094395205,0.0016529621,0.8347287,0.0004319234,0.00028881885,0.0003625707,0.00050589826,0.0006965066,0.0669374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945956,0.0001333948,0.000033362,0.00013501344,0.00016543377,0.000073140975],"domain_scores_gemma":[0.9996649,0.00012145763,0.000020242902,0.000096101976,0.000068679874,0.00002862741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050514133,0.00095717213,0.00077738485,0.0011643675,0.0014354521,0.0025812075,0.0029557634,0.0019437409,0.027696883],"category_scores_gemma":[0.0021661527,0.00058603374,0.0013683614,0.002134191,0.0019326176,0.004940284,0.0023849802,0.0022739365,0.0063946587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140644715,0.000012406314,0.00005811321,0.0000712904,0.0000062060476,0.00004601507,0.00010799418,0.013764696,0.00059468334,0.9473348,0.006470891,0.031518828],"study_design_scores_gemma":[0.000017243412,0.000022273514,0.00004370702,0.00003956237,0.0000108760005,0.00010229191,0.00005739396,0.09465502,0.00042634577,0.8456611,0.05894817,0.000016019283],"about_ca_topic_score_codex":0.0030982017,"about_ca_topic_score_gemma":0.0029504995,"teacher_disagreement_score":0.027696883,"about_ca_system_score_codex":0.0009677759,"about_ca_system_score_gemma":0.0007534447,"threshold_uncertainty_score":0.0926553},"labels":[],"label_agreement":null},{"id":"W2474547845","doi":"10.1007/978-3-319-34111-8_33","title":"Improving Conversation Engagement Through Data-Driven Agent Behavior Modification","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Athabasca University","funders":"","keywords":"Computer science; Conversation; Human–computer interaction; Architecture; Interface (matter); Artificial intelligence","score_opus":0.08574202323540375,"score_gpt":0.3107764220444766,"score_spread":0.22503439880907283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474547845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13278805,0.0006988887,0.847951,0.0005280227,0.00045398728,0.00036554056,0.0009310307,0.011793612,0.004489839],"genre_scores_gemma":[0.76793987,0.00016765957,0.22568338,0.00024995714,0.00016242902,0.00043037703,0.0016207661,0.00060214027,0.0031434402],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998309,0.0005262181,0.00010244293,0.0005587381,0.0003851535,0.00011841357],"domain_scores_gemma":[0.9960109,0.0021952156,0.00024962908,0.00044462972,0.0009282562,0.00017135726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014230893,0.0011920938,0.0012311185,0.0007870863,0.00035829126,0.0011126625,0.001209422,0.00078710396,0.002108893],"category_scores_gemma":[0.009627658,0.0004288324,0.00056373177,0.00056385266,0.0002536536,0.001503026,0.0013009259,0.0018325007,0.0021255305],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013262333,0.001614259,0.008593163,0.00038365932,0.00027003355,0.00012087053,0.00069144845,0.037242588,0.12611522,0.001182109,0.008527849,0.8139326],"study_design_scores_gemma":[0.000057862973,0.00027022386,0.0031131373,0.000020366104,0.00010087902,0.000055771554,0.00015047884,0.9598234,0.030905064,0.0021509563,0.003317132,0.000034671215],"about_ca_topic_score_codex":0.0017401145,"about_ca_topic_score_gemma":0.0025595666,"teacher_disagreement_score":0.002108893,"about_ca_system_score_codex":0.00038819967,"about_ca_system_score_gemma":0.0005514422,"threshold_uncertainty_score":0.0075260997},"labels":[],"label_agreement":null},{"id":"W2474732749","doi":"10.1007/978-3-662-49619-0_2","title":"On Achieving History-Based Move Ordering in Adversarial Board Games Using Adaptive Data Structures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Heuristics; Heuristic; A priori and a posteriori; Context (archaeology); Pruning; Adversarial system; Tree (set theory); Search tree; Monte Carlo tree search; Ranking (information retrieval); Game tree; Theoretical computer science; Artificial intelligence; Sequential game; Algorithm; Game theory; Search algorithm; Mathematical economics; Mathematics","score_opus":0.06677026653193777,"score_gpt":0.28752999270134294,"score_spread":0.22075972616940517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474732749","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.031518914,0.00018620542,0.95983726,0.00048538216,0.00008376032,0.00020233178,0.00015944349,0.00087040866,0.0066563473],"genre_scores_gemma":[0.70410293,0.00051169837,0.27764064,0.0004428167,0.0001565867,0.00057889416,0.0009036808,0.0005096609,0.015153002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967631,0.0010460326,0.00019343606,0.0005899205,0.00077626016,0.0006312262],"domain_scores_gemma":[0.97962946,0.015436416,0.0008221554,0.0023397184,0.0007493828,0.0010229079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037635164,0.0020538198,0.0025234888,0.001154632,0.0014301158,0.0024102344,0.003978627,0.002729414,0.008532547],"category_scores_gemma":[0.019937484,0.0011560246,0.0013780332,0.0014985501,0.0034573148,0.0070557697,0.0074709575,0.006020302,0.0012515635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006107785,0.0003627101,0.001046283,0.00019537375,0.00007586238,0.00010639268,0.0003767792,0.6631682,0.0026852482,0.239325,0.0058607603,0.086186655],"study_design_scores_gemma":[0.000051953833,0.00009856237,0.00009671391,0.000022938817,0.000012550857,0.00001745952,0.000042244734,0.85882264,0.0006068362,0.13971037,0.00050218916,0.000015480498],"about_ca_topic_score_codex":0.0060948054,"about_ca_topic_score_gemma":0.008956098,"teacher_disagreement_score":0.008532547,"about_ca_system_score_codex":0.0020245365,"about_ca_system_score_gemma":0.0042109005,"threshold_uncertainty_score":0.028544247},"labels":[],"label_agreement":null},{"id":"W2474792379","doi":"10.1007/978-3-319-33618-3_13","title":"Collaborative Unmixing Hyperspectral Imagery via Nonnegative Matrix Factorization","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","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":"Queen's University","funders":"","keywords":"Hyperspectral imaging; Non-negative matrix factorization; Karush–Kuhn–Tucker conditions; Matrix norm; Matrix decomposition; Computer science; Norm (philosophy); Matrix (chemical analysis); Endmember; Algorithm; Factorization; Pattern recognition (psychology); Artificial intelligence; Mathematics; Mathematical optimization; Physics","score_opus":0.00879871674109706,"score_gpt":0.23158956484056692,"score_spread":0.22279084809946986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474792379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025573168,0.0002068643,0.9956214,0.000043988122,0.00004955609,0.000021977927,0.00004388785,0.00026188558,0.0011931916],"genre_scores_gemma":[0.08863339,0.0006469591,0.9038358,0.00012034574,0.00013145263,0.00014367788,0.00054653594,0.00024862864,0.0056933844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999298,0.00014158663,0.000030098421,0.00018112261,0.0002972101,0.000051937506],"domain_scores_gemma":[0.99942374,0.0002433924,0.000070020375,0.00013555899,0.000103233135,0.000024083443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000651484,0.0014264244,0.00093487935,0.0005547545,0.00041157944,0.0009735173,0.0010779224,0.0009031438,0.0030367146],"category_scores_gemma":[0.0016668268,0.0006614736,0.0015500048,0.0009903909,0.00061763084,0.0020007875,0.002117891,0.0014670681,0.0019255329],"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.00020139881,0.00016346086,0.0003394153,0.00042577434,0.00018342136,0.00020039432,0.0002250315,0.16493198,0.12731779,0.01805429,0.007721282,0.68023574],"study_design_scores_gemma":[0.000014554287,0.000061520004,0.00029345916,0.000018262966,0.000037394988,0.00020034288,0.000054659027,0.95740235,0.019816719,0.016002016,0.0060654352,0.000033208322],"about_ca_topic_score_codex":0.00090523646,"about_ca_topic_score_gemma":0.0019237313,"teacher_disagreement_score":0.0030367146,"about_ca_system_score_codex":0.00020081126,"about_ca_system_score_gemma":0.00035669375,"threshold_uncertainty_score":0.010158777},"labels":[],"label_agreement":null},{"id":"W2475275891","doi":"10.1007/978-3-319-34111-8_7","title":"Grounding Social Interaction with Affective Intelligence","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Symbolic interactionism; Computer science; Identity (music); Action (physics); Dilemma; Symbolic communication; Paralanguage; Social identity theory; Cognitive science; The Symbolic; Representation (politics); Social relation; Social intelligence; Artificial intelligence; Social psychology; Epistemology; Social group; Sociology; Communication; Psychology; Linguistics; Aesthetics","score_opus":0.022215612370117786,"score_gpt":0.29732096494317567,"score_spread":0.2751053525730579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475275891","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.14784817,0.0012558309,0.3588951,0.0029964442,0.00038672003,0.00009192952,0.00010280773,0.00036686883,0.48805624],"genre_scores_gemma":[0.9703929,0.00021890191,0.018108381,0.0001109289,0.000041684914,0.00004343798,0.000054928092,0.00003645788,0.010992316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.0001414795,0.000015852427,0.00007431346,0.00008476228,0.00006394733],"domain_scores_gemma":[0.99920565,0.00044174047,0.00006362892,0.00013629986,0.000069791844,0.00008287244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337527,0.00039628003,0.00023724364,0.0004714145,0.0007048176,0.0030644436,0.00066646346,0.0008119862,0.008673295],"category_scores_gemma":[0.0022622827,0.00025269145,0.00039539402,0.00043912925,0.0021315182,0.0029718238,0.0023655565,0.0011557929,0.0007732626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005383506,0.00009658785,0.0010829305,0.00009883188,0.00004323517,0.00012274737,0.0019361114,0.008771992,0.005422734,0.90291697,0.0019115406,0.07754254],"study_design_scores_gemma":[0.000013059236,0.00004865918,0.0018400807,0.0000421033,0.000018163455,0.00004050263,0.000681656,0.023557903,0.0017785258,0.9611806,0.010783997,0.00001467945],"about_ca_topic_score_codex":0.0006448541,"about_ca_topic_score_gemma":0.00063399225,"teacher_disagreement_score":0.008673295,"about_ca_system_score_codex":0.00064151455,"about_ca_system_score_gemma":0.00036573329,"threshold_uncertainty_score":0.029015005},"labels":[],"label_agreement":null},{"id":"W2475712273","doi":"10.1007/978-3-319-18615-3","title":"RoboCup 2014: Robot World Cup XVIII","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":18,"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":"Universidade Estadual Paulista; University of Science and Technology of China; Istanbul Teknik Üniversitesi; Instituto Superior Técnico; Universidade do Porto; Universidad Nacional Autónoma de México; University of South Florida; University of Fukui; University of Miami; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Istituto Nazionale di Astrofisica; Zhejiang University; Universidade de São Paulo; Tsinghua University; University of New South Wales; Universidad de Chile; Texas Tech University; Fukuoka University; Carnegie Mellon University; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; De La Salle University; Freie Universität Berlin; Universidade de Aveiro; Universiteit van Amsterdam; Boğaziçi Üniversitesi; University of Southampton; Università degli Studi di Milano; McGill University; National Institute of Advanced Industrial Science and Technology","keywords":"Computer science; Artificial intelligence; Robot; Computer vision; Computer graphics (images)","score_opus":0.01810671499869626,"score_gpt":0.23924544090086824,"score_spread":0.22113872590217198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475712273","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059563443,0.07335888,0.18172166,0.0034674793,0.024791967,0.00058440544,0.0131739415,0.032726854,0.6642185],"genre_scores_gemma":[0.006723835,0.012915902,0.018298905,0.0004353363,0.0012700649,0.00022817246,0.011252994,0.004764649,0.94411],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951303,0.000034073328,0.00001819842,0.00008648099,0.0002941101,0.000054072556],"domain_scores_gemma":[0.9995491,0.0000432587,0.000021743544,0.000066399145,0.0002082059,0.00011134069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004919054,0.002813615,0.0014185234,0.0019378343,0.00090711523,0.003084003,0.0024269186,0.0010478277,0.15836547],"category_scores_gemma":[0.0010802364,0.0010575146,0.0007848189,0.0022627143,0.0003976289,0.0028505342,0.0019597113,0.0019137138,0.12985225],"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.00005458611,0.000032576772,0.00004604171,0.00030662157,0.000012418741,0.000022823859,0.00001921335,0.0011731582,0.0012679681,0.0025798515,0.80260056,0.19188413],"study_design_scores_gemma":[0.000014570064,0.00007379889,0.00042845067,0.00020737933,0.00001391312,0.00014041224,0.00002499401,0.0031368788,0.0021097127,0.0043096296,0.98951155,0.000028718205],"about_ca_topic_score_codex":0.0042370055,"about_ca_topic_score_gemma":0.009752065,"teacher_disagreement_score":0.15836547,"about_ca_system_score_codex":0.0011481149,"about_ca_system_score_gemma":0.001706494,"threshold_uncertainty_score":0.5297853},"labels":[],"label_agreement":null},{"id":"W2476132106","doi":"10.1007/978-3-642-35612-4","title":"Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Sharing Economy and Platforms","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 Alberta","funders":"","keywords":"Computer science; Multi-agent system; Distributed computing; Artificial intelligence","score_opus":0.030421126151037696,"score_gpt":0.252096989136329,"score_spread":0.2216758629852913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476132106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021699099,0.003729643,0.8924253,0.0027489795,0.00066117547,0.00011905443,0.0002111783,0.0007887324,0.07761677],"genre_scores_gemma":[0.6510271,0.0059298677,0.25169796,0.00039677677,0.00031483077,0.0005287812,0.0005018587,0.00042936587,0.08917334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997681,0.00009383767,0.000011452096,0.000023518936,0.0000890293,0.000014043303],"domain_scores_gemma":[0.99957615,0.00028752352,0.000017866152,0.000041167757,0.000048420025,0.000028947903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003758076,0.00064889994,0.000928503,0.00038293004,0.0005995655,0.0013440588,0.000835485,0.0013910176,0.0064753965],"category_scores_gemma":[0.0010889164,0.00044430836,0.0006715923,0.00048383893,0.0010878801,0.0015951107,0.001155984,0.0011484496,0.00073124026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027799664,0.00003832883,0.00022066612,0.000098923745,0.000049780087,0.0000876751,0.00009427017,0.80122745,0.0012898926,0.1758179,0.0038354686,0.017211778],"study_design_scores_gemma":[0.000013231269,0.000014068999,0.00008236864,0.00002544466,0.000011329917,0.000029916902,0.000023108358,0.86962056,0.0005154702,0.11238484,0.017268691,0.000010933035],"about_ca_topic_score_codex":0.0026738758,"about_ca_topic_score_gemma":0.0024707795,"teacher_disagreement_score":0.0064753965,"about_ca_system_score_codex":0.0008092105,"about_ca_system_score_gemma":0.0009000615,"threshold_uncertainty_score":0.021662354},"labels":[],"label_agreement":null},{"id":"W2476235168","doi":"10.1007/978-3-540-92719-8","title":"Computer Supported Cooperative Work in Design IV","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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":"National Research Council Canada","funders":"","keywords":"Computer science; Work (physics); Software engineering; Human–computer interaction","score_opus":0.015076458869955562,"score_gpt":0.21172192000255244,"score_spread":0.19664546113259687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476235168","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075598937,0.017851733,0.68775296,0.0008333361,0.0013724776,0.00014941093,0.00007079182,0.0012748224,0.2831346],"genre_scores_gemma":[0.22243148,0.012805668,0.191716,0.000295448,0.00058719015,0.00049562793,0.00032468443,0.00046503244,0.5708788],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994504,0.00018024741,0.000017034172,0.00006563411,0.00024232469,0.00004435156],"domain_scores_gemma":[0.9994117,0.0003118062,0.000017276296,0.00012768972,0.00009549456,0.000035946094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005131478,0.00083174935,0.0005879494,0.0005961816,0.00055687176,0.0016721778,0.00089596945,0.00077379664,0.01563225],"category_scores_gemma":[0.0011615587,0.00034822922,0.00046252905,0.0012352078,0.00086767995,0.0010827865,0.0011175249,0.00096492673,0.004444481],"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.000083869374,0.00013170745,0.00019582621,0.00038116192,0.000028357239,0.00013348523,0.0007978589,0.023532284,0.0070578274,0.1537593,0.053968955,0.75992936],"study_design_scores_gemma":[0.000050797415,0.00030013837,0.0010536808,0.0005089229,0.000041933275,0.00056266045,0.0005875088,0.10861583,0.009103564,0.22478557,0.65434027,0.000049140443],"about_ca_topic_score_codex":0.0013402834,"about_ca_topic_score_gemma":0.0012208888,"teacher_disagreement_score":0.01563225,"about_ca_system_score_codex":0.0007480746,"about_ca_system_score_gemma":0.00078818365,"threshold_uncertainty_score":0.05229509},"labels":[],"label_agreement":null},{"id":"W2476275171","doi":"10.1007/978-3-662-43414-7","title":"Selected Areas in Cryptography -- SAC 2013","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":65,"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":"Cryptography; Computer science; Computer security","score_opus":0.00779701903466147,"score_gpt":0.2227889514566596,"score_spread":0.21499193242199816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476275171","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029389618,0.15950769,0.029405305,0.0030675004,0.03265845,0.0003018751,0.0014151679,0.0011544063,0.76955044],"genre_scores_gemma":[0.015348193,0.112908475,0.014874986,0.0006509319,0.013265361,0.00017073457,0.0017890799,0.00053534785,0.8404569],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994149,0.00007027296,0.000026477308,0.00009521142,0.00034723285,0.000045835677],"domain_scores_gemma":[0.9993056,0.00010917702,0.00003613933,0.0000748154,0.00033317582,0.00014104969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000582642,0.0023556578,0.0015166953,0.0027481578,0.0010434963,0.002904435,0.00081687665,0.0008895598,0.06919761],"category_scores_gemma":[0.0008490692,0.0004316965,0.00071941264,0.004170575,0.0006417129,0.0023104828,0.0010615658,0.0023492912,0.05712604],"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.000086384985,0.00009279474,0.00024895705,0.0006411052,0.000032479657,0.00006331855,0.000038579743,0.0020874897,0.0015584052,0.0198415,0.5981472,0.37716177],"study_design_scores_gemma":[0.00001540689,0.00008034185,0.0010652777,0.0004066616,0.000027757273,0.00030485154,0.000036695903,0.0030431112,0.0014329042,0.011379809,0.9821852,0.000022057755],"about_ca_topic_score_codex":0.0017687593,"about_ca_topic_score_gemma":0.0036156457,"teacher_disagreement_score":0.06919761,"about_ca_system_score_codex":0.0015525616,"about_ca_system_score_gemma":0.002293815,"threshold_uncertainty_score":0.23148906},"labels":[],"label_agreement":null},{"id":"W2476305501","doi":"10.1007/978-3-319-22183-0","title":"Search-Based Software Engineering","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software engineering; Search-based software engineering; Software; Software development; Programming language; Software construction","score_opus":0.019046118010701645,"score_gpt":0.2421221983094364,"score_spread":0.22307608029873477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476305501","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.004168187,0.0030749645,0.92352915,0.0009972895,0.0001883397,0.0000619261,0.00011744673,0.0014466868,0.06641608],"genre_scores_gemma":[0.18211547,0.0071104057,0.6660202,0.0004615895,0.00029507824,0.0002309797,0.0010412227,0.0013852947,0.14133975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904436,0.0001669377,0.000049545684,0.00012190312,0.0005762029,0.000041008312],"domain_scores_gemma":[0.99879956,0.0005766465,0.000043976164,0.00031795495,0.00022699454,0.000034952318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242113,0.0007504588,0.00063052186,0.0009619824,0.00046127263,0.0016020263,0.0011788392,0.00079136295,0.012381324],"category_scores_gemma":[0.003339353,0.0004954495,0.00077062467,0.001307835,0.0010369937,0.00217747,0.0013794742,0.0019308745,0.005267294],"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.000045759476,0.00007867777,0.00024543615,0.0003339428,0.000037785554,0.0000475831,0.000115181916,0.034536853,0.004770549,0.31360316,0.02604928,0.6201357],"study_design_scores_gemma":[0.00002029665,0.00005365661,0.00029514852,0.00013531583,0.000026717582,0.00019401519,0.000043921315,0.23109457,0.008217486,0.646751,0.11314904,0.000018897854],"about_ca_topic_score_codex":0.0009958631,"about_ca_topic_score_gemma":0.0011411553,"teacher_disagreement_score":0.012381324,"about_ca_system_score_codex":0.0010401441,"about_ca_system_score_gemma":0.00080960355,"threshold_uncertainty_score":0.041419625},"labels":[],"label_agreement":null},{"id":"W2476332689","doi":"10.1007/b105222","title":"Topics in Cryptology – CT-RSA 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":349,"is_retracted":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":"Cryptography; Computer science; Computer security","score_opus":0.011685100266930915,"score_gpt":0.25068891568984586,"score_spread":0.23900381542291493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476332689","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004830752,0.06649351,0.062361892,0.007420381,0.017128143,0.00025656074,0.001049215,0.0023684697,0.8380911],"genre_scores_gemma":[0.035577565,0.035174947,0.023497155,0.0008546465,0.0065660295,0.0001301945,0.0014063928,0.00086335745,0.8959298],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994671,0.000054363394,0.000028786128,0.00010090499,0.00030870858,0.000040081766],"domain_scores_gemma":[0.9992974,0.00014778602,0.000051348787,0.00015460083,0.00023219358,0.000116679024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005728427,0.0017226656,0.0010424918,0.0017920826,0.0010031578,0.0036974296,0.00092448026,0.0009407569,0.06791293],"category_scores_gemma":[0.001469748,0.0005858176,0.0005381877,0.0027117378,0.0011161387,0.0036108734,0.0010082643,0.0038699848,0.039771326],"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.000111956164,0.000085018786,0.00021865794,0.0006491943,0.000022648972,0.000102028964,0.000116756,0.0024384486,0.0040055383,0.10660857,0.465397,0.4202441],"study_design_scores_gemma":[0.000026309239,0.00006656844,0.00057141227,0.00026051365,0.000021776064,0.0005237147,0.00003282094,0.0030646943,0.003337782,0.03015744,0.96191823,0.000018852876],"about_ca_topic_score_codex":0.00071706146,"about_ca_topic_score_gemma":0.0010829747,"teacher_disagreement_score":0.06791293,"about_ca_system_score_codex":0.001926478,"about_ca_system_score_gemma":0.0016574732,"threshold_uncertainty_score":0.22719139},"labels":[],"label_agreement":null},{"id":"W2476853596","doi":"10.1007/978-3-319-39483-1_44","title":"MADE Ratio: Affective Multimodal Software for Mathematical Concepts","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Education and Technology Integration","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Usability; Modalities; Software; Human–computer interaction; Multimodal learning; Artificial intelligence; Programming language","score_opus":0.021382100493226038,"score_gpt":0.332400968878834,"score_spread":0.311018868385608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476853596","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054853093,0.0012982953,0.8699631,0.00044849876,0.0004177694,0.0006722864,0.00050335977,0.01570033,0.056143276],"genre_scores_gemma":[0.2799493,0.0019568775,0.5862138,0.00071736815,0.0002620996,0.0015953575,0.0012660538,0.0036587361,0.124380425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999782,0.00006288634,0.000013879821,0.000042265332,0.00008422701,0.000014754378],"domain_scores_gemma":[0.99947923,0.00036156728,0.000020730444,0.000041157244,0.000058284862,0.000039113107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506155,0.00083384744,0.00028870197,0.00044785728,0.00028459282,0.0011391649,0.0010255,0.00059967156,0.042817634],"category_scores_gemma":[0.0025003382,0.0002810286,0.0004661026,0.00021531082,0.00038758677,0.0016066962,0.0014751456,0.00059853727,0.005325932],"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.00067783997,0.0003827753,0.0009641295,0.0020598602,0.000074430114,0.00052277633,0.0028104128,0.0033364582,0.19925639,0.029764196,0.031674556,0.7284761],"study_design_scores_gemma":[0.00040803503,0.0024738454,0.010190783,0.000811463,0.00029879765,0.004319195,0.0011450831,0.06327191,0.11503465,0.04097092,0.76073724,0.0003380562],"about_ca_topic_score_codex":0.00019355152,"about_ca_topic_score_gemma":0.00037790043,"teacher_disagreement_score":0.042817634,"about_ca_system_score_codex":0.00020405132,"about_ca_system_score_gemma":0.00018551172,"threshold_uncertainty_score":0.1432392},"labels":[],"label_agreement":null},{"id":"W2476992958","doi":"10.1007/978-3-319-41754-7_46","title":"Automatic Text Summarization with a Reduced Vocabulary Using Continuous Space Vectors","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Automatic summarization; Computer science; Vocabulary; Natural language processing; Artificial intelligence; Context (archaeology); State (computer science); Space (punctuation); Information retrieval; Speech recognition; Algorithm; Linguistics","score_opus":0.015712199576776567,"score_gpt":0.23180699008876857,"score_spread":0.21609479051199199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476992958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02736607,0.003318204,0.9460103,0.00038886187,0.0009757391,0.00044120947,0.0042079305,0.0143336095,0.0029581983],"genre_scores_gemma":[0.17562804,0.0020699182,0.7780552,0.00019162042,0.0009994456,0.00080583506,0.027982103,0.0012871935,0.012980694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987984,0.00023890992,0.00015139981,0.00039831252,0.00029150757,0.00012152561],"domain_scores_gemma":[0.99875724,0.0003590031,0.00008525722,0.00018255562,0.00055994827,0.000055954602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070375245,0.0017468426,0.0017168875,0.0031986206,0.00078929076,0.0019438483,0.0011262054,0.0010504149,0.0069109653],"category_scores_gemma":[0.0025341723,0.0004472873,0.0014868305,0.0028670004,0.00035118088,0.002478829,0.00162438,0.0014079242,0.0076882117],"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.0006371153,0.0001399638,0.0003251343,0.000683622,0.00014052486,0.00016480932,0.00021230242,0.004724362,0.11236831,0.0025881159,0.02868491,0.84933084],"study_design_scores_gemma":[0.00033660146,0.0013335616,0.004500234,0.00026888467,0.00090896257,0.0009532448,0.0012652485,0.719545,0.15331732,0.01873046,0.09862638,0.0002140916],"about_ca_topic_score_codex":0.0024561395,"about_ca_topic_score_gemma":0.0028638397,"teacher_disagreement_score":0.0069109653,"about_ca_system_score_codex":0.00035011384,"about_ca_system_score_gemma":0.0009844472,"threshold_uncertainty_score":0.02311951},"labels":[],"label_agreement":null},{"id":"W2477249044","doi":"10.1007/b12013","title":"Advanced Conceptual Modeling Techniques","year":2003,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01698056878085206,"score_gpt":0.25908060649740583,"score_spread":0.24210003771655378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477249044","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.00048450427,0.0008476039,0.965638,0.000493708,0.00016492858,0.000061887156,0.0002995893,0.0011129946,0.030896802],"genre_scores_gemma":[0.037795648,0.0044663283,0.88180256,0.00045138784,0.00036426022,0.00034993066,0.0026062874,0.0009300629,0.071233556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838126,0.0003499232,0.00014632096,0.00033445674,0.00070944073,0.00007860828],"domain_scores_gemma":[0.9987581,0.00036392765,0.000054567732,0.00047695855,0.00031326097,0.000033242577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018063232,0.0017261064,0.00094453496,0.0026423554,0.0011181415,0.004291538,0.0025561908,0.0010796532,0.032108217],"category_scores_gemma":[0.003761059,0.0010570287,0.0026827087,0.0032958712,0.0012911869,0.007531096,0.0025048817,0.0032793107,0.015885945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007919633,0.000021867101,0.00006261806,0.0001485687,0.000023731218,0.000043793072,0.00020507173,0.0018474356,0.0007626333,0.864587,0.016488727,0.11580063],"study_design_scores_gemma":[0.000009372153,0.00001336908,0.00008655265,0.00011462962,0.00005588451,0.00021147411,0.00009960515,0.020875463,0.0017475674,0.6879875,0.28877985,0.000018801247],"about_ca_topic_score_codex":0.0016817806,"about_ca_topic_score_gemma":0.0015407585,"teacher_disagreement_score":0.032108217,"about_ca_system_score_codex":0.0012216775,"about_ca_system_score_gemma":0.001386293,"threshold_uncertainty_score":0.107412696},"labels":[],"label_agreement":null},{"id":"W2477579482","doi":"10.1007/b105311","title":"Attention and Performance in Computational Vision","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Computer graphics (images)","score_opus":0.010728045314641095,"score_gpt":0.2668739401277794,"score_spread":0.25614589481313826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477579482","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07650727,0.11927925,0.6536852,0.007412569,0.0014887626,0.000043729087,0.00052911066,0.0022411959,0.1388129],"genre_scores_gemma":[0.85557944,0.016423542,0.07828207,0.0004402282,0.0013522836,0.00006792502,0.00044600575,0.00065623847,0.046752144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939597,0.00017503831,0.00003302365,0.00012951928,0.00020096375,0.00006549212],"domain_scores_gemma":[0.9956709,0.0034576717,0.0001487926,0.00030472115,0.0003307969,0.00008702326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012302381,0.0006336768,0.00083915837,0.0008095484,0.00022484451,0.002376095,0.00093705027,0.0009260292,0.00910508],"category_scores_gemma":[0.008456832,0.00043257972,0.00021690692,0.0015449675,0.0014575308,0.0045611686,0.0008192078,0.0012525468,0.0016562429],"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.00018402738,0.00006846408,0.0014228754,0.0004300317,0.00007976183,0.00004698033,0.0001567526,0.02780764,0.004517073,0.50923246,0.029758489,0.42629537],"study_design_scores_gemma":[0.000016921074,0.000056030432,0.002742439,0.00004756992,0.000029284573,0.0001250985,0.000065452135,0.14896803,0.0032415048,0.82856923,0.01611202,0.000026424106],"about_ca_topic_score_codex":0.0017117505,"about_ca_topic_score_gemma":0.0013842896,"teacher_disagreement_score":0.00910508,"about_ca_system_score_codex":0.0011025125,"about_ca_system_score_gemma":0.0003686694,"threshold_uncertainty_score":0.030459523},"labels":[],"label_agreement":null},{"id":"W2478209449","doi":"10.1007/978-3-319-42085-1_7","title":"Point Placement in an Inexact Model with Applications","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Pairwise comparison; Algorithm; Point (geometry); Upper and lower bounds; Translation (biology); Adversary; Theoretical computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.012760755648954148,"score_gpt":0.2540348443157559,"score_spread":0.24127408866680175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478209449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049442854,0.0004985235,0.99026895,0.00019647922,0.000092650145,0.000013023659,0.000054560565,0.00016989854,0.0037616075],"genre_scores_gemma":[0.29718325,0.0019157492,0.66671884,0.00018725268,0.00031594082,0.00014477839,0.0004034137,0.00052088127,0.03260986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.00019698383,0.000041246214,0.00015583418,0.00029677368,0.00003954161],"domain_scores_gemma":[0.9989465,0.00055394403,0.00009730216,0.00018162979,0.00015663769,0.000064096166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106252,0.0011622887,0.001983283,0.00078460766,0.00070330926,0.0021187882,0.002643245,0.0027189548,0.0053517446],"category_scores_gemma":[0.003894432,0.0010517071,0.0010581188,0.0017859804,0.0015548266,0.002778119,0.0034211786,0.0029533838,0.0013135675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081163205,0.00003084235,0.00024296594,0.00018581898,0.000022664017,0.00015324196,0.00009047055,0.8210483,0.0010849434,0.122214675,0.0034172663,0.051427644],"study_design_scores_gemma":[0.0000035315024,0.000012236404,0.00002218636,0.000009711766,0.0000037187647,0.000037783768,0.000010199783,0.96285343,0.00023851535,0.035168573,0.0016346329,0.0000054298293],"about_ca_topic_score_codex":0.0030074266,"about_ca_topic_score_gemma":0.0024072232,"teacher_disagreement_score":0.0053517446,"about_ca_system_score_codex":0.00077180384,"about_ca_system_score_gemma":0.0007864603,"threshold_uncertainty_score":0.017903388},"labels":[],"label_agreement":null},{"id":"W2478227999","doi":"10.1007/978-3-319-26979-5","title":"Advances in Services Computing","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Library science; Operations research; Engineering","score_opus":0.008032848397151508,"score_gpt":0.2495259264289188,"score_spread":0.24149307803176728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478227999","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004561309,0.2567886,0.15607502,0.016126135,0.016932428,0.00014270678,0.00047021545,0.0023189788,0.5465846],"genre_scores_gemma":[0.082448356,0.28393492,0.09032769,0.0038834363,0.009919792,0.00021305375,0.0017505506,0.0014153545,0.5261069],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909365,0.0001237143,0.000042253796,0.00010635579,0.00055487227,0.000079143254],"domain_scores_gemma":[0.99946254,0.00017719212,0.000016760037,0.00011364277,0.00015254084,0.000077349214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008523116,0.0011411036,0.001118988,0.0018702255,0.00070771616,0.003774847,0.00091417105,0.0010739205,0.021320036],"category_scores_gemma":[0.0016008164,0.0004475295,0.00062963256,0.004618448,0.0012483723,0.005397236,0.0020880685,0.0027103003,0.011606483],"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.000032936703,0.00004800711,0.00011494186,0.000512516,0.000021554797,0.00006403447,0.00021062209,0.0013503843,0.001489798,0.3987351,0.16843927,0.42898086],"study_design_scores_gemma":[0.000006605566,0.00001695304,0.00014981799,0.00018241153,0.000010243123,0.00013613403,0.00008105687,0.0033697817,0.0005697917,0.13071072,0.86475724,0.000009209958],"about_ca_topic_score_codex":0.0017164929,"about_ca_topic_score_gemma":0.001965186,"teacher_disagreement_score":0.021320036,"about_ca_system_score_codex":0.001958944,"about_ca_system_score_gemma":0.0017165494,"threshold_uncertainty_score":0.07132268},"labels":[],"label_agreement":null},{"id":"W2478457747","doi":"10.1007/978-3-642-35740-4","title":"Trends and Topics in Computer Vision","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Conjunction (astronomy); Computer graphics (images); Human–computer interaction; Artificial intelligence; Computer vision","score_opus":0.014547906505570207,"score_gpt":0.29348212622355746,"score_spread":0.27893421971798726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478457747","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021209058,0.8023101,0.0268129,0.0045910897,0.012459094,0.0001167078,0.0006330808,0.0010914704,0.14986473],"genre_scores_gemma":[0.013758668,0.6472906,0.03130364,0.0021734803,0.011207742,0.00012454762,0.002111776,0.00064329745,0.29138628],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991259,0.00007082741,0.000078616664,0.00014779757,0.0005099345,0.000067010864],"domain_scores_gemma":[0.9983272,0.0003501349,0.00010553187,0.00010415368,0.0008362234,0.000276697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977512,0.0014887793,0.0014744182,0.008034506,0.00048315013,0.0035395878,0.0014763894,0.0011198054,0.03641553],"category_scores_gemma":[0.0019403499,0.00055597915,0.00073925377,0.012692353,0.0007518496,0.0055019404,0.0012246625,0.002451641,0.03635648],"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.00003317022,0.0000689493,0.00021887856,0.0019007988,0.000027870285,0.000041149447,0.000057717247,0.00038570396,0.0021948172,0.01186808,0.20652269,0.77668023],"study_design_scores_gemma":[0.000011739954,0.00008131373,0.0013703215,0.0007002603,0.00004087608,0.00070428237,0.00009249693,0.0019167811,0.0012466406,0.013067111,0.98074037,0.000027832883],"about_ca_topic_score_codex":0.0013341517,"about_ca_topic_score_gemma":0.003249446,"teacher_disagreement_score":0.03641553,"about_ca_system_score_codex":0.0009889586,"about_ca_system_score_gemma":0.0015955847,"threshold_uncertainty_score":0.12182206},"labels":[],"label_agreement":null},{"id":"W2478505817","doi":"10.1007/978-3-319-42432-3_9","title":"Automated Deduction in Ring Theory","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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 Manitoba","funders":"","keywords":"Semiring; Equational logic; Associative property; Axiom; Mathematical proof; Automated theorem proving; Ring (chemistry); Computer science; Kleene algebra; Ring theory; Algebra over a field; Discrete mathematics; Commutative property; Commutative ring; Programming language; Mathematics; Pure mathematics; Rewriting","score_opus":0.017123757594788406,"score_gpt":0.24608051310000312,"score_spread":0.22895675550521472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478505817","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03213685,0.017644519,0.77512145,0.0052593136,0.0011336054,0.00009308803,0.00050216436,0.0019552053,0.1661537],"genre_scores_gemma":[0.6294176,0.011795981,0.30876717,0.00086448475,0.0016894843,0.00016361229,0.0012383475,0.00058587565,0.045477472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979018,0.0009361174,0.0001172539,0.00022691555,0.0007050914,0.00011275283],"domain_scores_gemma":[0.99752885,0.001655489,0.00007078031,0.0004597782,0.00023818247,0.000046962363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024025615,0.0006117579,0.00083884463,0.0011710849,0.0010533204,0.0034848927,0.001658096,0.00079153344,0.0062163183],"category_scores_gemma":[0.0044064196,0.00070598425,0.0012773972,0.001443391,0.003475772,0.006700149,0.0021036742,0.0036197759,0.0019052922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027014732,0.000032144028,0.0001639379,0.00018147724,0.000020745432,0.000043911507,0.00022814721,0.0026212859,0.0004979479,0.9306455,0.007223894,0.058313966],"study_design_scores_gemma":[0.0000091165575,0.000006507709,0.0000832038,0.000032580898,0.000008629622,0.000035541645,0.000025159143,0.0053457343,0.0005344804,0.98023844,0.013674062,0.0000065062945],"about_ca_topic_score_codex":0.0010246241,"about_ca_topic_score_gemma":0.0008654089,"teacher_disagreement_score":0.0062163183,"about_ca_system_score_codex":0.0018395021,"about_ca_system_score_gemma":0.0011685197,"threshold_uncertainty_score":0.020795643},"labels":[],"label_agreement":null},{"id":"W2478557639","doi":"10.1007/978-3-540-70916-9","title":"Multi-Agent-Based Simulation VIII","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Computer science","score_opus":0.018185687051461306,"score_gpt":0.24578746378483987,"score_spread":0.22760177673337856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478557639","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.006055521,0.0026888244,0.92031324,0.0004722599,0.0006929053,0.00006981377,0.00024365933,0.0023449783,0.067118764],"genre_scores_gemma":[0.34754115,0.007243866,0.4613528,0.00023803674,0.00048037118,0.0003964958,0.0011517539,0.0015202296,0.18007532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986494,0.00003754015,0.000006045802,0.000022194808,0.00006073631,0.000008460865],"domain_scores_gemma":[0.99978834,0.00011405141,0.000009263267,0.000033573575,0.000039642575,0.000015038964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023650985,0.00080924644,0.0008653842,0.00036557016,0.00027027732,0.00082961295,0.00084278005,0.000636604,0.011961362],"category_scores_gemma":[0.00062285736,0.00045743672,0.0006338439,0.00045651276,0.0003037708,0.0006545456,0.0005552581,0.0009499459,0.0035427273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000739553,0.00005866582,0.00021339882,0.00015768301,0.00005777183,0.00007594007,0.00003560625,0.82221925,0.0047278996,0.048948325,0.014114592,0.10931687],"study_design_scores_gemma":[0.000011169838,0.000016737526,0.000084735024,0.000020565807,0.00001115267,0.000033275275,0.0000049927226,0.95282346,0.0017136432,0.020656113,0.024617327,0.000006781307],"about_ca_topic_score_codex":0.0013512515,"about_ca_topic_score_gemma":0.0009290144,"teacher_disagreement_score":0.011961362,"about_ca_system_score_codex":0.00046333903,"about_ca_system_score_gemma":0.00042280383,"threshold_uncertainty_score":0.040014744},"labels":[],"label_agreement":null},{"id":"W2478777736","doi":"10.1007/978-3-319-16295-9","title":"Progress in Cryptology - LATINCRYPT 2014","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security","score_opus":0.014857751937546867,"score_gpt":0.2673935691517439,"score_spread":0.25253581721419704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478777736","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006207282,0.16031396,0.0675067,0.0182852,0.032075178,0.00017723242,0.0008817289,0.0014795887,0.71307313],"genre_scores_gemma":[0.063849494,0.07999823,0.026639292,0.002136572,0.0106970575,0.00015441995,0.0014714052,0.0009479033,0.81410563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992248,0.00014012808,0.000037054368,0.00014231347,0.0003777027,0.00007802672],"domain_scores_gemma":[0.9994254,0.00013429343,0.000032233776,0.00013111025,0.00019673292,0.000080241916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012308208,0.0011862811,0.0008906107,0.001865442,0.0010424436,0.004634135,0.0007485286,0.0012583504,0.03978932],"category_scores_gemma":[0.0017424572,0.00049591187,0.00040936237,0.0024443783,0.0014980071,0.004856143,0.0017601346,0.0045415023,0.023544036],"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.00009999259,0.00009480028,0.00019288015,0.0004633949,0.000023414106,0.000047761223,0.00008289915,0.0012458047,0.0016313359,0.19002442,0.3062772,0.499816],"study_design_scores_gemma":[0.000028389713,0.00006449688,0.0005104798,0.0003302692,0.000017519993,0.0002792334,0.00003633441,0.0028002786,0.0031397934,0.06117972,0.93159306,0.000020454741],"about_ca_topic_score_codex":0.00087787636,"about_ca_topic_score_gemma":0.0009959418,"teacher_disagreement_score":0.03978932,"about_ca_system_score_codex":0.0026636284,"about_ca_system_score_gemma":0.0024094,"threshold_uncertainty_score":0.13310856},"labels":[],"label_agreement":null},{"id":"W2478999334","doi":"10.1007/978-3-319-42019-6","title":"Rule Technologies. Research, Tools, and Applications","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Carleton University","funders":"","keywords":"RuleML; Computer science; World Wide Web; Programming language; Software engineering; XML; Markup language; XHTML","score_opus":0.04128799239865071,"score_gpt":0.30501200609348317,"score_spread":0.26372401369483245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478999334","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.0024136933,0.15921098,0.4621962,0.005985299,0.0039947056,0.00042851397,0.0043423283,0.00952516,0.3519031],"genre_scores_gemma":[0.031963058,0.17920145,0.5318441,0.0041560913,0.0029250458,0.00084169285,0.0159538,0.0031913423,0.22992343],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817216,0.00027102765,0.00028812743,0.00029616914,0.00090377976,0.00006885058],"domain_scores_gemma":[0.9973552,0.0015423571,0.00014188676,0.000484313,0.00036725,0.00010907498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017356465,0.001611668,0.001561124,0.005503978,0.0007696317,0.009356217,0.002273414,0.002049529,0.018230587],"category_scores_gemma":[0.004677272,0.0011136767,0.0012545108,0.009622258,0.0020904068,0.0138437925,0.0023153233,0.0030243362,0.02319216],"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.000027367503,0.00007724377,0.00021263695,0.0013051706,0.000030169613,0.0001290305,0.00029268328,0.0011362246,0.000995743,0.243691,0.08570314,0.6663996],"study_design_scores_gemma":[0.000023056078,0.000019071753,0.00029799034,0.00084660103,0.00004196256,0.0007872127,0.00016039844,0.0028389106,0.0010648438,0.28180355,0.71208715,0.000029307552],"about_ca_topic_score_codex":0.0020107334,"about_ca_topic_score_gemma":0.00218814,"teacher_disagreement_score":0.018230587,"about_ca_system_score_codex":0.0008943075,"about_ca_system_score_gemma":0.0016423491,"threshold_uncertainty_score":0.060987413},"labels":[],"label_agreement":null},{"id":"W2479055064","doi":"10.1007/978-3-319-12418-6","title":"Advances in Bioinformatics and Computational Biology","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Genetics, Bioinformatics, and Biomedical Research","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":"Simon Fraser University","funders":"","keywords":"Computational biology; Computer science; Biology; Bioinformatics; Data science","score_opus":0.009748558155428728,"score_gpt":0.28216771688171344,"score_spread":0.2724191587262847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479055064","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011767425,0.5020282,0.20738827,0.015587952,0.017143179,0.00017143869,0.0012669713,0.0035233104,0.25171387],"genre_scores_gemma":[0.010937556,0.40015712,0.18284231,0.008017515,0.015209673,0.00033301342,0.0037037607,0.0023295712,0.37646952],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986431,0.00019546568,0.00007964921,0.00020857518,0.0008104486,0.00006271737],"domain_scores_gemma":[0.9965217,0.0020451986,0.00012487409,0.00038809289,0.0006260491,0.00029407116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017863452,0.0023383775,0.0023426833,0.0031765394,0.0005767857,0.004431945,0.0022810227,0.0012364726,0.034350082],"category_scores_gemma":[0.004207591,0.0010810029,0.0010866451,0.0054722764,0.0015863881,0.006207451,0.0024796876,0.0065744687,0.040056672],"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.000031999087,0.00007329318,0.00016482806,0.0012379991,0.000067604145,0.00005952435,0.00014090628,0.0014778989,0.0010916742,0.07655815,0.48109594,0.43800023],"study_design_scores_gemma":[0.000012081503,0.000019471974,0.00027622323,0.00041189458,0.000018699853,0.00023207418,0.000031350308,0.00173615,0.00035205868,0.08465966,0.91223,0.000020390737],"about_ca_topic_score_codex":0.00077069405,"about_ca_topic_score_gemma":0.0012003531,"teacher_disagreement_score":0.034350082,"about_ca_system_score_codex":0.0009417632,"about_ca_system_score_gemma":0.0017660579,"threshold_uncertainty_score":0.11491245},"labels":[],"label_agreement":null},{"id":"W2479081199","doi":"10.1007/978-3-319-39378-0_54","title":"A Hidden Markov Model with Controlled Non-parametric Emissions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Qualcomm (Canada)","funders":"","keywords":"Hidden Markov model; Computer science; Markov model; Set (abstract data type); Ergodic theory; Class (philosophy); Maximum-entropy Markov model; Nonparametric statistics; Markov chain; Algorithm; Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Parametric model; Parametric statistics; Machine learning; Variable-order Markov model; Mathematics; Statistics; Programming language","score_opus":0.014409229795275398,"score_gpt":0.25529382841962767,"score_spread":0.24088459862435227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479081199","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.009540083,0.0005076111,0.9827156,0.0004195879,0.00013749191,0.000024746103,0.00015752947,0.00019940404,0.0062979376],"genre_scores_gemma":[0.72735137,0.0016114209,0.2167765,0.00047379843,0.0004096274,0.00035127826,0.0007191846,0.00049327186,0.051813625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900633,0.00043443957,0.000045748522,0.00022513808,0.0001988793,0.000089452165],"domain_scores_gemma":[0.9965879,0.0026611597,0.00019695831,0.00024222335,0.00020895121,0.0001028209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019374304,0.0010226751,0.001773151,0.00060941296,0.00075118936,0.0022677665,0.003507641,0.0032669927,0.006692661],"category_scores_gemma":[0.0055339364,0.0012194419,0.0020080262,0.0009883987,0.0020973394,0.0034087969,0.0023835737,0.0026872377,0.0016628649],"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.00014611639,0.00006046312,0.0003772802,0.00012969205,0.00006865975,0.00024908414,0.00014897142,0.4857587,0.0018530143,0.49614528,0.0014783363,0.013584452],"study_design_scores_gemma":[0.000018182598,0.00001289926,0.00005886529,0.000011761072,0.000016608848,0.000044405384,0.00000783652,0.8606626,0.000258712,0.13802667,0.0008601664,0.000021230322],"about_ca_topic_score_codex":0.0029381323,"about_ca_topic_score_gemma":0.0021217624,"teacher_disagreement_score":0.006692661,"about_ca_system_score_codex":0.0008975262,"about_ca_system_score_gemma":0.0011388698,"threshold_uncertainty_score":0.022389114},"labels":[],"label_agreement":null},{"id":"W2480016779","doi":"10.1007/978-3-319-41264-1_40","title":"An Exploratory Framework Assessing Intrinsic and Extrinsic Motivators Related to Mobile Device Applications and Attributes for the Canadian Seniors","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"","keywords":"Exploratory research; Computer science; Intrinsic motivation; Exploratory analysis; Mobile device; Empirical research; Human–computer interaction; Internet privacy; Psychology; World Wide Web; Data science; Social psychology; Sociology","score_opus":0.01942330315232557,"score_gpt":0.2955385457088412,"score_spread":0.27611524255651565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480016779","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.98329633,0.0002962704,0.0012118834,0.00036116273,0.00003223358,0.001145026,0.0016463619,0.000016428423,0.011994352],"genre_scores_gemma":[0.9778966,0.00054317084,0.008677661,0.000133728,0.000011864225,0.0019328936,0.0021756007,0.000020177606,0.0086082835],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9979249,0.00030715243,0.00008976395,0.00016699858,0.0008032155,0.0007078327],"domain_scores_gemma":[0.9923011,0.001008724,0.0006858764,0.00020344155,0.0041774,0.0016235638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050055822,0.001132829,0.0008785906,0.006119181,0.010170997,0.004425276,0.0024683329,0.000917504,0.0043677576],"category_scores_gemma":[0.008649446,0.00054901984,0.0020809942,0.0070988107,0.002575412,0.0012634264,0.0044954536,0.0021963676,0.00039110915],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022241229,0.0008733746,0.88665307,0.0003689936,0.0001248984,0.00019253706,0.058961023,0.00039564387,0.0009587873,0.005383831,0.004608099,0.041257296],"study_design_scores_gemma":[0.000032584445,0.00031600686,0.8848592,0.0003810038,0.000102897924,0.00004554612,0.10713563,0.00088029576,0.0002778379,0.00069539907,0.0052092127,0.00006436608],"about_ca_topic_score_codex":0.91194665,"about_ca_topic_score_gemma":0.9722439,"teacher_disagreement_score":0.088053346,"about_ca_system_score_codex":0.02966598,"about_ca_system_score_gemma":0.09487169,"threshold_uncertainty_score":0.21524274},"labels":[],"label_agreement":null},{"id":"W2480481610","doi":"10.1007/978-3-540-71389-0","title":"Foundations of Software Science and Computational Structures","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Software engineering; Software; Programming language; Computational science; Theoretical computer science","score_opus":0.018231483566501717,"score_gpt":0.29185699549625393,"score_spread":0.2736255119297522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480481610","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003789264,0.03941832,0.25173703,0.0077035567,0.0024307694,0.00009295865,0.00045643063,0.00094630383,0.69342536],"genre_scores_gemma":[0.15045474,0.07923975,0.19120976,0.0025611338,0.0058923857,0.00056440773,0.0013957708,0.0009571097,0.56772494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970895,0.00004121707,0.000014857388,0.000040975567,0.00017053657,0.000023355704],"domain_scores_gemma":[0.99938667,0.00032955784,0.000030354453,0.00010373597,0.00011701295,0.000032656793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324102,0.0008799352,0.00084055134,0.0014604839,0.0009704895,0.0029457032,0.0008130772,0.00094189774,0.017222678],"category_scores_gemma":[0.0013797968,0.0006012073,0.00062501506,0.0027749755,0.002208415,0.00424387,0.0009134367,0.0026439957,0.0075349575],"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.000004645636,0.000012653343,0.00004048228,0.00013936695,0.000004941576,0.000019402261,0.00010546439,0.00088037446,0.0003045853,0.90703136,0.03479213,0.05666458],"study_design_scores_gemma":[0.00000464979,0.0000047924973,0.00008341203,0.00006281541,0.000005321187,0.0000718476,0.00002233036,0.0014240418,0.00017064952,0.81493956,0.18320565,0.000004951928],"about_ca_topic_score_codex":0.0009439195,"about_ca_topic_score_gemma":0.0012489283,"teacher_disagreement_score":0.017222678,"about_ca_system_score_codex":0.0013776205,"about_ca_system_score_gemma":0.0016636994,"threshold_uncertainty_score":0.05761558},"labels":[],"label_agreement":null},{"id":"W2480723093","doi":"10.1007/b136676","title":"Testing of Communicating Systems","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Concordia University","funders":"Tomsk State University; Tsinghua University; Georg-August-Universität Göttingen; Ohio State University; Universidad Complutense de Madrid; University of Ottawa","keywords":"Computer science","score_opus":0.03524634707782208,"score_gpt":0.27733617445007575,"score_spread":0.24208982737225365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480723093","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.035556413,0.007167939,0.7316118,0.0010620662,0.0005499899,0.00013603336,0.00021577872,0.0041240063,0.21957596],"genre_scores_gemma":[0.62516075,0.00742505,0.2231585,0.00044764343,0.0006283887,0.00023967336,0.0010463616,0.0011709635,0.14072266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989793,0.00021190096,0.000039146482,0.00010641421,0.0006072327,0.000056018358],"domain_scores_gemma":[0.99745303,0.0016729205,0.00008477407,0.00046765173,0.00025052155,0.00007104639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055078376,0.0009933212,0.00065672165,0.0010964382,0.0004502173,0.0013260255,0.001219353,0.00072595844,0.0115095815],"category_scores_gemma":[0.0039047883,0.0004888067,0.00045862736,0.0011271446,0.0013525801,0.0018719069,0.0009377827,0.0013215742,0.0022943146],"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.00015018777,0.0001395263,0.00083835184,0.0005063803,0.000048337464,0.00044891695,0.00059340004,0.012977777,0.020571267,0.3034498,0.020994095,0.639282],"study_design_scores_gemma":[0.000075206524,0.00036820272,0.0016692929,0.00042664487,0.000082914295,0.0016490319,0.00016130757,0.09249294,0.053375896,0.7164483,0.13320524,0.000045054105],"about_ca_topic_score_codex":0.0003623033,"about_ca_topic_score_gemma":0.00034401764,"teacher_disagreement_score":0.0115095815,"about_ca_system_score_codex":0.00036181175,"about_ca_system_score_gemma":0.00037272886,"threshold_uncertainty_score":0.03850335},"labels":[],"label_agreement":null},{"id":"W2481039330","doi":"10.1007/978-3-662-53090-0","title":"Transactions on Computational Science XXVIII","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.009994324620658813,"score_gpt":0.22507770956443365,"score_spread":0.21508338494377485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481039330","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069110543,0.07663063,0.46707386,0.01686511,0.034061085,0.00014449806,0.0025410228,0.0023885753,0.3933841],"genre_scores_gemma":[0.070538335,0.06873171,0.15781485,0.0020373254,0.008496355,0.0003997934,0.004795385,0.0022570738,0.6849292],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888164,0.00016756346,0.000084231615,0.00017207254,0.00063335506,0.00006114996],"domain_scores_gemma":[0.99849415,0.00044998372,0.000046217137,0.0005382997,0.00037641247,0.00009503829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011370205,0.0011727326,0.0018092428,0.0011441316,0.0006135046,0.0030153107,0.0012471438,0.0009578454,0.07817974],"category_scores_gemma":[0.004094073,0.00045576468,0.00079864543,0.00232527,0.0012229641,0.002299443,0.002582266,0.0025656987,0.02996984],"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.000059064838,0.000046569767,0.0003806491,0.00048667798,0.00005735099,0.00007116668,0.000096791846,0.0055016093,0.0014794825,0.1396989,0.2745863,0.5775354],"study_design_scores_gemma":[0.000019539602,0.00003151952,0.0007308377,0.00026811223,0.000036639165,0.00024147029,0.00010006809,0.022634588,0.0011271547,0.2432469,0.73154587,0.00001743446],"about_ca_topic_score_codex":0.0015203528,"about_ca_topic_score_gemma":0.0016685867,"teacher_disagreement_score":0.07817974,"about_ca_system_score_codex":0.0012078667,"about_ca_system_score_gemma":0.0013386129,"threshold_uncertainty_score":0.2615373},"labels":[],"label_agreement":null},{"id":"W2481230467","doi":"10.1007/978-3-319-41501-7_1","title":"Adaptation Approaches in Unsupervised Learning: A Survey of the State-of-the-Art and Future Directions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Novelty; Adaptation (eye); Unsupervised learning; Cluster analysis; Novelty detection; Artificial intelligence; Process (computing); Machine learning; Streaming data; Resource (disambiguation); Data science; Data mining","score_opus":0.034467529019190056,"score_gpt":0.23382533305983347,"score_spread":0.1993578040406434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481230467","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002881352,0.14475864,0.84394914,0.0016669667,0.00055391144,0.00007728802,0.00013029978,0.0009503694,0.0050319675],"genre_scores_gemma":[0.1050683,0.25598904,0.6209898,0.0017895242,0.0050969347,0.00034974035,0.0010136339,0.0009377058,0.008765204],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970824,0.00095404615,0.00026466613,0.00075019995,0.00082536443,0.00012329253],"domain_scores_gemma":[0.99044925,0.0069816313,0.00030929508,0.00094941846,0.0011453523,0.00016489616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050992114,0.0015010278,0.003274834,0.0018155574,0.00057940127,0.0037560968,0.0045382185,0.0020287482,0.0030198281],"category_scores_gemma":[0.011268772,0.00094170845,0.0017027258,0.004900811,0.0017809186,0.005791874,0.002963498,0.0032915918,0.0018646945],"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.000051522027,0.00016717736,0.0013960128,0.0016280251,0.00022854989,0.00004845196,0.0001717391,0.028469617,0.00088239426,0.029047037,0.009603984,0.92830545],"study_design_scores_gemma":[0.000040227547,0.0001928861,0.0033712243,0.0011979558,0.00028235084,0.00065333414,0.0003457817,0.6413129,0.0034497473,0.24024257,0.108712204,0.00019883121],"about_ca_topic_score_codex":0.003775636,"about_ca_topic_score_gemma":0.004098339,"teacher_disagreement_score":0.0050992114,"about_ca_system_score_codex":0.001032501,"about_ca_system_score_gemma":0.0015735144,"threshold_uncertainty_score":0.026967525},"labels":[],"label_agreement":null},{"id":"W2481648185","doi":"10.1007/978-3-642-28714-5","title":"Requirements Engineering: Foundation for Software Quality","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Victoria","funders":"","keywords":"Computer science; Software engineering; Foundation (evidence); Software quality; Software; Software development; Programming language","score_opus":0.045733995012544694,"score_gpt":0.3219999449201178,"score_spread":0.2762659499075731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481648185","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025132284,0.015024143,0.87235856,0.008446145,0.00069091644,0.00011024162,0.00018188967,0.0009925395,0.099682294],"genre_scores_gemma":[0.19298187,0.031841297,0.7099597,0.0024795022,0.0023585053,0.0006087168,0.0007446179,0.0011741242,0.05785169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964038,0.00078866305,0.00025426058,0.0003458737,0.0020384172,0.00016898893],"domain_scores_gemma":[0.9945042,0.0033743328,0.00028083194,0.0008387316,0.0009093386,0.00009254957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035551076,0.0010947337,0.0008668888,0.0017489176,0.00068627414,0.003455807,0.0014221484,0.0018031038,0.008514788],"category_scores_gemma":[0.011093211,0.00094934285,0.0011364613,0.0017570073,0.003446928,0.006739197,0.0019873155,0.0033303828,0.0034254133],"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.000011726249,0.000023227962,0.000104974926,0.00042880262,0.000019274295,0.00005054416,0.00023144283,0.004274824,0.000936759,0.84001744,0.014679769,0.13922124],"study_design_scores_gemma":[0.00001663168,0.000022433731,0.000141045,0.0002730625,0.000018803705,0.00012763772,0.000058457208,0.009448504,0.0009813474,0.88518053,0.103716284,0.000015184722],"about_ca_topic_score_codex":0.001319472,"about_ca_topic_score_gemma":0.0007753419,"teacher_disagreement_score":0.008514788,"about_ca_system_score_codex":0.0014854947,"about_ca_system_score_gemma":0.001959962,"threshold_uncertainty_score":0.028484821},"labels":[],"label_agreement":null},{"id":"W2481777768","doi":"10.1007/978-3-319-39862-4_37","title":"Quantitative, Qualitative, and Historical Urban Data Visualization Tools for Professionals and Stakeholders","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Visualization; Pace; Urban planning; Urbanization; Data science; Transportation planning; Qualitative analysis; Data visualization; Quantitative analysis (chemistry); Engineering management; Management science; Qualitative research; Transport engineering; Engineering; Data mining; Civil engineering","score_opus":0.24486950925831247,"score_gpt":0.4202382179762891,"score_spread":0.1753687087179766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481777768","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.045819372,0.0020816533,0.8507681,0.008658798,0.00035603394,0.00054565555,0.008427613,0.0070001413,0.07634268],"genre_scores_gemma":[0.28150225,0.0025780767,0.6786025,0.0004615671,0.0001229436,0.0013948572,0.0063498295,0.0025435386,0.02644438],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966769,0.0018892671,0.00023545002,0.00020448996,0.0008689841,0.00012482531],"domain_scores_gemma":[0.97788674,0.017460432,0.00064179546,0.0013123548,0.0023228915,0.00037577853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01147268,0.00087260036,0.0003611293,0.0057264445,0.0012356096,0.007009057,0.0011990531,0.00076420675,0.015609344],"category_scores_gemma":[0.022640593,0.0006325012,0.000495771,0.008282997,0.0015757512,0.0081429165,0.0030499394,0.001154628,0.0019496415],"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.00014320506,0.00019326001,0.011013746,0.0017736033,0.000044617474,0.00041462344,0.062358886,0.0052347053,0.0047522536,0.28083572,0.079053774,0.55418164],"study_design_scores_gemma":[0.00004409735,0.00011125249,0.008745493,0.0028271182,0.000075151234,0.0007946775,0.0821142,0.035876732,0.00865066,0.3751644,0.48543793,0.00015829397],"about_ca_topic_score_codex":0.0030958108,"about_ca_topic_score_gemma":0.007725717,"teacher_disagreement_score":0.015609344,"about_ca_system_score_codex":0.0019838326,"about_ca_system_score_gemma":0.0032472182,"threshold_uncertainty_score":0.06067407},"labels":[],"label_agreement":null},{"id":"W2481788784","doi":"10.1007/978-3-540-89740-8","title":"Languages and Compilers for Parallel Computing","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Compiler; Computer science; Programming language; Parallel computing","score_opus":0.01639165738688082,"score_gpt":0.2710666032993521,"score_spread":0.2546749459124713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481788784","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014037323,0.009255087,0.93202615,0.0009840223,0.0022641148,0.00014142125,0.0002477867,0.008164182,0.045513514],"genre_scores_gemma":[0.020974357,0.011551113,0.86560935,0.00079022226,0.001863968,0.0006316065,0.00089880056,0.006815391,0.090865254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903023,0.00022079554,0.000093755894,0.00012516884,0.0004565645,0.00007345431],"domain_scores_gemma":[0.99885345,0.0005162067,0.00007039025,0.0003003144,0.0002192214,0.00004046762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095181674,0.0017698868,0.0013468952,0.0014003809,0.0010482336,0.0031738968,0.0019306394,0.0010513013,0.014699207],"category_scores_gemma":[0.003390705,0.0016559473,0.0013254989,0.0036214222,0.0019317146,0.0047775228,0.0018541754,0.0036748233,0.00974564],"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.000049627786,0.00004295279,0.000089096815,0.0008034835,0.000041383202,0.00009707868,0.00029879052,0.006626771,0.0035129911,0.66306436,0.08510139,0.24027213],"study_design_scores_gemma":[0.000060622686,0.000035404395,0.00009156189,0.00022019356,0.000040937022,0.00034665468,0.000047385445,0.01951469,0.0040861745,0.52504265,0.4504731,0.000040625262],"about_ca_topic_score_codex":0.00068428967,"about_ca_topic_score_gemma":0.0009215244,"teacher_disagreement_score":0.014699207,"about_ca_system_score_codex":0.00089526706,"about_ca_system_score_gemma":0.0016521668,"threshold_uncertainty_score":0.049173772},"labels":[],"label_agreement":null},{"id":"W2482011423","doi":"10.1007/b13249","title":"Group Communications and Charges. Technology and Business Models","year":2003,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Group (periodic table); Business; Engineering; Telecommunications; Physics","score_opus":0.01850584541743928,"score_gpt":0.24481284783904403,"score_spread":0.22630700242160476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482011423","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045407605,0.024690907,0.008924458,0.011879933,0.002665637,0.000053404638,0.0004080243,0.00027425474,0.9465627],"genre_scores_gemma":[0.1851543,0.020875352,0.0033130562,0.002006389,0.0025131733,0.000117541385,0.0004614791,0.00017157994,0.7853871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.0001389567,0.000018544973,0.0000611404,0.00034435306,0.00007431556],"domain_scores_gemma":[0.99914765,0.000331789,0.000109333756,0.00011682376,0.00021373565,0.00008072198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055296073,0.0010587828,0.0004880811,0.0017294466,0.0013834046,0.004676526,0.00095341675,0.0019660036,0.054976787],"category_scores_gemma":[0.0035838343,0.00031833566,0.00035119176,0.0034189865,0.0014894216,0.0045098593,0.000908246,0.001780048,0.017163157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003058705,0.000030004994,0.00016266927,0.00007469579,0.000004857375,0.000051896517,0.00012300757,0.00098713,0.00012366779,0.794743,0.12569016,0.07797821],"study_design_scores_gemma":[0.000025203102,0.000031007887,0.0004004647,0.00011002826,0.000014290265,0.0002671058,0.00019003873,0.0015170693,0.00022141547,0.418791,0.57842153,0.000010858323],"about_ca_topic_score_codex":0.004001287,"about_ca_topic_score_gemma":0.0038286427,"teacher_disagreement_score":0.054976787,"about_ca_system_score_codex":0.0027927028,"about_ca_system_score_gemma":0.001868689,"threshold_uncertainty_score":0.18391567},"labels":[],"label_agreement":null},{"id":"W2482623798","doi":"10.1007/11734673","title":"Relational Methods in Computer Science","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; St. Francis Xavier University","funders":"","keywords":"Computer science","score_opus":0.040112007720914285,"score_gpt":0.31772793488529033,"score_spread":0.27761592716437605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482623798","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.001202494,0.03623596,0.86363894,0.003023019,0.001541115,0.00005220868,0.00027395392,0.0008255652,0.0932067],"genre_scores_gemma":[0.11231005,0.0524198,0.63791996,0.0019979302,0.005257271,0.000516173,0.0011556244,0.0014699411,0.18695326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836344,0.00058592064,0.000088567744,0.0002577789,0.0006567591,0.000047643804],"domain_scores_gemma":[0.99793905,0.00132331,0.00006132277,0.0004251139,0.00019689534,0.000054345546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001798072,0.0010171919,0.0014039442,0.0019585467,0.00073275925,0.0028821293,0.0012561693,0.0010350202,0.024545705],"category_scores_gemma":[0.0052169077,0.0007316857,0.00078171387,0.0037081318,0.0024549586,0.005398153,0.0015764927,0.0032224092,0.007607475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000584864,0.000011096356,0.000050431536,0.00018997844,0.000018349734,0.000016751306,0.0001245631,0.0009461343,0.00019697612,0.8952168,0.023538634,0.07968435],"study_design_scores_gemma":[0.0000061331098,0.0000072841926,0.00009564601,0.00007591085,0.000016915934,0.00007023178,0.00003230928,0.006513612,0.0002239522,0.87274605,0.12020433,0.000007648408],"about_ca_topic_score_codex":0.00096418237,"about_ca_topic_score_gemma":0.00093979615,"teacher_disagreement_score":0.024545705,"about_ca_system_score_codex":0.0011500895,"about_ca_system_score_gemma":0.0006471817,"threshold_uncertainty_score":0.082113564},"labels":[],"label_agreement":null},{"id":"W2482634404","doi":"10.1007/978-3-319-39510-4_52","title":"Multivariate Time Series ELM for Cloud Data Centre Workload Prediction","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Workload; Time series; Data mining; Multivariate statistics; Provisioning; Energy consumption; TRACE (psycholinguistics); Virtual machine; Sliding window protocol; Real-time computing; Machine learning; Operating system; Window (computing)","score_opus":0.01841282618176302,"score_gpt":0.23623052612313217,"score_spread":0.21781769994136915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482634404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019802686,0.00057100866,0.97782314,0.00022572902,0.00009526935,0.000018452292,0.0001931267,0.0006730096,0.0005974921],"genre_scores_gemma":[0.7423076,0.0013099869,0.24262233,0.00043165078,0.0005679475,0.0002145166,0.0014066277,0.0003708783,0.010768504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996767,0.0001061535,0.000020652167,0.00007930825,0.000067527675,0.000049717946],"domain_scores_gemma":[0.9985145,0.0010652328,0.00010382817,0.00009979412,0.00016522217,0.0000514506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013974946,0.00080674724,0.001272293,0.0005646957,0.0003224199,0.00068536395,0.0015196233,0.0010800554,0.0024903207],"category_scores_gemma":[0.0031485192,0.00049454474,0.0009735614,0.0010932856,0.00032295426,0.0009557501,0.00080646394,0.002091172,0.0009545438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637328,0.00010296132,0.0011637936,0.00007106842,0.0000915125,0.000054287706,0.000033067638,0.88189375,0.0018184399,0.0040866933,0.0023402355,0.108197734],"study_design_scores_gemma":[8.237058e-7,0.0000026244531,0.00006360798,0.0000010563346,0.0000017678336,0.000001952554,0.0000014904807,0.99926454,0.00007586612,0.00052667153,0.00005837012,0.0000012597428],"about_ca_topic_score_codex":0.005492644,"about_ca_topic_score_gemma":0.0054025375,"teacher_disagreement_score":0.005492644,"about_ca_system_score_codex":0.0005714314,"about_ca_system_score_gemma":0.00060564146,"threshold_uncertainty_score":0.010921359},"labels":[],"label_agreement":null},{"id":"W2482695635","doi":"10.1007/978-3-642-31570-1","title":"Deontic Logic in Computer Science","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Deontic logic; Computer science; Philosophy; Epistemology","score_opus":0.01893637462282539,"score_gpt":0.25296174153744533,"score_spread":0.23402536691461995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482695635","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035000376,0.15680787,0.17804596,0.008199483,0.0039937412,0.0000817945,0.00040126807,0.00043123993,0.6485386],"genre_scores_gemma":[0.21574049,0.17387524,0.13348363,0.006054708,0.009860695,0.00040316684,0.001651932,0.00065880426,0.45827138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957603,0.000108290486,0.000029057594,0.000071169765,0.00018161743,0.000033794822],"domain_scores_gemma":[0.99949133,0.00031962738,0.000024903064,0.00006563731,0.00007261128,0.000025917201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077180937,0.00088501483,0.0007558611,0.0013459842,0.0012907954,0.0036904013,0.0009539779,0.0011531871,0.008307242],"category_scores_gemma":[0.0011880628,0.0005765705,0.00053878437,0.0027182915,0.0030787387,0.0051299892,0.0009080544,0.0036851694,0.0028563344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060260027,0.000010321942,0.000025807083,0.00012374883,0.0000040951754,0.000021607313,0.00014000961,0.0004032036,0.00015549641,0.95073384,0.020723166,0.027652675],"study_design_scores_gemma":[0.0000058999585,0.000005577015,0.00007989342,0.000091719754,0.0000053106487,0.00008698922,0.000038064325,0.00082341867,0.00013300245,0.82250094,0.17622334,0.0000058636992],"about_ca_topic_score_codex":0.0018384597,"about_ca_topic_score_gemma":0.0020235626,"teacher_disagreement_score":0.008307242,"about_ca_system_score_codex":0.002178618,"about_ca_system_score_gemma":0.0013704645,"threshold_uncertainty_score":0.027790487},"labels":[],"label_agreement":null},{"id":"W2482750740","doi":"10.1007/978-3-319-41114-9_15","title":"State Complexity of Prefix Distance of Subregular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Regular language; Deterministic finite automaton; Neighbourhood (mathematics); Finite-state machine; Combinatorics; Alphabet; Mathematics; Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.01602923877316603,"score_gpt":0.24238024157622856,"score_spread":0.22635100280306253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482750740","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.8136626,0.00075217074,0.1562676,0.0018225695,0.000090067486,0.0000708586,0.0013089972,0.00046964872,0.025555506],"genre_scores_gemma":[0.9837134,0.00029603133,0.009821688,0.0000870289,0.00013344642,0.00008940783,0.0007459096,0.0001542319,0.004958881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750715,0.0005336269,0.00017382833,0.0005629428,0.00080892514,0.00041352847],"domain_scores_gemma":[0.97789717,0.017571336,0.0010252071,0.0016109524,0.0010631946,0.00083223876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127172,0.000523567,0.0013399138,0.0013375481,0.0013554365,0.0056218994,0.0025730173,0.0016899896,0.011409821],"category_scores_gemma":[0.0142968185,0.0006692153,0.0012457555,0.0017781436,0.0026707277,0.009805922,0.00324553,0.0034174903,0.0007887137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046758732,0.00010318224,0.0022186697,0.00020374359,0.00004002155,0.00015069157,0.00079908106,0.04284411,0.004050575,0.9296829,0.0021394175,0.017299999],"study_design_scores_gemma":[0.000026492062,0.000037022462,0.00055245514,0.000013899984,0.000020506808,0.0000664119,0.00009130889,0.12841514,0.0013597312,0.8688478,0.00054544635,0.000023894996],"about_ca_topic_score_codex":0.0016564801,"about_ca_topic_score_gemma":0.0013975046,"teacher_disagreement_score":0.011409821,"about_ca_system_score_codex":0.002918177,"about_ca_system_score_gemma":0.0017665084,"threshold_uncertainty_score":0.038169622},"labels":[],"label_agreement":null},{"id":"W2482943584","doi":"10.1007/978-3-540-68825-9","title":"Advances in Artificial Intelligence","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Digital Economy","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Regina; Concordia University; University of Alberta","funders":"","keywords":"Windsor; Computer science; Artificial intelligence; Operations research; Data science; Engineering","score_opus":0.03096667502955157,"score_gpt":0.2630952357029157,"score_spread":0.23212856067336413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482943584","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017989929,0.22339886,0.05359568,0.01285212,0.0131402295,0.00007517459,0.00032322152,0.00084413245,0.69397163],"genre_scores_gemma":[0.031757496,0.19094087,0.033905156,0.0041589113,0.008688519,0.0001663014,0.000757064,0.00050144974,0.7291242],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925774,0.00012812429,0.000037416947,0.000089247485,0.00044143604,0.00004600064],"domain_scores_gemma":[0.9989618,0.0004546597,0.000046001493,0.00024471004,0.00020369489,0.00008922259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010521921,0.0011416145,0.0013815699,0.0017919051,0.0006211539,0.0037001497,0.0011193154,0.0012697072,0.045064848],"category_scores_gemma":[0.002217648,0.00047018373,0.00042871328,0.002560028,0.0016613037,0.0046841074,0.0020978285,0.0028050789,0.027431058],"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.00002457864,0.00006105818,0.00016580088,0.0007031263,0.000031717434,0.000057013414,0.00019662341,0.0007762095,0.00067744014,0.20074072,0.3170941,0.47947156],"study_design_scores_gemma":[0.0000064145297,0.000019506622,0.00024440308,0.0002707564,0.000012066351,0.000108972104,0.000060323644,0.0009929406,0.0002534487,0.09482634,0.9031987,0.0000060949883],"about_ca_topic_score_codex":0.00047463118,"about_ca_topic_score_gemma":0.00094461686,"teacher_disagreement_score":0.045064848,"about_ca_system_score_codex":0.00091033964,"about_ca_system_score_gemma":0.0011531695,"threshold_uncertainty_score":0.1507569},"labels":[],"label_agreement":null},{"id":"W2483058053","doi":"10.1007/978-3-319-40409-7_8","title":"High Fives to the Avant-Garde","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Art, Politics, and Modernism","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta College of Art + Design","funders":"","keywords":"Computer science; Avant garde; Art history; Art","score_opus":0.03255110499581272,"score_gpt":0.23869837839485647,"score_spread":0.20614727339904376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483058053","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072848597,0.007859183,0.029924776,0.019656572,0.0026597767,0.00003788787,0.000036786325,0.00014684515,0.93239325],"genre_scores_gemma":[0.5331375,0.006083501,0.014994642,0.010437617,0.0014673079,0.00014754126,0.000077077624,0.00043291113,0.43322188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974069,0.0016470291,0.000056580786,0.00023348493,0.00041066724,0.0002452482],"domain_scores_gemma":[0.99847597,0.00078729447,0.000090739275,0.00016792821,0.0002433662,0.000234652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027646415,0.0006983585,0.00032166924,0.0011107033,0.005362719,0.0078057596,0.00069126906,0.0022199948,0.011038534],"category_scores_gemma":[0.004448253,0.00024305274,0.00034299266,0.00071232684,0.017919827,0.005147629,0.004772368,0.005050058,0.003663296],"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.0000085197635,0.000004283377,0.000036054364,0.000020197313,8.84273e-7,0.000047327394,0.004172478,0.000033097873,0.00006352801,0.9831571,0.006278145,0.0061782566],"study_design_scores_gemma":[0.000005140281,0.000021553607,0.00005826532,0.00017709853,0.000002205831,0.00015674416,0.0030215175,0.00013162426,0.00018136867,0.26815408,0.7280834,0.0000071214595],"about_ca_topic_score_codex":0.0025339783,"about_ca_topic_score_gemma":0.0032864457,"teacher_disagreement_score":0.011038534,"about_ca_system_score_codex":0.0032609645,"about_ca_system_score_gemma":0.0017327162,"threshold_uncertainty_score":0.03692758},"labels":[],"label_agreement":null},{"id":"W2483168937","doi":"10.1007/978-3-319-41827-8_14","title":"Localization and Segmentation of 3D Intervertebral Discs from MR Images via a Learning Based Method: A Validation Framework","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and 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":"Western University","funders":"","keywords":"Segmentation; Ground truth; Computer science; Artificial intelligence; Standard deviation; Pattern recognition (psychology); Magnetic resonance imaging; Image segmentation; Computer vision; Mathematics; Statistics; Medicine","score_opus":0.00890698239853579,"score_gpt":0.2555160167459173,"score_spread":0.2466090343473815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483168937","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.016503373,0.00038837246,0.9817892,0.000105388855,0.000019788953,0.00005350197,0.00009126684,0.00071380974,0.00033523378],"genre_scores_gemma":[0.31652236,0.0005438058,0.6780249,0.0001442385,0.00006867457,0.00020572379,0.0010379285,0.00041872443,0.0030337377],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979163,0.0006349132,0.00017385832,0.0005618556,0.00055153033,0.00016170241],"domain_scores_gemma":[0.9955811,0.001934756,0.00046711246,0.0006207605,0.001286183,0.00011006317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006299479,0.0013422539,0.0017636493,0.0019730427,0.00072654185,0.002356311,0.0032446368,0.0041792663,0.001265757],"category_scores_gemma":[0.0072113955,0.00087402243,0.0017538229,0.0010867915,0.0018990429,0.0012806815,0.0020301475,0.0016611923,0.00092234666],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050833396,0.00023280829,0.00446621,0.0004358107,0.0002644313,0.00017804425,0.00019026891,0.44753388,0.0506992,0.00904796,0.002168661,0.48427442],"study_design_scores_gemma":[0.000008326135,0.000080484504,0.0009348015,0.000026575162,0.00002588514,0.000087112174,0.000017954684,0.9890932,0.007326091,0.001831128,0.0005532624,0.00001532059],"about_ca_topic_score_codex":0.0068728263,"about_ca_topic_score_gemma":0.005429569,"teacher_disagreement_score":0.0068728263,"about_ca_system_score_codex":0.0011539805,"about_ca_system_score_gemma":0.0019165019,"threshold_uncertainty_score":0.03331524},"labels":[],"label_agreement":null},{"id":"W2483802010","doi":"10.1007/978-3-319-41264-1_29","title":"Online Graphics for the Blind: Intermediate Format Generation for Graphic Categories","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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":"Computer science; Graphics; Computer graphics (images); Key (lock); Computer graphics; Vector graphics; Operating system","score_opus":0.05044545965250389,"score_gpt":0.31799505047776894,"score_spread":0.267549590825265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483802010","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.0074256086,0.0005161095,0.8985309,0.00034695436,0.0006346294,0.00026743664,0.002536086,0.031446364,0.05829584],"genre_scores_gemma":[0.10026439,0.00092789915,0.78709847,0.00028220398,0.00028193524,0.00065962353,0.008633758,0.01253366,0.08931816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943465,0.0001134528,0.00004471802,0.00008347115,0.0002571598,0.00006659581],"domain_scores_gemma":[0.99837327,0.00066363846,0.000042040872,0.00041042117,0.00041237895,0.000098255354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998956,0.0011831349,0.00052860007,0.002392152,0.00066370267,0.0029517454,0.0019542342,0.0010734857,0.114729226],"category_scores_gemma":[0.005321541,0.00049260264,0.0009926916,0.0022246176,0.0005742175,0.00321209,0.0030298678,0.0014403708,0.024552492],"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.00023113997,0.00010466064,0.00039095271,0.00030227922,0.00001696599,0.00019864245,0.0010154652,0.0021689935,0.0081170695,0.03799319,0.11410472,0.835356],"study_design_scores_gemma":[0.00013862294,0.00025628295,0.001570866,0.0005077202,0.000081456565,0.0010722739,0.0010567443,0.07852744,0.045487713,0.12950781,0.7416494,0.0001436591],"about_ca_topic_score_codex":0.001302331,"about_ca_topic_score_gemma":0.0016136965,"teacher_disagreement_score":0.114729226,"about_ca_system_score_codex":0.00047218555,"about_ca_system_score_gemma":0.0006286926,"threshold_uncertainty_score":0.38380748},"labels":[],"label_agreement":null},{"id":"W2484590830","doi":"10.1007/978-3-319-41501-7_28","title":"Multinomial Sequence Based Estimation Using Contiguous Subsequences of Length Three","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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":"Multinomial distribution; Sequence (biology); Algorithm; Computer science; Bayesian probability; Binomial (polynomial); Convergence (economics); Field (mathematics); Set (abstract data type); Mathematics; Statistics; Artificial intelligence","score_opus":0.047042115946008455,"score_gpt":0.29384706124633914,"score_spread":0.24680494530033067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484590830","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.012992922,0.00031856226,0.98582536,0.00006138174,0.000055819088,0.00001328765,0.000054193893,0.00023305514,0.00044542408],"genre_scores_gemma":[0.27500898,0.00089864776,0.7145175,0.0001324948,0.00020747972,0.00012985308,0.0010823294,0.00020255886,0.007820251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999035,0.0003452396,0.00007721444,0.00023305339,0.0002210372,0.00008850283],"domain_scores_gemma":[0.9960836,0.0026440204,0.00024770782,0.00044802707,0.00048391422,0.000092776674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038866,0.00081182376,0.0011621608,0.0009757566,0.0004970379,0.0007739621,0.0011979315,0.0013014657,0.002673881],"category_scores_gemma":[0.007129059,0.00056822266,0.0008411185,0.001564502,0.00051944546,0.0019914669,0.0012611547,0.0012533368,0.0018565526],"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.0008796442,0.0002558412,0.0060964627,0.0003324246,0.00022326468,0.0004638199,0.00029447002,0.20260394,0.056321166,0.033081286,0.0035503695,0.69589746],"study_design_scores_gemma":[0.000011824741,0.00005282255,0.0008027389,0.000019240917,0.000019815296,0.00016191856,0.000021975075,0.9865637,0.0052653137,0.0060176947,0.001046365,0.000016642227],"about_ca_topic_score_codex":0.0019218149,"about_ca_topic_score_gemma":0.0031004956,"teacher_disagreement_score":0.002673881,"about_ca_system_score_codex":0.00027217277,"about_ca_system_score_gemma":0.0009363684,"threshold_uncertainty_score":0.009540021},"labels":[],"label_agreement":null},{"id":"W2484705263","doi":"10.1007/978-3-319-42324-1_5","title":"Haptic Feedback to Compensate for the Absence of Horizon Cues During Landing","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"McGill University","funders":"","keywords":"Haptic technology; Illusion; Computer science; Computer vision; Task (project management); Stereotaxy; Sensory cue; Visual feedback; Object (grammar); Simulation; Artificial intelligence; Cognitive psychology; Psychology; Engineering","score_opus":0.031143054633919087,"score_gpt":0.3246772785421201,"score_spread":0.293534223908201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484705263","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.55073667,0.0034808998,0.426982,0.0007357707,0.0013705428,0.00014468287,0.0002812584,0.002224969,0.014043134],"genre_scores_gemma":[0.9645026,0.00038876527,0.030460922,0.00015359791,0.00009172301,0.000025029398,0.00007729334,0.000075543685,0.0042244727],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999323,0.0000075383546,0.0000038153225,0.0000111586605,0.00003137326,0.000013806756],"domain_scores_gemma":[0.9997483,0.00013008034,0.000031546526,0.000024405203,0.000046887286,0.000018748433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017125756,0.00034353504,0.00018056936,0.00014178453,0.00011734567,0.00031880365,0.00035328348,0.00052825,0.0038100067],"category_scores_gemma":[0.0010180591,0.00011966029,0.00012800636,0.00013118132,0.00012370513,0.00033470654,0.00028458794,0.0004256297,0.00040513754],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018822609,0.00024548796,0.000527147,0.00037338847,0.000028406697,0.0002130342,0.00014194817,0.003948953,0.7170141,0.00068711117,0.0020056379,0.27293256],"study_design_scores_gemma":[0.001156211,0.00904514,0.05671392,0.00041992363,0.00038389728,0.0030392054,0.0003904168,0.34490016,0.555182,0.004343048,0.02423888,0.00018714582],"about_ca_topic_score_codex":0.0005186173,"about_ca_topic_score_gemma":0.000872459,"teacher_disagreement_score":0.0038100067,"about_ca_system_score_codex":0.000071010465,"about_ca_system_score_gemma":0.00014155125,"threshold_uncertainty_score":0.012745798},"labels":[],"label_agreement":null},{"id":"W2484778760","doi":"10.1007/978-3-319-39399-5_33","title":"A Model Based Approach to Web Application Design for Older Adults Using MVC Design Pattern","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Sheridan College","funders":"","keywords":"Computer science; Usability; Web design; The Internet; Web application; World Wide Web; Software design pattern; Key (lock); Human–computer interaction; Software; Operating system","score_opus":0.04651806914552758,"score_gpt":0.2849125765503438,"score_spread":0.2383945074048162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484778760","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.014496264,0.00012441442,0.97261345,0.00047679743,0.000034163986,0.00029456717,0.00014875087,0.0013854109,0.010426217],"genre_scores_gemma":[0.10115645,0.00015610855,0.88959616,0.00014586026,0.000009118101,0.00045068387,0.00031859116,0.00023873393,0.007928387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854386,0.0005151882,0.00013250903,0.00022109674,0.00051054585,0.00007682064],"domain_scores_gemma":[0.9981779,0.00083583966,0.00012673553,0.00028032335,0.00049460406,0.000084600724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013927,0.00066478807,0.0004817358,0.0011489661,0.00080888363,0.0029095723,0.001867614,0.001371377,0.0054553123],"category_scores_gemma":[0.0042651067,0.0007139021,0.0013129746,0.00071825186,0.00068548904,0.0021957753,0.0017026488,0.0014156584,0.0010011833],"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.00031608733,0.00096926326,0.008663053,0.0010839442,0.00020479588,0.0010942245,0.009766696,0.069224276,0.043561712,0.24302244,0.016971568,0.6051219],"study_design_scores_gemma":[0.000099501805,0.00042805745,0.002879635,0.000643282,0.00020544398,0.0011742905,0.002465931,0.7531888,0.013866481,0.12380652,0.101133056,0.00010894536],"about_ca_topic_score_codex":0.006705632,"about_ca_topic_score_gemma":0.011920524,"teacher_disagreement_score":0.006705632,"about_ca_system_score_codex":0.0014982248,"about_ca_system_score_gemma":0.0017738104,"threshold_uncertainty_score":0.01824987},"labels":[],"label_agreement":null},{"id":"W2484984088","doi":"10.1007/978-3-642-38085-3","title":"Augmented Environments for Computer-Assisted Interventions","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"Robarts Clinical Trials","funders":"","keywords":"Computer science; Conjunction (astronomy); Psychological intervention; Nice; Human–computer interaction; Multimedia; World Wide Web; Programming language; Medicine; Nursing","score_opus":0.021901189694276065,"score_gpt":0.25293279392344087,"score_spread":0.2310316042291648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484984088","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.0064707673,0.13066538,0.6965993,0.00077813555,0.005470486,0.00018754462,0.0012766771,0.0058342167,0.15271758],"genre_scores_gemma":[0.0904412,0.10302015,0.3252816,0.0006927863,0.0016096586,0.0005553711,0.0026636147,0.0011696389,0.47456595],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969673,0.00006806255,0.000017123486,0.000040375984,0.0001586137,0.000019023073],"domain_scores_gemma":[0.9997807,0.00011978547,0.000012780968,0.00003886863,0.000036517944,0.00001139635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021419265,0.0014867499,0.0006654622,0.0006900244,0.00024920353,0.0015443381,0.0011947858,0.0012098529,0.048918948],"category_scores_gemma":[0.00053891813,0.00041164653,0.0005304825,0.00089539343,0.00036201705,0.0015017542,0.0018664136,0.0009505946,0.010838209],"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.00018592297,0.000057469668,0.00007269102,0.001242159,0.00005450842,0.00024891132,0.00015449745,0.0040359665,0.013865984,0.02159128,0.08837172,0.870119],"study_design_scores_gemma":[0.000051888535,0.00027359548,0.0008939094,0.0008795786,0.00007876971,0.002489568,0.00014693207,0.01375329,0.00831777,0.026314406,0.9467272,0.00007306069],"about_ca_topic_score_codex":0.00024707758,"about_ca_topic_score_gemma":0.0006327743,"teacher_disagreement_score":0.048918948,"about_ca_system_score_codex":0.00015870114,"about_ca_system_score_gemma":0.00018247323,"threshold_uncertainty_score":0.16365016},"labels":[],"label_agreement":null},{"id":"W2484986450","doi":"10.1007/978-3-642-38536-0","title":"Computer Science – Theory and Applications","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"History of Computing Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cognitive science; Psychology","score_opus":0.009592964276781005,"score_gpt":0.2345707839780043,"score_spread":0.2249778197012233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484986450","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034725103,0.2718666,0.144933,0.0097860005,0.008094217,0.00010368206,0.00040163676,0.0007073875,0.56063503],"genre_scores_gemma":[0.13075152,0.30798298,0.083206475,0.005538621,0.015684813,0.0006251996,0.0010604155,0.00069359347,0.45445636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993734,0.00014757316,0.000025547344,0.000102852755,0.00030134426,0.000049414466],"domain_scores_gemma":[0.9992167,0.00038568737,0.000036356996,0.00014454196,0.00016675389,0.00004992898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004186739,0.0011547271,0.0015322857,0.0026994848,0.0007883204,0.0032967222,0.0010852856,0.0015409647,0.026517387],"category_scores_gemma":[0.0019609195,0.000486109,0.0004885831,0.0046164626,0.0023207995,0.003704063,0.0014365906,0.0031066888,0.012842058],"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.000011686003,0.000032229218,0.00016693158,0.000691951,0.000018995155,0.000053459862,0.00013496373,0.0019160457,0.00075526536,0.6470496,0.13706584,0.21210304],"study_design_scores_gemma":[0.000006567849,0.000017897726,0.0003095384,0.0002966397,0.000012400868,0.00028531166,0.00006816401,0.0050140396,0.0003568449,0.5128189,0.48080072,0.0000129741165],"about_ca_topic_score_codex":0.000542545,"about_ca_topic_score_gemma":0.0006296536,"teacher_disagreement_score":0.026517387,"about_ca_system_score_codex":0.0016634119,"about_ca_system_score_gemma":0.0010350577,"threshold_uncertainty_score":0.08870953},"labels":[],"label_agreement":null},{"id":"W2485113444","doi":"10.1007/978-3-319-39510-4_25","title":"New ISO Standards for Usability, Usability Reports and Usability Measures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":216,"is_retracted":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":"Usability; Computer science; Usability engineering; Usability lab; Web usability; Usability inspection; System usability scale; Component-based usability testing; Heuristic evaluation; Cognitive walkthrough; Pluralistic walkthrough; Human–computer interaction; Software engineering; World Wide Web","score_opus":0.03476624718639018,"score_gpt":0.2879566603387476,"score_spread":0.25319041315235746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485113444","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.005720039,0.08472292,0.68975997,0.016200827,0.013256406,0.002920524,0.0050034155,0.008798444,0.17361747],"genre_scores_gemma":[0.035843622,0.056559965,0.78467464,0.0076151676,0.0032059175,0.007859596,0.016581837,0.0039455066,0.08371377],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.94820154,0.012990916,0.008640777,0.0017098881,0.027551793,0.0009051067],"domain_scores_gemma":[0.9410672,0.020172488,0.0034180223,0.006549226,0.027895397,0.00089767575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03033134,0.0023614482,0.0020938802,0.010093945,0.001726339,0.009549413,0.0042831614,0.003917251,0.008288274],"category_scores_gemma":[0.07229601,0.0014932696,0.0019462848,0.009900274,0.0027630238,0.009544927,0.003573975,0.009197773,0.011035531],"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.00013385367,0.00041501087,0.0014789111,0.0033795747,0.00009293267,0.00011085193,0.0023970737,0.00071668683,0.004630311,0.11460875,0.2683411,0.60369486],"study_design_scores_gemma":[0.00006084047,0.00030539648,0.006325781,0.0056656525,0.00017995176,0.0011158077,0.0015781947,0.0026234903,0.004313055,0.10134178,0.87625,0.00023995545],"about_ca_topic_score_codex":0.0034876645,"about_ca_topic_score_gemma":0.004967595,"teacher_disagreement_score":0.03033134,"about_ca_system_score_codex":0.0030704688,"about_ca_system_score_gemma":0.01073091,"threshold_uncertainty_score":0.16040939},"labels":[],"label_agreement":null},{"id":"W2485549425","doi":"10.1007/978-3-319-41546-8_29","title":"Local Detectability Maps as a Tool for Predicting Masking Probability and Mammographic Performance","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Radiography and Breast Imaging","field":"Medicine","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 Toronto; Health Sciences Centre; Sunnybrook Health Science Centre","funders":"","keywords":"Mammography; Computer science; Histogram; Artificial intelligence; MAMMOGRAPHIC DENSITY; Masking (illustration); Pattern recognition (psychology); Data set; Breast density; Noise (video); Breast cancer; Medicine; Cancer; Image (mathematics)","score_opus":0.010602220801187064,"score_gpt":0.22794242541587773,"score_spread":0.21734020461469067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485549425","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.46467942,0.0029987176,0.5191915,0.00021016707,0.00007346785,0.000094250056,0.0017287238,0.0029849077,0.008038867],"genre_scores_gemma":[0.92185056,0.0006638791,0.073940806,0.000035551515,0.00006423369,0.000047730286,0.00074277085,0.00018102273,0.0024733164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980825,0.000041204737,0.000009913083,0.00004381568,0.00008077103,0.00001609517],"domain_scores_gemma":[0.9961642,0.0030806588,0.00028175148,0.0001538958,0.00025206569,0.00006739727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074873865,0.0006944441,0.00047156576,0.0015165118,0.00014052098,0.00092856487,0.00046617416,0.0006642324,0.003433511],"category_scores_gemma":[0.005466163,0.00028611007,0.00035912995,0.0008284473,0.00023543372,0.0009966799,0.00040587178,0.0004629241,0.0011946486],"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.0019416295,0.00028939286,0.08992656,0.00038169307,0.0003129086,0.00053590455,0.00019938526,0.07316937,0.1297558,0.0028854352,0.0037599523,0.6968419],"study_design_scores_gemma":[0.000041418705,0.0007220614,0.14115055,0.000072232,0.0004032252,0.0018576045,0.00014998252,0.75195986,0.08732218,0.013699547,0.0025005385,0.00012083312],"about_ca_topic_score_codex":0.0009404653,"about_ca_topic_score_gemma":0.0010030536,"teacher_disagreement_score":0.003433511,"about_ca_system_score_codex":0.00025783305,"about_ca_system_score_gemma":0.00014636511,"threshold_uncertainty_score":0.011486292},"labels":[],"label_agreement":null},{"id":"W2485677833","doi":"10.1007/978-3-319-41579-6_13","title":"Estimating Development Effort for Software Architectural Tactics","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Analytic hierarchy process; Key (lock); Quality (philosophy); Software; Software engineering; Process (computing); Software development; Product (mathematics); Software quality; Estimation; Hierarchy; Risk analysis (engineering); Systems engineering; Operations research; Computer security; Engineering","score_opus":0.020850553755454176,"score_gpt":0.2705426495716893,"score_spread":0.2496920958162351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485677833","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.55707633,0.0022200642,0.4291914,0.00016882094,0.000051071358,0.00013926871,0.0009881769,0.0024420242,0.007722883],"genre_scores_gemma":[0.7084715,0.0006215853,0.28559372,0.000016599373,0.000028473041,0.0001217806,0.002062482,0.00031042416,0.002773541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976755,0.00064491434,0.00017334394,0.00035886472,0.0009883092,0.00015905993],"domain_scores_gemma":[0.97816205,0.016410165,0.0014478012,0.0016570258,0.002066549,0.00025649247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018425647,0.0011103341,0.00049635425,0.004365117,0.00030709623,0.0008222437,0.00088851666,0.0006308961,0.0020572061],"category_scores_gemma":[0.024757326,0.0005254834,0.00091498985,0.0024713357,0.00018932908,0.0019633006,0.0007005489,0.0006880019,0.0006350366],"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.0003523468,0.0002432957,0.081656136,0.00034563974,0.0001487631,0.00011207638,0.00028804384,0.15389104,0.008260701,0.0035582203,0.0019834323,0.7491603],"study_design_scores_gemma":[0.00003270782,0.00041893168,0.040984094,0.00008525435,0.00014812124,0.00018995145,0.00017077503,0.93893105,0.010418348,0.0066353115,0.001952845,0.000032624266],"about_ca_topic_score_codex":0.0031553903,"about_ca_topic_score_gemma":0.005355772,"teacher_disagreement_score":0.004365117,"about_ca_system_score_codex":0.0007704502,"about_ca_system_score_gemma":0.00065968314,"threshold_uncertainty_score":0.009744525},"labels":[],"label_agreement":null},{"id":"W2485852301","doi":"10.1007/978-3-319-39513-5_17","title":"MEseum: Personalized Experience with Narrative Visualization for Museum Visitors","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Carleton University","funders":"","keywords":"Computer science; Narrative; Visualization; World Wide Web; Computer graphics (images); Human–computer interaction; Multimedia; Artificial intelligence; Art; Literature","score_opus":0.020553346130928803,"score_gpt":0.30366115038489244,"score_spread":0.28310780425396365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485852301","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28587592,0.006246379,0.2733275,0.0037571196,0.0019481134,0.00081510114,0.024397515,0.07176119,0.3318711],"genre_scores_gemma":[0.5263309,0.0030352802,0.19777144,0.0010314059,0.0005704031,0.00091850373,0.0136443125,0.010093764,0.246604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99986064,0.00004155346,0.0000057187385,0.000024339326,0.000038403192,0.000029379782],"domain_scores_gemma":[0.9996861,0.000117658405,0.000011097318,0.000051216677,0.000028476377,0.00010542115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031489998,0.0010393471,0.00036307552,0.00058477477,0.00072059076,0.0025279268,0.0011641147,0.0008385921,0.091886505],"category_scores_gemma":[0.0010207847,0.00029429112,0.0007108485,0.0004370452,0.00029627187,0.0018999478,0.003902591,0.00089964876,0.010800685],"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.0021024642,0.0005475773,0.003559925,0.0025631178,0.0001693409,0.0023236626,0.023965659,0.003292361,0.041151945,0.0129804285,0.40949544,0.49784815],"study_design_scores_gemma":[0.00032496185,0.0006347865,0.010673477,0.0007748017,0.00020834104,0.003243134,0.009851974,0.011731233,0.014453896,0.012372975,0.93547624,0.0002542451],"about_ca_topic_score_codex":0.0006207512,"about_ca_topic_score_gemma":0.00257029,"teacher_disagreement_score":0.091886505,"about_ca_system_score_codex":0.00022861868,"about_ca_system_score_gemma":0.00032431836,"threshold_uncertainty_score":0.307391},"labels":[],"label_agreement":null},{"id":"W2486065394","doi":"10.1007/978-3-319-42297-8_6","title":"Risk and Vulnerability Analysis of Critical Infrastructure","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Resilience and Vulnerability Analysis","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":"Concordia University","funders":"","keywords":"Vulnerability (computing); Trustworthiness; Government (linguistics); Risk analysis (engineering); Affect (linguistics); Computer science; Computer security; Critical infrastructure; Vulnerability assessment; Project commissioning; Business; Publishing; Political science; Sociology; Psychology; Law; Psychological resilience","score_opus":0.006076837574647783,"score_gpt":0.24016014829013518,"score_spread":0.2340833107154874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486065394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03561984,0.01955021,0.7956084,0.0031014853,0.00051911303,0.0000623789,0.0002929866,0.00027187608,0.14497365],"genre_scores_gemma":[0.8222039,0.026669312,0.07635898,0.00025883794,0.0010686907,0.00015663648,0.00037919282,0.00034883973,0.072555676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00015463037,0.000018905701,0.000064094245,0.0002316712,0.00005960679],"domain_scores_gemma":[0.99886703,0.0007303571,0.00010816869,0.000082721985,0.00017192995,0.00003984024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087981543,0.00126862,0.00062984024,0.0020024802,0.00046896088,0.0017533612,0.001146224,0.00097052514,0.0057709725],"category_scores_gemma":[0.0040751337,0.0004639704,0.001036066,0.0014738111,0.0013335306,0.002278321,0.0013634339,0.0019517053,0.00057223695],"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.000014598394,0.000026509028,0.0007806713,0.0001799642,0.00007325998,0.00014967685,0.00020426583,0.2385766,0.0009931694,0.7045405,0.007431366,0.047029376],"study_design_scores_gemma":[0.0000013411984,0.000012025481,0.000385508,0.00006996894,0.000017315833,0.000095472344,0.00006916466,0.1455452,0.00037909823,0.84467834,0.008731633,0.000014868236],"about_ca_topic_score_codex":0.0021726908,"about_ca_topic_score_gemma":0.0015724823,"teacher_disagreement_score":0.0057709725,"about_ca_system_score_codex":0.0016519639,"about_ca_system_score_gemma":0.00091519987,"threshold_uncertainty_score":0.019305885},"labels":[],"label_agreement":null},{"id":"W2486128846","doi":"10.1007/978-3-319-39555-5_3","title":"Low-Cost Mitigation Against Cold Boot Attacks for an Authentication Token","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Security token; Computer science; Authentication (law); Computer security; Computer network","score_opus":0.023891307412361857,"score_gpt":0.27321512386368785,"score_spread":0.24932381645132598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486128846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12693213,0.0026818935,0.817761,0.0012772208,0.0011925268,0.00054485194,0.00016668261,0.011571121,0.037872545],"genre_scores_gemma":[0.8920501,0.00036390097,0.072022416,0.00027931153,0.00025314654,0.00008278328,0.00012638193,0.00030202334,0.034519847],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873537,0.00014589248,0.000044740893,0.0001771725,0.0005995384,0.0002972037],"domain_scores_gemma":[0.99846554,0.00025491792,0.00017815159,0.0006423009,0.00036279828,0.000096278585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143353,0.0010058393,0.0009571284,0.0010570035,0.0013103487,0.0012138285,0.0019399327,0.001420209,0.0106774205],"category_scores_gemma":[0.0013589219,0.0004903584,0.0005416091,0.00051143457,0.0007160362,0.0024967005,0.0019136965,0.0014764984,0.005659224],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022100864,0.00035693316,0.0014396963,0.00063105905,0.00013152356,0.00061303144,0.0002661967,0.010329339,0.5129034,0.046849884,0.015329124,0.40893975],"study_design_scores_gemma":[0.00017213813,0.0020156428,0.0031850708,0.00016341539,0.00041834055,0.0037717246,0.00022077862,0.176833,0.6839019,0.024479978,0.104621336,0.00021683134],"about_ca_topic_score_codex":0.00034374767,"about_ca_topic_score_gemma":0.00056357007,"teacher_disagreement_score":0.0106774205,"about_ca_system_score_codex":0.00095261727,"about_ca_system_score_gemma":0.0009128959,"threshold_uncertainty_score":0.035719573},"labels":[],"label_agreement":null},{"id":"W2486175468","doi":"10.1007/978-3-540-87803-2","title":"Logics in Artificial Intelligence","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Artificial intelligence; Computer science","score_opus":0.03455620486527994,"score_gpt":0.264253910527364,"score_spread":0.22969770566208408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486175468","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002277989,0.26141205,0.097347006,0.017051622,0.0039637852,0.00007162847,0.00046596848,0.00071125437,0.61669874],"genre_scores_gemma":[0.21254699,0.21470593,0.10233811,0.012175166,0.012316445,0.00049869256,0.0026568582,0.00086885603,0.44189307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947256,0.0002024842,0.000028403634,0.00008002576,0.00017939755,0.000037198828],"domain_scores_gemma":[0.99934095,0.00040543766,0.000033456614,0.00009614141,0.000072945135,0.00005107639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008807388,0.0011063367,0.0010508382,0.0017148938,0.0011246407,0.00524723,0.0011037955,0.00127247,0.014353394],"category_scores_gemma":[0.0015186477,0.00056680414,0.00059353985,0.002405836,0.004449454,0.005987716,0.0015460227,0.0037982464,0.005370688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022904484,0.00002841151,0.00011241483,0.000207348,0.000019483101,0.00003587187,0.00033919187,0.000655337,0.00013214478,0.8545052,0.07431198,0.069629796],"study_design_scores_gemma":[0.000010446576,0.00000792173,0.000116759635,0.0001707163,0.0000069154285,0.00007569064,0.00008675401,0.000688242,0.00008923828,0.80305547,0.19568598,0.0000057695715],"about_ca_topic_score_codex":0.001364412,"about_ca_topic_score_gemma":0.00156954,"teacher_disagreement_score":0.014353394,"about_ca_system_score_codex":0.0019379561,"about_ca_system_score_gemma":0.0010381745,"threshold_uncertainty_score":0.048016906},"labels":[],"label_agreement":null},{"id":"W2486293373","doi":"10.1007/11569510","title":"Mobility Aware Technologies and Applications","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":50,"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; University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.010454062091640227,"score_gpt":0.23694353473905125,"score_spread":0.226489472647411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486293373","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065063816,0.28682047,0.14267914,0.0036558022,0.00580116,0.00018419228,0.00033423412,0.001985668,0.5520329],"genre_scores_gemma":[0.042609498,0.21250954,0.06505572,0.0015348714,0.0028560082,0.00028158128,0.00090219156,0.00045739513,0.67379314],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998161,0.000025466836,0.000010330828,0.000028328439,0.00009762902,0.000022173308],"domain_scores_gemma":[0.99983585,0.000059231916,0.000011030781,0.00003129604,0.00003958292,0.000022925797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024218965,0.0009879966,0.00054325216,0.0011732393,0.0004819273,0.0022103323,0.0007207343,0.0010079531,0.016531618],"category_scores_gemma":[0.0005724317,0.00041072204,0.0002937448,0.002227958,0.00046805764,0.003000375,0.0011968275,0.0012532879,0.01007889],"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.000044783617,0.00008949009,0.00019752243,0.000641282,0.000024678548,0.00023639662,0.00047408752,0.0017607855,0.00914206,0.15044019,0.13849132,0.6984575],"study_design_scores_gemma":[0.0000057297307,0.0000407981,0.0003481449,0.00032128437,0.00001879036,0.00058055064,0.00012099069,0.0022111014,0.0011258944,0.041053955,0.9541552,0.000017504724],"about_ca_topic_score_codex":0.00040386885,"about_ca_topic_score_gemma":0.00070570246,"teacher_disagreement_score":0.016531618,"about_ca_system_score_codex":0.00035088087,"about_ca_system_score_gemma":0.0003021971,"threshold_uncertainty_score":0.055303752},"labels":[],"label_agreement":null},{"id":"W2486361","doi":"10.1007/978-3-319-10404-1_99","title":"3D Prostate TRUS Segmentation Using Globally Optimized Volume-Preserving Prior","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Western University","funders":"","keywords":"Computer science; Segmentation; 3D ultrasound; Volume (thermodynamics); Artificial intelligence; Prostate biopsy; Image segmentation; Relaxation (psychology); Prostate; Mathematical optimization; Ultrasound; Algorithm; Computer vision; Mathematics; Medicine; Radiology","score_opus":0.013810641207331158,"score_gpt":0.2869940784312397,"score_spread":0.27318343722390853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486361","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.008804712,0.00030135366,0.98853767,0.000105842606,0.000020230798,0.00003475385,0.00015140821,0.0011558646,0.0008880977],"genre_scores_gemma":[0.19292086,0.0005989371,0.80077016,0.0001693351,0.00006865777,0.00014113195,0.0008716852,0.0010742444,0.0033850179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996151,0.00006595845,0.000022928101,0.00009660201,0.00015533717,0.00004401194],"domain_scores_gemma":[0.9995988,0.000120192984,0.000054970453,0.000106679734,0.000094260155,0.000025209585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099589,0.0009431069,0.0011225636,0.0011715937,0.00043655137,0.0018314692,0.0010022551,0.001339209,0.0015216757],"category_scores_gemma":[0.0015931618,0.00096842466,0.0012419636,0.0012060135,0.00048451367,0.0008904397,0.0013444364,0.0013113094,0.0011404874],"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.00041998966,0.0001297711,0.0015142545,0.00038390327,0.00016004089,0.00029012997,0.00027775925,0.43814436,0.08940915,0.010451104,0.0062617827,0.45255777],"study_design_scores_gemma":[0.000014743758,0.000055027373,0.00072672404,0.000023857354,0.000041539493,0.0003112709,0.00002291042,0.9704869,0.020162374,0.005038902,0.003080855,0.000034893663],"about_ca_topic_score_codex":0.004694701,"about_ca_topic_score_gemma":0.007289695,"teacher_disagreement_score":0.004694701,"about_ca_system_score_codex":0.00052300096,"about_ca_system_score_gemma":0.002043209,"threshold_uncertainty_score":0.009334743},"labels":[],"label_agreement":null},{"id":"W2486389624","doi":"10.1007/978-3-319-39817-4_6","title":"Positive Zero Forcing and Edge Clique Coverings","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Clique problem; Clique; Forcing (mathematics); Computer science; Popularity; Uniqueness; Enhanced Data Rates for GSM Evolution; Graph; Context (archaeology); Zero (linguistics); Discrete mathematics; Combinatorics; Mathematics; Theoretical computer science; Chordal graph; 1-planar graph; Artificial intelligence; Mathematical analysis","score_opus":0.013882316641440514,"score_gpt":0.26798024283240585,"score_spread":0.25409792619096533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486389624","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.30820882,0.0022669814,0.15721959,0.0036450513,0.0008831672,0.000075244316,0.0006161192,0.00052496366,0.52656],"genre_scores_gemma":[0.92245483,0.00094782945,0.016122809,0.0004477746,0.00044807873,0.000087878725,0.0004112817,0.00019948349,0.058879916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940836,0.00012793881,0.0000205854,0.00012358403,0.00017792996,0.00014163292],"domain_scores_gemma":[0.9977447,0.0014063068,0.00014497837,0.0002514794,0.000183701,0.0002688787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558274,0.00044934842,0.000681856,0.0013969756,0.0021552858,0.0019599893,0.0008108805,0.0010911584,0.01282335],"category_scores_gemma":[0.0032124782,0.00048502308,0.0007911896,0.00111919,0.0031430451,0.0027180717,0.0025767968,0.0024999743,0.001043556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024370798,0.000007243593,0.000104589984,0.000035615474,0.0000033308881,0.000037680806,0.000095954376,0.000796893,0.00045038905,0.99230766,0.0019056619,0.0042305156],"study_design_scores_gemma":[0.0000102681215,0.0000060897555,0.00013929163,0.00001683669,0.0000045203933,0.00009594835,0.000053295644,0.0023419468,0.0002894589,0.99214983,0.0048855185,0.0000069945418],"about_ca_topic_score_codex":0.00081646495,"about_ca_topic_score_gemma":0.001000522,"teacher_disagreement_score":0.01282335,"about_ca_system_score_codex":0.00093484455,"about_ca_system_score_gemma":0.0004591378,"threshold_uncertainty_score":0.042898357},"labels":[],"label_agreement":null},{"id":"W2486423751","doi":"10.1007/978-3-319-41920-6_6","title":"Using Support Vector Machines for Intelligent Service Agents Decision Making","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Benchmark (surveying); Web service; Service (business); Support vector machine; Machine learning; Task (project management); Quality of service; Kernel (algebra); Artificial intelligence; World Wide Web","score_opus":0.039271974262924725,"score_gpt":0.30996785066030125,"score_spread":0.2706958763973765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486423751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016358232,0.00082785566,0.9803547,0.00018127412,0.00011905754,0.000038233866,0.000045320303,0.0008022253,0.0012730599],"genre_scores_gemma":[0.586523,0.00081908196,0.40884057,0.00012125922,0.0001749615,0.00014661148,0.00026192793,0.00009846504,0.0030141696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989182,0.00044403106,0.00011334,0.00015615093,0.0002962605,0.00007200331],"domain_scores_gemma":[0.99696463,0.002338941,0.00010523437,0.000109578694,0.00044315,0.00003846126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001605417,0.0010606833,0.0012443056,0.000740113,0.00036413036,0.0013569691,0.000885302,0.0011172232,0.002116106],"category_scores_gemma":[0.006086481,0.00045470134,0.0007726766,0.0010588535,0.0003142974,0.0018549769,0.0006952007,0.0018103592,0.00069457514],"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.0003189131,0.00019614557,0.00066219404,0.0002524749,0.00017093608,0.00010948988,0.00009011788,0.47068438,0.00310035,0.006494824,0.0025433402,0.51537687],"study_design_scores_gemma":[0.000006311879,0.000017149778,0.00004821117,0.0000061542796,0.000008156712,0.0000069968087,0.000006547724,0.9955095,0.00061047217,0.0034985677,0.00027780497,0.0000041826534],"about_ca_topic_score_codex":0.0032610404,"about_ca_topic_score_gemma":0.0023610462,"teacher_disagreement_score":0.0032610404,"about_ca_system_score_codex":0.0004823081,"about_ca_system_score_gemma":0.00051901664,"threshold_uncertainty_score":0.008490384},"labels":[],"label_agreement":null},{"id":"W2486909683","doi":"10.1007/978-3-319-41501-7_74","title":"A Flexible 2D-3D Parametric Image Registration Algorithm for Cardiac MRI","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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 Ontario Institute of Technology","funders":"","keywords":"Image registration; Computer science; Affine transformation; Parametric statistics; Jaccard index; Artificial intelligence; Computer vision; Real-time MRI; Visualization; Magnetic resonance imaging; Algorithm; Transformation (genetics); Dice; Pattern recognition (psychology); Image (mathematics); Mathematics; Radiology","score_opus":0.020845587121649387,"score_gpt":0.31385686685108516,"score_spread":0.29301127972943575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486909683","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.0007914854,0.00017090664,0.9973863,0.000040763458,0.00004187077,0.000028015993,0.000043286374,0.0010430838,0.00045425055],"genre_scores_gemma":[0.014520055,0.00031827003,0.9820285,0.00010524799,0.00004641791,0.000094326424,0.00026082539,0.0006857393,0.0019406173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918455,0.000114190996,0.000060064805,0.00015127704,0.0004372748,0.00005271632],"domain_scores_gemma":[0.9993155,0.00022273308,0.000060897877,0.00019221494,0.00017038609,0.00003828588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082854,0.0010165815,0.0010214691,0.0012091508,0.0006104213,0.0017841799,0.0021716438,0.0017160412,0.0058133146],"category_scores_gemma":[0.0023453583,0.00092817214,0.0016906237,0.0018021323,0.0005711578,0.0013708482,0.002835919,0.002291181,0.0042061466],"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.00014680903,0.00007073318,0.00036185855,0.00017458582,0.000114524,0.00021487655,0.0001172374,0.036934253,0.054630894,0.011700291,0.011824242,0.8837098],"study_design_scores_gemma":[0.000043076943,0.00019342125,0.0016438673,0.00006446806,0.00011643816,0.002922099,0.000064283515,0.84334064,0.0708987,0.022716008,0.05782705,0.00017000013],"about_ca_topic_score_codex":0.001147041,"about_ca_topic_score_gemma":0.0023807916,"teacher_disagreement_score":0.0058133146,"about_ca_system_score_codex":0.00034824453,"about_ca_system_score_gemma":0.0010765996,"threshold_uncertainty_score":0.019447446},"labels":[],"label_agreement":null},{"id":"W2486979299","doi":"10.1007/978-3-642-38980-1","title":"Applied Cryptography and Network Security","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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 Calgary","funders":"","keywords":"Computer science; Cryptography; Neural cryptography; Computer security; Network security; Theoretical computer science; Public-key cryptography; Encryption","score_opus":0.006331778031524436,"score_gpt":0.2096626140410956,"score_spread":0.20333083600957116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486979299","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030425414,0.24394129,0.051445905,0.004040097,0.0066450746,0.00011827635,0.00014099549,0.00036767492,0.690258],"genre_scores_gemma":[0.048852265,0.1561286,0.030093372,0.0020683655,0.0055917813,0.00023504095,0.00028999973,0.00023085762,0.75650966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996829,0.000052811967,0.000010951106,0.000040699004,0.00018654174,0.000026118874],"domain_scores_gemma":[0.9998348,0.000060729148,0.000014445499,0.000033893048,0.000042324435,0.000013895162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029009473,0.0013796989,0.00088337867,0.0012673736,0.00060511555,0.0019868182,0.0005992388,0.0009999789,0.019228166],"category_scores_gemma":[0.00065254193,0.00035955646,0.00033654092,0.0015370674,0.0017880499,0.0026128625,0.0010653842,0.0029287029,0.011549681],"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.00004655991,0.00009008117,0.00014399049,0.0006187959,0.00003789932,0.00012128314,0.00032042104,0.0031473099,0.004625703,0.5268469,0.16767493,0.29632622],"study_design_scores_gemma":[0.000013957944,0.000055162956,0.00033487502,0.00036932676,0.0000119625,0.00034155737,0.0000628136,0.002963982,0.0011520045,0.27454475,0.7201348,0.000014817655],"about_ca_topic_score_codex":0.0003583864,"about_ca_topic_score_gemma":0.0005004625,"teacher_disagreement_score":0.019228166,"about_ca_system_score_codex":0.0008930669,"about_ca_system_score_gemma":0.0005714031,"threshold_uncertainty_score":0.06432462},"labels":[],"label_agreement":null},{"id":"W2487095096","doi":"10.1007/978-3-319-40578-0_22","title":"A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science; Transformation (genetics); Algorithm; Representation (politics); Function (biology); State (computer science); Theoretical computer science","score_opus":0.01412225893105541,"score_gpt":0.23224488058621814,"score_spread":0.21812262165516275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487095096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041854423,0.00019351627,0.9834493,0.00013089133,0.00009975548,0.00009756916,0.00009828865,0.002857977,0.008887303],"genre_scores_gemma":[0.12052607,0.00020974876,0.8706711,0.00011864421,0.000057528403,0.00026902521,0.00033116806,0.00045643633,0.007360161],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996107,0.00007431791,0.000023490758,0.00006358148,0.0001819382,0.000046022247],"domain_scores_gemma":[0.9996196,0.00018365555,0.000015589329,0.00008894352,0.00007707432,0.000015039466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038229246,0.0009010883,0.0008226485,0.0009851407,0.00078542973,0.0011514825,0.0014206005,0.00095503643,0.01856958],"category_scores_gemma":[0.0011489491,0.00044702238,0.00074941677,0.0012274069,0.00082601205,0.0012166249,0.0012971949,0.0014482574,0.0037162583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025822627,0.00010751262,0.00014132998,0.00025011503,0.000051263112,0.00010911473,0.000097280674,0.065819696,0.03480116,0.13248311,0.008356591,0.75752455],"study_design_scores_gemma":[0.00017423832,0.00020135446,0.00013044858,0.00005453039,0.000050167284,0.00020092746,0.000041378047,0.8041459,0.028896248,0.14119844,0.024857871,0.000048547718],"about_ca_topic_score_codex":0.0014418379,"about_ca_topic_score_gemma":0.0030046117,"teacher_disagreement_score":0.01856958,"about_ca_system_score_codex":0.0008789134,"about_ca_system_score_gemma":0.0013086861,"threshold_uncertainty_score":0.06212145},"labels":[],"label_agreement":null},{"id":"W2487140311","doi":"10.1007/11564751","title":"Principles and Practice of Constraint Programming - CP 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Operations Management Techniques","field":"Decision Sciences","cited_by":229,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Programming language; Constraint programming; Constraint (computer-aided design); Theoretical computer science; Mathematical optimization; Mathematics; Stochastic programming","score_opus":0.07116710252241898,"score_gpt":0.3758355662980198,"score_spread":0.3046684637756008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487140311","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.00094817294,0.028039303,0.7184342,0.007632569,0.0015965658,0.0003122498,0.0010043199,0.0014297698,0.24060284],"genre_scores_gemma":[0.02694993,0.039959706,0.8290824,0.0014371338,0.0010326788,0.0007005724,0.0016922143,0.0009081175,0.09823714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839693,0.00034773408,0.00013943674,0.00023720549,0.0007994874,0.00007914813],"domain_scores_gemma":[0.9981832,0.0007262576,0.00009355017,0.0004096412,0.00049645256,0.000090967194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002355418,0.0014503987,0.0011536721,0.0018658477,0.0013442708,0.0075806878,0.0032666186,0.0018617344,0.023972882],"category_scores_gemma":[0.005034776,0.0017784407,0.0011243959,0.0052441624,0.0035366039,0.006054683,0.0020630842,0.0052978448,0.009759786],"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.000017705484,0.000037175396,0.00009903866,0.00047290538,0.000032236076,0.00007194861,0.00021053261,0.006618282,0.0004542338,0.7182379,0.092703916,0.18104419],"study_design_scores_gemma":[0.000015945383,0.000010827323,0.00017712597,0.0005101192,0.000018355106,0.0002566812,0.000098526056,0.013357835,0.00080552284,0.5342118,0.45050505,0.000032212065],"about_ca_topic_score_codex":0.00971054,"about_ca_topic_score_gemma":0.009707345,"teacher_disagreement_score":0.023972882,"about_ca_system_score_codex":0.00287236,"about_ca_system_score_gemma":0.005090616,"threshold_uncertainty_score":0.080197215},"labels":[],"label_agreement":null},{"id":"W2487333573","doi":"10.1007/978-3-662-53015-3_2","title":"Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Computer science; Oblivious transfer; Commitment scheme; Theoretical computer science; Quantum; Adversary; Quantum cryptography; Bounded function; Quantum computer; Cryptography; Quantum information; Universality (dynamical systems); Algorithm; Mathematics; Computer security; Quantum mechanics","score_opus":0.0172501766086898,"score_gpt":0.24452140467209263,"score_spread":0.22727122806340283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487333573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091850564,0.002500109,0.8410313,0.0049920343,0.00022608678,0.00017301133,0.000092764065,0.00017537373,0.058958717],"genre_scores_gemma":[0.9044525,0.0016690701,0.08005042,0.0013433975,0.00038454347,0.00030664002,0.00005474304,0.000092869,0.011645751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971102,0.0011742034,0.00014514479,0.00051739917,0.00065163756,0.00040151775],"domain_scores_gemma":[0.9901102,0.0071303565,0.0006381344,0.0011469413,0.0005584541,0.00041588975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037480139,0.0009044196,0.0008405352,0.0011943249,0.0015455023,0.0027630473,0.001606694,0.0027459203,0.0045929085],"category_scores_gemma":[0.011770631,0.00047083938,0.0013221609,0.0011883288,0.007471268,0.005204875,0.004873692,0.004963359,0.0005409226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012818442,0.000012939694,0.00009936467,0.000022657043,0.0000057014877,0.00005196284,0.00012067685,0.003518642,0.00043623184,0.99324423,0.00018742167,0.0022873452],"study_design_scores_gemma":[0.00001584794,0.000036254438,0.00011197856,0.000024067615,0.000009390497,0.000053961336,0.000047369598,0.052996967,0.00051286106,0.9441564,0.0020217728,0.000013119685],"about_ca_topic_score_codex":0.0012048836,"about_ca_topic_score_gemma":0.00056244043,"teacher_disagreement_score":0.0045929085,"about_ca_system_score_codex":0.001803036,"about_ca_system_score_gemma":0.0011744378,"threshold_uncertainty_score":0.019821644},"labels":[],"label_agreement":null},{"id":"W2487730205","doi":"10.1007/3-540-45490-x","title":"Web Intelligence: Research and Development","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Science and Education Research","field":"Neuroscience","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Web application; Web intelligence; World Wide Web; Development (topology); Web development; The Internet","score_opus":0.1755159260907922,"score_gpt":0.4176944013887962,"score_spread":0.24217847529800401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487730205","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006433297,0.13242905,0.09505086,0.011074151,0.0025236495,0.0001278589,0.0002834082,0.0009311471,0.7511466],"genre_scores_gemma":[0.07729036,0.18223478,0.07411682,0.002119856,0.0021093793,0.00023969075,0.00096944225,0.0007183988,0.6602013],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973387,0.000049786555,0.000014162426,0.000036045814,0.00014869943,0.000017434873],"domain_scores_gemma":[0.99877435,0.0006059169,0.0000411076,0.00014292024,0.00031731382,0.0001184159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008544925,0.00064833,0.0005000872,0.0016354916,0.00047726434,0.0062374542,0.0007841521,0.0010338732,0.016393112],"category_scores_gemma":[0.0020024602,0.000434801,0.0002120353,0.0030385589,0.0016289062,0.008697099,0.0009775278,0.0017707371,0.007147924],"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.000013030268,0.00007867916,0.00036911207,0.0003733676,0.000009094129,0.000060144564,0.0004590269,0.0005656912,0.0005755266,0.27474883,0.1222635,0.6004841],"study_design_scores_gemma":[0.000008392074,0.000021861875,0.0007250248,0.000505979,0.000012316941,0.00031682613,0.0003238945,0.0023581742,0.00092862133,0.18912943,0.8056604,0.000009070837],"about_ca_topic_score_codex":0.0013385983,"about_ca_topic_score_gemma":0.0016538972,"teacher_disagreement_score":0.016393112,"about_ca_system_score_codex":0.0008837146,"about_ca_system_score_gemma":0.0016307948,"threshold_uncertainty_score":0.054840446},"labels":[],"label_agreement":null},{"id":"W2487888825","doi":"10.1007/978-3-642-21210-9","title":"Models in Software Engineering","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Documentation; Software engineering; Model-driven architecture; Software; Software development; Programming language","score_opus":0.01682760632836947,"score_gpt":0.21749105835416008,"score_spread":0.2006634520257906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487888825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036684864,0.10957236,0.52730125,0.006623597,0.0033772644,0.000090241956,0.0004801031,0.0015900923,0.34729663],"genre_scores_gemma":[0.17340267,0.1255474,0.20387426,0.0030861835,0.003356458,0.00053724606,0.002215666,0.001594477,0.48638573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994516,0.0001401373,0.000028994687,0.000079212616,0.00027448806,0.000025571278],"domain_scores_gemma":[0.9994461,0.00030701747,0.00003210461,0.000098770404,0.00008990798,0.000026116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005148094,0.0013843015,0.0011535644,0.0014122253,0.0005346085,0.0027687014,0.0009460444,0.0009902843,0.011943653],"category_scores_gemma":[0.0016833681,0.00067616336,0.00088679,0.0021299527,0.00133036,0.0040669185,0.0011449013,0.0024211223,0.0058803186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014425898,0.000041042997,0.000112016125,0.00034309048,0.00003121401,0.000050145372,0.00023967412,0.0069820727,0.00059978757,0.7549742,0.07050204,0.1661103],"study_design_scores_gemma":[0.000008832315,0.000017672153,0.000112952,0.00021027181,0.000019398312,0.00013286082,0.000051512372,0.010862629,0.0004309,0.71812975,0.2700102,0.000013018505],"about_ca_topic_score_codex":0.0013755216,"about_ca_topic_score_gemma":0.0017062504,"teacher_disagreement_score":0.011943653,"about_ca_system_score_codex":0.0013409294,"about_ca_system_score_gemma":0.0009228715,"threshold_uncertainty_score":0.039955556},"labels":[],"label_agreement":null},{"id":"W2487901605","doi":"10.1007/11560296","title":"Groupware: Design, Implementation, and Use","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Brock University","funders":"Universidade Federal de Pernambuco; Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Collaborative software; Software engineering; Computer-supported cooperative work; Human–computer interaction; World Wide Web; Engineering; Work (physics)","score_opus":0.026987020652883328,"score_gpt":0.256633582544383,"score_spread":0.22964656189149968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487901605","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1621515,0.0187164,0.67321867,0.005625467,0.0005290337,0.0010035123,0.00025492627,0.0048242696,0.13367632],"genre_scores_gemma":[0.57690233,0.009600648,0.3693052,0.00059198576,0.00020606632,0.000563017,0.000400167,0.0011782871,0.041252367],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980216,0.0008445412,0.00007382004,0.00019167083,0.0007487503,0.00011973584],"domain_scores_gemma":[0.99759907,0.0013186269,0.00010058567,0.0005256455,0.00030421346,0.00015184404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025894076,0.0005811706,0.0002886678,0.0010035459,0.0006772607,0.003939555,0.0016732648,0.0012679502,0.006130243],"category_scores_gemma":[0.0044560707,0.00046927703,0.00026248698,0.0010508572,0.0015985477,0.003926261,0.0013720387,0.0008617144,0.001954638],"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.000082270926,0.00016671744,0.0039043599,0.00050413347,0.000043594944,0.0001350486,0.004831194,0.002955095,0.0064820824,0.120514184,0.015911542,0.8444698],"study_design_scores_gemma":[0.0001521536,0.0018269535,0.014984169,0.0018102563,0.000288023,0.0022893483,0.0083864285,0.041804563,0.03959385,0.34115684,0.54755825,0.00014921467],"about_ca_topic_score_codex":0.0010361642,"about_ca_topic_score_gemma":0.0012630268,"teacher_disagreement_score":0.006130243,"about_ca_system_score_codex":0.00064515375,"about_ca_system_score_gemma":0.0011559024,"threshold_uncertainty_score":0.020507753},"labels":[],"label_agreement":null},{"id":"W2487913216","doi":"10.1007/978-3-319-39907-2_42","title":"Test-Bed for Integrated Ground Control Station Experimentation and Rehearsal: Crew Performance and Authority Pathway Concept Development","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Defence Research and Development Canada","funders":"","keywords":"Crew; Situation awareness; Trainer; Test (biology); Interface (matter); Computer science; Aeronautics; Command and control; Control (management); Simulation; Teamwork; Operations research; Engineering; Artificial intelligence; Telecommunications; Operating system","score_opus":0.026338674112645212,"score_gpt":0.32344548342268775,"score_spread":0.2971068093100425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487913216","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.71798277,0.00020984239,0.26400265,0.00011257684,0.000098260956,0.001378733,0.001241593,0.004023608,0.010949871],"genre_scores_gemma":[0.84370416,0.00016032874,0.13750687,0.00003813502,0.0000118903,0.0011928991,0.0018818921,0.00055633,0.014947491],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996457,0.000096215495,0.000019568926,0.000047429596,0.00014226131,0.00004876359],"domain_scores_gemma":[0.9989636,0.00042144154,0.00003423173,0.00016551717,0.00024511124,0.00017017865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081569626,0.0008181343,0.00041129626,0.0003704182,0.00040086778,0.00054832216,0.0018912147,0.00063756394,0.010300349],"category_scores_gemma":[0.0017774852,0.00034931736,0.00026149678,0.00018875192,0.00041817714,0.0006604519,0.00090865855,0.00048811297,0.0017817715],"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.0021838727,0.004970016,0.0040452867,0.0006711765,0.00006213435,0.0005382198,0.0020041412,0.036000997,0.74798614,0.0033522663,0.0050140745,0.19317164],"study_design_scores_gemma":[0.00054259924,0.017875968,0.020698955,0.00011721731,0.00010563637,0.0005577619,0.0014060597,0.15282609,0.7842627,0.0025084293,0.018960414,0.00013813563],"about_ca_topic_score_codex":0.0013698407,"about_ca_topic_score_gemma":0.0014395919,"teacher_disagreement_score":0.010300349,"about_ca_system_score_codex":0.00026146788,"about_ca_system_score_gemma":0.0006699852,"threshold_uncertainty_score":0.03445804},"labels":[],"label_agreement":null},{"id":"W2488257995","doi":"10.1007/978-3-319-41920-6_30","title":"Building FP-Tree on the Fly: Single-Pass Frequent Itemset Mining","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"York University","funders":"","keywords":"Computer science; Tree (set theory); On the fly; Data mining; GSP Algorithm; Database transaction; Fractal tree index; Interval tree; Trie; Tree structure; Apriori algorithm; Algorithm; Association rule learning; Data structure; Database; Binary tree; Mathematics","score_opus":0.030963937685589558,"score_gpt":0.25509422646294105,"score_spread":0.2241302887773515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488257995","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.07954774,0.0035227798,0.8924223,0.0006836261,0.0004923627,0.0005436106,0.007822735,0.012262664,0.0027022096],"genre_scores_gemma":[0.16429262,0.0010907102,0.8156312,0.00022638988,0.00017333003,0.00027976008,0.015009415,0.00039003312,0.002906467],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805427,0.00021452366,0.00027151714,0.00058302487,0.0006563316,0.00022044021],"domain_scores_gemma":[0.9964939,0.0016354843,0.00020692083,0.0005689539,0.00092750165,0.00016726273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018462288,0.0017472658,0.0033958603,0.0044330033,0.001317683,0.0023789825,0.0038813795,0.0022915658,0.004736466],"category_scores_gemma":[0.007965468,0.0009364697,0.0021152897,0.006252665,0.00032952256,0.0035527288,0.0013632729,0.0015046607,0.0054374104],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059753493,0.00042994582,0.00783749,0.0005985621,0.0003316593,0.0005942548,0.00015660105,0.011962576,0.009768544,0.001511966,0.025336996,0.9408739],"study_design_scores_gemma":[0.00013697518,0.0006800059,0.006369765,0.00016632205,0.0004407106,0.0034890354,0.00042210508,0.93059546,0.02080351,0.019628488,0.017159905,0.00010770517],"about_ca_topic_score_codex":0.004363511,"about_ca_topic_score_gemma":0.0062569506,"teacher_disagreement_score":0.004736466,"about_ca_system_score_codex":0.00044215634,"about_ca_system_score_gemma":0.0022898319,"threshold_uncertainty_score":0.015845},"labels":[],"label_agreement":null},{"id":"W2488394808","doi":"10.1007/978-3-319-41920-6_25","title":"Tracking Communities over Time in Dynamic Social Network","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Université du Québec à Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Tracking (education); Social network (sociolinguistics); Real-time computing; World Wide Web; Social media; Sociology","score_opus":0.011995244663895418,"score_gpt":0.2581289103582776,"score_spread":0.2461336656943822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488394808","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.49964654,0.0029964282,0.48882163,0.0008857699,0.00017479637,0.00013786105,0.0023549185,0.0006548681,0.0043271426],"genre_scores_gemma":[0.8909716,0.0009196497,0.10134389,0.00008887506,0.00020570203,0.00011993963,0.0020271263,0.000091632166,0.004231628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990081,0.00025292853,0.000042781896,0.00040236913,0.00021282189,0.000081094935],"domain_scores_gemma":[0.99062496,0.0067725363,0.0009561456,0.00058187003,0.00065362285,0.00041080074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017046754,0.0006014039,0.0007220928,0.0049293917,0.0010519951,0.0014945889,0.0016275862,0.0013972444,0.0010615531],"category_scores_gemma":[0.013257922,0.00055698876,0.00056453183,0.0047497894,0.00069277035,0.0037701568,0.0017768363,0.0010947724,0.00052702037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096975616,0.0005732261,0.12181313,0.00072299386,0.0005496304,0.00092803984,0.003035146,0.41381812,0.014080861,0.051019985,0.012468532,0.3800206],"study_design_scores_gemma":[0.000012624664,0.000047994636,0.0066651874,0.00003505079,0.000044251934,0.00022422208,0.00030313875,0.9621883,0.0010773545,0.027225414,0.0021549454,0.000021352726],"about_ca_topic_score_codex":0.0081053795,"about_ca_topic_score_gemma":0.011566384,"teacher_disagreement_score":0.0081053795,"about_ca_system_score_codex":0.00091136934,"about_ca_system_score_gemma":0.0003312799,"threshold_uncertainty_score":0.01611638},"labels":[],"label_agreement":null},{"id":"W2488644143","doi":"10.1007/978-3-319-40397-7_2","title":"Modelling Information Flow and Situational Awareness in Wild Fire Response Operations","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Situation awareness; Computer science; Usability; Process (computing); Information flow; Situational ethics; Context (archaeology); Human–computer interaction; Preparedness; Knowledge management; Aside; Process management; Engineering","score_opus":0.03002658089610634,"score_gpt":0.31535862454174163,"score_spread":0.2853320436456353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488644143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22587425,0.000869457,0.76165587,0.00041779954,0.00009440348,0.000048884132,0.00028325676,0.000355651,0.010400403],"genre_scores_gemma":[0.95979375,0.0004663507,0.034786444,0.000024315705,0.000029233048,0.000033342425,0.00021041173,0.000057629615,0.004598522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998155,0.00006258672,0.000011969184,0.000043506003,0.000032038406,0.000034436172],"domain_scores_gemma":[0.99891806,0.0009044874,0.00005265895,0.00003407637,0.00005541098,0.000035410303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004983285,0.0005319643,0.00039249932,0.00050073233,0.00029801897,0.0018989769,0.00074867695,0.0010130522,0.0031616013],"category_scores_gemma":[0.0027964038,0.00055535155,0.00062706135,0.00046476696,0.0005973228,0.002228362,0.0007138331,0.0010942031,0.0002556274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007531853,0.00004795973,0.0007859974,0.00003107894,0.000016400552,0.00005655361,0.00010840853,0.9674589,0.000935735,0.0201676,0.00027681555,0.010039253],"study_design_scores_gemma":[0.0000026129703,0.000005961031,0.00011751934,0.0000036269757,0.0000042232805,0.000004285846,0.000012135224,0.99196315,0.00016711406,0.0075497893,0.0001665186,0.0000030096598],"about_ca_topic_score_codex":0.014076797,"about_ca_topic_score_gemma":0.009862509,"teacher_disagreement_score":0.014076797,"about_ca_system_score_codex":0.0007482593,"about_ca_system_score_gemma":0.0007254211,"threshold_uncertainty_score":0.027989745},"labels":[],"label_agreement":null},{"id":"W2488918232","doi":"10.1007/978-3-642-39357-0","title":"Mathematics and Computation in Music","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"McGill University","funders":"","keywords":"Computer science; Computation; Algebra over a field; Mathematics education; Algorithm; Mathematics; Pure mathematics","score_opus":0.019362657511901846,"score_gpt":0.24482301332464917,"score_spread":0.22546035581274732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488918232","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005522179,0.06789501,0.078104325,0.006261066,0.004005449,0.000044991757,0.00022706414,0.0003438262,0.83759606],"genre_scores_gemma":[0.23595,0.053112682,0.04496861,0.0014408822,0.009826765,0.00018774376,0.00046281188,0.00048370622,0.6535667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997507,0.000046551544,0.000012884607,0.00004063374,0.00012905803,0.000020223642],"domain_scores_gemma":[0.9997936,0.00009447979,0.000011889694,0.0000384396,0.000039597708,0.000021965647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020175609,0.0008319162,0.00079385546,0.0012205441,0.0011259055,0.0033475887,0.0007486013,0.00056782446,0.023090987],"category_scores_gemma":[0.0008976164,0.00030896396,0.00061064557,0.0019671135,0.0031860615,0.0037950436,0.0011751199,0.001957808,0.0058928174],"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.000008366577,0.000007213492,0.00004348028,0.00012529889,0.000006924121,0.000016354208,0.00014872885,0.00068524294,0.00039401898,0.93547,0.024939833,0.03815452],"study_design_scores_gemma":[0.00000639906,0.000010119034,0.00017599195,0.00006390294,0.0000060045195,0.000073819,0.000063304135,0.0013767518,0.0002257382,0.80983454,0.18815643,0.0000069520183],"about_ca_topic_score_codex":0.0011670986,"about_ca_topic_score_gemma":0.0015321589,"teacher_disagreement_score":0.023090987,"about_ca_system_score_codex":0.0015569237,"about_ca_system_score_gemma":0.00077951717,"threshold_uncertainty_score":0.07724702},"labels":[],"label_agreement":null},{"id":"W2489291216","doi":"10.1007/b102837","title":"Formal Methods and Software Engineering","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Queen's University","funders":"","keywords":"Software engineering; Computer science; Formal methods; Programming language","score_opus":0.010658063864282455,"score_gpt":0.26570197351736985,"score_spread":0.2550439096530874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489291216","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017111826,0.11133049,0.60143465,0.005574506,0.004044404,0.00013959974,0.00024184382,0.001957416,0.27356595],"genre_scores_gemma":[0.06415067,0.08926654,0.22880857,0.002739295,0.004025063,0.0007072153,0.00091337,0.001818097,0.6075712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986539,0.00032902893,0.00007357643,0.000157193,0.00072681915,0.000059449834],"domain_scores_gemma":[0.99852175,0.00096000463,0.00005421324,0.000232541,0.0001900279,0.000041538042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013594001,0.0020690116,0.0019601572,0.0024156063,0.0008928593,0.0028766105,0.0013701513,0.0015015054,0.02307106],"category_scores_gemma":[0.0029483219,0.0011174009,0.0010154141,0.0026058771,0.0032694128,0.004857224,0.0015742531,0.0037302189,0.011619083],"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.000017066928,0.000062966115,0.00008709675,0.0007419246,0.000029005365,0.00005192241,0.0004450922,0.002805169,0.0008769765,0.6423375,0.07734364,0.27520168],"study_design_scores_gemma":[0.000017162345,0.000022523061,0.000102979175,0.00035600094,0.000019566267,0.00016787555,0.0000670244,0.0032164857,0.0005262374,0.6528512,0.34263748,0.000015530712],"about_ca_topic_score_codex":0.0010481173,"about_ca_topic_score_gemma":0.0012772012,"teacher_disagreement_score":0.02307106,"about_ca_system_score_codex":0.0016047728,"about_ca_system_score_gemma":0.0014178198,"threshold_uncertainty_score":0.077180326},"labels":[],"label_agreement":null},{"id":"W2489311942","doi":"10.1007/978-3-319-40244-4_22","title":"The Impact of Tactile Sensations on Virtual Reality Impairment","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Virtual reality; Simulator sickness; Computer science; Haptic technology; Roller coaster; Tactile perception; Tactile display; Simulation; Human–computer interaction; Computer vision; Psychology; Perception; Engineering","score_opus":0.036897260147566266,"score_gpt":0.3129426394532971,"score_spread":0.2760453793057308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489311942","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.91337615,0.012680329,0.0056658313,0.0007187534,0.00022508862,0.00004558475,0.00057782605,0.0001758942,0.06653455],"genre_scores_gemma":[0.996053,0.0014831898,0.0002482292,0.000037998812,0.00002985922,0.0000065871714,0.00007523026,0.000014621276,0.0020513637],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994986,0.00010162941,0.000029551258,0.00005142269,0.00020350778,0.00011523943],"domain_scores_gemma":[0.999228,0.0004462252,0.000070220034,0.00007059523,0.00008693919,0.00009788549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046994648,0.00074986543,0.0005428057,0.000939302,0.00027791198,0.0008987312,0.0009446888,0.0006756146,0.0130419005],"category_scores_gemma":[0.0029911431,0.00017754272,0.00057688466,0.00039940377,0.0007974903,0.00068905443,0.0012618466,0.00061901746,0.0009484129],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010151077,0.0015644497,0.028328627,0.0017697715,0.00036481736,0.022086624,0.0015390514,0.008249316,0.1777707,0.007348217,0.004209248,0.73661804],"study_design_scores_gemma":[0.0002426406,0.008836617,0.7593933,0.0012743052,0.00094259076,0.114723094,0.0032039392,0.011274349,0.06789558,0.019636821,0.012371178,0.00020568438],"about_ca_topic_score_codex":0.0011921842,"about_ca_topic_score_gemma":0.0006174683,"teacher_disagreement_score":0.0130419005,"about_ca_system_score_codex":0.00026442006,"about_ca_system_score_gemma":0.00026945473,"threshold_uncertainty_score":0.043629527},"labels":[],"label_agreement":null},{"id":"W2489434049","doi":"10.1007/978-3-319-41501-7_12","title":"Denoising Multi-view Images Using Non-local Means with Different Similarity Measures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noise reduction; Computer science; Artificial intelligence; Similarity (geometry); Image denoising; Noise (video); Non-local means; Pattern recognition (psychology); Singular value decomposition; Computer vision; Image (mathematics); Algorithm","score_opus":0.04169318597652527,"score_gpt":0.2884143815399009,"score_spread":0.24672119556337563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489434049","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.0092671765,0.0005210277,0.98890823,0.000053114578,0.00008236705,0.000028472075,0.000036592148,0.0001919311,0.00091116637],"genre_scores_gemma":[0.08002426,0.0008724971,0.91406286,0.000097489086,0.00012258565,0.00007919536,0.00026222036,0.0002202764,0.004258731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994072,0.00009858098,0.000044925644,0.00015426567,0.000256211,0.000038784063],"domain_scores_gemma":[0.9991986,0.00022727415,0.000061955194,0.00017635697,0.00029770646,0.00003819429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010268184,0.000961992,0.0011198529,0.0012053158,0.0003171043,0.0011563937,0.0009412335,0.0012899719,0.0023500903],"category_scores_gemma":[0.0022249636,0.00043837226,0.001678193,0.00138461,0.0005892268,0.0016154897,0.0010962319,0.0012068569,0.0011763553],"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.0005389665,0.000188948,0.0007158518,0.00073285704,0.00043666095,0.00016081707,0.00025656083,0.040742032,0.19992588,0.017223403,0.0039612832,0.7351167],"study_design_scores_gemma":[0.00004859547,0.0003329463,0.0026161445,0.000067935194,0.00037986384,0.00095819286,0.000120824945,0.83485425,0.13706683,0.014409214,0.009051123,0.00009412709],"about_ca_topic_score_codex":0.0006420981,"about_ca_topic_score_gemma":0.0017616116,"teacher_disagreement_score":0.0023500903,"about_ca_system_score_codex":0.00036724156,"about_ca_system_score_gemma":0.00039510144,"threshold_uncertainty_score":0.007861853},"labels":[],"label_agreement":null},{"id":"W2489491723","doi":"10.1007/978-3-319-41754-7_8","title":"Evaluating Multiple Summaries Without Human Models: A First Experiment with a Trivergent Model","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Task (project management); Set (abstract data type); Natural language processing; Artificial intelligence; Information retrieval; Source model; Programming language; Theoretical computer science; Systems engineering","score_opus":0.08502014523120585,"score_gpt":0.3093159256192198,"score_spread":0.22429578038801393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489491723","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.8976561,0.0060527264,0.06965659,0.0019983782,0.0014915986,0.0018621206,0.0055316747,0.009315999,0.0064348285],"genre_scores_gemma":[0.8481977,0.001144008,0.12868771,0.00090065825,0.00040784793,0.00079750764,0.012740892,0.0010240367,0.00609952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98913974,0.006232912,0.0010894787,0.0023438805,0.0009921888,0.0002017983],"domain_scores_gemma":[0.88383657,0.09829517,0.0017864103,0.0094875265,0.003725401,0.0028689615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014208421,0.002550972,0.0028896444,0.0014524009,0.0016163775,0.0041875597,0.0039252895,0.005463657,0.007610294],"category_scores_gemma":[0.07922464,0.0009881986,0.0018187924,0.0015423673,0.0008139679,0.0074687265,0.0020774286,0.0039988155,0.0030514507],"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.049374208,0.01931606,0.024618564,0.008785616,0.005582627,0.0022573937,0.008336811,0.15210402,0.055690672,0.004821812,0.07579068,0.5933216],"study_design_scores_gemma":[0.0073294514,0.02537986,0.01239416,0.0004235327,0.0027763348,0.0013840293,0.0021667334,0.89274484,0.021471435,0.008260973,0.025141243,0.0005274968],"about_ca_topic_score_codex":0.007970866,"about_ca_topic_score_gemma":0.008521074,"teacher_disagreement_score":0.014208421,"about_ca_system_score_codex":0.0012272059,"about_ca_system_score_gemma":0.001746225,"threshold_uncertainty_score":0.075142205},"labels":[],"label_agreement":null},{"id":"W2490225792","doi":"10.1007/978-3-319-12823-8","title":"The Emergence of Digital Libraries – Research and Practices","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Humanities and Scholarship","field":"Arts and Humanities","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Digital library; Computer science; Sociology; Art; Literature","score_opus":0.11221589418514114,"score_gpt":0.3165793603565954,"score_spread":0.20436346617145426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490225792","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16249205,0.09480085,0.006915666,0.14661999,0.0010939878,0.00009465869,0.0003907752,0.0004052278,0.5871868],"genre_scores_gemma":[0.9072619,0.029820008,0.0034575332,0.009323995,0.0013766948,0.000068285706,0.00017103784,0.00028192488,0.048238646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9901551,0.0051426203,0.00056400517,0.001348966,0.0018818765,0.00090744166],"domain_scores_gemma":[0.9681198,0.018879618,0.0022937101,0.0034235814,0.0034554051,0.0038277495],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010774627,0.00027503172,0.0004993289,0.007864627,0.009348239,0.046326425,0.0021847363,0.0038140754,0.014410576],"category_scores_gemma":[0.018550249,0.0005941593,0.00036969534,0.01674125,0.032208003,0.044424158,0.014937996,0.005564447,0.0026464702],"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.00007540932,0.00006763142,0.0038051368,0.00045910093,0.000010781585,0.0003362739,0.09310011,0.00010109925,0.00052485854,0.7703971,0.018154548,0.112967916],"study_design_scores_gemma":[0.000016754622,0.000034400455,0.0063654846,0.0013714068,0.000009453785,0.00042147454,0.10469803,0.00018071143,0.00061507104,0.08473417,0.801507,0.00004614124],"about_ca_topic_score_codex":0.0053721378,"about_ca_topic_score_gemma":0.0073928596,"teacher_disagreement_score":0.9536736,"about_ca_system_score_codex":0.012837157,"about_ca_system_score_gemma":0.013185302,"threshold_uncertainty_score":0.09314054},"labels":[],"label_agreement":null},{"id":"W2490386651","doi":"10.1007/3-540-36126-x","title":"Formal Methods in Computer-Aided Design","year":2002,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Formal methods; Computer-aided; Software engineering; Programming language; Engineering drawing","score_opus":0.01666920292333705,"score_gpt":0.2723321563235442,"score_spread":0.2556629534002071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490386651","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.0004457831,0.002859412,0.98816526,0.00019124226,0.00024297512,0.000053883236,0.000049021673,0.00057767733,0.007414738],"genre_scores_gemma":[0.041554004,0.007567816,0.918718,0.0002997947,0.0003024343,0.00062829175,0.00034883284,0.00058685866,0.029993977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962043,0.0015514169,0.00024666893,0.0003008497,0.0015713685,0.00012537633],"domain_scores_gemma":[0.9967642,0.002261043,0.00013036604,0.00047752794,0.0003331294,0.000033707278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003569761,0.0016760414,0.0016176938,0.0016159405,0.0006146591,0.0022582759,0.0017455692,0.001423601,0.016378386],"category_scores_gemma":[0.004806355,0.0011876674,0.0012479115,0.001274625,0.0025136804,0.0022281203,0.0016256077,0.002013793,0.004828885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046265508,0.000069551104,0.00017515924,0.0013767852,0.000073776755,0.00008410477,0.00032587352,0.039209113,0.0030462984,0.5390808,0.015835637,0.40067664],"study_design_scores_gemma":[0.000114362345,0.00011735797,0.00015182645,0.00083668565,0.00007954754,0.000302448,0.00010151257,0.09150641,0.0076564243,0.64050794,0.25857094,0.000054540626],"about_ca_topic_score_codex":0.0009846438,"about_ca_topic_score_gemma":0.0008570988,"teacher_disagreement_score":0.016378386,"about_ca_system_score_codex":0.0008699989,"about_ca_system_score_gemma":0.0016106355,"threshold_uncertainty_score":0.054791093},"labels":[],"label_agreement":null},{"id":"W2490586464","doi":"10.1007/978-3-642-01004-0","title":"Transactions on Computational Science IV","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.06417385730755304,"score_gpt":0.35126643265103036,"score_spread":0.2870925753434773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490586464","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004623388,0.044002663,0.17802654,0.025754444,0.044369224,0.00023302804,0.0029065406,0.0016677533,0.69841653],"genre_scores_gemma":[0.060060516,0.032404035,0.05589983,0.0027558517,0.00719694,0.00039443257,0.0041358517,0.0011136505,0.836039],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985948,0.00030206036,0.00008837022,0.0002339363,0.000690513,0.00009022549],"domain_scores_gemma":[0.9979608,0.00046794576,0.000051012852,0.00087237015,0.00052718754,0.000120748635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537387,0.001063446,0.0017365441,0.0012266085,0.00075401436,0.0039047308,0.0013603469,0.0013367325,0.14209765],"category_scores_gemma":[0.0052218097,0.00042841057,0.0009133253,0.0025705758,0.001524422,0.0022315322,0.0023908562,0.00295269,0.058344424],"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.00008499065,0.000057258065,0.0003799743,0.00041419733,0.000070707036,0.00005127848,0.00006170736,0.0035176133,0.0009352111,0.18258569,0.45812267,0.35371873],"study_design_scores_gemma":[0.000025656504,0.000027655948,0.00042418813,0.00017732813,0.000037878857,0.000118453034,0.000054813903,0.008047454,0.00063303014,0.16698265,0.82346034,0.0000106012185],"about_ca_topic_score_codex":0.0018071395,"about_ca_topic_score_gemma":0.0017375653,"teacher_disagreement_score":0.14209765,"about_ca_system_score_codex":0.0015399657,"about_ca_system_score_gemma":0.0020425052,"threshold_uncertainty_score":0.47536403},"labels":[],"label_agreement":null},{"id":"W2490911995","doi":"10.1007/978-3-319-31808-0_3","title":"Atlas-Guided Transcranial Doppler Ultrasound Examination with a Neuro-Surgical Navigation System: Case Study","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"NeuroRx Research (Canada); Montreal Neurological Institute and Hospital","funders":"","keywords":"Transcranial Doppler; Computer science; Neurovascular bundle; Computer vision; Landmark; Artificial intelligence; Atlas (anatomy); Brain atlas; Ultrasound; Population; Human skull; Skull; Radiology; Medicine; Anatomy","score_opus":0.018891963140317332,"score_gpt":0.2747876160705909,"score_spread":0.25589565293027355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490911995","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.87319356,0.020930633,0.034477957,0.014047695,0.0021281505,0.0006925205,0.0014797136,0.0011496408,0.05190009],"genre_scores_gemma":[0.976279,0.0036505342,0.008844455,0.0030695465,0.0024051585,0.0000667491,0.00022501091,0.00014675499,0.0053128484],"study_design_codex":"case_report","study_design_gemma":"case_report","domain_scores_codex":[0.99907947,0.000113374634,0.00010720232,0.00025305926,0.00018350153,0.00026334813],"domain_scores_gemma":[0.99785054,0.00078591343,0.00034493586,0.00030239904,0.00015337559,0.00056287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034910563,0.003465394,0.0017806183,0.0054722526,0.0028737234,0.0024494834,0.003467715,0.011470933,0.0053853723],"category_scores_gemma":[0.0048727784,0.0019300303,0.0023327698,0.0037189568,0.0032552718,0.002986764,0.0018385375,0.0062227845,0.0032672319],"study_design_candidate":"case_report","study_design_consensus":"case_report","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015067016,0.000043896947,0.0007506539,0.000020145155,0.0000067201217,0.9975121,0.000051995357,0.000083117906,0.00026934905,0.00009762732,0.00014829554,0.0010011062],"study_design_scores_gemma":[0.0000050688636,0.0000410445,0.0007974864,0.000011578315,0.000012897969,0.99806625,0.00005993358,0.00022494404,0.0003521135,0.00012984789,0.00028818782,0.000010712041],"about_ca_topic_score_codex":0.0049149953,"about_ca_topic_score_gemma":0.007863768,"teacher_disagreement_score":0.011470933,"about_ca_system_score_codex":0.0032718377,"about_ca_system_score_gemma":0.002099615,"threshold_uncertainty_score":0.02373892},"labels":[],"label_agreement":null},{"id":"W2491296117","doi":"10.1007/978-3-319-40244-4_5","title":"Design and Evaluation of an Authoring Tool and Notation System for Vibrotactile Composition","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"Toronto Metropolitan University","funders":"","keywords":"Notation; Computer science; Composition (language); Programming language; Human–computer interaction; Multimedia; Software engineering; Engineering drawing; Arithmetic; Linguistics; Engineering","score_opus":0.06704469487209865,"score_gpt":0.3153131514732493,"score_spread":0.24826845660115066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491296117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2443744,0.00021551726,0.7382073,0.0001640285,0.00018926508,0.0018818133,0.00036650233,0.010399886,0.0042013284],"genre_scores_gemma":[0.34288925,0.00015794081,0.6479926,0.00007866219,0.000023751873,0.0010192166,0.0005338042,0.001125383,0.006179456],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99823713,0.00050328457,0.00022275302,0.0003098899,0.0006080499,0.00011884014],"domain_scores_gemma":[0.9939626,0.0031660157,0.0002770383,0.0007091335,0.0014969138,0.00038838823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036452697,0.0012217509,0.00077984564,0.0007869536,0.00060247036,0.002344129,0.0027941933,0.0014810581,0.010431733],"category_scores_gemma":[0.0080970265,0.000679759,0.00061449857,0.00033114033,0.0006718161,0.0016818367,0.0014207474,0.0007874277,0.0016928383],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002314866,0.0020072516,0.0038701894,0.0013759756,0.0002531848,0.0011189632,0.003379893,0.027379354,0.48409224,0.0043269647,0.0037542083,0.46612692],"study_design_scores_gemma":[0.0013590979,0.006844275,0.0062497603,0.00022930009,0.0005819975,0.001671947,0.0011835787,0.3732911,0.5675831,0.002563257,0.038184624,0.000257993],"about_ca_topic_score_codex":0.0007519062,"about_ca_topic_score_gemma":0.00072284363,"teacher_disagreement_score":0.010431733,"about_ca_system_score_codex":0.00047669807,"about_ca_system_score_gemma":0.0010554871,"threshold_uncertainty_score":0.034897625},"labels":[],"label_agreement":null},{"id":"W2491437971","doi":"10.1007/978-3-319-40216-1_15","title":"Game and Learning Mechanics Under the Perspective of Self-determination Theory for Supporting Motivation in Digital Game Based Learning","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Université Laval","funders":"","keywords":"Computer science; Perspective (graphical); Game mechanics; Relation (database); Process (computing); Game based learning; Mathematics education; Intrinsic motivation; Order (exchange); Multimedia; Artificial intelligence; Human–computer interaction; Mathematics; Psychology; Social psychology","score_opus":0.01885876298645886,"score_gpt":0.29876595661851196,"score_spread":0.2799071936320531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491437971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07513847,0.009152243,0.58881557,0.0043910407,0.000552664,0.00018424162,0.00007877651,0.00012210666,0.32156485],"genre_scores_gemma":[0.91558367,0.0034075526,0.056264706,0.000251227,0.000174463,0.00027497896,0.00004623903,0.00003722983,0.02395996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956733,0.0002242727,0.000015301035,0.000039387127,0.00011062363,0.000043115044],"domain_scores_gemma":[0.999526,0.0003287806,0.000029361605,0.000033077562,0.00004675275,0.000036117595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071403245,0.0006896309,0.0005003733,0.00063720706,0.0005788385,0.002204446,0.0008772998,0.0010574613,0.0036798127],"category_scores_gemma":[0.0015908381,0.00021519097,0.000640093,0.0006902428,0.0031782778,0.0030467904,0.0010492571,0.002203305,0.00029951267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005469516,0.000041443498,0.00019415018,0.000037961476,0.000006575235,0.000022345706,0.00030340333,0.0031949216,0.00018617346,0.98469675,0.00036076922,0.010950014],"study_design_scores_gemma":[0.000008614644,0.00004972884,0.0007368641,0.00005843724,0.000009891424,0.00006332374,0.00031945034,0.022637246,0.00024334253,0.9667514,0.009110588,0.000011156665],"about_ca_topic_score_codex":0.00087129424,"about_ca_topic_score_gemma":0.0009394143,"teacher_disagreement_score":0.0036798127,"about_ca_system_score_codex":0.0010454142,"about_ca_system_score_gemma":0.001279112,"threshold_uncertainty_score":0.012310207},"labels":[],"label_agreement":null},{"id":"W2491480315","doi":"10.1007/978-3-662-53090-0_1","title":"Problems of Human-Computer Interaction in Cyberworlds","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Creativity; Human–computer interaction; Biometrics; World Wide Web; Artificial intelligence; Psychology","score_opus":0.02279111307219562,"score_gpt":0.26720311440294964,"score_spread":0.24441200133075403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491480315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08348787,0.03530795,0.66642874,0.04285277,0.0010333953,0.00014915034,0.00061232486,0.0002597895,0.16986802],"genre_scores_gemma":[0.8301241,0.018191531,0.11925518,0.0007661779,0.002029422,0.00043680114,0.00054114615,0.00014402826,0.028511586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9983627,0.0009517071,0.00007813328,0.00025337332,0.00025360784,0.00010038675],"domain_scores_gemma":[0.99209046,0.0067287497,0.00024162725,0.0004645687,0.00027172375,0.0002028606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016128761,0.0008133553,0.0012667183,0.0011898646,0.0016891194,0.0049820826,0.0018303127,0.003915333,0.00831555],"category_scores_gemma":[0.009286578,0.0007878461,0.0013051659,0.0020800242,0.0072620315,0.011091678,0.0022899224,0.0031955664,0.0006744],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007553735,0.000017473314,0.0001648168,0.000119639146,0.000017365732,0.000060420065,0.00030561883,0.011930053,0.00006612573,0.97555614,0.0035163064,0.008238511],"study_design_scores_gemma":[0.0000048543034,0.0000034797877,0.00009838171,0.000018627677,0.0000028154152,0.00004386366,0.00014125454,0.013659536,0.000026774705,0.98244286,0.0035530108,0.0000044210738],"about_ca_topic_score_codex":0.0021038845,"about_ca_topic_score_gemma":0.0012162587,"teacher_disagreement_score":0.00831555,"about_ca_system_score_codex":0.0016385355,"about_ca_system_score_gemma":0.0009777849,"threshold_uncertainty_score":0.027818322},"labels":[],"label_agreement":null},{"id":"W2491830597","doi":"10.1007/978-3-662-49381-6_18","title":"Explorations of Prosody in Vietnamese Language","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Stabilization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Vietnamese; Prosody; Duration (music); Computer science; Intonation (linguistics); Speech recognition; Phrase; Natural language processing; Linguistics; Word order; Artificial intelligence; Acoustics; Physics","score_opus":0.015410712742736353,"score_gpt":0.2576169286503773,"score_spread":0.2422062159076409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491830597","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.81719875,0.007559629,0.008147688,0.00079292635,0.00007363739,0.000041294268,0.0008849871,0.00007349623,0.16522762],"genre_scores_gemma":[0.9886087,0.0017338173,0.001406118,0.00008529078,0.000035410503,0.000030716867,0.0003323985,0.00007835699,0.0076892455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998462,0.00006749006,0.000006403168,0.00003234631,0.000025867352,0.00002166265],"domain_scores_gemma":[0.99942905,0.0004097875,0.000035089743,0.000022821707,0.000069720765,0.000033518074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034660107,0.0003741766,0.00019027648,0.00068955205,0.00052672176,0.002376469,0.00022925215,0.00023207198,0.0072471034],"category_scores_gemma":[0.0011550302,0.00020267906,0.00015993648,0.0008705362,0.0007006864,0.0016237552,0.00076211087,0.000596778,0.00061813166],"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.0011169658,0.0001233636,0.052077677,0.0013732844,0.0001925932,0.003980037,0.28608537,0.001469329,0.16545679,0.07654089,0.006906882,0.40467682],"study_design_scores_gemma":[0.00011249758,0.0006614978,0.46651492,0.0022366003,0.0002434406,0.011475107,0.28241026,0.013303727,0.028361306,0.052780725,0.14164218,0.0002577186],"about_ca_topic_score_codex":0.0020994851,"about_ca_topic_score_gemma":0.0026454509,"teacher_disagreement_score":0.0072471034,"about_ca_system_score_codex":0.0003739801,"about_ca_system_score_gemma":0.0002694758,"threshold_uncertainty_score":0.02424395},"labels":[],"label_agreement":null},{"id":"W2491953867","doi":"10.1007/978-3-662-48433-3","title":"Algorithmic Game Theory","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Paderborn; Technische Universität Berlin; University of Waterloo; Tel Aviv University; Universität Wien; University of Glasgow; Universität des Saarlandes; Centre National de la Recherche Scientifique; Aarhus Universitet; University of Oxford; Rensselaer Polytechnic Institute","keywords":"Game theory; Computer science; Mathematical economics; Mathematics","score_opus":0.01742990945924583,"score_gpt":0.25476080015916064,"score_spread":0.2373308906999148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491953867","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029519345,0.008008082,0.1790464,0.0030818721,0.000841656,0.00006684315,0.00032860227,0.00036419832,0.8053104],"genre_scores_gemma":[0.21202028,0.017122403,0.096889965,0.001819131,0.0013332319,0.00040886048,0.0014804275,0.00067511055,0.6682506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957603,0.00010799728,0.000015811107,0.000072321076,0.00018297974,0.00004473339],"domain_scores_gemma":[0.9997904,0.00008979171,0.000010885857,0.000046061694,0.00004178176,0.000021130172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791134,0.0010429765,0.0006871138,0.00085477025,0.0008056467,0.0032883687,0.0011787034,0.0009113651,0.029307483],"category_scores_gemma":[0.0012167773,0.00036977534,0.00068644056,0.0012638926,0.0016915608,0.003033797,0.0012362289,0.0025655474,0.009081244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005994526,0.00001527367,0.000037737318,0.00006071962,0.000008996404,0.00001569809,0.000056180037,0.0018522094,0.00016007043,0.9336453,0.026733449,0.037408367],"study_design_scores_gemma":[0.000004889536,0.000004382918,0.000054590197,0.0000411784,0.0000042528045,0.00003131878,0.0000261648,0.003128308,0.00008759711,0.89737743,0.09923598,0.000003854721],"about_ca_topic_score_codex":0.00118754,"about_ca_topic_score_gemma":0.0017039744,"teacher_disagreement_score":0.029307483,"about_ca_system_score_codex":0.0017454763,"about_ca_system_score_gemma":0.0011118253,"threshold_uncertainty_score":0.09804332},"labels":[],"label_agreement":null},{"id":"W2492107376","doi":"10.1007/978-3-030-67658-2","title":"Machine Learning and Knowledge Discovery in Databases","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":5,"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":"Institute of Computing Technology, Chinese Academy of Sciences; Télécom Paris; University of California, Davis; École Normale Supérieure de Lyon; University of Illinois at Urbana-Champaign; LG Electronics; Technische Universität Dortmund; Sabancı Üniversitesi; ITMO University; University of Chinese Academy of Sciences; Ryukoku University; Universität Konstanz; Eötvös Loránd Tudományegyetem; Stockholms Universitet; Xiamen University; Università della Calabria; Singapore University of Technology and Design; Technische Universität Berlin; Indian Institute of Technology Guwahati; Universidade do Porto; Samsung; Universidade Estadual de Campinas; Nanjing University; Indian Institute of Technology Bombay; Università degli Studi dell'Aquila; Ludwig-Maximilians-Universität München; Shanghai Jiao Tong University; Rheinische Friedrich-Wilhelms-Universität Bonn; Vrije Universiteit Brussel; Westfälische Wilhelms-Universität Münster; Shanghai University of Finance and Economics; Universidade Federal de Uberlândia; Centre National de la Recherche Scientifique; Universidade de Macau; Dartmouth College; University of Tokyo; University of Rochester; Zhengzhou University; Institut \"Jožef Stefan\"; Waseda University; Universiteit Gent; Sorbonne Université; Kungliga Tekniska Högskolan; University of Warwick; Indian Institute of Technology Madras; Johns Hopkins University; Harbin Institute of Technology; Université de Namur; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Universität Wien; Heinrich-Heine-Universität Düsseldorf; Eidgenössische Technische Hochschule Zürich; National Council for Scientific Research; University of Texas at Dallas; Zhejiang University; Aalto-Yliopisto; Università di Pisa; Universidad Autónoma de Madrid; Pohang University of Science and Technology; Beijing Institute of Technology; Fudan University; Sun Yat-sen University; University of Twente; Chongqing University; Insight SFI Research Centre for Data Analytics; Beijing Jiaotong University; Technische Universiteit Delft; University of Toronto; University of Electronic Science and Technology of China; Technische Universität Kaiserslautern; Monash University; Peking University; KU Leuven; University of New South Wales; Gottfried Wilhelm Leibniz Universität Hannover; Rijksuniversiteit Groningen; Itä-Suomen Yliopisto; Eberhard Karls Universität Tübingen; Universiteit Leiden; Umeå Universitet; Helsingin Yliopisto; Universidade Federal do Paraná; Deakin University; University of Bristol; Universidade Federal do Rio Grande do Sul; Technische Universität München; Joint Research Centre; Université d'Orléans; Institut National des Sciences Appliquées de Lyon; Tsinghua University; Chinese Academy of Sciences; Indian National Science Academy; University of Exeter; University of East Anglia; University of Adelaide; Université Grenoble Alpes; Universitat Politècnica de Catalunya; Indian Institute of Technology Kanpur; University of Waikato; Florida State University; Universidade de Coimbra; Oregon State University; University of Queensland; Emory University; Polytechnique Montréal; Universidad de Alicante; Leuphana Universität Lüneburg; Toyota Research Institute; Politecnico di Torino; Universität Kassel; Case Western Reserve University; Institut National Polytechnique de Toulouse; McGill University; Université de Lorraine; Université du Luxembourg; Philipps-Universität Marburg; Leibniz-Gemeinschaft; Pennsylvania State University; University of Oxford; Tianjin University; Universität zu Lübeck; Universiteit Utrecht; Siemens; Aarhus Universitet; Harvard University; Université de Liège; European Commission; University of Alberta; University of Science and Technology of China; Chongqing University of Posts and Telecommunications; Washington State University; University College Dublin; Technische Universiteit Eindhoven; Arizona State University; University of Tsukuba; Purdue University; University of Southern California","keywords":"Computer science; Knowledge extraction; Database; Artificial intelligence; Information retrieval","score_opus":0.01946296800861885,"score_gpt":0.28105900239993303,"score_spread":0.2615960343913142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492107376","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004705342,0.2698931,0.5750511,0.007582169,0.0046367105,0.00031877024,0.002318876,0.0022902796,0.13320361],"genre_scores_gemma":[0.042643882,0.18408523,0.5266746,0.003033949,0.0041646142,0.00042464017,0.0057661217,0.00080265774,0.23240426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905103,0.00019132474,0.00008816012,0.00014750432,0.00048894895,0.000033052198],"domain_scores_gemma":[0.99751663,0.0018395991,0.000081251725,0.00026170906,0.00023927623,0.000061554565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823649,0.0008682535,0.0016822955,0.002560055,0.0005186294,0.004126997,0.001500075,0.0008805551,0.015909273],"category_scores_gemma":[0.00438257,0.000670764,0.0008360553,0.0074161543,0.0010694417,0.0058799675,0.0014036916,0.0020690055,0.010399904],"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.000059084803,0.00008111139,0.00042025035,0.001884097,0.000095263546,0.00014251983,0.00015354792,0.004351757,0.001184727,0.15087491,0.14449774,0.69625497],"study_design_scores_gemma":[0.00002681259,0.000044618002,0.00080582965,0.000621547,0.000074316726,0.00085684576,0.00010670791,0.025263006,0.001490166,0.3681239,0.60255545,0.00003065603],"about_ca_topic_score_codex":0.00081793516,"about_ca_topic_score_gemma":0.00078846794,"teacher_disagreement_score":0.015909273,"about_ca_system_score_codex":0.00080304645,"about_ca_system_score_gemma":0.0008977683,"threshold_uncertainty_score":0.05322188},"labels":[],"label_agreement":null},{"id":"W2492133817","doi":"10.1007/978-3-319-08123-6","title":"Unconventional Computation and Natural Computation","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computation; Natural (archaeology); Computer science; Natural computing; Algorithm; Theoretical computer science; History; Archaeology","score_opus":0.011678663683952503,"score_gpt":0.25589421334399687,"score_spread":0.24421554966004436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492133817","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01697414,0.06688845,0.08604578,0.008844421,0.0021962598,0.00003519131,0.00011964184,0.00025338467,0.8186426],"genre_scores_gemma":[0.5513741,0.04410885,0.045488693,0.0019520742,0.0039344877,0.00020691969,0.00032583074,0.000304219,0.3523049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977475,0.00006861664,0.000008464492,0.000038978123,0.00008718209,0.000021977761],"domain_scores_gemma":[0.99958795,0.0002550084,0.000018413753,0.000080411555,0.00004008195,0.000018076931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785499,0.00043494656,0.0004289432,0.0007492697,0.000932843,0.0022376666,0.00069656316,0.00067716744,0.009935546],"category_scores_gemma":[0.0011798582,0.00023923663,0.00037064287,0.0010882522,0.0043898392,0.0044876006,0.0011409362,0.002197733,0.0014903913],"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.0000033194399,0.000003071257,0.000020959329,0.00004493072,0.0000015374228,0.000009599716,0.00006460221,0.00029290325,0.000091585,0.98599666,0.004292632,0.009178157],"study_design_scores_gemma":[0.0000013578651,0.000001400442,0.000036429494,0.000020988718,9.742428e-7,0.000028251383,0.000015256299,0.0005736101,0.000056496865,0.96943754,0.029825952,0.0000017805701],"about_ca_topic_score_codex":0.00063275534,"about_ca_topic_score_gemma":0.0010326791,"teacher_disagreement_score":0.009935546,"about_ca_system_score_codex":0.0014656857,"about_ca_system_score_gemma":0.00055904395,"threshold_uncertainty_score":0.033237755},"labels":[],"label_agreement":null},{"id":"W2492189553","doi":"10.1007/978-3-319-23219-5","title":"Principles and Practice of Constraint Programming","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Operations Management Techniques","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint programming; Programming language; Constraint (computer-aided design); Constraint satisfaction; Theoretical computer science; Artificial intelligence; Mathematical optimization; Mathematics; Stochastic programming","score_opus":0.10562076672431045,"score_gpt":0.39078110980979275,"score_spread":0.2851603430854823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492189553","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.00071967597,0.035450306,0.6595449,0.0076962546,0.001149073,0.00020549665,0.0008152936,0.0007315908,0.29368743],"genre_scores_gemma":[0.039658483,0.06712877,0.8020118,0.0024614395,0.0017376839,0.0010022704,0.0015247059,0.0007267672,0.083748035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788874,0.0005177108,0.00018035786,0.00024416432,0.0010750373,0.0000940422],"domain_scores_gemma":[0.9973277,0.0015935476,0.000122313,0.0004271436,0.00044002975,0.00008927819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023612136,0.0017650066,0.0011084414,0.0030329896,0.0013841676,0.0065813647,0.0028631003,0.0016435613,0.017939802],"category_scores_gemma":[0.006093907,0.0013486056,0.0013925922,0.006584726,0.0054574474,0.005051107,0.002047672,0.0059816684,0.007478952],"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.000007079064,0.000018220471,0.000054962642,0.00038581,0.000021498774,0.00004997895,0.0002168131,0.0046297354,0.00022317539,0.8797786,0.036144264,0.0784698],"study_design_scores_gemma":[0.000007754512,0.0000046338055,0.00007121449,0.0003323195,0.000008199751,0.00009796822,0.000063472755,0.004733365,0.0002273203,0.7653416,0.2290948,0.000017342296],"about_ca_topic_score_codex":0.007474059,"about_ca_topic_score_gemma":0.0061318874,"teacher_disagreement_score":0.017939802,"about_ca_system_score_codex":0.0030171934,"about_ca_system_score_gemma":0.0047339755,"threshold_uncertainty_score":0.060014606},"labels":[],"label_agreement":null},{"id":"W2492399286","doi":"10.1007/978-3-319-11653-2","title":"Model-Driven Engineering Languages and Systems","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Software engineering","score_opus":0.010071788378487703,"score_gpt":0.2340263387622172,"score_spread":0.2239545503837295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492399286","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.0013360329,0.0075218715,0.9398495,0.0009990337,0.00063519465,0.000072119736,0.00017688498,0.0017903245,0.04761903],"genre_scores_gemma":[0.0681743,0.024911176,0.7217018,0.001353656,0.0008076723,0.00064895226,0.0016359849,0.0028959047,0.1778705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991061,0.00018446254,0.00005823155,0.00009750555,0.0005154532,0.000038207436],"domain_scores_gemma":[0.999114,0.00053158967,0.00004697208,0.00014473457,0.00013649964,0.000026212305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091670186,0.001528954,0.00082686136,0.0011102442,0.00040177105,0.0026849895,0.0012454279,0.0010719856,0.010781684],"category_scores_gemma":[0.002260956,0.00097256433,0.0010393948,0.0016701443,0.001019058,0.0034688127,0.0015088315,0.002933449,0.004888432],"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.000024377676,0.000072110146,0.00012510609,0.0007713228,0.000043042557,0.000093804556,0.0002371218,0.020869488,0.0037743475,0.6811612,0.040101465,0.2527266],"study_design_scores_gemma":[0.000026336505,0.000041593517,0.00011206318,0.00033870985,0.000031625787,0.00037001274,0.00005040343,0.044362083,0.0034339537,0.5849394,0.3662603,0.000033567565],"about_ca_topic_score_codex":0.00059867505,"about_ca_topic_score_gemma":0.00075226027,"teacher_disagreement_score":0.010781684,"about_ca_system_score_codex":0.0008632076,"about_ca_system_score_gemma":0.001155115,"threshold_uncertainty_score":0.03606832},"labels":[],"label_agreement":null},{"id":"W2492439535","doi":"10.1007/978-3-642-22336-5","title":"Transactions on Computational Science XII","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Volume (thermodynamics); Data science","score_opus":0.09130994332677386,"score_gpt":0.34641853320035915,"score_spread":0.2551085898735853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492439535","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038587428,0.06347638,0.22299686,0.020324906,0.051831834,0.00020646442,0.0030571255,0.0021279813,0.63211966],"genre_scores_gemma":[0.03303732,0.03909847,0.058449365,0.0018084199,0.008737013,0.00032200795,0.0038922336,0.0013351797,0.85332006],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903584,0.00016483334,0.00006122149,0.00016859523,0.00051957584,0.000049881728],"domain_scores_gemma":[0.9984749,0.0004390164,0.00004658632,0.00049475976,0.0004344541,0.000110274916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011943675,0.0012290247,0.001750281,0.0013607298,0.0006045535,0.0032322665,0.0011592419,0.001020358,0.15479696],"category_scores_gemma":[0.004353345,0.00041002943,0.00065613986,0.0031848517,0.0011080476,0.002445924,0.0019078992,0.0029420126,0.0768964],"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.00005396795,0.00004144438,0.00030256584,0.00043459816,0.000043575063,0.000050748702,0.00004536598,0.002902908,0.0009369182,0.09193979,0.52353257,0.37971565],"study_design_scores_gemma":[0.000023967403,0.000031136566,0.000700884,0.00022270784,0.000035319856,0.00017844717,0.000057972054,0.011646638,0.00062616606,0.11788901,0.8685741,0.0000135928585],"about_ca_topic_score_codex":0.0011042319,"about_ca_topic_score_gemma":0.0013606728,"teacher_disagreement_score":0.15479696,"about_ca_system_score_codex":0.0012933902,"about_ca_system_score_gemma":0.0013425639,"threshold_uncertainty_score":0.5178474},"labels":[],"label_agreement":null},{"id":"W2492585692","doi":"10.1007/978-3-642-30353-1","title":"Advances in Artificial Intelligence","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Concordia University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.017557529096290415,"score_gpt":0.29480140081870504,"score_spread":0.2772438717224146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492585692","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001533342,0.2173931,0.041197725,0.0075949784,0.010137701,0.000077902216,0.00030541338,0.00080017286,0.72095966],"genre_scores_gemma":[0.02052927,0.16774555,0.026503325,0.002705941,0.0054945988,0.00014132434,0.000695698,0.00046172558,0.7757226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933165,0.00010101088,0.000032614596,0.00008627083,0.0004025505,0.000045861503],"domain_scores_gemma":[0.9993418,0.00026360346,0.00003428802,0.00015597984,0.00013550807,0.00006884671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007850481,0.0012173761,0.0013189832,0.0017886508,0.00064956694,0.003531601,0.0010737149,0.0010928181,0.052979957],"category_scores_gemma":[0.0017064697,0.00047608046,0.00047257802,0.0026894903,0.0013166048,0.004356419,0.0021091027,0.0027204677,0.03476092],"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.000025537242,0.000058450867,0.00013477259,0.0007395431,0.00002926547,0.00005188475,0.0001828356,0.0006460826,0.000939887,0.14949001,0.29683787,0.5508638],"study_design_scores_gemma":[0.0000052869923,0.000017508472,0.00022336356,0.0002579246,0.000010702613,0.000097924676,0.000048025973,0.0006413593,0.0002532016,0.054489046,0.94395,0.0000056404074],"about_ca_topic_score_codex":0.00046135666,"about_ca_topic_score_gemma":0.0010176644,"teacher_disagreement_score":0.052979957,"about_ca_system_score_codex":0.0008984926,"about_ca_system_score_gemma":0.001095237,"threshold_uncertainty_score":0.1772356},"labels":[],"label_agreement":null},{"id":"W2492792645","doi":"10.1007/978-3-319-27261-0","title":"Graph Drawing and Network Visualization","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph drawing; Computer science; Visualization; Graph; Computer graphics (images); Theoretical computer science; Artificial intelligence","score_opus":0.019619820959499268,"score_gpt":0.2916749105686302,"score_spread":0.27205508960913094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492792645","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016439195,0.038301133,0.7268743,0.0042635803,0.0040358067,0.00015796948,0.0021139693,0.013632193,0.20897718],"genre_scores_gemma":[0.035672456,0.057207145,0.58511865,0.002416939,0.0027596268,0.00052863907,0.0065850485,0.009155326,0.3005562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943644,0.0000995088,0.000018835744,0.00011673634,0.0002956841,0.000032712407],"domain_scores_gemma":[0.9991449,0.00043028573,0.000030790663,0.00016109692,0.0001820174,0.00005080125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462371,0.0016822402,0.0007610502,0.002452693,0.0007737568,0.0036184022,0.0014377739,0.0011546677,0.0571395],"category_scores_gemma":[0.002842146,0.00088636216,0.0009234894,0.0046093687,0.0011094909,0.004227354,0.0016370144,0.0026154711,0.023389662],"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.000028972754,0.000022463884,0.00013910024,0.0006686478,0.000040519142,0.0001214715,0.00039893045,0.008980652,0.0029316389,0.15309079,0.43181884,0.40175802],"study_design_scores_gemma":[0.000009077059,0.000012993709,0.00020721844,0.00018133597,0.000013566221,0.00030071737,0.000103641476,0.014198342,0.0013229104,0.17369272,0.8099298,0.000027810816],"about_ca_topic_score_codex":0.0016986147,"about_ca_topic_score_gemma":0.0025720617,"teacher_disagreement_score":0.0571395,"about_ca_system_score_codex":0.0009350156,"about_ca_system_score_gemma":0.00074256584,"threshold_uncertainty_score":0.19115067},"labels":[],"label_agreement":null},{"id":"W2492854019","doi":"10.1007/978-3-662-45711-5","title":"Transactions on Computational Science XXIV","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.009395840214901856,"score_gpt":0.23996707279593002,"score_spread":0.23057123258102816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492854019","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005343172,0.07369653,0.15837899,0.018006092,0.0557666,0.00016377274,0.0020804517,0.0015262468,0.6850381],"genre_scores_gemma":[0.040468115,0.04493927,0.03779889,0.0015613583,0.007091912,0.0002739962,0.0021858972,0.00090749713,0.86477304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990852,0.00012599338,0.000052613148,0.00012459095,0.0005435359,0.00006795154],"domain_scores_gemma":[0.99910957,0.0002367323,0.000032930042,0.0002645737,0.00027037662,0.00008587649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087321666,0.0010869602,0.0016427385,0.0012115274,0.0007940551,0.0030947807,0.001104415,0.0011150514,0.118889675],"category_scores_gemma":[0.002493895,0.00042728733,0.00056869135,0.0024455707,0.0013658954,0.0021480906,0.0020280897,0.0027083368,0.04606548],"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.00006006303,0.000052664724,0.0002474546,0.00048443157,0.000043351072,0.000050068957,0.00006630833,0.002528476,0.0013868832,0.16583312,0.45635203,0.37289512],"study_design_scores_gemma":[0.000017711469,0.00002474494,0.00040453588,0.00017161068,0.000022913502,0.00011804735,0.000055714732,0.006407109,0.000884329,0.1335801,0.85829955,0.000013502782],"about_ca_topic_score_codex":0.0012775699,"about_ca_topic_score_gemma":0.0018837963,"teacher_disagreement_score":0.118889675,"about_ca_system_score_codex":0.0017138362,"about_ca_system_score_gemma":0.0015695572,"threshold_uncertainty_score":0.39772558},"labels":[],"label_agreement":null},{"id":"W2493077313","doi":"10.1007/978-3-319-42324-1_42","title":"HandsOn: Enabling Embodied, Creative STEM e-learning with Programming-Free Force Feedback","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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 British Columbia","funders":"","keywords":"Haptic technology; Embodied cognition; Computer science; Human–computer interaction; Curiosity; Software; Interface (matter); Multimedia; Artificial intelligence; Programming language","score_opus":0.029299889333011437,"score_gpt":0.2576952183132213,"score_spread":0.22839532898020984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493077313","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.04527487,0.005293529,0.74262613,0.00058161304,0.0007676626,0.00015226017,0.0006846747,0.02161884,0.18300045],"genre_scores_gemma":[0.31422177,0.004945334,0.26660785,0.00065659673,0.00023433544,0.00040169692,0.0015699446,0.0031864867,0.40817598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998216,0.000011889959,0.0000044206713,0.000035935092,0.00009981132,0.00002644477],"domain_scores_gemma":[0.999877,0.00005683716,0.0000051612255,0.000017687747,0.000020583191,0.000022683267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021338298,0.0009919358,0.00030886589,0.00030244008,0.00027721334,0.0011737741,0.0012837247,0.0009775958,0.03611052],"category_scores_gemma":[0.00048348343,0.00025524065,0.00031462059,0.00023434844,0.00048490847,0.001758905,0.0020549002,0.0008878422,0.0065081283],"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.00035736905,0.0001871913,0.00023897809,0.0005500694,0.00003212364,0.00035211927,0.0006205721,0.0050065145,0.21747698,0.023530988,0.032905385,0.7187417],"study_design_scores_gemma":[0.0001653354,0.00053159345,0.00210698,0.00039472096,0.000059387665,0.001801424,0.00037849005,0.048575476,0.3319309,0.043849826,0.5700298,0.0001761116],"about_ca_topic_score_codex":0.00045260784,"about_ca_topic_score_gemma":0.0008650993,"teacher_disagreement_score":0.03611052,"about_ca_system_score_codex":0.00022790702,"about_ca_system_score_gemma":0.00025598836,"threshold_uncertainty_score":0.12080175},"labels":[],"label_agreement":null},{"id":"W2493104602","doi":"10.1007/11780823","title":"Structural Information and Communication Complexity","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.020172738567078106,"score_gpt":0.249519412679978,"score_spread":0.22934667411289988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493104602","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.13758409,0.013623833,0.34231117,0.023104545,0.000942284,0.0001452728,0.0012365183,0.0008008249,0.48025152],"genre_scores_gemma":[0.92109656,0.008181751,0.025629606,0.0006880877,0.002142173,0.000268473,0.00075933663,0.00024395814,0.040990073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885297,0.00025668778,0.00004586577,0.00017042665,0.0005092152,0.00016475383],"domain_scores_gemma":[0.9929396,0.0054100887,0.00032933432,0.0007324043,0.00039764494,0.00019106272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009911597,0.0007209806,0.00094210333,0.0015815542,0.0013758235,0.00357892,0.0010347965,0.0014509582,0.015776845],"category_scores_gemma":[0.0074334303,0.0005528295,0.0006134833,0.003268984,0.0029451293,0.009234466,0.001522434,0.0032839132,0.001607517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019581053,0.000019118961,0.000106049694,0.000054005453,0.000007040331,0.000019568286,0.00006743706,0.004909318,0.00024751344,0.977398,0.004750865,0.012401577],"study_design_scores_gemma":[0.000004386797,0.0000048890774,0.000094619245,0.000008019084,0.000005143022,0.000030223071,0.000015298408,0.0073264483,0.0001755448,0.9894589,0.0028721648,0.0000044283142],"about_ca_topic_score_codex":0.0007710812,"about_ca_topic_score_gemma":0.00059826067,"teacher_disagreement_score":0.015776845,"about_ca_system_score_codex":0.002151548,"about_ca_system_score_gemma":0.0009778991,"threshold_uncertainty_score":0.05277878},"labels":[],"label_agreement":null},{"id":"W2493433605","doi":"10.1007/978-3-319-40238-3_59","title":"Identifying Urban Mobility Challenges for the Visually Impaired with Mobile Monitoring of Multimodal Biosignals","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":18,"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":"Institute of Circulatory and Respiratory Health","keywords":"Computer science; Situation awareness; Random forest; Multimodal interaction; Cognition; Human–computer interaction; Electroencephalography; Visually impaired; Artificial intelligence; Medicine","score_opus":0.056334151659307705,"score_gpt":0.3104860080717235,"score_spread":0.2541518564124158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493433605","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.96238744,0.0017992652,0.02918649,0.0006896107,0.000062651685,0.00007589998,0.0008198888,0.000252332,0.004726515],"genre_scores_gemma":[0.9840667,0.0013875868,0.011597698,0.00007936676,0.00003996753,0.000036503676,0.0005163757,0.000028916138,0.002246726],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99989414,0.000015303804,0.000007543008,0.00002963745,0.000019196113,0.00003418023],"domain_scores_gemma":[0.9998363,0.000062218736,0.000030735137,0.000009129603,0.000034453908,0.000027043852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018948023,0.00074881286,0.00036638012,0.00069819484,0.00025557063,0.0011885801,0.00040802194,0.00076036045,0.0013928224],"category_scores_gemma":[0.0012430198,0.0001469976,0.00029478903,0.00050710357,0.00024942865,0.00074665266,0.0009771517,0.00037347432,0.00056539016],"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.0011487103,0.00040208854,0.29389277,0.0006862802,0.00023603666,0.0057935445,0.0041259793,0.017569313,0.047206607,0.0015454033,0.010734445,0.6166588],"study_design_scores_gemma":[0.000050272065,0.00104136,0.6880788,0.0006825083,0.00030355924,0.015775636,0.023623182,0.21721701,0.024040151,0.014625742,0.014337664,0.00022425166],"about_ca_topic_score_codex":0.005061883,"about_ca_topic_score_gemma":0.007338643,"teacher_disagreement_score":0.005061883,"about_ca_system_score_codex":0.00017585118,"about_ca_system_score_gemma":0.00028840153,"threshold_uncertainty_score":0.01006484},"labels":[],"label_agreement":null},{"id":"W2493658341","doi":"10.1007/978-3-319-33461-5_8","title":"Exact Algorithms for the Chance-Constrained Vehicle Routing Problem","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Computer science; Vehicle routing problem; Routing (electronic design automation); Algorithm; Mathematical optimization; Computer network; Mathematics","score_opus":0.022987443722590362,"score_gpt":0.2638290936142523,"score_spread":0.2408416498916619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493658341","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.003470948,0.0009425126,0.98645663,0.00030739588,0.0001176207,0.00004739881,0.00011106799,0.00028872187,0.008257774],"genre_scores_gemma":[0.17209315,0.0022931695,0.8093255,0.00032655915,0.00034496732,0.0003314432,0.00059063383,0.00042241983,0.014272186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908125,0.00024935076,0.000045552766,0.00017073502,0.00031712692,0.00013601128],"domain_scores_gemma":[0.9981529,0.0013037617,0.00010572637,0.00018489387,0.00018405364,0.00006859124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012389531,0.0013131058,0.0015165032,0.0008789946,0.0007104631,0.001816248,0.0026105025,0.0017893583,0.010427142],"category_scores_gemma":[0.006358456,0.000987195,0.0012156635,0.0023568876,0.0011252713,0.0028717222,0.0020074206,0.0027988993,0.0014050825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112860056,0.00009086083,0.00023300265,0.00021899286,0.000047978745,0.000034899123,0.000067028646,0.6796575,0.0005453854,0.14206241,0.010757436,0.16617161],"study_design_scores_gemma":[0.0000382196,0.000020408937,0.00008785894,0.000027475984,0.000011492187,0.000027767937,0.000015613403,0.8616619,0.00020626259,0.13509512,0.0027969927,0.000010838455],"about_ca_topic_score_codex":0.0074753887,"about_ca_topic_score_gemma":0.007985989,"teacher_disagreement_score":0.010427142,"about_ca_system_score_codex":0.0018042567,"about_ca_system_score_gemma":0.002237343,"threshold_uncertainty_score":0.034882307},"labels":[],"label_agreement":null},{"id":"W2493658734","doi":"10.1007/978-3-319-39943-0_8","title":"Scaffolding Digital Game Design Activities Grouping Older Adults, Younger Adults and Teens","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Game design; Creativity; Computer science; Scaffold; Educational game; Computational thinking; Process (computing); Game based learning; Game design document; Human–computer interaction; Game Developer; Multimedia; Mathematics education; Psychology; Artificial intelligence; Social psychology","score_opus":0.012880665959299192,"score_gpt":0.24051467445394759,"score_spread":0.2276340084946484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493658734","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.9901663,0.0005926708,0.00076845335,0.0001248322,0.000033702203,0.00009110743,0.00008875554,0.00004501783,0.008089126],"genre_scores_gemma":[0.9894119,0.0007669472,0.004230346,0.00007093511,0.000020263662,0.00010977941,0.00023234208,0.000011068987,0.0051464504],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997247,0.000057808375,0.000022894454,0.000049373324,0.000046750447,0.00009854198],"domain_scores_gemma":[0.99905473,0.0002499332,0.00012914024,0.000033406868,0.00008224498,0.00045055253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050414394,0.0004413728,0.00047093298,0.0010344416,0.00077510515,0.0014520972,0.00044742035,0.0004036839,0.0037667754],"category_scores_gemma":[0.0020984905,0.00014885777,0.00039746804,0.0004174891,0.0002339707,0.0006901001,0.0016803904,0.00048329568,0.0006981941],"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.0007059273,0.0047346083,0.3308479,0.0005818657,0.00010200342,0.00069396925,0.11013394,0.00028331068,0.007894503,0.0014252884,0.0069420394,0.5356546],"study_design_scores_gemma":[0.00020475492,0.0040873573,0.7541362,0.000871123,0.0001662759,0.0017219587,0.17263813,0.001897012,0.0029597017,0.0043291626,0.056899257,0.000089088375],"about_ca_topic_score_codex":0.0020856834,"about_ca_topic_score_gemma":0.009177432,"teacher_disagreement_score":0.0037667754,"about_ca_system_score_codex":0.00030967494,"about_ca_system_score_gemma":0.00056009594,"threshold_uncertainty_score":0.012601137},"labels":[],"label_agreement":null},{"id":"W2494050007","doi":"10.1007/b93810","title":"Medical Image Computing and Computer-Assisted Intervention - MICCAI 2003","year":2003,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":284,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Intervention (counseling); Queen (butterfly); Medical imaging; Multimedia; Computer graphics (images); Artificial intelligence; Medicine; Nursing","score_opus":0.008464244655051951,"score_gpt":0.294619389023894,"score_spread":0.28615514436884204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494050007","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053187246,0.13874309,0.6246387,0.007407219,0.020041293,0.00026320745,0.0015896423,0.008722595,0.19327562],"genre_scores_gemma":[0.03778287,0.084039025,0.2368651,0.0010692708,0.0062443246,0.0002839109,0.002598394,0.002428934,0.6286882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995258,0.000037361584,0.000027499173,0.00010872535,0.00027485917,0.000025778127],"domain_scores_gemma":[0.99903786,0.00021282295,0.000040126844,0.00014195722,0.0004587551,0.0001085308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008150351,0.0015398447,0.0017141944,0.001676047,0.0004465111,0.0019971507,0.0014491694,0.0011190638,0.043860223],"category_scores_gemma":[0.0017645899,0.0008541543,0.00058537396,0.0027112283,0.00072927156,0.002445212,0.0014379744,0.002198238,0.02161732],"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.000062028135,0.000033108372,0.00012765029,0.0003331477,0.00003361805,0.000051774376,0.000032791875,0.0041592126,0.0027743382,0.012679074,0.3299539,0.64975935],"study_design_scores_gemma":[0.000027918213,0.00010061246,0.0029679106,0.00030863314,0.00008441392,0.0016063297,0.000060805116,0.090714864,0.008246567,0.042452607,0.853344,0.000085416126],"about_ca_topic_score_codex":0.0027321463,"about_ca_topic_score_gemma":0.005402596,"teacher_disagreement_score":0.043860223,"about_ca_system_score_codex":0.0008348564,"about_ca_system_score_gemma":0.0009638352,"threshold_uncertainty_score":0.14672709},"labels":[],"label_agreement":null},{"id":"W2494171310","doi":"10.1007/978-3-319-41501-7_76","title":"Estimating Ejection Fraction and Left Ventricle Volume Using Deep Convolutional Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ejection fraction; Ventricle; Convolutional neural network; Computer science; Artificial intelligence; DICOM; Diastole; End-systolic volume; Cardiology; Stroke volume; Internal medicine; Computer vision; Medicine; Heart failure; Blood pressure","score_opus":0.010666118434644097,"score_gpt":0.26937992193024063,"score_spread":0.25871380349559653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494171310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10070828,0.0034315705,0.88882595,0.00038154877,0.00012617951,0.000030611456,0.0013169881,0.0022104483,0.0029684375],"genre_scores_gemma":[0.79816794,0.0025316938,0.18581325,0.00023220487,0.00023124003,0.000056312518,0.0020210457,0.000304927,0.010641401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999027,0.000011801528,0.000005104755,0.000040174265,0.000024592018,0.000015662376],"domain_scores_gemma":[0.9998041,0.00010472021,0.000026887781,0.000018041155,0.000035077177,0.000011192953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037237597,0.0008718009,0.00059065555,0.00070741173,0.00011512422,0.0007292778,0.00051455206,0.00074548397,0.0014471648],"category_scores_gemma":[0.0010210916,0.0004893496,0.0004916115,0.00047418528,0.00016662847,0.00065926864,0.00059652864,0.00068134256,0.0008618388],"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.0003424187,0.00010114128,0.0155746285,0.00013428171,0.0001927408,0.00025031014,0.00006718598,0.22566281,0.033469792,0.002662687,0.0056547737,0.71588725],"study_design_scores_gemma":[0.00000898544,0.00002679397,0.007893774,0.000032365348,0.00003460777,0.00020782929,0.000012680255,0.9774581,0.0075680055,0.005382937,0.0013484798,0.00002548281],"about_ca_topic_score_codex":0.0043539507,"about_ca_topic_score_gemma":0.010333657,"teacher_disagreement_score":0.0043539507,"about_ca_system_score_codex":0.00032716544,"about_ca_system_score_gemma":0.00034298774,"threshold_uncertainty_score":0.008657217},"labels":[],"label_agreement":null},{"id":"W2494229806","doi":"10.1007/978-3-642-10439-8","title":"AI 2009: Advances in Artificial Intelligence","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Data Processing Techniques","field":"Engineering","cited_by":52,"is_retracted":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":"Computer science; Artificial intelligence","score_opus":0.013433996450964056,"score_gpt":0.28305192907811305,"score_spread":0.269617932627149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494229806","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019049518,0.2094593,0.19246964,0.0074757626,0.02601219,0.0001925811,0.0019524787,0.0045480146,0.55598515],"genre_scores_gemma":[0.007315277,0.083411776,0.06995438,0.0020326874,0.003963168,0.00015033863,0.0027894569,0.0012717388,0.8291111],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951756,0.000038563136,0.000025078125,0.00008153716,0.0003147631,0.000022468806],"domain_scores_gemma":[0.99911934,0.00035052872,0.00003754537,0.00011432606,0.00027738174,0.00010093359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005767227,0.0012778491,0.0014158282,0.0014671785,0.00047612996,0.0033463133,0.0013984945,0.000961408,0.071799435],"category_scores_gemma":[0.0017622043,0.0005113688,0.0006244908,0.0028631794,0.0005867383,0.0040672547,0.0011232905,0.0030855616,0.056626275],"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.000031038588,0.000042945692,0.000059840146,0.00072517525,0.000023343337,0.00003607551,0.00005326121,0.000983227,0.0016800296,0.03125792,0.56871355,0.39639363],"study_design_scores_gemma":[0.000007594098,0.000019034802,0.0002409987,0.00022935067,0.000015198838,0.00019723842,0.000022621292,0.0021013177,0.0005958044,0.020154057,0.9764049,0.0000119116285],"about_ca_topic_score_codex":0.0008282492,"about_ca_topic_score_gemma":0.0018360391,"teacher_disagreement_score":0.071799435,"about_ca_system_score_codex":0.0008300803,"about_ca_system_score_gemma":0.0013100667,"threshold_uncertainty_score":0.24019301},"labels":[],"label_agreement":null},{"id":"W2494258414","doi":"10.1007/978-3-319-39399-5_1","title":"User-Centered Requirements Analysis and Design Solutions for Chronic Disease Self-management","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Persona Design and Applications","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":"McMaster University","funders":"","keywords":"Chronic disease; Computer science; Health care; User interface; Persona; Cognition; Population; Interface (matter); Human–computer interaction; Medicine; Family medicine; Psychiatry","score_opus":0.04048140316459543,"score_gpt":0.27562531872679175,"score_spread":0.23514391556219633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494258414","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.018973159,0.0007148562,0.95356816,0.0025850027,0.00009422159,0.0010229364,0.0003320344,0.0015447257,0.021164902],"genre_scores_gemma":[0.13157316,0.0006366305,0.8561889,0.00058720785,0.000032902062,0.0013607595,0.0010983321,0.00036546326,0.008156677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98312366,0.009916018,0.0012744988,0.0007357383,0.0043542627,0.0005958287],"domain_scores_gemma":[0.9829038,0.010875188,0.00086303445,0.0015407755,0.003390985,0.0004262553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0153593905,0.001453788,0.0006711128,0.0018635801,0.0010972688,0.004873354,0.002385402,0.0018070972,0.005195496],"category_scores_gemma":[0.019592073,0.00093985384,0.0016886669,0.00102412,0.0012111663,0.0028864283,0.003809831,0.0019665004,0.0014902502],"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.00041361598,0.0009812106,0.0068634804,0.0035831546,0.00033281697,0.0012580618,0.025180042,0.051073227,0.03048512,0.215266,0.027257372,0.63730586],"study_design_scores_gemma":[0.00023407224,0.0010075236,0.0064458423,0.0040534395,0.00047254,0.002474488,0.016923899,0.32890058,0.03909131,0.22232427,0.3777872,0.00028482798],"about_ca_topic_score_codex":0.00282304,"about_ca_topic_score_gemma":0.0036281506,"teacher_disagreement_score":0.0153593905,"about_ca_system_score_codex":0.002086379,"about_ca_system_score_gemma":0.0041445764,"threshold_uncertainty_score":0.08122915},"labels":[],"label_agreement":null},{"id":"W2494404592","doi":"10.1007/978-3-319-32557-6","title":"High Performance Computing and Applications","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Supercomputer; Operating system","score_opus":0.009396581289261135,"score_gpt":0.24523196549144222,"score_spread":0.2358353842021811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494404592","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019884508,0.08497789,0.081276886,0.0043504178,0.017861718,0.00022325612,0.0008051371,0.0029438802,0.8055724],"genre_scores_gemma":[0.0077753426,0.033766378,0.018495502,0.0010426983,0.004009848,0.00014461127,0.0007927359,0.0007862301,0.93318677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999393,0.000042646003,0.000020701886,0.000077040684,0.0004255788,0.000041083935],"domain_scores_gemma":[0.9994282,0.00012134634,0.000029854898,0.000117548545,0.00021339172,0.00008954083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043370074,0.0018912706,0.0014269603,0.0019279252,0.000856655,0.0031157518,0.0012483448,0.0011686422,0.11255742],"category_scores_gemma":[0.0012816137,0.0006328606,0.00046770793,0.0035390144,0.00072597846,0.0028859233,0.0026444974,0.0030074797,0.08662707],"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.000041296433,0.00005826391,0.000090696194,0.00053923175,0.000023264716,0.000065297994,0.000060265345,0.0012126687,0.0037379286,0.044090703,0.46731937,0.48276103],"study_design_scores_gemma":[0.000007952637,0.00003759558,0.00027172817,0.00018173076,0.000009663422,0.00019789886,0.000025162704,0.0024790366,0.0011754095,0.026668377,0.96893144,0.000013902077],"about_ca_topic_score_codex":0.0003915361,"about_ca_topic_score_gemma":0.0007239987,"teacher_disagreement_score":0.11255742,"about_ca_system_score_codex":0.0006718436,"about_ca_system_score_gemma":0.0008925118,"threshold_uncertainty_score":0.37654203},"labels":[],"label_agreement":null},{"id":"W2494626219","doi":"10.1007/978-3-319-49259-9","title":"Stabilization, Safety, and Security of Distributed Systems","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"McMaster University","funders":"","keywords":"Computer security; Computer science; Business","score_opus":0.007605438438604697,"score_gpt":0.22615077781393392,"score_spread":0.21854533937532922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494626219","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030920034,0.09247642,0.4423964,0.007018544,0.0039572543,0.0000785923,0.00037049092,0.0019630003,0.42081922],"genre_scores_gemma":[0.5501996,0.050849836,0.058702547,0.00090537075,0.004640313,0.000222448,0.00066490547,0.00048707082,0.33332783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997416,0.000027809487,0.000010175765,0.000045883728,0.00015363329,0.00002089254],"domain_scores_gemma":[0.99967754,0.00013815993,0.000025910858,0.00006557194,0.00006731426,0.000025580428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020576967,0.00059258315,0.00038814565,0.0006409437,0.00042528068,0.0013724765,0.00046200556,0.00044395425,0.0056726374],"category_scores_gemma":[0.0009178971,0.0002497787,0.00023751523,0.00084394455,0.0012861217,0.0015942809,0.000811071,0.0014884482,0.0017773946],"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.00011100217,0.000057528436,0.00022429021,0.000373752,0.000020476395,0.0000719397,0.00033228056,0.025780369,0.008927399,0.59022915,0.057913825,0.31595805],"study_design_scores_gemma":[0.00002623768,0.000075061784,0.00032593973,0.00009650494,0.000014503744,0.00012426023,0.000066885856,0.028335635,0.0022738848,0.7929028,0.17574485,0.000013364801],"about_ca_topic_score_codex":0.0006485621,"about_ca_topic_score_gemma":0.00035650848,"teacher_disagreement_score":0.0056726374,"about_ca_system_score_codex":0.00054834806,"about_ca_system_score_gemma":0.00065744127,"threshold_uncertainty_score":0.018976867},"labels":[],"label_agreement":null},{"id":"W2494842936","doi":"10.1007/978-3-319-30139-6_16","title":"Counting Subgraphs in Relational Event Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Carleton University","funders":"","keywords":"Computer science; Graph; Range (aeronautics); Event (particle physics); Theoretical computer science; Relational database; Information retrieval","score_opus":0.01214947538484965,"score_gpt":0.24716451392873096,"score_spread":0.2350150385438813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494842936","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.043412153,0.0014871428,0.93962455,0.0008550218,0.000114975424,0.00013164108,0.0012367796,0.0010782401,0.012059586],"genre_scores_gemma":[0.45179287,0.0035957454,0.52004254,0.00043380435,0.0006599836,0.00043430415,0.005895574,0.0011009851,0.016044151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976127,0.00071570114,0.00017457257,0.00069608825,0.000657988,0.00014291488],"domain_scores_gemma":[0.9862298,0.010533034,0.00080507115,0.0013480347,0.0007361627,0.00034789054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018070464,0.0011798262,0.0012779465,0.0044156564,0.0009929693,0.002918159,0.0028252688,0.0013160545,0.00553805],"category_scores_gemma":[0.017764658,0.0011293337,0.0012732295,0.006283637,0.0014612575,0.009619959,0.0022876498,0.0020637685,0.00080671255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001086609,0.000086561005,0.0036386296,0.000720636,0.00013827028,0.00019162832,0.00048767315,0.06493059,0.002837616,0.748472,0.012423208,0.16596451],"study_design_scores_gemma":[0.000010271054,0.000011335469,0.00064961636,0.00006372077,0.00006284233,0.0001539569,0.00006298471,0.16419855,0.0011947452,0.828056,0.0055212905,0.000014678746],"about_ca_topic_score_codex":0.0024017913,"about_ca_topic_score_gemma":0.003450722,"teacher_disagreement_score":0.00553805,"about_ca_system_score_codex":0.0016445998,"about_ca_system_score_gemma":0.0006760464,"threshold_uncertainty_score":0.018526614},"labels":[],"label_agreement":null},{"id":"W2496185103","doi":"10.1007/978-3-319-42836-9_38","title":"Towards Scheduling to Minimize the Total Penalties of Tardiness of Delivered Data in Maritime CPSs (Invited Paper)","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","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":"Tardiness; Computer science; Initialization; Upload; Scheduling (production processes); Crossover; Real-time computing; Network packet; Heuristic; Mathematical optimization; Job shop scheduling; Distributed computing; Operations research; Computer network; Schedule; Artificial intelligence; Operating system; Engineering","score_opus":0.029934476985492817,"score_gpt":0.25278164550679105,"score_spread":0.22284716852129824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496185103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024486396,0.0019324662,0.96262467,0.0009766378,0.00061580207,0.00009391262,0.0001384422,0.00037636654,0.008755343],"genre_scores_gemma":[0.45700213,0.0032640398,0.51407254,0.000488921,0.00069759705,0.00018155444,0.00038012912,0.0006818916,0.023231218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997137,0.000065328764,0.000013229151,0.00007082395,0.000072370574,0.00006449837],"domain_scores_gemma":[0.9995529,0.00019169819,0.000047522804,0.000036340105,0.000119251934,0.000052222367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009132696,0.0010598187,0.00076529087,0.00043738674,0.00049305573,0.0011502912,0.0013689538,0.00080313865,0.003146003],"category_scores_gemma":[0.0015723536,0.00045153525,0.00066473393,0.00088983704,0.00047280686,0.0008610032,0.0009511531,0.0015017512,0.0005640024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001508837,0.00011116164,0.00041220695,0.0003986056,0.00007737787,0.00009347341,0.00016890664,0.7979621,0.010519627,0.056489527,0.0122910915,0.12132501],"study_design_scores_gemma":[0.000012202733,0.00008627765,0.00022549121,0.000030700612,0.000019117919,0.000036002526,0.00004971567,0.96039635,0.001502988,0.03056174,0.007069432,0.000010112601],"about_ca_topic_score_codex":0.0048273276,"about_ca_topic_score_gemma":0.004460145,"teacher_disagreement_score":0.0048273276,"about_ca_system_score_codex":0.0013111102,"about_ca_system_score_gemma":0.0017588414,"threshold_uncertainty_score":0.010524392},"labels":[],"label_agreement":null},{"id":"W2496350501","doi":"10.1007/978-3-642-32663-9","title":"Transactions on Computational Science XVI","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Field (mathematics); Data science; Computational science; Mathematics","score_opus":0.08042646485539853,"score_gpt":0.35745973857021196,"score_spread":0.27703327371481345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496350501","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00423984,0.10906693,0.28286704,0.02054995,0.068549745,0.00022641265,0.0037462804,0.002551154,0.5082026],"genre_scores_gemma":[0.031097144,0.06274317,0.07809102,0.0021430014,0.01251124,0.00035078215,0.0050525423,0.0017012306,0.8063099],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990388,0.00013494838,0.00006016358,0.00013641441,0.00058132526,0.00004841015],"domain_scores_gemma":[0.9984456,0.0004910762,0.000051965602,0.0004097844,0.00048116714,0.000120424476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009896425,0.0012431111,0.0016897508,0.0015016877,0.0005649853,0.0031295798,0.001238611,0.0010539342,0.11551597],"category_scores_gemma":[0.003679923,0.00045602347,0.0006734157,0.0035576834,0.0008915204,0.0024080125,0.0017371088,0.00282131,0.059677],"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.000047981004,0.000039475693,0.00027376646,0.0005101043,0.000051041912,0.00005313394,0.000049050403,0.0026667556,0.0013048778,0.05639222,0.55512637,0.38348526],"study_design_scores_gemma":[0.000016779028,0.000024046218,0.00062868994,0.00024015109,0.000030503787,0.00019524537,0.000049707174,0.009367614,0.0007099358,0.07750889,0.9112137,0.000014628537],"about_ca_topic_score_codex":0.0010389409,"about_ca_topic_score_gemma":0.0014528394,"teacher_disagreement_score":0.11551597,"about_ca_system_score_codex":0.0011731929,"about_ca_system_score_gemma":0.0012875065,"threshold_uncertainty_score":0.38643944},"labels":[],"label_agreement":null},{"id":"W2496357340","doi":"10.1007/978-3-319-39384-1_5","title":"Nonparametric Estimation of Edge Values of Regression Functions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","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 Manitoba","funders":"","keywords":"Bounded function; Mathematics; Domain (mathematical analysis); Kernel (algebra); Kernel density estimation; Function (biology); Nonparametric regression; Algorithm; Nonparametric statistics; Applied mathematics; Computer science; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.01186449885808135,"score_gpt":0.2286865537113508,"score_spread":0.21682205485326944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496357340","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.0125237275,0.00032580254,0.98567986,0.000042249423,0.000018787803,0.000007012814,0.00006206143,0.0002738597,0.001066633],"genre_scores_gemma":[0.3608443,0.0012997505,0.62866014,0.00008438176,0.00013458435,0.000078952384,0.0011251793,0.00052436197,0.0072483337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994555,0.000277038,0.000018735134,0.00009257036,0.00011509421,0.000041053332],"domain_scores_gemma":[0.99720794,0.0020293402,0.00015954998,0.00033207462,0.00022481018,0.000046336532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763628,0.0006057716,0.0007737362,0.0008418775,0.00018211569,0.00091178104,0.0013112031,0.0011008149,0.0020215923],"category_scores_gemma":[0.007975611,0.000504911,0.00054809905,0.00087299873,0.00057815097,0.0014387614,0.001071027,0.0014977996,0.00087716023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044514428,0.00010963469,0.004003463,0.00036421212,0.00011234908,0.0001421567,0.00013091369,0.23571865,0.026317598,0.059269637,0.0036326386,0.66975355],"study_design_scores_gemma":[0.000013525661,0.00005532948,0.0035425224,0.000055893077,0.000020610092,0.00015505125,0.000023947558,0.9329549,0.009171051,0.05073251,0.0032482708,0.000026351912],"about_ca_topic_score_codex":0.00039585188,"about_ca_topic_score_gemma":0.0005902647,"teacher_disagreement_score":0.0020215923,"about_ca_system_score_codex":0.00022057146,"about_ca_system_score_gemma":0.00021429909,"threshold_uncertainty_score":0.006762862},"labels":[],"label_agreement":null},{"id":"W2496364950","doi":"10.1007/b98048","title":"Computational Science and Its Applications – ICCSA 2004","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":295,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.05407763662381332,"score_gpt":0.34789096116475604,"score_spread":0.2938133245409427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496364950","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006055046,0.12067308,0.1921692,0.018662184,0.035535015,0.00035690074,0.0036617173,0.007630648,0.6152562],"genre_scores_gemma":[0.02393399,0.07204228,0.05773539,0.0014902966,0.008338674,0.0002556424,0.004456274,0.002117672,0.8296298],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902976,0.00017946861,0.00005939615,0.00015369838,0.00050961657,0.0000681062],"domain_scores_gemma":[0.9969432,0.0007094289,0.00009680818,0.00066353334,0.0012147778,0.00037219372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001975559,0.001305005,0.0019113672,0.0034845087,0.0010211524,0.004517688,0.0014125529,0.0011237689,0.06508326],"category_scores_gemma":[0.003964691,0.0010189163,0.00077226694,0.0063848495,0.0012599983,0.0033039292,0.002284673,0.0029545408,0.031880468],"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.000062674386,0.00006610939,0.00030266956,0.00032951176,0.00002658015,0.000031386284,0.00005063613,0.002922115,0.00062105124,0.027908448,0.7006786,0.26700017],"study_design_scores_gemma":[0.000008453909,0.00003216992,0.00080811797,0.00022161138,0.000028235625,0.00016080313,0.000037447957,0.007960007,0.0007154563,0.021332223,0.9686788,0.000016802604],"about_ca_topic_score_codex":0.006199867,"about_ca_topic_score_gemma":0.008882804,"teacher_disagreement_score":0.06508326,"about_ca_system_score_codex":0.0021393592,"about_ca_system_score_gemma":0.0027825334,"threshold_uncertainty_score":0.21772522},"labels":[],"label_agreement":null},{"id":"W2496423522","doi":"10.1007/978-3-319-41546-8_58","title":"Markovian Approach to Automatic Annotation of Breast Mass Spicules Using an A Contrario Model","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Department of Biotechnology, Ministry of Science and Technology, India","keywords":"Curvilinear coordinates; Computer science; Sponge spicule; Mammography; Artificial intelligence; Annotation; Pattern recognition (psychology); Computer vision; Mathematics; Geometry; Geology; Paleontology; Breast cancer; Medicine","score_opus":0.02511975715220021,"score_gpt":0.24718200159017847,"score_spread":0.22206224443797826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496423522","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.01905652,0.00036206446,0.9779183,0.00029639335,0.000058433765,0.000048976104,0.0002184009,0.00071407337,0.001326847],"genre_scores_gemma":[0.56443983,0.0006600684,0.41983125,0.00037250624,0.00021628232,0.00019259981,0.0014558549,0.00042405244,0.012407536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990858,0.00023788495,0.000071286166,0.0002958855,0.00019491928,0.00011409925],"domain_scores_gemma":[0.9977627,0.0013356147,0.00019041658,0.0002489533,0.0003932822,0.00006910495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017707438,0.0005577934,0.00087387086,0.0015341055,0.00067910564,0.0012733181,0.002432988,0.001644632,0.0028756668],"category_scores_gemma":[0.003173333,0.0007687488,0.0020808377,0.0011006256,0.00073785667,0.0014916075,0.0013794854,0.001547679,0.0009797777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000704164,0.00025601176,0.005714421,0.00028047222,0.00030173283,0.0005854165,0.00041868744,0.5273948,0.02966647,0.109480925,0.0065579647,0.318639],"study_design_scores_gemma":[0.000004926025,0.000022384873,0.00038240093,0.000008026349,0.00001948825,0.00006634683,0.000010617053,0.9851273,0.0015273816,0.012121189,0.0006972349,0.00001269406],"about_ca_topic_score_codex":0.01670276,"about_ca_topic_score_gemma":0.026270667,"teacher_disagreement_score":0.01670276,"about_ca_system_score_codex":0.0014388285,"about_ca_system_score_gemma":0.001617576,"threshold_uncertainty_score":0.033211112},"labels":[],"label_agreement":null},{"id":"W2496584187","doi":"10.1007/978-3-319-31808-0_4","title":"Improving Patient Specific Neurosurgical Models with Intraoperative Ultrasound and Augmented Reality Visualizations in a Neuronavigation Environment","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"McGill University","funders":"","keywords":"Neuronavigation; Augmented reality; Visualization; Computer science; Context (archaeology); Medical physics; Neurosurgery; Surgical planning; Medicine; Radiology; Artificial intelligence; Magnetic resonance imaging","score_opus":0.016584188830357206,"score_gpt":0.23161424650709383,"score_spread":0.21503005767673664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496584187","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.043303575,0.0012431501,0.94086707,0.00029353832,0.00018264331,0.00009121595,0.0004876528,0.0048644124,0.008666743],"genre_scores_gemma":[0.33257818,0.0041623735,0.6462952,0.00013644513,0.0000774732,0.00012449599,0.00112943,0.0017867759,0.013709644],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969316,0.00004905899,0.000020971294,0.000035660516,0.00017450773,0.000026696525],"domain_scores_gemma":[0.9995814,0.00017862134,0.000033553315,0.0000875974,0.0000979245,0.000020801326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035191452,0.0012710739,0.0004095653,0.00052657945,0.0001927256,0.0016720553,0.0007451344,0.0006848932,0.0049563083],"category_scores_gemma":[0.001361623,0.00071940135,0.0009432727,0.0004579467,0.00025993973,0.0009685308,0.0014396597,0.0009323161,0.0012931549],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030629642,0.00015277351,0.001833,0.00061154034,0.00013167225,0.00083567615,0.0009590472,0.27178764,0.14508733,0.011474242,0.015027111,0.55179363],"study_design_scores_gemma":[0.00003977841,0.0004182642,0.0032460762,0.00023815752,0.00027563804,0.0036679718,0.00041014876,0.72241914,0.17948046,0.010477038,0.07907729,0.00025008753],"about_ca_topic_score_codex":0.0014458996,"about_ca_topic_score_gemma":0.0027618797,"teacher_disagreement_score":0.0049563083,"about_ca_system_score_codex":0.00026961535,"about_ca_system_score_gemma":0.0005948293,"threshold_uncertainty_score":0.016580462},"labels":[],"label_agreement":null},{"id":"W2496731142","doi":"10.1007/978-3-642-33290-6","title":"Theory and Practice of Digital Libraries","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary Sciences","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 British Columbia","funders":"","keywords":"Successor cardinal; Computer science; Digital library; Library science; World Wide Web; Mathematics; Art","score_opus":0.01729966581326584,"score_gpt":0.2232262441955555,"score_spread":0.20592657838228967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496731142","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012114087,0.016337829,0.12241995,0.04652112,0.00050671684,0.00011385846,0.0001793739,0.00023032902,0.80157673],"genre_scores_gemma":[0.80938536,0.016048234,0.06303244,0.0049390686,0.00091073685,0.00051251944,0.00019738477,0.0001851387,0.10478914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919795,0.0051497305,0.0003675837,0.0007390739,0.001295285,0.00046899563],"domain_scores_gemma":[0.9871551,0.008791274,0.0005488272,0.0019167996,0.00093127985,0.0006567393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005858889,0.000469173,0.0005820933,0.0032579266,0.0043816003,0.016756138,0.002792347,0.0047797905,0.026226586],"category_scores_gemma":[0.013254897,0.0005548043,0.0005291551,0.0056745256,0.030092202,0.015546574,0.0052129277,0.003768264,0.0041957083],"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.0000025218992,0.000009787728,0.00008152564,0.00003273219,0.0000012686481,0.00001319975,0.0009477622,0.00018400844,0.000013257303,0.9914072,0.0017350944,0.005571543],"study_design_scores_gemma":[0.000008076785,0.0000067623478,0.000111231166,0.0002121173,0.0000032439384,0.000060939943,0.0021281766,0.0006582763,0.00008892784,0.8972376,0.09947856,0.000006143392],"about_ca_topic_score_codex":0.0053023724,"about_ca_topic_score_gemma":0.003957651,"teacher_disagreement_score":0.026226586,"about_ca_system_score_codex":0.007666934,"about_ca_system_score_gemma":0.008708095,"threshold_uncertainty_score":0.087736666},"labels":[],"label_agreement":null},{"id":"W2496750077","doi":"10.1007/978-3-642-20514-9","title":"Formal Concept Analysis","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Formal methods; Formal concept analysis; Operations research; Programming language; Software engineering; Library science; Algorithm; Mathematics","score_opus":0.017555217571870996,"score_gpt":0.23678020850570647,"score_spread":0.21922499093383546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496750077","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.0040714163,0.010722553,0.7403123,0.0042840075,0.001358416,0.0002160094,0.0010502794,0.00079567527,0.23718931],"genre_scores_gemma":[0.2527902,0.012903765,0.4757173,0.0020655675,0.0019207704,0.00089283154,0.0039952695,0.0008122799,0.24890204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987268,0.00032590303,0.00009430654,0.0002934609,0.00048483454,0.00007474703],"domain_scores_gemma":[0.9992592,0.00034620473,0.000030319741,0.00015499837,0.00018640417,0.000022798598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014607086,0.0009197237,0.0008516861,0.0022591571,0.0012849021,0.0042063324,0.0011434485,0.0006768429,0.028104229],"category_scores_gemma":[0.0025887475,0.0005615759,0.0012997128,0.0024050327,0.0029065276,0.0059938263,0.0017718013,0.002802627,0.009386079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064193136,0.000012014791,0.000035930923,0.00010408278,0.000011036101,0.00002877897,0.00020742252,0.00042907216,0.00030874228,0.94327545,0.011285673,0.04429539],"study_design_scores_gemma":[0.0000034211507,0.0000050579656,0.000051980314,0.000044516404,0.0000092699,0.000067933026,0.00006410857,0.0015434194,0.00030146522,0.9229136,0.07499012,0.0000051556694],"about_ca_topic_score_codex":0.0006937532,"about_ca_topic_score_gemma":0.0005070437,"teacher_disagreement_score":0.028104229,"about_ca_system_score_codex":0.0017191267,"about_ca_system_score_gemma":0.0010663134,"threshold_uncertainty_score":0.09401798},"labels":[],"label_agreement":null},{"id":"W2496758482","doi":"10.1007/978-3-319-29965-5_4","title":"Stereoscopic Motion Magnification in Minimally-Invasive Robotic Prostatectomy","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"Western University","funders":"","keywords":"Neurovascular bundle; Computer science; Prostatectomy; Stereoscopy; Magnification; Computer vision; Artificial intelligence; Prostate cancer; Medicine; Surgery; Cancer","score_opus":0.02846619584140629,"score_gpt":0.2774438498737259,"score_spread":0.24897765403231958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496758482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10246369,0.2183737,0.34065065,0.0023821022,0.0023722441,0.00015083754,0.00028667058,0.0016143663,0.33170584],"genre_scores_gemma":[0.56507975,0.09988367,0.13165362,0.0011395284,0.0020540818,0.00009841442,0.00035478303,0.0003540972,0.19938196],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985456,0.0000232416,0.0000068312456,0.000019001218,0.00008501594,0.000011401388],"domain_scores_gemma":[0.9999,0.00006396655,0.000008270867,0.00000950515,0.000010856703,0.0000074869145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002358885,0.00036956125,0.00017450955,0.00040693078,0.00011402438,0.0002799469,0.0005551584,0.00048613697,0.007549674],"category_scores_gemma":[0.00041970774,0.00023887561,0.0003175651,0.00031088424,0.00037486138,0.00053624593,0.0004670751,0.0006104349,0.000770595],"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.00020179618,0.00006744535,0.0010173621,0.0010099123,0.000029818038,0.0010448137,0.00029005407,0.005048878,0.06574833,0.015073943,0.017006164,0.8934616],"study_design_scores_gemma":[0.000103432554,0.001969611,0.055783693,0.0014716239,0.00017677322,0.095914416,0.0004076665,0.039963257,0.08705253,0.028532574,0.68832654,0.00029790498],"about_ca_topic_score_codex":0.0005449249,"about_ca_topic_score_gemma":0.0015386262,"teacher_disagreement_score":0.007549674,"about_ca_system_score_codex":0.00024332959,"about_ca_system_score_gemma":0.00026072506,"threshold_uncertainty_score":0.025256157},"labels":[],"label_agreement":null},{"id":"W2496784399","doi":"10.1007/978-3-319-42111-7_40","title":"Definition of Luxury Dwellings Features for Regulatory Purposes and for Formation of Market Price","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Housing Market and Economics","field":"Economics, Econometrics and Finance","cited_by":3,"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":"Korean Intellectual Property Office; Fundação para a Ciência e a Tecnologia; École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg; Universitas Telkom; Szegedi Tudományegyetem; Universitas Teknologi Yogyakarta; Universidad Nacional del Nordeste; Universidad de Playa Ancha; Universidade do Minho; Nanjing University of Information Science and Technology; Universidad de Valladolid; Universidade Federal do Rio Grande do Sul; Università della Calabria; NetApp; Universität Zürich; Universidad de Oviedo; Memorial University of Newfoundland; Universidad de Cantabria; London South Bank University; Università degli Studi di Salerno; Universitat de Barcelona; Uniwersytet Łódzki; Universidade de Coimbra; Nanjing University; Universiti Malaya; Akademie Věd České Republiky; European Commission; Politechnika Poznańska; East China Normal University; Università degli Studi di Perugia; KU Leuven; Università degli Studi di Cagliari; Ege Üniversitesi; Kunsan National University; Hannam University; Wonkwang University; Deakin University; Delhi Technological University; Instituto Politécnico de Bragança; Cairo University; Indian Council of Agricultural Research; La Trobe University; Università di Pisa; Euskal Herriko Unibertsitatea; Erciyes Üniversitesi; Yonsei University; Waseda University; University of Twente; Universitatea din București; Saint Petersburg State University; Západočeská Univerzita v Plzni; University of Connecticut; Universidad de Sevilla; University of Leeds; Universidade de Aveiro; Monash University; University of Canterbury; Sungkyunkwan University; Universitat de Girona; Università degli Studi della Basilicata; Università degli Studi Mediterranea di Reggio Calabria; U.S. Department of Energy","keywords":"Real estate; Residential real estate; Sample (material); Point (geometry); Relevance (law); Computer science; Center (category theory); Industrial organization; Business; Architectural engineering; Finance; Engineering; Mathematics; Political science","score_opus":0.02735598982198706,"score_gpt":0.21117126485967205,"score_spread":0.183815275037685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496784399","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14119557,0.0025524367,0.5158593,0.0012158352,0.0007897592,0.0004145747,0.005500119,0.000713895,0.33175856],"genre_scores_gemma":[0.6802226,0.0015198324,0.2594823,0.0003026182,0.00048246587,0.0005269519,0.004660466,0.0002667614,0.05253604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996388,0.000043095235,0.000044013068,0.00010869057,0.00010717736,0.00005830918],"domain_scores_gemma":[0.9997495,0.000050714425,0.0000468101,0.000042186075,0.00008922194,0.000021541937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003081629,0.00037282726,0.00025614607,0.0010498025,0.0005761069,0.0017663218,0.0007974116,0.00071710185,0.008398911],"category_scores_gemma":[0.0007184617,0.00019370513,0.00052318565,0.0014978074,0.0009222395,0.002085619,0.0006838109,0.0008797688,0.0015874722],"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.00006744938,0.00007320549,0.0025069078,0.00019649163,0.000014435775,0.00033469967,0.0006027433,0.0024419418,0.0074004093,0.8854412,0.009809467,0.0911109],"study_design_scores_gemma":[0.000029751152,0.00019732985,0.0146827465,0.00029648806,0.000052148516,0.0016317548,0.0008010172,0.020484028,0.010898733,0.3944054,0.5564369,0.00008366938],"about_ca_topic_score_codex":0.001445433,"about_ca_topic_score_gemma":0.001499433,"teacher_disagreement_score":0.008398911,"about_ca_system_score_codex":0.0005380969,"about_ca_system_score_gemma":0.00038379215,"threshold_uncertainty_score":0.028097212},"labels":[],"label_agreement":null},{"id":"W2496800066","doi":"10.1007/978-3-662-49890-3_26","title":"Safely Exporting Keys from Secure Channels","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Norges Teknisk-Naturvitenskapelige Universitet; Microsoft Research","keywords":"Computer science; Handshake; Transport Layer Security; Computer security; Key exchange; Encryption; Protocol (science); Cryptographic protocol; Cryptography; Computer network; Authenticated Key Exchange; Authenticated encryption; Public-key cryptography","score_opus":0.019908905202163825,"score_gpt":0.26813673829578144,"score_spread":0.24822783309361762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496800066","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03408553,0.0006964828,0.8839127,0.0011817226,0.0006233194,0.00015907269,0.00033596775,0.005281401,0.07372386],"genre_scores_gemma":[0.56327856,0.0035040774,0.25257367,0.0006134489,0.00046322157,0.0003623075,0.001310352,0.0066326284,0.17126177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981353,0.00024015481,0.000117193005,0.00022860312,0.0010067414,0.00027190123],"domain_scores_gemma":[0.9968918,0.0010440273,0.000116103234,0.0015984284,0.00027487703,0.00007474196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013344644,0.0010406703,0.00079627836,0.0007026065,0.0010802314,0.0044563967,0.0011418958,0.001153175,0.012367407],"category_scores_gemma":[0.006266062,0.00085548195,0.0008529494,0.00094241934,0.0028480103,0.011798434,0.0072389194,0.004580899,0.0070497026],"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.00018895761,0.000030397921,0.00018191556,0.0002484097,0.000023440753,0.00031380958,0.0010555092,0.0039506964,0.012616789,0.84807503,0.011442746,0.121872224],"study_design_scores_gemma":[0.000034071647,0.00005190398,0.000095216805,0.000123135,0.000031533065,0.0005134571,0.0001801122,0.012069746,0.038290612,0.8619409,0.08663083,0.00003853599],"about_ca_topic_score_codex":0.0002990915,"about_ca_topic_score_gemma":0.00026871177,"teacher_disagreement_score":0.012367407,"about_ca_system_score_codex":0.0007221252,"about_ca_system_score_gemma":0.000970736,"threshold_uncertainty_score":0.041373074},"labels":[],"label_agreement":null},{"id":"W2496887306","doi":"10.1007/978-3-319-41540-6","title":"Computer Aided Verification","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Set (abstract data type); Volume (thermodynamics); Software engineering; Computer graphics (images); Programming language","score_opus":0.010406015669731506,"score_gpt":0.21371490685959724,"score_spread":0.20330889118986573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496887306","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.003965794,0.003351979,0.8567759,0.00042496796,0.0008719449,0.00018454381,0.0008754836,0.00750628,0.12604305],"genre_scores_gemma":[0.16400088,0.0048910338,0.5101454,0.0006028057,0.00056702225,0.00032943426,0.006446594,0.002768496,0.3102484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837923,0.00024009256,0.00008110922,0.0003306516,0.00086432457,0.00010465756],"domain_scores_gemma":[0.99880314,0.0002972369,0.000046306362,0.0005741956,0.00025920768,0.000019959603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011111388,0.0015729317,0.0011105399,0.0015119929,0.00080502435,0.0017128289,0.001589726,0.0009484708,0.07086225],"category_scores_gemma":[0.0024015813,0.0008455406,0.0014256318,0.0009308565,0.00090595655,0.0022354599,0.002295224,0.0015674379,0.03470869],"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.00014192566,0.00006581494,0.00027674844,0.0004497909,0.000046892223,0.00013297152,0.000061564235,0.009505416,0.017107861,0.07366024,0.06381322,0.83473754],"study_design_scores_gemma":[0.00006638978,0.00025042676,0.0013065969,0.00042967158,0.000105080224,0.0018931233,0.00008865417,0.112830624,0.10141558,0.24257682,0.5389531,0.0000838631],"about_ca_topic_score_codex":0.0006076203,"about_ca_topic_score_gemma":0.0010067036,"teacher_disagreement_score":0.07086225,"about_ca_system_score_codex":0.0006439476,"about_ca_system_score_gemma":0.0010499832,"threshold_uncertainty_score":0.23705786},"labels":[],"label_agreement":null},{"id":"W2496935834","doi":"10.1007/978-3-319-42019-6_9","title":"Minimal Objectification and Maximal Unnesting in PSOA RuleML","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Programming language; Identifier; Correctness; Theoretical computer science; Nested loop join; Database","score_opus":0.021166362842739716,"score_gpt":0.2449849212061027,"score_spread":0.223818558363363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496935834","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.009268664,0.00019535067,0.96220165,0.00054202584,0.00018808723,0.00020054076,0.0012751007,0.005205545,0.02092293],"genre_scores_gemma":[0.15862145,0.0003165348,0.82317084,0.00042161034,0.00013936858,0.0002390662,0.0036730058,0.0024503688,0.01096783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504244,0.0012242784,0.00079486286,0.00096375175,0.0016673638,0.00030727603],"domain_scores_gemma":[0.9938793,0.0031290504,0.00022898482,0.0017297065,0.0008823442,0.00015060505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031560939,0.0008040813,0.0009023323,0.0015984814,0.0011014947,0.0051798136,0.0023150535,0.0013417548,0.010823073],"category_scores_gemma":[0.011279749,0.0014700693,0.0024067722,0.0011976851,0.0029672538,0.006960397,0.0041308617,0.0038606746,0.0041877045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019876381,0.000152588,0.0010188422,0.00051732565,0.000079515106,0.00065163034,0.0012019925,0.016433662,0.0057897074,0.71518755,0.0102747865,0.24849358],"study_design_scores_gemma":[0.00004422234,0.000049877613,0.0002921678,0.00026833412,0.00012199982,0.00045341838,0.00030161114,0.11897981,0.023910305,0.7661806,0.08932782,0.00006988784],"about_ca_topic_score_codex":0.0032820532,"about_ca_topic_score_gemma":0.005524623,"teacher_disagreement_score":0.010823073,"about_ca_system_score_codex":0.000848017,"about_ca_system_score_gemma":0.0020815213,"threshold_uncertainty_score":0.036206782},"labels":[],"label_agreement":null},{"id":"W2497674850","doi":"10.1007/978-3-642-11811-1","title":"Abstract State Machines, Alloy, B and Z","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Materials Characterization Techniques","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Alloy; State (computer science); Materials science; Computer science; Metallurgy; Programming language","score_opus":0.005464214593972748,"score_gpt":0.2209909194622512,"score_spread":0.21552670486827843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497674850","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021902109,0.051835977,0.51469845,0.0038947314,0.0068631065,0.00014392486,0.0017353229,0.004348976,0.3945774],"genre_scores_gemma":[0.2909645,0.029136974,0.19336385,0.0013142341,0.0030490472,0.00040905643,0.0032676177,0.0008714232,0.47762337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979514,0.000022343913,0.000015130965,0.000057689795,0.000092264374,0.000017454477],"domain_scores_gemma":[0.9998048,0.000067427885,0.000016903736,0.000033039367,0.0000634194,0.000014447932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017430584,0.0008165634,0.00061250525,0.000883838,0.0006587147,0.0018449735,0.0007183466,0.00061648194,0.011296709],"category_scores_gemma":[0.00069624826,0.00027534028,0.00043697332,0.001826168,0.0012102005,0.0024947335,0.0005581734,0.001320418,0.004083347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007400878,0.000026351472,0.00009087405,0.00035111615,0.0000127674075,0.00006074382,0.00009738732,0.0060218107,0.0044300575,0.75673234,0.05766065,0.17444195],"study_design_scores_gemma":[0.000014610489,0.00006416121,0.00025494164,0.000071146955,0.000014652337,0.00017354432,0.000033231176,0.015460519,0.0031140863,0.7257126,0.25506935,0.00001704644],"about_ca_topic_score_codex":0.0012051701,"about_ca_topic_score_gemma":0.0010317194,"teacher_disagreement_score":0.011296709,"about_ca_system_score_codex":0.0007604868,"about_ca_system_score_gemma":0.00064640626,"threshold_uncertainty_score":0.03779131},"labels":[],"label_agreement":null},{"id":"W2497768360","doi":"10.1007/978-3-642-32009-5","title":"Advances in Cryptology – CRYPTO 2012","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligence, Security, War Strategy","field":"Social Sciences","cited_by":224,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cryptography; Computer security","score_opus":0.019306202091211967,"score_gpt":0.3187969559404289,"score_spread":0.2994907538492169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497768360","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005643828,0.12057375,0.0870423,0.030112471,0.031639595,0.0001967215,0.0012110376,0.0024540417,0.72112626],"genre_scores_gemma":[0.0837008,0.08506968,0.039291203,0.0037557462,0.024486419,0.00019706198,0.0022451086,0.0013601088,0.7598939],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905926,0.00017994574,0.000051087223,0.00014175841,0.00046835252,0.000099502744],"domain_scores_gemma":[0.9986866,0.00037661433,0.000094471885,0.00036762768,0.0003289023,0.00014562931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011023255,0.0015141857,0.0010122923,0.002155781,0.001263185,0.0051684347,0.0009438885,0.0013322574,0.04596599],"category_scores_gemma":[0.0033555033,0.00064686785,0.0004625198,0.0036986172,0.0015051464,0.008476029,0.0017029218,0.004882935,0.030990003],"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.00009546903,0.000066286055,0.00014250657,0.0004191114,0.000023824006,0.000057041754,0.00004991419,0.0013352036,0.000841849,0.13695729,0.44340026,0.41661128],"study_design_scores_gemma":[0.000036817088,0.00004275821,0.00035954843,0.00025534295,0.000020007505,0.00039709898,0.00002785298,0.0029840537,0.0011619884,0.1000688,0.8946218,0.000024112378],"about_ca_topic_score_codex":0.0005777439,"about_ca_topic_score_gemma":0.00074939895,"teacher_disagreement_score":0.04596599,"about_ca_system_score_codex":0.00212559,"about_ca_system_score_gemma":0.0019177994,"threshold_uncertainty_score":0.15377158},"labels":[],"label_agreement":null},{"id":"W2497844642","doi":"10.1007/b137280","title":"Theory and Applications of Satisfiability Testing","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Computer science; Satisfiability; Theoretical computer science; Boolean satisfiability problem; Algorithm; Programming language","score_opus":0.08053416493871743,"score_gpt":0.38604253884329964,"score_spread":0.3055083739045822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497844642","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.004793418,0.025597654,0.8603061,0.00440338,0.0008139191,0.00009044381,0.0003281438,0.00035727653,0.103309646],"genre_scores_gemma":[0.28526706,0.043387882,0.6209358,0.00231823,0.0036485244,0.00059151265,0.001106125,0.00035244587,0.042392433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971769,0.0009790789,0.0001972699,0.00036377573,0.0011383516,0.00014464569],"domain_scores_gemma":[0.99146444,0.0068494435,0.00026712206,0.0007196782,0.00057524524,0.00012411992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026094601,0.0014620064,0.0016260729,0.0034633148,0.0009426298,0.0041542547,0.002677966,0.002160737,0.011076453],"category_scores_gemma":[0.013045313,0.0010393878,0.0018020442,0.0049683047,0.004479145,0.006157364,0.002346596,0.004697884,0.0018378113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013818172,0.000029598967,0.00024233208,0.00017282231,0.000025699064,0.000074158175,0.000082237006,0.012155529,0.0003312284,0.89385,0.0070447824,0.085977755],"study_design_scores_gemma":[0.0000035384498,0.0000061525207,0.00006153415,0.00004279363,0.0000071912414,0.00008500343,0.00001450489,0.020956518,0.0001421217,0.9719221,0.006751486,0.0000070625283],"about_ca_topic_score_codex":0.0018863425,"about_ca_topic_score_gemma":0.0013739628,"teacher_disagreement_score":0.011076453,"about_ca_system_score_codex":0.0020317596,"about_ca_system_score_gemma":0.0014570229,"threshold_uncertainty_score":0.03705442},"labels":[],"label_agreement":null},{"id":"W2497894281","doi":"10.1007/978-3-642-21538-4","title":"Autonomous and Intelligent Systems","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":31,"is_retracted":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; University of Waterloo","funders":"","keywords":"Computer science; Intelligent decision support system; Software engineering; Operations research; Artificial intelligence; Engineering","score_opus":0.022413223435722187,"score_gpt":0.23822528641041033,"score_spread":0.21581206297468813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497894281","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004248919,0.027544081,0.06945156,0.007321009,0.002364603,0.00006695789,0.00013986841,0.0003069432,0.88855606],"genre_scores_gemma":[0.16977161,0.028819086,0.025983835,0.0022294812,0.0025152315,0.00026898345,0.00038334253,0.00019344121,0.76983494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997756,0.000046626283,0.000009500333,0.00004119781,0.00010590321,0.000021148264],"domain_scores_gemma":[0.99981636,0.00006725539,0.000012212367,0.00005310743,0.0000283644,0.000022832684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002846018,0.0006537704,0.0004667126,0.00040046673,0.00060163747,0.002414933,0.0005148997,0.0008478157,0.015585842],"category_scores_gemma":[0.0006746083,0.00025533463,0.00021220015,0.00051991135,0.0028612074,0.0032805358,0.0015675394,0.0012812633,0.0048468513],"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.0000062155664,0.000014842258,0.00007265185,0.00010632435,0.00000782505,0.000035015502,0.00032066109,0.0011230191,0.0005412795,0.9085884,0.034364376,0.05481936],"study_design_scores_gemma":[0.0000045963475,0.00001566192,0.00018646347,0.00006321796,0.0000054157226,0.000074523,0.00011931067,0.0016061277,0.00030043983,0.5443502,0.45326906,0.0000049725054],"about_ca_topic_score_codex":0.00063468114,"about_ca_topic_score_gemma":0.0007650549,"teacher_disagreement_score":0.015585842,"about_ca_system_score_codex":0.000868079,"about_ca_system_score_gemma":0.00090636493,"threshold_uncertainty_score":0.05213982},"labels":[],"label_agreement":null},{"id":"W2498117776","doi":"10.1007/11596356","title":"Embedded and Ubiquitous Computing – EUC 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":65,"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":"Ubiquitous computing; Context-aware pervasive systems; Computer science; Operating system","score_opus":0.009728300993846929,"score_gpt":0.23664713103622192,"score_spread":0.226918830042375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498117776","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00978986,0.11186114,0.42494094,0.0034951984,0.018340355,0.00021686094,0.00056322233,0.0064633093,0.42432907],"genre_scores_gemma":[0.02944193,0.03396699,0.07419101,0.0005577592,0.0011957384,0.00007629105,0.00089604594,0.0009991054,0.85867524],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956113,0.00005047002,0.00002496313,0.000090832174,0.00023511703,0.000037609218],"domain_scores_gemma":[0.9994411,0.00009971483,0.000024211025,0.00012516062,0.00022199273,0.00008791734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070084236,0.00094234565,0.00094996946,0.0007439708,0.0003970361,0.001976614,0.001072831,0.0009431501,0.022318168],"category_scores_gemma":[0.0008416192,0.0005374193,0.0003485928,0.0012951184,0.0005226142,0.0025765428,0.0010303874,0.0015263712,0.015122097],"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.00009632351,0.00008156726,0.00019567077,0.00040351335,0.000027323744,0.000116801144,0.00014950612,0.0032347396,0.0056587076,0.03378578,0.29896206,0.657288],"study_design_scores_gemma":[0.000014921465,0.00010361165,0.0008946931,0.0002902064,0.00003849811,0.00072352396,0.000078207864,0.010935034,0.0042705447,0.010755645,0.9718678,0.000027356062],"about_ca_topic_score_codex":0.0018445326,"about_ca_topic_score_gemma":0.0040218993,"teacher_disagreement_score":0.022318168,"about_ca_system_score_codex":0.0008173671,"about_ca_system_score_gemma":0.00075442326,"threshold_uncertainty_score":0.07466167},"labels":[],"label_agreement":null},{"id":"W2498177025","doi":"10.1007/978-3-319-40238-3_12","title":"Exploring the Relationship Between Implicit Scaffolding and Inclusive Design in Interactive Science Simulations","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Ontario College of Art and Design","funders":"","keywords":"Scaffold; Suite; Computer science; Human–computer interaction; Implicit learning; Multimedia; Programming language; Psychology","score_opus":0.1367449713321867,"score_gpt":0.370421010396751,"score_spread":0.23367603906456433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498177025","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.8845908,0.0002634945,0.076094806,0.00028372492,0.000022622367,0.00006655955,0.00002913584,0.000112124195,0.038536742],"genre_scores_gemma":[0.9885061,0.00006841886,0.009983141,0.000013649286,0.0000026173732,0.000048759433,0.000019923731,0.000027453429,0.0013300697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772805,0.0013800043,0.00009385862,0.0002104758,0.0004353381,0.00015230343],"domain_scores_gemma":[0.96226656,0.033820465,0.0013122834,0.0014018642,0.000733961,0.00046491707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031506992,0.00053019536,0.00035644812,0.00059931306,0.00079096184,0.005266038,0.0011964713,0.00088034704,0.006457044],"category_scores_gemma":[0.047740933,0.00052700704,0.00041785339,0.00071547343,0.0019631062,0.004093789,0.0043419986,0.0015659642,0.0003682488],"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.0027386327,0.002749143,0.10762761,0.0016266122,0.00046796302,0.00057672284,0.085528634,0.067027315,0.025586413,0.40110254,0.0011279399,0.3038405],"study_design_scores_gemma":[0.00032363666,0.0019290113,0.09924604,0.00069045677,0.00060079555,0.0005821724,0.025788648,0.2910137,0.018526843,0.54340035,0.017686475,0.00021181913],"about_ca_topic_score_codex":0.0011763822,"about_ca_topic_score_gemma":0.0016259707,"teacher_disagreement_score":0.006457044,"about_ca_system_score_codex":0.0007015781,"about_ca_system_score_gemma":0.0009479252,"threshold_uncertainty_score":0.021600902},"labels":[],"label_agreement":null},{"id":"W2498324117","doi":"10.1007/978-3-319-40970-2_9","title":"Learning Rate Based Branching Heuristic for SAT Solvers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":160,"is_retracted":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":"Heuristics; Computer science; Leverage (statistics); Solver; Branching (polymer chemistry); Heuristic; Mathematical optimization; Reinforcement learning; Artificial intelligence; Optimization problem; Machine learning; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.023853973969740764,"score_gpt":0.27565994816613043,"score_spread":0.25180597419638967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498324117","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.013658507,0.00097282475,0.9701774,0.00045992443,0.00016042602,0.00014546205,0.00020398613,0.002310615,0.0119107915],"genre_scores_gemma":[0.29600507,0.00073230785,0.6886036,0.00044946006,0.00024958362,0.000487831,0.0011258399,0.0010569688,0.011289402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828255,0.00069626333,0.00008297492,0.0002714068,0.0004594626,0.00020742118],"domain_scores_gemma":[0.99310994,0.005246103,0.00022795553,0.0006177115,0.0005570158,0.00024135524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024154314,0.001304557,0.0016365397,0.0015654155,0.00068845256,0.0015769122,0.002943619,0.0019031895,0.014304056],"category_scores_gemma":[0.012684319,0.0008015594,0.0013018474,0.0018144145,0.001281856,0.0025528471,0.0020967128,0.004422565,0.0026042117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051118445,0.0002522055,0.0007116941,0.0003588816,0.00007594336,0.00007030314,0.00012918451,0.518254,0.0031168463,0.08370535,0.011797078,0.38101742],"study_design_scores_gemma":[0.000042043892,0.000044973953,0.00008531537,0.000038928283,0.000017488948,0.000020178535,0.000011746879,0.9487786,0.000736583,0.049037974,0.0011767007,0.00000952217],"about_ca_topic_score_codex":0.002707711,"about_ca_topic_score_gemma":0.004105716,"teacher_disagreement_score":0.014304056,"about_ca_system_score_codex":0.0022072815,"about_ca_system_score_gemma":0.0024375953,"threshold_uncertainty_score":0.0478518},"labels":[],"label_agreement":null},{"id":"W2499161046","doi":"10.1007/978-3-642-28258-4","title":"Partially Supervised Learning","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.018327215123471786,"score_gpt":0.24362950601024758,"score_spread":0.22530229088677578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499161046","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.0040313113,0.0022413672,0.97222704,0.0005257879,0.00032485445,0.00006781052,0.00089332636,0.0044430126,0.0152455075],"genre_scores_gemma":[0.15894362,0.0022985488,0.73063725,0.00077839283,0.0008923561,0.00040395375,0.010979193,0.0016750845,0.09339147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990971,0.00020257285,0.000045398097,0.00036479914,0.00023415487,0.00005597898],"domain_scores_gemma":[0.99861825,0.00044245593,0.00006152858,0.00053912436,0.00028368327,0.000054991422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608636,0.0012006286,0.0012469218,0.0007605862,0.0004872455,0.0010905701,0.0016961084,0.0012220651,0.015298781],"category_scores_gemma":[0.0027594431,0.00057388487,0.0009795112,0.00086348975,0.0006592802,0.0018668789,0.0019367572,0.0018896636,0.010547991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009655909,0.000098709505,0.00042438542,0.0001906439,0.000104145125,0.000045364708,0.00003527654,0.04656648,0.0029075185,0.018785542,0.068252064,0.8624933],"study_design_scores_gemma":[0.000025364066,0.000103220285,0.0006691112,0.00006897897,0.0000503043,0.00022261842,0.000026424052,0.8621156,0.0065168277,0.085483946,0.04469016,0.000027547874],"about_ca_topic_score_codex":0.0010965817,"about_ca_topic_score_gemma":0.0023017894,"teacher_disagreement_score":0.015298781,"about_ca_system_score_codex":0.00044212994,"about_ca_system_score_gemma":0.00081500865,"threshold_uncertainty_score":0.05117953},"labels":[],"label_agreement":null},{"id":"W2499168780","doi":"10.1007/978-3-319-10596-3","title":"Advancing Big Data Benchmarks","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Big data; Computer science; Data science; Data mining","score_opus":0.054301861974078436,"score_gpt":0.2790727158333038,"score_spread":0.22477085385922535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499168780","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018107101,0.046933584,0.24940015,0.11264116,0.034764912,0.00044749584,0.012254931,0.02129207,0.5041587],"genre_scores_gemma":[0.2951875,0.037983358,0.339271,0.024306942,0.021761103,0.0010375169,0.051672537,0.013226113,0.21555391],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9908997,0.0022163708,0.00038943093,0.00079310255,0.004963952,0.0007374742],"domain_scores_gemma":[0.97820103,0.007079802,0.00063878566,0.0046744607,0.007159268,0.00224656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016227381,0.0019340228,0.0014150754,0.005845068,0.0018091903,0.010415453,0.0037984771,0.0020955398,0.029223574],"category_scores_gemma":[0.045913532,0.001003228,0.0007602054,0.0054575405,0.0017692609,0.015996104,0.007109894,0.00586115,0.0131664155],"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.00017226562,0.00008349691,0.001150352,0.00020815614,0.00003937752,0.000049946135,0.00009083666,0.0036195458,0.00082113047,0.13852559,0.57666117,0.27857807],"study_design_scores_gemma":[0.000050132563,0.00009478786,0.0012440329,0.00046025906,0.000031092593,0.00013063345,0.00024104193,0.021009153,0.003367515,0.3982979,0.5750228,0.000050723025],"about_ca_topic_score_codex":0.0026227054,"about_ca_topic_score_gemma":0.0042279786,"teacher_disagreement_score":0.029223574,"about_ca_system_score_codex":0.0022991695,"about_ca_system_score_gemma":0.0033767584,"threshold_uncertainty_score":0.097762525},"labels":[],"label_agreement":null},{"id":"W2499219338","doi":"10.1007/978-3-540-73368-3","title":"Computer Aided Verification","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Real-time simulation and control systems","field":"Engineering","cited_by":29,"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":"Uppsala Universitet; Eidgenössische Technische Hochschule Zürich; University of Oxford; Microsoft Research; Carnegie Mellon University; York University; Intel Corporation; University of Pennsylvania; Hebrew University of Jerusalem; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Computer science","score_opus":0.010192794172500646,"score_gpt":0.22810793212029432,"score_spread":0.21791513794779366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499219338","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031352937,0.0018128253,0.8718724,0.00023214165,0.0005158064,0.00017237966,0.00092635944,0.008191993,0.113140814],"genre_scores_gemma":[0.13416973,0.0031461043,0.5887448,0.00042940924,0.00026429526,0.0003964635,0.0059053316,0.0026030089,0.2643409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868935,0.0002106358,0.000060511433,0.00023772594,0.0007197244,0.00008215965],"domain_scores_gemma":[0.99895763,0.00026560327,0.000033144115,0.00048948027,0.00024029697,0.000013886746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010008509,0.0014958419,0.0011439997,0.0014609596,0.00073906814,0.0015383632,0.0015079547,0.0009173869,0.08778094],"category_scores_gemma":[0.0022499627,0.00083899806,0.0014242831,0.00089131866,0.00071772805,0.001783437,0.0018128467,0.0013728308,0.03384494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015289515,0.00007769882,0.00030385298,0.00046431212,0.00005252234,0.00013323461,0.00006534678,0.019053474,0.016706545,0.10748584,0.06454788,0.7909565],"study_design_scores_gemma":[0.00008716053,0.00025423404,0.0010702629,0.0003624544,0.000104258506,0.0014811716,0.00007625162,0.20234503,0.08581453,0.18494153,0.5233861,0.00007703621],"about_ca_topic_score_codex":0.00082993193,"about_ca_topic_score_gemma":0.0012255039,"teacher_disagreement_score":0.08778094,"about_ca_system_score_codex":0.00054578076,"about_ca_system_score_gemma":0.00089163636,"threshold_uncertainty_score":0.29365647},"labels":[],"label_agreement":null},{"id":"W2500062327","doi":"10.1007/978-3-540-88425-5","title":"Rough Sets and Current Trends in Computing","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1099,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Current (fluid); Rough set; Artificial intelligence; Electrical engineering","score_opus":0.024855930789342204,"score_gpt":0.2768443501141991,"score_spread":0.2519884193248569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500062327","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006333456,0.7349363,0.15773709,0.016173663,0.0065665334,0.00007779629,0.00030950468,0.00042837326,0.07743723],"genre_scores_gemma":[0.18529977,0.61642987,0.14637426,0.002921843,0.011589853,0.00027073317,0.0005631103,0.00018968404,0.03636089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99750805,0.0005303267,0.00022246808,0.0002313,0.0014126765,0.00009511027],"domain_scores_gemma":[0.99628395,0.002519006,0.00020989994,0.00030134007,0.0005857747,0.00010014201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025227126,0.00091601297,0.001960716,0.0039952127,0.00074268866,0.0065393886,0.0011542366,0.001155374,0.0058016134],"category_scores_gemma":[0.007953055,0.00044287066,0.0008091531,0.007823709,0.003738044,0.008688828,0.0012030968,0.0026394264,0.0017646975],"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.000020863214,0.000023430111,0.00020039183,0.0009180726,0.00004182282,0.00003260692,0.00033272794,0.002038582,0.00024190043,0.80696917,0.0189561,0.17022431],"study_design_scores_gemma":[0.0000093905755,0.000034608205,0.00045684644,0.00035628641,0.00003681032,0.00014494856,0.00024765436,0.004037689,0.00013296599,0.86070657,0.13380736,0.000028854753],"about_ca_topic_score_codex":0.0010732961,"about_ca_topic_score_gemma":0.0011360936,"teacher_disagreement_score":0.0065393886,"about_ca_system_score_codex":0.0018219713,"about_ca_system_score_gemma":0.0013254761,"threshold_uncertainty_score":0.019408345},"labels":[],"label_agreement":null},{"id":"W2500177803","doi":"10.1007/978-3-319-40349-6_44","title":"User Centered Design Methods and Their Application in Older Adult Community","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Think aloud protocol; Context (archaeology); Computer science; Protocol (science); Focus group; Data collection; User-centered design; Process (computing); Human–computer interaction; Applied psychology; Psychology; Medicine; Usability","score_opus":0.03383001227769478,"score_gpt":0.3253963815150569,"score_spread":0.2915663692373621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500177803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060622685,0.02355542,0.86156756,0.0012880889,0.00055269565,0.001405431,0.0002054136,0.0014941914,0.049308427],"genre_scores_gemma":[0.18091244,0.0097972,0.7699087,0.00058989774,0.00011185706,0.0031763471,0.0002070702,0.00048212925,0.03481439],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99435645,0.0040895175,0.0002324423,0.00027882998,0.0009530234,0.00008966194],"domain_scores_gemma":[0.98505765,0.0124319615,0.000418769,0.0005551789,0.0012157243,0.00032079883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011161278,0.000912442,0.0005008505,0.0020835279,0.0009515414,0.0030191261,0.0010545247,0.0014326035,0.009350866],"category_scores_gemma":[0.012602554,0.0005720521,0.0005675171,0.001613741,0.0009974289,0.0023389026,0.0019867045,0.000990606,0.0012082113],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021943235,0.0005540529,0.0032926048,0.0017381588,0.0000419158,0.00018635827,0.019369155,0.0009521086,0.005555479,0.032838963,0.008435967,0.9268157],"study_design_scores_gemma":[0.00072165864,0.007855032,0.042606995,0.010255983,0.00046002932,0.0051997826,0.03498868,0.036211476,0.025036216,0.20777115,0.6283711,0.0005218884],"about_ca_topic_score_codex":0.0006448753,"about_ca_topic_score_gemma":0.0010848131,"teacher_disagreement_score":0.011161278,"about_ca_system_score_codex":0.0006639567,"about_ca_system_score_gemma":0.0011170794,"threshold_uncertainty_score":0.059027195},"labels":[],"label_agreement":null},{"id":"W2500190401","doi":"10.1007/978-3-319-39378-0_50","title":"Linguistic Descriptors and Analytic Hierarchy Process in Face Recognition Realized by Humans","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Voting; Identification (biology); Facial recognition system; Analytic hierarchy process; Artificial intelligence; Face (sociological concept); Process (computing); Suspect; Hierarchy; Machine learning; Parametric statistics; Natural language processing; Pattern recognition (psychology); Linguistics; Operations research; Mathematics; Statistics","score_opus":0.02179805180015682,"score_gpt":0.2619041789382045,"score_spread":0.2401061271380477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500190401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12888925,0.005194061,0.8461552,0.0011077366,0.00015885287,0.00005459427,0.00022470421,0.0004385817,0.017776899],"genre_scores_gemma":[0.79203725,0.0019345249,0.19681634,0.00009331,0.00013094836,0.00005565969,0.00022463435,0.000059732978,0.008647625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99981564,0.00005796783,0.000010240072,0.00003907206,0.000053139618,0.000023920855],"domain_scores_gemma":[0.99973804,0.00014143056,0.000027393626,0.000030511603,0.000047759797,0.0000147575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001082,0.000158951,0.00025314116,0.0005796203,0.00034022037,0.0011969245,0.00051097386,0.00031854206,0.0018844339],"category_scores_gemma":[0.0017114778,0.00016930887,0.0002954705,0.00075202656,0.0007590077,0.001627821,0.0004142993,0.00067615794,0.00042476394],"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.00015215509,0.00006839833,0.0015274312,0.00022116944,0.000037136953,0.000118794174,0.001281907,0.025605617,0.015856186,0.6422226,0.0047295233,0.30817914],"study_design_scores_gemma":[0.000015154351,0.0000622625,0.0029248158,0.00004465446,0.000028377284,0.00008233462,0.00048360016,0.34299308,0.005053402,0.6407472,0.0075288867,0.000036143807],"about_ca_topic_score_codex":0.004520363,"about_ca_topic_score_gemma":0.0032764766,"teacher_disagreement_score":0.004520363,"about_ca_system_score_codex":0.00079556997,"about_ca_system_score_gemma":0.0006086853,"threshold_uncertainty_score":0.008988082},"labels":[],"label_agreement":null},{"id":"W2500329317","doi":"10.1007/978-3-642-53974-9","title":"Specifying Big Data Benchmarks","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data Technologies and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Big data; Computer science; Data science; Data mining","score_opus":0.2982924050768856,"score_gpt":0.37123925728618384,"score_spread":0.07294685220929825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500329317","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.012743564,0.00082069705,0.89452,0.001968486,0.0005345537,0.00039111657,0.006701245,0.027670225,0.054650147],"genre_scores_gemma":[0.20525624,0.0010866062,0.7124858,0.0011426121,0.0003419437,0.0012018972,0.023823021,0.018174788,0.036487095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907952,0.0030112697,0.0010044287,0.0009968209,0.0035504766,0.0006418267],"domain_scores_gemma":[0.98376805,0.009865658,0.0004827532,0.0035415036,0.0019220441,0.00042000422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071728295,0.0018562513,0.0011545345,0.0021450815,0.0014484036,0.0076997955,0.0030596182,0.001557241,0.023101496],"category_scores_gemma":[0.034738142,0.0018132663,0.0018881193,0.0028144752,0.0014915506,0.009813894,0.004688934,0.0039743925,0.0050433655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004493183,0.00016120021,0.0027785164,0.00094988605,0.00009914752,0.00051160087,0.00075861707,0.035221573,0.0049438667,0.6172754,0.09287522,0.24397565],"study_design_scores_gemma":[0.000082988314,0.000074128926,0.0005419487,0.00035620382,0.00006839635,0.0003473778,0.000334338,0.12628756,0.01832049,0.67330587,0.18019298,0.0000876365],"about_ca_topic_score_codex":0.0036475842,"about_ca_topic_score_gemma":0.005558914,"teacher_disagreement_score":0.023101496,"about_ca_system_score_codex":0.0018628396,"about_ca_system_score_gemma":0.0024332185,"threshold_uncertainty_score":0.07728225},"labels":[],"label_agreement":null},{"id":"W2500625161","doi":"10.1007/978-3-662-49529-2_39","title":"Generating Random Spanning Trees via Fast Matrix Multiplication","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spanning tree; Matrix multiplication; Computer science; Random graph; Laplacian matrix; Minimum spanning tree; Kruskal's algorithm; Algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science","score_opus":0.03671713926362286,"score_gpt":0.3227779818664565,"score_spread":0.28606084260283365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500625161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007329564,0.00009345407,0.9890149,0.00009599124,0.000043395572,0.0000523438,0.00007333937,0.0005994283,0.0026975097],"genre_scores_gemma":[0.23940477,0.0002426163,0.7518435,0.000120283636,0.000116257586,0.00039540074,0.00041890627,0.00045281678,0.007005458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987676,0.00050313893,0.000048222442,0.00019653913,0.00039993544,0.000084551466],"domain_scores_gemma":[0.9951036,0.0035589526,0.00016601206,0.0006274647,0.00040727336,0.00013677154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866237,0.0007720359,0.0009568553,0.0009572,0.0006135894,0.0011513124,0.001517093,0.0013046203,0.009146158],"category_scores_gemma":[0.008860871,0.0007748987,0.00077262544,0.0013653297,0.0008087823,0.0021233098,0.0021958987,0.0016107032,0.0022730983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014495819,0.000112062124,0.00036593506,0.00019668246,0.000054508,0.00015430762,0.00022952008,0.41071728,0.00622902,0.37578318,0.00828198,0.19773056],"study_design_scores_gemma":[0.0000216268,0.0000149426205,0.000036848433,0.000008802133,0.000005939265,0.00005520348,0.000010233358,0.8435899,0.00090747216,0.1536428,0.0016978018,0.000008407276],"about_ca_topic_score_codex":0.0008848487,"about_ca_topic_score_gemma":0.0014506861,"teacher_disagreement_score":0.009146158,"about_ca_system_score_codex":0.0006630531,"about_ca_system_score_gemma":0.00062173285,"threshold_uncertainty_score":0.030596912},"labels":[],"label_agreement":null},{"id":"W2500983192","doi":"10.1007/978-3-540-28629-5_67","title":"A Common Algebraic Description for Probabilistic and Quantum Computations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Polytechnique Montréal; Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Semiring; Complement (music); Generalization; Probabilistic logic; Computer science; Quantum gate; Discrete mathematics; Tensor (intrinsic definition); TRACE (psycholinguistics); Class (philosophy); Complexity class; Quantum computer; Quantum; Algebraic structure; Field (mathematics); Theoretical computer science; Mathematics; Computational complexity theory; Algorithm; Pure mathematics; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.019035715424447864,"score_gpt":0.24748106096410197,"score_spread":0.2284453455396541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500983192","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.0146879135,0.0022302314,0.75540066,0.006956309,0.0017912432,0.00022242575,0.00091580115,0.0005704526,0.2172249],"genre_scores_gemma":[0.5972268,0.0038340648,0.27046844,0.0036902057,0.005239196,0.001126342,0.0014415288,0.0009245997,0.11604889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736136,0.00061880396,0.00022526953,0.00038844915,0.0011212874,0.00028476247],"domain_scores_gemma":[0.9983798,0.0005194204,0.00009740986,0.0004578489,0.00041055892,0.00013494684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020328688,0.0014935005,0.0016071139,0.0029590253,0.004406083,0.007211079,0.003190778,0.00289988,0.01364293],"category_scores_gemma":[0.0036071131,0.0009766249,0.0024747977,0.0032475886,0.009067163,0.017956797,0.0047148345,0.0073003345,0.0035065964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001468506,0.0000025905856,0.0000042986226,0.0000070798596,8.551501e-7,0.000005627835,0.000030412588,0.000057495185,0.00003483985,0.9985286,0.00046537895,0.000861361],"study_design_scores_gemma":[0.0000025646991,0.0000033141532,0.000009535422,0.0000047721533,0.0000022399759,0.00002955335,0.000016366936,0.0007326348,0.00006686833,0.9944454,0.0046820953,0.0000046512323],"about_ca_topic_score_codex":0.0012412003,"about_ca_topic_score_gemma":0.0009717131,"teacher_disagreement_score":0.01364293,"about_ca_system_score_codex":0.0023947137,"about_ca_system_score_gemma":0.0015949429,"threshold_uncertainty_score":0.04564017},"labels":[],"label_agreement":null},{"id":"W2501449615","doi":"10.1007/978-3-319-41312-9","title":"Unconventional Computation and Natural Computation","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computation; Computer science; Natural computing; Natural (archaeology); Artificial intelligence; Algorithm; History; Archaeology","score_opus":0.01255930020650609,"score_gpt":0.2594622280887126,"score_spread":0.24690292788220652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501449615","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016370505,0.05614671,0.079527296,0.008338592,0.0021093339,0.000033299908,0.00012017309,0.00024225794,0.83711183],"genre_scores_gemma":[0.55362403,0.03938308,0.041218914,0.001845407,0.003645316,0.00019347604,0.0003318444,0.00030697414,0.35945094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977416,0.000067392386,0.00000855615,0.000039049835,0.00008848236,0.00002237161],"domain_scores_gemma":[0.99961346,0.0002295895,0.000018232282,0.00008013465,0.00003990181,0.000018745277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002743796,0.00043669538,0.0004087973,0.0007357667,0.00092576497,0.0022914,0.0006853492,0.0006740736,0.010709302],"category_scores_gemma":[0.0011877567,0.00022618644,0.00036485586,0.001035551,0.0042961943,0.004357218,0.0011840797,0.0021415285,0.0016425163],"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.000003462706,0.000002878497,0.000020682255,0.00004508425,0.0000014212475,0.000009541091,0.000065408785,0.00026421453,0.000092545604,0.9866766,0.004065071,0.008753165],"study_design_scores_gemma":[0.0000013238828,0.0000014115499,0.000034440003,0.000021259453,9.719136e-7,0.000028596183,0.000015685608,0.00055279833,0.000055299603,0.9687667,0.030519763,0.0000017029399],"about_ca_topic_score_codex":0.00061825773,"about_ca_topic_score_gemma":0.0010323977,"teacher_disagreement_score":0.010709302,"about_ca_system_score_codex":0.0014388805,"about_ca_system_score_gemma":0.0005976711,"threshold_uncertainty_score":0.035826206},"labels":[],"label_agreement":null},{"id":"W2501524975","doi":"10.1007/978-3-319-41501-7_41","title":"Object Detection and Localization Using Deep Convolutional Networks with Softmax Activation and Multi-class Log Loss","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Western University","funders":"","keywords":"Softmax function; Computer science; Artificial intelligence; Minimum bounding box; Convolutional neural network; Pattern recognition (psychology); Region of interest; Computer vision; Deep learning; Object detection; Object (grammar); Contextual image classification; Image (mathematics)","score_opus":0.01630436585931179,"score_gpt":0.24118291951103518,"score_spread":0.22487855365172338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501524975","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.010777305,0.0007218004,0.9777493,0.00023368553,0.00013933056,0.000050539726,0.00038012562,0.0069268555,0.0030211147],"genre_scores_gemma":[0.2645908,0.0011013699,0.69492984,0.0003920254,0.0001356406,0.00012985348,0.002516612,0.0005692945,0.035634547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999514,0.000027901035,0.000018716943,0.00020993018,0.00013122457,0.00009832439],"domain_scores_gemma":[0.9995447,0.00010829505,0.000045109664,0.0001154858,0.00014582409,0.000040540297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028426,0.0017030258,0.0012978103,0.0012300109,0.0005493933,0.0017269432,0.0024691068,0.0016838529,0.007187106],"category_scores_gemma":[0.0011687084,0.00093663565,0.0010803996,0.0012501219,0.0004841591,0.0017709959,0.002106878,0.0016420215,0.0070847254],"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.00027999515,0.0001489463,0.00080453977,0.0001389299,0.00008035663,0.00011737548,0.00003793578,0.030501015,0.041450504,0.0038251588,0.0110784015,0.9115367],"study_design_scores_gemma":[0.00001632332,0.00008192995,0.0011790652,0.00003626512,0.000053038988,0.00019267251,0.000025182933,0.9266615,0.057675496,0.007849169,0.006195141,0.0000342181],"about_ca_topic_score_codex":0.00914452,"about_ca_topic_score_gemma":0.01750863,"teacher_disagreement_score":0.00914452,"about_ca_system_score_codex":0.001129195,"about_ca_system_score_gemma":0.001438162,"threshold_uncertainty_score":0.024043262},"labels":[],"label_agreement":null},{"id":"W2501623012","doi":"10.1007/978-3-642-28499-1","title":"Adaptive and Learning Agents","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Adaptive learning; Volume (thermodynamics); Artificial intelligence; Operations research; Engineering","score_opus":0.027554493214906297,"score_gpt":0.2545634117968054,"score_spread":0.22700891858189912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501623012","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074297716,0.03824573,0.24655265,0.0058896826,0.0023597786,0.00009900823,0.00013089605,0.00058540533,0.69870716],"genre_scores_gemma":[0.1777362,0.018588556,0.060022295,0.001165634,0.0012197883,0.00023518212,0.00028091003,0.00023495144,0.7405164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976104,0.00005781544,0.000010643875,0.000048611295,0.000104004386,0.000017936147],"domain_scores_gemma":[0.999757,0.000108959575,0.000014636567,0.000057917518,0.00004074509,0.00002071644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034863365,0.00062376866,0.00044761656,0.0005130099,0.00056267687,0.0022224742,0.00069920655,0.0011165561,0.012771627],"category_scores_gemma":[0.0012115586,0.00028832923,0.00026099492,0.0007188685,0.0015775964,0.0030727189,0.0011492874,0.0015652619,0.0029920135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015279087,0.000030856365,0.00009389973,0.00012395227,0.000012016449,0.00004798125,0.0002850838,0.004637537,0.00062263105,0.84448594,0.024301426,0.1253433],"study_design_scores_gemma":[0.000008309061,0.000021868924,0.00017074999,0.00006813517,0.000009068182,0.00011135417,0.00009405461,0.008656053,0.0006870569,0.72131926,0.2688444,0.000009784091],"about_ca_topic_score_codex":0.0006250738,"about_ca_topic_score_gemma":0.0006771719,"teacher_disagreement_score":0.012771627,"about_ca_system_score_codex":0.0008516038,"about_ca_system_score_gemma":0.00045550775,"threshold_uncertainty_score":0.042725384},"labels":[],"label_agreement":null},{"id":"W2501702276","doi":"10.1007/978-3-319-34111-8_10","title":"Fuzzy Computational Model for Emotions Originated in Workplace Events","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotions and Moral Behavior","field":"Psychology","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 Windsor","funders":"","keywords":"Affect (linguistics); Computer science; Set (abstract data type); Fuzzy logic; Test (biology); Control (management); Fuzzy set; Artificial intelligence; Performance appraisal; Operations research; Psychology; Management; Mathematics; Programming language","score_opus":0.043094706976628865,"score_gpt":0.33434354970868474,"score_spread":0.29124884273205587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501702276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07513006,0.0010450205,0.8902797,0.0012556522,0.00020307752,0.00005652963,0.00036776502,0.0002049754,0.031457238],"genre_scores_gemma":[0.90828896,0.000669371,0.07123316,0.00015371648,0.00011906143,0.00015414247,0.00032405838,0.000043687072,0.01901382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985325,0.000040330273,0.000007645021,0.000030377982,0.00004047673,0.000027898051],"domain_scores_gemma":[0.9997048,0.00018487113,0.000018022049,0.000017530701,0.00005493687,0.000019854318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004069438,0.00038853253,0.00054094347,0.0005208461,0.00049835845,0.0012943032,0.0016445285,0.0010029968,0.007401633],"category_scores_gemma":[0.0013140223,0.00022158133,0.000781553,0.00046499827,0.0005184999,0.0013131028,0.00047548022,0.0011565837,0.00060306815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008368886,0.00009359666,0.0008870368,0.00011106868,0.00007045017,0.00019116302,0.00026669362,0.5561043,0.0021841705,0.4071723,0.0026692632,0.03016625],"study_design_scores_gemma":[0.000004826602,0.0000075324306,0.00015836711,0.0000071525337,0.000007674625,0.000016323622,0.000021163496,0.9594742,0.000093366776,0.039749928,0.00045388914,0.000005522366],"about_ca_topic_score_codex":0.009125923,"about_ca_topic_score_gemma":0.0074774586,"teacher_disagreement_score":0.009125923,"about_ca_system_score_codex":0.0010760085,"about_ca_system_score_gemma":0.00062356243,"threshold_uncertainty_score":0.024760962},"labels":[],"label_agreement":null},{"id":"W2501743935","doi":"10.1007/978-3-319-40355-7_37","title":"TIIARA: A Language Tool for Bridging the Language Gap","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"McGill University","funders":"","keywords":"Computer science; Bridging (networking); Search engine indexing; Taxonomy (biology); Natural language processing; Vocabulary; Arabic; Artificial intelligence; Information retrieval; Linguistics","score_opus":0.017411324033210572,"score_gpt":0.27024986059476785,"score_spread":0.2528385365615573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501743935","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.0017546463,0.0004378773,0.81634533,0.00047900676,0.00054559787,0.0001889468,0.004239453,0.1615602,0.014448932],"genre_scores_gemma":[0.050121535,0.0011982329,0.78311193,0.0016607333,0.00053744036,0.001260711,0.023407169,0.1028807,0.035821587],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99736565,0.00064626784,0.00047268305,0.00053883344,0.00069636863,0.00028014067],"domain_scores_gemma":[0.99517643,0.0024689538,0.00026053571,0.0010518982,0.00078722445,0.0002549316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025490653,0.002700064,0.0018113408,0.00334915,0.0013623104,0.007254143,0.004563139,0.0021572835,0.061279245],"category_scores_gemma":[0.0092157945,0.0022907024,0.0034254913,0.002885265,0.0016392362,0.012723265,0.008604623,0.006671506,0.045659505],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010238385,0.0002340867,0.0013224183,0.002854358,0.00022725228,0.0010613366,0.003972637,0.0035031494,0.027288552,0.21375296,0.3442942,0.40046525],"study_design_scores_gemma":[0.00016437467,0.00013434947,0.00036751135,0.00046508838,0.00017571938,0.0016830737,0.0005945834,0.028473148,0.031373758,0.082625866,0.85370696,0.00023568407],"about_ca_topic_score_codex":0.0019418714,"about_ca_topic_score_gemma":0.002313566,"teacher_disagreement_score":0.061279245,"about_ca_system_score_codex":0.0009082599,"about_ca_system_score_gemma":0.0025681807,"threshold_uncertainty_score":0.20499945},"labels":[],"label_agreement":null},{"id":"W2502078092","doi":"10.1007/978-3-319-21741-3","title":"Stabilization, Safety, and Security of Distributed Systems","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Computer security; Distributed computing","score_opus":0.010965314054209285,"score_gpt":0.23697484148915335,"score_spread":0.22600952743494407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502078092","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030330988,0.09825991,0.44860694,0.006866052,0.0039699287,0.00008047915,0.0003589678,0.0019432802,0.40958354],"genre_scores_gemma":[0.55721116,0.0551135,0.059593905,0.00093275384,0.0048866635,0.00023295265,0.00064929936,0.00047555342,0.32090423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973613,0.000028759187,0.000010167639,0.000045929533,0.00015756804,0.000021456643],"domain_scores_gemma":[0.9996587,0.0001506724,0.00002706309,0.00006815792,0.00006907652,0.000026354917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002190334,0.000600006,0.0004098391,0.0006464685,0.00042154035,0.0013631553,0.00047622525,0.00043496268,0.0052876403],"category_scores_gemma":[0.0009512369,0.00026183508,0.00024708582,0.00088309596,0.00134882,0.0016170933,0.00080102263,0.0015409045,0.0016418681],"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.00010926595,0.000056694756,0.00023024046,0.00036834032,0.000021830863,0.00006741587,0.00031804136,0.027498579,0.008125887,0.58844936,0.059327852,0.31542647],"study_design_scores_gemma":[0.000026963571,0.00007355528,0.00033007833,0.000098346965,0.0000147379205,0.000111112844,0.000062509505,0.02882175,0.0020521218,0.80460614,0.16378939,0.00001328102],"about_ca_topic_score_codex":0.00070055586,"about_ca_topic_score_gemma":0.0003782057,"teacher_disagreement_score":0.0052876403,"about_ca_system_score_codex":0.00057543576,"about_ca_system_score_gemma":0.0006623227,"threshold_uncertainty_score":0.01768893},"labels":[],"label_agreement":null},{"id":"W2502237338","doi":"10.1007/978-3-319-63088-5","title":"Collaboration Technologies and Social Computing","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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 Saskatchewan","funders":"","keywords":"Computer science; Social computing; World Wide Web; Library science; Data science; Social media","score_opus":0.016604878428961623,"score_gpt":0.24941367365624087,"score_spread":0.23280879522727924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502237338","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024022833,0.06864921,0.06760732,0.028612766,0.0026625614,0.00008017849,0.00014463587,0.00029955216,0.80792105],"genre_scores_gemma":[0.71343017,0.047537472,0.020750983,0.0018656107,0.0039348733,0.000389723,0.0002884711,0.00016146062,0.21164127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990545,0.0005117722,0.000027409405,0.00008839624,0.00023833732,0.00007960022],"domain_scores_gemma":[0.998912,0.0007067616,0.00007458422,0.00012324637,0.00006733838,0.00011624903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009307146,0.00063653296,0.00037378707,0.0013496046,0.0016264159,0.004937779,0.00050127675,0.0018008933,0.01256554],"category_scores_gemma":[0.0020303715,0.00024292043,0.0003053606,0.00265041,0.0030369181,0.007899104,0.0030198263,0.0017171337,0.00201806],"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.000007331569,0.000020805102,0.00021313326,0.000105613115,0.000012200958,0.000059717862,0.0012809142,0.00045892605,0.00019176296,0.915265,0.018745484,0.06363911],"study_design_scores_gemma":[0.0000052877426,0.0000150630885,0.00038140538,0.00011774999,0.0000068646787,0.00017457292,0.0013053055,0.0013696532,0.00015719062,0.8241344,0.17232448,0.000008029434],"about_ca_topic_score_codex":0.0006544801,"about_ca_topic_score_gemma":0.0010204002,"teacher_disagreement_score":0.01256554,"about_ca_system_score_codex":0.0012096968,"about_ca_system_score_gemma":0.00082430575,"threshold_uncertainty_score":0.042035937},"labels":[],"label_agreement":null},{"id":"W2502336722","doi":"10.1007/978-3-642-39088-3","title":"Foundations of Health Information Engineering and Systems","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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 Victoria","funders":"","keywords":"Computer science; Information engineering; Systems engineering; Information system; Data science; Engineering; Electrical engineering","score_opus":0.0332477711323009,"score_gpt":0.3563111663247503,"score_spread":0.3230633951924494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502336722","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031747269,0.10990306,0.5346443,0.03936325,0.0037564237,0.00018285833,0.00070119026,0.00063577364,0.3076383],"genre_scores_gemma":[0.24829428,0.16300432,0.4329336,0.0075250724,0.012891493,0.0006408012,0.000985901,0.00023722721,0.13348734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986438,0.00045826857,0.000096737036,0.00015146028,0.0005605092,0.00008921502],"domain_scores_gemma":[0.99594766,0.0029497962,0.00014373656,0.000380834,0.00047100065,0.000107018444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020732798,0.0006367924,0.00074229285,0.001537401,0.0006794497,0.004177159,0.0010265342,0.0015363795,0.010056597],"category_scores_gemma":[0.006069951,0.0004640562,0.00062447565,0.001761926,0.0034525555,0.0031624294,0.001228704,0.0026456811,0.0030583777],"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.000005336878,0.000024452436,0.00017419171,0.00021665508,0.000015090348,0.000042975607,0.00017032979,0.0013145244,0.000120236924,0.9165072,0.022749774,0.058659274],"study_design_scores_gemma":[0.000006990727,0.000009493298,0.00018716161,0.00014013772,0.000009089238,0.00008257228,0.00006470433,0.0034720113,0.00010902442,0.8659364,0.12997428,0.00000812231],"about_ca_topic_score_codex":0.0027246522,"about_ca_topic_score_gemma":0.0015421567,"teacher_disagreement_score":0.010056597,"about_ca_system_score_codex":0.0018613666,"about_ca_system_score_gemma":0.002647666,"threshold_uncertainty_score":0.03364265},"labels":[],"label_agreement":null},{"id":"W2502363053","doi":"10.1007/978-3-319-39381-0_6","title":"Anonymous Authentication with a Bi-directional Identity Federation in the Cloud","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Computer science; Cloud computing; Anonymity; Password; Identity management; Authentication (law); Architecture; Scheme (mathematics); Computer security; Identity (music); Bandwidth (computing); Computer network; Operating system","score_opus":0.012845550512057984,"score_gpt":0.24066395312849534,"score_spread":0.22781840261643735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502363053","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0441636,0.00052073976,0.93256193,0.0010439914,0.00049305335,0.0002454165,0.00024370993,0.002100239,0.01862734],"genre_scores_gemma":[0.8091644,0.00038371573,0.17558315,0.00023047208,0.0001839805,0.00017381091,0.00033058983,0.00012496312,0.013824962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952803,0.0012061883,0.0003492451,0.0007320809,0.0013062988,0.0011257847],"domain_scores_gemma":[0.995523,0.00049123185,0.0002402641,0.002877084,0.00057276915,0.00029562178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037808388,0.00055404246,0.0013490937,0.0008685307,0.0038252377,0.0050746775,0.0022678324,0.0019375806,0.004015839],"category_scores_gemma":[0.0036969464,0.0005516741,0.0011126434,0.0017459083,0.0016958499,0.008590101,0.010053313,0.0027196617,0.0029872565],"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.0018241052,0.00044261065,0.0020292948,0.0001670497,0.00010292204,0.0007210607,0.0008005774,0.04366506,0.017886713,0.7691073,0.017385479,0.14586776],"study_design_scores_gemma":[0.00012525874,0.00018227646,0.0005979562,0.00006967438,0.00010893944,0.00087074173,0.0005653054,0.6027235,0.022024944,0.34043393,0.032180395,0.00011705009],"about_ca_topic_score_codex":0.0020841784,"about_ca_topic_score_gemma":0.0018949448,"teacher_disagreement_score":0.0050746775,"about_ca_system_score_codex":0.0014297448,"about_ca_system_score_gemma":0.0030258377,"threshold_uncertainty_score":0.019995213},"labels":[],"label_agreement":null},{"id":"W2502834706","doi":"10.1007/b105884","title":"System Analysis and Modeling","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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 Ottawa","funders":"","keywords":"Computer science","score_opus":0.012005952172478983,"score_gpt":0.23421505218448,"score_spread":0.222209100012001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502834706","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.001359919,0.010964653,0.8557911,0.0017322853,0.0008883356,0.00012766993,0.00047349304,0.0019024188,0.12676018],"genre_scores_gemma":[0.09730799,0.036991823,0.3926193,0.0015237326,0.0018579058,0.0007238488,0.0028930753,0.0015106915,0.46457157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994512,0.00010835352,0.000031567513,0.00010437342,0.00027838806,0.00002602633],"domain_scores_gemma":[0.9995147,0.00014936687,0.000017929333,0.00019329823,0.00011066846,0.0000141212395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067906553,0.0015175244,0.0013312737,0.0012589392,0.00048711986,0.002218616,0.00096802163,0.0007455852,0.022790749],"category_scores_gemma":[0.00139263,0.0006770329,0.0009428792,0.0014039181,0.0009995901,0.0023842088,0.0011617673,0.0017959527,0.01584061],"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.000023644248,0.000049714956,0.00023822678,0.0005265895,0.00006119203,0.000119409524,0.0002471605,0.01801937,0.0028873307,0.47715807,0.096394196,0.404275],"study_design_scores_gemma":[0.000011227705,0.000042816948,0.0003600702,0.0001885105,0.000053949345,0.00027525294,0.00006873325,0.046620153,0.0027226326,0.445822,0.50381374,0.000020930893],"about_ca_topic_score_codex":0.0012461375,"about_ca_topic_score_gemma":0.001200317,"teacher_disagreement_score":0.022790749,"about_ca_system_score_codex":0.0008254388,"about_ca_system_score_gemma":0.0010220999,"threshold_uncertainty_score":0.076242685},"labels":[],"label_agreement":null},{"id":"W25030497","doi":"10.1007/978-3-642-25873-2_29","title":"Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"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 en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Theoretical computer science; Algorithm; Computer network","score_opus":0.03403932489494358,"score_gpt":0.2595617817778395,"score_spread":0.22552245688289593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25030497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36270028,0.0005334324,0.58302647,0.00059808313,0.00028108462,0.00013950454,0.00020143128,0.0012603757,0.05125942],"genre_scores_gemma":[0.93219453,0.00030701,0.045133013,0.000074129326,0.00008583584,0.00010404637,0.00013939604,0.00026483135,0.021697288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991239,0.0002391663,0.00003981994,0.00022074256,0.00019127082,0.000185165],"domain_scores_gemma":[0.99659026,0.0018318195,0.00026053688,0.0006962043,0.00024611352,0.0003750169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081616663,0.0005718624,0.00090026605,0.0009214415,0.0018874661,0.0016552545,0.0021836378,0.0010549955,0.004908507],"category_scores_gemma":[0.0051547377,0.0005657306,0.00075122004,0.00088200613,0.0017048207,0.0036714904,0.0028502836,0.0015924611,0.0007541185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069782283,0.00010023212,0.0007167901,0.00019183176,0.000062635314,0.0005025328,0.0010245179,0.15002824,0.010176111,0.79736495,0.0039446587,0.03518964],"study_design_scores_gemma":[0.000098083125,0.00007253968,0.00027104048,0.000024285773,0.000044897763,0.00018097163,0.0003564117,0.44783822,0.0054131714,0.5394169,0.0062480215,0.000035533652],"about_ca_topic_score_codex":0.0021245263,"about_ca_topic_score_gemma":0.0023912997,"teacher_disagreement_score":0.004908507,"about_ca_system_score_codex":0.000812252,"about_ca_system_score_gemma":0.0006230931,"threshold_uncertainty_score":0.016420603},"labels":[],"label_agreement":null},{"id":"W2503250290","doi":"10.1007/978-3-662-50412-3","title":"Transactions on Computational Science XXVII","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science; Data science","score_opus":0.06437254535895869,"score_gpt":0.35041597296688076,"score_spread":0.28604342760792206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503250290","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058867848,0.07966502,0.23584174,0.028912816,0.06150686,0.00020775382,0.00375444,0.0022449894,0.5819796],"genre_scores_gemma":[0.04414839,0.052417938,0.060940005,0.0020966537,0.010502151,0.00031733673,0.004784436,0.0015475244,0.8232456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986085,0.00021658554,0.00009778227,0.00017858573,0.0008235644,0.00007509964],"domain_scores_gemma":[0.99791855,0.00062109414,0.00006177488,0.00064960343,0.00060401537,0.00014501637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013433556,0.0011679488,0.001744271,0.0014505541,0.0007256399,0.0038054031,0.0012521949,0.0012047705,0.12277355],"category_scores_gemma":[0.0051421546,0.0004383869,0.0006874773,0.003003753,0.0012441634,0.002409589,0.0024978076,0.0027637754,0.057545055],"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.00006731351,0.000052098163,0.00037619227,0.0005148892,0.000050414532,0.0000693676,0.00007223951,0.0031284294,0.0010835706,0.09811617,0.48785317,0.40861624],"study_design_scores_gemma":[0.000020162955,0.000022966222,0.00051961833,0.00021292658,0.000028324142,0.00015588372,0.00006859272,0.01031708,0.0008245698,0.119304895,0.868512,0.000012938017],"about_ca_topic_score_codex":0.001708854,"about_ca_topic_score_gemma":0.0019001467,"teacher_disagreement_score":0.12277355,"about_ca_system_score_codex":0.0015693763,"about_ca_system_score_gemma":0.0019467033,"threshold_uncertainty_score":0.41071844},"labels":[],"label_agreement":null},{"id":"W2503431160","doi":"10.1007/11751540","title":"Computational Science and Its Applications - ICCSA 2006","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":261,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Set (abstract data type); Volume (thermodynamics); Library science; Programming language","score_opus":0.04817489263326968,"score_gpt":0.3399309816177417,"score_spread":0.29175608898447203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503431160","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044224076,0.15630987,0.19582933,0.013778299,0.034321714,0.00037404758,0.0035571863,0.0055566677,0.5858504],"genre_scores_gemma":[0.025819177,0.1059763,0.07050078,0.0016865858,0.009528997,0.0003456151,0.005002415,0.0022211983,0.77891886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920124,0.00013653214,0.00004932639,0.000116873816,0.00044254557,0.000053554628],"domain_scores_gemma":[0.99773467,0.0006145064,0.000072766445,0.00046945343,0.00083303876,0.00027552506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015888603,0.001405385,0.002122868,0.0030901001,0.00090713426,0.00411815,0.0012688398,0.0010693118,0.05789042],"category_scores_gemma":[0.003307125,0.0009116677,0.0008183503,0.0061828266,0.0010667056,0.0029758643,0.002397212,0.0031740163,0.03094257],"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.000051683965,0.00007150046,0.0002544486,0.0004493707,0.000027621778,0.000031777436,0.000055071465,0.0029169894,0.0006024863,0.034475867,0.6600213,0.30104184],"study_design_scores_gemma":[0.000008846179,0.000039226714,0.0008567743,0.0003420131,0.000025876685,0.0002076346,0.00004205804,0.008564831,0.0007288365,0.03207602,0.9570884,0.000019539304],"about_ca_topic_score_codex":0.003343927,"about_ca_topic_score_gemma":0.0056259744,"teacher_disagreement_score":0.05789042,"about_ca_system_score_codex":0.0016676204,"about_ca_system_score_gemma":0.002231718,"threshold_uncertainty_score":0.1936627},"labels":[],"label_agreement":null},{"id":"W2503434581","doi":"10.1007/978-3-662-53132-7","title":"Developments in Language Theory","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Linguistic Variation and Morphology","field":"Social Sciences","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Library science; Programming language; Linguistics; Philosophy","score_opus":0.014022568862153048,"score_gpt":0.29846782678581285,"score_spread":0.2844452579236598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503434581","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003409667,0.06128312,0.06428064,0.014255908,0.004423683,0.000019515306,0.00019421852,0.00021494257,0.85191834],"genre_scores_gemma":[0.2534981,0.048067518,0.031063741,0.0044534686,0.010983516,0.00014748888,0.0005357123,0.000711401,0.65053904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994172,0.00026303623,0.000023468432,0.00010039632,0.00015307922,0.000042799944],"domain_scores_gemma":[0.9995272,0.00026395757,0.000017038163,0.000080122,0.00007936145,0.000032377124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079239224,0.0007590667,0.0007185014,0.0018566136,0.0016505609,0.0036991197,0.00089289324,0.0011474885,0.020111198],"category_scores_gemma":[0.0015717585,0.00034019107,0.00051915564,0.0017226525,0.0062753805,0.0057289316,0.0017854526,0.0030321002,0.0067081256],"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.00000228283,0.0000030079555,0.00001496388,0.000026224334,0.0000020772566,0.000008638578,0.00015650732,0.00009428573,0.000038805985,0.9768562,0.01147203,0.011324911],"study_design_scores_gemma":[0.0000018034935,0.0000027529752,0.000035075132,0.00003628153,0.0000020705652,0.000030971118,0.000067572735,0.0002611508,0.000040454095,0.85855347,0.14096585,0.0000025293432],"about_ca_topic_score_codex":0.0012827861,"about_ca_topic_score_gemma":0.0014876958,"teacher_disagreement_score":0.020111198,"about_ca_system_score_codex":0.002150585,"about_ca_system_score_gemma":0.0009789519,"threshold_uncertainty_score":0.06727868},"labels":[],"label_agreement":null},{"id":"W2503495475","doi":"10.1007/978-3-319-42007-3_73","title":"Challenging Established Move Ordering Strategies with Adaptive Data Structures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Pruning; Heuristic; Context (archaeology); Domain (mathematical analysis); Tree (set theory); Game tree; Monte Carlo tree search; Field (mathematics); Range (aeronautics); Artificial intelligence; Theoretical computer science; Sequential game; Game theory; Mathematical economics; Mathematics","score_opus":0.046593887625138435,"score_gpt":0.27767731494692743,"score_spread":0.231083427321789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503495475","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.08564052,0.00042787215,0.88181055,0.0016910152,0.00018811684,0.00019269402,0.0004419644,0.0011788287,0.028428504],"genre_scores_gemma":[0.6497253,0.00039341455,0.3172312,0.0003208764,0.00014463419,0.00034024048,0.00083573564,0.00063601066,0.03037251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976197,0.000818853,0.00018473643,0.00040384676,0.0006254895,0.00034733763],"domain_scores_gemma":[0.9834441,0.012446951,0.0005923461,0.0021401655,0.0007616716,0.0006146709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026617986,0.0010532762,0.0012657155,0.0007868741,0.0012016017,0.0034061668,0.0031859663,0.0023258287,0.012536199],"category_scores_gemma":[0.023377515,0.0006870299,0.00096874405,0.0014817648,0.0019569984,0.0064695245,0.004442513,0.004384505,0.0018268209],"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.0005716279,0.00028418333,0.00087919063,0.00029591395,0.00006944727,0.00018652811,0.0004900802,0.15004668,0.0020937377,0.71344256,0.013012525,0.11862751],"study_design_scores_gemma":[0.0000858716,0.00007916448,0.000065452834,0.000034988032,0.000021229105,0.000052575226,0.00012591254,0.40252787,0.0009289696,0.5928672,0.003191354,0.000019530069],"about_ca_topic_score_codex":0.0025877724,"about_ca_topic_score_gemma":0.003725191,"teacher_disagreement_score":0.012536199,"about_ca_system_score_codex":0.0013571836,"about_ca_system_score_gemma":0.002141182,"threshold_uncertainty_score":0.04193777},"labels":[],"label_agreement":null},{"id":"W2504287189","doi":"10.1007/978-3-030-83508-8","title":"Algorithms and Data Structures","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Computational Techniques in Science and Engineering","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Alberta; University of Waterloo","funders":"","keywords":"Computer science; Data structure; Data mining; Data science; Theoretical computer science; Programming language","score_opus":0.028020000204381904,"score_gpt":0.30623789873282975,"score_spread":0.27821789852844786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504287189","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003387999,0.037049033,0.62957406,0.004049567,0.003124213,0.00021135552,0.0019275299,0.005055523,0.31562066],"genre_scores_gemma":[0.056685045,0.04014666,0.43569165,0.0022598505,0.0038787972,0.00082693,0.0062500667,0.0042943694,0.44996667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861026,0.00020740261,0.000100705474,0.00030473855,0.00070268166,0.00007411894],"domain_scores_gemma":[0.99873596,0.00046057085,0.000042687767,0.0005319933,0.00018171262,0.00004700242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081035134,0.0018823015,0.002097124,0.0022073614,0.001396286,0.005740882,0.0019175985,0.0011953624,0.0501766],"category_scores_gemma":[0.0031094651,0.0011222219,0.0011415591,0.00710227,0.0023281965,0.007687618,0.00261793,0.0038214996,0.039471637],"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.00003193331,0.00004125492,0.00013802132,0.00044248358,0.00003276934,0.00003634011,0.00016608222,0.0021982184,0.0011598732,0.5025464,0.13370681,0.35949966],"study_design_scores_gemma":[0.000015087757,0.00002163979,0.00016843773,0.00012486492,0.000021687802,0.00021352063,0.000047988542,0.0055582784,0.0009880696,0.6081707,0.3846551,0.000014705535],"about_ca_topic_score_codex":0.0007618128,"about_ca_topic_score_gemma":0.0007315999,"teacher_disagreement_score":0.0501766,"about_ca_system_score_codex":0.0014656648,"about_ca_system_score_gemma":0.0013727719,"threshold_uncertainty_score":0.16785747},"labels":[],"label_agreement":null},{"id":"W2504529984","doi":"10.1007/978-3-319-41000-5_16","title":"A Discrete Monarch Butterfly Optimization for Chinese TSP Problem","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metaheuristic; Travelling salesman problem; Mathematical optimization; Swarm intelligence; Heuristic; Particle swarm optimization; Discretization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01733436334669416,"score_gpt":0.2874959649051844,"score_spread":0.2701616015584903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504529984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10206797,0.002611547,0.7828152,0.0020176112,0.00072494627,0.00020205023,0.00039467457,0.00024355043,0.108922504],"genre_scores_gemma":[0.71230406,0.0017200594,0.2329255,0.0004408522,0.000357763,0.00025645495,0.00044722148,0.00016761482,0.051380515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998473,0.000046751942,0.000004641743,0.000027391447,0.00004940538,0.00002440215],"domain_scores_gemma":[0.99986935,0.00006813048,0.000011012084,0.000014452889,0.000020987278,0.000016114278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031387637,0.0005400751,0.0006317836,0.0005128209,0.0005455038,0.0008706353,0.00096626574,0.0008777534,0.006217113],"category_scores_gemma":[0.0007784999,0.00024314149,0.00071124284,0.0011271337,0.0006967331,0.0006453841,0.00080111576,0.00105109,0.0003022651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116903706,0.00008178241,0.00036722378,0.00026099014,0.000049966322,0.00011338154,0.00008376719,0.7292717,0.0028931117,0.1843487,0.011691898,0.070720665],"study_design_scores_gemma":[0.00002022352,0.000050983846,0.00016966098,0.000012725508,0.000011421451,0.000033162945,0.000023897768,0.9658304,0.00030831966,0.028804976,0.0047270227,0.000007194617],"about_ca_topic_score_codex":0.0066545834,"about_ca_topic_score_gemma":0.007110301,"teacher_disagreement_score":0.0066545834,"about_ca_system_score_codex":0.0010770131,"about_ca_system_score_gemma":0.0010041187,"threshold_uncertainty_score":0.020798326},"labels":[],"label_agreement":null},{"id":"W2504733547","doi":"10.1007/978-3-319-41264-1_19","title":"The Use of Working Prototypes for Participatory Design with People with Disabilities","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Assistive Technology in Communication and Mobility","field":"Health Professions","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":"York University","funders":"","keywords":"Computer science; Participatory design; Software deployment; Vocabulary; Session (web analytics); Assistive technology; Inclusion (mineral); Process (computing); Human–computer interaction; Citizen journalism; Multimedia; Knowledge management; World Wide Web; Software engineering; Engineering; Psychology","score_opus":0.2507757271534536,"score_gpt":0.3924712293797869,"score_spread":0.14169550222633331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504733547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28453103,0.0024430794,0.60801154,0.002355049,0.0005223275,0.0038476882,0.00020786385,0.0012886231,0.09679286],"genre_scores_gemma":[0.6367463,0.0008855766,0.34170628,0.00022471379,0.00003448024,0.0045512905,0.00014972464,0.00036421328,0.015337492],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9657646,0.028964534,0.0007676697,0.0011904305,0.0026637868,0.0006489106],"domain_scores_gemma":[0.918876,0.0721414,0.0008609841,0.0050612353,0.0022620582,0.0007983244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027653283,0.0012394647,0.0007438485,0.0022062685,0.003667291,0.008310987,0.003923718,0.002701856,0.008738876],"category_scores_gemma":[0.053587124,0.0010871374,0.0009487031,0.0012613991,0.0068343724,0.006597705,0.009554737,0.0015312567,0.001164108],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043187838,0.0008485476,0.0030407312,0.0025564446,0.00007384053,0.0015346087,0.44273245,0.003361316,0.012010766,0.05060093,0.0056777843,0.47713062],"study_design_scores_gemma":[0.0010493853,0.0057641817,0.010986854,0.0077207303,0.00038034064,0.0074042333,0.36340728,0.029132951,0.037858676,0.18475972,0.35085154,0.0006841083],"about_ca_topic_score_codex":0.00094379904,"about_ca_topic_score_gemma":0.0014758081,"teacher_disagreement_score":0.027653283,"about_ca_system_score_codex":0.0013186585,"about_ca_system_score_gemma":0.0021920968,"threshold_uncertainty_score":0.14624625},"labels":[],"label_agreement":null},{"id":"W2505390411","doi":"10.1007/978-3-642-12200-2","title":"LATIN 2010: Theoretical Informatics","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Informatics; Artificial intelligence; Electrical engineering","score_opus":0.00900212692324291,"score_gpt":0.23800924670896806,"score_spread":0.22900711978572516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505390411","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016294867,0.047226828,0.0905168,0.013606805,0.007167759,0.000037015372,0.0008937796,0.0014607551,0.8374608],"genre_scores_gemma":[0.057699792,0.05600112,0.051464885,0.0052379384,0.017540697,0.000345298,0.0027484307,0.0027631482,0.8061988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937844,0.00018794343,0.000028811917,0.00014848802,0.00021878362,0.000037536454],"domain_scores_gemma":[0.9995103,0.00016926491,0.000029738821,0.000118990676,0.00010784867,0.00006388548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006658898,0.0011751284,0.0015517052,0.0022824167,0.001478513,0.005629902,0.0010856428,0.0009985414,0.063565515],"category_scores_gemma":[0.0017233791,0.00062712916,0.00084698695,0.0049317614,0.0019420221,0.0048440117,0.0019615132,0.004031367,0.030539837],"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.000012902607,0.000014702097,0.000071014096,0.00024668482,0.000012865105,0.000019195515,0.00012094234,0.000579969,0.00027855614,0.65142417,0.25412086,0.093098216],"study_design_scores_gemma":[0.000008156161,0.00000837438,0.00015762179,0.00012677182,0.000009173315,0.00008915055,0.000044047578,0.0010139338,0.00011515065,0.4237649,0.5746554,0.000007323962],"about_ca_topic_score_codex":0.0011292262,"about_ca_topic_score_gemma":0.0013045209,"teacher_disagreement_score":0.063565515,"about_ca_system_score_codex":0.0032429134,"about_ca_system_score_gemma":0.0016106716,"threshold_uncertainty_score":0.21264786},"labels":[],"label_agreement":null},{"id":"W2505462564","doi":"10.1007/978-3-319-41267-2_72","title":"Comparison of Two Methods to Control the Mouse Using a Keypad","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","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":"York University","funders":"","keywords":"Keypad; Computer science; Software; Human–computer interaction; Throughput; Pointing device; Control (management); Component (thermodynamics); Input device; Computer hardware; Artificial intelligence; Operating system; Wireless","score_opus":0.04873087243238862,"score_gpt":0.37025836938311696,"score_spread":0.32152749695072835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505462564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40877932,0.020704772,0.5455014,0.00037857456,0.0016287852,0.0015278499,0.0008753337,0.008235744,0.012368228],"genre_scores_gemma":[0.70469886,0.0054467367,0.26484054,0.00045658427,0.00027353206,0.0014825779,0.0011148124,0.00096961396,0.020716693],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985158,0.0003876383,0.00014557691,0.0002632902,0.0005762232,0.0001114711],"domain_scores_gemma":[0.994194,0.0038490377,0.00021097765,0.0004277518,0.0011373252,0.00018096853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013442124,0.0014330149,0.00093901966,0.0017680051,0.0003292588,0.001072245,0.0018853076,0.0012917719,0.010132817],"category_scores_gemma":[0.0063339737,0.00045768922,0.0005510308,0.0006891743,0.00034703052,0.0014068894,0.0008777969,0.0004955643,0.0016320025],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01667925,0.0017126163,0.0024035391,0.0028076926,0.0006056718,0.00013105181,0.00043122208,0.0020061848,0.14830045,0.0010743829,0.0033992366,0.82044876],"study_design_scores_gemma":[0.012821568,0.054890018,0.13291591,0.0011737825,0.006843934,0.004845503,0.0014149889,0.24423462,0.47957063,0.0035410111,0.056814052,0.0009339483],"about_ca_topic_score_codex":0.0024638928,"about_ca_topic_score_gemma":0.002013084,"teacher_disagreement_score":0.010132817,"about_ca_system_score_codex":0.0003597807,"about_ca_system_score_gemma":0.00052545633,"threshold_uncertainty_score":0.03389764},"labels":[],"label_agreement":null},{"id":"W2505598103","doi":"10.1007/978-3-319-40244-4_21","title":"Human Performance and Cognitive Workload in Multi-sensory Virtual Environments","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workload; Computer science; Haptic technology; Human–computer interaction; Cognition; Sensory system; Virtual reality; Virtual machine; Multimedia; Simulation; Cognitive psychology; Operating system; Psychology","score_opus":0.035817996286460534,"score_gpt":0.324259694743654,"score_spread":0.2884416984571935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505598103","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894973,0.0011477699,0.004400139,0.00006925653,0.000048603208,0.0000114278555,0.00019028198,0.00003762892,0.00459765],"genre_scores_gemma":[0.9981913,0.00033647066,0.00043456873,0.00001666812,0.00002769398,0.000014224567,0.00010694014,0.000011357298,0.0008607313],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968493,0.00010066101,0.000020069745,0.000055772267,0.00008530614,0.0000533626],"domain_scores_gemma":[0.9987717,0.00079448405,0.00012520068,0.000055100307,0.0000974573,0.00015591615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036192028,0.00040631177,0.00024409361,0.00028939004,0.00016493077,0.0010677237,0.00030436943,0.00036111794,0.0031128605],"category_scores_gemma":[0.003697642,0.00019235731,0.00015540693,0.00029745125,0.00023039883,0.00049811625,0.0006615934,0.00025356558,0.0004200447],"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.011962707,0.0022459705,0.24718389,0.0022113998,0.0013862457,0.0018474541,0.0076497006,0.040231757,0.2691052,0.0043189065,0.0061571915,0.40569958],"study_design_scores_gemma":[0.00006921523,0.0020171348,0.9508959,0.00015000318,0.00016517543,0.0012460815,0.0020600394,0.02476006,0.008632614,0.00765437,0.0022419726,0.00010749287],"about_ca_topic_score_codex":0.00060403056,"about_ca_topic_score_gemma":0.0005348886,"teacher_disagreement_score":0.0031128605,"about_ca_system_score_codex":0.000115564726,"about_ca_system_score_gemma":0.00009452794,"threshold_uncertainty_score":0.0104135275},"labels":[],"label_agreement":null},{"id":"W2505661264","doi":"10.1007/978-3-319-39399-5_42","title":"Wearable Technology in Hospitals: Overcoming Patient Concerns About Privacy","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Wearable computer; Internet privacy; Wearable technology; Computer science; Unified theory of acceptance and use of technology; Theory of planned behavior; Psychology; Social influence; Artificial intelligence; Control (management); Social psychology","score_opus":0.017500441786787634,"score_gpt":0.2812725233034879,"score_spread":0.2637720815167003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505661264","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.054986317,0.16735642,0.14882872,0.18800515,0.008160978,0.00015683973,0.0002869901,0.00089378306,0.43132478],"genre_scores_gemma":[0.5409891,0.15125436,0.059541605,0.032187972,0.004865357,0.00018854075,0.00033916824,0.0004457126,0.2101881],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.998307,0.0008854572,0.0000835164,0.000107736196,0.00047366845,0.00014259257],"domain_scores_gemma":[0.9979851,0.0013191516,0.0001818368,0.00020581615,0.00016027891,0.00014781817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022991486,0.00047036953,0.0003522344,0.0004978658,0.0010009082,0.005139609,0.0012548107,0.00341865,0.009418597],"category_scores_gemma":[0.0041627954,0.0002748836,0.00048130596,0.0011752935,0.0017664102,0.004974772,0.002579975,0.0028896483,0.0027228661],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014998627,0.00015824856,0.0023126835,0.0008148825,0.000035258574,0.0010557842,0.01307487,0.00060328253,0.0040056864,0.1456061,0.11680827,0.71537507],"study_design_scores_gemma":[0.000029657922,0.00026212557,0.0029746532,0.002341545,0.00006901201,0.006540768,0.011034846,0.0014239299,0.0073265424,0.07842834,0.8895152,0.000053232918],"about_ca_topic_score_codex":0.00036055344,"about_ca_topic_score_gemma":0.00065141066,"teacher_disagreement_score":0.009418597,"about_ca_system_score_codex":0.00056520564,"about_ca_system_score_gemma":0.0011477972,"threshold_uncertainty_score":0.031508386},"labels":[],"label_agreement":null},{"id":"W2505690073","doi":"10.1007/978-3-662-52993-5_27","title":"Key Recovery Attack Against 2.5-Round $$\\pi $$ -Cipher","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and 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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Cipher; Arithmetic; Block cipher; Slide attack; Key (lock); Computer security; Theoretical computer science; Algorithm; Stream cipher attack; Cryptography; Mathematics; Encryption","score_opus":0.0273721072192478,"score_gpt":0.27795033738151653,"score_spread":0.2505782301622687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505690073","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.48368427,0.0022340058,0.40110546,0.0037865476,0.00096810027,0.00048269643,0.0010606877,0.0054491768,0.10122901],"genre_scores_gemma":[0.94231236,0.00036640695,0.025847606,0.0003409902,0.00009638703,0.000108537686,0.0004780288,0.00024189422,0.030207751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989348,0.00018391802,0.00006288304,0.0001403649,0.0003410472,0.00033700417],"domain_scores_gemma":[0.9993787,0.00017322073,0.00007805348,0.00026309735,0.00006871792,0.000038255086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078579027,0.00076476665,0.00066166185,0.00058651937,0.0008760906,0.0010508097,0.0008451826,0.0012320171,0.00930093],"category_scores_gemma":[0.0013130653,0.00044352002,0.0008160445,0.0004618224,0.00081631285,0.002622828,0.002089502,0.0015961265,0.0035107178],"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.0048936266,0.00041351255,0.0025365874,0.00076621905,0.00034930307,0.0039234064,0.0010911917,0.036941025,0.23400418,0.4504175,0.046896912,0.21776646],"study_design_scores_gemma":[0.0006417809,0.0012281811,0.0036890313,0.00024586718,0.0003895476,0.006111489,0.0003214416,0.275732,0.44028208,0.20640947,0.06469606,0.00025300332],"about_ca_topic_score_codex":0.0002855751,"about_ca_topic_score_gemma":0.00042579163,"teacher_disagreement_score":0.00930093,"about_ca_system_score_codex":0.00065066863,"about_ca_system_score_gemma":0.0009414456,"threshold_uncertainty_score":0.031114697},"labels":[],"label_agreement":null},{"id":"W2506001467","doi":"10.1007/978-3-319-40397-7_43","title":"Improving Sense of Well-Being by Managing Memories of Experience","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Media Influence and Health","field":"Arts and Humanities","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":"Telus (Canada); University of Toronto","funders":"","keywords":"Payment; Computer science; Sequence (biology); Quality (philosophy); World Wide Web; Physics","score_opus":0.016428872855051374,"score_gpt":0.24083393735142317,"score_spread":0.2244050644963718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506001467","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83350414,0.009951022,0.019841919,0.00778938,0.00045668264,0.000115349576,0.00023457105,0.00023321752,0.12787382],"genre_scores_gemma":[0.9789964,0.0027038879,0.00894491,0.00047191355,0.00008139635,0.0000644121,0.00011288097,0.000032118805,0.00859225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969673,0.000109122506,0.000014461671,0.00003893507,0.000073282776,0.000067484085],"domain_scores_gemma":[0.9992073,0.000232267,0.00015128338,0.00007679869,0.00008072333,0.00025163798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019376,0.00026293882,0.00023402959,0.00026916075,0.0004419279,0.002126088,0.0005897687,0.0005602132,0.0052541937],"category_scores_gemma":[0.0023239716,0.00011997369,0.00037094686,0.00029000072,0.00052285637,0.0013412308,0.0013540838,0.0010364368,0.0006755444],"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.00045309684,0.0020277132,0.039796468,0.0008846921,0.00044632758,0.0002872688,0.017535541,0.0014382699,0.015480905,0.015545061,0.0170608,0.88904375],"study_design_scores_gemma":[0.0002389747,0.0051447637,0.54969484,0.0024128212,0.0014169407,0.0024746598,0.061275005,0.0072627664,0.019078925,0.11176248,0.23893565,0.0003021641],"about_ca_topic_score_codex":0.00053851504,"about_ca_topic_score_gemma":0.0014150888,"teacher_disagreement_score":0.0052541937,"about_ca_system_score_codex":0.00026952592,"about_ca_system_score_gemma":0.00041684485,"threshold_uncertainty_score":0.017576993},"labels":[],"label_agreement":null},{"id":"W2506098882","doi":"10.1007/978-3-319-39513-5_1","title":"Warmth and Affection: Exploring Thermal Sensation in the Design of Parent-Child Distant Interaction","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Affection; Metaphor; Meaning (existential); Human–computer interaction; Computer science; Wearable computer; Set (abstract data type); Creativity; Interaction design; Flexibility (engineering); Psychology; Social psychology; Linguistics; Psychotherapist","score_opus":0.05658432258106028,"score_gpt":0.2715943691052356,"score_spread":0.21501004652417532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506098882","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.44472936,0.003502416,0.4046611,0.0015069573,0.00019531303,0.00020408479,0.00010358268,0.00057986454,0.14451727],"genre_scores_gemma":[0.94039845,0.00067329605,0.045086864,0.00016061499,0.000012490939,0.00016672669,0.00003935108,0.000096322816,0.01336601],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99957174,0.0002564786,0.000009614504,0.00004365468,0.00008007012,0.00003841678],"domain_scores_gemma":[0.9994443,0.0004059265,0.000031362048,0.000032379194,0.000033998796,0.000052115356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005609259,0.00045940245,0.00018230229,0.00015751389,0.00044650026,0.001759988,0.0007836281,0.0005776098,0.0073364167],"category_scores_gemma":[0.0017021691,0.00023984506,0.00033755566,0.0001316191,0.0011779419,0.0014206215,0.0013244213,0.0008800061,0.00047288442],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010907804,0.00069709617,0.014537384,0.0030589125,0.00019736067,0.0030965388,0.17915583,0.017832663,0.17901173,0.21852466,0.0110055115,0.37179157],"study_design_scores_gemma":[0.0003612728,0.0042713275,0.09915586,0.002474334,0.0008063896,0.012174455,0.12036938,0.14024277,0.10349971,0.23621848,0.27996108,0.00046491914],"about_ca_topic_score_codex":0.00037895804,"about_ca_topic_score_gemma":0.00079651055,"teacher_disagreement_score":0.0073364167,"about_ca_system_score_codex":0.00045850585,"about_ca_system_score_gemma":0.0003863937,"threshold_uncertainty_score":0.024542749},"labels":[],"label_agreement":null},{"id":"W2507056416","doi":"10.1007/978-3-319-39516-6_24","title":"A Survey of Text Entry Techniques for Smartwatches","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Toronto Metropolitan University","funders":"","keywords":"Smartwatch; Keypad; Text entry; Computer science; Handwriting; Wearable computer; Display size; Human–computer interaction; Wearable technology; Table (database); Computer hardware; Artificial intelligence; Embedded system; Data mining; Display device; Operating system","score_opus":0.02302835041156438,"score_gpt":0.2728667555420201,"score_spread":0.24983840513045574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507056416","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029836,0.5421718,0.34574002,0.0010510944,0.0012212023,0.00090663205,0.0030713084,0.015991043,0.06001089],"genre_scores_gemma":[0.06436836,0.44015533,0.3149242,0.0013654594,0.0011888045,0.0008520309,0.008140066,0.0050862073,0.16391955],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988865,0.00014910496,0.0001230437,0.0002767871,0.00048328264,0.00008125296],"domain_scores_gemma":[0.9977787,0.0013378691,0.00011704996,0.00018975507,0.0005069182,0.000069683076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010170301,0.0014896195,0.0017930355,0.003691155,0.0006271205,0.0025576341,0.0026891758,0.0013244137,0.033067476],"category_scores_gemma":[0.0029014316,0.0009943737,0.00126869,0.0057053794,0.00037803632,0.004701774,0.0011532453,0.001080606,0.016546456],"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.00022179984,0.00010923364,0.00031856346,0.0054193395,0.000045939963,0.00007167339,0.00023138087,0.00027913958,0.011935163,0.0013666276,0.012146636,0.9678545],"study_design_scores_gemma":[0.000121552046,0.0013978478,0.0076096533,0.006004256,0.00038506126,0.0036462764,0.00085698365,0.007865283,0.06081435,0.004269781,0.90674114,0.00028779695],"about_ca_topic_score_codex":0.0007332322,"about_ca_topic_score_gemma":0.001354599,"teacher_disagreement_score":0.033067476,"about_ca_system_score_codex":0.00029690503,"about_ca_system_score_gemma":0.00047928144,"threshold_uncertainty_score":0.11062169},"labels":[],"label_agreement":null},{"id":"W2507083462","doi":"10.1007/978-3-319-40093-8_18","title":"SYSTEMATEKS: Scalable Interactive Modular Simulation (SIMS): Towards Sustainable Design","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"George Brown College","funders":"","keywords":"Computer science; Modular design; Context (archaeology); Sustainable design; Sustainability; Process (computing); Scalability; Engineering design process; Human–computer interaction; Interface (matter); Design process; Systems engineering; Work in process; Engineering; Database; Mechanical engineering","score_opus":0.02135662372128348,"score_gpt":0.2750355936418867,"score_spread":0.2536789699206032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507083462","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.008276727,0.00083958165,0.9186424,0.0006479323,0.00033803904,0.00009043655,0.0006201595,0.019665916,0.050878827],"genre_scores_gemma":[0.19943106,0.0027698127,0.73166424,0.00035016568,0.00019743292,0.0005566945,0.0034367808,0.009551649,0.052042138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996625,0.00008247958,0.000014642822,0.00004343675,0.00016870887,0.0000282089],"domain_scores_gemma":[0.9996321,0.00015284169,0.000014091013,0.00009259626,0.000066982306,0.000041400708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007526998,0.001017503,0.00055764936,0.00048674812,0.00041893285,0.0013888745,0.0017076032,0.00090901053,0.023416705],"category_scores_gemma":[0.0012892552,0.000662538,0.00084659114,0.0006012027,0.00069804746,0.0016222526,0.0021028155,0.0015160664,0.0052317493],"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.000225142,0.00013406291,0.0010237421,0.00065761,0.00013762417,0.00012410824,0.00052746426,0.3197177,0.023553228,0.20360042,0.08298998,0.36730897],"study_design_scores_gemma":[0.0000788582,0.000083092586,0.00037443568,0.00011900217,0.000035610778,0.00014550309,0.000043980068,0.5914104,0.012786117,0.0975231,0.29735819,0.00004173801],"about_ca_topic_score_codex":0.0014606655,"about_ca_topic_score_gemma":0.0018333355,"teacher_disagreement_score":0.023416705,"about_ca_system_score_codex":0.0005521331,"about_ca_system_score_gemma":0.0008900651,"threshold_uncertainty_score":0.078336656},"labels":[],"label_agreement":null},{"id":"W2507101918","doi":"10.1007/978-3-319-40349-6_11","title":"Externalization of Data Analytics Models:","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Computer science; Externalization; Analytics; Data analysis; Data science; Data mining","score_opus":0.14406074230628488,"score_gpt":0.30299874204503585,"score_spread":0.15893799973875097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507101918","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.008539243,0.0007354804,0.9740356,0.0014195485,0.0001682273,0.00012040195,0.0005127383,0.0047264392,0.009742232],"genre_scores_gemma":[0.39269665,0.0027489767,0.57443786,0.001110184,0.0005947688,0.00043284957,0.0077640014,0.0043558623,0.015858814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527705,0.0019523005,0.00041704343,0.00076097227,0.0013733648,0.00021933303],"domain_scores_gemma":[0.9900457,0.0032031897,0.0005457832,0.0046444256,0.0013458257,0.00021505464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007621859,0.0011592115,0.0010648394,0.0014637754,0.00056334934,0.006510324,0.0020315293,0.0009016276,0.007682913],"category_scores_gemma":[0.020952554,0.00075513177,0.0020787646,0.002402645,0.0016082695,0.0097358795,0.006019914,0.0030960052,0.0021948153],"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.00024451854,0.0002713417,0.0045941,0.00047965482,0.00018526815,0.00018617908,0.000631347,0.05766215,0.002234131,0.57152647,0.024629245,0.33735555],"study_design_scores_gemma":[0.000030335945,0.000034079723,0.0005618574,0.00023369481,0.00007394712,0.00011093137,0.00015006852,0.50026596,0.004995479,0.45068508,0.042834606,0.000023956458],"about_ca_topic_score_codex":0.0015768169,"about_ca_topic_score_gemma":0.0011269577,"teacher_disagreement_score":0.007682913,"about_ca_system_score_codex":0.0013488657,"about_ca_system_score_gemma":0.0018304661,"threshold_uncertainty_score":0.040308714},"labels":[],"label_agreement":null},{"id":"W2507455848","doi":"10.1007/978-3-319-44953-1_6","title":"Multiobjective Optimization by Decision Diagrams","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto; The Scarborough Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Influence diagram; Computer science; Mathematical optimization; Multi-objective optimization; Set (abstract data type); Optimization problem; Diagram; State space; State (computer science); Algorithm; Decision tree; Mathematics; Artificial intelligence","score_opus":0.01541185246162005,"score_gpt":0.27135947443988234,"score_spread":0.2559476219782623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507455848","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.0035055452,0.0007219418,0.9845109,0.00015348222,0.000062586114,0.000041766827,0.00007802781,0.00009773263,0.010828001],"genre_scores_gemma":[0.27563393,0.0023102271,0.70441335,0.0001053383,0.00008062316,0.00043566435,0.00028076276,0.00021330491,0.016526727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987047,0.0007091259,0.000058294485,0.00014874579,0.0003118903,0.000067161585],"domain_scores_gemma":[0.9988343,0.00091748254,0.000071428265,0.000054742555,0.000084156636,0.000037879698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017817765,0.0011095004,0.0009593908,0.0009097137,0.00035216875,0.0016529661,0.0007620756,0.00073834276,0.00794293],"category_scores_gemma":[0.0030964026,0.00065438374,0.0011585811,0.0011775644,0.00080499635,0.001447025,0.0012036334,0.001380684,0.0010343101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007683378,0.00004622131,0.00018514247,0.00033144967,0.00006519542,0.000057492853,0.00007157708,0.6071067,0.0023736916,0.2638706,0.0023879956,0.12342712],"study_design_scores_gemma":[0.000027707092,0.00005899605,0.00008841655,0.00011018761,0.000024966947,0.000039945233,0.00002196266,0.66767514,0.0015455639,0.31483847,0.015548552,0.000020130961],"about_ca_topic_score_codex":0.0009014644,"about_ca_topic_score_gemma":0.0009709723,"teacher_disagreement_score":0.00794293,"about_ca_system_score_codex":0.0011680351,"about_ca_system_score_gemma":0.0007845213,"threshold_uncertainty_score":0.02657181},"labels":[],"label_agreement":null},{"id":"W2507635762","doi":"10.1007/978-3-319-46131-1_8","title":"The SPMF Open-Source Data Mining Library Version 2","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":551,"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 Moncton","funders":"","keywords":"Computer science; Implementation; Authorship attribution; Data mining; Plug-in; Open source; Visualization; Information retrieval; Interface (matter); Software; Software engineering; Artificial intelligence; Programming language; Operating system","score_opus":0.032013028241635884,"score_gpt":0.2657663356650473,"score_spread":0.23375330742341144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507635762","genre_codex":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026052233,0.0020889603,0.24442281,0.0008653002,0.00057478354,0.0005880137,0.37257582,0.34792286,0.02835625],"genre_scores_gemma":[0.009871546,0.0019694902,0.30458152,0.0008224488,0.0003022922,0.0013752112,0.58447593,0.058209617,0.03839192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998166,0.0001286488,0.00023546607,0.00041076154,0.00091763795,0.00014141167],"domain_scores_gemma":[0.99666107,0.001063037,0.00022366307,0.00095383124,0.00094029267,0.00015809936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019402707,0.0022440858,0.001624025,0.008104548,0.000984663,0.0036638982,0.0031427299,0.0010219407,0.09998918],"category_scores_gemma":[0.011069827,0.0016640313,0.0022135412,0.007032293,0.00040691567,0.004346961,0.0031157162,0.001905128,0.16021213],"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.00014918897,0.00006270984,0.001431012,0.00091427943,0.00009253359,0.000094082796,0.000088789806,0.00084491086,0.0024951675,0.0024716675,0.7680002,0.22335552],"study_design_scores_gemma":[0.000107543674,0.000048338938,0.0032908507,0.00033569237,0.00007862146,0.0007284876,0.0000574234,0.007047871,0.010548549,0.017080013,0.96057224,0.00010445293],"about_ca_topic_score_codex":0.0027115482,"about_ca_topic_score_gemma":0.0034625763,"teacher_disagreement_score":0.09998918,"about_ca_system_score_codex":0.00068314746,"about_ca_system_score_gemma":0.0028282944,"threshold_uncertainty_score":0.3344971},"labels":[],"label_agreement":null},{"id":"W2507669734","doi":"10.1007/978-3-319-45823-6_88","title":"evoVision3D: A Multiscale Visualization of Evolutionary Histories","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Visualization; Theoretical computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.01712727842739933,"score_gpt":0.28041394531504127,"score_spread":0.26328666688764196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507669734","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04850472,0.0017226412,0.8551585,0.0013708237,0.00037994896,0.0001592225,0.017250251,0.050487116,0.024966782],"genre_scores_gemma":[0.3560629,0.0028073736,0.59935665,0.0005088194,0.00024285703,0.00044879332,0.012635169,0.016563224,0.011374228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988115,0.00002016542,0.000007959769,0.00002117308,0.000051779134,0.00001773513],"domain_scores_gemma":[0.99962306,0.00021562778,0.000030234873,0.000040441486,0.000049308735,0.000041241994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033762984,0.00086274755,0.00053094304,0.0020543144,0.0004347892,0.0023398285,0.001074959,0.0009335517,0.027121268],"category_scores_gemma":[0.0016527892,0.000534609,0.0007582711,0.0015503273,0.00031036217,0.0013820075,0.0016302997,0.0012833764,0.002661405],"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.0004370987,0.00021866517,0.0070748935,0.00271034,0.00044739764,0.00147632,0.0040422496,0.15972297,0.054694574,0.102223046,0.21556024,0.45139223],"study_design_scores_gemma":[0.00018659714,0.000057451492,0.0045324992,0.00040347053,0.00011940063,0.0009695412,0.00062172476,0.63000727,0.017507728,0.09864338,0.24674624,0.00020463433],"about_ca_topic_score_codex":0.0031106775,"about_ca_topic_score_gemma":0.00533555,"teacher_disagreement_score":0.027121268,"about_ca_system_score_codex":0.00029098112,"about_ca_system_score_gemma":0.00066941074,"threshold_uncertainty_score":0.09072971},"labels":[],"label_agreement":null},{"id":"W2508587411","doi":"10.1007/978-3-319-44427-7_1","title":"A Bearing-Only Pattern Formation Algorithm for Swarm Robotics","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Robustness (evolution); Swarm behaviour; Computer science; Scalability; Swarm robotics; Robot; Algorithm; Swarm intelligence; Artificial intelligence; Flexibility (engineering); Robotics; Particle swarm optimization; Mathematics","score_opus":0.01863424604416141,"score_gpt":0.24186491322621206,"score_spread":0.22323066718205065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508587411","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.0061921515,0.0000787887,0.99154353,0.000047727914,0.00006072847,0.000024993178,0.000014024127,0.0003700785,0.0016678653],"genre_scores_gemma":[0.21225943,0.00014996534,0.78125036,0.00008616961,0.000049355418,0.00015734065,0.000109141234,0.00013583637,0.005802421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998714,0.000017760414,0.000007671189,0.000027119751,0.00006401287,0.000012052544],"domain_scores_gemma":[0.9998242,0.00004932943,0.000016977558,0.000037915033,0.000056815737,0.000014815238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002618688,0.00040580987,0.0005930674,0.00025144653,0.00030683167,0.0003502223,0.0009680336,0.0006358733,0.0020457425],"category_scores_gemma":[0.0007175233,0.00027394047,0.00034139203,0.00040784208,0.00030283132,0.00068583805,0.0009862441,0.00066701625,0.0006001553],"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.00012962235,0.000080691236,0.00039428344,0.00007901967,0.00004136899,0.000049017613,0.00008526978,0.33748466,0.026322333,0.0127418665,0.0035670516,0.6190248],"study_design_scores_gemma":[0.000023845645,0.00006690292,0.00011314978,0.0000039864285,0.0000058289547,0.000038047496,0.0000055505184,0.99229044,0.0023689228,0.0033112369,0.0017669084,0.000005143956],"about_ca_topic_score_codex":0.0016135942,"about_ca_topic_score_gemma":0.0017025336,"teacher_disagreement_score":0.0020457425,"about_ca_system_score_codex":0.00023107334,"about_ca_system_score_gemma":0.00045853073,"threshold_uncertainty_score":0.0068437457},"labels":[],"label_agreement":null},{"id":"W2508771649","doi":"10.1007/978-3-319-49175-2_13","title":"Almost Perfect Privacy for Additive Gaussian Privacy Filters","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","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":"Queen's University","funders":"","keywords":"Mutual information; Random variable; Gaussian; Mathematics; Information theory; Distribution (mathematics); Private information retrieval; Interpretation (philosophy); Variable (mathematics); Combinatorics; Discrete mathematics; Computer science; Statistics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.019534786693188252,"score_gpt":0.27954265046021504,"score_spread":0.2600078637670268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508771649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04024794,0.0007889268,0.94079775,0.0023464647,0.0001433991,0.00004827677,0.00048680307,0.00042022395,0.014720214],"genre_scores_gemma":[0.92422,0.0012117337,0.059666485,0.0013640176,0.0005279646,0.00015601797,0.00046906897,0.00014771638,0.012237083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907122,0.0026231636,0.00039243366,0.0015882686,0.00299719,0.001686672],"domain_scores_gemma":[0.9799447,0.013511452,0.001158962,0.003469505,0.0013000573,0.00061525544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052895043,0.0016353038,0.0020299929,0.0012043363,0.0012089607,0.0051605753,0.0021161141,0.0030849795,0.004617532],"category_scores_gemma":[0.025751233,0.0012621862,0.0014824232,0.0018796963,0.00428521,0.0068740346,0.0057744565,0.005018373,0.0011076434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047963395,0.000090307585,0.0006713315,0.00018914802,0.0001297507,0.00023514836,0.0002388318,0.101283796,0.0039396803,0.8626981,0.0035210662,0.026523123],"study_design_scores_gemma":[0.000048568585,0.00006466483,0.0002737323,0.000043973825,0.000043863583,0.00018420049,0.00004456564,0.23330495,0.00216573,0.76226735,0.0015237015,0.000034656092],"about_ca_topic_score_codex":0.0011692669,"about_ca_topic_score_gemma":0.0010192672,"teacher_disagreement_score":0.0052895043,"about_ca_system_score_codex":0.0026589711,"about_ca_system_score_gemma":0.0027699354,"threshold_uncertainty_score":0.02797395},"labels":[],"label_agreement":null},{"id":"W2508791134","doi":"10.1007/978-3-662-53416-8","title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVII","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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":"Ontario Tech University","funders":"","keywords":"Computer science; Scale (ratio); Big data; Data science; Data mining; Cartography","score_opus":0.015252014779829664,"score_gpt":0.23854331645186894,"score_spread":0.22329130167203928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508791134","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012473935,0.03378588,0.8236918,0.015658896,0.012414366,0.00024729504,0.0016695719,0.0019648664,0.09809346],"genre_scores_gemma":[0.3331201,0.04728138,0.38553193,0.0033589397,0.0071624625,0.0004066236,0.008408354,0.0012945661,0.21343559],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977597,0.00044469224,0.0002522179,0.0003010916,0.0010820114,0.00016018236],"domain_scores_gemma":[0.9958556,0.001538573,0.00013196828,0.001409654,0.00079658744,0.00026752354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024222247,0.0012224307,0.002046944,0.0006950178,0.0006671329,0.005565661,0.0018616874,0.0015721142,0.04534963],"category_scores_gemma":[0.0066087027,0.0005377162,0.0009415892,0.0021787353,0.0014869438,0.004377872,0.003416443,0.0027012469,0.012388714],"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.00028303897,0.0002609659,0.0018330241,0.00084968517,0.0002781204,0.0005037959,0.0003896005,0.020766445,0.0048282286,0.19332416,0.23439847,0.54228455],"study_design_scores_gemma":[0.0000639247,0.00014439863,0.0014956965,0.00024142655,0.00013363492,0.0006659078,0.0004065676,0.1759169,0.0033627024,0.3695834,0.44793534,0.000050152972],"about_ca_topic_score_codex":0.0019930871,"about_ca_topic_score_gemma":0.0019023437,"teacher_disagreement_score":0.04534963,"about_ca_system_score_codex":0.0009354803,"about_ca_system_score_gemma":0.0015598855,"threshold_uncertainty_score":0.15170962},"labels":[],"label_agreement":null},{"id":"W2508926447","doi":"10.1007/978-3-319-45871-7_1","title":"Truncated and Multiple Differential Cryptanalysis of Reduced Round Midori128","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Linear cryptanalysis; Computer science; Algorithm; Impossible differential cryptanalysis; Cryptanalysis; Encryption; Plaintext; Differential (mechanical device); Higher-order differential cryptanalysis; Differential cryptanalysis; Binary number; Arithmetic; Theoretical computer science; Mathematics; Cryptography; Computer security","score_opus":0.017909518006136136,"score_gpt":0.25688714231808724,"score_spread":0.2389776243119511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508926447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3647576,0.0025797614,0.57056904,0.0015282284,0.00053614995,0.00020467087,0.00037679303,0.0014802135,0.05796742],"genre_scores_gemma":[0.83466005,0.0005943808,0.1266468,0.00020724094,0.00015565107,0.00007334151,0.00029660002,0.00019278277,0.037173234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989754,0.00019645426,0.000056674737,0.00013383532,0.00050566276,0.00013195418],"domain_scores_gemma":[0.9994,0.00019254348,0.0000535755,0.00024054076,0.00008532608,0.000027962686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325455,0.0005749045,0.00067048246,0.00072527945,0.00048309992,0.0012684502,0.00091261766,0.0007547408,0.0076112165],"category_scores_gemma":[0.0021508418,0.0003316705,0.0007215611,0.00066588796,0.0008292924,0.0017904702,0.0015978554,0.0014498844,0.001873273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001841176,0.00015085918,0.0016444759,0.00040379018,0.00015674849,0.0011149887,0.0005343765,0.023998227,0.14134806,0.47482544,0.0072315726,0.34675032],"study_design_scores_gemma":[0.00018389188,0.0008673069,0.0029988135,0.00019468705,0.00015406545,0.005266205,0.00021596091,0.2474853,0.26363334,0.42510858,0.05373336,0.00015860923],"about_ca_topic_score_codex":0.00014452201,"about_ca_topic_score_gemma":0.00026668477,"teacher_disagreement_score":0.0076112165,"about_ca_system_score_codex":0.0007728843,"about_ca_system_score_gemma":0.00063882483,"threshold_uncertainty_score":0.025462031},"labels":[],"label_agreement":null},{"id":"W2509164844","doi":"10.1007/978-3-319-44778-0_33","title":"How Is Scene Recognition in a Convolutional Network Related to that in the Human Visual System?","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face Recognition and Perception","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Pattern recognition (psychology); Simple (philosophy); Computer vision","score_opus":0.05577606801403833,"score_gpt":0.2868496504925311,"score_spread":0.23107358247849275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509164844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.318486,0.014438338,0.53022015,0.017322827,0.0014861167,0.00016174508,0.0017593324,0.0019044691,0.11422101],"genre_scores_gemma":[0.9226802,0.0064836363,0.05139083,0.001496618,0.00035213536,0.000052479452,0.0009822594,0.0002092121,0.016352687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.00006672723,0.000015679598,0.00017909455,0.00007063977,0.00008608594],"domain_scores_gemma":[0.9993642,0.00016867749,0.00013224165,0.0001646113,0.00010501018,0.00006536573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053865084,0.00047244737,0.0005261701,0.0005674457,0.0003786458,0.0031995317,0.0012264362,0.0013944873,0.003927587],"category_scores_gemma":[0.002929072,0.00046452577,0.0010611735,0.0009950005,0.0019354342,0.005984524,0.0008300371,0.0015011672,0.0011493444],"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.00039946544,0.00027286753,0.01951543,0.00096616213,0.00069440523,0.0004060495,0.0011504955,0.040807985,0.055434946,0.53638816,0.012499327,0.33146483],"study_design_scores_gemma":[0.000032633907,0.00020757732,0.040820003,0.00022367024,0.00020471062,0.0007164188,0.00064224144,0.12485728,0.03125822,0.7768985,0.023977099,0.00016159512],"about_ca_topic_score_codex":0.008955297,"about_ca_topic_score_gemma":0.003324903,"teacher_disagreement_score":0.008955297,"about_ca_system_score_codex":0.00090457086,"about_ca_system_score_gemma":0.0008486086,"threshold_uncertainty_score":0.017806351},"labels":[],"label_agreement":null},{"id":"W2509280136","doi":"10.1007/978-3-319-49175-2_4","title":"Efficient Simulation for Quantum Message Authentication","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":28,"is_retracted":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":"Message authentication code; Decoding methods; Adversary; Authentication (law); Encoding (memory); Context (archaeology); Quantum","score_opus":0.016824275820485124,"score_gpt":0.26156130746340134,"score_spread":0.24473703164291621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509280136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044779845,0.00035024039,0.91716146,0.0009186691,0.000215772,0.00020937486,0.00020586321,0.0011452404,0.03501362],"genre_scores_gemma":[0.84667647,0.0003540943,0.13244878,0.00024762828,0.00010872533,0.00043516402,0.00036332934,0.00032788937,0.019037943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855953,0.00063388667,0.00005377318,0.00012626646,0.00043570212,0.00019088115],"domain_scores_gemma":[0.9979894,0.0012436557,0.00006238203,0.00049579225,0.00013710251,0.000071765746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010782331,0.00071028917,0.0013149844,0.00046712445,0.00088584714,0.0015052396,0.001558927,0.001624619,0.011944795],"category_scores_gemma":[0.0041422998,0.0004985207,0.0007824905,0.0006247614,0.0018692431,0.0024551374,0.0028583235,0.0020515653,0.0020344094],"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.00026307514,0.00012299867,0.00021264976,0.000112606074,0.00003316908,0.00006997166,0.000121296194,0.18977208,0.0052736024,0.77423674,0.0029659602,0.026815886],"study_design_scores_gemma":[0.000040635612,0.00002859945,0.000032744123,0.0000150333,0.000006633,0.000023660987,0.000013340758,0.6387055,0.0027109417,0.35608676,0.0023239674,0.000012224644],"about_ca_topic_score_codex":0.0005313752,"about_ca_topic_score_gemma":0.00061798585,"teacher_disagreement_score":0.011944795,"about_ca_system_score_codex":0.0010344224,"about_ca_system_score_gemma":0.0011976702,"threshold_uncertainty_score":0.03995931},"labels":[],"label_agreement":null},{"id":"W2509288627","doi":"10.1007/978-3-319-72308-2_8","title":"Adaptive Restart and CEGAR-Based Solver for Inverting Cryptographic Hash Functions","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and 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 Waterloo","funders":"","keywords":"Hash function; Computer science; Cryptographic hash function; Boolean satisfiability problem; Theoretical computer science; Cryptanalysis; Algorithm; Cryptography; Computer security","score_opus":0.04482897644388892,"score_gpt":0.30546261371156336,"score_spread":0.2606336372676744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509288627","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.02519239,0.00034317948,0.96136683,0.00042765195,0.00024310782,0.00017026522,0.00023007463,0.003771425,0.008255039],"genre_scores_gemma":[0.5010725,0.00026124416,0.4802941,0.00072031736,0.00023595423,0.00045818,0.0009126595,0.0012382481,0.014806823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969831,0.0008498197,0.0002107636,0.0004705057,0.0010185138,0.00046733062],"domain_scores_gemma":[0.99630225,0.0014970243,0.00017102824,0.0012670927,0.0006266659,0.0001359252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017833529,0.0013410745,0.0015415899,0.00093167496,0.0009471799,0.0025603531,0.0027361275,0.0018417194,0.014266529],"category_scores_gemma":[0.0100145815,0.0005631888,0.0011792869,0.0010293036,0.0017080236,0.0032636856,0.004370554,0.0033510604,0.0042479523],"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.0034255397,0.00052802346,0.002625302,0.00063838565,0.00024542614,0.0006469627,0.0005971992,0.110805035,0.04577288,0.39732385,0.023212103,0.41417924],"study_design_scores_gemma":[0.0002858547,0.00023632648,0.00021303866,0.000061634455,0.000070933645,0.00028999872,0.00011532086,0.7754012,0.03250525,0.18357989,0.00716955,0.00007106907],"about_ca_topic_score_codex":0.0009843722,"about_ca_topic_score_gemma":0.0021623168,"teacher_disagreement_score":0.014266529,"about_ca_system_score_codex":0.00092423713,"about_ca_system_score_gemma":0.0023002885,"threshold_uncertainty_score":0.047726274},"labels":[],"label_agreement":null},{"id":"W2509335285","doi":"10.1007/978-3-662-53426-7_32","title":"Upper Bounds for Boundless Tagging with Bounded Objects","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Calgary","funders":"","keywords":"Bounded function; Computer science; Mathematics; Mathematical analysis","score_opus":0.012222769239287636,"score_gpt":0.23689799484546392,"score_spread":0.22467522560617628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509335285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010866385,0.0030564743,0.9344525,0.0026002137,0.0007836447,0.00018698859,0.000959192,0.003302664,0.04379188],"genre_scores_gemma":[0.41622213,0.0069779945,0.49558613,0.004309473,0.004429544,0.001513753,0.00562373,0.008186273,0.0571509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96556526,0.005459818,0.0022855862,0.0058126994,0.013717925,0.007158643],"domain_scores_gemma":[0.84030175,0.102278255,0.004867464,0.035410196,0.0113742035,0.0057681203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01649953,0.0060841595,0.006173674,0.008516897,0.006705185,0.0188352,0.01932932,0.007976792,0.029451557],"category_scores_gemma":[0.099195614,0.004737974,0.0055025327,0.009772763,0.010618868,0.05292545,0.023797764,0.01863228,0.013427453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075566926,0.00029846682,0.0009794189,0.00069807447,0.00011765503,0.00022805062,0.00062429975,0.042389747,0.0037771591,0.8602591,0.018784722,0.07108758],"study_design_scores_gemma":[0.000026596334,0.000056122863,0.00016289014,0.00017473444,0.00011778367,0.00017767967,0.00007383004,0.08421112,0.0026477275,0.9051318,0.007152444,0.00006722237],"about_ca_topic_score_codex":0.0025814665,"about_ca_topic_score_gemma":0.0028420219,"teacher_disagreement_score":0.029451557,"about_ca_system_score_codex":0.008200109,"about_ca_system_score_gemma":0.0059262044,"threshold_uncertainty_score":0.098525226},"labels":[],"label_agreement":null},{"id":"W250939016","doi":"10.1007/978-3-540-70918-3_43","title":"Languages with Bounded Multiparty Communication Complexity","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université Laval; McGill University","funders":"","keywords":"Bounded function; Computer science; Theoretical computer science; Communication complexity; Mathematics","score_opus":0.017780105756289227,"score_gpt":0.279311783082664,"score_spread":0.2615316773263748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W250939016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548906,0.0010613526,0.7249468,0.011445448,0.00049884955,0.0003325535,0.0014406283,0.0022013222,0.09258396],"genre_scores_gemma":[0.91834927,0.0004277727,0.050915368,0.0011600277,0.0005747323,0.0006674088,0.0007817943,0.0007065867,0.026417103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99098396,0.0027062886,0.000728708,0.0018009486,0.002456933,0.0013231375],"domain_scores_gemma":[0.93907243,0.04609609,0.0023608825,0.007306047,0.0028030695,0.002361592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003795146,0.00091591605,0.0025527913,0.0014969299,0.004477113,0.010769241,0.0030333155,0.004480187,0.013514059],"category_scores_gemma":[0.02603142,0.0019445051,0.0028225472,0.0023003586,0.005382336,0.019216375,0.008183187,0.009074702,0.0024737702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000457572,0.000026220026,0.00010903788,0.00005086245,0.000013084277,0.00011958612,0.0002776793,0.0033132802,0.00042796243,0.99232715,0.0011820219,0.0021073134],"study_design_scores_gemma":[0.000017402212,0.0000060731377,0.000040674488,0.000008058769,0.0000092504015,0.00007771977,0.000031876974,0.014115063,0.00037531627,0.9842164,0.0010884799,0.000013746892],"about_ca_topic_score_codex":0.00089391647,"about_ca_topic_score_gemma":0.0008599656,"teacher_disagreement_score":0.013514059,"about_ca_system_score_codex":0.004035141,"about_ca_system_score_gemma":0.002629072,"threshold_uncertainty_score":0.04520905},"labels":[],"label_agreement":null},{"id":"W2509984179","doi":"10.1007/978-3-319-44896-1_23","title":"Service Network Design of Bike Sharing Systems with Resource Constraints","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","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":"Université de Montréal; Université du Québec à Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; TRIPS architecture; Bike sharing; Service (business); Operations research; Shared resource; Redistribution (election); Service level; Network planning and design; Heuristic; Transport engineering; Simulation; Computer network","score_opus":0.020031583761178758,"score_gpt":0.20935597776489678,"score_spread":0.18932439400371803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509984179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047740974,0.00076968427,0.92793024,0.00060308387,0.00015516477,0.00021626026,0.00026187414,0.00023574685,0.022087047],"genre_scores_gemma":[0.8994196,0.0011053162,0.07991928,0.00021725916,0.00012547283,0.00036300742,0.00030283927,0.00022856588,0.018318634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991373,0.00025848852,0.000033120305,0.00014325742,0.00020363528,0.00022414328],"domain_scores_gemma":[0.9991167,0.00045173874,0.000056420104,0.000043575757,0.0002539371,0.0000776208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010846944,0.0010755878,0.0013529023,0.0006945268,0.0011864546,0.0024412328,0.0018684265,0.0012633409,0.008554398],"category_scores_gemma":[0.0027557425,0.000685906,0.0006299915,0.0013299241,0.00076816994,0.001826815,0.0015042566,0.0010112769,0.00078693073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016414195,0.000040071296,0.00022621754,0.00015385293,0.00003256866,0.000091198664,0.000122023346,0.92023605,0.0032553326,0.049866233,0.0025092282,0.023302983],"study_design_scores_gemma":[0.0000087384715,0.000027598348,0.0000491052,0.0000107605865,0.000009843808,0.000024912495,0.00004010492,0.98488194,0.00032273447,0.013697876,0.0009201081,0.000006321335],"about_ca_topic_score_codex":0.01205772,"about_ca_topic_score_gemma":0.009037136,"teacher_disagreement_score":0.01205772,"about_ca_system_score_codex":0.0025789754,"about_ca_system_score_gemma":0.0022149729,"threshold_uncertainty_score":0.028617322},"labels":[],"label_agreement":null},{"id":"W250999366","doi":"10.1007/978-3-642-41939-3_37","title":"FractVis: Visualizing Microseismic Events","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Microseism; Computer science; Visualization; Domain (mathematical analysis); Process (computing); Hydraulic fracturing; Data visualization; Data mining; Curse of dimensionality; Data science; Artificial intelligence; Geology; Seismology; Petroleum engineering","score_opus":0.021050463029297476,"score_gpt":0.2906654685272509,"score_spread":0.2696150054979534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W250999366","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060831312,0.0009430769,0.74164253,0.0006269803,0.0005511331,0.00014304505,0.0149497045,0.10932761,0.07098467],"genre_scores_gemma":[0.49321815,0.0013643595,0.41792834,0.00022082376,0.00028209307,0.00030426923,0.018890835,0.023664761,0.044126306],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999058,0.000009653574,0.000004786209,0.00001472466,0.000050750034,0.00001426382],"domain_scores_gemma":[0.99972993,0.00011069376,0.000025175483,0.000045343364,0.000055446602,0.000033449982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017500596,0.0009473189,0.00034881287,0.0021633243,0.0005656842,0.0018556126,0.0009987202,0.00070599036,0.04717767],"category_scores_gemma":[0.00090044964,0.0003709695,0.00047245863,0.0018630249,0.00030419132,0.0013544306,0.0012216986,0.00067150436,0.004582093],"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.000514116,0.000094658346,0.0072061326,0.0012214982,0.00014420878,0.0009589566,0.0026087658,0.04556,0.054256972,0.049606074,0.23176433,0.6060643],"study_design_scores_gemma":[0.00011956335,0.00010806367,0.015611489,0.00035121586,0.00009987929,0.0016696345,0.0017921766,0.41568187,0.053620044,0.08294011,0.42778984,0.00021616508],"about_ca_topic_score_codex":0.0018852627,"about_ca_topic_score_gemma":0.004133016,"teacher_disagreement_score":0.04717767,"about_ca_system_score_codex":0.00024580664,"about_ca_system_score_gemma":0.00033744032,"threshold_uncertainty_score":0.15782505},"labels":[],"label_agreement":null},{"id":"W2510392992","doi":"10.1007/978-3-319-46073-4_6","title":"A Neural Field Approach to Obstacle Avoidance","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Dalhousie University","funders":"","keywords":"Artificial intelligence; Computer science; Robotics; Flexibility (engineering); Obstacle avoidance; Obstacle; Field (mathematics); Task (project management); Focus (optics); Cognitive robotics; Human–computer interaction; Robot; Mobile robot; Engineering; Systems engineering","score_opus":0.01967386230579018,"score_gpt":0.24170938995895433,"score_spread":0.22203552765316414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510392992","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.0075285984,0.005261561,0.91624665,0.00090706424,0.0006165604,0.000028809753,0.000088456305,0.00023610245,0.06908621],"genre_scores_gemma":[0.5339482,0.009733284,0.29997668,0.00070876844,0.0010907307,0.00020823989,0.00026828874,0.00025010243,0.15381579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999479,0.000009373142,0.0000021070239,0.000011900889,0.000021634625,0.0000071205986],"domain_scores_gemma":[0.9999362,0.000029181278,0.000005700765,0.0000049709306,0.000015974536,0.000007901787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012720801,0.00054740626,0.0005076385,0.00052322855,0.0003206145,0.0005687805,0.0014326253,0.0011724142,0.0072228345],"category_scores_gemma":[0.0003889754,0.00025789058,0.0004598892,0.00057145214,0.00061287434,0.0010786164,0.00069097464,0.0013599887,0.0007580691],"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.000031545827,0.00005778322,0.00012607555,0.0001407678,0.000036539543,0.00006935931,0.000051429794,0.3889869,0.002726718,0.464304,0.010229446,0.13323958],"study_design_scores_gemma":[0.000009445766,0.000023975941,0.00011285525,0.000026261398,0.000007911404,0.000043047603,0.000011836262,0.6409141,0.00037392756,0.3495468,0.008916252,0.00001360005],"about_ca_topic_score_codex":0.004023273,"about_ca_topic_score_gemma":0.0033374322,"teacher_disagreement_score":0.0072228345,"about_ca_system_score_codex":0.00064852746,"about_ca_system_score_gemma":0.00038519801,"threshold_uncertainty_score":0.02416277},"labels":[],"label_agreement":null},{"id":"W2510587864","doi":"10.1007/978-3-319-45823-6_18","title":"An Active-Set Evolution Strategy for Optimization with Known Constraints","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Set (abstract data type); Mathematical optimization; Artificial intelligence; Theoretical computer science; Programming language; Mathematics","score_opus":0.0314904697842053,"score_gpt":0.29939555789141503,"score_spread":0.26790508810720975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510587864","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.0038542992,0.00039381502,0.98243874,0.00011718419,0.00011915144,0.000051742245,0.000022007465,0.00007306198,0.012930011],"genre_scores_gemma":[0.2667127,0.0010925115,0.70263827,0.00042200368,0.00025392196,0.00073342153,0.00020144065,0.00024405723,0.027701674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994955,0.00016487222,0.000022250599,0.000059078582,0.00022706608,0.00003110688],"domain_scores_gemma":[0.9993492,0.00042864188,0.000035332396,0.000047479054,0.00011027742,0.000029044462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910627,0.0015476192,0.0012072156,0.00097389723,0.0005386665,0.0014441113,0.0027110996,0.002288796,0.006040398],"category_scores_gemma":[0.0026629013,0.0007382083,0.0011872047,0.0013104117,0.0010921999,0.0015445123,0.002020622,0.0021252362,0.0011574588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008980148,0.00017047502,0.00019771357,0.00025780735,0.00012687549,0.0001274569,0.00015066925,0.6864254,0.004530975,0.12651877,0.0045461045,0.17685798],"study_design_scores_gemma":[0.000013950283,0.00003307243,0.000028533525,0.000018551349,0.000013003154,0.000025304507,0.000006354449,0.9867402,0.000365999,0.011314238,0.0014343454,0.0000065214895],"about_ca_topic_score_codex":0.001214749,"about_ca_topic_score_gemma":0.0011490618,"teacher_disagreement_score":0.006040398,"about_ca_system_score_codex":0.0006578477,"about_ca_system_score_gemma":0.0004909128,"threshold_uncertainty_score":0.020207107},"labels":[],"label_agreement":null},{"id":"W2511543287","doi":"10.1007/978-3-319-43775-0_21","title":"Augmented Reality for Neurosurgical Guidance: An Objective Comparison of Planning Interface Modalities","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Western University","funders":"","keywords":"Augmented reality; Computer science; Human–computer interaction; Modalities; Interface (matter); Implementation; Software engineering","score_opus":0.05300636063519153,"score_gpt":0.34933595688166214,"score_spread":0.2963295962464706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511543287","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.5228179,0.050505374,0.38246346,0.0004126187,0.00046499248,0.00086291233,0.00274473,0.0013477658,0.03838028],"genre_scores_gemma":[0.8561081,0.013161593,0.123592466,0.00017822244,0.00019965944,0.00037559128,0.001019207,0.00042816377,0.004937076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971494,0.00113159,0.00020273632,0.00022525473,0.0011775309,0.00011349735],"domain_scores_gemma":[0.99479735,0.0032512147,0.00053030986,0.00030611036,0.0010175144,0.0000974154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031118295,0.0008155361,0.00066592824,0.00272572,0.0002618848,0.0028552564,0.0006758435,0.0008571902,0.0059014773],"category_scores_gemma":[0.008189579,0.00054082624,0.00057272665,0.0013701075,0.0005294497,0.0019548621,0.0015484432,0.00041406482,0.00081620476],"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.00715535,0.00029329685,0.014764394,0.0023721072,0.0005029707,0.00026432524,0.0010256786,0.005475764,0.06840142,0.0032421178,0.0030521108,0.89345044],"study_design_scores_gemma":[0.0013672269,0.015496974,0.48986787,0.0049298764,0.007579251,0.02503852,0.0059917285,0.16042395,0.21791056,0.017059674,0.052982494,0.0013518533],"about_ca_topic_score_codex":0.0008275869,"about_ca_topic_score_gemma":0.00112566,"teacher_disagreement_score":0.0059014773,"about_ca_system_score_codex":0.0003246834,"about_ca_system_score_gemma":0.0005029699,"threshold_uncertainty_score":0.01974243},"labels":[],"label_agreement":null},{"id":"W2511956618","doi":"10.1007/978-3-319-48989-6_23","title":"Error Invariants for Concurrent Traces","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 Toronto","funders":"","keywords":"Atomicity; Computer science; Concurrency; TRACE (psycholinguistics); Slicing; Programmer; Program slicing; Programming language; Debugging; Theoretical computer science; Algorithm; Parallel computing; Database transaction","score_opus":0.032928697880267005,"score_gpt":0.28805167091456424,"score_spread":0.2551229730342972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511956618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015282139,0.00088952045,0.9578746,0.00046700973,0.0005471826,0.00008146371,0.00016457534,0.0035381953,0.021155313],"genre_scores_gemma":[0.70613396,0.0013791355,0.247694,0.0004435406,0.00094847,0.0003403961,0.00097206724,0.0027497367,0.039338764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99449867,0.0007730934,0.00047016895,0.00096571085,0.0025500031,0.0007423866],"domain_scores_gemma":[0.9874801,0.0054712184,0.0008161306,0.004082806,0.0018188198,0.0003309232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003354998,0.0013828197,0.0010975809,0.0023422118,0.0014439112,0.0037839687,0.0024190915,0.0016140299,0.008132302],"category_scores_gemma":[0.016389314,0.0011682076,0.0013956618,0.0019050961,0.0044711195,0.008214443,0.004698111,0.0049032625,0.0019564386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015191578,0.000053609747,0.00047247065,0.00016157923,0.000022595776,0.0001659254,0.00044022687,0.010936347,0.002950045,0.90639573,0.0045174966,0.07373212],"study_design_scores_gemma":[0.000027808257,0.000040618474,0.00014658191,0.0000708134,0.000033258806,0.00013991215,0.000080246224,0.043138124,0.0080263605,0.9337695,0.014489133,0.000037701004],"about_ca_topic_score_codex":0.0012788007,"about_ca_topic_score_gemma":0.0010193513,"teacher_disagreement_score":0.008132302,"about_ca_system_score_codex":0.0018608015,"about_ca_system_score_gemma":0.0014757168,"threshold_uncertainty_score":0.027205288},"labels":[],"label_agreement":null},{"id":"W2512045614","doi":"10.1007/978-3-319-45153-4_71","title":"Detecting and Supporting the Evolving Knowledge Interests of Lifelong Professionals","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Baseline (sea); Programmer; Term (time); Computer science; Lifelong learning; Knowledge base; Recall; Knowledge management; Data science; Artificial intelligence; Psychology; Cognitive psychology; Pedagogy; Political science; Programming language","score_opus":0.017814513566689002,"score_gpt":0.30678649080432624,"score_spread":0.28897197723763723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512045614","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.9773183,0.0010736428,0.015205312,0.00054335414,0.000028610926,0.000050330767,0.00085599726,0.00023772202,0.0046866103],"genre_scores_gemma":[0.98868483,0.00022821553,0.008682236,0.00005514111,0.000045056266,0.000024391416,0.0010000562,0.000015763158,0.0012642913],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991296,0.00015885152,0.00005108439,0.0002514313,0.0002512741,0.00015775187],"domain_scores_gemma":[0.993216,0.0042836433,0.0005873096,0.00025755275,0.0009724529,0.0006830661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012698319,0.00031649633,0.00042691073,0.003918963,0.0005219924,0.0023118209,0.00065310556,0.0010419114,0.0011372631],"category_scores_gemma":[0.009986907,0.00017078206,0.00022268308,0.002199841,0.00021392692,0.0031928215,0.0014725113,0.0006656512,0.00068306574],"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.0009816698,0.00095449795,0.52131224,0.00024086639,0.00012053586,0.00044895083,0.003745143,0.0035914409,0.016242838,0.0022382122,0.0065978984,0.44352567],"study_design_scores_gemma":[0.00006876802,0.0010883755,0.38934603,0.00017618468,0.0003057845,0.0012198914,0.013510789,0.51060563,0.035265066,0.028226037,0.02007183,0.000115629955],"about_ca_topic_score_codex":0.005588155,"about_ca_topic_score_gemma":0.008463627,"teacher_disagreement_score":0.005588155,"about_ca_system_score_codex":0.0004888566,"about_ca_system_score_gemma":0.0006421381,"threshold_uncertainty_score":0.011111259},"labels":[],"label_agreement":null},{"id":"W2512194986","doi":"10.1007/978-3-540-28629-5_56","title":"Decidability of Trajectory-Based Equations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Catenation; Decidability; Constructive; Computer science; Trajectory; Quotient; Integer (computer science); Algebra over a field; Discrete mathematics; Algorithm; Mathematics; Programming language; Pure mathematics","score_opus":0.01825032286877343,"score_gpt":0.2449511614274609,"score_spread":0.22670083855868747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512194986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10469787,0.0009021033,0.8417711,0.0032226094,0.00027541813,0.00020858622,0.0014518064,0.0014962783,0.045974176],"genre_scores_gemma":[0.8143623,0.0009996933,0.15011494,0.0008406319,0.00034927428,0.00038194365,0.003077211,0.0005509864,0.029323105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969817,0.0005898118,0.0002703961,0.00089908385,0.0008252401,0.00043373156],"domain_scores_gemma":[0.9892384,0.00875637,0.00033493084,0.00074234133,0.0007225776,0.00020540935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026044126,0.0009449585,0.0012652604,0.0009670938,0.0014243516,0.0038469173,0.0037458937,0.0022364822,0.007954646],"category_scores_gemma":[0.010900687,0.0012305967,0.0039261826,0.0015295073,0.003558596,0.010493542,0.003943022,0.0075255814,0.0008750131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006269407,0.000058318943,0.00044444698,0.00015923144,0.000046957484,0.00017142919,0.0006788,0.013632392,0.001527434,0.968286,0.0018109984,0.013121376],"study_design_scores_gemma":[0.00005333137,0.000012801677,0.00012391547,0.00002210426,0.000033216616,0.000063993066,0.00006721367,0.04897741,0.0017523988,0.94596845,0.0029098387,0.000015256979],"about_ca_topic_score_codex":0.0045184777,"about_ca_topic_score_gemma":0.0038554973,"teacher_disagreement_score":0.007954646,"about_ca_system_score_codex":0.003119016,"about_ca_system_score_gemma":0.0019541383,"threshold_uncertainty_score":0.02661097},"labels":[],"label_agreement":null},{"id":"W2512200334","doi":"10.1007/978-3-319-45276-0_10","title":"Extending Weakly-Sticky Datalog $$^\\pm $$ : Query-Answering Tractability and Optimizations","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Datalog; Computer science; Chase; Rewriting; Class (philosophy); Property (philosophy); MAGIC (telescope); Theoretical computer science; Programming language; Range (aeronautics); Database; Artificial intelligence","score_opus":0.017282461370689554,"score_gpt":0.24678532354316035,"score_spread":0.2295028621724708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512200334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032952145,0.0010165289,0.93743825,0.0028967096,0.00026088886,0.00025265635,0.0019761682,0.0059784963,0.017228138],"genre_scores_gemma":[0.42095545,0.0011559234,0.5501638,0.001957022,0.0006826972,0.0005570578,0.004554411,0.0035228159,0.01645083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99074334,0.0021345722,0.0007492042,0.001405135,0.0039294334,0.0010382924],"domain_scores_gemma":[0.98027736,0.0114144515,0.0004954978,0.006088793,0.0013681577,0.00035570492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006353541,0.0015468156,0.0022576025,0.0017887844,0.0018276437,0.005269146,0.0058901277,0.0019374524,0.013603505],"category_scores_gemma":[0.023559608,0.0017472127,0.0048418217,0.0041137016,0.0034809075,0.018216796,0.011720517,0.008071271,0.0036861296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009823976,0.00046678685,0.0015052466,0.0011381002,0.00019554132,0.000268961,0.00087236246,0.064995244,0.009661284,0.64974743,0.026434116,0.2437326],"study_design_scores_gemma":[0.0000680445,0.000048076967,0.00019250366,0.000054367894,0.00007578066,0.00007744706,0.000079862984,0.13307907,0.0046133073,0.85463417,0.0070403065,0.000037069814],"about_ca_topic_score_codex":0.006681265,"about_ca_topic_score_gemma":0.008066466,"teacher_disagreement_score":0.013603505,"about_ca_system_score_codex":0.003434841,"about_ca_system_score_gemma":0.0039042654,"threshold_uncertainty_score":0.045508265},"labels":[],"label_agreement":null},{"id":"W2512531676","doi":"10.1007/978-3-319-45641-6_25","title":"Using Sparse Interpolation in Hensel Lifting","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Univariate; Polynomial; Factorization; Diophantine equation; Interpolation (computer graphics); Polynomial interpolation; Lift (data mining); Applied mathematics; Maple; Mathematics; Quaternion; Computer science; Algebra over a field; Image (mathematics); Algorithm; Discrete mathematics; Pure mathematics; Linear interpolation; Artificial intelligence; Statistics; Mathematical analysis; Geometry; Data mining","score_opus":0.03212336987551904,"score_gpt":0.2630906321011544,"score_spread":0.23096726222563538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512531676","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.035429854,0.0007168093,0.9115504,0.00036359296,0.0005561524,0.00006661073,0.00015166815,0.0008288745,0.05033603],"genre_scores_gemma":[0.42471802,0.0020445767,0.52202564,0.00033705964,0.0006062308,0.000088157736,0.00044687826,0.00063670037,0.049096715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996643,0.000064835964,0.000015053657,0.00005922243,0.00014733458,0.00004933598],"domain_scores_gemma":[0.9997029,0.000103495026,0.000018527557,0.000106659405,0.00004801587,0.000020491987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045445215,0.00056370435,0.00062439026,0.0009022588,0.0006527179,0.0010906996,0.0006794439,0.0005430145,0.01130904],"category_scores_gemma":[0.0015633159,0.0004121515,0.0006391007,0.0010594199,0.0011185852,0.0020582303,0.0021025816,0.0018134847,0.002520188],"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.00015903692,0.00006501007,0.0002601318,0.00024964556,0.000023184277,0.00020528233,0.00019279489,0.010167086,0.014266419,0.7467103,0.00613691,0.22156423],"study_design_scores_gemma":[0.00004127676,0.00015270604,0.00033762268,0.000088557834,0.000035812107,0.00054688274,0.00012532515,0.08997529,0.017015794,0.83381605,0.05781455,0.000050180308],"about_ca_topic_score_codex":0.00048203877,"about_ca_topic_score_gemma":0.00072444184,"teacher_disagreement_score":0.01130904,"about_ca_system_score_codex":0.00034576852,"about_ca_system_score_gemma":0.0003658625,"threshold_uncertainty_score":0.03783244},"labels":[],"label_agreement":null},{"id":"W2514094964","doi":"10.1007/978-3-319-50106-2_39","title":"Stack and Queue Layouts via Layered Separators","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Book embedding; Bounded function; Planar graph; 1-planar graph; Mathematics; Vertex (graph theory); Pathwidth; Stack (abstract data type); Graph; Genus; Discrete mathematics; Queue; Chordal graph; Computer science; Line graph","score_opus":0.019318804897004098,"score_gpt":0.30960468144179637,"score_spread":0.29028587654479227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514094964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4636164,0.0008959097,0.4843552,0.001145262,0.00022464442,0.000088994064,0.0010604102,0.0036118748,0.04500126],"genre_scores_gemma":[0.88583165,0.0006303494,0.09319355,0.0002131167,0.000104209554,0.00009526769,0.00063608965,0.0006273305,0.018668365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924767,0.00010482906,0.000045945195,0.00021006928,0.00017765703,0.00021391753],"domain_scores_gemma":[0.9967458,0.0010233498,0.00058846344,0.0007735272,0.0003248527,0.0005439511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246366,0.000551086,0.00048953155,0.0010634906,0.001579536,0.0028818853,0.0012716383,0.0009311909,0.010535492],"category_scores_gemma":[0.004830572,0.00066284963,0.0006733259,0.0012726457,0.0019843103,0.0067335023,0.0032505905,0.0016236217,0.0014622312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005462452,0.000104191306,0.0027886324,0.00019280834,0.000043591,0.00040562096,0.0008690325,0.035525676,0.019222913,0.88644713,0.006683166,0.04717099],"study_design_scores_gemma":[0.00009474342,0.00017606173,0.0014274068,0.00006785305,0.00006461253,0.0005945297,0.00044436796,0.123010725,0.013524196,0.83657205,0.023931718,0.000091752125],"about_ca_topic_score_codex":0.0023826575,"about_ca_topic_score_gemma":0.0034804856,"teacher_disagreement_score":0.010535492,"about_ca_system_score_codex":0.0015484102,"about_ca_system_score_gemma":0.0011401984,"threshold_uncertainty_score":0.035244703},"labels":[],"label_agreement":null},{"id":"W2514303710","doi":"10.1007/978-3-319-46073-4_2","title":"Model Based Augmentation and Testing of an Annotated Hand Pose Dataset","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Nexen (Canada)","funders":"","keywords":"Computer science; Pipeline (software); Code (set theory); Set (abstract data type); Artificial intelligence; Training set; Deep learning; Quality (philosophy); Machine learning; Data mining; Programming language","score_opus":0.04128122606668227,"score_gpt":0.2756116787312435,"score_spread":0.2343304526645612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514303710","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.6550237,0.0029211568,0.22362973,0.00074188015,0.0016723272,0.0015825902,0.04802853,0.050976463,0.015423646],"genre_scores_gemma":[0.6717205,0.00058816985,0.15940441,0.00055871287,0.00020259724,0.000980464,0.1492874,0.0014609031,0.015796823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976374,0.00039832026,0.00015244537,0.00091883907,0.0006425569,0.00025042714],"domain_scores_gemma":[0.996132,0.0010507838,0.00020562587,0.0014423042,0.0009578372,0.00021144096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017814686,0.0027526973,0.0013531343,0.0013293296,0.0007828377,0.0011882546,0.0021120252,0.002134173,0.007312602],"category_scores_gemma":[0.0046183406,0.0008274083,0.0017693866,0.0011415884,0.00097355625,0.0014846914,0.0022457263,0.0017063844,0.007124251],"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.0025520297,0.0028268634,0.015508695,0.0009644554,0.00061670016,0.0014685217,0.00040907893,0.06872414,0.16648309,0.001275945,0.085703634,0.65346676],"study_design_scores_gemma":[0.0004016639,0.0025187305,0.042369884,0.00023310569,0.0003739844,0.002608261,0.00056705764,0.76116556,0.15920222,0.0042289654,0.02614056,0.00018989912],"about_ca_topic_score_codex":0.008196275,"about_ca_topic_score_gemma":0.018585755,"teacher_disagreement_score":0.008196275,"about_ca_system_score_codex":0.00067704776,"about_ca_system_score_gemma":0.0014280513,"threshold_uncertainty_score":0.024463058},"labels":[],"label_agreement":null},{"id":"W2514584850","doi":"10.1007/978-3-319-44953-1_21","title":"Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Mathematical optimization; Integer programming; Computer science; Heuristics; Constraint programming; Quadratically constrained quadratic program; Quadratic growth; Quadratic programming; Integer (computer science); Nonlinear programming; Mathematics; Algorithm; Stochastic programming; Nonlinear system","score_opus":0.02049755106873633,"score_gpt":0.259341411781627,"score_spread":0.23884386071289068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514584850","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.0017391823,0.0018931506,0.9703879,0.00046317704,0.00019281723,0.00006204874,0.00019771795,0.00011915228,0.024944922],"genre_scores_gemma":[0.16225189,0.010009373,0.77822876,0.0007914332,0.0008699517,0.00094719173,0.0017514904,0.0009001363,0.044249788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855405,0.0005133705,0.0000762793,0.00020957922,0.0005322921,0.000114339644],"domain_scores_gemma":[0.99848664,0.0010606338,0.00008454477,0.00009494508,0.00022414156,0.000049082984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014944011,0.0018768589,0.001269526,0.000538808,0.0004921669,0.0025528618,0.0019941013,0.0013221155,0.010582914],"category_scores_gemma":[0.0066102627,0.0009540447,0.0010324391,0.0022524216,0.0012375548,0.0020070977,0.0019978257,0.0039936514,0.0020274913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000927375,0.00010200288,0.00017222487,0.0010676072,0.0000716128,0.0001644528,0.00014422652,0.46725014,0.002688686,0.34154624,0.030539906,0.15616012],"study_design_scores_gemma":[0.000031477677,0.000039540333,0.00012424636,0.0001495482,0.000017830896,0.00006604454,0.000029987295,0.80456704,0.00067484647,0.17511573,0.019158894,0.000024861598],"about_ca_topic_score_codex":0.005309847,"about_ca_topic_score_gemma":0.0038175774,"teacher_disagreement_score":0.010582914,"about_ca_system_score_codex":0.0013200784,"about_ca_system_score_gemma":0.0014562107,"threshold_uncertainty_score":0.03540343},"labels":[],"label_agreement":null},{"id":"W2515328120","doi":"10.1007/978-3-319-44778-0_41","title":"Real-Time FPGA Simulation of Surrogate Models of Large Spiking Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","field":"Engineering","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":"Computer science; Field-programmable gate array; Artificial neural network; Spiking neural network; Forcing (mathematics); Range (aeronautics); Scale (ratio); Gate array; Field (mathematics); Real-time simulation; Artificial intelligence; Simulation; Embedded system","score_opus":0.017615056907300627,"score_gpt":0.24868618578385165,"score_spread":0.231071128876551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515328120","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.78753346,0.0004107988,0.17343937,0.00063510705,0.00020703871,0.00006839513,0.00057897455,0.0017280676,0.035398815],"genre_scores_gemma":[0.9881613,0.000053127023,0.009870691,0.000034021275,0.0000063665757,0.00002544955,0.00012549749,0.000055814548,0.0016676843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998964,0.000031191736,0.0000045973165,0.000012031864,0.00003661204,0.000019098428],"domain_scores_gemma":[0.99947387,0.00034597836,0.000035855373,0.000046495355,0.00006608033,0.000031724623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544129,0.00042702732,0.00047601786,0.00025960413,0.00025569493,0.00057048997,0.00079257495,0.00092413236,0.004624079],"category_scores_gemma":[0.0012049031,0.0002873906,0.00031824765,0.00032913106,0.0003603445,0.00045240836,0.00033954982,0.0006005905,0.00032013617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274439,0.000022933977,0.0003605316,0.000020966309,0.000009374353,0.000059416696,0.000025682188,0.99369603,0.0009856898,0.0015831079,0.0003443576,0.0028291217],"study_design_scores_gemma":[0.0000070044575,0.00001290763,0.000064279004,0.0000017245792,0.0000011945481,0.000007472743,0.000005811614,0.99903107,0.0003915693,0.00036667063,0.00010877242,0.0000014314058],"about_ca_topic_score_codex":0.0041041505,"about_ca_topic_score_gemma":0.0043796347,"teacher_disagreement_score":0.004624079,"about_ca_system_score_codex":0.0006496233,"about_ca_system_score_gemma":0.000518159,"threshold_uncertainty_score":0.015469074},"labels":[],"label_agreement":null},{"id":"W2515670181","doi":"10.1007/978-3-319-39516-6_13","title":"Transition Times for Manipulation Tasks in Hybrid Interfaces","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Computer science; Motion (physics); Human–computer interaction; Simulation; Artificial intelligence","score_opus":0.017555145885533807,"score_gpt":0.2590964688067797,"score_spread":0.24154132292124592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515670181","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.83322257,0.0014384845,0.14967395,0.00016507294,0.00016189003,0.0001650383,0.0010207059,0.0018873016,0.012265033],"genre_scores_gemma":[0.9775164,0.00025214552,0.0148088755,0.00002172916,0.0000125034985,0.000095026444,0.00069886155,0.00040624,0.006188259],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995208,0.000085152824,0.00003346672,0.00008835454,0.00018607016,0.000086147455],"domain_scores_gemma":[0.9935853,0.0051039234,0.00026065033,0.00028332963,0.0004281762,0.00033859155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346551,0.0004723134,0.00048429225,0.00068533525,0.0003833974,0.0011903204,0.00053009583,0.00048524459,0.02239024],"category_scores_gemma":[0.011251333,0.00028166268,0.00031501407,0.0004918116,0.00025613437,0.001677182,0.00081779953,0.0006584505,0.0021229712],"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.034201086,0.0010357363,0.0123507995,0.0016196792,0.00013784725,0.00062911294,0.0038815532,0.039636347,0.24267231,0.037061863,0.0072560227,0.6195176],"study_design_scores_gemma":[0.00069405016,0.0044732937,0.12481545,0.0005053012,0.00035890422,0.0021465996,0.0042895875,0.6291339,0.14867976,0.07108212,0.013504825,0.00031621303],"about_ca_topic_score_codex":0.0013019782,"about_ca_topic_score_gemma":0.0013153339,"teacher_disagreement_score":0.02239024,"about_ca_system_score_codex":0.00027510148,"about_ca_system_score_gemma":0.00041006343,"threshold_uncertainty_score":0.07490283},"labels":[],"label_agreement":null},{"id":"W2515908536","doi":"10.1007/978-3-319-45641-6_22","title":"Computing Characteristic Polynomials of Matrices of Structured Polynomials","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Orthogonal polynomials; Algebra over a field; Classical orthogonal polynomials; Wilson polynomials; Discrete orthogonal polynomials; Mathematics; Pure mathematics","score_opus":0.012579991983386184,"score_gpt":0.24216713230135717,"score_spread":0.22958714031797098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515908536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23568188,0.0009340779,0.72850806,0.00059187267,0.00027230714,0.000091015645,0.0010246333,0.002175569,0.030720666],"genre_scores_gemma":[0.8066471,0.00084304216,0.17142396,0.00015583768,0.0003047333,0.000055693286,0.002046547,0.0005572179,0.017965848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933964,0.000087826294,0.000027349042,0.0001744076,0.00024182344,0.00012888605],"domain_scores_gemma":[0.9983253,0.00083078357,0.00016695347,0.00025267174,0.0002929423,0.00013125915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498832,0.0006991676,0.00069179205,0.0012542778,0.0005872314,0.0024273319,0.001044472,0.00045276727,0.009086708],"category_scores_gemma":[0.004578643,0.00045446624,0.0006635715,0.0017336642,0.0009794707,0.004829621,0.0015876263,0.0014211837,0.0028042493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052587717,0.00014874565,0.004756859,0.00054390874,0.00007926129,0.00031108616,0.0007984833,0.032031346,0.02861329,0.5319313,0.018642826,0.38161695],"study_design_scores_gemma":[0.00005098728,0.0001177883,0.0012169152,0.000062981606,0.000035164732,0.00041573553,0.00022218355,0.077402994,0.0148521755,0.89202094,0.013558527,0.00004352481],"about_ca_topic_score_codex":0.0008113593,"about_ca_topic_score_gemma":0.001837926,"teacher_disagreement_score":0.009086708,"about_ca_system_score_codex":0.000899039,"about_ca_system_score_gemma":0.0008171456,"threshold_uncertainty_score":0.030398011},"labels":[],"label_agreement":null},{"id":"W2516001042","doi":"10.1007/978-3-319-45823-6_95","title":"Tutorials at PPSN 2016","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Range (aeronautics); Field (mathematics); Computation; Operations research; Data science; Programming language; Engineering; Aerospace engineering","score_opus":0.014427402573505771,"score_gpt":0.24379239592993415,"score_spread":0.22936499335642838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516001042","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015415131,0.041027837,0.054183573,0.0036791188,0.024353119,0.0002019596,0.0043387283,0.005411615,0.86526257],"genre_scores_gemma":[0.0031038055,0.016555626,0.011162426,0.00059814495,0.0040835054,0.0001341179,0.0035526643,0.0018055517,0.95900416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995158,0.00005127441,0.000023802375,0.00009439851,0.00027048166,0.00004429549],"domain_scores_gemma":[0.99953306,0.00007020303,0.000023895012,0.000055596,0.00013708888,0.00018004498],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057583133,0.002062732,0.0014591439,0.0027963745,0.00077481417,0.0034784672,0.0012530707,0.00092814467,0.38390648],"category_scores_gemma":[0.0013037937,0.0006084371,0.00078631827,0.003370397,0.00033184065,0.003675026,0.0025142448,0.0018721892,0.34224364],"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.000037446807,0.00006609423,0.00007294778,0.00038656488,0.000008288892,0.000039961873,0.000042395295,0.0010270519,0.0010798806,0.010245129,0.56310374,0.42389056],"study_design_scores_gemma":[0.0000067024307,0.000021040565,0.00017772398,0.00016783873,0.000006158332,0.00009749771,0.000019566007,0.00047041042,0.0003614584,0.008467655,0.990195,0.000008882004],"about_ca_topic_score_codex":0.0007709776,"about_ca_topic_score_gemma":0.0024318427,"teacher_disagreement_score":0.38390648,"about_ca_system_score_codex":0.0013157718,"about_ca_system_score_gemma":0.0014406842,"threshold_uncertainty_score":0.87878263},"labels":[],"label_agreement":null},{"id":"W2516160016","doi":"10.1007/978-3-319-45871-7_2","title":"Improved Linear Cryptanalysis of Round-Reduced ARIA","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Linear cryptanalysis; Key (lock); Cryptanalysis; Computer security; Cipher; Arithmetic; Encryption; Mathematics","score_opus":0.01852102745369421,"score_gpt":0.2740647691256091,"score_spread":0.2555437416719149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516160016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102909,0.0023612308,0.753932,0.0019692064,0.0012819916,0.0002720845,0.0005853582,0.008794847,0.1278942],"genre_scores_gemma":[0.70482206,0.0007969214,0.22144493,0.00071970996,0.00062377873,0.00015998336,0.0006197676,0.0009016275,0.06991123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974483,0.0005597554,0.000104413404,0.0003195876,0.0011069264,0.0004610746],"domain_scores_gemma":[0.99872607,0.0003485723,0.00006621818,0.00059239997,0.00020617433,0.000060530627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013404832,0.00095096737,0.0011141468,0.0010467138,0.0009464456,0.0024552331,0.0016904322,0.0009909077,0.016013646],"category_scores_gemma":[0.0023787213,0.000551534,0.0014829894,0.00097249344,0.0014694142,0.0025287024,0.002711841,0.0029900456,0.0071064583],"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.001993965,0.00027390075,0.0009432707,0.0004875638,0.00026644563,0.0005492089,0.00054676336,0.025511907,0.06926179,0.55308616,0.023760032,0.32331905],"study_design_scores_gemma":[0.00030094956,0.0010587674,0.0018445693,0.00019435944,0.0004833177,0.0019418669,0.00019482795,0.31160435,0.13320202,0.44124907,0.10764653,0.0002793528],"about_ca_topic_score_codex":0.00048606884,"about_ca_topic_score_gemma":0.00088041916,"teacher_disagreement_score":0.016013646,"about_ca_system_score_codex":0.001083031,"about_ca_system_score_gemma":0.0013761217,"threshold_uncertainty_score":0.053570986},"labels":[],"label_agreement":null},{"id":"W251711591","doi":"10.1007/978-3-319-07638-6_28","title":"The Wearable Self: Braiding a Feminist Critique within a Somaesthetics Framework for Design","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Embodied cognition; Status quo; Wearable computer; Aesthetics; Sociology; Agency (philosophy); Interaction design; Exploratory research; Computer science; Human–computer interaction; Art; Social science; Political science; Artificial intelligence","score_opus":0.026709562797436456,"score_gpt":0.2912634206521567,"score_spread":0.26455385785472024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251711591","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.0143316705,0.0072546205,0.102860495,0.071480006,0.0016167914,0.00006666346,0.000053455162,0.00017284854,0.80216336],"genre_scores_gemma":[0.7477655,0.0036742245,0.025442664,0.010663483,0.0009051124,0.00043087054,0.000038831236,0.0007074986,0.21037191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99313277,0.0053359307,0.000121698555,0.00041919746,0.0007238573,0.0002665284],"domain_scores_gemma":[0.99519354,0.0036294989,0.00014090614,0.0004649435,0.0003559721,0.00021507598],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0055941436,0.0012600236,0.00057624886,0.0014662839,0.0082131885,0.011502916,0.0019976841,0.0055533024,0.011135226],"category_scores_gemma":[0.0050913165,0.00054064766,0.0005112657,0.0011038203,0.07787326,0.010167824,0.0069762515,0.008108018,0.0020245605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040847603,0.0000047437447,0.000017413333,0.000027281447,9.343419e-7,0.000024348048,0.014996795,0.00004765744,0.000098464036,0.9803997,0.0019129366,0.0024656304],"study_design_scores_gemma":[0.000024755953,0.000030615447,0.000097780125,0.00029103915,0.000007937797,0.0002679647,0.018370776,0.00035549086,0.0005906318,0.6373498,0.34259748,0.00001578463],"about_ca_topic_score_codex":0.0025221054,"about_ca_topic_score_gemma":0.004997127,"teacher_disagreement_score":0.99178684,"about_ca_system_score_codex":0.005374668,"about_ca_system_score_gemma":0.0029971346,"threshold_uncertainty_score":0.03899616},"labels":[],"label_agreement":null},{"id":"W2517328249","doi":"10.1007/978-3-319-44896-1_16","title":"A Revenue Management Approach for Network Capacity Allocation of an Intermodal Barge Transportation System","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Maritime Ports and Logistics","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 à Montréal","funders":"","keywords":"Computer science; BARGE; Revenue; Revenue management; Operations research; Probabilistic logic; Integer programming; Mathematical optimization; Time horizon; Engineering; Finance; Algorithm; Business","score_opus":0.014661630994248644,"score_gpt":0.2022185401342919,"score_spread":0.18755690914004328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517328249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00827845,0.00051178306,0.9747834,0.00042015544,0.00014190412,0.00013455613,0.00005777906,0.00013154035,0.015540439],"genre_scores_gemma":[0.6077488,0.0016189215,0.35581613,0.0003223181,0.00047661748,0.0003955392,0.00017038411,0.000269669,0.033181537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.0004025807,0.000031995496,0.000118115684,0.00022211521,0.00014294233],"domain_scores_gemma":[0.99963534,0.00017836303,0.0000327437,0.000023924114,0.00009876725,0.000030785686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001773346,0.0012754817,0.0012965502,0.0010002847,0.0008072409,0.002362826,0.0031010308,0.0014572275,0.0075783813],"category_scores_gemma":[0.0019424158,0.00066562457,0.0015052848,0.0015006198,0.0007797736,0.0022152606,0.0014696508,0.002006583,0.0007461257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040508774,0.000096240125,0.00017064722,0.0001458347,0.000055145174,0.00019111966,0.00010844826,0.84218305,0.0020590022,0.09380326,0.004117507,0.05702935],"study_design_scores_gemma":[0.000005508072,0.000020549067,0.00005918038,0.000012261366,0.000014471841,0.000028597735,0.000024316201,0.9820556,0.0002003817,0.016407747,0.001164532,0.0000068457475],"about_ca_topic_score_codex":0.006573161,"about_ca_topic_score_gemma":0.0069079814,"teacher_disagreement_score":0.0075783813,"about_ca_system_score_codex":0.0026129307,"about_ca_system_score_gemma":0.0016433157,"threshold_uncertainty_score":0.02535218},"labels":[],"label_agreement":null},{"id":"W2517359678","doi":"10.1007/978-3-319-45234-0_49","title":"Social Media Use During Emergency Response – Insights from Emergency Professionals","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Public Relations and Crisis Communication","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Social media; Categorization; Emergency response; Computer science; Interview; Information overload; Prioritization; Reliability (semiconductor); Emergency management; Knowledge management; Data science; World Wide Web; Process management; Business; Medical emergency; Political science; Medicine; Artificial intelligence","score_opus":0.041551974012077636,"score_gpt":0.3271754565674641,"score_spread":0.2856234825553865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517359678","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.9328688,0.006752434,0.0013693966,0.0105499495,0.00011191412,0.000043313088,0.00019671496,0.000024814119,0.04808277],"genre_scores_gemma":[0.97931653,0.007076971,0.0012361238,0.0015427585,0.00008690497,0.000042651984,0.00014404727,0.000027507638,0.010526555],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9983918,0.0009169042,0.00004696741,0.00011359032,0.0003391653,0.00019148462],"domain_scores_gemma":[0.99332726,0.0055592684,0.0003725696,0.000074137526,0.00040256113,0.00026417527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025954798,0.0002802441,0.00022879532,0.0017725191,0.0030544405,0.004284905,0.0005442278,0.0014351645,0.0024387827],"category_scores_gemma":[0.0069204723,0.00031050242,0.00013324074,0.001952639,0.002019405,0.004390258,0.0016748945,0.0011285073,0.00050612766],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032432254,0.00004702324,0.01438545,0.00025487182,0.000007187437,0.0012419997,0.9332642,0.000050284012,0.00082900416,0.0020751357,0.006356874,0.041455463],"study_design_scores_gemma":[0.0000042262877,0.000050685838,0.021647733,0.0003947381,0.0000075141734,0.0009549648,0.9200877,0.0001495854,0.00031612886,0.0007513852,0.05561387,0.000021464926],"about_ca_topic_score_codex":0.01700132,"about_ca_topic_score_gemma":0.048851892,"teacher_disagreement_score":0.01700132,"about_ca_system_score_codex":0.0020267777,"about_ca_system_score_gemma":0.0019112944,"threshold_uncertainty_score":0.033804715},"labels":[],"label_agreement":null},{"id":"W251738500","doi":"10.1007/978-3-319-07725-3_46","title":"Formalizing the Glucose Homeostasis Mechanism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Correctness; Computer science; Process (computing); Domain (mathematical analysis); Mechanism (biology); Reliability engineering; Formal verification; Formal methods; Risk analysis (engineering); Distributed computing; Software engineering; Programming language","score_opus":0.026481463382299064,"score_gpt":0.2676860127515334,"score_spread":0.24120454936923436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251738500","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.017827984,0.0013648933,0.9402398,0.0010718342,0.0004684295,0.00011416886,0.00021368175,0.0017754221,0.036923837],"genre_scores_gemma":[0.60104346,0.0025676878,0.36227977,0.0007124326,0.00029115035,0.00034265316,0.0005134805,0.0006443186,0.031604998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994018,0.000117759184,0.000049894006,0.00014548171,0.00016504413,0.00012001766],"domain_scores_gemma":[0.9996026,0.0001738574,0.00004634913,0.00010536893,0.00004938396,0.000022506749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876294,0.0009661388,0.00048258586,0.00051677175,0.0004607223,0.0021733267,0.0019357344,0.0011531689,0.0053619915],"category_scores_gemma":[0.0017078894,0.0005937642,0.0016692287,0.00041110205,0.0024904427,0.0027597162,0.0022553501,0.0021946607,0.0012726227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008490635,0.00003798819,0.00017106648,0.00020352402,0.000032305343,0.000306018,0.0002056211,0.017501084,0.012684268,0.945679,0.0013187885,0.021775333],"study_design_scores_gemma":[0.00010888773,0.00008261667,0.00021216231,0.00017408891,0.000104955856,0.0004395971,0.0000668855,0.053327847,0.026910044,0.86510897,0.05340709,0.00005676255],"about_ca_topic_score_codex":0.0011961015,"about_ca_topic_score_gemma":0.00077406503,"teacher_disagreement_score":0.0053619915,"about_ca_system_score_codex":0.0008895916,"about_ca_system_score_gemma":0.00094025244,"threshold_uncertainty_score":0.01793772},"labels":[],"label_agreement":null},{"id":"W2517797785","doi":"10.1007/978-3-319-45477-1_2","title":"FIDL: A Fault Injection Description Language for Compiler-Based SFI Tools","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiation Effects in Electronics","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 British Columbia","funders":"","keywords":"Computer science; Compiler; Programming language; Fault (geology); Software engineering","score_opus":0.013274830881009949,"score_gpt":0.23271881411722317,"score_spread":0.21944398323621322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517797785","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011460037,0.00026615075,0.92893845,0.00014167724,0.00011284059,0.00011874675,0.003241217,0.06253694,0.003497995],"genre_scores_gemma":[0.065115415,0.0010330372,0.86198795,0.0011152276,0.00014438856,0.00097622286,0.016979735,0.03535868,0.017289296],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842787,0.0002777346,0.00024181973,0.0001714242,0.00072208454,0.00015904332],"domain_scores_gemma":[0.9976826,0.0010217684,0.00020010464,0.00050325925,0.0005319387,0.000060323157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020468524,0.002106913,0.0010455537,0.0019037611,0.0005547516,0.0022872395,0.0038233863,0.001360873,0.01860627],"category_scores_gemma":[0.004390087,0.0015329834,0.001992856,0.001076289,0.00092413893,0.0031935163,0.0017895236,0.0029381549,0.0080089215],"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.0005084511,0.00025355208,0.0019315446,0.0031056239,0.00017571817,0.00066205964,0.00082747237,0.095983975,0.033186153,0.13010089,0.23335302,0.4999117],"study_design_scores_gemma":[0.00024009401,0.00016968757,0.00049232907,0.0006462823,0.00013341496,0.0009999487,0.00011483387,0.366558,0.07936079,0.077604644,0.4734302,0.00024987932],"about_ca_topic_score_codex":0.0025683164,"about_ca_topic_score_gemma":0.0033731912,"teacher_disagreement_score":0.01860627,"about_ca_system_score_codex":0.001143254,"about_ca_system_score_gemma":0.0020928055,"threshold_uncertainty_score":0.062244177},"labels":[],"label_agreement":null},{"id":"W2517954747","doi":"10.1007/978-3-319-46976-8_19","title":"The Importance of Skip Connections in Biomedical Image Segmentation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":991,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier de l’Université de Montréal; Université de Montréal; Polytechnique Montréal","funders":"Mitacs","keywords":"Computer science; Upsampling; Path (computing); Residual; Segmentation; Artificial intelligence; Image (mathematics); Image segmentation; Pattern recognition (psychology); Computer vision; Algorithm; Computer network","score_opus":0.013733747546252716,"score_gpt":0.2756294804930322,"score_spread":0.2618957329467795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517954747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10377553,0.0071103256,0.8756208,0.001005813,0.00025776352,0.00005446156,0.00043390266,0.0013437954,0.010397568],"genre_scores_gemma":[0.74431336,0.0065292884,0.2304818,0.000361359,0.0005973386,0.000067261884,0.0012621116,0.00068266236,0.015704852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971086,0.00007042226,0.000020997482,0.00007845344,0.00008600417,0.00003321792],"domain_scores_gemma":[0.99721634,0.0018010592,0.00018457862,0.00028736412,0.00038044518,0.00013021042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013447669,0.00090212515,0.000644048,0.001075967,0.000560939,0.0012694153,0.0009904173,0.0015542227,0.0032188254],"category_scores_gemma":[0.0056113373,0.0005196923,0.00042360643,0.00091356854,0.00077739527,0.0029473396,0.001132439,0.0009949773,0.0007546142],"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.001002446,0.00012980208,0.0037610284,0.00076375616,0.00018500006,0.00071853335,0.00019197835,0.14643262,0.08024046,0.05413978,0.008543812,0.70389086],"study_design_scores_gemma":[0.00001888555,0.000121926416,0.0040354333,0.00007241581,0.00011243149,0.00041017585,0.000038406415,0.8977801,0.020597056,0.07411439,0.0026783557,0.00002035121],"about_ca_topic_score_codex":0.002097022,"about_ca_topic_score_gemma":0.0043399767,"teacher_disagreement_score":0.0032188254,"about_ca_system_score_codex":0.00042820763,"about_ca_system_score_gemma":0.0006099822,"threshold_uncertainty_score":0.010768056},"labels":[],"label_agreement":null},{"id":"W2517990807","doi":"10.1007/978-3-319-46227-1_7","title":"Fast Hoeffding Drift Detection Method for Evolving Data Streams","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":146,"is_retracted":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":"Concept drift; Computer science; False positive paradox; Sliding window protocol; Data stream mining; Data stream; Detector; Streaming data; False positives and false negatives; Artificial intelligence; Data mining; False alarm; Task (project management); Probability distribution; Algorithm; Machine learning; Pattern recognition (psychology); Window (computing); Statistics; Mathematics; Telecommunications","score_opus":0.03581273767652872,"score_gpt":0.31020161263005547,"score_spread":0.27438887495352676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517990807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008933198,0.00067912176,0.9888952,0.00006089274,0.00010149647,0.000056217472,0.000094777235,0.000713806,0.00046536082],"genre_scores_gemma":[0.12351814,0.0010187917,0.86819,0.00008328512,0.00015670682,0.00013908847,0.0007314399,0.00021667551,0.005945935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915755,0.00008462184,0.00008028891,0.0001946966,0.0004094381,0.00007337776],"domain_scores_gemma":[0.9982185,0.00074847095,0.00011856532,0.00021113567,0.0006372235,0.0000662046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019255495,0.0011191261,0.0013548151,0.0023741233,0.0006437758,0.0010398097,0.001578703,0.00090483075,0.0020203863],"category_scores_gemma":[0.005403122,0.00048050444,0.00087964686,0.0018945688,0.00041486628,0.0014777348,0.000947918,0.0014430756,0.0008463725],"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.0003217833,0.00008909646,0.0021511703,0.00019330478,0.00010731937,0.00018296127,0.00012869693,0.056040615,0.022481594,0.006572018,0.005653096,0.9060784],"study_design_scores_gemma":[0.000021958675,0.000060661994,0.0009322723,0.00001610424,0.000033869077,0.00023284969,0.000017776369,0.9834292,0.009761933,0.00302264,0.0024512797,0.000019397896],"about_ca_topic_score_codex":0.0059564193,"about_ca_topic_score_gemma":0.007811715,"teacher_disagreement_score":0.0059564193,"about_ca_system_score_codex":0.0005672113,"about_ca_system_score_gemma":0.001531339,"threshold_uncertainty_score":0.0118435025},"labels":[],"label_agreement":null},{"id":"W2518021572","doi":"10.1007/978-3-319-48749-6_28","title":"Algorithms for Colourful Simplicial Depth and Medians in the Plane","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Plane (geometry); Artificial intelligence; Algorithm; Mathematics; Geometry","score_opus":0.0235490393444052,"score_gpt":0.2688589088595855,"score_spread":0.24530986951518033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518021572","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.014777111,0.0004832622,0.972377,0.0003441958,0.00011137282,0.00007137479,0.00031774066,0.001418798,0.010099121],"genre_scores_gemma":[0.16444561,0.00068804837,0.8195642,0.00021544585,0.0001299438,0.00014105589,0.00086404115,0.0010433549,0.0129081765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00011564173,0.00004595319,0.00016039654,0.00029616026,0.000120444514],"domain_scores_gemma":[0.998216,0.0008643803,0.00009993893,0.00040161418,0.00026868904,0.00014932183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109586,0.0012695151,0.0016728083,0.0020840366,0.0011257789,0.003918695,0.0029238625,0.0018188988,0.015436447],"category_scores_gemma":[0.0056801573,0.0010643192,0.0018900901,0.0020889363,0.0017868283,0.0060016382,0.005838967,0.0040541934,0.0032255673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023996446,0.0000948369,0.00067642017,0.00039916518,0.00006521601,0.000052717773,0.00048804167,0.083744295,0.004443291,0.6375763,0.013196338,0.2590235],"study_design_scores_gemma":[0.000044242744,0.000030195915,0.00012660494,0.000054258962,0.000020512505,0.000050009778,0.00012316462,0.25255814,0.0021864632,0.73663175,0.008148319,0.000026231488],"about_ca_topic_score_codex":0.0028074954,"about_ca_topic_score_gemma":0.005346945,"teacher_disagreement_score":0.015436447,"about_ca_system_score_codex":0.001982235,"about_ca_system_score_gemma":0.001040773,"threshold_uncertainty_score":0.051640034},"labels":[],"label_agreement":null},{"id":"W2518671462","doi":"10.1007/978-3-319-45814-4_26","title":"B-mine: Frequent Pattern Mining and Its Application to Knowledge Discovery from Social Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Computer science; Data mining; Knowledge extraction; Apriori algorithm; Association rule learning; Bitwise operation; Task (project management); Web mining; Data science; World Wide Web; Web service; Engineering","score_opus":0.015726858711528097,"score_gpt":0.2565420101448054,"score_spread":0.24081515143327728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518671462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051789377,0.003023207,0.9740622,0.0006775341,0.00017909317,0.00018525709,0.0040118606,0.010912905,0.0017690072],"genre_scores_gemma":[0.025454199,0.003053934,0.96369165,0.00022767771,0.00018229509,0.0004276834,0.004187468,0.0005669993,0.002208184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986118,0.00033250853,0.00017527683,0.00026070978,0.0005789017,0.00004078335],"domain_scores_gemma":[0.9945516,0.0041096793,0.00026004977,0.00047285183,0.00046513265,0.00014076248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023562731,0.0013817996,0.001719567,0.004567,0.0008455596,0.0024512736,0.0018819091,0.0014356333,0.0067877676],"category_scores_gemma":[0.012808528,0.0011196843,0.0012441641,0.0069226325,0.00052301615,0.0040952843,0.0019985274,0.0021409467,0.005992392],"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.00035810343,0.00025896914,0.0026232887,0.0016220937,0.00026046493,0.00044638346,0.0003448866,0.01586495,0.006143231,0.01981006,0.05115064,0.9011169],"study_design_scores_gemma":[0.0001768478,0.00024660054,0.0026280398,0.00033959612,0.00019789925,0.0023087272,0.00022531593,0.7148433,0.011726005,0.18306705,0.08411615,0.00012450949],"about_ca_topic_score_codex":0.001363426,"about_ca_topic_score_gemma":0.0016136026,"teacher_disagreement_score":0.0067877676,"about_ca_system_score_codex":0.00031556172,"about_ca_system_score_gemma":0.00096351566,"threshold_uncertainty_score":0.022707403},"labels":[],"label_agreement":null},{"id":"W2518924066","doi":"10.1007/978-3-319-46613-2_11","title":"Model-Driven Approach to the Optimal Configuration of Time-Triggered Flows in a TTEthernet Network","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Avionics; Metamodeling; Computer science; Control reconfiguration; Scheduling (production processes); Automation; Model transformation; Distributed computing; Ethernet; Embedded system; Engineering; Software engineering; Computer network","score_opus":0.02036381908507798,"score_gpt":0.23269234487448465,"score_spread":0.21232852578940667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518924066","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.014107819,0.00031992694,0.97797674,0.00023715531,0.00007696134,0.00005480147,0.00007020039,0.00015787376,0.0069984775],"genre_scores_gemma":[0.84222233,0.00072737323,0.14669871,0.00014007476,0.00008327847,0.00024009797,0.00015255736,0.00014595005,0.009589623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.00014010251,0.000013715579,0.000051608164,0.00010557424,0.000051917785],"domain_scores_gemma":[0.999476,0.00031249726,0.00004881729,0.00003220106,0.000084622094,0.000045915654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858539,0.0008215655,0.0009985889,0.00054646627,0.00046491873,0.0014236917,0.0016804794,0.0012657805,0.003670958],"category_scores_gemma":[0.0015882333,0.00077659485,0.0008885387,0.0005403282,0.00080194674,0.0009285051,0.0010353388,0.0011969341,0.00030159985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014553925,0.000010654817,0.000036192967,0.000016577933,0.000008342,0.000023098157,0.000012184323,0.9843056,0.00048392688,0.01242695,0.00016433894,0.0024975599],"study_design_scores_gemma":[0.0000024378971,0.0000047732524,0.000008794237,0.0000022296956,0.0000017285349,0.0000034872537,0.0000025159775,0.995017,0.000076446944,0.0047499915,0.00012883401,0.0000018482324],"about_ca_topic_score_codex":0.005834684,"about_ca_topic_score_gemma":0.006410505,"teacher_disagreement_score":0.005834684,"about_ca_system_score_codex":0.0015672513,"about_ca_system_score_gemma":0.0016835813,"threshold_uncertainty_score":0.012280583},"labels":[],"label_agreement":null},{"id":"W2519006193","doi":"10.1007/978-3-319-46466-4_48","title":"MeshFlow: Minimum Latency Online Video Stabilization","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Stabilization","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Smoothing; Computer vision; Image stabilization; Vertex (graph theory); Motion estimation; Affine transformation; Motion compensation; Algorithm; Theoretical computer science; Mathematics; Image (mathematics)","score_opus":0.016666343748696084,"score_gpt":0.250789282996139,"score_spread":0.23412293924744293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519006193","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.009087254,0.00095792656,0.9702159,0.00025061253,0.00034654106,0.000072991264,0.00031957222,0.008410854,0.010338251],"genre_scores_gemma":[0.41770765,0.0014274939,0.5469762,0.00034257188,0.000607715,0.000256539,0.0014975902,0.0019192604,0.029264942],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996822,0.00003329546,0.000017147619,0.0000745501,0.00014547784,0.00004728265],"domain_scores_gemma":[0.9996462,0.00014178123,0.000027452275,0.00007436542,0.00008222142,0.000027989292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036101654,0.00094205746,0.0005454529,0.00067657366,0.00048698063,0.0009156631,0.0012345703,0.00059523963,0.012258682],"category_scores_gemma":[0.0014864256,0.0003026896,0.00027191418,0.0006044109,0.00034641143,0.0013349564,0.0013406798,0.0010353768,0.0018669147],"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.00084837433,0.0001686745,0.0002649387,0.00021440661,0.000041156487,0.00009170866,0.000081673774,0.06889366,0.037708,0.047806423,0.048185065,0.79569596],"study_design_scores_gemma":[0.00010661981,0.0001332613,0.00021455708,0.00005705374,0.000028563336,0.00014815023,0.000027082142,0.88478065,0.036504876,0.054741584,0.023226136,0.000031443473],"about_ca_topic_score_codex":0.0013729549,"about_ca_topic_score_gemma":0.0016768993,"teacher_disagreement_score":0.012258682,"about_ca_system_score_codex":0.0006336014,"about_ca_system_score_gemma":0.0006543875,"threshold_uncertainty_score":0.041009367},"labels":[],"label_agreement":null},{"id":"W2519010794","doi":"10.1007/978-3-319-45738-3_14","title":"Fine Scale Spatio-Temporal Modelling of Urban Air Pollution","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Air Quality and Health Impacts","field":"Environmental 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 Calgary","funders":"Alberta Innovates - Technology Futures","keywords":"Spatial analysis; Scale (ratio); Air pollution; Environmental science; Statistics; Autocorrelation; Regression analysis; Linear regression; Meteorology; Spatial variability; Covariate; Temporal scales; Field (mathematics); Computer science; Econometrics; Geography; Cartography; Mathematics","score_opus":0.03720100564477313,"score_gpt":0.26246943832610226,"score_spread":0.22526843268132912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519010794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45714426,0.0020361205,0.51546174,0.0011013995,0.00033069504,0.00004504563,0.0035763127,0.001062795,0.019241594],"genre_scores_gemma":[0.97524637,0.00076662423,0.016876733,0.000049631413,0.000070485454,0.000031733067,0.00083194504,0.00008226953,0.006044191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999237,0.000013957294,0.000005839868,0.000024309824,0.000019664365,0.000012468952],"domain_scores_gemma":[0.9998234,0.00009972682,0.000019513342,0.000021352731,0.000023390678,0.000012708756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016473791,0.00037272315,0.00039082585,0.00028616737,0.00022995134,0.0007470467,0.00096405786,0.00070094154,0.0016582491],"category_scores_gemma":[0.0007017393,0.00037232786,0.000570341,0.00064552523,0.0003126218,0.0006144687,0.00067906454,0.00057086605,0.00026805262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010290416,0.000011366168,0.0010310648,0.000014490571,0.000022935428,0.000022674492,0.0000139875865,0.99157214,0.00083527004,0.0022534865,0.00027845922,0.003933945],"study_design_scores_gemma":[0.0000010442711,0.0000022581478,0.0006354522,0.0000012471355,0.0000026124396,0.000005500721,0.000004323144,0.99757355,0.00008724862,0.0014583963,0.00022633439,0.0000019948584],"about_ca_topic_score_codex":0.0308786,"about_ca_topic_score_gemma":0.02501423,"teacher_disagreement_score":0.0308786,"about_ca_system_score_codex":0.0006049414,"about_ca_system_score_gemma":0.00038892738,"threshold_uncertainty_score":0.06139773},"labels":[],"label_agreement":null},{"id":"W2519411279","doi":"10.1007/978-3-319-45738-3_10","title":"Scaling Behavior of Human Mobility Distributions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social 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":"University of Saskatchewan","funders":"","keywords":"Computer science; Aggregate (composite); Fidelity; Data mining; Data science","score_opus":0.02598913566841603,"score_gpt":0.31571364528719054,"score_spread":0.2897245096187745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519411279","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.66859376,0.004106182,0.284763,0.0022084708,0.0002387375,0.000119294324,0.00071653567,0.0012868579,0.03796721],"genre_scores_gemma":[0.9896293,0.00094459136,0.00517898,0.00008190961,0.00012172565,0.000055274908,0.00028441107,0.00014951649,0.0035541302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996321,0.0001406818,0.000010847327,0.000088971196,0.00007318089,0.00005413984],"domain_scores_gemma":[0.9954259,0.0028807018,0.0004452713,0.00044731938,0.0004824394,0.0003184372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010523204,0.00050254434,0.0005336183,0.0015605199,0.0005820534,0.0010653113,0.00087142334,0.0007402347,0.0037858281],"category_scores_gemma":[0.014970082,0.00042091656,0.0005045343,0.0008842638,0.0011630007,0.0017605342,0.00087450386,0.000995302,0.0005747174],"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.00028337148,0.00015639837,0.012988947,0.00051921426,0.00013428104,0.00083195383,0.002244651,0.30347577,0.019543208,0.5874625,0.015686661,0.056673072],"study_design_scores_gemma":[0.00002107794,0.00006108831,0.0086263055,0.00007598156,0.000025361496,0.0005326487,0.00036552647,0.83402735,0.0014835438,0.15171327,0.0030120222,0.000055759945],"about_ca_topic_score_codex":0.002398947,"about_ca_topic_score_gemma":0.0010804475,"teacher_disagreement_score":0.0037858281,"about_ca_system_score_codex":0.00084155187,"about_ca_system_score_gemma":0.00032617975,"threshold_uncertainty_score":0.0126648545},"labels":[],"label_agreement":null},{"id":"W2519444691","doi":"10.1007/978-3-319-46140-3_3","title":"Fault Tolerant P2P RIA Crawling","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Crawling; Computer science; Fault tolerance; Redundancy (engineering); Distributed computing; The Internet; Extensibility; Web crawler; Single point of failure; World Wide Web; Operating system","score_opus":0.016291097503407626,"score_gpt":0.24415604772643748,"score_spread":0.22786495022302986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519444691","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.10480452,0.0048150476,0.7450314,0.0017454021,0.0012598166,0.0010534864,0.0016865036,0.05704026,0.08256351],"genre_scores_gemma":[0.6032397,0.002456607,0.33480865,0.00052596605,0.0004718269,0.0003722377,0.00460827,0.001929139,0.051587585],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823654,0.00026089285,0.00012202266,0.000297138,0.00090398535,0.00017937522],"domain_scores_gemma":[0.9965563,0.00063131977,0.00018486432,0.0015793496,0.0008917456,0.00015646855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082482083,0.0010099376,0.0012402129,0.002913375,0.0019977174,0.0031554564,0.0024941664,0.0017959627,0.0035745555],"category_scores_gemma":[0.0044866805,0.00057140744,0.00066556624,0.00327023,0.0005623692,0.0033173207,0.0026628724,0.0012089332,0.0039757164],"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.00051280885,0.00051449245,0.0034502984,0.0010004047,0.00018584204,0.0013967481,0.00046103506,0.03776359,0.039419785,0.025541468,0.08641259,0.803341],"study_design_scores_gemma":[0.00009536408,0.00026780443,0.0029561748,0.000116505806,0.00016036011,0.004112982,0.0004026483,0.7895729,0.060500927,0.040466473,0.101255044,0.00009281622],"about_ca_topic_score_codex":0.0023210933,"about_ca_topic_score_gemma":0.0033339951,"teacher_disagreement_score":0.0035745555,"about_ca_system_score_codex":0.0005753831,"about_ca_system_score_gemma":0.001071547,"threshold_uncertainty_score":0.011958063},"labels":[],"label_agreement":null},{"id":"W2519464461","doi":"10.1007/978-3-319-45814-4_39","title":"CoDS: Co-training with Domain Similarity for Cross-Domain Image Sentiment Classification","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"York University","funders":"","keywords":"Computer science; Similarity (geometry); Domain (mathematical analysis); Weighting; Image (mathematics); Artificial intelligence; Pattern recognition (psychology); Set (abstract data type); Training set; Sentiment analysis; Contextual image classification; Machine learning; Mathematics","score_opus":0.03762484011830417,"score_gpt":0.3087592115937882,"score_spread":0.271134371475484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519464461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06230584,0.0018833736,0.8742275,0.00045867654,0.001061599,0.0005947462,0.0042839167,0.048992194,0.0061921333],"genre_scores_gemma":[0.23848675,0.0006153387,0.7198565,0.0006346261,0.0003131472,0.0007499602,0.02275371,0.002136352,0.014453587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869895,0.0002465068,0.00010068696,0.00046605596,0.00029875722,0.00018905975],"domain_scores_gemma":[0.99813974,0.0006069588,0.000098181335,0.00046004972,0.00057057774,0.00012448613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025601876,0.0022336885,0.0016908395,0.0024093462,0.00089957414,0.0012916932,0.002289907,0.0019541737,0.009387352],"category_scores_gemma":[0.0040148515,0.00066608563,0.0017053612,0.002347055,0.00050584454,0.0020646516,0.0029123458,0.0023596112,0.007890091],"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.00066083187,0.00049856,0.0027340208,0.00022586314,0.00030229593,0.00013006844,0.00009075219,0.009178821,0.020995017,0.0010889875,0.059111785,0.9049829],"study_design_scores_gemma":[0.00016269104,0.00038275355,0.0031719962,0.000059812235,0.00017239504,0.00025186548,0.00020966584,0.94631165,0.026387388,0.0045209415,0.018316602,0.000052156818],"about_ca_topic_score_codex":0.00514073,"about_ca_topic_score_gemma":0.009993283,"teacher_disagreement_score":0.009387352,"about_ca_system_score_codex":0.00060337083,"about_ca_system_score_gemma":0.0011612871,"threshold_uncertainty_score":0.03140378},"labels":[],"label_agreement":null},{"id":"W2519597608","doi":"10.1007/978-3-319-46487-9_45","title":"Learning High-Order Filters for Efficient Blind Deconvolution of Document Photographs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":47,"is_retracted":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":"Deblurring; Computer science; Deconvolution; Computer vision; Blind deconvolution; Artificial intelligence; Kernel (algebra); Scale (ratio); Motion blur; Image restoration; Computer graphics (images); Image (mathematics); Image processing; Algorithm","score_opus":0.011231712334776505,"score_gpt":0.2663833764137624,"score_spread":0.25515166407898593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519597608","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.004140757,0.00019745479,0.9946138,0.00003860519,0.000018717004,0.000014089411,0.000038510207,0.00042553584,0.00051238475],"genre_scores_gemma":[0.060860075,0.0008216835,0.9316656,0.00006203992,0.000049024202,0.00005814183,0.00031347954,0.00015907247,0.0060108285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00006186044,0.000024081854,0.000079158825,0.00014191684,0.000045330376],"domain_scores_gemma":[0.99936265,0.0002792211,0.000054819848,0.00013541114,0.00013956548,0.00002827026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057846186,0.00089868746,0.00074192113,0.00076705735,0.0002883504,0.0009882833,0.0009196071,0.0012628783,0.004167776],"category_scores_gemma":[0.0019667288,0.00052342284,0.0010351307,0.00075143774,0.00068374054,0.0014717872,0.0011534278,0.0016655647,0.002957232],"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.00029882044,0.00010690007,0.00033890095,0.00030952378,0.00006700202,0.00008274048,0.00009338495,0.069716744,0.15060613,0.010841459,0.0042292387,0.76330906],"study_design_scores_gemma":[0.000020007581,0.00008288728,0.0004997366,0.00002469021,0.000036175876,0.00026202344,0.000033376717,0.90434927,0.08045984,0.008914244,0.0052930266,0.000024681949],"about_ca_topic_score_codex":0.0020698258,"about_ca_topic_score_gemma":0.0038570063,"teacher_disagreement_score":0.004167776,"about_ca_system_score_codex":0.0004829031,"about_ca_system_score_gemma":0.0008125582,"threshold_uncertainty_score":0.01394254},"labels":[],"label_agreement":null},{"id":"W2519746390","doi":"10.1007/978-3-319-46604-0_7","title":"Road Segmentation for Classification of Road Weather Conditions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Road surface; Segmentation; Artificial intelligence; Computer vision; Snow; Snow removal; Image segmentation; Point (geometry); Contextual image classification; Point cloud; Image (mathematics); Remote sensing; Meteorology; Geology; Geography; Mathematics","score_opus":0.014254298039820534,"score_gpt":0.2510576908151836,"score_spread":0.23680339277536305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519746390","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.06854618,0.006448153,0.86383235,0.00027263348,0.00062414043,0.00032083233,0.009164157,0.015079077,0.035712495],"genre_scores_gemma":[0.37653136,0.0056755305,0.5416627,0.00023936454,0.00041497019,0.00025138966,0.027714167,0.001433666,0.046076868],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978346,0.000012397736,0.000009717842,0.000089965775,0.00005756014,0.000046888177],"domain_scores_gemma":[0.9998598,0.000030317113,0.000013231234,0.000025221843,0.00005849966,0.000012862441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021438635,0.0010810519,0.00077738747,0.0020751099,0.0003558382,0.0009621937,0.0008648406,0.00085973827,0.008241568],"category_scores_gemma":[0.00030655155,0.00040003538,0.00090755837,0.002074634,0.0001852632,0.00071412703,0.00041658903,0.0005335184,0.008192062],"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.00015726913,0.000098131684,0.0022012854,0.0003024012,0.00007279624,0.0001129255,0.000078428195,0.010122466,0.056769088,0.0013594799,0.027729886,0.9009959],"study_design_scores_gemma":[0.00003894974,0.00028408962,0.04500271,0.0003224248,0.00041979717,0.0013012774,0.0003421279,0.6303529,0.1652888,0.015835794,0.14067028,0.00014086369],"about_ca_topic_score_codex":0.005038809,"about_ca_topic_score_gemma":0.008843484,"teacher_disagreement_score":0.008241568,"about_ca_system_score_codex":0.0002967502,"about_ca_system_score_gemma":0.0004866456,"threshold_uncertainty_score":0.027570784},"labels":[],"label_agreement":null},{"id":"W2519963891","doi":"10.1007/978-3-319-46448-0_26","title":"A Software Platform for Manipulating the Camera Imaging Pipeline","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":167,"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":"Pipeline (software); Computer science; Software; Context (archaeology); Computer graphics (images); Digital camera; Component (thermodynamics); Computer vision; Artificial intelligence; Smart camera; Computer hardware; Digital imaging; Image processing; Embedded system; Real-time computing; Image (mathematics); Digital image; Operating system","score_opus":0.023706758794078252,"score_gpt":0.2790373536155226,"score_spread":0.2553305948214444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519963891","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035143432,0.00018768328,0.8982518,0.000096384225,0.00017889064,0.0002589071,0.0008667688,0.08184829,0.014796917],"genre_scores_gemma":[0.062814295,0.0006618652,0.8458701,0.00033979988,0.00011348932,0.0007584227,0.003853778,0.025535833,0.060052536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995938,0.000019460342,0.000023825945,0.00008054757,0.00023552061,0.00004696045],"domain_scores_gemma":[0.99943215,0.00017335199,0.000038135506,0.00015400992,0.0001408764,0.00006149206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045439866,0.0014619095,0.00062560866,0.001171679,0.00055328524,0.0013070095,0.0022341413,0.0010723074,0.057488255],"category_scores_gemma":[0.0013173003,0.0013034702,0.00085646077,0.0007134502,0.0004016652,0.0014224376,0.0019065075,0.0018876529,0.021430891],"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.00041469364,0.00022651373,0.0010150931,0.00076452136,0.0001200646,0.00054889667,0.00042065262,0.008840665,0.27002707,0.02310547,0.11624048,0.5782759],"study_design_scores_gemma":[0.00026134282,0.00022363794,0.0026163396,0.00021150787,0.0001499069,0.0016453991,0.00008060538,0.16284649,0.32889608,0.016152516,0.4866951,0.00022103541],"about_ca_topic_score_codex":0.0014038595,"about_ca_topic_score_gemma":0.002029366,"teacher_disagreement_score":0.057488255,"about_ca_system_score_codex":0.0003748392,"about_ca_system_score_gemma":0.00083642936,"threshold_uncertainty_score":0.19231743},"labels":[],"label_agreement":null},{"id":"W2520057860","doi":"10.1007/978-3-319-46613-2_14","title":"Towards Rule-Based Detection of Design Patterns in Model Transformations","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Université de Montréal","funders":"","keywords":"Code refactoring; Computer science; Software design pattern; Design pattern; Structural pattern; Reuse; Programming language; Software engineering; Artificial intelligence; Software design; Software development; Software","score_opus":0.022069734340380256,"score_gpt":0.23528331574476063,"score_spread":0.21321358140438038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520057860","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.017972033,0.00024055276,0.97186375,0.00016411548,0.000044577595,0.00027046024,0.0004092721,0.0075157764,0.0015193922],"genre_scores_gemma":[0.11920162,0.00025847772,0.8766079,0.0001781131,0.000023258071,0.00021350349,0.0014949596,0.0007105187,0.001311704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924999,0.0015853877,0.00070729357,0.0012693127,0.0035506242,0.0003874583],"domain_scores_gemma":[0.98243755,0.008836589,0.001386981,0.0037415326,0.0033231466,0.00027420654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003550447,0.0014330244,0.0015740875,0.004038354,0.0005805856,0.0033601646,0.0032166003,0.0023584745,0.0022922517],"category_scores_gemma":[0.022388883,0.0010789627,0.0025589922,0.0020198624,0.001267087,0.003147789,0.003080372,0.003140281,0.0022978452],"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.00045383285,0.00078681065,0.011472559,0.0010498611,0.00030804574,0.0010376674,0.00084711734,0.044238407,0.07901164,0.021867372,0.007079705,0.831847],"study_design_scores_gemma":[0.000090977774,0.00020530527,0.0024441017,0.00023172375,0.00019852904,0.0009493754,0.00027739655,0.85493606,0.07819053,0.051888842,0.0105094705,0.000077570534],"about_ca_topic_score_codex":0.0025969232,"about_ca_topic_score_gemma":0.0045568105,"teacher_disagreement_score":0.004038354,"about_ca_system_score_codex":0.0007223523,"about_ca_system_score_gemma":0.0019734954,"threshold_uncertainty_score":0.018776774},"labels":[],"label_agreement":null},{"id":"W2520081143","doi":"10.1007/978-3-319-46487-9_5","title":"Evaluation of LBP and Deep Texture Descriptors with a New Robustness Benchmark","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":58,"is_retracted":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":"Local binary patterns; Computer science; Robustness (evolution); Convolutional neural network; Artificial intelligence; Pattern recognition (psychology); Computational complexity theory; Benchmark (surveying); Pooling; Feature extraction; Deep learning; Machine learning; Histogram; Image (mathematics); Algorithm","score_opus":0.023685476762316457,"score_gpt":0.2704795486172638,"score_spread":0.24679407185494734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520081143","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.74677473,0.009454765,0.21269111,0.0005972445,0.0012270648,0.00087518163,0.008499837,0.0077983667,0.012081705],"genre_scores_gemma":[0.875201,0.0013239876,0.09474307,0.00024243945,0.00020713838,0.00022284336,0.020036228,0.00049767544,0.0075257025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979341,0.00028124877,0.0001855195,0.00035762205,0.0010417689,0.00019978227],"domain_scores_gemma":[0.996283,0.001282698,0.0002733805,0.0006504751,0.0012725886,0.00023790472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022752406,0.0016530032,0.0012236295,0.0025854057,0.00038090427,0.0010831502,0.0013324623,0.0011726292,0.0037690396],"category_scores_gemma":[0.0070170793,0.0002625175,0.0008274257,0.0013090015,0.00052212155,0.0011246587,0.0012987019,0.00067515596,0.0013108847],"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.007346561,0.001954455,0.009167242,0.0014857617,0.00092751335,0.0003840808,0.000063109685,0.149733,0.118942045,0.001523292,0.02168947,0.6867834],"study_design_scores_gemma":[0.0004974108,0.0041699577,0.019403696,0.00009578868,0.00046538786,0.0007443327,0.000116093914,0.8817478,0.08564392,0.0012708947,0.005751466,0.000093349496],"about_ca_topic_score_codex":0.0056162374,"about_ca_topic_score_gemma":0.0046861307,"teacher_disagreement_score":0.0056162374,"about_ca_system_score_codex":0.0005077544,"about_ca_system_score_gemma":0.0006361912,"threshold_uncertainty_score":0.012608707},"labels":[],"label_agreement":null},{"id":"W2520099014","doi":"10.1007/978-3-319-45741-3_5","title":"Compiling Low Depth Circuits for Practical Secure Computation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Electronic circuit; Parallel computing; Theoretical computer science; Computer engineering; Algorithm; Computational science; Electrical engineering","score_opus":0.029169682674387333,"score_gpt":0.2940969697394751,"score_spread":0.2649272870650877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520099014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046802178,0.0014740673,0.89232945,0.00095955754,0.00047679208,0.00015435516,0.00035105602,0.007073998,0.05037859],"genre_scores_gemma":[0.5130625,0.0018690783,0.44111678,0.00064673537,0.00031540546,0.00028591065,0.0010792789,0.0031246531,0.0384997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944514,0.00009190711,0.000043690674,0.00012715967,0.0002127727,0.0000792146],"domain_scores_gemma":[0.9991061,0.00047992222,0.000035645324,0.00028115886,0.000074422496,0.000022770708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035177177,0.0009404576,0.0006517951,0.00070874684,0.00054672104,0.0013327764,0.00089556695,0.00060632185,0.013761153],"category_scores_gemma":[0.002432383,0.0006922431,0.00094554067,0.0008811866,0.0009239528,0.0032343976,0.002073857,0.002858262,0.0034139568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022305595,0.00010539734,0.00048180658,0.00091656286,0.000049211314,0.00018836302,0.00042516182,0.036012888,0.026392557,0.42618057,0.016009303,0.49301514],"study_design_scores_gemma":[0.000052940162,0.00011315106,0.00028940316,0.00017300321,0.00008557201,0.00026284638,0.0000868846,0.0715667,0.028043373,0.8411354,0.05815094,0.00003985294],"about_ca_topic_score_codex":0.00040099164,"about_ca_topic_score_gemma":0.0009419592,"teacher_disagreement_score":0.013761153,"about_ca_system_score_codex":0.00092171103,"about_ca_system_score_gemma":0.0006191688,"threshold_uncertainty_score":0.046035647},"labels":[],"label_agreement":null},{"id":"W2520230070","doi":"10.1007/978-3-319-45817-5_17","title":"Repair Singleton IDs on the Fly","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automated Road and Building Extraction","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":"York University","funders":"","keywords":"Singleton; Computer science; On the fly; Tree (set theory); Data mining; Artificial intelligence; Operating system","score_opus":0.011907214663623338,"score_gpt":0.21299197687018873,"score_spread":0.20108476220656538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520230070","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.02454713,0.0008998421,0.8871474,0.0008037705,0.0014365516,0.00049082504,0.0052115037,0.048857033,0.03060593],"genre_scores_gemma":[0.09102742,0.0006070604,0.8440905,0.00035848992,0.00011024911,0.00011438592,0.01099485,0.008958049,0.043738965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775416,0.00018057825,0.00021965006,0.0007107305,0.0009274294,0.00020751651],"domain_scores_gemma":[0.993447,0.0012393589,0.00027149136,0.003507775,0.0014038996,0.0001305733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001439265,0.0021840099,0.002419385,0.003909892,0.0016315876,0.0023995542,0.0034824214,0.0025588633,0.029333537],"category_scores_gemma":[0.008929912,0.001240021,0.0023927358,0.0028174664,0.000992649,0.005459293,0.0047215344,0.0021796986,0.030246299],"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.00033598495,0.00017471742,0.002382523,0.0010333754,0.00011722972,0.0009924056,0.00056908623,0.008226485,0.021905271,0.023432244,0.11165968,0.829171],"study_design_scores_gemma":[0.00006415816,0.0002581634,0.0025842784,0.000501418,0.00037150824,0.004833071,0.0016971387,0.13139708,0.15259635,0.26573431,0.43974236,0.00022006739],"about_ca_topic_score_codex":0.0025922193,"about_ca_topic_score_gemma":0.005165077,"teacher_disagreement_score":0.029333537,"about_ca_system_score_codex":0.00082270184,"about_ca_system_score_gemma":0.0016391324,"threshold_uncertainty_score":0.098130465},"labels":[],"label_agreement":null},{"id":"W2520304734","doi":"10.1007/978-3-319-46604-0_20","title":"Cell Counting by Regression Using Convolutional Neural Network","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":88,"is_retracted":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":"Convolutional neural network; Computer science; Artificial intelligence; Residual; Regression; Cell counting; Pattern recognition (psychology); Artificial neural network; Quantization (signal processing); Deep learning; Machine learning; Computer vision; Statistics; Cancer; Algorithm; Mathematics","score_opus":0.017181402904387112,"score_gpt":0.24176982211921175,"score_spread":0.22458841921482464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520304734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01707793,0.0008736151,0.97316587,0.00024122564,0.00012351223,0.000049756796,0.00043645446,0.005156763,0.0028748375],"genre_scores_gemma":[0.29759118,0.0016484967,0.66299933,0.00030995315,0.00021567511,0.00014957313,0.0022905169,0.0009994282,0.03379585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957174,0.000046043893,0.000022003202,0.00014829283,0.00013642797,0.00007549063],"domain_scores_gemma":[0.99903333,0.00032943877,0.000118294665,0.00016050863,0.00031124614,0.00004733224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009222145,0.0009729188,0.001219209,0.001594391,0.00032146383,0.0011738262,0.0024190524,0.0011021375,0.0039935145],"category_scores_gemma":[0.0019281023,0.00074106053,0.000849115,0.0015439264,0.00031239327,0.0009852228,0.0009829355,0.0012320505,0.004156609],"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.00019288044,0.0000859555,0.0049534854,0.00020346548,0.00014877947,0.00014453878,0.00006267796,0.15098532,0.045219433,0.0069952803,0.012801189,0.77820694],"study_design_scores_gemma":[0.000003383122,0.000011444669,0.0008192003,0.000009901231,0.000017646275,0.00006724617,0.0000056902577,0.9845458,0.010394333,0.0019071404,0.0022064915,0.000011726313],"about_ca_topic_score_codex":0.01040964,"about_ca_topic_score_gemma":0.013486046,"teacher_disagreement_score":0.01040964,"about_ca_system_score_codex":0.0010753665,"about_ca_system_score_gemma":0.00079803384,"threshold_uncertainty_score":0.02069813},"labels":[],"label_agreement":null},{"id":"W2520417227","doi":"10.1007/978-3-319-46433-6_1","title":"Analytic Solution of Fair Share Scheduling in Layered Queueing Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parameterized complexity; Scheduling (production processes); Weighted fair queueing; Scalability; Queueing theory; Fair queuing; Round-robin scheduling; Distributed computing; Solver; Proportionally fair; Mean value analysis; Dynamic priority scheduling; Mathematical optimization; Layered queueing network; Algorithm; Computer network; Quality of service; Mathematics","score_opus":0.01517167482556693,"score_gpt":0.2416346958652756,"score_spread":0.22646302103970867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520417227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02340955,0.0011281619,0.9628553,0.0005878248,0.00016033594,0.00004527407,0.00007226845,0.00018613189,0.0115551045],"genre_scores_gemma":[0.86086863,0.0019569271,0.12105051,0.00018822183,0.00031740425,0.00020801244,0.00017671708,0.00019284019,0.015040698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960715,0.00014140274,0.000011780085,0.000028460283,0.00013117674,0.00008002104],"domain_scores_gemma":[0.99884534,0.0007495855,0.00007527005,0.000053649524,0.00019613051,0.00008001597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013743286,0.00092023035,0.0008439742,0.00075925625,0.00064927083,0.0016832295,0.0016107376,0.0011751675,0.0030358557],"category_scores_gemma":[0.0073492066,0.0005731327,0.0006345329,0.000814265,0.0011770832,0.0016211948,0.0015189382,0.0014518932,0.00035314608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044998043,0.000031658357,0.00020909467,0.000059494083,0.000019693298,0.000038356477,0.00007942244,0.8371884,0.0011910078,0.15012999,0.0017235478,0.009284304],"study_design_scores_gemma":[0.000002907293,0.0000031163702,0.000021087893,0.0000048686093,0.000002301644,0.000003504384,0.000008149459,0.9767447,0.000060731887,0.022913529,0.00023236395,0.0000027561814],"about_ca_topic_score_codex":0.008771684,"about_ca_topic_score_gemma":0.004561995,"teacher_disagreement_score":0.008771684,"about_ca_system_score_codex":0.002395296,"about_ca_system_score_gemma":0.0020523788,"threshold_uncertainty_score":0.017441273},"labels":[],"label_agreement":null},{"id":"W2520788569","doi":"10.1007/978-3-319-45817-5_7","title":"Spica: A Path Bundling Model for Rational Route Recommendation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Heuristic; Rationality; Path (computing); Set (abstract data type); Graph; Artificial intelligence; Operations research; Simulation; Theoretical computer science; Computer network","score_opus":0.032704783676984726,"score_gpt":0.262412621856328,"score_spread":0.2297078381793433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520788569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006629229,0.00031179062,0.98617536,0.0003151276,0.00010964898,0.00014210677,0.0007131454,0.0015250535,0.0040784846],"genre_scores_gemma":[0.32836774,0.0008809204,0.6476045,0.00028054137,0.00022241657,0.0005394766,0.0020942392,0.0004966693,0.01951348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864715,0.0003953098,0.000077004486,0.00032804353,0.000400297,0.00015220462],"domain_scores_gemma":[0.9977053,0.0010268749,0.00012871603,0.00051535433,0.00047015506,0.00015363652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021768701,0.0010524362,0.0019863567,0.0018419693,0.0010523775,0.0027819446,0.0036952114,0.002087856,0.012134702],"category_scores_gemma":[0.007112958,0.00081379176,0.0015253635,0.0036440524,0.00078425626,0.0041898927,0.0013611349,0.0027410553,0.002896015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021605412,0.00017805549,0.00055476313,0.00011531637,0.00008470691,0.0000501186,0.00007703735,0.74303836,0.0007622481,0.10094478,0.017379476,0.13659902],"study_design_scores_gemma":[0.000008008981,0.000015911726,0.000024596313,0.0000044101957,0.000007460977,0.000008664803,0.0000046574287,0.9774046,0.00007947242,0.021413257,0.0010234416,0.0000054813795],"about_ca_topic_score_codex":0.031602148,"about_ca_topic_score_gemma":0.02747096,"teacher_disagreement_score":0.031602148,"about_ca_system_score_codex":0.0022578954,"about_ca_system_score_gemma":0.00313774,"threshold_uncertainty_score":0.06283641},"labels":[],"label_agreement":null},{"id":"W2521049266","doi":"","title":"The Purkinje System and Cardiac Geometry: Assessing Their Influence on the Paced Heart","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiovascular Function and Risk Factors","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Ventricle; Computer science; Context (archaeology); Interventricular septum; Orientation (vector space); Purkinje fibers; Cardiology; Internal medicine; Medicine; Geometry; Electrophysiology; Mathematics","score_opus":0.010627512035750172,"score_gpt":0.2497442823101699,"score_spread":0.23911677027441974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521049266","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.997244,0.00037221852,0.0010454315,0.000035180212,0.000012987094,0.000014780555,0.00020318876,0.000018844676,0.0010534014],"genre_scores_gemma":[0.99892694,0.0001609503,0.00058872637,0.000007030891,0.000035891364,0.000008720089,0.000096260905,0.000013289194,0.00016228692],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.000452095,0.000060023427,0.00013174643,0.00021410677,0.00005420043],"domain_scores_gemma":[0.9920236,0.0049469676,0.0013570057,0.00046759692,0.0003575812,0.0008472393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010002562,0.000636003,0.00051999534,0.0014184605,0.000237474,0.0009487818,0.0004068352,0.0006761279,0.0018701446],"category_scores_gemma":[0.0073956912,0.00028974758,0.0004862021,0.0013247146,0.00060022477,0.0006293896,0.0005827112,0.0006781039,0.0004827365],"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.0013302024,0.00008152138,0.98399055,0.000027779508,0.00015066404,0.00024861304,0.00013218251,0.00084626785,0.0021866306,0.0000759292,0.000075769916,0.010853809],"study_design_scores_gemma":[0.000010895337,0.00059211423,0.9957841,0.0000037371983,0.00009924259,0.00082164246,0.00015656992,0.0018471676,0.0004243128,0.00010215938,0.00014446088,0.000013609538],"about_ca_topic_score_codex":0.0010478182,"about_ca_topic_score_gemma":0.0011454282,"teacher_disagreement_score":0.0018701446,"about_ca_system_score_codex":0.00014518527,"about_ca_system_score_gemma":0.00027570777,"threshold_uncertainty_score":0.0062562823},"labels":[],"label_agreement":null},{"id":"W2521372618","doi":"10.1007/978-3-319-46282-0_19","title":"Information Rate for Fast Time-Domain Instrument Classification","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Pattern recognition (psychology); Entropy (arrow of time); Artificial intelligence; Feature (linguistics); Frequency domain; Feature vector; Feature extraction; Frame (networking); Time domain; Domain (mathematical analysis); Computer vision; Mathematics","score_opus":0.017836016172012265,"score_gpt":0.23208588035506775,"score_spread":0.21424986418305547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521372618","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.0042585754,0.0025400005,0.9896265,0.00023148161,0.00020939224,0.000040277602,0.00039501162,0.00091136445,0.0017873829],"genre_scores_gemma":[0.24981901,0.0061735413,0.7192525,0.00038368927,0.0013238598,0.0004935386,0.002780556,0.00077095407,0.019002354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725646,0.0008010814,0.0002324584,0.00048205035,0.000984387,0.00024367849],"domain_scores_gemma":[0.99188614,0.0054791435,0.00028333592,0.0013009857,0.00095603673,0.00009445147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048716688,0.0015932249,0.0020572208,0.0016463528,0.0006060653,0.0023184537,0.0024172901,0.0019440906,0.0067118956],"category_scores_gemma":[0.015497629,0.0006242736,0.0010276209,0.0020611815,0.00089414313,0.003419391,0.0018365496,0.0028767379,0.006259201],"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.0006919988,0.00011003191,0.00072625984,0.00045038282,0.00011002457,0.0001545425,0.00009392967,0.1329063,0.013620847,0.08332256,0.016277397,0.7515357],"study_design_scores_gemma":[0.000015572434,0.00006356477,0.0005906203,0.00006319973,0.000035576373,0.00015905769,0.000022842127,0.9441508,0.0067848796,0.04350093,0.004566533,0.000046420253],"about_ca_topic_score_codex":0.0022960945,"about_ca_topic_score_gemma":0.0013866712,"teacher_disagreement_score":0.0067118956,"about_ca_system_score_codex":0.0010287149,"about_ca_system_score_gemma":0.0011269281,"threshold_uncertainty_score":0.025764167},"labels":[],"label_agreement":null},{"id":"W2521519773","doi":"10.1007/978-3-319-46298-1_30","title":"Detecting Malicious URLs Using Lexical Analysis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":187,"is_retracted":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":"Computer science; Blacklisting; Obfuscation; Malware; Set (abstract data type); Domain name; Phishing; Honeypot; Categorization; Computer security; Blacklist; World Wide Web; The Internet; Domain (mathematical analysis); Information retrieval; Artificial intelligence","score_opus":0.025209224351241396,"score_gpt":0.26156344806675813,"score_spread":0.23635422371551673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521519773","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.62103,0.0069089746,0.32644683,0.0009552847,0.0006783978,0.0007088881,0.0053787674,0.011468474,0.026424306],"genre_scores_gemma":[0.841626,0.0016564443,0.14198081,0.00026546133,0.00045937914,0.00020391028,0.0066237203,0.00045398992,0.0067303423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986304,0.00025243103,0.00018773075,0.00024054632,0.0005480934,0.00014077814],"domain_scores_gemma":[0.9971233,0.0012157517,0.0003446956,0.00019700063,0.0009826286,0.00013652875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067323254,0.0008984991,0.0010255376,0.0126124425,0.001207337,0.0025560886,0.0005992091,0.0010642821,0.0028045038],"category_scores_gemma":[0.0040679136,0.0004041583,0.0008217577,0.0051455633,0.0005630447,0.003415811,0.001291599,0.00068333664,0.0042011626],"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.00040988423,0.00072434964,0.049009472,0.00093335763,0.00023733889,0.0017587333,0.0007128908,0.0024038895,0.1426568,0.00542727,0.01805537,0.7776706],"study_design_scores_gemma":[0.00013889253,0.001080695,0.13876942,0.0006590653,0.0012630364,0.010428187,0.0035432612,0.6032651,0.13144854,0.04814289,0.06088274,0.00037823775],"about_ca_topic_score_codex":0.0015071593,"about_ca_topic_score_gemma":0.0026973123,"teacher_disagreement_score":0.0126124425,"about_ca_system_score_codex":0.00036143773,"about_ca_system_score_gemma":0.00053650286,"threshold_uncertainty_score":0.009382069},"labels":[],"label_agreement":null},{"id":"W2522416408","doi":"10.1007/978-3-319-46976-8_11","title":"De-noising of Contrast-Enhanced MRI Sequences by an Ensemble of Expert Deep Neural Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Dynamic contrast-enhanced MRI; Artificial neural network; Noise (video); Pattern recognition (psychology); Classifier (UML); Contrast (vision); Magnetic resonance imaging; Image (mathematics)","score_opus":0.017132619864892125,"score_gpt":0.27470119653081077,"score_spread":0.25756857666591865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522416408","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.024041215,0.00083222624,0.97294486,0.00013867978,0.00010066266,0.000029751625,0.000054474185,0.0003022385,0.0015558959],"genre_scores_gemma":[0.38237682,0.0016907612,0.6015826,0.00035955905,0.00017804031,0.0000693841,0.00040597274,0.0001781164,0.01315884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984396,0.000022003109,0.000012482413,0.00004172837,0.00005490293,0.000024873865],"domain_scores_gemma":[0.9996828,0.000115232964,0.000035365938,0.00003967277,0.00010474555,0.000022152346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007896056,0.000784531,0.00067275343,0.00040673668,0.00018315043,0.0006120796,0.0006722846,0.001170409,0.0011042152],"category_scores_gemma":[0.0012484399,0.00044905767,0.0006855318,0.0003574912,0.00033320062,0.00074854353,0.00066976016,0.0011273151,0.0004012794],"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.0004361888,0.00013249689,0.0007769675,0.00025103742,0.00016647117,0.00024584477,0.00009647944,0.3116954,0.15201707,0.0053397776,0.0023233325,0.5265189],"study_design_scores_gemma":[0.0000056498648,0.0000677177,0.00050891837,0.000017035814,0.000044113774,0.00012867179,0.000009654996,0.9721934,0.023938354,0.001773348,0.0012989237,0.000014136744],"about_ca_topic_score_codex":0.0018129704,"about_ca_topic_score_gemma":0.004733486,"teacher_disagreement_score":0.0018129704,"about_ca_system_score_codex":0.00028952555,"about_ca_system_score_gemma":0.00058592035,"threshold_uncertainty_score":0.0041759014},"labels":[],"label_agreement":null},{"id":"W2522502315","doi":"10.1007/978-3-319-46843-3_10","title":"First Impressions - Predicting User Personality from Twitter Profile Images","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Personality; Artificial intelligence; Human–computer interaction; Psychology; Psychoanalysis","score_opus":0.02035353328368209,"score_gpt":0.25054826701558935,"score_spread":0.23019473373190727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522502315","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.966906,0.0009464068,0.019827662,0.00022030096,0.00020275885,0.00011589289,0.005017349,0.0010934011,0.0056701913],"genre_scores_gemma":[0.98384225,0.0002852584,0.007974272,0.000036421086,0.000114045855,0.00004270573,0.0025593098,0.000030386525,0.005115433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997818,0.000032987096,0.000010571865,0.000044068427,0.00007731241,0.000053260188],"domain_scores_gemma":[0.999366,0.00016036391,0.00010107748,0.000060366998,0.00018643886,0.0001258041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030802636,0.00058783626,0.00040684274,0.001183923,0.0002498809,0.0005324985,0.00031035152,0.00040010043,0.0028212122],"category_scores_gemma":[0.0013338183,0.00017988677,0.000499511,0.00058425526,0.00009051538,0.00054447167,0.00042376455,0.00038200757,0.0041126194],"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.0021088421,0.0008464189,0.4309398,0.00026407276,0.0003247254,0.0003681546,0.00026296725,0.005015978,0.040688336,0.00024791877,0.021067025,0.49786583],"study_design_scores_gemma":[0.0000237332,0.0007116919,0.73660266,0.00003506132,0.00013937792,0.0009768524,0.0004176765,0.24358156,0.014392076,0.00042869564,0.0026244768,0.00006609742],"about_ca_topic_score_codex":0.0045124823,"about_ca_topic_score_gemma":0.010983364,"teacher_disagreement_score":0.0045124823,"about_ca_system_score_codex":0.00025851367,"about_ca_system_score_gemma":0.00015542842,"threshold_uncertainty_score":0.009437859},"labels":[],"label_agreement":null},{"id":"W2522537045","doi":"10.1007/978-3-319-46982-9_15","title":"nfer – A Notation and System for Inferring Event Stream Abstractions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Programming language; Event (particle physics); Scala; Notation; Digital subscriber line; Datalog; Process (computing); Java","score_opus":0.03249337382863028,"score_gpt":0.29262665324248033,"score_spread":0.26013327941385006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522537045","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.00063034013,0.00004243601,0.98244274,0.000041566636,0.000038855447,0.00004681273,0.0005903806,0.015342836,0.0008240259],"genre_scores_gemma":[0.019499008,0.00025190238,0.970191,0.000102802434,0.00006298815,0.00018575038,0.0030147245,0.0032385557,0.003453229],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784887,0.00047446336,0.0003611169,0.0005423885,0.0006590231,0.00011417154],"domain_scores_gemma":[0.99567986,0.0020507702,0.00039107027,0.0012612146,0.00048725397,0.00012975525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172899,0.0020014674,0.0011043967,0.0034645298,0.0011923199,0.0044945846,0.0036797114,0.0019175383,0.014106974],"category_scores_gemma":[0.013622207,0.0015703727,0.0021276698,0.0017185106,0.0014820985,0.007887737,0.0039413893,0.0030406148,0.0069838297],"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.0006422692,0.00017646072,0.0041894633,0.0012894078,0.00023731735,0.0009975014,0.0019667048,0.04424044,0.020482983,0.3327327,0.054107513,0.5389371],"study_design_scores_gemma":[0.00012201913,0.00009698283,0.00069992326,0.00043274846,0.00017686488,0.0009703747,0.00020884363,0.37860563,0.044273283,0.25349855,0.32071897,0.00019592397],"about_ca_topic_score_codex":0.0046332157,"about_ca_topic_score_gemma":0.0050705383,"teacher_disagreement_score":0.014106974,"about_ca_system_score_codex":0.0007635804,"about_ca_system_score_gemma":0.0021864616,"threshold_uncertainty_score":0.047192454},"labels":[],"label_agreement":null},{"id":"W2522612997","doi":"10.1007/978-3-319-46295-0_40","title":"A Study of the Energy Consumption of Databases and Cloud Patterns","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Polytechnique Montréal","funders":"","keywords":"Cloud computing; Database; Computer science; Energy consumption; Cloud database; Footprint; Popularity; Operating system; Engineering","score_opus":0.026823060217563952,"score_gpt":0.24938320544375403,"score_spread":0.22256014522619008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522612997","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.9459209,0.0039705257,0.033339515,0.00092939724,0.000033970042,0.000040518942,0.0010514861,0.00011450216,0.01459924],"genre_scores_gemma":[0.98794913,0.0008870316,0.0067248857,0.000042248634,0.000022823424,0.000017354352,0.0004162849,0.000059795402,0.003880413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.00015481022,0.000034659413,0.00012460152,0.00020841393,0.000059003993],"domain_scores_gemma":[0.99094874,0.0077599846,0.00032027037,0.0004744513,0.0003823412,0.00011416826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007612587,0.00029459404,0.0004060651,0.0010692242,0.00036179592,0.0015318394,0.0009838752,0.00050077436,0.0040805517],"category_scores_gemma":[0.0077083437,0.00033332835,0.0006302152,0.004158633,0.00049034646,0.0028768103,0.00043744032,0.0005848812,0.00027735953],"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.0015447228,0.0012902692,0.23425502,0.00080398214,0.0005344231,0.0009319367,0.0017050732,0.18848105,0.014911802,0.1660302,0.0064162007,0.3830953],"study_design_scores_gemma":[0.000037147936,0.0004407871,0.15383318,0.00008924007,0.00022736064,0.0016885224,0.0024116028,0.74393624,0.00806371,0.0792458,0.00996558,0.00006081994],"about_ca_topic_score_codex":0.004644495,"about_ca_topic_score_gemma":0.0045074406,"teacher_disagreement_score":0.004644495,"about_ca_system_score_codex":0.0012951572,"about_ca_system_score_gemma":0.00039674513,"threshold_uncertainty_score":0.013650835},"labels":[],"label_agreement":null},{"id":"W2522678032","doi":"10.1007/978-3-642-12659-8","title":"High Performance Computing Systems and Applications","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer architecture","score_opus":0.009466674454298352,"score_gpt":0.2385303856430876,"score_spread":0.22906371118878924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522678032","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030465059,0.07694,0.21440971,0.0039391527,0.018950528,0.00028730574,0.0011782151,0.0051179826,0.67613065],"genre_scores_gemma":[0.00914619,0.029665,0.039243136,0.00094142166,0.0028763318,0.0001722628,0.0010263043,0.0009300204,0.9159993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996259,0.000029692948,0.000014400672,0.000045977587,0.00026076037,0.000023180975],"domain_scores_gemma":[0.99950683,0.000126423,0.000021686134,0.00008927535,0.0002018566,0.000053971813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028198326,0.0015876052,0.0012485666,0.0012251607,0.0006636411,0.0022033942,0.0010651534,0.00085097144,0.08372239],"category_scores_gemma":[0.0010687577,0.0005903848,0.00034045565,0.0028729376,0.00047567335,0.0022147305,0.0014021085,0.0022343092,0.06764051],"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.000043923636,0.000055701395,0.00010780444,0.00048512995,0.000026303396,0.00007135985,0.000060878498,0.0019743745,0.0044163247,0.03467409,0.49418038,0.4639038],"study_design_scores_gemma":[0.000009284378,0.00003804432,0.00035279812,0.00012353863,0.00001520655,0.00024065604,0.00002280567,0.00521572,0.0014500654,0.022137305,0.9703802,0.000014311331],"about_ca_topic_score_codex":0.00049533666,"about_ca_topic_score_gemma":0.0008813282,"teacher_disagreement_score":0.08372239,"about_ca_system_score_codex":0.0004470258,"about_ca_system_score_gemma":0.00070844026,"threshold_uncertainty_score":0.28007925},"labels":[],"label_agreement":null},{"id":"W2522783957","doi":"10.1007/978-3-319-46298-1_25","title":"A New Adaptable Construction of Modulo Addition with Scalable Security for Stream Ciphers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Toronto Metropolitan University","funders":"","keywords":"Stream cipher; Computer science; Modulo; S-box; Theoretical computer science; Cryptanalysis; Cryptography; Probabilistic logic; Scalability; Advanced Encryption Standard; Polynomial; Differential cryptanalysis; Algorithm; Block cipher; Discrete mathematics; Mathematics; Database","score_opus":0.009222008055489535,"score_gpt":0.2080644522710631,"score_spread":0.19884244421557357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522783957","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.03264606,0.00063449726,0.9477684,0.0003564149,0.00042109957,0.0002038638,0.00018399741,0.001745088,0.016040536],"genre_scores_gemma":[0.3744929,0.0010165077,0.60239166,0.00041720597,0.000549778,0.0004260424,0.0005585322,0.0005300467,0.019617332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989611,0.00018949788,0.00009566868,0.00019038911,0.00042901456,0.0001343089],"domain_scores_gemma":[0.99926275,0.00021325186,0.000060515693,0.00031524125,0.00009131787,0.000056876237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139826,0.0012211138,0.0010478427,0.0011676262,0.0008456877,0.0016159281,0.0014270445,0.00072579936,0.005160289],"category_scores_gemma":[0.0019638033,0.00057426677,0.0011794891,0.00106061,0.0013746036,0.0031478174,0.0046181697,0.002288645,0.001727897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037375107,0.00014106477,0.00039943238,0.00025079114,0.00007500078,0.0003601248,0.00024315102,0.019260982,0.052865893,0.7071698,0.008148918,0.21071124],"study_design_scores_gemma":[0.00020437896,0.00043540343,0.00039690503,0.000106568616,0.00015452395,0.0009789158,0.00007059235,0.18729457,0.06232574,0.69534665,0.05257303,0.00011268841],"about_ca_topic_score_codex":0.0001648627,"about_ca_topic_score_gemma":0.0002947196,"teacher_disagreement_score":0.005160289,"about_ca_system_score_codex":0.0005867536,"about_ca_system_score_gemma":0.00069179793,"threshold_uncertainty_score":0.017262936},"labels":[],"label_agreement":null},{"id":"W2522855053","doi":"10.1007/978-3-319-46982-9_17","title":"Non-intrusive Runtime Monitoring Through Power Consumption: A Signals and System Analysis Approach to Reconstruct the Trace","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Tracing; Correctness; Power consumption; Control flow graph; Usability; Real-time computing; Programming language; Power (physics); Operating system","score_opus":0.01747646154158686,"score_gpt":0.25842699116771367,"score_spread":0.2409505296261268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522855053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018642012,0.00019437271,0.977472,0.0000792407,0.00002660897,0.000034292207,0.00015443661,0.002076665,0.0013204449],"genre_scores_gemma":[0.48199797,0.0006766283,0.50898916,0.000077476674,0.00008774143,0.00009464483,0.0006312999,0.00089080376,0.0065543773],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971575,0.000040010997,0.000014376387,0.00007583345,0.00011663273,0.000037273938],"domain_scores_gemma":[0.998955,0.00037357383,0.00015977203,0.00029476278,0.00017547676,0.00004123425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003621234,0.0015605926,0.0006374175,0.0022400294,0.00040249174,0.0012415573,0.001171621,0.0006545509,0.0022468881],"category_scores_gemma":[0.0021516483,0.0005246906,0.0007580178,0.001441214,0.00049900723,0.0016379522,0.0008325871,0.0015339346,0.0010880025],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033075034,0.00035630248,0.009545516,0.00034144905,0.00018318818,0.0005145156,0.00046491565,0.17265837,0.12791684,0.032403234,0.00377142,0.6515135],"study_design_scores_gemma":[0.00000591386,0.00009138089,0.0021826443,0.0000277284,0.00004567988,0.0002207005,0.000060778246,0.94767,0.026690034,0.020386953,0.002595828,0.000022461569],"about_ca_topic_score_codex":0.0014130567,"about_ca_topic_score_gemma":0.002316154,"teacher_disagreement_score":0.0022468881,"about_ca_system_score_codex":0.00034130545,"about_ca_system_score_gemma":0.0006236343,"threshold_uncertainty_score":0.007516563},"labels":[],"label_agreement":null},{"id":"W2522855956","doi":"10.1007/978-3-319-47103-7_3","title":"Computational Role of Astrocytes in Bayesian Inference and Probability Distribution Encoding","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"York University","funders":"","keywords":"Computer science; Encoding (memory); Bayesian probability; Inference; Probability distribution; Bayesian inference; Artificial intelligence; Bayesian network; Algorithm; Statistics; Mathematics","score_opus":0.015981909166461975,"score_gpt":0.2397786932779488,"score_spread":0.22379678411148682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522855956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032756817,0.0006223165,0.95624655,0.001186595,0.00014699525,0.000015551317,0.00012779089,0.00020618079,0.008691167],"genre_scores_gemma":[0.6332553,0.0013992025,0.35462812,0.0002838184,0.00029121112,0.00006463402,0.00030909476,0.00028762236,0.009480986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.00014851685,0.000030092477,0.00007004749,0.00010833401,0.000034288507],"domain_scores_gemma":[0.9967933,0.002299592,0.00016039559,0.0002654447,0.0003035269,0.00017768504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013776034,0.00039774246,0.0006910204,0.00047556433,0.00047464337,0.0023661207,0.0015122425,0.0011816494,0.0043542646],"category_scores_gemma":[0.009380871,0.0006415515,0.000750737,0.0006534745,0.0010733309,0.003421361,0.0015781651,0.0021441856,0.00079627376],"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.00018047677,0.000057844423,0.0015726,0.00015457325,0.00008337194,0.00022974178,0.00030932153,0.1886428,0.009317543,0.6996654,0.0035348425,0.09625143],"study_design_scores_gemma":[0.0000075053063,0.00001198062,0.00021413442,0.000013504437,0.000012635183,0.00008072806,0.000020312214,0.5671231,0.0017768702,0.42950594,0.0012206399,0.000012628594],"about_ca_topic_score_codex":0.0018651364,"about_ca_topic_score_gemma":0.0020115115,"teacher_disagreement_score":0.0043542646,"about_ca_system_score_codex":0.0005360278,"about_ca_system_score_gemma":0.000621519,"threshold_uncertainty_score":0.014566481},"labels":[],"label_agreement":null},{"id":"W2522956255","doi":"10.1007/978-3-319-46295-0_10","title":"Are REST APIs for Cloud Computing Well-Designed? An Exploratory Study","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Cloud computing; Rest (music); Computer science; Best practice; Representational state transfer; Application programming interface; Service provider; World Wide Web; Cloud service provider; Cloud computing security; Service (business); Operating system; Web service","score_opus":0.03082110297340137,"score_gpt":0.26183268440728863,"score_spread":0.23101158143388725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522956255","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.98014176,0.00044482134,0.0029118354,0.0012124153,0.000014312333,0.00010362868,0.00005478698,0.000019779029,0.015096718],"genre_scores_gemma":[0.99779403,0.00025960302,0.00084819633,0.00014409877,0.0000069232215,0.000025310403,0.00004187571,0.000018089771,0.00086194096],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9948283,0.0029033239,0.00020532306,0.00027720636,0.0012516852,0.00053432625],"domain_scores_gemma":[0.93846023,0.048207495,0.0059879343,0.0026216942,0.0035653438,0.0011572526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009186898,0.0002300588,0.00022422217,0.0006480881,0.0013349843,0.0039623096,0.00079327053,0.00066175574,0.0019027864],"category_scores_gemma":[0.044163942,0.0003336552,0.00029104328,0.0011571925,0.0024594094,0.0061900914,0.0012086062,0.0015067231,0.00044982458],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013661921,0.0032013168,0.43697563,0.0015461022,0.0001323171,0.0020021508,0.23354152,0.0013716498,0.010949532,0.054464277,0.0063373744,0.24811195],"study_design_scores_gemma":[0.00006422114,0.0019973502,0.4639327,0.0011892219,0.00017212628,0.0018944223,0.45792583,0.0066777696,0.0063375887,0.013120836,0.046622857,0.00006519211],"about_ca_topic_score_codex":0.0020042553,"about_ca_topic_score_gemma":0.0020070327,"teacher_disagreement_score":0.009186898,"about_ca_system_score_codex":0.0015095206,"about_ca_system_score_gemma":0.0018210827,"threshold_uncertainty_score":0.048585534},"labels":[],"label_agreement":null},{"id":"W2523180702","doi":"10.1007/978-3-319-46349-0_33","title":"IDA 2016 Industrial Challenge: Using Machine Learning for Predicting Failures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Classifier (UML); Random forest; Baseline (sea); Component (thermodynamics); Data mining","score_opus":0.03910668136540076,"score_gpt":0.2736425585978755,"score_spread":0.23453587723247474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523180702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18198325,0.026618464,0.54953504,0.036450904,0.01566776,0.0010071719,0.08178383,0.052074198,0.05487931],"genre_scores_gemma":[0.44666004,0.008971649,0.3493386,0.0034603106,0.0051041315,0.0008984981,0.134442,0.0033544097,0.047770396],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969009,0.00073882047,0.00023129924,0.00058329495,0.0012980709,0.00024758195],"domain_scores_gemma":[0.9916487,0.0038663824,0.0004664839,0.0015564329,0.0018867158,0.0005753922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060554524,0.002954156,0.002440346,0.0019913996,0.0008155692,0.0022956412,0.003918924,0.0035398467,0.005515192],"category_scores_gemma":[0.014957186,0.00055320875,0.0014757793,0.0019486572,0.0006559808,0.0025983094,0.0020401184,0.004148323,0.005858189],"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.0005075125,0.0006352491,0.0074849604,0.00096141105,0.00020284273,0.00022684856,0.00008552382,0.064953305,0.002954049,0.0044043,0.49620944,0.42137465],"study_design_scores_gemma":[0.00023571367,0.00075466366,0.0084682675,0.0002463854,0.00013381889,0.0006180055,0.0002302088,0.82124525,0.012557497,0.050195925,0.10519087,0.000123399],"about_ca_topic_score_codex":0.0038151972,"about_ca_topic_score_gemma":0.005350704,"teacher_disagreement_score":0.0060554524,"about_ca_system_score_codex":0.0010280164,"about_ca_system_score_gemma":0.0023682534,"threshold_uncertainty_score":0.03202474},"labels":[],"label_agreement":null},{"id":"W2523195045","doi":"10.1007/978-3-319-46520-3_19","title":"Observational Refinement and Merge for Disjunctive MTSs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Merge (version control); Alphabet; Computer science; Formalism (music); Theoretical computer science; Algorithm; Programming language; Information retrieval; Linguistics","score_opus":0.05876600179384918,"score_gpt":0.3025982328056963,"score_spread":0.24383223101184714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523195045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01196416,0.00022699623,0.97917914,0.00024328164,0.000074452306,0.00010245104,0.00015905926,0.0010516378,0.0069987276],"genre_scores_gemma":[0.35178998,0.00051649974,0.63374174,0.00023499796,0.00019722899,0.00025686444,0.0009223388,0.0007271231,0.0116132125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99359363,0.0014342364,0.0007694076,0.0012232643,0.002378957,0.00060051645],"domain_scores_gemma":[0.97746253,0.013478295,0.00096147624,0.005307705,0.0023189106,0.00047111616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063241376,0.0008271387,0.0011464205,0.0016978541,0.002039278,0.0025683225,0.002932695,0.001486282,0.008184871],"category_scores_gemma":[0.028682,0.0013213985,0.0032840518,0.002060188,0.0051039015,0.009161494,0.0072589386,0.004896634,0.0015438102],"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.00024828484,0.00006884437,0.0010600559,0.0003702041,0.0000648087,0.00027461452,0.0012753772,0.018715989,0.0056733023,0.88873833,0.0022744222,0.08123576],"study_design_scores_gemma":[0.00004498771,0.00004083311,0.00026599984,0.000058796646,0.00006800202,0.00015071734,0.00018682863,0.06699804,0.0063945344,0.9166325,0.009124459,0.000034331842],"about_ca_topic_score_codex":0.0035037666,"about_ca_topic_score_gemma":0.005243391,"teacher_disagreement_score":0.008184871,"about_ca_system_score_codex":0.0016094283,"about_ca_system_score_gemma":0.0021572278,"threshold_uncertainty_score":0.033445656},"labels":[],"label_agreement":null},{"id":"W2523451517","doi":"10.1007/978-3-319-46100-7_31","title":"Vancouver Maneuver: Designing a Cooperative Augmented Reality Board Game","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Augmented reality; Human–computer interaction; Software; Game design; Game mechanics; Power (physics); Multimedia; Order (exchange); Mobile device; Simulation; Computer graphics (images); World Wide Web","score_opus":0.023980487730328483,"score_gpt":0.26448251592980104,"score_spread":0.24050202819947256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523451517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14043021,0.0006959369,0.76683027,0.0004055177,0.00016115572,0.0014019766,0.00012442075,0.002147303,0.08780318],"genre_scores_gemma":[0.4820593,0.00074627623,0.45163924,0.00022545845,0.000030785566,0.0008586815,0.0003112071,0.000465525,0.063663416],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958414,0.00010178448,0.0000135726605,0.000059831615,0.0001814046,0.00005932808],"domain_scores_gemma":[0.9998204,0.00005887075,0.000010404821,0.000012825995,0.00004340721,0.000054204807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034898866,0.0009747136,0.00027215955,0.0005421152,0.0007477319,0.0018572721,0.001350376,0.00078296,0.005049952],"category_scores_gemma":[0.0008497289,0.00043227308,0.0002718486,0.00025157986,0.0007929614,0.001130983,0.001693342,0.0006785968,0.0011484437],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069345074,0.0010389012,0.0054539447,0.0012570164,0.0001343234,0.0033046799,0.016217677,0.048074614,0.18895708,0.13718127,0.030927643,0.5667594],"study_design_scores_gemma":[0.0003661173,0.0017839109,0.007912234,0.00034598293,0.00017241263,0.005229206,0.00697576,0.3056254,0.063826576,0.016579393,0.59086263,0.00032030646],"about_ca_topic_score_codex":0.008341314,"about_ca_topic_score_gemma":0.0129189575,"teacher_disagreement_score":0.008341314,"about_ca_system_score_codex":0.00054530415,"about_ca_system_score_gemma":0.00064928195,"threshold_uncertainty_score":0.016893744},"labels":[],"label_agreement":null},{"id":"W2524061821","doi":"10.1007/978-3-319-47160-0_16","title":"Definability in Incomplete Information Tables","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Satisfiability; Table (database); Interval (graph theory); Complete information; Computer science; Set (abstract data type); Decision table; Interpretation (philosophy); Discrete mathematics; Algorithm; Mathematics; Data mining; Combinatorics; Rough set; Programming language; Mathematical economics","score_opus":0.015463717995352622,"score_gpt":0.22426928459094028,"score_spread":0.20880556659558766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524061821","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.016170425,0.0036324812,0.9493886,0.0024535283,0.00024632073,0.00012300337,0.0009501253,0.00032131426,0.026714174],"genre_scores_gemma":[0.4330779,0.008019381,0.53329843,0.0010469079,0.0014305987,0.0006100791,0.0043602553,0.00030337038,0.017853102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944642,0.0021222606,0.0006353475,0.00074625394,0.0018037917,0.00022812362],"domain_scores_gemma":[0.98401535,0.012108771,0.00068947655,0.001783108,0.0011240538,0.00027921578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006172296,0.000765409,0.0015259854,0.002521333,0.0013792575,0.006819635,0.0021573664,0.0012423398,0.0065354803],"category_scores_gemma":[0.019327296,0.0011421813,0.001803223,0.0041812174,0.0034629842,0.016705189,0.0033774294,0.0045275977,0.0009758552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019763038,0.000015675652,0.0001552963,0.00013807375,0.000014229461,0.000053707776,0.00023846175,0.0045619686,0.0001993734,0.9706544,0.0018012617,0.022147832],"study_design_scores_gemma":[0.000006860762,0.0000072243074,0.000047204645,0.000051573184,0.00001173234,0.000047033256,0.000039538536,0.016591689,0.0003468493,0.9778439,0.004998821,0.000007718516],"about_ca_topic_score_codex":0.0009267702,"about_ca_topic_score_gemma":0.00074169465,"teacher_disagreement_score":0.006819635,"about_ca_system_score_codex":0.002347066,"about_ca_system_score_gemma":0.0011811559,"threshold_uncertainty_score":0.032642603},"labels":[],"label_agreement":null},{"id":"W2524451741","doi":"10.1007/978-3-319-47160-0_10","title":"On Optimal Approximations of Arbitrary Relations by Partial Orders","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"McMaster University","funders":"","keywords":"Simple (philosophy); Binary relation; Computer science; Relation (database); Property (philosophy); Binary number; Measure (data warehouse); Approximations of π; Applied mathematics; Order (exchange); Partial evaluation; Mathematical optimization; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Data mining","score_opus":0.01324519233052586,"score_gpt":0.2284379821306474,"score_spread":0.21519278980012152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524451741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097366184,0.0040800315,0.8498588,0.0017425107,0.00031750585,0.00009226536,0.00029357208,0.00024990982,0.0459992],"genre_scores_gemma":[0.5904154,0.005488179,0.38673764,0.00033433965,0.00041912077,0.00017885402,0.00083426473,0.0003142667,0.0152779585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639004,0.0013133583,0.00023945978,0.00039660136,0.001338106,0.00032235807],"domain_scores_gemma":[0.9940906,0.0041816924,0.00025796916,0.00085049216,0.00036262238,0.00025654671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030726066,0.0011659636,0.0023539707,0.0016495954,0.0009955533,0.004079182,0.0020260871,0.0013751186,0.0062635685],"category_scores_gemma":[0.014234657,0.0012909515,0.0019688332,0.0030758786,0.0037144877,0.008450947,0.003339155,0.004258771,0.00053069566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001218229,0.00004204919,0.00021212624,0.00015825627,0.000040670748,0.000049979382,0.00031200348,0.051626157,0.0006522312,0.9185055,0.0016119125,0.02666737],"study_design_scores_gemma":[0.000021043743,0.000028044933,0.000105015715,0.0000457613,0.00001953361,0.000035674504,0.00008745211,0.11321727,0.00033195026,0.8833527,0.0027440342,0.000011487061],"about_ca_topic_score_codex":0.0034670609,"about_ca_topic_score_gemma":0.0040507256,"teacher_disagreement_score":0.0062635685,"about_ca_system_score_codex":0.0037880784,"about_ca_system_score_gemma":0.0013958307,"threshold_uncertainty_score":0.027484596},"labels":[],"label_agreement":null},{"id":"W25248816","doi":"10.1007/978-3-642-34106-9_11","title":"Sauer’s Bound for a Notion of Teaching Complexity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Dimension (graph theory); Upper and lower bounds; Conjecture; Concept class; Algebraic number; VC dimension; Class (philosophy); Combinatorics; Mathematics; Set (abstract data type); Discrete mathematics; Computer science; Algebra over a field; Pure mathematics; Artificial intelligence","score_opus":0.033174358755898394,"score_gpt":0.2873352660319016,"score_spread":0.2541609072760032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25248816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019988988,0.003092252,0.5707431,0.014415285,0.001077517,0.000112968,0.0007152439,0.0009841548,0.38887048],"genre_scores_gemma":[0.68320084,0.0033503636,0.18826321,0.004041959,0.0019003905,0.0008601003,0.00084364956,0.001445978,0.11609343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946609,0.0011752667,0.00039913435,0.0014173279,0.0014996537,0.0008476317],"domain_scores_gemma":[0.9827132,0.011830727,0.0003700266,0.0029541594,0.0012074149,0.0009244373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036744967,0.0014569237,0.0017326098,0.003220988,0.004438885,0.005757415,0.0028014067,0.0050488,0.033180427],"category_scores_gemma":[0.018873608,0.0013369464,0.0035777707,0.0038833695,0.008649365,0.0246615,0.0068975906,0.009629636,0.005525713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015174692,0.000011786209,0.000051896182,0.000034732566,0.0000073489546,0.000009845023,0.00010899636,0.0005360243,0.00020287043,0.99152654,0.0022920787,0.005202726],"study_design_scores_gemma":[0.000009791798,0.000009469742,0.000100157136,0.000022468008,0.00001298096,0.00002791848,0.000030347479,0.002366852,0.00037361035,0.9880129,0.009018375,0.000015219544],"about_ca_topic_score_codex":0.0020862422,"about_ca_topic_score_gemma":0.0019583502,"teacher_disagreement_score":0.033180427,"about_ca_system_score_codex":0.0053490116,"about_ca_system_score_gemma":0.0022947972,"threshold_uncertainty_score":0.110999525},"labels":[],"label_agreement":null},{"id":"W252500959","doi":"10.1007/978-3-642-35139-6_28","title":"A Preliminary Study Using Granular Computing for Remote Sensing Image Segmentation Involving Roughness","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Calgary","funders":"","keywords":"Granular computing; Computer science; Image segmentation; Segmentation; Image processing; Artificial intelligence; Computer vision; Image (mathematics); Rough set","score_opus":0.03683949747874718,"score_gpt":0.28689251072397937,"score_spread":0.2500530132452322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W252500959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35418692,0.0045571374,0.6290875,0.0007490813,0.00032274995,0.00031322805,0.0002531248,0.0005444009,0.009985798],"genre_scores_gemma":[0.7938379,0.0017083753,0.20079678,0.0001181036,0.00016497038,0.00005215537,0.0002180529,0.00010456766,0.0029990897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999348,0.00017395259,0.000059076567,0.00014143392,0.00019605766,0.000081434046],"domain_scores_gemma":[0.9976174,0.0014587267,0.000091825954,0.0003297153,0.00041666726,0.00008560409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380727,0.00046034364,0.001039836,0.00088433205,0.00070368306,0.0025162594,0.0008978299,0.0008923418,0.002446983],"category_scores_gemma":[0.0044238456,0.0003536892,0.0010092417,0.0021398591,0.00079424813,0.0020524052,0.0006092582,0.0006527064,0.0002425904],"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.002811851,0.0009380531,0.012726167,0.0016295456,0.00042900085,0.0015363463,0.0010342101,0.21876673,0.23801896,0.058045477,0.0040500867,0.46001363],"study_design_scores_gemma":[0.00002908528,0.00040917294,0.0045043463,0.000045673598,0.000113151094,0.00028186402,0.0002768658,0.9477439,0.032058753,0.011167939,0.0033168842,0.000052387517],"about_ca_topic_score_codex":0.007357682,"about_ca_topic_score_gemma":0.003379735,"teacher_disagreement_score":0.007357682,"about_ca_system_score_codex":0.0006350112,"about_ca_system_score_gemma":0.0005336868,"threshold_uncertainty_score":0.014629722},"labels":[],"label_agreement":null},{"id":"W2525029050","doi":"10.1007/978-3-319-47160-0_1","title":"Advances in Rough and Soft Clustering: Meta-Clustering, Dynamic Clustering, Data-Stream Clustering","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms 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":"Cluster analysis; Computer science; Data mining; Fuzzy clustering; Data stream clustering; CURE data clustering algorithm; Canopy clustering algorithm; Correlation clustering; Consensus clustering; Conceptual clustering; Clustering high-dimensional data; Artificial intelligence; Machine learning","score_opus":0.04102602574981118,"score_gpt":0.3191668127387236,"score_spread":0.2781407869889124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525029050","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.002995321,0.048507523,0.93363357,0.0018424245,0.0015398277,0.000048541184,0.00023811283,0.0009087652,0.01028596],"genre_scores_gemma":[0.08529799,0.055124905,0.8335283,0.0008723324,0.0053931195,0.00014054129,0.0011828953,0.00082670205,0.0176332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980008,0.00039049666,0.000118875236,0.0004923665,0.00092884793,0.000068674446],"domain_scores_gemma":[0.9974026,0.0011317036,0.00012512447,0.00049231667,0.0007261626,0.000122174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025144431,0.0012517197,0.0021450887,0.002886254,0.0007411636,0.0038170624,0.002148704,0.0015894845,0.0034818952],"category_scores_gemma":[0.0056833546,0.0007885582,0.001515129,0.008076201,0.0014922724,0.004178528,0.0019799701,0.0040293573,0.0030890736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094761555,0.00009720982,0.0006767838,0.0015149259,0.00023853195,0.00008117491,0.00033435973,0.048607126,0.0044150115,0.18723518,0.054073945,0.70263106],"study_design_scores_gemma":[0.000021106223,0.00009620766,0.0013746361,0.0002631486,0.000114873146,0.0005644874,0.00019487366,0.3656381,0.0045428257,0.46139207,0.16566293,0.00013475025],"about_ca_topic_score_codex":0.0016249624,"about_ca_topic_score_gemma":0.001593249,"teacher_disagreement_score":0.0038170624,"about_ca_system_score_codex":0.0014273089,"about_ca_system_score_gemma":0.0012579999,"threshold_uncertainty_score":0.013297796},"labels":[],"label_agreement":null},{"id":"W2525089791","doi":"10.1007/978-3-319-46720-7_16","title":"Modularity Reinforcement for Improving Brain Subnetwork Extraction","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Subnetwork; Computer science; Artificial intelligence; Pattern recognition (psychology); Thresholding; Power graph analysis; Modularity (biology); Graph; Theoretical computer science","score_opus":0.03282624050827628,"score_gpt":0.2706241298319952,"score_spread":0.2377978893237189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525089791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02240012,0.00047029436,0.97054076,0.00022137177,0.00011801293,0.000055625926,0.00016103557,0.0034853998,0.002547381],"genre_scores_gemma":[0.39594278,0.00035974596,0.593609,0.00023422626,0.00020386584,0.00012697854,0.00080186356,0.0012735396,0.0074481154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959034,0.00008476424,0.000017893723,0.00013219629,0.00011354538,0.00006133784],"domain_scores_gemma":[0.99884677,0.00054201804,0.00007959581,0.00025738063,0.00020842602,0.00006590109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076758675,0.0013975452,0.0011319639,0.0014386612,0.000536666,0.0006018061,0.0019068759,0.0013248937,0.0063806553],"category_scores_gemma":[0.0038484272,0.0004851459,0.0010613595,0.0010759153,0.0006456373,0.0014599875,0.0019160933,0.001287357,0.0017569572],"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.00031685844,0.00013455102,0.0012180314,0.000226104,0.00018179823,0.0001968683,0.000109113425,0.16567653,0.04163782,0.014909961,0.012193291,0.7631991],"study_design_scores_gemma":[0.000025405408,0.00006239489,0.0006072276,0.000018142076,0.000053621206,0.00013197615,0.0000143171155,0.97326046,0.00862464,0.015278161,0.001912005,0.000011675888],"about_ca_topic_score_codex":0.0022766818,"about_ca_topic_score_gemma":0.004733066,"teacher_disagreement_score":0.0063806553,"about_ca_system_score_codex":0.0005287434,"about_ca_system_score_gemma":0.00048798177,"threshold_uncertainty_score":0.021345377},"labels":[],"label_agreement":null},{"id":"W2525576299","doi":"10.1007/978-3-319-46723-8_39","title":"Automated Diagnosis of Neural Foraminal Stenosis Using Synchronized Superpixels Representation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Pattern recognition (psychology); Margin (machine learning); Discriminative model; Class (philosophy); Feature (linguistics); Representation (politics); Sagittal plane; Feature vector; Artificial neural network; Computer vision; Radiology; Medicine; Machine learning","score_opus":0.021402687116610534,"score_gpt":0.27038126886148034,"score_spread":0.2489785817448698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525576299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079399586,0.002280443,0.9129902,0.00025438395,0.0001183142,0.000108864726,0.0004408612,0.0016071139,0.0028001713],"genre_scores_gemma":[0.41796845,0.0021353667,0.57487947,0.0001511523,0.00021645303,0.0000787904,0.000965851,0.00033144373,0.003273005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997775,0.00003184385,0.000013533611,0.00005317358,0.00008917476,0.000034745804],"domain_scores_gemma":[0.99975437,0.00007469882,0.00003188013,0.000042546766,0.000077641744,0.000018995815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044203363,0.00065425277,0.00054899673,0.0015307283,0.00018748379,0.0009666156,0.00067490665,0.0008547201,0.0018135804],"category_scores_gemma":[0.0008820216,0.00039146945,0.00059759954,0.00078636553,0.00022097792,0.0008422177,0.0005843048,0.00044236204,0.000863814],"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.00039096974,0.000088964734,0.0028934164,0.00028853564,0.000106083986,0.0005218277,0.00012604072,0.021980476,0.18680549,0.002089653,0.0049616075,0.77974695],"study_design_scores_gemma":[0.00003014182,0.00020705297,0.008289239,0.00007315977,0.00019341358,0.0027473706,0.000110547095,0.86382204,0.11271201,0.005285967,0.0064765266,0.000052435335],"about_ca_topic_score_codex":0.0009766695,"about_ca_topic_score_gemma":0.0018538735,"teacher_disagreement_score":0.0018135804,"about_ca_system_score_codex":0.00021694993,"about_ca_system_score_gemma":0.00051657105,"threshold_uncertainty_score":0.0060670376},"labels":[],"label_agreement":null},{"id":"W2525659476","doi":"10.1007/978-3-319-47160-0_14","title":"Towards Coordination Game Formulation in Game-Theoretic Rough Sets","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Equivalence (formal languages); Mathematical economics; Coordination game; Class (philosophy); Game theory; Set (abstract data type); Equivalence class (music); Outcome (game theory); Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.01640595943985756,"score_gpt":0.25138567710854814,"score_spread":0.23497971766869058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525659476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038654068,0.0003308352,0.9830959,0.0006247801,0.000102549464,0.000051181836,0.000047517646,0.000036602298,0.011845337],"genre_scores_gemma":[0.36173946,0.001734517,0.6161661,0.0004932029,0.00049318414,0.00062024134,0.00025628597,0.00014846308,0.018348556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706405,0.0016755862,0.00015078421,0.00028781334,0.00064208783,0.00017966104],"domain_scores_gemma":[0.9973126,0.001750196,0.00018738704,0.00021745032,0.00032885725,0.0002035206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040133856,0.001331904,0.0020152933,0.0012070311,0.0009972122,0.005481767,0.0033081025,0.002010813,0.0052909115],"category_scores_gemma":[0.008226806,0.0010089971,0.0024502012,0.0021368677,0.0033578419,0.005868712,0.0035861812,0.006103414,0.0008997567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000817612,0.000020255358,0.000037923463,0.000042982585,0.00001633683,0.000029292489,0.00013594092,0.03071824,0.00016717144,0.96421945,0.0007433861,0.0038608094],"study_design_scores_gemma":[0.000009189529,0.00001323373,0.000026936781,0.00002121438,0.000011792987,0.000011599881,0.000049974115,0.17809436,0.00007000115,0.819422,0.0022593334,0.000010384302],"about_ca_topic_score_codex":0.003150199,"about_ca_topic_score_gemma":0.0023826587,"teacher_disagreement_score":0.005481767,"about_ca_system_score_codex":0.0028866301,"about_ca_system_score_gemma":0.0018774236,"threshold_uncertainty_score":0.021225095},"labels":[],"label_agreement":null},{"id":"W2525893227","doi":"10.1007/978-3-319-46726-9_32","title":"Basal Slice Detection Using Long-Axis Segmentation for Cardiac Analysis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cardiac cycle; Basal (medicine); Ventricle; Computer science; Segmentation; Diastole; Systole; Artificial intelligence; Cardiology; Medicine; Internal medicine; Blood pressure","score_opus":0.02160193631687243,"score_gpt":0.2963481561469777,"score_spread":0.2747462198301053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525893227","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.003969375,0.003293256,0.98351306,0.00010115656,0.0002260886,0.0000864588,0.00036630157,0.00390911,0.0045352783],"genre_scores_gemma":[0.0387845,0.0030582678,0.946962,0.00011469324,0.00013174072,0.00007687586,0.0013812241,0.0011703576,0.008320403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993772,0.00009049013,0.000049462556,0.00018476736,0.0002616749,0.000036529953],"domain_scores_gemma":[0.99929035,0.00027374635,0.00005282578,0.00014028851,0.00021095862,0.00003182618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006458391,0.0011158255,0.0004977192,0.0015866305,0.00034901028,0.0013239761,0.0011823322,0.0011358432,0.011669119],"category_scores_gemma":[0.0012416786,0.0005490768,0.0006174075,0.001950036,0.0004565293,0.00080396637,0.00081134506,0.00073057855,0.009996077],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014787342,0.000031419215,0.00060429174,0.00049695926,0.000059212543,0.00027609823,0.00018050188,0.005148642,0.14897093,0.0046620513,0.020254761,0.8191674],"study_design_scores_gemma":[0.000047168047,0.0002905417,0.008282126,0.00043706057,0.00020180027,0.007442809,0.00025819463,0.44874397,0.25043288,0.024092859,0.2595474,0.00022316558],"about_ca_topic_score_codex":0.00097155484,"about_ca_topic_score_gemma":0.0016339172,"teacher_disagreement_score":0.011669119,"about_ca_system_score_codex":0.00032607777,"about_ca_system_score_gemma":0.00050918246,"threshold_uncertainty_score":0.03903711},"labels":[],"label_agreement":null},{"id":"W2526158400","doi":"10.1007/978-3-319-47157-0_25","title":"Learning for Graph-Based Sensorless Freehand 3D Ultrasound","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Decorrelation; Artificial intelligence; Computer vision; Speckle pattern; Trajectory; Graph; Imaging phantom; Gaussian; Motion estimation; Gaussian process; Position (finance); Algorithm; Theoretical computer science","score_opus":0.01280030032652131,"score_gpt":0.23438755569785635,"score_spread":0.22158725537133506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526158400","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.0020936977,0.00009400701,0.99674314,0.00005052837,0.000014244056,0.000018285475,0.000060831724,0.0005569054,0.00036840525],"genre_scores_gemma":[0.2654153,0.00075589865,0.7236155,0.00035830442,0.0001223644,0.00024185723,0.001269783,0.0007072568,0.007513751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942774,0.000102535145,0.000029060655,0.00016676827,0.00021696943,0.000056916182],"domain_scores_gemma":[0.99856573,0.0008453083,0.00011097114,0.00018711376,0.00021798657,0.000073005285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007062299,0.00091529754,0.0013861761,0.00066731323,0.0003294519,0.0010255876,0.0024389417,0.001954596,0.005625662],"category_scores_gemma":[0.0036058004,0.0011807077,0.0011555116,0.0008820443,0.0009430858,0.0018980815,0.0026820963,0.0019258306,0.0021000956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015723864,0.00007891096,0.00043278688,0.00025653784,0.0000601597,0.00006962002,0.00014066743,0.54253966,0.013114348,0.012102451,0.003783975,0.42726362],"study_design_scores_gemma":[0.0000046169853,0.000019634195,0.0001040747,0.000009474867,0.000003888822,0.000026055946,0.000008169146,0.99119085,0.0012859626,0.0066813556,0.0006577237,0.000008086688],"about_ca_topic_score_codex":0.00687213,"about_ca_topic_score_gemma":0.00985002,"teacher_disagreement_score":0.00687213,"about_ca_system_score_codex":0.0007154036,"about_ca_system_score_gemma":0.000926286,"threshold_uncertainty_score":0.01881975},"labels":[],"label_agreement":null},{"id":"W2526250255","doi":"10.1007/978-3-540-28629-5_34","title":"Graph Exploration by a Finite Automaton","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Planar graph; Graph; Combinatorics; Discrete mathematics; Butterfly graph; Book embedding; Mathematics; Computer science; Voltage graph; Topology (electrical circuits); Line graph; 1-planar graph","score_opus":0.022123243478462947,"score_gpt":0.25036453029300454,"score_spread":0.2282412868145416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526250255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.155582,0.0004722669,0.7938519,0.00070812146,0.00015206577,0.00010859756,0.00031975206,0.0025928994,0.046212345],"genre_scores_gemma":[0.79068863,0.00027969107,0.19147673,0.00010858818,0.000029691057,0.0001744506,0.00024352573,0.00033161184,0.016667048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997714,0.000065342,0.0000129922,0.00007057613,0.000049179613,0.000030505405],"domain_scores_gemma":[0.99894565,0.00074928626,0.00003261077,0.00016136274,0.00006032452,0.00005069221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024870294,0.00033314154,0.00051084603,0.00051957817,0.0007729844,0.0009980059,0.0008645539,0.0008877842,0.008086923],"category_scores_gemma":[0.0018772734,0.0003372882,0.0010471372,0.0006175728,0.0012382959,0.0016600578,0.0012270416,0.0010325271,0.0006556932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027066542,0.00009964406,0.0012364184,0.00028880904,0.00006895629,0.0004136123,0.00059125334,0.22351871,0.017259344,0.65605575,0.0046299305,0.09556697],"study_design_scores_gemma":[0.00003519395,0.000052631414,0.00018016473,0.000029203782,0.00002571443,0.00012463387,0.00006425651,0.52191526,0.0037855394,0.46863687,0.005131782,0.000018685038],"about_ca_topic_score_codex":0.0017708938,"about_ca_topic_score_gemma":0.0022352608,"teacher_disagreement_score":0.008086923,"about_ca_system_score_codex":0.0005813927,"about_ca_system_score_gemma":0.00054368883,"threshold_uncertainty_score":0.027053416},"labels":[],"label_agreement":null},{"id":"W2526259914","doi":"10.1007/978-3-319-47157-0_20","title":"Multi-resolution-Tract CNN with Hybrid Pretrained and Skin-Lesion Trained Layers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":155,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Pattern recognition (psychology); Skin lesion; Image (mathematics); Resolution (logic); Computer vision","score_opus":0.01700975635664772,"score_gpt":0.2461952657219308,"score_spread":0.22918550936528306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526259914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060319617,0.0048434986,0.8797174,0.00078355713,0.0009425193,0.0003198546,0.005141083,0.027090177,0.020842306],"genre_scores_gemma":[0.36852136,0.0025925748,0.5400805,0.0009951609,0.00023964014,0.0003008574,0.012041571,0.0017414957,0.07348697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997807,0.000011632255,0.000010084789,0.000086528744,0.000055407763,0.000055595454],"domain_scores_gemma":[0.99975413,0.000036234596,0.000017804863,0.00007264519,0.00009579631,0.000023423925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005260006,0.0015595618,0.00074831746,0.0006873761,0.00029259073,0.0009922179,0.0016938411,0.0013934226,0.009683157],"category_scores_gemma":[0.0008198739,0.0006707835,0.0012930478,0.0007314399,0.00024011848,0.001040606,0.0010830407,0.0014894465,0.0058385213],"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.00030823765,0.00028581067,0.0026871113,0.00038489897,0.0003599219,0.00032573962,0.0000618162,0.09266429,0.061512448,0.0030917611,0.035496015,0.8028219],"study_design_scores_gemma":[0.000023403656,0.00017526532,0.0033971483,0.00009892551,0.0002218517,0.0004866253,0.000026843327,0.92759275,0.048532773,0.0035498845,0.015846396,0.00004817007],"about_ca_topic_score_codex":0.012109817,"about_ca_topic_score_gemma":0.024440847,"teacher_disagreement_score":0.012109817,"about_ca_system_score_codex":0.00075933116,"about_ca_system_score_gemma":0.0010722511,"threshold_uncertainty_score":0.032393396},"labels":[],"label_agreement":null},{"id":"W2526347824","doi":"","title":"Detection of LSB steganography via sample pair analysis","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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":"McMaster University","funders":"","keywords":"Least significant bit; Computer science; Steganography; Steganalysis; Robustness (evolution); Embedding; Artificial intelligence; Sample (material); Algorithm; Pattern recognition (psychology)","score_opus":0.009573288283020683,"score_gpt":0.23965002492141926,"score_spread":0.2300767366383986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526347824","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.5026098,0.00039307206,0.49205053,0.00019915591,0.00009588592,0.00008830771,0.0001520553,0.0014851349,0.0029261645],"genre_scores_gemma":[0.8788196,0.00019595008,0.118508555,0.000058628986,0.000054302276,0.000058684647,0.0001314171,0.000090848356,0.0020820538],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995197,0.000118818425,0.000013260102,0.000068545516,0.00023752163,0.0000422254],"domain_scores_gemma":[0.9991436,0.00044139635,0.00013302152,0.00008208985,0.00016029947,0.000039570794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032935484,0.0006173998,0.0007460098,0.0012505923,0.00024245951,0.00050758215,0.00034776196,0.0005935987,0.0017648889],"category_scores_gemma":[0.0014990581,0.00031240098,0.00029033519,0.0006132945,0.00032487445,0.000738431,0.000602002,0.000520004,0.00092031894],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014413161,0.00013041818,0.006109191,0.00014747088,0.00007793985,0.000341078,0.00013135208,0.0048470027,0.7529032,0.0022781282,0.00078727904,0.23080565],"study_design_scores_gemma":[0.00007267724,0.0009755936,0.0169014,0.000020858908,0.00009669634,0.002461813,0.00009866013,0.384909,0.58930874,0.002344698,0.0027572694,0.000052536],"about_ca_topic_score_codex":0.00014498523,"about_ca_topic_score_gemma":0.00024750835,"teacher_disagreement_score":0.0017648889,"about_ca_system_score_codex":0.00019675476,"about_ca_system_score_gemma":0.00022122226,"threshold_uncertainty_score":0.005904138},"labels":[],"label_agreement":null},{"id":"W2526499595","doi":"10.1007/978-3-319-46723-8_53","title":"Topology Aware Fully Convolutional Networks for Histology Gland Segmentation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; ENCODE; Convolutional neural network; Prior probability; Dice; Pattern recognition (psychology); Deep learning; Object (grammar); Object detection; Network topology; Image segmentation; Computer vision; Pixel; Topology (electrical circuits); Mathematics; Computer network","score_opus":0.01510039814091865,"score_gpt":0.25471358831132535,"score_spread":0.2396131901704067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526499595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028515406,0.003118512,0.95410377,0.00046029149,0.00014451737,0.0000675535,0.0012675702,0.0066162357,0.0057061114],"genre_scores_gemma":[0.42263982,0.0044244244,0.5306531,0.0003849983,0.00022396172,0.00014319298,0.0055994755,0.0012706593,0.034660332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998555,0.000017980232,0.0000066628704,0.000045167777,0.000046940102,0.000027706206],"domain_scores_gemma":[0.99975854,0.00008853187,0.000022674913,0.000050313356,0.00006431937,0.000015614873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003368325,0.00097574503,0.00057750795,0.0008412849,0.000244716,0.00084618106,0.0012749947,0.0012321871,0.0035471155],"category_scores_gemma":[0.0008694726,0.00070363504,0.000833747,0.000759346,0.00023496998,0.00085774454,0.00084775273,0.0010081899,0.0022479712],"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.000201623,0.000084650754,0.0009821086,0.00020281751,0.00013415536,0.00017266348,0.000057159967,0.24828847,0.036329303,0.00736498,0.013119946,0.693062],"study_design_scores_gemma":[0.0000036639833,0.000021371836,0.00063770544,0.000020404548,0.000030227891,0.000116933414,0.000008829076,0.97754014,0.011895469,0.0057287025,0.003984975,0.000011489047],"about_ca_topic_score_codex":0.007009359,"about_ca_topic_score_gemma":0.014817456,"teacher_disagreement_score":0.007009359,"about_ca_system_score_codex":0.000757998,"about_ca_system_score_gemma":0.000766551,"threshold_uncertainty_score":0.013937116},"labels":[],"label_agreement":null},{"id":"W2526502441","doi":"10.1007/978-3-319-47160-0_25","title":"Determining Thresholds in Three-Way Decisions with Chi-Square Statistic","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Statistic; Square (algebra); Computer science; Maximization; Partition (number theory); Set (abstract data type); Function (biology); Context (archaeology); Algorithm; Chi-square test; Statistics; Mathematics; Pattern recognition (psychology); Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.027855931435395675,"score_gpt":0.25383165746944863,"score_spread":0.22597572603405297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526502441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08354264,0.00037406804,0.9122091,0.00021847138,0.0001558004,0.00016856773,0.00024603066,0.0008407346,0.0022447272],"genre_scores_gemma":[0.57679546,0.00016909651,0.42084366,0.0001037334,0.000079174846,0.00036162618,0.00047930123,0.00017617816,0.0009918716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9798329,0.009750089,0.001829318,0.0030381752,0.0045459806,0.0010036625],"domain_scores_gemma":[0.8721276,0.114879385,0.0022577932,0.0038500607,0.005668594,0.0012165562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019347943,0.00095366116,0.0029089472,0.0038233828,0.0015314566,0.0044481833,0.0024567633,0.0021079609,0.0038357016],"category_scores_gemma":[0.081185825,0.00073201273,0.0022820474,0.003873251,0.0027304941,0.0042605423,0.0018667278,0.0031981892,0.00093423016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045787054,0.00094256084,0.10741307,0.001308208,0.0015244515,0.0023187445,0.0050383634,0.09875417,0.012591615,0.09248994,0.008519433,0.66452074],"study_design_scores_gemma":[0.00015555236,0.0013204283,0.02264263,0.00024438865,0.00045473455,0.0012756747,0.0031319014,0.7682482,0.013971258,0.18364723,0.004619097,0.00028887574],"about_ca_topic_score_codex":0.0025859873,"about_ca_topic_score_gemma":0.0020648136,"teacher_disagreement_score":0.019347943,"about_ca_system_score_codex":0.0011956784,"about_ca_system_score_gemma":0.0025084156,"threshold_uncertainty_score":0.102322996},"labels":[],"label_agreement":null},{"id":"W2526563325","doi":"10.1007/978-3-319-51963-0_22","title":"Order-Preserving 1-String Representations of Planar Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Planar; Planar graph; String (physics); Embedding; Order (exchange); Planar straight-line graph; Vertex (graph theory); Book embedding; Combinatorics; Representation (politics); Computer science; Mathematics; 1-planar graph; Graph; Discrete mathematics; Chordal graph; Artificial intelligence; Computer graphics (images)","score_opus":0.027727110953595892,"score_gpt":0.28101395773025223,"score_spread":0.25328684677665636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526563325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25516996,0.0010917229,0.5381208,0.0012790249,0.00082983106,0.00013294363,0.0011675517,0.0020283563,0.2001797],"genre_scores_gemma":[0.7687227,0.0021293974,0.13191622,0.0005657304,0.00048354105,0.00015944777,0.0019128514,0.0016246464,0.09248543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968517,0.00005923621,0.000018919582,0.000051960204,0.00012495014,0.00005977002],"domain_scores_gemma":[0.99955803,0.0001295304,0.000057084464,0.00013571756,0.000072036106,0.00004759217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026199967,0.00060796237,0.0004870324,0.0014187781,0.00063452235,0.0021275177,0.0010664733,0.0011905301,0.014835343],"category_scores_gemma":[0.0013384834,0.0003932671,0.00058764603,0.0013333173,0.00097035454,0.002869997,0.0016117924,0.0023249604,0.0031282564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045843568,0.00003131589,0.00006211519,0.00006432476,0.000004444512,0.000070928916,0.00020861388,0.005494761,0.0034446104,0.94391835,0.0038631463,0.042791657],"study_design_scores_gemma":[0.000013700951,0.00002780621,0.000082252365,0.000027049426,0.00000656113,0.00012443852,0.00009451375,0.015493285,0.0017531138,0.9711693,0.011193609,0.000014346687],"about_ca_topic_score_codex":0.0004225798,"about_ca_topic_score_gemma":0.00058447465,"teacher_disagreement_score":0.014835343,"about_ca_system_score_codex":0.000549586,"about_ca_system_score_gemma":0.00028964842,"threshold_uncertainty_score":0.049629092},"labels":[],"label_agreement":null},{"id":"W2526742587","doi":"10.1007/978-3-319-46720-7_21","title":"Predictive Subnetwork Extraction with Structural Priors for Infant Connectomes","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Hospital for Sick Children; University of Toronto; Child and Family Research Institute; Simon Fraser University","funders":"","keywords":"Connectome; Subnetwork; Computer science; Prior probability; Artificial intelligence; Constraint (computer-aided design); Diffusion MRI; Pattern recognition (psychology); Machine learning; Functional connectivity; Neuroscience; Mathematics; Psychology; Bayesian probability","score_opus":0.029243037323431285,"score_gpt":0.3256026376107184,"score_spread":0.2963596002872871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526742587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017963324,0.0011870669,0.9733462,0.00034493863,0.000052806467,0.00006727744,0.001214557,0.0037454076,0.002078521],"genre_scores_gemma":[0.35802713,0.0022432879,0.6176298,0.00020810959,0.00032379944,0.00034080984,0.008610574,0.0011590329,0.011457438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996625,0.000073279705,0.000017295188,0.00012511245,0.00007532322,0.00004653297],"domain_scores_gemma":[0.9989091,0.0006363209,0.00008824323,0.00021236876,0.00010759277,0.000046347464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010690774,0.0015983057,0.001209574,0.002778102,0.00053341006,0.0012031954,0.0016604444,0.0019525227,0.004190026],"category_scores_gemma":[0.0036636998,0.0010289502,0.0018506215,0.0020152654,0.00049936556,0.0015135694,0.0015717197,0.002158839,0.0027468044],"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.00039282918,0.00014493882,0.0031985037,0.0003165548,0.0002341284,0.00042949646,0.00017019727,0.156836,0.023378989,0.013628792,0.018452741,0.7828168],"study_design_scores_gemma":[0.000019200514,0.000029744406,0.0016408246,0.000060118422,0.00007573223,0.00022555626,0.000025698444,0.9643396,0.0054233596,0.025097284,0.0030454628,0.000017512119],"about_ca_topic_score_codex":0.004245776,"about_ca_topic_score_gemma":0.010611492,"teacher_disagreement_score":0.004245776,"about_ca_system_score_codex":0.00048905675,"about_ca_system_score_gemma":0.00094859645,"threshold_uncertainty_score":0.0140170455},"labels":[],"label_agreement":null},{"id":"W2526948241","doi":"10.1007/978-3-319-47157-0_23","title":"Tree-Based Transforms for Privileged Learning","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","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 British Columbia","funders":"","keywords":"Computer science; Modalities; Random forest; Artificial intelligence; Classifier (UML); Decision tree; Feature (linguistics); Machine learning; Modality (human–computer interaction); Tree (set theory); Training set; Variety (cybernetics); Pattern recognition (psychology)","score_opus":0.09751452332840772,"score_gpt":0.41116680946165246,"score_spread":0.31365228613324475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526948241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004989648,0.00025913233,0.9908529,0.0001288466,0.00008672068,0.000020078129,0.000074916774,0.0008076507,0.0027801942],"genre_scores_gemma":[0.24092829,0.0006590384,0.7444196,0.00016702253,0.0002017555,0.0001417656,0.0007641072,0.00071060885,0.01200782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987839,0.00033713834,0.00009579466,0.00018613382,0.00048392286,0.00011313104],"domain_scores_gemma":[0.9974891,0.0013235164,0.000094416755,0.00055970036,0.000434843,0.000098438715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015195207,0.0004519189,0.0007525893,0.0010151699,0.0005232939,0.0014975087,0.0014145472,0.0010643495,0.009165096],"category_scores_gemma":[0.00810617,0.0003120435,0.000624893,0.0012972702,0.0011581354,0.0037347616,0.002431794,0.0024670428,0.0028856283],"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.0001948605,0.000087744025,0.0002697218,0.000095045165,0.000019503908,0.000079413134,0.0001740926,0.03852279,0.0043815863,0.3597584,0.008716027,0.5877008],"study_design_scores_gemma":[0.000021947479,0.000054613705,0.00011500128,0.000038854505,0.000010920054,0.00014160786,0.000043256183,0.53706896,0.0045304406,0.4462386,0.011720009,0.000015748528],"about_ca_topic_score_codex":0.0011002399,"about_ca_topic_score_gemma":0.0012123574,"teacher_disagreement_score":0.009165096,"about_ca_system_score_codex":0.0005269781,"about_ca_system_score_gemma":0.00077453913,"threshold_uncertainty_score":0.030660331},"labels":[],"label_agreement":null},{"id":"W2527113450","doi":"10.1007/b136266","title":"Computational Science and Its Applications – ICCSA 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":394,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computational science; Theoretical computer science","score_opus":0.05567509002823586,"score_gpt":0.35274773898727524,"score_spread":0.2970726489590394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527113450","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005503199,0.13318428,0.20031558,0.015559016,0.033529714,0.00037174535,0.003865848,0.007199586,0.600471],"genre_scores_gemma":[0.027681418,0.08293104,0.061860856,0.0015950646,0.008304639,0.00027536313,0.0049875593,0.0020554364,0.8103086],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991053,0.0001495936,0.000057214445,0.0001384754,0.00048736046,0.00006211517],"domain_scores_gemma":[0.9974154,0.0005844305,0.00008804694,0.0005490751,0.0010450494,0.0003179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019101887,0.0013022455,0.0017444786,0.003441934,0.0009190671,0.004134041,0.0013351274,0.0010413964,0.06089853],"category_scores_gemma":[0.0039002039,0.0009328497,0.00072725886,0.005981127,0.0011443332,0.0030060145,0.0022280451,0.0026495857,0.030149747],"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.000052981282,0.000056884,0.00025981336,0.00032957102,0.000023736786,0.00002946165,0.000049610942,0.003016164,0.00051282876,0.027998386,0.6852105,0.28246003],"study_design_scores_gemma":[0.000007584969,0.000030816485,0.00084496086,0.00027975082,0.000025310175,0.00014187863,0.00003693132,0.008201757,0.0006863767,0.01977627,0.9699516,0.000016727105],"about_ca_topic_score_codex":0.006203743,"about_ca_topic_score_gemma":0.009319156,"teacher_disagreement_score":0.06089853,"about_ca_system_score_codex":0.0020405806,"about_ca_system_score_gemma":0.0027992427,"threshold_uncertainty_score":0.20372587},"labels":[],"label_agreement":null},{"id":"W2527250768","doi":"10.1007/978-3-319-46723-8_47","title":"Corpus Callosum Segmentation in Brain MRIs via Robust Target-Localization and Joint Supervised Feature Extraction and Prediction","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multiple Sclerosis Research Studies","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Pattern recognition (psychology); Discriminative model; Voxel; Dice; Computer vision; Mathematics","score_opus":0.03156980421581749,"score_gpt":0.2777230853475402,"score_spread":0.24615328113172272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527250768","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.007795305,0.0011177756,0.9878528,0.00014741212,0.00003869394,0.000025472995,0.00019192841,0.002062452,0.00076808163],"genre_scores_gemma":[0.12723343,0.0017117333,0.86356384,0.00012613328,0.00015482171,0.000084446394,0.0009370459,0.0010829702,0.0051057027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996145,0.000065754546,0.000025477197,0.00014523165,0.00010588533,0.00004303398],"domain_scores_gemma":[0.9993648,0.000298723,0.0000818918,0.000110871886,0.00011788134,0.000025993964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084392517,0.0011052266,0.0012092309,0.0013048124,0.0003439178,0.0013319124,0.0013670543,0.0016553364,0.0019657202],"category_scores_gemma":[0.0017236787,0.0008646515,0.0014059807,0.0013548996,0.0005745241,0.0010520553,0.001048739,0.0012117852,0.0021640325],"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.00021075699,0.000057606823,0.0008565544,0.00035673386,0.00014001389,0.0002171916,0.00010725843,0.08676894,0.091548234,0.0038481008,0.0077558425,0.80813277],"study_design_scores_gemma":[0.000009693743,0.00006586743,0.002695138,0.000044561966,0.000077546654,0.00066461286,0.000029875067,0.93069315,0.05077044,0.010211486,0.0046874564,0.000050230443],"about_ca_topic_score_codex":0.0026562926,"about_ca_topic_score_gemma":0.0059368326,"teacher_disagreement_score":0.0026562926,"about_ca_system_score_codex":0.00034705584,"about_ca_system_score_gemma":0.0007671823,"threshold_uncertainty_score":0.0065760016},"labels":[],"label_agreement":null},{"id":"W2527543035","doi":"10.1007/978-3-319-47096-2_24","title":"Predicting the Electricity Consumption of Buildings: An Improved CBR Approach","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Load and Power Forecasting","field":"Engineering","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":"Natural Resources Canada","funders":"","keywords":"Computer science; Electricity; Similarity (geometry); Case-based reasoning; Consumption (sociology); Adaptation (eye); Energy consumption; Machine learning; Artificial intelligence; Data mining; Engineering","score_opus":0.014167154149723716,"score_gpt":0.21335776438421822,"score_spread":0.1991906102344945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527543035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0771229,0.0025966417,0.9006262,0.0005671151,0.00032231442,0.0002873005,0.0008161101,0.0035814622,0.014080088],"genre_scores_gemma":[0.694476,0.0015386823,0.2958089,0.0003844941,0.0002901088,0.00016574557,0.00096462254,0.00014755178,0.0062240185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923825,0.00017285814,0.000060745962,0.00018750747,0.00026255884,0.00007816154],"domain_scores_gemma":[0.9986644,0.00082199014,0.000058350197,0.000115264316,0.00030974945,0.000030309817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090192223,0.0011133039,0.0014594072,0.0022290195,0.00033259887,0.0013199082,0.002711538,0.0013408521,0.0031275249],"category_scores_gemma":[0.0032494739,0.00038985966,0.0010689751,0.002341424,0.00031222802,0.0011494412,0.0006358184,0.001104585,0.0009954191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000230822,0.0004449656,0.002544138,0.00028479495,0.00018143405,0.00041143506,0.00009404115,0.4957654,0.0071196263,0.0026790672,0.0035763949,0.48666787],"study_design_scores_gemma":[0.00001877851,0.000034313056,0.0005258386,0.000012615089,0.000067073444,0.00005908225,0.000017600802,0.9956815,0.0010780836,0.0018276926,0.00066498155,0.000012388057],"about_ca_topic_score_codex":0.016116863,"about_ca_topic_score_gemma":0.009481857,"teacher_disagreement_score":0.016116863,"about_ca_system_score_codex":0.00068274164,"about_ca_system_score_gemma":0.00059154455,"threshold_uncertainty_score":0.03204608},"labels":[],"label_agreement":null},{"id":"W2528118313","doi":"10.1007/978-3-662-55751-8_5","title":"Contextuality in Multipartite Pseudo-Telepathy Graph Games","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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 Calgary","funders":"","keywords":"Kochen–Specker theorem; Multipartite; Graph; Telepathy; Computer science; Theoretical computer science; Quantum; Physics; Quantum mechanics","score_opus":0.02139575938482973,"score_gpt":0.27399019763252774,"score_spread":0.252594438247698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528118313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34488365,0.0008752185,0.52850133,0.0064933314,0.0003824053,0.00033348068,0.00062682206,0.00039569836,0.11750805],"genre_scores_gemma":[0.9520807,0.00042847262,0.029763851,0.0005274293,0.00023599796,0.00033356977,0.00024185683,0.00014476018,0.016243372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778134,0.0010593623,0.00008059706,0.00034778522,0.000372246,0.00035859522],"domain_scores_gemma":[0.99192387,0.0055864104,0.000525768,0.000676509,0.00041993463,0.00086757925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019589094,0.0011236287,0.0019199976,0.0010704962,0.0028864313,0.004361007,0.0022018168,0.0030882338,0.010165108],"category_scores_gemma":[0.011165915,0.0009572301,0.0012337398,0.0014599208,0.0046248445,0.007028602,0.0037830002,0.00487338,0.0006410992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037325146,0.000020592313,0.00006926502,0.000032976288,0.000008143855,0.000040960476,0.00013358264,0.008277511,0.00019443297,0.98871684,0.00074961834,0.0017187564],"study_design_scores_gemma":[0.000018239482,0.00000814715,0.00003691001,0.0000096387585,0.00000484371,0.000013118464,0.000036449845,0.02872676,0.00005390093,0.9706519,0.00043265452,0.0000075664066],"about_ca_topic_score_codex":0.0029139442,"about_ca_topic_score_gemma":0.0027333044,"teacher_disagreement_score":0.010165108,"about_ca_system_score_codex":0.0023837574,"about_ca_system_score_gemma":0.0018270271,"threshold_uncertainty_score":0.034005642},"labels":[],"label_agreement":null},{"id":"W2528271325","doi":"10.1007/978-3-319-46397-1_14","title":"On Referring Expressions in Information Systems Derived from Conceptual Modelling","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Waterloo","funders":"","keywords":"Computer science; Schema (genetic algorithms); SQL; Conceptual schema; Uniqueness; Relational database; Relational model; Theoretical computer science; Information retrieval; Programming language; Mathematics; Linguistics","score_opus":0.03690231939860012,"score_gpt":0.24262370132855074,"score_spread":0.20572138192995063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528271325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058244327,0.003666237,0.94139934,0.0028386223,0.0005246253,0.00011170844,0.00026337433,0.00050314865,0.04486851],"genre_scores_gemma":[0.2805637,0.008954288,0.6782405,0.002175695,0.001411845,0.000677328,0.0024608013,0.0012855474,0.024230259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947856,0.0025059804,0.00054846366,0.0005740802,0.0013018156,0.00028404032],"domain_scores_gemma":[0.99371535,0.004399654,0.00021457636,0.0010068051,0.00056912174,0.0000946031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005564392,0.0011761497,0.0016050311,0.0037683682,0.002423438,0.0068049696,0.0033152893,0.003387598,0.008034142],"category_scores_gemma":[0.016060261,0.0014020603,0.0033610652,0.00734184,0.006834877,0.020701027,0.0063570132,0.0067108553,0.0022399023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006627431,0.000006225231,0.000031822598,0.000055561868,0.0000068574523,0.00009123167,0.00044539454,0.0013576534,0.00018646667,0.9892553,0.0012741548,0.00728264],"study_design_scores_gemma":[0.000004042902,0.000005481906,0.00004088899,0.00005765634,0.000017512279,0.0000628024,0.00009026502,0.0101425825,0.00027626022,0.9779442,0.011345431,0.000012885829],"about_ca_topic_score_codex":0.0042110747,"about_ca_topic_score_gemma":0.002535501,"teacher_disagreement_score":0.008034142,"about_ca_system_score_codex":0.00322875,"about_ca_system_score_gemma":0.0013280426,"threshold_uncertainty_score":0.029427648},"labels":[],"label_agreement":null},{"id":"W2528943235","doi":"10.1007/978-3-319-62127-2_13","title":"A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Outerplanar graph; Embedding; Planar graph; Planar; Pathwidth; Book embedding; Graph drawing; Combinatorics; Graph; 1-planar graph; Mathematics; Computer science; Discrete mathematics; Chordal graph; Algorithm; Line graph; Computer graphics (images); Artificial intelligence","score_opus":0.020402876010075607,"score_gpt":0.25669733454168014,"score_spread":0.23629445853160452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528943235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17247961,0.004034857,0.7287822,0.0026332436,0.0010580689,0.00042944725,0.0037293786,0.00646401,0.08038914],"genre_scores_gemma":[0.41893625,0.0021977152,0.5395141,0.000905449,0.0006676881,0.0005028037,0.0049836235,0.0021212043,0.030171014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985435,0.0002320452,0.0000607781,0.00029115123,0.0005754692,0.00029712621],"domain_scores_gemma":[0.99672997,0.0017533479,0.00020497823,0.00064886373,0.00032580187,0.00033707827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011012041,0.0024372125,0.0020590757,0.002379475,0.0009124107,0.0041030166,0.0042919638,0.0019496183,0.022883395],"category_scores_gemma":[0.008655585,0.0011534892,0.0017279644,0.0034208049,0.0014113804,0.0048534013,0.0045257416,0.004773602,0.005151841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002096954,0.00075831864,0.0031787518,0.0012056336,0.00019257024,0.00036447175,0.0010258798,0.18622413,0.023552746,0.2047301,0.07340062,0.5032698],"study_design_scores_gemma":[0.0002980622,0.00038326692,0.0017028734,0.0002163423,0.00015652509,0.00046129787,0.0003515013,0.67192715,0.0077062207,0.29013363,0.026582042,0.00008118866],"about_ca_topic_score_codex":0.0034104753,"about_ca_topic_score_gemma":0.005764169,"teacher_disagreement_score":0.022883395,"about_ca_system_score_codex":0.0028528965,"about_ca_system_score_gemma":0.0015368338,"threshold_uncertainty_score":0.07655257},"labels":[],"label_agreement":null},{"id":"W2529230500","doi":"10.1007/978-3-319-53733-7_12","title":"Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Regular language; Computer science; Ideal (ethics); Generalized suffix tree; Mathematics; Discrete mathematics; Combinatorics; Suffix tree; Artificial intelligence; Linguistics; Automaton","score_opus":0.02190194143970756,"score_gpt":0.2560078981016194,"score_spread":0.23410595666191183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529230500","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.7642075,0.0022202204,0.14968199,0.0076100044,0.00019189774,0.00010495813,0.0030813583,0.0008236832,0.072078384],"genre_scores_gemma":[0.96777904,0.00072508765,0.01418928,0.00033087604,0.000477398,0.00011798085,0.0018624483,0.00029189602,0.014225937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652004,0.00064116734,0.00023719462,0.000757321,0.0012803393,0.00056387874],"domain_scores_gemma":[0.98265624,0.013377677,0.0011028672,0.0010467728,0.0008979544,0.0009184373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014227864,0.00077516015,0.0015358867,0.0015748896,0.0019238923,0.009876166,0.0029586551,0.0016775395,0.012466436],"category_scores_gemma":[0.011880222,0.00095101993,0.0017681842,0.0021597666,0.004073806,0.01662154,0.0032306383,0.003979398,0.0013331338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047731816,0.0001454972,0.0021261282,0.00030793974,0.00006063329,0.00029599367,0.0015554648,0.01914983,0.0029949788,0.9512086,0.005052191,0.016625466],"study_design_scores_gemma":[0.000030297979,0.000015303382,0.00036008217,0.000012736787,0.000016277429,0.00012213406,0.00011734848,0.023634577,0.0007289046,0.97400624,0.0009357581,0.0000203444],"about_ca_topic_score_codex":0.0018756854,"about_ca_topic_score_gemma":0.0016170348,"teacher_disagreement_score":0.012466436,"about_ca_system_score_codex":0.00392219,"about_ca_system_score_gemma":0.0021607245,"threshold_uncertainty_score":0.041704357},"labels":[],"label_agreement":null},{"id":"W2530085701","doi":"10.1007/978-3-319-48051-0_12","title":"Constraining Word Embeddings by Prior Knowledge – Application to Medical Information Retrieval","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Leverage (statistics); Word (group theory); Natural language processing; Word embedding; Artificial intelligence; Embedding; Domain (mathematical analysis); Information retrieval; Linguistics; Mathematics","score_opus":0.011942982021409365,"score_gpt":0.26223426959109486,"score_spread":0.2502912875696855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530085701","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.035477713,0.002398948,0.9567129,0.0006443726,0.00017449514,0.00009204434,0.0005587158,0.0019852638,0.0019555262],"genre_scores_gemma":[0.4054471,0.002834352,0.57805765,0.00040397432,0.0006054967,0.00027365214,0.0044827727,0.00089951995,0.0069954507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998611,0.0005163926,0.00015267011,0.00040431763,0.00021921354,0.00009653618],"domain_scores_gemma":[0.9930173,0.0049763895,0.00033023008,0.0007460467,0.00078942423,0.00014051919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027770041,0.0013182077,0.0015004049,0.0026280717,0.0007032456,0.0022009737,0.0016626139,0.0020306546,0.0033884996],"category_scores_gemma":[0.013717867,0.0010799057,0.0014075388,0.0037622508,0.0009166686,0.0054311296,0.0027512005,0.0025962132,0.002093414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004416301,0.00034433274,0.0015973601,0.00042193662,0.00016505815,0.00016534253,0.00029286806,0.11889235,0.007075059,0.010970625,0.012128051,0.84750545],"study_design_scores_gemma":[0.00004540977,0.00007528749,0.000740643,0.00005499962,0.000059364676,0.0001329918,0.000086877706,0.95348114,0.0021099048,0.040301397,0.002878423,0.00003352697],"about_ca_topic_score_codex":0.005444762,"about_ca_topic_score_gemma":0.0062483554,"teacher_disagreement_score":0.005444762,"about_ca_system_score_codex":0.00061958,"about_ca_system_score_gemma":0.0010369434,"threshold_uncertainty_score":0.014686406},"labels":[],"label_agreement":null},{"id":"W253016372","doi":"10.1007/978-3-540-87700-4_45","title":"Nonsynonymous to Synonymous Substitution Ratio $k_{\\mathrm a}/k_{\\mathrm s}$ : Measurement for Rate of Evolution in Evolutionary Computation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nonsynonymous substitution; Substitution (logic); Rate of evolution; Synonymous substitution; Evolutionary algorithm; Interactive evolutionary computation; Computation; Evolutionary computation; Population; Computer science; Sequence (biology); Evolution strategy; Algorithm; Evolutionary programming; Biology; Artificial intelligence; Gene; Genetics; Phylogenetics; Genome; Codon usage bias","score_opus":0.027453539716488923,"score_gpt":0.25228110349356647,"score_spread":0.22482756377707755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W253016372","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.094181046,0.014527127,0.8221417,0.0015170196,0.0022003013,0.000095566014,0.009062526,0.006463682,0.049811028],"genre_scores_gemma":[0.44072545,0.0058463286,0.5064517,0.000700321,0.00047102422,0.00029014406,0.0066151586,0.0036701476,0.03522967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876225,0.00036576862,0.00006018755,0.00041613617,0.00035872738,0.00003692605],"domain_scores_gemma":[0.99866736,0.00095013535,0.000111732086,0.00012870235,0.00010882577,0.00003323474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014052772,0.0009270387,0.0010449528,0.0016840622,0.00031136567,0.0014918902,0.0018078053,0.0013871283,0.009916511],"category_scores_gemma":[0.005648145,0.0005044244,0.0005443876,0.0024375813,0.0009268558,0.0017520724,0.0006045279,0.0014638368,0.0071718413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034228532,0.00008143211,0.010352933,0.0010991156,0.0003904952,0.000310023,0.00045634055,0.015488728,0.15709054,0.3189869,0.033181548,0.4622197],"study_design_scores_gemma":[0.000067110246,0.00026819535,0.026148172,0.0002861409,0.00028043764,0.0046310136,0.00024133566,0.15769291,0.2029566,0.46310607,0.14381054,0.0005115365],"about_ca_topic_score_codex":0.00023591572,"about_ca_topic_score_gemma":0.00039377148,"teacher_disagreement_score":0.009916511,"about_ca_system_score_codex":0.0005343235,"about_ca_system_score_gemma":0.00022072859,"threshold_uncertainty_score":0.033174038},"labels":[],"label_agreement":null},{"id":"W2534327730","doi":"10.1007/978-3-319-56617-7_11","title":"Quantum Authentication and Encryption with Key Recycling","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eavesdropping; Computer science; BB84; Encryption; Quantum cryptography; Quantum key distribution; Cryptography; Computer security; Authentication (law); Key (lock); Theoretical computer science; Quantum; Quantum information; Physics; Quantum mechanics","score_opus":0.01578869599947482,"score_gpt":0.24162605508804486,"score_spread":0.22583735908857003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534327730","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023344612,0.015879974,0.5762236,0.0036931871,0.0022992396,0.00023147647,0.00024202328,0.00078750163,0.3772984],"genre_scores_gemma":[0.5421831,0.014893485,0.1370348,0.001093717,0.0015188296,0.0003409588,0.00027526976,0.0005080359,0.30215183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922204,0.00021856463,0.000046268124,0.00011224079,0.0003027275,0.00009830326],"domain_scores_gemma":[0.99952257,0.00015873935,0.000035132605,0.00021721362,0.000052585507,0.0000137373845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072600826,0.0007879617,0.00072840886,0.00088048086,0.0011039717,0.0024076838,0.0008387963,0.0017692231,0.01239567],"category_scores_gemma":[0.0016247496,0.00047754968,0.0008179013,0.0013687641,0.0031974304,0.0058777127,0.0024003992,0.0024100787,0.005016264],"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.000025634348,0.000012334369,0.000017791175,0.000092851325,0.000005717675,0.000028721157,0.0000758051,0.0010849697,0.0016403362,0.9672819,0.0029806537,0.026753372],"study_design_scores_gemma":[0.000009022637,0.000022639746,0.000045081957,0.000042730553,0.000007630061,0.00021042106,0.000024316181,0.0051695197,0.0037260854,0.95718175,0.033539813,0.000021107233],"about_ca_topic_score_codex":0.00013878309,"about_ca_topic_score_gemma":0.00010611856,"teacher_disagreement_score":0.01239567,"about_ca_system_score_codex":0.0008741819,"about_ca_system_score_gemma":0.0006003061,"threshold_uncertainty_score":0.041467667},"labels":[],"label_agreement":null},{"id":"W253566649","doi":"10.1007/978-3-319-11433-0_36","title":"Compression of Bayesian Networks with NIN-AND Tree Modeling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Bayesian network; Generality; Reduction (mathematics); Tree (set theory); Artificial intelligence; Binary tree; Binary decision diagram; Binary number; Table (database); Data mining; Conditional probability; Machine learning; Theoretical computer science; Algorithm","score_opus":0.016510579354533057,"score_gpt":0.2289759614742928,"score_spread":0.21246538211975974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W253566649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008461067,0.00097045297,0.98441327,0.00048313543,0.00016274929,0.00005638396,0.00058780337,0.0008510692,0.0040140697],"genre_scores_gemma":[0.23041512,0.0027499676,0.7525602,0.0004508895,0.000504894,0.00039801822,0.0033062599,0.0006265467,0.008988117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998467,0.0006085159,0.000113461596,0.00026026362,0.0004606449,0.00009004367],"domain_scores_gemma":[0.9937273,0.00377561,0.00025164936,0.0015689577,0.0005290498,0.00014747232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002062764,0.00077683764,0.0016389358,0.0019811862,0.00065400905,0.0017909245,0.0020294886,0.0013431911,0.008545991],"category_scores_gemma":[0.017321322,0.0007536465,0.001127246,0.003163321,0.0009090876,0.0044890367,0.0027540212,0.0030347158,0.0021171032],"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.00034776115,0.00009795765,0.00080903136,0.00022536825,0.00010326803,0.00016285758,0.00024766018,0.321166,0.0016719159,0.22029842,0.011507828,0.44336194],"study_design_scores_gemma":[0.000019298397,0.000018513972,0.00013747392,0.000041759777,0.000019868277,0.00005835965,0.000022522727,0.7688789,0.0008340088,0.22563933,0.0043179058,0.000012063528],"about_ca_topic_score_codex":0.0035426517,"about_ca_topic_score_gemma":0.004110474,"teacher_disagreement_score":0.008545991,"about_ca_system_score_codex":0.0013743411,"about_ca_system_score_gemma":0.0015241455,"threshold_uncertainty_score":0.028589189},"labels":[],"label_agreement":null},{"id":"W25359693","doi":"10.1007/978-3-642-25085-9_3","title":"Applications of Multilevel Thresholding Algorithms to Transcriptomics Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Windsor","funders":"","keywords":"Thresholding; Computer science; Normalization (sociology); Cluster analysis; DNA microarray; Data mining; Hierarchical clustering; Artificial intelligence; Segmentation; DNA sequencing; Algorithm; Pattern recognition (psychology); Image (mathematics); Biology; DNA; Gene; Gene expression; Genetics","score_opus":0.0498310048657238,"score_gpt":0.29566144074709005,"score_spread":0.24583043588136624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25359693","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.0039672833,0.00046467534,0.9934947,0.00014001688,0.000054522137,0.00003153959,0.00018470158,0.0011487297,0.0005138871],"genre_scores_gemma":[0.03334453,0.0004549427,0.9638614,0.000068764726,0.00006693826,0.00012588252,0.00059018494,0.00049328513,0.0009941236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982181,0.00057270785,0.0001680633,0.00028084603,0.0006380286,0.00012216409],"domain_scores_gemma":[0.9938355,0.0041458705,0.00031126992,0.00083494175,0.00075922365,0.000113213944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027638068,0.0008144927,0.0015396425,0.0022267161,0.00080715434,0.0021565382,0.0018108013,0.0011408508,0.004019184],"category_scores_gemma":[0.009515095,0.0007949792,0.002173312,0.00485736,0.0007425287,0.00094593264,0.0022534356,0.0022515922,0.0019105852],"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.00023187182,0.000093181596,0.0016800471,0.00049047905,0.0003115395,0.00018413675,0.0003097757,0.07777258,0.05012804,0.018238265,0.0071930354,0.843367],"study_design_scores_gemma":[0.000038568964,0.000077483826,0.0025023622,0.000061296094,0.00008122458,0.00025452676,0.00009357776,0.9089526,0.021550512,0.05717157,0.009155597,0.000060703074],"about_ca_topic_score_codex":0.002868319,"about_ca_topic_score_gemma":0.005888687,"teacher_disagreement_score":0.004019184,"about_ca_system_score_codex":0.00066406175,"about_ca_system_score_gemma":0.0011033225,"threshold_uncertainty_score":0.014616609},"labels":[],"label_agreement":null},{"id":"W2536714351","doi":"10.1007/978-3-319-53733-7_21","title":"On Finite-Index Indexed Grammars and Their Restrictions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Saskatchewan","funders":"","keywords":"Decidability; Rule-based machine translation; Bounded function; Indexed grammar; Discrete mathematics; Index (typography); Mathematics; Combinatorics; Computer science; Programming language; Artificial intelligence; Tree-adjoining grammar; Context-free grammar; Mathematical analysis","score_opus":0.016311217695042193,"score_gpt":0.2358414698239249,"score_spread":0.21953025212888272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536714351","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13331656,0.0065290234,0.37125182,0.0047523757,0.0008695146,0.00011031363,0.0012626622,0.00088125473,0.48102653],"genre_scores_gemma":[0.7916793,0.008907959,0.07024966,0.0013430683,0.0021635226,0.0003989636,0.003522358,0.0009920383,0.120743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984908,0.00037004153,0.00010969946,0.0002772326,0.000536274,0.0002159716],"domain_scores_gemma":[0.9969829,0.0020120502,0.0001584132,0.00044091124,0.00023442405,0.00017140184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163276,0.000852325,0.0011717834,0.0017231135,0.0019122508,0.003848336,0.0018876988,0.0015354333,0.011502553],"category_scores_gemma":[0.0047160652,0.0011248845,0.0015024472,0.003644681,0.0050948155,0.010850254,0.0039185276,0.00592709,0.003497778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018057966,0.000017432183,0.00008471711,0.000029243127,0.0000040972513,0.000078303456,0.00030607614,0.0006278218,0.00043425424,0.9898392,0.0012903867,0.0072703892],"study_design_scores_gemma":[0.0000034082368,0.0000036653023,0.000064682434,0.000009564244,0.0000025488177,0.000063021456,0.00004408225,0.0010234901,0.00014097914,0.9955012,0.0031379517,0.000005378523],"about_ca_topic_score_codex":0.0015294293,"about_ca_topic_score_gemma":0.0010959243,"teacher_disagreement_score":0.011502553,"about_ca_system_score_codex":0.0014502648,"about_ca_system_score_gemma":0.0010272078,"threshold_uncertainty_score":0.038479924},"labels":[],"label_agreement":null},{"id":"W2538225906","doi":"10.1007/978-3-319-49787-7_13","title":"The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","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":"Dalhousie University","funders":"","keywords":"Asynchronous communication; Vertex (graph theory); Computer science; Grid; Limiting; Graph; Mathematical optimization; Theoretical computer science; Mathematics; Computer network","score_opus":0.010990963148675974,"score_gpt":0.25996020255944535,"score_spread":0.24896923941076937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538225906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30938864,0.0006421538,0.6699503,0.0010931005,0.00017051889,0.00009631085,0.00010476651,0.0004145712,0.018139625],"genre_scores_gemma":[0.9732291,0.00032467055,0.01837018,0.00007464738,0.000076624114,0.00010486447,0.000053836167,0.00007079182,0.007695399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991247,0.00039830836,0.00004641591,0.0001345277,0.00019303846,0.00010298801],"domain_scores_gemma":[0.9867405,0.010466843,0.0008151675,0.00087542617,0.0006398003,0.00046227637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017300015,0.0005666726,0.0010129136,0.0010514235,0.00070270296,0.0021700705,0.0018726714,0.0018521193,0.004019692],"category_scores_gemma":[0.022532798,0.00078443455,0.0006172356,0.0010003081,0.0020457385,0.0030700078,0.0021454839,0.0013551016,0.0004246892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027119822,0.000059406688,0.0009821685,0.00010512422,0.00006682892,0.0002490971,0.00033429347,0.6441652,0.0028043676,0.32842267,0.0019816975,0.020557975],"study_design_scores_gemma":[0.00004457256,0.000036310747,0.0001941656,0.000009598954,0.000011650168,0.00005555197,0.000042083542,0.8884364,0.00031788493,0.110375725,0.00046412466,0.000012023241],"about_ca_topic_score_codex":0.0016378602,"about_ca_topic_score_gemma":0.00066910876,"teacher_disagreement_score":0.004019692,"about_ca_system_score_codex":0.0008544453,"about_ca_system_score_gemma":0.0005278091,"threshold_uncertainty_score":0.0134471655},"labels":[],"label_agreement":null},{"id":"W2538656450","doi":"10.1007/978-3-319-47665-0_26","title":"An Architecture for Biologically Grounded Real-Time Reflexive Behavior","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"Computer science; Reflexivity; Gaze; Architecture; Control (management); Valence (chemistry); Human–computer interaction; Systems architecture; Artificial intelligence","score_opus":0.05170913336866655,"score_gpt":0.3815690204611545,"score_spread":0.3298598870924879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538656450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009088668,0.0001652258,0.975223,0.00017436799,0.00009854103,0.00007001614,0.000077286015,0.0074313018,0.0076715965],"genre_scores_gemma":[0.36072165,0.00042523464,0.60986984,0.00037083327,0.00004977445,0.0003660887,0.00044479352,0.0009589626,0.026792914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.00004189002,0.000023533696,0.000107181295,0.00009253228,0.00003954876],"domain_scores_gemma":[0.9996555,0.00009928876,0.000021704836,0.00011392983,0.00007182114,0.000037809023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422405,0.0005080187,0.0003800472,0.00026454942,0.00046246205,0.0014300839,0.0025965823,0.0010436877,0.010512333],"category_scores_gemma":[0.0011477416,0.0005730726,0.00062792795,0.00019899671,0.0010322571,0.0019344802,0.001768388,0.0012285133,0.003277162],"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.0003481103,0.0002930544,0.0012147295,0.00054514065,0.00014397822,0.00038283554,0.0016091699,0.06915433,0.24582902,0.31791994,0.009474018,0.35308567],"study_design_scores_gemma":[0.00007633814,0.00035245958,0.00096363743,0.0001106876,0.00014573024,0.00032006027,0.00021412602,0.6058435,0.07863531,0.24880694,0.06444379,0.00008746187],"about_ca_topic_score_codex":0.0015534755,"about_ca_topic_score_gemma":0.0021379539,"teacher_disagreement_score":0.010512333,"about_ca_system_score_codex":0.0004986461,"about_ca_system_score_gemma":0.0007035496,"threshold_uncertainty_score":0.035167217},"labels":[],"label_agreement":null},{"id":"W2538860999","doi":"10.1007/978-3-319-47874-6_1","title":"Towards Understanding User Participation in Stack Overflow Using Profile Data","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Expert finding and Q&A systems","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 Saskatchewan","funders":"","keywords":"Reputation; Computer science; User profile; Stack (abstract data type); Quality (philosophy); Social network (sociolinguistics); Order (exchange); Data mining; Information retrieval; World Wide Web; Social media","score_opus":0.1298974629843937,"score_gpt":0.33237048273278125,"score_spread":0.20247301974838755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538860999","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.8831315,0.00034783257,0.100600645,0.0008902216,0.000026024525,0.00020957264,0.0018575446,0.00069415907,0.012242592],"genre_scores_gemma":[0.9828143,0.00008707815,0.015587342,0.000047174017,0.000010750353,0.000055868157,0.0006564888,0.000043107717,0.00069778116],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99741614,0.0012674115,0.00016250047,0.00040246113,0.00046068724,0.00029073295],"domain_scores_gemma":[0.97738713,0.016273478,0.0021466985,0.0015728845,0.0018927284,0.0007271068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033497754,0.00044394896,0.00040099947,0.0027655882,0.0009394291,0.0048997295,0.00089196215,0.0013449448,0.0017395555],"category_scores_gemma":[0.025733748,0.0003880576,0.00046962313,0.0025153141,0.00077871914,0.011437145,0.0024485048,0.0016824565,0.0006625942],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064219505,0.0005644309,0.664217,0.00046447682,0.00014962934,0.00041922147,0.07196077,0.005832605,0.011771993,0.02696779,0.0037082585,0.21330166],"study_design_scores_gemma":[0.00004154199,0.00040524386,0.42235363,0.0006309952,0.00026327732,0.0008490303,0.10941577,0.33580855,0.015917871,0.075999536,0.03806447,0.0002500581],"about_ca_topic_score_codex":0.012007825,"about_ca_topic_score_gemma":0.0107577965,"teacher_disagreement_score":0.012007825,"about_ca_system_score_codex":0.0009734681,"about_ca_system_score_gemma":0.0012091398,"threshold_uncertainty_score":0.023875892},"labels":[],"label_agreement":null},{"id":"W2539629874","doi":"10.1007/978-3-319-48965-0_6","title":"NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"is_retracted":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":"Isogeny; Computer science; Cryptosystem; Speedup; Key exchange; Parallel computing; Supersingular elliptic curve; Affine transformation; Cryptography; Arithmetic; Encryption; Public-key cryptography; Mathematics; Algorithm; Elliptic curve; Operating system","score_opus":0.01393316525482611,"score_gpt":0.27001902244374476,"score_spread":0.25608585718891863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539629874","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.10764627,0.0015845429,0.80454016,0.0008465577,0.00055250205,0.0007241955,0.0014221345,0.032431856,0.05025172],"genre_scores_gemma":[0.7179876,0.00047625616,0.2474865,0.00042761862,0.00010563026,0.0005198109,0.0022718485,0.00094103784,0.029783702],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991398,0.00017067812,0.00007307031,0.0001186563,0.0002790449,0.00021879647],"domain_scores_gemma":[0.99955505,0.00007095385,0.000035428628,0.00022873013,0.00007666594,0.000033235585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353864,0.0004880076,0.0008681299,0.0006641428,0.0007385158,0.0014691778,0.0015720894,0.0007000807,0.009999579],"category_scores_gemma":[0.0012045446,0.0003776125,0.0004408783,0.0006176617,0.00042835195,0.0023073107,0.0026861415,0.0012418382,0.00315718],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037689523,0.0004913675,0.002409227,0.00090721674,0.00017830347,0.0009834863,0.0006929174,0.014599844,0.118883915,0.20584902,0.07045411,0.58078164],"study_design_scores_gemma":[0.000642166,0.0011480537,0.0032192913,0.00028776852,0.00026826427,0.0017050072,0.00032530856,0.3887522,0.23745349,0.15433763,0.21159403,0.00026691228],"about_ca_topic_score_codex":0.00041789658,"about_ca_topic_score_gemma":0.000654333,"teacher_disagreement_score":0.009999579,"about_ca_system_score_codex":0.0007066948,"about_ca_system_score_gemma":0.0011102326,"threshold_uncertainty_score":0.033451915},"labels":[],"label_agreement":null},{"id":"W2540738838","doi":"10.1007/978-3-319-48758-8_40","title":"GenB: A General Solver for AGM Revision","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Solver; Simple (philosophy); Set (abstract data type); User interface; Operator (biology); Range (aeronautics); Problem solver; Interface (matter); Programming language; Selection (genetic algorithm); Human–computer interaction; Software engineering; Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.020541649251697817,"score_gpt":0.25716990182890437,"score_spread":0.23662825257720654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540738838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051611895,0.0006514692,0.90248483,0.0012224697,0.0005894814,0.00035981028,0.0032214455,0.048612624,0.037696756],"genre_scores_gemma":[0.118242316,0.00072167674,0.8163664,0.0011408554,0.0003426892,0.0004771261,0.007056994,0.01445858,0.041193377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983405,0.00040159168,0.00016935922,0.00037059182,0.00050664763,0.00021134058],"domain_scores_gemma":[0.99840885,0.0007286796,0.00007203829,0.0004319897,0.00028852603,0.000070032635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667468,0.0017274126,0.001477309,0.0013793954,0.0011066757,0.0035488533,0.0038143613,0.0025461281,0.04893115],"category_scores_gemma":[0.006105763,0.0012986438,0.002457017,0.001419547,0.0014072612,0.0055145305,0.0053720637,0.0038257902,0.01802052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044795984,0.00018350079,0.0006792732,0.0014103246,0.00014981083,0.00047026738,0.00049229665,0.012493148,0.00740368,0.30455643,0.19245405,0.4792592],"study_design_scores_gemma":[0.00037708433,0.000060335675,0.00023483111,0.00024702476,0.00014101704,0.00060119113,0.00021362396,0.13498503,0.016937794,0.65989256,0.18622176,0.00008781703],"about_ca_topic_score_codex":0.0021595336,"about_ca_topic_score_gemma":0.004141761,"teacher_disagreement_score":0.04893115,"about_ca_system_score_codex":0.001080918,"about_ca_system_score_gemma":0.0021336316,"threshold_uncertainty_score":0.16369098},"labels":[],"label_agreement":null},{"id":"W254188420","doi":"10.1007/978-3-540-24654-1_20","title":"Additive Autocorrelation of Resilient Boolean Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Boolean function; Function (biology); Transformation (genetics); Nonlinear system; Algebraic number; Dual (grammatical number); Mathematics; Computer science; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.011021309562656836,"score_gpt":0.22364868040168678,"score_spread":0.21262737083902994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W254188420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39842802,0.0023563465,0.47936141,0.0009808798,0.00050095,0.00006145455,0.00027891746,0.0011658149,0.11686626],"genre_scores_gemma":[0.9639417,0.00070245337,0.01758636,0.00018947052,0.00033286045,0.000041909003,0.00013282096,0.000116868294,0.016955521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903214,0.00020784017,0.000043182426,0.00014214363,0.00038600081,0.00018866832],"domain_scores_gemma":[0.99729913,0.0014637314,0.00031430778,0.00042098959,0.00027414726,0.00022766697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063349935,0.00069442624,0.0007424385,0.0015707054,0.0006496948,0.0016229401,0.000933156,0.00077510474,0.0047247508],"category_scores_gemma":[0.0052608647,0.00045767552,0.00055304344,0.0011731605,0.001540688,0.0017061861,0.0015863109,0.0017445674,0.00068399205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111644054,0.00002922874,0.00029304335,0.00005957411,0.000014566608,0.00015678394,0.00013235686,0.012207952,0.0050951014,0.9587869,0.0014032432,0.02170955],"study_design_scores_gemma":[0.00002087575,0.00006844699,0.0004891052,0.000029577981,0.000023465373,0.00040213935,0.00004955922,0.065925464,0.004529339,0.9249564,0.0034676914,0.0000379501],"about_ca_topic_score_codex":0.0005115226,"about_ca_topic_score_gemma":0.0005751262,"teacher_disagreement_score":0.0047247508,"about_ca_system_score_codex":0.0010507226,"about_ca_system_score_gemma":0.00054473354,"threshold_uncertainty_score":0.01580584},"labels":[],"label_agreement":null},{"id":"W2542179328","doi":"10.1007/978-3-319-48674-1_55","title":"An Empirical Study and Comparison for Tweet Sentiment Analysis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Priority Academic Program Development of Jiangsu Higher Education Institutions","keywords":"Computer science; Sentiment analysis; Artificial intelligence; Support vector machine; Random forest; Machine learning; Feature selection; Domain (mathematical analysis); Selection (genetic algorithm); Empirical research; Feature (linguistics); Deep learning; Natural language processing","score_opus":0.03888278192669729,"score_gpt":0.3434988057895813,"score_spread":0.304616023862884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542179328","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.9480561,0.001845835,0.032357506,0.00047410748,0.00022147158,0.0006248552,0.0019154089,0.00015931854,0.01434538],"genre_scores_gemma":[0.97122955,0.0008391013,0.021933468,0.00008824374,0.00014796745,0.0004618014,0.0029644053,0.00007255867,0.0022629413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937691,0.003416563,0.0006310912,0.0005069113,0.0015169657,0.00015930439],"domain_scores_gemma":[0.9532597,0.03460913,0.0020849297,0.0022521557,0.0072180172,0.00057614374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071996753,0.0004050831,0.0003631271,0.003803907,0.00088649977,0.001495036,0.0006151681,0.00061069534,0.00456394],"category_scores_gemma":[0.054209255,0.00016124632,0.00058073096,0.00473723,0.0006107434,0.0030729554,0.0011020515,0.0005814867,0.0010029462],"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.0038356523,0.0033824102,0.37744725,0.002484872,0.0007287853,0.0004990606,0.0073887473,0.0025401763,0.020202853,0.014271061,0.016190674,0.55102843],"study_design_scores_gemma":[0.00068524573,0.006548361,0.7485571,0.0008254597,0.0019945763,0.0029313774,0.023638828,0.13116777,0.019556163,0.0127275,0.051128697,0.00023895959],"about_ca_topic_score_codex":0.001561744,"about_ca_topic_score_gemma":0.0016224085,"teacher_disagreement_score":0.0071996753,"about_ca_system_score_codex":0.00078023586,"about_ca_system_score_gemma":0.00045261194,"threshold_uncertainty_score":0.038075984},"labels":[],"label_agreement":null},{"id":"W254432004","doi":"10.1007/978-3-642-41184-7_46","title":"Mixed Kernel Function SVM for Pulmonary Nodule Recognition","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Lung Cancer Diagnosis and Treatment","field":"Medicine","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":"Athabasca University","funders":"Jilin University; People's Government of Jilin Province; Changchun University of Technology","keywords":"Support vector machine; Kernel (algebra); Artificial intelligence; Computer science; Pattern recognition (psychology); Polynomial kernel; Sensitivity (control systems); Radial basis function kernel; Gaussian function; Generalization; Hyperparameter optimization; Kernel method; Gaussian; Mathematics","score_opus":0.03175239665533757,"score_gpt":0.2575367262672479,"score_spread":0.2257843296119103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W254432004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00758505,0.005522619,0.9795619,0.00019971016,0.00028089265,0.000023145572,0.0002297116,0.0018630389,0.004733812],"genre_scores_gemma":[0.2476961,0.0058755265,0.6804456,0.00030924412,0.00043284078,0.00011957027,0.0019076569,0.00078429905,0.06242909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980956,0.000032029173,0.000013484007,0.000043718195,0.00008420749,0.00001698667],"domain_scores_gemma":[0.9997477,0.000078566925,0.000014713026,0.000035911125,0.00011386918,0.000009384018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036236874,0.00050887436,0.0005833566,0.00043268056,0.00014187976,0.00056731194,0.000889634,0.00066046324,0.0051200455],"category_scores_gemma":[0.00069439714,0.0002651992,0.00052136736,0.00062086416,0.0001216416,0.00094237574,0.0005832198,0.0009182925,0.0042024674],"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.00006295598,0.000037810187,0.00035375392,0.0001675886,0.00004258649,0.00003687364,0.000019976436,0.016866285,0.017725255,0.004414715,0.012437949,0.9478344],"study_design_scores_gemma":[0.0000049192777,0.00006220018,0.001425387,0.000037059694,0.000033328935,0.00039205994,0.000019100471,0.9426757,0.019415151,0.00955434,0.026358675,0.000022011694],"about_ca_topic_score_codex":0.0005487051,"about_ca_topic_score_gemma":0.0012184248,"teacher_disagreement_score":0.0051200455,"about_ca_system_score_codex":0.00020265375,"about_ca_system_score_gemma":0.00020304484,"threshold_uncertainty_score":0.01712823},"labels":[],"label_agreement":null},{"id":"W2544488729","doi":"10.1007/978-3-319-48965-0_32","title":"An Efficient Approach to Detect TorrentLocker Ransomware in Computer Systems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Ransomware; Computer science; Malware; Encryption; Focus (optics); JPEG; Process (computing); Computer security; Data mining; Artificial intelligence; Data compression; Operating system","score_opus":0.013674840857906797,"score_gpt":0.24832144908325238,"score_spread":0.23464660822534558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544488729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047418356,0.0010331136,0.9425344,0.00020641452,0.00021944818,0.0003543089,0.00036787894,0.0036072587,0.004258808],"genre_scores_gemma":[0.26975498,0.00061411597,0.7138551,0.00020083165,0.00015864623,0.00023354182,0.0011052343,0.00019994454,0.013877629],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986738,0.00016454104,0.00007026473,0.0001894835,0.00074194913,0.00016006008],"domain_scores_gemma":[0.9989361,0.00026618686,0.000103689206,0.00024113912,0.00040951368,0.00004335827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005596461,0.0014061502,0.0012151108,0.0027246354,0.0007392175,0.0013210451,0.001543411,0.0011249675,0.004590614],"category_scores_gemma":[0.0022758283,0.0005178203,0.0008767404,0.0013536949,0.00036040568,0.0017097001,0.0015160324,0.0010507626,0.002827825],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003233349,0.00038226836,0.0033200132,0.00024660834,0.00013541518,0.00031391162,0.00013016754,0.03296254,0.06195009,0.009292728,0.009709516,0.88123333],"study_design_scores_gemma":[0.000019466124,0.00017052401,0.0020272874,0.000022374408,0.000053914024,0.00068256806,0.0001042629,0.95777726,0.027494343,0.006692773,0.0049234945,0.000031739517],"about_ca_topic_score_codex":0.002579676,"about_ca_topic_score_gemma":0.0065273466,"teacher_disagreement_score":0.004590614,"about_ca_system_score_codex":0.0006285713,"about_ca_system_score_gemma":0.0010682493,"threshold_uncertainty_score":0.015357077},"labels":[],"label_agreement":null},{"id":"W2544933647","doi":"10.1007/978-3-319-48749-6_12","title":"Fast Searching on Complete k-partite Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Regina","funders":"","keywords":"Bipartite graph; Combinatorics; Computer science; Complete bipartite graph; Upper and lower bounds; Discrete mathematics; Graph; Mathematics","score_opus":0.03263267048262919,"score_gpt":0.29235206204778147,"score_spread":0.2597193915651523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544933647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30674383,0.0032792604,0.5547258,0.0016476612,0.00031808726,0.00035159755,0.0033381404,0.008439176,0.121156454],"genre_scores_gemma":[0.5246114,0.0024564015,0.40477622,0.00032799217,0.00023118345,0.00027716943,0.005353233,0.0019175427,0.06004875],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993327,0.00013175598,0.000035536603,0.00014413323,0.00020960945,0.00014624394],"domain_scores_gemma":[0.9969908,0.001853186,0.00013640156,0.00065493485,0.00023694846,0.00012757396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004360936,0.0009401293,0.0014192687,0.0016327307,0.0013540341,0.0021739698,0.0020157536,0.0012941671,0.017103625],"category_scores_gemma":[0.003904447,0.00086716755,0.0009916754,0.0041908734,0.000821946,0.0058456804,0.0023248529,0.0012030877,0.0040235957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010775902,0.00022114297,0.001273735,0.0023181385,0.00015005551,0.0003705055,0.0008265034,0.132181,0.023276089,0.20909117,0.09639577,0.53281844],"study_design_scores_gemma":[0.00017406799,0.00015535722,0.000868308,0.00012408668,0.00008449035,0.00050003163,0.00032890314,0.40458184,0.009127565,0.5650855,0.018913783,0.00005608868],"about_ca_topic_score_codex":0.002418767,"about_ca_topic_score_gemma":0.0041440018,"teacher_disagreement_score":0.017103625,"about_ca_system_score_codex":0.0009833974,"about_ca_system_score_gemma":0.0008632907,"threshold_uncertainty_score":0.0572173},"labels":[],"label_agreement":null},{"id":"W2546323316","doi":"10.1007/978-3-319-48749-6_26","title":"Constrained Light Deployment for Reducing Energy Consumption in Buildings","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Victoria","funders":"","keywords":"Computer science; Heuristics; Software deployment; Energy consumption; Set (abstract data type); Point (geometry); Radiosity (computer graphics); Mathematical optimization; Illuminance; Binary number; Algorithm; Computer graphics (images); Mathematics; Optics; Geometry","score_opus":0.018805740040696635,"score_gpt":0.25366861615622266,"score_spread":0.23486287611552603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546323316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09040988,0.002290382,0.8798357,0.0002874741,0.00018253579,0.000057413945,0.00027884956,0.0009196964,0.025737992],"genre_scores_gemma":[0.92182434,0.0012656089,0.06773256,0.000067601664,0.000042460382,0.00004495398,0.0002851532,0.0002092943,0.008528014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998683,0.000023128468,0.0000026938749,0.000022954173,0.00004646968,0.000036403162],"domain_scores_gemma":[0.9998903,0.00004790576,0.0000074833156,0.000016372804,0.000025711992,0.000012131523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012324723,0.00077373354,0.0006293056,0.00036986332,0.00038682765,0.0006364183,0.00073572464,0.00037728026,0.0064233504],"category_scores_gemma":[0.00046594866,0.00027839435,0.00030386553,0.0008285437,0.0002414461,0.00066201977,0.00074594363,0.00046824192,0.0007542249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036999225,0.00018502056,0.0011841266,0.00033277288,0.000050420324,0.00014172807,0.00010103871,0.5560335,0.04193346,0.02075505,0.010582354,0.36833048],"study_design_scores_gemma":[0.00002128096,0.00010573171,0.0012121606,0.00003842801,0.0000379049,0.000083926796,0.00014524268,0.96306574,0.011342568,0.015620429,0.0083074905,0.000019090014],"about_ca_topic_score_codex":0.0024059606,"about_ca_topic_score_gemma":0.005374569,"teacher_disagreement_score":0.0064233504,"about_ca_system_score_codex":0.0003397985,"about_ca_system_score_gemma":0.00029369915,"threshold_uncertainty_score":0.02148825},"labels":[],"label_agreement":null},{"id":"W2547207819","doi":"10.1007/978-3-319-48881-3_16","title":"Solving Rendering Issues in Realistic 3D Immersion for Visual Rehabilitation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Rendering (computer graphics); Computer science; Immersion (mathematics); Human–computer interaction; Virtual reality; Computer vision; Artificial intelligence; Computer graphics (images); Multimedia","score_opus":0.015815974475036187,"score_gpt":0.30955860119783163,"score_spread":0.29374262672279544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547207819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01076214,0.0005385477,0.97950935,0.00021307461,0.00007923325,0.000038796443,0.000037917245,0.0006817815,0.008139172],"genre_scores_gemma":[0.39281246,0.0017916654,0.5802506,0.00019319377,0.00014180492,0.00008564775,0.00019946731,0.0010818214,0.023443352],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948525,0.00010061854,0.000018942554,0.000056561672,0.00028894842,0.00004962066],"domain_scores_gemma":[0.99933964,0.0004067446,0.000040272746,0.00009939265,0.00008770258,0.000026201875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006339034,0.00084927963,0.00065182365,0.00024129696,0.0004092732,0.0019497223,0.00096551614,0.0011513574,0.00901103],"category_scores_gemma":[0.002461487,0.00072689995,0.00078100356,0.00026977324,0.0007296382,0.0017917072,0.0018409096,0.0017367756,0.0011233825],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029939887,0.00015274469,0.00048288534,0.0010251304,0.00008455064,0.0006563628,0.0019361023,0.2630891,0.1589047,0.14375505,0.011846765,0.41776726],"study_design_scores_gemma":[0.000041821237,0.00013177237,0.00033888468,0.00013105889,0.000040768227,0.00081570604,0.0003461755,0.84546524,0.041819636,0.07808422,0.03272479,0.000059905586],"about_ca_topic_score_codex":0.001445119,"about_ca_topic_score_gemma":0.001820853,"teacher_disagreement_score":0.00901103,"about_ca_system_score_codex":0.00044225575,"about_ca_system_score_gemma":0.00041926984,"threshold_uncertainty_score":0.03014487},"labels":[],"label_agreement":null},{"id":"W2547966610","doi":"10.1007/978-3-319-48314-6_19","title":"Asynchronous Broadcasting with Bivalent Beeps","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Asynchronous communication; Broadcasting (networking); Computer network; Node (physics); Anonymity; Theoretical computer science; Computer security","score_opus":0.027451130262717824,"score_gpt":0.2543659421237031,"score_spread":0.22691481186098528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547966610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066696174,0.0014779354,0.8371722,0.00022796729,0.00044561224,0.00010776559,0.00016068484,0.001000718,0.09271088],"genre_scores_gemma":[0.84838545,0.0009823976,0.107056074,0.000182946,0.00012874253,0.00014686013,0.00015185613,0.00017231496,0.04279337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999816,0.000035804147,0.000011166049,0.000044595883,0.000059790043,0.00003258314],"domain_scores_gemma":[0.99962187,0.00020067283,0.000025254105,0.00006636922,0.000052085008,0.000033757846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022521202,0.00038164447,0.0004207685,0.00049311685,0.00045676786,0.0007854136,0.0009252676,0.0005534371,0.0092961565],"category_scores_gemma":[0.0010812995,0.00024224877,0.00025032778,0.0006913267,0.00042808458,0.0007683288,0.00086011714,0.0006465658,0.0012061886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007992156,0.0001231259,0.00059515244,0.00049029395,0.00006145786,0.00034482873,0.00032803294,0.07478894,0.11347134,0.45262766,0.008128372,0.34824163],"study_design_scores_gemma":[0.00019480301,0.0002831074,0.00087056303,0.00011372472,0.00007410236,0.00065009925,0.00013032561,0.7062219,0.03099691,0.229753,0.030639509,0.00007196756],"about_ca_topic_score_codex":0.00052586343,"about_ca_topic_score_gemma":0.00067291246,"teacher_disagreement_score":0.0092961565,"about_ca_system_score_codex":0.00038067414,"about_ca_system_score_gemma":0.0002031188,"threshold_uncertainty_score":0.031098723},"labels":[],"label_agreement":null},{"id":"W254961257","doi":"10.1007/978-3-319-09284-3_28","title":"Approximating Highly Satisfiable Random 2-SAT","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Window (computing); Connection (principal bundle); Image (mathematics); Distribution (mathematics); Combinatorics; Polynomial; Computer science; Time complexity; Algorithm; Mathematics; Discrete mathematics; Set (abstract data type); Uniform distribution (continuous); Probability distribution; Artificial intelligence; Statistics; Geometry; Mathematical analysis","score_opus":0.010372630650418994,"score_gpt":0.2176377306963465,"score_spread":0.20726510004592752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W254961257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12715152,0.0031122107,0.825473,0.002633709,0.0005394121,0.0002581009,0.0015958037,0.005652352,0.03358387],"genre_scores_gemma":[0.596097,0.0010521319,0.37758106,0.0010758527,0.0004617299,0.0004817119,0.0037463363,0.001651358,0.017852755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554634,0.0018359656,0.00016968176,0.00066998857,0.0013130299,0.0004649154],"domain_scores_gemma":[0.9877101,0.009266169,0.00047463094,0.0017402157,0.00050687836,0.00030202453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476552,0.0021495598,0.0022928591,0.0015074938,0.0007055885,0.0024222867,0.004043347,0.0022717058,0.014919001],"category_scores_gemma":[0.019617978,0.0013125082,0.0019794134,0.002964535,0.001703393,0.0040776134,0.0038552298,0.0033086278,0.002179969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012114035,0.00032453853,0.0025142035,0.00066419074,0.00020123487,0.00020170909,0.00014660855,0.7553265,0.0036877305,0.088351645,0.022902062,0.12446812],"study_design_scores_gemma":[0.000079546284,0.00006323786,0.00022494899,0.00002870866,0.000023695116,0.00006979522,0.000022173122,0.94316125,0.0007074845,0.05419029,0.0014201121,0.000008899925],"about_ca_topic_score_codex":0.0030307553,"about_ca_topic_score_gemma":0.007551117,"teacher_disagreement_score":0.014919001,"about_ca_system_score_codex":0.0028807083,"about_ca_system_score_gemma":0.0018936627,"threshold_uncertainty_score":0.049909055},"labels":[],"label_agreement":null},{"id":"W2551643417","doi":"10.1007/978-3-319-71147-8_10","title":"Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Neighbourhood (mathematics); Degree (music); Graph; Theoretical computer science; Algorithm; Mathematics; Physics","score_opus":0.030041218049764597,"score_gpt":0.2667288147417829,"score_spread":0.2366875966920183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551643417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07918093,0.00074001483,0.8570471,0.0034265877,0.00020081694,0.0003742326,0.0025680936,0.0036865484,0.05277571],"genre_scores_gemma":[0.6353684,0.0009399986,0.297442,0.0009670804,0.00052875903,0.00063401635,0.003566254,0.0032897373,0.05726385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730504,0.00059395365,0.00012902539,0.0010273346,0.0005298978,0.00041475068],"domain_scores_gemma":[0.9741969,0.018415073,0.0010559895,0.004539098,0.0011670165,0.0006259142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019905043,0.0016361815,0.0036991339,0.0012282348,0.002406549,0.0059625213,0.0061340444,0.0041121957,0.02039305],"category_scores_gemma":[0.028478244,0.0011483768,0.0023199718,0.0034425866,0.0025645043,0.010494715,0.0033478532,0.0054380833,0.00413815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037801487,0.00030726002,0.0009089769,0.0007502647,0.00013201826,0.00050591066,0.00076816656,0.35889342,0.0037461254,0.50960237,0.034646526,0.08936092],"study_design_scores_gemma":[0.00006326785,0.000027131275,0.00012564746,0.000035731955,0.00005269435,0.00017289979,0.000102759186,0.3447727,0.0013065052,0.6489366,0.0043800436,0.000023937559],"about_ca_topic_score_codex":0.0049080085,"about_ca_topic_score_gemma":0.007864226,"teacher_disagreement_score":0.02039305,"about_ca_system_score_codex":0.003441756,"about_ca_system_score_gemma":0.0029576076,"threshold_uncertainty_score":0.06822151},"labels":[],"label_agreement":null},{"id":"W2551844214","doi":"10.1007/978-3-319-49445-6","title":"Security, Privacy, and Applied Cryptography Engineering","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Computer security; Financial cryptography; Internet privacy; Public-key cryptography; Encryption","score_opus":0.006023707626348903,"score_gpt":0.20653332921672757,"score_spread":0.20050962159037866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551844214","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067148986,0.2772269,0.15135986,0.0124860145,0.007045806,0.00013284467,0.00026630107,0.0005323921,0.54423505],"genre_scores_gemma":[0.13751623,0.22030468,0.07137428,0.0037986345,0.010263701,0.0002962997,0.00043949872,0.00033888934,0.5556678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942064,0.0000963343,0.000027966782,0.00008124975,0.0003297171,0.000044176282],"domain_scores_gemma":[0.9995547,0.00020185068,0.000029535138,0.00010086073,0.000088003166,0.000024989171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043992826,0.0010391858,0.0008521923,0.0012638356,0.0007198722,0.0031890038,0.0006099496,0.0011238251,0.011389858],"category_scores_gemma":[0.0013491682,0.00042675206,0.0004639507,0.0016857682,0.0026846116,0.003732456,0.0012916335,0.0035208948,0.0059011052],"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.000036519195,0.000061403654,0.00013552413,0.0006178232,0.000024306548,0.000077310615,0.00020888024,0.0029137016,0.0026057274,0.6838325,0.08834387,0.22114249],"study_design_scores_gemma":[0.000009634938,0.000060016726,0.00033038898,0.00032238485,0.000012947531,0.00052226725,0.000084563246,0.0072889044,0.0014112383,0.59349096,0.39644718,0.000019533882],"about_ca_topic_score_codex":0.00031116948,"about_ca_topic_score_gemma":0.00030262236,"teacher_disagreement_score":0.011389858,"about_ca_system_score_codex":0.0011668068,"about_ca_system_score_gemma":0.0009601095,"threshold_uncertainty_score":0.038102865},"labels":[],"label_agreement":null},{"id":"W2552071978","doi":"10.1007/978-3-319-48869-1_1","title":"Stupid Tool Tricks for Smart Model Based Design","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"McMaster University","funders":"","keywords":"Computer science; Avionics; Documentation; Certification; Automotive industry; Process (computing); Software engineering; Engineering management; Risk analysis (engineering); Systems engineering; Process management; Manufacturing engineering; Engineering","score_opus":0.02151395995712759,"score_gpt":0.2151129234065421,"score_spread":0.1935989634494145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552071978","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.0012954507,0.00074846094,0.9828011,0.002134583,0.00034555123,0.000033791835,0.000079103986,0.0021066472,0.010455383],"genre_scores_gemma":[0.081337534,0.0018758904,0.88621247,0.0021949795,0.00046124108,0.00028063866,0.00025719032,0.0030946026,0.024285454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977869,0.0007360597,0.00014626271,0.00025553987,0.0009596422,0.00011554808],"domain_scores_gemma":[0.9946444,0.002332514,0.00011251013,0.002416241,0.00037322554,0.000121110024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034902322,0.0014736552,0.0010810456,0.0009132765,0.0013117952,0.0032805235,0.0024108526,0.001793027,0.018951066],"category_scores_gemma":[0.011927435,0.0016928319,0.0018813146,0.0006900553,0.004545805,0.011525466,0.003982085,0.008573447,0.007360956],"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.00006557542,0.00004865336,0.00021729592,0.00031053706,0.00007528174,0.00008401138,0.00041717352,0.01013533,0.0023618964,0.82042265,0.024941681,0.14092007],"study_design_scores_gemma":[0.000029639416,0.00004155907,0.000047605517,0.00012446,0.0000330773,0.00010663551,0.000051992258,0.028730063,0.0018694719,0.8882313,0.08070596,0.000028384507],"about_ca_topic_score_codex":0.0008833724,"about_ca_topic_score_gemma":0.0015097355,"teacher_disagreement_score":0.018951066,"about_ca_system_score_codex":0.00091774407,"about_ca_system_score_gemma":0.0008564852,"threshold_uncertainty_score":0.06339759},"labels":[],"label_agreement":null},{"id":"W255242374","doi":"10.1007/978-3-319-11955-7_73","title":"Collaborative Semantic Management and Automated Analysis of Scientific Literature","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Metadata; Semantic Web; World Wide Web; Information overload; Knowledge base; Annotation; Scientific literature; Data science; Knowledge management; Information retrieval; Artificial intelligence","score_opus":0.008554570135625252,"score_gpt":0.24282788974279143,"score_spread":0.23427331960716619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W255242374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013007767,0.002492511,0.965175,0.0013045259,0.00022256542,0.00031068962,0.0013253113,0.006213721,0.009947791],"genre_scores_gemma":[0.081893474,0.0012230163,0.9041937,0.0001760867,0.00029126718,0.00030382487,0.0057160445,0.00076851243,0.0054341173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9844372,0.0051812357,0.0017933403,0.003023037,0.00501132,0.0005538496],"domain_scores_gemma":[0.96274203,0.017822726,0.0021734252,0.011614053,0.0046801195,0.0009676355],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01208377,0.001332152,0.0020841586,0.023590488,0.0034660215,0.011387453,0.005327056,0.0022671074,0.0076048505],"category_scores_gemma":[0.04026795,0.0011830955,0.0036433118,0.01642568,0.0022577182,0.015127828,0.010722667,0.0023504852,0.0046524066],"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.00021569642,0.00036827812,0.0024429618,0.0007082112,0.00039637586,0.0002733438,0.0024940164,0.006250652,0.006750527,0.08954465,0.023552533,0.8670028],"study_design_scores_gemma":[0.00009963007,0.00011840563,0.0033214507,0.0004677579,0.00062308536,0.00077315536,0.002321096,0.17895111,0.029991338,0.6012616,0.18190813,0.00016322361],"about_ca_topic_score_codex":0.0034146039,"about_ca_topic_score_gemma":0.0054704105,"teacher_disagreement_score":0.98791623,"about_ca_system_score_codex":0.0020511886,"about_ca_system_score_gemma":0.0054255407,"threshold_uncertainty_score":0.063905835},"labels":[],"label_agreement":null},{"id":"W255407626","doi":"10.1007/978-3-319-07221-0_21","title":"The Usefulness of Log Based Clustering in a Complex Simulation Environment","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 British Columbia","funders":"","keywords":"Computer science; Cluster analysis; Exploratory data analysis; Context (archaeology); Data mining; Point (geometry); Exploratory analysis; Machine learning; Artificial intelligence; Action (physics); Layer (electronics); Exploratory research; Data science","score_opus":0.042091617347204874,"score_gpt":0.2484196301307797,"score_spread":0.20632801278357482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W255407626","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.5116547,0.00042356513,0.4743772,0.0004923341,0.000096926226,0.00012736581,0.00019538283,0.0039198636,0.008712698],"genre_scores_gemma":[0.9499907,0.000093956594,0.048568256,0.000029305933,0.000024508405,0.000027749844,0.000109318,0.00020823165,0.0009480374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984688,0.00092967716,0.000055862205,0.00017036029,0.00030780907,0.00006745901],"domain_scores_gemma":[0.97388184,0.021025661,0.0008053334,0.0021998005,0.0015487217,0.00053867884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023501553,0.0005706215,0.00061392196,0.0012163278,0.00082346494,0.0015638117,0.0012303718,0.0012399541,0.0020548855],"category_scores_gemma":[0.02262853,0.0004210016,0.00028360094,0.0011143809,0.0007269609,0.0031138787,0.0012013826,0.0007595106,0.00043701206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029024268,0.00062112306,0.014824661,0.00019591681,0.00008111071,0.00016428532,0.00059493043,0.6959942,0.009196607,0.009525236,0.0024191572,0.26348025],"study_design_scores_gemma":[0.00001907029,0.00016744951,0.001847475,0.000008224455,0.000019063202,0.00004544729,0.000085369364,0.99168956,0.0021222886,0.0037005343,0.0002789499,0.000016646383],"about_ca_topic_score_codex":0.004894176,"about_ca_topic_score_gemma":0.004082734,"teacher_disagreement_score":0.004894176,"about_ca_system_score_codex":0.00080915116,"about_ca_system_score_gemma":0.0006481622,"threshold_uncertainty_score":0.012428939},"labels":[],"label_agreement":null},{"id":"W2554383746","doi":"10.1007/978-3-319-48869-1","title":"Verified Software. Theories, Tools, and Experiments","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Computer science; Software engineering","score_opus":0.07323841759567382,"score_gpt":0.3723079387014487,"score_spread":0.2990695211057749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554383746","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007120713,0.027727565,0.84806854,0.0032559133,0.0012341811,0.00034157085,0.0014476895,0.007449925,0.10335387],"genre_scores_gemma":[0.25162345,0.025423381,0.62710947,0.0018211675,0.001040508,0.0011510692,0.003498374,0.0033966275,0.08493596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951265,0.0014279091,0.00033336863,0.00045276017,0.0025287024,0.00013080938],"domain_scores_gemma":[0.9877908,0.0076291794,0.00043719058,0.0027617055,0.0012539285,0.00012717299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030955605,0.0015295496,0.0011533618,0.0018355934,0.000729261,0.0034265986,0.0019619053,0.0021411018,0.01768147],"category_scores_gemma":[0.013706382,0.0012656648,0.000847596,0.0020383883,0.0028169882,0.005565484,0.0018364341,0.0027851784,0.006499375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121120465,0.0001268637,0.00044655465,0.0014221943,0.000038786337,0.00008988746,0.00020667637,0.010426432,0.002190346,0.537554,0.034160137,0.41321692],"study_design_scores_gemma":[0.00012235304,0.00011906049,0.0004209094,0.0007460936,0.000061659775,0.00028318953,0.0001063903,0.049080994,0.0066191233,0.79242754,0.14997405,0.000038656304],"about_ca_topic_score_codex":0.001237236,"about_ca_topic_score_gemma":0.0012302598,"teacher_disagreement_score":0.01768147,"about_ca_system_score_codex":0.0013839746,"about_ca_system_score_gemma":0.002475365,"threshold_uncertainty_score":0.059150457},"labels":[],"label_agreement":null},{"id":"W2555428809","doi":"10.1007/978-3-319-42911-3_44","title":"On Partial Features in the $$\\mathcal{DLF}$$ Family of Description Logics","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Predicate (mathematical logic); Partial function; Computer science; Function (biology); Order (exchange); Discrete mathematics; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.03425786817573451,"score_gpt":0.25595723607156,"score_spread":0.2216993678958255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555428809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009350483,0.004819151,0.94412017,0.0027254962,0.00027058017,0.00009601663,0.00088478177,0.00086506293,0.03686834],"genre_scores_gemma":[0.2859268,0.0071399887,0.67077994,0.002380727,0.0005533781,0.00045896872,0.0040717963,0.0009997268,0.027688708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718225,0.0010117197,0.0002934878,0.00048305266,0.0007563355,0.00027313005],"domain_scores_gemma":[0.9974203,0.0014164206,0.00014224247,0.0005622092,0.00032892852,0.0001299579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044014566,0.0012109863,0.0015434686,0.0025908095,0.002386065,0.00635154,0.0029147577,0.0019223071,0.0071957256],"category_scores_gemma":[0.006722913,0.0015237704,0.0031724398,0.0043257847,0.0045795147,0.019233,0.0048062024,0.0060893777,0.0018197264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023666722,0.000016697624,0.00008400726,0.00007256292,0.0000151369395,0.00004939069,0.0001453284,0.001722778,0.0001859784,0.9691871,0.002395551,0.026101755],"study_design_scores_gemma":[0.000007364959,0.0000063116527,0.000041392374,0.00004610881,0.000011999649,0.000041850748,0.000030113304,0.0051785344,0.0001981651,0.9850525,0.009374029,0.000011597663],"about_ca_topic_score_codex":0.008984444,"about_ca_topic_score_gemma":0.009232428,"teacher_disagreement_score":0.008984444,"about_ca_system_score_codex":0.005077943,"about_ca_system_score_gemma":0.001736073,"threshold_uncertainty_score":0.03684324},"labels":[],"label_agreement":null},{"id":"W2555545605","doi":"10.1007/978-3-319-48989-6_41","title":"Finite Model Finding Using the Logic of Equality with Uninterpreted Functions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scope (computer science); Decidability; Range (aeronautics); First-order logic; Theoretical computer science; Set (abstract data type); Programming language; Algorithm","score_opus":0.08757135658462582,"score_gpt":0.3201194808364773,"score_spread":0.23254812425185145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555545605","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.005087906,0.00025244243,0.9863744,0.00031319115,0.000078113946,0.0000427286,0.00006224153,0.0005298892,0.0072591878],"genre_scores_gemma":[0.31913805,0.00083130755,0.66874486,0.00040979608,0.00020394618,0.0001937522,0.00053620274,0.00059700425,0.009345088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960252,0.0011373428,0.00036295835,0.0009171141,0.0011883872,0.00036889073],"domain_scores_gemma":[0.9947837,0.0036402715,0.00018717015,0.00096560037,0.00034437733,0.000078893434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034236882,0.0011198112,0.0014487823,0.0017457437,0.0012995785,0.0055072997,0.0045917183,0.0016379482,0.007367186],"category_scores_gemma":[0.011793348,0.0012339079,0.004231055,0.001598521,0.0051713483,0.012867641,0.0050994917,0.005093986,0.0014972612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007237112,0.000044466677,0.0001999708,0.0001871835,0.00004715197,0.00014407052,0.00030263764,0.0136609385,0.002140424,0.9303642,0.0013444631,0.051492173],"study_design_scores_gemma":[0.00001647087,0.00002330898,0.000039253395,0.00006851295,0.00004228862,0.000109381326,0.000050867715,0.06162952,0.0054474096,0.92764455,0.0049036103,0.000024730189],"about_ca_topic_score_codex":0.0014703878,"about_ca_topic_score_gemma":0.0014615101,"teacher_disagreement_score":0.007367186,"about_ca_system_score_codex":0.0023976797,"about_ca_system_score_gemma":0.001973206,"threshold_uncertainty_score":0.024645746},"labels":[],"label_agreement":null},{"id":"W2555689045","doi":"10.1007/978-3-319-49806-5_28","title":"Generic Construction of Certificateless Signcryption Scheme","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Signcryption; Random oracle; Computer science; Digital signature; Public-key cryptography; Encryption; Authentication (law); Scheme (mathematics); Cryptographic primitive; Bilinear interpolation; Cryptography; Confidentiality; Theoretical computer science; Computer security; Signature (topology); Computer network; Cryptographic protocol; Mathematics; Hash function","score_opus":0.022483752173570168,"score_gpt":0.23377559414349774,"score_spread":0.21129184196992756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555689045","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.04939665,0.0007429472,0.9005233,0.00065351365,0.00040143586,0.0005088104,0.00077004306,0.0030181184,0.04398515],"genre_scores_gemma":[0.7039423,0.0009043483,0.25929168,0.00034355285,0.00017660554,0.00039976634,0.00180258,0.00035588827,0.032783218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892634,0.00015261045,0.00007238346,0.00019752423,0.00043730068,0.00021381328],"domain_scores_gemma":[0.99944,0.0000625585,0.000037167334,0.00032876173,0.000079400255,0.000052089246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006113639,0.00062994857,0.0009475423,0.0008817486,0.0010650951,0.001589835,0.001366479,0.0011889872,0.008483646],"category_scores_gemma":[0.0010443626,0.00041484018,0.0010519625,0.001356823,0.001019788,0.0024298145,0.003213208,0.0017889098,0.0024142645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042157806,0.00018623304,0.00081240677,0.00053817773,0.000067350025,0.0005966827,0.00034129003,0.011151307,0.043536115,0.8008135,0.0107205855,0.13081478],"study_design_scores_gemma":[0.0005329313,0.00063323317,0.0017546685,0.00020827896,0.00028515828,0.0043578716,0.00016480825,0.13752936,0.141559,0.5470619,0.16567475,0.00023806946],"about_ca_topic_score_codex":0.0002526187,"about_ca_topic_score_gemma":0.00022865881,"teacher_disagreement_score":0.008483646,"about_ca_system_score_codex":0.0009294722,"about_ca_system_score_gemma":0.001068115,"threshold_uncertainty_score":0.028380632},"labels":[],"label_agreement":null},{"id":"W2556879810","doi":"10.1007/978-3-662-53826-5_7","title":"Compositional Event Semantics in Pregroup Grammars","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Unification; Rule-based machine translation; Natural language processing; Concatenation (mathematics); Artificial intelligence; Event (particle physics); Tree-adjoining grammar; Semantics (computer science); Programming language; Context-free grammar; Mathematics; Arithmetic","score_opus":0.009945073461505556,"score_gpt":0.2559054803308392,"score_spread":0.24596040686933365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556879810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023919612,0.0004461425,0.943647,0.0006331814,0.00022487325,0.00011841832,0.00017266344,0.0011934201,0.029644625],"genre_scores_gemma":[0.63470584,0.0007414806,0.3422791,0.0005209888,0.00032844834,0.000254671,0.0006113774,0.000871185,0.019686904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988066,0.0004759355,0.00008891942,0.00018679745,0.0003477656,0.000093900606],"domain_scores_gemma":[0.99925715,0.0003067683,0.00004311581,0.00017238152,0.00017631114,0.00004425355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015502978,0.00061334966,0.00055924646,0.0009955586,0.0009854011,0.0025235119,0.0011726399,0.0010083277,0.0043474645],"category_scores_gemma":[0.0017750849,0.0004557814,0.0014631504,0.00075291184,0.0031434514,0.004168799,0.002641071,0.0020094956,0.0010875516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012079539,0.0000139272715,0.00005182071,0.000029420891,0.00000620523,0.000090560345,0.00031585194,0.002164521,0.0012609463,0.98901725,0.0005567852,0.006480639],"study_design_scores_gemma":[0.000010755108,0.000011928241,0.000041505486,0.00001840929,0.000008533344,0.000054571876,0.00006340629,0.01567698,0.0017653396,0.9694834,0.012855735,0.000009510958],"about_ca_topic_score_codex":0.00091149093,"about_ca_topic_score_gemma":0.00095852325,"teacher_disagreement_score":0.0043474645,"about_ca_system_score_codex":0.0010837023,"about_ca_system_score_gemma":0.0010984187,"threshold_uncertainty_score":0.014543772},"labels":[],"label_agreement":null},{"id":"W25572007","doi":"10.1007/978-3-642-22922-0_3","title":"An Ontology-Based Traffic Accident Risk Mapping Framework","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Ontology; Cluster analysis; Traffic accident; Accident (philosophy); Domain (mathematical analysis); Data mining; Point (geometry); Information retrieval; Transport engineering; Artificial intelligence","score_opus":0.024106046252622606,"score_gpt":0.2502911648562512,"score_spread":0.22618511860362858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25572007","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.004140833,0.0002936023,0.9821681,0.0003992149,0.000073775605,0.00022772844,0.0018888392,0.0025203023,0.008287722],"genre_scores_gemma":[0.079438634,0.0008962499,0.90784574,0.00021027954,0.00004358999,0.00044845368,0.0058768676,0.00035984558,0.0048803836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987239,0.00021578955,0.00021530545,0.00022952349,0.0005185901,0.00009681689],"domain_scores_gemma":[0.99932563,0.00017818403,0.000071967996,0.00012509235,0.0002270381,0.000072088624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018746163,0.0008747606,0.00087723543,0.003534546,0.0012085612,0.0039439737,0.0022860875,0.0010979595,0.0039767814],"category_scores_gemma":[0.002470327,0.0005692388,0.0025098165,0.0034332257,0.00069015234,0.003919374,0.0028947857,0.0015754296,0.0013406338],"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.00008374704,0.00039341676,0.0023880112,0.0006643336,0.0003415953,0.0008622154,0.0013833065,0.09684814,0.005864711,0.6277159,0.019665439,0.24378917],"study_design_scores_gemma":[0.000035036086,0.000048852875,0.0016273457,0.0003688764,0.00031403286,0.0006198089,0.0007271567,0.36227822,0.0040288926,0.4199847,0.20985529,0.000111716196],"about_ca_topic_score_codex":0.017640743,"about_ca_topic_score_gemma":0.020951321,"teacher_disagreement_score":0.017640743,"about_ca_system_score_codex":0.001491244,"about_ca_system_score_gemma":0.0035129455,"threshold_uncertainty_score":0.03507614},"labels":[],"label_agreement":null},{"id":"W2557475746","doi":"10.1007/978-3-319-46218-9_2","title":"Argumentation Mining in Parliamentary Discourse","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Argumentative; Framing (construction); Argumentation theory; Computer science; Frame (networking); Embedding; Politics; Coding (social sciences); Discourse analysis; Linguistics; Artificial intelligence; Natural language processing; Sociology; Political science; Law; Social science; History","score_opus":0.021645032414913407,"score_gpt":0.2714161143421848,"score_spread":0.2497710819272714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557475746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0825551,0.005801009,0.88497275,0.0030199487,0.0003092333,0.00024384873,0.0015285611,0.0020157055,0.01955381],"genre_scores_gemma":[0.63110036,0.0017120631,0.34735644,0.00018559648,0.00038211982,0.0003043656,0.005939985,0.00049722457,0.012521893],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99458706,0.0033778322,0.00037287458,0.0006590182,0.0007640237,0.00023921416],"domain_scores_gemma":[0.97928953,0.01785138,0.00062435796,0.00097070757,0.000970291,0.00029368023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005108075,0.00080061745,0.0012972499,0.0044499002,0.0019008241,0.0046164338,0.0019592629,0.001768468,0.00567946],"category_scores_gemma":[0.029093964,0.0008465919,0.0018260429,0.0041476144,0.0011088321,0.007060542,0.0028790475,0.0028440752,0.0024240066],"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.0006916465,0.00039481258,0.005976458,0.0012946383,0.0003321835,0.0004177623,0.0036591257,0.03585024,0.0043544183,0.14352351,0.01728153,0.78622365],"study_design_scores_gemma":[0.00004741852,0.0000816734,0.0034048278,0.0004142833,0.0001320207,0.0003093542,0.0015058779,0.58126163,0.0056224363,0.3770195,0.03014038,0.000060607406],"about_ca_topic_score_codex":0.0016811467,"about_ca_topic_score_gemma":0.0023637447,"teacher_disagreement_score":0.00567946,"about_ca_system_score_codex":0.0012612982,"about_ca_system_score_gemma":0.0013099537,"threshold_uncertainty_score":0.027014375},"labels":[],"label_agreement":null},{"id":"W2557915038","doi":"10.1007/978-3-319-50127-7_31","title":"Ontology Based Data Access with Referring Expressions for Logics with the Tree Model Property","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Ontology; Property (philosophy); Theoretical computer science; Object (grammar); Tree (set theory); Knowledge base; Domain (mathematical analysis); Computation; Identity (music); Information retrieval; Base (topology); Artificial intelligence; Algorithm; Mathematics","score_opus":0.09659244244260456,"score_gpt":0.29838707553978916,"score_spread":0.2017946330971846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557915038","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.0051977253,0.0006312876,0.9822066,0.001028916,0.00006924658,0.000102186495,0.00012826866,0.0006751491,0.009960711],"genre_scores_gemma":[0.1489656,0.002085059,0.83553314,0.0010638755,0.00024858842,0.0003159611,0.0007226203,0.00048733698,0.010577843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948886,0.0017474162,0.0005454854,0.0008899371,0.0015773129,0.00035131045],"domain_scores_gemma":[0.9956993,0.0022386687,0.00025891452,0.0013235118,0.0003620033,0.000117635725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004497135,0.0005653239,0.0009777104,0.0016346695,0.0017588774,0.0064509283,0.0022930794,0.0017795576,0.0070539494],"category_scores_gemma":[0.011815286,0.00065456214,0.0034761194,0.0037253615,0.004344929,0.016913295,0.006183421,0.0040574814,0.0015981474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003579301,0.000023824306,0.00015745997,0.00014875318,0.000019093575,0.00015947582,0.0008781432,0.0014141452,0.0021844115,0.9515612,0.0026292705,0.040788405],"study_design_scores_gemma":[0.000022756845,0.00004097232,0.00021092284,0.0001250814,0.000118086115,0.0007730902,0.00044081462,0.04592417,0.007172696,0.8856533,0.05944612,0.000072017785],"about_ca_topic_score_codex":0.002693366,"about_ca_topic_score_gemma":0.0022302298,"teacher_disagreement_score":0.0070539494,"about_ca_system_score_codex":0.002548807,"about_ca_system_score_gemma":0.0016901136,"threshold_uncertainty_score":0.023783445},"labels":[],"label_agreement":null},{"id":"W2558952101","doi":"10.1007/978-3-319-50137-6_3","title":"New Approaches to Constraint Acquisition","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"European Commission","keywords":"Computer science; Constraint (computer-aided design); Generalization; Logarithm; Ask price; Process (computing); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Programming language","score_opus":0.039883254997316944,"score_gpt":0.23152733163903066,"score_spread":0.19164407664171373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558952101","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.0017825154,0.0024153502,0.8894942,0.001745627,0.0003350611,0.000071160735,0.00011156137,0.0004952874,0.10354926],"genre_scores_gemma":[0.08844665,0.006350524,0.8023621,0.0011349418,0.00091313984,0.00038452083,0.0006020556,0.0008537966,0.098952375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981876,0.0004785016,0.00010096494,0.00036493936,0.00077799475,0.00009007738],"domain_scores_gemma":[0.99732286,0.0014196364,0.00009100779,0.0006548532,0.00043136242,0.000080373546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017303878,0.0011528976,0.0009124798,0.001954064,0.001542858,0.0039774273,0.0030883716,0.0012184967,0.03077623],"category_scores_gemma":[0.0059492188,0.0011594242,0.0014502069,0.0031893328,0.0047457605,0.009998932,0.0044050226,0.0055052545,0.00462529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010907827,0.000023352954,0.00004774177,0.00011357462,0.0000124311155,0.000032262316,0.00021316679,0.0018401775,0.0005491437,0.909425,0.0076010735,0.080131136],"study_design_scores_gemma":[0.000010456113,0.000010034318,0.0000705504,0.00007302722,0.000013498917,0.00012373494,0.00009940333,0.023973353,0.0012099156,0.8834139,0.09098467,0.0000174388],"about_ca_topic_score_codex":0.0018742416,"about_ca_topic_score_gemma":0.0031984036,"teacher_disagreement_score":0.03077623,"about_ca_system_score_codex":0.0016635259,"about_ca_system_score_gemma":0.0017254313,"threshold_uncertainty_score":0.10295677},"labels":[],"label_agreement":null},{"id":"W2559929582","doi":"10.1007/978-3-319-50935-8_13","title":"A Reverse Hex Solver","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Computer science; Solver; Joins; Scalability; Pruning; Depth-first search; State space; Algorithm; Parallel computing; State (computer science); Programming language; Search algorithm; Operating system; Mathematics","score_opus":0.028342135846258956,"score_gpt":0.26857964472808193,"score_spread":0.240237508881823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559929582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009557857,0.00043300068,0.7336956,0.001484378,0.0010970605,0.00038487357,0.002453275,0.006336213,0.24455772],"genre_scores_gemma":[0.12494081,0.0005736438,0.73238605,0.0012142673,0.00023379645,0.0004282287,0.006228564,0.003598356,0.13039622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.00014956143,0.000060088823,0.00020198332,0.0002677021,0.00012926056],"domain_scores_gemma":[0.9994294,0.00019906051,0.000025223251,0.0001906334,0.00012180273,0.000033821394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061885547,0.001465048,0.0009993732,0.0008837575,0.0009911285,0.0025534506,0.0020858035,0.0012906631,0.103510864],"category_scores_gemma":[0.0024599724,0.00072171097,0.0016426023,0.001328355,0.0008334705,0.0030132283,0.0036573347,0.0028236036,0.021316096],"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.00033403424,0.0002816935,0.00040661133,0.0007304981,0.00009292806,0.0003126181,0.00020406938,0.023529192,0.004292854,0.45364612,0.1138719,0.4022975],"study_design_scores_gemma":[0.00031284554,0.00008797812,0.00019083309,0.00021950055,0.00010765272,0.00040229433,0.0002375074,0.16466811,0.009608928,0.67251945,0.1516029,0.000042091364],"about_ca_topic_score_codex":0.0011630689,"about_ca_topic_score_gemma":0.0022452958,"teacher_disagreement_score":0.103510864,"about_ca_system_score_codex":0.0006692111,"about_ca_system_score_gemma":0.0015718418,"threshold_uncertainty_score":0.3462783},"labels":[],"label_agreement":null},{"id":"W2559949688","doi":"10.1007/978-3-319-50832-0_40","title":"Performance Evaluation of 3D Keypoints and Descriptors","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.0204344511789278,"score_gpt":0.22187892729719483,"score_spread":0.20144447611826702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559949688","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.6164979,0.020371439,0.3058755,0.00083324447,0.001932398,0.0006238127,0.008195959,0.032169856,0.013499845],"genre_scores_gemma":[0.85467225,0.002926553,0.113563225,0.00015349497,0.00017110902,0.00013635094,0.01665243,0.0007926584,0.010931924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99610776,0.0005093013,0.00028161166,0.0008042655,0.0018431225,0.00045388768],"domain_scores_gemma":[0.9953923,0.0018804038,0.0002758086,0.0007818017,0.0014506929,0.00021902731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024021948,0.0017424893,0.0021344633,0.0025354335,0.0005295587,0.0021853007,0.0020049585,0.0015665874,0.007486255],"category_scores_gemma":[0.009488263,0.0003564347,0.00070543616,0.0028956502,0.00044764578,0.0017834397,0.0017251684,0.0004870844,0.00414361],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008609258,0.00056909956,0.0061095464,0.001004829,0.00044648608,0.00017287249,0.00006708292,0.07985927,0.03695133,0.0012083434,0.01557764,0.84942424],"study_design_scores_gemma":[0.0003977383,0.002681842,0.010589906,0.00006654733,0.00031057798,0.0008078206,0.00024718,0.88225245,0.09361706,0.0012794767,0.0076571954,0.000092182876],"about_ca_topic_score_codex":0.012214345,"about_ca_topic_score_gemma":0.0076301848,"teacher_disagreement_score":0.012214345,"about_ca_system_score_codex":0.0011527373,"about_ca_system_score_gemma":0.0012013059,"threshold_uncertainty_score":0.025044024},"labels":[],"label_agreement":null},{"id":"W2560108548","doi":"10.1007/978-3-319-51237-2_2","title":"Deep Spectral-Based Shape Features for Alzheimer’s Disease Classification","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier Universitaire Sainte-Justine; Polytechnique Montréal","funders":"","keywords":"Softmax function; Computer science; Pattern recognition (psychology); Artificial intelligence; Support vector machine; Perceptron; Population; Autoencoder; Polygon mesh; Deep learning; Artificial neural network; Medicine","score_opus":0.03897658755609949,"score_gpt":0.32393971493339796,"score_spread":0.28496312737729845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560108548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072880946,0.009358452,0.8986942,0.0011344475,0.00055708474,0.00006751067,0.0028095415,0.0038108337,0.010687009],"genre_scores_gemma":[0.5722658,0.0070169647,0.3826531,0.0005700985,0.00045098268,0.0001064104,0.007348955,0.00035662216,0.029231109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998876,0.000013306325,0.0000066338166,0.000024615718,0.00004437384,0.000023477889],"domain_scores_gemma":[0.999838,0.00004349238,0.000015198111,0.000023736728,0.00006533252,0.000014233039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032244265,0.0006775477,0.00051064184,0.0006975357,0.00016204457,0.0005061209,0.00068317674,0.0005116342,0.003754736],"category_scores_gemma":[0.0005601045,0.00021223596,0.0007105986,0.0007968636,0.0001754243,0.00061477453,0.00072379963,0.00084788894,0.002705959],"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.00009163807,0.000065925284,0.0009863754,0.00006601003,0.00003442732,0.000036619327,0.000025890926,0.013735071,0.015671343,0.0019290829,0.011601788,0.95575583],"study_design_scores_gemma":[0.000019012456,0.000151638,0.0064900094,0.00011316392,0.0000864703,0.00045727787,0.000079456535,0.9191744,0.030438066,0.020796044,0.022150662,0.000043706073],"about_ca_topic_score_codex":0.0025112878,"about_ca_topic_score_gemma":0.005312286,"teacher_disagreement_score":0.003754736,"about_ca_system_score_codex":0.00028771246,"about_ca_system_score_gemma":0.00036142964,"threshold_uncertainty_score":0.012560844},"labels":[],"label_agreement":null},{"id":"W2560190413","doi":"10.1007/978-3-319-69453-5","title":"Selected Areas in Cryptography – SAC 2016","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Cryptography; Computer security","score_opus":0.010671932868329733,"score_gpt":0.2361436477429395,"score_spread":0.22547171487460976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560190413","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024311799,0.11570018,0.026785452,0.006827777,0.048505824,0.00033549368,0.0022272666,0.0017080931,0.7954788],"genre_scores_gemma":[0.019537138,0.09870433,0.011501175,0.0011067209,0.039633464,0.00025125488,0.003189205,0.0010111261,0.8250656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984743,0.00021922492,0.00007786305,0.00023038863,0.00087987434,0.000118374344],"domain_scores_gemma":[0.99788386,0.00037535065,0.00015138689,0.00037103784,0.000739197,0.00047906546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013111557,0.0031084483,0.0020424887,0.004522389,0.0015868585,0.004771324,0.001244496,0.0014041448,0.08627817],"category_scores_gemma":[0.0025409395,0.00078618573,0.0010651813,0.006370008,0.0011001927,0.004989442,0.0024518473,0.004228085,0.09468836],"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.000063284606,0.00007246605,0.0001772981,0.00071002246,0.000025952784,0.000036668574,0.000032474753,0.0018922488,0.00075452117,0.04199645,0.67048734,0.28375128],"study_design_scores_gemma":[0.0000147188,0.000058995927,0.0006439391,0.00039969443,0.000020304757,0.00019372323,0.000021977428,0.002044431,0.00081974943,0.025997872,0.96976566,0.000018957331],"about_ca_topic_score_codex":0.0011286045,"about_ca_topic_score_gemma":0.0020979603,"teacher_disagreement_score":0.08627817,"about_ca_system_score_codex":0.0034861036,"about_ca_system_score_gemma":0.004354817,"threshold_uncertainty_score":0.28862923},"labels":[],"label_agreement":null},{"id":"W2560274612","doi":"10.1007/978-3-319-50835-1_74","title":"Improving Visual Feature Representations by Biasing Restricted Boltzmann Machines with Gaussian Filters","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"MNIST database; Computer science; Restricted Boltzmann machine; Artificial intelligence; Pattern recognition (psychology); Gaussian; Feature (linguistics); Boltzmann machine; Unsupervised learning; Layer (electronics); Computer vision; Machine learning; Artificial neural network; Physics","score_opus":0.009871789417977214,"score_gpt":0.24117806811079312,"score_spread":0.2313062786928159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560274612","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.0099396715,0.00037114025,0.9875065,0.00015101318,0.000064418775,0.000016448677,0.0000490609,0.00094520656,0.0009564506],"genre_scores_gemma":[0.5855087,0.0007649887,0.40278232,0.0006316465,0.00020764892,0.00014795909,0.0004863515,0.00068313885,0.008787326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999532,0.000104340645,0.000020687516,0.00014788895,0.0001240852,0.000070984155],"domain_scores_gemma":[0.9991423,0.00043729634,0.00007391252,0.00019466576,0.00011017534,0.00004155157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082186935,0.0011034728,0.001403989,0.00050660764,0.00025144915,0.0010726025,0.0021279592,0.001650949,0.0029861787],"category_scores_gemma":[0.0036025094,0.00077508035,0.0011468978,0.0007554996,0.0008951315,0.002188742,0.0022625076,0.002658283,0.0013192086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019560683,0.00009566586,0.00039731772,0.00012449213,0.00012964579,0.00005195903,0.00005950245,0.6308023,0.01930134,0.024274638,0.004031032,0.32053655],"study_design_scores_gemma":[0.0000056875856,0.000016368822,0.000043935277,0.0000043566706,0.00000901345,0.000015327994,0.0000026413607,0.9861805,0.0018887185,0.011548478,0.0002798085,0.000005122844],"about_ca_topic_score_codex":0.0028889244,"about_ca_topic_score_gemma":0.0032410335,"teacher_disagreement_score":0.0029861787,"about_ca_system_score_codex":0.00072120636,"about_ca_system_score_gemma":0.00049283466,"threshold_uncertainty_score":0.009989798},"labels":[],"label_agreement":null},{"id":"W2560311620","doi":"10.1007/978-3-319-50835-1_22","title":"Optimizing Intersection-Over-Union in Deep Neural Networks for Image Segmentation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":903,"is_retracted":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":"Softmax function; Artificial intelligence; Computer science; Segmentation; Intersection (aeronautics); Pattern recognition (psychology); Object (grammar); Image segmentation; Artificial neural network; Deep learning; Object detection; Deep neural networks; Pixel; Computer vision; Cartography","score_opus":0.013842821977057669,"score_gpt":0.2666441925100097,"score_spread":0.25280137053295204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560311620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028593656,0.0013885157,0.9622418,0.00052725285,0.00012582856,0.00008603026,0.00025274392,0.0039321566,0.002852027],"genre_scores_gemma":[0.34364343,0.000710809,0.63962936,0.0005914337,0.00027227635,0.00030784178,0.00206968,0.0025077832,0.010267433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979552,0.0004593595,0.00014979579,0.0006708223,0.00042475038,0.0003401349],"domain_scores_gemma":[0.9958494,0.002658432,0.0002712428,0.00041855464,0.00055623945,0.00024612035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036364947,0.002572824,0.00554741,0.0021037252,0.0013524198,0.003967183,0.005821585,0.005882898,0.009774853],"category_scores_gemma":[0.009873355,0.002768974,0.0025868486,0.00298978,0.002731928,0.0055063516,0.0057675755,0.0051505896,0.0022993882],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008549137,0.00029341763,0.001061033,0.00029770847,0.00018664336,0.000104250765,0.00023527647,0.62178844,0.004671418,0.02297044,0.009231383,0.33830518],"study_design_scores_gemma":[0.000012220758,0.00003054128,0.00004889697,0.000015205137,0.000012116616,0.000014204802,0.0000151232825,0.99135876,0.0011203222,0.0070053306,0.00036031648,0.000006973479],"about_ca_topic_score_codex":0.015220335,"about_ca_topic_score_gemma":0.020129677,"teacher_disagreement_score":0.015220335,"about_ca_system_score_codex":0.00413044,"about_ca_system_score_gemma":0.003998208,"threshold_uncertainty_score":0.03270018},"labels":[],"label_agreement":null},{"id":"W2560585195","doi":"10.1007/978-3-319-51237-2_7","title":"Longitudinal Scoliotic Trunk Analysis via Spectral Representation and Statistical Analysis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scoliosis diagnosis and treatment","field":"Medicine","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":"Université de Montréal; Polytechnique Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"","keywords":"Scoliosis; Trunk; Computer science; Curvature; Representation (politics); Artificial intelligence; Point (geometry); Kinematics; Pattern recognition (psychology); Mathematics; Medicine; Geometry; Physics","score_opus":0.026137835808318508,"score_gpt":0.3129500090871212,"score_spread":0.28681217327880265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560585195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004475948,0.00034568761,0.99399614,0.00007885128,0.00002598816,0.000011080469,0.00012295393,0.00043142415,0.0005119013],"genre_scores_gemma":[0.14017269,0.0017006419,0.8490821,0.00010020663,0.00022096132,0.00012176813,0.0012264133,0.0004793092,0.0068959277],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995982,0.00011449556,0.00002828928,0.00010346446,0.000121177196,0.000034473604],"domain_scores_gemma":[0.999054,0.00047633293,0.000084565385,0.00012365455,0.00023024819,0.00003124566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010224929,0.00065683277,0.00055765203,0.0013237238,0.0002772041,0.0010768366,0.00067341514,0.00044103846,0.0036317413],"category_scores_gemma":[0.0026651288,0.00039185962,0.0010396077,0.0012960827,0.00038328904,0.0011966982,0.00087906286,0.0010058144,0.0022763188],"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.00013711173,0.00010915323,0.0026832146,0.00015047695,0.00013964904,0.00011078567,0.00012675599,0.051978916,0.039196413,0.025610082,0.0072989524,0.87245846],"study_design_scores_gemma":[0.0000065114664,0.00008996615,0.005992278,0.0000419647,0.000064538945,0.0003802037,0.00007978666,0.94135135,0.008815125,0.036091834,0.007034142,0.000052248382],"about_ca_topic_score_codex":0.0012482515,"about_ca_topic_score_gemma":0.0020957272,"teacher_disagreement_score":0.0036317413,"about_ca_system_score_codex":0.0002418359,"about_ca_system_score_gemma":0.0005689738,"threshold_uncertainty_score":0.012149394},"labels":[],"label_agreement":null},{"id":"W2560740612","doi":"10.1007/978-3-319-62127-2_26","title":"Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Tree (set theory); Intersection (aeronautics); Point (geometry); Line (geometry); Line segment; Plane (geometry); Euclidean distance; Euclidean geometry; Segment tree; Geometry; Tree structure; Interval tree; Binary tree","score_opus":0.017658719862367632,"score_gpt":0.252401500185542,"score_spread":0.2347427803231744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560740612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11336874,0.0004567517,0.87883633,0.00027066443,0.00016103403,0.00008660085,0.00018475077,0.0005304672,0.006104694],"genre_scores_gemma":[0.3494814,0.00041690347,0.6411833,0.00010043934,0.00010611262,0.00018443663,0.00030872642,0.0006971673,0.007521498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956554,0.00008321311,0.00002454446,0.00010954829,0.00014193119,0.000075165386],"domain_scores_gemma":[0.9985066,0.0008100032,0.00012430715,0.00020745864,0.00014808227,0.00020357333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008013551,0.0010202883,0.001377139,0.0007436526,0.0005340353,0.0010427817,0.001678356,0.0017172913,0.005309694],"category_scores_gemma":[0.0045091636,0.0006776006,0.00065804773,0.00066228455,0.00068814494,0.0020971608,0.0019173175,0.0015516314,0.0008094284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007985879,0.00029216887,0.0018919663,0.0007391245,0.000097811404,0.0005206926,0.0003587698,0.6067368,0.061873004,0.07172878,0.011220017,0.24374235],"study_design_scores_gemma":[0.000039236456,0.00037709103,0.0005001513,0.00006612151,0.00004590353,0.00035604305,0.00012424533,0.9395667,0.006308264,0.046611793,0.0059855054,0.000018958643],"about_ca_topic_score_codex":0.0006638599,"about_ca_topic_score_gemma":0.0012593187,"teacher_disagreement_score":0.005309694,"about_ca_system_score_codex":0.000512326,"about_ca_system_score_gemma":0.0005459426,"threshold_uncertainty_score":0.01776272},"labels":[],"label_agreement":null},{"id":"W2560846039","doi":"10.1007/978-3-031-53368-6","title":"Selected Areas in Cryptography – SAC 2023","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Indian Statistical Institute; Syddansk Universitet; Universitetet i Bergen; University of Waterloo; Università degli Studi di Salerno; Waseda University; KU Leuven; Aarhus Universitet; University of South Florida; Academia Sinica; Institut Polytechnique de Paris; University of Washington; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Royal Holloway, University of London; Radboud Universiteit","keywords":"Computer science; Cryptography; Computer security","score_opus":0.01247479556962246,"score_gpt":0.2659052419868197,"score_spread":0.25343044641719725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560846039","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009216076,0.04317004,0.008906991,0.0020278145,0.015788922,0.0001389127,0.0010129088,0.0008415319,0.92719126],"genre_scores_gemma":[0.006961785,0.030830752,0.004746871,0.00051537773,0.008990981,0.00010352606,0.0012628123,0.00048145076,0.94610643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991685,0.00010892847,0.000035349836,0.00011891642,0.0004968047,0.000071531256],"domain_scores_gemma":[0.99895775,0.00018142721,0.00006591344,0.00015389218,0.0004245693,0.00021650389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008671168,0.0026653607,0.0014750081,0.0033889958,0.0013381393,0.0038537194,0.0009790708,0.0014480988,0.134081],"category_scores_gemma":[0.0012998321,0.000618712,0.00085638644,0.004930844,0.00073079683,0.003592732,0.0016591864,0.0032084663,0.14512645],"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.00005278965,0.000059583133,0.00009803187,0.00037626328,0.000015152697,0.00003307407,0.000022235521,0.0012140357,0.00081573916,0.035479136,0.739616,0.22221798],"study_design_scores_gemma":[0.000006274021,0.000037082747,0.00032244806,0.00015838495,0.0000071889144,0.00009415822,0.0000098577775,0.0008134226,0.00046328135,0.008861277,0.98921865,0.000007977234],"about_ca_topic_score_codex":0.0013778816,"about_ca_topic_score_gemma":0.002767913,"teacher_disagreement_score":0.134081,"about_ca_system_score_codex":0.0021044912,"about_ca_system_score_gemma":0.0021239896,"threshold_uncertainty_score":0.44854563},"labels":[],"label_agreement":null},{"id":"W256194962","doi":"10.1007/978-3-319-11116-2_56","title":"Efficient Frequent Itemset Mining from Dense Data Streams","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Defense Acquisition Program Administration; Natural Sciences and Engineering Research Council of Canada","keywords":"Data stream mining; Computer science; Data mining; Data stream; STREAMS; Streaming data; Data structure","score_opus":0.031520479952004035,"score_gpt":0.2647085281967489,"score_spread":0.23318804824474487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256194962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044042118,0.0015110448,0.9498915,0.00024849834,0.00013384377,0.00020354817,0.0014345661,0.0017532974,0.0007815594],"genre_scores_gemma":[0.23006022,0.0013342053,0.757331,0.00010328618,0.00022958832,0.00028443098,0.008269508,0.0001484709,0.0022392636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985434,0.00021767797,0.00020564414,0.00025603155,0.0006657497,0.000111410205],"domain_scores_gemma":[0.9954336,0.0028315522,0.00024965932,0.0005985205,0.00076961826,0.00011690902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012087196,0.0009653985,0.002003915,0.0028932584,0.0006523877,0.0018310831,0.0020097347,0.0009627192,0.0012860763],"category_scores_gemma":[0.007876573,0.0008406066,0.0014136496,0.004585657,0.00030866277,0.0025610123,0.0014327816,0.0013301071,0.0012141817],"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.0007155513,0.00031750917,0.007894637,0.0006516598,0.00033519662,0.0008341655,0.00022490905,0.065256506,0.014308763,0.0055525526,0.009679428,0.8942291],"study_design_scores_gemma":[0.000051124556,0.00012226353,0.0016303018,0.00004596274,0.00008137109,0.00082066207,0.00013503636,0.96992034,0.006424144,0.017611526,0.0031348846,0.000022341119],"about_ca_topic_score_codex":0.0011337516,"about_ca_topic_score_gemma":0.0015471786,"teacher_disagreement_score":0.0028932584,"about_ca_system_score_codex":0.0003197994,"about_ca_system_score_gemma":0.0008210314,"threshold_uncertainty_score":0.0063924193},"labels":[],"label_agreement":null},{"id":"W2563226131","doi":"10.1007/978-3-642-40104-6","title":"Algorithms and Data Structures","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Western University; Carleton University","funders":"","keywords":"Computer science","score_opus":0.027527702090889446,"score_gpt":0.28041354703068283,"score_spread":0.2528858449397934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563226131","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015975998,0.011950937,0.9150719,0.0016931307,0.0011275272,0.00012454057,0.0012368299,0.003541403,0.06365607],"genre_scores_gemma":[0.036411688,0.016421797,0.80832106,0.0012599344,0.0019084007,0.0006922417,0.0067511466,0.0026677607,0.12556607],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849856,0.00023853092,0.00014420575,0.00038360586,0.00066895096,0.00006607543],"domain_scores_gemma":[0.99828774,0.00057305786,0.00005078469,0.0008116551,0.00023665109,0.000040024395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010587197,0.0014661652,0.001665859,0.0020490296,0.00092580944,0.0046095327,0.0020625049,0.0013461449,0.035101894],"category_scores_gemma":[0.0047855144,0.00096684083,0.0012295352,0.004966723,0.0015615722,0.005589191,0.002578313,0.0032375015,0.033371985],"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.000039670067,0.00004613479,0.0001688798,0.00046979243,0.000044134784,0.000039864317,0.000095648225,0.004674176,0.0014259383,0.28696612,0.083461866,0.6225678],"study_design_scores_gemma":[0.000020296318,0.00002975038,0.00019621661,0.00015790119,0.000029687915,0.00024516694,0.00003949292,0.024025276,0.0025836872,0.6963982,0.2762526,0.000021833284],"about_ca_topic_score_codex":0.0005564351,"about_ca_topic_score_gemma":0.0005251855,"teacher_disagreement_score":0.035101894,"about_ca_system_score_codex":0.0009278131,"about_ca_system_score_gemma":0.0012668896,"threshold_uncertainty_score":0.11742753},"labels":[],"label_agreement":null},{"id":"W2564066722","doi":"10.1007/978-3-319-51966-1_18","title":"Semantically Non-preserving Transformations for Antivirus Evaluation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Malware; Computer science; Obfuscation; Transformation (genetics); Focus (optics); Theoretical computer science; Syntax; Programming language; Simple (philosophy); Code (set theory); Artificial intelligence; Computer security; Set (abstract data type)","score_opus":0.02384543768760042,"score_gpt":0.2983377669198249,"score_spread":0.27449232923222444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564066722","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.018183596,0.00066925684,0.96403563,0.00041619551,0.0001545722,0.00014553682,0.0002434101,0.0063298703,0.009821928],"genre_scores_gemma":[0.5982468,0.0006174346,0.38671136,0.0003688344,0.00019184467,0.0002002226,0.0011241152,0.0028718675,0.009667505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99384356,0.0017756493,0.0004787902,0.0006614003,0.002751142,0.00048952707],"domain_scores_gemma":[0.9933304,0.0029869745,0.00024626037,0.0024488904,0.00087957527,0.00010787167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028061434,0.0010341558,0.0007311211,0.0010979923,0.0008327267,0.0025629678,0.0015744751,0.0011791711,0.004653365],"category_scores_gemma":[0.00848286,0.0006973047,0.0016235134,0.001143869,0.0025777502,0.0057664244,0.0030805904,0.003345604,0.0015580411],"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.00058958755,0.00022089227,0.0010470137,0.00059410353,0.000089678084,0.00034123246,0.00043911726,0.030163083,0.02985462,0.56524867,0.011356859,0.3600552],"study_design_scores_gemma":[0.000050497292,0.00015119996,0.00030524304,0.000086868415,0.000085750886,0.00037611692,0.00010106767,0.15300533,0.057540134,0.7664285,0.021823004,0.00004629029],"about_ca_topic_score_codex":0.0009330084,"about_ca_topic_score_gemma":0.0014705985,"teacher_disagreement_score":0.004653365,"about_ca_system_score_codex":0.001348989,"about_ca_system_score_gemma":0.0015216004,"threshold_uncertainty_score":0.015567064},"labels":[],"label_agreement":null},{"id":"W2564822508","doi":"10.1007/978-3-319-51966-1_17","title":"On the Feasibility of Malware Authorship Attribution","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Concordia University","funders":"","keywords":"Malware; Computer science; Authorship attribution; Process (computing); Code (set theory); Attribution; Cryptovirology; Malware analysis; Domain (mathematical analysis); Software; Source code; Data science; Artificial intelligence; Computer security; Programming language; Set (abstract data type)","score_opus":0.04601763185672615,"score_gpt":0.2955895492792332,"score_spread":0.24957191742250706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564822508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11995101,0.0034486046,0.78251463,0.0074437265,0.0017288715,0.00025560264,0.0009613979,0.0010437144,0.08265243],"genre_scores_gemma":[0.83191186,0.0024128715,0.14723751,0.000427881,0.0026943595,0.00018248838,0.00091612246,0.00036360396,0.01385326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901636,0.003914811,0.0006035867,0.0021124494,0.0025564136,0.0006489961],"domain_scores_gemma":[0.79641837,0.16562535,0.005806501,0.021680845,0.008469093,0.0019999081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009067827,0.0011793087,0.0019803443,0.0043553608,0.00341536,0.0060528037,0.0030285232,0.0036700338,0.011180419],"category_scores_gemma":[0.13862114,0.0010469566,0.001376355,0.0045741443,0.00528596,0.016223932,0.0062207296,0.004370095,0.0023468193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086757273,0.00022565693,0.010002401,0.00060498505,0.00010205268,0.0006126923,0.0008433571,0.034525644,0.005386658,0.63209283,0.015294792,0.2994413],"study_design_scores_gemma":[0.000035445762,0.00007502223,0.0012890655,0.00014945443,0.000043691776,0.0006494051,0.00018371589,0.16771644,0.0035990535,0.82183146,0.0043754783,0.000051744384],"about_ca_topic_score_codex":0.00063018274,"about_ca_topic_score_gemma":0.00039005798,"teacher_disagreement_score":0.011180419,"about_ca_system_score_codex":0.0012261671,"about_ca_system_score_gemma":0.0014817105,"threshold_uncertainty_score":0.04795587},"labels":[],"label_agreement":null},{"id":"W2564857307","doi":"10.1007/978-3-319-62127-2_14","title":"Splitting $$B_2$$-VPG Graphs into Outer-String and Co-Comparability Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Split graph; Clique; Block graph; String (physics); Mathematics; Chordal graph; Clique problem; Discrete mathematics; Graph; Computer science; 1-planar graph","score_opus":0.0228393778805869,"score_gpt":0.2803910063874737,"score_spread":0.25755162850688684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564857307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10784612,0.0003716693,0.6850074,0.0012358131,0.00045987172,0.0003458196,0.0017736012,0.0026569266,0.20030273],"genre_scores_gemma":[0.51252353,0.0007051743,0.40155333,0.00092860585,0.00019113795,0.000344164,0.0054578236,0.0032197998,0.07507642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995555,0.00008148172,0.000017808596,0.0001542203,0.00010949068,0.000081550286],"domain_scores_gemma":[0.9990766,0.00025242197,0.00006241195,0.00030202803,0.00020343543,0.00010311582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656212,0.00072023727,0.000546435,0.0011737966,0.0012714706,0.0017592267,0.0014680444,0.0009929821,0.021304626],"category_scores_gemma":[0.0017795415,0.00050452707,0.0008204342,0.0018509219,0.0010791549,0.0034041393,0.0016839884,0.0023477762,0.0047581545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019002796,0.0001542914,0.00069645164,0.00031425024,0.00003713323,0.00042453996,0.00056191155,0.012094058,0.017307715,0.7932848,0.021552501,0.15338236],"study_design_scores_gemma":[0.00002429514,0.00004575401,0.000685321,0.000104582665,0.000042525102,0.00031738594,0.00030428558,0.029187094,0.009632466,0.89309573,0.06653849,0.000022073833],"about_ca_topic_score_codex":0.0018416914,"about_ca_topic_score_gemma":0.0020120016,"teacher_disagreement_score":0.021304626,"about_ca_system_score_codex":0.00087051955,"about_ca_system_score_gemma":0.00053573994,"threshold_uncertainty_score":0.07127112},"labels":[],"label_agreement":null},{"id":"W2565352292","doi":"10.1007/978-3-319-44543-4_27","title":"Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Lethbridge","funders":"","keywords":"Cactus; Vertex (graph theory); Combinatorics; Generalization; Binary tree; Binary number; Tree (set theory); Mathematics; Computer science; Time complexity; Algorithm; Class (philosophy); Discrete mathematics; Graph; Artificial intelligence; Arithmetic","score_opus":0.027257716468281526,"score_gpt":0.2906350169032979,"score_spread":0.2633773004350164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565352292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15462236,0.0025825237,0.7817252,0.0016698022,0.00050791836,0.00030038945,0.0013748892,0.002950156,0.05426672],"genre_scores_gemma":[0.41203836,0.0018702457,0.5535218,0.0004975212,0.0005169521,0.00037704463,0.0036006053,0.0012475856,0.026329782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00022562139,0.000064703534,0.00040733124,0.0002883747,0.0002653753],"domain_scores_gemma":[0.9959843,0.0023032697,0.00023974266,0.0009070688,0.00030175323,0.00026397005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010568292,0.0014273076,0.0015719113,0.0016963806,0.0015801348,0.0035645564,0.004678624,0.0018328488,0.015329642],"category_scores_gemma":[0.007221097,0.0013262964,0.001704781,0.0033610081,0.001461574,0.007531332,0.002555426,0.0036160152,0.0019696523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006167151,0.00048645106,0.0020581163,0.0010150705,0.000183275,0.00015782178,0.0007329822,0.08495093,0.0054836506,0.49815375,0.042999625,0.36316162],"study_design_scores_gemma":[0.00009582153,0.000037528403,0.00042737293,0.00005449774,0.00006346258,0.00013440115,0.00013264065,0.23114596,0.0014944505,0.7583695,0.0080219405,0.000022417611],"about_ca_topic_score_codex":0.0040084748,"about_ca_topic_score_gemma":0.0077137114,"teacher_disagreement_score":0.015329642,"about_ca_system_score_codex":0.003284536,"about_ca_system_score_gemma":0.0017246724,"threshold_uncertainty_score":0.051282704},"labels":[],"label_agreement":null},{"id":"W25655544","doi":"10.1007/3-540-45675-9_5","title":"Discovering Temporal Rules from Temporally Ordered Data","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Preprocessor; Domain (mathematical analysis); Data mining; Artificial intelligence; Data pre-processing; Theoretical computer science; Machine learning; Mathematics","score_opus":0.05502788398303271,"score_gpt":0.2654332541563966,"score_spread":0.21040537017336391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25655544","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.046317827,0.0012806281,0.94666064,0.0006278952,0.00006603161,0.00016752767,0.002231238,0.0012186462,0.001429549],"genre_scores_gemma":[0.26711634,0.002143731,0.7205592,0.00020055864,0.00017621832,0.00026602056,0.0077507338,0.00019861036,0.0015885244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777275,0.0005504522,0.00030669378,0.0005960447,0.0006607291,0.00011338551],"domain_scores_gemma":[0.9720191,0.024084272,0.0013404416,0.0015472594,0.0007354308,0.00027355168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003355958,0.0009285061,0.0013374494,0.0041642943,0.000887153,0.0027200475,0.0021169148,0.0013067325,0.002145649],"category_scores_gemma":[0.026647689,0.0013285904,0.0022841555,0.0036672002,0.0016068056,0.006138211,0.001451988,0.002354413,0.0007054933],"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.00094795314,0.00058114016,0.027505705,0.0014692693,0.0006360513,0.0021530536,0.0015185175,0.16405164,0.010764231,0.12213281,0.010057039,0.6581826],"study_design_scores_gemma":[0.00009059998,0.00007699562,0.0028975091,0.0001996587,0.00024092809,0.00073717174,0.00031752576,0.61054474,0.0058563533,0.37160188,0.0073592807,0.00007739817],"about_ca_topic_score_codex":0.00701226,"about_ca_topic_score_gemma":0.01266319,"teacher_disagreement_score":0.00701226,"about_ca_system_score_codex":0.0007391671,"about_ca_system_score_gemma":0.0018951993,"threshold_uncertainty_score":0.017748237},"labels":[],"label_agreement":null},{"id":"W2566934801","doi":"10.1007/978-3-319-51966-1_21","title":"Strategies for Incorporating Delegation into Attribute-Based Access Control (ABAC)","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"","keywords":"Delegation; Computer science; Access control; Work (physics); Control (management); Computer security; Operations research; Process management; Business; Artificial intelligence; Political science; Engineering; Law","score_opus":0.030192997591855803,"score_gpt":0.3141106917189366,"score_spread":0.2839176941270808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566934801","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.0047918744,0.00028745612,0.9858462,0.0005066511,0.000099892146,0.00016319244,0.000046032736,0.000856357,0.007402277],"genre_scores_gemma":[0.30886883,0.0004128548,0.6803958,0.00032774624,0.00014744332,0.00044766505,0.00014764821,0.00030759384,0.008944537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991321,0.0036624032,0.00076672446,0.0012124084,0.0021677655,0.0008696623],"domain_scores_gemma":[0.98043376,0.0072986,0.00069349556,0.008457039,0.002444388,0.00067273446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011606881,0.0009821099,0.0011781881,0.0015227448,0.0022638545,0.006268619,0.003935723,0.0022301609,0.0078025586],"category_scores_gemma":[0.02350067,0.0009720344,0.0017040533,0.001859832,0.004622764,0.009015409,0.006760674,0.0045442153,0.0020647831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014324341,0.00021368825,0.0006240531,0.00019388818,0.000054760538,0.00008079387,0.0007953373,0.01507331,0.004131948,0.81944126,0.0053028534,0.15394488],"study_design_scores_gemma":[0.00005284743,0.000085446474,0.00017900865,0.00007805846,0.00008377645,0.00024116357,0.00022872268,0.2145304,0.009849825,0.7490377,0.025553023,0.00008000214],"about_ca_topic_score_codex":0.0026512835,"about_ca_topic_score_gemma":0.00205101,"teacher_disagreement_score":0.011606881,"about_ca_system_score_codex":0.0020969533,"about_ca_system_score_gemma":0.003097078,"threshold_uncertainty_score":0.061383843},"labels":[],"label_agreement":null},{"id":"W2567810766","doi":"10.1007/978-3-662-46018-4_5","title":"Fast Rendezvous with Advice","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Advice (programming); Oracle; Node (physics); Set (abstract data type); Upper and lower bounds; Integer (computer science); Algorithm; Theoretical computer science; Mathematics","score_opus":0.025126376839355112,"score_gpt":0.25765961762593964,"score_spread":0.23253324078658452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567810766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015817314,0.0010800674,0.7602939,0.0006075993,0.00083868694,0.00015995526,0.0013965244,0.07162512,0.14818083],"genre_scores_gemma":[0.23309037,0.0011475958,0.5193824,0.00038737583,0.0002717372,0.00023114555,0.002761169,0.012539432,0.23018879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994698,0.000051652798,0.000020108644,0.000097605436,0.0002576291,0.00010322243],"domain_scores_gemma":[0.99906033,0.00031523212,0.000024745576,0.00037986555,0.00017799067,0.000041878222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047659,0.0012897331,0.00087882247,0.0007784442,0.0008155206,0.0010724657,0.0015772472,0.0009918427,0.06522306],"category_scores_gemma":[0.0033033234,0.0005762247,0.00056911807,0.0007433397,0.00072114414,0.0021236695,0.0021067194,0.0015401037,0.026513955],"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.000719308,0.000054766155,0.00054478244,0.0004915857,0.00005181043,0.00034522815,0.00047348515,0.013378158,0.020880472,0.102013275,0.13673006,0.7243171],"study_design_scores_gemma":[0.00026791455,0.00012404303,0.0006974351,0.00029097023,0.000103630075,0.0008218986,0.00027425517,0.1760274,0.05528029,0.2632069,0.50278974,0.00011551117],"about_ca_topic_score_codex":0.003367342,"about_ca_topic_score_gemma":0.004597116,"teacher_disagreement_score":0.06522306,"about_ca_system_score_codex":0.00047773382,"about_ca_system_score_gemma":0.0005895565,"threshold_uncertainty_score":0.21819288},"labels":[],"label_agreement":null},{"id":"W2567974663","doi":"10.1007/978-3-642-19222-7_32","title":"Chains-into-Bins Processes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Bin; Chain (unit); Ball (mathematics); Set (abstract data type); Object (grammar); Process (computing)","score_opus":0.01687628384205723,"score_gpt":0.21315763434362395,"score_spread":0.19628135050156673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567974663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026018957,0.0018315479,0.8728542,0.00095893384,0.0005341909,0.00019782982,0.00046057868,0.00043686552,0.096706934],"genre_scores_gemma":[0.49671963,0.006456111,0.2504048,0.00071131496,0.0006228468,0.0005518848,0.0014887665,0.00062255166,0.24242201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990908,0.00020730364,0.00006150255,0.00022756714,0.0002476256,0.00016523132],"domain_scores_gemma":[0.9985794,0.00065058743,0.00009477775,0.00026873077,0.00025513937,0.0001514739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010354532,0.0011798127,0.0014435971,0.00092592376,0.0014182039,0.0032107686,0.0026051407,0.002222713,0.023290887],"category_scores_gemma":[0.004444787,0.0009927673,0.0016106962,0.0030518132,0.002012448,0.0047027846,0.0022917076,0.0040431106,0.0041812654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008382747,0.00005387456,0.00011865766,0.00009229917,0.000014244209,0.00007347203,0.00009539322,0.041821398,0.00086089666,0.9320781,0.0035953661,0.021112477],"study_design_scores_gemma":[0.000024953208,0.000020165351,0.00005642578,0.000021888152,0.000010652257,0.000041936673,0.00003217697,0.097448245,0.0008175002,0.8952304,0.006284074,0.00001158909],"about_ca_topic_score_codex":0.002142358,"about_ca_topic_score_gemma":0.0019252948,"teacher_disagreement_score":0.023290887,"about_ca_system_score_codex":0.0015092554,"about_ca_system_score_gemma":0.0010793185,"threshold_uncertainty_score":0.07791585},"labels":[],"label_agreement":null},{"id":"W2568347355","doi":"10.1007/978-3-319-07890-8_29","title":"Lemmings Is PSPACE-Complete","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Carleton University","funders":"","keywords":"Creatures; Computer science; Operations research; Mathematical economics; Artificial intelligence; Mathematics; Biology","score_opus":0.034058821263938006,"score_gpt":0.26978956811702565,"score_spread":0.23573074685308765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568347355","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.08321086,0.00241644,0.20047875,0.0063032606,0.0005788521,0.0003043538,0.0040502152,0.0032896788,0.6993676],"genre_scores_gemma":[0.6734664,0.0024230154,0.089081764,0.0023201238,0.0005389364,0.0004459526,0.007841722,0.0011537906,0.22272827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948895,0.00008943497,0.00002942875,0.00011085786,0.00018292472,0.000098432254],"domain_scores_gemma":[0.999084,0.0005417813,0.00005978999,0.00010344576,0.00014609103,0.00006482662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004584582,0.0011809152,0.00101626,0.0008299047,0.001326242,0.0023135869,0.0012063059,0.001094116,0.02885432],"category_scores_gemma":[0.002489584,0.00048878527,0.0011683844,0.0013423586,0.0011682882,0.0036111872,0.0017862796,0.0034286182,0.0059650172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003805406,0.0001884019,0.0003815657,0.0014008074,0.000092844,0.0003356991,0.00040430858,0.026222061,0.0051402776,0.69732064,0.09211314,0.1760198],"study_design_scores_gemma":[0.000068671965,0.000033226344,0.00021632727,0.00007520119,0.000025917108,0.00018721369,0.00007444247,0.014698769,0.0025378105,0.9476778,0.034386795,0.000017790786],"about_ca_topic_score_codex":0.0013558517,"about_ca_topic_score_gemma":0.0020660264,"teacher_disagreement_score":0.02885432,"about_ca_system_score_codex":0.0013975286,"about_ca_system_score_gemma":0.0009999675,"threshold_uncertainty_score":0.09652728},"labels":[],"label_agreement":null},{"id":"W2569737058","doi":"10.1007/978-3-642-15675-5_10","title":"Extensional Higher-Order Logic Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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","funders":"","keywords":"Extensional definition; Computer science; Logic programming; Semantics (computer science); Programming language; Well-founded semantics; Stable model semantics; Operator (biology); Horn clause; Algorithm; Theoretical computer science; Operational semantics; Denotational semantics","score_opus":0.025296654762897927,"score_gpt":0.2549022560791887,"score_spread":0.22960560131629076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569737058","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.010657356,0.0056380476,0.6691965,0.0025910963,0.0008060207,0.000054621287,0.0003600657,0.00084657903,0.3098497],"genre_scores_gemma":[0.4582636,0.009084125,0.34884372,0.0015380633,0.001682478,0.00016104484,0.0010267074,0.00067767175,0.17872256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939275,0.00015049273,0.000048869726,0.0001013724,0.00024899052,0.000057536658],"domain_scores_gemma":[0.99933666,0.00035168897,0.000029537483,0.00013889835,0.0001012137,0.000041907588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010673928,0.0006663602,0.00064219383,0.00071464817,0.0007815362,0.0032102908,0.0011547793,0.00062258675,0.012133674],"category_scores_gemma":[0.0014093784,0.00045199302,0.00093139097,0.0012527794,0.002376625,0.0061813938,0.0014994957,0.0036723483,0.0024093473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008788397,0.000010328022,0.000046935253,0.000054500186,0.0000052146897,0.000030263478,0.00011055824,0.00047837791,0.00027108364,0.97570306,0.0032647827,0.020016138],"study_design_scores_gemma":[0.0000065541176,0.0000047298213,0.00005242692,0.000024306235,0.0000049650275,0.00010071225,0.000019937119,0.0016498729,0.0002962707,0.95924336,0.038591817,0.0000050880412],"about_ca_topic_score_codex":0.00040910972,"about_ca_topic_score_gemma":0.00067660917,"teacher_disagreement_score":0.012133674,"about_ca_system_score_codex":0.0012687837,"about_ca_system_score_gemma":0.00059791864,"threshold_uncertainty_score":0.04059124},"labels":[],"label_agreement":null},{"id":"W2570416447","doi":"10.1007/978-3-642-33093-3_30","title":"Multi-timescale Nexting in a Reinforcement Learning Robot","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Reinforcement learning; Robot; Artificial intelligence; Human–computer interaction","score_opus":0.02659981860661804,"score_gpt":0.2579270346567551,"score_spread":0.23132721605013706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570416447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1303961,0.00050590024,0.8500818,0.00066810177,0.0002906252,0.000087885535,0.000051229315,0.0016465022,0.01627183],"genre_scores_gemma":[0.8836704,0.00014612645,0.10618704,0.00009702831,0.0000325916,0.00006122394,0.00002947131,0.00006744545,0.009708718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998673,0.00002379708,0.000007498102,0.00004705486,0.00003105708,0.000023221979],"domain_scores_gemma":[0.9997255,0.00011093931,0.000025650179,0.00003677507,0.000038491085,0.00006266558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037951677,0.00033495395,0.0005418068,0.00018429382,0.00066654856,0.00045374635,0.0011220168,0.00097426056,0.003905439],"category_scores_gemma":[0.00068538456,0.00030242855,0.0003398766,0.00017212458,0.0005819236,0.00081665406,0.001054805,0.0009557451,0.00042490524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005910799,0.00030492558,0.0013864537,0.000151222,0.000054947486,0.0006740193,0.0002099686,0.76565325,0.05705065,0.034015,0.002190212,0.13771825],"study_design_scores_gemma":[0.000018611541,0.00010604461,0.00019656985,0.00000604558,0.0000092846685,0.000050988354,0.0000118860125,0.9906227,0.0024114626,0.00557065,0.0009841064,0.000011721149],"about_ca_topic_score_codex":0.0024359955,"about_ca_topic_score_gemma":0.0024531481,"teacher_disagreement_score":0.003905439,"about_ca_system_score_codex":0.00042143546,"about_ca_system_score_gemma":0.0005112343,"threshold_uncertainty_score":0.01306504},"labels":[],"label_agreement":null},{"id":"W2570642804","doi":"10.1007/978-3-540-74208-1_12","title":"Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Combinatorics; Type (biology); Discrete mathematics; Engineering; Geology; Time complexity; Graph","score_opus":0.03931546203792397,"score_gpt":0.29705768397094146,"score_spread":0.2577422219330175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570642804","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.46322247,0.0023268028,0.36357385,0.004116576,0.00031334095,0.00008549411,0.00049909885,0.00044938968,0.16541292],"genre_scores_gemma":[0.94454414,0.0010699411,0.030944513,0.00036473092,0.00039002052,0.00018246766,0.0004343661,0.00037489846,0.021694744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.0003097536,0.000049128437,0.00022336197,0.00036138104,0.00019291161],"domain_scores_gemma":[0.99251294,0.0052232137,0.00055988773,0.0003958301,0.00050829514,0.0007998482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026038354,0.0011765267,0.0016946879,0.0023719468,0.0016501029,0.0039718207,0.0021681716,0.0019474577,0.008348081],"category_scores_gemma":[0.011716635,0.00096877635,0.0011397196,0.0018156015,0.004447657,0.009365304,0.0028376442,0.0061730715,0.0004912466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029282633,0.00002352356,0.00011525996,0.00003445954,0.000004528565,0.000026223463,0.00013331808,0.0030012438,0.00032136295,0.99300635,0.00085157005,0.0024528191],"study_design_scores_gemma":[0.0000093775025,0.000010508114,0.00010812906,0.000016162438,0.000005075237,0.00003760306,0.000045309487,0.022488195,0.00020249582,0.97643924,0.0006304388,0.0000074960726],"about_ca_topic_score_codex":0.0011471197,"about_ca_topic_score_gemma":0.0011159829,"teacher_disagreement_score":0.008348081,"about_ca_system_score_codex":0.0028527796,"about_ca_system_score_gemma":0.00090999925,"threshold_uncertainty_score":0.0279271},"labels":[],"label_agreement":null},{"id":"W2571163292","doi":"10.1007/978-3-642-13731-0_19","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Clique graph; Adjacency matrix; Graph; Mathematics; Unit disk graph; Graph partition; Discrete mathematics; Clique; Computer science; Line graph; Graph power","score_opus":0.03375501707243674,"score_gpt":0.26118555109189284,"score_spread":0.2274305340194561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571163292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03813272,0.00040055462,0.9478562,0.00082379085,0.00018709453,0.00035464438,0.0007126668,0.0013405868,0.010191652],"genre_scores_gemma":[0.5295502,0.00063964294,0.45150822,0.000564872,0.0003831606,0.0010212408,0.0016945321,0.0008397122,0.013798406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746096,0.0006578484,0.00013140617,0.00080944947,0.00064937805,0.00029094264],"domain_scores_gemma":[0.99553114,0.0020138605,0.00039578287,0.0010623909,0.00055954495,0.00043725624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020862413,0.0021575657,0.0039637513,0.0011946555,0.001702208,0.003995463,0.0054814527,0.0031212128,0.008127584],"category_scores_gemma":[0.0103517985,0.0010731483,0.002647325,0.0023844775,0.0020712672,0.0053942217,0.0063641737,0.0047674514,0.0017524901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017168248,0.00043205533,0.0009648501,0.0010244015,0.00027491566,0.0002751032,0.00056692056,0.45451835,0.022802195,0.32703307,0.02627649,0.16411483],"study_design_scores_gemma":[0.00007549589,0.00019816014,0.00019673302,0.000039279643,0.000056314606,0.000101611164,0.00008568178,0.8187019,0.002185414,0.17587386,0.0024525945,0.00003296589],"about_ca_topic_score_codex":0.0022649416,"about_ca_topic_score_gemma":0.0018955113,"teacher_disagreement_score":0.008127584,"about_ca_system_score_codex":0.0026527694,"about_ca_system_score_gemma":0.002868447,"threshold_uncertainty_score":0.027189434},"labels":[],"label_agreement":null},{"id":"W2572058873","doi":"10.1007/978-3-642-21043-3","title":"Advances in Artificial Intelligence","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Internet of Things and AI","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":"Saint Mary's University; University of Regina","funders":"","keywords":"Computer science; Artificial intelligence; Applications of artificial intelligence; Operations research; Engineering","score_opus":0.02098089928896642,"score_gpt":0.2631336486461543,"score_spread":0.24215274935718786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572058873","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013786093,0.31074533,0.032757737,0.0086233625,0.00969621,0.00007096016,0.00031060804,0.00060119183,0.63581604],"genre_scores_gemma":[0.03609595,0.26523557,0.03803594,0.0047582164,0.006403732,0.00018046836,0.0010466968,0.0004263442,0.6478171],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992974,0.0001127589,0.000033447533,0.00009521257,0.0004129398,0.00004820884],"domain_scores_gemma":[0.9991491,0.000376871,0.000041783365,0.00016885814,0.00017948818,0.000083917366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083979074,0.001084559,0.0012553894,0.0015081944,0.00052038505,0.003698424,0.0011383112,0.001121872,0.034778114],"category_scores_gemma":[0.0018093677,0.0004711634,0.00045046431,0.0021848413,0.001447741,0.003759955,0.0017381071,0.0027758412,0.021312308],"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.000029604029,0.00007070775,0.00023571338,0.0007465125,0.000045101813,0.00006917303,0.00027237588,0.0008136332,0.0007709336,0.18617563,0.32473052,0.48604006],"study_design_scores_gemma":[0.000008237993,0.00002085227,0.00032281678,0.00040533085,0.000012471592,0.00013128636,0.00007407373,0.00067986327,0.00019740716,0.089784764,0.90835506,0.000007934157],"about_ca_topic_score_codex":0.000719784,"about_ca_topic_score_gemma":0.0013476452,"teacher_disagreement_score":0.034778114,"about_ca_system_score_codex":0.0008739471,"about_ca_system_score_gemma":0.0011051855,"threshold_uncertainty_score":0.11634439},"labels":[],"label_agreement":null},{"id":"W257370745","doi":"10.1007/978-3-642-38457-8_4","title":"Move Pruning and Duplicate Detection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Pruning; Computer science; Heuristic; Conjunction (astronomy); Simple (philosophy); State (computer science); Artificial intelligence; Machine learning; Data mining; Algorithm","score_opus":0.07483745370710014,"score_gpt":0.329650977274377,"score_spread":0.2548135235672768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W257370745","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.009270249,0.004514855,0.968439,0.0007664855,0.00070608483,0.00016834312,0.000591164,0.002332845,0.013210978],"genre_scores_gemma":[0.08992303,0.002641454,0.8635881,0.00039502754,0.00057690445,0.00022252575,0.002216967,0.0009142678,0.03952175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963547,0.00060762546,0.00022173964,0.0008984679,0.0016383107,0.00027921848],"domain_scores_gemma":[0.9932199,0.002702725,0.00039794235,0.0024156312,0.0010881079,0.00017573695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002842665,0.0014793602,0.0023786058,0.004204633,0.0023234854,0.0033957958,0.0052478523,0.0022809925,0.009605746],"category_scores_gemma":[0.012351925,0.0012295663,0.0018414512,0.005784029,0.0015947409,0.004454804,0.004023493,0.0023325467,0.005141791],"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.00022241108,0.000119823286,0.0011873706,0.0005433543,0.00019169779,0.00035484447,0.00029067328,0.023213105,0.0067020576,0.08700554,0.04858938,0.8315796],"study_design_scores_gemma":[0.000062013045,0.00019554076,0.0018266346,0.00027753806,0.00034721385,0.0025454215,0.00031516736,0.39782622,0.035053045,0.4332042,0.12821196,0.0001349882],"about_ca_topic_score_codex":0.0027671931,"about_ca_topic_score_gemma":0.004318518,"teacher_disagreement_score":0.009605746,"about_ca_system_score_codex":0.0012299353,"about_ca_system_score_gemma":0.0017175644,"threshold_uncertainty_score":0.032134414},"labels":[],"label_agreement":null},{"id":"W2574291663","doi":"10.1007/978-3-319-52234-0_28","title":"IC3 - Flipping the E in ICE","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Invariant (physics); Extension (predicate logic); Key (lock); Model checking; Theoretical computer science; Focus (optics); Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.04088450634873628,"score_gpt":0.3010576536049343,"score_spread":0.260173147256198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574291663","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.039665863,0.0004796753,0.34544063,0.0012866046,0.004396108,0.0003083598,0.0016185509,0.0044586007,0.6023456],"genre_scores_gemma":[0.53489834,0.0007868875,0.14943916,0.0018973586,0.00035027016,0.00033765237,0.0027746821,0.0045452276,0.3049704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.000035907997,0.000020576577,0.00011695977,0.00015717823,0.00015185717],"domain_scores_gemma":[0.99948704,0.000065987304,0.000023467433,0.00022241363,0.00014673512,0.000054220072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004803645,0.0008807854,0.00059973134,0.0008351496,0.0015330752,0.0017095975,0.0010846355,0.0014692296,0.06577965],"category_scores_gemma":[0.0014107535,0.00039552525,0.0010758368,0.0006867998,0.001726741,0.0021359355,0.0029738983,0.001963607,0.018264141],"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.00044547758,0.00007790947,0.0006308378,0.00039416965,0.000028749195,0.0006766795,0.0003305683,0.010326448,0.02818241,0.6649281,0.07978363,0.21419504],"study_design_scores_gemma":[0.000073831216,0.00018437275,0.0005442974,0.00025799184,0.000060262388,0.0011865611,0.00045866394,0.032815583,0.08379835,0.44720477,0.43331513,0.00010022992],"about_ca_topic_score_codex":0.0015439346,"about_ca_topic_score_gemma":0.0016666775,"teacher_disagreement_score":0.06577965,"about_ca_system_score_codex":0.0006602382,"about_ca_system_score_gemma":0.001207065,"threshold_uncertainty_score":0.22005486},"labels":[],"label_agreement":null},{"id":"W257616344","doi":"10.1007/978-3-642-33509-9_63","title":"A Novel Stabilization Scheme for Asymmetric Bilateral Teleoperation Systems with Time Varying Delays","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Teleoperation; Computer science; Stability (learning theory); Control (management); Artificial intelligence","score_opus":0.01722256337649903,"score_gpt":0.21301970887508742,"score_spread":0.1957971454985884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W257616344","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.027066546,0.00032401705,0.9669854,0.000092250135,0.00021263928,0.000048946975,0.000024873534,0.00021307816,0.005032205],"genre_scores_gemma":[0.85269517,0.00032890422,0.13769619,0.000086548636,0.00013763264,0.00012146338,0.00005661796,0.000033166332,0.008844245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988866,0.000015591488,0.000008200026,0.000024060937,0.000049953414,0.000013492303],"domain_scores_gemma":[0.99992275,0.000014097262,0.000014555247,0.000011873507,0.000029601097,0.0000071585073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001668396,0.00046997718,0.00048651476,0.00021643507,0.0004180436,0.00035071565,0.0007689247,0.0006370398,0.0028718384],"category_scores_gemma":[0.00021417529,0.00014135486,0.00028828497,0.0002210032,0.00025192453,0.0004510655,0.0007211572,0.00046005583,0.00036875202],"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.00061399216,0.00012212468,0.00028579577,0.0005108216,0.00007154495,0.00028607488,0.00025875217,0.19796912,0.3574127,0.048523847,0.00343392,0.39051124],"study_design_scores_gemma":[0.000051284762,0.00022973586,0.0001834243,0.000014018842,0.000020946944,0.00012593277,0.00001333549,0.9816752,0.011064798,0.0029303266,0.003673736,0.000017367762],"about_ca_topic_score_codex":0.00062458636,"about_ca_topic_score_gemma":0.001023665,"teacher_disagreement_score":0.0028718384,"about_ca_system_score_codex":0.00022334288,"about_ca_system_score_gemma":0.00023662669,"threshold_uncertainty_score":0.009607255},"labels":[],"label_agreement":null},{"id":"W2578101323","doi":"10.1007/978-3-319-62127-2_10","title":"Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; STRIPS; Surface (topology); Grid; Stack (abstract data type); Hinge; Unit cube; Computer science; Folding (DSP implementation); Square (algebra); Point (geometry); Grid pattern; Cube (algebra); Geometry; Surface of revolution; Combinatorics; Topology (electrical circuits); Algorithm; Mathematics; Physics; Structural engineering; Classical mechanics","score_opus":0.01765721832434062,"score_gpt":0.23883757065636094,"score_spread":0.22118035233202032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578101323","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.060100004,0.00022894391,0.9069856,0.0000874328,0.00013463487,0.00007294869,0.00023486764,0.0021499528,0.030005759],"genre_scores_gemma":[0.50959325,0.0004513796,0.47041532,0.000105188425,0.000030166548,0.00020466745,0.000695652,0.001054813,0.017449468],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982435,0.00001752397,0.000014818179,0.000041352316,0.000066335204,0.00003559364],"domain_scores_gemma":[0.9998173,0.000035714846,0.00001902515,0.00008654181,0.00002345178,0.000017861503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014107734,0.00064425054,0.0004959634,0.00039785905,0.00031774014,0.0005742933,0.00089359336,0.00032527794,0.00824556],"category_scores_gemma":[0.0005302795,0.00038136626,0.00041533637,0.0006174236,0.0005738865,0.0009963494,0.0015493355,0.001166243,0.0019544694],"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.00027287324,0.0001450036,0.00069075165,0.00050361635,0.000033393062,0.00030897692,0.00034937804,0.07957048,0.06964844,0.28053507,0.014090918,0.55385107],"study_design_scores_gemma":[0.00012411883,0.00051856664,0.0009324853,0.0001639533,0.000046917175,0.00081788574,0.00036599732,0.4127699,0.06193396,0.46349716,0.05876193,0.00006706227],"about_ca_topic_score_codex":0.00021494571,"about_ca_topic_score_gemma":0.00046848253,"teacher_disagreement_score":0.00824556,"about_ca_system_score_codex":0.00019870207,"about_ca_system_score_gemma":0.00020358143,"threshold_uncertainty_score":0.027584136},"labels":[],"label_agreement":null},{"id":"W2581002507","doi":"10.1007/978-3-319-52240-1_10","title":"Internet Voting in Sub-national Elections: Policy Learning in Canada and Australia","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social 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":true,"ca_institutions":"Global Affairs Canada; University of Toronto","funders":"","keywords":"Computer science; Voting; The Internet; World Wide Web; Political science; Law","score_opus":0.045566775586347155,"score_gpt":0.32631592296849676,"score_spread":0.2807491473821496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581002507","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.9154297,0.0010555723,0.0006887501,0.012316167,0.000104219514,0.000062252795,0.00024140679,0.00003308978,0.07006878],"genre_scores_gemma":[0.96848214,0.00048415276,0.00028783563,0.0002905766,0.000022124575,0.000014649303,0.00015028006,0.00001365417,0.030254504],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9975222,0.00068868214,0.000049783357,0.00018403208,0.00051260646,0.0010425923],"domain_scores_gemma":[0.9907065,0.0037084196,0.0005006441,0.0002555205,0.0024416295,0.0023872787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045416965,0.00014681969,0.00054516696,0.00082463614,0.007017635,0.004881946,0.001584913,0.0012158296,0.008372211],"category_scores_gemma":[0.01673647,0.00021462585,0.00031704418,0.002451269,0.0028279005,0.0024619482,0.0018473645,0.0026276445,0.0006983165],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008880857,0.0018358433,0.3504168,0.0002484259,0.000119826575,0.00046450555,0.1074001,0.01204512,0.00045234888,0.1344772,0.087289125,0.30436262],"study_design_scores_gemma":[0.0001012369,0.00026129282,0.6228146,0.00027726046,0.000092286056,0.00007053497,0.16873749,0.01972605,0.00089910644,0.032025397,0.15488973,0.00010503096],"about_ca_topic_score_codex":0.9634008,"about_ca_topic_score_gemma":0.98095554,"teacher_disagreement_score":0.03802717,"about_ca_system_score_codex":0.03802717,"about_ca_system_score_gemma":0.05733383,"threshold_uncertainty_score":0.2759077},"labels":[],"label_agreement":null},{"id":"W2581995084","doi":"10.1007/978-3-319-29516-9","title":"Combinatorial Algorithms","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"McMaster University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.008256833814438739,"score_gpt":0.2373441480858435,"score_spread":0.22908731427140477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581995084","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029466064,0.019180533,0.29115227,0.0030657805,0.0024944262,0.0001308118,0.0012959017,0.0017086166,0.678025],"genre_scores_gemma":[0.106285855,0.031575076,0.29978874,0.002914087,0.0045278645,0.00075524376,0.0058157896,0.0030494693,0.54528785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.0001891457,0.000036026282,0.00019392074,0.00042299106,0.00006122307],"domain_scores_gemma":[0.99934465,0.0002721022,0.000025382395,0.0001951668,0.00011442973,0.00004819581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068984454,0.0017658276,0.0014980756,0.0017851526,0.0009374021,0.0038551202,0.0018609378,0.0011703868,0.055283777],"category_scores_gemma":[0.0025105462,0.00068644417,0.0011895978,0.0030943467,0.0012426891,0.0024127674,0.0017485954,0.003949224,0.023775324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037940525,0.00009326245,0.00015738708,0.00037261072,0.000056026653,0.000054167587,0.00005712814,0.010890554,0.0007049148,0.47154036,0.19307613,0.32295948],"study_design_scores_gemma":[0.00002893919,0.000023137047,0.00021822241,0.00013271678,0.000025294876,0.00016973507,0.000028350105,0.018994,0.0005701226,0.6988205,0.28097206,0.000016958451],"about_ca_topic_score_codex":0.00084063184,"about_ca_topic_score_gemma":0.0011948848,"teacher_disagreement_score":0.055283777,"about_ca_system_score_codex":0.0019275161,"about_ca_system_score_gemma":0.0011540239,"threshold_uncertainty_score":0.18494266},"labels":[],"label_agreement":null},{"id":"W2582353049","doi":"10.1007/978-3-319-52718-5_22","title":"Left Atrial Wall Segmentation Using Clinically Correlated Metrics","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Atrial Fibrillation Management and Outcomes","field":"Medicine","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":"Left atrium; Segmentation; Atrial fibrillation; Computer science; Repeatability; Catheter ablation; Artificial intelligence; Ablation; Medicine; Cardiology; Mathematics; Statistics","score_opus":0.09676365203872517,"score_gpt":0.3728023351020983,"score_spread":0.27603868306337315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582353049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054318637,0.0032149076,0.93065494,0.0004948653,0.00031117382,0.00013457215,0.00079338724,0.0021049485,0.007972658],"genre_scores_gemma":[0.32827094,0.0029900072,0.6555194,0.00023401921,0.0005002979,0.00013510806,0.0019186243,0.0013386584,0.009092925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994448,0.00012369336,0.000053512333,0.00015268645,0.00018749203,0.000037745325],"domain_scores_gemma":[0.998831,0.000547817,0.00014153826,0.00011796971,0.00029789194,0.00006373724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014063517,0.0010535471,0.0007337466,0.002404327,0.00025026427,0.0026801736,0.0007309557,0.0009127781,0.0030443755],"category_scores_gemma":[0.0035182908,0.00048180379,0.00069837575,0.0014537728,0.0004231314,0.0010953074,0.0009773886,0.00070555316,0.002121289],"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.00028759017,0.00007146297,0.009025514,0.00028414262,0.00014839621,0.00029917053,0.00017309164,0.025056435,0.048381757,0.0048017367,0.010600884,0.9008699],"study_design_scores_gemma":[0.0000375381,0.00028499897,0.020088205,0.0003175524,0.00020257212,0.0023900957,0.00021037545,0.88152707,0.05686573,0.021077018,0.016879844,0.00011900448],"about_ca_topic_score_codex":0.0007685979,"about_ca_topic_score_gemma":0.0017113513,"teacher_disagreement_score":0.0030443755,"about_ca_system_score_codex":0.00032448163,"about_ca_system_score_gemma":0.0004170535,"threshold_uncertainty_score":0.010184407},"labels":[],"label_agreement":null},{"id":"W2582616273","doi":"10.1007/978-3-319-53058-1_7","title":"A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Lethbridge","funders":"","keywords":"Generalization; Computer science; Line (geometry); Algorithm; Approximation algorithm; Simple (philosophy); Perimeter; Line segment; Mathematics; Artificial intelligence","score_opus":0.011857092243947475,"score_gpt":0.23927697378420013,"score_spread":0.22741988154025264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582616273","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.017671898,0.00035270103,0.976151,0.00028903616,0.00010387306,0.00014759763,0.00019315237,0.0012356217,0.0038550834],"genre_scores_gemma":[0.21205005,0.00025933573,0.7781699,0.00019844633,0.0000860948,0.00052997784,0.0007186246,0.00038766774,0.007599971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989214,0.0002555902,0.000058084246,0.00023228404,0.00031970537,0.00021287306],"domain_scores_gemma":[0.99791247,0.0012772363,0.000118234544,0.00029741626,0.00024487576,0.00014980753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351336,0.001930328,0.0024087767,0.0010365829,0.0007134162,0.0015216989,0.0037256305,0.0020358698,0.008325899],"category_scores_gemma":[0.0045649456,0.00082138233,0.0012189994,0.0017086593,0.00075880456,0.0025322433,0.003154111,0.0024127054,0.0016839982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093361834,0.00028926673,0.0007268337,0.00036363318,0.00011445244,0.00013500037,0.00023854597,0.74667084,0.0060770744,0.03040578,0.012945854,0.20109902],"study_design_scores_gemma":[0.000050068375,0.00004905101,0.00005276793,0.000008609414,0.000009901609,0.000033953802,0.000019473202,0.9916831,0.0005951065,0.0066507086,0.00084075116,0.00000648173],"about_ca_topic_score_codex":0.0042434703,"about_ca_topic_score_gemma":0.0038601956,"teacher_disagreement_score":0.008325899,"about_ca_system_score_codex":0.0015876951,"about_ca_system_score_gemma":0.001626306,"threshold_uncertainty_score":0.027852952},"labels":[],"label_agreement":null},{"id":"W2582871424","doi":"10.1007/978-3-319-21840-3_33","title":"The Complexity of Dominating Set Reconfiguration","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Computer science; Set (abstract data type); Programming language; Embedded system","score_opus":0.08715331853177619,"score_gpt":0.3293101202288042,"score_spread":0.242156801697028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582871424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2745447,0.014616873,0.39737463,0.017855357,0.0016050049,0.00042330366,0.003732031,0.0013085346,0.2885396],"genre_scores_gemma":[0.90759546,0.006891211,0.0536277,0.00078954984,0.0014684785,0.00037268884,0.0018025733,0.00052062725,0.026931737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696976,0.00078871334,0.00015571085,0.00054448657,0.0010932066,0.00044816185],"domain_scores_gemma":[0.9862292,0.0102237305,0.00071837154,0.0017063838,0.0005640319,0.0005583338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017042324,0.0009837595,0.0017497746,0.0012756567,0.0015280945,0.00656513,0.00274172,0.0018104798,0.010936549],"category_scores_gemma":[0.013872654,0.001175701,0.0018222627,0.003258481,0.0027365347,0.009495418,0.0030927954,0.0044231694,0.0011938796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038567872,0.000106288615,0.00090861856,0.0006590143,0.00010292803,0.00018700636,0.00035211135,0.11462926,0.003155621,0.78743327,0.02006119,0.07201904],"study_design_scores_gemma":[0.0000514548,0.000033448476,0.00041783633,0.000051027597,0.000045216442,0.00022333152,0.000089946196,0.08497327,0.0008992827,0.9053072,0.007884385,0.000023645753],"about_ca_topic_score_codex":0.0014964375,"about_ca_topic_score_gemma":0.0013735319,"teacher_disagreement_score":0.010936549,"about_ca_system_score_codex":0.005036082,"about_ca_system_score_gemma":0.0019000247,"threshold_uncertainty_score":0.036586404},"labels":[],"label_agreement":null},{"id":"W2583189786","doi":"10.1007/b100989","title":"Algorithmic Learning Theory","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Cognitive science; Psychology","score_opus":0.009120299820187654,"score_gpt":0.23121412187479512,"score_spread":0.22209382205460745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583189786","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.0031552296,0.053347435,0.43182474,0.011920108,0.0019911667,0.000095585936,0.00080295274,0.0011462707,0.49571657],"genre_scores_gemma":[0.23817676,0.056662243,0.25647408,0.005932282,0.0065653985,0.0006139847,0.004306675,0.0012271284,0.43004146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.00019742135,0.000032521675,0.00015039621,0.00026186448,0.000043089112],"domain_scores_gemma":[0.99927086,0.00035178923,0.00002947788,0.0001810797,0.00012552635,0.00004135016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088805833,0.0009823106,0.0011172817,0.001133265,0.0009003729,0.00344321,0.0014531486,0.0012202081,0.020068737],"category_scores_gemma":[0.002294317,0.0005171125,0.0007623426,0.0015739504,0.0023518126,0.003578248,0.0013908248,0.0040720575,0.008492776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010835261,0.00002743671,0.00016202743,0.00016291044,0.000031161937,0.000029173434,0.00009440049,0.00209239,0.00016454335,0.8360487,0.068480946,0.0926954],"study_design_scores_gemma":[0.000006178655,0.0000056194503,0.00012289219,0.000049451428,0.0000082050765,0.000052299154,0.000017334301,0.002512872,0.000103531296,0.9092927,0.08782365,0.000005227205],"about_ca_topic_score_codex":0.0009550292,"about_ca_topic_score_gemma":0.0011585073,"teacher_disagreement_score":0.020068737,"about_ca_system_score_codex":0.0014128475,"about_ca_system_score_gemma":0.0010936346,"threshold_uncertainty_score":0.067136586},"labels":[],"label_agreement":null},{"id":"W2583491955","doi":"10.1007/978-3-319-46454-1","title":"Computer Vision – ECCV 2016","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":232,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Irvine; University of Illinois at Urbana-Champaign; Rheinische Friedrich-Wilhelms-Universität Bonn; Technische Universität München; University of Crete; Sapienza Università di Roma; Lunds Universitet; Albert-Ludwigs-Universität Freiburg; Carnegie Mellon University; Università Degli Studi di Modena e Reggio Emila; Institute of Science and Technology Austria; Université de Sherbrooke; University College London; Imperial College London; Yale University; Eberhard Karls Universität Tübingen; University of North Carolina at Chapel Hill; Seoul National University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Oxford","keywords":"Computer science; Computer graphics (images); Volume (thermodynamics); Computer vision; Set (abstract data type); Artificial intelligence; Programming language","score_opus":0.010947100727419844,"score_gpt":0.23206690241408442,"score_spread":0.2211198016866646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583491955","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00539277,0.07663837,0.5800698,0.004909415,0.02787653,0.0003433777,0.0055539543,0.024169704,0.2750461],"genre_scores_gemma":[0.03332016,0.046573173,0.14442216,0.0009385112,0.003983928,0.0003960152,0.01564728,0.0052316682,0.74948704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892336,0.000092782524,0.000058242837,0.00024520402,0.00060011004,0.00008024231],"domain_scores_gemma":[0.99885345,0.00013098012,0.000039363196,0.00046694852,0.00041469716,0.000094512536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013008527,0.0027968306,0.0027163532,0.0027221476,0.0005320888,0.0034611546,0.0031529749,0.0022738457,0.091091596],"category_scores_gemma":[0.0025852802,0.0010904004,0.0011219832,0.0029179535,0.00074595364,0.0033716979,0.002315223,0.0027426798,0.07886424],"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.000040073544,0.00003478116,0.000070880786,0.0003292745,0.00004165853,0.000036924346,0.000012579589,0.0037823082,0.0020347359,0.007997442,0.33534682,0.65027255],"study_design_scores_gemma":[0.00002674167,0.0000741589,0.0010798277,0.0003893286,0.00005929912,0.0006815638,0.00003241555,0.036316868,0.0060020047,0.053691562,0.90159136,0.000054759414],"about_ca_topic_score_codex":0.0024551128,"about_ca_topic_score_gemma":0.0027489315,"teacher_disagreement_score":0.091091596,"about_ca_system_score_codex":0.0015341969,"about_ca_system_score_gemma":0.0014666846,"threshold_uncertainty_score":0.3047318},"labels":[],"label_agreement":null},{"id":"W2583602942","doi":"10.1007/978-3-319-53007-9_10","title":"Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristic; Misrepresentation; Computer science; Set (abstract data type); Mathematical optimization; Time complexity; Algorithm; Mathematics; Artificial intelligence; Law","score_opus":0.03331328423480352,"score_gpt":0.24465982905647093,"score_spread":0.21134654482166743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583602942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16621047,0.0025776527,0.7905786,0.0021257258,0.00043209153,0.00056551816,0.00048209782,0.00075301237,0.036274876],"genre_scores_gemma":[0.74663913,0.00081264414,0.2360722,0.00073198235,0.00031470024,0.00053702795,0.00063408114,0.00059411186,0.013664064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972867,0.0014142735,0.00008294956,0.00027589794,0.00039497123,0.0005452089],"domain_scores_gemma":[0.9840739,0.013433182,0.00056028843,0.00057797245,0.0008121125,0.00054257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003868461,0.0012460848,0.0028896001,0.0014185809,0.0015461043,0.0031000078,0.003487976,0.0032444596,0.014294203],"category_scores_gemma":[0.0150285605,0.00084960746,0.0013675537,0.0015747884,0.0016448114,0.003430887,0.0018136452,0.002913792,0.0008990909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009980984,0.0004961102,0.0017787657,0.00050577277,0.00015992319,0.00016034575,0.00028304016,0.775474,0.0018536489,0.14437011,0.0139960395,0.059924178],"study_design_scores_gemma":[0.00007063872,0.00009031195,0.0002083453,0.00003251779,0.000029158016,0.000040665425,0.000059988906,0.95695966,0.00022422065,0.041738007,0.00053027266,0.00001621969],"about_ca_topic_score_codex":0.0049864836,"about_ca_topic_score_gemma":0.0057317954,"teacher_disagreement_score":0.014294203,"about_ca_system_score_codex":0.0028301468,"about_ca_system_score_gemma":0.005506581,"threshold_uncertainty_score":0.0478189},"labels":[],"label_agreement":null},{"id":"W2584167071","doi":"10.1007/978-3-319-61188-4_7","title":"Explaining Radiological Emphysema Subtypes with Unsupervised Texture Prototypes: MESA COPD Study","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Lung Cancer Diagnosis and Treatment","field":"Medicine","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":"McGill University Health Centre","funders":"National Center for Research Resources; National Institute of Diabetes and Digestive and Kidney Diseases; National Heart, Lung, and Blood Institute","keywords":"COPD; Pulmonary disease; Subtyping; Radiological weapon; Mesa; Computer science; Artificial intelligence; Texture (cosmology); Homogeneous; Radiology; Pulmonary emphysema; Lung disease; Medicine; Lung; Image (mathematics); Internal medicine; Mathematics","score_opus":0.023835394323053705,"score_gpt":0.3108089474089106,"score_spread":0.28697355308585687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584167071","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.97336924,0.0017705215,0.020731984,0.00022602669,0.000064951266,0.00013178527,0.002013997,0.00064791087,0.0010435961],"genre_scores_gemma":[0.97693527,0.00036780784,0.017333789,0.00006227462,0.00005923083,0.000037705675,0.0038868245,0.00010202129,0.0012150805],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99953437,0.00014375869,0.00003121037,0.00016578875,0.00007195394,0.000052916035],"domain_scores_gemma":[0.99824405,0.0010010481,0.00008917795,0.000324897,0.00020761583,0.0001331866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014863535,0.00092959794,0.00081581366,0.0015827835,0.00036416837,0.0010399118,0.0008081579,0.0012764283,0.0013310468],"category_scores_gemma":[0.0032188743,0.00033926006,0.0015171531,0.0005678161,0.00037074144,0.0006607075,0.00071466254,0.00079852564,0.00069246744],"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.010324924,0.003865615,0.20839435,0.0014297247,0.002776844,0.0025803475,0.001092617,0.07226925,0.0692348,0.0013455237,0.018601932,0.6080841],"study_design_scores_gemma":[0.00063308014,0.0022956813,0.18197097,0.00017197718,0.0014276372,0.004393441,0.001471464,0.769962,0.027909832,0.0026757745,0.0069476194,0.00014055484],"about_ca_topic_score_codex":0.0037182411,"about_ca_topic_score_gemma":0.004828443,"teacher_disagreement_score":0.0037182411,"about_ca_system_score_codex":0.00028938398,"about_ca_system_score_gemma":0.00042773865,"threshold_uncertainty_score":0.007860661},"labels":[],"label_agreement":null},{"id":"W2584401907","doi":"10.1007/978-3-642-24477-3_1","title":"On the Expressive Power of Deep Architectures","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":200,"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":"Computer science; Deep learning; Artificial intelligence; Expressive power; Deep neural networks; Electronic circuit; Computer architecture; Theoretical computer science; Electrical engineering","score_opus":0.01627985766662682,"score_gpt":0.23056476091546363,"score_spread":0.2142849032488368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584401907","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.025547707,0.0139071,0.8664644,0.0066764774,0.0004931057,0.000031577893,0.000543342,0.0011475737,0.08518885],"genre_scores_gemma":[0.69629526,0.01591841,0.24403363,0.0028146768,0.0017097248,0.00020434456,0.0009205232,0.0009658996,0.037137512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00027678814,0.0000782376,0.00013369217,0.00034467576,0.000098054385],"domain_scores_gemma":[0.9947305,0.004116452,0.00013401115,0.00072776614,0.00020749938,0.00008374967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016792679,0.0009705936,0.0008543021,0.000728168,0.0006431527,0.0031249926,0.0016244728,0.0012808479,0.0069908476],"category_scores_gemma":[0.008553319,0.0010025067,0.00077167625,0.0010929169,0.0036721113,0.010052786,0.003223866,0.0058284136,0.0012282904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009626856,0.000021538348,0.00020902169,0.0001852308,0.00003551324,0.00008050707,0.00013213744,0.026407162,0.0027526289,0.8872958,0.004804249,0.07797991],"study_design_scores_gemma":[0.000006866838,0.000008121997,0.0000502156,0.000035314988,0.00000810639,0.000029964696,0.0000114197255,0.045369104,0.00067571644,0.9500756,0.0037229662,0.000006564235],"about_ca_topic_score_codex":0.0013924814,"about_ca_topic_score_gemma":0.0021348777,"teacher_disagreement_score":0.0069908476,"about_ca_system_score_codex":0.0009688215,"about_ca_system_score_gemma":0.00043742094,"threshold_uncertainty_score":0.023386717},"labels":[],"label_agreement":null},{"id":"W2584421997","doi":"10.1007/978-3-319-53375-9_6","title":"An Online Data Validation Algorithm for Electronic Nose","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Chemical Sensor Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Electronic nose; Computer science; Identifiability; Noise (video); Pattern recognition (psychology); Algorithm; Artificial intelligence; Sampling (signal processing); Data mining; Sensor array; Machine learning; Computer vision","score_opus":0.03567027329821168,"score_gpt":0.29004854655071255,"score_spread":0.25437827325250084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584421997","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.003445179,0.00028687913,0.99294287,0.000052723924,0.000080237136,0.000055180633,0.000056262103,0.0025376943,0.0005430062],"genre_scores_gemma":[0.09450208,0.0002490591,0.8965899,0.0002807986,0.00006309542,0.00024324186,0.0005610314,0.00036319988,0.007147674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999057,0.0001597574,0.00006463592,0.00020074045,0.00045934264,0.000058542395],"domain_scores_gemma":[0.9986444,0.00054703525,0.00006565453,0.00017548745,0.000540758,0.0000267308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017721311,0.0010038126,0.0012072047,0.0008777969,0.0007515176,0.0009800849,0.0019115192,0.0014447551,0.004962391],"category_scores_gemma":[0.003160718,0.00057255174,0.0009066987,0.0006162241,0.00038848325,0.0010525204,0.0014271194,0.0015535894,0.003086502],"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.00035859065,0.00016938009,0.0006982423,0.00014355223,0.00009235738,0.00008586991,0.00003199246,0.058532752,0.044847414,0.0032178012,0.005163161,0.8866589],"study_design_scores_gemma":[0.000026912556,0.00005435646,0.0004395693,0.000018563936,0.000019621677,0.00010393041,0.000009323679,0.972705,0.021410363,0.0019515967,0.0032459383,0.000014851843],"about_ca_topic_score_codex":0.0026340042,"about_ca_topic_score_gemma":0.0027865176,"teacher_disagreement_score":0.004962391,"about_ca_system_score_codex":0.0005036696,"about_ca_system_score_gemma":0.0010114089,"threshold_uncertainty_score":0.016600847},"labels":[],"label_agreement":null},{"id":"W2584450811","doi":"","title":"A higher order modal fixed point logic","year":2004,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","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":"Bell (Canada)","funders":"","keywords":"Decidability; Modal μ-calculus; Recursively enumerable language; Computer science; Fixed point; Bisimulation; Modal logic; Transition system; Normal modal logic; Property (philosophy); Negation; Modal operator; Discrete mathematics; Class (philosophy); Modal; Multimodal logic; Mathematics; Algorithm; Theoretical computer science; Description logic; Artificial intelligence; Programming language","score_opus":0.02811555052953642,"score_gpt":0.2511581400151554,"score_spread":0.22304258948561898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584450811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035095874,0.0011370667,0.8110128,0.00307544,0.00046616464,0.00010703591,0.0006535743,0.001064124,0.14738795],"genre_scores_gemma":[0.7060386,0.0011086406,0.2106468,0.0011125699,0.00046122746,0.00015259741,0.0007897511,0.00056745636,0.07912248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990152,0.00022676181,0.00006262524,0.00023371894,0.00030568105,0.00015599655],"domain_scores_gemma":[0.9992186,0.00035056536,0.000032030395,0.0001460845,0.00018340234,0.00006929236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436645,0.00083100743,0.0010221364,0.0019878112,0.0023178149,0.0039218753,0.0017906459,0.0017845436,0.019204518],"category_scores_gemma":[0.0017039655,0.00088582264,0.0024590152,0.002058727,0.0036984729,0.010110702,0.003342518,0.004631441,0.0025055895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010815323,0.0000071183067,0.000022898548,0.000016698066,0.00000398543,0.000024217054,0.000074975054,0.00027720447,0.0002924765,0.9960461,0.00061558443,0.0026078294],"study_design_scores_gemma":[0.00001163262,0.000011158362,0.000032007087,0.000011367507,0.000012856896,0.000046478322,0.000044230685,0.004175459,0.0004498868,0.98764384,0.007551239,0.0000098242945],"about_ca_topic_score_codex":0.0026657446,"about_ca_topic_score_gemma":0.0019804942,"teacher_disagreement_score":0.019204518,"about_ca_system_score_codex":0.0029251294,"about_ca_system_score_gemma":0.00084289286,"threshold_uncertainty_score":0.06424552},"labels":[],"label_agreement":null},{"id":"W2584488802","doi":"","title":"Formalizing ontology modularization through the notion of interfaces","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Ontology; Formalism (music); Modular programming; Modular design; Axiom; Process ontology; Ontology components; Exploit; Ontology-based data integration; Programming language; User interface; Description logic; Upper ontology; Theoretical computer science; Suggested Upper Merged Ontology; Process (computing); Epistemology; Computer security; Mathematics","score_opus":0.02926741205290727,"score_gpt":0.2660988135724736,"score_spread":0.23683140151956633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584488802","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.003850545,0.00012698851,0.9926541,0.00025681464,0.000042475953,0.00007007517,0.000035935907,0.00044859355,0.0025144245],"genre_scores_gemma":[0.14620708,0.0005783025,0.8483568,0.00037449066,0.0001641259,0.00036366037,0.00032320802,0.0004508595,0.0031814969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944496,0.001685428,0.0007755249,0.0010620898,0.0015555583,0.00047177367],"domain_scores_gemma":[0.9943838,0.0021657234,0.0006109941,0.0017501169,0.00079026935,0.00029911145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009104409,0.0011956288,0.00068356004,0.0019071547,0.0011876916,0.004268208,0.0026210246,0.001520743,0.002083498],"category_scores_gemma":[0.008433867,0.0010718073,0.0024249926,0.0012825142,0.005963909,0.016102731,0.0066816094,0.004364199,0.00067816005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025323861,0.000035404963,0.00028687855,0.00010477946,0.00003303692,0.00018697315,0.0010626981,0.0038561155,0.0038153837,0.9708722,0.0006615578,0.019059552],"study_design_scores_gemma":[0.000058642596,0.00007965412,0.00027501737,0.00019620615,0.00016738525,0.0004978435,0.0003432173,0.056409296,0.011482201,0.85717934,0.07324729,0.0000639141],"about_ca_topic_score_codex":0.0013035038,"about_ca_topic_score_gemma":0.0010977801,"teacher_disagreement_score":0.009104409,"about_ca_system_score_codex":0.0012674467,"about_ca_system_score_gemma":0.0024414014,"threshold_uncertainty_score":0.048149347},"labels":[],"label_agreement":null},{"id":"W2584563734","doi":"10.1007/978-3-319-53007-9","title":"Algorithms and Discrete Applied Mathematics","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Mathematics education; Theoretical computer science; Algorithm; Mathematics","score_opus":0.01622007180832667,"score_gpt":0.2604398636924852,"score_spread":0.24421979188415852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584563734","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051719905,0.06931443,0.42689064,0.0067502838,0.010455125,0.000109293345,0.0007478024,0.00093067467,0.47962967],"genre_scores_gemma":[0.1258449,0.087815486,0.18720162,0.002171238,0.012729078,0.00060967496,0.0017476304,0.0016837664,0.5801966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993249,0.000120996505,0.000036649853,0.00011596726,0.00035709326,0.00004430165],"domain_scores_gemma":[0.9994394,0.00022835976,0.000031199852,0.00013520195,0.00011984558,0.00004596497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000585852,0.001643616,0.0022591732,0.0022276645,0.0009097098,0.003941717,0.0012117797,0.0010333754,0.028048402],"category_scores_gemma":[0.0019073143,0.0005470351,0.0008778843,0.004032928,0.0022383407,0.0031086109,0.0019897523,0.00463174,0.014668471],"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.000017904085,0.000032203545,0.00011957698,0.0004199958,0.000030279532,0.0000319797,0.000114616036,0.0030185184,0.0008192203,0.71401197,0.068569005,0.21281475],"study_design_scores_gemma":[0.0000151354325,0.000020998183,0.00029569812,0.00014237862,0.000016703892,0.00016057139,0.000049318,0.010015275,0.00041536358,0.76047605,0.22838007,0.000012503541],"about_ca_topic_score_codex":0.0006642795,"about_ca_topic_score_gemma":0.0008103931,"teacher_disagreement_score":0.028048402,"about_ca_system_score_codex":0.0015993516,"about_ca_system_score_gemma":0.0010990875,"threshold_uncertainty_score":0.09383124},"labels":[],"label_agreement":null},{"id":"W2584897526","doi":"10.1007/978-3-319-57586-5_3","title":"Scheduling Maintenance Jobs in Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Time complexity; Job shop scheduling; Mathematical optimization; Simple (philosophy); Approximation algorithm; Distributed computing; Algorithm; Mathematics; Computer network","score_opus":0.02342604167475172,"score_gpt":0.26489842661823215,"score_spread":0.24147238494348044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584897526","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.08891173,0.0145156095,0.7910744,0.0016619734,0.0022613478,0.00024073732,0.00041118643,0.0019809334,0.098942146],"genre_scores_gemma":[0.6944141,0.0098696835,0.19041105,0.00032369638,0.0013107242,0.00019210757,0.00086494716,0.00074253004,0.10187113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983966,0.000025325724,0.0000072469993,0.000036842208,0.00005463761,0.00003633092],"domain_scores_gemma":[0.9997814,0.00009620489,0.000022911063,0.000043493277,0.000029460502,0.00002656544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847687,0.0007700275,0.0005238755,0.00041222377,0.00041232203,0.00082686765,0.0011301651,0.00053413253,0.0065701166],"category_scores_gemma":[0.0009210737,0.0003399996,0.00030373808,0.0009272325,0.00037500646,0.0008732827,0.0005307523,0.00082806457,0.0014866274],"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.0006635882,0.00016228246,0.00043683875,0.0008952077,0.000065021435,0.00018851287,0.00015857928,0.3255398,0.020853339,0.07045404,0.042049386,0.53853345],"study_design_scores_gemma":[0.0000774506,0.00038839102,0.001343867,0.00015309239,0.000055585202,0.00037187172,0.00011494238,0.72936386,0.011077973,0.17035043,0.08666561,0.000036856825],"about_ca_topic_score_codex":0.00096751994,"about_ca_topic_score_gemma":0.0011566839,"teacher_disagreement_score":0.0065701166,"about_ca_system_score_codex":0.00063166657,"about_ca_system_score_gemma":0.0005344913,"threshold_uncertainty_score":0.021979272},"labels":[],"label_agreement":null},{"id":"W2585687159","doi":"10.1007/978-3-319-53007-9_18","title":"Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.06490744186987044,"score_gpt":0.3080399301277933,"score_spread":0.24313248825792286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585687159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026635956,0.0006237741,0.9397754,0.0009130587,0.00042455466,0.00022680755,0.0005070145,0.0010433656,0.029850092],"genre_scores_gemma":[0.4863475,0.001494374,0.460805,0.000814149,0.00037792145,0.0006108036,0.0012189696,0.0006067189,0.047724616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876213,0.00040048282,0.00005484399,0.00021104426,0.00037731073,0.00019413738],"domain_scores_gemma":[0.99673104,0.0013436484,0.00019228383,0.0010710349,0.00043093588,0.00023106119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011403331,0.0007045211,0.0009651727,0.0010627685,0.0014373227,0.0021805896,0.0022956554,0.0012081589,0.008451155],"category_scores_gemma":[0.0055993,0.00053124374,0.0007945789,0.001748335,0.0011792813,0.0032210432,0.0029940868,0.002778427,0.0017428817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031464238,0.00013708227,0.00020847068,0.00026578348,0.000045322697,0.00007902007,0.0003792153,0.0976092,0.009598097,0.75675166,0.022821885,0.11178957],"study_design_scores_gemma":[0.000094830946,0.00011786099,0.00018783692,0.00008199807,0.000055043816,0.00019133209,0.00019075081,0.44371969,0.0052190935,0.52495694,0.025120718,0.00006392597],"about_ca_topic_score_codex":0.002183644,"about_ca_topic_score_gemma":0.0042618434,"teacher_disagreement_score":0.008451155,"about_ca_system_score_codex":0.002723762,"about_ca_system_score_gemma":0.0014446065,"threshold_uncertainty_score":0.028271973},"labels":[],"label_agreement":null},{"id":"W2585711800","doi":"10.1007/978-3-540-75555-5_36","title":"Numerical Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"stochastic dynamics and bifurcation","field":"Physics and Astronomy","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":"Hodgkin–Huxley model; Artificial neural network; Nonlinear system; Excitation; Limit cycle; Statistical physics; Annihilation; Physics; Spiking neural network; Neuron; Computer science; Perturbation (astronomy); Mathematics; Artificial intelligence; Neuroscience; Quantum mechanics; Biology","score_opus":0.022098065547178237,"score_gpt":0.26105635725590015,"score_spread":0.2389582917087219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585711800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3634151,0.008530024,0.5162497,0.0046297484,0.000870947,0.00009436326,0.000403706,0.00064141565,0.10516495],"genre_scores_gemma":[0.9599732,0.0012705182,0.028554024,0.00019577603,0.0001277388,0.00006681093,0.00011948401,0.00013489976,0.009557496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998504,0.000049505332,0.000011257361,0.000019147225,0.000051841773,0.000017923745],"domain_scores_gemma":[0.99794775,0.0014256057,0.00014283096,0.000090863294,0.0002813996,0.00011156908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008572331,0.00040629803,0.00059559295,0.0006086659,0.00062948343,0.0010199604,0.0010404077,0.0011362572,0.0059479107],"category_scores_gemma":[0.00771979,0.00030028351,0.00037271745,0.00072020054,0.0011385595,0.0017579233,0.0009867708,0.00082748994,0.00035891056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000751549,0.00004581037,0.0009159226,0.0001824794,0.00003255578,0.00012894075,0.00010414719,0.7378153,0.0020407382,0.24556136,0.0019487424,0.011148739],"study_design_scores_gemma":[0.0000054808315,0.000004211025,0.00009262312,0.000008796439,0.0000044402022,0.000019658015,0.000011337501,0.97706735,0.00017435823,0.022396853,0.0002097315,0.000005140527],"about_ca_topic_score_codex":0.0035724316,"about_ca_topic_score_gemma":0.0032809929,"teacher_disagreement_score":0.0059479107,"about_ca_system_score_codex":0.0007802452,"about_ca_system_score_gemma":0.0007851203,"threshold_uncertainty_score":0.019897759},"labels":[],"label_agreement":null},{"id":"W2587101888","doi":"10.1007/978-3-319-52962-2_2","title":"Algorithmic Developments of Information Granules of Higher Type and Higher Order and Their Applications","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Granule (geology); Granularity; Granular computing; Theoretical computer science; Data mining; Programming language; Materials science; Rough set","score_opus":0.015303115714508589,"score_gpt":0.23738035709804953,"score_spread":0.22207724138354093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587101888","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.0327451,0.013582933,0.92763263,0.0021407246,0.00061111944,0.000060851056,0.00023135949,0.0001095249,0.022885788],"genre_scores_gemma":[0.50776005,0.012012776,0.46349427,0.0006912938,0.0024180077,0.00026416013,0.00047797058,0.00014542385,0.012736138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987847,0.00041963503,0.00013027003,0.00026186192,0.0003189807,0.00008457421],"domain_scores_gemma":[0.9957587,0.0026830642,0.00042607277,0.0004181637,0.000502793,0.0002111417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028568832,0.00079802016,0.001253981,0.002664153,0.00088722224,0.005010384,0.001454966,0.0012451777,0.0030030063],"category_scores_gemma":[0.009467849,0.0007265786,0.002070266,0.0035331994,0.0033657327,0.008423871,0.0025705122,0.0034206943,0.00035711957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010360544,0.000008519938,0.00018042017,0.00006061963,0.000013881576,0.00003378505,0.00011949339,0.0021483921,0.00019860854,0.9896116,0.0006012615,0.007013181],"study_design_scores_gemma":[0.000003941414,0.000010571143,0.00017358265,0.000021747435,0.000010413071,0.000052875028,0.000037318285,0.022150606,0.00011092265,0.9749985,0.0024190762,0.000010518328],"about_ca_topic_score_codex":0.0006922428,"about_ca_topic_score_gemma":0.0005860117,"teacher_disagreement_score":0.005010384,"about_ca_system_score_codex":0.0014539632,"about_ca_system_score_gemma":0.000679206,"threshold_uncertainty_score":0.015108824},"labels":[],"label_agreement":null},{"id":"W2587796768","doi":"10.1007/978-3-319-52836-6_75","title":"Timeline Wiki: Reflections on the Use of an Innovative Teaching Strategy","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","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 British Columbia","funders":"","keywords":"Timeline; Computer science; Usability; Curriculum; Presentation (obstetrics); Autonomy; Multimedia; Cognitive load; World Wide Web; Human–computer interaction; Cognition; Pedagogy; Psychology","score_opus":0.12978622056604755,"score_gpt":0.4032012510865528,"score_spread":0.27341503052050525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587796768","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.30881575,0.00555017,0.116824165,0.06030648,0.0061177677,0.0007770911,0.00065664394,0.0040499843,0.49690193],"genre_scores_gemma":[0.704877,0.0045311237,0.092153125,0.0091396,0.00076505594,0.00076392264,0.00062377856,0.003584253,0.18356217],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9922661,0.005123894,0.0001844644,0.00043254092,0.0014863343,0.000506774],"domain_scores_gemma":[0.97033846,0.023307897,0.000822337,0.0017682721,0.0020506682,0.0017123757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010271152,0.00067730783,0.0003771788,0.0012214791,0.00416399,0.010479797,0.002718444,0.0037908757,0.0074105333],"category_scores_gemma":[0.03117632,0.000365065,0.00043530535,0.0014683357,0.004275268,0.0119496975,0.006794413,0.004895089,0.0024595265],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024257206,0.0009074029,0.0016110935,0.0007432295,0.000033941527,0.0011755859,0.4709925,0.0004575879,0.0043269442,0.064896874,0.109463654,0.3451486],"study_design_scores_gemma":[0.000058053753,0.00020056288,0.001407353,0.00052855496,0.000028620643,0.00075365923,0.110995404,0.0008037004,0.0032100284,0.012341459,0.86960065,0.000071873284],"about_ca_topic_score_codex":0.003643225,"about_ca_topic_score_gemma":0.008979935,"teacher_disagreement_score":0.010479797,"about_ca_system_score_codex":0.0031491301,"about_ca_system_score_gemma":0.004535776,"threshold_uncertainty_score":0.05431968},"labels":[],"label_agreement":null},{"id":"W2588372621","doi":"10.1007/978-3-319-54157-0_5","title":"Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Iterated local search; Leverage (statistics); Local search (optimization); Component (thermodynamics); Mathematical optimization; Guided Local Search; Context (archaeology); Machine learning; Artificial intelligence; Mathematics","score_opus":0.04043317929019216,"score_gpt":0.3127122113113464,"score_spread":0.2722790320211542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588372621","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.042974077,0.0004987258,0.9457491,0.00007097654,0.00009257987,0.00012800132,0.00009925268,0.0054695597,0.004917839],"genre_scores_gemma":[0.3622359,0.00015461037,0.6322209,0.00012279986,0.000027988459,0.00027884915,0.00035577433,0.0014053928,0.003197683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994585,0.00013942056,0.000037399775,0.00014704514,0.00016182526,0.000055778088],"domain_scores_gemma":[0.9989518,0.0005172117,0.000089981426,0.00019416942,0.00017704214,0.00006973155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010888241,0.001498393,0.001621929,0.00095388707,0.00046782658,0.0012178766,0.0020533723,0.0013208261,0.005096379],"category_scores_gemma":[0.0028536099,0.0008539309,0.0010287768,0.0009290118,0.00052533165,0.001587757,0.0019092107,0.0012748361,0.001684524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042735747,0.0002631544,0.0012208301,0.0003601506,0.00014607736,0.00022537174,0.00015434084,0.63483244,0.031501934,0.0028317177,0.004347743,0.32368892],"study_design_scores_gemma":[0.000015823198,0.000044938104,0.0001587979,0.000011118973,0.00001411654,0.000026524358,0.000014201311,0.9953644,0.0029736285,0.0007879726,0.000579634,0.000008771514],"about_ca_topic_score_codex":0.0016154221,"about_ca_topic_score_gemma":0.0024470005,"teacher_disagreement_score":0.005096379,"about_ca_system_score_codex":0.0005540892,"about_ca_system_score_gemma":0.00053490157,"threshold_uncertainty_score":0.017049074},"labels":[],"label_agreement":null},{"id":"W2589613037","doi":"10.1007/978-3-319-54045-0_3","title":"Modeling and Analyzing Openness Trade-Offs in Software Platforms: A Goal-Oriented Approach","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Source Software Innovations","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Openness to experience; Software engineering; Context (archaeology); Software; Principal (computer security); Domain (mathematical analysis); Software quality; Risk analysis (engineering); Automotive industry; Software development; Process management; Computer security; Engineering; Business; Operating system","score_opus":0.024151624740732635,"score_gpt":0.25974182817928054,"score_spread":0.23559020343854792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589613037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1278165,0.0012622267,0.8556189,0.0010007257,0.00004562029,0.000119770775,0.00013830699,0.00026475277,0.013733261],"genre_scores_gemma":[0.80496067,0.0012176451,0.19025834,0.00008967634,0.000052969674,0.00016951509,0.00015985483,0.00014879605,0.002942443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978992,0.00083236845,0.00009744443,0.00037491278,0.0004411103,0.00035501752],"domain_scores_gemma":[0.9908937,0.006821479,0.0010152378,0.0005473233,0.00038021922,0.00034190682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041096797,0.001521615,0.0010826148,0.0019718234,0.0007482725,0.004561058,0.0020519325,0.0019099033,0.0019019182],"category_scores_gemma":[0.010184596,0.0012486676,0.002138305,0.002108663,0.00244,0.0069995318,0.002375472,0.002912159,0.00024817494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069031485,0.00016724566,0.004767665,0.0001490193,0.00011024143,0.00018115362,0.00028296228,0.7080008,0.0019142736,0.25804868,0.00049022626,0.025818657],"study_design_scores_gemma":[0.000007881918,0.000027267055,0.0005334531,0.00003594867,0.000044580236,0.00002939372,0.00010787558,0.7748633,0.00044047966,0.22320773,0.0006878489,0.000014270975],"about_ca_topic_score_codex":0.0033132886,"about_ca_topic_score_gemma":0.0034893667,"teacher_disagreement_score":0.004561058,"about_ca_system_score_codex":0.0020854163,"about_ca_system_score_gemma":0.0017197293,"threshold_uncertainty_score":0.021734357},"labels":[],"label_agreement":null},{"id":"W2591833252","doi":"10.1007/978-3-319-54193-8_21","title":"Unsupervised Crowd Counting","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Crowds; Artificial intelligence; Scalability; Image (mathematics); Computer vision; Limiting; Pattern recognition (psychology)","score_opus":0.03348549760387232,"score_gpt":0.2919645830608947,"score_spread":0.25847908545702236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591833252","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.004623333,0.001310329,0.9654048,0.00022619337,0.00045847008,0.00014532714,0.0010534283,0.0047322223,0.022045983],"genre_scores_gemma":[0.120695524,0.0021519968,0.7746994,0.00036714764,0.00076057896,0.00035195035,0.01121262,0.002566248,0.08719443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985201,0.00017620578,0.000054349555,0.00063117006,0.00045371815,0.0001643835],"domain_scores_gemma":[0.99904746,0.00016893761,0.00005002251,0.00032752345,0.0003351635,0.000070969036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011463637,0.0021482164,0.0021917548,0.003473066,0.0013426361,0.002388169,0.0026024375,0.0015931482,0.013260479],"category_scores_gemma":[0.0028895233,0.0010852675,0.0013452639,0.0023989768,0.00087088754,0.0021749847,0.0033941306,0.0016248069,0.014846942],"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.00016634013,0.00012791393,0.00081608957,0.00023426063,0.00011960801,0.0001081687,0.00009406073,0.03500177,0.0127167655,0.021962304,0.06286379,0.86578894],"study_design_scores_gemma":[0.000025524252,0.000075936696,0.002236074,0.00016028342,0.00010296157,0.00084022805,0.00010857179,0.7661693,0.03593007,0.07498562,0.119267955,0.000097421085],"about_ca_topic_score_codex":0.0033386138,"about_ca_topic_score_gemma":0.00538106,"teacher_disagreement_score":0.013260479,"about_ca_system_score_codex":0.00072739995,"about_ca_system_score_gemma":0.001222571,"threshold_uncertainty_score":0.044360757},"labels":[],"label_agreement":null},{"id":"W2592468459","doi":"10.1007/11841036_5","title":"Dynamic Connectivity for Axis-Parallel Rectangles","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intersection (aeronautics); Amortized analysis; Matrix multiplication; Graph; Data structure; Combinatorics; Time complexity; Range (aeronautics); Multiplication (music); Algorithm; Theoretical computer science; Mathematics","score_opus":0.014827848868001444,"score_gpt":0.25219077753308417,"score_spread":0.2373629286650827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592468459","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.083830796,0.0011207795,0.83618176,0.0003093204,0.00016641927,0.000109209555,0.00049324625,0.00091295125,0.0768755],"genre_scores_gemma":[0.61328244,0.002470848,0.33820346,0.00013018088,0.00017020908,0.00033290568,0.0018954886,0.00082915596,0.04268534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973553,0.000039525123,0.000011761682,0.00007113104,0.000103167986,0.00003873595],"domain_scores_gemma":[0.99947685,0.000214507,0.00006335284,0.000104181876,0.00009296834,0.0000481443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002326824,0.00042154035,0.00045406283,0.0010875164,0.00075230683,0.0010606924,0.0010885986,0.0005404014,0.012235914],"category_scores_gemma":[0.0015606559,0.0005352867,0.00038653237,0.0013709924,0.0006829681,0.0018179752,0.0013939907,0.0009328395,0.0012337234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022518549,0.000066715256,0.0007204853,0.00028338874,0.000018339804,0.00035966918,0.00039846756,0.09557496,0.016349813,0.6723327,0.013867406,0.19980282],"study_design_scores_gemma":[0.00007770848,0.00011042475,0.0009008439,0.00010403325,0.000029616776,0.0009935432,0.00032430235,0.4035539,0.008086441,0.52441835,0.0613593,0.00004147394],"about_ca_topic_score_codex":0.0013266891,"about_ca_topic_score_gemma":0.0013704306,"teacher_disagreement_score":0.012235914,"about_ca_system_score_codex":0.00045597696,"about_ca_system_score_gemma":0.00021595086,"threshold_uncertainty_score":0.04093319},"labels":[],"label_agreement":null},{"id":"W2592586109","doi":"10.1007/978-3-319-54876-0_1","title":"CLiKC: A Privacy-Mindful Approach When Sharing Data","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Université de Montréal","funders":"","keywords":"Computer science; Context (archaeology); Set (abstract data type); Data sharing; Data mining; Information privacy; Data science; Computer security","score_opus":0.08146606906695866,"score_gpt":0.2976764358269865,"score_spread":0.21621036676002783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592586109","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.0018377457,0.00033876105,0.9748497,0.0016198865,0.00031451214,0.00036886698,0.00040387703,0.00667389,0.013592796],"genre_scores_gemma":[0.124829456,0.0007397686,0.82994807,0.0029866216,0.00032028192,0.0010071604,0.0022892049,0.0032867913,0.03459258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9781266,0.0072370633,0.0014120877,0.0025755616,0.008761282,0.0018875811],"domain_scores_gemma":[0.978316,0.004838527,0.00069081865,0.012952783,0.0022686264,0.0009333294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013192792,0.001475612,0.0014694072,0.002276503,0.0039702724,0.011144235,0.008699036,0.0050126645,0.018916497],"category_scores_gemma":[0.02978089,0.0016036731,0.0026332764,0.004240693,0.0060945717,0.01798487,0.01855871,0.010171948,0.0073322677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004623742,0.00017942741,0.0006019648,0.00053466944,0.00011816021,0.00037452846,0.0012927032,0.00913465,0.004996874,0.7619829,0.06249406,0.15782782],"study_design_scores_gemma":[0.00006555557,0.0000747419,0.00019937541,0.00026097152,0.00009879188,0.000799291,0.00035130253,0.12307269,0.017745983,0.67123955,0.18594569,0.00014613433],"about_ca_topic_score_codex":0.004203577,"about_ca_topic_score_gemma":0.0042256,"teacher_disagreement_score":0.018916497,"about_ca_system_score_codex":0.003677658,"about_ca_system_score_gemma":0.0070602843,"threshold_uncertainty_score":0.06977099},"labels":[],"label_agreement":null},{"id":"W2592640428","doi":"10.1007/978-3-319-55134-0_22","title":"Investigation of Social Predictors of Competitive Behavior in Persuasive Technology","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Competition (biology); Context (archaeology); Persuasive technology; Psychology; Social learning; Sample (material); Social media; Computer science; Variation (astronomy); Social influence; Social psychology; Persuasion; Knowledge management; World Wide Web","score_opus":0.019146410098598163,"score_gpt":0.2773327695604986,"score_spread":0.25818635946190044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592640428","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.9966918,0.0001278115,0.000181759,0.00010122656,0.000007579563,0.00001323904,0.000039837807,0.000004374161,0.002832299],"genre_scores_gemma":[0.99912864,0.00006725395,0.00019384077,0.000015950374,0.000016166981,0.000020166026,0.000053755815,0.0000040533214,0.00050009],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99754375,0.0015183005,0.00010783775,0.00016866354,0.0004724506,0.00018900249],"domain_scores_gemma":[0.9301197,0.057187404,0.0068075736,0.0011423805,0.0023708513,0.0023722516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694328,0.00034042838,0.00030722652,0.0013209236,0.0009246445,0.001962941,0.0005489057,0.0011428179,0.0042676367],"category_scores_gemma":[0.02896126,0.00031700186,0.0004088493,0.0013026177,0.0005933517,0.0010344761,0.0007035694,0.0013605141,0.00063987315],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039568995,0.0013180989,0.9805015,0.000039902487,0.00015721457,0.00010849331,0.0021267245,0.00022508245,0.000528522,0.00068790576,0.00024582518,0.013665084],"study_design_scores_gemma":[0.00001719592,0.00045913635,0.9924642,0.000025289793,0.00011234899,0.00014548027,0.0026887597,0.002582125,0.0004273679,0.0006734674,0.0003888808,0.00001574796],"about_ca_topic_score_codex":0.0026970727,"about_ca_topic_score_gemma":0.0039803297,"teacher_disagreement_score":0.0042676367,"about_ca_system_score_codex":0.0005016355,"about_ca_system_score_gemma":0.000576024,"threshold_uncertainty_score":0.014276683},"labels":[],"label_agreement":null},{"id":"W2592738962","doi":"10.1007/978-3-319-54609-4_17","title":"A Study of Children Facial Recognition for Privacy in Smart TV","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"McGill University; York University; University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Facial recognition system; Human–computer interaction; Multimedia; Computer security; Internet privacy; Artificial intelligence; Speech recognition; Pattern recognition (psychology)","score_opus":0.032716323961689484,"score_gpt":0.29215773948300433,"score_spread":0.25944141552131483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592738962","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.9924603,0.00015119981,0.0008902152,0.00005273249,0.000008515081,0.000021622636,0.00004350125,0.000006101691,0.0063658166],"genre_scores_gemma":[0.9952218,0.00020285313,0.0007449868,0.000033237022,0.000005672075,0.0000119697,0.00005297658,0.000006344958,0.0037201857],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99965847,0.00009658898,0.0000108390595,0.000065887245,0.00010409434,0.00006405529],"domain_scores_gemma":[0.9993926,0.0003635917,0.00007239226,0.000041011383,0.00009383375,0.00003647322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004608595,0.00020943451,0.0001482224,0.00033415336,0.0005044037,0.0004936784,0.00021986384,0.0002994279,0.0027190633],"category_scores_gemma":[0.0017534096,0.00011864806,0.0002728751,0.0002583885,0.00045112392,0.00049890333,0.00031805137,0.00038944697,0.00044050548],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096721883,0.0013797354,0.5478778,0.00038065627,0.000117997406,0.0035212222,0.0593892,0.0013137908,0.13715611,0.006980569,0.00483004,0.2360856],"study_design_scores_gemma":[0.000009664706,0.00084460515,0.92483103,0.000066276465,0.00010524817,0.003606576,0.030338585,0.0035396933,0.025867505,0.0005485692,0.010202467,0.00003977181],"about_ca_topic_score_codex":0.0075637563,"about_ca_topic_score_gemma":0.00770012,"teacher_disagreement_score":0.0075637563,"about_ca_system_score_codex":0.0006339493,"about_ca_system_score_gemma":0.0003597092,"threshold_uncertainty_score":0.015039504},"labels":[],"label_agreement":null},{"id":"W2593101677","doi":"10.1007/978-3-319-55134-0_23","title":"Perceived Effectiveness, Credibility and Continuance Intention in E-commerce: A Study of Amazon","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Credibility; Continuance; Amazon rainforest; Structural equation modeling; Persuasive communication; Product (mathematics); Perception; Sample (material); Psychology; Usability; Affect (linguistics); Source credibility; Computer science; Applied psychology; Social psychology; Political science; Persuasion","score_opus":0.024358787461630445,"score_gpt":0.3101315559365052,"score_spread":0.28577276847487476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593101677","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.99948704,0.000024111443,0.00001607719,0.00005618485,0.0000015628528,0.000005338754,0.000013054309,8.804438e-7,0.00039579737],"genre_scores_gemma":[0.9987245,0.000050098464,0.00010216169,0.000085335116,0.0000034672933,0.000010078497,0.000046463687,0.0000053882554,0.0009725276],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994324,0.00014877698,0.000044346405,0.000082260456,0.00021103992,0.00008127449],"domain_scores_gemma":[0.9949622,0.0026344568,0.00085838395,0.0002541951,0.0005245229,0.0007662233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015912941,0.00025285146,0.0005766873,0.00050209975,0.0015208538,0.0023309086,0.0010320855,0.0010116941,0.0036968656],"category_scores_gemma":[0.0056557665,0.0006637052,0.0004721626,0.0010104327,0.0009681687,0.0018884346,0.00059950585,0.002027115,0.0006753004],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000954946,0.009492212,0.8961047,0.00010087547,0.00017690357,0.0010508053,0.06806488,0.00010761739,0.0063125477,0.0012260925,0.0008147838,0.0155937495],"study_design_scores_gemma":[0.000049029644,0.00062974315,0.9726165,0.000017721462,0.00008651511,0.00028231705,0.024263417,0.0007401876,0.00038303828,0.00014016604,0.0007615178,0.000029772913],"about_ca_topic_score_codex":0.041345567,"about_ca_topic_score_gemma":0.06312272,"teacher_disagreement_score":0.041345567,"about_ca_system_score_codex":0.0010155414,"about_ca_system_score_gemma":0.0012314521,"threshold_uncertainty_score":0.082209826},"labels":[],"label_agreement":null},{"id":"W2593429156","doi":"10.1007/978-3-319-54181-5_22","title":"SSP: Supervised Sparse Projections for Large-Scale Retrieval in High Dimensions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Leverage (statistics); Artificial intelligence; Encoding (memory); Convolutional neural network; Pattern recognition (psychology); Binary number; Projection (relational algebra); RGB color model; Neural coding; Binary code; Sparse matrix; Algorithm","score_opus":0.02869503918154223,"score_gpt":0.295643243122963,"score_spread":0.2669482039414207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593429156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017631752,0.00022563864,0.99491864,0.00009208751,0.00006179144,0.00003964168,0.00020373984,0.0020943137,0.0006008965],"genre_scores_gemma":[0.05117335,0.00062431325,0.9374087,0.00021462898,0.00023715927,0.00032574218,0.0021987471,0.00076237635,0.007054908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900264,0.00025432423,0.000049765895,0.00017807752,0.0004431079,0.00007209213],"domain_scores_gemma":[0.9986766,0.000534254,0.000075050484,0.0003790794,0.0002636097,0.00007143646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009703781,0.0016008675,0.0017187013,0.0008253177,0.0005299768,0.0013413893,0.0018909096,0.0015310184,0.008025671],"category_scores_gemma":[0.0035483218,0.0007435792,0.0010197263,0.002056515,0.00092159037,0.0023864713,0.003217668,0.0025088142,0.0062606544],"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.00032466635,0.00020680984,0.00029801443,0.00040053795,0.00012750228,0.0001507429,0.00013024006,0.07666363,0.022997048,0.021860594,0.06027505,0.81656516],"study_design_scores_gemma":[0.00004206702,0.000094277384,0.00020180909,0.000017274431,0.00001732158,0.00017277473,0.00003404765,0.95711845,0.007358969,0.027167307,0.007750237,0.000025521535],"about_ca_topic_score_codex":0.002035276,"about_ca_topic_score_gemma":0.0028931457,"teacher_disagreement_score":0.008025671,"about_ca_system_score_codex":0.00032373203,"about_ca_system_score_gemma":0.00093292526,"threshold_uncertainty_score":0.026848555},"labels":[],"label_agreement":null},{"id":"W2593518447","doi":"10.1007/978-3-319-54999-6_7","title":"A New Approach to Detecting Execution Phases Using Performance Monitoring Counters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Real-time computing","score_opus":0.04579662572942246,"score_gpt":0.2934768732068506,"score_spread":0.24768024747742817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593518447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004448673,0.0007507301,0.98713535,0.00016389838,0.00036878296,0.00013383478,0.000120751676,0.004308674,0.0025692566],"genre_scores_gemma":[0.10949213,0.00060585735,0.8786227,0.00037729973,0.00043502252,0.00028014882,0.00028872653,0.00053040404,0.0093676895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956416,0.00047340026,0.00026676347,0.0010840157,0.0022889425,0.00024528924],"domain_scores_gemma":[0.9930059,0.0020923137,0.0009853273,0.0017942134,0.0018568896,0.00026541587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014565082,0.002320654,0.0017308021,0.004693164,0.0011283632,0.003362879,0.0037519864,0.0017498344,0.004327917],"category_scores_gemma":[0.0063158786,0.0012061731,0.00093088223,0.0028464252,0.0010985417,0.0043741344,0.002507156,0.003528022,0.0020452985],"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.0006836915,0.00048427843,0.004555173,0.0005663123,0.00026214987,0.00023673262,0.00025677215,0.021017859,0.11657103,0.04092652,0.011037074,0.8034025],"study_design_scores_gemma":[0.000098882396,0.0005310087,0.0023204081,0.000117503725,0.0003505428,0.0010552064,0.000101225785,0.76223654,0.1532199,0.03782866,0.041914,0.00022611882],"about_ca_topic_score_codex":0.0017622052,"about_ca_topic_score_gemma":0.0031522436,"teacher_disagreement_score":0.004693164,"about_ca_system_score_codex":0.0009892932,"about_ca_system_score_gemma":0.0016700187,"threshold_uncertainty_score":0.014478326},"labels":[],"label_agreement":null},{"id":"W2594165071","doi":"10.1007/978-3-319-59569-6_50","title":"Vector Embedding of Wikipedia Concepts and Entities","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Embedding; Word embedding; Analogy; Similarity (geometry); Word (group theory); Natural language processing; Artificial intelligence; Task (project management); Vector space; Information retrieval; Linguistics; Image (mathematics); Mathematics","score_opus":0.023726935634417114,"score_gpt":0.2810208361709135,"score_spread":0.25729390053649637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594165071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094344,0.015065317,0.84746385,0.0018509241,0.0020755536,0.00020204602,0.022868976,0.003932975,0.025596889],"genre_scores_gemma":[0.54115725,0.012969799,0.3550636,0.00029719027,0.0009285917,0.00037133484,0.049691055,0.0008961601,0.038625028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.00012737632,0.000046196572,0.00016361901,0.00013804606,0.000031741143],"domain_scores_gemma":[0.99911195,0.00030578766,0.00009127606,0.00013156366,0.00030975384,0.00004964335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901257,0.00069318316,0.0004482831,0.0033727041,0.00031682875,0.0015562612,0.00054972485,0.00049728126,0.004083605],"category_scores_gemma":[0.003036631,0.0002678664,0.0004878155,0.0047289142,0.00030465427,0.0033595962,0.00094572135,0.00080005697,0.0024759383],"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.0003202136,0.00019143161,0.0037657684,0.0014930664,0.00022257383,0.000232806,0.00073617353,0.015202244,0.0175672,0.067797974,0.09121461,0.801256],"study_design_scores_gemma":[0.000051329138,0.00020497614,0.012868843,0.0008637599,0.00031451546,0.0017112856,0.000910125,0.50212944,0.019880155,0.18067558,0.28023502,0.00015504597],"about_ca_topic_score_codex":0.001867406,"about_ca_topic_score_gemma":0.0032665874,"teacher_disagreement_score":0.004083605,"about_ca_system_score_codex":0.00043248365,"about_ca_system_score_gemma":0.00054130505,"threshold_uncertainty_score":0.013661027},"labels":[],"label_agreement":null},{"id":"W2595752505","doi":"10.1007/978-3-319-70972-7_30","title":"Short Paper: TLS Ecosystems in Networked Devices vs. Web Servers","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Server; Web server; The Internet; Computer security; World Wide Web; Operating system; Computer network","score_opus":0.01566567482905149,"score_gpt":0.25729182166948106,"score_spread":0.24162614684042957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595752505","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.06389382,0.12853809,0.061883338,0.16470763,0.18029182,0.00020254764,0.006105669,0.0022234828,0.39215365],"genre_scores_gemma":[0.36007094,0.0690944,0.018122282,0.01895803,0.062007748,0.00015423555,0.007161905,0.0022596116,0.4621709],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9994987,0.00009665223,0.000025612513,0.00016451732,0.00015944942,0.000055050037],"domain_scores_gemma":[0.99636865,0.0020416663,0.00017461098,0.00022402989,0.0007874639,0.00040354463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072534854,0.00063377654,0.0005043737,0.0012186139,0.0011254916,0.0038792787,0.0008673288,0.0018960644,0.044384662],"category_scores_gemma":[0.004231893,0.00025218722,0.00037118475,0.0029675374,0.00083491765,0.007192004,0.00090122817,0.00213883,0.011208477],"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.0002859762,0.000107959175,0.0017874178,0.0007520887,0.00004686325,0.00014442609,0.000330043,0.0019820945,0.0020679254,0.09805448,0.73157257,0.16286825],"study_design_scores_gemma":[0.00005960398,0.00015786849,0.0056722984,0.00090950035,0.00010984293,0.00056813075,0.0010368124,0.008668261,0.004590309,0.1701755,0.80798316,0.00006866201],"about_ca_topic_score_codex":0.002135656,"about_ca_topic_score_gemma":0.0024271968,"teacher_disagreement_score":0.044384662,"about_ca_system_score_codex":0.0013688464,"about_ca_system_score_gemma":0.0008330973,"threshold_uncertainty_score":0.14848149},"labels":[],"label_agreement":null},{"id":"W2596094020","doi":"10.1007/978-3-662-54434-1_19","title":"Programs Using Syntax with First-Class Binders","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Computer science; Abstract syntax tree; Programming language; Syntax; Abstract syntax; Class (philosophy); Reuse; Matching (statistics); Pattern matching; Embedding; Translation (biology); Syntax error; Artificial intelligence","score_opus":0.03577206270416687,"score_gpt":0.25101115922924905,"score_spread":0.21523909652508216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596094020","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.0076856944,0.00133312,0.91702646,0.0013358799,0.00053712825,0.00006377099,0.0005035669,0.008466274,0.06304806],"genre_scores_gemma":[0.3488368,0.0041009937,0.5157204,0.0011645874,0.0006989457,0.0004224873,0.0016581719,0.0097948685,0.117602825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980034,0.0004923108,0.00018907247,0.000458227,0.0005734224,0.00028352594],"domain_scores_gemma":[0.99767524,0.001222285,0.00013516861,0.0005845379,0.00028037358,0.00010237565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021629485,0.0014177347,0.0011261689,0.0013779964,0.0016254057,0.007013566,0.0022479338,0.0017626281,0.019212605],"category_scores_gemma":[0.005689974,0.0011994581,0.0017615034,0.0020583048,0.0038255865,0.013479038,0.004420644,0.005228214,0.0061770775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031446514,0.000016086173,0.00011191453,0.00017184786,0.000014148179,0.00005281006,0.0005886056,0.0009878415,0.001335739,0.93689674,0.008290147,0.051502675],"study_design_scores_gemma":[0.00003545124,0.000017493425,0.00009087062,0.00016091242,0.000038522423,0.00021480101,0.00007269268,0.0053972495,0.0060717496,0.83365005,0.15420683,0.000043430467],"about_ca_topic_score_codex":0.0010526984,"about_ca_topic_score_gemma":0.0011037146,"teacher_disagreement_score":0.019212605,"about_ca_system_score_codex":0.00162008,"about_ca_system_score_gemma":0.0020469576,"threshold_uncertainty_score":0.06427258},"labels":[],"label_agreement":null},{"id":"W259623631","doi":"10.1007/978-3-319-13075-0_28","title":"An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Multiset; Partition (number theory); Combinatorics; Partition problem; Integer (computer science); Cardinality (data modeling); Approximation algorithm; Mathematics; Discrete mathematics; Algorithm; Computer science","score_opus":0.010974862968068358,"score_gpt":0.24466394039994496,"score_spread":0.2336890774318766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W259623631","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.031388152,0.0013254443,0.9400983,0.0014035214,0.0005202879,0.00043931082,0.0008723439,0.0026772027,0.021275429],"genre_scores_gemma":[0.09422686,0.00049422326,0.8954305,0.0004106127,0.00024312921,0.00053034106,0.0019297877,0.0005794829,0.0061550364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748886,0.000551878,0.00012504082,0.00058587966,0.00076435885,0.0004839162],"domain_scores_gemma":[0.99687576,0.0016577557,0.00016487946,0.0007136997,0.00039363754,0.00019435868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017504577,0.0022154755,0.002906898,0.0019189452,0.0016314697,0.0040496,0.0055175726,0.002708316,0.013394469],"category_scores_gemma":[0.00775899,0.0010190032,0.0022772818,0.005039586,0.0013200288,0.00611545,0.0036121255,0.0048281588,0.0030548512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013875014,0.0008694404,0.0009354062,0.0006325201,0.00016900907,0.00020544199,0.00041763636,0.29252595,0.0066593844,0.09292555,0.04956564,0.55370647],"study_design_scores_gemma":[0.00042837713,0.0001679719,0.00035475357,0.000058450834,0.00008426558,0.00021962516,0.00015358282,0.89000684,0.0017422527,0.095591314,0.011153523,0.000039082744],"about_ca_topic_score_codex":0.005925424,"about_ca_topic_score_gemma":0.007929179,"teacher_disagreement_score":0.013394469,"about_ca_system_score_codex":0.0031097415,"about_ca_system_score_gemma":0.0036282039,"threshold_uncertainty_score":0.044808984},"labels":[],"label_agreement":null},{"id":"W2597610332","doi":"10.1007/978-3-319-56148-6_44","title":"Hands-Free EEG-Based Control of a Computer Interface Based on Online Detection of Clenching of Jaw","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Simon Fraser University","funders":"","keywords":"Computer science; SIGNAL (programming language); Electroencephalography; Sensitivity (control systems); Medicine","score_opus":0.02164508271262911,"score_gpt":0.2676915515404138,"score_spread":0.2460464688277847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597610332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16765451,0.0012452027,0.7940985,0.00035772563,0.0008626488,0.0009864309,0.0006911139,0.007797584,0.026306331],"genre_scores_gemma":[0.85714597,0.0004057519,0.12391646,0.00049339025,0.0002890144,0.0004334309,0.00028229825,0.00044414992,0.016589554],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997552,0.000028755458,0.000015955475,0.00007661529,0.00009450788,0.000028960158],"domain_scores_gemma":[0.9996793,0.00015770219,0.000022920218,0.000037316684,0.00007164608,0.000031145733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031509425,0.0007367089,0.00049977296,0.00041098762,0.0002961818,0.00071245513,0.0013508075,0.00072681194,0.01516664],"category_scores_gemma":[0.0008415558,0.00021815822,0.00026193896,0.00022380696,0.00025866996,0.0004308726,0.00046566027,0.00035216825,0.0022186898],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001184967,0.00031332468,0.00075073744,0.00045752455,0.00006414007,0.00029622097,0.00017393724,0.0010529915,0.6997767,0.0007416607,0.003936217,0.29125157],"study_design_scores_gemma":[0.0006946413,0.0034702464,0.063736066,0.00024185772,0.00048331032,0.005610897,0.0002095121,0.21269226,0.67653894,0.0032743306,0.0327988,0.00024910236],"about_ca_topic_score_codex":0.0005594544,"about_ca_topic_score_gemma":0.0013258536,"teacher_disagreement_score":0.01516664,"about_ca_system_score_codex":0.000110673005,"about_ca_system_score_gemma":0.00021120925,"threshold_uncertainty_score":0.05073744},"labels":[],"label_agreement":null},{"id":"W2598134248","doi":"10.1007/978-3-319-62389-4_17","title":"Information Complexity of the AND Function in the Two-Party and Multi-party Settings","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","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":"McGill University","funders":"","keywords":"Computer science; Generalization; Function (biology); Theoretical computer science; Mathematics","score_opus":0.02730523446569865,"score_gpt":0.25464198189135845,"score_spread":0.2273367474256598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598134248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15009159,0.0061596255,0.73378986,0.012895107,0.00045365372,0.0002851632,0.0018167985,0.00040583394,0.09410243],"genre_scores_gemma":[0.90487826,0.004670074,0.06393779,0.0008198143,0.0011865275,0.0004924095,0.00083939685,0.00030099356,0.022874676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99333465,0.0025839978,0.00030584834,0.0008579611,0.0018512034,0.0010663047],"domain_scores_gemma":[0.955647,0.036446262,0.0016414399,0.0037107123,0.0017600661,0.0007945566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057505383,0.0015185103,0.0028424258,0.0015991924,0.0017404931,0.0070577976,0.003126453,0.0028413988,0.010180502],"category_scores_gemma":[0.026249742,0.0009591386,0.002087549,0.0022996627,0.00439224,0.014685387,0.0037864882,0.006611399,0.0011782096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001684589,0.000051928073,0.00035223874,0.00017059977,0.000040868887,0.00010557261,0.00017485708,0.024657082,0.00056724844,0.9558016,0.004381174,0.013528322],"study_design_scores_gemma":[0.00002435283,0.000027447475,0.00024683747,0.00003929435,0.000022584289,0.00013709847,0.000045023924,0.095529005,0.00032967186,0.9024151,0.0011559193,0.000027684493],"about_ca_topic_score_codex":0.0014970782,"about_ca_topic_score_gemma":0.0009872881,"teacher_disagreement_score":0.010180502,"about_ca_system_score_codex":0.0055317665,"about_ca_system_score_gemma":0.0034100423,"threshold_uncertainty_score":0.04013604},"labels":[],"label_agreement":null},{"id":"W2598505148","doi":"","title":"RoboCup 2009: Robot Soccer World Cup XIII - Preface","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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 Manitoba","funders":"","keywords":"Artificial intelligence; Computer science","score_opus":0.010538247656036805,"score_gpt":0.23744589472057914,"score_spread":0.22690764706454233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598505148","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.009162912,0.049804658,0.045181494,0.027786406,0.50477386,0.0011126061,0.010389357,0.0047030305,0.34708562],"genre_scores_gemma":[0.019738564,0.021468438,0.00583743,0.0020116712,0.053070936,0.0004279188,0.014835184,0.0028694705,0.8797403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995123,0.00004677672,0.000028082513,0.00014248047,0.00020424747,0.00006608381],"domain_scores_gemma":[0.99683446,0.00015468348,0.00008272681,0.00013455075,0.0018147703,0.0009787678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003299,0.002822947,0.00166869,0.002008333,0.0016407697,0.004790368,0.0014529362,0.0012517268,0.1617676],"category_scores_gemma":[0.0024369843,0.0004840357,0.00077241525,0.001978694,0.00035729137,0.0023382218,0.0023568952,0.0027261933,0.14163584],"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.00013645881,0.00009442648,0.00019091417,0.00018870416,0.000007967626,0.000060348855,0.000028282162,0.00073401077,0.0006394781,0.0009493234,0.8983547,0.0986153],"study_design_scores_gemma":[0.000037926926,0.000245574,0.0020391874,0.000388755,0.000014265468,0.0001639951,0.00014949533,0.0017752792,0.00128418,0.0022749766,0.99158645,0.000039988274],"about_ca_topic_score_codex":0.004090569,"about_ca_topic_score_gemma":0.0064203963,"teacher_disagreement_score":0.1617676,"about_ca_system_score_codex":0.0019031959,"about_ca_system_score_gemma":0.0015546349,"threshold_uncertainty_score":0.54116654},"labels":[],"label_agreement":null},{"id":"W2598672795","doi":"10.1007/978-3-662-54494-5_2","title":"Bordeaux: A Tool for Thinking Outside the Box","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Negation; Extension (predicate logic); Meaning (existential); Programming language; Algorithm; Theoretical computer science","score_opus":0.02714208637281054,"score_gpt":0.28431637315416347,"score_spread":0.25717428678135296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598672795","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.0026416786,0.0022331004,0.7622902,0.0019164965,0.0013490843,0.000097306925,0.0008077193,0.078929596,0.14973477],"genre_scores_gemma":[0.059244193,0.0020435352,0.6856302,0.0012723939,0.00042371103,0.00026029974,0.001999854,0.036759052,0.21236676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906725,0.00027693488,0.000047156143,0.00017982093,0.00032444563,0.000104458966],"domain_scores_gemma":[0.99884254,0.00063123327,0.000038893566,0.00017445274,0.0001934704,0.00011937841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177694,0.0014641316,0.0007626488,0.0020809537,0.0012738962,0.0054395874,0.0017472483,0.0017244772,0.08172629],"category_scores_gemma":[0.0035816738,0.0011596539,0.0014234667,0.000996461,0.001388504,0.0054334947,0.0024733678,0.003013876,0.028938867],"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.00028376988,0.000057902445,0.00037508138,0.000479057,0.000036850128,0.00040064825,0.0016023722,0.0023419703,0.0067570363,0.4127224,0.23551275,0.3394301],"study_design_scores_gemma":[0.000036556947,0.00002544766,0.00021462426,0.00021671911,0.000026750991,0.0004672417,0.00017470874,0.00734943,0.0044215797,0.07230329,0.91469777,0.00006601043],"about_ca_topic_score_codex":0.0035261803,"about_ca_topic_score_gemma":0.0049212985,"teacher_disagreement_score":0.08172629,"about_ca_system_score_codex":0.0011775251,"about_ca_system_score_gemma":0.0010406332,"threshold_uncertainty_score":0.27340168},"labels":[],"label_agreement":null},{"id":"W2598705408","doi":"10.1007/978-3-319-55792-2_4","title":"Focusing Learning-Based Testing Away from Known Weaknesses","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Strengths and weaknesses; Similarity (geometry); Artificial intelligence; Adversary; Machine learning; Extension (predicate logic); Test (biology); Measure (data warehouse); Similarity measure; Theoretical computer science; Data mining; Computer security; Programming language","score_opus":0.03557945597157287,"score_gpt":0.27079144967597146,"score_spread":0.2352119937043986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598705408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025187125,0.0011015331,0.9374942,0.0008936792,0.00013398536,0.00011178104,0.00008097271,0.0053757466,0.029620873],"genre_scores_gemma":[0.42484316,0.0011017419,0.5446817,0.0008619965,0.00018281132,0.00010169279,0.00050895906,0.00173571,0.025982216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766195,0.0005434603,0.00011151224,0.00046091853,0.0010380271,0.00018413477],"domain_scores_gemma":[0.9848564,0.009171662,0.0008090008,0.0028453916,0.001923031,0.0003944139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023055344,0.0017512427,0.0008582252,0.0014135817,0.00038705487,0.0017674329,0.0029703039,0.0012397977,0.008928966],"category_scores_gemma":[0.014353725,0.00050070893,0.0008147601,0.00094113755,0.0009666889,0.0046131816,0.0028068668,0.0031109198,0.0033735684],"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.0001338403,0.00027574433,0.0028786857,0.00040338983,0.00005184948,0.00020146088,0.0004263912,0.0153774535,0.019267093,0.02457377,0.0073154755,0.92909485],"study_design_scores_gemma":[0.00010571138,0.0007721375,0.006927392,0.0010832053,0.0003563118,0.002823532,0.00069291884,0.43442664,0.11480739,0.37472492,0.06314933,0.00013045473],"about_ca_topic_score_codex":0.0005854409,"about_ca_topic_score_gemma":0.0012507876,"teacher_disagreement_score":0.008928966,"about_ca_system_score_codex":0.00063700357,"about_ca_system_score_gemma":0.0010960584,"threshold_uncertainty_score":0.029870331},"labels":[],"label_agreement":null},{"id":"W2598805461","doi":"10.1007/978-3-319-11433-0_6","title":"Bayesian Network Inference Using Marginal Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Precomputation; Computer science; Bayesian network; Variable elimination; Inference; Bayesian inference; Computation; Bayesian probability; Algorithm; Data mining; Artificial intelligence","score_opus":0.029365374105461434,"score_gpt":0.26657441698422524,"score_spread":0.2372090428787638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598805461","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.0006263987,0.0004009621,0.99655676,0.00014490883,0.000039671144,0.000010521896,0.00007670455,0.00014886903,0.0019951146],"genre_scores_gemma":[0.08343887,0.0034720916,0.89774525,0.00024660354,0.0003847832,0.00023340783,0.0012025444,0.00048448425,0.012791867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980015,0.0011131753,0.000079883364,0.0003087134,0.00043792496,0.000058835434],"domain_scores_gemma":[0.9903301,0.008281294,0.00021218687,0.0005949033,0.00047944265,0.00010214623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273001,0.0010111482,0.0016542036,0.0018904462,0.00062560337,0.0020067196,0.0025450762,0.0015075734,0.009858393],"category_scores_gemma":[0.02252958,0.0015482508,0.001653347,0.002424198,0.0013983892,0.004985481,0.002177988,0.004459897,0.0025790734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006917412,0.00005223041,0.00058166607,0.00026356752,0.0001618948,0.00009209931,0.00019027684,0.26408178,0.0006440277,0.51024836,0.010460162,0.21315476],"study_design_scores_gemma":[0.00000803126,0.000005018783,0.000119987744,0.000040236842,0.000021100548,0.00004287583,0.000010317604,0.4814859,0.00022602844,0.513704,0.004322241,0.000014225699],"about_ca_topic_score_codex":0.004017976,"about_ca_topic_score_gemma":0.0039987983,"teacher_disagreement_score":0.009858393,"about_ca_system_score_codex":0.0012221052,"about_ca_system_score_gemma":0.0009699298,"threshold_uncertainty_score":0.032979608},"labels":[],"label_agreement":null},{"id":"W2598880527","doi":"10.1007/978-3-319-55911-7_48","title":"Fast Searching on Cartesian Products of Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cartesian product; Upper and lower bounds; Eulerian path; Hypercube; Computer science; Cartesian coordinate system; Graph; Lattice graph; Product (mathematics); Combinatorics; Path (computing); Search tree; Discrete mathematics; Search algorithm; Theoretical computer science; Mathematics; Algorithm; Parallel computing; Line graph; Voltage graph; Applied mathematics; Geometry","score_opus":0.027269901835308544,"score_gpt":0.27199713060153935,"score_spread":0.24472722876623082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598880527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11450531,0.0025082116,0.8336662,0.0005007022,0.0002139461,0.00017595419,0.000805112,0.0030155184,0.044609085],"genre_scores_gemma":[0.20996045,0.0013906276,0.76773417,0.00013300571,0.00006945437,0.00013924608,0.0013924869,0.0008583184,0.018322278],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935836,0.00018963327,0.00003366521,0.00014282037,0.000204019,0.00007139598],"domain_scores_gemma":[0.9978834,0.0013172806,0.000095117844,0.0003860257,0.00023259767,0.000085586675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182717,0.0009905782,0.0013326342,0.0013229116,0.000668087,0.001343845,0.001558596,0.00073722063,0.013177033],"category_scores_gemma":[0.004298588,0.000827,0.0010260904,0.0024742808,0.001112458,0.0036389453,0.0021556804,0.0013780253,0.0028628674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000518335,0.00012237379,0.001184784,0.0013955169,0.0001151923,0.0002018032,0.0006069983,0.09404514,0.010098588,0.37269807,0.035578366,0.4834348],"study_design_scores_gemma":[0.00009477584,0.00020857259,0.00053239445,0.00015856503,0.000062447834,0.00042057832,0.00019067769,0.2992914,0.0048238006,0.66727805,0.026903609,0.000035153284],"about_ca_topic_score_codex":0.00188744,"about_ca_topic_score_gemma":0.0027355952,"teacher_disagreement_score":0.013177033,"about_ca_system_score_codex":0.0007287251,"about_ca_system_score_gemma":0.0006167858,"threshold_uncertainty_score":0.04408157},"labels":[],"label_agreement":null},{"id":"W2600455727","doi":"10.1007/978-3-319-56148-6_30","title":"Back Pain During Pregnancy and Its Relationship to Anthropometric Biomechanical Parameters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Pregnancy-related medical research","field":"Medicine","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":"Queen's University","funders":"","keywords":"Pregnancy; Anthropometry; Body mass index; Medicine; Parity (physics); Trunk; Oswestry Disability Index; Physical therapy; Low back pain; Correlation; Back pain; Obstetrics; Mathematics; Internal medicine","score_opus":0.06229151217944374,"score_gpt":0.33625364703178895,"score_spread":0.2739621348523452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600455727","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.9424486,0.039720617,0.0014876772,0.00088886864,0.00017295837,0.000034945133,0.0012351698,0.000028341725,0.013982761],"genre_scores_gemma":[0.9818155,0.013429031,0.0008328368,0.00008120012,0.00019530143,0.000034522196,0.00041733458,0.0000072281346,0.0031870091],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99980146,0.0000620031,0.000020368681,0.0000339372,0.000049643604,0.00003253885],"domain_scores_gemma":[0.9991854,0.00045012997,0.00022268751,0.000021705719,0.000057088437,0.00006295439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025603012,0.0003433679,0.0003136598,0.0007674719,0.0002466278,0.0006078155,0.00029973118,0.0004949001,0.002639365],"category_scores_gemma":[0.002002362,0.00022940912,0.00039205432,0.0012519552,0.00023030747,0.00025836434,0.000332293,0.0008248778,0.00039705032],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044685524,0.0003800652,0.91386586,0.0002632424,0.00020020735,0.002335507,0.00070975063,0.000489406,0.0030576123,0.000416106,0.0008460848,0.076989286],"study_design_scores_gemma":[0.0000018993933,0.00015105422,0.9973456,0.00004031688,0.00004404271,0.001472958,0.0002284959,0.00013501728,0.00006721805,0.00011141418,0.0003959601,0.000005989896],"about_ca_topic_score_codex":0.0022073677,"about_ca_topic_score_gemma":0.002864097,"teacher_disagreement_score":0.002639365,"about_ca_system_score_codex":0.00022277779,"about_ca_system_score_gemma":0.00020849289,"threshold_uncertainty_score":0.008829534},"labels":[],"label_agreement":null},{"id":"W2600494616","doi":"10.1007/978-3-319-56154-7_27","title":"Nonlinear Control and Simulation of a Dielectric Elastomer Actuator-Based Compression Bandage on Flexible Human Calf","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dielectric materials and actuators","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Controller (irrigation); Bandage; Compression (physics); Nonlinear system; Compression Bandage; Actuator; Dielectric elastomers; Control theory (sociology); Materials science; Artificial intelligence; Surgery; Medicine; Control (management); Composite material","score_opus":0.011186966490415668,"score_gpt":0.24805337613280992,"score_spread":0.23686640964239425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600494616","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.8839177,0.00026174678,0.08734942,0.00033767504,0.00007045491,0.000057086116,0.000244901,0.00026788775,0.02749299],"genre_scores_gemma":[0.9937104,0.000059778584,0.0021895007,0.000020339801,0.0000036651907,0.000019849425,0.000038187354,0.00000888753,0.0039494904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995184,0.000010233451,0.0000019547056,0.000009912029,0.000012975276,0.000013080372],"domain_scores_gemma":[0.9998702,0.00007632493,0.000012519615,0.000010969297,0.000016884009,0.000013103037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011806063,0.000224849,0.00028674773,0.00014997448,0.0002556403,0.00029093676,0.0004479181,0.00082696136,0.0030790956],"category_scores_gemma":[0.00032777956,0.00013316695,0.0002970627,0.00012230981,0.00034601765,0.00020250677,0.00033354576,0.00023261762,0.00020843485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015092109,0.00005018496,0.00062034745,0.000052261796,0.000014004139,0.00018851431,0.00006252157,0.97794557,0.014982991,0.0010903779,0.00022335429,0.0046188263],"study_design_scores_gemma":[0.0000054002985,0.00004488387,0.00031533808,0.0000019333743,0.0000025820289,0.000009857328,0.000011963753,0.99833506,0.0010629089,0.000093986164,0.000113877584,0.0000022486452],"about_ca_topic_score_codex":0.0068842503,"about_ca_topic_score_gemma":0.0036171747,"teacher_disagreement_score":0.0068842503,"about_ca_system_score_codex":0.00021860028,"about_ca_system_score_gemma":0.00024892428,"threshold_uncertainty_score":0.013688326},"labels":[],"label_agreement":null},{"id":"W2601448663","doi":"10.1007/978-3-319-68705-6_29","title":"On Strongly Chordal Graphs That Are Not Leaf Powers","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Graph; Tree (set theory); Treewidth; Discrete mathematics; Pathwidth; Computer science; Line graph; 1-planar graph","score_opus":0.017459307098969427,"score_gpt":0.2463024197857206,"score_spread":0.22884311268675117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601448663","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.30566117,0.002768106,0.2547807,0.0039885747,0.00089742464,0.00027406475,0.0014197045,0.0007292049,0.429481],"genre_scores_gemma":[0.77492,0.0031467166,0.07548385,0.0012923143,0.0007158288,0.00026939187,0.0024778487,0.0010091781,0.14068492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993481,0.00013211726,0.00003042095,0.00017680894,0.00017279324,0.00013981151],"domain_scores_gemma":[0.99514055,0.0032753372,0.00027269174,0.0005786835,0.000366315,0.00036633108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057867443,0.0008827935,0.0011334108,0.0012867337,0.0021629906,0.0028063154,0.0014758869,0.0012797797,0.013835489],"category_scores_gemma":[0.006402659,0.000844172,0.0010048465,0.0017868988,0.0027338215,0.0070145223,0.0029223212,0.0038566678,0.0028289722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011283902,0.000030710948,0.00043070136,0.00020744755,0.000016583579,0.00020999016,0.00048260376,0.003377644,0.0019386746,0.96388584,0.00787162,0.021435238],"study_design_scores_gemma":[0.000013702072,0.000010305982,0.00014858763,0.00003180979,0.000008946379,0.00012404227,0.00012317127,0.0038557374,0.00041163765,0.98937595,0.0058895526,0.000006552356],"about_ca_topic_score_codex":0.0012940206,"about_ca_topic_score_gemma":0.0018086496,"teacher_disagreement_score":0.013835489,"about_ca_system_score_codex":0.0012465465,"about_ca_system_score_gemma":0.00047173773,"threshold_uncertainty_score":0.046284318},"labels":[],"label_agreement":null},{"id":"W2601691888","doi":"10.1007/978-3-319-56148-6_22","title":"Investigation of the Feasibility of Strain Gages as Pressure Sensors for Force Myography","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Muscle activation and electromyography studies","field":"Engineering","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":"","keywords":"Electrical impedance myography; Strain gauge; Wearable computer; Computer science; Gesture; Pressure sensor; Artificial intelligence; Gesture recognition; Simulation; Embedded system; Electrical engineering; Mechanical engineering; Engineering; Medicine","score_opus":0.03021641326833361,"score_gpt":0.25372971419708507,"score_spread":0.22351330092875146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601691888","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.83274007,0.016826859,0.13496992,0.0005573739,0.00030713144,0.00031838118,0.00025447938,0.00021481859,0.013810955],"genre_scores_gemma":[0.9164961,0.0047657383,0.07025273,0.00013229107,0.000075947144,0.00009028292,0.00017838264,0.00005201985,0.007956533],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992478,0.00029187693,0.000026185178,0.00014510818,0.0002349286,0.00005412486],"domain_scores_gemma":[0.9978842,0.0016706983,0.00005527551,0.00010472925,0.00023336819,0.000051665276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291363,0.0004948711,0.0002576097,0.0004752122,0.0001902344,0.0006977524,0.00073515205,0.0010432547,0.0030466225],"category_scores_gemma":[0.0033666557,0.00042244224,0.00025054146,0.00024574174,0.0005811221,0.0010838815,0.0005063494,0.00038921036,0.0006781811],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028519966,0.00042748262,0.007774135,0.00040667682,0.00005048759,0.0006437646,0.00033419766,0.0011678926,0.8215393,0.0023708867,0.00047187463,0.16196127],"study_design_scores_gemma":[0.00029401854,0.016139401,0.06058051,0.00029019624,0.00034450451,0.0056265746,0.0009044609,0.04407517,0.8500779,0.0028227728,0.018718623,0.00012583552],"about_ca_topic_score_codex":0.00038326986,"about_ca_topic_score_gemma":0.00042104497,"teacher_disagreement_score":0.0030466225,"about_ca_system_score_codex":0.00013124576,"about_ca_system_score_gemma":0.00027795357,"threshold_uncertainty_score":0.010191977},"labels":[],"label_agreement":null},{"id":"W2602339103","doi":"10.1007/978-3-319-55750-2_4","title":"Melody Retrieval and Classification Using Biologically-Inspired Techniques","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Search engine indexing; Melody; Similarity (geometry); Hidden Markov model; Music information retrieval; Pairwise comparison; Artificial intelligence; Salient; Context (archaeology); Smith–Waterman algorithm; Pattern recognition (psychology); Machine learning; Sequence alignment","score_opus":0.056189584375516105,"score_gpt":0.29412310487825233,"score_spread":0.23793352050273622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602339103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039184734,0.0021425823,0.94766444,0.0002856474,0.00026289784,0.0001403295,0.00018748174,0.0016420246,0.008489766],"genre_scores_gemma":[0.3263027,0.0016698675,0.6552775,0.00025864353,0.00027874677,0.00016613882,0.00088536047,0.00027059298,0.014890488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982613,0.000017005008,0.000011977692,0.000057589557,0.000058860536,0.000028469203],"domain_scores_gemma":[0.9998301,0.000058866946,0.000021048469,0.000031677813,0.00004507042,0.000013131773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003426614,0.00067856157,0.0007513164,0.0012013899,0.0004110078,0.0014655559,0.0011399504,0.0010252871,0.0039528627],"category_scores_gemma":[0.00073485187,0.00025456893,0.0011070052,0.0010910284,0.00038249895,0.0009321296,0.0006382485,0.00071500824,0.0018301639],"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.00015511356,0.00014857581,0.0006669522,0.00025454554,0.000101729456,0.0001412794,0.00009330876,0.037932783,0.2444976,0.007827951,0.0034844335,0.70469576],"study_design_scores_gemma":[0.000029924606,0.00015464223,0.0016529784,0.000036385038,0.00008507874,0.00028157086,0.000084081454,0.91874325,0.060774654,0.011389318,0.0067262114,0.000041961874],"about_ca_topic_score_codex":0.0011105114,"about_ca_topic_score_gemma":0.0016716325,"teacher_disagreement_score":0.0039528627,"about_ca_system_score_codex":0.00042937955,"about_ca_system_score_gemma":0.00030911688,"threshold_uncertainty_score":0.013223648},"labels":[],"label_agreement":null},{"id":"W2602371412","doi":"10.1007/978-3-662-54494-5","title":"Fundamental Approaches to Software Engineering","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Software engineering; Software; Programming language","score_opus":0.054028462567840774,"score_gpt":0.25564723177755116,"score_spread":0.2016187692097104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602371412","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034784374,0.027919622,0.33085513,0.00767969,0.0024077906,0.00008418971,0.0001600968,0.0005582771,0.62685674],"genre_scores_gemma":[0.17157684,0.05770146,0.21156158,0.002825169,0.0063905013,0.0005292781,0.00059164676,0.00079822936,0.54802525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991986,0.00014525569,0.000037347534,0.00010697488,0.0004552396,0.000056560442],"domain_scores_gemma":[0.99941254,0.00025932523,0.000034204382,0.00012557826,0.000120724944,0.000047643225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071288645,0.001184997,0.00069551775,0.0016135573,0.0011468672,0.0031376667,0.0013518983,0.0011807077,0.012706929],"category_scores_gemma":[0.0015994925,0.00055104867,0.0007715483,0.0015941566,0.004685568,0.004570613,0.0020078276,0.0045715184,0.006495173],"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.0000018093903,0.000009929814,0.000015177894,0.000060234917,0.0000023366197,0.0000069411967,0.00014314438,0.0003753261,0.00024097667,0.9713766,0.007896097,0.019871408],"study_design_scores_gemma":[0.0000026017888,0.000006041223,0.000028690089,0.00005783234,0.0000022914987,0.00002877959,0.000026419764,0.0006559406,0.00016978137,0.8913161,0.10770237,0.0000030802391],"about_ca_topic_score_codex":0.0004580046,"about_ca_topic_score_gemma":0.0006569627,"teacher_disagreement_score":0.012706929,"about_ca_system_score_codex":0.002135965,"about_ca_system_score_gemma":0.0018050496,"threshold_uncertainty_score":0.04250896},"labels":[],"label_agreement":null},{"id":"W260268286","doi":"10.1007/978-3-540-45077-1_29","title":"Non-uniform Depth of Polynomial Time and Space Simulations","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"DTIME; Connection (principal bundle); Computation; Time complexity; Polynomial; Mathematics; PSPACE; Electronic circuit; Space (punctuation); Constant (computer programming); Spacetime; Linear space; Space time; Discrete mathematics; Turing machine; Computer science; Algorithm; Mathematical analysis; Computational complexity theory; Geometry; Physics; Quantum mechanics","score_opus":0.012779228881794445,"score_gpt":0.24684313871894586,"score_spread":0.23406390983715142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W260268286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4350378,0.0020495204,0.48508433,0.0076084435,0.00023629025,0.00024897506,0.0015510834,0.0026143063,0.06556921],"genre_scores_gemma":[0.9490064,0.0005098142,0.037047118,0.0007366397,0.00022538604,0.00018947326,0.00048689658,0.000769776,0.011028557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99363166,0.0017967444,0.00029681504,0.0013549812,0.001195705,0.0017240251],"domain_scores_gemma":[0.95123464,0.034542527,0.0029144287,0.006752877,0.0014968481,0.003058711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004408979,0.0015643314,0.003508763,0.0019158672,0.0025911,0.0057017403,0.005289479,0.0034611728,0.0164562],"category_scores_gemma":[0.043744966,0.0023993351,0.002820229,0.0024355564,0.006333127,0.023083005,0.0081982985,0.007697595,0.0011842573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008903808,0.00010842217,0.00139022,0.00021974125,0.00008271404,0.000093147995,0.00044573186,0.061995916,0.0018738185,0.91764605,0.0037162513,0.011537597],"study_design_scores_gemma":[0.00007042151,0.00003754754,0.0002463291,0.000024023435,0.00004771006,0.000081626604,0.00007266913,0.08911298,0.0012357392,0.9075677,0.0014811254,0.000022271759],"about_ca_topic_score_codex":0.0025065015,"about_ca_topic_score_gemma":0.0032863254,"teacher_disagreement_score":0.0164562,"about_ca_system_score_codex":0.005782568,"about_ca_system_score_gemma":0.003194687,"threshold_uncertainty_score":0.055051446},"labels":[],"label_agreement":null},{"id":"W2602695990","doi":"10.1007/978-3-319-56148-6_25","title":"Elbow Orthosis for Tremor Suppression – A Torque Based Input Case","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Computer science; Torque; Wearable computer; Motion (physics); Reduction (mathematics); Physical medicine and rehabilitation; Work (physics); Elbow; Component (thermodynamics); Simulation; Control theory (sociology); Artificial intelligence; Control (management); Engineering; Medicine; Mathematics; Embedded system; Physics","score_opus":0.033033125399805206,"score_gpt":0.29767894913115256,"score_spread":0.2646458237313474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602695990","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.57703143,0.011120522,0.17951569,0.02987617,0.0017928968,0.00045912928,0.0010284646,0.002940276,0.19623551],"genre_scores_gemma":[0.9672368,0.0014722171,0.012697262,0.0017321169,0.00051270437,0.000053670527,0.00012787677,0.00018129496,0.015986085],"study_design_codex":"case_report","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995117,0.00005466028,0.000072260365,0.00006817246,0.00019293153,0.000100297286],"domain_scores_gemma":[0.9993414,0.00035634852,0.00006972609,0.0000766242,0.000040221155,0.00011567734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002735607,0.0016283402,0.00085488305,0.001428711,0.0011131581,0.0017598555,0.0014808577,0.0068125725,0.0061289445],"category_scores_gemma":[0.002076954,0.00047825553,0.00080428243,0.0010898815,0.0016006221,0.00114124,0.00103641,0.002569555,0.0015732568],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020325946,0.00016804758,0.0011664038,0.00012758444,0.000018866665,0.9679483,0.00025850677,0.0008340125,0.005846734,0.0020466393,0.0013583838,0.020023303],"study_design_scores_gemma":[0.00004047741,0.00011196997,0.0008186036,0.000042855212,0.000014058833,0.9904998,0.00010965274,0.0022926866,0.0029690585,0.0013391845,0.0017458622,0.000015790227],"about_ca_topic_score_codex":0.0008968418,"about_ca_topic_score_gemma":0.0016092943,"teacher_disagreement_score":0.0068125725,"about_ca_system_score_codex":0.0007210304,"about_ca_system_score_gemma":0.00044158832,"threshold_uncertainty_score":0.020503342},"labels":[],"label_agreement":null},{"id":"W2603022255","doi":"10.1007/978-3-662-54580-5_5","title":"Rewriting-Based Runtime Verification for Alternation-Free HyperLTL","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Rewriting; TRACE (psycholinguistics); Alternation (linguistics); Programming language; Runtime verification; Theoretical computer science; Temporal logic; Information flow; Formal verification","score_opus":0.031596157245524385,"score_gpt":0.278020581336785,"score_spread":0.24642442409126059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603022255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02036628,0.00028121567,0.9454259,0.0003909323,0.0002770764,0.00016616743,0.00034438627,0.020468527,0.012279512],"genre_scores_gemma":[0.6131123,0.00028215587,0.36227015,0.00072267174,0.0002453843,0.0003432064,0.0016190886,0.006382168,0.015022954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938314,0.001512744,0.00048553557,0.0010180047,0.002369099,0.00078314816],"domain_scores_gemma":[0.99155617,0.0039756894,0.00035686465,0.002702086,0.001249137,0.0001599905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027377647,0.0009569141,0.0010294778,0.0010851807,0.0010576074,0.0032945275,0.0025194664,0.0012842261,0.012054119],"category_scores_gemma":[0.009798545,0.0008829512,0.0021997478,0.0007810426,0.0031736027,0.0048925597,0.0048468495,0.0034381172,0.0049072285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011244888,0.00041001203,0.0022344412,0.0012129808,0.00019039275,0.0012142493,0.0015504868,0.07020931,0.082962304,0.4971173,0.019474834,0.3222992],"study_design_scores_gemma":[0.0002192508,0.00017644065,0.0004088105,0.00015122932,0.00018105409,0.00037705846,0.00016768144,0.3749566,0.09871762,0.5022142,0.022296831,0.00013326494],"about_ca_topic_score_codex":0.0015335184,"about_ca_topic_score_gemma":0.0021864218,"teacher_disagreement_score":0.012054119,"about_ca_system_score_codex":0.0016441928,"about_ca_system_score_gemma":0.0019255063,"threshold_uncertainty_score":0.040325046},"labels":[],"label_agreement":null},{"id":"W2603258711","doi":"10.1007/978-3-319-55998-8_3","title":"Heterogeneous Data Integration Using Web of Data Technologies","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Yukon University","funders":"","keywords":"Computer science; SPARQL; RDF; Geospatial analysis; Information retrieval; Semantic Web; Linked data; World Wide Web; Database; Data science; Geography","score_opus":0.1141619639267932,"score_gpt":0.3259662262120782,"score_spread":0.211804262285285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603258711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063170944,0.010097485,0.95729494,0.0012473325,0.0005543237,0.00018432587,0.0004376894,0.0031092092,0.02075774],"genre_scores_gemma":[0.096818484,0.015547597,0.8617327,0.0013302262,0.00046508762,0.0003682043,0.0055745747,0.0015046953,0.016658492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964437,0.0006441526,0.00053606246,0.0004584193,0.001759975,0.00015775839],"domain_scores_gemma":[0.99772686,0.0008976967,0.0001146328,0.0007940469,0.00035505436,0.0001117597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033287862,0.0009981437,0.0016077169,0.006384508,0.000989409,0.009243229,0.0022846696,0.00170652,0.003401754],"category_scores_gemma":[0.0055385963,0.0010194839,0.0018943703,0.010468212,0.0012114858,0.01375898,0.007202914,0.0025351632,0.0019011707],"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.000115308736,0.00018843939,0.0014645084,0.0011364695,0.0004727333,0.0010332764,0.0009062938,0.0066459235,0.013531622,0.32948622,0.022538973,0.6224803],"study_design_scores_gemma":[0.000033358217,0.000047177098,0.0010533654,0.0009618164,0.00034597577,0.0013506209,0.0005833652,0.0640773,0.02818085,0.5440958,0.3591647,0.00010569844],"about_ca_topic_score_codex":0.0012223421,"about_ca_topic_score_gemma":0.0011314513,"teacher_disagreement_score":0.009243229,"about_ca_system_score_codex":0.0009604109,"about_ca_system_score_gemma":0.0011872273,"threshold_uncertainty_score":0.01760453},"labels":[],"label_agreement":null},{"id":"W2604314403","doi":"10.1007/978-3-319-93417-4_38","title":"Modeling Relational Data with Graph Convolutional Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":5060,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Computer science; Inference; Predicate (mathematical logic); Encoder; Relational database; Convolutional neural network; Graph; Information retrieval; Artificial intelligence; Knowledge base; Data mining; Theoretical computer science; Programming language","score_opus":0.03535772873792242,"score_gpt":0.25225338356626403,"score_spread":0.2168956548283416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604314403","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.015398152,0.0009554745,0.9781728,0.0005188012,0.000060560742,0.00003558462,0.0014592406,0.001947594,0.0014518682],"genre_scores_gemma":[0.44129217,0.002840374,0.53327006,0.00044578858,0.00018017611,0.0001815863,0.010554966,0.0007453641,0.0104895085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950624,0.00011930506,0.000030810963,0.00017407755,0.00012289001,0.00004661875],"domain_scores_gemma":[0.9988059,0.0006763064,0.00010362824,0.00025097883,0.00012193703,0.000041369964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085971324,0.00089837407,0.00077969546,0.00124532,0.00029817328,0.0017093713,0.0016906913,0.0009444989,0.0033052298],"category_scores_gemma":[0.004476014,0.00085283443,0.0013675608,0.002115475,0.0005066765,0.0039471295,0.0012971429,0.0022781044,0.0014065866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015381299,0.00014252316,0.0038270596,0.00031094998,0.00024651407,0.00018032757,0.0002028187,0.5802531,0.0036632223,0.09073851,0.013441939,0.30683914],"study_design_scores_gemma":[0.000002577949,0.0000080529,0.00018282716,0.000014445801,0.000014813611,0.00002177385,0.000010489868,0.95098764,0.00045027686,0.04679485,0.0015070473,0.0000052048545],"about_ca_topic_score_codex":0.012269726,"about_ca_topic_score_gemma":0.024551328,"teacher_disagreement_score":0.012269726,"about_ca_system_score_codex":0.0012198746,"about_ca_system_score_gemma":0.00071828056,"threshold_uncertainty_score":0.024396658},"labels":[],"label_agreement":null},{"id":"W2604424424","doi":"10.1007/978-3-319-61273-7_25","title":"Multi-prover Interactive Proofs: Unsound Foundations","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Concordia University; McGill University","funders":"","keywords":"Gas meter prover; Soundness; Mathematical proof; Computer science; Isolation (microbiology); Automated theorem proving; Programming language; Calculus (dental); Theoretical computer science; Mathematics; Medicine","score_opus":0.03908127095366837,"score_gpt":0.2964542972044322,"score_spread":0.25737302625076386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604424424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008525512,0.010179652,0.87321615,0.004123516,0.00063060794,0.00007536104,0.00038426084,0.0017049431,0.10115997],"genre_scores_gemma":[0.4847254,0.011802236,0.45086074,0.0025872672,0.0023274582,0.00043976787,0.0011580645,0.0018186476,0.044280373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940969,0.0015136807,0.00032741477,0.0011186468,0.0023819841,0.00056134304],"domain_scores_gemma":[0.9748839,0.019111231,0.00056745036,0.003238245,0.0017799106,0.0004191949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057162535,0.0018407537,0.0015299174,0.0028905745,0.002653342,0.008777797,0.005246152,0.0031209397,0.01859787],"category_scores_gemma":[0.021365209,0.0029283161,0.002246684,0.0030814502,0.007023555,0.020591652,0.008074096,0.015144065,0.0060862447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039926428,0.000042004183,0.00011044203,0.00023333779,0.000018480581,0.000051883133,0.0002434562,0.0014218176,0.00034282048,0.9584205,0.004625383,0.03444996],"study_design_scores_gemma":[0.000013938622,0.000008119927,0.000054292734,0.000087499815,0.000016186825,0.00007943392,0.00002420584,0.0055819745,0.00094668934,0.98424315,0.008929208,0.000015384421],"about_ca_topic_score_codex":0.00086546666,"about_ca_topic_score_gemma":0.00088562095,"teacher_disagreement_score":0.01859787,"about_ca_system_score_codex":0.0034254799,"about_ca_system_score_gemma":0.0021486292,"threshold_uncertainty_score":0.062216103},"labels":[],"label_agreement":null},{"id":"W2604763720","doi":"10.1007/978-3-319-70972-7_9","title":"A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":96,"is_retracted":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":"Random oracle; Computer science; Scheme (mathematics); Digital signature; Mathematical proof; Oracle; Theoretical computer science; Key (lock); Elliptic Curve Digital Signature Algorithm; Quantum computer; Schnorr signature; Algorithm; Topology (electrical circuits); Quantum; Public-key cryptography; Mathematics; Blind signature; Elliptic curve cryptography; Programming language; Quantum mechanics; Computer network; Physics; Geometry; Operating system","score_opus":0.009965248540184131,"score_gpt":0.22313860050535797,"score_spread":0.21317335196517384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604763720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3765179,0.0014037837,0.47003815,0.0021081532,0.0012652115,0.00040395863,0.0009200946,0.002395143,0.1449477],"genre_scores_gemma":[0.8953104,0.00061628415,0.071322136,0.00028761645,0.00032566488,0.000106661646,0.00038688042,0.0002234033,0.03142097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927634,0.00013877822,0.00005347128,0.0001365075,0.00026408845,0.0001307769],"domain_scores_gemma":[0.9993363,0.000111802765,0.00006440321,0.00030615838,0.00011665364,0.000064626554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055981765,0.00054469716,0.00086759205,0.0006103506,0.0011714592,0.002106101,0.00071615115,0.0008452644,0.006426753],"category_scores_gemma":[0.0010233632,0.00026961433,0.0005709311,0.0009179324,0.0020436242,0.0031044893,0.0018058677,0.0018170617,0.002470521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022882679,0.00005110322,0.00013949627,0.00007877226,0.000010578481,0.00011853039,0.00017386107,0.0019607274,0.01073134,0.9555884,0.0022550968,0.028663125],"study_design_scores_gemma":[0.00014820605,0.00035246924,0.00050184963,0.000049691793,0.00005545,0.0007075365,0.00009798027,0.03334872,0.030477071,0.8872201,0.046936788,0.00010414004],"about_ca_topic_score_codex":0.00025303545,"about_ca_topic_score_gemma":0.00021604601,"teacher_disagreement_score":0.006426753,"about_ca_system_score_codex":0.00090551516,"about_ca_system_score_gemma":0.0010829922,"threshold_uncertainty_score":0.021499634},"labels":[],"label_agreement":null},{"id":"W2604780902","doi":"10.1007/978-3-319-55589-8_18","title":"On the Multi-output Filtering Model and Its Applications","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Distribution (mathematics); Algebraic number; Component (thermodynamics); Function (biology); Computer science; Cryptography; Algorithm; Boolean function; Discrete mathematics; Mathematics; Physics; Statistics","score_opus":0.0537975235883144,"score_gpt":0.298004775760789,"score_spread":0.24420725217247458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604780902","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.0034253844,0.0012823608,0.98300695,0.0005371871,0.00014619363,0.000010609125,0.0000621144,0.0001232285,0.011405988],"genre_scores_gemma":[0.60245407,0.008787302,0.2849385,0.0015251492,0.0015840142,0.00021022918,0.0005431723,0.00035628967,0.09960129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935263,0.00019586683,0.000031568252,0.00018646038,0.00016494506,0.000068490015],"domain_scores_gemma":[0.99835545,0.0010676247,0.0001195179,0.00022688971,0.0001844194,0.000046109337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131302,0.0011394346,0.0012984668,0.00068187615,0.0007316644,0.0022168495,0.0014447861,0.002809453,0.0077820458],"category_scores_gemma":[0.00361958,0.0004898326,0.0015831807,0.0013558128,0.0016184419,0.0030083763,0.0014849374,0.0029932912,0.00227775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007029106,0.00005439043,0.0003039545,0.00014166413,0.00005052129,0.00018858464,0.000133744,0.09007185,0.0027092993,0.8589932,0.0028962523,0.044386253],"study_design_scores_gemma":[0.0000100809975,0.00003356646,0.000114535105,0.000037150323,0.000022973747,0.000110272726,0.00001680247,0.4624037,0.0006002315,0.5325982,0.0040267385,0.000025638697],"about_ca_topic_score_codex":0.0022754474,"about_ca_topic_score_gemma":0.0016201225,"teacher_disagreement_score":0.0077820458,"about_ca_system_score_codex":0.0009931291,"about_ca_system_score_gemma":0.0005354066,"threshold_uncertainty_score":0.02603352},"labels":[],"label_agreement":null},{"id":"W26048122","doi":"10.1007/978-3-642-36763-2_16","title":"Planar Graphs as VPG-Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Bipartite graph; Chordal graph; Planar; Indifference graph; Outerplanar graph; 1-planar graph; Conjecture; Discrete mathematics; Graph; Pathwidth; Line graph; Computer science","score_opus":0.01420898461931548,"score_gpt":0.2364423834741364,"score_spread":0.22223339885482093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26048122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046174873,0.008543061,0.50666535,0.0017774255,0.001637331,0.00032962923,0.0017272037,0.0017982443,0.43134692],"genre_scores_gemma":[0.4000157,0.017235858,0.32203087,0.000916564,0.0009811858,0.00042454,0.0041168653,0.0020157024,0.2522627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977666,0.00004036489,0.000010917178,0.000047941216,0.000098494114,0.000025604979],"domain_scores_gemma":[0.99980086,0.0000537747,0.000019255926,0.000046031615,0.00005833376,0.000021742777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015532767,0.0008560699,0.00043755144,0.0017308136,0.0005740011,0.0023338287,0.0011185784,0.0006721766,0.014523897],"category_scores_gemma":[0.00083043746,0.00056862115,0.0005500962,0.0030059717,0.0010544951,0.0028329229,0.0012558061,0.0019904834,0.004600648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010257725,0.00000963444,0.000048245805,0.00013923582,0.0000058704,0.00005927989,0.00013668818,0.0036849624,0.0013420543,0.9165634,0.011959346,0.066040985],"study_design_scores_gemma":[0.0000059531067,0.000009149951,0.00009264269,0.000052292875,0.000009440348,0.00025694698,0.000083530394,0.0050844243,0.0008822316,0.8952485,0.09826581,0.000008959277],"about_ca_topic_score_codex":0.0006750839,"about_ca_topic_score_gemma":0.0009238101,"teacher_disagreement_score":0.014523897,"about_ca_system_score_codex":0.00079854537,"about_ca_system_score_gemma":0.0002751739,"threshold_uncertainty_score":0.048587263},"labels":[],"label_agreement":null},{"id":"W2604908377","doi":"10.1007/978-3-319-55696-3_5","title":"Emergent Tangled Graph Representations for Atari Game Playing Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Graph; Benchmarking; Machine learning; Theoretical computer science","score_opus":0.03932165180850437,"score_gpt":0.3050081953230138,"score_spread":0.26568654351450943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604908377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274772,0.00036917208,0.83460724,0.00049705117,0.00011951593,0.00009042336,0.00051404553,0.0011970089,0.035128318],"genre_scores_gemma":[0.82333374,0.0002987097,0.15642208,0.000097962846,0.000040363684,0.00014265573,0.0007352737,0.00033812222,0.018591179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988425,0.00003695879,0.0000065423797,0.000029577946,0.000024756986,0.000017909262],"domain_scores_gemma":[0.9995579,0.00018979455,0.00004837788,0.00008050997,0.000057051475,0.000066309054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021088809,0.00041004876,0.00040983225,0.0008219347,0.0006225841,0.0014111599,0.00085982593,0.0010706614,0.009086115],"category_scores_gemma":[0.00147693,0.00027256957,0.00046894027,0.00052922266,0.0006930848,0.0020018436,0.0012265005,0.0010825241,0.00075885653],"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.00012899384,0.000087522894,0.0008234497,0.00013970135,0.00003318331,0.00033148818,0.00079132436,0.3075782,0.0063390713,0.6242365,0.0048217755,0.054688808],"study_design_scores_gemma":[0.000008220199,0.00001686701,0.00011406028,0.0000129052805,0.000005437294,0.000041988136,0.00009437884,0.79568934,0.0003729354,0.20136316,0.0022728238,0.000007903524],"about_ca_topic_score_codex":0.0019069096,"about_ca_topic_score_gemma":0.003377847,"teacher_disagreement_score":0.009086115,"about_ca_system_score_codex":0.0006709059,"about_ca_system_score_gemma":0.00034530737,"threshold_uncertainty_score":0.030396044},"labels":[],"label_agreement":null},{"id":"W2604928139","doi":"10.1007/978-3-319-56608-5_36","title":"Predicting Users’ Future Interests on Twitter","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Toronto Metropolitan University","funders":"","keywords":"Computer science; Microblogging; Set (abstract data type); Semantic space; Social media; Interval (graph theory); Space (punctuation); Data science; Information retrieval; World Wide Web; Artificial intelligence","score_opus":0.033216678476803214,"score_gpt":0.27934240756924056,"score_spread":0.24612572909243735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604928139","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.9144652,0.0033596372,0.04451539,0.0022326712,0.00034865784,0.0000777054,0.008459496,0.0006550909,0.025886163],"genre_scores_gemma":[0.97391135,0.0012474238,0.0092013925,0.00007634488,0.00035988574,0.000033072294,0.0046164943,0.00004529345,0.010508691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975616,0.00006157168,0.00001505728,0.000047177724,0.00007866679,0.000041386815],"domain_scores_gemma":[0.9989517,0.00069325435,0.000071390066,0.00006758315,0.00014716483,0.00006891874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054942555,0.00048014068,0.00037825565,0.0016472168,0.0003919603,0.0009133531,0.00038425508,0.00059914944,0.0036436059],"category_scores_gemma":[0.002702804,0.0001841361,0.00043038806,0.0018401108,0.00010089827,0.0015608676,0.0003790572,0.00057552184,0.0033970485],"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.0007070838,0.00042604905,0.39454994,0.0002913796,0.00034558718,0.00033125022,0.00064322655,0.0374123,0.008548981,0.0042979126,0.044810034,0.50763625],"study_design_scores_gemma":[0.000024793188,0.00031500717,0.15931803,0.0001041276,0.00025751215,0.00047192845,0.001052416,0.8001692,0.008071277,0.008643986,0.02150325,0.00006842707],"about_ca_topic_score_codex":0.004697721,"about_ca_topic_score_gemma":0.012657378,"teacher_disagreement_score":0.004697721,"about_ca_system_score_codex":0.0003080827,"about_ca_system_score_gemma":0.0001462786,"threshold_uncertainty_score":0.01218909},"labels":[],"label_agreement":null},{"id":"W2605475111","doi":"10.1007/978-3-319-57351-9_23","title":"Learning Physical Properties of Objects Using Gaussian Mixture Models","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; WordNet; Taxonomy (biology); Artificial intelligence; Classifier (UML); Inference; Gaussian; Machine learning; Data mining","score_opus":0.033495551435880865,"score_gpt":0.27873265143962406,"score_spread":0.24523710000374319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605475111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008447013,0.0003987669,0.989684,0.00006637697,0.000018196293,0.000014674382,0.00006813066,0.0006542595,0.0006487256],"genre_scores_gemma":[0.41346532,0.002572509,0.5752169,0.00018642108,0.00014685761,0.0001511257,0.0014808441,0.000549522,0.006230414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995987,0.000070579146,0.000019099842,0.00014958114,0.00013585894,0.000026293688],"domain_scores_gemma":[0.9991303,0.0004947467,0.00009283175,0.00016564224,0.00008357253,0.000032903412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078778755,0.0011276298,0.0013858897,0.001351404,0.00031031127,0.0014953804,0.0017351328,0.0015284766,0.0016782552],"category_scores_gemma":[0.002633021,0.0010145893,0.0020854045,0.0015246086,0.00095540547,0.003329256,0.0017019064,0.002142127,0.0014365079],"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.00016110767,0.00013865985,0.0024348714,0.00028506477,0.00024156843,0.00012493705,0.00016834373,0.40362117,0.01832483,0.019549575,0.0030717342,0.55187815],"study_design_scores_gemma":[0.0000043782798,0.000022296425,0.0006620978,0.00001437849,0.000027448412,0.00008225218,0.000017646858,0.9694119,0.0024131946,0.026302787,0.0010260382,0.000015630121],"about_ca_topic_score_codex":0.0017959337,"about_ca_topic_score_gemma":0.0019599174,"teacher_disagreement_score":0.0017959337,"about_ca_system_score_codex":0.00050089037,"about_ca_system_score_gemma":0.00036793767,"threshold_uncertainty_score":0.0056143403},"labels":[],"label_agreement":null},{"id":"W2605617537","doi":"10.1007/978-3-319-57351-9_7","title":"Somatic Copy Number Alteration-Based Prediction of Molecular Subtypes of Breast Cancer Using Deep Learning Model","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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 Manitoba; George & Fay Yee Centre for Healthcare Innovation","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Deep learning; Random forest; Machine learning; Breast cancer; Artificial neural network; Single-nucleotide polymorphism; Deep neural networks; Cancer; Computational biology; Pattern recognition (psychology); Gene; Biology; Genetics; Genotype","score_opus":0.016647420864551846,"score_gpt":0.2623248012187453,"score_spread":0.24567738035419345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605617537","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.8691267,0.004671287,0.116275616,0.00073873106,0.0001229017,0.000051358093,0.003702492,0.00072096323,0.0045900075],"genre_scores_gemma":[0.97771275,0.0007155956,0.015545211,0.000083586885,0.000054478445,0.000024676305,0.0030607649,0.000025991241,0.00277701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986446,0.000020426574,0.000009239523,0.00004645373,0.00003189799,0.000027425767],"domain_scores_gemma":[0.9996978,0.00016494287,0.000036524358,0.000022359216,0.000056753324,0.000021759724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039559347,0.00043389632,0.00038205,0.00081180286,0.00011768297,0.00048804318,0.00068818853,0.0004213198,0.0010297436],"category_scores_gemma":[0.00095394836,0.00019010782,0.00063718547,0.00046723828,0.00012968053,0.00046720577,0.00040413596,0.0006676558,0.000452997],"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.0008285844,0.00040535352,0.196427,0.00018705775,0.00049715297,0.00048228962,0.00011299389,0.17509188,0.022788035,0.0025544828,0.010071771,0.5905534],"study_design_scores_gemma":[0.000015942465,0.000070479044,0.02321235,0.000026479294,0.000108836386,0.00021951027,0.000027245527,0.96773416,0.0037566589,0.0038382085,0.0009689774,0.000021180747],"about_ca_topic_score_codex":0.004446047,"about_ca_topic_score_gemma":0.0075807665,"teacher_disagreement_score":0.004446047,"about_ca_system_score_codex":0.00037993235,"about_ca_system_score_gemma":0.0002992475,"threshold_uncertainty_score":0.008840382},"labels":[],"label_agreement":null},{"id":"W2605703278","doi":"10.1007/978-3-319-62075-6_2","title":"Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Computer science; Axiom; Rotation formalisms in three dimensions; Morphism; Graph theory; Conceptual graph; Algebraic theory; Theoretical computer science; Mathematical theory; Type theory; Category theory; Algebra over a field; Knowledge representation and reasoning; Artificial intelligence; Discrete mathematics; Type (biology); Mathematics; Algebraic number","score_opus":0.03844687787233771,"score_gpt":0.2985423668490404,"score_spread":0.2600954889767027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605703278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065048985,0.0010243002,0.8113017,0.0062424475,0.000111788264,0.00022425827,0.0004496796,0.0007640857,0.114832714],"genre_scores_gemma":[0.6565331,0.0008410517,0.32069364,0.0004819093,0.00006132097,0.00014515815,0.0005560942,0.00026738117,0.020420214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980117,0.0010593189,0.00010212062,0.00024058236,0.00043433992,0.0001519283],"domain_scores_gemma":[0.99370897,0.004372696,0.0002321862,0.0009433123,0.000541306,0.00020146309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031302315,0.0003984825,0.00034934818,0.0018462542,0.002079855,0.00472884,0.0016913089,0.0020750486,0.009727548],"category_scores_gemma":[0.007418854,0.0003519464,0.0009077603,0.0025597396,0.00587783,0.012195586,0.0037039558,0.0029506525,0.0009060368],"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.000013437978,0.000027723814,0.000238972,0.000036714042,0.000004267468,0.00022904474,0.001183453,0.0012987771,0.00030628595,0.9810162,0.0008209561,0.014824149],"study_design_scores_gemma":[0.000014643374,0.000029099088,0.00030013447,0.00010846768,0.00002255502,0.00062391075,0.002055887,0.019573215,0.0014035349,0.93443227,0.041419785,0.000016503618],"about_ca_topic_score_codex":0.005712057,"about_ca_topic_score_gemma":0.007695498,"teacher_disagreement_score":0.009727548,"about_ca_system_score_codex":0.0029453544,"about_ca_system_score_gemma":0.001760329,"threshold_uncertainty_score":0.03254187},"labels":[],"label_agreement":null},{"id":"W2605723560","doi":"10.1007/978-3-319-57351-9_20","title":"On the Role of Possibility in Action Execution and Knowledge in the Situation Calculus","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Situation calculus; Successor cardinal; Axiom; Action (physics); Computer science; Calculus (dental); Projection (relational algebra); Axiomatic system; Mathematics; Artificial intelligence; Algorithm","score_opus":0.02628031287152494,"score_gpt":0.27591058523533435,"score_spread":0.2496302723638094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605723560","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024509985,0.009448202,0.7462837,0.009103221,0.00072264404,0.00010749558,0.00025217907,0.00035210862,0.2092204],"genre_scores_gemma":[0.7658076,0.006629443,0.19761334,0.001038031,0.0013143822,0.0003544979,0.0003477746,0.00027644352,0.02661851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960663,0.0018535221,0.00029872736,0.0005095274,0.00083511655,0.0004368803],"domain_scores_gemma":[0.9931109,0.0054968596,0.00020847179,0.00061349454,0.00030694524,0.0002632818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00633948,0.0013552551,0.0014149427,0.0019461226,0.0033387488,0.0072776587,0.0032692836,0.0035298064,0.006591842],"category_scores_gemma":[0.008680195,0.0013396178,0.0031879959,0.0024949627,0.018076796,0.019514415,0.004714848,0.007981578,0.0010338653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011842479,0.000005037226,0.000023286233,0.000017205892,0.000004086559,0.000034999906,0.00018817425,0.00075245666,0.000056357763,0.99667263,0.00024489293,0.0019890806],"study_design_scores_gemma":[0.0000038277612,0.0000031751724,0.0000151985605,0.000010756271,0.0000042953357,0.000014556039,0.000016421545,0.0016259052,0.00003857825,0.99718684,0.0010755513,0.0000048742813],"about_ca_topic_score_codex":0.005540138,"about_ca_topic_score_gemma":0.003144904,"teacher_disagreement_score":0.0072776587,"about_ca_system_score_codex":0.0037586729,"about_ca_system_score_gemma":0.0021159933,"threshold_uncertainty_score":0.03352678},"labels":[],"label_agreement":null},{"id":"W2605815985","doi":"10.1007/978-3-319-57351-9_26","title":"A Knowledge Acquisition System for Price Change Rules","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Market Behavior and Pricing","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":"University of Regina","funders":"","keywords":"Computer science; Data science; Econometrics; Economics","score_opus":0.04580117021634266,"score_gpt":0.2712329871686132,"score_spread":0.22543181695227055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605815985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026379747,0.00033070706,0.8398083,0.00041488992,0.00010902929,0.00039168357,0.003121413,0.117672294,0.011771914],"genre_scores_gemma":[0.32182044,0.0004085267,0.6482974,0.00057831255,0.00011992174,0.0005558314,0.008517841,0.002420605,0.01728108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.00009783447,0.00010541519,0.00025138925,0.0002792094,0.000062702544],"domain_scores_gemma":[0.9973315,0.0015746519,0.00014170204,0.00046664785,0.00041056337,0.000074982294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011215066,0.0006431245,0.0007801073,0.0020315428,0.0006073655,0.0021466203,0.0017021933,0.001058703,0.013961414],"category_scores_gemma":[0.005467052,0.00052676344,0.0007480126,0.0012885634,0.00047107847,0.0037003942,0.0018276706,0.0012459483,0.0051384484],"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.0007055925,0.00058406516,0.00359847,0.00028545732,0.00010790759,0.00055102474,0.00042979812,0.012193331,0.011726061,0.017299393,0.036952995,0.9155659],"study_design_scores_gemma":[0.00027160405,0.00016947374,0.0036070317,0.00016592613,0.0002128452,0.0006251861,0.00017229268,0.8242669,0.057715014,0.048936043,0.06374864,0.00010903755],"about_ca_topic_score_codex":0.0053331438,"about_ca_topic_score_gemma":0.005736202,"teacher_disagreement_score":0.013961414,"about_ca_system_score_codex":0.0008146267,"about_ca_system_score_gemma":0.0011708384,"threshold_uncertainty_score":0.046705544},"labels":[],"label_agreement":null},{"id":"W2605893001","doi":"10.1007/978-3-319-57351-9_24","title":"Design and Implementation of a Smart Quotation System","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Concordia University","funders":"","keywords":"Computer science; Context (archaeology); Process (computing); Order (exchange); Software engineering; Software; Operations research; Industrial engineering; Database; Operating system","score_opus":0.02868893627742745,"score_gpt":0.2842081918926632,"score_spread":0.25551925561523575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605893001","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.022235628,0.00019785794,0.9098867,0.0004390543,0.00032228592,0.0012836629,0.0003992478,0.056319013,0.008916524],"genre_scores_gemma":[0.19903226,0.00014823547,0.76700306,0.0006463027,0.00011528702,0.0012212957,0.0011105865,0.0028254106,0.02789764],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99773526,0.00041594822,0.00028121658,0.00052871567,0.00085417664,0.00018467168],"domain_scores_gemma":[0.99633837,0.0011627082,0.00025684029,0.00081765745,0.0010419755,0.00038255574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021436908,0.0006598586,0.0010087072,0.0012414497,0.00094320753,0.0028241326,0.003353968,0.0014026266,0.029763455],"category_scores_gemma":[0.0057973354,0.0008817465,0.0005198858,0.00091900537,0.0009333565,0.0025605506,0.0021790254,0.0009631279,0.011801503],"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.002400802,0.0009980461,0.004904801,0.0015475411,0.00021526631,0.001164317,0.0025612912,0.007992643,0.21386331,0.038544774,0.03698217,0.6888251],"study_design_scores_gemma":[0.0007983218,0.001385639,0.0051272684,0.00024567585,0.0003066573,0.0012818414,0.00094117614,0.3738348,0.34089932,0.016600274,0.25826776,0.00031127696],"about_ca_topic_score_codex":0.0014826194,"about_ca_topic_score_gemma":0.0014338734,"teacher_disagreement_score":0.029763455,"about_ca_system_score_codex":0.00079266675,"about_ca_system_score_gemma":0.0018167669,"threshold_uncertainty_score":0.099568665},"labels":[],"label_agreement":null},{"id":"W2605905982","doi":"10.1007/978-3-319-57351-9_29","title":"Domain Adaptation for Detecting Mild Cognitive Impairment","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 the Fraser Valley; University of British Columbia","funders":"","keywords":"Computer science; Domain adaptation; Adaptation (eye); Cognitive impairment; Dementia; Domain (mathematical analysis); Cognition; Natural language processing; Artificial intelligence; Machine learning; Psychology; Medicine; Disease; Psychiatry","score_opus":0.0395186085395018,"score_gpt":0.2785107478688961,"score_spread":0.23899213932939434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605905982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4793575,0.009497645,0.48550957,0.0005217121,0.0005077628,0.00032687787,0.0036469288,0.0062774913,0.014354542],"genre_scores_gemma":[0.8583869,0.0024764827,0.12858401,0.00018116969,0.00025225565,0.0001969138,0.0042908145,0.00024099112,0.005390563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969923,0.00008597102,0.000018223589,0.00007999278,0.000067347886,0.000049268256],"domain_scores_gemma":[0.99929106,0.00034444296,0.00004715232,0.00009348285,0.00017184817,0.00005186617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008131709,0.0005905165,0.0005264826,0.0010796341,0.00018672575,0.0006727102,0.00044975957,0.00043896938,0.001901978],"category_scores_gemma":[0.0026796397,0.00010214087,0.0004749593,0.0006953328,0.00014344249,0.0004731547,0.00066381716,0.0006236548,0.001417331],"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.0010623847,0.0002344656,0.021394271,0.00019663858,0.00016386392,0.0001872972,0.00012489005,0.009240168,0.0432319,0.000547295,0.010220455,0.9133964],"study_design_scores_gemma":[0.00014753998,0.0010751358,0.2606718,0.0002275484,0.00063290104,0.0037082613,0.0008009543,0.6230589,0.074791096,0.013289532,0.02141972,0.00017663528],"about_ca_topic_score_codex":0.0018317177,"about_ca_topic_score_gemma":0.0019803687,"teacher_disagreement_score":0.001901978,"about_ca_system_score_codex":0.00016649935,"about_ca_system_score_gemma":0.0003129525,"threshold_uncertainty_score":0.006362796},"labels":[],"label_agreement":null},{"id":"W2606016433","doi":"10.1007/978-3-319-57351-9_34","title":"Probabilistic TCP-net","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Net (polyhedron); Computer science; Preference; Bayesian network; Probabilistic logic; Set (abstract data type); Graphical model; Preference relation; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.022462443124361207,"score_gpt":0.2503938629422117,"score_spread":0.2279314198178505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606016433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007866408,0.0015194142,0.86784464,0.0017640799,0.0012339787,0.00016165792,0.0012171635,0.006914544,0.111478075],"genre_scores_gemma":[0.4325031,0.005237296,0.35235915,0.0011917222,0.0018637016,0.00076586154,0.0050516264,0.003407093,0.1976204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988655,0.0002247747,0.000056919594,0.00022961032,0.00050128036,0.00012194001],"domain_scores_gemma":[0.9978295,0.00061978877,0.00011225275,0.00081017223,0.00045301538,0.0001752468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018401825,0.00088394195,0.0007705384,0.0014416347,0.0015204072,0.0032320053,0.0018144258,0.0013800117,0.026852652],"category_scores_gemma":[0.0063393,0.00069174526,0.00063856185,0.0014313904,0.001216494,0.004779385,0.0026358338,0.0029270116,0.010766833],"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.00019692643,0.000081518054,0.00055986614,0.00017079723,0.000033848813,0.000081688166,0.00007341121,0.039461892,0.0021014651,0.7586647,0.05585079,0.14272316],"study_design_scores_gemma":[0.000029826886,0.00004771344,0.0003337073,0.000086993336,0.000040054023,0.00028904786,0.000031714273,0.25220314,0.0039091418,0.6304654,0.112514876,0.00004833576],"about_ca_topic_score_codex":0.0012542568,"about_ca_topic_score_gemma":0.0014472998,"teacher_disagreement_score":0.026852652,"about_ca_system_score_codex":0.0016199551,"about_ca_system_score_gemma":0.0016357087,"threshold_uncertainty_score":0.089830995},"labels":[],"label_agreement":null},{"id":"W2606049180","doi":"10.1007/978-3-319-57351-9_16","title":"A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Computer science; Constraint (computer-aided design); Benchmark (surveying); Mathematical optimization; Constraint satisfaction problem; Constraint satisfaction; Algorithm; Linear subspace; Constraint programming; Combinatorial optimization; Mathematics; Artificial intelligence","score_opus":0.027814252064999427,"score_gpt":0.29980466181435933,"score_spread":0.2719904097493599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606049180","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.013884893,0.004461787,0.9488355,0.0010510004,0.00038785333,0.0003433481,0.00029812963,0.0006343438,0.03010314],"genre_scores_gemma":[0.29707247,0.0028643738,0.6822975,0.0010693161,0.00081488886,0.00083548366,0.0007788154,0.00152743,0.012739691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98448783,0.006544769,0.0005043459,0.0013553252,0.0053987005,0.0017090595],"domain_scores_gemma":[0.94742167,0.04183995,0.0017375409,0.004069601,0.004070898,0.0008604023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015715735,0.0044529834,0.0027663629,0.0026645723,0.0018946897,0.006462424,0.006642145,0.003506981,0.016354129],"category_scores_gemma":[0.05341424,0.0018250967,0.0033579713,0.005420094,0.0033882519,0.007547159,0.0037947677,0.0072957743,0.0020348267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009541988,0.0003491694,0.00072453363,0.0005815726,0.00018964542,0.00012897553,0.00009707798,0.81667924,0.0022866456,0.085068844,0.010681533,0.082258634],"study_design_scores_gemma":[0.000021642329,0.00008678837,0.00013956724,0.00005268139,0.000033973105,0.0000707349,0.000022304175,0.9759789,0.0006152172,0.021925982,0.0010376204,0.000014592462],"about_ca_topic_score_codex":0.004179647,"about_ca_topic_score_gemma":0.004597441,"teacher_disagreement_score":0.016354129,"about_ca_system_score_codex":0.0054035983,"about_ca_system_score_gemma":0.0042848354,"threshold_uncertainty_score":0.08311373},"labels":[],"label_agreement":null},{"id":"W2606164293","doi":"10.1007/978-3-319-57351-9_21","title":"Combinatorial Reverse Electricity Auctions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Bidding; Computer science; Combinatorial auction; Electricity; Reverse auction; Mathematical optimization; Renewable energy; Common value auction; Genetic algorithm; Operations research; Microeconomics; Economics; Electrical engineering; Mathematics","score_opus":0.05714655332363166,"score_gpt":0.34543424579270293,"score_spread":0.28828769246907127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606164293","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.017023027,0.005218839,0.22276714,0.0013072786,0.0010475266,0.00008471879,0.00026100854,0.00048977294,0.7518007],"genre_scores_gemma":[0.41470388,0.008713698,0.08185751,0.0007300971,0.0010462129,0.0001678722,0.0010761977,0.0005112185,0.49119335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955684,0.000104445,0.000019113182,0.00006702467,0.00021068029,0.000041899235],"domain_scores_gemma":[0.999699,0.00009372878,0.000022422277,0.0000992343,0.00006126944,0.000024395717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045427107,0.00074491964,0.00062730734,0.00056526274,0.00043756753,0.0022522449,0.0012399607,0.00086942624,0.030373124],"category_scores_gemma":[0.0014004296,0.0003815226,0.0005993333,0.000974372,0.0007769587,0.0023989675,0.0010563975,0.001983858,0.0076944055],"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.00008626879,0.00011606045,0.000078324374,0.00023206878,0.000035606554,0.00010766038,0.00003226674,0.013119817,0.0026436318,0.8098194,0.029724987,0.14400403],"study_design_scores_gemma":[0.000043907174,0.00005785244,0.00021810035,0.000103526516,0.00003083363,0.00070033775,0.00003758396,0.033575226,0.002941195,0.8047045,0.15755828,0.000028720238],"about_ca_topic_score_codex":0.00014407496,"about_ca_topic_score_gemma":0.0002488092,"teacher_disagreement_score":0.030373124,"about_ca_system_score_codex":0.000629731,"about_ca_system_score_gemma":0.00044985584,"threshold_uncertainty_score":0.10160822},"labels":[],"label_agreement":null},{"id":"W2606287281","doi":"10.1007/978-3-319-57339-7_8","title":"Impossible Differential Attack on Reduced Round SPARX-64/128","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Linear cryptanalysis; Boomerang attack; Impossible differential cryptanalysis; Key schedule; Differential cryptanalysis; Slide attack; Cryptanalysis; Block (permutation group theory); Key (lock); Arithmetic; Algorithm; Cryptography; Computer security; Mathematics; Combinatorics","score_opus":0.05118550427910774,"score_gpt":0.3207620935548922,"score_spread":0.2695765892757845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606287281","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.6280792,0.002559158,0.23219274,0.002329342,0.00059669814,0.00023557107,0.00057640916,0.0030204677,0.13041049],"genre_scores_gemma":[0.9602586,0.00031544207,0.01837282,0.00023975495,0.000057359557,0.00004824202,0.00021180829,0.00011757615,0.020378353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988403,0.00019203506,0.00005867109,0.00017122013,0.00045251736,0.00028534824],"domain_scores_gemma":[0.9994361,0.00018464738,0.00004743439,0.00022632812,0.00006847648,0.000036954978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005697667,0.0005766307,0.00057169615,0.0004647769,0.00083764375,0.0009794296,0.0006665638,0.0007383213,0.008663752],"category_scores_gemma":[0.0011653557,0.00031779465,0.00049134,0.00045220723,0.00089154294,0.0018227163,0.0019457808,0.00088748016,0.0018653807],"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.0032014258,0.00029193048,0.00294667,0.00078952656,0.00025450392,0.0021044468,0.00083410356,0.03221875,0.14232479,0.4747087,0.028844863,0.31148028],"study_design_scores_gemma":[0.00043297175,0.0015057941,0.0045909286,0.00032271424,0.0003379374,0.0039863344,0.00034786275,0.1763753,0.24941392,0.47836524,0.084108025,0.00021303995],"about_ca_topic_score_codex":0.00027469473,"about_ca_topic_score_gemma":0.00042924364,"teacher_disagreement_score":0.008663752,"about_ca_system_score_codex":0.00072318566,"about_ca_system_score_gemma":0.00079460925,"threshold_uncertainty_score":0.028983116},"labels":[],"label_agreement":null},{"id":"W2606312722","doi":"10.1007/978-3-319-57351-9_4","title":"Improving Active Learning for One-Class Classification Using Dimensionality Reduction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Dimensionality reduction; Redundancy (engineering); Thresholding; Curse of dimensionality; Artificial intelligence; Reduction (mathematics); Machine learning; Pattern recognition (psychology); Algorithm; Mathematics; Image (mathematics)","score_opus":0.04405338391815277,"score_gpt":0.30032339676525066,"score_spread":0.2562700128470979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606312722","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.006096619,0.0007935578,0.990325,0.0001945233,0.00017417112,0.000033213255,0.000056952824,0.0010068829,0.0013191014],"genre_scores_gemma":[0.23710616,0.00093106355,0.74590766,0.00053131365,0.00068228587,0.00030807842,0.0009837837,0.0005699777,0.012979643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784744,0.00060604024,0.00015226922,0.0005268563,0.0007167374,0.00015072779],"domain_scores_gemma":[0.994023,0.0035206252,0.00019139545,0.0011735456,0.00095016224,0.00014129437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025352114,0.0015867248,0.0026800386,0.0011420328,0.000837506,0.002060289,0.0045679715,0.0028275119,0.004604569],"category_scores_gemma":[0.007790537,0.00076182256,0.0018419579,0.001359318,0.0010332911,0.004425436,0.0030436735,0.0045505874,0.0031385038],"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.00020198095,0.0003307558,0.0005984692,0.00018245928,0.0001363737,0.000050712788,0.00013922145,0.06384089,0.009607898,0.018214747,0.010153912,0.89654255],"study_design_scores_gemma":[0.000012661702,0.000047115816,0.00011953252,0.000011235108,0.000025084593,0.000050077095,0.000014778161,0.9807128,0.0031834645,0.014320242,0.0014922526,0.000010758141],"about_ca_topic_score_codex":0.0014817528,"about_ca_topic_score_gemma":0.0018258978,"teacher_disagreement_score":0.004604569,"about_ca_system_score_codex":0.0006131542,"about_ca_system_score_gemma":0.00063142244,"threshold_uncertainty_score":0.015403867},"labels":[],"label_agreement":null},{"id":"W2606469090","doi":"10.1007/978-3-319-57351-9_2","title":"Person Identification Using Discriminative Visual Aesthetic","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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 Calgary","funders":"","keywords":"Discriminative model; Computer science; Identification (biology); Artificial intelligence; Computer vision; Pattern recognition (psychology)","score_opus":0.06123014878419592,"score_gpt":0.34255502235717983,"score_spread":0.2813248735729839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606469090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04703866,0.0008574351,0.9285323,0.0001259275,0.00024290784,0.000115318995,0.00041341182,0.0029884174,0.019685602],"genre_scores_gemma":[0.54594696,0.0015559632,0.4167186,0.0003346713,0.00026188197,0.00008299947,0.0016811455,0.00069453655,0.032723162],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956733,0.00006676274,0.000012411853,0.00015589279,0.00013190348,0.000065748805],"domain_scores_gemma":[0.9997187,0.000043274293,0.00001877296,0.00011354382,0.00008088396,0.000024697618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005130001,0.0008836742,0.0009719896,0.0012781321,0.00027082235,0.0008998386,0.00065920583,0.0006488885,0.008263442],"category_scores_gemma":[0.0008083555,0.0003220436,0.0008255572,0.0011064,0.00043812473,0.0012665505,0.0011576628,0.0006471382,0.00503858],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027187765,0.0000840688,0.0008703844,0.0001290848,0.00005891661,0.00011476125,0.000041206233,0.010543354,0.06052542,0.0036495386,0.00713464,0.9165767],"study_design_scores_gemma":[0.000035956917,0.00035114016,0.007898472,0.000076887234,0.00012990464,0.0021542336,0.00013745786,0.8999787,0.056521006,0.018244691,0.014401189,0.000070380156],"about_ca_topic_score_codex":0.0007847026,"about_ca_topic_score_gemma":0.001662739,"teacher_disagreement_score":0.008263442,"about_ca_system_score_codex":0.0002400917,"about_ca_system_score_gemma":0.00021952722,"threshold_uncertainty_score":0.027643979},"labels":[],"label_agreement":null},{"id":"W2606510480","doi":"10.1007/978-3-319-57351-9_15","title":"Time Prediction of the Next Refueling Event: A Case Study","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Event (particle physics); Set (abstract data type); Artificial intelligence; Data mining; Machine learning; Ensemble learning; Ensemble forecasting; Data set","score_opus":0.042457695149409294,"score_gpt":0.28441510745532844,"score_spread":0.24195741230591916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606510480","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.9007083,0.00069460424,0.074188694,0.0012338384,0.00016069727,0.00017863026,0.0018008511,0.000878878,0.020155497],"genre_scores_gemma":[0.982781,0.00018472255,0.012822928,0.000044756132,0.000022049426,0.000024282419,0.0005648748,0.000059391794,0.00349596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.000114064496,0.00002263988,0.000095899,0.00012354739,0.000063810105],"domain_scores_gemma":[0.995239,0.0034585092,0.0002701642,0.0003062822,0.00046029492,0.00026570878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011036799,0.0004761583,0.00035881152,0.0008380916,0.000652787,0.0008580997,0.0013724674,0.0015538943,0.005224669],"category_scores_gemma":[0.006015302,0.00020073718,0.00037564893,0.001114829,0.00040442386,0.00085407577,0.00046076003,0.0007947535,0.0008682362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028274707,0.0022079835,0.1367727,0.0006600555,0.00016852222,0.02954044,0.0021112924,0.5275942,0.011831313,0.01991847,0.020439904,0.24592753],"study_design_scores_gemma":[0.0001362647,0.00076413405,0.020277515,0.00008202243,0.00011867865,0.003529225,0.0023991475,0.9318875,0.012129324,0.012807733,0.015778726,0.00008972459],"about_ca_topic_score_codex":0.011711153,"about_ca_topic_score_gemma":0.011044997,"teacher_disagreement_score":0.011711153,"about_ca_system_score_codex":0.00058384414,"about_ca_system_score_gemma":0.00069424027,"threshold_uncertainty_score":0.023285985},"labels":[],"label_agreement":null},{"id":"W2606584033","doi":"10.1007/978-3-319-57351-9_10","title":"Investigating Citation Linkage with Machine Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Sentence; Citation; Linkage (software); Similarity (geometry); Artificial intelligence; Natural language processing; Learning to rank; Task (project management); Rank (graph theory); Domain (mathematical analysis); Regression; Information retrieval; Machine learning; Statistics; Ranking (information retrieval); Mathematics; World Wide Web","score_opus":0.02924486356172764,"score_gpt":0.25107939023284415,"score_spread":0.2218345266711165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606584033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35857308,0.042337716,0.52370465,0.0058100703,0.0019253909,0.0002691646,0.004699848,0.0036741633,0.05900599],"genre_scores_gemma":[0.8266295,0.007807215,0.14302228,0.00037358835,0.002400287,0.00025261566,0.005462806,0.0007066845,0.013345049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936101,0.0031669156,0.00042997507,0.0010762224,0.0014186425,0.00029815928],"domain_scores_gemma":[0.9299385,0.057953775,0.004187487,0.004013263,0.003153199,0.00075373834],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008537647,0.00085301965,0.0017651225,0.015702633,0.0026818577,0.0074700736,0.0025773249,0.0025566006,0.008944774],"category_scores_gemma":[0.08520725,0.00076080114,0.0014095778,0.034467757,0.0010419496,0.009430279,0.003109369,0.002260458,0.0036966742],"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.0005702511,0.00052180374,0.08418671,0.0015786446,0.0012482968,0.00069748383,0.0016923266,0.0353003,0.004400404,0.10501064,0.03642106,0.72837216],"study_design_scores_gemma":[0.00008551523,0.0001932611,0.02537614,0.00051390723,0.0008366227,0.0011179405,0.0012582729,0.47200656,0.00820003,0.4394562,0.050825942,0.0001296681],"about_ca_topic_score_codex":0.0013669247,"about_ca_topic_score_gemma":0.0016060392,"teacher_disagreement_score":0.9842974,"about_ca_system_score_codex":0.0010992121,"about_ca_system_score_gemma":0.0013503883,"threshold_uncertainty_score":0.04515195},"labels":[],"label_agreement":null},{"id":"W2606633748","doi":"10.1007/978-3-319-57351-9_19","title":"Sequence-Based Bidirectional Merge Map-Matching Algorithm for Simplified Road Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Map matching; Merge (version control); Algorithm; Merge algorithm; Outlier; Blossom algorithm; Matching (statistics); Sequence (biology); Global Positioning System; Artificial intelligence; Mathematics","score_opus":0.03445042403683292,"score_gpt":0.276466503553487,"score_spread":0.2420160795166541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606633748","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.021335397,0.0003061976,0.9710569,0.00007819808,0.000109516084,0.00018496382,0.0004455673,0.0026766704,0.0038066152],"genre_scores_gemma":[0.1894713,0.00040862805,0.7971514,0.00007741492,0.000055974593,0.00027763093,0.0028268648,0.00028736237,0.009443494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992576,0.00005253418,0.0000449436,0.00020996602,0.000327473,0.00010748414],"domain_scores_gemma":[0.99954873,0.000056711913,0.000031730055,0.00009514139,0.00023594228,0.000031728272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050563633,0.00097569666,0.0013709428,0.0027168503,0.0012258126,0.0010590053,0.0023902524,0.0008970748,0.008746012],"category_scores_gemma":[0.0014164709,0.000609264,0.0010170261,0.003425366,0.000360066,0.0020858552,0.002051453,0.00080949743,0.0027564713],"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.00044412026,0.00016536664,0.0018066526,0.0002918768,0.00012242308,0.00018385962,0.00021520125,0.06895158,0.024132587,0.0105989035,0.0126328,0.8804546],"study_design_scores_gemma":[0.00007532107,0.000118670614,0.0012733375,0.000021752938,0.00008810201,0.00040718497,0.00021312809,0.9459236,0.026300484,0.013402915,0.012129461,0.000045933863],"about_ca_topic_score_codex":0.012969337,"about_ca_topic_score_gemma":0.013906734,"teacher_disagreement_score":0.012969337,"about_ca_system_score_codex":0.0007992031,"about_ca_system_score_gemma":0.0026285932,"threshold_uncertainty_score":0.029258251},"labels":[],"label_agreement":null},{"id":"W2606648713","doi":"10.1007/978-3-319-57529-2_14","title":"MaP2R: A Personalized Maximum Probability Route Recommendation Method Using GPS Trajectories","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Global Positioning System; Recommender system; Smoothing; Graph; Personalization; Information retrieval; Theoretical computer science; World Wide Web; Computer vision","score_opus":0.05690339408799902,"score_gpt":0.3099706010547597,"score_spread":0.25306720696676066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606648713","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.024049105,0.0013516647,0.94550455,0.0001872904,0.000320994,0.00019475493,0.0037737542,0.020511394,0.0041064527],"genre_scores_gemma":[0.20869006,0.0009962493,0.76449996,0.00016510913,0.00024001938,0.00022301372,0.0073402836,0.0009152745,0.01692999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995758,0.00004588566,0.00001822054,0.00014163827,0.0001854262,0.00003307946],"domain_scores_gemma":[0.99964345,0.00009444631,0.000020212838,0.00010862082,0.00011115449,0.000022095624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822394,0.0010387276,0.0011953696,0.0018519362,0.0005888604,0.00071117515,0.0019479194,0.0009544306,0.0065368246],"category_scores_gemma":[0.0015900999,0.0005181891,0.0009719853,0.002214347,0.00013960678,0.0013178072,0.0006977122,0.0008152149,0.0043077534],"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.0005232268,0.00021979219,0.003386029,0.00030471693,0.00026696397,0.0002665717,0.000087569904,0.054609843,0.008120431,0.0017293652,0.051202077,0.87928337],"study_design_scores_gemma":[0.00009680683,0.00011110151,0.0020861863,0.000025994843,0.00011962236,0.00059092406,0.00005937502,0.9678765,0.0076372433,0.0028510015,0.018471567,0.000073718424],"about_ca_topic_score_codex":0.014340993,"about_ca_topic_score_gemma":0.022483956,"teacher_disagreement_score":0.014340993,"about_ca_system_score_codex":0.0003265964,"about_ca_system_score_gemma":0.0005963387,"threshold_uncertainty_score":0.02851504},"labels":[],"label_agreement":null},{"id":"W2606709729","doi":"10.1007/978-3-319-57351-9_43","title":"Active Team Management Strategies for Multi-robot Teams in Dangerous Environments","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 Manitoba","funders":"","keywords":"Robot; Computer science; Task (project management); Domain (mathematical analysis); Simplicity; Work (physics); Human–computer interaction; Order (exchange); Risk analysis (engineering); Artificial intelligence; Systems engineering; Engineering","score_opus":0.028009027472897984,"score_gpt":0.26123166346179405,"score_spread":0.23322263598889606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606709729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048478518,0.0007987198,0.9361822,0.0002458217,0.00017423839,0.00009009668,0.000019992662,0.0001510036,0.0138593875],"genre_scores_gemma":[0.87476873,0.000658179,0.110735394,0.00008014416,0.000118713615,0.00025336226,0.000057646997,0.00005873792,0.013269056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997527,0.00006843802,0.000011464323,0.00004717873,0.00007134301,0.000048885177],"domain_scores_gemma":[0.99951637,0.00020127108,0.000080245925,0.000037708953,0.00008840237,0.000076015975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049190305,0.0010077889,0.0005531705,0.00038893422,0.00076475315,0.0010935215,0.0016265226,0.0008860813,0.0033464704],"category_scores_gemma":[0.0012942781,0.00030561019,0.00042931954,0.0002856203,0.00053115614,0.001278598,0.001977807,0.0010192052,0.00055107416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029078114,0.00030164942,0.0006995623,0.00029831796,0.00013393248,0.0003180194,0.0008886311,0.63904124,0.015335602,0.085041545,0.006813069,0.25083762],"study_design_scores_gemma":[0.00003098851,0.00018641098,0.000202519,0.00003714499,0.000024604638,0.00007663712,0.00019749287,0.96405613,0.0012439878,0.03134573,0.0025872246,0.000011080686],"about_ca_topic_score_codex":0.00068882696,"about_ca_topic_score_gemma":0.0008286609,"teacher_disagreement_score":0.0033464704,"about_ca_system_score_codex":0.00033597188,"about_ca_system_score_gemma":0.00043288703,"threshold_uncertainty_score":0.011195064},"labels":[],"label_agreement":null},{"id":"W2606797676","doi":"10.1007/978-3-319-57351-9_32","title":"Using Cognitive Computing to Get Insights on Personality Traits from Twitter Messages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personality Traits and Psychology","field":"Psychology","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 Ottawa","funders":"","keywords":"Watson; Agreeableness; Computer science; Openness to experience; IBM; Big Five personality traits; Cognitive computing; Neuroticism; Extraversion and introversion; Personality; Conscientiousness; Artificial intelligence; Machine learning; Cognition; Psychology; Social psychology","score_opus":0.1092594192314672,"score_gpt":0.37762522406132887,"score_spread":0.26836580482986166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606797676","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.8623108,0.0018136934,0.08650119,0.0015095875,0.00047744758,0.000371988,0.009739762,0.0019131189,0.03536234],"genre_scores_gemma":[0.92013544,0.00089209364,0.06698782,0.0003398592,0.00035849432,0.00027481798,0.0036461777,0.000113584705,0.007251712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996538,0.00008693328,0.000018940238,0.00007517481,0.00010657303,0.000058537662],"domain_scores_gemma":[0.9974968,0.0017492792,0.00021712056,0.00012606244,0.00027215,0.00013858435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058417505,0.00073720794,0.0003472321,0.0029571843,0.00043054807,0.0020642448,0.00030125215,0.00047913505,0.004698651],"category_scores_gemma":[0.0049228095,0.00015414598,0.00043161487,0.0028297605,0.00017325513,0.0015247399,0.0007089616,0.0006072865,0.0022783082],"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.000576399,0.0005878044,0.28800926,0.00050523697,0.0003250318,0.00031561655,0.00274653,0.0024824787,0.019706745,0.0033395656,0.016011333,0.66539395],"study_design_scores_gemma":[0.000049969043,0.00045343538,0.77091706,0.0002536297,0.0003196294,0.0005704979,0.008495843,0.15131699,0.016045447,0.02752902,0.023837352,0.00021117694],"about_ca_topic_score_codex":0.0031191185,"about_ca_topic_score_gemma":0.0055815205,"teacher_disagreement_score":0.004698651,"about_ca_system_score_codex":0.0003882056,"about_ca_system_score_gemma":0.00022553244,"threshold_uncertainty_score":0.01571858},"labels":[],"label_agreement":null},{"id":"W2606931506","doi":"10.1007/978-3-319-57529-2_6","title":"Effective Multiclass Transfer for Hypothesis Transfer Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Western University","funders":"","keywords":"Computer science; Transfer of learning; Exploit; Artificial intelligence; Classifier (UML); Machine learning; Training set; Domain adaptation; Transfer function; Knowledge transfer","score_opus":0.02616235754246228,"score_gpt":0.25487084506430857,"score_spread":0.2287084875218463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606931506","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.0034884887,0.0009261898,0.99317884,0.00015143472,0.00011638597,0.000032455828,0.000050825773,0.0007574062,0.0012980535],"genre_scores_gemma":[0.34876528,0.00171246,0.6151396,0.00063978264,0.0006459108,0.00049768575,0.0011365272,0.0007677381,0.030694943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885786,0.0004571039,0.000052825482,0.00027756262,0.00025455933,0.00010006921],"domain_scores_gemma":[0.9980683,0.0011152511,0.00006636454,0.00046130485,0.00022254273,0.00006627208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025081818,0.0010318953,0.0013992857,0.0008478978,0.00055889343,0.0009950029,0.0025461246,0.0022173612,0.0077010677],"category_scores_gemma":[0.0052553075,0.00052959763,0.0009816511,0.0010204192,0.0009935583,0.0028446782,0.0033686499,0.0032034898,0.0032112414],"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.00017724832,0.00019233518,0.00027850765,0.00029895187,0.00016254924,0.00009676738,0.00010138832,0.10690747,0.014121365,0.0422861,0.012580218,0.82279706],"study_design_scores_gemma":[0.000008537469,0.000059171252,0.00024328816,0.000019473959,0.000024484541,0.00006418815,0.000015517275,0.9417555,0.0058998265,0.049211252,0.0026835725,0.000015221948],"about_ca_topic_score_codex":0.0010180378,"about_ca_topic_score_gemma":0.0011085062,"teacher_disagreement_score":0.0077010677,"about_ca_system_score_codex":0.0007574413,"about_ca_system_score_gemma":0.00066546636,"threshold_uncertainty_score":0.025762618},"labels":[],"label_agreement":null},{"id":"W2607019505","doi":"10.1007/978-3-319-57529-2_22","title":"Behavior-Based Location Recommendation on Location-Based Social Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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 Calgary","funders":"","keywords":"Computer science; Precision and recall; Recall; Artificial intelligence; Recommender system; Data mining; Information retrieval","score_opus":0.034031547238903115,"score_gpt":0.3164567947792123,"score_spread":0.2824252475403092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607019505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30124432,0.004774926,0.6758766,0.0010458644,0.00032175193,0.0003061318,0.0039675366,0.0021447306,0.010318126],"genre_scores_gemma":[0.90271,0.0012041549,0.08463263,0.000108669534,0.00023754449,0.00012635929,0.0035411278,0.000068853835,0.007370676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993888,0.00012561062,0.000041744945,0.00021966085,0.0001551272,0.000069101094],"domain_scores_gemma":[0.9987305,0.000729318,0.00011371472,0.00013146705,0.00023829138,0.000056820256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057770207,0.0009488536,0.0014974246,0.0022298023,0.0005406358,0.0009536203,0.0016619975,0.0011416341,0.0021415246],"category_scores_gemma":[0.0027877223,0.00044074949,0.0010522623,0.0027009824,0.0002618296,0.0015140697,0.00073631137,0.00067343115,0.0015092223],"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.00077206554,0.0009934885,0.035332695,0.00049242703,0.0006422759,0.00042880425,0.00031360844,0.32761806,0.0098278895,0.0060542827,0.015163087,0.60236126],"study_design_scores_gemma":[0.000011375618,0.000064231586,0.0041287197,0.000019332852,0.00005961318,0.00008110803,0.000042081625,0.9914818,0.00074264983,0.0025890379,0.0007654598,0.000014572591],"about_ca_topic_score_codex":0.018969173,"about_ca_topic_score_gemma":0.03392509,"teacher_disagreement_score":0.018969173,"about_ca_system_score_codex":0.0008501346,"about_ca_system_score_gemma":0.00049256085,"threshold_uncertainty_score":0.03771752},"labels":[],"label_agreement":null},{"id":"W2607059635","doi":"10.1007/978-3-319-57351-9_17","title":"Metaheuristics for Score-and-Search Bayesian Network Structure Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated local search; Metaheuristic; Computer science; Tree traversal; Bayesian network; Local search (optimization); Memetic algorithm; Margin (machine learning); Tabu search; Artificial intelligence; Hill climbing; Machine learning; Key (lock); Algorithm","score_opus":0.03626254198017136,"score_gpt":0.280775570211265,"score_spread":0.2445130282310936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607059635","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.002052228,0.0009993534,0.9933478,0.00024174066,0.00008363645,0.00005106366,0.00007252407,0.00026685468,0.0028847973],"genre_scores_gemma":[0.12578893,0.0018823973,0.86035573,0.00043411396,0.00038662722,0.0006715134,0.00053285394,0.00048900716,0.00945885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987117,0.0006516834,0.00006517396,0.00017616985,0.00028000024,0.000115362156],"domain_scores_gemma":[0.99582183,0.0033038955,0.00017556129,0.00024383269,0.00031937484,0.0001354856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003149639,0.0023539371,0.0032245293,0.0020035212,0.0010520827,0.0020393275,0.004756929,0.004447286,0.007100213],"category_scores_gemma":[0.01069005,0.0016283063,0.0021478238,0.0038047382,0.0020363543,0.0028057282,0.0030898727,0.00534318,0.0014053796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005185907,0.00007838414,0.00017197353,0.00011369888,0.00009580727,0.00002278971,0.00005189321,0.84207964,0.00024272306,0.07212662,0.0049283626,0.080036215],"study_design_scores_gemma":[0.000016311016,0.000011199945,0.000021871578,0.0000138879905,0.000008730116,0.00000661409,0.0000052805294,0.965176,0.00006541876,0.033999894,0.00066988205,0.0000049399114],"about_ca_topic_score_codex":0.00914838,"about_ca_topic_score_gemma":0.009648426,"teacher_disagreement_score":0.00914838,"about_ca_system_score_codex":0.0030478856,"about_ca_system_score_gemma":0.0028095266,"threshold_uncertainty_score":0.02375263},"labels":[],"label_agreement":null},{"id":"W2607114163","doi":"10.1007/978-3-319-57351-9_28","title":"Matrix Models with Feature Enrichment for Relation Extraction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Relationship extraction; Relation (database); Tuple; Exploit; Matrix decomposition; Information retrieval; Data mining; Artificial intelligence; Natural language processing; Mathematics","score_opus":0.027397516664761003,"score_gpt":0.2851953799147949,"score_spread":0.2577978632500339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607114163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034549828,0.00035432333,0.9901794,0.00011115846,0.000054092117,0.000068325135,0.0011733918,0.0034503283,0.0011539673],"genre_scores_gemma":[0.109510735,0.0006241459,0.8741526,0.00016286834,0.00010676848,0.00032338078,0.007913938,0.00070680893,0.006498823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989214,0.0002180877,0.000093983974,0.00031321688,0.00037515516,0.000078325655],"domain_scores_gemma":[0.99791855,0.001120114,0.000096556956,0.00044055213,0.00037830556,0.000045865534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090844417,0.0011528119,0.0012053141,0.0027522014,0.00078334357,0.0019134596,0.0022547569,0.0009517124,0.009221717],"category_scores_gemma":[0.0056265076,0.0007629487,0.0024648434,0.0038407373,0.0005011547,0.0032240008,0.0020710337,0.0014657925,0.006856955],"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.00038552238,0.00024983173,0.0018204763,0.0005851339,0.0003462981,0.00039602508,0.00028402967,0.062164064,0.010638312,0.062601455,0.028666323,0.8318625],"study_design_scores_gemma":[0.000030761537,0.000059929826,0.0004907228,0.00006847623,0.00012998706,0.00029672528,0.00009407593,0.8484848,0.0067264754,0.1240676,0.01951237,0.00003808064],"about_ca_topic_score_codex":0.005378455,"about_ca_topic_score_gemma":0.010416407,"teacher_disagreement_score":0.009221717,"about_ca_system_score_codex":0.00058244355,"about_ca_system_score_gemma":0.0010742004,"threshold_uncertainty_score":0.030849695},"labels":[],"label_agreement":null},{"id":"W2607217863","doi":"10.1007/978-3-319-57351-9_35","title":"Resolving Inconsistencies of Scope Interpretations in Sum-Product Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scope (computer science); Computer science; Interpretation (philosophy); Completeness (order theory); Inference; Consistency (knowledge bases); Product (mathematics); Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Programming language","score_opus":0.029118457479780712,"score_gpt":0.2686834118744588,"score_spread":0.23956495439467812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607217863","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.078923725,0.0011995994,0.896823,0.0029070766,0.00020318222,0.00010988082,0.0007222711,0.001063225,0.018048039],"genre_scores_gemma":[0.6724677,0.0007071664,0.31986815,0.0004562773,0.00021350075,0.00016893535,0.0012702686,0.00084895216,0.003998963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98651516,0.006539432,0.0010819966,0.0022457035,0.0030833108,0.0005343093],"domain_scores_gemma":[0.92073786,0.0643314,0.0029448252,0.006842453,0.0043051755,0.00083827047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011447166,0.0012759307,0.0018665768,0.003651933,0.0032679602,0.006630853,0.00498712,0.0042982837,0.0068832007],"category_scores_gemma":[0.10143263,0.0023006257,0.0018822226,0.0051784916,0.0058515165,0.02425464,0.009604248,0.006139253,0.000951299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028161492,0.0000427669,0.0029668524,0.00033399093,0.00012394595,0.0008798193,0.0036080068,0.021239312,0.0011509042,0.89655817,0.004122975,0.06869162],"study_design_scores_gemma":[0.000015186981,0.000006434277,0.00013033004,0.00007131466,0.000060511837,0.00013368501,0.00041200963,0.03579191,0.00089412497,0.9592704,0.003196482,0.000017622315],"about_ca_topic_score_codex":0.0030278636,"about_ca_topic_score_gemma":0.0035287798,"teacher_disagreement_score":0.011447166,"about_ca_system_score_codex":0.0019707482,"about_ca_system_score_gemma":0.0014929061,"threshold_uncertainty_score":0.060539126},"labels":[],"label_agreement":null},{"id":"W2607335953","doi":"10.1007/978-3-319-57586-5_1","title":"TFNP: An Update","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Computer science; Witness; Class (philosophy); Quarter (Canadian coin); Mathematical economics; Subclass; Theoretical computer science; Operations research; Artificial intelligence; Programming language; History; Mathematics; Archaeology","score_opus":0.07810769135092134,"score_gpt":0.3715449250144917,"score_spread":0.2934372336635704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607335953","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023160065,0.20512728,0.048394904,0.059179246,0.13591439,0.00024062501,0.010155256,0.005693674,0.5329786],"genre_scores_gemma":[0.0128661385,0.22205915,0.051568564,0.021069229,0.04431243,0.0005071876,0.022069685,0.0050067883,0.6205408],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840444,0.00016897448,0.00012879481,0.0002531322,0.0008557197,0.0001888957],"domain_scores_gemma":[0.992991,0.0010282125,0.00018907197,0.00072014966,0.004050535,0.0010211274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035756496,0.0011877844,0.0011601296,0.004865182,0.0011709515,0.006142576,0.00392078,0.0026430753,0.11447724],"category_scores_gemma":[0.013042643,0.0005314828,0.00081333326,0.006894093,0.0011418229,0.011421758,0.0036544236,0.003469436,0.09667773],"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.00004110513,0.00003930756,0.00006908575,0.0004400331,0.0000052634387,0.000042635536,0.000020145673,0.00029771245,0.00011605855,0.0068224184,0.613884,0.37822223],"study_design_scores_gemma":[0.00000445817,0.000008560524,0.000050274768,0.000228659,0.0000040899627,0.000104856175,0.000010323462,0.00012340653,0.0000795981,0.0023240543,0.9970567,0.0000050006865],"about_ca_topic_score_codex":0.007837199,"about_ca_topic_score_gemma":0.009830436,"teacher_disagreement_score":0.11447724,"about_ca_system_score_codex":0.0031762107,"about_ca_system_score_gemma":0.0060173557,"threshold_uncertainty_score":0.38296455},"labels":[],"label_agreement":null},{"id":"W2607410741","doi":"10.1007/978-3-319-57351-9_11","title":"Classification of Imbalanced Auction Fraud Data","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Bidding; Class (philosophy); Binary classification; Sampling (signal processing); Set (abstract data type); Data mining; Domain (mathematical analysis); Artificial intelligence; Machine learning; Support vector machine","score_opus":0.055256731834891215,"score_gpt":0.30805407415858066,"score_spread":0.25279734232368944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607410741","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.6909562,0.006020907,0.27643162,0.005112827,0.0015748087,0.0005554217,0.0084646,0.0018226268,0.009061012],"genre_scores_gemma":[0.8930616,0.0011995138,0.084623925,0.00036001703,0.000814762,0.00018003624,0.013380964,0.00013449775,0.0062446985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947173,0.0013709938,0.00048383567,0.0006536046,0.0022127235,0.00056160026],"domain_scores_gemma":[0.9888285,0.004867183,0.0012975454,0.0025363832,0.0019166286,0.0005537419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078237355,0.001119278,0.001569978,0.005459469,0.0008513928,0.0033016643,0.002097008,0.0016987458,0.0014755412],"category_scores_gemma":[0.021153662,0.00038544266,0.00087487896,0.0043956283,0.0008350334,0.003307961,0.0019917258,0.0024439238,0.0011021218],"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.0018356324,0.0016834094,0.12776536,0.00051235483,0.00041288807,0.00081597664,0.0005721261,0.08269315,0.0038808174,0.019890288,0.061625235,0.69831276],"study_design_scores_gemma":[0.000073643845,0.00020366654,0.021002583,0.00014100481,0.000078212535,0.0008579614,0.0004995223,0.9103201,0.0059820376,0.045742255,0.015054232,0.000044775115],"about_ca_topic_score_codex":0.001106876,"about_ca_topic_score_gemma":0.0011538408,"teacher_disagreement_score":0.0078237355,"about_ca_system_score_codex":0.0012287819,"about_ca_system_score_gemma":0.0009890684,"threshold_uncertainty_score":0.041376352},"labels":[],"label_agreement":null},{"id":"W2607413825","doi":"10.1007/978-3-319-57351-9_38","title":"Fuzzy Rough Set-Based Unstructured Text Categorization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Winnipeg","funders":"","keywords":"Computer science; Rough set; Categorical variable; Noun phrase; Artificial intelligence; Categorization; Phrase; Set (abstract data type); Fuzzy set; Fuzzy logic; Data mining; Natural language processing; Machine learning; Noun","score_opus":0.021506013621809945,"score_gpt":0.24898911343475502,"score_spread":0.22748309981294507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607413825","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.03231005,0.0028005491,0.9554561,0.0003214913,0.0004281852,0.00043595635,0.0012358052,0.0019905881,0.0050212927],"genre_scores_gemma":[0.35686535,0.0017320903,0.6271308,0.00025892947,0.00040960097,0.0005229068,0.0048464327,0.00019202444,0.008041881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976382,0.00048490064,0.00029106622,0.0003901075,0.0010109243,0.00018482603],"domain_scores_gemma":[0.9977754,0.0010532734,0.00014397273,0.00023040945,0.00072223606,0.000074770614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016056088,0.00092776364,0.0020890287,0.005646394,0.001112032,0.002614584,0.0017629091,0.0009556527,0.0034079058],"category_scores_gemma":[0.0054066433,0.00027680848,0.0020038863,0.0037722238,0.0005540245,0.002653351,0.0014511102,0.0011519953,0.0018903203],"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.00046286976,0.00031469937,0.00113144,0.0006209573,0.0002499387,0.0002580847,0.00040498332,0.030771881,0.011891255,0.010964422,0.013533741,0.92939574],"study_design_scores_gemma":[0.00006278354,0.00034866075,0.003440546,0.0001949148,0.00034646594,0.00045578636,0.0005816698,0.90863657,0.016420517,0.056266673,0.013123473,0.00012199644],"about_ca_topic_score_codex":0.0030915136,"about_ca_topic_score_gemma":0.0021291685,"teacher_disagreement_score":0.005646394,"about_ca_system_score_codex":0.00090947613,"about_ca_system_score_gemma":0.0011781035,"threshold_uncertainty_score":0.011400521},"labels":[],"label_agreement":null},{"id":"W2607475845","doi":"10.1007/978-3-319-57351-9_46","title":"Deep Multi-cultural Graph Representation Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Dalhousie University","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Jaccard index; Similarity (geometry); Graph; Representation (politics); German; Knowledge representation and reasoning; Information retrieval; Pattern recognition (psychology); Theoretical computer science; Linguistics","score_opus":0.04364916223908568,"score_gpt":0.2978275706104297,"score_spread":0.25417840837134403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607475845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02486476,0.0049348306,0.9483993,0.0014019926,0.0003912443,0.00004694889,0.0009625284,0.003412606,0.015585735],"genre_scores_gemma":[0.5108972,0.006612881,0.42582723,0.0007948898,0.00039124727,0.00012564012,0.008010176,0.0009033415,0.046437345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.00006070761,0.0000072920484,0.000066799206,0.00003328086,0.000026771853],"domain_scores_gemma":[0.9995939,0.0001615619,0.000025734636,0.00012641883,0.000059393424,0.00003301703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003570804,0.00094022683,0.0006384145,0.0009828213,0.00038908218,0.0011925522,0.0013503773,0.0012632181,0.0054573617],"category_scores_gemma":[0.0015758248,0.000429043,0.0010792362,0.0019219677,0.00048086958,0.0024431997,0.0012724518,0.0022880407,0.0026740194],"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.000071198185,0.00012280798,0.0010060822,0.00028775434,0.00017927871,0.00010342534,0.00020888606,0.116824925,0.006458621,0.063914075,0.041984677,0.7688383],"study_design_scores_gemma":[0.000009681153,0.000031346783,0.00050205196,0.00006467395,0.00004833989,0.00011681126,0.00007220952,0.8817832,0.0027767448,0.10026906,0.014305568,0.000020373594],"about_ca_topic_score_codex":0.0052073617,"about_ca_topic_score_gemma":0.012619392,"teacher_disagreement_score":0.0054573617,"about_ca_system_score_codex":0.0008399912,"about_ca_system_score_gemma":0.00051654375,"threshold_uncertainty_score":0.018256724},"labels":[],"label_agreement":null},{"id":"W2608682909","doi":"10.1007/978-3-319-58187-3_16","title":"Descrambling Order Analysis in Ciliates","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","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":"Computer science; Interleaving; Phylogenetic tree; Sequence (biology); Transformation (genetics); Order (exchange); Genome; Chromosome; Maximum parsimony; Algorithm; Theoretical computer science; Biology; Genetics; Gene","score_opus":0.018434193363976278,"score_gpt":0.25270876405470044,"score_spread":0.23427457069072416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608682909","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.6790011,0.0015853298,0.30038613,0.0002412114,0.00009909649,0.000055907287,0.0016626833,0.0014633497,0.015505316],"genre_scores_gemma":[0.8413807,0.00060063414,0.14570399,0.000044643515,0.00003836327,0.000023466477,0.0036230094,0.00029169393,0.00829352],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998153,0.00001964557,0.00002018304,0.00004519798,0.00007117112,0.000028623717],"domain_scores_gemma":[0.9994685,0.00019103104,0.000051973322,0.00009184249,0.00013826099,0.00005851414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022642832,0.00023371296,0.00030163492,0.0017737562,0.00060212734,0.0008212978,0.00052489847,0.00025692582,0.002670287],"category_scores_gemma":[0.0011517,0.00014950274,0.00047434258,0.0010607394,0.00049002573,0.00061041483,0.00058389147,0.00035009132,0.00082333124],"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.0006076546,0.000091333844,0.034684002,0.00059138204,0.00006629329,0.001060545,0.0014725009,0.045750476,0.153251,0.11466942,0.0063127154,0.64144266],"study_design_scores_gemma":[0.000025135214,0.00027855224,0.05861491,0.000117520845,0.00009162314,0.0012765572,0.0013240488,0.6712211,0.07367808,0.16868277,0.024587762,0.00010206806],"about_ca_topic_score_codex":0.0037782893,"about_ca_topic_score_gemma":0.004925826,"teacher_disagreement_score":0.0037782893,"about_ca_system_score_codex":0.0005019519,"about_ca_system_score_gemma":0.00053787715,"threshold_uncertainty_score":0.008933008},"labels":[],"label_agreement":null},{"id":"W2609863366","doi":"10.1007/978-3-319-57418-9_3","title":"Relations as Images","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Dilation (metric space); Computer science; Mathematical morphology; Pixel; MATLAB; Representation (politics); Graph; Artificial intelligence; Theoretical computer science; Image processing; Image (mathematics); Mathematics; Combinatorics","score_opus":0.019941093665529756,"score_gpt":0.25957372424754394,"score_spread":0.23963263058201417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609863366","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0182055,0.013941918,0.15317473,0.0047387807,0.0017107932,0.00008958266,0.00091195805,0.00074537686,0.80648136],"genre_scores_gemma":[0.46476585,0.016368814,0.11500165,0.0014813024,0.0026262724,0.0002717969,0.0024872138,0.0008014671,0.39619565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958295,0.00009244356,0.00002524773,0.00012263974,0.00013304943,0.000043577926],"domain_scores_gemma":[0.9997235,0.00009667867,0.000024430376,0.00006928071,0.00005956836,0.000026462458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034751455,0.00053654605,0.0004500673,0.0018361903,0.0009580175,0.004517508,0.0006513421,0.00076268625,0.023474263],"category_scores_gemma":[0.0013043103,0.00039306976,0.00046137665,0.0016683587,0.003089469,0.0076501556,0.0013967814,0.0019380519,0.005737614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006340396,0.0000023282255,0.000015473921,0.00003197208,0.0000022556703,0.000015759866,0.0001633576,0.00011348715,0.0003271806,0.9810095,0.0040331343,0.014279198],"study_design_scores_gemma":[0.0000035583837,0.0000059388094,0.00006030397,0.000028007815,0.000006664066,0.0000941364,0.00013375959,0.0006289717,0.00050047535,0.8872374,0.11129553,0.000005246527],"about_ca_topic_score_codex":0.00092999614,"about_ca_topic_score_gemma":0.00075956015,"teacher_disagreement_score":0.023474263,"about_ca_system_score_codex":0.0010851977,"about_ca_system_score_gemma":0.00033029943,"threshold_uncertainty_score":0.0785293},"labels":[],"label_agreement":null},{"id":"W2610204387","doi":"10.1007/978-3-319-57837-8_8","title":"Reasoning in Epistemic Contexts","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Université de Sherbrooke","funders":"","keywords":"Introspection; Computer science; Epistemology; Epistemic modal logic; Closure (psychology); Artificial intelligence; Philosophy; Description logic","score_opus":0.017853667270208852,"score_gpt":0.25720584221088527,"score_spread":0.23935217494067643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610204387","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.008434612,0.016384635,0.4752857,0.008170827,0.00087148004,0.000075900534,0.00043650757,0.00065295055,0.48968735],"genre_scores_gemma":[0.641384,0.014788333,0.22145577,0.0021467563,0.0017516526,0.0003057036,0.0020064993,0.0005017009,0.11565962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977604,0.0010742372,0.00016845789,0.00037078926,0.0004830901,0.00014301541],"domain_scores_gemma":[0.9981996,0.0011736195,0.00006802903,0.00033255073,0.00016196443,0.00006419672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118341,0.0014451307,0.0008614287,0.0016729031,0.0018703367,0.0074499943,0.0015555203,0.0021254052,0.0136327185],"category_scores_gemma":[0.005462675,0.00096066133,0.0016213445,0.0015657322,0.0061607417,0.012411646,0.003769582,0.0050489176,0.004076124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009306181,0.000008881679,0.000038264763,0.00007185339,0.000011924465,0.000030979656,0.0003181618,0.0005135086,0.00011746049,0.9835894,0.0035319617,0.011758355],"study_design_scores_gemma":[0.0000029458251,0.0000019462434,0.000018152208,0.00004068972,0.00000550319,0.000028237677,0.00005176303,0.00068415387,0.0001272361,0.98545945,0.013576532,0.0000033534172],"about_ca_topic_score_codex":0.0009912617,"about_ca_topic_score_gemma":0.0010765443,"teacher_disagreement_score":0.0136327185,"about_ca_system_score_codex":0.0016895965,"about_ca_system_score_gemma":0.00089649286,"threshold_uncertainty_score":0.045605958},"labels":[],"label_agreement":null},{"id":"W2610319586","doi":"10.1007/978-3-319-57837-8_42","title":"Elaborating the Context Calculator: A Design Experiment in Geothermy","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Calculator; Context (archaeology); Computer science; Process (computing); Meaning (existential); Object (grammar); Mathematics education; Software; Intersection (aeronautics); Human–computer interaction; Software engineering; Data science; Engineering; Artificial intelligence; Psychology; Programming language; Geography","score_opus":0.06911835418286172,"score_gpt":0.37633614594019554,"score_spread":0.3072177917573338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610319586","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.7775824,0.00030129484,0.19729471,0.00057206175,0.00023280653,0.0073606456,0.00042428586,0.0014666019,0.014765076],"genre_scores_gemma":[0.63618964,0.00018233663,0.34427655,0.0005038885,0.000040298186,0.011239281,0.00031810964,0.0006804146,0.0065694298],"study_design_codex":"design_other","study_design_gemma":"design_other","domain_scores_codex":[0.99579996,0.0025308034,0.00023424372,0.00092881394,0.00032223627,0.00018396541],"domain_scores_gemma":[0.9745274,0.022077406,0.00036541757,0.0022215608,0.00047211625,0.00033620629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005729538,0.00093939103,0.0010555651,0.00035228493,0.0013743588,0.002238985,0.0024602134,0.0020480908,0.0153572485],"category_scores_gemma":[0.02756349,0.0008549686,0.0006324099,0.00041783106,0.0016874045,0.0030188032,0.0022151836,0.0018914407,0.002307248],"study_design_candidate":"design_other","study_design_consensus":"design_other","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02746994,0.026182938,0.01054775,0.004594326,0.00026669676,0.0010876387,0.08976583,0.017131785,0.20554948,0.09429464,0.0068154964,0.5162935],"study_design_scores_gemma":[0.030070148,0.07086863,0.046937384,0.0014593083,0.0025875454,0.0022062305,0.02297768,0.12982993,0.34386694,0.1843639,0.16366565,0.0011666903],"about_ca_topic_score_codex":0.0007618817,"about_ca_topic_score_gemma":0.00083923404,"teacher_disagreement_score":0.0153572485,"about_ca_system_score_codex":0.0006342748,"about_ca_system_score_gemma":0.0011145931,"threshold_uncertainty_score":0.05137515},"labels":[],"label_agreement":null},{"id":"W2611957621","doi":"10.1007/978-3-319-58747-9_20","title":"The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\\mathsf {T}}}{{\\mathsf {C}}}^0$$","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geometric and Algebraic Topology","field":"Mathematics","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":"Champlain Regional College","funders":"","keywords":"Conjugacy problem; Wreath product; Abelian group; Iterated function; Combinatorics; Conjugacy class; Mathematics; Product (mathematics); Mathematical analysis; Geometry","score_opus":0.026360128821350304,"score_gpt":0.266095211976629,"score_spread":0.2397350831552787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611957621","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.17979588,0.008426974,0.10869279,0.020139314,0.0036488224,0.00011295049,0.00051128387,0.0006233809,0.6780486],"genre_scores_gemma":[0.60756505,0.005250881,0.021031322,0.0017194215,0.0024956276,0.00015769107,0.00075447187,0.00059376506,0.3604318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996159,0.000070133756,0.000023784223,0.000088514695,0.00012936111,0.00007215558],"domain_scores_gemma":[0.9996884,0.0001652154,0.000025021465,0.000060512146,0.000028409579,0.000032525582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054784026,0.00074227364,0.0009848474,0.00080837315,0.0024453052,0.0047464343,0.0010791648,0.0016241001,0.012482655],"category_scores_gemma":[0.0015736776,0.00043321628,0.0009875044,0.0015911334,0.0044010486,0.008641199,0.002376823,0.0038228743,0.003338701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022044247,0.000015454827,0.00007450805,0.000041872827,0.0000054923516,0.00005149635,0.00032577844,0.00023513818,0.00031740827,0.97880644,0.005529652,0.0145748],"study_design_scores_gemma":[0.000008168852,0.000005909513,0.000052857962,0.000009959821,0.000003668842,0.00006232563,0.00009265765,0.0003667401,0.00035525014,0.9826309,0.016406499,0.000005196728],"about_ca_topic_score_codex":0.00082612457,"about_ca_topic_score_gemma":0.00097119756,"teacher_disagreement_score":0.012482655,"about_ca_system_score_codex":0.0014599625,"about_ca_system_score_gemma":0.0009926278,"threshold_uncertainty_score":0.041758597},"labels":[],"label_agreement":null},{"id":"W2611992378","doi":"10.1007/978-3-319-58530-7_6","title":"Co-creation Methods: Informing Technology Solutions for Older Adults","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Approaches in Technology and Social Development","field":"Business, Management and Accounting","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":"Simon Fraser University","funders":"","keywords":"Redevelopment; Excellence; Computer science; Process (computing); Participatory action research; Knowledge management; Participatory evaluation; Citizen journalism; Engineering management; Sociology; Engineering; Political science; World Wide Web","score_opus":0.02867300917801423,"score_gpt":0.3106422535687211,"score_spread":0.28196924439070686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611992378","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25034732,0.11814364,0.16599914,0.048343897,0.0055018226,0.0012233875,0.0011354426,0.0010288451,0.4082765],"genre_scores_gemma":[0.58850163,0.05711222,0.17395435,0.005309696,0.0011544557,0.0015677981,0.00089420064,0.00036165566,0.17114407],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9985483,0.0007425425,0.000093926654,0.0001322826,0.00038746576,0.0000953825],"domain_scores_gemma":[0.9940912,0.003944868,0.00043372848,0.0003671195,0.00057535246,0.00058769423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043777972,0.0005203724,0.00030516967,0.0013284549,0.0011525879,0.0036859787,0.0008727534,0.0014147527,0.010241407],"category_scores_gemma":[0.009760279,0.00014859175,0.00030186912,0.0013361363,0.001412195,0.004940144,0.003130547,0.0010655554,0.002285573],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008469052,0.00023737324,0.00763312,0.0013378484,0.000032201533,0.00028906466,0.05810776,0.00012204649,0.001385862,0.026710883,0.051007845,0.8530513],"study_design_scores_gemma":[0.000063171734,0.00038404178,0.014898894,0.0046973303,0.00008564915,0.002103278,0.06677568,0.0010563966,0.0026956382,0.07974225,0.8274244,0.000073317606],"about_ca_topic_score_codex":0.00088178297,"about_ca_topic_score_gemma":0.0023973146,"teacher_disagreement_score":0.010241407,"about_ca_system_score_codex":0.0007265256,"about_ca_system_score_gemma":0.002127289,"threshold_uncertainty_score":0.03426099},"labels":[],"label_agreement":null},{"id":"W2612017095","doi":"10.1007/978-3-642-16145-2","title":"Model Driven Engineering Languages and Systems","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software engineering; Software; Series (stratigraphy); Programming language; Engineering management; Engineering","score_opus":0.009375428221816246,"score_gpt":0.23511812070658078,"score_spread":0.22574269248476453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612017095","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014799365,0.007348063,0.9376763,0.0009965497,0.0006484732,0.000072015304,0.00015867206,0.0019513841,0.049668558],"genre_scores_gemma":[0.077819094,0.023085125,0.6922577,0.0014380728,0.0009482536,0.00071888143,0.00157564,0.0029218646,0.19923535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991084,0.00018055763,0.000055031476,0.00009567019,0.0005228292,0.00003752964],"domain_scores_gemma":[0.99912924,0.00050632405,0.000045630353,0.00015423275,0.00013858575,0.000026004649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510777,0.001462869,0.00086263125,0.0011083358,0.00041723304,0.0026147868,0.0011559536,0.0011044003,0.009620572],"category_scores_gemma":[0.0022601085,0.0009932427,0.0009013278,0.0018714587,0.0010408999,0.00358703,0.0014357953,0.0029924945,0.0042360323],"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.00002278371,0.00006322697,0.00011309435,0.0005945016,0.000038392714,0.000091932256,0.00023410172,0.01581644,0.0031477823,0.72922903,0.036350492,0.21429822],"study_design_scores_gemma":[0.000027124217,0.00004608347,0.00010978762,0.00025724177,0.000032225984,0.0003868761,0.0000495132,0.042926237,0.0028980563,0.6159868,0.33724895,0.00003103603],"about_ca_topic_score_codex":0.00059413555,"about_ca_topic_score_gemma":0.0007369147,"teacher_disagreement_score":0.009620572,"about_ca_system_score_codex":0.0007577835,"about_ca_system_score_gemma":0.0010401362,"threshold_uncertainty_score":0.032184064},"labels":[],"label_agreement":null},{"id":"W2612129169","doi":"10.1007/978-3-319-57931-3_36","title":"Designing to Support Community Gardens by Going Beyond Community Gardens","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sociotechnical system; Computer science; Theme (computing); Work (physics); Community building; Community organization; Space (punctuation); Community design; Inclusion (mineral); Knowledge management; Sociology; Architectural engineering; Public relations; World Wide Web; Political science; Engineering","score_opus":0.03981454644988982,"score_gpt":0.2963767537151326,"score_spread":0.2565622072652428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612129169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16321926,0.0011597706,0.46991244,0.0069198906,0.0009497529,0.0008181084,0.00024141252,0.00361049,0.3531689],"genre_scores_gemma":[0.5523553,0.00062018825,0.34769598,0.0010769434,0.00007782796,0.0005889904,0.00037454272,0.0006479219,0.0965624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992323,0.00026309592,0.000019300262,0.00011845574,0.00016725532,0.00019961013],"domain_scores_gemma":[0.99906605,0.00019893218,0.000048378522,0.00013003907,0.00014596932,0.00041060962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087082863,0.0006520734,0.0002236231,0.0005128261,0.003061837,0.0033476525,0.0019241011,0.0017506559,0.017239675],"category_scores_gemma":[0.0017116724,0.00046608865,0.00051845936,0.00057283504,0.0011680574,0.0050235805,0.004738325,0.0014115685,0.003958585],"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.00025571656,0.0014949446,0.008633887,0.0013631189,0.000100693374,0.0015443809,0.052439533,0.005605735,0.03828709,0.11499059,0.10030001,0.67498434],"study_design_scores_gemma":[0.000092378636,0.0002740471,0.005117943,0.00050470873,0.000076213655,0.00085367577,0.037798114,0.008790993,0.0062273103,0.051101975,0.8890783,0.00008423284],"about_ca_topic_score_codex":0.0028162918,"about_ca_topic_score_gemma":0.00990163,"teacher_disagreement_score":0.017239675,"about_ca_system_score_codex":0.00078677887,"about_ca_system_score_gemma":0.0018270339,"threshold_uncertainty_score":0.05767238},"labels":[],"label_agreement":null},{"id":"W2612171034","doi":"10.1007/978-3-642-32355-3","title":"Foundations of Health Informatics Engineering and Systems","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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":"McMaster University","funders":"","keywords":"Health informatics; Informatics; Engineering informatics; Engineering ethics; Computer science; Systems engineering; Engineering management; Engineering; Medicine; Nursing; Electrical engineering; Public health","score_opus":0.04837449212737846,"score_gpt":0.3777951840306273,"score_spread":0.32942069190324885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612171034","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030541308,0.06806487,0.5598493,0.023092361,0.0029124226,0.00015205874,0.00047488985,0.0007067792,0.3416932],"genre_scores_gemma":[0.2233407,0.10867332,0.49947223,0.0051248013,0.010196682,0.0006659991,0.0007497225,0.00026334755,0.15151317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890924,0.00032526263,0.00007859332,0.0001272927,0.00047795923,0.00008166943],"domain_scores_gemma":[0.9966523,0.0023487133,0.000117482705,0.00035973577,0.00041964583,0.00010213891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017232291,0.000651221,0.0006482228,0.0014606926,0.00077699014,0.0044447402,0.00096659624,0.001430169,0.009819052],"category_scores_gemma":[0.0046929168,0.00053377193,0.00062201795,0.001521137,0.0033271317,0.0030807792,0.0012730173,0.002945394,0.0031023547],"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.0000045998463,0.000025796637,0.00013255583,0.00017162261,0.000010260049,0.00003435236,0.0001697442,0.0014550256,0.00014779228,0.92605823,0.017800229,0.053989828],"study_design_scores_gemma":[0.000006626972,0.00001003046,0.00020193458,0.00015039585,0.0000074675513,0.000080132675,0.00006341247,0.0046650534,0.00015751779,0.84512377,0.14952444,0.000009199579],"about_ca_topic_score_codex":0.0023505935,"about_ca_topic_score_gemma":0.0015102646,"teacher_disagreement_score":0.009819052,"about_ca_system_score_codex":0.0017398637,"about_ca_system_score_gemma":0.0024113974,"threshold_uncertainty_score":0.032848},"labels":[],"label_agreement":null},{"id":"W2612173992","doi":"10.1007/978-3-319-58536-9_24","title":"Employing a User-Centered Design Process to Create a Multiplayer Online Escape Game for Older Adults","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science; Theme (computing); Process (computing); Multimedia; User-centered design; Human–computer interaction; Game design; World Wide Web","score_opus":0.04208336561165491,"score_gpt":0.3291631501616212,"score_spread":0.28707978454996624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612173992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14734225,0.00022267851,0.8176105,0.00048953923,0.00023350467,0.0031666253,0.00011616563,0.00223362,0.028585106],"genre_scores_gemma":[0.2428869,0.0001785199,0.7377824,0.0003619589,0.000027986449,0.0031393927,0.00014009062,0.00038624377,0.015096475],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99829334,0.0008960841,0.00008697076,0.00025662468,0.00035103862,0.00011589286],"domain_scores_gemma":[0.997253,0.0015816044,0.00014205188,0.00018365425,0.0005525055,0.00028717305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003468999,0.0014090892,0.0003051359,0.00079046417,0.0009949233,0.0028244979,0.00168353,0.00083955267,0.0058974614],"category_scores_gemma":[0.0059012896,0.00045954675,0.00059090945,0.00024054493,0.0009079008,0.0015090873,0.0024414652,0.001301768,0.001508764],"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.0011433138,0.006005626,0.008299541,0.0029855345,0.0002201348,0.0011200679,0.11795174,0.006106263,0.1349291,0.055454895,0.020002242,0.6457815],"study_design_scores_gemma":[0.0017776309,0.012966465,0.028369,0.0025157803,0.0010141588,0.004555503,0.049720284,0.12742706,0.14464782,0.06658449,0.55963475,0.0007871487],"about_ca_topic_score_codex":0.00052860484,"about_ca_topic_score_gemma":0.0015402472,"teacher_disagreement_score":0.0058974614,"about_ca_system_score_codex":0.00046420994,"about_ca_system_score_gemma":0.001093005,"threshold_uncertainty_score":0.019728959},"labels":[],"label_agreement":null},{"id":"W2612569538","doi":"10.1007/978-3-319-58466-9_37","title":"ECG Identification Based on PCA-RPROP","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ECG Monitoring and Analysis","field":"Medicine","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":"Athabasca University","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Redundancy (engineering); Data mining; Feature selection; Rprop; Feature extraction; Machine learning; Artificial neural network; Recurrent neural network","score_opus":0.025087214340922013,"score_gpt":0.2915098952617813,"score_spread":0.26642268092085925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612569538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011406011,0.0023322434,0.9735377,0.00021475083,0.00043303196,0.00013781432,0.00034673986,0.0029433887,0.008648308],"genre_scores_gemma":[0.18656231,0.0030422662,0.7917838,0.00033738595,0.00053716043,0.00016274102,0.0011024056,0.00036878168,0.016103093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996456,0.00004844981,0.000021265094,0.00010659839,0.00015231132,0.000025795973],"domain_scores_gemma":[0.9997658,0.00006376947,0.000014586281,0.000043013322,0.00010298758,0.000009896452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028162432,0.00088973786,0.00070973433,0.0007981004,0.0003124838,0.0007666733,0.0005245149,0.0007950671,0.0055653234],"category_scores_gemma":[0.00084086973,0.00028469376,0.00063463213,0.0008727791,0.00021671384,0.00072301005,0.000508471,0.00068030437,0.0052931686],"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.00017979062,0.00006302865,0.00083638035,0.00027942494,0.00006223865,0.00021437641,0.000036681915,0.0024943952,0.10554063,0.0012893633,0.0064126956,0.88259095],"study_design_scores_gemma":[0.000090957496,0.00055503857,0.030715574,0.00023143715,0.0003786814,0.007963745,0.000121913465,0.64275944,0.25934145,0.0075811874,0.050042216,0.00021832224],"about_ca_topic_score_codex":0.0004000228,"about_ca_topic_score_gemma":0.00095889275,"teacher_disagreement_score":0.0055653234,"about_ca_system_score_codex":0.00008080496,"about_ca_system_score_gemma":0.00023215388,"threshold_uncertainty_score":0.018617809},"labels":[],"label_agreement":null},{"id":"W2612679435","doi":"10.1007/978-3-319-58481-2_27","title":"Is Augmented Reality Leading to More Risky Behaviors? An Experiment with Pokémon Go","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Augmented reality; Computer science; Human–computer interaction; Psychology","score_opus":0.041358345559781184,"score_gpt":0.3338770007439603,"score_spread":0.29251865518417913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612679435","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.9970421,0.000027698818,0.00030998417,0.00015379627,0.00003867513,0.00007315331,0.0001019931,0.000059326325,0.0021933],"genre_scores_gemma":[0.9887022,0.000136744,0.0022755668,0.00041141245,0.00003350065,0.0003371226,0.00033880826,0.00006168733,0.007702924],"study_design_codex":"nonrandomized_trial","study_design_gemma":"observational","domain_scores_codex":[0.99954766,0.0001539675,0.000022863454,0.000104164516,0.00009967327,0.00007172538],"domain_scores_gemma":[0.99418443,0.003955738,0.00030791856,0.00073982927,0.00013290593,0.0006792802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278855,0.0009845782,0.00072848523,0.0004318809,0.0011365196,0.0015146241,0.0010613591,0.0023950122,0.018238429],"category_scores_gemma":[0.009253585,0.0005804642,0.00048443308,0.00028836716,0.0011797004,0.0014277622,0.0015424143,0.001664551,0.002183002],"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.10330037,0.3308355,0.12931542,0.0028719367,0.0013661215,0.007628169,0.059856232,0.007315551,0.112048596,0.014235787,0.026329292,0.20489699],"study_design_scores_gemma":[0.02124751,0.30148247,0.48419982,0.0008135667,0.001917548,0.0043459344,0.04541252,0.040695373,0.02246663,0.03092665,0.04577786,0.0007141027],"about_ca_topic_score_codex":0.00164465,"about_ca_topic_score_gemma":0.0014287457,"teacher_disagreement_score":0.018238429,"about_ca_system_score_codex":0.00018307623,"about_ca_system_score_gemma":0.00043491126,"threshold_uncertainty_score":0.06101364},"labels":[],"label_agreement":null},{"id":"W2612802052","doi":"10.1007/978-3-319-58640-3_53","title":"Case Study: Building UX Design into Citizen Science Applications","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Mount Royal University","funders":"Shell Canada; Mount Royal University; Calgary Foundation; Cenovus Energy","keywords":"Computer science; Human–computer interaction; Citizen science; Software engineering","score_opus":0.05265127933861629,"score_gpt":0.341676094399797,"score_spread":0.2890248150611807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612802052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4217633,0.00063794054,0.49236774,0.0037402457,0.0002767766,0.0025795428,0.0007695567,0.0026249355,0.07524008],"genre_scores_gemma":[0.5683826,0.00030729722,0.40871897,0.00040926624,0.000027677752,0.0010439345,0.0005482189,0.0004829245,0.02007915],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99553055,0.002990054,0.00016395091,0.00036098022,0.00068916986,0.00026538744],"domain_scores_gemma":[0.99013597,0.006659704,0.0002749058,0.001466114,0.0009930705,0.00047032814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044431016,0.0009856321,0.0003866232,0.0009944404,0.0025526467,0.004201326,0.0013041936,0.0022295837,0.008103725],"category_scores_gemma":[0.011755264,0.00056746684,0.00068417005,0.00086492795,0.0021470923,0.004109412,0.0031241432,0.001883904,0.0014458272],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012325373,0.007416635,0.027525904,0.0035279393,0.00017093573,0.0046417695,0.14739543,0.018247886,0.07134976,0.17332977,0.03469916,0.5104623],"study_design_scores_gemma":[0.0006489378,0.005484358,0.022700755,0.0028706468,0.00044389992,0.00446155,0.09879122,0.12935725,0.1371895,0.09153893,0.50620306,0.0003099636],"about_ca_topic_score_codex":0.00253739,"about_ca_topic_score_gemma":0.004454455,"teacher_disagreement_score":0.008103725,"about_ca_system_score_codex":0.0016040334,"about_ca_system_score_gemma":0.0021278984,"threshold_uncertainty_score":0.027109683},"labels":[],"label_agreement":null},{"id":"W2612844530","doi":"10.1007/978-3-319-59876-5_7","title":"Discovery Radiomics for Pathologically-Proven Computed Tomography Lung Cancer Prediction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sunnybrook Health Science Centre; Health Sciences Centre; University of Toronto; University of Waterloo","funders":"","keywords":"Radiomics; Convolutional neural network; Computer science; Artificial intelligence; Lung cancer; Data set; Ground truth; Deep learning; Pattern recognition (psychology); Machine learning; Medicine; Pathology","score_opus":0.01339840697618723,"score_gpt":0.28930340488189615,"score_spread":0.27590499790570894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612844530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04079325,0.042860396,0.883705,0.0026000456,0.0010489301,0.00013263691,0.002110579,0.0038737536,0.02287538],"genre_scores_gemma":[0.5774256,0.025014017,0.36992458,0.001010359,0.0018592858,0.00016833351,0.0039481027,0.00061472284,0.020035028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994911,0.00009646005,0.000029410126,0.00013498281,0.0002061456,0.000041836392],"domain_scores_gemma":[0.998934,0.0005866521,0.00013606218,0.00011870689,0.00019133043,0.000033203596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085339043,0.0007358424,0.0008691789,0.0019111816,0.0002319532,0.0014899607,0.001109372,0.00091589,0.0032444303],"category_scores_gemma":[0.0037563662,0.00041383255,0.0008236922,0.0012045015,0.0006019512,0.0011328894,0.0008930541,0.00095393247,0.0026552281],"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.00031099282,0.000079448306,0.011431134,0.00065235054,0.0001288725,0.0006751194,0.00012941689,0.020100784,0.041875087,0.023115024,0.026118876,0.875383],"study_design_scores_gemma":[0.000060970477,0.00050060556,0.017295009,0.00057172094,0.00073942915,0.009559866,0.00024895783,0.5483439,0.12078407,0.123411044,0.17827514,0.00020920472],"about_ca_topic_score_codex":0.0005361412,"about_ca_topic_score_gemma":0.0006944249,"teacher_disagreement_score":0.0032444303,"about_ca_system_score_codex":0.00042059188,"about_ca_system_score_gemma":0.00038015135,"threshold_uncertainty_score":0.010853708},"labels":[],"label_agreement":null},{"id":"W2612848713","doi":"10.1007/978-3-319-57987-0_2","title":"Leaning-Based 360° Interfaces: Investigating Virtual Reality Navigation Interfaces with Leaning-Based-Translation and Full-Rotation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Joystick; Virtual reality; Computer science; Rotation (mathematics); Usability; Motion (physics); Human–computer interaction; Simulation; Simulator sickness; Motion sickness; Translation (biology); Immersion (mathematics); Computer vision; Artificial intelligence; Psychology; Mathematics","score_opus":0.0442483955677526,"score_gpt":0.28908954517209307,"score_spread":0.24484114960434047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612848713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34799898,0.0031221942,0.6176689,0.00024937838,0.00024988834,0.0003024963,0.00015839124,0.0012177951,0.029031962],"genre_scores_gemma":[0.87884134,0.0013915529,0.10931383,0.0001627319,0.000065303015,0.00014840144,0.000242302,0.00021128314,0.009623284],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909127,0.0002490657,0.000045731646,0.00013229295,0.0003815973,0.000100104524],"domain_scores_gemma":[0.99835783,0.00087789726,0.0001328116,0.00013691293,0.00043062613,0.000063882086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010083359,0.0010975903,0.00041582267,0.00044176323,0.00022684711,0.0024276483,0.0012187173,0.0011227593,0.006792215],"category_scores_gemma":[0.0059048124,0.00044141576,0.00056020304,0.00047592146,0.0005695229,0.0026917155,0.0012085601,0.00059098494,0.0012786229],"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.0019994352,0.00051446207,0.0033533387,0.0018888065,0.00009292426,0.0004447846,0.005799661,0.011018288,0.5188867,0.023320246,0.0022728094,0.4304085],"study_design_scores_gemma":[0.00060110405,0.009620595,0.03966682,0.0015809535,0.0010042455,0.008936566,0.008954223,0.41674837,0.42161217,0.03714303,0.053726304,0.00040561895],"about_ca_topic_score_codex":0.00066180027,"about_ca_topic_score_gemma":0.00043200384,"teacher_disagreement_score":0.006792215,"about_ca_system_score_codex":0.0002574199,"about_ca_system_score_gemma":0.00035820313,"threshold_uncertainty_score":0.022722244},"labels":[],"label_agreement":null},{"id":"W2612944064","doi":"10.1007/978-3-319-58077-7_3","title":"Towards the Use of a Serious Game to Learn to Identify the Location of a 3D Sound in the Virtual Environment","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Human–computer interaction; Sound (geography); Serious game; Virtual machine; Multimedia; Operating system; Acoustics","score_opus":0.0384044688906727,"score_gpt":0.2653431969559042,"score_spread":0.2269387280652315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612944064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13057247,0.001251988,0.6228903,0.0027076553,0.00034568083,0.00065422076,0.00015061449,0.0031988916,0.23822825],"genre_scores_gemma":[0.2941922,0.0012048901,0.6141677,0.00062436576,0.000029952611,0.00040125905,0.00036528884,0.00037342223,0.08864098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993893,0.0001998091,0.00002449066,0.00011514839,0.00019368566,0.00007742753],"domain_scores_gemma":[0.99926096,0.00028289485,0.00003380035,0.00006616342,0.0001711288,0.00018495407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011798633,0.0012068655,0.00022540794,0.00050969305,0.0007594889,0.003947793,0.0017862312,0.0014009011,0.0076100784],"category_scores_gemma":[0.002864217,0.0003791752,0.00041945055,0.00018553597,0.001735892,0.002673053,0.0038550706,0.0019093915,0.0027229697],"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.00042903327,0.0016221824,0.0063864435,0.00081371027,0.000075729586,0.0010853356,0.039809555,0.0054921885,0.064748645,0.15111154,0.02598172,0.70244396],"study_design_scores_gemma":[0.00021633976,0.0022424266,0.008895983,0.0013203495,0.00013997388,0.0035245768,0.016774783,0.073502086,0.047541253,0.114735246,0.7309052,0.00020188114],"about_ca_topic_score_codex":0.004018079,"about_ca_topic_score_gemma":0.0057179774,"teacher_disagreement_score":0.0076100784,"about_ca_system_score_codex":0.0006369572,"about_ca_system_score_gemma":0.0017588682,"threshold_uncertainty_score":0.025458276},"labels":[],"label_agreement":null},{"id":"W2613524337","doi":"10.1007/978-3-319-58634-2_13","title":"Four Biases in Interface Design Interactions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interface (matter); Interface design; Human–computer interaction; Operating system","score_opus":0.09874358838312612,"score_gpt":0.3482244776977456,"score_spread":0.24948088931461948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613524337","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.46941534,0.0032125015,0.26757398,0.01777702,0.00059431,0.00043326127,0.00039498447,0.0021930453,0.23840556],"genre_scores_gemma":[0.94050133,0.00044310887,0.045094885,0.0010427434,0.00009878726,0.00029007348,0.00016200483,0.000739426,0.011627747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96999335,0.012367773,0.0017321616,0.002274274,0.012136015,0.001496437],"domain_scores_gemma":[0.89859664,0.06970927,0.0054198066,0.011603014,0.013153592,0.0015177351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016938986,0.0009944399,0.00061403576,0.0027916727,0.0018947636,0.008816003,0.0015557242,0.0030411484,0.0111901015],"category_scores_gemma":[0.16689947,0.0011521922,0.0005827053,0.0015531731,0.0050348355,0.010474101,0.0054847677,0.0036853084,0.002169383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014800278,0.00035430808,0.048755363,0.0013190646,0.0001250365,0.0005617764,0.1192044,0.001776572,0.018898748,0.33980653,0.011950936,0.45576727],"study_design_scores_gemma":[0.0005170829,0.0006125547,0.065734975,0.0029940894,0.00055540225,0.0025818297,0.06878808,0.028966852,0.03675013,0.66903806,0.12304238,0.00041851136],"about_ca_topic_score_codex":0.0019707577,"about_ca_topic_score_gemma":0.001627408,"teacher_disagreement_score":0.016938986,"about_ca_system_score_codex":0.0023792416,"about_ca_system_score_gemma":0.0020438237,"threshold_uncertainty_score":0.08958298},"labels":[],"label_agreement":null},{"id":"W2613612643","doi":"10.1007/978-3-319-58466-9_29","title":"Safety Does Not Happen by Accident, Can Gaming Help Improve Occupational Health and Safety in Organizations?","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Ontario Tech University","funders":"","keywords":"Mindset; Computer science; Occupational safety and health; Knowledge management; Risk analysis (engineering); Business; Medicine; Artificial intelligence","score_opus":0.018732833228783517,"score_gpt":0.31820421542095284,"score_spread":0.29947138219216934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613612643","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061366007,0.2208953,0.010518386,0.16465461,0.012423716,0.00009489578,0.0002879488,0.0002590777,0.52950007],"genre_scores_gemma":[0.4738979,0.20340471,0.019344555,0.029397007,0.0043778173,0.0002024477,0.00044323158,0.00017826207,0.26875404],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976367,0.000084143736,0.000007847334,0.000024346018,0.00007338076,0.000046520105],"domain_scores_gemma":[0.9996196,0.00020965564,0.000022358341,0.000012616065,0.00004667666,0.00008897576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006755895,0.00047257752,0.00032186587,0.00037447456,0.000637153,0.0025735118,0.0005986654,0.001398591,0.009456029],"category_scores_gemma":[0.001971966,0.00016460556,0.00035260073,0.00029498863,0.0009964592,0.0020273766,0.00077120354,0.0018938584,0.0024791202],"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.00013957106,0.0003110695,0.0035362695,0.00080754067,0.000058077094,0.00012117923,0.0027509655,0.00041824384,0.0010668254,0.052497763,0.15888757,0.779405],"study_design_scores_gemma":[0.00007565581,0.00054676464,0.026439015,0.0046960376,0.00013603548,0.0012352027,0.013012747,0.00200152,0.0013422993,0.2158856,0.73454547,0.00008364374],"about_ca_topic_score_codex":0.0033825259,"about_ca_topic_score_gemma":0.012794607,"teacher_disagreement_score":0.009456029,"about_ca_system_score_codex":0.0004534007,"about_ca_system_score_gemma":0.0011822506,"threshold_uncertainty_score":0.031633615},"labels":[],"label_agreement":null},{"id":"W2613657895","doi":"10.1007/978-3-319-58484-3_7","title":"Mobile Shopping Should be Useful, Convenient and Fun!","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Expectancy theory; Computer science; Formative assessment; Unified theory of acceptance and use of technology; Product (mathematics); Antecedent (behavioral psychology); Mobile commerce; Mobile device; Advertising; World Wide Web; Business; Psychology; Social psychology; Mathematics","score_opus":0.15044616357841567,"score_gpt":0.3763368876219834,"score_spread":0.22589072404356775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613657895","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.013344745,0.022933155,0.009991851,0.0695742,0.009494955,0.00009709077,0.0006803954,0.0013801323,0.8725036],"genre_scores_gemma":[0.053295385,0.015470787,0.007257152,0.012698613,0.0027021044,0.0000628721,0.00032716844,0.0004533931,0.90773255],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9997453,0.00004413891,0.000010324128,0.00003238388,0.00012035767,0.00004736796],"domain_scores_gemma":[0.9997178,0.00006832295,0.00002021378,0.000034635614,0.0000827967,0.00007610957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032916808,0.00076040864,0.00038433,0.00051979366,0.0010173668,0.0037714108,0.00038365004,0.002676439,0.06778875],"category_scores_gemma":[0.0011430258,0.00030997625,0.0003344316,0.00068168965,0.00071143813,0.0056200153,0.0014782646,0.0018043957,0.07117186],"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.0000669102,0.00010456852,0.0009716205,0.0004097191,0.000015536989,0.00022282448,0.0010519477,0.00006974979,0.0027976239,0.035123747,0.56950396,0.38966176],"study_design_scores_gemma":[0.0000053731787,0.000061542,0.0019140771,0.00027344187,0.000007913601,0.00071002747,0.000720049,0.00008921415,0.000481215,0.007794535,0.9879233,0.00001930779],"about_ca_topic_score_codex":0.0005839638,"about_ca_topic_score_gemma":0.0015903247,"teacher_disagreement_score":0.06778875,"about_ca_system_score_codex":0.000222375,"about_ca_system_score_gemma":0.00032246386,"threshold_uncertainty_score":0.22677594},"labels":[],"label_agreement":null},{"id":"W2613774282","doi":"10.1007/978-3-319-58634-2_33","title":"What Drives Perceived Usability in Mobile Web Design: Classical or Expressive Aesthetics?","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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 Saskatchewan","funders":"","keywords":"Usability; Dimension (graph theory); Computer science; Perception; Human–computer interaction; Aesthetics; USable; Psychology; Multimedia; Mathematics; Art","score_opus":0.03870081323475855,"score_gpt":0.3071812698021745,"score_spread":0.2684804565674159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613774282","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.92475235,0.0007602804,0.01294351,0.0013104185,0.00009804305,0.00004649236,0.000038893864,0.000107445754,0.05994264],"genre_scores_gemma":[0.99633765,0.000116822615,0.0016884507,0.000060389266,0.000018085293,0.00001298195,0.000013920228,0.000045998462,0.0017056431],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983552,0.0007432554,0.00007088044,0.00014175933,0.0005404241,0.00014835013],"domain_scores_gemma":[0.9909574,0.005748165,0.0009529024,0.0005131586,0.0012572741,0.0005711845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025153405,0.0003634045,0.00024273683,0.00082401995,0.0005767755,0.0077205393,0.00051312137,0.0009428504,0.0053294976],"category_scores_gemma":[0.01700894,0.00041261656,0.00037521028,0.0006686765,0.0022598773,0.003510499,0.0010013283,0.0009995151,0.00058364583],"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.0010231432,0.0011321799,0.29426813,0.002375867,0.00030913163,0.0011432867,0.15797396,0.0027298196,0.048384406,0.0963824,0.0071096327,0.38716805],"study_design_scores_gemma":[0.0001808916,0.0012710217,0.71257526,0.0014219584,0.0003965505,0.002177853,0.1282447,0.024492601,0.010935143,0.086075634,0.03192904,0.00029929946],"about_ca_topic_score_codex":0.00068881054,"about_ca_topic_score_gemma":0.001119213,"teacher_disagreement_score":0.0077205393,"about_ca_system_score_codex":0.0009647843,"about_ca_system_score_gemma":0.0004909699,"threshold_uncertainty_score":0.017828941},"labels":[],"label_agreement":null},{"id":"W2613828349","doi":"10.1007/978-3-319-58466-9_26","title":"Enhance the Use of Medical Wearables Through Meaningful Data Analytics","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"Athabasca University","funders":"","keywords":"Computer science; Wearable computer; Analytics; Data science; Human–computer interaction; Embedded system","score_opus":0.16660033206744937,"score_gpt":0.3363034971850855,"score_spread":0.16970316511763614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613828349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046384666,0.008805888,0.90953314,0.004428098,0.00049706316,0.00029447433,0.0026816144,0.00737019,0.020004885],"genre_scores_gemma":[0.4298082,0.009641774,0.54546714,0.0016420524,0.0005118247,0.00028518637,0.0029036528,0.0009021763,0.008838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921954,0.00027418914,0.00005782023,0.00014383518,0.00026044314,0.000044238084],"domain_scores_gemma":[0.996642,0.0021718217,0.00017860174,0.00045389016,0.00042393385,0.00012980375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011559024,0.001292426,0.00064077484,0.0011798341,0.00022038163,0.00308799,0.0011897298,0.001265296,0.0061257877],"category_scores_gemma":[0.0068561374,0.00040479467,0.000622216,0.0010115048,0.00039244918,0.002632246,0.0024535637,0.0008899112,0.0033841804],"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.0005161847,0.00029797852,0.006028613,0.0017396963,0.00018723038,0.00040913734,0.0014318152,0.0033386706,0.06825031,0.008233083,0.018143808,0.8914235],"study_design_scores_gemma":[0.00022517215,0.0011568436,0.031337675,0.0030638063,0.0010071403,0.004849042,0.0038518892,0.22191812,0.22567795,0.16750559,0.3390235,0.00038330114],"about_ca_topic_score_codex":0.00038081166,"about_ca_topic_score_gemma":0.00086415646,"teacher_disagreement_score":0.0061257877,"about_ca_system_score_codex":0.0001739648,"about_ca_system_score_gemma":0.00032496182,"threshold_uncertainty_score":0.020492792},"labels":[],"label_agreement":null},{"id":"W2613832828","doi":"10.1007/978-3-319-58481-2_17","title":"Improving Healthcare with Wearables: Overcoming the Barriers to Adoption","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Abandonment (legal); Wearable computer; Health care; Wearable technology; Context (archaeology); Computer science; Order (exchange); Internet privacy; Knowledge management; Business","score_opus":0.054406520957142865,"score_gpt":0.3341350165086353,"score_spread":0.27972849555149243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613832828","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.14795639,0.21136881,0.19659898,0.18598771,0.0030559292,0.0003892536,0.0003543468,0.0009093927,0.2533793],"genre_scores_gemma":[0.631811,0.18621138,0.12015969,0.015283702,0.002280751,0.000369861,0.00032166307,0.0003768862,0.043184984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996689,0.0015878247,0.00019369858,0.00023974577,0.0010099033,0.000279874],"domain_scores_gemma":[0.98850036,0.008596905,0.0007765492,0.0006262725,0.0011088365,0.00039099297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005540422,0.00082763616,0.000648094,0.0008675643,0.00053784234,0.0061181863,0.0011722858,0.002776525,0.005025974],"category_scores_gemma":[0.012006451,0.0005480102,0.0006683554,0.0017116374,0.0015268917,0.008056982,0.0026398783,0.003992415,0.0021575],"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.0000713289,0.0003258369,0.0071946196,0.002644642,0.00008198053,0.0002656088,0.00622733,0.0009932183,0.0064984676,0.067488134,0.024907582,0.88330126],"study_design_scores_gemma":[0.000059968264,0.0012110429,0.03272693,0.013136452,0.00029038428,0.002336092,0.020892417,0.009396378,0.013720898,0.18998352,0.71604717,0.00019872162],"about_ca_topic_score_codex":0.0010656391,"about_ca_topic_score_gemma":0.0018323865,"teacher_disagreement_score":0.0061181863,"about_ca_system_score_codex":0.0006352424,"about_ca_system_score_gemma":0.0017582957,"threshold_uncertainty_score":0.029300869},"labels":[],"label_agreement":null},{"id":"W2613840425","doi":"10.1007/978-3-319-58481-2_8","title":"The Adoption of Physiological Measures as an Evaluation Tool in UX","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; HEC Montréal","funders":"","keywords":"Computer science; Human–computer interaction; User experience design; Process management; Data science; Engineering","score_opus":0.06796799972002347,"score_gpt":0.33421498269206085,"score_spread":0.26624698297203736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613840425","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.6499684,0.019587131,0.24469836,0.0058357595,0.0016581811,0.0022448297,0.00043627527,0.0010730401,0.07449804],"genre_scores_gemma":[0.91636753,0.0027007624,0.07546541,0.00046124664,0.00019757664,0.00086963736,0.00010838848,0.00010944077,0.0037200705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.96132725,0.027566724,0.0016180432,0.0009293395,0.008128912,0.00042980188],"domain_scores_gemma":[0.89442444,0.085647024,0.004745662,0.0025891182,0.011581308,0.001012334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04137914,0.00078121567,0.0005762546,0.0024594727,0.0006379687,0.005384603,0.00086877,0.0015821138,0.0019231609],"category_scores_gemma":[0.105017476,0.00033974607,0.00044465245,0.0014851035,0.0018157535,0.0042816894,0.0023586573,0.001330865,0.00050047727],"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.0011362792,0.0005750699,0.06510513,0.0017342208,0.00014899184,0.00020862662,0.010948024,0.00074255397,0.015457088,0.010030867,0.002552908,0.8913602],"study_design_scores_gemma":[0.00046320658,0.021469265,0.7140501,0.008335704,0.0013049559,0.0036016111,0.032430287,0.037849367,0.07103672,0.03541536,0.0732521,0.00079129724],"about_ca_topic_score_codex":0.0007278631,"about_ca_topic_score_gemma":0.0010916018,"teacher_disagreement_score":0.04137914,"about_ca_system_score_codex":0.0011531096,"about_ca_system_score_gemma":0.0013509671,"threshold_uncertainty_score":0.21883643},"labels":[],"label_agreement":null},{"id":"W2613960595","doi":"10.1007/978-3-319-58536-9_20","title":"Socioemotional Benefits of Digital Games for Older Adults","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Socioemotional selectivity theory; Loneliness; Social connectedness; Quality of life (healthcare); Population; Computer science; Psychology; Gerontology; Developmental psychology; Social psychology; Demography; Sociology; Medicine","score_opus":0.018756128208455933,"score_gpt":0.27516899801294825,"score_spread":0.2564128698044923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613960595","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.96826494,0.008586838,0.00022291794,0.00076000806,0.00013152334,0.000028671246,0.00027872424,0.000015316753,0.021711115],"genre_scores_gemma":[0.9872924,0.0051151607,0.00057155243,0.0002365348,0.000080993705,0.00003036879,0.000151117,0.0000045003217,0.006517397],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99993634,0.000018603101,0.000003922696,0.0000073295405,0.000017270386,0.00001645527],"domain_scores_gemma":[0.99973315,0.00012581421,0.00003024651,0.0000066908983,0.000025132817,0.000078864185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023193595,0.0002772847,0.00016853507,0.00029448114,0.0002375988,0.0005023341,0.00013476345,0.00031026214,0.007341127],"category_scores_gemma":[0.0012688555,0.000057835627,0.00027056737,0.000155297,0.00012056453,0.0003498636,0.0005892902,0.00035621985,0.00038243935],"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.0031640492,0.0054915985,0.12445738,0.001813661,0.00036019422,0.0007907178,0.0061438945,0.0004116182,0.013856284,0.003353784,0.010395515,0.8297613],"study_design_scores_gemma":[0.00026311583,0.0065275,0.9429054,0.00068807445,0.00055428245,0.0009719511,0.0076291617,0.00055408635,0.0022605816,0.005581241,0.032023568,0.00004111414],"about_ca_topic_score_codex":0.0008654712,"about_ca_topic_score_gemma":0.003234787,"teacher_disagreement_score":0.007341127,"about_ca_system_score_codex":0.00013496034,"about_ca_system_score_gemma":0.000117488766,"threshold_uncertainty_score":0.024558485},"labels":[],"label_agreement":null},{"id":"W2614023017","doi":"10.1007/978-3-319-58463-8_32","title":"Combinatorial Auction Based Mechanism Design for Course Offering Determination","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Athabasca University","funders":"","keywords":"Computer science; Combinatorial auction; Negotiation; Mechanism (biology); Operations research; Resource allocation; Common value auction; Constraint (computer-aided design); Resource (disambiguation); Course (navigation); Mechanism design; Mathematical optimization; Protocol (science); Unit (ring theory); Budget constraint; Mathematical economics; Mathematics education; Microeconomics; Computer network","score_opus":0.09150652094233304,"score_gpt":0.36166598012121604,"score_spread":0.270159459178883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614023017","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.0026313406,0.00031648998,0.99226534,0.00013028733,0.00007155883,0.00021337887,0.000054382483,0.00028609234,0.0040311064],"genre_scores_gemma":[0.3309574,0.00079136086,0.65031075,0.00025828215,0.00026423988,0.0013057342,0.00030094388,0.00020565612,0.015605599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99150544,0.0054154797,0.00029295887,0.0007388997,0.0014625442,0.0005846571],"domain_scores_gemma":[0.9911601,0.0059603825,0.00042853504,0.0010846074,0.0010537629,0.00031270742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009418376,0.0017654274,0.0036387811,0.0015168099,0.0010297598,0.0050155115,0.007793199,0.0040126517,0.013777037],"category_scores_gemma":[0.019668022,0.0018822091,0.0019093314,0.002845739,0.0017769928,0.004588775,0.0030684697,0.0043487283,0.0031299759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000730199,0.0007367262,0.00041527487,0.00082803285,0.00024756812,0.00015274095,0.00016169008,0.43425274,0.004050066,0.2674527,0.013944368,0.27702788],"study_design_scores_gemma":[0.00013525397,0.00015944018,0.00008829727,0.00003886857,0.000044388285,0.00009314612,0.000018179255,0.8883795,0.0006711965,0.10788427,0.0024585724,0.000028765915],"about_ca_topic_score_codex":0.00070293836,"about_ca_topic_score_gemma":0.0006908215,"teacher_disagreement_score":0.013777037,"about_ca_system_score_codex":0.002505505,"about_ca_system_score_gemma":0.0031763054,"threshold_uncertainty_score":0.049809754},"labels":[],"label_agreement":null},{"id":"W2614065879","doi":"10.1007/978-3-319-58077-7_43","title":"Cloud Computing Security and Privacy: An Empirical Study","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Information privacy; Cloud computing security; Internet privacy; Data science; Operating system","score_opus":0.03843791683887421,"score_gpt":0.3225816056405453,"score_spread":0.28414368880167107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614065879","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.9928369,0.00092863565,0.0005420981,0.00096437713,0.000012133663,0.000050990206,0.00016262523,0.0000035268436,0.0044987053],"genre_scores_gemma":[0.9980844,0.00058727723,0.00024974783,0.00014767141,0.000018181352,0.00003808572,0.00014433094,0.0000064463497,0.0007238267],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99366224,0.004035552,0.00035154613,0.0004092667,0.0010566725,0.00048462377],"domain_scores_gemma":[0.7409394,0.22508116,0.018921558,0.004840146,0.005755574,0.0044622053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010249739,0.00031522824,0.00045119642,0.0016398169,0.0020067797,0.0028487188,0.0011982779,0.0013539869,0.01005448],"category_scores_gemma":[0.06875211,0.0006750643,0.00089900475,0.0028216909,0.0038784458,0.005390296,0.0022336876,0.0042503304,0.00095912255],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076343503,0.0041261837,0.9625893,0.00023701797,0.00020017113,0.0003121452,0.006712529,0.00035305237,0.00014907165,0.007222356,0.0018387804,0.015495924],"study_design_scores_gemma":[0.000114016206,0.0014577665,0.92790407,0.00046764006,0.00040503676,0.002256506,0.05431407,0.0034000196,0.00045416632,0.00490227,0.004269915,0.000054482935],"about_ca_topic_score_codex":0.004618529,"about_ca_topic_score_gemma":0.005201274,"teacher_disagreement_score":0.010249739,"about_ca_system_score_codex":0.0018367618,"about_ca_system_score_gemma":0.0019708225,"threshold_uncertainty_score":0.05420643},"labels":[],"label_agreement":null},{"id":"W2614087704","doi":"10.1007/978-3-540-77537-9_4","title":"A Bipartite Strengthening of the Crossing Lemma","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Calgary","funders":"Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Combinatorics; Mathematics; Bipartite graph; Lemma (botany); Disjoint sets; Crossing number (knot theory); Complete bipartite graph; Monotone polygon; Graph; Discrete mathematics; Geometry","score_opus":0.02258841218043543,"score_gpt":0.24777728249271813,"score_spread":0.2251888703122827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614087704","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.06926495,0.0016406943,0.44994986,0.003853531,0.0015308412,0.00016068727,0.0010922097,0.0010334741,0.4714737],"genre_scores_gemma":[0.74658865,0.003392812,0.14386016,0.005639089,0.0017567216,0.0004816264,0.0023407068,0.0015415155,0.09439866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979272,0.0006459285,0.000078418474,0.00049679383,0.0005251086,0.00032663584],"domain_scores_gemma":[0.99313605,0.0038116402,0.00038567928,0.0012295021,0.00093959906,0.0004975971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077757,0.0008468893,0.0013433857,0.002131943,0.0027949214,0.0032918996,0.0028729704,0.001894027,0.02625343],"category_scores_gemma":[0.009039424,0.0009020563,0.001974976,0.0029117023,0.003710112,0.007530965,0.006070668,0.006278319,0.004664578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062794454,0.000026368118,0.00011080905,0.00010357834,0.00001426718,0.00010926093,0.000115509014,0.0010130216,0.0014433871,0.98124033,0.007366966,0.008393721],"study_design_scores_gemma":[0.00002957138,0.000021800577,0.00019353449,0.000047894377,0.000034631285,0.00020741332,0.000058701175,0.006500687,0.0010319098,0.9786401,0.013216132,0.000017650165],"about_ca_topic_score_codex":0.0017548633,"about_ca_topic_score_gemma":0.0011889118,"teacher_disagreement_score":0.02625343,"about_ca_system_score_codex":0.0013484212,"about_ca_system_score_gemma":0.0009721567,"threshold_uncertainty_score":0.08782649},"labels":[],"label_agreement":null},{"id":"W2614092550","doi":"10.1007/978-3-319-58481-2_18","title":"Are you Willing to see Doctors on Mobile Devices? A Content Analysis of User Reviews of Virtual Consultation Apps","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Telemedicine and Telehealth Implementation","field":"Medicine","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":"Memorial University of Newfoundland","funders":"","keywords":"Context (archaeology); Health care; Quality (philosophy); Patient satisfaction; Service (business); Multimedia; Service quality; Content analysis; Healthcare service; Computer science; Internet privacy; Knowledge management; Nursing; Medicine; Business; Marketing","score_opus":0.08667914142929778,"score_gpt":0.36890665427826713,"score_spread":0.28222751284896935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614092550","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.98983216,0.0016227687,0.00061953417,0.00084619416,0.000035399862,0.00017548747,0.0016368084,0.000049575137,0.0051820353],"genre_scores_gemma":[0.9901944,0.0020037116,0.0019568217,0.0006193972,0.000051217485,0.00037991593,0.0017536989,0.000082663464,0.002958206],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99454534,0.0029451584,0.000543263,0.00024335648,0.001460033,0.0002628256],"domain_scores_gemma":[0.8128792,0.1592148,0.014156693,0.0009589115,0.011510841,0.0012793964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055408557,0.00019540566,0.00042875353,0.005491537,0.0008844976,0.0019173339,0.0004328532,0.00049155974,0.002692577],"category_scores_gemma":[0.08012328,0.00024606765,0.00046845307,0.0039746496,0.0005354742,0.0023504382,0.0012521669,0.0006224488,0.0007178522],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001583568,0.0005160471,0.460623,0.004909646,0.00038458747,0.0010327584,0.2124988,0.0002629655,0.003798902,0.0015785861,0.025268938,0.2875422],"study_design_scores_gemma":[0.00003900475,0.0006018732,0.84648937,0.0024074446,0.00032437057,0.0013310561,0.11439562,0.0012978028,0.0014700536,0.00038970078,0.031143935,0.00010971017],"about_ca_topic_score_codex":0.0028503742,"about_ca_topic_score_gemma":0.005931393,"teacher_disagreement_score":0.0055408557,"about_ca_system_score_codex":0.0014958683,"about_ca_system_score_gemma":0.0014397345,"threshold_uncertainty_score":0.029303253},"labels":[],"label_agreement":null},{"id":"W2614099103","doi":"10.1007/978-3-319-58071-5_50","title":"Persuasive Argumentation and Emotions: An Empirical Evaluation with Users","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Team Dynamics and Performance","field":"Psychology","cited_by":13,"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 Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Persuasion; Pathos; Logos Bible Software; Argumentation theory; Psychology; Moderation; Social psychology; Ethos; Process (computing); Cognitive psychology; Epistemology; Computer science; Political science; Linguistics; Philosophy; Law","score_opus":0.04881864473101138,"score_gpt":0.3707426900805812,"score_spread":0.3219240453495698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614099103","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.99168855,0.00031138936,0.0023557427,0.00008749883,0.000047916237,0.00045714955,0.00012906417,0.000089961526,0.0048327534],"genre_scores_gemma":[0.98805994,0.0003173252,0.005860873,0.000116144205,0.000068924164,0.0012565514,0.00043380287,0.00009803538,0.003788377],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98818654,0.00759532,0.0009120149,0.00064125407,0.00231417,0.0003506629],"domain_scores_gemma":[0.8002573,0.17292267,0.006078765,0.005398688,0.012528866,0.0028136994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012554085,0.0011049244,0.0012199078,0.00230784,0.0018226973,0.0051816814,0.001320355,0.0021753004,0.0053119278],"category_scores_gemma":[0.12473556,0.00060888496,0.0009999408,0.0013155356,0.0017166573,0.0025142531,0.0030329737,0.002201181,0.0018212395],"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.021829074,0.041399352,0.23343523,0.008230582,0.00128218,0.0019311206,0.24006733,0.0062787714,0.018871967,0.0070855794,0.0100455675,0.40954337],"study_design_scores_gemma":[0.008335685,0.06177241,0.63228744,0.003185608,0.00410625,0.0060143075,0.12899625,0.055165734,0.038342938,0.021088077,0.039677046,0.001028288],"about_ca_topic_score_codex":0.00044926556,"about_ca_topic_score_gemma":0.00031033758,"teacher_disagreement_score":0.012554085,"about_ca_system_score_codex":0.00056936766,"about_ca_system_score_gemma":0.00070699555,"threshold_uncertainty_score":0.06639314},"labels":[],"label_agreement":null},{"id":"W2614147489","doi":"10.1007/978-3-319-58697-7_39","title":"Building Tools for Creative Data Exploration: A Comparative Overview of Data-Driven Design and User-Centered Design","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Human–computer interaction; User-centered design; Data exploration; Software engineering; Artificial intelligence; Visualization","score_opus":0.4458006550120226,"score_gpt":0.41824358745933876,"score_spread":0.027557067552683834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614147489","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033578267,0.008407285,0.97739786,0.001141544,0.00006465997,0.00023082958,0.00008192252,0.0010412905,0.008276808],"genre_scores_gemma":[0.046146844,0.0056914557,0.9447175,0.00026150487,0.000027290444,0.0005095427,0.00024601183,0.000685717,0.0017141529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982842,0.010408189,0.0014138576,0.0012733391,0.0036346412,0.00042794287],"domain_scores_gemma":[0.94474924,0.04672169,0.0009312639,0.004728726,0.0022635325,0.00060552545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024793373,0.0023330008,0.0017978249,0.006844941,0.0019854372,0.01641811,0.006811724,0.002783113,0.004070018],"category_scores_gemma":[0.031043082,0.00284849,0.002636275,0.0063292636,0.012400983,0.012474271,0.007537172,0.003994034,0.0013014339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011199974,0.00028444832,0.0017810502,0.0074388026,0.00019792635,0.0002988747,0.029792024,0.008393836,0.005624927,0.47778407,0.0060825646,0.46220955],"study_design_scores_gemma":[0.00018031959,0.00024101598,0.0012309499,0.005975827,0.0002171405,0.0019248612,0.01123723,0.04498121,0.01769336,0.5594801,0.3565789,0.00025908632],"about_ca_topic_score_codex":0.0017448333,"about_ca_topic_score_gemma":0.0018593912,"teacher_disagreement_score":0.024793373,"about_ca_system_score_codex":0.0025468925,"about_ca_system_score_gemma":0.004793952,"threshold_uncertainty_score":0.13112146},"labels":[],"label_agreement":null},{"id":"W2614714980","doi":"10.1007/978-3-319-59129-2_2","title":"Leaflet Free Edge Detection for the Automatic Analysis of Prosthetic Heart Valve Opening and Closing Motion Patterns from High Speed Video Recordings","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Closing (real estate); Contouring; Body orifice; Metric (unit); Computer graphics (images); Engineering","score_opus":0.019338331277044794,"score_gpt":0.30176875022315763,"score_spread":0.2824304189461128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614714980","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.041044492,0.0039546005,0.9470722,0.000120235316,0.0002327027,0.000105895204,0.0010841533,0.003887834,0.0024977715],"genre_scores_gemma":[0.118767746,0.0036586775,0.86509526,0.00014335089,0.00016018766,0.00012928536,0.0019912506,0.0004468104,0.009607403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997987,0.000020303753,0.000011668129,0.000054966764,0.00009159097,0.000022807777],"domain_scores_gemma":[0.9995497,0.00023363867,0.000036697416,0.000038717746,0.00011265589,0.000028587527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043416902,0.00060841534,0.00047002576,0.0011909374,0.00018892044,0.00073833286,0.0007550112,0.0010512207,0.0050481223],"category_scores_gemma":[0.0006602124,0.00032065544,0.0004355799,0.00090099167,0.00017447562,0.0004966723,0.00041597072,0.00053642795,0.0035839055],"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.00024911822,0.00006566709,0.0006268277,0.00030715953,0.000039618924,0.00010634747,0.00005138142,0.0011473462,0.33372927,0.00044050926,0.0045838123,0.65865296],"study_design_scores_gemma":[0.00007303703,0.00048805913,0.040319826,0.0002288014,0.00026248975,0.0028250252,0.00014140138,0.4020506,0.5198089,0.0028230404,0.030832544,0.00014630474],"about_ca_topic_score_codex":0.00051227055,"about_ca_topic_score_gemma":0.0018609284,"teacher_disagreement_score":0.0050481223,"about_ca_system_score_codex":0.00013211137,"about_ca_system_score_gemma":0.0001948828,"threshold_uncertainty_score":0.016887665},"labels":[],"label_agreement":null},{"id":"W2614816202","doi":"10.1007/978-3-319-58515-4_27","title":"Collaborative Hybrid Agent Provision of Learner Needs Using Ontology Based Semantic Technology","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Ottawa","funders":"","keywords":"Computer science; Interoperation; Ontology; Context (archaeology); Suite; Presentation (obstetrics); Vocabulary; Intelligent agent; Knowledge management; World Wide Web; Human–computer interaction; Artificial intelligence; Interoperability","score_opus":0.021552919942705376,"score_gpt":0.2734657594785733,"score_spread":0.25191283953586796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614816202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17035393,0.00029765035,0.7855708,0.0007307928,0.000094134884,0.00030884898,0.00014378285,0.0019793299,0.040520724],"genre_scores_gemma":[0.7419254,0.00019814564,0.23451382,0.000110119974,0.00003353985,0.0002973968,0.0003482051,0.00019419349,0.022379108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857235,0.0005766187,0.000101452955,0.00019471417,0.000444506,0.00011039523],"domain_scores_gemma":[0.99807584,0.0010993249,0.00008885733,0.00027453195,0.00030633085,0.00015507505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021030006,0.0005177897,0.0007153834,0.0008675759,0.0013486685,0.003109221,0.0013772643,0.0015100763,0.005176119],"category_scores_gemma":[0.004815682,0.0004279997,0.00074458256,0.00073544035,0.00050388114,0.004459065,0.0046829246,0.0011348546,0.0015993713],"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.0018013732,0.0032936481,0.015352272,0.0009539502,0.00040420188,0.0030028187,0.033732407,0.04262781,0.0790436,0.19648375,0.018566063,0.60473806],"study_design_scores_gemma":[0.0002391228,0.00048285522,0.004258258,0.00022829138,0.00044013764,0.001551489,0.012695814,0.68552387,0.056313768,0.13285576,0.105204076,0.00020661537],"about_ca_topic_score_codex":0.001547424,"about_ca_topic_score_gemma":0.002530046,"teacher_disagreement_score":0.005176119,"about_ca_system_score_codex":0.0006416741,"about_ca_system_score_gemma":0.0015352461,"threshold_uncertainty_score":0.017315865},"labels":[],"label_agreement":null},{"id":"W2614954641","doi":"10.1007/978-3-319-58524-6_10","title":"Using Virtual Reality to Assess the Elderly: The Impact of Human-Computer Interfaces on Cognition","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Functions and Memory","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Computer science; Cognition; Virtual reality; Human–computer interaction; Psychology; Neuroscience","score_opus":0.15046007556897847,"score_gpt":0.41539391141481957,"score_spread":0.26493383584584107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614954641","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.8380974,0.10253962,0.027265262,0.00070063956,0.0005268478,0.000106549116,0.00066322886,0.00019212835,0.029908389],"genre_scores_gemma":[0.9486315,0.030754657,0.014296434,0.00034938773,0.00018411598,0.000045908615,0.00016992855,0.00002765829,0.0055404543],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99960774,0.00014306678,0.000030994404,0.000052607687,0.0001406942,0.00002483815],"domain_scores_gemma":[0.99932027,0.00043797345,0.00007026985,0.000027314993,0.0000988867,0.00004529229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009846954,0.00062174146,0.0003699125,0.00052953704,0.000107430766,0.0012058911,0.00030639727,0.000544255,0.0014675453],"category_scores_gemma":[0.0019924736,0.00012846613,0.00030588737,0.00036201792,0.00025674023,0.00058296055,0.00057485496,0.00031443496,0.000483737],"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.0017967086,0.00047037413,0.08729265,0.0014142351,0.0005976222,0.0007538013,0.0022405672,0.0015885319,0.043940928,0.0011295052,0.0041639805,0.85461104],"study_design_scores_gemma":[0.000119288365,0.007772662,0.8993573,0.0011448489,0.0011228431,0.0121187875,0.003929139,0.005622985,0.033516586,0.0071143177,0.02790566,0.0002756932],"about_ca_topic_score_codex":0.0009818948,"about_ca_topic_score_gemma":0.0019016592,"teacher_disagreement_score":0.0014675453,"about_ca_system_score_codex":0.00012151523,"about_ca_system_score_gemma":0.00014355347,"threshold_uncertainty_score":0.005207658},"labels":[],"label_agreement":null},{"id":"W2615336482","doi":"10.1007/978-3-319-58700-4_26","title":"Lived Experiences and Technology in the Design of Urban Nature Parks for Accessibility","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Transport and Accessibility","field":"Social Sciences","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":"Université du Québec à Trois-Rivières; McGill University; Jewish Rehabilitation Hospital; Institut de Readaptation Gingras Lindsay de Montreal; Université de Montréal; Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Computer science; Architectural engineering; Human–computer interaction; Engineering","score_opus":0.0336600845712509,"score_gpt":0.31934388733255364,"score_spread":0.28568380276130273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615336482","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.56750697,0.004070591,0.05793893,0.004722828,0.00027765014,0.000110770285,0.0000942992,0.00010298983,0.36517498],"genre_scores_gemma":[0.9782528,0.00087024854,0.0049317256,0.00009754095,0.000015573647,0.000040910207,0.000019447316,0.000030765357,0.015740834],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9984321,0.0011916691,0.00002834445,0.00008735961,0.00012487792,0.00013567567],"domain_scores_gemma":[0.9991555,0.0005431764,0.00005504179,0.000060973372,0.000056591074,0.0001287714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012503755,0.0002824913,0.00015961517,0.00045731093,0.0028053937,0.0059837755,0.00085230754,0.00094339275,0.0076499814],"category_scores_gemma":[0.0022267427,0.00025563105,0.0002603713,0.00060855655,0.005677995,0.005182185,0.004381274,0.0011755247,0.00033339858],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074900454,0.00010882519,0.004077485,0.00040942593,0.000023737519,0.0018249495,0.6176853,0.0018485459,0.0021813405,0.30648488,0.004394435,0.06088608],"study_design_scores_gemma":[0.0000170613,0.00017479803,0.0050215484,0.0007767782,0.000036471272,0.0018334029,0.61662936,0.001548782,0.0018380414,0.073474675,0.29860267,0.000046324287],"about_ca_topic_score_codex":0.0013167409,"about_ca_topic_score_gemma":0.0037933583,"teacher_disagreement_score":0.0076499814,"about_ca_system_score_codex":0.0013146356,"about_ca_system_score_gemma":0.0010462217,"threshold_uncertainty_score":0.025591731},"labels":[],"label_agreement":null},{"id":"W2615426555","doi":"10.1007/11602613_39","title":"Space Efficient Algorithms for Ordered Tree Comparison","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Space (punctuation); Computational complexity theory; Theoretical computer science; Time complexity; Tree structure; Mathematics; Binary tree; Combinatorics","score_opus":0.025602120023943638,"score_gpt":0.2801166683802985,"score_spread":0.25451454835635484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615426555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011406416,0.0027090597,0.9675217,0.00044322287,0.00034266812,0.00028992436,0.00088317384,0.005374161,0.011029661],"genre_scores_gemma":[0.062920615,0.0010374573,0.92339706,0.00019736007,0.00022728356,0.00046032033,0.0023023263,0.0010166839,0.008440841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967443,0.00070637587,0.0003644534,0.0004866047,0.0013308388,0.0003675147],"domain_scores_gemma":[0.99389476,0.0031667855,0.0002882442,0.0016165805,0.00086625555,0.00016733762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017829795,0.001994707,0.002411473,0.003656718,0.0014962758,0.004519305,0.0046816044,0.0017879801,0.021689644],"category_scores_gemma":[0.0105539635,0.0010793472,0.0016588231,0.009520058,0.001167301,0.009697485,0.0037605052,0.0031878506,0.0067463345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062481523,0.00032379766,0.00040139057,0.00050915993,0.00007968613,0.00007007405,0.00025019853,0.026254166,0.006028578,0.11966479,0.033551592,0.81224185],"study_design_scores_gemma":[0.00044736976,0.00032807773,0.00052240666,0.00015867982,0.00011082179,0.00046558375,0.00027930312,0.29728678,0.012900141,0.6497146,0.037690625,0.00009568517],"about_ca_topic_score_codex":0.002457147,"about_ca_topic_score_gemma":0.00461379,"teacher_disagreement_score":0.021689644,"about_ca_system_score_codex":0.002388827,"about_ca_system_score_gemma":0.0027982153,"threshold_uncertainty_score":0.07255912},"labels":[],"label_agreement":null},{"id":"W2615648850","doi":"10.1007/978-3-319-58703-5_30","title":"FittsFace: Exploring Navigation and Selection Methods for Facial Tracking","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Computer science; Computer vision; Artificial intelligence; Selection (genetic algorithm); Tracking (education); Navigation system","score_opus":0.0701949637071678,"score_gpt":0.35865284975418715,"score_spread":0.2884578860470194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615648850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048079635,0.0009662083,0.9876425,0.00007311562,0.000047823436,0.00003362111,0.00014819877,0.0037109475,0.0025696491],"genre_scores_gemma":[0.09099328,0.0018732906,0.89341676,0.00013634491,0.00006361755,0.000113037364,0.000737325,0.0020223167,0.010643972],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994789,0.000091203045,0.000019547606,0.00014455961,0.00022101503,0.000044878165],"domain_scores_gemma":[0.99952304,0.00031099535,0.000015605909,0.000070072885,0.00005933255,0.000020977328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523223,0.0010414767,0.0009863484,0.0007877256,0.00040469784,0.0017319683,0.0018049851,0.00097179227,0.01323024],"category_scores_gemma":[0.0019104386,0.0005174902,0.0008698642,0.0009181044,0.00040328677,0.0019176378,0.0017087904,0.0008841699,0.0035324239],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022452939,0.00006528715,0.00047662103,0.00022504452,0.00006179825,0.00009267095,0.00034686478,0.010762492,0.026409179,0.009443957,0.009506969,0.94238466],"study_design_scores_gemma":[0.00008296078,0.00020669182,0.0013574036,0.00020618546,0.00008836791,0.00073930225,0.00039628873,0.84885246,0.047302663,0.043125354,0.057566844,0.000075472926],"about_ca_topic_score_codex":0.003877582,"about_ca_topic_score_gemma":0.0068844818,"teacher_disagreement_score":0.01323024,"about_ca_system_score_codex":0.00036800103,"about_ca_system_score_gemma":0.00035932774,"threshold_uncertainty_score":0.04425955},"labels":[],"label_agreement":null},{"id":"W2616597940","doi":"10.1007/978-3-319-58515-4_3","title":"Affective Walkthroughs and Heuristics: Evaluating Minecraft Hour of Code","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Carleton University","funders":"","keywords":"Software walkthrough; Computer science; Heuristics; Code (set theory); Storyboard; Software; Heuristic; Code review; Human–computer interaction; Source code; Multimedia; Software engineering; Software quality; Artificial intelligence; Software development; Programming language; Software construction; Operating system","score_opus":0.032752393159018865,"score_gpt":0.3150109180977697,"score_spread":0.28225852493875087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616597940","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.95359397,0.002815927,0.027857745,0.00018958021,0.00031746077,0.000538027,0.004341182,0.0053885835,0.004957442],"genre_scores_gemma":[0.94455445,0.0005672122,0.042249803,0.00015891732,0.00006425594,0.00029013524,0.008102215,0.0003494636,0.0036635664],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99903595,0.00030592017,0.00007695604,0.00030515878,0.00021117099,0.00006486655],"domain_scores_gemma":[0.98386025,0.012889397,0.0010540757,0.0007087773,0.0008051031,0.00068249344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012980278,0.0009282566,0.00048391896,0.0014756324,0.00030294017,0.000981675,0.0009960334,0.0011010304,0.0029916014],"category_scores_gemma":[0.016709888,0.00031210895,0.0003364429,0.0007871129,0.0002566384,0.0015417616,0.00091503246,0.00074714463,0.0010366939],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0118310535,0.003805399,0.04845153,0.002692825,0.0005837783,0.00035862956,0.0026603055,0.026096439,0.018924167,0.0009452065,0.038491633,0.84515893],"study_design_scores_gemma":[0.0018134778,0.009654271,0.18877196,0.0009905649,0.00087925576,0.00097069034,0.0034390881,0.7082157,0.04085217,0.0067072203,0.03739808,0.00030744768],"about_ca_topic_score_codex":0.0040113064,"about_ca_topic_score_gemma":0.011189242,"teacher_disagreement_score":0.0040113064,"about_ca_system_score_codex":0.00050267053,"about_ca_system_score_gemma":0.00069684273,"threshold_uncertainty_score":0.010007858},"labels":[],"label_agreement":null},{"id":"W2616739164","doi":"10.1007/978-3-319-59226-8_24","title":"Mining the Urdu Language-Based Web Content for Opinion Extraction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Lambton College","funders":"","keywords":"Computer science; Lexicon; Urdu; Natural language processing; Artificial intelligence; Sentiment analysis; Sentence; The Internet; Information retrieval; Linguistics; World Wide Web","score_opus":0.054301314640873,"score_gpt":0.309224164330501,"score_spread":0.254922849689628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616739164","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.49995917,0.008616838,0.3618102,0.0015735654,0.0015155065,0.0015818144,0.05741639,0.008480337,0.05904623],"genre_scores_gemma":[0.7633795,0.0038087664,0.165336,0.00037576284,0.0008662517,0.00080490834,0.050656743,0.0006334618,0.014138564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994106,0.00009801651,0.0000627548,0.00010516579,0.00024042268,0.000083043175],"domain_scores_gemma":[0.9989034,0.0002499854,0.00010506201,0.000059356695,0.00063262024,0.00004956336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174011,0.00080814713,0.0005333643,0.005520687,0.0005512751,0.0011999724,0.0004106592,0.00043101725,0.003722441],"category_scores_gemma":[0.0027437157,0.00018586281,0.00064160227,0.004214149,0.00019521087,0.001679414,0.00062936015,0.00054218987,0.0052203434],"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.0004937896,0.00026306705,0.01485442,0.0011947784,0.00014687478,0.0011153433,0.0008520918,0.0014857735,0.13800167,0.0033791722,0.055531807,0.78268117],"study_design_scores_gemma":[0.00010265507,0.0006815057,0.11487809,0.00093176775,0.0010246801,0.0034719585,0.0058318046,0.40103397,0.20759043,0.020965226,0.24321008,0.0002778543],"about_ca_topic_score_codex":0.0024110153,"about_ca_topic_score_gemma":0.0036476103,"teacher_disagreement_score":0.005520687,"about_ca_system_score_codex":0.00048671075,"about_ca_system_score_gemma":0.00059546577,"threshold_uncertainty_score":0.012452781},"labels":[],"label_agreement":null},{"id":"W2616891469","doi":"10.1007/978-3-319-59876-5_12","title":"Fully Deep Convolutional Neural Networks for Segmentation of the Prostate Gland in Diffusion-Weighted MR Images","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sunnybrook Health Science Centre; University of Waterloo; University of Toronto","funders":"","keywords":"Segmentation; Computer science; Convolutional neural network; Prostate cancer; Preprocessor; Artificial intelligence; Prostate; Prostate gland; Magnetic resonance imaging; Pattern recognition (psychology); Image segmentation; Sørensen–Dice coefficient; Artificial neural network; Computer vision; Cancer; Medicine; Radiology; Internal medicine","score_opus":0.012990051075787719,"score_gpt":0.2620556107359313,"score_spread":0.2490655596601436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616891469","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.01521924,0.010923031,0.9618399,0.0006772395,0.00022473915,0.00004942658,0.00097653235,0.0030987996,0.00699104],"genre_scores_gemma":[0.2452356,0.0165831,0.68853587,0.0004645724,0.0003345376,0.00012190344,0.0038214067,0.0012930932,0.04360995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999161,0.0000092426,0.0000046881096,0.000023813269,0.000030124793,0.000016007427],"domain_scores_gemma":[0.99986744,0.00006172211,0.000012512836,0.000015874559,0.000033535784,0.000008934568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029270537,0.0009959447,0.0005282414,0.00048265944,0.00014923909,0.00060873985,0.00083680084,0.0010100305,0.003899054],"category_scores_gemma":[0.00062230224,0.00059967814,0.00075374846,0.0005683554,0.00022975278,0.000629311,0.00065955863,0.0011127621,0.0017062406],"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.000144762,0.000058565605,0.000454487,0.000431791,0.000114295995,0.00017338603,0.00007321532,0.20174186,0.03469498,0.012234243,0.020013086,0.7298653],"study_design_scores_gemma":[0.000009582118,0.000039864237,0.0007473469,0.000078903424,0.0000517483,0.00025958085,0.00001182638,0.95061964,0.020799687,0.012933523,0.014423373,0.000025070134],"about_ca_topic_score_codex":0.007555378,"about_ca_topic_score_gemma":0.016233988,"teacher_disagreement_score":0.007555378,"about_ca_system_score_codex":0.0006557595,"about_ca_system_score_gemma":0.0007225206,"threshold_uncertainty_score":0.015022755},"labels":[],"label_agreement":null},{"id":"W2617214242","doi":"10.1007/978-3-319-59876-5_16","title":"A Note on Boosting Algorithms for Image Denoising","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Ontario Tech University","funders":"","keywords":"Boosting (machine learning); Computer science; Algorithm; Noise reduction; Image denoising; Artificial intelligence","score_opus":0.03993935407977997,"score_gpt":0.3234772141836269,"score_spread":0.28353786010384696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617214242","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.00067269144,0.0470038,0.9300774,0.0015756647,0.0041733943,0.00003484365,0.00009201501,0.00052266003,0.015847513],"genre_scores_gemma":[0.025182968,0.05905533,0.827074,0.0032872662,0.012935188,0.0001249466,0.00042606948,0.0013732748,0.07054107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998955,0.00027275507,0.000066032415,0.00022244282,0.00042910542,0.00005469359],"domain_scores_gemma":[0.99822193,0.0011117043,0.000037965918,0.00020790387,0.00036492286,0.000055553046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022874854,0.0014288232,0.001774339,0.001597247,0.0005838286,0.0020778775,0.0015618063,0.002147554,0.0051194434],"category_scores_gemma":[0.0038560482,0.0010584465,0.0018179977,0.0022994583,0.0015168685,0.0025661464,0.0015174535,0.006877215,0.0053982344],"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.00011292718,0.00009643067,0.00021655094,0.0008481478,0.00018598685,0.00014529469,0.00014606786,0.023547458,0.009107819,0.2663979,0.10361173,0.5955836],"study_design_scores_gemma":[0.000024066987,0.00011928023,0.0006368299,0.00031384613,0.00011727932,0.0006229789,0.00002605003,0.12686667,0.008473297,0.47164223,0.39104444,0.00011292331],"about_ca_topic_score_codex":0.0013913229,"about_ca_topic_score_gemma":0.001657404,"teacher_disagreement_score":0.0051194434,"about_ca_system_score_codex":0.00064239034,"about_ca_system_score_gemma":0.00045639244,"threshold_uncertainty_score":0.017126262},"labels":[],"label_agreement":null},{"id":"W2617222816","doi":"","title":"Linear object registration of interventional tools","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Anatomy and Medical Technology","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":"Queen's University","funders":"","keywords":"Image registration; Computer vision; Artificial intelligence; Point set registration; Ground truth; Computer science; Iterative closest point; Point (geometry); Set (abstract data type); Data set; Object (grammar); Algorithm; Mathematics; Point cloud; Image (mathematics)","score_opus":0.012183499617467447,"score_gpt":0.25112010292583886,"score_spread":0.2389366033083714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617222816","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.017189885,0.00068739796,0.97719884,0.0001112625,0.00004357318,0.00008156395,0.00007356865,0.0014117637,0.0032021317],"genre_scores_gemma":[0.44507253,0.0013464368,0.5381985,0.00015388388,0.00011373987,0.00021239449,0.0007311199,0.0013838038,0.012787521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980621,0.0006697045,0.00013662511,0.0003341777,0.00063297595,0.00016453407],"domain_scores_gemma":[0.9980913,0.0007349285,0.00020368748,0.0005750666,0.00033424547,0.00006082524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021066593,0.0007180424,0.0008895344,0.0022208665,0.0005352742,0.0032669152,0.0013809496,0.0014488907,0.0062581454],"category_scores_gemma":[0.0052510346,0.0009432292,0.0009149619,0.0026035432,0.0010011485,0.002322261,0.0023089952,0.0012948157,0.0036695353],"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.00094991445,0.00020535153,0.0027684309,0.00053708954,0.00015064384,0.00034171328,0.00049505435,0.04678995,0.11988687,0.02985563,0.0056204917,0.7923988],"study_design_scores_gemma":[0.00008436494,0.000580702,0.008243897,0.00015914632,0.00019818249,0.002658603,0.0003238602,0.66183585,0.26855758,0.022838615,0.03435655,0.00016266637],"about_ca_topic_score_codex":0.0012610771,"about_ca_topic_score_gemma":0.0012973023,"teacher_disagreement_score":0.0062581454,"about_ca_system_score_codex":0.0006822245,"about_ca_system_score_gemma":0.0015179752,"threshold_uncertainty_score":0.020935655},"labels":[],"label_agreement":null},{"id":"W2617377437","doi":"10.1007/978-3-319-59250-3_17","title":"Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Orienteering; Regret; Computer science; Bounded function; Routing (electronic design automation); Mathematical optimization; Computer network; Mathematics; Machine learning","score_opus":0.022737542150065376,"score_gpt":0.2701361861080368,"score_spread":0.24739864395797143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617377437","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.01245497,0.0010799781,0.9677046,0.0012286115,0.00018094138,0.00006931586,0.00032232061,0.0005250218,0.01643436],"genre_scores_gemma":[0.5278636,0.0029769246,0.4362336,0.0013167021,0.0009334234,0.0007189649,0.0016163226,0.0012467724,0.027093662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664307,0.0012279013,0.00013865059,0.00058459904,0.0009990175,0.0004066925],"domain_scores_gemma":[0.9904338,0.0068413573,0.00054406875,0.0011015717,0.0006161046,0.00046313836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033239631,0.0034417,0.0030887537,0.00094210287,0.0010797257,0.004346602,0.0031906248,0.0034209527,0.0075150644],"category_scores_gemma":[0.019774694,0.0013511196,0.0020286147,0.0018677055,0.003910601,0.005793621,0.0056531737,0.008973964,0.0017318298],"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.00036244097,0.00012844104,0.00028624586,0.000411658,0.00006989195,0.000110455,0.00021012092,0.39506587,0.0019827918,0.5530866,0.010784095,0.037501376],"study_design_scores_gemma":[0.00003563623,0.00005556406,0.00006720457,0.00005598064,0.000017005626,0.000033449312,0.000044163535,0.40702885,0.000500549,0.5897057,0.0024381075,0.000017759849],"about_ca_topic_score_codex":0.0016353171,"about_ca_topic_score_gemma":0.0017989827,"teacher_disagreement_score":0.0075150644,"about_ca_system_score_codex":0.0026174407,"about_ca_system_score_gemma":0.0023014052,"threshold_uncertainty_score":0.025140405},"labels":[],"label_agreement":null},{"id":"W2617497052","doi":"10.1007/978-3-319-59888-8_2","title":"Personal Research Agents on the Web of Linked Open Data","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Personalization; World Wide Web; Knowledge base; Semantics (computer science); Profiling (computer programming); Semantic Web; Information retrieval; Linked data; Data science; Programming language","score_opus":0.2825674025639389,"score_gpt":0.40327697917186245,"score_spread":0.12070957660792353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617497052","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.019550394,0.0040685344,0.4619417,0.021685174,0.0016214299,0.0003615145,0.000934463,0.006276749,0.48356003],"genre_scores_gemma":[0.19697325,0.0069276965,0.2841598,0.0037233413,0.001955152,0.00053207745,0.0034647253,0.0022037104,0.5000602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701416,0.0012738645,0.00017990083,0.00033001817,0.0010769609,0.00012513493],"domain_scores_gemma":[0.99405813,0.002381229,0.00035126417,0.0019336847,0.0006417707,0.0006339752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005517732,0.0004514845,0.0005349954,0.0022361916,0.002032594,0.008554884,0.0016640454,0.0026031,0.024484506],"category_scores_gemma":[0.01069273,0.00065197714,0.0005810731,0.0040241233,0.001591929,0.018004049,0.007280784,0.002566259,0.009193438],"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.00006184176,0.00011014134,0.0006815763,0.00014552695,0.000042828815,0.0002540888,0.0021604348,0.0020252473,0.0015508715,0.79332155,0.05688859,0.14275731],"study_design_scores_gemma":[0.000024499623,0.000022121705,0.0002901283,0.00013340484,0.000031068106,0.00016748905,0.00056700903,0.00838715,0.0020242948,0.28316084,0.7051672,0.00002489099],"about_ca_topic_score_codex":0.0010378838,"about_ca_topic_score_gemma":0.0016144479,"teacher_disagreement_score":0.024484506,"about_ca_system_score_codex":0.0010997866,"about_ca_system_score_gemma":0.0014921273,"threshold_uncertainty_score":0.08190888},"labels":[],"label_agreement":null},{"id":"W2617572518","doi":"10.1007/978-3-319-59876-5_70","title":"Footnote-Based Document Image Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Salient; AdaBoost; Support vector machine; Artificial intelligence; Key (lock); Feature (linguistics); Task (project management); Information retrieval; Font; Pattern recognition (psychology); Machine learning; Data mining","score_opus":0.024942363513238495,"score_gpt":0.2805036651627935,"score_spread":0.25556130164955504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617572518","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.037501067,0.00692223,0.7928426,0.00068937073,0.0050210766,0.001070223,0.017822344,0.05565992,0.082471125],"genre_scores_gemma":[0.14955501,0.0048242966,0.59370834,0.00060393714,0.0010750067,0.00037132128,0.05578615,0.0016181931,0.19245775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993905,0.000026658732,0.000037490146,0.00016343477,0.00028143768,0.00010044075],"domain_scores_gemma":[0.9991886,0.00008308706,0.000041983538,0.00017107725,0.00046578184,0.000049578644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004376858,0.0013702046,0.0011740123,0.00333176,0.0006831751,0.0020207623,0.0020671014,0.0009860867,0.05093917],"category_scores_gemma":[0.000978516,0.00026784083,0.00090406375,0.0029180786,0.00024238069,0.001594117,0.0011495753,0.0008968418,0.049496606],"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.00019837805,0.00009414446,0.0003120368,0.00018963026,0.000023777446,0.000073685966,0.000010560278,0.0008277032,0.038620777,0.0006767317,0.048428133,0.9105445],"study_design_scores_gemma":[0.00010144668,0.00072234316,0.00878,0.00030926822,0.00032787485,0.0018401596,0.0002480267,0.28811154,0.3810664,0.0061053094,0.31222537,0.00016211011],"about_ca_topic_score_codex":0.0030048043,"about_ca_topic_score_gemma":0.0051431013,"teacher_disagreement_score":0.05093917,"about_ca_system_score_codex":0.00047073798,"about_ca_system_score_gemma":0.0006653215,"threshold_uncertainty_score":0.17040849},"labels":[],"label_agreement":null},{"id":"W2617645851","doi":"10.1007/978-3-319-59876-5_45","title":"Classification Boosting by Data Decomposition Using Consensus-Based Combination of Classifiers","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical and Computational Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Boosting (machine learning); Classifier (UML); Decomposition; Artificial intelligence; Generalization; Machine learning; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.09257301002347595,"score_gpt":0.3379655773033772,"score_spread":0.24539256727990122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617645851","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.003937993,0.00018221827,0.9948014,0.00005506413,0.000067073874,0.000030861913,0.000017316852,0.00031442428,0.0005937027],"genre_scores_gemma":[0.22024937,0.00034571261,0.77466106,0.0002023046,0.0002461069,0.00018297887,0.00034374814,0.00020625023,0.0035625193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997292,0.0007592754,0.00018352627,0.0006362136,0.0009226639,0.0002063044],"domain_scores_gemma":[0.99574405,0.0012665133,0.00023769758,0.00074302993,0.0018212041,0.0001874967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046362774,0.0010548879,0.0030265441,0.0014650361,0.00085408794,0.0016946637,0.0023399442,0.0018381559,0.0026053453],"category_scores_gemma":[0.0060392497,0.0010647278,0.0021317168,0.0017535917,0.0008251494,0.001973855,0.0026627204,0.0021856376,0.0020815984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047059645,0.00025584165,0.0015776762,0.00026000766,0.0003580167,0.00011750816,0.00018885471,0.19322658,0.03597456,0.016869757,0.00831386,0.74238676],"study_design_scores_gemma":[0.000010987205,0.00005232253,0.00019188406,0.000010086187,0.000043940694,0.000050692575,0.000010490786,0.98927605,0.0037189235,0.0053123566,0.0013102228,0.000011920176],"about_ca_topic_score_codex":0.0010728637,"about_ca_topic_score_gemma":0.0013434534,"teacher_disagreement_score":0.0046362774,"about_ca_system_score_codex":0.00064263714,"about_ca_system_score_gemma":0.000977186,"threshold_uncertainty_score":0.024519265},"labels":[],"label_agreement":null},{"id":"W2617685473","doi":"10.1007/978-3-319-59876-5_11","title":"Ejection Fraction Estimation Using a Wide Convolutional Neural Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiovascular Function and Risk Factors","field":"Medicine","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":"Western University","funders":"","keywords":"Ejection fraction; Ventricle; Convolutional neural network; Computer science; Diastole; Systole; Artificial intelligence; Segmentation; Fraction (chemistry); Artificial neural network; Pattern recognition (psychology); Cardiology; Internal medicine; Medicine; Heart failure; Blood pressure","score_opus":0.0263295987452777,"score_gpt":0.2762699328850189,"score_spread":0.24994033413974118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617685473","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.03368021,0.0017747291,0.95816016,0.00031877897,0.00021195339,0.000029551184,0.00043235786,0.0017611489,0.0036310628],"genre_scores_gemma":[0.65426743,0.0024244767,0.31824312,0.00044271396,0.0003173432,0.000082120736,0.0015314873,0.00024597542,0.02244535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992394,0.000008109558,0.0000042803863,0.000028925957,0.000017527456,0.00001715942],"domain_scores_gemma":[0.999866,0.000059242237,0.000008713914,0.000015138432,0.000042657848,0.000008208854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000362405,0.0006787676,0.000458091,0.00038694643,0.00017167906,0.0004999833,0.0005540641,0.0007484483,0.0020836429],"category_scores_gemma":[0.0006156461,0.00034887987,0.0005272198,0.0002944048,0.000111532216,0.00048199808,0.0006331031,0.0007080188,0.0010327523],"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.00018492465,0.000088635636,0.0035130507,0.00007857191,0.0001467319,0.00017273337,0.000029113506,0.13900012,0.021732565,0.0020344586,0.0057464163,0.8272726],"study_design_scores_gemma":[0.0000061557953,0.000025402553,0.0026411985,0.00002010667,0.000040791194,0.00012344006,0.0000061900632,0.9877551,0.006003611,0.0017648723,0.0015986812,0.0000145653],"about_ca_topic_score_codex":0.005069771,"about_ca_topic_score_gemma":0.00820137,"teacher_disagreement_score":0.005069771,"about_ca_system_score_codex":0.00026001062,"about_ca_system_score_gemma":0.00038190652,"threshold_uncertainty_score":0.010080516},"labels":[],"label_agreement":null},{"id":"W2617918097","doi":"10.1007/978-3-319-59050-9_23","title":"Multimodal Brain Subnetwork Extraction Using Provincial Hub Guided Random Walks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Subnetwork; Computer science; Random walk; Artificial intelligence; Computer network; Statistics; Mathematics","score_opus":0.05218606923173045,"score_gpt":0.3050949298908288,"score_spread":0.25290886065909834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617918097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02852433,0.0004873638,0.96371365,0.00014503398,0.000054784672,0.00009623771,0.0007959999,0.0038318727,0.0023506195],"genre_scores_gemma":[0.4269209,0.0005146054,0.55638564,0.00017134301,0.00012541642,0.00027800008,0.0042325524,0.0013461981,0.010025466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997296,0.000042025582,0.00001216421,0.000104859806,0.000051127736,0.00006029585],"domain_scores_gemma":[0.9994941,0.00025277396,0.000045715235,0.00007801233,0.00009319178,0.0000361856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041282427,0.0014393596,0.0015709245,0.0030096995,0.00088539475,0.001217934,0.0012913776,0.001368705,0.0042714803],"category_scores_gemma":[0.0014023387,0.00072330807,0.0019098422,0.0026342573,0.00050448667,0.0011254397,0.0012104523,0.00095691055,0.0018457463],"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.00053295,0.00019576773,0.004260812,0.0003355078,0.0003367808,0.0005958364,0.00020859152,0.3774099,0.026540201,0.01684175,0.019712955,0.55302894],"study_design_scores_gemma":[0.000012775288,0.000016995255,0.000429835,0.0000101795895,0.000031834512,0.000064734755,0.000018548659,0.98943794,0.0020297356,0.007003991,0.0009335047,0.000009974315],"about_ca_topic_score_codex":0.008429809,"about_ca_topic_score_gemma":0.020416643,"teacher_disagreement_score":0.008429809,"about_ca_system_score_codex":0.0005458528,"about_ca_system_score_gemma":0.0009540329,"threshold_uncertainty_score":0.016761482},"labels":[],"label_agreement":null},{"id":"W2618099420","doi":"10.1007/978-3-319-59876-5_50","title":"A Novel Automatic Method to Evaluate Scoliotic Trunk Shape Changes in Different Postures","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scoliosis diagnosis and treatment","field":"Medicine","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":"Polytechnique Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"","keywords":"Trunk; Computer science; Deformity; Scoliosis; Artificial intelligence; Computer vision; Medicine; Surgery","score_opus":0.05841372117918575,"score_gpt":0.3578273891750771,"score_spread":0.29941366799589136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618099420","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.057524312,0.0013957168,0.9258049,0.00012986969,0.00044975555,0.00028185826,0.0018659636,0.007218603,0.0053290613],"genre_scores_gemma":[0.27795795,0.0010012392,0.69936645,0.0002920027,0.00025941824,0.0004214723,0.0034671482,0.00075456547,0.016479794],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995079,0.000039304934,0.00002811149,0.00015127289,0.00023115956,0.000042255433],"domain_scores_gemma":[0.99947435,0.000105532396,0.00003530738,0.000046443176,0.00030134566,0.00003712914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044244743,0.0007106677,0.0007107967,0.0022031835,0.0002847079,0.00077287544,0.0006832295,0.00092077366,0.0051393793],"category_scores_gemma":[0.00065217784,0.00030924185,0.00056606316,0.0012680069,0.00021825831,0.00054135796,0.00054139335,0.00036157886,0.0029825682],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047250057,0.000120849785,0.004738367,0.00021776996,0.00011584707,0.00013663001,0.000053085263,0.0021868122,0.17295821,0.00041796904,0.0067640925,0.8118178],"study_design_scores_gemma":[0.00018483683,0.0007658366,0.10987845,0.0001295585,0.0005137138,0.0051072836,0.00028813464,0.6158635,0.23740034,0.002146736,0.027450632,0.00027101196],"about_ca_topic_score_codex":0.001698483,"about_ca_topic_score_gemma":0.0040406864,"teacher_disagreement_score":0.0051393793,"about_ca_system_score_codex":0.00021845275,"about_ca_system_score_gemma":0.00041416314,"threshold_uncertainty_score":0.01719296},"labels":[],"label_agreement":null},{"id":"W2618134479","doi":"10.1007/978-3-319-59936-6_11","title":"Controlled and Uncontrolled SWAP Gates in Reversible Logic Synthesis","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Toffoli gate; Quantum gate; Computer science; Quantum circuit; Logic gate; Quantum logic; Gate count; Qubit; Controlled NOT gate; Swap (finance); Realization (probability); Arithmetic; Quantum computer; Quantum; Topology (electrical circuits); Algorithm; Quantum error correction; Mathematics; Quantum mechanics; Electrical engineering; Physics; Computer hardware; Engineering","score_opus":0.013179753917255418,"score_gpt":0.23549819117185333,"score_spread":0.2223184372545979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618134479","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.06856036,0.008348235,0.6363274,0.0010848872,0.0009349468,0.00019093104,0.00026796586,0.0007132725,0.28357196],"genre_scores_gemma":[0.82441986,0.005034845,0.09407574,0.00037192926,0.00030724058,0.0002036949,0.00018309816,0.00024335232,0.07516023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998024,0.000046279725,0.000010113477,0.000035303885,0.00008434995,0.00002156026],"domain_scores_gemma":[0.9998596,0.00007896191,0.0000079868805,0.0000347475,0.000012823513,0.0000058664427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026770963,0.0004150419,0.00035413323,0.00035198583,0.00038984945,0.0010330175,0.0006960273,0.00062763656,0.007571324],"category_scores_gemma":[0.00053623854,0.00028879775,0.00036489015,0.0005689857,0.0016964443,0.0016425295,0.00074759073,0.0010664928,0.0008511328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056114917,0.000023998738,0.000026096808,0.00008220505,0.0000073711776,0.000034062956,0.00004344168,0.011628419,0.0076370095,0.9413763,0.0010780535,0.03800688],"study_design_scores_gemma":[0.00002810813,0.00008842394,0.000062149134,0.000037795755,0.00001699797,0.000082926344,0.000023528017,0.07988348,0.022431443,0.87265944,0.024661874,0.000023844212],"about_ca_topic_score_codex":0.0002402181,"about_ca_topic_score_gemma":0.00047868083,"teacher_disagreement_score":0.007571324,"about_ca_system_score_codex":0.0004554125,"about_ca_system_score_gemma":0.000373246,"threshold_uncertainty_score":0.025328577},"labels":[],"label_agreement":null},{"id":"W2618190110","doi":"10.1007/978-3-319-60134-2_5","title":"Complexity of Proper Prefix-Convex Regular Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Regular language; Regular polygon; Combinatorics; Prefix code; Computer science; Discrete mathematics; Alphabet; Mathematics; Theoretical computer science; Algorithm; Linguistics; Automaton","score_opus":0.02884657845516872,"score_gpt":0.2612156032773482,"score_spread":0.2323690248221795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618190110","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.55731046,0.0022767186,0.30379534,0.0074732,0.00024133931,0.00014734609,0.0024517216,0.00075487734,0.1255489],"genre_scores_gemma":[0.9485477,0.0012068627,0.026235586,0.00036880866,0.00049013307,0.00018817636,0.0016301956,0.00031417827,0.021018272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717844,0.0005743289,0.00016766551,0.00057986384,0.0011425876,0.00035718468],"domain_scores_gemma":[0.9885915,0.008768827,0.0005969587,0.000841656,0.0006241669,0.00057705556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232985,0.00074093585,0.0013876541,0.0013245007,0.0014339971,0.0075659296,0.00237264,0.0014519929,0.012530947],"category_scores_gemma":[0.010785772,0.00091817137,0.0015097376,0.0022430655,0.0038673936,0.014916702,0.00338287,0.004621064,0.0011584675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012540648,0.000040063627,0.0005222859,0.00013788938,0.000019497356,0.00010120541,0.00048599407,0.00898466,0.0011258556,0.97651684,0.002079476,0.009860828],"study_design_scores_gemma":[0.00001469078,0.000009692378,0.00020980017,0.000010038937,0.000008990491,0.000079687765,0.000057736386,0.01576592,0.0004269251,0.9823784,0.0010264623,0.00001173383],"about_ca_topic_score_codex":0.001416359,"about_ca_topic_score_gemma":0.0010319995,"teacher_disagreement_score":0.012530947,"about_ca_system_score_codex":0.0032195924,"about_ca_system_score_gemma":0.0014990752,"threshold_uncertainty_score":0.041920185},"labels":[],"label_agreement":null},{"id":"W2618248930","doi":"10.1007/978-3-319-58625-0_21","title":"Music Imagery for Brain-Computer Interface Control","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Brain–computer interface; Computer science; Discriminative model; Brain activity and meditation; Active listening; Motor imagery; Rhythm; Interface (matter); Auditory cortex; Electroencephalography; Speech recognition; Psychology; Artificial intelligence; Neuroscience; Communication","score_opus":0.031186305228355093,"score_gpt":0.28227429539949245,"score_spread":0.25108799017113737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618248930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013545701,0.091763325,0.62920094,0.0015801152,0.0028996656,0.00013045016,0.00033817746,0.0025568614,0.2579848],"genre_scores_gemma":[0.4015015,0.04349223,0.24221994,0.0009386815,0.0031892883,0.0001818331,0.00081830315,0.00053189794,0.30712628],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999039,0.000013389016,0.000005141115,0.00001971381,0.00005076785,0.0000070982233],"domain_scores_gemma":[0.9999448,0.000022972177,0.0000031512234,0.000008932669,0.000015756314,0.000004401846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010259518,0.0005561453,0.00028850825,0.00033592273,0.00018179265,0.000803789,0.00073003676,0.00062215136,0.03061495],"category_scores_gemma":[0.00027366402,0.000103592305,0.00021171331,0.00040440593,0.00030196153,0.00073224405,0.00045463495,0.00055404194,0.005418675],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013252921,0.00003563633,0.000075284996,0.00066296716,0.000044255154,0.00014361276,0.00007984744,0.0018595803,0.059120808,0.044457864,0.019527175,0.8738605],"study_design_scores_gemma":[0.000091631264,0.00057859166,0.0018827119,0.00051940745,0.00013344672,0.0019187084,0.00017588814,0.06013212,0.08866467,0.12321176,0.72263163,0.00005942538],"about_ca_topic_score_codex":0.0002297631,"about_ca_topic_score_gemma":0.0005787133,"teacher_disagreement_score":0.03061495,"about_ca_system_score_codex":0.00018722654,"about_ca_system_score_gemma":0.00010257689,"threshold_uncertainty_score":0.10241717},"labels":[],"label_agreement":null},{"id":"W2618393310","doi":"10.1007/978-3-319-59063-9_60","title":"An Evaluation of Fuzzy Measure for Face Recognition","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Measure (data warehouse); Face (sociological concept); Facial recognition system; Fuzzy logic; Artificial intelligence; Pattern recognition (psychology); Data mining","score_opus":0.07926603880853486,"score_gpt":0.3165934306683353,"score_spread":0.23732739185980042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618393310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069610834,0.005060709,0.9142105,0.00018851703,0.00030243362,0.000117231866,0.00018948894,0.00041733216,0.009902899],"genre_scores_gemma":[0.66869485,0.0011577795,0.32564858,0.00007291638,0.00017669753,0.00011028077,0.00035211386,0.00008129043,0.0037054652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961061,0.00086366496,0.00018868512,0.0003596497,0.00232574,0.00015614048],"domain_scores_gemma":[0.99608755,0.0018360232,0.00014027592,0.00028736342,0.0015372819,0.00011162822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003542175,0.00061488966,0.0011120797,0.002740418,0.0005691029,0.0016749119,0.0012093167,0.0010072312,0.0024571235],"category_scores_gemma":[0.007598696,0.00016973526,0.0008606202,0.0014733458,0.0007208964,0.0015101051,0.000859588,0.00053203607,0.00039147114],"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.0009227015,0.00018293488,0.0036025345,0.0006108688,0.0001933499,0.00012385847,0.00024074814,0.045437463,0.051265754,0.06591258,0.004251768,0.8272555],"study_design_scores_gemma":[0.000029329318,0.0010887831,0.0074043353,0.000094280025,0.00016791162,0.0004900313,0.00016077404,0.9220406,0.03480818,0.02714694,0.006486471,0.00008250374],"about_ca_topic_score_codex":0.0018975033,"about_ca_topic_score_gemma":0.0014306001,"teacher_disagreement_score":0.003542175,"about_ca_system_score_codex":0.0018120635,"about_ca_system_score_gemma":0.0006051712,"threshold_uncertainty_score":0.018733025},"labels":[],"label_agreement":null},{"id":"W2618414278","doi":"10.1007/978-3-319-59876-5_6","title":"Discovery Radiomics via a Mixture of Deep ConvNet Sequencers for Multi-parametric MRI Prostate Cancer Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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 Toronto; University of Waterloo","funders":"","keywords":"Radiomics; Computer science; Prostate cancer; Artificial intelligence; Parametric statistics; Cancer; Medicine; Internal medicine","score_opus":0.027184691720546324,"score_gpt":0.32168693436866885,"score_spread":0.2945022426481225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618414278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0251877,0.0017023103,0.9637912,0.0005734976,0.00022475973,0.000098686025,0.0006395748,0.003507786,0.0042744665],"genre_scores_gemma":[0.35660875,0.0016856417,0.616609,0.0009014346,0.0003125969,0.0002225792,0.003605037,0.0006708576,0.01938421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996418,0.000077407305,0.000019131003,0.00009152569,0.00010497346,0.00006509558],"domain_scores_gemma":[0.9995153,0.00016081489,0.00004318012,0.00007339528,0.00015729603,0.000050103383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012980175,0.0013926757,0.0009748789,0.001148587,0.0004106821,0.0012217752,0.0017490516,0.0017696054,0.0034346925],"category_scores_gemma":[0.0018728728,0.00074108905,0.0011227883,0.000993883,0.00043992826,0.001490546,0.0017523416,0.0018698002,0.0023777809],"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.0004025039,0.0002041476,0.0013368333,0.00017391302,0.00016462458,0.00018816968,0.000098039025,0.12052238,0.028636951,0.008386342,0.013093285,0.8267928],"study_design_scores_gemma":[0.000008871627,0.00006617713,0.00029092902,0.000020791113,0.000033495227,0.00011903423,0.000021074144,0.9832017,0.008582914,0.004778287,0.0028600383,0.000016736556],"about_ca_topic_score_codex":0.0047991555,"about_ca_topic_score_gemma":0.012462358,"teacher_disagreement_score":0.0047991555,"about_ca_system_score_codex":0.0006114563,"about_ca_system_score_gemma":0.0012224918,"threshold_uncertainty_score":0.011490166},"labels":[],"label_agreement":null},{"id":"W2618446718","doi":"10.1007/978-3-319-59876-5_28","title":"Salient Object Detection in Images by Combining Objectness Clues in the RGBD Space","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"Université du Québec en Outaouais","funders":"","keywords":"Salient; Computer science; Artificial intelligence; Computer vision; Object (grammar); Pattern recognition (psychology); Bounding overwatch; Voting","score_opus":0.016545275110039143,"score_gpt":0.2744103355656552,"score_spread":0.2578650604556161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618446718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07672224,0.0059217974,0.9065922,0.00026193712,0.0003088331,0.0001108752,0.0004937931,0.002022285,0.0075661023],"genre_scores_gemma":[0.4376509,0.0048377197,0.5493314,0.00019515533,0.00031221876,0.000069201866,0.00075967994,0.00036648626,0.0064773303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998234,0.000015761041,0.000006944445,0.00005278092,0.000068373,0.00003273987],"domain_scores_gemma":[0.9998294,0.000054802058,0.000021446123,0.000023287454,0.000046841436,0.000024185554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031397215,0.00092462293,0.0009437834,0.0020660905,0.00018821367,0.0011288332,0.00060977205,0.0005212603,0.0037960059],"category_scores_gemma":[0.0008164898,0.00043629488,0.0006465064,0.0016707701,0.00040308828,0.0011693309,0.0011923363,0.00049575325,0.0011781601],"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.00031142286,0.00006577379,0.000972586,0.0005174289,0.00008348641,0.00016067094,0.0001212483,0.006389096,0.40103006,0.0041692783,0.00431723,0.5818618],"study_design_scores_gemma":[0.000073902425,0.00048036815,0.025930507,0.00020299973,0.00035579008,0.0018432244,0.00025967305,0.6351213,0.27235255,0.045210693,0.01804887,0.00012022634],"about_ca_topic_score_codex":0.0010644236,"about_ca_topic_score_gemma":0.0017603148,"teacher_disagreement_score":0.0037960059,"about_ca_system_score_codex":0.0002531313,"about_ca_system_score_gemma":0.00025926402,"threshold_uncertainty_score":0.012698948},"labels":[],"label_agreement":null},{"id":"W2618523870","doi":"10.1007/978-3-319-59050-9_40","title":"Direct Estimation of Regional Wall Thicknesses via Residual Recurrent Neural Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","cited_by":47,"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":"Computer science; Recurrent neural network; Artificial intelligence; Residual; Pattern recognition (psychology); Cardiac cycle; Convolutional neural network; Segmentation; Artificial neural network; Cardiac imaging; Frame (networking); Deep learning; Algorithm; Cardiology; Medicine","score_opus":0.02496877601745616,"score_gpt":0.28922090423683167,"score_spread":0.2642521282193755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618523870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013821998,0.0005087598,0.9831761,0.000073292475,0.000056081357,0.000017144463,0.00020014483,0.0013821693,0.00076432514],"genre_scores_gemma":[0.36667228,0.001154716,0.6196712,0.0001493317,0.00017879925,0.000113613365,0.0012600133,0.00058556115,0.010214487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998292,0.000035871675,0.000008856325,0.000060871564,0.000044717162,0.000020584132],"domain_scores_gemma":[0.99962366,0.0001714672,0.000044430504,0.00005805417,0.0000888997,0.000013500438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005759381,0.0011210915,0.0007232657,0.0003938383,0.00012312578,0.0006518538,0.0009539161,0.00081077893,0.0019890196],"category_scores_gemma":[0.001615905,0.00061322254,0.00061168446,0.000353089,0.00019036449,0.00086178456,0.00072996755,0.0010012715,0.0016588784],"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.00035938527,0.00008363503,0.0019836647,0.000218172,0.00016508474,0.00014393854,0.000086662905,0.21770903,0.059250172,0.0027638755,0.005131741,0.7121047],"study_design_scores_gemma":[0.000007882655,0.000028423534,0.00082463544,0.000016779308,0.000025085308,0.000066888926,0.000007487629,0.9890655,0.007620281,0.0015963687,0.0007268109,0.00001371759],"about_ca_topic_score_codex":0.0022793673,"about_ca_topic_score_gemma":0.0049220226,"teacher_disagreement_score":0.0022793673,"about_ca_system_score_codex":0.00020504638,"about_ca_system_score_gemma":0.00036822492,"threshold_uncertainty_score":0.006653905},"labels":[],"label_agreement":null},{"id":"W2618704331","doi":"10.1007/978-3-319-58625-0_23","title":"A Brain-Computer Interface Based on Abstract Visual and Auditory Imagery: Evidence for an Effect of Artistic Training","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"McMaster University","funders":"","keywords":"Computer science; Brain–computer interface; Interface (matter); Training (meteorology); Speech recognition; Human–computer interaction; Artificial intelligence; Computer graphics (images); Computer vision; Electroencephalography; Psychology; Operating system; Neuroscience","score_opus":0.05882236068757707,"score_gpt":0.3496368499082641,"score_spread":0.29081448922068703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618704331","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.9754553,0.0018611064,0.0068004094,0.0003096249,0.00030836253,0.00017385885,0.00033171353,0.00021698744,0.014542669],"genre_scores_gemma":[0.9897629,0.00096647674,0.0041288733,0.00038542025,0.00014602153,0.00014231258,0.0002109141,0.00008371472,0.004173428],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973947,0.0000616505,0.000018157776,0.000078080164,0.000074729054,0.000027976319],"domain_scores_gemma":[0.9984659,0.0011428901,0.000121040626,0.000104602186,0.00005662336,0.000108919994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046540113,0.0004488625,0.00031040597,0.0002887925,0.00014962809,0.0005151402,0.0005773938,0.00056670094,0.0144293085],"category_scores_gemma":[0.0047058947,0.00019573496,0.00022284579,0.0001832362,0.00057112216,0.00045464106,0.00043558134,0.00061363325,0.0010851646],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02998058,0.0047790227,0.008060669,0.0015726786,0.00046017196,0.0006058002,0.0006914692,0.00060837425,0.65491545,0.0014978364,0.0022473536,0.29458058],"study_design_scores_gemma":[0.0059099365,0.042560585,0.7522221,0.00047655604,0.0017366435,0.005859923,0.0007615031,0.007572951,0.16360976,0.00946887,0.009713332,0.00010782884],"about_ca_topic_score_codex":0.00029277572,"about_ca_topic_score_gemma":0.00026665477,"teacher_disagreement_score":0.0144293085,"about_ca_system_score_codex":0.00007420343,"about_ca_system_score_gemma":0.00011909442,"threshold_uncertainty_score":0.04827082},"labels":[],"label_agreement":null},{"id":"W2618707316","doi":"10.1007/978-3-319-59448-4","title":"Functional Imaging and Modelling of the Heart","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognitive science; Medical physics; Medicine; Psychology","score_opus":0.03259206377839233,"score_gpt":0.2965100009319937,"score_spread":0.26391793715360135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618707316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017681967,0.03202291,0.92745376,0.0013263467,0.0012351109,0.00002425955,0.0006091517,0.0010135605,0.03454664],"genre_scores_gemma":[0.07347406,0.098528594,0.5957047,0.0007621405,0.002957399,0.00017842212,0.0025533647,0.0011863749,0.224655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999026,0.000013191407,0.000003971104,0.000022671651,0.000052450454,0.0000050921367],"domain_scores_gemma":[0.99982953,0.00008846052,0.000009165622,0.000027408782,0.000033964316,0.000011473363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029873272,0.00094618276,0.0007768717,0.00069997757,0.000115143666,0.001048302,0.0011141011,0.0010056779,0.009819075],"category_scores_gemma":[0.00063643075,0.00044738708,0.0007800745,0.00073277706,0.00049358286,0.0010692374,0.0005612024,0.00093022303,0.005832463],"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.00007298794,0.000029935456,0.0002209106,0.0013687335,0.00011397081,0.00032466272,0.00009416722,0.13984865,0.024169428,0.11050369,0.118121095,0.6051318],"study_design_scores_gemma":[0.00002144814,0.00008621693,0.0012264783,0.00041287587,0.000074183794,0.0024216322,0.00003905291,0.32086018,0.010566404,0.24100365,0.42320326,0.00008460267],"about_ca_topic_score_codex":0.0008275144,"about_ca_topic_score_gemma":0.0009232748,"teacher_disagreement_score":0.009819075,"about_ca_system_score_codex":0.0003209613,"about_ca_system_score_gemma":0.00033566006,"threshold_uncertainty_score":0.032848},"labels":[],"label_agreement":null},{"id":"W2618770251","doi":"10.1007/978-3-319-59536-8_4","title":"Accommodating Openness Requirements in Software Platforms: A Goal-Oriented Approach","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Source Software Innovations","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Openness to experience; Software engineering; Requirements analysis; Software; Software quality; Functional requirement; Software development; Software requirements specification; Software design; Process management; Computer security; Engineering; Operating system","score_opus":0.03520333616468926,"score_gpt":0.28764914330778574,"score_spread":0.2524458071430965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618770251","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.018400898,0.00035518265,0.95239973,0.0020418447,0.000092560615,0.0001679466,0.000026830889,0.00048010083,0.026034908],"genre_scores_gemma":[0.41374767,0.0010375559,0.5711549,0.0004424628,0.0001313485,0.00031092603,0.00016947565,0.00041558538,0.012590041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640095,0.0011078919,0.00021167801,0.00037437203,0.001333659,0.0005715001],"domain_scores_gemma":[0.9948531,0.0024964167,0.0005350463,0.00088654115,0.0007939435,0.00043482528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049495194,0.0012553864,0.0007371489,0.0010797385,0.0013808504,0.005210698,0.002606353,0.0025134806,0.0019266318],"category_scores_gemma":[0.008931127,0.00088085304,0.0016965144,0.0010963352,0.002825375,0.0064017246,0.006259842,0.004263878,0.00071691733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855911,0.000316038,0.0015800061,0.000583347,0.00009730055,0.0009439723,0.0035372288,0.04893175,0.016105726,0.79625547,0.0037350447,0.12782851],"study_design_scores_gemma":[0.000052176634,0.00018394149,0.0007171247,0.0004523964,0.00017442557,0.00071943796,0.0021166895,0.17131796,0.014622418,0.75013083,0.059422713,0.00008984578],"about_ca_topic_score_codex":0.0008817494,"about_ca_topic_score_gemma":0.0010456917,"teacher_disagreement_score":0.005210698,"about_ca_system_score_codex":0.0012055375,"about_ca_system_score_gemma":0.0027305759,"threshold_uncertainty_score":0.026175916},"labels":[],"label_agreement":null},{"id":"W2618851316","doi":"10.1007/978-3-319-59876-5_10","title":"A Machine Learning-Driven Approach to Computational Physiological Modeling of Skin Cancer","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"Sunnybrook Health Science Centre; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.037050985723109484,"score_gpt":0.2839058038179022,"score_spread":0.2468548180947927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618851316","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.00664001,0.0008437656,0.988608,0.00050926773,0.00011070552,0.000029056175,0.00017709479,0.00023325428,0.0028487141],"genre_scores_gemma":[0.6179051,0.003073384,0.35816148,0.00060653436,0.00055853574,0.00040542523,0.00076659565,0.00031973104,0.018203136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998766,0.000038780458,0.0000074970562,0.000029446985,0.000036234025,0.000011406772],"domain_scores_gemma":[0.99949694,0.00035886012,0.000032236145,0.000025010471,0.00006544678,0.000021512806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004883829,0.00046174516,0.0006521512,0.00036245617,0.00030733054,0.00088296214,0.0015275069,0.00095732854,0.002204425],"category_scores_gemma":[0.0016563217,0.00047338143,0.0009906876,0.0004958166,0.00039575866,0.0005435005,0.0007482479,0.0013228228,0.0005579707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015440375,0.000029737419,0.00030510125,0.000052038413,0.00003522358,0.00006562413,0.000043300093,0.9516248,0.0015713536,0.016882844,0.0012790711,0.028095474],"study_design_scores_gemma":[8.084675e-7,0.0000035487997,0.000058921243,0.000002802351,0.000002174317,0.000012994818,0.0000016653682,0.9939184,0.00010874463,0.00547024,0.00041721712,0.0000023744624],"about_ca_topic_score_codex":0.0054346104,"about_ca_topic_score_gemma":0.0052142334,"teacher_disagreement_score":0.0054346104,"about_ca_system_score_codex":0.0006513946,"about_ca_system_score_gemma":0.00071495475,"threshold_uncertainty_score":0.0108059645},"labels":[],"label_agreement":null},{"id":"W2619009655","doi":"10.1007/978-3-319-59250-3_1","title":"The Two-Point Fano and Ideal Binary Clutters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Physics; Clutter; Mathematics; Pure mathematics; Computer science; Arithmetic; Telecommunications; Philosophy","score_opus":0.013322530168720365,"score_gpt":0.24383165557086064,"score_spread":0.23050912540214027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619009655","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.12852778,0.006642941,0.12044686,0.0038788307,0.0012067095,0.00006121232,0.00048233249,0.0003958558,0.7383574],"genre_scores_gemma":[0.86391,0.0033136494,0.022287235,0.00092803803,0.0014347904,0.00008391448,0.0003748395,0.0002461738,0.10742134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940217,0.000141131,0.000022949838,0.000113583024,0.00019603278,0.000124113],"domain_scores_gemma":[0.9993299,0.00026740337,0.00006481439,0.00011153146,0.000107648986,0.000118681484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007690137,0.0008721499,0.0007889114,0.0027899714,0.0023238633,0.0033882486,0.00074032147,0.0011929941,0.0118041625],"category_scores_gemma":[0.0027984455,0.00044992962,0.00059817167,0.0017435895,0.004535923,0.0050579174,0.0020341084,0.0023341828,0.0017366118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012261167,0.0000030179763,0.000026641334,0.0000092573955,0.0000010461046,0.00001237055,0.00004434533,0.00016989754,0.00008866701,0.99500966,0.00133112,0.0032918495],"study_design_scores_gemma":[0.000006421498,0.0000051066054,0.00006082515,0.0000123362315,0.0000020479897,0.000089054025,0.000031121665,0.00087413396,0.00014794087,0.98982215,0.008940335,0.000008569148],"about_ca_topic_score_codex":0.0008859514,"about_ca_topic_score_gemma":0.000516907,"teacher_disagreement_score":0.0118041625,"about_ca_system_score_codex":0.0013176303,"about_ca_system_score_gemma":0.0005229241,"threshold_uncertainty_score":0.039488852},"labels":[],"label_agreement":null},{"id":"W2619065915","doi":"10.1007/978-3-319-59876-5_73","title":"Light Field Estimation in the Ultraviolet Spectrum","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Université de Sherbrooke","funders":"","keywords":"Ultraviolet; Computer science; Light field; Computer vision; Photography; Artificial intelligence; Optics; Radiometry; Ultraviolet light; Formalism (music); Field (mathematics); Physics; Mathematics; Optoelectronics","score_opus":0.013818842969611944,"score_gpt":0.2791688546908642,"score_spread":0.2653500117212523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619065915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005836514,0.0011395399,0.9882068,0.00016190698,0.00005920095,0.000008642474,0.00004578199,0.0002918837,0.004249656],"genre_scores_gemma":[0.2667918,0.0039879023,0.7083914,0.00015596199,0.00032598805,0.000041520925,0.00048622178,0.00032198837,0.019497136],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998104,0.00005027879,0.000006997632,0.000046251454,0.00006918981,0.000016854076],"domain_scores_gemma":[0.99964917,0.00018284572,0.000024748286,0.000037768885,0.00008851788,0.000016933276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034823373,0.00043124615,0.0005638911,0.0006943253,0.00020408226,0.0010667391,0.00059752417,0.00057877373,0.0025699108],"category_scores_gemma":[0.0014801141,0.00029049272,0.00042605595,0.0005914856,0.0003615478,0.0013555599,0.00075546495,0.0009531957,0.0012625103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019105572,0.000054695174,0.0010709434,0.00028880883,0.000058898462,0.00007053123,0.0001253733,0.10014361,0.037263382,0.06542307,0.007512663,0.787797],"study_design_scores_gemma":[0.000011508216,0.000027063466,0.00086913817,0.0000671462,0.000017261451,0.00016730318,0.0000458607,0.92241824,0.014394075,0.055311646,0.0066464916,0.00002418875],"about_ca_topic_score_codex":0.0013051603,"about_ca_topic_score_gemma":0.0010235232,"teacher_disagreement_score":0.0025699108,"about_ca_system_score_codex":0.00029444127,"about_ca_system_score_gemma":0.00028869972,"threshold_uncertainty_score":0.008597195},"labels":[],"label_agreement":null},{"id":"W2619152567","doi":"10.1007/978-3-319-58625-0_6","title":"Attentional Trade-Offs Under Resource Scarcity","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural and Behavioral Psychology Studies","field":"Neuroscience","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scarcity; Neglect; Task (project management); Computer science; Resource (disambiguation); Recall; Cognitive psychology; Economics; Psychology; Microeconomics","score_opus":0.136692083939061,"score_gpt":0.34763881885781045,"score_spread":0.21094673491874946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619152567","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.82256126,0.0045764875,0.05704275,0.0029722727,0.00021741982,0.000030450847,0.0002742307,0.00022353644,0.1121016],"genre_scores_gemma":[0.99416155,0.0004088297,0.0021555538,0.000087781795,0.000054526274,0.000013170943,0.0000298695,0.000033309192,0.0030554445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996288,0.00009271338,0.000022375227,0.000073427625,0.00007364067,0.000109044355],"domain_scores_gemma":[0.9960427,0.0029696692,0.00031529434,0.0002682977,0.00017091488,0.00023319626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011482752,0.00033261636,0.00041130328,0.00031955374,0.0003457417,0.0015684337,0.00062588183,0.00079079455,0.0075476053],"category_scores_gemma":[0.008464255,0.0002525397,0.00025896955,0.00039360806,0.0006699874,0.0023102576,0.0011071307,0.00084736873,0.00050311995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00481052,0.00046894926,0.0089808535,0.00064023165,0.00032309623,0.0010401172,0.0007228229,0.09378167,0.1642288,0.4893872,0.008577377,0.22703825],"study_design_scores_gemma":[0.00010922129,0.0002683654,0.03023343,0.00006717375,0.00011596459,0.00045907157,0.00042472628,0.24119501,0.009558936,0.7144979,0.0030010575,0.000069055364],"about_ca_topic_score_codex":0.00053200335,"about_ca_topic_score_gemma":0.00056374865,"teacher_disagreement_score":0.0075476053,"about_ca_system_score_codex":0.0007127054,"about_ca_system_score_gemma":0.00027446932,"threshold_uncertainty_score":0.025249302},"labels":[],"label_agreement":null},{"id":"W2619249253","doi":"10.1007/978-3-319-59876-5_37","title":"A Better Trajectory Shape Descriptor for Human Activity Recognition","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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 Windsor","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Pattern recognition (psychology); Trajectory; Representation (politics); Feature vector; Cluster analysis; Set (abstract data type); Sparse approximation; Feature (linguistics); Margin (machine learning); Computation; Computer vision; Algorithm; Machine learning","score_opus":0.05910630769663831,"score_gpt":0.28114998269737734,"score_spread":0.22204367500073902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619249253","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.013542022,0.000968874,0.9781326,0.00019363865,0.00045664434,0.00009896812,0.0015489208,0.003348842,0.0017094215],"genre_scores_gemma":[0.24690333,0.0020017028,0.7147506,0.0004703903,0.00045246936,0.00027190498,0.013016176,0.0009990404,0.021134391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952316,0.000044152257,0.000036409307,0.00016898227,0.00016569646,0.000061491846],"domain_scores_gemma":[0.9994355,0.000076302524,0.000031252017,0.00017625063,0.00023337995,0.000047363847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003678649,0.0008207893,0.0014195348,0.0012384723,0.00032777578,0.0009348628,0.00095556985,0.0008689078,0.00872258],"category_scores_gemma":[0.0011712818,0.0003119635,0.0009942373,0.0023683188,0.0003424653,0.0014132775,0.0008397223,0.0012315296,0.0062380247],"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.00036759535,0.00017064165,0.0008678006,0.00014132087,0.000057825928,0.00008424092,0.00003146902,0.017390443,0.06629657,0.0046130116,0.017768487,0.89221054],"study_design_scores_gemma":[0.000071782204,0.00033201,0.004296011,0.000050147242,0.000073064286,0.00067887345,0.00008474902,0.9190451,0.04115815,0.0074134143,0.026706515,0.00009015002],"about_ca_topic_score_codex":0.007914638,"about_ca_topic_score_gemma":0.00745765,"teacher_disagreement_score":0.00872258,"about_ca_system_score_codex":0.0004739205,"about_ca_system_score_gemma":0.0008878798,"threshold_uncertainty_score":0.02917993},"labels":[],"label_agreement":null},{"id":"W2619324736","doi":"10.1007/978-3-319-59448-4_4","title":"Cartan Frames for Heart Wall Fiber Motion","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Computer science; Motion (physics); Frame (networking); Fiber; Artificial intelligence; Mechanics; Computer vision; Physics; Materials science; Telecommunications","score_opus":0.05562735939141506,"score_gpt":0.3494575874783898,"score_spread":0.29383022808697473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619324736","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.0017959174,0.0023290478,0.9824426,0.0002446427,0.00061150495,0.000030823543,0.00038352126,0.001417222,0.010744654],"genre_scores_gemma":[0.03366797,0.0057564527,0.917703,0.00022371311,0.00084283686,0.000100601515,0.0015200484,0.0012483441,0.03893709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997967,0.00003757409,0.000011491657,0.000054063614,0.00008293032,0.000017313254],"domain_scores_gemma":[0.9996977,0.00008066803,0.000022327677,0.000070529815,0.00010799848,0.000020945648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913487,0.0012383868,0.00059479586,0.0012455786,0.00042582286,0.0013001411,0.0008524464,0.0010344534,0.018125974],"category_scores_gemma":[0.0012979469,0.0004788536,0.0005376583,0.001249137,0.00041731796,0.0013510089,0.0008318068,0.0013368961,0.008446853],"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.00008918796,0.000023433571,0.00015235876,0.00028490165,0.00003871875,0.00013520192,0.00014396067,0.013249764,0.016980516,0.16891275,0.057014003,0.74297523],"study_design_scores_gemma":[0.000026216414,0.00009712899,0.0011519298,0.00024586587,0.00006287084,0.00060942373,0.00010997637,0.44787255,0.02110436,0.17256431,0.3560704,0.000085020445],"about_ca_topic_score_codex":0.002334595,"about_ca_topic_score_gemma":0.003906541,"teacher_disagreement_score":0.018125974,"about_ca_system_score_codex":0.00035701558,"about_ca_system_score_gemma":0.00045059877,"threshold_uncertainty_score":0.060637474},"labels":[],"label_agreement":null},{"id":"W2619331413","doi":"10.1007/978-3-319-59876-5_17","title":"K-Autoregressive Clustering: Application on Terahertz Image Analysis","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Terahertz technology and applications","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":"Université de Sherbrooke","funders":"","keywords":"Autoregressive model; Cluster analysis; Computer science; Pixel; Series (stratigraphy); STAR model; Image (mathematics); Algorithm; Time series; Artificial intelligence; Terahertz radiation; Pattern recognition (psychology); Mathematics; Machine learning; Statistics; Autoregressive integrated moving average; Physics","score_opus":0.008960698520014031,"score_gpt":0.24350426835980166,"score_spread":0.23454356983978764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619331413","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.005132952,0.0007655314,0.9880884,0.00016195307,0.000102398444,0.00003495213,0.00016471805,0.0021453525,0.003403751],"genre_scores_gemma":[0.09155476,0.0013687888,0.89520776,0.000112246715,0.00012343278,0.00007369601,0.00045077706,0.0008771742,0.01023138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960405,0.00008432428,0.000022882676,0.00010159342,0.00015471422,0.000032501568],"domain_scores_gemma":[0.99932206,0.00025752003,0.00005861419,0.000113009504,0.00022368586,0.000025064783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059564743,0.00073616713,0.0009719271,0.0013839765,0.00061334216,0.0013689727,0.001261777,0.0012957589,0.0046104426],"category_scores_gemma":[0.0016616216,0.0004950858,0.0010156024,0.0030183254,0.0004806217,0.00075741095,0.0009596787,0.0010065108,0.0036435265],"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.00016165581,0.00012931983,0.0009313786,0.0005355572,0.0001378255,0.00022755809,0.00037891662,0.191027,0.053653225,0.03877685,0.021511197,0.6925295],"study_design_scores_gemma":[0.000009489291,0.00003109046,0.001399985,0.000030995045,0.000039204733,0.0002552747,0.00009885656,0.9449059,0.017430998,0.020033283,0.01571056,0.000054405522],"about_ca_topic_score_codex":0.004061096,"about_ca_topic_score_gemma":0.0055332095,"teacher_disagreement_score":0.0046104426,"about_ca_system_score_codex":0.0006593478,"about_ca_system_score_gemma":0.0005815269,"threshold_uncertainty_score":0.015423477},"labels":[],"label_agreement":null},{"id":"W2619398955","doi":"10.1007/978-3-319-59876-5_47","title":"Mesh-Based Active Model Initialization for Multiple Organ Segmentation in MR Images","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Initialization; Computer science; Segmentation; Active contour model; Artificial intelligence; Image segmentation; Computer vision; Scale-space segmentation; Convergence (economics); Pattern recognition (psychology)","score_opus":0.03212577520410622,"score_gpt":0.31323481752314225,"score_spread":0.28110904231903605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619398955","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.0015526789,0.00023467153,0.996298,0.00005569814,0.000045907538,0.000030821277,0.000060702067,0.0010801533,0.0006414339],"genre_scores_gemma":[0.07145271,0.0007122187,0.92042047,0.00014758014,0.000084141975,0.00020791979,0.00069711823,0.0014338751,0.004844043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995109,0.0001116599,0.00003533771,0.0001034203,0.00019425846,0.00004444651],"domain_scores_gemma":[0.99927527,0.0003561447,0.00005831038,0.00013701014,0.00014030351,0.000033032862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081716117,0.0010463608,0.0013657276,0.001174142,0.0005307359,0.0019062645,0.0024424095,0.002296962,0.005309369],"category_scores_gemma":[0.002291469,0.0013010579,0.001804467,0.0014834385,0.000550773,0.00132449,0.0017227435,0.0023187678,0.0032168205],"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.00027621145,0.00009909948,0.00049822865,0.00045082349,0.00018969314,0.00019095877,0.00026437192,0.3412875,0.0556005,0.013846777,0.012651405,0.5746444],"study_design_scores_gemma":[0.000008935036,0.000020541283,0.00015027114,0.000024612798,0.000023953731,0.00010104306,0.00001684544,0.98050284,0.010705404,0.0045029563,0.0039244127,0.000018212942],"about_ca_topic_score_codex":0.0034681864,"about_ca_topic_score_gemma":0.0056926697,"teacher_disagreement_score":0.005309369,"about_ca_system_score_codex":0.00079732656,"about_ca_system_score_gemma":0.001043558,"threshold_uncertainty_score":0.017761648},"labels":[],"label_agreement":null},{"id":"W2619631212","doi":"10.1007/978-3-319-59063-9_10","title":"Convergence and Rates of Convergence of Recursive Radial Basis Functions Networks in Function Learning and Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Concordia University","funders":"","keywords":"Radial basis function; Convergence (economics); Computer science; Radial basis function network; Basis (linear algebra); Function (biology); Basis function; Artificial intelligence; Applied mathematics; Mathematical optimization; Algorithm; Artificial neural network; Mathematics; Mathematical analysis","score_opus":0.022969933640991667,"score_gpt":0.2593289651635659,"score_spread":0.23635903152257423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619631212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044641882,0.020668183,0.9194969,0.0016993317,0.0005507042,0.00016383361,0.0002897808,0.0007712513,0.011718095],"genre_scores_gemma":[0.48624706,0.01896765,0.46590775,0.000732507,0.0012181788,0.00091264956,0.001217071,0.0021844073,0.022612592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939997,0.0033326868,0.0003709984,0.0007256156,0.0011969433,0.0003741318],"domain_scores_gemma":[0.8970223,0.08587222,0.002200689,0.003246857,0.010727711,0.0009302964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02330307,0.0022898384,0.002106982,0.00281406,0.0010255919,0.0036512893,0.004423346,0.0039096503,0.0045568966],"category_scores_gemma":[0.12551728,0.00145825,0.0018068942,0.0025313075,0.0037299676,0.007030752,0.004386254,0.006203329,0.0017045748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000628637,0.00016571216,0.0032054372,0.001039601,0.00021176846,0.00014009807,0.00080487516,0.49876785,0.002443155,0.310866,0.009409795,0.17231707],"study_design_scores_gemma":[0.000018402474,0.000058488804,0.0005993084,0.00015548196,0.000046540925,0.0000794456,0.00006697318,0.9372719,0.0012867218,0.05897324,0.0014054283,0.000038050057],"about_ca_topic_score_codex":0.005486115,"about_ca_topic_score_gemma":0.0032285876,"teacher_disagreement_score":0.02330307,"about_ca_system_score_codex":0.0036632698,"about_ca_system_score_gemma":0.0021258339,"threshold_uncertainty_score":0.123239934},"labels":[],"label_agreement":null},{"id":"W2619642276","doi":"10.1007/978-3-319-59876-5_26","title":"Sunshine Hours and Sunlight Direction Using Shadow Detection in a Video","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Shadow (psychology); Sunlight; Computer science; Pixel; Computer vision; Artificial intelligence; Tracking (education); Tree (set theory); Histogram; Remote sensing; Geography; Image (mathematics); Mathematics; Physics; Optics","score_opus":0.031864249929926695,"score_gpt":0.2943429173177775,"score_spread":0.2624786673878508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619642276","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.72350234,0.0022368168,0.253162,0.00012453579,0.0003583222,0.00009896168,0.003557211,0.0015950312,0.015364802],"genre_scores_gemma":[0.9117219,0.00131784,0.07894754,0.000049389757,0.00015937234,0.000031723113,0.0030226992,0.00016832593,0.004581348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999,0.0000057056927,0.0000040174627,0.000035405214,0.00003363681,0.000021190368],"domain_scores_gemma":[0.9998702,0.000025811023,0.000018740975,0.000009939863,0.00005714571,0.000018221805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009020157,0.00048033724,0.0004294149,0.0012604923,0.00018429506,0.00052585243,0.00029268113,0.00030729157,0.0014176773],"category_scores_gemma":[0.00034074284,0.0001877815,0.0003151889,0.0013175701,0.00012015275,0.00036461718,0.000255057,0.00031280483,0.0007959726],"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.00078608474,0.0002323548,0.052158657,0.0004541397,0.00016251668,0.00052717084,0.00026468874,0.017124487,0.19879553,0.00064441335,0.00615175,0.7226982],"study_design_scores_gemma":[0.000050799037,0.00037865533,0.39466554,0.00014964593,0.00038284014,0.001494931,0.00082863675,0.48997328,0.10017498,0.001730317,0.01004168,0.00012864622],"about_ca_topic_score_codex":0.005071705,"about_ca_topic_score_gemma":0.010824068,"teacher_disagreement_score":0.005071705,"about_ca_system_score_codex":0.0001807792,"about_ca_system_score_gemma":0.0002126516,"threshold_uncertainty_score":0.010084331},"labels":[],"label_agreement":null},{"id":"W2619682367","doi":"10.1007/978-3-319-59876-5_25","title":"Creating Immersive Virtual Reality Scenes Using a Single RGB-D Camera","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; RGB color model; Computer vision; Virtual reality; Artificial intelligence; Computer graphics (images); Immersion (mathematics); Augmented reality; Mathematics","score_opus":0.04290844085275546,"score_gpt":0.31179591911486193,"score_spread":0.26888747826210646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619682367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146739045,0.0005133755,0.964308,0.00008777552,0.00015775807,0.00014644867,0.00033521428,0.0030752693,0.016702177],"genre_scores_gemma":[0.14919916,0.001215396,0.8349668,0.00014155229,0.000050583236,0.00019145121,0.00058383506,0.0010714657,0.012579727],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965036,0.000044102322,0.000016761365,0.00007861151,0.00016062507,0.00004946532],"domain_scores_gemma":[0.999718,0.00010315526,0.000020085286,0.00006044709,0.000051406223,0.00004691042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026035318,0.0017387237,0.0006094801,0.00059639587,0.0002969772,0.0017548542,0.0010684421,0.00058346364,0.021565815],"category_scores_gemma":[0.00081026455,0.0011936227,0.0012354401,0.0004342046,0.00044310355,0.0012448296,0.0024504925,0.001051944,0.004205809],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031115967,0.00028660768,0.0005941665,0.0012789951,0.00020600192,0.0008756881,0.0013964872,0.055500932,0.42573628,0.024530202,0.01995478,0.46932867],"study_design_scores_gemma":[0.00025399175,0.0010139197,0.00529414,0.00057296903,0.0003410939,0.008019249,0.0012897166,0.27392972,0.39720201,0.023909856,0.28765225,0.00052113185],"about_ca_topic_score_codex":0.00078074494,"about_ca_topic_score_gemma":0.001600555,"teacher_disagreement_score":0.021565815,"about_ca_system_score_codex":0.00022349627,"about_ca_system_score_gemma":0.0004078868,"threshold_uncertainty_score":0.072144866},"labels":[],"label_agreement":null},{"id":"W2619720332","doi":"10.1007/978-3-319-58625-0_31","title":"Towards Technologically Assisted Mindfulness Meditation Practice in Older Adults: An Analysis of Difficulties Faced and Design Suggestions for Neurofeedback","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mindfulness and Compassion Interventions","field":"Psychology","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":"Amorfix (Canada); University of Toronto","funders":"","keywords":"Neurofeedback; Meditation; Mindfulness; Computer science; Mindfulness meditation; Brain–computer interface; Psychotherapist; Psychology; Psychiatry; Electroencephalography","score_opus":0.03816374793935578,"score_gpt":0.3401724573415621,"score_spread":0.3020087094022063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619720332","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.82682383,0.020510918,0.110898554,0.009271691,0.00051505165,0.0005912726,0.00018909114,0.0003296374,0.030870022],"genre_scores_gemma":[0.7572997,0.020297801,0.19275981,0.002071519,0.00017515059,0.00045595653,0.0003094732,0.000148537,0.026482051],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9994783,0.00017323108,0.00004114881,0.000064210944,0.00021225403,0.000031000618],"domain_scores_gemma":[0.9986338,0.0010065299,0.000102818885,0.000038698763,0.0001634645,0.000054695145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016172142,0.00029880248,0.00019123117,0.0004440181,0.00052792835,0.0012477689,0.00070268684,0.0007457394,0.0020066183],"category_scores_gemma":[0.0038828312,0.00016594635,0.0002609989,0.0005244256,0.0004950504,0.0010895483,0.000711725,0.00077495334,0.0002733279],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025448445,0.0006380744,0.017543219,0.0013492006,0.000050704257,0.00072846474,0.018561658,0.0004601864,0.042428315,0.005027898,0.0037394215,0.9092184],"study_design_scores_gemma":[0.00015548042,0.005687587,0.6833501,0.006768699,0.00050295965,0.014289924,0.05582001,0.010134053,0.055358224,0.02858144,0.13913941,0.00021219919],"about_ca_topic_score_codex":0.0007542662,"about_ca_topic_score_gemma":0.0034284033,"teacher_disagreement_score":0.0020066183,"about_ca_system_score_codex":0.00041425825,"about_ca_system_score_gemma":0.00087398494,"threshold_uncertainty_score":0.00855273},"labels":[],"label_agreement":null},{"id":"W2619743618","doi":"10.1007/978-3-319-59876-5_46","title":"Classification Using Mixture of Discriminative Learners: The Case of Compositional Data","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"Université de Sherbrooke","funders":"","keywords":"Discriminative model; Computer science; Dirichlet distribution; Constant (computer programming); Mixing (physics); Bounded function; Artificial intelligence; Data set; Set (abstract data type); Pattern recognition (psychology); Synthetic data; Data mining; Mathematics","score_opus":0.08490247001877421,"score_gpt":0.3108184915323863,"score_spread":0.22591602151361206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619743618","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.05586877,0.0012695855,0.9400653,0.0007108104,0.0000848912,0.00006935243,0.00013356867,0.0004384295,0.0013592487],"genre_scores_gemma":[0.7073396,0.00092804164,0.2815718,0.00055227574,0.00046453066,0.00017180506,0.00087364967,0.00023553957,0.007862806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744546,0.0012303932,0.00014334774,0.00056276604,0.0003636425,0.00025436672],"domain_scores_gemma":[0.9808739,0.014347525,0.0006394816,0.002064586,0.0015877937,0.00048676363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00963181,0.0009839208,0.0023705664,0.0012461364,0.0008404387,0.0022861778,0.0035003352,0.0034128292,0.0020826228],"category_scores_gemma":[0.022126652,0.0009642044,0.0014891083,0.0018382077,0.0016238117,0.0056015356,0.0032046195,0.0037198598,0.0010682635],"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.0014806606,0.0006399096,0.0110965185,0.00053288735,0.00042370777,0.000664312,0.0008764863,0.3927631,0.0054620695,0.062448207,0.00901541,0.51459664],"study_design_scores_gemma":[0.000013656049,0.00003095659,0.00024389567,0.00001356691,0.000019543244,0.000065133034,0.00003206429,0.9757461,0.0006974522,0.022642944,0.00048495008,0.000009828713],"about_ca_topic_score_codex":0.003564341,"about_ca_topic_score_gemma":0.006303086,"teacher_disagreement_score":0.00963181,"about_ca_system_score_codex":0.00093531003,"about_ca_system_score_gemma":0.00088303664,"threshold_uncertainty_score":0.050938487},"labels":[],"label_agreement":null},{"id":"W2619788868","doi":"10.1007/978-3-319-59250-3_23","title":"Min-Max Theorems for Packing and Covering Odd (u, v)-trails","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"","keywords":"Combinatorics; Disjoint sets; Cover (algebra); Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Vertex cover; Packing problems","score_opus":0.03460716648484819,"score_gpt":0.33221708495910884,"score_spread":0.29760991847426066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619788868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18677166,0.0034213462,0.6664425,0.0047231754,0.00064840657,0.00018568285,0.0025009974,0.0012614916,0.13404474],"genre_scores_gemma":[0.79829127,0.00378068,0.13947695,0.0015599784,0.0011881256,0.0005892613,0.0026408432,0.0019810572,0.050491843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998247,0.00038960436,0.00010527994,0.00041575576,0.00041859157,0.0004237044],"domain_scores_gemma":[0.9930676,0.0044733277,0.0004950925,0.0008444406,0.00047207196,0.0006474767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741029,0.002408796,0.0021661741,0.0031260832,0.0029843708,0.007511726,0.0039325557,0.0018274342,0.016127566],"category_scores_gemma":[0.011001725,0.0017217557,0.0027200838,0.0040669558,0.0036474299,0.0149471,0.005236476,0.006015767,0.001983908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002069456,0.00006355814,0.0006300347,0.000236835,0.000042854797,0.00008989826,0.00035835322,0.006573072,0.0012343319,0.9629678,0.007972934,0.019623451],"study_design_scores_gemma":[0.000017502252,0.00001912024,0.00018979328,0.000028596734,0.000028804836,0.000073102565,0.00006234585,0.0127783585,0.0006538025,0.9834589,0.002677072,0.0000125589395],"about_ca_topic_score_codex":0.001512267,"about_ca_topic_score_gemma":0.0019459272,"teacher_disagreement_score":0.016127566,"about_ca_system_score_codex":0.0031298492,"about_ca_system_score_gemma":0.0015402393,"threshold_uncertainty_score":0.05395204},"labels":[],"label_agreement":null},{"id":"W2619793529","doi":"10.1007/978-3-319-59448-4_10","title":"Image Segmentation and Modeling of the Pediatric Tricuspid Valve in Hypoplastic Left Heart Syndrome","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Queen's University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Heart, Lung, and Blood Institute","keywords":"Hypoplastic left heart syndrome; Tricuspid valve; Medicine; Ventricle; Segmentation; Atrioventricular valve; Heart disease; Cardiology; Artificial intelligence; Internal medicine; Computer science; Anatomy","score_opus":0.014613746954745693,"score_gpt":0.31319434950863917,"score_spread":0.29858060255389346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619793529","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.6102382,0.0016261807,0.3821765,0.00070247886,0.000087528184,0.0001419317,0.0006790547,0.0014799259,0.0028682586],"genre_scores_gemma":[0.88557667,0.0008901433,0.11027917,0.00009008512,0.00004850162,0.000044561188,0.00057984464,0.00022690203,0.0022641039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998822,0.00002171187,0.000009374367,0.000029193232,0.00003669671,0.000020712101],"domain_scores_gemma":[0.99978393,0.000103676015,0.000035241068,0.000017976525,0.000035559697,0.000023624718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030087386,0.00044590863,0.0003257484,0.0008821805,0.00019169506,0.0011306147,0.00060678,0.0011206564,0.00082107284],"category_scores_gemma":[0.00079181325,0.0003464813,0.0006520287,0.0003936887,0.00024663535,0.00027962064,0.00027487733,0.00038375318,0.000279618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007880889,0.00017351487,0.021137532,0.0004880134,0.00017560592,0.007485975,0.0007587272,0.39718089,0.3044386,0.0045524654,0.0029998198,0.2598208],"study_design_scores_gemma":[0.000013395755,0.00007846326,0.008523408,0.00003661705,0.000043859953,0.0026549208,0.00010689427,0.9463268,0.039597206,0.00091544644,0.0016771209,0.000025734189],"about_ca_topic_score_codex":0.006049219,"about_ca_topic_score_gemma":0.0050163376,"teacher_disagreement_score":0.006049219,"about_ca_system_score_codex":0.0004085168,"about_ca_system_score_gemma":0.0006657826,"threshold_uncertainty_score":0.0120280385},"labels":[],"label_agreement":null},{"id":"W2619823956","doi":"10.1007/978-3-319-71147-8_14","title":"The Cop Number of the One-Cop-Moves Game on Planar Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Vertex (graph theory); Planar graph; Combinatorics; Graph; Computer science; Planar; Combinatorial game theory; Mathematics; Discrete mathematics; Game theory; Mathematical economics; Sequential game; Computer graphics (images)","score_opus":0.03279651819903657,"score_gpt":0.2876047472265531,"score_spread":0.25480822902751654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619823956","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.47355852,0.0018126388,0.18399607,0.003713879,0.0010551785,0.00031644534,0.0009975962,0.00038737507,0.33416227],"genre_scores_gemma":[0.92509544,0.0014312267,0.02313737,0.00031184856,0.00044352768,0.0004193661,0.0007161045,0.00030396762,0.04814122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.0003383658,0.000047498543,0.00022522616,0.00029000035,0.00028493092],"domain_scores_gemma":[0.9953608,0.0027287516,0.00043090872,0.00027722967,0.00028922549,0.0009129384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010042436,0.0014191355,0.0022209478,0.0018978943,0.0021876665,0.006091317,0.0032752142,0.0026026927,0.014900274],"category_scores_gemma":[0.0076606674,0.0008161515,0.0011894442,0.0019352159,0.0040694247,0.00687959,0.0021477481,0.0041200495,0.0015651657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023053406,0.00007510171,0.00032806737,0.00014538103,0.000027300972,0.000085071035,0.00021741659,0.01456586,0.0012755016,0.9651569,0.0061733634,0.011719578],"study_design_scores_gemma":[0.00004110767,0.000046232082,0.0003159284,0.000043647895,0.000020637517,0.00008289411,0.00008936199,0.03947881,0.0005374923,0.95652986,0.0027862233,0.00002794331],"about_ca_topic_score_codex":0.0016481251,"about_ca_topic_score_gemma":0.0013807182,"teacher_disagreement_score":0.014900274,"about_ca_system_score_codex":0.0023710693,"about_ca_system_score_gemma":0.001780415,"threshold_uncertainty_score":0.04984635},"labels":[],"label_agreement":null},{"id":"W2619846146","doi":"10.1007/978-3-319-59876-5_1","title":"A Weight-Selection Strategy on Training Deep Neural Networks for Imbalanced Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; MNIST database; Artificial intelligence; Artificial neural network; Selection (genetic algorithm); Machine learning; Set (abstract data type); Class (philosophy); Deep neural networks; Training (meteorology); Pattern recognition (psychology)","score_opus":0.050856760569540214,"score_gpt":0.2947353926549329,"score_spread":0.2438786320853927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619846146","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.018646197,0.00053306494,0.9775367,0.00034852876,0.00021266537,0.00008621103,0.00007028265,0.00069774524,0.001868634],"genre_scores_gemma":[0.36802,0.0006463373,0.6187212,0.0005141899,0.00041527342,0.00033878215,0.00059168896,0.0003695086,0.010383104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.0002116417,0.000074125994,0.00013884873,0.00026596343,0.00008885488],"domain_scores_gemma":[0.9981791,0.0006852484,0.000107246764,0.00035789172,0.00057641853,0.00009413993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023425329,0.001395864,0.0010978731,0.0008159058,0.000620939,0.0010305292,0.0020608862,0.0012867857,0.0030435203],"category_scores_gemma":[0.0065540206,0.00056676305,0.0005843571,0.0012754513,0.00060310436,0.0018332013,0.0021124713,0.0025292581,0.0010743912],"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.00034707817,0.0003228464,0.001709505,0.00011740233,0.00015576497,0.0001675068,0.00013812941,0.11690799,0.023340287,0.017963609,0.011497241,0.8273327],"study_design_scores_gemma":[0.000029971405,0.000061654115,0.00032564616,0.000020333,0.00003566786,0.000057449764,0.000024275052,0.9787291,0.0049065826,0.01444203,0.0013572758,0.000010014185],"about_ca_topic_score_codex":0.0018418928,"about_ca_topic_score_gemma":0.0045410134,"teacher_disagreement_score":0.0030435203,"about_ca_system_score_codex":0.0006079942,"about_ca_system_score_gemma":0.0008776205,"threshold_uncertainty_score":0.012388647},"labels":[],"label_agreement":null},{"id":"W2619874469","doi":"10.1007/978-3-319-60033-8_32","title":"Achieving Secure and Seamless IP Communications for Group-Oriented Software Defined Vehicular Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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 New Brunswick","funders":"","keywords":"Computer science; IPsec; Computer network; Roaming; Mobility management; Software-defined networking; Handover; OpenFlow; IPv6; The Internet; Operating system","score_opus":0.013128884948170935,"score_gpt":0.22930010159610714,"score_spread":0.2161712166479362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619874469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014178394,0.0037504854,0.9398099,0.00053801027,0.00044320562,0.00006131062,0.00005174761,0.0010004083,0.040166482],"genre_scores_gemma":[0.6717516,0.010531171,0.27276653,0.00036722602,0.0005235544,0.00015456142,0.00040719332,0.0004039448,0.04309415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995433,0.000050387556,0.000022885148,0.000047305664,0.00024335977,0.000092830014],"domain_scores_gemma":[0.9997358,0.000078021825,0.000019565836,0.00008411235,0.00006352767,0.000018995064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037496985,0.0008375236,0.00034935185,0.0005159887,0.00045155396,0.0015909986,0.0009581772,0.00074259203,0.0033050945],"category_scores_gemma":[0.00090337015,0.00034265517,0.0002973469,0.0006066878,0.00065320206,0.0018229696,0.0027199904,0.0015324776,0.0020049403],"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.000097799064,0.00005765805,0.00031043077,0.00038197573,0.000045775334,0.0003137305,0.00036867187,0.05939021,0.029912189,0.3827011,0.016994108,0.50942636],"study_design_scores_gemma":[0.000024877458,0.00019189986,0.00038534196,0.00016824673,0.000051675164,0.0010141139,0.00025370842,0.37243667,0.040391445,0.42865032,0.1563938,0.000037878646],"about_ca_topic_score_codex":0.00036943113,"about_ca_topic_score_gemma":0.00045912227,"teacher_disagreement_score":0.0033050945,"about_ca_system_score_codex":0.00043472764,"about_ca_system_score_gemma":0.0004219647,"threshold_uncertainty_score":0.011056662},"labels":[],"label_agreement":null},{"id":"W2619921146","doi":"10.1007/3-540-45108-0","title":"Intelligent Tutoring Systems","year":2000,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Université de Montréal; Université du Québec à Montréal","keywords":"Computer science; Intelligent decision support system; Intelligent tutoring system; Multimedia; Artificial intelligence; Library science; Human–computer interaction","score_opus":0.020259699001489107,"score_gpt":0.2473622804375922,"score_spread":0.2271025814361031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619921146","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013446288,0.011012963,0.4251589,0.0016123711,0.0021674717,0.00033668167,0.0014320841,0.02739308,0.5174401],"genre_scores_gemma":[0.14791468,0.005819297,0.14608864,0.00077875133,0.00075623416,0.00029381292,0.0040805778,0.0008046644,0.69346344],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997625,0.000035452,0.0000149571915,0.000057431665,0.000109565575,0.000020197764],"domain_scores_gemma":[0.9997644,0.000056915862,0.000009315908,0.0000582166,0.00008912343,0.000022052698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027977346,0.00057476974,0.0005054262,0.00050276786,0.00038946854,0.0014506377,0.0008499824,0.00092216436,0.050995],"category_scores_gemma":[0.0011740957,0.00022717327,0.00022223004,0.00048350534,0.00021563545,0.0014402405,0.0010384351,0.0006025557,0.030833092],"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.00007967661,0.00010915705,0.00023723472,0.00015131547,0.000017144808,0.000059581027,0.00009083679,0.0027039973,0.008112685,0.016584571,0.10071746,0.8711364],"study_design_scores_gemma":[0.000058509828,0.0002169927,0.0013588197,0.00013001973,0.000058586604,0.00049888215,0.00009774678,0.04105882,0.024646802,0.036166538,0.8956758,0.000032523352],"about_ca_topic_score_codex":0.000410407,"about_ca_topic_score_gemma":0.00056622236,"teacher_disagreement_score":0.050995,"about_ca_system_score_codex":0.00027120658,"about_ca_system_score_gemma":0.00031502487,"threshold_uncertainty_score":0.17059523},"labels":[],"label_agreement":null},{"id":"W2619965968","doi":"10.1007/978-3-319-59050-9_18","title":"Quantifying the Uncertainty in Model Parameters Using Gaussian Process-Based Markov Chain Monte Carlo: An Application to Cardiac Electrophysiological Models","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","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":"Dalhousie University","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Surrogate model; Sampling (signal processing); Posterior probability; Gaussian process; Importance sampling; Algorithm; Monte Carlo method; Slice sampling; Identifiability; Uncertainty quantification; Mathematical optimization; Probabilistic logic; Gaussian; Bayesian probability; Statistics; Artificial intelligence; Machine learning; Mathematics","score_opus":0.04504832461782304,"score_gpt":0.2983332651976994,"score_spread":0.2532849405798764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619965968","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.0019239502,0.00025852188,0.996938,0.00011507285,0.000019045026,0.000008764008,0.000023998811,0.00010714897,0.00060550316],"genre_scores_gemma":[0.18831924,0.001640697,0.8054774,0.00026666428,0.00015362697,0.00013525183,0.00020802801,0.00048072296,0.0033184947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989717,0.00049684616,0.000059451686,0.00015893702,0.00026124885,0.00005188837],"domain_scores_gemma":[0.98860335,0.010101607,0.00035952014,0.00037175874,0.00043106146,0.00013255948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049645766,0.0014111417,0.001974247,0.0010332287,0.0007543212,0.0031410346,0.002438378,0.003325472,0.0023307987],"category_scores_gemma":[0.019335419,0.0013315844,0.0016621975,0.0015933703,0.0018625906,0.0032225393,0.0030596328,0.0038893246,0.00045505818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030312518,0.000034218356,0.00036483293,0.00007884341,0.000051753737,0.00006319551,0.000106798296,0.8831317,0.00073822646,0.086856425,0.00093419274,0.027609583],"study_design_scores_gemma":[0.0000018941064,0.0000039464894,0.00004203399,0.000009714907,0.0000070502956,0.00001365774,0.0000045145653,0.9623642,0.00012479453,0.03714677,0.00027222093,0.000009382505],"about_ca_topic_score_codex":0.008485319,"about_ca_topic_score_gemma":0.008885072,"teacher_disagreement_score":0.008485319,"about_ca_system_score_codex":0.0018035853,"about_ca_system_score_gemma":0.002082191,"threshold_uncertainty_score":0.026255488},"labels":[],"label_agreement":null},{"id":"W2620065579","doi":"10.1007/978-3-319-59876-5_66","title":"Non-dictionary Aided Sparse Unmixing of Hyperspectral Images via Weighted Nonnegative Matrix Factorization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Hyperspectral imaging; Computer science; Non-negative matrix factorization; Multiplicative function; Pattern recognition (psychology); Matrix decomposition; Pixel; Matrix (chemical analysis); Set (abstract data type); Artificial intelligence; Multiplicative noise; Sparse matrix; Noise (video); Algorithm; Image (mathematics); Mathematics","score_opus":0.013698609520878922,"score_gpt":0.24022965815926867,"score_spread":0.22653104863838974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620065579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047718966,0.0002567654,0.9930669,0.00007169639,0.000057723675,0.000021432583,0.00006564816,0.00019755705,0.0014904002],"genre_scores_gemma":[0.07715761,0.0007993401,0.9142348,0.00010497738,0.000093767325,0.00011079386,0.0006687258,0.00023780476,0.0065921736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964845,0.000074091,0.000015330013,0.00007256017,0.00016167459,0.000027859267],"domain_scores_gemma":[0.9996228,0.00016020898,0.00004279075,0.000074069954,0.00008424436,0.00001590196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043392778,0.0010127467,0.00072819786,0.00040176112,0.00024820736,0.00075264316,0.0008610344,0.0006895278,0.00293337],"category_scores_gemma":[0.0013306615,0.00042681166,0.0009317181,0.0008615617,0.0004907084,0.0018702148,0.0015696095,0.0014287982,0.0014547269],"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.00022823273,0.00015421608,0.0003168382,0.00055402407,0.00011613706,0.0001554772,0.00021237943,0.1410968,0.15589726,0.036252752,0.008811988,0.656204],"study_design_scores_gemma":[0.000009599693,0.00005639455,0.00020792973,0.000019491219,0.00001956258,0.00016878358,0.000040430947,0.960492,0.018790064,0.014439139,0.0057352274,0.000021367836],"about_ca_topic_score_codex":0.00070354185,"about_ca_topic_score_gemma":0.0017029081,"teacher_disagreement_score":0.00293337,"about_ca_system_score_codex":0.00018456604,"about_ca_system_score_gemma":0.00041256403,"threshold_uncertainty_score":0.00981313},"labels":[],"label_agreement":null},{"id":"W2620145492","doi":"10.1007/978-3-319-59876-5_67","title":"Stroke Width Transform for Linear Structure Detection: Application to River and Road Extraction from High-Resolution Satellite Images","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automated Road and Building Extraction","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":"Computer Research Institute of Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Synthetic aperture radar; Context (archaeology); Remote sensing; Satellite; Radar; Pattern recognition (psychology); Telecommunications; Geography","score_opus":0.007305108505042261,"score_gpt":0.23278578962984983,"score_spread":0.22548068112480757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620145492","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.021086754,0.0007547112,0.9703591,0.00010095006,0.00006307252,0.00006231762,0.00047154113,0.0040132785,0.0030883106],"genre_scores_gemma":[0.12664899,0.0019977503,0.8600912,0.0000699249,0.000078219025,0.00010066219,0.0013147726,0.00061410194,0.009084342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998204,0.000015474852,0.000013125973,0.000043839074,0.000090425776,0.000016723356],"domain_scores_gemma":[0.999726,0.00010269983,0.00002247212,0.000033822398,0.000100219535,0.000014737015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031754846,0.0007315759,0.00057504454,0.0012717934,0.00021601182,0.0008120554,0.00068599655,0.0007318635,0.0052670846],"category_scores_gemma":[0.0007667544,0.000373047,0.0004987766,0.0022357309,0.00024559884,0.0006562605,0.00061293686,0.0005767596,0.0037808334],"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.000105261104,0.00007751806,0.00067594304,0.00021084216,0.0000383915,0.00011727458,0.00008144022,0.008759161,0.11098102,0.0016594535,0.005458427,0.8718352],"study_design_scores_gemma":[0.000035429544,0.00016550656,0.0067078597,0.000060133912,0.00011142943,0.00091245904,0.00015160313,0.72778434,0.23097774,0.0053442963,0.027690828,0.0000584588],"about_ca_topic_score_codex":0.0016001154,"about_ca_topic_score_gemma":0.0026899509,"teacher_disagreement_score":0.0052670846,"about_ca_system_score_codex":0.0001735534,"about_ca_system_score_gemma":0.00041972852,"threshold_uncertainty_score":0.017620146},"labels":[],"label_agreement":null},{"id":"W2620222954","doi":"10.1007/978-3-319-59876-5_61","title":"Particle Swarm Optimization Approach for the Segmentation of Retinal Vessels from Fundus Images","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; False positive paradox; Particle swarm optimization; Artificial intelligence; Segmentation; Fundus (uterus); Sensitivity (control systems); Computer vision; Detector; Convergence (economics); Image segmentation; Pattern recognition (psychology); Algorithm","score_opus":0.03101209468314258,"score_gpt":0.2965370010942478,"score_spread":0.2655249064111052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620222954","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.0046797525,0.0004596088,0.9935096,0.000094048686,0.000041471838,0.00002343639,0.000028944718,0.00022948717,0.00093374663],"genre_scores_gemma":[0.15402535,0.0013340347,0.83701044,0.00012595918,0.0001300276,0.00021837706,0.00028742925,0.00017441016,0.006693896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998665,0.000034870798,0.000010642328,0.000034832276,0.000038250702,0.000014867753],"domain_scores_gemma":[0.9997453,0.00013961227,0.000019018174,0.000016132006,0.000068149326,0.000011761426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724184,0.000819481,0.0010474763,0.00065728865,0.00035275225,0.0008070709,0.00087736547,0.0013891502,0.0016101841],"category_scores_gemma":[0.0010278461,0.00057803834,0.0008905822,0.0007966062,0.0003591231,0.0005297155,0.0005507108,0.00095103757,0.00045071886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013599955,0.000062200255,0.00047397034,0.00021544323,0.00011221606,0.000108884546,0.00015260611,0.7502027,0.008248884,0.0069813267,0.004447303,0.22885837],"study_design_scores_gemma":[0.000004328659,0.000011294982,0.00009202222,0.0000051183238,0.000007696091,0.000011558887,0.000005897186,0.9980102,0.00048286232,0.0008995022,0.00046636886,0.0000030990398],"about_ca_topic_score_codex":0.011267688,"about_ca_topic_score_gemma":0.0059752124,"teacher_disagreement_score":0.011267688,"about_ca_system_score_codex":0.00049022335,"about_ca_system_score_gemma":0.00076714327,"threshold_uncertainty_score":0.022404194},"labels":[],"label_agreement":null},{"id":"W2620317457","doi":"10.1007/978-3-319-59876-5_21","title":"An Event-Based Optical Flow Algorithm for Dynamic Vision Sensors","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","field":"Engineering","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 Lethbridge","funders":"","keywords":"Optical flow; Computer science; Event (particle physics); Computer vision; Detector; Artificial intelligence; Algorithm; Motion (physics); Real-time computing; Image (mathematics); Telecommunications","score_opus":0.011878551598841576,"score_gpt":0.27901535749979917,"score_spread":0.26713680590095756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620317457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028937869,0.00013230293,0.99574983,0.00005915475,0.0000589772,0.000048126698,0.000046534777,0.0005050954,0.00050628465],"genre_scores_gemma":[0.070447214,0.00033374864,0.9254601,0.0001124865,0.00009079806,0.00012618017,0.0002724624,0.00011441077,0.003042519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997186,0.00003276842,0.000018057084,0.00007570302,0.00012323572,0.000031605847],"domain_scores_gemma":[0.999666,0.000089990375,0.000028103015,0.000043199525,0.00014893286,0.00002375488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007202129,0.0008252387,0.00084025174,0.00094748096,0.00052500906,0.0011132435,0.0015970379,0.0009788097,0.003479368],"category_scores_gemma":[0.0012209993,0.0004881467,0.00063771586,0.0009410635,0.00033752396,0.0015195278,0.0010267284,0.0013128826,0.00097170525],"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.00029626768,0.00018653926,0.00041551818,0.000099409066,0.000049630242,0.000037076978,0.00004053836,0.05518795,0.040207688,0.012186948,0.0043816874,0.8869108],"study_design_scores_gemma":[0.000017116941,0.000048235062,0.00029104867,0.000010754776,0.000012161889,0.00004952852,0.0000066028265,0.98062104,0.0127859395,0.0033547021,0.0027877323,0.000015079091],"about_ca_topic_score_codex":0.0039457516,"about_ca_topic_score_gemma":0.0046361103,"teacher_disagreement_score":0.0039457516,"about_ca_system_score_codex":0.00074804795,"about_ca_system_score_gemma":0.0012911353,"threshold_uncertainty_score":0.011639595},"labels":[],"label_agreement":null},{"id":"W2620524432","doi":"10.1007/978-3-319-59448-4_14","title":"Slice-to-Volume Image Registration Models for MRI-Guided Cardiac Procedures","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Ontario Tech University","funders":"","keywords":"Affine transformation; Image registration; Jaccard index; Computer science; Artificial intelligence; Parametric statistics; Similarity (geometry); Computer vision; Dice; Volume (thermodynamics); Algorithm; Cardiac magnetic resonance; Pattern recognition (psychology); Magnetic resonance imaging; Image (mathematics); Mathematics; Medicine","score_opus":0.02713408122242943,"score_gpt":0.3353481412557164,"score_spread":0.30821406003328694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620524432","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.0029754213,0.0017557607,0.9905496,0.00020424764,0.000101291946,0.000057506124,0.0003394564,0.002263457,0.0017531663],"genre_scores_gemma":[0.16250211,0.008191933,0.80324155,0.0003690538,0.00032455652,0.00035310767,0.0036567615,0.0034718665,0.017889092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993868,0.0001523127,0.00004282694,0.00012008111,0.00025259116,0.00004540676],"domain_scores_gemma":[0.99924064,0.00034068862,0.00008240302,0.00013403194,0.00017103476,0.0000311174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244186,0.0010124404,0.0011104732,0.000807107,0.00030474894,0.0021588686,0.0021196352,0.0014843266,0.00391408],"category_scores_gemma":[0.00287048,0.0010030618,0.0022198027,0.0013378469,0.00043210658,0.0013616905,0.0010953523,0.0019809958,0.0043177516],"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.00019585295,0.000081882805,0.0006951482,0.00036750772,0.00021112165,0.00014953145,0.00018789478,0.36525297,0.015538242,0.020834586,0.018368592,0.5781166],"study_design_scores_gemma":[0.000008531474,0.00007389458,0.0005709488,0.00006480294,0.000060064922,0.0005025143,0.000026811484,0.9609405,0.008789081,0.013793645,0.015122155,0.000046955472],"about_ca_topic_score_codex":0.0035078595,"about_ca_topic_score_gemma":0.006189378,"teacher_disagreement_score":0.00391408,"about_ca_system_score_codex":0.00067182025,"about_ca_system_score_gemma":0.0011452612,"threshold_uncertainty_score":0.013093948},"labels":[],"label_agreement":null},{"id":"W2620895032","doi":"10.1007/978-3-319-60876-1_14","title":"BinShape: Scalable and Robust Binary Library Function Identification Using Function Shape","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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","funders":"","keywords":"Computer science; Identification (biology); Function (biology); Binary number; Scalability; Algorithm; Artificial intelligence; Database; Mathematics; Arithmetic","score_opus":0.016816653939947607,"score_gpt":0.24310752253974596,"score_spread":0.22629086859979836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620895032","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.0069200033,0.0008890381,0.88150537,0.00012810032,0.00014923718,0.00012967152,0.0016388241,0.103438355,0.0052013644],"genre_scores_gemma":[0.075629935,0.0007224598,0.8773825,0.00039743347,0.00008079488,0.00036156992,0.008846037,0.012819867,0.02375942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863297,0.00009891354,0.00006742501,0.00022061473,0.0008294098,0.0001507196],"domain_scores_gemma":[0.9992724,0.00018564149,0.000060231676,0.00025429245,0.0001816137,0.000045732217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007515376,0.0023563593,0.0018502576,0.0025427893,0.001031199,0.0024498235,0.0039375145,0.0011531948,0.019808209],"category_scores_gemma":[0.002262641,0.001025122,0.0017933643,0.0021452399,0.00074914546,0.0032335094,0.004218153,0.0019622722,0.017796554],"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.0005242067,0.00012779995,0.00064748555,0.00027927873,0.000079289035,0.00013405168,0.00008713289,0.012585077,0.033614196,0.012358527,0.07096597,0.86859703],"study_design_scores_gemma":[0.00010933274,0.00016662478,0.001180018,0.000117193595,0.0000662195,0.00064094155,0.00011793672,0.6825629,0.18939689,0.04060511,0.084857225,0.00017964038],"about_ca_topic_score_codex":0.0034541506,"about_ca_topic_score_gemma":0.00543283,"teacher_disagreement_score":0.019808209,"about_ca_system_score_codex":0.0010916574,"about_ca_system_score_gemma":0.0015181104,"threshold_uncertainty_score":0.06626505},"labels":[],"label_agreement":null},{"id":"W2621038882","doi":"10.1007/978-3-319-60042-0_6","title":"A New System for the Dynamic Shortest Route Problem","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Private Network-to-Network Interface; Mathematical optimization; Routing (electronic design automation); Shortest Path Faster Algorithm; Vehicle routing problem; Link-state routing protocol; Theoretical computer science; Mathematics; Computer network; Routing protocol; Graph","score_opus":0.017406907414024283,"score_gpt":0.26238217472316294,"score_spread":0.24497526730913866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621038882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024436973,0.00040807153,0.9847252,0.00022782628,0.00056382385,0.000104075756,0.0002982345,0.000558791,0.010670195],"genre_scores_gemma":[0.08223642,0.001216372,0.8775169,0.00036496556,0.0007563805,0.00071097404,0.0016553587,0.0006406261,0.03490207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998895,0.00028269985,0.000103491504,0.00026955502,0.00036093022,0.00008839309],"domain_scores_gemma":[0.9992274,0.00022746329,0.00005884908,0.00015171032,0.00027060873,0.00006395999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159498,0.0010254366,0.0010687858,0.0014429973,0.0009819607,0.002212779,0.0019540929,0.0013321401,0.017697645],"category_scores_gemma":[0.00320306,0.0004765824,0.0010380361,0.0016362485,0.00088141125,0.0030609362,0.0032290753,0.002806904,0.0067331833],"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.00016525331,0.00010798703,0.00044764543,0.00041753083,0.0000632342,0.00023092695,0.00023638518,0.09529471,0.009089232,0.6424888,0.037514377,0.2139439],"study_design_scores_gemma":[0.00007384757,0.000103187645,0.00022738041,0.000058549922,0.00004488921,0.0002655278,0.00006302672,0.6995477,0.0022602107,0.1920665,0.10523224,0.000056989003],"about_ca_topic_score_codex":0.0020618876,"about_ca_topic_score_gemma":0.0024419334,"teacher_disagreement_score":0.017697645,"about_ca_system_score_codex":0.0011517627,"about_ca_system_score_gemma":0.0011907791,"threshold_uncertainty_score":0.05920446},"labels":[],"label_agreement":null},{"id":"W2621100381","doi":"10.1007/978-3-319-57339-7_7","title":"Impossible Differential Cryptanalysis of Reduced-Round SKINNY","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Differential cryptanalysis; Differential (mechanical device); Linear cryptanalysis; Arithmetic; Boomerang attack; Parallel computing; Cipher; Algorithm; Cryptography; Mathematics; Operating system; Encryption; Physics","score_opus":0.02221386052367519,"score_gpt":0.28915963604532674,"score_spread":0.26694577552165155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621100381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31858614,0.0022138765,0.4762277,0.0032495202,0.0010754474,0.00019341538,0.00037584337,0.0013925801,0.19668555],"genre_scores_gemma":[0.9367623,0.00045512358,0.03659236,0.00031761278,0.0001902488,0.00005002338,0.0001705781,0.00021782448,0.025243938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795794,0.0004680665,0.000086479944,0.00031600997,0.00079961005,0.00037188304],"domain_scores_gemma":[0.9988619,0.0004903706,0.00006687328,0.00039638663,0.00010990413,0.00007451877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104106,0.0007559767,0.0009433995,0.00092908525,0.0010792885,0.0027818442,0.0011327714,0.0012681633,0.009503768],"category_scores_gemma":[0.003849175,0.00050321204,0.001068238,0.00084521924,0.0030006676,0.00435485,0.0036348002,0.0027154218,0.0021545414],"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.00041557316,0.00005284312,0.00040262143,0.00015401731,0.000048222846,0.00043534004,0.00035809074,0.0074237403,0.008637405,0.9416579,0.003745172,0.036668994],"study_design_scores_gemma":[0.000062958934,0.00013977966,0.00041787163,0.00007553833,0.00005417182,0.00087707175,0.0001050724,0.042914227,0.021816373,0.914443,0.019027784,0.00006621679],"about_ca_topic_score_codex":0.00021619769,"about_ca_topic_score_gemma":0.00024400446,"teacher_disagreement_score":0.009503768,"about_ca_system_score_codex":0.0013175838,"about_ca_system_score_gemma":0.0008710037,"threshold_uncertainty_score":0.031793296},"labels":[],"label_agreement":null},{"id":"W2621373850","doi":"10.1007/978-3-319-60252-3_16","title":"Branching Measures and Nearly Acyclic NFAs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Combinatorics; Path (computing); Directed acyclic graph; Finite-state machine; String (physics); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computation; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","score_opus":0.01823453053306076,"score_gpt":0.24333581897018078,"score_spread":0.22510128843712002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621373850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14551403,0.019725874,0.62257123,0.0036726934,0.00095554534,0.000080454745,0.0007429814,0.0007390825,0.20599811],"genre_scores_gemma":[0.856496,0.008004216,0.087538965,0.00068587495,0.0013562024,0.00020906655,0.0006653106,0.00030266304,0.0447416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922466,0.00019942175,0.000060538325,0.00017492271,0.00025841646,0.00008215439],"domain_scores_gemma":[0.99687505,0.0020972206,0.000248748,0.00033339945,0.00027069866,0.00017482188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009924751,0.00068164873,0.00075771305,0.0018783156,0.0012247079,0.0028768019,0.00079768064,0.0011812797,0.005675914],"category_scores_gemma":[0.00438655,0.0006136578,0.0008087206,0.0023376045,0.0027041943,0.005961843,0.0013130127,0.002883135,0.00068552955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007667809,0.0000053986314,0.000076727505,0.000023439921,0.0000036297622,0.00001844659,0.000078746925,0.0010689588,0.0002759211,0.99033195,0.00058620184,0.007522947],"study_design_scores_gemma":[0.0000013283064,0.0000019881263,0.000044930865,0.000007960723,0.000002084063,0.000024233597,0.000009378459,0.001422352,0.00005654764,0.99629045,0.0021356912,0.0000030495025],"about_ca_topic_score_codex":0.0012159582,"about_ca_topic_score_gemma":0.0010190833,"teacher_disagreement_score":0.005675914,"about_ca_system_score_codex":0.0018779642,"about_ca_system_score_gemma":0.0005090238,"threshold_uncertainty_score":0.018987834},"labels":[],"label_agreement":null},{"id":"W2621477274","doi":"10.1007/978-3-319-66179-7_32","title":"Full Quantification of Left Ventricle via Deep Multitask Learning Network Respecting Intra- and Inter-Task Relatedness","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiovascular Function and Risk Factors","field":"Medicine","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Generalization; Deep learning; Multi-task learning; Task (project management); Pattern recognition (psychology); Feature (linguistics); Lasso (programming language); Artificial neural network; Ventricle; Machine learning; Mathematics; Cardiology; Medicine","score_opus":0.015654013466881472,"score_gpt":0.256130211111273,"score_spread":0.24047619764439152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621477274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017028417,0.0008252978,0.9789554,0.0002406073,0.00008434696,0.000019413734,0.00048738657,0.0009093453,0.0014498947],"genre_scores_gemma":[0.5973605,0.0015789976,0.3844907,0.00039947857,0.00033199237,0.00012146667,0.002382891,0.0007550295,0.012578948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979955,0.000041641048,0.000009130642,0.00007711114,0.000044841818,0.00002769953],"domain_scores_gemma":[0.9997185,0.0001266308,0.00002970258,0.00004234192,0.000057499397,0.000025360961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070623937,0.0010786996,0.0006670538,0.0004604156,0.0002358289,0.0009675362,0.00077997043,0.0011134025,0.0020114789],"category_scores_gemma":[0.0014738657,0.00041397617,0.0006723836,0.00034415186,0.00026876174,0.0011131783,0.0014080536,0.00090269215,0.0009106515],"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.00023885068,0.00011105756,0.0026083686,0.00027979174,0.00019956665,0.000267681,0.00012273037,0.29595426,0.08137707,0.008092858,0.009554292,0.6011935],"study_design_scores_gemma":[0.000005031923,0.000037648013,0.0015140864,0.000032627442,0.00003294873,0.00013500388,0.000012952247,0.97944117,0.0071221273,0.010311927,0.0013332064,0.00002133726],"about_ca_topic_score_codex":0.0019166945,"about_ca_topic_score_gemma":0.004117724,"teacher_disagreement_score":0.0020114789,"about_ca_system_score_codex":0.00026594894,"about_ca_system_score_gemma":0.00058973156,"threshold_uncertainty_score":0.0067290664},"labels":[],"label_agreement":null},{"id":"W2621584103","doi":"10.1007/978-3-319-58509-3","title":"Learning and Collaboration Technologies. Novel Learning Ecosystems","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Set (abstract data type); Volume (thermodynamics); Artificial intelligence; Data science; Programming language","score_opus":0.029418846050996615,"score_gpt":0.35449668873647666,"score_spread":0.32507784268548007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621584103","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047507156,0.22438288,0.05225983,0.016505556,0.006083697,0.00013625983,0.00022583485,0.0013038354,0.69435155],"genre_scores_gemma":[0.13050167,0.194642,0.059266616,0.006510709,0.006199124,0.0006876022,0.00080498785,0.000651151,0.6007361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933296,0.00021806378,0.0000310717,0.00012054323,0.00023318449,0.00006415498],"domain_scores_gemma":[0.99949753,0.0002527078,0.000045606877,0.000074551186,0.00003439552,0.00009513579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051462464,0.00078417297,0.00041160142,0.0014664654,0.0012072243,0.00935654,0.00087476603,0.002565446,0.026358008],"category_scores_gemma":[0.0010944376,0.00034719202,0.00040376588,0.0023525076,0.003359692,0.010175276,0.0051259054,0.00248063,0.008808082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015381267,0.000048911133,0.00018045238,0.0010604542,0.000013207233,0.00020666998,0.0014288749,0.0005632636,0.001152546,0.5957628,0.0829171,0.31665036],"study_design_scores_gemma":[0.000005547131,0.00001834866,0.00018599532,0.00042116139,0.0000041367625,0.000596215,0.00044792978,0.00045595574,0.0002308911,0.16122788,0.8363951,0.000010736343],"about_ca_topic_score_codex":0.0003320473,"about_ca_topic_score_gemma":0.00067992555,"teacher_disagreement_score":0.026358008,"about_ca_system_score_codex":0.0012922937,"about_ca_system_score_gemma":0.0009986032,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2621768163","doi":"10.1007/11801603_90","title":"GA-Based Polynomial Neural Networks Architecture and Its Application to Multi-variable Software Process","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial neural network; Computer science; Genetic algorithm; Process (computing); Polynomial; Variable (mathematics); Software; Data mining; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.010519681647606749,"score_gpt":0.23954455682628967,"score_spread":0.22902487517868292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621768163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039728906,0.00054519094,0.95498085,0.00017139333,0.000079490244,0.00003169614,0.000027945616,0.0006500575,0.0037845613],"genre_scores_gemma":[0.7444047,0.00039165968,0.2503349,0.00004838646,0.000029838335,0.000069097296,0.000041040625,0.00007220454,0.0046082153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987614,0.00004238605,0.000005312,0.000028960236,0.00003161652,0.00001557735],"domain_scores_gemma":[0.99954706,0.00025374163,0.000028522694,0.000035646262,0.00012216026,0.00001295341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043999328,0.00038805796,0.00049720897,0.00038015516,0.00035692268,0.00051295536,0.00086734234,0.0010586018,0.0017757525],"category_scores_gemma":[0.0015347359,0.00026364197,0.00049637246,0.0006946589,0.0004034458,0.0004963006,0.00036317194,0.00084187184,0.00028769328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053038548,0.000025580099,0.00023611149,0.00003620638,0.000019769333,0.000035825982,0.000031787502,0.93114686,0.0028051569,0.007975252,0.00040946298,0.05722497],"study_design_scores_gemma":[0.0000015148465,0.0000055063006,0.000027962797,0.0000010180019,0.000002458276,0.0000035210423,0.000001052861,0.9990294,0.00024308416,0.00059612276,0.00008695383,0.000001428259],"about_ca_topic_score_codex":0.013117295,"about_ca_topic_score_gemma":0.0100762695,"teacher_disagreement_score":0.013117295,"about_ca_system_score_codex":0.0007472934,"about_ca_system_score_gemma":0.00067755027,"threshold_uncertainty_score":0.02608186},"labels":[],"label_agreement":null},{"id":"W262231065","doi":"10.1007/978-3-642-24908-2_12","title":"Knowledgebase Representation Language Interoperation Tool","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Interoperation; Computer science; Representation (politics); Natural language processing; Programming language; Artificial intelligence; World Wide Web; Interoperability","score_opus":0.0285773984239235,"score_gpt":0.2739975121380219,"score_spread":0.24542011371409841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W262231065","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.003022864,0.00063946535,0.8734865,0.0010813689,0.00038284584,0.00039960694,0.00746294,0.07262076,0.040903628],"genre_scores_gemma":[0.03658801,0.0017294702,0.8154655,0.0012520549,0.00015276844,0.0008659024,0.061461817,0.015437978,0.06704647],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981406,0.00027240202,0.00036225433,0.00031582976,0.0007840006,0.00012492626],"domain_scores_gemma":[0.9977143,0.0009341758,0.000109859975,0.0006764037,0.00046830537,0.00009702545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029816835,0.0010928009,0.0016203676,0.0075229537,0.0015425076,0.00649742,0.0040003485,0.0021888097,0.038012367],"category_scores_gemma":[0.0075709545,0.0012744422,0.0018422339,0.006944588,0.00066818885,0.010957231,0.0047999616,0.003363598,0.021858938],"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.00020465674,0.00048363936,0.00068437244,0.0009647186,0.00019343378,0.00082789094,0.0009727598,0.0029239347,0.007352429,0.1625441,0.22984073,0.59300727],"study_design_scores_gemma":[0.00010487793,0.00005881553,0.0006045437,0.00059407897,0.00025528795,0.0013076395,0.00034231972,0.030053418,0.025590494,0.08985694,0.85109425,0.00013720088],"about_ca_topic_score_codex":0.002409981,"about_ca_topic_score_gemma":0.0028240895,"teacher_disagreement_score":0.038012367,"about_ca_system_score_codex":0.001157192,"about_ca_system_score_gemma":0.0027400088,"threshold_uncertainty_score":0.127164},"labels":[],"label_agreement":null},{"id":"W2622682398","doi":"10.1007/978-3-319-61033-7","title":"Reasoning Web. Semantic Interoperability on the Web","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Carleton University","funders":"","keywords":"Computer science; Semantic Web; World Wide Web; Interoperability; Semantic Web Stack; Social Semantic Web; Data Web; Semantic interoperability; Web standards; Semantic analytics; Web service; Information retrieval","score_opus":0.024935772929202273,"score_gpt":0.2662174085267882,"score_spread":0.24128163559758595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622682398","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001944387,0.12017394,0.3148145,0.010503299,0.0064168107,0.00037004633,0.004510456,0.0073358603,0.5339307],"genre_scores_gemma":[0.053692967,0.16352722,0.3068141,0.014327667,0.006707659,0.0007823503,0.030774374,0.0054084975,0.41796508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890625,0.00014946258,0.00010590107,0.00019107257,0.0005953599,0.000051949977],"domain_scores_gemma":[0.99947613,0.00021489138,0.000045583554,0.0001360095,0.00008922937,0.00003812304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071975694,0.0018716404,0.0013712327,0.0062491456,0.0010461574,0.0060440027,0.001531466,0.0022111107,0.027356036],"category_scores_gemma":[0.0016712935,0.0009794608,0.0017845756,0.0095111,0.0019792467,0.013335878,0.0034114593,0.0034150842,0.02152837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035742596,0.00011664752,0.00019092155,0.0013229764,0.00006298126,0.00025272634,0.00020054475,0.0026772472,0.0013816403,0.41260502,0.20822227,0.37293133],"study_design_scores_gemma":[0.000020276038,0.000010255503,0.0002558168,0.00048489324,0.00003787954,0.0006151864,0.0000937889,0.00465484,0.0008787856,0.49355268,0.4993715,0.000024197887],"about_ca_topic_score_codex":0.0028139825,"about_ca_topic_score_gemma":0.0024863686,"teacher_disagreement_score":0.027356036,"about_ca_system_score_codex":0.0012370186,"about_ca_system_score_gemma":0.0011884572,"threshold_uncertainty_score":0.091515005},"labels":[],"label_agreement":null},{"id":"W2622701023","doi":"10.1007/978-3-662-44803-8_3","title":"Stable Marriage with General Preferences","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stable marriage problem; Generalization; Transitive relation; Matching (statistics); Partition (number theory); Time complexity; Computer science; Combinatorics; Class (philosophy); Mathematics; Linear programming; Binary number; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.02694053044147743,"score_gpt":0.2048917570169648,"score_spread":0.17795122657548737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622701023","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.3989183,0.0019775098,0.27949235,0.006656073,0.00034209798,0.00017530305,0.0011098041,0.00031883415,0.31100968],"genre_scores_gemma":[0.92333376,0.0009131632,0.01648397,0.00046023808,0.00032823172,0.0001500403,0.0005891033,0.000077578865,0.05766401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863213,0.00061953976,0.00005057549,0.00024988133,0.00021541197,0.00023243103],"domain_scores_gemma":[0.996779,0.0018059224,0.0003330645,0.0004464344,0.00027448498,0.00036110284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014510757,0.00052340986,0.0011924476,0.0011103039,0.0025937583,0.003249826,0.0012960087,0.002150898,0.018300172],"category_scores_gemma":[0.00844399,0.00055149826,0.00089456537,0.0021283561,0.0025141537,0.004922104,0.0022188693,0.0024680956,0.002233967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002642428,0.000015986958,0.00018781552,0.000020430982,0.000009876885,0.00006920194,0.00018919869,0.0012729453,0.00010860922,0.9908167,0.0017046892,0.0055782143],"study_design_scores_gemma":[0.000013742453,0.0000056983135,0.000083150175,0.000004378279,0.0000027537878,0.000046736306,0.00004679009,0.004349445,0.00002549541,0.99432844,0.0010894497,0.000003898079],"about_ca_topic_score_codex":0.0013154937,"about_ca_topic_score_gemma":0.0011837544,"teacher_disagreement_score":0.018300172,"about_ca_system_score_codex":0.0009849857,"about_ca_system_score_gemma":0.00076962035,"threshold_uncertainty_score":0.06122017},"labels":[],"label_agreement":null},{"id":"W2623117841","doi":"10.1007/978-3-319-67585-5_45","title":"Hierarchical Task Recognition and Planning in Smart Homes with Partial Observability","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Observability; Computer science; Task (project management); Artificial intelligence; Machine learning; Simple (philosophy); Engineering","score_opus":0.05513953499689488,"score_gpt":0.26950721369370406,"score_spread":0.21436767869680917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623117841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06426533,0.00038837473,0.93081146,0.00013191825,0.000028115908,0.00004393203,0.00023474374,0.0012422587,0.0028538455],"genre_scores_gemma":[0.80363876,0.00030273374,0.19142956,0.000035834502,0.000025488567,0.00009538104,0.00054624624,0.00011211613,0.0038138172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996197,0.000063656254,0.000021349562,0.00015153704,0.00005832564,0.00008549709],"domain_scores_gemma":[0.99921536,0.00048985437,0.000061177685,0.00012295386,0.00005630473,0.000054270356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045791047,0.00046349008,0.0009090218,0.0003124582,0.00045555423,0.0009649203,0.0010600454,0.0005761772,0.0027258573],"category_scores_gemma":[0.0017660065,0.000647809,0.0006283128,0.00058392313,0.0006570613,0.0016436082,0.001100353,0.0009043356,0.00041534254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039869148,0.00015914447,0.0021902546,0.00012766002,0.000050976734,0.00030650868,0.00037007267,0.7497493,0.006232407,0.021331048,0.0026505631,0.21643348],"study_design_scores_gemma":[0.0000073286465,0.000021772994,0.0004879874,0.0000047370977,0.0000069575603,0.00002296618,0.00003903666,0.9793809,0.0010648733,0.01863563,0.00032166354,0.0000061811515],"about_ca_topic_score_codex":0.02189782,"about_ca_topic_score_gemma":0.026661083,"teacher_disagreement_score":0.02189782,"about_ca_system_score_codex":0.00083570887,"about_ca_system_score_gemma":0.0014586666,"threshold_uncertainty_score":0.043540716},"labels":[],"label_agreement":null},{"id":"W2623417428","doi":"10.1007/978-3-319-60922-5_24","title":"Operating Virtual Panels with Hand Gestures in Immersive VR Games","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Headset; Desk; Laptop; Gesture; Virtual reality; Human–computer interaction; Android (operating system); Input device; Computer graphics (images); Computer vision; Computer hardware; Operating system","score_opus":0.02149652071282891,"score_gpt":0.252782191653321,"score_spread":0.2312856709404921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623417428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18270929,0.003958045,0.697428,0.00029800413,0.00031842492,0.00017551368,0.00027681468,0.008211719,0.1066242],"genre_scores_gemma":[0.7208116,0.003206362,0.16659293,0.00015886818,0.000106882144,0.000279429,0.00041848604,0.0012818001,0.107143655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972314,0.00005819532,0.000009595028,0.00004734392,0.000099328056,0.00006237804],"domain_scores_gemma":[0.9998105,0.00009972943,0.000010341397,0.000027729595,0.000019174493,0.000032437056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024322128,0.0010646568,0.0005410856,0.00020218128,0.00028409564,0.0014796971,0.0012132741,0.00079660694,0.019514006],"category_scores_gemma":[0.00061106915,0.0005314757,0.00043659296,0.00019409171,0.00039539346,0.0012208056,0.0023160481,0.00087556196,0.004580136],"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.0007069889,0.00028667878,0.00069586653,0.00064586865,0.00008092032,0.00073602976,0.0024343769,0.0136831505,0.3897495,0.013227116,0.012545349,0.56520814],"study_design_scores_gemma":[0.00036883476,0.002137235,0.018304246,0.0010874802,0.0002852908,0.005886253,0.0029975807,0.25938582,0.34941286,0.033797786,0.32589856,0.00043803809],"about_ca_topic_score_codex":0.00049560517,"about_ca_topic_score_gemma":0.0007577376,"teacher_disagreement_score":0.019514006,"about_ca_system_score_codex":0.00012836278,"about_ca_system_score_gemma":0.00013880452,"threshold_uncertainty_score":0.065280795},"labels":[],"label_agreement":null},{"id":"W262433993","doi":"10.1007/978-3-662-43984-5_25","title":"Integrated Indoor Positioning with Mobile Devices for Location-Based Service Applications","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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 Calgary","funders":"","keywords":"Computer science; Location-based service; Service (business); Hybrid positioning system; Real-time computing; Embedded system; Telecommunications; Positioning system; Engineering","score_opus":0.0072961960245556765,"score_gpt":0.21185718038560972,"score_spread":0.20456098436105405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W262433993","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012269163,0.014368639,0.9035605,0.00033380173,0.0009977965,0.00007923051,0.00044520374,0.0043314206,0.063614205],"genre_scores_gemma":[0.36436322,0.016868211,0.44610274,0.0005369136,0.0009941829,0.00016829203,0.001897842,0.0006455983,0.16842303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996723,0.000046317098,0.000014756671,0.00006799472,0.00015215903,0.00004645038],"domain_scores_gemma":[0.9998398,0.000031965814,0.000009559156,0.000040455463,0.000066718676,0.0000115089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002064144,0.0010831553,0.0006530969,0.0006351767,0.00028729555,0.001027945,0.0013493064,0.0010632632,0.01226422],"category_scores_gemma":[0.00039271283,0.00042705543,0.00049875764,0.0016663658,0.00021272543,0.0012343421,0.0012007774,0.0008399384,0.0081567615],"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.00016735245,0.00006448561,0.0010680584,0.00066786795,0.00007096239,0.00032422016,0.00021310076,0.008342652,0.08641556,0.015871927,0.019329494,0.8674643],"study_design_scores_gemma":[0.00005035364,0.0009820578,0.005362173,0.00048623706,0.00043930853,0.0036557375,0.00034318573,0.11753997,0.1547433,0.013353336,0.70289576,0.0001485009],"about_ca_topic_score_codex":0.0010066034,"about_ca_topic_score_gemma":0.0018382357,"teacher_disagreement_score":0.01226422,"about_ca_system_score_codex":0.00032522928,"about_ca_system_score_gemma":0.0002760784,"threshold_uncertainty_score":0.041027904},"labels":[],"label_agreement":null},{"id":"W2625038550","doi":"10.1007/978-3-319-60240-0_36","title":"Prospective Detection of Foodborne Illness Outbreaks Using Machine Learning Approaches","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Food Safety and Hygiene","field":"Agricultural and Biological Sciences","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 Saskatchewan","funders":"","keywords":"Computer science; Outbreak; Artificial intelligence; Machine learning; Virology; Medicine","score_opus":0.04330312292681404,"score_gpt":0.22724403832953033,"score_spread":0.1839409154027163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625038550","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.7384476,0.0037752157,0.24337979,0.0011306653,0.00027620385,0.0002939374,0.004850974,0.0012771761,0.0065684393],"genre_scores_gemma":[0.93129677,0.00057380093,0.06108267,0.00008397571,0.00015180434,0.00006735185,0.0044241757,0.000027068281,0.0022924123],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993561,0.00017614826,0.00006288923,0.00019043752,0.00013824188,0.00007623281],"domain_scores_gemma":[0.9958919,0.0027141909,0.0004763406,0.00020510847,0.0005580773,0.00015440126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016426758,0.0006755392,0.0005808159,0.0019438048,0.00031364872,0.0015694638,0.0009304313,0.0009628953,0.0014083198],"category_scores_gemma":[0.005179752,0.00038171542,0.00071564526,0.00094344665,0.00020369366,0.0013126889,0.0006410149,0.000817837,0.0009304016],"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.0012846504,0.0010798494,0.5230247,0.00029394176,0.0003180024,0.0005169496,0.00010756841,0.063629694,0.013272528,0.0019001027,0.0070252297,0.38754684],"study_design_scores_gemma":[0.000044206816,0.0006359753,0.10842035,0.00008503333,0.0001293152,0.00061029004,0.00019197549,0.87253237,0.009882692,0.0051676747,0.0022435852,0.00005659236],"about_ca_topic_score_codex":0.0013362621,"about_ca_topic_score_gemma":0.0022184649,"teacher_disagreement_score":0.0019438048,"about_ca_system_score_codex":0.00031714607,"about_ca_system_score_gemma":0.0004327765,"threshold_uncertainty_score":0.008687377},"labels":[],"label_agreement":null},{"id":"W2626439123","doi":"10.1007/978-3-319-60438-1_54","title":"Multi-criteria Based Three-Way Classifications with Game-Theoretic Rough Sets","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Rough set; Computer science; Mathematics; Mathematical economics; Artificial intelligence","score_opus":0.03876843063105012,"score_gpt":0.2760966660104978,"score_spread":0.2373282353794477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626439123","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.010166955,0.0002821317,0.98499715,0.0001462851,0.000060740407,0.00008859669,0.00005479506,0.00011399193,0.004089271],"genre_scores_gemma":[0.34360543,0.00033486917,0.65275943,0.00006688945,0.00005193809,0.00029769907,0.00017062716,0.000045628214,0.00266749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926044,0.0030427743,0.0006624714,0.0007497988,0.0024708838,0.00046961903],"domain_scores_gemma":[0.99522203,0.0027259393,0.00038191667,0.0005246614,0.00093394634,0.00021157763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057040006,0.0011927452,0.0026117656,0.0028247111,0.0014420727,0.0060774502,0.0031769685,0.0013090938,0.0027400232],"category_scores_gemma":[0.011260795,0.00076437835,0.0043133157,0.0030475957,0.0023473373,0.0057948707,0.0032360062,0.0026263276,0.0006016934],"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.00023385478,0.0001452196,0.0011351093,0.00043919272,0.00036063258,0.00023345114,0.001222752,0.19354649,0.0032208865,0.668456,0.0025153619,0.12849101],"study_design_scores_gemma":[0.000021972752,0.00008420905,0.00038567116,0.00009358047,0.00010779215,0.00007841141,0.00019613578,0.7173416,0.0010712991,0.27826715,0.002284333,0.00006776952],"about_ca_topic_score_codex":0.0043076384,"about_ca_topic_score_gemma":0.0027995356,"teacher_disagreement_score":0.0060774502,"about_ca_system_score_codex":0.0027931852,"about_ca_system_score_gemma":0.0017022233,"threshold_uncertainty_score":0.03016597},"labels":[],"label_agreement":null},{"id":"W2626850692","doi":"10.1007/3-540-36136-7","title":"Algorithms and Computation","year":2002,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","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":"Computer science; Computation; Algorithm","score_opus":0.02102873307846138,"score_gpt":0.2581946897250936,"score_spread":0.2371659566466322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626850692","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025599378,0.2124019,0.15587623,0.01327968,0.006116502,0.000109199995,0.0006112274,0.0011228917,0.6079224],"genre_scores_gemma":[0.14878468,0.18610525,0.14368789,0.009127269,0.0142084,0.0010141728,0.0020944534,0.0017908394,0.49318713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990728,0.00024418795,0.000050503026,0.0002230707,0.00035360796,0.000055789278],"domain_scores_gemma":[0.9991297,0.00047188514,0.000032649175,0.0001893958,0.00013025141,0.000046039553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089138234,0.0019650587,0.0020601205,0.0020972167,0.001331625,0.005760129,0.0012318721,0.0014681574,0.023065517],"category_scores_gemma":[0.002944145,0.00071988965,0.0009607794,0.0046993895,0.0054938057,0.006942345,0.001975726,0.0052294196,0.0100770835],"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.000015918042,0.000018574188,0.00014690051,0.00043210443,0.000025693049,0.000030705654,0.00025908384,0.00089849066,0.00024367472,0.817719,0.08621106,0.09399873],"study_design_scores_gemma":[0.000013704782,0.000011671832,0.00020989924,0.00014601059,0.000014219017,0.00010209379,0.00006745292,0.0014734563,0.00014738413,0.7519008,0.24590546,0.000007930629],"about_ca_topic_score_codex":0.0019479777,"about_ca_topic_score_gemma":0.0019218378,"teacher_disagreement_score":0.023065517,"about_ca_system_score_codex":0.0029959395,"about_ca_system_score_gemma":0.001448614,"threshold_uncertainty_score":0.07716179},"labels":[],"label_agreement":null},{"id":"W2630264676","doi":"10.1007/978-3-319-03077-7","title":"Hardware and Software: Verification and Testing","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Irvine; University of California, Santa Barbara; Universidade Nova de Lisboa; University of Texas at Arlington; University of Waterloo; University of Illinois at Urbana-Champaign; Tel Aviv University; Aalborg Universitet; King's College London; Università degli Studi di Milano; Indian Institute of Technology Delhi; East Carolina University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Computer science; Programming language; Software verification; Software engineering; Software; Software testing; Software construction; Software system","score_opus":0.023086989870477595,"score_gpt":0.24425199765910033,"score_spread":0.22116500778862275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2630264676","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.010261099,0.043683976,0.743329,0.0020519358,0.0016006925,0.0002610028,0.00031164772,0.0028382426,0.19566241],"genre_scores_gemma":[0.29699802,0.046867855,0.45805073,0.0011973308,0.0012845749,0.00062745786,0.00083928957,0.0013001999,0.1928346],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766076,0.0003666611,0.00011270635,0.00020577203,0.0015728931,0.000081253005],"domain_scores_gemma":[0.9980242,0.0009990626,0.00010414233,0.00052141526,0.00032601497,0.000025250562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011155636,0.0013007951,0.0009724569,0.0010116594,0.00042197856,0.002206703,0.0016084724,0.0012863256,0.011138225],"category_scores_gemma":[0.004681294,0.0009940247,0.00070733455,0.0011655283,0.0019892324,0.0030672345,0.0013901977,0.0018124932,0.004744227],"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.00010059834,0.000084041276,0.0004295146,0.0011943262,0.000057140245,0.00024495943,0.0002217278,0.020034915,0.008197668,0.24286158,0.030806795,0.6957667],"study_design_scores_gemma":[0.00008197945,0.00022359288,0.0015009557,0.0010203135,0.00013708264,0.0018708166,0.00021448077,0.08050799,0.029134708,0.4820878,0.4031554,0.00006486332],"about_ca_topic_score_codex":0.00094881706,"about_ca_topic_score_gemma":0.00087064196,"teacher_disagreement_score":0.011138225,"about_ca_system_score_codex":0.00078798615,"about_ca_system_score_gemma":0.0013003343,"threshold_uncertainty_score":0.03726107},"labels":[],"label_agreement":null},{"id":"W264519905","doi":"10.1007/978-3-642-40811-3_77","title":"Non-Local Spatial Regularization of MRI T2 Relaxation Images for Myelin Water Quantification","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","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 British Columbia","funders":"","keywords":"Voxel; Regularization (linguistics); Computer science; Myelin; Artificial intelligence; Ellipsoid; Pattern recognition (psychology); Biological system; Algorithm; Mathematics; Computer vision; Physics; Neuroscience; Biology","score_opus":0.01153864720963049,"score_gpt":0.2875393214553273,"score_spread":0.2760006742456968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W264519905","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.011315642,0.00049053424,0.986984,0.00013509009,0.000017491902,0.00002202851,0.00006125774,0.0002741431,0.00069973525],"genre_scores_gemma":[0.15267181,0.0013211365,0.8388911,0.00013670606,0.0000727895,0.00014104357,0.00046381337,0.00067132845,0.00563035],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999759,0.000095630654,0.000015024876,0.000037743655,0.00007364388,0.00001895553],"domain_scores_gemma":[0.9992854,0.00034678102,0.00008826368,0.00012019553,0.0001244893,0.000034943183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695473,0.00069676095,0.0005041285,0.00051325985,0.00028703545,0.00054665905,0.0007680228,0.00071798015,0.001397263],"category_scores_gemma":[0.0023012375,0.00035934502,0.00069927215,0.0005685843,0.0004088877,0.00074328843,0.00091663725,0.0010547718,0.0005251509],"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.00042119843,0.00018988711,0.00087632047,0.0009241082,0.00022423964,0.00024986672,0.00026858828,0.16038367,0.49275813,0.030221635,0.005214096,0.30826834],"study_design_scores_gemma":[0.000016095191,0.00007826375,0.00088571856,0.000036868096,0.00006947088,0.00029942192,0.0000366447,0.8920342,0.09340548,0.007624072,0.0054764743,0.000037349673],"about_ca_topic_score_codex":0.001702036,"about_ca_topic_score_gemma":0.0035729764,"teacher_disagreement_score":0.001702036,"about_ca_system_score_codex":0.0003305004,"about_ca_system_score_gemma":0.0007845123,"threshold_uncertainty_score":0.0051274896},"labels":[],"label_agreement":null},{"id":"W2647154366","doi":"10.1007/978-3-319-61425-0_10","title":"Personalized Tag-Based Knowledge Diagnosis to Predict the Quality of Answers in a Community of Learners","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 Saskatchewan","funders":"","keywords":"Computer science; Ranging; Quality (philosophy); Mean squared error; Field (mathematics); Sample (material); Naive Bayes classifier; Artificial intelligence; Machine learning; Data science; Statistics; Mathematics","score_opus":0.06173944265229001,"score_gpt":0.32587610214132157,"score_spread":0.26413665948903153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2647154366","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.8205934,0.0021990195,0.16780353,0.00047894826,0.00018222106,0.00023782406,0.0025084508,0.0020300748,0.0039664917],"genre_scores_gemma":[0.953452,0.00021337974,0.040437844,0.00010226606,0.000112706046,0.00008692984,0.002473855,0.00003730101,0.0030837695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989122,0.00022987215,0.0000785997,0.0003409226,0.00029690785,0.00014158759],"domain_scores_gemma":[0.9952756,0.0028136757,0.0003310897,0.00033561263,0.00094199745,0.0003018884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013510959,0.00059392833,0.00097178767,0.00409787,0.0005390029,0.0011307041,0.0013472929,0.0017595406,0.0019317458],"category_scores_gemma":[0.005585659,0.00017175043,0.00059792947,0.002226606,0.00026195045,0.0019480472,0.0011566663,0.00085162284,0.0015128037],"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.0023517392,0.0030556086,0.14769548,0.00034122402,0.00055695267,0.0005156625,0.0009486927,0.03113044,0.024496451,0.001848654,0.012147142,0.7749119],"study_design_scores_gemma":[0.000084944375,0.00067568896,0.030745998,0.000045910878,0.00028898264,0.00030953146,0.0004467652,0.947681,0.011262707,0.006512247,0.001885511,0.000060736136],"about_ca_topic_score_codex":0.0054377685,"about_ca_topic_score_gemma":0.010103479,"teacher_disagreement_score":0.0054377685,"about_ca_system_score_codex":0.0006215193,"about_ca_system_score_gemma":0.0007860051,"threshold_uncertainty_score":0.010812223},"labels":[],"label_agreement":null},{"id":"W2650918751","doi":"10.1007/978-3-540-28639-4_17","title":"Simplifying the Weft Hierarchy","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Computer science; Discrete mathematics; Calculus (dental); Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics; Geometry; Philosophy; Epistemology","score_opus":0.02571374060812506,"score_gpt":0.28915049709039936,"score_spread":0.2634367564822743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2650918751","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051007055,0.002747267,0.24049233,0.0045572273,0.00095481455,0.00005125514,0.0002977671,0.0012497364,0.6986427],"genre_scores_gemma":[0.6616961,0.003923028,0.10050805,0.0013762228,0.0008233577,0.00010288688,0.00067053194,0.0015952698,0.22930461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.000094292605,0.000018689969,0.000090150104,0.00016749722,0.00013162878],"domain_scores_gemma":[0.9992969,0.0001766888,0.000037145746,0.00031268,0.000103317136,0.00007324815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000378685,0.00059329433,0.0008242661,0.0010621252,0.0023728667,0.002133721,0.0013256826,0.001013824,0.025308212],"category_scores_gemma":[0.0019871811,0.0005255976,0.0008906378,0.0011675073,0.003124764,0.00797489,0.0034021258,0.004296517,0.0065264404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016031605,0.000013405015,0.000036715574,0.00002939098,0.0000032085047,0.000027847687,0.00017127111,0.00049363583,0.00046120235,0.9773032,0.007053479,0.0143906],"study_design_scores_gemma":[0.000006553227,0.000005675739,0.000037608468,0.000017617589,0.000004628036,0.000047271784,0.0000595488,0.0016739146,0.00030763343,0.97081953,0.027014362,0.000005682493],"about_ca_topic_score_codex":0.0024338865,"about_ca_topic_score_gemma":0.003880532,"teacher_disagreement_score":0.025308212,"about_ca_system_score_codex":0.0013396261,"about_ca_system_score_gemma":0.00066037255,"threshold_uncertainty_score":0.084664464},"labels":[],"label_agreement":null},{"id":"W265434846","doi":"10.1007/978-3-319-11167-4_31","title":"Cloud Services for Deploying Client-Server Applications to SaaS","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Software as a service; Cloud computing; Computer science; Software deployment; Flexibility (engineering); Service (business); Reuse; Software; Application server; Cloud testing; Database; Operating system; Software engineering; Cloud computing security; Software development; Engineering; Business","score_opus":0.0160763854937927,"score_gpt":0.252046216144425,"score_spread":0.23596983065063232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W265434846","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.035220902,0.0050686994,0.84243137,0.001844453,0.0011054109,0.00058234006,0.00068858685,0.025614407,0.08744374],"genre_scores_gemma":[0.3788795,0.0052990383,0.54422057,0.000704503,0.00042858417,0.00034959192,0.0018267895,0.003959249,0.06433225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949396,0.000061493985,0.000032343334,0.000043224725,0.00026166177,0.00010740647],"domain_scores_gemma":[0.99967957,0.000059014557,0.00002140197,0.00008768859,0.00008524436,0.00006705695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041303763,0.00071702903,0.00039075193,0.0007477329,0.00085838063,0.0018923043,0.0011303298,0.00079117226,0.006499569],"category_scores_gemma":[0.0011429143,0.00039139183,0.00053229777,0.0014762221,0.00041565223,0.001426438,0.0010939165,0.001715627,0.0035555235],"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.00050795265,0.00028732407,0.0013082064,0.00052425783,0.00007252826,0.0006980508,0.00067336834,0.014214673,0.06559457,0.17857173,0.09548605,0.64206135],"study_design_scores_gemma":[0.00014254438,0.00022510701,0.0038590997,0.00033241734,0.0001122015,0.0019956876,0.0004306225,0.38198334,0.07141216,0.072396964,0.46698746,0.00012233337],"about_ca_topic_score_codex":0.0059673847,"about_ca_topic_score_gemma":0.0068755094,"teacher_disagreement_score":0.006499569,"about_ca_system_score_codex":0.0009035273,"about_ca_system_score_gemma":0.0014600952,"threshold_uncertainty_score":0.021743178},"labels":[],"label_agreement":null},{"id":"W265925140","doi":"10.1007/978-3-642-28326-0_1","title":"EP Challenge - STACOM’11: Forward Approaches to Computational Electrophysiology Using MRI-Based Models and In-Vivo CARTO Mapping in Swine Hearts","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","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":"Sunnybrook Health Science Centre; University of Toronto; Ontario Institute for Cancer Research","funders":"","keywords":"Computer science; Electrophysiology; Neuroscience; Biology","score_opus":0.06544941797495461,"score_gpt":0.2627588477880082,"score_spread":0.19730942981305355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W265925140","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.0063538584,0.0013128226,0.9787658,0.000879944,0.0006295634,0.00006236692,0.00048310577,0.0015710728,0.009941424],"genre_scores_gemma":[0.0914609,0.003526976,0.8618711,0.00044120572,0.0006444053,0.000228967,0.0031367058,0.0015296695,0.037160043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.00007264572,0.000011437253,0.000039096554,0.00008123492,0.000019702376],"domain_scores_gemma":[0.9992494,0.00041113407,0.000018499471,0.00011589503,0.00015174216,0.000053353397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011235559,0.0014315568,0.0010882989,0.00037982172,0.0003364856,0.001564505,0.0017751532,0.0022241052,0.008429294],"category_scores_gemma":[0.001630912,0.0007261619,0.0010324508,0.00046830665,0.00062081654,0.0013628523,0.0014101093,0.0019973817,0.0030126225],"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.00032567556,0.000300217,0.000577358,0.0005659652,0.00022508623,0.00048006055,0.00025858294,0.38642687,0.02535013,0.043790955,0.1328423,0.40885687],"study_design_scores_gemma":[0.000029593224,0.00008408757,0.00030816032,0.000042626027,0.000020342519,0.00017254423,0.00002748964,0.94277877,0.0056273793,0.020108808,0.030769218,0.00003090107],"about_ca_topic_score_codex":0.0025339685,"about_ca_topic_score_gemma":0.0046367026,"teacher_disagreement_score":0.008429294,"about_ca_system_score_codex":0.0003603799,"about_ca_system_score_gemma":0.00070596783,"threshold_uncertainty_score":0.028198779},"labels":[],"label_agreement":null},{"id":"W266823396","doi":"10.1007/978-3-642-38457-8_14","title":"Exhaustive Search with Belief Discernibility Matrix and Function","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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","funders":"","keywords":"Rough set; Decision table; Computer science; Function (biology); Matrix (chemical analysis); Selection (genetic algorithm); Artificial intelligence; Data mining; Table (database); Feature selection; Feature (linguistics); Algorithm","score_opus":0.017543295148199224,"score_gpt":0.24364889268407977,"score_spread":0.22610559753588055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266823396","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.024517816,0.0016576378,0.9630799,0.00045530993,0.000059819402,0.00011171909,0.00027657833,0.00049925264,0.009341908],"genre_scores_gemma":[0.31314352,0.0010444477,0.6738843,0.00021320624,0.00011071336,0.00042115047,0.00080439367,0.00018323067,0.010195085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906355,0.00041628594,0.00005669141,0.00016645475,0.00020492313,0.000092046976],"domain_scores_gemma":[0.9967841,0.0026994948,0.00007828944,0.00018304643,0.00020195243,0.000053029948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018668666,0.0010937263,0.0025107528,0.0028716186,0.0008732645,0.0016734822,0.0016887271,0.0021340654,0.008372452],"category_scores_gemma":[0.010070098,0.0009134166,0.0013162888,0.0033626487,0.0009444229,0.003455531,0.0018702389,0.0010399568,0.0009778761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005162399,0.00016637715,0.0009695074,0.00063194294,0.00022283629,0.00019435829,0.0002564703,0.5100344,0.001210418,0.13866058,0.0115383975,0.3355985],"study_design_scores_gemma":[0.00004733748,0.000055921573,0.00016911866,0.000054220953,0.00004325812,0.00006794179,0.00004343422,0.8925751,0.0005153966,0.105142556,0.0012703644,0.00001538819],"about_ca_topic_score_codex":0.0049183224,"about_ca_topic_score_gemma":0.004095765,"teacher_disagreement_score":0.008372452,"about_ca_system_score_codex":0.001102159,"about_ca_system_score_gemma":0.0019252761,"threshold_uncertainty_score":0.02800864},"labels":[],"label_agreement":null},{"id":"W26697920","doi":"10.1007/978-3-642-33167-1_7","title":"Satisfiability and Feasibility in a Relationship-Based Workflow Authorization Model","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Decidability; Workflow; Satisfiability; Programming language; Fragment (logic); State (computer science); Theoretical computer science; Model checking; Specification language; Workflow technology; Database","score_opus":0.048428778402634536,"score_gpt":0.31248234676431375,"score_spread":0.2640535683616792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26697920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06225476,0.00033001066,0.9155956,0.0033856975,0.000080228354,0.0002843591,0.00077326596,0.00042364068,0.016872404],"genre_scores_gemma":[0.6383006,0.000708467,0.34716675,0.00048543827,0.0003129513,0.0006474221,0.0015096848,0.00017715087,0.010691499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995835,0.0047488883,0.00092787255,0.0013802187,0.002113181,0.0008715201],"domain_scores_gemma":[0.979931,0.015785152,0.0010803327,0.0013929345,0.0013109716,0.0004997373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078040063,0.0009380079,0.0014702064,0.001982883,0.0025115088,0.006465263,0.0037715842,0.003528753,0.0066993465],"category_scores_gemma":[0.01978514,0.0019166662,0.004001361,0.0031680006,0.0051346733,0.015628994,0.0039944327,0.006665353,0.00093238015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018781712,0.00015741857,0.00048997806,0.00018561145,0.000071355826,0.00030601193,0.00044148555,0.09551913,0.0010950094,0.8887385,0.0018115139,0.010996266],"study_design_scores_gemma":[0.00007499799,0.000035097557,0.00011091904,0.000037930833,0.000044043194,0.00010481413,0.00011287967,0.3118968,0.00058138045,0.68538624,0.0015783902,0.00003645582],"about_ca_topic_score_codex":0.011250463,"about_ca_topic_score_gemma":0.009668587,"teacher_disagreement_score":0.011250463,"about_ca_system_score_codex":0.0034974555,"about_ca_system_score_gemma":0.0040730285,"threshold_uncertainty_score":0.041272044},"labels":[],"label_agreement":null},{"id":"W2675560546","doi":"","title":"A multistage image segmentation and denoising method - based on the mumford and shah variational approach","year":2004,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Smoothing; Segmentation; Piecewise; Scale-space segmentation; Noise reduction; Image segmentation; Artificial intelligence; Noise (video); Segmentation-based object categorization; Level set (data structures); Computer vision; Pattern recognition (psychology); Computer science; Mathematics; Active contour model; Constant (computer programming); Process (computing); Mathematical optimization; Image (mathematics); Mathematical analysis","score_opus":0.01928824804208021,"score_gpt":0.29219787103835065,"score_spread":0.2729096229962704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2675560546","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.0015929344,0.00007345185,0.99786454,0.000040071576,0.000021534051,0.000015943597,0.000011686298,0.00011649128,0.00026332153],"genre_scores_gemma":[0.040699724,0.00017371101,0.9553083,0.00006386109,0.000049111026,0.00006914789,0.000085662425,0.00013748922,0.0034130213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994854,0.0000968858,0.000029972176,0.00011931441,0.00021862931,0.000049685306],"domain_scores_gemma":[0.999579,0.0001359112,0.00003023902,0.00006798084,0.00014174021,0.00004508403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085221464,0.000640497,0.0014598401,0.001003348,0.0005678391,0.0009993236,0.0016075593,0.0019927807,0.0023594026],"category_scores_gemma":[0.001197466,0.0009476191,0.0016013462,0.00072852377,0.0006733025,0.0011027555,0.0015079898,0.0014325695,0.00081189844],"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.0003050383,0.00015509283,0.0012535766,0.00042221553,0.00032106327,0.0001853379,0.00026897466,0.20464414,0.22505291,0.07048339,0.0041780504,0.49273017],"study_design_scores_gemma":[0.000011427874,0.000050141338,0.00029839837,0.0000107136175,0.000039798248,0.00017195065,0.000009187995,0.97645277,0.0133564435,0.0057993433,0.0037623064,0.000037432877],"about_ca_topic_score_codex":0.0035222434,"about_ca_topic_score_gemma":0.0061386856,"teacher_disagreement_score":0.0035222434,"about_ca_system_score_codex":0.0006289551,"about_ca_system_score_gemma":0.0012910825,"threshold_uncertainty_score":0.007892966},"labels":[],"label_agreement":null},{"id":"W26798452","doi":"10.1007/3-540-45499-3_3","title":"Invited Talk: Making Mathematical Methods More Practical for Software Developers (Abstract)","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Experimental Learning in Engineering","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":"McMaster University","funders":"","keywords":"Computer science; Contrast (vision); Software; Software engineering; Work (physics); Mathematics education; Mathematical software; Programming language; Artificial intelligence; Engineering; Mathematics; Mechanical engineering","score_opus":0.028939838393130916,"score_gpt":0.3302794952267985,"score_spread":0.3013396568336676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26798452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009625607,0.0300896,0.14528042,0.21861233,0.2597253,0.00033780446,0.00086322916,0.00304306,0.3324226],"genre_scores_gemma":[0.038727757,0.009897154,0.025258172,0.024762515,0.073189914,0.0002831434,0.0008092807,0.0025213768,0.8245506],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882096,0.0004177723,0.000039706592,0.00022352679,0.00037013,0.00012791886],"domain_scores_gemma":[0.99709105,0.0013313988,0.00007689527,0.00014080906,0.0007242906,0.00063550536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030801028,0.00144706,0.000816603,0.0009449913,0.0015417256,0.0046626832,0.0014573704,0.003940128,0.106771015],"category_scores_gemma":[0.008243396,0.0006338602,0.0013398507,0.00068105,0.0011086811,0.0060499846,0.0033952922,0.0046377694,0.041236844],"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.00006950208,0.00008949727,0.00011647669,0.00020603983,0.00001679325,0.00008063766,0.00033589193,0.00045607597,0.0014788733,0.026491435,0.92312527,0.04753366],"study_design_scores_gemma":[0.000044923832,0.00008614931,0.0005004089,0.00020103015,0.000028460849,0.00015261253,0.0003331675,0.0010761329,0.0012700978,0.04616872,0.9501049,0.000033404398],"about_ca_topic_score_codex":0.00047512254,"about_ca_topic_score_gemma":0.0008325462,"teacher_disagreement_score":0.106771015,"about_ca_system_score_codex":0.0011518954,"about_ca_system_score_gemma":0.0010108987,"threshold_uncertainty_score":0.35718465},"labels":[],"label_agreement":null},{"id":"W2686375394","doi":"10.1007/978-3-319-60840-2_13","title":"Actionable Strategies in Three-Way Decisions with Rough Sets","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Disjoint sets; Rough set; Computer science; Boundary (topology); Set (abstract data type); Data mining; Artificial intelligence; Algorithm; Theoretical computer science; Mathematics","score_opus":0.034411595859119765,"score_gpt":0.2705644991495125,"score_spread":0.23615290329039276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2686375394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011409708,0.0006691915,0.9783569,0.0003107237,0.000082433515,0.000055683664,0.000052896597,0.00007567036,0.008986755],"genre_scores_gemma":[0.5362418,0.0015346501,0.45315778,0.000121332174,0.0001549969,0.00035435826,0.00018072528,0.000058171194,0.008196177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961876,0.0018432413,0.00032348797,0.00037891397,0.0009661146,0.00030062697],"domain_scores_gemma":[0.99547595,0.0034595127,0.00031003935,0.00031909283,0.00027431131,0.00016098609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042117164,0.0012363849,0.0019704828,0.001256058,0.00088029465,0.004354157,0.0019483272,0.0016114579,0.0033141058],"category_scores_gemma":[0.008734754,0.00086416677,0.0032731285,0.0019411396,0.003478715,0.004872589,0.002343041,0.0031766528,0.00049959315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040387764,0.000028168812,0.00013144796,0.00012180416,0.000072938594,0.000116578674,0.00034301777,0.11719205,0.00036853505,0.859663,0.0005436624,0.02137832],"study_design_scores_gemma":[0.000013512732,0.000031398784,0.00004989535,0.000025131101,0.000021776574,0.000023836667,0.000052744537,0.1907711,0.00021265294,0.807745,0.00103208,0.000020882017],"about_ca_topic_score_codex":0.0027265574,"about_ca_topic_score_gemma":0.0019047172,"teacher_disagreement_score":0.004354157,"about_ca_system_score_codex":0.0022534947,"about_ca_system_score_gemma":0.0014742876,"threshold_uncertainty_score":0.022273898},"labels":[],"label_agreement":null},{"id":"W26889985","doi":"10.1007/978-3-319-10470-6_22","title":"Multivariate Hippocampal Subfield Analysis of Local MRI Intensity and Volume: Application to Temporal Lobe Epilepsy","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Epilepsy research and treatment","field":"Medicine","cited_by":68,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Temporal lobe; Hippocampal formation; Epilepsy; Hippocampal sclerosis; Focus (optics); Computer science; Magnetic resonance imaging; Pattern recognition (psychology); Artificial intelligence; Multivariate statistics; Neuroscience; Medicine; Radiology; Psychology; Machine learning; Physics","score_opus":0.01135154751746379,"score_gpt":0.29018409611676366,"score_spread":0.27883254859929985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26889985","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.7533783,0.0012065799,0.24204285,0.0005647454,0.00005972826,0.000045352717,0.0006746688,0.0010740466,0.00095375755],"genre_scores_gemma":[0.9455041,0.0005548144,0.05284427,0.000025753881,0.00008551306,0.000019802515,0.00020920363,0.00011648345,0.00064003305],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998319,0.0000635285,0.000011933306,0.000032254575,0.00003995806,0.000020439978],"domain_scores_gemma":[0.9987225,0.0008461307,0.00015847772,0.00006979177,0.00012690811,0.00007623746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008633618,0.0005523557,0.00062984024,0.0011819134,0.00024765707,0.0005780201,0.0003129504,0.00021850587,0.00068562233],"category_scores_gemma":[0.0027618743,0.00015538145,0.0005996407,0.0018118402,0.0003149507,0.00029215726,0.0005063994,0.00045791984,0.0001312151],"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.002304945,0.0004897337,0.13376646,0.00023088882,0.00057306606,0.00084825564,0.00044985343,0.084472045,0.04581873,0.0032004223,0.0030634347,0.7247822],"study_design_scores_gemma":[0.00009263384,0.0003975018,0.19437097,0.000014735991,0.00028729936,0.0009701701,0.00031131378,0.7855004,0.009395987,0.0068099587,0.001764505,0.00008440668],"about_ca_topic_score_codex":0.0076994426,"about_ca_topic_score_gemma":0.008462691,"teacher_disagreement_score":0.0076994426,"about_ca_system_score_codex":0.00021424431,"about_ca_system_score_gemma":0.000556486,"threshold_uncertainty_score":0.015309215},"labels":[],"label_agreement":null},{"id":"W268964216","doi":"10.1007/978-3-642-15470-6","title":"Active Media Technology","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Saint Mary's University; York University","funders":"","keywords":"Computer science; Library science; Multimedia; Operations research; Engineering","score_opus":0.01744939223844359,"score_gpt":0.30619998210923655,"score_spread":0.28875058987079294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W268964216","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028719718,0.026898727,0.039454535,0.0014833058,0.0029394422,0.00007521807,0.00020182645,0.00090592547,0.92516917],"genre_scores_gemma":[0.030458461,0.01748432,0.007497268,0.00042793882,0.001063247,0.000087229906,0.000258017,0.00020679328,0.94251674],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997211,0.000027282305,0.000009275188,0.000049636823,0.00016564001,0.000026950062],"domain_scores_gemma":[0.9997025,0.0000959468,0.000014098835,0.000063614425,0.000081768434,0.000042031657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030032388,0.0010041776,0.0003681189,0.0015534726,0.0008691102,0.003988514,0.0011246755,0.0011858881,0.06445235],"category_scores_gemma":[0.00069752004,0.00033050578,0.000323463,0.0012897993,0.0008720351,0.00512196,0.0018070404,0.0012892976,0.028022945],"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.000059076647,0.00009220073,0.00016452537,0.00050171115,0.000012026475,0.00016236346,0.0006632206,0.000266755,0.012494556,0.23479256,0.13336398,0.61742705],"study_design_scores_gemma":[0.0000067345372,0.000038508002,0.0002674209,0.00017481568,0.000012119855,0.00039702503,0.0001967559,0.00057584466,0.0058245724,0.034856644,0.95763797,0.00001143685],"about_ca_topic_score_codex":0.00032758524,"about_ca_topic_score_gemma":0.0004847414,"teacher_disagreement_score":0.06445235,"about_ca_system_score_codex":0.0005090832,"about_ca_system_score_gemma":0.0005183052,"threshold_uncertainty_score":0.21561462},"labels":[],"label_agreement":null},{"id":"W269085259","doi":"10.1007/978-3-319-16354-3_39","title":"The Power of Contextual Suggestion","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Remuneration; Task (project management); Track (disk drive); Activity-based costing; Process (computing); Point (geometry); Operations research; Information retrieval; Data science; Finance; Accounting","score_opus":0.018959190244338377,"score_gpt":0.24534896012355975,"score_spread":0.22638976987922138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W269085259","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040466078,0.009135989,0.7836091,0.01699066,0.0009843911,0.00014315062,0.00062815315,0.002865572,0.14517693],"genre_scores_gemma":[0.8641349,0.002096564,0.111685656,0.0014419452,0.0013796756,0.00019585624,0.00042952076,0.00069549796,0.017940268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902863,0.005500614,0.00029169762,0.0015691385,0.0019213534,0.0004309297],"domain_scores_gemma":[0.91160816,0.064955585,0.0018516838,0.017312141,0.003151399,0.001121058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065241833,0.000970809,0.0016276746,0.0019787785,0.0031425597,0.005480457,0.0029557182,0.003526983,0.018255277],"category_scores_gemma":[0.0761942,0.0012939816,0.00096509827,0.002564531,0.0065725665,0.016958103,0.0056607537,0.004713443,0.0033264665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043645297,0.00007624266,0.0011375534,0.00026603867,0.00007138515,0.00012368077,0.0010362806,0.010077544,0.0011772898,0.8685913,0.013175812,0.103830546],"study_design_scores_gemma":[0.00005653969,0.00003547265,0.00027322155,0.000055919685,0.000059742873,0.00013304231,0.00014970965,0.0651321,0.0012791937,0.91484976,0.017935252,0.000039998275],"about_ca_topic_score_codex":0.0031145895,"about_ca_topic_score_gemma":0.0024173418,"teacher_disagreement_score":0.018255277,"about_ca_system_score_codex":0.0013366619,"about_ca_system_score_gemma":0.0016344143,"threshold_uncertainty_score":0.061069965},"labels":[],"label_agreement":null},{"id":"W2694336153","doi":"10.1007/978-3-319-60840-2_14","title":"Rough Set Approximations in an Incomplete Information Table","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Table (database); Computer science; Set (abstract data type); Interval (graph theory); Complete information; Semantics (computer science); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Data mining; Combinatorics; Programming language; Mathematical economics","score_opus":0.03286353411260774,"score_gpt":0.2637671461656309,"score_spread":0.23090361205302318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2694336153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010882632,0.0011512303,0.98362535,0.0003567767,0.00008565972,0.000032395925,0.00026994428,0.00009798361,0.0034979342],"genre_scores_gemma":[0.29173267,0.003220717,0.6969021,0.00010613198,0.0002340524,0.00014167979,0.000776653,0.00008125409,0.006804652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739385,0.00090963894,0.00023612595,0.00028902516,0.001052441,0.00011881336],"domain_scores_gemma":[0.99463636,0.00387258,0.0003089279,0.0006647481,0.000415505,0.00010197587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030188418,0.0004586461,0.0018068728,0.001676141,0.0006929378,0.0039814264,0.0015567784,0.0009994026,0.003027478],"category_scores_gemma":[0.011791115,0.00084065384,0.0016932284,0.0031117154,0.0012122882,0.0050628106,0.0016008338,0.0020518163,0.00051274546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012153805,0.000031315285,0.00048441387,0.00028325382,0.000082453895,0.0003149784,0.00035118932,0.3357037,0.00074755587,0.59024453,0.0028797234,0.06875542],"study_design_scores_gemma":[0.0000114491895,0.00002796407,0.00014598649,0.00006766302,0.000047901944,0.000102697864,0.000057279864,0.67748135,0.0005920335,0.3168417,0.0045987316,0.000025281508],"about_ca_topic_score_codex":0.003127663,"about_ca_topic_score_gemma":0.0016723498,"teacher_disagreement_score":0.0039814264,"about_ca_system_score_codex":0.0017031587,"about_ca_system_score_gemma":0.001105057,"threshold_uncertainty_score":0.015965343},"labels":[],"label_agreement":null},{"id":"W269753523","doi":"10.1007/978-3-319-09129-7_31","title":"Sensing World Heritage","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cultural Heritage Management and Preservation","field":"Arts and Humanities","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":"Toronto Metropolitan University","funders":"","keywords":"Wilderness; Social media; Marketing buzz; World heritage; Cultural heritage management; Cultural heritage; Political science; Industrial heritage; Government (linguistics); Geography; Public relations; Advertising; Archaeology; Business; Ecology","score_opus":0.06373696708006027,"score_gpt":0.22984146565126487,"score_spread":0.1661044985712046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W269753523","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0671431,0.0047424403,0.31759724,0.0011764655,0.00087718375,0.00023706186,0.007218212,0.005326554,0.5956818],"genre_scores_gemma":[0.35734606,0.007483486,0.18001321,0.0008774999,0.0003793365,0.00016298171,0.01548124,0.0006946201,0.4375616],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998349,0.000009699832,0.000003318586,0.00004931467,0.00008508362,0.00001765604],"domain_scores_gemma":[0.99992585,0.000017680311,0.000005415025,0.000017126822,0.000025970983,0.000007970996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025445488,0.00051044644,0.00024172482,0.001410947,0.00043497456,0.0013040998,0.00067732914,0.00048727315,0.022246059],"category_scores_gemma":[0.0003208845,0.00027322368,0.00029189276,0.0012327625,0.0002686275,0.001327502,0.00089969113,0.00036248603,0.0077305106],"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.00005289312,0.00006177101,0.0057037943,0.00020962872,0.000042985892,0.00010512033,0.00035740007,0.0023236605,0.033988133,0.0073234285,0.05013672,0.89969444],"study_design_scores_gemma":[0.000018406383,0.00012676626,0.040051714,0.000287857,0.000114537645,0.00095421815,0.002191939,0.03194516,0.077996194,0.017754503,0.8284679,0.000090698886],"about_ca_topic_score_codex":0.005924955,"about_ca_topic_score_gemma":0.018237753,"teacher_disagreement_score":0.022246059,"about_ca_system_score_codex":0.0002723976,"about_ca_system_score_gemma":0.00029319472,"threshold_uncertainty_score":0.07442051},"labels":[],"label_agreement":null},{"id":"W27052430","doi":"10.1007/3-540-47922-8_31","title":"Application of Bayesian Networks to Shopping Assistance","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Preference; Bayesian network; Computer science; Domain (mathematical analysis); Product (mathematics); Line (geometry); Product line; Bayesian probability; Value (mathematics); Human–computer interaction; Artificial intelligence; Machine learning; Engineering; Mathematics; Statistics; Manufacturing engineering","score_opus":0.01893435771583731,"score_gpt":0.24432909496770128,"score_spread":0.22539473725186396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27052430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069282916,0.0021576697,0.9653485,0.00089815445,0.0001265738,0.00004861164,0.0001593469,0.0003913891,0.023941377],"genre_scores_gemma":[0.38011676,0.0069800545,0.5845385,0.00026974757,0.00030872136,0.00018024824,0.0004353042,0.00022596211,0.02694476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987979,0.0006804784,0.000050088245,0.00015994112,0.00025740778,0.000054106113],"domain_scores_gemma":[0.9953027,0.003917656,0.00012104186,0.00022637633,0.0003593319,0.000072844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016740112,0.0008721823,0.0010026318,0.0016078869,0.00080827344,0.0018539114,0.0015510663,0.0018315999,0.00978468],"category_scores_gemma":[0.012330831,0.0009021776,0.0008427235,0.002495518,0.0010373584,0.0024310076,0.0016144003,0.0015741684,0.0011709355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011945101,0.0001404851,0.0010247398,0.00019854626,0.000094463154,0.0002194207,0.00029427276,0.4148363,0.0006688866,0.31581563,0.008156214,0.25843167],"study_design_scores_gemma":[0.000015006469,0.00001195177,0.00027784484,0.00003992283,0.000021846903,0.0000717388,0.00004747772,0.691017,0.00045119086,0.29978785,0.008237466,0.000020819127],"about_ca_topic_score_codex":0.016291454,"about_ca_topic_score_gemma":0.013319639,"teacher_disagreement_score":0.016291454,"about_ca_system_score_codex":0.0012390563,"about_ca_system_score_gemma":0.0010057718,"threshold_uncertainty_score":0.032732964},"labels":[],"label_agreement":null},{"id":"W270596444","doi":"10.1007/978-3-319-17040-4_14","title":"A Formal Approach to Verify Completeness and Detect Anomalies in Firewall Security Policies","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Security policy; Automaton; Firewall (physics); Completeness (order theory); Computer security model; Computer security; Formalism (music); Formal methods; Theoretical computer science; Software engineering; Spacetime","score_opus":0.03820750955614092,"score_gpt":0.26836447362602334,"score_spread":0.23015696406988242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W270596444","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.0018230856,0.00004245626,0.9956393,0.00020913135,0.00003935867,0.00012106029,0.000057628666,0.0011127637,0.0009550928],"genre_scores_gemma":[0.109946914,0.00016972072,0.884823,0.00036374282,0.00013110337,0.00045250636,0.000299085,0.00055307103,0.0032609212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986816,0.0036190513,0.0015651456,0.0016377756,0.0051540695,0.0012078936],"domain_scores_gemma":[0.9597415,0.024831075,0.0017727576,0.00805378,0.0049948,0.0006060634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009960968,0.0021525545,0.0015524013,0.002995676,0.0021517323,0.0044679707,0.005604009,0.0030653032,0.00585617],"category_scores_gemma":[0.02915643,0.0034450004,0.005560823,0.0015435911,0.008916153,0.012663095,0.006888776,0.007834659,0.0015369005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018145132,0.00047909908,0.0014860465,0.0007153654,0.00020198524,0.00054367556,0.0011012204,0.07691816,0.015079104,0.792514,0.0053650416,0.105414815],"study_design_scores_gemma":[0.00013629413,0.00014185626,0.0002452974,0.00020800813,0.00020852534,0.00037481586,0.00019848841,0.362492,0.022617707,0.6014644,0.011806038,0.00010654963],"about_ca_topic_score_codex":0.005216467,"about_ca_topic_score_gemma":0.0063016172,"teacher_disagreement_score":0.009960968,"about_ca_system_score_codex":0.002690404,"about_ca_system_score_gemma":0.00594241,"threshold_uncertainty_score":0.05267924},"labels":[],"label_agreement":null},{"id":"W27060824","doi":"10.1007/978-3-642-45043-3_10","title":"The θ 5-Graph is a Spanner","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Upper and lower bounds; Euclidean geometry; Graph; Constructive; Mathematics; Discrete mathematics; Computer science; Geometry","score_opus":0.014224075468779294,"score_gpt":0.23316569446582788,"score_spread":0.2189416189970486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27060824","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18839155,0.000934742,0.18976916,0.001891831,0.0016252431,0.00018861312,0.0017834089,0.0009652014,0.6144502],"genre_scores_gemma":[0.67542666,0.0016066082,0.083147116,0.001172047,0.00039085152,0.00018524352,0.0030300887,0.0008712518,0.23417026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997813,0.000026923091,0.000009557183,0.00007232441,0.0000571542,0.000052710795],"domain_scores_gemma":[0.9997416,0.000050388324,0.000035474935,0.000039927785,0.00006280906,0.000069783215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014816545,0.0008529299,0.00052143395,0.0012042865,0.0013758118,0.0013216309,0.00073501613,0.00088205317,0.026302436],"category_scores_gemma":[0.00040725293,0.00049104926,0.0006247245,0.0009619138,0.0011076371,0.0017269055,0.0010788012,0.0019004398,0.006506374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009506545,0.000058386984,0.00037547192,0.00013555987,0.000030784096,0.00044350073,0.00022142832,0.0018579765,0.0080584,0.9311637,0.013505651,0.044054095],"study_design_scores_gemma":[0.000025419728,0.000078482924,0.0010495773,0.00006327389,0.00003392762,0.0007943051,0.0004815086,0.0030564037,0.0045551443,0.89572567,0.09410966,0.000026558471],"about_ca_topic_score_codex":0.0007578463,"about_ca_topic_score_gemma":0.0010783575,"teacher_disagreement_score":0.026302436,"about_ca_system_score_codex":0.00039821383,"about_ca_system_score_gemma":0.00033176347,"threshold_uncertainty_score":0.0879904},"labels":[],"label_agreement":null},{"id":"W27140714","doi":"10.1007/978-3-642-29038-1_21","title":"Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Data mining; Tree (set theory); Key (lock); Compact space; Tree structure; Data structure; Uncertain data; Mathematics","score_opus":0.05112431804604601,"score_gpt":0.2813581045961621,"score_spread":0.23023378655011612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27140714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044257157,0.0023560745,0.94658244,0.00029664556,0.0001651053,0.00025310193,0.0025250006,0.002424774,0.0011396668],"genre_scores_gemma":[0.1713416,0.0012739727,0.8165242,0.00014495633,0.00015563532,0.00030518783,0.008504494,0.00014990744,0.001600069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983968,0.0002902773,0.00021638419,0.00027236826,0.00068625435,0.00013794609],"domain_scores_gemma":[0.99048156,0.006604497,0.00039153436,0.00075309386,0.0015677357,0.00020155971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018120514,0.000826916,0.002073502,0.0028400968,0.00087043835,0.0016375881,0.0022292677,0.0013258802,0.0025973495],"category_scores_gemma":[0.0111243725,0.00072574057,0.0013897001,0.0054519707,0.00029918304,0.0029299466,0.0012789535,0.0012747851,0.0021093134],"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.00073572865,0.00023156096,0.0047097835,0.0008343098,0.00031774325,0.00061522634,0.000302482,0.052137848,0.0093230605,0.0056336783,0.015909823,0.90924877],"study_design_scores_gemma":[0.00009899574,0.00028491378,0.0019493009,0.000106518426,0.00014231954,0.001292288,0.00019195401,0.9598824,0.00518709,0.024012601,0.006811458,0.00004021549],"about_ca_topic_score_codex":0.0026722574,"about_ca_topic_score_gemma":0.0037255136,"teacher_disagreement_score":0.0028400968,"about_ca_system_score_codex":0.000417385,"about_ca_system_score_gemma":0.0013166124,"threshold_uncertainty_score":0.009583175},"labels":[],"label_agreement":null},{"id":"W2714736248","doi":"10.1007/978-3-319-61470-0_13","title":"GRAPE – A Graph Rewriting and Persistence Engine","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Graph rewriting; Computer science; Programming language; Rewriting; Digital subscriber line; Graph; Graph database; Theoretical computer science; Domain-specific language; Debugger; Backtracking; Debugging","score_opus":0.020194722657668147,"score_gpt":0.23143945818980657,"score_spread":0.21124473553213843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2714736248","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005317132,0.00042503234,0.92477345,0.0002806363,0.0002645206,0.00012930566,0.0005016117,0.05635262,0.011955689],"genre_scores_gemma":[0.13543202,0.00084162055,0.80119336,0.00054539077,0.00015515828,0.0002092621,0.003373817,0.020199653,0.0380498],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991578,0.00015295969,0.00006729979,0.00022755592,0.00033442685,0.000059981907],"domain_scores_gemma":[0.9986444,0.00042601116,0.000053271484,0.00058373075,0.00023263149,0.000060050483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084320176,0.00071398314,0.00072848244,0.00095569814,0.0005890824,0.0015236686,0.0022002817,0.0009203088,0.009955219],"category_scores_gemma":[0.003575135,0.0008044518,0.0013609009,0.0008089808,0.0009814617,0.0024815258,0.0021459023,0.0018980597,0.005747529],"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.00027445907,0.00021989939,0.0008386921,0.00087268255,0.0001821605,0.00045913694,0.00051930913,0.03911405,0.03859651,0.24249664,0.085615575,0.59081084],"study_design_scores_gemma":[0.00018536749,0.0001750177,0.00048357452,0.00017029098,0.0001934835,0.0007065817,0.000117832824,0.2470561,0.048494756,0.36338344,0.33889768,0.00013592884],"about_ca_topic_score_codex":0.002468576,"about_ca_topic_score_gemma":0.0032961143,"teacher_disagreement_score":0.009955219,"about_ca_system_score_codex":0.000522894,"about_ca_system_score_gemma":0.00090737495,"threshold_uncertainty_score":0.03330356},"labels":[],"label_agreement":null},{"id":"W2717411145","doi":"10.1007/978-3-319-60837-2_18","title":"Fractal Analysis Approaches to Granular Computing","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modeling, Simulation, and Optimization","field":"Mathematics","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 Regina","funders":"","keywords":"Granular computing; Fractal; Fractal analysis; Computer science; Point (geometry); Theoretical computer science; Artificial intelligence; Fractal dimension; Mathematics; Rough set; Geometry","score_opus":0.11001570276218935,"score_gpt":0.30087687761916143,"score_spread":0.19086117485697207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2717411145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007859991,0.025602242,0.9053325,0.0026160285,0.0012118447,0.000036780566,0.0001979958,0.00051115605,0.056631476],"genre_scores_gemma":[0.47188744,0.036490433,0.40883723,0.0010300507,0.004312139,0.00026376377,0.00062164717,0.0007294518,0.07582774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996691,0.00007492681,0.00002321764,0.000046782545,0.00015074827,0.00003519088],"domain_scores_gemma":[0.9991167,0.00045868108,0.00006390846,0.00016047015,0.00013887322,0.00006130082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617752,0.0008638362,0.0011981027,0.0022799997,0.0006521661,0.003004543,0.0011886888,0.0011896035,0.0049456176],"category_scores_gemma":[0.0021384433,0.0004917394,0.00094926363,0.0022331262,0.002088989,0.0025371332,0.0014039155,0.0026351055,0.001024897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062420595,0.0000065921745,0.000054536686,0.00006960138,0.000012090801,0.000031311003,0.00006041902,0.008841071,0.00044629266,0.97169435,0.0033101323,0.015467416],"study_design_scores_gemma":[0.0000032075309,0.0000047660983,0.00008479381,0.000025206144,0.0000057436473,0.0000468788,0.00001937154,0.03796207,0.00020400503,0.9475471,0.014088145,0.000008802018],"about_ca_topic_score_codex":0.0010448263,"about_ca_topic_score_gemma":0.0009349515,"teacher_disagreement_score":0.0049456176,"about_ca_system_score_codex":0.0012102039,"about_ca_system_score_gemma":0.0004983941,"threshold_uncertainty_score":0.0165447},"labels":[],"label_agreement":null},{"id":"W2721042046","doi":"10.1007/978-3-319-61176-1_12","title":"Privacy-Preserving Outlier Detection for Data Streams","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential privacy; Computer science; Outlier; Anomaly detection; Data stream mining; Data mining; Perturbation (astronomy); Algorithm; Artificial intelligence","score_opus":0.06157894011143261,"score_gpt":0.3044801321542447,"score_spread":0.24290119204281208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2721042046","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.014564954,0.0005321631,0.98325735,0.00021727766,0.000053637297,0.000039962393,0.00009708449,0.00088405,0.00035358677],"genre_scores_gemma":[0.636555,0.0008840362,0.35884658,0.00028524167,0.0002680501,0.00011995209,0.00080080365,0.0002492981,0.00199102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994504,0.0015314553,0.0003386221,0.0011435534,0.0021968225,0.00028569865],"domain_scores_gemma":[0.992489,0.003532664,0.0009654496,0.0020262436,0.0008208427,0.00016577699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00337868,0.0014174688,0.001824606,0.001112664,0.0007437418,0.001925423,0.001933637,0.0014495497,0.00066079595],"category_scores_gemma":[0.014525869,0.00041814923,0.001082836,0.0026375668,0.0017095827,0.0031540452,0.0032252623,0.0027020536,0.0005541143],"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.00094043993,0.00023085452,0.008683708,0.00033618326,0.0002647939,0.00058521127,0.00042214512,0.4023832,0.03358559,0.033235047,0.0064422223,0.5128905],"study_design_scores_gemma":[0.000017455946,0.00013956656,0.000777333,0.000016222437,0.000021398288,0.00036349462,0.000056232104,0.92763263,0.02551214,0.04310503,0.0023366436,0.000021795415],"about_ca_topic_score_codex":0.0004963429,"about_ca_topic_score_gemma":0.00035574337,"teacher_disagreement_score":0.00337868,"about_ca_system_score_codex":0.0010483998,"about_ca_system_score_gemma":0.00070493383,"threshold_uncertainty_score":0.01786834},"labels":[],"label_agreement":null},{"id":"W2723261621","doi":"10.1007/978-3-319-61473-1_10","title":"Graph Constraint Evaluation over Partial Models by Constraint Rewriting","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Rewriting; Constraint programming; Graph; Constraint logic programming; Graph rewriting; Constraint satisfaction; Partial evaluation; Constraint graph; Theoretical computer science; Programming language; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.031787898919781656,"score_gpt":0.2769172485115446,"score_spread":0.24512934959176294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2723261621","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.007209914,0.00032896537,0.9767074,0.00029761606,0.0000917963,0.0001507733,0.00023063109,0.0019231499,0.0130597325],"genre_scores_gemma":[0.16774632,0.0007798901,0.8114252,0.0002784183,0.00010204685,0.00018513929,0.0011497956,0.0026713684,0.015661806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665594,0.0010406716,0.00015752316,0.00047678108,0.0014548574,0.00021426112],"domain_scores_gemma":[0.99537694,0.0029524262,0.00013630056,0.0007756446,0.0006766316,0.000082029546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016398036,0.0010156507,0.0010587767,0.0014379498,0.0007953956,0.0021909622,0.002142931,0.00087731314,0.0094866],"category_scores_gemma":[0.009504741,0.0010282015,0.0022219392,0.0023963968,0.0015961142,0.004015191,0.0025148692,0.002897883,0.0018650795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014304637,0.00013781914,0.00040533458,0.0009324922,0.00018098128,0.0006348023,0.00044154812,0.16773824,0.015425203,0.43805793,0.016720572,0.35918194],"study_design_scores_gemma":[0.000040323062,0.000039329487,0.0001444567,0.000117174975,0.00010119839,0.00021101777,0.00010869653,0.431868,0.019207029,0.5204039,0.027708359,0.00005057765],"about_ca_topic_score_codex":0.005409906,"about_ca_topic_score_gemma":0.009494417,"teacher_disagreement_score":0.0094866,"about_ca_system_score_codex":0.0015233497,"about_ca_system_score_gemma":0.0014970524,"threshold_uncertainty_score":0.031735778},"labels":[],"label_agreement":null},{"id":"W2724114645","doi":"10.1007/978-3-319-62701-4_1","title":"Incorporating Positional Information into Deep Belief Networks for Sentiment Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 New Brunswick","funders":"","keywords":"Computer science; Artificial intelligence; Deep belief network; Information retrieval; Natural language processing; Deep learning","score_opus":0.020165617173073854,"score_gpt":0.26621136890084995,"score_spread":0.2460457517277761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724114645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030775681,0.0015239476,0.96011126,0.00073972443,0.00031791796,0.000047833288,0.0004539614,0.0013771666,0.004652669],"genre_scores_gemma":[0.702434,0.001812954,0.2806804,0.00044491736,0.00041153195,0.00014312318,0.0019444259,0.00025174368,0.011876889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.00007173959,0.000020717513,0.00006632234,0.000077094424,0.0000450028],"domain_scores_gemma":[0.99919385,0.00041240352,0.00006730518,0.00006549623,0.00022642415,0.000034555847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007239887,0.0010781982,0.00071566063,0.0008218913,0.00044712448,0.0011852934,0.0012242023,0.0011094422,0.004003697],"category_scores_gemma":[0.0028123427,0.0006347685,0.00068056275,0.0010231677,0.00031900464,0.0021971245,0.0010328862,0.0024900176,0.0019712013],"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.00023548845,0.00027073035,0.0018757175,0.00017730833,0.00014737263,0.00008218276,0.000112197224,0.298073,0.010345151,0.016293295,0.0111753205,0.6612123],"study_design_scores_gemma":[0.000003520629,0.000014155428,0.000099242374,0.000011752556,0.000013351063,0.0000060654447,0.0000055842497,0.99055266,0.000999528,0.007855182,0.0004350213,0.0000039393094],"about_ca_topic_score_codex":0.006155812,"about_ca_topic_score_gemma":0.0112914005,"teacher_disagreement_score":0.006155812,"about_ca_system_score_codex":0.0008426937,"about_ca_system_score_gemma":0.0006408835,"threshold_uncertainty_score":0.0133937},"labels":[],"label_agreement":null},{"id":"W2725817408","doi":"10.1007/978-3-319-61188-4","title":"Medical Computer Vision and Bayesian and Graphical Models for Biomedical Imaging","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"McGill University","funders":"","keywords":"Computer science; Medical imaging; Graphical model; Computer graphics (images); Artificial intelligence; Bayesian probability; Computer vision; Human–computer interaction; Data science","score_opus":0.010003029096094957,"score_gpt":0.27294491078032607,"score_spread":0.2629418816842311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725817408","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007552312,0.048125714,0.9324622,0.0021645592,0.0010468782,0.000029219693,0.0003516884,0.00072396826,0.014340446],"genre_scores_gemma":[0.079774156,0.098377064,0.727563,0.001805887,0.005013089,0.0002454546,0.0017024203,0.000812151,0.084706746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993637,0.00018818762,0.00003319866,0.00011351942,0.00027304553,0.000028293001],"domain_scores_gemma":[0.99882036,0.00073813094,0.0000643086,0.00014772758,0.00019707053,0.00003234639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000933168,0.001231705,0.0013922554,0.0019272603,0.0002445814,0.0019462142,0.0015298082,0.0018970248,0.009907573],"category_scores_gemma":[0.0035766046,0.0008176246,0.0012083581,0.0028073338,0.0011765055,0.0024403608,0.0010917275,0.0025940274,0.005034697],"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.000036914153,0.000052098472,0.0002274981,0.0010003608,0.00012121347,0.000104921026,0.00008040969,0.061718103,0.0019663381,0.37285846,0.09793263,0.463901],"study_design_scores_gemma":[0.000010283248,0.000022194898,0.00041584985,0.00015013387,0.000040977124,0.0003438372,0.000022157805,0.18625279,0.0007260741,0.7234401,0.08853132,0.000044318414],"about_ca_topic_score_codex":0.0022841285,"about_ca_topic_score_gemma":0.002579174,"teacher_disagreement_score":0.009907573,"about_ca_system_score_codex":0.00088400766,"about_ca_system_score_gemma":0.0007250292,"threshold_uncertainty_score":0.033144116},"labels":[],"label_agreement":null},{"id":"W2726989136","doi":"10.1007/978-3-319-63004-5_6","title":"A Deterministic Actor-Critic Approach to Stochastic Reinforcements","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Reinforcement learning; Variance (accounting); Function (biology); Computer science; Reinforcement; Artificial intelligence; Temporal difference learning; Mathematical optimization; Mathematics; Psychology; Economics; Social psychology","score_opus":0.10029967253347143,"score_gpt":0.3690955365600705,"score_spread":0.26879586402659905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726989136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018643889,0.00038625769,0.99130064,0.00025729006,0.00010054229,0.000013281438,0.000022755701,0.00009665471,0.0059582205],"genre_scores_gemma":[0.64186674,0.0016949577,0.32113877,0.00035070305,0.0005004059,0.00022294157,0.00014975398,0.00028010673,0.0337956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925035,0.0003364363,0.0000377531,0.00012294785,0.00019307063,0.00005943703],"domain_scores_gemma":[0.9986199,0.0009472444,0.00008204025,0.00007861403,0.00020258811,0.00006954304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012658739,0.0010343372,0.0011746807,0.00044142312,0.00044503555,0.0014272104,0.0021291259,0.0018466469,0.0044681],"category_scores_gemma":[0.0039569144,0.00078198995,0.00083807326,0.00061134354,0.0012554898,0.0011292375,0.0014901679,0.0024159544,0.0006821872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023126247,0.000019290628,0.00010880746,0.000051532606,0.000039108683,0.000046304947,0.000034444372,0.83667004,0.0006019613,0.14484887,0.0015372571,0.016019277],"study_design_scores_gemma":[0.000004113599,0.0000064601245,0.000017761507,0.0000054665143,0.0000051766283,0.00000717012,0.0000018595048,0.9656881,0.00008874319,0.033633173,0.00053803175,0.000003924531],"about_ca_topic_score_codex":0.004322309,"about_ca_topic_score_gemma":0.004695648,"teacher_disagreement_score":0.0044681,"about_ca_system_score_codex":0.0014964226,"about_ca_system_score_gemma":0.0012178516,"threshold_uncertainty_score":0.014947355},"labels":[],"label_agreement":null},{"id":"W2727040849","doi":"10.1007/978-3-319-75541-0","title":"Statistical Atlases and Computational Models of the Heart. ACDC and MMWHS Challenges","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.029790258528517806,"score_gpt":0.2933749436632317,"score_spread":0.2635846851347139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727040849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015221153,0.021471974,0.91111493,0.024404285,0.0012829383,0.000033026503,0.0023147978,0.0011781192,0.022978855],"genre_scores_gemma":[0.6450151,0.046952028,0.2616826,0.0030657866,0.008045468,0.00021200237,0.0044440906,0.00076352997,0.029819371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.00019350291,0.000023606573,0.00012935292,0.00015931147,0.000038847385],"domain_scores_gemma":[0.9965088,0.001993268,0.0001875974,0.0006116109,0.00038441792,0.00031430676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019359087,0.0005403643,0.0011297308,0.0012684797,0.0004123926,0.0032148443,0.002195231,0.0013356775,0.0049099163],"category_scores_gemma":[0.008401473,0.00070072815,0.00086532976,0.0016644187,0.0020061838,0.0033485896,0.0020395564,0.003598465,0.0015362815],"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.000061012375,0.000027058279,0.0020905568,0.00023107705,0.00007666706,0.00021418126,0.00014088111,0.089561194,0.00115937,0.7025993,0.048923656,0.15491512],"study_design_scores_gemma":[0.000007391689,0.000017188913,0.0007263527,0.00004472834,0.000012023278,0.00034539643,0.00005830906,0.2004183,0.00030844047,0.77694094,0.021100553,0.000020355032],"about_ca_topic_score_codex":0.003169858,"about_ca_topic_score_gemma":0.0026822737,"teacher_disagreement_score":0.0049099163,"about_ca_system_score_codex":0.0011590862,"about_ca_system_score_gemma":0.0009184211,"threshold_uncertainty_score":0.016425252},"labels":[],"label_agreement":null},{"id":"W27276676","doi":"10.1007/978-3-642-33418-4_79","title":"Registration Accuracy: How Good Is Good Enough? A Statistical Power Calculation Incorporating Image Registration Uncertainty","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lawson Health Research Institute; Western University; Robarts Clinical Trials","funders":"Canadian Institutes of Health Research; Cancer Care Ontario","keywords":"Image registration; Computer science; Statistical power; Monte Carlo method; Context (archaeology); Artificial intelligence; Sample size determination; Statistical model; Sample (material); Power (physics); Algorithm; Image (mathematics); Computer vision; Statistics; Mathematics","score_opus":0.014204946502288852,"score_gpt":0.3056993930038886,"score_spread":0.2914944465015997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27276676","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.028137676,0.0020443117,0.96462137,0.0020197646,0.00020659973,0.00012033009,0.00011317515,0.00038643988,0.0023503578],"genre_scores_gemma":[0.70688665,0.0012169228,0.28727543,0.0011413608,0.0006484844,0.00046743875,0.00018148402,0.0009022443,0.0012800366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96914196,0.017523589,0.0027844165,0.003113981,0.006908214,0.0005279323],"domain_scores_gemma":[0.7809041,0.18254615,0.009177837,0.018849235,0.007867391,0.00065526704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.048148,0.0012927096,0.0026842298,0.00284031,0.0008358784,0.0036469449,0.0024143127,0.0034723764,0.0017449652],"category_scores_gemma":[0.26105452,0.0011911716,0.0020546203,0.0029591925,0.0049994253,0.007930165,0.0031893875,0.0025670265,0.00066071155],"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.0010885822,0.00022283489,0.049838,0.0011332695,0.0030028152,0.0006331234,0.001252371,0.18878484,0.010522146,0.08789751,0.0076784217,0.64794606],"study_design_scores_gemma":[0.00025696328,0.0014735543,0.03266238,0.0005856963,0.002014961,0.00335229,0.00034323757,0.67392194,0.02060434,0.25464994,0.009757864,0.00037681696],"about_ca_topic_score_codex":0.0005548738,"about_ca_topic_score_gemma":0.0005864383,"teacher_disagreement_score":0.048148,"about_ca_system_score_codex":0.000995837,"about_ca_system_score_gemma":0.00087731227,"threshold_uncertainty_score":0.25463396},"labels":[],"label_agreement":null},{"id":"W2728231354","doi":"10.1007/978-3-319-62389-4_37","title":"Bend Complexity and Hamiltonian Cycles in Grid Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Victoria","funders":"","keywords":"Hamiltonian path; Transpose; Hamiltonian path problem; Hamiltonian (control theory); Grid; Computer science; Computational complexity theory; Combinatorics; Graph; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Geometry; Physics; Mathematical optimization; Quantum mechanics","score_opus":0.02927127404288834,"score_gpt":0.2694253609652324,"score_spread":0.24015408692234405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728231354","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.5509737,0.007989086,0.20640229,0.0049024336,0.00052127265,0.0001532397,0.0012270163,0.0003301031,0.22750096],"genre_scores_gemma":[0.9331746,0.0045247255,0.0266137,0.00043260097,0.000626917,0.0001656681,0.0008533131,0.00019409502,0.03341428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968493,0.00006912322,0.00001313668,0.00006406738,0.000118985714,0.000049809194],"domain_scores_gemma":[0.99856925,0.0009067846,0.00017022637,0.00010086069,0.000108738415,0.00014422806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027031856,0.0005692586,0.0006040193,0.0016562996,0.0008626218,0.0021371096,0.0009951447,0.0010860788,0.007440642],"category_scores_gemma":[0.0029149044,0.00058333966,0.0005652649,0.0021504294,0.0016876679,0.0035951566,0.0011762958,0.0021691415,0.00056901993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055342603,0.000033692126,0.00051297864,0.000121706194,0.000015536256,0.000077424935,0.00025138364,0.021060314,0.0011368508,0.951517,0.0049603065,0.020257493],"study_design_scores_gemma":[0.0000065752747,0.000006399364,0.00025730417,0.0000123423215,0.000005055429,0.000043256372,0.000049868417,0.012622541,0.00016959522,0.984528,0.0022924044,0.0000065199506],"about_ca_topic_score_codex":0.0015330075,"about_ca_topic_score_gemma":0.0014961625,"teacher_disagreement_score":0.007440642,"about_ca_system_score_codex":0.0011397402,"about_ca_system_score_gemma":0.0004187981,"threshold_uncertainty_score":0.024891496},"labels":[],"label_agreement":null},{"id":"W2730440053","doi":"10.1007/978-3-319-62127-2_9","title":"Dynamic Graph Coloring","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Exploratory Research for Advanced Technology; Fonds De La Recherche Scientifique - FNRS; Carleton University","keywords":"Combinatorics; List coloring; Omega; Graph; Vertex (graph theory); Fractional coloring; Mathematics; Complete coloring; Binary logarithm; Brooks' theorem; Edge coloring; Upper and lower bounds; Graph coloring; Discrete mathematics; Graph power; Physics; Line graph","score_opus":0.026295172870889456,"score_gpt":0.3273733207876667,"score_spread":0.30107814791677723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730440053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10915643,0.0023484507,0.8239803,0.0021711998,0.00066348986,0.0005041902,0.0014236592,0.0049642413,0.05478795],"genre_scores_gemma":[0.4481763,0.0016979343,0.5193847,0.0012395035,0.00040917602,0.0005672612,0.0027039521,0.002626639,0.023194497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953193,0.0008487665,0.00019334606,0.0014267672,0.0012522726,0.00095948076],"domain_scores_gemma":[0.9849726,0.0069047646,0.0012362077,0.0050030784,0.0011419589,0.0007413336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020847258,0.0016353211,0.0017237762,0.001263773,0.0023676304,0.003881483,0.0042121625,0.0016365943,0.013025419],"category_scores_gemma":[0.012050407,0.0008737926,0.0011947762,0.0029125893,0.0016387212,0.0070107994,0.0028751954,0.0026868735,0.003087253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014465085,0.0008020806,0.006536887,0.0011179851,0.00028818796,0.00036609476,0.00060479995,0.37581354,0.030863408,0.23695394,0.036431078,0.30877542],"study_design_scores_gemma":[0.00023210717,0.00042945155,0.0020506834,0.00009488703,0.0001875371,0.0011288212,0.0003448738,0.71358603,0.018125642,0.186733,0.07701262,0.00007434867],"about_ca_topic_score_codex":0.0037439917,"about_ca_topic_score_gemma":0.005960478,"teacher_disagreement_score":0.013025419,"about_ca_system_score_codex":0.004265663,"about_ca_system_score_gemma":0.0032554637,"threshold_uncertainty_score":0.043574393},"labels":[],"label_agreement":null},{"id":"W2731228715","doi":"10.1007/978-3-319-63874-4_6","title":"Group Matching for Peer Mentorship in Small Groups","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Mentorship; Computer science; Group (periodic table); Matching (statistics); Constructive; Constructive criticism; Session (web analytics); Peer feedback; Theoretical computer science; Mathematics education; Criticism; World Wide Web; Psychology; Mathematics; Medical education; Process (computing)","score_opus":0.07730487193262699,"score_gpt":0.36915098543385794,"score_spread":0.29184611350123096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731228715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067246124,0.00056075293,0.9064209,0.00053132937,0.00041503969,0.0010298972,0.00013095749,0.0014888537,0.022176126],"genre_scores_gemma":[0.5401136,0.00024328948,0.42624664,0.00021955869,0.0002694643,0.00125397,0.0002716964,0.00030417988,0.03107758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579227,0.0021135302,0.00016447988,0.00066308974,0.00079039723,0.00047618666],"domain_scores_gemma":[0.98533034,0.009727165,0.0005467918,0.0029702524,0.0007607585,0.00066464796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005861508,0.0006054683,0.0016315371,0.0011571236,0.0020437934,0.0013673154,0.0041009244,0.0023541902,0.03251282],"category_scores_gemma":[0.020677116,0.00057435216,0.0014060556,0.0014338681,0.0011451767,0.0036845533,0.0044859033,0.0016653262,0.0056091216],"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.0014178249,0.0014142907,0.0018903789,0.0004478412,0.00016333628,0.0001274967,0.0007513394,0.029816877,0.005997231,0.12009296,0.012526958,0.8253535],"study_design_scores_gemma":[0.0006064498,0.0018889002,0.0032941669,0.00015081081,0.00020000672,0.00033304663,0.00078487623,0.53719854,0.012585521,0.42404243,0.0188137,0.0001016485],"about_ca_topic_score_codex":0.00083098875,"about_ca_topic_score_gemma":0.0009898037,"teacher_disagreement_score":0.03251282,"about_ca_system_score_codex":0.00088686566,"about_ca_system_score_gemma":0.001307424,"threshold_uncertainty_score":0.1087662},"labels":[],"label_agreement":null},{"id":"W2731314496","doi":"","title":"Dual-Band Filter Using Quarter-Wavelength Resonators with Hybrid Feeding Structure","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Microwave Engineering and Waveguides","field":"Engineering","cited_by":1,"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":"Resonator; Filter (signal processing); Quarter (Canadian coin); Wavelength; Optics; Materials science; Band-pass filter; Optoelectronics; Physics; Engineering; Electrical engineering; Geography","score_opus":0.010036528598601739,"score_gpt":0.21034513378985045,"score_spread":0.2003086051912487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731314496","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.52948624,0.00090011745,0.44821063,0.00033837667,0.00037072276,0.00006090728,0.00017362011,0.00252059,0.01793887],"genre_scores_gemma":[0.70927894,0.00031801406,0.279765,0.00016095294,0.00014863527,0.0000704303,0.0001746701,0.00012067931,0.009962631],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966204,0.00005201324,0.000015485242,0.000108485976,0.00011326151,0.000048721853],"domain_scores_gemma":[0.99952817,0.000120024364,0.00009674721,0.00009020687,0.00012261103,0.00004222946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952258,0.00078930776,0.00086773455,0.0004972924,0.0004458674,0.0009043498,0.001413702,0.0014411714,0.0029001862],"category_scores_gemma":[0.00028710443,0.00050823984,0.00072841096,0.00040318238,0.00033900287,0.00096099725,0.00061454315,0.0004563381,0.0014434301],"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.000394738,0.00014022485,0.00051055616,0.00010570231,0.00007067637,0.00010695401,0.000054711585,0.0016091898,0.96876806,0.0042356537,0.00063972775,0.023363879],"study_design_scores_gemma":[0.00018402329,0.0010210201,0.0018973512,0.000031137497,0.0002043895,0.001080383,0.000054490014,0.12145645,0.85992104,0.001481631,0.0125725195,0.00009557159],"about_ca_topic_score_codex":0.00023545642,"about_ca_topic_score_gemma":0.0005897698,"teacher_disagreement_score":0.0029001862,"about_ca_system_score_codex":0.0005308722,"about_ca_system_score_gemma":0.00023197244,"threshold_uncertainty_score":0.009702086},"labels":[],"label_agreement":null},{"id":"W2731797971","doi":"10.1007/978-3-319-62389-4_6","title":"Constrained Routing Between Non-Visible Vertices","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Combinatorics; Equal-cost multi-path routing; Set (abstract data type); Line segment; Line (geometry); Routing table; Algorithm; Mathematics; Computer network; Artificial intelligence; Routing protocol","score_opus":0.03226791445916056,"score_gpt":0.2866327263484828,"score_spread":0.25436481188932225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731797971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026591659,0.00084746606,0.916011,0.00052199565,0.00042577562,0.00013136686,0.00087223377,0.0005349417,0.054063573],"genre_scores_gemma":[0.34333113,0.0027517527,0.5364249,0.00040927937,0.00018944615,0.00042663532,0.0018596654,0.0009447228,0.11366261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994641,0.000098412165,0.000025051804,0.00020302561,0.00012800367,0.000081524944],"domain_scores_gemma":[0.9991498,0.00037466234,0.00008468004,0.00020564036,0.00010403095,0.00008121216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998724,0.0013546016,0.00096804096,0.0006140387,0.0008346813,0.002008382,0.0027910515,0.0016769272,0.022808097],"category_scores_gemma":[0.0025636773,0.00091243203,0.00089292135,0.0013289422,0.000653723,0.0028989522,0.002030904,0.0022791266,0.0038609141],"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.00045694242,0.00013942942,0.00035504473,0.0011422868,0.000123057,0.0005209411,0.0001580313,0.35054907,0.020994518,0.38949534,0.021243734,0.21482159],"study_design_scores_gemma":[0.00006581551,0.00014679329,0.00036771136,0.00024736725,0.00008568649,0.00043261054,0.00014151532,0.51388454,0.015949339,0.41874146,0.04987455,0.0000625533],"about_ca_topic_score_codex":0.001305945,"about_ca_topic_score_gemma":0.0018998157,"teacher_disagreement_score":0.022808097,"about_ca_system_score_codex":0.00083057635,"about_ca_system_score_gemma":0.0008767767,"threshold_uncertainty_score":0.07630074},"labels":[],"label_agreement":null},{"id":"W2732122045","doi":"10.1007/978-3-319-63874-4_10","title":"Susceptibility of Graduate Assistants to Social Influence Persuasive Strategies","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Persuasion; Trustworthiness; Graduate students; Psychology; Social media; Medical education; Social psychology; Computer science; Pedagogy; World Wide Web; Medicine","score_opus":0.04542818443584075,"score_gpt":0.3492933103122586,"score_spread":0.30386512587641784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732122045","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.9948095,0.00015419727,0.00026291097,0.00008269381,0.00001996903,0.000020100098,0.000018364182,0.000017507373,0.004614726],"genre_scores_gemma":[0.99548715,0.00012616193,0.00022036485,0.00006514333,0.000020483347,0.000014814707,0.000037588332,0.0000068934946,0.0040212586],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99858224,0.0006024495,0.00008557036,0.00019449784,0.00036759907,0.00016765435],"domain_scores_gemma":[0.97736686,0.015631106,0.002385459,0.0013625198,0.0015006704,0.0017533366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018069494,0.00021322213,0.00026003242,0.0008435068,0.00070728903,0.0020940755,0.0003051624,0.00079853856,0.006461263],"category_scores_gemma":[0.027990844,0.0002017253,0.0002351495,0.00027121668,0.0003201691,0.00058855687,0.0007952281,0.00084724114,0.0012083108],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014322959,0.0023474211,0.710916,0.00015002282,0.00017336047,0.00054217764,0.030833663,0.0003912046,0.01028253,0.0022970848,0.0022785414,0.2383557],"study_design_scores_gemma":[0.00017395445,0.0037274307,0.92794746,0.00016196888,0.0002578251,0.0031271947,0.033833724,0.0043448317,0.007786925,0.005339624,0.01319783,0.00010112158],"about_ca_topic_score_codex":0.00080456724,"about_ca_topic_score_gemma":0.0008923264,"teacher_disagreement_score":0.006461263,"about_ca_system_score_codex":0.00021431543,"about_ca_system_score_gemma":0.00041795813,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2732737200","doi":"10.1007/978-3-319-62395-5_34","title":"A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Point (geometry); Distance matrix; Plane (geometry); Matrix (chemical analysis); Graph; Theoretical computer science; Mathematics; Geometry","score_opus":0.03860662644556757,"score_gpt":0.29401146796174155,"score_spread":0.255404841516174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732737200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012914751,0.00010534206,0.9960024,0.00006493521,0.000045876935,0.000034669647,0.000041324718,0.00029893077,0.0021150003],"genre_scores_gemma":[0.036517132,0.00035706826,0.9529276,0.00009844582,0.00014557454,0.00021713517,0.00028812521,0.0004000329,0.009048948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981026,0.0005073193,0.00009462984,0.00030772816,0.0008519009,0.00013582363],"domain_scores_gemma":[0.99741423,0.0013282541,0.00012898464,0.0005115014,0.0004793837,0.00013761097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001237539,0.0017237155,0.0016780739,0.0012600134,0.0008184856,0.0019177446,0.0036235133,0.0015950963,0.015718708],"category_scores_gemma":[0.0063588684,0.0010074116,0.0014443885,0.001994801,0.001395408,0.0026316592,0.0042419014,0.0048207915,0.0061305338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023360754,0.00028699794,0.0003049549,0.00035536918,0.00006576001,0.00009890443,0.00032086304,0.27526623,0.009002518,0.23431514,0.02170364,0.45804602],"study_design_scores_gemma":[0.000029462215,0.00009771458,0.0000895261,0.00002942243,0.000011877004,0.00008974228,0.000055800745,0.8717463,0.002670711,0.1157535,0.0093979,0.000028045986],"about_ca_topic_score_codex":0.0032877377,"about_ca_topic_score_gemma":0.003974472,"teacher_disagreement_score":0.015718708,"about_ca_system_score_codex":0.0010748197,"about_ca_system_score_gemma":0.0013304986,"threshold_uncertainty_score":0.05258429},"labels":[],"label_agreement":null},{"id":"W2732748639","doi":"10.1007/978-3-319-63874-4_17","title":"Making Interface Customizations Work: Lessons from a Successful Tailoring Community","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 Saskatchewan","funders":"","keywords":"Computer science; Personalization; Interface (matter); Point (geometry); User interface; Online community; Human–computer interaction; World Wide Web; Work (physics); Software; Scale (ratio); Collaborative filtering; Recommender system","score_opus":0.08682233518944915,"score_gpt":0.3580959267406903,"score_spread":0.27127359155124114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732748639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28314647,0.0025864085,0.56490266,0.013222858,0.0006616569,0.0008349897,0.0002695778,0.018020172,0.116355196],"genre_scores_gemma":[0.61350125,0.0018628301,0.32787386,0.0033612892,0.00029893342,0.00047038632,0.00073236314,0.010296261,0.041602958],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.989256,0.004328493,0.00052105245,0.0018006051,0.003362065,0.00073191535],"domain_scores_gemma":[0.90842724,0.041867238,0.0024659778,0.031544678,0.013406049,0.002288881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023395255,0.0012588744,0.00064831175,0.0024114822,0.003077824,0.00785477,0.0053397017,0.003754734,0.0068230242],"category_scores_gemma":[0.08112812,0.0008865045,0.0007987478,0.002444641,0.004486348,0.014838416,0.0061135083,0.005217343,0.00419046],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018355183,0.0009832972,0.0051181912,0.0002780239,0.00005214581,0.00032931965,0.022478838,0.0025308724,0.008200833,0.02176142,0.016883558,0.92119986],"study_design_scores_gemma":[0.00033800272,0.0012728297,0.013932212,0.002028734,0.00034240977,0.0021618933,0.03414483,0.06644157,0.07526764,0.27600664,0.52733517,0.00072820106],"about_ca_topic_score_codex":0.0033916477,"about_ca_topic_score_gemma":0.003925407,"teacher_disagreement_score":0.023395255,"about_ca_system_score_codex":0.0014527508,"about_ca_system_score_gemma":0.0032173267,"threshold_uncertainty_score":0.12372744},"labels":[],"label_agreement":null},{"id":"W2732848055","doi":"10.1007/978-3-319-62701-4_10","title":"Multivariate Time Series Representation and Similarity Search Using PCA","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dimensionality reduction; Computer science; Univariate; Principal component analysis; Pattern recognition (psychology); Cluster analysis; Curse of dimensionality; Data mining; Artificial intelligence; Preprocessor; Multivariate statistics; Similarity (geometry); Redundancy (engineering); Nearest neighbor search; Machine learning","score_opus":0.046150064866131484,"score_gpt":0.29467883843799336,"score_spread":0.24852877357186187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732848055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072989073,0.0003999572,0.99081475,0.00006641694,0.000053818352,0.000024801091,0.000067750094,0.00037948604,0.00089409493],"genre_scores_gemma":[0.24211793,0.0013891903,0.74813926,0.000079441925,0.00025123806,0.00018732746,0.00084120035,0.0002677318,0.006726664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994766,0.000118955584,0.0000415021,0.00014481928,0.00017760455,0.000040506155],"domain_scores_gemma":[0.9994543,0.00023328999,0.000054618322,0.000096334785,0.00013381483,0.00002765228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064340717,0.0006749324,0.0014124513,0.0015083244,0.00043044015,0.0012862079,0.0011265556,0.00088364724,0.0039155395],"category_scores_gemma":[0.0029286318,0.0004215373,0.0013813502,0.0036459402,0.00040170114,0.0016909239,0.0010837957,0.0012012349,0.0014657374],"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.00020637967,0.00014000712,0.0006964943,0.00026391857,0.00012833338,0.00015288104,0.00011306721,0.13688183,0.017674658,0.043042954,0.0055399933,0.7951595],"study_design_scores_gemma":[0.000006834308,0.00003827765,0.0004999129,0.000007365017,0.000018577557,0.00008849976,0.000021688627,0.98457474,0.002066996,0.01107912,0.001581138,0.00001675972],"about_ca_topic_score_codex":0.00201953,"about_ca_topic_score_gemma":0.0014638744,"teacher_disagreement_score":0.0039155395,"about_ca_system_score_codex":0.00030150384,"about_ca_system_score_gemma":0.0006079971,"threshold_uncertainty_score":0.013098836},"labels":[],"label_agreement":null},{"id":"W2734303680","doi":"10.1007/978-3-319-63874-4_5","title":"Susceptibility of Users to Social Influence Strategies and the Influence of Culture in a Q&amp;A Collaborative Learning Environment","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Expert finding and Q&A systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Collectivism; Computer science; Individualism; Order (exchange); Collaborative learning; Knowledge management; Structural equation modeling; Machine learning; Political science; Business","score_opus":0.015586475188283279,"score_gpt":0.2670525733358639,"score_spread":0.25146609814758064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734303680","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.9954079,0.0000629634,0.00040912585,0.00008486805,0.0000042041966,0.00001536172,0.000019280744,0.000013590702,0.0039827568],"genre_scores_gemma":[0.999281,0.00003121267,0.00015808633,0.0000209939,0.0000029863952,0.000008337905,0.000015090251,0.0000054816546,0.00047687662],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99735546,0.0014651053,0.0001621856,0.00020690745,0.000569448,0.00024081796],"domain_scores_gemma":[0.9395816,0.04911864,0.0045533115,0.0021378177,0.0021770871,0.0024315624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075662,0.00017900833,0.0002571008,0.0010146981,0.0010019782,0.003413603,0.00041930962,0.000796075,0.003301735],"category_scores_gemma":[0.040894877,0.0002074093,0.00022783858,0.0007229091,0.0007205266,0.0019259114,0.0011863806,0.00078689435,0.00042181008],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008783958,0.000836144,0.81439984,0.00012124872,0.00016562591,0.00037304574,0.077056825,0.0005831483,0.006260384,0.0030096762,0.00064025185,0.09567542],"study_design_scores_gemma":[0.000045457924,0.0008849401,0.9154722,0.00006559602,0.00016417196,0.00072553667,0.06513788,0.0067303116,0.0023449117,0.005479642,0.0028403336,0.00010901794],"about_ca_topic_score_codex":0.003257908,"about_ca_topic_score_gemma":0.0033239173,"teacher_disagreement_score":0.003413603,"about_ca_system_score_codex":0.00038699288,"about_ca_system_score_gemma":0.00047051033,"threshold_uncertainty_score":0.01626581},"labels":[],"label_agreement":null},{"id":"W2734640206","doi":"10.1007/978-3-319-61982-8_3","title":"Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robustness (evolution); Solver; Interpolation (computer graphics); Linear algebra; Numerical analysis; Implementation; Orthogonalization; Linear system; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.02253761667050196,"score_gpt":0.272529710113193,"score_spread":0.24999209344269102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734640206","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.029254356,0.0061756293,0.91983587,0.005502638,0.0023348392,0.00008185879,0.00010465336,0.0021222846,0.03458794],"genre_scores_gemma":[0.6465282,0.003203108,0.32166678,0.0012284032,0.0013498939,0.00010533611,0.00016528355,0.001006244,0.024746804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770653,0.0008244936,0.00015599691,0.00023202809,0.0009078066,0.00017304177],"domain_scores_gemma":[0.99125224,0.00418886,0.0005217614,0.0027053438,0.0010450291,0.00028681487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032510478,0.0010162232,0.001143235,0.00077398174,0.0008593574,0.0030728912,0.0024648588,0.0016952843,0.011191278],"category_scores_gemma":[0.030210465,0.00051756785,0.00066469336,0.0009925966,0.0030425221,0.004857233,0.0027909996,0.00363057,0.0018465803],"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.0005158126,0.00020416238,0.0011271612,0.0007993723,0.00010308636,0.000288737,0.0005041323,0.099052824,0.0047307615,0.59781367,0.014210059,0.28065023],"study_design_scores_gemma":[0.000049629387,0.00009753133,0.00025292224,0.00019702697,0.000033790184,0.00018365178,0.000115027884,0.27138197,0.005395348,0.7120441,0.010212378,0.000036530953],"about_ca_topic_score_codex":0.00040731425,"about_ca_topic_score_gemma":0.00057368795,"teacher_disagreement_score":0.011191278,"about_ca_system_score_codex":0.00053300854,"about_ca_system_score_gemma":0.0008836775,"threshold_uncertainty_score":0.03743857},"labels":[],"label_agreement":null},{"id":"W2734880499","doi":"10.1007/978-3-319-62398-6_27","title":"Quality of Experience for Personalized Sightseeing Tours: Studies and Proposition for an Evaluation Method","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diverse Aspects of Tourism Research","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":"Polytechnique Montréal","funders":"","keywords":"Tourism; Computer science; Proposition; Quality (philosophy); Measure (data warehouse); Sequence (biology); Data mining; Geography","score_opus":0.24229643873282805,"score_gpt":0.5149669515738177,"score_spread":0.27267051284098964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734880499","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.89239293,0.00298486,0.053120553,0.0005550499,0.000113105474,0.001551983,0.0010323386,0.000115699375,0.048133507],"genre_scores_gemma":[0.9799043,0.00042972044,0.016613796,0.000054349424,0.000024174058,0.00065524515,0.00024169181,0.000022018141,0.0020545784],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98746395,0.006193432,0.0008823262,0.0008067342,0.004236273,0.00041724215],"domain_scores_gemma":[0.9490979,0.036279507,0.0033490588,0.0022150446,0.007515108,0.0015434589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013943196,0.0004192107,0.0005710448,0.0025877638,0.00066663366,0.003590573,0.0009842663,0.0007883703,0.005723356],"category_scores_gemma":[0.040603124,0.00022682159,0.0012042538,0.0027228247,0.0013245499,0.0034098092,0.0019352636,0.00072816527,0.0003991231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030345055,0.0021917224,0.48062655,0.0036110005,0.001188202,0.00021468467,0.036820088,0.0027839378,0.0047674025,0.019263797,0.003084484,0.44241354],"study_design_scores_gemma":[0.00021620034,0.0069473204,0.88599426,0.0017689238,0.0018739499,0.0005145123,0.053629927,0.016624687,0.008573651,0.009429236,0.0141152125,0.0003120792],"about_ca_topic_score_codex":0.0026299548,"about_ca_topic_score_gemma":0.0036056393,"teacher_disagreement_score":0.013943196,"about_ca_system_score_codex":0.0023722674,"about_ca_system_score_gemma":0.001502767,"threshold_uncertainty_score":0.07373953},"labels":[],"label_agreement":null},{"id":"W2735995135","doi":"10.1007/978-3-319-67531-2_22","title":"Event Stream Processing with Multiple Threads","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Event (particle physics); Threading (protein sequence); Property (philosophy); Parallel computing; Extension (predicate logic); Stream processing; Simple (philosophy); Sample (material); Programming language","score_opus":0.01770193912692553,"score_gpt":0.2777150490051311,"score_spread":0.2600131098782056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735995135","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.06852867,0.00033109248,0.92475206,0.0002892432,0.00033248725,0.00012557425,0.00007160152,0.0032178552,0.0023513646],"genre_scores_gemma":[0.60189134,0.00017195608,0.390562,0.00014232783,0.00028381145,0.00014646356,0.00015951639,0.00026612513,0.0063764257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.00027910032,0.00015574812,0.00036814602,0.0004878349,0.00017988545],"domain_scores_gemma":[0.9970415,0.0010399088,0.00013610444,0.0008506423,0.0006443635,0.00028751438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844,0.0007535043,0.0011674272,0.0006135789,0.0008267546,0.0024890027,0.0012070886,0.0008416133,0.0041560326],"category_scores_gemma":[0.005844309,0.0006768581,0.0006133561,0.0008919575,0.0005567523,0.0016210852,0.0018577973,0.001469585,0.0007988251],"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.009654147,0.0010041788,0.009197181,0.00034088214,0.00051379664,0.0010304112,0.0007005032,0.1842309,0.13191676,0.039449584,0.010583059,0.6113786],"study_design_scores_gemma":[0.00026943308,0.00020361085,0.0004771665,0.000008705629,0.00005746291,0.00013259613,0.000037123387,0.9573971,0.024165781,0.014006039,0.00322358,0.000021427806],"about_ca_topic_score_codex":0.0018522781,"about_ca_topic_score_gemma":0.0020843938,"teacher_disagreement_score":0.0041560326,"about_ca_system_score_codex":0.0005228013,"about_ca_system_score_gemma":0.0011359027,"threshold_uncertainty_score":0.01390326},"labels":[],"label_agreement":null},{"id":"W2736532017","doi":"10.1007/978-3-319-62024-4_6","title":"Efficient Implementation of Ring-LWE Encryption on High-End IoT Platform","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Cryptography; Computation; Embedded system; Parallel computing; Computer network; Algorithm","score_opus":0.0237106971154101,"score_gpt":0.29723984714986695,"score_spread":0.2735291500344569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736532017","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.126585,0.0013236529,0.83193296,0.00048607012,0.00042665596,0.00031882134,0.00039957286,0.0041849925,0.03434226],"genre_scores_gemma":[0.8326851,0.00041421098,0.14873102,0.00017344617,0.000094635114,0.00014028775,0.0005832141,0.00018758618,0.016990552],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994099,0.00007724092,0.00005034452,0.00007248823,0.00022816492,0.00016184208],"domain_scores_gemma":[0.99967206,0.000048772832,0.000026155732,0.00015670214,0.00007955787,0.000016810074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040578377,0.00047928127,0.0005509928,0.0003920345,0.0005543034,0.0011934516,0.00088007905,0.0004992285,0.0075707175],"category_scores_gemma":[0.00057108485,0.0002438196,0.00049282174,0.00032468865,0.000297771,0.0020332423,0.0010866775,0.0007631643,0.0025920235],"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.001564053,0.00042235877,0.0020302862,0.0008787016,0.00020384106,0.001188499,0.0003966339,0.03726548,0.36369753,0.21644905,0.02007353,0.35582998],"study_design_scores_gemma":[0.00025167136,0.0011213205,0.0018298354,0.0001450784,0.00018917477,0.0024882057,0.00021614906,0.3839523,0.47223485,0.0730411,0.06438534,0.00014487101],"about_ca_topic_score_codex":0.00015813648,"about_ca_topic_score_gemma":0.0003056329,"teacher_disagreement_score":0.0075707175,"about_ca_system_score_codex":0.00039480926,"about_ca_system_score_gemma":0.0005062543,"threshold_uncertainty_score":0.02532655},"labels":[],"label_agreement":null},{"id":"W2736549445","doi":"10.1007/978-3-319-62809-7_21","title":"Relative Prefix Distance Between Languages","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Prefix; Decidability; Computer science; Context (archaeology); Word (group theory); Context-free language; Regular language; Combinatorics; Discrete mathematics; Mathematics; Theoretical computer science; Rule-based machine translation; Artificial intelligence; Linguistics; Automaton; Geometry","score_opus":0.01644346720488384,"score_gpt":0.2641630324598084,"score_spread":0.24771956525492453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736549445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12363063,0.0035424575,0.67069554,0.002208274,0.0007131455,0.00012471525,0.001460494,0.001191183,0.19643347],"genre_scores_gemma":[0.67846686,0.0029998987,0.22782607,0.00090804335,0.0009792929,0.00032599276,0.0035178594,0.0008857254,0.08409024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769187,0.00043911583,0.00019125114,0.0007662882,0.0007349775,0.00017651154],"domain_scores_gemma":[0.996424,0.001829469,0.00022270114,0.00070248084,0.00056993816,0.00025134473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094435,0.00053091167,0.00089210883,0.00215448,0.0015350312,0.0042512026,0.0012971435,0.0013202124,0.013762396],"category_scores_gemma":[0.00577866,0.00059958926,0.0007956988,0.0029422727,0.0026040967,0.011669712,0.00387131,0.0037707589,0.0037595439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050495968,0.000012064293,0.00011481486,0.00007907329,0.0000081953085,0.000042666357,0.0003049822,0.00088597037,0.0014524835,0.969871,0.0013649948,0.025813442],"study_design_scores_gemma":[0.000005491127,0.000024308018,0.00010775499,0.00002741189,0.000008987906,0.00014761645,0.00008479123,0.0024353466,0.0014131045,0.9780899,0.017644638,0.000010579318],"about_ca_topic_score_codex":0.0002860536,"about_ca_topic_score_gemma":0.00022968074,"teacher_disagreement_score":0.013762396,"about_ca_system_score_codex":0.0013698615,"about_ca_system_score_gemma":0.0007920955,"threshold_uncertainty_score":0.04603976},"labels":[],"label_agreement":null},{"id":"W2736648315","doi":"10.1007/978-3-319-62033-6_19","title":"Red Button and Yellow Button: Usable Security for Lost Security Tokens","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Security token; Computer science; Usability; Computer security; USable; ALARM; Dilemma; World Wide Web; Human–computer interaction; Engineering","score_opus":0.020537707799450737,"score_gpt":0.25913408494327483,"score_spread":0.2385963771438241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736648315","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.008694077,0.005728181,0.2776496,0.0051493635,0.009153594,0.00025490028,0.0016649454,0.033976045,0.6577293],"genre_scores_gemma":[0.055447824,0.0025580917,0.025859136,0.0014422183,0.0005640531,0.00015987737,0.0006890666,0.0060554417,0.9072243],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967754,0.00004377232,0.000011880357,0.000051917505,0.00015499393,0.000059807197],"domain_scores_gemma":[0.9994936,0.00014084796,0.000024363899,0.00015419941,0.000120951285,0.00006606336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045255132,0.0012068575,0.00045463193,0.00089148723,0.0009931987,0.003023688,0.0015273758,0.0015778758,0.21289189],"category_scores_gemma":[0.0015526932,0.00045550233,0.0005597883,0.0005677744,0.0010446341,0.00569931,0.0022230684,0.0019896065,0.09225851],"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.0002992921,0.00005313023,0.00014724111,0.00041932787,0.000013188723,0.0004652463,0.0007346071,0.00043575492,0.014142764,0.10415066,0.6271136,0.25202528],"study_design_scores_gemma":[0.000022981283,0.00005208566,0.00020269532,0.0002154894,0.000019297113,0.00069930416,0.00021539674,0.0010989116,0.009371084,0.021312471,0.96675324,0.000036961537],"about_ca_topic_score_codex":0.0004829876,"about_ca_topic_score_gemma":0.00054369814,"teacher_disagreement_score":0.21289189,"about_ca_system_score_codex":0.00050289655,"about_ca_system_score_gemma":0.0004922445,"threshold_uncertainty_score":0.7121943},"labels":[],"label_agreement":null},{"id":"W2736789027","doi":"10.1007/978-3-319-66185-8_67","title":"UV Exposed Optical Fibers with Frequency Domain Reflectometry for Device Tracking in Intra-arterial Procedures","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Optical Coherence Tomography Applications","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":"Centre Hospitalier de l’Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Reflectometry; Tracking (education); Optical fiber; Materials science; Biomedical engineering; Optics; Computer science; Fiber; Computer vision; Time domain; Physics; Medicine; Composite material","score_opus":0.0199529838341689,"score_gpt":0.28793288793082333,"score_spread":0.26797990409665445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736789027","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.77091235,0.013090768,0.20907843,0.00032102232,0.00030980716,0.00010798961,0.00017970474,0.00079170975,0.0052082674],"genre_scores_gemma":[0.91978294,0.003635455,0.072788745,0.00018792004,0.00011516083,0.00004957797,0.00008398968,0.0001647642,0.0031915256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993562,0.00024632184,0.000023761473,0.00016277649,0.00016477992,0.000046247027],"domain_scores_gemma":[0.999213,0.00034630066,0.00019047146,0.00012033029,0.00010441853,0.000025402926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006207198,0.00047597178,0.00029098752,0.00042039866,0.00033675355,0.00084431656,0.00046054684,0.00085399277,0.00178985],"category_scores_gemma":[0.0012733338,0.00040467374,0.00037184192,0.0003193217,0.0004592702,0.0008890248,0.00053317443,0.0006657848,0.0005477716],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094710686,0.00014597869,0.0042645787,0.00032591252,0.000058542493,0.0002066277,0.00021899957,0.0015618415,0.92142993,0.00046901737,0.0003823522,0.0699891],"study_design_scores_gemma":[0.000026368774,0.0009762185,0.009110537,0.00008782059,0.0001907852,0.0011448853,0.00012299002,0.0130742155,0.971333,0.00036293827,0.0035172,0.00005292803],"about_ca_topic_score_codex":0.00033156775,"about_ca_topic_score_gemma":0.00070035463,"teacher_disagreement_score":0.00178985,"about_ca_system_score_codex":0.00022754226,"about_ca_system_score_gemma":0.00027743253,"threshold_uncertainty_score":0.0059875846},"labels":[],"label_agreement":null},{"id":"W2736889863","doi":"10.1007/978-3-319-62033-6","title":"Security Protocols XXIV","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.023256239262254827,"score_gpt":0.3227825492229582,"score_spread":0.29952630996070334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736889863","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001630076,0.035246562,0.147381,0.0029198448,0.0055030654,0.0002745271,0.0013533809,0.0036834183,0.80200815],"genre_scores_gemma":[0.012113318,0.029435763,0.021020908,0.00082430075,0.0023767338,0.00034050096,0.0023268936,0.0012622173,0.93029934],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876726,0.00014359002,0.000054360262,0.0001632494,0.00078432454,0.00008719214],"domain_scores_gemma":[0.99940264,0.00014952414,0.00003006554,0.00019402914,0.0001804426,0.00004324036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070190814,0.0020925973,0.0010396582,0.002368606,0.0012529477,0.0038216196,0.0011799167,0.0011851946,0.092853345],"category_scores_gemma":[0.0015871978,0.0010175238,0.00070468563,0.0028049562,0.0015522697,0.004761579,0.0025727665,0.0043537477,0.101023264],"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.000038094455,0.00007939825,0.00009914516,0.0005300513,0.000018612984,0.000055293745,0.0002325594,0.0014017657,0.0019689992,0.19989492,0.36515725,0.43052393],"study_design_scores_gemma":[0.000010996262,0.000023639343,0.00014899005,0.00034071997,0.000011466201,0.00017435988,0.00005251494,0.0017921774,0.0014927323,0.09468645,0.9012504,0.000015470596],"about_ca_topic_score_codex":0.00093408464,"about_ca_topic_score_gemma":0.0011691327,"teacher_disagreement_score":0.092853345,"about_ca_system_score_codex":0.0020191446,"about_ca_system_score_gemma":0.00188049,"threshold_uncertainty_score":0.31062537},"labels":[],"label_agreement":null},{"id":"W2737082674","doi":"10.1007/978-3-319-64483-7_5","title":"Iron Mask: Trust-Preserving Anonymity on the Face of Stigmatization in Social Networking Sites","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Alberta","funders":"","keywords":"Credibility; Computer science; Anonymity; Identifier; Pseudonym; Internet privacy; Reputation; Identification (biology); Social media; Identity (music); Masking (illustration); Computer security; Information retrieval; World Wide Web; Computer network","score_opus":0.04635075197812122,"score_gpt":0.27931138502301295,"score_spread":0.23296063304489173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737082674","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10593761,0.0029329902,0.70205563,0.01832592,0.002105284,0.0003782373,0.0007902532,0.0041013677,0.16337274],"genre_scores_gemma":[0.87840235,0.001182423,0.06541376,0.0010109957,0.00061480905,0.00018053058,0.00034199408,0.0004289626,0.052424338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699783,0.0011222761,0.000088326735,0.00029137274,0.0011072829,0.00039294927],"domain_scores_gemma":[0.9935998,0.0030452767,0.00046070377,0.0020405012,0.00045552058,0.0003981177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026551697,0.00063775654,0.00077549776,0.0006327022,0.0031245395,0.0048372196,0.0022859601,0.003171804,0.011533944],"category_scores_gemma":[0.01322856,0.00044867856,0.00065058825,0.00080258434,0.0042178906,0.012169196,0.008822798,0.0038628865,0.002890165],"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.0005059898,0.00012358588,0.00096725294,0.00028527284,0.00005060475,0.0007219237,0.003260879,0.01117176,0.0045313663,0.78906024,0.038999353,0.15032186],"study_design_scores_gemma":[0.000049474504,0.000116783456,0.0004092424,0.000108940025,0.000046467292,0.00074193825,0.0012219336,0.061200738,0.006364138,0.8770944,0.052572746,0.000073174735],"about_ca_topic_score_codex":0.0009542833,"about_ca_topic_score_gemma":0.0010110143,"teacher_disagreement_score":0.011533944,"about_ca_system_score_codex":0.0011953566,"about_ca_system_score_gemma":0.00180451,"threshold_uncertainty_score":0.038584888},"labels":[],"label_agreement":null},{"id":"W2737119926","doi":"10.1007/978-3-319-67558-9_17","title":"Transitioning Between Convolutional and Fully Connected Layers in Neural Networks","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Pooling; Convolutional neural network; Computer science; Artificial intelligence; Class (philosophy); Pattern recognition (psychology); Digital pathology; Computer vision","score_opus":0.02106876533934275,"score_gpt":0.2667063455484795,"score_spread":0.24563758020913673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737119926","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.12828438,0.0025075413,0.8598025,0.0010426901,0.00034866956,0.00008456251,0.0004676227,0.0024056113,0.005056417],"genre_scores_gemma":[0.8874874,0.0005300942,0.10491214,0.00023360332,0.00007817272,0.00007877231,0.0005064549,0.00020357103,0.005969817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961406,0.00009298465,0.000025736555,0.00013155148,0.000058754402,0.00007691954],"domain_scores_gemma":[0.9984707,0.0008848013,0.000086390806,0.00024269187,0.00021909666,0.000096241725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010786266,0.00061265414,0.0006277667,0.00036636702,0.00033901483,0.000987337,0.0017882481,0.0014045754,0.0041228756],"category_scores_gemma":[0.005471986,0.00067191373,0.00058785634,0.00038279078,0.0006342696,0.0028324837,0.0014459251,0.0022445119,0.00064372394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014033469,0.00026514207,0.002686514,0.0003500605,0.00013972499,0.0001639913,0.00022853243,0.4689477,0.013908847,0.037068952,0.006294111,0.46854302],"study_design_scores_gemma":[0.000015509155,0.00006759181,0.00035680158,0.000029337438,0.000023027087,0.000024179937,0.000013707002,0.9693825,0.0041974797,0.025025383,0.00085474417,0.000009665423],"about_ca_topic_score_codex":0.0048377453,"about_ca_topic_score_gemma":0.007559337,"teacher_disagreement_score":0.0048377453,"about_ca_system_score_codex":0.0008718661,"about_ca_system_score_gemma":0.00094176765,"threshold_uncertainty_score":0.013792396},"labels":[],"label_agreement":null},{"id":"W2737371798","doi":"10.1007/978-3-319-63121-9_6","title":"Bicategories of Markov Processes","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McGill University","funders":"","keywords":"Markov chain; Morphism; Computer science; Construct (python library); Markov process; Continuous-time Markov chain; Theoretical computer science; Probabilistic logic; Markov property; Examples of Markov chains; Markov kernel; Algebra over a field; Variable-order Markov model; Discrete mathematics; Markov model; Mathematics; Pure mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.03005402368765252,"score_gpt":0.2903962621706746,"score_spread":0.26034223848302207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737371798","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.09187953,0.014581806,0.28450704,0.0025461381,0.0010750651,0.000100172976,0.0013202089,0.0007731458,0.60321695],"genre_scores_gemma":[0.81565857,0.006196979,0.04762696,0.0009608601,0.001260471,0.00034119532,0.0016433997,0.00052662735,0.12578493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908626,0.00024541482,0.000059435544,0.00015745615,0.00032902608,0.00012230742],"domain_scores_gemma":[0.99905676,0.0003920345,0.000082610284,0.00011073966,0.00023163877,0.00012621286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006518184,0.0007375031,0.00087657454,0.0034409268,0.0016374859,0.003973649,0.00080310577,0.0007446262,0.009576461],"category_scores_gemma":[0.0016162774,0.0006321293,0.00085548405,0.0022315385,0.0027200617,0.0038124016,0.0023503343,0.0024291489,0.0020077683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004485385,0.0000016457512,0.000021095933,0.000013592362,0.0000016149451,0.0000069150356,0.00006776971,0.00009618901,0.00008708303,0.9971685,0.00052624836,0.0020049126],"study_design_scores_gemma":[0.0000021449132,0.000003896149,0.00007552489,0.000014543142,0.0000033521333,0.00003874419,0.000048900052,0.0006158574,0.00010331115,0.98789793,0.011190698,0.0000050512026],"about_ca_topic_score_codex":0.001680749,"about_ca_topic_score_gemma":0.0011697776,"teacher_disagreement_score":0.009576461,"about_ca_system_score_codex":0.0020562569,"about_ca_system_score_gemma":0.00090243807,"threshold_uncertainty_score":0.032036483},"labels":[],"label_agreement":null},{"id":"W2737377639","doi":"10.1007/978-3-319-64798-2_4","title":"Team Formation Through Preference-Based Behavior Composition","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robustness (evolution); Ranking (information retrieval); Property (philosophy); Preference; Domain (mathematical analysis); Team composition; Mathematical optimization; Artificial intelligence; Range (aeronautics); Mathematics; Knowledge management","score_opus":0.061448171282911856,"score_gpt":0.2769671707561291,"score_spread":0.21551899947321723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737377639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021551212,0.000044921748,0.9719391,0.00009757662,0.000034533015,0.0001185331,0.000027686312,0.00026631265,0.0059201876],"genre_scores_gemma":[0.62297213,0.00012458804,0.36641443,0.000072939154,0.000038601836,0.00043055,0.00016043408,0.00014215028,0.009644225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823195,0.00073517405,0.000096365184,0.00030298094,0.00046916716,0.00016433623],"domain_scores_gemma":[0.99731135,0.0012587463,0.0002075291,0.00047055067,0.0004934438,0.0002584609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019665004,0.00065334555,0.00095595175,0.00070529635,0.0010801026,0.0012468612,0.0017357657,0.00066693424,0.005164986],"category_scores_gemma":[0.0064421115,0.0005731644,0.0008713133,0.0008962589,0.00093239744,0.0018762399,0.0023676406,0.0011945673,0.001069299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006206305,0.0005760623,0.002052591,0.00034934547,0.00029619483,0.00028885185,0.0012153604,0.37586707,0.031481337,0.22847271,0.0057906616,0.3529892],"study_design_scores_gemma":[0.000051416362,0.00010245062,0.00032273895,0.000015283911,0.000039397597,0.00007298134,0.00013876276,0.90647554,0.0046001505,0.086499274,0.0016585158,0.000023461727],"about_ca_topic_score_codex":0.0014325511,"about_ca_topic_score_gemma":0.001947757,"teacher_disagreement_score":0.005164986,"about_ca_system_score_codex":0.0005988651,"about_ca_system_score_gemma":0.001018498,"threshold_uncertainty_score":0.017278612},"labels":[],"label_agreement":null},{"id":"W2737383490","doi":"10.1007/978-3-319-71147-8_11","title":"A New Graph Parameter to Measure Linearity","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Discrete mathematics; Sigma; Conjecture; Vertex (graph theory); Bipartite graph; Graph","score_opus":0.045763194477085434,"score_gpt":0.3095016994705648,"score_spread":0.26373850499347934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737383490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03456544,0.002996006,0.8309298,0.0037295804,0.0027238107,0.0001314321,0.00043369434,0.001565499,0.12292478],"genre_scores_gemma":[0.60958064,0.0029555066,0.2927288,0.0045230873,0.0056504384,0.0006394795,0.0007066939,0.0033591213,0.079856254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737585,0.0008840756,0.00015315985,0.0008288169,0.00057745725,0.00018062517],"domain_scores_gemma":[0.99574584,0.0017941174,0.00040229017,0.0010233199,0.0006089568,0.0004255128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020787655,0.001292591,0.0014851876,0.004876325,0.0021136748,0.0037008354,0.0022480267,0.0025598588,0.011149438],"category_scores_gemma":[0.007437938,0.0006953567,0.0012947848,0.00326475,0.0067132683,0.013017678,0.004711578,0.0057666483,0.0028315561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015893247,0.000015109662,0.0001001838,0.000056999943,0.000008532548,0.000020276679,0.00011831756,0.00050688896,0.0013893197,0.98271024,0.0021485363,0.0129097225],"study_design_scores_gemma":[0.000009171104,0.00004796304,0.00024043993,0.00003985619,0.000022551156,0.00019421903,0.000105085914,0.0064161085,0.0019816207,0.9699009,0.02100129,0.00004073996],"about_ca_topic_score_codex":0.00041385015,"about_ca_topic_score_gemma":0.0003905964,"teacher_disagreement_score":0.011149438,"about_ca_system_score_codex":0.0023456663,"about_ca_system_score_gemma":0.0006045661,"threshold_uncertainty_score":0.03729856},"labels":[],"label_agreement":null},{"id":"W2737619095","doi":"10.1007/978-3-642-32208-2_8","title":"Deciding Whether a Regular Language Is Generated by a Splicing System","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Computer science; Programming language; Theoretical computer science; Natural language processing","score_opus":0.011365670235612392,"score_gpt":0.2351745338984587,"score_spread":0.2238088636628463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737619095","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.68381727,0.00014202828,0.29039857,0.0024966365,0.00028774378,0.00021710533,0.0009597993,0.0033158723,0.018364944],"genre_scores_gemma":[0.88530195,0.0000956628,0.10786423,0.00036577188,0.00014041486,0.000076451746,0.0017777386,0.00042429008,0.003953515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997359,0.0006091345,0.0002796863,0.000799787,0.0005547674,0.0003976926],"domain_scores_gemma":[0.98535687,0.011964859,0.0005356219,0.0007425442,0.0009367559,0.00046333016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027445378,0.00044285777,0.0007737377,0.00058131624,0.0010276375,0.00309205,0.0016226125,0.0017935358,0.0044814823],"category_scores_gemma":[0.008858259,0.00082085107,0.0018427708,0.0005183507,0.0026697095,0.005138241,0.0013877539,0.0024388141,0.0012111957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046986416,0.00078454136,0.028564796,0.0016062357,0.0005372023,0.006244083,0.0035795902,0.04582033,0.20802283,0.44493148,0.021469433,0.23374084],"study_design_scores_gemma":[0.00030494257,0.0005090664,0.003209405,0.00010119675,0.00026329065,0.0018019679,0.0013377374,0.14826748,0.10383663,0.7322749,0.007949196,0.00014410415],"about_ca_topic_score_codex":0.00070868776,"about_ca_topic_score_gemma":0.0010475882,"teacher_disagreement_score":0.0044814823,"about_ca_system_score_codex":0.00062821223,"about_ca_system_score_gemma":0.0013543423,"threshold_uncertainty_score":0.014992118},"labels":[],"label_agreement":null},{"id":"W2737785089","doi":"10.1007/978-3-319-63194-3_12","title":"Towards Continuous Certification of Clinical Information Systems","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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 Ottawa; University of Victoria","funders":"","keywords":"Computer science; Certification; Information system; Software engineering; Management; Electrical engineering","score_opus":0.11485868304193504,"score_gpt":0.4473421316362228,"score_spread":0.33248344859428774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737785089","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.02487279,0.0080738515,0.722529,0.036340363,0.003129023,0.0005111849,0.00027430605,0.0028874956,0.20138189],"genre_scores_gemma":[0.27829006,0.006004064,0.5988459,0.0031618094,0.00090289325,0.00022362523,0.0010673652,0.00064612087,0.11085816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9857648,0.004812946,0.0007748213,0.0012665273,0.0063580195,0.0010228388],"domain_scores_gemma":[0.949905,0.01441706,0.0022601348,0.008182582,0.021752695,0.003482604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021541188,0.0004531425,0.0003739938,0.0023852524,0.0012914465,0.009943218,0.002852963,0.0030455552,0.01080708],"category_scores_gemma":[0.04974293,0.00068170135,0.0005095211,0.0021666577,0.0026990396,0.010514178,0.0073987055,0.006156597,0.00504658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031913012,0.00022105443,0.00243133,0.00028522938,0.000010779381,0.00011877335,0.0011341184,0.0020779357,0.0024366793,0.20566368,0.052003738,0.73358476],"study_design_scores_gemma":[0.00005663101,0.00031240526,0.00811723,0.0025986035,0.000029547416,0.0006991432,0.0025369623,0.046016328,0.011263404,0.30771542,0.6205576,0.00009675335],"about_ca_topic_score_codex":0.0047318395,"about_ca_topic_score_gemma":0.006654272,"teacher_disagreement_score":0.021541188,"about_ca_system_score_codex":0.0032754024,"about_ca_system_score_gemma":0.01456962,"threshold_uncertainty_score":0.11392206},"labels":[],"label_agreement":null},{"id":"W2737877076","doi":"10.1007/978-3-319-62033-6_13","title":"Exploiting Autocorrect to Attack Privacy","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer security; User information; Internet privacy; Information sensitivity; World Wide Web; Information system","score_opus":0.03461131855047556,"score_gpt":0.2833043586117184,"score_spread":0.24869304006124282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737877076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050111473,0.0005928101,0.92209136,0.00109659,0.00017047254,0.000042528613,0.000068847585,0.000673075,0.025152914],"genre_scores_gemma":[0.9506859,0.00052946364,0.039627578,0.00038547706,0.00018394669,0.00004777978,0.00007995032,0.00019955117,0.008260346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962458,0.0015312171,0.00012589054,0.00046248123,0.0011440703,0.00049058115],"domain_scores_gemma":[0.983042,0.009565711,0.00076162885,0.0057434565,0.00058977783,0.00029738958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003116599,0.00071891956,0.0009204873,0.00078462705,0.0008510566,0.0028601263,0.0011603666,0.0016928794,0.0033718722],"category_scores_gemma":[0.018845133,0.0006150798,0.0010009692,0.0011738244,0.003138957,0.0042700525,0.0051246993,0.004114044,0.00083246053],"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.00016485043,0.000042835658,0.00090395263,0.000046367524,0.000044040742,0.00021369557,0.00021082077,0.043208223,0.004301156,0.9012409,0.0024374784,0.047185604],"study_design_scores_gemma":[0.000016407368,0.000037915208,0.00017423937,0.000018838178,0.000020303181,0.00027646092,0.000033707885,0.2504227,0.0034903537,0.74115545,0.004334488,0.0000191321],"about_ca_topic_score_codex":0.00036252406,"about_ca_topic_score_gemma":0.00030585006,"teacher_disagreement_score":0.0033718722,"about_ca_system_score_codex":0.0012230369,"about_ca_system_score_gemma":0.00082321704,"threshold_uncertainty_score":0.016482294},"labels":[],"label_agreement":null},{"id":"W2738263528","doi":"10.1007/978-3-319-64701-2_14","title":"DNA-Droid: A Real-Time Android Ransomware Detection Framework","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Ransomware; Computer science; Malware; Android (operating system); False positive paradox; Mobile malware; Computer security; Artificial intelligence; Operating system","score_opus":0.01080483484372049,"score_gpt":0.2564458826776019,"score_spread":0.24564104783388138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738263528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019089831,0.0016234601,0.80643624,0.0001640298,0.00043979954,0.00038857953,0.0008233159,0.16236174,0.00867304],"genre_scores_gemma":[0.23094098,0.0009951947,0.7288115,0.00073065725,0.00017991576,0.00046744052,0.0034118493,0.0068394355,0.02762303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.000053616346,0.000030332465,0.00012379441,0.00036905208,0.00008303059],"domain_scores_gemma":[0.99966455,0.00008886511,0.00004179647,0.00007692629,0.00008926738,0.00003859942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044727963,0.0014594725,0.001223908,0.0014302037,0.0004377703,0.0009769785,0.0019593663,0.0013850426,0.011792783],"category_scores_gemma":[0.0013060693,0.0008542902,0.0007281372,0.0003800151,0.00033948233,0.0012817065,0.0017947834,0.0012003296,0.00827202],"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.0007609265,0.00021789706,0.002180641,0.0004923997,0.00017001735,0.0005381339,0.00027411594,0.011135845,0.12854241,0.009211102,0.061076917,0.7853997],"study_design_scores_gemma":[0.000164509,0.0005356243,0.002576453,0.00017918475,0.0001177305,0.002138043,0.00011237974,0.71487105,0.17119001,0.008074025,0.09974028,0.00030069606],"about_ca_topic_score_codex":0.0013413075,"about_ca_topic_score_gemma":0.002314876,"teacher_disagreement_score":0.011792783,"about_ca_system_score_codex":0.00033763418,"about_ca_system_score_gemma":0.0005514454,"threshold_uncertainty_score":0.039450765},"labels":[],"label_agreement":null},{"id":"W2738927942","doi":"10.1007/978-3-319-64367-0_9","title":"Towards Spatially- and Category-Wise k-Diverse Nearest Neighbors Queries","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Skyline; Leverage (statistics); k-nearest neighbors algorithm; Set (abstract data type); Point (geometry); Information retrieval; Variation (astronomy); Data mining; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02146954906912258,"score_gpt":0.24705711732411095,"score_spread":0.22558756825498838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738927942","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.058127802,0.0022586428,0.9276413,0.0010358813,0.00023159059,0.00018534508,0.0017332328,0.0020147525,0.0067713903],"genre_scores_gemma":[0.47198507,0.0010472259,0.50969166,0.0006982791,0.0004011775,0.00020930292,0.007568621,0.00047899908,0.007919715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343324,0.0014129054,0.0005054289,0.0013991339,0.002651676,0.000597551],"domain_scores_gemma":[0.98955065,0.0047865706,0.00045601677,0.0023787688,0.0024237966,0.00040415552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030929733,0.0012655696,0.0044313767,0.0026688576,0.0021133972,0.004510302,0.005879067,0.0038710416,0.0038685382],"category_scores_gemma":[0.022052577,0.00092412706,0.0015942962,0.0064769033,0.0015043726,0.008075253,0.009826918,0.0022401144,0.0025359953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019472222,0.0007741681,0.008586309,0.0009921829,0.00033716141,0.00061682996,0.0015793031,0.24346246,0.02154991,0.13926576,0.043756906,0.53713185],"study_design_scores_gemma":[0.00006019176,0.00010800278,0.00056635303,0.00004421225,0.00003875144,0.0004119473,0.0006316465,0.84753376,0.003218239,0.14242537,0.0049194414,0.00004205045],"about_ca_topic_score_codex":0.0057641747,"about_ca_topic_score_gemma":0.009119578,"teacher_disagreement_score":0.005879067,"about_ca_system_score_codex":0.0017135417,"about_ca_system_score_gemma":0.0017734735,"threshold_uncertainty_score":0.016357422},"labels":[],"label_agreement":null},{"id":"W2739457930","doi":"10.1007/978-3-319-63558-3_22","title":"Mining Schema Knowledge from Linked Data on the Web","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Computer science; Exploit; Schema (genetic algorithms); Linked data; Information retrieval; Cluster analysis; Knowledge extraction; Reuse; Data mining; Semantic Web; World Wide Web; Data science; Artificial intelligence","score_opus":0.08552617274203135,"score_gpt":0.3032911664725141,"score_spread":0.21776499373048275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739457930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11528167,0.0075959754,0.8485954,0.0021479228,0.00028165,0.0006637976,0.010331417,0.004860731,0.010241446],"genre_scores_gemma":[0.21984543,0.00837866,0.72560906,0.00044048135,0.00016065226,0.00031636702,0.040684015,0.00056777743,0.0039975364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750334,0.00044805845,0.0003382397,0.00047902027,0.001103838,0.00012757945],"domain_scores_gemma":[0.9959096,0.0024177174,0.0003440266,0.00077742344,0.00042137556,0.00012984574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020784906,0.000909237,0.0011124451,0.011362127,0.0011325394,0.0058891336,0.0019988841,0.0015464931,0.0025109448],"category_scores_gemma":[0.01279971,0.0009699298,0.002320145,0.01254863,0.0010767617,0.010513271,0.0040449505,0.0020586692,0.001425976],"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.00019183416,0.0006062386,0.016828459,0.0019727952,0.0009638785,0.0026054974,0.0023548338,0.025534783,0.010498942,0.060162112,0.01978269,0.8584979],"study_design_scores_gemma":[0.0000768032,0.00012642062,0.009375274,0.0018311017,0.00090140424,0.0025729334,0.0038149646,0.36378652,0.03249239,0.48587,0.09901335,0.00013876791],"about_ca_topic_score_codex":0.0029838204,"about_ca_topic_score_gemma":0.0053866594,"teacher_disagreement_score":0.011362127,"about_ca_system_score_codex":0.0009506194,"about_ca_system_score_gemma":0.0019715785,"threshold_uncertainty_score":0.010992229},"labels":[],"label_agreement":null},{"id":"W2740692692","doi":"10.1007/978-3-319-64203-1_7","title":"NVIDIA Jetson Platform Characterization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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 British Columbia","funders":"","keywords":"Computer science; Central processing unit; Frequency scaling; Multi-core processor; Scaling; Floating point; Multiplication (music); Matrix multiplication; Parallel computing; Power (physics); Reduction (mathematics); ARM architecture; Embedded system; Operating system","score_opus":0.024061243784927105,"score_gpt":0.2603455689629966,"score_spread":0.2362843251780695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740692692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13520928,0.002113503,0.47552034,0.0011548968,0.001197422,0.0008795628,0.012669553,0.026958518,0.3442969],"genre_scores_gemma":[0.5596096,0.0020219304,0.23975363,0.00075010036,0.00017095641,0.0011323958,0.031880397,0.013101525,0.15157944],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999549,0.00002549592,0.0000253467,0.0000524998,0.00026928633,0.00007835992],"domain_scores_gemma":[0.9990206,0.00009101946,0.000049349324,0.00013532092,0.0006538968,0.000049855244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004027153,0.001035397,0.00034340165,0.0011134953,0.0006872169,0.0014742911,0.0008829458,0.00037533572,0.034756616],"category_scores_gemma":[0.0019277178,0.0003603768,0.00027659268,0.0008444529,0.00021067224,0.001512126,0.00083731214,0.00070407847,0.008248591],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076043175,0.00023793937,0.005254097,0.0010349118,0.000056324487,0.00079576485,0.0004588033,0.041100875,0.11805204,0.039084285,0.31123328,0.48193118],"study_design_scores_gemma":[0.00006294567,0.00020750817,0.0064088386,0.00029827736,0.000058171114,0.0010331334,0.00041985497,0.24395105,0.20244198,0.010668908,0.53431755,0.00013175742],"about_ca_topic_score_codex":0.004155267,"about_ca_topic_score_gemma":0.006521201,"teacher_disagreement_score":0.034756616,"about_ca_system_score_codex":0.00051905296,"about_ca_system_score_gemma":0.0013205708,"threshold_uncertainty_score":0.11627251},"labels":[],"label_agreement":null},{"id":"W2740854940","doi":"10.1007/978-3-319-61273-7_3","title":"Another Look at Tightness II: Practical Issues in Cryptography","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Encryption; Mathematical proof; Seriousness; Theoretical computer science; Computer security; Strong cryptography; Mathematics; Law; Political science","score_opus":0.023362779384842845,"score_gpt":0.28884612868627657,"score_spread":0.26548334930143375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740854940","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009229818,0.07022695,0.34031588,0.11857993,0.010285776,0.000109059234,0.00029412512,0.00056869874,0.45038974],"genre_scores_gemma":[0.41979277,0.055949546,0.12779304,0.046087835,0.034308806,0.0004421986,0.0004317337,0.0023865148,0.31280756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962568,0.0014293068,0.00017005745,0.00050547207,0.0012182789,0.00042000768],"domain_scores_gemma":[0.9912322,0.0057176724,0.00033216985,0.0015299373,0.0008731069,0.00031491587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033014573,0.0013677177,0.0017590959,0.002609718,0.0040986077,0.007210351,0.0022318931,0.0039908886,0.024572682],"category_scores_gemma":[0.016720641,0.0012159889,0.0012377393,0.004022547,0.014486476,0.038149968,0.005095371,0.021781497,0.0059903297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001782836,0.000015126795,0.00002941587,0.00006395124,0.000004353157,0.000011751338,0.00012332978,0.00033074492,0.00014847441,0.97382325,0.014640665,0.010791149],"study_design_scores_gemma":[0.000005503026,0.000010830982,0.000032080676,0.00005707105,0.0000037094806,0.000035456706,0.000059218877,0.00043848626,0.00012329698,0.96656746,0.032657832,0.000009062665],"about_ca_topic_score_codex":0.0012140209,"about_ca_topic_score_gemma":0.000702557,"teacher_disagreement_score":0.024572682,"about_ca_system_score_codex":0.003962374,"about_ca_system_score_gemma":0.001370657,"threshold_uncertainty_score":0.082203746},"labels":[],"label_agreement":null},{"id":"W2741049205","doi":"10.1007/978-3-319-64471-4_9","title":"Past Indeterminacy in Data Warehouse Design","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Data warehouse; Schema (genetic algorithms); Schema evolution; Scalability; Implementation; Indeterminacy (philosophy); Traceability; Database schema; Data integrity; Data mining; Information retrieval; Database; Programming language; Software engineering; Database design","score_opus":0.06570883046719668,"score_gpt":0.29485987039674727,"score_spread":0.2291510399295506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741049205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03989425,0.008058886,0.92005897,0.002587721,0.00023930393,0.000049958413,0.000099671335,0.00040477954,0.028606527],"genre_scores_gemma":[0.7716819,0.0031943878,0.2151001,0.00033173908,0.00028879163,0.00008708091,0.00015020554,0.00022557579,0.008940254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967063,0.0014105003,0.00030826364,0.00040912657,0.0009912824,0.00017459004],"domain_scores_gemma":[0.99018234,0.006078129,0.00048094406,0.0018997106,0.0010940339,0.00026496575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057985694,0.00063783344,0.000727543,0.00092456175,0.0010457359,0.004880063,0.001787489,0.0008143061,0.0030036003],"category_scores_gemma":[0.021657435,0.0012021667,0.0006385807,0.0017736802,0.002923739,0.009386004,0.0018923817,0.0029128664,0.00045534477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015352204,0.000035924382,0.0010557832,0.00024374823,0.000036351907,0.00013972302,0.0007106733,0.021810904,0.000838395,0.8653498,0.0033661707,0.10625897],"study_design_scores_gemma":[0.00002198815,0.000049492028,0.00022293738,0.000126225,0.00004097938,0.00019760689,0.00011780441,0.076578386,0.001343092,0.9029211,0.018353853,0.000026498854],"about_ca_topic_score_codex":0.0011286502,"about_ca_topic_score_gemma":0.0015983377,"teacher_disagreement_score":0.0057985694,"about_ca_system_score_codex":0.0021682025,"about_ca_system_score_gemma":0.0014172812,"threshold_uncertainty_score":0.030666113},"labels":[],"label_agreement":null},{"id":"W2741229744","doi":"10.1007/978-3-540-78773-0_15","title":"Spanners of Complete k-Partite Geometric Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Graph; Set (abstract data type); Time complexity; Discrete mathematics; Computer science","score_opus":0.026251154412180892,"score_gpt":0.24076446516687172,"score_spread":0.21451331075469082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741229744","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.67776096,0.0009946149,0.10839969,0.00035913364,0.00026734616,0.00010016741,0.0007746228,0.00038083855,0.21096265],"genre_scores_gemma":[0.8743384,0.0012516669,0.028280372,0.0001814761,0.00023674454,0.00012632723,0.0013041692,0.0003001509,0.0939807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976104,0.000037631235,0.000013228414,0.000058471513,0.00008447091,0.000045082477],"domain_scores_gemma":[0.9996119,0.0001320856,0.000060625985,0.00006181177,0.00005088038,0.00008272495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016176591,0.0005543433,0.00063617574,0.0010934393,0.0009437065,0.001368905,0.0007375108,0.00061845843,0.0111212535],"category_scores_gemma":[0.00074288045,0.0005637218,0.0005117184,0.0013313461,0.0008668817,0.0018751812,0.0013371457,0.001062979,0.0016682628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112071335,0.000049431055,0.00055732264,0.0002049679,0.00003346571,0.00034609422,0.0008496348,0.016367046,0.008948789,0.93161696,0.005712107,0.035202213],"study_design_scores_gemma":[0.000014917788,0.00005439741,0.00079287373,0.00002925927,0.00001597077,0.00030877333,0.00024699367,0.013858051,0.0018977483,0.9716329,0.011135151,0.0000129420005],"about_ca_topic_score_codex":0.00036198532,"about_ca_topic_score_gemma":0.00078936445,"teacher_disagreement_score":0.0111212535,"about_ca_system_score_codex":0.00026579658,"about_ca_system_score_gemma":0.00017371633,"threshold_uncertainty_score":0.037204266},"labels":[],"label_agreement":null},{"id":"W2741342351","doi":"10.1007/978-3-319-64635-0_17","title":"An Embedded Agent-Based Intelligent Industrial Wireless Sensor Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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 Calgary","funders":"","keywords":"Wireless sensor network; Computer science; Key distribution in wireless sensor networks; Interconnectivity; Wireless network; Computer network; Control reconfiguration; Automation; Wireless; Mobile wireless sensor network; Embedded system; Wi-Fi array; Distributed computing; Telecommunications; Engineering","score_opus":0.033900870979313484,"score_gpt":0.2640799650016355,"score_spread":0.230179094022322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741342351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04103355,0.0014161662,0.92293084,0.00028560904,0.00042239274,0.00016117348,0.00011099519,0.006532003,0.027107248],"genre_scores_gemma":[0.5286381,0.0012703664,0.4322768,0.00028355722,0.00012305382,0.00022833906,0.00029404805,0.00024154286,0.036644217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998554,0.000023365295,0.00000900352,0.000034179586,0.0000648989,0.000013097521],"domain_scores_gemma":[0.99990654,0.000020989899,0.000011365079,0.000017742179,0.000029352957,0.000014049053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039955,0.000377252,0.00045270688,0.00024138347,0.00030059658,0.00057757954,0.0011477509,0.00045153397,0.002723893],"category_scores_gemma":[0.00024530655,0.0002021568,0.00022921148,0.00024141526,0.0001824186,0.00067399105,0.0005952485,0.00045373337,0.00092913257],"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.0005930081,0.0005293442,0.0014522701,0.00047440804,0.000111844514,0.00060365145,0.00019149958,0.18232031,0.1313895,0.024065642,0.013022998,0.6452455],"study_design_scores_gemma":[0.00006517566,0.00036222328,0.00085480086,0.000034147863,0.00008397622,0.00029281108,0.000030094228,0.9131222,0.029735437,0.004802721,0.05058845,0.000028048522],"about_ca_topic_score_codex":0.00065539486,"about_ca_topic_score_gemma":0.0010520838,"teacher_disagreement_score":0.002723893,"about_ca_system_score_codex":0.00021093636,"about_ca_system_score_gemma":0.00034183983,"threshold_uncertainty_score":0.009112358},"labels":[],"label_agreement":null},{"id":"W2741713851","doi":"10.1007/978-3-319-64283-3_10","title":"MapReduce-Based Complex Big Data Analytics over Uncertain and Imprecise Social Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":28,"is_retracted":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":"Big data; Computer science; Interdependence; Data science; Analytics; Social network (sociolinguistics); Complex network; Uncertain data; Social network analysis; Data mining; World Wide Web; Social media","score_opus":0.18855413475856203,"score_gpt":0.32044313144454134,"score_spread":0.1318889966859793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741713851","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.07038654,0.0022245354,0.9085402,0.0014725901,0.00043410456,0.00020540779,0.0016790065,0.004707516,0.010350117],"genre_scores_gemma":[0.7590831,0.0013721439,0.22851783,0.00030705385,0.00029544628,0.000169402,0.0028548026,0.00032280522,0.0070774555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923885,0.00013155141,0.000033122033,0.00016415722,0.00031971306,0.000112613234],"domain_scores_gemma":[0.99912804,0.0003928968,0.000036408866,0.00018845337,0.00018541864,0.00006873484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107469,0.00097612705,0.0013133235,0.0008713669,0.00084592425,0.0019837457,0.00242681,0.0005398222,0.0020319102],"category_scores_gemma":[0.0025543142,0.00049387704,0.000946052,0.0019562545,0.0006491882,0.0028530185,0.0022901185,0.001227332,0.0008085495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059613783,0.00033600043,0.0032988694,0.00041962604,0.00036918654,0.00047226594,0.00053345953,0.51418126,0.0083570825,0.040483844,0.041289624,0.38966262],"study_design_scores_gemma":[0.000008837731,0.000017735785,0.00040061152,0.0000065230684,0.000016032516,0.000057174937,0.00010414669,0.95931816,0.0015074015,0.035577968,0.0029765568,0.000008857736],"about_ca_topic_score_codex":0.01124622,"about_ca_topic_score_gemma":0.013383558,"teacher_disagreement_score":0.01124622,"about_ca_system_score_codex":0.00091310294,"about_ca_system_score_gemma":0.0013579548,"threshold_uncertainty_score":0.022361577},"labels":[],"label_agreement":null},{"id":"W2741783723","doi":"10.1007/978-3-319-64283-3_24","title":"Sentiment Analysis on Twitter to Improve Time Series Contextual Anomaly Detection for Detecting Stock Market Manipulation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","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":"University of Alberta","funders":"","keywords":"Anomaly detection; False positive paradox; Computer science; Stock market; Data mining; CAD; Sentiment analysis; Time series; Anomaly (physics); Stock (firearms); Artificial intelligence; Machine learning; Engineering","score_opus":0.07278372895298965,"score_gpt":0.3588620842451711,"score_spread":0.2860783552921814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741783723","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.61282456,0.0026719314,0.35116845,0.0010052985,0.0016252801,0.00030765316,0.007984449,0.005095545,0.01731684],"genre_scores_gemma":[0.89084387,0.0010230677,0.09356309,0.00022897564,0.0008850637,0.0001814268,0.0060664755,0.00021077694,0.006997286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.00003585157,0.000021827875,0.000062295076,0.00009661248,0.000048446564],"domain_scores_gemma":[0.999516,0.00014016812,0.00006377962,0.00004618046,0.00020786293,0.00002593416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035456882,0.0006164188,0.0005483389,0.0013444588,0.00028937214,0.0006598045,0.00031601332,0.0003542166,0.002146846],"category_scores_gemma":[0.0013577447,0.00014432617,0.00053126045,0.0011644063,0.00011514827,0.0007843744,0.00052441587,0.0004467174,0.0015803417],"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.0007330852,0.00046856442,0.043566577,0.0003458861,0.00024795957,0.00054685207,0.0002947363,0.014436823,0.17416804,0.0027982956,0.02731194,0.7350813],"study_design_scores_gemma":[0.000029927754,0.00032078807,0.046688937,0.000040999967,0.00020009888,0.00034428292,0.00040503527,0.88583344,0.045728795,0.004862449,0.015481271,0.00006396111],"about_ca_topic_score_codex":0.0013168211,"about_ca_topic_score_gemma":0.0027119338,"teacher_disagreement_score":0.002146846,"about_ca_system_score_codex":0.0001687541,"about_ca_system_score_gemma":0.00018982726,"threshold_uncertainty_score":0.007181883},"labels":[],"label_agreement":null},{"id":"W2742182749","doi":"10.1007/978-3-319-66429-3_21","title":"Canadian English Word Stress: A Corpora-Based Study of National Identity in a Multilingual Community","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Phonetics and Phonology Research","field":"Psychology","cited_by":4,"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":"Stress (linguistics); American English; Linguistics; Corpus linguistics; Computer science; Speech corpus; Perception; British English; Natural language processing; Artificial intelligence; Psychology; Speech synthesis","score_opus":0.06713370543145852,"score_gpt":0.3760848418182186,"score_spread":0.3089511363867601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742182749","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.9916134,0.00037791888,0.00017385636,0.00022792524,0.00002116419,0.0000842191,0.002421508,0.000010946954,0.0050690183],"genre_scores_gemma":[0.99147004,0.00048601071,0.0006864706,0.00013800318,0.000013602277,0.00013243036,0.0033474765,0.00003930791,0.0036866094],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99858826,0.00021937773,0.000060472426,0.0002268022,0.0005365309,0.00036851005],"domain_scores_gemma":[0.9948891,0.00071905676,0.0006153988,0.00024650944,0.0027362993,0.0007936308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015212442,0.0005425081,0.0005529301,0.004543165,0.008779781,0.0030901046,0.0016054751,0.0008213307,0.0033311585],"category_scores_gemma":[0.0061491933,0.00038994086,0.00037267373,0.013816263,0.0022161799,0.0016161867,0.0026025777,0.000940609,0.00059209735],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006897131,0.00062490674,0.62874407,0.00038325915,0.00015087445,0.0013901836,0.2708919,0.00039934483,0.005232225,0.0044802083,0.019939525,0.067073815],"study_design_scores_gemma":[0.000013222219,0.00004801843,0.90609115,0.00006806225,0.000037975344,0.00016517934,0.08078286,0.00017107095,0.00032994384,0.00019636271,0.012044302,0.000051926938],"about_ca_topic_score_codex":0.9851275,"about_ca_topic_score_gemma":0.9951414,"teacher_disagreement_score":0.023232548,"about_ca_system_score_codex":0.023232548,"about_ca_system_score_gemma":0.02522978,"threshold_uncertainty_score":0.16856474},"labels":[],"label_agreement":null},{"id":"W2742747667","doi":"10.1007/978-3-319-66188-9_5","title":"Novel Unobtrusive Approach for Sleep Monitoring Using Fiber Optics in an Ambient Assisted Living Platform","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Sleep (system call); Assisted living; Sleep quality; Computer science; Real-time computing; Simulation; Human–computer interaction; Psychology; Medicine; Gerontology; Psychiatry; Insomnia; Operating system","score_opus":0.05278645199697584,"score_gpt":0.2718942739629453,"score_spread":0.21910782196596945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742747667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30934504,0.001986011,0.67145544,0.0003365053,0.00046690405,0.00026903997,0.00024134167,0.0034472735,0.012452496],"genre_scores_gemma":[0.7470172,0.0007634609,0.23272821,0.00031692156,0.00012072438,0.00015877973,0.00013690017,0.00011836768,0.018639427],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997594,0.000028551505,0.000008789129,0.00006696017,0.00010870804,0.000027581931],"domain_scores_gemma":[0.9998361,0.00003832929,0.000027333106,0.000022345894,0.000057105408,0.000018799443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001532064,0.0005577658,0.00030055933,0.00027310805,0.00029490117,0.000341988,0.0008451915,0.0005186623,0.0026198782],"category_scores_gemma":[0.0002424186,0.0001993372,0.00023953858,0.00015881192,0.00018545777,0.00061972404,0.00063585694,0.00032018655,0.00063446275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031091145,0.00016205703,0.0018849876,0.00021097675,0.000032433793,0.00045849168,0.00022699915,0.0010798286,0.8254347,0.0010806014,0.0017350694,0.16738293],"study_design_scores_gemma":[0.00008961323,0.0035584902,0.024327904,0.00011347312,0.00028672774,0.0046529765,0.0004028538,0.11319,0.8102355,0.0017654239,0.04120778,0.00016923672],"about_ca_topic_score_codex":0.00050533516,"about_ca_topic_score_gemma":0.0014897507,"teacher_disagreement_score":0.0026198782,"about_ca_system_score_codex":0.00015342525,"about_ca_system_score_gemma":0.00023705392,"threshold_uncertainty_score":0.008764386},"labels":[],"label_agreement":null},{"id":"W2743017711","doi":"10.1007/978-3-642-12200-2_51","title":"The Interval Constrained 3-Coloring Problem","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Interval (graph theory); Time complexity; Computer science; Combinatorics; Computational complexity theory; NP-complete; Mathematics; Discrete mathematics; Algorithm","score_opus":0.010344334271980213,"score_gpt":0.2383458001660845,"score_spread":0.2280014658941043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743017711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21328638,0.0023832864,0.6825617,0.0054319827,0.00072807947,0.00036235657,0.00753512,0.0013331352,0.086378016],"genre_scores_gemma":[0.6285318,0.0024689697,0.33755928,0.0014498857,0.00055574975,0.00045673896,0.006636706,0.0007811793,0.021559762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991788,0.00023192461,0.00003814879,0.0002275798,0.0001566583,0.0001668731],"domain_scores_gemma":[0.9972671,0.0016018057,0.00022764728,0.00034969408,0.00020338579,0.00035028486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007372251,0.001005299,0.0013882185,0.00075376756,0.0010977288,0.0028498662,0.002506492,0.0019333077,0.01522988],"category_scores_gemma":[0.004408399,0.00070083066,0.0009644827,0.0025557252,0.0010338648,0.0036614847,0.002028226,0.0029764078,0.0012866871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011254087,0.00043658086,0.0017872973,0.0010000428,0.00013537929,0.00041624028,0.00045944884,0.13779157,0.0075734966,0.60462403,0.06522663,0.17942393],"study_design_scores_gemma":[0.00020257689,0.000097348304,0.0010933797,0.00012659891,0.0000605582,0.00043575003,0.00027487744,0.19650604,0.0029020805,0.7693164,0.02893039,0.00005408801],"about_ca_topic_score_codex":0.003071104,"about_ca_topic_score_gemma":0.0024079345,"teacher_disagreement_score":0.01522988,"about_ca_system_score_codex":0.0012900174,"about_ca_system_score_gemma":0.0012443721,"threshold_uncertainty_score":0.050949037},"labels":[],"label_agreement":null},{"id":"W2743128558","doi":"10.1007/978-3-319-73915-1_7","title":"Grid-Obstacle Representations with Connections to Staircase Guarding","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Obstacle; Grid; Vertex (graph theory); Bipartite graph; Monotone polygon; Representation (politics); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Path (computing); Computer science; Topology (electrical circuits); Graph; Discrete mathematics; Geometry; Artificial intelligence; Geography","score_opus":0.023798389640919237,"score_gpt":0.3008396355333772,"score_spread":0.277041245892458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743128558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019254202,0.00011774163,0.96582586,0.00012912003,0.00011518571,0.000049083603,0.0002462881,0.0010557029,0.013206851],"genre_scores_gemma":[0.5296247,0.00034847215,0.44849268,0.0001580377,0.00006851303,0.00018525671,0.0010479514,0.0012110408,0.018863387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997696,0.00004401295,0.0000141400305,0.00004061289,0.00009476412,0.000036798196],"domain_scores_gemma":[0.9995402,0.000095410345,0.00003971939,0.00018427325,0.000083511026,0.00005696804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026028394,0.0005352385,0.0007883133,0.00095561356,0.00055514864,0.0015582496,0.0016509915,0.0011727073,0.01205688],"category_scores_gemma":[0.001948647,0.00041282095,0.00064123154,0.001027063,0.0007885198,0.0016494651,0.0030413768,0.0017523309,0.0028560099],"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.00021394066,0.00013567398,0.00060102885,0.00015557726,0.000025596726,0.00017626138,0.00021031332,0.34005627,0.0043226355,0.50835174,0.009879363,0.13587162],"study_design_scores_gemma":[0.000018201152,0.000028994767,0.0000630951,0.000020418021,0.000007054301,0.000046663783,0.00003917324,0.85856915,0.0010399917,0.13149385,0.008662003,0.000011298077],"about_ca_topic_score_codex":0.002008448,"about_ca_topic_score_gemma":0.0027678972,"teacher_disagreement_score":0.01205688,"about_ca_system_score_codex":0.00035100835,"about_ca_system_score_gemma":0.0005271967,"threshold_uncertainty_score":0.040334284},"labels":[],"label_agreement":null},{"id":"W2743358237","doi":"10.1007/11871842_3","title":"Learning to Have Fun","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Metric (unit); Artificial intelligence; Applications of artificial intelligence; Multimedia; Human–computer interaction; Marketing","score_opus":0.024398507963071744,"score_gpt":0.27016773118830983,"score_spread":0.2457692232252381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743358237","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011800723,0.0037237557,0.018845381,0.0133946575,0.0018340123,0.000046477373,0.000059061655,0.00022495049,0.950071],"genre_scores_gemma":[0.19587693,0.0042433254,0.015134821,0.0045421156,0.000616505,0.00018945073,0.00023228487,0.00017864964,0.77898586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994709,0.00019133835,0.000011345155,0.000090731686,0.00014863098,0.0000871585],"domain_scores_gemma":[0.99909604,0.00017644839,0.00005427433,0.00010293213,0.00012934934,0.00044091046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083802815,0.00071523077,0.00030565416,0.0004639434,0.0020947792,0.0032597077,0.00077803934,0.0010000112,0.03987443],"category_scores_gemma":[0.002121844,0.00020363383,0.00041002943,0.00026558532,0.0031564059,0.00467711,0.003320952,0.0035810033,0.0106904395],"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.00004376636,0.00027959587,0.0011632775,0.0001753662,0.000019100915,0.00013360573,0.008957215,0.0003500449,0.0010025239,0.500086,0.20610873,0.28168073],"study_design_scores_gemma":[0.000011481965,0.0000771369,0.00096160016,0.00029844005,0.000007985649,0.0002713694,0.003181764,0.00032699844,0.0005138247,0.27131045,0.72302175,0.000017222259],"about_ca_topic_score_codex":0.00038893684,"about_ca_topic_score_gemma":0.0015091765,"teacher_disagreement_score":0.03987443,"about_ca_system_score_codex":0.000688888,"about_ca_system_score_gemma":0.0008972723,"threshold_uncertainty_score":0.13339329},"labels":[],"label_agreement":null},{"id":"W2743750036","doi":"10.1007/978-3-319-66188-9_9","title":"Activity Model for Interactive Micro Context-Aware Well-Being Applications Based on ContextAA","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Sherbrooke","funders":"","keywords":"Ontic; Computer science; Semantics (computer science); Context (archaeology); Adaptation (eye); Representation (politics); Human–computer interaction; Smart environment; Ubiquitous computing; Ambient intelligence; Programming language; World Wide Web; Internet of Things","score_opus":0.03145519169797074,"score_gpt":0.28741631524644895,"score_spread":0.2559611235484782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743750036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015481964,0.0003561344,0.97712326,0.0001218049,0.00006303963,0.00006048013,0.00027418524,0.00070761296,0.0058115334],"genre_scores_gemma":[0.8016488,0.00066853163,0.18701303,0.00010099817,0.000056563116,0.00048464144,0.00077880616,0.00014245865,0.009106135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.000052906933,0.000015721296,0.00007208742,0.000053863954,0.00003122179],"domain_scores_gemma":[0.9998161,0.000084397136,0.000013817955,0.000021704596,0.00004212147,0.00002189599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028461916,0.00061426964,0.00066547684,0.00042218078,0.00032124599,0.00096613186,0.0010141148,0.00057400385,0.0043140138],"category_scores_gemma":[0.00080674374,0.000247782,0.00086197717,0.0004961915,0.00029610304,0.0010839382,0.000744435,0.0008947218,0.0009974559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003054121,0.00034339554,0.002167627,0.00022271923,0.00011753111,0.00024703983,0.0005408373,0.7556267,0.009721507,0.09036463,0.0038149604,0.13652761],"study_design_scores_gemma":[0.0000047987673,0.000024663417,0.0002315331,0.0000080846985,0.0000136144845,0.000020907071,0.000024541434,0.9870319,0.00039704988,0.01102121,0.0012155642,0.0000061849764],"about_ca_topic_score_codex":0.0072796196,"about_ca_topic_score_gemma":0.007649601,"teacher_disagreement_score":0.0072796196,"about_ca_system_score_codex":0.00046550608,"about_ca_system_score_gemma":0.00061904755,"threshold_uncertainty_score":0.014474511},"labels":[],"label_agreement":null},{"id":"W2744415202","doi":"10.1007/978-3-319-66188-9","title":"Enhanced Quality of Life and Smart Living","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Smart Cities and Technologies","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Quality (philosophy)","score_opus":0.019579562476490567,"score_gpt":0.24723497837585107,"score_spread":0.2276554158993605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744415202","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076011317,0.19707964,0.020613829,0.012270618,0.008404192,0.00004919984,0.00031972857,0.0003363408,0.7533254],"genre_scores_gemma":[0.098363414,0.14001864,0.014830487,0.0055736317,0.0048772427,0.000113321454,0.00059587415,0.0002236597,0.73540384],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998863,0.000018349436,0.0000039037814,0.000012368953,0.00006402267,0.000015055004],"domain_scores_gemma":[0.9999242,0.000024569992,0.000009807197,0.0000093298095,0.000017882723,0.000014245239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016917217,0.00041997686,0.00030807714,0.00048838777,0.00024521956,0.0013004724,0.00035096082,0.00057833316,0.01758975],"category_scores_gemma":[0.00033334168,0.00008121439,0.00027943944,0.00072526146,0.0004821295,0.0015929668,0.001171698,0.0011348899,0.0043793437],"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.000044998622,0.000094019,0.00023454671,0.0006504279,0.000027309394,0.00010785872,0.00040266072,0.0007932446,0.0024542864,0.22617523,0.22655945,0.5424559],"study_design_scores_gemma":[0.0000072103,0.000045574758,0.0012383927,0.00033151393,0.000009129828,0.00033104888,0.000131435,0.00032289786,0.00055562635,0.059022985,0.93799525,0.000008981129],"about_ca_topic_score_codex":0.00031543663,"about_ca_topic_score_gemma":0.0007625133,"teacher_disagreement_score":0.01758975,"about_ca_system_score_codex":0.0004674519,"about_ca_system_score_gemma":0.00022915531,"threshold_uncertainty_score":0.058843553},"labels":[],"label_agreement":null},{"id":"W2744447489","doi":"10.1007/978-3-319-66263-3_10","title":"(I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Schedule; Scheduling (production processes); Entertainment; Operations research; Multimedia; Mathematical optimization; Visual arts; Engineering; Mathematics","score_opus":0.2533122819494547,"score_gpt":0.37216416065465296,"score_spread":0.11885187870519826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744447489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03181552,0.0019424625,0.9108174,0.00482193,0.0018302446,0.00021359701,0.0009206519,0.0026167622,0.04502153],"genre_scores_gemma":[0.33176446,0.0029932875,0.5479743,0.0011316934,0.0012919981,0.00031572947,0.0019977842,0.0013538455,0.11117696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996321,0.00009011556,0.000016779644,0.00007473942,0.00011240225,0.00007379095],"domain_scores_gemma":[0.9994531,0.0002215785,0.000034554007,0.000045281548,0.00013316187,0.00011230102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880315,0.00081937405,0.0006213131,0.00033494818,0.0005434274,0.001228295,0.0012835964,0.0008635798,0.031975444],"category_scores_gemma":[0.0023583611,0.00036536844,0.0009334001,0.0010299948,0.00039226067,0.0017789842,0.00079552067,0.0017104539,0.005494395],"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.0007958893,0.00039926756,0.0010800012,0.0005918567,0.00007870702,0.0000992678,0.0003157575,0.06308207,0.008066823,0.036707316,0.1273587,0.7614243],"study_design_scores_gemma":[0.00029640424,0.0015358826,0.004311385,0.00014460378,0.00011860755,0.00040010776,0.0009821462,0.69535476,0.011067144,0.14804173,0.13758937,0.00015791785],"about_ca_topic_score_codex":0.0039889994,"about_ca_topic_score_gemma":0.006437715,"teacher_disagreement_score":0.031975444,"about_ca_system_score_codex":0.00088636886,"about_ca_system_score_gemma":0.00093287724,"threshold_uncertainty_score":0.10696852},"labels":[],"label_agreement":null},{"id":"W2745414021","doi":"10.1007/978-3-319-66733-1_18","title":"Co-evaluation, to Scaffold the Creation of Open Educational Resources","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"Ontario College of Art and Design","funders":"","keywords":"Open educational resources; Computer science; Context (archaeology); Component (thermodynamics); Inclusion (mineral); Educational resources; Knowledge management; World Wide Web; Quality (philosophy); Multimedia; Pedagogy; Sociology","score_opus":0.04126342668182292,"score_gpt":0.3477561403037129,"score_spread":0.30649271362188996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745414021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08910864,0.003289257,0.5654245,0.0049244063,0.0013199438,0.000791739,0.0002887312,0.0043496857,0.3305031],"genre_scores_gemma":[0.6820611,0.0014050017,0.21338545,0.0009164537,0.0004229217,0.0008050623,0.0008798152,0.0018535698,0.098270655],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.98661333,0.007076578,0.00045053594,0.0016820959,0.003448489,0.0007288798],"domain_scores_gemma":[0.9611835,0.022184387,0.0018097099,0.006734766,0.005383167,0.0027044641],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.009394462,0.0008121604,0.0007469719,0.002377013,0.0020486542,0.010967411,0.0020157413,0.0020135208,0.017851973],"category_scores_gemma":[0.052514557,0.00038337382,0.0005295784,0.0020400204,0.002933377,0.014585018,0.012120421,0.0020546634,0.0058287345],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033971007,0.0009606518,0.006122811,0.0010516219,0.00008275567,0.00043687792,0.015002952,0.0036164003,0.012593896,0.22591627,0.038294643,0.6955814],"study_design_scores_gemma":[0.00014925607,0.00056271633,0.0074127084,0.0015292824,0.0001758756,0.0010080546,0.013393572,0.034914702,0.038693264,0.38476652,0.517159,0.00023516236],"about_ca_topic_score_codex":0.0012265694,"about_ca_topic_score_gemma":0.0028110608,"teacher_disagreement_score":0.99798423,"about_ca_system_score_codex":0.0016658686,"about_ca_system_score_gemma":0.004362179,"threshold_uncertainty_score":0.059720814},"labels":[],"label_agreement":null},{"id":"W2745822044","doi":"10.1007/978-3-319-66805-5_23","title":"Research Issues in Attempting to Support an Architecture Firm Transition from Fragmented CAD to BIM Collaborative Design","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"École de Technologie Supérieure","funders":"","keywords":"Multidisciplinary approach; Computer science; Knowledge management; Architecture; Originality; Engineering management; CAD; Process management; Systems engineering; Engineering; Sociology; Qualitative research","score_opus":0.036752794071263195,"score_gpt":0.3107328956839023,"score_spread":0.2739801016126391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745822044","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.3594389,0.0077301045,0.08894418,0.20698103,0.0014071976,0.00095482136,0.00023471078,0.00044686365,0.33386213],"genre_scores_gemma":[0.8963152,0.0034439578,0.071564645,0.0038297484,0.00013981435,0.00042925417,0.00021723441,0.00010990798,0.023950143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9770865,0.012712267,0.0009777822,0.0017392726,0.004769324,0.0027148833],"domain_scores_gemma":[0.96279925,0.021161854,0.0015509609,0.003061986,0.007945848,0.0034800821],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.038383085,0.0004007975,0.0004308077,0.0015080953,0.0066375462,0.024273591,0.00534804,0.0053211474,0.015349342],"category_scores_gemma":[0.044741057,0.0006503224,0.000547568,0.0037264659,0.0054105604,0.018072398,0.0052232444,0.0056161815,0.0025419248],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033832225,0.001928798,0.0111783855,0.0010534415,0.000061528,0.00060922164,0.03935394,0.0058632684,0.0041557555,0.56762594,0.015838837,0.35199255],"study_design_scores_gemma":[0.00017843745,0.0014077909,0.017418182,0.002894556,0.000118171156,0.0009135413,0.39507526,0.02402923,0.0131357,0.24635346,0.2982948,0.00018081738],"about_ca_topic_score_codex":0.011450588,"about_ca_topic_score_gemma":0.013751649,"teacher_disagreement_score":0.9933624,"about_ca_system_score_codex":0.008796986,"about_ca_system_score_gemma":0.026496286,"threshold_uncertainty_score":0.20299155},"labels":[],"label_agreement":null},{"id":"W2745832781","doi":"10.1007/978-3-319-67401-8_5","title":"A Dynamic Speech Breathing System for Virtual Characters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":"Simon Fraser University","funders":"","keywords":"Computer science; Breathing; Character animation; Speech recognition; Animation; Speech production; Human–computer interaction; Virtual actor; Graphical user interface; Virtual reality; Computer animation; Computer graphics (images)","score_opus":0.012789794052309627,"score_gpt":0.2299829316457576,"score_spread":0.21719313759344797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745832781","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090973385,0.0016912303,0.8626308,0.00040607643,0.0008441527,0.0005893605,0.0011165532,0.025017276,0.01673116],"genre_scores_gemma":[0.61480296,0.0015409978,0.32101762,0.0009867442,0.00047705256,0.0009517436,0.0021905964,0.0025800338,0.055452254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.000036648365,0.0000124272265,0.000044460383,0.00005830596,0.000014779824],"domain_scores_gemma":[0.9997527,0.00010810366,0.000009791751,0.000024158828,0.000059207166,0.000046071997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003818763,0.00063953234,0.00059727783,0.00028690058,0.00026656836,0.0005773049,0.0009989176,0.00090134237,0.02215984],"category_scores_gemma":[0.0009573596,0.00023947307,0.00028782166,0.00013446284,0.00019036866,0.0004220399,0.0010135276,0.00035824155,0.003948965],"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.0018289651,0.00022273228,0.0010112803,0.0006132894,0.00010279539,0.00064823334,0.0004714386,0.0044037867,0.3715096,0.0017032945,0.020366516,0.597118],"study_design_scores_gemma":[0.0016927151,0.0041018184,0.016868753,0.0005615117,0.00079352764,0.010394633,0.00065525837,0.35715353,0.39053887,0.0061743385,0.21061315,0.00045180737],"about_ca_topic_score_codex":0.000425595,"about_ca_topic_score_gemma":0.00043668205,"teacher_disagreement_score":0.02215984,"about_ca_system_score_codex":0.00012832484,"about_ca_system_score_gemma":0.00020664776,"threshold_uncertainty_score":0.074132085},"labels":[],"label_agreement":null},{"id":"W2745913367","doi":"10.1007/978-3-319-67186-4_6","title":"Social Media Mining to Understand Public Mental Health","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mental health; Social media; Mood; Computer science; Visibility; Sentiment analysis; Theme (computing); Anxiety; World Wide Web; Internet privacy; Tracking (education); Focus (optics); Data science; Psychology; Psychiatry; Artificial intelligence","score_opus":0.1262803026162166,"score_gpt":0.39567363020010804,"score_spread":0.26939332758389145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745913367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12795128,0.051744,0.48804307,0.044954114,0.0049441364,0.00053131033,0.026016867,0.005651068,0.25016415],"genre_scores_gemma":[0.6326262,0.024423258,0.23731023,0.0034587216,0.004303059,0.00056471775,0.019524667,0.0007685795,0.07702059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976116,0.000095933305,0.000018772631,0.000046293928,0.00005962221,0.000018248005],"domain_scores_gemma":[0.997451,0.0021922719,0.000087891516,0.00010348253,0.00011764887,0.000047716025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086818077,0.0007594842,0.00034917836,0.0024417345,0.00043848573,0.0017613263,0.00046552822,0.0005711488,0.008904589],"category_scores_gemma":[0.0037194304,0.00020312615,0.00066310365,0.0019635109,0.00041006654,0.002520073,0.000869991,0.0012280939,0.002393609],"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.000050881474,0.00020783897,0.016895872,0.0005815978,0.00019597268,0.00023864627,0.0016379277,0.0030105424,0.0020178186,0.03652813,0.08013289,0.85850185],"study_design_scores_gemma":[0.000023113596,0.00011776264,0.05140905,0.0020164265,0.00027402054,0.0009632488,0.006038286,0.111001596,0.0064990255,0.4221128,0.39945456,0.00009011849],"about_ca_topic_score_codex":0.0021751234,"about_ca_topic_score_gemma":0.003549138,"teacher_disagreement_score":0.008904589,"about_ca_system_score_codex":0.00046383776,"about_ca_system_score_gemma":0.00051810563,"threshold_uncertainty_score":0.029788792},"labels":[],"label_agreement":null},{"id":"W2746449455","doi":"10.1007/978-3-319-67401-8_2","title":"WalkNet: A Neural-Network-Based Interactive Walking Controller","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","cited_by":13,"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":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Movement (music); Controller (irrigation); Process (computing); Artificial intelligence; Artificial neural network; Component (thermodynamics); Interface (matter); Human–computer interaction; Machine learning","score_opus":0.013929146325315098,"score_gpt":0.23513626201166815,"score_spread":0.22120711568635304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746449455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019820314,0.00038746538,0.9539247,0.00011273676,0.00018821878,0.000092395574,0.0004570958,0.017537337,0.0074796034],"genre_scores_gemma":[0.5369518,0.00047464855,0.4237473,0.0002894311,0.000057975656,0.0003484373,0.0015049764,0.0014199325,0.03520543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993205,0.0000063515026,0.0000034306097,0.00002236919,0.000027742039,0.000007996454],"domain_scores_gemma":[0.9999268,0.000024207988,0.000005444951,0.000009328019,0.000022785825,0.000011380853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014730853,0.0006494874,0.0004042718,0.00026511677,0.00021627273,0.00037689845,0.0012279314,0.0005669265,0.009942369],"category_scores_gemma":[0.0003855259,0.0002502285,0.00024144172,0.00020161782,0.00020277128,0.00054124446,0.0006814071,0.00059364847,0.0014170639],"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.0006143154,0.0002104281,0.00065077026,0.00030441763,0.00011951645,0.00023093534,0.00008228585,0.25985867,0.066529214,0.005470185,0.024360424,0.6415689],"study_design_scores_gemma":[0.000035227073,0.00008452074,0.0003218684,0.000015964753,0.000022936292,0.000060340168,0.000009640562,0.9801168,0.011047242,0.0015866318,0.0066838404,0.000014989121],"about_ca_topic_score_codex":0.0050876946,"about_ca_topic_score_gemma":0.010928037,"teacher_disagreement_score":0.009942369,"about_ca_system_score_codex":0.00026765018,"about_ca_system_score_gemma":0.00030660856,"threshold_uncertainty_score":0.033260584},"labels":[],"label_agreement":null},{"id":"W2746967387","doi":"10.1007/978-3-319-66176-6_10","title":"Intertwined Global Optimization Based Reachability Analysis","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Reachability; Computer science; Bounding overwatch; Hybrid system; Parametric statistics; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.05246711387970485,"score_gpt":0.3199695496392576,"score_spread":0.26750243575955274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746967387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030457643,0.00032502267,0.98635405,0.00009230491,0.000040114526,0.000021723929,0.000042577296,0.00017526101,0.009903065],"genre_scores_gemma":[0.39277524,0.0016980608,0.5791371,0.00026705774,0.00013123568,0.00035060753,0.0006090946,0.0008181925,0.024213433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986565,0.00038517738,0.00006284742,0.00030062135,0.0004905661,0.000104261984],"domain_scores_gemma":[0.9985744,0.00089616334,0.00008016212,0.00026856904,0.00014524763,0.000035556328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013718565,0.0015912305,0.0012503935,0.0016445293,0.0006578151,0.0017642311,0.002135651,0.0013673758,0.005991432],"category_scores_gemma":[0.0031902518,0.00079040433,0.00207135,0.0013759873,0.002114062,0.0030964187,0.0042884257,0.0033668478,0.0012881665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048949587,0.000047284026,0.0002147213,0.00022742679,0.000079385914,0.00006974291,0.00012451044,0.4261194,0.0037571976,0.4920862,0.0014216047,0.07580365],"study_design_scores_gemma":[0.00000410183,0.000025780037,0.0000748116,0.000036582267,0.000023634382,0.000021663056,0.000016062975,0.630037,0.0014417798,0.36538583,0.002920364,0.000012454088],"about_ca_topic_score_codex":0.001160722,"about_ca_topic_score_gemma":0.0015922079,"teacher_disagreement_score":0.005991432,"about_ca_system_score_codex":0.0012000285,"about_ca_system_score_gemma":0.0007618495,"threshold_uncertainty_score":0.020043314},"labels":[],"label_agreement":null},{"id":"W2747088929","doi":"10.1007/978-3-319-66167-4_9","title":"Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quadratic unconstrained binary optimization; Maximum satisfiability problem; Scalability; Qubit; Encoding (memory); Theoretical computer science; Quantum computer; Quadratic equation; Algorithm; Quantum; Artificial intelligence; Boolean function; Mathematics","score_opus":0.01503819851531909,"score_gpt":0.24849767329681977,"score_spread":0.23345947478150067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747088929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071608916,0.0052200384,0.7728035,0.0053768693,0.0007186484,0.00026434372,0.0005993811,0.0014916112,0.14191668],"genre_scores_gemma":[0.52135533,0.0037609118,0.41521844,0.00087102613,0.00087793596,0.0003089297,0.0012019575,0.00062238745,0.055783074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986848,0.00038360534,0.00008738788,0.00029784977,0.00037176086,0.00017456597],"domain_scores_gemma":[0.9977064,0.0015739929,0.00006899108,0.00042187626,0.00015423242,0.000074485106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017606743,0.0007402385,0.00096375856,0.0006734864,0.0015039007,0.0031859344,0.0023188693,0.0015467235,0.015466124],"category_scores_gemma":[0.0044718753,0.0009722105,0.0022475414,0.0016127648,0.0021807514,0.009101941,0.0031886627,0.005233678,0.003037571],"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.00017675174,0.00023399683,0.00042831706,0.0003801459,0.00006505019,0.000081640566,0.00025748613,0.020196399,0.0038219085,0.873235,0.008444944,0.09267834],"study_design_scores_gemma":[0.000059128033,0.00010564874,0.00050067226,0.00008124152,0.000050308525,0.00013518274,0.00010054478,0.108152255,0.0067520025,0.8634832,0.020530965,0.00004886441],"about_ca_topic_score_codex":0.0012496558,"about_ca_topic_score_gemma":0.0020881223,"teacher_disagreement_score":0.015466124,"about_ca_system_score_codex":0.0012286432,"about_ca_system_score_gemma":0.0017216728,"threshold_uncertainty_score":0.051739335},"labels":[],"label_agreement":null},{"id":"W2747115049","doi":"10.1007/978-3-319-72565-9_8","title":"Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Homomorphic encryption; Computer science; Encryption; Learning with errors; Reduction (mathematics); Ring (chemistry); Polynomial; Multiplication (music); Ciphertext; Arithmetic; Parallel computing; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.012101086962544534,"score_gpt":0.2557247016761423,"score_spread":0.24362361471359778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747115049","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.09860006,0.002178276,0.759851,0.0023524472,0.00072717963,0.00036710937,0.0007360658,0.0014188336,0.13376908],"genre_scores_gemma":[0.66345847,0.001546497,0.28555462,0.00038942214,0.0005209315,0.00027670737,0.0007792949,0.00043410796,0.047039784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917006,0.00022976643,0.00003818959,0.00010543136,0.0003203475,0.0001361612],"domain_scores_gemma":[0.9989504,0.000517131,0.000045191402,0.00035014318,0.00009570041,0.00004145763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090566144,0.0005959677,0.00081792264,0.00078457803,0.0011031689,0.002059602,0.0009789355,0.00072080194,0.010865321],"category_scores_gemma":[0.0025617285,0.00032028882,0.00095608254,0.0010470757,0.001433416,0.0024041508,0.002090375,0.0025356107,0.0024406302],"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.00025449577,0.0001801782,0.00020803793,0.00021943719,0.00003369543,0.00011862295,0.00028019,0.018774835,0.008679547,0.8413273,0.009290404,0.12063326],"study_design_scores_gemma":[0.00009725824,0.000089411384,0.00022355118,0.00004793516,0.00003348342,0.00023862667,0.00009794975,0.06566761,0.013710904,0.89848626,0.021273432,0.000033584318],"about_ca_topic_score_codex":0.00033716505,"about_ca_topic_score_gemma":0.00057390047,"teacher_disagreement_score":0.010865321,"about_ca_system_score_codex":0.00085140456,"about_ca_system_score_gemma":0.00066210306,"threshold_uncertainty_score":0.036348164},"labels":[],"label_agreement":null},{"id":"W2747130326","doi":"10.1007/978-3-319-66799-7_13","title":"Simplifying Analyses of Chemical Reaction Networks for Approximate Majority","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Correctness; Mathematical proof; Binary logarithm; Simple (philosophy); Computer science; Population; Context (archaeology); Protocol (science); Discrete mathematics; Theoretical computer science; Distributed algorithm; Combinatorics; Algorithm; Mathematics; Distributed computing","score_opus":0.02891216986072359,"score_gpt":0.2989851397757355,"score_spread":0.2700729699150119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747130326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018764505,0.00048096394,0.9686363,0.00050746126,0.000061666506,0.000049145983,0.00024538542,0.00033195424,0.010922758],"genre_scores_gemma":[0.71359146,0.0016025997,0.26265505,0.0005010224,0.00054803625,0.0003818128,0.0010715887,0.0010668008,0.018581687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984591,0.0006859537,0.0000734327,0.00023488111,0.00041109457,0.00013546742],"domain_scores_gemma":[0.9889709,0.008626552,0.00043036265,0.0013198057,0.0004658698,0.00018654128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029656927,0.0015665614,0.0018212828,0.001473442,0.000954137,0.0020808715,0.0033735025,0.0014455946,0.006839258],"category_scores_gemma":[0.017559245,0.0008897002,0.003123751,0.0013400958,0.0021408175,0.0050375806,0.003111868,0.0036370284,0.0013853882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008032905,0.00004028177,0.0003553805,0.00013622029,0.00006932052,0.00009695394,0.0001266955,0.4434124,0.001354859,0.5320787,0.0021751723,0.020073766],"study_design_scores_gemma":[0.0000052772093,0.000005444545,0.000049421502,0.00000742096,0.000011492734,0.00001159314,0.000009937997,0.5980545,0.00041005813,0.40076324,0.0006665083,0.0000051394277],"about_ca_topic_score_codex":0.0029141451,"about_ca_topic_score_gemma":0.0035518291,"teacher_disagreement_score":0.006839258,"about_ca_system_score_codex":0.001852352,"about_ca_system_score_gemma":0.0011015686,"threshold_uncertainty_score":0.02287954},"labels":[],"label_agreement":null},{"id":"W2747381231","doi":"10.1007/978-3-319-66266-4_5","title":"Safety Case Impact Assessment in Automotive Software Systems: An Improved Model-Based Approach","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","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 Toronto; McMaster University","funders":"","keywords":"Computer science; Automotive industry; Functional safety; Context (archaeology); Software; Work (physics); Software quality; Reliability engineering; Quality (philosophy); Safety standards; Risk analysis (engineering); Software development; Engineering","score_opus":0.015972656758341083,"score_gpt":0.25726934073039576,"score_spread":0.24129668397205467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747381231","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.011383809,0.00021963906,0.9811007,0.00011757374,0.000026988833,0.00012462656,0.00018519981,0.0014452048,0.005396292],"genre_scores_gemma":[0.41029575,0.00046846963,0.5835838,0.00010900324,0.000059332804,0.00037771152,0.0007190243,0.00041956076,0.003967347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749076,0.0007016098,0.00015957162,0.00023341237,0.0013078565,0.00010680855],"domain_scores_gemma":[0.9964755,0.0021355837,0.00024245256,0.00048269532,0.0006084292,0.00005526168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001835548,0.0015693712,0.0013970035,0.0040128045,0.00070984155,0.002580807,0.002665713,0.001607153,0.0050665275],"category_scores_gemma":[0.0059133167,0.0008351611,0.0020458165,0.0017966477,0.00075283006,0.0025531386,0.0021452417,0.0014985857,0.0007956912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007043445,0.0002689751,0.0015367722,0.00024827733,0.00013712366,0.00019119047,0.00012180525,0.8043999,0.00790105,0.018404696,0.00147849,0.1652414],"study_design_scores_gemma":[0.0000059558056,0.000026816453,0.00036969577,0.000018210085,0.000041536863,0.000043791963,0.000017917182,0.9881264,0.0012658477,0.009216729,0.00085611444,0.000011008851],"about_ca_topic_score_codex":0.0071072383,"about_ca_topic_score_gemma":0.007493223,"teacher_disagreement_score":0.0071072383,"about_ca_system_score_codex":0.0012266571,"about_ca_system_score_gemma":0.0014283207,"threshold_uncertainty_score":0.016949177},"labels":[],"label_agreement":null},{"id":"W2747572841","doi":"10.1007/978-3-319-66805-5_21","title":"Digital Synchronous Collaboration Workspace and 3D Interactions for an AEC Project. Decision-Making Scenario Evaluation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","field":"Engineering","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":"École de Technologie Supérieure","funders":"Agence Nationale de la Recherche","keywords":"Session (web analytics); Workspace; Multidisciplinary approach; Architecture; Adaptation (eye); Computer science; Engineering management; Systems engineering; Process management; Engineering; Knowledge management; World Wide Web","score_opus":0.018571225497222572,"score_gpt":0.29600973639956957,"score_spread":0.277438510902347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747572841","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.53627074,0.0014204406,0.26278266,0.00075276685,0.0001878777,0.0013361225,0.0011598894,0.0010841601,0.19500534],"genre_scores_gemma":[0.90952635,0.00037372703,0.07515188,0.000026513058,0.000012374162,0.00047380422,0.0005008428,0.000075515636,0.01385902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782854,0.0014740669,0.000062613646,0.00011581791,0.0004174408,0.000101614336],"domain_scores_gemma":[0.9976445,0.0015409804,0.000099709454,0.00020994818,0.0003494856,0.00015540485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024087215,0.00059210014,0.00026307348,0.0012781023,0.00086775026,0.002179656,0.0008963533,0.0010048476,0.015837934],"category_scores_gemma":[0.005471101,0.0002471294,0.00036478494,0.0011817787,0.0006015701,0.0022121063,0.0021066915,0.0004417245,0.0013156044],"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.0023209408,0.00176643,0.006362627,0.0012345589,0.000053158285,0.0011351769,0.012184699,0.064472295,0.026364258,0.08210989,0.016382286,0.7856137],"study_design_scores_gemma":[0.000630391,0.0042323177,0.04542155,0.0018898073,0.00033945462,0.002000098,0.032127343,0.5267838,0.08995627,0.09610525,0.20013362,0.0003799977],"about_ca_topic_score_codex":0.0023074448,"about_ca_topic_score_gemma":0.0035075194,"teacher_disagreement_score":0.015837934,"about_ca_system_score_codex":0.0010343879,"about_ca_system_score_gemma":0.0012422866,"threshold_uncertainty_score":0.052983165},"labels":[],"label_agreement":null},{"id":"W2748627688","doi":"10.1007/978-3-319-66167-4_6","title":"Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Satisfiability; Cardinality (data modeling); Integer programming; Scalability; Answer set programming; Set (abstract data type); Integer (computer science); Automated reasoning; Theoretical computer science; Linear programming; Architecture; Column generation; Mathematical optimization; Algorithm; Programming language; Mathematics; Data mining","score_opus":0.025759379115844055,"score_gpt":0.277529945164877,"score_spread":0.2517705660490329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748627688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015313688,0.0023014103,0.9300957,0.008114364,0.00044429454,0.00013276226,0.00052865484,0.0012524765,0.041816678],"genre_scores_gemma":[0.3421063,0.0030280002,0.6352209,0.0026740388,0.00088505814,0.00030226065,0.0018199511,0.0012263969,0.012737059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98573005,0.005991568,0.001217254,0.0019858081,0.0040657986,0.0010095442],"domain_scores_gemma":[0.96134466,0.03088425,0.0006873202,0.0047201985,0.0015731714,0.00079050177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012672005,0.0016211554,0.0021002295,0.0026443829,0.002794156,0.011309221,0.007443664,0.0041157496,0.012654311],"category_scores_gemma":[0.044975616,0.0035859155,0.004591119,0.0028726496,0.010704352,0.046900257,0.013758687,0.014882883,0.0020073308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007385359,0.00003063279,0.0001954673,0.00023021949,0.00004580599,0.00013901082,0.0008001111,0.0070305476,0.00062198547,0.9578042,0.004238245,0.028790064],"study_design_scores_gemma":[0.000014591736,0.0000070062074,0.000040729443,0.00009300054,0.000025493255,0.000046637568,0.00013821523,0.015680654,0.0006755404,0.97494704,0.008314386,0.000016870594],"about_ca_topic_score_codex":0.0047922777,"about_ca_topic_score_gemma":0.004607995,"teacher_disagreement_score":0.012672005,"about_ca_system_score_codex":0.0035113497,"about_ca_system_score_gemma":0.0024127054,"threshold_uncertainty_score":0.06701678},"labels":[],"label_agreement":null},{"id":"W2749312524","doi":"10.1007/978-3-662-55665-8_37","title":"Testing Minimax for Rational Ignorant Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Université de Montréal","funders":"","keywords":"Minimax; Computer science; Mathematical economics; Mathematical optimization; Mathematics","score_opus":0.05487108017068307,"score_gpt":0.2854569867356643,"score_spread":0.2305859065649812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749312524","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.47534698,0.0014904626,0.46366748,0.019844016,0.00065220945,0.00038699314,0.0009724511,0.0030217653,0.034617696],"genre_scores_gemma":[0.93632513,0.00022265442,0.05711237,0.00090782926,0.00019982475,0.00017827663,0.0006043293,0.00023222005,0.004217402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893993,0.004657348,0.00060125004,0.0021378775,0.0021584234,0.0010458448],"domain_scores_gemma":[0.90377206,0.087430626,0.0020123248,0.0034047044,0.0019327549,0.0014476231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010548149,0.0017254453,0.0024603268,0.0010978401,0.0014701406,0.004134343,0.0036587166,0.0053165783,0.0073987753],"category_scores_gemma":[0.08088372,0.0012373899,0.0025838064,0.00086205435,0.0060963975,0.010671563,0.005134903,0.0065989494,0.0006537358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041553406,0.00080960564,0.014123429,0.0011898623,0.00097270554,0.0012349327,0.0013050158,0.23172188,0.005343094,0.6410008,0.015746668,0.08239679],"study_design_scores_gemma":[0.00029635467,0.00020098136,0.0004756741,0.00008645832,0.00006533932,0.00011167377,0.00017544306,0.30935988,0.002143829,0.68616104,0.0008927723,0.000030597825],"about_ca_topic_score_codex":0.0017641581,"about_ca_topic_score_gemma":0.002372755,"teacher_disagreement_score":0.010548149,"about_ca_system_score_codex":0.002314167,"about_ca_system_score_gemma":0.0028121823,"threshold_uncertainty_score":0.055784583},"labels":[],"label_agreement":null},{"id":"W2749482857","doi":"10.1007/978-3-319-66396-8_3","title":"Overpals, Underlaps, and Underpals","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg; University of Waterloo","funders":"","keywords":"Computer science; Word (group theory); Landmark; Factor (programming language); Natural language processing; Artificial intelligence; Linguistics; Programming language; Philosophy","score_opus":0.019617496920211915,"score_gpt":0.25108628994739307,"score_spread":0.23146879302718115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749482857","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.16497366,0.0075996667,0.16616711,0.0048833443,0.0015850693,0.000085415275,0.0007793711,0.0011546238,0.6527718],"genre_scores_gemma":[0.8541956,0.0037393845,0.022031104,0.0010245439,0.0007684043,0.00008134436,0.0006775384,0.0009186739,0.11656341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902534,0.00016429032,0.00007132198,0.0003070542,0.00021180426,0.00022026553],"domain_scores_gemma":[0.9979225,0.0007028593,0.00016926683,0.00071556907,0.0002931882,0.000196599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874183,0.00057666504,0.0006303594,0.0008460967,0.0018872936,0.004398171,0.0009383127,0.00095977937,0.020234711],"category_scores_gemma":[0.004839049,0.00048961013,0.00067964563,0.0010705787,0.0047218725,0.012157439,0.0046530203,0.002490989,0.004302835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088103974,0.000018738785,0.00072601886,0.0000959429,0.000008685157,0.00027908533,0.0011637036,0.00046080837,0.00073746254,0.9415202,0.0058694184,0.049031768],"study_design_scores_gemma":[0.0000065631907,0.000026975293,0.00043483882,0.000063345506,0.000014825005,0.0006697254,0.0008788984,0.0009970765,0.00084482384,0.94091827,0.055128142,0.000016594811],"about_ca_topic_score_codex":0.0008060445,"about_ca_topic_score_gemma":0.0006812649,"teacher_disagreement_score":0.020234711,"about_ca_system_score_codex":0.00055279554,"about_ca_system_score_gemma":0.0007595507,"threshold_uncertainty_score":0.0676918},"labels":[],"label_agreement":null},{"id":"W2750023530","doi":"10.1007/978-3-319-66396-8_23","title":"Symmetric Dyck Paths and Hooley’s $$\\varDelta $$ Δ -Function","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Lambda; Logarithm; Distribution (mathematics); Path (computing); Physics; Function (biology); Discrete mathematics; Mathematics; Mathematical analysis; Computer science; Quantum mechanics","score_opus":0.0301977659359096,"score_gpt":0.2770450028871304,"score_spread":0.2468472369512208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750023530","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.11751662,0.0044874763,0.22571847,0.0057624183,0.002452881,0.00008177264,0.00047864584,0.00047224548,0.6430295],"genre_scores_gemma":[0.6306666,0.004166333,0.051132657,0.0017622093,0.0008502501,0.0001317205,0.00032289396,0.00090830866,0.3100591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999757,0.00004784413,0.000009869655,0.00005444309,0.00007457026,0.000056277313],"domain_scores_gemma":[0.99958104,0.00013437778,0.000037448655,0.000063378786,0.000109656394,0.00007420692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041669307,0.00092437107,0.0006274392,0.0018864549,0.0017534038,0.0024216957,0.00095471845,0.001652395,0.015523625],"category_scores_gemma":[0.0018431118,0.00039310797,0.0005036746,0.0012270035,0.0027154374,0.0040747486,0.0016825638,0.0033787072,0.003083714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004547691,0.0000027517299,0.00001162528,0.0000068283257,7.4205394e-7,0.000009269172,0.000028132657,0.00010542742,0.000104814186,0.9947525,0.0012651556,0.0037081742],"study_design_scores_gemma":[0.0000037101147,0.000005013307,0.00003738388,0.000009481069,0.00000160408,0.0000690573,0.000036952224,0.0009528077,0.00020679164,0.9886553,0.010015166,0.000006594218],"about_ca_topic_score_codex":0.0010227194,"about_ca_topic_score_gemma":0.0006518265,"teacher_disagreement_score":0.015523625,"about_ca_system_score_codex":0.0014732996,"about_ca_system_score_gemma":0.0007623051,"threshold_uncertainty_score":0.05193168},"labels":[],"label_agreement":null},{"id":"W2750547415","doi":"10.1007/978-3-319-66396-8_6","title":"A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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 Guelph","funders":"","keywords":"De Bruijn sequence; Concatenation (mathematics); Lexicographical order; Sequence (biology); String (physics); Necklace; Computer science; Combinatorics; Shift register; Discrete mathematics; Mathematics; Telecommunications","score_opus":0.03179502160440214,"score_gpt":0.27607926042371983,"score_spread":0.24428423881931768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750547415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12397285,0.0013294133,0.76249826,0.0006272315,0.0018163535,0.0002198246,0.00036339197,0.0021558874,0.107016824],"genre_scores_gemma":[0.5523533,0.0014480393,0.37548918,0.0005170236,0.0005128541,0.0002788378,0.0005734698,0.0010933778,0.06773388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957246,0.0001056764,0.000029798417,0.000108223416,0.00012110569,0.0000627597],"domain_scores_gemma":[0.99956936,0.00015798605,0.00002622235,0.0001513812,0.000058444642,0.000036709516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046204872,0.00065618864,0.0005603653,0.0011467115,0.0011288632,0.0012265759,0.0008983454,0.00083625404,0.008213623],"category_scores_gemma":[0.0012771307,0.0005401537,0.00090785325,0.0012390735,0.0014471689,0.0017074952,0.0014759818,0.0014825411,0.0026435242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001668405,0.00005691466,0.00016945395,0.0002095856,0.000023864142,0.00036465004,0.0002791541,0.003829855,0.02817489,0.8396136,0.003765832,0.12334542],"study_design_scores_gemma":[0.00006922647,0.00027638485,0.0003201198,0.00013831681,0.00008941526,0.0009386157,0.000113758295,0.023845026,0.06531514,0.81251043,0.096269354,0.00011425529],"about_ca_topic_score_codex":0.00038028872,"about_ca_topic_score_gemma":0.00054382463,"teacher_disagreement_score":0.008213623,"about_ca_system_score_codex":0.00042449657,"about_ca_system_score_gemma":0.0007763377,"threshold_uncertainty_score":0.027477264},"labels":[],"label_agreement":null},{"id":"W2750605898","doi":"10.1007/978-3-319-67534-3_17","title":"Uncertainty Driven Multi-loss Fully Convolutional Networks for Histopathology","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Simon Fraser University","funders":"","keywords":"Weighting; Computer science; Leverage (statistics); Convolutional neural network; Inference; Term (time); Artificial intelligence; Function (biology); Algorithm; Pattern recognition (psychology); Machine learning","score_opus":0.025259219229532618,"score_gpt":0.2695038431022251,"score_spread":0.24424462387269247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750605898","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.013145549,0.0036591424,0.97700524,0.0007330844,0.00012580169,0.00003834712,0.00070178055,0.0020492394,0.002541733],"genre_scores_gemma":[0.5535128,0.004731919,0.40997896,0.00057163363,0.00035023605,0.00014885371,0.0029751759,0.0005625433,0.027167927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999711,0.000053369287,0.00001360689,0.000071693525,0.0001042356,0.00004606142],"domain_scores_gemma":[0.9994103,0.00027207826,0.000057470927,0.00009271362,0.00014001368,0.000027578297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010741231,0.0009705025,0.00064906944,0.0007278454,0.00024287181,0.000781005,0.001835197,0.0015960641,0.0029468306],"category_scores_gemma":[0.0022411037,0.0006218585,0.0007868198,0.0006304075,0.00038868628,0.0013544739,0.001429866,0.0015279322,0.0014797738],"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.00019622565,0.00006590329,0.0009258614,0.0001817203,0.00012673545,0.0001247242,0.00003958742,0.41772532,0.0107144825,0.013641117,0.012037584,0.5442208],"study_design_scores_gemma":[0.0000027969745,0.00002303863,0.00030968725,0.000018059705,0.000021423042,0.00007253988,0.0000043842497,0.9824358,0.004155989,0.011034881,0.0019118021,0.000009566725],"about_ca_topic_score_codex":0.004819584,"about_ca_topic_score_gemma":0.008251989,"teacher_disagreement_score":0.004819584,"about_ca_system_score_codex":0.0011718632,"about_ca_system_score_gemma":0.0007359809,"threshold_uncertainty_score":0.009858131},"labels":[],"label_agreement":null},{"id":"W2750689360","doi":"10.1007/978-3-319-73915-1_12","title":"Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bobbin; Embedding; Computer science; Epigraph; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.0235473227802511,"score_gpt":0.26987445797799636,"score_spread":0.24632713519774527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750689360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14488924,0.0016122692,0.59899163,0.001220761,0.0004614273,0.00020294507,0.00059045036,0.0018150108,0.25021625],"genre_scores_gemma":[0.5617087,0.0022475244,0.30311403,0.00042561637,0.00022770805,0.0002042448,0.0012589705,0.0011305051,0.12968275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987376,0.00001828138,0.000004799896,0.000043283813,0.00004041014,0.000019454343],"domain_scores_gemma":[0.9998221,0.000046292687,0.000015026583,0.00004805637,0.000030420057,0.000038223694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015006617,0.0005320688,0.00044038982,0.00092435646,0.00096908695,0.0016489736,0.0007143013,0.0006641077,0.013658139],"category_scores_gemma":[0.0008651526,0.00052356307,0.00039501258,0.000724899,0.00072712376,0.0016634864,0.0010308214,0.0013689682,0.0019637248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088402514,0.000030503868,0.00033029684,0.00014939086,0.000014975141,0.00013068858,0.00043230492,0.009821139,0.008407791,0.8199745,0.014980863,0.14563909],"study_design_scores_gemma":[0.00003163194,0.000041244657,0.00045523394,0.000068820234,0.00002013521,0.000313118,0.00029258864,0.051356334,0.0044302624,0.84603703,0.096929945,0.000023590246],"about_ca_topic_score_codex":0.0016954584,"about_ca_topic_score_gemma":0.0032227046,"teacher_disagreement_score":0.013658139,"about_ca_system_score_codex":0.00066444796,"about_ca_system_score_gemma":0.00033734573,"threshold_uncertainty_score":0.045691013},"labels":[],"label_agreement":null},{"id":"W2750879512","doi":"10.1007/978-3-319-89963-3","title":"Tools and Algorithms for the Construction and Analysis of Systems","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Russian Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; Electronic Components and Systems for European Leadership; Agence Nationale de la Recherche; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Conseil Régional, Île-de-France; European Commission; Universität Passau; Boise State University; Vetenskapsrådet; National Science Foundation; Institut national de recherche en informatique et en automatique (INRIA); Région Auvergne-Rhône-Alpes","keywords":"Computer science; Flexibility (engineering); Reliability (semiconductor); Algorithm; Mathematics","score_opus":0.016007538197037194,"score_gpt":0.2382782236521835,"score_spread":0.22227068545514633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750879512","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.00044371458,0.0023066085,0.9844338,0.0003446355,0.00023004487,0.000031941567,0.00015729225,0.00070444023,0.011347518],"genre_scores_gemma":[0.038998015,0.00831694,0.9316327,0.00040426457,0.0007378192,0.00048235184,0.0010487626,0.0010190487,0.017360209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974256,0.0006133075,0.00017360951,0.00030898312,0.001349164,0.00012923287],"domain_scores_gemma":[0.99707556,0.0018538915,0.000109451656,0.00052101584,0.00037965795,0.00006041457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960966,0.002880466,0.0019439193,0.0026375365,0.0009962508,0.00416661,0.0021601643,0.0014337315,0.011836952],"category_scores_gemma":[0.007886957,0.0015177252,0.0022808416,0.003522863,0.0030744108,0.0048940857,0.00280492,0.00653579,0.0069233347],"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.000018117773,0.000030680225,0.00011857424,0.00045023244,0.000054491502,0.000058578775,0.00014784285,0.0373219,0.0011353563,0.8044566,0.02314253,0.13306512],"study_design_scores_gemma":[0.000015188871,0.000018813058,0.000086463755,0.000086909764,0.00001613084,0.000074052565,0.000028284443,0.08681416,0.00068750203,0.8637353,0.048420206,0.000016960365],"about_ca_topic_score_codex":0.0015174384,"about_ca_topic_score_gemma":0.0011042467,"teacher_disagreement_score":0.011836952,"about_ca_system_score_codex":0.0020518475,"about_ca_system_score_gemma":0.0016900188,"threshold_uncertainty_score":0.039598525},"labels":[],"label_agreement":null},{"id":"W2750933687","doi":"10.1007/978-3-319-67389-9_27","title":"Collage CNN for Renal Cell Carcinoma Detection from CT","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal cell carcinoma treatment","field":"Medicine","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Convolutional neural network; Computer science; Renal cell carcinoma; Artificial intelligence; Malignancy; Radiology; Pattern recognition (psychology); Pathology; Medicine","score_opus":0.02559170055355358,"score_gpt":0.2526624116747015,"score_spread":0.2270707111211479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750933687","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034648374,0.018032437,0.8690119,0.0015525034,0.0021703942,0.00035482517,0.0051881364,0.017901104,0.051140405],"genre_scores_gemma":[0.15959251,0.015054438,0.6855859,0.0014895726,0.0011312582,0.0003541946,0.013358493,0.0037385568,0.11969502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999824,0.000012403926,0.000007889259,0.000051345032,0.00007729746,0.000027064314],"domain_scores_gemma":[0.9998056,0.00005370474,0.000011333196,0.000044050736,0.000072013696,0.000013272298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385711,0.0012299371,0.00052064355,0.00080502435,0.00021105987,0.00077420747,0.0009857152,0.00090175384,0.015516033],"category_scores_gemma":[0.0010120089,0.0005148536,0.00067906483,0.00068364275,0.00016621462,0.001017565,0.0011687295,0.0007382959,0.007720455],"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.00010958357,0.00003167728,0.0010546336,0.00029374257,0.000109774475,0.00030508792,0.00004433441,0.010919904,0.020997921,0.0035720302,0.073493026,0.88906825],"study_design_scores_gemma":[0.000034965113,0.00021519598,0.005813057,0.00034142108,0.00030210798,0.004007681,0.00008594976,0.6247514,0.10839349,0.016122239,0.23983604,0.00009653837],"about_ca_topic_score_codex":0.0036541356,"about_ca_topic_score_gemma":0.0075191376,"teacher_disagreement_score":0.015516033,"about_ca_system_score_codex":0.00047303273,"about_ca_system_score_gemma":0.00043273566,"threshold_uncertainty_score":0.051906347},"labels":[],"label_agreement":null},{"id":"W2750998536","doi":"10.1007/978-3-319-66179-7_7","title":"An Unbiased Penalty for Sparse Classification with Application to Neuroimaging Data","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical Methods and Inference","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":"University of Alberta","funders":"","keywords":"Computer science; Neuroimaging; Artificial intelligence; Pattern recognition (psychology); Machine learning; Neuroscience","score_opus":0.21587524380423603,"score_gpt":0.41594307705860667,"score_spread":0.20006783325437064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750998536","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.0012612037,0.00015815951,0.99789655,0.00013764128,0.000039273877,0.00001920298,0.000040950028,0.00014984899,0.00029708553],"genre_scores_gemma":[0.06690694,0.00066730427,0.92615336,0.00024879066,0.00033787126,0.00027175868,0.00052262394,0.00038670545,0.004504572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749446,0.0013484434,0.00013036444,0.000267328,0.0006314243,0.0001281095],"domain_scores_gemma":[0.98777604,0.008575114,0.0005601134,0.0011802426,0.0015434241,0.00036513343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055026086,0.0008530627,0.0017348503,0.0012064127,0.0006867959,0.0013518024,0.002543907,0.0022950547,0.003934856],"category_scores_gemma":[0.026046868,0.00072881643,0.0010195281,0.0021258024,0.0017902658,0.0020241106,0.003780322,0.003486932,0.0012863936],"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.00034365282,0.00016845408,0.0013500985,0.0005263872,0.00013687933,0.00025345775,0.00019763949,0.2818075,0.0070664887,0.2172847,0.017338015,0.47352672],"study_design_scores_gemma":[0.00001834267,0.00003217974,0.0001836356,0.000026852533,0.000011825899,0.00009018432,0.000011063791,0.9328015,0.0007951679,0.06347044,0.002542997,0.000015873682],"about_ca_topic_score_codex":0.002048352,"about_ca_topic_score_gemma":0.0029855585,"teacher_disagreement_score":0.0055026086,"about_ca_system_score_codex":0.0006074894,"about_ca_system_score_gemma":0.0016140983,"threshold_uncertainty_score":0.029100955},"labels":[],"label_agreement":null},{"id":"W2751237624","doi":"10.1007/978-3-540-88425-5_7","title":"A Note on Attribute Reduction in the Decision-Theoretic Rough Set Model","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Reduction (mathematics); Attribute domain; Computer science; Probabilistic logic; Monotonic function; Set (abstract data type); Interpretation (philosophy); Dominance-based rough set approach; Decision table; Data mining; Decision rule; Artificial intelligence; Algorithm; Mathematics","score_opus":0.03217125286784099,"score_gpt":0.26748339122124776,"score_spread":0.23531213835340675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751237624","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.0036021685,0.009241346,0.95584846,0.0062712403,0.0014148755,0.00008595537,0.00022174005,0.00014994327,0.023164324],"genre_scores_gemma":[0.20741934,0.016949615,0.7491367,0.0025408024,0.0045978646,0.0004126639,0.00052663445,0.00029122288,0.018125216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994408,0.0024976104,0.00031389552,0.00060807605,0.0019689866,0.00020338957],"domain_scores_gemma":[0.9948678,0.003641831,0.00015062779,0.00087352324,0.00037887297,0.000087306806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006512838,0.0011223834,0.0026379756,0.0023784915,0.0012875833,0.004846695,0.0027984055,0.0018000749,0.004079723],"category_scores_gemma":[0.010527253,0.0010137815,0.0049505173,0.004169397,0.004775481,0.008206712,0.003940925,0.008562317,0.0013266797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025213392,0.0000351536,0.00007840122,0.00015305718,0.00006453649,0.00007213043,0.00017438302,0.013397893,0.0002870512,0.9547433,0.0038139208,0.027154852],"study_design_scores_gemma":[0.0000044305443,0.000013309931,0.00004083628,0.000024418245,0.000020031572,0.000030792078,0.0000152247185,0.014195284,0.00013231723,0.9787562,0.0067507992,0.000016360209],"about_ca_topic_score_codex":0.0023210568,"about_ca_topic_score_gemma":0.001546058,"teacher_disagreement_score":0.006512838,"about_ca_system_score_codex":0.0020843719,"about_ca_system_score_gemma":0.0014317369,"threshold_uncertainty_score":0.034443557},"labels":[],"label_agreement":null},{"id":"W2751388822","doi":"10.1007/978-3-319-66182-7_41","title":"Selecting the Optimal Sequence for Deformable Registration of Microscopy Image Sequences Using Two-Stage MST-based Clustering Algorithm","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Alberta","funders":"","keywords":"Image registration; Computer science; Artificial intelligence; Similarity (geometry); Minimum spanning tree; Cluster analysis; Computer vision; Pattern recognition (psychology); Algorithm; Image (mathematics); Sequence (biology); Entropy (arrow of time)","score_opus":0.04695458422143553,"score_gpt":0.350202337896891,"score_spread":0.3032477536754554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751388822","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.0149932485,0.00015327401,0.9829364,0.00005896433,0.000033118602,0.000071383394,0.00007367506,0.0007984462,0.0008813996],"genre_scores_gemma":[0.06949493,0.00022072373,0.92779094,0.000028181565,0.00001387462,0.00010926481,0.00038079487,0.0003070946,0.0016541466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999655,0.000049425846,0.00002703513,0.000096902615,0.00013156378,0.00004007172],"domain_scores_gemma":[0.9996425,0.00007472494,0.000048352267,0.00005149586,0.00015672245,0.000026244134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361394,0.0007979407,0.00078544434,0.0015408135,0.00061294093,0.00068894285,0.0010016804,0.0010459896,0.0033045795],"category_scores_gemma":[0.0015289547,0.0005598032,0.0010522136,0.0016723434,0.0004326783,0.0010056085,0.0007257972,0.00088258914,0.0019094225],"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.00035369812,0.00014589583,0.0010372524,0.000422879,0.00007819435,0.00021349124,0.00025375985,0.09043214,0.28979725,0.009153594,0.0047421423,0.6033698],"study_design_scores_gemma":[0.000016281381,0.0001109854,0.0013534245,0.000036519225,0.00004612493,0.00039352055,0.000094312716,0.8802717,0.1052516,0.006171933,0.0061995885,0.000053919997],"about_ca_topic_score_codex":0.0034052327,"about_ca_topic_score_gemma":0.004882794,"teacher_disagreement_score":0.0034052327,"about_ca_system_score_codex":0.0005379369,"about_ca_system_score_gemma":0.0015402781,"threshold_uncertainty_score":0.0110548735},"labels":[],"label_agreement":null},{"id":"W2751545277","doi":"10.1007/978-3-319-73915-1_16","title":"EPG-representations with Small Grid-Size","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa; Carleton University; University of Waterloo","funders":"","keywords":"Treewidth; Pathwidth; Combinatorics; Monotone polygon; Bounded function; Mathematics; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Grid; Chordal graph; Graph; Line graph; Geometry","score_opus":0.028752380461927893,"score_gpt":0.28799816126131905,"score_spread":0.25924578079939115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751545277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06063934,0.00051788235,0.80684,0.0011543166,0.0008969963,0.00020423866,0.0016088354,0.006375462,0.121762924],"genre_scores_gemma":[0.4597349,0.0007745923,0.45931962,0.000980356,0.00038076387,0.00046612366,0.0036437034,0.004112595,0.07058738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948287,0.00012088644,0.00003451301,0.000101308375,0.00016661643,0.00009381904],"domain_scores_gemma":[0.9983181,0.0003937387,0.000063160194,0.0008857728,0.00020819118,0.00013112584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004719322,0.0007103115,0.0006364826,0.0008882424,0.00069986586,0.0020905123,0.001246825,0.0012138862,0.03170213],"category_scores_gemma":[0.0038854508,0.00037743853,0.0005911404,0.0013702236,0.0008764626,0.003883351,0.0026195305,0.0028594367,0.008483987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031041197,0.0001723868,0.00039233238,0.0003239526,0.000030623123,0.00029683457,0.00023272318,0.016846297,0.007934464,0.67609066,0.046152107,0.25121716],"study_design_scores_gemma":[0.000051990937,0.000045582783,0.00016469952,0.000050802697,0.000022454708,0.00021474784,0.0001015943,0.04907373,0.0037421752,0.91359717,0.03291608,0.000018966064],"about_ca_topic_score_codex":0.00045093926,"about_ca_topic_score_gemma":0.00093059224,"teacher_disagreement_score":0.03170213,"about_ca_system_score_codex":0.00038838494,"about_ca_system_score_gemma":0.00043235876,"threshold_uncertainty_score":0.10605419},"labels":[],"label_agreement":null},{"id":"W2751547494","doi":"10.1007/978-3-319-67217-5_29","title":"An Analysis of Individuals’ Behavior Change in Online Groups","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Affordance; Demographics; Joins; Computer science; Internet privacy; Social group; Behavior change; Group (periodic table); Group behavior; Psychology; Social psychology; World Wide Web; Human–computer interaction","score_opus":0.06647104263059221,"score_gpt":0.3699359980148006,"score_spread":0.30346495538420837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751547494","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.99065864,0.000072587754,0.0054921047,0.000105894236,0.000010199158,0.000040708295,0.00037963907,0.000047671678,0.0031925794],"genre_scores_gemma":[0.9956208,0.000024264216,0.0025149966,0.000011918672,0.000006253886,0.00003317825,0.0003697146,0.000009458146,0.0014093982],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994191,0.0003199144,0.000015827978,0.000097102755,0.000088578905,0.000059568458],"domain_scores_gemma":[0.9957696,0.0032243107,0.00029070122,0.00023671985,0.0002882616,0.0001905093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008930895,0.00019079952,0.00027226438,0.0013993564,0.00050564716,0.00066653366,0.00052449486,0.00039071112,0.0053786384],"category_scores_gemma":[0.004199455,0.00011072293,0.00053895696,0.0016431249,0.0003899851,0.0006880531,0.00044938055,0.0004752206,0.0005376573],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00201684,0.0020706428,0.74240816,0.00023536774,0.0005050411,0.00030422505,0.0077813715,0.017788785,0.008473474,0.012179079,0.0039065336,0.20233044],"study_design_scores_gemma":[0.000025654654,0.00068536977,0.858102,0.00002069144,0.000121209945,0.0001788552,0.005422603,0.12440006,0.0021618553,0.005975459,0.002870679,0.000035551377],"about_ca_topic_score_codex":0.009278614,"about_ca_topic_score_gemma":0.008175199,"teacher_disagreement_score":0.009278614,"about_ca_system_score_codex":0.00069886947,"about_ca_system_score_gemma":0.00030937014,"threshold_uncertainty_score":0.018449247},"labels":[],"label_agreement":null},{"id":"W2751602042","doi":"10.1007/978-3-319-67534-3_13","title":"SwifTree: Interactive Extraction of 3D Trees Supporting Gaming and Crowdsourcing","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","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":"Computer science; Segmentation; Crowdsourcing; Robustness (evolution); Tree (set theory); Artificial intelligence; Software; Data mining; Machine learning; Pattern recognition (psychology); World Wide Web","score_opus":0.009299112628253458,"score_gpt":0.24591953462002372,"score_spread":0.23662042199177027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751602042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01168095,0.0006292857,0.91665,0.0001808139,0.0002510058,0.0003249034,0.0060888086,0.055124536,0.009069682],"genre_scores_gemma":[0.10780825,0.00075972785,0.8497412,0.00021357863,0.00008648562,0.00041581583,0.017202001,0.010672589,0.013100351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949396,0.000046494562,0.000022694394,0.00011693403,0.00025706543,0.00006286678],"domain_scores_gemma":[0.99955386,0.00019850952,0.000017805201,0.000107827655,0.000077503166,0.000044608303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174447,0.0018063354,0.0012926438,0.0022072596,0.0009109045,0.0022384578,0.0027204822,0.0012968113,0.021871671],"category_scores_gemma":[0.0016040937,0.0013002675,0.0018649369,0.0017402504,0.00044378074,0.0015362573,0.0035616187,0.0012792062,0.010191733],"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.0005234381,0.00022627343,0.0014700105,0.0010717199,0.00031844978,0.0006462405,0.0009214825,0.03802773,0.074642256,0.01108713,0.121321574,0.7497437],"study_design_scores_gemma":[0.00015694337,0.00011397756,0.0029980103,0.00026950575,0.00012151887,0.0009829042,0.00056263374,0.73376215,0.054469727,0.038745888,0.16758844,0.0002282696],"about_ca_topic_score_codex":0.010546263,"about_ca_topic_score_gemma":0.029247954,"teacher_disagreement_score":0.021871671,"about_ca_system_score_codex":0.00044280378,"about_ca_system_score_gemma":0.0009308086,"threshold_uncertainty_score":0.07316798},"labels":[],"label_agreement":null},{"id":"W2751865213","doi":"10.1007/978-3-319-67534-3_3","title":"Robust Automatic Graph-Based Skeletonization of Hepatic Vascular Trees","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Skeletonization; Computer science; Binary tree; Algorithm; Segmentation; Context (archaeology); Artificial intelligence; Network topology; Image segmentation; Tree (set theory); Pattern recognition (psychology); Computer vision; Mathematics","score_opus":0.01985515983384144,"score_gpt":0.257547274109903,"score_spread":0.23769211427606157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751865213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023750387,0.00050062797,0.9697781,0.000102906575,0.00004371273,0.00007529423,0.00028746945,0.0039336,0.001527805],"genre_scores_gemma":[0.1595441,0.00076892524,0.831978,0.000092564034,0.00006831554,0.00006720607,0.0013006438,0.0016351616,0.004545095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996424,0.00005446458,0.000017368957,0.000086065054,0.00014954389,0.000050183786],"domain_scores_gemma":[0.9994373,0.00016312148,0.00007583561,0.00013094311,0.0001564184,0.000036363217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040290307,0.00097070687,0.0010000246,0.0024145974,0.00028946705,0.0012220418,0.001120467,0.0011790448,0.0042424314],"category_scores_gemma":[0.0011290621,0.0006972781,0.000934377,0.0014866061,0.0003989352,0.0007183224,0.0009560639,0.0009950309,0.0023925924],"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.00035136074,0.00008811395,0.0011288723,0.00029939934,0.00008947355,0.0002616231,0.000115237344,0.05956985,0.19061239,0.003511666,0.007684919,0.7362872],"study_design_scores_gemma":[0.000033084398,0.00008748857,0.0031798617,0.000043270516,0.00007607333,0.00097459735,0.000052387648,0.9245803,0.059948526,0.0048203045,0.006156647,0.0000474116],"about_ca_topic_score_codex":0.0022721437,"about_ca_topic_score_gemma":0.005240482,"teacher_disagreement_score":0.0042424314,"about_ca_system_score_codex":0.00030390118,"about_ca_system_score_gemma":0.0007764221,"threshold_uncertainty_score":0.014192283},"labels":[],"label_agreement":null},{"id":"W2751873700","doi":"10.1007/978-3-319-66179-7_55","title":"Hierarchical Multimodal Fusion of Deep-Learned Lesion and Tissue Integrity Features in Brain MRIs for Distinguishing Neuromyelitis Optica from Multiple Sclerosis","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Photoacoustic and Ultrasonic Imaging","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Neuromyelitis optica; Multiple sclerosis; Medicine; Lesion; Pathology; Neuroscience; Psychology","score_opus":0.026841789889843398,"score_gpt":0.25677515845130106,"score_spread":0.22993336856145766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751873700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42049366,0.01235355,0.5560383,0.0010736183,0.00033785313,0.00015653318,0.0023815741,0.0025536325,0.004611273],"genre_scores_gemma":[0.8991574,0.0022899783,0.09238685,0.00022929054,0.0001981092,0.00007618192,0.0023568189,0.00011039325,0.0031950467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998455,0.00002697975,0.000010911527,0.000037846155,0.00003731815,0.00004138878],"domain_scores_gemma":[0.99979645,0.00008206347,0.00002859753,0.000021803004,0.000052121635,0.000018971885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006056109,0.00070121215,0.0005078137,0.00082435453,0.00014654457,0.00059624895,0.0005578357,0.0007061673,0.000883093],"category_scores_gemma":[0.0009618381,0.00022463623,0.00074692426,0.00055544893,0.00020260313,0.00064047356,0.0008378305,0.0006387237,0.00048055185],"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.0006432051,0.00026276233,0.006772518,0.00027361553,0.00031413193,0.00036505162,0.0001383079,0.08278805,0.08012803,0.0012771748,0.007877227,0.8191599],"study_design_scores_gemma":[0.000020960173,0.0002477498,0.013116173,0.000069365065,0.00020855005,0.00051418785,0.00009744983,0.95333064,0.02588659,0.0044076443,0.0020574143,0.00004329204],"about_ca_topic_score_codex":0.0023106236,"about_ca_topic_score_gemma":0.005707988,"teacher_disagreement_score":0.0023106236,"about_ca_system_score_codex":0.00024545207,"about_ca_system_score_gemma":0.00037010972,"threshold_uncertainty_score":0.0045943856},"labels":[],"label_agreement":null},{"id":"W2752480115","doi":"10.1007/978-3-319-68015-6_10","title":"An Automated Change Impact Analysis Approach to GRL Models","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Concordia University","funders":"","keywords":"Computer science; Eclipse; Identification (biology); Notation; Software engineering; Requirements engineering; Feature (linguistics); Systems engineering; Programming language; Software; Engineering","score_opus":0.09494665104405178,"score_gpt":0.3545499519873834,"score_spread":0.2596033009433316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752480115","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.005073029,0.00008059393,0.9797227,0.00018584456,0.000033904056,0.00021784757,0.00050937315,0.0071514435,0.007025262],"genre_scores_gemma":[0.16534781,0.00015186719,0.8246443,0.00011698022,0.000045714532,0.00028946946,0.0017653264,0.0016013266,0.006037131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747723,0.0005259762,0.00012157547,0.00028472548,0.0014366648,0.00015382658],"domain_scores_gemma":[0.99552554,0.001904072,0.00032322458,0.0012001292,0.0009694079,0.00007753759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019602962,0.0011717511,0.0008454705,0.0036269717,0.0009884075,0.0032573955,0.0025176827,0.0011139043,0.012283031],"category_scores_gemma":[0.009752465,0.00076496525,0.0022471265,0.0020461103,0.0010931616,0.0034661894,0.0030321374,0.0021446692,0.003198212],"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.00016860168,0.00029632426,0.0028972712,0.0004410486,0.00015210918,0.0005061894,0.0007863231,0.26492533,0.009262832,0.22612727,0.014487409,0.47994927],"study_design_scores_gemma":[0.00001809363,0.000025376232,0.0003375302,0.000042459513,0.000046518013,0.00007856659,0.00009894216,0.8893997,0.0040749125,0.09136365,0.01449052,0.000023713552],"about_ca_topic_score_codex":0.006928086,"about_ca_topic_score_gemma":0.01232491,"teacher_disagreement_score":0.012283031,"about_ca_system_score_codex":0.0017170658,"about_ca_system_score_gemma":0.0019437114,"threshold_uncertainty_score":0.041090846},"labels":[],"label_agreement":null},{"id":"W2752523716","doi":"10.1007/978-3-319-67810-8_4","title":"Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Duopoly; Quality (philosophy); Computer science; Market segmentation; Product differentiation; Product (mathematics); Variance (accounting); Microeconomics; Marketing; Industrial organization; Business; Economics; Mathematics","score_opus":0.17459267778383067,"score_gpt":0.3713541399553001,"score_spread":0.19676146217146942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752523716","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.74432904,0.0007246478,0.20935501,0.0018221292,0.000053823318,0.00005394336,0.00021224936,0.00009367547,0.04335544],"genre_scores_gemma":[0.98835605,0.00020639061,0.0059125987,0.00005008772,0.00002148782,0.000012008495,0.000029188282,0.000010809733,0.005401245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956757,0.0001951208,0.000010922308,0.00007306655,0.00007409447,0.00007921267],"domain_scores_gemma":[0.99805945,0.0013475857,0.00019283411,0.000111199144,0.00014377496,0.00014515362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229523,0.0002993511,0.00059973646,0.0003582969,0.00044223663,0.0021211072,0.0008215052,0.0011798711,0.006737196],"category_scores_gemma":[0.0043482883,0.00034851968,0.00044444072,0.0008093089,0.001033403,0.0028145823,0.0009337648,0.0010763853,0.00037863266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072760624,0.0001857243,0.004043784,0.00019533213,0.00009787916,0.00042247947,0.0004551431,0.32311398,0.009534723,0.60909706,0.0031970753,0.04892918],"study_design_scores_gemma":[0.00004518329,0.00013528054,0.0029260505,0.00002796719,0.00004108975,0.00014260091,0.0003012948,0.6008916,0.0009320165,0.39310288,0.0014197447,0.00003426027],"about_ca_topic_score_codex":0.0018243358,"about_ca_topic_score_gemma":0.002159368,"teacher_disagreement_score":0.006737196,"about_ca_system_score_codex":0.002169825,"about_ca_system_score_gemma":0.00040828125,"threshold_uncertainty_score":0.022538185},"labels":[],"label_agreement":null},{"id":"W2752711830","doi":"10.1007/978-3-319-67389-9_21","title":"Scalable and Fault Tolerant Platform for Distributed Learning on Private Medical Data","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 British Columbia","funders":"","keywords":"Computer science; Scalability; Liveness; Fault tolerance; Source code; Information privacy; Distributed computing; Distributed Computing Environment; Node (physics); Data mining; Machine learning; Artificial intelligence; Computer security; Database; Operating system","score_opus":0.05038944196134968,"score_gpt":0.2985221052096372,"score_spread":0.2481326632482875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752711830","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.074791685,0.0007975299,0.8951274,0.00173528,0.0006858811,0.00049629965,0.0008423651,0.019440744,0.0060828696],"genre_scores_gemma":[0.7698017,0.00032461266,0.21686728,0.00046839198,0.00031084247,0.00037089328,0.0017082402,0.00026347616,0.009884613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.00012346226,0.000067920344,0.00018476121,0.0003392379,0.00015518532],"domain_scores_gemma":[0.9980495,0.00039984725,0.00013072026,0.0008180722,0.0003120286,0.00028976236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010637033,0.00047365605,0.0010462446,0.00069695193,0.0008406102,0.0015016649,0.0029642377,0.0010179427,0.005324785],"category_scores_gemma":[0.0031002997,0.00032304449,0.00054328196,0.000644702,0.0006253714,0.0023422898,0.004123426,0.0015112924,0.0018383107],"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.0039761886,0.0014029385,0.0069385744,0.00055528077,0.0003577631,0.0018177411,0.00056163175,0.17032866,0.06656323,0.06459918,0.08715198,0.59574676],"study_design_scores_gemma":[0.00018654807,0.00028594828,0.0010620627,0.000025264455,0.000055092303,0.00040805186,0.00010672642,0.9215604,0.022009503,0.041856855,0.012398129,0.000045384557],"about_ca_topic_score_codex":0.0007691614,"about_ca_topic_score_gemma":0.00078077137,"teacher_disagreement_score":0.005324785,"about_ca_system_score_codex":0.00070733216,"about_ca_system_score_gemma":0.0013278206,"threshold_uncertainty_score":0.017813146},"labels":[],"label_agreement":null},{"id":"W2752901554","doi":"10.1007/978-3-319-67008-9_52","title":"Environmental Monitoring of Libraries with MonTreAL","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"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":"Computer science; Internet of Things; Virtualization; The Internet; Single-board computer; Wireless sensor network; World Wide Web; Telecommunications; Operating system; Cloud computing","score_opus":0.01319557423222779,"score_gpt":0.21004166971873423,"score_spread":0.19684609548650644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752901554","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.8402404,0.0015991138,0.0017977468,0.0011229775,0.00008754682,0.00013261261,0.019399466,0.0006106414,0.13500944],"genre_scores_gemma":[0.9617871,0.0006745476,0.0017834494,0.000100709265,0.00003331698,0.000023118662,0.003513983,0.00006414719,0.032019474],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972445,0.00002019613,0.000006295739,0.00007246479,0.00011411515,0.000062374085],"domain_scores_gemma":[0.99972576,0.000011157133,0.000034579258,0.000009537951,0.00016756756,0.0000514383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017674362,0.00033313362,0.0002054515,0.0017119102,0.0018571651,0.0012195128,0.0007171131,0.00026428874,0.0065966304],"category_scores_gemma":[0.00033805144,0.00012306285,0.00023501704,0.005331937,0.00040471656,0.00047131453,0.0007390752,0.00033823506,0.000825816],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050432706,0.00017978014,0.7468753,0.00033192977,0.00015816897,0.0012945986,0.006290288,0.0051999064,0.017500127,0.0027391221,0.050149545,0.16877694],"study_design_scores_gemma":[0.0000050213566,0.000044148157,0.94441694,0.00003371117,0.000029546876,0.000074646836,0.0028487411,0.0013728674,0.0023197837,0.00009825664,0.048726495,0.000029911533],"about_ca_topic_score_codex":0.9180665,"about_ca_topic_score_gemma":0.97833395,"teacher_disagreement_score":0.9180665,"about_ca_system_score_codex":0.007921961,"about_ca_system_score_gemma":0.0057283044,"threshold_uncertainty_score":0.164832},"labels":[],"label_agreement":null},{"id":"W2752921939","doi":"10.1007/978-3-319-67615-9_16","title":"Virtual Sophrologist: A Virtual Reality Neurofeedback Relaxation Training System","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mindfulness and Compassion Interventions","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Neurofeedback; Headset; Relaxation (psychology); Meditation; Computer science; Virtual reality; Anxiety; Session (web analytics); Interval (graph theory); Electroencephalography; Artificial intelligence; Psychology; World Wide Web; Psychiatry; Social psychology; Mathematics","score_opus":0.06848459240170124,"score_gpt":0.3266140185075036,"score_spread":0.25812942610580236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752921939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17378172,0.006046,0.6809478,0.0010239197,0.0012180487,0.000857811,0.0020248878,0.026464997,0.1076348],"genre_scores_gemma":[0.45280734,0.0038815704,0.25332862,0.0014670668,0.00036907088,0.00083505694,0.002454776,0.0014954202,0.28336114],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991024,0.000017131357,0.0000041255003,0.000021004074,0.00003631557,0.000011073142],"domain_scores_gemma":[0.99994326,0.000018049795,0.0000029967366,0.000007907617,0.000011902172,0.000015906391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019201243,0.00048763095,0.00025203242,0.0002594354,0.0002245373,0.00037248924,0.0007784294,0.00052206556,0.018753203],"category_scores_gemma":[0.00020789063,0.00025995783,0.0002664494,0.00010931078,0.0001267438,0.00033449507,0.0007109986,0.00039491127,0.0030913006],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085677154,0.00047771542,0.0010574702,0.0004154891,0.00008663961,0.000397595,0.0005286769,0.0023080143,0.21716157,0.002550744,0.035347987,0.73881125],"study_design_scores_gemma":[0.00061501184,0.005638289,0.041388877,0.00038543978,0.0006033293,0.009834542,0.00050323736,0.090335496,0.18410487,0.0033122632,0.66283154,0.00044705998],"about_ca_topic_score_codex":0.0007729484,"about_ca_topic_score_gemma":0.0013664496,"teacher_disagreement_score":0.018753203,"about_ca_system_score_codex":0.000108484,"about_ca_system_score_gemma":0.00021922728,"threshold_uncertainty_score":0.06273568},"labels":[],"label_agreement":null},{"id":"W2752960145","doi":"10.1007/978-3-319-65000-5","title":"Business Process Management","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Innsbruck; Alpen-Adria-Universität Klagenfurt; LOEWE Zentrum AdRIA; Libera Università di Bolzano; Humboldt-Universität zu Berlin; University of California, San Diego; Universidade de Coimbra; University of New South Wales; Memorial University of Newfoundland; Universiteit Gent; Universität Wien; Danmarks Tekniske Universitet; University of Haifa; Universidade de São Paulo; Fondazione Bruno Kessler; Cairo University; KU Leuven; Universität Ulm; Technische Universiteit Eindhoven; Politecnico di Torino; Vrije Universiteit Amsterdam; Tallinna Tehnikaülikool; Università degli Studi di Trento; Universidad de Sevilla; Queensland University of Technology; Universität Potsdam; Pusan National University","keywords":"Computer science; Business process discovery; Business decision mapping; Influence diagram; Decision tree; Decision support system; Decision analysis; Process mining; Process (computing); Decision engineering; Decision model; Business process; Business Process Model and Notation; Decision rule; Process modeling; Data science; Business process modeling; Data mining; Artificial intelligence; Work in process; Machine learning","score_opus":0.017831036793957398,"score_gpt":0.2590400722557251,"score_spread":0.24120903546176772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752960145","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074876775,0.0040433365,0.4963193,0.005254268,0.0009485155,0.0007724662,0.0017832774,0.007971021,0.47542027],"genre_scores_gemma":[0.23557207,0.0072292397,0.34716126,0.002198982,0.00085310114,0.00084549945,0.010109137,0.0016275232,0.39440328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967663,0.0006106131,0.00018953379,0.00041246857,0.001815344,0.00020569089],"domain_scores_gemma":[0.9971745,0.00052915147,0.00017329026,0.0008963364,0.001042642,0.00018406885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032289631,0.0007422719,0.00047983983,0.0026123854,0.0011497698,0.0065726223,0.0014066437,0.0012166041,0.036363985],"category_scores_gemma":[0.006236842,0.00041393732,0.00067820534,0.0037949262,0.00052266405,0.0038203695,0.0017437007,0.0014083392,0.026080178],"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.00005505178,0.00016426714,0.00074498024,0.0001895974,0.000032535027,0.000076493816,0.00031072137,0.0021119192,0.0036583934,0.19433337,0.052933235,0.7453894],"study_design_scores_gemma":[0.000027484199,0.0000728751,0.0011817544,0.00018531119,0.000040632494,0.00019766235,0.0002520357,0.01976825,0.007940476,0.122430824,0.8478739,0.000028675664],"about_ca_topic_score_codex":0.0017847813,"about_ca_topic_score_gemma":0.0010782753,"teacher_disagreement_score":0.036363985,"about_ca_system_score_codex":0.0014547784,"about_ca_system_score_gemma":0.00238636,"threshold_uncertainty_score":0.12164968},"labels":[],"label_agreement":null},{"id":"W2752963666","doi":"10.1007/978-3-319-67810-8_5","title":"High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"","keywords":"Degree (music); Conjecture; Preferential attachment; Social network (sociolinguistics); Degree distribution; Network structure","score_opus":0.02074343870545918,"score_gpt":0.26289645666923916,"score_spread":0.24215301796377997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752963666","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.7468853,0.003280616,0.23418495,0.0036691243,0.00013250773,0.00008720995,0.0005814271,0.00024306028,0.010935783],"genre_scores_gemma":[0.9876996,0.0014117148,0.0057456777,0.00010274877,0.00013221342,0.00005911585,0.00015963077,0.000041942487,0.0046473015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984326,0.00079352636,0.000057328747,0.00029936995,0.00021196525,0.000205217],"domain_scores_gemma":[0.96420383,0.028936934,0.0036897413,0.00097265793,0.0008570036,0.0013398527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025477854,0.0007329702,0.0011150701,0.0025417625,0.0015127128,0.0039945105,0.0020319412,0.0035027827,0.004205937],"category_scores_gemma":[0.033766676,0.0012884487,0.0009945926,0.001962752,0.0035046309,0.0053886166,0.0024494857,0.0025371572,0.00055351015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037400043,0.00015342903,0.020229267,0.00032659652,0.00021515066,0.000634802,0.0019913325,0.50074226,0.0025419672,0.4476851,0.0042410004,0.020865085],"study_design_scores_gemma":[0.000056529374,0.00006321548,0.0048282486,0.00007969099,0.00007216328,0.00037078967,0.00044527088,0.5611301,0.0004162675,0.431064,0.0014166767,0.00005703928],"about_ca_topic_score_codex":0.0047691213,"about_ca_topic_score_gemma":0.0038757718,"teacher_disagreement_score":0.0047691213,"about_ca_system_score_codex":0.0016665887,"about_ca_system_score_gemma":0.00046689593,"threshold_uncertainty_score":0.014070272},"labels":[],"label_agreement":null},{"id":"W2752998754","doi":"10.1007/978-3-319-66182-7_14","title":"Unsupervised Discovery of Spatially-Informed Lung Texture Patterns for Pulmonary Emphysema: The MESA COPD Study","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Chronic Obstructive Pulmonary Disease (COPD) Research","field":"Medicine","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":"McGill University Health Centre","funders":"National Center for Research Resources; National Heart, Lung, and Blood Institute; National Institutes of Health","keywords":"Pulmonary emphysema; COPD; Lung; Computer science; Texture (cosmology); Artificial intelligence; Spatial analysis; Pattern recognition (psychology); Medicine; Radiology; Image (mathematics); Internal medicine; Mathematics; Statistics","score_opus":0.022117434898872326,"score_gpt":0.3269417378348001,"score_spread":0.30482430293592777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752998754","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.98422563,0.0006708347,0.013721128,0.00010979074,0.000012917149,0.00002616747,0.0005891812,0.00008927201,0.0005550457],"genre_scores_gemma":[0.98712665,0.00022999276,0.010646314,0.000025669233,0.000030777617,0.000013400647,0.0011854541,0.00003651445,0.0007052397],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997377,0.00008956214,0.000016042226,0.00007612415,0.00004968851,0.000030788426],"domain_scores_gemma":[0.9985952,0.00070741505,0.00016767537,0.0002785255,0.00013981572,0.0001112094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008741415,0.0003024787,0.0004997508,0.001125571,0.0002469257,0.0007882591,0.00040521455,0.0004620721,0.00057218596],"category_scores_gemma":[0.0023726039,0.00022876478,0.0006375624,0.00056127005,0.00038415837,0.0003991937,0.00062881305,0.00045007828,0.00023576147],"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.004141478,0.0012593016,0.5049602,0.0005075714,0.0012740291,0.0011413959,0.0010398258,0.018747477,0.11926964,0.0026423207,0.0054001566,0.33961657],"study_design_scores_gemma":[0.00020350539,0.00070896564,0.70195913,0.00006837156,0.0005777377,0.0030843972,0.0013356173,0.26132217,0.020299643,0.004937947,0.005412191,0.00009035571],"about_ca_topic_score_codex":0.0017667919,"about_ca_topic_score_gemma":0.0054542157,"teacher_disagreement_score":0.0017667919,"about_ca_system_score_codex":0.0001352244,"about_ca_system_score_gemma":0.00030337402,"threshold_uncertainty_score":0.004622996},"labels":[],"label_agreement":null},{"id":"W2753002091","doi":"10.1007/978-3-319-66182-7_71","title":"q-Space Upsampling Using x-q Space Regularization","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Institute on Aging; National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institute of Mental Health; National Institute on Alcohol Abuse and Alcoholism","keywords":"Upsampling; Computer science; Interpolation (computer graphics); Regularization (linguistics); Algorithm; Space (punctuation); ENCODE; Diffusion MRI; Graph; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Image (mathematics)","score_opus":0.07985640111280169,"score_gpt":0.3800472213559094,"score_spread":0.3001908202431077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753002091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030127943,0.000101013444,0.99595463,0.000079720056,0.00003991745,0.000023658518,0.000034629855,0.00023062066,0.0005230261],"genre_scores_gemma":[0.094736144,0.0002587866,0.90106153,0.00019401974,0.00008092019,0.000089311776,0.00027684087,0.00018461655,0.0031178256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994537,0.00017341244,0.000032004526,0.00008112012,0.00020031176,0.0000593813],"domain_scores_gemma":[0.999094,0.00031974353,0.000055650275,0.00025107828,0.00021911177,0.000060413222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001659169,0.0007147633,0.0008668148,0.00066712435,0.00043524726,0.0010691432,0.0011085264,0.0014193193,0.00428009],"category_scores_gemma":[0.0031001964,0.00045291212,0.0010646366,0.00092920737,0.0007093533,0.00096326927,0.0016428134,0.0016577999,0.0011829817],"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.0005582932,0.00031157274,0.002019438,0.00041034239,0.00022910199,0.00022244963,0.00025958478,0.2698912,0.06191754,0.13468671,0.012972742,0.5165211],"study_design_scores_gemma":[0.000017332228,0.000024668341,0.00018040283,0.00000985518,0.000016952312,0.00006385824,0.0000136648405,0.98083717,0.005663118,0.009951719,0.0032118752,0.000009482453],"about_ca_topic_score_codex":0.00458282,"about_ca_topic_score_gemma":0.0050119986,"teacher_disagreement_score":0.00458282,"about_ca_system_score_codex":0.00043278388,"about_ca_system_score_gemma":0.0013791445,"threshold_uncertainty_score":0.014318347},"labels":[],"label_agreement":null},{"id":"W2753119246","doi":"10.1007/978-3-319-66182-7_90","title":"Combining Spatial and Non-spatial Dictionary Learning for Automated Labeling of Intra-ventricular Hemorrhage in Neonatal Brain MRI","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Hospital for Sick Children","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Pattern recognition (psychology)","score_opus":0.009544921901032342,"score_gpt":0.2640576360688589,"score_spread":0.25451271416782656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753119246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03584333,0.0015498814,0.95936763,0.00020704046,0.0000726001,0.000062668754,0.00024764662,0.0009947442,0.0016545751],"genre_scores_gemma":[0.21678604,0.002058785,0.7755142,0.00020125126,0.00011641656,0.00008252313,0.0011099667,0.00036365452,0.0037671728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.00009002789,0.000029840161,0.00009681333,0.00010741306,0.00005207538],"domain_scores_gemma":[0.9993075,0.00026976306,0.00006381474,0.000102958234,0.00021792683,0.000037982347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092748617,0.00064209994,0.0007989294,0.0011036005,0.000272206,0.0010418404,0.0009538497,0.00095369027,0.0011727823],"category_scores_gemma":[0.0016577677,0.00037284556,0.00087768194,0.0012004828,0.00036782722,0.001023197,0.0011781652,0.00074298313,0.0010386028],"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.00017614648,0.000087139975,0.0022348643,0.00023768813,0.00012281373,0.00009157133,0.000093427116,0.039832357,0.05208139,0.0021941843,0.0033343995,0.89951396],"study_design_scores_gemma":[0.000014631913,0.00013556975,0.0021652014,0.0000409319,0.00009401905,0.0005349925,0.00009716491,0.9574889,0.031181537,0.0051894016,0.0030295488,0.000028151162],"about_ca_topic_score_codex":0.0025721558,"about_ca_topic_score_gemma":0.006734842,"teacher_disagreement_score":0.0025721558,"about_ca_system_score_codex":0.00028327937,"about_ca_system_score_gemma":0.00069316797,"threshold_uncertainty_score":0.005114436},"labels":[],"label_agreement":null},{"id":"W2753134290","doi":"10.1007/978-3-319-66179-7_70","title":"Segmentation-Free Kidney Localization and Volume Estimation Using Aggregated Orthogonal Decision CNNs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal and Vascular Pathologies","field":"Medicine","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Initialization; Artificial intelligence; Segmentation; Convolutional neural network; Volume (thermodynamics); Feature (linguistics); Pattern recognition (psychology); Image segmentation; Representation (politics)","score_opus":0.025839100189553762,"score_gpt":0.29209353551168754,"score_spread":0.2662544353221338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753134290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019600702,0.0006357216,0.97462726,0.00015140056,0.00012583104,0.000037274414,0.00036519716,0.0017312514,0.0027255027],"genre_scores_gemma":[0.40241468,0.0012762616,0.58018047,0.00037703943,0.00022397895,0.000093384035,0.0022297853,0.0004952955,0.012709043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971086,0.000026099313,0.000014041027,0.000097325,0.000091182905,0.00006047895],"domain_scores_gemma":[0.99967384,0.000076394914,0.00003439749,0.000077202094,0.00011227441,0.00002581969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202038,0.00085013825,0.0008620782,0.0006312013,0.00021502197,0.0010734674,0.0011650737,0.0008911633,0.0031883477],"category_scores_gemma":[0.0010551221,0.0006148012,0.0009797418,0.00082228455,0.00025776544,0.0010416296,0.0014529203,0.00096592883,0.001558573],"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.00025336427,0.00008937448,0.0018317137,0.00014365575,0.00017967846,0.00016976269,0.000049815408,0.11762696,0.05041903,0.004937611,0.0072611347,0.8170379],"study_design_scores_gemma":[0.000005443352,0.000033399123,0.0010345274,0.000016073029,0.000040233666,0.00017502694,0.000010732799,0.9807633,0.012408524,0.0034275656,0.002071192,0.000013991283],"about_ca_topic_score_codex":0.0045649544,"about_ca_topic_score_gemma":0.009652536,"teacher_disagreement_score":0.0045649544,"about_ca_system_score_codex":0.00048731564,"about_ca_system_score_gemma":0.0007389051,"threshold_uncertainty_score":0.010666072},"labels":[],"label_agreement":null},{"id":"W2753376032","doi":"10.1007/978-3-319-67434-6_13","title":"A Dictionary Learning-Based Fast Imaging Method for Ultrasound Elastography","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Elastography; Computer science; Artificial intelligence; Beamforming; Imaging phantom; Computer vision; Ultrasound; Acoustics; Optics; Physics; Telecommunications","score_opus":0.010948206189663873,"score_gpt":0.2787305310855711,"score_spread":0.26778232489590725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753376032","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.00049792114,0.00026770186,0.9983999,0.00004775217,0.00006720925,0.0000136410345,0.000039748757,0.00022122558,0.00044482824],"genre_scores_gemma":[0.011843514,0.00088785565,0.9812548,0.00010693555,0.00012196722,0.00006397842,0.0002567676,0.00020131771,0.00526289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962354,0.00007703377,0.000024654131,0.000072996314,0.00017676341,0.000024988747],"domain_scores_gemma":[0.99912673,0.0003909924,0.000044243763,0.000116646974,0.00027637248,0.00004512995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064013305,0.0007533543,0.00079408236,0.0007777261,0.00037471703,0.0009511309,0.0010969442,0.0012070115,0.008267206],"category_scores_gemma":[0.0019390428,0.00045145367,0.0007545473,0.0012381143,0.0004409987,0.0012038953,0.0015018715,0.0020172459,0.004525759],"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.00014759855,0.00006539467,0.00020002236,0.00029062037,0.000056722154,0.000087206725,0.00006368502,0.04342029,0.04854603,0.021973945,0.011773504,0.873375],"study_design_scores_gemma":[0.000025022502,0.00007866757,0.00024659492,0.000037031223,0.000026288459,0.00051278906,0.000024297135,0.94821644,0.017877014,0.011534455,0.021382144,0.00003931887],"about_ca_topic_score_codex":0.0015974302,"about_ca_topic_score_gemma":0.0023902967,"teacher_disagreement_score":0.008267206,"about_ca_system_score_codex":0.00026779692,"about_ca_system_score_gemma":0.0006811461,"threshold_uncertainty_score":0.027656496},"labels":[],"label_agreement":null},{"id":"W2753491256","doi":"10.1007/978-3-319-67543-5","title":"Computer Assisted and Robotic Endoscopy and Clinical Image-Based Procedures","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Gastrointestinal Bleeding Diagnosis and Treatment","field":"Medicine","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":"McGill University","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Endoscopy; Image (mathematics); Computer graphics (images); Surgery; Medicine","score_opus":0.03240286932855094,"score_gpt":0.330756550009326,"score_spread":0.29835368068077506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753491256","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046588583,0.62285316,0.08066736,0.0032026737,0.011494867,0.00015914137,0.0005126834,0.0013209406,0.27513036],"genre_scores_gemma":[0.02266675,0.3414183,0.05461948,0.003295229,0.01549332,0.00017607125,0.0010342313,0.0004966571,0.56079996],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995976,0.000049168484,0.000019372279,0.00007565113,0.00023567092,0.000022508526],"domain_scores_gemma":[0.9995721,0.00021007918,0.000024923916,0.00004657613,0.00008239515,0.00006397406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039110854,0.0015318291,0.00091588113,0.0018737687,0.0002379411,0.0014402206,0.0009372262,0.0012973198,0.030251712],"category_scores_gemma":[0.0009227637,0.0004575634,0.0007371085,0.0019178039,0.0007486331,0.002037695,0.0013235877,0.0018920098,0.014936495],"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.000095349846,0.00010011168,0.00029542285,0.0012709931,0.000039868035,0.00032702935,0.0001225731,0.0020317375,0.00619212,0.016386896,0.17315105,0.7999868],"study_design_scores_gemma":[0.000017419095,0.00017982845,0.003008754,0.0008121323,0.00002974146,0.005637966,0.00006886259,0.0028489174,0.0017055913,0.02189624,0.9637375,0.000057194153],"about_ca_topic_score_codex":0.00040036748,"about_ca_topic_score_gemma":0.0011428032,"teacher_disagreement_score":0.030251712,"about_ca_system_score_codex":0.00038623586,"about_ca_system_score_gemma":0.0005656082,"threshold_uncertainty_score":0.10120207},"labels":[],"label_agreement":null},{"id":"W2753575712","doi":"10.1007/978-3-319-67615-9_18","title":"Using Electroencephalograms to Interpret and Monitor the Emotions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Speech recognition","score_opus":0.041948641483246535,"score_gpt":0.3063557507625021,"score_spread":0.2644071092792556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753575712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049956467,0.054157306,0.7499804,0.0015564744,0.0018403489,0.00025514956,0.002516956,0.004051054,0.13568585],"genre_scores_gemma":[0.42040145,0.06929193,0.41792318,0.0014471256,0.0017462692,0.0003368385,0.0017892125,0.0008115273,0.08625248],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998957,0.000017490658,0.000006400426,0.000024771156,0.000048624104,0.0000069167427],"domain_scores_gemma":[0.99987495,0.00008035001,0.000009641297,0.000011241781,0.000019722942,0.0000041016838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023472703,0.00065002777,0.00022616143,0.0006107101,0.000082129416,0.0013379527,0.00046116405,0.0006828399,0.0057947366],"category_scores_gemma":[0.00067573984,0.00017955861,0.0002841509,0.0009507771,0.00026014898,0.00082804484,0.00030314765,0.00053076976,0.0029672468],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087139044,0.000041812204,0.0010875665,0.0005216064,0.00008696636,0.00022391848,0.00014382812,0.0013456639,0.13821623,0.0037358457,0.012323878,0.8421855],"study_design_scores_gemma":[0.0001807274,0.00069340505,0.05937032,0.0012958169,0.0006666262,0.008935376,0.000885936,0.08602713,0.3787321,0.08938184,0.37355265,0.0002781271],"about_ca_topic_score_codex":0.00030519324,"about_ca_topic_score_gemma":0.00055460277,"teacher_disagreement_score":0.0057947366,"about_ca_system_score_codex":0.000082881095,"about_ca_system_score_gemma":0.00008162045,"threshold_uncertainty_score":0.019385338},"labels":[],"label_agreement":null},{"id":"W2753594375","doi":"10.1007/978-3-319-67615-9_12","title":"Real-time Brain Assessment for Adaptive Virtual Reality Game : A Neurofeedback Approach","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neurofeedback; Computer science; Virtual reality; Context (archaeology); Brain–computer interface; Human–computer interaction; Cognition; Video game; Action (physics); Multimedia; Electroencephalography; Psychology; Neuroscience","score_opus":0.05258989675448635,"score_gpt":0.3145760134729776,"score_spread":0.26198611671849126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753594375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113516256,0.007937231,0.8469446,0.0006193826,0.00028541905,0.00049762195,0.00024410858,0.0011508062,0.028804611],"genre_scores_gemma":[0.7744692,0.004429461,0.20256884,0.00037957673,0.00021382837,0.00040792508,0.00016690556,0.00010099313,0.017263314],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987495,0.00002965687,0.0000058185146,0.0000307477,0.000046544457,0.000012284315],"domain_scores_gemma":[0.99989367,0.0000498081,0.000007171651,0.000006589593,0.000034160268,0.000008547319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025772516,0.000576167,0.0002761163,0.00026008178,0.00011298145,0.00051080174,0.0005681785,0.00051915715,0.0034906103],"category_scores_gemma":[0.00046460459,0.00009744844,0.0002529349,0.00014736752,0.00015147665,0.0003442754,0.0003653059,0.00030888623,0.0005410312],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046164065,0.00040613537,0.0006174914,0.00044935325,0.00006403372,0.00014716486,0.0001647249,0.005909082,0.38388857,0.0025583373,0.00238057,0.60295296],"study_design_scores_gemma":[0.00029747334,0.0065547707,0.038026556,0.0005182432,0.00085602293,0.0056315428,0.00064999936,0.5162258,0.36248854,0.018906238,0.04963122,0.00021349305],"about_ca_topic_score_codex":0.0006195522,"about_ca_topic_score_gemma":0.0013503059,"teacher_disagreement_score":0.0034906103,"about_ca_system_score_codex":0.00012209354,"about_ca_system_score_gemma":0.00020972005,"threshold_uncertainty_score":0.011677206},"labels":[],"label_agreement":null},{"id":"W2753619787","doi":"10.1007/978-3-319-66185-8_44","title":"Analysis of Periodicity in Video Sequences Through Dynamic Linear Modeling","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Non-Invasive Vital Sign Monitoring","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":"Western University","funders":"","keywords":"Computer science; Range (aeronautics); Algorithm; Artificial intelligence; Computer vision","score_opus":0.02313986586083245,"score_gpt":0.26597259080870855,"score_spread":0.2428327249478761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753619787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01637985,0.0003278808,0.9824698,0.00005120503,0.00002253179,0.000017028955,0.000084883715,0.00017767523,0.0004691324],"genre_scores_gemma":[0.69826454,0.0016259064,0.29467165,0.000060621616,0.00012885974,0.00016098777,0.00094197807,0.00020713311,0.003938223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967015,0.00007454437,0.000021688145,0.00009618482,0.00010076757,0.0000366121],"domain_scores_gemma":[0.99886394,0.0008035964,0.00011981096,0.00006875344,0.000117749696,0.000026231597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786094,0.00066088093,0.00069691177,0.00075315224,0.00022410418,0.0006611966,0.0006102403,0.0004961165,0.0010391546],"category_scores_gemma":[0.0033717314,0.00044314726,0.00066853,0.00083062745,0.00030610384,0.00078193366,0.0004630028,0.00083505764,0.00036492076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024274565,0.000100926554,0.0030510246,0.0003157574,0.00012981566,0.0002835275,0.00015624537,0.64672273,0.02442272,0.023212124,0.0017575057,0.29960495],"study_design_scores_gemma":[0.000001643294,0.000012952162,0.00043342917,0.000005752126,0.0000061685764,0.00002912389,0.000005856723,0.99633694,0.0009108758,0.0020158223,0.00023758477,0.0000038327944],"about_ca_topic_score_codex":0.0022942438,"about_ca_topic_score_gemma":0.0020195819,"teacher_disagreement_score":0.0022942438,"about_ca_system_score_codex":0.00033655696,"about_ca_system_score_gemma":0.00044954335,"threshold_uncertainty_score":0.004561782},"labels":[],"label_agreement":null},{"id":"W2753679934","doi":"10.1007/978-3-319-66185-8_68","title":"Real-Time 3D Ultrasound Reconstruction and Visualization in the Context of Laparoscopy","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Visualization; Context (archaeology); Laparoscopy; Computer graphics (images); Computer vision; Artificial intelligence; Radiology; Medicine; Geology","score_opus":0.024542542045045142,"score_gpt":0.3058351351779745,"score_spread":0.28129259313292937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753679934","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.023685396,0.06136941,0.82191515,0.0019813688,0.0016370192,0.000093486495,0.00026244903,0.0016120615,0.08744363],"genre_scores_gemma":[0.29824036,0.08761685,0.50148785,0.0006573241,0.001607945,0.00012055896,0.00047164294,0.0008133855,0.10898402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977034,0.000055444292,0.000010054818,0.000026781414,0.00011789656,0.000019534276],"domain_scores_gemma":[0.9996623,0.00023428733,0.000015959653,0.000029067225,0.000035380763,0.000023050472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034957737,0.00049806543,0.00034731202,0.00040678572,0.00016882538,0.0017370692,0.000958443,0.0009931996,0.008803225],"category_scores_gemma":[0.001324343,0.0004146166,0.00042454453,0.0005660491,0.0005373402,0.0011097795,0.001044286,0.0012174926,0.0017085017],"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.0002160724,0.00009242593,0.00061734783,0.0013005296,0.000030205909,0.001839355,0.0009644008,0.032780748,0.06503019,0.07723622,0.024988906,0.7949036],"study_design_scores_gemma":[0.000049145052,0.0006379919,0.00480641,0.0018949185,0.00007674573,0.032261387,0.0010434099,0.1800599,0.05534089,0.10285132,0.6206933,0.00028460135],"about_ca_topic_score_codex":0.0003152493,"about_ca_topic_score_gemma":0.00048809318,"teacher_disagreement_score":0.008803225,"about_ca_system_score_codex":0.0001752805,"about_ca_system_score_gemma":0.00031514803,"threshold_uncertainty_score":0.029449701},"labels":[],"label_agreement":null},{"id":"W2753814260","doi":"10.1007/978-3-319-67159-8_5","title":"Interactive Computation and Visualization of Structural Connectomes in Real-Time","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"Engineering and Physical Sciences Research Council; Medical Research Council","keywords":"Visualization; Computer science; Graph drawing; Connectome; GRASP; Connectomics; Computation; Theoretical computer science; Graph; Node (physics); Enhanced Data Rates for GSM Evolution; On the fly; Graph theory; Perspective (graphical); Artificial intelligence; Algorithm; Functional connectivity; Mathematics; Engineering","score_opus":0.03936564957441193,"score_gpt":0.37807853417676957,"score_spread":0.33871288460235766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753814260","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.024417743,0.0008115485,0.95073664,0.00089286134,0.00016378149,0.00008737654,0.0016161046,0.015702736,0.0055712187],"genre_scores_gemma":[0.20621847,0.0019843678,0.77591896,0.00030499644,0.0001862009,0.00032147602,0.002082973,0.0038431084,0.0091395285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983084,0.000032687014,0.00001043511,0.000032503733,0.00006972691,0.00002371506],"domain_scores_gemma":[0.9990491,0.00064879877,0.00004455581,0.00008821588,0.00009192144,0.00007735897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006292783,0.0010015635,0.0006072147,0.0013417574,0.0004452341,0.0028716922,0.001497824,0.0011463286,0.025700014],"category_scores_gemma":[0.0023692101,0.0005770136,0.0008579137,0.0012085151,0.00048275533,0.0012406483,0.0016904507,0.0012305441,0.002539049],"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.0009746511,0.00018555528,0.0016917629,0.0017045772,0.0003393414,0.0012758204,0.0014946494,0.17913885,0.13806829,0.04451901,0.07123437,0.5593731],"study_design_scores_gemma":[0.00013931369,0.00008334111,0.002259366,0.00015758107,0.00008686765,0.0009407294,0.0002780059,0.85836554,0.035784084,0.060858034,0.04093576,0.00011136543],"about_ca_topic_score_codex":0.0026469901,"about_ca_topic_score_gemma":0.0063008936,"teacher_disagreement_score":0.025700014,"about_ca_system_score_codex":0.00048781643,"about_ca_system_score_gemma":0.00065573264,"threshold_uncertainty_score":0.08597505},"labels":[],"label_agreement":null},{"id":"W2754041308","doi":"10.1007/978-3-319-67777-4_32","title":"Probabilistic Hypergraph Optimization for Salient Object Detection","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"Hypergraph; Pairwise comparison; Salient; Probabilistic logic; Computer science; Graph; Representation (politics); Artificial intelligence; Similarity (geometry); Pattern recognition (psychology); Correlation; Spatial relation; Object (grammar); Theoretical computer science; Algorithm; Mathematics; Image (mathematics); Combinatorics","score_opus":0.021472624464643875,"score_gpt":0.26772546936050945,"score_spread":0.24625284489586557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754041308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027902513,0.00043647728,0.9949102,0.00019326474,0.00003912947,0.000030915722,0.00009968522,0.00061372394,0.0008864572],"genre_scores_gemma":[0.19819152,0.0012012882,0.7841311,0.00048267117,0.00040927413,0.00037400555,0.0012433333,0.0013457428,0.012621068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922097,0.0002615816,0.000028576545,0.00024395855,0.0001684781,0.00007641968],"domain_scores_gemma":[0.99758196,0.001796723,0.00011530685,0.00018150023,0.00023347803,0.00009102015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012891042,0.0016152429,0.0027870263,0.0018350721,0.00061327545,0.0015538787,0.0033947777,0.0029457621,0.006736341],"category_scores_gemma":[0.0064081308,0.0016011077,0.001487324,0.0021978468,0.0012576807,0.0026148974,0.0024532077,0.0025548902,0.0017144752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018671404,0.00011428435,0.000308833,0.00031027896,0.00014552748,0.000081661856,0.00009412723,0.66581047,0.0046057976,0.030313244,0.015208286,0.28282082],"study_design_scores_gemma":[0.0000057476013,0.000008108,0.000048631395,0.0000064081282,0.000006013155,0.000011257507,0.000004048442,0.9837689,0.00027998298,0.015439969,0.0004163958,0.0000044426138],"about_ca_topic_score_codex":0.010499093,"about_ca_topic_score_gemma":0.009378687,"teacher_disagreement_score":0.010499093,"about_ca_system_score_codex":0.001913192,"about_ca_system_score_gemma":0.0014238084,"threshold_uncertainty_score":0.022535324},"labels":[],"label_agreement":null},{"id":"W2754123320","doi":"10.1007/978-3-319-67979-2_1","title":"The Similarity Distribution of Paralogous Gene Pairs Created by Recurrent Alternation of Polyploidization and Fractionation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological Sciences","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 Ottawa","funders":"","keywords":"Alternation (linguistics); Similarity (geometry); Computer science; Fractionation; Artificial intelligence; Linguistics; Chemistry; Philosophy","score_opus":0.015686343575103817,"score_gpt":0.23042662451836834,"score_spread":0.21474028094326453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754123320","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.9813188,0.0004577333,0.0155077,0.000031230567,0.000016052314,0.000011059961,0.00031247298,0.000120022414,0.0022249639],"genre_scores_gemma":[0.99155384,0.00017770246,0.0059546265,0.000027658645,0.000007880322,0.00001467202,0.0007363968,0.00008139599,0.0014458217],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997503,0.0000268838,0.000014976649,0.000115547016,0.000067072186,0.000025130586],"domain_scores_gemma":[0.99943596,0.00023055708,0.00010590389,0.000080170255,0.0000648036,0.00008253893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027997198,0.00010130503,0.00032141112,0.0007787647,0.00019437655,0.00056004815,0.00036892763,0.00039706277,0.0024668938],"category_scores_gemma":[0.0008000916,0.00015758465,0.00025952174,0.00070347387,0.00033477866,0.0006080951,0.00037053545,0.00047810242,0.0007109034],"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.00020609924,0.000017771108,0.003060666,0.000039075363,0.000018765306,0.00007442675,0.000053030857,0.00040195603,0.98531586,0.0014334775,0.00010291188,0.009275891],"study_design_scores_gemma":[0.000043666176,0.00043794434,0.1331904,0.0000127559415,0.0001365588,0.0024413697,0.000288406,0.03532185,0.8154985,0.007982717,0.004595434,0.000050397164],"about_ca_topic_score_codex":0.00017787958,"about_ca_topic_score_gemma":0.00021525766,"teacher_disagreement_score":0.0024668938,"about_ca_system_score_codex":0.00026383682,"about_ca_system_score_gemma":0.00012123504,"threshold_uncertainty_score":0.008252561},"labels":[],"label_agreement":null},{"id":"W2754257508","doi":"10.1007/978-3-319-67675-3_4","title":"Graph Geodesics to Find Progressively Similar Skin Lesion Images","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Geodesic; Artificial intelligence; Convolutional neural network; Shortest path problem; Skin lesion; Graph; Pattern recognition (psychology); Lesion; Computer vision; Mathematics; Medicine; Pathology; Theoretical computer science","score_opus":0.023380924015056485,"score_gpt":0.2826313340139591,"score_spread":0.25925040999890264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754257508","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.061640345,0.0016202027,0.92439944,0.00042314536,0.00019800475,0.00027627114,0.0011657362,0.0059572845,0.004319556],"genre_scores_gemma":[0.16708942,0.0010352033,0.8187826,0.00017898782,0.00010125088,0.00013279662,0.003577047,0.0013192041,0.007783423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995364,0.000056961417,0.000026639036,0.00014842823,0.00019060016,0.00004086661],"domain_scores_gemma":[0.99932516,0.00021955742,0.00006873679,0.00012514039,0.00020806458,0.000053315016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004749611,0.0012466576,0.0012893424,0.0044225943,0.00054382824,0.0011064897,0.0015708414,0.0012254559,0.0043482985],"category_scores_gemma":[0.002435575,0.00069157575,0.0013990673,0.003551537,0.0006136406,0.001081976,0.0013929384,0.0012021535,0.002040496],"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.00043682568,0.0001896721,0.0021001785,0.00043736494,0.00027065544,0.00024677228,0.00029818586,0.10776685,0.031859975,0.012125175,0.017629413,0.826639],"study_design_scores_gemma":[0.000044447097,0.00012344778,0.0014625115,0.00004133552,0.000080045604,0.0003361294,0.00012468491,0.9626034,0.008735462,0.018499704,0.007922101,0.000026672415],"about_ca_topic_score_codex":0.013022341,"about_ca_topic_score_gemma":0.017184043,"teacher_disagreement_score":0.013022341,"about_ca_system_score_codex":0.00084884727,"about_ca_system_score_gemma":0.0010757975,"threshold_uncertainty_score":0.025893092},"labels":[],"label_agreement":null},{"id":"W2754375282","doi":"10.1007/978-3-319-67979-2_2","title":"A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Gene duplication; Joins; Segmental duplication; Computer science; Genome; Descendant; Context (archaeology); Gene; Join (topology); Genetics; Biology; Algorithm; Combinatorics; Gene family; Mathematics","score_opus":0.016029355772590664,"score_gpt":0.22797697004693618,"score_spread":0.21194761427434552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754375282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01463576,0.00056642375,0.95987517,0.0009450691,0.00015820019,0.000079707075,0.0004703603,0.0003370833,0.022932235],"genre_scores_gemma":[0.33007652,0.0013640523,0.6137166,0.0007682244,0.00066547084,0.0004308167,0.0015566616,0.00080000184,0.050621696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983273,0.00039114407,0.00006515118,0.0005894572,0.0004370476,0.00019000412],"domain_scores_gemma":[0.99590826,0.0027860487,0.00021788177,0.0007122938,0.00021868885,0.00015680074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016090744,0.0010154374,0.0016618345,0.00086801074,0.0012315137,0.0030810563,0.005207577,0.0023951957,0.014034434],"category_scores_gemma":[0.009691479,0.00078009686,0.0019437651,0.0027546515,0.0025832877,0.00641145,0.0030289895,0.0045984318,0.0019306182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000860661,0.000049280476,0.00026813053,0.00016625025,0.000049040013,0.00020555437,0.0001546425,0.053784855,0.0015029797,0.8874058,0.011301863,0.04502556],"study_design_scores_gemma":[0.000030158837,0.000017931921,0.00008646484,0.000015136958,0.000022989389,0.00013327456,0.000034275097,0.11821505,0.0005668294,0.87440956,0.006454966,0.000013332763],"about_ca_topic_score_codex":0.00294147,"about_ca_topic_score_gemma":0.0030611064,"teacher_disagreement_score":0.014034434,"about_ca_system_score_codex":0.0021834134,"about_ca_system_score_gemma":0.0018624044,"threshold_uncertainty_score":0.046949804},"labels":[],"label_agreement":null},{"id":"W2755098915","doi":"10.1007/978-3-319-67675-3_9","title":"White Matter Fiber Segmentation Using Functional Varifolds","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"École de Technologie Supérieure","funders":"","keywords":"Fiber; Computer science; Artificial intelligence; Materials science; Composite material","score_opus":0.06946542090999351,"score_gpt":0.33812976724214705,"score_spread":0.2686643463321535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755098915","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.0055026277,0.0005891506,0.99029505,0.00012927315,0.000055500095,0.000021107488,0.00021988008,0.0018283881,0.0013590369],"genre_scores_gemma":[0.0468121,0.0012910728,0.9425971,0.000070309936,0.000100748155,0.000043079817,0.0005938586,0.001142302,0.007349411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998368,0.000019669707,0.000013378111,0.000061038634,0.000049549057,0.000019486712],"domain_scores_gemma":[0.99958295,0.00013289193,0.00004577322,0.00009293832,0.00011867633,0.000026795911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007414628,0.0010159832,0.00080083875,0.0022178718,0.0004710637,0.0017467254,0.00086760975,0.0011753248,0.0058244504],"category_scores_gemma":[0.00095437333,0.0007510139,0.0012302739,0.0017956285,0.0005073879,0.001908375,0.0009317948,0.0009245459,0.0033943567],"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.000112643975,0.000029218445,0.0012118391,0.00036201926,0.00014835563,0.00014389602,0.00017068595,0.03299826,0.07903085,0.015120575,0.008580907,0.8620907],"study_design_scores_gemma":[0.000017504375,0.00007953257,0.004012181,0.00021189702,0.00014348296,0.0013162632,0.00013576017,0.7896801,0.099472836,0.07330973,0.031527206,0.00009349517],"about_ca_topic_score_codex":0.0021230762,"about_ca_topic_score_gemma":0.0033640824,"teacher_disagreement_score":0.0058244504,"about_ca_system_score_codex":0.0003996167,"about_ca_system_score_gemma":0.0007039913,"threshold_uncertainty_score":0.019484699},"labels":[],"label_agreement":null},{"id":"W2755102112","doi":"10.1007/978-3-319-67786-6_3","title":"Real-Time Validation of Retail Gasoline Prices","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Gasoline; Computer science; Range (aeronautics); Econometrics; Current (fluid); Operations research; Economics; Mathematics","score_opus":0.026002687880979317,"score_gpt":0.25210108368761763,"score_spread":0.22609839580663832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755102112","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.9109057,0.0003259976,0.079476476,0.00014126422,0.00025399902,0.00006000976,0.0014914287,0.0031564075,0.004188771],"genre_scores_gemma":[0.9870929,0.00003345027,0.009908819,0.00003422008,0.0000163664,0.000019540008,0.0014388779,0.000078985264,0.0013768208],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990533,0.00024330126,0.000056497178,0.00022747615,0.0003424579,0.00007710475],"domain_scores_gemma":[0.99738866,0.0012960433,0.00021190725,0.0004862861,0.0005555717,0.000061554594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000978338,0.00050326914,0.0003111413,0.00061436364,0.0001883555,0.0007002134,0.0011604622,0.0009351452,0.0023449913],"category_scores_gemma":[0.0048454558,0.00022711266,0.0002121512,0.00043838896,0.00030073474,0.0006325494,0.00050715194,0.0004737062,0.001601764],"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.0067565185,0.0016466127,0.10676639,0.0005650803,0.0004946739,0.0012293069,0.00042087905,0.1833731,0.24228422,0.0035429387,0.010865206,0.44205514],"study_design_scores_gemma":[0.00010346157,0.0004129805,0.03485017,0.000022740694,0.000032588647,0.00039392558,0.00007313548,0.8887997,0.07235495,0.00085343834,0.0020616688,0.000041116076],"about_ca_topic_score_codex":0.0019949698,"about_ca_topic_score_gemma":0.0024037918,"teacher_disagreement_score":0.0023449913,"about_ca_system_score_codex":0.00027449208,"about_ca_system_score_gemma":0.00025767848,"threshold_uncertainty_score":0.007844806},"labels":[],"label_agreement":null},{"id":"W2755200468","doi":"10.1007/978-3-319-67910-5_24","title":"Impact of Simulation Environment in Performance Evaluation of Protocols for WSNs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Computer science; Wireless sensor network; Protocol (science); Distributed computing; Network topology; Communications protocol; Throughput; Duty cycle; Computer network; Range (aeronautics); Wireless; Power (physics); Telecommunications","score_opus":0.0486635051956627,"score_gpt":0.3328758956638116,"score_spread":0.2842123904681489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755200468","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.8084116,0.004698669,0.16973414,0.0011346553,0.00048698662,0.0003499522,0.0007027758,0.0021635008,0.012317713],"genre_scores_gemma":[0.9714314,0.00085511914,0.026058827,0.000072680064,0.000044705714,0.000099407924,0.00036717622,0.00025993524,0.0008107815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9876254,0.008361739,0.0007318485,0.00054726395,0.002208727,0.00052500976],"domain_scores_gemma":[0.9137133,0.07607303,0.0015919771,0.0033109763,0.0046459013,0.00066478574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008961347,0.0011930674,0.000906004,0.0011986934,0.0007071647,0.0018433557,0.0011473648,0.0009967407,0.0015030517],"category_scores_gemma":[0.0534164,0.0005254168,0.00053472904,0.0015849324,0.0006862437,0.0026528274,0.0011565341,0.0010591783,0.00024085476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004291514,0.0009676381,0.011819399,0.0004917944,0.00033085,0.00015997654,0.00022019338,0.8739766,0.013347867,0.005249665,0.0016098067,0.08753474],"study_design_scores_gemma":[0.00008707638,0.0010131496,0.002201428,0.00006215091,0.00016765966,0.00012189174,0.000103924096,0.9775662,0.015574899,0.0021214453,0.00094714615,0.00003307629],"about_ca_topic_score_codex":0.0031567959,"about_ca_topic_score_gemma":0.0028086852,"teacher_disagreement_score":0.008961347,"about_ca_system_score_codex":0.0013342351,"about_ca_system_score_gemma":0.0013243594,"threshold_uncertainty_score":0.047392726},"labels":[],"label_agreement":null},{"id":"W2756297985","doi":"10.1007/978-3-319-67549-7_1","title":"Fragility-Oriented Testing with Model Execution and Reinforcement Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Carleton University","funders":"","keywords":"Fragility; Reinforcement learning; Computer science; Reinforcement; Stress testing (software); Artificial intelligence; Engineering; Operating system; Structural engineering","score_opus":0.02738793666073401,"score_gpt":0.2561419108886857,"score_spread":0.22875397422795168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756297985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009562295,0.00021665813,0.98495966,0.00011240612,0.000027368975,0.00003741473,0.000020991167,0.0010989138,0.003964242],"genre_scores_gemma":[0.5392058,0.00029684807,0.45537412,0.00009236029,0.00004344377,0.00013378996,0.0001288115,0.00032357586,0.004401328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903107,0.00038079344,0.00004319626,0.00012959552,0.00033219575,0.000083230654],"domain_scores_gemma":[0.99690175,0.0022057584,0.00016561341,0.0004054073,0.00024813364,0.00007325776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012529877,0.001110598,0.0006877715,0.0006989874,0.00026136095,0.0007055269,0.0018602762,0.0009026346,0.0035631845],"category_scores_gemma":[0.006046169,0.0004829761,0.0008584764,0.0005293546,0.00095431297,0.001515466,0.0013266533,0.0018504902,0.0004962036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001570185,0.0001736282,0.00080520485,0.00016470956,0.00006869738,0.00012168271,0.00007831426,0.6971131,0.005045162,0.056960832,0.00200629,0.23730543],"study_design_scores_gemma":[0.0000101221385,0.000028129256,0.00007588744,0.000012175026,0.000008803446,0.00003637919,0.000004157922,0.9589361,0.0016039426,0.038701694,0.0005775215,0.000005125386],"about_ca_topic_score_codex":0.0012962735,"about_ca_topic_score_gemma":0.0016662913,"teacher_disagreement_score":0.0035631845,"about_ca_system_score_codex":0.00070331123,"about_ca_system_score_gemma":0.00070385204,"threshold_uncertainty_score":0.0119200945},"labels":[],"label_agreement":null},{"id":"W2756339378","doi":"10.1007/978-3-319-67549-7_8","title":"From Passive to Active FSM Inference via Checking Sequence Construction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"TRACE (psycholinguistics); Inference; Sequence (biology); Computer science; Finite-state machine; A priori and a posteriori; Set (abstract data type); Model checking; Solver; Algorithm; Reset (finance); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.020546046712473887,"score_gpt":0.28608513160102855,"score_spread":0.26553908488855466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756339378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033088736,0.00013112476,0.98810786,0.0003551508,0.00014458706,0.00005556892,0.00013773245,0.0026430176,0.005116094],"genre_scores_gemma":[0.32823285,0.00042705509,0.65499777,0.0010057243,0.00032546144,0.0002836762,0.0012502727,0.0029576023,0.010519659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99279284,0.002245819,0.00040558836,0.0017040232,0.0023434635,0.00050825183],"domain_scores_gemma":[0.97995365,0.012379589,0.00033001785,0.005537923,0.0015321613,0.00026662296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056816973,0.0013548041,0.0011189635,0.0018929302,0.0014503365,0.0032730557,0.0053094747,0.0023525578,0.011430586],"category_scores_gemma":[0.024660593,0.0017390712,0.003053652,0.001178571,0.00518656,0.010022314,0.0077593797,0.0069820974,0.0031977803],"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.00028640497,0.0001921459,0.00088664534,0.0005517702,0.000111724476,0.0003106924,0.0007612835,0.021538349,0.0091738785,0.74661434,0.00953641,0.21003623],"study_design_scores_gemma":[0.000031326395,0.00003583733,0.0001214391,0.00009344978,0.00009467088,0.00011281153,0.00005188041,0.09263799,0.0106384205,0.8877527,0.00839978,0.000029694327],"about_ca_topic_score_codex":0.001917761,"about_ca_topic_score_gemma":0.002969441,"teacher_disagreement_score":0.011430586,"about_ca_system_score_codex":0.0014525253,"about_ca_system_score_gemma":0.002773167,"threshold_uncertainty_score":0.03823912},"labels":[],"label_agreement":null},{"id":"W2756489727","doi":"10.1007/978-3-319-66435-4_3","title":"Understanding the Crowd: Ethical and Practical Matters in the Academic Use of Crowdsourcing","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crowdsourcing; Churning; Computer science; Parallels; Data science; Knowledge management; World Wide Web; Engineering","score_opus":0.12138575017141362,"score_gpt":0.3189866619977965,"score_spread":0.1976009118263829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756489727","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01306182,0.017986378,0.07362475,0.32155475,0.0036927627,0.00012794926,0.00012762424,0.00016814556,0.5696557],"genre_scores_gemma":[0.75528187,0.018917874,0.02858171,0.03888995,0.005515411,0.00041321522,0.00015057846,0.0006274181,0.151622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9847837,0.009092615,0.00038886257,0.0009392843,0.0036890558,0.0011065906],"domain_scores_gemma":[0.96445936,0.028593244,0.00119473,0.00197504,0.002459712,0.0013179798],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.021186996,0.0007695382,0.00070555287,0.0021984691,0.010073231,0.02065654,0.0026325854,0.010928954,0.011338904],"category_scores_gemma":[0.035621434,0.00058980635,0.00059613015,0.0028875293,0.04143237,0.023516223,0.010435135,0.010077573,0.0020693778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055641094,0.000010610395,0.0001724123,0.000065507076,0.0000034275236,0.000052432155,0.010563145,0.00032274603,0.00006871253,0.9611561,0.015314749,0.012264506],"study_design_scores_gemma":[0.000003471686,0.0000052601677,0.00017810121,0.00031782556,0.000003569579,0.000062421466,0.008433624,0.00060880906,0.00016190216,0.83397037,0.15623683,0.000017708917],"about_ca_topic_score_codex":0.0063773617,"about_ca_topic_score_gemma":0.008439691,"teacher_disagreement_score":0.978813,"about_ca_system_score_codex":0.006404443,"about_ca_system_score_gemma":0.011990425,"threshold_uncertainty_score":0.112048864},"labels":[],"label_agreement":null},{"id":"W2760015015","doi":"10.1007/978-3-030-29962-0_17","title":"An Efficiently Searchable Encrypted Data Structure for Range Queries","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Plaintext; Overhead (engineering); Cryptanalysis; Data structure; Theoretical computer science; Data mining; Database; Computer security","score_opus":0.03227953578566503,"score_gpt":0.3079968936761742,"score_spread":0.2757173578905092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760015015","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.07997707,0.0012114311,0.8943978,0.001270759,0.00035057147,0.0005164963,0.0031671268,0.008150786,0.010957815],"genre_scores_gemma":[0.5052357,0.0007447625,0.46790525,0.00051593623,0.00020483225,0.00053967396,0.0050362716,0.0010289745,0.018788597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981768,0.00022001234,0.00024802983,0.00020109069,0.00092809397,0.00022602075],"domain_scores_gemma":[0.99694103,0.00063122396,0.00023305381,0.001591319,0.0004936288,0.00010960871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092262006,0.00047025117,0.0009609203,0.0010504579,0.0006575644,0.0020187362,0.0014006076,0.0007057711,0.005289848],"category_scores_gemma":[0.0039594937,0.00051909627,0.00063052797,0.0017742037,0.00082742725,0.003973347,0.0036105646,0.0012838985,0.002428235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026683689,0.0006037195,0.0021652803,0.0008051412,0.00013885235,0.00063456426,0.0007632038,0.035128567,0.089486025,0.30652675,0.058821157,0.5022583],"study_design_scores_gemma":[0.0009182355,0.0010812959,0.0014762589,0.00020876792,0.00029682755,0.002140084,0.00038917986,0.4074038,0.13249333,0.33224043,0.12114449,0.0002073072],"about_ca_topic_score_codex":0.0008137379,"about_ca_topic_score_gemma":0.0009878696,"teacher_disagreement_score":0.005289848,"about_ca_system_score_codex":0.0012875998,"about_ca_system_score_gemma":0.0016542218,"threshold_uncertainty_score":0.017696321},"labels":[],"label_agreement":null},{"id":"W27607141","doi":"10.1007/978-3-319-10073-9_29","title":"Secure and Efficient Data Placement in Mobile Healthcare Services","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Backup; Cloud computing; Fragmentation (computing); Data access; Mobile database; Computer network; Mobile computing; Mobile cloud computing; Mobile device; Mobile phone; Access time; The Internet; Distributed computing; Database; Mobile station; World Wide Web; Operating system; Base station","score_opus":0.026716198399338014,"score_gpt":0.28181103544083336,"score_spread":0.2550948370414953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27607141","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.035013385,0.005596415,0.94419765,0.001984009,0.00064740656,0.00026003362,0.0005192032,0.0027198943,0.009061962],"genre_scores_gemma":[0.6965699,0.0033686776,0.28203177,0.00044459227,0.00038566146,0.0001523462,0.0009797793,0.00029111895,0.015776109],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983912,0.00040300982,0.0001434232,0.00022239787,0.00060177274,0.00023813343],"domain_scores_gemma":[0.9984425,0.00040938825,0.00013219757,0.0007231485,0.00021935492,0.00007339227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010704915,0.0007304122,0.0009323299,0.0007874164,0.0010468874,0.0026237485,0.0017280269,0.001239509,0.00466435],"category_scores_gemma":[0.0029451558,0.0006482966,0.00052941666,0.0019107842,0.0007018316,0.0029047497,0.0027993268,0.0012919528,0.0028917114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013435305,0.00024543953,0.0026965567,0.0004840625,0.00010603878,0.00081849005,0.00047750428,0.079503305,0.03923139,0.10094405,0.035635386,0.7385143],"study_design_scores_gemma":[0.000107878244,0.00041809856,0.0018276264,0.0001919603,0.00009892716,0.0019904883,0.0006813357,0.68540674,0.09254695,0.13437499,0.082283676,0.00007137256],"about_ca_topic_score_codex":0.00076187484,"about_ca_topic_score_gemma":0.0010237576,"teacher_disagreement_score":0.00466435,"about_ca_system_score_codex":0.0009413851,"about_ca_system_score_gemma":0.001054987,"threshold_uncertainty_score":0.01560384},"labels":[],"label_agreement":null},{"id":"W2760840257","doi":"10.1007/978-3-319-68345-4_27","title":"Integrating Stereo Vision with a CNN Tracker for a Person-Following Robot","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer vision; Artificial intelligence; Convolutional neural network; Computer science; Robot; Tracking (education); Stereopsis; Psychology","score_opus":0.03824846688546087,"score_gpt":0.311950182287145,"score_spread":0.27370171540168414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760840257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03332001,0.00072709844,0.94982547,0.00016640917,0.00042264303,0.00013405316,0.0003330598,0.006544934,0.008526343],"genre_scores_gemma":[0.3850472,0.0006641913,0.5921771,0.00036248783,0.00015480933,0.00011016533,0.0008687938,0.00027222012,0.020343067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970055,0.000013918241,0.000007446943,0.00012119076,0.0001027171,0.000054242933],"domain_scores_gemma":[0.99984276,0.000014532141,0.000012988419,0.000034895857,0.00007581502,0.000019024437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039158855,0.0006830189,0.0008006709,0.00053020846,0.00036007082,0.0005366144,0.0013907505,0.0012977893,0.0040987907],"category_scores_gemma":[0.0005034745,0.0006081562,0.0006351961,0.00062640966,0.0002194703,0.0006638802,0.00084216194,0.0007524854,0.002710173],"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.00030266697,0.00019262669,0.002201121,0.00014265874,0.00012973826,0.00032697764,0.00008468566,0.036710076,0.15563919,0.0019091052,0.010769424,0.7915917],"study_design_scores_gemma":[0.000026178308,0.00021683806,0.0041046576,0.000028520999,0.00008915035,0.0005264702,0.000028211445,0.9261725,0.05673239,0.0018963504,0.010139509,0.00003926016],"about_ca_topic_score_codex":0.012854553,"about_ca_topic_score_gemma":0.018129066,"teacher_disagreement_score":0.012854553,"about_ca_system_score_codex":0.0006168948,"about_ca_system_score_gemma":0.0011948996,"threshold_uncertainty_score":0.025559425},"labels":[],"label_agreement":null},{"id":"W2761173227","doi":"10.1007/978-3-319-69155-8_7","title":"An Inter-device Authentication Scheme for Smart Homes Using One-Time-Password Over Infrared Channel","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mutual authentication; Password; Computer network; Authentication protocol; Authentication (law); Computer security; Key exchange; Forward secrecy; Key-agreement protocol; Key (lock); Internet security; Shared secret; Public-key cryptography; Cryptography; Encryption; Information security; Key distribution; Security service","score_opus":0.04314370992163263,"score_gpt":0.29948345144038435,"score_spread":0.2563397415187517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761173227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101432964,0.0021938987,0.85893315,0.00043762778,0.00066094036,0.00036541518,0.00022456206,0.0042223185,0.031529173],"genre_scores_gemma":[0.8471375,0.0007008393,0.105590865,0.00015288588,0.00012859226,0.00013352351,0.00028056398,0.00007749083,0.045797825],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994893,0.000099515295,0.000034050885,0.000089547495,0.00017400173,0.00011358665],"domain_scores_gemma":[0.99954706,0.000057230573,0.000048614704,0.00019087049,0.00012041703,0.000035764897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034771868,0.0004345321,0.0005244961,0.0003892124,0.0008198145,0.00056681194,0.0008934039,0.00067560293,0.006543058],"category_scores_gemma":[0.0005410304,0.00017468636,0.00043272533,0.00045813798,0.000445287,0.0019031172,0.0013426271,0.0010138312,0.002393494],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00236866,0.00035995094,0.0013344332,0.000771548,0.00010819124,0.0011444013,0.0009783325,0.0077645634,0.29654765,0.09990658,0.022972792,0.5657429],"study_design_scores_gemma":[0.00043522357,0.003504446,0.007010092,0.0002982113,0.0005109395,0.009737801,0.0007304412,0.3310165,0.42082486,0.0395646,0.18597642,0.00039041266],"about_ca_topic_score_codex":0.00035155893,"about_ca_topic_score_gemma":0.00044262927,"teacher_disagreement_score":0.006543058,"about_ca_system_score_codex":0.00039662095,"about_ca_system_score_gemma":0.00035410485,"threshold_uncertainty_score":0.021888733},"labels":[],"label_agreement":null},{"id":"W2761567824","doi":"10.1007/978-3-319-68066-8_9","title":"Pooling Supply and Demand: Collaboration for Community Broadcasts","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Institut National de la Recherche Scientifique","funders":"","keywords":"Pooling; Computer science; Payment; Video on demand; Key (lock); Supply and demand; Service (business); On demand; Telecommunications; Computer network; Computer security; World Wide Web; Microeconomics; Business; Marketing; Multimedia","score_opus":0.023642370706166434,"score_gpt":0.27812709588254025,"score_spread":0.2544847251763738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761567824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07404126,0.0016337142,0.802115,0.0055531184,0.0005664291,0.0003021952,0.0003674646,0.001476163,0.11394462],"genre_scores_gemma":[0.81520224,0.0008849294,0.14214624,0.00039595173,0.0005519522,0.00033410185,0.00037444796,0.00042264568,0.039687414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975126,0.001175112,0.00008869724,0.00046796093,0.00047620796,0.00027943717],"domain_scores_gemma":[0.98496705,0.010690013,0.00065241,0.0017960637,0.0007840889,0.0011103908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004048464,0.0006820354,0.001147525,0.0010319935,0.0027051806,0.0047851694,0.0027711461,0.0031901181,0.018906556],"category_scores_gemma":[0.01956604,0.0007322776,0.0011056946,0.0021020412,0.0017663639,0.008679316,0.0054558893,0.0026070075,0.003132628],"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.00058545044,0.00035798145,0.0015009918,0.00045920117,0.00019555286,0.00045255985,0.0033256842,0.038911995,0.0044915816,0.6914124,0.027042788,0.23126382],"study_design_scores_gemma":[0.00013637714,0.000102945036,0.00047157166,0.000074794814,0.00007339601,0.00016951769,0.00094404945,0.1296384,0.0012999567,0.83436805,0.032672863,0.000048072172],"about_ca_topic_score_codex":0.0015781056,"about_ca_topic_score_gemma":0.00194911,"teacher_disagreement_score":0.018906556,"about_ca_system_score_codex":0.0011534953,"about_ca_system_score_gemma":0.0017307616,"threshold_uncertainty_score":0.06324875},"labels":[],"label_agreement":null},{"id":"W2761657622","doi":"10.1007/978-3-319-68557-1_6","title":"The Use of the Social Networks by Elderly People in the Czech Republic and Other Countries V4","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":4,"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":"Czech; Quarter (Canadian coin); Social network (sociolinguistics); Population; European population; Population ageing; Social group; Social isolation; Demography; Geography; Political science; Computer science; Social media; Psychology; Sociology; Social science; World Wide Web","score_opus":0.023832882719701975,"score_gpt":0.2738357074725571,"score_spread":0.2500028247528551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761657622","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.91031736,0.030602401,0.0002567162,0.0010407799,0.0001773802,0.000030777795,0.002640208,0.000019824942,0.054914564],"genre_scores_gemma":[0.98067,0.009739917,0.00016329206,0.00008314331,0.000022558048,0.000011432299,0.0005607362,0.000008112158,0.008740823],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999767,0.000038101345,0.000021382173,0.000029976045,0.000057457677,0.00008609475],"domain_scores_gemma":[0.99981815,0.00003829024,0.000045477937,0.0000053232848,0.000032260592,0.000060398634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028441977,0.00016809277,0.00017979693,0.0015651055,0.00056195795,0.0011823204,0.0003142911,0.00018602202,0.003329981],"category_scores_gemma":[0.00065795775,0.00012042735,0.00028288882,0.0019989633,0.00028129772,0.0006656148,0.0010998144,0.00026102626,0.00028210023],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022466696,0.00012613628,0.53460485,0.001693074,0.0002549569,0.00101362,0.054555666,0.0009144849,0.002770276,0.016018692,0.02325367,0.36456984],"study_design_scores_gemma":[0.0000032547625,0.00003897513,0.9411762,0.00041776404,0.000034580105,0.00035874374,0.019653477,0.00011468468,0.00015653024,0.0004328043,0.03759572,0.000017437222],"about_ca_topic_score_codex":0.073568754,"about_ca_topic_score_gemma":0.120637864,"teacher_disagreement_score":0.073568754,"about_ca_system_score_codex":0.0012567383,"about_ca_system_score_gemma":0.0015239539,"threshold_uncertainty_score":0.14628106},"labels":[],"label_agreement":null},{"id":"W2762426729","doi":"10.1007/978-3-319-73117-9_27","title":"Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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; Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Robot; Traverse; Computer science; Graph; Mobile robot; A priori and a posteriori; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Adversary; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.03790816574046223,"score_gpt":0.2490121587925893,"score_spread":0.21110399305212707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762426729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17560475,0.0013052807,0.8140765,0.00065209664,0.00013135913,0.000097068245,0.00036567045,0.0007133306,0.0070539736],"genre_scores_gemma":[0.7946707,0.0010154443,0.19430113,0.00017294181,0.00021295875,0.0002559617,0.0007675246,0.00053636706,0.008066877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991098,0.00028849326,0.00004434909,0.00024027308,0.00019525421,0.00012184183],"domain_scores_gemma":[0.99555546,0.0029006966,0.00037689862,0.0006053359,0.00022778643,0.00033378246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010653285,0.0014203077,0.002508277,0.0014334824,0.0016831863,0.0021160638,0.0046234904,0.0019077094,0.0035256643],"category_scores_gemma":[0.007948767,0.0021712945,0.0017539315,0.0030747661,0.0021020563,0.0050489153,0.0052217455,0.0021983595,0.00057750026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002927554,0.00005331513,0.00075358566,0.00022566105,0.00010234684,0.0003674312,0.00034700066,0.9406003,0.0024863193,0.030911488,0.0023479823,0.021511864],"study_design_scores_gemma":[0.000033129018,0.000060369923,0.00022691407,0.000023289685,0.000038384947,0.00008564493,0.0001188324,0.9404616,0.0007999325,0.05673224,0.0013988259,0.000020859705],"about_ca_topic_score_codex":0.004727061,"about_ca_topic_score_gemma":0.007037956,"teacher_disagreement_score":0.004727061,"about_ca_system_score_codex":0.001158164,"about_ca_system_score_gemma":0.0008607846,"threshold_uncertainty_score":0.011794567},"labels":[],"label_agreement":null},{"id":"W2763773476","doi":"10.1007/978-3-319-69179-4_46","title":"Quality Prediction of Newly Proposed Questions in CQA by Leveraging Weakly Supervised Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Expert finding and Q&A systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality (philosophy); Convolutional neural network; Ask price; Information retrieval; Supervised learning; World Wide Web; Artificial intelligence; Machine learning; Data science; Artificial neural network","score_opus":0.031986618250439705,"score_gpt":0.2774883597977667,"score_spread":0.245501741547327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763773476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14622985,0.00435394,0.8304207,0.0028662337,0.0006272855,0.0006940941,0.0037335402,0.004862371,0.006211972],"genre_scores_gemma":[0.76293707,0.00043609543,0.22474231,0.0006228466,0.0004996284,0.0003288398,0.005512713,0.0003532218,0.0045672674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99169743,0.0033647872,0.0006606172,0.0019380148,0.0018467603,0.00049242924],"domain_scores_gemma":[0.9555465,0.029010601,0.0018412148,0.0027284748,0.009143788,0.0017294411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00828114,0.0011056808,0.0014955798,0.0032117558,0.0009677994,0.0029254826,0.0021616144,0.0023889858,0.004425022],"category_scores_gemma":[0.04960623,0.00036883584,0.0013633606,0.001547502,0.001182932,0.0050160354,0.0026427046,0.0036579184,0.0018292415],"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.0030132688,0.0013185601,0.088708304,0.0016991807,0.0004760439,0.00051200856,0.0020704076,0.0909476,0.036750074,0.027089868,0.046010613,0.701404],"study_design_scores_gemma":[0.0000683496,0.00022344111,0.00793491,0.00009344323,0.00011928456,0.00010288985,0.0002492454,0.9532034,0.0071323877,0.02596365,0.0048458255,0.00006328844],"about_ca_topic_score_codex":0.0073748194,"about_ca_topic_score_gemma":0.009346548,"teacher_disagreement_score":0.00828114,"about_ca_system_score_codex":0.0016858572,"about_ca_system_score_gemma":0.0025906651,"threshold_uncertainty_score":0.043795407},"labels":[],"label_agreement":null},{"id":"W2763836263","doi":"10.1007/978-3-319-68288-4_38","title":"Blockchain Enabled Privacy Audit Logs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":77,"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":"Audit; Collusion; Computer science; Blockchain; Audit trail; Scalability; Computer security; Information privacy; Internet privacy; Database; Accounting; Business","score_opus":0.02822777782463605,"score_gpt":0.26625421582961095,"score_spread":0.23802643800497492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763836263","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.079336785,0.0008086071,0.8742858,0.0027794174,0.0007234478,0.000696698,0.00295401,0.015756538,0.022658724],"genre_scores_gemma":[0.9191444,0.00036832975,0.06255301,0.00021814034,0.00010322219,0.00027665158,0.0015830965,0.0004903465,0.015262863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99347526,0.0023516181,0.0004030493,0.0006564538,0.002386012,0.0007276232],"domain_scores_gemma":[0.9706807,0.01143667,0.0013090279,0.012053696,0.0034274724,0.0010924385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051085623,0.00063213176,0.0010013689,0.0014096603,0.0015638667,0.0042689317,0.0017401717,0.0017433588,0.012737894],"category_scores_gemma":[0.025564132,0.0006154751,0.00042722968,0.0017213606,0.001570659,0.007848809,0.0049875416,0.0034616662,0.0039051257],"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.005533699,0.0009305962,0.009087287,0.000757466,0.000119538505,0.0014466484,0.0015168077,0.100681186,0.021610137,0.31267267,0.041040856,0.50460315],"study_design_scores_gemma":[0.00019907276,0.0003226183,0.0009792374,0.00024617545,0.00005716201,0.0007453459,0.00040111187,0.6657593,0.033501644,0.26108605,0.036610667,0.00009160258],"about_ca_topic_score_codex":0.0014089436,"about_ca_topic_score_gemma":0.0016560063,"teacher_disagreement_score":0.012737894,"about_ca_system_score_codex":0.0012229693,"about_ca_system_score_gemma":0.004176701,"threshold_uncertainty_score":0.042612493},"labels":[],"label_agreement":null},{"id":"W2764209689","doi":"10.1007/978-3-319-69179-4_58","title":"Location-Aware Human Activity Recognition","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Activity recognition; Computer science; Wearable computer; Machine learning; Artificial intelligence; Accelerometer; Focus (optics); Human–computer interaction","score_opus":0.05371711191074713,"score_gpt":0.2899555645043942,"score_spread":0.23623845259364706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764209689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041631237,0.00715719,0.9285092,0.00020963381,0.00044254313,0.000073538155,0.0013045185,0.008689064,0.01198306],"genre_scores_gemma":[0.6238809,0.0057586026,0.3415113,0.00030795825,0.0003944575,0.00011745207,0.004102333,0.00035397842,0.023572966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975985,0.000028257235,0.000011125011,0.00010154193,0.000064178035,0.000035176756],"domain_scores_gemma":[0.9998419,0.00003757962,0.000015656855,0.000034474808,0.00005405472,0.000016309456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002003492,0.00067869225,0.00089630665,0.00070871273,0.00014049579,0.0005804686,0.000829805,0.0004570928,0.0033448741],"category_scores_gemma":[0.00047407864,0.00025774873,0.00044490513,0.000890811,0.0001464444,0.0006403133,0.00064612814,0.00047892754,0.0040989635],"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.00017804913,0.00014533817,0.001324095,0.00014164306,0.000054765664,0.000105247345,0.000040057563,0.0064997366,0.06301304,0.0008375683,0.010035515,0.91762495],"study_design_scores_gemma":[0.000039718783,0.00044313096,0.023510737,0.00014721081,0.00018757345,0.0023309332,0.00020796273,0.7493089,0.1778856,0.00805939,0.037769318,0.000109473556],"about_ca_topic_score_codex":0.0014013521,"about_ca_topic_score_gemma":0.0026540149,"teacher_disagreement_score":0.0033448741,"about_ca_system_score_codex":0.0001607241,"about_ca_system_score_gemma":0.0002002203,"threshold_uncertainty_score":0.011189699},"labels":[],"label_agreement":null},{"id":"W2764262197","doi":"10.1007/978-3-319-69084-1_6","title":"Self-tuning Eventually-Consistent Data Stores","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Latency (audio); Replication (statistics); Cloud computing; Convergence (economics); Consistency (knowledge bases); Data center; Distributed data store; Focus (optics); Data consistency; Distributed database; Computer network; Artificial intelligence; Operating system; Telecommunications","score_opus":0.035229880972537576,"score_gpt":0.2633968243196291,"score_spread":0.2281669433470915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764262197","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.08260553,0.0008494031,0.8966119,0.0004402541,0.00039475158,0.00013977864,0.00033537898,0.011079372,0.0075435713],"genre_scores_gemma":[0.66710544,0.00028663877,0.32177308,0.0002942767,0.00014202415,0.00016850272,0.0007834232,0.0015026004,0.007944091],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668026,0.00049716805,0.00029308363,0.0007624031,0.0013524847,0.00041468043],"domain_scores_gemma":[0.98525006,0.0034701491,0.00061656506,0.008188709,0.002147839,0.00032665645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002807283,0.00079483225,0.0012289897,0.001081195,0.0011483819,0.0032024833,0.0047906227,0.0012015874,0.0056025935],"category_scores_gemma":[0.014771023,0.0011035075,0.0008060725,0.0020874597,0.0013683725,0.005421138,0.0043925974,0.0021252383,0.001494288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027525793,0.00057699287,0.007907721,0.00067669485,0.0002824106,0.00035914115,0.0007535496,0.18402532,0.05860794,0.15442286,0.024451397,0.56518334],"study_design_scores_gemma":[0.00018567748,0.00019595913,0.00068588177,0.00006774989,0.000109279565,0.00031680206,0.00020415818,0.8256049,0.04182755,0.12005004,0.010687452,0.00006456743],"about_ca_topic_score_codex":0.0014700958,"about_ca_topic_score_gemma":0.0021488552,"teacher_disagreement_score":0.0056025935,"about_ca_system_score_codex":0.0011190536,"about_ca_system_score_gemma":0.0022121798,"threshold_uncertainty_score":0.018742561},"labels":[],"label_agreement":null},{"id":"W2765086360","doi":"10.1007/978-3-319-94812-6_10","title":"State Complexity of Overlap Assembly","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki","keywords":"Unary operation; Upper and lower bounds; State (computer science); Regular language; Mathematics; Combinatorics; Deterministic finite automaton; Alphabet; Binary number; Discrete mathematics; Operand; Finite-state machine; Automaton; Algorithm; Computer science; Arithmetic; Theoretical computer science","score_opus":0.034177454178357436,"score_gpt":0.2959145557577035,"score_spread":0.26173710157934604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765086360","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.87307614,0.00034110108,0.082804285,0.0021555962,0.00010365315,0.000050212424,0.00059733546,0.00051065115,0.04036104],"genre_scores_gemma":[0.99465925,0.00007203248,0.0023637812,0.00006204788,0.00006311654,0.00004499097,0.00026987144,0.00007732824,0.0023876543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989806,0.00021876745,0.000044965866,0.00018185144,0.00033587829,0.00023791548],"domain_scores_gemma":[0.9925688,0.004723873,0.0006014956,0.00076237513,0.00055950816,0.00078395073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012617025,0.0005138029,0.0010176484,0.0017091794,0.0016733698,0.0034303148,0.0015274778,0.0018731938,0.012257418],"category_scores_gemma":[0.011172446,0.000620519,0.00074243214,0.0008943123,0.001883617,0.004312464,0.0024931438,0.0017647225,0.0006960724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026568206,0.000095989766,0.0018412388,0.000086859654,0.00002684658,0.00016246304,0.0002370808,0.05069568,0.0036623676,0.93331176,0.0024480834,0.007165957],"study_design_scores_gemma":[0.000025496047,0.000030320416,0.0010644087,0.000015144912,0.000014264458,0.0000790556,0.000078097626,0.43302172,0.0017247343,0.5633924,0.0005277093,0.000026727274],"about_ca_topic_score_codex":0.0011549944,"about_ca_topic_score_gemma":0.00083496334,"teacher_disagreement_score":0.012257418,"about_ca_system_score_codex":0.0013654942,"about_ca_system_score_gemma":0.0008995724,"threshold_uncertainty_score":0.041005194},"labels":[],"label_agreement":null},{"id":"W2765368425","doi":"10.1007/978-3-319-70096-0_13","title":"Combating Adversarial Inputs Using a Predictive-Estimator Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Estimator; Adversarial system; Construct (python library); Artificial intelligence; Machine learning; Feed forward; Process (computing); Mathematics; Statistics; Control engineering","score_opus":0.02150898241578336,"score_gpt":0.27714648231756617,"score_spread":0.2556374999017828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765368425","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.0069902334,0.00033407073,0.98945904,0.00019184616,0.000089647634,0.000022067286,0.000032898162,0.00030679948,0.0025734105],"genre_scores_gemma":[0.7758413,0.00080823805,0.20674473,0.0004453528,0.00024321796,0.00013960415,0.00021686991,0.00014184925,0.015418893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994894,0.000114544906,0.00001862883,0.00015001047,0.00015944292,0.00006794993],"domain_scores_gemma":[0.99872404,0.00076905504,0.00009359148,0.00016143346,0.00020882954,0.00004308989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010480763,0.0009842423,0.00093970215,0.00051841215,0.00046231944,0.000870506,0.0017354764,0.0017144507,0.0029875222],"category_scores_gemma":[0.0035573435,0.0005420669,0.00058675307,0.00046520086,0.0010775919,0.0015935685,0.0025214732,0.0022935385,0.00064942084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013192395,0.000052288087,0.00036052027,0.00007002287,0.000047575173,0.00011603032,0.000053179734,0.8388254,0.0055458485,0.03040457,0.0023469874,0.12204565],"study_design_scores_gemma":[0.0000017928453,0.000019976702,0.000036710488,0.000006355291,0.000007708465,0.000025952508,0.0000028521865,0.9937104,0.0009685272,0.004876888,0.00033860916,0.0000042020374],"about_ca_topic_score_codex":0.0021781186,"about_ca_topic_score_gemma":0.0025351788,"teacher_disagreement_score":0.0029875222,"about_ca_system_score_codex":0.0006849696,"about_ca_system_score_gemma":0.0006426622,"threshold_uncertainty_score":0.009994268},"labels":[],"label_agreement":null},{"id":"W2765732517","doi":"10.1007/978-3-319-70136-3_3","title":"Decentralized Force/Position Fault-Tolerant Control for Constrained Reconfigurable Manipulators with Actuator Faults","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Actuator; Computer science; Position (finance); Fault tolerance; Torque; Lyapunov function; Controller (irrigation); Control engineering; Fault (geology); Control (management); Engineering; Nonlinear system; Artificial intelligence; Distributed computing","score_opus":0.015081534168245413,"score_gpt":0.23143813120833148,"score_spread":0.21635659704008606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765732517","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.13394147,0.00063401443,0.8535533,0.00018889827,0.00016247222,0.000036007266,0.000055877957,0.0006962635,0.010731802],"genre_scores_gemma":[0.98459977,0.00010709194,0.012243278,0.000023786806,0.000032848526,0.000033285694,0.00003953264,0.000022106457,0.0028983264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998684,0.000013891853,0.000005452578,0.00003475977,0.00005600895,0.00002144655],"domain_scores_gemma":[0.9998516,0.00003568284,0.000050356488,0.000025535544,0.000027128552,0.000009725012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011444223,0.0005466635,0.0004420583,0.00020507259,0.00027588606,0.00041630256,0.0006909572,0.00040330735,0.0012394647],"category_scores_gemma":[0.00034591474,0.0002117975,0.00024206475,0.00025225765,0.00040273144,0.0003836429,0.00056873175,0.00037691143,0.00022077828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022064963,0.00006286349,0.0002158176,0.0001804395,0.000037392725,0.00018239749,0.000094545205,0.78967094,0.0799032,0.0097416155,0.0015660978,0.11812397],"study_design_scores_gemma":[0.000023031518,0.00017368505,0.00040558906,0.0000071454197,0.000007838845,0.000069432455,0.000008852486,0.9888599,0.0056808023,0.0037674967,0.0009879364,0.000008365458],"about_ca_topic_score_codex":0.0009055703,"about_ca_topic_score_gemma":0.0012252202,"teacher_disagreement_score":0.0012394647,"about_ca_system_score_codex":0.00026257258,"about_ca_system_score_gemma":0.00023325748,"threshold_uncertainty_score":0.0041464567},"labels":[],"label_agreement":null},{"id":"W2765744821","doi":"10.1007/978-3-662-56006-8_2","title":"KINECT Face Recognition Using Occluded Area Localization Method","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Facial recognition system; Face (sociological concept); Orientation (vector space); Three-dimensional face recognition; Occlusion; Local binary patterns; Pattern recognition (psychology); Identification (biology); Image (mathematics); Face detection; Histogram; Mathematics","score_opus":0.06203110054676792,"score_gpt":0.3083443143584312,"score_spread":0.24631321381166327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765744821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028931312,0.0013086625,0.9503112,0.00009462197,0.00027673633,0.00016485504,0.0018454096,0.0069512315,0.010115946],"genre_scores_gemma":[0.35517997,0.0020380158,0.59841186,0.00025096702,0.000113797105,0.00040344344,0.0048065167,0.0005249384,0.038270514],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994968,0.000024797218,0.000021043781,0.00013309697,0.0002852057,0.000038917595],"domain_scores_gemma":[0.9998871,0.000011228803,0.0000126826135,0.000024408359,0.00005540975,0.00000915323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018330837,0.000768814,0.0008477204,0.0011400882,0.0002400141,0.000627589,0.00085935165,0.0005858358,0.0082813585],"category_scores_gemma":[0.00030811856,0.00041096684,0.00052856654,0.000812875,0.0001776284,0.000789504,0.00074720156,0.000468231,0.0050614583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025443526,0.00012348071,0.0017821739,0.00034925577,0.00006234521,0.00017914701,0.0000798248,0.0057992563,0.2738206,0.0024634842,0.010988349,0.7040976],"study_design_scores_gemma":[0.00006155676,0.00032077634,0.025151076,0.00016476978,0.00014692277,0.002311595,0.00015420784,0.46313435,0.4559106,0.002743111,0.04975726,0.00014375849],"about_ca_topic_score_codex":0.0020188016,"about_ca_topic_score_gemma":0.0035328667,"teacher_disagreement_score":0.0082813585,"about_ca_system_score_codex":0.00022803352,"about_ca_system_score_gemma":0.00039493802,"threshold_uncertainty_score":0.027703881},"labels":[],"label_agreement":null},{"id":"W2765801076","doi":"10.1007/978-3-319-70096-0_91","title":"Ten-Quarter Projection for Spanish Central Government Debt via WASD Neuronet","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Projection (relational algebra); Debt; Government (linguistics); Government debt; Debt ratio; Debt crisis; Financial crisis; Debt-to-GDP ratio; Financial system; Economy; Economics; External debt; Finance; Computer science; Geography; Macroeconomics; Algorithm","score_opus":0.011099624211147251,"score_gpt":0.207008269204749,"score_spread":0.19590864499360175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765801076","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.5616614,0.010400685,0.004258186,0.016701233,0.00373804,0.00010730085,0.21721168,0.0024705864,0.18345085],"genre_scores_gemma":[0.84943557,0.004090021,0.0012647809,0.00042444476,0.00035607076,0.000092578404,0.08050524,0.0002779606,0.06355325],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.000030008032,0.000018438814,0.000051532206,0.00014527766,0.00009995554],"domain_scores_gemma":[0.9991272,0.00005086279,0.00009696771,0.000033664004,0.000557473,0.00013380918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007218248,0.00054772355,0.0004915056,0.0013546996,0.00037376978,0.0026242014,0.00057720864,0.00084776967,0.008250256],"category_scores_gemma":[0.0020538773,0.0001717511,0.0005197003,0.0021777113,0.00020750487,0.00092555024,0.00080446264,0.0013926413,0.003623045],"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.0026993477,0.00031684266,0.13943563,0.0007747447,0.00051362126,0.0012132801,0.00043753107,0.031765707,0.002377721,0.03995645,0.662434,0.1180751],"study_design_scores_gemma":[0.0003452634,0.00037981456,0.36589846,0.00066406804,0.00033153457,0.0005078064,0.0027222298,0.039916333,0.003767505,0.01591059,0.56942594,0.00013046002],"about_ca_topic_score_codex":0.09354596,"about_ca_topic_score_gemma":0.052326705,"teacher_disagreement_score":0.09354596,"about_ca_system_score_codex":0.0030996865,"about_ca_system_score_gemma":0.0026864342,"threshold_uncertainty_score":0.18600297},"labels":[],"label_agreement":null},{"id":"W2766336455","doi":"10.1007/978-3-319-68136-8_18","title":"Demand-Driven SOA Simulation Platform Based on GIPSY for Context-Based Brokerage","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Concordia University","funders":"","keywords":"Computer science; Context (archaeology); Operating system; Software engineering; Distributed computing; Geology","score_opus":0.023366702561147867,"score_gpt":0.268636755713572,"score_spread":0.24527005315242412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766336455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06673947,0.00030963088,0.86408615,0.00044614004,0.00035519473,0.00048210204,0.0010981373,0.023681043,0.042802077],"genre_scores_gemma":[0.7371525,0.0005176723,0.23528877,0.00023240288,0.00007197158,0.0005614384,0.0025554362,0.0012646419,0.022355117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973565,0.0000632792,0.000019950252,0.000048616923,0.00009519058,0.000037275888],"domain_scores_gemma":[0.9997446,0.00007208027,0.000014796253,0.00006160533,0.000065506276,0.00004144677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004877946,0.00061259285,0.00061630365,0.00040042898,0.0006334172,0.0013884492,0.0014313973,0.0007867755,0.008221493],"category_scores_gemma":[0.0008406102,0.00036211353,0.0006478217,0.0003719951,0.00030274183,0.0010715307,0.0011176745,0.000987242,0.0019953516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010293745,0.0007843767,0.0052279914,0.0005355515,0.00019729216,0.0011811667,0.0007623622,0.6851035,0.071109764,0.099553056,0.025440954,0.109074496],"study_design_scores_gemma":[0.0000664168,0.000053992455,0.00033516865,0.000016109941,0.000029540033,0.00007941866,0.000038408016,0.9627163,0.0090180775,0.010169055,0.017449701,0.000027902297],"about_ca_topic_score_codex":0.0042790356,"about_ca_topic_score_gemma":0.0028677627,"teacher_disagreement_score":0.008221493,"about_ca_system_score_codex":0.00047802128,"about_ca_system_score_gemma":0.0012413871,"threshold_uncertainty_score":0.02750367},"labels":[],"label_agreement":null},{"id":"W2766568520","doi":"10.1007/978-3-662-56006-8_5","title":"Comparison Analysis of Overt and Covert Mental Stimuli of Brain Signal for Person Identification","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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 Calgary","funders":"","keywords":"Covert; Electroencephalography; Computer science; Artificial intelligence; Alpha (finance); Speech recognition; Identification (biology); Biometrics; Classifier (UML); Pattern recognition (psychology); Psychology; Neuroscience; Developmental psychology","score_opus":0.0578912034007341,"score_gpt":0.33502678204268754,"score_spread":0.27713557864195343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766568520","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.9305105,0.0006425318,0.0617156,0.00006730089,0.00010494595,0.00008165836,0.0006484892,0.0002976114,0.0059313527],"genre_scores_gemma":[0.97856206,0.00032014132,0.018408855,0.00002872243,0.00004930241,0.000053771215,0.0006572583,0.000097077165,0.001822734],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988496,0.000023265082,0.0000063365146,0.000029397595,0.000036864618,0.000019203004],"domain_scores_gemma":[0.999624,0.00022565186,0.000017774453,0.000033989087,0.00007379302,0.000024804158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002554381,0.00020325228,0.00016773061,0.000475904,0.00012534182,0.00033162022,0.00017648461,0.00024232361,0.005899142],"category_scores_gemma":[0.001319998,0.00006074465,0.00027464158,0.00034597036,0.00012707405,0.0004803087,0.0002367736,0.00017663765,0.0006583284],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030975842,0.00014777403,0.004413186,0.00039874358,0.00008544678,0.0002119482,0.0002387545,0.00077699823,0.71956027,0.0010257022,0.001085241,0.2689583],"study_design_scores_gemma":[0.00012886706,0.00217723,0.5007255,0.000079075566,0.0005390315,0.0034892038,0.0007163042,0.08510474,0.39733836,0.0040318808,0.0055815335,0.00008828022],"about_ca_topic_score_codex":0.00022243375,"about_ca_topic_score_gemma":0.00038770135,"teacher_disagreement_score":0.005899142,"about_ca_system_score_codex":0.00007824604,"about_ca_system_score_gemma":0.00010555934,"threshold_uncertainty_score":0.019734561},"labels":[],"label_agreement":null},{"id":"W2766604835","doi":"10.1007/978-3-319-69453-5_12","title":"Keymill: Side-Channel Resilient Key Generator, A New Concept for SCA-Security by Design","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Side channel attack; Computer science; Block cipher; Power analysis; Cryptography; Countermeasure; Cryptographic primitive; Stream cipher; Block cipher mode of operation; Cryptographic nonce; Computer security; Key (lock); Security analysis; Theoretical computer science; Encryption; Cryptographic protocol","score_opus":0.03349821390919246,"score_gpt":0.28576978437935513,"score_spread":0.2522715704701627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766604835","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.0034355153,0.0015722238,0.97369224,0.0006533865,0.000602793,0.00011826039,0.00012048101,0.00575385,0.014051218],"genre_scores_gemma":[0.2414059,0.0037991083,0.67246765,0.0017023027,0.0011031696,0.0005120246,0.00060577283,0.0024737613,0.07593038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990158,0.00022516685,0.00006555604,0.00020586196,0.00040028495,0.00008739943],"domain_scores_gemma":[0.9990746,0.00025501457,0.00008773252,0.00036216615,0.00016013684,0.000060303773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894891,0.0011655316,0.00069437793,0.00093223975,0.00052836403,0.002078,0.0014899373,0.001352651,0.009980648],"category_scores_gemma":[0.002391278,0.00056459644,0.00053789024,0.00059204653,0.001942498,0.0048157433,0.0016369411,0.003598272,0.00640211],"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.00037047322,0.00007455736,0.0003087876,0.0005638834,0.00005483247,0.00024203787,0.00029414002,0.0050625782,0.040135752,0.6148301,0.03477493,0.30328804],"study_design_scores_gemma":[0.00015259135,0.00058863446,0.00029798681,0.00025609182,0.00010952176,0.002475762,0.000062856234,0.0820483,0.09800599,0.4467632,0.36911565,0.00012343419],"about_ca_topic_score_codex":0.00008230332,"about_ca_topic_score_gemma":0.00011421666,"teacher_disagreement_score":0.009980648,"about_ca_system_score_codex":0.00049297395,"about_ca_system_score_gemma":0.0006727009,"threshold_uncertainty_score":0.033388615},"labels":[],"label_agreement":null},{"id":"W2766605685","doi":"10.1007/978-3-319-77583-8_3","title":"Non-photorealistic Rendering with Cartesian Genetic Programming Using Graphics Processing Units","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Brock University","funders":"","keywords":"Rendering (computer graphics); Computer science; Computer graphics (images); Genetic programming; Population; Evolutionary algorithm; Artificial intelligence; Computer vision","score_opus":0.02509104614888687,"score_gpt":0.2526769971125446,"score_spread":0.22758595096365772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766605685","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.01156855,0.00019191319,0.9643922,0.00008018105,0.000097943324,0.000042696956,0.000034938454,0.0012717027,0.022319943],"genre_scores_gemma":[0.2049535,0.0002822135,0.77752554,0.000082957275,0.000029929084,0.00009034794,0.000105309286,0.0006484568,0.016281746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998012,0.00003407964,0.0000054674106,0.000031936856,0.000113268965,0.000014067401],"domain_scores_gemma":[0.9998056,0.00009714652,0.000010763024,0.00004480319,0.000030999032,0.000010782143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025132907,0.00058557425,0.00048923393,0.00030987224,0.0002647374,0.0012268166,0.0010927281,0.0006314947,0.008237189],"category_scores_gemma":[0.00065539643,0.00040564148,0.0007255663,0.00042533706,0.00057342474,0.0005750749,0.0008240941,0.0011906106,0.0012144886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019036801,0.00012306935,0.0005032176,0.000408416,0.00009807378,0.00033908398,0.00043906824,0.35771027,0.13649403,0.18077803,0.007127084,0.31578922],"study_design_scores_gemma":[0.00005825141,0.000088927554,0.00023139243,0.000035462952,0.000024602943,0.00031385059,0.00004406345,0.93998104,0.018264214,0.026909634,0.014019572,0.000028964316],"about_ca_topic_score_codex":0.0012331047,"about_ca_topic_score_gemma":0.0013823879,"teacher_disagreement_score":0.008237189,"about_ca_system_score_codex":0.0004790013,"about_ca_system_score_gemma":0.0004088505,"threshold_uncertainty_score":0.027556121},"labels":[],"label_agreement":null},{"id":"W2766685223","doi":"10.1007/978-3-319-69035-3_45","title":"Empirical Study on REST APIs Usage in Android Mobile Applications","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Android (operating system); Computer science; World Wide Web; Web service; Empirical research; Mobile device; Best practice; Mobile service; Service (business); Internet privacy; Operating system","score_opus":0.02952141298479012,"score_gpt":0.33225834475926225,"score_spread":0.30273693177447214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766685223","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.99882025,0.00007979922,0.00014874387,0.000022451311,0.0000031829522,0.000009764602,0.00013723498,0.000011010658,0.00076751783],"genre_scores_gemma":[0.99856454,0.00008061303,0.0001521266,0.00002154207,0.000007987025,0.000013082808,0.00036731924,0.000008437461,0.0007843074],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993243,0.00016577887,0.000062950465,0.00010781924,0.00023115413,0.00010813641],"domain_scores_gemma":[0.9885388,0.007497765,0.0017125816,0.00055922224,0.0013207108,0.00037088676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054226175,0.00029031,0.00015910916,0.0010624131,0.00037682732,0.000752971,0.0003162077,0.00039449907,0.0017335651],"category_scores_gemma":[0.006126955,0.00016957575,0.0004510715,0.00073845143,0.0004571272,0.0009648196,0.00039013365,0.00072848523,0.00074661255],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042532044,0.00090942153,0.95699996,0.00019988853,0.000077118435,0.00045892812,0.0029389765,0.00029459034,0.0047012772,0.00041509146,0.00089653046,0.031682875],"study_design_scores_gemma":[0.000006529642,0.00055761525,0.98830545,0.00005759381,0.00009686676,0.00088371587,0.0036459058,0.0026044424,0.0024970393,0.00013021006,0.0011991515,0.000015493464],"about_ca_topic_score_codex":0.0025785803,"about_ca_topic_score_gemma":0.0032491726,"teacher_disagreement_score":0.0025785803,"about_ca_system_score_codex":0.00025090197,"about_ca_system_score_gemma":0.0002917161,"threshold_uncertainty_score":0.005799353},"labels":[],"label_agreement":null},{"id":"W2766718994","doi":"10.1007/978-3-319-69904-2_34","title":"User Perception of Numeric Contribution Semantics for Goal Models: An Exploratory Experiment","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"York University","funders":"","keywords":"Computer science; Perception; Semantics (computer science); Exploratory research; Goal orientation; Human–computer interaction; Psychology; Social psychology","score_opus":0.056680712431084926,"score_gpt":0.31643773300988426,"score_spread":0.25975702057879935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766718994","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.96721977,0.00027465055,0.025661485,0.00016566858,0.0000640356,0.00028802356,0.00037062078,0.0011705796,0.0047852974],"genre_scores_gemma":[0.97701925,0.00011606206,0.020523258,0.00016831941,0.000016817397,0.00031839378,0.00043364015,0.00036908584,0.0010352553],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9945127,0.0031952427,0.0004744255,0.0008914489,0.00072898896,0.00019712636],"domain_scores_gemma":[0.8280463,0.15701899,0.0026090343,0.00713019,0.0037569483,0.0014384785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007082039,0.0011329866,0.0007905358,0.0006460103,0.00054796325,0.0037116003,0.0013800478,0.0020730768,0.008270382],"category_scores_gemma":[0.118507534,0.0007174819,0.00087772746,0.00040244687,0.0006224325,0.0055305553,0.0021085516,0.0017000182,0.0013105347],"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.0753555,0.00920255,0.09569068,0.008824991,0.0010034364,0.0022152578,0.16271663,0.0201148,0.2625911,0.017478624,0.009360857,0.33544564],"study_design_scores_gemma":[0.00863464,0.035322633,0.15773726,0.0024753183,0.0036573934,0.0048253387,0.056751058,0.5236877,0.11216637,0.04412976,0.04895644,0.0016561353],"about_ca_topic_score_codex":0.0014953897,"about_ca_topic_score_gemma":0.00075780443,"teacher_disagreement_score":0.008270382,"about_ca_system_score_codex":0.0004990496,"about_ca_system_score_gemma":0.0005359294,"threshold_uncertainty_score":0.03745389},"labels":[],"label_agreement":null},{"id":"W2766804132","doi":"10.1007/978-3-319-94631-3_7","title":"A New Technique for Reachability of States in Concatenation Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Reachability; Computer science; Automaton; Mathematical proof; Theoretical computer science; State (computer science); Finite-state machine; Algorithm; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.015007128737231968,"score_gpt":0.2591802567197418,"score_spread":0.24417312798250984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766804132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015064633,0.00022774907,0.9916155,0.00008258852,0.00019802983,0.000050754577,0.000076495984,0.0009386388,0.005303853],"genre_scores_gemma":[0.0910878,0.0009371677,0.8886684,0.00036593038,0.0004969216,0.00052125036,0.00048461114,0.0015348537,0.015903093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973557,0.0004614554,0.00031143636,0.00081314496,0.00087615795,0.00018215207],"domain_scores_gemma":[0.9968767,0.0017997369,0.00012216665,0.0007594958,0.00032690435,0.00011494141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017148865,0.0016447479,0.0012791558,0.0026476309,0.002704666,0.002811042,0.0032088966,0.0018415494,0.010623754],"category_scores_gemma":[0.0045271465,0.0013404762,0.0039635897,0.0026954585,0.0037810744,0.010121651,0.00709744,0.0063735796,0.003972036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017218642,0.00007241066,0.00021620798,0.0005679934,0.000070321905,0.0004897072,0.0011765696,0.0060066166,0.025465263,0.8190615,0.0048240293,0.14187713],"study_design_scores_gemma":[0.00004251654,0.00017954843,0.00028597293,0.0001826497,0.00025476984,0.0012505988,0.0001987039,0.08048906,0.033948835,0.8112565,0.071779355,0.00013147049],"about_ca_topic_score_codex":0.0008761407,"about_ca_topic_score_gemma":0.0010435922,"teacher_disagreement_score":0.010623754,"about_ca_system_score_codex":0.0010804825,"about_ca_system_score_gemma":0.0010229489,"threshold_uncertainty_score":0.035539985},"labels":[],"label_agreement":null},{"id":"W2766823222","doi":"10.1007/978-3-319-69659-1_18","title":"Droid Mood Swing (DMS): Automatic Security Modes Based on Contexts","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Swing; Mood; Computer security; Human–computer interaction; Psychology; Psychiatry; Mechanical engineering","score_opus":0.012904178385302141,"score_gpt":0.26443556049772016,"score_spread":0.251531382112418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766823222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16494118,0.0034237765,0.40238482,0.0005347787,0.0012510853,0.00085395685,0.013360597,0.38250712,0.030742753],"genre_scores_gemma":[0.7019755,0.0006559759,0.26415524,0.0006644354,0.00022580655,0.00034987245,0.010297265,0.006097867,0.01557812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.000033221077,0.000019012454,0.00010218437,0.00011432838,0.000035916644],"domain_scores_gemma":[0.9996691,0.00011316772,0.00004427956,0.00007541335,0.000056542787,0.000041571693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029368853,0.0011933203,0.00061348156,0.0012559718,0.00026745247,0.0009120978,0.0007527221,0.00047770768,0.0080092205],"category_scores_gemma":[0.0015461288,0.0004752591,0.0005112645,0.00032806152,0.0001629075,0.0010112942,0.0014002748,0.00062756747,0.0044758655],"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.0019476638,0.00032015578,0.010121789,0.0006092748,0.0001709627,0.00040729393,0.0002586539,0.0030544964,0.075404204,0.0029004156,0.11852247,0.7862827],"study_design_scores_gemma":[0.00073975074,0.0013391043,0.030123305,0.0004067211,0.00047825574,0.0021504255,0.00037607198,0.6056439,0.20127103,0.023179496,0.13394524,0.00034671288],"about_ca_topic_score_codex":0.0008151489,"about_ca_topic_score_gemma":0.0021125025,"teacher_disagreement_score":0.0080092205,"about_ca_system_score_codex":0.00019013412,"about_ca_system_score_gemma":0.00023005267,"threshold_uncertainty_score":0.02679354},"labels":[],"label_agreement":null},{"id":"W2766895107","doi":"10.1007/978-3-319-68600-4_40","title":"Model Derived Spike Time Dependent Plasticity","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Spike (software development); Learning rule; Spike-timing-dependent plasticity; Postsynaptic potential; Synaptic weight; Spiking neural network; Node (physics); Artificial neural network; Bidirectional associative memory; Artificial intelligence; Content-addressable memory","score_opus":0.024035353547537042,"score_gpt":0.2392908017464042,"score_spread":0.21525544819886716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766895107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036906328,0.0023375326,0.80387,0.00090255676,0.00081474974,0.000082779196,0.0007963623,0.0010119078,0.15327774],"genre_scores_gemma":[0.7743071,0.0023463017,0.050912987,0.00045600557,0.00025210727,0.00022015058,0.0008980751,0.00052797777,0.17007944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992657,0.000011115072,0.000003157763,0.000012607357,0.000037148136,0.0000094361185],"domain_scores_gemma":[0.99989414,0.000024832781,0.000011814568,0.00001945001,0.000039450682,0.0000103593975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116737196,0.00040673668,0.0006897913,0.0002511183,0.0002156005,0.0007876607,0.0010706047,0.00096515944,0.0067305276],"category_scores_gemma":[0.00037615115,0.00019322679,0.0006903859,0.00022499677,0.00037573685,0.00060669036,0.00069513003,0.0009979003,0.0022938487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005257142,0.00006910172,0.00030198917,0.00034289702,0.000076862074,0.00033626799,0.0000794813,0.5438412,0.03152073,0.38212913,0.009521353,0.03172843],"study_design_scores_gemma":[0.000005619888,0.000016537171,0.0001331974,0.000010943764,0.000011086365,0.00014037546,0.000007761075,0.9439791,0.0013839909,0.049984355,0.00431609,0.000010998905],"about_ca_topic_score_codex":0.0010977717,"about_ca_topic_score_gemma":0.0012719387,"teacher_disagreement_score":0.0067305276,"about_ca_system_score_codex":0.00045935716,"about_ca_system_score_gemma":0.00048947183,"threshold_uncertainty_score":0.022515833},"labels":[],"label_agreement":null},{"id":"W2766935108","doi":"10.1007/978-3-319-69404-7_17","title":"An Experimental Study of Adaptive Capping in irace","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS","keywords":"Iterated function; Computer science; Minimisation (clinical trials); Running time; Algorithm; Physics; Discrete mathematics; Mathematics; Mathematical analysis; Statistics","score_opus":0.038389840693019886,"score_gpt":0.31140437355246336,"score_spread":0.2730145328594435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766935108","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.91073936,0.0008941568,0.05304438,0.00031064704,0.0009124497,0.0004691004,0.0014921443,0.004144248,0.027993534],"genre_scores_gemma":[0.94414115,0.00040396256,0.039828807,0.00025736104,0.00014536544,0.0002960894,0.0026488155,0.0016342162,0.010644236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989027,0.00031932673,0.00006682162,0.0002748498,0.00031387396,0.00012243034],"domain_scores_gemma":[0.990087,0.0052865217,0.00042516086,0.0027771762,0.0011158487,0.00030835508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012458331,0.00077154906,0.00067802344,0.0005433332,0.00061529706,0.001162447,0.0017645143,0.0010794973,0.016722117],"category_scores_gemma":[0.018292043,0.00029867602,0.00036860615,0.0008220134,0.0008120141,0.0017542186,0.0010796511,0.0012610832,0.0039655496],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015286161,0.0061676973,0.006924998,0.0030770474,0.00026936925,0.0009074993,0.0019185789,0.02798053,0.3890635,0.011195156,0.021690829,0.5155187],"study_design_scores_gemma":[0.001572524,0.020782819,0.04258617,0.0004179726,0.0006099477,0.003062332,0.0028143057,0.39387125,0.46480668,0.013490958,0.055609964,0.00037500748],"about_ca_topic_score_codex":0.00097511726,"about_ca_topic_score_gemma":0.000447006,"teacher_disagreement_score":0.016722117,"about_ca_system_score_codex":0.00025440005,"about_ca_system_score_gemma":0.00036445993,"threshold_uncertainty_score":0.055941045},"labels":[],"label_agreement":null},{"id":"W2766941706","doi":"10.1007/978-3-662-56006-8_1","title":"Emerging Directions in Virtual Worlds and Biometric Security Research","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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 Calgary","funders":"","keywords":"Biometrics; Computer science; Computer security; Metaverse; Human–computer interaction; Data science; World Wide Web; Virtual reality","score_opus":0.04526291637857034,"score_gpt":0.33226221340484385,"score_spread":0.2869992970262735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766941706","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009898697,0.69961387,0.06291079,0.033836726,0.0049027647,0.000037025504,0.00013415115,0.00027080366,0.18839514],"genre_scores_gemma":[0.2287368,0.6414632,0.047175836,0.0055662123,0.0067695174,0.00013242447,0.0004332439,0.00015114956,0.06957162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990662,0.000444834,0.000036700836,0.00012454808,0.00024390772,0.00008392752],"domain_scores_gemma":[0.9954071,0.0035724265,0.00015926562,0.00023623052,0.000341183,0.0002839179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218314,0.0006119652,0.0007508959,0.0016507163,0.0008100295,0.008729876,0.0014928366,0.002266784,0.02031458],"category_scores_gemma":[0.004954648,0.0003159576,0.00043548257,0.0033522185,0.003979842,0.010220529,0.0023367596,0.0027732474,0.0026537825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028885677,0.00005247308,0.0003850234,0.0005176547,0.000012357274,0.000056776924,0.0003927832,0.000594989,0.00040898766,0.7550859,0.0205669,0.22189729],"study_design_scores_gemma":[0.000009180481,0.000050856986,0.00062250614,0.00080759474,0.0000119043,0.00042112716,0.0013139183,0.002970641,0.00033595145,0.62435323,0.3690787,0.000024492214],"about_ca_topic_score_codex":0.001137242,"about_ca_topic_score_gemma":0.0014631742,"teacher_disagreement_score":0.02031458,"about_ca_system_score_codex":0.0014366844,"about_ca_system_score_gemma":0.0014335068,"threshold_uncertainty_score":0.06795901},"labels":[],"label_agreement":null},{"id":"W2766961992","doi":"10.1007/978-3-319-68136-8","title":"Service-Oriented Computing – ICSOC 2016 Workshops","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Concordia University","funders":"","keywords":"Computer science; Service (business); Software engineering","score_opus":0.012166984958924851,"score_gpt":0.2518134669385599,"score_spread":0.23964648197963503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766961992","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033373807,0.03726897,0.32976013,0.008588186,0.061252575,0.0010131128,0.0020857407,0.008759991,0.5178975],"genre_scores_gemma":[0.063069195,0.020957606,0.07761294,0.0011023667,0.004648852,0.00045865303,0.0067089256,0.0023398611,0.82310164],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989022,0.00021226161,0.000059634993,0.00014631903,0.0005245675,0.00015494981],"domain_scores_gemma":[0.9989598,0.00011610268,0.000029492348,0.00020524606,0.0004002381,0.00028912965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022608882,0.0016535847,0.0011737434,0.0011962366,0.0008544005,0.0033559483,0.001523534,0.0012375684,0.042138297],"category_scores_gemma":[0.0014639469,0.0006064568,0.0010833276,0.00192965,0.00052882533,0.0021130021,0.0019890962,0.0020407953,0.02909335],"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.0005359782,0.00054837833,0.00041373205,0.00052836153,0.000058693844,0.00022924825,0.00028683047,0.005662854,0.013940902,0.019801846,0.4313724,0.5266208],"study_design_scores_gemma":[0.000060352082,0.00025114778,0.0011711653,0.00036093974,0.000040085615,0.00040238904,0.0002188948,0.016269986,0.011370674,0.019596593,0.9502163,0.0000416229],"about_ca_topic_score_codex":0.002997213,"about_ca_topic_score_gemma":0.00403594,"teacher_disagreement_score":0.042138297,"about_ca_system_score_codex":0.0012549028,"about_ca_system_score_gemma":0.0027159709,"threshold_uncertainty_score":0.14096671},"labels":[],"label_agreement":null},{"id":"W2767171233","doi":"10.1007/978-3-662-56006-8","title":"Transactions on Computational Science XXX","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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 Calgary","funders":"","keywords":"Computer science","score_opus":0.08884652229243199,"score_gpt":0.3737517402504116,"score_spread":0.2849052179579796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767171233","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075023994,0.042135693,0.16071774,0.03329913,0.07010671,0.00026107574,0.0042608376,0.0025036552,0.67921287],"genre_scores_gemma":[0.0479527,0.029199418,0.03589025,0.0026182246,0.01074488,0.00036621472,0.0045129433,0.001624562,0.86709076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985707,0.00029122215,0.00008760009,0.00021796022,0.000729482,0.00010298038],"domain_scores_gemma":[0.997044,0.000824428,0.000091568254,0.0011908002,0.000641063,0.00020806075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019711768,0.0011444368,0.001985456,0.0014873828,0.0008524891,0.00525631,0.0011783981,0.0014625014,0.21337356],"category_scores_gemma":[0.0060491706,0.00052066514,0.0009415528,0.0027732395,0.0017260623,0.0022747081,0.0031589633,0.0032125346,0.08273985],"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.000092237286,0.00011003799,0.00053833076,0.00046488913,0.000084771746,0.00007234143,0.00007275682,0.003549923,0.0009546181,0.1467224,0.545119,0.30221874],"study_design_scores_gemma":[0.000033997614,0.000041857,0.0006712786,0.00021963024,0.000037830883,0.00013491327,0.00007224025,0.0110721495,0.0006555166,0.12642117,0.86062604,0.000013370737],"about_ca_topic_score_codex":0.0021816222,"about_ca_topic_score_gemma":0.002529719,"teacher_disagreement_score":0.21337356,"about_ca_system_score_codex":0.0017661721,"about_ca_system_score_gemma":0.0026519685,"threshold_uncertainty_score":0.7138057},"labels":[],"label_agreement":null},{"id":"W2767345932","doi":"10.1007/978-3-319-68179-5_31","title":"Multi-hop Clustering Solution Based on Beacon Delay for Vehicular Ad-Hoc Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Université de Montréal","funders":"","keywords":"Computer science; Cluster analysis; Wireless ad hoc network; Vehicular ad hoc network; Computer network; Hop (telecommunications); Obstacle; Distributed computing; Wireless; Telecommunications; Artificial intelligence","score_opus":0.016533863029792727,"score_gpt":0.2346346047484968,"score_spread":0.21810074171870406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767345932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032892503,0.0045460886,0.94723606,0.00029246006,0.0006906881,0.00011893573,0.00009170057,0.001259403,0.012872117],"genre_scores_gemma":[0.7343814,0.0030937851,0.24085015,0.00014381476,0.0002675443,0.00012824507,0.00034902673,0.00017119551,0.02061493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974686,0.000036110592,0.000010814927,0.0000609574,0.0001081744,0.000037050468],"domain_scores_gemma":[0.99979144,0.000048443944,0.000013735316,0.00002359756,0.000109016866,0.000013781292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024679975,0.0005094198,0.0005077822,0.0006967952,0.0005536798,0.0004991357,0.0014900295,0.00051837065,0.0018094184],"category_scores_gemma":[0.0005527618,0.00020005734,0.0003544877,0.0009706851,0.00016737689,0.00076163135,0.00051976216,0.00050365186,0.00056798384],"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.00033948297,0.00017038097,0.00073777215,0.00034182967,0.00010203792,0.00013970505,0.00013018142,0.20866363,0.05241909,0.021887565,0.012364536,0.7027037],"study_design_scores_gemma":[0.000033096072,0.00024566983,0.0010408318,0.000034650897,0.000093865834,0.00033297186,0.00014808886,0.95630336,0.02007034,0.008470155,0.013178484,0.00004851173],"about_ca_topic_score_codex":0.0017647705,"about_ca_topic_score_gemma":0.0030840116,"teacher_disagreement_score":0.0018094184,"about_ca_system_score_codex":0.00065316405,"about_ca_system_score_gemma":0.00061450386,"threshold_uncertainty_score":0.00605309},"labels":[],"label_agreement":null},{"id":"W2767801289","doi":"10.1007/978-3-319-75541-0_8","title":"GridNet with Automatic Shape Prior Registration for Automatic MRI Cardiac Segmentation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Artificial intelligence; Sørensen–Dice coefficient; Segmentation; Computer science; Hausdorff distance; Pattern recognition (psychology); Preprocessor; Computer vision; Deep learning; Convolutional neural network; Fully automatic; Image segmentation","score_opus":0.0164794992640584,"score_gpt":0.266395270442625,"score_spread":0.24991577117856661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767801289","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.02433816,0.000710068,0.9621401,0.00020790903,0.00018860235,0.000115135714,0.0005685004,0.008768574,0.0029628647],"genre_scores_gemma":[0.23477867,0.00073416095,0.75269634,0.00036005178,0.00010051318,0.0002228037,0.0022882859,0.0013724634,0.0074466984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975735,0.00003907518,0.000013872716,0.00006997825,0.00008047245,0.000039298888],"domain_scores_gemma":[0.9997433,0.000070651244,0.000019834113,0.000071015755,0.000077293655,0.000017854356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172806,0.0008785262,0.0010131303,0.00096558844,0.0004234619,0.0010580058,0.0013414735,0.0011774012,0.0051007187],"category_scores_gemma":[0.00092296116,0.00061772735,0.0008000748,0.0014168877,0.0003480394,0.0007357422,0.0011769145,0.0010114628,0.002793719],"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.00037837413,0.00014909722,0.00097233424,0.00016539276,0.00013393772,0.000177723,0.00008667295,0.14229012,0.024140567,0.0058455286,0.01873954,0.80692077],"study_design_scores_gemma":[0.0000218999,0.0000593692,0.00057524245,0.00001740692,0.000026588466,0.000121690304,0.000023813982,0.9792333,0.010714928,0.00478458,0.004404724,0.00001644457],"about_ca_topic_score_codex":0.012094037,"about_ca_topic_score_gemma":0.022146594,"teacher_disagreement_score":0.012094037,"about_ca_system_score_codex":0.0005633781,"about_ca_system_score_gemma":0.0014367767,"threshold_uncertainty_score":0.024047315},"labels":[],"label_agreement":null},{"id":"W2768096866","doi":"10.1007/978-3-319-70697-9_1","title":"Kummer for Genus One over Prime Order Fields","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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 Calgary","funders":"","keywords":"Scalar multiplication; SIMD; Elliptic curve; Intrinsics; Mathematics; Scalar (mathematics); Computer science; Arithmetic; Parallel computing; Pure mathematics; Geometry","score_opus":0.02159310684091215,"score_gpt":0.26097260597280836,"score_spread":0.2393794991318962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768096866","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10238295,0.030435061,0.06752264,0.0053683394,0.0037341674,0.000107064836,0.00042423038,0.0012296011,0.7887958],"genre_scores_gemma":[0.617259,0.01611485,0.019863179,0.001122965,0.0028482063,0.00011550383,0.00041391567,0.00069540506,0.34156695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997383,0.00005394962,0.00000981296,0.000040960906,0.00011317469,0.00004376271],"domain_scores_gemma":[0.999742,0.000102284495,0.000023963936,0.00005675513,0.000035383855,0.00003968303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033846698,0.0011295403,0.0007526496,0.0022260244,0.0016525893,0.0018386468,0.000688737,0.00086372596,0.013800763],"category_scores_gemma":[0.0009978699,0.00043085354,0.00037950702,0.0015146472,0.0027940155,0.0034206032,0.0016827921,0.0029469542,0.0054049236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027461452,0.000028609771,0.0000972027,0.00019527583,0.0000040901773,0.00008829254,0.0006227291,0.00048635306,0.0013549414,0.9421983,0.0123239765,0.04257284],"study_design_scores_gemma":[0.00001160958,0.00003339724,0.0003153905,0.000087917695,0.0000095372025,0.0003916237,0.000091847614,0.00083286525,0.00087326363,0.9182311,0.07910229,0.000019010453],"about_ca_topic_score_codex":0.00031407544,"about_ca_topic_score_gemma":0.0004440814,"teacher_disagreement_score":0.013800763,"about_ca_system_score_codex":0.0011089547,"about_ca_system_score_gemma":0.00055000605,"threshold_uncertainty_score":0.04616815},"labels":[],"label_agreement":null},{"id":"W2768261820","doi":"10.1007/978-3-319-70353-4_40","title":"Counting Large Flocks of Birds Using Videos Acquired with Hand-Held Devices","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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","funders":"","keywords":"Flock; Computer science; Wildlife; Ground truth; Segmentation; Computer vision; Artificial intelligence; Ecology; Biology","score_opus":0.03305754142590199,"score_gpt":0.2979585461368701,"score_spread":0.2649010047109681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768261820","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.79062724,0.0023309113,0.19299081,0.00011963961,0.00028761005,0.00029098472,0.0026116646,0.00168851,0.009052585],"genre_scores_gemma":[0.8032623,0.0011492705,0.18400507,0.00011772153,0.00017124119,0.00011078983,0.0027951533,0.000109138775,0.008279408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971575,0.00001955606,0.000013109563,0.00014898219,0.00007004504,0.000032527],"domain_scores_gemma":[0.9994566,0.00027769984,0.00006940603,0.000052548945,0.000085357686,0.000058445516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026226707,0.0008862831,0.00075167516,0.001462573,0.00030205742,0.00046693216,0.0010053038,0.00075429963,0.0028176676],"category_scores_gemma":[0.00082354934,0.00044506288,0.00031924743,0.0008981477,0.000188825,0.0009692781,0.00043783395,0.0002501653,0.001012602],"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.0008234675,0.0003293284,0.061927557,0.00062720594,0.0004542756,0.0004655159,0.00031350786,0.018225906,0.1794543,0.0005358853,0.006007391,0.7308357],"study_design_scores_gemma":[0.00009296521,0.0013076501,0.39393443,0.00021921218,0.00053864997,0.0028030768,0.0010380681,0.48803222,0.098850116,0.0032924048,0.009754353,0.00013693335],"about_ca_topic_score_codex":0.0043725898,"about_ca_topic_score_gemma":0.0137671735,"teacher_disagreement_score":0.0043725898,"about_ca_system_score_codex":0.00024075554,"about_ca_system_score_gemma":0.0001870745,"threshold_uncertainty_score":0.009425998},"labels":[],"label_agreement":null},{"id":"W2769237672","doi":"10.1007/978-3-030-01249-6_5","title":"Exploiting Temporal Information for 3D Human Pose Estimation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":265,"is_retracted":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":"Pose; Discriminative model; Estimator; Pattern recognition (psychology); Representation (politics); Sequence (biology); Constraint (computer-aided design); 3D pose estimation","score_opus":0.027001407482848034,"score_gpt":0.27194828352121836,"score_spread":0.24494687603837031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769237672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071544754,0.0013067845,0.98753524,0.0000602277,0.00011531875,0.00002243069,0.00047435396,0.0009461653,0.0023850445],"genre_scores_gemma":[0.2694556,0.005366045,0.7056679,0.00025959956,0.00040647993,0.0001555152,0.004561603,0.00065296504,0.013474336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997259,0.00003197339,0.000011738216,0.00007494265,0.00011842036,0.000037100184],"domain_scores_gemma":[0.99974066,0.00008450955,0.00002932702,0.00006422352,0.00006618526,0.000015186838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032673622,0.0010452872,0.0008142432,0.0010374734,0.00024192379,0.00069337414,0.0007561824,0.0007086682,0.004989078],"category_scores_gemma":[0.0009511113,0.00061662117,0.0008707556,0.0018829771,0.00025409195,0.0010597404,0.0010063574,0.0006591009,0.0031401],"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.0002120364,0.00008965428,0.0009517667,0.00020523458,0.0001094118,0.00013052933,0.00005223925,0.05199204,0.102203734,0.0031622704,0.007403511,0.8334876],"study_design_scores_gemma":[0.000012107253,0.00010821354,0.0034588168,0.000046352394,0.00008328953,0.0005603331,0.00004687606,0.9409992,0.033648174,0.008773217,0.0122216195,0.000041765976],"about_ca_topic_score_codex":0.0028616658,"about_ca_topic_score_gemma":0.008006031,"teacher_disagreement_score":0.004989078,"about_ca_system_score_codex":0.00016439318,"about_ca_system_score_gemma":0.0003931805,"threshold_uncertainty_score":0.016690135},"labels":[],"label_agreement":null},{"id":"W2769373697","doi":"10.1007/978-3-319-71147-8_5","title":"Touring Convex Polygons in Polygonal Domain Fences","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Regular polygon; Polygon (computer graphics); Point in polygon; Path (computing); Plane (geometry); Rectilinear polygon; Disjoint sets; Sequence (biology); Domain (mathematical analysis); Star-shaped polygon; Time complexity; Mathematics; Simple polygon; Computer science; Geometry; Convex set; Convex optimization","score_opus":0.018512377368217803,"score_gpt":0.25754169371214486,"score_spread":0.23902931634392705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769373697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12826507,0.0006366466,0.78840655,0.00035327554,0.00024555167,0.000190491,0.0008466622,0.0011762899,0.07987952],"genre_scores_gemma":[0.47800928,0.0014563242,0.42922193,0.00013452768,0.00006399771,0.00020561006,0.0018765959,0.0013804581,0.08765125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987364,0.000023514107,0.000005157321,0.000025790934,0.00004722424,0.00002473527],"domain_scores_gemma":[0.9998035,0.00007886934,0.000017024076,0.00003411783,0.00003409896,0.000032461616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001234865,0.00045462785,0.000546565,0.000451853,0.00053566694,0.00096571684,0.00086406176,0.0004841999,0.0090423515],"category_scores_gemma":[0.0009004561,0.0004424156,0.000471811,0.0006141894,0.0007212806,0.0008041783,0.0015667725,0.0010991001,0.0015326899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002245545,0.00006250848,0.0007500928,0.0005333126,0.000034969307,0.00061186234,0.00077404646,0.4887765,0.012328352,0.3238417,0.022835389,0.14922677],"study_design_scores_gemma":[0.000028277625,0.000063883665,0.00031803775,0.00010047646,0.000010422328,0.0002802772,0.0003637039,0.81167763,0.004275017,0.13652223,0.046334725,0.000025349591],"about_ca_topic_score_codex":0.002793274,"about_ca_topic_score_gemma":0.004055576,"teacher_disagreement_score":0.0090423515,"about_ca_system_score_codex":0.00051293534,"about_ca_system_score_gemma":0.0003653719,"threshold_uncertainty_score":0.030249655},"labels":[],"label_agreement":null},{"id":"W2769384867","doi":"10.1007/978-3-319-71150-8_34","title":"Research on Arrival Integration Method for Point Merge System in Tactical Operation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Air Traffic Management and Optimization","field":"Engineering","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":"International Civil Aviation Organization","funders":"","keywords":"Merge (version control); Correctness; Runway; Computer science; Workload; Real-time computing; Distributed computing; Algorithm; Parallel computing","score_opus":0.04549723252480092,"score_gpt":0.3364441777888894,"score_spread":0.2909469452640885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769384867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0185913,0.0023920853,0.9714954,0.00013108301,0.0002572337,0.000044297278,0.000035732937,0.00039065472,0.006662197],"genre_scores_gemma":[0.5748592,0.004675056,0.3969954,0.00016689539,0.00058652624,0.00010746379,0.00029818536,0.00022941531,0.022081725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995602,0.00007113471,0.000021637048,0.000105905536,0.00020374227,0.000037369675],"domain_scores_gemma":[0.9996407,0.00011094852,0.00002194265,0.000027960674,0.00017669499,0.000021778122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052747614,0.00060775294,0.0005651865,0.0005842371,0.00052561716,0.000901857,0.0011486247,0.00050074334,0.0044878265],"category_scores_gemma":[0.00095062493,0.00030785194,0.000642121,0.0007884334,0.00024733684,0.0015608461,0.00045119578,0.0011840223,0.0005707836],"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.00039796176,0.0002829185,0.00269455,0.0005398161,0.0001714615,0.00022753485,0.00037518932,0.25755188,0.04666531,0.050756946,0.0073869405,0.63294953],"study_design_scores_gemma":[0.000020940688,0.0001113192,0.0007555785,0.000021319152,0.000054065356,0.00014904694,0.0000754742,0.9788462,0.0076573906,0.005948952,0.006340234,0.000019542205],"about_ca_topic_score_codex":0.0034743492,"about_ca_topic_score_gemma":0.0020388404,"teacher_disagreement_score":0.0044878265,"about_ca_system_score_codex":0.00053083757,"about_ca_system_score_gemma":0.00078797713,"threshold_uncertainty_score":0.015013218},"labels":[],"label_agreement":null},{"id":"W2769413113","doi":"10.1007/978-3-319-71150-8_29","title":"Efficient Algorithms for Ridesharing of Personal Vehicles","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","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":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.026504039771946663,"score_gpt":0.2586471151874957,"score_spread":0.23214307541554907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769413113","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.022634663,0.0006300005,0.95567584,0.00022085568,0.00013746184,0.0002362894,0.0004696683,0.0030525385,0.016942576],"genre_scores_gemma":[0.2132555,0.00068283564,0.7623772,0.00009540834,0.00011360794,0.00020804052,0.0017121754,0.000711182,0.020844014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882287,0.00018822037,0.000070647955,0.0003142733,0.00034211326,0.00026190662],"domain_scores_gemma":[0.9983076,0.00067949604,0.00009062237,0.0006326711,0.0002040147,0.000085683416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614023,0.0015859561,0.0023096157,0.0014110585,0.0018372079,0.0033982736,0.0043204213,0.0022281394,0.023374422],"category_scores_gemma":[0.0049356427,0.0009986393,0.002081531,0.0026815967,0.0010675564,0.0041046534,0.003837894,0.0023434132,0.0050989063],"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.0003620022,0.00022946927,0.0006572966,0.0004654909,0.00008697155,0.0001048202,0.00032914625,0.28506547,0.0053968867,0.06606258,0.02241585,0.618824],"study_design_scores_gemma":[0.000090386326,0.000095288975,0.00030636613,0.000043534124,0.000043371765,0.0001632283,0.00021091125,0.85276836,0.0036115851,0.13019279,0.012444411,0.000029797126],"about_ca_topic_score_codex":0.0073535177,"about_ca_topic_score_gemma":0.008360003,"teacher_disagreement_score":0.023374422,"about_ca_system_score_codex":0.001725281,"about_ca_system_score_gemma":0.0016360054,"threshold_uncertainty_score":0.078195214},"labels":[],"label_agreement":null},{"id":"W2769466079","doi":"10.1007/978-3-319-70353-4_37","title":"A Domain Independent Approach to Video Summarization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Automatic summarization; Computer science; Domain (mathematical analysis); Shot (pellet); Slicing; Video tracking; Artificial intelligence; Video processing; Similarity (geometry); Perspective (graphical); Video compression picture types; Computer vision; Similarity measure; Information retrieval; Image (mathematics); Computer graphics (images)","score_opus":0.01640434308089216,"score_gpt":0.23864851211440652,"score_spread":0.22224416903351435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769466079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011698396,0.00067482376,0.99414814,0.00012667065,0.00009938777,0.00008770146,0.00018250615,0.0010120446,0.0024988514],"genre_scores_gemma":[0.042203065,0.0019704371,0.936481,0.00025893486,0.00055894733,0.000331941,0.002693362,0.00057837344,0.014923974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985568,0.00039963523,0.0001388383,0.00036410062,0.00044975925,0.00009096627],"domain_scores_gemma":[0.99731916,0.000816678,0.00015968666,0.0005154276,0.0011026314,0.00008651497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015548822,0.0014609805,0.0012456942,0.0028787558,0.0008345032,0.0022336151,0.00234987,0.0013264006,0.005521334],"category_scores_gemma":[0.0036788688,0.0005940268,0.0016902431,0.0027261388,0.000651624,0.0028695331,0.0021349743,0.0025328482,0.0048873555],"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.00023147662,0.00024457456,0.0003593769,0.00066818757,0.00019118407,0.00023834713,0.0003268521,0.018732157,0.060180664,0.032785676,0.021355128,0.86468637],"study_design_scores_gemma":[0.000062332154,0.0003926457,0.0017052329,0.00019471491,0.00039304022,0.0007341495,0.00048147936,0.72316307,0.089648925,0.09837218,0.084722236,0.00012994917],"about_ca_topic_score_codex":0.0011085368,"about_ca_topic_score_gemma":0.0017634832,"teacher_disagreement_score":0.005521334,"about_ca_system_score_codex":0.000567443,"about_ca_system_score_gemma":0.00075282605,"threshold_uncertainty_score":0.018470705},"labels":[],"label_agreement":null},{"id":"W2769532","doi":"10.1007/978-3-642-31638-8_32","title":"Providing QoS in the Integration of RFID and Wi-Fi WLAN","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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 Guelph; Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Quality of service; Throughput; Interference (communication); Radio-frequency identification; Transmission (telecommunications); Wireless; Telecommunications; Computer security","score_opus":0.03050417333077188,"score_gpt":0.26895532474566564,"score_spread":0.23845115141489376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769532","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057737947,0.023546884,0.83685905,0.0020857803,0.0009935136,0.000051358336,0.00007864861,0.0022952908,0.07635165],"genre_scores_gemma":[0.7271697,0.012778665,0.19116637,0.00061205996,0.0011436562,0.00005390421,0.00017242308,0.00033434902,0.06656882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999534,0.00009191746,0.000027703796,0.00007080054,0.00018985501,0.00008572129],"domain_scores_gemma":[0.9996136,0.00015826993,0.000031064927,0.000057449954,0.00010462778,0.00003499165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074913655,0.0004460876,0.00035193685,0.00039083126,0.00041266278,0.001981752,0.0011584884,0.0011044792,0.0026333241],"category_scores_gemma":[0.0013611789,0.00042809724,0.0002574123,0.00076829805,0.00057036703,0.0026755775,0.0009978281,0.0015234207,0.0014496517],"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.0004919387,0.00015219262,0.0021073837,0.00057169556,0.00005383076,0.0010321052,0.00074589613,0.023066526,0.117110625,0.21690273,0.0072275605,0.6305374],"study_design_scores_gemma":[0.00005985979,0.00063659163,0.0033688354,0.00054931035,0.00023188324,0.0045618564,0.00089659926,0.40591025,0.1069199,0.17413199,0.3025238,0.00020909547],"about_ca_topic_score_codex":0.00069262617,"about_ca_topic_score_gemma":0.0007177045,"teacher_disagreement_score":0.0026333241,"about_ca_system_score_codex":0.0005049204,"about_ca_system_score_gemma":0.00032930964,"threshold_uncertainty_score":0.008809388},"labels":[],"label_agreement":null},{"id":"W2769915601","doi":"10.1007/978-3-319-94631-3_4","title":"Most Complex Deterministic Union-Free Regular Languages","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Regular expression; Mathematics; Discrete mathematics; Nondeterministic finite automaton; State (computer science); Automaton; Star (game theory); Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Programming language","score_opus":0.016876873437716863,"score_gpt":0.27262869384931837,"score_spread":0.2557518204116015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769915601","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.5310166,0.0014041348,0.33663145,0.0043299072,0.00022948686,0.00015479515,0.0029002526,0.0024271512,0.12090629],"genre_scores_gemma":[0.94837403,0.00043387205,0.02373935,0.00065024727,0.00022639145,0.00016731022,0.0013679303,0.0005291527,0.024511768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762434,0.00032225237,0.0001825556,0.0008115308,0.0006861466,0.00037313116],"domain_scores_gemma":[0.99394256,0.0037871234,0.00046968763,0.0007285943,0.0006801055,0.0003919211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014671435,0.0008998952,0.0013895942,0.0012779599,0.0025462334,0.007189685,0.001544241,0.001640137,0.01550902],"category_scores_gemma":[0.0058388757,0.0012931796,0.0013954146,0.0012904801,0.0036092505,0.008225678,0.0035875312,0.0032262912,0.003489468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024837838,0.000050590457,0.0007508812,0.00018905471,0.000035175377,0.00023975594,0.0008294832,0.002197037,0.003839986,0.9787139,0.003055102,0.009850597],"study_design_scores_gemma":[0.000037544276,0.000017363502,0.00024940964,0.000020523848,0.000029446646,0.00028440665,0.00012852595,0.005365129,0.0021869924,0.98687047,0.004785172,0.000024903824],"about_ca_topic_score_codex":0.0005465778,"about_ca_topic_score_gemma":0.00070484384,"teacher_disagreement_score":0.01550902,"about_ca_system_score_codex":0.0016891878,"about_ca_system_score_gemma":0.0010487934,"threshold_uncertainty_score":0.051882803},"labels":[],"label_agreement":null},{"id":"W276996006","doi":"10.1007/978-3-319-10443-0_22","title":"Automatic Method for Thalamus Parcellation Using Multi-modal Feature Classification","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Neurological Disorders and Stroke; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Computer science; Modal; Artificial intelligence; Pattern recognition (psychology); Feature (linguistics)","score_opus":0.1041728978129066,"score_gpt":0.4138508495461696,"score_spread":0.30967795173326296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W276996006","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.018539958,0.00068542064,0.97273016,0.00016165702,0.00012873704,0.0001679448,0.0008544466,0.00546143,0.0012702403],"genre_scores_gemma":[0.16408812,0.000651915,0.8273411,0.00016731308,0.00013649798,0.00034294682,0.0026024042,0.0007977635,0.0038720355],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994085,0.000055618282,0.00003520896,0.000207296,0.00016500417,0.00012831176],"domain_scores_gemma":[0.99932826,0.00013849179,0.00005701248,0.00010591106,0.00031763033,0.000052715357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068633497,0.0013043458,0.001294825,0.0023442493,0.0006589451,0.0014808013,0.001551502,0.0013003151,0.004716695],"category_scores_gemma":[0.0012097383,0.00048115847,0.0013713078,0.0018938772,0.00030157343,0.00081887026,0.0011797767,0.0011248817,0.0033368769],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003985924,0.000111610905,0.0027339594,0.0002229864,0.00012084451,0.0001891254,0.00012112153,0.0038323686,0.15224367,0.0012418906,0.008408881,0.83037496],"study_design_scores_gemma":[0.00014178304,0.00026214434,0.027964141,0.00007984801,0.0004290416,0.0018000556,0.00031951786,0.7129375,0.22717111,0.007307869,0.021388117,0.00019881174],"about_ca_topic_score_codex":0.0065347846,"about_ca_topic_score_gemma":0.01143804,"teacher_disagreement_score":0.0065347846,"about_ca_system_score_codex":0.00039267988,"about_ca_system_score_gemma":0.0012898307,"threshold_uncertainty_score":0.0157789},"labels":[],"label_agreement":null},{"id":"W2770028763","doi":"10.1007/978-3-319-70353-4_5","title":"Real Time Continuous Tracking of Dynamic Hand Gestures on a Mobile GPU","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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","funders":"","keywords":"Computer science; Gesture; Expansive; Computer vision; Tracking (education); Mobile device; Encoding (memory); Scheme (mathematics); Artificial intelligence; Computer graphics (images); Limiting; Gesture recognition; Operating system","score_opus":0.014285082835909445,"score_gpt":0.26059110947467884,"score_spread":0.24630602663876938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770028763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27630222,0.0015287668,0.67930007,0.00036817146,0.00042496942,0.00014908805,0.0010705795,0.01271098,0.028145174],"genre_scores_gemma":[0.72583956,0.00042234117,0.255248,0.00015542406,0.00004411361,0.000078539306,0.0006114761,0.0005612418,0.017039292],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997942,0.000014747805,0.000007330064,0.00005365657,0.00010107894,0.000028924742],"domain_scores_gemma":[0.99971825,0.000066784596,0.000019621719,0.000060481074,0.00010306108,0.00003172645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015768176,0.0004341251,0.0005283832,0.00043244637,0.0003266696,0.0008663281,0.0006882616,0.00045243875,0.006641736],"category_scores_gemma":[0.00069148914,0.0002910147,0.0001493618,0.00073731405,0.00015634151,0.00045670057,0.0005682925,0.00038487357,0.0015944374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012102855,0.0000973874,0.0036953622,0.00021490724,0.000071594266,0.00036917056,0.00030988164,0.018239183,0.3739526,0.002670449,0.016740989,0.5824282],"study_design_scores_gemma":[0.00012054576,0.00039445036,0.014825642,0.00008394794,0.000074867196,0.0008746149,0.00016918115,0.8236163,0.12283158,0.0025556532,0.034384992,0.000068187124],"about_ca_topic_score_codex":0.0061532315,"about_ca_topic_score_gemma":0.010106431,"teacher_disagreement_score":0.006641736,"about_ca_system_score_codex":0.00036174728,"about_ca_system_score_gemma":0.0005563553,"threshold_uncertainty_score":0.022218823},"labels":[],"label_agreement":null},{"id":"W2770061542","doi":"10.1007/978-3-319-70278-0_27","title":"Practical Governmental Voting with Unconditional Integrity and Privacy","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Concordia University","funders":"","keywords":"Ballot; Voting; Computer science; Verifiable secret sharing; Computer security; Interdependence; Electronic voting; Cryptography; Blockchain; Secret ballot; Internet privacy; Political science; Law","score_opus":0.02299137317024509,"score_gpt":0.2738824927723345,"score_spread":0.25089111960208943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770061542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037305754,0.00035905847,0.8274042,0.003934598,0.00027895687,0.00018713193,0.00021890418,0.0007943548,0.12951702],"genre_scores_gemma":[0.83233744,0.0003317644,0.11619217,0.0004810776,0.00027429423,0.00021611145,0.0003756817,0.00027144112,0.04952008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920048,0.0033627003,0.0003258619,0.0009970993,0.0022852123,0.0010242577],"domain_scores_gemma":[0.9917012,0.0033639562,0.00025623656,0.003993612,0.0005238369,0.00016117663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042739166,0.0008281056,0.0014010412,0.00066132133,0.002331757,0.0050217193,0.0021588719,0.0031855495,0.012448709],"category_scores_gemma":[0.017959977,0.0007500862,0.0011401903,0.0017097221,0.0043537705,0.008303252,0.0055945306,0.00508706,0.00363321],"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.000091192305,0.000048910744,0.00016022784,0.000042457286,0.000014658117,0.00005068104,0.00017584163,0.009887151,0.000699727,0.94624555,0.0044911047,0.038092498],"study_design_scores_gemma":[0.000018570541,0.000014776402,0.000037647424,0.000010393523,0.0000072541256,0.00005523015,0.000043455697,0.027113067,0.00086667354,0.96725845,0.004568101,0.000006390422],"about_ca_topic_score_codex":0.00044567615,"about_ca_topic_score_gemma":0.0005620383,"teacher_disagreement_score":0.012448709,"about_ca_system_score_codex":0.0016251751,"about_ca_system_score_gemma":0.0020431567,"threshold_uncertainty_score":0.04164505},"labels":[],"label_agreement":null},{"id":"W2770107761","doi":"10.1007/978-3-319-71069-3_23","title":"Heat-Bath Algorithmic Cooling with Correlated-Qubits Relaxation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"","keywords":"Qubit; Reset (finance); Computer science; Quantum computer; Relaxation (psychology); Statistical physics; Quantum mechanics; Quantum; Physics; Algorithm","score_opus":0.010739252846637478,"score_gpt":0.22897986823454894,"score_spread":0.21824061538791145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770107761","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.06442721,0.0013112914,0.82977206,0.0016138151,0.00073364784,0.0001628261,0.00020502746,0.0005978837,0.10117625],"genre_scores_gemma":[0.774549,0.0007892566,0.1849345,0.0005382363,0.00026742395,0.0003816974,0.00029400954,0.0005972999,0.037648562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999694,0.000108390894,0.000011504775,0.000050132945,0.000089910805,0.000046046232],"domain_scores_gemma":[0.99955994,0.00024039256,0.000018183677,0.00010763752,0.000039739723,0.000034040044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006453275,0.0005513022,0.00076511037,0.00033497054,0.0007125153,0.0009949869,0.0018155626,0.0009176754,0.009975684],"category_scores_gemma":[0.0019106286,0.00039612633,0.0007288963,0.0005438816,0.0019149209,0.0016152451,0.0021447479,0.0025051378,0.0009328345],"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.00014483216,0.00007741697,0.00014156984,0.0002500874,0.00004433032,0.000043793392,0.00015418655,0.13814066,0.0063802926,0.8235873,0.005630489,0.025405029],"study_design_scores_gemma":[0.00006534476,0.00005297233,0.00018944014,0.00004866687,0.000015144917,0.000035737095,0.000031390544,0.6684272,0.0034199841,0.32233295,0.0053561884,0.000024926136],"about_ca_topic_score_codex":0.0005107435,"about_ca_topic_score_gemma":0.0011744134,"teacher_disagreement_score":0.009975684,"about_ca_system_score_codex":0.00075613876,"about_ca_system_score_gemma":0.0008551226,"threshold_uncertainty_score":0.033371925},"labels":[],"label_agreement":null},{"id":"W2770860322","doi":"10.1007/978-3-319-71075-4","title":"Security Protocols XXV","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer security; Focus (optics); Cryptographic protocol; Computer security model; Security analysis; Cryptography","score_opus":0.02301710578389255,"score_gpt":0.32358495098694695,"score_spread":0.3005678452030544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770860322","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014160596,0.02737946,0.100671545,0.0032965122,0.0047999704,0.00023651868,0.0013902421,0.0032464508,0.85756314],"genre_scores_gemma":[0.013616646,0.026446763,0.015733879,0.0009502873,0.0026950727,0.0003931969,0.0027250673,0.0012632407,0.9361759],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862754,0.00018501937,0.000055150176,0.0001713117,0.00086735655,0.00009368201],"domain_scores_gemma":[0.99940324,0.00015868439,0.00003266889,0.00019722221,0.00016433523,0.00004392849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313124,0.0020531877,0.0010295009,0.0022856523,0.0013538129,0.004316788,0.0010807918,0.0014057363,0.10886427],"category_scores_gemma":[0.0016465387,0.00093885243,0.0006955376,0.003035668,0.001513697,0.0046017226,0.002557954,0.0040929103,0.11891845],"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.000035699362,0.000072346695,0.00009070709,0.00048942445,0.000019558427,0.00005634184,0.00019695394,0.0013048182,0.0018250142,0.24288332,0.40076146,0.35226434],"study_design_scores_gemma":[0.000011950079,0.000022983648,0.00014295371,0.00029216614,0.000009869169,0.00016126348,0.000046431436,0.0016110409,0.0010661971,0.10266473,0.89395565,0.000014734624],"about_ca_topic_score_codex":0.0009738072,"about_ca_topic_score_gemma":0.0010519666,"teacher_disagreement_score":0.10886427,"about_ca_system_score_codex":0.0021238513,"about_ca_system_score_gemma":0.0018242673,"threshold_uncertainty_score":0.3641873},"labels":[],"label_agreement":null},{"id":"W2771852645","doi":"10.1007/978-3-319-72359-4_49","title":"Reasoning About Trust and Belief Change on a Social Network: A Formal Approach","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Subjective logic; Belief revision; Social trust; Computational trust; Social network (sociolinguistics); Operator (biology); Artificial intelligence; World Wide Web; Social media; Sociology; Social capital; Reputation","score_opus":0.04469917792406247,"score_gpt":0.2971478649745092,"score_spread":0.2524486870504467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771852645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011287591,0.00023877878,0.983687,0.0015052576,0.000047400248,0.000068362606,0.00021177458,0.00014420756,0.0028097504],"genre_scores_gemma":[0.5840864,0.000750689,0.40878212,0.00043737722,0.00028855598,0.00041825653,0.0008000163,0.00012131474,0.0043153195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99195683,0.0036493263,0.0007551242,0.0012049405,0.0018432435,0.0005905153],"domain_scores_gemma":[0.94768864,0.044810805,0.002354669,0.0025688556,0.0019141232,0.0006628907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008446022,0.0012271076,0.001638151,0.0025328116,0.0016904362,0.006300446,0.0039358167,0.002960849,0.0045297067],"category_scores_gemma":[0.038281318,0.0017206054,0.004363024,0.0027423576,0.0061128885,0.017730966,0.0054337475,0.0058144224,0.00049627735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006944246,0.00009197623,0.0013488458,0.000195697,0.00017061263,0.00043892718,0.0008595654,0.08793816,0.00069856114,0.8893033,0.0013237335,0.017561128],"study_design_scores_gemma":[0.000022655804,0.000016396487,0.00013715419,0.000035381774,0.000056480796,0.000093154136,0.00014347861,0.25226098,0.00034524323,0.7457913,0.0010777329,0.000019996614],"about_ca_topic_score_codex":0.008815674,"about_ca_topic_score_gemma":0.008160643,"teacher_disagreement_score":0.008815674,"about_ca_system_score_codex":0.003971851,"about_ca_system_score_gemma":0.0017146252,"threshold_uncertainty_score":0.044667363},"labels":[],"label_agreement":null},{"id":"W2772291774","doi":"10.1007/978-3-319-91641-5_2","title":"New Techniques for Inferring L-systems Using Genetic Algorithm","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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 Saskatchewan","funders":"","keywords":"Computer science; Testbed; Bootstrapping (finance); String (physics); Inference; Context (archaeology); Algorithm; Theoretical computer science; Genetic algorithm; Artificial intelligence; Machine learning","score_opus":0.026322928734260568,"score_gpt":0.2420655231070906,"score_spread":0.21574259437283003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772291774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044353046,0.0000944376,0.9938508,0.000057264548,0.000016321188,0.000028706274,0.000058768244,0.000657674,0.0008006629],"genre_scores_gemma":[0.074928075,0.00010259657,0.9232104,0.00007191518,0.000029537103,0.00010244903,0.0003099717,0.0002365197,0.0010084191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989225,0.00038305606,0.00008127178,0.0003299147,0.00021471357,0.0000685834],"domain_scores_gemma":[0.99507254,0.0034989205,0.0002974003,0.0006011485,0.00044593177,0.00008402715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015656824,0.0013901071,0.0012917356,0.002268862,0.0011070458,0.0015670386,0.0027205183,0.001868873,0.0047388063],"category_scores_gemma":[0.01063717,0.0010638316,0.0019771012,0.0019717172,0.0015157755,0.0026624938,0.0021393155,0.0030134693,0.0013795701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108548804,0.00016553437,0.0029804371,0.00027056783,0.0002131148,0.00018178347,0.0003218969,0.6233714,0.006005939,0.04912562,0.0019190809,0.31533605],"study_design_scores_gemma":[0.000018078625,0.000014793119,0.00018246754,0.000021686179,0.000025130583,0.000025858604,0.000022765535,0.9574326,0.0010657732,0.04035269,0.0008241978,0.000013901912],"about_ca_topic_score_codex":0.0085041355,"about_ca_topic_score_gemma":0.010562493,"teacher_disagreement_score":0.0085041355,"about_ca_system_score_codex":0.0010828958,"about_ca_system_score_gemma":0.00124723,"threshold_uncertainty_score":0.016909242},"labels":[],"label_agreement":null},{"id":"W2772456949","doi":"10.1007/978-3-319-77935-5_10","title":"Formal Dynamic Fault Trees Analysis Using an Integration of Theorem Proving and Model Checking","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Model checking; Automated theorem proving; Fault tree analysis; Formal methods; Algorithm; Theoretical computer science; Programming language; Reliability engineering","score_opus":0.035706098404780555,"score_gpt":0.30842993628922866,"score_spread":0.2727238378844481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772456949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017713698,0.00008304088,0.99546117,0.000054672637,0.000035496825,0.000040970215,0.000050646886,0.0010611123,0.0014414908],"genre_scores_gemma":[0.12770426,0.00030977337,0.86753625,0.00011303673,0.00007690071,0.00016724491,0.0003384971,0.0007028775,0.003051196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733824,0.0005454905,0.00017304916,0.00044304135,0.0012119778,0.00028809792],"domain_scores_gemma":[0.99548316,0.0028059627,0.00028804073,0.0009352727,0.00042934174,0.000058204558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022708718,0.0011762629,0.001271198,0.0021544336,0.00086617656,0.0022115717,0.003106401,0.0012065426,0.006790193],"category_scores_gemma":[0.0066479202,0.0009287941,0.0026842018,0.0014780648,0.002377858,0.0041521783,0.0021488788,0.002311422,0.0013502712],"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.00011214319,0.0003147402,0.0010547978,0.0005768738,0.00012586445,0.00043407085,0.00027788442,0.2091108,0.027035462,0.5134761,0.0050205607,0.24246079],"study_design_scores_gemma":[0.00003738582,0.000058654885,0.00023316588,0.00008201856,0.000088706634,0.00029562702,0.00003099949,0.5803588,0.01784306,0.39180288,0.009133062,0.0000356313],"about_ca_topic_score_codex":0.0018445802,"about_ca_topic_score_gemma":0.0022766448,"teacher_disagreement_score":0.006790193,"about_ca_system_score_codex":0.0013568127,"about_ca_system_score_gemma":0.0020465448,"threshold_uncertainty_score":0.02271545},"labels":[],"label_agreement":null},{"id":"W2775462516","doi":"10.1007/978-3-642-12200-2_59","title":"Layered Working-Set Trees","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":"Computer science; Set (abstract data type); Theoretical computer science; Programming language","score_opus":0.031656926722692824,"score_gpt":0.2645210166984087,"score_spread":0.2328640899757159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775462516","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.020931698,0.0013049066,0.86958706,0.0006295885,0.00020016402,0.00008029137,0.0012889854,0.002229729,0.10374772],"genre_scores_gemma":[0.28216988,0.002333879,0.61403215,0.00037381772,0.00025687437,0.00026072006,0.00391101,0.0015895399,0.0950721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994723,0.00007372527,0.000037720238,0.00009063729,0.00023003176,0.00009552185],"domain_scores_gemma":[0.99858886,0.00044989682,0.000064778,0.0005468202,0.00020454195,0.00014516525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066727883,0.0005676792,0.00086971244,0.0012208814,0.001110324,0.0029187086,0.0016742822,0.0008549311,0.019395899],"category_scores_gemma":[0.003374362,0.0007016727,0.00089177315,0.0023011083,0.00094905833,0.004505552,0.0024153257,0.0025943888,0.0072884215],"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.000060636812,0.000038089307,0.0002634177,0.000127588,0.00002321683,0.000068068744,0.00018351151,0.011260321,0.0026224277,0.78300047,0.016177127,0.18617512],"study_design_scores_gemma":[0.000009384334,0.000021704316,0.00020486569,0.00005644805,0.00002212309,0.00020046381,0.000048591606,0.038595557,0.0020491972,0.91299945,0.045774415,0.000017839919],"about_ca_topic_score_codex":0.00063071394,"about_ca_topic_score_gemma":0.001129111,"teacher_disagreement_score":0.019395899,"about_ca_system_score_codex":0.00076756923,"about_ca_system_score_gemma":0.0007099549,"threshold_uncertainty_score":0.064885736},"labels":[],"label_agreement":null},{"id":"W2775854174","doi":"10.1007/978-3-319-71273-4_4","title":"Boosting Based Multiple Kernel Learning and Transfer Regression for Electricity Load Forecasting","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Boosting (machine learning); Smart grid; Electricity; Kernel (algebra); Machine learning; Scheduling (production processes); Ensemble learning; Multiple kernel learning; Probabilistic forecasting; Computation; Artificial intelligence; Demand response; Support vector machine; Gradient boosting; Mathematical optimization; Kernel method; Random forest; Engineering; Algorithm","score_opus":0.02242800543985167,"score_gpt":0.23150138896025196,"score_spread":0.20907338352040028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775854174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019868419,0.0016342115,0.97587943,0.00014055609,0.0001747458,0.00002113109,0.000046588237,0.00090283476,0.0013321908],"genre_scores_gemma":[0.6847042,0.0013575001,0.30142307,0.00013154614,0.00026889436,0.00009625516,0.0003863879,0.0002829175,0.01134935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.00018875062,0.000026533644,0.0000764595,0.00012859025,0.000047809775],"domain_scores_gemma":[0.9990036,0.0005024203,0.000048073936,0.00013287849,0.00028473372,0.000028278382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014147304,0.00049962575,0.0012987402,0.00054975157,0.00034743242,0.0006397122,0.0014110969,0.001017392,0.0019778842],"category_scores_gemma":[0.0034027726,0.0003843218,0.0008321096,0.0011563804,0.00034100396,0.001089071,0.000874899,0.0016380177,0.001248091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022911995,0.0001610512,0.0006679513,0.0001357745,0.00010098955,0.00005835375,0.00006261268,0.49472836,0.006113622,0.011478004,0.0069646444,0.47929958],"study_design_scores_gemma":[0.0000016811781,0.000008674715,0.00010687747,0.0000017651861,0.0000037572179,0.000004844025,0.0000012751559,0.9978023,0.00033956376,0.0014143694,0.0003124494,0.000002378736],"about_ca_topic_score_codex":0.0023983023,"about_ca_topic_score_gemma":0.0018025939,"teacher_disagreement_score":0.0023983023,"about_ca_system_score_codex":0.00047350844,"about_ca_system_score_gemma":0.00046672637,"threshold_uncertainty_score":0.007481873},"labels":[],"label_agreement":null},{"id":"W2775917193","doi":"10.1007/978-3-319-72565-9_4","title":"Side-Channel Attacks on Quantum-Resistant Supersingular Isogeny Diffie-Hellman","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Context (archaeology); Power analysis; Key exchange; Diffie–Hellman key exchange; Computer science; Mathematics; Public-key cryptography; Cryptography; Computer security; Elliptic curve; Pure mathematics","score_opus":0.0197582352092199,"score_gpt":0.24830911959804994,"score_spread":0.22855088438883003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775917193","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.38137302,0.0032374782,0.39345196,0.006173131,0.001144077,0.0003631915,0.0006192055,0.0025967788,0.21104121],"genre_scores_gemma":[0.95937455,0.0009422797,0.01926538,0.000393946,0.00029619795,0.000090867434,0.0002225678,0.00017012413,0.019244041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997308,0.00065602566,0.00008944449,0.00021594937,0.0012166776,0.00051395886],"domain_scores_gemma":[0.9973002,0.00097335066,0.00018649208,0.0012000155,0.00023306085,0.00010687107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016332717,0.00090950605,0.0011899044,0.0009903376,0.001286768,0.0016610458,0.0010268684,0.0017492148,0.0072179222],"category_scores_gemma":[0.003590889,0.00059867336,0.0009707179,0.0011056146,0.0023268955,0.0040069255,0.0038947505,0.0035116635,0.0027137941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095660257,0.00017136241,0.000873712,0.00022205869,0.00012842374,0.00058395416,0.0005892974,0.023668315,0.023885105,0.8546272,0.015239901,0.079054125],"study_design_scores_gemma":[0.0002063498,0.00025539257,0.0007257368,0.000122065634,0.000109753986,0.0010015372,0.00019100387,0.14590861,0.045230474,0.78271013,0.02343754,0.00010140095],"about_ca_topic_score_codex":0.0003057352,"about_ca_topic_score_gemma":0.00028296732,"teacher_disagreement_score":0.0072179222,"about_ca_system_score_codex":0.0011138549,"about_ca_system_score_gemma":0.0009854077,"threshold_uncertainty_score":0.024146318},"labels":[],"label_agreement":null},{"id":"W2776149060","doi":"10.1007/978-3-319-72050-0_17","title":"How to Choose Friends Strategically","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Viral marketing; Bipartite graph; Computer science; Product (mathematics); Maximization; Set (abstract data type); Social network (sociolinguistics); Join (topology); Alice (programming language); Time complexity; Theoretical computer science; Combinatorics; Mathematical optimization; Mathematics; Algorithm; Graph; World Wide Web; Social media","score_opus":0.018573268011307213,"score_gpt":0.26849877290742563,"score_spread":0.24992550489611842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776149060","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19235972,0.00097426254,0.19565514,0.037614234,0.001167431,0.00030173475,0.0010778818,0.0011006086,0.56974894],"genre_scores_gemma":[0.81595594,0.000416115,0.037012246,0.0015678218,0.000147352,0.00015507557,0.00044062093,0.00033054213,0.14397421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912876,0.00037886118,0.000025226198,0.0001662489,0.0001710427,0.00012982654],"domain_scores_gemma":[0.9972289,0.0013568448,0.00012722301,0.00047929375,0.0003162767,0.00049147656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209486,0.0003030904,0.00042302578,0.00033232756,0.0016108818,0.002519814,0.0009620865,0.001639297,0.044486023],"category_scores_gemma":[0.00796444,0.0002771803,0.00039313312,0.00051278376,0.00087229774,0.0054792175,0.0015439645,0.0021897606,0.011726677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045374528,0.00037886086,0.006230225,0.0002109325,0.00010322478,0.0004041425,0.0031310664,0.0071688457,0.005269796,0.6326208,0.10526694,0.23876132],"study_design_scores_gemma":[0.00009720285,0.00011464692,0.0018535185,0.00010774232,0.000088524546,0.0003870971,0.006975034,0.043784317,0.0047238492,0.8029794,0.13881113,0.00007743946],"about_ca_topic_score_codex":0.0017637938,"about_ca_topic_score_gemma":0.0044558276,"teacher_disagreement_score":0.044486023,"about_ca_system_score_codex":0.0005426955,"about_ca_system_score_gemma":0.0008727534,"threshold_uncertainty_score":0.14882058},"labels":[],"label_agreement":null},{"id":"W2776179661","doi":"10.1007/978-3-319-71249-9_27","title":"Crossprop: Learning Representations by Stochastic Meta-Gradient Descent in Neural Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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 Alberta","funders":"","keywords":"Computer science; Stochastic gradient descent; Gradient descent; Representation (politics); Artificial intelligence; Meta learning (computer science); Artificial neural network; Domain (mathematical analysis); Feature (linguistics); Scaling; Algorithm; Machine learning; Mathematics","score_opus":0.03854797923379474,"score_gpt":0.284209923196719,"score_spread":0.24566194396292426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776179661","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.004017056,0.0013066931,0.99105084,0.00019313201,0.00013636553,0.00002614473,0.00011766907,0.0018173647,0.001334824],"genre_scores_gemma":[0.1540196,0.0015559075,0.8266501,0.00044623052,0.00025463337,0.0002965439,0.0013563227,0.0016501544,0.013770412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995433,0.00014729355,0.000026488338,0.00013327882,0.000107070075,0.00004262712],"domain_scores_gemma":[0.99924797,0.00040080608,0.00004258402,0.00013061851,0.0001378507,0.000040195693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015248959,0.0014423782,0.0015618994,0.00062235445,0.00040743715,0.0016144372,0.0029563478,0.0026288382,0.0050279535],"category_scores_gemma":[0.0030687193,0.0009640832,0.00089704996,0.0011486756,0.00076591934,0.002419508,0.0021225794,0.0032320053,0.0023808347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012253897,0.00012041287,0.00031399264,0.00021178593,0.0001574676,0.0000863486,0.0000551539,0.62873775,0.003071748,0.025703682,0.019162051,0.3222571],"study_design_scores_gemma":[0.0000057548605,0.000011589626,0.000034652905,0.000010105981,0.000006530378,0.000010436331,0.0000021860096,0.9896827,0.00058292475,0.008800588,0.000847642,0.000004840162],"about_ca_topic_score_codex":0.0037013504,"about_ca_topic_score_gemma":0.0044302326,"teacher_disagreement_score":0.0050279535,"about_ca_system_score_codex":0.0007208456,"about_ca_system_score_gemma":0.00097092096,"threshold_uncertainty_score":0.016820192},"labels":[],"label_agreement":null},{"id":"W2777059928","doi":"10.1007/978-3-319-72453-9_13","title":"Jordan Canonical Form with Parameters from Frobenius Form with Parameters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Canonical form; Symbolic computation; Algebra over a field; Generality; Matrix (chemical analysis); Computer science; Computation; Square matrix; Theoretical computer science; Algorithm; Mathematics; Pure mathematics; Symmetric matrix","score_opus":0.016118364746580384,"score_gpt":0.22829912144853787,"score_spread":0.2121807567019575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777059928","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082674816,0.0020296674,0.34635502,0.0035427203,0.004053476,0.00026028496,0.0008628529,0.001125221,0.559096],"genre_scores_gemma":[0.5023249,0.0029059385,0.10187132,0.0016106103,0.00418719,0.00028137385,0.0011901673,0.0024267293,0.3832018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951494,0.00009408575,0.00002456633,0.000107980275,0.00019047233,0.00006791377],"domain_scores_gemma":[0.99973744,0.000029157341,0.000023381886,0.000056626355,0.000097797165,0.000055618344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053003494,0.0009699816,0.00082849705,0.0015149638,0.0016735068,0.0025117227,0.000833245,0.0010172277,0.01687554],"category_scores_gemma":[0.0010166798,0.00046034757,0.0007955734,0.0010447253,0.0023908017,0.004710243,0.0022899343,0.004017806,0.008509818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020870333,0.000014095391,0.00004772194,0.000045144756,0.000005713233,0.000056149704,0.0001906289,0.0003399585,0.001535877,0.9781586,0.0057667997,0.0138183925],"study_design_scores_gemma":[0.0000101301775,0.00003211097,0.000085408145,0.000018850043,0.0000074241084,0.00037698742,0.00009140518,0.0012389751,0.0017997657,0.9288447,0.067470156,0.00002406377],"about_ca_topic_score_codex":0.0003125127,"about_ca_topic_score_gemma":0.0003837455,"teacher_disagreement_score":0.01687554,"about_ca_system_score_codex":0.00076298503,"about_ca_system_score_gemma":0.0007678007,"threshold_uncertainty_score":0.0564543},"labels":[],"label_agreement":null},{"id":"W2777450615","doi":"10.1007/978-3-319-72565-9_22","title":"Multidimensional Zero-Correlation Linear Cryptanalysis of Reduced Round SPARX-128","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Linear cryptanalysis; Algorithm; Cryptanalysis; Codebook; Cryptography","score_opus":0.026933934945217456,"score_gpt":0.2906427089962751,"score_spread":0.26370877405105764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777450615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20396633,0.0045302454,0.68099535,0.0016278428,0.00054913264,0.0002358159,0.0003568522,0.0034171245,0.10432127],"genre_scores_gemma":[0.7734861,0.0014062414,0.16275653,0.00038587055,0.00021564486,0.00011191894,0.00042923374,0.00038626636,0.060822148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00017594942,0.00003775273,0.0001088549,0.0004619568,0.00011786882],"domain_scores_gemma":[0.99957865,0.00012175123,0.000039331644,0.00018041243,0.0000615995,0.00001830461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006341714,0.0007144232,0.000604818,0.0005657446,0.0004986542,0.001381499,0.0007950027,0.0005261768,0.008814158],"category_scores_gemma":[0.0012622494,0.000374282,0.00053084234,0.00077611406,0.0008710867,0.001529455,0.0014384605,0.0013164142,0.0033160786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011713594,0.00018937662,0.0012846147,0.0005206196,0.0002033171,0.0005195361,0.000372116,0.027334187,0.10261184,0.4256574,0.01596508,0.42417067],"study_design_scores_gemma":[0.00023667265,0.0009294466,0.0025319175,0.0003643818,0.00020085344,0.0033033267,0.00018157887,0.27387208,0.3395433,0.28994468,0.08871027,0.00018156883],"about_ca_topic_score_codex":0.00016981685,"about_ca_topic_score_gemma":0.00039449756,"teacher_disagreement_score":0.008814158,"about_ca_system_score_codex":0.0006487602,"about_ca_system_score_gemma":0.0008280286,"threshold_uncertainty_score":0.029486299},"labels":[],"label_agreement":null},{"id":"W2777700021","doi":"10.1007/978-3-319-72453-9_21","title":"Stirling Numbers, Lambert W and the Gamma Function","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Dynamics and Biomechanics","field":"Engineering","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":"Lambert W function; Computer science; Stirling engine; Algorithm; Mathematics; Physics; Mathematical analysis; Thermodynamics","score_opus":0.007154335267573778,"score_gpt":0.1944949390332956,"score_spread":0.1873406037657218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777700021","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038299866,0.15160649,0.2269029,0.005561706,0.007647237,0.000048299007,0.00034553627,0.0006351855,0.5689528],"genre_scores_gemma":[0.5100224,0.08769946,0.076812714,0.001810753,0.008720732,0.00015400372,0.000555838,0.0007198351,0.31350434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969125,0.00007985204,0.000023983204,0.0000682037,0.00010117249,0.00003557672],"domain_scores_gemma":[0.999126,0.0005240714,0.00007839731,0.00008266046,0.00012580378,0.0000630683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007787128,0.0012103342,0.0009823734,0.0038299847,0.0007878716,0.0034870198,0.0006997972,0.0016783185,0.009032547],"category_scores_gemma":[0.005461214,0.0004889756,0.0005918167,0.003078876,0.0024786864,0.0035394668,0.00094585645,0.0028668968,0.004221988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026762113,0.000007940585,0.000056157485,0.00009800272,0.0000051338047,0.000042040847,0.000101396006,0.002078734,0.00047882908,0.9507651,0.008030251,0.038309623],"study_design_scores_gemma":[0.0000045393176,0.000015258942,0.00012402954,0.000050134644,0.0000057105676,0.00013888159,0.00004049378,0.00267993,0.0003000538,0.9516935,0.044926256,0.000021360996],"about_ca_topic_score_codex":0.0009773057,"about_ca_topic_score_gemma":0.00056971563,"teacher_disagreement_score":0.009032547,"about_ca_system_score_codex":0.0012066362,"about_ca_system_score_gemma":0.00073207624,"threshold_uncertainty_score":0.030216873},"labels":[],"label_agreement":null},{"id":"W2778811706","doi":"10.1007/978-3-319-71607-7_49","title":"Multi-orientation Scene Text Detection Leveraging Background Suppression","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Text detection; Artificial intelligence; Pixel; Perspective (graphical); Character (mathematics); Orientation (vector space); Pattern recognition (psychology); Recall rate; Image (mathematics); Convolutional neural network; Computer vision; Natural language processing","score_opus":0.036088437366995636,"score_gpt":0.2907593037137656,"score_spread":0.25467086634677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778811706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065721855,0.0015334457,0.91487813,0.00019481337,0.0004642546,0.00013128838,0.00073969836,0.008030835,0.008305717],"genre_scores_gemma":[0.32756212,0.0018235836,0.6446905,0.00031507557,0.00036082498,0.0001163429,0.0035139923,0.0012522291,0.020365322],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964404,0.000023312108,0.000014166328,0.00009992054,0.00015735546,0.00006122682],"domain_scores_gemma":[0.99962556,0.00006261095,0.000033101274,0.000060176648,0.00016753653,0.000050958235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024927125,0.0014694296,0.0010446302,0.0017653175,0.00034565368,0.00096348947,0.0009414389,0.0007605546,0.00437027],"category_scores_gemma":[0.0005694906,0.0004314057,0.0007997737,0.0011977125,0.00019768672,0.00084621244,0.00092789804,0.00072230963,0.006143217],"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.0005348535,0.0001496374,0.0008655439,0.00016789547,0.000063384156,0.00025975978,0.000034736746,0.0031944981,0.5151494,0.0005407043,0.0044411295,0.47459847],"study_design_scores_gemma":[0.000058231915,0.00037619105,0.008073914,0.0000374973,0.0002407703,0.001333446,0.00007386456,0.4442608,0.5279231,0.0013698387,0.016195044,0.000057341418],"about_ca_topic_score_codex":0.0010798995,"about_ca_topic_score_gemma":0.0028940137,"teacher_disagreement_score":0.00437027,"about_ca_system_score_codex":0.000178098,"about_ca_system_score_gemma":0.0004588252,"threshold_uncertainty_score":0.014620006},"labels":[],"label_agreement":null},{"id":"W2778888168","doi":"10.1007/978-3-319-72453-9_20","title":"Rapidly Convergent Integrals and Function Evaluation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Dynamics and Biomechanics","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":"Western University","funders":"","keywords":"Function (biology); Variable (mathematics); Convergence (economics); Range (aeronautics); Rate of convergence; Computer science; Computation; Applied mathematics; Focus (optics); Domain (mathematical analysis); Mathematics; Algorithm; Mathematical analysis; Telecommunications; Physics","score_opus":0.016869772333881313,"score_gpt":0.23419382144236023,"score_spread":0.2173240491084789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778888168","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.015408669,0.027086966,0.7576501,0.0014548446,0.0018075003,0.000056696885,0.00017437278,0.00065858354,0.19570217],"genre_scores_gemma":[0.331969,0.039995268,0.27012256,0.0007203403,0.0037422956,0.00027936738,0.00066232384,0.0031161897,0.34939268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00023288971,0.000038987906,0.00007749923,0.00033857345,0.00005769435],"domain_scores_gemma":[0.9991424,0.00044929146,0.000040808445,0.0001129308,0.00019753887,0.00005695819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018359727,0.0020779942,0.0018841471,0.0025886195,0.00067815074,0.0029637855,0.001128932,0.0011938591,0.0076882513],"category_scores_gemma":[0.004405957,0.0006015357,0.00095473585,0.0021952717,0.0025740894,0.00411685,0.0022900398,0.0036059166,0.0042169713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003409257,0.000020938622,0.000055470427,0.00017161049,0.000018587036,0.000056101064,0.00013575895,0.0061671464,0.0016341928,0.9181849,0.008514031,0.06500713],"study_design_scores_gemma":[0.000015472684,0.000033622942,0.00015013474,0.00008342705,0.000017294886,0.00020859021,0.000042745003,0.03577659,0.0015865203,0.9256913,0.036369685,0.00002461071],"about_ca_topic_score_codex":0.0006962572,"about_ca_topic_score_gemma":0.0004219949,"teacher_disagreement_score":0.0076882513,"about_ca_system_score_codex":0.0016347031,"about_ca_system_score_gemma":0.0006876558,"threshold_uncertainty_score":0.025719762},"labels":[],"label_agreement":null},{"id":"W2779033804","doi":"10.1007/978-3-319-71649-7_9","title":"Exploring Positional Linear Go","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Set (abstract data type); Solver; Algorithm; Theoretical computer science; Programming language","score_opus":0.11204420023319324,"score_gpt":0.30427677475744375,"score_spread":0.19223257452425052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779033804","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.09040394,0.001302879,0.36653578,0.0025299783,0.00041343257,0.00009824419,0.0008894888,0.0020317414,0.53579444],"genre_scores_gemma":[0.7619387,0.0011572813,0.111043535,0.0007434643,0.00012257308,0.00015667532,0.0019196472,0.00105722,0.121860914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997484,0.000056596153,0.000008670499,0.000069174625,0.00005723823,0.000059868446],"domain_scores_gemma":[0.9996265,0.00019465407,0.000024390387,0.00007240899,0.000038724713,0.00004326725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023486874,0.0005738947,0.0006766449,0.00093500625,0.0016400495,0.0020853758,0.0011105187,0.001236538,0.05794675],"category_scores_gemma":[0.002431941,0.00035486234,0.00079265423,0.0012353332,0.0017719336,0.0035972735,0.002825555,0.0019544684,0.005394079],"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.000033283675,0.000016777776,0.0001229721,0.00006176877,0.0000070909714,0.0000490495,0.0001537018,0.0044845524,0.00035125864,0.97382826,0.0031506626,0.017740557],"study_design_scores_gemma":[0.000008725635,0.00001401247,0.000064539905,0.000038366772,0.0000068670834,0.000042491763,0.00017908016,0.02150312,0.0002258821,0.965881,0.012026992,0.000008781282],"about_ca_topic_score_codex":0.0027606268,"about_ca_topic_score_gemma":0.005024169,"teacher_disagreement_score":0.05794675,"about_ca_system_score_codex":0.0008312739,"about_ca_system_score_gemma":0.00060409756,"threshold_uncertainty_score":0.19385117},"labels":[],"label_agreement":null},{"id":"W2779741215","doi":"10.1007/978-3-319-71273-4_21","title":"SINAS: Suspect Investigation Using Offenders’ Activity Space","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Suspect; Commit; Space (punctuation); Computer science; Criminology; Baseline (sea); Crime analysis; Computer security; Psychology; Political science; Law","score_opus":0.05990080033714772,"score_gpt":0.31451713808812426,"score_spread":0.25461633775097653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779741215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15297933,0.0023604897,0.5437,0.0039380533,0.0015688676,0.0012830051,0.031640295,0.06359848,0.19893157],"genre_scores_gemma":[0.60359275,0.0014695431,0.30887568,0.00038890433,0.0002975365,0.0006190581,0.023022497,0.0024331755,0.059300847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999071,0.0002851954,0.000058545338,0.00014181038,0.00037313788,0.00007020986],"domain_scores_gemma":[0.9982408,0.000781726,0.0002235244,0.00033618824,0.0003100489,0.00010780593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923264,0.0009494536,0.0004587233,0.0034383964,0.0009018205,0.0026033921,0.0011646176,0.00072103826,0.011131761],"category_scores_gemma":[0.0056661754,0.000317477,0.00045022907,0.0015832908,0.0006632917,0.003088871,0.0031515304,0.0007488946,0.0062740627],"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.00047798222,0.00023547004,0.04948123,0.0006441484,0.00014959868,0.0007286197,0.0038908606,0.0061257672,0.0059374785,0.059081167,0.20262688,0.6706208],"study_design_scores_gemma":[0.000096027274,0.00035784746,0.036289655,0.001087112,0.00029536962,0.0034795664,0.01506939,0.25634483,0.026578369,0.1476335,0.5125301,0.00023819304],"about_ca_topic_score_codex":0.003406622,"about_ca_topic_score_gemma":0.006057361,"teacher_disagreement_score":0.011131761,"about_ca_system_score_codex":0.0004239484,"about_ca_system_score_gemma":0.0010933283,"threshold_uncertainty_score":0.037239432},"labels":[],"label_agreement":null},{"id":"W2779959840","doi":"10.1007/978-3-319-72751-6_8","title":"Energy-Optimal Broadcast in a Tree with Mobile Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Tree (set theory); Node (physics); Mobile agent; Broadcasting (networking); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Root (linguistics); Energy (signal processing); Algorithm; Theoretical computer science; Distributed computing; Combinatorics; Computer network; Mathematics; Artificial intelligence","score_opus":0.021197720684144168,"score_gpt":0.26003828623646036,"score_spread":0.2388405655523162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779959840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07798408,0.0013657574,0.89538854,0.0013247636,0.00020727434,0.000111414076,0.00029837,0.00042919352,0.022890655],"genre_scores_gemma":[0.72559434,0.001977696,0.24056749,0.00033431043,0.00024902643,0.00019714159,0.00040346806,0.00032595504,0.030350497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948967,0.00017829912,0.000023825236,0.000081468745,0.000110742236,0.00011600773],"domain_scores_gemma":[0.99806756,0.0014027428,0.000109623055,0.00009283034,0.00017811677,0.00014923557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089044514,0.0006070666,0.001539106,0.00073989615,0.00091237115,0.0015147337,0.0016312227,0.0018160337,0.003958371],"category_scores_gemma":[0.004465859,0.00063455896,0.0006533356,0.0014223218,0.0010570841,0.0018563954,0.0017166752,0.0015293085,0.00076956465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047188808,0.0001256999,0.000308776,0.0003491341,0.000060042603,0.00018331398,0.00027585178,0.7356224,0.00582077,0.20803322,0.008565451,0.040183425],"study_design_scores_gemma":[0.00004952926,0.000046998528,0.00007441727,0.000028352919,0.00001871074,0.000057545534,0.000056291086,0.9076622,0.00054537266,0.089993276,0.0014573148,0.000009967456],"about_ca_topic_score_codex":0.0026117158,"about_ca_topic_score_gemma":0.0026140222,"teacher_disagreement_score":0.003958371,"about_ca_system_score_codex":0.0012749921,"about_ca_system_score_gemma":0.00085948635,"threshold_uncertainty_score":0.013242066},"labels":[],"label_agreement":null},{"id":"W2781697036","doi":"10.1007/978-3-319-73706-5_13","title":"In-Memory Distributed Training of Linear-Chain Conditional Random Fields with an Application to Fine-Grained Named Entity Recognition","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto; Bundesministerium für Bildung und Forschung","keywords":"Computer science; Conditional random field; Scalability; Named-entity recognition; Task (project management); Sequence labeling; Feature (linguistics); Sequence (biology); Artificial intelligence; Pattern recognition (psychology); Database","score_opus":0.023987875617359336,"score_gpt":0.25610979584764443,"score_spread":0.2321219202302851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781697036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03974031,0.00022181594,0.94548565,0.00022062249,0.0000717799,0.00007345703,0.00017314282,0.0128257545,0.0011874493],"genre_scores_gemma":[0.4615588,0.00014623531,0.53249127,0.0001504751,0.00007333221,0.0001861958,0.00083968823,0.0007024497,0.0038514957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995474,0.00011595647,0.000026786578,0.0001775846,0.000079837664,0.000052335203],"domain_scores_gemma":[0.9981365,0.0010246485,0.000079709615,0.0004496105,0.00023586747,0.00007366388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014683456,0.0008268696,0.000888187,0.0004392603,0.0004925531,0.00074461836,0.0016763166,0.0010412025,0.004261066],"category_scores_gemma":[0.0046666926,0.00045994952,0.00044576923,0.00078309915,0.00051402504,0.0016957105,0.0010865736,0.0014089717,0.0015306212],"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.0008756706,0.00034543689,0.0027069522,0.000117111136,0.00010604344,0.00026501014,0.0002573039,0.4576385,0.014028324,0.004412583,0.010865615,0.50838155],"study_design_scores_gemma":[0.000027151134,0.000019747502,0.00016062056,0.0000023301586,0.0000046496207,0.000020189022,0.0000106373645,0.99310195,0.003374077,0.0026848393,0.0005895974,0.0000042162505],"about_ca_topic_score_codex":0.009224933,"about_ca_topic_score_gemma":0.012829793,"teacher_disagreement_score":0.009224933,"about_ca_system_score_codex":0.0008124715,"about_ca_system_score_gemma":0.0009819766,"threshold_uncertainty_score":0.018342435},"labels":[],"label_agreement":null},{"id":"W2781839508","doi":"10.1007/978-3-319-73706-5","title":"Language Technologies for the Challenges of the Digital Age","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bundesministerium für Bildung und Forschung; Horizon 2020 Framework Programme; Deutsche Forschungsgemeinschaft; Bộ Giáo dục và Ðào tạo; Banting and Best Diabetes Centre, University of Toronto; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; European Commission","keywords":"Computer science; Programming language","score_opus":0.0153390283246302,"score_gpt":0.2661524133120138,"score_spread":0.2508133849873836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781839508","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071817786,0.25023088,0.15329319,0.1502392,0.013005904,0.0001304652,0.0013443341,0.0019819806,0.42259222],"genre_scores_gemma":[0.1423594,0.2749858,0.13302414,0.036449756,0.02069059,0.00055344205,0.0031397818,0.0016066408,0.38719055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992637,0.0002587242,0.00006191192,0.0000828733,0.00025211603,0.000080710095],"domain_scores_gemma":[0.99775946,0.0014269784,0.00008661526,0.00021679903,0.00035614547,0.00015404745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015594527,0.0005986896,0.00049431523,0.0026937977,0.0013991499,0.008710639,0.0011460225,0.0019189479,0.018658986],"category_scores_gemma":[0.0038309218,0.00028232596,0.00062103046,0.002697514,0.004009556,0.019390142,0.003645618,0.0039667324,0.007921793],"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.000015301755,0.0000145411195,0.00008933428,0.00044889541,0.00000884816,0.00015167026,0.00087086775,0.00019811928,0.0014083424,0.76414734,0.1163507,0.11629589],"study_design_scores_gemma":[0.0000040992973,0.000007817981,0.00009703582,0.00030040264,0.0000056440967,0.0003268678,0.0007261776,0.00041737454,0.00045522713,0.3028063,0.69484234,0.000010812699],"about_ca_topic_score_codex":0.0012463869,"about_ca_topic_score_gemma":0.0017715135,"teacher_disagreement_score":0.018658986,"about_ca_system_score_codex":0.0016897097,"about_ca_system_score_gemma":0.0014162442,"threshold_uncertainty_score":0.062420547},"labels":[],"label_agreement":null},{"id":"W2782201748","doi":"10.1007/978-3-319-73706-5_21","title":"Twitter Geolocation Prediction Using Neural Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto; Bundesministerium für Bildung und Forschung","keywords":"Geolocation; Computer science; Metadata; Set (abstract data type); Geotagging; Information retrieval; Data mining; Artificial neural network; Code (set theory); Source code; Artificial intelligence; World Wide Web","score_opus":0.02940461580250424,"score_gpt":0.2874009509066642,"score_spread":0.2579963351041599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782201748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43058133,0.0124475695,0.48825884,0.004058282,0.001785742,0.00017125973,0.019857546,0.0127293775,0.03011004],"genre_scores_gemma":[0.90301377,0.0019119168,0.0627435,0.00034688125,0.0005290003,0.00012832857,0.015007723,0.00022093357,0.016097937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998272,0.000035427798,0.000010336009,0.00007115032,0.00002657593,0.000029325336],"domain_scores_gemma":[0.9995578,0.00022686442,0.00004466284,0.000046819554,0.00010481399,0.00001893468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003535141,0.0013156696,0.000565801,0.0011202643,0.00031853054,0.00066553673,0.0010473497,0.0007887501,0.00334005],"category_scores_gemma":[0.002022442,0.00035697946,0.00050585734,0.0014529217,0.00017753222,0.0011439524,0.0006602958,0.00086438906,0.0026052499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000443954,0.00019650867,0.011722293,0.0002148588,0.00014983826,0.0001474525,0.00007201355,0.533607,0.0027435909,0.002181439,0.035392493,0.4131286],"study_design_scores_gemma":[0.0000064324236,0.000014677097,0.0008681102,0.000019297779,0.000013465045,0.000014989389,0.000015033395,0.99555784,0.0006215892,0.0017018823,0.0011606428,0.00000614554],"about_ca_topic_score_codex":0.012254664,"about_ca_topic_score_gemma":0.018854557,"teacher_disagreement_score":0.012254664,"about_ca_system_score_codex":0.00062775676,"about_ca_system_score_gemma":0.00033129347,"threshold_uncertainty_score":0.024366677},"labels":[],"label_agreement":null},{"id":"W2783053205","doi":"10.1007/978-3-319-74180-2_11","title":"Consistent Subset Problem with Two Labels","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Simon Fraser University; University of Alberta","funders":"","keywords":"Computer science; NP-complete; Algorithm; Artificial intelligence; Theoretical computer science; Computational complexity theory","score_opus":0.018788604069248413,"score_gpt":0.25517506529034256,"score_spread":0.23638646122109414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783053205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026217414,0.0010519194,0.93923736,0.0061479574,0.00064588204,0.0003203938,0.0020598136,0.00079193595,0.023527231],"genre_scores_gemma":[0.24126534,0.00092416705,0.7160919,0.001877836,0.0013696991,0.0010416982,0.0063516735,0.0006037212,0.030474044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970198,0.0013207074,0.00016535983,0.00070144876,0.00062528334,0.00016734973],"domain_scores_gemma":[0.99393326,0.0043097166,0.0001985548,0.0009533303,0.0004023767,0.00020272152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038365414,0.0015108006,0.0026242253,0.0010649434,0.0013077946,0.0027771655,0.003303881,0.00419585,0.014621206],"category_scores_gemma":[0.010025575,0.00094171334,0.0016313128,0.0020060102,0.0019876617,0.0060553346,0.0036942358,0.004865812,0.0023048762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001038807,0.000613132,0.0011011781,0.0011823655,0.00026030664,0.00052620436,0.00048820535,0.051208723,0.0037610237,0.45377603,0.10411672,0.38192737],"study_design_scores_gemma":[0.00023132452,0.00014201115,0.00035872313,0.00013059135,0.000089605644,0.000313795,0.00015043748,0.21539058,0.0024882935,0.76642174,0.014247442,0.00003542206],"about_ca_topic_score_codex":0.0005382921,"about_ca_topic_score_gemma":0.00058398914,"teacher_disagreement_score":0.014621206,"about_ca_system_score_codex":0.0008205918,"about_ca_system_score_gemma":0.0015581627,"threshold_uncertainty_score":0.048912764},"labels":[],"label_agreement":null},{"id":"W2783585723","doi":"10.1007/978-3-319-60837-2","title":"Rough Sets","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Computer science; Rough set; Joint (building); Set (abstract data type); Artificial intelligence; Information retrieval; Programming language","score_opus":0.02309082688667286,"score_gpt":0.2670718017904029,"score_spread":0.24398097490373005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783585723","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049205665,0.026581224,0.6689336,0.0027206494,0.0022871653,0.00017976451,0.0012036021,0.0011600201,0.29201347],"genre_scores_gemma":[0.22558963,0.03770864,0.4894565,0.001125965,0.002433554,0.0004676603,0.003013398,0.0006468022,0.23955785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984322,0.00028993734,0.00011219016,0.00019210659,0.0009137202,0.000059693743],"domain_scores_gemma":[0.9990683,0.00034650552,0.000053590724,0.00028687142,0.0002134722,0.00003126525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011854633,0.001179429,0.0015483054,0.0025496995,0.0007214108,0.003762117,0.00086012663,0.0007815589,0.015744623],"category_scores_gemma":[0.0044261357,0.00054425554,0.00118983,0.0026015404,0.0012022508,0.002672954,0.0014084291,0.0019678222,0.007767259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023934983,0.000024370216,0.00011724072,0.0002799427,0.00005829387,0.000059971913,0.0001418694,0.00742651,0.0005899363,0.71327454,0.035816815,0.24218656],"study_design_scores_gemma":[0.000010961656,0.0000342243,0.00026263128,0.00015108292,0.00004756652,0.00019890445,0.00006913025,0.012271183,0.00088539807,0.7800296,0.20601532,0.00002398707],"about_ca_topic_score_codex":0.00058636285,"about_ca_topic_score_gemma":0.000521693,"teacher_disagreement_score":0.015744623,"about_ca_system_score_codex":0.0008775737,"about_ca_system_score_gemma":0.00078506867,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2784087652","doi":"10.1007/978-3-319-50137-6_12","title":"The Inductive Constraint Programming Loop","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 British Columbia","funders":"","keywords":"Constraint programming; Computer science; Concurrent constraint logic programming; Inductive programming; Constraint satisfaction; Exploit; Constraint (computer-aided design); Reactive programming; Scheduling (production processes); Constraint logic programming; Mathematical optimization; Programming language; Theoretical computer science; Programming paradigm; Artificial intelligence; Functional logic programming; Stochastic programming; Mathematics","score_opus":0.015462791322360728,"score_gpt":0.24157038091516056,"score_spread":0.22610758959279983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784087652","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.0019377867,0.00057469285,0.8203323,0.0012540583,0.0002706829,0.000096748576,0.00023105444,0.0012791734,0.17402346],"genre_scores_gemma":[0.12584405,0.001921215,0.76776606,0.00190519,0.00077968766,0.0005414224,0.0012151998,0.0019657703,0.09806143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.00045737703,0.000059399765,0.00034134515,0.0006649804,0.00011784147],"domain_scores_gemma":[0.99728835,0.0017250577,0.000071409995,0.0005010894,0.0003522524,0.00006184973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016889024,0.0008040595,0.00056786375,0.0010361879,0.0013798599,0.0027234217,0.0026381062,0.00068793964,0.032674685],"category_scores_gemma":[0.006977444,0.0007684749,0.00092388847,0.0014577438,0.0032038626,0.005030769,0.0031492542,0.0040546614,0.009449166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025373967,0.000030662417,0.000073331605,0.00011404775,0.000008582188,0.000035745375,0.00016931175,0.0016272794,0.00091191346,0.87526894,0.014599608,0.10713518],"study_design_scores_gemma":[0.0000130959415,0.0000084923395,0.000058638223,0.000063970314,0.000009864739,0.000053304175,0.00003403132,0.009132019,0.0030181569,0.8803264,0.10726804,0.00001399181],"about_ca_topic_score_codex":0.0015767727,"about_ca_topic_score_gemma":0.0017578839,"teacher_disagreement_score":0.032674685,"about_ca_system_score_codex":0.0016251536,"about_ca_system_score_gemma":0.0019361981,"threshold_uncertainty_score":0.109307766},"labels":[],"label_agreement":null},{"id":"W2785474956","doi":"10.1007/978-3-319-75238-9_34","title":"Brain Tumor Segmentation Using a 3D FCN with Multi-scale Loss","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":45,"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":"Computer science; Segmentation; Dice; Context (archaeology); Artificial intelligence; Pattern recognition (psychology); Image segmentation; Scale (ratio); Sample (material); Function (biology); High resolution; Mathematics; Statistics","score_opus":0.04181104077477439,"score_gpt":0.2826430277317923,"score_spread":0.2408319869570179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785474956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01774523,0.00044731703,0.9766168,0.00021329476,0.0001715165,0.000112415066,0.0003665595,0.002362252,0.0019645542],"genre_scores_gemma":[0.20726934,0.0006023361,0.78272426,0.00036657145,0.00016735276,0.00020818807,0.0013512728,0.0005803054,0.006730415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954706,0.000036005826,0.0000290031,0.00012625965,0.00018250686,0.00007911698],"domain_scores_gemma":[0.99946755,0.00009550463,0.000034819674,0.00010658682,0.00025587998,0.000039602884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111552,0.0014795526,0.0013932335,0.0018851471,0.00085891783,0.0015314856,0.0018434409,0.002641031,0.0028998759],"category_scores_gemma":[0.0013508808,0.0007414168,0.00171968,0.0017047119,0.0005296763,0.001211348,0.0016927118,0.0013307122,0.0016503809],"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.00029498956,0.00014123578,0.0015768656,0.00011049014,0.00013768356,0.00017944517,0.000085017135,0.15777005,0.025678009,0.002965012,0.008876998,0.8021843],"study_design_scores_gemma":[0.000004229215,0.000026043253,0.00047387325,0.000011778445,0.000025381582,0.000104233724,0.000011649162,0.99169767,0.0055041793,0.0010938727,0.0010344166,0.000012705087],"about_ca_topic_score_codex":0.018721255,"about_ca_topic_score_gemma":0.018308682,"teacher_disagreement_score":0.018721255,"about_ca_system_score_codex":0.0010891068,"about_ca_system_score_gemma":0.0017751718,"threshold_uncertainty_score":0.03722459},"labels":[],"label_agreement":null},{"id":"W2785885778","doi":"10.1007/978-3-319-75396-6_17","title":"Graph Operations and Free Graph Algebras","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McMaster University","funders":"","keywords":"Null graph; Graph algebra; Voltage graph; Graph; Line graph; Complement graph; Computer science; Discrete mathematics; Injective function; Mathematics; Combinatorics","score_opus":0.012540765446255967,"score_gpt":0.22850895955889172,"score_spread":0.21596819411263576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785885778","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048987564,0.021241155,0.50832033,0.004551433,0.0025036281,0.00010667939,0.0007051633,0.0010453287,0.41253874],"genre_scores_gemma":[0.6283893,0.019694028,0.13920094,0.0017031151,0.002949234,0.0003147251,0.0016624253,0.0009044348,0.20518176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994992,0.00012146832,0.000033068158,0.000102672624,0.00018581843,0.000057601814],"domain_scores_gemma":[0.9995505,0.00020007094,0.000035484496,0.00009229988,0.00007879106,0.00004282199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050756446,0.0009026118,0.0006154223,0.0020809835,0.0013845823,0.002959077,0.00097351545,0.00083381607,0.010249042],"category_scores_gemma":[0.0012135307,0.0005395413,0.0009828686,0.0027161737,0.0029923168,0.0074430266,0.0016202503,0.0029841154,0.0024865556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045592806,0.000005828812,0.000014106325,0.00002496066,0.000002803774,0.000010495124,0.00007425168,0.00029598823,0.00020384628,0.99050283,0.0018207337,0.007039629],"study_design_scores_gemma":[0.0000014541789,0.0000020134628,0.000014399791,0.0000067501983,0.0000026865391,0.00002045569,0.000015838592,0.00042316355,0.00011565565,0.98956585,0.009828593,0.0000032529517],"about_ca_topic_score_codex":0.0011095185,"about_ca_topic_score_gemma":0.0010839491,"teacher_disagreement_score":0.010249042,"about_ca_system_score_codex":0.0012582582,"about_ca_system_score_gemma":0.00067332626,"threshold_uncertainty_score":0.0342865},"labels":[],"label_agreement":null},{"id":"W2785934478","doi":"10.1007/978-3-319-91397-1_31","title":"Pedicle Screw Insertion Surgical Simulator","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spinal Fractures and Fixation Techniques","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; SickKids Foundation; Hospital for Sick Children; University of Toronto; University of Waterloo","funders":"","keywords":"Haptic technology; Process (computing); Computer science; Scoliosis; Simulation; Surgery; Orthodontics; Medicine","score_opus":0.021112421343317957,"score_gpt":0.30288147963193,"score_spread":0.28176905828861204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785934478","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.07397954,0.0030183052,0.57138306,0.0022404417,0.0023872477,0.0005815725,0.0032989748,0.014000821,0.3291101],"genre_scores_gemma":[0.26541004,0.00483739,0.24880232,0.0012278656,0.00053592917,0.00037671725,0.004086467,0.0017502307,0.47297308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998305,0.000014218728,0.000009743244,0.000029881588,0.00009767363,0.000018010996],"domain_scores_gemma":[0.9998022,0.000063276835,0.000010636966,0.000030078732,0.000041315998,0.000052484513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027388718,0.00094038324,0.00032905606,0.0005518616,0.0003280653,0.0004550148,0.0010530399,0.00067174726,0.064557485],"category_scores_gemma":[0.00047438106,0.0003159826,0.00050219335,0.00029076927,0.00021143611,0.00054701505,0.00086004834,0.0011178821,0.01333214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004331319,0.0006397219,0.0018487548,0.0003583226,0.000039773167,0.0027925535,0.0002131097,0.012159069,0.069628336,0.0051203873,0.055696152,0.8510707],"study_design_scores_gemma":[0.00025162759,0.0038325237,0.012978028,0.00042397153,0.00010087259,0.06661885,0.00026293076,0.062832765,0.06805625,0.011692412,0.77277344,0.0001762954],"about_ca_topic_score_codex":0.00089008,"about_ca_topic_score_gemma":0.0022995248,"teacher_disagreement_score":0.064557485,"about_ca_system_score_codex":0.00025763278,"about_ca_system_score_gemma":0.0008915671,"threshold_uncertainty_score":0.21596634},"labels":[],"label_agreement":null},{"id":"W2786142664","doi":"10.1007/978-3-319-91938-6_4","title":"Polynomial-Time Algorithms for Phylogenetic Inference Problems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Inference; Gene duplication; Phylogenetic tree; Phylogenetic network; Time complexity; Phylogenetics; Genetic algorithm; Tree (set theory); Algorithm; Polynomial; Mathematics; Computer science; Biology; Combinatorics; Evolutionary biology; Artificial intelligence; Gene; Genetics","score_opus":0.018318926321914192,"score_gpt":0.25186836664148626,"score_spread":0.23354944031957206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786142664","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.0044007343,0.003682213,0.972806,0.0019155792,0.0003507283,0.00016741577,0.00090927246,0.0035662202,0.012201875],"genre_scores_gemma":[0.07010501,0.0029135335,0.90880084,0.0009341668,0.0008062204,0.0005747567,0.003992091,0.0017001113,0.010173267],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512213,0.0012156502,0.00036537007,0.001518824,0.0011846314,0.0005934315],"domain_scores_gemma":[0.9797252,0.015816713,0.0004940418,0.002552645,0.001032093,0.00037937556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038633582,0.0036416869,0.00325178,0.002305236,0.0021338034,0.0059741056,0.007940161,0.004020402,0.02229152],"category_scores_gemma":[0.022883559,0.0022537755,0.0041692285,0.006606756,0.0031369615,0.0138797145,0.0042928667,0.0114372205,0.008203069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072705775,0.0005169032,0.0008023154,0.0017187379,0.00024210713,0.00011707793,0.0003951751,0.1299351,0.0025595191,0.29610655,0.077679224,0.4892003],"study_design_scores_gemma":[0.00028505278,0.000042608546,0.00017526692,0.00008766442,0.00008122501,0.000112794274,0.0000721251,0.2693452,0.0011777484,0.71572566,0.012866331,0.000028370692],"about_ca_topic_score_codex":0.005330511,"about_ca_topic_score_gemma":0.0068367287,"teacher_disagreement_score":0.02229152,"about_ca_system_score_codex":0.0048207273,"about_ca_system_score_gemma":0.0038393126,"threshold_uncertainty_score":0.07457256},"labels":[],"label_agreement":null},{"id":"W2786598203","doi":"10.1007/978-3-030-26831-2_16","title":"Root-Finding with Implicit Deflation","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Numerical Methods 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":"Wilfrid Laurier University","funders":"","keywords":"Deflation; Root (linguistics); Computation; Polynomial; Subdivision; Mathematics; Applied mathematics; Computer science; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.022283940828799538,"score_gpt":0.3024834169206719,"score_spread":0.28019947609187235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786598203","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.01066466,0.00017854435,0.9784759,0.00032002555,0.00018864716,0.0000429919,0.000081858314,0.001680496,0.008366833],"genre_scores_gemma":[0.250165,0.00016586413,0.73386884,0.00025459242,0.0002142625,0.00010395551,0.00027891554,0.0015826339,0.013365986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972451,0.00074986485,0.00016669663,0.00051088864,0.0009789418,0.0003485048],"domain_scores_gemma":[0.9926347,0.0035960374,0.0003061451,0.0023841287,0.00092037,0.00015859501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023971128,0.001015928,0.0016428182,0.0015952293,0.0010711683,0.0017951329,0.0023054378,0.0022082627,0.017678497],"category_scores_gemma":[0.020360867,0.00074985827,0.00088027073,0.0014080926,0.0024769444,0.004324988,0.0066265515,0.0039042393,0.005331254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073013274,0.00019439045,0.0013518689,0.000579244,0.00007061955,0.00042214265,0.00072706846,0.034569114,0.013515998,0.40092567,0.01557501,0.53133875],"study_design_scores_gemma":[0.00016385682,0.00013014102,0.00024912017,0.00010049089,0.00005552768,0.00036043706,0.00014445097,0.38845176,0.015933841,0.5775872,0.01677391,0.000049260805],"about_ca_topic_score_codex":0.00070703565,"about_ca_topic_score_gemma":0.0013726347,"teacher_disagreement_score":0.017678497,"about_ca_system_score_codex":0.00054618844,"about_ca_system_score_gemma":0.001230322,"threshold_uncertainty_score":0.059140444},"labels":[],"label_agreement":null},{"id":"W2786967389","doi":"10.1007/978-3-319-75650-9_20","title":"Weighted Factors for Evaluating Anonymity","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Anonymity; Computer science; Service (business); Measure (data warehouse); Computer security; Data mining; Business","score_opus":0.03342126928518324,"score_gpt":0.28732391965569304,"score_spread":0.2539026503705098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786967389","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.059942283,0.0016706239,0.929959,0.00020920501,0.00021824219,0.00019068382,0.0006390298,0.00045354894,0.0067173885],"genre_scores_gemma":[0.62760514,0.00072644046,0.3660438,0.000070097376,0.00031683277,0.00044616326,0.0012410596,0.00018042518,0.0033700452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9821102,0.007869388,0.0010218121,0.0018386907,0.006374475,0.0007854134],"domain_scores_gemma":[0.9626525,0.023461277,0.0025757244,0.0048402245,0.0055881795,0.0008820523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013196586,0.0016309934,0.0014451458,0.0072153467,0.0010661752,0.0024532522,0.0013848335,0.001362801,0.0035015463],"category_scores_gemma":[0.04914803,0.00039038778,0.0015094711,0.005139808,0.0017009451,0.006150511,0.0020274625,0.001540691,0.00074744824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019465679,0.0002813905,0.022890162,0.00053471053,0.00084311876,0.00009593672,0.00042858056,0.09732894,0.0064205695,0.17933767,0.009705436,0.680187],"study_design_scores_gemma":[0.00009115298,0.00096914946,0.009070764,0.00019045113,0.00034571614,0.00030280362,0.00042881307,0.58508855,0.0063099223,0.3862948,0.010717197,0.00019055197],"about_ca_topic_score_codex":0.0017545543,"about_ca_topic_score_gemma":0.0017449106,"teacher_disagreement_score":0.013196586,"about_ca_system_score_codex":0.0016020758,"about_ca_system_score_gemma":0.0010680296,"threshold_uncertainty_score":0.06979108},"labels":[],"label_agreement":null},{"id":"W2787191314","doi":"10.1007/978-3-642-39479-9_46","title":"Illumination Invariant Face Recognition","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Fast Fourier transform; Facial recognition system; Complex wavelet transform; Face (sociological concept); Pattern recognition (psychology); Computer vision; Invariant (physics); Classifier (UML); Face detection; Three-dimensional face recognition; Wavelet; Wavelet transform; Discrete wavelet transform; Algorithm; Mathematics","score_opus":0.023696995919841552,"score_gpt":0.23375939710388333,"score_spread":0.21006240118404176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787191314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008779741,0.0075984057,0.878019,0.00025539196,0.00084458943,0.00012774147,0.00070608006,0.009187659,0.094481386],"genre_scores_gemma":[0.13637392,0.009656125,0.49493665,0.0008904878,0.0005155894,0.00016541808,0.006199175,0.0014292055,0.3498335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971217,0.00001603105,0.000010622323,0.00008354077,0.00013798405,0.000039633433],"domain_scores_gemma":[0.99985945,0.0000150716805,0.000008138195,0.00005925518,0.000049527313,0.000008476988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020833849,0.00069650507,0.000601655,0.0008699715,0.0002962188,0.00078654767,0.0012035083,0.0006824684,0.022486068],"category_scores_gemma":[0.0002995986,0.000329641,0.00054911297,0.0007935839,0.0002930265,0.00080635014,0.00081446016,0.000747042,0.025157044],"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.00004262853,0.000052952033,0.0001341697,0.00009828036,0.000017465523,0.00004997673,0.000016024193,0.0014562693,0.07440038,0.004124375,0.022689376,0.8969181],"study_design_scores_gemma":[0.000017601316,0.000217661,0.0053655524,0.00013309892,0.00009772473,0.0026549597,0.0000759706,0.12068332,0.49051723,0.014680476,0.36545646,0.00009998116],"about_ca_topic_score_codex":0.0007657486,"about_ca_topic_score_gemma":0.0013709376,"teacher_disagreement_score":0.022486068,"about_ca_system_score_codex":0.00028652718,"about_ca_system_score_gemma":0.00029918674,"threshold_uncertainty_score":0.07522339},"labels":[],"label_agreement":null},{"id":"W2787691610","doi":"10.1007/978-3-319-75396-6_16","title":"Towards the Automated Generation of Consistent, Diverse, Scalable and Realistic Graph Models","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Soundness; Scalability; Theoretical computer science; Graph; Programming language; Benchmarking; Generator (circuit theory); Database","score_opus":0.04453891864872326,"score_gpt":0.25055679561500255,"score_spread":0.2060178769662793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787691610","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.006720925,0.00017258475,0.98619753,0.00025537697,0.00003871947,0.00013775581,0.0007674534,0.004003112,0.001706508],"genre_scores_gemma":[0.08545852,0.00032404336,0.90586156,0.00018377182,0.00003226466,0.0002894999,0.004240014,0.001979125,0.0016311648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.0007184105,0.00012447807,0.000396341,0.0008147112,0.00010499873],"domain_scores_gemma":[0.99140817,0.0049672406,0.00034498377,0.002139549,0.0009668248,0.00017314222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019295361,0.0015482383,0.0014433421,0.002126088,0.0008358303,0.0029385611,0.0037353688,0.0021866374,0.004952183],"category_scores_gemma":[0.014749102,0.0017930082,0.0031410856,0.0019252377,0.0013475745,0.003983649,0.00414124,0.0035071913,0.0022419475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001526651,0.00022288649,0.0013664025,0.0008709316,0.00019453712,0.0005094775,0.0005503116,0.65424556,0.011713961,0.08813594,0.022566319,0.21947105],"study_design_scores_gemma":[0.00002714914,0.000016501464,0.00006619503,0.000034766097,0.000023816265,0.00008693576,0.0000614973,0.92901665,0.0025099777,0.06337695,0.0047687865,0.000010741958],"about_ca_topic_score_codex":0.003439972,"about_ca_topic_score_gemma":0.010707705,"teacher_disagreement_score":0.004952183,"about_ca_system_score_codex":0.0013971706,"about_ca_system_score_gemma":0.0020670227,"threshold_uncertainty_score":0.016566753},"labels":[],"label_agreement":null},{"id":"W2787885137","doi":"10.1007/978-3-319-76941-7_57","title":"Towards an Understanding of Entity-Oriented Search Intents","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Variety (cybernetics); Sample (material); Scheme (mathematics); Search engine; Quarter (Canadian coin); Information system","score_opus":0.06652118866270662,"score_gpt":0.3065662904636232,"score_spread":0.2400451018009166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787885137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020444082,0.0020842012,0.9511783,0.0034651917,0.00011895013,0.00013863918,0.00073596917,0.00053077505,0.021303795],"genre_scores_gemma":[0.44039264,0.0037372585,0.5401928,0.0009114522,0.0003878686,0.00034252697,0.0025764627,0.00033758278,0.011121353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789953,0.0007010718,0.00027376245,0.00041396997,0.000548288,0.00016344967],"domain_scores_gemma":[0.99506617,0.002442409,0.00044714898,0.00074476976,0.0010966096,0.0002027338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035235493,0.0009779703,0.0007912431,0.0039039874,0.0010909333,0.0079326825,0.0025210201,0.0026929074,0.0051763626],"category_scores_gemma":[0.011533747,0.0011640447,0.0014903395,0.0036361006,0.0029076335,0.019547781,0.0024716954,0.0034103212,0.0017750433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025936379,0.000041320003,0.0013207763,0.0001456149,0.000028533963,0.00014638375,0.0016274785,0.0042404295,0.0016473075,0.9611168,0.0023273923,0.02733195],"study_design_scores_gemma":[0.000010135121,0.000021522284,0.00085254107,0.000093915514,0.000047972062,0.0002760262,0.0006106833,0.071675904,0.0008590023,0.91165054,0.01387501,0.000026738595],"about_ca_topic_score_codex":0.004890485,"about_ca_topic_score_gemma":0.003085481,"teacher_disagreement_score":0.0079326825,"about_ca_system_score_codex":0.001406775,"about_ca_system_score_gemma":0.0012357874,"threshold_uncertainty_score":0.018634498},"labels":[],"label_agreement":null},{"id":"W2788164126","doi":"10.1007/978-3-319-75650-9_11","title":"Monitoring of Security Properties Using BeepBeep","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université du Québec à Chicoutimi","funders":"","keywords":"AspectJ; Computer science; TRACE (psycholinguistics); Java; Flexibility (engineering); Programming language; Security policy; Enforcement; Event (particle physics); Aspect-oriented programming; Runtime verification; Distributed computing; Software engineering; Computer security; Software; Formal verification","score_opus":0.031775988670127556,"score_gpt":0.2708946730393721,"score_spread":0.23911868436924455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788164126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44565567,0.0034623914,0.49685213,0.0003902286,0.00045525903,0.00056925946,0.0014518081,0.020129995,0.031033205],"genre_scores_gemma":[0.9027881,0.0005248175,0.08347376,0.00026614039,0.000038423008,0.00015435435,0.00034096572,0.00032868687,0.012084689],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.000029794935,0.000014018579,0.00010975908,0.00022257256,0.000046095178],"domain_scores_gemma":[0.9993839,0.0002340785,0.00011160803,0.00011896962,0.00012173703,0.00002960702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018194802,0.0007589947,0.000479278,0.0010978993,0.00033092446,0.0004908375,0.0010335654,0.00062271435,0.004603308],"category_scores_gemma":[0.0009324441,0.0003055251,0.00023187668,0.0004930565,0.00021842484,0.00072464894,0.00045134375,0.00043598266,0.0013502956],"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.0007320603,0.00022779893,0.0054840753,0.00038980597,0.00007970319,0.00066857546,0.00012710203,0.0051962016,0.5336873,0.0016679092,0.006601263,0.44513816],"study_design_scores_gemma":[0.000075392156,0.0012666889,0.022374654,0.000143736,0.00016485059,0.002609788,0.00010841096,0.3165326,0.626248,0.00442054,0.02594814,0.0001071927],"about_ca_topic_score_codex":0.0007420152,"about_ca_topic_score_gemma":0.0015890389,"teacher_disagreement_score":0.004603308,"about_ca_system_score_codex":0.00029980493,"about_ca_system_score_gemma":0.00019656948,"threshold_uncertainty_score":0.015399575},"labels":[],"label_agreement":null},{"id":"W2788234033","doi":"10.1007/978-3-319-92402-1_7","title":"A Framework for (De)composing with Boolean Automata Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Compute Canada","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Formalism (music); Automaton; Theoretical computer science; Computation; Boolean function; Cellular automaton; Boolean algebra; Algorithm","score_opus":0.009889591011710297,"score_gpt":0.24872030806224427,"score_spread":0.23883071705053396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788234033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010544605,0.000117353215,0.99573416,0.00006627112,0.000033889195,0.000028959883,0.000046269513,0.00043662137,0.002482093],"genre_scores_gemma":[0.05159526,0.00036691272,0.9427082,0.00010876091,0.00008279241,0.00025481192,0.00027823442,0.00032576977,0.0042791907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982431,0.00044338667,0.00020528257,0.0004342476,0.0005316749,0.00014226045],"domain_scores_gemma":[0.9977367,0.0013416763,0.00011817764,0.00050651166,0.00021591263,0.00008095327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020255202,0.0011975083,0.0010518729,0.0010088903,0.0010904049,0.0029414573,0.0026938168,0.0012124047,0.0062663467],"category_scores_gemma":[0.006118619,0.00093810755,0.003445398,0.001270985,0.0024483406,0.003989242,0.0032367753,0.003856226,0.0016495279],"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.000032220265,0.00003417468,0.00017704861,0.00018635651,0.00005102395,0.00017023548,0.00021734321,0.072640836,0.0035739522,0.846432,0.0014506201,0.075034164],"study_design_scores_gemma":[0.000011269347,0.000018098479,0.000037746413,0.00003849141,0.00004241892,0.00007238887,0.000025946987,0.26232046,0.0024055033,0.72289824,0.0121133905,0.000016071015],"about_ca_topic_score_codex":0.0027303305,"about_ca_topic_score_gemma":0.0040199896,"teacher_disagreement_score":0.0062663467,"about_ca_system_score_codex":0.0014276142,"about_ca_system_score_gemma":0.0011666401,"threshold_uncertainty_score":0.020963073},"labels":[],"label_agreement":null},{"id":"W2788389566","doi":"10.1007/978-3-030-00256-5_26","title":"Convexity-Increasing Morphs of Planar Graphs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Convexity; Regular polygon; Combinatorics; Planar graph; Planarity testing; Planar; Mathematics; Computer science; Line segment; Graph; Geometry; Computer graphics (images)","score_opus":0.02012392145713439,"score_gpt":0.26810497635087815,"score_spread":0.24798105489374378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788389566","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.67216414,0.0008380543,0.24611162,0.0017227504,0.00021388991,0.000099890785,0.0009485493,0.0006456742,0.07725546],"genre_scores_gemma":[0.9221982,0.00082191394,0.046681102,0.0003066129,0.0001773905,0.00009492909,0.0011317161,0.0007976009,0.027790485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996625,0.00006596139,0.000015606509,0.00008056494,0.00010989775,0.00006548222],"domain_scores_gemma":[0.99815506,0.00083236035,0.00025795086,0.00023309006,0.00022900937,0.00029248898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035357778,0.00067536574,0.0005593051,0.0018519873,0.0009367642,0.0020761853,0.0011924516,0.0007701144,0.008515368],"category_scores_gemma":[0.0040128976,0.0007310675,0.00072588515,0.000886488,0.002052621,0.0021378838,0.0021752673,0.0021996275,0.0006935202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010891228,0.0000401166,0.0014995298,0.00012057583,0.000016637632,0.00022743603,0.00044028595,0.01689933,0.005453587,0.9423975,0.005321276,0.027474942],"study_design_scores_gemma":[0.000024237732,0.00003955903,0.001986499,0.000031490938,0.000025692745,0.0003697553,0.00029758253,0.05926586,0.0025385222,0.9272632,0.008137076,0.000020498563],"about_ca_topic_score_codex":0.0015844784,"about_ca_topic_score_gemma":0.0020521288,"teacher_disagreement_score":0.008515368,"about_ca_system_score_codex":0.0009846836,"about_ca_system_score_gemma":0.0004029413,"threshold_uncertainty_score":0.028486729},"labels":[],"label_agreement":null},{"id":"W278851003","doi":"10.1007/978-3-642-30347-0_1","title":"Distributed Algorithms by Forgetful Mobile Robots","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Snapshot (computer storage); Robot; Computer science; Mobile robot; Scratch; Distributed computing; Distributed algorithm; Algorithm; Artificial intelligence; Real-time computing; Operating system","score_opus":0.01648801243812546,"score_gpt":0.2559231648571692,"score_spread":0.23943515241904376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W278851003","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.017604591,0.0012935501,0.96830946,0.00034421537,0.00031334528,0.000037883387,0.000036383943,0.00068285177,0.011377809],"genre_scores_gemma":[0.61560696,0.002222458,0.33869976,0.0003330887,0.00043769242,0.00031008935,0.00018887037,0.00051200984,0.041688975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993623,0.00014325074,0.000032860466,0.00015383607,0.00021685779,0.00009088039],"domain_scores_gemma":[0.99847394,0.0006900167,0.0000778963,0.0005258504,0.00014715575,0.000085210195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006790448,0.00097154564,0.001083434,0.0006402334,0.000771032,0.0014611398,0.0022251871,0.0011489891,0.0054363147],"category_scores_gemma":[0.004384334,0.0007026306,0.00076648814,0.00083667325,0.001741399,0.00289433,0.002763431,0.002132073,0.0012378838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003700678,0.00006022246,0.0003555208,0.00035472965,0.000078373996,0.00018093627,0.00029443763,0.22638293,0.0077347415,0.570928,0.0070359604,0.18622413],"study_design_scores_gemma":[0.00008770766,0.000090053,0.00015219454,0.00004603279,0.00003492418,0.00017850878,0.00004095858,0.5843449,0.0038356693,0.4002213,0.010942103,0.000025557682],"about_ca_topic_score_codex":0.0006486254,"about_ca_topic_score_gemma":0.00069200137,"teacher_disagreement_score":0.0054363147,"about_ca_system_score_codex":0.00073815166,"about_ca_system_score_gemma":0.000510088,"threshold_uncertainty_score":0.018186212},"labels":[],"label_agreement":null},{"id":"W2788592841","doi":"10.1007/978-3-319-93040-4_21","title":"MIDA: Multiple Imputation Using Denoising Autoencoders","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":281,"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":"Imputation (statistics); Missing data; Computer science; Artificial intelligence; Noise reduction; Data mining; Pattern recognition (psychology); Machine learning","score_opus":0.024484699020664805,"score_gpt":0.2509454465976662,"score_spread":0.2264607475770014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788592841","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.0008245299,0.0001996295,0.9943052,0.0001400336,0.00013391019,0.00003293034,0.00040107575,0.0033254442,0.0006372169],"genre_scores_gemma":[0.0331469,0.00025100942,0.9512537,0.00036253151,0.00022604327,0.0002813001,0.0036510304,0.0020861104,0.008741319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982823,0.0006685077,0.00008637994,0.0004886974,0.00035738846,0.00011677469],"domain_scores_gemma":[0.99633586,0.0018355467,0.00016893761,0.0010173718,0.0005236589,0.000118680655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038075296,0.0014597567,0.0020695422,0.0010756612,0.0009470405,0.002419293,0.0042473148,0.0031232876,0.018013325],"category_scores_gemma":[0.013473967,0.0018768625,0.0023476165,0.0013508062,0.00072157866,0.00236079,0.0035551786,0.0051794304,0.013065313],"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.00061010977,0.00031353958,0.0022001867,0.00032715662,0.0007113789,0.00033743304,0.00012220036,0.21452498,0.004797149,0.043804143,0.08474768,0.64750403],"study_design_scores_gemma":[0.000046016055,0.000030954645,0.00025565512,0.000037467773,0.000041706735,0.0001098799,0.000013925819,0.94640964,0.0025278954,0.04079289,0.009701136,0.00003280675],"about_ca_topic_score_codex":0.0025407968,"about_ca_topic_score_gemma":0.0050932444,"teacher_disagreement_score":0.018013325,"about_ca_system_score_codex":0.00058522413,"about_ca_system_score_gemma":0.001633163,"threshold_uncertainty_score":0.060260594},"labels":[],"label_agreement":null},{"id":"W2788857645","doi":"10.1007/978-3-319-89656-4_24","title":"Predicting Transportation Modes of GPS Trajectories Using Feature Engineering and Noise Removal","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Global Positioning System; Normalization (sociology); Trajectory; Mode (computer interface); Noise (video); Feature extraction; Artificial intelligence; Data mining; Real-time computing","score_opus":0.01624040241177798,"score_gpt":0.2564046980621106,"score_spread":0.2401642956503326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788857645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33786047,0.000441617,0.6584655,0.00009403896,0.00006951823,0.000040742354,0.0011694569,0.00083083374,0.0010278523],"genre_scores_gemma":[0.91281885,0.0003094175,0.08265336,0.00001495785,0.000042568267,0.00004273275,0.0020477546,0.000080067926,0.0019903188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998204,0.000024065077,0.00000921992,0.00007017635,0.000039740567,0.00003656205],"domain_scores_gemma":[0.9996172,0.00019338592,0.000040548417,0.000039136197,0.00008908041,0.000020544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002697658,0.00092693046,0.0006035106,0.0011630511,0.00027907096,0.00056743686,0.00056598196,0.00048386425,0.0005834239],"category_scores_gemma":[0.0015731631,0.00039519128,0.0011058646,0.001322011,0.00017199856,0.00068591547,0.00042514125,0.0005979033,0.00061785127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035310973,0.00017019094,0.048284296,0.0001000645,0.00014696809,0.00025567846,0.00013803596,0.5587688,0.010725518,0.0015359063,0.002828969,0.37669256],"study_design_scores_gemma":[0.0000031187444,0.000027270733,0.008172386,0.0000058180526,0.00001664407,0.000043725086,0.000028575587,0.9893338,0.0010454628,0.0010239516,0.00029031638,0.000008930449],"about_ca_topic_score_codex":0.016634295,"about_ca_topic_score_gemma":0.0148051055,"teacher_disagreement_score":0.016634295,"about_ca_system_score_codex":0.0003231184,"about_ca_system_score_gemma":0.00046878099,"threshold_uncertainty_score":0.033074915},"labels":[],"label_agreement":null},{"id":"W2789057179","doi":"10.1007/978-3-319-75238-9_2","title":"Lesion Detection, Segmentation and Prediction in Multiple Sclerosis Clinical Trials","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multiple Sclerosis Research Studies","field":"Medicine","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":"NeuroRx Research (Canada); McGill University","funders":"","keywords":"Computer science; Voxel; Segmentation; Multiple sclerosis; Context (archaeology); Artificial intelligence; Clinical trial; Medicine; Lesion; Machine learning; Pattern recognition (psychology); Radiology; Pathology","score_opus":0.26126458931098245,"score_gpt":0.40740084897524015,"score_spread":0.1461362596642577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789057179","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037968047,0.65507305,0.24670757,0.015501769,0.003856203,0.0006384855,0.0037438245,0.0020646409,0.03444641],"genre_scores_gemma":[0.35589495,0.25207892,0.33025375,0.0045946985,0.007781704,0.0012149801,0.0044338703,0.0007589499,0.042988155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741155,0.0017415853,0.00018295861,0.00021062767,0.00040722973,0.000046066885],"domain_scores_gemma":[0.9832545,0.015156822,0.0007122657,0.0003069397,0.0004308437,0.00013857144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007235665,0.0006361678,0.001329422,0.0012745715,0.00015542249,0.0017874084,0.00088032143,0.001324873,0.0065251603],"category_scores_gemma":[0.021921389,0.0005300779,0.0010143443,0.0012747827,0.00046063442,0.00097329565,0.0005138749,0.0013203508,0.0021873969],"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.0014912161,0.000099832534,0.0028916623,0.0022231783,0.00039190752,0.00015820835,0.00006779926,0.005517837,0.0019094885,0.0058904183,0.046742227,0.93261623],"study_design_scores_gemma":[0.0022144748,0.0066021215,0.05469636,0.010507861,0.0033051765,0.0075948224,0.00032290598,0.23708129,0.03250125,0.2800052,0.36477947,0.00038915922],"about_ca_topic_score_codex":0.00062842574,"about_ca_topic_score_gemma":0.001760991,"teacher_disagreement_score":0.007235665,"about_ca_system_score_codex":0.00057761866,"about_ca_system_score_gemma":0.00084181054,"threshold_uncertainty_score":0.0382663},"labels":[],"label_agreement":null},{"id":"W2789873537","doi":"10.1007/978-3-319-77243-1_20","title":"State of Requirements Engineering Research in the Context of Big Data Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Big data; Computer science; Context (archaeology); Data science; Variety (cybernetics); State (computer science); Principal (computer security); Requirements engineering; Software; Software engineering; Data mining; Computer security; Artificial intelligence","score_opus":0.11160616601284284,"score_gpt":0.33846776240965704,"score_spread":0.2268615963968142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789873537","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018432159,0.3917895,0.3909803,0.03568115,0.001642932,0.00018060207,0.00062102336,0.00083567237,0.15983666],"genre_scores_gemma":[0.25746733,0.37246525,0.34052697,0.005364885,0.0033879788,0.0003231742,0.0017371085,0.0007710099,0.017956268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"systematic_review","domain_scores_codex":[0.9933396,0.0028951885,0.0003765681,0.00065395207,0.0024074973,0.0003271588],"domain_scores_gemma":[0.9524602,0.04145771,0.00084172736,0.0026320985,0.0020880064,0.0005202073],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011601785,0.00084820925,0.0011975738,0.003357379,0.0009354116,0.0076612397,0.0026047074,0.00245358,0.005839003],"category_scores_gemma":[0.016391797,0.00097430183,0.0010738616,0.007007086,0.003706068,0.009074346,0.0025935066,0.004207996,0.0019979207],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000651031,0.00016703038,0.00073635223,0.00478483,0.000055906887,0.00019076132,0.0012295428,0.008258261,0.0017919838,0.48722374,0.017428769,0.4780676],"study_design_scores_gemma":[0.000015162922,0.0000836272,0.0009611,0.0037217003,0.000035747285,0.00064562866,0.0013603402,0.027356789,0.0020744717,0.52777696,0.43590894,0.000059534425],"about_ca_topic_score_codex":0.0014311853,"about_ca_topic_score_gemma":0.0014277692,"teacher_disagreement_score":0.9883982,"about_ca_system_score_codex":0.0024884392,"about_ca_system_score_gemma":0.0033678608,"threshold_uncertainty_score":0.061356843},"labels":[],"label_agreement":null},{"id":"W2789896172","doi":"10.1007/978-3-319-77538-8_3","title":"Feature Selection for Detecting Gene-Gene Interactions in Genome-Wide Association Studies","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","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":"Memorial University of Newfoundland","funders":"","keywords":"Genome-wide association study; Feature selection; Computer science; Multifactor dimensionality reduction; Single-nucleotide polymorphism; Selection (genetic algorithm); Genetic association; Machine learning; Feature (linguistics); Artificial intelligence; Logistic regression; Data mining; Computational biology; Gene; Biology; Genetics; Genotype","score_opus":0.024030378301575308,"score_gpt":0.2978725454416254,"score_spread":0.2738421671400501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789896172","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.06874407,0.0048258,0.9185264,0.0004065599,0.00024386209,0.00012219243,0.0020359445,0.004366404,0.00072869],"genre_scores_gemma":[0.53740853,0.0018332452,0.44858578,0.00027403008,0.0006095117,0.0004771846,0.007805389,0.0005354208,0.0024708803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980445,0.00084539544,0.0002070654,0.00038204697,0.00038157415,0.00013945413],"domain_scores_gemma":[0.9941234,0.0048829275,0.00018569904,0.0003423018,0.0003461515,0.00011948036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040190164,0.0012912528,0.0020980001,0.0026513732,0.00055806304,0.0011881153,0.0019171614,0.0010476864,0.0022790637],"category_scores_gemma":[0.008809759,0.0004257545,0.0018641,0.0029300135,0.00040673808,0.00080592424,0.001196032,0.0012642677,0.0009057218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010536312,0.00029156473,0.019606473,0.0005589654,0.0011513707,0.0005799074,0.000102192695,0.0494717,0.015811274,0.002802705,0.01620365,0.89236647],"study_design_scores_gemma":[0.00015915236,0.00031956742,0.018088019,0.00006517276,0.00045194273,0.0007070325,0.00006980231,0.9532824,0.006866356,0.016870031,0.0030411833,0.000079420795],"about_ca_topic_score_codex":0.0022727868,"about_ca_topic_score_gemma":0.0028513072,"teacher_disagreement_score":0.0040190164,"about_ca_system_score_codex":0.00031089282,"about_ca_system_score_gemma":0.00054806535,"threshold_uncertainty_score":0.021254897},"labels":[],"label_agreement":null},{"id":"W2790020036","doi":"10.1007/978-3-319-94776-1_36","title":"Reconfiguring Spanning and Induced Subgraphs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Waterloo","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Reachability; Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Matching (statistics); Graph factorization; Independent set; Graph; Mathematics; Induced subgraph; Clique; Computer science; Split graph; Distance-hereditary graph; Theoretical computer science; Discrete mathematics; Line graph; Graph power; Vertex (graph theory); Pathwidth; Voltage graph","score_opus":0.036604699689667876,"score_gpt":0.3142294430628079,"score_spread":0.27762474337314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790020036","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.62447894,0.00028989316,0.34456113,0.0004923276,0.00021275727,0.00012490762,0.0003879306,0.0035311533,0.025921032],"genre_scores_gemma":[0.8897058,0.0001584649,0.10395391,0.00015267044,0.000045723926,0.000053398093,0.00045461592,0.0005219111,0.004953436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999653,0.000076741344,0.000020308364,0.00010992783,0.00005836531,0.00008164019],"domain_scores_gemma":[0.99764156,0.00069399324,0.00016467976,0.0010489293,0.0001833689,0.00026741027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027388902,0.000452018,0.00042813865,0.000619665,0.00047308343,0.0006945606,0.0011152023,0.0005790143,0.005481208],"category_scores_gemma":[0.0028525002,0.00036037818,0.0004636103,0.00061437325,0.0004873551,0.0017063569,0.0012883431,0.00065072475,0.0009223023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013437395,0.0004664043,0.0056402725,0.000517873,0.00016491175,0.001402571,0.0008960609,0.20088999,0.1915692,0.116595775,0.012596058,0.46791714],"study_design_scores_gemma":[0.0001157973,0.00034853196,0.0032248222,0.00006382681,0.00015704054,0.0012166202,0.0007278155,0.68529177,0.062873125,0.22811615,0.01781523,0.000049267623],"about_ca_topic_score_codex":0.000554329,"about_ca_topic_score_gemma":0.0013055464,"teacher_disagreement_score":0.005481208,"about_ca_system_score_codex":0.0002836545,"about_ca_system_score_gemma":0.00029377223,"threshold_uncertainty_score":0.018336475},"labels":[],"label_agreement":null},{"id":"W2790165127","doi":"10.1007/978-3-319-78105-1_51","title":"Comparing Information Literacy Levels of Canadian and German University Students","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Library Science and Information Literacy","field":"Social Sciences","cited_by":8,"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":"German; Computer science; Information literacy; Mathematics education; Library science; Multimedia; History; Psychology","score_opus":0.023394684235215974,"score_gpt":0.2748617707564077,"score_spread":0.25146708652119176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790165127","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.98072493,0.00043694206,0.000034778444,0.000449022,0.000017760636,0.000011789134,0.0012787146,0.00001080441,0.017035244],"genre_scores_gemma":[0.99252313,0.0002934372,0.000060876187,0.000081034166,0.000004967274,0.000005772803,0.0008027274,0.0000058353057,0.0062222374],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989208,0.00004107459,0.000033571167,0.00010082637,0.00038023526,0.00052351976],"domain_scores_gemma":[0.9959628,0.00038733773,0.00035600847,0.000049423063,0.001846305,0.001398065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065239915,0.00020705859,0.0002978616,0.0030581786,0.002202959,0.0027261039,0.0006832054,0.00051302626,0.0076168836],"category_scores_gemma":[0.0045968997,0.00017600902,0.00042057384,0.0055953003,0.0007956245,0.0006862581,0.0008906743,0.0006636739,0.00070795836],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027001897,0.00017613922,0.9191483,0.00007856404,0.000045605484,0.00016903174,0.025198739,0.00016657295,0.0005392662,0.0028624446,0.007897341,0.043447994],"study_design_scores_gemma":[0.0000051350503,0.000039753606,0.984945,0.000038189235,0.0000141547935,0.00003550528,0.010556008,0.0000825037,0.00014219528,0.00007550653,0.0040479456,0.000018131144],"about_ca_topic_score_codex":0.9810955,"about_ca_topic_score_gemma":0.9897071,"teacher_disagreement_score":0.018904507,"about_ca_system_score_codex":0.018215658,"about_ca_system_score_gemma":0.02473125,"threshold_uncertainty_score":0.13216448},"labels":[],"label_agreement":null},{"id":"W2790350126","doi":"10.1007/978-3-319-77404-6_12","title":"Partitioning Orthogonal Histograms into Rectangular Boxes","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Carleton University; University of Waterloo","funders":"","keywords":"Histogram; Polyhedron; Computer science; Approximation algorithm; Combinatorics; Time complexity; Algorithm; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.014746891132040734,"score_gpt":0.24536472515531546,"score_spread":0.23061783402327474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790350126","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.023494413,0.0002993617,0.9645281,0.000083670595,0.0000805277,0.00015621516,0.00046738546,0.0018264664,0.009063797],"genre_scores_gemma":[0.19306372,0.0009322403,0.7840768,0.00019940425,0.00006644245,0.0002561598,0.0027954022,0.0013140447,0.017295828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996202,0.000052556145,0.000020514382,0.00009671146,0.00013015662,0.00007992652],"domain_scores_gemma":[0.99947673,0.000153072,0.00002709354,0.00014944084,0.00015068965,0.00004302969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032978467,0.00043583056,0.00073472026,0.0008966753,0.00031389136,0.0010027727,0.0008248668,0.0003380318,0.017051341],"category_scores_gemma":[0.0012640619,0.00049772416,0.00043243458,0.0015766277,0.00044133788,0.0012669088,0.0016744178,0.00069026876,0.003776188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048395095,0.00016280563,0.0015146881,0.00033523422,0.00004817912,0.000102031285,0.00021182667,0.04192605,0.044650193,0.05833237,0.019840281,0.83239245],"study_design_scores_gemma":[0.00019097119,0.00034914273,0.0034674832,0.00015976888,0.00009638573,0.00060730294,0.0008065193,0.65581787,0.07694518,0.15441912,0.107050635,0.00008963615],"about_ca_topic_score_codex":0.0021111327,"about_ca_topic_score_gemma":0.002694688,"teacher_disagreement_score":0.017051341,"about_ca_system_score_codex":0.0003382107,"about_ca_system_score_gemma":0.0006054542,"threshold_uncertainty_score":0.05704242},"labels":[],"label_agreement":null},{"id":"W2790829116","doi":"10.1007/978-3-662-56672-5_6","title":"Image Quality-Based Illumination-Invariant Face Recognition","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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 Calgary","funders":"","keywords":"Artificial intelligence; Computer science; Normalization (sociology); Facial recognition system; Biometrics; Pattern recognition (psychology); Computer vision; Discrete wavelet transform; Three-dimensional face recognition; Invariant (physics); Face (sociological concept); Wavelet; Wavelet transform; Face detection; Mathematics","score_opus":0.03140662278290552,"score_gpt":0.27706904167022406,"score_spread":0.24566241888731855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790829116","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.04445726,0.0023041577,0.94340914,0.00011352542,0.00017213037,0.00009709695,0.0003181979,0.0018841008,0.00724441],"genre_scores_gemma":[0.533922,0.0039522946,0.4392326,0.0002659052,0.00023987461,0.00010666036,0.001982952,0.00071344344,0.019584294],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995302,0.00003711642,0.0000148756,0.00008455908,0.00027930332,0.000053930213],"domain_scores_gemma":[0.9996038,0.00006562059,0.000044639688,0.0000858004,0.0001818816,0.000018275627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039887626,0.0004186031,0.0006093732,0.00062932627,0.00012186997,0.0005236833,0.0009681936,0.00034016152,0.0044930335],"category_scores_gemma":[0.00089839415,0.00019787568,0.00053177366,0.0006259102,0.0002740128,0.0006184118,0.00057198666,0.00053806097,0.0020990288],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000306569,0.00011776927,0.0007979604,0.00018874097,0.00006674722,0.00004183783,0.000024748035,0.009536801,0.2743713,0.0015587044,0.0040075015,0.70898134],"study_design_scores_gemma":[0.00004017884,0.0004052234,0.0146610215,0.000045107896,0.00015904942,0.0009266081,0.000039149443,0.5705432,0.40104815,0.0021596598,0.009898389,0.000074221054],"about_ca_topic_score_codex":0.0010403795,"about_ca_topic_score_gemma":0.0015000027,"teacher_disagreement_score":0.0044930335,"about_ca_system_score_codex":0.00032759117,"about_ca_system_score_gemma":0.00023460956,"threshold_uncertainty_score":0.015030682},"labels":[],"label_agreement":null},{"id":"W2791039059","doi":"10.1007/978-3-319-77553-1_9","title":"Scaling Tangled Program Graphs to Visual Reinforcement Learning in ViZDoom","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Artificial intelligence; Frame (networking); Process (computing); Code (set theory); Pixel; Graph; Machine learning; Theoretical computer science; Programming language","score_opus":0.01606880271556596,"score_gpt":0.27940287635503464,"score_spread":0.2633340736394687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791039059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043715794,0.00038982596,0.9453955,0.00023297491,0.000094922405,0.000043613512,0.00008459773,0.0020611263,0.007981549],"genre_scores_gemma":[0.7294443,0.00035137488,0.2597354,0.00013702745,0.000044343727,0.00011576887,0.0001941215,0.0006908024,0.009286866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998385,0.000053847387,0.0000070705323,0.00004221591,0.00003874744,0.000019707482],"domain_scores_gemma":[0.9994802,0.0002760416,0.000037579215,0.000086401815,0.0000726751,0.000047155663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300432,0.00042205743,0.00054356526,0.00040417508,0.0002906814,0.0005775404,0.00078351714,0.00048056492,0.0067831823],"category_scores_gemma":[0.002549964,0.0002570692,0.00031090114,0.0003718267,0.0005277266,0.001302201,0.0011264145,0.0010575529,0.0005541082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018986061,0.0000977163,0.00040595746,0.00013860289,0.000021613567,0.00008153532,0.00013440363,0.6360936,0.006118827,0.11816068,0.00624686,0.23231027],"study_design_scores_gemma":[0.000008828456,0.000021088215,0.000057784993,0.000008749475,0.0000032755445,0.000009726847,0.000011395067,0.93431145,0.00074747106,0.06356777,0.0012482856,0.0000041395156],"about_ca_topic_score_codex":0.0029367637,"about_ca_topic_score_gemma":0.0040935986,"teacher_disagreement_score":0.0067831823,"about_ca_system_score_codex":0.0006258234,"about_ca_system_score_gemma":0.00044081276,"threshold_uncertainty_score":0.022692025},"labels":[],"label_agreement":null},{"id":"W2791595938","doi":"10.1007/978-3-319-77583-8_8","title":"evoExplore: Multiscale Visualization of Evolutionary Histories in Virtual Reality","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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 Calgary","funders":"","keywords":"Computer science; Virtual reality; Game engine; Visualization; Human–computer interaction; Evolutionary algorithm; Virtual machine; Artificial intelligence","score_opus":0.022578637477935783,"score_gpt":0.27175204969171174,"score_spread":0.24917341221377595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791595938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030262763,0.001501046,0.91533595,0.0009952107,0.0003948583,0.00012119384,0.004515883,0.025603227,0.021269843],"genre_scores_gemma":[0.36473262,0.0033131707,0.5927397,0.0005950853,0.00028592424,0.000511371,0.0058270586,0.011229253,0.020765869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989796,0.000022686772,0.000005535064,0.0000144236155,0.000043420223,0.000016039274],"domain_scores_gemma":[0.9996227,0.00024804255,0.000018109897,0.000040308514,0.000033236665,0.000037558413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032538,0.00069307024,0.00050365255,0.00092373317,0.00027741137,0.0018535658,0.0010692837,0.0008897065,0.037186842],"category_scores_gemma":[0.0014737605,0.00049089105,0.00064272806,0.00072205806,0.00028767955,0.0012727955,0.0013914447,0.0012973277,0.002718404],"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.00041850918,0.00022089311,0.0019644767,0.0022179724,0.0002590636,0.0013627955,0.0026755459,0.17090592,0.06679436,0.10551413,0.17326394,0.47440234],"study_design_scores_gemma":[0.00021267845,0.00009848235,0.0031153301,0.00034460038,0.000077960794,0.0011622491,0.0004110979,0.658466,0.020702051,0.086021475,0.2291903,0.00019780452],"about_ca_topic_score_codex":0.0012687667,"about_ca_topic_score_gemma":0.002218316,"teacher_disagreement_score":0.037186842,"about_ca_system_score_codex":0.00022701154,"about_ca_system_score_gemma":0.0003805491,"threshold_uncertainty_score":0.124402344},"labels":[],"label_agreement":null},{"id":"W2791798548","doi":"10.1007/978-3-319-77935-5_6","title":"Don’t Miss the End: Preventing Unsafe End-of-File Comparisons","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; End-to-end principle; Operating system; Computer security","score_opus":0.020089860976006887,"score_gpt":0.2405901330487024,"score_spread":0.2205002720726955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791798548","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.120169856,0.0048644003,0.79417795,0.0060987156,0.0021156103,0.0005502633,0.00096130813,0.013793722,0.057268124],"genre_scores_gemma":[0.7448302,0.0011330284,0.22429729,0.0014391362,0.0006735781,0.00019344677,0.0010476151,0.0018275506,0.024558278],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928411,0.0015614285,0.00035495154,0.0008909437,0.0037284265,0.00062308053],"domain_scores_gemma":[0.9579933,0.020738892,0.003195271,0.011676517,0.005661201,0.0007348082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004423298,0.0010787711,0.001089057,0.0019808598,0.0025693425,0.0028817113,0.004185586,0.0031403734,0.01069159],"category_scores_gemma":[0.05557242,0.00090483204,0.00047698917,0.0012351819,0.0018179173,0.012984166,0.00593281,0.0035272175,0.0054636905],"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.0014137181,0.00050606165,0.011344015,0.00048548527,0.0001560543,0.00093704404,0.0018083713,0.015392837,0.013564401,0.10148524,0.098158486,0.75474817],"study_design_scores_gemma":[0.00025903943,0.0011175066,0.005419462,0.0008765949,0.00034503645,0.006998799,0.002430178,0.3294408,0.10885231,0.4218046,0.12214449,0.00031123767],"about_ca_topic_score_codex":0.0013505265,"about_ca_topic_score_gemma":0.0023873285,"teacher_disagreement_score":0.01069159,"about_ca_system_score_codex":0.00079980656,"about_ca_system_score_gemma":0.0022812474,"threshold_uncertainty_score":0.0357669},"labels":[],"label_agreement":null},{"id":"W2792021479","doi":"10.1007/978-3-319-94544-6_9","title":"Image Colorization Using Generative Adversarial Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Generative grammar; Adversarial system; Image (mathematics); Convolutional neural network; Deep learning; Process (computing); Pattern recognition (psychology); Theme (computing)","score_opus":0.017597090998139768,"score_gpt":0.24158482902173578,"score_spread":0.223987738023596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792021479","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.0020731485,0.00012287193,0.9954071,0.0000707854,0.00003358821,0.000019363151,0.000026963799,0.00051170285,0.0017345882],"genre_scores_gemma":[0.26366994,0.0009524755,0.71527296,0.00039074494,0.000114134586,0.00013474235,0.00032542954,0.0010732356,0.01806634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975127,0.000051502935,0.000006844514,0.0000740859,0.000086167325,0.000030152045],"domain_scores_gemma":[0.99961734,0.00014905988,0.000029957928,0.00011014985,0.00007168599,0.00002180995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052998064,0.0007879212,0.00068288547,0.00055290194,0.00026848132,0.0009989534,0.0010087183,0.000881318,0.0050296662],"category_scores_gemma":[0.0012268334,0.0005844496,0.00091773225,0.0006265127,0.00075485045,0.000981791,0.0013081316,0.001916523,0.0017744647],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001286748,0.000050884417,0.00026595627,0.000111858164,0.00008421174,0.0000755719,0.000069470014,0.6369416,0.04386541,0.040175747,0.0046037985,0.27362692],"study_design_scores_gemma":[0.000004467588,0.0000116490155,0.000050096136,0.0000067204664,0.0000087691205,0.00003816077,0.0000052297037,0.98403823,0.0059148576,0.008231691,0.0016823785,0.000007808601],"about_ca_topic_score_codex":0.0020491066,"about_ca_topic_score_gemma":0.0021028246,"teacher_disagreement_score":0.0050296662,"about_ca_system_score_codex":0.0007581634,"about_ca_system_score_gemma":0.0004458523,"threshold_uncertainty_score":0.016825974},"labels":[],"label_agreement":null},{"id":"W2792071900","doi":"10.1007/978-3-319-78133-4_13","title":"Evolutionary Optimization of Tone Mapped Image Quality Index","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tone mapping; Computer science; Tone (literature); Image quality; Image (mathematics); Measure (data warehouse); Artificial intelligence; Quality (philosophy); Operator (biology); Range (aeronautics); Evolutionary algorithm; Computer vision; High dynamic range; Pattern recognition (psychology); Data mining; Dynamic range","score_opus":0.016870665998142624,"score_gpt":0.29241045049500564,"score_spread":0.275539784496863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792071900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15528998,0.00092946313,0.81369334,0.00019246392,0.0001283838,0.00007315787,0.00007063465,0.0005038315,0.029118702],"genre_scores_gemma":[0.8237145,0.00039220948,0.16305973,0.00008682643,0.00004169996,0.00006610593,0.000091467926,0.00020294305,0.012344538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987817,0.00001749157,0.000003895151,0.000023760102,0.000056211768,0.000020336936],"domain_scores_gemma":[0.9997415,0.000096414034,0.00002441812,0.00002316624,0.00009621462,0.000018284334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195315,0.0003758429,0.0004131341,0.00044911483,0.00017271,0.00070843275,0.00064466306,0.0005156,0.0048259827],"category_scores_gemma":[0.0011272797,0.00017997342,0.0002996492,0.00036138378,0.00024055823,0.00049695856,0.00046073852,0.0002979167,0.00036575962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015379034,0.00016236311,0.0010229264,0.00018684851,0.0000674614,0.00012147616,0.00009828503,0.6738072,0.069523916,0.015799383,0.002558043,0.23649828],"study_design_scores_gemma":[0.000010465714,0.00008401266,0.00048343735,0.000011253501,0.000017868231,0.000056169767,0.0000133981775,0.99182105,0.004837279,0.0017661098,0.0008916548,0.0000072653147],"about_ca_topic_score_codex":0.0008740337,"about_ca_topic_score_gemma":0.0007810184,"teacher_disagreement_score":0.0048259827,"about_ca_system_score_codex":0.0004858671,"about_ca_system_score_gemma":0.00027153775,"threshold_uncertainty_score":0.016144514},"labels":[],"label_agreement":null},{"id":"W2792152807","doi":"10.1007/978-3-319-76687-4_18","title":"An Empirical Analysis of Risk Aversion in Malware Infections","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Polytechnique Montréal","funders":"","keywords":"Malware; Computer science; Order (exchange); The Internet; Risk aversion (psychology); Field (mathematics); Software; Computer security; Internet privacy; World Wide Web; Expected utility hypothesis; Finance; Statistics","score_opus":0.016943136245232082,"score_gpt":0.2766787722887151,"score_spread":0.25973563604348304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792152807","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.9732782,0.002164305,0.013525411,0.0013866771,0.00005323301,0.000057178262,0.0005211798,0.000102344566,0.008911457],"genre_scores_gemma":[0.99633884,0.00036851087,0.0009209667,0.000071259325,0.000057063968,0.000014732171,0.0001836284,0.000010088059,0.0020349734],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99873704,0.00072222174,0.000045222234,0.0001461491,0.00013605131,0.0002133371],"domain_scores_gemma":[0.91169465,0.07700372,0.0063506053,0.0022692205,0.0011733404,0.0015085009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042311195,0.000584324,0.00080630643,0.001249932,0.0005450376,0.0020417823,0.0011495239,0.0015290129,0.01069066],"category_scores_gemma":[0.031393185,0.00037898117,0.0010951927,0.001396697,0.0010784674,0.0023437678,0.0009856856,0.0033023064,0.0008006831],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025866914,0.0036760215,0.6027747,0.0007273939,0.0013098704,0.001449237,0.0019802828,0.08533979,0.003555453,0.14067973,0.014420999,0.14149985],"study_design_scores_gemma":[0.00022990604,0.0020036425,0.3842543,0.00030802976,0.0011027295,0.0015781753,0.0035890273,0.46675548,0.0017168238,0.13282634,0.0054544937,0.0001810793],"about_ca_topic_score_codex":0.0030990045,"about_ca_topic_score_gemma":0.002081872,"teacher_disagreement_score":0.01069066,"about_ca_system_score_codex":0.0008546807,"about_ca_system_score_gemma":0.0005537487,"threshold_uncertainty_score":0.0357638},"labels":[],"label_agreement":null},{"id":"W2792724063","doi":"10.1007/978-3-319-78556-1_2","title":"Improved Meet-in-the-Middle Attacks on Reduced Round Kuznyechik","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Block cipher; Cipher; Ciphertext; Plaintext; GOST (hash function); Algorithm; Theoretical computer science; Encryption; Cryptography; Computer security","score_opus":0.03911000237980846,"score_gpt":0.28815823016191994,"score_spread":0.24904822778211147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792724063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15186025,0.0017793209,0.72836345,0.0033886565,0.0009998329,0.00041622733,0.00062569376,0.005628447,0.106938034],"genre_scores_gemma":[0.88123304,0.0006227813,0.08573458,0.0005120967,0.0003006337,0.00027087147,0.00056004897,0.0007266269,0.030039338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994808,0.0013296787,0.00021694167,0.00070230337,0.0018106537,0.001132463],"domain_scores_gemma":[0.9958704,0.0013094937,0.00020197831,0.002054827,0.00039828653,0.00016503835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017451016,0.0016089373,0.0028077636,0.0014973889,0.002505674,0.0033792723,0.0021419586,0.0020052209,0.012848267],"category_scores_gemma":[0.0060480093,0.00085035176,0.0017143625,0.0014307091,0.002701997,0.006446474,0.007708953,0.004262906,0.0055658775],"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.0040791873,0.0003797585,0.0011096229,0.00038473442,0.00028147546,0.0003802313,0.00072534644,0.058202565,0.025093334,0.6909642,0.031461637,0.18693793],"study_design_scores_gemma":[0.00026803373,0.000327312,0.0007017359,0.000092273774,0.00021190173,0.00048178344,0.0001861679,0.2914235,0.024112342,0.6554459,0.026572637,0.00017638768],"about_ca_topic_score_codex":0.0007819505,"about_ca_topic_score_gemma":0.0007791949,"teacher_disagreement_score":0.012848267,"about_ca_system_score_codex":0.0016504916,"about_ca_system_score_gemma":0.0017414753,"threshold_uncertainty_score":0.042981684},"labels":[],"label_agreement":null},{"id":"W2792810455","doi":"10.1007/978-3-319-89656-4_42","title":"Predicting Crime Using Spatial Features","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Crime Patterns and Interventions","field":"Social Sciences","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":"Dalhousie University","funders":"","keywords":"Geocoding; Geospatial analysis; Crime analysis; Cluster analysis; Feature (linguistics); Spatial analysis; Position (finance); Noise (video)","score_opus":0.04998685989557949,"score_gpt":0.34490311199467993,"score_spread":0.29491625209910044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792810455","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.62951154,0.005738626,0.32057464,0.0017309517,0.00048963877,0.00010945734,0.010780754,0.002491273,0.02857313],"genre_scores_gemma":[0.9237422,0.0015030069,0.058472183,0.00006913297,0.00022744853,0.00005350498,0.0063092303,0.00007632979,0.009547077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998481,0.000028697528,0.0000073342917,0.000046395944,0.00003967059,0.00002970714],"domain_scores_gemma":[0.99962246,0.00019072604,0.00004558757,0.000047893333,0.00006828257,0.00002494905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030928547,0.00096303667,0.00054522103,0.0018391589,0.0002552886,0.00088868773,0.0006988478,0.0003951182,0.0044363886],"category_scores_gemma":[0.0011242867,0.00033905168,0.0008442244,0.0021910362,0.00020350186,0.00083718926,0.00058254536,0.00069072674,0.0019239025],"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.00027309902,0.00035993112,0.12308817,0.00014009286,0.00039929006,0.00014413764,0.00007738558,0.16881636,0.0029240504,0.004634535,0.024754725,0.6743882],"study_design_scores_gemma":[0.000010434996,0.00010106169,0.040335674,0.00006539873,0.0001059753,0.00017725634,0.00012833654,0.94127226,0.0019195953,0.012005449,0.0038440067,0.000034597033],"about_ca_topic_score_codex":0.011333154,"about_ca_topic_score_gemma":0.016764104,"teacher_disagreement_score":0.011333154,"about_ca_system_score_codex":0.00027594736,"about_ca_system_score_gemma":0.0003496752,"threshold_uncertainty_score":0.02253443},"labels":[],"label_agreement":null},{"id":"W2793179238","doi":"10.1007/978-3-319-90421-4_11","title":"A Delta-Oriented Approach to Support the Safe Reuse of Black-Box Code Rewriters","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Montréal","funders":"","keywords":"Rewriting; Computer science; Programming language; Reuse; Black box; Process (computing); Software; Code (set theory); Software engineering; Theoretical computer science; Artificial intelligence; Set (abstract data type)","score_opus":0.0430964841280263,"score_gpt":0.28773988187397925,"score_spread":0.24464339774595295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793179238","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.007659317,0.00025246403,0.97998893,0.00016525951,0.000119138145,0.00009356301,0.00009406752,0.0079371715,0.0036901156],"genre_scores_gemma":[0.15034994,0.0006560862,0.82425225,0.00040777627,0.00011014029,0.00020800495,0.00066553266,0.0030838642,0.020266488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804026,0.00032484985,0.00024481467,0.0002915375,0.00089722243,0.00020136137],"domain_scores_gemma":[0.99411184,0.0011516504,0.00024597623,0.0031134088,0.0011390598,0.00023802691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002198236,0.00087019784,0.0007575023,0.001465565,0.00086771266,0.0025728093,0.0035002537,0.0013604271,0.0050446866],"category_scores_gemma":[0.0064528026,0.0012137614,0.0010183264,0.0013169209,0.00139341,0.0042750207,0.003827019,0.0031860403,0.0024315314],"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.00043416084,0.00041306723,0.002350743,0.0005858408,0.00010018034,0.00069095305,0.0013719042,0.01760369,0.044884145,0.22690547,0.01882238,0.6858374],"study_design_scores_gemma":[0.00018659032,0.0003612149,0.0009558795,0.00040764824,0.00030979462,0.0014110246,0.00037587644,0.32167146,0.13799979,0.35761204,0.1785261,0.00018252103],"about_ca_topic_score_codex":0.0017392922,"about_ca_topic_score_gemma":0.002913548,"teacher_disagreement_score":0.0050446866,"about_ca_system_score_codex":0.0007074394,"about_ca_system_score_gemma":0.0020261179,"threshold_uncertainty_score":0.01687622},"labels":[],"label_agreement":null},{"id":"W2793244785","doi":"10.1007/978-3-319-75487-1_40","title":"An Informativeness Approach to Open IE Evaluation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université de Montréal","funders":"","keywords":"Computer science; Tuple; Task (project management); Protocol (science); Information extraction; Information retrieval; Recall; Natural language processing; Artificial intelligence; Precision and recall; Data mining","score_opus":0.060656292775890436,"score_gpt":0.3240916038813368,"score_spread":0.2634353111054464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793244785","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.008822191,0.00147178,0.95730716,0.0016747343,0.00021990726,0.00033318455,0.0005083062,0.0009531502,0.02870958],"genre_scores_gemma":[0.3733545,0.0011011467,0.6028418,0.001140461,0.0013101875,0.0011924638,0.0024038895,0.0010376862,0.015617864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.95957613,0.02105934,0.003345125,0.0029622335,0.01194497,0.0011121413],"domain_scores_gemma":[0.9258168,0.050042517,0.0024733231,0.007693695,0.012580879,0.0013928665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033019517,0.0018121464,0.0018309176,0.012816302,0.0030794982,0.009346446,0.0035959322,0.0031776314,0.012670042],"category_scores_gemma":[0.11110777,0.0011412123,0.0017892221,0.0070601273,0.0049216533,0.017654989,0.0066512753,0.005183746,0.0019208796],"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.0004399824,0.000278381,0.0028870718,0.0004939407,0.00017546046,0.00026034407,0.0012503507,0.020128557,0.0027954213,0.5957566,0.01542986,0.36010402],"study_design_scores_gemma":[0.00003943728,0.00012290472,0.0011194706,0.00026674743,0.00014489202,0.00028002358,0.0003461378,0.1281829,0.0045312,0.850129,0.014779409,0.000057910864],"about_ca_topic_score_codex":0.0017287731,"about_ca_topic_score_gemma":0.001998052,"teacher_disagreement_score":0.033019517,"about_ca_system_score_codex":0.003664151,"about_ca_system_score_gemma":0.0027385172,"threshold_uncertainty_score":0.17462593},"labels":[],"label_agreement":null},{"id":"W2793300563","doi":"10.1007/978-3-319-78199-0_30","title":"Multi-object Convexity Shape Prior for Segmentation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"Western University","funders":"","keywords":"Convexity; Submodular set function; Computer science; Segmentation; Artificial intelligence; Cut; Regular polygon; Context (archaeology); Image segmentation; Object (grammar); Computer vision; Constraint (computer-aided design); Mathematical optimization; Mathematics","score_opus":0.03849265038675492,"score_gpt":0.3075617509810864,"score_spread":0.2690691005943315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793300563","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.0029114303,0.0007999969,0.9927695,0.00016566452,0.000048931917,0.000033878798,0.00018197707,0.0008133773,0.0022752504],"genre_scores_gemma":[0.13993526,0.002684718,0.83923703,0.00038482563,0.00026282552,0.000162878,0.0021873082,0.0017287848,0.013416397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996517,0.0000476855,0.000017823833,0.00012044559,0.00011375514,0.0000484648],"domain_scores_gemma":[0.9992662,0.0002700814,0.00005330232,0.00019336077,0.00016298085,0.000054089684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007313748,0.0010755807,0.001544174,0.0013462302,0.0004711876,0.0017570105,0.0018404251,0.0017521023,0.0064719194],"category_scores_gemma":[0.0023231935,0.0010490707,0.0013744184,0.0015491593,0.00076217187,0.0017989966,0.0016473164,0.0025235142,0.0036983113],"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.0003968597,0.00011545168,0.0005852079,0.00045858516,0.00012852204,0.00021882923,0.00012630319,0.1823581,0.055038396,0.04952558,0.017455813,0.69359237],"study_design_scores_gemma":[0.00001135672,0.000031293428,0.00055067695,0.000050117378,0.00003119412,0.00020216458,0.000016549937,0.9581573,0.010553771,0.021344403,0.009032168,0.000019013632],"about_ca_topic_score_codex":0.006577216,"about_ca_topic_score_gemma":0.01101542,"teacher_disagreement_score":0.006577216,"about_ca_system_score_codex":0.0010786867,"about_ca_system_score_gemma":0.0015204969,"threshold_uncertainty_score":0.021650791},"labels":[],"label_agreement":null},{"id":"W2793336655","doi":"10.1007/978-3-319-93000-8_81","title":"Two-Stage Convolutional Neural Network for Breast Cancer Histology Image Classification","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Convolutional neural network; Pattern recognition (psychology); Contextual image classification; Artificial neural network; Salient; Deep learning; Breast cancer; Image (mathematics)","score_opus":0.026107074356104498,"score_gpt":0.28056397095869867,"score_spread":0.2544568966025942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793336655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11948613,0.008115937,0.8497055,0.0006878283,0.0006948274,0.00018719252,0.0017905176,0.0056096176,0.01372244],"genre_scores_gemma":[0.59569913,0.0042062304,0.32787597,0.00038828753,0.00021679161,0.00019324553,0.0052770167,0.00027313965,0.06587022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987614,0.000010341385,0.000007157327,0.000031479896,0.000041419782,0.00003351008],"domain_scores_gemma":[0.99986553,0.000029673112,0.000008002406,0.000022198716,0.00006480388,0.000009745351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003209974,0.0006524359,0.00038540902,0.0004635933,0.00021596115,0.00040627478,0.0010728749,0.00071593723,0.0039492613],"category_scores_gemma":[0.00040823396,0.00028860482,0.00062072126,0.0004434008,0.0001172003,0.0005238301,0.0005732442,0.000659327,0.0016959145],"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.0002498479,0.0001857142,0.0018393424,0.00018075142,0.000113405134,0.00012636691,0.000038009228,0.043103356,0.036490638,0.002723854,0.0131790545,0.9017698],"study_design_scores_gemma":[0.000010895073,0.00009317091,0.0022948792,0.000026757887,0.00009015401,0.00017058567,0.000014344937,0.9592665,0.028885204,0.0019291501,0.007200212,0.000018114566],"about_ca_topic_score_codex":0.007947365,"about_ca_topic_score_gemma":0.017001757,"teacher_disagreement_score":0.007947365,"about_ca_system_score_codex":0.00044779215,"about_ca_system_score_gemma":0.00073694735,"threshold_uncertainty_score":0.015802205},"labels":[],"label_agreement":null},{"id":"W2793382933","doi":"10.1007/978-3-319-75477-2_46","title":"Classification of Textual Genres Using Discourse Information","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text Readability and Simplification","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":"Concordia University","funders":"","keywords":"Computer science; Task (project management); Variety (cybernetics); Linguistics; Natural language processing; Artificial intelligence; Discourse analysis; Discourse marker; Philosophy","score_opus":0.033788664726766955,"score_gpt":0.28669100035671935,"score_spread":0.2529023356299524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793382933","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.5793004,0.017243067,0.1532776,0.002842318,0.0018500476,0.0024409292,0.071433626,0.00666942,0.1649425],"genre_scores_gemma":[0.7109864,0.0055172127,0.16904071,0.00022470718,0.0012706463,0.0013165928,0.07893595,0.0013311397,0.031376693],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979025,0.00047378143,0.0003784384,0.00038607966,0.0006577129,0.00020145497],"domain_scores_gemma":[0.987542,0.006496243,0.0011492172,0.0006880333,0.0032307345,0.00089385035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015181653,0.00098127,0.00071550685,0.029850807,0.0015386721,0.0041593416,0.00076846825,0.0006691273,0.013420513],"category_scores_gemma":[0.01212323,0.0002967301,0.0009732442,0.014794648,0.00083442806,0.0038419159,0.0022018724,0.0011731611,0.006840071],"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.00091916794,0.00030066544,0.046557188,0.0026445417,0.00013917043,0.00060590875,0.009904239,0.0009766147,0.037743773,0.014376307,0.035450142,0.85038227],"study_design_scores_gemma":[0.0002526696,0.0010248062,0.24279222,0.004711917,0.0010304962,0.0038790694,0.038799465,0.076560766,0.03872787,0.060216155,0.5316506,0.0003539714],"about_ca_topic_score_codex":0.0018267201,"about_ca_topic_score_gemma":0.002233966,"teacher_disagreement_score":0.029850807,"about_ca_system_score_codex":0.00094782584,"about_ca_system_score_gemma":0.0011657459,"threshold_uncertainty_score":0.044896126},"labels":[],"label_agreement":null},{"id":"W2793404312","doi":"10.1007/978-3-319-75541-0_7","title":"Multilevel Non-parametric Groupwise Registration in Cardiac MRI: Application to Explanted Porcine Hearts","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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 Toronto; Sunnybrook Health Science Centre; Ontario Tech University","funders":"","keywords":"Computer science; Pairwise comparison; Parametric statistics; Focus (optics); Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.019796187556575563,"score_gpt":0.3051632418162101,"score_spread":0.2853670542596345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793404312","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.010489828,0.00045870102,0.98651904,0.0001962421,0.000057181755,0.000048885056,0.00012885542,0.0009051006,0.0011961905],"genre_scores_gemma":[0.09921863,0.00086731976,0.89423096,0.00011026649,0.000074189644,0.00014547892,0.0002926332,0.000756839,0.004303674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995509,0.00018984317,0.000024986502,0.00007117856,0.00013067928,0.000032343167],"domain_scores_gemma":[0.99886286,0.0007099779,0.000091185444,0.00017488506,0.00013107645,0.000029982773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012402484,0.0006180359,0.0010022307,0.00051182864,0.0003523746,0.0010141679,0.0012156664,0.0012439608,0.0033817175],"category_scores_gemma":[0.0028597412,0.00043929883,0.0013471807,0.0010542801,0.0004967947,0.0004902469,0.0016756807,0.0015727954,0.001350814],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038632873,0.00017312309,0.0010097641,0.00072055013,0.0002626891,0.00043132462,0.0004374665,0.16517581,0.118550636,0.017992597,0.008912723,0.68594694],"study_design_scores_gemma":[0.000026076139,0.00025094202,0.0014314023,0.000037226808,0.00009414176,0.0005994164,0.0000824328,0.9380016,0.04056627,0.010351442,0.008505341,0.00005376809],"about_ca_topic_score_codex":0.0017890383,"about_ca_topic_score_gemma":0.004352758,"teacher_disagreement_score":0.0033817175,"about_ca_system_score_codex":0.00029960522,"about_ca_system_score_gemma":0.00072644703,"threshold_uncertainty_score":0.011313021},"labels":[],"label_agreement":null},{"id":"W2793764590","doi":"10.1007/978-3-319-76941-7_60","title":"Topic-Association Mining for User Interest Detection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Association rule learning; Association (psychology); Identification (biology); Semantics (computer science); Feature (linguistics); Information retrieval; Procurement; World Wide Web; Data science; Data mining","score_opus":0.026492407826543798,"score_gpt":0.2507432456198356,"score_spread":0.22425083779329177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793764590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098634854,0.014006846,0.8571323,0.0008352363,0.0009212583,0.00042546296,0.0088669835,0.0145065775,0.0046705357],"genre_scores_gemma":[0.48979577,0.0040149074,0.4651565,0.00037948866,0.0015261812,0.00056114903,0.026189283,0.0006645171,0.01171206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762505,0.00055042526,0.00027309713,0.000676479,0.0006289005,0.00024609454],"domain_scores_gemma":[0.99636686,0.0018989858,0.00023463069,0.00063867914,0.00068760314,0.00017326223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030255744,0.0015218708,0.0022217932,0.0062881443,0.0011071096,0.0019411542,0.0020731231,0.0015816513,0.0031913724],"category_scores_gemma":[0.0063615115,0.0005685954,0.0021933017,0.006822346,0.0003594814,0.0023416146,0.0017085001,0.0019872352,0.005317219],"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.0007441493,0.0008091431,0.018972239,0.00050593977,0.00058737013,0.00027107747,0.00021426452,0.008433921,0.014162765,0.0026245744,0.03305678,0.9196178],"study_design_scores_gemma":[0.00006617223,0.0003800272,0.015490012,0.00009313074,0.0005003994,0.0013280201,0.00023850905,0.9252011,0.017527224,0.015951911,0.023127323,0.000096122036],"about_ca_topic_score_codex":0.0031124551,"about_ca_topic_score_gemma":0.004410262,"teacher_disagreement_score":0.0062881443,"about_ca_system_score_codex":0.00050205836,"about_ca_system_score_gemma":0.0012308653,"threshold_uncertainty_score":0.016000986},"labels":[],"label_agreement":null},{"id":"W2794046253","doi":"10.1007/978-3-662-58387-6_20","title":"A New Look at the Refund Mechanism in the Bitcoin Payment Protocol","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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 Calgary","funders":"","keywords":"Computer security; Payment; Anonymity; Computer science; Protocol (science); Internet privacy; World Wide Web","score_opus":0.01763052419176772,"score_gpt":0.2846174001060163,"score_spread":0.26698687591424863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794046253","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.04161695,0.009823069,0.75312144,0.042773277,0.0036439204,0.00021560551,0.00026851406,0.0006538219,0.14788339],"genre_scores_gemma":[0.73130584,0.008639301,0.16054544,0.0071710967,0.0055771386,0.00040798794,0.00021525676,0.0009890678,0.08514883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99335045,0.0029965488,0.00029283104,0.00079416763,0.0018996709,0.0006663396],"domain_scores_gemma":[0.9924861,0.003984913,0.00034811022,0.002115276,0.0007382725,0.00032728448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061381445,0.0010596855,0.002644915,0.0022582868,0.0043786494,0.010234608,0.0036340193,0.008981357,0.016788954],"category_scores_gemma":[0.01573734,0.0013245525,0.0016866744,0.0035310544,0.012721893,0.04044165,0.004907969,0.014486041,0.002795142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044059754,0.000019396823,0.00005158289,0.000030317655,0.0000053627004,0.00006277431,0.00011630993,0.00078383705,0.0003131498,0.9935528,0.0010083076,0.0040120403],"study_design_scores_gemma":[0.000023740267,0.000019049136,0.000028494707,0.00003411824,0.000007114484,0.00011879851,0.000048872404,0.007114386,0.00039874192,0.982636,0.009546877,0.00002386812],"about_ca_topic_score_codex":0.001400589,"about_ca_topic_score_gemma":0.0009278308,"teacher_disagreement_score":0.016788954,"about_ca_system_score_codex":0.0024092752,"about_ca_system_score_gemma":0.0019946462,"threshold_uncertainty_score":0.056164682},"labels":[],"label_agreement":null},{"id":"W2794288670","doi":"10.1007/978-3-319-76953-0_8","title":"Threshold Properties of Prime Power Subgroups with Application to Secure Integer Comparisons","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Western University","funders":"","keywords":"Homomorphic encryption; Computer science; Cryptosystem; Integer (computer science); Prime (order theory); Protocol (science); Ciphertext; Theoretical computer science; Computation; Scheme (mathematics); Public-key cryptography; Threshold cryptosystem; Cryptography; Encryption; Algorithm; Mathematics; Computer network; Public key cryptosystem; Combinatorics; Programming language","score_opus":0.01456418204859348,"score_gpt":0.2291311963667691,"score_spread":0.21456701431817563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794288670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22353818,0.004465552,0.63841915,0.0039795716,0.00081407937,0.00021553044,0.0005013834,0.0010721515,0.12699437],"genre_scores_gemma":[0.9304712,0.001911005,0.04693063,0.00037107678,0.000811194,0.00013339444,0.00025451553,0.00030237902,0.018814659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989969,0.00019906605,0.00007733435,0.00023718445,0.00033120217,0.00015833165],"domain_scores_gemma":[0.99627495,0.002497267,0.00026000224,0.000551269,0.00023504953,0.00018151186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012487242,0.00078266347,0.0010265973,0.0017178318,0.0010305003,0.004231071,0.0011604185,0.001038973,0.0074612373],"category_scores_gemma":[0.0075777145,0.0004944043,0.0010184515,0.0024015184,0.0033265215,0.008290465,0.0027886212,0.0037267685,0.0011690808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012116711,0.00003289048,0.0002188778,0.000064295054,0.000008642686,0.00007528899,0.0002780593,0.0025575503,0.0024382307,0.9747053,0.0014196597,0.018080095],"study_design_scores_gemma":[0.000016588361,0.000024652509,0.00008088544,0.000012116495,0.000009032037,0.000099414254,0.00005307117,0.008896772,0.0015698973,0.9865079,0.0027209078,0.000008748641],"about_ca_topic_score_codex":0.00029764473,"about_ca_topic_score_gemma":0.00022049743,"teacher_disagreement_score":0.0074612373,"about_ca_system_score_codex":0.0013980278,"about_ca_system_score_gemma":0.00058555196,"threshold_uncertainty_score":0.02496034},"labels":[],"label_agreement":null},{"id":"W2794534772","doi":"10.1007/978-3-031-58411-4_18","title":"Faster Cryptographic Hash Function from Supersingular Isogeny Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Isogeny; Hash function; Cryptographic hash function; Cryptography; Computer science; Collision resistance; Cryptographic primitive; Mathematics; Cryptographic protocol; Elliptic curve; Perfect hash function; Algorithm; Pure mathematics; Computer security","score_opus":0.01086130293996169,"score_gpt":0.21196173362752196,"score_spread":0.20110043068756028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794534772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2260242,0.0026329383,0.687097,0.001710198,0.0009717719,0.00038714497,0.0009837569,0.007113132,0.07307991],"genre_scores_gemma":[0.80679685,0.0011107083,0.14399444,0.00071134267,0.0005858004,0.00027590297,0.0018248593,0.0011914072,0.04350871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.00015056228,0.000039734758,0.00014343191,0.0003688259,0.00012153144],"domain_scores_gemma":[0.99886227,0.00037014193,0.000062950894,0.00051981513,0.00014099343,0.00004379038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005913808,0.0008857057,0.001068581,0.0011727777,0.00084346655,0.0017169424,0.00096937316,0.00085902214,0.014358358],"category_scores_gemma":[0.0017198372,0.00048302763,0.00089652877,0.0014786752,0.0010734888,0.0048083127,0.0026545625,0.0019543087,0.004320155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013806006,0.00016204578,0.00079854665,0.0006596865,0.00010284895,0.0003945503,0.0005217776,0.02417926,0.04455111,0.57202107,0.027438251,0.3277903],"study_design_scores_gemma":[0.00025414946,0.00040320746,0.00078063307,0.00010454701,0.00011823026,0.0008935104,0.00017669021,0.095686,0.057122912,0.7961654,0.048193607,0.000101180565],"about_ca_topic_score_codex":0.00038584982,"about_ca_topic_score_gemma":0.00042150018,"teacher_disagreement_score":0.014358358,"about_ca_system_score_codex":0.0010268727,"about_ca_system_score_gemma":0.0007838054,"threshold_uncertainty_score":0.048033535},"labels":[],"label_agreement":null},{"id":"W2794733088","doi":"10.1007/978-3-319-89929-9_12","title":"A Nested 2-Level Cross-Validation Ensemble Learning Pipeline Suggests a Negative Pressure Against Crosstalk snoRNA-mRNA Interactions in Saccharomyces Cerevisae","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"McGill University","funders":"","keywords":"Crosstalk; RNA; Computational biology; Biology; Non-coding RNA; Small nucleolar RNA; Messenger RNA; Computer science; Genetics; Gene; Physics","score_opus":0.0247507843781144,"score_gpt":0.29141717412181867,"score_spread":0.26666638974370427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794733088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3725764,0.0009790427,0.61150634,0.0008270259,0.00038536495,0.00010185945,0.000854941,0.008323213,0.004445804],"genre_scores_gemma":[0.77845216,0.0001583336,0.21099012,0.00037069363,0.000054006243,0.00007687014,0.0030386164,0.00052120467,0.0063380385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913627,0.0002350877,0.000052131945,0.0003362303,0.00012891144,0.0001113856],"domain_scores_gemma":[0.99856,0.00062658923,0.000048683323,0.0002482273,0.00044404122,0.00007245767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003519513,0.0010864115,0.00086118944,0.00050503056,0.0009097457,0.0012723173,0.0014150025,0.001733858,0.0019802623],"category_scores_gemma":[0.0032487663,0.00053645635,0.0013935646,0.0003839969,0.00037030576,0.0013420851,0.0011348515,0.0022042235,0.00097083685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091827713,0.0005062766,0.014728802,0.00014274781,0.00063036353,0.0002517055,0.00015527791,0.50951445,0.058351286,0.0036096433,0.0096485885,0.40154257],"study_design_scores_gemma":[0.000007198065,0.000054045453,0.0015033208,0.000007601178,0.000035650086,0.000020558384,0.000009821826,0.9909162,0.0061155963,0.0009549998,0.0003644017,0.00001063307],"about_ca_topic_score_codex":0.007105284,"about_ca_topic_score_gemma":0.011406708,"teacher_disagreement_score":0.007105284,"about_ca_system_score_codex":0.000681948,"about_ca_system_score_gemma":0.0010098043,"threshold_uncertainty_score":0.01861322},"labels":[],"label_agreement":null},{"id":"W2794847029","doi":"10.1007/978-3-030-01252-6_36","title":"A Framework for Evaluating 6-DOF Object Trackers","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Université Laval","funders":"","keywords":"BitTorrent tracker; Computer science; Artificial intelligence; Robustness (evolution); Computer vision; Ground truth; Pipeline (software); Video tracking; Object (grammar); Synthetic data; Fiducial marker; Eye tracking","score_opus":0.07635977411340937,"score_gpt":0.3993683626942123,"score_spread":0.3230085885808029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794847029","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.0092117535,0.00046129496,0.98677397,0.000056554596,0.000051218834,0.00017055304,0.00026612115,0.0020557344,0.00095283607],"genre_scores_gemma":[0.22904277,0.00041362052,0.76601046,0.00008313425,0.0000824961,0.0003510576,0.0013129798,0.0003691606,0.0023344446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922367,0.0018719059,0.00059293606,0.0014123351,0.0033794902,0.0005066222],"domain_scores_gemma":[0.99207205,0.0027581782,0.0007631103,0.0013427123,0.002614236,0.00044971734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01036644,0.0028165313,0.0029039462,0.004344547,0.0012928803,0.0039962297,0.004206328,0.0038690914,0.00452936],"category_scores_gemma":[0.02625751,0.0010872046,0.0017485706,0.0024090675,0.0012316052,0.0036265238,0.0039137304,0.0021010842,0.0017669062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000886465,0.000412173,0.0076446016,0.0003101386,0.00042410532,0.00018410412,0.0001614616,0.37860855,0.021537045,0.021395037,0.004576827,0.5638594],"study_design_scores_gemma":[0.000043556443,0.00031781098,0.0014216917,0.000032803993,0.000063540974,0.000110885834,0.000032088064,0.98193526,0.0051122047,0.009262667,0.0016323134,0.00003522397],"about_ca_topic_score_codex":0.012256702,"about_ca_topic_score_gemma":0.013330572,"teacher_disagreement_score":0.012256702,"about_ca_system_score_codex":0.0018328609,"about_ca_system_score_gemma":0.0023398276,"threshold_uncertainty_score":0.054823637},"labels":[],"label_agreement":null},{"id":"W2794917520","doi":"10.1007/978-3-319-78723-7_29","title":"Predicting Tumor Locations in Prostate Cancer Tissue Using Gene Expression","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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 Windsor","funders":"","keywords":"Prostate cancer; Computer science; Expression (computer science); Cancer; Medicine; Internal medicine; Programming language","score_opus":0.021398727667973093,"score_gpt":0.2797690182318267,"score_spread":0.25837029056385363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794917520","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.71516615,0.018202374,0.23947811,0.0008865161,0.00021066054,0.00007482548,0.009537685,0.002961849,0.013481799],"genre_scores_gemma":[0.8812849,0.0068732454,0.09431634,0.00013307141,0.00011283343,0.00004346973,0.005925808,0.00014482961,0.011165478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991643,0.000008918338,0.000004711903,0.0000286863,0.00002794535,0.000013245721],"domain_scores_gemma":[0.9999033,0.000049373055,0.000014149139,0.0000071959726,0.000019725983,0.000006229342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016195251,0.00041991062,0.00029658983,0.0007854982,0.00010598427,0.00049764663,0.0003085704,0.00030107558,0.0014390629],"category_scores_gemma":[0.0003407612,0.00016953485,0.00041748607,0.0009921395,0.00011447726,0.00029670127,0.00016646727,0.00024213192,0.0012852388],"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.00034986268,0.000090427,0.1164508,0.0003301282,0.000112932474,0.00066221843,0.00010370394,0.019909687,0.24900985,0.0010241432,0.0064239656,0.60553247],"study_design_scores_gemma":[0.0000295391,0.0005074621,0.30094615,0.00017178872,0.00071940484,0.0039107995,0.00049151666,0.38204688,0.26865155,0.0066793277,0.03575303,0.000092612194],"about_ca_topic_score_codex":0.0018806396,"about_ca_topic_score_gemma":0.0032825745,"teacher_disagreement_score":0.0018806396,"about_ca_system_score_codex":0.00017797969,"about_ca_system_score_gemma":0.00017823256,"threshold_uncertainty_score":0.004814148},"labels":[],"label_agreement":null},{"id":"W2794961841","doi":"10.1007/978-3-319-78723-7_14","title":"Identification of the Treatment Survivability Gene Biomarkers of Breast Cancer Patients via a Tree-Based Approach","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breast cancer; Survivability; Classifier (UML); Biomarker; Radiation therapy; Medicine; Decision tree; Oncology; Cancer; Computer science; Internal medicine; Machine learning; Bioinformatics; Computational biology; Artificial intelligence; Biology","score_opus":0.007770949462282466,"score_gpt":0.21664306137382555,"score_spread":0.2088721119115431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794961841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3003587,0.007398557,0.6739057,0.0011814925,0.00017058388,0.00044792338,0.00863593,0.0011902142,0.0067109615],"genre_scores_gemma":[0.6737059,0.002828003,0.30695012,0.0003663678,0.00021253839,0.00036763167,0.011931981,0.000121766156,0.00351581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959975,0.000100260695,0.0000290007,0.00011649782,0.00009417686,0.000060358205],"domain_scores_gemma":[0.999186,0.0004620131,0.00009245198,0.000041234893,0.00017155256,0.000046834197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007154578,0.0006678015,0.0011177948,0.0028240546,0.00039002247,0.0011329273,0.0007842141,0.00081264926,0.002132154],"category_scores_gemma":[0.0018939323,0.00023471606,0.0015919207,0.0024039014,0.00019237162,0.0007462476,0.0005614533,0.000621996,0.0010557355],"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.0011207833,0.0006631865,0.07464713,0.00076905556,0.0008621926,0.00074228813,0.00034717433,0.09748821,0.043898355,0.00792765,0.011779423,0.7597546],"study_design_scores_gemma":[0.00008051055,0.00067832804,0.050056845,0.00017288465,0.00091050274,0.001040794,0.0003225844,0.90052575,0.005076396,0.0325588,0.0084971925,0.00007934569],"about_ca_topic_score_codex":0.0022408469,"about_ca_topic_score_gemma":0.0026286733,"teacher_disagreement_score":0.0028240546,"about_ca_system_score_codex":0.00039050574,"about_ca_system_score_gemma":0.0006318252,"threshold_uncertainty_score":0.0071327686},"labels":[],"label_agreement":null},{"id":"W2795096674","doi":"10.1007/978-3-319-78795-4_6","title":"Soft Overcomes Hard: Simulation Leadership as Mediation of Choice Architectures","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching Methodologies in Social Sciences","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":"St. Mary's University","funders":"","keywords":"Computer science; Process (computing); Mediation; Field (mathematics); Work (physics); Transactional leadership; Knowledge management; Management science; Sociology; Public relations; Political science; Engineering","score_opus":0.158307770847542,"score_gpt":0.39742483305666804,"score_spread":0.23911706220912604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795096674","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.45814517,0.00026539943,0.28166607,0.0070182756,0.0002638946,0.0001317542,0.00012599658,0.0007136497,0.25166985],"genre_scores_gemma":[0.98599696,0.000033703272,0.008421249,0.00008218779,0.000014923794,0.00004347707,0.000029217363,0.00006243949,0.005315836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970379,0.0020723883,0.000050535167,0.00023101641,0.0003436447,0.0002645554],"domain_scores_gemma":[0.9863381,0.009468157,0.0007737585,0.001677971,0.0005035274,0.0012384747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364319,0.00048796312,0.00037075367,0.0005177921,0.0012171691,0.0051876726,0.0012806681,0.0009997074,0.024008583],"category_scores_gemma":[0.02517561,0.0004547351,0.0004819889,0.00049960887,0.003690191,0.005261863,0.0045904526,0.002898958,0.0013147822],"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.0002299091,0.00025423075,0.0043128887,0.000077450335,0.000063737534,0.0001052717,0.004358073,0.027562262,0.001399953,0.92261493,0.0026482204,0.03637304],"study_design_scores_gemma":[0.000060599326,0.00010159595,0.0017395978,0.000036898506,0.000023296196,0.000039407732,0.0016094748,0.13839939,0.0009605945,0.8505078,0.0064925426,0.00002874042],"about_ca_topic_score_codex":0.0012395934,"about_ca_topic_score_gemma":0.0013269047,"teacher_disagreement_score":0.024008583,"about_ca_system_score_codex":0.001250107,"about_ca_system_score_gemma":0.001996936,"threshold_uncertainty_score":0.08031666},"labels":[],"label_agreement":null},{"id":"W2795128400","doi":"10.1007/978-3-030-00256-5_1","title":"On Dispersable Book Embeddings","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Deutsche Forschungsgemeinschaft","keywords":"Bipartite graph; Combinatorics; Conjecture; Embedding; Mathematics; Planar graph; Bounded function; Book embedding; Graph; Discrete mathematics; Line graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.013358847014909098,"score_gpt":0.2710764931829497,"score_spread":0.2577176461680406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795128400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24011055,0.0013722989,0.56700516,0.0023051505,0.0005951574,0.00014135835,0.0016511225,0.0011774927,0.18564165],"genre_scores_gemma":[0.7070479,0.0016120902,0.11197051,0.0005079173,0.00038495063,0.00017229082,0.0031288043,0.0011055416,0.17407005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994117,0.0001272197,0.00003741579,0.00018594539,0.0001563986,0.00008127049],"domain_scores_gemma":[0.9978415,0.0008354791,0.00023605177,0.0005457745,0.00029984227,0.00024135684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042679821,0.0006984437,0.0006401345,0.0016178718,0.0011335799,0.0021183498,0.0009942936,0.0009667709,0.028453901],"category_scores_gemma":[0.0050661936,0.0005901316,0.0005389631,0.0015250804,0.0014161249,0.0056228456,0.0038394912,0.0020007493,0.004504694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087342596,0.000035152287,0.00032952442,0.0000801821,0.00000977928,0.00008462394,0.0003062549,0.0047080494,0.0012271419,0.9504108,0.007642396,0.035078764],"study_design_scores_gemma":[0.000018341407,0.000027815635,0.0002111676,0.000033964432,0.000012814505,0.00009839039,0.00024147281,0.020167137,0.0007089889,0.957469,0.020999566,0.000011327985],"about_ca_topic_score_codex":0.0008531461,"about_ca_topic_score_gemma":0.0009947153,"teacher_disagreement_score":0.028453901,"about_ca_system_score_codex":0.00057992863,"about_ca_system_score_gemma":0.00027221092,"threshold_uncertainty_score":0.09518784},"labels":[],"label_agreement":null},{"id":"W2795353754","doi":"10.1007/978-3-319-89441-6_7","title":"Approximating Domination on Intersection Graphs of Paths on a Grid","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Graph; String (physics); Approximation algorithm; Mathematics; Physics; Discrete mathematics","score_opus":0.020236276699641596,"score_gpt":0.2799436579717326,"score_spread":0.259707381272091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795353754","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.5470473,0.0008919287,0.42487624,0.0008013904,0.00008098044,0.00016592386,0.00096935325,0.001516957,0.023649884],"genre_scores_gemma":[0.77712363,0.0006138903,0.20988105,0.00017215968,0.00007825556,0.00015712749,0.0017994333,0.0005518722,0.009622619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983967,0.00041600727,0.00006991234,0.00032645997,0.0004476739,0.00034334435],"domain_scores_gemma":[0.9917225,0.0057218536,0.00046570122,0.0011420943,0.00048577393,0.000462035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012139636,0.0012481005,0.0018782046,0.0018607201,0.0010949867,0.0026050294,0.0034410083,0.0012196596,0.0074569224],"category_scores_gemma":[0.009228731,0.0010863101,0.0012537875,0.003760414,0.0016678149,0.0048777754,0.0039033864,0.0026482365,0.0007568997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014934326,0.00037050087,0.010191988,0.0006460458,0.00022882206,0.0003826352,0.0010557281,0.64244705,0.009607569,0.17629378,0.011563317,0.14571911],"study_design_scores_gemma":[0.00007183875,0.00007111931,0.0007960292,0.00005089789,0.00004351535,0.00015921851,0.0002553374,0.8485755,0.0018532142,0.14554487,0.0025650417,0.000013408803],"about_ca_topic_score_codex":0.00657827,"about_ca_topic_score_gemma":0.009718329,"teacher_disagreement_score":0.0074569224,"about_ca_system_score_codex":0.0024597605,"about_ca_system_score_gemma":0.0011445835,"threshold_uncertainty_score":0.024945915},"labels":[],"label_agreement":null},{"id":"W2795477232","doi":"10.1007/978-3-319-89656-4_26","title":"Drug-Target Interaction Network Predictions for Drug Repurposing Using LASSO-Based Regularized Linear Classification Model","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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 Manitoba","funders":"","keywords":"Drug repositioning; Lasso (programming language); Computer science; Artificial intelligence; Logistic regression; Drug; Machine learning; Repurposing; Drug discovery; Elastic net regularization; Data mining; Bioinformatics; Pharmacology; Feature selection; Medicine; Biology","score_opus":0.05357441714302096,"score_gpt":0.32510404292485795,"score_spread":0.271529625781837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795477232","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.03295911,0.0019782719,0.954813,0.0011149705,0.00016917192,0.00015978748,0.0014204403,0.0032810944,0.004104181],"genre_scores_gemma":[0.53242224,0.0019014537,0.443217,0.0008205625,0.00036988806,0.00057520845,0.0072066607,0.00064363366,0.012843347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951684,0.00015486266,0.000029895868,0.00012628039,0.00012608629,0.000046099845],"domain_scores_gemma":[0.99908864,0.00051303825,0.00011025162,0.00009500976,0.0001486287,0.000044443794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359179,0.0009989352,0.0013618941,0.00087065314,0.00036714878,0.0008674097,0.001245587,0.0009022481,0.004197663],"category_scores_gemma":[0.0025560304,0.00043948187,0.001650787,0.00063405355,0.00026912228,0.0010043479,0.0008082491,0.001992098,0.0018075376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004754917,0.00042341894,0.0031065592,0.0004250131,0.00030243842,0.00026370367,0.0000694308,0.5367526,0.012749526,0.00823203,0.03232299,0.40487683],"study_design_scores_gemma":[0.000006140898,0.00003275409,0.00016423014,0.000008362149,0.000018083923,0.000026374937,0.000004866702,0.995886,0.0008991456,0.002265557,0.0006828568,0.000005595933],"about_ca_topic_score_codex":0.0018396614,"about_ca_topic_score_gemma":0.0027624601,"teacher_disagreement_score":0.004197663,"about_ca_system_score_codex":0.0004939053,"about_ca_system_score_gemma":0.0008236588,"threshold_uncertainty_score":0.014042556},"labels":[],"label_agreement":null},{"id":"W2795483004","doi":"10.1007/978-3-319-89656-4_32","title":"Towards a Comprehensive Evaluation of Recommenders: A Cognition-Based Approach","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Ottawa","funders":"","keywords":"RSS; Computer science; Recommender system; Taxonomy (biology); Metric (unit); Cognition; Artificial intelligence; Machine learning; World Wide Web","score_opus":0.07912975177512617,"score_gpt":0.306175133184565,"score_spread":0.22704538140943886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795483004","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.089875914,0.018467398,0.8203003,0.0050091245,0.00030728956,0.00084179523,0.0011424288,0.0012363268,0.06281937],"genre_scores_gemma":[0.52806157,0.003422176,0.4605589,0.0005529449,0.00030259264,0.000496969,0.0014956777,0.00019223517,0.0049169017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9567126,0.019349001,0.0024796932,0.0023904128,0.018236382,0.00083207665],"domain_scores_gemma":[0.9071723,0.055191487,0.00431044,0.008216991,0.022591716,0.0025170718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032307863,0.0019099513,0.0027694032,0.0076652397,0.0015485943,0.0128556425,0.0033936196,0.0036097376,0.0064290925],"category_scores_gemma":[0.10018817,0.00066194026,0.0015142116,0.006632672,0.002659974,0.0122898705,0.0040261536,0.0026845785,0.0016507942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075092143,0.0008946357,0.033711277,0.0029180122,0.0014274644,0.00015478207,0.0021240232,0.022493336,0.005167052,0.18048473,0.014318987,0.73555475],"study_design_scores_gemma":[0.00026334447,0.0032078498,0.05231274,0.0029971995,0.0018047615,0.000930071,0.0057232045,0.37064126,0.011954415,0.47983032,0.06983782,0.0004969545],"about_ca_topic_score_codex":0.0041665565,"about_ca_topic_score_gemma":0.0055482886,"teacher_disagreement_score":0.032307863,"about_ca_system_score_codex":0.0029029327,"about_ca_system_score_gemma":0.0030213718,"threshold_uncertainty_score":0.17086238},"labels":[],"label_agreement":null},{"id":"W2795506808","doi":"10.1007/978-3-319-89656-4_17","title":"MML-Based Approach for Determining the Number of Topics in EDCM Mixture Models","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; Multinomial distribution; Expectation–maximization algorithm; Exponential family; Dirichlet distribution; Simulated annealing; Mixture model; Exponential function; Algorithm; Artificial intelligence; Heuristic; Machine learning; Maximum likelihood; Mathematics; Statistics","score_opus":0.03514417107977675,"score_gpt":0.2857522084889811,"score_spread":0.25060803740920434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795506808","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.0031330534,0.0003770808,0.9939681,0.000085408006,0.000037366193,0.00004826984,0.000388077,0.001165602,0.0007969717],"genre_scores_gemma":[0.04637357,0.00034381365,0.9476236,0.00019102727,0.00009991217,0.00026682095,0.0022551818,0.00040576071,0.0024403546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973558,0.0008731368,0.00023337013,0.0005287672,0.0008111998,0.00019770858],"domain_scores_gemma":[0.99555814,0.0027242177,0.00016701134,0.00039936186,0.0009748605,0.00017638029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034111058,0.0013139916,0.0014649405,0.0044087167,0.0010118947,0.0026342722,0.003228394,0.0025241023,0.008403789],"category_scores_gemma":[0.010316336,0.000964288,0.0021209992,0.0033147943,0.0006932344,0.0021893252,0.0031365529,0.0025532732,0.0041278456],"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.0005739251,0.0001860625,0.0049259053,0.00046985035,0.00030866917,0.00024930798,0.00033334378,0.091725826,0.019469792,0.024840148,0.00988162,0.8470355],"study_design_scores_gemma":[0.0000321788,0.00003941467,0.0013253466,0.000048828133,0.00009880077,0.00019049486,0.000071018905,0.96696603,0.006878343,0.017849205,0.006448084,0.000052282925],"about_ca_topic_score_codex":0.008187329,"about_ca_topic_score_gemma":0.013039249,"teacher_disagreement_score":0.008403789,"about_ca_system_score_codex":0.001529026,"about_ca_system_score_gemma":0.0017933215,"threshold_uncertainty_score":0.028113425},"labels":[],"label_agreement":null},{"id":"W2795522097","doi":"10.1007/978-3-319-89656-4_44","title":"Decision Assist for Self-driving Cars","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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":"Computer science; Visibility; Reinforcement learning; Motion planning; Self driving; State (computer science); Artificial intelligence; Path (computing); Real-time computing; Machine learning; Algorithm; Transport engineering; Robot; Engineering","score_opus":0.008075547271338426,"score_gpt":0.2206067179341335,"score_spread":0.2125311706627951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795522097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045883045,0.012146034,0.7949317,0.0006621609,0.0020448403,0.00017697048,0.000807662,0.008995797,0.1343518],"genre_scores_gemma":[0.63956064,0.006560161,0.12963843,0.0004806987,0.00036904385,0.00015007393,0.0016253246,0.00041272223,0.22120294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998852,0.000012740037,0.000005830873,0.00002439728,0.0000542078,0.000017622631],"domain_scores_gemma":[0.99988806,0.000038686336,0.000005044054,0.000015887654,0.000042401152,0.000009934459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014124182,0.00072018406,0.00033142237,0.00026187752,0.00028121055,0.0007027039,0.000900025,0.00055364997,0.015460671],"category_scores_gemma":[0.0003345866,0.00020709056,0.00023629234,0.00019508768,0.00014727285,0.0006494744,0.0006029385,0.00058461924,0.0038253432],"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.00033622133,0.00021310186,0.0006026263,0.0007838395,0.000057498804,0.00047540298,0.00039392582,0.028109498,0.036991987,0.019706847,0.052136034,0.86019295],"study_design_scores_gemma":[0.00007224759,0.0008425677,0.0033545361,0.00032990047,0.00011390567,0.0013422738,0.00041892548,0.4982297,0.058020126,0.035635248,0.40153608,0.000104411454],"about_ca_topic_score_codex":0.0008131291,"about_ca_topic_score_gemma":0.0011781765,"teacher_disagreement_score":0.015460671,"about_ca_system_score_codex":0.00013134615,"about_ca_system_score_gemma":0.00020184959,"threshold_uncertainty_score":0.051721096},"labels":[],"label_agreement":null},{"id":"W2795544197","doi":"10.1007/978-3-319-89656-4_10","title":"Reranking Candidate Lists for Improved Lexical Induction","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Natural language processing; Task (project management); Artificial intelligence; Lexicon; Translation (biology); Speech recognition","score_opus":0.016389435755552975,"score_gpt":0.27935371309484636,"score_spread":0.2629642773392934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795544197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034792755,0.0019873192,0.9266265,0.0006026226,0.0007925492,0.0004422787,0.0038759564,0.022487016,0.008392986],"genre_scores_gemma":[0.17349404,0.0008023885,0.7817201,0.0003307477,0.00072219304,0.00053449476,0.019949667,0.002360958,0.020085432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767464,0.0006960312,0.00026412215,0.00039778926,0.0007144797,0.00025295324],"domain_scores_gemma":[0.9938637,0.0030519783,0.00019415157,0.0009298723,0.0017854987,0.00017485852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014703695,0.0013351116,0.0021304453,0.0064423466,0.0018753542,0.002332154,0.002827083,0.001400667,0.028023649],"category_scores_gemma":[0.009089941,0.0009256261,0.0013588488,0.005198186,0.0005652824,0.0040281597,0.0027144498,0.0021500578,0.021603554],"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.00045073195,0.00030035127,0.000970258,0.00047035905,0.00008558901,0.00032508888,0.0001377115,0.0074761854,0.018445743,0.008535031,0.04848853,0.9143145],"study_design_scores_gemma":[0.00035197343,0.00045366582,0.0022731822,0.00024465012,0.00038792216,0.0010791309,0.0004168606,0.8168732,0.041767675,0.08359636,0.052405644,0.00014969845],"about_ca_topic_score_codex":0.0027815308,"about_ca_topic_score_gemma":0.009081157,"teacher_disagreement_score":0.028023649,"about_ca_system_score_codex":0.00061597826,"about_ca_system_score_gemma":0.0019757675,"threshold_uncertainty_score":0.09374851},"labels":[],"label_agreement":null},{"id":"W2795588493","doi":"10.1007/978-3-319-89656-4_19","title":"Dimensionality Reduction and Visualization by Doubly Kernelized Unit Ball Embedding","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Dalhousie University","funders":"","keywords":"Cluster analysis; Dimensionality reduction; Computer science; Embedding; Visualization; Graph embedding; Kernel (algebra); Pattern recognition (psychology); Gaussian function; Algorithm; Gaussian; Artificial intelligence; Data mining; Mathematics; Discrete mathematics","score_opus":0.021881989167738893,"score_gpt":0.2866329445835294,"score_spread":0.2647509554157905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795588493","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.010276916,0.00028619563,0.9851009,0.00023269493,0.00009327511,0.000038423623,0.00029445626,0.0023019263,0.0013752668],"genre_scores_gemma":[0.20606814,0.0008146744,0.7812262,0.00014419711,0.00010506212,0.00020485865,0.0017618135,0.0011766864,0.008498248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.000106607644,0.000026853388,0.000085632,0.00016256051,0.000052812065],"domain_scores_gemma":[0.999453,0.00011079193,0.000040371222,0.00017690053,0.00017473123,0.000044180328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003643998,0.0007895416,0.0009283074,0.00096185785,0.0003270666,0.0015867754,0.00087683223,0.0005313379,0.0061052185],"category_scores_gemma":[0.001900609,0.00036237843,0.00074930605,0.0010430609,0.0004500654,0.0015514187,0.001961936,0.0013560569,0.0027742907],"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.00034168715,0.00012398562,0.00060561486,0.00024666186,0.00007208935,0.00009650578,0.0002685181,0.040314283,0.05426578,0.039915383,0.036401715,0.82734776],"study_design_scores_gemma":[0.000018515912,0.00006048584,0.0006134105,0.00002396882,0.000015371501,0.0001504494,0.00008897602,0.9355072,0.023202525,0.027077107,0.013205786,0.000036200367],"about_ca_topic_score_codex":0.0019382631,"about_ca_topic_score_gemma":0.0016670957,"teacher_disagreement_score":0.0061052185,"about_ca_system_score_codex":0.00029434136,"about_ca_system_score_gemma":0.0006506159,"threshold_uncertainty_score":0.020423949},"labels":[],"label_agreement":null},{"id":"W2795589408","doi":"10.1007/978-3-319-89656-4_43","title":"A Tool for Defining and Simulating Storage Strategies on the Smart Grid","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Energy Management","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Scripting language; Smart grid; Key (lock); Process (computing); Software; Grid; Computer data storage; Distributed computing; Electrical engineering; Operating system; Engineering","score_opus":0.0158727687446121,"score_gpt":0.22066822541112396,"score_spread":0.20479545666651186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795589408","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.0055807238,0.0001139852,0.9789327,0.00011061752,0.0001048239,0.00007539332,0.0007995847,0.006761495,0.007520736],"genre_scores_gemma":[0.16362327,0.0005837686,0.820269,0.00018400005,0.0000892403,0.00065180263,0.0020635466,0.003412665,0.0091226725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971527,0.000073114425,0.00003133476,0.000047178044,0.00010200959,0.000031028914],"domain_scores_gemma":[0.9989705,0.00061602064,0.000056816025,0.00016694635,0.00013351747,0.000056252615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008452563,0.0013349627,0.0014165619,0.0007914991,0.0009533473,0.0022666901,0.0034185916,0.0023615507,0.016990893],"category_scores_gemma":[0.0026195368,0.0011004275,0.0016738407,0.0009819438,0.0008813047,0.0019982185,0.0014411006,0.0020636793,0.0023666362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006487312,0.00008779376,0.0006267271,0.00018532205,0.00006786415,0.00018408881,0.00016042723,0.9036047,0.0027548003,0.059032533,0.006304252,0.026926689],"study_design_scores_gemma":[0.000021807873,0.000010485968,0.000042256197,0.00001734171,0.000011145916,0.000028360622,0.000011041158,0.9753798,0.00090344076,0.015733417,0.007831172,0.0000096559825],"about_ca_topic_score_codex":0.0055190064,"about_ca_topic_score_gemma":0.006017369,"teacher_disagreement_score":0.016990893,"about_ca_system_score_codex":0.00069291407,"about_ca_system_score_gemma":0.0010996577,"threshold_uncertainty_score":0.05684024},"labels":[],"label_agreement":null},{"id":"W2795612574","doi":"10.1007/978-3-319-89656-4_9","title":"MedFact: Towards Improving Veracity of Medical Information in Social Media Using Applied Machine Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":26,"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 Machine Intelligence Institute","keywords":"Computer science; Social media; Credibility; Layperson; Terminology; Information retrieval; World Wide Web; Data science; Internet privacy","score_opus":0.03295830149432964,"score_gpt":0.3034429947613311,"score_spread":0.2704846932670014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795612574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0611342,0.006638925,0.8591909,0.0061735758,0.0021904148,0.00045908164,0.008225294,0.038085185,0.017902412],"genre_scores_gemma":[0.36785224,0.0027442982,0.591474,0.0014966559,0.0019815296,0.0003097231,0.016935958,0.0020426605,0.015162973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477875,0.0018610248,0.0003946253,0.00053343916,0.0022564405,0.00017563516],"domain_scores_gemma":[0.9791981,0.0129653765,0.0011625113,0.0029820907,0.0032464392,0.00044549358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082004545,0.0016565843,0.0013937067,0.006415078,0.0007706405,0.0047430405,0.002075714,0.0024116887,0.005072297],"category_scores_gemma":[0.032368354,0.0005747908,0.0009727543,0.0033622012,0.0011889272,0.008096633,0.0036027948,0.0027054097,0.0032323538],"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.0006072116,0.00056684983,0.0062748906,0.00061843387,0.00031571137,0.00023326497,0.00045714734,0.035487063,0.010429118,0.011754519,0.05388475,0.87937105],"study_design_scores_gemma":[0.000065665976,0.00025027906,0.0026029397,0.00020048635,0.00016468846,0.0003489305,0.00023874622,0.89348763,0.024437938,0.04429422,0.03377891,0.00012948828],"about_ca_topic_score_codex":0.0021700335,"about_ca_topic_score_gemma":0.0026961712,"teacher_disagreement_score":0.0082004545,"about_ca_system_score_codex":0.0007434283,"about_ca_system_score_gemma":0.0012006812,"threshold_uncertainty_score":0.043368638},"labels":[],"label_agreement":null},{"id":"W2795671000","doi":"10.1007/978-3-319-89656-4_11","title":"Analysis of Social Media Posts for Early Detection of Mental Health Conditions","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Clef; Computer science; Social media; Task (project management); Information retrieval; Mental health; Artificial intelligence; Supervised learning; Machine learning; World Wide Web; Artificial neural network; Psychology; Psychiatry","score_opus":0.03539398776916829,"score_gpt":0.36709332012166396,"score_spread":0.33169933235249566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795671000","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.92096925,0.0026351782,0.019198705,0.0010521063,0.0010132926,0.00043813666,0.03385246,0.0015861563,0.019254642],"genre_scores_gemma":[0.9269811,0.0012141905,0.033682156,0.00020889578,0.0011210107,0.00041021194,0.020896124,0.00013141212,0.015354933],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996433,0.00008866057,0.00004068808,0.0000688181,0.000102221944,0.000056288784],"domain_scores_gemma":[0.9973742,0.0017173187,0.00025062362,0.0001071748,0.00038530913,0.00016530995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050580985,0.0005662104,0.00034386126,0.0036603159,0.00039360617,0.00098265,0.00027394854,0.00041963128,0.0063816896],"category_scores_gemma":[0.0027219716,0.00012927594,0.00046357518,0.0016206414,0.0001267652,0.00072376354,0.0005493666,0.0004463062,0.003932313],"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.0015653257,0.0009932447,0.22559288,0.0010427989,0.00027872194,0.0009236479,0.001237905,0.0013019574,0.049309514,0.00111326,0.040472526,0.67616826],"study_design_scores_gemma":[0.00005734574,0.0012880269,0.8480918,0.0003069356,0.00036623477,0.0019396032,0.0041047423,0.07724179,0.029076211,0.0033693116,0.034019362,0.00013865069],"about_ca_topic_score_codex":0.0013160675,"about_ca_topic_score_gemma":0.0034351319,"teacher_disagreement_score":0.0063816896,"about_ca_system_score_codex":0.00017990392,"about_ca_system_score_gemma":0.00026620133,"threshold_uncertainty_score":0.021348894},"labels":[],"label_agreement":null},{"id":"W2795716178","doi":"10.1007/978-3-319-89656-4_15","title":"Infusing Domain Knowledge to Improve the Detection of Alzheimer’s Disease from Everyday Motion Behaviour","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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 Toronto","funders":"","keywords":"Dyad; Computer science; Motion (physics); Set (abstract data type); Domain (mathematical analysis); Artificial intelligence; Accelerometer; Machine learning; Psychology; Mathematics; Developmental psychology","score_opus":0.02121800881374493,"score_gpt":0.25823315885206066,"score_spread":0.23701515003831575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795716178","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.4448056,0.020985175,0.4745265,0.0055960007,0.0013356013,0.00029899052,0.009700472,0.009738698,0.033013035],"genre_scores_gemma":[0.85202044,0.0043816944,0.12275036,0.0009835996,0.0005094605,0.000107728156,0.010786776,0.00017189073,0.008288137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994722,0.00013067137,0.000037244678,0.00019145505,0.000095775795,0.00007261072],"domain_scores_gemma":[0.9981876,0.0011655389,0.00010222174,0.00020215368,0.00025972474,0.00008269442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596203,0.00092925923,0.0007714634,0.0015766391,0.00026127326,0.0010761787,0.00064486574,0.0011057783,0.0024964772],"category_scores_gemma":[0.004408127,0.00023141551,0.0006775067,0.0009867596,0.00029122288,0.0011928264,0.0009904942,0.001020457,0.0020109564],"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.0004075127,0.00061478745,0.028111113,0.00029220604,0.00022182235,0.00041215203,0.00016896112,0.012453424,0.018770153,0.00096185936,0.015303124,0.9222829],"study_design_scores_gemma":[0.00008747887,0.000841043,0.099266745,0.00047981183,0.00068164454,0.002390146,0.0007355273,0.7886984,0.04230449,0.034024034,0.030342126,0.0001485889],"about_ca_topic_score_codex":0.0058887177,"about_ca_topic_score_gemma":0.00804732,"teacher_disagreement_score":0.0058887177,"about_ca_system_score_codex":0.00032588386,"about_ca_system_score_gemma":0.00058324815,"threshold_uncertainty_score":0.011708915},"labels":[],"label_agreement":null},{"id":"W2795812275","doi":"10.1007/978-3-319-89656-4_28","title":"Combining MCTS and A3C for Prediction of Spatially Spreading Processes in Forest Wildfire Settings","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Monte Carlo tree search; Reinforcement learning; Tree (set theory); Variety (cybernetics); Artificial intelligence; Monte Carlo method; Simulation","score_opus":0.024957770985953337,"score_gpt":0.26202402063684205,"score_spread":0.2370662496508887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795812275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35742527,0.002131802,0.6301971,0.0008443997,0.0003962006,0.00014968897,0.002248576,0.0030237269,0.0035832098],"genre_scores_gemma":[0.92306286,0.00029233884,0.07307997,0.00015080207,0.00018594455,0.00009437024,0.0015217186,0.00013270354,0.0014792366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00010777105,0.00003077623,0.00011187772,0.000072925366,0.00006425926],"domain_scores_gemma":[0.9950907,0.0036735318,0.00022030545,0.00021116674,0.00052016444,0.00028405487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017218614,0.0011541013,0.0016594866,0.0017140759,0.0006079386,0.0013867875,0.0020586946,0.0018948574,0.0031139941],"category_scores_gemma":[0.0063606375,0.0006275621,0.0011224498,0.0012759684,0.00056664075,0.0018513948,0.0012833416,0.0016023048,0.0008351181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002716062,0.00015150038,0.009453702,0.00007833717,0.000120657925,0.00008686297,0.000034494187,0.9361144,0.00073813705,0.0020830322,0.0019564002,0.048910916],"study_design_scores_gemma":[0.0000022502652,0.0000042439533,0.0001580936,0.0000017452431,0.0000032855273,0.0000021693406,0.000001915017,0.9992211,0.000030438965,0.00054911413,0.00002401712,0.0000016273383],"about_ca_topic_score_codex":0.04905923,"about_ca_topic_score_gemma":0.041367933,"teacher_disagreement_score":0.04905923,"about_ca_system_score_codex":0.00095757167,"about_ca_system_score_gemma":0.0013533991,"threshold_uncertainty_score":0.09754735},"labels":[],"label_agreement":null},{"id":"W2795822186","doi":"10.1007/978-3-319-89363-1_7","title":"Distributed Graph Queries for Runtime Monitoring of Cyber-Physical Systems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Emberi Eroforrások Minisztériuma","keywords":"Computer science; Cyber-physical system; Distributed computing; Runtime verification; Abstraction; Graph; Computation; Domain (mathematical analysis); Formal verification; Theoretical computer science; Programming language; Operating system","score_opus":0.015665078597640544,"score_gpt":0.24882201983589594,"score_spread":0.2331569412382554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795822186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024551611,0.00030420918,0.96750313,0.00031602263,0.00004796837,0.00014887832,0.00021782232,0.002531,0.0043793404],"genre_scores_gemma":[0.4683979,0.00039795967,0.5255306,0.0002266775,0.000057282337,0.00025498652,0.00067639427,0.00088023767,0.0035779416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664366,0.0014337377,0.00019568567,0.00046136745,0.0010935913,0.00017188754],"domain_scores_gemma":[0.9965783,0.0022492069,0.00022325877,0.0005116147,0.00034364322,0.000094022216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025624998,0.0009925866,0.0005343622,0.0008419285,0.0004886653,0.0028482988,0.0016063467,0.001144705,0.0028764056],"category_scores_gemma":[0.006792453,0.00030257305,0.0009445853,0.0008296449,0.0017968512,0.0038334413,0.0018419718,0.0015422844,0.00047660238],"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.0006468722,0.00019688396,0.0021387497,0.0005738085,0.00006844335,0.00079953804,0.0017030764,0.21386616,0.02901901,0.56745166,0.0075420747,0.17599368],"study_design_scores_gemma":[0.00007099626,0.000107808715,0.00038082342,0.00006597277,0.000038530783,0.00026501564,0.00025041035,0.72804224,0.014426044,0.24145737,0.014858151,0.000036657795],"about_ca_topic_score_codex":0.0030244945,"about_ca_topic_score_gemma":0.003216091,"teacher_disagreement_score":0.0030244945,"about_ca_system_score_codex":0.0019010975,"about_ca_system_score_gemma":0.0010873901,"threshold_uncertainty_score":0.0137934685},"labels":[],"label_agreement":null},{"id":"W2795898573","doi":"10.1007/978-3-319-89656-4_27","title":"Optimal Scheduling for Smart Charging of Electric Vehicles Using Dynamic Programming","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Mitacs","keywords":"Computer science; Dynamic programming; Schedule; Electricity; Scheduling (production processes); Operations research; Mathematical optimization; Real-time computing; Electrical engineering; Algorithm; Operating system; Engineering","score_opus":0.010267669129533996,"score_gpt":0.23074280473961106,"score_spread":0.22047513561007706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795898573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020012984,0.000865621,0.9598413,0.00030930317,0.00026031886,0.00007057339,0.00008251573,0.000289738,0.01826773],"genre_scores_gemma":[0.834136,0.0011093728,0.14675917,0.000119252436,0.00021549145,0.00015003294,0.00020122861,0.0002499251,0.017059604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966383,0.00009387729,0.000009883993,0.000057828456,0.00008746863,0.00008712156],"domain_scores_gemma":[0.999752,0.00014647673,0.000020091546,0.000015925416,0.000040352425,0.000025108997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044108368,0.0008826796,0.0011136958,0.00036125307,0.00043843893,0.0011499784,0.00093331875,0.0006056158,0.004008989],"category_scores_gemma":[0.001067349,0.0005257146,0.0006179779,0.0007681996,0.00052036747,0.00081472326,0.00066992675,0.0011046671,0.00042450347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082911894,0.00004752714,0.00006952626,0.00007994452,0.000018653247,0.000026629968,0.000030438408,0.9314323,0.0014773611,0.02660229,0.0025389653,0.037593383],"study_design_scores_gemma":[0.000008116834,0.00001511707,0.000028768442,0.0000037485875,0.0000031401253,0.00000630276,0.0000068282448,0.98724246,0.0002413526,0.011390777,0.0010502362,0.0000030765043],"about_ca_topic_score_codex":0.00397944,"about_ca_topic_score_gemma":0.0038975521,"teacher_disagreement_score":0.004008989,"about_ca_system_score_codex":0.0013319777,"about_ca_system_score_gemma":0.0012673126,"threshold_uncertainty_score":0.013411343},"labels":[],"label_agreement":null},{"id":"W2795912112","doi":"10.1007/978-3-319-89656-4_14","title":"A Multiagent Framework for Understanding Addiction","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gambling Behavior and Treatments","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dilemma; Prisoner's dilemma; Game theory; Addiction; Artificial intelligence; Management science; Social dilemma; Iterated function; Epistemology; Mathematical economics; Psychology; Social psychology","score_opus":0.1641017060363431,"score_gpt":0.3908673734388305,"score_spread":0.22676566740248738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795912112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008256642,0.006005174,0.85497665,0.006845999,0.0003928562,0.00005354385,0.00030841166,0.000293251,0.12286741],"genre_scores_gemma":[0.44577718,0.005470673,0.48418328,0.0009608434,0.00066844554,0.0003551564,0.00043643216,0.00020096952,0.061947007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998227,0.000076084674,0.000012432014,0.000037792706,0.00003053212,0.000020618596],"domain_scores_gemma":[0.999734,0.00015837973,0.000026446814,0.000026225269,0.000025378024,0.000029541761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055136206,0.0009786815,0.0005019098,0.0007594715,0.0007648774,0.0020185576,0.0014263795,0.0015575702,0.010391913],"category_scores_gemma":[0.0008547637,0.0004675301,0.0010250679,0.00063789636,0.0015509827,0.0034664266,0.0013022157,0.002122665,0.0011869073],"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.0000048915117,0.000015323261,0.00019806459,0.000040342242,0.000022917935,0.000073100535,0.00018616262,0.015307421,0.00024345197,0.96856904,0.0027399673,0.012599348],"study_design_scores_gemma":[0.000003536548,0.0000073229876,0.000174589,0.000028829898,0.000010484244,0.000041508323,0.000068878406,0.057603978,0.00006761605,0.9288284,0.013157459,0.0000074392788],"about_ca_topic_score_codex":0.005384136,"about_ca_topic_score_gemma":0.0054530436,"teacher_disagreement_score":0.010391913,"about_ca_system_score_codex":0.0013595588,"about_ca_system_score_gemma":0.00061885314,"threshold_uncertainty_score":0.03476441},"labels":[],"label_agreement":null},{"id":"W2795943763","doi":"10.1007/978-3-319-89656-4_36","title":"Automated Scheduling: Reinforcement Learning Approach to Algorithm Policy Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"","keywords":"Computer science; Reinforcement learning; Scheduling (production processes); Automated planning and scheduling; Artificial intelligence; Machine learning; Mathematical optimization; Mathematics","score_opus":0.013642011004647247,"score_gpt":0.24345368081353472,"score_spread":0.22981166980888748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795943763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002059312,0.00039639176,0.99394023,0.00015085794,0.00008432354,0.000025670868,0.000025969108,0.0005174258,0.0027998202],"genre_scores_gemma":[0.3198697,0.0010066156,0.6689166,0.00022126292,0.00030001948,0.00029337715,0.00021823468,0.00043474766,0.0087394845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988701,0.0005568614,0.00004873468,0.00015935779,0.00028906402,0.00007591627],"domain_scores_gemma":[0.99735755,0.0018649248,0.00011434845,0.00027727077,0.00031838828,0.00006746103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017617992,0.00094430277,0.001151716,0.00063090905,0.00041879888,0.0013347975,0.0021108415,0.0013191152,0.005077276],"category_scores_gemma":[0.006925689,0.0006602687,0.0006561868,0.0009898791,0.0009671551,0.0013159178,0.0010343095,0.0027905246,0.0010544559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007218813,0.00008666344,0.00020296426,0.00012226679,0.00004279331,0.000022477638,0.000052428557,0.7870355,0.00084110396,0.045328073,0.0048896484,0.16130379],"study_design_scores_gemma":[0.0000059176446,0.000007624313,0.000022723085,0.0000061980254,0.0000028299555,0.0000042683805,0.0000024002475,0.9838516,0.00021308886,0.015094752,0.0007859039,0.0000026392554],"about_ca_topic_score_codex":0.004055786,"about_ca_topic_score_gemma":0.00389414,"teacher_disagreement_score":0.005077276,"about_ca_system_score_codex":0.0013981615,"about_ca_system_score_gemma":0.0017261937,"threshold_uncertainty_score":0.016985178},"labels":[],"label_agreement":null},{"id":"W2795993153","doi":"10.1007/978-3-319-89656-4_5","title":"Logic-Based Benders Decomposition for Two-Stage Flexible Flow Shop Scheduling with Unrelated Parallel Machines","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Concordia University","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Integer programming; Benders' decomposition; Flow shop scheduling; Decomposition; Scheduling (production processes); Schedule; Minification; Parallel computing; Algorithm; Mathematics","score_opus":0.01869293230081087,"score_gpt":0.2630693514547308,"score_spread":0.24437641915391994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795993153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007730863,0.00020442983,0.9861195,0.00008854535,0.000062124825,0.00009372324,0.00012442519,0.00049861206,0.0050778766],"genre_scores_gemma":[0.19732621,0.00044412015,0.793266,0.00018573862,0.00010102421,0.00027454708,0.000763369,0.00030341768,0.007335604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992661,0.00019964868,0.000047334914,0.00012536447,0.00024276107,0.00011886737],"domain_scores_gemma":[0.99950874,0.00023502177,0.000044978653,0.00006881645,0.00010620046,0.00003630781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518753,0.0012083051,0.0011297953,0.0008256394,0.0006146447,0.0013059623,0.0014542256,0.00083088584,0.0068490827],"category_scores_gemma":[0.001285682,0.00087600795,0.002267157,0.0009288986,0.0005876463,0.0013959191,0.001116623,0.0022746776,0.001443769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054260093,0.0003172916,0.00025936894,0.0004992333,0.000113214366,0.00017945048,0.0001696634,0.6460723,0.022760423,0.07264453,0.0056213955,0.2508205],"study_design_scores_gemma":[0.000041894924,0.00012079744,0.00010502352,0.000028621262,0.00003265644,0.000038920385,0.000022141761,0.94009715,0.0023901865,0.05521882,0.0018845652,0.00001922668],"about_ca_topic_score_codex":0.002089484,"about_ca_topic_score_gemma":0.0026975384,"teacher_disagreement_score":0.0068490827,"about_ca_system_score_codex":0.001023568,"about_ca_system_score_gemma":0.0013425504,"threshold_uncertainty_score":0.022912443},"labels":[],"label_agreement":null},{"id":"W2796085096","doi":"10.1007/978-3-319-89656-4_6","title":"Advice-Based Exploration in Model-Based Reinforcement Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Centre for Social Innovation; Vector Institute; University of Toronto","funders":"","keywords":"Reinforcement learning; Satisficing; Computer science; Advice (programming); Robustness (evolution); Convergence (economics); Grid; Artificial intelligence; Operations research; Mathematical optimization; Engineering","score_opus":0.026662711587482006,"score_gpt":0.2551386000725917,"score_spread":0.2284758884851097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796085096","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.011196015,0.0007559029,0.98253685,0.00017959904,0.0000752644,0.000026386975,0.00002229967,0.00030766014,0.0049000853],"genre_scores_gemma":[0.8023399,0.00084504037,0.1877841,0.00012709982,0.00010017078,0.00021522568,0.00008464736,0.00016296332,0.0083408225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995215,0.00020733032,0.000025382627,0.00007008334,0.0001308916,0.000044818316],"domain_scores_gemma":[0.9985141,0.0011553866,0.00006518456,0.0000951766,0.00011324306,0.000056867244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009662018,0.00065761665,0.0009562142,0.00028992578,0.00030671645,0.0008501934,0.0013928667,0.0010481202,0.0036555782],"category_scores_gemma":[0.004286531,0.0004889423,0.00050373684,0.00044423935,0.0010243356,0.0011841796,0.0013504075,0.0018270193,0.0004055896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114455106,0.000058013087,0.0002563703,0.00013197718,0.0000321198,0.000047607806,0.00008594605,0.8493829,0.0013740638,0.06387893,0.0016201078,0.0830176],"study_design_scores_gemma":[0.000008543843,0.00001682929,0.000021364487,0.000006297943,0.0000033094811,0.0000075627154,0.0000021535634,0.9805722,0.00017954444,0.018864227,0.00031496395,0.0000029045686],"about_ca_topic_score_codex":0.0027488947,"about_ca_topic_score_gemma":0.0022913935,"teacher_disagreement_score":0.0036555782,"about_ca_system_score_codex":0.0007163897,"about_ca_system_score_gemma":0.00068491505,"threshold_uncertainty_score":0.012229145},"labels":[],"label_agreement":null},{"id":"W2796085209","doi":"10.1007/978-3-319-89656-4_38","title":"Real-Time Deep Learning Pedestrians Classification on a Micro-Controller","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Pedestrian detection; Artificial neural network; Software deployment; Raspberry pi; Object detection; Machine learning; Real-time computing; Pedestrian; Pattern recognition (psychology); Embedded system; Operating system; Internet of Things; Engineering","score_opus":0.026116084078971945,"score_gpt":0.28022851556938616,"score_spread":0.25411243149041424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796085209","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.153807,0.0005706645,0.8258037,0.0003681545,0.00058129913,0.00015788968,0.00051468576,0.01188044,0.0063162916],"genre_scores_gemma":[0.8509912,0.00012470582,0.14025274,0.00017846921,0.000060806862,0.000076591416,0.0005324901,0.0001282622,0.007654859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997758,0.0000147414885,0.0000057690627,0.0000940362,0.00005836519,0.00005122528],"domain_scores_gemma":[0.9997621,0.00005790285,0.000014372653,0.000044389475,0.000085250016,0.000035996818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002761271,0.0008047022,0.00071959884,0.0003346571,0.0003161227,0.0005388372,0.0012227742,0.00057707523,0.006353785],"category_scores_gemma":[0.00058140577,0.00036034934,0.00030022426,0.00036298885,0.0002037387,0.0005774755,0.00060438324,0.0010159633,0.0013871824],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010031975,0.00044408298,0.0030445831,0.00009945166,0.00008616671,0.00019459565,0.000050430266,0.113117404,0.057696037,0.0019944808,0.013138458,0.8091311],"study_design_scores_gemma":[0.0000122174715,0.000080150305,0.0008793984,0.0000036179342,0.000010360332,0.00002868056,0.000007500982,0.9904383,0.0070077227,0.00064376986,0.0008815921,0.000006717748],"about_ca_topic_score_codex":0.011456759,"about_ca_topic_score_gemma":0.019670615,"teacher_disagreement_score":0.011456759,"about_ca_system_score_codex":0.0006938947,"about_ca_system_score_gemma":0.0008599402,"threshold_uncertainty_score":0.02278012},"labels":[],"label_agreement":null},{"id":"W2796110809","doi":"10.1007/978-3-319-78978-1_20","title":"Building Website Certificate Mental Models","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Certificate; Computer science; World Wide Web; Mental model; Internet privacy; Psychology; Cognitive science; Theoretical computer science","score_opus":0.3170808746553548,"score_gpt":0.40248223348087203,"score_spread":0.08540135882551725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796110809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30314815,0.00028684144,0.4507418,0.0054240073,0.00015946948,0.00024243552,0.0014406111,0.0017386717,0.23681805],"genre_scores_gemma":[0.9575095,0.00009887805,0.035464376,0.00019247015,0.000018036868,0.00011898352,0.0011454516,0.00013112175,0.005321019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9978528,0.0010093969,0.00008927734,0.00045813553,0.000372188,0.00021811781],"domain_scores_gemma":[0.98762286,0.0080163935,0.0006567761,0.002135281,0.0010805558,0.00048819586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022900794,0.0007770242,0.00040011987,0.0021116543,0.0013204858,0.007201144,0.0022290025,0.0014107138,0.022165805],"category_scores_gemma":[0.025295075,0.0009186219,0.0014611523,0.0012841081,0.002324737,0.010683733,0.0029406492,0.002548327,0.0024762223],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014192634,0.00027180207,0.012606919,0.00009326425,0.00009992947,0.00012701997,0.0053793234,0.019339653,0.0005748093,0.8591718,0.010895811,0.091297835],"study_design_scores_gemma":[0.000029695935,0.000046242636,0.003759315,0.000115351584,0.000096963995,0.00011844268,0.0038180586,0.22924685,0.001083982,0.74769586,0.0139266085,0.00006256771],"about_ca_topic_score_codex":0.012062005,"about_ca_topic_score_gemma":0.010774906,"teacher_disagreement_score":0.022165805,"about_ca_system_score_codex":0.0027530782,"about_ca_system_score_gemma":0.0015598669,"threshold_uncertainty_score":0.07415199},"labels":[],"label_agreement":null},{"id":"W2796118676","doi":"10.1007/978-3-319-89656-4_20","title":"Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","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":"York University","funders":"","keywords":"Block (permutation group theory); Stochastic gradient descent; Computer science; Gradient descent; Big data; Algorithm; Factorization; Convergence (economics); Gradient method; Mathematics; Combinatorics; Data mining; Artificial intelligence","score_opus":0.09292500798450563,"score_gpt":0.3193265258625638,"score_spread":0.22640151787805818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796118676","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.0009016689,0.00096289936,0.9960471,0.00015517838,0.00016781456,0.000021614633,0.00006969594,0.00026448135,0.0014095372],"genre_scores_gemma":[0.03539461,0.002496859,0.9485053,0.00023186965,0.0003604745,0.00019852049,0.000505453,0.00044986283,0.011857196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00014869579,0.000022749391,0.00008215295,0.00018637188,0.000033659275],"domain_scores_gemma":[0.99904794,0.00046623798,0.000048374273,0.00017607883,0.00021256304,0.00004880052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086134,0.0014526471,0.0011435671,0.00060285034,0.00031834625,0.0010123305,0.001213385,0.0013373959,0.0065961615],"category_scores_gemma":[0.0033891615,0.00057137746,0.0008440756,0.0011557516,0.00096282974,0.0016410775,0.0015514931,0.002766125,0.0035509076],"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.00028965645,0.00014277778,0.0003292577,0.0008684486,0.00015544402,0.0001740331,0.00019424426,0.21292102,0.019844135,0.21998489,0.05964699,0.48544917],"study_design_scores_gemma":[0.000021038246,0.00004431443,0.00013000883,0.000032990534,0.000012337636,0.00010477333,0.000016141446,0.91520303,0.0026140555,0.06633085,0.015467611,0.000022842027],"about_ca_topic_score_codex":0.0017906757,"about_ca_topic_score_gemma":0.0029907508,"teacher_disagreement_score":0.0065961615,"about_ca_system_score_codex":0.00044921713,"about_ca_system_score_gemma":0.00083925243,"threshold_uncertainty_score":0.022066295},"labels":[],"label_agreement":null},{"id":"W2796154186","doi":"10.1007/978-3-319-89656-4_2","title":"De-Causalizing NAT-Modeled Bayesian Networks for Inference Efficiency","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Bayesian network; Inference; Conditional independence; Nat; Artificial intelligence; Variable elimination; Tree (set theory); Bayesian inference; Independence (probability theory); Dependency (UML); Conditional probability; Machine learning; Theoretical computer science; Bayesian probability; Mathematics; Statistics","score_opus":0.027162230516130145,"score_gpt":0.2781790134376523,"score_spread":0.25101678292152213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796154186","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.0013610292,0.00017327398,0.9957086,0.00031646623,0.000051715917,0.000028608001,0.000112184985,0.00025826538,0.0019898857],"genre_scores_gemma":[0.13573469,0.0011264018,0.85164666,0.0006305906,0.00035135145,0.00044445597,0.0010408611,0.0006822749,0.008342738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937382,0.003516947,0.00035657515,0.00094776036,0.0011826523,0.00025790354],"domain_scores_gemma":[0.9543773,0.03429306,0.0007836213,0.0079806475,0.0022097225,0.00035559718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00944797,0.0016291466,0.0020375524,0.0017265446,0.0011610631,0.0029921203,0.0044786986,0.0020649955,0.009985229],"category_scores_gemma":[0.058206074,0.001681282,0.002895361,0.0023325125,0.0021659127,0.0071050683,0.0047578476,0.007712857,0.0023251383],"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.00012522098,0.00007733188,0.0006727248,0.00025450767,0.00017379457,0.0001047094,0.0001689456,0.20225549,0.0011659468,0.67180777,0.0067944867,0.116399124],"study_design_scores_gemma":[0.000010977202,0.00000799995,0.000069172056,0.000029533878,0.00004045366,0.000046674442,0.000016056787,0.477097,0.0007550689,0.518774,0.0031422796,0.000010856206],"about_ca_topic_score_codex":0.003058292,"about_ca_topic_score_gemma":0.0050358986,"teacher_disagreement_score":0.009985229,"about_ca_system_score_codex":0.0026773876,"about_ca_system_score_gemma":0.0032178788,"threshold_uncertainty_score":0.049966276},"labels":[],"label_agreement":null},{"id":"W2796204195","doi":"10.1007/978-3-319-89656-4_1","title":"Compressing Bayesian Networks: Swarm-Based Descent, Efficiency, and Posterior Accuracy","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Computer science; Bayesian network; Inference; Generality; Tree (set theory); Simple (philosophy); Artificial intelligence; Bayesian inference; Range (aeronautics); Algorithm; Bayesian probability; Machine learning; Mathematics","score_opus":0.021922918595649155,"score_gpt":0.259994383729386,"score_spread":0.23807146513373684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796204195","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.012443202,0.0006993009,0.9838996,0.00048948434,0.000058701695,0.000041058705,0.000084909196,0.00024119162,0.0020424894],"genre_scores_gemma":[0.3393762,0.0021180878,0.6497638,0.0003204118,0.0004134354,0.0003770588,0.000754612,0.00051916344,0.0063572177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987425,0.000569443,0.000086553875,0.00017671917,0.00034079625,0.00008399176],"domain_scores_gemma":[0.9845653,0.0126607325,0.000519345,0.0009962227,0.0009899134,0.00026844695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004888599,0.0012976509,0.0021447437,0.0012969668,0.0006349343,0.00195348,0.0022305704,0.0023858321,0.0031307717],"category_scores_gemma":[0.034940723,0.0011359076,0.00093960407,0.0017952082,0.0017934956,0.004358981,0.0025629825,0.0036989034,0.00062016427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014416853,0.00005962302,0.0009503996,0.00018182183,0.000064536755,0.00004799217,0.00016777645,0.79627466,0.00084796164,0.0874509,0.0037667998,0.11004334],"study_design_scores_gemma":[0.00000952099,0.000014124232,0.00007344524,0.000015168862,0.0000057103803,0.00001260785,0.0000061577516,0.97295815,0.00016154633,0.026398063,0.00034121642,0.000004346416],"about_ca_topic_score_codex":0.00657773,"about_ca_topic_score_gemma":0.0050322395,"teacher_disagreement_score":0.00657773,"about_ca_system_score_codex":0.0015138923,"about_ca_system_score_gemma":0.0017539664,"threshold_uncertainty_score":0.025853693},"labels":[],"label_agreement":null},{"id":"W2796214464","doi":"10.1007/978-3-319-89656-4_33","title":"A Sentence-Level Sparse Gamma Topic Model for Sentiment Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Sentence; Artificial intelligence; Natural language processing; Sentiment analysis; Inference; Identification (biology); Product (mathematics); Contrast (vision); Task (project management); Topic model","score_opus":0.06075668038258512,"score_gpt":0.28478767400337285,"score_spread":0.22403099362078774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796214464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01570284,0.0012357354,0.97779113,0.000392859,0.00026412267,0.00012338883,0.0010568983,0.0022427465,0.0011903574],"genre_scores_gemma":[0.4148133,0.0028777134,0.549932,0.0006901623,0.0014106405,0.00095103204,0.011641581,0.00083214696,0.016851364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993961,0.00019485842,0.00004682466,0.00015803821,0.00013022342,0.00007395216],"domain_scores_gemma":[0.9990392,0.0004725571,0.000051570314,0.00010052597,0.0002842826,0.000051892468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015406008,0.0010559679,0.0014041682,0.0013476523,0.0005559357,0.0011004457,0.001656414,0.0011787096,0.004328858],"category_scores_gemma":[0.003220419,0.0005747837,0.0014312746,0.0020541784,0.00031214734,0.0018341831,0.001289652,0.0021350028,0.0038088034],"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.00072097685,0.00040347152,0.0020523262,0.000305575,0.0003910821,0.00018208665,0.000306814,0.13262509,0.021986047,0.013277984,0.029220581,0.798528],"study_design_scores_gemma":[0.000017429513,0.000038314236,0.00037877273,0.000011158248,0.00005318954,0.000030203451,0.000016679516,0.9917074,0.0010005778,0.0048909597,0.001842947,0.000012357936],"about_ca_topic_score_codex":0.007515196,"about_ca_topic_score_gemma":0.010984036,"teacher_disagreement_score":0.007515196,"about_ca_system_score_codex":0.0006454364,"about_ca_system_score_gemma":0.0012042657,"threshold_uncertainty_score":0.014942884},"labels":[],"label_agreement":null},{"id":"W2796253126","doi":"10.1007/978-3-319-89656-4_18","title":"Constrained Bayesian Optimization for Problems with Piece-wise Smooth Constraints","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaussian Processes and Bayesian Inference","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":"Thomson Reuters (Canada)","funders":"","keywords":"Smoothness; Computer science; Mathematical optimization; Constraint (computer-aided design); Bayesian optimization; Gaussian process; Bayesian probability; Gaussian; Optimization problem; Constrained optimization; Process (computing); Algorithm; Artificial intelligence; Mathematics","score_opus":0.013107237312951025,"score_gpt":0.2267050679848338,"score_spread":0.2135978306718828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796253126","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.0008957513,0.0018821558,0.9932147,0.00026271187,0.00008108082,0.000014372548,0.00006381524,0.0000908951,0.00349461],"genre_scores_gemma":[0.103270456,0.0090955645,0.85578716,0.0005785364,0.00081294373,0.0004468162,0.0009842841,0.0008330916,0.02819113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862695,0.0006351567,0.00006286936,0.00024173372,0.0003691318,0.00006411662],"domain_scores_gemma":[0.9963366,0.0029221673,0.00017269955,0.00022763168,0.00024888167,0.00009204224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002656606,0.0020693522,0.0023818337,0.00089534937,0.0005134744,0.0024417243,0.0025554127,0.0032835042,0.006890656],"category_scores_gemma":[0.012954072,0.001837032,0.0015010529,0.002334885,0.0021568441,0.0031315398,0.003104035,0.004448156,0.0016481683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008197309,0.000057689518,0.00020096466,0.0007253215,0.00016355366,0.000095070136,0.00012128432,0.4318361,0.0018314583,0.43784997,0.014312803,0.11272379],"study_design_scores_gemma":[0.000017416918,0.000020334184,0.000118813674,0.000068966096,0.000025750061,0.00003477182,0.000011945338,0.66583264,0.00032039976,0.32569715,0.007824962,0.000026849164],"about_ca_topic_score_codex":0.0037175172,"about_ca_topic_score_gemma":0.003446325,"teacher_disagreement_score":0.006890656,"about_ca_system_score_codex":0.0014037391,"about_ca_system_score_gemma":0.0014021337,"threshold_uncertainty_score":0.02305156},"labels":[],"label_agreement":null},{"id":"W2796264871","doi":"10.1007/978-3-319-89656-4_3","title":"A Novel Evaluation Methodology for Assessing Off-Policy Learning Methods in Contextual Bandits","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Robustness (evolution); Outcome (game theory); Observational study; Machine learning; Artificial intelligence; Evaluation function; Policy learning; Quality (philosophy)","score_opus":0.42374252120565437,"score_gpt":0.5813126106282402,"score_spread":0.15757008942258588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796264871","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.02111815,0.000797162,0.973078,0.00023763244,0.00018220101,0.0003021133,0.00021878346,0.0005396727,0.00352627],"genre_scores_gemma":[0.3333215,0.0005626922,0.660527,0.00023800509,0.00029359703,0.001047666,0.0008802205,0.0004614474,0.0026678958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.970902,0.01982263,0.001394619,0.0020601475,0.005116874,0.0007036873],"domain_scores_gemma":[0.8993618,0.077452816,0.0037277488,0.008456172,0.009306684,0.0016948262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03642529,0.0024181528,0.0027784123,0.0039012895,0.0012608598,0.0043482804,0.0032692805,0.004122772,0.005741042],"category_scores_gemma":[0.12449286,0.00067894644,0.0012751428,0.0030311877,0.002933996,0.0060366313,0.0048396396,0.004399035,0.0008020607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016085566,0.0008110956,0.010355621,0.0009027868,0.00075110927,0.00010689254,0.00035740092,0.4267126,0.0033494518,0.12869832,0.0053544003,0.4209918],"study_design_scores_gemma":[0.000082253566,0.0006683888,0.0011053534,0.00013983426,0.0001044871,0.000059344435,0.00007077257,0.953698,0.0020269142,0.04017356,0.0018304188,0.000040740455],"about_ca_topic_score_codex":0.0021595757,"about_ca_topic_score_gemma":0.002192104,"teacher_disagreement_score":0.03642529,"about_ca_system_score_codex":0.0022519887,"about_ca_system_score_gemma":0.0026789808,"threshold_uncertainty_score":0.19263768},"labels":[],"label_agreement":null},{"id":"W2796265348","doi":"10.1007/978-3-319-89656-4_31","title":"Matching Résumés to Job Descriptions with Stacked Models","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Matching (statistics); Task (project management); Artificial intelligence; Artificial neural network; Data mining; Machine learning; Operations research; Information retrieval; Statistics; Management; Mathematics","score_opus":0.04430563088816648,"score_gpt":0.2630630116354944,"score_spread":0.21875738074732792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796265348","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.02433424,0.00055002695,0.91742545,0.00084724417,0.0009978035,0.00052103575,0.0058883107,0.021255065,0.02818077],"genre_scores_gemma":[0.36633536,0.00095087365,0.52702206,0.000550692,0.00042954122,0.00050889753,0.018580068,0.006657266,0.07896527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769443,0.0004875196,0.00018547637,0.0005269424,0.00078577927,0.0003199031],"domain_scores_gemma":[0.99495584,0.0017390836,0.00023422849,0.001957406,0.00077295146,0.00034040285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028852113,0.0011396958,0.0012065121,0.0020850473,0.0010766581,0.004443582,0.0029313036,0.0016241211,0.03570674],"category_scores_gemma":[0.018001819,0.0011350217,0.0024651415,0.0023229118,0.00084645563,0.005813336,0.0033272963,0.0020801637,0.01686398],"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.0016585744,0.00077691756,0.0049950043,0.00075681525,0.00017503515,0.00065200165,0.0012983807,0.13481666,0.008011451,0.20908141,0.09782947,0.5399483],"study_design_scores_gemma":[0.00006337517,0.00012967864,0.0010642378,0.00016036067,0.00010500995,0.00014153899,0.00054283964,0.60658145,0.01238989,0.2913123,0.08741514,0.00009424403],"about_ca_topic_score_codex":0.0063167913,"about_ca_topic_score_gemma":0.006775576,"teacher_disagreement_score":0.03570674,"about_ca_system_score_codex":0.0015089278,"about_ca_system_score_gemma":0.0021465793,"threshold_uncertainty_score":0.11945093},"labels":[],"label_agreement":null},{"id":"W2796271057","doi":"10.1007/978-3-319-89363-1_13","title":"Iterative Generation of Diverse Models for Testing Specifications of DSL Tools","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Emberi Eroforrások Minisztériuma","keywords":"Computer science; Digital subscriber line; Test suite; Programming language; Iterative refinement; Model-based testing; Domain-specific language; Set (abstract data type); Generator (circuit theory); Suite; Software engineering; Context (archaeology); Graph; Code generation; Theoretical computer science; Test case; Algorithm; Machine learning","score_opus":0.19838911353524138,"score_gpt":0.30393732370412346,"score_spread":0.10554821016888208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796271057","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.023741942,0.00014356124,0.97168523,0.00012619709,0.000015568903,0.00018853301,0.00010451226,0.0012376726,0.0027568266],"genre_scores_gemma":[0.19315723,0.00020970685,0.80322087,0.00008646524,0.000010351668,0.0003487734,0.0007310622,0.0007474581,0.0014881091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993694,0.0020939393,0.00031091648,0.00065670756,0.0030611237,0.00018323564],"domain_scores_gemma":[0.98868513,0.00695321,0.00047169882,0.0027539716,0.0009878636,0.00014801875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038761217,0.0012335412,0.0007012787,0.0021749642,0.0006570222,0.001741815,0.0022794823,0.001393929,0.0019377862],"category_scores_gemma":[0.016112221,0.0010078321,0.0017682466,0.0012857536,0.0014123686,0.002833997,0.0033599841,0.0022819475,0.0007245747],"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.00024614364,0.0003392041,0.004731105,0.00055645383,0.00016665389,0.00088980625,0.0017822111,0.33762887,0.06992618,0.14238474,0.003929819,0.4374189],"study_design_scores_gemma":[0.000045532273,0.00022780124,0.00059605687,0.00012620034,0.0000711357,0.00060981093,0.00024008346,0.85380363,0.055468556,0.0730821,0.01568218,0.000046930247],"about_ca_topic_score_codex":0.0006232736,"about_ca_topic_score_gemma":0.0014822715,"teacher_disagreement_score":0.0038761217,"about_ca_system_score_codex":0.0013945478,"about_ca_system_score_gemma":0.00085093855,"threshold_uncertainty_score":0.02049911},"labels":[],"label_agreement":null},{"id":"W2796390756","doi":"10.1007/978-3-319-89656-4_13","title":"Mobile App for Detection of Counterfeit Banknotes","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Currency Recognition and Detection","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterfeit; Computer science; Banknote; Android (operating system); Mobile phone; Authentication (law); Mobile apps; Embedded system; Artificial intelligence; Computer security; Telecommunications; Operating system; World Wide Web","score_opus":0.019704809844711624,"score_gpt":0.25781256671194164,"score_spread":0.23810775686723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796390756","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.6450633,0.018204233,0.13925904,0.0017585361,0.002927866,0.0013779997,0.021735322,0.06619573,0.103478014],"genre_scores_gemma":[0.81126803,0.0032301997,0.0639247,0.0013264744,0.00087675516,0.00046493832,0.006222212,0.0004470569,0.11223965],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997782,0.00002681697,0.0000117418085,0.00005035577,0.000095639334,0.000037223548],"domain_scores_gemma":[0.999532,0.000170735,0.00006357999,0.00003551055,0.00014940892,0.000048762744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021582117,0.00082833244,0.00056426256,0.0011851669,0.00023980251,0.00065046956,0.00059823587,0.0009203241,0.019302553],"category_scores_gemma":[0.00080268143,0.00022557759,0.00023734588,0.00033054105,0.000083493884,0.0006662221,0.0005969879,0.0003855636,0.01406214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002647179,0.0005992368,0.023441376,0.0009497861,0.0001236956,0.002188308,0.00040301477,0.00032374886,0.08339823,0.0013530625,0.13491625,0.74965614],"study_design_scores_gemma":[0.00042291873,0.0048408518,0.2043272,0.0015344433,0.0010755279,0.02965787,0.0019043145,0.10721838,0.30352905,0.0050742286,0.3399718,0.00044344965],"about_ca_topic_score_codex":0.00033125747,"about_ca_topic_score_gemma":0.0007452292,"teacher_disagreement_score":0.019302553,"about_ca_system_score_codex":0.0000795784,"about_ca_system_score_gemma":0.00012091616,"threshold_uncertainty_score":0.06457347},"labels":[],"label_agreement":null},{"id":"W2798436609","doi":"10.1007/978-3-030-00461-3_26","title":"Measuring and Computing Database Inconsistency via Repairs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Carleton University","funders":"","keywords":"Measure (data warehouse); Cardinality (data modeling); Data integrity; Database; Computer science; Set (abstract data type); Semantics (computer science); Database administrator; Database testing; Data mining; Database schema; Database design; Programming language","score_opus":0.032554588805135266,"score_gpt":0.26141273087544403,"score_spread":0.22885814207030877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798436609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31174305,0.002709633,0.67787564,0.0012460651,0.00019234506,0.000265256,0.0011371517,0.003056749,0.0017741624],"genre_scores_gemma":[0.77913517,0.00042202228,0.21864755,0.000105048945,0.000095844014,0.00009466635,0.00084846915,0.00019107742,0.00046015746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9609807,0.011485088,0.004336575,0.007315194,0.014302636,0.0015798272],"domain_scores_gemma":[0.80149144,0.12092837,0.02116708,0.037454017,0.016723258,0.002235848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017297355,0.001812123,0.0036507898,0.008638986,0.0014084311,0.005488267,0.0054464717,0.0033839697,0.0014269882],"category_scores_gemma":[0.16735055,0.0016039403,0.0020130742,0.007017684,0.0032236425,0.015633196,0.0045905528,0.0035122843,0.00039012512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026489457,0.0007931467,0.10808123,0.0014647874,0.0013640552,0.000546743,0.001738304,0.41223034,0.011575532,0.05064624,0.0040826,0.40482807],"study_design_scores_gemma":[0.000084623905,0.000377577,0.008491895,0.00012244997,0.00044767407,0.0004520022,0.0006344539,0.8792248,0.010441026,0.098157115,0.0014615712,0.00010481705],"about_ca_topic_score_codex":0.00570561,"about_ca_topic_score_gemma":0.004848434,"teacher_disagreement_score":0.017297355,"about_ca_system_score_codex":0.0021781973,"about_ca_system_score_gemma":0.0029904963,"threshold_uncertainty_score":0.09147829},"labels":[],"label_agreement":null},{"id":"W2798644134","doi":"10.1007/978-3-030-04612-5_23","title":"Robust and Approximately Stable Marriages Under Partial Information","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complement (music); Matching (statistics); Order (exchange); Perspective (graphical); Preference; Quality (philosophy); Computer science; Stable marriage problem; Blocking (statistics); Complete information; Measure (data warehouse); Focus (optics); Stability (learning theory); Mathematical optimization; Mathematics; Mathematical economics; Economics; Artificial intelligence; Data mining; Statistics; Machine learning","score_opus":0.04521455231708309,"score_gpt":0.23090879521485752,"score_spread":0.18569424289777442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798644134","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.5507469,0.0007372749,0.42046842,0.0038213842,0.00012291418,0.00022353468,0.0023511385,0.0007254293,0.020803062],"genre_scores_gemma":[0.9780301,0.00022903566,0.013564169,0.00026614274,0.0001080637,0.00012821396,0.0005920798,0.000103050814,0.006979131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645233,0.0013235342,0.00019977461,0.00087761576,0.0005122565,0.0006344896],"domain_scores_gemma":[0.9552282,0.028541772,0.0066217976,0.005581739,0.0020516522,0.0019748316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055511515,0.0007417773,0.0034600513,0.0016845898,0.0020128072,0.004561396,0.0032147404,0.003692381,0.0111806765],"category_scores_gemma":[0.05496481,0.0013641457,0.001433683,0.002106492,0.0035306718,0.0063670357,0.0034202796,0.0031915335,0.0014514917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054891565,0.00010981381,0.0035535542,0.00011613592,0.00014276682,0.0002469044,0.00051853084,0.061341517,0.0013362429,0.91072905,0.0036225673,0.017734071],"study_design_scores_gemma":[0.00006499394,0.000039991424,0.00071014144,0.000016169097,0.000019371204,0.00006394379,0.000106498366,0.14683045,0.00023497565,0.8514217,0.00046732088,0.000024405897],"about_ca_topic_score_codex":0.0026840908,"about_ca_topic_score_gemma":0.0022778767,"teacher_disagreement_score":0.0111806765,"about_ca_system_score_codex":0.00196636,"about_ca_system_score_gemma":0.0017624836,"threshold_uncertainty_score":0.037403047},"labels":[],"label_agreement":null},{"id":"W2798939578","doi":"10.1007/978-3-319-98654-8_19","title":"Counting Subwords and Regular Languages","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arithmetic; Combinatorics; Word (group theory); Discrete mathematics; Mathematics; Geometry","score_opus":0.008474628084336331,"score_gpt":0.2309994693236953,"score_spread":0.22252484123935898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798939578","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.07946848,0.014566574,0.40211225,0.0040301797,0.0025617846,0.00017435639,0.00055938907,0.0021334812,0.4943935],"genre_scores_gemma":[0.49389377,0.010490002,0.15492278,0.0015108678,0.0032115632,0.0005928027,0.0016619277,0.0017457295,0.3319706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893886,0.00023957169,0.000092226146,0.00024151216,0.00038103203,0.000106858795],"domain_scores_gemma":[0.99817514,0.0010556673,0.00013328502,0.00023792346,0.00029019156,0.00010773737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072314165,0.0011978779,0.0012573381,0.002847435,0.0013515314,0.0035329103,0.0015447175,0.0011495699,0.011967952],"category_scores_gemma":[0.004440194,0.0007363296,0.00086099,0.0035746086,0.0021897138,0.0074694087,0.0018524058,0.0023695505,0.0043976232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022134449,0.000022224027,0.00010827548,0.000117949065,0.0000076249166,0.000045562403,0.00016975467,0.0005453493,0.0008318281,0.94251883,0.00797604,0.047634423],"study_design_scores_gemma":[0.000003659251,0.0000061947835,0.000059261893,0.000028425136,0.00000837079,0.00009182619,0.000033227123,0.0015373183,0.0005387157,0.98148847,0.016195346,0.00000917087],"about_ca_topic_score_codex":0.00055506366,"about_ca_topic_score_gemma":0.0006212969,"teacher_disagreement_score":0.011967952,"about_ca_system_score_codex":0.0015616808,"about_ca_system_score_gemma":0.0008182435,"threshold_uncertainty_score":0.040036798},"labels":[],"label_agreement":null},{"id":"W2799107345","doi":"10.1007/978-3-030-01261-8_12","title":"Domain Adaptation Through Synthesis for Unsupervised Person Re-identification","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":245,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Identification (biology); Artificial intelligence; Domain adaptation; Adaptation (eye); Domain (mathematical analysis); Scale (ratio); Training set; Pattern recognition (psychology); Machine learning; Computer vision; Mathematics","score_opus":0.06365457729492724,"score_gpt":0.2993547881583341,"score_spread":0.23570021086340687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799107345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046374956,0.0001925894,0.9926152,0.00003231902,0.00006564471,0.000022662136,0.00008324711,0.0011434059,0.0012074157],"genre_scores_gemma":[0.2054443,0.0006141189,0.7774212,0.00019410142,0.00011437521,0.00013094537,0.0012505391,0.0006279401,0.014202388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.000099403114,0.000017222123,0.0001984661,0.000109539025,0.000058956666],"domain_scores_gemma":[0.9995455,0.00014087422,0.000025040184,0.00016713042,0.00010175376,0.000019676077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005892054,0.0007156494,0.0009280426,0.0006283431,0.00028000213,0.0005821552,0.00086483976,0.00084419333,0.0041216854],"category_scores_gemma":[0.001244054,0.0004156796,0.0008957918,0.0007576452,0.0003976592,0.00082664157,0.0013372214,0.00113338,0.004474168],"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.00031145674,0.00012012457,0.0006198016,0.00012826094,0.00010286535,0.00011958462,0.00010917895,0.07482547,0.08283928,0.0057597226,0.0060839956,0.82898027],"study_design_scores_gemma":[0.000015897042,0.00007118745,0.00082538696,0.000018701856,0.000042042477,0.00025331147,0.000056767494,0.9412118,0.04075976,0.008126242,0.00859422,0.000024583056],"about_ca_topic_score_codex":0.0013448418,"about_ca_topic_score_gemma":0.002197801,"teacher_disagreement_score":0.0041216854,"about_ca_system_score_codex":0.00023459435,"about_ca_system_score_gemma":0.00036124533,"threshold_uncertainty_score":0.013788402},"labels":[],"label_agreement":null},{"id":"W2799139004","doi":"10.1007/978-3-319-78825-8_25","title":"Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Université de Montréal","funders":"","keywords":"Parameterized complexity; Combinatorics; Permutation (music); Reduction (mathematics); Solver; Heuristic; Mathematics; Space (punctuation); Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Algorithm; Mathematical optimization; Physics; Geometry","score_opus":0.025836725626301536,"score_gpt":0.29114069841174955,"score_spread":0.26530397278544804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799139004","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.04048429,0.0007906167,0.9293306,0.0010859063,0.00031254216,0.00024196038,0.00064455305,0.002233836,0.024875795],"genre_scores_gemma":[0.14456458,0.00038931728,0.84178364,0.00026177365,0.00021715606,0.00032353043,0.0011303517,0.0005705618,0.010759071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999032,0.00028312634,0.000042243213,0.00017435974,0.00025968824,0.00020842768],"domain_scores_gemma":[0.9989114,0.00064301194,0.00005312574,0.00021868262,0.0001023631,0.00007141906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090215565,0.0012830959,0.0017370841,0.0011717147,0.0010826132,0.0021301524,0.002310893,0.0017032577,0.013616897],"category_scores_gemma":[0.0030476917,0.0006786237,0.0018688489,0.00248331,0.00096046727,0.0027267118,0.0018699764,0.0037171727,0.0018390706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006846793,0.00075484434,0.00075217476,0.0004706702,0.000115151226,0.00018816476,0.0001852555,0.4147247,0.006431207,0.11019286,0.038668636,0.42683157],"study_design_scores_gemma":[0.0001698967,0.00011532416,0.00029797503,0.00002636977,0.000046044555,0.000100744684,0.000077666446,0.885569,0.0026449298,0.10380132,0.007128223,0.000022498567],"about_ca_topic_score_codex":0.0046737636,"about_ca_topic_score_gemma":0.0073203873,"teacher_disagreement_score":0.013616897,"about_ca_system_score_codex":0.001565484,"about_ca_system_score_gemma":0.003325968,"threshold_uncertainty_score":0.04555303},"labels":[],"label_agreement":null},{"id":"W2799267740","doi":"10.1007/978-3-319-78825-8_18","title":"Improved Lower Bound on Broadcast Function Based on Graph Partition","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Computer science; Graph; Discrete mathematics; Broadcasting (networking); Connectivity; Mathematics; Computer network","score_opus":0.01533656119422659,"score_gpt":0.22503501019749628,"score_spread":0.2096984490032697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799267740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06420839,0.010847664,0.82891107,0.004126194,0.0015194063,0.00046587124,0.0019540344,0.004009223,0.08395816],"genre_scores_gemma":[0.6602939,0.0071175466,0.26869297,0.0021049134,0.002207482,0.0013830377,0.0042807404,0.0021901196,0.05172929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654585,0.0008017193,0.00009534967,0.00058439124,0.0010700661,0.0009026644],"domain_scores_gemma":[0.99188036,0.005477239,0.00022910602,0.0012114105,0.0008108235,0.00039103968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025497675,0.0029544807,0.0041294536,0.0035041096,0.0022824686,0.0050036777,0.0063644364,0.0028685713,0.021477051],"category_scores_gemma":[0.011001159,0.0009944342,0.0024274003,0.004743486,0.0024987105,0.009203402,0.0046262583,0.0055908156,0.0039581135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029009986,0.0008641678,0.001729959,0.0023267004,0.00033381899,0.00038340504,0.0007580934,0.23730625,0.019575017,0.4147223,0.09493176,0.22416756],"study_design_scores_gemma":[0.00019725735,0.00027394897,0.0010073868,0.0002071512,0.00034836808,0.0003543042,0.00018884314,0.7522517,0.0060983244,0.22596918,0.013019652,0.00008396079],"about_ca_topic_score_codex":0.004198692,"about_ca_topic_score_gemma":0.0048184725,"teacher_disagreement_score":0.021477051,"about_ca_system_score_codex":0.0060318783,"about_ca_system_score_gemma":0.0042316276,"threshold_uncertainty_score":0.071847856},"labels":[],"label_agreement":null},{"id":"W2799364841","doi":"10.1007/978-3-030-01325-7_14","title":"Symmetric Rendezvous with Advice: How to Rendezvous in a Disk","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Rendezvous; Conjecture; Computer science; Energy (signal processing); Simple (philosophy); Point (geometry); Algorithm; Upper and lower bounds; Advice (programming); Line (geometry); Robot; Mathematics; Combinatorics; Geometry; Physics; Artificial intelligence; Mathematical analysis; Statistics","score_opus":0.01755097974014902,"score_gpt":0.27191666665615516,"score_spread":0.25436568691600614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799364841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0988087,0.0012802272,0.82269984,0.0028427185,0.001069906,0.0003572714,0.0009668626,0.028767148,0.04320721],"genre_scores_gemma":[0.5183853,0.00044787265,0.44303596,0.00050895003,0.00013614079,0.00018892536,0.00088904996,0.005123363,0.031284474],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983714,0.00029063973,0.00011755995,0.0004013401,0.00049384043,0.00032528758],"domain_scores_gemma":[0.9960234,0.0010723163,0.00010399522,0.001984932,0.0005787524,0.00023661472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011737305,0.0010845658,0.0015508462,0.00051758956,0.0018705308,0.002334443,0.0030462733,0.0022813168,0.02288846],"category_scores_gemma":[0.01005628,0.00082584127,0.00083983,0.0007366394,0.0017452668,0.005521158,0.0049075824,0.0023685272,0.0071278443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031735918,0.00042111013,0.004018658,0.00089760055,0.00016225367,0.0010711919,0.0027420775,0.040204212,0.040116265,0.179733,0.096983545,0.6304764],"study_design_scores_gemma":[0.00053156714,0.0002611331,0.00095708465,0.00023813319,0.00018455143,0.000789637,0.0016848763,0.47058174,0.047723617,0.3866037,0.09027285,0.0001711085],"about_ca_topic_score_codex":0.0057926266,"about_ca_topic_score_gemma":0.008811292,"teacher_disagreement_score":0.02288846,"about_ca_system_score_codex":0.00070582924,"about_ca_system_score_gemma":0.0014150841,"threshold_uncertainty_score":0.0765695},"labels":[],"label_agreement":null},{"id":"W2800300897","doi":"10.1007/978-3-319-91452-7_48","title":"Multi-query Optimization in Federated RDF Systems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; RDF; RDF query language; Rewriting; Query optimization; Heuristic; Computation; SPARQL; Filter (signal processing); Information retrieval; Theoretical computer science; Data mining; Web search query; Web query classification; Algorithm; Semantic Web; Artificial intelligence; Programming language; Search engine","score_opus":0.026702960668022042,"score_gpt":0.2534301210933975,"score_spread":0.22672716042537547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800300897","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.026908811,0.0013105274,0.9615904,0.0007595406,0.00009107166,0.00016724193,0.00033761465,0.0030904638,0.0057442836],"genre_scores_gemma":[0.44766477,0.0007101478,0.5409194,0.0002879805,0.00012033183,0.00026056552,0.0013897337,0.0010872708,0.007559877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99028194,0.0038642546,0.000768571,0.0010946402,0.00305681,0.0009337799],"domain_scores_gemma":[0.99363744,0.003722148,0.000231842,0.0015664059,0.0006967446,0.00014554034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007464429,0.0009691249,0.0020729296,0.0016101612,0.0013850814,0.0047210413,0.003150978,0.0016061501,0.004087113],"category_scores_gemma":[0.0126225,0.0008984139,0.0017842132,0.0030326264,0.0014794603,0.00670014,0.003959909,0.002334362,0.0008440708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006788212,0.00037693826,0.0012456045,0.00054523704,0.00027666838,0.0003288316,0.000390188,0.45934612,0.0061629205,0.24425566,0.011468504,0.27492452],"study_design_scores_gemma":[0.000040492618,0.00003668394,0.00014839749,0.000031669675,0.000057476693,0.00010702592,0.00011965082,0.8395846,0.0058410554,0.14961675,0.0043898188,0.000026274121],"about_ca_topic_score_codex":0.0054091956,"about_ca_topic_score_gemma":0.005972387,"teacher_disagreement_score":0.007464429,"about_ca_system_score_codex":0.0028965604,"about_ca_system_score_gemma":0.002176373,"threshold_uncertainty_score":0.039476097},"labels":[],"label_agreement":null},{"id":"W2800669324","doi":"10.1007/978-3-319-90421-4_5","title":"Top-Down Evaluation of Reusable Goal Models","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reuse; Computer science; Hierarchy; Adaptation (eye); Goal modeling; Rotation formalisms in three dimensions; Set (abstract data type); Prioritization; Top-down and bottom-up design; Software engineering; Programming language; Software; Management science; Requirements engineering","score_opus":0.0703158987650984,"score_gpt":0.31672761425923696,"score_spread":0.24641171549413854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800669324","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.14337675,0.0008476169,0.8231836,0.00063812744,0.00017928115,0.0006312933,0.0006939867,0.011188752,0.019260576],"genre_scores_gemma":[0.5764729,0.0004515174,0.4085991,0.00022724483,0.000052648167,0.00024680464,0.0024445225,0.0019827841,0.009522497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908897,0.0033237825,0.00036297532,0.00060660683,0.0041151466,0.0007016505],"domain_scores_gemma":[0.98332906,0.009339709,0.0006236126,0.0031989876,0.0031798235,0.00032873452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044904584,0.0014401247,0.0010124708,0.0014601571,0.0006743717,0.002728934,0.0021106717,0.0010260092,0.009769164],"category_scores_gemma":[0.02512452,0.00067054987,0.0015919335,0.001049684,0.0009391284,0.003410793,0.003176007,0.0017319047,0.0014964532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020097182,0.00090834143,0.0034371684,0.0015412086,0.0003655514,0.00050527224,0.0005763191,0.16375417,0.04908344,0.055466857,0.013752143,0.7085998],"study_design_scores_gemma":[0.00011328344,0.00035864243,0.00084715494,0.00016809338,0.00021960882,0.000101792706,0.0002098564,0.91002995,0.042046558,0.040542804,0.005326524,0.000035601748],"about_ca_topic_score_codex":0.00486262,"about_ca_topic_score_gemma":0.008551968,"teacher_disagreement_score":0.009769164,"about_ca_system_score_codex":0.0017510852,"about_ca_system_score_gemma":0.0030497538,"threshold_uncertainty_score":0.032681108},"labels":[],"label_agreement":null},{"id":"W2800842922","doi":"10.1007/978-3-319-91641-5_25","title":"Robust Design with Surrogate-Assisted Evolutionary Algorithm: Does It Work?","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization 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":"McGill University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais","keywords":"Robustness (evolution); Computer science; Surrogate model; Evolutionary algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.028826136284710386,"score_gpt":0.24283001707534085,"score_spread":0.21400388079063046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800842922","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.0021381024,0.0018684037,0.989475,0.00062460057,0.00023104348,0.000014248647,0.000016106093,0.00023823646,0.00539421],"genre_scores_gemma":[0.18868051,0.004453441,0.7913908,0.0008824279,0.00043773465,0.00014614404,0.00018005345,0.00047021112,0.013358591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988726,0.00054247316,0.000054284963,0.00012632976,0.0003590617,0.00004529316],"domain_scores_gemma":[0.9986386,0.0006787341,0.000094713614,0.00023803598,0.00029771755,0.00005221282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025470948,0.00093947246,0.0022501638,0.00042300037,0.0002698373,0.0018105892,0.0014140307,0.0026334366,0.006291028],"category_scores_gemma":[0.007546166,0.0005886262,0.0011037393,0.0008256815,0.0008080459,0.0026103747,0.0011867778,0.0022955276,0.002552263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029166162,0.00015314292,0.0005822378,0.0006851284,0.00029740293,0.00012414528,0.000079351885,0.4776912,0.0051747416,0.09571301,0.00970048,0.40950754],"study_design_scores_gemma":[0.000029874944,0.00013659635,0.000099975965,0.000095280346,0.00003241936,0.0001168347,0.000015930053,0.9562811,0.00107427,0.03340222,0.008694964,0.000020567222],"about_ca_topic_score_codex":0.00031989912,"about_ca_topic_score_gemma":0.00029249754,"teacher_disagreement_score":0.006291028,"about_ca_system_score_codex":0.0002496035,"about_ca_system_score_gemma":0.00051028,"threshold_uncertainty_score":0.021045625},"labels":[],"label_agreement":null},{"id":"W2801120821","doi":"10.1007/978-3-319-91262-2_13","title":"An Application of Graphic Tools and Analytic Hierarchy Process to the Description of Biometric Features","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Analytic hierarchy process; Consistency (knowledge bases); Biometrics; Process (computing); Particle swarm optimization; Context (archaeology); Basis (linear algebra); Pairwise comparison; Interface (matter); Artificial intelligence; Graphical user interface; Data mining; Hierarchy; Transformation (genetics); Machine learning; Operations research; Mathematics; Programming language","score_opus":0.0232410764384563,"score_gpt":0.2711687848015181,"score_spread":0.24792770836306183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801120821","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.0007823856,0.0003905183,0.99575114,0.00012497879,0.000037970596,0.00006405844,0.0001360633,0.0009233696,0.0017895207],"genre_scores_gemma":[0.011131259,0.0004330025,0.9867409,0.000050643743,0.000035539742,0.00014897194,0.0002048712,0.00014390987,0.001110831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980451,0.00075793196,0.00019631325,0.0002050028,0.0007199436,0.00007575756],"domain_scores_gemma":[0.996696,0.002374041,0.00016243395,0.00032440707,0.0003912749,0.000051849616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026506444,0.0011798469,0.001278201,0.004288375,0.00087358867,0.0036017527,0.0019449948,0.0010734214,0.009389875],"category_scores_gemma":[0.009991123,0.00073379447,0.0018535524,0.0055038556,0.00206225,0.0026452937,0.0017616409,0.0018960066,0.0021892658],"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.00011482633,0.000097987046,0.0008794017,0.00094401743,0.000121852914,0.00044064157,0.001169696,0.032527816,0.005163427,0.40814725,0.014582007,0.53581125],"study_design_scores_gemma":[0.00004247438,0.0000901912,0.0010360506,0.00022737838,0.00009245434,0.00047445818,0.0003379715,0.38142526,0.0036621774,0.5522035,0.060315132,0.00009289139],"about_ca_topic_score_codex":0.0067467852,"about_ca_topic_score_gemma":0.0045094136,"teacher_disagreement_score":0.009389875,"about_ca_system_score_codex":0.0012600842,"about_ca_system_score_gemma":0.0017761751,"threshold_uncertainty_score":0.031412244},"labels":[],"label_agreement":null},{"id":"W2801227655","doi":"10.1007/978-3-319-98809-2_3","title":"Sequence-Based Approaches to Course Recommender Systems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Recommender system; Dependency (UML); Sequence (biology); Dependency graph; Course (navigation); Scope (computer science); Graph; Graduation (instrument); Flexibility (engineering); Process (computing); Artificial intelligence; Machine learning; Theoretical computer science; Programming language","score_opus":0.12261191105331354,"score_gpt":0.2559226362004747,"score_spread":0.13331072514716114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801227655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004919794,0.0016894529,0.989253,0.0003606447,0.00011756253,0.00007080389,0.00015331245,0.00024938854,0.0031861681],"genre_scores_gemma":[0.30943048,0.0037135107,0.6632081,0.00034779104,0.00059613516,0.00031556713,0.0010217255,0.00017341493,0.02119328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969381,0.0015743161,0.00018274938,0.00045458955,0.00072209607,0.00012813113],"domain_scores_gemma":[0.99195766,0.005523361,0.0002460026,0.00085328746,0.0012020235,0.00021775633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032740126,0.00090185826,0.001375312,0.0027231846,0.00089453894,0.0020741965,0.003310336,0.0017986072,0.0075749396],"category_scores_gemma":[0.011873037,0.0008711063,0.0013524849,0.004114702,0.0009580175,0.0038777813,0.0017535716,0.0021342013,0.0016634649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000221186,0.0004172397,0.0020210105,0.00037146412,0.00027703968,0.00012817292,0.00032718864,0.37698013,0.0017729007,0.29379413,0.00986811,0.31382138],"study_design_scores_gemma":[0.000015129562,0.000048986603,0.0002049406,0.000021255313,0.00002672793,0.000036299334,0.000026536098,0.8917132,0.0003048732,0.10333049,0.0042548226,0.000016683614],"about_ca_topic_score_codex":0.013290636,"about_ca_topic_score_gemma":0.015669562,"teacher_disagreement_score":0.013290636,"about_ca_system_score_codex":0.0016357462,"about_ca_system_score_gemma":0.0011734812,"threshold_uncertainty_score":0.026426554},"labels":[],"label_agreement":null},{"id":"W2801518913","doi":"10.1007/978-3-319-91641-5_6","title":"Collaborative Agent Teams (CAT): From the Paradigm to Implementation Guidelines","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Université Laval","funders":"","keywords":"Computer science; Key (lock); Representation (politics); Solver; Problem solver; Architecture; Multi-agent system; Software engineering; Distributed computing; Theoretical computer science; Artificial intelligence; Programming language; Computer security","score_opus":0.027408213938519277,"score_gpt":0.3262787265091211,"score_spread":0.2988705125706018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801518913","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.0015636812,0.010826835,0.89241934,0.007799092,0.0011214712,0.00019534004,0.00013933695,0.0009651059,0.084969796],"genre_scores_gemma":[0.09811477,0.014335224,0.84620273,0.0019098507,0.0009864907,0.00095392007,0.00034264522,0.00061373523,0.03654058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996852,0.0014590956,0.00028568742,0.0003776548,0.000888533,0.00013702936],"domain_scores_gemma":[0.9973959,0.001260191,0.00012437152,0.00052104035,0.00048261802,0.0002159719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036001203,0.00092069036,0.00055895123,0.0009526627,0.0010803137,0.0063884053,0.0030467645,0.0037222481,0.007977425],"category_scores_gemma":[0.0062474017,0.0007718932,0.00069387746,0.0019190895,0.0034030408,0.006533187,0.0039920774,0.0041184453,0.0042019067],"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.000013777022,0.000032483276,0.00009581142,0.00029367823,0.000010811831,0.00007200863,0.00041310204,0.0040869303,0.00032041827,0.8869818,0.02140252,0.086276636],"study_design_scores_gemma":[0.000021185768,0.000047925798,0.00007408133,0.00048917305,0.000014314079,0.00034741807,0.00026477728,0.020668168,0.0009122667,0.6668997,0.31023353,0.00002747762],"about_ca_topic_score_codex":0.0016872525,"about_ca_topic_score_gemma":0.0017716924,"teacher_disagreement_score":0.007977425,"about_ca_system_score_codex":0.0014714566,"about_ca_system_score_gemma":0.0023506593,"threshold_uncertainty_score":0.026687145},"labels":[],"label_agreement":null},{"id":"W2802031355","doi":"10.1007/978-3-319-91271-4_18","title":"Modeling the Hybrid ERTMS/ETCS Level 3 Standard Using a Formal Requirements Engineering Approach","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":22,"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; Agence Nationale de la Recherche","keywords":"Computer science; Formal specification; Programming language; Formal methods; Formal verification; Software engineering; Systems Modeling Language; Domain (mathematical analysis); Automated theorem proving; Unified Modeling Language","score_opus":0.04325637717332654,"score_gpt":0.23395212473489077,"score_spread":0.19069574756156424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802031355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030988926,0.00024297032,0.9150819,0.00071416696,0.00014601406,0.00041968256,0.0012276565,0.006441549,0.04473714],"genre_scores_gemma":[0.2670992,0.00056215137,0.68811893,0.00059001544,0.00006959792,0.00070621184,0.005625799,0.002807396,0.03442066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955651,0.0008811078,0.00054138486,0.00040640534,0.0021745854,0.00043131155],"domain_scores_gemma":[0.996609,0.0008616877,0.00034820745,0.00111249,0.0009797501,0.00008892996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003821827,0.00060951145,0.00041940177,0.0013218963,0.00048079237,0.0041621807,0.0022611872,0.0013116796,0.006190566],"category_scores_gemma":[0.0059748245,0.000679285,0.001247896,0.0007339193,0.00096903933,0.0036404412,0.0020541395,0.0018972316,0.0037600244],"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.00023121166,0.00019813044,0.0027124062,0.0005189817,0.00008385194,0.00093519664,0.001055562,0.11214774,0.038410008,0.68356055,0.016714651,0.14343165],"study_design_scores_gemma":[0.000079795296,0.00023186447,0.0014622527,0.00050615805,0.00014887967,0.0007155745,0.00054458674,0.40598735,0.056947075,0.15061931,0.3826123,0.00014493224],"about_ca_topic_score_codex":0.006240715,"about_ca_topic_score_gemma":0.006217776,"teacher_disagreement_score":0.006240715,"about_ca_system_score_codex":0.0015675006,"about_ca_system_score_gemma":0.0029417914,"threshold_uncertainty_score":0.020709515},"labels":[],"label_agreement":null},{"id":"W2802389629","doi":"10.1007/978-3-319-90053-7_9","title":"Using the Internet of Things to Monitor Human and Animal Uses of Industrial Linear Features","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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 Calgary","funders":"","keywords":"Computer science; Open source hardware; Wildlife; Interoperability; Internet of Things; The Internet; Open source; Computer security; World Wide Web; Operating system; Ecology","score_opus":0.07316514079629334,"score_gpt":0.3373029184132535,"score_spread":0.26413777761696017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802389629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34762615,0.007007722,0.4898094,0.00084122457,0.0008919138,0.00024216087,0.0051912093,0.0051763016,0.14321385],"genre_scores_gemma":[0.76022786,0.004238445,0.19642363,0.0005020495,0.00023007562,0.00014407077,0.0029993884,0.00029594038,0.034938615],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988043,0.000011629577,0.000004600839,0.000034630353,0.00005775164,0.000010872404],"domain_scores_gemma":[0.99986386,0.000047274556,0.00002149033,0.00002060822,0.000036404286,0.000010415142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011394742,0.0004345837,0.00021245869,0.0010803584,0.00023124415,0.000492744,0.00042066904,0.0004800272,0.002140011],"category_scores_gemma":[0.00032608493,0.00016724704,0.000298148,0.001162447,0.00014974526,0.0008423011,0.00036787527,0.0002640973,0.0010042024],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019363737,0.000106763684,0.03201239,0.0004912816,0.0001559777,0.0004430982,0.00041413485,0.0050018146,0.07725951,0.003711638,0.014185707,0.8660241],"study_design_scores_gemma":[0.000047238173,0.00093871116,0.24418023,0.0005493787,0.0006663979,0.006739466,0.0021606577,0.24547945,0.22177584,0.03194851,0.24522066,0.00029362433],"about_ca_topic_score_codex":0.00089708896,"about_ca_topic_score_gemma":0.0033264773,"teacher_disagreement_score":0.002140011,"about_ca_system_score_codex":0.00012250789,"about_ca_system_score_gemma":0.00008757262,"threshold_uncertainty_score":0.0071590543},"labels":[],"label_agreement":null},{"id":"W2802395783","doi":"10.1007/978-3-319-91271-4_5","title":"Event-B Expression and Verification of Translation Rules Between SysML/KAOS Domain Models and B System Specifications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Completeness (order theory); Programming language; Ontology; Semantics (computer science); Systems Modeling Language; Translation (biology); Formal specification; Consistency (knowledge bases); Software engineering; Natural language processing; Unified Modeling Language; Artificial intelligence; Mathematics","score_opus":0.03321193903046746,"score_gpt":0.24340370446992768,"score_spread":0.21019176543946022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802395783","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.0283196,0.000042144617,0.9571088,0.00024487567,0.000091575545,0.0003478457,0.00048722752,0.006646265,0.0067116064],"genre_scores_gemma":[0.4715924,0.0001273541,0.514835,0.00034356237,0.00003683228,0.0004387898,0.0020579959,0.0021980978,0.008369999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950039,0.0016391303,0.0004442255,0.0008144391,0.0015330625,0.00056524435],"domain_scores_gemma":[0.9906865,0.006107989,0.0006284451,0.001044585,0.0014038276,0.00012874833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036418962,0.0008168206,0.0007100425,0.0010309662,0.0010143404,0.0031928353,0.0018504056,0.0018394521,0.008245833],"category_scores_gemma":[0.013972262,0.0010422475,0.0020098505,0.0006638169,0.0020390674,0.0021244606,0.002101554,0.002070602,0.0036021636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018531882,0.0010497795,0.005799495,0.0011939083,0.00023200868,0.0033210295,0.0026411545,0.18722004,0.12343876,0.46001273,0.016103527,0.19713442],"study_design_scores_gemma":[0.0003375973,0.00019212504,0.0008194416,0.00019931277,0.000107608466,0.0003853773,0.0003968751,0.725539,0.16748358,0.09023105,0.014210643,0.00009739247],"about_ca_topic_score_codex":0.0081284875,"about_ca_topic_score_gemma":0.004177427,"teacher_disagreement_score":0.008245833,"about_ca_system_score_codex":0.0012458444,"about_ca_system_score_gemma":0.0027397638,"threshold_uncertainty_score":0.02758503},"labels":[],"label_agreement":null},{"id":"W2802556595","doi":"10.1007/978-3-319-96812-4_7","title":"Biform Theories: Project Description","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Axiom; Axiomatic system; Computation; Ideal (ethics); Mathematical theory; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Epistemology","score_opus":0.030153699701402862,"score_gpt":0.25637026867679863,"score_spread":0.22621656897539577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802556595","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.0047004134,0.0023458188,0.6598954,0.0043124617,0.0010931186,0.000533383,0.0068360027,0.0063466295,0.31393677],"genre_scores_gemma":[0.12595062,0.0064093424,0.57838386,0.0015996889,0.001033906,0.0021670784,0.02654741,0.00878826,0.24911983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768627,0.0007164566,0.00015876825,0.00030063879,0.00090976764,0.00022808008],"domain_scores_gemma":[0.9985071,0.0003546578,0.000054424418,0.00043420095,0.00048018733,0.0001694458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00440802,0.0012282238,0.00060340913,0.0023453226,0.0019982127,0.0045108353,0.0026182537,0.0015871057,0.08742755],"category_scores_gemma":[0.0048130015,0.00073633104,0.001140116,0.0037116637,0.0015702216,0.008614098,0.0048112706,0.0031023487,0.031179713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031740467,0.000043666165,0.00011468846,0.00019868994,0.0000068818317,0.000025006115,0.0001962993,0.00043734055,0.00041164094,0.8687601,0.054750327,0.07502359],"study_design_scores_gemma":[0.00003179973,0.000029461315,0.000113194576,0.00020177825,0.000014323969,0.00019144524,0.00016792388,0.0032313473,0.0018708794,0.5786064,0.41551536,0.000026148016],"about_ca_topic_score_codex":0.0016086302,"about_ca_topic_score_gemma":0.0011835165,"teacher_disagreement_score":0.08742755,"about_ca_system_score_codex":0.0018290152,"about_ca_system_score_gemma":0.0028888653,"threshold_uncertainty_score":0.29247433},"labels":[],"label_agreement":null},{"id":"W2803191730","doi":"10.1007/978-3-319-91464-0_42","title":"Classifying Interaction Behaviors of Students and Conversational Agents Through Dialog Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Athabasca University","funders":"","keywords":"Dialog box; Dialog system; Computer science; Human–computer interaction; Interface (matter); Intelligent tutoring system; Intelligent agent; Artificial intelligence; World Wide Web","score_opus":0.04993259469615713,"score_gpt":0.3209915458463038,"score_spread":0.27105895115014667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803191730","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.9776578,0.00038579735,0.01763183,0.000058462057,0.000020897918,0.0001160851,0.00079009903,0.000413549,0.0029255447],"genre_scores_gemma":[0.9885803,0.00009810234,0.009153118,0.000015360503,0.000016917209,0.00006913555,0.0008962249,0.000026401422,0.0011443737],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998669,0.0005489024,0.00009944775,0.00028482138,0.00026957347,0.00012826879],"domain_scores_gemma":[0.9966338,0.0021677646,0.000318227,0.00013043157,0.00043578979,0.0003140816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090363325,0.00045703442,0.00037536182,0.0028785204,0.00064428465,0.0014828283,0.00037755654,0.0006168202,0.001300187],"category_scores_gemma":[0.0043067224,0.00016655476,0.0005516573,0.0010249898,0.0002123398,0.00095157506,0.000791556,0.00046483515,0.000899905],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017547563,0.0008901692,0.5406366,0.00041668044,0.0004770443,0.0005298336,0.011652588,0.0035429073,0.078934334,0.0010269419,0.002647941,0.35749015],"study_design_scores_gemma":[0.00004488656,0.0011837283,0.7410962,0.00012075255,0.00078349875,0.0012875212,0.016874041,0.19663218,0.031918548,0.0029902125,0.006895592,0.00017283087],"about_ca_topic_score_codex":0.002302315,"about_ca_topic_score_gemma":0.0036888884,"teacher_disagreement_score":0.0028785204,"about_ca_system_score_codex":0.00035157736,"about_ca_system_score_gemma":0.00044398065,"threshold_uncertainty_score":0.0047789216},"labels":[],"label_agreement":null},{"id":"W2803408243","doi":"10.1007/978-3-319-91379-7_3","title":"An Efficient Approximation of Concept Stability Using Low-Discrepancy Sampling","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Scalability; Convergence (economics); Stability (learning theory); Rate of convergence; Computation; Context (archaeology); Algorithm; Sampling (signal processing); Monte Carlo method; Set (abstract data type); Importance sampling; Randomized algorithm; Sequence (biology); Mathematical optimization; Key (lock); Mathematics; Machine learning; Statistics","score_opus":0.04586726400951297,"score_gpt":0.2831864621844466,"score_spread":0.23731919817493363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803408243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011883554,0.0003596426,0.9865465,0.00009201395,0.000052262134,0.000038153907,0.000050162507,0.00017277132,0.00080481905],"genre_scores_gemma":[0.32334986,0.00049002614,0.6714227,0.00015748087,0.00018552702,0.00026543427,0.0005152713,0.00020776814,0.0034058378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818003,0.0007107204,0.000067416666,0.00032561127,0.00059302145,0.00012314196],"domain_scores_gemma":[0.99226296,0.005826379,0.0002718394,0.00061190507,0.0007525545,0.00027441236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038724374,0.0012514323,0.0027419222,0.0016283395,0.0006749874,0.0021300612,0.0030432586,0.0017456481,0.003739378],"category_scores_gemma":[0.016392173,0.0009429331,0.00161024,0.0016068377,0.0016143065,0.0031785606,0.0044620973,0.003519958,0.0007148287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090162014,0.00023473232,0.0019999882,0.0004846429,0.00018669578,0.00018409904,0.0002879206,0.6438617,0.011316753,0.1359839,0.004467766,0.20009018],"study_design_scores_gemma":[0.0000095039495,0.000025299189,0.000067537956,0.000007617458,0.000005481706,0.000015808804,0.0000059288336,0.98768413,0.0003630883,0.011575399,0.00023530568,0.0000048323504],"about_ca_topic_score_codex":0.0024272522,"about_ca_topic_score_gemma":0.0018204818,"teacher_disagreement_score":0.0038724374,"about_ca_system_score_codex":0.0015234686,"about_ca_system_score_gemma":0.0012744592,"threshold_uncertainty_score":0.02047968},"labels":[],"label_agreement":null},{"id":"W2803521238","doi":"10.1007/978-3-319-91464-0_30","title":"Deep Learning in Automated Essay Scoring","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Athabasca University","funders":"","keywords":"Hyperparameter; Computer science; Artificial intelligence; Suite; Machine learning; Metric (unit); Deep learning; Exploit; Convolutional neural network; Kappa; Set (abstract data type); Artificial neural network; Construct (python library); Feature engineering; Sample (material); Mathematics; Programming language","score_opus":0.01841032280520948,"score_gpt":0.2519021637832037,"score_spread":0.2334918409779942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803521238","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.03298436,0.009753668,0.93708336,0.0019557723,0.00075674726,0.000073486946,0.0005350357,0.0029145437,0.013943025],"genre_scores_gemma":[0.6287863,0.004063049,0.31728235,0.00039336033,0.00096927397,0.00022320381,0.0018476164,0.0005696687,0.045865234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812347,0.0010320256,0.00010251292,0.00020131595,0.00038014722,0.00016050535],"domain_scores_gemma":[0.99474585,0.003340906,0.00022647572,0.0005335741,0.0009938003,0.00015930683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00298766,0.0008073201,0.00091817917,0.0013111775,0.00045397785,0.0016287534,0.0013851296,0.0011004851,0.0053213695],"category_scores_gemma":[0.010670084,0.0005484542,0.0004260474,0.0015413851,0.0005053048,0.002613361,0.0021084424,0.002476068,0.0031108356],"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.00008077683,0.00010647919,0.0018196424,0.00012358518,0.00004432723,0.00002807016,0.00008493569,0.04007541,0.00123292,0.013932143,0.01965544,0.9228164],"study_design_scores_gemma":[0.000011670641,0.000040400388,0.0012667297,0.00009922352,0.000022388522,0.00004552234,0.000048684837,0.921741,0.0027026748,0.06422117,0.0097800335,0.000020537751],"about_ca_topic_score_codex":0.0023432728,"about_ca_topic_score_gemma":0.0051275417,"teacher_disagreement_score":0.0053213695,"about_ca_system_score_codex":0.00082318956,"about_ca_system_score_gemma":0.0009936761,"threshold_uncertainty_score":0.017801821},"labels":[],"label_agreement":null},{"id":"W2803561423","doi":"10.1007/978-3-319-92675-9_4","title":"Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Popularity; Context (archaeology); Cellular automaton; Theoretical computer science; Space (punctuation); Automaton; Local structure; Algorithm; Applied mathematics; Mathematics; Physics","score_opus":0.06506179910781018,"score_gpt":0.3511881434291986,"score_spread":0.2861263443213884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803561423","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.43999198,0.0016557132,0.5371177,0.0004516357,0.00020744998,0.0001407171,0.0007428815,0.0045219227,0.015170073],"genre_scores_gemma":[0.85168827,0.0003043588,0.1435195,0.00008088838,0.000048989466,0.000049930262,0.0013854236,0.0005966124,0.002326062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941995,0.001242595,0.00033764626,0.0008572418,0.0028950542,0.00046793907],"domain_scores_gemma":[0.97276884,0.017438479,0.0007658222,0.004832254,0.0036017664,0.00059283583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004765748,0.0007115371,0.0017506585,0.0018796275,0.00061983627,0.0027098581,0.0024133609,0.0020084546,0.008055428],"category_scores_gemma":[0.03319966,0.00043593862,0.0010967499,0.001341139,0.001595382,0.003050115,0.0020492969,0.0013142827,0.0012837163],"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.004076645,0.00050972175,0.027660115,0.00091452413,0.0004231121,0.00036298297,0.00039764348,0.39086285,0.024179641,0.04298885,0.006505457,0.5011185],"study_design_scores_gemma":[0.00009046623,0.00039096718,0.0028145462,0.00006644132,0.00009718957,0.00014936386,0.00015866224,0.95507586,0.015829258,0.023992334,0.0013062033,0.00002874146],"about_ca_topic_score_codex":0.0036859943,"about_ca_topic_score_gemma":0.0045320853,"teacher_disagreement_score":0.008055428,"about_ca_system_score_codex":0.0012833244,"about_ca_system_score_gemma":0.0013525982,"threshold_uncertainty_score":0.026948035},"labels":[],"label_agreement":null},{"id":"W2803729209","doi":"10.1007/978-3-319-91464-0_20","title":"Changes in Emotion and Their Relationship with Learning Gains in the Context of MetaTutor","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Institute for Christian Studies; University of Toronto","funders":"","keywords":"Boredom; Psychology; Context (archaeology); Transition (genetics); Intervention (counseling); Developmental psychology; Social psychology; Cognitive psychology","score_opus":0.04029351788926434,"score_gpt":0.25305240733412443,"score_spread":0.2127588894448601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803729209","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.9919477,0.00026888383,0.0004143103,0.00017609699,0.000024788284,0.0000127900685,0.000045726527,0.000011139324,0.0070985705],"genre_scores_gemma":[0.99846774,0.0001430386,0.00030224695,0.000026249241,0.000010873944,0.000014256351,0.00003060132,0.000006694632,0.0009984318],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996495,0.00013910307,0.000014166378,0.00005626509,0.00008584001,0.000055115397],"domain_scores_gemma":[0.9974408,0.0015909602,0.00040418966,0.00011592283,0.00014243054,0.00030569424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592067,0.00014507152,0.00022492856,0.00024756757,0.00028792158,0.0018176576,0.00028278393,0.0005010854,0.0031342949],"category_scores_gemma":[0.0058562923,0.00008033484,0.00017681054,0.00030313173,0.00037990863,0.00059773546,0.00075347954,0.0009774296,0.00026071412],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065879044,0.0035710342,0.5385331,0.000596897,0.00041341566,0.0021459558,0.0619247,0.0030242214,0.06293107,0.0091567375,0.00347985,0.30763516],"study_design_scores_gemma":[0.000037148377,0.0010920228,0.97483385,0.000054914726,0.00012772903,0.00049873104,0.0119612785,0.0025644936,0.0036158103,0.002855502,0.0023211304,0.0000373716],"about_ca_topic_score_codex":0.00043707556,"about_ca_topic_score_gemma":0.0007669071,"teacher_disagreement_score":0.0031342949,"about_ca_system_score_codex":0.0003963165,"about_ca_system_score_gemma":0.0002023375,"threshold_uncertainty_score":0.010485232},"labels":[],"label_agreement":null},{"id":"W2803871820","doi":"10.1007/978-3-319-91947-8_48","title":"Cross-Language Text Summarization Using Sentence and Multi-Sentence Compression","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Automatic summarization; Computer science; Natural language processing; Sentence; Artificial intelligence; Multi-document summarization","score_opus":0.02272415501754649,"score_gpt":0.3068379027972656,"score_spread":0.2841137477797191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803871820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04233222,0.0034669463,0.9160141,0.0007487051,0.0016290818,0.00067778176,0.0053498894,0.022598729,0.0071825357],"genre_scores_gemma":[0.132755,0.0015449751,0.8160201,0.0003691984,0.0013965515,0.00063204695,0.027419128,0.0020023116,0.017860824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989478,0.00022706525,0.0001494789,0.00026922807,0.00031525042,0.00009131111],"domain_scores_gemma":[0.99676466,0.000917882,0.00021973859,0.00043688007,0.0015632875,0.000097663455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009849619,0.0024367373,0.0018523751,0.0034299234,0.00091410964,0.0016951414,0.0011012868,0.0010955262,0.010418712],"category_scores_gemma":[0.0032101383,0.0005919529,0.0016476105,0.003189695,0.0003116502,0.002138539,0.0015107142,0.0012568946,0.008785684],"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.00058965373,0.00023186393,0.0005731585,0.00077413896,0.00026569772,0.0005551956,0.00026078086,0.0055082883,0.11837783,0.0016451911,0.03704191,0.8341763],"study_design_scores_gemma":[0.00025719497,0.0011887507,0.00964075,0.00018909648,0.0015267327,0.0017475878,0.0010563694,0.5221553,0.35729027,0.011672153,0.09300861,0.00026724392],"about_ca_topic_score_codex":0.0012509896,"about_ca_topic_score_gemma":0.0024221186,"teacher_disagreement_score":0.010418712,"about_ca_system_score_codex":0.00037492142,"about_ca_system_score_gemma":0.00075221364,"threshold_uncertainty_score":0.034854054},"labels":[],"label_agreement":null},{"id":"W28039488","doi":"10.1007/978-3-319-03089-0_11","title":"How Good is Weak-Stabilization?","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Geology","score_opus":0.025396128938620997,"score_gpt":0.2639165069636338,"score_spread":0.23852037802501277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28039488","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.07075061,0.03541955,0.48055977,0.103833795,0.008797381,0.00014308943,0.0006875554,0.002469906,0.29733837],"genre_scores_gemma":[0.8899178,0.009033897,0.040775176,0.0065197274,0.00296873,0.00017766682,0.00036820862,0.00082268496,0.049416125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713266,0.0010604712,0.0001672884,0.00048386471,0.00080502155,0.00035072395],"domain_scores_gemma":[0.9919041,0.00429845,0.00047320273,0.0017249491,0.0012412807,0.0003580267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058853915,0.0007688704,0.0010490448,0.0010187542,0.0019048841,0.0032618062,0.0011656453,0.0023418174,0.012230901],"category_scores_gemma":[0.017582038,0.00036795088,0.00076750084,0.00091347063,0.0071176165,0.010926166,0.003047916,0.0029828616,0.0028689422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026588078,0.000041091975,0.00083045405,0.00046063217,0.000078855934,0.000046245295,0.00028054928,0.0050599263,0.0021139733,0.8663341,0.017239263,0.10724905],"study_design_scores_gemma":[0.000016492717,0.000050454863,0.00017462138,0.000096445474,0.000023790815,0.000039378843,0.00015834722,0.0024384225,0.0019377681,0.97801584,0.01703214,0.000016200147],"about_ca_topic_score_codex":0.0008341677,"about_ca_topic_score_gemma":0.00078777556,"teacher_disagreement_score":0.012230901,"about_ca_system_score_codex":0.0012922622,"about_ca_system_score_gemma":0.0010981167,"threshold_uncertainty_score":0.040916443},"labels":[],"label_agreement":null},{"id":"W2804059733","doi":"10.1007/978-3-030-01045-4_3","title":"GLUENet: Ultrasound Elastography Using Convolutional Neural Network","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decorrelation; Displacement (psychology); Convolutional neural network; Elastography; Imaging phantom; Ultrasound elastography; Ultrasound","score_opus":0.015721596392558927,"score_gpt":0.25245295303698473,"score_spread":0.2367313566444258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804059733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635456,0.0021949532,0.9436498,0.00038948277,0.0005025275,0.000071413924,0.0018194424,0.036070134,0.0106668165],"genre_scores_gemma":[0.11318419,0.00428915,0.7853449,0.0008651415,0.0003489276,0.00030349984,0.012351685,0.005623555,0.0776889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998796,0.000012035105,0.0000064666406,0.000038269227,0.00005009001,0.000013626535],"domain_scores_gemma":[0.99986756,0.00004100811,0.000008700135,0.000029491712,0.000040904753,0.000012291491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002562829,0.001012654,0.00055271963,0.000468158,0.00015471836,0.00072431477,0.0012637536,0.001003045,0.012868247],"category_scores_gemma":[0.0006358351,0.00051420176,0.0005035736,0.0004275666,0.00021405566,0.001054608,0.0010740319,0.0010601161,0.0077441107],"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.00017341507,0.00007501876,0.00053852366,0.00029664751,0.00010189549,0.0002428013,0.000030506237,0.075992,0.016874826,0.009392583,0.102102466,0.7941794],"study_design_scores_gemma":[0.000027301809,0.000062068415,0.0006996509,0.000090924834,0.000043309337,0.00044559164,0.000013417542,0.8737964,0.03485695,0.0173222,0.07259109,0.00005109189],"about_ca_topic_score_codex":0.0028496562,"about_ca_topic_score_gemma":0.0048430697,"teacher_disagreement_score":0.012868247,"about_ca_system_score_codex":0.00037499794,"about_ca_system_score_gemma":0.00048833987,"threshold_uncertainty_score":0.04304862},"labels":[],"label_agreement":null},{"id":"W2804194431","doi":"10.1007/978-3-030-01258-8_22","title":"Video Summarization Using Fully Convolutional Sequence Networks","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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 Manitoba","funders":"","keywords":"Automatic summarization; Computer science; Benchmark (surveying); Segmentation; Semantics (computer science); Video tracking; Artificial intelligence; Information retrieval; Multi-document summarization; Convolutional neural network; Video processing","score_opus":0.02967537556820681,"score_gpt":0.27827924699985407,"score_spread":0.24860387143164725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804194431","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.022304395,0.0019450189,0.964007,0.00041299383,0.00040139686,0.00017531718,0.0013795025,0.006586701,0.0027876685],"genre_scores_gemma":[0.26457384,0.002431355,0.69072425,0.0004840085,0.00082673656,0.00025345918,0.013203442,0.000840899,0.026661934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994961,0.00006516112,0.00003625884,0.00017459218,0.00014904863,0.00007887293],"domain_scores_gemma":[0.9992111,0.00020295719,0.0000904813,0.0001267263,0.00030692856,0.00006169089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063222036,0.0020802736,0.0012813568,0.0022074957,0.000507135,0.0012326926,0.001019044,0.0012070984,0.00513312],"category_scores_gemma":[0.0017108717,0.0005582652,0.0011559024,0.0015013231,0.0003121393,0.0017206601,0.0010004058,0.0016008826,0.0038819774],"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.000703864,0.00016170453,0.0005519517,0.00028346005,0.00015274236,0.00023272888,0.00007495659,0.034402475,0.09430904,0.0024672511,0.013915503,0.85274434],"study_design_scores_gemma":[0.000030266088,0.0002637783,0.0015097995,0.000051072395,0.00013046445,0.00016070099,0.00006997632,0.918265,0.06332172,0.005875715,0.010287179,0.0000343013],"about_ca_topic_score_codex":0.0060720146,"about_ca_topic_score_gemma":0.010066362,"teacher_disagreement_score":0.0060720146,"about_ca_system_score_codex":0.0006658387,"about_ca_system_score_gemma":0.00081637973,"threshold_uncertainty_score":0.017171979},"labels":[],"label_agreement":null},{"id":"W2804287936","doi":"10.1007/978-3-319-91464-0_6","title":"Game Scenes Evaluation and Player’s Dominant Emotion Prediction","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Computer science; Session (web analytics); Graph; Electroencephalography; Artificial intelligence; Human–computer interaction; Identification (biology); Emotion recognition; Sentiment analysis; Eye tracking; Machine learning; Psychology; World Wide Web; Theoretical computer science","score_opus":0.04212876116668123,"score_gpt":0.3184338202623854,"score_spread":0.2763050590957042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804287936","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.8992371,0.0016803652,0.055224713,0.00021815675,0.00020957112,0.0001616348,0.0010949245,0.0005783846,0.04159517],"genre_scores_gemma":[0.9873066,0.0002661739,0.0065328204,0.000039879338,0.000030843294,0.00003310331,0.0005626878,0.000055873483,0.0051720105],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997292,0.000078310244,0.000011253357,0.00007036166,0.0000769778,0.00003394239],"domain_scores_gemma":[0.9991049,0.000484313,0.00011437174,0.000031761156,0.00019007905,0.00007460724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000456612,0.000516164,0.00027261558,0.0004153029,0.00012456128,0.0009214367,0.00025293996,0.00023341832,0.0045029093],"category_scores_gemma":[0.0034698462,0.00015384144,0.00020297494,0.0002730919,0.000102307946,0.00045275522,0.0002808403,0.00041305396,0.0010973205],"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.007546508,0.0009615501,0.13141553,0.0004896479,0.00039503354,0.00038745755,0.0008300368,0.012630035,0.14089732,0.004417734,0.0139890695,0.6860401],"study_design_scores_gemma":[0.00007415487,0.001131094,0.6549284,0.00010454371,0.0002931502,0.00062782486,0.00079390535,0.3009279,0.029807422,0.0047454275,0.006466007,0.00010013796],"about_ca_topic_score_codex":0.0021867475,"about_ca_topic_score_gemma":0.0037882763,"teacher_disagreement_score":0.0045029093,"about_ca_system_score_codex":0.00026693102,"about_ca_system_score_gemma":0.00011356537,"threshold_uncertainty_score":0.015063763},"labels":[],"label_agreement":null},{"id":"W2804405055","doi":"10.1007/978-3-319-92058-0_49","title":"Auto-detection of Safety Issues in Baby Products","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random forest; Naive Bayes classifier; Computer science; Classifier (UML); Support vector machine; Logistic regression; Dimensionality reduction; Machine learning; Artificial intelligence; Product (mathematics); Commission; Data mining; Business; Mathematics","score_opus":0.01921199339360233,"score_gpt":0.28257097660981384,"score_spread":0.2633589832162115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804405055","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.965331,0.0015547695,0.020345585,0.00044500985,0.00029369796,0.00010787916,0.0037702306,0.0006731346,0.0074786847],"genre_scores_gemma":[0.97825205,0.00044530453,0.013401904,0.00012585559,0.00020025294,0.000044503176,0.0036658463,0.000057109264,0.0038071864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992237,0.000093130235,0.000051673138,0.0001582678,0.00038677393,0.00008638318],"domain_scores_gemma":[0.9958003,0.0014107081,0.00087000104,0.00020144357,0.0015614668,0.0001559991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081516744,0.00050014444,0.0003768541,0.0017756645,0.0002426827,0.0005778306,0.00031915095,0.0006452694,0.002059994],"category_scores_gemma":[0.003688212,0.00013685222,0.00042284673,0.00081261015,0.00012029248,0.0007586599,0.0004199014,0.00049960957,0.001346136],"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.0027516626,0.00089619396,0.31348678,0.0012212874,0.00032159244,0.0014995891,0.00068632,0.0036789845,0.13441403,0.0012871275,0.029562708,0.51019377],"study_design_scores_gemma":[0.000081187995,0.0017228222,0.6567248,0.00028666094,0.00066344236,0.0024020914,0.0016342635,0.22217666,0.080752105,0.0029722836,0.030476192,0.0001075239],"about_ca_topic_score_codex":0.0012315313,"about_ca_topic_score_gemma":0.0019349027,"teacher_disagreement_score":0.002059994,"about_ca_system_score_codex":0.00023564078,"about_ca_system_score_gemma":0.00030586115,"threshold_uncertainty_score":0.00689137},"labels":[],"label_agreement":null},{"id":"W2804604475","doi":"10.1007/978-3-319-91863-1_5","title":"Learning Gait Parameters for Locomotion in Virtual Reality Systems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"York University","funders":"","keywords":"Computer science; Virtual reality; Human–computer interaction; Usability; Visualization; Stereoscopy; Virtual machine; Gait; Artificial intelligence; Computer vision","score_opus":0.037910152975881496,"score_gpt":0.28502888199533827,"score_spread":0.24711872901945678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804604475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023046406,0.00035154776,0.9741141,0.00006764293,0.000031358042,0.00004129306,0.00012517106,0.0010583203,0.001164133],"genre_scores_gemma":[0.57332563,0.0006208857,0.42063463,0.00007339802,0.00003767832,0.00018595989,0.0007655203,0.0003194699,0.0040367544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998223,0.00003835728,0.00001575871,0.000061587154,0.000043076023,0.000018945868],"domain_scores_gemma":[0.99950266,0.00025579258,0.000054142693,0.000058337948,0.00010389009,0.00002523588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043117424,0.0007043808,0.00062767544,0.0005619306,0.00020226518,0.0005779656,0.00067050644,0.0008066184,0.003729957],"category_scores_gemma":[0.002655223,0.00039836593,0.0004390577,0.00062227115,0.00020106493,0.0007876896,0.0006451839,0.0009677389,0.0012011216],"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.0001643324,0.000098494784,0.0011318116,0.0001480035,0.000042383213,0.000047259393,0.0000666456,0.34189248,0.011472557,0.0019460251,0.0018708869,0.64111906],"study_design_scores_gemma":[0.000008045144,0.000058167556,0.00074392755,0.000022377972,0.0000068874165,0.000034788663,0.000017380378,0.9944254,0.0020354157,0.0020034476,0.0006362477,0.0000080223435],"about_ca_topic_score_codex":0.0023562978,"about_ca_topic_score_gemma":0.0027648848,"teacher_disagreement_score":0.003729957,"about_ca_system_score_codex":0.0002624902,"about_ca_system_score_gemma":0.00031187607,"threshold_uncertainty_score":0.012477994},"labels":[],"label_agreement":null},{"id":"W2805058911","doi":"10.1007/978-3-319-91716-0_29","title":"Keep Calm and Read the Instructions: Factors for Successful User Equipment Setup","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Installation; Computer science; Human–computer interaction; Factor (programming language); Range (aeronautics); Simulation; Operating system; Engineering","score_opus":0.07880705982481115,"score_gpt":0.34960493783954855,"score_spread":0.2707978780147374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805058911","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.9545203,0.0009418664,0.014232879,0.0011519653,0.00014862893,0.00038405103,0.0002058453,0.00094656495,0.027467879],"genre_scores_gemma":[0.98155665,0.00032793864,0.012945893,0.00021678481,0.000030619103,0.000112007394,0.00018053343,0.00024174016,0.004387766],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9952577,0.0019399095,0.00046519123,0.00026372465,0.0013964378,0.0006769971],"domain_scores_gemma":[0.9443526,0.03650122,0.0059634815,0.0022696732,0.00527337,0.0056395996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043665674,0.00062055804,0.0003678777,0.0010551206,0.0016466618,0.0032900635,0.001750077,0.0017640531,0.019973729],"category_scores_gemma":[0.08111148,0.00064371416,0.0005961478,0.0005325335,0.0008091083,0.0026919728,0.0014277643,0.0017333729,0.0055403537],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013457659,0.0057333787,0.5251119,0.0017796945,0.00025303295,0.0027371012,0.04504673,0.001338936,0.03610914,0.0022807478,0.016603397,0.36166015],"study_design_scores_gemma":[0.000052555737,0.0025992007,0.920427,0.0008251979,0.00023113439,0.0037925756,0.045038886,0.0040021096,0.0058606127,0.0020832927,0.014846219,0.000241255],"about_ca_topic_score_codex":0.0028385269,"about_ca_topic_score_gemma":0.003927753,"teacher_disagreement_score":0.019973729,"about_ca_system_score_codex":0.00062895,"about_ca_system_score_gemma":0.0018644655,"threshold_uncertainty_score":0.066818774},"labels":[],"label_agreement":null},{"id":"W2805369415","doi":"10.1007/978-3-319-92871-5_11","title":"A Statistical Performance Analysis of Graph Clustering Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Mitacs","keywords":"Computer science; Cluster analysis; Modularity (biology); Graph; Clustering coefficient; Statistical hypothesis testing; Data mining; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.01402015340812746,"score_gpt":0.2661269809264786,"score_spread":0.2521068275183511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805369415","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.07672999,0.0065651042,0.90156984,0.0017184808,0.0005115788,0.00024876618,0.0011559604,0.00300854,0.008491673],"genre_scores_gemma":[0.6107304,0.0036261575,0.3696372,0.0005475828,0.0015537594,0.0005062362,0.004336093,0.0015168702,0.007545714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874507,0.006390112,0.00045373043,0.0015047012,0.0035174235,0.0006833216],"domain_scores_gemma":[0.9204952,0.059756402,0.0023693917,0.009201992,0.0072616255,0.0009153896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013028723,0.0019460011,0.0021305305,0.005077136,0.0014527286,0.0028677299,0.0038831665,0.0026084238,0.005065871],"category_scores_gemma":[0.062636256,0.0007837838,0.0019118012,0.008017199,0.0018131369,0.0046924334,0.0023041964,0.0026219497,0.0014921089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008153956,0.00042464168,0.005267759,0.00040637547,0.00044691542,0.00010606742,0.00018421607,0.69227517,0.003998107,0.0755547,0.017543806,0.20297681],"study_design_scores_gemma":[0.000014477242,0.00014419819,0.0012717384,0.000019074347,0.000041881463,0.000064945205,0.000026745252,0.98042107,0.00082593184,0.016117815,0.0010331398,0.000018855395],"about_ca_topic_score_codex":0.0049126544,"about_ca_topic_score_gemma":0.0033565084,"teacher_disagreement_score":0.013028723,"about_ca_system_score_codex":0.0036873205,"about_ca_system_score_gemma":0.0024915033,"threshold_uncertainty_score":0.06890333},"labels":[],"label_agreement":null},{"id":"W2805372387","doi":"10.1007/978-3-319-93387-0_29","title":"In-Region Authentication","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Gas meter prover; Authentication (law); Set (abstract data type); Personalization; Access control; Computer security; Theoretical computer science; Key (lock); Algorithm; Programming language; World Wide Web; Mathematical proof; Mathematics","score_opus":0.021591694191087116,"score_gpt":0.2845172381411158,"score_spread":0.26292554395002865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805372387","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.010416769,0.0026537857,0.6922673,0.00056951976,0.0011075055,0.00026212187,0.00069336296,0.0080971215,0.28393248],"genre_scores_gemma":[0.42951858,0.004362901,0.20052998,0.0007247621,0.00062205264,0.00028449623,0.0019736222,0.001899726,0.3600838],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920505,0.00013961563,0.000043820703,0.00019184685,0.00025578545,0.00016390669],"domain_scores_gemma":[0.9989207,0.00010402614,0.000059540394,0.0006474168,0.00020788737,0.000060395083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007756293,0.0010047762,0.00075276545,0.0006896368,0.0011792762,0.0018683482,0.0015180627,0.00096912566,0.035435397],"category_scores_gemma":[0.0014171306,0.00045597265,0.0005183363,0.0008499038,0.0007494961,0.0044045374,0.0040923255,0.0014922064,0.03297238],"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.0010485568,0.00013644186,0.00060412736,0.0006733842,0.00006287945,0.00053068716,0.0009824423,0.007755481,0.054241706,0.4142134,0.07786242,0.4418886],"study_design_scores_gemma":[0.000059095844,0.00033704072,0.0006562339,0.00022359741,0.00013609743,0.0029111442,0.00039834672,0.042623702,0.108971685,0.13421188,0.7093762,0.00009502536],"about_ca_topic_score_codex":0.0004096973,"about_ca_topic_score_gemma":0.0005308044,"teacher_disagreement_score":0.035435397,"about_ca_system_score_codex":0.0006096518,"about_ca_system_score_gemma":0.00082599744,"threshold_uncertainty_score":0.11854327},"labels":[],"label_agreement":null},{"id":"W2805466137","doi":"10.1007/978-3-319-92058-0_24","title":"A Probabilistic Model for Automobile Diagnosis System: Combining Bayesian Estimator and Expert Knowledge","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Computer science; Variable elimination; Bayesian network; Probabilistic logic; Graphical model; Artificial intelligence; Heuristics; Machine learning; Estimator; Variable (mathematics); Inference; Data mining; Mathematics; Statistics","score_opus":0.03392706465533659,"score_gpt":0.28150889879814067,"score_spread":0.24758183414280407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805466137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018658178,0.0002016551,0.9968991,0.000111461624,0.000016421707,0.00001887643,0.00006885589,0.00019132803,0.0006264162],"genre_scores_gemma":[0.42607155,0.0014995661,0.5650843,0.0003354239,0.00024933027,0.00035479467,0.0007461975,0.0002044282,0.0054544527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987178,0.00033934525,0.00008145794,0.00035652594,0.00042441837,0.00008045274],"domain_scores_gemma":[0.99805707,0.0012311776,0.00013852658,0.00010672201,0.00041899557,0.00004748247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019727235,0.00080335914,0.0017680697,0.0014800867,0.0006130981,0.0016223723,0.0025059222,0.0019960296,0.003245553],"category_scores_gemma":[0.006182003,0.0009427696,0.0013550397,0.0013637325,0.00072703575,0.0026421228,0.0011301549,0.0018883338,0.0009797356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008547422,0.00008042512,0.0009406152,0.00019248307,0.00010597625,0.000120951365,0.0001087098,0.8437763,0.0020882215,0.030653637,0.002643261,0.11920388],"study_design_scores_gemma":[0.0000050164335,0.000010427055,0.00012494263,0.00000892342,0.000022332446,0.000035855366,0.000004209999,0.9855334,0.00021936983,0.013633733,0.00039063534,0.00001119522],"about_ca_topic_score_codex":0.0098069925,"about_ca_topic_score_gemma":0.009376724,"teacher_disagreement_score":0.0098069925,"about_ca_system_score_codex":0.0012981954,"about_ca_system_score_gemma":0.0014581945,"threshold_uncertainty_score":0.019499838},"labels":[],"label_agreement":null},{"id":"W2805552138","doi":"10.1007/978-3-319-92058-0_80","title":"Identifying Similar Sentences by Using N-Grams of Characters","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Syntax; Similarity (geometry); Grammar; Range (aeronautics); Categorization; Linguistics; Image (mathematics)","score_opus":0.025870512414592144,"score_gpt":0.28530009870324685,"score_spread":0.2594295862886547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805552138","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.61174643,0.005052882,0.30232188,0.0013141873,0.0018173555,0.00164843,0.027666682,0.017727502,0.030704705],"genre_scores_gemma":[0.5615494,0.001431423,0.394167,0.00046726724,0.00075388874,0.00048686366,0.028313337,0.0010814107,0.011749388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991124,0.00013838056,0.00012705794,0.00030718232,0.00024892282,0.00006601361],"domain_scores_gemma":[0.99769396,0.0010330839,0.00032001798,0.00021461236,0.0005999971,0.00013820505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000558821,0.0013972151,0.00090058486,0.0055652284,0.0011525331,0.0013771738,0.0006131907,0.0010444113,0.007234911],"category_scores_gemma":[0.0031553062,0.00032059156,0.0009557578,0.003405521,0.00035973577,0.0020874925,0.0009197899,0.0007869487,0.0069092116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017260923,0.00052095467,0.018649984,0.0014918123,0.00026810617,0.0023590948,0.0012406299,0.0018451604,0.2684498,0.0034360886,0.031022675,0.66898966],"study_design_scores_gemma":[0.00031083863,0.0030565073,0.117862776,0.0009872245,0.0019481909,0.013212239,0.005791487,0.37132606,0.27619764,0.03584666,0.1730192,0.00044121273],"about_ca_topic_score_codex":0.0017764195,"about_ca_topic_score_gemma":0.003966196,"teacher_disagreement_score":0.007234911,"about_ca_system_score_codex":0.0003913107,"about_ca_system_score_gemma":0.000848417,"threshold_uncertainty_score":0.024203181},"labels":[],"label_agreement":null},{"id":"W2805571938","doi":"10.1007/978-3-319-91250-9_18","title":"Evaluating Tap-and-Drag: A Single-Handed Zooming Method","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Zoom; Drag; Computer science; Computer vision; Tap water; Camera phone; Computer graphics (images); Artificial intelligence; Physics; Engineering; Optics; Aerospace engineering","score_opus":0.055739169196472746,"score_gpt":0.34678068613054874,"score_spread":0.291041516934076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805571938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2926551,0.0012981816,0.67037773,0.00015573032,0.00027509526,0.0016499673,0.00092485425,0.011201276,0.021462096],"genre_scores_gemma":[0.52861005,0.00039950595,0.4623184,0.0001317103,0.000058674053,0.0006606922,0.00080191164,0.001127749,0.0058913813],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971896,0.0010858306,0.00014222015,0.00052134605,0.00090518076,0.00015581262],"domain_scores_gemma":[0.98787075,0.0076530073,0.00054334314,0.0010197447,0.0022285425,0.0006846582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024260252,0.0014876903,0.0011774371,0.0013108623,0.00046985215,0.0016774198,0.0012991083,0.0011448751,0.013630186],"category_scores_gemma":[0.018300531,0.00036628195,0.00036123328,0.00066815485,0.00042864706,0.0019421163,0.0020693738,0.00061660947,0.0024186405],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003792739,0.00047460015,0.0051186597,0.000872458,0.00014323983,0.00012269596,0.0012988279,0.0044260323,0.09447444,0.0018490469,0.0058748242,0.88155246],"study_design_scores_gemma":[0.0017242344,0.0067570084,0.059128437,0.00057793135,0.00069146074,0.0018106771,0.0041508246,0.71612114,0.17006043,0.01122646,0.027201673,0.0005496665],"about_ca_topic_score_codex":0.0013056614,"about_ca_topic_score_gemma":0.0029705667,"teacher_disagreement_score":0.013630186,"about_ca_system_score_codex":0.00032926194,"about_ca_system_score_gemma":0.00072186126,"threshold_uncertainty_score":0.045597494},"labels":[],"label_agreement":null},{"id":"W2805655769","doi":"10.1007/978-3-319-93000-8_78","title":"Hybrid Statistical Framework for Diabetic Retinopathy Detection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Pattern recognition (psychology); Kernel (algebra); Support vector machine; Statistical model; Dirichlet distribution; Diabetic retinopathy; Probabilistic logic; Flexibility (engineering); Latent Dirichlet allocation; Machine learning; Topic model; Mathematics; Statistics","score_opus":0.014466864487769692,"score_gpt":0.2837135439417796,"score_spread":0.26924667945400993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805655769","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.0021686212,0.0006748119,0.9957281,0.000086535256,0.000038961367,0.0000105047675,0.000139488,0.00045753186,0.0006954315],"genre_scores_gemma":[0.15670249,0.0027134067,0.8224658,0.00027293016,0.0003506428,0.00012863347,0.0015461663,0.0003093223,0.015510577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.000090004476,0.000015845426,0.000079444886,0.00014162771,0.000052607003],"domain_scores_gemma":[0.99968386,0.00010348793,0.000020665633,0.000034633977,0.00013617548,0.000021155785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081232906,0.0006481619,0.00087901176,0.0008513251,0.00022614654,0.0007856869,0.0014171185,0.0007033988,0.0032318407],"category_scores_gemma":[0.00081146916,0.00035982905,0.0011566085,0.0008974441,0.00023638114,0.0006889238,0.00082058046,0.00096628466,0.0015683986],"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.00017998666,0.0001784425,0.0013263102,0.00018455193,0.00023324325,0.00013035,0.00005157043,0.2217877,0.024887646,0.034097984,0.01098812,0.7059541],"study_design_scores_gemma":[0.0000040956224,0.00003266734,0.00048988214,0.0000093875,0.000028000943,0.000086606444,0.000007074253,0.9859455,0.0025512164,0.008034059,0.0027969133,0.000014646079],"about_ca_topic_score_codex":0.0047051357,"about_ca_topic_score_gemma":0.0076348684,"teacher_disagreement_score":0.0047051357,"about_ca_system_score_codex":0.00047891203,"about_ca_system_score_gemma":0.0008637391,"threshold_uncertainty_score":0.010811627},"labels":[],"label_agreement":null},{"id":"W2805714452","doi":"10.1007/978-3-319-93031-2_23","title":"Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Constraint programming; Scheduling (production processes); Constraint (computer-aided design); Mathematical optimization; Resource constraints; Computation; Set (abstract data type); Theoretical computer science; Mathematics; Distributed computing; Stochastic programming","score_opus":0.06981872775659288,"score_gpt":0.3314531585137394,"score_spread":0.26163443075714654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805714452","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.01521827,0.00027557474,0.97876894,0.00018802048,0.00015679734,0.00007855692,0.00017405195,0.001251264,0.0038884568],"genre_scores_gemma":[0.19451585,0.00027202853,0.79423535,0.00025647983,0.00016829392,0.00018126919,0.0008836727,0.0004498044,0.009037329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991105,0.00011451514,0.00006411636,0.00017922057,0.00030827225,0.00022338868],"domain_scores_gemma":[0.99819785,0.0007720288,0.00010563862,0.0004861105,0.00032558446,0.0001127767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096560275,0.00094820245,0.0016012227,0.0010761598,0.0011909344,0.0017905605,0.0018922131,0.0011488561,0.00877287],"category_scores_gemma":[0.0031401166,0.00060445064,0.0009406978,0.0020456295,0.00057157467,0.0020792098,0.0017924912,0.0017846114,0.0013781453],"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.00072767516,0.00033945896,0.0012847502,0.00019234382,0.000095694755,0.00013316853,0.00012510049,0.21548487,0.012913644,0.036866836,0.01731062,0.71452594],"study_design_scores_gemma":[0.000047452788,0.00007244628,0.00034038455,0.000016877848,0.00002827071,0.00005896012,0.00003580224,0.97452104,0.004303262,0.017424332,0.0031296166,0.00002142658],"about_ca_topic_score_codex":0.009837521,"about_ca_topic_score_gemma":0.011800091,"teacher_disagreement_score":0.009837521,"about_ca_system_score_codex":0.0011327972,"about_ca_system_score_gemma":0.0036223684,"threshold_uncertainty_score":0.029348195},"labels":[],"label_agreement":null},{"id":"W2805783523","doi":"10.1007/978-3-319-92058-0_8","title":"A Comparison of Knee Strategies for Hierarchical Spatial Clustering","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms 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":"Brock University","funders":"","keywords":"Hierarchical clustering; Computer science; Cluster analysis; Medoid; Centroid; Dendrogram; Cluster (spacecraft); Data mining; Artificial intelligence; Complete linkage; Pattern recognition (psychology); Population","score_opus":0.04336293284831568,"score_gpt":0.3482684205343744,"score_spread":0.30490548768605874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805783523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031462397,0.004652618,0.94933695,0.00035753733,0.00025562788,0.00028426741,0.00033223012,0.002379099,0.0109393485],"genre_scores_gemma":[0.26853022,0.0032735374,0.7156395,0.00036442024,0.00016154765,0.0003166662,0.0015769145,0.001436971,0.008700261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731785,0.0009249962,0.00018987808,0.00029294685,0.0009646457,0.0003096872],"domain_scores_gemma":[0.99179417,0.0043471646,0.0003053912,0.0010909158,0.0019771212,0.0004851742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004828253,0.0016252649,0.002472989,0.0030749692,0.0015105106,0.0038859101,0.004135366,0.0021726794,0.008729295],"category_scores_gemma":[0.015601587,0.00074919115,0.0014724188,0.0046829004,0.0011122534,0.004668908,0.0033470225,0.0015549102,0.002481801],"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.0016397301,0.0005319232,0.0012759299,0.00080995366,0.00033846943,0.00006997692,0.0005322985,0.13476722,0.0035402686,0.071995966,0.01522378,0.7692745],"study_design_scores_gemma":[0.00030434117,0.0006770859,0.0014833687,0.00016729119,0.00024228446,0.00022739149,0.0009835409,0.9176179,0.0037892635,0.066953585,0.007457228,0.00009667918],"about_ca_topic_score_codex":0.01039831,"about_ca_topic_score_gemma":0.016109833,"teacher_disagreement_score":0.01039831,"about_ca_system_score_codex":0.0018356108,"about_ca_system_score_gemma":0.0029427777,"threshold_uncertainty_score":0.029202461},"labels":[],"label_agreement":null},{"id":"W2805784636","doi":"10.1007/978-3-319-92037-5_9","title":"Positive Impact of Exergaming on Older Adults’ Mental and Social Well-Being: In Search of Evidence","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Aging and Gerontology Research","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"Mental health; Empirical evidence; Applied psychology; Rehabilitation; Psychology; Empirical research; Gerontology; Medicine; Psychiatry","score_opus":0.05016810201784594,"score_gpt":0.3875750623865989,"score_spread":0.33740696036875295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805784636","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29023764,0.66835755,0.0004754949,0.007561733,0.002417886,0.00024563997,0.000854572,0.000027052387,0.02982246],"genre_scores_gemma":[0.47513846,0.5069515,0.0019420716,0.0032274555,0.0021063895,0.0002764132,0.0009273679,0.00001881482,0.009411499],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996742,0.000106851,0.000036983743,0.00005020774,0.00009558999,0.000036253678],"domain_scores_gemma":[0.9979005,0.0017832845,0.00011430862,0.0000291573,0.000090502086,0.000082264494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012192827,0.00053129235,0.0008396244,0.0005537489,0.00021429519,0.0011373899,0.0006351634,0.0010509358,0.015742568],"category_scores_gemma":[0.0037038343,0.0001791048,0.0009019983,0.00056691596,0.0004259642,0.0008545439,0.0009861125,0.0011432824,0.00095305895],"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.004150372,0.0017558837,0.019644197,0.039041918,0.0026175205,0.00059462787,0.0013118349,0.00022717558,0.001270545,0.0034748416,0.009217891,0.9166933],"study_design_scores_gemma":[0.0030046245,0.014189099,0.65733963,0.12270896,0.018439073,0.0021607738,0.0068588615,0.000862017,0.003006168,0.013729551,0.15751344,0.00018779135],"about_ca_topic_score_codex":0.0012363814,"about_ca_topic_score_gemma":0.0031973913,"teacher_disagreement_score":0.015742568,"about_ca_system_score_codex":0.00036209697,"about_ca_system_score_gemma":0.0008767641,"threshold_uncertainty_score":0.05266416},"labels":[],"label_agreement":null},{"id":"W2805869754","doi":"10.1007/978-3-319-92058-0_83","title":"Meticulous Transparency—An Evaluation Process for an Agile AI Regulatory Scheme","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Montreal Neurological Institute and Hospital; Douglas Mental Health University Institute; McGill University","funders":"","keywords":"Transparency (behavior); Pace; Computer science; Agile software development; Ethical issues; Process (computing); Engineering ethics; Conformity; Risk analysis (engineering); Management science; Computer security; Political science; Software engineering; Engineering; Business; Law","score_opus":0.042468450693073236,"score_gpt":0.3341469633492444,"score_spread":0.2916785126561711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805869754","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.041374736,0.00022403368,0.8644917,0.008826227,0.00038193204,0.0012902358,0.00012712911,0.0010407773,0.08224325],"genre_scores_gemma":[0.70940447,0.00010180964,0.27712288,0.001186521,0.00009574086,0.000786656,0.000079885926,0.00032765802,0.010894388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.92896575,0.039408393,0.0025260055,0.0041830214,0.021565948,0.0033508334],"domain_scores_gemma":[0.8667753,0.07549203,0.006419206,0.027970226,0.019376285,0.0039669406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06634583,0.00086110696,0.0010291478,0.0018072788,0.0034796027,0.011206771,0.0038764293,0.0059183026,0.012158527],"category_scores_gemma":[0.16675039,0.00068249734,0.001012032,0.001103385,0.009101881,0.011665413,0.009647338,0.010321419,0.0017505952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025543277,0.00012901382,0.00072749506,0.00009240941,0.00003862181,0.000120406614,0.001051899,0.012482217,0.0019034385,0.93362224,0.0033255243,0.04625138],"study_design_scores_gemma":[0.00016789444,0.0005104755,0.0006347032,0.00031956562,0.00004859097,0.00012524231,0.0010432187,0.12916726,0.0064421096,0.8394191,0.02201487,0.000106936386],"about_ca_topic_score_codex":0.0017929844,"about_ca_topic_score_gemma":0.0015269332,"teacher_disagreement_score":0.06634583,"about_ca_system_score_codex":0.005290254,"about_ca_system_score_gemma":0.011369746,"threshold_uncertainty_score":0.35087448},"labels":[],"label_agreement":null},{"id":"W2805889932","doi":"10.1007/978-3-319-92034-4_37","title":"Promising Practices in Collaborative Digital Literacy and Digital Media-Making with Older Adults","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Contextualization; Best practice; Digital literacy; Public relations; Social media; Digital media; Literacy; Variety (cybernetics); Sociology; Computer science; Internet privacy; Political science; World Wide Web; Pedagogy","score_opus":0.010960312580218286,"score_gpt":0.28725548601475276,"score_spread":0.27629517343453447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805889932","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.50015444,0.029103482,0.01854397,0.03976591,0.0007955004,0.00036384902,0.000111309186,0.00017667648,0.41098493],"genre_scores_gemma":[0.9396441,0.007630685,0.013254769,0.0019469261,0.00013808235,0.0002432762,0.000070162976,0.000043292406,0.037028663],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9947635,0.0033156737,0.00021838144,0.0005386283,0.00063020387,0.0005335897],"domain_scores_gemma":[0.98481756,0.009869192,0.0009365071,0.0007568303,0.0011729836,0.0024470459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01000371,0.00044889635,0.00033847,0.0016503943,0.005738416,0.010541877,0.0014547013,0.002696802,0.009685947],"category_scores_gemma":[0.017609691,0.00031471686,0.00051672966,0.0017114548,0.0071693873,0.011885233,0.007686374,0.0031123487,0.0012478627],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008013369,0.00065238593,0.011863146,0.0004960554,0.000021780172,0.0009476737,0.6161961,0.000083573024,0.00068940653,0.11888266,0.008909141,0.24117787],"study_design_scores_gemma":[0.0000637156,0.00046023694,0.016527338,0.002326162,0.000047962592,0.0019015925,0.6206171,0.0004271652,0.0013531395,0.119899325,0.23632395,0.000052310497],"about_ca_topic_score_codex":0.0037648554,"about_ca_topic_score_gemma":0.008463318,"teacher_disagreement_score":0.010541877,"about_ca_system_score_codex":0.0027789895,"about_ca_system_score_gemma":0.006241605,"threshold_uncertainty_score":0.05290532},"labels":[],"label_agreement":null},{"id":"W2805939218","doi":"10.1007/978-3-319-93031-2_36","title":"A Local Search Framework for Compiling Relaxed Decision Diagrams","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Polytechnique Montréal; The Scarborough Hospital; University of Toronto","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Set (abstract data type); Scheme (mathematics); Local search (optimization); Theoretical computer science; Continuous knapsack problem; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.024566358540858018,"score_gpt":0.2707292797578114,"score_spread":0.2461629212169534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805939218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018339808,0.0000580358,0.9948742,0.000040597282,0.000020684263,0.0000555731,0.000095210155,0.0012562881,0.001765399],"genre_scores_gemma":[0.04089875,0.000114698734,0.95492375,0.000055493892,0.000024059249,0.00019691391,0.00047615083,0.0007722311,0.0025378212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982969,0.00058862247,0.00014254775,0.00027784388,0.0005361621,0.0001579308],"domain_scores_gemma":[0.99678683,0.0021168326,0.00013949735,0.0005478752,0.00032154363,0.00008740516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022482066,0.0010190842,0.001317109,0.0015247384,0.0007907358,0.0020322276,0.0021897503,0.0011858405,0.015128958],"category_scores_gemma":[0.009510836,0.0013565484,0.0024691643,0.001918443,0.0010894823,0.0024702745,0.00309495,0.0031799842,0.0030573022],"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.00017544515,0.00014279311,0.0004134009,0.000566907,0.0000708226,0.00020502134,0.00041925482,0.3853039,0.0064760107,0.19118349,0.008904827,0.40613806],"study_design_scores_gemma":[0.00004982738,0.00007588021,0.00008715687,0.000116440075,0.00004669137,0.00010165891,0.00007262435,0.7879828,0.0036871862,0.192298,0.015447291,0.000034431207],"about_ca_topic_score_codex":0.0022951236,"about_ca_topic_score_gemma":0.0041439706,"teacher_disagreement_score":0.015128958,"about_ca_system_score_codex":0.0009875416,"about_ca_system_score_gemma":0.0013474431,"threshold_uncertainty_score":0.050611436},"labels":[],"label_agreement":null},{"id":"W2806355177","doi":"10.1007/978-3-319-92058-0_42","title":"Optimizing Scale-Free Network Robustness with the Great Deluge Algorithm","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Brock University","funders":"","keywords":"Robustness (evolution); Computer science; Hill climbing; Metaheuristic; Simulated annealing; Mathematical optimization; Local optimum; Algorithm; Mathematics","score_opus":0.010511854167214538,"score_gpt":0.2276125258001681,"score_spread":0.21710067163295357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806355177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019269412,0.00043819076,0.9761437,0.00032569567,0.00007516877,0.00004477182,0.00007528262,0.00074728444,0.0028805465],"genre_scores_gemma":[0.6854164,0.00047028094,0.30457297,0.00035447854,0.00017781941,0.00028387114,0.000393715,0.00080981234,0.0075206715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991736,0.00032301884,0.000028128363,0.00019215318,0.00018270139,0.00010035089],"domain_scores_gemma":[0.9947068,0.003891085,0.00030479528,0.00051460066,0.00039892102,0.00018393072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023563325,0.0020089967,0.001874107,0.0014541044,0.00077948975,0.0013020793,0.002447373,0.0020861756,0.003298915],"category_scores_gemma":[0.011452202,0.0009057192,0.00095911894,0.00088059367,0.0019132192,0.0026526912,0.002828496,0.0020589707,0.0009546984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074471296,0.000027047678,0.00019665965,0.00004975413,0.000042373224,0.000027517826,0.000028261426,0.966558,0.0010338237,0.010468414,0.0019393062,0.019554494],"study_design_scores_gemma":[0.0000055784,0.000012781634,0.000023287044,0.0000036160307,0.000004040997,0.000007374697,0.0000037365448,0.9930147,0.00017082729,0.006597118,0.00015348753,0.0000035353626],"about_ca_topic_score_codex":0.0044035255,"about_ca_topic_score_gemma":0.004111913,"teacher_disagreement_score":0.0044035255,"about_ca_system_score_codex":0.0016374876,"about_ca_system_score_gemma":0.0009828967,"threshold_uncertainty_score":0.012461662},"labels":[],"label_agreement":null},{"id":"W2806374619","doi":"10.1007/978-3-319-92058-0_64","title":"Detecting Overlapping Communities in Social Networks with Voronoi and Tolerance Rough Sets","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Winnipeg","funders":"","keywords":"Voronoi diagram; Computer science; Closeness; Measure (data warehouse); Rough set; Centroidal Voronoi tessellation; Theoretical computer science; Mathematics; Data mining; Geometry","score_opus":0.015606209204999394,"score_gpt":0.25068753596876814,"score_spread":0.23508132676376875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806374619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1499027,0.0011552157,0.84676623,0.00022032754,0.00005041393,0.00014950479,0.00027591997,0.00027903324,0.0012007956],"genre_scores_gemma":[0.7552974,0.000439858,0.2426068,0.000050662435,0.00010584687,0.00016288878,0.0004683658,0.000041838644,0.0008262375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658763,0.0011269196,0.00024149696,0.00059483794,0.0011807604,0.00026833138],"domain_scores_gemma":[0.9897585,0.0074810376,0.001051136,0.00064455834,0.00073095236,0.00033386188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027280373,0.0006883223,0.0019396915,0.004847838,0.0010922133,0.0023811685,0.0023122071,0.0014474791,0.00061268656],"category_scores_gemma":[0.016503066,0.0007702278,0.0018228317,0.0031457653,0.0015407923,0.003303025,0.0030301246,0.0010338401,0.00016931031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010034363,0.0004104647,0.028758062,0.0007327269,0.0007209818,0.00067184796,0.0012788846,0.6369489,0.0062958994,0.08122863,0.0034098777,0.2385403],"study_design_scores_gemma":[0.000016848742,0.00005230422,0.0016409263,0.000027901253,0.000045657114,0.00013356224,0.00023239705,0.95609987,0.0008567076,0.04021629,0.0006535295,0.000023981835],"about_ca_topic_score_codex":0.0039011752,"about_ca_topic_score_gemma":0.0037519168,"teacher_disagreement_score":0.004847838,"about_ca_system_score_codex":0.0009934916,"about_ca_system_score_gemma":0.00071881234,"threshold_uncertainty_score":0.014427364},"labels":[],"label_agreement":null},{"id":"W2806438009","doi":"10.1007/978-3-540-85902-4_35","title":"University of Waterloo at INEX2007: Adhoc and Link-the-Wiki Tracks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Link (geometry); XML; Embedding; Track (disk drive); Context (archaeology); Point (geometry); Information retrieval; World Wide Web; Computer network; Artificial intelligence; Operating system","score_opus":0.013577574969926363,"score_gpt":0.19887995854184615,"score_spread":0.18530238357191978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806438009","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018970776,0.018001236,0.07299695,0.023273364,0.0112159625,0.0005511136,0.16106953,0.059596404,0.6343247],"genre_scores_gemma":[0.017840868,0.0046673515,0.042428475,0.0008839474,0.0011827232,0.00015401746,0.09465922,0.009482441,0.8287009],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807286,0.00017324288,0.00006512737,0.00027739262,0.0011978426,0.00021349698],"domain_scores_gemma":[0.99546,0.0004441982,0.00010933507,0.0005291447,0.0021882588,0.0012691689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002930558,0.0010390423,0.001138129,0.0040553217,0.0027981275,0.00546907,0.0016881236,0.0010173862,0.1363685],"category_scores_gemma":[0.0058318963,0.00083410693,0.00044123677,0.008213246,0.0005836933,0.0062726038,0.0020499756,0.0014671023,0.06827516],"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.000040818137,0.00007284785,0.00037349426,0.00008227738,0.000004411404,0.000022651044,0.00009735884,0.00024314827,0.00041996315,0.0036853368,0.8612062,0.13375154],"study_design_scores_gemma":[0.000015008014,0.000022520011,0.0012717663,0.00005115059,0.0000049362357,0.000044347133,0.0000920664,0.0014994782,0.0013268921,0.0020996924,0.9935529,0.000019253883],"about_ca_topic_score_codex":0.11779962,"about_ca_topic_score_gemma":0.2055963,"teacher_disagreement_score":0.1363685,"about_ca_system_score_codex":0.00331049,"about_ca_system_score_gemma":0.009096751,"threshold_uncertainty_score":0.4561981},"labels":[],"label_agreement":null},{"id":"W2806439496","doi":"10.1007/978-3-642-23605-1","title":"Brain Informatics","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.027442691937650854,"score_gpt":0.2620397743304688,"score_spread":0.23459708239281796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806439496","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010722999,0.014388649,0.062136475,0.0024590853,0.00260374,0.00007566357,0.00056740484,0.0021385676,0.91455823],"genre_scores_gemma":[0.008214491,0.00971995,0.014013743,0.00067645806,0.00087811047,0.00008676902,0.00080771284,0.00041188524,0.965191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998585,0.000013691378,0.000005873798,0.00003133859,0.000078145036,0.000012438496],"domain_scores_gemma":[0.99984956,0.00003184922,0.0000055523487,0.00003919382,0.00005083456,0.000023020231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002016132,0.00085691176,0.00048017502,0.0011681775,0.0005239008,0.002215599,0.00069592515,0.00062783336,0.1312055],"category_scores_gemma":[0.0005566207,0.00026946733,0.00029386918,0.0012460427,0.0005231996,0.0020328967,0.001285589,0.0012967649,0.08414175],"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.000020074067,0.000029528444,0.000077687066,0.00026276032,0.000008238286,0.00006139589,0.0001277419,0.00052821107,0.002745819,0.09989207,0.3280837,0.56816274],"study_design_scores_gemma":[0.0000034086152,0.000012445351,0.0001999292,0.00007409835,0.00000503901,0.00018193573,0.000040873143,0.00067199074,0.0011624653,0.04431448,0.9533275,0.000005807187],"about_ca_topic_score_codex":0.00045017095,"about_ca_topic_score_gemma":0.0009227619,"teacher_disagreement_score":0.1312055,"about_ca_system_score_codex":0.00049297494,"about_ca_system_score_gemma":0.0006174098,"threshold_uncertainty_score":0.4389261},"labels":[],"label_agreement":null},{"id":"W2806564398","doi":"10.1007/978-3-319-93736-6_17","title":"Maximizing Throughput in Zero-Buffer Tandem Lines with Constrained Flexible Servers","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Server; Computer science; Throughput; Dimensioning; Flexibility (engineering); Distributed computing; Queue; Computer network; Queueing theory; Tandem; Scalability; Operating system; Wireless; Engineering; Mathematics","score_opus":0.01958569986217445,"score_gpt":0.2386265612034624,"score_spread":0.21904086134128795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806564398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19372311,0.0016328463,0.7851987,0.0010117503,0.00019424307,0.0001034059,0.00023491513,0.00080484303,0.01709618],"genre_scores_gemma":[0.968609,0.0007252625,0.019818712,0.0001370476,0.00013710158,0.00007336322,0.00009061342,0.00014258023,0.010266404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989574,0.00037736326,0.000030097,0.0001993051,0.00016687844,0.0002689248],"domain_scores_gemma":[0.9970017,0.0022159014,0.00022708437,0.00010109776,0.00024992842,0.0002042342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014437772,0.0015126739,0.0017014699,0.00073547644,0.0008698029,0.0028728202,0.0031636234,0.0018779151,0.004405926],"category_scores_gemma":[0.0053205667,0.0010605116,0.0005541526,0.002104271,0.0016012714,0.0025481065,0.0015292044,0.0013639189,0.0006126226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027907314,0.00008414072,0.00026435347,0.000116347415,0.000029771827,0.00016909135,0.00007789311,0.959391,0.003568889,0.02176079,0.0019730604,0.012285562],"study_design_scores_gemma":[0.000015569814,0.00004517929,0.00006570501,0.000009533597,0.000011062711,0.000026515474,0.000021854883,0.9878565,0.0004228153,0.011327147,0.00018824311,0.000009779758],"about_ca_topic_score_codex":0.004380059,"about_ca_topic_score_gemma":0.0026793364,"teacher_disagreement_score":0.004405926,"about_ca_system_score_codex":0.0029591604,"about_ca_system_score_gemma":0.0011093995,"threshold_uncertainty_score":0.021470308},"labels":[],"label_agreement":null},{"id":"W2806586267","doi":"10.1007/978-3-319-93000-8_21","title":"Deep Convolutional-Shepard Interpolation Neural Networks for Image Classification Tasks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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 Ottawa","funders":"","keywords":"MNIST database; Computer science; Convolutional neural network; Deep learning; Artificial intelligence; Leverage (statistics); Contextual image classification; Artificial neural network; Interpolation (computer graphics); Deep neural networks; Pattern recognition (psychology); Architecture; Image (mathematics); Network architecture; Task (project management); Machine learning; Engineering","score_opus":0.025038890128839465,"score_gpt":0.27891772975235535,"score_spread":0.2538788396235159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806586267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030612603,0.004553172,0.9491174,0.0005333459,0.00034073918,0.00005986898,0.0007184654,0.0042345445,0.009829886],"genre_scores_gemma":[0.40490025,0.0044608656,0.5366948,0.000408908,0.0003267806,0.00014284096,0.003692876,0.00048191202,0.048890747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987054,0.000014887479,0.000007812896,0.000033681335,0.00004567766,0.00002734703],"domain_scores_gemma":[0.99980193,0.0000675829,0.000016791779,0.000042237807,0.000054570817,0.000016893002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029817218,0.0007619275,0.00048326576,0.00045054528,0.0002515518,0.0005523094,0.0012160091,0.0007657464,0.008251817],"category_scores_gemma":[0.00075308327,0.0003244374,0.0005587642,0.0009650408,0.0002949273,0.0009790424,0.00075538293,0.0015162432,0.0026361686],"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.00017846424,0.00011992965,0.00051937834,0.00022147392,0.00007115769,0.000066117216,0.000041680323,0.11050019,0.023009278,0.018705549,0.017979281,0.82858753],"study_design_scores_gemma":[0.0000073606984,0.000043273274,0.00026620753,0.00002110969,0.000020953205,0.000037915604,0.00001011933,0.97003525,0.009958973,0.011875924,0.0077140015,0.000008804999],"about_ca_topic_score_codex":0.005770228,"about_ca_topic_score_gemma":0.012184706,"teacher_disagreement_score":0.008251817,"about_ca_system_score_codex":0.000651528,"about_ca_system_score_gemma":0.0006793646,"threshold_uncertainty_score":0.027605057},"labels":[],"label_agreement":null},{"id":"W2806604911","doi":"10.1007/978-3-319-93000-8_50","title":"Transfer Learning Based Strategy for Improving Driver Distraction Recognition","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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 Waterloo","funders":"","keywords":"Distraction; Computer science; Robustness (evolution); Artificial intelligence; Transfer of learning; Machine learning; Phone; The Internet; Distracted driving","score_opus":0.043928753128117136,"score_gpt":0.2733580655882872,"score_spread":0.22942931246017004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806604911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11622377,0.0010233399,0.87118644,0.00019649795,0.0005831571,0.00022057699,0.00018680071,0.0043581193,0.0060212286],"genre_scores_gemma":[0.8153292,0.00040512247,0.17141595,0.00033277384,0.00018039766,0.0002163843,0.0004578604,0.00015601073,0.011506418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997845,0.000026326179,0.00001230487,0.00008133896,0.00005268011,0.000042809595],"domain_scores_gemma":[0.99970335,0.00008052584,0.000018061133,0.000035929537,0.00012966184,0.00003244088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031022076,0.00080310804,0.00068774656,0.00052532036,0.00027506976,0.00046184746,0.0009820065,0.00056819693,0.0060391095],"category_scores_gemma":[0.00075924175,0.00016151776,0.0004547299,0.00048754935,0.0001720317,0.00058626366,0.00071209477,0.0007588942,0.0017787413],"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.00042468114,0.0005759918,0.0007221652,0.00009033166,0.000059340746,0.00007319754,0.000044083667,0.012165416,0.0756011,0.0007300785,0.003701121,0.9058125],"study_design_scores_gemma":[0.000068946356,0.0007089438,0.004364342,0.00001846266,0.00012284852,0.0002716846,0.000062887884,0.9038928,0.085096434,0.0016804371,0.0036711346,0.00004098586],"about_ca_topic_score_codex":0.002585991,"about_ca_topic_score_gemma":0.0024662674,"teacher_disagreement_score":0.0060391095,"about_ca_system_score_codex":0.00026280046,"about_ca_system_score_gemma":0.00056208245,"threshold_uncertainty_score":0.020202816},"labels":[],"label_agreement":null},{"id":"W2806680626","doi":"10.1007/978-3-319-92058-0_85","title":"Artificial Intelligence and Predictive Justice: Limitations and Perspectives","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Law","field":"Social 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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Process (computing); Annotation; Artificial intelligence; Domain (mathematical analysis); Data science; Machine learning","score_opus":0.11225788389287408,"score_gpt":0.3438462295583844,"score_spread":0.23158834566551031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806680626","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.013273968,0.26672822,0.048906274,0.4364068,0.003055642,0.00005900428,0.0004991036,0.00021819482,0.23085287],"genre_scores_gemma":[0.794049,0.1272438,0.02159463,0.024939664,0.023166852,0.00026366388,0.00029673165,0.00023674584,0.008208803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.987837,0.007182469,0.0004002699,0.0011572487,0.0028459388,0.0005771207],"domain_scores_gemma":[0.8505166,0.13149355,0.003115934,0.006551849,0.006335305,0.0019867793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031956904,0.001513617,0.004198103,0.008473577,0.0041296515,0.018042384,0.0068791336,0.008871095,0.011263061],"category_scores_gemma":[0.05830891,0.0010527335,0.0010617559,0.009113121,0.045850795,0.03693422,0.008070405,0.013333088,0.0011457697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016229687,0.000025461783,0.0002518093,0.00014675962,0.000021832122,0.000021815325,0.00018974836,0.00063135696,0.000010176543,0.98025906,0.004881597,0.013544135],"study_design_scores_gemma":[0.000005348189,0.000003387322,0.00010009477,0.00016221919,0.000006315545,0.000015264108,0.000140214,0.0011149923,0.000016717388,0.99387485,0.0045517376,0.000008795972],"about_ca_topic_score_codex":0.007041926,"about_ca_topic_score_gemma":0.006841474,"teacher_disagreement_score":0.031956904,"about_ca_system_score_codex":0.006686511,"about_ca_system_score_gemma":0.006308112,"threshold_uncertainty_score":0.16900623},"labels":[],"label_agreement":null},{"id":"W2806692674","doi":"10.1007/978-3-319-96418-8_21","title":"A New Style of Mathematical Proof","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"","keywords":"Mathematical proof; Computer science; Proof assistant; Style (visual arts); Proof theory; Computer-assisted proof; Calculus (dental); Automated theorem proving; Theoretical computer science; Mathematics","score_opus":0.01740536563602675,"score_gpt":0.25391264512180994,"score_spread":0.2365072794857832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806692674","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.0014848341,0.010318091,0.6900095,0.01498143,0.0068134833,0.000069779344,0.0004773918,0.0009434773,0.27490196],"genre_scores_gemma":[0.13814057,0.02675269,0.54598814,0.018097328,0.023617735,0.0006287206,0.0009831924,0.0027548054,0.24303679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985049,0.0004460054,0.000098523175,0.00029278634,0.0005915474,0.000066254484],"domain_scores_gemma":[0.997681,0.0012979868,0.000086996864,0.00046498436,0.00038904083,0.000080064136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134049,0.0014061313,0.0008555264,0.0027242983,0.0015089989,0.004719955,0.002183934,0.0016184534,0.022959169],"category_scores_gemma":[0.006319423,0.0006992636,0.0015408715,0.001679076,0.007450414,0.011450339,0.0032905906,0.0079991985,0.010138759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073458427,0.00000953943,0.00002567166,0.00013560533,0.000009777244,0.00003245053,0.00013447512,0.00027184185,0.00033360545,0.95189524,0.02363596,0.02350844],"study_design_scores_gemma":[0.000009697489,0.000009539681,0.000038851227,0.000067782305,0.000008780892,0.00014972607,0.000023723247,0.00095775386,0.0003614413,0.860955,0.1374041,0.000013606858],"about_ca_topic_score_codex":0.00047280887,"about_ca_topic_score_gemma":0.00047321763,"teacher_disagreement_score":0.022959169,"about_ca_system_score_codex":0.001808888,"about_ca_system_score_gemma":0.0008178689,"threshold_uncertainty_score":0.07680607},"labels":[],"label_agreement":null},{"id":"W2806847404","doi":"10.1007/978-3-319-91397-1_42","title":"Strategies to Reduce Uncertainty on the Diagnosis Quality in the Context of Virtual Consultation: Reviews of Virtual Consultation Systems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Telemedicine and Telehealth Implementation","field":"Medicine","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":"Memorial University of Newfoundland","funders":"","keywords":"Context (archaeology); Quality (philosophy); Virtual patient; Process (computing); Computer science; Virtual reality; Certainty; Medicine; Medical education; Human–computer interaction","score_opus":0.08573642199934602,"score_gpt":0.3831739044149597,"score_spread":0.2974374824156137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806847404","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015560823,0.98241144,0.0024832366,0.010594829,0.0006216762,0.00010764927,0.00004545958,0.000033900527,0.002145714],"genre_scores_gemma":[0.061290156,0.9116318,0.018291378,0.0063894344,0.0010741692,0.0004146508,0.00011137103,0.000052405197,0.0007445461],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97505355,0.017067533,0.0024244164,0.0009564298,0.0039623943,0.00053574215],"domain_scores_gemma":[0.8257842,0.15678895,0.007627334,0.001329476,0.007340789,0.0011293875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03583747,0.0007711698,0.0020687338,0.00299037,0.0009843863,0.005520061,0.0032879375,0.0025820546,0.0047903927],"category_scores_gemma":[0.12801047,0.00062453304,0.002214073,0.0037031532,0.0021509512,0.0043738894,0.0031309193,0.0037629926,0.00050870946],"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.00044159387,0.00021948763,0.0008473752,0.052985974,0.00076147786,0.00005417117,0.0016315596,0.0011132002,0.00014356854,0.008815725,0.016087605,0.9168982],"study_design_scores_gemma":[0.0013539318,0.0024010404,0.017061258,0.3805641,0.008178392,0.0015568833,0.0063669123,0.0049528875,0.002213759,0.032246362,0.54266626,0.00043818407],"about_ca_topic_score_codex":0.0074162213,"about_ca_topic_score_gemma":0.013013856,"teacher_disagreement_score":0.03583747,"about_ca_system_score_codex":0.00588427,"about_ca_system_score_gemma":0.0144023085,"threshold_uncertainty_score":0.18952894},"labels":[],"label_agreement":null},{"id":"W2806898845","doi":"10.1007/978-3-319-92058-0_34","title":"Bayesian Learning of Finite Asymmetric Gaussian Mixtures","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gibbs sampling; Computer science; Mixture model; Gaussian; Bayesian probability; Artificial intelligence; Bayesian inference; Gaussian process; Contrast (vision); Importance sampling; Machine learning; Algorithm; Mathematics; Statistics; Monte Carlo method","score_opus":0.016545647833665494,"score_gpt":0.26141024296307325,"score_spread":0.24486459512940775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806898845","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.0023601847,0.00067967805,0.9936579,0.00018745895,0.00004513661,0.000009506877,0.000052564308,0.000120788376,0.0028867824],"genre_scores_gemma":[0.29088154,0.004992518,0.6794479,0.00038649852,0.00060892873,0.0002668258,0.0011164556,0.00051511446,0.02178432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998248,0.00080541265,0.00007970194,0.0003088556,0.00045765418,0.00010038402],"domain_scores_gemma":[0.99465525,0.004000904,0.00026032704,0.0004725999,0.0004669127,0.0001438946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388363,0.0009086421,0.0016163582,0.001129671,0.0005560059,0.002468591,0.0031093084,0.0019552603,0.0042121704],"category_scores_gemma":[0.015981251,0.001421925,0.0013446067,0.0015683449,0.0020924131,0.004326401,0.0029104247,0.0037503329,0.0013330025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010818522,0.000035619298,0.00030669448,0.00021434303,0.000073030664,0.000042375876,0.000175208,0.27350783,0.0013941783,0.60233796,0.0042806575,0.11752403],"study_design_scores_gemma":[0.000007717684,0.000007774884,0.00009786861,0.0000336754,0.000011216641,0.00003303083,0.000011272652,0.6498636,0.00039437664,0.3471112,0.0024094202,0.000018962908],"about_ca_topic_score_codex":0.0023847623,"about_ca_topic_score_gemma":0.0021881214,"teacher_disagreement_score":0.0042121704,"about_ca_system_score_codex":0.0014485898,"about_ca_system_score_gemma":0.00089036714,"threshold_uncertainty_score":0.0179196},"labels":[],"label_agreement":null},{"id":"W2806899243","doi":"10.1007/978-3-319-93031-2_35","title":"The WeightedCircuitsLmax Constraint","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Université Laval","funders":"","keywords":"Travelling salesman problem; Constraint (computer-aided design); Computer science; Mathematical optimization; Relaxation (psychology); Bounded function; Graph; Constraint satisfaction problem; Bottleneck traveling salesman problem; 2-opt; Mathematics; Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.01652795363498932,"score_gpt":0.24617602208944842,"score_spread":0.2296480684544591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806899243","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.0075681894,0.0019574866,0.5774182,0.001700646,0.001127438,0.00011083906,0.0015402875,0.00068278244,0.40789416],"genre_scores_gemma":[0.30987084,0.0063239024,0.21585059,0.0022428147,0.0009149702,0.0006121132,0.0034417335,0.0021422345,0.45860082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994272,0.000088849854,0.000024102781,0.00016755762,0.00020260479,0.00008974429],"domain_scores_gemma":[0.999514,0.0001606856,0.000033623633,0.0001291241,0.00013741467,0.00002528425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037875792,0.0010937867,0.0005563717,0.00051809056,0.0006758486,0.0018147236,0.0018894272,0.0010816942,0.060220987],"category_scores_gemma":[0.0016238171,0.00047042425,0.0005893509,0.0012097907,0.00068591355,0.0031006034,0.0015137856,0.0020572003,0.011030973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010195362,0.000053246153,0.000210122,0.0005989553,0.00003400819,0.0002747209,0.000057598412,0.029952697,0.011132294,0.67018664,0.064996846,0.22240095],"study_design_scores_gemma":[0.000027737815,0.0001011585,0.00039506488,0.00025482153,0.00006353513,0.0009106801,0.00006565601,0.07846173,0.016931398,0.43816918,0.46458623,0.00003276237],"about_ca_topic_score_codex":0.0012044837,"about_ca_topic_score_gemma":0.0030561164,"teacher_disagreement_score":0.060220987,"about_ca_system_score_codex":0.0008645266,"about_ca_system_score_gemma":0.0008732325,"threshold_uncertainty_score":0.20145929},"labels":[],"label_agreement":null},{"id":"W2806949166","doi":"10.1007/978-3-319-93031-2_17","title":"Accelerating Counting-Based Search","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint satisfaction problem; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Constraint programming; Variable (mathematics); Mathematical optimization; Constraint logic programming; Incremental heuristic search; Search algorithm; Theoretical computer science; Algorithm; Beam search; Artificial intelligence; Mathematics; Stochastic programming","score_opus":0.02864159094443126,"score_gpt":0.26373692640347246,"score_spread":0.2350953354590412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806949166","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.022875529,0.0012694005,0.9318381,0.0004985964,0.00047890094,0.00014992253,0.0003363402,0.0077237976,0.034829322],"genre_scores_gemma":[0.19292477,0.0005798972,0.77721447,0.00032460364,0.00019905133,0.0002632594,0.0013539065,0.00122403,0.02591599],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843043,0.00023991743,0.0000685653,0.00027591633,0.00074655586,0.00023864546],"domain_scores_gemma":[0.9976472,0.001151439,0.0001269199,0.000555905,0.00039031106,0.00012822899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094301754,0.0013326101,0.0017432692,0.0020995191,0.0010175344,0.0020457911,0.0038527423,0.001630818,0.020022225],"category_scores_gemma":[0.006318818,0.00083733647,0.0011696891,0.0038200154,0.0008724773,0.0032790408,0.0029815587,0.002447273,0.004486265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047066,0.0003075334,0.00056239613,0.00036263478,0.000077329474,0.000069903675,0.00010853122,0.12594534,0.010070754,0.10743195,0.038724996,0.71586806],"study_design_scores_gemma":[0.00006605833,0.00008420152,0.00022302492,0.000048879512,0.000038298702,0.00010447646,0.000026566966,0.91537297,0.0047014295,0.06887327,0.010437837,0.000022907965],"about_ca_topic_score_codex":0.004899662,"about_ca_topic_score_gemma":0.007325077,"teacher_disagreement_score":0.020022225,"about_ca_system_score_codex":0.0016573833,"about_ca_system_score_gemma":0.0019036008,"threshold_uncertainty_score":0.06698096},"labels":[],"label_agreement":null},{"id":"W2807011628","doi":"10.1007/978-3-319-92997-2_13","title":"Life Sciences-Inspired Test Case Similarity Measures for Search-Based, FSM-Based Software Testing","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Test suite; Computer science; Suite; Intuition; Diversity (politics); Machine learning; Fault detection and isolation; Random testing; Software; Test case; Test (biology); Artificial intelligence; Data mining; Software engineering; Programming language; Psychology","score_opus":0.08310386132228398,"score_gpt":0.3036598676674446,"score_spread":0.22055600634516065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807011628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09374949,0.0020933598,0.895611,0.00027784356,0.00011092103,0.0001986056,0.00036030132,0.0011752049,0.0064232918],"genre_scores_gemma":[0.64313656,0.0004012858,0.3536174,0.00010531199,0.000089222216,0.00020675598,0.00090485153,0.00015369036,0.0013849993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968894,0.00074597937,0.00024404639,0.0003438292,0.0016576457,0.00011896468],"domain_scores_gemma":[0.9927799,0.0039876215,0.0008856324,0.00075816055,0.0013369285,0.00025170355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001758412,0.00067086343,0.0010393847,0.0048827752,0.0004436348,0.001416968,0.001410924,0.0009812785,0.0016391425],"category_scores_gemma":[0.015357227,0.00020889204,0.0008695459,0.0030142013,0.00078803534,0.002056699,0.0012838733,0.0009997555,0.0003335356],"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.0004276684,0.0005823003,0.011632025,0.000678305,0.00026200962,0.0002183824,0.00033063933,0.1582868,0.022037398,0.08115918,0.0045502693,0.71983504],"study_design_scores_gemma":[0.000021221,0.00029620534,0.0052060974,0.00006544762,0.000056715107,0.00035788913,0.00008310204,0.9249686,0.0075053424,0.058190446,0.003220571,0.000028348077],"about_ca_topic_score_codex":0.0010058518,"about_ca_topic_score_gemma":0.0012222193,"teacher_disagreement_score":0.0048827752,"about_ca_system_score_codex":0.0016273771,"about_ca_system_score_gemma":0.000900273,"threshold_uncertainty_score":0.011807442},"labels":[],"label_agreement":null},{"id":"W2807041493","doi":"10.1007/978-3-319-93000-8_33","title":"Lp Norm Relaxation Approach for Large Scale Data Analysis: A Review","year":2018,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Signal processing; Artificial intelligence; Sparse approximation; Representation (politics); Scale (ratio); Relaxation (psychology); Image processing; Artificial neural network; Theoretical computer science; Machine learning; Pattern recognition (psychology); Algorithm; Image (mathematics)","score_opus":0.061612878194012635,"score_gpt":0.33194990885863646,"score_spread":0.27033703066462383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807041493","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006257912,0.9127807,0.082620904,0.0012197562,0.0005002171,0.000032099168,0.0001289131,0.00012006813,0.0019715936],"genre_scores_gemma":[0.006188024,0.94828266,0.042299647,0.0005611445,0.0013568786,0.000057409376,0.00025518695,0.000060426377,0.0009386958],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992735,0.0001556494,0.00008927783,0.00018262194,0.00026283992,0.000036224737],"domain_scores_gemma":[0.99668485,0.0024214543,0.00016986513,0.00014769261,0.0005026112,0.00007351853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021956563,0.0015093718,0.002149308,0.0017120342,0.00029336667,0.0019052831,0.0018852807,0.0016766893,0.0036254076],"category_scores_gemma":[0.0053087617,0.0007335631,0.0010240322,0.004575421,0.0011399172,0.0026737067,0.001498814,0.0024117678,0.0019361997],"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.000078754296,0.0001062693,0.0002934587,0.010732441,0.00019378388,0.00013649804,0.00006541488,0.0062710163,0.0017557235,0.01525119,0.022079295,0.943036],"study_design_scores_gemma":[0.00013199942,0.00056122337,0.0026019511,0.008928127,0.0007346773,0.0034504868,0.00042606928,0.07277844,0.006135144,0.11308161,0.79086643,0.0003038672],"about_ca_topic_score_codex":0.0011823649,"about_ca_topic_score_gemma":0.001157311,"teacher_disagreement_score":0.0036254076,"about_ca_system_score_codex":0.00041224502,"about_ca_system_score_gemma":0.0013793468,"threshold_uncertainty_score":0.012128174},"labels":[],"label_agreement":null},{"id":"W2807100137","doi":"10.1007/978-3-319-92049-8_30","title":"Comparison of Feedback Modes for the Visually Impaired: Vibration vs. Audio","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"York University","funders":"","keywords":"Audio feedback; Computer science; Usability; Visually impaired; Human–computer interaction; Vibration; Set (abstract data type); Visual feedback; Interface (matter); Mobile device; Multimedia; Haptic technology; Speech recognition; Simulation; Computer vision; Acoustics; World Wide Web","score_opus":0.06195086531953108,"score_gpt":0.3376548411869179,"score_spread":0.2757039758673868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807100137","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.9004715,0.037377268,0.03579936,0.0009799603,0.0008130322,0.00030673816,0.002085022,0.0005963419,0.021570804],"genre_scores_gemma":[0.9712,0.007627191,0.013213004,0.00019635996,0.00012726296,0.00014686555,0.0005143468,0.0001261165,0.0068488433],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994968,0.000117118405,0.000048252637,0.000055724988,0.0002190605,0.00006290822],"domain_scores_gemma":[0.99714714,0.002169807,0.00011000589,0.000076126365,0.00036886294,0.00012814492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038213,0.0007302333,0.0006894022,0.0010241723,0.00019658054,0.0011141887,0.00082932884,0.0009068055,0.025285406],"category_scores_gemma":[0.006386408,0.00014938417,0.00065503205,0.00033479463,0.00029813577,0.0009970816,0.0007164205,0.00038853326,0.0015843388],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.028498372,0.00065596617,0.0063144206,0.0039790007,0.00022822918,0.00024251698,0.0005393904,0.001901987,0.09638284,0.0009268505,0.0032284693,0.857102],"study_design_scores_gemma":[0.0058459113,0.11357227,0.49682888,0.009244405,0.005225104,0.009985818,0.013265103,0.033124417,0.24688199,0.019844687,0.04554766,0.0006337679],"about_ca_topic_score_codex":0.0010883927,"about_ca_topic_score_gemma":0.0012245715,"teacher_disagreement_score":0.025285406,"about_ca_system_score_codex":0.00025024448,"about_ca_system_score_gemma":0.00038020845,"threshold_uncertainty_score":0.08458805},"labels":[],"label_agreement":null},{"id":"W2807175981","doi":"10.1007/978-3-319-92049-8_12","title":"Evaluating Devices for Object Rotation in 3D","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Joystick; Computer science; Mobile phone; Phone; Metric (unit); Fitts's law; Task (project management); Accelerometer; Word error rate; Simulation; Rotation (mathematics); Real-time computing; Computer vision; Artificial intelligence; Telecommunications; Engineering; Operating system","score_opus":0.04218061562922189,"score_gpt":0.3389258962258738,"score_spread":0.29674528059665195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807175981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4086734,0.0034357551,0.5462318,0.00034009435,0.00054272753,0.0010027533,0.002229633,0.007129608,0.030414257],"genre_scores_gemma":[0.7913131,0.0015685183,0.19669284,0.00013684128,0.00008721044,0.0005541792,0.0026636191,0.00095428084,0.0060293917],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99554294,0.0014531378,0.00030529217,0.0005613389,0.0018881148,0.00024921002],"domain_scores_gemma":[0.9813091,0.013243927,0.001147012,0.002219272,0.0017649846,0.00031572595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029368685,0.001806105,0.0010363963,0.0017963508,0.00036991306,0.0030967735,0.0015656824,0.0014186855,0.016025718],"category_scores_gemma":[0.02926634,0.000535898,0.0007807037,0.0013221268,0.0007867354,0.0035159895,0.0029950521,0.00051349006,0.003991152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006805908,0.00045605004,0.00968994,0.001692432,0.00023017018,0.00018852473,0.0014469596,0.016990116,0.099866115,0.008305054,0.007270373,0.8470583],"study_design_scores_gemma":[0.0013488976,0.015613224,0.09484697,0.002011748,0.0015150999,0.0024250513,0.005206868,0.5074967,0.28375554,0.03012382,0.054970596,0.0006854583],"about_ca_topic_score_codex":0.000895873,"about_ca_topic_score_gemma":0.00085776375,"teacher_disagreement_score":0.016025718,"about_ca_system_score_codex":0.0004418799,"about_ca_system_score_gemma":0.00040939008,"threshold_uncertainty_score":0.053611398},"labels":[],"label_agreement":null},{"id":"W2807235542","doi":"10.1007/978-3-030-00931-1_64","title":"Dilatation of Lateral Ventricles with Brain Volumes in Infants with 3D Transfontanelle US","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fetal and Pediatric Neurological Disorders","field":"Medicine","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":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine; Polytechnique Montréal","funders":"","keywords":"Lateral ventricles; Computer science; Anatomy; Medicine","score_opus":0.009400530348122289,"score_gpt":0.22320906076311703,"score_spread":0.21380853041499473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807235542","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.9387444,0.017270671,0.014380283,0.0017503797,0.00042286052,0.000062639854,0.00082174625,0.0007064196,0.02584058],"genre_scores_gemma":[0.982726,0.005006747,0.0076077287,0.00028171882,0.00046095398,0.000040351682,0.00025998015,0.00010073073,0.0035157944],"study_design_codex":"case_report","study_design_gemma":"observational","domain_scores_codex":[0.9997845,0.000032221935,0.000030702053,0.00004874972,0.00006642151,0.000037367547],"domain_scores_gemma":[0.9995252,0.00022816384,0.00013192522,0.00003999688,0.00003260001,0.000042138097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031897696,0.00069931516,0.00033940256,0.0009637759,0.00015493983,0.0006019917,0.0004075939,0.0006273552,0.0021670577],"category_scores_gemma":[0.0021489123,0.00024088917,0.00038661383,0.0004617273,0.000780688,0.00064115814,0.000578092,0.0007651596,0.000370952],"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.000649256,0.00012841178,0.15259361,0.0004394303,0.000088207235,0.5314226,0.0014856298,0.0021234157,0.046077494,0.0061483104,0.007292135,0.2515515],"study_design_scores_gemma":[0.00001401731,0.00033188562,0.13251783,0.00022308642,0.00008342994,0.838964,0.00038401462,0.0029393458,0.014867608,0.0031736137,0.006444821,0.000056385128],"about_ca_topic_score_codex":0.0008357251,"about_ca_topic_score_gemma":0.00073566043,"teacher_disagreement_score":0.0021670577,"about_ca_system_score_codex":0.00033785944,"about_ca_system_score_gemma":0.00031601,"threshold_uncertainty_score":0.0072494745},"labels":[],"label_agreement":null},{"id":"W2807246881","doi":"10.1007/978-3-319-91244-8_45","title":"What Drives the Perceived Credibility of Mobile Websites: Classical or Expressive Aesthetics?","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Dalhousie University; University of Saskatchewan","funders":"","keywords":"Credibility; CLARITY; Novelty; Aesthetics; Simplicity; Computer science; Psychology; Social psychology; Art; Epistemology; Philosophy","score_opus":0.025432275685296483,"score_gpt":0.2915259773265685,"score_spread":0.266093701641272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807246881","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.86158687,0.0010196178,0.010590312,0.004593063,0.00013082018,0.00004122918,0.00018145546,0.00010627493,0.121750385],"genre_scores_gemma":[0.99777967,0.00011907933,0.00074276526,0.00006730536,0.000043249132,0.0000059698464,0.00002530386,0.000033180222,0.0011834943],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998809,0.0004781593,0.00005185726,0.00014475385,0.00041743097,0.00009880718],"domain_scores_gemma":[0.97636956,0.017569957,0.0025502322,0.0008020874,0.0017578731,0.0009502279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022185452,0.00031389165,0.00025788468,0.0012583499,0.0005530271,0.009349149,0.0005486476,0.0020424626,0.010260653],"category_scores_gemma":[0.036436435,0.00028548716,0.0002483797,0.0010656096,0.0025039383,0.0063274587,0.0010787479,0.001799501,0.0011656615],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016092628,0.0007477881,0.32091486,0.0019531166,0.00031251324,0.0019755268,0.12671907,0.0037737011,0.02462952,0.25139108,0.010359589,0.25561404],"study_design_scores_gemma":[0.00020040837,0.00068877207,0.5641641,0.0014304883,0.0004202252,0.0028212194,0.11582622,0.03982929,0.008555805,0.2310326,0.034673236,0.00035758349],"about_ca_topic_score_codex":0.0009826266,"about_ca_topic_score_gemma":0.000863266,"teacher_disagreement_score":0.010260653,"about_ca_system_score_codex":0.00081278785,"about_ca_system_score_gemma":0.00041109262,"threshold_uncertainty_score":0.034325242},"labels":[],"label_agreement":null},{"id":"W2807264637","doi":"10.1007/978-3-319-93031-2_30","title":"Modelling and Solving the Senior Transportation Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mathematical optimization; Decomposition; Integer programming; Heuristic; Transportation theory; Routing (electronic design automation); Operations research; Profit (economics); Heuristics; Constraint (computer-aided design); Artificial intelligence; Algorithm; Mathematics","score_opus":0.017596636783663223,"score_gpt":0.2364923174511141,"score_spread":0.21889568066745088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807264637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028572157,0.001650806,0.8961756,0.0021179584,0.0003754758,0.000058551694,0.0006710639,0.00021793466,0.070160545],"genre_scores_gemma":[0.60077465,0.0043087336,0.2565726,0.00040312656,0.00048884354,0.00025504138,0.002310745,0.0003563083,0.1345299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.000121172015,0.00001686465,0.00007647057,0.00006549276,0.00006240655],"domain_scores_gemma":[0.9997104,0.00012476087,0.000036275673,0.000031201194,0.00005450362,0.000042948395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058589247,0.0008294383,0.0007225988,0.00048452563,0.0005408567,0.0018761337,0.001128304,0.0015400046,0.009966363],"category_scores_gemma":[0.0017138484,0.00044015583,0.0010746327,0.0011534244,0.0007170543,0.0021903715,0.0013422737,0.0014017245,0.001545481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041784562,0.00005246599,0.0006015296,0.00017185112,0.000028039776,0.000105395884,0.0001329056,0.4917316,0.00057829317,0.437753,0.016135648,0.05266755],"study_design_scores_gemma":[0.000010804572,0.000029605784,0.0002078734,0.000039616993,0.000010544506,0.00006982916,0.00008892504,0.66930854,0.00029898615,0.30116397,0.028757103,0.000014152154],"about_ca_topic_score_codex":0.008225892,"about_ca_topic_score_gemma":0.0064511183,"teacher_disagreement_score":0.009966363,"about_ca_system_score_codex":0.0010780242,"about_ca_system_score_gemma":0.0014488485,"threshold_uncertainty_score":0.03334081},"labels":[],"label_agreement":null},{"id":"W2807276737","doi":"10.1007/978-3-319-92058-0_28","title":"Transformation Between CP-net and CPC-net","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Net (polyhedron); Preference; Computer science; Transformation (genetics); The Internet; Mathematical optimization; Artificial intelligence; Operations research; Mathematics; Statistics; World Wide Web; Geometry","score_opus":0.015172127370351129,"score_gpt":0.23644143616566307,"score_spread":0.22126930879531195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807276737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009648814,0.00019788404,0.91705227,0.00039512888,0.0005580339,0.00029371507,0.0018721496,0.0075909216,0.062391125],"genre_scores_gemma":[0.17083952,0.0005827271,0.7711291,0.0005372103,0.00016424131,0.00062315405,0.007896085,0.0044122734,0.043815788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933225,0.000071153634,0.000044150474,0.00015674063,0.00031050987,0.000085135216],"domain_scores_gemma":[0.9995547,0.00010447187,0.000021823253,0.00014154334,0.00014613545,0.000031338957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044992918,0.00054679665,0.00040009624,0.000961451,0.0006459398,0.001605566,0.0013285669,0.0004276832,0.012960695],"category_scores_gemma":[0.0015791203,0.00034087477,0.0011240585,0.0011395568,0.00064754265,0.0019636415,0.0018659311,0.0019101796,0.0037699614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002793259,0.0002812572,0.00069386704,0.000664253,0.000073676354,0.0006978249,0.0002672147,0.029937448,0.017207673,0.5030745,0.038429596,0.40839323],"study_design_scores_gemma":[0.00009480375,0.00008299426,0.00067675207,0.00013983373,0.000119119264,0.00084690476,0.00018382752,0.1395454,0.037673414,0.47138277,0.34919664,0.000057578363],"about_ca_topic_score_codex":0.003256623,"about_ca_topic_score_gemma":0.0035146633,"teacher_disagreement_score":0.012960695,"about_ca_system_score_codex":0.00085159973,"about_ca_system_score_gemma":0.0016772097,"threshold_uncertainty_score":0.04335785},"labels":[],"label_agreement":null},{"id":"W2807368023","doi":"10.1007/978-3-319-93417-4_44","title":"Optimizing Semantic Reasoning on Memory-Constrained Platforms Using the RETE Algorithm","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Semantic Web; Ontology; Mobile device; Leverage (statistics); Scalability; Semantics (computer science); Pooling; Artificial intelligence; Database; Programming language; World Wide Web","score_opus":0.02819637786769626,"score_gpt":0.26027225228071166,"score_spread":0.2320758744130154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807368023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052932438,0.0007145143,0.9266131,0.0009852287,0.00018242045,0.00023673718,0.00071554974,0.0068574166,0.010762612],"genre_scores_gemma":[0.34118038,0.00030125378,0.64774907,0.00026475568,0.00009159192,0.00017165348,0.001594642,0.0014064228,0.007240272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971577,0.0007811601,0.000184257,0.0006655364,0.0007287617,0.00048262515],"domain_scores_gemma":[0.99480575,0.0033661223,0.00017621976,0.0010612807,0.00045675598,0.00013376655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363278,0.0017003153,0.0022513513,0.0016640351,0.0015081313,0.0042597475,0.0032756003,0.0024947869,0.011529247],"category_scores_gemma":[0.012073204,0.0014312542,0.0031542971,0.0020916138,0.001760728,0.009205128,0.0040330733,0.0033457314,0.0021230136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007313287,0.0005021552,0.0011498154,0.0005550967,0.00029267417,0.00041157645,0.00028175316,0.5886205,0.0060501024,0.108128816,0.016867466,0.2764088],"study_design_scores_gemma":[0.000051770854,0.000023561095,0.00007720908,0.00002161331,0.00004619713,0.000039623555,0.00007450483,0.89401376,0.0016971587,0.10266632,0.0012750425,0.000013269292],"about_ca_topic_score_codex":0.010641641,"about_ca_topic_score_gemma":0.023052676,"teacher_disagreement_score":0.011529247,"about_ca_system_score_codex":0.0021353585,"about_ca_system_score_gemma":0.0029560402,"threshold_uncertainty_score":0.038569152},"labels":[],"label_agreement":null},{"id":"W2807385899","doi":"10.1007/978-3-319-93031-2_34","title":"A $$O(n \\log ^2 n)$$ Checker and $$O(n^2 \\log n)$$ Filtering Algorithm for the Energetic Reasoning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Satisfiability; Computer science; Binary logarithm; Interval (graph theory); Algorithm; Time complexity; Process (computing); State (computer science); Running time; Constraint (computer-aided design); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Programming language","score_opus":0.0145130423926603,"score_gpt":0.23915709428527634,"score_spread":0.22464405189261605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807385899","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.003047994,0.00028346718,0.9454771,0.0012977911,0.00053991826,0.00032939643,0.0009999516,0.012463477,0.035560872],"genre_scores_gemma":[0.03590629,0.00023049384,0.9304308,0.0007934988,0.00025936234,0.0003623116,0.0022280049,0.0021007587,0.027688464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692947,0.00051516434,0.00018618698,0.00090861943,0.0011301661,0.00033036675],"domain_scores_gemma":[0.99512154,0.0021280104,0.00012052618,0.0018401821,0.00065278116,0.00013694158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024109993,0.0034780125,0.002242692,0.0028518927,0.003203715,0.0052078385,0.0073024146,0.0032101949,0.10326103],"category_scores_gemma":[0.009651046,0.001681859,0.005948962,0.0029358002,0.0021090263,0.009850261,0.005792805,0.006717998,0.030241145],"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.0006495136,0.00040999157,0.0005717061,0.00058796274,0.0001777237,0.00014680499,0.00012464503,0.016630186,0.009209064,0.21718104,0.10477993,0.6495314],"study_design_scores_gemma":[0.0003564529,0.00008125583,0.0006650816,0.0002050176,0.00021250082,0.00029027433,0.00014930988,0.39651614,0.011605526,0.5197875,0.07002865,0.00010224591],"about_ca_topic_score_codex":0.007836705,"about_ca_topic_score_gemma":0.015246116,"teacher_disagreement_score":0.10326103,"about_ca_system_score_codex":0.0034548268,"about_ca_system_score_gemma":0.0041960347,"threshold_uncertainty_score":0.34544253},"labels":[],"label_agreement":null},{"id":"W2807512355","doi":"10.1007/978-3-319-92058-0_29","title":"Online Detection of Shill Bidding Fraud Based on Machine Learning Techniques","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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","funders":"","keywords":"Bidding; Computer science; Common value auction; Support vector machine; Classifier (UML); Artificial intelligence; Machine learning; Data mining; Business","score_opus":0.019769815373298513,"score_gpt":0.2634754865622676,"score_spread":0.24370567118896908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807512355","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.83667034,0.0026368306,0.1422707,0.0020768552,0.00053984934,0.00031202452,0.0018867991,0.0025736291,0.011033057],"genre_scores_gemma":[0.9779269,0.00021699954,0.01792306,0.00010315065,0.00019399436,0.000039006965,0.0011408676,0.000023179886,0.0024328781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981421,0.00046968408,0.00012185809,0.00027802182,0.0006846185,0.0003037217],"domain_scores_gemma":[0.99547714,0.0017264868,0.000969726,0.00046984968,0.0009655411,0.00039123755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022371993,0.0007849726,0.0014552557,0.0030179294,0.00052113604,0.0017648394,0.0013333516,0.0009879204,0.002089986],"category_scores_gemma":[0.0065222587,0.00025175358,0.00046706773,0.0016377049,0.0003181973,0.0021035653,0.00077923795,0.0012581139,0.0012959279],"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.0024693199,0.0035484068,0.25745872,0.00028992604,0.00041402434,0.0010821477,0.00016631492,0.046154168,0.0105076535,0.0068683373,0.040509887,0.63053113],"study_design_scores_gemma":[0.000045570923,0.00023331032,0.020466084,0.00001946415,0.000043182816,0.0005243426,0.00010316212,0.9693377,0.0029043404,0.0045672,0.0017315159,0.000024073739],"about_ca_topic_score_codex":0.0013268788,"about_ca_topic_score_gemma":0.0018537686,"teacher_disagreement_score":0.0030179294,"about_ca_system_score_codex":0.0006636603,"about_ca_system_score_gemma":0.0007189627,"threshold_uncertainty_score":0.011831582},"labels":[],"label_agreement":null},{"id":"W2807530468","doi":"10.1007/978-3-030-04375-9_32","title":"A Simplified Active Calibration Algorithm for Focal Length Estimation","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Focal length; Panning (audio); Camera auto-calibration; Camera resectioning; Calibration; Computer vision; Artificial intelligence; Computer science; Point (geometry); Rotation (mathematics); Camera matrix; Pinhole camera model; Algorithm; Mathematics; Optics; Geometry; Physics; Zoom","score_opus":0.021242914607434306,"score_gpt":0.3177181798857376,"score_spread":0.29647526527830326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807530468","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.0007407259,0.0001174734,0.998018,0.000029711955,0.000028809076,0.000016036516,0.000036648624,0.00039551934,0.0006171206],"genre_scores_gemma":[0.021900022,0.00028316877,0.97337997,0.000070374386,0.000058331563,0.00008875072,0.0003121405,0.00018569884,0.0037215927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912685,0.00009924146,0.00003974198,0.00018179638,0.0004971653,0.000055238404],"domain_scores_gemma":[0.99937576,0.00012843941,0.000043237007,0.00018657053,0.00024066435,0.000025382555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058280997,0.0011296071,0.0012363979,0.0012732095,0.0004880634,0.0016830916,0.0019098051,0.0019170165,0.009996756],"category_scores_gemma":[0.0020162612,0.00090981723,0.0011180105,0.001545384,0.00042226407,0.0017366862,0.0016809738,0.0018992707,0.007476677],"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.00016160787,0.00007408677,0.00032659792,0.00021384486,0.0000780427,0.00009089221,0.0001019009,0.049916975,0.09104074,0.016161181,0.0056608454,0.83617336],"study_design_scores_gemma":[0.00005811833,0.00010996993,0.0010407103,0.00004384258,0.000082391634,0.000741535,0.000038668957,0.9034484,0.04432582,0.013691815,0.036330733,0.00008796444],"about_ca_topic_score_codex":0.0024610464,"about_ca_topic_score_gemma":0.0033393453,"teacher_disagreement_score":0.009996756,"about_ca_system_score_codex":0.0005086736,"about_ca_system_score_gemma":0.0011312104,"threshold_uncertainty_score":0.033442438},"labels":[],"label_agreement":null},{"id":"W2807533047","doi":"10.1007/978-3-319-93000-8_34","title":"A Diffusion-Based Two-Dimensional Empirical Mode Decomposition (EMD) Algorithm for Image Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Fault Diagnosis Techniques","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":"University of Waterloo","funders":"","keywords":"Hilbert–Huang transform; Algorithm; Computer science; Maxima and minima; Computation; Signal processing; Image processing; Envelope (radar); Interpolation (computer graphics); SIGNAL (programming language); Noise (video); Image (mathematics); Artificial intelligence; Mathematics; Computer vision; Filter (signal processing); Digital signal processing","score_opus":0.010732116906070123,"score_gpt":0.33912354261942007,"score_spread":0.32839142571334995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807533047","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.00080057303,0.00013546109,0.998442,0.000051493793,0.00003308533,0.000014852902,0.00003562669,0.00022699185,0.0002599813],"genre_scores_gemma":[0.012392767,0.00028263874,0.9851398,0.000053076525,0.000029350354,0.00006789743,0.00019462914,0.00013647223,0.0017034027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996049,0.00008626422,0.000031910673,0.00008138998,0.00017192769,0.000023580493],"domain_scores_gemma":[0.9991394,0.00034964798,0.000052819873,0.00012935261,0.00029862658,0.000030211599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089349033,0.0008019762,0.0008093898,0.0007977429,0.00035765345,0.0010312506,0.0011970698,0.0011623938,0.004321798],"category_scores_gemma":[0.0027261234,0.00040832325,0.0010131636,0.0010887183,0.000401832,0.0012214652,0.0012103913,0.001593623,0.0025786157],"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.00014934858,0.00010141026,0.00033026477,0.00025980792,0.00007774838,0.000059214282,0.000088983696,0.0524816,0.04689581,0.016970113,0.008121774,0.8744639],"study_design_scores_gemma":[0.000011948281,0.000034430694,0.0003246215,0.000019593357,0.000018099976,0.00013909528,0.0000148251875,0.976438,0.011400489,0.005464894,0.0061101876,0.000023810107],"about_ca_topic_score_codex":0.0014046557,"about_ca_topic_score_gemma":0.0020673473,"teacher_disagreement_score":0.004321798,"about_ca_system_score_codex":0.00035882983,"about_ca_system_score_gemma":0.0007530606,"threshold_uncertainty_score":0.014457822},"labels":[],"label_agreement":null},{"id":"W2807619770","doi":"10.1007/978-3-319-92058-0_67","title":"Reliability-Aware Routing of AVB Streams in TSN Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Redundancy (engineering); Jitter; Reliability (semiconductor); Real-time computing; Bandwidth (computing); Computer network; Routing (electronic design automation); Distributed computing; Telecommunications","score_opus":0.009302986504046203,"score_gpt":0.22617573335978194,"score_spread":0.21687274685573574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807619770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079089336,0.0031874261,0.90523624,0.00053919555,0.0004354097,0.00012463401,0.00019018467,0.0016374497,0.009560114],"genre_scores_gemma":[0.8827247,0.0015901632,0.10769972,0.00013769756,0.00021158242,0.00007557849,0.0002908404,0.00023700786,0.007032595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996884,0.000074712334,0.000021136724,0.00005830073,0.000110270565,0.00004723832],"domain_scores_gemma":[0.9989599,0.00037716507,0.000083423074,0.00015369013,0.00037028987,0.000055543456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080107764,0.0005222054,0.0005671284,0.0005815906,0.000555015,0.0012130147,0.0011017219,0.00043014297,0.0018092566],"category_scores_gemma":[0.002450594,0.00029016193,0.00024062567,0.00057562086,0.00034181325,0.0010146376,0.00077856885,0.00078121014,0.00047903642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006225702,0.00009367271,0.0015257577,0.00036687538,0.00007781427,0.0002970424,0.0003981115,0.49971175,0.054324716,0.04349771,0.012952505,0.38613155],"study_design_scores_gemma":[0.000010721322,0.00008335663,0.00021643243,0.00003376963,0.00003055307,0.00011483683,0.00007407016,0.97068864,0.007655599,0.015945895,0.005132447,0.000013728639],"about_ca_topic_score_codex":0.0019013127,"about_ca_topic_score_gemma":0.003057577,"teacher_disagreement_score":0.0019013127,"about_ca_system_score_codex":0.0008897663,"about_ca_system_score_gemma":0.0005333351,"threshold_uncertainty_score":0.0064557195},"labels":[],"label_agreement":null},{"id":"W2807702307","doi":"10.1007/978-3-030-05378-9_9","title":"A Note on the Security of CSIDH","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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 Calgary","funders":"","keywords":"Polynomial; Order (exchange); Discriminant; Combinatorics; Isogeny; Quadratic equation; Quantum algorithm; Quantum; Physics; Discrete mathematics; Mathematics; Computer science; Quantum mechanics; Mathematical analysis; Geometry; Abelian group","score_opus":0.012574671355258554,"score_gpt":0.2371504162932194,"score_spread":0.22457574493796084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807702307","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.01769113,0.06504815,0.12825613,0.04634245,0.014150207,0.00013557126,0.0008992289,0.0007345539,0.7267426],"genre_scores_gemma":[0.62819153,0.06962923,0.06689777,0.011529624,0.016292507,0.00030623854,0.0011676049,0.0006367075,0.20534877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764484,0.00051404204,0.00013844427,0.0003534514,0.0010111547,0.00033812286],"domain_scores_gemma":[0.99510396,0.0029632295,0.00010244764,0.001270112,0.0004386707,0.00012154187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022271741,0.0010684986,0.0012557763,0.0014800619,0.0019841017,0.005006803,0.0014502275,0.0019333712,0.01102596],"category_scores_gemma":[0.0062850397,0.00069927884,0.0010002194,0.002342535,0.0074567073,0.009531894,0.005079073,0.011839562,0.005601191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008514738,0.00001581661,0.000069713984,0.00019188678,0.000016459098,0.00007441333,0.00016873481,0.0013680423,0.0008763815,0.94180924,0.022114877,0.033209223],"study_design_scores_gemma":[0.0000227712,0.000038380313,0.00010250164,0.00017601196,0.000017245053,0.00021176923,0.00007220362,0.0021655892,0.0018394111,0.8747663,0.12055971,0.000028101174],"about_ca_topic_score_codex":0.0016979405,"about_ca_topic_score_gemma":0.0008402558,"teacher_disagreement_score":0.01102596,"about_ca_system_score_codex":0.003846724,"about_ca_system_score_gemma":0.0022615402,"threshold_uncertainty_score":0.0368855},"labels":[],"label_agreement":null},{"id":"W2807710859","doi":"10.1007/978-3-030-00934-2_104","title":"Direct Automated Quantitative Measurement of Spine via Cascade Amplifier Regression Network","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","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":"Western University","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Overfitting; Cascade; Pattern recognition (psychology); Feature selection; Embedding; Medical diagnosis; Artificial neural network; Medicine; Radiology; Engineering","score_opus":0.025330097963411884,"score_gpt":0.2688551252369892,"score_spread":0.2435250272735773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807710859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025738904,0.00057413,0.9672939,0.00013446716,0.00007798515,0.0000825004,0.00031002617,0.0020185402,0.0037694362],"genre_scores_gemma":[0.4573475,0.0009854389,0.53147525,0.00020431692,0.00012509174,0.0002062952,0.00052623113,0.00029182987,0.008838069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995498,0.00006100377,0.000013214083,0.00012596411,0.00021590374,0.000034014418],"domain_scores_gemma":[0.9996995,0.000102518425,0.00003644463,0.000039849187,0.000111551206,0.000010215365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036673268,0.0010092595,0.0005516599,0.0006825384,0.0002951543,0.0007140573,0.0010461186,0.00082490256,0.004173537],"category_scores_gemma":[0.00094755855,0.00046207185,0.00038342612,0.00076319044,0.00028390987,0.00084361556,0.0007224277,0.00055163173,0.0020737406],"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.00032436542,0.00008867217,0.0029011765,0.0003631955,0.00009838722,0.00015302355,0.00011951381,0.019916397,0.45544052,0.0024789225,0.0038652762,0.5142506],"study_design_scores_gemma":[0.00004427803,0.00046885194,0.015538361,0.00010532988,0.00018952292,0.0013350605,0.00009311318,0.7377854,0.22844258,0.005359901,0.010523465,0.00011420221],"about_ca_topic_score_codex":0.0018861432,"about_ca_topic_score_gemma":0.006009372,"teacher_disagreement_score":0.004173537,"about_ca_system_score_codex":0.00036178296,"about_ca_system_score_gemma":0.00051142555,"threshold_uncertainty_score":0.013961911},"labels":[],"label_agreement":null},{"id":"W2807854674","doi":"10.1007/978-3-319-93713-7_8","title":"Efficient Linearly and Unconditionally Energy Stable Schemes for the Phase Field Model of Solid-State Dewetting Problems","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Solidification and crystal growth phenomena","field":"Materials 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 Calgary","funders":"","keywords":"Discretization; Backward Euler method; Euler method; Dewetting; Applied mathematics; Phase field models; Finite element method; Scalar (mathematics); Numerical analysis; Mathematics; Computer science; Euler's formula; Mathematical analysis; Phase (matter); Physics; Geometry","score_opus":0.025307782460504465,"score_gpt":0.2703432585268172,"score_spread":0.2450354760663127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807854674","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.043630827,0.00050817034,0.93612564,0.0005029088,0.00014565239,0.00008840502,0.00011549391,0.00034732537,0.018535515],"genre_scores_gemma":[0.6581808,0.00073101686,0.30496752,0.00025393342,0.000146349,0.00040177815,0.00036332803,0.00059386436,0.034361478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997217,0.00009414928,0.000013724747,0.000024221146,0.000106350606,0.000039950264],"domain_scores_gemma":[0.99927694,0.00037791693,0.00005423174,0.00013332923,0.00009651621,0.0000611467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078883924,0.00072476047,0.0007923367,0.0005910759,0.0007675893,0.0011652141,0.0017213788,0.0013163289,0.006438969],"category_scores_gemma":[0.002673928,0.00034960685,0.0006499156,0.0006375293,0.0016231409,0.0020247137,0.0028522154,0.0024783928,0.0008719039],"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.00009470064,0.00007357793,0.00015046673,0.000079096,0.000016503574,0.000029410536,0.00012175318,0.10558783,0.0042012795,0.85302275,0.0021536846,0.03446896],"study_design_scores_gemma":[0.000017932583,0.000017508442,0.00004178431,0.000009167886,0.0000037109244,0.000012179066,0.000015925132,0.7959743,0.00075337425,0.20197234,0.0011721567,0.000009597523],"about_ca_topic_score_codex":0.0012410354,"about_ca_topic_score_gemma":0.001996611,"teacher_disagreement_score":0.006438969,"about_ca_system_score_codex":0.0011865236,"about_ca_system_score_gemma":0.00075476087,"threshold_uncertainty_score":0.021540523},"labels":[],"label_agreement":null},{"id":"W2807860467","doi":"10.1007/978-3-319-93372-6_6","title":"Detecting Agreement and Disagreement in Political Debates","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Ontario Tech University","funders":"","keywords":"Task (project management); Computer science; Agreement; Presidential system; Baseline (sea); Field (mathematics); Presidential campaign; Politics; Artificial intelligence; State (computer science); Training set; Natural language processing; Algorithm; Political science; Law; Linguistics; Mathematics","score_opus":0.021868784169364077,"score_gpt":0.2668814719523952,"score_spread":0.24501268778303112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807860467","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.9227676,0.0009218874,0.056058392,0.001113105,0.0002177891,0.00019985203,0.0027836822,0.00060121744,0.015336412],"genre_scores_gemma":[0.980893,0.00011747209,0.014058013,0.000082889215,0.00018667192,0.0000955402,0.0029888991,0.00005249945,0.0015250547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592483,0.0017586526,0.00027524962,0.0006971734,0.00092944346,0.0004147241],"domain_scores_gemma":[0.97388387,0.020697122,0.0016728446,0.0006786764,0.002395871,0.0006716991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004616274,0.0005354487,0.00072354625,0.00360893,0.001257579,0.003015838,0.00086778007,0.0014162024,0.002951862],"category_scores_gemma":[0.02857567,0.0003124269,0.00053410075,0.0025250572,0.0006698495,0.004057905,0.0018158054,0.0020662458,0.0017581033],"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.00318829,0.0009928377,0.3630566,0.0007295851,0.000492796,0.00056919776,0.007134769,0.009737353,0.021570928,0.022016477,0.028878992,0.5416321],"study_design_scores_gemma":[0.00020107659,0.00060868496,0.21911551,0.000297328,0.00044307637,0.0007432718,0.01280352,0.6001445,0.026954647,0.111695535,0.026839385,0.0001534905],"about_ca_topic_score_codex":0.00108878,"about_ca_topic_score_gemma":0.0014711196,"teacher_disagreement_score":0.004616274,"about_ca_system_score_codex":0.0006484647,"about_ca_system_score_gemma":0.000507049,"threshold_uncertainty_score":0.024413466},"labels":[],"label_agreement":null},{"id":"W28079426","doi":"10.1007/978-3-642-34778-8_7","title":"New Eye Contact Correction Using Radial Basis Function for Wide Baseline Videoconference System","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Computer science; Radial basis function; Computer vision; Artificial intelligence; Baseline (sea); Interpolation (computer graphics); Videoconferencing; Projection (relational algebra); Basis (linear algebra); Function (biology); Computer graphics (images); Image (mathematics); Algorithm; Mathematics; Telecommunications; Artificial neural network","score_opus":0.02537120399072705,"score_gpt":0.2721714437942228,"score_spread":0.24680023980349575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28079426","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.052911058,0.0023774472,0.93337727,0.00034363838,0.00033443436,0.00008376622,0.00032443393,0.0039110137,0.006336906],"genre_scores_gemma":[0.3025401,0.002022023,0.6787521,0.0003051448,0.00014276677,0.00008840261,0.0009341322,0.00043633278,0.01477897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995061,0.00006943979,0.000015119021,0.000094214935,0.00027217,0.000042976164],"domain_scores_gemma":[0.9994766,0.0000552206,0.000030405832,0.000077529476,0.00033444713,0.000025806572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037057078,0.00060195953,0.00065758475,0.0006817855,0.0004526611,0.0006401291,0.00092376577,0.0008633951,0.004877067],"category_scores_gemma":[0.000682686,0.00028503625,0.00046045578,0.00078702666,0.0001464042,0.0009598759,0.0005145341,0.0009103666,0.0019122945],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005223788,0.0001583246,0.0018559984,0.00023342749,0.00009432345,0.00023933128,0.00009261478,0.004435103,0.3010493,0.0017516959,0.010202474,0.67936504],"study_design_scores_gemma":[0.00011575591,0.00048126918,0.0127354255,0.00007719733,0.00025814908,0.0030124423,0.00012020295,0.50831753,0.44229248,0.0013187523,0.031091534,0.00017920385],"about_ca_topic_score_codex":0.0030370683,"about_ca_topic_score_gemma":0.0050200424,"teacher_disagreement_score":0.004877067,"about_ca_system_score_codex":0.0004246617,"about_ca_system_score_gemma":0.0007572071,"threshold_uncertainty_score":0.0163154},"labels":[],"label_agreement":null},{"id":"W2808069598","doi":"10.1007/978-3-319-93782-3_29","title":"Cross-Linguistic Projection for French-Vietnamese Named Entity Translation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Vietnamese; Translation (biology); Natural language processing; Artificial intelligence; Projection (relational algebra); Machine translation; Linguistics; Algorithm; Philosophy","score_opus":0.02275696068570322,"score_gpt":0.3085441165539686,"score_spread":0.28578715586826536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808069598","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.09432004,0.0030214821,0.81197375,0.0012508435,0.0011727212,0.00038606903,0.009691032,0.03035448,0.047829583],"genre_scores_gemma":[0.48705876,0.0017562596,0.44556612,0.00028650006,0.00022814106,0.00030562875,0.036835417,0.0027250582,0.02523814],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989404,0.0003471322,0.00011928381,0.00029780442,0.0001669372,0.00012833107],"domain_scores_gemma":[0.9988243,0.00031842105,0.000050932158,0.00029620863,0.000449975,0.000060110062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013680051,0.0009834784,0.0007013678,0.0011150707,0.0011462528,0.002231251,0.0008465576,0.00082276884,0.019658279],"category_scores_gemma":[0.0023215837,0.0005503422,0.000946199,0.0020114789,0.00044053528,0.0027105836,0.0030009572,0.0011210841,0.011376893],"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.0009786759,0.00026758687,0.0022841962,0.00089501997,0.00017476827,0.0018211463,0.0011639324,0.0083417045,0.048225496,0.04127864,0.05991805,0.8346508],"study_design_scores_gemma":[0.0002080281,0.0005991269,0.009305648,0.00033888043,0.00039798295,0.0035812608,0.002851683,0.4585558,0.21905208,0.081223726,0.22364543,0.00024029054],"about_ca_topic_score_codex":0.005382581,"about_ca_topic_score_gemma":0.008342746,"teacher_disagreement_score":0.019658279,"about_ca_system_score_codex":0.0006121076,"about_ca_system_score_gemma":0.0017141104,"threshold_uncertainty_score":0.06576347},"labels":[],"label_agreement":null},{"id":"W280815280","doi":"10.1007/978-3-319-17470-9_2","title":"Generalizing Efficient Multiparty Computation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Computer science; Verifiable secret sharing; Compiler; Mathematical proof; Overhead (engineering); Computation; Transformation (genetics); Theoretical computer science; Transfer (computing); Focus (optics); Secure multi-party computation; Protocol (science); Construct (python library); Communication source; Algorithm; Parallel computing; Programming language; Mathematics; Computer network; Set (abstract data type)","score_opus":0.035379816763865535,"score_gpt":0.27464301593401835,"score_spread":0.23926319917015282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W280815280","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.010522174,0.0014550755,0.8482741,0.0014373569,0.0007439975,0.00014259259,0.0002960973,0.0011162639,0.13601243],"genre_scores_gemma":[0.47724646,0.0053203176,0.36765864,0.0015433914,0.0018591022,0.0007900186,0.0015042875,0.002429885,0.1416479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834204,0.00038792807,0.000078396326,0.00033596685,0.0006352832,0.00022030072],"domain_scores_gemma":[0.99825555,0.0005427945,0.000054373882,0.0009696858,0.00012324058,0.00005435024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013308573,0.0014330517,0.0014436528,0.0013719512,0.001195651,0.0025059138,0.0022103942,0.0014257317,0.01257073],"category_scores_gemma":[0.0040832134,0.0007899345,0.002212323,0.002095897,0.0024366481,0.006420156,0.006491793,0.006517869,0.004805541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020857318,0.00002100283,0.000034509194,0.00008027088,0.000014786485,0.00002765323,0.000051884537,0.0058779707,0.0012361442,0.96564215,0.0032958188,0.023696985],"study_design_scores_gemma":[0.0000060012308,0.0000063641423,0.000040274936,0.000021149692,0.0000075481553,0.00003627478,0.000005448348,0.01798286,0.0007655237,0.9684436,0.01267772,0.000007293311],"about_ca_topic_score_codex":0.00044588928,"about_ca_topic_score_gemma":0.0004837815,"teacher_disagreement_score":0.01257073,"about_ca_system_score_codex":0.0016546691,"about_ca_system_score_gemma":0.00061653246,"threshold_uncertainty_score":0.042053282},"labels":[],"label_agreement":null},{"id":"W2808222014","doi":"10.1007/978-3-319-93638-3_9","title":"Distributed Time-Memory Tradeoff Attacks on Ciphers","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Block cipher; Key schedule; Key (lock); Distributed computing; Parallel computing; Stream cipher; Block size; Block cipher mode of operation; Cryptography; Block (permutation group theory); Theoretical computer science; Algorithm; Computer security; Differential cryptanalysis; Mathematics","score_opus":0.01869273401177257,"score_gpt":0.268629110131184,"score_spread":0.24993637611941144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808222014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14901693,0.0031239872,0.76448447,0.0029782297,0.0008366556,0.00017933345,0.00023770424,0.0015274215,0.07761525],"genre_scores_gemma":[0.9012066,0.0014123197,0.06445199,0.0003524046,0.00044487513,0.00018429286,0.0001669437,0.00035332196,0.031427093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984092,0.00039167097,0.00008167574,0.00019244563,0.00064812414,0.00027681448],"domain_scores_gemma":[0.9968144,0.001415573,0.00019737789,0.0012183111,0.00024944168,0.00010489811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323664,0.0010235094,0.0007603626,0.0008992057,0.0008957031,0.00228571,0.00094719755,0.0015043969,0.007886397],"category_scores_gemma":[0.004631909,0.00049892475,0.000644565,0.0011312093,0.0015759073,0.0055581024,0.0029858227,0.0026827788,0.0019221406],"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.0011957176,0.00011780932,0.00035129665,0.00017378062,0.000068521316,0.0001605244,0.0002202507,0.027114939,0.026221719,0.8364688,0.0073632696,0.10054335],"study_design_scores_gemma":[0.00026633427,0.00023711496,0.000227393,0.00008433279,0.000065596316,0.00046223184,0.00006158984,0.173087,0.045872487,0.75560987,0.023987278,0.000038770428],"about_ca_topic_score_codex":0.00009318316,"about_ca_topic_score_gemma":0.000109637826,"teacher_disagreement_score":0.007886397,"about_ca_system_score_codex":0.0011931333,"about_ca_system_score_gemma":0.00064916466,"threshold_uncertainty_score":0.026382685},"labels":[],"label_agreement":null},{"id":"W2808310107","doi":"10.1007/978-3-319-93372-6_9","title":"Multi-Agent Accumulator-Based Decision-Making Model of Incivility (MADI)","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social and Intergroup Psychology","field":"Social Sciences","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":"Incivility; Social psychology; Computer science; Group decision-making; Psychology","score_opus":0.06595320893374268,"score_gpt":0.3689586442704208,"score_spread":0.3030054353366781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808310107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1500137,0.0015102368,0.820518,0.0013368235,0.0002011597,0.00009673394,0.00032263872,0.000409717,0.025590923],"genre_scores_gemma":[0.9588748,0.00042675826,0.031165974,0.00008624692,0.00004714463,0.00011164354,0.00009316857,0.000026896856,0.009167399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995726,0.00013628569,0.000022208513,0.00012929729,0.000050417682,0.00008922641],"domain_scores_gemma":[0.9989347,0.00060361234,0.0001303741,0.000063573214,0.00017433327,0.00009335652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010832951,0.0006584768,0.0012593308,0.00057797495,0.0006534013,0.002029729,0.0023256384,0.0012015519,0.0056621796],"category_scores_gemma":[0.0026120588,0.00044452868,0.0008571522,0.0007344164,0.0009511386,0.0019990802,0.0011717599,0.0015607554,0.00051526714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015328804,0.0001187963,0.0016926915,0.00011304769,0.00014663204,0.00021281918,0.0001847498,0.81984985,0.0012422747,0.15131097,0.0014059045,0.023568999],"study_design_scores_gemma":[0.000009175527,0.000025558335,0.00020889977,0.000005952595,0.000021355969,0.00002466447,0.000012002506,0.971152,0.00013293416,0.028168792,0.00022822755,0.00001047054],"about_ca_topic_score_codex":0.005630746,"about_ca_topic_score_gemma":0.0039284076,"teacher_disagreement_score":0.0056621796,"about_ca_system_score_codex":0.0012846777,"about_ca_system_score_gemma":0.0010956853,"threshold_uncertainty_score":0.01894188},"labels":[],"label_agreement":null},{"id":"W2808617184","doi":"10.1007/978-3-319-93372-6_25","title":"Sign Prediction in Signed Social Networks Using Inverse Squared Metric","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Ontario Tech University","funders":"","keywords":"Metric (unit); Sign (mathematics); Computer science; Node (physics); Neighbourhood (mathematics); Context (archaeology); Metric space; Inverse; Algorithm; Sign test; Theoretical computer science; Topology (electrical circuits); Mathematics; Discrete mathematics; Wilcoxon signed-rank test; Statistics; Combinatorics","score_opus":0.020537586757774378,"score_gpt":0.2616725909505416,"score_spread":0.2411350041927672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808617184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0342171,0.00052276946,0.9617612,0.00041645244,0.00014939779,0.000053354226,0.00032691887,0.0008131875,0.0017396908],"genre_scores_gemma":[0.7580107,0.00090914476,0.22563933,0.00022728577,0.0003835292,0.00020520383,0.0022227883,0.00032435075,0.012077644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00036477766,0.00006500598,0.00022558612,0.0002509848,0.00008016572],"domain_scores_gemma":[0.99355716,0.004242331,0.00048647958,0.0006703227,0.0008093245,0.00023440186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017599755,0.00092063326,0.0014525536,0.001647664,0.00048443835,0.0013300995,0.0016102324,0.0015435632,0.003064349],"category_scores_gemma":[0.012150877,0.00048481996,0.0007205163,0.0014886502,0.0008778446,0.0034854342,0.0017795017,0.0017937442,0.0013613156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033256187,0.00020089556,0.006452487,0.00030645187,0.0000912705,0.00020105609,0.00014259657,0.5651744,0.005210773,0.05437188,0.013176065,0.35433954],"study_design_scores_gemma":[0.0000034103916,0.000013781574,0.00016050633,0.0000067807764,0.0000032600242,0.000013994184,0.0000067755664,0.9882665,0.0003463553,0.010942733,0.00023086541,0.00000505625],"about_ca_topic_score_codex":0.0028624376,"about_ca_topic_score_gemma":0.003566909,"teacher_disagreement_score":0.003064349,"about_ca_system_score_codex":0.0006801731,"about_ca_system_score_gemma":0.00076280296,"threshold_uncertainty_score":0.010251224},"labels":[],"label_agreement":null},{"id":"W2808653916","doi":"10.1007/978-3-319-94268-1_13","title":"Experimental Study on Deployment of Mobile Edge Computing to Improve Wireless Video Streaming Quality","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","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":"InterDigital (Canada)","funders":"","keywords":"Computer science; Wireless network; Computer network; Dynamic Adaptive Streaming over HTTP; Quality of service; Video quality; Enhanced Data Rates for GSM Evolution; Mobile edge computing; Wireless; Real-time computing; Quality of experience; Server; Metric (unit); Operating system; Telecommunications","score_opus":0.03570584856735826,"score_gpt":0.34887349564044895,"score_spread":0.3131676470730907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808653916","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.99368393,0.00014425592,0.004334939,0.00004757645,0.00004038385,0.000060386526,0.00015240065,0.00010117104,0.0014349845],"genre_scores_gemma":[0.99441695,0.00013677092,0.0038202615,0.00002325563,0.000013528536,0.00003457368,0.00019072954,0.000015118549,0.0013487661],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997055,0.00007325141,0.000020341164,0.000068500354,0.000070605536,0.000061824394],"domain_scores_gemma":[0.9982535,0.0008989508,0.000113410075,0.00018426591,0.00040917064,0.0001407309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004116583,0.0003682967,0.0003080592,0.00029300805,0.0002738501,0.00030873576,0.0005689513,0.00046142505,0.002818446],"category_scores_gemma":[0.0017037846,0.0001428693,0.00022009772,0.00032028882,0.00024624646,0.000409441,0.00020716542,0.00036117408,0.0002758232],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00838722,0.011781606,0.015381131,0.0012854873,0.00014974031,0.0010684382,0.00064761547,0.027757784,0.81859374,0.0016786889,0.003163861,0.11010471],"study_design_scores_gemma":[0.0009512802,0.04873961,0.089590184,0.00012916753,0.0006183007,0.0015810234,0.002043519,0.24406704,0.6050366,0.0012673682,0.005878174,0.00009766773],"about_ca_topic_score_codex":0.001413682,"about_ca_topic_score_gemma":0.000858303,"teacher_disagreement_score":0.002818446,"about_ca_system_score_codex":0.00016938506,"about_ca_system_score_gemma":0.00018854362,"threshold_uncertainty_score":0.00942862},"labels":[],"label_agreement":null},{"id":"W2808785505","doi":"10.1007/978-3-319-99368-3_19","title":"Approximation by Filter Functions","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Weighting; Estimator; Filter (signal processing); Rough set; Set (abstract data type); Quality (philosophy); Function (biology); Algorithm; Artificial intelligence; Mathematics; Statistics; Computer vision; Epistemology","score_opus":0.018577155055334436,"score_gpt":0.22766871579216016,"score_spread":0.20909156073682572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808785505","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.006967186,0.003595494,0.9708775,0.00029582495,0.00034241402,0.000015538526,0.00007696418,0.00030645652,0.017522613],"genre_scores_gemma":[0.39044333,0.014878972,0.47431764,0.00042238788,0.0012321156,0.00013520145,0.0009401987,0.000589633,0.11704054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995976,0.000090117086,0.00001990307,0.00009809471,0.00016117388,0.0000330888],"domain_scores_gemma":[0.9996455,0.00016494573,0.000026032503,0.00007105576,0.00007327447,0.000019313618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006451833,0.00081001635,0.0012997871,0.0011677236,0.0003883968,0.0021241272,0.0006629754,0.0009516389,0.0053258864],"category_scores_gemma":[0.0018098648,0.00043897732,0.0010682192,0.0015515877,0.00083590666,0.002178243,0.0010585791,0.0018397903,0.002382049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015925242,0.000034966437,0.00024546057,0.00030289585,0.00008972013,0.00007913667,0.000120681674,0.051572513,0.013686217,0.6714732,0.008949705,0.25328615],"study_design_scores_gemma":[0.00001739699,0.00007021198,0.00033131381,0.000049226852,0.000056141784,0.00019023048,0.000030178075,0.5472936,0.0067331702,0.4144908,0.030707516,0.000030184034],"about_ca_topic_score_codex":0.001127573,"about_ca_topic_score_gemma":0.0005171679,"teacher_disagreement_score":0.0053258864,"about_ca_system_score_codex":0.0010294429,"about_ca_system_score_gemma":0.00032697804,"threshold_uncertainty_score":0.017816842},"labels":[],"label_agreement":null},{"id":"W2808811087","doi":"10.1007/978-3-319-94295-7_10","title":"Renewable Energy Curtailment via Incentivized Inter-datacenter Workload Migration","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Carleton University","funders":"","keywords":"Computer science; Workload; Energy consumption; Renewable energy; Cloud computing; Grid; Smart grid; Distributed computing; Load balancing (electrical power); Efficient energy use; Energy storage; Reliability engineering; Engineering; Operating system; Electrical engineering; Power (physics)","score_opus":0.011628144125969218,"score_gpt":0.2224216992116182,"score_spread":0.21079355508564898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808811087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27503648,0.0014055431,0.6169245,0.0018187353,0.0015655692,0.00020081055,0.00043283118,0.005390477,0.09722514],"genre_scores_gemma":[0.9832412,0.00015012665,0.009023708,0.000089830944,0.000062989864,0.00002479178,0.000060503146,0.00010070341,0.0072461492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984086,0.00002741181,0.0000066237967,0.000039391176,0.00004205311,0.000043539854],"domain_scores_gemma":[0.9996253,0.00013228669,0.000041046602,0.00007897895,0.00006090386,0.00006152594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031743676,0.000454482,0.0002945429,0.00022296821,0.0002928969,0.0008309698,0.0008442091,0.00036714494,0.006478373],"category_scores_gemma":[0.001155226,0.000121654244,0.0002404149,0.0003227613,0.00016929368,0.000649295,0.00086067716,0.0006028426,0.0007719808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097498094,0.00061226904,0.0030059207,0.0002982962,0.00007908927,0.0004730125,0.0001306846,0.42350805,0.07519434,0.07346218,0.023285113,0.39897603],"study_design_scores_gemma":[0.000034381203,0.00009576893,0.001785435,0.000022301338,0.000022148162,0.00012448478,0.000048048252,0.95285296,0.010187456,0.022352811,0.012454939,0.000019259309],"about_ca_topic_score_codex":0.00075770327,"about_ca_topic_score_gemma":0.0015715625,"teacher_disagreement_score":0.006478373,"about_ca_system_score_codex":0.0004099151,"about_ca_system_score_gemma":0.00041466282,"threshold_uncertainty_score":0.021672308},"labels":[],"label_agreement":null},{"id":"W2808891699","doi":"10.1007/978-3-319-94523-1_5","title":"Technological Approach for Early and Unobtrusive Detection of Possible Health Changes Toward More Effective Treatment","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Cognition; Process (computing); Cognitive decline; Elderly people; Human–computer interaction; Artificial intelligence; Gerontology; Psychology; Dementia; Medicine; Psychiatry","score_opus":0.03594056717654879,"score_gpt":0.2785596417475892,"score_spread":0.2426190745710404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808891699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016973676,0.010308606,0.9099657,0.004323006,0.0011569774,0.00050857954,0.00061837415,0.0022859378,0.053859174],"genre_scores_gemma":[0.16423279,0.014183851,0.767463,0.003468469,0.0006693793,0.00093206693,0.00090913335,0.00028325443,0.047858085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952066,0.00010241801,0.000026243988,0.00012651183,0.00019329699,0.000030912124],"domain_scores_gemma":[0.9993598,0.00028405886,0.00005523632,0.000089006855,0.00016283919,0.000049019527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961166,0.0008457945,0.00040540082,0.0010789288,0.00036779002,0.0016817622,0.0014080448,0.001527368,0.010327944],"category_scores_gemma":[0.0015520797,0.0003567912,0.0006306917,0.0005039962,0.000467755,0.0012642912,0.0011724153,0.0014696319,0.005508023],"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.0001797407,0.0006747709,0.0028593855,0.0011328309,0.000072792456,0.00061603985,0.00054030603,0.0024604124,0.16077557,0.024645874,0.01798632,0.78805596],"study_design_scores_gemma":[0.00015716643,0.003075604,0.021659117,0.0021062144,0.00067105563,0.011154867,0.0015560664,0.07379573,0.32235304,0.08824693,0.4747834,0.00044081485],"about_ca_topic_score_codex":0.000427456,"about_ca_topic_score_gemma":0.0008643693,"teacher_disagreement_score":0.010327944,"about_ca_system_score_codex":0.00031625322,"about_ca_system_score_gemma":0.0009893549,"threshold_uncertainty_score":0.03455037},"labels":[],"label_agreement":null},{"id":"W2808959350","doi":"10.1007/978-3-319-94478-4_19","title":"Blockchain-Based Research Data Sharing Framework for Incentivizing the Data Owners","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Data sharing; Incentive; Transparency (behavior); USable; Data collection; Verifiable secret sharing; Computer security; Data science; World Wide Web","score_opus":0.17118777966687723,"score_gpt":0.3727225309777942,"score_spread":0.20153475131091694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808959350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03019023,0.00039931122,0.93581903,0.0022789508,0.00024362766,0.0007656707,0.0008565264,0.002276125,0.027170468],"genre_scores_gemma":[0.78424495,0.00037499407,0.18367419,0.00036720096,0.00014571345,0.0006812451,0.0011631196,0.0001535279,0.029195055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962509,0.0013363558,0.00023062328,0.0005633123,0.0011588546,0.00045989171],"domain_scores_gemma":[0.99373263,0.0020883786,0.0004227104,0.0016496741,0.0011186524,0.0009879555],"candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.0058138133,0.00048627416,0.0008111232,0.0013669664,0.001797071,0.0030696385,0.0025994577,0.0023099708,0.014972964],"category_scores_gemma":[0.008062579,0.00033556728,0.0005880534,0.0015564604,0.0011397164,0.005630265,0.005837005,0.001813633,0.0023506405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009944143,0.00072857965,0.0027798545,0.0003538409,0.00010986262,0.00064575946,0.0007290369,0.07358443,0.015607276,0.6766531,0.025159946,0.20265391],"study_design_scores_gemma":[0.00016398334,0.00016466269,0.00049525575,0.00006571358,0.00004507749,0.00028672855,0.000185674,0.61099535,0.006952862,0.3388081,0.041774582,0.00006205484],"about_ca_topic_score_codex":0.0019512753,"about_ca_topic_score_gemma":0.0030224074,"teacher_disagreement_score":0.9974005,"about_ca_system_score_codex":0.0016999721,"about_ca_system_score_gemma":0.005021991,"threshold_uncertainty_score":0.050089538},"labels":[],"label_agreement":null},{"id":"W2809074538","doi":"10.1007/978-3-030-35758-0_31","title":"Evaluating Image Training Systems for Medical Students","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"Skin lesion; Categorization; Lesion; Computer science; Skin cancer; Medicine; Medical physics; Dermatology; Cancer; Artificial intelligence; Radiology; Surgery; Internal medicine","score_opus":0.04965815756900538,"score_gpt":0.35501716685213486,"score_spread":0.3053590092831295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809074538","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.78694355,0.0056096353,0.17317082,0.0015263816,0.0009312875,0.0006965283,0.0024685431,0.004439396,0.024213843],"genre_scores_gemma":[0.8868388,0.0012645328,0.088613905,0.0003042493,0.00016827184,0.00012577524,0.0033739388,0.00022204938,0.019088464],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993383,0.00021469277,0.000045332563,0.00012358515,0.0002201833,0.000057771875],"domain_scores_gemma":[0.99583024,0.0028767935,0.00017748578,0.00020644884,0.0007626892,0.00014636302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016986633,0.00068343076,0.00040992643,0.0009332186,0.00017240776,0.0009696328,0.0007076815,0.0009936577,0.00837997],"category_scores_gemma":[0.0074084396,0.00019399532,0.00036791438,0.0004309669,0.00014678987,0.0007120472,0.0005324675,0.0003607236,0.0021902744],"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.0013668799,0.0005634587,0.022473607,0.00025277492,0.00011854803,0.000102841535,0.000090107926,0.025142096,0.02493524,0.00043472715,0.015353053,0.90916663],"study_design_scores_gemma":[0.00018355213,0.0037631234,0.063324325,0.00017206332,0.0003975687,0.00075099105,0.00051051955,0.80444676,0.11304626,0.0021105446,0.011234622,0.00005976167],"about_ca_topic_score_codex":0.0018994893,"about_ca_topic_score_gemma":0.0026792625,"teacher_disagreement_score":0.00837997,"about_ca_system_score_codex":0.00043721896,"about_ca_system_score_gemma":0.00027427156,"threshold_uncertainty_score":0.028033793},"labels":[],"label_agreement":null},{"id":"W2809101799","doi":"10.1007/978-3-319-93843-1_19","title":"How to Use Simulation in the Design and Evaluation of Learning Environments with Self-directed Longer-Term Learners","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Mentorship; Workload; Field (mathematics); Term (time); Empirical research; Human–computer interaction; Simulation; Medical education","score_opus":0.035217458495218845,"score_gpt":0.2778622792691306,"score_spread":0.24264482077391175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809101799","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.034490645,0.0012931926,0.93575716,0.0032369646,0.0002936981,0.0007973612,0.00024198537,0.0031508757,0.020738138],"genre_scores_gemma":[0.14673029,0.00076518685,0.8468956,0.00031418513,0.000026300379,0.000770426,0.00022811856,0.00048027295,0.0037895816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949485,0.0033076312,0.0003064677,0.00029196756,0.001002913,0.00014250373],"domain_scores_gemma":[0.9878346,0.0073827673,0.00037143813,0.0018818706,0.001968034,0.0005614382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009369609,0.00076485553,0.00058999326,0.00065528275,0.00074139674,0.00500685,0.0020038616,0.0022305408,0.0068431525],"category_scores_gemma":[0.024766054,0.00062332297,0.000721306,0.0003769504,0.001115078,0.005122543,0.0017553589,0.0015366407,0.0018497524],"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.00048349972,0.0011543051,0.0051087453,0.0011466227,0.00024478705,0.00022411888,0.0045925863,0.07177834,0.02628865,0.04104658,0.01579048,0.83214116],"study_design_scores_gemma":[0.000554708,0.0014016229,0.0070563443,0.0023710409,0.00032149686,0.0010451624,0.005305713,0.43542174,0.09107638,0.22841558,0.2264754,0.00055475876],"about_ca_topic_score_codex":0.0014137122,"about_ca_topic_score_gemma":0.0030938939,"teacher_disagreement_score":0.009369609,"about_ca_system_score_codex":0.00087267807,"about_ca_system_score_gemma":0.0019274419,"threshold_uncertainty_score":0.049551845},"labels":[],"label_agreement":null},{"id":"W2809114068","doi":"10.1007/978-3-319-94472-2_9","title":"Cloud Resource Allocation Based on Historical Records: An Analysis of Different Resource Estimation Functions","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Computer science; CloudSim; Resource allocation; Cloud computing; Resource (disambiguation); Operations research; Distributed computing; Mathematical optimization; Data mining; Computer network","score_opus":0.017266316476551025,"score_gpt":0.23677032205224285,"score_spread":0.21950400557569183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809114068","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.83869004,0.002746839,0.15378223,0.0003340763,0.000057592966,0.00006540325,0.000856935,0.0003763988,0.0030905495],"genre_scores_gemma":[0.9865883,0.00067830336,0.0110840015,0.000020096733,0.000031399533,0.000024564912,0.0008367744,0.00005277251,0.0006837433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917245,0.0002266935,0.00005707855,0.00017044734,0.00026134148,0.0001121014],"domain_scores_gemma":[0.98736984,0.01001439,0.00068578287,0.00071280217,0.0010908792,0.00012632625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037639202,0.00052618206,0.0006593004,0.0013919345,0.00032220205,0.0012551186,0.0010043418,0.00067925645,0.0009775544],"category_scores_gemma":[0.013141435,0.00029892672,0.0006944779,0.0025780567,0.00037449293,0.002113694,0.0003317002,0.0006860148,0.00022617911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001149297,0.00031129114,0.13303883,0.00038744241,0.00042225994,0.0004675998,0.00032582952,0.6120405,0.006534946,0.012493033,0.002636154,0.23019268],"study_design_scores_gemma":[0.0000052363134,0.00005383294,0.038995583,0.000024642331,0.00008670511,0.00011977213,0.000071853035,0.9571215,0.0016285881,0.0014090134,0.00046439236,0.000018845794],"about_ca_topic_score_codex":0.005813122,"about_ca_topic_score_gemma":0.0028688782,"teacher_disagreement_score":0.005813122,"about_ca_system_score_codex":0.0008929775,"about_ca_system_score_gemma":0.00040811393,"threshold_uncertainty_score":0.019905746},"labels":[],"label_agreement":null},{"id":"W2809142577","doi":"10.1007/978-3-319-95582-7_6","title":"FSM Inference from Long Traces","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Inference; Computer science; Artificial intelligence","score_opus":0.014782738002180601,"score_gpt":0.26112970838910887,"score_spread":0.24634697038692827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809142577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009823098,0.00044610686,0.98227525,0.0005822643,0.00012600781,0.000036489317,0.00068082754,0.0029918926,0.003038072],"genre_scores_gemma":[0.4379785,0.0009836842,0.5372673,0.00045285947,0.00040559063,0.0001780012,0.0049432875,0.0014301988,0.0163605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.00045332397,0.00009593084,0.00045293377,0.0005066347,0.0001342488],"domain_scores_gemma":[0.9856689,0.011629261,0.00026641446,0.0015977758,0.0006745652,0.0001631749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268606,0.0009135881,0.0011007058,0.0024011082,0.00091016834,0.0015554286,0.002521086,0.0017509792,0.0110045895],"category_scores_gemma":[0.020673929,0.0008527897,0.0017541626,0.0017255257,0.0013955422,0.0055947723,0.002789084,0.003161418,0.0021334125],"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.0003872317,0.0001383307,0.0025076217,0.0005278751,0.00021092792,0.00041311863,0.0003507803,0.19802907,0.0037988343,0.24438772,0.014735404,0.5345131],"study_design_scores_gemma":[0.000019057212,0.000015344755,0.00021966819,0.00006875723,0.00002876497,0.000072674215,0.00003212271,0.54175895,0.0023777075,0.4517584,0.0036351355,0.000013465909],"about_ca_topic_score_codex":0.0043476773,"about_ca_topic_score_gemma":0.007999622,"teacher_disagreement_score":0.0110045895,"about_ca_system_score_codex":0.0014136591,"about_ca_system_score_gemma":0.0015153886,"threshold_uncertainty_score":0.036814034},"labels":[],"label_agreement":null},{"id":"W2809283576","doi":"10.1007/978-3-319-93034-3_26","title":"Human Identification via Unsupervised Feature Learning from UWB Radar Data","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Computer science; Artificial intelligence; Discriminative model; Radar; Cluster analysis; Classifier (UML); Identification (biology); Feature extraction; Pattern recognition (psychology); Feature (linguistics); Machine learning; Telecommunications","score_opus":0.022133597657297343,"score_gpt":0.23884305240708367,"score_spread":0.21670945474978634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809283576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034768444,0.00041567677,0.9621057,0.00006756939,0.000051479827,0.000024918387,0.00023731834,0.0010356647,0.0012932577],"genre_scores_gemma":[0.6000025,0.0008899871,0.3889581,0.00015751421,0.00019119568,0.00011861199,0.0020687985,0.00020379956,0.0074095074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996164,0.00009148767,0.000015770558,0.0001276248,0.00009113942,0.000057534555],"domain_scores_gemma":[0.9993886,0.00029644012,0.0000669559,0.00013377045,0.000098138094,0.000016133603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043992637,0.0005183509,0.0007658358,0.00074526516,0.0001756171,0.00052437215,0.0007083019,0.0006871239,0.0011091369],"category_scores_gemma":[0.0015680827,0.0002568592,0.0005778846,0.00081817637,0.00031533316,0.0007613193,0.0007343944,0.00070153666,0.0015576147],"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.00026824544,0.00014152132,0.0024842208,0.00011380616,0.00007635966,0.00016609467,0.00007329639,0.0414697,0.04511119,0.0016092685,0.0034551271,0.90503114],"study_design_scores_gemma":[0.000016378588,0.00017739505,0.008491858,0.00003313567,0.00005384209,0.0008802767,0.000074227646,0.940169,0.037336167,0.008808037,0.003921001,0.000038754493],"about_ca_topic_score_codex":0.0005824521,"about_ca_topic_score_gemma":0.0010767294,"teacher_disagreement_score":0.0011091369,"about_ca_system_score_codex":0.00012030178,"about_ca_system_score_gemma":0.00023824826,"threshold_uncertainty_score":0.0037103891},"labels":[],"label_agreement":null},{"id":"W2809377824","doi":"10.1007/978-3-540-69903-3_33","title":"Spanners of Additively Weighted Point Sets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University","funders":"","keywords":"Combinatorics; Delaunay triangulation; Voronoi diagram; Mathematics; Embedding; Dual graph; Spanner; Graph; Planar graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.0162288849721434,"score_gpt":0.23743204580784025,"score_spread":0.22120316083569685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809377824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2598274,0.00080825074,0.630244,0.00021527418,0.00041679447,0.000091449125,0.00032529156,0.00044115612,0.10763044],"genre_scores_gemma":[0.67697144,0.001328451,0.17527065,0.00019851235,0.00034756574,0.00023891966,0.0008133877,0.0005845508,0.1442466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994374,0.00007115888,0.00004386309,0.000117858544,0.00026924547,0.00006049211],"domain_scores_gemma":[0.999335,0.00019978358,0.000091002184,0.00011492163,0.00014517248,0.000114052316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038435165,0.00074311986,0.0008155867,0.0022048675,0.000729723,0.0016981475,0.001131087,0.0005531837,0.009315155],"category_scores_gemma":[0.0013376967,0.0006198416,0.00065986457,0.0016408266,0.0011142609,0.0025709597,0.002826579,0.0017381766,0.0014258506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044045835,0.00002549024,0.0002271173,0.0000695923,0.000020407171,0.000121517995,0.00021738875,0.004767187,0.0055170143,0.9504461,0.0012558594,0.037288174],"study_design_scores_gemma":[0.000008486078,0.000058656606,0.00037441848,0.00003190893,0.000021729371,0.00035619215,0.00012503019,0.01933467,0.0036292118,0.96408767,0.011957136,0.000014912347],"about_ca_topic_score_codex":0.00022851952,"about_ca_topic_score_gemma":0.00044955875,"teacher_disagreement_score":0.009315155,"about_ca_system_score_codex":0.0003256978,"about_ca_system_score_gemma":0.00018679787,"threshold_uncertainty_score":0.031162322},"labels":[],"label_agreement":null},{"id":"W2809439187","doi":"10.1007/978-3-319-93843-1_14","title":"Better Late Than Never but Never Late Is Better: Towards Reducing the Answer Response Time to Questions in an Online Learning Community","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Expert finding and Q&A systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Variety (cybernetics); Questions and answers; Online learning; Frequently asked questions; Question answering; Internet privacy; Data science; World Wide Web; Medical education; Artificial intelligence; Medicine","score_opus":0.03155631385896311,"score_gpt":0.2774610906570559,"score_spread":0.24590477679809275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809439187","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.523311,0.0014911928,0.4349722,0.0058163544,0.00052547536,0.0011729727,0.00085606443,0.014569145,0.017285619],"genre_scores_gemma":[0.6948445,0.00024902943,0.28405824,0.00067255704,0.0003535269,0.00050651986,0.001166844,0.00091089355,0.01723794],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99451244,0.0023872915,0.00020578572,0.0009147627,0.0016007995,0.00037887707],"domain_scores_gemma":[0.9403904,0.04088242,0.0034382383,0.0040334016,0.0067573306,0.0044981386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007179209,0.0010935065,0.001444793,0.001292266,0.0018126044,0.0025288442,0.003912812,0.0030064275,0.011208864],"category_scores_gemma":[0.049183965,0.00052044535,0.0005046365,0.0014071648,0.0009973134,0.007717029,0.004342475,0.0027574755,0.0042076306],"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.003617373,0.0069641727,0.019053029,0.00074601494,0.00014114498,0.00014034098,0.002921258,0.015677026,0.02791938,0.009457342,0.03133748,0.88202554],"study_design_scores_gemma":[0.0012915353,0.0041121324,0.019122867,0.00022829817,0.00060274795,0.0003832805,0.005978136,0.7919144,0.0306701,0.107653,0.037811097,0.00023247613],"about_ca_topic_score_codex":0.0033119172,"about_ca_topic_score_gemma":0.0054101883,"teacher_disagreement_score":0.011208864,"about_ca_system_score_codex":0.00093448884,"about_ca_system_score_gemma":0.0025879017,"threshold_uncertainty_score":0.0379678},"labels":[],"label_agreement":null},{"id":"W2809448755","doi":"","title":"Home gateway with automated real-time intrusion detection for secure home networks","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Gateway (web page); Intrusion detection system; Computer security; Computer network; World Wide Web","score_opus":0.002730967077124882,"score_gpt":0.18755656303063922,"score_spread":0.18482559595351433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809448755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19450215,0.00057099323,0.7316874,0.00041238606,0.00034840612,0.0004301911,0.0003332328,0.06312305,0.008592232],"genre_scores_gemma":[0.86578965,0.00008435586,0.13006613,0.00013512527,0.00005196211,0.00009139712,0.00022904249,0.00014887174,0.0034034823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994118,0.00015558771,0.000030749467,0.000107557025,0.00022943025,0.0000648437],"domain_scores_gemma":[0.99954635,0.0001279044,0.000055783898,0.00014712708,0.00009273473,0.000030164414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070458994,0.00059545133,0.0006601347,0.00081631634,0.00023380943,0.00076438667,0.00094430544,0.0004993299,0.0030053786],"category_scores_gemma":[0.0009904408,0.00027396606,0.0002310088,0.00028814483,0.00031252016,0.00074430025,0.00070024654,0.0004662359,0.0006648353],"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.003435431,0.0014722963,0.012036835,0.00030037234,0.00030409714,0.00091865566,0.00038613804,0.09638731,0.17106369,0.0098896455,0.025849873,0.6779556],"study_design_scores_gemma":[0.00013543866,0.00041387547,0.0025455623,0.0000122218735,0.000057284004,0.00028067047,0.000037894923,0.937406,0.05209776,0.0024732768,0.0045125387,0.000027534117],"about_ca_topic_score_codex":0.0010239341,"about_ca_topic_score_gemma":0.0019876154,"teacher_disagreement_score":0.0030053786,"about_ca_system_score_codex":0.00034776345,"about_ca_system_score_gemma":0.00051130785,"threshold_uncertainty_score":0.010053992},"labels":[],"label_agreement":null},{"id":"W2809639820","doi":"10.1007/978-3-319-97785-0_4","title":"Dynamic Voting in Multi-view Learning for Radiomics Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Radiomics; Computer science; Random forest; Voting; Personalization; Classifier (UML); Artificial intelligence; Machine learning; World Wide Web","score_opus":0.016987406325420333,"score_gpt":0.3106549781257549,"score_spread":0.29366757180033454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809639820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026338068,0.0006251727,0.9954289,0.00008813948,0.0000652467,0.00001564331,0.000029226083,0.00021701974,0.000896883],"genre_scores_gemma":[0.31092808,0.0013813368,0.6739373,0.00027763416,0.00032272274,0.00015147284,0.0005150255,0.0004193676,0.012067023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884844,0.00039937245,0.00005420466,0.0003052965,0.00027260324,0.0001201746],"domain_scores_gemma":[0.9986646,0.0007462185,0.00006250191,0.00020622043,0.00026409343,0.00005643062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016226851,0.0006947976,0.0017139724,0.0006361645,0.00042871002,0.0013136087,0.0023226652,0.0016372621,0.004812568],"category_scores_gemma":[0.00389748,0.00060302415,0.0009628879,0.000957184,0.000627253,0.0016355858,0.0018032221,0.0018557806,0.0014819651],"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.00018481874,0.000109265005,0.0005554065,0.00018714629,0.00009483959,0.00007209527,0.00007027778,0.23024614,0.011977568,0.029274175,0.008124537,0.71910363],"study_design_scores_gemma":[0.000004119273,0.000028863315,0.00011812389,0.0000075645044,0.000009668949,0.00003789206,0.000007081906,0.9853662,0.0022397372,0.0102972025,0.0018759253,0.0000075711514],"about_ca_topic_score_codex":0.0020435348,"about_ca_topic_score_gemma":0.0027190077,"teacher_disagreement_score":0.004812568,"about_ca_system_score_codex":0.000607739,"about_ca_system_score_gemma":0.00050177274,"threshold_uncertainty_score":0.016099632},"labels":[],"label_agreement":null},{"id":"W2809703834","doi":"10.1007/978-3-030-00928-1_57","title":"Subject2Vec: Generative-Discriminative Approach from a Set of Image Patches to a Vector","year":2018,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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 British Columbia","funders":"National Heart, Lung, and Blood Institute","keywords":"Discriminative model; Interpretability; Computer science; Artificial intelligence; Pattern recognition (psychology); Generative model; Context (archaeology); Representation (politics); Generative grammar; Image (mathematics); Set (abstract data type); Machine learning","score_opus":0.02709640894807332,"score_gpt":0.30766543453939804,"score_spread":0.28056902559132474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809703834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02350573,0.0015883559,0.9395674,0.0005770463,0.000802656,0.00029617496,0.00522577,0.025514742,0.0029220744],"genre_scores_gemma":[0.32674652,0.0026558659,0.58884716,0.0015183148,0.0009000291,0.00091873243,0.03756081,0.0047312393,0.03612136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993759,0.000103424085,0.000029726541,0.00023164052,0.00017072968,0.00008855404],"domain_scores_gemma":[0.9994783,0.000085829226,0.00003502647,0.0001941499,0.00015990878,0.00004682914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869567,0.0021194185,0.0014334285,0.0015832047,0.00047377302,0.0008391068,0.0018248535,0.0012907049,0.0074671754],"category_scores_gemma":[0.0013272889,0.0006221537,0.0014162058,0.0024045934,0.0006878174,0.0010991115,0.0018614049,0.0021732303,0.0063368618],"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.0005250577,0.00042525353,0.0023083645,0.00049501506,0.0002726808,0.00025525823,0.00013635757,0.028921004,0.046806097,0.0073574763,0.12938532,0.783112],"study_design_scores_gemma":[0.00010474413,0.0004347826,0.003308909,0.00008845882,0.00016501195,0.00072439417,0.00014325636,0.8970554,0.039126463,0.014859073,0.04390863,0.00008097343],"about_ca_topic_score_codex":0.009340404,"about_ca_topic_score_gemma":0.02158842,"teacher_disagreement_score":0.009340404,"about_ca_system_score_codex":0.000553015,"about_ca_system_score_gemma":0.0013215208,"threshold_uncertainty_score":0.024980187},"labels":[],"label_agreement":null},{"id":"W2809889031","doi":"10.1007/978-3-319-94667-2_5","title":"Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Aggregate (composite); Signature (topology); Digital signature; Cover (algebra); Computer science; Upper and lower bounds; Set (abstract data type); Compression (physics); Algorithm; Scheme (mathematics); Approx; Compression ratio; Theoretical computer science; Mathematics; Computer security; Physics","score_opus":0.02526502986790034,"score_gpt":0.26060086726831333,"score_spread":0.235335837400413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809889031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067921184,0.00045358957,0.91785437,0.0005969863,0.00017020672,0.00019203112,0.00046759142,0.004136842,0.008207263],"genre_scores_gemma":[0.7798275,0.00027697766,0.21094161,0.0002259005,0.00014327142,0.00024826766,0.00083172775,0.0005823101,0.0069224807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378467,0.0009885936,0.0004798685,0.0008582086,0.0028924833,0.0009960365],"domain_scores_gemma":[0.9862855,0.005224776,0.0007517104,0.0062191393,0.0011566676,0.00036217464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022986718,0.0008723983,0.002184887,0.0010268076,0.0018576204,0.0037419135,0.002910855,0.0015023443,0.006181839],"category_scores_gemma":[0.011159378,0.00073473284,0.0014733212,0.0020867991,0.0017489344,0.010038456,0.0062773223,0.002839685,0.0023873649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002638727,0.0004985964,0.001586731,0.0005501001,0.0001487612,0.0005339462,0.0011453492,0.19212356,0.046216357,0.39661247,0.015525101,0.34242037],"study_design_scores_gemma":[0.00013630366,0.00026913921,0.00025766002,0.00007710291,0.00007430906,0.00054781826,0.0002667837,0.51505095,0.030327069,0.44146746,0.011441543,0.000083905645],"about_ca_topic_score_codex":0.00053246773,"about_ca_topic_score_gemma":0.00057299994,"teacher_disagreement_score":0.006181839,"about_ca_system_score_codex":0.0017656788,"about_ca_system_score_gemma":0.0021528597,"threshold_uncertainty_score":0.020680308},"labels":[],"label_agreement":null},{"id":"W2810127451","doi":"10.1007/978-3-319-98654-8_21","title":"A General Approach to State Complexity of Operations: Formalization and Limitations","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Arity; Computer science; Complement (music); State (computer science); Regular language; Class (philosophy); Automaton; Set (abstract data type); Tuple; Theoretical computer science; Finite-state machine; Deterministic finite automaton; Transformation (genetics); Time complexity; Algorithm; Discrete mathematics; Programming language; Mathematics; Artificial intelligence","score_opus":0.05043347692059187,"score_gpt":0.2581152853837025,"score_spread":0.20768180846311063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810127451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007655592,0.0017316497,0.9614811,0.0028839572,0.00020374748,0.00010414306,0.00022952665,0.0003942733,0.025315987],"genre_scores_gemma":[0.43382215,0.0047935457,0.5351273,0.0013351751,0.0016952781,0.0010328504,0.00060702045,0.0008735412,0.020713098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915379,0.0018470006,0.00078128575,0.0018015516,0.0034095831,0.0006226791],"domain_scores_gemma":[0.95965135,0.02806087,0.000920082,0.007993219,0.0026732294,0.0007011514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074960645,0.0023155161,0.0028072216,0.0033192872,0.0018974853,0.008444789,0.007307799,0.0034460695,0.014062305],"category_scores_gemma":[0.029265119,0.001611247,0.0042313887,0.004942662,0.01257028,0.043247856,0.007225916,0.012645187,0.0017138966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014355767,0.000019338218,0.00008145492,0.000118109,0.000009751886,0.000014601862,0.00010365559,0.004032769,0.00034405573,0.98450005,0.0008003545,0.0099614905],"study_design_scores_gemma":[0.0000053063145,0.000011746252,0.000047548874,0.000019927955,0.000011886889,0.000032888525,0.000025357149,0.029600047,0.00054410036,0.96717894,0.002511777,0.0000105248955],"about_ca_topic_score_codex":0.0018633548,"about_ca_topic_score_gemma":0.0014713466,"teacher_disagreement_score":0.014062305,"about_ca_system_score_codex":0.004748746,"about_ca_system_score_gemma":0.0029147062,"threshold_uncertainty_score":0.047043145},"labels":[],"label_agreement":null},{"id":"W2810320971","doi":"10.1007/978-3-319-94274-2_72","title":"Videobooking: A Person-Centred Record of Living with Chronic Conditions and Associated Disabilities","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health and Patient Involvement","field":"Health Professions","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":"York University; Toronto Metropolitan University","funders":"","keywords":"Duration (music); Computer science; Chronic pain; Multiple Chronic Conditions; Psychology; Chronic disease; Medicine; Psychiatry; Family medicine; Art","score_opus":0.11888646601904383,"score_gpt":0.34818630695067593,"score_spread":0.22929984093163208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810320971","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.31471148,0.023470568,0.0590741,0.005412408,0.002352145,0.0018421966,0.08633804,0.0103293285,0.49646974],"genre_scores_gemma":[0.38967255,0.027716186,0.12218475,0.002245795,0.0009886654,0.0010140166,0.030926555,0.0017409973,0.4235105],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99992406,0.000017691142,0.000008738687,0.000012279308,0.000028113514,0.000009132459],"domain_scores_gemma":[0.99963117,0.00018970278,0.000025299878,0.000031204465,0.000060068844,0.00006260484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023165306,0.000294002,0.00022596744,0.0009941704,0.0002974317,0.00072972896,0.00053029845,0.0005193123,0.023991242],"category_scores_gemma":[0.0010533961,0.00010568504,0.00013546755,0.00086139346,0.00013639482,0.0006218434,0.0004964541,0.00040270458,0.0048331493],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002457931,0.00011613633,0.009059728,0.00041145054,0.000018329352,0.0006845307,0.0035266273,0.00018861056,0.004269975,0.001044154,0.1754651,0.8049695],"study_design_scores_gemma":[0.000078107594,0.0004331201,0.23582204,0.0010482752,0.000071013805,0.010398983,0.0076722465,0.001493862,0.005872473,0.0019777569,0.73500675,0.00012535465],"about_ca_topic_score_codex":0.0064765997,"about_ca_topic_score_gemma":0.021162137,"teacher_disagreement_score":0.023991242,"about_ca_system_score_codex":0.00022693147,"about_ca_system_score_gemma":0.00057995046,"threshold_uncertainty_score":0.08025873},"labels":[],"label_agreement":null},{"id":"W2810353660","doi":"10.1007/978-3-319-94205-6_10","title":"Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Satisfiability modulo theories; Satisfiability; Computer science; Conjunctive normal form; Modulo; Propositional formula; Solver; Propositional calculus; Set (abstract data type); Boolean satisfiability problem; Theoretical computer science; Answer set programming; Algorithm; Propositional variable; Programming language; Mathematics; Discrete mathematics; Boolean function","score_opus":0.0335173284289863,"score_gpt":0.30900776724270745,"score_spread":0.27549043881372115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810353660","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.015246108,0.00048152957,0.9661171,0.0004788634,0.00011862584,0.00013698486,0.00024014963,0.0016868149,0.015493875],"genre_scores_gemma":[0.27756402,0.00077916577,0.7014554,0.00023552525,0.00020538243,0.0005469218,0.0013951128,0.0011602973,0.01665814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964987,0.00088322564,0.00026634664,0.00048728925,0.0015281262,0.0003363101],"domain_scores_gemma":[0.9903223,0.00676066,0.00025624534,0.0019383344,0.0005487523,0.00017369608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027851427,0.0013075573,0.0016930494,0.0022192209,0.0017160443,0.004512296,0.005025213,0.0018592203,0.018003218],"category_scores_gemma":[0.015780458,0.0013851646,0.0023815935,0.0039521432,0.0025843473,0.011410908,0.0063167857,0.007465737,0.002967934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022838767,0.00013076271,0.00026292953,0.00033802184,0.000048499965,0.000042110263,0.00039879957,0.018652238,0.0017363834,0.80308527,0.0045495243,0.17052695],"study_design_scores_gemma":[0.00004791441,0.000026321719,0.000059323585,0.00006907418,0.000033784094,0.000030640404,0.00005009831,0.09154819,0.002166618,0.90193063,0.004022483,0.000014828111],"about_ca_topic_score_codex":0.0009577272,"about_ca_topic_score_gemma":0.0017152816,"teacher_disagreement_score":0.018003218,"about_ca_system_score_codex":0.0028886348,"about_ca_system_score_gemma":0.0021532462,"threshold_uncertainty_score":0.060226798},"labels":[],"label_agreement":null},{"id":"W2810356429","doi":"10.1007/978-3-319-93317-7_4","title":"Model Transformation Reuse Across Metamodels","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Université de Montréal; McGill University","funders":"","keywords":"Metamodeling; Reuse; Computer science; Model transformation; Grid; A priori and a posteriori; Transformation (genetics); Feature (linguistics); Domain (mathematical analysis); Salient; Software engineering; Data mining; Systems engineering; Artificial intelligence; Engineering; Geography; Mathematics","score_opus":0.028085863725324123,"score_gpt":0.27016832319756084,"score_spread":0.24208245947223672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810356429","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.013316655,0.00043528192,0.9677344,0.0003581544,0.00008969355,0.000107150896,0.00017755108,0.005295522,0.012485627],"genre_scores_gemma":[0.25921345,0.0017787173,0.7017469,0.00038754896,0.00007514233,0.00020437354,0.0022552784,0.006679608,0.027659023],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963965,0.0007818809,0.0003721438,0.0005637034,0.0016776972,0.00020822806],"domain_scores_gemma":[0.9922009,0.0015248365,0.00024974748,0.0052298345,0.00072791404,0.00006672714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031554638,0.0010397938,0.0008087904,0.002133859,0.0006820477,0.0031816424,0.0021503116,0.0014284613,0.005295858],"category_scores_gemma":[0.008963766,0.0012321244,0.0029928917,0.0023595854,0.00091561937,0.0058435304,0.0035837097,0.0025827202,0.0026480842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014971598,0.00023596571,0.0020584702,0.00073526904,0.00029692345,0.0008197795,0.0014977653,0.03501995,0.032594737,0.24952707,0.0074616834,0.6696027],"study_design_scores_gemma":[0.00005609709,0.00019498098,0.0015666005,0.0006649313,0.00065556134,0.0022917555,0.00046643303,0.25976533,0.16672286,0.32480973,0.24267462,0.00013113827],"about_ca_topic_score_codex":0.0022576496,"about_ca_topic_score_gemma":0.0030000114,"teacher_disagreement_score":0.005295858,"about_ca_system_score_codex":0.0009758236,"about_ca_system_score_gemma":0.0014997285,"threshold_uncertainty_score":0.017716348},"labels":[],"label_agreement":null},{"id":"W2810411611","doi":"10.1007/978-3-319-94211-7_25","title":"Visual Scene Reconstruction Using a Bayesian Learning Framework","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; Dirichlet distribution; Artificial intelligence; Gibbs sampling; Machine learning; Bayesian probability; Parametric statistics; Focus (optics); Density estimation; Prior probability; Hierarchical Dirichlet process; Pattern recognition (psychology); Latent Dirichlet allocation; Mathematics; Topic model; Statistics","score_opus":0.021963991545495304,"score_gpt":0.292800006722466,"score_spread":0.27083601517697065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810411611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003608427,0.00008303613,0.99901044,0.000030422214,0.000007176983,0.000006542026,0.000016874284,0.00012892546,0.00035570498],"genre_scores_gemma":[0.049564034,0.00078742666,0.94535154,0.00009900964,0.000062871724,0.000058721263,0.00030192014,0.0002831372,0.0034913898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992976,0.00016852477,0.00003394275,0.00016209342,0.0002816419,0.0000561395],"domain_scores_gemma":[0.99936,0.00030645222,0.000046190784,0.00010711917,0.00014129744,0.0000389217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010993106,0.0008752234,0.00139147,0.0013730198,0.00042175077,0.0018872997,0.0022864072,0.0016837728,0.0045224237],"category_scores_gemma":[0.0027559092,0.0015196392,0.0018228516,0.0015308274,0.00089218706,0.002222806,0.0020783462,0.0021976766,0.0018408563],"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.00015237939,0.00006901448,0.00030413773,0.00026452524,0.00018585069,0.000099351564,0.000106896914,0.43401298,0.01600933,0.08148582,0.004694186,0.46261552],"study_design_scores_gemma":[0.00000866014,0.000012300984,0.00008018267,0.000018270577,0.000019460247,0.0000753666,0.000009721474,0.9642002,0.0024317852,0.03086702,0.0022584726,0.000018571152],"about_ca_topic_score_codex":0.00549024,"about_ca_topic_score_gemma":0.005044749,"teacher_disagreement_score":0.00549024,"about_ca_system_score_codex":0.0007164966,"about_ca_system_score_gemma":0.0009307368,"threshold_uncertainty_score":0.01512897},"labels":[],"label_agreement":null},{"id":"W2810534175","doi":"10.1007/978-3-319-95168-3_20","title":"Building-Level Change Detection from Large-Scale Historical Vector Data by Using Direct and a Three-Tier Post-classification Comparison","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Land Use and Ecosystem Services","field":"Environmental 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":"Computer science; Scale (ratio); Change detection; Data mining; Database; Artificial intelligence; Cartography; Geography","score_opus":0.06834170710254685,"score_gpt":0.26542526839145286,"score_spread":0.19708356128890603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810534175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41122887,0.0012348279,0.5624987,0.00020931692,0.00035931222,0.0003884069,0.0038393107,0.00634881,0.013892414],"genre_scores_gemma":[0.7024403,0.00033438057,0.27604476,0.0000769884,0.000097074575,0.00016543396,0.011430701,0.00058001914,0.008830316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878293,0.00008630334,0.00009725302,0.00035793887,0.00042369578,0.00025183233],"domain_scores_gemma":[0.9984682,0.00030194083,0.00007143784,0.00025823092,0.00083094457,0.00006927566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622907,0.0008774106,0.0011038533,0.0032713322,0.00050627434,0.0019901737,0.0013865887,0.0008232527,0.0072657173],"category_scores_gemma":[0.0022313315,0.000340199,0.0011589542,0.0026789708,0.0004619787,0.001739433,0.001587621,0.0006086836,0.0034500102],"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.00094895216,0.00045352205,0.035845462,0.000294069,0.00029040195,0.00012312844,0.00023141869,0.02072934,0.040382043,0.0018208479,0.0069722165,0.8919086],"study_design_scores_gemma":[0.000067539404,0.00048324265,0.12936628,0.000059573937,0.00033764308,0.00048574654,0.0006317106,0.79778075,0.05442225,0.0041342983,0.012112597,0.00011837833],"about_ca_topic_score_codex":0.00657308,"about_ca_topic_score_gemma":0.015741711,"teacher_disagreement_score":0.0072657173,"about_ca_system_score_codex":0.00048420826,"about_ca_system_score_gemma":0.0006905069,"threshold_uncertainty_score":0.024306238},"labels":[],"label_agreement":null},{"id":"W2810772462","doi":"10.1007/978-3-319-95165-2_29","title":"Molecular Structure Determination in the Phillips’ Model: A Degree of Freedom Approach","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor","funders":"","keywords":"Dihedral angle; Atom (system on chip); Euclidean space; Physics; Degrees of freedom (physics and chemistry); Torsion (gastropod); Axiom; Euclidean geometry; Mathematics; Combinatorics; Molecule; Geometry; Computer science; Quantum mechanics","score_opus":0.027589475560635904,"score_gpt":0.2495506531724413,"score_spread":0.2219611776118054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810772462","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.017195709,0.0009147368,0.95554376,0.0008895254,0.00022142977,0.00011216486,0.0003237977,0.00040682917,0.024391888],"genre_scores_gemma":[0.42353046,0.0028261219,0.5343698,0.00097367296,0.00023053917,0.0007610314,0.0009431255,0.0010781791,0.035287127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996512,0.000102368984,0.000012650488,0.000055889224,0.0001434286,0.000034442735],"domain_scores_gemma":[0.9996008,0.00015620905,0.00003228386,0.00011271388,0.00006112452,0.000036849888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766126,0.000609829,0.0018145604,0.0008480852,0.0007961873,0.0012622259,0.0042530843,0.002406186,0.0076285666],"category_scores_gemma":[0.001651842,0.0008701742,0.0013285069,0.001074517,0.0011324132,0.002318243,0.0013745525,0.0021741819,0.0023720213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120739445,0.000080106234,0.00026935965,0.00030579188,0.00006898724,0.000236007,0.0001377157,0.5281452,0.004343728,0.42190996,0.0048858975,0.039496552],"study_design_scores_gemma":[0.000021427559,0.000035745255,0.00006259731,0.000018232064,0.000011676434,0.000052668194,0.000020175647,0.92905754,0.00053011294,0.06483094,0.0053434023,0.000015540949],"about_ca_topic_score_codex":0.0022487426,"about_ca_topic_score_gemma":0.0016947268,"teacher_disagreement_score":0.0076285666,"about_ca_system_score_codex":0.00051956257,"about_ca_system_score_gemma":0.0011847093,"threshold_uncertainty_score":0.025520086},"labels":[],"label_agreement":null},{"id":"W2810918610","doi":"10.1007/978-3-319-94211-7_27","title":"Analysis of Camera Pose Estimation Using 2D Scene Features for Augmented Reality Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Université Laval","funders":"","keywords":"Augmented reality; Computer science; Computer vision; Artificial intelligence; Overlay; Pose; Representation (politics); Computer graphics (images); Image (mathematics)","score_opus":0.021492290986998158,"score_gpt":0.27473560787323664,"score_spread":0.25324331688623847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810918610","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.027205154,0.00081065705,0.96847826,0.000054193602,0.00004545056,0.00003785543,0.00015228077,0.00059858244,0.0026175007],"genre_scores_gemma":[0.62499374,0.0019469049,0.36048138,0.000070689945,0.00009975347,0.00008584333,0.0011532655,0.00036545628,0.0108030215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946195,0.00007855541,0.000023984701,0.00009563671,0.00029069564,0.00004916003],"domain_scores_gemma":[0.9992687,0.00032690656,0.00006961949,0.00009333564,0.00023062779,0.000010814724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041233617,0.0007865109,0.0006030081,0.0009813242,0.0002334626,0.0009495287,0.00060189556,0.00053477235,0.0052744746],"category_scores_gemma":[0.0016477737,0.0004971983,0.0008193494,0.00094641896,0.00022006666,0.0008564555,0.00045786513,0.00045365855,0.0014801775],"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.00037051598,0.00011528162,0.0023170502,0.00037180333,0.00014924056,0.0003270478,0.00014732528,0.20958461,0.09715663,0.0065271235,0.0033443226,0.67958915],"study_design_scores_gemma":[0.000005727581,0.00009495848,0.0053889635,0.000020079,0.000038986087,0.00022540864,0.00003960486,0.9661342,0.024104862,0.0016511194,0.0022727451,0.000023380398],"about_ca_topic_score_codex":0.0033432867,"about_ca_topic_score_gemma":0.0045218808,"teacher_disagreement_score":0.0052744746,"about_ca_system_score_codex":0.00031865994,"about_ca_system_score_gemma":0.00038889697,"threshold_uncertainty_score":0.017644882},"labels":[],"label_agreement":null},{"id":"W2811221372","doi":"10.1007/978-3-319-94776-1_3","title":"A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Bottleneck; Approximation algorithm; Decomposition; Combinatorics; Algorithm; Time complexity; Computer science; Randomized algorithm; Mathematics; Discrete mathematics; Biology","score_opus":0.008534293592855747,"score_gpt":0.25558125869686,"score_spread":0.24704696510400426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811221372","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.022167016,0.0014592297,0.94319654,0.0023007996,0.00064272084,0.0004591094,0.0013606874,0.0068770857,0.02153677],"genre_scores_gemma":[0.122973256,0.0005017221,0.85882163,0.000810552,0.0004638669,0.0010185688,0.0025904835,0.0015618643,0.011258118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722606,0.00056153827,0.00014369204,0.0008102145,0.00074800075,0.0005105049],"domain_scores_gemma":[0.99435544,0.003129258,0.0002197412,0.0013730748,0.0005618415,0.00036058333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022761845,0.0033185508,0.003228029,0.0020037815,0.0017893517,0.0037946485,0.0052359276,0.003511819,0.020792983],"category_scores_gemma":[0.012088865,0.0012595641,0.002965629,0.004769298,0.0017028555,0.005539844,0.0042364625,0.005831487,0.006624612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019760134,0.0010364031,0.00081839605,0.00094383,0.00018122199,0.00020251586,0.00031224082,0.20895891,0.008350752,0.10542786,0.09470629,0.5770855],"study_design_scores_gemma":[0.0004346725,0.000118957345,0.00019694565,0.000066972054,0.00007372619,0.0001518584,0.00007237491,0.8226651,0.0022135847,0.16590033,0.008070026,0.00003553109],"about_ca_topic_score_codex":0.0051833014,"about_ca_topic_score_gemma":0.0062253475,"teacher_disagreement_score":0.020792983,"about_ca_system_score_codex":0.0033842209,"about_ca_system_score_gemma":0.004615501,"threshold_uncertainty_score":0.069559455},"labels":[],"label_agreement":null},{"id":"W2811286101","doi":"10.1007/978-3-030-02738-4_7","title":"Reduced Transmission in Multi-server Coded Caching","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","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":"Lakehead University","funders":"","keywords":"Server; Computer science; Computer network; Transmission (telecommunications); Scheme (mathematics); Telecommunications","score_opus":0.033751713742044706,"score_gpt":0.2611019808695779,"score_spread":0.2273502671275332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811286101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18290578,0.0033107037,0.78048575,0.0007569593,0.00052829063,0.00016271061,0.00042102335,0.0023817774,0.029047009],"genre_scores_gemma":[0.89270455,0.0008085617,0.09272796,0.00016809025,0.00013226901,0.00011216088,0.00023459994,0.00040384656,0.01270796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871814,0.0003521144,0.00004663359,0.00013702243,0.0004689621,0.0002771342],"domain_scores_gemma":[0.99527526,0.0027492852,0.00014023988,0.00097607076,0.00072282064,0.00013628781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873901,0.00084180414,0.0013217246,0.0006358818,0.00081867207,0.0019807364,0.0023318457,0.0011429279,0.0050216406],"category_scores_gemma":[0.006292364,0.0005242317,0.00039947176,0.0015919617,0.0010624876,0.0024586397,0.0012863525,0.0016218086,0.0006150124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001600081,0.00039817163,0.0008088109,0.0006243457,0.0000839288,0.00044188436,0.00030990614,0.61329544,0.038418755,0.17762798,0.015436516,0.15095413],"study_design_scores_gemma":[0.000023558225,0.000045936045,0.00013725091,0.000019792944,0.000026674505,0.0001131346,0.000024050172,0.980316,0.003911849,0.014323175,0.0010401085,0.000018494678],"about_ca_topic_score_codex":0.0077167624,"about_ca_topic_score_gemma":0.008828612,"teacher_disagreement_score":0.0077167624,"about_ca_system_score_codex":0.0027926194,"about_ca_system_score_gemma":0.0025227785,"threshold_uncertainty_score":0.020262003},"labels":[],"label_agreement":null},{"id":"W2811466089","doi":"10.1007/978-3-319-94144-8_8","title":"Centrality-Based Improvements to CDCL Heuristics","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"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":"Heuristics; Solver; Computer science; Exploit; Centrality; Boolean satisfiability problem; Theoretical computer science; Data structure; Algorithm; Programming language; Mathematics; Combinatorics","score_opus":0.01511907516038146,"score_gpt":0.2498447418800109,"score_spread":0.23472566671962944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811466089","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.016975457,0.0017189821,0.9138232,0.0012103458,0.0015647227,0.00025773386,0.00061335205,0.0033257033,0.06051054],"genre_scores_gemma":[0.22541587,0.001145341,0.7298866,0.0009067853,0.0008810066,0.00029847104,0.0014052811,0.0018956502,0.038164966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770916,0.0006297589,0.00009523429,0.00049845735,0.0007661049,0.00030128172],"domain_scores_gemma":[0.9906598,0.005117702,0.00027096109,0.002256753,0.0012444677,0.0004503582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001481932,0.0016360763,0.0017406027,0.0031093971,0.0018979089,0.0024936611,0.0045141233,0.0020160463,0.036958713],"category_scores_gemma":[0.015035939,0.00085252407,0.0012039887,0.005475142,0.0015718477,0.0035646153,0.004063982,0.0046178563,0.006516674],"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.00044927976,0.0005725862,0.0007147484,0.00066399184,0.00011118641,0.00013231949,0.00024079609,0.17613831,0.006239524,0.3011037,0.052743655,0.46088988],"study_design_scores_gemma":[0.00024394214,0.00011824739,0.00031758135,0.00011136954,0.0001037908,0.00014240103,0.00012520062,0.66861737,0.0036498893,0.28994745,0.03656951,0.000053227464],"about_ca_topic_score_codex":0.0059749186,"about_ca_topic_score_gemma":0.016396072,"teacher_disagreement_score":0.036958713,"about_ca_system_score_codex":0.0027185436,"about_ca_system_score_gemma":0.0036270632,"threshold_uncertainty_score":0.123639226},"labels":[],"label_agreement":null},{"id":"W2816890","doi":"10.1007/978-3-642-23719-5_8","title":"Can Nearest Neighbor Searching Be Simple and Always Fast?","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Voronoi diagram; Computer science; Point location; Delaunay triangulation; Logarithm; k-nearest neighbors algorithm; Algorithm; Simple (philosophy); Nearest neighbor search; Predicate (mathematical logic); Computational geometry; Theoretical computer science; Point (geometry); Data mining; Mathematics; Artificial intelligence","score_opus":0.028346842792293915,"score_gpt":0.253094582071666,"score_spread":0.2247477392793721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2816890","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.028174395,0.008927304,0.89237815,0.008196758,0.0033206954,0.000115780465,0.0007960549,0.006129061,0.051961906],"genre_scores_gemma":[0.22472271,0.007315013,0.72876245,0.0014895432,0.0011127669,0.00016243456,0.0015948683,0.001706652,0.033133533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837923,0.00029676358,0.000087157765,0.00038765464,0.00067301985,0.0001762189],"domain_scores_gemma":[0.9917436,0.003927398,0.00029243797,0.002473969,0.0013786581,0.00018391805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021478485,0.0008438323,0.0014781125,0.0009874349,0.0011605026,0.0027342662,0.002371938,0.0022854165,0.017089633],"category_scores_gemma":[0.030874526,0.0009037714,0.00064438995,0.0021188608,0.0012701821,0.015180862,0.0023116253,0.0016063924,0.014064189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007263766,0.00009892104,0.0013723705,0.00062705664,0.000082304185,0.0001532512,0.00020232052,0.011875666,0.0057841614,0.103266805,0.07733141,0.7984793],"study_design_scores_gemma":[0.00015538714,0.00015603533,0.0015328717,0.0003218106,0.00011767779,0.0012632506,0.0006270809,0.12593473,0.012133661,0.7502418,0.10738718,0.00012847007],"about_ca_topic_score_codex":0.0027838808,"about_ca_topic_score_gemma":0.0031931722,"teacher_disagreement_score":0.017089633,"about_ca_system_score_codex":0.00050933147,"about_ca_system_score_gemma":0.00081139995,"threshold_uncertainty_score":0.05717051},"labels":[],"label_agreement":null},{"id":"W2817786446","doi":"10.1007/978-3-319-94968-0_4","title":"PBMarsNet: A Multivariate Adaptive Regression Splines Based Method to Reconstruct Gene Regulatory Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Saskatchewan","funders":"","keywords":"Overfitting; Computer science; Multivariate adaptive regression splines; Artificial intelligence; Feature selection; Gene regulatory network; Regression; Data mining; Random forest; Interpretability; Multivariate statistics; Machine learning; Genetic programming; Feature (linguistics); Spline (mechanical); Regression analysis; Artificial neural network; Bayesian multivariate linear regression; Mathematics; Gene; Statistics","score_opus":0.02116341083293406,"score_gpt":0.28796209801587197,"score_spread":0.2667986871829379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2817786446","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.0027506978,0.00014157253,0.98934,0.00005635691,0.000057913214,0.000027728402,0.0005087884,0.0064972984,0.00061958266],"genre_scores_gemma":[0.0390715,0.00028214793,0.9510946,0.00011369136,0.000058967562,0.00022078163,0.002508826,0.0025372182,0.0041121794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995797,0.00012891984,0.000018342094,0.00009748025,0.00014387576,0.000031643587],"domain_scores_gemma":[0.99915314,0.0005167646,0.00004617523,0.000111690846,0.0001300922,0.000042165575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012675178,0.001075219,0.0013378214,0.0013833914,0.00061132055,0.0010881585,0.0025289957,0.0014533479,0.009207099],"category_scores_gemma":[0.0029928132,0.0010307202,0.0018683261,0.001324082,0.0005685881,0.00088089745,0.001141334,0.0026843615,0.0035259689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029070917,0.00014323427,0.001447271,0.00033101236,0.00028286484,0.00019623693,0.00016791183,0.52542365,0.011434633,0.022005169,0.02038159,0.41789573],"study_design_scores_gemma":[0.000019126086,0.000011091255,0.00011464756,0.000011109632,0.000014099437,0.000020660931,0.000009628919,0.98819864,0.0014335581,0.00634472,0.003812636,0.000009946898],"about_ca_topic_score_codex":0.010506001,"about_ca_topic_score_gemma":0.019014189,"teacher_disagreement_score":0.010506001,"about_ca_system_score_codex":0.0005519157,"about_ca_system_score_gemma":0.0015193224,"threshold_uncertainty_score":0.03080082},"labels":[],"label_agreement":null},{"id":"W2819365590","doi":"10.1007/978-3-319-96133-0_1","title":"Fusing Dimension Reduction and Classification for Mining Interesting Frequent Patterns in Patients Data","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Ontario Tech University","funders":"","keywords":"Computer science; Dimension (graph theory); Dimensionality reduction; Reduction (mathematics); Data reduction; Data mining; Artificial intelligence; Pattern recognition (psychology); Mathematics; Combinatorics","score_opus":0.06933210639986034,"score_gpt":0.2981770108183694,"score_spread":0.22884490441850905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2819365590","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.2037773,0.0074600102,0.77748555,0.0013955614,0.0005020481,0.00035802397,0.0040333685,0.0022185503,0.0027695566],"genre_scores_gemma":[0.6420563,0.0026551634,0.34436667,0.00033109402,0.0007367939,0.0004195691,0.0076223593,0.0001133485,0.001698688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975569,0.00053437316,0.00036820478,0.00053243194,0.00076687755,0.00024120933],"domain_scores_gemma":[0.99458003,0.003507727,0.00038141198,0.0006666594,0.00070919754,0.00015500598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026306643,0.001314595,0.0024626872,0.004373582,0.0005456952,0.0017280154,0.0011550962,0.0010393141,0.0014173345],"category_scores_gemma":[0.008759603,0.0004347337,0.0025352102,0.0047150073,0.00043091862,0.0018534616,0.0015363101,0.00129767,0.0009190395],"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.00090825907,0.000704322,0.037550323,0.0005838876,0.00081944617,0.00054566714,0.00048368884,0.028072001,0.011714271,0.003958941,0.009356281,0.905303],"study_design_scores_gemma":[0.00008322051,0.00061296346,0.026230425,0.00021678387,0.00073875376,0.0012452782,0.00061802374,0.9202331,0.008873291,0.03372665,0.007314429,0.00010701859],"about_ca_topic_score_codex":0.0017948876,"about_ca_topic_score_gemma":0.0021160387,"teacher_disagreement_score":0.004373582,"about_ca_system_score_codex":0.00036889527,"about_ca_system_score_gemma":0.0009773071,"threshold_uncertainty_score":0.013912439},"labels":[],"label_agreement":null},{"id":"W281975417","doi":"10.1007/978-3-642-40760-4_46","title":"Robust Intraoperative US Probe Tracking Using a Monocular Endoscopic Camera","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Robarts Clinical Trials; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer vision; Computer science; Artificial intelligence; Monocular; Calibration; Kalman filter; Feature (linguistics); Tracking (education); Ultrasound; Context (archaeology); Monocular vision; Radiology; Medicine; Mathematics","score_opus":0.01994106226615605,"score_gpt":0.22376859882135583,"score_spread":0.20382753655519978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W281975417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020864964,0.00046265105,0.97615564,0.000145011,0.00008715397,0.00002656751,0.00005704147,0.0010829985,0.0011180001],"genre_scores_gemma":[0.3726318,0.0007845745,0.6218313,0.00025545005,0.00009359144,0.00010155206,0.00019037527,0.00020536415,0.0039060325],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913365,0.00012741983,0.000055444827,0.00021336526,0.0003932135,0.000076899305],"domain_scores_gemma":[0.9989291,0.00026483135,0.00019428115,0.00022284962,0.00030987704,0.00007911362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068046484,0.0010029065,0.0009678376,0.0007612794,0.00036914612,0.0010551699,0.0008305036,0.0012224294,0.001156998],"category_scores_gemma":[0.0025704645,0.0009201961,0.000580139,0.0007706199,0.00024911517,0.0011731298,0.0016276544,0.0009456641,0.00086790445],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085502875,0.00007975241,0.0038049691,0.00023842481,0.000116123534,0.0006869225,0.0002253614,0.020671738,0.40819687,0.0016936618,0.004168397,0.5592628],"study_design_scores_gemma":[0.00008361928,0.0007181175,0.010794681,0.00007760656,0.00017689104,0.005140543,0.00009800625,0.8001931,0.1719612,0.0017471121,0.008855166,0.00015397565],"about_ca_topic_score_codex":0.001378629,"about_ca_topic_score_gemma":0.0020288252,"teacher_disagreement_score":0.001378629,"about_ca_system_score_codex":0.00034372375,"about_ca_system_score_gemma":0.0011136221,"threshold_uncertainty_score":0.0038704872},"labels":[],"label_agreement":null},{"id":"W2820313700","doi":"10.1007/978-3-319-95933-7_27","title":"Using Deep Neural Network to Predict Drug Sensitivity of Cancer Cell Lines","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Cancer cell lines; Artificial neural network; Deep learning; Artificial intelligence; Sensitivity (control systems); Cancer drugs; Deep neural networks; Cancer; Machine learning; Data mining; Cancer cell; Medicine; Internal medicine","score_opus":0.029590375749250025,"score_gpt":0.30930996486309587,"score_spread":0.27971958911384587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2820313700","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.83648074,0.0048793624,0.1445192,0.0005963281,0.00022296897,0.00007510444,0.0026628375,0.0021876055,0.008375886],"genre_scores_gemma":[0.974006,0.00082420313,0.018759526,0.00012673759,0.000030861152,0.000039282597,0.0018890556,0.000042529336,0.004281655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988914,0.000014018655,0.000006736406,0.000028944156,0.000039745573,0.000021384949],"domain_scores_gemma":[0.9996942,0.0001535661,0.00003588579,0.000024170504,0.00007726945,0.000014977894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033771322,0.00055878557,0.0004337859,0.00060366624,0.00010917004,0.00051254313,0.00047997618,0.0005425541,0.0010067784],"category_scores_gemma":[0.0007176409,0.00021952303,0.0004996986,0.00041649907,0.00012720474,0.000428565,0.00025924004,0.00065057277,0.00042900906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005658343,0.00046923422,0.021818783,0.00021433145,0.0002469094,0.00016337947,0.000043758384,0.60965633,0.072974026,0.0013021922,0.0052799354,0.28726524],"study_design_scores_gemma":[0.000006472019,0.00008982582,0.0024200229,0.000006377978,0.000029022178,0.00002400685,0.0000057031384,0.98568624,0.010543028,0.0007121377,0.00046872578,0.00000842575],"about_ca_topic_score_codex":0.004552344,"about_ca_topic_score_gemma":0.0058587277,"teacher_disagreement_score":0.004552344,"about_ca_system_score_codex":0.0007224889,"about_ca_system_score_gemma":0.00029830151,"threshold_uncertainty_score":0.009051681},"labels":[],"label_agreement":null},{"id":"W2823780422","doi":"10.1007/978-3-319-96133-0_10","title":"When Different Is Wrong: Visual Unsupervised Validation for Web Information Extraction","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Outlier; Robustness (evolution); Information extraction; Artificial intelligence; Data mining; Context (archaeology); Information retrieval; Machine learning","score_opus":0.021952899054827328,"score_gpt":0.2721291305623071,"score_spread":0.25017623150747975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2823780422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039966296,0.0014196137,0.9121793,0.0015954517,0.00044928968,0.0003332256,0.0022196649,0.033202533,0.008634584],"genre_scores_gemma":[0.26729906,0.0006120384,0.7118711,0.0010270566,0.00015399996,0.00024931296,0.0056979363,0.0060054897,0.007083941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641824,0.0010730304,0.00028388124,0.00057216827,0.0014219357,0.00023071238],"domain_scores_gemma":[0.98535293,0.008954848,0.0008083121,0.0020843095,0.002538635,0.00026101965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006149456,0.0009969111,0.0008395859,0.0034065426,0.0009917595,0.004169298,0.0024221381,0.002201734,0.0047180783],"category_scores_gemma":[0.02153685,0.0006198962,0.0010197515,0.0014438673,0.0016148322,0.0034183885,0.0037383635,0.0019240453,0.0026073349],"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.0010145628,0.00018968697,0.0072519467,0.0008404246,0.00021187522,0.0009385634,0.0016460539,0.014555169,0.033251755,0.018953023,0.07794246,0.8432045],"study_design_scores_gemma":[0.00012910894,0.00012422373,0.008615131,0.00088894565,0.00014979955,0.0014395145,0.0013079483,0.65865606,0.09913882,0.13910477,0.09027478,0.0001709786],"about_ca_topic_score_codex":0.004072187,"about_ca_topic_score_gemma":0.0077376207,"teacher_disagreement_score":0.006149456,"about_ca_system_score_codex":0.00074918906,"about_ca_system_score_gemma":0.0015037498,"threshold_uncertainty_score":0.032521844},"labels":[],"label_agreement":null},{"id":"W2826831346","doi":"10.1007/978-3-319-94631-3_17","title":"Cycle Height of Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Computation; Polynomial; GF(2); Mathematics; Discrete mathematics; Combinatorics; Finite field; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Mathematical analysis","score_opus":0.011887819308244016,"score_gpt":0.23078918159480524,"score_spread":0.21890136228656124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2826831346","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.39951614,0.009195415,0.124534056,0.002031327,0.00085527974,0.00012255042,0.0011793426,0.0009903344,0.4615755],"genre_scores_gemma":[0.9454035,0.0025616,0.011128419,0.0002197332,0.0005032072,0.00009419906,0.00063638814,0.00025398066,0.039199002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996463,0.00004462498,0.000013513291,0.00008131849,0.00013475025,0.00007947953],"domain_scores_gemma":[0.99929345,0.0004160219,0.000033400862,0.00007594859,0.00009390007,0.0000873713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022233068,0.0004514212,0.0006104806,0.001623123,0.00096281094,0.0022886198,0.00075137656,0.0005520544,0.009632847],"category_scores_gemma":[0.0014877454,0.00045896237,0.0005153313,0.001797012,0.0013725171,0.0032015124,0.0011906951,0.0017870682,0.0011365538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004861377,0.0000180845,0.0001915709,0.000090250884,0.000007767136,0.00004566266,0.00027429074,0.0025288325,0.0022184204,0.96782625,0.0028848809,0.023865294],"study_design_scores_gemma":[0.0000074877794,0.000016024693,0.00025381555,0.000023195185,0.00001192087,0.00004187771,0.00006055066,0.004892005,0.0013379726,0.9848216,0.008522586,0.000011072787],"about_ca_topic_score_codex":0.001183649,"about_ca_topic_score_gemma":0.0011767116,"teacher_disagreement_score":0.009632847,"about_ca_system_score_codex":0.0014122388,"about_ca_system_score_gemma":0.0006509862,"threshold_uncertainty_score":0.032225132},"labels":[],"label_agreement":null},{"id":"W282841558","doi":"10.1007/978-3-319-10437-9_3","title":"Simulation of Ultrasound Images for Validation of MR to Ultrasound Registration in Neurosurgery","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"McGill University","funders":"","keywords":"Computer science; Ground truth; Artificial intelligence; Computer vision; Image registration; Outlier; Noise (video); Image (mathematics)","score_opus":0.017035146052870626,"score_gpt":0.27404719887135626,"score_spread":0.2570120528184856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W282841558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3455765,0.0011524548,0.6233524,0.00086658733,0.00030920876,0.00041762998,0.0017198091,0.0033238241,0.023281638],"genre_scores_gemma":[0.88681936,0.00044160843,0.105302244,0.00013272636,0.000025245292,0.00018620402,0.00074128713,0.00046230762,0.0058889636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997545,0.000091532784,0.000018398512,0.000028479682,0.00008496067,0.000022152453],"domain_scores_gemma":[0.9982002,0.0014067348,0.00007531217,0.000101675265,0.00018023702,0.00003581159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291061,0.0005024457,0.00044455877,0.00043849033,0.00024577198,0.00087976834,0.0009931357,0.0014039469,0.0045387656],"category_scores_gemma":[0.003851935,0.0003890937,0.00049396197,0.0003316923,0.00039956396,0.00035884263,0.0005377547,0.00045196048,0.0007166035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021007303,0.00006905462,0.0010954022,0.00012544775,0.000022951297,0.00018967353,0.00010989948,0.9685768,0.008104207,0.0021371401,0.0012429187,0.01811646],"study_design_scores_gemma":[0.000014811352,0.000045415065,0.00025410214,0.000013390797,0.000006651063,0.000065186054,0.000017411907,0.99303836,0.0051340424,0.0005852462,0.0008182586,0.0000071675086],"about_ca_topic_score_codex":0.0057648714,"about_ca_topic_score_gemma":0.003893985,"teacher_disagreement_score":0.0057648714,"about_ca_system_score_codex":0.00049251324,"about_ca_system_score_gemma":0.00083534064,"threshold_uncertainty_score":0.015183687},"labels":[],"label_agreement":null},{"id":"W283361348","doi":"10.1007/978-3-319-12206-9_40","title":"Creating Quantitative Goal Models: Governmental Experience","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Decision Making","field":"Decision Sciences","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":"McGill University; University of Ottawa","funders":"","keywords":"Goal setting; Goal orientation; Process management; Management science; Computer science; Business; Psychology; Engineering; Social psychology","score_opus":0.13082445979757398,"score_gpt":0.3764118859486785,"score_spread":0.24558742615110454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W283361348","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06935298,0.0017422617,0.6566655,0.013512072,0.00023751383,0.00022125225,0.00036555104,0.0011335951,0.2567693],"genre_scores_gemma":[0.5272606,0.0018880258,0.45073166,0.00057611195,0.00006031878,0.00028898366,0.00074088754,0.00080170226,0.017651614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9902564,0.008170344,0.00017726021,0.0003216328,0.0009066176,0.0001676698],"domain_scores_gemma":[0.97208357,0.023383183,0.0003829993,0.00237918,0.0014051085,0.00036601332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015714908,0.0008545483,0.0004979349,0.0011632175,0.0013716827,0.007407146,0.0019482649,0.0016095357,0.008641931],"category_scores_gemma":[0.032054618,0.0005464611,0.000637392,0.0018941468,0.0037082904,0.008823011,0.003719243,0.0026876072,0.0012652256],"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.000041839125,0.00015623683,0.00056709617,0.00017283684,0.000014664186,0.000044163073,0.0050448976,0.018771773,0.0003833701,0.86925745,0.008377199,0.09716853],"study_design_scores_gemma":[0.00003107429,0.000049033802,0.0002462859,0.00023333098,0.000018967856,0.000055176264,0.0049110674,0.09044018,0.0020862364,0.7926493,0.10924821,0.00003100349],"about_ca_topic_score_codex":0.0026790537,"about_ca_topic_score_gemma":0.0029835438,"teacher_disagreement_score":0.015714908,"about_ca_system_score_codex":0.0033588603,"about_ca_system_score_gemma":0.0025779463,"threshold_uncertainty_score":0.08310938},"labels":[],"label_agreement":null},{"id":"W283737480","doi":"10.1007/978-3-319-13560-1_47","title":"On Adding Inverse Features to the Description Logic $\\mathcal{CFD}^{\\forall}_{nc}$","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inverse; Computer science; P; Consistency (knowledge bases); Description logic; Relevance (law); Knowledge base; Theoretical computer science; Programming language; Artificial intelligence; Algebra over a field; Algorithm; Discrete mathematics; Mathematics; Time complexity; Pure mathematics","score_opus":0.03340130350349511,"score_gpt":0.2541787071222294,"score_spread":0.2207774036187343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W283737480","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.0045164037,0.0009939116,0.9117068,0.0026113137,0.00084670534,0.00015869239,0.0005624589,0.0042077983,0.07439593],"genre_scores_gemma":[0.068833835,0.0016334021,0.871037,0.002568132,0.0003590816,0.0002622231,0.0024347487,0.0023465403,0.050525118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808025,0.0004446307,0.00015412815,0.00029421106,0.00086630345,0.00016053561],"domain_scores_gemma":[0.99788946,0.0009293766,0.000050140046,0.0006759688,0.00038363904,0.0000714968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020810596,0.0010421555,0.00078183046,0.0016242934,0.0012556226,0.003964224,0.0027791217,0.0016177299,0.016008817],"category_scores_gemma":[0.005371205,0.00092126813,0.0026900135,0.0016676578,0.0024839551,0.011775057,0.0056863385,0.005202172,0.00503755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075499454,0.00007288797,0.00013341306,0.0002481162,0.00002852211,0.00012396,0.00024521854,0.0027774516,0.0017888251,0.7614201,0.019640237,0.2134458],"study_design_scores_gemma":[0.000031572148,0.000033282566,0.00010262013,0.00016496827,0.000066423556,0.00022726768,0.000079404024,0.02349099,0.0044845273,0.80050325,0.17076279,0.000052748295],"about_ca_topic_score_codex":0.005117258,"about_ca_topic_score_gemma":0.0090855565,"teacher_disagreement_score":0.016008817,"about_ca_system_score_codex":0.0016439236,"about_ca_system_score_gemma":0.0014090636,"threshold_uncertainty_score":0.053554833},"labels":[],"label_agreement":null},{"id":"W2849800916","doi":"10.1007/978-3-319-94968-0_12","title":"Sprites2: Detection of Deletions Based on an Accurate Alignment Strategy","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 Saskatchewan","funders":"","keywords":"Computer science; Breakpoint; Structural variation; Variation (astronomy); Greedy algorithm; Genome; Algorithm; Computational biology; Artificial intelligence; Genetics; Biology; Chromosome; Gene","score_opus":0.017400128728706166,"score_gpt":0.2518706210776127,"score_spread":0.23447049234890655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2849800916","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.084273666,0.0014436848,0.8018033,0.00039834165,0.00050877815,0.0004004266,0.011592846,0.095859855,0.0037191333],"genre_scores_gemma":[0.12469308,0.0004919386,0.82655936,0.00021362676,0.0001469056,0.0005050995,0.034079537,0.009220099,0.0040904074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969797,0.00046561589,0.00027168382,0.0009429644,0.0011119357,0.00022812253],"domain_scores_gemma":[0.9973024,0.001337122,0.0003863779,0.00043142436,0.00037964364,0.00016306655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025447528,0.0032913445,0.0021878558,0.0034047135,0.0009198898,0.002031192,0.0025877256,0.0017551942,0.0055665],"category_scores_gemma":[0.0067390664,0.0013002242,0.0014607655,0.0025744764,0.0005849908,0.0018244331,0.0017428144,0.0019986816,0.008678286],"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.0030182917,0.00039970028,0.009500544,0.0016292885,0.00058099814,0.0011485823,0.0005323706,0.007041887,0.40853578,0.003986956,0.07093884,0.49268675],"study_design_scores_gemma":[0.0006146637,0.0010795017,0.014470776,0.00024983866,0.0006316281,0.0064940224,0.0005447364,0.33713087,0.53947484,0.010763894,0.08817118,0.00037403317],"about_ca_topic_score_codex":0.00067354797,"about_ca_topic_score_gemma":0.0013022784,"teacher_disagreement_score":0.0055665,"about_ca_system_score_codex":0.00036168934,"about_ca_system_score_gemma":0.0008822469,"threshold_uncertainty_score":0.018621802},"labels":[],"label_agreement":null},{"id":"W2860371302","doi":"10.1007/978-3-319-95729-6_15","title":"On Understanding Permission Usage Contextuality in Android Apps","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Concordia University","funders":"","keywords":"Permission; Computer science; Android (operating system); World Wide Web; Context (archaeology); Set (abstract data type); Computer security; Internet privacy; Operating system; Programming language","score_opus":0.042893404052590435,"score_gpt":0.2909797214973263,"score_spread":0.2480863174447359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2860371302","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.65924954,0.011513353,0.27564853,0.0023237183,0.00023650815,0.00017704,0.0017079948,0.0018390022,0.047304425],"genre_scores_gemma":[0.96139675,0.001888171,0.03221364,0.00019140451,0.00010288294,0.000051432915,0.00058731984,0.00019999521,0.0033683116],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99951077,0.00010708487,0.000031561147,0.00016319107,0.000118598415,0.00006879127],"domain_scores_gemma":[0.9957469,0.0031044143,0.00038394783,0.00032110684,0.00035262917,0.000090929774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004749772,0.0004671826,0.00027295158,0.0013265724,0.0006314498,0.0021292232,0.00032869953,0.0005116462,0.002024993],"category_scores_gemma":[0.0059049134,0.0003688081,0.00035457965,0.0010096601,0.0008023783,0.005337648,0.0010562802,0.001232364,0.00052395696],"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.0003795959,0.00026495013,0.13602257,0.000911743,0.0001373301,0.0019359364,0.024774874,0.011047293,0.054505818,0.10116765,0.00848062,0.6603716],"study_design_scores_gemma":[0.000020683978,0.0003097615,0.28587347,0.0015039882,0.00040465125,0.0047584563,0.019513488,0.24579374,0.033843126,0.27478442,0.1329161,0.00027818608],"about_ca_topic_score_codex":0.0049504964,"about_ca_topic_score_gemma":0.009370278,"teacher_disagreement_score":0.0049504964,"about_ca_system_score_codex":0.00044679106,"about_ca_system_score_gemma":0.0005678634,"threshold_uncertainty_score":0.009843349},"labels":[],"label_agreement":null},{"id":"W286115074","doi":"10.1007/978-3-319-16745-9_17","title":"Second Preimage Analysis of Whirlwind","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Hash function; Computer science; Whirlwind; Cryptographic hash function; Collision attack; Function (biology); Block (permutation group theory); Algorithm; Compression (physics); Theoretical computer science; Arithmetic; Mathematics; Computer security; Double hashing; Combinatorics","score_opus":0.029655636589684585,"score_gpt":0.2892135006867308,"score_spread":0.25955786409704623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W286115074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2514686,0.0024696821,0.5440662,0.0017210332,0.0009153332,0.00014467281,0.00030006337,0.0020843856,0.19683018],"genre_scores_gemma":[0.8995594,0.0005644468,0.027373344,0.00031964396,0.00028335175,0.000047950918,0.00024423466,0.00068384066,0.07092383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993411,0.00006200044,0.000027661701,0.00010239834,0.00027796,0.00018897555],"domain_scores_gemma":[0.9991602,0.0002583091,0.00007304582,0.00029864218,0.00015483839,0.000055060424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040489231,0.0007583245,0.0007128029,0.0016249308,0.0013064538,0.0021350484,0.00082732673,0.0011804062,0.013372602],"category_scores_gemma":[0.0022966384,0.0004360184,0.0010209326,0.00096912566,0.0020698435,0.0035221395,0.0019936839,0.002105011,0.0021067956],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017892134,0.000024322475,0.00036950316,0.00007189322,0.000019803925,0.0003694658,0.00037581552,0.003110732,0.008863709,0.9607039,0.0035505183,0.022361448],"study_design_scores_gemma":[0.000023202305,0.00009062118,0.00065000996,0.00008627381,0.00004520176,0.00075201114,0.00021168364,0.035952393,0.027080588,0.91009986,0.024951287,0.000056927605],"about_ca_topic_score_codex":0.0009168879,"about_ca_topic_score_gemma":0.0007053441,"teacher_disagreement_score":0.013372602,"about_ca_system_score_codex":0.0010522888,"about_ca_system_score_gemma":0.0007094036,"threshold_uncertainty_score":0.04473579},"labels":[],"label_agreement":null},{"id":"W286126187","doi":"10.1007/978-3-319-09165-5_7","title":"Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Game tree; Tree (set theory); Theoretical computer science; Artificial intelligence; Game theory; Sequential game; Statistics; Mathematical economics; Mathematics","score_opus":0.05078262854680907,"score_gpt":0.31156800766840675,"score_spread":0.2607853791215977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W286126187","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.56391203,0.00204139,0.39640254,0.00226179,0.00019970194,0.0002312901,0.0004726122,0.00081430306,0.033664405],"genre_scores_gemma":[0.95646924,0.00033738132,0.037974574,0.00022499039,0.00005614925,0.00022287978,0.0004144826,0.000304694,0.0039957054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978556,0.0012831591,0.000058697267,0.00020040195,0.00029170496,0.00031055088],"domain_scores_gemma":[0.9443758,0.0513603,0.0010884951,0.0012238383,0.00091529445,0.0010362203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044280607,0.0010486151,0.0017289033,0.001685822,0.0013134761,0.0019933083,0.0028582038,0.0030156733,0.008284947],"category_scores_gemma":[0.043687284,0.0009702334,0.0013511465,0.0015181272,0.002989588,0.0036951867,0.0017525019,0.0033471545,0.00048816254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013299436,0.00010998525,0.0017592128,0.000058950078,0.00005494385,0.0000422547,0.0001188834,0.8854066,0.00018394101,0.108272254,0.0010476217,0.0028123993],"study_design_scores_gemma":[0.00001192655,0.000010085623,0.000115071256,0.000008172083,0.00000490256,0.0000053250237,0.000019806535,0.97248197,0.00003885372,0.02719947,0.00009978161,0.000004702343],"about_ca_topic_score_codex":0.018352848,"about_ca_topic_score_gemma":0.015990153,"teacher_disagreement_score":0.018352848,"about_ca_system_score_codex":0.0028474838,"about_ca_system_score_gemma":0.0024295824,"threshold_uncertainty_score":0.03649205},"labels":[],"label_agreement":null},{"id":"W28615604","doi":"10.1007/978-3-642-38868-2_44","title":"Moving Frames for Heart Fiber Geometry","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Geometry; Computer graphics (images); Fiber; Computer vision; Engineering drawing; Artificial intelligence; Mathematics; Engineering; Composite material; Materials science","score_opus":0.031902053099422636,"score_gpt":0.33720562827644507,"score_spread":0.30530357517702245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28615604","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.003053576,0.00058048323,0.99489576,0.0001369092,0.00010179315,0.000016850683,0.00019369223,0.00032064485,0.00070037774],"genre_scores_gemma":[0.13456388,0.0034767892,0.8470253,0.00014704015,0.0008103494,0.00013975994,0.0017172383,0.0007080262,0.011411608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999716,0.000073061994,0.000014217237,0.000100378835,0.000071270886,0.000025082078],"domain_scores_gemma":[0.9992988,0.00026517757,0.00008605271,0.00013471342,0.00015129319,0.00006397341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007145059,0.001092253,0.00096085895,0.0017990215,0.0004541451,0.0011542784,0.0014381915,0.0014845676,0.0061461194],"category_scores_gemma":[0.0028944472,0.0007239408,0.0008944072,0.0012490805,0.0007396826,0.0015889549,0.0011008553,0.0021595703,0.0024598446],"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.00021348648,0.00006428333,0.00058981974,0.00027210193,0.000093885414,0.00023650321,0.00022284115,0.12832989,0.019617515,0.42898664,0.02056695,0.40080604],"study_design_scores_gemma":[0.000013738232,0.00004116063,0.00041002448,0.000024397985,0.000017617778,0.00008578914,0.000034177458,0.8761972,0.0014976497,0.111415595,0.01023879,0.000023894298],"about_ca_topic_score_codex":0.00798654,"about_ca_topic_score_gemma":0.0059338617,"teacher_disagreement_score":0.00798654,"about_ca_system_score_codex":0.00057797355,"about_ca_system_score_gemma":0.0005292781,"threshold_uncertainty_score":0.02056086},"labels":[],"label_agreement":null},{"id":"W28660007","doi":"10.1007/978-3-319-11755-3_8","title":"Gait Analysis from Video: Camcorders vs. Kinect","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gait Recognition and Analysis","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gait; Gait analysis; Treadmill; Computer science; Ground truth; Computer vision; Physical medicine and rehabilitation; Artificial intelligence; Set (abstract data type); Medicine; Physical therapy","score_opus":0.008325628442628635,"score_gpt":0.20396681680455625,"score_spread":0.19564118836192762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28660007","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.026434368,0.107781984,0.78150415,0.001739632,0.0023198002,0.00020085399,0.004373968,0.010247139,0.06539807],"genre_scores_gemma":[0.20593219,0.101281136,0.5996105,0.00088397675,0.001282736,0.00026407753,0.004489179,0.002690107,0.08356615],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961156,0.00004165387,0.000026816695,0.00009566261,0.00020452075,0.000019910503],"domain_scores_gemma":[0.9996792,0.00012645421,0.00003093481,0.000034128756,0.0001081088,0.00002115375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204922,0.00084889214,0.0009497341,0.0014918866,0.00012896911,0.0016087834,0.0010641392,0.0009111241,0.015596124],"category_scores_gemma":[0.0011384153,0.0005096797,0.00045034307,0.0018499371,0.00038659797,0.0013629788,0.00066057686,0.00058922934,0.010232976],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026567496,0.000030899453,0.0008283907,0.0009123684,0.00006468436,0.000063965774,0.0000696002,0.0014784415,0.0420327,0.0029474767,0.02302186,0.9282839],"study_design_scores_gemma":[0.00019387623,0.0013114519,0.05986603,0.0066231154,0.0006038342,0.0100273825,0.0014765926,0.20457621,0.1973801,0.057120454,0.460205,0.0006160492],"about_ca_topic_score_codex":0.0008799223,"about_ca_topic_score_gemma":0.002229675,"teacher_disagreement_score":0.015596124,"about_ca_system_score_codex":0.0002109257,"about_ca_system_score_gemma":0.00021441434,"threshold_uncertainty_score":0.05217421},"labels":[],"label_agreement":null},{"id":"W28791922","doi":"10.1007/978-3-642-35261-4_17","title":"On the Advice Complexity of Buffer Management","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Dalhousie University","funders":"","keywords":"Advice (programming); Computer science; Buffer (optical fiber); Competitive analysis; Computational complexity theory; Online algorithm; Operations research; Mathematical optimization; Upper and lower bounds; Algorithm; Mathematics; Telecommunications","score_opus":0.043840296391982614,"score_gpt":0.2662340101763999,"score_spread":0.2223937137844173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28791922","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.1068721,0.007890669,0.66159415,0.022764018,0.0009429859,0.0002517813,0.0014429672,0.0014641427,0.19677727],"genre_scores_gemma":[0.7499869,0.006685872,0.18167917,0.0020174487,0.002500248,0.00048754213,0.00143659,0.0014378873,0.05376828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944583,0.0014468238,0.00031290177,0.0006912401,0.0022195203,0.0008712933],"domain_scores_gemma":[0.95080787,0.0410784,0.0013948472,0.0038037475,0.0018693754,0.001045737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034664993,0.0012351067,0.001991828,0.0018046072,0.002497375,0.0066250386,0.003849405,0.003543923,0.026561337],"category_scores_gemma":[0.04880272,0.0014945506,0.0019000581,0.0036312772,0.004329226,0.017803188,0.0041571674,0.008479953,0.0022741258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023851471,0.00011298099,0.0009325436,0.0003118455,0.000049344562,0.00015738436,0.00040884368,0.043877356,0.0010791095,0.8834908,0.01768314,0.05165818],"study_design_scores_gemma":[0.000034489687,0.000013800618,0.00024771053,0.000041998355,0.0000306275,0.00007631262,0.00006120125,0.104030676,0.0003701633,0.8916153,0.0034584748,0.00001926898],"about_ca_topic_score_codex":0.006211006,"about_ca_topic_score_gemma":0.005236727,"teacher_disagreement_score":0.026561337,"about_ca_system_score_codex":0.004593554,"about_ca_system_score_gemma":0.0036817312,"threshold_uncertainty_score":0.08885658},"labels":[],"label_agreement":null},{"id":"W287923820","doi":"10.1007/978-3-319-01790-7_13","title":"Human Spatial Behavior, Sensor Informatics, and Disaggregate Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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 Saskatchewan","funders":"","keywords":"Computer science; Global Positioning System; Pedestrian; Real-time computing; Tracking (education); Human–computer interaction; Data science; Artificial intelligence; Data mining; Telecommunications; Transport engineering","score_opus":0.01873355820278984,"score_gpt":0.23557690575437326,"score_spread":0.2168433475515834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W287923820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1536637,0.005841856,0.7517596,0.003236649,0.00023390821,0.000049502574,0.0045810877,0.0014364824,0.07919723],"genre_scores_gemma":[0.8884897,0.005118139,0.08905239,0.00030156443,0.00015124255,0.000055500343,0.0025115788,0.00020519418,0.014114691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997625,0.000057343335,0.000013366277,0.00006533581,0.000083526575,0.000017962397],"domain_scores_gemma":[0.9992576,0.00034633477,0.00010108705,0.00017882012,0.00008831865,0.000027860513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032039266,0.00035104767,0.00032038073,0.00079192535,0.00017419983,0.0014475728,0.00032040087,0.00031604254,0.0032076552],"category_scores_gemma":[0.0019298457,0.00027984896,0.00023501323,0.0019512335,0.0006266808,0.0015167161,0.00071052986,0.00052742864,0.00060026656],"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.00029008862,0.00012187118,0.047945134,0.00064707117,0.00018519073,0.0003199513,0.0014492291,0.13579041,0.013794644,0.3240394,0.01908162,0.45633543],"study_design_scores_gemma":[0.000010306362,0.00015484856,0.07732612,0.00021331404,0.000098168064,0.0008623665,0.00171475,0.35565525,0.009302663,0.47701162,0.077565275,0.000085339685],"about_ca_topic_score_codex":0.002988184,"about_ca_topic_score_gemma":0.005498471,"teacher_disagreement_score":0.0032076552,"about_ca_system_score_codex":0.0004513401,"about_ca_system_score_gemma":0.0002970392,"threshold_uncertainty_score":0.010730684},"labels":[],"label_agreement":null},{"id":"W2883305384","doi":"10.1007/978-3-319-96890-2_25","title":"Travel Time Forecasting with Combination of Spatial-Temporal and Time Shifting Correlation in CNN-LSTM Neural Network","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Divergence (linguistics); Convolutional neural network; Artificial intelligence; Feature (linguistics); Recurrent neural network; Artificial neural network; Time series; Focus (optics); Term (time); Pattern recognition (psychology); Data mining; Machine learning","score_opus":0.009222362141634499,"score_gpt":0.18689665145590315,"score_spread":0.17767428931426865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883305384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24517475,0.0036198895,0.73659676,0.00069369434,0.0011160007,0.00005243,0.0017542327,0.002863963,0.008128219],"genre_scores_gemma":[0.9342016,0.00096457853,0.057652365,0.00010620825,0.00022835663,0.00003596282,0.0014378114,0.00007008379,0.0053029945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990344,0.000007529602,0.000006575809,0.000038961993,0.000020542495,0.000023039196],"domain_scores_gemma":[0.9998404,0.00004094009,0.000016830198,0.000014585784,0.00007572243,0.000011622625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025924126,0.0006274224,0.0005077554,0.00041733647,0.00019452543,0.00049368077,0.00068259065,0.00041637322,0.0016374829],"category_scores_gemma":[0.00071115885,0.0003046897,0.00049474894,0.0010327027,0.00011976429,0.0009607295,0.00036310512,0.00080490083,0.0005445529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027151784,0.00016966525,0.0064363806,0.00014126237,0.00017479977,0.00013169812,0.00004643444,0.5066726,0.014352039,0.0024661666,0.00827718,0.46086022],"study_design_scores_gemma":[0.0000016551869,0.000008847094,0.00053449103,0.000003126373,0.00001368503,0.00000897458,0.0000031363593,0.99793017,0.0008771351,0.00038964505,0.00022577061,0.0000034141879],"about_ca_topic_score_codex":0.021346867,"about_ca_topic_score_gemma":0.025776349,"teacher_disagreement_score":0.021346867,"about_ca_system_score_codex":0.0005346126,"about_ca_system_score_gemma":0.0006023498,"threshold_uncertainty_score":0.042445242},"labels":[],"label_agreement":null},{"id":"W2883719596","doi":"10.1007/978-3-319-96418-8_43","title":"Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Monic polynomial; Multivariate statistics; Polynomial; Bivariate analysis; Parallel computing; Algorithm; Theoretical computer science; Mathematics; Machine learning","score_opus":0.023309093992908318,"score_gpt":0.25913856101177296,"score_spread":0.23582946701886465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883719596","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.021250691,0.00023394509,0.9633282,0.00015295482,0.00014311474,0.00017677434,0.00014541116,0.005753504,0.008815442],"genre_scores_gemma":[0.26999006,0.00033485776,0.7150166,0.00023577336,0.00018991702,0.00023243592,0.00054541265,0.000534404,0.012920528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995691,0.00005588261,0.000025168863,0.00006735088,0.0001877009,0.0000948101],"domain_scores_gemma":[0.9996233,0.000053797306,0.00002922717,0.00013143105,0.00012387567,0.0000383299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035707903,0.00085368933,0.0006101252,0.00069687894,0.0005155123,0.0009947546,0.001413661,0.0005107918,0.014410352],"category_scores_gemma":[0.0009901164,0.00048445366,0.00046651997,0.00091255107,0.00039532126,0.0012167669,0.00147772,0.0008945462,0.004930727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006855965,0.00032952908,0.001132381,0.000425059,0.00008278236,0.0003559676,0.0001800189,0.018778093,0.12689029,0.07201007,0.026568837,0.7525613],"study_design_scores_gemma":[0.00047604542,0.0015662026,0.001732207,0.00013225173,0.00019866764,0.001591983,0.00026697907,0.5986417,0.22922567,0.07282432,0.093156494,0.00018744133],"about_ca_topic_score_codex":0.00066048745,"about_ca_topic_score_gemma":0.0017382501,"teacher_disagreement_score":0.014410352,"about_ca_system_score_codex":0.0003130292,"about_ca_system_score_gemma":0.00080596923,"threshold_uncertainty_score":0.048207402},"labels":[],"label_agreement":null},{"id":"W2883844381","doi":"10.1007/978-3-319-96145-3_39","title":"Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain; Probabilistic logic; Generalization; Equivalence relation; Equivalence (formal languages); Algorithm; Markov process; Mathematics; Discrete mathematics; Total variation; Combinatorics; Computer science; Statistics","score_opus":0.04381443064443207,"score_gpt":0.2925889104563065,"score_spread":0.2487744798118744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883844381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041463684,0.00025217803,0.9477977,0.00043806096,0.00010617907,0.0003079213,0.00051592203,0.004764958,0.004353427],"genre_scores_gemma":[0.25010705,0.00016714209,0.7430402,0.00024383939,0.00006654346,0.0003344125,0.0018459182,0.0009776076,0.003217264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933996,0.0010601678,0.0006815093,0.002492401,0.0017367668,0.0006295727],"domain_scores_gemma":[0.9807726,0.01368834,0.00091301254,0.002513965,0.0016073855,0.00050473417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028900565,0.0017820055,0.0019331503,0.0018006499,0.0016915174,0.0033124024,0.0026157124,0.0025702799,0.01040638],"category_scores_gemma":[0.023608094,0.00096467946,0.0029651385,0.0013513402,0.0022066222,0.0076995147,0.00453204,0.0038009176,0.0025913294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020200345,0.00058996404,0.0051863617,0.0013060439,0.00028135825,0.000521818,0.000842691,0.16807762,0.046929523,0.2655193,0.013963703,0.49476156],"study_design_scores_gemma":[0.00019981618,0.00019784641,0.0006081193,0.00008771749,0.00008837883,0.00036746947,0.0002027448,0.59350145,0.03735417,0.36069137,0.0065979008,0.0001030716],"about_ca_topic_score_codex":0.0018217883,"about_ca_topic_score_gemma":0.002588478,"teacher_disagreement_score":0.01040638,"about_ca_system_score_codex":0.0034796656,"about_ca_system_score_gemma":0.0040718373,"threshold_uncertainty_score":0.034812808},"labels":[],"label_agreement":null},{"id":"W2883993395","doi":"10.1007/978-3-319-96418-8_35","title":"Identification of Errors in Mathematical Symbolism and Notation: Implications for Software Design","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual and Cognitive Learning Processes","field":"Psychology","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":"Trent University","funders":"","keywords":"Mathematical notation; Computer science; Notation; Correctness; Mathematical software; Software; Usability; Focus (optics); Mathematical structure; Human–computer interaction; Comprehension; Mathematical problem; Mathematical theory; Identification (biology); Language of mathematics; Formalism (music); Artificial intelligence; Programming language; Mathematics education; Mathematics","score_opus":0.055790690335544985,"score_gpt":0.3572176100081694,"score_spread":0.30142691967262436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883993395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2907388,0.0017250946,0.6418751,0.0054960097,0.00050876656,0.00019939209,0.00041029704,0.0014488684,0.057597697],"genre_scores_gemma":[0.8079059,0.00058995216,0.1835252,0.00032412712,0.00010596857,0.00013162219,0.0003256947,0.0003557166,0.0067358813],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9903618,0.0034997421,0.0013463197,0.0011820571,0.0033030603,0.0003069623],"domain_scores_gemma":[0.8104741,0.1521555,0.011290977,0.01327462,0.01186326,0.00094151933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011658499,0.00076455134,0.0007258741,0.0022651192,0.0007128902,0.006576802,0.0022227005,0.002194025,0.0074940105],"category_scores_gemma":[0.19703406,0.0006072058,0.0006062828,0.002240464,0.0033676706,0.01281325,0.00354589,0.002871549,0.0012340124],"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.0007723629,0.00044157432,0.03383165,0.0007031288,0.00006672156,0.0006227529,0.010698627,0.0062373597,0.0073387525,0.41225433,0.0050423653,0.52199036],"study_design_scores_gemma":[0.00006432051,0.00018440488,0.014802991,0.00043022688,0.000072414674,0.0014081796,0.003612124,0.04151775,0.016757568,0.9104709,0.010581658,0.00009746783],"about_ca_topic_score_codex":0.000780347,"about_ca_topic_score_gemma":0.00048256674,"teacher_disagreement_score":0.011658499,"about_ca_system_score_codex":0.000883268,"about_ca_system_score_gemma":0.0017473001,"threshold_uncertainty_score":0.061656773},"labels":[],"label_agreement":null},{"id":"W2884371298","doi":"10.1007/978-3-319-97676-1_4","title":"Associative Memory: An Spiking Neural Network Robotic Implementation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Cégep du Vieux Montréal; University of Ottawa","funders":"","keywords":"Computer science; Bidirectional associative memory; Content-addressable memory; Artificial intelligence; Artificial neural network; Spiking neural network; Spike (software development); Associative property; Coding (social sciences)","score_opus":0.02390516324894185,"score_gpt":0.28097286226465484,"score_spread":0.25706769901571297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884371298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05625524,0.00057337567,0.8938268,0.0005664636,0.0004474929,0.000059233815,0.00013018739,0.0023606138,0.04578055],"genre_scores_gemma":[0.7546932,0.00055257085,0.21918468,0.0002382938,0.000065037704,0.00010547766,0.00012536094,0.00013920793,0.024896253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995804,0.0000054338543,0.000002737556,0.000010026281,0.00001738805,0.0000063751045],"domain_scores_gemma":[0.999943,0.000014786889,0.0000045123575,0.000015369846,0.000013819604,0.000008483656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012318167,0.00018756783,0.00021105664,0.00011658491,0.000220352,0.00053178665,0.0014274272,0.00062696333,0.0056602196],"category_scores_gemma":[0.00030226915,0.00015882344,0.00022995858,0.00026497705,0.00030855509,0.0006512502,0.0005874066,0.0005346001,0.00073329225],"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.00026833382,0.00020414325,0.0005401312,0.0002593944,0.00010308451,0.0002241096,0.00008983554,0.2846139,0.104234815,0.23517363,0.008624779,0.3656639],"study_design_scores_gemma":[0.000025821893,0.00007568891,0.00015720242,0.000013522138,0.000027509344,0.00007645143,0.000013850916,0.92587906,0.016236553,0.05004271,0.0074371244,0.000014512285],"about_ca_topic_score_codex":0.0007856143,"about_ca_topic_score_gemma":0.0013531799,"teacher_disagreement_score":0.0056602196,"about_ca_system_score_codex":0.00023206712,"about_ca_system_score_gemma":0.00033414253,"threshold_uncertainty_score":0.018935263},"labels":[],"label_agreement":null},{"id":"W2884442510","doi":"10.1007/978-3-030-00536-8_13","title":"RS-Net: Regression-Segmentation 3D CNN for Synthesis of Full Resolution Missing Brain MRI in the Presence of Tumours","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fluid-attenuated inversion recovery; Segmentation; Artificial intelligence; Dropout (neural networks); Voxel; Convolutional neural network; Pattern recognition (psychology); Partial volume; Convolution (computer science); Artificial neural network; Magnetic resonance imaging; Machine learning; Radiology; Medicine","score_opus":0.024057024919331895,"score_gpt":0.28900056039835326,"score_spread":0.2649435354790214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884442510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010856367,0.0009582349,0.97491974,0.0002778111,0.0001843923,0.000075167,0.0013022304,0.008045588,0.003380442],"genre_scores_gemma":[0.15579444,0.0014217099,0.8207267,0.00048958656,0.0001483394,0.00016500406,0.0046000998,0.0021289275,0.014525317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999858,0.0000168726,0.000007012462,0.000040320083,0.000054903492,0.000022804476],"domain_scores_gemma":[0.99981374,0.00006654517,0.000019641024,0.000032614807,0.000052210096,0.00001522792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637823,0.0011550384,0.00059401186,0.0005556171,0.00015680658,0.000770288,0.001265505,0.001156105,0.006928775],"category_scores_gemma":[0.0010816153,0.00074725103,0.00082626037,0.0004081575,0.00023165793,0.0006444209,0.0008006964,0.001013601,0.0033984093],"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.00036993346,0.000066904104,0.0009961152,0.0004439511,0.00022027639,0.00045363192,0.00008985286,0.15980388,0.0912985,0.0045381105,0.02906423,0.71265465],"study_design_scores_gemma":[0.00001212372,0.00006578794,0.0005485987,0.000045404395,0.000048864742,0.00040027476,0.000017220142,0.9491842,0.03704442,0.003018941,0.009587347,0.000026904883],"about_ca_topic_score_codex":0.003679383,"about_ca_topic_score_gemma":0.009772966,"teacher_disagreement_score":0.006928775,"about_ca_system_score_codex":0.0004856907,"about_ca_system_score_gemma":0.0008140183,"threshold_uncertainty_score":0.023179054},"labels":[],"label_agreement":null},{"id":"W2884894304","doi":"10.1007/978-3-319-97676-1_23","title":"Transforming Kantian Aesthetic Principles into Qualitative Hermeneutics for Contemplative AGI Agents","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI 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":"Simon Fraser University","funders":"","keywords":"Contemplation; Hermeneutics; Computer science; Aesthetics; Epistemology; Philosophy; Cognitive science; Psychology","score_opus":0.07093446716958052,"score_gpt":0.3358036743644492,"score_spread":0.26486920719486867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884894304","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02176742,0.0004936072,0.5319509,0.0046731764,0.00034452614,0.000091399146,0.00014282657,0.00037100946,0.44016513],"genre_scores_gemma":[0.82942986,0.00031187152,0.11559135,0.0005213783,0.00011882686,0.0002176222,0.00013105855,0.00034634816,0.053331655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.000497638,0.000054837663,0.00012404996,0.00031735955,0.00012776906],"domain_scores_gemma":[0.9989851,0.00044632165,0.00006672506,0.00026540874,0.0001674744,0.000069022615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017045764,0.00060581067,0.00038312303,0.0006514647,0.0018490447,0.004439125,0.0012138088,0.0017442246,0.012822524],"category_scores_gemma":[0.0044412646,0.0006040898,0.00087762,0.0007209002,0.009789855,0.005867157,0.003341368,0.0043381164,0.0020482673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027742872,0.000003268311,0.000012445974,0.000006614686,0.0000011023908,0.0000058266937,0.0003242141,0.00033537793,0.00007918272,0.9974815,0.0002900693,0.0014577472],"study_design_scores_gemma":[0.000003442375,0.000002389713,0.000013234184,0.000006071406,0.0000012213552,0.0000066737844,0.00011567464,0.0012755764,0.000097296404,0.99466103,0.0038142467,0.000003248333],"about_ca_topic_score_codex":0.0011878207,"about_ca_topic_score_gemma":0.0017928999,"teacher_disagreement_score":0.012822524,"about_ca_system_score_codex":0.0025854167,"about_ca_system_score_gemma":0.0012866056,"threshold_uncertainty_score":0.042895675},"labels":[],"label_agreement":null},{"id":"W2885064178","doi":"10.1007/978-3-319-98539-8_6","title":"E-Commerce Product Recommendation Using Historical Purchases and Clickstream Data","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Clickstream; Computer science; Session (web analytics); Recommender system; Collaborative filtering; Decision tree; Quality (philosophy); Product (mathematics); Association rule learning; Data mining; Information retrieval; World Wide Web; The Internet","score_opus":0.08579467400443169,"score_gpt":0.30670168572464773,"score_spread":0.22090701172021604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885064178","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.77452075,0.011218185,0.1437783,0.00095993705,0.0008764428,0.00036809378,0.04533795,0.006895519,0.016044868],"genre_scores_gemma":[0.8526489,0.002728567,0.090508744,0.00011774735,0.0005670094,0.00011301471,0.041687783,0.00013050609,0.011497708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994487,0.00007546161,0.000054991455,0.0001698719,0.00018528297,0.00006563739],"domain_scores_gemma":[0.99869066,0.00061323005,0.0001012191,0.00017556739,0.00035363893,0.00006580199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007528928,0.0011592623,0.0011892398,0.0044831038,0.00036308717,0.0013194594,0.00082588656,0.0011914796,0.0034236638],"category_scores_gemma":[0.0030785555,0.00053577643,0.0010302038,0.005530059,0.00012813593,0.0017417547,0.00045312892,0.00075977336,0.0051739053],"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.0012777505,0.0013748035,0.144772,0.0005634052,0.0010593499,0.00048589928,0.00013716769,0.027402554,0.009529641,0.0007501249,0.03536928,0.77727807],"study_design_scores_gemma":[0.00006215191,0.00032291177,0.117282204,0.0000864754,0.00045141613,0.0007161214,0.00013453176,0.8687168,0.004499739,0.001637937,0.0059786215,0.00011114265],"about_ca_topic_score_codex":0.017116616,"about_ca_topic_score_gemma":0.048837095,"teacher_disagreement_score":0.017116616,"about_ca_system_score_codex":0.00038875444,"about_ca_system_score_gemma":0.00041021648,"threshold_uncertainty_score":0.034033954},"labels":[],"label_agreement":null},{"id":"W2885121511","doi":"10.1007/978-3-030-01267-0_26","title":"SketchyScene: Richly-Annotated Scene Sketches","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Sketch; Pipeline (software); Closed captioning; Ground truth; Artificial intelligence; Object (grammar); Crowdsourcing; Segmentation; Scalability; Zoom; Information retrieval; Computer vision; Image (mathematics); World Wide Web; Database; Programming language","score_opus":0.01634494456528172,"score_gpt":0.26793236310966384,"score_spread":0.2515874185443821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885121511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003193705,0.0012306626,0.9153375,0.0002078905,0.00028971807,0.00029527,0.012786009,0.050660852,0.01599841],"genre_scores_gemma":[0.08437425,0.0038188186,0.8222229,0.00030475514,0.0000881209,0.0007319646,0.032988522,0.022742463,0.03272815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995048,0.00007172695,0.00003371747,0.00012605531,0.0002212981,0.00004245841],"domain_scores_gemma":[0.998936,0.00045708017,0.000039402134,0.00034551925,0.00013195362,0.00009005074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051699544,0.0026580468,0.0010850825,0.0016427673,0.00045090512,0.0031477308,0.0033865632,0.0014326853,0.11905784],"category_scores_gemma":[0.004112393,0.0017482811,0.0015145622,0.0012213645,0.00061708625,0.002756639,0.0044699097,0.0023704816,0.028011767],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005697401,0.00013253329,0.00051875424,0.0032197332,0.00018180124,0.0008136351,0.00075002597,0.07281221,0.04570905,0.049201876,0.1882367,0.6378539],"study_design_scores_gemma":[0.00016311533,0.00011572335,0.0006073213,0.00072961964,0.00006917093,0.0015558155,0.00029206794,0.24470499,0.04402813,0.06453121,0.6430039,0.00019901714],"about_ca_topic_score_codex":0.0018057086,"about_ca_topic_score_gemma":0.005404383,"teacher_disagreement_score":0.11905784,"about_ca_system_score_codex":0.00048696413,"about_ca_system_score_gemma":0.0006633856,"threshold_uncertainty_score":0.39828813},"labels":[],"label_agreement":null},{"id":"W2885155228","doi":"10.1007/978-3-319-99368-3_31","title":"Exploring GTRS Based Recommender Systems with Users of Different Rating Patterns","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Recommender system; Set (abstract data type); Preference; Data mining; Data set; Quality (philosophy); Scale (ratio); Information retrieval; Machine learning; Artificial intelligence; Statistics; Mathematics","score_opus":0.07768754748696677,"score_gpt":0.24054375883367013,"score_spread":0.16285621134670336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885155228","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.6198232,0.0021657413,0.3615326,0.0016897286,0.00018966333,0.00021180378,0.0007738724,0.0010121206,0.012601297],"genre_scores_gemma":[0.89761186,0.00048948685,0.09493055,0.00013759722,0.00007914931,0.000060778322,0.00071785174,0.000076385186,0.0058963536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867463,0.0006686167,0.000054747376,0.00031043313,0.00018662197,0.00010491401],"domain_scores_gemma":[0.995317,0.0033552628,0.00018444065,0.0005145945,0.00047213878,0.00015665282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018285094,0.00067285215,0.0008880165,0.001000289,0.00060040475,0.0022764087,0.0015505819,0.0011577581,0.0046624243],"category_scores_gemma":[0.007938561,0.0004777787,0.0011899888,0.0015938878,0.00043782368,0.0031691527,0.0009118405,0.001087775,0.0010127703],"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.0029655888,0.0014300763,0.049966797,0.0012309649,0.001665443,0.0016281367,0.0034039996,0.41067666,0.02231453,0.07325325,0.016251117,0.4152135],"study_design_scores_gemma":[0.0000504875,0.0002207737,0.0028633822,0.000022637687,0.00011644846,0.00013918924,0.00044083002,0.9781773,0.00077244185,0.015176696,0.001990286,0.000029465871],"about_ca_topic_score_codex":0.0098935785,"about_ca_topic_score_gemma":0.013372142,"teacher_disagreement_score":0.0098935785,"about_ca_system_score_codex":0.0006714682,"about_ca_system_score_gemma":0.00048188688,"threshold_uncertainty_score":0.019671977},"labels":[],"label_agreement":null},{"id":"W2885262262","doi":"10.1007/978-3-030-00937-3_84","title":"Star Shape Prior in Fully Convolutional Networks for Skin Lesion Segmentation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":122,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Convolutional neural network; Pattern recognition (psychology); Image segmentation; Deep learning; Star (game theory); Task (project management); Scale-space segmentation; Mathematics","score_opus":0.020805242844104017,"score_gpt":0.2682414393438889,"score_spread":0.24743619649978488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885262262","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.012949948,0.0026455533,0.97794664,0.00034399235,0.00011774852,0.00003953741,0.0004132938,0.0022873878,0.0032558742],"genre_scores_gemma":[0.2979218,0.005877981,0.6581458,0.00047022098,0.0002725392,0.000117144235,0.003224153,0.0014279571,0.032542497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982244,0.000028388602,0.0000091002685,0.000054056087,0.00005507674,0.00003104331],"domain_scores_gemma":[0.99963474,0.00014550728,0.0000278327,0.00006580323,0.00010256802,0.000023469467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651294,0.0009320324,0.00086531334,0.0007423915,0.00024313688,0.0010026351,0.0014256021,0.0013770951,0.003699197],"category_scores_gemma":[0.0011637405,0.0008843649,0.0009873826,0.0009043075,0.00039752206,0.0011220408,0.0010271565,0.0017292028,0.0023344418],"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.00024897515,0.0000850731,0.0005346271,0.00022170447,0.00010439242,0.00008753864,0.00005324262,0.33208564,0.021509422,0.013084319,0.013169946,0.6188151],"study_design_scores_gemma":[0.0000032837909,0.000017991088,0.00024151053,0.00001866632,0.000016968184,0.000052732812,0.000005016111,0.985021,0.0060686097,0.005664958,0.0028816247,0.000007630056],"about_ca_topic_score_codex":0.009672244,"about_ca_topic_score_gemma":0.017393528,"teacher_disagreement_score":0.009672244,"about_ca_system_score_codex":0.0009768319,"about_ca_system_score_gemma":0.001117772,"threshold_uncertainty_score":0.019231915},"labels":[],"label_agreement":null},{"id":"W2885457307","doi":"10.1007/978-3-319-98812-2_28","title":"Sprouter: Dynamic Graph Processing over Data Streams at Scale","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scalability; Graph; Online transaction processing; Data stream mining; Graph database; Analytics; Search engine indexing; Distributed computing; Theoretical computer science; Big data; Dynamic data; Data mining; Transaction processing; Database; Information retrieval; Database transaction","score_opus":0.015271571799185467,"score_gpt":0.2542480205316143,"score_spread":0.23897644873242885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885457307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077940123,0.00067934865,0.9488155,0.00046253542,0.00040176423,0.00012701892,0.0013532661,0.034383323,0.0059832903],"genre_scores_gemma":[0.12858622,0.0013322281,0.8368887,0.00038983027,0.0003546454,0.00025014058,0.0055633625,0.006418593,0.020216286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954385,0.00005597432,0.000023059769,0.00012605879,0.00021355039,0.000037498226],"domain_scores_gemma":[0.99908054,0.00040390217,0.000041114236,0.00026493182,0.00013777675,0.000071700466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171577,0.0012615968,0.0011063489,0.0011825461,0.0005884921,0.0016529197,0.0019758109,0.0008396244,0.013441465],"category_scores_gemma":[0.002830164,0.00070209143,0.0008426115,0.0016683612,0.000636536,0.0030435114,0.002027169,0.0018707722,0.0044026766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062877126,0.00021460852,0.0008077157,0.0005744205,0.00016227996,0.00028648175,0.0002860182,0.1525787,0.024266126,0.053951807,0.13979246,0.6264506],"study_design_scores_gemma":[0.000089205045,0.00005742947,0.00033645317,0.000034970566,0.000026883583,0.00014175769,0.00006154999,0.85128677,0.012551121,0.098999,0.036379516,0.000035364807],"about_ca_topic_score_codex":0.0029925571,"about_ca_topic_score_gemma":0.0038549097,"teacher_disagreement_score":0.013441465,"about_ca_system_score_codex":0.00060137006,"about_ca_system_score_gemma":0.0007044529,"threshold_uncertainty_score":0.04496622},"labels":[],"label_agreement":null},{"id":"W2885694481","doi":"10.1007/978-3-319-99368-3_6","title":"Tolerance Methods in Graph Clustering: Application to Community Detection in Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Winnipeg","funders":"","keywords":"Computer science; Cluster analysis; Robustness (evolution); Graph; Graph theory; Data mining; Modularity (biology); Community structure; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02231476825603048,"score_gpt":0.32563675717918567,"score_spread":0.3033219889231552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885694481","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.0045038043,0.00052137405,0.9935306,0.000171443,0.00009405193,0.00004602964,0.000051310715,0.0004491736,0.00063224765],"genre_scores_gemma":[0.12827149,0.0013887438,0.8631757,0.0001770314,0.0003916775,0.00027356812,0.00030162124,0.00070257,0.0053176726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982968,0.0006080781,0.0000931909,0.0003426305,0.0005561062,0.00010325607],"domain_scores_gemma":[0.9906357,0.0065407357,0.00059331715,0.0007267956,0.0011739011,0.0003296596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029704606,0.0012882598,0.0021690766,0.0032801942,0.0014829229,0.0019883579,0.0032839163,0.002604504,0.002753047],"category_scores_gemma":[0.016971096,0.000917853,0.0015184358,0.0050502038,0.0016262664,0.0025230679,0.003001625,0.0032383727,0.0011675463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022487754,0.00026601745,0.0025228108,0.0006584265,0.0002490915,0.00018665721,0.00064707,0.4566622,0.0068023447,0.07551851,0.013133408,0.4431287],"study_design_scores_gemma":[0.000013314749,0.000026353904,0.00039718288,0.00002204426,0.000024348981,0.00006496586,0.000054939508,0.9502516,0.001325409,0.04566348,0.0021346326,0.000021772712],"about_ca_topic_score_codex":0.004482391,"about_ca_topic_score_gemma":0.0040354817,"teacher_disagreement_score":0.004482391,"about_ca_system_score_codex":0.00105456,"about_ca_system_score_gemma":0.0009886172,"threshold_uncertainty_score":0.01570946},"labels":[],"label_agreement":null},{"id":"W2885772766","doi":"10.1007/978-3-319-98654-8_33","title":"Computational Complexity of Decision Problems on Self-verifying Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Decision problem; Nondeterministic finite automaton; Büchi automaton; Deterministic automaton; Computer science; Two-way deterministic finite automaton; Automaton; Computational complexity theory; Universality (dynamical systems); DFA minimization; Theoretical computer science; Deterministic finite automaton; NP; Equivalence (formal languages); Discrete mathematics; Algorithm; Automata theory; Mathematics; Computation; Turing machine","score_opus":0.033065120484532674,"score_gpt":0.26349418510358047,"score_spread":0.2304290646190478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885772766","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.4481182,0.0023281802,0.4760476,0.011670372,0.00039656195,0.00045933996,0.0026107028,0.0007336698,0.057635497],"genre_scores_gemma":[0.9224716,0.0009812987,0.062189322,0.0004300069,0.0005914527,0.0003352148,0.0019317674,0.00020880606,0.010860588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932133,0.002342404,0.00046168332,0.0012503318,0.0019370401,0.00079531537],"domain_scores_gemma":[0.9465362,0.04759946,0.0014695161,0.0022667223,0.0012508528,0.0008772576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037319437,0.0010694783,0.0021284989,0.0013877882,0.0017158802,0.009105441,0.0034640178,0.0026338124,0.013056541],"category_scores_gemma":[0.030488618,0.0012272636,0.0032142545,0.0021546409,0.004435755,0.01427945,0.004100482,0.0056772763,0.0007818256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000453317,0.0002306858,0.0015733219,0.00038963382,0.00012263905,0.00016841477,0.000521757,0.07647656,0.0010365571,0.88746166,0.004956027,0.026609302],"study_design_scores_gemma":[0.000050150455,0.000015335863,0.00017746915,0.00001799112,0.000019522546,0.00004066288,0.00006692217,0.08528742,0.00030435013,0.9133719,0.00063596526,0.000012333764],"about_ca_topic_score_codex":0.0021205007,"about_ca_topic_score_gemma":0.0019146384,"teacher_disagreement_score":0.013056541,"about_ca_system_score_codex":0.004229183,"about_ca_system_score_gemma":0.0029756718,"threshold_uncertainty_score":0.043678522},"labels":[],"label_agreement":null},{"id":"W2886113145","doi":"10.1007/978-3-319-98572-5_38","title":"The Effect of Personality and Course Attributes on Academic Performance in MOOCs","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"North American Construction Group (Canada); University of Alberta","funders":"","keywords":"Personality; Computer science; Attrition; Set (abstract data type); Machine learning; Feature engineering; Feature (linguistics); Artificial intelligence; Psychology; Social psychology; Deep learning","score_opus":0.014189303736953691,"score_gpt":0.2779046788946886,"score_spread":0.2637153751577349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886113145","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.99845374,0.00022394465,0.00004351724,0.00012005267,0.000035317644,0.0000035428275,0.000057711874,0.000005250575,0.0010569704],"genre_scores_gemma":[0.99876547,0.00007160626,0.000031594172,0.000034058165,0.000033663142,0.0000029210764,0.00006919333,0.0000048218135,0.0009865755],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984072,0.00067170046,0.000074673895,0.00019322644,0.0002748049,0.00037843265],"domain_scores_gemma":[0.9753625,0.010411467,0.0027266692,0.00082893495,0.0012322088,0.009438168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020169446,0.00031556684,0.00035986255,0.0006553618,0.000643847,0.0016006617,0.00054532656,0.0009192502,0.0043182992],"category_scores_gemma":[0.011509082,0.0002224013,0.0007837255,0.0007997261,0.000540566,0.00064080686,0.001192099,0.0017802074,0.0011696356],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028104538,0.0026301614,0.96495616,0.000033013926,0.00041093605,0.0001590593,0.0004133754,0.00059945777,0.0017200987,0.00016109654,0.00070916355,0.025396936],"study_design_scores_gemma":[0.000014505814,0.00039571346,0.99864835,0.0000095473,0.000039605686,0.000021912505,0.00021772369,0.00033573998,0.00011397602,0.00008821094,0.000107174965,0.0000075957887],"about_ca_topic_score_codex":0.005125307,"about_ca_topic_score_gemma":0.0074017146,"teacher_disagreement_score":0.005125307,"about_ca_system_score_codex":0.00060057535,"about_ca_system_score_gemma":0.0006957087,"threshold_uncertainty_score":0.014446139},"labels":[],"label_agreement":null},{"id":"W2886247548","doi":"10.1007/978-3-030-01228-1_48","title":"Visual Reasoning with Multi-hop Feature Modulation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Canadian Institute for Advanced Research; Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Computation; Feature (linguistics); Question answering; Natural language processing; Hierarchy; Algorithm","score_opus":0.013293937599181143,"score_gpt":0.279478282932439,"score_spread":0.26618434533325785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886247548","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.011846543,0.00048879505,0.975546,0.00023541089,0.000116692754,0.00005283232,0.00012867028,0.0012273022,0.010357768],"genre_scores_gemma":[0.5856269,0.00073685485,0.4010762,0.0002552852,0.00015081039,0.00011532671,0.00045277146,0.00020408691,0.011381769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968815,0.000051432737,0.000020590847,0.000099582285,0.000103947925,0.00003638043],"domain_scores_gemma":[0.9995154,0.00024526886,0.00003289645,0.000119536104,0.00006255868,0.000024375166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433247,0.0005987381,0.00046498628,0.0005512712,0.00030631493,0.0014048483,0.0014078632,0.000863949,0.008664641],"category_scores_gemma":[0.00248175,0.0002897636,0.0006135809,0.0005442182,0.0005513684,0.0026088334,0.0013646459,0.0010212905,0.001418526],"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.00043274692,0.00017022344,0.00033160765,0.00033211117,0.00007162264,0.00026594015,0.00018938578,0.050273586,0.047182817,0.114936456,0.0098651005,0.77594846],"study_design_scores_gemma":[0.000044945038,0.00007606145,0.00036153037,0.000043557244,0.00004129363,0.00022571126,0.000055611617,0.6872046,0.022862252,0.28141305,0.007645264,0.000026196965],"about_ca_topic_score_codex":0.0012018203,"about_ca_topic_score_gemma":0.00086454686,"teacher_disagreement_score":0.008664641,"about_ca_system_score_codex":0.00044313268,"about_ca_system_score_gemma":0.00027010523,"threshold_uncertainty_score":0.028986096},"labels":[],"label_agreement":null},{"id":"W2886614420","doi":"10.1007/978-3-319-98938-9_22","title":"Formalisation of SysML/KAOS Goal Assignments with B System Component Decompositions","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Systems Modeling Language; Computer science; Goal modeling; Software engineering; Component (thermodynamics); Domain (mathematical analysis); Unified Modeling Language; Programming language; Systems engineering; Requirements engineering; Software; Engineering","score_opus":0.02268169286686167,"score_gpt":0.2593402220441314,"score_spread":0.2366585291772697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886614420","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.0051970463,0.00006135577,0.98437804,0.00013394472,0.000054705757,0.00010272562,0.00014301157,0.0028653014,0.0070638657],"genre_scores_gemma":[0.17429236,0.00020459869,0.8149847,0.00019313536,0.000056567867,0.00028969903,0.0006695111,0.0017441348,0.007565346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717546,0.000992914,0.0002579957,0.00047538328,0.00076029304,0.0003379989],"domain_scores_gemma":[0.99719185,0.0012935781,0.00024419726,0.000553626,0.0005706717,0.00014603896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850693,0.0011175307,0.0005155892,0.0016559582,0.00088274514,0.0036742648,0.0014453228,0.0010064553,0.008399638],"category_scores_gemma":[0.0056076534,0.0011669147,0.0015810595,0.0010453231,0.0024594748,0.0032524557,0.0031489087,0.0028802154,0.0035519286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028861783,0.00019295278,0.00074045616,0.0005690408,0.000065901164,0.0005581506,0.0017847486,0.045218695,0.02067975,0.7804821,0.008536366,0.1408831],"study_design_scores_gemma":[0.00015730654,0.00011619151,0.00064901455,0.0005259769,0.00011800506,0.0004430128,0.0005913418,0.31830466,0.050742727,0.51813686,0.11011998,0.00009504698],"about_ca_topic_score_codex":0.004572686,"about_ca_topic_score_gemma":0.004298245,"teacher_disagreement_score":0.008399638,"about_ca_system_score_codex":0.0012202582,"about_ca_system_score_gemma":0.0025045816,"threshold_uncertainty_score":0.028099597},"labels":[],"label_agreement":null},{"id":"W2886787252","doi":"10.1007/978-3-319-98678-4_42","title":"An Integrated AMIS Prototype for Automated Summarization and Translation of Newscasts and Reports","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Automatic summarization; Computer science; Translation (biology); Software; Machine translation; Software engineering; Programming language; Information retrieval; Artificial intelligence","score_opus":0.014538732380786934,"score_gpt":0.28103010189461447,"score_spread":0.2664913695138275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886787252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02160336,0.00075847836,0.56389934,0.0004573296,0.00087147806,0.00086327654,0.016407525,0.38194644,0.013192706],"genre_scores_gemma":[0.07788687,0.0004187311,0.8285044,0.00035662166,0.00042606582,0.0010419026,0.057480123,0.013491943,0.020393373],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902105,0.00021572738,0.000121187986,0.00031092012,0.0002745394,0.000056606885],"domain_scores_gemma":[0.99785125,0.00084804517,0.00013957228,0.00039704988,0.00063221855,0.00013194968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014226672,0.0015378015,0.0010345806,0.0022412145,0.00077859074,0.002375861,0.001849466,0.0010806951,0.03206567],"category_scores_gemma":[0.0048405034,0.00080160337,0.0009913618,0.001675809,0.0003567643,0.0024973287,0.0017715439,0.0012183952,0.02183151],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016796937,0.0004036304,0.0012579171,0.0018704825,0.00041389815,0.0008119025,0.001785604,0.003379187,0.12457851,0.0041381367,0.19177496,0.6679061],"study_design_scores_gemma":[0.0010728327,0.0014520488,0.0065549854,0.0003582175,0.00074629637,0.001746453,0.0020919116,0.19558173,0.2308501,0.012521297,0.546678,0.0003461159],"about_ca_topic_score_codex":0.0019171385,"about_ca_topic_score_gemma":0.0027158363,"teacher_disagreement_score":0.03206567,"about_ca_system_score_codex":0.00038840587,"about_ca_system_score_gemma":0.0008040438,"threshold_uncertainty_score":0.1072703},"labels":[],"label_agreement":null},{"id":"W2886990954","doi":"10.1007/978-3-319-99154-2_25","title":"On Saturation Effects in Coupled Speed Scaling","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scaling; Computer science; Markov chain; Bounded function; Saturation (graph theory); Exponent; Polynomial; Speedup; Algorithm; Control theory (sociology); Real-time computing; Simulation; Mathematics; Parallel computing; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.01015538234745892,"score_gpt":0.23286519664425687,"score_spread":0.22270981429679795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886990954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19656472,0.017932413,0.43498585,0.009602979,0.003276307,0.00022254454,0.00028762856,0.001349844,0.3357777],"genre_scores_gemma":[0.9544998,0.004021047,0.010273427,0.0011130618,0.0012294198,0.00012388644,0.00007141383,0.00040715004,0.028260872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994923,0.00015133791,0.000018385112,0.000075203105,0.00015148737,0.00011135528],"domain_scores_gemma":[0.99647576,0.0025246693,0.00014703462,0.00025718528,0.00037289728,0.00022247578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012607229,0.00089555123,0.0011680168,0.0011058631,0.0011438304,0.0017902983,0.0017296169,0.0013509567,0.011592563],"category_scores_gemma":[0.0079282895,0.0006739695,0.0007762445,0.00096801645,0.002694738,0.003925224,0.0027907768,0.0026850048,0.00084990624],"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.00008219097,0.000073105104,0.0003053774,0.00021099484,0.000027230895,0.00013979024,0.00034223092,0.050049484,0.003667387,0.9297291,0.0053559435,0.010017152],"study_design_scores_gemma":[0.000026687925,0.0000344976,0.00035875168,0.000046921883,0.000021948741,0.00008392504,0.00009889881,0.34908068,0.00083285477,0.644593,0.0047895066,0.000032398693],"about_ca_topic_score_codex":0.0030980308,"about_ca_topic_score_gemma":0.0011246696,"teacher_disagreement_score":0.011592563,"about_ca_system_score_codex":0.0018643794,"about_ca_system_score_gemma":0.0006973602,"threshold_uncertainty_score":0.038780987},"labels":[],"label_agreement":null},{"id":"W2887052598","doi":"10.1007/978-3-319-97785-0_19","title":"Supervised Classification Using Feature Space Partitioning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Computer science; Pattern recognition (psychology); Feature vector; Support vector machine; Artificial intelligence; Class (philosophy); Heuristic; Space partitioning; Feature (linguistics); Algorithm","score_opus":0.042480969466897694,"score_gpt":0.26967200626207166,"score_spread":0.22719103679517397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887052598","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.011660202,0.00046972468,0.98297447,0.00011384294,0.00009879986,0.0001124097,0.00022219203,0.0018299664,0.0025183707],"genre_scores_gemma":[0.18425912,0.00048150306,0.8020798,0.00014109623,0.00016923879,0.00037871717,0.0032070628,0.0004477363,0.008835755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989857,0.00022226326,0.00006726061,0.0003156309,0.00031354788,0.000095492374],"domain_scores_gemma":[0.99898094,0.00034616445,0.00006155604,0.00027276605,0.00030281354,0.000035650002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076920056,0.0010346998,0.0016140998,0.001169966,0.0006339206,0.0013546667,0.0016835844,0.0008764426,0.0033632673],"category_scores_gemma":[0.0016297526,0.00045242257,0.00126721,0.0012571376,0.00043544063,0.0013157881,0.0012771429,0.0010933934,0.0025492192],"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.00013836319,0.00015792547,0.00065795006,0.00013927507,0.00008055827,0.000046804333,0.00008284372,0.026736854,0.017055366,0.0056366753,0.010379838,0.93888754],"study_design_scores_gemma":[0.00002064445,0.00010409793,0.0011695443,0.00003147873,0.000041191463,0.00017433555,0.000086360815,0.9545954,0.012960352,0.022495406,0.00829661,0.000024543053],"about_ca_topic_score_codex":0.0018802912,"about_ca_topic_score_gemma":0.0026948673,"teacher_disagreement_score":0.0033632673,"about_ca_system_score_codex":0.00047456176,"about_ca_system_score_gemma":0.000793807,"threshold_uncertainty_score":0.011251271},"labels":[],"label_agreement":null},{"id":"W2887263930","doi":"10.1007/978-3-030-27272-2_33","title":"TriResNet: A Deep Triple-Stream Residual Network for Histopathology Grading","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Histopathology; Grading (engineering); Computer science; Artificial intelligence; Residual; Convolutional neural network; Benchmark (surveying); Pattern recognition (psychology); Pathology; Algorithm; Medicine; Engineering","score_opus":0.020361686194451372,"score_gpt":0.27259240158698334,"score_spread":0.25223071539253195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887263930","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.07593549,0.0026266307,0.85470897,0.0011722774,0.0008868333,0.0004458181,0.0135806855,0.04177479,0.008868439],"genre_scores_gemma":[0.4576351,0.0014982659,0.4577634,0.0011617064,0.00043260772,0.0005176553,0.03189692,0.0020005465,0.04709368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997049,0.00004365192,0.000015823267,0.00010278448,0.00008211451,0.00005071284],"domain_scores_gemma":[0.9995758,0.000096191885,0.00004035016,0.00008962453,0.0001471279,0.000050809398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081826455,0.0015432708,0.0008601438,0.0013905864,0.00034705037,0.0008241978,0.002489641,0.001463956,0.007126721],"category_scores_gemma":[0.0017861614,0.00053447805,0.0008329433,0.0007053165,0.00026217682,0.0010452688,0.0012713762,0.0013376597,0.004968358],"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.00069776527,0.00040725368,0.0037376778,0.00029126462,0.00027801027,0.00023545008,0.00006317339,0.086434335,0.016030118,0.0037005132,0.07616779,0.8119567],"study_design_scores_gemma":[0.000046558776,0.00020187731,0.0010748882,0.000059886504,0.00009369732,0.00014033826,0.000029332006,0.96457416,0.016629813,0.0066038263,0.010514369,0.00003119435],"about_ca_topic_score_codex":0.008147547,"about_ca_topic_score_gemma":0.017778233,"teacher_disagreement_score":0.008147547,"about_ca_system_score_codex":0.00064111606,"about_ca_system_score_gemma":0.0011072255,"threshold_uncertainty_score":0.023841262},"labels":[],"label_agreement":null},{"id":"W2887329137","doi":"10.1007/978-3-319-98812-2_34","title":"Learning Ranking Functions by Genetic Programming Revisited","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"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":"Singapore Management University; University of Science and Technology of China; Libera Università di Bolzano; Zayed University; University of the Aegean; Universidade Federal de Minas Gerais; Università degli Studi di Brescia; Università della Calabria; Università di Bologna; Turun Yliopisto; Université de Bourgogne; Högskolan i Skövde; Universität Wien; Massey University; Huazhong University of Science and Technology; Victoria University; Dalian University of Technology; Università degli Studi di Milano-Bicocca; Kangwon National University; Silesian University of Technology; Université de Fribourg; Sun Yat-sen University; Universidad de Zaragoza; National University of Singapore; University of Auckland; Griffith University; Université de Nantes; Monash University; Indian Council of Agricultural Research; Technische Universität Kaiserslautern; Macquarie University; Technische Universität Darmstadt; Aalborg Universitet; Università degli Studi di Napoli Federico II; Universidade de Coimbra; Memorial University of Newfoundland; Universität Passau; Georgia Southern University; University of Missouri-Kansas City; Northern Kentucky University; Ostravská Univerzita v Ostravě; Tallinna Tehnikaülikool; Victoria University of Wellington; Nanzan University; Université de Montpellier; University of Cyprus; National Taipei University of Technology; National Sun Yat-sen University; University of South Australia; University of Missouri; Universidad de Málaga; České Vysoké Učení Technické v Praze; Università degli Studi di Milano","keywords":"Genetic programming; Computer science; Ranking (information retrieval); Context (archaeology); Information retrieval; State (computer science); Artificial intelligence; Machine learning; Theoretical computer science; World Wide Web; Programming language","score_opus":0.010931864353635157,"score_gpt":0.2339228040835175,"score_spread":0.22299093972988235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887329137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008211871,0.0015514515,0.9817093,0.0011245898,0.00014390568,0.000027256476,0.00003292688,0.00018694383,0.007011698],"genre_scores_gemma":[0.3451265,0.002972051,0.6252689,0.00091874774,0.00061652635,0.00023064461,0.00023163282,0.0003456497,0.02428931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999213,0.0004025,0.000028848439,0.00013555342,0.00015676647,0.00006330604],"domain_scores_gemma":[0.99805105,0.0014836321,0.000072813054,0.00014515186,0.00020166296,0.000045643224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021555738,0.00083239353,0.0017966938,0.00089082366,0.0004949515,0.0017359961,0.0028234692,0.0022557396,0.0042444137],"category_scores_gemma":[0.0075053936,0.00064869743,0.00088778924,0.0017824416,0.0015126142,0.002917278,0.0012265256,0.0030601698,0.00094863167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047896614,0.0001032361,0.0006739336,0.00019989265,0.00012724503,0.000085039974,0.00013544621,0.5184058,0.0011467605,0.21728651,0.007635623,0.25415254],"study_design_scores_gemma":[0.000009393356,0.000020174593,0.0001162796,0.000028045733,0.000014530716,0.000024527331,0.000015640111,0.8757982,0.00023570986,0.122133285,0.0015932638,0.000011036795],"about_ca_topic_score_codex":0.0032576972,"about_ca_topic_score_gemma":0.003574768,"teacher_disagreement_score":0.0042444137,"about_ca_system_score_codex":0.0011198417,"about_ca_system_score_gemma":0.00083232054,"threshold_uncertainty_score":0.0141990185},"labels":[],"label_agreement":null},{"id":"W2887371649","doi":"10.1007/978-3-642-39206-1_29","title":"On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Travelling salesman problem; Digraph; Mathematics; Linear programming relaxation; Linear programming; Relaxation (psychology); Discrete mathematics; Algorithm","score_opus":0.03251250968723412,"score_gpt":0.30365985449521377,"score_spread":0.27114734480797964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887371649","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.34918988,0.0054982128,0.1706149,0.0052587185,0.0006635422,0.00015424014,0.00059882726,0.0006956977,0.46732605],"genre_scores_gemma":[0.95049256,0.0020489981,0.025240889,0.00051920244,0.0009163065,0.0001336813,0.00038670565,0.0005062594,0.019755384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978289,0.00055672834,0.000092308714,0.0002824213,0.0006791239,0.0005605145],"domain_scores_gemma":[0.99178374,0.005338869,0.00058244565,0.00061600655,0.0007228606,0.00095619017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023272464,0.001035689,0.0018728881,0.0040780297,0.0032480238,0.0051187244,0.0038869681,0.0019492899,0.019587765],"category_scores_gemma":[0.016630895,0.00074520154,0.0011033813,0.0041293576,0.0037986827,0.008110281,0.002995169,0.0058455723,0.0021123576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004031018,0.00003384295,0.0002100486,0.000059296843,0.000006278109,0.00003829916,0.0001396868,0.0032426226,0.0004798198,0.98597497,0.0026586775,0.0071161576],"study_design_scores_gemma":[0.000019266896,0.000014391564,0.00025537185,0.000028431508,0.000013867303,0.00010633622,0.0001039669,0.023722742,0.00028261187,0.97286,0.0025789887,0.000013987654],"about_ca_topic_score_codex":0.0024277614,"about_ca_topic_score_gemma":0.002683182,"teacher_disagreement_score":0.019587765,"about_ca_system_score_codex":0.004832138,"about_ca_system_score_gemma":0.001383684,"threshold_uncertainty_score":0.06552756},"labels":[],"label_agreement":null},{"id":"W2887404030","doi":"10.1007/978-3-319-99368-3_47","title":"A Sequential Three-Way Approach to Constructing a Co-association Matrix in Consensus Clustering","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cluster analysis; Disjoint sets; Computer science; Data mining; Set (abstract data type); Matrix (chemical analysis); Correlation clustering; Distance matrix; Algorithm; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.028727378115258065,"score_gpt":0.2672894838034929,"score_spread":0.23856210568823483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887404030","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.0009023869,0.000033013795,0.9987262,0.00001809307,0.000014171918,0.000023552731,0.000011930118,0.000099077144,0.00017162085],"genre_scores_gemma":[0.026614392,0.00006428902,0.97186553,0.00002499768,0.000022853737,0.00014610786,0.000104865256,0.000074412106,0.0010825665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953164,0.0018330907,0.00037084633,0.00088598527,0.0013836301,0.00021002954],"domain_scores_gemma":[0.9931931,0.0031113133,0.00031971533,0.0010379405,0.0020696472,0.00026836267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046028253,0.0010113207,0.001609164,0.0022995959,0.0020531407,0.0021086682,0.0038788128,0.0018510133,0.0035069128],"category_scores_gemma":[0.010779243,0.0012940814,0.0023906925,0.0034186158,0.0017978128,0.003164825,0.0031813658,0.0022254146,0.0015554397],"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.00035597073,0.00021918467,0.0014856032,0.0005284638,0.000339402,0.00023826,0.0013308703,0.2934124,0.014409598,0.14914583,0.0059670615,0.5325673],"study_design_scores_gemma":[0.0000145878785,0.0000702635,0.00020370819,0.000015850977,0.00003750626,0.0001071081,0.000102186306,0.9416575,0.003561228,0.051283795,0.0028976733,0.00004855101],"about_ca_topic_score_codex":0.006069974,"about_ca_topic_score_gemma":0.008439484,"teacher_disagreement_score":0.006069974,"about_ca_system_score_codex":0.0010128639,"about_ca_system_score_gemma":0.00228965,"threshold_uncertainty_score":0.024342299},"labels":[],"label_agreement":null},{"id":"W2887712777","doi":"10.1007/978-3-319-98989-1_23","title":"Stealthy Probing-Based Verification (SPV): An Active Approach to Defending Software Defined Networks Against Topology Poisoning Attacks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; OpenFlow; Correctness; Denial-of-service attack; Scalability; Computer network; Software-defined networking; Cloud computing; Network packet; Network topology; Software; Protocol (science); Key (lock); Distributed computing; Networking hardware; Computer security; Topology (electrical circuits); The Internet","score_opus":0.025206063131258692,"score_gpt":0.2610425712203821,"score_spread":0.2358365080891234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887712777","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.010094033,0.00040592454,0.98177755,0.00035489068,0.00014154482,0.00010076315,0.000033590873,0.0021730135,0.004918782],"genre_scores_gemma":[0.67318946,0.0008506227,0.31327066,0.0005031575,0.00023286432,0.00019583633,0.00018703664,0.00045428865,0.01111596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973068,0.0008569599,0.000115643146,0.00038462397,0.0011061673,0.00022973813],"domain_scores_gemma":[0.99549234,0.0015922308,0.00034857908,0.0019426201,0.0004925948,0.00013168021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025977672,0.00078750344,0.000763794,0.0009964069,0.00072492694,0.0023180589,0.0026650843,0.001804084,0.0020561705],"category_scores_gemma":[0.0079390835,0.0006188738,0.0007785892,0.00091471133,0.0020548855,0.004237104,0.003883419,0.0030259702,0.0008074385],"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.00062258565,0.00021204844,0.0015764814,0.00039926195,0.00012267227,0.00030573804,0.00048023395,0.06999473,0.047077093,0.32416898,0.010035951,0.5450043],"study_design_scores_gemma":[0.00004679886,0.00032920126,0.00041588512,0.00007355399,0.000070802525,0.0006060784,0.000058427602,0.78409994,0.03268359,0.16190337,0.019667871,0.000044520224],"about_ca_topic_score_codex":0.0004310162,"about_ca_topic_score_gemma":0.00045809124,"teacher_disagreement_score":0.0026650843,"about_ca_system_score_codex":0.00074864377,"about_ca_system_score_gemma":0.0011876062,"threshold_uncertainty_score":0.013738453},"labels":[],"label_agreement":null},{"id":"W2887800884","doi":"10.1007/978-3-319-99073-6_12","title":"Phishing Attacks Modifications and Evolutions","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"IBM (Canada); University of Ottawa","funders":"","keywords":"Phishing; Computer science; Computer security; Set (abstract data type); Software; World Wide Web; The Internet; Programming language","score_opus":0.026142534955539223,"score_gpt":0.25470987282720964,"score_spread":0.2285673378716704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887800884","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77799666,0.0063090064,0.07064976,0.0015959836,0.000474179,0.00020644157,0.001226799,0.002531032,0.13901013],"genre_scores_gemma":[0.9404019,0.001986475,0.011347532,0.00015953778,0.00019300023,0.000027421223,0.00091742404,0.00029924948,0.044667445],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993394,0.00007561833,0.000038635102,0.00014976642,0.00028964778,0.00010697149],"domain_scores_gemma":[0.99674976,0.0007437953,0.0004936426,0.0010133663,0.00077719043,0.00022225255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041997666,0.00038947648,0.00032243622,0.0016138807,0.0005365678,0.0015801416,0.00047247193,0.0007552635,0.004861462],"category_scores_gemma":[0.0053180717,0.00029154736,0.0003408481,0.0015292058,0.00054387935,0.002433303,0.000917633,0.0009254201,0.0023344173],"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.00040592204,0.00030708808,0.048064463,0.00030266913,0.00009234553,0.0015305405,0.0014682789,0.021274753,0.055921018,0.04767531,0.013139093,0.8098186],"study_design_scores_gemma":[0.000037517442,0.00081188086,0.23248234,0.0003895176,0.0003081635,0.022493653,0.0015214118,0.23234126,0.08989791,0.12234327,0.29715365,0.00021936063],"about_ca_topic_score_codex":0.0008033759,"about_ca_topic_score_gemma":0.0007183039,"teacher_disagreement_score":0.004861462,"about_ca_system_score_codex":0.0005051871,"about_ca_system_score_gemma":0.0002481901,"threshold_uncertainty_score":0.016263247},"labels":[],"label_agreement":null},{"id":"W2888052067","doi":"10.1007/978-3-319-98334-9_29","title":"The Effect of Structural Measures and Merges on SAT Solver Performance","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Merge (version control); Computer science; Solver; Boolean satisfiability problem; Satisfiability; Theoretical computer science; Benchmark (surveying); Scaling; Algorithm; Mathematics; Parallel computing; Programming language","score_opus":0.008673127966575591,"score_gpt":0.22453538193192688,"score_spread":0.21586225396535128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888052067","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.9549278,0.0043240143,0.024254203,0.001319689,0.00029165685,0.000059164126,0.001021669,0.005800232,0.008001506],"genre_scores_gemma":[0.96460694,0.00058559084,0.031303972,0.00013060479,0.00010276316,0.000043913908,0.0011462207,0.0007596432,0.0013203176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99132735,0.0034369226,0.00086425565,0.0015277832,0.0018903327,0.0009534259],"domain_scores_gemma":[0.84626645,0.13425022,0.004715656,0.008434515,0.0044132587,0.0019199284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008217504,0.0012900069,0.0011161541,0.001528716,0.0010839216,0.0028252942,0.0023377968,0.0018286757,0.007048114],"category_scores_gemma":[0.079666615,0.0009878126,0.0007334596,0.0034233823,0.001076636,0.008217062,0.0021657217,0.0019369159,0.0014589833],"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.021896537,0.0023283141,0.029057663,0.0018558921,0.0008866163,0.00020417977,0.00080027105,0.28382275,0.05743322,0.011851492,0.012288558,0.5775745],"study_design_scores_gemma":[0.0011325823,0.008984727,0.019360494,0.00023259978,0.0012381653,0.0005332242,0.0017034371,0.81043786,0.13152026,0.018808676,0.005879069,0.00016892163],"about_ca_topic_score_codex":0.0014400306,"about_ca_topic_score_gemma":0.0026085095,"teacher_disagreement_score":0.008217504,"about_ca_system_score_codex":0.0010423026,"about_ca_system_score_gemma":0.0023235925,"threshold_uncertainty_score":0.04345882},"labels":[],"label_agreement":null},{"id":"W2888056695","doi":"10.1007/978-3-030-27272-2_2","title":"NetScore: Towards Universal Metrics for Large-Scale Performance Analysis of Deep Neural Networks for Practical On-Device Edge Usage","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Metric (unit); Deep learning; Convolutional neural network; Artificial intelligence; Artificial neural network; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Performance metric; Deep neural networks; Machine learning; Scale (ratio); Focus (optics); Data mining; Computer engineering; Engineering","score_opus":0.03065402445168162,"score_gpt":0.31476574556887554,"score_spread":0.2841117211171939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888056695","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.053475417,0.0015228717,0.9237307,0.00054661545,0.00023927024,0.0001524545,0.0027875935,0.012671182,0.004873856],"genre_scores_gemma":[0.644315,0.0009036176,0.33796534,0.00044467987,0.00021827719,0.00064258964,0.0073963557,0.0037448641,0.0043692696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959715,0.0011500346,0.0003175125,0.0006112633,0.0015276322,0.00042197364],"domain_scores_gemma":[0.9907645,0.0035349505,0.0007997438,0.0021944153,0.0022973532,0.00040905975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045395135,0.0028933713,0.0015041169,0.0020697461,0.0006471543,0.0024653757,0.0030395193,0.0015744256,0.0038601316],"category_scores_gemma":[0.02548256,0.00062690594,0.00079934514,0.0018608113,0.0010776243,0.0056361333,0.0032915557,0.0027663878,0.0014254337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077532115,0.0005313622,0.011596437,0.0011402539,0.00037424493,0.00019109237,0.0002526664,0.4193674,0.023890484,0.09406474,0.0511804,0.3966356],"study_design_scores_gemma":[0.00001449153,0.00012547673,0.0013991708,0.00005500367,0.00002863607,0.00006307892,0.00004557252,0.9420675,0.0088961655,0.04293942,0.0043361364,0.00002934878],"about_ca_topic_score_codex":0.0035119304,"about_ca_topic_score_gemma":0.0055145775,"teacher_disagreement_score":0.0045395135,"about_ca_system_score_codex":0.0019996169,"about_ca_system_score_gemma":0.0023847043,"threshold_uncertainty_score":0.024007559},"labels":[],"label_agreement":null},{"id":"W2888138590","doi":"10.1007/978-3-319-99241-9_12","title":"Automated Co-evolution of Metamodels and Transformation Rules: A Search-Based Approach","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Austrian Science Fund","keywords":"Computer science; Transformation (genetics); Model transformation; Artificial intelligence; Data mining","score_opus":0.01981554958590315,"score_gpt":0.25149983829988176,"score_spread":0.23168428871397861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888138590","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.028518954,0.0007287944,0.9635463,0.00033702565,0.000033981687,0.0003486541,0.00021582952,0.004469442,0.0018010624],"genre_scores_gemma":[0.16466658,0.000284669,0.8317591,0.00019600274,0.000022658063,0.00023719115,0.0009961769,0.0004423486,0.0013953453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958735,0.0011962447,0.00032885093,0.0010329715,0.0013197437,0.00024868583],"domain_scores_gemma":[0.9932202,0.0040659946,0.0006857853,0.0008893768,0.00091215904,0.00022641798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032023492,0.002210468,0.0020610942,0.0053496812,0.000977085,0.001876657,0.0033480343,0.002661171,0.002529951],"category_scores_gemma":[0.010600563,0.0011261437,0.0024704963,0.0034483597,0.0010886141,0.0020436924,0.0024988437,0.0015779831,0.00090372533],"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.00027422557,0.0006911594,0.006532994,0.00053756294,0.00042218593,0.00043298083,0.0006599528,0.37033075,0.019428454,0.006773376,0.0037083584,0.59020805],"study_design_scores_gemma":[0.000041127536,0.00006560896,0.00055462983,0.00003225134,0.00007333503,0.000106145264,0.000093329734,0.9912339,0.0027282296,0.003240763,0.0018143319,0.000016440654],"about_ca_topic_score_codex":0.0131272245,"about_ca_topic_score_gemma":0.0189661,"teacher_disagreement_score":0.0131272245,"about_ca_system_score_codex":0.0014997392,"about_ca_system_score_gemma":0.0028418177,"threshold_uncertainty_score":0.026101649},"labels":[],"label_agreement":null},{"id":"W2888229921","doi":"10.1007/978-3-319-99639-4_22","title":"Factoring Multivariate Polynomials with Many Factors and Huge Coefficients","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Univariate; Multivariate statistics; Interpolation (computer graphics); Polynomial; Factorization; Polynomial interpolation; Integer (computer science); Applied mathematics; Diophantine equation; Computer science; Mathematics; Algorithm; Discrete mathematics; Image (mathematics); Linear interpolation; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.01929239478352813,"score_gpt":0.24697675751030665,"score_spread":0.22768436272677853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888229921","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.04626324,0.0030704981,0.9324029,0.00046138183,0.00041960922,0.000037969865,0.00011399539,0.0009805929,0.016249843],"genre_scores_gemma":[0.5217191,0.007883948,0.43333048,0.0003742185,0.0010740797,0.000069441405,0.0004621881,0.0008238789,0.03426266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961936,0.00005734005,0.000015505062,0.00008281161,0.00016430761,0.000060642342],"domain_scores_gemma":[0.99951017,0.00015664868,0.000044250235,0.00015768844,0.00008765073,0.000043624314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046286534,0.0010556771,0.00050233694,0.00065143337,0.00034110347,0.0007551368,0.00031184274,0.00026448283,0.0047798725],"category_scores_gemma":[0.001967207,0.00032193214,0.00065861834,0.0009337924,0.0012328095,0.0020754298,0.0014411604,0.0014088858,0.002016791],"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.00033240617,0.00005658009,0.00061150605,0.00038617678,0.000072129944,0.0004139117,0.00039892714,0.020158246,0.063967586,0.33590052,0.015930813,0.5617712],"study_design_scores_gemma":[0.00007465179,0.00043036437,0.0011568813,0.0001521732,0.00009811164,0.0021575878,0.0002046582,0.116860464,0.06536278,0.6863716,0.12700455,0.00012620428],"about_ca_topic_score_codex":0.00033293993,"about_ca_topic_score_gemma":0.00046087443,"teacher_disagreement_score":0.0047798725,"about_ca_system_score_codex":0.00034125664,"about_ca_system_score_gemma":0.00031674327,"threshold_uncertainty_score":0.015990257},"labels":[],"label_agreement":null},{"id":"W2888392564","doi":"10.1007/978-3-319-99740-7_24","title":"Measures of Model Interpretability for Model Selection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interpretability; Computer science; Selection (genetic algorithm); Simplicity; Machine learning; Artificial intelligence; Measure (data warehouse); Model selection; Data mining","score_opus":0.06628423837819125,"score_gpt":0.29725731790965637,"score_spread":0.23097307953146512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888392564","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.04619448,0.002008759,0.94004786,0.0012869635,0.00017651227,0.00027753526,0.0012943932,0.0011670076,0.007546472],"genre_scores_gemma":[0.6519137,0.0008335255,0.3393803,0.0002716379,0.00043817546,0.00075608626,0.003945193,0.00063942734,0.0018219193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9776309,0.012898728,0.0017312912,0.0019289174,0.0053621163,0.00044805877],"domain_scores_gemma":[0.8209957,0.14564563,0.0058266153,0.019477662,0.0066939746,0.0013604803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02729895,0.0022582759,0.002095151,0.008755952,0.001202221,0.0055944994,0.0023371787,0.0021452613,0.006319456],"category_scores_gemma":[0.1595768,0.0008035107,0.0035827039,0.004602585,0.002718056,0.008342009,0.003805461,0.0044222963,0.0007017332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001608593,0.0005546841,0.03208087,0.0016109993,0.0030009425,0.00042238284,0.00089417933,0.26272932,0.0059839934,0.30376074,0.011919769,0.37543356],"study_design_scores_gemma":[0.00008013832,0.0003294046,0.005101235,0.00020791987,0.00030465572,0.00015085955,0.00015162848,0.6744233,0.0028742775,0.31417552,0.0021167435,0.00008430314],"about_ca_topic_score_codex":0.0009934339,"about_ca_topic_score_gemma":0.0010769157,"teacher_disagreement_score":0.02729895,"about_ca_system_score_codex":0.0024081455,"about_ca_system_score_gemma":0.0015826426,"threshold_uncertainty_score":0.14437234},"labels":[],"label_agreement":null},{"id":"W2888401638","doi":"10.1007/978-3-319-99229-7_37","title":"Towards a Framework to Manage Perceptual Uncertainty for Safe Automated Driving","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Perception; Function (biology); Measure (data warehouse); Key (lock); Artificial intelligence; Work (physics); Position (finance); Machine learning; Human–computer interaction; Data mining; Computer security; Engineering; Psychology","score_opus":0.016406251456040553,"score_gpt":0.28984445296704636,"score_spread":0.2734382015110058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888401638","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.0011194497,0.00011614908,0.99724257,0.000072174545,0.000026840875,0.00001867574,0.000022411681,0.00020078814,0.0011809157],"genre_scores_gemma":[0.2773947,0.0006730534,0.7130984,0.00021259398,0.00019076766,0.00020677224,0.00026531174,0.00039113467,0.0075672306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914074,0.00015817574,0.000042532087,0.00019632868,0.0003363771,0.00012584115],"domain_scores_gemma":[0.9992041,0.000266747,0.00008019156,0.00015765458,0.00021868017,0.000072619216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233641,0.0010299654,0.0010358766,0.00071413384,0.00072272134,0.0023120323,0.003136274,0.0021050882,0.0039027839],"category_scores_gemma":[0.0029252116,0.0006312245,0.0012188439,0.00059524365,0.0012963761,0.0029642293,0.0042836415,0.0030936513,0.0011164056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007395737,0.00010472718,0.0002953484,0.00012819847,0.00006976946,0.00015208707,0.00017495401,0.62901044,0.009794667,0.24686767,0.0047100773,0.108618125],"study_design_scores_gemma":[0.0000034309476,0.00002131723,0.000038735598,0.0000116314895,0.000007678574,0.000026762773,0.000016005872,0.93203765,0.0011073973,0.06448878,0.0022302165,0.000010495196],"about_ca_topic_score_codex":0.0036414303,"about_ca_topic_score_gemma":0.003488647,"teacher_disagreement_score":0.0039027839,"about_ca_system_score_codex":0.0009239959,"about_ca_system_score_gemma":0.0014502082,"threshold_uncertainty_score":0.013056159},"labels":[],"label_agreement":null},{"id":"W2888580379","doi":"10.1007/978-3-319-99740-7_21","title":"Explainable AI: The New 42?","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":252,"is_retracted":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":"Computer science; Artificial intelligence; Probabilistic logic; Exploit; Function (biology); Task (project management); Artificial neural network; Machine learning; Cognitive science; Engineering","score_opus":0.02554129803942862,"score_gpt":0.267225479299438,"score_spread":0.2416841812600094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888580379","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026039537,0.29318047,0.079924464,0.18283358,0.012392718,0.000046974714,0.00039345663,0.000704984,0.42791942],"genre_scores_gemma":[0.21604039,0.27241728,0.07153986,0.048427023,0.029576741,0.00033387248,0.0011212712,0.0015547116,0.3589889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988906,0.0004855348,0.000044377684,0.00016692058,0.00031400786,0.00009858454],"domain_scores_gemma":[0.99690706,0.0019738276,0.00012851667,0.00047222967,0.00030846838,0.00020990026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245657,0.0010455402,0.0008055292,0.0015341012,0.0010764376,0.0069943573,0.0017286415,0.003774072,0.025627129],"category_scores_gemma":[0.004554237,0.00056030607,0.0007237528,0.0014992238,0.009457212,0.016398218,0.0028078316,0.0066589066,0.005765733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011387768,0.000016337914,0.000075891774,0.00020705171,0.000008415781,0.000032810865,0.0004091293,0.00024679807,0.000114567156,0.9026153,0.053085368,0.043176975],"study_design_scores_gemma":[0.0000072511116,0.000010338077,0.00008390315,0.00030776064,0.000005387397,0.00008851582,0.00022497714,0.0007341552,0.00009266953,0.55176425,0.44667014,0.000010653027],"about_ca_topic_score_codex":0.002038977,"about_ca_topic_score_gemma":0.002460556,"teacher_disagreement_score":0.025627129,"about_ca_system_score_codex":0.0026391966,"about_ca_system_score_gemma":0.0025763726,"threshold_uncertainty_score":0.08573133},"labels":[],"label_agreement":null},{"id":"W2888590242","doi":"10.1007/978-3-030-00928-1_95","title":"GlymphVIS: Visualizing Glymphatic Transport Pathways Using Regularized Optimal Transport","year":2018,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cerebrospinal fluid and hydrocephalus","field":"Neuroscience","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute of Neurological Disorders and Stroke; National Cancer Institute; National Institute on Aging","keywords":"Glymphatic system; Computer science; Visualization; Contrast (vision); Magnetic resonance imaging; Pipeline (software); Cerebrospinal fluid; Artificial intelligence; Computer vision; Pathology; Medicine","score_opus":0.03460316729703395,"score_gpt":0.2868178271579569,"score_spread":0.25221465986092295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888590242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058296658,0.0005295818,0.895898,0.0012764017,0.000268891,0.00021720059,0.005068571,0.031444248,0.007000537],"genre_scores_gemma":[0.2802838,0.00077621435,0.69838524,0.00026197848,0.00010516868,0.00040881394,0.003653035,0.010304871,0.0058208723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986196,0.000031857235,0.000008849448,0.00002240601,0.000046757134,0.00002824239],"domain_scores_gemma":[0.9994647,0.00029971453,0.000045001045,0.000050951447,0.00007052515,0.000069054826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054243,0.0015520849,0.0008603016,0.0013536802,0.00067066937,0.0022758155,0.001482719,0.0019649728,0.019230315],"category_scores_gemma":[0.0015945672,0.0007010905,0.0009512175,0.0009870332,0.00048846414,0.0011842416,0.0014476025,0.0018784307,0.001360448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085030147,0.00029774726,0.0019722844,0.0013691066,0.0002677388,0.0009039404,0.00087975117,0.70768213,0.04023507,0.056600053,0.056833137,0.13210875],"study_design_scores_gemma":[0.00006955238,0.00002543151,0.00017712935,0.000050279195,0.000013643152,0.000088861256,0.00004795232,0.97626287,0.0050735413,0.011954266,0.0062057544,0.000030763153],"about_ca_topic_score_codex":0.007590225,"about_ca_topic_score_gemma":0.0074211126,"teacher_disagreement_score":0.019230315,"about_ca_system_score_codex":0.0007914908,"about_ca_system_score_gemma":0.0019843811,"threshold_uncertainty_score":0.06433177},"labels":[],"label_agreement":null},{"id":"W2888663540","doi":"10.1007/978-3-319-99253-2_2","title":"Design of a Surrogate Model Assisted (1 + 1)-ES","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Surrogate model; Context (archaeology); Adaptation (eye); Machine learning; Function (biology); Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.03626305347064781,"score_gpt":0.27298382236821955,"score_spread":0.23672076889757174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888663540","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.009851324,0.00011722513,0.98064166,0.00011529507,0.000071451315,0.000062734005,0.000057876885,0.00035668872,0.008725738],"genre_scores_gemma":[0.5817172,0.00022735799,0.40303248,0.0002049674,0.00006628912,0.00040902902,0.00028473898,0.00014884843,0.013909105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994728,0.00016840812,0.000022135846,0.00010488116,0.00017351832,0.00005834566],"domain_scores_gemma":[0.9996269,0.00012586157,0.000042864693,0.000052446994,0.00011793396,0.00003391937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157413,0.0007495225,0.0010496541,0.0004189147,0.00036962223,0.001166858,0.001000128,0.0018561771,0.00597365],"category_scores_gemma":[0.001334455,0.0003648771,0.0007673461,0.00045183834,0.0004316523,0.00067945296,0.0013432468,0.00081518537,0.001567664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022566618,0.00011134165,0.00040352033,0.00018535674,0.000048028593,0.00016188841,0.000052093692,0.8645586,0.023850601,0.021693105,0.0022005246,0.08650927],"study_design_scores_gemma":[0.000010911553,0.00012213143,0.00006334753,0.000008884076,0.000007025162,0.000045576326,0.0000069208263,0.99400455,0.0021888628,0.0018838538,0.0016517552,0.0000061104156],"about_ca_topic_score_codex":0.000343336,"about_ca_topic_score_gemma":0.00032989786,"teacher_disagreement_score":0.00597365,"about_ca_system_score_codex":0.00030578126,"about_ca_system_score_gemma":0.000654458,"threshold_uncertainty_score":0.019983828},"labels":[],"label_agreement":null},{"id":"W2888673436","doi":"10.1007/978-3-319-99813-8_16","title":"Analysis of Rates of Agents’ Decisions in Learning to Cross a Highway in Populations with Risk Takers and Risk Avoiders","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Research in Systems and Signal Processing","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 Guelph","funders":"","keywords":"Computer science; Social learning; Observational learning; Cognition; Observational study; Artificial intelligence; Machine learning; Knowledge management; Psychology; Statistics","score_opus":0.03362374783331294,"score_gpt":0.31550125160805936,"score_spread":0.2818775037747464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888673436","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.97363585,0.00044132842,0.020314856,0.0009197017,0.000030096313,0.000043787702,0.0006036163,0.000065911285,0.003945024],"genre_scores_gemma":[0.991286,0.00016768317,0.0026357546,0.00006367188,0.000022011025,0.000041049054,0.0003311115,0.000019946521,0.005432816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991547,0.00042149398,0.0000413422,0.00016936098,0.000066674926,0.00014642888],"domain_scores_gemma":[0.9289214,0.063566804,0.0033916286,0.0014936634,0.0012774714,0.0013490671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00546289,0.00034378556,0.00073720125,0.00067103194,0.0003621044,0.0013240529,0.0016398568,0.0014501171,0.009502547],"category_scores_gemma":[0.034955043,0.0003920352,0.0009267247,0.0005781612,0.0010898375,0.0020196338,0.00081458985,0.0019603588,0.0006233628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021437372,0.0004934236,0.17860329,0.0003296041,0.0005807938,0.00058643974,0.0023062045,0.60554296,0.0029579173,0.14275925,0.00858458,0.055111784],"study_design_scores_gemma":[0.000046467052,0.00028254994,0.036173604,0.000041680054,0.000119554206,0.00027930448,0.0012779519,0.91408235,0.00055238773,0.046299748,0.0007835328,0.000060847287],"about_ca_topic_score_codex":0.0067057465,"about_ca_topic_score_gemma":0.0039043152,"teacher_disagreement_score":0.009502547,"about_ca_system_score_codex":0.0010695435,"about_ca_system_score_gemma":0.0005034505,"threshold_uncertainty_score":0.031789243},"labels":[],"label_agreement":null},{"id":"W2888696717","doi":"10.1007/978-3-319-99639-4_3","title":"Sparse Polynomial Arithmetic with the BPAS Library","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Remainder; Division (mathematics); Computer science; Computation; Representation (politics); Polynomial; Arithmetic; Algorithm; Division algorithm; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.011500431848715995,"score_gpt":0.208298807014318,"score_spread":0.196798375165602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888696717","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.004961681,0.008580656,0.49810043,0.0022555916,0.001700359,0.00012690117,0.0028605682,0.011048869,0.47036502],"genre_scores_gemma":[0.10383602,0.019233081,0.44302166,0.0019339254,0.0036188208,0.0003943394,0.009530891,0.0074374923,0.41099384],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993327,0.00008595991,0.000036938403,0.00010414491,0.0003880121,0.00005223059],"domain_scores_gemma":[0.9996182,0.00010693645,0.000023655946,0.00012187954,0.000092938666,0.000036360438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043535265,0.0011318701,0.001037596,0.0022216442,0.0011291923,0.0026723668,0.001508672,0.0006057347,0.064523876],"category_scores_gemma":[0.0015804063,0.0008726789,0.0011996576,0.0044759144,0.0010909858,0.0044022,0.0022715514,0.0039742,0.05150778],"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.0000923087,0.000057864883,0.000100552126,0.00053692615,0.000027854998,0.000057550966,0.000119221426,0.002515139,0.0033472625,0.38661823,0.15994854,0.44657847],"study_design_scores_gemma":[0.0000245202,0.000027045631,0.00016385627,0.00013959369,0.000021770691,0.0003089107,0.000028960769,0.0044841287,0.004769776,0.43349472,0.5565028,0.0000338341],"about_ca_topic_score_codex":0.000662228,"about_ca_topic_score_gemma":0.0012679211,"teacher_disagreement_score":0.064523876,"about_ca_system_score_codex":0.0009994388,"about_ca_system_score_gemma":0.0011895717,"threshold_uncertainty_score":0.21585387},"labels":[],"label_agreement":null},{"id":"W2888706251","doi":"10.1007/978-3-319-99241-9_8","title":"Injecting Social Diversity in Multi-objective Genetic Programming: The Case of Model Well-Formedness Rule Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Viral Infectious Diseases and Gene Expression in Insects","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence; Artifact (error); Automation; Set (abstract data type); Context (archaeology); Convergence (economics); Machine learning; Programming language","score_opus":0.02571700106075934,"score_gpt":0.2841486140949944,"score_spread":0.25843161303423506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888706251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17314069,0.0005940478,0.81932604,0.0009302467,0.000056669753,0.0001171139,0.000046097237,0.00014969514,0.005639432],"genre_scores_gemma":[0.8115093,0.00023130712,0.18636547,0.00022307533,0.00006147444,0.00019500148,0.000062324376,0.00006158876,0.0012906444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971608,0.0016986709,0.000088674584,0.00036461753,0.0004961974,0.00019114149],"domain_scores_gemma":[0.98739225,0.009856412,0.00088764617,0.0007606954,0.0007699977,0.00033301575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007607014,0.0010614839,0.001269526,0.00119112,0.0008989987,0.0017027258,0.0016714967,0.0024552855,0.000958527],"category_scores_gemma":[0.020201268,0.00049721275,0.0010993546,0.00072008313,0.002479014,0.0017751686,0.002438748,0.002190194,0.0001383055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000475455,0.0001014538,0.0024143087,0.00006932392,0.00010178117,0.00020098797,0.00031594586,0.9465397,0.0009002164,0.024629766,0.00025188248,0.024427144],"study_design_scores_gemma":[0.000011269318,0.00005657662,0.00019668786,0.00001423444,0.0000145653175,0.000031447827,0.000038242353,0.9803807,0.00038593606,0.018550588,0.00031264385,0.000007018076],"about_ca_topic_score_codex":0.002003215,"about_ca_topic_score_gemma":0.0018079162,"teacher_disagreement_score":0.007607014,"about_ca_system_score_codex":0.0010914952,"about_ca_system_score_gemma":0.0009151677,"threshold_uncertainty_score":0.040230215},"labels":[],"label_agreement":null},{"id":"W2888797767","doi":"10.1007/978-3-030-12738-1_12","title":"Automated Pain Detection in Facial Videos of Children Using Human-Assisted Transfer Learning","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Pediatric Pain Management Techniques","field":"Medicine","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 British Columbia","funders":"National Institute of Nursing Research","keywords":"Computer science; Artificial intelligence; Facial Action Coding System; Transfer of learning; Coding (social sciences); Machine learning; Support vector machine; Facial expression; Facial recognition system; Pattern recognition (psychology)","score_opus":0.013132092331318186,"score_gpt":0.27991909064682097,"score_spread":0.2667869983155028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888797767","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.81474066,0.0010624412,0.17408255,0.0002079975,0.00016297676,0.00035679888,0.0016368318,0.0015825963,0.006167128],"genre_scores_gemma":[0.91827035,0.0005087807,0.07725586,0.00008469317,0.00006289278,0.00015078965,0.0009966454,0.000046235393,0.0026237809],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998054,0.00004256314,0.000006531727,0.000045005094,0.00005475273,0.000045772234],"domain_scores_gemma":[0.99970514,0.00012607877,0.000029198138,0.000021865768,0.000083606334,0.000034015906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029053484,0.00037100786,0.00025931397,0.00053628586,0.00011100635,0.0002069376,0.0002895697,0.0003845959,0.0022748066],"category_scores_gemma":[0.0011464844,0.000073586,0.0002547061,0.00025206822,0.00013491453,0.00024645551,0.00043732589,0.00031596815,0.0006418383],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006719876,0.0002603891,0.020644365,0.00026051202,0.0000710173,0.0006698751,0.00021036936,0.0066382694,0.1429623,0.00032809205,0.004427017,0.8228558],"study_design_scores_gemma":[0.00008251643,0.0014152686,0.23006387,0.00016878957,0.00013951799,0.0043982165,0.000868385,0.6318025,0.12191283,0.0015882744,0.00748175,0.000078104276],"about_ca_topic_score_codex":0.0027663342,"about_ca_topic_score_gemma":0.0042117545,"teacher_disagreement_score":0.0027663342,"about_ca_system_score_codex":0.00017371384,"about_ca_system_score_gemma":0.0003323735,"threshold_uncertainty_score":0.007610023},"labels":[],"label_agreement":null},{"id":"W2888830715","doi":"10.1007/978-3-030-00247-3_22","title":"Low Frequency Mobile Communications in Underwater Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Underwater acoustic communication; Doppler effect; Underwater; Computer science; Doppler frequency; Redundancy (engineering); Bandwidth (computing); Channel (broadcasting); Waveform; Electronic engineering; Acoustics; Telecommunications; Geography; Physics; Engineering","score_opus":0.020134522434467127,"score_gpt":0.239587781240216,"score_spread":0.2194532588057489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888830715","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018324029,0.15351923,0.37055895,0.0033266956,0.0053210403,0.00007922884,0.00019348811,0.0009074484,0.44776988],"genre_scores_gemma":[0.15910752,0.12101109,0.062249213,0.00078950165,0.003989786,0.00010947208,0.00034294958,0.0003053451,0.6520951],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999176,0.000014701807,0.000002762944,0.0000101247,0.00004491778,0.00000982849],"domain_scores_gemma":[0.9999045,0.00004845099,0.000006806362,0.000010993447,0.000023415341,0.000005870557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009018858,0.0004261004,0.00030211415,0.00057137094,0.00027181907,0.0008604549,0.0004913983,0.00059015583,0.010719825],"category_scores_gemma":[0.00030600844,0.00018708842,0.00013445296,0.0010938769,0.00035748913,0.00089897605,0.0005150982,0.0007947849,0.0037097002],"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.000046302397,0.00003974465,0.00027011026,0.0009138924,0.000025636004,0.00023909961,0.00021617417,0.015156458,0.02078115,0.1277515,0.061358094,0.7732019],"study_design_scores_gemma":[0.000008838716,0.00009954809,0.0006407592,0.00041200256,0.000035243942,0.00071056513,0.00018164507,0.033419587,0.0075754225,0.06394169,0.89294964,0.00002510933],"about_ca_topic_score_codex":0.0005986351,"about_ca_topic_score_gemma":0.00086400623,"teacher_disagreement_score":0.010719825,"about_ca_system_score_codex":0.00047317904,"about_ca_system_score_gemma":0.00020272256,"threshold_uncertainty_score":0.035861433},"labels":[],"label_agreement":null},{"id":"W2888838255","doi":"10.1007/978-3-030-00247-3_13","title":"The Trade-Offs of Cell Over-Provisioning in IEEE 802.15.4 TSCH Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Networks and Protocols","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":"Federation for the Humanities and Social Sciences","keywords":"Retransmission; Computer science; Computer network; Goodput; Network packet; Quality of service; Reliability (semiconductor); Jitter; Throughput; Wireless; End-to-end delay; IEEE 802.15; Wireless sensor network; Telecommunications; Power (physics)","score_opus":0.013949451698195676,"score_gpt":0.24749290272541907,"score_spread":0.2335434510272234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888838255","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.5717707,0.024362672,0.26837248,0.005717859,0.0011798806,0.00015044508,0.00068670046,0.000967132,0.12679213],"genre_scores_gemma":[0.9898359,0.001601002,0.005759417,0.00013092974,0.00015700275,0.000021262727,0.000037116788,0.00006569631,0.002391634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806446,0.0007396129,0.00006347847,0.00021066848,0.0004951411,0.00042657543],"domain_scores_gemma":[0.9870208,0.010309054,0.000671341,0.00067401037,0.000900799,0.0004239024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032959136,0.0008674548,0.0008834065,0.0006771568,0.0013474128,0.0034375438,0.0018205364,0.0012761974,0.005285351],"category_scores_gemma":[0.016280882,0.0006106869,0.00023817288,0.0011097663,0.0016709666,0.004878713,0.0016329995,0.0014606932,0.00049272284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011764099,0.0002201712,0.002335042,0.00032388946,0.00009543138,0.00041319564,0.0005261589,0.60196555,0.015921233,0.18365987,0.010748904,0.18261425],"study_design_scores_gemma":[0.000030893934,0.00037079668,0.001596465,0.00012367275,0.000107209446,0.00073577766,0.00062168273,0.8590419,0.005536532,0.12688126,0.0048678457,0.00008590483],"about_ca_topic_score_codex":0.002129903,"about_ca_topic_score_gemma":0.0049663438,"teacher_disagreement_score":0.005285351,"about_ca_system_score_codex":0.0028250834,"about_ca_system_score_gemma":0.0009000722,"threshold_uncertainty_score":0.0204975},"labels":[],"label_agreement":null},{"id":"W2888953019","doi":"10.1007/978-3-662-58820-8_18","title":"Verifiable Sealed-Bid Auction on the Ethereum Blockchain","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":135,"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; Blockchain; Smart contract; Verifiable secret sharing; Computer security; Homomorphic encryption; Correctness; Protocol (science); Transparency (behavior); Scheme (mathematics); Vickrey–Clarke–Groves auction; Encryption; Auction theory; Common value auction; Programming language; Microeconomics","score_opus":0.013245992943378264,"score_gpt":0.2267933315351358,"score_spread":0.21354733859175754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888953019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05596833,0.00058606424,0.8774268,0.0010926299,0.00026053507,0.00032060975,0.00051482074,0.00082167564,0.063008584],"genre_scores_gemma":[0.8450665,0.00077882013,0.111211464,0.00013825865,0.00015445403,0.00030984968,0.0004110359,0.00014541902,0.041784238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970131,0.0010727816,0.0001397514,0.00028616498,0.0010981278,0.0003900423],"domain_scores_gemma":[0.9963787,0.0017911063,0.00015953058,0.0011635971,0.00035601403,0.00015113967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032684603,0.0007331878,0.0016035265,0.0006621823,0.0010055068,0.0040781535,0.0026956967,0.0023958886,0.012805338],"category_scores_gemma":[0.006923439,0.00060915516,0.0007382368,0.0012721131,0.0020422991,0.006053587,0.003015246,0.0026297986,0.0025670207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048236817,0.00009137355,0.00012843948,0.00009458258,0.000030833853,0.0002041745,0.00008759179,0.07235309,0.0025829233,0.8820037,0.0032860367,0.038654897],"study_design_scores_gemma":[0.00019230733,0.000077440716,0.00008808712,0.000032309043,0.0000149820735,0.00008375813,0.000015806683,0.29277068,0.002091339,0.699915,0.0046901125,0.000028152186],"about_ca_topic_score_codex":0.0012207115,"about_ca_topic_score_gemma":0.0010603388,"teacher_disagreement_score":0.012805338,"about_ca_system_score_codex":0.0018667306,"about_ca_system_score_gemma":0.0023110514,"threshold_uncertainty_score":0.042838156},"labels":[],"label_agreement":null},{"id":"W2889026124","doi":"10.1007/978-3-030-12738-1_13","title":"Towards Automated Pain Detection in Children Using Facial and Electrodermal Activity","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Pediatric Pain Management Techniques","field":"Medicine","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 British Columbia","funders":"National Institute of Nursing Research","keywords":"Computer science; Artificial intelligence; Adaptation (eye); Domain (mathematical analysis); Domain adaptation; Facial expression; Computer vision; Psychology; Neuroscience","score_opus":0.00799409837958025,"score_gpt":0.2654933006627803,"score_spread":0.25749920228320006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889026124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14602266,0.002484888,0.84078693,0.00041101978,0.00016524848,0.00016888353,0.001589177,0.003003203,0.0053679803],"genre_scores_gemma":[0.5089877,0.0020019934,0.47940007,0.0002676242,0.0001771285,0.00017081166,0.0019287991,0.00017419057,0.006891688],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995403,0.00010337335,0.000025780002,0.0001230335,0.00014769091,0.00005995065],"domain_scores_gemma":[0.99949694,0.00017857506,0.000055076405,0.000040828803,0.00019762086,0.000030916406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004719689,0.00075528905,0.0005865009,0.001036773,0.00014984612,0.00072954607,0.0006040466,0.0007926701,0.0017398933],"category_scores_gemma":[0.001190716,0.00023787284,0.000538032,0.0005704424,0.00016617849,0.00037375587,0.0006694066,0.0005881618,0.0018702033],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036842265,0.00016183426,0.03024025,0.00027653013,0.00012256758,0.00040999145,0.00011624115,0.00369194,0.2334605,0.00080868654,0.003583113,0.7267599],"study_design_scores_gemma":[0.00014926538,0.001184662,0.27425095,0.00029742633,0.0004990068,0.0060188435,0.00064943224,0.44728065,0.24257088,0.004525329,0.022448022,0.0001254938],"about_ca_topic_score_codex":0.0024852774,"about_ca_topic_score_gemma":0.00441486,"teacher_disagreement_score":0.0024852774,"about_ca_system_score_codex":0.00015737487,"about_ca_system_score_gemma":0.000490728,"threshold_uncertainty_score":0.005820513},"labels":[],"label_agreement":null},{"id":"W2889515449","doi":"10.1007/978-3-030-00359-3_11","title":"Exploiting Local Persistency for Reduced State Space Generation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Polytechnique Montréal","funders":"","keywords":"Petri net; Computer science; State space; Parametric statistics; Computation; Set (abstract data type); Algorithm; Stochastic Petri net; State (computer science); Theoretical computer science; Mathematical optimization; Mathematics; Programming language","score_opus":0.04756769273387772,"score_gpt":0.26556144438133433,"score_spread":0.2179937516474566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889515449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028600322,0.00012550301,0.96426135,0.00012635713,0.000056817287,0.00007302445,0.000108580454,0.0032428615,0.003405051],"genre_scores_gemma":[0.72836536,0.00010597328,0.2661901,0.00012166617,0.000039259096,0.0001919684,0.00042474474,0.0006697944,0.0038911381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994716,0.00014211694,0.000045365985,0.000102315564,0.00016548169,0.00007309249],"domain_scores_gemma":[0.9976671,0.0011222973,0.000108951346,0.00085679867,0.00019412898,0.000050818788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008028942,0.0005726647,0.00060581695,0.0006757218,0.00043006652,0.000741272,0.0014104847,0.0006114207,0.006980676],"category_scores_gemma":[0.003923267,0.00036053453,0.00084359554,0.0005864238,0.0007141948,0.0017149224,0.0018031467,0.0014370586,0.0006999156],"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.00046975393,0.0002536681,0.0010422097,0.00044964885,0.00009870967,0.00032537634,0.00039453682,0.3635228,0.041022297,0.1327749,0.0051389528,0.4545071],"study_design_scores_gemma":[0.000031177995,0.000068504414,0.00010760517,0.000016729282,0.00003171204,0.000055954668,0.000023921668,0.9127415,0.011231333,0.07389864,0.0017778254,0.000015140075],"about_ca_topic_score_codex":0.001076112,"about_ca_topic_score_gemma":0.0021703236,"teacher_disagreement_score":0.006980676,"about_ca_system_score_codex":0.00045269434,"about_ca_system_score_gemma":0.00062734203,"threshold_uncertainty_score":0.023352742},"labels":[],"label_agreement":null},{"id":"W2889734460","doi":"10.1007/978-3-662-58039-4_1","title":"A Delta-Diagram Based Synthesis for Cross Layer Optimization Modeling of IoT","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Computer science; Internet of Things; Layer (electronics); Application layer; Routing (electronic design automation); Distributed computing; Protocol (science); Communications protocol; Network layer; Sequence diagram; The Internet; Computer network; Embedded system; Software engineering; Software; Unified Modeling Language","score_opus":0.03477933473570957,"score_gpt":0.27575356097903186,"score_spread":0.2409742262433223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889734460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007214151,0.00018464058,0.98026556,0.000059629067,0.000054026365,0.000038455306,0.00013520967,0.00072004006,0.011328258],"genre_scores_gemma":[0.5134249,0.00046285192,0.4736303,0.000103438666,0.000035659872,0.00025624337,0.0004537178,0.00047023676,0.0111626275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987555,0.000028091648,0.0000063583802,0.000019555664,0.000057161982,0.000013201545],"domain_scores_gemma":[0.99987316,0.00004486501,0.000011258057,0.000019865125,0.000045921774,0.0000049701475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002610793,0.0006328944,0.0004834913,0.00035559572,0.00026803042,0.000678451,0.00072580244,0.0004895894,0.0059481477],"category_scores_gemma":[0.00044054267,0.00032843926,0.0006436258,0.0003060519,0.00018009977,0.00056408916,0.0003984675,0.0005842755,0.0008653174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005753795,0.000045837132,0.00027370927,0.00013242065,0.00003227697,0.00008194435,0.000059017515,0.9078844,0.018292246,0.025492342,0.0014325203,0.046215653],"study_design_scores_gemma":[0.000004949846,0.000018838367,0.0000408718,0.000009941256,0.000007126377,0.000016409726,0.0000058080873,0.99066913,0.0026236211,0.0037748755,0.0028245524,0.00000371223],"about_ca_topic_score_codex":0.0023017633,"about_ca_topic_score_gemma":0.003357301,"teacher_disagreement_score":0.0059481477,"about_ca_system_score_codex":0.00045849048,"about_ca_system_score_gemma":0.00059654855,"threshold_uncertainty_score":0.019898593},"labels":[],"label_agreement":null},{"id":"W2889828861","doi":"10.1007/978-3-319-99843-5_1","title":"Resilience of Electrical Distribution Systems with Critical Load Prioritization","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Prioritization; Resilience (materials science); Reliability engineering; Management science; Engineering","score_opus":0.006207958271018398,"score_gpt":0.22184324124854668,"score_spread":0.2156352829775283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889828861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17361511,0.0028085548,0.77664006,0.0017572154,0.00035063623,0.00009070891,0.00037227946,0.0012962992,0.04306918],"genre_scores_gemma":[0.9849904,0.0006228733,0.008549505,0.00003979128,0.0001037834,0.000030398494,0.00007744885,0.00007391362,0.005511793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997235,0.00007659518,0.000010524212,0.000063692925,0.00006040593,0.00006526812],"domain_scores_gemma":[0.99905354,0.0005576089,0.00012580365,0.000115417606,0.00009117285,0.00005647435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044927024,0.0006719967,0.00049444014,0.00075691094,0.00038325982,0.0009579458,0.00069317356,0.00047410754,0.0042127506],"category_scores_gemma":[0.0028369306,0.00029575065,0.0003646302,0.0005352431,0.00076420384,0.0011093065,0.0010459278,0.000720493,0.00037201497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017316584,0.000023932726,0.0005671225,0.00015772705,0.000048670045,0.00025095505,0.000117108306,0.83290976,0.004726215,0.10624333,0.0037129628,0.05106905],"study_design_scores_gemma":[0.000013700047,0.000059589463,0.0004491559,0.000040639,0.000028454566,0.00015584183,0.00006134205,0.8320575,0.0013943843,0.16217302,0.0035504026,0.000016043272],"about_ca_topic_score_codex":0.0012641401,"about_ca_topic_score_gemma":0.00079089485,"teacher_disagreement_score":0.0042127506,"about_ca_system_score_codex":0.00079278083,"about_ca_system_score_gemma":0.00044992493,"threshold_uncertainty_score":0.014092982},"labels":[],"label_agreement":null},{"id":"W2890007119","doi":"10.1007/978-3-030-01129-1_15","title":"Gender Wage Gap in the University Sector: A Case Study of All Universities in Ontario, Canada","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gender Diversity and Inequality","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Salary; Productivity; Wage; Demographic economics; Labour economics; Ivory tower; Position (finance); Economics; Political science; Economic growth; Law","score_opus":0.10632152483933166,"score_gpt":0.26137664917754827,"score_spread":0.1550551243382166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890007119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856952,0.0008664856,0.00008677996,0.0015485974,0.000013920367,0.00004818186,0.00047422678,0.0000046812556,0.011262022],"genre_scores_gemma":[0.9928824,0.0009626662,0.0001304839,0.00022585386,0.000005031291,0.000017861374,0.00017449805,0.0000066945604,0.0055944594],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99799347,0.00021681204,0.000043420172,0.00011371763,0.00039565316,0.001236898],"domain_scores_gemma":[0.9972383,0.0006152401,0.00036614842,0.00006313792,0.0007870298,0.00093020604],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0011550571,0.0003383126,0.0007205368,0.0020584615,0.017242325,0.0038827134,0.0020486505,0.0014853822,0.003618679],"category_scores_gemma":[0.0027123373,0.0004201677,0.0004602074,0.009251053,0.0038746381,0.0013701206,0.0026345353,0.0013611924,0.00028211903],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025294026,0.0003373722,0.5468773,0.0003535627,0.00006114235,0.0059441933,0.36646786,0.0008574495,0.00066626177,0.014865548,0.014549172,0.04876707],"study_design_scores_gemma":[0.00001241023,0.000055952147,0.44524243,0.00024527503,0.000032079424,0.0004232322,0.54029626,0.0005001535,0.00012788997,0.0006103589,0.012413836,0.00004014799],"about_ca_topic_score_codex":0.996648,"about_ca_topic_score_gemma":0.9990563,"teacher_disagreement_score":0.9988449,"about_ca_system_score_codex":0.076859884,"about_ca_system_score_gemma":0.10191715,"threshold_uncertainty_score":0.5576601},"labels":[],"label_agreement":null},{"id":"W2890039419","doi":"10.1007/978-3-030-00066-0_11","title":"Venue Classification of Research Papers in Scholarly Digital Libraries","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Atomic Energy of Canada Limited; Canadian Institute for Advanced Research","keywords":"Computer science; Digital library; Information retrieval; Library science; World Wide Web; Art","score_opus":0.04333766805299147,"score_gpt":0.318591590279443,"score_spread":0.2752539222264515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890039419","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.2229062,0.16176203,0.0129185915,0.007339798,0.015375143,0.001327014,0.21510814,0.007714305,0.35554877],"genre_scores_gemma":[0.46337822,0.07435702,0.0332638,0.0019841178,0.00860422,0.0008358747,0.19845271,0.0051546567,0.21396942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99407417,0.0011522791,0.00085584726,0.000605063,0.00241373,0.00089885504],"domain_scores_gemma":[0.970182,0.008765807,0.004340513,0.0017139618,0.008158623,0.006839068],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0026649397,0.00088295795,0.0012182177,0.079704106,0.002393363,0.0094343815,0.0016963119,0.0011056414,0.059533194],"category_scores_gemma":[0.029723436,0.0003643029,0.0013638189,0.06526236,0.0006703997,0.0042698784,0.0034737843,0.0009958047,0.033164166],"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.0014551866,0.00026069392,0.108089834,0.011230486,0.0005999458,0.00096107705,0.002719684,0.0010292892,0.00973881,0.015094608,0.30675986,0.5420605],"study_design_scores_gemma":[0.00009120227,0.0002509607,0.16798311,0.0040967707,0.00035678322,0.0022469761,0.0063397125,0.0014504441,0.0035424614,0.009017603,0.80449903,0.00012488123],"about_ca_topic_score_codex":0.002858023,"about_ca_topic_score_gemma":0.0071881814,"teacher_disagreement_score":0.9202959,"about_ca_system_score_codex":0.0016759599,"about_ca_system_score_gemma":0.003242089,"threshold_uncertainty_score":0.19915837},"labels":[],"label_agreement":null},{"id":"W2890092284","doi":"10.1007/978-3-662-54110-4","title":"Web and Internet Economics","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; The Internet; Web application; World Wide Web","score_opus":0.016821983646783945,"score_gpt":0.19776847842813391,"score_spread":0.18094649478134997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890092284","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007771859,0.15079395,0.012623735,0.026897961,0.0027666276,0.000021058553,0.0002000512,0.00013156251,0.79879326],"genre_scores_gemma":[0.19598664,0.14459437,0.004411245,0.005991303,0.011142807,0.00007400141,0.00036382378,0.00022846129,0.6372074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983466,0.000051287247,0.0000046882374,0.000023634502,0.000071271126,0.000014450871],"domain_scores_gemma":[0.9997329,0.00012718086,0.00002305263,0.000036253667,0.000046544326,0.00003407094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029633346,0.0004823483,0.00036201344,0.0019574324,0.00052082073,0.002644969,0.00028424084,0.001210909,0.025584465],"category_scores_gemma":[0.0010311342,0.00018824328,0.0001727263,0.0024095352,0.0012249104,0.0038607551,0.00069171353,0.00166063,0.0063076033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001026218,0.000058476413,0.00045253136,0.00009338838,0.00001061067,0.000046868427,0.00009105137,0.0010348001,0.00014972557,0.7621121,0.13787022,0.098069936],"study_design_scores_gemma":[0.0000037637908,0.0000058189034,0.0006998338,0.00015159654,0.0000059831473,0.00011192653,0.00007213644,0.0012913072,0.000072131006,0.74997455,0.24760643,0.0000044825592],"about_ca_topic_score_codex":0.001682796,"about_ca_topic_score_gemma":0.002165963,"teacher_disagreement_score":0.025584465,"about_ca_system_score_codex":0.001202315,"about_ca_system_score_gemma":0.0006058895,"threshold_uncertainty_score":0.085588515},"labels":[],"label_agreement":null},{"id":"W2890159479","doi":"10.1007/978-3-030-00834-5_10","title":"Reconstructing the History of Syntenies Through Super-Reconciliation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.022514314461643644,"score_gpt":0.22620170856450805,"score_spread":0.2036873941028644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890159479","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.17428026,0.011410085,0.76204616,0.0032729995,0.0007484818,0.00015096599,0.0052002175,0.0035811232,0.039309748],"genre_scores_gemma":[0.6124078,0.005836921,0.3579107,0.0005595503,0.00032877046,0.00017376167,0.011114247,0.0029188613,0.0087494515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983454,0.0006487518,0.000098979035,0.00051253266,0.0002761179,0.00011824894],"domain_scores_gemma":[0.9917528,0.0043562045,0.0005349576,0.002518813,0.00057279324,0.00026437154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030642776,0.0007272038,0.0008936066,0.0041320994,0.0019686017,0.0041577243,0.0028764629,0.001769149,0.009754806],"category_scores_gemma":[0.018100552,0.001315736,0.0010475338,0.0070756483,0.002954558,0.008970185,0.0045877644,0.0035341326,0.0036786853],"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.0008053484,0.00009850641,0.016443608,0.0016683723,0.00046333618,0.0017843953,0.00635987,0.049720027,0.015117156,0.47238714,0.015655681,0.4194967],"study_design_scores_gemma":[0.00005395824,0.00009160032,0.005954243,0.000559075,0.0002521654,0.0011108173,0.0012721339,0.08747235,0.006987275,0.8035126,0.09262218,0.00011157857],"about_ca_topic_score_codex":0.0017082017,"about_ca_topic_score_gemma":0.0030296103,"teacher_disagreement_score":0.009754806,"about_ca_system_score_codex":0.0010735415,"about_ca_system_score_gemma":0.001166239,"threshold_uncertainty_score":0.032633066},"labels":[],"label_agreement":null},{"id":"W2890205431","doi":"10.1007/978-3-030-03801-4_63","title":"Multiple Object Tracking in Urban Traffic Scenes with a Multiclass Object Detector","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Polytechnique Montréal","funders":"","keywords":"Object (grammar); Computer vision; Artificial intelligence; Computer science; Tracking (education); Video tracking; Object detection; Task (project management); Detector; Position (finance); Field (mathematics); Pattern recognition (psychology); Mathematics; Engineering; Psychology","score_opus":0.027060494954520488,"score_gpt":0.2928495479674822,"score_spread":0.2657890530129617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890205431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19347583,0.0005349132,0.80282426,0.00014565604,0.00014398641,0.00004565158,0.000103073246,0.0010181972,0.0017084669],"genre_scores_gemma":[0.70674115,0.0002977323,0.28920823,0.00007622208,0.0000647487,0.000030521926,0.00023134526,0.00009438463,0.003255675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952483,0.00006387611,0.000013854803,0.00016750817,0.0001270338,0.000102941056],"domain_scores_gemma":[0.9995165,0.00015900914,0.000042726628,0.00008894478,0.00014335198,0.000049389317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010055408,0.000538443,0.0010817008,0.001073656,0.0005309203,0.001062816,0.0008592334,0.0012072041,0.00082640524],"category_scores_gemma":[0.0014476714,0.00056482566,0.000539366,0.0011682609,0.00034770893,0.00077778165,0.0009260486,0.0008531071,0.00044637112],"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.0010351537,0.0003864634,0.010697798,0.00015027839,0.00025133844,0.00036686053,0.000197863,0.16308129,0.11775508,0.0031485844,0.0026199683,0.70030934],"study_design_scores_gemma":[0.000009232494,0.00004013064,0.0022787035,0.000003650605,0.000026829415,0.0000856398,0.00001679906,0.9895426,0.007019858,0.0005548382,0.00041375574,0.000007852685],"about_ca_topic_score_codex":0.0056891753,"about_ca_topic_score_gemma":0.007371332,"teacher_disagreement_score":0.0056891753,"about_ca_system_score_codex":0.00044518663,"about_ca_system_score_gemma":0.0007220119,"threshold_uncertainty_score":0.011312127},"labels":[],"label_agreement":null},{"id":"W2890268332","doi":"10.1007/978-3-030-00934-2_12","title":"A Multitask Learning Architecture for Simultaneous Segmentation of Bright and Red Lesions in Fundus Images","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hôpital Maisonneuve-Rosemont; Polytechnique Montréal","funders":"","keywords":"Computer science; Segmentation; Pooling; Artificial intelligence; Decoding methods; Encoding (memory); Pattern recognition (psychology); Image segmentation; Encoder; Task (project management); Residual; Algorithm","score_opus":0.014974069428737352,"score_gpt":0.28729006824649933,"score_spread":0.272315998817762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890268332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05080362,0.0014237409,0.93750477,0.0005198392,0.0002695183,0.000106595486,0.0006141382,0.006194947,0.0025628216],"genre_scores_gemma":[0.47262004,0.00093898055,0.5058892,0.0007321923,0.00033393345,0.0002560236,0.0023105112,0.0004103771,0.016508859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971193,0.00004505486,0.000016250671,0.00011440871,0.00004952633,0.00006279814],"domain_scores_gemma":[0.9994848,0.00017551992,0.000028564524,0.00007270732,0.00018174604,0.00005662258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011167082,0.0011444166,0.0010645437,0.0007149755,0.0005849584,0.0009331501,0.0022691425,0.0021819242,0.0038689333],"category_scores_gemma":[0.0010207114,0.00067979563,0.0011854294,0.000901576,0.00034089296,0.0009433846,0.001529956,0.0015906928,0.001921055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005544083,0.00038324075,0.0015146427,0.00014875774,0.00023906257,0.00013933016,0.0000905505,0.1064794,0.040448427,0.0019682657,0.011180493,0.83685344],"study_design_scores_gemma":[0.000015023658,0.00006748598,0.0006648198,0.000010972839,0.00004487153,0.000043851313,0.000011512889,0.98912317,0.0068317666,0.0021266341,0.0010475254,0.000012347346],"about_ca_topic_score_codex":0.01381097,"about_ca_topic_score_gemma":0.018564114,"teacher_disagreement_score":0.01381097,"about_ca_system_score_codex":0.0008234963,"about_ca_system_score_gemma":0.0011414276,"threshold_uncertainty_score":0.027461171},"labels":[],"label_agreement":null},{"id":"W2890554424","doi":"10.1007/978-3-030-00934-2_15","title":"Predicting Cancer with a Recurrent Visual Attention Model for Histopathology Images","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Discriminative model; Computer science; Histopathology; Digital pathology; Artificial intelligence; Pattern recognition (psychology); Convolutional neural network; Scalability; Computer vision; Pathology; Medicine","score_opus":0.021116930453384246,"score_gpt":0.28400159260883145,"score_spread":0.2628846621554472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890554424","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.5698615,0.010754708,0.3950887,0.0024813635,0.0013362783,0.0002899874,0.0035985669,0.008482776,0.008105985],"genre_scores_gemma":[0.95212007,0.0009870068,0.035038475,0.00054876105,0.00054648746,0.000058419413,0.0021037466,0.00013594907,0.008461056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.000028411534,0.000010942294,0.00012075322,0.00004992127,0.00008132844],"domain_scores_gemma":[0.99947566,0.00017753935,0.000051189683,0.000063484375,0.00018422182,0.000047918875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073802826,0.0013971898,0.0009910356,0.001555693,0.00028509577,0.00084837904,0.0015341465,0.0013637443,0.0019621758],"category_scores_gemma":[0.001280451,0.00035705286,0.0015866712,0.0007663746,0.00023616261,0.0007349776,0.00077518006,0.0011152809,0.0012931734],"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.001118232,0.0007588276,0.017742125,0.0002330497,0.0004624812,0.0005099369,0.00009813353,0.114232436,0.050304774,0.000868094,0.02029942,0.79337245],"study_design_scores_gemma":[0.000014825505,0.0001942859,0.0052094855,0.00001801366,0.0001689736,0.00020070629,0.000017664703,0.98482805,0.007412842,0.0012167967,0.000700493,0.000017764785],"about_ca_topic_score_codex":0.017740935,"about_ca_topic_score_gemma":0.020463407,"teacher_disagreement_score":0.017740935,"about_ca_system_score_codex":0.0008980724,"about_ca_system_score_gemma":0.000599521,"threshold_uncertainty_score":0.03527534},"labels":[],"label_agreement":null},{"id":"W2890953374","doi":"10.1007/978-3-030-03801-4_65","title":"Road User Abnormal Trajectory Detection Using a Deep Autoencoder","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Polytechnique Montréal","funders":"","keywords":"Autoencoder; Computer science; Focus (optics); Artificial intelligence; Deep learning; Anomaly detection; Trajectory; Outlier; Computer vision; Pattern recognition (psychology); Machine learning","score_opus":0.01761473281827005,"score_gpt":0.2520296678389761,"score_spread":0.23441493502070607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890953374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15360261,0.00039428857,0.83809626,0.00025561792,0.00022278534,0.000055529326,0.0005527622,0.0033346033,0.003485456],"genre_scores_gemma":[0.8699814,0.00026682095,0.12148191,0.00008076532,0.000074578835,0.000029291654,0.0009884118,0.00008966391,0.007007072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999821,0.000011906473,0.0000067771334,0.000055251694,0.000059935006,0.00004515511],"domain_scores_gemma":[0.999777,0.000040388473,0.000021488851,0.000031587144,0.00011156348,0.00001794935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018477911,0.0005338404,0.00043315286,0.00064170716,0.00019070222,0.00039585886,0.0005396964,0.000511082,0.0012635401],"category_scores_gemma":[0.00048477118,0.00026881197,0.00042784758,0.00047674624,0.00013765988,0.00050160993,0.00047740334,0.00092545984,0.0007686825],"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.00029111523,0.0002579405,0.009341545,0.00007354845,0.00010434159,0.00029246305,0.00006347793,0.14599587,0.044832148,0.0016436345,0.0071368082,0.7899671],"study_design_scores_gemma":[0.000001903395,0.000021701484,0.002535505,0.000003889905,0.000011305299,0.000054468575,0.000007790816,0.9911179,0.0054103695,0.0003399953,0.0004896175,0.000005581551],"about_ca_topic_score_codex":0.009205968,"about_ca_topic_score_gemma":0.012989373,"teacher_disagreement_score":0.009205968,"about_ca_system_score_codex":0.0003486561,"about_ca_system_score_gemma":0.0005122498,"threshold_uncertainty_score":0.018304765},"labels":[],"label_agreement":null},{"id":"W2890965364","doi":"10.1007/978-3-030-11018-5_53","title":"Hierarchical Video Understanding","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer graphics (images); Artificial intelligence; Computer vision","score_opus":0.03972982676256215,"score_gpt":0.25747318471130964,"score_spread":0.2177433579487475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890965364","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.0074131065,0.0014485455,0.9487152,0.00020710738,0.000080882885,0.00011344631,0.00095925626,0.0048745447,0.036187854],"genre_scores_gemma":[0.14706793,0.0029495582,0.76919,0.00020091703,0.00011587701,0.00012683151,0.00723489,0.0012582195,0.07185579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998367,0.000011425522,0.0000071016057,0.0000691849,0.000049778002,0.000025676945],"domain_scores_gemma":[0.999874,0.000024613295,0.000009294538,0.00004712968,0.000033281245,0.000011657251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017086366,0.0009877321,0.00053967605,0.0012824807,0.00037151398,0.0012794837,0.0010585438,0.00074379076,0.02498647],"category_scores_gemma":[0.00045866737,0.00044135324,0.0006640447,0.00091198954,0.0003896711,0.0017186237,0.0011044225,0.000940756,0.007872035],"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.0000871719,0.00004844671,0.00020267282,0.00018555022,0.000032324457,0.00013137094,0.00010264896,0.016173271,0.059906505,0.041012175,0.024273556,0.85784435],"study_design_scores_gemma":[0.000026916625,0.00013510317,0.0018149785,0.00016404645,0.000081219485,0.0007625104,0.00026838423,0.60830426,0.11708834,0.11225529,0.15905519,0.00004380598],"about_ca_topic_score_codex":0.0050283303,"about_ca_topic_score_gemma":0.0066201924,"teacher_disagreement_score":0.02498647,"about_ca_system_score_codex":0.0005158578,"about_ca_system_score_gemma":0.00045283942,"threshold_uncertainty_score":0.08358806},"labels":[],"label_agreement":null},{"id":"W2890974131","doi":"10.1007/978-3-030-00560-3_12","title":"Integrating Construction Specifications and Building Information Modeling","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software engineering","score_opus":0.01618171138215881,"score_gpt":0.21077274715354305,"score_spread":0.19459103577138423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890974131","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.0024413879,0.0019104666,0.9267124,0.0006427872,0.0001203393,0.000040211857,0.00039101433,0.0010688163,0.066672616],"genre_scores_gemma":[0.1258804,0.010143744,0.790062,0.0004005156,0.0001274545,0.00019441868,0.0061342386,0.0015741554,0.06548313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872154,0.0002664621,0.00011018462,0.00009696996,0.0007454338,0.000059419854],"domain_scores_gemma":[0.99907494,0.0003946051,0.000041850762,0.00025499667,0.00021140168,0.00002226632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013220974,0.0011285864,0.00063315255,0.0021943904,0.00056098844,0.004310282,0.0023182298,0.0012274687,0.0079541765],"category_scores_gemma":[0.0027567872,0.0011602787,0.001367301,0.0038781217,0.0011484666,0.005364723,0.0021831205,0.0020607726,0.0037178686],"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.0000113909155,0.000029572342,0.00021795141,0.00035818675,0.00002608267,0.00013399954,0.00051667704,0.037149705,0.0014406746,0.7653005,0.009207699,0.18560757],"study_design_scores_gemma":[0.000005937256,0.000020772566,0.0002060713,0.00043438227,0.000045855042,0.00029798705,0.00029726553,0.14429884,0.005068312,0.46070406,0.3885821,0.00003841038],"about_ca_topic_score_codex":0.006008617,"about_ca_topic_score_gemma":0.0071772286,"teacher_disagreement_score":0.0079541765,"about_ca_system_score_codex":0.0013984005,"about_ca_system_score_gemma":0.0013985843,"threshold_uncertainty_score":0.026609361},"labels":[],"label_agreement":null},{"id":"W2891004685","doi":"10.1007/978-3-030-00889-5_8","title":"Automatic Detection of Patients with a High Risk of Systolic Cardiac Failure in Echocardiography","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiovascular Function and Risk Factors","field":"Medicine","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":"Vancouver General Hospital; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Cardiology; Internal medicine; Heart failure; Medicine","score_opus":0.004312185951742806,"score_gpt":0.19205692998464843,"score_spread":0.18774474403290564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891004685","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.6287132,0.02375068,0.31152222,0.0027621356,0.0018418232,0.00020297235,0.005988787,0.0034733785,0.0217447],"genre_scores_gemma":[0.89196825,0.0040250537,0.09293907,0.00053488644,0.001219509,0.000065308515,0.0029338892,0.00014536732,0.006168709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998355,0.00004132171,0.000015832884,0.000035913596,0.000053379496,0.000017941024],"domain_scores_gemma":[0.9993788,0.00040525955,0.000045396395,0.000036418005,0.000093143004,0.00004094274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000510352,0.00047198756,0.0004338002,0.0008689239,0.00011682083,0.000797175,0.00047386106,0.0005712375,0.0019679123],"category_scores_gemma":[0.0015305439,0.00018408448,0.00033375347,0.00035349757,0.00011691577,0.0003449436,0.00037463594,0.00044347497,0.0011715066],"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.0008250081,0.0002967338,0.15908675,0.00037184876,0.00017351483,0.0010794488,0.00011751163,0.003917217,0.04660564,0.0014579323,0.02061604,0.7654524],"study_design_scores_gemma":[0.00016112617,0.0010541704,0.6392377,0.00052049826,0.00087093265,0.0146854,0.00043877566,0.2297123,0.05767846,0.017519752,0.037904084,0.00021673708],"about_ca_topic_score_codex":0.00032857424,"about_ca_topic_score_gemma":0.000640018,"teacher_disagreement_score":0.0019679123,"about_ca_system_score_codex":0.000078336234,"about_ca_system_score_gemma":0.00015111268,"threshold_uncertainty_score":0.006583333},"labels":[],"label_agreement":null},{"id":"W2891172950","doi":"10.1007/978-3-030-00937-3_45","title":"How to Exploit Weaknesses in Biomedical Challenge Design and Organization","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":33,"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":"Deutsches Krebsforschungszentrum","keywords":"Benchmarking; Computer science; Exploit; Strengths and weaknesses; Data science; Best practice; Management science; Computer security; Political science; Management","score_opus":0.015524816161626343,"score_gpt":0.2065904991412381,"score_spread":0.19106568297961174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891172950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008075923,0.00042791537,0.9738535,0.0026768276,0.00017665362,0.00010307388,0.00009226019,0.0013280356,0.013265775],"genre_scores_gemma":[0.1735638,0.0005173437,0.8050904,0.0008854123,0.00009993991,0.00026564774,0.0002511186,0.0010319252,0.018294392],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756134,0.00070205773,0.00019679511,0.0004095986,0.0009419393,0.00018825459],"domain_scores_gemma":[0.98995364,0.004209839,0.0005507092,0.0031428102,0.0018109864,0.0003318841],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0055204644,0.0009173187,0.00056771137,0.00077518116,0.0009310406,0.0035807888,0.0017242276,0.0017983255,0.011394568],"category_scores_gemma":[0.022131378,0.0010283475,0.00075511914,0.00044736362,0.0021690992,0.0073777167,0.004919795,0.0031893207,0.003898771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028492024,0.00012872316,0.0031709655,0.00066033565,0.00013379654,0.00023862529,0.0013749076,0.06484547,0.029282745,0.27159402,0.0266136,0.6016719],"study_design_scores_gemma":[0.000051517804,0.00015866982,0.00064084044,0.0003222766,0.00011170675,0.00052082795,0.000746855,0.30823702,0.03563851,0.53713804,0.11636049,0.00007324622],"about_ca_topic_score_codex":0.0009101792,"about_ca_topic_score_gemma":0.0013616846,"teacher_disagreement_score":0.99447954,"about_ca_system_score_codex":0.00076964934,"about_ca_system_score_gemma":0.001412867,"threshold_uncertainty_score":0.0381186},"labels":[],"label_agreement":null},{"id":"W2891195353","doi":"10.1007/978-3-030-00889-5_4","title":"A Unified Framework Integrating Recurrent Fully-Convolutional Networks and Optical Flow for Segmentation of the Left Ventricle in Echocardiography Data","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Optical flow; Ventricle; Speckle pattern; Computer vision; Pattern recognition (psychology); Operator (biology); Medicine; Image (mathematics); Cardiology","score_opus":0.02201473749328299,"score_gpt":0.31863760979090505,"score_spread":0.2966228722976221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891195353","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.0055622393,0.00090350327,0.9888285,0.00016976566,0.00009657839,0.000056031487,0.0003319349,0.0033935136,0.00065791694],"genre_scores_gemma":[0.10690787,0.0013270609,0.88125527,0.0003649795,0.00022599773,0.00021184853,0.002697483,0.0006872208,0.006322223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.000063568725,0.000027602397,0.00013942886,0.000119681725,0.00007467951],"domain_scores_gemma":[0.99950814,0.00015160974,0.00003947372,0.00007751794,0.00017547667,0.00004780951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497118,0.0016638784,0.0016835453,0.0012541154,0.0005740022,0.0015335089,0.0035133143,0.0022541743,0.0029013378],"category_scores_gemma":[0.001516387,0.0011237235,0.001966902,0.0013237913,0.00046554755,0.0015912971,0.0018354135,0.0017506785,0.001947375],"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.00019207185,0.00017255671,0.00061480864,0.00018443118,0.0002950889,0.00016117022,0.000074417505,0.2853621,0.021342171,0.007848924,0.010603675,0.67314863],"study_design_scores_gemma":[0.0000046368323,0.000019140447,0.000101167054,0.000009353929,0.00002136088,0.000025233943,0.0000034617499,0.9944554,0.0024095776,0.0020085895,0.00093268324,0.000009394767],"about_ca_topic_score_codex":0.031676438,"about_ca_topic_score_gemma":0.048471246,"teacher_disagreement_score":0.031676438,"about_ca_system_score_codex":0.001297209,"about_ca_system_score_gemma":0.0024729383,"threshold_uncertainty_score":0.06298411},"labels":[],"label_agreement":null},{"id":"W2891198015","doi":"10.1007/978-3-319-46295-0","title":"Service-Oriented Computing","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Service (business); Library science; Software engineering; World Wide Web","score_opus":0.009092388303665934,"score_gpt":0.23563992633633313,"score_spread":0.2265475380326672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891198015","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002738245,0.027375823,0.33060583,0.002259896,0.003729764,0.00021408113,0.00034726405,0.002913789,0.6298154],"genre_scores_gemma":[0.066601686,0.048802745,0.19463749,0.0019377354,0.0022759645,0.0004214777,0.002090818,0.00184106,0.6813912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994747,0.000061438106,0.000022980437,0.000077031335,0.00032410317,0.000039778573],"domain_scores_gemma":[0.9997925,0.00005733013,0.000008575806,0.00005715484,0.00005878221,0.000025703936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037333477,0.001535225,0.0009463771,0.0013041538,0.00067376625,0.00318651,0.00075882697,0.00074121554,0.018354729],"category_scores_gemma":[0.00074485864,0.00047969853,0.000626972,0.0028307713,0.0009606068,0.0031176584,0.001366956,0.0020503553,0.014374306],"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.000033467564,0.000057677342,0.000075293116,0.0003756644,0.000036826154,0.000092201095,0.0002424757,0.002649543,0.003688772,0.5252279,0.10941679,0.35810342],"study_design_scores_gemma":[0.000012729127,0.00002360424,0.00013212455,0.0001726654,0.000015082301,0.00021093883,0.0000480236,0.00679428,0.0015058528,0.26560086,0.725469,0.000014841903],"about_ca_topic_score_codex":0.00094289763,"about_ca_topic_score_gemma":0.0010989095,"teacher_disagreement_score":0.018354729,"about_ca_system_score_codex":0.0011255934,"about_ca_system_score_gemma":0.0010397736,"threshold_uncertainty_score":0.061402738},"labels":[],"label_agreement":null},{"id":"W2891315721","doi":"10.1007/978-3-030-00937-3_37","title":"Simultaneous Surgical Visibility Assessment, Restoration, and Augmented Stereo Surface Reconstruction for Robotic Prostatectomy","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Western University","funders":"","keywords":"Visibility; Computer science; Computer vision; Artificial intelligence; Prostatectomy; Medicine; Optics; Prostate cancer; Physics","score_opus":0.020275673104648412,"score_gpt":0.3107627035424221,"score_spread":0.2904870304377737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891315721","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.13155536,0.0035555225,0.8563725,0.0002677694,0.00014470956,0.000053146447,0.0002572801,0.0019403293,0.005853457],"genre_scores_gemma":[0.67296064,0.0020351603,0.31829783,0.00007389679,0.00010612022,0.00003453953,0.0003827386,0.00043848858,0.00567058],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996136,0.00005525751,0.000018060973,0.000058418253,0.00021673572,0.00003784059],"domain_scores_gemma":[0.999788,0.00007347674,0.000026386318,0.000050747538,0.00004456908,0.000016928829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030881644,0.0005085524,0.00043112817,0.0004410738,0.00013295481,0.00083110045,0.0005683762,0.00051842775,0.0022155463],"category_scores_gemma":[0.0009739372,0.0005641128,0.00068435294,0.00030087496,0.00023249278,0.00076708844,0.001009071,0.0007809987,0.00042781862],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047972988,0.00010117787,0.0023994981,0.0003501878,0.000065493645,0.000517742,0.00019459684,0.034958273,0.13843876,0.0022713204,0.0050933054,0.81512994],"study_design_scores_gemma":[0.00004783683,0.0007110951,0.019140143,0.000112988,0.0001631975,0.013666863,0.00021707673,0.85769886,0.08786578,0.006027771,0.014151659,0.00019682899],"about_ca_topic_score_codex":0.00081144477,"about_ca_topic_score_gemma":0.0020567167,"teacher_disagreement_score":0.0022155463,"about_ca_system_score_codex":0.00013427026,"about_ca_system_score_gemma":0.0004439701,"threshold_uncertainty_score":0.0074117184},"labels":[],"label_agreement":null},{"id":"W2891398956","doi":"10.1007/978-3-030-00919-9_18","title":"Brain Status Prediction with Non-negative Projective Dictionary Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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; École de Technologie Supérieure; Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Computer science; Discriminative model; Dictionary learning; Artificial intelligence; Neural coding; Machine learning; Projective test; Pattern recognition (psychology); Representation (politics); Sparse approximation; Mathematics","score_opus":0.010803993489296003,"score_gpt":0.23288823474240078,"score_spread":0.22208424125310477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891398956","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.08821139,0.0011017438,0.9023544,0.0005011848,0.00027833087,0.0001049448,0.0007903701,0.0013700998,0.005287419],"genre_scores_gemma":[0.8439818,0.00065023184,0.14482282,0.00020160095,0.00016763703,0.000100062745,0.0016170909,0.00014332452,0.008315312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998227,0.000032006417,0.000009477678,0.00007773359,0.00002632101,0.000031766158],"domain_scores_gemma":[0.9996736,0.00012419703,0.000026058426,0.00006382284,0.00008538477,0.000026964772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039898462,0.00067211065,0.00060627615,0.00041925727,0.00023136237,0.0006967643,0.00076941727,0.0005756321,0.0031828678],"category_scores_gemma":[0.0014325326,0.00023952808,0.0004696296,0.00048254742,0.00035896036,0.000935868,0.0010147063,0.0009103245,0.0014197234],"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.00038236106,0.00018029689,0.005997332,0.00011752601,0.00012815958,0.00013865312,0.00006722107,0.033160143,0.015828667,0.00673131,0.013091965,0.92417634],"study_design_scores_gemma":[0.000024429193,0.00009973258,0.0026975963,0.000019037256,0.00005057345,0.0002111808,0.00004560489,0.9745147,0.007914185,0.012586032,0.0018176853,0.00001912542],"about_ca_topic_score_codex":0.0017932148,"about_ca_topic_score_gemma":0.002856158,"teacher_disagreement_score":0.0031828678,"about_ca_system_score_codex":0.0001917051,"about_ca_system_score_gemma":0.000386137,"threshold_uncertainty_score":0.010647714},"labels":[],"label_agreement":null},{"id":"W2891689009","doi":"10.1007/978-3-030-00946-5_5","title":"An Unbiased Groupwise Registration Algorithm for Correcting Motion in Dynamic Contrast-Enhanced Magnetic Resonance Images","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Ontario Tech University","funders":"","keywords":"Computer science; Contrast (vision); Artificial intelligence; Computer vision; Motion (physics); Dynamic contrast-enhanced MRI; Dynamic contrast; Magnetic resonance imaging; Algorithm; Image registration; Image (mathematics)","score_opus":0.013448583988143867,"score_gpt":0.30178940802532117,"score_spread":0.2883408240371773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891689009","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.0023552212,0.00026115793,0.9963058,0.000049595827,0.0000595636,0.000034642988,0.000040390667,0.0006160971,0.0002774307],"genre_scores_gemma":[0.017551368,0.00027248706,0.9793711,0.00006509064,0.00005813348,0.000094421885,0.00025482193,0.00027738162,0.0020552385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989122,0.00028185808,0.000069830465,0.00025767917,0.000404349,0.000074112584],"domain_scores_gemma":[0.9988226,0.00042890292,0.00010212059,0.00023774155,0.0003762014,0.00003227873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017055438,0.0012362889,0.0013808932,0.0014108449,0.00077091774,0.000981176,0.0020404155,0.0018245747,0.003097798],"category_scores_gemma":[0.004358238,0.00078042696,0.0012956897,0.0018185871,0.0007435009,0.0011712706,0.0016338518,0.0017683661,0.0029587003],"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.00026520513,0.00011641742,0.0005243315,0.0001826236,0.00022956428,0.00010355743,0.00013015374,0.044963025,0.043953042,0.007734396,0.00777823,0.8940195],"study_design_scores_gemma":[0.00005616157,0.00022080647,0.0017473269,0.000043039137,0.00018748181,0.000619933,0.00006355964,0.92503005,0.047796365,0.010931291,0.013226762,0.00007728552],"about_ca_topic_score_codex":0.0039136154,"about_ca_topic_score_gemma":0.009343024,"teacher_disagreement_score":0.0039136154,"about_ca_system_score_codex":0.00041875834,"about_ca_system_score_gemma":0.0016293438,"threshold_uncertainty_score":0.010363162},"labels":[],"label_agreement":null},{"id":"W2891705201","doi":"10.1007/978-3-030-00931-1_78","title":"Joint Segmentation of Intracerebral Hemorrhage and Infarct from Non-Contrast CT Images of Post-treatment Acute Ischemic Stroke Patients","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acute Ischemic Stroke Management","field":"Medicine","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 Calgary","funders":"","keywords":"Medicine; Segmentation; Intracerebral hemorrhage; Similarity (geometry); Angiography; Stroke (engine); Artificial intelligence; Contrast (vision); Ischemic stroke; Radiology; Cerebral infarction; Computer science; Cardiology; Internal medicine; Ischemia; Image (mathematics); Subarachnoid hemorrhage","score_opus":0.007441011767592852,"score_gpt":0.2311245926037072,"score_spread":0.22368358083611437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891705201","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.6114889,0.017222349,0.32508516,0.0018671901,0.00089744566,0.00043188225,0.009939347,0.0038106774,0.029257214],"genre_scores_gemma":[0.7577882,0.009010558,0.19345322,0.00035184287,0.00069336465,0.00012249836,0.014682542,0.0010362453,0.022861646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986947,0.000018331355,0.000016535732,0.000029129422,0.000041582844,0.000024857593],"domain_scores_gemma":[0.9998191,0.0000698756,0.000025801928,0.00001967529,0.000046727673,0.000018956507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033016375,0.0005017995,0.0005068398,0.0011508481,0.00017768447,0.0011360866,0.00044889783,0.00057774474,0.0027960248],"category_scores_gemma":[0.0008831165,0.00027366218,0.0007953528,0.00069090916,0.00015020404,0.00037791702,0.00035921898,0.00032019752,0.0015449513],"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.0010955093,0.00012094947,0.027229652,0.00045775372,0.00026579198,0.0024383643,0.00035086938,0.010901998,0.056555644,0.0022665313,0.02462028,0.87369674],"study_design_scores_gemma":[0.00010385902,0.0007209823,0.3666388,0.0005615085,0.0011744719,0.02770242,0.0011302906,0.36067647,0.13347147,0.02423146,0.08336518,0.00022307636],"about_ca_topic_score_codex":0.0028336628,"about_ca_topic_score_gemma":0.0055687837,"teacher_disagreement_score":0.0028336628,"about_ca_system_score_codex":0.00025953856,"about_ca_system_score_gemma":0.00044103005,"threshold_uncertainty_score":0.009353638},"labels":[],"label_agreement":null},{"id":"W2891808718","doi":"10.1007/978-3-030-00560-3_28","title":"Smart and Cooperative Visualization Framework for a Window Company Production","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","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 Alberta","funders":"","keywords":"Computer science; Production planning; Visualization; Window (computing); Linear programming; Production (economics); Production line; Industrial engineering; Operations research; Decision support system; Algorithm; Artificial intelligence; Engineering","score_opus":0.016636903809501148,"score_gpt":0.25909178656268606,"score_spread":0.2424548827531849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891808718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018696558,0.00039001481,0.90928197,0.00042156942,0.00009780862,0.00017176887,0.003322082,0.05679517,0.01082317],"genre_scores_gemma":[0.24683714,0.0007943638,0.72753626,0.00017057385,0.00005872565,0.0003750398,0.005950519,0.004703914,0.013573476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997732,0.00004531411,0.000017234928,0.000052929794,0.00008271606,0.000028512963],"domain_scores_gemma":[0.99968374,0.000102260106,0.000020409136,0.00008343608,0.000055810244,0.00005446689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061169115,0.0011780148,0.00062113436,0.0011575724,0.00052558386,0.0026862463,0.0014487139,0.00088439015,0.016459767],"category_scores_gemma":[0.00094708696,0.0005729492,0.0012295984,0.00077320175,0.00030031957,0.0017248794,0.002118152,0.0009924008,0.0020874229],"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.0010819144,0.0006155891,0.006842737,0.0012353571,0.00040545876,0.0022014,0.003251433,0.22071776,0.04330282,0.09891258,0.116691545,0.5047415],"study_design_scores_gemma":[0.000089471345,0.00009000511,0.0016435252,0.00013043628,0.00009359399,0.0003389441,0.0003310159,0.82547444,0.014178948,0.033275295,0.12425757,0.00009674196],"about_ca_topic_score_codex":0.006936841,"about_ca_topic_score_gemma":0.012279663,"teacher_disagreement_score":0.016459767,"about_ca_system_score_codex":0.0005165265,"about_ca_system_score_gemma":0.0009167944,"threshold_uncertainty_score":0.055063367},"labels":[],"label_agreement":null},{"id":"W2891930168","doi":"10.1007/978-3-030-04651-4_2","title":"Rectilinear Shortest Paths Among Transient Obstacles","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning 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":"Carleton University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Obstacle; Point (geometry); Transient (computer programming); Bounded function; Point location; Algorithm; Shortest path problem; Robot; Interval (graph theory); Subdivision; Wavefront; Path (computing); Mathematics; Combinatorics; Artificial intelligence; Graph; Geometry; Theoretical computer science; Mathematical analysis; Physics; Optics","score_opus":0.020940770753114502,"score_gpt":0.24556026608638665,"score_spread":0.22461949533327213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891930168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019013006,0.0012385581,0.93179435,0.00025787132,0.00018750897,0.000072260824,0.0008172449,0.0014214359,0.045197874],"genre_scores_gemma":[0.16650024,0.0037939618,0.7265984,0.00011169349,0.00006435075,0.00023620628,0.0039614453,0.0009187796,0.09781496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000018037324,0.00001029108,0.000059155645,0.00007382019,0.000025920395],"domain_scores_gemma":[0.9997919,0.00007246228,0.000027310323,0.000047282425,0.000042735588,0.000018301567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013666261,0.0009237472,0.0005384024,0.00048741742,0.00041647482,0.0007086735,0.0011791555,0.00072595256,0.010086153],"category_scores_gemma":[0.00076586794,0.0005665338,0.00047097838,0.0014100033,0.00040177224,0.0014572033,0.0012562847,0.0013734591,0.0035088065],"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.00014218775,0.00005395073,0.00026833863,0.000653817,0.00003456553,0.00024414485,0.0001996302,0.4025095,0.017817242,0.11639417,0.026083566,0.43559882],"study_design_scores_gemma":[0.000053854706,0.00017522364,0.0007256026,0.0001938286,0.00003385391,0.0005247959,0.0001877403,0.690105,0.015323308,0.15427946,0.13834386,0.000053436423],"about_ca_topic_score_codex":0.0019660008,"about_ca_topic_score_gemma":0.0033063844,"teacher_disagreement_score":0.010086153,"about_ca_system_score_codex":0.0005239352,"about_ca_system_score_gemma":0.00083914684,"threshold_uncertainty_score":0.033741534},"labels":[],"label_agreement":null},{"id":"W2891961600","doi":"10.1007/978-3-030-00834-5_8","title":"Speciation and Rate Variation in a Birth-and-Death Account of WGD and Fractionation; the Case of Solanaceae","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Plant Pathogens and Fungal Diseases","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genetic algorithm; Variation (astronomy); Computer science; Solanaceae; Biology; Evolutionary biology; Astrophysics","score_opus":0.009831063947694587,"score_gpt":0.22941148802673464,"score_spread":0.21958042407904005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891961600","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.41704142,0.039855674,0.39604685,0.022630168,0.0013918484,0.0000673679,0.0006399261,0.0011021679,0.12122463],"genre_scores_gemma":[0.94228,0.005990801,0.020012971,0.0012304005,0.00085155613,0.00004473714,0.00016195266,0.0004517942,0.02897585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996892,0.00009285906,0.00001933981,0.00010359493,0.000050311308,0.000044771834],"domain_scores_gemma":[0.99937457,0.00036363662,0.000054152842,0.00010212675,0.000039785056,0.000065674525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239933,0.0006515833,0.0012427588,0.0007233546,0.0010300542,0.0021445702,0.002878515,0.0019742665,0.004846012],"category_scores_gemma":[0.0026091074,0.00073168427,0.0013135868,0.00085810514,0.002748363,0.003475285,0.0014056561,0.001867829,0.00073989236],"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.00010240127,0.000027503555,0.0022456036,0.00011341566,0.00011442931,0.0004950529,0.0006092932,0.053094175,0.006472237,0.8990729,0.0045400197,0.033112958],"study_design_scores_gemma":[0.000013872441,0.000017905353,0.0020921738,0.0000146802195,0.00004275393,0.00027415995,0.000104446626,0.0745187,0.00043938044,0.91375995,0.008686071,0.000035962752],"about_ca_topic_score_codex":0.0028008923,"about_ca_topic_score_gemma":0.002817039,"teacher_disagreement_score":0.004846012,"about_ca_system_score_codex":0.0017405478,"about_ca_system_score_gemma":0.00036477068,"threshold_uncertainty_score":0.01621151},"labels":[],"label_agreement":null},{"id":"W2892006193","doi":"10.1007/978-3-030-00419-4_5","title":"Online Voting in Indigenous Communities: Lessons from Canada","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","cited_by":7,"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 Guelph; Brock University","funders":"","keywords":"Computer science; Voting; Indigenous; Electronic voting; World Wide Web; Political science; Ecology","score_opus":0.039363655739249145,"score_gpt":0.30944186651047384,"score_spread":0.2700782107712247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892006193","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7134056,0.0018283612,0.0006367971,0.018840646,0.00015921453,0.00010948574,0.00047454916,0.00004801995,0.2644973],"genre_scores_gemma":[0.9644019,0.0007828139,0.00033902828,0.0006764399,0.000019181147,0.000017967763,0.0001398915,0.000035106877,0.03358754],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703765,0.00051949447,0.000040459483,0.00020656081,0.00057064387,0.0016253357],"domain_scores_gemma":[0.99480623,0.0015870099,0.00021122115,0.0002121939,0.0018620525,0.0013212191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002493699,0.00022655529,0.000512243,0.0013822471,0.023021685,0.0067251204,0.0020696041,0.001528056,0.012007768],"category_scores_gemma":[0.007955094,0.00021700993,0.00028990256,0.0047139665,0.006311693,0.0022733384,0.0025961662,0.0024456007,0.0006775134],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004169449,0.00047196916,0.122742146,0.00028489548,0.0000693219,0.0016512539,0.4489028,0.0012396356,0.00056046655,0.16226095,0.08005821,0.18134141],"study_design_scores_gemma":[0.0000789251,0.00007511898,0.14057948,0.00040507287,0.000059557107,0.00017582068,0.628516,0.0013547839,0.0004850802,0.012836412,0.21535517,0.0000786141],"about_ca_topic_score_codex":0.9932642,"about_ca_topic_score_gemma":0.9973865,"teacher_disagreement_score":0.051232852,"about_ca_system_score_codex":0.051232852,"about_ca_system_score_gemma":0.07139114,"threshold_uncertainty_score":0.3717221},"labels":[],"label_agreement":null},{"id":"W2892058418","doi":"10.1007/978-3-030-00066-0_38","title":"Association Rule Based Clustering of Electronic Resources in University Digital Library","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Cluster analysis; Computer science; Association rule learning; Digital library; Task (project management); Data mining; Resource (disambiguation); Analytics; Information retrieval; Cluster (spacecraft); Association (psychology); Data science; Artificial intelligence","score_opus":0.00818740504254354,"score_gpt":0.19408003505871638,"score_spread":0.18589263001617284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892058418","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.89713067,0.0035697846,0.08005443,0.00063648756,0.00017632045,0.00019232206,0.0061248983,0.0010940967,0.011020954],"genre_scores_gemma":[0.9298969,0.0007964102,0.05033437,0.00008435542,0.000077607874,0.00007299538,0.008965876,0.0001205917,0.009650966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983627,0.00039983314,0.0001652757,0.00045735558,0.00037384738,0.00024100346],"domain_scores_gemma":[0.99659735,0.0016186894,0.00028934958,0.0003923156,0.000883768,0.00021844315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095974194,0.00040931476,0.0010575535,0.0074148597,0.0013406818,0.0023396804,0.0021235957,0.0011618757,0.0042587263],"category_scores_gemma":[0.00528172,0.0003648849,0.0014171759,0.010572897,0.0003104613,0.0017014957,0.0010607045,0.00067044445,0.0033447933],"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.0014734229,0.0012001564,0.35607213,0.00052702613,0.00089627766,0.00097555,0.0012699337,0.06792867,0.006685587,0.0044841357,0.026545962,0.5319412],"study_design_scores_gemma":[0.000051183415,0.00023685917,0.29344428,0.00020135149,0.00080682704,0.0010757315,0.00261604,0.66847956,0.010028593,0.0093694,0.01349025,0.00019998147],"about_ca_topic_score_codex":0.045428123,"about_ca_topic_score_gemma":0.060768597,"teacher_disagreement_score":0.045428123,"about_ca_system_score_codex":0.0014680205,"about_ca_system_score_gemma":0.001237203,"threshold_uncertainty_score":0.09032738},"labels":[],"label_agreement":null},{"id":"W2892132959","doi":"10.1007/978-3-030-00305-0_1","title":"Succinctly Verifiable Sealed-Bid Auction Smart Contract","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vickrey–Clarke–Groves auction; Combinatorial auction; Verifiable secret sharing; Smart contract; Unique bid auction; Computer security; Transparency (behavior); Common value auction; Protocol (science); Public-key cryptography; Auction theory; Blockchain; Encryption; Programming language; Microeconomics","score_opus":0.010219376671148568,"score_gpt":0.22962194251424384,"score_spread":0.21940256584309528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892132959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028691286,0.00041967642,0.92109233,0.0021961671,0.0003582909,0.0005696381,0.002273171,0.0040348787,0.0403645],"genre_scores_gemma":[0.6742473,0.000639517,0.27610826,0.00074273377,0.00022923683,0.0009440706,0.003318473,0.00072487886,0.043045525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99157435,0.0027141527,0.00060127623,0.000795055,0.0034792842,0.00083585165],"domain_scores_gemma":[0.9838244,0.0072312155,0.0006364538,0.006473528,0.0014108263,0.00042357555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118455,0.0010686239,0.0018032659,0.0007273566,0.0011407238,0.0056546913,0.0035122677,0.0030761857,0.016389044],"category_scores_gemma":[0.0180211,0.0013433888,0.0011957791,0.0014021171,0.0027516966,0.009104267,0.0052784462,0.005969616,0.006078942],"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.001021723,0.00031989024,0.0003573192,0.00037518007,0.00006493652,0.000238015,0.00032530978,0.0602876,0.0055759503,0.813749,0.012848314,0.10483674],"study_design_scores_gemma":[0.00032434592,0.00011697572,0.00016385168,0.00009775768,0.00004886129,0.00013623507,0.00004135643,0.18766119,0.0072722966,0.7902124,0.0138726,0.0000521421],"about_ca_topic_score_codex":0.0011540514,"about_ca_topic_score_gemma":0.0012595723,"teacher_disagreement_score":0.016389044,"about_ca_system_score_codex":0.0021812422,"about_ca_system_score_gemma":0.00469012,"threshold_uncertainty_score":0.054826796},"labels":[],"label_agreement":null},{"id":"W2892205602","doi":"10.1007/978-3-030-00419-4_3","title":"The Threat of SSL/TLS Stripping to Online Voting","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer security; Exploit; Voting; Ballot; Context (archaeology); Internet privacy; Political science; Law","score_opus":0.01928097734099579,"score_gpt":0.2581816941355988,"score_spread":0.23890071679460304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892205602","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.23442672,0.004518697,0.2633651,0.029994875,0.0030337528,0.00022352056,0.0005263219,0.0037084825,0.4602026],"genre_scores_gemma":[0.94922525,0.0007363955,0.009674176,0.0021391697,0.00066341297,0.000046667516,0.00009343687,0.00034934276,0.03707205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995435,0.0033676901,0.00033726494,0.00061201013,0.0041414453,0.001587226],"domain_scores_gemma":[0.9676272,0.0171965,0.0017413808,0.010469904,0.0022463228,0.0007187026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068607912,0.00058104156,0.00079801097,0.001542631,0.0032097888,0.006456772,0.0020667769,0.005227205,0.013550231],"category_scores_gemma":[0.040307757,0.00079679216,0.0009782088,0.0016661001,0.0048021856,0.009440796,0.0053482633,0.00820478,0.0052925735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008303014,0.00025013235,0.0034677798,0.00019097331,0.00006656441,0.0007451292,0.0013445105,0.02114974,0.0049084635,0.6796033,0.04752757,0.23991562],"study_design_scores_gemma":[0.00010777147,0.00019439643,0.001430974,0.0002637722,0.00011850691,0.0017682216,0.0011735099,0.15323228,0.019259917,0.73075277,0.09157801,0.00011982552],"about_ca_topic_score_codex":0.0013386518,"about_ca_topic_score_gemma":0.0011864258,"teacher_disagreement_score":0.013550231,"about_ca_system_score_codex":0.0021238916,"about_ca_system_score_gemma":0.0017630031,"threshold_uncertainty_score":0.045329988},"labels":[],"label_agreement":null},{"id":"W2892260459","doi":"10.1007/978-3-030-27520-4_15","title":"Improved Programming-Language Independent MapReduce on Shared-Memory Systems","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Programming paradigm; Programming language; Benchmark (surveying); Programming domain; Parallel computing; Reactive programming; Context (archaeology); Inductive programming; Theoretical computer science","score_opus":0.01058475198579325,"score_gpt":0.22906090895174747,"score_spread":0.2184761569659542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892260459","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.075234465,0.0012234554,0.869747,0.00066228176,0.0008706904,0.00014119012,0.00045867576,0.020582426,0.031079745],"genre_scores_gemma":[0.44493,0.00054711854,0.5187255,0.00027736125,0.00033561085,0.00018051702,0.0013745484,0.003153154,0.030476132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915946,0.00014313277,0.000039347215,0.00010948071,0.00038092557,0.000167769],"domain_scores_gemma":[0.9989342,0.00019622578,0.00002252772,0.00046621021,0.0003115963,0.00006916985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004665916,0.0008962742,0.00087687484,0.0005234822,0.0009124042,0.0011860293,0.0025375965,0.00041748228,0.005688849],"category_scores_gemma":[0.0016388851,0.00048830354,0.00078926707,0.001104312,0.0004431967,0.0022550721,0.0019028317,0.0017499552,0.0020569565],"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.0012264136,0.0007234547,0.0015040649,0.000586645,0.00022201172,0.00030213583,0.0004544112,0.13993856,0.09383517,0.080891274,0.075973816,0.60434204],"study_design_scores_gemma":[0.00019633633,0.00026074838,0.0014914575,0.000032938886,0.00010708493,0.00018466251,0.00016803405,0.8373783,0.05376381,0.06437452,0.04196364,0.00007845073],"about_ca_topic_score_codex":0.004356349,"about_ca_topic_score_gemma":0.0073329937,"teacher_disagreement_score":0.005688849,"about_ca_system_score_codex":0.0007256109,"about_ca_system_score_gemma":0.0014198263,"threshold_uncertainty_score":0.019031107},"labels":[],"label_agreement":null},{"id":"W2892280284","doi":"10.1007/978-3-319-99927-2_10","title":"Conformance Testing and Inference of Embedded Components","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Programming language; Conformance testing; Inference; Software engineering; Artificial intelligence; Operating system; Standardization","score_opus":0.025218782383904632,"score_gpt":0.2671131487032797,"score_spread":0.24189436631937505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892280284","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.020409396,0.00025082016,0.9750323,0.00020666918,0.000056804605,0.00005817254,0.00013917706,0.0018023171,0.002044331],"genre_scores_gemma":[0.46398392,0.00031448342,0.5280586,0.00026151948,0.00018671587,0.00017770329,0.0013476853,0.0010399382,0.004629463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898734,0.0034235246,0.00062246434,0.0023884673,0.0030978858,0.0005942157],"domain_scores_gemma":[0.9521662,0.037421964,0.0013623958,0.006227692,0.0024607182,0.00036096625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058218995,0.0014542955,0.001524247,0.0025620537,0.00076233933,0.0021061131,0.0059235226,0.0025042456,0.005596805],"category_scores_gemma":[0.05176859,0.0013547332,0.0037721328,0.001713191,0.0034664432,0.0067056576,0.003772287,0.004550425,0.0011745217],"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.00097257015,0.00034178898,0.008673286,0.00078800844,0.0004371664,0.00088820234,0.0007975649,0.23680319,0.012644757,0.30989903,0.0058104703,0.42194387],"study_design_scores_gemma":[0.000032344797,0.00006788181,0.0006614793,0.00007577199,0.00007207811,0.0001679402,0.00005830432,0.50786185,0.007119994,0.48221937,0.0016393141,0.000023643906],"about_ca_topic_score_codex":0.0022026687,"about_ca_topic_score_gemma":0.0023549967,"teacher_disagreement_score":0.0059235226,"about_ca_system_score_codex":0.0010654452,"about_ca_system_score_gemma":0.0012524733,"threshold_uncertainty_score":0.030789495},"labels":[],"label_agreement":null},{"id":"W2892378903","doi":"10.1007/978-3-030-00889-5_6","title":"TreeNet: Multi-loss Deep Learning Network to Predict Branch Direction for Extracting 3D Anatomical Trees","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Computer science; Leverage (statistics); Artificial intelligence; Deep learning; Tree (set theory); Computation; Pattern recognition (psychology); Computer vision; Algorithm; Mathematics","score_opus":0.02019455017194562,"score_gpt":0.2937288437028671,"score_spread":0.2735342935309215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892378903","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.020358909,0.0015886048,0.95360494,0.00046501408,0.00034903307,0.00014822438,0.0026257415,0.016288005,0.004571505],"genre_scores_gemma":[0.16546656,0.0016044334,0.79662025,0.00065911567,0.0001713481,0.0002942449,0.009803287,0.0015502047,0.023830539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997687,0.000020589914,0.000012530933,0.00008263029,0.00008027698,0.000035303772],"domain_scores_gemma":[0.99973136,0.000066265995,0.00002565314,0.000044079236,0.00010367303,0.000029021674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005442343,0.0015876611,0.000885483,0.0010515663,0.00042421056,0.0011249058,0.0021144382,0.0018205642,0.0068821185],"category_scores_gemma":[0.0009625614,0.0008833888,0.0009644378,0.0009958451,0.00034999906,0.0015051399,0.0010867505,0.0021624074,0.0039328695],"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.00022896488,0.00018719712,0.0012727183,0.00022793874,0.00012500914,0.00015880153,0.00006446031,0.13782597,0.018879399,0.00543472,0.053039584,0.78255534],"study_design_scores_gemma":[0.000014022205,0.00005107861,0.00035177788,0.000039196286,0.000028078117,0.00007706221,0.000012956269,0.9796901,0.009301433,0.005054126,0.005362929,0.000017276729],"about_ca_topic_score_codex":0.0096392045,"about_ca_topic_score_gemma":0.022638403,"teacher_disagreement_score":0.0096392045,"about_ca_system_score_codex":0.0008467016,"about_ca_system_score_gemma":0.0011624199,"threshold_uncertainty_score":0.02302301},"labels":[],"label_agreement":null},{"id":"W2892655831","doi":"10.1007/978-3-662-58039-4_6","title":"A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor","funders":"","keywords":"Computer science; Chordal graph; Distance matrix; Algorithm; Point (geometry); Matrix (chemical analysis); Embedding; Plane (geometry); Theoretical computer science; Graph; Mathematics; Artificial intelligence; Geometry","score_opus":0.0329702169910604,"score_gpt":0.28323056348933356,"score_spread":0.25026034649827317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892655831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012898117,0.00010907,0.9959364,0.000066772736,0.0000476662,0.000034390025,0.00004181617,0.0003031358,0.0021709818],"genre_scores_gemma":[0.037216593,0.00036954833,0.9517082,0.00010214641,0.00015341789,0.00022405905,0.0002965527,0.000409837,0.00951965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981158,0.0005044664,0.00009300418,0.00030760898,0.000845147,0.00013401813],"domain_scores_gemma":[0.99746394,0.0012916013,0.0001256768,0.0005101015,0.00047182926,0.00013688862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128575,0.0017216301,0.0016487091,0.0012589385,0.0008054686,0.0018936647,0.0035841048,0.0015734229,0.015944617],"category_scores_gemma":[0.006258424,0.001012739,0.0014108092,0.0019764465,0.0013835542,0.002626395,0.0041850153,0.0048212283,0.00616474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023755788,0.00028669738,0.0002968876,0.00035651153,0.00006511687,0.00009735577,0.00031553887,0.27022177,0.008940612,0.23987918,0.022292065,0.45701075],"study_design_scores_gemma":[0.000030505706,0.00009926424,0.00009049988,0.000029704928,0.000012105263,0.00008956563,0.00005479435,0.8665648,0.0026952843,0.12032694,0.009978018,0.00002854157],"about_ca_topic_score_codex":0.0031574683,"about_ca_topic_score_gemma":0.0038206216,"teacher_disagreement_score":0.015944617,"about_ca_system_score_codex":0.0010752579,"about_ca_system_score_gemma":0.0013104136,"threshold_uncertainty_score":0.053340077},"labels":[],"label_agreement":null},{"id":"W2892699522","doi":"10.1007/978-3-030-01042-3_10","title":"Textual User Requirements Notation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Notation; Computer science; Programming language; Metamodeling; Software engineering; Scalability; Database","score_opus":0.022777752537592434,"score_gpt":0.26219250626449975,"score_spread":0.23941475372690732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892699522","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.0018522525,0.0015838436,0.75685006,0.0025517219,0.0012596488,0.000969757,0.010077825,0.009442188,0.21541274],"genre_scores_gemma":[0.040621314,0.004197975,0.7609683,0.0033511976,0.00067992735,0.0031119653,0.030679781,0.0054061553,0.1509834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936,0.0026142206,0.0011021945,0.000621861,0.0018076256,0.00025415275],"domain_scores_gemma":[0.98954135,0.0045474186,0.0006371565,0.0019835606,0.0030451715,0.00024543054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00593719,0.0019310742,0.00089531916,0.0031531684,0.0011276314,0.006470668,0.0031224964,0.0026954557,0.07394522],"category_scores_gemma":[0.01364012,0.0009096551,0.001220031,0.003305032,0.0012795755,0.0057772435,0.0029910794,0.0033860048,0.042130332],"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.00009539844,0.000072202245,0.00014401012,0.00094470184,0.00001660197,0.00045005034,0.0011265292,0.0036308412,0.004737183,0.70333564,0.17058231,0.114864536],"study_design_scores_gemma":[0.000013672523,0.000022530703,0.000043651627,0.00022545416,0.0000069406033,0.00044461736,0.000103942926,0.0030936613,0.0014809826,0.035288,0.9592546,0.00002187688],"about_ca_topic_score_codex":0.0021591964,"about_ca_topic_score_gemma":0.0022477864,"teacher_disagreement_score":0.07394522,"about_ca_system_score_codex":0.002080621,"about_ca_system_score_gemma":0.0025621073,"threshold_uncertainty_score":0.24737144},"labels":[],"label_agreement":null},{"id":"W2893079051","doi":"10.1007/978-3-030-00847-5_34","title":"Renormalization of NoSQL Database Schemas","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NoSQL; Computer science; Database; Information retrieval; Scalability","score_opus":0.016965166162700114,"score_gpt":0.24056183789747787,"score_spread":0.22359667173477776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893079051","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.04886652,0.0010071826,0.8764809,0.0018098331,0.00058989116,0.00018166975,0.00042688058,0.0039435164,0.066693604],"genre_scores_gemma":[0.5091355,0.0013583775,0.43440732,0.0009807054,0.0005701847,0.0004336738,0.0016534724,0.0032443919,0.048216365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977696,0.0005396792,0.0002280826,0.00039174588,0.00090049754,0.00017035744],"domain_scores_gemma":[0.99290013,0.002059978,0.0002850231,0.0036400587,0.0009436341,0.00017124909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027434793,0.0005783458,0.00078516523,0.0012919996,0.0011687118,0.0029248567,0.0020072488,0.0008580773,0.011973609],"category_scores_gemma":[0.014015423,0.0010212604,0.0013647388,0.0016541375,0.0018256728,0.009932207,0.002870334,0.0027108777,0.0027457308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042773332,0.000042619093,0.00028327596,0.00007261418,0.00001586358,0.000088152214,0.00029132087,0.0028162787,0.0034592075,0.9635151,0.0035436084,0.025829334],"study_design_scores_gemma":[0.000026729589,0.000020846785,0.00033339972,0.0000555769,0.000024184908,0.0002263455,0.00013975416,0.046445977,0.0060941745,0.9109516,0.035651512,0.00002998818],"about_ca_topic_score_codex":0.0011699393,"about_ca_topic_score_gemma":0.00088390324,"teacher_disagreement_score":0.011973609,"about_ca_system_score_codex":0.0014198499,"about_ca_system_score_gemma":0.00084356416,"threshold_uncertainty_score":0.04005575},"labels":[],"label_agreement":null},{"id":"W2893154303","doi":"10.1007/978-3-030-01042-3_9","title":"An Arithmetic Semantics for GRL Goal Models with Function Generation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Ottawa","funders":"","keywords":"Computer science; Programming language; Python (programming language); Model transformation; Software engineering; Artificial intelligence; Consistency (knowledge bases)","score_opus":0.05023786877143464,"score_gpt":0.2799810032980277,"score_spread":0.22974313452659306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893154303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005635951,0.00021639584,0.95702004,0.00075032224,0.00014740149,0.00009640495,0.00031909425,0.0025418357,0.033272468],"genre_scores_gemma":[0.29779238,0.00040609256,0.67852527,0.00064635905,0.00026155845,0.00032742767,0.0010356776,0.001278476,0.019726817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817014,0.00047461793,0.00019270969,0.0003462429,0.0005943614,0.00022191308],"domain_scores_gemma":[0.99875844,0.00047597496,0.00008362336,0.00033064443,0.00029756053,0.000053856667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001783487,0.0012348731,0.0007125893,0.0015049824,0.0011152448,0.004386666,0.002686098,0.0015236114,0.01040578],"category_scores_gemma":[0.003447077,0.00087317254,0.001994873,0.0014668104,0.0034351156,0.007593286,0.00359873,0.0038363123,0.0034623179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021042399,0.000014772695,0.000050017727,0.00007300364,0.0000057483394,0.00005117296,0.00020521645,0.0029848726,0.00088859745,0.97697234,0.0016898937,0.017043347],"study_design_scores_gemma":[0.00002508599,0.000020643163,0.000041355863,0.000049864713,0.000023528379,0.00008050247,0.00008578643,0.026692595,0.0022521028,0.9469523,0.02375371,0.000022624003],"about_ca_topic_score_codex":0.0019776395,"about_ca_topic_score_gemma":0.002065082,"teacher_disagreement_score":0.01040578,"about_ca_system_score_codex":0.002086421,"about_ca_system_score_gemma":0.001281546,"threshold_uncertainty_score":0.03481078},"labels":[],"label_agreement":null},{"id":"W2893797465","doi":"10.1007/978-3-030-16667-0_1","title":"Deep Learning Concepts for Evolutionary Art","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Genetic programming; Deep learning; Classifier (UML); Pattern recognition (psychology); Evolutionary algorithm; Feature (linguistics); Contextual image classification; Heuristic; Machine learning; Image (mathematics)","score_opus":0.013516434680253545,"score_gpt":0.25900320158066004,"score_spread":0.2454867669004065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893797465","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.008062087,0.017371766,0.79837674,0.003201592,0.0012604415,0.00003561406,0.00019633911,0.00033852947,0.1711569],"genre_scores_gemma":[0.34593508,0.021077702,0.39180362,0.0015156188,0.002255761,0.00022426025,0.0004332269,0.00050378614,0.23625092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999038,0.000021107373,0.00000629197,0.000021739565,0.000037668426,0.000009391519],"domain_scores_gemma":[0.99984634,0.00008049819,0.000011126737,0.000022612421,0.000026009739,0.000013455163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030739093,0.00050688954,0.00036680576,0.00064894697,0.0003425146,0.0013290497,0.00069581746,0.0008036611,0.011307504],"category_scores_gemma":[0.0009798482,0.0002344613,0.00036420813,0.00082942675,0.0013893864,0.0024803008,0.0010391913,0.0023039181,0.0014619748],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004404501,0.000007748133,0.000044018157,0.00008779271,0.0000060741836,0.0000140317425,0.000059271613,0.005265172,0.00054045056,0.9116019,0.0053569456,0.07701228],"study_design_scores_gemma":[0.0000025698646,0.000009148042,0.0000971429,0.000054651693,0.0000048978877,0.00004993621,0.000016512033,0.029428374,0.0003763031,0.9215095,0.048444774,0.0000061145115],"about_ca_topic_score_codex":0.0006852771,"about_ca_topic_score_gemma":0.0011586987,"teacher_disagreement_score":0.011307504,"about_ca_system_score_codex":0.0009561153,"about_ca_system_score_gemma":0.00032782424,"threshold_uncertainty_score":0.037827373},"labels":[],"label_agreement":null},{"id":"W2894122431","doi":"10.1007/978-3-030-01042-3_12","title":"Towards Online Collaborative Multi-view Modelling","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Trent University; McGill University","funders":"","keywords":"Computer science; Undo; Metamodeling; Collaborative editing; Exploit; Abstraction; Focus (optics); Scope (computer science); Software engineering; Graphics; Programming language; Human–computer interaction; World Wide Web","score_opus":0.03184326352985707,"score_gpt":0.27423472675251703,"score_spread":0.24239146322265998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894122431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009476628,0.0000518428,0.9964813,0.00006436896,0.000018583041,0.00002497647,0.000056821984,0.0007275406,0.0016269559],"genre_scores_gemma":[0.10235203,0.00037044665,0.88575757,0.00013401975,0.00004394353,0.0002479302,0.0011945183,0.000915775,0.008983767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952407,0.0016457614,0.0002910965,0.00079308875,0.001784625,0.00024466187],"domain_scores_gemma":[0.9928104,0.0028100235,0.000248943,0.0030823713,0.0007577681,0.0002904128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038045377,0.0012344656,0.0016300086,0.0011249562,0.0011091379,0.0058846213,0.004498999,0.00346307,0.013301934],"category_scores_gemma":[0.012854892,0.0017339529,0.0036960142,0.0017628219,0.0011135929,0.00990241,0.010074325,0.0043401932,0.0056017833],"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.00039767227,0.00046624563,0.0017298586,0.000506546,0.000362789,0.0008330861,0.0025049683,0.29802904,0.012910669,0.2923256,0.016217392,0.37371618],"study_design_scores_gemma":[0.000023788749,0.000037019083,0.00012912921,0.00005938411,0.00003595411,0.00015473267,0.0001665005,0.86179394,0.003952826,0.11403341,0.019583913,0.000029523699],"about_ca_topic_score_codex":0.004254098,"about_ca_topic_score_gemma":0.0056413123,"teacher_disagreement_score":0.013301934,"about_ca_system_score_codex":0.0011110901,"about_ca_system_score_gemma":0.0013235487,"threshold_uncertainty_score":0.044499397},"labels":[],"label_agreement":null},{"id":"W2894136595","doi":"10.1007/978-3-030-01421-6_17","title":"Computerized Counting-Based System for Acute Lymphoblastic Leukemia Detection in Microscopic Blood Images","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Concordia University","funders":"","keywords":"Computer science; Lymphoblastic Leukemia; Artificial intelligence; Blood smear; Lymphoblast; Blood film; Abnormality; Pattern recognition (psychology); Complete blood count; Computer vision; Pathology; Leukemia; Medicine; Immunology","score_opus":0.007792190109210483,"score_gpt":0.23329446810499266,"score_spread":0.22550227799578218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894136595","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.11702187,0.0045181657,0.8182294,0.0006760145,0.0007433182,0.0008001364,0.0045938552,0.03923589,0.014181357],"genre_scores_gemma":[0.29595715,0.0030468493,0.6687595,0.0007970825,0.00036717035,0.0007113481,0.005144342,0.0008047634,0.024411747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.000033386863,0.000023819748,0.000085813976,0.00011959443,0.0000249852],"domain_scores_gemma":[0.9994393,0.00014691672,0.000033858327,0.00006106763,0.000279959,0.000038894355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284217,0.00061071076,0.0006757743,0.0020212904,0.00036571934,0.00086635776,0.0015225535,0.0008286826,0.010443998],"category_scores_gemma":[0.0009682439,0.00035729972,0.0004311693,0.0013441069,0.00015668596,0.00058057456,0.0005105951,0.0004169412,0.004564855],"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.00089351303,0.0001918677,0.008055665,0.00037755186,0.0000860736,0.00038691497,0.000086141845,0.0019699503,0.1475425,0.0010548433,0.025793085,0.813562],"study_design_scores_gemma":[0.00024212303,0.0010053413,0.049891315,0.00023117401,0.0007582378,0.006249625,0.00022336925,0.4231557,0.44437942,0.0029513,0.070602715,0.00030975716],"about_ca_topic_score_codex":0.0019392199,"about_ca_topic_score_gemma":0.0030696806,"teacher_disagreement_score":0.010443998,"about_ca_system_score_codex":0.00049535197,"about_ca_system_score_gemma":0.00070649915,"threshold_uncertainty_score":0.034938633},"labels":[],"label_agreement":null},{"id":"W2894218079","doi":"10.1007/978-3-030-01042-3_8","title":"Realizability of Service Specifications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Sequence diagram; Computer science; Realizability; Sequence (biology); Unified Modeling Language; Distributed computing; Theoretical computer science; FIFO (computing and electronics); Programming language","score_opus":0.07886877681958039,"score_gpt":0.2992884050333874,"score_spread":0.220419628213807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894218079","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.051429573,0.0009889954,0.846057,0.0011066789,0.00017059634,0.000102987346,0.00046793325,0.0009767879,0.098699465],"genre_scores_gemma":[0.83367884,0.0022056794,0.1301017,0.0002597361,0.00030985527,0.0003596119,0.002190463,0.00056553585,0.030328624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974841,0.00066634465,0.00020724737,0.0004200427,0.0009662604,0.00025598516],"domain_scores_gemma":[0.9961228,0.0024054553,0.00022755507,0.0007279901,0.00036744075,0.00014879172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977091,0.00090521836,0.00075739034,0.0014297217,0.0011296193,0.0042127203,0.0011419925,0.0013108673,0.00649422],"category_scores_gemma":[0.006209025,0.0012336834,0.0018253704,0.001590857,0.0032379401,0.005438981,0.0022455938,0.004193989,0.0012050857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000287707,0.000011552721,0.00011273793,0.00005161159,0.000009534364,0.00006443935,0.00025247366,0.0024989448,0.0012421408,0.98534554,0.0005569182,0.009825397],"study_design_scores_gemma":[0.000013860164,0.00001796069,0.00010415089,0.000030169707,0.000015602718,0.000064517095,0.00006784606,0.0080502415,0.0014630088,0.98169625,0.008466736,0.0000097517595],"about_ca_topic_score_codex":0.0021278083,"about_ca_topic_score_gemma":0.0015903929,"teacher_disagreement_score":0.00649422,"about_ca_system_score_codex":0.0019310676,"about_ca_system_score_gemma":0.0014669438,"threshold_uncertainty_score":0.021725357},"labels":[],"label_agreement":null},{"id":"W2894897083","doi":"10.1007/978-3-030-01219-9_4","title":"Coded Two-Bucket Cameras for Computer Vision","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Computer graphics (images)","score_opus":0.013584637172259391,"score_gpt":0.2742658791457199,"score_spread":0.26068124197346054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894897083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027320457,0.008486328,0.9423775,0.00034260278,0.00045693133,0.00008761709,0.00029960828,0.0013907877,0.043826666],"genre_scores_gemma":[0.076287724,0.012408057,0.7900329,0.00050118094,0.00032025576,0.00020966421,0.0010962668,0.00059461733,0.11854937],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997384,0.000027685053,0.00000812464,0.000050545448,0.00015045093,0.000024822757],"domain_scores_gemma":[0.99980515,0.000055803346,0.000010923633,0.000045280394,0.00006983904,0.000013013707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021293058,0.0007222267,0.00038560072,0.00086568814,0.00023558598,0.0011753355,0.001266705,0.00092261436,0.031159908],"category_scores_gemma":[0.0005586612,0.00042698192,0.00023259522,0.0014304018,0.0004888361,0.0016750578,0.0011260284,0.0014257235,0.008521655],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014340399,0.000044532007,0.00007358104,0.0006287208,0.000024703839,0.000056079563,0.000076213524,0.0045420136,0.079911955,0.089376636,0.049278356,0.7758438],"study_design_scores_gemma":[0.00007910547,0.00015645997,0.00065483677,0.00043206348,0.000040434417,0.0012120114,0.00010527211,0.15399328,0.15818785,0.08109211,0.6039369,0.00010959394],"about_ca_topic_score_codex":0.00072472706,"about_ca_topic_score_gemma":0.0016398365,"teacher_disagreement_score":0.031159908,"about_ca_system_score_codex":0.00065080257,"about_ca_system_score_gemma":0.0004999366,"threshold_uncertainty_score":0.1042403},"labels":[],"label_agreement":null},{"id":"W2894929382","doi":"10.1007/978-3-030-02149-8_9","title":"A Modal and Relevance Logic for Qualitative Spatial Reasoning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Dynamic logic (digital electronics); Multimodal logic; Modal logic; Computer science; Normal modal logic; Axiom; Algebra over a field; Mathematics; Theoretical computer science; Description logic; Modal; Pure mathematics","score_opus":0.02498503563160197,"score_gpt":0.2961177508704074,"score_spread":0.27113271523880544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894929382","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.002769107,0.0013022885,0.96023244,0.0013986601,0.00017587737,0.000092945345,0.00030326494,0.0005293639,0.033196088],"genre_scores_gemma":[0.21116444,0.0017988763,0.76112413,0.0007853106,0.0006137102,0.00030566799,0.0006754671,0.00026777206,0.02326457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998483,0.0004928095,0.00013614623,0.0002581104,0.00053082354,0.000099046316],"domain_scores_gemma":[0.9986546,0.0007158162,0.000057614972,0.0002278347,0.00026599894,0.00007816834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024643207,0.0006455751,0.0007816982,0.0020073336,0.0015146984,0.0040526306,0.002336205,0.0014087228,0.011303464],"category_scores_gemma":[0.005039842,0.0008851084,0.0020087843,0.0024005852,0.0039810976,0.006933334,0.0033543825,0.0035006662,0.0018142194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019561885,0.00001899007,0.000037925864,0.00012474765,0.0000130948465,0.00004829932,0.00019427182,0.002499808,0.0008963334,0.968122,0.003429234,0.024595661],"study_design_scores_gemma":[0.000007894883,0.000007311866,0.000050791885,0.00003090415,0.000013827043,0.000045145476,0.00004078017,0.013016781,0.00049747084,0.9731609,0.013116038,0.000012281817],"about_ca_topic_score_codex":0.003111828,"about_ca_topic_score_gemma":0.0030835075,"teacher_disagreement_score":0.011303464,"about_ca_system_score_codex":0.0023069475,"about_ca_system_score_gemma":0.0012197637,"threshold_uncertainty_score":0.037813842},"labels":[],"label_agreement":null},{"id":"W2894995323","doi":"10.1007/978-3-030-01716-3_32","title":"Coherence-Based Automated Essay Scoring Using Self-attention","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Computer science; Feature engineering; Coherence (philosophical gambling strategy); Artificial intelligence; Representation (politics); Feature (linguistics); Machine learning; Natural language processing; Deep learning; Linguistics; Statistics","score_opus":0.028839341247385297,"score_gpt":0.26396261349139655,"score_spread":0.23512327224401125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894995323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20789474,0.0016605032,0.74527764,0.0004697706,0.00081536913,0.00068067183,0.0022644952,0.026040616,0.014896271],"genre_scores_gemma":[0.72882193,0.0002586738,0.24685168,0.00012908214,0.0005878033,0.00041620605,0.005447138,0.0008931307,0.016594268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533147,0.0016571367,0.0003463577,0.0010277461,0.0012850397,0.00035226595],"domain_scores_gemma":[0.983085,0.007687558,0.0010682897,0.0018468216,0.00561134,0.0007010039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375505,0.0011363112,0.0014263422,0.003487217,0.00073271844,0.0020098018,0.0014080958,0.0009285229,0.007987394],"category_scores_gemma":[0.016135672,0.00038841087,0.0005152752,0.0020213644,0.0002775447,0.002207391,0.0026718762,0.0011232429,0.006341803],"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.0005701786,0.0003812031,0.009994492,0.00021895474,0.00015407919,0.00008090641,0.00029289885,0.0045147217,0.020300766,0.000994231,0.020515248,0.9419823],"study_design_scores_gemma":[0.00018799542,0.00077230873,0.034948085,0.00006243277,0.0002425137,0.0003221968,0.00059217133,0.9125438,0.029886154,0.008741661,0.011577121,0.00012363977],"about_ca_topic_score_codex":0.001561701,"about_ca_topic_score_gemma":0.0035917931,"teacher_disagreement_score":0.007987394,"about_ca_system_score_codex":0.0003650643,"about_ca_system_score_gemma":0.0007593195,"threshold_uncertainty_score":0.026720464},"labels":[],"label_agreement":null},{"id":"W2895064504","doi":"10.1007/978-3-030-01219-9_44","title":"Hierarchical Relational Networks for Group Activity Recognition and Retrieval","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":144,"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":"Agence Nationale de la Recherche","keywords":"Statistical relational learning; Computer science; Artificial intelligence; Autoencoder; Feature learning; Graph; Unsupervised learning; Representation (politics); Relational model; Pattern recognition (psychology); Machine learning; Relational database; Deep learning; Natural language processing; Theoretical computer science; Information retrieval","score_opus":0.0377158278065307,"score_gpt":0.2543326920437315,"score_spread":0.21661686423720078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895064504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072489306,0.002451585,0.9835956,0.00025684267,0.00007839767,0.00006729258,0.0011318442,0.0028508885,0.0023185431],"genre_scores_gemma":[0.3207746,0.0032307436,0.6534245,0.00026362768,0.00025174976,0.00032450826,0.0062999455,0.00043590317,0.014994449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993843,0.0001294569,0.0000506583,0.00020779234,0.00015808956,0.000069702946],"domain_scores_gemma":[0.9990201,0.00043635353,0.00006938088,0.00031113072,0.0001309409,0.000032078933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008254439,0.00074707303,0.0011904524,0.001292711,0.00051327917,0.0016211439,0.002546655,0.0010223483,0.0077063497],"category_scores_gemma":[0.0029112732,0.00047961166,0.0007509016,0.0019675556,0.00052383385,0.003023323,0.0012375236,0.0011618919,0.0033559117],"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.00024422974,0.00016167497,0.00094222015,0.0003098482,0.00014127667,0.00009366564,0.00018006207,0.15386328,0.008643364,0.076929145,0.022720959,0.7357703],"study_design_scores_gemma":[0.000010638994,0.000030133457,0.00041153101,0.000024919173,0.0000378317,0.000051396775,0.00004902444,0.91562486,0.0028838804,0.07497018,0.0058914023,0.000014298581],"about_ca_topic_score_codex":0.013070379,"about_ca_topic_score_gemma":0.01573736,"teacher_disagreement_score":0.013070379,"about_ca_system_score_codex":0.0016043023,"about_ca_system_score_gemma":0.00078245695,"threshold_uncertainty_score":0.025988579},"labels":[],"label_agreement":null},{"id":"W2895076274","doi":"10.1007/978-3-030-01267-0_32","title":"Revisiting Autofocus for Smartphone Cameras","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Autofocus; Computer science; Computer vision; Artificial intelligence; Computer graphics (images); Focus (optics)","score_opus":0.014088788809765199,"score_gpt":0.2528627446485767,"score_spread":0.23877395583881153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895076274","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.018181676,0.0553167,0.8500267,0.0011184119,0.0015318372,0.00012740564,0.00027155335,0.0030732974,0.070352435],"genre_scores_gemma":[0.19171423,0.04994754,0.6459376,0.0009951331,0.0013337418,0.00011742721,0.00065419043,0.0015204785,0.107779585],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957067,0.000040231917,0.000017663971,0.00011097545,0.0002170139,0.000043454802],"domain_scores_gemma":[0.99948126,0.00018115083,0.000019933233,0.00011675415,0.00018139492,0.000019590314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034993613,0.0009828681,0.000504828,0.00059409905,0.00047592848,0.0013208367,0.0008430419,0.00088104943,0.015171391],"category_scores_gemma":[0.0010522156,0.0004903759,0.0005764812,0.0006303516,0.00056138483,0.002063736,0.001068319,0.0010889973,0.0050271903],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011114031,0.000036859306,0.0005510884,0.0010421661,0.00003947719,0.00028207255,0.00026649176,0.0055195396,0.08125136,0.042670395,0.01630305,0.8519264],"study_design_scores_gemma":[0.000039037717,0.00035419807,0.0028172126,0.00090051984,0.000119870914,0.003620073,0.0003699072,0.10298823,0.13662514,0.041305263,0.7107498,0.00011075575],"about_ca_topic_score_codex":0.0066989404,"about_ca_topic_score_gemma":0.010267652,"teacher_disagreement_score":0.015171391,"about_ca_system_score_codex":0.0007697498,"about_ca_system_score_gemma":0.00066115847,"threshold_uncertainty_score":0.050753295},"labels":[],"label_agreement":null},{"id":"W2895195227","doi":"10.1007/978-3-030-02149-8_22","title":"Calculational Relation-Algebraic Proofs in the Teaching Tool CalcCheck","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"McMaster University","funders":"","keywords":"Mathematical proof; Rewriting; Computer science; Relation (database); Associative property; Algebraic number; Algebra over a field; Proof assistant; Programming language; Calculus (dental); Mathematics; Pure mathematics","score_opus":0.018319600958911872,"score_gpt":0.25453226405161905,"score_spread":0.23621266309270716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895195227","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.009418768,0.001402251,0.888499,0.0017002899,0.00033136737,0.000092379654,0.00021003738,0.007599031,0.09074688],"genre_scores_gemma":[0.32781264,0.0019126681,0.6067322,0.00054973346,0.00029996014,0.00018737632,0.0005739082,0.004295137,0.05763625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798274,0.00071557786,0.00011831574,0.00028058703,0.0007658525,0.00013695002],"domain_scores_gemma":[0.99434847,0.0044118133,0.000109825676,0.00069075054,0.00031305166,0.00012598086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021364794,0.00073828927,0.0006792766,0.0012734133,0.0014384106,0.004731552,0.0025079802,0.0011668392,0.02556874],"category_scores_gemma":[0.010783311,0.0010206078,0.0009215609,0.0018439735,0.0028744082,0.008607365,0.0037460579,0.004512174,0.007527038],"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.000048382495,0.000044190776,0.000154581,0.00020256522,0.000009414162,0.000062620675,0.00061832485,0.0028834702,0.0014526346,0.8792378,0.009038063,0.10624802],"study_design_scores_gemma":[0.000036260113,0.000021931335,0.0001250656,0.00018082227,0.00001682862,0.00027309128,0.00015754324,0.024267849,0.008086116,0.8507735,0.1160273,0.000033746415],"about_ca_topic_score_codex":0.0010402075,"about_ca_topic_score_gemma":0.0017564804,"teacher_disagreement_score":0.02556874,"about_ca_system_score_codex":0.0020377783,"about_ca_system_score_gemma":0.0025231696,"threshold_uncertainty_score":0.085536},"labels":[],"label_agreement":null},{"id":"W2895195933","doi":"10.1007/978-3-030-18305-9_66","title":"Generating Accurate Virtual Examples for Lifelong Machine Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Queen's University","funders":"","keywords":"Computer science; Restricted Boltzmann machine; Artificial intelligence; Task (project management); Machine learning; Set (abstract data type); Lifelong learning; Boltzmann machine; Training set; Artificial neural network","score_opus":0.03258662774635546,"score_gpt":0.263475812019237,"score_spread":0.23088918427288152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895195933","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.026521953,0.00061737763,0.964197,0.00017125181,0.00016910372,0.00012468593,0.0002506,0.0042917673,0.003656345],"genre_scores_gemma":[0.30884463,0.00038159543,0.6742837,0.00021375374,0.00009789608,0.000274032,0.0023082674,0.0007828117,0.012813341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990706,0.00031796392,0.000045788172,0.00023713589,0.0002539331,0.00007471738],"domain_scores_gemma":[0.99737227,0.0011405097,0.000079244215,0.00083354575,0.00045398995,0.00012042587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012621658,0.0008649221,0.0011159201,0.00080507575,0.0005650142,0.0011106821,0.0027998856,0.0017644966,0.011372448],"category_scores_gemma":[0.005827574,0.0007043801,0.0005709099,0.0006715619,0.0005878525,0.0027654646,0.0031527246,0.0018392903,0.0048310854],"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.0003585278,0.00033528692,0.0010791698,0.00025584953,0.0000751566,0.0003236111,0.00019753764,0.13871141,0.015913531,0.012736505,0.02284671,0.80716676],"study_design_scores_gemma":[0.000013895515,0.000079845515,0.00016820413,0.000023720077,0.000011381169,0.00014254106,0.000041471212,0.9704878,0.009847313,0.014729066,0.004443619,0.000011270029],"about_ca_topic_score_codex":0.0010114994,"about_ca_topic_score_gemma":0.0021231328,"teacher_disagreement_score":0.011372448,"about_ca_system_score_codex":0.00047768123,"about_ca_system_score_gemma":0.00048925396,"threshold_uncertainty_score":0.03804463},"labels":[],"label_agreement":null},{"id":"W2895206473","doi":"10.1007/978-3-030-01851-1_28","title":"SCUT-DS: Learning from Multi-class Imbalanced Canadian Weather Data","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Oversampling; Computer science; Class (philosophy); Data stream; Machine learning; Binary number; Data stream mining; Artificial intelligence; Binary classification; Data mining; Support vector machine; Mathematics","score_opus":0.04505112479481433,"score_gpt":0.2753153436189509,"score_spread":0.23026421882413656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895206473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079880305,0.0073989592,0.7729045,0.0027076735,0.0023257602,0.00075543765,0.04601715,0.07268209,0.01532809],"genre_scores_gemma":[0.28865957,0.0029371318,0.54908556,0.0011824608,0.0006348132,0.00063694146,0.121723555,0.0034516272,0.031688347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989434,0.00012370148,0.000044500564,0.0002587945,0.00046497257,0.00016456224],"domain_scores_gemma":[0.9985134,0.0004004988,0.000051421117,0.00036900255,0.0005398158,0.0001258479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021037783,0.0024206005,0.0012973864,0.0027715995,0.0013452331,0.001945492,0.0039340206,0.001209574,0.0052977195],"category_scores_gemma":[0.00671978,0.0007099342,0.0013214571,0.003497014,0.0006855949,0.002206851,0.0022730054,0.0031463471,0.0034489266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029868333,0.00014793668,0.007116377,0.0002730882,0.00028404995,0.00017794999,0.00020369675,0.073882796,0.0032088126,0.0053191856,0.20758954,0.7014978],"study_design_scores_gemma":[0.000084501684,0.000085109066,0.004148773,0.000070063514,0.00009427509,0.00013569453,0.0002677985,0.9050195,0.0071993694,0.018371362,0.064460665,0.000062869905],"about_ca_topic_score_codex":0.23101777,"about_ca_topic_score_gemma":0.34040377,"teacher_disagreement_score":0.76898223,"about_ca_system_score_codex":0.003017268,"about_ca_system_score_gemma":0.006792926,"threshold_uncertainty_score":0.45934618},"labels":[],"label_agreement":null},{"id":"W2895260923","doi":"10.1007/978-3-030-01237-3_25","title":"Constraint-Aware Deep Neural Network Compression","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Deep learning; Artificial neural network; Deep neural networks; Software deployment; Artificial intelligence; Simulated annealing; Compression (physics); Constraint (computer-aided design); Mathematical optimization; Machine learning; Engineering","score_opus":0.019210064656595204,"score_gpt":0.26223441128313996,"score_spread":0.24302434662654476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895260923","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.016144097,0.002322503,0.95268494,0.00077103835,0.00044845717,0.0000865499,0.00073825073,0.0031119864,0.023692256],"genre_scores_gemma":[0.41006657,0.0024714859,0.54314625,0.00070585,0.00045303832,0.00023279128,0.0031484212,0.001416853,0.038358696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997383,0.00003640332,0.000015486808,0.000043272914,0.00013609735,0.000030412808],"domain_scores_gemma":[0.9994134,0.00023841929,0.000028312492,0.0001635313,0.0001347975,0.000021548827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032486234,0.00068734685,0.0006498719,0.00042589003,0.00026923005,0.0008607231,0.001517817,0.00082748284,0.0132679],"category_scores_gemma":[0.002251153,0.0003432509,0.0003625792,0.0011962953,0.00038170707,0.0017688333,0.0012106611,0.0019254329,0.0020478726],"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.00021056697,0.00009201631,0.0002519265,0.00025273723,0.000058006564,0.00016121188,0.000029948027,0.25224376,0.013428208,0.050556276,0.029329568,0.65338576],"study_design_scores_gemma":[0.000015559039,0.0000209978,0.00011236875,0.00002406464,0.000011205397,0.00007848001,0.000007863294,0.96019924,0.007928063,0.025344344,0.0062484564,0.000009386214],"about_ca_topic_score_codex":0.0024663776,"about_ca_topic_score_gemma":0.005864474,"teacher_disagreement_score":0.0132679,"about_ca_system_score_codex":0.0005655419,"about_ca_system_score_gemma":0.00086100487,"threshold_uncertainty_score":0.044385552},"labels":[],"label_agreement":null},{"id":"W2895642264","doi":"10.1007/978-3-030-01424-7_39","title":"Width of Minima Reached by Stochastic Gradient Descent is Influenced by Learning Rate to Batch Size Ratio","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"Institut de Valorisation des Données; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; European Commission","keywords":"Maxima and minima; Stochastic gradient descent; Generalization; Computer science; Range (aeronautics); Convergence (economics); Gradient descent; Artificial neural network; Rate of convergence; Generalization error; Set (abstract data type); Artificial intelligence; Key (lock); Algorithm; Applied mathematics; Mathematics; Mathematical analysis; Materials science","score_opus":0.011149413033879854,"score_gpt":0.24113535986571816,"score_spread":0.22998594683183832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895642264","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.2667659,0.0033647479,0.7090677,0.0016941143,0.0005155245,0.00009544678,0.0005342307,0.0031593256,0.014803032],"genre_scores_gemma":[0.88614786,0.0012422474,0.09972044,0.00038598222,0.00018384447,0.00015831238,0.0005341413,0.0034098434,0.008217331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840814,0.00045310459,0.00011454229,0.00043046635,0.0003397458,0.00025405557],"domain_scores_gemma":[0.96511304,0.027006408,0.0014655374,0.0020949824,0.0028689876,0.001451037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053158044,0.0010168847,0.0014517296,0.0012797865,0.00070342456,0.0025268137,0.0019890082,0.002389651,0.005447706],"category_scores_gemma":[0.05735023,0.0009138711,0.0007234204,0.00083479745,0.0013443391,0.004070258,0.0021306602,0.0034918531,0.0018302875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027234529,0.00043684238,0.010882358,0.00089194695,0.00032799615,0.00055715966,0.0007517507,0.64394367,0.09149129,0.07377293,0.013526715,0.16069382],"study_design_scores_gemma":[0.000037204692,0.00018040299,0.0021865454,0.000080955666,0.000055636512,0.00015845771,0.0000747325,0.95700824,0.014461255,0.024731798,0.0009815915,0.00004316388],"about_ca_topic_score_codex":0.0009720807,"about_ca_topic_score_gemma":0.0011221643,"teacher_disagreement_score":0.005447706,"about_ca_system_score_codex":0.000811473,"about_ca_system_score_gemma":0.0012174185,"threshold_uncertainty_score":0.028113008},"labels":[],"label_agreement":null},{"id":"W2895737021","doi":"10.1007/978-3-030-02227-3_15","title":"Modeling the Effect of Parallel Execution on Multi-site Computation Offloading in Mobile Cloud Computing","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Toronto Metropolitan University","funders":"","keywords":"Cloud computing; Computer science; Computation offloading; Mobile cloud computing; Computation; Distributed computing; Parallel computing; Operating system; Algorithm; Edge computing","score_opus":0.020109629868228448,"score_gpt":0.272470177225929,"score_spread":0.2523605473577005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895737021","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.49587283,0.003425402,0.45205012,0.0020180242,0.000607831,0.00017121622,0.00053616444,0.00077486393,0.044543553],"genre_scores_gemma":[0.9855452,0.00051841565,0.008209015,0.0000782298,0.000065678876,0.000035566954,0.000066211614,0.00009477586,0.0053868988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.000067787296,0.000009399338,0.000056945777,0.000057474237,0.00011755623],"domain_scores_gemma":[0.9991642,0.00054815214,0.00006953497,0.00004554999,0.000107313914,0.000065204746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041303568,0.00076331553,0.0007450886,0.00024044128,0.00047285127,0.0011779409,0.0011067885,0.000987233,0.0030408548],"category_scores_gemma":[0.0019468034,0.00038301985,0.00056891143,0.0005034558,0.00054614607,0.0010741492,0.00057246065,0.0009225862,0.0002965036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043532862,0.000039998013,0.000374092,0.000029488241,0.000010033921,0.000038929713,0.000014271854,0.99126804,0.0012103873,0.004078492,0.0004588004,0.0024339138],"study_design_scores_gemma":[0.0000016914584,0.000004279714,0.000067665336,0.0000012696692,0.0000026261605,0.000003212013,0.000002905958,0.99908626,0.00009989603,0.0006725016,0.000056607503,0.0000011649739],"about_ca_topic_score_codex":0.020681461,"about_ca_topic_score_gemma":0.013281791,"teacher_disagreement_score":0.020681461,"about_ca_system_score_codex":0.0011885387,"about_ca_system_score_gemma":0.0014305892,"threshold_uncertainty_score":0.041122198},"labels":[],"label_agreement":null},{"id":"W2896347987","doi":"10.1007/978-3-030-01264-9_20","title":"A New Large Scale Dynamic Texture Dataset with Application to ConvNet Understanding","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Texture (cosmology); Optical flow; High dynamic range; Artificial intelligence; Exploit; Scale (ratio); Task (project management); Motion (physics); Range (aeronautics); Pattern recognition (psychology); Dynamic range; Computer vision; Data mining; Image (mathematics)","score_opus":0.017387741484302714,"score_gpt":0.2578562260954757,"score_spread":0.24046848461117298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896347987","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24122055,0.0030015556,0.29217204,0.0014221835,0.0018883746,0.0012695461,0.35930997,0.07749621,0.02221958],"genre_scores_gemma":[0.19909792,0.0010332231,0.17935234,0.0004066748,0.00028138154,0.00084698916,0.60122573,0.0038440845,0.013911741],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950814,0.000031002368,0.000028829621,0.0001746156,0.00018715234,0.00007025954],"domain_scores_gemma":[0.99920577,0.00008806746,0.000045174256,0.0003059844,0.00025577514,0.00009936219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043273647,0.0019707717,0.001068087,0.0026967188,0.0007494479,0.0013693437,0.0021162583,0.0012409325,0.009051448],"category_scores_gemma":[0.0017432875,0.0006769287,0.0010650312,0.0031001007,0.0004889682,0.0015878387,0.0016219096,0.0018068091,0.0059128962],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013021792,0.0010951428,0.004391061,0.0007665837,0.0003762942,0.0008018129,0.0001421185,0.03398438,0.076911815,0.002817226,0.3142398,0.5631716],"study_design_scores_gemma":[0.00062630756,0.0007914989,0.032905947,0.00020009649,0.0003092182,0.0021398165,0.00054500235,0.65722823,0.07661725,0.017192267,0.21115458,0.00028979217],"about_ca_topic_score_codex":0.022713454,"about_ca_topic_score_gemma":0.04387142,"teacher_disagreement_score":0.022713454,"about_ca_system_score_codex":0.0007382618,"about_ca_system_score_gemma":0.0012527358,"threshold_uncertainty_score":0.0451625},"labels":[],"label_agreement":null},{"id":"W2896348621","doi":"10.1007/978-3-030-01298-4_2","title":"A Self-representation Model for Robust Clustering of Categorical Sequences","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Categorical variable; Computer science; Pattern recognition (psychology); Artificial intelligence; Pairwise comparison; Representation (politics); CURE data clustering algorithm; Similarity (geometry); Correlation clustering; Noise (video); Data mining; Subspace topology; Machine learning; Image (mathematics)","score_opus":0.05873108898476034,"score_gpt":0.32340882607728344,"score_spread":0.26467773709252307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896348621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051925937,0.00008932473,0.9937156,0.00009866059,0.000025702493,0.000024473598,0.00012060615,0.00038854807,0.0003445414],"genre_scores_gemma":[0.356146,0.00047579227,0.62792283,0.00044816957,0.00027012234,0.00046133026,0.002625607,0.0005757905,0.011074325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978885,0.0006116253,0.00012753173,0.0006913842,0.00048088952,0.00019996602],"domain_scores_gemma":[0.9961766,0.001379515,0.00037992134,0.0010882339,0.0007946101,0.00018111269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027064274,0.0006549809,0.0014914767,0.0019240772,0.0007518224,0.0020153576,0.004383781,0.0026087663,0.0032772273],"category_scores_gemma":[0.008507132,0.0007121093,0.0020297698,0.0025241855,0.0014057531,0.0036227042,0.0027906362,0.0023902773,0.0019518574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034872373,0.00021314075,0.0014579042,0.00019217697,0.00018572976,0.00010560287,0.00034616786,0.51428276,0.0074761496,0.19512792,0.00815564,0.27210802],"study_design_scores_gemma":[0.0000051630022,0.000023049968,0.00010898262,0.0000068416603,0.000009885081,0.000022856462,0.000011282455,0.96954376,0.0004853727,0.029172461,0.00059973204,0.00001064392],"about_ca_topic_score_codex":0.005420919,"about_ca_topic_score_gemma":0.0052226344,"teacher_disagreement_score":0.005420919,"about_ca_system_score_codex":0.0018266307,"about_ca_system_score_gemma":0.0013078457,"threshold_uncertainty_score":0.014313102},"labels":[],"label_agreement":null},{"id":"W2896357116","doi":"10.1007/978-3-030-01388-2_4","title":"Interaction for Immersive Analytics","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Human–computer interaction; Visual analytics; Analytics; Visualization; Data science; Data visualization; Data exploration; Artificial intelligence","score_opus":0.03413281021332345,"score_gpt":0.31604194512284145,"score_spread":0.281909134909518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896357116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068512717,0.017023873,0.8782472,0.0009169536,0.0014169485,0.000090846006,0.00043570335,0.0040135714,0.09100361],"genre_scores_gemma":[0.22828871,0.023434311,0.5018138,0.0017077489,0.0013736171,0.0009401101,0.0021881931,0.0027569213,0.23749653],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939144,0.0001832309,0.000024151179,0.00008950117,0.00024495725,0.00006667585],"domain_scores_gemma":[0.9992555,0.0004744012,0.000021466258,0.0001238771,0.00007655275,0.00004814259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058236776,0.0016902053,0.00068603444,0.0005459105,0.000537027,0.0028638316,0.0012815112,0.0014185673,0.058123134],"category_scores_gemma":[0.0015534111,0.0007016316,0.0006917429,0.0005565828,0.0010127593,0.004225542,0.006155418,0.0020331638,0.007815796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022464499,0.000175216,0.0003484661,0.0022371807,0.00012572008,0.0005079553,0.0032952707,0.0072368756,0.08146211,0.18475899,0.0899112,0.6297163],"study_design_scores_gemma":[0.00006436743,0.000284859,0.0010478015,0.0012046419,0.00008057431,0.0020249377,0.0011080797,0.03385547,0.029473754,0.1438673,0.78685385,0.00013431197],"about_ca_topic_score_codex":0.00027755686,"about_ca_topic_score_gemma":0.0005300218,"teacher_disagreement_score":0.058123134,"about_ca_system_score_codex":0.00020557671,"about_ca_system_score_gemma":0.00019505662,"threshold_uncertainty_score":0.19444126},"labels":[],"label_agreement":null},{"id":"W2896550038","doi":"10.1007/978-3-030-01388-2_9","title":"Just 5 Questions: Toward a Design Framework for Immersive Analytics","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Simon Fraser University","funders":"","keywords":"Computer science; Visual analytics; Workspace; Analytics; Human–computer interaction; Visualization; Fidelity; Interactive visual analysis; Data science; Data visualization; Presentation (obstetrics); Artificial intelligence","score_opus":0.07155882250079762,"score_gpt":0.3373596401715792,"score_spread":0.26580081767078156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896550038","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.0014314575,0.00013442912,0.9884865,0.0010075989,0.00012447065,0.00017216538,0.000068549365,0.0011926099,0.007382136],"genre_scores_gemma":[0.059951648,0.00026771458,0.9232993,0.0009984515,0.00008167403,0.0010892343,0.0002506704,0.0008146863,0.013246655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592894,0.002329886,0.00020725289,0.0005289648,0.0007491945,0.00025570288],"domain_scores_gemma":[0.9935108,0.00364087,0.00022121599,0.0010228776,0.0010722856,0.00053191977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00561851,0.0017515178,0.0007482069,0.00072231516,0.0016534816,0.006736057,0.0032257775,0.0026628089,0.020385401],"category_scores_gemma":[0.01580025,0.0012606423,0.0012057688,0.00041797967,0.0050776545,0.0124572655,0.008336197,0.0042310935,0.004021607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021496021,0.00020877502,0.0011318207,0.0007770889,0.000054236792,0.00025780417,0.01816879,0.006554991,0.013834269,0.8138936,0.019073833,0.12582982],"study_design_scores_gemma":[0.00009222018,0.00027017776,0.00031032847,0.00050078024,0.00007070146,0.00033743726,0.004155516,0.05231487,0.010654883,0.64216596,0.2890373,0.00008981506],"about_ca_topic_score_codex":0.0010311116,"about_ca_topic_score_gemma":0.0019005962,"teacher_disagreement_score":0.020385401,"about_ca_system_score_codex":0.0006352948,"about_ca_system_score_gemma":0.0012249465,"threshold_uncertainty_score":0.068196},"labels":[],"label_agreement":null},{"id":"W2896743066","doi":"10.1007/978-3-030-01388-2_5","title":"Immersive Human-Centered Computational Analytics","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Analytics; Human–computer interaction; Computer graphics (images); Data science","score_opus":0.03971296169331512,"score_gpt":0.31184910683891703,"score_spread":0.2721361451456019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896743066","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.0064260173,0.002655142,0.95005625,0.0005570378,0.000529828,0.00006252406,0.0004170493,0.0027937565,0.03650245],"genre_scores_gemma":[0.19043668,0.008583281,0.7076311,0.0008725269,0.0004908453,0.00044119012,0.0021349713,0.001534052,0.08787541],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962616,0.00011139198,0.000010584785,0.00007043618,0.00014493309,0.000036537174],"domain_scores_gemma":[0.9992823,0.0004408148,0.00001837897,0.00011777509,0.000072884875,0.00006791765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050987356,0.0013770662,0.0005808959,0.00034982493,0.0003604866,0.0023774167,0.0015975191,0.0007941706,0.03063147],"category_scores_gemma":[0.0014935582,0.0005906749,0.0006565089,0.00037116653,0.0012540717,0.002383855,0.0049574184,0.0017180092,0.0035428687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031877193,0.00034154576,0.0008650657,0.002214269,0.00025406957,0.0005321372,0.0042785527,0.05833344,0.08183273,0.23424584,0.10666233,0.5101212],"study_design_scores_gemma":[0.000091772665,0.00029940772,0.0018505459,0.00083225896,0.00008166867,0.0011012031,0.0014052476,0.15965854,0.033484686,0.26960325,0.5314182,0.00017328133],"about_ca_topic_score_codex":0.00057847396,"about_ca_topic_score_gemma":0.0013237761,"teacher_disagreement_score":0.03063147,"about_ca_system_score_codex":0.00018703705,"about_ca_system_score_gemma":0.0003482193,"threshold_uncertainty_score":0.10247254},"labels":[],"label_agreement":null},{"id":"W2896787225","doi":"10.1007/978-3-030-01081-2_40","title":"Experiments in Learning to Solve Formal Analogical Equations","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Analogy; Translation (biology); Analogical reasoning; Natural language processing; Machine translation; Machine learning; Theoretical computer science; Linguistics","score_opus":0.027987214451111925,"score_gpt":0.30492314535687853,"score_spread":0.2769359309057666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896787225","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.8851703,0.0008653091,0.07288857,0.0016713693,0.00059271435,0.0006115974,0.00090142206,0.0015652159,0.035733588],"genre_scores_gemma":[0.9452859,0.00049516064,0.039503496,0.00043188184,0.00010865106,0.0004349494,0.0014394772,0.00022126103,0.0120792845],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972294,0.0011126928,0.0003330637,0.0005682675,0.00058296067,0.00017352472],"domain_scores_gemma":[0.9335599,0.059680894,0.0013701594,0.0036871524,0.0009811536,0.000720722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028909044,0.0014219262,0.0006862211,0.00041615573,0.0004895418,0.0014818036,0.0026005793,0.0024517179,0.017990688],"category_scores_gemma":[0.05184861,0.0006563159,0.0006387484,0.00051238877,0.002079277,0.0052973754,0.0016683683,0.003160219,0.0016377385],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.018601237,0.036954574,0.0118881995,0.0048197447,0.00076342054,0.000906932,0.00648957,0.12702502,0.06599871,0.17294885,0.026433455,0.52717036],"study_design_scores_gemma":[0.009202161,0.015568296,0.0066186544,0.00043819094,0.00029004988,0.0006974673,0.001642754,0.4595186,0.08563501,0.39173397,0.028434088,0.00022074186],"about_ca_topic_score_codex":0.0010618035,"about_ca_topic_score_gemma":0.00069479796,"teacher_disagreement_score":0.017990688,"about_ca_system_score_codex":0.00081090716,"about_ca_system_score_gemma":0.00070709124,"threshold_uncertainty_score":0.060184836},"labels":[],"label_agreement":null},{"id":"W2897024105","doi":"10.1007/978-3-030-02762-9_21","title":"A Review of Serious Games for Programming","year":2018,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Game programming; Curriculum; Game mechanics; Multimedia; Video game development; Game Developer; Game design; Game design document; Pedagogy; Psychology","score_opus":0.03782531763822331,"score_gpt":0.3490385620740456,"score_spread":0.31121324443582227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897024105","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027197908,0.9949927,0.0010799785,0.0008287387,0.00031896133,0.000022292512,0.00004807997,0.000027954196,0.0024092512],"genre_scores_gemma":[0.0034814542,0.99177223,0.0021213696,0.00091023534,0.00029895647,0.000046497073,0.0001226359,0.000018908382,0.00122775],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989072,0.00031753737,0.00019403007,0.00012530271,0.0003830977,0.00007287051],"domain_scores_gemma":[0.99545467,0.003437954,0.00028876407,0.00008043573,0.000542019,0.00019612929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017628864,0.0012722755,0.001528775,0.0047127116,0.0003735646,0.001673405,0.0018267288,0.0017206643,0.0061052074],"category_scores_gemma":[0.00936433,0.000514712,0.00075097923,0.003455357,0.0009924301,0.0027986744,0.001454389,0.0019661777,0.0017261361],"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.000079530466,0.000115081144,0.00030075232,0.035107084,0.00013867015,0.0000698869,0.00011800419,0.0006034124,0.0003800571,0.012215722,0.045207813,0.905664],"study_design_scores_gemma":[0.00004895731,0.00013290183,0.00088119163,0.020600175,0.00020235039,0.00047195633,0.00010252878,0.0002613761,0.00038711398,0.009710564,0.96717113,0.00002985192],"about_ca_topic_score_codex":0.0019754637,"about_ca_topic_score_gemma":0.0048787617,"teacher_disagreement_score":0.0061052074,"about_ca_system_score_codex":0.0011058047,"about_ca_system_score_gemma":0.0024429464,"threshold_uncertainty_score":0.020423949},"labels":[],"label_agreement":null},{"id":"W2897210226","doi":"10.1007/978-3-030-02738-4_3","title":"Extending the Advisor Concept to Deal with Known-Ahead Transportation Tasks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Task (project management); Quality (philosophy); Range (aeronautics); Artificial intelligence; Human–computer interaction; Systems engineering","score_opus":0.014481046599213543,"score_gpt":0.23531651205092843,"score_spread":0.2208354654517149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897210226","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.0048764725,0.00029025064,0.9818618,0.00021481795,0.000271824,0.000050477935,0.000113614136,0.0010355322,0.011285251],"genre_scores_gemma":[0.20103881,0.0009898738,0.7517745,0.00033127872,0.00038204968,0.00021043936,0.00047933773,0.00063665415,0.04415702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00010165839,0.00003175516,0.00015775432,0.00014091116,0.00007206872],"domain_scores_gemma":[0.99941325,0.00016909989,0.00006311568,0.00017504902,0.00010181736,0.0000776382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777035,0.0012567586,0.0008826131,0.0005552473,0.00084800564,0.0014382374,0.0021049909,0.0014008958,0.01114498],"category_scores_gemma":[0.0017320466,0.0004367366,0.0009472936,0.0008377503,0.0007979159,0.0042665466,0.0019524947,0.0028842553,0.0034388048],"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.00030046527,0.00030867907,0.0007715616,0.0006330051,0.000085345084,0.00029640328,0.00026011575,0.14511022,0.013608265,0.28196067,0.028732976,0.5279324],"study_design_scores_gemma":[0.000059302263,0.00021525337,0.00032706046,0.000080517806,0.00004460657,0.00039138654,0.00007622866,0.73821104,0.00980492,0.161971,0.08876352,0.000055217988],"about_ca_topic_score_codex":0.0014128212,"about_ca_topic_score_gemma":0.0019643502,"teacher_disagreement_score":0.01114498,"about_ca_system_score_codex":0.0004944856,"about_ca_system_score_gemma":0.0012024851,"threshold_uncertainty_score":0.0372836},"labels":[],"label_agreement":null},{"id":"W2897309261","doi":"10.1007/978-3-030-02628-8_4","title":"Finding Effective Ways to (Machine) Learn fMRI-Based Classifiers from Multi-site Data","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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 Alberta","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Normalization (sociology); Functional magnetic resonance imaging; Training set; Data mining; Pattern recognition (psychology)","score_opus":0.0909407209251088,"score_gpt":0.2983109831498024,"score_spread":0.20737026222469362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897309261","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.004178577,0.00087162515,0.9930744,0.00038847717,0.00008559594,0.0000375232,0.00016447598,0.000818859,0.0003804732],"genre_scores_gemma":[0.080476314,0.0016182476,0.9125143,0.0003814991,0.00040039083,0.00030959345,0.0011400484,0.00031067093,0.0028490191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883777,0.00034668765,0.000116480966,0.00036646475,0.00024056598,0.00009214455],"domain_scores_gemma":[0.9956617,0.003124791,0.0002501718,0.00044801453,0.00041317262,0.00010213767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027671417,0.0018456981,0.0021180958,0.0015206567,0.00043994864,0.0023617304,0.0024077399,0.002819395,0.0029619613],"category_scores_gemma":[0.0107375635,0.0010535673,0.001852785,0.0018461989,0.0008793045,0.0039019107,0.0018002087,0.0035472298,0.0021944782],"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.00015990798,0.00017447003,0.0016199001,0.00052738475,0.00038277087,0.000153135,0.000135123,0.07693078,0.014307921,0.01385882,0.010434065,0.8813157],"study_design_scores_gemma":[0.000027141712,0.00010742662,0.00063456915,0.000077902485,0.00011190059,0.00020836973,0.00007238432,0.92597485,0.00870066,0.060372762,0.0036756864,0.0000363163],"about_ca_topic_score_codex":0.0014027595,"about_ca_topic_score_gemma":0.002492379,"teacher_disagreement_score":0.0029619613,"about_ca_system_score_codex":0.0004976684,"about_ca_system_score_gemma":0.00101572,"threshold_uncertainty_score":0.014634252},"labels":[],"label_agreement":null},{"id":"W2897577023","doi":"10.1007/978-3-030-24766-9_12","title":"On the Minimum Consistent Subset Problem","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Waterloo","funders":"","keywords":"Colored; Combinatorics; Mathematics; Cardinality (data modeling); Binary logarithm; Point (geometry); Time complexity; Voronoi diagram; Set (abstract data type); Deterministic algorithm; Running time; Class (philosophy); Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.022878295508387887,"score_gpt":0.25747789485969685,"score_spread":0.23459959935130897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897577023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10345694,0.0013971323,0.8495727,0.0051372047,0.00032416056,0.00016852045,0.00085885037,0.0002754222,0.038809076],"genre_scores_gemma":[0.5670102,0.0021263994,0.40110692,0.0010910109,0.0008180335,0.0005428266,0.0031100437,0.0006109925,0.023583604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867743,0.00061501464,0.000057998997,0.00020845728,0.00033152502,0.00010952603],"domain_scores_gemma":[0.99447954,0.0042864126,0.00019917973,0.000507703,0.00034203735,0.00018511828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018278038,0.00059245015,0.0015493644,0.000993767,0.00094175996,0.0018075575,0.0016680364,0.001475518,0.010514238],"category_scores_gemma":[0.010389359,0.0006055915,0.0009345819,0.0014148592,0.001278428,0.003679063,0.0025687108,0.0028774654,0.0007519686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040188426,0.00014635501,0.0008693214,0.00032570452,0.00007889028,0.00017146407,0.00023452056,0.054102115,0.0028307699,0.83711857,0.01979319,0.08392711],"study_design_scores_gemma":[0.00006385476,0.000049925395,0.00023906528,0.000041456806,0.000021837763,0.000105812076,0.000087093526,0.10923006,0.0008033603,0.88404346,0.005304548,0.000009563141],"about_ca_topic_score_codex":0.0005602292,"about_ca_topic_score_gemma":0.000639465,"teacher_disagreement_score":0.010514238,"about_ca_system_score_codex":0.00066922547,"about_ca_system_score_gemma":0.00082658365,"threshold_uncertainty_score":0.035173595},"labels":[],"label_agreement":null},{"id":"W2897586048","doi":"10.1007/978-3-030-02762-9_27","title":"Making Serious Programming Games Adaptive","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Ontario Tech University","funders":"","keywords":"Adaptation (eye); Computer science; Game based learning; Code (set theory); Game design; Multimedia; Game programming; Game mechanics; Adaptive learning; Human–computer interaction; Game Developer; Artificial intelligence; Game design document; Programming language","score_opus":0.04661227125012977,"score_gpt":0.3358805477377257,"score_spread":0.2892682764875959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897586048","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07634144,0.0006664941,0.58241254,0.0029322118,0.000458942,0.00020058716,0.00008510982,0.0023879411,0.33451477],"genre_scores_gemma":[0.63142306,0.001222934,0.18718101,0.0007935048,0.00010105151,0.00026426723,0.0002753028,0.00064917636,0.17808975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996667,0.00008155539,0.0000129926975,0.00007371725,0.000114663926,0.000050465915],"domain_scores_gemma":[0.99952483,0.00021881046,0.000034259585,0.00008830554,0.0000689331,0.00006471054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549918,0.00065958005,0.00014413666,0.00025750606,0.0003373443,0.0016436941,0.0009095966,0.0006895905,0.010902919],"category_scores_gemma":[0.0029295678,0.00032760866,0.0002884568,0.00016206976,0.00086368807,0.0029315853,0.0016276072,0.0017689747,0.00211002],"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.00012674776,0.00024239202,0.0014577857,0.00024199937,0.000050639544,0.00015021842,0.0032603124,0.0115929535,0.021125892,0.3922101,0.022484884,0.54705614],"study_design_scores_gemma":[0.00006178912,0.00017892972,0.0033817021,0.00023217937,0.000074759424,0.0003172396,0.0018109408,0.046506155,0.018909687,0.5745989,0.35386476,0.00006291281],"about_ca_topic_score_codex":0.00067766034,"about_ca_topic_score_gemma":0.001150432,"teacher_disagreement_score":0.010902919,"about_ca_system_score_codex":0.00031841607,"about_ca_system_score_gemma":0.0003332918,"threshold_uncertainty_score":0.03647387},"labels":[],"label_agreement":null},{"id":"W2897890691","doi":"10.1007/978-3-030-02671-4_19","title":"A Taxonomy of Security as a Service","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Taxonomy (biology); Economic shortage; Computer science; Work (physics); Computer security; Service (business); Business; Engineering; Ecology; Marketing","score_opus":0.020986883132741992,"score_gpt":0.2328386202934793,"score_spread":0.2118517371607373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897890691","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015804771,0.047270123,0.56413186,0.015633857,0.0023805916,0.0007230768,0.0014379084,0.002482181,0.3501356],"genre_scores_gemma":[0.28792292,0.0959197,0.5042404,0.0046035266,0.003547965,0.0016509824,0.0041305213,0.0010255064,0.09695848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671066,0.0008470181,0.00040579142,0.00039287633,0.001218792,0.000424848],"domain_scores_gemma":[0.99580586,0.0015899133,0.00033671706,0.00081535557,0.0010092832,0.00044288958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020672686,0.0015018322,0.0011227273,0.009908209,0.0034780917,0.012854807,0.0022407614,0.004315243,0.009266459],"category_scores_gemma":[0.0064333887,0.00092117157,0.0014776518,0.015744187,0.0053066825,0.027748058,0.003894419,0.0065217363,0.004818324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072116277,0.000020038395,0.00020904835,0.00009007733,0.0000046487758,0.000055332373,0.00027991028,0.0005782018,0.00018380034,0.9645778,0.0077035725,0.026290491],"study_design_scores_gemma":[0.00000929333,0.00004862002,0.00031981917,0.00030651822,0.000014410698,0.0006689788,0.00057033886,0.014074396,0.00030697603,0.7120564,0.27159366,0.000030648065],"about_ca_topic_score_codex":0.005563682,"about_ca_topic_score_gemma":0.0025616211,"teacher_disagreement_score":0.012854807,"about_ca_system_score_codex":0.004852432,"about_ca_system_score_gemma":0.0032435192,"threshold_uncertainty_score":0.035206974},"labels":[],"label_agreement":null},{"id":"W2897975690","doi":"10.1007/978-3-030-02738-4_10","title":"Financial Application on an Openstack Based Private Cloud","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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 Manitoba","funders":"","keywords":"Cloud computing; Server; Computer science; Monte Carlo method; Node (physics); Operating system; Mathematics; Engineering; Statistics","score_opus":0.014381657658448125,"score_gpt":0.24218850129666583,"score_spread":0.2278068436382177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897975690","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7377218,0.0009075876,0.07444753,0.0024627876,0.0012241546,0.0003546914,0.0014185695,0.03925889,0.14220396],"genre_scores_gemma":[0.94878566,0.00020121182,0.014963613,0.00022868009,0.000101658465,0.00003389975,0.0007563299,0.0009166127,0.034012254],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959344,0.00005233457,0.000022952217,0.00005105004,0.000174212,0.000106010106],"domain_scores_gemma":[0.9994881,0.00010481798,0.000024351035,0.00010309869,0.00012717907,0.00015255727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040951182,0.00040282818,0.00041222418,0.00047995374,0.00083684915,0.0011719832,0.00089812715,0.0005263652,0.015431947],"category_scores_gemma":[0.0013072193,0.00018316666,0.0002820459,0.00079093775,0.00037989288,0.0014085935,0.0011365408,0.0005837448,0.0021668153],"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.005302354,0.0023821318,0.018016694,0.000619582,0.00022091846,0.010034746,0.0011922489,0.07132079,0.110554405,0.07510017,0.25075725,0.4544987],"study_design_scores_gemma":[0.0004959674,0.0005687938,0.018439792,0.00007509059,0.00010312587,0.0024638956,0.0005972342,0.7775269,0.045596555,0.030787751,0.12316607,0.00017891158],"about_ca_topic_score_codex":0.0035253358,"about_ca_topic_score_gemma":0.0027640488,"teacher_disagreement_score":0.015431947,"about_ca_system_score_codex":0.00067967316,"about_ca_system_score_gemma":0.000749002,"threshold_uncertainty_score":0.051625013},"labels":[],"label_agreement":null},{"id":"W2897990278","doi":"10.1007/978-3-030-01391-2_27","title":"Representing and Analyzing Enterprise Capabilities as Specialized Actors - A BPM Example","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovation and Knowledge Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software engineering; Knowledge management; Human–computer interaction; Process management; Engineering","score_opus":0.024316164443239602,"score_gpt":0.24847060169606236,"score_spread":0.22415443725282275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897990278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05945236,0.00061012467,0.90378124,0.0016205509,0.00005586949,0.00014545217,0.0004104125,0.0013650637,0.03255898],"genre_scores_gemma":[0.2726161,0.00073973974,0.7191482,0.00011111901,0.00003064309,0.00010842038,0.00046950145,0.00014275122,0.006633473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995084,0.00023331262,0.000032881413,0.00006164242,0.00011361828,0.00005010853],"domain_scores_gemma":[0.99901617,0.00076887436,0.000028752676,0.00008961392,0.00006821883,0.000028432336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235934,0.00050312426,0.00038585992,0.0007843654,0.0009808639,0.0024428524,0.0008519056,0.0017003403,0.0022922799],"category_scores_gemma":[0.0021294674,0.00034355474,0.0010686391,0.0018310132,0.0010779733,0.0032776198,0.0012622084,0.0014325195,0.0004074525],"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.0003115724,0.00026402867,0.0025183908,0.00042349243,0.00008162247,0.0022601744,0.004094507,0.09320174,0.015316634,0.66204065,0.005124371,0.21436286],"study_design_scores_gemma":[0.00007229401,0.00006960767,0.0010839413,0.00016430623,0.000092302274,0.00080354995,0.0013559349,0.55282676,0.015240052,0.37932083,0.0489183,0.000052181833],"about_ca_topic_score_codex":0.004264975,"about_ca_topic_score_gemma":0.005103008,"teacher_disagreement_score":0.004264975,"about_ca_system_score_codex":0.00069205416,"about_ca_system_score_gemma":0.0005433811,"threshold_uncertainty_score":0.00848031},"labels":[],"label_agreement":null},{"id":"W2898497187","doi":"10.1007/978-3-030-03418-4_5","title":"Using Umple to Synergistically Process Features, Variants, UML Models and Classic Code","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Ottawa","funders":"","keywords":"Computer science; Programming language; Class diagram; Unified Modeling Language; Dependency (UML); Code generation; Syntax; Construct (python library); Abstract syntax tree; Sequence diagram; Activity diagram; Abstract syntax; Separation of concerns; Code (set theory); Source code; Process (computing); Documentation; Software engineering; Semantics (computer science); Artificial intelligence; Software; Set (abstract data type); Parsing","score_opus":0.07258018217045781,"score_gpt":0.3255720829345026,"score_spread":0.2529919007640448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898497187","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.005433602,0.00012767236,0.9792128,0.00012209229,0.000053368643,0.0000636096,0.00009180727,0.0074373684,0.0074576526],"genre_scores_gemma":[0.0606358,0.00021659468,0.92210555,0.00013011039,0.000030394964,0.000101037695,0.0007103651,0.0036921294,0.012378146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827754,0.00043602297,0.00010435769,0.0004063313,0.0006641959,0.00011159435],"domain_scores_gemma":[0.9965616,0.0013896045,0.00027547605,0.0013118612,0.00032555583,0.00013593971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020887584,0.0011302055,0.0005512179,0.0018175937,0.00089567876,0.0043813963,0.001617191,0.0010949773,0.009889324],"category_scores_gemma":[0.011552299,0.0010085534,0.0017285618,0.0015027376,0.0011802398,0.0073584453,0.006427987,0.0023621449,0.0048853336],"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.00030309707,0.00018045359,0.0021509195,0.00048701756,0.0000942902,0.0006170874,0.0022567783,0.015125487,0.025029298,0.15721142,0.011509904,0.78503424],"study_design_scores_gemma":[0.00006098789,0.00023575233,0.0011015789,0.00040547247,0.00017603298,0.0013523801,0.0007527538,0.35238498,0.08309899,0.32176965,0.23854026,0.00012110547],"about_ca_topic_score_codex":0.0009601246,"about_ca_topic_score_gemma":0.0024269624,"teacher_disagreement_score":0.009889324,"about_ca_system_score_codex":0.0006794854,"about_ca_system_score_gemma":0.0009142299,"threshold_uncertainty_score":0.03308314},"labels":[],"label_agreement":null},{"id":"W2898512653","doi":"10.1007/978-3-030-03649-2_11","title":"Development of Text Messages for Mobile Health Education to Promote Diabetic Retinopathy Awareness and Eye Care Behavior Among Indigenous Women","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Health and mHealth Applications","field":"Health Professions","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 Saskatchewan","funders":"","keywords":"Indigenous; Diabetic retinopathy; Optometry; Medicine; Psychology; Diabetes mellitus; Endocrinology; Biology","score_opus":0.02442817405387357,"score_gpt":0.3808168082788832,"score_spread":0.35638863422500966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898512653","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.78458524,0.0020586676,0.100869745,0.005173348,0.00163218,0.005063083,0.0018255437,0.0039772787,0.09481483],"genre_scores_gemma":[0.53366446,0.0028151867,0.31033486,0.002058694,0.00030191054,0.0034986618,0.002104217,0.0005055062,0.14471647],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998253,0.000060968003,0.000011897274,0.000023338314,0.00005619218,0.000022348295],"domain_scores_gemma":[0.9993555,0.00037428088,0.00004944639,0.000019627325,0.00014494319,0.000056195135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080087385,0.00041976073,0.00015418816,0.00034757456,0.00033733592,0.0004895959,0.00053276937,0.00043568914,0.013886849],"category_scores_gemma":[0.0018447627,0.00012952642,0.00024448117,0.00017610556,0.00009940938,0.0005986494,0.0004541607,0.0004873389,0.0022722043],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061780337,0.0032772154,0.004264616,0.001561231,0.000031804477,0.00054534554,0.00830229,0.000592377,0.06013548,0.0018574464,0.021147838,0.89766645],"study_design_scores_gemma":[0.0016938469,0.017490555,0.12296524,0.004310869,0.0013095977,0.0015802864,0.020059045,0.022959389,0.2476253,0.006048373,0.55373466,0.00022285037],"about_ca_topic_score_codex":0.001241986,"about_ca_topic_score_gemma":0.0021567887,"teacher_disagreement_score":0.013886849,"about_ca_system_score_codex":0.00026230133,"about_ca_system_score_gemma":0.0006533138,"threshold_uncertainty_score":0.0464561},"labels":[],"label_agreement":null},{"id":"W2898618008","doi":"10.1007/978-3-030-03712-3_3","title":"Analysing Data Security Requirements of Android Mobile Banking Application","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Fuzz testing; Exploit; Android (operating system); Computer security; Security testing; Reuse; Attack surface; Information sensitivity; Operating system; Cloud computing security; Software; Security information and event management; Cloud computing","score_opus":0.027327837196661743,"score_gpt":0.30686823802352836,"score_spread":0.2795404008268666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898618008","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.96959007,0.0010123795,0.020112636,0.00033448776,0.000041881765,0.00010835068,0.00057579606,0.0007078264,0.0075166253],"genre_scores_gemma":[0.9884192,0.00025287652,0.006928394,0.000067216104,0.000013812955,0.00003931329,0.00070449803,0.00016932019,0.0034053982],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874544,0.0001565527,0.000097650845,0.00015601913,0.0006898529,0.00015455832],"domain_scores_gemma":[0.9936168,0.004301722,0.00043200352,0.00042167597,0.0011290419,0.000098788514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005449942,0.0005890847,0.00031235424,0.0012530801,0.00034640418,0.0011176681,0.00055784447,0.00068672816,0.0025601],"category_scores_gemma":[0.0049798735,0.0003990858,0.00060593535,0.00050487823,0.00028019547,0.0012032476,0.00038741942,0.00056432176,0.00071623374],"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.0022089244,0.00033027204,0.055499636,0.0017736102,0.0001438606,0.0036081409,0.0014359907,0.069503084,0.65041006,0.008060896,0.008520814,0.19850476],"study_design_scores_gemma":[0.000039072973,0.00087335124,0.069608904,0.00021966825,0.0002936177,0.0053183855,0.0009859438,0.57119423,0.33265454,0.005781582,0.012916816,0.00011388611],"about_ca_topic_score_codex":0.0015994376,"about_ca_topic_score_gemma":0.0017284876,"teacher_disagreement_score":0.0025601,"about_ca_system_score_codex":0.0006309253,"about_ca_system_score_gemma":0.0004912152,"threshold_uncertainty_score":0.008564413},"labels":[],"label_agreement":null},{"id":"W2898626521","doi":"10.1007/978-3-030-01391-2_31","title":"Conceptual Modeling to Support Pivoting – An Example from Twitter","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Computer science; Software engineering; Human–computer interaction","score_opus":0.07932423402869508,"score_gpt":0.25935707869717944,"score_spread":0.18003284466848435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898626521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04487778,0.00020198061,0.8997668,0.003247299,0.00018638726,0.00038163317,0.0012135942,0.0030413046,0.047083292],"genre_scores_gemma":[0.5450655,0.00036471343,0.4323041,0.0005498244,0.000043807846,0.0004401812,0.0031015722,0.0011675649,0.016962731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983222,0.0008279392,0.0001227169,0.00022178332,0.00034414773,0.00016116672],"domain_scores_gemma":[0.99427915,0.0037689426,0.00013381068,0.000892429,0.0006955775,0.00023011876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035560576,0.00066102936,0.00046041975,0.0012841779,0.0027688555,0.0048922934,0.001590323,0.0019438574,0.014893821],"category_scores_gemma":[0.010820015,0.0005599742,0.0012568843,0.002085598,0.0015876128,0.0082175555,0.0040777004,0.0018944065,0.0028225833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038136204,0.00034211914,0.007920732,0.0004888035,0.00007101096,0.001986844,0.019545605,0.0551838,0.0055950335,0.7313359,0.027892804,0.14925599],"study_design_scores_gemma":[0.00010081456,0.0000911107,0.0013392897,0.00029273803,0.00008436236,0.0004631848,0.008277855,0.4583926,0.0075240736,0.2722182,0.251108,0.00010788319],"about_ca_topic_score_codex":0.021946069,"about_ca_topic_score_gemma":0.02375304,"teacher_disagreement_score":0.021946069,"about_ca_system_score_codex":0.0020143192,"about_ca_system_score_gemma":0.003118656,"threshold_uncertainty_score":0.049824834},"labels":[],"label_agreement":null},{"id":"W2898662501","doi":"10.1007/978-3-030-01325-7_17","title":"Explorable Families of Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Theoretical computer science; Graph; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.02724811559871579,"score_gpt":0.2538213882877647,"score_spread":0.2265732726890489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898662501","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.14103003,0.0077675814,0.46075597,0.004169665,0.00040222483,0.00012134301,0.0019076974,0.0009747307,0.38287064],"genre_scores_gemma":[0.76005757,0.009021087,0.09703711,0.0007232754,0.00052909803,0.000385395,0.0025095523,0.0006840787,0.12905283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962354,0.00010972623,0.000015393198,0.00009934734,0.00010631592,0.00004568202],"domain_scores_gemma":[0.9986474,0.00081426563,0.00008736479,0.00023442319,0.00009964885,0.0001169391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039212606,0.00060921523,0.0004586457,0.001698914,0.0009222197,0.0017341427,0.00070999574,0.0006602502,0.011763067],"category_scores_gemma":[0.0024601852,0.00051957695,0.00077703793,0.0014790674,0.0013626784,0.0045680017,0.002051629,0.0019529429,0.0012168046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019127527,0.000006733657,0.000158529,0.000080150014,0.0000104305045,0.00008855764,0.00025445913,0.0026601125,0.00047994647,0.97125757,0.0050376756,0.019946702],"study_design_scores_gemma":[0.000004780602,0.0000069440566,0.00014457102,0.000037632195,0.0000069549587,0.00018566103,0.000081190556,0.0031919014,0.00022372024,0.97603524,0.020075822,0.0000055780833],"about_ca_topic_score_codex":0.0003624064,"about_ca_topic_score_gemma":0.0005123187,"teacher_disagreement_score":0.011763067,"about_ca_system_score_codex":0.0007276439,"about_ca_system_score_gemma":0.00032023384,"threshold_uncertainty_score":0.039351404},"labels":[],"label_agreement":null},{"id":"W2898837242","doi":"10.1007/978-3-030-03421-4_22","title":"Lightweight Statistical Model Checking in Nondeterministic Continuous Time","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Exploratory Research for Advanced Technology; Universität des Saarlandes","keywords":"Computer science; Nondeterministic algorithm; Rotation formalisms in three dimensions; Automaton; Probabilistic logic; Theoretical computer science; Markov chain; Artificial intelligence; Mathematics; Machine learning","score_opus":0.023803568122986785,"score_gpt":0.28317921841443355,"score_spread":0.25937565029144677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898837242","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.012091278,0.00011780652,0.9836218,0.00012530958,0.000050187617,0.000039842544,0.00007543875,0.0026854035,0.0011929754],"genre_scores_gemma":[0.6767738,0.00023336725,0.31774062,0.0001409818,0.0001107303,0.000279634,0.0003649458,0.000909153,0.003446689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913368,0.002433687,0.00042737022,0.0011327366,0.0039997376,0.0006697501],"domain_scores_gemma":[0.9755932,0.015602463,0.0012648521,0.0058287387,0.0013822553,0.000328503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004755317,0.0011079299,0.0017625593,0.0012405608,0.0007124175,0.002575445,0.0028022353,0.0010273085,0.0037537087],"category_scores_gemma":[0.01983672,0.0010843668,0.001789155,0.0016853453,0.002777983,0.0044934778,0.003453486,0.0034970236,0.0008455769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000752967,0.00018329278,0.0020112544,0.000434275,0.00018953336,0.00022659857,0.00024830218,0.36888802,0.021034798,0.45473912,0.0025371823,0.14875476],"study_design_scores_gemma":[0.00003334335,0.000056763805,0.00020967817,0.00001915224,0.000030233261,0.000041732485,0.000012836813,0.81150675,0.009817348,0.1768329,0.001418426,0.000020793326],"about_ca_topic_score_codex":0.001622618,"about_ca_topic_score_gemma":0.002368161,"teacher_disagreement_score":0.004755317,"about_ca_system_score_codex":0.0016353606,"about_ca_system_score_gemma":0.003155557,"threshold_uncertainty_score":0.025148809},"labels":[],"label_agreement":null},{"id":"W2898861881","doi":"10.1007/978-3-030-03712-3_5","title":"Automating Incident Classification Using Sentiment Analysis and Machine Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Event (particle physics); Categorization; Artificial intelligence; Field (mathematics); Machine learning; Precision and recall; Process (computing); Task (project management); Sentiment analysis; Feature (linguistics); Data mining; Natural language processing; Mathematics","score_opus":0.024618240920304874,"score_gpt":0.25757805321516924,"score_spread":0.23295981229486437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898861881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13772291,0.0013639644,0.809552,0.0010444731,0.0015359526,0.00087460753,0.0063212626,0.01915078,0.022434028],"genre_scores_gemma":[0.3421901,0.0013366505,0.6242698,0.00035814632,0.00071893,0.00035466775,0.015255601,0.0008665535,0.014649511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908316,0.00013458217,0.00009677609,0.0002073768,0.0003514365,0.00012659124],"domain_scores_gemma":[0.99795246,0.00057907664,0.00025422988,0.0002098014,0.0009328638,0.000071637616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009956895,0.0013758385,0.0009029649,0.0031453483,0.000534542,0.0018926861,0.0009023268,0.00059835275,0.0045379535],"category_scores_gemma":[0.003046976,0.00042230551,0.0010738284,0.0023375212,0.00015521662,0.0016487625,0.00094876,0.001037729,0.006062037],"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.00017508479,0.0003365265,0.012531441,0.00036416508,0.00010871541,0.0002098088,0.0001578173,0.0054916306,0.04287443,0.0012716914,0.03938602,0.8970927],"study_design_scores_gemma":[0.00004727943,0.0003136114,0.030890977,0.00017935556,0.00030142648,0.0005428288,0.000849577,0.8303967,0.08838001,0.010838839,0.037170477,0.000088912755],"about_ca_topic_score_codex":0.002271869,"about_ca_topic_score_gemma":0.0042804964,"teacher_disagreement_score":0.0045379535,"about_ca_system_score_codex":0.00047858641,"about_ca_system_score_gemma":0.0008550163,"threshold_uncertainty_score":0.015180945},"labels":[],"label_agreement":null},{"id":"W2898917384","doi":"10.1007/978-3-030-03712-3_1","title":"Identifying Vulnerabilities and Attacking Capabilities Against Pseudonym Changing Schemes in VANET","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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 Windsor","funders":"","keywords":"Pseudonym; Eavesdropping; Computer science; Computer security; Vehicular ad hoc network; Metric (unit); Identification (biology); Exploit; Computer network; Wireless; Telecommunications; Wireless ad hoc network; Engineering","score_opus":0.014227881627690564,"score_gpt":0.2299558475893782,"score_spread":0.21572796596168764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898917384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3525659,0.0040466147,0.60592407,0.0022702601,0.00035848882,0.00042887434,0.00040172783,0.001992806,0.032011252],"genre_scores_gemma":[0.92131156,0.0013931216,0.0710923,0.00016169487,0.00006303305,0.00007637473,0.0003293538,0.00010477987,0.005467871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959298,0.0011612574,0.00031461945,0.00044045033,0.0016787659,0.0004751056],"domain_scores_gemma":[0.9884393,0.007006056,0.00092954544,0.0025080931,0.0009016077,0.00021526378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029000565,0.00060975255,0.00063451356,0.0016525901,0.0007891321,0.002827259,0.0012834619,0.001754982,0.001479361],"category_scores_gemma":[0.014816997,0.00053892663,0.0007238808,0.0012790498,0.0015895428,0.008877155,0.0032976859,0.0023507066,0.0005201929],"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.00081373996,0.0003747756,0.023974434,0.0008647912,0.0002349304,0.0023305248,0.0039310926,0.06823982,0.031449176,0.41505265,0.008717071,0.444017],"study_design_scores_gemma":[0.000032781012,0.0004191834,0.005490264,0.0005210122,0.00021123132,0.007200422,0.0023323083,0.6124272,0.045342673,0.2949672,0.03089046,0.00016523455],"about_ca_topic_score_codex":0.00054133113,"about_ca_topic_score_gemma":0.00039623698,"teacher_disagreement_score":0.0029000565,"about_ca_system_score_codex":0.00073621556,"about_ca_system_score_gemma":0.0007050833,"threshold_uncertainty_score":0.01533711},"labels":[],"label_agreement":null},{"id":"W2899031087","doi":"10.1007/978-3-030-01325-7_20","title":"Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Mobile agent; Distributed computing; Tree (set theory); Energy (signal processing); Computer network","score_opus":0.01843230181514837,"score_gpt":0.24691683147001994,"score_spread":0.22848452965487157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899031087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09284144,0.0006235514,0.8940822,0.0005540055,0.00018634163,0.000083993466,0.00014724622,0.00062246673,0.010858686],"genre_scores_gemma":[0.8513148,0.00061738933,0.13308734,0.00011744366,0.00013729377,0.00009882187,0.00019710136,0.00011263705,0.014317279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963737,0.000102886486,0.00002043678,0.00006965294,0.00010598151,0.000063821506],"domain_scores_gemma":[0.99894375,0.0006354803,0.000073157484,0.00014895576,0.00012723375,0.00007151768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006603291,0.00043299768,0.0009792784,0.0005099387,0.0007309936,0.0012371287,0.0012385655,0.0010704895,0.0025189607],"category_scores_gemma":[0.002622835,0.00039212365,0.00045700526,0.001142431,0.00059764285,0.0013672886,0.0012993625,0.0008790474,0.00059433404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013722517,0.00020880524,0.0010291663,0.0003244638,0.00015901541,0.00043064402,0.00044508852,0.74580514,0.026169749,0.11572999,0.0061474517,0.102178216],"study_design_scores_gemma":[0.00008859541,0.00009361199,0.00013706113,0.000013088339,0.00003555782,0.000087070184,0.000055287725,0.9663314,0.0026036694,0.027816974,0.0027258366,0.000011883191],"about_ca_topic_score_codex":0.0011999707,"about_ca_topic_score_gemma":0.0012449275,"teacher_disagreement_score":0.0025189607,"about_ca_system_score_codex":0.00058893283,"about_ca_system_score_gemma":0.00044785047,"threshold_uncertainty_score":0.008426726},"labels":[],"label_agreement":null},{"id":"W2899692896","doi":"10.1007/978-3-030-03769-7_27","title":"Writing Domain-Specific Languages for BeepBeep","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Programming language; Extension (predicate logic); Domain-specific language; Interpreter; Domain (mathematical analysis); Grammar; Event (particle physics); Natural language processing; Linguistics","score_opus":0.0793646632939785,"score_gpt":0.35490797742684227,"score_spread":0.27554331413286376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899692896","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.0030225127,0.000163951,0.94971776,0.00023592515,0.00018663463,0.00018096532,0.0012114386,0.035334863,0.009946061],"genre_scores_gemma":[0.060717978,0.0005906151,0.8593626,0.0008087076,0.000111124835,0.00082459854,0.00687887,0.036011472,0.034693994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988356,0.00019741234,0.00018741279,0.00025656706,0.00035812712,0.00016479731],"domain_scores_gemma":[0.9984035,0.00067934877,0.00009865551,0.00044429608,0.00031683833,0.00005735776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011819105,0.0017939577,0.0007459476,0.0005950641,0.0007940033,0.0030494872,0.0020276872,0.0014894273,0.026823398],"category_scores_gemma":[0.0038754588,0.0017559722,0.002092023,0.001009422,0.001144897,0.0034574545,0.0032392761,0.0043527107,0.016360275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034021455,0.00016233645,0.001276843,0.0023851825,0.0001399329,0.0009156353,0.00236988,0.01597385,0.041311953,0.27672258,0.15438107,0.50402045],"study_design_scores_gemma":[0.00013594203,0.00007670806,0.00039506133,0.0005823219,0.00011122726,0.00093168614,0.0004014947,0.06183301,0.08399869,0.17400551,0.6773978,0.00013049849],"about_ca_topic_score_codex":0.0019916983,"about_ca_topic_score_gemma":0.003389885,"teacher_disagreement_score":0.026823398,"about_ca_system_score_codex":0.0007364938,"about_ca_system_score_gemma":0.0015261977,"threshold_uncertainty_score":0.08973324},"labels":[],"label_agreement":null},{"id":"W2899693197","doi":"10.1007/978-3-030-03596-9_10","title":"Cloudchain: A Blockchain-Based Coopetition Differential Game Model for Cloud Computing","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Concordia University","funders":"","keywords":"Cloud computing; Computer science; Service provider; Reputation; Computer security; Revenue; Cloud service provider; Profit (economics); Differential game; Service (business); Cloud computing security; Business; Finance; Marketing; Microeconomics","score_opus":0.016999782178774427,"score_gpt":0.2463429447030876,"score_spread":0.22934316252431317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899693197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06301581,0.00045347304,0.89793205,0.0009904214,0.00016309622,0.00028210322,0.0004661309,0.00027512846,0.036421742],"genre_scores_gemma":[0.9338639,0.0005283135,0.04787366,0.0001090563,0.000055413606,0.0002453257,0.00025471914,0.0000589521,0.017010644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994795,0.0002117567,0.00001827515,0.000073479765,0.00012695669,0.00009005394],"domain_scores_gemma":[0.9993718,0.00030938856,0.00004334327,0.00007064628,0.0000987414,0.000106028965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066897896,0.00043046824,0.0008465202,0.0002659971,0.00092792854,0.0018001434,0.0014066176,0.001181834,0.0084963385],"category_scores_gemma":[0.0017855545,0.00022425465,0.00047796065,0.00088108843,0.0011874009,0.0022243338,0.0016979364,0.0014172373,0.0007160041],"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.0002141732,0.00011693136,0.0003350467,0.00012349707,0.000028513456,0.0001980548,0.0001776383,0.3879689,0.0022426888,0.58453345,0.0040230867,0.02003806],"study_design_scores_gemma":[0.000035933015,0.000035808596,0.000054919263,0.000010111583,0.000007916708,0.00002893432,0.000027824697,0.8532135,0.0003136419,0.14358836,0.0026707111,0.000012413677],"about_ca_topic_score_codex":0.0055876034,"about_ca_topic_score_gemma":0.0049910517,"teacher_disagreement_score":0.0084963385,"about_ca_system_score_codex":0.001443888,"about_ca_system_score_gemma":0.0024779013,"threshold_uncertainty_score":0.02842313},"labels":[],"label_agreement":null},{"id":"W2899724367","doi":"10.1007/978-3-030-03801-4_43","title":"Scale-Aware RPN for Vehicle Detection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bootstrapping (finance); Disjoint sets; Scale (ratio); Artificial intelligence; Data mining; Feature (linguistics); Machine learning","score_opus":0.018702706010345682,"score_gpt":0.2626382747578919,"score_spread":0.24393556874754624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899724367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015850686,0.001597691,0.97127986,0.00019075129,0.00054480997,0.00005990441,0.0005285399,0.005088669,0.004858995],"genre_scores_gemma":[0.4626992,0.0014386198,0.5162628,0.00050199067,0.000463953,0.00015069368,0.0019690746,0.00057036045,0.015943289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.000032633485,0.000013698606,0.00011999437,0.00008602322,0.00004894645],"domain_scores_gemma":[0.99972874,0.00006779685,0.000017251328,0.00006576688,0.00010652138,0.000013799944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047656518,0.0011135065,0.000897498,0.0005369272,0.0003069961,0.00058872125,0.0015729578,0.0010131182,0.004057185],"category_scores_gemma":[0.0011087164,0.0004398438,0.0006942125,0.00076813047,0.00023111588,0.0010882268,0.00089537463,0.0010662286,0.0028255442],"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.00018520022,0.0001218508,0.00082151656,0.00014230215,0.00008597912,0.000101545054,0.000031224772,0.08598737,0.026091639,0.00317964,0.014104119,0.86914766],"study_design_scores_gemma":[0.000006235924,0.000035497782,0.000807069,0.0000141056,0.000028356386,0.00009622234,0.000012771648,0.98318106,0.009040616,0.003717155,0.0030485583,0.000012371872],"about_ca_topic_score_codex":0.0037355286,"about_ca_topic_score_gemma":0.0054223104,"teacher_disagreement_score":0.004057185,"about_ca_system_score_codex":0.00037653898,"about_ca_system_score_gemma":0.00042823845,"threshold_uncertainty_score":0.013572693},"labels":[],"label_agreement":null},{"id":"W2900379213","doi":"10.1007/978-3-030-03840-3_9","title":"CH1: A Conversational System to Calculate Carbohydrates in a Meal","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Meal; Computer science; Food science; Chemistry","score_opus":0.011343527461812492,"score_gpt":0.2508860938175988,"score_spread":0.2395425663557863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900379213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100891575,0.00091549085,0.6647603,0.0010365322,0.00042261035,0.0010647549,0.005767765,0.19025458,0.034886416],"genre_scores_gemma":[0.51933074,0.00035886804,0.433214,0.0007339338,0.00017140845,0.00086223544,0.0068687964,0.0029015318,0.035558365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.00016338372,0.00003077722,0.00015626772,0.00009400341,0.00005221291],"domain_scores_gemma":[0.99897975,0.0006414683,0.000039778595,0.00009638808,0.0001329032,0.00010967731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009649083,0.0011935419,0.00045954372,0.0004680632,0.0006170554,0.0009687043,0.0016546596,0.0012902361,0.020110095],"category_scores_gemma":[0.0027748432,0.00043778803,0.00040623156,0.00031479128,0.00032008308,0.0015668516,0.0014727442,0.00074005063,0.006614882],"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.0048615793,0.0010366295,0.0076487577,0.0024519581,0.00025585174,0.0018308361,0.009042968,0.010868385,0.13677405,0.013351592,0.1408926,0.67098475],"study_design_scores_gemma":[0.0006847835,0.0013970007,0.013774452,0.00033942828,0.00039269187,0.0031949957,0.002670479,0.5344003,0.14378685,0.022557404,0.27621526,0.00058637693],"about_ca_topic_score_codex":0.003693376,"about_ca_topic_score_gemma":0.0023927893,"teacher_disagreement_score":0.020110095,"about_ca_system_score_codex":0.00048157555,"about_ca_system_score_gemma":0.000811893,"threshold_uncertainty_score":0.06727499},"labels":[],"label_agreement":null},{"id":"W2900469667","doi":"10.1007/978-3-030-04618-7_1","title":"Minimum Diameter k-Steiner Forest","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Brock University","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Undirected graph; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Minimum spanning tree; Discrete mathematics; Computer science; Telecommunications","score_opus":0.02307190990746621,"score_gpt":0.2786902830341342,"score_spread":0.25561837312666796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900469667","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.23699072,0.010411098,0.33797,0.0051582283,0.0015104599,0.00032855885,0.011476693,0.0025523384,0.39360195],"genre_scores_gemma":[0.6001992,0.009148348,0.28688192,0.0006571714,0.00054517546,0.00021934888,0.009216452,0.0010489889,0.092083335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982905,0.000015896598,0.000013191317,0.000062904175,0.000046240897,0.000032634063],"domain_scores_gemma":[0.99967086,0.00009391878,0.000040333223,0.00006513932,0.00007078404,0.00005903116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012665513,0.0005697365,0.00089199614,0.0005782347,0.0007896707,0.001344658,0.0011901038,0.0008447007,0.013176401],"category_scores_gemma":[0.00068543776,0.0005086314,0.00052583136,0.0014555376,0.00034379278,0.002760779,0.00086872274,0.0013590358,0.004257673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009977961,0.00021519605,0.0017755773,0.004604421,0.00016087218,0.0007214502,0.00043719623,0.03220412,0.067329824,0.36472005,0.13043256,0.39640093],"study_design_scores_gemma":[0.00020397444,0.00035167576,0.0062261457,0.000556011,0.0003230148,0.005997899,0.00056601886,0.07036777,0.024707904,0.64119303,0.24941865,0.00008783555],"about_ca_topic_score_codex":0.00039500804,"about_ca_topic_score_gemma":0.0008412837,"teacher_disagreement_score":0.013176401,"about_ca_system_score_codex":0.00063506566,"about_ca_system_score_gemma":0.00038580422,"threshold_uncertainty_score":0.044079483},"labels":[],"label_agreement":null},{"id":"W2900967032","doi":"10.1007/978-3-030-04284-4_8","title":"Unified Access to Heterogeneous Data Sources Using an Ontology","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Autodesk (Canada)","funders":"","keywords":"Computer science; Leverage (statistics); Aggregate (composite); Cloud computing; Semantic heterogeneity; Data migration; Database; Ontology; Data access; Semi-structured data; Data source; Software; Data science; Information retrieval; Ontology-based data integration; Semantic Web; Relational database","score_opus":0.11857978325251387,"score_gpt":0.33748856956236867,"score_spread":0.2189087863098548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900967032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042520245,0.0006357604,0.9849214,0.0005344768,0.00010542766,0.00017724912,0.00042611922,0.0028476885,0.0060999338],"genre_scores_gemma":[0.065143295,0.0020386882,0.9225288,0.00044227563,0.0001266735,0.00032200332,0.0025490266,0.00080037856,0.006048931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931016,0.001287586,0.0014564487,0.00091182353,0.0028337946,0.00040878914],"domain_scores_gemma":[0.9946702,0.0013153513,0.00026687098,0.002856027,0.0006454633,0.00024597763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006585422,0.00095033017,0.0022304985,0.005687633,0.0021396098,0.01247564,0.0037340433,0.0022173738,0.0026321798],"category_scores_gemma":[0.010498256,0.0014447263,0.0034577404,0.008613442,0.0025443146,0.0236373,0.013441913,0.0039286655,0.001448632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019214267,0.00019451162,0.0012793,0.00068508135,0.00039340684,0.0010458973,0.0029698657,0.0057213157,0.011283885,0.67816985,0.013303231,0.28476158],"study_design_scores_gemma":[0.00007912213,0.000054315,0.0009728695,0.0007058195,0.00062169007,0.0011766356,0.001352003,0.09897852,0.01556514,0.6169177,0.26336595,0.0002101906],"about_ca_topic_score_codex":0.0064396006,"about_ca_topic_score_gemma":0.007877105,"teacher_disagreement_score":0.01247564,"about_ca_system_score_codex":0.0014139271,"about_ca_system_score_gemma":0.0033120057,"threshold_uncertainty_score":0.03482747},"labels":[],"label_agreement":null},{"id":"W2901038528","doi":"10.1007/978-3-030-04618-7_3","title":"Makespan Minimization on Unrelated Parallel Machines with a Few Bags","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Western University","funders":"","keywords":"Minification; Job shop scheduling; Computer science; Cost-minimization analysis; Parallel computing; Mathematical optimization; Mathematics; Medicine; Operating system; Internal medicine; Schedule","score_opus":0.01023101172302039,"score_gpt":0.2140643128168145,"score_spread":0.20383330109379413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901038528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10926365,0.0015410401,0.8651497,0.0006495401,0.00040370342,0.00021575371,0.00039950234,0.0010391794,0.021337919],"genre_scores_gemma":[0.5373442,0.0011250393,0.43859252,0.0002596733,0.00050278485,0.00036839012,0.0007661554,0.0011390242,0.01990212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926656,0.00018006343,0.00003205036,0.00021082307,0.00013891101,0.00017166557],"domain_scores_gemma":[0.9989961,0.0005074532,0.00008659633,0.0001647361,0.00010954592,0.0001355947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008220448,0.0016393227,0.0018272897,0.0006612647,0.0009910648,0.0012232786,0.0024742666,0.0008911416,0.0038242368],"category_scores_gemma":[0.0023677128,0.0010153957,0.0011371754,0.0020695678,0.00062427716,0.0018471631,0.0013354905,0.0017552994,0.0007885033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089537975,0.00030441224,0.00043751215,0.0008844387,0.0001648121,0.00027197084,0.00016876654,0.7899451,0.015582803,0.038092103,0.012532363,0.14072038],"study_design_scores_gemma":[0.000034199806,0.00021848822,0.0005632269,0.000030855426,0.000042167492,0.0000954823,0.000033260123,0.9337131,0.0029210728,0.059552006,0.002777434,0.000018840869],"about_ca_topic_score_codex":0.0014023334,"about_ca_topic_score_gemma":0.0014357222,"teacher_disagreement_score":0.0038242368,"about_ca_system_score_codex":0.00088257145,"about_ca_system_score_gemma":0.0008717394,"threshold_uncertainty_score":0.012793362},"labels":[],"label_agreement":null},{"id":"W2901082336","doi":"10.1007/978-3-030-04028-4_54","title":"Expressive Range Analysis of a Possible Worlds Driven Emergent Narrative System","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Concordia University; McGill University","funders":"","keywords":"Affordance; Computer science; Narrative; Range (aeronautics); Human–computer interaction; Cognitive science; Data science; Linguistics; Psychology","score_opus":0.025800836142940046,"score_gpt":0.2820332817646234,"score_spread":0.25623244562168335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901082336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091894336,0.00016312576,0.8536667,0.00052470557,0.000049626913,0.00010422271,0.00042156814,0.0008152994,0.052360363],"genre_scores_gemma":[0.8768815,0.00009964912,0.1089921,0.00007780526,0.000035559868,0.00011387886,0.00046267197,0.00027130276,0.013065662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.00018456901,0.000033495875,0.000102460624,0.00022197847,0.000077728575],"domain_scores_gemma":[0.9987386,0.0007717351,0.00007312279,0.00017826183,0.00016401122,0.00007421483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064852,0.00034374933,0.00040223973,0.0007943148,0.0008609056,0.0021990896,0.0011758013,0.00073701545,0.010407371],"category_scores_gemma":[0.0036114065,0.00033915802,0.0008263919,0.0004496074,0.0017813246,0.0030534314,0.002488979,0.0013600076,0.0008484045],"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.00006291496,0.00003018356,0.0003455523,0.0000624914,0.000018610543,0.00027495538,0.0011345999,0.025510812,0.003830559,0.9541207,0.0011486378,0.013460159],"study_design_scores_gemma":[0.00002097669,0.000024818168,0.00020490249,0.000022940581,0.0000172816,0.00013122402,0.00036485025,0.3616684,0.002393695,0.6300704,0.005063481,0.000017075621],"about_ca_topic_score_codex":0.0011868277,"about_ca_topic_score_gemma":0.0010126618,"teacher_disagreement_score":0.010407371,"about_ca_system_score_codex":0.0007239559,"about_ca_system_score_gemma":0.00036465417,"threshold_uncertainty_score":0.034816086},"labels":[],"label_agreement":null},{"id":"W2901173357","doi":"10.1007/978-3-030-03592-1_2","title":"Executable Counterexamples in Software Model Checking","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Executable; Computer science; Programming language; Counterexample; Model checking; Software; Software engineering; Operating system; Discrete mathematics","score_opus":0.035696260353724835,"score_gpt":0.2674783825539967,"score_spread":0.23178212220027186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901173357","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.04899308,0.0024879763,0.9246115,0.0012358073,0.00038861192,0.000089930436,0.00008568432,0.001851862,0.020255642],"genre_scores_gemma":[0.71858305,0.0012887986,0.26869634,0.00040784385,0.00022731935,0.00021063481,0.00028134865,0.0009082747,0.009396323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452776,0.0023986923,0.0002497892,0.0004925948,0.0020690793,0.00026212534],"domain_scores_gemma":[0.98237026,0.015096962,0.00040618895,0.0014136224,0.000598595,0.0001143785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026306843,0.0016595032,0.0011776468,0.0021895792,0.00091352063,0.002836218,0.0021407786,0.0021502941,0.0035453595],"category_scores_gemma":[0.02549235,0.0014419045,0.0012812775,0.001777739,0.004162752,0.005894029,0.0029610898,0.0051880935,0.000580215],"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.00030865456,0.00012735621,0.00081449345,0.0004893879,0.000068552334,0.0004495071,0.0005048503,0.06617974,0.0025955888,0.82262504,0.0042628837,0.10157391],"study_design_scores_gemma":[0.000033881035,0.000036486577,0.00013159674,0.00016146789,0.000049627368,0.00020895098,0.000048673344,0.2111758,0.0042530517,0.77926654,0.0046103345,0.000023517818],"about_ca_topic_score_codex":0.001159787,"about_ca_topic_score_gemma":0.001623708,"teacher_disagreement_score":0.0035453595,"about_ca_system_score_codex":0.0014320564,"about_ca_system_score_gemma":0.0010262257,"threshold_uncertainty_score":0.013912559},"labels":[],"label_agreement":null},{"id":"W2901504805","doi":"10.1007/978-3-642-22673-1","title":"Intelligent Computer Mathematics","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"McMaster University; University of Alberta","funders":"","keywords":"Computer science; Mathematics education; Calculus (dental); Mathematics; Medicine","score_opus":0.028485496172642105,"score_gpt":0.2559860838831774,"score_spread":0.2275005877105353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901504805","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018248974,0.01792709,0.06617748,0.0034840489,0.001924547,0.00006187311,0.0003646799,0.0007339402,0.9075014],"genre_scores_gemma":[0.03843504,0.01710052,0.03065282,0.00088141306,0.0018722892,0.000115143754,0.0007887531,0.0004091055,0.9097449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996903,0.000040545543,0.0000134146285,0.00005994672,0.0001742995,0.00002147785],"domain_scores_gemma":[0.9997658,0.0000690298,0.00001281192,0.00008005611,0.00005418593,0.00001814162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027758096,0.00077464624,0.0006892315,0.0012237652,0.00073820027,0.0022369663,0.00064001954,0.0006240838,0.07560998],"category_scores_gemma":[0.00092605123,0.00032948234,0.00043046597,0.0011685197,0.0010699154,0.0028246993,0.0012367165,0.0017210516,0.033775948],"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.000016023581,0.00003215635,0.00013447393,0.00023922167,0.000012884792,0.00003782972,0.00013837458,0.0013490103,0.0011016838,0.5043192,0.20620479,0.28641438],"study_design_scores_gemma":[0.0000053103604,0.000014729312,0.00025678493,0.000075950666,0.0000075384014,0.000109510474,0.000029390952,0.0024414223,0.00069449126,0.25187963,0.7444793,0.000006001265],"about_ca_topic_score_codex":0.0004602313,"about_ca_topic_score_gemma":0.0008895133,"teacher_disagreement_score":0.07560998,"about_ca_system_score_codex":0.001038263,"about_ca_system_score_gemma":0.0007114937,"threshold_uncertainty_score":0.2529406},"labels":[],"label_agreement":null},{"id":"W2901544970","doi":"10.1007/978-3-030-01692-0_36","title":"Augmenting Virtuality with a Synchronized Dynamic Musical Instrument: A User Evaluation of a Mixed Reality MIDI Keyboard","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"MIDI; Computer science; Human–computer interaction; Virtuality (gaming); Immersion (mathematics); Virtual reality; Popularity; Mixed reality; Multimedia; User experience design; Artificial intelligence","score_opus":0.03894095099181131,"score_gpt":0.29722644133983916,"score_spread":0.25828549034802784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901544970","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.9755068,0.0006423821,0.019017017,0.000109804845,0.00007173124,0.00020090488,0.00028515182,0.0005656025,0.00360051],"genre_scores_gemma":[0.94986033,0.0008797871,0.03881304,0.00013414901,0.000037691414,0.00035094624,0.0004473668,0.00037047922,0.00910611],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929214,0.00033451745,0.000056296383,0.00009131829,0.0001584892,0.000067280416],"domain_scores_gemma":[0.9978276,0.0015507545,0.000053998836,0.0001567342,0.00023620836,0.00017465198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013604681,0.001044677,0.00070826913,0.00037267234,0.00034774176,0.0015198721,0.0011971969,0.0007554182,0.011968618],"category_scores_gemma":[0.00465954,0.00030020735,0.0004091938,0.00020871527,0.0004116554,0.0011112865,0.0012250602,0.00034531872,0.0015165681],"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.021101533,0.006594754,0.008314541,0.004228922,0.000459291,0.0019861828,0.021879354,0.0029107728,0.39663652,0.0017026659,0.0063247904,0.5278607],"study_design_scores_gemma":[0.0070085884,0.17495243,0.1716184,0.0016903419,0.004881511,0.030719116,0.03787465,0.09381207,0.36425486,0.003886702,0.10797043,0.0013309136],"about_ca_topic_score_codex":0.0005211706,"about_ca_topic_score_gemma":0.0006526896,"teacher_disagreement_score":0.011968618,"about_ca_system_score_codex":0.00013972346,"about_ca_system_score_gemma":0.00022025808,"threshold_uncertainty_score":0.040039003},"labels":[],"label_agreement":null},{"id":"W2901576215","doi":"10.1007/978-3-030-04070-3_17","title":"Optimizing Fleet Staging of Air Ambulances in the Province of Ontario","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Genetic algorithm; Population; Operations research; Chromosome; Service (business); Function (biology); Machine learning; Engineering; Demography","score_opus":0.02196503799202546,"score_gpt":0.2291275933727336,"score_spread":0.20716255538070816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901576215","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.91550004,0.000827084,0.018970901,0.0009858634,0.00007284245,0.00025703563,0.004442012,0.0003405188,0.058603812],"genre_scores_gemma":[0.9784143,0.00030027397,0.0070530553,0.000026862572,0.0000064603296,0.000022322098,0.0015883418,0.00006405225,0.012524417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.0000408441,0.000009798938,0.00004181193,0.00007277888,0.00018175339],"domain_scores_gemma":[0.9996494,0.00007621593,0.0000331901,0.000020779918,0.00014477264,0.00007550628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039252624,0.00049350125,0.0004671844,0.00059648365,0.0013336875,0.001376355,0.00093642337,0.00045618694,0.0060936906],"category_scores_gemma":[0.0014272131,0.00039576698,0.0003929935,0.0013516311,0.0004957776,0.0005892644,0.00042106264,0.00038411684,0.000428452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003027364,0.00006431137,0.03132699,0.00010440049,0.00007311079,0.00025359707,0.0003371661,0.891574,0.002723569,0.005317957,0.0129998615,0.054922145],"study_design_scores_gemma":[0.00005136763,0.00012138078,0.057315245,0.000034821773,0.00005921802,0.000057503898,0.0017253908,0.92616284,0.0011961046,0.0027635612,0.0104745,0.000038045615],"about_ca_topic_score_codex":0.9666264,"about_ca_topic_score_gemma":0.98464984,"teacher_disagreement_score":0.033373594,"about_ca_system_score_codex":0.016320497,"about_ca_system_score_gemma":0.015295685,"threshold_uncertainty_score":0.118414044},"labels":[],"label_agreement":null},{"id":"W2901654250","doi":"10.1007/978-3-030-03520-4_17","title":"Hierarchical Attention Network for Context-Aware Query Suggestion","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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":"Université de Montréal","funders":"","keywords":"Computer science; Information retrieval; Web search query; Information needs; Query expansion; Focus (optics); Context (archaeology); Search engine; Session (web analytics); Web query classification; Query language; Process (computing); World Wide Web","score_opus":0.023397636824244807,"score_gpt":0.2700380918092524,"score_spread":0.2466404549850076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901654250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06473654,0.006170482,0.9198119,0.0006397253,0.00027319818,0.00011975413,0.00049605477,0.0031941044,0.004558258],"genre_scores_gemma":[0.86485195,0.0012334049,0.1260269,0.00025912948,0.00031767413,0.00012679708,0.0006846433,0.00014151189,0.006358041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995505,0.00010681303,0.00002083666,0.00014557359,0.00008768881,0.000088464425],"domain_scores_gemma":[0.9992907,0.00042890548,0.000044190594,0.00007087247,0.000116854404,0.00004838506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070667564,0.00070247427,0.001209551,0.0010153102,0.00049921876,0.00071187795,0.0016903993,0.0011774426,0.004202148],"category_scores_gemma":[0.0026035097,0.00044847565,0.0005075301,0.0011466476,0.00034236605,0.0015298038,0.00093714625,0.0011753477,0.00080511323],"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.0012474114,0.00054393674,0.002368756,0.00036570465,0.00019508164,0.00026260578,0.0002650112,0.20986377,0.040955327,0.017577427,0.01941703,0.70693797],"study_design_scores_gemma":[0.000010692717,0.00003443084,0.0004385484,0.0000057118505,0.00002742224,0.000029250265,0.000009725771,0.99281245,0.0016677445,0.004401983,0.00055276667,0.000009248765],"about_ca_topic_score_codex":0.016892266,"about_ca_topic_score_gemma":0.016589802,"teacher_disagreement_score":0.016892266,"about_ca_system_score_codex":0.0010983418,"about_ca_system_score_gemma":0.0011089399,"threshold_uncertainty_score":0.033587873},"labels":[],"label_agreement":null},{"id":"W2901658348","doi":"10.1007/978-3-030-03251-7_33","title":"Shatter Secrets: Using Secret Sharing to Cross Borders with Encrypted Devices","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer security; Computer science; Internet privacy; Scrutiny; Password; Cryptography; Android (operating system); Law; Political science","score_opus":0.026247343841527514,"score_gpt":0.29217876455695513,"score_spread":0.26593142071542764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901658348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040203035,0.0020810382,0.9092013,0.0007043678,0.00041425342,0.000112425216,0.00007660433,0.0021435549,0.045063313],"genre_scores_gemma":[0.7868931,0.0021872225,0.15379985,0.00030103736,0.00017738742,0.00011620899,0.00014314234,0.00053133286,0.05585069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991493,0.00019155061,0.00004382102,0.00012851077,0.00034348475,0.00014332666],"domain_scores_gemma":[0.9985831,0.00045649815,0.000092502785,0.0007245589,0.0000925386,0.000050840474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011390087,0.0005935664,0.00051756465,0.0005890788,0.0008331057,0.002398233,0.001293607,0.0012517978,0.0067190607],"category_scores_gemma":[0.002689406,0.0004849711,0.0005520839,0.00063311064,0.0023691761,0.0062884,0.0039880825,0.002122036,0.0017192529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043910468,0.00012858644,0.0005643932,0.00030009562,0.00008147427,0.00044021077,0.0014183174,0.028410187,0.039318435,0.5979826,0.010513271,0.32040328],"study_design_scores_gemma":[0.00009118323,0.0003487073,0.00046496993,0.00019063111,0.00013020675,0.0015123737,0.000542063,0.22512625,0.11676384,0.5393533,0.115346275,0.00013028824],"about_ca_topic_score_codex":0.00026126305,"about_ca_topic_score_gemma":0.00026150228,"teacher_disagreement_score":0.0067190607,"about_ca_system_score_codex":0.0005155445,"about_ca_system_score_gemma":0.0006090936,"threshold_uncertainty_score":0.022477448},"labels":[],"label_agreement":null},{"id":"W2901887370","doi":"10.1007/978-3-030-04651-4_38","title":"On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"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":"Traverse; Competitive analysis; Combinatorics; Generalization; Computer science; Graph; Shortest path problem; Path (computing); Asymptotically optimal algorithm; Node (physics); Randomized algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Upper and lower bounds; Computer network","score_opus":0.03387326969170144,"score_gpt":0.26185795791360544,"score_spread":0.227984688221904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901887370","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44202155,0.005349067,0.21161465,0.009979992,0.0007509615,0.0005814256,0.0025521005,0.0010031677,0.3261471],"genre_scores_gemma":[0.8988844,0.003502421,0.042160906,0.0010536835,0.0005610493,0.00055630854,0.0019390688,0.000762166,0.050579894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776256,0.0006734296,0.00008534737,0.00036585354,0.00035726646,0.00075548276],"domain_scores_gemma":[0.98482406,0.011144224,0.0007019363,0.0007421667,0.0007955281,0.0017921964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025603632,0.00263529,0.0042749355,0.0021996745,0.0033870044,0.007402334,0.005286973,0.0041492274,0.03453679],"category_scores_gemma":[0.022526318,0.0009272705,0.0020351172,0.0040562963,0.004756692,0.008924196,0.004155938,0.006101222,0.0020114733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009861543,0.00025951854,0.0010056414,0.00049096684,0.00011518107,0.00017058004,0.0005629134,0.11823372,0.0011539168,0.8240639,0.025538983,0.027418517],"study_design_scores_gemma":[0.00018707871,0.0001282929,0.00047408027,0.000105511026,0.000058144113,0.00008471697,0.00033903323,0.18618472,0.0003396214,0.8071673,0.004868205,0.000063422616],"about_ca_topic_score_codex":0.031826537,"about_ca_topic_score_gemma":0.022115048,"teacher_disagreement_score":0.03453679,"about_ca_system_score_codex":0.005622358,"about_ca_system_score_gemma":0.008166195,"threshold_uncertainty_score":0.11553705},"labels":[],"label_agreement":null},{"id":"W2901900005","doi":"10.1007/978-3-030-04651-4_33","title":"Transmitting Particles in a Polygonal Domain by Repulsion","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Point (geometry); Domain (mathematical analysis); Computer science; Time complexity; Actuator; Polynomial; Algorithm; Particle (ecology); Artificial intelligence; Mathematics; Geometry; Mathematical analysis","score_opus":0.014186107273614522,"score_gpt":0.2430706233654112,"score_spread":0.22888451609179666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901900005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050990503,0.0004369219,0.9147061,0.00024978843,0.00016325877,0.000070030146,0.000050138387,0.00046765435,0.03286554],"genre_scores_gemma":[0.73813736,0.00073958805,0.22508916,0.00020622178,0.00014775075,0.00017280965,0.00015961441,0.00030648758,0.03504096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999808,0.00003723481,0.0000066815537,0.00002972312,0.000094533425,0.000023878007],"domain_scores_gemma":[0.9996244,0.00023246369,0.000033472523,0.000044189248,0.00003187498,0.00003369611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380169,0.00044424864,0.00045883044,0.0004465409,0.00052464235,0.00068710133,0.0010076732,0.00075974007,0.004015607],"category_scores_gemma":[0.00096233084,0.00033440866,0.00041300693,0.00050186267,0.00078723376,0.0008063675,0.0014888743,0.0009695995,0.0006573028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029492693,0.00010450458,0.00047660904,0.00028382,0.000053019834,0.0005265787,0.00051753735,0.6009184,0.06531531,0.20991151,0.005910459,0.1156873],"study_design_scores_gemma":[0.00004367231,0.000080986254,0.00012928873,0.000017813543,0.000012405344,0.0002307011,0.00006145271,0.94121933,0.0062147016,0.046899453,0.005067036,0.00002313183],"about_ca_topic_score_codex":0.00073300407,"about_ca_topic_score_gemma":0.00048274983,"teacher_disagreement_score":0.004015607,"about_ca_system_score_codex":0.000341056,"about_ca_system_score_gemma":0.00023313162,"threshold_uncertainty_score":0.013433516},"labels":[],"label_agreement":null},{"id":"W2901926849","doi":"10.1007/978-3-030-13736-6_11","title":"IVD-Net: Intervertebral Disc Localization and Segmentation in MRI with a Multi-modal UNet","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Leverage (statistics); Modal; Discriminative model; Context (archaeology); Intervertebral disc; Medical imaging; Pattern recognition (psychology); Computer vision; Medicine; Radiology","score_opus":0.008346376777791528,"score_gpt":0.24373720525093662,"score_spread":0.23539082847314508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901926849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13722977,0.00381744,0.8206764,0.0012288708,0.0005887938,0.00038848215,0.0040845643,0.025142707,0.0068429974],"genre_scores_gemma":[0.5556768,0.0009963486,0.41767782,0.0013556427,0.00024186345,0.00035840852,0.009797671,0.0008067299,0.013088627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966013,0.00004685696,0.000017561277,0.00015228464,0.00006429568,0.000058881527],"domain_scores_gemma":[0.99967015,0.000089602145,0.000034602504,0.000082695464,0.00008255843,0.000040434985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088367506,0.0015089766,0.0009407041,0.0010649475,0.0004965024,0.001017726,0.002203327,0.0021084754,0.0027256033],"category_scores_gemma":[0.0016271702,0.00070405734,0.0013361163,0.00069013325,0.0006121706,0.0016304936,0.0019167272,0.0014653186,0.0016084671],"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.0013055793,0.0005997789,0.0086858645,0.0005084389,0.0005466726,0.00072647823,0.00023341342,0.24703884,0.038123433,0.0041105193,0.028314294,0.66980666],"study_design_scores_gemma":[0.000044364915,0.00016430236,0.0015228996,0.000046785368,0.000064447966,0.0003343504,0.000036939393,0.97764605,0.012155414,0.004069756,0.003887068,0.000027621143],"about_ca_topic_score_codex":0.008161102,"about_ca_topic_score_gemma":0.014986587,"teacher_disagreement_score":0.008161102,"about_ca_system_score_codex":0.0010232219,"about_ca_system_score_gemma":0.0009934542,"threshold_uncertainty_score":0.016227186},"labels":[],"label_agreement":null},{"id":"W2902138027","doi":"10.1007/978-3-030-17705-8_9","title":"Generating Responses Expressing Emotion in an Open-Domain Dialogue System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Alberta","funders":"","keywords":"Computer science; Sentence; Encoder; Artificial intelligence; Natural language processing; Artificial neural network; Open domain; Domain (mathematical analysis); Speech recognition; Machine learning; Question answering","score_opus":0.04062409163093213,"score_gpt":0.27503194008160775,"score_spread":0.23440784845067564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902138027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3378932,0.00015525198,0.6366428,0.00044320195,0.00023727867,0.0005660147,0.00046762818,0.015820434,0.0077742357],"genre_scores_gemma":[0.8085793,0.000080345664,0.17986177,0.0002639269,0.00008391143,0.00041408782,0.00077913736,0.0007916628,0.009145785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890614,0.00064400485,0.000044158085,0.00020557373,0.00013898623,0.00006117404],"domain_scores_gemma":[0.9959598,0.0033377495,0.00008759723,0.00016503395,0.00025861379,0.00019119444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001522805,0.0008422132,0.0007447004,0.0002666614,0.00040682335,0.0011977662,0.0011624099,0.001417676,0.007654037],"category_scores_gemma":[0.0052391947,0.00026877405,0.00039828557,0.0002029767,0.00049010676,0.00093516486,0.0016030448,0.0007148485,0.0022914372],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066304137,0.0020000467,0.004146796,0.0011761654,0.00024426277,0.0026932887,0.014978886,0.03719766,0.4970275,0.009288179,0.01704847,0.4075683],"study_design_scores_gemma":[0.0008124764,0.0019788058,0.0043734238,0.000113941875,0.00025839105,0.0009471231,0.0037497994,0.80005914,0.15502688,0.013522671,0.018947642,0.00020977293],"about_ca_topic_score_codex":0.00030451198,"about_ca_topic_score_gemma":0.00029556433,"teacher_disagreement_score":0.007654037,"about_ca_system_score_codex":0.00022188808,"about_ca_system_score_gemma":0.00020097024,"threshold_uncertainty_score":0.02560532},"labels":[],"label_agreement":null},{"id":"W2902732859","doi":"10.1007/978-3-030-34578-5","title":"Advances in Cryptology – ASIACRYPT 2019","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Microsoft Research; National Institute of Information and Communications Technology; Korea University; Radboud Universiteit; Queensland University of Technology; Indian Institute of Technology Madras; Université de Limoges; Universidad del Atlántico; Technische Universiteit Eindhoven; Florida Atlantic University; Nanyang Technological University","keywords":"Cryptocurrency; Anonymity; Computer science; Identifier; String (physics); Representation (politics); Set (abstract data type); Computer security; Internet privacy; Computer network; Mathematics; Programming language","score_opus":0.004670441304446952,"score_gpt":0.2424173450327593,"score_spread":0.23774690372831234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902732859","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013725099,0.06371332,0.09884548,0.065053016,0.05413729,0.00047963584,0.002097448,0.0040678615,0.6978808],"genre_scores_gemma":[0.17130622,0.041682955,0.043904185,0.006055464,0.015320566,0.00031210005,0.0046624555,0.0013308453,0.7154252],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974751,0.0006485436,0.00014734245,0.0002899991,0.0010717976,0.0003671355],"domain_scores_gemma":[0.9966556,0.00069479,0.0001837642,0.00094465836,0.0010729095,0.0004483241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044544274,0.0011766842,0.0010270384,0.0021652458,0.0012802698,0.0053276173,0.0010406367,0.0027340685,0.056525752],"category_scores_gemma":[0.005886424,0.0005654492,0.0005046567,0.0021710733,0.001997188,0.006856962,0.0032272297,0.004811052,0.04249515],"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.00039456645,0.00014982338,0.00039972147,0.00054199755,0.00003968486,0.00015313577,0.00006543233,0.0016865134,0.0031918625,0.21598405,0.34784052,0.42955267],"study_design_scores_gemma":[0.00006574885,0.00013187966,0.0005728889,0.00027745654,0.000018851844,0.00036167662,0.00003334189,0.004730715,0.0055201114,0.049947537,0.9383143,0.000025382982],"about_ca_topic_score_codex":0.001112822,"about_ca_topic_score_gemma":0.0010616977,"teacher_disagreement_score":0.056525752,"about_ca_system_score_codex":0.0030329335,"about_ca_system_score_gemma":0.003816914,"threshold_uncertainty_score":0.18909746},"labels":[],"label_agreement":null},{"id":"W2903118764","doi":"10.1007/978-3-030-19212-9_36","title":"Deep Inverse Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Computer science; Backpropagation; Leverage (statistics); Inverse; Inverse problem; Mathematical optimization; Parametric statistics; Optimization problem; Process (computing); Algorithm; Artificial intelligence; Set (abstract data type); Artificial neural network; Mathematics","score_opus":0.009558944436102227,"score_gpt":0.228805236371499,"score_spread":0.21924629193539677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903118764","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.0041391565,0.0023346301,0.8684162,0.00092269114,0.00072377146,0.00003339779,0.00032252158,0.0011068397,0.12200087],"genre_scores_gemma":[0.17258526,0.0036084608,0.4539334,0.00096449646,0.00067040144,0.00021165164,0.0016649341,0.0022508434,0.36411062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998337,0.000027684262,0.0000059328036,0.00003699116,0.000077694946,0.000017882861],"domain_scores_gemma":[0.99986804,0.00004274137,0.00001028316,0.000032530992,0.00002974152,0.000016663414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969905,0.00086123834,0.00092950324,0.00043492933,0.0003180532,0.000998293,0.0007223516,0.0009865594,0.023737779],"category_scores_gemma":[0.0008159178,0.00042091176,0.00062108703,0.0004781938,0.0006924252,0.0010057646,0.0018256675,0.0022223357,0.0076999194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009480654,0.00009215188,0.00020026151,0.00029379854,0.00007423667,0.000063361214,0.000050187227,0.16184357,0.006383914,0.3310054,0.06676939,0.433129],"study_design_scores_gemma":[0.000018432811,0.00004893835,0.0002253671,0.000097904005,0.000025064273,0.0001580575,0.00001997191,0.6666778,0.004770732,0.23991553,0.088013604,0.000028646771],"about_ca_topic_score_codex":0.0008574843,"about_ca_topic_score_gemma":0.0014463795,"teacher_disagreement_score":0.023737779,"about_ca_system_score_codex":0.00044380824,"about_ca_system_score_gemma":0.0005905975,"threshold_uncertainty_score":0.07941079},"labels":[],"label_agreement":null},{"id":"W2903570303","doi":"10.1007/978-3-030-05063-4_33","title":"Privacy-Preserving Task Allocation for Edge Computing Enhanced Mobile Crowdsensing","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Obfuscation; Enhanced Data Rates for GSM Evolution; Mobile edge computing; Crowdsensing; Differential privacy; Mobile device; Computer network; Distributed computing; Server; Computer security; Data mining; Artificial intelligence","score_opus":0.01611611825911926,"score_gpt":0.25922256523138026,"score_spread":0.243106446972261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903570303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018030614,0.0004956935,0.9755347,0.00028242296,0.0001686095,0.00009193149,0.00013390173,0.00055128505,0.0047109276],"genre_scores_gemma":[0.84107035,0.0004539543,0.14778364,0.00030188868,0.00022346678,0.00016060473,0.000252141,0.00016848512,0.009585402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845076,0.00033626758,0.00006830316,0.00037285878,0.00036253038,0.000409287],"domain_scores_gemma":[0.99849963,0.0006733527,0.00007632753,0.00041064224,0.0002246129,0.00011547062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011745313,0.0009920743,0.0015440682,0.0004536194,0.0012007784,0.0018283825,0.0024651259,0.0014318227,0.003956717],"category_scores_gemma":[0.0041921553,0.00040472162,0.0006504181,0.0010482091,0.0008168957,0.0019943614,0.003505087,0.0016612087,0.000999226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012021479,0.0004525319,0.00073365844,0.00035411763,0.00009033168,0.00041107164,0.0003535261,0.57004315,0.030634558,0.081398636,0.013915672,0.30041057],"study_design_scores_gemma":[0.000017268067,0.000062384635,0.00012289202,0.000009493303,0.0000103053735,0.0000986826,0.000055751945,0.95788324,0.0034525269,0.036184337,0.0020885249,0.000014554754],"about_ca_topic_score_codex":0.0015840417,"about_ca_topic_score_gemma":0.0017278148,"teacher_disagreement_score":0.003956717,"about_ca_system_score_codex":0.0007879414,"about_ca_system_score_gemma":0.001314043,"threshold_uncertainty_score":0.013236523},"labels":[],"label_agreement":null},{"id":"W2903608639","doi":"10.1007/978-3-030-05345-1_5","title":"Wearable Device Data for Criminal Investigation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"British Columbia Institute of Technology","funders":"","keywords":"Wearable computer; Suspect; Computer science; Phone; Wearable technology; Digital evidence; Human–computer interaction; Computer security; Criminal investigation; Data science; Internet privacy; Digital forensics; Criminology; Embedded system; Psychology","score_opus":0.09650556802178696,"score_gpt":0.3335559335424381,"score_spread":0.23705036552065117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903608639","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029957479,0.055607926,0.22417352,0.028617261,0.010017362,0.0005045334,0.0123584885,0.00490869,0.6338548],"genre_scores_gemma":[0.40208143,0.053491928,0.103439756,0.0066566463,0.0032650258,0.0005261255,0.016531674,0.0015068596,0.41250056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985905,0.0004131145,0.000105162406,0.000170562,0.0005806975,0.00013996744],"domain_scores_gemma":[0.99720156,0.0008817333,0.00024864892,0.00099747,0.00054549426,0.0001250661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280599,0.0009448954,0.00053842244,0.0023934266,0.0012622458,0.0041043297,0.0015491858,0.0023776419,0.038320385],"category_scores_gemma":[0.0060766498,0.00036696423,0.00059674814,0.002772525,0.0011101036,0.004409182,0.0030022599,0.0021268001,0.01806753],"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.00020456879,0.00011199466,0.002636497,0.0007227988,0.000054505996,0.0005847804,0.0009673552,0.0007726511,0.003187513,0.09039399,0.26103938,0.639324],"study_design_scores_gemma":[0.000019319199,0.00010723951,0.0032917394,0.0022092548,0.0000697924,0.0019699766,0.0010619645,0.0040339218,0.008063566,0.075159825,0.9039582,0.000055157285],"about_ca_topic_score_codex":0.000737098,"about_ca_topic_score_gemma":0.0015876105,"teacher_disagreement_score":0.038320385,"about_ca_system_score_codex":0.0006191272,"about_ca_system_score_gemma":0.0007731233,"threshold_uncertainty_score":0.12819451},"labels":[],"label_agreement":null},{"id":"W2903980682","doi":"10.1007/978-3-030-05051-1_34","title":"Parallel Communication Mechanisms in Solving Integral Equations for Electromagnetic Scattering Based on the Method of Moments","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","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":"Correctness; Computer science; Method of moments (probability theory); Integral equation; Reliability (semiconductor); Parallel algorithm; Acceleration; Moment (physics); Multi-core processor; Parallel computing; Algorithm; Mathematics; Mathematical analysis; Physics","score_opus":0.018610163397916702,"score_gpt":0.27239471866955955,"score_spread":0.25378455527164284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903980682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016537897,0.0012072914,0.9683867,0.0003520146,0.00031030952,0.000060922204,0.000031465002,0.00035006355,0.012763274],"genre_scores_gemma":[0.30632067,0.00204542,0.6756485,0.00029796964,0.00049002323,0.00028217738,0.00011548838,0.00073836086,0.014061444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921227,0.00027521804,0.000042419924,0.00007249021,0.00032145425,0.00007613365],"domain_scores_gemma":[0.99869734,0.0008256643,0.00007491647,0.00019197096,0.00017233688,0.000037779733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169821,0.0009223739,0.0011504561,0.00070838246,0.00092914765,0.0017600567,0.001876164,0.0013833618,0.0040128767],"category_scores_gemma":[0.0038160635,0.00048348372,0.0010687765,0.0014255084,0.0013149782,0.0035425355,0.0015809061,0.0025400417,0.00081854296],"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.00027501362,0.00019088681,0.00041230096,0.00033635978,0.000076782155,0.00021902737,0.0003861149,0.13968982,0.009675491,0.76293635,0.004618307,0.08118362],"study_design_scores_gemma":[0.000033862478,0.000032389675,0.00008694751,0.000022255792,0.000025621925,0.00012751724,0.000044907283,0.81793374,0.002861573,0.17522758,0.0035834294,0.000020216181],"about_ca_topic_score_codex":0.0010231497,"about_ca_topic_score_gemma":0.0012195162,"teacher_disagreement_score":0.0040128767,"about_ca_system_score_codex":0.00079563365,"about_ca_system_score_gemma":0.000796056,"threshold_uncertainty_score":0.013424456},"labels":[],"label_agreement":null},{"id":"W2904101382","doi":"10.1007/978-3-030-30281-8_10","title":"Fast Falsification of Hybrid Systems Using Probabilistically Adaptive Input","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Margin (machine learning); Computer science; Discretization; Key (lock); Tree (set theory); Feature (linguistics); Las vegas; Hybrid system; Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Machine learning","score_opus":0.05059250578223105,"score_gpt":0.3049642944555652,"score_spread":0.25437178867333415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904101382","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.05874596,0.00009891853,0.9361402,0.00021764848,0.0000843858,0.00006855546,0.000060051847,0.0024705674,0.0021137777],"genre_scores_gemma":[0.9085305,0.000057440346,0.08945494,0.00008690249,0.00003438527,0.000087526125,0.00008724045,0.00027638342,0.0013847772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99421304,0.0017338528,0.00027477025,0.0008133305,0.0023024231,0.00066250877],"domain_scores_gemma":[0.9728741,0.02008534,0.0011784165,0.0039303014,0.0016072111,0.0003246642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056138253,0.0013262162,0.001369096,0.000943421,0.00077591796,0.0020806855,0.0018647034,0.0014470023,0.0056395177],"category_scores_gemma":[0.020689936,0.0007653721,0.0016707368,0.0004875326,0.0030224663,0.0033703858,0.0045580626,0.0025612558,0.00057090336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032776038,0.00021568811,0.0035646507,0.0008428046,0.0002879769,0.0013292804,0.00091822876,0.5560809,0.055295527,0.22785226,0.0018007699,0.14853433],"study_design_scores_gemma":[0.00008580175,0.00014960411,0.00024210235,0.000042886702,0.000044537144,0.00011361347,0.000043938748,0.86430204,0.023976315,0.11025555,0.0007138826,0.000029745845],"about_ca_topic_score_codex":0.00080338476,"about_ca_topic_score_gemma":0.0008948909,"teacher_disagreement_score":0.0056395177,"about_ca_system_score_codex":0.0011163737,"about_ca_system_score_gemma":0.0012488075,"threshold_uncertainty_score":0.029689074},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"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":"W2904105956","doi":"10.1007/978-3-030-04375-9_9","title":"Robotic Catheter for Endovascular Surgery Using 3D Magnetic Guidance","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Endovascular surgery; Computer science; Visualization; Robotic surgery; Software; Image-guided surgery; Medical physics; Computer-assisted surgery; Surgery; Human–computer interaction; Medicine; Artificial intelligence; Operating system","score_opus":0.03487004457435374,"score_gpt":0.2628195348082509,"score_spread":0.22794949023389713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904105956","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.017187888,0.029480616,0.8734592,0.0016767504,0.0022908407,0.00008804986,0.00030416728,0.0051397197,0.070372745],"genre_scores_gemma":[0.2346893,0.02179329,0.62556034,0.0022903841,0.002506649,0.00019048649,0.0006993469,0.0010135932,0.111256674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997757,0.000030003364,0.000014710421,0.000040052335,0.00012342342,0.000016136035],"domain_scores_gemma":[0.9998073,0.0000818132,0.000022543541,0.000034270477,0.00003340424,0.000020768974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169351,0.000681689,0.0004244911,0.0010062706,0.0002857241,0.0010304434,0.0009611478,0.0015489344,0.009212446],"category_scores_gemma":[0.00050602324,0.00040204884,0.00071074185,0.0005027312,0.00034052704,0.0010241898,0.0007324894,0.0010667462,0.004495244],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023320889,0.000118138094,0.00056424964,0.0008766783,0.00009017607,0.0015448877,0.00022185734,0.0048237084,0.15549259,0.015625395,0.03837439,0.7820347],"study_design_scores_gemma":[0.00008584838,0.0009714987,0.0034622252,0.0004730514,0.00020185545,0.034200728,0.000059953785,0.0409361,0.100066915,0.012981245,0.8062343,0.00032626258],"about_ca_topic_score_codex":0.00022356851,"about_ca_topic_score_gemma":0.0004803137,"teacher_disagreement_score":0.009212446,"about_ca_system_score_codex":0.00018503758,"about_ca_system_score_gemma":0.00036408886,"threshold_uncertainty_score":0.030818641},"labels":[],"label_agreement":null},{"id":"W2904335795","doi":"10.1007/978-3-030-04375-9_2","title":"Affectional Ontology and Multimedia Dataset for Sentiment Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Ottawa","funders":"","keywords":"Ontology; Computer science; Domain (mathematical analysis); Sentiment analysis; Upper ontology; Information retrieval; Ontology-based data integration; Annotation; Natural language processing; Suggested Upper Merged Ontology; Ontology alignment; Artificial intelligence; Domain knowledge","score_opus":0.022809683507426484,"score_gpt":0.28833563940035917,"score_spread":0.2655259558929327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904335795","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069213465,0.00103343,0.011295757,0.0008414584,0.0007237962,0.0010787434,0.87968147,0.0088054165,0.027326437],"genre_scores_gemma":[0.034787938,0.00035369032,0.017228428,0.0001906423,0.000102861064,0.0008453979,0.93878037,0.0002555142,0.0074551725],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994449,0.00007180738,0.00006732388,0.000101105805,0.00023036046,0.0000845425],"domain_scores_gemma":[0.9993881,0.000106804226,0.000056930592,0.000115679555,0.0002475923,0.00008490767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056999456,0.0010511411,0.0004023926,0.004130095,0.0007576358,0.0008640465,0.00075792137,0.0007025395,0.0085678315],"category_scores_gemma":[0.0021658742,0.0001618321,0.0007476605,0.002895265,0.00020397002,0.0010223653,0.00088851963,0.00088273635,0.006845029],"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.0005212579,0.000679951,0.0064073615,0.0010976809,0.00012456486,0.00036223867,0.00028045237,0.0014613102,0.0167286,0.003680607,0.8251701,0.14348583],"study_design_scores_gemma":[0.00022334605,0.00021160404,0.043652497,0.00023950315,0.00017596158,0.00055715267,0.00093254185,0.021740312,0.017476875,0.004088113,0.9105788,0.00012328778],"about_ca_topic_score_codex":0.012065573,"about_ca_topic_score_gemma":0.02376826,"teacher_disagreement_score":0.012065573,"about_ca_system_score_codex":0.00083808484,"about_ca_system_score_gemma":0.0012064334,"threshold_uncertainty_score":0.028662264},"labels":[],"label_agreement":null},{"id":"W2904427283","doi":"10.1007/978-3-030-04375-9_30","title":"Adversarial Training for Dual-Stage Image Denoising Enhanced with Feature Matching","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Discriminator; Convolutional neural network; Pattern recognition (psychology); Noise reduction; Feature (linguistics); Benchmark (surveying); Noise (video); Image (mathematics); Video denoising; Computer vision","score_opus":0.025250067448849292,"score_gpt":0.28538815415682256,"score_spread":0.2601380867079733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904427283","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.0049264585,0.0002285946,0.9933056,0.000075352815,0.000038998834,0.000016001244,0.00003196029,0.00023231361,0.0011446289],"genre_scores_gemma":[0.40309066,0.0007008819,0.57598686,0.00031729223,0.00012784016,0.00016752334,0.00056588324,0.00031997968,0.018723045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996761,0.00007449805,0.000015831205,0.00008444473,0.00010028364,0.000048785125],"domain_scores_gemma":[0.99932885,0.00041433386,0.000041970252,0.00008998896,0.00009409999,0.000030746854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010763987,0.000871734,0.0010094787,0.0003602997,0.00023330151,0.0006101182,0.0014154541,0.0016651938,0.0037000405],"category_scores_gemma":[0.0024693743,0.0005152576,0.0008524152,0.00042136398,0.0007276297,0.0008712959,0.0018870124,0.0019471304,0.0011573711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036350483,0.00013165719,0.00058402005,0.00019997326,0.00011750643,0.00013323632,0.00008903607,0.6564227,0.022717675,0.02647065,0.0043700994,0.28839993],"study_design_scores_gemma":[0.0000041298376,0.000020910495,0.00005260875,0.0000066331186,0.000007213873,0.000027115268,0.0000028053623,0.9949922,0.001754393,0.00266483,0.00046297777,0.000004149894],"about_ca_topic_score_codex":0.0022531964,"about_ca_topic_score_gemma":0.0031212545,"teacher_disagreement_score":0.0037000405,"about_ca_system_score_codex":0.00044072306,"about_ca_system_score_gemma":0.0005921476,"threshold_uncertainty_score":0.012377918},"labels":[],"label_agreement":null},{"id":"W2904511705","doi":"10.1007/978-3-030-05057-3_30","title":"DStore: A Distributed Cloud Storage System Based on Smart Contracts and Blockchain","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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 Waterloo","funders":"","keywords":"Computer science; Smart contract; Merkle tree; Blockchain; Cloud computing; Hash function; Computer security; Audit; Cloud storage; Encryption; Distributed data store; Database; Computer network; Distributed computing; Cryptographic hash function; Operating system","score_opus":0.008624091136540677,"score_gpt":0.21408246509104278,"score_spread":0.20545837395450212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904511705","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.11910988,0.0022625457,0.7840428,0.0015795793,0.0007911221,0.0006691505,0.0019986737,0.023227237,0.066319056],"genre_scores_gemma":[0.7933004,0.0013184375,0.15631542,0.0003129065,0.00016738076,0.00023611312,0.0016917661,0.00081336184,0.045844235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996947,0.000055035263,0.000022662829,0.000053040945,0.00012510145,0.000049431485],"domain_scores_gemma":[0.99961025,0.00006971312,0.000020732628,0.0001669945,0.00006656299,0.000065767934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004000518,0.00040848737,0.0007316327,0.00045384027,0.0008173367,0.0015044614,0.0013067935,0.0007143442,0.012984312],"category_scores_gemma":[0.00083853735,0.00031854876,0.00028867193,0.0010174942,0.0007261574,0.003033474,0.0018365443,0.00083023414,0.0024996402],"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.0030051724,0.0005302838,0.0019228223,0.0009076985,0.00016232929,0.00087422185,0.00057766394,0.10927935,0.06980492,0.2597869,0.08576945,0.46737915],"study_design_scores_gemma":[0.00051159516,0.00032190722,0.001004651,0.00007507855,0.00009083751,0.0006948669,0.00014498291,0.6803994,0.05454363,0.08860137,0.17347729,0.000134332],"about_ca_topic_score_codex":0.0021222653,"about_ca_topic_score_gemma":0.002225081,"teacher_disagreement_score":0.012984312,"about_ca_system_score_codex":0.00061854714,"about_ca_system_score_gemma":0.001196881,"threshold_uncertainty_score":0.043436825},"labels":[],"label_agreement":null},{"id":"W2905374808","doi":"10.1007/978-3-030-04375-9_39","title":"EREL-Net: A Remedy for Industrial Bottle Defect Detection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","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 Alberta","funders":"","keywords":"Computer science; Bottle; Artificial intelligence; Classifier (UML); Bounding overwatch; Process (computing); Computer vision; Pattern recognition (psychology); Training set; Manufacturing process; Engineering","score_opus":0.03274848581710834,"score_gpt":0.2401842213640418,"score_spread":0.20743573554693345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905374808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03198996,0.0033899269,0.85127157,0.0015279131,0.0017752945,0.00025711858,0.0016154647,0.083954416,0.024218319],"genre_scores_gemma":[0.19840223,0.0017569956,0.6938888,0.0020836322,0.00049166544,0.00016475054,0.00392561,0.0043879026,0.09489841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992434,0.000055800825,0.000037088186,0.00018293105,0.00041540342,0.00006545289],"domain_scores_gemma":[0.9993388,0.00013434495,0.00008295117,0.00016149879,0.00022681558,0.0000555941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000760372,0.0013607738,0.00082295004,0.0015741894,0.00051181397,0.0011065356,0.0033324475,0.0020628064,0.010478081],"category_scores_gemma":[0.0012846685,0.0005332105,0.0007503057,0.0005674779,0.0005354372,0.0018522587,0.0018854063,0.0014456614,0.0061532483],"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.0005236292,0.0002797631,0.0013131136,0.00044281737,0.00009047471,0.0005797501,0.00006522543,0.009995264,0.03910907,0.0045501096,0.07401376,0.8690371],"study_design_scores_gemma":[0.00022098683,0.00079929526,0.0030546947,0.0002467549,0.0003115748,0.004251222,0.00016774492,0.49815527,0.22791982,0.016770238,0.24791384,0.00018867354],"about_ca_topic_score_codex":0.0010780836,"about_ca_topic_score_gemma":0.0020370076,"teacher_disagreement_score":0.010478081,"about_ca_system_score_codex":0.00052609283,"about_ca_system_score_gemma":0.00075435214,"threshold_uncertainty_score":0.035052657},"labels":[],"label_agreement":null},{"id":"W2905461731","doi":"10.1007/978-3-030-05345-1_14","title":"Balanced Iterative Reducing and Clustering Using Hierarchies with Principal Component Analysis (PBirch) for Intrusion Detection over Big Data in Mobile Cloud Environment","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 British Columbia","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Big data; Cloud computing; Principal component analysis; Intrusion detection system; CURE data clustering algorithm; Data stream clustering; Correlation clustering; k-means clustering; Artificial intelligence","score_opus":0.025837291666941615,"score_gpt":0.2497743538722025,"score_spread":0.22393706220526088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905461731","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.008250458,0.00083126384,0.9877724,0.00014077069,0.00010687914,0.00009795666,0.00016708979,0.001481063,0.0011521024],"genre_scores_gemma":[0.07436281,0.0005794476,0.9207572,0.00011612628,0.00008733262,0.00020478915,0.000857013,0.00032383628,0.0027114581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987112,0.00034905344,0.00007204389,0.00023167419,0.0004961239,0.00013990747],"domain_scores_gemma":[0.9990239,0.0002972167,0.000054864697,0.00019537674,0.00038013657,0.00004849584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010548759,0.0010747833,0.0011895762,0.0012763232,0.0012146593,0.0011159988,0.0017264278,0.00070155936,0.0024074854],"category_scores_gemma":[0.0026217077,0.00060054066,0.0014294792,0.002276854,0.0005535286,0.001245835,0.0015761205,0.0015736492,0.0013371743],"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.00023898618,0.00017757928,0.0014146416,0.0003123713,0.00024759315,0.00010512808,0.0002795942,0.086783096,0.014433073,0.011096551,0.016191842,0.8687196],"study_design_scores_gemma":[0.000022097867,0.00007764227,0.0017267757,0.000022546734,0.00006420297,0.000094751915,0.00009026051,0.9721256,0.00594671,0.013822072,0.0059692333,0.000038122602],"about_ca_topic_score_codex":0.012360769,"about_ca_topic_score_gemma":0.01768331,"teacher_disagreement_score":0.012360769,"about_ca_system_score_codex":0.0006941831,"about_ca_system_score_gemma":0.0018767258,"threshold_uncertainty_score":0.024577677},"labels":[],"label_agreement":null},{"id":"W2905572562","doi":"10.1007/978-3-030-04375-9_10","title":"Haptic Training in a Virtual Environment to Train Cognitive Functions of Medical Students: Work in Progress","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"University of Ottawa","keywords":"Gesture; Computer science; Haptic technology; Focus (optics); Human–computer interaction; Virtual reality; Multimedia; Virtual machine; Cognitive load; Gesture recognition; Software; Simulation; Cognition; Artificial intelligence","score_opus":0.03795246960903509,"score_gpt":0.31907962687889124,"score_spread":0.28112715726985615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905572562","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1876803,0.3471649,0.27133253,0.0036690265,0.005609822,0.00058168644,0.00074891653,0.004168734,0.17904413],"genre_scores_gemma":[0.3546214,0.1996379,0.2144069,0.0021623122,0.002229541,0.0006329129,0.0015573243,0.00076791336,0.2239838],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998253,0.000035978086,0.0000074512186,0.000024072127,0.00008178323,0.000025392908],"domain_scores_gemma":[0.99967456,0.00019444598,0.000010082334,0.000020889465,0.000056227233,0.000043732554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308749,0.0006744315,0.0004709178,0.0004374864,0.00013084838,0.001203326,0.0011611455,0.0007117576,0.016026733],"category_scores_gemma":[0.0007020985,0.00010786941,0.00044488074,0.00039277592,0.000268013,0.00069776806,0.0007480736,0.0005754486,0.002081767],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016552043,0.00071086665,0.00021910919,0.00075899175,0.000036510573,0.00008261925,0.00023837804,0.0010950655,0.018336087,0.0017399981,0.009259671,0.96735704],"study_design_scores_gemma":[0.0004821461,0.0081166215,0.020096676,0.0030757152,0.00040270473,0.0039337045,0.0013650773,0.021440666,0.08738729,0.012591354,0.8408872,0.00022096523],"about_ca_topic_score_codex":0.00052581733,"about_ca_topic_score_gemma":0.00048672076,"teacher_disagreement_score":0.016026733,"about_ca_system_score_codex":0.00018159323,"about_ca_system_score_gemma":0.0005662622,"threshold_uncertainty_score":0.053614795},"labels":[],"label_agreement":null},{"id":"W2905953446","doi":"10.1007/978-3-030-18126-0_2","title":"A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Partition (number theory); Approximation algorithm; Vertex cover; Partition problem; Combinatorics; Vertex (graph theory); Cover (algebra); Graph partition; Path (computing); Mathematics; Set cover problem; Computer science; Graph; Algorithm; Discrete mathematics; Set (abstract data type)","score_opus":0.026756811572567152,"score_gpt":0.25850266820173423,"score_spread":0.23174585662916708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905953446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060599517,0.0011407218,0.91113096,0.0010047326,0.0002623052,0.00043778718,0.00084705785,0.0048545906,0.01972228],"genre_scores_gemma":[0.12290929,0.00030984613,0.8634433,0.00031967575,0.00009540178,0.0005821539,0.0018760428,0.00054940005,0.009914957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.00014443335,0.00003509044,0.00016466231,0.0002162776,0.00014299304],"domain_scores_gemma":[0.9990501,0.00047239123,0.000069697584,0.0002045845,0.00010792049,0.000095313815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008391897,0.0013862158,0.0020750496,0.001381845,0.0010345909,0.0015197146,0.0035090048,0.0022121978,0.017314782],"category_scores_gemma":[0.002996512,0.00078936445,0.0013374526,0.0026749594,0.0007186853,0.002710126,0.0026240316,0.0027690306,0.0039055545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015357438,0.00085836236,0.0009348196,0.00057666947,0.000117778916,0.00020295194,0.0003789765,0.25750136,0.01240265,0.041286554,0.044970125,0.639234],"study_design_scores_gemma":[0.00037463423,0.00024719458,0.0003876303,0.000051614024,0.000055204087,0.0001600793,0.000112784845,0.9593514,0.002885957,0.029906683,0.0064406754,0.00002616023],"about_ca_topic_score_codex":0.0049055708,"about_ca_topic_score_gemma":0.0072296793,"teacher_disagreement_score":0.017314782,"about_ca_system_score_codex":0.002009333,"about_ca_system_score_gemma":0.0022420571,"threshold_uncertainty_score":0.057923734},"labels":[],"label_agreement":null},{"id":"W2906711838","doi":"10.1007/3-540-47922-8_3","title":"A Learning Algorithm for Buying and Selling Agents in Electronic Marketplaces","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Purchasing; Computer science; Reputation; Quality (philosophy); Product (mathematics); Reinforcement learning; Value (mathematics); Artificial intelligence; Business; Marketing; Machine learning","score_opus":0.05567478249732086,"score_gpt":0.3322672259117099,"score_spread":0.27659244341438904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906711838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032746956,0.00018612338,0.9636196,0.0003659739,0.00006731087,0.00013996346,0.0000677439,0.00072798366,0.002078391],"genre_scores_gemma":[0.40505433,0.00022881229,0.58606017,0.00023685516,0.00015630624,0.00038371855,0.00031568913,0.0001361921,0.007427864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990694,0.00032076615,0.000088206405,0.00021671112,0.00018593276,0.00011897801],"domain_scores_gemma":[0.9955604,0.0033914333,0.00017662511,0.0002101712,0.00050788216,0.00015353858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028255389,0.00083840115,0.001767952,0.0009221898,0.0010864162,0.0016463381,0.0036169053,0.0031690323,0.0052630464],"category_scores_gemma":[0.009613183,0.00089589774,0.00078402954,0.001365069,0.0015594497,0.00488047,0.002166904,0.0019741405,0.00079866254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044757692,0.00034226608,0.0018202568,0.00011909034,0.00007612498,0.000074111915,0.00014123594,0.64274466,0.00096464704,0.03212301,0.0039865687,0.3171605],"study_design_scores_gemma":[0.00004238712,0.000019631547,0.000050487917,0.000003766199,0.000006100123,0.000010341509,0.000007721845,0.98875743,0.00016385863,0.010769585,0.00016527725,0.000003465121],"about_ca_topic_score_codex":0.0040208013,"about_ca_topic_score_gemma":0.003118813,"teacher_disagreement_score":0.0052630464,"about_ca_system_score_codex":0.0014043568,"about_ca_system_score_gemma":0.0014699586,"threshold_uncertainty_score":0.017606676},"labels":[],"label_agreement":null},{"id":"W2907048315","doi":"10.1007/978-3-030-02931-9_6","title":"Evolutionary-Based Coverage Control Mechanism for Clustered Wireless Sensor Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Carleton University","funders":"","keywords":"Cluster analysis; Wireless sensor network; Computer science; Energy consumption; Particle swarm optimization; Distributed computing; Computer network; Redundancy (engineering); Protocol (science); Efficient energy use; Topology control; Wireless network; Wireless; Key distribution in wireless sensor networks; Engineering; Algorithm; Artificial intelligence","score_opus":0.010441326358133524,"score_gpt":0.21777838741650307,"score_spread":0.20733706105836955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907048315","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.119392894,0.00033324133,0.8753268,0.00015265633,0.00007188152,0.00005235794,0.00003315326,0.00039849585,0.004238543],"genre_scores_gemma":[0.9451495,0.0001023092,0.052412342,0.000045425502,0.000018607507,0.000044103508,0.00004082332,0.00002459855,0.0021623555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975616,0.000040882882,0.000010665914,0.00006834917,0.00007939122,0.000044636017],"domain_scores_gemma":[0.99953055,0.00014558747,0.000056482084,0.00008262566,0.00014682674,0.000037994378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036347986,0.0003081347,0.00038447842,0.00051812246,0.0004184635,0.0004097514,0.0016164029,0.00062621385,0.0013460732],"category_scores_gemma":[0.0012699497,0.00015437721,0.0002839459,0.0005220696,0.00034491683,0.0005864956,0.00072741066,0.00035505558,0.00013607123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028118546,0.00017494721,0.0015979975,0.00010603892,0.00009269958,0.0002742402,0.00022063262,0.64613795,0.08322693,0.03289248,0.0026300421,0.23236486],"study_design_scores_gemma":[0.000009446205,0.0000569276,0.00033909891,0.0000036285826,0.00001211921,0.0000804099,0.000014859732,0.99188316,0.0039104773,0.0030761128,0.00060706044,0.000006623121],"about_ca_topic_score_codex":0.0011196865,"about_ca_topic_score_gemma":0.0010482026,"teacher_disagreement_score":0.0016164029,"about_ca_system_score_codex":0.00047790806,"about_ca_system_score_gemma":0.00023732282,"threshold_uncertainty_score":0.0045030713},"labels":[],"label_agreement":null},{"id":"W2908132425","doi":"10.1007/978-3-030-02840-4_10","title":"Criminal Events Detection in News Stories Using Intuitive Classification","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Authorship Attribution and Profiling","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":"Polytechnique Montréal","funders":"","keywords":"Extortion; Computer science; Identification (biology); Process (computing); Homicide; Artificial intelligence; Natural language processing; Criminology; Machine learning; Information retrieval; Poison control; Political science; Human factors and ergonomics; Psychology; Law","score_opus":0.08034848186983104,"score_gpt":0.31990412870041895,"score_spread":0.23955564683058791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908132425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40474662,0.0038219248,0.5356819,0.0015197842,0.0011872662,0.00084570656,0.008043999,0.011750166,0.03240262],"genre_scores_gemma":[0.8011287,0.00065058406,0.17875166,0.00016887649,0.0005690913,0.00021563079,0.008157157,0.00022610092,0.010132233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988845,0.00021437294,0.00011683899,0.00029881042,0.0003002971,0.00018516956],"domain_scores_gemma":[0.9967963,0.0015180588,0.00032668072,0.00040158973,0.0007673708,0.00019005536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634911,0.0009870351,0.00057712884,0.004307757,0.0006796408,0.0022639008,0.0009116382,0.00095515884,0.0039988384],"category_scores_gemma":[0.0049764956,0.00025936292,0.0005469141,0.0022166502,0.00038631042,0.002794831,0.001367751,0.0008391908,0.0029222185],"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.00067516713,0.00049184443,0.03110582,0.00032399123,0.00009629824,0.0005611421,0.000645531,0.0035561766,0.022866886,0.0032856916,0.0271421,0.90924937],"study_design_scores_gemma":[0.000070137015,0.00037914116,0.0668614,0.0002534383,0.00024526656,0.0017547427,0.002112945,0.8086569,0.05551043,0.024886116,0.0391459,0.00012362735],"about_ca_topic_score_codex":0.0010052803,"about_ca_topic_score_gemma":0.0020762742,"teacher_disagreement_score":0.004307757,"about_ca_system_score_codex":0.00030899755,"about_ca_system_score_gemma":0.0003328041,"threshold_uncertainty_score":0.013377488},"labels":[],"label_agreement":null},{"id":"W2908395186","doi":"10.1007/978-3-030-02931-9_5","title":"An Obstacle-Aware Clustering Protocol for Wireless Sensor Networks with Irregular Terrain","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Cluster analysis; Non-line-of-sight propagation; Obstacle; Wireless sensor network; Energy consumption; Path (computing); Protocol (science); Network packet; Terrain; Real-time computing; Computer network; Packet loss; Path loss; Selection (genetic algorithm); Wireless; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.01712781875990676,"score_gpt":0.263244985332622,"score_spread":0.2461171665727152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908395186","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.030632116,0.000976711,0.95984393,0.0003049487,0.0003565079,0.00022526202,0.00014827767,0.0014751778,0.0060370173],"genre_scores_gemma":[0.47546792,0.0013692193,0.50889397,0.00020686054,0.00014510605,0.0004420737,0.000778455,0.0003031327,0.012393278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999694,0.000043944532,0.000021334174,0.000044862318,0.00015670976,0.00003919149],"domain_scores_gemma":[0.9994622,0.00016074209,0.000044677312,0.00013788893,0.00015574355,0.00003882602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039691615,0.0005701657,0.000664333,0.0007867912,0.0009964277,0.0005840459,0.002605369,0.0007236218,0.0013821601],"category_scores_gemma":[0.00133575,0.00035641974,0.0004330127,0.0013692934,0.000493021,0.0013198616,0.0020587142,0.0009553004,0.00052901584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028024032,0.00017858284,0.00071509887,0.00035426707,0.00012651952,0.00026068857,0.00036757303,0.48410824,0.038859613,0.036490757,0.015667967,0.42259052],"study_design_scores_gemma":[0.000027579303,0.00010536063,0.0005127765,0.000024301471,0.000045357327,0.0002551743,0.00009394959,0.9688873,0.009279503,0.011344714,0.009385771,0.00003823369],"about_ca_topic_score_codex":0.0026819343,"about_ca_topic_score_gemma":0.0049821516,"teacher_disagreement_score":0.0026819343,"about_ca_system_score_codex":0.0005424724,"about_ca_system_score_gemma":0.0008069844,"threshold_uncertainty_score":0.005332589},"labels":[],"label_agreement":null},{"id":"W2908562833","doi":"10.1007/978-3-030-06019-0_17","title":"DevOps’18 Education Panel","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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 Victoria","funders":"","keywords":"DevOps; Computer science; Engineering management; Software engineering; Process (computing); Curriculum; Session (web analytics); De facto; Panel discussion; Software; Knowledge management; Software deployment; Engineering; World Wide Web; Pedagogy; Business; Political science","score_opus":0.02789427056841679,"score_gpt":0.27108283550986856,"score_spread":0.24318856494145177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908562833","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005459598,0.0049847523,0.029640505,0.0972244,0.052676596,0.00048731896,0.00572323,0.0022397076,0.80156404],"genre_scores_gemma":[0.010206272,0.0029548747,0.004306242,0.00404813,0.002542188,0.00024045352,0.0034028809,0.00069709506,0.97160184],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796605,0.00021325743,0.00007599976,0.00022023456,0.0011083874,0.00041606664],"domain_scores_gemma":[0.9936977,0.00049180706,0.0001469513,0.00031663204,0.0028417276,0.0025052435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005675142,0.0010925455,0.00045859237,0.0021289212,0.001512553,0.0043845614,0.0012888889,0.0023095203,0.19929439],"category_scores_gemma":[0.004695989,0.00059690565,0.00066946656,0.0019284749,0.0005966622,0.0032549687,0.004108497,0.003119614,0.09751085],"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.000032949054,0.000067162364,0.0002124564,0.00007492153,0.0000021911792,0.000038626888,0.000055691296,0.00028993635,0.0003595256,0.005640737,0.9091343,0.084091455],"study_design_scores_gemma":[0.0000060465472,0.000018706934,0.00019377618,0.00007372352,0.0000014715882,0.000017429415,0.000048363818,0.00017352733,0.00027873187,0.0014307831,0.9977543,0.0000031109969],"about_ca_topic_score_codex":0.003983059,"about_ca_topic_score_gemma":0.009456332,"teacher_disagreement_score":0.19929439,"about_ca_system_score_codex":0.0019137558,"about_ca_system_score_gemma":0.00778466,"threshold_uncertainty_score":0.66670614},"labels":[],"label_agreement":null},{"id":"W2908603308","doi":"10.1007/978-3-030-10970-7_4","title":"Integral Attacks on Round-Reduced Bel-T-256","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Computer security","score_opus":0.02475309377687479,"score_gpt":0.2880603088840484,"score_spread":0.2633072151071736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908603308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25232747,0.0014971253,0.4378266,0.005749013,0.0010268344,0.00033565002,0.0010273966,0.0058139297,0.2943959],"genre_scores_gemma":[0.93075573,0.00039928412,0.02751934,0.0005539479,0.0001802705,0.00010409444,0.00040200262,0.00048497895,0.039600443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708986,0.00054688944,0.00011632427,0.00031531655,0.0011812096,0.0007502896],"domain_scores_gemma":[0.9971608,0.0010220242,0.0001758354,0.001224008,0.0002596489,0.00015782888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017881315,0.0008949886,0.0012251467,0.0011156241,0.0019213716,0.0029537613,0.0014060779,0.0018140415,0.016290179],"category_scores_gemma":[0.005757784,0.00066327647,0.0012358362,0.0012397647,0.0030057845,0.004879785,0.00575996,0.003222135,0.00521893],"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.0013261546,0.00012496277,0.00053604663,0.00018270186,0.00006377405,0.00026004715,0.00041730358,0.015037077,0.009831699,0.89285165,0.015572847,0.063795805],"study_design_scores_gemma":[0.00010024742,0.00018030549,0.00036075874,0.000083018196,0.000076774224,0.00044363798,0.0001206922,0.07276497,0.020138487,0.8837479,0.021916075,0.00006714637],"about_ca_topic_score_codex":0.0006452522,"about_ca_topic_score_gemma":0.00068668695,"teacher_disagreement_score":0.016290179,"about_ca_system_score_codex":0.002082195,"about_ca_system_score_gemma":0.0016255528,"threshold_uncertainty_score":0.05449611},"labels":[],"label_agreement":null},{"id":"W2908766116","doi":"10.1007/978-3-030-11072-7_14","title":"Group Search and Evacuation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Robot; Domain (mathematical analysis); Mobile robot; Search and rescue; Set (abstract data type); Wireless; Point (geometry); Group (periodic table); Communication in small groups; Line (geometry); Search problem; Artificial intelligence; Distributed computing; Algorithm; Mathematics","score_opus":0.024865138374666428,"score_gpt":0.26685571997669444,"score_spread":0.24199058160202802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908766116","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.018856024,0.015936771,0.4643123,0.0041706837,0.0026632827,0.00014911398,0.00046265288,0.00040187547,0.49304724],"genre_scores_gemma":[0.4130451,0.011763883,0.0841646,0.0009083606,0.0012107473,0.0003989823,0.00069641974,0.0004164405,0.48739547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998155,0.00007048897,0.000005279085,0.00003177841,0.000045289977,0.00003175254],"domain_scores_gemma":[0.99985886,0.00006737117,0.000014613149,0.000023100783,0.000017989674,0.00001795209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029001097,0.0008935155,0.0009055458,0.0006814922,0.0008661634,0.0014779156,0.0008139993,0.0014992574,0.024947014],"category_scores_gemma":[0.001298473,0.00027855154,0.0006954343,0.0013316757,0.0013437894,0.0016506936,0.0013868404,0.0017633833,0.0031477816],"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.000052489144,0.000027583521,0.00011360904,0.00014409379,0.000029958283,0.000058376503,0.00013029628,0.07677257,0.00045088507,0.82951635,0.033655897,0.059047885],"study_design_scores_gemma":[0.000024810968,0.000037252245,0.0001282534,0.000060776005,0.000014848546,0.000069048634,0.00011559678,0.07657451,0.00034942006,0.845775,0.076836996,0.000013477003],"about_ca_topic_score_codex":0.00177211,"about_ca_topic_score_gemma":0.0016119987,"teacher_disagreement_score":0.024947014,"about_ca_system_score_codex":0.00096519117,"about_ca_system_score_gemma":0.00065430335,"threshold_uncertainty_score":0.0834561},"labels":[],"label_agreement":null},{"id":"W2909776396","doi":"10.1007/978-3-030-11166-3_6","title":"Bone Adaptation as Level Set Motion","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Hotchkiss Brain Institute; Alberta Bone and Joint Health Institute; University of Calgary","funders":"","keywords":"Computer science; Bone remodeling; Adaptation (eye); Curvature; Set (abstract data type); Geometry; Mathematics; Neuroscience; Biology","score_opus":0.03335668811213266,"score_gpt":0.23326285429312518,"score_spread":0.19990616618099252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909776396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004893161,0.0008090769,0.98412466,0.00014525566,0.00011472031,0.000020780286,0.000065085434,0.0006629534,0.0091641955],"genre_scores_gemma":[0.43024576,0.0030173897,0.49848652,0.0003072067,0.00027272623,0.00013068125,0.00042604838,0.0013558118,0.06575788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984217,0.000026209877,0.0000064628416,0.00003571151,0.00007660003,0.000012757774],"domain_scores_gemma":[0.99985826,0.00007195556,0.000011712618,0.000026186788,0.00001928927,0.00001260361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002792421,0.00047122134,0.0006356485,0.0006075462,0.00016985896,0.00077417534,0.0008236125,0.0007711793,0.006838513],"category_scores_gemma":[0.00080775033,0.0004027299,0.0005075134,0.000783123,0.0005426839,0.00069618225,0.0010772055,0.0011134004,0.0018388237],"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.000120099314,0.000042678766,0.00016793003,0.00016509586,0.000059287235,0.00009992768,0.000083155624,0.3142873,0.04442351,0.18304238,0.007126729,0.45038196],"study_design_scores_gemma":[0.000007944998,0.000034373115,0.00020754963,0.00001517667,0.000013129742,0.0001259927,0.000009637821,0.9017107,0.0048535177,0.084152035,0.008854834,0.000015148718],"about_ca_topic_score_codex":0.00074386445,"about_ca_topic_score_gemma":0.0007594147,"teacher_disagreement_score":0.006838513,"about_ca_system_score_codex":0.00035256732,"about_ca_system_score_gemma":0.00018494215,"threshold_uncertainty_score":0.022877038},"labels":[],"label_agreement":null},{"id":"W2909853646","doi":"10.1007/978-3-030-10925-7_21","title":"Clustering in the Presence of Concept Drift","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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 Ottawa","funders":"","keywords":"Cluster analysis; Concept drift; Data stream mining; Computer science; Data mining; Code (set theory); Data stream; Ground truth; Artificial intelligence","score_opus":0.02139532863040184,"score_gpt":0.2617474650711539,"score_spread":0.24035213644075204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909853646","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.037144106,0.0024372526,0.95682573,0.00066548097,0.00019667266,0.00008521682,0.00021324767,0.0003767211,0.0020554496],"genre_scores_gemma":[0.44849148,0.0027110784,0.5341996,0.0002659245,0.0008270621,0.00019877261,0.0011464118,0.00032424965,0.0118355835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974954,0.00078923604,0.0001406974,0.000606124,0.0007613091,0.00020733551],"domain_scores_gemma":[0.9856046,0.010360611,0.0010142773,0.00096112484,0.0017046576,0.00035462662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007699522,0.0009034089,0.002320058,0.0031857283,0.0012172502,0.002727136,0.0028704458,0.0025361497,0.0011814013],"category_scores_gemma":[0.02127881,0.00088148814,0.0010501152,0.004520275,0.0012157746,0.0042049563,0.0022483415,0.0020808538,0.0006303876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072505674,0.00015463444,0.0054215984,0.0005022185,0.00042236442,0.00066654914,0.0008395675,0.55639005,0.0055240295,0.1207025,0.010489176,0.29816222],"study_design_scores_gemma":[0.000013714059,0.000032438442,0.00051730755,0.000016179698,0.00002518815,0.00012901689,0.00004857083,0.95381385,0.00074892724,0.04330526,0.0013314794,0.000018101642],"about_ca_topic_score_codex":0.00443169,"about_ca_topic_score_gemma":0.0034198347,"teacher_disagreement_score":0.007699522,"about_ca_system_score_codex":0.0016405478,"about_ca_system_score_gemma":0.0014723642,"threshold_uncertainty_score":0.04071945},"labels":[],"label_agreement":null},{"id":"W2911324515","doi":"10.1007/978-3-030-30281-8_20","title":"WiseMove: A Framework to Investigate Safe Deep Reinforcement Learning for Autonomous Driving","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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 Waterloo","funders":"","keywords":"Reinforcement learning; Modular design; Scalability; Context (archaeology); Software; Motion planning; Architecture; Deep learning","score_opus":0.00858529657000148,"score_gpt":0.2190842659755918,"score_spread":0.21049896940559032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911324515","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.01117722,0.00049584755,0.98241764,0.00024447645,0.00008056306,0.00003938695,0.00014416617,0.0006913489,0.0047092694],"genre_scores_gemma":[0.5533806,0.0007256797,0.42956784,0.00027363785,0.00009682916,0.00023981357,0.00041957342,0.0004864863,0.01480952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997842,0.00006464294,0.0000065185027,0.00005052246,0.00006107775,0.000033149903],"domain_scores_gemma":[0.9996606,0.00020061767,0.00002031313,0.000034773733,0.00004791463,0.000035866415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005747407,0.000793998,0.00056368345,0.00032630135,0.0004058368,0.00088299153,0.0019682194,0.0015409376,0.003826824],"category_scores_gemma":[0.0016673283,0.00053185225,0.00071230886,0.00026500356,0.0010795641,0.0010476694,0.0014946487,0.0021682645,0.0004458986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008084606,0.00006518847,0.00037888624,0.000089930996,0.00004732405,0.00008300712,0.00005296142,0.8374718,0.002232916,0.123269856,0.0028963452,0.033330984],"study_design_scores_gemma":[0.000004908927,0.000012947221,0.000023513037,0.000004283505,0.0000028346847,0.0000057899138,0.0000034214288,0.9749028,0.00030861786,0.023908785,0.0008197365,0.0000022951226],"about_ca_topic_score_codex":0.007263957,"about_ca_topic_score_gemma":0.009667765,"teacher_disagreement_score":0.007263957,"about_ca_system_score_codex":0.0009543461,"about_ca_system_score_gemma":0.0012857089,"threshold_uncertainty_score":0.014443338},"labels":[],"label_agreement":null},{"id":"W2911337866","doi":"10.1007/11744023_48","title":"Confocal Stereo","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer vision; Focus (optics); Computer science; Artificial intelligence; Radiance; Aperture (computer memory); Lens (geology); Pixel; Optics; Confocal; Point (geometry); Computer graphics (images); Physics; Mathematics; Geometry","score_opus":0.011421979735255683,"score_gpt":0.2344636381538966,"score_spread":0.2230416584186409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911337866","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.008782512,0.0013467364,0.691889,0.00031925229,0.00029919014,0.00013374297,0.0016191845,0.005570108,0.2900403],"genre_scores_gemma":[0.1164258,0.002623297,0.55030715,0.0004803584,0.00017679793,0.00017880725,0.003915648,0.0016111396,0.32428095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997476,0.000010689803,0.000006765722,0.00006790406,0.0001379908,0.000029057648],"domain_scores_gemma":[0.9997744,0.000021300717,0.000012289899,0.00008701054,0.00008408511,0.000020924612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019741905,0.0005816616,0.0004564982,0.0011123022,0.00045077148,0.0008781248,0.0008584244,0.00072994386,0.07083682],"category_scores_gemma":[0.0003291326,0.0005741743,0.0003455316,0.0007218537,0.00032057843,0.0009974141,0.0010711229,0.00085784955,0.029028121],"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.0001172583,0.00005534143,0.00044472457,0.00028932764,0.000025203546,0.00016382415,0.00008811326,0.002542583,0.24004139,0.06426089,0.072285265,0.619686],"study_design_scores_gemma":[0.000025411446,0.00010568379,0.0029415083,0.000109622124,0.000039972056,0.0039993273,0.00009225547,0.034941904,0.27848038,0.018311873,0.66087073,0.00008136843],"about_ca_topic_score_codex":0.0008323661,"about_ca_topic_score_gemma":0.0026941232,"teacher_disagreement_score":0.07083682,"about_ca_system_score_codex":0.0004495241,"about_ca_system_score_gemma":0.00064869155,"threshold_uncertainty_score":0.23697275},"labels":[],"label_agreement":null},{"id":"W2911338810","doi":"10.1007/978-3-642-37051-9_12","title":"Refactoring MATLAB","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Code refactoring; Scripting language; MATLAB; Computer science; Programming language; Compiler; Software engineering; Identifier; Code (set theory); Software; Source code; Set (abstract data type)","score_opus":0.019848291822083385,"score_gpt":0.2515606221234342,"score_spread":0.23171233030135083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911338810","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.003657664,0.0007061721,0.8570363,0.00034025582,0.0004319791,0.000097739474,0.001256314,0.10213354,0.034339983],"genre_scores_gemma":[0.0807899,0.0015747332,0.6783992,0.0009914901,0.00024092464,0.00031620913,0.008857609,0.09071804,0.13811181],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821657,0.00028493002,0.00016558943,0.00038884697,0.0008258731,0.00011809226],"domain_scores_gemma":[0.99655885,0.0009207239,0.00012456924,0.0015911185,0.0007614224,0.000043289834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012111957,0.0017390911,0.00080872374,0.0014696878,0.0006372839,0.0018793116,0.0028879014,0.0009253439,0.060570378],"category_scores_gemma":[0.007501434,0.0009570449,0.0016662723,0.0011359736,0.0007255988,0.0029586763,0.0023833436,0.0023599884,0.046807606],"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.00019795449,0.00006779527,0.00058851554,0.0008562426,0.00009309208,0.0005766427,0.00040411294,0.008518687,0.020443399,0.072122045,0.10701183,0.78911966],"study_design_scores_gemma":[0.00008134403,0.000067962435,0.00046812758,0.0004153571,0.00015009432,0.0015313505,0.00012751757,0.046522405,0.11384305,0.09238273,0.7442975,0.00011258089],"about_ca_topic_score_codex":0.0014156597,"about_ca_topic_score_gemma":0.0018634486,"teacher_disagreement_score":0.060570378,"about_ca_system_score_codex":0.0006539673,"about_ca_system_score_gemma":0.000834918,"threshold_uncertainty_score":0.20262808},"labels":[],"label_agreement":null},{"id":"W2911372736","doi":"10.1007/978-3-030-11021-5_28","title":"VisDrone-SOT2018: The Vision Meets Drone Single-Object Tracking Challenge Results","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":52,"is_retracted":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":"Computer science; Artificial intelligence; Computer vision; Clutter; BitTorrent tracker; Drone; Video tracking; Tracking (education); Benchmark (surveying); Eye tracking; Object (grammar); Bounding overwatch; Radar; Cartography","score_opus":0.03775203663814282,"score_gpt":0.2911304752830152,"score_spread":0.2533784386448724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911372736","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2280257,0.038922556,0.38191214,0.011456158,0.022753157,0.0028408158,0.10247498,0.06929953,0.14231487],"genre_scores_gemma":[0.23936717,0.004033643,0.25384894,0.0028858446,0.0014673519,0.0007461442,0.42503262,0.0033867923,0.06923155],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974074,0.00045062925,0.00010857648,0.00081227673,0.00085566286,0.0003655155],"domain_scores_gemma":[0.9980411,0.00051946833,0.000044548866,0.00054667034,0.0005281754,0.00032014246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035134095,0.003903086,0.004462701,0.001448323,0.0016119251,0.0031082574,0.0029978002,0.0037728033,0.006560622],"category_scores_gemma":[0.005818095,0.000582027,0.0015923618,0.0014158039,0.000856353,0.0025933834,0.0029657334,0.0030548018,0.0071107894],"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.001516427,0.0010220592,0.0017306971,0.0013088217,0.0005271949,0.00035538888,0.00018998656,0.040173773,0.010374583,0.006494842,0.534661,0.4016452],"study_design_scores_gemma":[0.0009165231,0.0014597541,0.0075977044,0.00037829808,0.000366011,0.0010326547,0.0006997561,0.625251,0.0302682,0.029691827,0.3021602,0.00017812946],"about_ca_topic_score_codex":0.026649352,"about_ca_topic_score_gemma":0.04015525,"teacher_disagreement_score":0.026649352,"about_ca_system_score_codex":0.00120143,"about_ca_system_score_gemma":0.002301232,"threshold_uncertainty_score":0.05298847},"labels":[],"label_agreement":null},{"id":"W2911456131","doi":"10.1007/978-3-030-43725-1_13","title":"SoK: Transparent Dishonesty: Front-Running Attacks on Blockchain","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blockchain; Front (military); Security token; Action (physics); Computer science; Computer security; Business; Engineering; Mechanical engineering; Physics","score_opus":0.02798319980261739,"score_gpt":0.27863448609817754,"score_spread":0.25065128629556016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911456131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096375115,0.0004315919,0.83574855,0.003661216,0.00081438944,0.00036805033,0.00095643103,0.021675898,0.03996872],"genre_scores_gemma":[0.92806226,0.0002738799,0.05074076,0.00053746725,0.00014063751,0.00021415293,0.0006465533,0.0014161848,0.01796817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950193,0.0017613855,0.00018560988,0.0005320423,0.0015855056,0.0009161202],"domain_scores_gemma":[0.98801476,0.0042007323,0.00043972125,0.0062422887,0.0005843298,0.0005182289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035330176,0.0009135115,0.0011563876,0.0008878244,0.0017368763,0.0034247735,0.0017950159,0.0027733068,0.013934808],"category_scores_gemma":[0.012917553,0.0008130268,0.0007914199,0.001033335,0.00323875,0.006604835,0.0075672115,0.004476401,0.0032958263],"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.0036017383,0.00037089607,0.0023156984,0.00042982821,0.00018024302,0.0007544663,0.00094024185,0.14612897,0.027831374,0.62807685,0.049399815,0.13996984],"study_design_scores_gemma":[0.00021457866,0.00014224274,0.00023514927,0.000049324997,0.000035558613,0.00016749743,0.00009244945,0.51743805,0.01750575,0.448889,0.015179165,0.000051294533],"about_ca_topic_score_codex":0.0012908346,"about_ca_topic_score_gemma":0.001229598,"teacher_disagreement_score":0.013934808,"about_ca_system_score_codex":0.00119987,"about_ca_system_score_gemma":0.0019426533,"threshold_uncertainty_score":0.046616614},"labels":[],"label_agreement":null},{"id":"W2911581138","doi":"10.1007/978-3-642-13688-7_14","title":"Exceptional Transformations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Dependability; Model transformation; Transformation (genetics); Debugging; Context (archaeology); Programming language; Exception handling; Model-based design; Model checking; Software engineering; Theoretical computer science; Artificial intelligence; Simulation","score_opus":0.012352193619804913,"score_gpt":0.23173521366647654,"score_spread":0.21938302004667162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911581138","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.022826107,0.00041993777,0.23218502,0.0009859032,0.0010336484,0.00010454214,0.0005655287,0.0037086902,0.7381706],"genre_scores_gemma":[0.52138424,0.0009903474,0.070344254,0.0008469961,0.00047754162,0.00017564475,0.0025238555,0.0028771718,0.40038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915695,0.000110918205,0.000046550616,0.00022327916,0.0003129181,0.00014943977],"domain_scores_gemma":[0.9992668,0.00013731416,0.000040603034,0.000350264,0.0001359363,0.0000691065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046583117,0.00063674804,0.00047961395,0.0011968884,0.0014389134,0.002321438,0.0008141242,0.00067702966,0.04066028],"category_scores_gemma":[0.0018497674,0.00033001052,0.0008819456,0.00087161147,0.0017664866,0.004092539,0.0030020687,0.0024955026,0.012659972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032203385,0.000026224521,0.00013755535,0.000049921455,0.000005822247,0.00012355136,0.00019406702,0.00036305992,0.0019674366,0.92966044,0.013913462,0.05352616],"study_design_scores_gemma":[0.000010025774,0.000019611678,0.00016970852,0.000026382424,0.000011425871,0.00044617758,0.00012707355,0.001855784,0.005614537,0.8388133,0.15289314,0.000012796064],"about_ca_topic_score_codex":0.00035290408,"about_ca_topic_score_gemma":0.00044209795,"teacher_disagreement_score":0.04066028,"about_ca_system_score_codex":0.0005814451,"about_ca_system_score_gemma":0.00058207137,"threshold_uncertainty_score":0.13602221},"labels":[],"label_agreement":null},{"id":"W2911586749","doi":"10.1007/978-3-642-16599-3_5","title":"Smart Interactions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Queen's University; University of Toronto; IBM (Canada)","funders":"","keywords":"Computer science; Smart environment; Human–computer interaction; Internet of Things; World Wide Web","score_opus":0.026379802284357153,"score_gpt":0.26508003165713534,"score_spread":0.23870022937277818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911586749","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009366405,0.0018023718,0.11035265,0.0015173352,0.0012509965,0.00022450811,0.0012298089,0.0052491114,0.86900675],"genre_scores_gemma":[0.1248352,0.002185857,0.056264427,0.0015832655,0.00035166673,0.00049821445,0.003202055,0.0010627136,0.8100166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994822,0.00007684283,0.000020962552,0.0001463593,0.00019954241,0.00007402825],"domain_scores_gemma":[0.9996232,0.00006620741,0.00002243063,0.000118656106,0.00007251144,0.000097116936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034235138,0.0011185799,0.00045924462,0.00063878647,0.0010097745,0.0022767219,0.0013763806,0.001188296,0.16237068],"category_scores_gemma":[0.001133947,0.00042302613,0.00044099893,0.00050068414,0.0006679161,0.003387336,0.0040658163,0.0012810994,0.07426739],"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.00027530192,0.00019182182,0.0008603657,0.0005612162,0.000032830492,0.0003359727,0.0016343805,0.0011458985,0.023099117,0.14771853,0.23186909,0.59227544],"study_design_scores_gemma":[0.00002543964,0.00010198891,0.0013446407,0.00015162733,0.000020954114,0.0006247453,0.0005750614,0.0028408917,0.005595798,0.038998503,0.9496845,0.00003581746],"about_ca_topic_score_codex":0.0005532981,"about_ca_topic_score_gemma":0.0012508878,"teacher_disagreement_score":0.16237068,"about_ca_system_score_codex":0.00032264745,"about_ca_system_score_gemma":0.0005001868,"threshold_uncertainty_score":0.54318404},"labels":[],"label_agreement":null},{"id":"W2911617544","doi":"10.1007/978-3-030-13435-8_15","title":"State Complexity of Pseudocatenation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Deterministic finite automaton; Combinatorics; Upper and lower bounds; State (computer science); Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; Word (group theory); Finite-state machine; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.025421893009769405,"score_gpt":0.24552281160870568,"score_spread":0.22010091859893627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911617544","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.632226,0.0011817061,0.21654177,0.0043387325,0.00021358582,0.00016002843,0.0021521524,0.0006381769,0.14254779],"genre_scores_gemma":[0.9774186,0.00037363154,0.008665024,0.00015486944,0.00015043236,0.00010316008,0.00064075756,0.00012473468,0.012368731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980564,0.00035370517,0.00010982702,0.00031974885,0.0008300016,0.00033032443],"domain_scores_gemma":[0.9874774,0.009608849,0.00051019725,0.0011538136,0.0008250591,0.00042461776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608398,0.00040367103,0.00094361923,0.0013274666,0.0015596969,0.0059954715,0.0015529349,0.0016599259,0.014500594],"category_scores_gemma":[0.009483621,0.0005822007,0.0012280921,0.001858142,0.0025256649,0.010164706,0.0023831644,0.0030760218,0.00080630294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001222087,0.000039861265,0.0005587784,0.00008473605,0.000012714984,0.000061799365,0.0002733321,0.011052297,0.0010434365,0.97579837,0.0017340584,0.009218403],"study_design_scores_gemma":[0.000012680762,0.000013630912,0.00032971366,0.000008239002,0.000009694465,0.00004831306,0.00005141177,0.041121177,0.0008311902,0.9566481,0.00091322383,0.000012530098],"about_ca_topic_score_codex":0.0017609451,"about_ca_topic_score_gemma":0.0013223101,"teacher_disagreement_score":0.014500594,"about_ca_system_score_codex":0.0025790832,"about_ca_system_score_gemma":0.0015139319,"threshold_uncertainty_score":0.0485093},"labels":[],"label_agreement":null},{"id":"W2911662480","doi":"10.1007/978-3-030-11015-4_55","title":"Increasing the Robustness of CNN-Based Human Body Segmentation in Range Images by Modeling Sensor-Specific Artifacts","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"National Research Council Canada","funders":"","keywords":"Computer science; Robustness (evolution); Artificial intelligence; Computer vision; Segmentation; Range (aeronautics); Image segmentation; Pattern recognition (psychology)","score_opus":0.026203362469982325,"score_gpt":0.2540230648703793,"score_spread":0.22781970240039695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911662480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15079746,0.0017097129,0.8306793,0.00038850846,0.00034858918,0.00008432279,0.0006299818,0.006753444,0.008608675],"genre_scores_gemma":[0.77737796,0.0010061836,0.20890991,0.0003845304,0.00014895471,0.00005131014,0.0016108158,0.0013699646,0.009140425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961734,0.000044695586,0.000015253385,0.00014540432,0.00011540677,0.00006197483],"domain_scores_gemma":[0.99947196,0.00019775466,0.00005763651,0.00012690539,0.000117052965,0.00002868788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402968,0.0013398681,0.000665252,0.00063201337,0.00019680297,0.00091303856,0.0010384757,0.0011644374,0.0033429768],"category_scores_gemma":[0.0020860974,0.00059351436,0.0007265052,0.00040788212,0.00037075416,0.00091011066,0.00088459876,0.0007334013,0.0015812328],"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.00065923954,0.00012294546,0.0027164773,0.00026736516,0.00029464858,0.00020695067,0.000088540786,0.25626743,0.19900316,0.0012910152,0.005091734,0.5339905],"study_design_scores_gemma":[0.000006729484,0.000058000634,0.0023936217,0.000025156234,0.000045646684,0.00014407384,0.000016154929,0.9567561,0.038314197,0.00088621257,0.0013410781,0.00001296499],"about_ca_topic_score_codex":0.0065215225,"about_ca_topic_score_gemma":0.008011956,"teacher_disagreement_score":0.0065215225,"about_ca_system_score_codex":0.00060280325,"about_ca_system_score_gemma":0.0004186151,"threshold_uncertainty_score":0.01296711},"labels":[],"label_agreement":null},{"id":"W2911867448","doi":"10.1007/978-3-642-39799-8_22","title":"Beautiful Interpolants","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Simple (philosophy); Computer science; Mathematical proof; Interpolation (computer graphics); Set (abstract data type); Heuristic; Algorithm; Theoretical computer science; Algebra over a field; Calculus (dental); Artificial intelligence; Programming language; Mathematics; Pure mathematics","score_opus":0.026175716744134124,"score_gpt":0.2763478119893099,"score_spread":0.2501720952451758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911867448","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013686115,0.010053407,0.56094027,0.0034782996,0.00522448,0.00006726982,0.0003418114,0.0013953414,0.4048129],"genre_scores_gemma":[0.31726795,0.013950426,0.29435775,0.00231877,0.0030773175,0.00022146132,0.00069877825,0.0031912501,0.36491624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928707,0.00015390152,0.000032438507,0.00015286356,0.0003007719,0.000073026466],"domain_scores_gemma":[0.99937207,0.00023163698,0.00003084943,0.00018797217,0.000117049305,0.000060557766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703455,0.0010804912,0.0008330743,0.0013819766,0.0013969683,0.0019619248,0.0012186709,0.0009976916,0.018874684],"category_scores_gemma":[0.0034723023,0.0006129018,0.0008492395,0.0010348344,0.0036220362,0.004937259,0.00346303,0.004650426,0.007095259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003244874,0.000008497785,0.00002583925,0.00006329853,0.0000054300986,0.000025603471,0.000088564244,0.00072254287,0.00061720615,0.9617915,0.0054916847,0.031127485],"study_design_scores_gemma":[0.000012851367,0.00003664276,0.000044694225,0.00009999262,0.000014494932,0.00015972041,0.00007547789,0.0037004102,0.0024687946,0.84765995,0.14570537,0.00002156355],"about_ca_topic_score_codex":0.00032515673,"about_ca_topic_score_gemma":0.00043237774,"teacher_disagreement_score":0.018874684,"about_ca_system_score_codex":0.0007247982,"about_ca_system_score_gemma":0.00046195643,"threshold_uncertainty_score":0.06314206},"labels":[],"label_agreement":null},{"id":"W2911999864","doi":"10.1007/978-3-030-12598-1_9","title":"GDE4: The Generalized Differential Evolution with Ordered Mutation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Ontario Tech University","funders":"","keywords":"Differential (mechanical device); Mutation; Mathematics; Genetics; Biology; Physics; Thermodynamics; Gene","score_opus":0.00984153339223182,"score_gpt":0.23364580304659055,"score_spread":0.22380426965435873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911999864","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.013212625,0.0008431832,0.9678801,0.00020637609,0.00036269077,0.00010512912,0.0003391574,0.0014009217,0.015649926],"genre_scores_gemma":[0.20342417,0.0011325896,0.7603569,0.00029799534,0.000110113375,0.00039698603,0.00087041216,0.00061929564,0.032791495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997563,0.000055421577,0.0000107209635,0.000034109613,0.0001151518,0.000028334201],"domain_scores_gemma":[0.999858,0.00005817354,0.000010256104,0.000026466827,0.000035754943,0.000011309604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040808786,0.0006509158,0.00092531566,0.00049470295,0.00030525753,0.0006632076,0.0014567176,0.0008854007,0.005918757],"category_scores_gemma":[0.00091227464,0.00020911763,0.00085755583,0.000928495,0.00046777705,0.00049476593,0.0009098727,0.0010989131,0.0010580482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120665,0.00006824008,0.00043624258,0.00034235325,0.00010226693,0.00020492876,0.000103043276,0.50314546,0.011868013,0.104804136,0.011422411,0.3673908],"study_design_scores_gemma":[0.000061207866,0.00009656303,0.00016791416,0.000030409112,0.000029714207,0.00013780706,0.00001341258,0.9224301,0.0041329605,0.040685926,0.03219222,0.000021872762],"about_ca_topic_score_codex":0.0021592726,"about_ca_topic_score_gemma":0.0016959646,"teacher_disagreement_score":0.005918757,"about_ca_system_score_codex":0.0005243886,"about_ca_system_score_gemma":0.00080094865,"threshold_uncertainty_score":0.019800246},"labels":[],"label_agreement":null},{"id":"W2912030618","doi":"10.1007/978-3-030-10928-8_7","title":"Social-Affiliation Networks: Patterns and the SOAR Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Soar; Computer science; Friendship; Recursion (computer science); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.012262455753848522,"score_gpt":0.24790682841461623,"score_spread":0.2356443726607677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912030618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21248734,0.002580953,0.64151925,0.012286765,0.00023096286,0.0002597756,0.0027234652,0.0009192852,0.12699233],"genre_scores_gemma":[0.9379916,0.001555955,0.03559771,0.000397206,0.0003059877,0.00023989004,0.00078265194,0.00013452569,0.022994544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978739,0.0009848332,0.00007678916,0.00050319015,0.00039248785,0.00016883992],"domain_scores_gemma":[0.9895744,0.0070171054,0.0012837143,0.001069054,0.0006297709,0.0004259941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030886712,0.00053842604,0.0011134588,0.0025164448,0.0013609702,0.004289898,0.00206624,0.0025092915,0.012632345],"category_scores_gemma":[0.019605024,0.00054601225,0.0009848455,0.0048405444,0.0021563638,0.009986116,0.0020125704,0.0015854344,0.0024186184],"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.000049324768,0.00005408062,0.0033944852,0.000108990906,0.000054257296,0.000099831756,0.00045211203,0.019956062,0.00038983676,0.9396519,0.005275248,0.030513892],"study_design_scores_gemma":[0.000016019909,0.000020796015,0.0011006964,0.000021916007,0.00002255245,0.00014465116,0.00016640691,0.11437175,0.00009059302,0.87997335,0.004057868,0.000013477025],"about_ca_topic_score_codex":0.0027561462,"about_ca_topic_score_gemma":0.0027490493,"teacher_disagreement_score":0.012632345,"about_ca_system_score_codex":0.0015688011,"about_ca_system_score_gemma":0.00075027643,"threshold_uncertainty_score":0.042259395},"labels":[],"label_agreement":null},{"id":"W2912187704","doi":"10.1007/3-540-45324-5_109","title":"Humboldt Heroes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"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":"Computer science; League; Quarter (Canadian coin); Code (set theory); Operations research; Programming language; History; Engineering; Archaeology; Physics","score_opus":0.023497611520950187,"score_gpt":0.2601918604175893,"score_spread":0.2366942488966391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912187704","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025966195,0.028753895,0.004328391,0.0096932305,0.007287763,0.000024502902,0.0003063738,0.00037960682,0.94662964],"genre_scores_gemma":[0.009435819,0.006491409,0.0010072325,0.0008480276,0.0006327594,0.000015044648,0.00008194597,0.0001612648,0.98132646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997507,0.000042087275,0.000006487913,0.000055956443,0.000107440304,0.00003748035],"domain_scores_gemma":[0.99983084,0.00003482741,0.000012721073,0.000025681618,0.000048850503,0.000046964553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003194389,0.0009165516,0.00041475653,0.0011895286,0.0015598766,0.0022020652,0.00041391936,0.00097180257,0.07492513],"category_scores_gemma":[0.00078217324,0.0002792831,0.00021763219,0.00078847405,0.0011596915,0.0020453092,0.0019775012,0.0020039303,0.05167219],"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.00003715323,0.000025436388,0.0001419686,0.00010475379,0.0000053255976,0.00013888716,0.00058641727,0.00027566543,0.00048816213,0.27451703,0.54756653,0.17611265],"study_design_scores_gemma":[0.0000010883074,0.000004190494,0.00004721573,0.000038108177,8.119617e-7,0.00006580893,0.00003383743,0.000034874876,0.00013324435,0.008757466,0.99088144,0.0000019571382],"about_ca_topic_score_codex":0.0007502886,"about_ca_topic_score_gemma":0.0018674762,"teacher_disagreement_score":0.07492513,"about_ca_system_score_codex":0.0009896184,"about_ca_system_score_gemma":0.00075407757,"threshold_uncertainty_score":0.2506495},"labels":[],"label_agreement":null},{"id":"W2912223110","doi":"10.1007/978-3-030-12029-0_8","title":"How Accurately Does Transesophageal Echocardiography Identify the Mitral Valve?","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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; Robarts Clinical Trials","funders":"","keywords":"Mitral valve; Mitral regurgitation; Segmentation; Computer science; Cardiac cycle; Ground truth; Biomedical engineering; Radiology; Cardiology; Medicine; Artificial intelligence","score_opus":0.019534494030381707,"score_gpt":0.3089506643200795,"score_spread":0.2894161702896978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912223110","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06191706,0.589784,0.07959415,0.109674476,0.022249792,0.00008000639,0.0009613929,0.0009160396,0.13482302],"genre_scores_gemma":[0.33220094,0.4945074,0.070128985,0.02638795,0.02645186,0.000065074266,0.0007254379,0.0006356891,0.048896607],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994624,0.00015234166,0.000056806068,0.00006395906,0.00023167206,0.000032855358],"domain_scores_gemma":[0.99654984,0.0025730573,0.00020896556,0.000104650666,0.00044961512,0.00011375528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022747125,0.00052685005,0.00081647036,0.0012249617,0.00011253567,0.0017818154,0.00053954567,0.00165801,0.0027650187],"category_scores_gemma":[0.0115085775,0.0002841452,0.00030842333,0.00045679352,0.0007630683,0.0030558591,0.00036023304,0.0016634578,0.006242723],"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.00013910633,0.000064760075,0.020845752,0.0006496049,0.00008781152,0.0010539016,0.00023482667,0.0005523985,0.005865807,0.0029713553,0.06526879,0.9022658],"study_design_scores_gemma":[0.00012013819,0.0013044819,0.12643284,0.008388093,0.00073995715,0.09489414,0.0035024881,0.013095751,0.0268607,0.06876018,0.6555015,0.00039972822],"about_ca_topic_score_codex":0.0005428021,"about_ca_topic_score_gemma":0.000981221,"teacher_disagreement_score":0.0027650187,"about_ca_system_score_codex":0.00021395362,"about_ca_system_score_gemma":0.00025199662,"threshold_uncertainty_score":0.012029946},"labels":[],"label_agreement":null},{"id":"W2912255742","doi":"10.1007/978-3-030-10928-8_21","title":"MASAGA: A Linearly-Convergent Stochastic First-Order Method for Optimization on Manifolds","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rate of convergence; Stochastic gradient descent; Variance reduction; Riemannian manifold; Convergence (economics); Manifold (fluid mechanics); Applied mathematics; Eigenvalues and eigenvectors; Computer science; Mathematical optimization; Stochastic optimization; Mathematics; Variance (accounting); Gradient descent; Convex function; Regular polygon; Mathematical analysis; Key (lock); Artificial intelligence; Statistics; Geometry","score_opus":0.019134214433650144,"score_gpt":0.2667438314597867,"score_spread":0.24760961702613654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912255742","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.0028470694,0.00022803897,0.99392647,0.00010064137,0.0001333841,0.000024863162,0.00004563616,0.00043956458,0.0022543117],"genre_scores_gemma":[0.08964574,0.00041250393,0.8918499,0.00018251638,0.0001921227,0.00023686729,0.00019331403,0.00086129864,0.016425818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997563,0.000075915974,0.000010649845,0.000027468317,0.00011411835,0.000015525815],"domain_scores_gemma":[0.99954766,0.00020637069,0.00002992543,0.000045475044,0.000119163655,0.000051398147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005715518,0.0009087312,0.0009650196,0.00048772228,0.00039828368,0.0007575553,0.0012403068,0.0012488426,0.0039761527],"category_scores_gemma":[0.0015670969,0.00040918987,0.0008260963,0.0004536192,0.0008204737,0.0007625152,0.0014645262,0.002013443,0.0015630121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002801785,0.00012874605,0.00036831017,0.00040416679,0.00013160713,0.00012693535,0.00015404681,0.5144657,0.023922233,0.21196638,0.014646397,0.23340523],"study_design_scores_gemma":[0.000010240764,0.000022965329,0.000031822536,0.000007649501,0.000005313714,0.000015849666,0.0000030317458,0.9853873,0.0009798311,0.010197138,0.0033311318,0.000007784204],"about_ca_topic_score_codex":0.002277622,"about_ca_topic_score_gemma":0.0030211764,"teacher_disagreement_score":0.0039761527,"about_ca_system_score_codex":0.00053375185,"about_ca_system_score_gemma":0.000982153,"threshold_uncertainty_score":0.013301611},"labels":[],"label_agreement":null},{"id":"W2912398006","doi":"","title":"Proceedings of the 6th international conference on Unconventional Computation","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Computer science; Computation; Operations research; Programming language","score_opus":0.027073066745049636,"score_gpt":0.2793099906282624,"score_spread":0.2522369238832128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912398006","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018610384,0.062748745,0.22110507,0.027037578,0.07294948,0.00025616368,0.0012918374,0.0028490087,0.59315175],"genre_scores_gemma":[0.12749693,0.033014476,0.10206843,0.0036596952,0.014852627,0.00031959693,0.0041866917,0.002263299,0.7121383],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993771,0.00015722914,0.000030190038,0.00013594519,0.00020310128,0.000096465425],"domain_scores_gemma":[0.99900085,0.00025418724,0.000024584975,0.00028864233,0.0002563764,0.00017540099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518915,0.0008943353,0.0011923874,0.00071061176,0.001233912,0.0044734417,0.0014107507,0.001034015,0.07913558],"category_scores_gemma":[0.0019644464,0.0003511981,0.00077319256,0.0010436872,0.0013537639,0.0035079697,0.0022619232,0.0025061474,0.020689826],"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.00040563697,0.00015671288,0.00045747994,0.00036494047,0.000075424,0.00014242754,0.00026161058,0.0025702836,0.003795182,0.14953738,0.59395695,0.24827613],"study_design_scores_gemma":[0.00003990021,0.00004643759,0.0005202733,0.00017897354,0.00003697846,0.00019465039,0.00009546092,0.0090940595,0.0023220722,0.09888512,0.88856256,0.000023500546],"about_ca_topic_score_codex":0.0014671604,"about_ca_topic_score_gemma":0.00274044,"teacher_disagreement_score":0.07913558,"about_ca_system_score_codex":0.0010550783,"about_ca_system_score_gemma":0.0012271736,"threshold_uncertainty_score":0.26473492},"labels":[],"label_agreement":null},{"id":"W2912471790","doi":"10.1007/978-3-030-12143-3_16","title":"Connection Dumping Vulnerability Affecting Bluetooth Availability","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bluetooth; Vulnerability (computing); Wireless; Computer security; Computer science; Exploit; Disconnection; Computer network; Telecommunications","score_opus":0.024582226146115646,"score_gpt":0.2589511787850588,"score_spread":0.23436895263894314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912471790","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9469618,0.0006970046,0.0353455,0.00047709155,0.00018779798,0.00007422714,0.00027911508,0.0018316078,0.014145803],"genre_scores_gemma":[0.9972018,0.00007404589,0.0014479486,0.00003855239,0.000019364183,0.00000799178,0.00006938364,0.000083510226,0.0010574246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976605,0.00040972335,0.00010446958,0.00038759064,0.0009436074,0.00049417524],"domain_scores_gemma":[0.9658254,0.022967976,0.0030285867,0.0045217224,0.0029298735,0.00072643463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012090523,0.0004297237,0.00038758363,0.001232213,0.0008097482,0.0014825086,0.0010076588,0.001104272,0.0039719096],"category_scores_gemma":[0.021205664,0.00041530412,0.0003607434,0.0010496075,0.0007039667,0.0025542704,0.0011741929,0.0016262013,0.00069038785],"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.002774742,0.0009927165,0.14241767,0.0009413191,0.0004538932,0.009540191,0.0024716551,0.18585707,0.29825604,0.032610476,0.01686769,0.30681658],"study_design_scores_gemma":[0.00006622245,0.0019041398,0.08405297,0.00028169338,0.0008739901,0.020453576,0.0015639287,0.6450355,0.21787798,0.019316334,0.008325868,0.0002478259],"about_ca_topic_score_codex":0.0009042227,"about_ca_topic_score_gemma":0.0010152681,"teacher_disagreement_score":0.0039719096,"about_ca_system_score_codex":0.00083074416,"about_ca_system_score_gemma":0.00042912687,"threshold_uncertainty_score":0.013287365},"labels":[],"label_agreement":null},{"id":"W2912843637","doi":"10.1007/978-3-662-58768-3_2","title":"Descriptive Topological Spaces for Performing Visual Search","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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 Winnipeg","funders":"","keywords":"Computer science; Visual search; Context (archaeology); Artificial intelligence; Object (grammar); Process (computing); Pattern recognition (psychology); Convolutional neural network; Theoretical computer science; Topology (electrical circuits); Mathematics; Geography","score_opus":0.04198570262866723,"score_gpt":0.3104330522667856,"score_spread":0.26844734963811834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912843637","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.008335394,0.0009172401,0.9839027,0.00012903451,0.00006190972,0.000030931977,0.00028272887,0.00062960474,0.0057103685],"genre_scores_gemma":[0.24940091,0.0017555753,0.734432,0.00009988519,0.00013498841,0.0002675191,0.0012674532,0.00041884094,0.012222841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997048,0.00007575556,0.000029246843,0.000057975005,0.0001048725,0.000027369553],"domain_scores_gemma":[0.999258,0.00033228737,0.000058638332,0.00016545404,0.00012846457,0.000057251247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046034472,0.00068064,0.00057752256,0.0017026764,0.0004679856,0.0023143676,0.0011347412,0.0007142799,0.0065679695],"category_scores_gemma":[0.0021160245,0.0003485978,0.000551662,0.0021508161,0.0011919076,0.0036294262,0.0014574163,0.001192187,0.0014212135],"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.000075494085,0.000025899668,0.00021535961,0.0002186499,0.000017125445,0.000038507158,0.0002169351,0.014640955,0.0052342378,0.8591525,0.0048886454,0.11527566],"study_design_scores_gemma":[0.000013608693,0.000086809174,0.00025843107,0.00005200631,0.000018457638,0.00012046388,0.00016930923,0.19609341,0.0037402525,0.7750383,0.024381202,0.000027639526],"about_ca_topic_score_codex":0.0010606716,"about_ca_topic_score_gemma":0.0013128795,"teacher_disagreement_score":0.0065679695,"about_ca_system_score_codex":0.0006369083,"about_ca_system_score_gemma":0.00047717022,"threshold_uncertainty_score":0.021972},"labels":[],"label_agreement":null},{"id":"W2912875245","doi":"10.1007/978-3-540-79723-4_17","title":"Parameterized Chess","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Class (philosophy); Computer science; Mathematics; Mathematical economics; Artificial intelligence; Algorithm","score_opus":0.04138271908632098,"score_gpt":0.2748051032470701,"score_spread":0.2334223841607491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912875245","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019364499,0.001066162,0.23584619,0.0007089208,0.00043105424,0.00016647602,0.0014792958,0.0029817522,0.73795563],"genre_scores_gemma":[0.37519187,0.0014923343,0.13240866,0.00028361595,0.00018952916,0.00023248844,0.004441525,0.0012687545,0.48449123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997347,0.000040061503,0.000017193699,0.00008337034,0.00008741662,0.000037366826],"domain_scores_gemma":[0.99971014,0.00008289681,0.000015842981,0.000097767086,0.000054721782,0.000038621947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019920402,0.0010413805,0.0006013053,0.0006564129,0.00075659214,0.0020254652,0.0011018799,0.0006787058,0.11059418],"category_scores_gemma":[0.0014780697,0.00044476686,0.0005590855,0.00087384426,0.00072643737,0.0022729414,0.0012486011,0.0014690176,0.020191172],"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.0001941289,0.0001000436,0.0003649326,0.0002366268,0.000033349985,0.00009168251,0.00011804826,0.02124395,0.0031583929,0.62293273,0.06731104,0.28421512],"study_design_scores_gemma":[0.000076893455,0.000079245234,0.00079622306,0.00011587026,0.000026916001,0.00022036197,0.00008061216,0.051838428,0.003091141,0.71310425,0.23053698,0.00003313005],"about_ca_topic_score_codex":0.0011879824,"about_ca_topic_score_gemma":0.001940371,"teacher_disagreement_score":0.11059418,"about_ca_system_score_codex":0.00090345537,"about_ca_system_score_gemma":0.00065085466,"threshold_uncertainty_score":0.36997437},"labels":[],"label_agreement":null},{"id":"W2912975828","doi":"10.1007/978-3-642-10868-6_1","title":"Subspace Codes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Decoding methods; Block code; Subspace topology; Linear code; Linear network coding; Coding (social sciences); Algorithm; Metric (unit); Theoretical computer science; Concatenated error correction code; Context (archaeology); Network packet; Mathematics; Artificial intelligence; Computer network","score_opus":0.032139246894722855,"score_gpt":0.2742617203431941,"score_spread":0.24212247344847126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912975828","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.016790666,0.0043371916,0.53244275,0.0015597324,0.0017492662,0.000148054,0.002238826,0.0018650024,0.43886852],"genre_scores_gemma":[0.28483045,0.008700126,0.22503261,0.0020311482,0.0016478492,0.0004650989,0.006615993,0.0017354115,0.46894136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994967,0.000089732304,0.000021018006,0.00008121216,0.00024352208,0.00006787898],"domain_scores_gemma":[0.999443,0.00010537993,0.00003723556,0.00018495337,0.00018146342,0.000047857484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034735393,0.00070200686,0.00055706286,0.0012946677,0.00070497143,0.0013151967,0.0005580641,0.0007487033,0.031437695],"category_scores_gemma":[0.0014648136,0.00027100186,0.00041494676,0.0015712425,0.0008492364,0.0015697059,0.0017048831,0.0016525979,0.017334143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006670956,0.00002330164,0.00012143612,0.000105570645,0.0000119457745,0.00003381637,0.00007091964,0.005258884,0.002629536,0.7693104,0.036398266,0.18596917],"study_design_scores_gemma":[0.000021194113,0.000058836446,0.00021703598,0.000093061404,0.000011678733,0.00033044018,0.000053650238,0.018098062,0.006267069,0.7897222,0.18508905,0.00003768112],"about_ca_topic_score_codex":0.00045121065,"about_ca_topic_score_gemma":0.00053544255,"teacher_disagreement_score":0.031437695,"about_ca_system_score_codex":0.0005022735,"about_ca_system_score_gemma":0.00083538995,"threshold_uncertainty_score":0.105169594},"labels":[],"label_agreement":null},{"id":"W2913164463","doi":"10.1007/978-3-642-31653-1_28","title":"Pseudoperiodic Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Computer science; Word (group theory); Simple (philosophy); Natural number; Period (music); Natural (archaeology); Palindrome; Combinatorics; Artificial intelligence; Natural language processing; Arithmetic; Mathematics; Linguistics; History; Philosophy","score_opus":0.01386970247357725,"score_gpt":0.2304507232981848,"score_spread":0.21658102082460756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913164463","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.02765614,0.0031151704,0.08269183,0.0018873052,0.0027711948,0.00008209048,0.00060115784,0.000585861,0.8806093],"genre_scores_gemma":[0.36966395,0.0040290505,0.034830265,0.0012527973,0.0020951992,0.0003309999,0.0014832215,0.00082458736,0.58548987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973744,0.00006185331,0.000020532994,0.00005952115,0.00008356822,0.000037127018],"domain_scores_gemma":[0.9997054,0.00009087075,0.000026811616,0.000080804166,0.00006793999,0.0000281858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019041222,0.00054631993,0.00038696892,0.0009838027,0.0011523805,0.0020314106,0.00041670856,0.00061511504,0.028082304],"category_scores_gemma":[0.0010204659,0.0002543719,0.00031061348,0.0010057766,0.0013709337,0.0032039862,0.0011736434,0.0011617856,0.009561074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018128323,0.0000038869703,0.000031111766,0.00003929503,0.000002288325,0.000050953928,0.00018276335,0.00008766674,0.0008602044,0.9638369,0.010124821,0.024761928],"study_design_scores_gemma":[0.0000093199915,0.000022788634,0.00013685795,0.000035612877,0.0000065378445,0.0004075639,0.00015991926,0.00063142134,0.0013363609,0.76109767,0.23614539,0.000010517864],"about_ca_topic_score_codex":0.00014035372,"about_ca_topic_score_gemma":0.00017206073,"teacher_disagreement_score":0.028082304,"about_ca_system_score_codex":0.0005183134,"about_ca_system_score_gemma":0.00033097746,"threshold_uncertainty_score":0.09394467},"labels":[],"label_agreement":null},{"id":"W2913720416","doi":"10.1007/978-3-030-11726-9_23","title":"3D U-Net for Brain Tumour Segmentation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Segmentation; Artificial intelligence; Cross entropy; Dice; Convolutional neural network; Categorical variable; Artificial neural network; Pattern recognition (psychology); Metric (unit); Network architecture; Machine learning; Statistics","score_opus":0.019093234430721657,"score_gpt":0.27552831876517847,"score_spread":0.25643508433445683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913720416","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.009722019,0.0023818617,0.96525884,0.000320015,0.00025706427,0.00015096269,0.001631202,0.011629981,0.00864804],"genre_scores_gemma":[0.10713708,0.002374518,0.8660705,0.00047969757,0.00017358837,0.00028761313,0.002842983,0.002141864,0.018492179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999788,0.000030030813,0.000013122969,0.00005015655,0.00008949553,0.000029280645],"domain_scores_gemma":[0.9998197,0.00006680972,0.000014715404,0.000035798952,0.000047944053,0.000015127528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004363691,0.0012906239,0.0008036516,0.0014818572,0.0004492801,0.0018319348,0.0013800964,0.0017693326,0.012478242],"category_scores_gemma":[0.0007323659,0.0008150789,0.0010927775,0.0012570554,0.0003029835,0.0008455677,0.0012778158,0.00071656314,0.0052679866],"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.00036641094,0.00006527924,0.00072179944,0.00039444744,0.000104221355,0.00034098918,0.00008929415,0.07952537,0.02313827,0.008065998,0.03330987,0.85387796],"study_design_scores_gemma":[0.000018433064,0.00007610586,0.00064833387,0.000094904615,0.00005359002,0.0007239893,0.00003881269,0.93245983,0.030045977,0.0082166,0.027581338,0.000042193504],"about_ca_topic_score_codex":0.004399856,"about_ca_topic_score_gemma":0.007896301,"teacher_disagreement_score":0.012478242,"about_ca_system_score_codex":0.0006318339,"about_ca_system_score_gemma":0.0008625728,"threshold_uncertainty_score":0.041743875},"labels":[],"label_agreement":null},{"id":"W2913723619","doi":"10.1007/978-3-662-54110-4_4","title":"Multilinear Games","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multilinear map; Polynomial; Polytope; Dimension (graph theory); Computer science; Computation; Mathematics; Mathematical optimization; Theoretical computer science; Discrete mathematics; Algorithm; Combinatorics; Pure mathematics","score_opus":0.06418146451005746,"score_gpt":0.35177276249072426,"score_spread":0.2875912979806668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913723619","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.018794913,0.0019774481,0.45483717,0.003162336,0.0005725396,0.00011001789,0.00054181425,0.00020978799,0.5197939],"genre_scores_gemma":[0.5563486,0.0035034262,0.07955711,0.0010336916,0.00051744626,0.00042403446,0.0010521882,0.00029047095,0.35727298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994413,0.00023493869,0.000023446182,0.000081187376,0.00015141176,0.00006761061],"domain_scores_gemma":[0.99957913,0.00020828345,0.00004093525,0.000045576468,0.000066459426,0.000059584985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005314276,0.00093308,0.00055389886,0.0004413831,0.00063044776,0.0020127574,0.0006323541,0.00074531126,0.0287152],"category_scores_gemma":[0.0024136007,0.00023045133,0.00039304935,0.000584845,0.0009652205,0.0018053795,0.0017836018,0.0018188495,0.0033424622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017348751,0.000023181723,0.00005149937,0.000055252603,0.000010695108,0.000037045524,0.0000716974,0.005832027,0.00029373876,0.95450205,0.011223904,0.027881442],"study_design_scores_gemma":[0.000010439317,0.000016954347,0.00006596454,0.000029814493,0.000004853372,0.00004442834,0.00004675285,0.01711746,0.00012356232,0.9546884,0.02784513,0.0000062442446],"about_ca_topic_score_codex":0.00063526724,"about_ca_topic_score_gemma":0.00059228524,"teacher_disagreement_score":0.0287152,"about_ca_system_score_codex":0.0008747435,"about_ca_system_score_gemma":0.0005312033,"threshold_uncertainty_score":0.096061885},"labels":[],"label_agreement":null},{"id":"W2913919914","doi":"10.1007/3-540-36478-1_5","title":"Connected Matchings","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Combinatorics; Chordal graph; Matching (statistics); Conjecture; Strong perfect graph theorem; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Mathematics; 1-planar graph; Artificial intelligence","score_opus":0.018426466080599356,"score_gpt":0.2718294186126292,"score_spread":0.2534029525320299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913919914","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.05052982,0.002428118,0.15862682,0.0023588538,0.00088738976,0.0002166383,0.0015679568,0.0012332153,0.78215116],"genre_scores_gemma":[0.4440197,0.00409792,0.08170304,0.0011412904,0.0008260202,0.00041349643,0.0046549086,0.0011288995,0.4620147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.00009485965,0.000030335046,0.0001951814,0.00020284025,0.00008587052],"domain_scores_gemma":[0.99941397,0.0001852101,0.000056380886,0.00014554788,0.000117058116,0.00008186732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037718008,0.00082220533,0.0008887694,0.0024959287,0.0019919758,0.0028795267,0.0013431323,0.0012801576,0.050393607],"category_scores_gemma":[0.0022085349,0.000640967,0.00089784013,0.0036841088,0.0011275944,0.006088417,0.0029849852,0.0021839007,0.010048436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003414561,0.00002960441,0.00009853664,0.00008254349,0.000012839564,0.000053021806,0.00014865611,0.0005845086,0.00071703136,0.9429121,0.014956601,0.040370446],"study_design_scores_gemma":[0.000010889257,0.000011341593,0.00012118842,0.000029424109,0.000017139493,0.00012884162,0.00007885069,0.0019065606,0.00067623134,0.94528306,0.051729873,0.0000066046246],"about_ca_topic_score_codex":0.0005793615,"about_ca_topic_score_gemma":0.00070721866,"teacher_disagreement_score":0.050393607,"about_ca_system_score_codex":0.0011310687,"about_ca_system_score_gemma":0.00055009336,"threshold_uncertainty_score":0.16858345},"labels":[],"label_agreement":null},{"id":"W2913963738","doi":"10.1007/978-3-642-32284-6_1","title":"Guessing Secrecy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secrecy; Plaintext; Ciphertext; Computer science; Encryption; Information-theoretic security; Key (lock); Theoretical computer science; Forward secrecy; Mathematics; Computer security; Public-key cryptography","score_opus":0.0200394120471004,"score_gpt":0.2479136126494665,"score_spread":0.22787420060236613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913963738","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.013385217,0.007553763,0.22201523,0.011441276,0.001887465,0.0001274615,0.0008468701,0.00087051553,0.74187225],"genre_scores_gemma":[0.4808148,0.013704741,0.05760105,0.0026582237,0.0022576828,0.00028428613,0.0020624497,0.0009917112,0.43962502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857783,0.0004456107,0.000072943745,0.00023730073,0.00050976314,0.00015657824],"domain_scores_gemma":[0.9975877,0.0012130361,0.0000867388,0.00090047496,0.0001589739,0.00005315283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013131034,0.001153482,0.0008959412,0.0012034114,0.0016436097,0.0038424507,0.00088884484,0.0019477282,0.031046841],"category_scores_gemma":[0.0059825047,0.0007355791,0.0008512285,0.001498418,0.0046472093,0.009306763,0.0034270673,0.005627871,0.013510294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047851627,0.00001615477,0.000096151925,0.000111175425,0.000013728534,0.000051095914,0.0003277757,0.0014438389,0.000542538,0.9386496,0.020114563,0.038585607],"study_design_scores_gemma":[0.000008630549,0.000014551758,0.00006396298,0.00012118714,0.000014018773,0.00014303485,0.00007977817,0.0028503109,0.0016226997,0.9279681,0.06709789,0.000015709566],"about_ca_topic_score_codex":0.00038801727,"about_ca_topic_score_gemma":0.00030968498,"teacher_disagreement_score":0.031046841,"about_ca_system_score_codex":0.0015605772,"about_ca_system_score_gemma":0.0009706444,"threshold_uncertainty_score":0.10386205},"labels":[],"label_agreement":null},{"id":"W2914003752","doi":"10.1007/978-3-030-12029-0_6","title":"Cine and Multicontrast Late Enhanced MRI Registration for 3D Heart Model Construction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Sunnybrook Health Science Centre; University of Toronto","funders":"","keywords":"Image registration; Artificial intelligence; Context (archaeology); Computer science; Segmentation; Similarity (geometry); Sørensen–Dice coefficient; Rigid transformation; Computer vision; Matching (statistics); Pattern recognition (psychology); Medicine; Image segmentation; Image (mathematics); Pathology","score_opus":0.016980574668211134,"score_gpt":0.29303885976711036,"score_spread":0.27605828509889924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914003752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019740975,0.00033834,0.9935731,0.000054086948,0.00006251475,0.0000338523,0.00014739165,0.0014523767,0.0023642948],"genre_scores_gemma":[0.030824453,0.00092533784,0.95060533,0.00010721497,0.00009878765,0.00007768468,0.0009481799,0.0017594887,0.014653564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997094,0.00004123903,0.000023231247,0.00007071255,0.0001305285,0.000024904199],"domain_scores_gemma":[0.9994143,0.0001861746,0.000037193327,0.00021449891,0.000118736796,0.000029050678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007613407,0.0009283632,0.0005712846,0.0010049304,0.00027051012,0.0015395501,0.0013193004,0.0011533079,0.018230293],"category_scores_gemma":[0.0016011244,0.0008546704,0.00087354076,0.0010919044,0.00032896886,0.0011143417,0.0009693884,0.0014397022,0.008845988],"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.00024643794,0.000117055155,0.0003659949,0.0003552512,0.0000722344,0.0002943812,0.00014048562,0.016071228,0.18802497,0.015580523,0.012624085,0.7661074],"study_design_scores_gemma":[0.000055351615,0.00037557163,0.0027206389,0.0001225002,0.00017848577,0.0053378097,0.00014964918,0.5475739,0.302895,0.020912169,0.11955304,0.00012585835],"about_ca_topic_score_codex":0.00067873974,"about_ca_topic_score_gemma":0.0023242603,"teacher_disagreement_score":0.018230293,"about_ca_system_score_codex":0.0002201993,"about_ca_system_score_gemma":0.0005649162,"threshold_uncertainty_score":0.0609864},"labels":[],"label_agreement":null},{"id":"W2914194147","doi":"10.1007/11548706_10","title":"Reverse Prediction","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Laurentian University","funders":"","keywords":"Computer science; Rough set; Notation; Domain (mathematical analysis); Set (abstract data type); Algorithm; Data mining; Artificial intelligence; Reverse engineering; Mathematics; Programming language; Arithmetic","score_opus":0.01656641233465614,"score_gpt":0.2266839577675733,"score_spread":0.21011754543291716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914194147","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.047776926,0.0026541867,0.66496646,0.0061491565,0.006605382,0.00047231172,0.008670083,0.012632863,0.2500726],"genre_scores_gemma":[0.48831698,0.0021763723,0.20317055,0.0026990343,0.0016488768,0.0002706059,0.017610619,0.002069757,0.28203738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991104,0.00013043062,0.000032477277,0.00031647237,0.0002911587,0.000118914155],"domain_scores_gemma":[0.9972512,0.00059933605,0.00010062964,0.0013426577,0.00061413134,0.00009207737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012360452,0.0011764079,0.0008514934,0.0011894227,0.000805616,0.0022245285,0.0016880785,0.0013055645,0.045190156],"category_scores_gemma":[0.0062507004,0.0003904754,0.0009545398,0.0012296583,0.00064771855,0.003627754,0.0015438985,0.0022459007,0.026997425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007035379,0.0002841154,0.004763911,0.00027249235,0.00012370522,0.00047333515,0.00010966282,0.031207696,0.0070174434,0.10706993,0.17313561,0.67483854],"study_design_scores_gemma":[0.00008250215,0.00018711125,0.0025025446,0.00012327568,0.0001648551,0.00078825245,0.00016812293,0.52392125,0.02802546,0.3055706,0.13837443,0.00009158669],"about_ca_topic_score_codex":0.0035227924,"about_ca_topic_score_gemma":0.003433676,"teacher_disagreement_score":0.045190156,"about_ca_system_score_codex":0.00055017305,"about_ca_system_score_gemma":0.0012514514,"threshold_uncertainty_score":0.15117615},"labels":[],"label_agreement":null},{"id":"W2914474205","doi":"10.1007/978-3-642-31155-0_1","title":"α-Visibility","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Visibility; Visibility graph; Vertex (graph theory); Computer science; Visibility polygon; Graph; Line segment; Point (geometry); Line (geometry); Plane (geometry); Combinatorics; Artificial intelligence; Mathematics; Geometry; Optics; Physics; Theoretical computer science; Simple polygon; Regular polygon","score_opus":0.021574890168294485,"score_gpt":0.2580028368399176,"score_spread":0.23642794667162312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914474205","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027697928,0.002305482,0.19752409,0.0011182647,0.0015247858,0.00009510545,0.0007571358,0.00096434605,0.7680128],"genre_scores_gemma":[0.5005474,0.0046736877,0.07869927,0.00096155226,0.0008789442,0.00012334695,0.0021036651,0.0014963027,0.41051584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996117,0.000029224799,0.000018413348,0.00012967738,0.00012770772,0.00008319045],"domain_scores_gemma":[0.9995964,0.000081638835,0.00003956446,0.00010303437,0.000113874,0.000065429325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039008,0.00065272383,0.0005244861,0.00090523047,0.00088239997,0.0019846861,0.0006385977,0.000561737,0.025154022],"category_scores_gemma":[0.0011985187,0.00040029862,0.00059587567,0.00073427433,0.0013955953,0.002789511,0.0019803594,0.002619316,0.0068991096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055449316,0.000020056039,0.00020118884,0.00013159805,0.000010998652,0.00010792756,0.00021912192,0.00061616406,0.003938868,0.8873412,0.019910092,0.08744731],"study_design_scores_gemma":[0.000013583736,0.0000352686,0.00040580457,0.00006041943,0.000019138044,0.0005429778,0.0001472433,0.0020969647,0.005007201,0.81059986,0.18105417,0.000017335962],"about_ca_topic_score_codex":0.00093126454,"about_ca_topic_score_gemma":0.0008002219,"teacher_disagreement_score":0.025154022,"about_ca_system_score_codex":0.0005672343,"about_ca_system_score_gemma":0.0004980426,"threshold_uncertainty_score":0.084148586},"labels":[],"label_agreement":null},{"id":"W2914503505","doi":"10.1007/3-540-45790-9_4","title":"Beyond EDSM","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Merge (version control); Computer science; Automaton; Prefix; Heuristic; Theoretical computer science; Algorithm; Finite-state machine; Artificial intelligence; Parallel computing","score_opus":0.011030029652310805,"score_gpt":0.23320230234686903,"score_spread":0.22217227269455822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914503505","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.0009771466,0.00714957,0.016669264,0.013971006,0.0059323087,0.0000316074,0.00049979636,0.0014889527,0.95328027],"genre_scores_gemma":[0.007619468,0.0023219755,0.004603316,0.002497721,0.0009077789,0.000030282506,0.00047067518,0.00042518816,0.9811235],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919695,0.00015872352,0.0000279705,0.00015644405,0.00034833813,0.0001116393],"domain_scores_gemma":[0.99915755,0.00013878952,0.0000299303,0.00022667822,0.00022013024,0.00022698214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010679,0.0006329366,0.00043399187,0.0015333461,0.001156663,0.0049963286,0.0013762625,0.0016069899,0.21991591],"category_scores_gemma":[0.0023896338,0.00031224082,0.00038047982,0.001516353,0.0009355213,0.0050619408,0.0038053037,0.0021851656,0.108613364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030812902,0.00003057358,0.00013811822,0.00011948394,0.0000040816903,0.000047511065,0.00019068713,0.00017295554,0.0004906601,0.14238249,0.4736965,0.38269612],"study_design_scores_gemma":[0.0000019109148,0.000005253721,0.00007242675,0.000042555974,0.0000011549636,0.00004389504,0.0000441591,0.00008662603,0.00013732877,0.016933639,0.98262835,0.0000026618088],"about_ca_topic_score_codex":0.00089963194,"about_ca_topic_score_gemma":0.002093708,"teacher_disagreement_score":0.21991591,"about_ca_system_score_codex":0.0013427634,"about_ca_system_score_gemma":0.0013596539,"threshold_uncertainty_score":0.735692},"labels":[],"label_agreement":null},{"id":"W2914551285","doi":"10.1007/978-3-642-33090-2_64","title":"Succinct Posets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially ordered set; Reachability; Transitive closure; Combinatorics; Transitive reduction; Mathematics; Oracle; Data structure; Transitive relation; Discrete mathematics; Directed graph; Graph; Computer science; Line graph; Voltage graph","score_opus":0.02168753748394431,"score_gpt":0.24535246687479478,"score_spread":0.22366492939085048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914551285","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02708019,0.0038868827,0.37830395,0.003932983,0.0012501706,0.00032169305,0.0068088546,0.0023017467,0.5761136],"genre_scores_gemma":[0.40552655,0.0072531444,0.16512714,0.001851974,0.0011332557,0.00076172844,0.022077087,0.0021940887,0.39407492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893683,0.00019711569,0.000074349795,0.00021065866,0.00047587385,0.00010518744],"domain_scores_gemma":[0.9990275,0.00040812566,0.00005666158,0.00027072415,0.00016179003,0.00007507915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006299432,0.001446498,0.0008809067,0.0015458371,0.0011414444,0.0037038273,0.0012940002,0.0009989953,0.056904215],"category_scores_gemma":[0.002565219,0.0009777071,0.00086819316,0.002381963,0.0016448465,0.008637801,0.0034147028,0.0042922413,0.012815119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007627143,0.000059583166,0.000104285995,0.00028688458,0.000013449555,0.000078488236,0.00031719348,0.0046534487,0.0017072924,0.8822905,0.028519372,0.08189326],"study_design_scores_gemma":[0.000016771668,0.000024696947,0.00009337923,0.00010399439,0.000012480319,0.00014164778,0.000078278776,0.0031210845,0.0015800002,0.89494425,0.09986707,0.000016376918],"about_ca_topic_score_codex":0.00057203084,"about_ca_topic_score_gemma":0.0011885444,"teacher_disagreement_score":0.056904215,"about_ca_system_score_codex":0.0010899963,"about_ca_system_score_gemma":0.00071997335,"threshold_uncertainty_score":0.19036353},"labels":[],"label_agreement":null},{"id":"W2914754426","doi":"10.1007/978-3-030-12598-1_44","title":"Opposition-Based Multi-objective Binary Differential Evolution for Multi-label Feature Selection","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Feature selection; Computer science; Artificial intelligence; Differential evolution; Binary number; Preprocessor; Binary classification; Pattern recognition (psychology); Machine learning; Feature (linguistics); Pareto principle; Optimization problem; Mathematical optimization; Algorithm; Support vector machine; Mathematics","score_opus":0.030661377136293477,"score_gpt":0.2787367194164769,"score_spread":0.2480753422801834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914754426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01061148,0.0002488335,0.9866174,0.0000867628,0.000057865644,0.000042397307,0.00002956311,0.0001743388,0.002131398],"genre_scores_gemma":[0.53938836,0.00030284523,0.45157284,0.00024961476,0.000084645035,0.0005097916,0.00026082477,0.00015325993,0.007477817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955577,0.00015487622,0.000025461466,0.00007179056,0.00014574021,0.000046368357],"domain_scores_gemma":[0.99908614,0.00061633403,0.000052760864,0.000037245132,0.00017783257,0.000029726087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476779,0.0006893681,0.0014318764,0.00076697953,0.00038185756,0.00079687726,0.0015390482,0.0013704371,0.0025028798],"category_scores_gemma":[0.0023438036,0.00042144934,0.0009560739,0.00094461907,0.00055741897,0.00060424936,0.0013560563,0.0012560269,0.00043690065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015103437,0.00014961997,0.00054421736,0.00016902309,0.000101779864,0.00009636369,0.000115695875,0.74160284,0.007050744,0.012819057,0.0022662557,0.23493333],"study_design_scores_gemma":[0.000004843985,0.000019679379,0.000042915228,0.0000036191275,0.000004697303,0.000009352782,0.0000023732327,0.99874604,0.00025913896,0.0007197289,0.00018495168,0.0000025567158],"about_ca_topic_score_codex":0.0027817609,"about_ca_topic_score_gemma":0.0024015137,"teacher_disagreement_score":0.0027817609,"about_ca_system_score_codex":0.00076514354,"about_ca_system_score_gemma":0.00053455296,"threshold_uncertainty_score":0.008373022},"labels":[],"label_agreement":null},{"id":"W2914837316","doi":"10.1007/978-3-030-11539-5_59","title":"A Fractional Diffusion Model with Resetting","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diffusion and Search Dynamics","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":"Dalhousie University","funders":"","keywords":"Reset (finance); Random walk; Jump; Computer science; Position (finance); Diffusion; Moment (physics); Class (philosophy); Motion (physics); Lévy flight; Statistical physics; Applied mathematics; Mathematics; Artificial intelligence; Physics; Classical mechanics","score_opus":0.011539265281428904,"score_gpt":0.2530081728486938,"score_spread":0.2414689075672649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914837316","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.3802597,0.00426698,0.50811017,0.00759327,0.0020956765,0.0001061911,0.0008718484,0.0009013822,0.09579484],"genre_scores_gemma":[0.95747435,0.001044096,0.0069958377,0.00023475252,0.00027561677,0.000047804246,0.00012649296,0.000060754635,0.03374028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972254,0.00006227186,0.000015673539,0.000073329546,0.000055661025,0.00007043732],"domain_scores_gemma":[0.9992053,0.0003782504,0.0001350615,0.0000742862,0.0000916777,0.00011542181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059569714,0.0010117294,0.0016177861,0.0010656203,0.0010384499,0.0029489961,0.0020109774,0.0037839185,0.007082291],"category_scores_gemma":[0.002810581,0.00048804196,0.0014722877,0.0009475558,0.0018940134,0.0021674074,0.0013116836,0.0016074124,0.0004964222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017274806,0.000101433514,0.0004579553,0.00020367627,0.000089489076,0.0011124664,0.00025256758,0.2754205,0.008287634,0.70340335,0.0025425723,0.007955642],"study_design_scores_gemma":[0.00006055835,0.00006498121,0.00026503878,0.000022786893,0.00006507646,0.000263419,0.000055131793,0.86921155,0.0006163802,0.12731756,0.0020094076,0.00004805701],"about_ca_topic_score_codex":0.0041187312,"about_ca_topic_score_gemma":0.001353664,"teacher_disagreement_score":0.007082291,"about_ca_system_score_codex":0.0013127326,"about_ca_system_score_gemma":0.0008411999,"threshold_uncertainty_score":0.023692608},"labels":[],"label_agreement":null},{"id":"W2914843939","doi":"10.1007/978-3-642-02927-1_64","title":"Elimination Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Split graph; Pathwidth; Discrete mathematics; Mathematics; Block graph; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.019465804196152136,"score_gpt":0.28247516914168813,"score_spread":0.263009364945536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914843939","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016713232,0.00096775306,0.08855402,0.0013202002,0.00055786263,0.000108018634,0.0012444524,0.0007956546,0.8897388],"genre_scores_gemma":[0.21985532,0.002234355,0.042885844,0.0010305446,0.0003673129,0.00019965219,0.0051245154,0.0010043154,0.7272981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997429,0.000041050218,0.0000088559655,0.000060986993,0.00009675572,0.000049472685],"domain_scores_gemma":[0.9996995,0.00007638857,0.000018881568,0.00006790681,0.00010666871,0.000030793475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001810488,0.00058806234,0.0004177542,0.0012399335,0.0014523027,0.0018899894,0.0007938845,0.00050376443,0.06085548],"category_scores_gemma":[0.00068428967,0.00039165313,0.0005127823,0.0012809987,0.00069405645,0.002128339,0.0009198135,0.0018410358,0.018631991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023341654,0.000032745113,0.00011425789,0.000077300065,0.000008497264,0.00006196427,0.00012941772,0.0004824735,0.0014942655,0.891452,0.051811855,0.054311853],"study_design_scores_gemma":[0.000012459009,0.000014720424,0.00030472295,0.000036188223,0.000017945833,0.00029264507,0.00011662,0.0013543325,0.0024553023,0.7487979,0.24658634,0.000010959778],"about_ca_topic_score_codex":0.0006993675,"about_ca_topic_score_gemma":0.0011136316,"teacher_disagreement_score":0.06085548,"about_ca_system_score_codex":0.0006553608,"about_ca_system_score_gemma":0.0005135175,"threshold_uncertainty_score":0.20358187},"labels":[],"label_agreement":null},{"id":"W2914871854","doi":"10.1007/11889205_37","title":"Preprocessing QBF","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":45,"is_retracted":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":"Preprocessor; Computer science; True quantified Boolean formula; Expressive power; Solver; Algorithm; Conjunctive normal form; Time complexity; Range (aeronautics); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.02513833083533195,"score_gpt":0.2811366149434357,"score_spread":0.25599828410810377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914871854","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.019855265,0.0010900545,0.71083343,0.00246373,0.0012155243,0.0017674663,0.022939926,0.057136405,0.18269826],"genre_scores_gemma":[0.25378215,0.0011553647,0.48672885,0.0015684587,0.0004757061,0.0012620372,0.053875197,0.019657008,0.18149532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980849,0.0002857204,0.00011803278,0.0005248812,0.0006401088,0.00034635072],"domain_scores_gemma":[0.99692035,0.00087847566,0.00009907973,0.0010644647,0.0009754684,0.000062208506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449478,0.0013739719,0.0010338268,0.0020189832,0.0011771405,0.0026130006,0.001306768,0.00088421575,0.13521644],"category_scores_gemma":[0.007014691,0.0008411438,0.0016525271,0.002120642,0.00081120286,0.0040940535,0.0022964638,0.0023616639,0.061668042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010313981,0.00021711142,0.0008100016,0.0015867185,0.00009137546,0.00038807376,0.00037267164,0.006732675,0.026882324,0.15441903,0.23581676,0.57165176],"study_design_scores_gemma":[0.00020212261,0.00023108521,0.0010396589,0.00032901263,0.0001478907,0.000549356,0.00028293772,0.022245275,0.072819784,0.39211482,0.5099458,0.00009219721],"about_ca_topic_score_codex":0.0037752648,"about_ca_topic_score_gemma":0.0041767447,"teacher_disagreement_score":0.13521644,"about_ca_system_score_codex":0.0015895419,"about_ca_system_score_gemma":0.0023906128,"threshold_uncertainty_score":0.45234406},"labels":[],"label_agreement":null},{"id":"W2914880889","doi":"10.1007/b104925","title":"Inconsistency Tolerance","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":175,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.01353940602525862,"score_gpt":0.2776650288755247,"score_spread":0.2641256228502661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914880889","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.016469745,0.002787436,0.75778466,0.0038546412,0.0012572624,0.0003999992,0.00079388404,0.0036078223,0.21304461],"genre_scores_gemma":[0.45282745,0.0023654026,0.35165292,0.0016928485,0.00079940446,0.0005708397,0.0029733588,0.0020086907,0.18510908],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642557,0.0008437497,0.0003305331,0.0008439943,0.001338654,0.00021744886],"domain_scores_gemma":[0.9885197,0.004236291,0.00062930677,0.0042713145,0.0020315927,0.0003118765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033767296,0.0010276106,0.0010551488,0.002005509,0.0015737849,0.0037791634,0.002603346,0.0013690379,0.037751004],"category_scores_gemma":[0.022101909,0.0007025345,0.0012328036,0.0018636689,0.0016343467,0.0067396825,0.0036971166,0.0033318014,0.0073474436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002158458,0.00015632411,0.0010390219,0.00040333264,0.00008209569,0.00023897627,0.00085539644,0.0053642024,0.0029166013,0.45520985,0.042010024,0.4915084],"study_design_scores_gemma":[0.00004997869,0.000096882985,0.0005721521,0.00019882474,0.00011389376,0.0009573218,0.0004340168,0.030133946,0.007954495,0.82070774,0.13872467,0.000056169672],"about_ca_topic_score_codex":0.000647509,"about_ca_topic_score_gemma":0.0006112937,"teacher_disagreement_score":0.037751004,"about_ca_system_score_codex":0.00093734096,"about_ca_system_score_gemma":0.0014768379,"threshold_uncertainty_score":0.12628967},"labels":[],"label_agreement":null},{"id":"W2914898599","doi":"10.1007/978-3-030-12598-1_49","title":"IRA-EMO: Interactive Method Using Reservation and Aspiration Levels for Evolutionary Multiobjective Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reservation; Computer science; Multi-objective optimization; Mathematical optimization; Pareto principle; Decision maker; Evolutionary algorithm; Interval (graph theory); Optimization problem; Multiobjective programming; Artificial intelligence; Operations research; Algorithm; Mathematics; Machine learning","score_opus":0.04482112435557944,"score_gpt":0.3283234854295944,"score_spread":0.28350236107401494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914898599","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.005223786,0.00017656761,0.9810689,0.00006165493,0.00011673078,0.000050786817,0.00005901946,0.0018157416,0.011426741],"genre_scores_gemma":[0.1750201,0.00019740236,0.80764234,0.0002403364,0.000080778394,0.00041579927,0.00023421216,0.0010168906,0.015152125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979573,0.000062342486,0.000009097317,0.000032136246,0.00007527071,0.000025378695],"domain_scores_gemma":[0.9997135,0.00016244414,0.00001672324,0.000027450278,0.000057709844,0.000022237204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515544,0.00085613027,0.000927826,0.00047055565,0.00047745366,0.0008470365,0.0018946716,0.0014486858,0.014930828],"category_scores_gemma":[0.0011269302,0.00048136446,0.0008416934,0.0004553515,0.00033005516,0.00068167766,0.0012985497,0.0012621852,0.0023371684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018436817,0.00019910879,0.00031416112,0.0002679534,0.00009340081,0.00018775779,0.00014789935,0.6800371,0.008440858,0.016892968,0.010600902,0.2826335],"study_design_scores_gemma":[0.00001644874,0.000023402506,0.000041330793,0.000011928701,0.0000076583,0.000021699585,0.000007520396,0.9948368,0.00073520286,0.0017522254,0.0025383495,0.0000075438707],"about_ca_topic_score_codex":0.002025609,"about_ca_topic_score_gemma":0.0028825102,"teacher_disagreement_score":0.014930828,"about_ca_system_score_codex":0.00034254382,"about_ca_system_score_gemma":0.0005148987,"threshold_uncertainty_score":0.049948573},"labels":[],"label_agreement":null},{"id":"W2915171113","doi":"10.1007/978-3-030-14082-3_1","title":"An Introduction to Quantum Computing and Its Application","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Computational science; Quantum mechanics; Physics","score_opus":0.008853946245019326,"score_gpt":0.24707911040133923,"score_spread":0.2382251641563199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915171113","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019992255,0.18983649,0.08998884,0.008993401,0.010378648,0.0000949278,0.00039621658,0.00071878557,0.6975934],"genre_scores_gemma":[0.03041403,0.15320814,0.03989715,0.0042453986,0.008323447,0.00022544636,0.00032875157,0.00049935485,0.7628583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997856,0.000027472213,0.000009273486,0.000037198628,0.00011757555,0.000022786606],"domain_scores_gemma":[0.9997323,0.00017071795,0.000008286564,0.000026429298,0.000044964356,0.000017278626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024070415,0.000837297,0.0007050457,0.0014720663,0.0010645945,0.0017159512,0.0008924919,0.0013992391,0.0471195],"category_scores_gemma":[0.0006343355,0.00055395,0.0005567189,0.0022939611,0.0018960733,0.0032541566,0.0013125814,0.0030016776,0.015462654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018017872,0.000058698854,0.000051881998,0.0005803483,0.000009160931,0.00007296563,0.00019888686,0.0014172635,0.002260978,0.66676164,0.14618452,0.18238571],"study_design_scores_gemma":[0.0000025349732,0.000016120071,0.00007832793,0.0001497861,0.0000030944161,0.00013088944,0.000034164615,0.0008060128,0.0004886312,0.18985169,0.8084256,0.000013060159],"about_ca_topic_score_codex":0.0006452014,"about_ca_topic_score_gemma":0.0010902227,"teacher_disagreement_score":0.0471195,"about_ca_system_score_codex":0.0009923053,"about_ca_system_score_gemma":0.00086533435,"threshold_uncertainty_score":0.15763044},"labels":[],"label_agreement":null},{"id":"W2915225767","doi":"10.1007/978-3-540-87991-6_30","title":"Preface to RIGiM 2008","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Requirements engineering; Computer science; Requirements analysis; Domain (mathematical analysis); Software engineering; Requirement; Conceptual model; Management science; Systems engineering; Software; Engineering","score_opus":0.035421097671807275,"score_gpt":0.2789721468680622,"score_spread":0.24355104919625492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915225767","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015390042,0.021547843,0.01157068,0.021415377,0.13474654,0.00023147615,0.0039394936,0.0023524507,0.8026572],"genre_scores_gemma":[0.0043268017,0.0044102343,0.0021151628,0.0023284073,0.011147843,0.00007082173,0.0018812586,0.0010212698,0.97269815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995129,0.00007269404,0.000021981858,0.00008801308,0.00026326923,0.00004111654],"domain_scores_gemma":[0.9986971,0.00020148774,0.000049508817,0.00012773527,0.00073470135,0.00018954431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008096591,0.00083763216,0.0007217547,0.0023121093,0.0010981628,0.0030515045,0.0011011558,0.00094094966,0.2552861],"category_scores_gemma":[0.0038872748,0.00025023447,0.0004468458,0.0018523847,0.00042770116,0.00182388,0.0015250832,0.0017874661,0.18973288],"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.000019723075,0.000017387485,0.00003161079,0.000086586275,0.0000014773387,0.00001816126,0.000028088123,0.00008951749,0.00013943345,0.0039029277,0.9390064,0.056658767],"study_design_scores_gemma":[0.0000029043529,0.000013471692,0.00015987821,0.000092971255,0.0000019172596,0.000030745832,0.000023374476,0.00006690417,0.00010239115,0.0015986714,0.9979024,0.0000044683093],"about_ca_topic_score_codex":0.0028103858,"about_ca_topic_score_gemma":0.00500467,"teacher_disagreement_score":0.2552861,"about_ca_system_score_codex":0.0019741585,"about_ca_system_score_gemma":0.0011711607,"threshold_uncertainty_score":0.8540171},"labels":[],"label_agreement":null},{"id":"W2916548205","doi":"10.1007/978-3-030-29390-1_73","title":"#SociallyAcceptableHCI: Social Acceptability of Emerging Technologies and Novel Interaction Paradigms","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; University of Manitoba","funders":"","keywords":"Computer science; Data science; Human–computer interaction; Artificial intelligence","score_opus":0.02531968764037132,"score_gpt":0.2912329594015724,"score_spread":0.26591327176120105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916548205","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.022360267,0.0012933242,0.19319108,0.014903948,0.00075018266,0.00014824733,0.0005597947,0.0012173258,0.7655758],"genre_scores_gemma":[0.64935154,0.0015595615,0.09602032,0.0017627003,0.00071012066,0.00072797155,0.001308291,0.0011350792,0.24742442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818844,0.00079771975,0.0000685313,0.0001999838,0.000623333,0.00012198467],"domain_scores_gemma":[0.9976197,0.0012805652,0.0001835393,0.00041181233,0.00036448188,0.00013992527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014884959,0.00056651543,0.0003190764,0.0005795424,0.0015570474,0.005723866,0.0012262833,0.002045138,0.035552964],"category_scores_gemma":[0.004414242,0.0002572592,0.0004420086,0.0009958147,0.0034553474,0.008571603,0.0029925387,0.0026363202,0.0056792093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022379525,0.000020838515,0.00042026368,0.00011719045,0.000004172985,0.000075169366,0.004202467,0.0002540562,0.001163596,0.907356,0.02315011,0.063213676],"study_design_scores_gemma":[0.000012269812,0.00005513662,0.0016243858,0.00012619873,0.000008521044,0.00036649534,0.004456156,0.0061714677,0.0033266847,0.6394302,0.34437752,0.000045135297],"about_ca_topic_score_codex":0.0015091074,"about_ca_topic_score_gemma":0.0019581618,"teacher_disagreement_score":0.035552964,"about_ca_system_score_codex":0.0017273945,"about_ca_system_score_gemma":0.001120569,"threshold_uncertainty_score":0.11893648},"labels":[],"label_agreement":null},{"id":"W2918105805","doi":"10.1007/978-3-031-82852-2","title":"Selected Areas in Cryptography – SAC 2024","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"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":"Universität Mannheim; Università degli Studi di Salerno; Université de Montréal; Universitetet i Bergen; Centre National de la Recherche Scientifique; Memorial University of Newfoundland; University of Waterloo; KU Leuven; Technische Universiteit Eindhoven; Indian Statistical Institute; Université du Québec à Montréal; University of Alberta; University of Washington; University of Haifa; Aarhus Universitet; University of South Florida; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; National Research Council Canada; Case Western Reserve University; Radboud Universiteit","keywords":"Computer science; Cryptography; Computer security","score_opus":0.010128335871827756,"score_gpt":0.26289794075050904,"score_spread":0.2527696048786813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918105805","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096194237,0.042961646,0.009663453,0.0019967763,0.015602508,0.0001423516,0.0010065655,0.0008596263,0.92680514],"genre_scores_gemma":[0.0065968665,0.02838289,0.0048796427,0.00046963504,0.008324882,0.00009768876,0.0012126113,0.0004492012,0.9495866],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991529,0.00011263684,0.000036101566,0.00012091062,0.0005052801,0.00007225504],"domain_scores_gemma":[0.99898034,0.00017759664,0.000063123975,0.00015137251,0.0004106067,0.00021693207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008720601,0.0026329872,0.0014418688,0.0034282547,0.0013066566,0.0038033251,0.0009999454,0.0013832881,0.14038928],"category_scores_gemma":[0.0012892337,0.0006087788,0.0008291289,0.004772112,0.0007237562,0.0036112661,0.0017120382,0.0030903968,0.14500499],"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.00005356245,0.00006188279,0.00010228447,0.00039642944,0.000015787344,0.000032611093,0.00002360172,0.001237843,0.00086044363,0.03710595,0.72114944,0.23896007],"study_design_scores_gemma":[0.0000060790367,0.000037766105,0.0003168538,0.00015214183,0.000007147134,0.000088730594,0.00001017653,0.00079595717,0.0004578592,0.008542241,0.9895774,0.0000076815595],"about_ca_topic_score_codex":0.0012828924,"about_ca_topic_score_gemma":0.002622708,"teacher_disagreement_score":0.14038928,"about_ca_system_score_codex":0.0020303098,"about_ca_system_score_gemma":0.0021197693,"threshold_uncertainty_score":0.4696489},"labels":[],"label_agreement":null},{"id":"W2918513183","doi":"10.1007/978-3-662-44680-5_8","title":"Correction to: Transactions on Rough Sets XVIII","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Manitoba","funders":"","keywords":"Paragraph; Computer science; Information retrieval; Library science; Programming language; World Wide Web","score_opus":0.019556581174940777,"score_gpt":0.25072137206650025,"score_spread":0.23116479089155947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918513183","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008903311,0.0019052182,0.00071516307,0.037459183,0.9560537,0.000018221579,0.0006673661,0.00027046402,0.0028216601],"genre_scores_gemma":[0.012808388,0.011392442,0.0038638269,0.06175863,0.6871568,0.00022225815,0.0023849881,0.0017718371,0.21864083],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933909,0.0008711857,0.0010898652,0.0010180919,0.0030218523,0.00060809974],"domain_scores_gemma":[0.9627506,0.0049656318,0.0014180215,0.003386691,0.026043568,0.0014355074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039123646,0.0028642647,0.0037243122,0.0075940555,0.0034033742,0.0069991746,0.004244732,0.0065966337,0.08747644],"category_scores_gemma":[0.05891451,0.0012568664,0.0027398565,0.005323149,0.0027753594,0.0031812314,0.002552403,0.011255944,0.06317517],"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.000022754539,0.000004001912,0.000042951557,0.00013647477,0.00001544374,0.0000674034,0.000015237781,0.000037707076,0.000027504755,0.0011183697,0.99393636,0.004575598],"study_design_scores_gemma":[0.000028504359,0.000016899148,0.0005267183,0.0002157368,0.00003309974,0.000239648,0.00004995767,0.00022900959,0.00015469444,0.0025320686,0.9959462,0.000027467695],"about_ca_topic_score_codex":0.01043615,"about_ca_topic_score_gemma":0.01093181,"teacher_disagreement_score":0.08747644,"about_ca_system_score_codex":0.0051471945,"about_ca_system_score_gemma":0.004440839,"threshold_uncertainty_score":0.29263783},"labels":[],"label_agreement":null},{"id":"W2918819669","doi":"10.1007/978-3-030-28796-2_6","title":"Critical Exponent of Infinite Balanced Words via the Pell Number System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Alphabet; Computation; Word (group theory); Critical exponent; Combinatorics on words","score_opus":0.01091101810620658,"score_gpt":0.23917438440136696,"score_spread":0.22826336629516036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918819669","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.6744457,0.0031556773,0.10872024,0.0017076195,0.00059996644,0.00008931425,0.000274247,0.00045730962,0.21054997],"genre_scores_gemma":[0.9645126,0.0007698969,0.0077465316,0.00014848013,0.0003923195,0.00006617886,0.00013282006,0.000120292214,0.026110947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976057,0.00006103258,0.000012754579,0.00004304437,0.0000688204,0.000053858494],"domain_scores_gemma":[0.99939096,0.00028817542,0.000097790966,0.000042294032,0.00008576634,0.00009502237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030187113,0.00062960107,0.00069222925,0.0015526016,0.001064492,0.0026248668,0.00052492897,0.0007126351,0.0076247775],"category_scores_gemma":[0.0023900045,0.00035434566,0.0003410038,0.0007546627,0.0017809353,0.003118312,0.0014098999,0.0011492666,0.0011211087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052849577,0.000009851935,0.0001505869,0.000033179833,0.0000037805944,0.000107756285,0.00013402586,0.0010494469,0.0022391796,0.99123514,0.00081779377,0.004166461],"study_design_scores_gemma":[0.0000192382,0.000016484017,0.00015879935,0.000014997249,0.0000055360542,0.00009982775,0.000050593382,0.0051240926,0.0008414533,0.9911034,0.002553842,0.000011731299],"about_ca_topic_score_codex":0.00046266222,"about_ca_topic_score_gemma":0.0004362953,"teacher_disagreement_score":0.0076247775,"about_ca_system_score_codex":0.001057695,"about_ca_system_score_gemma":0.00042955458,"threshold_uncertainty_score":0.02550739},"labels":[],"label_agreement":null},{"id":"W2919152874","doi":"10.1007/978-3-030-43725-1_14","title":"Trustee: Full Privacy Preserving Vickrey Auction on Top of Ethereum","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Concordia University","funders":"","keywords":"Bidding; Vickrey auction; Database transaction; Computer science; Computer security; Common value auction; Encryption; Public-key cryptography; Relay; Key (lock); Auction theory; Vickrey–Clarke–Groves auction; Business; Database; Microeconomics; Economics","score_opus":0.020373804957067324,"score_gpt":0.2715335730212922,"score_spread":0.2511597680642249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919152874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251416,0.0004937383,0.8717594,0.0007520064,0.00028496268,0.00027468466,0.0003671742,0.004029619,0.019524228],"genre_scores_gemma":[0.8896972,0.00018291853,0.096530214,0.00011855427,0.00006569362,0.000098983655,0.0002855795,0.00029778006,0.01272321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792176,0.000588874,0.00010866252,0.00029816822,0.00065528264,0.00042740736],"domain_scores_gemma":[0.9981705,0.00053203467,0.00006558607,0.0008393065,0.00019187537,0.00020068117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027287095,0.0006625336,0.0017807982,0.00055518065,0.0007207621,0.0033119929,0.0024132368,0.0017340356,0.0104069095],"category_scores_gemma":[0.0049637686,0.0004748633,0.0007646825,0.0007874401,0.0011089557,0.004097687,0.0045140507,0.0018958513,0.0019112026],"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.004893376,0.0008029422,0.0011482564,0.00039606553,0.0002350456,0.0010355706,0.00037411143,0.20678917,0.024996744,0.5065471,0.013220024,0.23956159],"study_design_scores_gemma":[0.00035649084,0.00017897676,0.00015130818,0.000022670129,0.000047124355,0.00017337513,0.00004891371,0.7997539,0.0071224743,0.18704107,0.005062067,0.0000417232],"about_ca_topic_score_codex":0.0013925623,"about_ca_topic_score_gemma":0.0012714281,"teacher_disagreement_score":0.0104069095,"about_ca_system_score_codex":0.00073851546,"about_ca_system_score_gemma":0.0018969192,"threshold_uncertainty_score":0.034814596},"labels":[],"label_agreement":null},{"id":"W2919576157","doi":"10.1007/978-3-540-69839-5_7","title":"Exploratory Spatial Analysis of Illegal Oil Discharges Detected off Canada’s Pacific Coast","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data-Driven Disease Surveillance","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Oil spill; Exploratory analysis; Computer science; Exploratory data analysis; Spatial analysis; Exploratory research; Environmental science; Cartography; Geography; Remote sensing; Data mining; Data science; Environmental protection","score_opus":0.012091845828248493,"score_gpt":0.22460869844737835,"score_spread":0.21251685261912986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919576157","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.96835,0.00042164812,0.010524242,0.0002668793,0.000012073734,0.000055147713,0.010555362,0.00040461196,0.009410059],"genre_scores_gemma":[0.96888494,0.00031312183,0.01835633,0.000026890797,0.000007349425,0.000022551823,0.0070952894,0.000059694103,0.005233814],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99989665,0.000007185049,0.000004093761,0.000014499312,0.000041748084,0.00003584397],"domain_scores_gemma":[0.9996228,0.00011901486,0.000035660796,0.000018526745,0.00016606167,0.000037813446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014561939,0.00028650477,0.00016882428,0.0024148284,0.0006684169,0.0007608642,0.00035822313,0.00019158087,0.0018375665],"category_scores_gemma":[0.00058565714,0.0001403813,0.0004209294,0.0030937176,0.00025371116,0.0001755031,0.0005020751,0.00020624386,0.00024344791],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031213174,0.00011656139,0.6679237,0.00026283602,0.00021762229,0.001810149,0.003406943,0.04366865,0.019888297,0.004885275,0.018725263,0.23878251],"study_design_scores_gemma":[0.00000828954,0.00003474468,0.89314795,0.00006337813,0.00007436527,0.00041493657,0.0063001015,0.08295211,0.004576147,0.001314232,0.011072137,0.000041610954],"about_ca_topic_score_codex":0.7696115,"about_ca_topic_score_gemma":0.8969343,"teacher_disagreement_score":0.23038852,"about_ca_system_score_codex":0.0015093496,"about_ca_system_score_gemma":0.0032290877,"threshold_uncertainty_score":0.4634906},"labels":[],"label_agreement":null},{"id":"W2920250724","doi":"10.1007/978-3-030-17083-7_2","title":"Identifying Clinical Terms in Free-Text Notes Using Ontology-Guided Machine Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Vector Institute; Hospital for Sick Children; University of Toronto","funders":"","keywords":"Computer science; Ontology; Artificial intelligence; Natural language processing; Information retrieval","score_opus":0.06266941943699998,"score_gpt":0.3460765542345941,"score_spread":0.2834071347975941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920250724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16463134,0.006140471,0.7477534,0.0032109444,0.00091114454,0.0014628288,0.03928729,0.014602208,0.022000408],"genre_scores_gemma":[0.23077437,0.0019385393,0.7270851,0.0004728404,0.00019379726,0.00034306225,0.031288862,0.00053233217,0.0073710685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896944,0.00017312933,0.00017017902,0.00028412158,0.00032692525,0.00007628992],"domain_scores_gemma":[0.99597955,0.0027760167,0.0003416476,0.00025916132,0.00052431517,0.000119208125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010082844,0.0009380012,0.00054317527,0.004830515,0.00070884207,0.0020158545,0.0011157687,0.0011111574,0.0055272304],"category_scores_gemma":[0.0057832533,0.00029147536,0.0010822512,0.0032429395,0.00043918265,0.0021361103,0.0015959904,0.0012485208,0.0034143622],"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.00043106094,0.0003070496,0.014655109,0.0012589261,0.00012285025,0.0012721563,0.00076312013,0.006036573,0.04177467,0.0064686746,0.034581516,0.8923282],"study_design_scores_gemma":[0.00029058685,0.00052452646,0.051610507,0.0015080819,0.0008094421,0.008488925,0.0037995158,0.53072745,0.12603407,0.078434736,0.19747947,0.00029274783],"about_ca_topic_score_codex":0.0058033955,"about_ca_topic_score_gemma":0.012403979,"teacher_disagreement_score":0.0058033955,"about_ca_system_score_codex":0.00096259214,"about_ca_system_score_gemma":0.002189747,"threshold_uncertainty_score":0.018490434},"labels":[],"label_agreement":null},{"id":"W2921301179","doi":"10.1007/978-3-030-32251-9_5","title":"Placental Flattening via Volumetric Parameterization","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Université de Montréal","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute of Biomedical Imaging and Bioengineering","keywords":"Flattening; Placenta; Visualization; Computer science; Boundary (topology); Isosurface; Distortion (music); Artificial intelligence; Mathematics; Biology; Physics; Pregnancy; Mathematical analysis","score_opus":0.010509238389790761,"score_gpt":0.22255404285519848,"score_spread":0.21204480446540772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921301179","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.022877185,0.00022354936,0.9655658,0.00013498907,0.00007143928,0.00003933534,0.0001635898,0.0011452273,0.009778945],"genre_scores_gemma":[0.6462855,0.0008716905,0.32916096,0.0001833498,0.00014037287,0.00013503325,0.00080875057,0.0027485194,0.019665895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996599,0.000050323317,0.000017831138,0.000114573515,0.00011567063,0.000041626972],"domain_scores_gemma":[0.99943,0.00014525538,0.000053330274,0.00028813968,0.000048378057,0.000034834342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183129,0.0007198245,0.00051406794,0.0018124431,0.00035323802,0.0015221454,0.00094019825,0.00056308036,0.0064716553],"category_scores_gemma":[0.0016072844,0.00071814435,0.0009631279,0.0008876828,0.0010096051,0.0009824665,0.0025846297,0.0018299512,0.002056983],"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.00030515192,0.000059619855,0.001735885,0.00026658477,0.000079705576,0.0014233217,0.0005357601,0.11820593,0.19250374,0.28883266,0.004864792,0.39118686],"study_design_scores_gemma":[0.000068275294,0.00019598761,0.0022151058,0.00010334265,0.0000918812,0.006077772,0.00036572872,0.38612065,0.13935003,0.38277608,0.08251228,0.00012288065],"about_ca_topic_score_codex":0.00065780565,"about_ca_topic_score_gemma":0.0005589843,"teacher_disagreement_score":0.0064716553,"about_ca_system_score_codex":0.0005026227,"about_ca_system_score_gemma":0.00029435792,"threshold_uncertainty_score":0.021649897},"labels":[],"label_agreement":null},{"id":"W2921562376","doi":"10.1007/978-3-030-13736-6_3","title":"Fast Registration of CT with Intra-operative Ultrasound Images for Spine Surgery","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Image registration; Artificial intelligence; Image-guided surgery; Vertebra; Computer vision; Patient registration; Medicine; Radiology; Image (mathematics); Surgery","score_opus":0.009953514473408304,"score_gpt":0.2304786065359136,"score_spread":0.22052509206250528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921562376","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.004458081,0.001560849,0.9895159,0.00009168113,0.00012926634,0.000045535413,0.00019959793,0.0015131059,0.0024859346],"genre_scores_gemma":[0.064749435,0.0036039148,0.9168992,0.00009034193,0.00014437218,0.00011534606,0.0010484837,0.0011861058,0.0121628605],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996432,0.000072159,0.0000226517,0.000048068672,0.00018533245,0.000028574283],"domain_scores_gemma":[0.9990897,0.0005090604,0.000053059375,0.00016856026,0.00015167423,0.000028006947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006247489,0.0009410371,0.0005194393,0.0014291559,0.0002311379,0.0011648356,0.0011222914,0.0009975714,0.012177785],"category_scores_gemma":[0.0019315272,0.0008486984,0.0006961414,0.001656093,0.00026312942,0.0012111553,0.001062241,0.0011857665,0.004783258],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004619501,0.00005910892,0.00070905715,0.0004547119,0.00007630916,0.00027305138,0.00009424784,0.02841034,0.1224504,0.007994963,0.014982465,0.8240334],"study_design_scores_gemma":[0.00008179191,0.00046124487,0.0055647227,0.00026883336,0.00019772128,0.005176843,0.0001218718,0.6657569,0.22375019,0.02068652,0.077799454,0.00013395828],"about_ca_topic_score_codex":0.0010036215,"about_ca_topic_score_gemma":0.0020998728,"teacher_disagreement_score":0.012177785,"about_ca_system_score_codex":0.00028380382,"about_ca_system_score_gemma":0.00061284046,"threshold_uncertainty_score":0.04073876},"labels":[],"label_agreement":null},{"id":"W2922070351","doi":"10.1007/978-3-030-19212-9_9","title":"A Constraint Programming Approach to Electric Vehicle Routing with Time Windows","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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 Toronto","funders":"","keywords":"Computer science; Vehicle routing problem; Mathematical optimization; Constraint programming; Electric vehicle; Integer programming; Linear programming; Routing (electronic design automation); Scheduling (production processes); Transformation (genetics); Range (aeronautics); Minification; Algorithm; Computer network; Stochastic programming; Mathematics; Engineering","score_opus":0.012218359804833804,"score_gpt":0.225919186827576,"score_spread":0.2137008270227422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922070351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009477878,0.0008094791,0.98435104,0.0002740581,0.00015719367,0.000034489436,0.00010412445,0.00007266563,0.013249224],"genre_scores_gemma":[0.08567556,0.0052925833,0.87085205,0.0003874613,0.0005151819,0.00031297284,0.00030773334,0.00030197873,0.036354493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942136,0.00017537076,0.00003347169,0.00009765778,0.00022411102,0.000048078626],"domain_scores_gemma":[0.99931526,0.00045676663,0.000048575304,0.000041453233,0.00011135637,0.000026527388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083785644,0.0013310608,0.00089467445,0.0007184549,0.0005913002,0.0021269033,0.0026012694,0.0011912805,0.008782184],"category_scores_gemma":[0.002594336,0.0010002671,0.0012741243,0.0029237627,0.00077555137,0.0021161735,0.0009659279,0.0029045786,0.0010311278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032537544,0.000057007117,0.00008429132,0.00015483968,0.000049204828,0.00014351624,0.000060928123,0.51141226,0.0013500418,0.4206999,0.0076201246,0.05833532],"study_design_scores_gemma":[0.000013106716,0.00002010242,0.00006492644,0.00004267631,0.000023551022,0.000055827226,0.00001985566,0.81680095,0.0005887565,0.1641276,0.018221742,0.000020887546],"about_ca_topic_score_codex":0.0117323315,"about_ca_topic_score_gemma":0.009992218,"teacher_disagreement_score":0.0117323315,"about_ca_system_score_codex":0.0014215304,"about_ca_system_score_gemma":0.001569318,"threshold_uncertainty_score":0.029379308},"labels":[],"label_agreement":null},{"id":"W2922093590","doi":"10.1007/978-3-030-23247-4_10","title":"Generalized de Bruijn Words and the State Complexity of Conjugate Sets","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Generalization; Word (group theory); Conjugate; State (computer science); Computer science; Arithmetic; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.01462106335471596,"score_gpt":0.25134246284634876,"score_spread":0.2367213994916328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922093590","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.7891536,0.00044676723,0.16217846,0.0017087251,0.00009935161,0.00009811053,0.000614705,0.00023751322,0.045462836],"genre_scores_gemma":[0.9839347,0.00016321435,0.009292773,0.00009130166,0.000088375375,0.000092459595,0.0002460288,0.000055255656,0.006035987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738866,0.0007620354,0.00022011323,0.0005175175,0.00067265093,0.00043916496],"domain_scores_gemma":[0.9830736,0.012999688,0.0011378858,0.0014228105,0.00075539754,0.000610557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016260087,0.0005515374,0.0011378764,0.0019780463,0.0020826012,0.008228868,0.0016773719,0.0017918317,0.008957977],"category_scores_gemma":[0.011519405,0.0008388022,0.0013497171,0.0021239917,0.005094513,0.012839605,0.0033624521,0.0032052475,0.0006316921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006765788,0.000033529832,0.00035482034,0.000028029333,0.000009915484,0.000066711036,0.00030575573,0.005749902,0.00066576776,0.9897804,0.00019236567,0.0027451979],"study_design_scores_gemma":[0.000010880725,0.0000106595535,0.00015336726,0.0000059221097,0.000007394643,0.000030020967,0.000055469503,0.016014451,0.00058474834,0.98278147,0.00033230672,0.000013379986],"about_ca_topic_score_codex":0.0010405742,"about_ca_topic_score_gemma":0.00087926857,"teacher_disagreement_score":0.008957977,"about_ca_system_score_codex":0.0022332922,"about_ca_system_score_gemma":0.0010708777,"threshold_uncertainty_score":0.029967427},"labels":[],"label_agreement":null},{"id":"W2922417370","doi":"10.1007/978-3-030-14815-7_13","title":"An Econometric Study of Inbound Tourism Demand in Hong Kong, Macao and Taiwan: A Case Study of Mainland China","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diverse Aspects of Tourism Research","field":"Social Sciences","cited_by":1,"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":"Distributed lag; Tourism; Mainland China; China; Cointegration; Term (time); Economy; Quarter (Canadian coin); Geography; Econometric model; Time series; Econometrics; Business; Economics; Statistics; Mathematics","score_opus":0.024856066295621055,"score_gpt":0.31658964148440205,"score_spread":0.291733575188781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922417370","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.99897635,0.0000511228,0.00015220456,0.00003344374,0.0000015013048,0.000009698697,0.0001708803,0.0000027720241,0.00060197094],"genre_scores_gemma":[0.99733716,0.00011610062,0.00018083291,0.0000130773615,0.0000033662689,0.0000136095005,0.00041919912,0.0000027462688,0.0019138865],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997527,0.00008481998,0.000013794116,0.000033336477,0.000024554254,0.00009081],"domain_scores_gemma":[0.99912316,0.00053187174,0.00010092714,0.000035506993,0.000094779454,0.00011381564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052007166,0.0004969844,0.0004882521,0.0012143228,0.0008357761,0.00083435216,0.000929714,0.0006211995,0.0027767653],"category_scores_gemma":[0.0008769693,0.0003660216,0.0008534982,0.0028355292,0.00073345366,0.00066023064,0.00079310493,0.00053826923,0.0002781394],"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.0005097623,0.0013099929,0.9350486,0.00020438552,0.00037821927,0.005098545,0.006385297,0.029709773,0.0025177973,0.0020558827,0.0017225182,0.015059359],"study_design_scores_gemma":[0.000031659,0.00052898016,0.9030655,0.00004570502,0.00020613965,0.00027461248,0.040274482,0.0530611,0.00089797983,0.0003035546,0.0012560128,0.000054301523],"about_ca_topic_score_codex":0.3869695,"about_ca_topic_score_gemma":0.39881995,"teacher_disagreement_score":0.3869695,"about_ca_system_score_codex":0.0037897287,"about_ca_system_score_gemma":0.0016442108,"threshold_uncertainty_score":0.7694342},"labels":[],"label_agreement":null},{"id":"W2924146857","doi":"10.1007/978-3-030-01771-2","title":"Discovery Science","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Région Normandie; Univerza v Ljubljani; Stockholms Universitet; Universita degli Studi di Bari Aldo Moro; Politechnika Poznańska; Università di Pisa; KU Leuven; Technische Universiteit Eindhoven; Universiteit Leiden; Università degli Studi di Torino; Indian Council of Agricultural Research; Universidade Federal do ABC; University of Cyprus; Imperial College London; University of Waikato; Middlesex University; University of Ottawa","keywords":"Computer science","score_opus":0.12001841429787952,"score_gpt":0.40621314063771735,"score_spread":0.28619472633983783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924146857","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015298781,0.027564667,0.35732943,0.01599809,0.0047977827,0.00015373612,0.0025265245,0.0040669763,0.5860329],"genre_scores_gemma":[0.054048922,0.035104584,0.14196712,0.005583245,0.0064130453,0.00049660186,0.006281591,0.0022347819,0.7478701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849427,0.00028034346,0.00006529676,0.00036088523,0.0007266801,0.00007245643],"domain_scores_gemma":[0.99734735,0.001162029,0.00008186665,0.0009026678,0.00037631125,0.00012968693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017958534,0.000962899,0.0013404079,0.0027549579,0.0010847216,0.005212077,0.0017731182,0.0017616986,0.06334942],"category_scores_gemma":[0.0050779795,0.0007260543,0.0008741769,0.002453531,0.002095169,0.005226456,0.0027369005,0.0033599217,0.04654229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017796334,0.000026631795,0.00015641795,0.00040748162,0.000033970293,0.000051242616,0.00010001349,0.00076970836,0.000651496,0.59344155,0.20302437,0.2013194],"study_design_scores_gemma":[0.000006077113,0.000009012786,0.00009994057,0.00009414989,0.000010815044,0.000115693525,0.000029591918,0.0017141819,0.0007012641,0.5162287,0.48098186,0.000008792677],"about_ca_topic_score_codex":0.00060523034,"about_ca_topic_score_gemma":0.000823824,"teacher_disagreement_score":0.06334942,"about_ca_system_score_codex":0.0016331418,"about_ca_system_score_gemma":0.0017656107,"threshold_uncertainty_score":0.21192497},"labels":[],"label_agreement":null},{"id":"W2924752388","doi":"10.1007/978-3-030-16667-0_9","title":"Automatically Generating Engaging Presentation Slide Decks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","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":"Presentation (obstetrics); Word (group theory); Public speaking; Quality (philosophy); Deck; Image editing","score_opus":0.018336807715412514,"score_gpt":0.2536974304813124,"score_spread":0.23536062276589986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924752388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08727467,0.0008286602,0.7282978,0.00048303162,0.0016148047,0.0011777299,0.004957691,0.13591288,0.0394527],"genre_scores_gemma":[0.29315022,0.00059540634,0.6304403,0.00023942837,0.00035233216,0.0010875742,0.014439961,0.007413065,0.052281782],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994398,0.00009964977,0.000029012048,0.00018255254,0.00019011811,0.00005873968],"domain_scores_gemma":[0.9985592,0.0007210551,0.000056733137,0.00015417856,0.00038025912,0.00012866141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004569168,0.001953508,0.0010184048,0.0011773261,0.00048817604,0.0018480354,0.0018553176,0.0012357044,0.054994717],"category_scores_gemma":[0.0034936918,0.0006501343,0.0007186212,0.00063531596,0.0002680897,0.0014334372,0.0023117187,0.0010196471,0.022075629],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001223461,0.00025300728,0.0012664198,0.0009744352,0.00006831135,0.0008915956,0.00046075872,0.010974221,0.10225995,0.0042667384,0.08469052,0.79267055],"study_design_scores_gemma":[0.00046739067,0.0008140488,0.003495402,0.0003193871,0.00020034655,0.0011004993,0.0014706287,0.5977027,0.23437978,0.015150002,0.14474727,0.00015259917],"about_ca_topic_score_codex":0.00062769424,"about_ca_topic_score_gemma":0.0011944392,"teacher_disagreement_score":0.054994717,"about_ca_system_score_codex":0.0004586179,"about_ca_system_score_gemma":0.00044967944,"threshold_uncertainty_score":0.18397564},"labels":[],"label_agreement":null},{"id":"W2925058582","doi":"10.1007/978-3-030-27272-2_19","title":"KPTransfer: Improved Performance and Faster Convergence from Keypoint Subset-Wise Domain Transfer in Human Pose Estimation","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Computer science; Convergence (economics); Domain (mathematical analysis); Set (abstract data type); Artificial intelligence; Pattern recognition (psychology); Joint (building); Task (project management); Transfer of learning; Pose; Machine learning; Algorithm; Mathematics","score_opus":0.01262125647384182,"score_gpt":0.23827330711631442,"score_spread":0.2256520506424726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925058582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05150561,0.00051273184,0.9339288,0.00017212686,0.000236468,0.00012938867,0.00027506187,0.010464503,0.0027753427],"genre_scores_gemma":[0.4964586,0.0003952799,0.48977342,0.00020895424,0.000108100205,0.00022652358,0.001290199,0.0011723301,0.010366538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990633,0.00022338814,0.000046097695,0.00024169964,0.00029973936,0.00012575882],"domain_scores_gemma":[0.9988224,0.000447196,0.0000433578,0.00037914288,0.00024961686,0.000058287456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015008113,0.0015289772,0.0011705317,0.00082031026,0.00045351026,0.0008845192,0.0013767016,0.001442734,0.0095864525],"category_scores_gemma":[0.0051771975,0.0004879827,0.00048576642,0.0009527194,0.0005727327,0.0022736413,0.0030206307,0.0014593202,0.0061324714],"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.0012293705,0.00021206487,0.00086594204,0.00020809472,0.000090570975,0.00016835735,0.0001237989,0.039375607,0.058699496,0.002712923,0.006733331,0.8895804],"study_design_scores_gemma":[0.000110182424,0.00040136202,0.0019197015,0.00002486282,0.000042789008,0.00053607544,0.00012385969,0.8896336,0.096685514,0.0059628533,0.0045104166,0.00004872883],"about_ca_topic_score_codex":0.002524083,"about_ca_topic_score_gemma":0.001814601,"teacher_disagreement_score":0.0095864525,"about_ca_system_score_codex":0.00025644028,"about_ca_system_score_gemma":0.0007400771,"threshold_uncertainty_score":0.032069862},"labels":[],"label_agreement":null},{"id":"W2925631053","doi":"10.1007/978-3-030-15719-7_14","title":"Neural Diverse Abstractive Sentence Compression Generation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Paraphrase; Sentence; Natural language processing; Machine translation; Artificial intelligence; Encoder; Compression (physics); Speech recognition","score_opus":0.02282935388186901,"score_gpt":0.2712604724152494,"score_spread":0.2484311185333804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925631053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08835626,0.0017151224,0.8667024,0.000761164,0.00092840905,0.00040641858,0.0019734858,0.012372741,0.026784016],"genre_scores_gemma":[0.5239674,0.0006132125,0.43666977,0.00059697893,0.00048095678,0.00045701695,0.006943713,0.0009359778,0.029335042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967146,0.00007700103,0.000021260168,0.00008751377,0.000097955264,0.00004482709],"domain_scores_gemma":[0.99934083,0.0002996963,0.000023991402,0.00011252133,0.00018973161,0.00003315923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043434493,0.0008524704,0.00064655195,0.0007870563,0.00044285145,0.000710561,0.0013047229,0.0010407433,0.01645932],"category_scores_gemma":[0.0015903929,0.0003055589,0.0006013116,0.0008478646,0.00037466292,0.0010927113,0.0012405873,0.0011046155,0.0043072687],"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.00036856424,0.00020083708,0.00034052684,0.00027648988,0.000050304363,0.00042711513,0.000111585105,0.031710874,0.051136408,0.015999034,0.024837006,0.8745413],"study_design_scores_gemma":[0.000088308836,0.00022206389,0.00073021115,0.000043076274,0.000068412,0.00044722902,0.00007608974,0.89534146,0.06306935,0.029963097,0.009916576,0.000034214856],"about_ca_topic_score_codex":0.0009335571,"about_ca_topic_score_gemma":0.0022968461,"teacher_disagreement_score":0.01645932,"about_ca_system_score_codex":0.0003376896,"about_ca_system_score_gemma":0.00045220574,"threshold_uncertainty_score":0.055061877},"labels":[],"label_agreement":null},{"id":"W2926325909","doi":"10.1007/978-3-030-17274-9_6","title":"Interpreting Deep Sports Analytics: Valuing Actions and Players in the NHL","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Computer science; Artificial intelligence; Tree (set theory); Machine learning; Reinforcement learning; Action (physics); Analytics; Deep learning; Feature (linguistics); Regression; Data science; Statistics; Mathematics","score_opus":0.02673667656586391,"score_gpt":0.2313291144708489,"score_spread":0.204592437904985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926325909","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.43412003,0.0027495245,0.34864807,0.010507161,0.00035229017,0.00008480426,0.002383832,0.0007061952,0.20044823],"genre_scores_gemma":[0.9650481,0.000537253,0.020739427,0.00023793588,0.00010389455,0.000030557236,0.0006315689,0.00013460312,0.012536637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948776,0.00022249886,0.000020591826,0.00009119291,0.00009333874,0.00008462454],"domain_scores_gemma":[0.9980919,0.0010976491,0.00021338176,0.00019023796,0.00020896959,0.00019801663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096102105,0.0006866987,0.00039449986,0.0013773083,0.0004217582,0.0058085625,0.0008529397,0.00087221793,0.012876445],"category_scores_gemma":[0.008064417,0.0003090579,0.00035853506,0.0015772007,0.0013977655,0.0057017314,0.0021027816,0.0016026328,0.0012549595],"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.0003990243,0.00023786236,0.0641967,0.00015811794,0.00011631654,0.00048424114,0.0046077655,0.024259057,0.0034988737,0.6146018,0.016134601,0.27130562],"study_design_scores_gemma":[0.000011548691,0.000045065703,0.016571475,0.000117467505,0.000035825495,0.00009295227,0.0037584135,0.09762246,0.0010531159,0.8680151,0.012648998,0.000027676699],"about_ca_topic_score_codex":0.0058115837,"about_ca_topic_score_gemma":0.006573734,"teacher_disagreement_score":0.012876445,"about_ca_system_score_codex":0.00090289774,"about_ca_system_score_gemma":0.00076300977,"threshold_uncertainty_score":0.04307604},"labels":[],"label_agreement":null},{"id":"W2926359022","doi":"10.1007/978-3-030-16145-3_36","title":"Neighbor-Based Link Prediction with Edge Uncertainty","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Link (geometry); Enhanced Data Rates for GSM Evolution; Ground truth; Focus (optics); Artificial intelligence; Data mining","score_opus":0.009964904634420848,"score_gpt":0.22999973586383407,"score_spread":0.22003483122941322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926359022","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.05047738,0.0010429891,0.9430548,0.0003226605,0.00018810695,0.00008210217,0.0007389555,0.0012316565,0.0028613682],"genre_scores_gemma":[0.7742331,0.0006866684,0.21584512,0.00017982615,0.00033668565,0.0001415212,0.0019596333,0.00017493944,0.006442479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00015401276,0.00004080356,0.00021668861,0.00019993458,0.00007618755],"domain_scores_gemma":[0.99544936,0.0033807494,0.00017798306,0.00043569793,0.00046350047,0.00009266403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015098822,0.00081893726,0.0018039485,0.0016656717,0.0006787168,0.0009693358,0.00272388,0.0013498545,0.002704046],"category_scores_gemma":[0.006364044,0.0007230658,0.00058032345,0.0025268688,0.0005458286,0.0025752247,0.0012512835,0.0013098508,0.00078520563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025882205,0.00013242883,0.0016732807,0.00008186013,0.000060317638,0.00006788119,0.000039245282,0.83340585,0.0008284625,0.00544698,0.0035850024,0.15441987],"study_design_scores_gemma":[0.0000022937666,0.0000049343776,0.000056572135,0.0000018891922,0.000004193607,0.000004639788,0.0000018801047,0.997969,0.0001333297,0.0017614155,0.000058209003,0.0000016894136],"about_ca_topic_score_codex":0.009437047,"about_ca_topic_score_gemma":0.010066643,"teacher_disagreement_score":0.009437047,"about_ca_system_score_codex":0.0007013388,"about_ca_system_score_gemma":0.0005895408,"threshold_uncertainty_score":0.018764257},"labels":[],"label_agreement":null},{"id":"W2927581056","doi":"10.1007/978-3-030-14799-0_7","title":"Robust Web Data Extraction Based on Unsupervised Visual Validation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Extractor; Robustness (evolution); Artificial intelligence; Data extraction; Information extraction; Information retrieval; Data mining; Machine learning","score_opus":0.05360116226821633,"score_gpt":0.28637844600660023,"score_spread":0.2327772837383839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927581056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014935451,0.00024794508,0.97674567,0.00006921817,0.000057789075,0.00011639585,0.0003946301,0.006026827,0.0014061775],"genre_scores_gemma":[0.23442972,0.00030112188,0.75521773,0.00015930152,0.00006812705,0.0003138645,0.0031986388,0.0015786946,0.0047327946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972916,0.00044924297,0.00019667773,0.0005923219,0.0012623229,0.00020777887],"domain_scores_gemma":[0.9935767,0.0019894626,0.00045278488,0.0016909086,0.0021938328,0.000096280535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022946007,0.0009271901,0.0011430314,0.00466042,0.00061279256,0.0032901447,0.0019941565,0.0012255703,0.0027027514],"category_scores_gemma":[0.0074673053,0.00059637055,0.0014706292,0.0024556161,0.00094806374,0.0023922431,0.002623857,0.001076289,0.0031536794],"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.00036289112,0.00019593429,0.003540768,0.00025159807,0.00014724441,0.00016161459,0.000121205914,0.01606132,0.09394462,0.0039804913,0.006829635,0.87440264],"study_design_scores_gemma":[0.00004546901,0.0001109167,0.0056071207,0.000090785295,0.00009204679,0.00047620313,0.00013551141,0.82168955,0.14970219,0.011659332,0.01031326,0.000077561],"about_ca_topic_score_codex":0.0023281523,"about_ca_topic_score_gemma":0.002930873,"teacher_disagreement_score":0.00466042,"about_ca_system_score_codex":0.00052647956,"about_ca_system_score_gemma":0.0010789062,"threshold_uncertainty_score":0.012135148},"labels":[],"label_agreement":null},{"id":"W2927658665","doi":"10.1007/11970125_10","title":"A Randomized Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Computer science; Online algorithm; Partition (number theory); Cluster analysis; Randomized algorithm; Upper and lower bounds; Extension (predicate logic); Algorithm; Set (abstract data type); Partition problem; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.050693750502957165,"score_gpt":0.31263577829739636,"score_spread":0.2619420277944392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927658665","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.00803305,0.00031173357,0.98163027,0.00046564947,0.00023520699,0.00036454908,0.00038361823,0.0035622744,0.005013724],"genre_scores_gemma":[0.06960627,0.00017124818,0.91857535,0.00031629505,0.00017535704,0.00083905814,0.0011199911,0.0006415389,0.008554957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966016,0.0010416317,0.00018750971,0.00089480786,0.00079629815,0.00047812646],"domain_scores_gemma":[0.9942227,0.0027307675,0.00030723464,0.001628246,0.00067846105,0.00043265548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028844732,0.0022845578,0.004184288,0.0021008933,0.0027126535,0.0026711673,0.009429392,0.0041281907,0.019919528],"category_scores_gemma":[0.011148502,0.0016299022,0.0023140053,0.004961993,0.0018631908,0.005288242,0.006267627,0.0038040045,0.0066353744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017810772,0.00088259985,0.0006524802,0.00048274745,0.00018260506,0.000104455634,0.00024024166,0.29553425,0.005276692,0.08461415,0.05337032,0.5568785],"study_design_scores_gemma":[0.00036864728,0.00015485684,0.00018658205,0.000026485304,0.00004378711,0.000084138104,0.000059367536,0.93702316,0.0017966889,0.055966225,0.0042515597,0.00003853571],"about_ca_topic_score_codex":0.0068755974,"about_ca_topic_score_gemma":0.0094039375,"teacher_disagreement_score":0.019919528,"about_ca_system_score_codex":0.0037121768,"about_ca_system_score_gemma":0.0050793886,"threshold_uncertainty_score":0.0666374},"labels":[],"label_agreement":null},{"id":"W2929109815","doi":"10.1007/978-3-030-15712-8_17","title":"Predicting the Topic of Your Next Query for Just-In-Time IR","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Query optimization; Information retrieval; Data mining","score_opus":0.03061626623356764,"score_gpt":0.259551514599702,"score_spread":0.22893524836613435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929109815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1806618,0.011621759,0.7645444,0.0036109507,0.002378061,0.00060321996,0.005682321,0.016292455,0.014604995],"genre_scores_gemma":[0.5423426,0.0038012895,0.41089705,0.00062540534,0.0026882258,0.00025451937,0.012567221,0.0010922241,0.025731413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999218,0.00022287262,0.00006712872,0.00016857596,0.000206622,0.00011669446],"domain_scores_gemma":[0.9984408,0.000885989,0.000062789404,0.00021521773,0.0002791605,0.00011607181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017327507,0.0010651245,0.0015010886,0.0018542503,0.00072057603,0.0019415721,0.0012551825,0.0014252111,0.00936162],"category_scores_gemma":[0.0037591872,0.00036987584,0.0010104298,0.001561993,0.00039321123,0.002847171,0.0008030353,0.0013243172,0.0054388316],"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.0021643955,0.0006842042,0.0075157816,0.0006058607,0.00016172201,0.00028529234,0.00016887882,0.016873427,0.08251438,0.0047690053,0.08026099,0.80399615],"study_design_scores_gemma":[0.00014590961,0.0006590239,0.0048160367,0.000048810387,0.00022229088,0.0007831649,0.00022459801,0.9396094,0.024086576,0.014709249,0.01461812,0.00007686161],"about_ca_topic_score_codex":0.0024992705,"about_ca_topic_score_gemma":0.004900248,"teacher_disagreement_score":0.00936162,"about_ca_system_score_codex":0.0004643843,"about_ca_system_score_gemma":0.0010709893,"threshold_uncertainty_score":0.03131777},"labels":[],"label_agreement":null},{"id":"W2929309453","doi":"10.1007/978-3-030-17287-9_24","title":"Exploring the Effectiveness of Socially-Oriented Persuasive Strategies in Education","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Persuasive technology; Operationalization; Preference; Class (philosophy); Computer science; Mathematics education; Psychology; Persuasion; Knowledge management; Social psychology; Artificial intelligence","score_opus":0.030529284461304502,"score_gpt":0.3076757989899815,"score_spread":0.277146514528677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929309453","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.95751995,0.0012122991,0.0017899601,0.00036839923,0.000043484022,0.00024355238,0.000039301027,0.00003497597,0.038748115],"genre_scores_gemma":[0.9926292,0.0006302774,0.0033985777,0.00007683716,0.000012130211,0.00021810437,0.000032571752,0.000012142305,0.0029900724],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957569,0.0028570513,0.0001534462,0.00023852225,0.0007728813,0.00022112907],"domain_scores_gemma":[0.94769794,0.049770057,0.0009780048,0.0003479846,0.00071158755,0.00049439777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050448827,0.00060480303,0.00045345037,0.0011612976,0.0006937975,0.0033419458,0.00091550214,0.0011859592,0.007164973],"category_scores_gemma":[0.02821058,0.0002698085,0.00045618392,0.0007562119,0.00083042367,0.0020396372,0.001014455,0.0011761055,0.0005292791],"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.0042689606,0.018466521,0.046923134,0.00338417,0.00060577894,0.00042450154,0.081200935,0.0026414446,0.010713457,0.03193413,0.0019900627,0.7974469],"study_design_scores_gemma":[0.005843829,0.060072966,0.50470924,0.006345328,0.0060361377,0.001743508,0.20117645,0.027904099,0.046643082,0.088784955,0.050284714,0.0004557176],"about_ca_topic_score_codex":0.0010361914,"about_ca_topic_score_gemma":0.0012411778,"teacher_disagreement_score":0.007164973,"about_ca_system_score_codex":0.0008147349,"about_ca_system_score_gemma":0.0013099181,"threshold_uncertainty_score":0.026680171},"labels":[],"label_agreement":null},{"id":"W2929890002","doi":"10.1007/978-3-030-16145-3_13","title":"Dynamic Student Classiffication on Memory Networks for Knowledge Tracing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; Process (computing); Artificial intelligence; Machine learning; Programming language","score_opus":0.02384438669247917,"score_gpt":0.2807292675751062,"score_spread":0.256884880882627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929890002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18799846,0.0007310795,0.80027544,0.0005322223,0.00009356407,0.00017903336,0.0011104784,0.003560003,0.0055197356],"genre_scores_gemma":[0.8293721,0.00029039476,0.16061437,0.00008321497,0.000083515086,0.00013391853,0.0010136812,0.00011346001,0.008295246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.000126959,0.000041916053,0.00014417917,0.00009213186,0.00009819102],"domain_scores_gemma":[0.9958884,0.0024226522,0.00025969997,0.0006634334,0.0005898521,0.00017595301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010099342,0.00046811183,0.0008514041,0.0026491513,0.00072564714,0.0012962401,0.0017636108,0.0010203269,0.005395483],"category_scores_gemma":[0.0064937556,0.0003301952,0.000556276,0.0017923471,0.00042555548,0.0022885567,0.0014848433,0.000756691,0.0008157332],"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.0008269347,0.0002784608,0.008741346,0.000100248646,0.00009392796,0.0001560234,0.00027780907,0.2220367,0.0045894356,0.01944908,0.0056684613,0.73778164],"study_design_scores_gemma":[0.000008034498,0.000025163003,0.0006469235,0.000010859816,0.000019314572,0.000023097784,0.00003592066,0.98828727,0.0010778399,0.009229172,0.0006307896,0.000005688143],"about_ca_topic_score_codex":0.015447707,"about_ca_topic_score_gemma":0.018887445,"teacher_disagreement_score":0.015447707,"about_ca_system_score_codex":0.0012656678,"about_ca_system_score_gemma":0.001074816,"threshold_uncertainty_score":0.030715585},"labels":[],"label_agreement":null},{"id":"W2931227804","doi":"10.1007/978-3-030-32226-7_91","title":"Improved Inference via Deep Input Transfer","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Leverage (statistics); Dice; Boosting (machine learning); Inference; Pattern recognition (psychology); Convolutional neural network; Transfer of learning; Deep learning; Machine learning; Image segmentation; Mathematics","score_opus":0.013743988802244127,"score_gpt":0.257565635406607,"score_spread":0.24382164660436287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931227804","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.012504065,0.00053703075,0.9721994,0.00087774737,0.00033509397,0.00005736801,0.00048482497,0.008474463,0.0045300606],"genre_scores_gemma":[0.56002295,0.00045578432,0.3980311,0.0012180211,0.00062443526,0.00021118297,0.002770381,0.0016609291,0.035005335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988199,0.00029956148,0.00006104323,0.00039186643,0.0002564534,0.00017107953],"domain_scores_gemma":[0.9955869,0.0024847002,0.000116259194,0.001069726,0.00059197744,0.00015038603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001821691,0.0016679261,0.001941523,0.0009935512,0.0008346782,0.002291919,0.0034463906,0.0030789142,0.0207732],"category_scores_gemma":[0.009887536,0.0012528098,0.0016826021,0.0010446088,0.0010536104,0.004207976,0.00387784,0.004680143,0.005751201],"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.0008393087,0.00038314343,0.0015397625,0.00034553107,0.0002846368,0.00034706594,0.00013537775,0.29044524,0.014045294,0.03992186,0.022244915,0.62946784],"study_design_scores_gemma":[0.00002756776,0.000025669673,0.00013700216,0.000014693931,0.000029472301,0.00002727599,0.000008731692,0.97057694,0.0037500986,0.02439765,0.0009964211,0.000008508958],"about_ca_topic_score_codex":0.006873852,"about_ca_topic_score_gemma":0.010389094,"teacher_disagreement_score":0.0207732,"about_ca_system_score_codex":0.0011846392,"about_ca_system_score_gemma":0.0020176482,"threshold_uncertainty_score":0.069493294},"labels":[],"label_agreement":null},{"id":"W2932065239","doi":"10.1007/978-3-030-16722-6_24","title":": Priority Aware Test Case Reduction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reduction (mathematics); Test case; Debugging; Code coverage; Test (biology); Abstract syntax tree; Programming language; Queue; Priority queue; Process (computing); Set (abstract data type); Software; Reliability engineering; Machine learning; Parsing","score_opus":0.020987685690595698,"score_gpt":0.26446983885645753,"score_spread":0.24348215316586183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932065239","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.029225672,0.0013763416,0.9298493,0.00064690894,0.00029309368,0.00048533472,0.0005803767,0.02374992,0.0137930075],"genre_scores_gemma":[0.23208763,0.0007967255,0.74076366,0.0007542123,0.0001935074,0.0003737357,0.003262975,0.0036935024,0.018073985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546707,0.0006933442,0.00023619473,0.0006290932,0.0026519632,0.00032234646],"domain_scores_gemma":[0.9938969,0.0019790998,0.0004567732,0.0020710032,0.0014432048,0.00015308656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015940131,0.0015246731,0.0006540567,0.0022134779,0.0004946539,0.0017679681,0.0028978938,0.0009194775,0.0055036913],"category_scores_gemma":[0.008277807,0.0006908097,0.0012154191,0.0017727114,0.0008386719,0.0022361279,0.0016514261,0.0020955598,0.002885454],"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.00029003393,0.0002955471,0.0021807733,0.0004409114,0.00006865862,0.0003947863,0.0002665575,0.016318938,0.062426064,0.015461418,0.026458465,0.8753979],"study_design_scores_gemma":[0.00026523464,0.0008107933,0.0059943805,0.00021405963,0.00025587133,0.003475079,0.00031712992,0.48314852,0.29356325,0.07467181,0.13711123,0.00017275219],"about_ca_topic_score_codex":0.0025718475,"about_ca_topic_score_gemma":0.0030757103,"teacher_disagreement_score":0.0055036913,"about_ca_system_score_codex":0.00097598345,"about_ca_system_score_gemma":0.0020876704,"threshold_uncertainty_score":0.018411636},"labels":[],"label_agreement":null},{"id":"W29329506","doi":"10.1007/978-3-319-06251-8_2","title":"Endowing Concurrent Kleene Algebra with Communication Actions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Concurrency; Kleene algebra; Computer science; Process calculus; Extension (predicate logic); Programming language; Algebra over a field; Theoretical computer science; Kleene's recursion theorem; Discrete mathematics; Algorithm; Mathematics; Pure mathematics","score_opus":0.029717051627587223,"score_gpt":0.2581513673901379,"score_spread":0.22843431576255066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29329506","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.02643242,0.00081348233,0.8908089,0.0009588008,0.00029958496,0.00006892603,0.00017577712,0.00089918665,0.07954296],"genre_scores_gemma":[0.67392665,0.0019306571,0.2643162,0.0004047031,0.0007133553,0.00028323487,0.00048497407,0.0005393451,0.05740095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980094,0.0004492806,0.00016635144,0.0004104373,0.00070855516,0.00025598568],"domain_scores_gemma":[0.9976096,0.0010461778,0.00020183538,0.0005627427,0.0003396447,0.00024004871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016632022,0.0008034552,0.0008389054,0.0012983085,0.0023391552,0.0060424455,0.001990203,0.0013402937,0.008858945],"category_scores_gemma":[0.004531741,0.0010062889,0.0015518477,0.0016678149,0.0044035483,0.013384258,0.0043754284,0.004084835,0.0023922988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014438442,0.000008201724,0.00004108656,0.000018261686,0.0000037463633,0.00003880997,0.00010331151,0.0012323924,0.00057295937,0.9942984,0.00027549788,0.00339296],"study_design_scores_gemma":[0.0000070650444,0.000007751106,0.000020774312,0.000009422337,0.0000066243733,0.000053922664,0.000024227922,0.005003564,0.00076453446,0.98674333,0.0073493607,0.000009376352],"about_ca_topic_score_codex":0.0016268526,"about_ca_topic_score_gemma":0.0015551043,"teacher_disagreement_score":0.008858945,"about_ca_system_score_codex":0.0017097669,"about_ca_system_score_gemma":0.001569123,"threshold_uncertainty_score":0.029636145},"labels":[],"label_agreement":null},{"id":"W2934278041","doi":"10.1007/978-3-030-15712-8_26","title":"Simple Techniques for Cross-Collection Relevance Feedback","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relevance (law); Inference; Simple (philosophy); Information retrieval; Relevance feedback; Word (group theory); Machine learning; Artificial intelligence; Grossman; Data mining; Mathematics","score_opus":0.021539275646080804,"score_gpt":0.2976832243165911,"score_spread":0.2761439486705103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934278041","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.0009750923,0.0005319999,0.9929334,0.00006403459,0.00011410306,0.0002579686,0.00017724393,0.003342666,0.001603574],"genre_scores_gemma":[0.02987025,0.00049982144,0.95872426,0.000109683904,0.0002885548,0.00046393508,0.000707653,0.0006599843,0.00867583],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9906503,0.0029844956,0.0008827615,0.0011307054,0.003966141,0.00038565748],"domain_scores_gemma":[0.9829883,0.0062536565,0.00053469755,0.006273204,0.0037262833,0.00022391735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006283084,0.0020760107,0.0024949152,0.0054674023,0.0017665833,0.002815092,0.0036256968,0.0023201152,0.026795158],"category_scores_gemma":[0.029005338,0.0010837007,0.0024273181,0.0059757764,0.00095615035,0.0061565447,0.0052173208,0.002500167,0.020964935],"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.0002524431,0.00019392287,0.00030351352,0.00059490214,0.00011619542,0.00007175619,0.00024188701,0.0038738663,0.016848022,0.014471241,0.018677112,0.9443552],"study_design_scores_gemma":[0.00066649367,0.0010040862,0.0045668753,0.00041046704,0.0006896384,0.0033210216,0.0006853949,0.49675003,0.09878481,0.24084644,0.1517574,0.00051736523],"about_ca_topic_score_codex":0.0018100843,"about_ca_topic_score_gemma":0.0053160796,"teacher_disagreement_score":0.026795158,"about_ca_system_score_codex":0.00074402615,"about_ca_system_score_gemma":0.0013752287,"threshold_uncertainty_score":0.08963871},"labels":[],"label_agreement":null},{"id":"W2934857089","doi":"10.1007/978-3-030-15712-8_55","title":"On Interpretability and Feature Representations: An Analysis of the Sentiment Neuron","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Interpretability; Computer science; Sentiment analysis; Artificial intelligence; Classifier (UML); Neuron; Feature (linguistics); Representation (politics); Pattern recognition (psychology); Machine learning; Neuroscience","score_opus":0.015165132403360366,"score_gpt":0.275229253428267,"score_spread":0.2600641210249066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934857089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30641198,0.0025537587,0.65797806,0.0023608801,0.00016497183,0.000084552856,0.00053117325,0.00040983027,0.029504793],"genre_scores_gemma":[0.9344971,0.0010042886,0.05825973,0.00013943284,0.00015745584,0.000043784203,0.00035782537,0.0001456891,0.0053946683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997298,0.00007438533,0.000015744965,0.000051621122,0.00009362866,0.000034778193],"domain_scores_gemma":[0.9987949,0.0007744162,0.000082371225,0.00011055333,0.00020500856,0.000032644333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085142965,0.00040585225,0.0004684859,0.00073939643,0.0004069056,0.0018597895,0.00060687255,0.00054121605,0.0037264042],"category_scores_gemma":[0.0054597794,0.00018446153,0.00051841664,0.0008877402,0.00073814957,0.0025135335,0.0007119417,0.0009585744,0.00027976598],"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.0003734451,0.00010936431,0.0085573625,0.00031639,0.00013998503,0.0006084948,0.0009937048,0.04845133,0.041484736,0.426885,0.00853723,0.46354297],"study_design_scores_gemma":[0.00001138312,0.00007796434,0.008110079,0.000047848782,0.000052736912,0.00023298994,0.00023741163,0.63864404,0.0042534787,0.3447354,0.0035771746,0.00001947271],"about_ca_topic_score_codex":0.0013907108,"about_ca_topic_score_gemma":0.0010906684,"teacher_disagreement_score":0.0037264042,"about_ca_system_score_codex":0.0006067661,"about_ca_system_score_gemma":0.00024995976,"threshold_uncertainty_score":0.012466013},"labels":[],"label_agreement":null},{"id":"W2934878457","doi":"10.1007/978-3-030-17274-9_15","title":"Predicting the Receivers of Football Passes","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Football; Computer science; Rank (graph theory); Baseline (sea); Classifier (UML); Football team; Work (physics); Artificial intelligence; Data science; Engineering; Mathematics","score_opus":0.02462282738590931,"score_gpt":0.209442364933865,"score_spread":0.1848195375479557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934878457","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.9807931,0.0005826925,0.01011824,0.0009558146,0.00006352969,0.000024882997,0.0029786446,0.00012738009,0.0043557244],"genre_scores_gemma":[0.9861202,0.0003250048,0.001485519,0.000052345476,0.00017301217,0.000013134568,0.0035229397,0.000020694655,0.008287156],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967754,0.00007170056,0.000019541574,0.00008469842,0.000056698995,0.00008986535],"domain_scores_gemma":[0.9966974,0.0019579388,0.00063324574,0.00012639834,0.00025346043,0.00033156012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011415221,0.00036649642,0.00051611016,0.0016744885,0.0002614988,0.0013298601,0.0010236962,0.0011706728,0.008954435],"category_scores_gemma":[0.006269908,0.00041681502,0.00039731915,0.0010122943,0.00029169637,0.0011783588,0.00044611632,0.0011913651,0.00277888],"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.0006600158,0.00033935424,0.9141196,0.000037859198,0.00020063244,0.0001779043,0.000128429,0.03333855,0.00095969473,0.0035749772,0.0073447158,0.039118174],"study_design_scores_gemma":[0.000070756185,0.0004609331,0.43113554,0.000051367893,0.00017514746,0.00029897594,0.0008989886,0.5519219,0.0017420853,0.009333257,0.003868728,0.00004233164],"about_ca_topic_score_codex":0.009658214,"about_ca_topic_score_gemma":0.012280919,"teacher_disagreement_score":0.009658214,"about_ca_system_score_codex":0.0004521947,"about_ca_system_score_gemma":0.00034037064,"threshold_uncertainty_score":0.029955566},"labels":[],"label_agreement":null},{"id":"W2934879341","doi":"10.1007/978-3-030-15712-8_61","title":"Extracting Temporal Event Relations Based on Event Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Event (particle physics); Traverse; Artificial intelligence; Context (archaeology); Set (abstract data type); Natural language processing; Sentence; Relationship extraction; Relation (database); Data mining; Information extraction","score_opus":0.013095279612134282,"score_gpt":0.2691262062877092,"score_spread":0.2560309266755749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934879341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059884854,0.003178699,0.90830696,0.0003602185,0.0002455105,0.00048358462,0.011343656,0.0054377336,0.010758826],"genre_scores_gemma":[0.41648385,0.00409049,0.5418327,0.00015764024,0.0003437033,0.00045026466,0.027937362,0.0005563158,0.008147593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.000066132576,0.00007755417,0.00029442183,0.00016099923,0.0000654505],"domain_scores_gemma":[0.99853206,0.0008659991,0.00022489476,0.000121402874,0.00019575135,0.000059958867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056949985,0.0012828044,0.0006668936,0.005312946,0.00064689195,0.0013658693,0.0009473441,0.00076014164,0.0048229652],"category_scores_gemma":[0.0031270415,0.00055652764,0.0013231882,0.0041544857,0.00034150627,0.0025318025,0.0008730994,0.0010216209,0.0026447854],"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.0015759438,0.0005203859,0.019124733,0.0014460873,0.00040070165,0.0030360892,0.0004693048,0.043934345,0.06143791,0.036501482,0.019231582,0.81232154],"study_design_scores_gemma":[0.0001176446,0.00026002573,0.027853677,0.00044160613,0.001003245,0.0025179447,0.0006101404,0.7635137,0.04418821,0.09494999,0.064426005,0.00011790911],"about_ca_topic_score_codex":0.00547202,"about_ca_topic_score_gemma":0.008891772,"teacher_disagreement_score":0.00547202,"about_ca_system_score_codex":0.00070472626,"about_ca_system_score_gemma":0.00087801233,"threshold_uncertainty_score":0.01613444},"labels":[],"label_agreement":null},{"id":"W2935203022","doi":"10.1007/978-3-030-16722-6_1","title":"Software Assurance in an Uncertain World","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software security assurance; Mathematical proof; Computer security; Argument (complex analysis); Software; Software system; Risk analysis (engineering); Key (lock); Compliance (psychology); Software engineering; Software development; Information assurance; Information security; Business; Security service","score_opus":0.012668411569399681,"score_gpt":0.21897036187248203,"score_spread":0.20630195030308235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935203022","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011931487,0.03414775,0.41925874,0.034454923,0.00095190015,0.00009672639,0.00018841261,0.00059963006,0.49837044],"genre_scores_gemma":[0.65591925,0.03656703,0.17455766,0.0047362004,0.0021501079,0.00030606065,0.0003711165,0.0004258716,0.124966696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997781,0.00092369487,0.00011791101,0.00024096298,0.00082916423,0.00010736965],"domain_scores_gemma":[0.9941214,0.0048142183,0.00017973557,0.0004557197,0.00034020672,0.00008870418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028677026,0.00067121454,0.0004917179,0.0016788249,0.0013599641,0.0062085576,0.0011428565,0.0024273852,0.004679761],"category_scores_gemma":[0.006188771,0.00053580635,0.000594691,0.0012360169,0.011546797,0.0101646865,0.0031746272,0.004638996,0.0012678655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038553144,0.0000029857038,0.000044304732,0.000054287022,0.0000037367558,0.000050699608,0.0004266893,0.0010125239,0.00011002284,0.9833356,0.0026631993,0.012292085],"study_design_scores_gemma":[0.0000024474848,0.0000070516176,0.000045055756,0.000105652725,0.0000041063486,0.00006855235,0.00010836553,0.0020664704,0.0001751641,0.9290077,0.06840264,0.0000067502315],"about_ca_topic_score_codex":0.00084988755,"about_ca_topic_score_gemma":0.0007154912,"teacher_disagreement_score":0.0062085576,"about_ca_system_score_codex":0.0024189695,"about_ca_system_score_gemma":0.0013175638,"threshold_uncertainty_score":0.017550886},"labels":[],"label_agreement":null},{"id":"W2935694433","doi":"10.1007/978-3-030-18305-9_24","title":"Sparseout: Controlling Sparsity in Deep Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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 Saskatchewan","funders":"","keywords":"Dropout (neural networks); Computer science; Overfitting; Regularization (linguistics); Artificial neural network; Artificial intelligence; Deep neural networks; Contextual image classification; Source code; Image (mathematics); Machine learning; Property (philosophy); Code (set theory); Deep learning; Simple (philosophy)","score_opus":0.013196336258663689,"score_gpt":0.23320492622154437,"score_spread":0.2200085899628807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935694433","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.0055703633,0.00046689832,0.9895845,0.00021277742,0.00012084444,0.000019528914,0.00011015517,0.0012321103,0.0026827254],"genre_scores_gemma":[0.3735291,0.0019408634,0.587787,0.0005692032,0.0004991635,0.00026421304,0.0010027941,0.002009811,0.03239787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999747,0.000073753276,0.000009054636,0.000056971898,0.00008270142,0.000030518277],"domain_scores_gemma":[0.9991709,0.0005619156,0.000048204525,0.00009921072,0.00007379863,0.00004591802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008621998,0.00097100093,0.00073071854,0.00037793393,0.00026475405,0.00089856674,0.0013342528,0.00109497,0.0055983495],"category_scores_gemma":[0.0030923777,0.00057072897,0.0004153621,0.0005658026,0.00089691667,0.0017521698,0.0016062969,0.0024567798,0.0009905569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022336224,0.00012568296,0.0003597961,0.00019136365,0.00006936009,0.0000736338,0.000065929096,0.5654289,0.011344117,0.08036343,0.021999646,0.31975484],"study_design_scores_gemma":[0.000009101171,0.00001953751,0.000033925357,0.000008103932,0.0000050367335,0.000009738603,0.0000032343362,0.96913034,0.0017432328,0.027588466,0.0014448786,0.000004393025],"about_ca_topic_score_codex":0.0015452566,"about_ca_topic_score_gemma":0.0025989185,"teacher_disagreement_score":0.0055983495,"about_ca_system_score_codex":0.00047363213,"about_ca_system_score_gemma":0.0004938963,"threshold_uncertainty_score":0.018728316},"labels":[],"label_agreement":null},{"id":"W2936148280","doi":"10.1007/978-3-030-28796-2_10","title":"Circularly Squarefree Words and Unbordered Conjugates: A New Approach","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Square-free integer; Conjugate; Word (group theory); Mathematics; Binary number; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.017454630119164944,"score_gpt":0.24844484626922583,"score_spread":0.23099021615006088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936148280","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.08106844,0.0038917423,0.78733766,0.0021110037,0.0019813646,0.00009834523,0.0002112646,0.000333131,0.122967005],"genre_scores_gemma":[0.7016639,0.0044941697,0.1840495,0.0017767794,0.0030925602,0.0002221325,0.0003457096,0.00047038187,0.10388485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993357,0.00018436824,0.00005066627,0.00021246554,0.00013391653,0.00008295756],"domain_scores_gemma":[0.99895287,0.00038026506,0.00010186057,0.00021438289,0.00023189162,0.00011879759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077137374,0.0011613801,0.0010102787,0.0025857058,0.0016363093,0.004841174,0.0015931726,0.0016910197,0.006696618],"category_scores_gemma":[0.0018163424,0.00066822616,0.0011923511,0.0017291806,0.0034629086,0.007198571,0.0029702063,0.0026362613,0.002044094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001784556,0.000023922095,0.00007578452,0.000028353223,0.0000040605496,0.000092532246,0.0002521825,0.00047221087,0.0008651678,0.9910794,0.0006951732,0.0063934317],"study_design_scores_gemma":[0.0000063447706,0.000024319903,0.000053342872,0.000011746998,0.000008780409,0.00011810696,0.00012755704,0.005919114,0.0005092345,0.9845685,0.008640057,0.000013009352],"about_ca_topic_score_codex":0.00032263485,"about_ca_topic_score_gemma":0.00045950428,"teacher_disagreement_score":0.006696618,"about_ca_system_score_codex":0.0009466071,"about_ca_system_score_gemma":0.00050568423,"threshold_uncertainty_score":0.022402406},"labels":[],"label_agreement":null},{"id":"W2937081431","doi":"10.1007/978-3-030-16670-0_11","title":"A Model of External Memory for Navigation in Partially Observable Visual Reinforcement Learning Tasks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Reinforcement learning; Observability; Recall; Auxiliary memory; State (computer science); Probabilistic logic; Artificial intelligence; Memory model; Process (computing); Human–computer interaction; Shared memory; Cognitive psychology; Programming language","score_opus":0.02948238713968614,"score_gpt":0.2753781425012197,"score_spread":0.24589575536153357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937081431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1505575,0.0009371651,0.81810147,0.0017991512,0.00027042552,0.000092357106,0.0009392065,0.0010155538,0.026287157],"genre_scores_gemma":[0.9544094,0.00042070006,0.02598475,0.00012351054,0.00007509942,0.00016338118,0.00026388976,0.00008419291,0.018475082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996313,0.00009826309,0.000022083601,0.000107836524,0.00005401015,0.000086538006],"domain_scores_gemma":[0.99886864,0.00057587243,0.00016414524,0.00010728667,0.00015884486,0.00012507057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062659266,0.0007319015,0.0016098676,0.00054388685,0.00051554816,0.002255569,0.0035038064,0.0024380162,0.0107023325],"category_scores_gemma":[0.0032930407,0.00064518146,0.001024544,0.00092113035,0.0012590518,0.002259815,0.0014223095,0.0017515603,0.0009829815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018497411,0.00011352157,0.0005918663,0.00012013032,0.000080813676,0.00021293902,0.00014687309,0.82171226,0.0017711419,0.15646939,0.0016887545,0.016907355],"study_design_scores_gemma":[0.00003303974,0.00003648784,0.00012865136,0.00000712057,0.000013985197,0.000021222788,0.00000949591,0.9586708,0.00013375252,0.04067661,0.00025848878,0.000010326662],"about_ca_topic_score_codex":0.011902275,"about_ca_topic_score_gemma":0.0075570624,"teacher_disagreement_score":0.011902275,"about_ca_system_score_codex":0.0015106321,"about_ca_system_score_gemma":0.0013463001,"threshold_uncertainty_score":0.0358029},"labels":[],"label_agreement":null},{"id":"W2937643529","doi":"10.1007/978-3-540-77120-3_20","title":"Linear Reconfiguration of Cube-Style Modular Robots","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Carleton University","funders":"","keywords":"Control reconfiguration; Bounding overwatch; Robot; Self-reconfiguring modular robot; Modular design; Cube (algebra); Computer science; Distributed computing; Parallel computing; Algorithm; Mobile robot; Embedded system; Combinatorics; Mathematics; Artificial intelligence; Robot control; Programming language","score_opus":0.026549334976758352,"score_gpt":0.2476930163172743,"score_spread":0.22114368134051596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937643529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28775352,0.001729756,0.61612105,0.00031058473,0.00029297575,0.00010288115,0.00026138895,0.0019998685,0.09142796],"genre_scores_gemma":[0.8636512,0.00090775976,0.115689434,0.0001270306,0.000059199294,0.000107708445,0.0002877445,0.00018249817,0.018987458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991727,0.000016397402,0.0000034681648,0.000017874365,0.000027394879,0.000017607117],"domain_scores_gemma":[0.9999201,0.000016181717,0.000016081429,0.000016385193,0.000016887847,0.000014268173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009329981,0.0004047918,0.00026702724,0.00027973903,0.00020280395,0.00034752832,0.00042829785,0.00023156959,0.0030998723],"category_scores_gemma":[0.00021829056,0.00018172039,0.00029089098,0.00038819766,0.00034532545,0.0004963687,0.0006031555,0.00032897107,0.0007067373],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030324605,0.00008902593,0.00058411836,0.00032856548,0.000052691063,0.00033712393,0.0002308786,0.4180385,0.16591643,0.061793383,0.008036695,0.34428933],"study_design_scores_gemma":[0.00007210359,0.00064030004,0.0017314575,0.000047598194,0.00003116063,0.00057126686,0.0001466301,0.82400125,0.05466087,0.088715225,0.029323688,0.000058386533],"about_ca_topic_score_codex":0.00035594997,"about_ca_topic_score_gemma":0.00066182297,"teacher_disagreement_score":0.0030998723,"about_ca_system_score_codex":0.0002154057,"about_ca_system_score_gemma":0.00015172818,"threshold_uncertainty_score":0.010370076},"labels":[],"label_agreement":null},{"id":"W2937861079","doi":"10.1007/978-3-030-16458-4_20","title":"Improved Efficiency of a Linearly Homomorphic Cryptosystem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Cryptosystem; Paillier cryptosystem; Homomorphic encryption; Computer science; Prime (order theory); Algorithm; Cryptography; Mathematics; Computer security; Combinatorics; Hybrid cryptosystem; Encryption","score_opus":0.011277399367874209,"score_gpt":0.22198251014711806,"score_spread":0.21070511077924386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937861079","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.34479532,0.0024747618,0.511888,0.0020368467,0.0004843364,0.00022438321,0.0006973872,0.0067216745,0.13067725],"genre_scores_gemma":[0.8711276,0.0007338784,0.09194592,0.00022252402,0.00029987487,0.00009078633,0.0004001351,0.00042765477,0.03475157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984528,0.00041850941,0.00007870003,0.00017175706,0.000665982,0.00021230617],"domain_scores_gemma":[0.99870884,0.00055670115,0.000044347868,0.00050294405,0.00013782192,0.000049404454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680857,0.0006052064,0.00073219556,0.0008380456,0.00058115483,0.0017553312,0.0009525969,0.0007499337,0.011793782],"category_scores_gemma":[0.0015500062,0.00031558037,0.00038545698,0.0012525652,0.0010401501,0.0032793123,0.001618804,0.0012183337,0.0038707678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023302364,0.0005660118,0.0010463148,0.00040974162,0.00009193448,0.00039997275,0.00023698481,0.037316125,0.16903238,0.4610359,0.019097485,0.30843684],"study_design_scores_gemma":[0.00044347616,0.00071102806,0.0014218804,0.000066871224,0.0001703438,0.0012363942,0.00009103042,0.47825554,0.32404184,0.15973426,0.033703204,0.00012410422],"about_ca_topic_score_codex":0.00031028612,"about_ca_topic_score_gemma":0.0002361599,"teacher_disagreement_score":0.011793782,"about_ca_system_score_codex":0.000863496,"about_ca_system_score_gemma":0.00083241967,"threshold_uncertainty_score":0.039454162},"labels":[],"label_agreement":null},{"id":"W2940136889","doi":"10.1007/978-3-030-17982-3_15","title":"A New Bayesian Approach to Exploring Damaged Assets by Monitoring Mission Failures Caused by Undetected Attack","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Nexen (Canada)","funders":"","keywords":"Computer science; Bayesian probability; Bayesian network; Set (abstract data type); Software; Computer security; Artificial intelligence; Operating system; Programming language","score_opus":0.03578580039838661,"score_gpt":0.2594642703144676,"score_spread":0.223678469916081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940136889","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.0030263527,0.00019367317,0.9954052,0.000103350976,0.000025398578,0.000016677695,0.000056651057,0.0001279656,0.0010447874],"genre_scores_gemma":[0.19936787,0.00087065744,0.78796446,0.00031642927,0.00033327506,0.00023113994,0.00047668067,0.00022171305,0.010217716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989768,0.0002648344,0.000057362788,0.0002924611,0.00033357833,0.00007495745],"domain_scores_gemma":[0.9973218,0.0018652029,0.00017796007,0.00015730868,0.00037597696,0.00010182478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019194346,0.0011048928,0.0019155489,0.0017392484,0.0005826234,0.0018563245,0.0036715635,0.0023278755,0.003254845],"category_scores_gemma":[0.006006886,0.0014623217,0.001423372,0.0018703928,0.0012288165,0.0033886428,0.0024629824,0.0017473532,0.0005201056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010006949,0.00011809885,0.0010673513,0.00013461738,0.00022263423,0.000114962764,0.00010938129,0.8162452,0.00259666,0.037464887,0.0022129738,0.13961318],"study_design_scores_gemma":[0.000007200353,0.000014132081,0.00012557201,0.000006988132,0.000019252686,0.000024101459,0.000005796449,0.98180056,0.00022360179,0.017222393,0.0005398615,0.000010472176],"about_ca_topic_score_codex":0.010534622,"about_ca_topic_score_gemma":0.012281347,"teacher_disagreement_score":0.010534622,"about_ca_system_score_codex":0.0011178252,"about_ca_system_score_gemma":0.0013923389,"threshold_uncertainty_score":0.020946622},"labels":[],"label_agreement":null},{"id":"W2940223619","doi":"10.1007/978-3-030-16670-0_12","title":"Fault Detection and Classification for Induction Motors Using Genetic Programming","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Induction motor; Genetic programming; Feature selection; Artificial intelligence; Fault detection and isolation; Machine learning; Support vector machine; Fault (geology); Genetic algorithm; Decision tree; Feature (linguistics); Feature vector; Pattern recognition (psychology); Feature extraction; Engineering","score_opus":0.031873550370144145,"score_gpt":0.26661555339224285,"score_spread":0.23474200302209872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940223619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034459006,0.000495744,0.9622314,0.00011927802,0.00004038367,0.0000411024,0.00003071302,0.0008288526,0.0017534607],"genre_scores_gemma":[0.5400185,0.00041594717,0.45403102,0.00009324605,0.00003600411,0.00010846554,0.00012605895,0.00009758701,0.0050731557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998466,0.000027223661,0.000009124108,0.000037364167,0.000059885977,0.000019775985],"domain_scores_gemma":[0.99960524,0.00024119273,0.000038257927,0.000023893184,0.000083196566,0.000008274472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036180473,0.0005482072,0.00062698993,0.00063150853,0.0002289579,0.0005165031,0.00084013777,0.0010055605,0.0011390721],"category_scores_gemma":[0.0011476033,0.00025509397,0.00051436207,0.00061222276,0.0003199918,0.0004973713,0.00027609762,0.0006429777,0.00028236717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012901537,0.00008717445,0.0011083591,0.00007850495,0.000047442412,0.00006605883,0.00006457419,0.5038126,0.014094534,0.0036106487,0.001328082,0.475573],"study_design_scores_gemma":[0.000004183506,0.000022244862,0.00025009012,0.0000059846684,0.000007952569,0.000019373267,0.0000054010184,0.9954124,0.0022442853,0.0017575317,0.00026733516,0.000003273797],"about_ca_topic_score_codex":0.0031758999,"about_ca_topic_score_gemma":0.0026044645,"teacher_disagreement_score":0.0031758999,"about_ca_system_score_codex":0.00047641824,"about_ca_system_score_gemma":0.00032386166,"threshold_uncertainty_score":0.0063148737},"labels":[],"label_agreement":null},{"id":"W2940674603","doi":"10.1007/978-3-031-24340-0_3","title":"Toponym Identification in Epidemiology Articles – A Deep Learning Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data-Driven Disease Surveillance","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Identification (biology); Task (project management); Domain (mathematical analysis); Focus (optics); Natural language processing; Embedding; Information retrieval; Artificial intelligence","score_opus":0.04477128131344797,"score_gpt":0.30445012479287054,"score_spread":0.25967884347942255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940674603","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.083822176,0.010280529,0.86041427,0.0030282605,0.0010835102,0.0003519733,0.011261358,0.0068747676,0.022883175],"genre_scores_gemma":[0.42500654,0.0052955253,0.52308273,0.0006216563,0.0009090039,0.0002654126,0.01650071,0.0006320943,0.027686354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860173,0.0003145494,0.0001671925,0.00037260624,0.00036505214,0.00017888758],"domain_scores_gemma":[0.9960376,0.002151847,0.0004026207,0.0003810926,0.00083957595,0.0001872546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479735,0.0010304286,0.00096336746,0.007665265,0.0007659547,0.002569307,0.0013193658,0.001496855,0.0048129307],"category_scores_gemma":[0.005431161,0.0005140121,0.0014678773,0.0054226806,0.00038587814,0.004292086,0.001833374,0.0017995412,0.0035171928],"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.00021636202,0.0002983365,0.012973943,0.0006187527,0.00015460764,0.0003258481,0.00027192617,0.014754883,0.0101817185,0.008035195,0.04090549,0.9112628],"study_design_scores_gemma":[0.000032298663,0.00013622711,0.014744148,0.00037641719,0.0002229811,0.00082432665,0.0005997418,0.8752978,0.011636206,0.056578282,0.03946633,0.000085352716],"about_ca_topic_score_codex":0.0053794854,"about_ca_topic_score_gemma":0.011820314,"teacher_disagreement_score":0.007665265,"about_ca_system_score_codex":0.00094354065,"about_ca_system_score_gemma":0.0012319736,"threshold_uncertainty_score":0.016100824},"labels":[],"label_agreement":null},{"id":"W2941172668","doi":"10.1007/978-3-030-21741-9_27","title":"Cough Detection Using Hidden Markov Models","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Respiratory and Cough-Related Research","field":"Medicine","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 Saskatchewan","funders":"","keywords":"Univariate; Hidden Markov model; Multivariate statistics; Context (archaeology); Medicine; Multivariate analysis; Public health; Receiver operating characteristic; Artificial intelligence; Computer science; Intensive care medicine; Machine learning; Pathology; Geography","score_opus":0.05062887878392913,"score_gpt":0.32661545267661674,"score_spread":0.2759865738926876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941172668","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.0659075,0.0016518766,0.9274695,0.00043740642,0.00019097503,0.000054049917,0.0008056579,0.001847779,0.0016352307],"genre_scores_gemma":[0.8562024,0.0011008611,0.13301058,0.00018434625,0.00024804633,0.00007032081,0.0020103913,0.00017358438,0.0069996114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996125,0.00008747257,0.000023608416,0.00011224504,0.0000823475,0.00008185001],"domain_scores_gemma":[0.9983229,0.0013071301,0.000100178186,0.00009745737,0.00011700317,0.000055241453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641937,0.0007191833,0.0011838778,0.0010873807,0.00031402425,0.0010471451,0.00069711474,0.0013014061,0.0022448706],"category_scores_gemma":[0.0028801702,0.00066951604,0.0012445819,0.00064728444,0.00024052933,0.00096401793,0.00091679965,0.0011717058,0.0012521842],"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.0015916121,0.00058594113,0.022950146,0.00052295084,0.00058136106,0.0008711962,0.00018768328,0.24345258,0.060102962,0.008455427,0.008493611,0.6522045],"study_design_scores_gemma":[0.0000103751545,0.00003457689,0.0017779785,0.000016060849,0.000034078374,0.00009670251,0.000009251716,0.9904109,0.0037640883,0.003451135,0.00038283662,0.000012030983],"about_ca_topic_score_codex":0.003064658,"about_ca_topic_score_gemma":0.0031759597,"teacher_disagreement_score":0.003064658,"about_ca_system_score_codex":0.0003164393,"about_ca_system_score_gemma":0.000523896,"threshold_uncertainty_score":0.0075098276},"labels":[],"label_agreement":null},{"id":"W2941395296","doi":"10.1007/978-3-030-28796-2_11","title":"The Undirected Repetition Threshold","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg","funders":"","keywords":"Conjecture; Combinatorics; Infimum and supremum; Mathematics; Repetition (rhetorical device); Physics; Philosophy","score_opus":0.012675204938594394,"score_gpt":0.2475024252707532,"score_spread":0.2348272203321588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941395296","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.36167663,0.0030725275,0.23710886,0.008859714,0.0007101329,0.00009532777,0.0010608446,0.0013661749,0.38604975],"genre_scores_gemma":[0.94649124,0.00085676124,0.016814606,0.0010615933,0.0007122716,0.00014249209,0.0003997742,0.00034422797,0.03317699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871635,0.00035162922,0.000051573614,0.0003818093,0.00030019617,0.00019855933],"domain_scores_gemma":[0.99256164,0.0048099896,0.000444822,0.0011358126,0.00053305237,0.00051474874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088552217,0.00046334852,0.0010075235,0.0015036187,0.0015302219,0.002959623,0.0013245209,0.0020016285,0.012852091],"category_scores_gemma":[0.010060325,0.00049701636,0.0005896532,0.0010459826,0.002856174,0.00550449,0.0023177643,0.0030672958,0.001991718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038658447,0.000010751886,0.00015881631,0.00004470133,0.000008171977,0.00006018756,0.00012007077,0.0012409217,0.001344677,0.9894818,0.0024828343,0.0050085178],"study_design_scores_gemma":[0.000007302062,0.000006294795,0.00013888771,0.0000096527965,0.0000074991094,0.00008889635,0.00002577597,0.0073630996,0.0005358826,0.989618,0.0021904216,0.0000082177],"about_ca_topic_score_codex":0.0007987299,"about_ca_topic_score_gemma":0.0005172357,"teacher_disagreement_score":0.012852091,"about_ca_system_score_codex":0.0009860994,"about_ca_system_score_gemma":0.0007593702,"threshold_uncertainty_score":0.04299456},"labels":[],"label_agreement":null},{"id":"W2941484091","doi":"10.1007/978-3-030-19274-7_20","title":"Domain Classifier: Compromised Machines Versus Malicious Registrations","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"IBM (Canada); University of Ottawa","funders":"","keywords":"Phishing; Computer science; Classifier (UML); The Internet; Exploit; Computer security; Trustworthiness; Domain (mathematical analysis); Artificial intelligence; Domain name; World Wide Web; Internet privacy; Machine learning","score_opus":0.02370478381275667,"score_gpt":0.25090829705235757,"score_spread":0.2272035132396009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941484091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20167501,0.012866126,0.6366487,0.0071504936,0.0030905367,0.00032205327,0.0012747126,0.004926428,0.1320459],"genre_scores_gemma":[0.83975035,0.0035838773,0.10500299,0.00097096956,0.001986809,0.00008141273,0.0014444588,0.0006084291,0.04657074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983595,0.00037446883,0.000075406555,0.000426788,0.0006147039,0.00014901791],"domain_scores_gemma":[0.9952669,0.0022519913,0.00035265216,0.000799239,0.0011199875,0.00020928572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022068606,0.0007470994,0.0010560463,0.0020378781,0.00092297257,0.0036483936,0.0010069093,0.0018895377,0.006061824],"category_scores_gemma":[0.007598908,0.00023743033,0.00046445138,0.0011971068,0.0010822925,0.0047055758,0.00095812563,0.001793815,0.005134735],"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.0008330579,0.00039043414,0.01570253,0.00046778252,0.000090769434,0.00044773612,0.0003930347,0.012136857,0.02588124,0.07788331,0.05723032,0.808543],"study_design_scores_gemma":[0.000051730734,0.00068416866,0.013599809,0.00033593283,0.00028329875,0.004565864,0.0007305664,0.7155945,0.053272553,0.1411003,0.069669515,0.000111757465],"about_ca_topic_score_codex":0.00042200193,"about_ca_topic_score_gemma":0.0006410668,"teacher_disagreement_score":0.006061824,"about_ca_system_score_codex":0.0006926731,"about_ca_system_score_gemma":0.00059277884,"threshold_uncertainty_score":0.020278811},"labels":[],"label_agreement":null},{"id":"W2941911965","doi":"10.1007/978-3-030-19432-1_8","title":"A Logical Framework for Modelling Breast Cancer Progression","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Computer science; Mathematical proof; Breast cancer; Cancer; Automated theorem proving; Machine learning; Theoretical computer science; Artificial intelligence; Medicine; Internal medicine","score_opus":0.029641480201894825,"score_gpt":0.3124779018860169,"score_spread":0.28283642168412204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941911965","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.0040432783,0.00056691346,0.98673147,0.00086088735,0.00009181275,0.00012053949,0.0019694187,0.0014906205,0.00412506],"genre_scores_gemma":[0.105850466,0.0010557756,0.8839016,0.0002870545,0.000093505616,0.00038711895,0.003124671,0.00029966928,0.0050002337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999156,0.00024872413,0.00012108409,0.00018653733,0.00021101556,0.000076502285],"domain_scores_gemma":[0.9986468,0.00082192034,0.000109319175,0.00014135476,0.00021374528,0.00006691373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018435542,0.0008589019,0.0006253282,0.0013756688,0.00084016775,0.0035799607,0.0024599254,0.0012062386,0.0060934513],"category_scores_gemma":[0.0038584743,0.0006827807,0.0025416997,0.0013982967,0.0013894672,0.0036097325,0.0020119643,0.0014865941,0.0012369179],"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.0001568261,0.00009092045,0.0018243209,0.0004714512,0.00014757847,0.00068076735,0.0006202162,0.3207107,0.0022744597,0.5773109,0.008935398,0.08677641],"study_design_scores_gemma":[0.000041761356,0.00003929658,0.00023030999,0.000092142756,0.00016147146,0.00017620511,0.00012670053,0.61306196,0.0017900085,0.3358053,0.048441883,0.000032906155],"about_ca_topic_score_codex":0.019562628,"about_ca_topic_score_gemma":0.023463696,"teacher_disagreement_score":0.019562628,"about_ca_system_score_codex":0.0017517237,"about_ca_system_score_gemma":0.0023678513,"threshold_uncertainty_score":0.038897514},"labels":[],"label_agreement":null},{"id":"W2941917664","doi":"10.1007/978-3-030-23250-4_8","title":"Towards Specifying Symbolic Computation","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"McMaster University","funders":"","keywords":"Computer science; Symbolic computation; Syntax; Theoretical computer science; Semantics (computer science); Computation; Programming language; Formal grammar; Mathematical logic; Artificial intelligence; Mathematics; Rule-based machine translation","score_opus":0.03414439683949414,"score_gpt":0.28655107218043785,"score_spread":0.2524066753409437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941917664","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.004170175,0.00030311095,0.9832497,0.0007132513,0.000110903886,0.00004599353,0.00023276945,0.0017391291,0.009434879],"genre_scores_gemma":[0.19939591,0.0013812722,0.78368974,0.00077290315,0.0002593396,0.0003201649,0.0015972797,0.0018235871,0.010759857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949092,0.0022352582,0.00050943904,0.0006684585,0.0013244962,0.0003531257],"domain_scores_gemma":[0.9921862,0.0037506968,0.00023698724,0.0025514357,0.0010480307,0.00022655509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004260439,0.0011883978,0.0013654766,0.0020545402,0.001948318,0.008543987,0.002595571,0.0020705636,0.008839338],"category_scores_gemma":[0.013551431,0.0015058116,0.0023290662,0.0031041647,0.0058493866,0.01094176,0.006192647,0.006499621,0.003298891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027564314,0.000014752242,0.00021837559,0.00010099727,0.000010887501,0.000060048078,0.0005729571,0.002550328,0.0013813811,0.97163725,0.0016149859,0.021810587],"study_design_scores_gemma":[0.000013955997,0.000010643695,0.0000641728,0.00007088475,0.000021390391,0.000054629363,0.00017876954,0.021561986,0.0031912362,0.94321895,0.03159349,0.000019884506],"about_ca_topic_score_codex":0.0028838178,"about_ca_topic_score_gemma":0.0038783262,"teacher_disagreement_score":0.008839338,"about_ca_system_score_codex":0.0024033377,"about_ca_system_score_gemma":0.0025013052,"threshold_uncertainty_score":0.02957052},"labels":[],"label_agreement":null},{"id":"W2942306020","doi":"10.1007/978-3-030-28796-2_7","title":"Repetitions in Infinite Palindrome-Rich Words","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Word (group theory); Combinatorics on words; Repetition (rhetorical device); Exponent; Construct (python library)","score_opus":0.013142131746093222,"score_gpt":0.23493822697104802,"score_spread":0.2217960952249548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942306020","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.6942542,0.002054144,0.14878581,0.00062469137,0.00036211452,0.000057970046,0.00036947004,0.00094323425,0.15254834],"genre_scores_gemma":[0.948074,0.0004144999,0.016398001,0.00012776308,0.00021941026,0.00007245063,0.000238328,0.00024558444,0.03421006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992524,0.00021260834,0.000067919114,0.0001667328,0.00018551885,0.000114861185],"domain_scores_gemma":[0.99780065,0.0015734934,0.00017204083,0.00023271306,0.00012983213,0.00009120591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004559155,0.0005012254,0.0006180401,0.00092861487,0.001202965,0.0020489418,0.00085088913,0.0008540208,0.0054272525],"category_scores_gemma":[0.0023844005,0.00065854046,0.0006747832,0.0007913434,0.0017630643,0.0033013585,0.0013679978,0.0013149062,0.0012551522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018817796,0.000030010462,0.00026841456,0.00013404284,0.000015699443,0.00076360744,0.001327951,0.0018593011,0.014907114,0.96647227,0.0010235504,0.013009956],"study_design_scores_gemma":[0.000025612984,0.00006514235,0.0003398534,0.000034460518,0.00002295793,0.00077768735,0.0002180765,0.004867623,0.0065768864,0.9808131,0.006230504,0.00002818756],"about_ca_topic_score_codex":0.00022454222,"about_ca_topic_score_gemma":0.0003281075,"teacher_disagreement_score":0.0054272525,"about_ca_system_score_codex":0.0005135498,"about_ca_system_score_gemma":0.00023460241,"threshold_uncertainty_score":0.018155932},"labels":[],"label_agreement":null},{"id":"W2942504727","doi":"10.1007/978-3-030-18419-3_15","title":"Fault Analysis of the New Ukrainian Hash Function Standard: Kupyna","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Byte; Fault (geology); Cryptographic hash function; SHA-2; Fault model; Function (biology); Theoretical computer science; Computer security; Programming language; Engineering","score_opus":0.014914975441493018,"score_gpt":0.26119977023853697,"score_spread":0.24628479479704396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942504727","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.8856362,0.001642431,0.09821617,0.00066901,0.0001718916,0.0000800959,0.0006211497,0.0015486912,0.011414368],"genre_scores_gemma":[0.9895446,0.00012317392,0.0077977157,0.00004226217,0.00001902153,0.000017250546,0.00028392873,0.000068592264,0.0021034938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99845314,0.00027291488,0.00012101264,0.00022227001,0.00068606343,0.00024451897],"domain_scores_gemma":[0.9973605,0.0008786067,0.00029892474,0.00079802255,0.00061685225,0.000047080797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093187875,0.00026871,0.00047222045,0.0011284503,0.0005546636,0.0011573479,0.0009167613,0.00056234346,0.0017608226],"category_scores_gemma":[0.0041276813,0.00016197491,0.0003379419,0.0008901576,0.0008699247,0.0020928225,0.0009846053,0.00065650675,0.00044280736],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048227534,0.00029869573,0.042598765,0.0008980519,0.00032250604,0.0012996801,0.0013938501,0.15347216,0.08856146,0.37658498,0.016036699,0.31371045],"study_design_scores_gemma":[0.00013146039,0.0008763156,0.014948051,0.00016828862,0.0002736791,0.0014497588,0.00059221603,0.66437024,0.17482677,0.120519444,0.021726968,0.00011683701],"about_ca_topic_score_codex":0.0022255713,"about_ca_topic_score_gemma":0.002051459,"teacher_disagreement_score":0.0022255713,"about_ca_system_score_codex":0.0018731065,"about_ca_system_score_gemma":0.0016172865,"threshold_uncertainty_score":0.013590395},"labels":[],"label_agreement":null},{"id":"W2942684371","doi":"10.1007/978-3-030-18419-3_1","title":"Securing Internet-of-Things","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RFID technology advancements","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 Waterloo","funders":"","keywords":"Internet privacy; The Internet; Computer security; Business; Computer science; World Wide Web","score_opus":0.007591245596432649,"score_gpt":0.21187815368365276,"score_spread":0.2042869080872201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942684371","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027982108,0.040988084,0.41774747,0.008261823,0.009074447,0.0002872121,0.0003609414,0.0029225803,0.4923753],"genre_scores_gemma":[0.28952903,0.048196796,0.12801756,0.0037552647,0.00270942,0.00020481121,0.0011353296,0.0007092854,0.52574253],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994203,0.00007181411,0.00002861874,0.000063930434,0.0003573539,0.000058150235],"domain_scores_gemma":[0.99945027,0.00016960084,0.000053900043,0.00019893581,0.00009614423,0.000031220843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005316252,0.00064165605,0.00029460472,0.0008250531,0.00057113386,0.0024032006,0.0008114738,0.0016453837,0.008732575],"category_scores_gemma":[0.001364566,0.00039238558,0.00028632293,0.00071182806,0.0007286616,0.0047069537,0.0017019964,0.0013532006,0.0068413415],"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.000061557075,0.000079016965,0.00078671344,0.0004797187,0.000034546007,0.00087081245,0.00049727823,0.0023771138,0.025328001,0.18079388,0.057909302,0.73078203],"study_design_scores_gemma":[0.0000124657245,0.00021684916,0.0011480371,0.0007255047,0.00004903786,0.0041002436,0.00042760553,0.0146334,0.03425542,0.10741535,0.8369704,0.000045745594],"about_ca_topic_score_codex":0.0002411838,"about_ca_topic_score_gemma":0.0003808335,"teacher_disagreement_score":0.008732575,"about_ca_system_score_codex":0.00041887574,"about_ca_system_score_gemma":0.00043449356,"threshold_uncertainty_score":0.029213428},"labels":[],"label_agreement":null},{"id":"W2943180171","doi":"10.1007/978-3-030-17935-9_51","title":"Model of the Mouth Pressure Signal During Pauses in Total Liquid Ventilation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Refrigeration and Air Conditioning Technologies","field":"Engineering","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":"Université de Sherbrooke","funders":"","keywords":"Ventilation (architecture); Pressure sensor; SIGNAL (programming language); Oscillation (cell signaling); Acoustics; Mechanics; Materials science; Computer science; Physics; Chemistry; Thermodynamics","score_opus":0.01273934659600069,"score_gpt":0.2030086422762881,"score_spread":0.19026929568028741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943180171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3457389,0.001489557,0.61457807,0.0009642687,0.00037600924,0.00018872147,0.0015376396,0.0026106837,0.03251611],"genre_scores_gemma":[0.9895537,0.00017225793,0.0030284335,0.000044719156,0.000025014582,0.000057210695,0.00018149386,0.00006858844,0.0068686237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999037,0.000018700612,0.000004178038,0.0000337981,0.000022493268,0.000017066995],"domain_scores_gemma":[0.9997471,0.00017057366,0.000019877894,0.000010149808,0.000036638667,0.000015642358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019984628,0.000461853,0.00053283153,0.00025603376,0.00026974676,0.00061506697,0.0010696964,0.0015662303,0.003526864],"category_scores_gemma":[0.00088307704,0.00028175698,0.0006227529,0.00019114313,0.00039641303,0.00050847675,0.00034470446,0.000581236,0.0005633509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017378385,0.00003944506,0.0010633942,0.000116574745,0.000032795546,0.0002390636,0.00013287377,0.97730696,0.008910988,0.003450011,0.00087321905,0.0076609016],"study_design_scores_gemma":[0.0000052775076,0.000013922468,0.00024969014,0.000003696179,0.000004938403,0.000016220252,0.0000044746507,0.999067,0.00030902884,0.00022663109,0.00009545626,0.0000036740978],"about_ca_topic_score_codex":0.012462147,"about_ca_topic_score_gemma":0.005966386,"teacher_disagreement_score":0.012462147,"about_ca_system_score_codex":0.0005265067,"about_ca_system_score_gemma":0.00060263,"threshold_uncertainty_score":0.0247792},"labels":[],"label_agreement":null},{"id":"W2943447671","doi":"10.1007/978-3-030-18419-3_2","title":"Privacy and Ethical Challenges in Big Data","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Transparency (behavior); Computer science; Big data; Profiling (computer programming); Personally identifiable information; Data science; Internet privacy; Information privacy; Ethical issues; Population; Computer security; Data mining; Engineering ethics; Engineering","score_opus":0.12573459482006857,"score_gpt":0.3067844270658165,"score_spread":0.18104983224574792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943447671","genre_codex":"commentary","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.01137401,0.057616834,0.17786156,0.41566202,0.0051467293,0.00011798341,0.00029991174,0.00012180582,0.33179915],"genre_scores_gemma":[0.6983111,0.045308456,0.079456225,0.065437086,0.015026634,0.00055475906,0.00028472574,0.00032254346,0.09529843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878,0.007911984,0.00034062698,0.00061834895,0.0027405957,0.0005883671],"domain_scores_gemma":[0.9654939,0.02907178,0.0007750454,0.002865324,0.0012132229,0.0005806679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01813719,0.0004896275,0.00078450603,0.0011264912,0.0038788274,0.010327944,0.0014341474,0.007836419,0.003693581],"category_scores_gemma":[0.02799335,0.00065994065,0.0007244218,0.0021259594,0.024428567,0.01806775,0.0037845604,0.015855893,0.00076407206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040893265,0.0000061824057,0.000043156466,0.000030255595,0.0000026293822,0.000026849028,0.0004174346,0.00021586489,0.000026619438,0.98777395,0.006910618,0.0045422926],"study_design_scores_gemma":[0.0000019305814,0.0000019771935,0.00002775853,0.000058996888,0.0000012614756,0.0000374083,0.00018841376,0.00040313404,0.000050457566,0.976998,0.022226874,0.000003801898],"about_ca_topic_score_codex":0.0010564956,"about_ca_topic_score_gemma":0.0012062415,"teacher_disagreement_score":0.01813719,"about_ca_system_score_codex":0.0031163443,"about_ca_system_score_gemma":0.0036996608,"threshold_uncertainty_score":0.09591973},"labels":[],"label_agreement":null},{"id":"W2943456054","doi":"10.1007/978-3-030-18419-3_8","title":"Configuring Data Flows in the Internet of Things for Security and Privacy Requirements","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Secrecy; Data flow diagram; Transitive relation; Theoretical computer science; The Internet; Internet of Things; Flow (mathematics); Computer security; Distributed computing; Database; World Wide Web","score_opus":0.040748535938061776,"score_gpt":0.28392849178172974,"score_spread":0.24317995584366797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943456054","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.10062526,0.0014399933,0.864811,0.0009559916,0.0006328745,0.00037455384,0.00019774941,0.0019039762,0.029058712],"genre_scores_gemma":[0.7466319,0.0015012511,0.23805086,0.0003345361,0.00023955049,0.0001533714,0.00035050593,0.00032947148,0.012408602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922156,0.00017188652,0.00006728843,0.00014648573,0.00026040393,0.00013237317],"domain_scores_gemma":[0.9984066,0.00063032453,0.000108339606,0.0005802025,0.00018814836,0.00008637999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014627909,0.0005860039,0.00044554807,0.000644346,0.0011938893,0.0024604602,0.0011228605,0.0010361173,0.0020059347],"category_scores_gemma":[0.0027988062,0.00043056245,0.0005021886,0.0006594047,0.00080632756,0.0032388591,0.0009871296,0.0013039774,0.00058556336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008377234,0.0003051326,0.00478669,0.00045192154,0.000086922686,0.0009642238,0.0013702168,0.093049005,0.08879127,0.30183652,0.014825163,0.49269515],"study_design_scores_gemma":[0.00006889896,0.00033789646,0.00220036,0.00028023956,0.00012303237,0.0017088882,0.0006850797,0.5412514,0.081136905,0.29261228,0.0794887,0.00010636288],"about_ca_topic_score_codex":0.0006830706,"about_ca_topic_score_gemma":0.0009033676,"teacher_disagreement_score":0.0024604602,"about_ca_system_score_codex":0.0005517306,"about_ca_system_score_gemma":0.00063420524,"threshold_uncertainty_score":0.0077360272},"labels":[],"label_agreement":null},{"id":"W2943468268","doi":"10.1007/978-3-030-18305-9_9","title":"TextKD-GAN: Text Generation Using Knowledge Distillation and Generative Adversarial Networks","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Automatic summarization; Generator (circuit theory); Generative grammar; Artificial intelligence; Representation (politics); Natural language processing; Machine translation; Text generation; Translation (biology); Word (group theory); Adversarial system; Measure (data warehouse); BLEU; Language model; Exploit; Machine learning; Data mining; Mathematics","score_opus":0.02682350185918448,"score_gpt":0.2701453311191642,"score_spread":0.24332182925997975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943468268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004063278,0.00043412868,0.9781526,0.00036519734,0.00027546528,0.00016837892,0.0012190933,0.012162749,0.0031592406],"genre_scores_gemma":[0.2099886,0.0005430785,0.75446904,0.0009465083,0.00029458207,0.0006581172,0.008341085,0.0031049717,0.021653933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923265,0.00021103397,0.000034395034,0.0002695829,0.0001890277,0.0000633024],"domain_scores_gemma":[0.99868745,0.00075811066,0.00004356339,0.00029947318,0.00016254722,0.000048893206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010704456,0.0013506718,0.0010603328,0.0008160255,0.00040114266,0.0012417353,0.0024091122,0.0022119673,0.013638683],"category_scores_gemma":[0.004393598,0.00076239347,0.001143246,0.0008265722,0.0006923883,0.0021726575,0.002334937,0.0028802443,0.006500173],"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.0005531223,0.00026383775,0.00041191248,0.00041697867,0.00016490088,0.0002990198,0.00010832053,0.35049042,0.014251306,0.032333918,0.06443259,0.53627366],"study_design_scores_gemma":[0.000030952426,0.000021633101,0.000047593076,0.000012992115,0.000009731814,0.000045567467,0.0000063933785,0.97795117,0.004458737,0.014061733,0.0033440962,0.000009396324],"about_ca_topic_score_codex":0.0022645483,"about_ca_topic_score_gemma":0.0038955682,"teacher_disagreement_score":0.013638683,"about_ca_system_score_codex":0.0007177828,"about_ca_system_score_gemma":0.00077409495,"threshold_uncertainty_score":0.045625925},"labels":[],"label_agreement":null},{"id":"W2943595118","doi":"","title":"Sub-optimal topological protection strategy from advanced malware","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nurses Association","funders":"","keywords":"Malware; Betweenness centrality; Computer science; Domino effect; Closeness; Set (abstract data type); Computer security; Software; Complex network; Order (exchange); Theoretical computer science; Distributed computing; Mathematics; Centrality; Business; Law","score_opus":0.013192174281005607,"score_gpt":0.25593284504542146,"score_spread":0.24274067076441586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943595118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30012348,0.00024611992,0.6857715,0.0006684219,0.0000723966,0.00017107184,0.00007613926,0.00090920203,0.011961736],"genre_scores_gemma":[0.91661143,0.00008374311,0.08022692,0.00011873691,0.000021740885,0.00012023639,0.00007566346,0.00007263678,0.0026688727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997496,0.00007434468,0.000011357728,0.000043466676,0.000053210242,0.00006815209],"domain_scores_gemma":[0.9984137,0.0008500746,0.00018984269,0.0002014859,0.00017371555,0.00017110603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465243,0.0007014237,0.00096093223,0.0011116713,0.00065453595,0.00086733536,0.0010158835,0.0011309551,0.0027482635],"category_scores_gemma":[0.0035869975,0.0003309718,0.00046223906,0.00028415307,0.0008237612,0.0010706175,0.0013759158,0.0005676556,0.0004649918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030280932,0.00013940546,0.0014690774,0.00012781282,0.0000486201,0.0002261186,0.00022348166,0.86641496,0.017015727,0.026436107,0.0022841776,0.08531164],"study_design_scores_gemma":[0.00002157545,0.00006394418,0.00018277182,0.000008257148,0.000013621721,0.000048050584,0.000036127047,0.98663306,0.0016646795,0.010890738,0.00043124243,0.000005991663],"about_ca_topic_score_codex":0.001068575,"about_ca_topic_score_gemma":0.0010736637,"teacher_disagreement_score":0.0027482635,"about_ca_system_score_codex":0.00076891,"about_ca_system_score_gemma":0.001187333,"threshold_uncertainty_score":0.009193838},"labels":[],"label_agreement":null},{"id":"W2943694314","doi":"10.1007/978-3-030-18419-3_4","title":"Mobile Travel Credentials","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and 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 Ottawa","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.022211530160034677,"score_gpt":0.2602474960792216,"score_spread":0.2380359659191869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943694314","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.0069813365,0.00079951435,0.009215092,0.001189372,0.000670061,0.00012626339,0.0020214359,0.0016643426,0.9773326],"genre_scores_gemma":[0.07780165,0.0009860637,0.0025320651,0.00030381783,0.00023238403,0.000061893326,0.0016993029,0.00016208639,0.9162207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976045,0.00004174128,0.000012800995,0.000028773879,0.00008820968,0.000068061505],"domain_scores_gemma":[0.9995123,0.00008667215,0.0000321481,0.00015263808,0.000115780575,0.00010043451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028695338,0.00038254494,0.00026751572,0.0011370195,0.0009035759,0.0021542902,0.00051795406,0.00087395747,0.22863542],"category_scores_gemma":[0.0014884943,0.00020482598,0.00015704615,0.0011118879,0.0003121557,0.002855805,0.0014387388,0.0009916509,0.13431369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018410478,0.0001547269,0.0008812808,0.0001926087,0.000004855328,0.0003697228,0.00042042753,0.00053245464,0.0026966974,0.12545598,0.41043916,0.45866796],"study_design_scores_gemma":[0.000008171229,0.000030648906,0.0006401459,0.00008609242,0.000003687321,0.0004255672,0.00018294343,0.0007117876,0.0012543631,0.0076501104,0.9889958,0.000010596253],"about_ca_topic_score_codex":0.0008695166,"about_ca_topic_score_gemma":0.0012683946,"teacher_disagreement_score":0.22863542,"about_ca_system_score_codex":0.0003961014,"about_ca_system_score_gemma":0.00052555406,"threshold_uncertainty_score":0.76486164},"labels":[],"label_agreement":null},{"id":"W2943729245","doi":"10.1007/978-3-319-31204-0_1","title":"Enhanced Multiobjective Population-Based Incremental Learning with Applications in Risk Treaty Optimization","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Speedup; Computer science; Pareto principle; Context (archaeology); Population; Mathematical optimization; Multi-objective optimization; Dual (grammatical number); Parallel computing; Machine learning; Mathematics","score_opus":0.0071618120789763325,"score_gpt":0.2418116852113466,"score_spread":0.23464987313237026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943729245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012976516,0.000666927,0.9812655,0.00013810175,0.00012547224,0.00005166025,0.000036321606,0.0002625451,0.0044769533],"genre_scores_gemma":[0.43216425,0.00064441684,0.5594847,0.00025134502,0.00017356283,0.00034758012,0.00018377855,0.0001580425,0.0065924153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.000120974284,0.00001892136,0.000052939493,0.000104049825,0.00002800909],"domain_scores_gemma":[0.99854624,0.00091147114,0.00007114541,0.000082890125,0.00034666777,0.00004163766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278832,0.0007742727,0.0012700653,0.0006879928,0.0003319403,0.00093983056,0.0019268556,0.0014384984,0.003770286],"category_scores_gemma":[0.0040937173,0.00043040668,0.00074113783,0.00084047683,0.0004380015,0.0011128018,0.001454497,0.0016111134,0.0004940531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043874017,0.0001163772,0.00042662528,0.0001117153,0.00005338772,0.000064332824,0.000054929358,0.85217404,0.0013365108,0.009638771,0.0022156904,0.13376372],"study_design_scores_gemma":[0.0000024900255,0.000013667793,0.000035931218,0.000003853807,0.0000045259308,0.0000072360185,0.0000018311388,0.99828845,0.00013691714,0.0012787184,0.00022432437,0.000001984767],"about_ca_topic_score_codex":0.001903531,"about_ca_topic_score_gemma":0.0019255255,"teacher_disagreement_score":0.003770286,"about_ca_system_score_codex":0.00044055106,"about_ca_system_score_gemma":0.0005387058,"threshold_uncertainty_score":0.012612879},"labels":[],"label_agreement":null},{"id":"W2943842518","doi":"10.1007/978-3-030-24766-9_29","title":"Efficient Second-Order Shape-Constrained Function Fitting","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Mathematics; Monotonic function; Lipschitz continuity; Combinatorics; Function (biology); Norm (philosophy); Concave function; Linear programming; Simple (philosophy); Generalization; Regular polygon; Range (aeronautics); Convex function; Algorithm; Discrete mathematics; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.014993862704939924,"score_gpt":0.26059939465395926,"score_spread":0.24560553194901932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943842518","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.006852073,0.00014188782,0.98868144,0.0000869395,0.000037410722,0.000022727807,0.00010538176,0.0014280279,0.0026440623],"genre_scores_gemma":[0.19711345,0.00032679082,0.78251624,0.00019411226,0.0000691862,0.00013290941,0.0010574814,0.0020367145,0.016553095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991097,0.00012724785,0.000031850606,0.00010709868,0.00051616295,0.00010792363],"domain_scores_gemma":[0.9988207,0.00040403364,0.000070114,0.0003767685,0.00024412751,0.00008423065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081939076,0.0013890966,0.0016963345,0.00117201,0.00072095514,0.0022979216,0.0021715485,0.0022844337,0.009031411],"category_scores_gemma":[0.0036283024,0.00096481555,0.0015307049,0.00193615,0.00059300545,0.0015500608,0.0024102104,0.0021124794,0.006353448],"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.00051993784,0.00020870722,0.0013422732,0.0002937887,0.00013727891,0.00029412625,0.00022971352,0.3291623,0.06609355,0.044379912,0.0129693365,0.5443691],"study_design_scores_gemma":[0.000009955266,0.000018161376,0.00020992565,0.000007535872,0.000007976497,0.00009822292,0.000019044686,0.98133427,0.008229506,0.006531804,0.0035169027,0.000016647227],"about_ca_topic_score_codex":0.0035839193,"about_ca_topic_score_gemma":0.00567855,"teacher_disagreement_score":0.009031411,"about_ca_system_score_codex":0.00086038647,"about_ca_system_score_gemma":0.0018443194,"threshold_uncertainty_score":0.030213118},"labels":[],"label_agreement":null},{"id":"W2944028372","doi":"10.1007/978-3-662-43948-7_26","title":"The Bose-Hubbard Model is QMA-complete","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boson; Subspace topology; Hamiltonian (control theory); Computation; Particle system; Graph; Perturbation (astronomy)","score_opus":0.017225380801346044,"score_gpt":0.23492014758792562,"score_spread":0.21769476678657956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944028372","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.10311576,0.007202005,0.299763,0.017517816,0.0016386529,0.00016652637,0.0026360601,0.0010843149,0.5668759],"genre_scores_gemma":[0.82880163,0.0045674485,0.05677921,0.0031081864,0.0016744493,0.00032269006,0.0020299724,0.0005517405,0.102164604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943084,0.00014080165,0.000020465166,0.000076812656,0.00024592897,0.00008510173],"domain_scores_gemma":[0.99917954,0.00035041478,0.000049041497,0.00021000269,0.0001442261,0.00006669911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011806603,0.00071437686,0.0016850333,0.000741953,0.0019880438,0.0026776688,0.0014245632,0.0018088958,0.009817805],"category_scores_gemma":[0.0021969907,0.0005880332,0.001176399,0.00093402545,0.003285685,0.0044949837,0.0013450781,0.0039375946,0.002813283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011984082,0.000011574954,0.000023094328,0.000060601706,0.0000091336315,0.000017172399,0.00005448963,0.0016249527,0.00044164725,0.98993534,0.00482047,0.0029894921],"study_design_scores_gemma":[0.0000056851372,0.0000028394513,0.000035151188,0.000006665261,0.0000018125877,0.000014527755,0.000008635061,0.0031443804,0.00010421063,0.99427783,0.0023944206,0.0000037700588],"about_ca_topic_score_codex":0.0020391198,"about_ca_topic_score_gemma":0.0019671745,"teacher_disagreement_score":0.009817805,"about_ca_system_score_codex":0.0010446028,"about_ca_system_score_gemma":0.002117604,"threshold_uncertainty_score":0.03284383},"labels":[],"label_agreement":null},{"id":"W29441421","doi":"10.1007/978-3-642-30779-9_1","title":"Challenges of User-Centred Research in the Development of Ambient Assisted Living Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Assisted living; Human–computer interaction; World Wide Web; Gerontology","score_opus":0.18230999200559436,"score_gpt":0.32819950018984895,"score_spread":0.14588950818425458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29441421","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.027506575,0.10848134,0.71611255,0.07363158,0.0022244707,0.00041072414,0.00021284874,0.0012437846,0.07017625],"genre_scores_gemma":[0.37866437,0.06955382,0.5208188,0.006459775,0.002286552,0.0012490903,0.00045335147,0.00055967446,0.019954497],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9820827,0.011404635,0.0007954296,0.0013293907,0.0036330302,0.00075485784],"domain_scores_gemma":[0.9399883,0.043120805,0.00084430276,0.0039931135,0.009715502,0.0023379042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042555057,0.0008886106,0.0017978469,0.0010733411,0.0016800618,0.012363046,0.005305799,0.004760743,0.004779035],"category_scores_gemma":[0.031907752,0.0008491878,0.00091045105,0.0016904547,0.006250665,0.01885316,0.006625626,0.005581222,0.0022864812],"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.00015075634,0.00049188803,0.0015777515,0.0021927098,0.00009586157,0.00020149835,0.0075562648,0.0059484635,0.0048781727,0.4581576,0.017748287,0.50100076],"study_design_scores_gemma":[0.00007472931,0.0006510757,0.0017203352,0.0016694427,0.000098224475,0.00087392627,0.010612643,0.037787877,0.008664548,0.5225532,0.41509497,0.0001990431],"about_ca_topic_score_codex":0.0023101082,"about_ca_topic_score_gemma":0.0019716742,"teacher_disagreement_score":0.042555057,"about_ca_system_score_codex":0.002022088,"about_ca_system_score_gemma":0.0049021784,"threshold_uncertainty_score":0.22505528},"labels":[],"label_agreement":null},{"id":"W2944205021","doi":"10.1007/978-3-030-19945-6_26","title":"Detecting Suspicious Transactions in IoT Blockchains for Smart Living Spaces","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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 Saskatchewan","funders":"","keywords":"Computer science; Access control; Computer security; Smart contract; Security token; Immutability; Metadata; Internet of Things; Blockchain; World Wide Web","score_opus":0.012541698992649255,"score_gpt":0.23678713176850882,"score_spread":0.22424543277585957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944205021","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.7646989,0.00088587153,0.22395241,0.00052471587,0.00014436232,0.00030511923,0.0010621282,0.0016723046,0.0067541413],"genre_scores_gemma":[0.9821555,0.00014128732,0.015419294,0.000032110325,0.000019672425,0.00003539885,0.00049674127,0.000025778967,0.0016741276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984511,0.0002971038,0.000097373624,0.00027533877,0.00070902973,0.00017003929],"domain_scores_gemma":[0.9916857,0.004616893,0.0010669874,0.0009794461,0.0012047692,0.0004461387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011805614,0.00040948996,0.000609226,0.0009567213,0.00070497516,0.0013820122,0.0007494657,0.0009896485,0.0018414397],"category_scores_gemma":[0.0066859243,0.00028451823,0.00025995856,0.0010059184,0.00055140123,0.0018447083,0.001132269,0.00080048124,0.0006326374],"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.0039441646,0.0008554533,0.1954256,0.00090173667,0.00034744496,0.003861516,0.0016121767,0.21884623,0.101912536,0.04483945,0.013230833,0.41422296],"study_design_scores_gemma":[0.000032255608,0.00019216388,0.0056296643,0.00003993385,0.000026511341,0.0005337513,0.0003673953,0.95761186,0.015583952,0.017638985,0.0023251919,0.000018439858],"about_ca_topic_score_codex":0.001797526,"about_ca_topic_score_gemma":0.003141335,"teacher_disagreement_score":0.0018414397,"about_ca_system_score_codex":0.00058527297,"about_ca_system_score_gemma":0.00094245706,"threshold_uncertainty_score":0.0062434673},"labels":[],"label_agreement":null},{"id":"W2944758595","doi":"10.1007/978-3-030-20074-9_5","title":"Generating a Real-Time Constraint Engine for Network Protocols","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Computer science; Constraint (computer-aided design); Digital subscriber line; Representation (politics); Time constraint; Model transformation; Transformation (genetics); Distributed computing; Real-time computing; Computer network; Artificial intelligence","score_opus":0.016990217192575992,"score_gpt":0.25314889110411815,"score_spread":0.23615867391154216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944758595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021037854,0.000102925056,0.9559888,0.00033444984,0.00011232782,0.000513856,0.0013008,0.015851468,0.0047575003],"genre_scores_gemma":[0.1868588,0.00016015752,0.80152166,0.00019832248,0.000049297963,0.00034726327,0.0032087595,0.0028552692,0.0048005558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978315,0.00038076087,0.00015546512,0.00044615904,0.00093971955,0.00024635403],"domain_scores_gemma":[0.99473995,0.0032095115,0.00025783505,0.00081789994,0.00085977156,0.00011518832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019601367,0.001359496,0.0008444143,0.0015543965,0.00074386445,0.0022809652,0.0035563903,0.0013872433,0.010411811],"category_scores_gemma":[0.010508172,0.0011791094,0.0023381806,0.0013432506,0.0012307445,0.0032651874,0.0026525536,0.0020241432,0.0021159924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006318234,0.0005594336,0.002753143,0.0010426667,0.00021831912,0.0010772209,0.00048250757,0.45455298,0.038023315,0.11888736,0.025548408,0.3562228],"study_design_scores_gemma":[0.00007274055,0.000039311715,0.00013876642,0.00002719189,0.00004148523,0.00007094224,0.000050984116,0.95622236,0.014420373,0.023116488,0.0057764007,0.000022941103],"about_ca_topic_score_codex":0.008515585,"about_ca_topic_score_gemma":0.014451526,"teacher_disagreement_score":0.010411811,"about_ca_system_score_codex":0.0016370759,"about_ca_system_score_gemma":0.002885833,"threshold_uncertainty_score":0.034830928},"labels":[],"label_agreement":null},{"id":"W2944839767","doi":"10.1007/978-3-030-18305-9_36","title":"Mitigating Overfitting Using Regularization to Defend Networks Against Adversarial Examples","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Overfitting; Adversarial system; Computer science; Regularization (linguistics); Deep neural networks; Artificial intelligence; Machine learning; Artificial neural network; Sensitivity (control systems); Mathematical optimization; Mathematics; Engineering","score_opus":0.018819987075397386,"score_gpt":0.2516263882658365,"score_spread":0.2328064011904391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944839767","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.015615808,0.0004966689,0.9795806,0.00041894897,0.00007260446,0.000024535211,0.000030568714,0.00042043027,0.0033398308],"genre_scores_gemma":[0.7778766,0.0010287107,0.20658424,0.0005360892,0.00029452294,0.00014069935,0.00021346188,0.00038956615,0.012936115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986511,0.00049606327,0.000041439118,0.00027855436,0.00040704408,0.00012580657],"domain_scores_gemma":[0.9946831,0.0035667026,0.00041895328,0.00081052794,0.0003886123,0.00013217305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027765897,0.0015624334,0.0012517292,0.0009250402,0.00047268567,0.0011251384,0.0018257031,0.0021339192,0.0018989053],"category_scores_gemma":[0.010392345,0.0006824599,0.0008290799,0.00058832724,0.0019830936,0.0022797382,0.0034795532,0.0043751854,0.0006642102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012112228,0.00006853251,0.00058725243,0.00011498859,0.0001126985,0.00010549944,0.00009690965,0.82075745,0.011972338,0.058303237,0.0039666076,0.10379345],"study_design_scores_gemma":[0.0000032543066,0.0000344141,0.0000808048,0.000011621712,0.000009728193,0.000043620614,0.000005601326,0.97767866,0.0014969697,0.020009467,0.00061921845,0.00000662026],"about_ca_topic_score_codex":0.0007355108,"about_ca_topic_score_gemma":0.00089456065,"teacher_disagreement_score":0.0027765897,"about_ca_system_score_codex":0.0007820257,"about_ca_system_score_gemma":0.0004816481,"threshold_uncertainty_score":0.0146842},"labels":[],"label_agreement":null},{"id":"W2944934343","doi":"10.1007/978-3-030-20351-1_14","title":"Minimizing Non-holonomicity: Finding Sheets in Fibrous Structures","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Algorithm; Contraction (grammar); Field (mathematics); Exploit; Measure (data warehouse); Human heart; Theoretical computer science; Mathematics; Data mining; Pure mathematics","score_opus":0.049636773734566174,"score_gpt":0.32846047506756243,"score_spread":0.2788237013329963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944934343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05040692,0.00061991514,0.94479424,0.00019298922,0.00006506281,0.000031006934,0.000086527696,0.00031332774,0.003489984],"genre_scores_gemma":[0.22947606,0.0010939066,0.75772244,0.000071426904,0.00013952285,0.00006938664,0.00034359543,0.00039045533,0.010693188],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998325,0.000042184187,0.0000094731895,0.000041712214,0.000060056314,0.000014067265],"domain_scores_gemma":[0.99921083,0.00045361416,0.00009969205,0.000081803075,0.00008349274,0.00007046622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005038069,0.0010233778,0.00086272944,0.00094098784,0.00041943093,0.0012237437,0.0011277571,0.0010699879,0.0021066281],"category_scores_gemma":[0.0021046004,0.0006633261,0.00055452564,0.0006539174,0.00082362466,0.0017215892,0.0012593481,0.0010284631,0.00057859556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039714458,0.00014987608,0.0019156147,0.0011549667,0.00011784838,0.0007036613,0.0009607014,0.24160796,0.070718005,0.1368973,0.013749139,0.53162783],"study_design_scores_gemma":[0.000023273353,0.00020116154,0.0010040789,0.000078557976,0.000039384675,0.0005845073,0.00028367553,0.73040676,0.013098649,0.24663882,0.0075984974,0.000042569718],"about_ca_topic_score_codex":0.00041678624,"about_ca_topic_score_gemma":0.0006441487,"teacher_disagreement_score":0.0021066281,"about_ca_system_score_codex":0.0002114073,"about_ca_system_score_gemma":0.0003348639,"threshold_uncertainty_score":0.007047415},"labels":[],"label_agreement":null},{"id":"W2944976762","doi":"10.1007/978-3-030-18305-9_51","title":"Fully End-To-End Super-Resolved Bone Age Estimation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and 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":"Queen's University","funders":"","keywords":"Computer science; Subpixel rendering; Preprocessor; Convolution (computer science); Convolutional neural network; Artificial intelligence; Scale (ratio); Orientation (vector space); Estimation; Machine learning; Artificial neural network; Pixel; Mathematics","score_opus":0.011421818955232097,"score_gpt":0.22774199983737373,"score_spread":0.21632018088214164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944976762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033622903,0.00036527627,0.99184227,0.00009380816,0.000087149936,0.000027046082,0.00044922144,0.0019001307,0.0018728488],"genre_scores_gemma":[0.06989437,0.00096907956,0.90962803,0.0004024167,0.00015984332,0.00008957731,0.0022764837,0.0007393949,0.015840737],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995962,0.000045147757,0.000017175404,0.0000853447,0.00019506946,0.00006112208],"domain_scores_gemma":[0.9995759,0.00009900675,0.0000302361,0.000125981,0.00013836306,0.000030546453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062263716,0.0012245843,0.0011047234,0.00060221343,0.00025689398,0.0013854086,0.001453912,0.0019354147,0.008131837],"category_scores_gemma":[0.0016917661,0.0009667562,0.0007986508,0.00066859304,0.00033177107,0.0016130197,0.0021550755,0.0011804344,0.010866802],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005888892,0.000115495284,0.0011330192,0.0003740581,0.00018250574,0.00034973645,0.00012544404,0.03679217,0.20930591,0.004523197,0.014351237,0.73215836],"study_design_scores_gemma":[0.00004058141,0.00026854567,0.0041768802,0.00012540157,0.0001771619,0.003304813,0.00013429282,0.72831476,0.1960095,0.026931215,0.04040072,0.000116055824],"about_ca_topic_score_codex":0.0008620696,"about_ca_topic_score_gemma":0.0028908853,"teacher_disagreement_score":0.008131837,"about_ca_system_score_codex":0.00015228069,"about_ca_system_score_gemma":0.00069860974,"threshold_uncertainty_score":0.02720368},"labels":[],"label_agreement":null},{"id":"W2944995129","doi":"10.1007/978-3-030-18305-9_31","title":"Lexicographic Preference Trees with Hard Constraints","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Lexicographical order; Computer science; Preference; Artificial intelligence; Mathematics; Combinatorics; Statistics","score_opus":0.022598848560566903,"score_gpt":0.22166688238641669,"score_spread":0.19906803382584978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944995129","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.021611985,0.001514364,0.8136466,0.0016577955,0.0004786444,0.00016911609,0.0016007499,0.00047832562,0.15884231],"genre_scores_gemma":[0.18895209,0.0034683866,0.70604235,0.0006940349,0.00043786512,0.00037965292,0.0029490096,0.0005001178,0.096576475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910957,0.00035929933,0.00006754628,0.000110591005,0.00027649399,0.00007656238],"domain_scores_gemma":[0.9983475,0.0010684552,0.00007905565,0.00022996623,0.00019891046,0.00007620187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929916,0.0005190864,0.0006006741,0.00095963816,0.0008636453,0.0025373201,0.0008190703,0.00075102394,0.02595492],"category_scores_gemma":[0.004175537,0.00073327514,0.0005994079,0.004061987,0.0008091415,0.00531412,0.0012813812,0.0026468239,0.006372701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008805959,0.00006382804,0.00016168365,0.00031148165,0.000014444732,0.00013921609,0.00023403014,0.007639369,0.0020226664,0.8094904,0.019616624,0.16021821],"study_design_scores_gemma":[0.000019688447,0.00002621425,0.000100127225,0.000060410905,0.0000087089775,0.0002533155,0.00012207575,0.018999713,0.0011516087,0.9382164,0.04102513,0.000016560753],"about_ca_topic_score_codex":0.0006088077,"about_ca_topic_score_gemma":0.0014964532,"teacher_disagreement_score":0.02595492,"about_ca_system_score_codex":0.0007034933,"about_ca_system_score_gemma":0.00081244984,"threshold_uncertainty_score":0.086827874},"labels":[],"label_agreement":null},{"id":"W2945067836","doi":"10.1007/978-3-030-17402-6_10","title":"$$k$$-cuts on a Path","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","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":"McGill University","funders":"","keywords":"Path (computing); Combinatorics; Limit (mathematics); Path length; Node (physics); Representation (politics); Random graph; Graph; Maximum cut; Mathematics; Discrete mathematics; Order (exchange); Computer science; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.03498321012605584,"score_gpt":0.2927314945862712,"score_spread":0.25774828446021536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945067836","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.16802236,0.0017204294,0.38199335,0.0036394738,0.0013819117,0.0002296459,0.0034050879,0.0008430612,0.4387646],"genre_scores_gemma":[0.45062304,0.002624588,0.22167076,0.0010722952,0.0004567157,0.00040625164,0.004911777,0.001106998,0.31712765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939954,0.00007176058,0.000028994617,0.00019629078,0.0001633655,0.00014014737],"domain_scores_gemma":[0.9990963,0.0003456187,0.00008746025,0.00010590738,0.00019879994,0.00016606982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036946702,0.0010615466,0.00078897836,0.0016582893,0.0014999221,0.0031927985,0.0012524787,0.0016581994,0.026452566],"category_scores_gemma":[0.001918087,0.0006468481,0.0008422711,0.0017488952,0.0017980661,0.003357644,0.0022116706,0.0043095085,0.005270108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001191663,0.000028839484,0.00017290264,0.000116076364,0.00001755485,0.00016015115,0.00010486255,0.003235113,0.0017845675,0.9596822,0.010736983,0.02384161],"study_design_scores_gemma":[0.00001858708,0.00003312981,0.0002930212,0.000045486377,0.000011746382,0.00026930272,0.000094617586,0.0065238397,0.00095050485,0.9628871,0.028856577,0.000016008127],"about_ca_topic_score_codex":0.0016148046,"about_ca_topic_score_gemma":0.0015102574,"teacher_disagreement_score":0.026452566,"about_ca_system_score_codex":0.0013350938,"about_ca_system_score_gemma":0.0007244677,"threshold_uncertainty_score":0.08849269},"labels":[],"label_agreement":null},{"id":"W2945090640","doi":"10.1007/978-3-030-18305-9_18","title":"Options in Multi-task Reinforcement Learning - Transfer via Reflection","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Ottawa","funders":"","keywords":"Reinforcement learning; Regret; Computer science; Transfer of learning; Artificial intelligence; Context (archaeology); State space; Task (project management); Landmark; Formalism (music); Reflection (computer programming); Machine learning","score_opus":0.029580750455954798,"score_gpt":0.27283070230665457,"score_spread":0.24324995185069978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945090640","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.015841028,0.00034253334,0.9777449,0.00021596519,0.00006177518,0.00004035713,0.000019127243,0.00032007202,0.005414331],"genre_scores_gemma":[0.83530307,0.00031103386,0.15409663,0.000116889925,0.000054677414,0.00026685654,0.000056363537,0.00015232532,0.0096421465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927527,0.00038489935,0.000037257054,0.00012974963,0.00009979532,0.000073024625],"domain_scores_gemma":[0.9979234,0.0016032956,0.00008574239,0.00018860116,0.00010274976,0.000096137606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017537276,0.0007977373,0.0009882126,0.0002458922,0.00036327998,0.0010112262,0.0017285008,0.0014832788,0.0051956787],"category_scores_gemma":[0.0049606445,0.0004580801,0.0006955728,0.00035845494,0.0016799874,0.0024598283,0.002590037,0.0026562407,0.00063433766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043197317,0.00016940126,0.00038163623,0.00020525898,0.00007878041,0.00013680251,0.00026381237,0.6049759,0.0037846216,0.21208343,0.0020005635,0.17548789],"study_design_scores_gemma":[0.000030956082,0.0000685684,0.00005591199,0.000013468148,0.000008358162,0.000018434197,0.000014628574,0.8880473,0.0007803703,0.11041296,0.0005381457,0.000010872069],"about_ca_topic_score_codex":0.0011674355,"about_ca_topic_score_gemma":0.00072219875,"teacher_disagreement_score":0.0051956787,"about_ca_system_score_codex":0.00065008475,"about_ca_system_score_gemma":0.0005616958,"threshold_uncertainty_score":0.01738125},"labels":[],"label_agreement":null},{"id":"W2945223861","doi":"10.1007/978-3-030-18305-9_3","title":"Measuring Human Emotion in Short Documents to Improve Social Robot and Agent Interactions","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Computer science; Exploit; Granularity; Robot; Emotion detection; State (computer science); Human–computer interaction; Tone (literature); Empirical research; Social robot; Artificial intelligence; Emotion recognition; Computer security; Mobile robot; Linguistics; Programming language; Robot control","score_opus":0.04286971534234519,"score_gpt":0.29846208032827354,"score_spread":0.25559236498592836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945223861","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.5550006,0.0056140455,0.40029505,0.0011069254,0.001123473,0.0005581459,0.013279033,0.0047697634,0.018252933],"genre_scores_gemma":[0.7855444,0.0014600515,0.18608639,0.00024093445,0.000753928,0.00032308832,0.013113011,0.00035926973,0.012118841],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923885,0.00020090802,0.000060537222,0.0001572206,0.00027562198,0.00006692385],"domain_scores_gemma":[0.99708647,0.0014368686,0.00026656096,0.00015334513,0.0009507846,0.00010598634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008644838,0.0008349709,0.0006121414,0.0014622152,0.00044245546,0.00115737,0.00034530292,0.00066889386,0.0040970915],"category_scores_gemma":[0.003912948,0.00015988952,0.0003841086,0.0014397646,0.0001913959,0.0013515892,0.00046254953,0.00062085147,0.0033535408],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015050112,0.00062887266,0.02580026,0.0007074723,0.00023480908,0.00021533876,0.00057000713,0.009078838,0.14428009,0.0011107024,0.028153328,0.7877154],"study_design_scores_gemma":[0.00014729191,0.0021700647,0.14902788,0.00021485363,0.0006747262,0.00061924924,0.0022588095,0.6280699,0.15572469,0.010937426,0.049952682,0.00020246129],"about_ca_topic_score_codex":0.0017040133,"about_ca_topic_score_gemma":0.0037454206,"teacher_disagreement_score":0.0040970915,"about_ca_system_score_codex":0.0003778792,"about_ca_system_score_gemma":0.00031174437,"threshold_uncertainty_score":0.013706207},"labels":[],"label_agreement":null},{"id":"W2945261847","doi":"10.1007/978-3-030-20528-7_20","title":"Verifying Strong Equivalence of Programs in the Input Language of gringo","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Computer science; Equivalence (formal languages); Programming language; Automated theorem proving; Set (abstract data type); Dynamic and formal equivalence; Logical equivalence; Well-formed formula; Vampire; Artificial intelligence; Natural language processing; Algebra over a field; Algorithm; Propositional variable; Discrete mathematics; Machine translation; Mathematics; Description logic; Intermediate logic; Pure mathematics","score_opus":0.03437507202296265,"score_gpt":0.26434250428505013,"score_spread":0.2299674322620875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945261847","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.18519059,0.00026020253,0.7786702,0.002142687,0.00036726895,0.00034036883,0.00079415285,0.007923789,0.024310773],"genre_scores_gemma":[0.8651996,0.00013928254,0.12742643,0.00060248404,0.00013239602,0.00019970852,0.0012200244,0.0011054826,0.003974609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895844,0.002909489,0.0006581935,0.0019026743,0.0033837354,0.0015614565],"domain_scores_gemma":[0.98242885,0.011706462,0.0007850777,0.0029392669,0.0017155581,0.00042480318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005549883,0.0008586834,0.0012996311,0.0009357593,0.0012927183,0.0036791798,0.0026522346,0.0018084017,0.005163911],"category_scores_gemma":[0.02318697,0.001011196,0.0025801936,0.0006109882,0.004330192,0.0076282388,0.0070379293,0.0047658454,0.0009226658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020716283,0.00078618515,0.0066076615,0.0010606513,0.0002638287,0.0016971123,0.0033388515,0.04171563,0.03698542,0.8268902,0.00705044,0.07153234],"study_design_scores_gemma":[0.00036385885,0.00040397103,0.001347959,0.00016660342,0.00018739479,0.0003493252,0.0005942893,0.11817919,0.04894988,0.81910634,0.010272282,0.00007891719],"about_ca_topic_score_codex":0.0021787384,"about_ca_topic_score_gemma":0.0019457123,"teacher_disagreement_score":0.005549883,"about_ca_system_score_codex":0.00193145,"about_ca_system_score_gemma":0.0023354215,"threshold_uncertainty_score":0.029350936},"labels":[],"label_agreement":null},{"id":"W2945270526","doi":"10.1007/978-3-030-20528-7_21","title":"The Return of xorro","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Computer science; Parity (physics); Theoretical computer science; Gauss; Variety (cybernetics); Artificial intelligence","score_opus":0.0142038248691278,"score_gpt":0.2328176265358851,"score_spread":0.2186138016667573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945270526","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02768052,0.004963309,0.15598822,0.013063683,0.00447563,0.000085713924,0.0010329908,0.0037611132,0.78894883],"genre_scores_gemma":[0.35079584,0.0033281152,0.04544219,0.004616635,0.0016653746,0.00015329037,0.0014048001,0.0035187015,0.5890751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986331,0.00025037245,0.000060874925,0.0002937419,0.00049434375,0.0002674951],"domain_scores_gemma":[0.99813384,0.00047329033,0.000095363,0.0008580199,0.00032513385,0.00011440483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012810901,0.0006430323,0.0006234519,0.001054808,0.0018161591,0.0049384516,0.0015225635,0.0013686012,0.049327753],"category_scores_gemma":[0.0061043566,0.00048510707,0.00066380453,0.0013263108,0.0031303596,0.012184223,0.0038767532,0.0023457464,0.014680124],"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.00015063478,0.000022582086,0.0003353136,0.00008203143,0.000013035265,0.00008774959,0.00020797968,0.00052178866,0.0011887792,0.8909085,0.030900925,0.07558069],"study_design_scores_gemma":[0.000019048635,0.000042968535,0.00027855698,0.000111324436,0.000031668635,0.00040128714,0.0002723058,0.0034400213,0.005424909,0.5074224,0.48252425,0.000031311327],"about_ca_topic_score_codex":0.0014393616,"about_ca_topic_score_gemma":0.0019351587,"teacher_disagreement_score":0.049327753,"about_ca_system_score_codex":0.0015221839,"about_ca_system_score_gemma":0.001136295,"threshold_uncertainty_score":0.16501778},"labels":[],"label_agreement":null},{"id":"W2945362431","doi":"10.1007/978-3-030-18305-9_43","title":"Learning Career Progression by Mining Social Media Profiles","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Université de Montréal","funders":"","keywords":"Popularity; Computer science; Social media; Focus (optics); Raw data; Data science; Trajectory; Order (exchange); Work (physics); Machine learning; Data mining; Artificial intelligence; World Wide Web","score_opus":0.024143229264533602,"score_gpt":0.26376719336364834,"score_spread":0.23962396409911474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945362431","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.8235873,0.0044848984,0.12470732,0.0019419972,0.00039793042,0.00036502586,0.019616269,0.002238935,0.022660337],"genre_scores_gemma":[0.89789987,0.0014976403,0.06779196,0.00014202372,0.0004112682,0.00020657553,0.01807015,0.00010847556,0.013872033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953794,0.000091641865,0.00003435918,0.00015107272,0.0001285497,0.000056424193],"domain_scores_gemma":[0.9979506,0.001246114,0.0002053528,0.00014063696,0.0002484679,0.00020879481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651599,0.00078439864,0.0005835988,0.0064669233,0.0005029073,0.0015258451,0.0008055884,0.0008165163,0.0037174819],"category_scores_gemma":[0.003979024,0.00027649407,0.0009902847,0.0036887904,0.00015109667,0.002164392,0.00085392885,0.0011688137,0.0052525867],"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.0004565146,0.0015159685,0.2611457,0.0002623969,0.00029195542,0.00018869356,0.00039332782,0.011901226,0.0027600273,0.0018794413,0.023052165,0.69615257],"study_design_scores_gemma":[0.00009803677,0.0007640167,0.18634059,0.0003438995,0.0004450916,0.00074368133,0.0017641463,0.74665654,0.0061763898,0.026026161,0.03051695,0.00012442998],"about_ca_topic_score_codex":0.0034827192,"about_ca_topic_score_gemma":0.010143192,"teacher_disagreement_score":0.0064669233,"about_ca_system_score_codex":0.0003060974,"about_ca_system_score_gemma":0.0004994696,"threshold_uncertainty_score":0.012436211},"labels":[],"label_agreement":null},{"id":"W2945374007","doi":"10.1007/978-3-030-18305-9_68","title":"Safe Policy Learning with Constrained Return Variance","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Variance (accounting); Artificial intelligence; Machine learning; Accounting","score_opus":0.011840084781795424,"score_gpt":0.23573608348315536,"score_spread":0.22389599870135993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945374007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037458206,0.00023904635,0.9924932,0.0001619835,0.00005288815,0.000014664535,0.000027679436,0.0003747368,0.002889927],"genre_scores_gemma":[0.60253125,0.0010166817,0.3637662,0.00044921885,0.0002686558,0.0002706297,0.00033700815,0.0007347132,0.030625748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989586,0.00030798707,0.000048373546,0.00020163816,0.00034389913,0.00013947261],"domain_scores_gemma":[0.99689037,0.002287359,0.00015491169,0.0003199109,0.00022220548,0.00012520283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019145237,0.0011510837,0.0015133375,0.0006215898,0.00045311163,0.001530388,0.001622264,0.0018408622,0.0049590818],"category_scores_gemma":[0.0073868018,0.0008825029,0.00073799695,0.00076108094,0.001824896,0.002052321,0.0029297306,0.0032786452,0.0013099555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015608527,0.00005924798,0.000247868,0.00010250252,0.000060294115,0.00008898433,0.000072583076,0.69554347,0.0018147525,0.17636545,0.0029400506,0.12254871],"study_design_scores_gemma":[0.00001555234,0.00003000921,0.00003869163,0.00001329855,0.0000070674687,0.000019863877,0.000003879514,0.87992376,0.00071143865,0.11839115,0.00083753205,0.000007830498],"about_ca_topic_score_codex":0.0019225669,"about_ca_topic_score_gemma":0.0013969037,"teacher_disagreement_score":0.0049590818,"about_ca_system_score_codex":0.0011052719,"about_ca_system_score_gemma":0.0017340652,"threshold_uncertainty_score":0.01658976},"labels":[],"label_agreement":null},{"id":"W2945401828","doi":"10.1007/978-3-030-18305-9_32","title":"Supervised Versus Unsupervised Deep Learning Based Methods for Skin Lesion Segmentation in Dermoscopy Images","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"Dalhousie University","funders":"","keywords":"Jaccard index; Artificial intelligence; Computer science; Segmentation; Sørensen–Dice coefficient; Deep learning; Pattern recognition (psychology); Dice; Unsupervised learning; Skin lesion; Supervised learning; Image segmentation; Image (mathematics); Machine learning; Artificial neural network; Mathematics; Medicine; Statistics; Pathology","score_opus":0.03109345681877437,"score_gpt":0.3322230756192655,"score_spread":0.30112961880049116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945401828","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.02942258,0.0030038645,0.9587969,0.00035849438,0.00015395026,0.00007895335,0.00054444675,0.002211523,0.005429333],"genre_scores_gemma":[0.2592908,0.0036103597,0.7018611,0.0003959232,0.00021702872,0.000120273035,0.002101223,0.0006883231,0.031715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981374,0.000028847428,0.00001080565,0.000059268466,0.000055925986,0.000031374566],"domain_scores_gemma":[0.9996449,0.00015568631,0.000032415574,0.000046002842,0.000103693426,0.000017355256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020875,0.00060461945,0.0005248772,0.00060434325,0.0001729671,0.0008538109,0.0008927062,0.00089629344,0.0035852408],"category_scores_gemma":[0.000834765,0.00031401316,0.0006531021,0.00058386696,0.00022682374,0.0007096914,0.00059319515,0.00072849734,0.0017233004],"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.0001519051,0.000087747474,0.0011861034,0.00024115709,0.00006616109,0.000067335575,0.000056507204,0.04559918,0.03782315,0.0030588217,0.008622359,0.9030396],"study_design_scores_gemma":[0.000006388775,0.00007534242,0.0020062437,0.00007198314,0.000046186837,0.0002677801,0.000036167272,0.9604406,0.02644215,0.0047878823,0.0058029452,0.000016249172],"about_ca_topic_score_codex":0.0023516538,"about_ca_topic_score_gemma":0.0076313973,"teacher_disagreement_score":0.0035852408,"about_ca_system_score_codex":0.0004043928,"about_ca_system_score_gemma":0.0005336997,"threshold_uncertainty_score":0.011993825},"labels":[],"label_agreement":null},{"id":"W2945479974","doi":"10.1007/978-3-030-18305-9_2","title":"Weakly Supervised, Data-Driven Acquisition of Rules for Open Information Extraction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Relationship extraction; Lemma (botany); Rank (graph theory); Natural language processing; Information extraction; Sentence; Relation (database); Recall; Artificial intelligence; Precision and recall; Quality (philosophy); Sequence (biology); Data mining; Information retrieval","score_opus":0.028140804625840177,"score_gpt":0.30427004187589934,"score_spread":0.27612923725005917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945479974","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.036108147,0.00037869983,0.9522317,0.00032229495,0.00006435131,0.00030161903,0.0015852782,0.0057262653,0.0032815991],"genre_scores_gemma":[0.19848657,0.0002104475,0.7882479,0.00022146034,0.00008303274,0.00036801992,0.008600136,0.00053887995,0.0032436352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595416,0.001087719,0.00048433148,0.0009776085,0.0012303317,0.0002658429],"domain_scores_gemma":[0.9799645,0.011748418,0.0008574306,0.0033144874,0.0037188123,0.00039634656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003502177,0.0007938516,0.0012541385,0.0023812866,0.00088668143,0.0031440642,0.0030510575,0.0013914753,0.0030513564],"category_scores_gemma":[0.017893648,0.00072595844,0.0012981279,0.0018338024,0.0010783781,0.0039006283,0.003218316,0.0028552604,0.0039167036],"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.00046086547,0.00059949956,0.0059566563,0.0005133061,0.0001431706,0.000379139,0.00049428374,0.019978499,0.046880253,0.011667345,0.012709072,0.90021783],"study_design_scores_gemma":[0.00004941704,0.0002055612,0.0026436814,0.00013114265,0.00008575041,0.00043990317,0.00033520625,0.85596174,0.08002192,0.04836732,0.011695793,0.00006249462],"about_ca_topic_score_codex":0.0015934212,"about_ca_topic_score_gemma":0.0055693095,"teacher_disagreement_score":0.003502177,"about_ca_system_score_codex":0.0008235035,"about_ca_system_score_gemma":0.0023242591,"threshold_uncertainty_score":0.018521488},"labels":[],"label_agreement":null},{"id":"W2945544107","doi":"10.1007/978-3-030-20912-4_13","title":"On Learning and Convergence of RBF Networks in Regression Estimation and Classification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Concordia University","funders":"","keywords":"Computer science; Convergence (economics); Artificial intelligence; Regression; Estimation; Machine learning; Artificial neural network; Pattern recognition (psychology); Statistics; Mathematics","score_opus":0.01644847171202781,"score_gpt":0.26043386129300233,"score_spread":0.24398538958097452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945544107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026640424,0.0037553888,0.9910806,0.0003106028,0.00013464906,0.000027629576,0.00002661404,0.00012757853,0.0018729604],"genre_scores_gemma":[0.16888142,0.009655167,0.8060636,0.00054225186,0.0010880529,0.00033493826,0.00036878503,0.0005826772,0.012483114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961331,0.0022772122,0.0002491975,0.0004753553,0.000677287,0.00018777401],"domain_scores_gemma":[0.9785429,0.017797591,0.00047067084,0.00086325174,0.0021119406,0.0002135942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012863845,0.0019304528,0.0025597543,0.0016300428,0.000681351,0.0019247743,0.0029879226,0.003428742,0.0027632588],"category_scores_gemma":[0.047692657,0.0014074356,0.0019852454,0.002629507,0.003247235,0.004490825,0.0036398063,0.0062149186,0.0009991289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022684963,0.00007999505,0.0011555691,0.0005135769,0.00019466477,0.00008850981,0.00034859407,0.54159075,0.002099201,0.20171241,0.0070798025,0.24491003],"study_design_scores_gemma":[0.0000083888535,0.000028405771,0.00017443477,0.000054227716,0.000019982068,0.000029809704,0.000015410493,0.9475575,0.0004928483,0.05004686,0.001556833,0.00001534447],"about_ca_topic_score_codex":0.008037966,"about_ca_topic_score_gemma":0.004443291,"teacher_disagreement_score":0.012863845,"about_ca_system_score_codex":0.0015930095,"about_ca_system_score_gemma":0.0010622011,"threshold_uncertainty_score":0.06803131},"labels":[],"label_agreement":null},{"id":"W2945547302","doi":"10.1007/978-3-030-50029-0_18","title":"Architecture Modelling of Parametric Component-Based Systems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Toronto Metropolitan University","funders":"Hellenic Foundation for Research and Innovation","keywords":"Computer science; Decidability; Component (thermodynamics); Parametric statistics; Satisfiability; Theoretical computer science; Equivalence (formal languages); Formal verification; Model checking; Formal equivalence checking; Programming language; Algorithm; Mathematics; Discrete mathematics","score_opus":0.06075901510783339,"score_gpt":0.26059645723849373,"score_spread":0.19983744213066035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945547302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008593951,0.0007606902,0.97934943,0.00010360092,0.00003331477,0.000026945594,0.000070484064,0.0007907143,0.010270733],"genre_scores_gemma":[0.58815116,0.004215795,0.3750673,0.000066974564,0.000088270535,0.00021759857,0.0008751219,0.0005223474,0.030795414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996922,0.00007781875,0.000022467397,0.00004329288,0.00013750761,0.000026713155],"domain_scores_gemma":[0.99977666,0.00008477146,0.000019920082,0.000052877,0.000056979778,0.000008845705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030971985,0.00075371686,0.00048153792,0.00068927254,0.00037272615,0.0017010876,0.0013456233,0.00090575416,0.0036136277],"category_scores_gemma":[0.0008729775,0.00059473584,0.0008436406,0.00093598,0.0006035831,0.0014191401,0.0006006998,0.0008522284,0.0012619152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038509865,0.000027111642,0.00034879416,0.00020149864,0.000032540458,0.00013685875,0.0002589409,0.68556666,0.010427649,0.21273093,0.0017302111,0.088500276],"study_design_scores_gemma":[0.0000051994543,0.000026123998,0.0002245057,0.000037873528,0.000022570111,0.00011267346,0.000026276643,0.9085683,0.0027948983,0.070032686,0.018137632,0.000011163259],"about_ca_topic_score_codex":0.0028583547,"about_ca_topic_score_gemma":0.0022326314,"teacher_disagreement_score":0.0036136277,"about_ca_system_score_codex":0.00059176167,"about_ca_system_score_gemma":0.00065488537,"threshold_uncertainty_score":0.012088776},"labels":[],"label_agreement":null},{"id":"W2945645791","doi":"10.1007/978-3-030-18656-2_24","title":"Application Specific Reconfigurable SoC Interconnection Network Architecture","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Computer science; Interconnection; Computer architecture; Architecture; Embedded system; Computer network","score_opus":0.014002418332682804,"score_gpt":0.22014306099590467,"score_spread":0.20614064266322185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945645791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13159722,0.006383306,0.54789025,0.00048187625,0.0013115223,0.00023180827,0.0013805459,0.012568564,0.29815495],"genre_scores_gemma":[0.5806085,0.0056283325,0.21082021,0.00052960945,0.00024929622,0.00020970777,0.0035736796,0.00089693203,0.19748375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999491,0.000005453065,0.0000036262352,0.000012304432,0.000016995815,0.000012513847],"domain_scores_gemma":[0.99994016,0.0000049244445,0.0000070322467,0.000016471144,0.00002565625,0.0000057616808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006194366,0.00040495777,0.00013918277,0.0004041348,0.00016848494,0.0003956191,0.0005609786,0.00021147747,0.0071333745],"category_scores_gemma":[0.00008792497,0.00014205032,0.00027012583,0.0004950844,0.000078932964,0.00034304548,0.00027987268,0.00032097904,0.002273522],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024985572,0.000081141574,0.0009721499,0.000905701,0.000089827015,0.0005638961,0.00009793201,0.06655027,0.29112777,0.042611774,0.038582113,0.5581675],"study_design_scores_gemma":[0.0000420776,0.00060988433,0.004312313,0.00016126395,0.0001672644,0.0027747846,0.00008756747,0.2657185,0.17888357,0.018355919,0.5288149,0.000071968],"about_ca_topic_score_codex":0.00055872835,"about_ca_topic_score_gemma":0.0016648838,"teacher_disagreement_score":0.0071333745,"about_ca_system_score_codex":0.00028595192,"about_ca_system_score_gemma":0.00030065706,"threshold_uncertainty_score":0.023863494},"labels":[],"label_agreement":null},{"id":"W2945679936","doi":"10.1007/978-3-030-18305-9_23","title":"A Behavior-Based Proactive User Authentication Model Utilizing Mobile Application Usage Patterns","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Ontario Tech University","funders":"","keywords":"Computer science; Authentication (law); Mobile device; Computer security; Mobile apps; World Wide Web","score_opus":0.02412654968512666,"score_gpt":0.26814480456852857,"score_spread":0.2440182548834019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945679936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13385028,0.0003516486,0.8543999,0.0006101379,0.00016188722,0.0003302905,0.00029697004,0.0050426153,0.004956177],"genre_scores_gemma":[0.95609945,0.0001465449,0.040639564,0.000096115116,0.000041831947,0.00011831768,0.00021121737,0.000042472635,0.0026044357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991536,0.0002029976,0.00006969935,0.0002012771,0.00028560712,0.0000868255],"domain_scores_gemma":[0.9983543,0.0005484683,0.00017574811,0.00022645906,0.00057261833,0.00012243493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012714505,0.00077617535,0.0008177041,0.0013101371,0.00062336243,0.0014443039,0.001696261,0.0007247277,0.0016703202],"category_scores_gemma":[0.0025617967,0.00028594208,0.0006048466,0.0009494998,0.00045156153,0.0028861319,0.00096430356,0.0008575611,0.0010518067],"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.0019297369,0.0027539034,0.024771042,0.00028554894,0.0004670137,0.00048072758,0.0006799249,0.2778105,0.05373295,0.0290384,0.008402072,0.5996482],"study_design_scores_gemma":[0.000011213724,0.00014447146,0.0013402628,0.000007019498,0.000051462943,0.00009678702,0.000035527097,0.99194604,0.0025995066,0.0031934849,0.0005507868,0.000023316954],"about_ca_topic_score_codex":0.0035216792,"about_ca_topic_score_gemma":0.003391635,"teacher_disagreement_score":0.0035216792,"about_ca_system_score_codex":0.0008380062,"about_ca_system_score_gemma":0.0010762659,"threshold_uncertainty_score":0.0070023537},"labels":[],"label_agreement":null},{"id":"W2945702027","doi":"10.1007/978-3-030-18305-9_12","title":"Efficient Transformer-Based Sentence Encoding for Sentence Pair Modelling","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Western University","funders":"","keywords":"Sentence; Computer science; Encoder; Natural language processing; Transformer; Paraphrase; Artificial intelligence; Semantic similarity; Textual entailment; Atomic sentence; Speech recognition; Logical consequence","score_opus":0.0350367527427273,"score_gpt":0.24631197798119744,"score_spread":0.21127522523847014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945702027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053058867,0.00030233705,0.9786147,0.00019080074,0.00018517661,0.00018454458,0.0023264845,0.010313459,0.0025766762],"genre_scores_gemma":[0.2157103,0.00062989944,0.76143056,0.00021812592,0.0002395231,0.00041330935,0.013244442,0.0023762581,0.005737529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987728,0.00037792537,0.00014667977,0.00029195411,0.00028990326,0.00012065721],"domain_scores_gemma":[0.9975733,0.0012160481,0.0001031291,0.00044152886,0.00056862313,0.00009728978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011532442,0.0012576843,0.0012036837,0.001404831,0.0006701589,0.0020472442,0.0024178468,0.0011143438,0.01834035],"category_scores_gemma":[0.0049209064,0.00067595596,0.0017627011,0.0017876313,0.00047200872,0.004525709,0.0024150065,0.0022359341,0.009994326],"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.0010703428,0.0002649443,0.0005834081,0.0010259878,0.00015098852,0.00054275064,0.0005339848,0.03992567,0.041078813,0.07685701,0.051528003,0.7864381],"study_design_scores_gemma":[0.00007315609,0.00014947045,0.00023678513,0.00008121709,0.00013106481,0.00040907593,0.00017941483,0.8426145,0.034125216,0.10096198,0.020974554,0.00006353905],"about_ca_topic_score_codex":0.0025137868,"about_ca_topic_score_gemma":0.0037853802,"teacher_disagreement_score":0.01834035,"about_ca_system_score_codex":0.0009855293,"about_ca_system_score_gemma":0.0015928517,"threshold_uncertainty_score":0.061354578},"labels":[],"label_agreement":null},{"id":"W2945745795","doi":"10.1007/978-3-030-18305-9_25","title":"Crowd Prediction Under Uncertainty","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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":"Computer Research Institute of Montréal","funders":"","keywords":"Crowds; Computer science; Pipeline (software); Set (abstract data type); Data mining; Noise (video); Artificial intelligence; Machine learning; Crowd simulation; Data science; Computer security; Image (mathematics)","score_opus":0.010856510664758548,"score_gpt":0.21861995230981893,"score_spread":0.2077634416450604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945745795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045390066,0.0035613587,0.90714604,0.0021148603,0.0005892199,0.00003869732,0.00053989067,0.00040465742,0.04021516],"genre_scores_gemma":[0.92558414,0.0024464272,0.034706473,0.00017872806,0.00071907474,0.00008236586,0.0006805243,0.00010332826,0.035498906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996884,0.00006866734,0.000010671357,0.00007840643,0.000103601466,0.000050302486],"domain_scores_gemma":[0.99892765,0.00075784256,0.00006467712,0.00006557964,0.00012893518,0.00005525531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067378965,0.0007729716,0.00089581317,0.0005395133,0.00033431046,0.0011464974,0.00079549337,0.000854414,0.0037806162],"category_scores_gemma":[0.003754233,0.00041806613,0.00041350367,0.0007146761,0.0006804733,0.0014734567,0.0012756432,0.001131959,0.0005666404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007599904,0.000021950058,0.0007352748,0.000044326676,0.000027771031,0.00006212179,0.00004781644,0.891738,0.00027073277,0.048034273,0.006897105,0.052044544],"study_design_scores_gemma":[0.0000015122966,0.000006739589,0.00015323356,0.0000084603635,0.0000029982134,0.000009455253,0.000008842756,0.96643764,0.000115631905,0.03258582,0.0006651812,0.0000045661436],"about_ca_topic_score_codex":0.0070459414,"about_ca_topic_score_gemma":0.00344892,"teacher_disagreement_score":0.0070459414,"about_ca_system_score_codex":0.0007593814,"about_ca_system_score_gemma":0.0005505856,"threshold_uncertainty_score":0.014009893},"labels":[],"label_agreement":null},{"id":"W2945778040","doi":"10.1007/978-3-030-25540-4_9","title":"Property Directed Self Composition","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission; Blavatnik Family Foundation","keywords":"Computer science; Composition (language); Property (philosophy); Invariant (physics); Function (biology); Program analysis; Set (abstract data type); Algorithm; Theoretical computer science; Programming language; Rule of inference; Mathematics","score_opus":0.023351352869770418,"score_gpt":0.2845058115426765,"score_spread":0.2611544586729061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945778040","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.01583129,0.00004712972,0.97856355,0.00013792586,0.000031053554,0.000089925714,0.00008264443,0.0020676907,0.003148857],"genre_scores_gemma":[0.31809652,0.00016779923,0.67604375,0.00027695298,0.00006003603,0.00017438046,0.0005578943,0.00075412437,0.0038685102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634856,0.0007056475,0.00021661328,0.0011155275,0.0013451825,0.00026846558],"domain_scores_gemma":[0.99372923,0.0032359369,0.0005359455,0.0015247746,0.0008421537,0.00013194283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025870698,0.00064673903,0.000606223,0.001135595,0.0010046196,0.0013474848,0.0016153196,0.0007454903,0.003692318],"category_scores_gemma":[0.008653753,0.000609564,0.0017999876,0.00065467635,0.0027450065,0.0034677018,0.0020485986,0.0013270836,0.0010109161],"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.00047214454,0.00043104196,0.012611723,0.00081439526,0.00030375578,0.0018086933,0.0020983892,0.11357306,0.052725732,0.5041793,0.0058709625,0.3051108],"study_design_scores_gemma":[0.000049319646,0.00014705097,0.00089071755,0.00008135352,0.00016911494,0.00082498865,0.00020114654,0.4819886,0.07830569,0.41074255,0.026546637,0.000052826243],"about_ca_topic_score_codex":0.001320323,"about_ca_topic_score_gemma":0.0014680114,"teacher_disagreement_score":0.003692318,"about_ca_system_score_codex":0.0009045096,"about_ca_system_score_gemma":0.0014193138,"threshold_uncertainty_score":0.013681889},"labels":[],"label_agreement":null},{"id":"W2945781045","doi":"10.1007/978-3-030-18305-9_61","title":"Using a Deep CNN for Automatic Classification of Sleep Spindles: A Preliminary Study","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sleep and Wakefulness Research","field":"Neuroscience","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":"Dalhousie University","funders":"","keywords":"Computer science; Task (project management); Convolutional neural network; Artificial intelligence; Affect (linguistics); Sleep (system call); Contrast (vision); Deep learning; Binary classification; Relevance (law); Machine learning; Pattern recognition (psychology); Support vector machine; Psychology","score_opus":0.10418654323141656,"score_gpt":0.3470066009564997,"score_spread":0.24282005772508314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945781045","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.82422984,0.0038566762,0.15536031,0.00067238923,0.0007619423,0.0002407162,0.0020522834,0.0020619875,0.010763928],"genre_scores_gemma":[0.9255769,0.0015803825,0.056268208,0.00020953953,0.000113591406,0.00007361333,0.0028367927,0.00013753751,0.013203564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980444,0.00002779763,0.000008669051,0.000050320847,0.000045974393,0.00006274899],"domain_scores_gemma":[0.99960893,0.00014161582,0.000019299381,0.000045590823,0.00016115682,0.000023511222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005832782,0.0006934098,0.0003824556,0.00029636937,0.00021897284,0.00066524406,0.0005376852,0.0005428003,0.0028912246],"category_scores_gemma":[0.0011806025,0.0002216796,0.00045472232,0.00042042971,0.00013786113,0.00069812825,0.00034781403,0.0005370708,0.0010569999],"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.0012755786,0.0007017921,0.018795216,0.00027054906,0.0003151005,0.00027523097,0.00010706926,0.021447485,0.1636525,0.00085647934,0.007105825,0.7851972],"study_design_scores_gemma":[0.00006260272,0.0010169952,0.03962767,0.0000891014,0.00041232535,0.0004172663,0.00019402975,0.86383283,0.08624519,0.0012485321,0.006808682,0.00004473059],"about_ca_topic_score_codex":0.010134425,"about_ca_topic_score_gemma":0.012003487,"teacher_disagreement_score":0.010134425,"about_ca_system_score_codex":0.00030615873,"about_ca_system_score_gemma":0.0004093116,"threshold_uncertainty_score":0.0201509},"labels":[],"label_agreement":null},{"id":"W2945861632","doi":"10.1007/978-3-030-18305-9_34","title":"Automatic Generation of Video Game Character Images Using Augmented Structure-and-Style Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Regina","funders":"","keywords":"Computer science; Character (mathematics); Task (project management); Artificial intelligence; Generative grammar; Image (mathematics); Theme (computing); Computer vision; Quality (philosophy); Pattern recognition (psychology)","score_opus":0.019244039617452927,"score_gpt":0.23483105946463737,"score_spread":0.21558701984718442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945861632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05255273,0.00028516728,0.9373244,0.00020209223,0.00022119164,0.00019924466,0.00045542835,0.0030646033,0.0056951274],"genre_scores_gemma":[0.58192897,0.00033489766,0.40039113,0.0002104626,0.000109053515,0.00020370702,0.001467029,0.0006391025,0.01471559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981123,0.000029476892,0.0000044677463,0.00007800978,0.00004891985,0.00002799015],"domain_scores_gemma":[0.99972767,0.00011535953,0.000022096896,0.00004188586,0.000064265565,0.00002879182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026019115,0.000978738,0.0005785294,0.00060649496,0.00022561502,0.00064742414,0.00083197525,0.000735062,0.0045848824],"category_scores_gemma":[0.0010587152,0.00046623326,0.0006877348,0.00037798315,0.000349955,0.00058490573,0.000707344,0.0010831218,0.0014413169],"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.0006221936,0.0002110986,0.001151279,0.00018075966,0.00011296515,0.0003780769,0.00012599686,0.3650301,0.07508839,0.009127604,0.011043349,0.53692824],"study_design_scores_gemma":[0.000009969306,0.000033133965,0.00019701867,0.0000063502584,0.00000755824,0.00005502763,0.000010187411,0.99005276,0.007118925,0.0015728999,0.0009296435,0.000006479472],"about_ca_topic_score_codex":0.0030251963,"about_ca_topic_score_gemma":0.0051116967,"teacher_disagreement_score":0.0045848824,"about_ca_system_score_codex":0.0005328539,"about_ca_system_score_gemma":0.00035739204,"threshold_uncertainty_score":0.015337944},"labels":[],"label_agreement":null},{"id":"W2945873313","doi":"10.1007/978-3-030-18305-9_28","title":"A Shallow Learning - Reduced Data Approach for Image Classification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Benchmark (surveying); Interpolation (computer graphics); Image (mathematics); Artificial intelligence; Artificial neural network; Feature (linguistics); Process (computing); Deep learning; Pattern recognition (psychology); Contextual image classification; Image scaling; Machine learning; Image processing","score_opus":0.06030036238334063,"score_gpt":0.28954712711596675,"score_spread":0.22924676473262612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945873313","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.0036542627,0.00035861845,0.993049,0.00022909309,0.000050904695,0.000038064856,0.00026447003,0.0013584408,0.0009971703],"genre_scores_gemma":[0.12394594,0.00066417095,0.8589395,0.00046593935,0.00018361368,0.00023607536,0.0023940296,0.00046858477,0.012702081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.0001338861,0.0000482889,0.00014585517,0.00022790938,0.00008003798],"domain_scores_gemma":[0.9989557,0.00043848244,0.0000540785,0.0002883946,0.00022006773,0.000043276832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083019375,0.0009863572,0.001806682,0.0010387276,0.0005276036,0.0015518913,0.0033876528,0.001760133,0.0064904955],"category_scores_gemma":[0.002506325,0.00082862657,0.0018326534,0.0015486748,0.00086373824,0.002229289,0.00309071,0.0030972564,0.0034121498],"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.00016110318,0.00016090278,0.00043953134,0.00026109902,0.00013458055,0.00014032665,0.00012263998,0.104116686,0.019413354,0.04340574,0.015344198,0.81629974],"study_design_scores_gemma":[0.0000072254675,0.000025795984,0.00012933702,0.000011993512,0.000022237953,0.000030366878,0.000013939306,0.9600867,0.0032208627,0.03426164,0.0021803319,0.000009605457],"about_ca_topic_score_codex":0.0069038835,"about_ca_topic_score_gemma":0.009720293,"teacher_disagreement_score":0.0069038835,"about_ca_system_score_codex":0.00084602623,"about_ca_system_score_gemma":0.0010869836,"threshold_uncertainty_score":0.0217129},"labels":[],"label_agreement":null},{"id":"W2945889381","doi":"10.1007/978-3-030-18305-9_22","title":"Memory-Efficient Backpropagation for Recurrent Neural Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Recurrent neural network; Backpropagation; Flexibility (engineering); Sequence (biology); Artificial neural network; Process (computing); Artificial intelligence; Long short term memory; Dependency (UML); Pattern recognition (psychology); Algorithm","score_opus":0.020315661036380633,"score_gpt":0.2632183953868266,"score_spread":0.242902734350446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945889381","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.0085648615,0.0011525906,0.98505497,0.00018074199,0.00014793771,0.000026049629,0.0001338183,0.0015197027,0.0032192871],"genre_scores_gemma":[0.31335717,0.0018265599,0.6535146,0.00017375275,0.00024247999,0.00016902159,0.0010384844,0.00094066066,0.02873732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.000049278606,0.000023407034,0.000051621868,0.00011972035,0.000038445287],"domain_scores_gemma":[0.99949217,0.00022145387,0.000034950215,0.000081996404,0.00015376687,0.000015666012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004651244,0.0007665466,0.00068587624,0.0003874281,0.00028990424,0.00086040044,0.0013475298,0.0010661224,0.0049896343],"category_scores_gemma":[0.0024559293,0.0004621835,0.00043941397,0.00070747343,0.00028417987,0.0014192172,0.0007937382,0.0013801254,0.002052242],"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.00015017917,0.00009555205,0.000288525,0.0002452151,0.00010308727,0.000092718095,0.000057834277,0.41767028,0.018841133,0.02883742,0.013031245,0.5205868],"study_design_scores_gemma":[0.0000041225067,0.00001080766,0.000054013883,0.0000064268875,0.000008554759,0.000014339264,0.0000024364601,0.99130124,0.0024557465,0.0049712397,0.0011671573,0.000003814696],"about_ca_topic_score_codex":0.004240643,"about_ca_topic_score_gemma":0.0072046495,"teacher_disagreement_score":0.0049896343,"about_ca_system_score_codex":0.0005195643,"about_ca_system_score_gemma":0.0005627625,"threshold_uncertainty_score":0.016691983},"labels":[],"label_agreement":null},{"id":"W2945922950","doi":"10.1007/978-3-030-20876-9_42","title":"Dynamic Gated Graph Neural Networks for Scene Graph Generation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Graph; Artificial neural network; Artificial intelligence; Theoretical computer science","score_opus":0.014895537652651124,"score_gpt":0.26298440261584144,"score_spread":0.24808886496319033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945922950","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.009508894,0.00040124333,0.98303795,0.00017062404,0.00008423376,0.00007966669,0.00042051682,0.0030654348,0.0032315117],"genre_scores_gemma":[0.32691392,0.0007814813,0.6521473,0.0003606818,0.00011512899,0.00023777997,0.0029930484,0.0013001898,0.015150395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986196,0.00002422554,0.0000046885443,0.00005363483,0.000033932847,0.000021555663],"domain_scores_gemma":[0.9997639,0.00010240084,0.000015101345,0.00004998549,0.000049655613,0.000018875295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002305751,0.00082649983,0.0007069858,0.0007822802,0.00030855215,0.0006431794,0.00185944,0.0010504439,0.008461827],"category_scores_gemma":[0.0008752996,0.0005630192,0.00065054704,0.0011306803,0.0004026347,0.0010040699,0.0009587142,0.0015102912,0.0018431874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120959354,0.000104386905,0.00020444338,0.0000894249,0.00004644283,0.00007232379,0.000033197743,0.5387787,0.013487353,0.016551195,0.011993795,0.41851774],"study_design_scores_gemma":[0.0000036477097,0.0000070290257,0.000038309146,0.0000033370345,0.0000036187466,0.0000076083547,0.0000029823373,0.9934962,0.0012168011,0.0045308964,0.0006868669,0.0000027187452],"about_ca_topic_score_codex":0.009890123,"about_ca_topic_score_gemma":0.018337099,"teacher_disagreement_score":0.009890123,"about_ca_system_score_codex":0.00088847225,"about_ca_system_score_gemma":0.0006622772,"threshold_uncertainty_score":0.028307676},"labels":[],"label_agreement":null},{"id":"W2946016801","doi":"10.1007/978-3-030-18305-9_26","title":"Optimized Random Walk with Restart for Recommendation Systems","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Random walk; Computer science; Computational complexity theory; Recommender system; Algorithm; Time complexity; Theoretical computer science; Machine learning; Mathematics; Statistics","score_opus":0.021029099003482935,"score_gpt":0.24928291005053238,"score_spread":0.22825381104704945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946016801","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.008514102,0.0014828916,0.98504144,0.00019630355,0.00016285051,0.00008037801,0.00020943068,0.0019401847,0.0023723855],"genre_scores_gemma":[0.41733512,0.0013306008,0.5529684,0.00039966646,0.00047062314,0.0004014374,0.0012803336,0.0011383396,0.024675488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997985,0.00089936407,0.000098364595,0.00037078946,0.00041318225,0.00023325648],"domain_scores_gemma":[0.99587786,0.0026523415,0.00012217945,0.0008450562,0.00039931567,0.00010320962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017227427,0.0015097507,0.0030770265,0.00088890025,0.00095440424,0.0017301241,0.0030993712,0.002130859,0.00806447],"category_scores_gemma":[0.008310412,0.0011375287,0.0012415869,0.0018455364,0.0008089249,0.002708025,0.001329867,0.0025062677,0.0032789723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006067047,0.00024297561,0.00038567587,0.00022960587,0.00019842725,0.00008786945,0.000050897972,0.7691408,0.0026915837,0.022368668,0.013415067,0.19058177],"study_design_scores_gemma":[0.000018540386,0.00003328573,0.00005224389,0.0000046810874,0.000012752092,0.000014690324,0.0000022409201,0.99332494,0.00032680223,0.005646149,0.0005568105,0.00000697329],"about_ca_topic_score_codex":0.008455584,"about_ca_topic_score_gemma":0.011191601,"teacher_disagreement_score":0.008455584,"about_ca_system_score_codex":0.0010277379,"about_ca_system_score_gemma":0.0009791096,"threshold_uncertainty_score":0.026978374},"labels":[],"label_agreement":null},{"id":"W2946059286","doi":"10.1007/978-3-030-20351-1_4","title":"Analyzing Brain Morphology on the Bag-of-Features Manifold","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jaccard index; Computer science; Pattern recognition (psychology); Artificial intelligence; Pairwise comparison; Probabilistic logic","score_opus":0.009661325543606962,"score_gpt":0.22601912588067055,"score_spread":0.2163578003370636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946059286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06447721,0.00059988705,0.9322801,0.00024083829,0.00004484032,0.000022249982,0.0002225413,0.001046072,0.0010661867],"genre_scores_gemma":[0.66938597,0.0010528824,0.32071584,0.00011986905,0.00024414677,0.000082692495,0.0014892494,0.00055493,0.0063542794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.0000730331,0.0000138569685,0.000091035254,0.000081265105,0.00003309601],"domain_scores_gemma":[0.99935883,0.00025046102,0.000089963934,0.00014045382,0.000118353746,0.000041996776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048741765,0.00058769615,0.00086125714,0.001077248,0.00029622953,0.00089872256,0.0009917581,0.0006056562,0.0017780039],"category_scores_gemma":[0.0018992173,0.00032763084,0.0007861827,0.0012074871,0.0006214675,0.0019557767,0.0013113911,0.0010146159,0.00078987615],"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.00016950037,0.00010580208,0.004247847,0.00018517807,0.00018155485,0.00018515936,0.00024603802,0.14435597,0.031484608,0.038746346,0.009998806,0.7700931],"study_design_scores_gemma":[0.000004560133,0.00005264294,0.0028155681,0.000008546727,0.000014167858,0.00009116031,0.00003532888,0.94827193,0.0020761997,0.045354825,0.0012611842,0.000013949562],"about_ca_topic_score_codex":0.0019359428,"about_ca_topic_score_gemma":0.002537274,"teacher_disagreement_score":0.0019359428,"about_ca_system_score_codex":0.00037579454,"about_ca_system_score_gemma":0.00033680283,"threshold_uncertainty_score":0.005948007},"labels":[],"label_agreement":null},{"id":"W2946106399","doi":"10.1007/978-3-030-18305-9_55","title":"Compression Improves Image Classification Accuracy","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Memorial University of Newfoundland","funders":"","keywords":"Image compression; Computer science; JPEG; Artificial intelligence; Compression (physics); Convolutional neural network; Compression ratio; Singular value decomposition; Pattern recognition (psychology); Texture compression; Data compression; Lossless compression; Data compression ratio; Image (mathematics); Computer vision; Image processing","score_opus":0.019292802609735118,"score_gpt":0.2734313471444804,"score_spread":0.2541385445347453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946106399","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.5615201,0.008544216,0.35380945,0.0027412348,0.0031432237,0.00027038975,0.0025971492,0.021880016,0.045494325],"genre_scores_gemma":[0.8138116,0.003156939,0.14040896,0.0010217242,0.0009726204,0.000073441144,0.0040188506,0.00084855786,0.035687245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955255,0.000040555038,0.000027045768,0.000082892126,0.0002333116,0.00006359918],"domain_scores_gemma":[0.99852836,0.0005158442,0.00009349528,0.00039734787,0.00041567546,0.000049286355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037034156,0.000977362,0.0006092582,0.0013279319,0.00028044617,0.0010805498,0.00047444456,0.0010692023,0.0121602],"category_scores_gemma":[0.0023842156,0.00020387047,0.00038768747,0.001354399,0.00025085747,0.001019597,0.00048268226,0.00073813694,0.005344997],"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.000806584,0.00021797832,0.001971116,0.0001421101,0.00004685927,0.00023093907,0.000025765192,0.011198055,0.13474604,0.0007713946,0.014191231,0.8356518],"study_design_scores_gemma":[0.00011848492,0.0007233661,0.016292114,0.00010293127,0.00021913233,0.0020610103,0.00012941168,0.539351,0.41256353,0.005323215,0.02304558,0.000070218746],"about_ca_topic_score_codex":0.0019307799,"about_ca_topic_score_gemma":0.0020477439,"teacher_disagreement_score":0.0121602,"about_ca_system_score_codex":0.00025487517,"about_ca_system_score_gemma":0.00028992747,"threshold_uncertainty_score":0.04067993},"labels":[],"label_agreement":null},{"id":"W2946149145","doi":"10.1007/978-3-030-18305-9_13","title":"Instance Ranking and Numerosity Reduction Using Matrix Decomposition and Subspace Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Numerosity adaptation effect; Computer science; Dimensionality reduction; Ranking (information retrieval); Reduction (mathematics); Subspace topology; Matrix decomposition; Similarity (geometry); Artificial intelligence; Rank (graph theory); Measure (data warehouse); Matrix (chemical analysis); Pattern recognition (psychology); Cluster analysis; Data mining; Decomposition; Similarity measure; Machine learning; Mathematics; Eigenvalues and eigenvectors","score_opus":0.014870139166824392,"score_gpt":0.27747405352300447,"score_spread":0.2626039143561801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946149145","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.01240053,0.00043024312,0.98141015,0.00026879646,0.00013709586,0.000057471487,0.00023230116,0.0011482832,0.003915171],"genre_scores_gemma":[0.19780715,0.00045369222,0.7863603,0.00020462796,0.0003183356,0.0001744696,0.0013961836,0.00054282503,0.012742383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836415,0.0004964233,0.00008955603,0.00029924524,0.00057841657,0.00017225457],"domain_scores_gemma":[0.9979461,0.0008659607,0.00011878237,0.00048731524,0.0004698158,0.00011218152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875938,0.0008479216,0.0020910962,0.0021664824,0.00067200395,0.002489841,0.0019985922,0.0010175373,0.0074873776],"category_scores_gemma":[0.006390419,0.00039639205,0.0013415797,0.0028799607,0.0007974188,0.0025853417,0.0019778542,0.001973284,0.0023526328],"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.00021226067,0.0002890759,0.00082384027,0.00019181678,0.000085071755,0.000069866495,0.000077865625,0.051922616,0.007714886,0.07924862,0.021832293,0.8375318],"study_design_scores_gemma":[0.000027190792,0.00007777099,0.00055206876,0.000022373855,0.000033155968,0.00013107838,0.00005018357,0.86794996,0.0044465014,0.12192335,0.004754213,0.0000321064],"about_ca_topic_score_codex":0.001780432,"about_ca_topic_score_gemma":0.0023644397,"teacher_disagreement_score":0.0074873776,"about_ca_system_score_codex":0.00072270894,"about_ca_system_score_gemma":0.0009078801,"threshold_uncertainty_score":0.02504778},"labels":[],"label_agreement":null},{"id":"W2946157752","doi":"10.1007/978-3-030-20351-1_7","title":"Adaptive Graph Convolution Pooling for Brain Surface Analysis","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pooling; Computer science; Graph; Theoretical computer science; Spectral graph theory; Artificial intelligence; Algorithm; Voltage graph; Line graph","score_opus":0.03719479559170657,"score_gpt":0.2635181630130012,"score_spread":0.2263233674212946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946157752","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.0017372767,0.0005427103,0.9933478,0.00011642709,0.00007948175,0.000019373412,0.00018214197,0.0018329999,0.0021418252],"genre_scores_gemma":[0.0552688,0.0015975891,0.9183406,0.0001736996,0.00017241789,0.000114910086,0.0012245544,0.001488348,0.021618988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998105,0.000029797326,0.000010021305,0.000055510012,0.000065941524,0.000028251392],"domain_scores_gemma":[0.9997925,0.00006654999,0.000011633734,0.00006960956,0.000047125166,0.000012538237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003870942,0.001119005,0.00075416086,0.000702565,0.00029067587,0.0008941001,0.0015358867,0.00090031547,0.012050242],"category_scores_gemma":[0.0007307676,0.00044184263,0.00111585,0.0014761194,0.00039300756,0.0011544543,0.0011620728,0.0010215738,0.005965458],"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.00008944528,0.00005016072,0.0001467421,0.00022996339,0.00012553672,0.00009816872,0.000052701453,0.028464785,0.06260435,0.033998124,0.028295385,0.8458446],"study_design_scores_gemma":[0.000011626583,0.00006160671,0.0008737227,0.000028905479,0.0000704647,0.00035173568,0.000028253526,0.8396535,0.052771024,0.06621533,0.03989055,0.000043253232],"about_ca_topic_score_codex":0.0028892457,"about_ca_topic_score_gemma":0.00607076,"teacher_disagreement_score":0.012050242,"about_ca_system_score_codex":0.0005536861,"about_ca_system_score_gemma":0.00050994306,"threshold_uncertainty_score":0.04031205},"labels":[],"label_agreement":null},{"id":"W2946162694","doi":"10.1007/978-3-030-20528-7_12","title":"Towards Dynamic Answer Set Programming over Finite Traces","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Linear temporal logic; Dynamic logic (digital electronics); Temporal logic; Converse; Set (abstract data type); Context (archaeology); Answer set programming; Theoretical computer science; Interval temporal logic; Temporal logic of actions; Dynamic programming; Logic programming; Programming language; Algorithm; Mathematics","score_opus":0.015763986132803807,"score_gpt":0.2569358012840304,"score_spread":0.24117181515122657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946162694","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.004025455,0.0002044663,0.98714614,0.0005799964,0.00007450829,0.000060888844,0.00013723645,0.001627919,0.0061434526],"genre_scores_gemma":[0.12399912,0.0005964671,0.85962945,0.0005318761,0.00018682078,0.00027530128,0.0009577588,0.0011037021,0.012719476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504095,0.001180958,0.00041383773,0.0010913133,0.0016920944,0.0005808404],"domain_scores_gemma":[0.993937,0.0040057544,0.00019314715,0.0009940587,0.0006382801,0.00023167803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005149825,0.0013313771,0.001724185,0.0022431102,0.0016456555,0.0067652124,0.005476448,0.002289321,0.009614649],"category_scores_gemma":[0.011731176,0.0018995246,0.0033853804,0.0031140966,0.004162517,0.013633641,0.008314296,0.0086274445,0.002577065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068706024,0.00006234131,0.0001702048,0.00018702347,0.000037758473,0.00006416235,0.00046991784,0.011563649,0.0014377661,0.91667265,0.0027875,0.06647839],"study_design_scores_gemma":[0.00001734091,0.000012441281,0.000027891383,0.000050573402,0.000023540606,0.000033378048,0.000085484484,0.041479804,0.0015378464,0.9475347,0.009182638,0.000014414546],"about_ca_topic_score_codex":0.003282749,"about_ca_topic_score_gemma":0.0039155395,"teacher_disagreement_score":0.009614649,"about_ca_system_score_codex":0.0027970138,"about_ca_system_score_gemma":0.0023208405,"threshold_uncertainty_score":0.032164216},"labels":[],"label_agreement":null},{"id":"W2946207881","doi":"10.1007/978-3-030-18305-9_52","title":"Name2Vec: Personal Names Embeddings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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","funders":"","keywords":"Computer science; Task (project management); Word (group theory); Information retrieval; Proper noun; Linkage (software); Natural language processing; Embedding; Artificial intelligence; Linguistics","score_opus":0.07252391469650568,"score_gpt":0.35107711140850406,"score_spread":0.2785531967119984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946207881","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.009317662,0.0020405506,0.76721066,0.0014819854,0.0029219869,0.00022355425,0.06761595,0.1176644,0.031523213],"genre_scores_gemma":[0.081723124,0.002567268,0.60079527,0.0010975248,0.00072775607,0.00058823626,0.20886777,0.012029157,0.09160391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991266,0.00017066658,0.00006236985,0.00027594974,0.0002741192,0.000090292306],"domain_scores_gemma":[0.99922895,0.00016522313,0.000040612686,0.00033837502,0.0001812122,0.000045701276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479927,0.002061772,0.00067656755,0.0014363779,0.0005436124,0.0016797571,0.0010798532,0.0010758323,0.036781702],"category_scores_gemma":[0.0030184013,0.0007845508,0.001242428,0.0018006089,0.00038363304,0.0041052536,0.0023566452,0.0017976349,0.040906455],"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.00012794051,0.000091937996,0.00074535824,0.00028926058,0.000067212306,0.00009303211,0.0000945013,0.006592368,0.0033108904,0.013883303,0.47879392,0.49591023],"study_design_scores_gemma":[0.000053989424,0.00015246443,0.0019849492,0.00025171298,0.0000932472,0.00079399784,0.00023203329,0.28910238,0.029560445,0.09826658,0.5793713,0.00013682747],"about_ca_topic_score_codex":0.002281088,"about_ca_topic_score_gemma":0.0057783667,"teacher_disagreement_score":0.036781702,"about_ca_system_score_codex":0.00044034404,"about_ca_system_score_gemma":0.0007530101,"threshold_uncertainty_score":0.123047054},"labels":[],"label_agreement":null},{"id":"W2946285377","doi":"10.1007/978-3-030-18305-9_29","title":"Multi-class Ensemble Learning of Imbalanced Bidding Fraud Data","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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 Regina","funders":"","keywords":"Computer science; Bidding; Class (philosophy); Ensemble learning; Artificial intelligence; Machine learning; Business","score_opus":0.0433814805568129,"score_gpt":0.29030384445495205,"score_spread":0.24692236389813915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946285377","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.497353,0.0031935913,0.48765826,0.0016275321,0.0009357862,0.0001759545,0.0014772812,0.0014235626,0.0061550564],"genre_scores_gemma":[0.9111071,0.000542647,0.07962541,0.0001549684,0.0004226034,0.00008254528,0.003310089,0.00008629117,0.004668417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838245,0.0005955286,0.00009833613,0.00028906038,0.0003967098,0.00023791501],"domain_scores_gemma":[0.9960908,0.0018841099,0.00021022101,0.000694331,0.00093692687,0.00018369565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005634164,0.0010174768,0.0014707581,0.0020449979,0.0006035506,0.0015066407,0.0013173354,0.0012218626,0.0011301704],"category_scores_gemma":[0.0063055204,0.00036454643,0.0011089282,0.0020157355,0.00031987624,0.0020985415,0.0012566234,0.0021810243,0.0006461568],"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.0008617902,0.00083634927,0.025287317,0.00011486108,0.0005540905,0.00018397438,0.00023686937,0.22292256,0.0033936233,0.004016669,0.02020669,0.7213851],"study_design_scores_gemma":[0.0000056948434,0.000052810552,0.0022129118,0.0000105745075,0.00003955811,0.00004011409,0.000043754902,0.99350125,0.0009770102,0.0022203932,0.0008868863,0.000009055644],"about_ca_topic_score_codex":0.002342771,"about_ca_topic_score_gemma":0.0036250025,"teacher_disagreement_score":0.005634164,"about_ca_system_score_codex":0.0007631258,"about_ca_system_score_gemma":0.0006354416,"threshold_uncertainty_score":0.02979666},"labels":[],"label_agreement":null},{"id":"W2946309990","doi":"10.1007/978-3-030-18305-9_62","title":"Principal Sample Analysis for Data Ranking","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Numerosity adaptation effect; Computer science; Reduction (mathematics); Ranking (information retrieval); Data reduction; Cluster analysis; Sample (material); Artificial intelligence; Data mining; Principal component analysis; Sample space; Selection (genetic algorithm); Principal (computer security); Field (mathematics); Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.053914105437575785,"score_gpt":0.3056288085389437,"score_spread":0.2517147031013679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946309990","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.00059915765,0.0009688537,0.9954566,0.00014536471,0.00012481297,0.00005733585,0.00033148637,0.0017272113,0.0005891911],"genre_scores_gemma":[0.02637084,0.0013153155,0.9618707,0.00015990231,0.00043257908,0.00059994,0.0026617493,0.0009503865,0.0056387107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98956084,0.005268356,0.0005950838,0.0011934394,0.003099002,0.00028315894],"domain_scores_gemma":[0.9869241,0.007878107,0.00038748898,0.0030392136,0.0016131707,0.00015778339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067860936,0.0023107214,0.0034010767,0.0035091199,0.0012373716,0.0028686246,0.0022491503,0.0015577541,0.012940989],"category_scores_gemma":[0.02470755,0.0009945608,0.002518889,0.005533582,0.0012428038,0.0024808105,0.0022858884,0.0033676957,0.0140412375],"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.00019760158,0.00010884035,0.0006096212,0.0005579121,0.00022182433,0.000073142655,0.00008526665,0.015057214,0.002990793,0.037897658,0.042883378,0.8993167],"study_design_scores_gemma":[0.00008018676,0.00022831168,0.0019528971,0.00012676182,0.0001648138,0.00032146266,0.00011551529,0.6975383,0.0075809644,0.23765856,0.054136142,0.00009598755],"about_ca_topic_score_codex":0.001274835,"about_ca_topic_score_gemma":0.0017967828,"teacher_disagreement_score":0.012940989,"about_ca_system_score_codex":0.00079593575,"about_ca_system_score_gemma":0.0017665084,"threshold_uncertainty_score":0.043291986},"labels":[],"label_agreement":null},{"id":"W2946325139","doi":"10.1007/978-3-030-18305-9_54","title":"Semantic Roles: Towards Rhetorical Moves in Writing About Experimental Procedures","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University; University of Waterloo","funders":"","keywords":"Rhetorical question; Computer science; FrameNet; Natural language processing; Linguistics; Artificial intelligence; Focus (optics); Task (project management); Domain (mathematical analysis); Parsing","score_opus":0.016847739278021037,"score_gpt":0.28526324052888435,"score_spread":0.26841550125086333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946325139","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.0031179294,0.0010127747,0.9136295,0.014161463,0.0010317864,0.00014668278,0.00033697105,0.0014351306,0.06512769],"genre_scores_gemma":[0.15079676,0.0013183258,0.8111323,0.0024791982,0.0010822457,0.0005033908,0.0011534286,0.0018879587,0.029646358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98697144,0.009306473,0.00070198573,0.0010965593,0.0016191344,0.00030441443],"domain_scores_gemma":[0.9746513,0.02063026,0.000619947,0.0018187923,0.0017697554,0.00050992484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0113159465,0.0015769986,0.0008640494,0.0034045032,0.004133401,0.010313619,0.0039536715,0.0044986256,0.015657915],"category_scores_gemma":[0.026562132,0.0019031133,0.0014887538,0.0023084537,0.012475398,0.031596247,0.0074277185,0.0083764605,0.006685422],"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.00002308759,0.000013371302,0.000035726545,0.00015540097,0.0000052541745,0.000046360085,0.0039297407,0.0002292909,0.00062327617,0.9674444,0.007938915,0.01955509],"study_design_scores_gemma":[0.000023897313,0.000014767411,0.000040515588,0.00022523703,0.000024340356,0.00009622098,0.0016451236,0.005339641,0.0023342466,0.8410244,0.1492091,0.00002250748],"about_ca_topic_score_codex":0.0015040297,"about_ca_topic_score_gemma":0.001736712,"teacher_disagreement_score":0.015657915,"about_ca_system_score_codex":0.0029876528,"about_ca_system_score_gemma":0.0029600088,"threshold_uncertainty_score":0.05984515},"labels":[],"label_agreement":null},{"id":"W2946332037","doi":"10.1007/978-3-030-18305-9_17","title":"In Vino Veritas: Estimating Vineyard Grape Yield from Images Using Deep Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","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":"Acadia University","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Vineyard; Transfer of learning; Image (mathematics); Convolution (computer science); Deep learning; Artificial neural network; Field (mathematics); Machine learning; Pattern recognition (psychology); Mathematics; Geography","score_opus":0.018745290791906344,"score_gpt":0.22078753457171066,"score_spread":0.20204224377980431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946332037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052799065,0.010146356,0.8985052,0.0011661645,0.0017965817,0.000107896,0.0038480933,0.020486265,0.011144368],"genre_scores_gemma":[0.37431338,0.0056510014,0.5194343,0.0009300658,0.00094705395,0.00015718573,0.010784396,0.0023620676,0.08542053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998503,0.000019973595,0.0000055735095,0.00006501484,0.00003875274,0.00002032648],"domain_scores_gemma":[0.99984777,0.00007316366,0.000009670022,0.000030923482,0.00002931752,0.000009099302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033001992,0.0012841388,0.0008645785,0.00042081164,0.0001807835,0.0010544207,0.0014751997,0.0012981032,0.0051483717],"category_scores_gemma":[0.00091924274,0.0007153507,0.0006339399,0.00054269395,0.00023197841,0.0014054384,0.00072005566,0.0010139714,0.0023282976],"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.00032339178,0.00012602156,0.0025590912,0.00022575566,0.00023514804,0.00019778311,0.00005069197,0.15253042,0.012544033,0.0036432892,0.050292294,0.7772722],"study_design_scores_gemma":[0.000018199195,0.000038356633,0.0016844303,0.000029519171,0.000037179292,0.00008193735,0.000022165945,0.97370243,0.0068652597,0.0047557713,0.012742758,0.000022038274],"about_ca_topic_score_codex":0.014743673,"about_ca_topic_score_gemma":0.028979471,"teacher_disagreement_score":0.014743673,"about_ca_system_score_codex":0.00036877574,"about_ca_system_score_gemma":0.00041713263,"threshold_uncertainty_score":0.02931571},"labels":[],"label_agreement":null},{"id":"W2946378017","doi":"10.1007/978-3-030-18305-9_16","title":"Identifying Misaligned Spans in Parallel Corpora Using Change Point Detection","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Parallel corpora; Machine translation; Artificial intelligence; Change detection; Identification (biology); Point (geometry); Natural language processing; Translation (biology); Quality (philosophy); German; Speech recognition; Linguistics","score_opus":0.04631436178743084,"score_gpt":0.2887615899639254,"score_spread":0.24244722817649458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946378017","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.30359,0.006108159,0.63958234,0.0007439799,0.0015951936,0.00045998587,0.012642536,0.02253887,0.012739017],"genre_scores_gemma":[0.46932912,0.0021168087,0.47177002,0.00024327343,0.0006893263,0.0005210665,0.04223698,0.0032470413,0.009846328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661714,0.00050675625,0.00033831358,0.0014705337,0.0008642337,0.00020306453],"domain_scores_gemma":[0.99217635,0.0031173944,0.00081289065,0.0016744985,0.0020203183,0.00019857408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445788,0.001413729,0.0012910499,0.0049468847,0.0013887944,0.0025598006,0.0015325046,0.0017899437,0.00516665],"category_scores_gemma":[0.009459597,0.000921885,0.0008538305,0.0076848506,0.0007698628,0.004229848,0.002295698,0.0017441806,0.0064761057],"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.001339386,0.0003701081,0.012635335,0.001239795,0.00029427133,0.0020982225,0.0013704315,0.01070247,0.13158982,0.005211669,0.0272516,0.80589694],"study_design_scores_gemma":[0.00025937357,0.0012292147,0.07444388,0.0004157145,0.00093846035,0.0072196787,0.0032486524,0.5257438,0.19608001,0.037925154,0.15214433,0.0003517389],"about_ca_topic_score_codex":0.002554127,"about_ca_topic_score_gemma":0.0040473486,"teacher_disagreement_score":0.00516665,"about_ca_system_score_codex":0.0005154624,"about_ca_system_score_gemma":0.00095384795,"threshold_uncertainty_score":0.017284155},"labels":[],"label_agreement":null},{"id":"W2946498291","doi":"10.1007/978-3-030-20528-7_19","title":"telingo = ASP + Time","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Simon Fraser University","funders":"","keywords":"Temporal logic; Computer science; Linear temporal logic; Programming language; Interface (matter); Interval temporal logic; Temporal logic of actions; Variety (cybernetics); Computation tree logic; Theoretical computer science; Extension (predicate logic); Grammar; Syntax; Algorithm; Artificial intelligence","score_opus":0.016820330812433046,"score_gpt":0.2324637266881218,"score_spread":0.21564339587568876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946498291","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054350635,0.0011035905,0.35835,0.002156928,0.0017241731,0.00021617372,0.054628458,0.14737217,0.4290135],"genre_scores_gemma":[0.08864203,0.0046886182,0.23766166,0.0020050495,0.0008749107,0.0007542877,0.09262624,0.14581198,0.4269352],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959236,0.000046147314,0.000040698807,0.0001267581,0.00013005918,0.00006395681],"domain_scores_gemma":[0.99959284,0.000120415076,0.000026897076,0.00013269846,0.00008097194,0.00004612626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040897654,0.0014983296,0.00084660406,0.0012513733,0.0006552884,0.0033562896,0.0014803305,0.00076770014,0.2125576],"category_scores_gemma":[0.0012699087,0.00072664156,0.001127553,0.0019358947,0.000814483,0.008865889,0.0019535748,0.0021966854,0.09813734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053655147,0.000064700434,0.0003464223,0.001018154,0.000033973665,0.00016576062,0.00022467507,0.0017481584,0.004161888,0.30726653,0.4511842,0.23324901],"study_design_scores_gemma":[0.00006067012,0.000017163331,0.00011022902,0.00006792503,0.000017128828,0.00015615227,0.00003832925,0.0018638006,0.0031668094,0.06769247,0.9267852,0.000024127155],"about_ca_topic_score_codex":0.0026444206,"about_ca_topic_score_gemma":0.0025835189,"teacher_disagreement_score":0.2125576,"about_ca_system_score_codex":0.0011193303,"about_ca_system_score_gemma":0.00074096693,"threshold_uncertainty_score":0.711076},"labels":[],"label_agreement":null},{"id":"W2946521116","doi":"10.1007/978-3-030-18305-9_27","title":"Inter and Intra Document Attention for Depression Risk Assessment","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","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":"Université du Québec à Montréal","funders":"","keywords":"Focus (optics); Computer science; Depression (economics); Mechanism (biology); Social media; Sequence (biology); Artificial intelligence; Information retrieval; Data science; World Wide Web","score_opus":0.02570931377625521,"score_gpt":0.3942537847830304,"score_spread":0.36854447100677523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946521116","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.77826965,0.0077010454,0.17127931,0.0011278301,0.0014556812,0.0011424617,0.006205663,0.0029031942,0.02991519],"genre_scores_gemma":[0.932913,0.000907843,0.05438026,0.00017955151,0.0005288795,0.0003844698,0.001575782,0.00019911081,0.0089311255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978502,0.00086210953,0.00019411776,0.00040079083,0.00052271184,0.00017015118],"domain_scores_gemma":[0.9782528,0.015020316,0.0010824145,0.0016711082,0.0033368135,0.00063653116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039250692,0.0006737001,0.0009055406,0.003271048,0.0004995222,0.0017580037,0.00059224607,0.0010891893,0.0113648],"category_scores_gemma":[0.026315665,0.00028219115,0.000655177,0.0016571364,0.00022121318,0.001035036,0.0010425781,0.00078405865,0.0023592713],"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.00587791,0.00058767275,0.079538934,0.00039941815,0.0004039809,0.00021146172,0.0003682133,0.0019045027,0.015792392,0.00058516953,0.006398954,0.88793135],"study_design_scores_gemma":[0.0006808388,0.004278778,0.7440017,0.00041498063,0.0025106617,0.003012188,0.0017044183,0.16713712,0.05074827,0.011486626,0.013756961,0.00026746825],"about_ca_topic_score_codex":0.0016112768,"about_ca_topic_score_gemma":0.0027939675,"teacher_disagreement_score":0.0113648,"about_ca_system_score_codex":0.00028617773,"about_ca_system_score_gemma":0.00048001437,"threshold_uncertainty_score":0.038019},"labels":[],"label_agreement":null},{"id":"W2946535497","doi":"10.1007/978-3-030-18305-9_53","title":"Genome-Wide Canonical Correlation Analysis-Based Computational Methods for Mining Information from Microbiome and Gene Expression Data","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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 Manitoba","funders":"","keywords":"Interpretability; Canonical correlation; Computer science; Correlation; Data mining; Cluster analysis; Microbiome; Artificial intelligence; Computational biology; Machine learning; Pattern recognition (psychology); Bioinformatics; Biology; Mathematics","score_opus":0.01674436808504555,"score_gpt":0.2828926992034655,"score_spread":0.26614833111841996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946535497","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.010308459,0.0016842603,0.9800142,0.000270329,0.0001294497,0.000108830594,0.0021618423,0.0041709323,0.0011516862],"genre_scores_gemma":[0.054530807,0.0011223471,0.934844,0.00018702395,0.00010917201,0.00049590477,0.006274467,0.0005375354,0.0018987578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989635,0.0003636649,0.00007513107,0.00022831195,0.00031682203,0.00005262505],"domain_scores_gemma":[0.99729735,0.0019230228,0.00010686996,0.00023829758,0.00036708356,0.00006738403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023769385,0.0014067341,0.0015822297,0.0025025583,0.00070412207,0.0017729282,0.0020722225,0.00064110104,0.0038114602],"category_scores_gemma":[0.0064687403,0.00065535365,0.0025233906,0.0047890544,0.00057462405,0.0009586712,0.0014529485,0.0021392838,0.0019135162],"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.00033981173,0.00039377218,0.00940246,0.0010050118,0.0019760344,0.00030914225,0.00019567732,0.1488613,0.013445705,0.023252305,0.03144659,0.7693722],"study_design_scores_gemma":[0.00003415956,0.000053776257,0.0027627966,0.000036325677,0.00014069703,0.000170147,0.000045260233,0.9694372,0.0032871566,0.018106157,0.005877043,0.000049357],"about_ca_topic_score_codex":0.00648839,"about_ca_topic_score_gemma":0.015593261,"teacher_disagreement_score":0.00648839,"about_ca_system_score_codex":0.0006593145,"about_ca_system_score_gemma":0.001825723,"threshold_uncertainty_score":0.012901247},"labels":[],"label_agreement":null},{"id":"W2946578147","doi":"10.1007/978-3-030-20912-4_59","title":"Analysis of Large Scale Power Systems via LASSO Learning Algorithms","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power System Optimization and Stability","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 Manitoba","funders":"","keywords":"Computer science; Lasso (programming language); Electric power system; Algorithm; Feature selection; Boundary (topology); Machine learning; Stability (learning theory); Artificial intelligence; Scale (ratio); Power (physics); Mathematics","score_opus":0.0065673819156473745,"score_gpt":0.21688804288741872,"score_spread":0.21032066097177135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946578147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051966943,0.00048188443,0.991844,0.00025522345,0.000032191852,0.000018262392,0.0001225827,0.00037988674,0.001669164],"genre_scores_gemma":[0.7183538,0.0021798136,0.26363876,0.00030010406,0.0005413208,0.00039564542,0.0012821369,0.0006205179,0.012687892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.00019620874,0.000022328204,0.00009875756,0.000121475736,0.000035411584],"domain_scores_gemma":[0.9977569,0.0017457068,0.00017952001,0.00013453532,0.00014929115,0.00003414587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098356,0.0012749041,0.0011061882,0.00045875917,0.00029340386,0.0011925993,0.00083544006,0.00073532964,0.0031896604],"category_scores_gemma":[0.0045360974,0.0006014027,0.00069325324,0.0007640233,0.00068779907,0.0012871773,0.0009884952,0.001838583,0.0006045613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000252865,0.000027395827,0.0002851402,0.000096431744,0.00006194558,0.00004466025,0.000023077102,0.946869,0.0009201389,0.010493159,0.00259812,0.038555607],"study_design_scores_gemma":[0.0000011310199,0.0000033410681,0.000056326946,0.000002125254,0.0000018849728,0.0000039859915,0.000001593306,0.9947094,0.000057646263,0.0050322716,0.00012884947,0.0000014345014],"about_ca_topic_score_codex":0.0024886664,"about_ca_topic_score_gemma":0.0024734559,"teacher_disagreement_score":0.0031896604,"about_ca_system_score_codex":0.00045870934,"about_ca_system_score_gemma":0.00047552216,"threshold_uncertainty_score":0.0106704235},"labels":[],"label_agreement":null},{"id":"W2946585360","doi":"10.1007/978-3-030-18305-9_47","title":"Detecting Depression from Voice","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":45,"is_retracted":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":"Anticipation (artificial intelligence); Benchmark (surveying); Task (project management); Computer science; Depression (economics); Machine learning; Artificial intelligence; Speech recognition; Engineering; Cartography; Geography","score_opus":0.029135563398331968,"score_gpt":0.2918526594166329,"score_spread":0.26271709601830096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946585360","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.581558,0.024672547,0.29609445,0.0011220576,0.0024255244,0.00064504927,0.012054479,0.0044753607,0.07695243],"genre_scores_gemma":[0.81616503,0.0081967935,0.110911965,0.00072041445,0.001036838,0.00032945914,0.008825525,0.00027323127,0.053540796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998406,0.000021428374,0.000009009485,0.000043975968,0.00005484968,0.000030086345],"domain_scores_gemma":[0.9998647,0.000059694787,0.000010191247,0.000012808936,0.000038715178,0.000013805046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021932033,0.0005784541,0.00047515763,0.0007766193,0.00016993251,0.0006063663,0.0003618449,0.00066433527,0.005583572],"category_scores_gemma":[0.0005580058,0.00013963447,0.00038199828,0.00044428973,0.000094454415,0.00029378568,0.0004211208,0.00026408798,0.00617373],"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.00049043086,0.00007696787,0.012020062,0.00020661314,0.00007758374,0.00038560055,0.00006616272,0.00051034545,0.18212575,0.00022295852,0.0074761063,0.7963415],"study_design_scores_gemma":[0.00019873127,0.002028133,0.41212067,0.0004610706,0.0011242365,0.018317502,0.0011183514,0.095163316,0.3888279,0.004385815,0.07604579,0.00020857039],"about_ca_topic_score_codex":0.00051335694,"about_ca_topic_score_gemma":0.0011519388,"teacher_disagreement_score":0.005583572,"about_ca_system_score_codex":0.00009167242,"about_ca_system_score_gemma":0.00007529781,"threshold_uncertainty_score":0.018678963},"labels":[],"label_agreement":null},{"id":"W2946633185","doi":"10.1007/978-3-030-18305-9_64","title":"Event Prediction in Social Graphs Using 1-Dimensional Convolutional Neural Network","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Windsor","funders":"","keywords":"Computer science; Convolutional neural network; Event (particle physics); Artificial intelligence; Artificial neural network; Astrophysics","score_opus":0.017170540215327452,"score_gpt":0.26134238051139025,"score_spread":0.2441718402960628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946633185","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.41326,0.0035279372,0.56945413,0.0014750905,0.00032060684,0.000116065516,0.0036474578,0.002684992,0.005513675],"genre_scores_gemma":[0.96151644,0.00077014335,0.02984489,0.000101367485,0.00017866275,0.00004284546,0.0030272915,0.000049160055,0.0044691577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.00003933984,0.000012998054,0.00007963381,0.000031182168,0.0000506965],"domain_scores_gemma":[0.99902964,0.00066530606,0.000095553776,0.00006699016,0.0000937706,0.000048858674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835813,0.00082072784,0.0006498809,0.0014810129,0.00033351334,0.0006733176,0.0008631176,0.0008195255,0.0013870919],"category_scores_gemma":[0.0021102661,0.0003719802,0.0007015494,0.001168527,0.00026595782,0.0012826163,0.0006020198,0.0010690392,0.0005923711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061056344,0.00054201495,0.024549637,0.00020705278,0.00029883606,0.0003230624,0.000116958494,0.62518066,0.003909106,0.00948446,0.013053522,0.32172412],"study_design_scores_gemma":[0.000001832721,0.0000065093627,0.00068108295,0.0000033035885,0.0000071037102,0.000006680806,0.0000038292637,0.99705696,0.00018165902,0.0019208292,0.00012816755,0.0000020439923],"about_ca_topic_score_codex":0.018185942,"about_ca_topic_score_gemma":0.024475092,"teacher_disagreement_score":0.018185942,"about_ca_system_score_codex":0.0008925412,"about_ca_system_score_gemma":0.00039089983,"threshold_uncertainty_score":0.03616017},"labels":[],"label_agreement":null},{"id":"W2946675038","doi":"10.1007/978-3-030-27202-9_17","title":"Tracking in Urban Traffic Scenes from Background Subtraction and Object Detection","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Polytechnique Montréal","funders":"","keywords":"Background subtraction; Artificial intelligence; Computer science; Computer vision; Object detection; Trajectory; Tracking (education); Object (grammar); Video tracking; Task (project management); Subtraction; Detector; Class (philosophy); Pattern recognition (psychology); Pixel; Mathematics; Engineering; Psychology","score_opus":0.032952239799302396,"score_gpt":0.3023294807574394,"score_spread":0.269377240958137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946675038","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.34817505,0.0007445804,0.6436324,0.000098322445,0.00012573496,0.00008063386,0.0003210115,0.0028312546,0.0039909803],"genre_scores_gemma":[0.78699476,0.0005872012,0.20607397,0.000074806056,0.000074661024,0.00003656383,0.0011762256,0.00023138867,0.0047504166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996307,0.00003671954,0.000009632196,0.00011615562,0.000106765074,0.00010003714],"domain_scores_gemma":[0.99975616,0.000063828775,0.000022949629,0.00003386609,0.0000932967,0.00002985077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006163621,0.0007234294,0.0009754916,0.0017670197,0.0003968261,0.0010012339,0.0007403504,0.00071973976,0.0010451901],"category_scores_gemma":[0.00073555775,0.0005386817,0.00046959336,0.0017577702,0.0002863704,0.0005165061,0.0005568564,0.0004572414,0.0008278251],"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.0011420549,0.00035042528,0.011191296,0.00019954811,0.00021060265,0.0002812585,0.00017033373,0.076568685,0.17735706,0.0016067809,0.0024207379,0.7285012],"study_design_scores_gemma":[0.000031212327,0.00017261556,0.021143258,0.000013460021,0.00010567346,0.00034367715,0.00008590421,0.9294062,0.045132097,0.0013553848,0.0021882858,0.000022246557],"about_ca_topic_score_codex":0.0052057123,"about_ca_topic_score_gemma":0.008780205,"teacher_disagreement_score":0.0052057123,"about_ca_system_score_codex":0.00036533218,"about_ca_system_score_gemma":0.0005617464,"threshold_uncertainty_score":0.010350823},"labels":[],"label_agreement":null},{"id":"W2946704866","doi":"10.1007/978-3-030-30473-7_4","title":"Mechanism Design for Locating a Facility Under Partial Information","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mechanism design; Computer science; Minimax; Mechanism (biology); Dominance (genetics); Preference; Mathematical optimization; Real line; Mathematical economics; Mathematics","score_opus":0.11354351648880745,"score_gpt":0.3669446271061308,"score_spread":0.25340111061732334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946704866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020113016,0.0001747324,0.9754287,0.0004659853,0.000050474908,0.00031681557,0.00014323535,0.00024905519,0.0030579302],"genre_scores_gemma":[0.6199292,0.0004235497,0.3713645,0.00023006737,0.0001737179,0.0012141031,0.0002640329,0.00010013944,0.0063006757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99044585,0.005111849,0.0005908508,0.0015534714,0.0013069288,0.0009911245],"domain_scores_gemma":[0.9797498,0.012746443,0.002175809,0.0028325038,0.0013224968,0.0011729965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012349487,0.0017927071,0.0047404463,0.002214934,0.0014447613,0.0050159763,0.00819472,0.005720087,0.008287949],"category_scores_gemma":[0.028812049,0.0025628777,0.0022213578,0.0030525243,0.0035101653,0.009015997,0.005223869,0.0029243547,0.0012099561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019336303,0.0005455647,0.001327841,0.001134231,0.00036769922,0.0002925379,0.00041660518,0.4343991,0.005128736,0.46892706,0.005107197,0.08041973],"study_design_scores_gemma":[0.0005795685,0.00054235745,0.00019928947,0.00006291277,0.00015354014,0.00021429837,0.00007273766,0.7469987,0.00142319,0.248025,0.0016675168,0.000060842493],"about_ca_topic_score_codex":0.000692748,"about_ca_topic_score_gemma":0.0005483666,"teacher_disagreement_score":0.012349487,"about_ca_system_score_codex":0.0027642525,"about_ca_system_score_gemma":0.0031345543,"threshold_uncertainty_score":0.065311134},"labels":[],"label_agreement":null},{"id":"W2946766242","doi":"10.1007/978-3-030-20528-7_1","title":"Train Scheduling with Hybrid ASP","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Distributed computing; Heuristic; Mathematical optimization; Routing (electronic design automation); Artificial intelligence; Computer network; Mathematics","score_opus":0.012900123854158124,"score_gpt":0.2161489753149396,"score_spread":0.20324885146078148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946766242","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.029808361,0.00036112568,0.93210554,0.00021986949,0.00019012047,0.00013433842,0.00046232532,0.003881475,0.032836758],"genre_scores_gemma":[0.6461769,0.00028742323,0.33342502,0.0001216892,0.000099445686,0.00016186641,0.00087226206,0.0004054083,0.018450052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956983,0.000106473264,0.000027372722,0.000094408475,0.00011155473,0.000090305315],"domain_scores_gemma":[0.9996031,0.00014506998,0.000028235967,0.00009481982,0.00007758826,0.00005118674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067200564,0.0007312793,0.001023199,0.0006620823,0.0006209432,0.0018524333,0.0015730971,0.00070140697,0.009138047],"category_scores_gemma":[0.0010032175,0.00046199808,0.0007179959,0.001095092,0.00039855737,0.0012102356,0.0014578021,0.0010048279,0.0015344439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041763816,0.00020454077,0.00047540467,0.00007891866,0.000056081542,0.000084718165,0.00002851778,0.8431646,0.0022296552,0.02137895,0.005440163,0.12644076],"study_design_scores_gemma":[0.000019391497,0.000029327712,0.00006932273,0.000003419618,0.000008602478,0.000017123219,0.00000868092,0.9895,0.00071979366,0.0073524895,0.0022676655,0.000004208116],"about_ca_topic_score_codex":0.0067257853,"about_ca_topic_score_gemma":0.0063859327,"teacher_disagreement_score":0.009138047,"about_ca_system_score_codex":0.00080299436,"about_ca_system_score_gemma":0.0012975595,"threshold_uncertainty_score":0.030569792},"labels":[],"label_agreement":null},{"id":"W2946767906","doi":"10.1007/978-3-030-19212-9_33","title":"Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Metric (unit); Computer science; Nonlinear system; Leverage (statistics); Solver; Nonlinear programming; Artificial intelligence; Mathematics","score_opus":0.022457740780019882,"score_gpt":0.24290758183309846,"score_spread":0.22044984105307858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946767906","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.008167808,0.00021181631,0.9863197,0.00003948886,0.000019003457,0.00004118074,0.00007954543,0.00033716703,0.004784237],"genre_scores_gemma":[0.33140028,0.00026974344,0.663016,0.000035622757,0.000017531585,0.00015463641,0.00024957635,0.00017308617,0.0046834857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993943,0.00016332946,0.00003866992,0.00013363833,0.00021414735,0.00005591036],"domain_scores_gemma":[0.9992386,0.0004733366,0.00005529265,0.000096346324,0.00010475814,0.00003171141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089545565,0.00094143033,0.0010832533,0.0009071887,0.00045456024,0.0008981627,0.001516797,0.00082257844,0.0048279343],"category_scores_gemma":[0.002221841,0.0006613044,0.0007733853,0.0017299553,0.0010745637,0.0017933513,0.0015781298,0.00092896,0.0004294585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008160726,0.000025701871,0.00013274557,0.00011729377,0.000028278422,0.00007238799,0.000057556088,0.86865777,0.0016119416,0.041699275,0.0010438171,0.086471654],"study_design_scores_gemma":[0.000007583267,0.00003623067,0.00003856305,0.000009699424,0.000005749766,0.00002445652,0.000009115024,0.9757798,0.00069023453,0.022221463,0.0011696682,0.000007343095],"about_ca_topic_score_codex":0.008738008,"about_ca_topic_score_gemma":0.009608962,"teacher_disagreement_score":0.008738008,"about_ca_system_score_codex":0.0011416222,"about_ca_system_score_gemma":0.0009825254,"threshold_uncertainty_score":0.017374277},"labels":[],"label_agreement":null},{"id":"W2946812972","doi":"10.1007/978-3-030-18305-9_30","title":"Towards Causal Analysis of Protocol Violations","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Protocol (science); Formal methods; Theoretical computer science; Pi calculus; Formal description; Distributed computing; Software engineering; Programming language","score_opus":0.033227533398187827,"score_gpt":0.32670350434002376,"score_spread":0.2934759709418359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946812972","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.0031891747,0.00014207265,0.9894238,0.0004441827,0.000066502376,0.00014543835,0.00017453433,0.0011708958,0.005243371],"genre_scores_gemma":[0.35548887,0.0009926831,0.6296609,0.0005505641,0.00033697337,0.00070465927,0.0010793445,0.0011293514,0.01005666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867475,0.006287207,0.00070874393,0.0015271852,0.003881042,0.00084829744],"domain_scores_gemma":[0.9256959,0.05415237,0.003762869,0.010261098,0.005375967,0.0007517378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102885775,0.0015961706,0.001326808,0.0054318667,0.0018649048,0.00550396,0.0037723728,0.0024304169,0.014150218],"category_scores_gemma":[0.058143876,0.001782803,0.0030931497,0.0031704681,0.0047526415,0.00878546,0.0054585235,0.007006257,0.0022022203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014723916,0.00014461704,0.0017077657,0.00037616558,0.0001138004,0.00023948695,0.00065310235,0.043351162,0.0023667212,0.87537193,0.004676548,0.0708515],"study_design_scores_gemma":[0.000025871614,0.000025195242,0.0002655996,0.00009298112,0.000070521644,0.00007782686,0.00012269542,0.22529231,0.0028604115,0.7661451,0.0049941493,0.000027376445],"about_ca_topic_score_codex":0.0034349654,"about_ca_topic_score_gemma":0.00374541,"teacher_disagreement_score":0.014150218,"about_ca_system_score_codex":0.002544535,"about_ca_system_score_gemma":0.004724663,"threshold_uncertainty_score":0.054411888},"labels":[],"label_agreement":null},{"id":"W2946862285","doi":"10.1007/978-3-030-21949-9_6","title":"A Numerical Method for the Optimal Adjustment of Parameters in Ionic Models Accounting for Restitution Properties","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ion-surface interactions and analysis","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 Toronto; Sunnybrook Health Science Centre; University of Ottawa","funders":"","keywords":"Restitution; Computer science; Numerical analysis; Applied mathematics; Accounting; Mathematics; Mathematical analysis; Law; Economics","score_opus":0.030535500485774893,"score_gpt":0.26587699613454985,"score_spread":0.23534149564877496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946862285","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.001482583,0.000121500336,0.99623066,0.000062127,0.00009548519,0.00004073013,0.000034849327,0.00018801514,0.0017441222],"genre_scores_gemma":[0.04399202,0.00022297418,0.94919795,0.00011992177,0.00008224876,0.00039559885,0.00009386547,0.00047763315,0.0054176683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997271,0.00010501756,0.00002056194,0.00003915278,0.00008504062,0.000023062214],"domain_scores_gemma":[0.9988667,0.0007853345,0.00006063044,0.0000898358,0.00015797545,0.00003959705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014387113,0.00096899236,0.0010916111,0.0007449378,0.0007486484,0.0009080583,0.0020224324,0.0023448842,0.0058752955],"category_scores_gemma":[0.004306931,0.0006856063,0.0010919273,0.00078693934,0.0010361484,0.0011252782,0.0016068758,0.0023129508,0.0012545197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014823824,0.00020076994,0.00045750692,0.0003078026,0.000082416256,0.0001959557,0.00017716213,0.70603096,0.012676273,0.12795003,0.006230751,0.14554217],"study_design_scores_gemma":[0.000011232368,0.00001145489,0.00002668055,0.000009992734,0.0000055402425,0.00001868308,0.000005764249,0.99001896,0.00045113155,0.007908616,0.0015233337,0.000008659743],"about_ca_topic_score_codex":0.0039615324,"about_ca_topic_score_gemma":0.004767768,"teacher_disagreement_score":0.0058752955,"about_ca_system_score_codex":0.0007192307,"about_ca_system_score_gemma":0.0013529692,"threshold_uncertainty_score":0.01965481},"labels":[],"label_agreement":null},{"id":"W2946862513","doi":"10.1007/978-3-030-21949-9_8","title":"Pipeline to Build and Test Robust 3D T1 Mapping-Based Heart Models for EP Interventions: Preliminary Results","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","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":"Sunnybrook Hospital; University of Toronto","funders":"","keywords":"Computer science; Cardiac electrophysiology; Artificial intelligence; Algorithm; Medicine; Internal medicine","score_opus":0.031232896000321638,"score_gpt":0.2782383858455198,"score_spread":0.24700548984519816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946862513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059550658,0.0010305018,0.8309248,0.0004365217,0.0005287837,0.0008315688,0.0076698978,0.09497086,0.004056368],"genre_scores_gemma":[0.24402508,0.0004676706,0.72263926,0.0005101403,0.00007773709,0.00082132063,0.020972423,0.0037797815,0.0067066173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932027,0.000108279404,0.000041834344,0.00024291412,0.00021815296,0.000068599846],"domain_scores_gemma":[0.9989385,0.00041827955,0.000048851984,0.00026022716,0.00025769972,0.00007649344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910633,0.002263705,0.0011179604,0.00079511333,0.0003986761,0.0015550436,0.0026926794,0.0017079521,0.014138043],"category_scores_gemma":[0.0035770668,0.0007258651,0.0017070237,0.0005347252,0.00030556385,0.0008582911,0.0013399891,0.0015607383,0.009532875],"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.001947673,0.0008410578,0.0057857833,0.0007329141,0.0007684137,0.00061533606,0.00017938878,0.18467386,0.049499452,0.002067571,0.04803767,0.70485085],"study_design_scores_gemma":[0.00031763804,0.00047530892,0.0026269548,0.000060977312,0.00018134339,0.00048111673,0.000074068084,0.9425889,0.03850986,0.0030298904,0.011572649,0.00008122307],"about_ca_topic_score_codex":0.011428048,"about_ca_topic_score_gemma":0.008880324,"teacher_disagreement_score":0.014138043,"about_ca_system_score_codex":0.0005671722,"about_ca_system_score_gemma":0.0016979842,"threshold_uncertainty_score":0.047296464},"labels":[],"label_agreement":null},{"id":"W2947130496","doi":"10.1007/978-3-030-27272-2_13","title":"A Compact Representation of Histopathology Images Using Digital Stain Separation and Frequency-Based Encoded Local Projections","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pattern recognition (psychology); Digital pathology; Histogram; Grayscale; Digital image; Representation (politics); Subpixel rendering; Histopathology; Computation","score_opus":0.023925576894095447,"score_gpt":0.296501023215198,"score_spread":0.27257544632110253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947130496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006987484,0.00044764034,0.98937315,0.00015047626,0.0000725123,0.000037484773,0.0005080309,0.0008734271,0.0015497754],"genre_scores_gemma":[0.06720598,0.0018065368,0.9226462,0.000097707125,0.0001240518,0.00009520974,0.0014989726,0.0002979403,0.0062272907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989617,0.000013847822,0.000009856636,0.000015361067,0.000053760185,0.0000110185665],"domain_scores_gemma":[0.99967897,0.00009214726,0.000035819252,0.00007827345,0.00009748129,0.000017327866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021285813,0.00060029887,0.00036864236,0.0013855288,0.00016401052,0.0015173972,0.00063359656,0.0005601048,0.007229549],"category_scores_gemma":[0.00079499057,0.00032999663,0.00046323508,0.0015347025,0.00022431667,0.001220165,0.00075807597,0.0006022069,0.0026974522],"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.00034203753,0.000084672414,0.00030792906,0.00042880705,0.0000347308,0.0004604532,0.00011663295,0.03149352,0.20416689,0.015963351,0.008010247,0.7385909],"study_design_scores_gemma":[0.0000621461,0.00030089487,0.0027107813,0.00016136498,0.000121251614,0.00398091,0.0002110447,0.78241384,0.13474959,0.02205822,0.053117774,0.0001122083],"about_ca_topic_score_codex":0.0005560221,"about_ca_topic_score_gemma":0.00077341177,"teacher_disagreement_score":0.007229549,"about_ca_system_score_codex":0.00020052026,"about_ca_system_score_gemma":0.00038462377,"threshold_uncertainty_score":0.02418518},"labels":[],"label_agreement":null},{"id":"W2947149071","doi":"10.1007/978-3-030-23696-0_14","title":"On MILP-Based Automatic Search for Differential Trails Through Modular Additions with Application to Bel-T","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Modular design; Differential (mechanical device); Algorithm; Integer (computer science); Cipher; Lookup table; Parallel computing; Arithmetic; Mathematics; Cryptography; Encryption; Programming language; Computer network","score_opus":0.01989023891447446,"score_gpt":0.2835753954137794,"score_spread":0.26368515649930496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947149071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074037453,0.00014519293,0.9824997,0.00007320476,0.00010638032,0.00006610182,0.00006832915,0.001843212,0.0077942116],"genre_scores_gemma":[0.15867344,0.0002115983,0.8301545,0.00014145972,0.00008705354,0.00012765605,0.00035730228,0.00058953476,0.009657471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992786,0.0001557476,0.000055175977,0.0001164424,0.00030306962,0.00009107389],"domain_scores_gemma":[0.9989467,0.00055759714,0.000057175697,0.00020813738,0.00018632226,0.000044002154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000855409,0.0010445835,0.0012320393,0.0014935582,0.00089083595,0.0018712326,0.0015228435,0.00089699443,0.014342335],"category_scores_gemma":[0.0033620927,0.00051175983,0.0010058791,0.0014861815,0.0012234306,0.002322179,0.0024708947,0.0017259725,0.003814389],"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.00047129308,0.00022734694,0.00042432884,0.00040155975,0.00006362675,0.00024761187,0.00023266087,0.10824735,0.020244405,0.25758585,0.012632421,0.59922147],"study_design_scores_gemma":[0.000043429292,0.000106073065,0.000101358964,0.000050340535,0.000021719421,0.00016010705,0.000051955954,0.83508044,0.010820871,0.1461377,0.007390426,0.000035547884],"about_ca_topic_score_codex":0.0009811064,"about_ca_topic_score_gemma":0.001406929,"teacher_disagreement_score":0.014342335,"about_ca_system_score_codex":0.00061470567,"about_ca_system_score_gemma":0.00081718375,"threshold_uncertainty_score":0.04797989},"labels":[],"label_agreement":null},{"id":"W2947300383","doi":"10.1007/978-3-030-21290-2_10","title":"Towards an Ontology-Based Approach for Eliciting Possible Solutions to Non-Functional Requirements","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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":"York University","funders":"","keywords":"Computer science; Non-functional requirement; Software engineering; Functional requirement; Software requirements; Quality (philosophy); Process (computing); Ontology; Set (abstract data type); Software quality; Requirements engineering; Software requirements specification; Software development; Reuse; Requirements elicitation; Software; Software design; Software construction; Programming language; Engineering","score_opus":0.05678741140596566,"score_gpt":0.2985624796891626,"score_spread":0.24177506828319695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947300383","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.0035921447,0.00016741027,0.98825127,0.000770085,0.00002998485,0.00047531148,0.0003587239,0.0004047762,0.005950288],"genre_scores_gemma":[0.018547945,0.00020788447,0.9781868,0.00012820307,0.000010392716,0.00034052544,0.00084498886,0.00006683395,0.0016664075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99051917,0.0036375376,0.0010710752,0.0008284699,0.003654255,0.00028937944],"domain_scores_gemma":[0.99073786,0.0055484315,0.0005669226,0.000986107,0.0018707473,0.0002899821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00732644,0.0017032624,0.0011319607,0.006484345,0.0019422531,0.0069945324,0.0040397597,0.0029416657,0.0050297333],"category_scores_gemma":[0.017224945,0.0015760792,0.0039189463,0.0043641077,0.0021820778,0.0071647284,0.005921628,0.0039050921,0.0018170209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015981586,0.00073723396,0.0024352132,0.0022667402,0.00040171095,0.0015387491,0.010460557,0.036793284,0.025402416,0.47097272,0.011129679,0.437702],"study_design_scores_gemma":[0.00014275814,0.00016863176,0.0019125765,0.0014392653,0.0003584322,0.0014515079,0.00789822,0.35265395,0.017253274,0.49364522,0.12287777,0.00019829771],"about_ca_topic_score_codex":0.008284219,"about_ca_topic_score_gemma":0.019654818,"teacher_disagreement_score":0.008284219,"about_ca_system_score_codex":0.0029606055,"about_ca_system_score_gemma":0.006310288,"threshold_uncertainty_score":0.038746357},"labels":[],"label_agreement":null},{"id":"W2947785270","doi":"10.1007/978-3-030-20915-5_17","title":"Generalizations of Aggregation Functions for Face Recognition","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Facial recognition system; Voting; Face (sociological concept); Task (project management); Artificial intelligence; Machine learning; Pattern recognition (psychology); Theoretical computer science","score_opus":0.030692061145377363,"score_gpt":0.25119137338744174,"score_spread":0.22049931224206437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947785270","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.010265762,0.0015271554,0.9760542,0.00021211088,0.00021923841,0.000038206606,0.00017233234,0.00081132806,0.010699715],"genre_scores_gemma":[0.2607486,0.00414927,0.6976299,0.00050674455,0.0010456506,0.00022967411,0.0010296303,0.0008334846,0.033826977],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999315,0.00017373779,0.00005560306,0.00016619902,0.00020832018,0.000081006205],"domain_scores_gemma":[0.9986987,0.00046880764,0.00006711457,0.00047069055,0.00022921847,0.0000654242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012868041,0.0009702986,0.0012409018,0.0013314297,0.00065242406,0.0016210127,0.0013464681,0.00081010046,0.0042953156],"category_scores_gemma":[0.0035120908,0.00037641462,0.0016537816,0.0018792428,0.0006944336,0.0025455942,0.0015779841,0.0021523251,0.001739886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010769661,0.00011718094,0.00089748803,0.00017673995,0.0000739022,0.00016568226,0.00020871231,0.025567135,0.01100667,0.4696358,0.018124333,0.47391874],"study_design_scores_gemma":[0.000012555901,0.00004580768,0.0010484093,0.00003562338,0.00004416825,0.00040603508,0.0000597728,0.32346016,0.004820358,0.6426106,0.027429024,0.000027530788],"about_ca_topic_score_codex":0.0017898781,"about_ca_topic_score_gemma":0.0017095382,"teacher_disagreement_score":0.0042953156,"about_ca_system_score_codex":0.0007437546,"about_ca_system_score_gemma":0.00043351867,"threshold_uncertainty_score":0.014369249},"labels":[],"label_agreement":null},{"id":"W2948151767","doi":"10.1007/978-3-030-22815-6_9","title":"Local Search for Attribute Reduction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"McMaster University","funders":"","keywords":"Reduct; Rough set; Reduction (mathematics); Computer science; Selection (genetic algorithm); Iterated local search; Iterated function; Greedy algorithm; Process (computing); Algorithm; Data mining; Local search (optimization); Mathematics; Artificial intelligence","score_opus":0.03342886791855472,"score_gpt":0.2680936619517688,"score_spread":0.2346647940332141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948151767","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.0074483934,0.0012372663,0.9849694,0.00020977775,0.00006980988,0.00005818899,0.00012862074,0.0007104877,0.0051681567],"genre_scores_gemma":[0.22538249,0.0011481118,0.7425986,0.0002934794,0.00016658173,0.00046470048,0.0009991592,0.00064525736,0.028301585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988576,0.00045666026,0.000048246024,0.0002252042,0.00031120743,0.00010100921],"domain_scores_gemma":[0.99875534,0.00076429505,0.00004723854,0.00026602347,0.00012515696,0.00004191238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015088904,0.00071980665,0.002846459,0.0016710717,0.0008930988,0.0015583045,0.0020499718,0.0012882352,0.009050473],"category_scores_gemma":[0.003915309,0.00080853223,0.0017017754,0.0030834766,0.0013260122,0.002378575,0.003101082,0.0025026537,0.0021022754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039566006,0.00021605397,0.0003854121,0.00048704306,0.00018812386,0.00010397154,0.00029711306,0.21818176,0.0049844007,0.26010454,0.021125562,0.4935304],"study_design_scores_gemma":[0.000031087973,0.000069338574,0.00015729676,0.00003742434,0.000038444323,0.00006817445,0.000042465326,0.8145459,0.0014839697,0.17859903,0.004907512,0.00001923952],"about_ca_topic_score_codex":0.002186348,"about_ca_topic_score_gemma":0.0020980071,"teacher_disagreement_score":0.009050473,"about_ca_system_score_codex":0.0011363638,"about_ca_system_score_gemma":0.0009142896,"threshold_uncertainty_score":0.030276775},"labels":[],"label_agreement":null},{"id":"W2948233389","doi":"10.1007/978-3-030-27455-9_10","title":"Revisiting Hyper-Parameter Tuning for Search-Based Test Data Generation","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Metric (unit); Replicate; Heuristic; Computer science; Baseline (sea); Software; Performance metric; Minor (academic); Space (punctuation); Machine learning; Artificial intelligence; Mathematics; Statistics; Engineering","score_opus":0.10774043282988424,"score_gpt":0.338558522507848,"score_spread":0.23081808967796377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948233389","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.03327697,0.00093073666,0.9329136,0.0005537813,0.00019545728,0.00031989545,0.00025865668,0.026773255,0.004777642],"genre_scores_gemma":[0.49184468,0.00024925297,0.49895766,0.00074492185,0.00009348462,0.0002643942,0.00059094303,0.004102329,0.0031523558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98998356,0.004217665,0.00081723265,0.0015249021,0.0027736465,0.00068298884],"domain_scores_gemma":[0.9662212,0.01949074,0.0010128261,0.009380869,0.0033461088,0.00054826617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050808038,0.0016862337,0.001728198,0.00227882,0.00073331635,0.0028920248,0.004652451,0.0021502615,0.010011042],"category_scores_gemma":[0.04016911,0.0010826241,0.0012053783,0.0015543995,0.0015181878,0.0039811446,0.0037682464,0.002721552,0.0035554627],"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.0013159324,0.0005091579,0.005792066,0.0006070493,0.0002171187,0.00035133786,0.0005603531,0.08778561,0.04274691,0.011842009,0.009841297,0.8384311],"study_design_scores_gemma":[0.00022172034,0.0003037314,0.0011644114,0.00020340596,0.00012733032,0.00034890688,0.00012956215,0.9276706,0.038852032,0.02199062,0.008911965,0.0000757022],"about_ca_topic_score_codex":0.004134506,"about_ca_topic_score_gemma":0.0051370687,"teacher_disagreement_score":0.010011042,"about_ca_system_score_codex":0.0013706407,"about_ca_system_score_gemma":0.0029356705,"threshold_uncertainty_score":0.0334903},"labels":[],"label_agreement":null},{"id":"W2948237394","doi":"10.1007/978-3-030-20518-8_71","title":"Digital Implementation of a Biological-Plausible Model for Astrocyte Ca $$^{2+}$$ Oscillations","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Field-programmable gate array; Astrocyte; Software; Nonlinear system; Computer hardware; Field (mathematics); Brain Cell; Neuron; Neuroscience; Embedded system; Physics","score_opus":0.051100874976767255,"score_gpt":0.29155345959403917,"score_spread":0.24045258461727193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948237394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060117345,0.00036080705,0.8894709,0.0014547516,0.00046811526,0.00005930477,0.0003868286,0.0013354772,0.046346404],"genre_scores_gemma":[0.9183534,0.00026632418,0.067034304,0.00023417316,0.000058029724,0.00012376854,0.00014039225,0.000083006744,0.01370656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999422,0.000011650177,0.0000035692249,0.000012871096,0.000020959524,0.000008767453],"domain_scores_gemma":[0.99990463,0.000040697392,0.0000072622765,0.00001625427,0.000020153204,0.000011038138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001385341,0.00028709596,0.00037657775,0.00017681324,0.0002981926,0.000874039,0.0012132059,0.0010543354,0.0086746905],"category_scores_gemma":[0.0004919117,0.0001532935,0.00040965533,0.00017256926,0.00040702624,0.00053521193,0.0005394984,0.00058958994,0.0007021778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021489851,0.00008741517,0.00044611318,0.00016786584,0.000055676494,0.0003641368,0.00010752844,0.79082924,0.027913628,0.14710757,0.003089851,0.029616129],"study_design_scores_gemma":[0.000020492052,0.00001675744,0.000050048806,0.00000424594,0.000007656429,0.000028526878,0.00000726639,0.98734516,0.0015550287,0.009622288,0.0013373295,0.0000051350216],"about_ca_topic_score_codex":0.0021945084,"about_ca_topic_score_gemma":0.0025990189,"teacher_disagreement_score":0.0086746905,"about_ca_system_score_codex":0.00042495,"about_ca_system_score_gemma":0.00044852955,"threshold_uncertainty_score":0.029019713},"labels":[],"label_agreement":null},{"id":"W2948312251","doi":"10.1007/978-3-030-20656-7_7","title":"Layout-Aware Embedding for Quantum Annealing Processors","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Qubit; Quantum annealing; Embedding; Simulated annealing; Quantum computer; Theoretical computer science; Quantum; Graph; Node (physics); Algorithm; Artificial intelligence","score_opus":0.01724713969966172,"score_gpt":0.2683333825979079,"score_spread":0.25108624289824616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948312251","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.05687089,0.00079356885,0.91885585,0.00032427142,0.00022026314,0.000043725526,0.0001685034,0.0035172114,0.019205801],"genre_scores_gemma":[0.7033756,0.00034105018,0.2808033,0.00015356774,0.00005699923,0.00008880211,0.00024844677,0.00040184977,0.014530348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998648,0.000033649132,0.000006159743,0.000025024568,0.000045671437,0.000024655754],"domain_scores_gemma":[0.99976915,0.00006534247,0.000015570693,0.00008755881,0.000050332364,0.000012073664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001202645,0.0003754502,0.0003847921,0.0002107313,0.0003249432,0.00051580794,0.00094139937,0.00045462957,0.007517757],"category_scores_gemma":[0.00060803856,0.0002226402,0.00026473132,0.00037387386,0.00025926996,0.00093869,0.00075746037,0.0006855508,0.0011933031],"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.00032543213,0.00025192392,0.00046956123,0.00033157924,0.00006106996,0.00013943037,0.00016227912,0.38441697,0.105020754,0.10888899,0.014042133,0.38588998],"study_design_scores_gemma":[0.000019071318,0.00013606947,0.0002175863,0.000017729913,0.000020540461,0.0000763657,0.00003268777,0.93042916,0.02285375,0.03631098,0.009866796,0.000019234209],"about_ca_topic_score_codex":0.0006315786,"about_ca_topic_score_gemma":0.002044626,"teacher_disagreement_score":0.007517757,"about_ca_system_score_codex":0.0003871276,"about_ca_system_score_gemma":0.00042974844,"threshold_uncertainty_score":0.025149405},"labels":[],"label_agreement":null},{"id":"W2948363035","doi":"10.1007/978-3-030-33391-1_24","title":"Learning to Segment Skin Lesions from Noisy Annotations","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Robustness (evolution); Segmentation; Annotation; Pixel; Deep learning; Ground truth; Pattern recognition (psychology); Limiting; Noise (video); Deep neural networks; Set (abstract data type); Task (project management); Machine learning; Image (mathematics)","score_opus":0.016512429753644517,"score_gpt":0.27419352120635654,"score_spread":0.257681091452712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948363035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17453149,0.0030967765,0.8016713,0.00091807934,0.00041024096,0.00047193954,0.0027859507,0.011789952,0.004324269],"genre_scores_gemma":[0.6379026,0.0020221572,0.33110496,0.0006434113,0.00054864056,0.00031582982,0.009083074,0.00089113764,0.017488208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.000087593085,0.00004810208,0.00041452944,0.00019249365,0.00016541219],"domain_scores_gemma":[0.9986523,0.00044881078,0.00013837079,0.00027887608,0.0003958811,0.00008591121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010119693,0.0021411323,0.0019254239,0.0025241277,0.0005326191,0.0015633575,0.0015918041,0.0029634065,0.0030933586],"category_scores_gemma":[0.0028057685,0.00078443455,0.0015826019,0.0014451748,0.00062424986,0.0013110221,0.0013832656,0.0016877957,0.004395891],"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.00081993145,0.0003854909,0.0063288277,0.00045787415,0.00020828293,0.0004921777,0.0001408856,0.030194068,0.111625925,0.00093715754,0.014757259,0.83365214],"study_design_scores_gemma":[0.000060368464,0.00051297684,0.0069500776,0.00010065677,0.000302857,0.0011670183,0.0002112378,0.920081,0.05746833,0.006367318,0.0067383507,0.000039793307],"about_ca_topic_score_codex":0.004792772,"about_ca_topic_score_gemma":0.009041868,"teacher_disagreement_score":0.004792772,"about_ca_system_score_codex":0.00050746795,"about_ca_system_score_gemma":0.0011571199,"threshold_uncertainty_score":0.01034832},"labels":[],"label_agreement":null},{"id":"W2948694540","doi":"10.1007/978-3-030-22038-9_5","title":"Detecting, Fingerprinting and Tracking Reconnaissance Campaigns Targeting Industrial Control Systems","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Hydro-Québec; Thales (Canada); Concordia University","funders":"","keywords":"Computer science; Network packet; Botnet; Fingerprint (computing); Computer security; Computer network; Ip address; Ethernet; The Internet; Internet Protocol; Real-time computing; World Wide Web","score_opus":0.026710162779804866,"score_gpt":0.23045124630680858,"score_spread":0.2037410835270037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948694540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20317805,0.0071154274,0.73438275,0.0003168534,0.00029924285,0.0001626216,0.00038974933,0.0047140545,0.049441304],"genre_scores_gemma":[0.73864996,0.0040573664,0.2015819,0.0001383618,0.00013887418,0.00005906212,0.0004704716,0.00015401597,0.054750063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966383,0.00002702681,0.000010229519,0.00009175143,0.00017158614,0.000035489975],"domain_scores_gemma":[0.999689,0.00012316593,0.000048750127,0.000053234526,0.000073379124,0.000012436932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019828192,0.00066834775,0.00041792946,0.0010804124,0.00026832777,0.00082465186,0.0007699776,0.0009595663,0.0019712828],"category_scores_gemma":[0.00067831425,0.0003134828,0.00025290163,0.00072646776,0.0003097801,0.00065197184,0.00032324134,0.00034267627,0.0010598854],"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.00013815901,0.00007513853,0.003903446,0.00024915885,0.000023124738,0.00015755037,0.00012701818,0.017833926,0.17640646,0.0018058546,0.0029385947,0.7963415],"study_design_scores_gemma":[0.00003238973,0.0012904779,0.047563378,0.00024653488,0.0001916357,0.0033882938,0.00042222202,0.414198,0.46314284,0.006967727,0.062447164,0.00010937833],"about_ca_topic_score_codex":0.0012191962,"about_ca_topic_score_gemma":0.002004122,"teacher_disagreement_score":0.0019712828,"about_ca_system_score_codex":0.0002245054,"about_ca_system_score_gemma":0.0001863581,"threshold_uncertainty_score":0.0065945983},"labels":[],"label_agreement":null},{"id":"W294877366","doi":"10.1007/978-3-319-12206-9_33","title":"A Framework for a Business Intelligence-Enabled Adaptive Enterprise Architecture","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Technology Governance and Strategy","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"Computer science; Enterprise architecture; Business architecture; Exploit; Adaptation (eye); Process management; Knowledge management; Business intelligence; Context (archaeology); Business rule; Enterprise architecture framework; Architecture; Business process; Software architecture; Business; Computer security; Marketing","score_opus":0.016421422806975228,"score_gpt":0.2318775593467208,"score_spread":0.21545613653974557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W294877366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003279267,0.0003116397,0.96666145,0.002045074,0.00012090609,0.00017189169,0.00009652398,0.0011155086,0.02619769],"genre_scores_gemma":[0.10894031,0.0006146241,0.8737375,0.00038447854,0.000079144236,0.0003763862,0.00034229053,0.0002899087,0.01523538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864894,0.00039592886,0.00015124427,0.00021976109,0.0004031477,0.00018108026],"domain_scores_gemma":[0.99927443,0.00016243769,0.000049409668,0.0002126877,0.0001594848,0.00014151605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022264821,0.00070990884,0.0005244416,0.0012828467,0.0017006317,0.00822243,0.002721125,0.003121569,0.0075602783],"category_scores_gemma":[0.0027114733,0.00081562623,0.0013561816,0.0015290894,0.0034670774,0.0072018974,0.0050204326,0.003927626,0.002426734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072307025,0.00002171006,0.000115197785,0.000037714366,0.000010140292,0.00011511937,0.00034773356,0.0050195814,0.0009738004,0.97939384,0.0016960284,0.012261976],"study_design_scores_gemma":[0.000022431412,0.000032810247,0.00015361956,0.00013140719,0.000032005908,0.00027963545,0.00031677407,0.09224049,0.0016374434,0.76568925,0.13943413,0.00003004656],"about_ca_topic_score_codex":0.0069660908,"about_ca_topic_score_gemma":0.0076618097,"teacher_disagreement_score":0.00822243,"about_ca_system_score_codex":0.0020828736,"about_ca_system_score_gemma":0.0033403644,"threshold_uncertainty_score":0.025291681},"labels":[],"label_agreement":null},{"id":"W2948890324","doi":"10.1007/978-3-030-20521-8_45","title":"Failure Diagnosis of Wind Turbine Bearing Using Feature Extraction and a Neuro-Fuzzy Inference System (ANFIS)","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adaptive neuro fuzzy inference system; Computer science; Turbine; Feature selection; Feature extraction; Wind power; Condition monitoring; Artificial intelligence; Classifier (UML); Bearing (navigation); Fault detection and isolation; Fault (geology); Pattern recognition (psychology); Fuzzy logic; Machine learning; Data mining; Fuzzy control system; Engineering","score_opus":0.012417812043004269,"score_gpt":0.2591606427833242,"score_spread":0.2467428307403199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948890324","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.12831043,0.0012003508,0.8644637,0.00014026945,0.00018768874,0.00008982349,0.0002952644,0.0020278215,0.0032846872],"genre_scores_gemma":[0.9375107,0.00035993572,0.05975818,0.00002083012,0.000038372313,0.000039832914,0.0001971217,0.00002410681,0.0020509136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998983,0.000009762209,0.000012253455,0.000024360494,0.000046353114,0.000008849423],"domain_scores_gemma":[0.9997969,0.00008442795,0.000030704396,0.00001547009,0.00006604013,0.0000063916023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002231509,0.00052655034,0.0005282865,0.00047290942,0.00025797714,0.00035534237,0.00034804802,0.00058719504,0.0011870221],"category_scores_gemma":[0.0007191412,0.00020759192,0.00033832662,0.00027590498,0.00015354717,0.00046047746,0.00015264048,0.0003485903,0.00031718807],"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.00071547256,0.00012777925,0.0033024054,0.00059060747,0.000070376,0.0005209439,0.00016795704,0.14693353,0.13763207,0.0014405673,0.0033575234,0.70514077],"study_design_scores_gemma":[0.000018907609,0.00019906137,0.0069598486,0.000044716744,0.000049684204,0.0002842414,0.00003154911,0.9678505,0.022037711,0.0012237802,0.0012797995,0.000020182268],"about_ca_topic_score_codex":0.0023511506,"about_ca_topic_score_gemma":0.0027686185,"teacher_disagreement_score":0.0023511506,"about_ca_system_score_codex":0.00018311707,"about_ca_system_score_gemma":0.00020227017,"threshold_uncertainty_score":0.004674971},"labels":[],"label_agreement":null},{"id":"W2949069027","doi":"10.1007/978-3-030-32778-1_8","title":"Mask2Lesion: Mask-Constrained Adversarial Skin Lesion Image Synthesis","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Dice; Skin lesion; Sørensen–Dice coefficient; Task (project management); Adversarial system; Deep learning; Pattern recognition (psychology); Image (mathematics); Image segmentation; Machine learning; Medicine; Mathematics","score_opus":0.015548336431449318,"score_gpt":0.26402301429788744,"score_spread":0.24847467786643812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949069027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057282443,0.00014314873,0.9872844,0.00014189043,0.00010478401,0.0000879927,0.00029032625,0.0043324376,0.0018866708],"genre_scores_gemma":[0.25455153,0.00028781698,0.72326976,0.00041815086,0.00012937168,0.00027743017,0.0016474592,0.0014705239,0.01794791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996445,0.00006539037,0.000011518795,0.000085499785,0.0001472166,0.000045825665],"domain_scores_gemma":[0.9996891,0.000118440184,0.000018452853,0.00008885399,0.000059968952,0.000025234594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070415664,0.000871614,0.00066654885,0.00043996266,0.00018587594,0.0005968926,0.0012077648,0.0012178655,0.010279745],"category_scores_gemma":[0.0016001406,0.00045671035,0.0006313201,0.0002697506,0.00033910954,0.0005737664,0.0017218131,0.0011676869,0.0031548112],"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.0006452165,0.0001397528,0.00066467805,0.00020379515,0.00014439104,0.0002797432,0.0000612204,0.3579269,0.064509146,0.009709787,0.02092613,0.54478925],"study_design_scores_gemma":[0.00001648053,0.00004120052,0.00012412763,0.0000060909033,0.0000070663937,0.00007402216,0.000004036244,0.982666,0.012183719,0.0024319647,0.0024387883,0.0000065210515],"about_ca_topic_score_codex":0.0015614876,"about_ca_topic_score_gemma":0.0024160107,"teacher_disagreement_score":0.010279745,"about_ca_system_score_codex":0.0003547827,"about_ca_system_score_gemma":0.00056057266,"threshold_uncertainty_score":0.034389198},"labels":[],"label_agreement":null},{"id":"W2949317307","doi":"10.1007/978-3-030-21500-2_6","title":"Sized Types for Low-Level Quantum Metaprogramming","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Metaprogramming; Programmer; Programming language; Subtyping; Context (archaeology); Quantum circuit; Theoretical computer science; Quantum; Quantum computer; Quantum network","score_opus":0.022556353791820295,"score_gpt":0.2553420356084694,"score_spread":0.2327856818166491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949317307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008431887,0.0011235854,0.94000936,0.0008200196,0.00087977236,0.000085591746,0.00022909055,0.0028404167,0.045580335],"genre_scores_gemma":[0.25121546,0.0014786237,0.67539096,0.00083904504,0.0006366223,0.000627579,0.0006447237,0.003904578,0.06526248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991314,0.0001884869,0.00008974981,0.00012590311,0.0003649402,0.000099491896],"domain_scores_gemma":[0.998439,0.0007472935,0.00005720727,0.00057500036,0.0001134859,0.00006801694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107837,0.00085356075,0.0008267234,0.0008594602,0.00136298,0.0032961892,0.0020910525,0.0011733851,0.017605593],"category_scores_gemma":[0.0035434598,0.00092145166,0.0012076976,0.0014076367,0.0026123072,0.0076853265,0.0028045827,0.004396536,0.004254088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031814026,0.000013683851,0.000055882978,0.00008709419,0.0000062467398,0.000025572115,0.000078871315,0.0013605815,0.0020956558,0.9622383,0.0040396927,0.029966677],"study_design_scores_gemma":[0.000010761149,0.000012610922,0.000034812863,0.00003272191,0.000010393514,0.000056316734,0.00001790675,0.009963387,0.0026025116,0.95910174,0.028141603,0.000015141435],"about_ca_topic_score_codex":0.00034664138,"about_ca_topic_score_gemma":0.0006235874,"teacher_disagreement_score":0.017605593,"about_ca_system_score_codex":0.0013665103,"about_ca_system_score_gemma":0.00068147754,"threshold_uncertainty_score":0.0588966},"labels":[],"label_agreement":null},{"id":"W2949563967","doi":"10.1007/978-3-030-17953-3_21","title":"An Efficient Characterization of Submodular Spanning Tree Games","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Shapley value; Characterization (materials science); Game tree; Computer science; Convexity; Mathematical economics; Spanning tree; Tree (set theory); Cooperative game theory; Time complexity; Core (optical fiber); Mathematics; Game theory; Regular polygon; Combinatorics; Sequential game; Economics","score_opus":0.016765882172677958,"score_gpt":0.257172427004477,"score_spread":0.24040654483179905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949563967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22680686,0.00079125696,0.7037059,0.003451796,0.00021908447,0.0008671341,0.003317335,0.0012754775,0.059565093],"genre_scores_gemma":[0.8230034,0.0009964795,0.15092082,0.0010125493,0.00052035425,0.0009197539,0.0040890975,0.0006241956,0.017913342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965037,0.0009929546,0.0001901803,0.0007589604,0.0008872367,0.00066688017],"domain_scores_gemma":[0.9891879,0.0071754926,0.00081391446,0.0010954756,0.0008024522,0.00092476344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023321041,0.0019771107,0.002478795,0.0021503658,0.0014323893,0.0058868174,0.004617372,0.002276619,0.012448569],"category_scores_gemma":[0.016225256,0.0011364915,0.0020852508,0.0035244967,0.0018189291,0.010216034,0.004027561,0.005462934,0.0015548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043685807,0.0005150476,0.0020688486,0.0003982447,0.00011119294,0.00022514093,0.0005456993,0.052921128,0.0072233495,0.8674479,0.01596055,0.05214612],"study_design_scores_gemma":[0.000053923155,0.00009198208,0.0004756327,0.000037023787,0.00003919104,0.00015478127,0.00011414956,0.25740638,0.0011020242,0.737249,0.0032487917,0.000027039148],"about_ca_topic_score_codex":0.0017246668,"about_ca_topic_score_gemma":0.002229726,"teacher_disagreement_score":0.012448569,"about_ca_system_score_codex":0.0030366366,"about_ca_system_score_gemma":0.0027975328,"threshold_uncertainty_score":0.041644633},"labels":[],"label_agreement":null},{"id":"W2949676834","doi":"10.1007/978-3-030-23204-7_16","title":"How Many Times Should a Pedagogical Agent Simulation Model Be Run?","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 Saskatchewan","funders":"","keywords":"Computer science; Stochastic simulation; Fidelity; Simulation modeling; Monte Carlo method; Simulation; Industrial engineering; Mathematical economics; Mathematics; Statistics","score_opus":0.11432672083682918,"score_gpt":0.31715704795259764,"score_spread":0.20283032711576846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949676834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21451114,0.00054630014,0.73185956,0.009502458,0.00067877595,0.0003203488,0.00049972604,0.009219079,0.03286255],"genre_scores_gemma":[0.8197129,0.00024038738,0.17059489,0.00059385085,0.00008662583,0.0002054396,0.00054444873,0.0011419816,0.0068796193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662256,0.0015704399,0.00020189756,0.00045372703,0.00090777216,0.00024362365],"domain_scores_gemma":[0.98450863,0.008821787,0.0006855691,0.0028786785,0.0019701195,0.0011352819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005107806,0.0007173004,0.00072148576,0.0005546961,0.0006808923,0.0027170894,0.0020251637,0.001987064,0.0092120115],"category_scores_gemma":[0.04442457,0.00086493324,0.00078792346,0.00034901378,0.0006479902,0.006646837,0.0012562583,0.002887573,0.003163805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019812328,0.0010898126,0.031059269,0.00034140432,0.0005447351,0.0003837939,0.00077269337,0.5268727,0.017383713,0.060411587,0.019272985,0.339886],"study_design_scores_gemma":[0.000088211214,0.000109168,0.001217882,0.000055980647,0.00009784506,0.00009649822,0.00024175373,0.94114554,0.0064487676,0.041582655,0.008877053,0.00003866853],"about_ca_topic_score_codex":0.003480807,"about_ca_topic_score_gemma":0.0040609534,"teacher_disagreement_score":0.0092120115,"about_ca_system_score_codex":0.0012759422,"about_ca_system_score_gemma":0.002106482,"threshold_uncertainty_score":0.03081727},"labels":[],"label_agreement":null},{"id":"W2949783224","doi":"10.1007/978-3-030-22747-0_26","title":"Salinity Control on Saigon River Downstream of Dautieng Reservoir Within Multi-objective Simulation-Optimisation Framework for Reservoir Operation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Water resources management and optimization","field":"Engineering","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Salinity; MATLAB; Toolbox; Downstream (manufacturing); Genetic algorithm; Population; Environmental science; Hydrology (agriculture); Geology; Engineering","score_opus":0.021719787020708328,"score_gpt":0.2537267513864682,"score_spread":0.2320069643657599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949783224","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.65130717,0.00045318127,0.30633783,0.0005677186,0.00013254277,0.00009565244,0.00033444137,0.000620758,0.04015069],"genre_scores_gemma":[0.9895583,0.000086016036,0.0067148115,0.000013975083,0.000006795327,0.00002216192,0.00008118036,0.000023535287,0.0034933176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999367,0.000019323154,0.0000026700977,0.000013949863,0.000012932052,0.000014495814],"domain_scores_gemma":[0.99993515,0.000026573833,0.000007947175,0.0000035513099,0.00001854224,0.000008105024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014789302,0.00038175707,0.0005423881,0.0001809413,0.00043585943,0.000769279,0.00044698405,0.0005520928,0.0014419772],"category_scores_gemma":[0.00024832998,0.00019591757,0.0005621867,0.00021753322,0.0002600307,0.00030493524,0.00048589284,0.0003218683,0.00011044929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003299282,0.000015733802,0.0005314868,0.000017268309,0.000010656486,0.000063228435,0.000014693138,0.9917932,0.0027170272,0.00096601667,0.00019090509,0.0036468112],"study_design_scores_gemma":[0.0000022113634,0.000012553619,0.0001838611,0.0000011226755,0.0000027255235,0.0000027069063,0.0000064569917,0.99919826,0.00031875324,0.00017494828,0.00009451614,0.0000018203699],"about_ca_topic_score_codex":0.017675517,"about_ca_topic_score_gemma":0.014073265,"teacher_disagreement_score":0.017675517,"about_ca_system_score_codex":0.00045470172,"about_ca_system_score_gemma":0.00067062816,"threshold_uncertainty_score":0.035145283},"labels":[],"label_agreement":null},{"id":"W2949952898","doi":"10.1007/978-3-319-41649-6","title":"Artificial General Intelligence","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Computer security; Container (type theory); Order (exchange); Risk analysis (engineering); Incentive; Business","score_opus":0.01818571204490849,"score_gpt":0.27635280527699374,"score_spread":0.25816709323208525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949952898","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.0015994334,0.025280487,0.11569508,0.004201093,0.0024495835,0.00011221338,0.0007486584,0.002224394,0.84768903],"genre_scores_gemma":[0.030222146,0.025365058,0.06285648,0.0018651754,0.0016419092,0.0002214583,0.0026719212,0.000982303,0.8741736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996364,0.000055336564,0.000017775794,0.00008678482,0.00017739543,0.000026246025],"domain_scores_gemma":[0.99967,0.00010140614,0.000015439064,0.00011782573,0.000066549444,0.000028810926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044275375,0.0011142758,0.0007664257,0.0013048999,0.0006611018,0.0031104365,0.0010965258,0.001020388,0.06841074],"category_scores_gemma":[0.0011047544,0.0004916506,0.0006584903,0.0015168396,0.0009579495,0.0034015053,0.0017793161,0.0022893036,0.046040937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025539786,0.00006022351,0.00021198129,0.0005183596,0.000030154988,0.00007422928,0.00018175121,0.0020066914,0.001525654,0.18328561,0.2944508,0.5176291],"study_design_scores_gemma":[0.0000060120715,0.000015548092,0.00027323625,0.00016726763,0.000010817076,0.00016837417,0.000034840574,0.0026572067,0.0007147769,0.14756243,0.8483805,0.0000090041],"about_ca_topic_score_codex":0.0005914848,"about_ca_topic_score_gemma":0.0009758324,"teacher_disagreement_score":0.06841074,"about_ca_system_score_codex":0.0008561972,"about_ca_system_score_gemma":0.0007388442,"threshold_uncertainty_score":0.22885674},"labels":[],"label_agreement":null},{"id":"W2950036238","doi":"10.1007/978-3-319-53925-6_24","title":"Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Carleton University; University of Manitoba","funders":"","keywords":"Polygon (computer graphics); Computer science; Visibility; Point (geometry); Visibility polygon; Computer graphics (images); Space (punctuation); Computer vision; Simple polygon; Geometry; Mathematics; Telecommunications; Optics; Physics; Monotone polygon; Operating system","score_opus":0.02896338328720742,"score_gpt":0.2746295439546489,"score_spread":0.24566616066744146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950036238","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.3500295,0.0037442928,0.611335,0.0018906979,0.0002957999,0.00021343972,0.0006156199,0.0023213085,0.029554456],"genre_scores_gemma":[0.78360206,0.00069526146,0.209869,0.00015519638,0.0001222925,0.00011955101,0.00041281086,0.0004899764,0.0045339726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.00034841624,0.0001154031,0.0003121231,0.00048368028,0.00029329644],"domain_scores_gemma":[0.99119663,0.0071470356,0.0003181981,0.00048030834,0.0004465468,0.00041126736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021214888,0.0010902876,0.0011225048,0.001213796,0.0008051869,0.002013286,0.0023657333,0.0021486375,0.009561196],"category_scores_gemma":[0.016577281,0.00045945216,0.0007303815,0.0015166735,0.0012351319,0.0038365545,0.0028023592,0.0010116826,0.0012025045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037159042,0.0003680061,0.0052442416,0.0008676521,0.00017153227,0.00029857658,0.00066647306,0.6199858,0.031584673,0.024860138,0.0062124017,0.30602458],"study_design_scores_gemma":[0.0000807548,0.00028585564,0.0008309538,0.000040916075,0.000069019574,0.00019781674,0.00018039663,0.9818366,0.0048448313,0.010820125,0.0007933971,0.000019376179],"about_ca_topic_score_codex":0.0045253136,"about_ca_topic_score_gemma":0.0071291877,"teacher_disagreement_score":0.009561196,"about_ca_system_score_codex":0.0013118353,"about_ca_system_score_gemma":0.0015421221,"threshold_uncertainty_score":0.03198546},"labels":[],"label_agreement":null},{"id":"W2950069230","doi":"10.1007/978-3-030-21642-9_27","title":"Mobile Indoor Localization with Bluetooth Beacons in a Pediatric Emergency Department Using Clustering, Rule-Based Classification and High-Level Heuristics","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Heuristics; Beacon; Bluetooth; Cluster analysis; Artificial intelligence; Real-time computing; Machine learning; Wireless; Telecommunications","score_opus":0.018484407098046662,"score_gpt":0.22899338626723037,"score_spread":0.2105089791691837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950069230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02940965,0.0012367668,0.9626841,0.00017650392,0.000103201346,0.00006394072,0.0002159484,0.0018080337,0.0043018125],"genre_scores_gemma":[0.34207177,0.0010564154,0.6510331,0.00008056745,0.000068925474,0.000076619624,0.00044504224,0.00015846896,0.0050091087],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964774,0.000068465175,0.000032838172,0.00011150013,0.00009727839,0.00004221325],"domain_scores_gemma":[0.99963653,0.00021278707,0.0000273338,0.000032655862,0.000072437346,0.000018324323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004350218,0.0005740517,0.0008447933,0.0007348305,0.00035705115,0.0009958792,0.0013629892,0.00070625177,0.0014184518],"category_scores_gemma":[0.0009548491,0.00041445182,0.0007626521,0.0012144343,0.00023316231,0.00071418355,0.00053394446,0.00047489727,0.00065963],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002812495,0.00013367792,0.005178103,0.00023546588,0.00012269212,0.00060596096,0.00024067651,0.24549566,0.013430059,0.005229722,0.0075187963,0.7215279],"study_design_scores_gemma":[0.000021565522,0.00017688409,0.0032666922,0.000054297576,0.000083600586,0.00053513236,0.00013988494,0.978962,0.0075947503,0.004225797,0.0049036844,0.000035732843],"about_ca_topic_score_codex":0.0053786486,"about_ca_topic_score_gemma":0.008984842,"teacher_disagreement_score":0.0053786486,"about_ca_system_score_codex":0.00042431938,"about_ca_system_score_gemma":0.00062425935,"threshold_uncertainty_score":0.010694742},"labels":[],"label_agreement":null},{"id":"W29501390","doi":"10.1007/978-3-642-16321-0_42","title":"Erratum to: Range Queries over Untangled Chains","year":2010,"lang":"en","type":"erratum","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Range (aeronautics); Theoretical computer science; Information retrieval; Aerospace engineering; Engineering","score_opus":0.010543215280759622,"score_gpt":0.2600395636072869,"score_spread":0.24949634832652728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29501390","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014634265,0.0019133026,0.013405312,0.090513445,0.8716402,0.000091282294,0.002895332,0.0018356375,0.016242146],"genre_scores_gemma":[0.07846139,0.012937297,0.07140227,0.12683484,0.20078665,0.0004411559,0.01897079,0.0066937455,0.4834719],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99447745,0.0007747232,0.0008087761,0.00065976434,0.0029181505,0.00036118965],"domain_scores_gemma":[0.979924,0.0062558977,0.0008653135,0.0022137654,0.010063947,0.0006771096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00283832,0.0022884596,0.0022399877,0.0030142372,0.003971804,0.0034134178,0.0028935736,0.005750797,0.07567743],"category_scores_gemma":[0.041038096,0.0012187446,0.0012669493,0.004301738,0.0022394827,0.0040159747,0.0022011371,0.0056280363,0.0302642],"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.00013496623,0.00001905104,0.000102647915,0.00014126087,0.000015924055,0.00033459335,0.00003782355,0.0001898304,0.00025224968,0.0037987686,0.98402935,0.010943522],"study_design_scores_gemma":[0.00014336673,0.00011531877,0.00090387807,0.0003548831,0.00010333598,0.0015813556,0.00027227224,0.0031860443,0.0025755009,0.014823041,0.9758236,0.000117399366],"about_ca_topic_score_codex":0.006864539,"about_ca_topic_score_gemma":0.008857928,"teacher_disagreement_score":0.07567743,"about_ca_system_score_codex":0.0031830145,"about_ca_system_score_gemma":0.0029083109,"threshold_uncertainty_score":0.2531662},"labels":[],"label_agreement":null},{"id":"W2950226402","doi":"10.1007/978-3-030-33843-5_22","title":"Image Super Resolution via Bilinear Pooling: Application to Confocal Endomicroscopy","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pooling; Computer science; Artificial intelligence; Usability; Image quality; Channel (broadcasting); Miniaturization; Bilinear interpolation; Computer vision; Flexibility (engineering); Image resolution; Image (mathematics); Mathematics; Statistics; Engineering; Telecommunications","score_opus":0.010846761873251337,"score_gpt":0.2988410004496852,"score_spread":0.28799423857643386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950226402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014094141,0.00043176115,0.9833187,0.00015269581,0.00002533732,0.000050127193,0.00011418035,0.0007403252,0.0010727863],"genre_scores_gemma":[0.11258998,0.0007786719,0.8836196,0.000065845496,0.00004322596,0.000073375864,0.000118636555,0.00022788507,0.0024828464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.000070738795,0.000018565619,0.0000640706,0.0001494051,0.00005348869],"domain_scores_gemma":[0.99930346,0.0002620999,0.000046949543,0.00015910811,0.00016919133,0.000059262908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011201617,0.00068814395,0.00080261956,0.0008858581,0.00042064098,0.001008686,0.0010206326,0.000692887,0.0041834237],"category_scores_gemma":[0.0017642522,0.00057544914,0.00067163236,0.001390403,0.00050233316,0.00089165964,0.0018672975,0.0009420252,0.00094334374],"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.00052445853,0.0001597422,0.0008977117,0.00047119992,0.00013410294,0.00037985106,0.0003119325,0.03850884,0.3316616,0.015631791,0.0043843687,0.6069344],"study_design_scores_gemma":[0.00003531704,0.00017211272,0.0022231925,0.00003523102,0.00008535861,0.00093823863,0.00009161276,0.7786102,0.18968207,0.018302754,0.009772988,0.00005090622],"about_ca_topic_score_codex":0.0026365912,"about_ca_topic_score_gemma":0.0039697727,"teacher_disagreement_score":0.0041834237,"about_ca_system_score_codex":0.00050118,"about_ca_system_score_gemma":0.00089240127,"threshold_uncertainty_score":0.013994932},"labels":[],"label_agreement":null},{"id":"W2950318938","doi":"10.1007/978-3-030-22514-8_26","title":"On Visualization of Movements for Monitoring Older Adults","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Movement (music); Wearable computer; Granularity; Visualization; Sample (material); Population; Tracking (education); Residence; Human–computer interaction; Artificial intelligence; Embedded system","score_opus":0.01977603093422682,"score_gpt":0.302466458360422,"score_spread":0.2826904274261952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950318938","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06491479,0.020511862,0.83900434,0.0023334005,0.0014753053,0.00043068564,0.009617726,0.021289907,0.040422007],"genre_scores_gemma":[0.2718391,0.024735404,0.6418575,0.00081159384,0.0011501758,0.00056769856,0.008139926,0.002514764,0.04838374],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997904,0.00005143299,0.000014888656,0.00003901622,0.000081098624,0.000023271314],"domain_scores_gemma":[0.99891496,0.00063127757,0.000056203695,0.0000821196,0.00025782542,0.000057647805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048754376,0.0011623584,0.00052302185,0.001862876,0.00028569766,0.0014305654,0.00078414235,0.0007879662,0.016991617],"category_scores_gemma":[0.0019107488,0.00025958335,0.0005035429,0.0016857216,0.00017328239,0.0010606924,0.0009883845,0.00052637444,0.002321343],"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.0005295541,0.00009045874,0.0022816958,0.00087390834,0.00008255842,0.0003963868,0.00072161003,0.004029071,0.053741857,0.0043263608,0.066584624,0.86634195],"study_design_scores_gemma":[0.00032765418,0.0009778966,0.064203925,0.002990043,0.000625121,0.0047982563,0.0021158608,0.2591974,0.13861921,0.054706458,0.47104633,0.00039188005],"about_ca_topic_score_codex":0.003036234,"about_ca_topic_score_gemma":0.0043487055,"teacher_disagreement_score":0.016991617,"about_ca_system_score_codex":0.00020624265,"about_ca_system_score_gemma":0.00023894575,"threshold_uncertainty_score":0.056842625},"labels":[],"label_agreement":null},{"id":"W2950363995","doi":"10.1007/978-3-030-23207-8_53","title":"Informing the Utility of Learning Interventions: Investigating Factors Related to Students’ Academic Achievement in Classroom and Online Courses","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Carleton University","funders":"","keywords":"Multilevel model; Context (archaeology); Construct (python library); Academic achievement; Psychological intervention; Sample (material); Variance (accounting); Computer science; Mathematics education; Psychology; Regression analysis; Machine learning","score_opus":0.036950994562566765,"score_gpt":0.33327342202789767,"score_spread":0.2963224274653309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950363995","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.9943124,0.00024293613,0.00086296356,0.00051638996,0.000032601725,0.0002497137,0.000100768826,0.000032010783,0.0036501258],"genre_scores_gemma":[0.9934269,0.00030793584,0.004589377,0.00011814303,0.000014058862,0.00052508735,0.00010480417,0.000008138988,0.0009055826],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9946185,0.003072428,0.00031705663,0.00043077653,0.0011502951,0.00041092047],"domain_scores_gemma":[0.9652536,0.025612589,0.0046764472,0.0011390931,0.0014131522,0.0019050628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008058678,0.00056252384,0.00062709843,0.0010318614,0.0009813242,0.0023526296,0.0009718386,0.0010193493,0.003696425],"category_scores_gemma":[0.035753045,0.0004142691,0.0006127026,0.001153442,0.0009361971,0.001984822,0.0015117408,0.0015470248,0.00063967414],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003390851,0.028543945,0.55239564,0.0010003883,0.0004822679,0.00009167678,0.015491245,0.00064377644,0.003720064,0.0015517075,0.0023423305,0.3903461],"study_design_scores_gemma":[0.00038226755,0.008952714,0.9689077,0.0004537613,0.00053970504,0.00004599329,0.009838095,0.002199049,0.0040709344,0.0023472107,0.0022028524,0.000059747792],"about_ca_topic_score_codex":0.002444519,"about_ca_topic_score_gemma":0.004567553,"teacher_disagreement_score":0.008058678,"about_ca_system_score_codex":0.0011552888,"about_ca_system_score_gemma":0.003015196,"threshold_uncertainty_score":0.04261887},"labels":[],"label_agreement":null},{"id":"W2950578033","doi":"10.1007/978-3-030-21642-9_11","title":"Agent-Based Models and Spatial Enablement: A Simulation Tool to Improve Health and Wellbeing in Big Cities","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Transport and Accessibility","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Analytics; Big data; Psychological intervention; Commission; Public health; Health impact assessment; Population; Computer science; Environmental planning; Business; Geography; Data science; Environmental health; Medicine; Nursing","score_opus":0.02975883420078573,"score_gpt":0.287994434838751,"score_spread":0.25823560063796525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950578033","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.17026605,0.0012101645,0.7690328,0.0033496828,0.00051381247,0.00028668833,0.0033096382,0.0025583024,0.04947281],"genre_scores_gemma":[0.81909883,0.001294917,0.16207726,0.0002868669,0.00009765424,0.0006486612,0.001224948,0.00029082914,0.014980042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977106,0.0001362162,0.000012213841,0.00002869072,0.00003158108,0.000020325198],"domain_scores_gemma":[0.99867946,0.0010389842,0.000050294868,0.000044540684,0.00009311449,0.0000937118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006581534,0.0008847088,0.00069276977,0.0004516814,0.00075783505,0.0019188784,0.0014362944,0.0019678476,0.0065432624],"category_scores_gemma":[0.0022146895,0.0006444759,0.00084418256,0.0008442574,0.00063882815,0.0015793721,0.0014548696,0.0013500365,0.00050495623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000292714,0.000038689428,0.00041565375,0.000035385074,0.000027015501,0.000040406285,0.00009427556,0.98429227,0.000106019,0.010730858,0.0011322323,0.0030578887],"study_design_scores_gemma":[0.000021429634,0.000012908761,0.00009478011,0.000013896365,0.00001360656,0.0000072283606,0.00004389228,0.98822474,0.00011164195,0.009149927,0.0022972452,0.000008644098],"about_ca_topic_score_codex":0.024199924,"about_ca_topic_score_gemma":0.027011551,"teacher_disagreement_score":0.024199924,"about_ca_system_score_codex":0.0010281756,"about_ca_system_score_gemma":0.001311378,"threshold_uncertainty_score":0.048118174},"labels":[],"label_agreement":null},{"id":"W2950683345","doi":"10.1007/978-3-642-32512-0_10","title":"Approximating Minimum-Cost Connected T-Joins","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Rounding; Steiner tree problem; Degree (music); Undirected graph; Mathematics; Discrete mathematics; Graph; Connected dominating set; Computer science; Physics","score_opus":0.031683213939091584,"score_gpt":0.252427819317922,"score_spread":0.22074460537883045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950683345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2757477,0.0018105044,0.67843926,0.0019391633,0.00036000065,0.0003517743,0.0020181155,0.002717334,0.036616135],"genre_scores_gemma":[0.508815,0.0010346182,0.47118765,0.00031956407,0.0003057598,0.00033967185,0.003368791,0.00086907495,0.013759808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877316,0.0002378223,0.00006409195,0.00026150275,0.0004744592,0.00018902692],"domain_scores_gemma":[0.99363285,0.0041337134,0.00036053735,0.0008666317,0.0004797913,0.00052641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185861,0.0014123631,0.0020013857,0.0015311736,0.00093008386,0.0028036172,0.0033510318,0.0020496137,0.01589256],"category_scores_gemma":[0.011513255,0.00078029756,0.0011313569,0.0037016158,0.0009981594,0.0043710354,0.0031161222,0.002721705,0.0025418617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020897412,0.0006489905,0.002683613,0.0011499217,0.0001393613,0.00038775138,0.00052736345,0.44939628,0.013944717,0.1869928,0.033816412,0.3082231],"study_design_scores_gemma":[0.00019546834,0.00021943903,0.00039656306,0.0000724707,0.00006784737,0.00031738722,0.00023480285,0.7834817,0.004175718,0.20539816,0.0054218555,0.00001859353],"about_ca_topic_score_codex":0.0010096831,"about_ca_topic_score_gemma":0.0022042505,"teacher_disagreement_score":0.01589256,"about_ca_system_score_codex":0.0015295037,"about_ca_system_score_gemma":0.00109357,"threshold_uncertainty_score":0.053165913},"labels":[],"label_agreement":null},{"id":"W2950734752","doi":"10.1007/978-3-030-22514-8_17","title":"Evaluating the Performance of Virtual Reality Navigation Techniques for Large Environments","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtual reality; Context (archaeology); Strengths and weaknesses; Human–computer interaction; Teleportation; Artificial intelligence","score_opus":0.031075332403715298,"score_gpt":0.32184013087144026,"score_spread":0.29076479846772496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950734752","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.96966535,0.00068417034,0.025834814,0.000041051786,0.000048850583,0.00010894672,0.00024823713,0.00054292876,0.0028257067],"genre_scores_gemma":[0.97089225,0.00041675335,0.025535235,0.00001744614,0.000017934828,0.00006184468,0.0005130257,0.00011343497,0.0024320832],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983429,0.00072401477,0.00012822739,0.00019844457,0.0004912965,0.000115210954],"domain_scores_gemma":[0.98557067,0.012006232,0.000548976,0.00052421534,0.0009835353,0.00036629508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013971606,0.0010390957,0.00049407926,0.0007125771,0.00024466024,0.0009131669,0.0010656731,0.0010319453,0.0030341272],"category_scores_gemma":[0.014647253,0.00026556835,0.00033307518,0.0006197034,0.00025937898,0.0011415326,0.00066794123,0.00033250058,0.00073239335],"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.016354725,0.004896559,0.019782307,0.0020666,0.0005628635,0.00031007797,0.001762057,0.14237022,0.10397526,0.00082801725,0.0028582537,0.704233],"study_design_scores_gemma":[0.001311487,0.066079885,0.12568349,0.0002933924,0.0012967333,0.0012049777,0.0031098647,0.6726194,0.11781802,0.0015884688,0.008609055,0.00038526187],"about_ca_topic_score_codex":0.003054558,"about_ca_topic_score_gemma":0.0031557204,"teacher_disagreement_score":0.003054558,"about_ca_system_score_codex":0.00027148856,"about_ca_system_score_gemma":0.00032724094,"threshold_uncertainty_score":0.010150135},"labels":[],"label_agreement":null},{"id":"W2950832322","doi":"10.1007/978-3-662-45912-6_13","title":"Looking at Vector Space and Language Models for IR Using Density Matrices","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université de Montréal","funders":"","keywords":"Computer science; Density matrix; Space (punctuation); Vector space; Theoretical computer science; Vector space model; Work (physics); Matrix (chemical analysis); Quantum; Joint (building); Matrix analysis; Algebra over a field; Algorithm; Artificial intelligence; Mathematics; Pure mathematics; Physics; Quantum mechanics","score_opus":0.02338043740809482,"score_gpt":0.25326273663821425,"score_spread":0.22988229923011944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950832322","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.0066564796,0.0036027816,0.9795694,0.0033074021,0.00022583171,0.000026370704,0.00025111454,0.00063975883,0.0057209954],"genre_scores_gemma":[0.42949176,0.009622948,0.5095029,0.0025045301,0.0020955927,0.0003379209,0.0018655803,0.0012465945,0.043332256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972994,0.0016715345,0.00011652928,0.0003697031,0.0003970315,0.00014584896],"domain_scores_gemma":[0.9900034,0.007769228,0.00032825934,0.001038399,0.00065168925,0.0002089895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313299,0.0011484344,0.0016403157,0.001283863,0.000982444,0.0040984927,0.0022508095,0.002214148,0.010448498],"category_scores_gemma":[0.018179152,0.0011417603,0.002014365,0.0022527967,0.0019842177,0.012437975,0.0018012525,0.0053576827,0.003814927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097137985,0.000065817425,0.0007354171,0.00032072476,0.00011183179,0.00008337942,0.00044591862,0.037005648,0.0014828607,0.84967536,0.011300764,0.09867508],"study_design_scores_gemma":[0.000009550823,0.000033523454,0.0001889155,0.000051231607,0.000019935753,0.00008151745,0.00007385235,0.1361949,0.0004715198,0.8580778,0.004765396,0.00003182727],"about_ca_topic_score_codex":0.005057135,"about_ca_topic_score_gemma":0.003727394,"teacher_disagreement_score":0.010448498,"about_ca_system_score_codex":0.0015152019,"about_ca_system_score_gemma":0.0010234022,"threshold_uncertainty_score":0.034953654},"labels":[],"label_agreement":null},{"id":"W2951405260","doi":"10.1007/978-3-030-23381-5_5","title":"Big Data Quality: A Data Quality Profiling Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Data quality; Profiling (computer programming); Computer science; Data governance; Big data; Data mining; Data science; Engineering","score_opus":0.5635995789952036,"score_gpt":0.47028224481804565,"score_spread":0.09331733417715798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951405260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01072778,0.00054844934,0.9724559,0.0038050495,0.00009040009,0.00016573658,0.0005362483,0.00078632956,0.010884026],"genre_scores_gemma":[0.5881675,0.001220184,0.39717948,0.001063112,0.0003534346,0.00038968268,0.0011529599,0.00033941097,0.010134138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994888,0.001620542,0.0003014061,0.00081067876,0.001957801,0.00042164003],"domain_scores_gemma":[0.9839633,0.008126445,0.002101953,0.0018790937,0.0031599673,0.00076915754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008647586,0.0010910829,0.0007725279,0.0037779126,0.0010665033,0.0056219953,0.0023093333,0.0015295933,0.0038590427],"category_scores_gemma":[0.023430688,0.0007121955,0.0014687373,0.0045088874,0.0019811408,0.011169844,0.0030411396,0.0025721914,0.0008610815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021839706,0.00023592777,0.016865522,0.00037843708,0.00013986531,0.00014238553,0.0008449011,0.11748467,0.0012706439,0.6377418,0.019982202,0.20469534],"study_design_scores_gemma":[0.0000158893,0.00006379586,0.003099595,0.00012507907,0.00006532667,0.0001478554,0.000264219,0.6623379,0.0011673653,0.32124245,0.011427501,0.00004302932],"about_ca_topic_score_codex":0.005101338,"about_ca_topic_score_gemma":0.0039769965,"teacher_disagreement_score":0.008647586,"about_ca_system_score_codex":0.003120563,"about_ca_system_score_gemma":0.0024383396,"threshold_uncertainty_score":0.045733392},"labels":[],"label_agreement":null},{"id":"W2951506935","doi":"10.1007/978-3-030-22514-8_31","title":"Multi-layer Perceptron Architecture for Kinect-Based Gait Recognition","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gait Recognition and Analysis","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 Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Gait; Perceptron; Pattern recognition (psychology); Artificial neural network; Multilayer perceptron; Computer vision; Joint (building); Architecture; Invariant (physics); Engineering","score_opus":0.027306162104392823,"score_gpt":0.24109660301699798,"score_spread":0.21379044091260516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951506935","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.02200014,0.0022002293,0.9618301,0.00023794304,0.00046207564,0.00009692609,0.0011881484,0.0075389394,0.004445506],"genre_scores_gemma":[0.5041473,0.0017158308,0.46186396,0.00036918893,0.00013262042,0.00032446193,0.003347535,0.00021283799,0.027886325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999699,0.000033492295,0.000025718842,0.000094182265,0.00009180841,0.000055797842],"domain_scores_gemma":[0.9997818,0.000038408292,0.000014987337,0.000032493528,0.00011643461,0.000015886451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231875,0.0008627964,0.00070811657,0.0005476656,0.00027979907,0.0006123165,0.0016676409,0.0010504598,0.006818625],"category_scores_gemma":[0.000764911,0.0004469378,0.0006596844,0.0009736518,0.00018509527,0.00066598377,0.00067306706,0.001101183,0.004167833],"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.00036552947,0.00027592637,0.001288535,0.00027255988,0.00015443961,0.00009976079,0.00003446293,0.08349915,0.041061185,0.0022686792,0.013097437,0.85758245],"study_design_scores_gemma":[0.000012533321,0.000092668255,0.0019257965,0.000044570334,0.000047722187,0.00007325442,0.000011507333,0.98036855,0.012910231,0.0013124166,0.003176539,0.000024134408],"about_ca_topic_score_codex":0.009221596,"about_ca_topic_score_gemma":0.013878963,"teacher_disagreement_score":0.009221596,"about_ca_system_score_codex":0.0004912925,"about_ca_system_score_gemma":0.000661525,"threshold_uncertainty_score":0.022810578},"labels":[],"label_agreement":null},{"id":"W2951510002","doi":"10.1007/978-3-030-22514-8_6","title":"Improved Volume Scattering","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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 Calgary","funders":"","keywords":"Computer science; Volume (thermodynamics); Computer graphics (images); Physics; Thermodynamics","score_opus":0.015058816756814032,"score_gpt":0.2603575716939293,"score_spread":0.24529875493711528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951510002","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.031800065,0.0045492174,0.7557987,0.001148358,0.0024917626,0.00008418429,0.0004403082,0.003572156,0.20011528],"genre_scores_gemma":[0.3839091,0.005036415,0.36073366,0.00081408874,0.0014199793,0.0001455673,0.00150314,0.0036343585,0.24280374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991547,0.00014501679,0.00002520949,0.00013199383,0.00046902394,0.00007394544],"domain_scores_gemma":[0.9995121,0.000108936314,0.000026307262,0.0001658698,0.00013166381,0.000055077868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050624297,0.0013769101,0.0013162142,0.0014798626,0.00079116394,0.0018014789,0.0011033703,0.0010030713,0.02052265],"category_scores_gemma":[0.0010230177,0.0006123407,0.0009425549,0.0015304623,0.000826703,0.0017468226,0.0023831395,0.0023971708,0.0060668997],"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.00048419106,0.000183749,0.00048253906,0.00034848272,0.00010299912,0.0002480205,0.00022100458,0.027705222,0.19504876,0.4787909,0.035691228,0.2606929],"study_design_scores_gemma":[0.000104799925,0.00019323951,0.001292294,0.00011488,0.000117787255,0.0016261564,0.00011596323,0.28387427,0.23290163,0.2991091,0.18036827,0.00018163964],"about_ca_topic_score_codex":0.0004303376,"about_ca_topic_score_gemma":0.00047806482,"teacher_disagreement_score":0.02052265,"about_ca_system_score_codex":0.0006567871,"about_ca_system_score_gemma":0.0003952043,"threshold_uncertainty_score":0.06865513},"labels":[],"label_agreement":null},{"id":"W2951692599","doi":"10.1007/978-3-030-22514-8_24","title":"Efficient Rendering of Rounded Corners and Edges for Convex Objects","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Université de Montréal","funders":"","keywords":"Shader; Rendering (computer graphics); Computer science; Computer graphics (images); Regular polygon; Polygon mesh; Ray tracing (physics); Computer vision; Artificial intelligence; Geometry; Mathematics; Optics","score_opus":0.025131489304992673,"score_gpt":0.2736767486563034,"score_spread":0.24854525935131075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951692599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017178388,0.00035249715,0.96638775,0.00010871087,0.000105218984,0.000072363,0.00023095423,0.0053061196,0.010257909],"genre_scores_gemma":[0.19302627,0.00075225334,0.7903886,0.000117092684,0.000080990394,0.00008989048,0.00074545346,0.003967792,0.010831622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.000059438524,0.000021560696,0.000048152415,0.000350265,0.00007351882],"domain_scores_gemma":[0.99897015,0.00051340665,0.00004641045,0.00021023236,0.00017400908,0.000085789856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003654792,0.001829368,0.0014235318,0.00080835813,0.00049499114,0.0027980185,0.0016956048,0.0011737708,0.016033646],"category_scores_gemma":[0.002294126,0.0010740596,0.0010507036,0.00088687247,0.0005542239,0.0015224129,0.0023220167,0.0026298498,0.0031391243],"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.0013451072,0.00019379216,0.00064731453,0.0007406939,0.00009486597,0.0009547412,0.000877538,0.13067892,0.20444308,0.056774724,0.03281784,0.5704314],"study_design_scores_gemma":[0.00013744686,0.0000936461,0.00037460652,0.000086062755,0.000035890804,0.00050190126,0.00012193246,0.8907238,0.07089118,0.019359061,0.017619977,0.000054533237],"about_ca_topic_score_codex":0.0016346992,"about_ca_topic_score_gemma":0.003045671,"teacher_disagreement_score":0.016033646,"about_ca_system_score_codex":0.00053866085,"about_ca_system_score_gemma":0.00043891626,"threshold_uncertainty_score":0.05363792},"labels":[],"label_agreement":null},{"id":"W2951737368","doi":"10.1007/978-3-030-22368-7_1","title":"The Fractional Harris-Laplace Feature Detector","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","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 Calgary","funders":"","keywords":"Laplace transform; Fractional calculus; Computer science; Grayscale; Feature (linguistics); Detector; Artificial intelligence; Pixel; Calculus (dental); Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Telecommunications","score_opus":0.008630476127952045,"score_gpt":0.23230437972789675,"score_spread":0.2236739035999447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951737368","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.0060188463,0.0020163695,0.97934246,0.00025184677,0.00034807093,0.00002735214,0.00009182117,0.0014131265,0.010490124],"genre_scores_gemma":[0.23803543,0.0039983056,0.71960455,0.00044781566,0.00047514052,0.000055517172,0.0005103504,0.00027555373,0.03659733],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997954,0.000017768703,0.000008411379,0.000049186794,0.000102201426,0.000026962913],"domain_scores_gemma":[0.99975616,0.00006681898,0.000017349079,0.00005169313,0.00009132411,0.000016646223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003591524,0.00039085714,0.0007168821,0.0011126895,0.00029605645,0.0012162959,0.00082057423,0.0010021657,0.004969832],"category_scores_gemma":[0.0010897632,0.00028189778,0.00043233566,0.0012683861,0.00039623925,0.001336245,0.0005800356,0.00070616265,0.003078595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001336771,0.000033039476,0.00021615095,0.00010088543,0.000017083063,0.000096240765,0.000022760707,0.00744527,0.042449206,0.038725324,0.008370957,0.90238947],"study_design_scores_gemma":[0.0000369379,0.00024375456,0.0015579843,0.00006286297,0.000083118044,0.002199181,0.000045307224,0.7373733,0.0868524,0.06345912,0.10800048,0.00008553466],"about_ca_topic_score_codex":0.0007503858,"about_ca_topic_score_gemma":0.00066634594,"teacher_disagreement_score":0.004969832,"about_ca_system_score_codex":0.0004977757,"about_ca_system_score_gemma":0.00050160417,"threshold_uncertainty_score":0.016625762},"labels":[],"label_agreement":null},{"id":"W2951902026","doi":"10.1007/978-3-030-22514-8_5","title":"Two-Layer Feature Selection Algorithm for Recognizing Human Emotions from 3D Motion Analysis","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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 Calgary","funders":"","keywords":"Sadness; Computer science; Artificial intelligence; Emotion classification; Motion (physics); Feature selection; Biometrics; Feature (linguistics); Anger; Happiness; Selection (genetic algorithm); Filter (signal processing); Pattern recognition (psychology); Machine learning; Computer vision; Psychology","score_opus":0.02707550304794408,"score_gpt":0.27499855068054285,"score_spread":0.24792304763259876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951902026","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.029764198,0.00054765644,0.96519554,0.000084222374,0.00010187497,0.00014550974,0.00025571947,0.0028535011,0.001051854],"genre_scores_gemma":[0.24156944,0.00048622634,0.74445796,0.00021287831,0.00006943068,0.0004949885,0.001719057,0.0002030445,0.0107870065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996878,0.000023342405,0.000024708537,0.000088805245,0.0001109238,0.00006449152],"domain_scores_gemma":[0.99979514,0.000042300562,0.00001240894,0.00002006084,0.000114011615,0.000016050339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005879018,0.0010160393,0.0011379318,0.0008377774,0.00045362438,0.0005410003,0.0010942859,0.000707756,0.003558598],"category_scores_gemma":[0.00045466487,0.0003677648,0.00089356955,0.00081393606,0.00019869582,0.0004889614,0.00069024536,0.0006060994,0.0017958182],"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.0003126752,0.00016084508,0.0011981488,0.00005745553,0.00007535049,0.000068011715,0.000040777715,0.006996904,0.08981352,0.00053317146,0.005278242,0.89546496],"study_design_scores_gemma":[0.00008088148,0.00035716954,0.014305215,0.000028311413,0.0001465326,0.00033306153,0.000076664735,0.878024,0.098743215,0.0011756016,0.0066713355,0.000058011527],"about_ca_topic_score_codex":0.0059593455,"about_ca_topic_score_gemma":0.0075373077,"teacher_disagreement_score":0.0059593455,"about_ca_system_score_codex":0.0003879988,"about_ca_system_score_gemma":0.0007904292,"threshold_uncertainty_score":0.0119047165},"labels":[],"label_agreement":null},{"id":"W2951914034","doi":"10.1007/978-3-030-23207-8_51","title":"Learning from Videos Showing a Dialog Fosters More Positive Affect Than Learning from a Monolog","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Carleton University","funders":"","keywords":"Dialog box; TUTOR; Affect (linguistics); Computer science; Context (archaeology); Multimedia; Human–computer interaction; Mathematics education; Psychology; World Wide Web; Communication","score_opus":0.04087193385484855,"score_gpt":0.32250130884118844,"score_spread":0.2816293749863399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951914034","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.9673122,0.00025047298,0.0026766467,0.00039062518,0.00037096243,0.00011116537,0.000116427116,0.0002539747,0.028517494],"genre_scores_gemma":[0.9503257,0.00038972782,0.0065916777,0.0006038463,0.000101978185,0.000255962,0.00020334314,0.00012839779,0.041399393],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996401,0.000118107615,0.000013361583,0.00008410045,0.000092785456,0.000051547428],"domain_scores_gemma":[0.99831843,0.00092904747,0.0001424212,0.00012575951,0.00008836314,0.00039608858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071188476,0.00038738176,0.0002990681,0.00015263598,0.00033280824,0.00087620877,0.00022933281,0.00046554444,0.014509694],"category_scores_gemma":[0.0029902204,0.00012979757,0.00023117097,0.000101380785,0.00021083863,0.00056240615,0.0006171539,0.0009868757,0.0023966953],"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.004313635,0.019248528,0.015239766,0.0007288144,0.00014970473,0.00028722675,0.005331566,0.00054954726,0.402302,0.0014342662,0.016358677,0.5340561],"study_design_scores_gemma":[0.0017559257,0.055677183,0.50416744,0.0007677666,0.0011217463,0.00159696,0.0142974,0.007821617,0.30897236,0.009080384,0.09437208,0.0003692067],"about_ca_topic_score_codex":0.0003272927,"about_ca_topic_score_gemma":0.0006831979,"teacher_disagreement_score":0.014509694,"about_ca_system_score_codex":0.00018461709,"about_ca_system_score_gemma":0.00023895303,"threshold_uncertainty_score":0.048539817},"labels":[],"label_agreement":null},{"id":"W2952300993","doi":"10.1007/978-3-030-21562-0_5","title":"An Adaptive Blended Learning Health Education Model for Families of a Parent with Serious Medical Problems","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Family and Disability Support Research","field":"Psychology","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 Ontario Institute of Technology","funders":"","keywords":"Blended learning; Computer science; Medical knowledge; Knowledge management; Artificial intelligence; Educational technology; Medical education; Psychology; Mathematics education; Medicine","score_opus":0.049190086420965506,"score_gpt":0.36183883669773653,"score_spread":0.312648750276771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952300993","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.82614917,0.00026599507,0.12993152,0.002002687,0.00021463646,0.00048291002,0.00024694754,0.0009515471,0.03975459],"genre_scores_gemma":[0.91496146,0.00026391764,0.06549256,0.00029207423,0.000022037362,0.00039902344,0.00022711215,0.000035007797,0.018306866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986947,0.00004452487,0.000005887642,0.000022185217,0.000029575478,0.000028448698],"domain_scores_gemma":[0.99969864,0.000112438676,0.000015646594,0.000022090482,0.0000342462,0.00011704915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034432329,0.00026721798,0.00013129057,0.00023910597,0.00041906367,0.0006857056,0.0008378373,0.00062539376,0.0076390174],"category_scores_gemma":[0.0011267649,0.00008012368,0.00027763838,0.0001497584,0.00013454813,0.0007124575,0.001316111,0.0005688689,0.00074579974],"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.00083882856,0.013523361,0.01001934,0.000115850504,0.00003849217,0.0009067011,0.004145229,0.006921251,0.0055345637,0.005255905,0.012120592,0.9405799],"study_design_scores_gemma":[0.0028691993,0.022058915,0.12167573,0.0012057987,0.0005696843,0.013402264,0.03165108,0.51954,0.037287004,0.06447834,0.18486516,0.0003968498],"about_ca_topic_score_codex":0.0010297823,"about_ca_topic_score_gemma":0.0013579199,"teacher_disagreement_score":0.0076390174,"about_ca_system_score_codex":0.00033431046,"about_ca_system_score_gemma":0.0007485257,"threshold_uncertainty_score":0.025555074},"labels":[],"label_agreement":null},{"id":"W2952962476","doi":"10.1007/978-3-319-78723-7_37","title":"Quality Assessment of High-Throughput DNA Sequencing Data via Range Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Quality (philosophy); Data mining; Range (aeronautics); Quality assessment; Quality Score; Interval (graph theory); Filter (signal processing); Software; Throughput; Algorithm; Reliability engineering; Metric (unit); Mathematics; Evaluation methods","score_opus":0.05035664577168892,"score_gpt":0.31935374656117277,"score_spread":0.26899710078948386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952962476","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.019706286,0.00082133536,0.9709253,0.000121891426,0.00008171207,0.00011576605,0.0012090758,0.00597087,0.0010477684],"genre_scores_gemma":[0.07639462,0.00061392726,0.91573584,0.00013358991,0.0000678486,0.00018716064,0.0041673523,0.0015192904,0.0011803708],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99323,0.0014896869,0.00065634644,0.0011371456,0.0032607913,0.00022610322],"domain_scores_gemma":[0.9813985,0.008615789,0.001792156,0.0030254086,0.0049093952,0.00025862863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008162998,0.0010820847,0.0012243884,0.0045987437,0.00069696724,0.0037701337,0.0022210756,0.0009846073,0.0026652885],"category_scores_gemma":[0.024601934,0.00071873184,0.0018255771,0.0038772062,0.00091772265,0.0022948224,0.00180594,0.0019672166,0.0027468735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059304154,0.00015375778,0.017874895,0.0012160672,0.00045162672,0.0002780561,0.00054487126,0.014932734,0.29110155,0.0068095922,0.0057662693,0.66027755],"study_design_scores_gemma":[0.00006195385,0.00038362524,0.030673094,0.00034393062,0.0004949083,0.0022119565,0.00037538243,0.42927113,0.48540938,0.02946461,0.020975221,0.00033484874],"about_ca_topic_score_codex":0.00083168433,"about_ca_topic_score_gemma":0.0010328946,"teacher_disagreement_score":0.008162998,"about_ca_system_score_codex":0.0005964729,"about_ca_system_score_gemma":0.000647892,"threshold_uncertainty_score":0.04317051},"labels":[],"label_agreement":null},{"id":"W29530736","doi":"10.1007/978-3-642-41905-8_10","title":"Globally Rigid Ball-Polyhedra in Euclidean 3-Space","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Polyhedron; Ball (mathematics); Regular polygon; Rigidity (electromagnetism); Euclidean space; Euclidean geometry; Convex body; Mathematics; Combinatorics; Computer science; Geometry; Convex optimization; Physics","score_opus":0.01262976441198229,"score_gpt":0.23869491168733967,"score_spread":0.22606514727535737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29530736","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024739448,0.0009076478,0.9251249,0.00031350454,0.0002712196,0.00007332094,0.00043656706,0.0005687271,0.04756456],"genre_scores_gemma":[0.39714822,0.0027581805,0.51022536,0.00019512301,0.00020432146,0.00026660922,0.0016126398,0.0013906631,0.08619897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957675,0.00006432785,0.000023325705,0.00007424348,0.00023148874,0.000029832325],"domain_scores_gemma":[0.9998074,0.00004714169,0.000021632577,0.000052940137,0.000045777477,0.000025097052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025529834,0.0009795009,0.0010851874,0.0008197044,0.000761122,0.0015925377,0.001414341,0.0009590993,0.008373225],"category_scores_gemma":[0.00084811635,0.000630069,0.0005670135,0.0013385925,0.0020400875,0.0015509836,0.0025706934,0.0021477146,0.003323772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004693038,0.000018298715,0.00012578149,0.00019332374,0.0000126934265,0.00008307506,0.000277732,0.08396375,0.0041526183,0.8210824,0.006986314,0.08305708],"study_design_scores_gemma":[0.000021079111,0.00007141787,0.0002333204,0.000081739454,0.000009717855,0.0002681578,0.0002153484,0.17634316,0.0022553334,0.7662517,0.05421892,0.000030080246],"about_ca_topic_score_codex":0.0018771993,"about_ca_topic_score_gemma":0.0019344883,"teacher_disagreement_score":0.008373225,"about_ca_system_score_codex":0.0006190806,"about_ca_system_score_gemma":0.00045974637,"threshold_uncertainty_score":0.028011262},"labels":[],"label_agreement":null},{"id":"W2953476352","doi":"10.1007/978-3-031-24337-0_24","title":"Multiplicative Models for Recurrent Language Modeling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Recurrent neural network; Language model; Multiplicative function; Artificial intelligence; Relevance (law); Parametrization (atmospheric modeling); Simple (philosophy); Theoretical computer science; Artificial neural network; Natural language processing; Machine learning; Mathematics","score_opus":0.05669957815851957,"score_gpt":0.29500257596396456,"score_spread":0.238302997805445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953476352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001219698,0.0015123137,0.9938624,0.00031447396,0.0001948112,0.000012379334,0.00014742107,0.00047875728,0.0022578149],"genre_scores_gemma":[0.2572859,0.009316481,0.64367396,0.0013792528,0.00271003,0.00069129356,0.003316183,0.0024475085,0.07917938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881124,0.0006008621,0.00007734623,0.00023652443,0.00019663265,0.00007745688],"domain_scores_gemma":[0.9958668,0.0031788733,0.0001468918,0.00046722937,0.00027005814,0.00007023629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973034,0.0015733584,0.0016034701,0.00078874454,0.0004471524,0.0019889541,0.002615379,0.0019781762,0.009858529],"category_scores_gemma":[0.0086027235,0.0011103384,0.0018313208,0.0013516776,0.0006986104,0.0034904694,0.0015796428,0.003705911,0.006141008],"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.00010617702,0.00011495626,0.00045819703,0.00047506028,0.00026585435,0.00021050408,0.0002951361,0.13083403,0.0049736775,0.61545396,0.028179158,0.21863326],"study_design_scores_gemma":[0.0000112352345,0.000026163892,0.000112621885,0.000029910949,0.000048094866,0.000078310324,0.000016424725,0.66614556,0.00074744545,0.32409117,0.008669523,0.000023543898],"about_ca_topic_score_codex":0.001679414,"about_ca_topic_score_gemma":0.0031253907,"teacher_disagreement_score":0.009858529,"about_ca_system_score_codex":0.0007671403,"about_ca_system_score_gemma":0.0006007834,"threshold_uncertainty_score":0.032980025},"labels":[],"label_agreement":null},{"id":"W2953799021","doi":"10.1007/978-3-030-23220-7_6","title":"A Flexible Categorial Formalisation of Term Graphs as Directed Hypergraphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Executable; Programming language; Compiler; Term (time); Functional programming; Implementation; Theoretical computer science; Generic programming","score_opus":0.017814269405754566,"score_gpt":0.24130968264184555,"score_spread":0.22349541323609098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953799021","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.0030915146,0.0021964645,0.93391424,0.00095839455,0.00069663965,0.00009010481,0.0003029543,0.00088388793,0.057865836],"genre_scores_gemma":[0.15676574,0.006283624,0.7615182,0.001415053,0.00072638615,0.000515582,0.0010895979,0.0016416186,0.0700442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899095,0.00029425242,0.00008788889,0.00024802625,0.00030562936,0.000073256175],"domain_scores_gemma":[0.9985183,0.00073317776,0.00009194604,0.00035718293,0.00023426976,0.000065180495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015583787,0.00068308273,0.00045764953,0.0019378896,0.0008900402,0.003750217,0.001796568,0.0012143638,0.008109506],"category_scores_gemma":[0.0027472838,0.0006158037,0.001087834,0.002222268,0.0038524347,0.008572864,0.0023889462,0.0045701293,0.002690574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035131495,0.0000039181327,0.000021543237,0.000047322657,0.0000031547338,0.0000360401,0.00022238023,0.000843824,0.0010107774,0.9876002,0.0014914073,0.008715927],"study_design_scores_gemma":[0.000006444566,0.00001027112,0.00004942481,0.00007615823,0.000010279342,0.00014346815,0.0000965915,0.0054676756,0.0010419897,0.86617035,0.12691146,0.000015916738],"about_ca_topic_score_codex":0.0012811964,"about_ca_topic_score_gemma":0.0017871114,"teacher_disagreement_score":0.008109506,"about_ca_system_score_codex":0.0017032105,"about_ca_system_score_gemma":0.0009985127,"threshold_uncertainty_score":0.027128994},"labels":[],"label_agreement":null},{"id":"W2953966422","doi":"10.1007/978-3-030-24305-0_2","title":"A Multivariate Econometric Analysis for the Forecasting of the Interdependences Between the Housing Prices and the Socio-economic Factors in the City of Barcelona (Spain)","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Housing Market and Economics","field":"Economics, Econometrics and Finance","cited_by":9,"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":"Real estate; Metropolitan area; Quarter (Canadian coin); Volatility (finance); Investment (military); Econometrics; Unemployment; Multivariate statistics; Econometric model; Economics; Operations research; Computer science; Macroeconomics; Finance; Geography; Mathematics","score_opus":0.05542133705062848,"score_gpt":0.24130428524732245,"score_spread":0.18588294819669396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953966422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21431936,0.0044812155,0.77053785,0.0014467513,0.00037123027,0.00009748184,0.002129436,0.0013428135,0.0052738236],"genre_scores_gemma":[0.7881792,0.0029447018,0.19282573,0.00010358294,0.00055542577,0.0001984012,0.0029256504,0.00018091979,0.012086427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.00044744427,0.000047764384,0.0001128316,0.00008221978,0.00006679234],"domain_scores_gemma":[0.9974825,0.002097176,0.00009928139,0.00010853476,0.00016522419,0.000047434773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197551,0.0006746655,0.0007740256,0.0019659747,0.00028966359,0.0009569853,0.00084935286,0.00071344303,0.0045062937],"category_scores_gemma":[0.0046154875,0.00045265837,0.0015300681,0.0016386237,0.00030277876,0.00071203266,0.0006540639,0.00093592383,0.0007237721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039082818,0.00026695296,0.04434459,0.00016594458,0.0004722338,0.0002701934,0.00012577424,0.5288504,0.0023196419,0.014522266,0.010212203,0.39805898],"study_design_scores_gemma":[0.000016747312,0.000044630207,0.018832995,0.000016674274,0.000050595514,0.000037122205,0.00003737349,0.97559196,0.0002486476,0.003774708,0.0013269098,0.000021637647],"about_ca_topic_score_codex":0.039638683,"about_ca_topic_score_gemma":0.029782187,"teacher_disagreement_score":0.039638683,"about_ca_system_score_codex":0.00092697766,"about_ca_system_score_gemma":0.0011493405,"threshold_uncertainty_score":0.07881594},"labels":[],"label_agreement":null},{"id":"W2954032409","doi":"10.1007/978-3-030-24289-3_42","title":"Privacy vs. Utility: An Enhanced K-coRated","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Collaborative filtering; Publication; Recommender system; Context (archaeology); Information privacy; Privacy software; Differential privacy; Internet privacy; Data mining; World Wide Web","score_opus":0.03168070653693565,"score_gpt":0.27302759476429767,"score_spread":0.241346888227362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954032409","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.017498141,0.00079149,0.93392193,0.0027563097,0.000479044,0.0003472135,0.0007608891,0.0025892898,0.040855784],"genre_scores_gemma":[0.48025262,0.0008871037,0.4721532,0.0015807397,0.00037295747,0.0003564357,0.00093960215,0.0015019125,0.041955512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876208,0.0036007992,0.0009641216,0.0022333267,0.00412447,0.0014565751],"domain_scores_gemma":[0.97967416,0.0053910674,0.00055390684,0.011062155,0.002709127,0.00060955854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066264104,0.0008740941,0.0020967417,0.0015166049,0.003913959,0.0073964046,0.006572657,0.0029790793,0.018459046],"category_scores_gemma":[0.023610178,0.0010370481,0.002756415,0.0046798475,0.0055121877,0.016901636,0.015931498,0.0055702287,0.004345855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006564332,0.0001534491,0.0005300205,0.0002803823,0.000073321164,0.00029331094,0.00051958015,0.01707667,0.0026050708,0.8789433,0.010276142,0.08859228],"study_design_scores_gemma":[0.00007741303,0.000111573034,0.00021300353,0.00008690775,0.00011136,0.00059337507,0.0001417281,0.15253772,0.005147565,0.80662817,0.034272302,0.00007891532],"about_ca_topic_score_codex":0.0034646154,"about_ca_topic_score_gemma":0.0030246512,"teacher_disagreement_score":0.018459046,"about_ca_system_score_codex":0.0044840784,"about_ca_system_score_gemma":0.005615756,"threshold_uncertainty_score":0.061751664},"labels":[],"label_agreement":null},{"id":"W2954251248","doi":"10.1007/978-3-030-23220-7_5","title":"Finite Limits and Anti-unification in Substitution Categories","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Unification; Morphism; Mathematical proof; Substitution (logic); Computer science; Arrow; Algebra over a field; Mathematics; Pure mathematics; Programming language; Geometry","score_opus":0.017021689750149425,"score_gpt":0.2296796129914109,"score_spread":0.21265792324126148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954251248","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15540753,0.021046354,0.40868294,0.004446785,0.0014891335,0.00006099912,0.00022971175,0.00067998475,0.4079566],"genre_scores_gemma":[0.8780714,0.0054062777,0.04284573,0.000696165,0.00057580107,0.00009875876,0.00024034601,0.00021970496,0.07184585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984647,0.0005182805,0.00011456254,0.00028289625,0.00047638756,0.00014325386],"domain_scores_gemma":[0.99842083,0.00088829955,0.00008152999,0.000264688,0.00023881962,0.000105792285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520077,0.000390481,0.00050002575,0.0012743002,0.0015448357,0.00321173,0.00090430287,0.001149727,0.004835494],"category_scores_gemma":[0.0036042624,0.00045097238,0.00070665806,0.0012591537,0.005881233,0.008369832,0.0032227996,0.003044604,0.0011292229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024113124,0.0000019058942,0.000037209044,0.000016369255,0.0000013155994,0.000024172148,0.00025137755,0.000092017064,0.00018019881,0.9960897,0.00023305565,0.0030702527],"study_design_scores_gemma":[0.0000021012904,0.0000050207655,0.000058555594,0.00002395673,0.0000029485766,0.00007912664,0.00011357232,0.00063364406,0.0004404662,0.9850873,0.013548643,0.0000046734276],"about_ca_topic_score_codex":0.001144572,"about_ca_topic_score_gemma":0.00073224265,"teacher_disagreement_score":0.004835494,"about_ca_system_score_codex":0.0015879447,"about_ca_system_score_gemma":0.000844704,"threshold_uncertainty_score":0.016176343},"labels":[],"label_agreement":null},{"id":"W2954319419","doi":"10.1007/978-3-030-24258-9_12","title":"Simplifying CDCL Clause Database Reduction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Computer science; Reduction (mathematics); Simple (philosophy); Sorting; Solver; Scheme (mathematics); Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.04248878874882649,"score_gpt":0.30148621342021886,"score_spread":0.25899742467139236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954319419","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.027798554,0.0024280616,0.68762386,0.002424535,0.0014066695,0.00034183322,0.0020609146,0.009543715,0.26637185],"genre_scores_gemma":[0.3995951,0.0034562368,0.4157355,0.0021369697,0.00071330514,0.00036692215,0.0074058315,0.004834902,0.16575529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822587,0.000265203,0.000079402555,0.00030984858,0.0008966998,0.00022309045],"domain_scores_gemma":[0.9985253,0.0005437478,0.000024556477,0.0005962813,0.00027708337,0.00003307162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068285386,0.00081480877,0.0010228398,0.0017231953,0.0010935997,0.0028571875,0.0023922133,0.00079555786,0.03507716],"category_scores_gemma":[0.0032673609,0.00075806736,0.001249554,0.002948932,0.001342528,0.0042188778,0.0034109012,0.0036781034,0.011113541],"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.00013673004,0.00014480903,0.0002197499,0.0004592643,0.000044244232,0.00019519069,0.00030558708,0.00583824,0.010417558,0.61360705,0.05788021,0.31075138],"study_design_scores_gemma":[0.000094022165,0.000046711193,0.00031477222,0.00011992223,0.00012191626,0.0003903758,0.00024865684,0.028242387,0.031953182,0.72869414,0.20972408,0.00004981246],"about_ca_topic_score_codex":0.0028932584,"about_ca_topic_score_gemma":0.004560311,"teacher_disagreement_score":0.03507716,"about_ca_system_score_codex":0.0014277119,"about_ca_system_score_gemma":0.0013146938,"threshold_uncertainty_score":0.1173448},"labels":[],"label_agreement":null},{"id":"W2954822106","doi":"10.1007/978-3-031-24340-0_26","title":"Audio Summarization with Audio Features and Probability Distribution Divergence","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"Polytechnique Montréal","funders":"","keywords":"Automatic summarization; Computer science; Speech recognition; Probability distribution; Artificial intelligence; Statistics; Mathematics","score_opus":0.015712462987541483,"score_gpt":0.22476093342169456,"score_spread":0.2090484704341531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954822106","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.0062059136,0.000427399,0.9906985,0.00008798421,0.000086054155,0.000047707665,0.00013357047,0.0013167703,0.000996089],"genre_scores_gemma":[0.24216333,0.00080627995,0.7416698,0.00015811982,0.00061308895,0.00019766994,0.0025537468,0.0007930597,0.011044903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993168,0.00012102761,0.00006421828,0.00018551169,0.00025556583,0.00005686706],"domain_scores_gemma":[0.99883,0.00049580215,0.00010711374,0.0001736851,0.00034141316,0.000051932097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008667698,0.0010605202,0.0012839297,0.0017891012,0.00047218287,0.0014096329,0.0010175019,0.0010414256,0.0036791489],"category_scores_gemma":[0.003069793,0.0004687233,0.0010003743,0.0016289327,0.00036746167,0.0021202143,0.0013478359,0.0012564198,0.0025011196],"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.0005252892,0.00011361695,0.00048348092,0.00023917473,0.00011634768,0.00018819755,0.00009123093,0.039552175,0.058845136,0.007087079,0.0057404516,0.8870178],"study_design_scores_gemma":[0.000051681593,0.000218448,0.0015251415,0.000029409675,0.00010269509,0.00024566086,0.000071467315,0.9501605,0.025825437,0.015415199,0.0063158805,0.00003854531],"about_ca_topic_score_codex":0.0012161423,"about_ca_topic_score_gemma":0.0017528306,"teacher_disagreement_score":0.0036791489,"about_ca_system_score_codex":0.00036963262,"about_ca_system_score_gemma":0.00041461043,"threshold_uncertainty_score":0.0123080015},"labels":[],"label_agreement":null},{"id":"W2954853821","doi":"10.1007/978-3-030-23247-4_16","title":"Nondeterminism Growth and State Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Combinatorics; Nondeterministic algorithm; Path (computing); Discrete mathematics; Tree (set theory); Bounding overwatch; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; State (computer science); Degree (music); Automaton; Algorithm; Computer science; Physics; Automata theory; Theoretical computer science","score_opus":0.01937335753452985,"score_gpt":0.2362460321222283,"score_spread":0.21687267458769846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954853821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33789018,0.005115384,0.40216568,0.010019176,0.000396785,0.00016904698,0.0012460839,0.0008932033,0.24210453],"genre_scores_gemma":[0.937866,0.0019527248,0.028715797,0.00019671816,0.0003519097,0.0002098284,0.00043036276,0.0002550293,0.030021569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981883,0.00035174505,0.00011121255,0.00040651707,0.0007159324,0.00022618874],"domain_scores_gemma":[0.9748574,0.020081758,0.00084815687,0.0025882856,0.0011674708,0.0004569288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015794443,0.0004783529,0.0010748339,0.0012589745,0.0012215228,0.004185389,0.0013347066,0.0011722127,0.008775417],"category_scores_gemma":[0.01740022,0.0007489498,0.0009276429,0.0015866146,0.0037587227,0.014451825,0.0022750695,0.004993409,0.00086207775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000320824,0.000020762289,0.0003721047,0.000057647572,0.0000055209057,0.00004177241,0.00020542617,0.0068009123,0.00081024395,0.9782347,0.0011408457,0.012277998],"study_design_scores_gemma":[0.000004111252,0.000005285032,0.00017002106,0.0000072958765,0.0000042065126,0.000043145606,0.00003111469,0.021494474,0.0006759953,0.975636,0.0019222954,0.000006132341],"about_ca_topic_score_codex":0.0008279986,"about_ca_topic_score_gemma":0.0006744315,"teacher_disagreement_score":0.008775417,"about_ca_system_score_codex":0.0023989493,"about_ca_system_score_gemma":0.0009696711,"threshold_uncertainty_score":0.029356658},"labels":[],"label_agreement":null},{"id":"W2954987224","doi":"10.1007/978-3-030-22999-3_72","title":"Pareto Optimality for Conditional Preference Networks with Comfort","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Preference; Pareto optimal; Computer science; Pareto principle; Mathematical optimization; Outcome (game theory); Multi-objective optimization; Mathematical economics; Mathematics; Machine learning; Statistics","score_opus":0.023647710679425584,"score_gpt":0.2384754124040585,"score_spread":0.21482770172463292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954987224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026306165,0.0005016085,0.9025429,0.00093799253,0.00009743451,0.00010208906,0.00037268165,0.00010981173,0.06902931],"genre_scores_gemma":[0.6804238,0.001957627,0.25026038,0.0006056464,0.00038828928,0.00086666935,0.0009099246,0.00032564977,0.06426205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975961,0.001156986,0.00010308415,0.0002948383,0.00053061434,0.00031834902],"domain_scores_gemma":[0.9944364,0.004178185,0.00025983894,0.000395709,0.000427359,0.00030247265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038496214,0.0014485774,0.0016012287,0.0015394686,0.0014061508,0.0034410427,0.0020244939,0.0015503716,0.016990174],"category_scores_gemma":[0.0117028495,0.00095079065,0.0018852224,0.0026432676,0.0026850814,0.005480727,0.0029667122,0.004377966,0.0011937898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050295243,0.000030177593,0.0001146451,0.000066867935,0.000023888222,0.000020759158,0.000082045044,0.0583006,0.00026046077,0.9252098,0.0020492512,0.013791224],"study_design_scores_gemma":[0.000012081467,0.00001855551,0.00010381224,0.000027906175,0.000011408978,0.000021509359,0.000036180594,0.11983258,0.00014367176,0.87796915,0.0018123005,0.000010850484],"about_ca_topic_score_codex":0.0033130962,"about_ca_topic_score_gemma":0.003649531,"teacher_disagreement_score":0.016990174,"about_ca_system_score_codex":0.003891618,"about_ca_system_score_gemma":0.0018017001,"threshold_uncertainty_score":0.056837857},"labels":[],"label_agreement":null},{"id":"W2955105335","doi":"10.1007/978-3-030-44223-1_27","title":"A Note on the Instantiability of the Quantum Random Oracle","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Standard Model (mathematical formulation); Hash function; Oracle; Mathematical proof; Provable security; Quantum; Theoretical computer science; Cryptography; Computer security; Encryption; Mathematics; Public-key cryptography; Quantum mechanics; Programming language; Physics","score_opus":0.01809138364689299,"score_gpt":0.23870501825698553,"score_spread":0.22061363461009253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955105335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013257802,0.01669742,0.52348816,0.017937412,0.0048672566,0.00011455543,0.00045330328,0.00046149112,0.42272267],"genre_scores_gemma":[0.6690856,0.02277515,0.20156084,0.0077372505,0.011880958,0.0005043031,0.00082282204,0.0010924548,0.08454062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951521,0.0019948282,0.00030219427,0.0009996721,0.001170767,0.00038039518],"domain_scores_gemma":[0.9896618,0.0074861194,0.00019860934,0.0021641848,0.00030767435,0.00018168445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005092304,0.0011908256,0.0020879614,0.0014824958,0.002398567,0.0053110765,0.0025185116,0.0028610076,0.010730838],"category_scores_gemma":[0.014499887,0.0012651839,0.0031354318,0.0021675972,0.014055589,0.018466469,0.006924974,0.013482088,0.0022552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006686697,0.0000029029611,0.000016916996,0.000013821728,0.000002809517,0.000019527059,0.000028459997,0.00017969494,0.00006726156,0.9967452,0.00086834526,0.0020483648],"study_design_scores_gemma":[0.0000038630324,0.000004625217,0.000026451502,0.000011123289,0.000003529286,0.000031912077,0.000005639783,0.0007670847,0.00011530305,0.99331796,0.005707044,0.000005556335],"about_ca_topic_score_codex":0.0014850624,"about_ca_topic_score_gemma":0.00069545646,"teacher_disagreement_score":0.010730838,"about_ca_system_score_codex":0.0022573918,"about_ca_system_score_gemma":0.0011440652,"threshold_uncertainty_score":0.03589821},"labels":[],"label_agreement":null},{"id":"W2955229755","doi":"10.1007/978-3-030-23247-4_15","title":"State Complexity of Simple Splicing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"RNA splicing; Regular language; Axiom; Theoretical computer science; Computer science; Recursively enumerable language; Finite-state machine; Mathematics; Discrete mathematics; Algorithm; Genetics; Automaton; Biology; RNA","score_opus":0.02795678863435677,"score_gpt":0.264530784009426,"score_spread":0.2365739953750692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955229755","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.7460298,0.00092817226,0.113237,0.0031773197,0.00020707183,0.000057512847,0.0010578111,0.0005753443,0.13473],"genre_scores_gemma":[0.9878808,0.00029057116,0.00402237,0.00012820814,0.00020037242,0.000051567677,0.00035456568,0.00008984655,0.0069816234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00011597002,0.000028488492,0.00009816694,0.00025198556,0.00010620158],"domain_scores_gemma":[0.9962585,0.0027105722,0.0002617302,0.0003568228,0.00021081818,0.00020155971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006614017,0.00044205133,0.0009815267,0.0011009203,0.0010532385,0.0027400688,0.0010589653,0.0010791282,0.00973712],"category_scores_gemma":[0.0044802106,0.00040058492,0.00081166445,0.0010277765,0.0019688238,0.0040776925,0.0013816284,0.002202521,0.0007410683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006502291,0.000028343164,0.00026701656,0.000033101773,0.000009596808,0.00005730508,0.00009691323,0.010300174,0.0010410215,0.9814068,0.0013184291,0.0053763366],"study_design_scores_gemma":[0.0000067626534,0.000008991621,0.00024080835,0.0000036206332,0.000004063212,0.000032459684,0.000013834955,0.04063128,0.00034300823,0.9583996,0.0003071485,0.000008408732],"about_ca_topic_score_codex":0.0006644682,"about_ca_topic_score_gemma":0.00047761705,"teacher_disagreement_score":0.00973712,"about_ca_system_score_codex":0.0010043604,"about_ca_system_score_gemma":0.00060069695,"threshold_uncertainty_score":0.03257394},"labels":[],"label_agreement":null},{"id":"W2955430035","doi":"10.1007/978-3-030-31500-9_6","title":"On Privacy Risks of Public WiFi Captive Portals","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":"Concordia University","funders":"","keywords":"BitTorrent tracker; Login; Internet privacy; World Wide Web; Personally identifiable information; Hotspot (geology); Computer science; Service provider; Business; Computer security; Service (business); Eye tracking","score_opus":0.08699538027296039,"score_gpt":0.35892654829191756,"score_spread":0.27193116801895717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955430035","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.44636756,0.0038242203,0.38106447,0.012915801,0.0004102449,0.00022064584,0.0007958427,0.001118295,0.15328288],"genre_scores_gemma":[0.98907244,0.00040518638,0.005720589,0.00024046985,0.00008954367,0.00003457969,0.00008902639,0.000058254118,0.004290086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9890576,0.004288598,0.00031052032,0.0010885843,0.0035353347,0.0017192406],"domain_scores_gemma":[0.93735075,0.04183503,0.003707999,0.013409306,0.0029355073,0.0007613375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007776463,0.0006305156,0.00090668927,0.0018258179,0.0027629002,0.0066081677,0.0018417167,0.004945939,0.008645425],"category_scores_gemma":[0.05412363,0.0007785291,0.00091495056,0.0020464133,0.0046586795,0.010523186,0.005090131,0.004494297,0.0013725681],"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.0013486142,0.00017634073,0.010143974,0.00023165232,0.00013928564,0.0010761226,0.001781838,0.049249552,0.0040431526,0.84007496,0.011355361,0.08037909],"study_design_scores_gemma":[0.00010509392,0.00026065274,0.0038116435,0.00025824184,0.00026636536,0.0032896362,0.0016794177,0.2167137,0.009471654,0.74149865,0.022523535,0.00012139758],"about_ca_topic_score_codex":0.0017675118,"about_ca_topic_score_gemma":0.0008633145,"teacher_disagreement_score":0.008645425,"about_ca_system_score_codex":0.0022380627,"about_ca_system_score_gemma":0.0009117672,"threshold_uncertainty_score":0.04112637},"labels":[],"label_agreement":null},{"id":"W2955570969","doi":"10.1007/978-3-030-23937-4_8","title":"Automated Segmentation of DCIS in Whole Slide Images","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Hospital","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Convolutional neural network; Pipeline (software); Artificial neural network; Pattern recognition (psychology); Test set; Net (polyhedron)","score_opus":0.011426354768060486,"score_gpt":0.2552363559027142,"score_spread":0.24381000113465373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955570969","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.15293115,0.009311285,0.79551613,0.0007347532,0.0004279308,0.0007198292,0.0035327736,0.011569288,0.02525684],"genre_scores_gemma":[0.23623602,0.0046833134,0.7227061,0.0002623862,0.00018450296,0.00021914992,0.004345068,0.0015749163,0.029788518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.00001691722,0.000014719451,0.000070658694,0.00008538808,0.000050391507],"domain_scores_gemma":[0.9995983,0.00012232133,0.000038055812,0.00008566012,0.00013408669,0.000021660833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035769062,0.0006275489,0.00054906507,0.00255403,0.00040877133,0.0016352875,0.00078752224,0.00084246846,0.00551852],"category_scores_gemma":[0.0006572138,0.0005588678,0.00051455724,0.0014931415,0.00030285848,0.0006333973,0.00047997962,0.0004490502,0.0037767643],"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.00023256363,0.000056562727,0.0016874735,0.00056166487,0.000061999905,0.00032769417,0.00016953703,0.003317877,0.42057455,0.0020793625,0.008729962,0.5622006],"study_design_scores_gemma":[0.000047906862,0.00024680325,0.032551635,0.00027835293,0.00023272059,0.0041385293,0.00038971618,0.17995666,0.6840897,0.0049446756,0.0930264,0.000096799624],"about_ca_topic_score_codex":0.0034741259,"about_ca_topic_score_gemma":0.008313644,"teacher_disagreement_score":0.00551852,"about_ca_system_score_codex":0.0005452862,"about_ca_system_score_gemma":0.00083214766,"threshold_uncertainty_score":0.018461287},"labels":[],"label_agreement":null},{"id":"W2955759369","doi":"10.1007/978-3-030-24258-9_11","title":"Speeding Up Assumption-Based SAT","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Solver; Boolean satisfiability problem; Maximum satisfiability problem; Simple (philosophy); Satisfiability; Conjunctive normal form; Propositional calculus; Propositional formula; Algorithm; Forcing (mathematics); Theoretical computer science; Mathematical optimization; Programming language; Mathematics; Boolean function; Propositional variable; Description logic","score_opus":0.039111113249432665,"score_gpt":0.291996833086991,"score_spread":0.2528857198375583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955759369","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.036955617,0.0010681506,0.88075775,0.0019101274,0.0011932537,0.00056160794,0.0016328746,0.033693686,0.042226985],"genre_scores_gemma":[0.33079907,0.0004897741,0.63599616,0.0012271825,0.00035109828,0.0006666895,0.0041451254,0.0036913173,0.02263364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99391633,0.001955965,0.00031311292,0.001179274,0.0017654116,0.00086989504],"domain_scores_gemma":[0.97552866,0.01569346,0.0004920302,0.0065578697,0.0013963156,0.00033163207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034022375,0.0020839612,0.0019942315,0.0017711958,0.0014756086,0.0030637893,0.0065189097,0.0018696426,0.06644935],"category_scores_gemma":[0.019151833,0.0018150209,0.0031096467,0.0029351264,0.0020772922,0.010471364,0.007785659,0.0061610127,0.013585659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024378507,0.0007130272,0.0018849714,0.0011974337,0.0003566032,0.00026995922,0.0003818114,0.1349563,0.013934511,0.13114974,0.07506464,0.6376531],"study_design_scores_gemma":[0.00047796968,0.00019912963,0.00044389456,0.00010478904,0.00018089663,0.00014341633,0.00018301904,0.77240306,0.010869689,0.19426677,0.02068789,0.000039397317],"about_ca_topic_score_codex":0.004718844,"about_ca_topic_score_gemma":0.012258947,"teacher_disagreement_score":0.06644935,"about_ca_system_score_codex":0.0024792205,"about_ca_system_score_gemma":0.004009324,"threshold_uncertainty_score":0.22229522},"labels":[],"label_agreement":null},{"id":"W2956427333","doi":"10.1007/978-3-030-32251-9_11","title":"Patient-Specific Conditional Joint Models of Shape, Image Features and Clinical Indicators","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; ZonMw; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Copula (linguistics); Artificial intelligence; Pattern recognition (psychology); Statistical model; Conditional probability distribution; Joint probability distribution; Marginal model; Dependency (UML); Marginal distribution; Mathematics; Data mining; Machine learning; Regression analysis; Statistics; Econometrics; Random variable","score_opus":0.023480368281346434,"score_gpt":0.28260393482929325,"score_spread":0.2591235665479468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956427333","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.2124586,0.0018465618,0.76700675,0.0028024877,0.00027373328,0.0002131771,0.010881715,0.0019535748,0.0025633893],"genre_scores_gemma":[0.95921963,0.0010993342,0.022066187,0.0003439801,0.00027290487,0.0003296199,0.0058767274,0.00022897501,0.010562514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825245,0.00062415464,0.00007922019,0.0005903823,0.00019677583,0.00025689945],"domain_scores_gemma":[0.9924758,0.0048638014,0.0008227359,0.0011066344,0.00043225416,0.0002986426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004932777,0.001492126,0.0022717782,0.001270988,0.00036356598,0.0024127902,0.003172253,0.003188801,0.0069380202],"category_scores_gemma":[0.012713894,0.0015971953,0.003488705,0.0019965759,0.0018148593,0.0017519965,0.0015913494,0.0030876598,0.0025298884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034116632,0.0006439771,0.08851625,0.00041464317,0.0014064834,0.0017215526,0.0005460551,0.75946164,0.0070038047,0.03758889,0.008375831,0.09090921],"study_design_scores_gemma":[0.00015868408,0.00029913674,0.016028857,0.00006157866,0.00054921006,0.0007754098,0.000044511668,0.9597181,0.001559063,0.01943695,0.0012833594,0.0000850855],"about_ca_topic_score_codex":0.010318434,"about_ca_topic_score_gemma":0.010232319,"teacher_disagreement_score":0.010318434,"about_ca_system_score_codex":0.0009532638,"about_ca_system_score_gemma":0.0015954183,"threshold_uncertainty_score":0.026087344},"labels":[],"label_agreement":null},{"id":"W2956845283","doi":"10.1007/978-3-030-22012-9_1","title":"Employing Interdisciplinary Approaches in Designing with Fragile Older Adults; Advancing ABLE for Arts-Based Rehabilitative Play and Complex Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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":"McMaster University","funders":"","keywords":"Computer science; Population; Interactive art; Human–computer interaction; Psychology; Multimedia; Applied psychology; Medicine","score_opus":0.03249166604949917,"score_gpt":0.3039451399142012,"score_spread":0.27145347386470203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956845283","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.17534018,0.014608524,0.13960108,0.012622423,0.0019095083,0.00071694667,0.000116283394,0.00048463247,0.6546004],"genre_scores_gemma":[0.41533533,0.014587717,0.22116424,0.003694685,0.00023992608,0.0008883135,0.00013693867,0.00020219336,0.34375063],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99960643,0.000148898,0.000015915446,0.000055510114,0.00009842186,0.000074760304],"domain_scores_gemma":[0.99961036,0.00015302343,0.000029672896,0.000016868516,0.000041730636,0.0001484497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013247802,0.000744518,0.00020063117,0.00068777247,0.0022171943,0.0034738518,0.00088824023,0.0010609971,0.008769454],"category_scores_gemma":[0.0013517921,0.0002799362,0.00040861982,0.00042606122,0.0021010472,0.0020550408,0.003760614,0.001858656,0.001856466],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007316555,0.0010849203,0.004811748,0.00091806886,0.00003330768,0.0023759042,0.23638096,0.00095257343,0.010708269,0.095909774,0.04926265,0.59748864],"study_design_scores_gemma":[0.000030127601,0.0005215611,0.010812332,0.0018702748,0.000063701285,0.00521049,0.1529833,0.0015099671,0.0024486936,0.05034223,0.7741473,0.000059951555],"about_ca_topic_score_codex":0.0015612058,"about_ca_topic_score_gemma":0.007944467,"teacher_disagreement_score":0.008769454,"about_ca_system_score_codex":0.00086258474,"about_ca_system_score_gemma":0.0020609323,"threshold_uncertainty_score":0.02933675},"labels":[],"label_agreement":null},{"id":"W2957412208","doi":"10.1007/978-3-030-22015-0_4","title":"Methodological Strategies to Understand Smartphone Practices for Social Connectedness in Later Life","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Social connectedness; Computer science; Data science; Psychology; Social psychology","score_opus":0.17958369881247335,"score_gpt":0.3966022758605553,"score_spread":0.21701857704808195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957412208","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.20959361,0.009070435,0.6620428,0.01338272,0.0009750864,0.00834944,0.0022346105,0.00019212293,0.09415917],"genre_scores_gemma":[0.49295816,0.003369202,0.44106075,0.0021360163,0.00016379538,0.036085114,0.0011184153,0.00018008387,0.02292849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9899631,0.0069161714,0.0011383732,0.00087706733,0.00079582824,0.00030942494],"domain_scores_gemma":[0.9673863,0.02301057,0.0022967795,0.0025976824,0.004313612,0.00039508083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02673365,0.0014091334,0.00060325355,0.0061618136,0.0036281336,0.0070062038,0.003046437,0.0017081577,0.011651753],"category_scores_gemma":[0.056972183,0.00073781697,0.0013049012,0.0052021574,0.005190725,0.008654417,0.00448211,0.0029091795,0.0015613016],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008985676,0.00042685866,0.030583927,0.0022068932,0.00014264783,0.0003706521,0.16899362,0.00036029977,0.0032326,0.6326285,0.0054309275,0.15553318],"study_design_scores_gemma":[0.000106595595,0.00040734743,0.052386895,0.0043839775,0.0003347936,0.0007556867,0.44745156,0.0046051885,0.005620443,0.3906144,0.09322867,0.000104457504],"about_ca_topic_score_codex":0.006455982,"about_ca_topic_score_gemma":0.012935465,"teacher_disagreement_score":0.02673365,"about_ca_system_score_codex":0.004037541,"about_ca_system_score_gemma":0.0056775534,"threshold_uncertainty_score":0.14138275},"labels":[],"label_agreement":null},{"id":"W2957570118","doi":"10.1007/978-3-030-22602-2_17","title":"Social Spending: An Empirical Study on Peer Pressure and Player Spending in Games","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Ontario Tech University","funders":"","keywords":"League; Fortress (chess); Peer pressure; Social pressure; Computer science; Limiting; Revenue; Battle; Empirical research; Advertising; Psychology; Social psychology; Artificial intelligence; Economics; Business; History; Statistics; Mathematics; Engineering","score_opus":0.058661677672819754,"score_gpt":0.36065886487784354,"score_spread":0.3019971872050238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957570118","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.99770194,0.00010668088,0.000067415356,0.000053583,0.0000041412827,0.000010050143,0.00007817477,0.0000015725057,0.001976471],"genre_scores_gemma":[0.9983693,0.0001425226,0.00009970674,0.00002396769,0.000014062359,0.000037586804,0.00017103838,0.000005010728,0.0011368865],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983057,0.0009137621,0.000103495964,0.0001367805,0.000282698,0.0002575787],"domain_scores_gemma":[0.9784775,0.011674427,0.005355936,0.0005995615,0.00083775097,0.0030549015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016038624,0.00041294436,0.00048581458,0.0015037261,0.0014194538,0.0017616827,0.00087918265,0.00078294915,0.0047809365],"category_scores_gemma":[0.01197045,0.0004480125,0.0004504959,0.0022608454,0.001130871,0.0015099319,0.0017028545,0.001494123,0.00071212905],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031139675,0.0020863807,0.9807875,0.000050650622,0.0001780029,0.00014396128,0.007537721,0.00013061466,0.0002541529,0.0009498699,0.00048363183,0.0070860903],"study_design_scores_gemma":[0.000007884583,0.00015267057,0.9918411,0.000014600745,0.0000296319,0.00008535359,0.0069133416,0.00025331942,0.00005013522,0.00016174126,0.00048269433,0.000007645316],"about_ca_topic_score_codex":0.008625784,"about_ca_topic_score_gemma":0.017731648,"teacher_disagreement_score":0.008625784,"about_ca_system_score_codex":0.00089973403,"about_ca_system_score_gemma":0.0007141879,"threshold_uncertainty_score":0.017151117},"labels":[],"label_agreement":null},{"id":"W2957664436","doi":"10.1007/978-3-030-22015-0_21","title":"Impact of Intergenerational Play on Young People’s Perceptions Towards Old Adults","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Aging and Gerontology Research","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Closeness; Grandparent; Perception; Psychology; Developmental psychology; Social psychology; Multilevel model; Computer science","score_opus":0.027916534066147625,"score_gpt":0.35346033594987486,"score_spread":0.3255438018837272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957664436","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.9948324,0.00027475794,0.000029717554,0.00012796931,0.000015033907,0.00000410025,0.000034453937,0.0000012373897,0.0046802647],"genre_scores_gemma":[0.9984906,0.00012979993,0.000025473319,0.000024353913,0.000005083928,0.0000036307247,0.000023645987,9.83736e-7,0.001296349],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99935573,0.00023489662,0.000031129566,0.00004679688,0.0001217733,0.00020973966],"domain_scores_gemma":[0.99665076,0.0012304945,0.00058230414,0.000077891666,0.00026944643,0.0011891075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012702086,0.00027864927,0.00018379018,0.000528661,0.0011576936,0.0020484624,0.00030629183,0.00047891864,0.005850793],"category_scores_gemma":[0.0033702767,0.00016589192,0.00032797866,0.00029651125,0.0008293501,0.00084373425,0.001849886,0.0009927328,0.0003781886],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008166133,0.0011030767,0.86974114,0.00008332443,0.00011328986,0.0007471265,0.08824771,0.00011951243,0.001140064,0.0014351719,0.00090945547,0.035543434],"study_design_scores_gemma":[0.000012443577,0.0003448915,0.89847475,0.00005073807,0.000044886536,0.00017001081,0.098056786,0.000094431176,0.00019061255,0.00023244284,0.0023119089,0.00001604446],"about_ca_topic_score_codex":0.018208863,"about_ca_topic_score_gemma":0.039138734,"teacher_disagreement_score":0.018208863,"about_ca_system_score_codex":0.0011178411,"about_ca_system_score_gemma":0.00054489606,"threshold_uncertainty_score":0.03620577},"labels":[],"label_agreement":null},{"id":"W2957704882","doi":"10.1007/978-3-030-25005-8_21","title":"A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Modular design; Scheme (mathematics); Computer science; Theoretical computer science; Parallel computing; Hypergraph; Programming language; Mathematics; Discrete mathematics","score_opus":0.014524078078809427,"score_gpt":0.28097084279795725,"score_spread":0.26644676471914785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957704882","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.0081617525,0.0003620481,0.95284885,0.00064032513,0.00028449084,0.00026620488,0.00034466444,0.0008830396,0.036208697],"genre_scores_gemma":[0.07076884,0.00081945816,0.88667166,0.00039386167,0.0003596637,0.000474863,0.001122511,0.0006435078,0.038745563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921095,0.00014807626,0.00007168261,0.0002225291,0.00024914308,0.0000975395],"domain_scores_gemma":[0.9992366,0.0002571044,0.0000341318,0.00027792272,0.00012805146,0.00006620668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784233,0.00139212,0.0009121165,0.0016912814,0.0017105043,0.0043321233,0.0032163847,0.0014366426,0.02185592],"category_scores_gemma":[0.0022378955,0.0010625776,0.0024800473,0.0026577294,0.002196929,0.006794442,0.005221312,0.0051282467,0.0069814622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028712342,0.000044731452,0.00009805149,0.00012465057,0.000010495264,0.000053758537,0.00019946288,0.0017958449,0.002507087,0.92455596,0.0066240993,0.06395721],"study_design_scores_gemma":[0.000019032948,0.000022226044,0.00010580897,0.000030557956,0.000017463131,0.00012876134,0.000059618786,0.0073635094,0.0010754914,0.9642033,0.026957694,0.000016567745],"about_ca_topic_score_codex":0.0006725499,"about_ca_topic_score_gemma":0.0012755012,"teacher_disagreement_score":0.02185592,"about_ca_system_score_codex":0.0014817541,"about_ca_system_score_gemma":0.0009363028,"threshold_uncertainty_score":0.07311535},"labels":[],"label_agreement":null},{"id":"W2959319614","doi":"10.1007/978-3-030-22335-9_5","title":"Modifying e-Service Quality for Automotive Repair Shops","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Customer Service Quality and Loyalty","field":"Business, Management and Accounting","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":"SERVQUAL; Automotive industry; Service quality; Servicescape; Context (archaeology); Computer science; Loyalty; Service (business); Reputation; Quality (philosophy); Extant taxon; Loyalty business model; Marketing; Business; Advertising; Engineering","score_opus":0.05301756209594447,"score_gpt":0.2911391454672264,"score_spread":0.23812158337128195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959319614","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.808379,0.0018107122,0.10310821,0.00094448106,0.00038728613,0.00017689785,0.00044167295,0.00292994,0.08182167],"genre_scores_gemma":[0.971732,0.00024621523,0.013858837,0.00009431381,0.000033387612,0.0000128975435,0.00025218152,0.00027998007,0.013490208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925715,0.00012400211,0.000037864844,0.0000866725,0.00032218162,0.00017203762],"domain_scores_gemma":[0.9978911,0.0006084307,0.00019526429,0.00046523288,0.0006641013,0.00017582145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009218103,0.00039035556,0.00029234117,0.0007565529,0.00044693673,0.0017039225,0.0009889331,0.0007416833,0.018321998],"category_scores_gemma":[0.0036858509,0.00021829993,0.0005065869,0.00090693677,0.00036661702,0.0016182517,0.0008965621,0.00060835795,0.0022146925],"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.0016485642,0.0014380082,0.019981124,0.00044953168,0.0001005504,0.00038368758,0.00093733694,0.051342905,0.06519456,0.01561041,0.008158009,0.83475536],"study_design_scores_gemma":[0.0005797373,0.0057407217,0.24764434,0.00040105332,0.0008157973,0.0015526637,0.005282806,0.39728567,0.17827839,0.031440433,0.13066648,0.00031185104],"about_ca_topic_score_codex":0.0041249497,"about_ca_topic_score_gemma":0.0043304926,"teacher_disagreement_score":0.018321998,"about_ca_system_score_codex":0.0010240122,"about_ca_system_score_gemma":0.00039381374,"threshold_uncertainty_score":0.061293185},"labels":[],"label_agreement":null},{"id":"W2959645282","doi":"10.1007/978-3-030-22646-6_16","title":"Gameful Design Heuristics: A Gamification Inspection Tool","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Humber Polytechnic; University of Waterloo","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Computer science; Heuristics; Software engineering; Human–computer interaction; Artificial intelligence; Operating system","score_opus":0.0354398315669169,"score_gpt":0.2999603701400337,"score_spread":0.2645205385731168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959645282","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.009015596,0.00016752996,0.9497572,0.00028214324,0.000057130026,0.0005653794,0.00056196185,0.029108195,0.010484832],"genre_scores_gemma":[0.08238652,0.00019468987,0.9034222,0.00018988375,0.000014534967,0.0007932676,0.001319117,0.0036081232,0.0080718],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986047,0.0005016989,0.00012715103,0.00017246229,0.00048784012,0.0001061785],"domain_scores_gemma":[0.98893553,0.008416812,0.0004063011,0.0009278173,0.0010694832,0.000244106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032078642,0.002026444,0.0006970619,0.0028922118,0.0005097414,0.0026118886,0.0027212584,0.0011015717,0.014380923],"category_scores_gemma":[0.020652285,0.0013106513,0.000776955,0.0013715841,0.0006787152,0.0034455112,0.0023623754,0.0020809863,0.0033258102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006673882,0.00073510996,0.0036719397,0.0011278461,0.000098803655,0.00041695597,0.0028643727,0.016454915,0.008754709,0.06091231,0.061946187,0.84234947],"study_design_scores_gemma":[0.00050703174,0.00041918195,0.005179463,0.0016954007,0.00021743971,0.0011252939,0.0014141686,0.5432765,0.03721029,0.198956,0.20975672,0.00024252526],"about_ca_topic_score_codex":0.0014315179,"about_ca_topic_score_gemma":0.0026808786,"teacher_disagreement_score":0.014380923,"about_ca_system_score_codex":0.00077360676,"about_ca_system_score_gemma":0.0015226556,"threshold_uncertainty_score":0.048108995},"labels":[],"label_agreement":null},{"id":"W2960183494","doi":"10.1007/978-3-030-25005-8_31","title":"Maximum Clique Exhaustive Search in Circulant k-Hypergraphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Clique; Circulant matrix; Computer science; Enhanced Data Rates for GSM Evolution; Pruning; Clique problem; Necklace; Combinatorics; Hypergraph; Algorithm; Binary number; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Arithmetic","score_opus":0.02460252876132622,"score_gpt":0.25770618981072924,"score_spread":0.23310366104940303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960183494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23078707,0.004626067,0.6379402,0.0037385777,0.00034166375,0.0007287892,0.0034713806,0.0030348152,0.11533135],"genre_scores_gemma":[0.58742535,0.0018822443,0.36507326,0.0007484488,0.00029414234,0.00043346977,0.0029577627,0.0007691899,0.04041615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988368,0.0004379664,0.000044652337,0.00025732798,0.00022240612,0.00020088062],"domain_scores_gemma":[0.9940818,0.004628434,0.00024454255,0.0005160654,0.00029056487,0.00023852874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087001175,0.00090651255,0.0018637291,0.0017215795,0.001547441,0.0031459087,0.002783976,0.0027550678,0.01179968],"category_scores_gemma":[0.008592079,0.0011165305,0.0008605853,0.004926415,0.0010146406,0.003922231,0.0020811518,0.0017673182,0.0018779506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012321618,0.00065850205,0.0015051743,0.0019773212,0.00026982377,0.00056199,0.0005240332,0.3867048,0.009139303,0.2734467,0.060268395,0.26371175],"study_design_scores_gemma":[0.00016453218,0.000061109116,0.00041348953,0.00009585497,0.000055508306,0.00019876998,0.00010096774,0.7636187,0.0020498324,0.22777176,0.0054403045,0.000029222214],"about_ca_topic_score_codex":0.0050804415,"about_ca_topic_score_gemma":0.012354455,"teacher_disagreement_score":0.01179968,"about_ca_system_score_codex":0.0021441774,"about_ca_system_score_gemma":0.002603606,"threshold_uncertainty_score":0.03947389},"labels":[],"label_agreement":null},{"id":"W2960283505","doi":"10.1007/978-3-030-25070-6_4","title":"Strongly n-e.c. Graphs and Independent Distinguishing Labellings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"ca_institutions":"Dalhousie University; University of Saskatchewan","funders":"","keywords":"Countable set; Adjacency list; Enumeration; Combinatorics; Vertex (graph theory); Discrete mathematics; Probabilistic logic; Computer science; Graph; Mathematics; Artificial intelligence","score_opus":0.01359819183333387,"score_gpt":0.22313630744698792,"score_spread":0.20953811561365404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960283505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12592693,0.0017822707,0.48249552,0.005351386,0.00046252663,0.00014702338,0.0019942021,0.00079827703,0.38104188],"genre_scores_gemma":[0.7071663,0.0017392413,0.18298113,0.0020565917,0.00047564376,0.00035576,0.0022676368,0.0005178139,0.102439776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00023454979,0.000050048,0.00039137944,0.00021843895,0.00016092308],"domain_scores_gemma":[0.99126667,0.005702343,0.00056564785,0.0012712894,0.0007918346,0.0004021638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114013,0.0008051601,0.0006613381,0.0013919075,0.0020448626,0.002370052,0.0012507502,0.0018559996,0.0075574485],"category_scores_gemma":[0.00574328,0.00083632336,0.0010713934,0.0017517428,0.0033890025,0.004161912,0.0019371511,0.0046037254,0.0021430424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006180993,0.000021561455,0.0002056909,0.000073381925,0.0000053206536,0.000073198804,0.00009724447,0.0025414024,0.0010672004,0.97075665,0.006789134,0.018307371],"study_design_scores_gemma":[0.000008454054,0.0000071047984,0.00018922501,0.000015898559,0.0000054505867,0.00012315984,0.000023669814,0.004559866,0.00069255155,0.98887956,0.0054868944,0.000008197234],"about_ca_topic_score_codex":0.0013993783,"about_ca_topic_score_gemma":0.0017291452,"teacher_disagreement_score":0.0075574485,"about_ca_system_score_codex":0.0022304496,"about_ca_system_score_gemma":0.0010449119,"threshold_uncertainty_score":0.025282204},"labels":[],"label_agreement":null},{"id":"W29603277","doi":"10.1007/978-3-642-21501-8_56","title":"Chemical Signaling as a Useful Metaphor for Resource Management","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Computer science; Executable; Connectionism; Artificial intelligence; Representation (politics); Theoretical computer science; Resource (disambiguation); Scheduling (production processes); Artificial neural network; Programming language; Mathematical optimization","score_opus":0.02224245576580172,"score_gpt":0.23520478081538196,"score_spread":0.21296232504958024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29603277","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.009666975,0.048304714,0.38457087,0.02261027,0.00951138,0.00012442282,0.0004657167,0.0012183894,0.5235273],"genre_scores_gemma":[0.36813822,0.056273624,0.22165473,0.010670478,0.0047602537,0.0006285246,0.00040087342,0.0006521445,0.33682117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998411,0.000041194733,0.0000069995017,0.000033263583,0.00005720648,0.000020154308],"domain_scores_gemma":[0.9998217,0.00009635172,0.000014753726,0.000028025595,0.000018614739,0.000020583093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031467757,0.00084384484,0.00044521477,0.00065703253,0.00073346833,0.0019310456,0.00117001,0.0015914358,0.009744484],"category_scores_gemma":[0.00046944746,0.00027526074,0.00046506786,0.00080294086,0.0030162053,0.0036680312,0.0008332883,0.002687626,0.0022961153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013481955,0.00002032347,0.000011244771,0.00012802625,0.0000049199175,0.00008454548,0.000082754756,0.0010087345,0.0071187885,0.9702234,0.008214953,0.013088818],"study_design_scores_gemma":[0.000018854455,0.00007376251,0.00004156888,0.00006589655,0.00001434679,0.00033310638,0.00011581331,0.0058937287,0.008752325,0.6160016,0.36866364,0.000025371222],"about_ca_topic_score_codex":0.00039817533,"about_ca_topic_score_gemma":0.00055040827,"teacher_disagreement_score":0.009744484,"about_ca_system_score_codex":0.00092187535,"about_ca_system_score_gemma":0.0004492097,"threshold_uncertainty_score":0.032598555},"labels":[],"label_agreement":null},{"id":"W2961028225","doi":"10.1007/978-3-030-22335-9_17","title":"Adding ‘Social’ to Commerce to Influence Purchasing Behaviour","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Purchasing; Perception; Internet privacy; The Internet; Personally identifiable information; Social media; Phenomenon; Risk perception; Computer science; Social commerce; Social influence; Advertising; E-commerce; Business; Marketing; World Wide Web; Computer security; Psychology; Social psychology","score_opus":0.07188499493502197,"score_gpt":0.36303316271768543,"score_spread":0.29114816778266345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961028225","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.7956483,0.0017336913,0.028666364,0.0039279335,0.0005125038,0.00010186457,0.00022811216,0.00035471012,0.1688265],"genre_scores_gemma":[0.9912425,0.00021859564,0.0046872073,0.0004421151,0.00012219972,0.000029135163,0.00005751804,0.00005386198,0.0031468377],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99759007,0.0016335971,0.000084157684,0.00023886657,0.00035387874,0.00009937499],"domain_scores_gemma":[0.98226124,0.01510222,0.0006830315,0.00085001567,0.00054223265,0.000561241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020188834,0.00054358,0.00054653815,0.00070712256,0.00066173874,0.003798829,0.00040689105,0.0012590933,0.01062574],"category_scores_gemma":[0.0143376095,0.0003398194,0.0005504815,0.0011476716,0.0015036752,0.0030057258,0.0011989875,0.0013138728,0.0011667213],"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.0025491482,0.0036608833,0.34906155,0.0017615124,0.0019077742,0.0015042119,0.015215999,0.017874379,0.025670458,0.12104535,0.012412368,0.4473364],"study_design_scores_gemma":[0.00052773755,0.003909128,0.5230019,0.0007453774,0.0026767734,0.0012806338,0.008543448,0.12567155,0.015046914,0.24163975,0.07644506,0.0005116396],"about_ca_topic_score_codex":0.0012341082,"about_ca_topic_score_gemma":0.0031705028,"teacher_disagreement_score":0.01062574,"about_ca_system_score_codex":0.0006814828,"about_ca_system_score_gemma":0.00046508273,"threshold_uncertainty_score":0.03554666},"labels":[],"label_agreement":null},{"id":"W2961351260","doi":"10.1007/978-3-030-21814-0_31","title":"Learning with Trees:","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual and Cognitive Learning Processes","field":"Psychology","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":"Computer science; Usability; Fidelity; Interface (matter); Suspect; Human–computer interaction; Artificial intelligence; Machine learning; Operating system","score_opus":0.022108504553102006,"score_gpt":0.29845540887236327,"score_spread":0.2763469043192613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961351260","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009824713,0.0043116543,0.8855839,0.0012671732,0.00045865923,0.00008047344,0.0005469977,0.0022112564,0.095715314],"genre_scores_gemma":[0.22593053,0.0058119874,0.6605823,0.00072259124,0.0006132628,0.00026984504,0.002904219,0.0012637381,0.10190148],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994617,0.00012087016,0.000030514251,0.00015080957,0.00019710025,0.00003905707],"domain_scores_gemma":[0.9989706,0.0005961449,0.000037006455,0.00020032878,0.00014165393,0.000054143453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006077532,0.0005872913,0.0005557754,0.0007193681,0.0007062716,0.0020969254,0.0012564384,0.0007899537,0.019125195],"category_scores_gemma":[0.0041750115,0.0003745349,0.0007787907,0.0015857582,0.00096779194,0.0050955573,0.0019819508,0.001787752,0.0055116937],"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.00005788853,0.0000695905,0.0004321098,0.00022114528,0.000027172928,0.000057549125,0.00030059982,0.015824208,0.000880835,0.4088892,0.03953327,0.53370637],"study_design_scores_gemma":[0.000011206839,0.00002442459,0.00021082346,0.00008018533,0.000017376839,0.00012475497,0.00007044234,0.072211616,0.0010715963,0.8602493,0.065913685,0.00001453474],"about_ca_topic_score_codex":0.0010845523,"about_ca_topic_score_gemma":0.0017279021,"teacher_disagreement_score":0.019125195,"about_ca_system_score_codex":0.0006110228,"about_ca_system_score_gemma":0.0006122721,"threshold_uncertainty_score":0.06398016},"labels":[],"label_agreement":null},{"id":"W2961671216","doi":"10.1007/978-3-030-22012-9_9","title":"Capturing the Adoption Intention and Interest in InOvUS an Intelligent Oven: Segmenting Senior Users to Evaluate the Technology","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Bishop's University; Université de Sherbrooke","funders":"","keywords":"Usability; Market segmentation; Technology acceptance model; Population; Computer science; Conceptual model; Marketing; Business; Human–computer interaction; Medicine","score_opus":0.03865929932715352,"score_gpt":0.29867350162534356,"score_spread":0.26001420229819006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961671216","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.99790597,0.000051164203,0.0008782191,0.000023966692,0.000004093817,0.00002408508,0.0002802654,0.000025580724,0.000806823],"genre_scores_gemma":[0.99438757,0.000113870265,0.002949625,0.00003215107,0.000009549492,0.000056447927,0.00087284093,0.000009491483,0.0015683832],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998006,0.0000431768,0.000019999745,0.000041470837,0.00005827859,0.000036412952],"domain_scores_gemma":[0.9986451,0.000631387,0.00025888975,0.00005625532,0.00023889082,0.00016938926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047587015,0.0004735554,0.0003204953,0.0011315633,0.00024101371,0.0013801496,0.00029003833,0.000683605,0.0015146205],"category_scores_gemma":[0.0026291495,0.00019914343,0.00043900602,0.00089459005,0.00009749575,0.00088492915,0.00038429193,0.0005179538,0.00091402826],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028949592,0.00077114877,0.9090355,0.00009497888,0.00010807206,0.000060868155,0.002067447,0.00031303123,0.005726782,0.000109524546,0.00071636925,0.08070672],"study_design_scores_gemma":[0.000006198683,0.00047710878,0.98238164,0.0000291805,0.00009548329,0.00010145607,0.0030753547,0.0108301435,0.0022599364,0.00020766574,0.000509032,0.000026673339],"about_ca_topic_score_codex":0.0049952404,"about_ca_topic_score_gemma":0.012875844,"teacher_disagreement_score":0.0049952404,"about_ca_system_score_codex":0.00021134221,"about_ca_system_score_gemma":0.00019198754,"threshold_uncertainty_score":0.00993228},"labels":[],"label_agreement":null},{"id":"W2962297646","doi":"10.1007/978-3-030-25540-4_11","title":"Automated Hypersafety Verification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Correctness; Counterexample; Reduction (mathematics); Key (lock); Property (philosophy); Programming language; Set (abstract data type); Product (mathematics); Formal verification; Theoretical computer science; Class (philosophy); Functional verification; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Operating system","score_opus":0.020870248694305135,"score_gpt":0.25515217431887843,"score_spread":0.23428192562457328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962297646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018128678,0.00012215345,0.9738349,0.00016121673,0.0000227872,0.000104811734,0.00017366077,0.0028785442,0.0045731645],"genre_scores_gemma":[0.29151776,0.00032373852,0.70178694,0.00016610825,0.000036910707,0.00026370632,0.0007051398,0.00068163505,0.004518071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961647,0.0009679548,0.00020587494,0.0006705978,0.0017318563,0.0002590088],"domain_scores_gemma":[0.9924177,0.0035978064,0.00040264998,0.00271736,0.00078478723,0.00007969251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068055,0.00056280027,0.00056596706,0.001162421,0.00084183697,0.0017660292,0.0020470445,0.000772811,0.004672408],"category_scores_gemma":[0.0066030202,0.00055602926,0.0013685655,0.0007232322,0.0023814396,0.0042639584,0.0031052316,0.002007115,0.0011748015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003014641,0.00016254936,0.0028581014,0.0006137194,0.00013566001,0.0007757201,0.0010405954,0.04928119,0.091789015,0.5373485,0.005602181,0.31009123],"study_design_scores_gemma":[0.00007954149,0.00018355683,0.0010232907,0.00013787384,0.000081335325,0.00095098023,0.0001994036,0.3339196,0.18265222,0.4271288,0.05355401,0.00008941402],"about_ca_topic_score_codex":0.0011653661,"about_ca_topic_score_gemma":0.0010706832,"teacher_disagreement_score":0.004672408,"about_ca_system_score_codex":0.0007526783,"about_ca_system_score_gemma":0.0016390262,"threshold_uncertainty_score":0.015630782},"labels":[],"label_agreement":null},{"id":"W29626722","doi":"10.1007/978-3-319-10175-0_17","title":"ChipWhisperer: An Open-Source Platform for Hardware Embedded Security Research","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":238,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Open source hardware; Modular design; Embedded system; Software; Synchronization (alternating current); Computer hardware; Toolbox; Hardware compatibility list; Implementation; Field-programmable gate array; Cryptography; Operating system; Open source; Channel (broadcasting); Hardware architecture; Software engineering","score_opus":0.07313631529089948,"score_gpt":0.3640269377411954,"score_spread":0.2908906224502959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29626722","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.005325684,0.0019848298,0.6254387,0.00041354285,0.00082840555,0.0004414951,0.003929712,0.3008498,0.060787868],"genre_scores_gemma":[0.08332818,0.0034143461,0.5794671,0.0010665762,0.0004268824,0.0013998664,0.021732159,0.09574812,0.21341681],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989513,0.00008117017,0.00003910285,0.0001458752,0.0006763172,0.00010623522],"domain_scores_gemma":[0.99879766,0.0003510738,0.00007194219,0.00034628614,0.00032988036,0.000103113474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010499416,0.0016308073,0.0008019399,0.0014949697,0.0005850203,0.0016847157,0.0042568822,0.0015518973,0.07488217],"category_scores_gemma":[0.0028033974,0.001242402,0.0010140414,0.0012320699,0.0005185859,0.0028818646,0.0022107868,0.0026635956,0.04714074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043727612,0.00024044879,0.00077405665,0.001250177,0.0001747553,0.00032891415,0.00021462004,0.008626481,0.06276563,0.041053325,0.4843709,0.3997635],"study_design_scores_gemma":[0.00028179813,0.00027510285,0.001408237,0.00018858002,0.00013118835,0.0008146898,0.000055674707,0.07717471,0.13127075,0.04018782,0.74800944,0.00020200585],"about_ca_topic_score_codex":0.00088647194,"about_ca_topic_score_gemma":0.0015142132,"teacher_disagreement_score":0.07488217,"about_ca_system_score_codex":0.00068302994,"about_ca_system_score_gemma":0.0015625905,"threshold_uncertainty_score":0.25050586},"labels":[],"label_agreement":null},{"id":"W2962778531","doi":"10.1007/978-3-030-20887-5_18","title":"Totally Looks Like - How Humans Compare, Compared to Machines","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"York University","funders":"","keywords":"Computer science; Similarity (geometry); Consistency (knowledge bases); Matching (statistics); Artificial intelligence; Convolutional neural network; Set (abstract data type); Perception; Task (project management); Image (mathematics); Entertainment; Pattern recognition (psychology); Machine learning; Information retrieval; Mathematics","score_opus":0.01770514157041165,"score_gpt":0.23373971117207626,"score_spread":0.21603456960166462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962778531","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.5525019,0.01919485,0.17609276,0.010055126,0.0030821161,0.00023232716,0.0028125735,0.0027308678,0.23329751],"genre_scores_gemma":[0.9580815,0.0015419465,0.023260865,0.0015823388,0.00025333045,0.00007310759,0.0011146684,0.0011172338,0.012975078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962632,0.0020632735,0.00010940118,0.000594809,0.0008300399,0.00013933833],"domain_scores_gemma":[0.989514,0.00787579,0.00064255437,0.0008728769,0.00071453204,0.0003803148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028334686,0.00043487834,0.0004476351,0.0010371242,0.0004701546,0.00383578,0.0006535897,0.0011154079,0.009132694],"category_scores_gemma":[0.03281676,0.00025548314,0.00040306424,0.00073221367,0.0019585895,0.0062463298,0.0013907612,0.0011364666,0.0027690001],"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.0031395701,0.00021812045,0.073154606,0.0013211512,0.000732663,0.0004124768,0.008896899,0.017869204,0.025059378,0.1466402,0.071620025,0.65093565],"study_design_scores_gemma":[0.00017450312,0.0012793674,0.1281394,0.00076507125,0.00047780512,0.0032934363,0.011609716,0.09525444,0.019323932,0.60091734,0.13835342,0.00041145168],"about_ca_topic_score_codex":0.0011345629,"about_ca_topic_score_gemma":0.001071345,"teacher_disagreement_score":0.009132694,"about_ca_system_score_codex":0.00053482794,"about_ca_system_score_gemma":0.00028500037,"threshold_uncertainty_score":0.03055185},"labels":[],"label_agreement":null},{"id":"W2962879739","doi":"10.1007/978-3-319-18356-5_22","title":"Learning Paired-Associate Images with an Unsupervised Deep Learning Architecture","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Acadia University","funders":"","keywords":"Computer science; MNIST database; Artificial intelligence; Associative property; Restricted Boltzmann machine; Content-addressable memory; Unsupervised learning; Deep learning; Pattern recognition (psychology); Representation (politics); Boltzmann machine; Modal; Artificial neural network; Machine learning; Mathematics","score_opus":0.01598576285133331,"score_gpt":0.25674946916856856,"score_spread":0.24076370631723526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962879739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01394954,0.00024819555,0.9795065,0.000176113,0.00013522834,0.000040581,0.00013855829,0.0017799459,0.004025314],"genre_scores_gemma":[0.23710068,0.0005099287,0.74521536,0.00042381184,0.0001475702,0.000106340914,0.00083556987,0.00034798583,0.015312779],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961424,0.00006053837,0.000013044209,0.00015858337,0.00009733128,0.00005626257],"domain_scores_gemma":[0.99952114,0.00011617645,0.000036371857,0.00017817113,0.000099390985,0.00004878589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062622223,0.00093515095,0.0009009595,0.0005553394,0.00033737568,0.0011566018,0.0021287461,0.0016105497,0.0083500985],"category_scores_gemma":[0.0019920564,0.00064071076,0.0009200682,0.0009463383,0.00080641586,0.0024113136,0.0025364454,0.0025654668,0.003499103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029229335,0.00018785901,0.0008234491,0.00012606486,0.000100253885,0.00011780259,0.00006971889,0.060165845,0.028715964,0.021415703,0.009762454,0.87822264],"study_design_scores_gemma":[0.000019702777,0.00011376541,0.00032194867,0.000030721596,0.00003438802,0.00019567236,0.0000310443,0.9379443,0.0215431,0.034742143,0.0050006467,0.000022534758],"about_ca_topic_score_codex":0.0013794072,"about_ca_topic_score_gemma":0.0024916087,"teacher_disagreement_score":0.0083500985,"about_ca_system_score_codex":0.0004132901,"about_ca_system_score_gemma":0.00067033677,"threshold_uncertainty_score":0.027933896},"labels":[],"label_agreement":null},{"id":"W2962922262","doi":"10.1007/978-3-031-38499-8","title":"Automated Deduction – CADE 29","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Drilling and Well Engineering","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Artificial intelligence; Natural language processing","score_opus":0.008745723829433895,"score_gpt":0.21527237708710278,"score_spread":0.2065266532576689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962922262","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034147098,0.02605928,0.42307016,0.0034740074,0.0028196783,0.00024706242,0.004296508,0.015242569,0.5213761],"genre_scores_gemma":[0.08446525,0.02466696,0.5775195,0.002303758,0.0020212915,0.00048820322,0.02034573,0.007935505,0.28025386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973346,0.00040547256,0.00021911507,0.00038174208,0.0015262214,0.00013285641],"domain_scores_gemma":[0.9977075,0.0009896235,0.000058409594,0.00057305663,0.0006070924,0.000064343025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021605128,0.0010127848,0.0009702677,0.002626645,0.00077980215,0.004982317,0.0017633958,0.0011125203,0.057595957],"category_scores_gemma":[0.0052143196,0.0010851589,0.0015306525,0.0032364724,0.0013521841,0.0042568604,0.0025217852,0.002648865,0.030899784],"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.000066920315,0.00008018721,0.00011751951,0.0007263518,0.000038105798,0.00018681213,0.00009385874,0.0039553843,0.0021836187,0.2792025,0.20008491,0.5132638],"study_design_scores_gemma":[0.000028547183,0.00001972031,0.00023420378,0.00020829245,0.000014287422,0.00042243247,0.00002556772,0.005075689,0.0033625853,0.17906478,0.8115185,0.00002542822],"about_ca_topic_score_codex":0.0016418746,"about_ca_topic_score_gemma":0.0015893611,"teacher_disagreement_score":0.057595957,"about_ca_system_score_codex":0.0018488535,"about_ca_system_score_gemma":0.0012815117,"threshold_uncertainty_score":0.19267768},"labels":[],"label_agreement":null},{"id":"W2962931423","doi":"10.1007/978-3-030-17953-3_31","title":"Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Polynomial; Time complexity; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.01492737701452467,"score_gpt":0.2122742775948551,"score_spread":0.19734690058033041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962931423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20138882,0.00043013168,0.7730754,0.0014744546,0.00014403634,0.00026200552,0.0010608913,0.0018118304,0.020352336],"genre_scores_gemma":[0.75890005,0.00029059662,0.22937824,0.0003175281,0.00014409302,0.00031904993,0.0016678978,0.0006980311,0.008284472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976611,0.00082511606,0.000101356694,0.0006045273,0.0003494071,0.00045853728],"domain_scores_gemma":[0.9884644,0.009297424,0.0005156275,0.0007601681,0.00041514222,0.0005472106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024927645,0.0012633662,0.002347603,0.001079559,0.0013037552,0.004454802,0.0027680327,0.0017602467,0.012096921],"category_scores_gemma":[0.016051771,0.0009710811,0.0012691445,0.0014372447,0.0022919474,0.0068522,0.0030746197,0.0024156189,0.0016139807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013525923,0.000434945,0.002673157,0.0005039136,0.0001605354,0.000166534,0.00053378666,0.41045833,0.0049108188,0.47910506,0.014301189,0.085399166],"study_design_scores_gemma":[0.00008635456,0.000046910824,0.00018926708,0.000022234208,0.000018663874,0.000029158637,0.00009632831,0.5351375,0.0008636021,0.4625832,0.0009121173,0.000014620998],"about_ca_topic_score_codex":0.0040073115,"about_ca_topic_score_gemma":0.0064006844,"teacher_disagreement_score":0.012096921,"about_ca_system_score_codex":0.0025337916,"about_ca_system_score_gemma":0.002857003,"threshold_uncertainty_score":0.040468216},"labels":[],"label_agreement":null},{"id":"W2963033861","doi":"10.1007/978-3-030-24886-4_9","title":"The Relative Edit-Distance Between Two Input-Driven Languages","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Queen's University","funders":"","keywords":"Computer science; Edit distance; Programming language; Theoretical computer science","score_opus":0.014011162799821246,"score_gpt":0.2689131162496886,"score_spread":0.2549019534498674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963033861","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.045540188,0.00091638207,0.94072556,0.00043252902,0.00029011664,0.0000574274,0.0007389104,0.0018381475,0.00946065],"genre_scores_gemma":[0.4489684,0.0009192861,0.53251743,0.00034883813,0.00023383427,0.0001485833,0.0018961533,0.0012177097,0.013749777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975533,0.00064030744,0.00020268076,0.00062932767,0.0008366592,0.00013771025],"domain_scores_gemma":[0.9940019,0.0032323182,0.00036952042,0.0012407041,0.0009383135,0.00021721411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015001511,0.00042966407,0.0004845303,0.0014238456,0.0004957424,0.0024222545,0.0016683049,0.001074646,0.0045418516],"category_scores_gemma":[0.010516962,0.00035314306,0.000788693,0.0015040546,0.000920328,0.0043537235,0.0016450564,0.0016240414,0.0015354011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006164585,0.00015287293,0.0017367973,0.00084367144,0.00015277193,0.00063668273,0.0011764609,0.029973201,0.052348025,0.40875483,0.008678357,0.49492994],"study_design_scores_gemma":[0.00006584411,0.0005913562,0.0015276403,0.00023672808,0.00015466266,0.0021771912,0.00048786632,0.28850362,0.09531917,0.53917366,0.07161522,0.00014714448],"about_ca_topic_score_codex":0.0005697756,"about_ca_topic_score_gemma":0.00080510986,"teacher_disagreement_score":0.0045418516,"about_ca_system_score_codex":0.0007480394,"about_ca_system_score_gemma":0.00096020923,"threshold_uncertainty_score":0.015193999},"labels":[],"label_agreement":null},{"id":"W2963185199","doi":"10.1007/978-3-030-01228-1_28","title":"Probabilistic Video Generation Using Holistic Attribute Control","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Decoding methods; Artificial intelligence; Generative model; Probabilistic logic; Encoding (memory); Generative grammar; Machine learning; Computer vision; Pattern recognition (psychology); Algorithm","score_opus":0.04667553684949441,"score_gpt":0.26384596071739247,"score_spread":0.21717042386789806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963185199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043252804,0.00009929532,0.9938023,0.00005735866,0.00004171439,0.000021842929,0.00003083218,0.0003203584,0.0013010412],"genre_scores_gemma":[0.5577555,0.0003485755,0.43207228,0.00019457281,0.00013038874,0.0001253097,0.0003691014,0.00034601925,0.008658199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995938,0.00007384655,0.000013428898,0.00013587356,0.00014471875,0.000038315873],"domain_scores_gemma":[0.99942064,0.00028830135,0.000041096555,0.00012670261,0.000086683714,0.000036522204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070952333,0.0005739254,0.0006310347,0.00040419295,0.00021843796,0.00072106405,0.0010097201,0.0007969889,0.0035282248],"category_scores_gemma":[0.0021778822,0.0004376055,0.00062596536,0.00043093343,0.0005305755,0.0010476441,0.0015399035,0.0011597334,0.0008281423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019316218,0.000076979166,0.00031684124,0.00008193686,0.000047902085,0.00014338273,0.0000703564,0.63242835,0.030254217,0.041778654,0.0032658211,0.2913424],"study_design_scores_gemma":[0.0000050708168,0.000014543999,0.000041934498,0.0000036647302,0.0000038485277,0.000039739338,0.000002645665,0.9888214,0.0031403883,0.0073851296,0.00053687114,0.000004715346],"about_ca_topic_score_codex":0.0008248142,"about_ca_topic_score_gemma":0.00080245896,"teacher_disagreement_score":0.0035282248,"about_ca_system_score_codex":0.0004023427,"about_ca_system_score_gemma":0.00030800898,"threshold_uncertainty_score":0.01180315},"labels":[],"label_agreement":null},{"id":"W2963216346","doi":"10.1007/978-3-319-98654-8_10","title":"Additive Number Theory via Approximation by Regular Languages","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Programming language; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.005978647879563974,"score_gpt":0.22829505871394593,"score_spread":0.22231641083438194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963216346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048822064,0.004066335,0.7878825,0.002405876,0.00086055987,0.00006658697,0.00025643752,0.000968352,0.1546713],"genre_scores_gemma":[0.75445235,0.0041431566,0.17633666,0.00093160325,0.0015813365,0.00023664902,0.0005529582,0.00050377654,0.061261483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834645,0.00044984423,0.000101194346,0.00034937964,0.0006088625,0.0001442483],"domain_scores_gemma":[0.99829227,0.0010728763,0.00007484167,0.0003228183,0.0001567009,0.00008050271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548167,0.00106701,0.0013481086,0.0018288202,0.0010697931,0.0041653165,0.0016778853,0.0008896844,0.0064620073],"category_scores_gemma":[0.0035202878,0.00079300866,0.0015968819,0.0020102453,0.0035094202,0.008936291,0.0031230485,0.0048382822,0.0021191996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015513295,0.000008712683,0.00003093454,0.000038622773,0.000005570605,0.000012483723,0.00006986369,0.001215839,0.0002833527,0.98987913,0.0006921064,0.007747844],"study_design_scores_gemma":[0.0000054121124,0.000008333678,0.00003280933,0.00000990902,0.000008893593,0.000036541325,0.000016218393,0.004819889,0.00033207558,0.990932,0.003790634,0.000007262139],"about_ca_topic_score_codex":0.00043708977,"about_ca_topic_score_gemma":0.00037722432,"teacher_disagreement_score":0.0064620073,"about_ca_system_score_codex":0.0017281397,"about_ca_system_score_gemma":0.0005410309,"threshold_uncertainty_score":0.021617591},"labels":[],"label_agreement":null},{"id":"W2963222815","doi":"10.1007/978-3-319-94776-1_18","title":"Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Computer science; Vertex cover; Combinatorics; Time complexity; Disjoint sets; Job shop scheduling; Flow shop scheduling; Approximation algorithm; Discrete mathematics; Algorithm; Mathematics; Schedule","score_opus":0.017992132275439356,"score_gpt":0.2452845668499694,"score_spread":0.22729243457453005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963222815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01718074,0.001224972,0.97411776,0.0006230962,0.00021202811,0.00013183405,0.00025203225,0.00094734767,0.0053102123],"genre_scores_gemma":[0.26805076,0.0009553176,0.72393924,0.00032467372,0.00023860698,0.00036595023,0.00093993795,0.00050500216,0.004680559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981907,0.00070306496,0.00008937948,0.0003190614,0.00038709363,0.00031069398],"domain_scores_gemma":[0.9936738,0.004624285,0.0003281577,0.000675611,0.00037717485,0.00032103044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029218185,0.0023059368,0.0030292517,0.0014207744,0.0012305692,0.0031207737,0.0056030047,0.003012687,0.006516279],"category_scores_gemma":[0.009626894,0.0016186929,0.002069286,0.003986403,0.0013070045,0.004465348,0.002518029,0.0042519695,0.0010811646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005220843,0.00031178942,0.00040855675,0.00032957213,0.000094785195,0.00006026902,0.000120898316,0.8537241,0.0008222293,0.039456923,0.0068237106,0.09732501],"study_design_scores_gemma":[0.00004533498,0.000023598268,0.000046495297,0.000013204118,0.000012300306,0.00001908265,0.000014757213,0.9723985,0.00016067587,0.026753923,0.0005063684,0.000005686006],"about_ca_topic_score_codex":0.006752245,"about_ca_topic_score_gemma":0.005506793,"teacher_disagreement_score":0.006752245,"about_ca_system_score_codex":0.0037171533,"about_ca_system_score_gemma":0.003185674,"threshold_uncertainty_score":0.02696997},"labels":[],"label_agreement":null},{"id":"W2963231024","doi":"10.1007/978-3-030-26176-4_18","title":"Imbalance, Cutwidth, and the Structure of Optimal Orderings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Parameterized complexity; Chordal graph; Interval (graph theory); Interval graph; Combinatorics; Computer science; Pathwidth; Graph; Time complexity; Mathematics; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.008855433772985706,"score_gpt":0.2493822870509093,"score_spread":0.2405268532779236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963231024","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.6313092,0.007484055,0.23867217,0.0063749105,0.0004717956,0.00011479852,0.0027286664,0.0006690812,0.11217529],"genre_scores_gemma":[0.88476944,0.004374359,0.08722331,0.00055380125,0.00084186124,0.0001661929,0.0024948176,0.00043595614,0.019140182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991634,0.00019421444,0.000053858883,0.00017370348,0.00027355555,0.00014129968],"domain_scores_gemma":[0.9913162,0.00572729,0.0011223081,0.0008413891,0.00051497505,0.000477771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485803,0.0006232912,0.0010208202,0.0025308921,0.0013896776,0.004860514,0.0012612706,0.0012898914,0.007008357],"category_scores_gemma":[0.010546498,0.0009775064,0.00048787455,0.0042542494,0.0018510188,0.0085039465,0.0012433082,0.0027091948,0.0007511578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036138282,0.00017164987,0.001985673,0.00021289321,0.000031865486,0.00008459847,0.00031631187,0.029885983,0.0031930206,0.8796348,0.0116417855,0.07247995],"study_design_scores_gemma":[0.000021256837,0.000023137653,0.00057850976,0.000028239776,0.000012229986,0.0000951075,0.000085502805,0.025921883,0.0005464133,0.96945894,0.0032195984,0.000009180624],"about_ca_topic_score_codex":0.00078094285,"about_ca_topic_score_gemma":0.0013216712,"teacher_disagreement_score":0.007008357,"about_ca_system_score_codex":0.0020697687,"about_ca_system_score_gemma":0.0009491267,"threshold_uncertainty_score":0.023445249},"labels":[],"label_agreement":null},{"id":"W2963244227","doi":"10.1007/978-3-319-06608-0_12","title":"Inferring Attitude in Online Social Networks Based on Quadratic Correlation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Snapshot (computer storage); Artificial intelligence; Social network (sociolinguistics); Machine learning; Correlation; Sign (mathematics); Set (abstract data type); Quadratic equation; Social relationship; Data mining; Social media; World Wide Web; Mathematics; Social psychology; Psychology","score_opus":0.014384914638141205,"score_gpt":0.26664143107755933,"score_spread":0.25225651643941815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963244227","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.61224437,0.0005435335,0.38229296,0.0005878691,0.0000634602,0.000059305552,0.0009607936,0.00040098597,0.002846752],"genre_scores_gemma":[0.9763446,0.00016415343,0.020883478,0.000072033836,0.000098085206,0.000044836757,0.00081709184,0.000029533996,0.0015462803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989641,0.00041216044,0.00004021567,0.0002750497,0.00018971218,0.000118790085],"domain_scores_gemma":[0.98986965,0.007864159,0.0007202371,0.0004887799,0.00074600003,0.00031111273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013936509,0.0005291765,0.0010460877,0.0015031176,0.00045554992,0.00091781357,0.0010811909,0.0008476707,0.0014032178],"category_scores_gemma":[0.009205638,0.0004468096,0.00071115745,0.0018887267,0.0005453398,0.0021406014,0.0011140242,0.0014275971,0.0007612348],"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.0011457301,0.0013038821,0.30547738,0.000314291,0.0007056714,0.00041094417,0.00084163685,0.3235327,0.007821502,0.023985231,0.0075829355,0.32687804],"study_design_scores_gemma":[0.0000064813466,0.00004562148,0.009939231,0.000007790963,0.00001843487,0.000032883523,0.000047887974,0.9830625,0.00030491964,0.006373629,0.00015109479,0.000009531089],"about_ca_topic_score_codex":0.0073976372,"about_ca_topic_score_gemma":0.011128187,"teacher_disagreement_score":0.0073976372,"about_ca_system_score_codex":0.0006302708,"about_ca_system_score_gemma":0.0004223148,"threshold_uncertainty_score":0.014709175},"labels":[],"label_agreement":null},{"id":"W2963248893","doi":"10.1007/978-3-319-46128-1_50","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":832,"is_retracted":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":"Convexity; Rate of convergence; Applied mathematics; Mathematics; Stochastic gradient descent; Convergence (economics); Gradient descent; Mathematical proof; Generalization; Simple (philosophy); Convex function; Regular polygon; Mathematical optimization; Computer science; Mathematical analysis; Artificial neural network; Artificial intelligence; Geometry","score_opus":0.0238326173554937,"score_gpt":0.2977316453413589,"score_spread":0.2738990279858652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963248893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005550675,0.0028048353,0.97172946,0.0009241711,0.00039351787,0.000050876504,0.00008592614,0.00021455504,0.01824589],"genre_scores_gemma":[0.30768943,0.008777295,0.5827145,0.00090528035,0.0015151477,0.0008417721,0.00067212805,0.0015974446,0.09528704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980732,0.00090527034,0.000076128345,0.00026458502,0.0005246105,0.0001562319],"domain_scores_gemma":[0.99370307,0.004480813,0.00029145114,0.000333815,0.00089524995,0.00029569576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041513285,0.002422076,0.0021318165,0.0017615518,0.0009485255,0.0024209,0.0026019476,0.0031661522,0.00664907],"category_scores_gemma":[0.020264637,0.0011999997,0.0016585388,0.002122345,0.0046228915,0.0046218666,0.005113363,0.00649016,0.0024358055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002636377,0.00009401357,0.0002826552,0.00056307344,0.00008455467,0.000090396796,0.00026838458,0.13532367,0.0020858818,0.794345,0.010528761,0.056069966],"study_design_scores_gemma":[0.00003849199,0.000055534765,0.00016090127,0.00007322799,0.000020964148,0.00007348761,0.000034722492,0.63265765,0.0008239567,0.36151457,0.0045094974,0.00003706985],"about_ca_topic_score_codex":0.0045092874,"about_ca_topic_score_gemma":0.0027028774,"teacher_disagreement_score":0.00664907,"about_ca_system_score_codex":0.0021035802,"about_ca_system_score_gemma":0.0026753347,"threshold_uncertainty_score":0.02224338},"labels":[],"label_agreement":null},{"id":"W2963314137","doi":"10.1007/978-3-030-01240-3_20","title":"Faces as Lighting Probes via Unsupervised Deep Highlight Extraction","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Tracing; Face (sociological concept); TRACE (psycholinguistics); Deconvolution; Artificial neural network; Pattern recognition (psychology); Deep learning; Algorithm","score_opus":0.01306946106731292,"score_gpt":0.270193211821378,"score_spread":0.2571237507540651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963314137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050457574,0.0011418004,0.9337578,0.0002143363,0.00026476037,0.00011505466,0.0013590467,0.004692994,0.007996722],"genre_scores_gemma":[0.46520534,0.0025224157,0.502694,0.0003654096,0.0003542536,0.00021957605,0.003890646,0.0015797223,0.023168664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996848,0.00003993633,0.000006330813,0.00009870453,0.000089929796,0.00008025042],"domain_scores_gemma":[0.9997403,0.000073103845,0.000027544525,0.0000601056,0.0000731676,0.000025821188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028512484,0.0012220307,0.0009227915,0.000966413,0.000297046,0.00097536895,0.00090118824,0.00076042855,0.0056089805],"category_scores_gemma":[0.0008109184,0.0005288924,0.0007926441,0.0007690324,0.0002950747,0.0009825714,0.001312967,0.0014078103,0.0049046706],"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.0007952475,0.00012304794,0.0011021728,0.00025179746,0.000088906956,0.00019249026,0.00008261434,0.014848846,0.22348875,0.003949989,0.01410822,0.7409678],"study_design_scores_gemma":[0.000049511553,0.00021180595,0.0056781657,0.00010166817,0.00016339538,0.00073504966,0.00013509468,0.7542121,0.20911783,0.010027325,0.01950729,0.000060690196],"about_ca_topic_score_codex":0.0013076351,"about_ca_topic_score_gemma":0.0028616986,"teacher_disagreement_score":0.0056089805,"about_ca_system_score_codex":0.00032206325,"about_ca_system_score_gemma":0.0004233874,"threshold_uncertainty_score":0.0187639},"labels":[],"label_agreement":null},{"id":"W2963428252","doi":"10.1007/978-3-319-21840-3_51","title":"Swapping Colored Tokens on Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Computer science; Colored; Programming language; Theoretical computer science","score_opus":0.022237511735712326,"score_gpt":0.2514341319779747,"score_spread":0.2291966202422624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963428252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05330901,0.0003241592,0.9086413,0.00046218987,0.00063879817,0.00021718878,0.00064096105,0.0039643836,0.031802103],"genre_scores_gemma":[0.32781503,0.000593128,0.6210445,0.0002980439,0.00013161762,0.00036462396,0.0015640497,0.0021471526,0.046041735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990274,0.00022621379,0.000057057856,0.00026933712,0.00023475516,0.00018533102],"domain_scores_gemma":[0.9977011,0.0010300071,0.000106907915,0.00082587695,0.0001860037,0.00015003253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008018367,0.0009126329,0.0010967604,0.0012490406,0.0013402349,0.0017284399,0.0029897618,0.0010901697,0.020754885],"category_scores_gemma":[0.0044700983,0.00081817905,0.0012125802,0.0030504616,0.0017684139,0.0043433346,0.0038965307,0.0018399985,0.0036119337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049801567,0.00016563809,0.00044678847,0.00038318633,0.000079231715,0.00044367358,0.00041045545,0.09451252,0.01581142,0.5389579,0.020092819,0.32819837],"study_design_scores_gemma":[0.00006235523,0.000067215486,0.00015722605,0.00006094982,0.000051958577,0.00019904676,0.00013836725,0.18125018,0.015454339,0.7723209,0.030193947,0.000043448224],"about_ca_topic_score_codex":0.0014034776,"about_ca_topic_score_gemma":0.0018530401,"teacher_disagreement_score":0.020754885,"about_ca_system_score_codex":0.0010158007,"about_ca_system_score_gemma":0.0008354759,"threshold_uncertainty_score":0.06943196},"labels":[],"label_agreement":null},{"id":"W2963485651","doi":"10.1007/978-3-319-94821-8_13","title":"HOL Light QE","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"HOL; Lisp; Computer science; Type theory; Programming language; Syntax; Type (biology); Theoretical computer science; Artificial intelligence","score_opus":0.020191535232790814,"score_gpt":0.24232342902691742,"score_spread":0.2221318937941266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963485651","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064017,0.0008048294,0.055396352,0.001369669,0.0012166506,0.00005100107,0.0010603399,0.002788941,0.9309105],"genre_scores_gemma":[0.14335401,0.0010488544,0.016613567,0.0013265427,0.00067977887,0.00009728012,0.0017417106,0.0036584395,0.8314799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997125,0.000031985594,0.000009231303,0.00007738599,0.00010981346,0.000059133803],"domain_scores_gemma":[0.9998288,0.00002577955,0.00001115191,0.000049480946,0.00005919519,0.000025461111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469106,0.0006276503,0.00046272264,0.0011504501,0.0014116915,0.0023091324,0.0007074599,0.00057430565,0.14140123],"category_scores_gemma":[0.0005183867,0.0003927061,0.00045345776,0.0007241274,0.001250961,0.0036804737,0.0015487086,0.0023403673,0.035933036],"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.000085374886,0.000029974723,0.00010549472,0.000122024765,0.000009433106,0.000054767428,0.00018122104,0.00013868236,0.003400976,0.8622424,0.07552982,0.058099747],"study_design_scores_gemma":[0.000027834529,0.000026418324,0.0002818046,0.000045871424,0.0000124402295,0.00017824302,0.00009512842,0.0006019969,0.004911419,0.48295233,0.5108464,0.000020067357],"about_ca_topic_score_codex":0.0009840534,"about_ca_topic_score_gemma":0.001377539,"teacher_disagreement_score":0.14140123,"about_ca_system_score_codex":0.0009594562,"about_ca_system_score_gemma":0.00045820695,"threshold_uncertainty_score":0.47303426},"labels":[],"label_agreement":null},{"id":"W2963745216","doi":"10.1007/978-3-030-04375-9_38","title":"EREL Selection Using Morphological Relation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","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":"University of Alberta","funders":"","keywords":"Ellipse; Jaccard index; Computer science; Segmentation; Artificial intelligence; Selection (genetic algorithm); Frame (networking); Set (abstract data type); Pattern recognition (psychology); Computer vision; Mathematics; Geometry","score_opus":0.024049992989581846,"score_gpt":0.26119769428065426,"score_spread":0.2371477012910724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963745216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030561121,0.0016047094,0.90558475,0.00023642642,0.00070191396,0.00022801897,0.00086515665,0.015438598,0.044779312],"genre_scores_gemma":[0.177864,0.0013064266,0.7339445,0.00034393015,0.00041205622,0.00017408309,0.0042601116,0.004689485,0.077005446],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934226,0.000057633973,0.000057295074,0.00016693844,0.0002903007,0.000085556225],"domain_scores_gemma":[0.9995259,0.00009813436,0.00002851684,0.00012401419,0.0001808039,0.000042684147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049197057,0.0014849904,0.001382353,0.0037136409,0.0009793208,0.0025200816,0.001345956,0.0010294042,0.038187485],"category_scores_gemma":[0.0009288986,0.0005437753,0.0013215598,0.0023856256,0.00049799087,0.0020550115,0.0015630138,0.00093363976,0.019192657],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050018926,0.000118289725,0.00062091614,0.00041311982,0.000053343138,0.00076083344,0.00007972671,0.0023943963,0.15668997,0.008591963,0.016752789,0.8130245],"study_design_scores_gemma":[0.00017394006,0.000495356,0.0048253853,0.00017132683,0.00033724384,0.0048857285,0.00039958188,0.17897701,0.5629382,0.016989686,0.22958645,0.00022015108],"about_ca_topic_score_codex":0.00047281996,"about_ca_topic_score_gemma":0.0009378278,"teacher_disagreement_score":0.038187485,"about_ca_system_score_codex":0.0002746371,"about_ca_system_score_gemma":0.00039679298,"threshold_uncertainty_score":0.1277498},"labels":[],"label_agreement":null},{"id":"W2963830382","doi":"10.1007/978-3-030-01225-0_4","title":"Local Spectral Graph Convolution for Point Set Feature Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":380,"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":"Pooling; Computer science; Graph; Spectral clustering; Artificial intelligence; Pattern recognition (psychology); Feature (linguistics); Point cloud; Cluster analysis; Convolution (computer science); Segmentation; Theoretical computer science; Artificial neural network","score_opus":0.011964817817716137,"score_gpt":0.22117843624704692,"score_spread":0.20921361842933078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963830382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033379954,0.00031670893,0.9944747,0.000069003254,0.00003591403,0.000009588951,0.000051293493,0.0006696925,0.0010350804],"genre_scores_gemma":[0.2610901,0.001534238,0.7188036,0.00025477234,0.00021236535,0.0001355744,0.0010037478,0.0007546496,0.016211046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997018,0.000058896003,0.000013359235,0.0000836891,0.00011413924,0.000028050119],"domain_scores_gemma":[0.9994611,0.00019940485,0.000033841694,0.00016008715,0.000111884794,0.000033701628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000453691,0.00063293474,0.0009367244,0.0007664107,0.0002700648,0.00078484986,0.0013229134,0.00096903933,0.004596915],"category_scores_gemma":[0.0016192303,0.00032934104,0.00074316375,0.0016012631,0.00066263333,0.0017437557,0.0015006522,0.0013534216,0.0026119172],"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.00013017727,0.00008350492,0.0003764332,0.00022194028,0.00007690736,0.00007830972,0.000069253954,0.12464599,0.020749418,0.09235216,0.013133455,0.7480824],"study_design_scores_gemma":[0.0000030536742,0.00002293821,0.00017614268,0.000007685162,0.000010880369,0.00007833873,0.000009618223,0.9344276,0.0036966256,0.057849612,0.0037076874,0.000009750551],"about_ca_topic_score_codex":0.0018842616,"about_ca_topic_score_gemma":0.0024809346,"teacher_disagreement_score":0.004596915,"about_ca_system_score_codex":0.0006225689,"about_ca_system_score_gemma":0.0004561463,"threshold_uncertainty_score":0.015378237},"labels":[],"label_agreement":null},{"id":"W2963924907","doi":"10.1007/978-3-030-04375-9_31","title":"IVUS-Net: An Intravascular Ultrasound Segmentation Network","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coronary Interventions and Diagnostics","field":"Medicine","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Intravascular ultrasound; Computer science; Jaccard index; Artificial intelligence; Segmentation; Hausdorff distance; Test set; Computer vision; Lumen (anatomy); Adventitia; Zoom; Pattern recognition (psychology); Radiology; Medicine; Optics; Pathology","score_opus":0.01620276926096933,"score_gpt":0.2761491904665572,"score_spread":0.2599464212055879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963924907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010226765,0.0013465084,0.922815,0.0004422319,0.00033431526,0.000232118,0.003977822,0.048579074,0.012046231],"genre_scores_gemma":[0.08861992,0.0016639156,0.8542146,0.00067311886,0.00026608256,0.00043797155,0.013038868,0.0043883575,0.03669712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998437,0.000019852705,0.000009947963,0.000045478362,0.00006575871,0.000015202751],"domain_scores_gemma":[0.99977237,0.00007637586,0.000016687072,0.000047712907,0.000059950842,0.000026938338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045042374,0.0008086686,0.00053364475,0.001214184,0.00031266143,0.0009489155,0.0012939255,0.00065507705,0.010112167],"category_scores_gemma":[0.0011006036,0.0005697566,0.00050025026,0.00080202514,0.0002185169,0.0010241093,0.0011628701,0.0007367999,0.0055402303],"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.00046111413,0.000099340876,0.0011487167,0.00017334975,0.000094093346,0.0001408168,0.000055560307,0.036106087,0.012318761,0.0072871554,0.0924842,0.8496307],"study_design_scores_gemma":[0.000066050525,0.0001153286,0.0015582715,0.000084931395,0.00008390614,0.00045416452,0.00003613097,0.8345845,0.02544926,0.023073025,0.114429414,0.00006504945],"about_ca_topic_score_codex":0.0032683315,"about_ca_topic_score_gemma":0.0049642986,"teacher_disagreement_score":0.010112167,"about_ca_system_score_codex":0.0005825612,"about_ca_system_score_gemma":0.0006350157,"threshold_uncertainty_score":0.033828557},"labels":[],"label_agreement":null},{"id":"W2964248098","doi":"10.1007/978-3-030-11018-5_21","title":"Learnable Pooling Methods for Video Classification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pooling; Computer science; Artificial intelligence","score_opus":0.03735968409245802,"score_gpt":0.35151771802476095,"score_spread":0.3141580339323029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964248098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034569926,0.0021664866,0.9913084,0.00014836491,0.00010990292,0.0000314436,0.0001880767,0.0011067573,0.0014835855],"genre_scores_gemma":[0.13664421,0.0032880015,0.8270286,0.0003402202,0.0006370082,0.00024294946,0.0022746103,0.00074606173,0.028798234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994779,0.00010296853,0.00003462295,0.0001656956,0.0001385803,0.000080152065],"domain_scores_gemma":[0.9994771,0.00020869264,0.00004409316,0.00012616428,0.0001141875,0.000029809045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012177634,0.0016336823,0.0014318635,0.0010067425,0.00038644692,0.0013084791,0.0023898478,0.0013906255,0.0066604204],"category_scores_gemma":[0.0022566156,0.00055667036,0.0012996162,0.0017271143,0.00057735824,0.0025488336,0.0018076744,0.0019205988,0.0026497345],"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.00013670172,0.00009046797,0.00025368328,0.00018707004,0.00014455637,0.00005053707,0.00005129616,0.043359112,0.013179116,0.016956074,0.013248771,0.9123425],"study_design_scores_gemma":[0.000014412645,0.000060169008,0.0004013362,0.000032890974,0.000055570654,0.00008046321,0.000020844302,0.9496359,0.010152756,0.03274731,0.0067788423,0.0000193886],"about_ca_topic_score_codex":0.0049878135,"about_ca_topic_score_gemma":0.005705515,"teacher_disagreement_score":0.0066604204,"about_ca_system_score_codex":0.00090582925,"about_ca_system_score_gemma":0.0006351292,"threshold_uncertainty_score":0.022281349},"labels":[],"label_agreement":null},{"id":"W2964280466","doi":"10.1007/978-3-662-43722-3_3","title":"Silicon Atomic Quantum Dots Enable Beyond-CMOS Electronics","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Institute for Nanotechnology; University of Alberta","funders":"","keywords":"Quantum dot cellular automaton; Quantum dot; Quantum cellular automaton; Dangling bond; Silicon; Quantum computer; Quantum; Computer science; Nanotechnology; Fabrication; Atom (system on chip); Electronic circuit; Optoelectronics; Materials science; Physics; Quantum mechanics; Embedded system","score_opus":0.010068649075813453,"score_gpt":0.2219131296387508,"score_spread":0.21184448056293734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964280466","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.113819666,0.09953269,0.20076048,0.009706114,0.009399354,0.00010454564,0.0008519248,0.0018172984,0.5640079],"genre_scores_gemma":[0.70968544,0.04211093,0.0865488,0.0013425829,0.0009102243,0.00007063181,0.00046892685,0.0002842355,0.15857825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994516,0.000005672372,0.0000027146036,0.000011963112,0.00002528838,0.000009207933],"domain_scores_gemma":[0.99993634,0.000027315573,0.0000038008693,0.000010452745,0.000015377367,0.0000066417174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011212402,0.00027751928,0.00020291285,0.00021456507,0.0002277226,0.00087333814,0.0003545345,0.00063409103,0.0058304286],"category_scores_gemma":[0.00022653457,0.00017164648,0.00017471467,0.0002592576,0.0004858512,0.0012618311,0.0005495402,0.0007545077,0.0017565801],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006036919,0.0000456787,0.00019794522,0.00047753294,0.000026051846,0.00015289603,0.00016819847,0.0023989321,0.13000605,0.69046175,0.022662751,0.15334183],"study_design_scores_gemma":[0.000022370717,0.00009606741,0.00035151542,0.00017852687,0.000027603026,0.00035368738,0.00008548072,0.011371083,0.12412545,0.257757,0.60560143,0.000029871675],"about_ca_topic_score_codex":0.00016634558,"about_ca_topic_score_gemma":0.00047891404,"teacher_disagreement_score":0.0058304286,"about_ca_system_score_codex":0.00032319082,"about_ca_system_score_gemma":0.00018044372,"threshold_uncertainty_score":0.019504726},"labels":[],"label_agreement":null},{"id":"W2964301491","doi":"10.1007/978-3-642-40579-2_26","title":"Sets Represented as the Length-n Factors of a Word","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Word (group theory); Upper and lower bounds; Combinatorics; Binary number; Mathematics; Set (abstract data type); Combinatorics on words; Discrete mathematics; Finite set; Word length; Computer science; Arithmetic; Natural language processing; Linguistics","score_opus":0.0172427046136661,"score_gpt":0.24584312987546808,"score_spread":0.22860042526180196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964301491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16855466,0.0049897498,0.55716366,0.001322982,0.001771216,0.00019870968,0.00167463,0.001729865,0.2625945],"genre_scores_gemma":[0.6498865,0.0035971054,0.19196223,0.00040815506,0.001024289,0.00030976813,0.0020016097,0.0007997689,0.15001065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992779,0.00015594205,0.0000663324,0.00021574313,0.00017152628,0.000112586495],"domain_scores_gemma":[0.99943787,0.00025902185,0.000063201376,0.0001007309,0.000097973854,0.000041258743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040051583,0.0007614376,0.000520454,0.0013037918,0.0010643916,0.0036160375,0.0008524554,0.00071837095,0.013366042],"category_scores_gemma":[0.0017290341,0.00047038027,0.00087145786,0.0011860145,0.0017326619,0.0035874527,0.0012080392,0.00096759055,0.004158301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025423607,0.000028075488,0.0003477992,0.00021164307,0.00003159751,0.00029438172,0.0009940264,0.001983399,0.01288509,0.9189216,0.0056063873,0.05844182],"study_design_scores_gemma":[0.000031047224,0.00007699916,0.00043453713,0.00020965883,0.000063796026,0.00051011296,0.00047976858,0.009344837,0.010025905,0.86640066,0.11236755,0.000055049186],"about_ca_topic_score_codex":0.0008139993,"about_ca_topic_score_gemma":0.0010502252,"teacher_disagreement_score":0.013366042,"about_ca_system_score_codex":0.0009614648,"about_ca_system_score_gemma":0.00048565387,"threshold_uncertainty_score":0.044713855},"labels":[],"label_agreement":null},{"id":"W2964374341","doi":"10.1007/978-3-030-28423-7_9","title":"Mutant Accuracy Testing for Assessing the Implementation of Numerical Algorithms","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Implementation; Computer science; MATLAB; Algorithm; Regression testing; Process (computing); Mutation; Software; Software development; Programming language","score_opus":0.0439389944210681,"score_gpt":0.3484687972418413,"score_spread":0.30452980282077324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964374341","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.17479503,0.00079618586,0.8139892,0.00019307669,0.00014220517,0.00011530938,0.00034333585,0.0051957564,0.004429978],"genre_scores_gemma":[0.58562535,0.0001460835,0.4115942,0.000052262927,0.000022985569,0.000111838955,0.0005404163,0.00055646943,0.0013503747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9908879,0.004055422,0.0006283991,0.0007611585,0.0033322044,0.00033483774],"domain_scores_gemma":[0.93242747,0.05085191,0.0027862915,0.007646435,0.0055410536,0.00074690743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043593203,0.0012014547,0.00080651266,0.0024564457,0.00047541453,0.0012436694,0.003142649,0.0015938772,0.002513995],"category_scores_gemma":[0.054369103,0.0004640849,0.0006818953,0.0015274624,0.0012125896,0.0023418842,0.0011100158,0.0014141015,0.00056665635],"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.0014897661,0.0008133163,0.040856384,0.00062302715,0.00025708857,0.00037459537,0.00035608897,0.30329874,0.047989376,0.039228242,0.0063817604,0.5583316],"study_design_scores_gemma":[0.000045196855,0.000435179,0.003945117,0.0000667914,0.000052049847,0.00026335966,0.000058663252,0.95158154,0.029340584,0.013053603,0.0011224907,0.000035374273],"about_ca_topic_score_codex":0.0020045282,"about_ca_topic_score_gemma":0.0019561583,"teacher_disagreement_score":0.0043593203,"about_ca_system_score_codex":0.00083270407,"about_ca_system_score_gemma":0.0010083392,"threshold_uncertainty_score":0.02305454},"labels":[],"label_agreement":null},{"id":"W2964549879","doi":"10.1007/978-3-030-23679-3_18","title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Deterministic automaton; Nondeterministic finite automaton; Decidability; Nondeterministic algorithm; Unary operation; Deterministic finite automaton; Discrete mathematics; Automaton; Two-way deterministic finite automaton; Decision problem; Computer science; Büchi automaton; Equivalence (formal languages); Combinatorics; Mathematics; Finite-state machine; Automata theory; Algorithm; Theoretical computer science","score_opus":0.017336484729493278,"score_gpt":0.25404343266138335,"score_spread":0.23670694793189007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964549879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22320023,0.0018617298,0.7304277,0.0022737947,0.00038527258,0.00034949236,0.00080003036,0.0004705994,0.04023116],"genre_scores_gemma":[0.81264675,0.0011170487,0.16463336,0.00033777856,0.0004591191,0.00045748468,0.0013822997,0.00018398893,0.018782249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605584,0.0016968307,0.00034468787,0.0008561646,0.00058825576,0.00045826207],"domain_scores_gemma":[0.98439205,0.01294921,0.00042490457,0.0011266123,0.0005445198,0.0005627152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003489549,0.00089455646,0.0015799745,0.0007802779,0.0009991913,0.0050624833,0.0030450933,0.0019452363,0.0073458194],"category_scores_gemma":[0.012201148,0.00078049314,0.002295094,0.0014034563,0.003151309,0.007396079,0.003031904,0.0047120494,0.0006679059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042649073,0.0001992158,0.0004957912,0.0002922034,0.00008301186,0.00018304202,0.0003938942,0.052107897,0.0018594412,0.9121306,0.003390002,0.02843845],"study_design_scores_gemma":[0.00008850437,0.00005872162,0.00014484659,0.000027924638,0.000029079985,0.00010555607,0.0001249716,0.13751042,0.0008000296,0.85914767,0.0019352236,0.000027048276],"about_ca_topic_score_codex":0.0013637202,"about_ca_topic_score_gemma":0.0011832927,"teacher_disagreement_score":0.0073458194,"about_ca_system_score_codex":0.0016887182,"about_ca_system_score_gemma":0.0011322993,"threshold_uncertainty_score":0.02457422},"labels":[],"label_agreement":null},{"id":"W2964657030","doi":"10.1007/978-3-030-26766-7_19","title":"Optimizing Self-organizing Lists-on-Lists Using Pursuit-Oriented Enhanced Object Partitioning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Computer science; Probabilistic logic; Learning automata; Object (grammar); Locality; Context (archaeology); Automaton; De facto; Theoretical computer science; Reinforcement learning; Artificial intelligence; Scheme (mathematics); Mathematics","score_opus":0.023128662896949592,"score_gpt":0.26818415449428973,"score_spread":0.24505549159734014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964657030","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.032559227,0.0003358889,0.9622518,0.000104631676,0.000063048916,0.000060612096,0.00007047823,0.0007895306,0.0037648317],"genre_scores_gemma":[0.5304995,0.00024718215,0.46086234,0.00015166115,0.00008742545,0.0002237302,0.00039462093,0.00030066018,0.0072328835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971014,0.00006653328,0.000015014188,0.00005455759,0.00009491005,0.000058888407],"domain_scores_gemma":[0.9993481,0.0003575727,0.00004641092,0.000072336035,0.0001227944,0.000052671076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049489253,0.0008501313,0.0013905128,0.000610247,0.00063722825,0.0011093932,0.0018247657,0.0012006933,0.0043331226],"category_scores_gemma":[0.0014255104,0.0005930374,0.00057791267,0.0010239205,0.00042844444,0.0013606669,0.0016027328,0.0006894772,0.0008696582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033511317,0.00020151684,0.00042838705,0.00014582032,0.000059899292,0.00005926059,0.00008048931,0.8039068,0.009589359,0.008900506,0.004712368,0.17158054],"study_design_scores_gemma":[0.000009555036,0.00003893233,0.000039902585,0.0000026127223,0.0000049284604,0.000010444513,0.000009356198,0.9979746,0.00062128925,0.0010371903,0.00024799636,0.0000032107992],"about_ca_topic_score_codex":0.0027123517,"about_ca_topic_score_gemma":0.0035750226,"teacher_disagreement_score":0.0043331226,"about_ca_system_score_codex":0.0006115422,"about_ca_system_score_gemma":0.00074888027,"threshold_uncertainty_score":0.014495671},"labels":[],"label_agreement":null},{"id":"W2965152924","doi":"10.1007/978-3-030-26807-7_11","title":"Error-Free Stable Computation with Polymer-Supplemented Chemical Reaction Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Bottleneck; Computer science; Computation; Turing; Polymer; Turing machine; Theoretical computer science; Algorithm; Chemistry","score_opus":0.007435960383910231,"score_gpt":0.22323302100800888,"score_spread":0.21579706062409865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965152924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0615054,0.00013983031,0.93237656,0.00022908922,0.000058762136,0.000035518242,0.000084365194,0.00074121746,0.004829341],"genre_scores_gemma":[0.79664356,0.00012034292,0.19734046,0.000064554646,0.000039555543,0.00013969066,0.00015900302,0.00023520332,0.0052575683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996086,0.00011646496,0.00002422751,0.00008876451,0.00011526398,0.00004684762],"domain_scores_gemma":[0.99719954,0.0020911905,0.00012845718,0.00028253262,0.00021453014,0.000083727035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008733307,0.00068713963,0.0009974255,0.0004315085,0.0005021375,0.0013163948,0.0015725311,0.0011753304,0.0027068537],"category_scores_gemma":[0.00518751,0.0005845569,0.00064792234,0.0006364875,0.001145856,0.0015595863,0.0017019463,0.0012584901,0.00055085385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016071222,0.000027351929,0.00021239257,0.000042530846,0.000025375071,0.00004620124,0.000037832266,0.96021885,0.0018727346,0.02120394,0.00039559134,0.01575653],"study_design_scores_gemma":[0.000005388557,0.0000040434134,0.000009334099,0.000001232815,0.0000018354845,0.0000025810384,0.0000010966442,0.99322754,0.00040760086,0.006267822,0.0000699731,0.0000015024026],"about_ca_topic_score_codex":0.0023622876,"about_ca_topic_score_gemma":0.0024936502,"teacher_disagreement_score":0.0027068537,"about_ca_system_score_codex":0.0007758633,"about_ca_system_score_gemma":0.0009396851,"threshold_uncertainty_score":0.009055316},"labels":[],"label_agreement":null},{"id":"W2965872889","doi":"10.1007/978-3-030-26969-2_17","title":"Improved Spectral Clustering Method for Identifying Cell Types from Single-Cell Data","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Single-cell and spatial transcriptomics","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan","funders":"","keywords":"Cluster analysis; Overfitting; Computer science; Spectral clustering; Artificial intelligence; Robustness (evolution); Pattern recognition (psychology); Data mining; Similarity (geometry); Cell type; Gene; Cell; Biology; Artificial neural network; Genetics","score_opus":0.043903449614674135,"score_gpt":0.2785034865042692,"score_spread":0.23460003688959508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965872889","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.005261242,0.00022229335,0.9924534,0.000040018276,0.00005687321,0.000034963996,0.0002294637,0.0012232212,0.00047851555],"genre_scores_gemma":[0.050163485,0.00025256642,0.94328064,0.00007532517,0.00008020258,0.00016937758,0.0015747863,0.00035962596,0.0040439423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992632,0.00012281396,0.00004644718,0.00018698715,0.0003215534,0.00005904137],"domain_scores_gemma":[0.99895465,0.0002897976,0.000046308443,0.0001772038,0.00048801737,0.00004401534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010072154,0.0008393083,0.0010408612,0.0020822869,0.0007854156,0.0008520997,0.001839833,0.0009568353,0.0029927022],"category_scores_gemma":[0.0015202456,0.00030277763,0.0013913726,0.0021495824,0.0004286896,0.0007894055,0.0011189794,0.0007901969,0.00316807],"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.00030301392,0.00017098928,0.0015025311,0.00018937168,0.00021234933,0.00014449487,0.00014711043,0.060050715,0.07885333,0.0053995615,0.010533601,0.84249294],"study_design_scores_gemma":[0.000017227017,0.000030520958,0.00204396,0.000009692841,0.000063093605,0.00018454004,0.00004835276,0.97236043,0.013042889,0.0063988315,0.005755934,0.000044505156],"about_ca_topic_score_codex":0.0058194133,"about_ca_topic_score_gemma":0.0084098,"teacher_disagreement_score":0.0058194133,"about_ca_system_score_codex":0.00047185304,"about_ca_system_score_gemma":0.001002565,"threshold_uncertainty_score":0.01157105},"labels":[],"label_agreement":null},{"id":"W2966006541","doi":"10.1007/978-3-030-25965-5_21","title":"Using Proxy Haptic for a Pointing Task in the Virtual World: A Usability Study","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Haptic technology; Computer science; Human–computer interaction; Virtual reality; Usability; Sense of presence; Virtual machine; Multimedia; Rendering (computer graphics); Simulation; Artificial intelligence","score_opus":0.048367341055167365,"score_gpt":0.31859778546724266,"score_spread":0.2702304444120753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966006541","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.9787885,0.0013392032,0.01633812,0.00011688383,0.00012669216,0.000491476,0.000119841105,0.00023722634,0.0024419832],"genre_scores_gemma":[0.9767751,0.0009849425,0.017864447,0.00015425323,0.000058330676,0.0005190495,0.00018775328,0.00019067433,0.003265435],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.994487,0.0033188423,0.0005543777,0.0005464956,0.0007347016,0.0003586182],"domain_scores_gemma":[0.96120894,0.033325154,0.0005416017,0.002136766,0.002241443,0.0005460809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008677922,0.0018657171,0.0016911823,0.0011808173,0.0009994878,0.0020640926,0.0017879299,0.0021476215,0.004659655],"category_scores_gemma":[0.03239444,0.0006899366,0.00094769,0.0008260187,0.001049857,0.0024149823,0.0014244702,0.0009366888,0.00096409646],"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.037923828,0.024682155,0.032712262,0.018406967,0.00096337183,0.0058585373,0.11423217,0.0032182047,0.29722646,0.0021352435,0.0059377016,0.45670313],"study_design_scores_gemma":[0.008928983,0.31475887,0.23557605,0.0045749773,0.005879022,0.021341946,0.10417968,0.041314445,0.20695591,0.002994662,0.051946692,0.0015487963],"about_ca_topic_score_codex":0.0014267205,"about_ca_topic_score_gemma":0.001041369,"teacher_disagreement_score":0.008677922,"about_ca_system_score_codex":0.00026517137,"about_ca_system_score_gemma":0.0006544296,"threshold_uncertainty_score":0.04589373},"labels":[],"label_agreement":null},{"id":"W2966516840","doi":"10.1007/978-3-031-11321-5_10","title":"The Fault-Tolerant Cluster-Sending Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"McMaster University","funders":"","keywords":"Computer science; Scalability; Byzantine fault tolerance; Distributed computing; Fault tolerance; Cluster (spacecraft); Computer network; Database","score_opus":0.013027981996962527,"score_gpt":0.23651509434461376,"score_spread":0.22348711234765123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966516840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1610739,0.003178709,0.71512675,0.024390807,0.0012161784,0.00024913877,0.00076864654,0.0019526948,0.092043154],"genre_scores_gemma":[0.84856105,0.0024748745,0.0957747,0.0016266062,0.0014747789,0.0002921023,0.0007175218,0.00066212285,0.048416287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801934,0.00059332425,0.00008587314,0.00040878647,0.00057916157,0.00031343912],"domain_scores_gemma":[0.98926544,0.007843724,0.000532754,0.0013372261,0.0005929323,0.00042789357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025722953,0.00075725396,0.001741898,0.0010026079,0.0032819486,0.0041550756,0.0033945807,0.004352411,0.00838797],"category_scores_gemma":[0.017160779,0.0008471467,0.0007333038,0.0029213214,0.0033268994,0.0077865724,0.0030519352,0.0041526,0.0011932112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051098526,0.000119480675,0.00048702277,0.00033169176,0.000056860612,0.0002489517,0.00048708523,0.08895333,0.0017726046,0.8119982,0.035089433,0.059944384],"study_design_scores_gemma":[0.00010892319,0.000028170614,0.00017551244,0.00003367744,0.00003463895,0.00022639363,0.00018313645,0.15707578,0.0021398093,0.8314067,0.008561442,0.000025812182],"about_ca_topic_score_codex":0.0016135912,"about_ca_topic_score_gemma":0.0010235021,"teacher_disagreement_score":0.00838797,"about_ca_system_score_codex":0.0021867151,"about_ca_system_score_gemma":0.001933477,"threshold_uncertainty_score":0.028060615},"labels":[],"label_agreement":null},{"id":"W2966560041","doi":"10.1007/978-3-030-25027-0_17","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Bipartite graph; Combinatorics; Planar graph; Vertex cover; Computer science; Graph; Discrete mathematics; Pathwidth; Bounded function; Mathematics; Line graph","score_opus":0.01847064711104523,"score_gpt":0.2587484430426983,"score_spread":0.24027779593165305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966560041","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.43693507,0.0024702488,0.35112146,0.0072629345,0.00031540878,0.00037730037,0.0038636585,0.0016614046,0.19599251],"genre_scores_gemma":[0.87492204,0.0029696492,0.078285985,0.0009892734,0.000674612,0.0007835553,0.0042361305,0.0013000858,0.035838746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700254,0.0010564377,0.00014166125,0.00068265555,0.000619832,0.0004969118],"domain_scores_gemma":[0.9657966,0.028584523,0.0014868738,0.0022627104,0.00075404363,0.001115218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183079,0.0015601618,0.002739175,0.002685923,0.0031933573,0.005929658,0.0038346832,0.0036999348,0.021571249],"category_scores_gemma":[0.02049301,0.0017457437,0.0036670484,0.00508437,0.004505712,0.012270536,0.0047519878,0.005783637,0.0019182413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006367827,0.00022809522,0.0020726586,0.00075758074,0.0001578382,0.0004311945,0.0009900109,0.14196032,0.003494916,0.8073699,0.013032033,0.028868718],"study_design_scores_gemma":[0.000056037275,0.00006420039,0.0005469292,0.00008644249,0.000056493376,0.00026220584,0.00011964143,0.11586108,0.00076331804,0.87864256,0.003514345,0.00002682546],"about_ca_topic_score_codex":0.005401136,"about_ca_topic_score_gemma":0.004962024,"teacher_disagreement_score":0.021571249,"about_ca_system_score_codex":0.0036205982,"about_ca_system_score_gemma":0.0018724959,"threshold_uncertainty_score":0.072163045},"labels":[],"label_agreement":null},{"id":"W2966661","doi":"10.1007/978-3-642-21735-7_6","title":"Transforming Auto-Encoders","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1323,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Scale-invariant feature transform; Artificial neural network; Feature (linguistics); Domain (mathematical analysis); Orientation (vector space); Representation (politics); Encoder; Computer vision; Pattern recognition (psychology); Feature extraction; Mathematics","score_opus":0.02486934333846073,"score_gpt":0.26716758213346703,"score_spread":0.2422982387950063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966661","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.015313959,0.0005990793,0.9594315,0.00022286481,0.0005307346,0.00007433181,0.00064846006,0.0056136167,0.017565463],"genre_scores_gemma":[0.283426,0.001148418,0.65019834,0.00041612185,0.00030616697,0.00014198248,0.0025721611,0.0020083028,0.05978252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00011173145,0.000032363158,0.00015677653,0.00029887346,0.000073482486],"domain_scores_gemma":[0.9990872,0.00021876115,0.000037292728,0.00036483482,0.00026258826,0.000029237835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181052,0.000898048,0.000388659,0.0007853224,0.00033026608,0.0010116734,0.00061019935,0.0008268921,0.017953351],"category_scores_gemma":[0.0021205533,0.00046527138,0.0005297854,0.00074977,0.00043472686,0.0012920081,0.0012160607,0.0008560454,0.007954718],"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.00036942805,0.000094363255,0.000551414,0.00019176335,0.000068386405,0.00039090254,0.00013043817,0.030552652,0.047553055,0.11035497,0.019189183,0.7905534],"study_design_scores_gemma":[0.00008068423,0.0002078653,0.0010558537,0.00015213367,0.00012756686,0.0014091226,0.00015561328,0.4833118,0.26334324,0.116453335,0.13361461,0.00008818862],"about_ca_topic_score_codex":0.0012249717,"about_ca_topic_score_gemma":0.0021740403,"teacher_disagreement_score":0.017953351,"about_ca_system_score_codex":0.00035449667,"about_ca_system_score_gemma":0.0005392992,"threshold_uncertainty_score":0.060059965},"labels":[],"label_agreement":null},{"id":"W2967130730","doi":"10.1007/978-3-030-27202-9_32","title":"Safely Caching HOG Pyramid Feature Levels, to Speed up Facial Landmark Detection","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Alcohol Countermeasure Systems (Canada); Toronto Metropolitan University","funders":"","keywords":"Computer science; Landmark; Artificial intelligence; Histogram; Pyramid (geometry); Feature (linguistics); Computer vision; Pattern recognition (psychology); Scale (ratio); Object detection; Naive Bayes classifier; Histogram of oriented gradients; Object (grammar); Image (mathematics); Support vector machine; Mathematics","score_opus":0.029565912019654104,"score_gpt":0.282781595580986,"score_spread":0.2532156835613319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967130730","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.13797711,0.0025851172,0.8210243,0.0003675219,0.00095655955,0.00026740285,0.0025859172,0.025702735,0.008533324],"genre_scores_gemma":[0.4010128,0.0010080395,0.57171565,0.0004008991,0.00013625817,0.000120953366,0.003476524,0.0014088384,0.020720132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996816,0.000017020364,0.0000144930555,0.00007153659,0.00015046132,0.000064785716],"domain_scores_gemma":[0.99958736,0.000075538475,0.000023361661,0.00013635492,0.00014608435,0.00003126404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027951988,0.0010423557,0.00090972276,0.0010635706,0.0004409792,0.0013820608,0.0012080456,0.00053854764,0.009125137],"category_scores_gemma":[0.001652399,0.0006236926,0.0005198707,0.0014813853,0.0002776204,0.0016791472,0.0013160375,0.00070268085,0.0036986682],"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.0009025332,0.00022876167,0.002419448,0.0001264493,0.000106980464,0.00022714643,0.00006475482,0.016938576,0.100190856,0.0025363965,0.0347052,0.8415529],"study_design_scores_gemma":[0.00012610696,0.00031040775,0.003939764,0.000027833421,0.0001349119,0.0004324748,0.00012819807,0.8826493,0.08949739,0.0069212103,0.015790956,0.000041362775],"about_ca_topic_score_codex":0.01719558,"about_ca_topic_score_gemma":0.04558695,"teacher_disagreement_score":0.01719558,"about_ca_system_score_codex":0.0005657759,"about_ca_system_score_gemma":0.0014550713,"threshold_uncertainty_score":0.034191012},"labels":[],"label_agreement":null},{"id":"W2967139614","doi":"10.1007/978-3-030-27202-9_18","title":"An Improved Weighted Average Reprojection Image Denoising Method","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Western University","funders":"","keywords":"Noise reduction; Artificial intelligence; Computer science; Reprojection error; Pattern recognition (psychology); Non-local means; Computer vision; Image denoising; Video denoising; Image (mathematics); Noise (video); Domain (mathematical analysis); Algorithm; Mathematics; Video processing; Video tracking","score_opus":0.016885398281641865,"score_gpt":0.2963270560566707,"score_spread":0.27944165777502883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967139614","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.0018087575,0.00027926714,0.9963421,0.00004065191,0.000088552195,0.000014660949,0.00002280074,0.00023988825,0.0011632625],"genre_scores_gemma":[0.026178634,0.00054385077,0.96305317,0.00010948606,0.00011651386,0.0000461464,0.00017391585,0.00024996352,0.009528321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993492,0.000108121356,0.000035590703,0.00013553053,0.00033946446,0.000032098986],"domain_scores_gemma":[0.99956125,0.000084986634,0.000028612189,0.0001015696,0.00020423972,0.00001932677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139321,0.0009801997,0.0010909635,0.00095877075,0.00031001642,0.00079878856,0.0013412614,0.0014076139,0.0041853115],"category_scores_gemma":[0.0009769027,0.0005244211,0.001293432,0.00089929136,0.0004353705,0.0010595133,0.0010793544,0.001252845,0.0023451585],"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.00020466409,0.000100402685,0.00036980017,0.00038648245,0.00020299236,0.0001932568,0.00013838588,0.0688632,0.17864884,0.022902735,0.0069903387,0.7209988],"study_design_scores_gemma":[0.000020996486,0.000078159595,0.00045010998,0.00002643685,0.00010646251,0.0006280632,0.00001910166,0.92437524,0.046984646,0.0053063645,0.021951405,0.000053049043],"about_ca_topic_score_codex":0.0010958606,"about_ca_topic_score_gemma":0.0018362585,"teacher_disagreement_score":0.0041853115,"about_ca_system_score_codex":0.000245391,"about_ca_system_score_gemma":0.0005166671,"threshold_uncertainty_score":0.01400131},"labels":[],"label_agreement":null},{"id":"W2967179177","doi":"10.1007/978-3-030-27202-9_3","title":"Image Structure Subspace Learning Using Structural Similarity Index","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subspace topology; Index (typography); Similarity (geometry); Structural similarity; Pattern recognition (psychology); Artificial intelligence; Computer science; Image (mathematics); Mathematics; World Wide Web","score_opus":0.020651567690926322,"score_gpt":0.2829019681670402,"score_spread":0.2622504004761139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967179177","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.008335923,0.00023597476,0.9895342,0.00006267748,0.00002984006,0.00002753881,0.000065039334,0.00036633562,0.0013424597],"genre_scores_gemma":[0.20417921,0.0010300572,0.78540814,0.00012750181,0.00012847559,0.00012708784,0.0009865358,0.0002547417,0.007758219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.000048061673,0.00001695346,0.000084421925,0.00015424006,0.000024251705],"domain_scores_gemma":[0.99960476,0.00008550992,0.0000412079,0.00008922247,0.00015280908,0.000026499163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043991,0.00052954105,0.0010207726,0.0013226778,0.0003145528,0.0008261006,0.0006500469,0.0005418427,0.002559114],"category_scores_gemma":[0.0010235948,0.00025315638,0.0008174248,0.0015689848,0.00045347287,0.0016094482,0.0010157431,0.00085518043,0.0013632753],"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.000118999706,0.000114772185,0.00065284275,0.00011732015,0.00007941565,0.000035089837,0.000047269314,0.053047415,0.04331032,0.01724181,0.0045689223,0.8806657],"study_design_scores_gemma":[0.00000856161,0.0001228005,0.00062209397,0.000011719264,0.000031657226,0.00013168617,0.00002542459,0.96509945,0.016178612,0.014716793,0.003028431,0.000022676504],"about_ca_topic_score_codex":0.0008433974,"about_ca_topic_score_gemma":0.0012559557,"teacher_disagreement_score":0.002559114,"about_ca_system_score_codex":0.0002817712,"about_ca_system_score_gemma":0.00054650824,"threshold_uncertainty_score":0.008561134},"labels":[],"label_agreement":null},{"id":"W2967270601","doi":"10.1007/978-3-030-27272-2_17","title":"Design of an End-to-End Dual Mode Driver Distraction Detection System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sleep and Work-Related Fatigue","field":"Psychology","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distraction; Convolutional neural network; Memory footprint; End-to-end principle; RGB color model; Artificial intelligence; Footprint; Mode (computer interface); Artificial neural network; Real-time computing; Dual mode; Deep learning; Computer vision; Human–computer interaction","score_opus":0.023079513796245087,"score_gpt":0.2763230000071967,"score_spread":0.2532434862109516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967270601","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.05317821,0.00032511496,0.92772365,0.0002219539,0.00041344864,0.0008818219,0.00039878272,0.012654943,0.0042020534],"genre_scores_gemma":[0.5392736,0.00023340459,0.43744266,0.00088242313,0.00018945769,0.0010960196,0.0006584188,0.0004221235,0.019801896],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995111,0.000044918237,0.000027906437,0.00019129003,0.00015222086,0.000072479255],"domain_scores_gemma":[0.9994235,0.000108176224,0.000034522283,0.00004429723,0.00032691043,0.000062613326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052658346,0.0008611029,0.0009149262,0.00064445904,0.00066583115,0.001037596,0.0025445665,0.0012031886,0.0064422553],"category_scores_gemma":[0.000546365,0.00063813897,0.00038939554,0.00026314598,0.00018954654,0.0005862368,0.00077751494,0.0005686933,0.0033939113],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020127508,0.00089161674,0.0045274226,0.0005836813,0.00020587523,0.00056464045,0.00035250827,0.00804532,0.6349281,0.0021191663,0.012212564,0.3335564],"study_design_scores_gemma":[0.00052195485,0.0040268516,0.013129465,0.00009640781,0.0004073738,0.0019955656,0.00018168635,0.4774159,0.45576057,0.0014130768,0.044840824,0.00021036707],"about_ca_topic_score_codex":0.0014052291,"about_ca_topic_score_gemma":0.0016254041,"teacher_disagreement_score":0.0064422553,"about_ca_system_score_codex":0.00042698192,"about_ca_system_score_gemma":0.0007509499,"threshold_uncertainty_score":0.02155149},"labels":[],"label_agreement":null},{"id":"W2967344057","doi":"10.1007/978-3-030-27878-6_1","title":"IEC 61499 and the Promise of Holonic Systems","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Flexible and Reconfigurable Manufacturing Systems","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 Calgary","funders":"","keywords":"Computer science; Automation; Perspective (graphical); Manufacturing engineering; Systems engineering; Engineering; Artificial intelligence; Mechanical engineering","score_opus":0.008727526209408414,"score_gpt":0.19072880811636564,"score_spread":0.18200128190695722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967344057","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073563624,0.04437957,0.19859515,0.012497184,0.009660963,0.0001579789,0.0003199041,0.0009867987,0.726046],"genre_scores_gemma":[0.17758758,0.08649559,0.2523231,0.01150446,0.0061265114,0.00048405543,0.0016773992,0.00076982664,0.46303153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855894,0.0002819589,0.00010412422,0.00008880975,0.00086545525,0.00010071606],"domain_scores_gemma":[0.9989942,0.0004204454,0.000050077644,0.00017202302,0.00031711982,0.00004613215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019417679,0.0010387879,0.00050410454,0.0013406983,0.0006967049,0.0034193406,0.0009809134,0.002732835,0.009923518],"category_scores_gemma":[0.0030085277,0.00045305784,0.00033895278,0.0014230154,0.0025727493,0.004988363,0.0013370648,0.0041943877,0.0034438237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005077405,0.000039467144,0.00004510179,0.00017360131,0.0000077688965,0.00009905069,0.00012165482,0.0015605921,0.0017356696,0.83312154,0.028970746,0.13407417],"study_design_scores_gemma":[0.00001962614,0.000063949454,0.00015128213,0.00027606305,0.000010502852,0.00019573349,0.00006344085,0.00293562,0.0022891748,0.38984656,0.60412097,0.000027023467],"about_ca_topic_score_codex":0.0016185443,"about_ca_topic_score_gemma":0.002022006,"teacher_disagreement_score":0.009923518,"about_ca_system_score_codex":0.0012217015,"about_ca_system_score_gemma":0.0012788617,"threshold_uncertainty_score":0.033197463},"labels":[],"label_agreement":null},{"id":"W2967468293","doi":"10.1007/978-3-030-27202-9_7","title":"Principal Component Analysis Using Structural Similarity Index for Images","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subspace topology; Principal component analysis; Pattern recognition (psychology); Kernel principal component analysis; Euclidean distance; Kernel (algebra); Similarity (geometry); Image (mathematics); Fidelity; Component (thermodynamics)","score_opus":0.03915807744217148,"score_gpt":0.32553387816988755,"score_spread":0.28637580072771607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967468293","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.013804834,0.00057561847,0.98242503,0.000071344424,0.00009175669,0.00010432765,0.00024993866,0.001198362,0.0014788077],"genre_scores_gemma":[0.11511812,0.00095499837,0.8787948,0.000031384927,0.000113628856,0.0002410297,0.0012626318,0.00032727342,0.0031561404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.00016665384,0.000059491544,0.00017525337,0.00035608327,0.0000576757],"domain_scores_gemma":[0.9991136,0.00021323343,0.00005424005,0.00012188204,0.00046629886,0.000030718955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007882471,0.0009083949,0.0010431932,0.0029104536,0.0004850758,0.0013433716,0.0007628378,0.00050715776,0.003569366],"category_scores_gemma":[0.00215146,0.0002600012,0.0011988595,0.0042042397,0.00035724897,0.0011718146,0.00076152716,0.0009014991,0.0020538012],"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.00022042272,0.00011105547,0.0008073097,0.0002430475,0.000107719374,0.000057301113,0.00006891699,0.014755226,0.043745775,0.005223051,0.00497191,0.9296883],"study_design_scores_gemma":[0.000030688116,0.00025877389,0.007994224,0.000037603273,0.00020171057,0.00030603318,0.00012753773,0.9266604,0.043859564,0.009552545,0.010874312,0.00009668364],"about_ca_topic_score_codex":0.0025333394,"about_ca_topic_score_gemma":0.0021913333,"teacher_disagreement_score":0.003569366,"about_ca_system_score_codex":0.0003378562,"about_ca_system_score_gemma":0.0008408589,"threshold_uncertainty_score":0.011940718},"labels":[],"label_agreement":null},{"id":"W2967555058","doi":"10.1007/978-3-030-27202-9_6","title":"Drift Detection Using SVM in Structured Object Tracking","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Concordia University","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Support vector machine; Segmentation; Leverage (statistics); Video tracking; Tracking (education); Particle filter; Bounding overwatch; Minimum bounding box; Structured support vector machine; Pattern recognition (psychology); Structured prediction; Object detection; Object (grammar); Kalman filter; Image (mathematics)","score_opus":0.030889400351063103,"score_gpt":0.2879081219291493,"score_spread":0.2570187215780862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967555058","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.015676353,0.0011363614,0.98196304,0.00005825677,0.00010187784,0.000017354441,0.000041215084,0.0005134892,0.00049201783],"genre_scores_gemma":[0.43124327,0.001650077,0.5586941,0.00011150371,0.00020868621,0.00005480833,0.0004795571,0.00020084204,0.0073572034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962103,0.00007080468,0.000021847756,0.00013200635,0.00011218971,0.000042230164],"domain_scores_gemma":[0.9994497,0.00025183635,0.0000459303,0.00006947409,0.00015602629,0.000026987771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010044393,0.0005278664,0.0012068052,0.0006624401,0.00033135127,0.0007524238,0.0008328628,0.0009286038,0.001020987],"category_scores_gemma":[0.0016155266,0.0004094853,0.00056113285,0.0010568606,0.00029478903,0.00091403566,0.000608545,0.0007885585,0.0008155742],"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.000231953,0.00007421926,0.0015988906,0.0001334621,0.000073104275,0.000073454255,0.00005622843,0.087974116,0.026296213,0.004052406,0.0031977904,0.87623817],"study_design_scores_gemma":[0.0000031456489,0.00003138381,0.0005080661,0.0000059930135,0.000012743864,0.00004065618,0.0000060765547,0.9935375,0.0036292297,0.0013857663,0.00083514163,0.0000042314277],"about_ca_topic_score_codex":0.0018505228,"about_ca_topic_score_gemma":0.0018761685,"teacher_disagreement_score":0.0018505228,"about_ca_system_score_codex":0.00037568403,"about_ca_system_score_gemma":0.0004093639,"threshold_uncertainty_score":0.005312085},"labels":[],"label_agreement":null},{"id":"W2967576448","doi":"10.1007/978-3-030-27202-9_11","title":"Locally Linear Image Structural Embedding for Image Structure Manifold Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Embedding; Nonlinear dimensionality reduction; Manifold (fluid mechanics); Image (mathematics); Kernel (algebra); Computer science; Artificial intelligence; Norm (philosophy); Manifold alignment; Mathematics; Pattern recognition (psychology); Discrete mathematics; Dimensionality reduction","score_opus":0.010747471121568427,"score_gpt":0.2846919609537916,"score_spread":0.2739444898322232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967576448","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.005234887,0.00051193783,0.991734,0.00017390803,0.000042940213,0.000019438281,0.00011853504,0.0007522968,0.0014119698],"genre_scores_gemma":[0.27246088,0.0017905344,0.7037533,0.00021659951,0.0002300221,0.00019509754,0.0016851799,0.00070841453,0.018960083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998056,0.000046296253,0.0000076834385,0.00006188969,0.00006397552,0.00001455225],"domain_scores_gemma":[0.9996543,0.00009566707,0.000036089863,0.0001225843,0.00007049467,0.000020768432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027334614,0.0005895273,0.0006316325,0.0005898395,0.00022305964,0.0006079047,0.0009675942,0.00070873805,0.0047476864],"category_scores_gemma":[0.0012449228,0.00032016062,0.00042534742,0.00087270007,0.0005317486,0.0015868563,0.0012296207,0.0016731293,0.0022607194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087027474,0.0000895815,0.0003104249,0.00024597344,0.000048152982,0.000061522216,0.000113698836,0.073536806,0.030455535,0.10448918,0.018222326,0.7723397],"study_design_scores_gemma":[0.0000057732527,0.00007869484,0.0002839881,0.000020155821,0.000014814566,0.00011964552,0.000031120566,0.90793866,0.007428386,0.07592715,0.008135596,0.000015946103],"about_ca_topic_score_codex":0.001229913,"about_ca_topic_score_gemma":0.00202775,"teacher_disagreement_score":0.0047476864,"about_ca_system_score_codex":0.0004224795,"about_ca_system_score_gemma":0.00034792232,"threshold_uncertainty_score":0.015882611},"labels":[],"label_agreement":null},{"id":"W2967588839","doi":"10.1007/978-3-030-27202-9_41","title":"Strategies for Improving Single-Head Continual Learning Performance","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Forgetting; Artificial intelligence; Machine learning; Classifier (UML); Obstacle; Binary classification; Incremental learning; Head (geology); Binary number; Support vector machine","score_opus":0.02496720690867954,"score_gpt":0.24944168186995247,"score_spread":0.22447447496127293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967588839","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.16969618,0.0012735348,0.8035204,0.0003950176,0.00025713502,0.00028419076,0.0001442467,0.0068886746,0.01754059],"genre_scores_gemma":[0.82059765,0.00032723867,0.1688104,0.0001600356,0.0000973863,0.00018885436,0.00019874555,0.00037740427,0.009242192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995622,0.00008670575,0.000024390376,0.00016585692,0.0000933336,0.000067522575],"domain_scores_gemma":[0.99876815,0.0005478941,0.000086341744,0.00019237239,0.00027157922,0.00013369466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009210821,0.00095792307,0.0007140314,0.0006009346,0.00043682382,0.0012140318,0.0015702485,0.00084540615,0.007861737],"category_scores_gemma":[0.0037535587,0.0002696863,0.00027895576,0.00051851425,0.00042847,0.0017888629,0.0018127295,0.0012648773,0.0025643592],"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.0005972681,0.0008090228,0.001149475,0.00014094813,0.000060271817,0.000044160948,0.00015933864,0.02450856,0.048690695,0.00457928,0.0031706998,0.91609025],"study_design_scores_gemma":[0.00017176397,0.0011552982,0.003518298,0.0000584422,0.00018759718,0.00019047475,0.00033556405,0.90419406,0.06261084,0.022101164,0.0053998684,0.00007663525],"about_ca_topic_score_codex":0.0012768717,"about_ca_topic_score_gemma":0.0020649778,"teacher_disagreement_score":0.007861737,"about_ca_system_score_codex":0.00039556724,"about_ca_system_score_gemma":0.000704781,"threshold_uncertainty_score":0.026300132},"labels":[],"label_agreement":null},{"id":"W2967675748","doi":"10.1007/978-3-030-27272-2_41","title":"Automatic Frame Selection Using MLP Neural Network in Ultrasound Elastography","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Concordia University","funders":"","keywords":"Multilayer perceptron; Elastography; Artificial neural network; Pattern recognition (psychology); Principal component analysis; Imaging phantom; Perceptron; Elasticity (physics); Frame (networking)","score_opus":0.01166579773998307,"score_gpt":0.2486750663562421,"score_spread":0.237009268616259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967675748","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.014511329,0.0025778378,0.9795252,0.000106980144,0.00013062618,0.000026995856,0.00012343908,0.0009242066,0.00207333],"genre_scores_gemma":[0.29383552,0.003982796,0.68359756,0.00014715617,0.00029257825,0.000078836005,0.00048411993,0.00032322714,0.017258154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982613,0.00003585778,0.0000103105385,0.000054544616,0.000049105583,0.000024014089],"domain_scores_gemma":[0.99979156,0.000106611,0.000011716439,0.000018415396,0.00006383951,0.000007890162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045646276,0.0005669265,0.0006652108,0.0006132878,0.00024858204,0.0006334139,0.00054912106,0.00094574253,0.003217492],"category_scores_gemma":[0.0006796842,0.00035519846,0.00047127475,0.00066554087,0.00017666393,0.00049971126,0.00038811826,0.00060289056,0.0011432383],"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.00021133338,0.000040774186,0.00040562212,0.00013857493,0.00003837686,0.000117512056,0.00002781359,0.042215277,0.052448213,0.0012887775,0.003100977,0.8999667],"study_design_scores_gemma":[0.0000064172027,0.000046468114,0.0012431126,0.000036046218,0.000048406084,0.000127907,0.00001206673,0.96509147,0.02811786,0.0011863413,0.0040677977,0.000016136353],"about_ca_topic_score_codex":0.0029137821,"about_ca_topic_score_gemma":0.003587497,"teacher_disagreement_score":0.003217492,"about_ca_system_score_codex":0.00027451303,"about_ca_system_score_gemma":0.00025370246,"threshold_uncertainty_score":0.010763586},"labels":[],"label_agreement":null},{"id":"W2967677467","doi":"10.1007/978-3-030-27272-2_38","title":"Compensated Row-Column Ultrasound Imaging Systems with Data-Driven Point Spread Function Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Advanced Micro Devices (Canada); Vector Institute; University of Waterloo","funders":"","keywords":"Computer science; Column (typography); Ultrasound; Speckle pattern; Ranging; Ultrasound imaging; Point spread function; Speckle noise; Medical imaging; Point (geometry); Transducer; Artificial intelligence; Computer vision; 3D ultrasound; Acoustics; Physics; Mathematics; Telecommunications","score_opus":0.013112135404213068,"score_gpt":0.2330806839422153,"score_spread":0.2199685485380022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967677467","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.005149765,0.0003069267,0.9916049,0.00011863496,0.000060209637,0.00003862471,0.00010266442,0.0010519224,0.0015662011],"genre_scores_gemma":[0.13040513,0.00040087465,0.86041737,0.00029914817,0.000084825144,0.00010402196,0.0005069797,0.00021271617,0.007568882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994924,0.000110252,0.00002810757,0.00009907291,0.00023783087,0.000032257434],"domain_scores_gemma":[0.9990895,0.00034138886,0.00006394195,0.00016951052,0.00030406425,0.000031558317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058385165,0.00080266234,0.00076391915,0.00034597414,0.00028662445,0.0011292003,0.0010007127,0.0012139804,0.005823222],"category_scores_gemma":[0.0018773495,0.00055765227,0.0005455428,0.00061267166,0.00031860554,0.0013428376,0.0010831043,0.0011805794,0.003383206],"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.0006582352,0.00017687409,0.0008240693,0.00030289314,0.00017666977,0.00011558872,0.00010623914,0.100742765,0.121456355,0.0062423865,0.0077981926,0.76139975],"study_design_scores_gemma":[0.000024199266,0.00017812265,0.0006632629,0.00003313896,0.000044594704,0.00027946456,0.000019838306,0.94170433,0.04811795,0.0028332986,0.0060524917,0.000049263082],"about_ca_topic_score_codex":0.0011169661,"about_ca_topic_score_gemma":0.002285647,"teacher_disagreement_score":0.005823222,"about_ca_system_score_codex":0.00037171147,"about_ca_system_score_gemma":0.0007805445,"threshold_uncertainty_score":0.019480646},"labels":[],"label_agreement":null},{"id":"W2967700132","doi":"10.1007/978-3-030-27272-2_7","title":"Information Fusion via Multimodal Hashing with Discriminant Canonical Correlation Maximization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Linear discriminant analysis; Discriminant; Artificial intelligence; Canonical correlation; Maximization; Hash function; Pattern recognition (psychology); Fusion; Correlation; Sensor fusion; Mathematics; Mathematical optimization","score_opus":0.013354136991249814,"score_gpt":0.24565540100757835,"score_spread":0.23230126401632853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967700132","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.0054240637,0.00031678058,0.99250424,0.000088406734,0.000054196997,0.000034321358,0.00006815638,0.00043004184,0.0010798807],"genre_scores_gemma":[0.26880142,0.00057680847,0.7240947,0.0002118484,0.00018661532,0.00016289859,0.0006344657,0.0001947218,0.0051365583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987286,0.00038873576,0.00007064789,0.00025640722,0.00043421608,0.000121493955],"domain_scores_gemma":[0.9989064,0.00033468788,0.00007664965,0.0003726058,0.00025391488,0.000055764984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018976775,0.0008395339,0.0017441887,0.0011138816,0.0006078103,0.001226417,0.0012938307,0.0010709822,0.0031884355],"category_scores_gemma":[0.0041380296,0.0005072046,0.0011025891,0.0021269429,0.0008609376,0.0027852764,0.004119985,0.0010700863,0.0018890216],"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.0004264079,0.00011523806,0.0006813699,0.00016819761,0.00014041581,0.000097528085,0.0001494446,0.092757195,0.026012639,0.044373497,0.008242745,0.82683533],"study_design_scores_gemma":[0.000018385168,0.0001378271,0.00042947268,0.000019413756,0.00004424135,0.00017946771,0.000050828574,0.9503531,0.015520271,0.029756302,0.00343721,0.000053478514],"about_ca_topic_score_codex":0.0009643969,"about_ca_topic_score_gemma":0.0011299131,"teacher_disagreement_score":0.0031884355,"about_ca_system_score_codex":0.00049394503,"about_ca_system_score_gemma":0.0007887738,"threshold_uncertainty_score":0.01066637},"labels":[],"label_agreement":null},{"id":"W2967736654","doi":"10.1007/978-3-030-27615-7_29","title":"Ontario: Federated Query Processing Against a Semantic Data Lake","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":45,"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":"Computer science; Exploit; Schema (genetic algorithms); Semantic heterogeneity; Query optimization; SPARQL; Information retrieval; RDF; Query language; Data integration; Database; Overhead (engineering); Data mining; Semantic Web; Ontology-based data integration","score_opus":0.13596844554397938,"score_gpt":0.3560912968233141,"score_spread":0.2201228512793347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967736654","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.119171746,0.001083664,0.38647512,0.0044292007,0.00052278006,0.0013366498,0.055422954,0.25199717,0.17956063],"genre_scores_gemma":[0.44163254,0.00084851106,0.29893076,0.0006922929,0.00007678437,0.00035495017,0.0669715,0.013833709,0.17665896],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986761,0.000103040285,0.0000861254,0.0001882216,0.000753911,0.00019262066],"domain_scores_gemma":[0.9985843,0.00027289448,0.000045649496,0.00042867113,0.0005606212,0.00010798906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420146,0.0007897313,0.0007383519,0.0018874328,0.0024781192,0.0035324574,0.0021216108,0.0009095624,0.019869715],"category_scores_gemma":[0.004155131,0.000920168,0.0007397435,0.003251235,0.0010378051,0.0039750044,0.0028750505,0.00081290904,0.004512133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002752581,0.00033029818,0.0077717192,0.0005886333,0.00020001766,0.0009157511,0.0019729375,0.022682782,0.0351755,0.05243207,0.55567837,0.31949934],"study_design_scores_gemma":[0.00058238395,0.00021756756,0.008099717,0.00016119097,0.00020461096,0.00036553555,0.0020660965,0.45036134,0.054867502,0.032310158,0.4504925,0.00027130535],"about_ca_topic_score_codex":0.7281256,"about_ca_topic_score_gemma":0.7856242,"teacher_disagreement_score":0.27187443,"about_ca_system_score_codex":0.0076543777,"about_ca_system_score_gemma":0.013452097,"threshold_uncertainty_score":0.54695106},"labels":[],"label_agreement":null},{"id":"W2967816088","doi":"10.1007/978-3-030-27202-9_29","title":"Emotion Recognition with Spatial Attention and Temporal Softmax Pooling","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"École de Technologie Supérieure","funders":"","keywords":"Softmax function; Convolutional neural network; Pooling; Pattern recognition (psychology); Residual; Face (sociological concept); Facial recognition system; Invariant (physics); Task (project management)","score_opus":0.027728448621931908,"score_gpt":0.26747648395690854,"score_spread":0.23974803533497663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967816088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016799424,0.0016533684,0.97191805,0.00025126294,0.00026856147,0.00005479372,0.00031635343,0.0026257366,0.0061125327],"genre_scores_gemma":[0.37359864,0.0020464058,0.5900699,0.00050150335,0.0004564533,0.00020813316,0.0017498519,0.0005335457,0.030835586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996991,0.000041303072,0.000015852509,0.00010178677,0.00007537593,0.00006665295],"domain_scores_gemma":[0.9998122,0.000058883466,0.000013974729,0.00004395325,0.000057163106,0.000013799122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075666246,0.0010322178,0.0008224612,0.00051765447,0.0002596581,0.0011770109,0.0011806947,0.0006920076,0.007815556],"category_scores_gemma":[0.0008517969,0.0004317134,0.0011673915,0.0009976095,0.00029800477,0.0013815252,0.0011185053,0.0009495816,0.0031274564],"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.00040376594,0.00013333237,0.00045977146,0.00015011062,0.00018143286,0.000059427934,0.000049213388,0.01480934,0.1249512,0.0058586886,0.010469495,0.84247416],"study_design_scores_gemma":[0.000028080232,0.00016455138,0.0030770535,0.000028403512,0.0001717274,0.00016802168,0.00004459857,0.8833779,0.09187253,0.013105757,0.007918827,0.00004253467],"about_ca_topic_score_codex":0.0027542543,"about_ca_topic_score_gemma":0.0048779887,"teacher_disagreement_score":0.007815556,"about_ca_system_score_codex":0.00052612065,"about_ca_system_score_gemma":0.00045381903,"threshold_uncertainty_score":0.026145697},"labels":[],"label_agreement":null},{"id":"W2967873511","doi":"10.1007/978-3-030-27520-4_5","title":"Mining Sequential Patterns of Historical Purchases for E-commerce Recommendation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; Collaborative filtering; Recommender system; Similarity (geometry); Data mining; Sequential Pattern Mining; Cluster analysis; Matrix (chemical analysis); Information retrieval; Artificial intelligence; Machine learning","score_opus":0.041237137699025414,"score_gpt":0.2829753968672345,"score_spread":0.24173825916820907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967873511","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.84639335,0.009014652,0.102632016,0.0010248612,0.0005180687,0.00031428013,0.028645745,0.0019759089,0.009481021],"genre_scores_gemma":[0.8910788,0.0022937146,0.068453446,0.00016169854,0.00037882346,0.00015075484,0.028417168,0.00008509294,0.008980504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995498,0.0000453128,0.00006501359,0.0001359189,0.00014362924,0.000060275124],"domain_scores_gemma":[0.99906,0.0004246935,0.00014041597,0.0001042032,0.00019024787,0.00008050049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035450648,0.0007721536,0.0008046673,0.0059014945,0.00045815847,0.0008652564,0.0008612354,0.0007741658,0.004087299],"category_scores_gemma":[0.0018858506,0.0003419358,0.0010135054,0.0067127086,0.00015753838,0.001277245,0.00036141378,0.0006210574,0.0027423147],"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.0011196272,0.001508692,0.28974542,0.0006908485,0.000910844,0.0014328056,0.00019446373,0.012684948,0.012477486,0.0022582174,0.031896587,0.64508003],"study_design_scores_gemma":[0.00013196806,0.00079367415,0.24105954,0.00028995992,0.0009634441,0.0035042402,0.0007523004,0.70654064,0.011908054,0.011528064,0.022418763,0.0001093702],"about_ca_topic_score_codex":0.006637993,"about_ca_topic_score_gemma":0.019657444,"teacher_disagreement_score":0.006637993,"about_ca_system_score_codex":0.00033023648,"about_ca_system_score_gemma":0.0005338518,"threshold_uncertainty_score":0.013673365},"labels":[],"label_agreement":null},{"id":"W2968024974","doi":"10.1007/978-3-030-27272-2_22","title":"Female Facial Beauty Analysis Using Transfer Learning and Stacking Ensemble Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Robustness (evolution); Facial attractiveness; Benchmark (surveying); Transfer of learning; Stacking; Pattern recognition (psychology); Discriminative model; Facial recognition system; Machine learning; Deep learning; Face (sociological concept); Attractiveness","score_opus":0.029584607021834974,"score_gpt":0.2641351281138223,"score_spread":0.23455052109198732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968024974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21350318,0.0006869723,0.77413636,0.0001852277,0.00022007288,0.00009944761,0.0007496616,0.0016858598,0.008733248],"genre_scores_gemma":[0.82934284,0.00079591427,0.15189554,0.000103828614,0.00016537124,0.000082513776,0.0019159997,0.00027438832,0.015423622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.000031730906,0.000008652348,0.00008687335,0.00009753638,0.000044357366],"domain_scores_gemma":[0.9998148,0.000028194021,0.000011675352,0.000044877666,0.00008818588,0.0000123132495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046145977,0.0006303149,0.00067333685,0.0011227962,0.00030678604,0.00046070956,0.00044647558,0.0003556776,0.0033176187],"category_scores_gemma":[0.00046005807,0.0002043083,0.0012145888,0.00083213934,0.0002018342,0.00065948925,0.00057401886,0.00063844107,0.0015558869],"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.0002728732,0.0001498841,0.008830105,0.00007222337,0.0001731171,0.00013839084,0.00008107694,0.040060855,0.06588006,0.0012496329,0.006541211,0.8765506],"study_design_scores_gemma":[0.0000066194534,0.00012334547,0.022243302,0.000012732516,0.00013007842,0.00039026968,0.000084278276,0.94962347,0.023212893,0.0015725349,0.0025618565,0.000038666665],"about_ca_topic_score_codex":0.0020022143,"about_ca_topic_score_gemma":0.002941712,"teacher_disagreement_score":0.0033176187,"about_ca_system_score_codex":0.0001993353,"about_ca_system_score_gemma":0.00025029175,"threshold_uncertainty_score":0.011098564},"labels":[],"label_agreement":null},{"id":"W2968038569","doi":"10.1007/978-3-030-27272-2_42","title":"Auto SVD Clutter Filtering for US Doppler Imaging Using 3D Clustering Algorithm","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Research Institute for Aging; University of Waterloo","funders":"","keywords":"Clutter; Computer science; Artificial intelligence; Constant false alarm rate; Filter (signal processing); Singular value decomposition; Computer vision; Noise (video); Pattern recognition (psychology); Cluster analysis; Receiver operating characteristic; Algorithm; Radar; Image (mathematics)","score_opus":0.016303343104755653,"score_gpt":0.26419091637735864,"score_spread":0.247887573272603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968038569","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.0025714163,0.00025463008,0.99541193,0.000043544915,0.000060036247,0.000016987815,0.000073162104,0.0007022912,0.0008660193],"genre_scores_gemma":[0.051817134,0.00069969107,0.9408405,0.00010510877,0.00007216033,0.00006414591,0.0007429185,0.00036248073,0.0052959183],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994947,0.00007529134,0.00003292122,0.00010631753,0.00023884448,0.000051955947],"domain_scores_gemma":[0.9993166,0.0001666111,0.000040301784,0.000109234665,0.00033970678,0.000027529046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046474766,0.00084570824,0.00091864076,0.0013372087,0.00059123035,0.0012483009,0.000909861,0.0010107037,0.0054215775],"category_scores_gemma":[0.0013405265,0.0005400311,0.0013978201,0.0017558367,0.00033862624,0.00092331605,0.000976865,0.0008521813,0.0041097477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026362558,0.00009529719,0.0007481635,0.00019530416,0.0001024962,0.000104796825,0.000111518835,0.06622684,0.060590968,0.007993459,0.009003801,0.8545638],"study_design_scores_gemma":[0.000010229219,0.000065110005,0.0009786142,0.000024529354,0.000042451044,0.00023839064,0.00004044531,0.9555697,0.029504288,0.0044202344,0.009061052,0.00004490134],"about_ca_topic_score_codex":0.00469988,"about_ca_topic_score_gemma":0.004901185,"teacher_disagreement_score":0.0054215775,"about_ca_system_score_codex":0.00045404446,"about_ca_system_score_gemma":0.0011174062,"threshold_uncertainty_score":0.018136978},"labels":[],"label_agreement":null},{"id":"W2968147978","doi":"10.1007/978-3-030-27202-9_12","title":"Fitting Smooth Manifolds to Point Clouds in a Level Set Formulation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"Computer science; Curse of dimensionality; Point cloud; Robustness (evolution); Surface fitting; Algorithm; Curve fitting; Bottleneck; Representation (politics); Data point; Operator (biology); Surface (topology); Artificial intelligence; Mathematics; Geometry; Machine learning","score_opus":0.020844819171664128,"score_gpt":0.2595264365598582,"score_spread":0.23868161738819405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968147978","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.0047199707,0.00010092468,0.993476,0.000111453046,0.000028495606,0.000039370916,0.00007749115,0.0001975638,0.001248731],"genre_scores_gemma":[0.18459989,0.0006234227,0.80538917,0.00016083212,0.00011858373,0.00022657856,0.00052309514,0.0009422073,0.007416221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992569,0.00022250433,0.000043125874,0.00013414332,0.00029186814,0.000051462157],"domain_scores_gemma":[0.99904376,0.0005371561,0.00009697931,0.00013371152,0.00011442768,0.00007394287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012449987,0.0010287052,0.0017735182,0.001429874,0.00069168094,0.0029572798,0.0028136403,0.0029853657,0.00363355],"category_scores_gemma":[0.004491445,0.0019087965,0.0019434893,0.0019265759,0.0016096636,0.0025831072,0.0038789655,0.0037823264,0.0012939213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003591748,0.00003748987,0.00023037761,0.00011163189,0.000047639416,0.000067147244,0.00009617518,0.8724609,0.0019539297,0.091841355,0.001718244,0.0313991],"study_design_scores_gemma":[0.0000025627598,0.0000069415732,0.000023884759,0.000007260173,0.0000029218609,0.000013720887,0.00000978902,0.973815,0.00020085125,0.025296273,0.00061640446,0.0000044679987],"about_ca_topic_score_codex":0.004642683,"about_ca_topic_score_gemma":0.0045794644,"teacher_disagreement_score":0.004642683,"about_ca_system_score_codex":0.0013893805,"about_ca_system_score_gemma":0.0008699649,"threshold_uncertainty_score":0.012155473},"labels":[],"label_agreement":null},{"id":"W2968215148","doi":"10.1007/978-3-030-29729-9_2","title":"Using Honeypots in a Decentralized Framework to Defend Against Adversarial Machine-Learning Attacks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Toronto Metropolitan University","funders":"","keywords":"Adversarial system; Honeypot; Adversary; Computer science; Adversarial machine learning; Computer security; Threat model; Artificial intelligence; Machine learning","score_opus":0.02523049076188772,"score_gpt":0.2877179076421205,"score_spread":0.2624874168802328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968215148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06373237,0.00084742694,0.9197423,0.0007713468,0.00037361376,0.00013674286,0.00005176012,0.0022013667,0.012143122],"genre_scores_gemma":[0.9307145,0.0002638947,0.062857814,0.00018708777,0.00015388556,0.00011829257,0.000056625697,0.00012229224,0.00552565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.00033283245,0.0000475825,0.0002314813,0.00034438897,0.00016225908],"domain_scores_gemma":[0.9977323,0.00087837153,0.00024623956,0.000826783,0.00017854954,0.00013777043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013017277,0.0006589229,0.0009230377,0.0005169649,0.0007072675,0.001625771,0.0014522432,0.001788324,0.0023269167],"category_scores_gemma":[0.003266496,0.0004999828,0.0005499893,0.0003451306,0.0013617689,0.0030942012,0.0031878734,0.002521351,0.00067397015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008440738,0.00038615614,0.0016041003,0.00031771275,0.00033730431,0.0007145691,0.00037645327,0.4329333,0.08736541,0.26715255,0.012819241,0.19514905],"study_design_scores_gemma":[0.00006303734,0.0002159592,0.00039106765,0.000021046348,0.000035705027,0.00023730719,0.000044083896,0.8870628,0.008207463,0.09727394,0.006420507,0.000027115488],"about_ca_topic_score_codex":0.00015120419,"about_ca_topic_score_gemma":0.00022984855,"teacher_disagreement_score":0.0023269167,"about_ca_system_score_codex":0.0003949591,"about_ca_system_score_gemma":0.00041715868,"threshold_uncertainty_score":0.0077842474},"labels":[],"label_agreement":null},{"id":"W2968336449","doi":"10.1007/978-3-030-27520-4_1","title":"Detecting the Onset of Machine Failure Using Anomaly Detection Methods","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Anomaly detection; Closing (real estate); Robot; Artificial intelligence; Torque; Robotic arm; Point (geometry); Key (lock); Fault detection and isolation; Machine learning; Computer security; Actuator","score_opus":0.022837100018044003,"score_gpt":0.3005863306353197,"score_spread":0.2777492306172757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968336449","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.21466887,0.001390559,0.7731963,0.00044057367,0.0004868251,0.00012532534,0.00075548893,0.0059318095,0.0030043023],"genre_scores_gemma":[0.83702797,0.0005140759,0.15796012,0.00010851071,0.00021354856,0.00007193726,0.0010097475,0.00019920144,0.0028948353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846184,0.00015361876,0.00011699791,0.00037383244,0.0007554029,0.00013827252],"domain_scores_gemma":[0.9944641,0.0027600508,0.00091264234,0.0006063944,0.0010360151,0.00022085545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872483,0.0010954186,0.001247792,0.0028092633,0.00034332063,0.0012032711,0.0015638259,0.001188883,0.0012223242],"category_scores_gemma":[0.0057295947,0.0003175121,0.00060738,0.0015244227,0.00045226672,0.0013897602,0.00074259494,0.0015644804,0.0008169782],"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.0009033993,0.0006008666,0.081908904,0.00039787934,0.00030752725,0.0011957607,0.00021088251,0.07300875,0.09177107,0.004943113,0.008242023,0.73650986],"study_design_scores_gemma":[0.000027743543,0.00044814232,0.019760903,0.000039558872,0.00009305919,0.0012167364,0.000081457074,0.9240497,0.04007488,0.010456234,0.0036929124,0.00005857193],"about_ca_topic_score_codex":0.0009097154,"about_ca_topic_score_gemma":0.0010316462,"teacher_disagreement_score":0.0028092633,"about_ca_system_score_codex":0.00037386405,"about_ca_system_score_gemma":0.0004396214,"threshold_uncertainty_score":0.0062788725},"labels":[],"label_agreement":null},{"id":"W2968339806","doi":"10.1007/978-3-030-27202-9_4","title":"Motion-Augmented Inference and Joint Kernels in Structured Learning for Object Tracking","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Concordia University","funders":"","keywords":"Particle filter; Computer science; Artificial intelligence; Inference; Kernel (algebra); Feature vector; Entropy (arrow of time); Video tracking; Regularization (linguistics); Pattern recognition (psychology); Computer vision; Object (grammar); Exploit; Mathematics; Kalman filter","score_opus":0.0369903024693669,"score_gpt":0.29557008550599895,"score_spread":0.25857978303663204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968339806","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.0020278955,0.0001964025,0.99732167,0.000043123542,0.00001616618,0.0000058689557,0.000020464282,0.0002094144,0.00015903612],"genre_scores_gemma":[0.20576982,0.00082308444,0.78550184,0.00014831728,0.00014046484,0.00009760989,0.00050475675,0.0004127001,0.0066014137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912137,0.0003281564,0.00005612553,0.0002579756,0.00015966763,0.00007663772],"domain_scores_gemma":[0.9966186,0.002230265,0.00016657048,0.0005943548,0.00031213296,0.00007805929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020158582,0.0007825952,0.0017515928,0.0006264998,0.00043588356,0.0011206617,0.0023776612,0.0017685798,0.002332558],"category_scores_gemma":[0.007974049,0.0010840188,0.0011079294,0.0012642286,0.0013333077,0.0032775218,0.0022688296,0.0030796723,0.0009571398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002879989,0.0001324335,0.0005972842,0.0001884751,0.0001288879,0.00006177895,0.00015081573,0.5217753,0.006170329,0.08888033,0.004295327,0.37733105],"study_design_scores_gemma":[0.000004636382,0.000012298385,0.0000708316,0.000004148546,0.0000061618753,0.000008850248,0.0000036845993,0.97458696,0.0005882512,0.02434184,0.0003659599,0.0000062559207],"about_ca_topic_score_codex":0.0072827074,"about_ca_topic_score_gemma":0.0078771645,"teacher_disagreement_score":0.0072827074,"about_ca_system_score_codex":0.0009394053,"about_ca_system_score_gemma":0.0010091556,"threshold_uncertainty_score":0.01448065},"labels":[],"label_agreement":null},{"id":"W2968342134","doi":"10.1007/978-3-030-27202-9_26","title":"A Scene-Based Augmented Reality Framework for Exhibits","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Toronto Metropolitan University","funders":"","keywords":"Augmented reality; Computer science; Orb (optics); Computer vision; Artificial intelligence; Image (mathematics); Computer graphics (images); Human–computer interaction","score_opus":0.03284737126144964,"score_gpt":0.293948011554356,"score_spread":0.26110064029290636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968342134","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.0020128335,0.00028610957,0.9849652,0.00006004387,0.000041604348,0.00006911112,0.00060066755,0.0043341476,0.007630185],"genre_scores_gemma":[0.066282354,0.0010554602,0.9171315,0.0000506346,0.00004044634,0.00012994328,0.0017293466,0.00088672334,0.012693606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962175,0.000070662,0.000018290984,0.0000853031,0.00014890937,0.00005511271],"domain_scores_gemma":[0.99983454,0.000033693424,0.000010628944,0.000058199308,0.00004002964,0.000022887383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029956666,0.0012812549,0.00084531354,0.0012718297,0.0008325501,0.0038841036,0.0021743514,0.0010773682,0.0185609],"category_scores_gemma":[0.00050755555,0.0008682834,0.0021496161,0.001536877,0.0007203765,0.0015262957,0.003272068,0.0014086403,0.0049642986],"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.000333896,0.00016543479,0.0008034892,0.00084435486,0.00020126991,0.0008538481,0.0015886732,0.13041382,0.037797965,0.25630224,0.034034207,0.53666073],"study_design_scores_gemma":[0.000052665266,0.00013781882,0.0011001824,0.00025331115,0.00015727818,0.0013336135,0.0008102672,0.6250877,0.02247705,0.06111627,0.2873125,0.00016135593],"about_ca_topic_score_codex":0.006021504,"about_ca_topic_score_gemma":0.013125168,"teacher_disagreement_score":0.0185609,"about_ca_system_score_codex":0.00049653027,"about_ca_system_score_gemma":0.00077656854,"threshold_uncertainty_score":0.062092364},"labels":[],"label_agreement":null},{"id":"W2968387920","doi":"10.1007/978-3-030-29729-9_3","title":"Graphene: A Secure Cloud Communication Architecture","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cloud computing; Architecture; Computer security; Computer architecture; Operating system; History; Archaeology","score_opus":0.015018850412627667,"score_gpt":0.2453479278852624,"score_spread":0.23032907747263476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968387920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07312624,0.01050282,0.52787536,0.004735191,0.0033181848,0.00021491012,0.00057601085,0.011738846,0.36791244],"genre_scores_gemma":[0.5655528,0.007724809,0.21966329,0.0008621922,0.00036573043,0.00014133337,0.00036333376,0.0009875513,0.20433894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988437,0.000009696825,0.000002583588,0.00001490658,0.00006653014,0.000021868187],"domain_scores_gemma":[0.99993455,0.000011731712,0.000004933734,0.000022514652,0.000016426218,0.000009837931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009336273,0.0006260927,0.00023445101,0.0005073052,0.00071674515,0.0011218549,0.000791604,0.0007869629,0.006532927],"category_scores_gemma":[0.00018973624,0.00023026115,0.00022657323,0.00064855494,0.00056333997,0.0012224988,0.0007590526,0.001055478,0.0023247434],"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.00023990059,0.00008542567,0.00019544119,0.00038901126,0.000048500595,0.0003813765,0.00021561135,0.023657512,0.13082378,0.47808,0.06706254,0.29882085],"study_design_scores_gemma":[0.000050212926,0.000247018,0.0005443344,0.00012789809,0.00007798491,0.0009378867,0.0001304459,0.108954154,0.12090326,0.22280999,0.5451041,0.0001127965],"about_ca_topic_score_codex":0.0007258536,"about_ca_topic_score_gemma":0.0012553313,"teacher_disagreement_score":0.006532927,"about_ca_system_score_codex":0.0005452511,"about_ca_system_score_gemma":0.00052436214,"threshold_uncertainty_score":0.021854877},"labels":[],"label_agreement":null},{"id":"W2968433965","doi":"10.1007/978-3-030-27202-9_16","title":"WaveM-CNN for Automatic Recognition of Sub-cellular Organelles","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Computer science; Pattern recognition (psychology); Convolutional neural network; Artificial intelligence; Convolution (computer science); Discriminative model; Classifier (UML); Wavelet; Feature vector; Deep learning; Feature extraction; Benchmark (surveying); Transfer of learning; Artificial neural network","score_opus":0.010781907782502473,"score_gpt":0.23826268790173755,"score_spread":0.22748078011923506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968433965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051805835,0.003122152,0.904681,0.0005185075,0.0006754024,0.0001946704,0.0047371835,0.013529909,0.02073533],"genre_scores_gemma":[0.21524826,0.002539568,0.67908216,0.0007061366,0.00016319237,0.0003015103,0.0110144,0.00093799824,0.09000687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987686,0.000006287824,0.0000051987095,0.000040980733,0.000043535732,0.000027107462],"domain_scores_gemma":[0.9999143,0.00001370918,0.000008786184,0.000022221362,0.00003322173,0.000007651702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000223089,0.00095749047,0.0004333705,0.00059078727,0.00018175728,0.00070591294,0.0012409432,0.0008849566,0.009215969],"category_scores_gemma":[0.00030365612,0.00041389847,0.00071612286,0.00062863895,0.00018899053,0.0008612543,0.000881146,0.00064175914,0.0057799174],"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.00011632125,0.00007453788,0.0007326134,0.0002744077,0.00008832939,0.00011200831,0.00002890019,0.017276006,0.12532818,0.004378665,0.028134368,0.8234557],"study_design_scores_gemma":[0.0000128823,0.0001430297,0.0036194003,0.00006563513,0.00008247287,0.0003052543,0.000034214463,0.80285907,0.15030664,0.0055679097,0.03696844,0.00003504769],"about_ca_topic_score_codex":0.0029802278,"about_ca_topic_score_gemma":0.0067271497,"teacher_disagreement_score":0.009215969,"about_ca_system_score_codex":0.00048899034,"about_ca_system_score_gemma":0.0004991878,"threshold_uncertainty_score":0.030830503},"labels":[],"label_agreement":null},{"id":"W2968451982","doi":"10.1007/978-3-030-27202-9_10","title":"CNN-Based Real-Time Parameter Tuning for Optimizing Denoising Filter Performance","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Noise reduction; Filter (signal processing); Convolutional neural network; Noise (video); Artificial neural network; Pattern recognition (psychology); Value (mathematics); Video denoising","score_opus":0.028294712116588024,"score_gpt":0.26864132596722523,"score_spread":0.24034661385063721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968451982","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.03691701,0.00095077197,0.9529553,0.00012648996,0.0001622677,0.00006356118,0.00016072876,0.0029521624,0.0057117254],"genre_scores_gemma":[0.60796887,0.00053439825,0.38286707,0.00021817365,0.000072050396,0.00013182353,0.00050370547,0.0006331785,0.0070706937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.000022559278,0.000013431635,0.00007428615,0.00006818988,0.000035438035],"domain_scores_gemma":[0.99962723,0.00012278747,0.000043434058,0.000045125696,0.00014653655,0.000014939972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007143119,0.0011363503,0.00058519456,0.0004446954,0.00019610205,0.0006837708,0.0010116391,0.0010139892,0.002636058],"category_scores_gemma":[0.0019999011,0.00034342616,0.00041928343,0.00041027906,0.0002649207,0.0006857501,0.0004971789,0.00078292866,0.0008562824],"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.0002965339,0.00014600731,0.0011661665,0.00019651424,0.00014120845,0.00009595038,0.000057784724,0.36827344,0.117715225,0.0026302997,0.0056549706,0.5036259],"study_design_scores_gemma":[0.000006909803,0.00002692844,0.00031783682,0.000010864054,0.000023648061,0.000030766885,0.0000038020573,0.9803038,0.018006697,0.0004321738,0.00082768593,0.000008890886],"about_ca_topic_score_codex":0.0063928803,"about_ca_topic_score_gemma":0.011174105,"teacher_disagreement_score":0.0063928803,"about_ca_system_score_codex":0.00077216583,"about_ca_system_score_gemma":0.0006850636,"threshold_uncertainty_score":0.012711287},"labels":[],"label_agreement":null},{"id":"W2968527400","doi":"10.1007/978-3-030-27202-9_21","title":"Augmenting Reality of Tracked Video Objects Using Homography and Keypoints","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer vision; Homography; Artificial intelligence; Zoom; Augmented reality; Video tracking; Histogram; Virtual reality; Object (grammar); Translation (biology); Virtual image; Computer graphics (images); Image (mathematics)","score_opus":0.026438747282106538,"score_gpt":0.2859256277690237,"score_spread":0.25948688048691715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968527400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03421929,0.00089033204,0.9586937,0.00010892405,0.000166539,0.00006895899,0.0003349788,0.0021848592,0.0033323972],"genre_scores_gemma":[0.4255867,0.0030558442,0.5620966,0.00013321804,0.00016647176,0.0001113037,0.0011474399,0.00046791483,0.007234428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993789,0.000094907744,0.000023853376,0.00016943726,0.0002630763,0.00006983885],"domain_scores_gemma":[0.9994764,0.00018335067,0.00005556205,0.00016229304,0.00009232305,0.000030203608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045603307,0.0012038994,0.0010738765,0.0013769475,0.00033665582,0.0018176525,0.0009436718,0.0011749252,0.004509613],"category_scores_gemma":[0.00218707,0.00094435544,0.0009962522,0.00139502,0.0005807165,0.0025741188,0.0027790968,0.0012274694,0.0020567442],"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.0007534485,0.00018943273,0.001061939,0.00066914875,0.00021602702,0.0007152113,0.0007642181,0.1070636,0.1541007,0.009209742,0.004823245,0.72043335],"study_design_scores_gemma":[0.00011048401,0.00071225053,0.0060733426,0.00018132577,0.00024954893,0.0020584606,0.00054529915,0.84873676,0.09385859,0.0159304,0.03138926,0.00015431522],"about_ca_topic_score_codex":0.0031517118,"about_ca_topic_score_gemma":0.0038420074,"teacher_disagreement_score":0.004509613,"about_ca_system_score_codex":0.00040687787,"about_ca_system_score_gemma":0.00057773263,"threshold_uncertainty_score":0.015086114},"labels":[],"label_agreement":null},{"id":"W2968685279","doi":"10.1007/978-3-030-26948-7_2","title":"Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":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":"Isogeny; Key encapsulation; Cryptanalysis; Computer science; Quantum computer; Supersingular elliptic curve; Computation; Post-quantum cryptography; Quantum; Cryptography; Theoretical computer science; Algorithm; Public-key cryptography; Key exchange; Elliptic curve; Mathematics; Computer security; Quantum mechanics; Physics; Encryption","score_opus":0.023087604089308066,"score_gpt":0.26689988001001513,"score_spread":0.24381227592070706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968685279","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.20025398,0.005898478,0.40830868,0.012333663,0.0012258133,0.00018754971,0.00032943807,0.0014351172,0.3700273],"genre_scores_gemma":[0.937836,0.0017350023,0.023588508,0.00064411684,0.0004005982,0.000081648766,0.00008764446,0.00017623471,0.035450265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988939,0.00029373792,0.00003194889,0.00013705637,0.00042270278,0.00022062504],"domain_scores_gemma":[0.99828196,0.00088241673,0.00008462779,0.0005845401,0.000101523896,0.00006499723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012296279,0.0007263923,0.0010223789,0.0010048825,0.0015549953,0.0026454458,0.0011345424,0.0028308276,0.007972009],"category_scores_gemma":[0.00432721,0.00053602573,0.00085892144,0.0011549675,0.0042202566,0.006996189,0.002884379,0.004368129,0.0019179572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008799487,0.0000350455,0.0000907253,0.000040404804,0.000014999705,0.00006922392,0.00012791218,0.0040219775,0.0014484394,0.9746001,0.004664343,0.014798824],"study_design_scores_gemma":[0.000019617073,0.000026237805,0.00005371561,0.000026839456,0.000006941349,0.00011525735,0.000039866005,0.026450738,0.0015962279,0.9674004,0.004247626,0.000016496106],"about_ca_topic_score_codex":0.00035565943,"about_ca_topic_score_gemma":0.00033915852,"teacher_disagreement_score":0.007972009,"about_ca_system_score_codex":0.0010497896,"about_ca_system_score_gemma":0.0008432451,"threshold_uncertainty_score":0.026669025},"labels":[],"label_agreement":null},{"id":"W2968686622","doi":"10.1007/978-3-030-27202-9_8","title":"Blind Quality Assessment of Multiply Distorted Images Using Deep Neural Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Distortion (music); Convolutional neural network; Image quality; Artificial neural network; Scope (computer science); Deep learning; Pattern recognition (psychology); Image (mathematics); Quality (philosophy); Computer vision","score_opus":0.057784995937093526,"score_gpt":0.352733903003726,"score_spread":0.29494890706663246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968686622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11374611,0.0014187952,0.8783131,0.00025151117,0.00016877534,0.00010071934,0.00023998885,0.00084253936,0.0049184035],"genre_scores_gemma":[0.74878836,0.0011972599,0.2427631,0.00015428374,0.000110113346,0.000036588193,0.0004139027,0.00023437275,0.0063019213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.00011918667,0.000032507036,0.00008723301,0.00030572456,0.000055863424],"domain_scores_gemma":[0.9981926,0.0005415099,0.0001971391,0.00020475738,0.0007887933,0.00007515777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010877148,0.0007732784,0.0006113531,0.0009474769,0.00023937969,0.0011832736,0.00060505094,0.00077124656,0.003185777],"category_scores_gemma":[0.0037879904,0.00025882834,0.00058490236,0.0005188556,0.0005441139,0.0012575543,0.0010084329,0.00070295983,0.0005907839],"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.0031532552,0.0001805868,0.004276811,0.0006934155,0.00029186855,0.00037235336,0.00016200684,0.09351719,0.16649817,0.005635346,0.0036721441,0.7215469],"study_design_scores_gemma":[0.00005752718,0.00037236736,0.0043661655,0.000099093384,0.00016666677,0.00056246226,0.00007069381,0.88353294,0.10283217,0.005489688,0.0023870505,0.00006317758],"about_ca_topic_score_codex":0.0018375638,"about_ca_topic_score_gemma":0.0024247596,"teacher_disagreement_score":0.003185777,"about_ca_system_score_codex":0.0005634028,"about_ca_system_score_gemma":0.00050257734,"threshold_uncertainty_score":0.010657489},"labels":[],"label_agreement":null},{"id":"W2968873170","doi":"10.1007/978-3-030-27202-9_35","title":"Spatially-Coherent Segmentation Using Hierarchical Gaussian Mixture Reduction Based on Cauchy-Schwarz Divergence","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"Université du Québec en Outaouais","funders":"","keywords":"Cauchy distribution; Divergence (linguistics); Computer science; Gaussian; Reduction (mathematics); Algorithm; Artificial intelligence; Applied mathematics; Pattern recognition (psychology); Mathematical optimization; Mathematics; Statistics; Geometry; Physics","score_opus":0.0235108287181525,"score_gpt":0.27677026429704843,"score_spread":0.2532594355788959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968873170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025050587,0.00009522576,0.9966461,0.0000319127,0.000013172391,0.000012548452,0.000021444042,0.0002857126,0.00038882077],"genre_scores_gemma":[0.06644361,0.00022420971,0.93074495,0.000065500564,0.000047194666,0.00006722726,0.0002764378,0.0003848511,0.0017459864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995141,0.00009590163,0.00002727619,0.00011925379,0.00018859327,0.00005478629],"domain_scores_gemma":[0.99930286,0.0003204005,0.00004462531,0.00010412749,0.00017843879,0.000049480535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009187918,0.0010266189,0.0019465847,0.0017655711,0.0005813016,0.0015480164,0.0017558311,0.001481788,0.002274114],"category_scores_gemma":[0.0018571237,0.00085625466,0.0020531046,0.0014433312,0.0007556281,0.0016024329,0.0021086743,0.0014012454,0.0013881346],"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.00036266126,0.00016800693,0.00061052595,0.00034557312,0.0002821524,0.00019667791,0.0004312864,0.24224347,0.12028176,0.07126587,0.0054294993,0.5583825],"study_design_scores_gemma":[0.00000590614,0.000017944598,0.000120248165,0.0000061054584,0.000018615438,0.000047011512,0.000010639177,0.9836822,0.0042206384,0.011066651,0.00078868866,0.000015271049],"about_ca_topic_score_codex":0.0034872682,"about_ca_topic_score_gemma":0.005638854,"teacher_disagreement_score":0.0034872682,"about_ca_system_score_codex":0.0008252811,"about_ca_system_score_gemma":0.0013718806,"threshold_uncertainty_score":0.0076076984},"labels":[],"label_agreement":null},{"id":"W2968914429","doi":"10.1007/978-3-030-27202-9_24","title":"Bayesian Learning of Infinite Asymmetric Gaussian Mixture Models for Background Subtraction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Mixture model; Background subtraction; Computer science; Artificial intelligence; Gaussian; Gaussian process; Bayesian probability; Parametric statistics; Subtraction; Pattern recognition (psychology); Parametric model; Algorithm; Machine learning; Pixel; Mathematics; Statistics","score_opus":0.028660942511489367,"score_gpt":0.2760545609181368,"score_spread":0.24739361840664742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968914429","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.0010188583,0.0002630418,0.9979335,0.00006124622,0.000017517106,0.0000058156743,0.000035052843,0.00017523213,0.000489632],"genre_scores_gemma":[0.097306736,0.0015303987,0.8909112,0.00020061793,0.00017810788,0.00012338972,0.0009377976,0.0005670463,0.00824465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989862,0.00040691067,0.000048150778,0.00021125271,0.00026458444,0.00008295924],"domain_scores_gemma":[0.99794215,0.001400245,0.000095197676,0.0002228765,0.00026656056,0.000072992334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022259324,0.0011472731,0.001868769,0.0010278216,0.0005435575,0.0020751266,0.0033798926,0.001975512,0.0038442218],"category_scores_gemma":[0.0072842627,0.0014715638,0.0015444116,0.0014924272,0.0010213124,0.0030285777,0.0028560301,0.0034055794,0.0019197646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030998024,0.00009217839,0.00039502187,0.00030775924,0.0001799676,0.00007785195,0.00014466445,0.51873946,0.009095676,0.12337114,0.0064621945,0.34082404],"study_design_scores_gemma":[0.0000053266635,0.000006676801,0.00006593243,0.000012709117,0.00001243055,0.000023446375,0.000004520249,0.9667118,0.0010138918,0.03106575,0.001064841,0.000012612186],"about_ca_topic_score_codex":0.003730864,"about_ca_topic_score_gemma":0.00488923,"teacher_disagreement_score":0.0038442218,"about_ca_system_score_codex":0.0011824572,"about_ca_system_score_gemma":0.0010934753,"threshold_uncertainty_score":0.012860239},"labels":[],"label_agreement":null},{"id":"W2969174528","doi":"10.1007/978-3-319-50832-0","title":"Advances in Visual Computing","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Las vegas; Computer science; Computer graphics (images); Set (abstract data type); Volume (thermodynamics); Artificial intelligence; Programming language","score_opus":0.012709739973195851,"score_gpt":0.30869911657802,"score_spread":0.29598937660482416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969174528","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038431708,0.16132796,0.4015051,0.007069007,0.015053885,0.00014709221,0.0012647792,0.009144049,0.40064493],"genre_scores_gemma":[0.046056833,0.112511314,0.14543258,0.0019429142,0.0065503637,0.00022561512,0.0026452562,0.0042735515,0.6803615],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931717,0.00008380127,0.0000369546,0.00011330788,0.0003908408,0.000057996316],"domain_scores_gemma":[0.9987704,0.00034794275,0.000040427494,0.0002487752,0.0004326738,0.00015972208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085555745,0.0012745588,0.0011349233,0.0026228027,0.00059265294,0.0046571097,0.0014090979,0.0010543704,0.061737347],"category_scores_gemma":[0.0022039434,0.00064829754,0.0006882147,0.0033405358,0.0009082828,0.0044471356,0.0023000652,0.0025120415,0.030616337],"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.00004220548,0.00004186989,0.00009258516,0.0006703524,0.000032374912,0.00005662673,0.00014406061,0.0011607228,0.004145149,0.102173716,0.2785096,0.6129307],"study_design_scores_gemma":[0.00001310237,0.000023487482,0.00024286419,0.00027809857,0.000020403242,0.00024068526,0.000080049766,0.00621633,0.0024467832,0.10386442,0.8865488,0.000025062693],"about_ca_topic_score_codex":0.0013819699,"about_ca_topic_score_gemma":0.0018447391,"teacher_disagreement_score":0.061737347,"about_ca_system_score_codex":0.00088916114,"about_ca_system_score_gemma":0.0009423385,"threshold_uncertainty_score":0.206532},"labels":[],"label_agreement":null},{"id":"W2969192420","doi":"10.1007/978-3-030-27272-2_36","title":"An End-to-End Deep Learning Based Gesture Recognizer for Vehicle Self Parking System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software deployment; Automotive industry; End-to-end principle; Gesture; Robustness (evolution); Gesture recognition; Artificial intelligence; Deep learning; Classifier (UML); Computer vision; Real-time computing; Engineering","score_opus":0.017379542823800102,"score_gpt":0.24456647487266106,"score_spread":0.22718693204886095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969192420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11343749,0.0008707469,0.8201037,0.0003544902,0.0005932239,0.00026983334,0.0021629063,0.050235543,0.011971967],"genre_scores_gemma":[0.6720735,0.00033826873,0.2737382,0.0007125657,0.00009236489,0.00022238582,0.0038873667,0.00049068825,0.048444703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980134,0.000013966051,0.000010787167,0.000054341865,0.0000777008,0.00004180223],"domain_scores_gemma":[0.9999058,0.000012259461,0.0000056477456,0.000016243874,0.000046426903,0.000013686752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017949288,0.00059954094,0.00067718426,0.00031321665,0.00026618308,0.00037297586,0.0010223814,0.0006769207,0.008200858],"category_scores_gemma":[0.00020090472,0.0002894306,0.00027741853,0.00023322011,0.0001228148,0.00052056613,0.0005438853,0.00068717496,0.004906586],"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.00073197566,0.00033007647,0.0015446851,0.00015569107,0.00010363964,0.00031366502,0.00005226325,0.012400667,0.23512237,0.0010494262,0.027217068,0.7209785],"study_design_scores_gemma":[0.000094868505,0.0005911671,0.0060343947,0.00003481517,0.00008985714,0.0005684364,0.00005607548,0.7529795,0.22006626,0.0010679183,0.0183315,0.000085218024],"about_ca_topic_score_codex":0.0043225754,"about_ca_topic_score_gemma":0.009218886,"teacher_disagreement_score":0.008200858,"about_ca_system_score_codex":0.00030008345,"about_ca_system_score_gemma":0.00052819663,"threshold_uncertainty_score":0.027434587},"labels":[],"label_agreement":null},{"id":"W2969392895","doi":"10.1007/978-3-030-29387-1_36","title":"A Comparative Study of Pointing Techniques for Eyewear Using a Simulated Pedestrian Environment","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eyewear; Computer science; Touchscreen; Phone; Human–computer interaction; Simulation; Computer vision","score_opus":0.04304703850177877,"score_gpt":0.30053128210406255,"score_spread":0.2574842436022838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969392895","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.9856242,0.0005526659,0.01212151,0.000016230002,0.000024594232,0.00009262189,0.0001817481,0.00021509085,0.0011713638],"genre_scores_gemma":[0.9800598,0.0006221673,0.0178038,0.000019020532,0.000010528678,0.000065060114,0.00021646866,0.000093250055,0.0011099225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909365,0.00041332873,0.000050341983,0.00014351755,0.00021406126,0.00008508227],"domain_scores_gemma":[0.9946287,0.0036812495,0.00019370248,0.0003574213,0.0010009079,0.00013791453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010357635,0.000705456,0.00081574445,0.0011219676,0.00051557395,0.00080168055,0.00078480167,0.0010126994,0.0022070485],"category_scores_gemma":[0.006347337,0.0003409238,0.00058995787,0.000913569,0.00029382994,0.00088265847,0.0006485655,0.0003459248,0.00062530854],"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.012306616,0.0036360098,0.028051913,0.0032580737,0.000542696,0.0015954935,0.011887049,0.017357942,0.48926187,0.000555394,0.0014800961,0.4300669],"study_design_scores_gemma":[0.0011222238,0.050393164,0.5165175,0.0007004631,0.0023984557,0.0057403995,0.016994435,0.16041882,0.23213246,0.0015048841,0.011425494,0.0006517245],"about_ca_topic_score_codex":0.003901088,"about_ca_topic_score_gemma":0.004462252,"teacher_disagreement_score":0.003901088,"about_ca_system_score_codex":0.0002599028,"about_ca_system_score_gemma":0.00040538923,"threshold_uncertainty_score":0.0077567697},"labels":[],"label_agreement":null},{"id":"W2969409770","doi":"10.1007/978-3-030-29908-8_38","title":"Identity Resolution in Ontology Based Data Access to Structured Data Sources","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Assertion; Ontology; Description logic; Information retrieval; Identity (music); P; Relational database; Data access; Theoretical computer science; Programming language; Algorithm; Time complexity","score_opus":0.0898721322830801,"score_gpt":0.33400899317771826,"score_spread":0.24413686089463815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969409770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00885704,0.00087709277,0.98114544,0.0008458457,0.00013818828,0.00013482993,0.00012971475,0.00088803616,0.0069838264],"genre_scores_gemma":[0.18771894,0.0024604434,0.7930807,0.0005942593,0.0002239803,0.00032362636,0.0011899902,0.0005482818,0.013859761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98624265,0.005049571,0.0016604968,0.0010485724,0.0052147578,0.0007839421],"domain_scores_gemma":[0.9893429,0.00573984,0.00048314643,0.0031248156,0.0010603297,0.00024878336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01144619,0.00048716887,0.0013456297,0.00308915,0.002435809,0.010072038,0.0038557847,0.002432987,0.003815132],"category_scores_gemma":[0.025659623,0.0012363461,0.001755068,0.0064620017,0.0035834168,0.014987029,0.009374054,0.004316311,0.0016275087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001886116,0.00014747954,0.00087136636,0.00033099082,0.0000687608,0.0006679529,0.0024602253,0.008689232,0.0031133099,0.7952574,0.0071411775,0.18106338],"study_design_scores_gemma":[0.000037871854,0.00004443633,0.00042886753,0.00022389286,0.00011771519,0.0008090235,0.0014443359,0.17308185,0.015590622,0.75226885,0.055867933,0.00008456459],"about_ca_topic_score_codex":0.0048328442,"about_ca_topic_score_gemma":0.0029747032,"teacher_disagreement_score":0.01144619,"about_ca_system_score_codex":0.0017471121,"about_ca_system_score_gemma":0.0022509336,"threshold_uncertainty_score":0.060534},"labels":[],"label_agreement":null},{"id":"W2969438042","doi":"10.1007/978-3-030-35802-0_2","title":"Representing Graphs and Hypergraphs by Touching Polygons in 3D","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regular polygon; Vertex (graph theory); Graph; Point (geometry); Enhanced Data Rates for GSM Evolution; Graph drawing; Construct (python library); Time complexity","score_opus":0.010227860605101719,"score_gpt":0.2329833352907458,"score_spread":0.22275547468564408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969438042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011689623,0.00042851162,0.969507,0.00015492084,0.00015867152,0.00005283417,0.00042331798,0.0022241292,0.015360964],"genre_scores_gemma":[0.20393665,0.0022962466,0.76894283,0.00019059812,0.000097132484,0.00021097108,0.0013615122,0.0016229759,0.021341048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997181,0.00006728464,0.000019933661,0.00006990973,0.00009608034,0.000028643355],"domain_scores_gemma":[0.9995189,0.00023845423,0.00003406111,0.00011394327,0.00005519361,0.000039456718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027351142,0.0011755689,0.00087945495,0.0012694891,0.0006413577,0.003312569,0.0015279199,0.001198549,0.015819965],"category_scores_gemma":[0.0014801472,0.00093516795,0.0011626263,0.0022157317,0.0011619427,0.0031088102,0.0028548164,0.0015741872,0.0028867044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001273052,0.000064418426,0.0004916132,0.00045358684,0.000049248007,0.00044714997,0.00091885636,0.35034907,0.011460409,0.39293012,0.012964772,0.22974345],"study_design_scores_gemma":[0.00003395162,0.000040630897,0.00018420287,0.00011786196,0.00003410577,0.00031651233,0.00030328776,0.63393587,0.007938414,0.29585174,0.061187338,0.00005620935],"about_ca_topic_score_codex":0.0020959456,"about_ca_topic_score_gemma":0.0029764627,"teacher_disagreement_score":0.015819965,"about_ca_system_score_codex":0.0005521683,"about_ca_system_score_gemma":0.00035174142,"threshold_uncertainty_score":0.052923083},"labels":[],"label_agreement":null},{"id":"W2969485706","doi":"10.1007/978-3-030-35802-0_31","title":"Line and Plane Cover Numbers Revisited","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Vertex (graph theory); Vertex cover; Planar graph; Graph; Covering space; Plane (geometry); Dimension (graph theory); Discrete mathematics; Geometry","score_opus":0.014416126338365564,"score_gpt":0.26437236772436823,"score_spread":0.24995624138600267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969485706","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.27173454,0.008496665,0.18131965,0.010967398,0.0020524743,0.00008798833,0.0010228663,0.0006143546,0.5237041],"genre_scores_gemma":[0.89566046,0.0041244477,0.041789744,0.0013000959,0.0021879652,0.0001645842,0.0006017381,0.000332031,0.053838857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.0002634543,0.00005342459,0.00027057886,0.0004192714,0.00019620538],"domain_scores_gemma":[0.9963223,0.0022789624,0.00041806707,0.0002937228,0.000361593,0.00032547422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010114729,0.0006380152,0.0009767811,0.0052584196,0.0018978104,0.004429324,0.0013765196,0.0021221288,0.022850467],"category_scores_gemma":[0.0080560185,0.0005275267,0.00050003646,0.0044291667,0.0028699832,0.0077472627,0.0026916156,0.004144047,0.0022776003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036088768,0.000010053174,0.00023317122,0.0000433564,0.000004524843,0.000056013527,0.00014100828,0.0007075444,0.00029201884,0.9858359,0.003430106,0.009210021],"study_design_scores_gemma":[0.000018093273,0.000019048042,0.00076061557,0.000038811817,0.0000136582485,0.00028916594,0.00019554699,0.0066362135,0.0005525011,0.97277,0.018692955,0.000013337174],"about_ca_topic_score_codex":0.0010455896,"about_ca_topic_score_gemma":0.000631643,"teacher_disagreement_score":0.022850467,"about_ca_system_score_codex":0.0014240885,"about_ca_system_score_gemma":0.00035056824,"threshold_uncertainty_score":0.07644236},"labels":[],"label_agreement":null},{"id":"W2969497412","doi":"10.1007/978-3-030-29888-3_52","title":"A Global-Matching Framework for Multi-View Stereopsis","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Artificial intelligence; Matching (statistics); Stereopsis; Artificial neural network; Pixel; Computer vision; Smoothness; Image (mathematics); Function (biology)","score_opus":0.03326083388121624,"score_gpt":0.326402644019259,"score_spread":0.29314181013804275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969497412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060454576,0.00009133144,0.99790084,0.000013077791,0.000014947191,0.000011829964,0.00003614419,0.00033497045,0.0009922315],"genre_scores_gemma":[0.066955656,0.00047873645,0.92628515,0.000072228984,0.00008159015,0.0000745832,0.00042754217,0.0005054391,0.0051191286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.000112715876,0.000034994926,0.00015714929,0.00030939057,0.000085638],"domain_scores_gemma":[0.99974793,0.000039963466,0.000020606165,0.0000927952,0.00007658967,0.000022081038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006536034,0.0009778771,0.0014547297,0.0013729715,0.00065534335,0.0016685186,0.0025205775,0.0014787982,0.00888789],"category_scores_gemma":[0.0009405929,0.0007122488,0.0017214491,0.0019811701,0.0007245029,0.002009791,0.0033808372,0.0017745662,0.0033031004],"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.00015989179,0.00012317057,0.00027331614,0.00024003723,0.00011163035,0.00018103451,0.00012530522,0.118878946,0.04307352,0.23876539,0.008626051,0.5894418],"study_design_scores_gemma":[0.000020168503,0.000080773476,0.00028069093,0.000032247164,0.0000410323,0.00027861734,0.00004351028,0.84465146,0.011564542,0.12842634,0.014547201,0.00003336583],"about_ca_topic_score_codex":0.0028996167,"about_ca_topic_score_gemma":0.004015361,"teacher_disagreement_score":0.00888789,"about_ca_system_score_codex":0.00058756955,"about_ca_system_score_gemma":0.00081401673,"threshold_uncertainty_score":0.029732943},"labels":[],"label_agreement":null},{"id":"W2969514515","doi":"10.1007/978-3-030-26980-7_43","title":"Logarithmic Divergences: Geometry and Interpretation of Curvature","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bregman divergence; Divergence (linguistics); Geodesic; Curvature; Information geometry; Logarithm; Statistical manifold; Mathematics; Geometry; Manifold (fluid mechanics); Sectional curvature; Affine transformation; Conformal map; Mathematical analysis; Scalar curvature","score_opus":0.008606988016522486,"score_gpt":0.23544234857122837,"score_spread":0.22683536055470588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969514515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08488263,0.06423963,0.43758795,0.013157072,0.0029204637,0.00004866868,0.0007217326,0.00088836957,0.39555353],"genre_scores_gemma":[0.80296546,0.02061313,0.05844422,0.000984798,0.0037488793,0.000077597426,0.00046702856,0.0005091777,0.11218977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997367,0.0000830919,0.000014727928,0.000057799534,0.000088756926,0.000018813787],"domain_scores_gemma":[0.99948955,0.00021089164,0.00005718691,0.000075631564,0.00011264191,0.000054125878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891366,0.0009414962,0.0005870199,0.0018037243,0.000591606,0.0033413805,0.00096301874,0.0012676971,0.005276972],"category_scores_gemma":[0.0022507356,0.0003992578,0.00048953923,0.0014703408,0.0034194153,0.0049499185,0.0011612262,0.0026133112,0.0013228706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071892555,0.0000037690513,0.00005207691,0.00003383952,0.000002532297,0.000019582907,0.000103260085,0.0007009947,0.0003808332,0.9889053,0.002532743,0.0072578522],"study_design_scores_gemma":[0.0000015119064,0.0000043169143,0.00008633599,0.000008716666,0.0000013034692,0.000054801876,0.00001938478,0.0019694718,0.00009944625,0.99091923,0.0068306867,0.000004645272],"about_ca_topic_score_codex":0.0006239955,"about_ca_topic_score_gemma":0.00043567145,"teacher_disagreement_score":0.005276972,"about_ca_system_score_codex":0.0012559211,"about_ca_system_score_gemma":0.00049404206,"threshold_uncertainty_score":0.017653227},"labels":[],"label_agreement":null},{"id":"W2969700688","doi":"10.1007/978-3-030-29891-3_8","title":"Non-contact Heart Rate Monitoring Using Multiple RGB Cameras","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; RGB color model; Computer vision; Artificial intelligence; Ground truth; SIGNAL (programming language); Real-time computing","score_opus":0.019380159912231555,"score_gpt":0.23896742302845922,"score_spread":0.21958726311622767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969700688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0949683,0.009548668,0.85799825,0.00022346355,0.00046686397,0.0001979207,0.0013015429,0.0033833191,0.031911653],"genre_scores_gemma":[0.6405743,0.009481195,0.2742886,0.0005581723,0.0006137752,0.00028702163,0.0014144254,0.0005217508,0.072260715],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999608,0.000043415497,0.000014133673,0.00010728932,0.00020556501,0.000021629912],"domain_scores_gemma":[0.99975115,0.00010403391,0.000029934177,0.000044334836,0.000057324207,0.000013295973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021175429,0.0005341068,0.00056468736,0.00043833148,0.00012042632,0.00070937665,0.0006492089,0.0006039957,0.006650169],"category_scores_gemma":[0.0005047748,0.00032344018,0.00030839274,0.00059303374,0.000110147856,0.0007968188,0.0005237839,0.00031512132,0.0026717414],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003793984,0.00009522011,0.002069225,0.0004895726,0.000060751587,0.00016609216,0.000091999806,0.0011166625,0.3822819,0.0006370043,0.0053001414,0.6073121],"study_design_scores_gemma":[0.0001310998,0.0015298943,0.12753993,0.00041777184,0.00041308385,0.010110364,0.00022676829,0.14088207,0.6386573,0.0035260497,0.07636063,0.00020505181],"about_ca_topic_score_codex":0.0003155064,"about_ca_topic_score_gemma":0.0008102209,"teacher_disagreement_score":0.006650169,"about_ca_system_score_codex":0.00011610297,"about_ca_system_score_gemma":0.00012112515,"threshold_uncertainty_score":0.022247076},"labels":[],"label_agreement":null},{"id":"W2969730556","doi":"10.1007/978-3-030-33720-9_4","title":"DomainSiam: Domain-Aware Siamese Network for Visual Object Tracking","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; Memorial University of Newfoundland","funders":"","keywords":"Overfitting; Computer science; BitTorrent tracker; Artificial intelligence; Task (project management); Feature (linguistics); Set (abstract data type); Domain (mathematical analysis); Machine learning; Computer vision; Class (philosophy); Deep learning; Object (grammar); Pattern recognition (psychology); Eye tracking; Artificial neural network","score_opus":0.025962792774452775,"score_gpt":0.32532938292318603,"score_spread":0.29936659014873324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969730556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036773558,0.00015155977,0.98738164,0.00008323947,0.000061395556,0.000057086316,0.00037516947,0.0072258594,0.0009867634],"genre_scores_gemma":[0.12532558,0.0002838578,0.863213,0.00019752506,0.00007317026,0.00025283097,0.0027098756,0.0011429297,0.0068012434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954283,0.00009223106,0.000021374974,0.00015702264,0.00013581026,0.000050759438],"domain_scores_gemma":[0.99925965,0.00020718726,0.000041828454,0.00024320836,0.00018139242,0.000066708526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010716363,0.0010539608,0.00092228915,0.0014111121,0.00056481146,0.0011955104,0.0021369215,0.0012392877,0.0060037524],"category_scores_gemma":[0.0032348623,0.00062253664,0.00076875504,0.0013783645,0.00051985437,0.0017756722,0.0025357057,0.0018017164,0.0027781005],"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.00056619715,0.00031908133,0.0015175324,0.00019197396,0.00020894175,0.00015144232,0.00011418664,0.24113989,0.019751059,0.019575216,0.039783843,0.6766807],"study_design_scores_gemma":[0.000018907587,0.000019257961,0.00016073091,0.0000045682073,0.0000070378996,0.00003494517,0.000009287795,0.9868859,0.0031531483,0.006629098,0.0030685847,0.000008473369],"about_ca_topic_score_codex":0.007131402,"about_ca_topic_score_gemma":0.015326073,"teacher_disagreement_score":0.007131402,"about_ca_system_score_codex":0.0007079607,"about_ca_system_score_gemma":0.0013020991,"threshold_uncertainty_score":0.02008462},"labels":[],"label_agreement":null},{"id":"W2969736595","doi":"10.1007/978-3-030-26619-6_9","title":"Goal-oriented Process Enhancement and Discovery","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"Interpretability; Computer science; Process (computing); Event (particle physics); Perspective (graphical); Timestamp; Identifier; Process mining; Business process discovery; Data mining; Data science; Artificial intelligence; Business process; Business process management; Work in process; Business process modeling; Computer security","score_opus":0.010106251450441353,"score_gpt":0.2256971146005768,"score_spread":0.21559086315013543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969736595","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.003354,0.00039585124,0.9682694,0.00029867943,0.000040086994,0.000098380995,0.00003221372,0.00084506755,0.026666237],"genre_scores_gemma":[0.1411118,0.0013115754,0.8248753,0.00016677848,0.00006006184,0.00020176118,0.00026719813,0.00028614307,0.031719416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998566,0.00041091949,0.000083381274,0.00029477448,0.00053460256,0.00011037957],"domain_scores_gemma":[0.99778783,0.001133636,0.000106617445,0.0006324443,0.00026747983,0.00007194914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025270178,0.00073528057,0.00050227187,0.0011418234,0.00049947103,0.0026251064,0.001558832,0.00077243405,0.005304941],"category_scores_gemma":[0.0032628851,0.0005597883,0.0009849665,0.0013964656,0.0013838394,0.0037952994,0.0019106986,0.0018865131,0.0018265166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084325424,0.00016556884,0.0003820385,0.0002643447,0.000039134415,0.00009514584,0.00049986684,0.010319021,0.0053356085,0.6714053,0.0035699916,0.30783954],"study_design_scores_gemma":[0.00004591187,0.00010830822,0.00039150045,0.00014634313,0.00011292214,0.0002952931,0.00020070624,0.18474777,0.027114555,0.6945584,0.09224539,0.000033024706],"about_ca_topic_score_codex":0.0008103757,"about_ca_topic_score_gemma":0.00080091273,"teacher_disagreement_score":0.005304941,"about_ca_system_score_codex":0.0008250146,"about_ca_system_score_gemma":0.0015260333,"threshold_uncertainty_score":0.017746747},"labels":[],"label_agreement":null},{"id":"W2969848726","doi":"10.1007/978-3-030-34405-4_1","title":"Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Concordia University","funders":"","keywords":"Equilateral triangle; Perimeter; Combinatorics; Range (aeronautics); Centroid; Mathematics; Point (geometry); Computer science; Mobile agent; Mathematical optimization; Geometry; Distributed computing; Engineering","score_opus":0.0343644728755405,"score_gpt":0.30826128946266623,"score_spread":0.2738968165871257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969848726","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.5283907,0.00060070015,0.4475681,0.0013894074,0.00029619315,0.00024623197,0.0005953024,0.00044062565,0.02047273],"genre_scores_gemma":[0.95141155,0.0003364048,0.034945004,0.00017165006,0.000053158838,0.00018169689,0.00045549826,0.00011312607,0.012331844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996817,0.00008218609,0.000016415348,0.000065524895,0.00004588107,0.00010827261],"domain_scores_gemma":[0.99824524,0.00088441843,0.00027775505,0.00013606215,0.00011905685,0.00033754547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004145504,0.0006587382,0.0013663482,0.0008055285,0.0014415468,0.0013981349,0.0019003483,0.0022605944,0.0052256356],"category_scores_gemma":[0.004285883,0.00067018217,0.0010059605,0.0008255253,0.0012428784,0.0015864922,0.004007656,0.001159992,0.00075892743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006774643,0.00009095757,0.0014064406,0.00016902294,0.000052624087,0.00085380184,0.0004453327,0.95708144,0.0045055873,0.023593511,0.0019355492,0.009188203],"study_design_scores_gemma":[0.000059479542,0.000079652564,0.00015134802,0.000018138835,0.000011810618,0.00007638963,0.00026044366,0.9811198,0.0011229798,0.015684245,0.0014025538,0.000013031775],"about_ca_topic_score_codex":0.0047511957,"about_ca_topic_score_gemma":0.0026859562,"teacher_disagreement_score":0.0052256356,"about_ca_system_score_codex":0.0007790201,"about_ca_system_score_gemma":0.0006394924,"threshold_uncertainty_score":0.017481446},"labels":[],"label_agreement":null},{"id":"W2969872129","doi":"10.1007/978-3-030-29387-1_38","title":"FittsFarm: Comparing Children’s Drag-and-Drop Performance Using Finger and Stylus Input on Tablets","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Stylus; Drag; Computer science; Drop (telecommunication); Hand held; Task (project management); Simulation; Mathematics; Computer vision; Engineering; Mechanical engineering; Telecommunications","score_opus":0.017934205200905027,"score_gpt":0.24190636894120435,"score_spread":0.22397216374029932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969872129","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.9633283,0.00031708786,0.0098041985,0.00008117329,0.000090192676,0.00025473916,0.008075819,0.0020510056,0.01599762],"genre_scores_gemma":[0.9451251,0.00030404556,0.023410132,0.0000624805,0.00001965661,0.0004913275,0.0087637305,0.000705132,0.021118462],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99931943,0.000106000356,0.00007598614,0.0001568578,0.0002628856,0.00007875812],"domain_scores_gemma":[0.998466,0.0009425009,0.00010627032,0.0001489919,0.00017169087,0.00016459814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047712697,0.0009962218,0.0005400749,0.0010790357,0.00024431874,0.00096477784,0.0008804128,0.0007549184,0.018255731],"category_scores_gemma":[0.0029267306,0.0003495089,0.00050091784,0.0006809183,0.00038873943,0.0012435864,0.0013891363,0.0004735387,0.0037194937],"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.009679338,0.0021312921,0.06892151,0.0017665442,0.00027893775,0.0023643957,0.0110989725,0.0030086536,0.2631496,0.0016602098,0.026612002,0.60932857],"study_design_scores_gemma":[0.0006358145,0.0057906653,0.84696823,0.00020838661,0.00025819332,0.0034486207,0.0068214736,0.012228292,0.09530541,0.0010846724,0.026963942,0.00028629013],"about_ca_topic_score_codex":0.008041966,"about_ca_topic_score_gemma":0.009534416,"teacher_disagreement_score":0.018255731,"about_ca_system_score_codex":0.00030679218,"about_ca_system_score_gemma":0.0003327781,"threshold_uncertainty_score":0.061071515},"labels":[],"label_agreement":null},{"id":"W2969945018","doi":"10.1007/978-3-030-29007-8_4","title":"A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Answer set programming; Artificial intelligence; Formalism (music); Preference; Declarative programming; Domain (mathematical analysis); Theoretical computer science; Logic programming; Decision problem; Set (abstract data type); Machine learning; Programming language; Inductive programming; Programming paradigm; Mathematics","score_opus":0.023188732706196383,"score_gpt":0.2797779865081381,"score_spread":0.25658925380194175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969945018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008898445,0.000106233456,0.99333936,0.00023291359,0.000046499626,0.00011710513,0.00027937294,0.0015697922,0.003418833],"genre_scores_gemma":[0.028278282,0.00018398237,0.96649396,0.00025517223,0.00007705134,0.00032480873,0.00088576385,0.00040111318,0.0030998832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968683,0.00085493375,0.00038682402,0.0005182442,0.0010489263,0.0003227242],"domain_scores_gemma":[0.9970504,0.0014582431,0.00013581404,0.00065628387,0.00047731103,0.0002218968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00389201,0.0013648344,0.0012735631,0.0017695188,0.0015831174,0.005158632,0.005566857,0.0017389272,0.014071041],"category_scores_gemma":[0.008534577,0.0015452353,0.004410406,0.0023058073,0.0022076713,0.009729992,0.0051507144,0.0065507805,0.003974544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012565813,0.00019939167,0.00034374403,0.000371231,0.00011112741,0.00027012758,0.00076163735,0.011824618,0.003862127,0.837904,0.013842908,0.13038343],"study_design_scores_gemma":[0.00008527766,0.0000537214,0.00019547877,0.00010678989,0.000119494805,0.00023448639,0.0002527383,0.13478333,0.004483099,0.8093834,0.05022274,0.000079416146],"about_ca_topic_score_codex":0.0049550384,"about_ca_topic_score_gemma":0.00879852,"teacher_disagreement_score":0.014071041,"about_ca_system_score_codex":0.0015113336,"about_ca_system_score_gemma":0.0024553838,"threshold_uncertainty_score":0.04707235},"labels":[],"label_agreement":null},{"id":"W2970987521","doi":"10.1007/978-3-030-26250-1_23","title":"Improving ML Safety with Partial Specifications","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workflow; Software engineering; Key (lock); Component (thermodynamics); Safety assurance; Software; Partial evaluation; Programming language; Reliability engineering; Operating system; Database; Engineering","score_opus":0.01840434861093901,"score_gpt":0.2362812111301523,"score_spread":0.2178768625192133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970987521","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.01334218,0.0003269618,0.97561556,0.0005475804,0.00010539324,0.000041916774,0.00012363198,0.0036453146,0.006251452],"genre_scores_gemma":[0.69110596,0.00057026726,0.29327866,0.00096910493,0.00038286299,0.00016560167,0.0008442718,0.0024314388,0.010251835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99184954,0.002741053,0.0005128754,0.0009092209,0.0033231366,0.00066412106],"domain_scores_gemma":[0.9750591,0.015019278,0.00087161944,0.0071714697,0.0015852774,0.0002932415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047881273,0.00146034,0.0012317308,0.0009434241,0.0006746562,0.0026141638,0.002154695,0.0017916673,0.008451843],"category_scores_gemma":[0.026825951,0.0011150914,0.0017594611,0.0006480427,0.0034683857,0.0050229346,0.005919332,0.0053940583,0.0025525289],"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.0008191855,0.00018769495,0.00159013,0.000546834,0.00016883985,0.00036329476,0.00035676986,0.26726234,0.0231271,0.3726676,0.010312984,0.3225972],"study_design_scores_gemma":[0.000056258916,0.000201276,0.00014094464,0.000093631585,0.00006182217,0.00019243611,0.000048568294,0.51866424,0.022734562,0.45173576,0.006030155,0.000040289036],"about_ca_topic_score_codex":0.000541391,"about_ca_topic_score_gemma":0.000788825,"teacher_disagreement_score":0.008451843,"about_ca_system_score_codex":0.0008366418,"about_ca_system_score_gemma":0.0017175825,"threshold_uncertainty_score":0.028274238},"labels":[],"label_agreement":null},{"id":"W2971041528","doi":"10.1007/978-3-030-26601-1_4","title":"Brace Touch: A Dependable, Turbulence-Tolerant, Multi-touch Interaction Technique for Interactive Cockpits","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Cockpit; Dependability; Human–computer interaction; Software deployment; Usability; Computer science; Crew; Engineering; Embedded system; Aeronautics; Operating system; Software engineering","score_opus":0.03636777038494992,"score_gpt":0.35280543106829454,"score_spread":0.3164376606833446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971041528","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.08692319,0.0035400118,0.8684515,0.0003680189,0.00032944183,0.00020353882,0.0003374052,0.012842703,0.027004195],"genre_scores_gemma":[0.6358226,0.0025022393,0.27841374,0.00059505214,0.00013265827,0.00028851037,0.0007436127,0.0023552575,0.079146296],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956733,0.000031694202,0.0000122479505,0.00007542452,0.00025946487,0.00005387413],"domain_scores_gemma":[0.9997371,0.0001067123,0.00002204974,0.000054245436,0.000043572883,0.000036315276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018405866,0.00087453896,0.0005699883,0.0005325607,0.00048579718,0.00075252657,0.001781606,0.0009448207,0.01518099],"category_scores_gemma":[0.0005060382,0.00042500472,0.0003834365,0.00036636717,0.00041667616,0.0009049593,0.0016410548,0.00094610656,0.002128585],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003735437,0.00012915814,0.00034111654,0.0005680385,0.00004421052,0.0004419235,0.00060421095,0.0024272057,0.67237335,0.0026843017,0.00832004,0.31169292],"study_design_scores_gemma":[0.00025937145,0.002647661,0.014391459,0.0003435166,0.00024012222,0.008850379,0.0007229802,0.13621117,0.59567094,0.0048701717,0.23538376,0.0004084106],"about_ca_topic_score_codex":0.00066017435,"about_ca_topic_score_gemma":0.0013389819,"teacher_disagreement_score":0.01518099,"about_ca_system_score_codex":0.00016298346,"about_ca_system_score_gemma":0.00019109447,"threshold_uncertainty_score":0.050785422},"labels":[],"label_agreement":null},{"id":"W2971155082","doi":"10.1007/978-3-662-59958-7_3","title":"A Study of Three Different Approaches to Point Placement on a Line in an Inexact Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor","funders":"","keywords":"Computer science; Embedding; Heuristic; Pairwise comparison; Algorithm; Point (geometry); Line (geometry); Adversary; Linear programming; Sequence (biology); Function (biology); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Geometry","score_opus":0.0940192473809117,"score_gpt":0.28303223108929837,"score_spread":0.18901298370838665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971155082","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.016918736,0.0009187357,0.9682398,0.00036846334,0.00008040442,0.00005212045,0.000053224416,0.00017502533,0.01319355],"genre_scores_gemma":[0.29151922,0.002294527,0.6888366,0.00018285323,0.0001623581,0.0001766729,0.00023443186,0.0003933524,0.016199956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763453,0.00078668207,0.00010215828,0.0003158853,0.0010117708,0.00014901356],"domain_scores_gemma":[0.9923653,0.0053011356,0.00047494538,0.0009647537,0.00061772653,0.00027601185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025629385,0.0012167275,0.0015056366,0.0015089723,0.0011330514,0.0041829413,0.004864531,0.0041054934,0.008120836],"category_scores_gemma":[0.012332539,0.0009801834,0.0018528389,0.0031109715,0.0030116518,0.005921942,0.0036017578,0.0032186576,0.0011055641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017800965,0.0001321994,0.00065301405,0.0004520351,0.00007503959,0.00014054662,0.0004447469,0.5961651,0.0013122312,0.30516404,0.0022039257,0.09307913],"study_design_scores_gemma":[0.00002989021,0.00018586061,0.00028371727,0.000071109826,0.000038673505,0.00014803313,0.000259191,0.9228354,0.0012127324,0.07067239,0.0042223064,0.000040624986],"about_ca_topic_score_codex":0.0031737443,"about_ca_topic_score_gemma":0.0035212024,"teacher_disagreement_score":0.008120836,"about_ca_system_score_codex":0.0016064093,"about_ca_system_score_gemma":0.0013175725,"threshold_uncertainty_score":0.027166903},"labels":[],"label_agreement":null},{"id":"W2971207654","doi":"10.1007/978-3-030-29390-1_26","title":"On-Body Tangible Interaction: Using the Body to Support Tangible Manipulations for Immersive Environments","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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 Manitoba","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Human–computer interaction; Gesture; Space (punctuation); Artificial intelligence","score_opus":0.030814856969880032,"score_gpt":0.2988133119010782,"score_spread":0.26799845493119817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971207654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054680884,0.019969063,0.75665957,0.0006484794,0.001363427,0.00015333471,0.00042432058,0.0051861163,0.1609148],"genre_scores_gemma":[0.4031079,0.019766599,0.29855353,0.0005320102,0.0003492314,0.00033513093,0.0010533753,0.0015540784,0.27474824],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998198,0.000023679591,0.000007842321,0.000029635445,0.00008396088,0.000035064517],"domain_scores_gemma":[0.9998857,0.000047354148,0.000010043767,0.000024742247,0.000016357633,0.000015885555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017057196,0.00077076344,0.00039219862,0.00035572457,0.00039249202,0.0015237095,0.0010188683,0.0009711971,0.023631152],"category_scores_gemma":[0.0004089912,0.00040895827,0.00055054104,0.00045313756,0.00061888446,0.0016329149,0.00239054,0.0008720048,0.003760936],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031315692,0.00019634487,0.00036998146,0.0014338573,0.0000610578,0.00067877665,0.0015858015,0.0026338988,0.3523003,0.029438969,0.02226186,0.58872586],"study_design_scores_gemma":[0.00019181804,0.0014737921,0.008328427,0.0013164006,0.0003233642,0.007740429,0.0011752924,0.05202356,0.25317445,0.029376581,0.64459,0.0002859149],"about_ca_topic_score_codex":0.0005671589,"about_ca_topic_score_gemma":0.0009833875,"teacher_disagreement_score":0.023631152,"about_ca_system_score_codex":0.00016008355,"about_ca_system_score_gemma":0.00024466164,"threshold_uncertainty_score":0.07905412},"labels":[],"label_agreement":null},{"id":"W2971324562","doi":"10.1007/978-3-030-28374-2_4","title":"Frequent Itemsets as Descriptors of Textual Records","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Medoid; Similarity (geometry); Data mining; Set (abstract data type); Hierarchical clustering; Process (computing); Association rule learning; Cluster analysis; Artificial intelligence; Information retrieval; Data set; Pattern recognition (psychology); Natural language processing","score_opus":0.01979408017618044,"score_gpt":0.2542030724421918,"score_spread":0.23440899226601136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971324562","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.40707842,0.015909629,0.5231001,0.0011785211,0.0010269244,0.0008585145,0.037060734,0.003933761,0.009853343],"genre_scores_gemma":[0.6791566,0.0046236645,0.26392034,0.00016706905,0.00064653676,0.0006479555,0.042138632,0.00017586167,0.008523317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989145,0.00018705401,0.0001978222,0.00021711791,0.00041100412,0.000072584386],"domain_scores_gemma":[0.99747,0.0015361612,0.00037161045,0.00018879937,0.00034004537,0.00009335709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000642983,0.00049419556,0.000651528,0.008209794,0.0004447495,0.001947276,0.0009292512,0.00060788466,0.0023085296],"category_scores_gemma":[0.0051164543,0.0003637175,0.0006503933,0.008960442,0.00039634536,0.0027710856,0.0006526358,0.00062391226,0.0012120734],"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.0019648124,0.00059069163,0.027650224,0.002374619,0.00037653712,0.0031279519,0.0014861943,0.02060756,0.040577542,0.11297673,0.028420892,0.7598463],"study_design_scores_gemma":[0.00030899252,0.001435429,0.046591397,0.00089453784,0.0006470948,0.008122156,0.0029995875,0.49543732,0.03239477,0.30741376,0.10349234,0.00026263247],"about_ca_topic_score_codex":0.0008109273,"about_ca_topic_score_gemma":0.0010121708,"teacher_disagreement_score":0.008209794,"about_ca_system_score_codex":0.0005822981,"about_ca_system_score_gemma":0.0004934458,"threshold_uncertainty_score":0.0077227354},"labels":[],"label_agreement":null},{"id":"W2972117740","doi":"10.1007/978-3-030-32785-9_5","title":"A Deep Learning Method for Automatic Visual Attention Detection in Older Drivers","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Older Adults Driving Studies","field":"Health Professions","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université TÉLUQ","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Visual attention; Field (mathematics); Measure (data warehouse); Saliency map; Machine learning; Computer vision; Data mining; Psychology; Image (mathematics); Cognition","score_opus":0.025361199111792986,"score_gpt":0.3783684662418382,"score_spread":0.3530072671300452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972117740","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.05711152,0.003836206,0.9292257,0.0004592782,0.00039525336,0.000112869355,0.00096314854,0.0031293975,0.004766718],"genre_scores_gemma":[0.56870073,0.0020256985,0.40049472,0.00057408935,0.000340439,0.00020384003,0.0021886819,0.00022891963,0.025242751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983776,0.000017335511,0.000007867144,0.0000689299,0.000036745856,0.00003133092],"domain_scores_gemma":[0.99980515,0.000061621686,0.000017295743,0.000021773103,0.000078391364,0.000015783045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040924686,0.00067204086,0.00040540777,0.00085699995,0.00020627727,0.0003710335,0.00069856347,0.0007176248,0.0024228827],"category_scores_gemma":[0.0008217331,0.0002705532,0.00052935386,0.0005037676,0.00014288757,0.00045745654,0.00064142956,0.0008189923,0.0009932366],"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.0001386559,0.00012748546,0.0032046635,0.00010017763,0.00007855043,0.00009756033,0.00006718095,0.012167719,0.021951819,0.0012356923,0.009858654,0.95097184],"study_design_scores_gemma":[0.00003216287,0.00018394444,0.011611791,0.00005882342,0.00010699926,0.00049133605,0.00004878726,0.94320154,0.025665533,0.0055885576,0.012971463,0.000039147868],"about_ca_topic_score_codex":0.005689742,"about_ca_topic_score_gemma":0.0081330165,"teacher_disagreement_score":0.005689742,"about_ca_system_score_codex":0.00044693635,"about_ca_system_score_gemma":0.00048409222,"threshold_uncertainty_score":0.01131326},"labels":[],"label_agreement":null},{"id":"W2972137171","doi":"10.1007/978-3-030-33391-1_3","title":"Multi-layer Domain Adaptation for Deep Convolutional Networks","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Domain adaptation; Domain (mathematical analysis); Generalization; Convolutional neural network; Artificial intelligence; Variance (accounting); Adaptation (eye); Layer (electronics); Sample (material); Deep learning; Test data; Machine learning; Class (philosophy); Pattern recognition (psychology); Data mining; Mathematics","score_opus":0.031642173008878074,"score_gpt":0.2798066813761105,"score_spread":0.24816450836723242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972137171","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.018937241,0.00081464933,0.9750064,0.0002275589,0.00011304856,0.000032461874,0.00026404244,0.0022082736,0.0023963295],"genre_scores_gemma":[0.606979,0.00097406714,0.37045833,0.00030875095,0.00012524554,0.00018181109,0.0015561475,0.00066795346,0.018748725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978715,0.00004751382,0.000011256971,0.00006560966,0.000042914595,0.000045647208],"domain_scores_gemma":[0.99947137,0.00021644753,0.000036632897,0.00012798385,0.000118863216,0.000028721535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762742,0.00077724486,0.0005216577,0.0003954515,0.00024303929,0.0005212322,0.0012364815,0.0011448,0.0037724788],"category_scores_gemma":[0.0018938422,0.0005338612,0.0006954634,0.0006377973,0.0003403114,0.00096485636,0.0010852097,0.0020570063,0.001417547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002254807,0.00013189239,0.0007454702,0.00011024825,0.000115943934,0.0000895707,0.000046285822,0.6226082,0.023764022,0.010395304,0.008646283,0.33312127],"study_design_scores_gemma":[0.0000036036624,0.000010109536,0.00012932027,0.000005857684,0.000008037312,0.000013722953,0.0000028041034,0.9934394,0.0029963683,0.002640287,0.0007467251,0.0000037364216],"about_ca_topic_score_codex":0.0074239373,"about_ca_topic_score_gemma":0.011099662,"teacher_disagreement_score":0.0074239373,"about_ca_system_score_codex":0.00070917147,"about_ca_system_score_gemma":0.00078254304,"threshold_uncertainty_score":0.014761448},"labels":[],"label_agreement":null},{"id":"W2972294382","doi":"10.1007/978-3-030-30281-8_5","title":"Finite Approximation of LMPs for Exact Verification of Reachability Properties","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Reachability; Markov decision process; Discretization; Bisimulation; Countable set; Computer science; Probabilistic logic; Computation; Mathematics; State space; Markov process; Discrete mathematics; Algorithm","score_opus":0.047917370854531564,"score_gpt":0.2755737733067918,"score_spread":0.2276564024522602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972294382","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.008826203,0.00015103511,0.9834992,0.00009399249,0.00005720626,0.00007185503,0.00011783342,0.0016889251,0.0054937634],"genre_scores_gemma":[0.47363976,0.00030884647,0.5171225,0.0001802583,0.00006977781,0.0005659616,0.0007265761,0.00064524356,0.006741114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824214,0.00056301814,0.00010202844,0.00029424558,0.0005707102,0.00022785705],"domain_scores_gemma":[0.9946402,0.0040997025,0.00017656639,0.00076546264,0.00025407597,0.00006407979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014194342,0.0010979119,0.0011912227,0.0008509682,0.0006568622,0.0015989358,0.0018607271,0.0010245309,0.008579177],"category_scores_gemma":[0.007180563,0.00063829956,0.0017218171,0.0006801679,0.0014130952,0.001999083,0.0019739133,0.0034842687,0.0015752569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006161094,0.00020583713,0.00057110336,0.0006512286,0.000103635444,0.00032390913,0.00036154286,0.52626795,0.01975361,0.28220177,0.0040085576,0.16493478],"study_design_scores_gemma":[0.00003110377,0.000044726126,0.00006297526,0.000058957357,0.000023616712,0.000038224924,0.000028864775,0.9045636,0.006045608,0.08621671,0.002873862,0.00001181164],"about_ca_topic_score_codex":0.0028881966,"about_ca_topic_score_gemma":0.0044514234,"teacher_disagreement_score":0.008579177,"about_ca_system_score_codex":0.0020677152,"about_ca_system_score_gemma":0.001417736,"threshold_uncertainty_score":0.028700173},"labels":[],"label_agreement":null},{"id":"W2972345006","doi":"10.1007/978-3-030-30493-5_75","title":"Prediction of the Atomization Energy of Molecules Using Coulomb Matrix and Atomic Composition in a Bayesian Regularized Neural Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Materials Science","field":"Materials Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Artificial neural network; Coulomb; Bayesian probability; Matrix (chemical analysis); Molecule; Energy (signal processing); Bayesian optimization; Electronic structure","score_opus":0.007805903955721287,"score_gpt":0.22548330541156614,"score_spread":0.21767740145584485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972345006","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.7643492,0.0016580676,0.2208703,0.0012774371,0.00016089129,0.000095299845,0.0021621247,0.0018284156,0.0075983363],"genre_scores_gemma":[0.91574264,0.00027255324,0.076832175,0.00022248903,0.00004133026,0.000078229066,0.0034141366,0.00012481885,0.0032715888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976164,0.000089742214,0.0000073748683,0.0000619156,0.000056493904,0.000022849406],"domain_scores_gemma":[0.999419,0.00031851005,0.00005978899,0.00006149107,0.00011027912,0.000030949566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078267086,0.0006187606,0.00072204735,0.000514253,0.00028200235,0.0006060809,0.0014227844,0.001288747,0.0021606311],"category_scores_gemma":[0.0018039227,0.00033197386,0.00058801833,0.00049684773,0.0005036288,0.0007304348,0.0005401853,0.0012088824,0.00054645695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011157462,0.00008718527,0.0014173831,0.000051584964,0.00003781184,0.000024102059,0.000009113331,0.97154486,0.0019728905,0.0022983712,0.001892655,0.020552425],"study_design_scores_gemma":[0.0000027679494,0.0000055405812,0.00009185993,0.0000019992922,0.0000012199012,0.0000014280068,0.0000012563022,0.99891114,0.00027999096,0.00063890556,0.000062488136,0.0000013125552],"about_ca_topic_score_codex":0.00993291,"about_ca_topic_score_gemma":0.009811425,"teacher_disagreement_score":0.00993291,"about_ca_system_score_codex":0.0009820295,"about_ca_system_score_gemma":0.00057799835,"threshold_uncertainty_score":0.019750178},"labels":[],"label_agreement":null},{"id":"W2972349200","doi":"10.1007/978-3-030-30493-5_72","title":"Characterization of Quantum Derived Electronic Properties of Molecules: A Computational Intelligence Approach","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Artificial neural network; Cluster analysis; Black box; Artificial intelligence; Computational intelligence; Computational complexity theory; Unsupervised learning; Machine learning; Residual; Set (abstract data type); Algorithm; Theoretical computer science","score_opus":0.02639316135120784,"score_gpt":0.2562006007547329,"score_spread":0.22980743940352505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972349200","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.10034688,0.0021711348,0.8787221,0.0004760157,0.000057939178,0.000065799235,0.00047317287,0.00051697314,0.017170021],"genre_scores_gemma":[0.77172744,0.0014666006,0.22167033,0.00011814326,0.00008500334,0.00011621238,0.00074324233,0.00011012993,0.003962869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998017,0.000063243984,0.000009582568,0.000035998997,0.00007843701,0.000011134658],"domain_scores_gemma":[0.99924743,0.0004906675,0.00006320592,0.000108720364,0.00007625412,0.000013767725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046064323,0.00025441896,0.00043287632,0.0015207842,0.00024253072,0.0010657797,0.000709481,0.0004222486,0.0024108295],"category_scores_gemma":[0.001498067,0.0001453508,0.00052509934,0.0009911872,0.0008380225,0.0011587412,0.00046637145,0.0006011749,0.00048760188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014062051,0.000357813,0.004706044,0.00053458166,0.00013557193,0.0001675326,0.00011282748,0.38630968,0.047955453,0.26517132,0.0033269895,0.29108155],"study_design_scores_gemma":[0.000004382525,0.000037700054,0.0016749246,0.000016234675,0.000010336349,0.00005713353,0.000021819222,0.90589505,0.0074712643,0.08281615,0.0019833434,0.000011633667],"about_ca_topic_score_codex":0.00034627537,"about_ca_topic_score_gemma":0.00027035826,"teacher_disagreement_score":0.0024108295,"about_ca_system_score_codex":0.00039582452,"about_ca_system_score_gemma":0.00025836015,"threshold_uncertainty_score":0.008065045},"labels":[],"label_agreement":null},{"id":"W2972365351","doi":"10.1007/978-3-030-30493-5_66","title":"Progressive Docking - Deep Learning Based Approach for Accelerated Virtual Screening","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Docking (animal); Computer science; Virtual screening; Artificial intelligence; Machine learning; Simulation; Chemistry; Molecular dynamics; Computational chemistry","score_opus":0.04062290999143017,"score_gpt":0.30435287586433807,"score_spread":0.26372996587290787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972365351","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.022073844,0.0005177216,0.9678132,0.00019469051,0.00006750801,0.00009717037,0.00016170532,0.0042356774,0.004838433],"genre_scores_gemma":[0.41401345,0.0006306832,0.57423574,0.00032436594,0.00005111977,0.00023419039,0.00067872537,0.000394108,0.009437549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961805,0.000083525185,0.000016720654,0.00006250559,0.00016412245,0.000055144472],"domain_scores_gemma":[0.9996693,0.00011713337,0.000026869984,0.00007174874,0.00008180636,0.00003324081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067914056,0.0008757823,0.00083778065,0.00060631003,0.00023126157,0.00055388064,0.0018475825,0.0006687231,0.006440616],"category_scores_gemma":[0.00089958316,0.00042696932,0.0006426402,0.00069407787,0.000462243,0.0006640542,0.0015622296,0.0014374459,0.0017611604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019928282,0.00017575915,0.00047982635,0.00016289903,0.000070363385,0.00013325756,0.000031353753,0.67285836,0.027252488,0.013323048,0.004336927,0.2809764],"study_design_scores_gemma":[0.000013970296,0.00003753904,0.00009291453,0.0000042921756,0.0000057267093,0.000026151349,0.0000017502225,0.99283916,0.0035361052,0.002124152,0.001312284,0.0000060332054],"about_ca_topic_score_codex":0.0032109988,"about_ca_topic_score_gemma":0.0032300933,"teacher_disagreement_score":0.006440616,"about_ca_system_score_codex":0.00077364105,"about_ca_system_score_gemma":0.00085353025,"threshold_uncertainty_score":0.021546006},"labels":[],"label_agreement":null},{"id":"W2972431680","doi":"10.1007/978-3-030-30690-8_3","title":"Generic Graphical Navigation for Modelling Tools","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Unified Modeling Language; Metamodeling; Modeling language; Reuse; Feature (linguistics); Software engineering; Programming language; Software","score_opus":0.03128214470885594,"score_gpt":0.24824988294306213,"score_spread":0.2169677382342062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972431680","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.0006240221,0.0003271142,0.9762173,0.00009860491,0.000068080524,0.00005870576,0.00036218693,0.013061728,0.0091822725],"genre_scores_gemma":[0.035017315,0.0015496159,0.9167764,0.00033347745,0.00009744041,0.00036242142,0.003915204,0.008306593,0.033641495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987993,0.00028748013,0.00014998871,0.00021993654,0.00042716193,0.00011598057],"domain_scores_gemma":[0.9988636,0.00042190962,0.000057146568,0.0004562977,0.00015426558,0.000046749126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011340912,0.0022019162,0.0013981009,0.0018332665,0.0008261143,0.0040699234,0.0030538696,0.0024785802,0.031895116],"category_scores_gemma":[0.0033991525,0.0014381806,0.0023632925,0.002711623,0.0015984938,0.004206682,0.0035255305,0.0033722124,0.01859673],"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.00017729033,0.00007989968,0.00025723028,0.0012788789,0.00006056158,0.00044935767,0.00087908545,0.012837107,0.01122311,0.5678318,0.05450799,0.35041773],"study_design_scores_gemma":[0.0000708161,0.000059267164,0.00020764642,0.0006155726,0.00009093184,0.0009515976,0.00010885275,0.083390996,0.011064235,0.32157683,0.5817691,0.00009412634],"about_ca_topic_score_codex":0.0018002308,"about_ca_topic_score_gemma":0.0023632161,"teacher_disagreement_score":0.031895116,"about_ca_system_score_codex":0.0009823574,"about_ca_system_score_gemma":0.00090702064,"threshold_uncertainty_score":0.106699824},"labels":[],"label_agreement":null},{"id":"W2972474670","doi":"10.1007/978-3-030-30473-7_25","title":"Fair Division with Subsidy","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Subsidy; Fair division; Computer science; Conjecture; Constructive; Set (abstract data type); Mathematical economics; Constructive proof; Division (mathematics); Microeconomics; Economics; Mathematics; Discrete mathematics; Arithmetic","score_opus":0.021127805267941606,"score_gpt":0.20484925860505374,"score_spread":0.18372145333711212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972474670","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.05016517,0.0010084234,0.38006917,0.005889151,0.0014329647,0.00025059283,0.00039290165,0.00052181876,0.5602698],"genre_scores_gemma":[0.7466863,0.00037595024,0.03401434,0.0011679133,0.0006883221,0.0002560073,0.00015057575,0.0001701549,0.2164905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729294,0.0006214911,0.000098107856,0.0007264415,0.000680588,0.0005804517],"domain_scores_gemma":[0.9975528,0.0009084219,0.00013239316,0.0008759801,0.00024237327,0.00028812885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481548,0.0006438878,0.0012430174,0.0010129884,0.0026537913,0.0040934645,0.0016633993,0.0026233406,0.0360893],"category_scores_gemma":[0.0091581615,0.00043149042,0.00096723787,0.0011999786,0.003635009,0.005590649,0.0035093066,0.0034722495,0.0039642015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037386708,0.000027112677,0.000058535858,0.000013860379,0.000006097848,0.000017984383,0.00004945953,0.0011846244,0.00020049306,0.98192686,0.004230704,0.012246759],"study_design_scores_gemma":[0.000018415529,0.0000093950375,0.000055029654,0.000006358879,0.0000035310231,0.000019089604,0.000011592363,0.004407199,0.00016684258,0.9901288,0.005170021,0.0000036064914],"about_ca_topic_score_codex":0.0013163873,"about_ca_topic_score_gemma":0.0016571168,"teacher_disagreement_score":0.0360893,"about_ca_system_score_codex":0.0020930076,"about_ca_system_score_gemma":0.0025040265,"threshold_uncertainty_score":0.12073076},"labels":[],"label_agreement":null},{"id":"W2972518024","doi":"10.1007/978-3-030-30786-8_20","title":"Maximum Matchings and Minimum Blocking Sets in $$\\varTheta _6$$ -Graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Collège Boréal; University of Waterloo","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Discrete mathematics; Equilateral triangle; Geometry","score_opus":0.012409481188551409,"score_gpt":0.23575382215726337,"score_spread":0.22334434096871197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972518024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18493019,0.0032910702,0.5207595,0.003590142,0.0005569843,0.00025315429,0.0025664805,0.0015068882,0.2825456],"genre_scores_gemma":[0.580296,0.0036751297,0.2960246,0.0009942653,0.00052615267,0.0005173443,0.0030509662,0.0011776143,0.113738015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.00012706271,0.000033233617,0.00018194437,0.00017384066,0.00013296971],"domain_scores_gemma":[0.9989065,0.00054729707,0.00013645855,0.00016085262,0.000139099,0.00010974533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050830864,0.0007133234,0.00091288204,0.0015784971,0.0018349828,0.0028382123,0.0017890426,0.001271353,0.015196026],"category_scores_gemma":[0.0024580245,0.0011874954,0.000967721,0.002503817,0.0013645173,0.0038919675,0.0015242224,0.0024800603,0.0023585057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014532727,0.00005460698,0.0002256024,0.00023704316,0.000024036846,0.00005811563,0.00022248975,0.007080022,0.0038085985,0.93989056,0.009694302,0.03855938],"study_design_scores_gemma":[0.00002585447,0.000020167881,0.00032054706,0.000057207355,0.000023209503,0.00012471173,0.00011226257,0.012972677,0.0021061292,0.9665318,0.01769273,0.000012722538],"about_ca_topic_score_codex":0.0016119013,"about_ca_topic_score_gemma":0.0026326454,"teacher_disagreement_score":0.015196026,"about_ca_system_score_codex":0.0016299076,"about_ca_system_score_gemma":0.00076556107,"threshold_uncertainty_score":0.05083579},"labels":[],"label_agreement":null},{"id":"W2972528742","doi":"10.1007/978-3-030-30484-3_21","title":"Learning Internal Dense But External Sparse Structures of Deep Convolutional Neural Network","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Convolutional neural network; Pruning; Artificial intelligence; Benchmark (surveying); Modularity (biology); Bridge (graph theory); Deep learning; Network structure; Pattern recognition (psychology); Machine learning","score_opus":0.01566753841014424,"score_gpt":0.249089511902544,"score_spread":0.23342197349239976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972528742","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.04039083,0.0005034618,0.95398384,0.00036871713,0.000092482136,0.000024518347,0.00022436082,0.0008255761,0.0035862245],"genre_scores_gemma":[0.655567,0.0009920407,0.3239853,0.00039233605,0.00021284043,0.00010620492,0.0017481142,0.00033887732,0.01665732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998621,0.000022743798,0.000007007857,0.000038411596,0.000042920557,0.000026836364],"domain_scores_gemma":[0.9994838,0.00020925047,0.00005380227,0.00011486752,0.00009205075,0.000046059515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043357175,0.0009193027,0.0005996362,0.0002759321,0.00021686907,0.00079299964,0.00100732,0.00095543836,0.0023396728],"category_scores_gemma":[0.002200646,0.0006614474,0.00045833673,0.0004448398,0.00064758834,0.0018839013,0.0015869915,0.0019844377,0.0007150413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017527072,0.000090398025,0.0014929328,0.00016953993,0.0000881208,0.000118348245,0.00009181719,0.57481205,0.022752246,0.062308613,0.008682242,0.3292184],"study_design_scores_gemma":[0.000004117944,0.00002316243,0.00012139256,0.00000800122,0.000006741931,0.00001577609,0.000004778853,0.97819006,0.001706004,0.019356195,0.0005594465,0.0000042070037],"about_ca_topic_score_codex":0.002446974,"about_ca_topic_score_gemma":0.0051613296,"teacher_disagreement_score":0.002446974,"about_ca_system_score_codex":0.0005200372,"about_ca_system_score_gemma":0.00065593823,"threshold_uncertainty_score":0.007826924},"labels":[],"label_agreement":null},{"id":"W2972684599","doi":"10.1007/978-3-030-29962-0_10","title":"SEPD: An Access Control Model for Resource Sharing in an IoT Environment","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Access control; Internet of Things; Metaphor; Architecture; Control (management); Computer security; Mathematical proof; Shared resource; Constraint (computer-aided design); World Wide Web; Artificial intelligence; Linguistics","score_opus":0.042114893470155006,"score_gpt":0.3112169441051396,"score_spread":0.2691020506349846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972684599","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.0035505127,0.00011679203,0.9900355,0.0002854312,0.00012268494,0.00009692229,0.00023983921,0.00086710934,0.004685292],"genre_scores_gemma":[0.47059378,0.0007413656,0.5000729,0.00055104645,0.00019561022,0.000780667,0.0012710654,0.0004048491,0.025388686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985846,0.00036616751,0.0001604448,0.00024222332,0.0005019374,0.00014455707],"domain_scores_gemma":[0.9988568,0.00041847577,0.00007881895,0.0003225837,0.00021254201,0.000110803696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020291517,0.00080938597,0.0008108025,0.0006097569,0.00077515456,0.0032059925,0.0021356703,0.0013804184,0.005767329],"category_scores_gemma":[0.003248084,0.0004728772,0.001085376,0.0007263027,0.0011329423,0.0040165833,0.002627382,0.0025898176,0.001317826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035989544,0.00023785184,0.0010800473,0.00033846902,0.000093466864,0.00039636286,0.00035708485,0.29200277,0.0063087856,0.5705066,0.0148226535,0.11349607],"study_design_scores_gemma":[0.000031217856,0.000055333683,0.000113445574,0.000028147848,0.000030554344,0.00014226454,0.00003972467,0.8798189,0.0018733396,0.100890964,0.016951848,0.000024221588],"about_ca_topic_score_codex":0.0027476756,"about_ca_topic_score_gemma":0.0028017594,"teacher_disagreement_score":0.005767329,"about_ca_system_score_codex":0.0011656199,"about_ca_system_score_gemma":0.0014613966,"threshold_uncertainty_score":0.019293606},"labels":[],"label_agreement":null},{"id":"W2972833528","doi":"10.1007/978-3-030-30446-1_13","title":"Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Heuristics; Computer science; Boolean satisfiability problem; Solver; Inference; Problem solver; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.013847354109660705,"score_gpt":0.24150034008730892,"score_spread":0.22765298597764821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972833528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012037232,0.00080879143,0.96436125,0.0009997217,0.00027294355,0.0001625381,0.0015182623,0.0064040823,0.013435239],"genre_scores_gemma":[0.15253593,0.00043164173,0.82928604,0.0009977102,0.00031851928,0.0002946403,0.006137205,0.0014169703,0.008581304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838126,0.00045552358,0.000112714304,0.0004948969,0.00042740154,0.0001282091],"domain_scores_gemma":[0.9950163,0.0026143189,0.00014724681,0.0014749818,0.00060921436,0.00013807818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016543863,0.0011410459,0.0015188277,0.001703667,0.0010218312,0.001809826,0.0037416413,0.0016017624,0.016523117],"category_scores_gemma":[0.012273697,0.00077292847,0.0021447784,0.0017652258,0.0011635693,0.0046978192,0.0032843486,0.0043154545,0.0051938654],"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.0003306222,0.00031264673,0.0026057323,0.0006610108,0.00016372278,0.00014399666,0.00023443799,0.08620818,0.0049907016,0.118063085,0.055810876,0.73047495],"study_design_scores_gemma":[0.000076856275,0.00012361893,0.0005616235,0.00014513967,0.00009267675,0.00016135283,0.00007532691,0.61065286,0.0032321112,0.36567575,0.019171814,0.000030847725],"about_ca_topic_score_codex":0.0039903237,"about_ca_topic_score_gemma":0.01337505,"teacher_disagreement_score":0.016523117,"about_ca_system_score_codex":0.0012328799,"about_ca_system_score_gemma":0.001866689,"threshold_uncertainty_score":0.05527538},"labels":[],"label_agreement":null},{"id":"W2972930299","doi":"10.1007/978-3-030-30690-8_12","title":"Union Models: Support for Efficient Reasoning About Model Families Over Space and Time","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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 Ottawa","funders":"","keywords":"Computer science; Space (punctuation); Artificial intelligence","score_opus":0.011933310051138978,"score_gpt":0.22983143766732306,"score_spread":0.21789812761618407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972930299","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.0031718258,0.00014643872,0.98473746,0.00020025899,0.00004216486,0.00007075352,0.000983022,0.008764731,0.0018833298],"genre_scores_gemma":[0.09987987,0.0005023856,0.8864599,0.00023435915,0.00011829166,0.00035183236,0.004760444,0.0032924998,0.0044004805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959757,0.0009268469,0.00046701363,0.0006007217,0.0017427988,0.000286962],"domain_scores_gemma":[0.99066,0.0057240124,0.0006208585,0.0019079094,0.0008094738,0.00027778334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038536077,0.0022839536,0.002103532,0.0025759279,0.0016915374,0.006418522,0.006093223,0.002347277,0.016874578],"category_scores_gemma":[0.017480444,0.003003799,0.005047756,0.0034971782,0.0019181552,0.02146915,0.0068830997,0.004801946,0.003998865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072251237,0.000261176,0.0020357163,0.0009874282,0.00028548008,0.00049424905,0.0011441311,0.05771217,0.0059360047,0.6518072,0.040660083,0.23795395],"study_design_scores_gemma":[0.00009587555,0.000048529062,0.00017463393,0.00015556485,0.00016907691,0.00021031058,0.00021064619,0.42993453,0.008204774,0.5285726,0.032152444,0.00007089424],"about_ca_topic_score_codex":0.004966782,"about_ca_topic_score_gemma":0.007361619,"teacher_disagreement_score":0.016874578,"about_ca_system_score_codex":0.0017951466,"about_ca_system_score_gemma":0.0020366411,"threshold_uncertainty_score":0.056451082},"labels":[],"label_agreement":null},{"id":"W2972941522","doi":"10.1007/978-3-030-30786-8_25","title":"Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Transpose; Control reconfiguration; Hamiltonian path; Hamiltonian (control theory); Computer science; Grid; Hamiltonian path problem; Lattice graph; Graph; Combinatorics; Topology (electrical circuits); Theoretical computer science; Mathematics; Mathematical optimization; Voltage graph; Geometry; Physics; Line graph; Quantum mechanics; Embedded system","score_opus":0.01717598004401504,"score_gpt":0.2314674842187603,"score_spread":0.21429150417474524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972941522","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.5306302,0.0005556229,0.43326595,0.00035682638,0.0001542103,0.000120730365,0.00024789845,0.0016053796,0.033063177],"genre_scores_gemma":[0.93083656,0.0002044163,0.06251102,0.00015081957,0.000014610487,0.0000661047,0.00015507883,0.00017494327,0.005886381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999001,0.00003051972,0.0000051075126,0.000023674673,0.000014269167,0.000026266798],"domain_scores_gemma":[0.9995844,0.0001583281,0.000057385416,0.000088573615,0.00004032458,0.000071053444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012571395,0.0003021104,0.00039344313,0.0003691412,0.000324902,0.0005520023,0.00090234523,0.00038302166,0.003836179],"category_scores_gemma":[0.000968129,0.0002780471,0.00026548558,0.0004713779,0.00045561025,0.0007136005,0.00091764086,0.00037722092,0.0005933204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006739162,0.00017809024,0.0014844746,0.0003555735,0.00007095935,0.0006595139,0.00046747277,0.5895341,0.07342916,0.083075605,0.008776504,0.24129461],"study_design_scores_gemma":[0.000085886495,0.0002130387,0.00048888585,0.000036314887,0.000020164513,0.00019673644,0.00023465679,0.89356065,0.010611133,0.08965052,0.0048728045,0.000029201656],"about_ca_topic_score_codex":0.0012918506,"about_ca_topic_score_gemma":0.0018989957,"teacher_disagreement_score":0.003836179,"about_ca_system_score_codex":0.00038298866,"about_ca_system_score_gemma":0.0002186995,"threshold_uncertainty_score":0.012833297},"labels":[],"label_agreement":null},{"id":"W2973214262","doi":"10.1007/978-3-030-30690-8_2","title":"Deriving Distributed Design Models from Global State Machines Requirements","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Notation; Computer science; Sequence diagram; Unified Modeling Language; Finite-state machine; Concurrency; Sequence (biology); State (computer science); Programming language; Distributed computing; Theoretical computer science; Software engineering; Software","score_opus":0.029755291444384532,"score_gpt":0.2537594126195897,"score_spread":0.22400412117520513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973214262","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.0075776703,0.00005397012,0.9845151,0.00012754866,0.000016003396,0.00012987791,0.00020115692,0.00092476694,0.0064538606],"genre_scores_gemma":[0.2893786,0.0004090323,0.69500333,0.0001838542,0.000034015153,0.00086260313,0.002059196,0.00106982,0.0109996265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822706,0.00048540716,0.00012496414,0.00018180996,0.00087656296,0.00010422362],"domain_scores_gemma":[0.99602544,0.0025245778,0.00021896022,0.00069625373,0.0004937536,0.00004112838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017056032,0.0011963272,0.0006965117,0.0012251723,0.00043526778,0.0017861223,0.0013682311,0.0011984302,0.0049562235],"category_scores_gemma":[0.0071100057,0.0012455087,0.001690783,0.00074423,0.0007404869,0.0023832517,0.0020039731,0.0021174478,0.0017412283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015746015,0.00023265799,0.0014475597,0.0009927583,0.0001114693,0.00095131586,0.001007254,0.41799802,0.025281621,0.3290298,0.0065745385,0.21621554],"study_design_scores_gemma":[0.000068033754,0.000094537245,0.0003645033,0.0001874832,0.00011310614,0.0002970789,0.00017264253,0.8126603,0.019118745,0.1391124,0.027784912,0.000026227795],"about_ca_topic_score_codex":0.0011445333,"about_ca_topic_score_gemma":0.0024583978,"teacher_disagreement_score":0.0049562235,"about_ca_system_score_codex":0.0009394067,"about_ca_system_score_gemma":0.0013949763,"threshold_uncertainty_score":0.016580164},"labels":[],"label_agreement":null},{"id":"W2973514284","doi":"10.1007/978-3-030-30048-7_24","title":"Training Binarized Neural Networks Using MIP and CP","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"The Scarborough Hospital; University of Toronto; Vector Institute","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"MNIST database; Computer science; Artificial neural network; Artificial intelligence; Constraint (computer-aided design); Set (abstract data type); Integer programming; Range (aeronautics); Machine learning; Class (philosophy); Deep neural networks; Gradient descent; Mathematical optimization; Algorithm; Mathematics","score_opus":0.0415761618633576,"score_gpt":0.27606272597426507,"score_spread":0.23448656411090746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973514284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02225436,0.0010501478,0.9656084,0.00020091406,0.00029671405,0.00010921091,0.00034070996,0.005759799,0.004379685],"genre_scores_gemma":[0.20234703,0.00063447416,0.781453,0.0004254725,0.00020096231,0.00038923448,0.001935575,0.00094761135,0.011666622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.000069377886,0.000031663432,0.00012237256,0.00008358098,0.000073706506],"domain_scores_gemma":[0.99891746,0.0005219106,0.000058808615,0.0001612559,0.00028953297,0.00005111218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093435973,0.0016217205,0.0012445345,0.0007852318,0.00047862154,0.0013594766,0.0019012077,0.0017547497,0.014284995],"category_scores_gemma":[0.003500831,0.0010285749,0.0009908202,0.0017427474,0.00042039464,0.0025982019,0.0017270608,0.0035632674,0.0038390649],"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.0003772688,0.00016686003,0.0005137569,0.0001524481,0.00013289446,0.00006565209,0.000034324014,0.23657475,0.009558018,0.0050645983,0.0072286897,0.7401307],"study_design_scores_gemma":[0.000015201915,0.000047412635,0.00016875817,0.000013978453,0.000022132264,0.0000184834,0.000009891773,0.993436,0.0035040032,0.0016570049,0.0011005045,0.0000067956566],"about_ca_topic_score_codex":0.009278554,"about_ca_topic_score_gemma":0.010971383,"teacher_disagreement_score":0.014284995,"about_ca_system_score_codex":0.0007171981,"about_ca_system_score_gemma":0.0013090539,"threshold_uncertainty_score":0.047788084},"labels":[],"label_agreement":null},{"id":"W2973912839","doi":"10.1007/978-3-030-31157-5_8","title":"Learning Communicating State Machines","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Finite-state machine; Conformance testing; Automaton; Modular design; Oracle; Component (thermodynamics); Theoretical computer science; Deterministic finite automaton; Equivalence (formal languages); Artificial intelligence; Algorithm; Programming language; Discrete mathematics; Mathematics","score_opus":0.011895957843734883,"score_gpt":0.25431404813083874,"score_spread":0.24241809028710387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973912839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014135313,0.0008444159,0.96390986,0.0007434564,0.00031496878,0.000047414196,0.00032980944,0.0022559653,0.017418856],"genre_scores_gemma":[0.62942487,0.0024165565,0.31153232,0.00057784247,0.0006529747,0.00038944674,0.0033497813,0.00062631915,0.05102992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.00011199236,0.000025930105,0.00015990126,0.000117187476,0.00003739751],"domain_scores_gemma":[0.9975988,0.0015782835,0.00009670929,0.0004893901,0.00018058665,0.000056216104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007221307,0.00068002724,0.0007740359,0.00070596987,0.00052054704,0.0015077126,0.0010268302,0.000986895,0.008998874],"category_scores_gemma":[0.005494241,0.00050397724,0.0006647111,0.00091961765,0.0009547786,0.0026391488,0.0015499766,0.00206646,0.002814957],"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.00014649435,0.000110898036,0.0014534261,0.00023643833,0.00009429206,0.00011205983,0.00021813026,0.17292975,0.004853124,0.319091,0.017128805,0.4836256],"study_design_scores_gemma":[0.000008881903,0.00002890535,0.00021418193,0.000029944336,0.00001829986,0.00005606538,0.000022538252,0.63157564,0.003245425,0.3566958,0.008090175,0.000014116244],"about_ca_topic_score_codex":0.0005041908,"about_ca_topic_score_gemma":0.0006285518,"teacher_disagreement_score":0.008998874,"about_ca_system_score_codex":0.0005121519,"about_ca_system_score_gemma":0.00050248514,"threshold_uncertainty_score":0.03010422},"labels":[],"label_agreement":null},{"id":"W2974424777","doi":"10.1007/978-3-030-41032-2_1","title":"First-Order System Least Squares Finite-Elements for Singularly Perturbed Reaction-Diffusion Equations","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Differential Equations and Numerical Methods","field":"Mathematics","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":"Memorial University of Newfoundland","funders":"","keywords":"Discretization; Polygon mesh; Finite element method; A priori and a posteriori; Piecewise; Robustness (evolution); Reaction–diffusion system; Norm (philosophy); Mathematics; Applied mathematics; Singular perturbation; Mathematical analysis; Geometry; Physics","score_opus":0.08132802258072322,"score_gpt":0.3540003999508329,"score_spread":0.27267237737010963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974424777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014268635,0.0001859839,0.98295605,0.00024765747,0.00008500683,0.00005039328,0.000089445304,0.0004041812,0.0017126746],"genre_scores_gemma":[0.47183326,0.00046726895,0.5098144,0.00021025378,0.000116793846,0.00062502275,0.0005395283,0.00074201595,0.015651453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944,0.00020383575,0.00003147655,0.00009233827,0.00018861023,0.00004375366],"domain_scores_gemma":[0.99732226,0.0017836854,0.00020023505,0.00017071422,0.00042627568,0.00009694812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011800465,0.0009312743,0.0018679883,0.0004230316,0.00073556724,0.0013589975,0.0016736933,0.0025156562,0.0028325296],"category_scores_gemma":[0.0059824223,0.0009956914,0.0008244617,0.00043839857,0.0013071276,0.0009758794,0.0015970917,0.0019614683,0.000800275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050832292,0.00004126453,0.00023383033,0.00007299515,0.000027158841,0.000030298312,0.00005794356,0.9829799,0.0022874295,0.0051261624,0.00040972765,0.008682396],"study_design_scores_gemma":[0.000002716561,0.0000036784174,0.000017022541,0.0000022809013,0.000001190515,0.000002844907,0.000004308708,0.9986594,0.00035470971,0.00079323637,0.00015618252,0.0000025371555],"about_ca_topic_score_codex":0.010173584,"about_ca_topic_score_gemma":0.0061239074,"teacher_disagreement_score":0.010173584,"about_ca_system_score_codex":0.0008115264,"about_ca_system_score_gemma":0.002227529,"threshold_uncertainty_score":0.020228744},"labels":[],"label_agreement":null},{"id":"W2975353799","doi":"10.1007/978-3-030-30625-0_5","title":"Online Voting in Ontario Municipal Elections: A Conflict of Legal Principles and Technology?","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Voting; Electronic voting; Computer science; Accountability; Public administration; Computer security; Public relations; Political science; Law","score_opus":0.02561937485816974,"score_gpt":0.2510249898191816,"score_spread":0.22540561496101186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975353799","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.3035789,0.0027912091,0.0035744756,0.041299563,0.00047740008,0.00010915303,0.0011538465,0.00007859112,0.64693683],"genre_scores_gemma":[0.934678,0.0008807436,0.00057692145,0.00060894876,0.00012702637,0.000024283392,0.00021585506,0.000032700194,0.06285556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99318695,0.001256522,0.00020542034,0.00033378738,0.0019902077,0.0030271008],"domain_scores_gemma":[0.9916203,0.002954774,0.0009958264,0.00066401757,0.0024094833,0.0013555773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051095635,0.00019416594,0.00039048248,0.0012777987,0.008783492,0.008083638,0.0018266365,0.0019524177,0.019043004],"category_scores_gemma":[0.026700063,0.0003782661,0.00040013154,0.0038000096,0.0044442997,0.003301638,0.00239169,0.0021845077,0.001284795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002797404,0.0001514441,0.10332446,0.0001866632,0.0000478836,0.00044627636,0.027298488,0.002390362,0.0004408996,0.6282152,0.1028053,0.13441329],"study_design_scores_gemma":[0.00010410198,0.00010231126,0.34739864,0.00052942673,0.0001254491,0.00029728014,0.07396117,0.0065246886,0.001209443,0.08810366,0.48150668,0.0001371317],"about_ca_topic_score_codex":0.9483899,"about_ca_topic_score_gemma":0.9879538,"teacher_disagreement_score":0.051610112,"about_ca_system_score_codex":0.048861034,"about_ca_system_score_gemma":0.06961948,"threshold_uncertainty_score":0.3545133},"labels":[],"label_agreement":null},{"id":"W2975860475","doi":"10.1007/978-3-030-30625-0_4","title":"Online Voting in a First Nation in Canada: Implications for Participation and Governance","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","cited_by":9,"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; Brock University; University of Guelph","funders":"","keywords":"Voting; Indigenous; Government (linguistics); Corporate governance; Public relations; Electronic voting; Citizen journalism; Political science; Computer science; Public administration; Business; World Wide Web; Politics; Law","score_opus":0.04772043343246623,"score_gpt":0.31208389163361955,"score_spread":0.2643634582011533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975860475","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.86977524,0.0013082253,0.00056032545,0.02077828,0.00016074229,0.00009979545,0.0010791429,0.00003862549,0.10619964],"genre_scores_gemma":[0.9678675,0.0003164261,0.00021959831,0.00055823213,0.000016116775,0.000016288832,0.00021305014,0.000014812408,0.030778034],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99664164,0.00033494938,0.00004098728,0.00019801347,0.00041181428,0.0023726712],"domain_scores_gemma":[0.99544877,0.0006725032,0.00024947012,0.00008995573,0.0013025394,0.0022368936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014994501,0.00020622261,0.0005469572,0.0014382224,0.019057993,0.007983473,0.0021065369,0.0016350012,0.012814547],"category_scores_gemma":[0.0049201427,0.00020067095,0.000445987,0.004067477,0.0034963423,0.0017621339,0.002372009,0.0026833836,0.0005906232],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048818783,0.0006688301,0.38101837,0.00019588906,0.00009066084,0.0017609808,0.13526553,0.0029246581,0.000659745,0.24169275,0.098618776,0.13661559],"study_design_scores_gemma":[0.00007779744,0.000093136565,0.47731474,0.0003205607,0.00007634641,0.00020229277,0.3566527,0.0042496044,0.00053900917,0.012292445,0.1480598,0.000121600715],"about_ca_topic_score_codex":0.9965166,"about_ca_topic_score_gemma":0.9988213,"teacher_disagreement_score":0.08206589,"about_ca_system_score_codex":0.08206589,"about_ca_system_score_gemma":0.14291805,"threshold_uncertainty_score":0.5954325},"labels":[],"label_agreement":null},{"id":"W2977000626","doi":"10.1007/978-3-030-32236-6_76","title":"Overview of the NLPCC 2019 Shared Task: Open Domain Conversation Evaluation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Blackberry (Canada)","funders":"","keywords":"Computer science; Conversation; Task (project management); Domain (mathematical analysis); Open domain; Human–computer interaction; Artificial intelligence; Programming language; Systems engineering; Linguistics; Question answering","score_opus":0.036854881994546826,"score_gpt":0.3154158096821468,"score_spread":0.27856092768759994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977000626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055029467,0.023455689,0.44084865,0.00781,0.0041212365,0.015277604,0.16401887,0.14338943,0.14604913],"genre_scores_gemma":[0.11995817,0.002889913,0.36474493,0.0020467057,0.0009644299,0.012754993,0.43101677,0.011992553,0.053631537],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9789256,0.010675551,0.001185029,0.0030765529,0.0047947685,0.0013425668],"domain_scores_gemma":[0.98716134,0.0040187235,0.0002493007,0.002453623,0.0044854875,0.0016316416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015910087,0.0040709903,0.0032674617,0.005317968,0.004506465,0.0064127045,0.006164842,0.0041733487,0.035274576],"category_scores_gemma":[0.024428172,0.0015256657,0.0017894334,0.0042436863,0.001467778,0.0076192017,0.012245681,0.0058536557,0.042114053],"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.0015275907,0.0013998556,0.00170042,0.0023446567,0.00032913729,0.0002029049,0.0010679085,0.0064876773,0.01472502,0.0054756515,0.47276142,0.49197778],"study_design_scores_gemma":[0.0011882359,0.0016566771,0.009428459,0.0009754109,0.00036798546,0.0009873856,0.0024104728,0.16538753,0.049823042,0.02905546,0.7380636,0.00065570266],"about_ca_topic_score_codex":0.02888783,"about_ca_topic_score_gemma":0.032098375,"teacher_disagreement_score":0.035274576,"about_ca_system_score_codex":0.003968615,"about_ca_system_score_gemma":0.007813534,"threshold_uncertainty_score":0.11800516},"labels":[],"label_agreement":null},{"id":"W2977620183","doi":"10.1007/978-3-030-30949-7_14","title":"Automating the Integration of 4D Models in Game Engines for a Virtual Reality-Based Construction Simulation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Workflow; Schedule; Process (computing); Constructability; Software engineering; Game engine; Virtual reality; Software; Work (physics); Human–computer interaction; Systems engineering; Database","score_opus":0.022622889016887245,"score_gpt":0.24836560073700165,"score_spread":0.2257427117201144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977620183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04861854,0.000098260396,0.932167,0.00006149488,0.00006498035,0.00023207882,0.00027746413,0.010426446,0.008053729],"genre_scores_gemma":[0.37817684,0.00022886824,0.60604054,0.000076286975,0.000010596051,0.0002752904,0.0013391674,0.0020611526,0.011791304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993305,0.00007930204,0.000043312433,0.000112444766,0.0003576254,0.00007680802],"domain_scores_gemma":[0.9996238,0.00014014193,0.000023961788,0.00009552503,0.00008856909,0.000028050606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005238416,0.001498047,0.0010634952,0.0009197749,0.0004239284,0.0017365434,0.002079837,0.0010015855,0.01050388],"category_scores_gemma":[0.0014845647,0.0014721538,0.001435714,0.00056682277,0.0004166708,0.0011488638,0.003069179,0.00083937636,0.0034801501],"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.0006484591,0.00069965335,0.0038292948,0.00052834215,0.00022295908,0.00074685755,0.0013351953,0.35513875,0.1322596,0.016832523,0.008252929,0.47950536],"study_design_scores_gemma":[0.00003236652,0.000095286116,0.0010543969,0.000044410564,0.00006474245,0.00019264265,0.00012504273,0.92638534,0.052508794,0.0028097269,0.01663483,0.000052450992],"about_ca_topic_score_codex":0.005624835,"about_ca_topic_score_gemma":0.006119787,"teacher_disagreement_score":0.01050388,"about_ca_system_score_codex":0.00055810827,"about_ca_system_score_gemma":0.0007975484,"threshold_uncertainty_score":0.035139024},"labels":[],"label_agreement":null},{"id":"W2977878187","doi":"10.1007/978-3-030-23807-0_27","title":"Intrinsically Motivated Autonomy in Human-Robot Interaction: Human Perception of Predictive Information in Robots","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robot; Perception; Human–computer interaction; Human–robot interaction; Autonomy; Baseline (sea); USable; Artificial intelligence; Competence (human resources); Psychology; Social psychology","score_opus":0.015830707686866598,"score_gpt":0.26033507202411815,"score_spread":0.24450436433725156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977878187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10091023,0.03523254,0.78697264,0.0031639333,0.00064006436,0.000028733031,0.000113209324,0.0005490866,0.072389595],"genre_scores_gemma":[0.9331014,0.006966018,0.046249717,0.00017544303,0.00022430305,0.000040235424,0.00008657754,0.00008668908,0.01306962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998859,0.000039029514,0.0000031777179,0.000028461161,0.000032738044,0.00001055008],"domain_scores_gemma":[0.9996933,0.0002165883,0.000022645925,0.000028258208,0.0000218842,0.00001733185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023071209,0.00025457086,0.00027988444,0.00012095755,0.0001642506,0.0011111705,0.00050600397,0.0007006043,0.0021582947],"category_scores_gemma":[0.0009275422,0.00019544069,0.00025412708,0.0002809327,0.0011167763,0.0014005863,0.00057588046,0.0009642719,0.00031000166],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020649559,0.00013538773,0.0009502892,0.00056906074,0.00008419301,0.00031695556,0.001326703,0.11809157,0.036201168,0.56052774,0.014363627,0.26722687],"study_design_scores_gemma":[0.000016940354,0.00011459887,0.0024068423,0.00008067945,0.000022372402,0.00025520584,0.0002548579,0.3039293,0.008211258,0.6632134,0.021440072,0.000054525255],"about_ca_topic_score_codex":0.00047673125,"about_ca_topic_score_gemma":0.0004234322,"teacher_disagreement_score":0.0021582947,"about_ca_system_score_codex":0.0003059282,"about_ca_system_score_gemma":0.0002354324,"threshold_uncertainty_score":0.0072202086},"labels":[],"label_agreement":null},{"id":"W2977953926","doi":"10.1007/978-3-030-32079-9_7","title":"Accelerated Learning of Predictive Runtime Monitors for Rare Failure","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Event (particle physics); Inference; Markov chain; Exploit; Rare events; Sample (material); Sampling (signal processing); Construct (python library); Importance sampling; Artificial intelligence; Machine learning; Data mining; Programming language; Statistics; Mathematics; Monte Carlo method","score_opus":0.01997430481071661,"score_gpt":0.2742073740594166,"score_spread":0.2542330692487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977953926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07222692,0.0010680478,0.91959924,0.00032485457,0.00013327668,0.000059916936,0.00015915756,0.004690264,0.0017383344],"genre_scores_gemma":[0.82871425,0.00036440857,0.16579416,0.00015480336,0.000200923,0.00014429024,0.0004340013,0.00030265813,0.0038904815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929774,0.00017303255,0.00003222941,0.00020825064,0.00017344988,0.00011519672],"domain_scores_gemma":[0.9946456,0.0037258053,0.00034412582,0.0005929245,0.00049677,0.00019482199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154252,0.0009180261,0.0014250062,0.00066349877,0.00034003216,0.00092067715,0.0024221865,0.00089686323,0.0035283123],"category_scores_gemma":[0.010119964,0.00052298245,0.0005707254,0.0005140003,0.0005670654,0.0014172642,0.0015118876,0.0022251816,0.0006900573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008457031,0.00023278517,0.004273807,0.00015635822,0.0000732593,0.000116682815,0.00010460348,0.55721164,0.004717554,0.010727349,0.0054883286,0.41605192],"study_design_scores_gemma":[0.000008897588,0.000026546775,0.00011070729,0.0000043790883,0.0000061344217,0.0000130264625,0.0000027995873,0.99669325,0.0004641217,0.0025490108,0.00011880285,0.0000022793347],"about_ca_topic_score_codex":0.0030915488,"about_ca_topic_score_gemma":0.0049267425,"teacher_disagreement_score":0.0035283123,"about_ca_system_score_codex":0.0006637448,"about_ca_system_score_gemma":0.0016881058,"threshold_uncertainty_score":0.011803448},"labels":[],"label_agreement":null},{"id":"W2978270781","doi":"10.1007/978-3-030-30949-7_16","title":"Implementing Mobile Technology on Construction Sites: An Ethnographic Action Research Approach","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Action (physics); Work (physics); Ethnography; Action research; Knowledge management; Building information modeling; Preference; Information technology; Engineering management; Process management; Business; Management; Operations management; Engineering; Sociology","score_opus":0.04531371501625905,"score_gpt":0.3089224841253742,"score_spread":0.2636087691091152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978270781","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.9086455,0.00042486197,0.051985577,0.0006882144,0.00004323936,0.0030951535,0.00035744294,0.00009410252,0.034665946],"genre_scores_gemma":[0.94129646,0.0005999153,0.049414396,0.00019609151,0.000010503037,0.002136449,0.00013054106,0.00006262449,0.0061530205],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9832683,0.013299305,0.000452056,0.0009077719,0.0010906089,0.0009819445],"domain_scores_gemma":[0.97829425,0.018285802,0.0007097706,0.0011437389,0.0011872536,0.00037926665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013223289,0.0012666791,0.0007216735,0.0032255522,0.0069184215,0.00525932,0.0024251265,0.0025466671,0.004511454],"category_scores_gemma":[0.01583017,0.0010588398,0.00056701404,0.0036382645,0.00647429,0.0052683363,0.0056882934,0.0023401615,0.0005812232],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018422226,0.001415001,0.01273182,0.0011876957,0.000038675524,0.0011988382,0.86653084,0.001779444,0.008025521,0.012827041,0.0012089734,0.09287197],"study_design_scores_gemma":[0.00008523291,0.0012401646,0.010952178,0.0010644516,0.0000866322,0.0006206532,0.9533999,0.0024341748,0.0071195243,0.004074583,0.018838573,0.00008399003],"about_ca_topic_score_codex":0.0051064347,"about_ca_topic_score_gemma":0.015040855,"teacher_disagreement_score":0.013223289,"about_ca_system_score_codex":0.0034916026,"about_ca_system_score_gemma":0.004386668,"threshold_uncertainty_score":0.06993228},"labels":[],"label_agreement":null},{"id":"W2978395098","doi":"10.1007/978-3-030-32079-9_15","title":"Monitorability over Unreliable Channels","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Automaton; Channel (broadcasting); Ideal (ethics); Mutation; Runtime verification; Distributed computing; Theoretical computer science; Real-time computing; Formal verification; Computer network","score_opus":0.02184297008769451,"score_gpt":0.2504115772564393,"score_spread":0.2285686071687448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978395098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10987182,0.0029269936,0.81432194,0.0019124084,0.00047101313,0.00007815274,0.00028784547,0.0016382824,0.06849154],"genre_scores_gemma":[0.9441864,0.0018947332,0.029687693,0.00019485842,0.00048980396,0.00011591116,0.00016085031,0.0002891991,0.0229805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989759,0.00019809602,0.00006772079,0.00023383212,0.00036884073,0.00015562028],"domain_scores_gemma":[0.9952651,0.0026451817,0.00043276267,0.0011182582,0.00037064162,0.00016792156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000962527,0.0005213989,0.0005970621,0.00056846946,0.0006912582,0.0018955058,0.0008347259,0.0006530222,0.004021865],"category_scores_gemma":[0.0050235614,0.0004108701,0.00046319063,0.0007352736,0.0016804152,0.0047850357,0.0019426239,0.0026197934,0.00049780076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026129073,0.00003212066,0.00047783734,0.00015661029,0.000025658597,0.00025282596,0.0003451917,0.020533713,0.008755628,0.9138014,0.0039418107,0.051415835],"study_design_scores_gemma":[0.000029910037,0.00005909353,0.00034630718,0.0000420489,0.000037319758,0.00022283234,0.000049264712,0.07314899,0.007298842,0.90720814,0.011537954,0.000019411542],"about_ca_topic_score_codex":0.00065062585,"about_ca_topic_score_gemma":0.0004176276,"teacher_disagreement_score":0.004021865,"about_ca_system_score_codex":0.00078155263,"about_ca_system_score_gemma":0.00065725984,"threshold_uncertainty_score":0.013454437},"labels":[],"label_agreement":null},{"id":"W2978723903","doi":"10.1007/978-3-319-91908-9_3","title":"Computing in Combinatorial Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorial optimization; Subject (documents); Linear programming; Development (topology); Work (physics); Optimization problem; Theoretical computer science; Operations research; Algorithm; Mathematics; World Wide Web","score_opus":0.011562044705810645,"score_gpt":0.2257654991211383,"score_spread":0.21420345441532765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978723903","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036892844,0.15123744,0.19193277,0.019741494,0.0060297926,0.00012315343,0.00049866317,0.00075541844,0.625992],"genre_scores_gemma":[0.16477263,0.20401694,0.26449803,0.009362388,0.013846773,0.00074290903,0.001820136,0.0016931099,0.33924714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994728,0.00017476437,0.000022101884,0.00010117017,0.00019034572,0.000038718237],"domain_scores_gemma":[0.99910295,0.0005695135,0.00002303395,0.00015970062,0.00009480882,0.000050049053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751672,0.0011595698,0.0008452426,0.0013827421,0.0009897801,0.004340698,0.000906555,0.0009276104,0.014317206],"category_scores_gemma":[0.0018965472,0.00044473293,0.0006124936,0.003756604,0.0027651584,0.003881011,0.0013853579,0.003738232,0.005257719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010474375,0.000019800964,0.000076599834,0.0002404816,0.000015773898,0.000023780563,0.000102106285,0.0029384478,0.00024503976,0.84467494,0.08048767,0.071164906],"study_design_scores_gemma":[0.0000057734205,0.000011054463,0.00014444113,0.00021206116,0.000006035181,0.000076953474,0.00003636925,0.005259187,0.00020564438,0.6415482,0.35248375,0.0000105294275],"about_ca_topic_score_codex":0.0013050168,"about_ca_topic_score_gemma":0.0015218178,"teacher_disagreement_score":0.014317206,"about_ca_system_score_codex":0.0022275608,"about_ca_system_score_gemma":0.0011798958,"threshold_uncertainty_score":0.04789585},"labels":[],"label_agreement":null},{"id":"W2978794977","doi":"10.1007/978-3-031-43587-4_19","title":"On Computing a Center Persistence Diagram","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Center (category theory); Bottleneck; Combinatorics; Reduction (mathematics); Diagram; Metric (unit); Matching (statistics); Focus (optics); Mathematics; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.03319845772222746,"score_gpt":0.25307329038396226,"score_spread":0.2198748326617348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978794977","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.11288757,0.0008052016,0.77732086,0.0010401905,0.0004423036,0.00017748188,0.0009487449,0.0049708756,0.10140678],"genre_scores_gemma":[0.66951394,0.0007701865,0.2826716,0.0005181386,0.00031854372,0.00021167287,0.0024916995,0.0020406998,0.041463546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.00008246014,0.000034983714,0.00018316193,0.00017832806,0.00013602733],"domain_scores_gemma":[0.9985567,0.00059383,0.0000651651,0.00040798858,0.00024998683,0.00012644648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801655,0.0006857707,0.001081619,0.0021717264,0.0019087183,0.0040423586,0.0016800442,0.00092865154,0.025144186],"category_scores_gemma":[0.0030595877,0.00047843956,0.0008148999,0.0030836484,0.0016180127,0.0093429815,0.004270091,0.0017684991,0.0043672724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013303067,0.000045653254,0.00063895044,0.00011799448,0.000012626761,0.00005926559,0.00040695892,0.002969748,0.002174863,0.884082,0.010731043,0.09862786],"study_design_scores_gemma":[0.000015839694,0.000018895109,0.00014145488,0.00003510686,0.000018226301,0.00005899619,0.0001767333,0.012838587,0.0021570446,0.9646286,0.019897783,0.000012713019],"about_ca_topic_score_codex":0.0018399425,"about_ca_topic_score_gemma":0.0020516044,"teacher_disagreement_score":0.025144186,"about_ca_system_score_codex":0.0012753506,"about_ca_system_score_gemma":0.00068459794,"threshold_uncertainty_score":0.084115684},"labels":[],"label_agreement":null},{"id":"W2979250315","doi":"10.1007/978-3-030-35869-3_6","title":"Related-Key Differential Cryptanalysis of Full Round CRAFT","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Key (lock); Oracle; Differential (mechanical device); Encryption; Impossible differential cryptanalysis; Key schedule; Advanced Encryption Standard; Craft; Cryptanalysis; Computer security; Theoretical computer science; Arithmetic; Differential cryptanalysis; Mathematics; Programming language; Engineering","score_opus":0.014915551474093906,"score_gpt":0.27727404712420367,"score_spread":0.26235849565010977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979250315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43904826,0.0016594734,0.49401733,0.0019190517,0.00047769072,0.00020438926,0.00048789755,0.0012827233,0.06090323],"genre_scores_gemma":[0.95197517,0.00033335423,0.030810079,0.0002126824,0.0001108698,0.000031207674,0.00013881423,0.00008733822,0.01630052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983846,0.0002998421,0.000063280226,0.00023633009,0.0006474388,0.00036844966],"domain_scores_gemma":[0.9989134,0.0003830747,0.0000852503,0.0004443026,0.00011701555,0.000056918747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009707545,0.00082713837,0.00076486904,0.0010596365,0.00071938935,0.002027399,0.0009453551,0.0011522482,0.009773146],"category_scores_gemma":[0.0031753802,0.0003770566,0.0007259045,0.0011878823,0.0015610103,0.0029786981,0.0021189544,0.0015734807,0.0016980901],"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.0017272519,0.0001877991,0.002075224,0.00028954106,0.00012604028,0.00076724804,0.000444579,0.029847153,0.032477956,0.7887536,0.0048738634,0.13842964],"study_design_scores_gemma":[0.00019031178,0.00036926166,0.0017291775,0.00010961545,0.0001299622,0.0021284407,0.00016068463,0.18527324,0.0713338,0.7199489,0.018503018,0.00012356808],"about_ca_topic_score_codex":0.00039610348,"about_ca_topic_score_gemma":0.0004850541,"teacher_disagreement_score":0.009773146,"about_ca_system_score_codex":0.0013007165,"about_ca_system_score_gemma":0.0010651007,"threshold_uncertainty_score":0.0326944},"labels":[],"label_agreement":null},{"id":"W2979328813","doi":"10.1007/978-3-030-32239-7_2","title":"A Deep Reinforcement Learning Framework for Frame-by-Frame Plaque Tracking on Intravascular Optical Coherence Tomography Image","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical Coherence Tomography Applications","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Optical coherence tomography; Frame (networking); Artificial intelligence; Computer vision; Tracking (education); Speckle noise; Reinforcement learning; Speckle pattern; Radiology; Medicine","score_opus":0.009626067398593945,"score_gpt":0.23522293444247389,"score_spread":0.22559686704387993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979328813","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.00547767,0.00030942904,0.9928249,0.00011770862,0.00004980134,0.000024965715,0.000043426357,0.000497426,0.0006546497],"genre_scores_gemma":[0.48785973,0.0007078747,0.5011164,0.00037805145,0.00018632192,0.00023710403,0.0003451214,0.00022930691,0.008940153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997495,0.000058460188,0.000011230277,0.00007538526,0.000059531798,0.00004582143],"domain_scores_gemma":[0.99958533,0.00019721978,0.000036742535,0.00003064533,0.000107643435,0.00004253661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009490539,0.00071488315,0.001313024,0.00036316138,0.00030836836,0.00073106465,0.0017841095,0.0016157303,0.0025361835],"category_scores_gemma":[0.0013680272,0.00048851955,0.0006324777,0.00043462243,0.00047731344,0.00055314467,0.0012552106,0.0015000477,0.0006744122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001662572,0.000094350464,0.00042160728,0.00006779594,0.000059814363,0.000095045325,0.000048512145,0.72297376,0.0067484668,0.007023823,0.004004398,0.25829625],"study_design_scores_gemma":[0.0000027308472,0.000009020854,0.000024111794,0.000001953153,0.0000025402423,0.000006268194,8.003586e-7,0.99894696,0.00023916364,0.00063518214,0.00012943774,0.0000018334076],"about_ca_topic_score_codex":0.012198861,"about_ca_topic_score_gemma":0.010384354,"teacher_disagreement_score":0.012198861,"about_ca_system_score_codex":0.00085586886,"about_ca_system_score_gemma":0.0011757464,"threshold_uncertainty_score":0.024255693},"labels":[],"label_agreement":null},{"id":"W2979332613","doi":"10.1007/978-3-030-32692-0_61","title":"Renal Cell Carcinoma Staging with Learnable Image Histogram-Based Deep Neural Network","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Histogram; Renal cell carcinoma; Image (mathematics); Pattern recognition (psychology); Pathology; Medicine","score_opus":0.0073384954432499615,"score_gpt":0.22901550894328337,"score_spread":0.2216770135000334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979332613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06504794,0.002717137,0.9192186,0.00063409196,0.00031959158,0.00010432731,0.0011573521,0.0027924962,0.008008408],"genre_scores_gemma":[0.7358829,0.0017226533,0.23832451,0.00043952776,0.00022587224,0.00014535864,0.0024547947,0.0002538983,0.020550432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999138,0.0000067809306,0.0000051118022,0.0000276058,0.000028242968,0.000018435047],"domain_scores_gemma":[0.99991477,0.000021499765,0.000008588568,0.000010728065,0.000035139554,0.00000923399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019451226,0.00039713513,0.00043099874,0.00044310564,0.00013574466,0.00045312528,0.00081609783,0.00043976223,0.0025553398],"category_scores_gemma":[0.00038654436,0.00023290214,0.00046533212,0.00037287065,0.00012247413,0.0005870227,0.0006237702,0.00060584093,0.0007128164],"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.00012550206,0.000114669514,0.002904056,0.000103493854,0.000077016964,0.00009711505,0.000027150167,0.1453513,0.013003812,0.0029964438,0.011285313,0.8239142],"study_design_scores_gemma":[0.0000060971984,0.000033775344,0.0007875923,0.0000123553145,0.000020290665,0.000070410446,0.0000065582544,0.9912965,0.0040482343,0.0022902752,0.0014171336,0.000010644782],"about_ca_topic_score_codex":0.007375793,"about_ca_topic_score_gemma":0.015629293,"teacher_disagreement_score":0.007375793,"about_ca_system_score_codex":0.00038040784,"about_ca_system_score_gemma":0.0005219168,"threshold_uncertainty_score":0.014665723},"labels":[],"label_agreement":null},{"id":"W2979344318","doi":"10.1007/978-3-030-31280-0_7","title":"Multiple Mutation Testing for Timed Finite State Machine with Timed Guards and Timeouts","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Université du Québec à Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Finite-state machine; Process (computing); State (computer science); Test suite; Fault (geology); Mutation; Domain (mathematical analysis); Enumeration; Theoretical computer science; Fault injection; Model checking; Algorithm; Test case; Programming language; Software; Mathematics; Machine learning","score_opus":0.01965444124293541,"score_gpt":0.245311961391384,"score_spread":0.2256575201484486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979344318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06419433,0.0003120743,0.92888147,0.00021964959,0.0001717744,0.00006258258,0.00008203371,0.002526405,0.0035496654],"genre_scores_gemma":[0.7874867,0.00014612179,0.20838954,0.00010157213,0.000048460057,0.00007698168,0.0001374225,0.0003136831,0.0032995539],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997456,0.0005424306,0.00014561016,0.00063153554,0.00093683583,0.0002875135],"domain_scores_gemma":[0.9926898,0.005623031,0.000406128,0.0005595914,0.0005207342,0.00020071019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015298831,0.0010284152,0.0011251013,0.0010087572,0.00052311283,0.0010555243,0.001942707,0.0011265943,0.00227868],"category_scores_gemma":[0.006114334,0.00044065455,0.0013716565,0.0006928371,0.0019844822,0.0020577132,0.0013266078,0.0016140951,0.00026658026],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013600222,0.00039253396,0.0040248465,0.00072310393,0.00021697732,0.0036578104,0.00064244773,0.26050052,0.10349157,0.2934264,0.0043406948,0.32722306],"study_design_scores_gemma":[0.00010134463,0.00029486202,0.00043279625,0.000068816254,0.00009221313,0.00084423454,0.000057257148,0.7639062,0.051718734,0.17962949,0.0028045427,0.000049585018],"about_ca_topic_score_codex":0.0015111472,"about_ca_topic_score_gemma":0.0014684881,"teacher_disagreement_score":0.00227868,"about_ca_system_score_codex":0.0010972165,"about_ca_system_score_gemma":0.0012997251,"threshold_uncertainty_score":0.008090913},"labels":[],"label_agreement":null},{"id":"W2979373743","doi":"10.1007/978-3-030-32251-9_63","title":"Unsupervised Clustering of Quantitative Imaging Phenotypes Using Autoencoder and Gaussian Mixture Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Sunnybrook Hospital; University of Toronto","funders":"","keywords":"Overfitting; Autoencoder; Computer science; Cluster analysis; Artificial intelligence; Pipeline (software); Pattern recognition (psychology); Mixture model; Machine learning; Medical imaging; Probabilistic logic; Unsupervised learning; Deep learning; Artificial neural network","score_opus":0.020617912216807945,"score_gpt":0.2942916779446181,"score_spread":0.27367376572781016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979373743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013193573,0.00018233863,0.98551744,0.00003717287,0.000012402383,0.000029299004,0.00011518765,0.00041473488,0.00049789646],"genre_scores_gemma":[0.20979396,0.00037796644,0.7854592,0.00004480856,0.000024918727,0.00011822551,0.00095107517,0.00029989934,0.0029299618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966,0.00007415321,0.000019756199,0.00013358275,0.00007780207,0.000034604167],"domain_scores_gemma":[0.9995104,0.00018158334,0.00006033244,0.00008521701,0.00014328565,0.0000191236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006654984,0.0006061601,0.0008822331,0.0011978716,0.00028901314,0.0010948104,0.0009645803,0.00063035754,0.0007588852],"category_scores_gemma":[0.0013006285,0.00043105672,0.0012115627,0.0011440901,0.00048190527,0.00058946974,0.00070797384,0.000755568,0.00061307766],"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.00017156872,0.0001529564,0.0040300745,0.00022650507,0.00021429165,0.0002068628,0.00031946631,0.32050687,0.08159832,0.0144139575,0.0031605351,0.5749986],"study_design_scores_gemma":[0.0000034500913,0.000018438315,0.002640565,0.000014480352,0.00002396236,0.00013821472,0.000034453224,0.9808617,0.0072228457,0.008025947,0.0009953957,0.000020478608],"about_ca_topic_score_codex":0.0031738034,"about_ca_topic_score_gemma":0.004164276,"teacher_disagreement_score":0.0031738034,"about_ca_system_score_codex":0.0006772704,"about_ca_system_score_gemma":0.0004914826,"threshold_uncertainty_score":0.0063106418},"labels":[],"label_agreement":null},{"id":"W2979387342","doi":"10.1007/978-3-030-64381-2_4","title":"Quantum Encryption with Certified Deletion","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Plaintext; Encryption; Ciphertext; Quantum; Quantum cryptography; String (physics); Cryptography; Quantum computer","score_opus":0.015861750209509886,"score_gpt":0.22296787470290835,"score_spread":0.20710612449339846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979387342","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.042294733,0.0024755897,0.62142503,0.006487858,0.001799205,0.00042615941,0.0010098305,0.0018743704,0.32220718],"genre_scores_gemma":[0.6979405,0.0023645125,0.11302469,0.0015727242,0.0007357084,0.00037188412,0.0010529666,0.0006868875,0.18225016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845636,0.00035095334,0.00008430719,0.00021705497,0.00064271776,0.00024856918],"domain_scores_gemma":[0.9986822,0.00042442465,0.00006707859,0.0006422981,0.000136099,0.000047945352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997007,0.00069348013,0.0009185029,0.0006794157,0.0013178161,0.0026944408,0.0010888271,0.0013418947,0.0147703],"category_scores_gemma":[0.0027782181,0.000457438,0.0007854717,0.0011908313,0.0023216633,0.005391628,0.0028124258,0.0032497407,0.005171834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092613314,0.00003503244,0.000058148267,0.00008514317,0.000008222926,0.000087035274,0.00007725796,0.0027913179,0.0025358694,0.95239514,0.0083667245,0.033467397],"study_design_scores_gemma":[0.00004328899,0.00004949334,0.00010098585,0.00005239227,0.000016326649,0.0005060756,0.000045817484,0.015702453,0.009308073,0.9366694,0.037473965,0.00003184189],"about_ca_topic_score_codex":0.00023821418,"about_ca_topic_score_gemma":0.00021706684,"teacher_disagreement_score":0.0147703,"about_ca_system_score_codex":0.0012711236,"about_ca_system_score_gemma":0.0014506266,"threshold_uncertainty_score":0.049411595},"labels":[],"label_agreement":null},{"id":"W2979395070","doi":"10.1007/978-3-030-30985-5_14","title":"Detecting Feature Interactions in FORML Models","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology)","score_opus":0.04985317742482134,"score_gpt":0.29901233917154313,"score_spread":0.24915916174672179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979395070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1279929,0.00026166116,0.84346426,0.0003663224,0.00006212586,0.0002877845,0.0015595942,0.016218305,0.009786991],"genre_scores_gemma":[0.7244118,0.00018505346,0.26112244,0.00018902769,0.00003850621,0.00020482202,0.003733314,0.0029693353,0.007145716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970655,0.00047242455,0.00012335453,0.0004028477,0.0016310067,0.00030485267],"domain_scores_gemma":[0.99452716,0.002952002,0.0007219196,0.00095390447,0.0007031672,0.00014189021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795744,0.0011579148,0.00079776923,0.0021560222,0.0008151212,0.0026267574,0.0015772458,0.0018593558,0.0060820407],"category_scores_gemma":[0.009225143,0.0010195649,0.0017665614,0.0012288024,0.00089527393,0.004603153,0.002963374,0.001428862,0.0020239863],"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.0014144691,0.0005592304,0.049107436,0.0009291163,0.00029816318,0.0035133772,0.00232031,0.19093655,0.061111975,0.090664886,0.024345947,0.57479846],"study_design_scores_gemma":[0.000039487088,0.00015166774,0.0025988475,0.000074815376,0.000100690544,0.000510599,0.00036454486,0.918015,0.025445882,0.036769543,0.015883923,0.000045024422],"about_ca_topic_score_codex":0.0057316213,"about_ca_topic_score_gemma":0.0100700315,"teacher_disagreement_score":0.0060820407,"about_ca_system_score_codex":0.0012980216,"about_ca_system_score_gemma":0.0010139825,"threshold_uncertainty_score":0.020346403},"labels":[],"label_agreement":null},{"id":"W2979432384","doi":"10.1007/978-3-030-31605-1_28","title":"A Probabilistic View on Erotetic Argumentation Within Language","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Argumentation theory; Probabilistic logic; Probabilistic argumentation; Programming language; Artificial intelligence; Natural language processing; Theoretical computer science; Linguistics; Philosophy","score_opus":0.019464703858371207,"score_gpt":0.26005362985837743,"score_spread":0.24058892600000623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979432384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004776013,0.0012680315,0.90890235,0.0036082072,0.0003015385,0.000046978348,0.00018779837,0.00015209377,0.08075703],"genre_scores_gemma":[0.60532635,0.0036598553,0.31352174,0.0017174553,0.0033359018,0.00055879593,0.00069960824,0.00051071454,0.070669524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99126655,0.004456177,0.000576871,0.00081807014,0.002402466,0.0004798363],"domain_scores_gemma":[0.9854226,0.011079873,0.00087726105,0.0012145723,0.0010426719,0.0003629977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069788685,0.0016697644,0.0015583897,0.004526637,0.002801003,0.008446561,0.005018454,0.006115595,0.015100282],"category_scores_gemma":[0.01505736,0.001954369,0.0023095214,0.003954866,0.007579637,0.023864489,0.0044948217,0.00790095,0.0025054622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005269122,0.0000047159233,0.000018414648,0.000020425014,0.000005568711,0.000020718882,0.000094852294,0.0012885926,0.000050959912,0.9962598,0.0003282076,0.0019024685],"study_design_scores_gemma":[0.000004973984,0.0000073962597,0.000026273634,0.000016262951,0.000006061885,0.000050033024,0.000023094859,0.0061280406,0.00006527142,0.9903868,0.003277262,0.000008474776],"about_ca_topic_score_codex":0.0013650404,"about_ca_topic_score_gemma":0.0009105952,"teacher_disagreement_score":0.015100282,"about_ca_system_score_codex":0.002616979,"about_ca_system_score_gemma":0.00096992886,"threshold_uncertainty_score":0.050515413},"labels":[],"label_agreement":null},{"id":"W2979546509","doi":"10.1007/978-3-030-32251-9_22","title":"Preprocessing, Prediction and Significance: Framework and Application to Brain Imaging","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Baycrest Hospital; University of Toronto","funders":"","keywords":"Computer science; Preprocessor; Artificial intelligence; Statistical parametric mapping; Noise (video); Data set; Parametric statistics; Permutation (music); Data pre-processing; Data mining; Neuroimaging; Machine learning; Pattern recognition (psychology); Statistics; Image (mathematics); Mathematics; Medicine; Magnetic resonance imaging","score_opus":0.010262842702932852,"score_gpt":0.2938426984266436,"score_spread":0.28357985572371075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979546509","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.0022569322,0.0006387367,0.99440706,0.00021717916,0.000050232,0.000028279737,0.00010729955,0.0014742649,0.00082011666],"genre_scores_gemma":[0.048429407,0.0013393278,0.9448217,0.00014424956,0.00020065493,0.00008703241,0.00036001156,0.00038239884,0.0042352364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996784,0.00006983485,0.00002158227,0.00009136308,0.00010169772,0.00003720482],"domain_scores_gemma":[0.9991954,0.00039249333,0.000051338844,0.000088887726,0.00021858381,0.000053360232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012726354,0.000999936,0.0011401669,0.0011558149,0.0006104201,0.0019153521,0.0020029664,0.0014411769,0.00457614],"category_scores_gemma":[0.0029154448,0.00054017786,0.0011289271,0.0018509447,0.0007434729,0.0009296143,0.0013250912,0.0017455277,0.0022075998],"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.00015257689,0.00011057362,0.0016297047,0.00020779585,0.00006922582,0.00022104717,0.00012220442,0.043741994,0.01828369,0.027669068,0.012614483,0.89517766],"study_design_scores_gemma":[0.000023729706,0.0001284035,0.002629227,0.000054933967,0.00008673347,0.0005653457,0.00007545141,0.8680962,0.015671605,0.09802505,0.014598085,0.00004528352],"about_ca_topic_score_codex":0.0064169075,"about_ca_topic_score_gemma":0.009108203,"teacher_disagreement_score":0.0064169075,"about_ca_system_score_codex":0.00053460494,"about_ca_system_score_gemma":0.0016321508,"threshold_uncertainty_score":0.015308738},"labels":[],"label_agreement":null},{"id":"W2979547380","doi":"10.1007/978-3-030-32254-0_13","title":"Development of a Multi-objective Optimized Planning Method for Microwave Liver Tumor Ablation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hepatocellular Carcinoma Treatment and Prognosis","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Microwave ablation; Computer science; Pareto optimal; Pareto principle; Ablation; Radiation treatment planning; Plan (archaeology); Microwave; Set (abstract data type); Key (lock); Cover (algebra); Mathematical optimization; Multi-objective optimization; Radiology; Medicine; Machine learning; Mathematics; Telecommunications","score_opus":0.07514799662432448,"score_gpt":0.2979511172754009,"score_spread":0.22280312065107644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979547380","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.0014769369,0.00008736414,0.99604636,0.000027137161,0.0000381737,0.000030245008,0.000022804585,0.00026422023,0.0020068102],"genre_scores_gemma":[0.036716167,0.00014286205,0.9580976,0.00004624581,0.000021469286,0.00015575411,0.00010246313,0.00021019578,0.0045073116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983144,0.000028251712,0.000008386386,0.000024352268,0.0000970655,0.000010554105],"domain_scores_gemma":[0.9998217,0.000073099414,0.000013389728,0.000013107802,0.00007083024,0.000007928191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003492754,0.00056237826,0.00044831386,0.00038033657,0.00028384032,0.00046537272,0.00094604713,0.00072159094,0.0040375865],"category_scores_gemma":[0.00055068353,0.00051303924,0.000751707,0.00042582166,0.00022628221,0.00035570876,0.00056939584,0.0006609194,0.00074295595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039365324,0.00004111362,0.00023306273,0.0001454236,0.000058811722,0.0000873153,0.000057030225,0.7872417,0.01803917,0.007869544,0.0025906346,0.1835969],"study_design_scores_gemma":[0.0000050272633,0.000016479738,0.00008517824,0.0000059780555,0.000006028839,0.00003534527,0.000004543638,0.9949291,0.0017252757,0.0007315605,0.0024482275,0.0000073611473],"about_ca_topic_score_codex":0.0038921006,"about_ca_topic_score_gemma":0.0044845087,"teacher_disagreement_score":0.0040375865,"about_ca_system_score_codex":0.00032466144,"about_ca_system_score_gemma":0.00094110833,"threshold_uncertainty_score":0.013507068},"labels":[],"label_agreement":null},{"id":"W2979553811","doi":"10.1007/978-3-030-32251-9_40","title":"Generalizable Feature Learning in the Presence of Data Bias and Domain Class Imbalance with Application to Skin Lesion Classification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Overfitting; Computer science; Generalizability theory; Artificial intelligence; Machine learning; Feature (linguistics); Deep learning; Class (philosophy); Pattern recognition (psychology); Data set; Context (archaeology); Artificial neural network; Statistics; Mathematics","score_opus":0.03577167231634153,"score_gpt":0.2778400685443043,"score_spread":0.24206839622796278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979553811","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.020007204,0.00078454876,0.9765112,0.0003213695,0.00009263266,0.000061985746,0.00013866358,0.0016658104,0.00041655588],"genre_scores_gemma":[0.35602134,0.0007804078,0.6342291,0.00040295924,0.00047741464,0.00023354175,0.0013515864,0.00062333205,0.005880233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981086,0.0006921856,0.00014457224,0.0004973986,0.00040098873,0.00015621612],"domain_scores_gemma":[0.9924476,0.0046738274,0.00036475193,0.0014802188,0.0008846887,0.00014891283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061841914,0.001090366,0.0019667924,0.0011015591,0.0005182719,0.0013369132,0.002276726,0.0020833337,0.0016525199],"category_scores_gemma":[0.013980024,0.0005978275,0.0015024974,0.0021998715,0.001191289,0.0018946507,0.0028817644,0.0033252886,0.00069431507],"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.00032837124,0.00019060813,0.0034311216,0.00019589534,0.0002571657,0.000323636,0.00024594244,0.20947945,0.010856853,0.0072112656,0.00888776,0.7585919],"study_design_scores_gemma":[0.000020880596,0.0000659582,0.0009410986,0.000009967805,0.000026314967,0.000085727355,0.000020796373,0.98367935,0.0014285821,0.012702758,0.0010065484,0.000011917391],"about_ca_topic_score_codex":0.0041293027,"about_ca_topic_score_gemma":0.004411361,"teacher_disagreement_score":0.0061841914,"about_ca_system_score_codex":0.0007752846,"about_ca_system_score_gemma":0.0009984632,"threshold_uncertainty_score":0.032705545},"labels":[],"label_agreement":null},{"id":"W2979569543","doi":"10.1007/978-3-030-32785-9_4","title":"Long Short Term Memory Based Model for Abnormal Behavior Prediction in Elderly Persons","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"","keywords":"Computer science; Long short term memory; Term (time); Artificial intelligence; Recurrent neural network; Machine learning; Intervention (counseling); Home automation; Artificial neural network; Psychology; Telecommunications","score_opus":0.03539538842245469,"score_gpt":0.26415611060320715,"score_spread":0.22876072218075247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979569543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36778796,0.005254544,0.6142274,0.0008487949,0.00052980083,0.00013997123,0.0023325672,0.0034500998,0.005428758],"genre_scores_gemma":[0.95429784,0.0010391271,0.036934018,0.00018012276,0.00010468532,0.0001608843,0.0015548441,0.000040216128,0.0056884107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987495,0.000021316597,0.0000127979565,0.000047957543,0.000021233269,0.00002183143],"domain_scores_gemma":[0.99975044,0.000120012824,0.0000295666,0.000015218507,0.00007293711,0.000011847257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004988161,0.0007140403,0.0005592118,0.000553237,0.00018315394,0.0004233253,0.00081919524,0.00063866255,0.0018346781],"category_scores_gemma":[0.00088428194,0.00018493175,0.0005894293,0.00045525274,0.000120554534,0.0004530872,0.0003118077,0.000827835,0.00069076364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067630375,0.00063677685,0.014577823,0.0002513636,0.00027215356,0.00041492446,0.00016756663,0.49914104,0.010587568,0.001676719,0.0064058886,0.4651919],"study_design_scores_gemma":[0.0000041123394,0.0000537086,0.0011047759,0.000009139072,0.000023758568,0.000024655219,0.0000078307785,0.99761057,0.00053263735,0.0003835799,0.00024023512,0.0000049705864],"about_ca_topic_score_codex":0.011140736,"about_ca_topic_score_gemma":0.013882853,"teacher_disagreement_score":0.011140736,"about_ca_system_score_codex":0.00041766698,"about_ca_system_score_gemma":0.00048272917,"threshold_uncertainty_score":0.022151768},"labels":[],"label_agreement":null},{"id":"W2979581699","doi":"10.1007/978-3-030-32692-0_75","title":"Functional Data and Long Short-Term Memory Networks for Diagnosis of Parkinson’s Disease","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parkinson's disease; Term (time); Disease; Medicine","score_opus":0.03654142410019978,"score_gpt":0.275647346908003,"score_spread":0.23910592280780324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979581699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033601422,0.3287992,0.4519454,0.017566558,0.0051994706,0.00011344212,0.0048236656,0.0014531723,0.1564977],"genre_scores_gemma":[0.29842103,0.20636158,0.27104953,0.002444984,0.005997894,0.00020657241,0.005287323,0.00035411274,0.20987701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993145,0.000012676961,0.0000055175724,0.000019976093,0.000025340032,0.00000505199],"domain_scores_gemma":[0.99972063,0.0002010624,0.000013837707,0.00001618886,0.000039237904,0.000009095421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032314428,0.000515601,0.00027124846,0.00067452405,0.00009117488,0.0008443096,0.00052746484,0.00062820746,0.00758876],"category_scores_gemma":[0.00096757995,0.0001299448,0.00027383392,0.00072257017,0.0003098696,0.0011646043,0.00030194139,0.0006876381,0.0025806476],"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.000095163814,0.000047330705,0.0015150456,0.0005051296,0.000071091454,0.00025230902,0.000067283334,0.0066527775,0.0056896657,0.05851891,0.049297757,0.8772875],"study_design_scores_gemma":[0.00002923345,0.00028551178,0.013773845,0.0010582759,0.00017579542,0.0040916344,0.00018802681,0.13409841,0.012440324,0.41712096,0.4166365,0.00010141031],"about_ca_topic_score_codex":0.0005776891,"about_ca_topic_score_gemma":0.0011732364,"teacher_disagreement_score":0.00758876,"about_ca_system_score_codex":0.00032215845,"about_ca_system_score_gemma":0.00015996148,"threshold_uncertainty_score":0.02538699},"labels":[],"label_agreement":null},{"id":"W2979634944","doi":"10.1007/978-3-030-32692-0_3","title":"Globally-Aware Multiple Instance Classifier for Breast Cancer Screening","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"National Institute of Biomedical Imaging and Bioengineering; National Cancer Institute","keywords":"Computer science; Artificial intelligence; Classifier (UML); Residual neural network; Mammography; Pixel; Pattern recognition (psychology); Artificial neural network; Breast cancer; Contextual image classification; Computer vision; Machine learning; Image (mathematics); Cancer; Medicine","score_opus":0.01585183058171993,"score_gpt":0.26409172332605363,"score_spread":0.2482398927443337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979634944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22576004,0.006993777,0.742655,0.0012581369,0.0010054001,0.00021893489,0.0038553497,0.012775085,0.0054782787],"genre_scores_gemma":[0.7701343,0.0008133133,0.21506292,0.0005089065,0.0004527461,0.00011804372,0.0059784316,0.00046642957,0.00646501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988838,0.00017479518,0.00006469161,0.00044853927,0.00023296301,0.00019537244],"domain_scores_gemma":[0.9993099,0.00019473778,0.000057240683,0.00015012207,0.00021544432,0.000072393654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096781406,0.0014409065,0.0025562842,0.0013685783,0.0006477664,0.0012205272,0.0023824684,0.0017865816,0.0018823058],"category_scores_gemma":[0.001845171,0.0004516545,0.0012390417,0.0010193387,0.00017895986,0.0014107542,0.0013283525,0.0015837197,0.0014171622],"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.0010473996,0.0007434014,0.016976243,0.0001904272,0.00046134111,0.0004068891,0.000059812046,0.04726715,0.03313583,0.0010496445,0.021378579,0.8772833],"study_design_scores_gemma":[0.00003642176,0.00021615234,0.005484639,0.000023693854,0.00026099844,0.00044782937,0.000066904126,0.97286946,0.014950791,0.0023489825,0.0032653925,0.00002871726],"about_ca_topic_score_codex":0.00524666,"about_ca_topic_score_gemma":0.008841624,"teacher_disagreement_score":0.00524666,"about_ca_system_score_codex":0.00048844574,"about_ca_system_score_gemma":0.0011821238,"threshold_uncertainty_score":0.010432243},"labels":[],"label_agreement":null},{"id":"W2979660316","doi":"10.1007/978-3-030-32692-0_73","title":"Tree-LSTM: Using LSTM to Encode Memory in Anatomical Tree Prediction from 3D Images","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Computer science; ENCODE; Tree (set theory); Artificial intelligence; Pattern recognition (psychology); Tree structure; Natural language processing; Binary tree; Algorithm; Mathematics","score_opus":0.019275893937165643,"score_gpt":0.26263458805075873,"score_spread":0.2433586941135931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979660316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02783528,0.0014787118,0.9373883,0.00057426444,0.0010017782,0.00013249734,0.0030214349,0.022302456,0.006265355],"genre_scores_gemma":[0.38930857,0.0015173249,0.5868333,0.00069374486,0.00026178846,0.0002694101,0.004824475,0.0012929551,0.014998514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998338,0.000017367944,0.000009306963,0.000075434415,0.00003327283,0.000030763036],"domain_scores_gemma":[0.9997553,0.00009470295,0.000023083703,0.000045977224,0.000060150258,0.000020669753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004353045,0.0011895841,0.0007082154,0.00046156737,0.00028791663,0.0010406178,0.0018602614,0.0016764267,0.008085374],"category_scores_gemma":[0.0011017995,0.0006230702,0.00075829274,0.0011477065,0.00035515512,0.0015340222,0.0010642081,0.00163847,0.003840529],"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.0002556559,0.00011069283,0.0005929513,0.00024746498,0.000117542106,0.00021183361,0.000090380876,0.09374664,0.036341123,0.0042225486,0.026604705,0.8374585],"study_design_scores_gemma":[0.0000133410185,0.000058417623,0.00037286986,0.000034330424,0.000037947044,0.00007119007,0.00001887481,0.97346616,0.013811512,0.0092483545,0.002849316,0.000017782928],"about_ca_topic_score_codex":0.00783039,"about_ca_topic_score_gemma":0.013265066,"teacher_disagreement_score":0.008085374,"about_ca_system_score_codex":0.00070788653,"about_ca_system_score_gemma":0.0008663202,"threshold_uncertainty_score":0.02704823},"labels":[],"label_agreement":null},{"id":"W2979841147","doi":"10.1007/978-3-030-32692-0_37","title":"Dense-Residual Attention Network for Skin Lesion Segmentation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Residual; Jaccard index; Benchmark (surveying); Segmentation; Artificial intelligence; Convolution (computer science); Feature (linguistics); Discriminative model; Convolutional neural network; Pattern recognition (psychology); Artificial neural network; Field (mathematics); Block (permutation group theory); Machine learning; Algorithm","score_opus":0.020908988410758004,"score_gpt":0.26972736119804586,"score_spread":0.24881837278728786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979841147","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.030865958,0.0051140096,0.9491027,0.00044218195,0.0003450018,0.00009605586,0.0007277379,0.0063322275,0.0069742347],"genre_scores_gemma":[0.51893467,0.0037721533,0.42493033,0.00091838633,0.00047662528,0.00018272629,0.0040102378,0.0008468224,0.045928027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998292,0.000021789123,0.000006900734,0.00006613604,0.0000319506,0.000044033968],"domain_scores_gemma":[0.9998142,0.00007451147,0.000011250771,0.00003008882,0.00005668036,0.000013238178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042621928,0.00105457,0.0009805603,0.0007440467,0.0002988532,0.00063122297,0.0017706866,0.00128868,0.0049440786],"category_scores_gemma":[0.0005868432,0.00048334524,0.0008325945,0.0007807572,0.00025522316,0.0007320487,0.00093145843,0.0010630413,0.002052572],"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.00016455505,0.00013293124,0.0004789611,0.00013464216,0.00009213332,0.000110309426,0.00004599697,0.102942295,0.017782995,0.0027328352,0.014106142,0.86127627],"study_design_scores_gemma":[0.000005075457,0.000041288113,0.00037746291,0.000015021212,0.000033260483,0.000063186926,0.0000105004065,0.9885924,0.0060139652,0.0028301447,0.0020100097,0.000007743961],"about_ca_topic_score_codex":0.014295339,"about_ca_topic_score_gemma":0.019863227,"teacher_disagreement_score":0.014295339,"about_ca_system_score_codex":0.0006740418,"about_ca_system_score_gemma":0.0007620415,"threshold_uncertainty_score":0.028424263},"labels":[],"label_agreement":null},{"id":"W2979940760","doi":"10.1007/978-3-030-32245-8_86","title":"Context-Aware Inductive Bias Learning for Vessel Border Detection in Multi-modal Intracoronary Imaging","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coronary Interventions and Diagnostics","field":"Medicine","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":"Computer science; Artificial intelligence; Context (archaeology); Modal; Coronary vessel; Computer vision; Optical coherence tomography; Radiology; Medicine; Materials science","score_opus":0.0342602963636175,"score_gpt":0.31558215850627996,"score_spread":0.28132186214266247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979940760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012470262,0.0014292428,0.9827072,0.00018856523,0.00012842743,0.00004063227,0.00020429949,0.00167845,0.001152885],"genre_scores_gemma":[0.37069258,0.0012768796,0.61759156,0.0006000599,0.0004213932,0.0002257885,0.0016252624,0.0005274855,0.0070388634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992712,0.00017894401,0.000039083978,0.00023042325,0.00015847455,0.00012196801],"domain_scores_gemma":[0.9984296,0.0009744208,0.00008802743,0.00015316092,0.0002822202,0.00007247571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017438941,0.0010673928,0.0015514873,0.00086432364,0.00052501704,0.0012094398,0.0029773472,0.0018887224,0.0033828637],"category_scores_gemma":[0.0033419398,0.00062232715,0.001269399,0.0010244225,0.0005922935,0.0012603123,0.0024786016,0.0022185028,0.0019279638],"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.0003096624,0.00019062452,0.0020248294,0.00023470103,0.0001344705,0.00012821051,0.00013068152,0.08930219,0.026778355,0.0053683785,0.007924259,0.86747366],"study_design_scores_gemma":[0.00001535615,0.000084290565,0.0005813171,0.000039452392,0.000040853658,0.00011123322,0.00003150874,0.97721183,0.010604468,0.009241014,0.0020196137,0.00001910832],"about_ca_topic_score_codex":0.002640097,"about_ca_topic_score_gemma":0.0054486184,"teacher_disagreement_score":0.0033828637,"about_ca_system_score_codex":0.00056966266,"about_ca_system_score_gemma":0.0008252249,"threshold_uncertainty_score":0.011316776},"labels":[],"label_agreement":null},{"id":"W2980002832","doi":"10.1007/978-3-030-32226-7_37","title":"Stereo-Correlation and Noise-Distribution Aware ResVoxGAN for Dense Slices Reconstruction and Noise Reduction in Thick Low-Dose CT","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Western University","funders":"","keywords":"Artificial intelligence; Computer science; Voxel; Noise (video); Noise reduction; Feature (linguistics); Pattern recognition (psychology); Computer vision; Residual; Reduction (mathematics); Convolution (computer science); Image (mathematics); Algorithm; Mathematics; Artificial neural network","score_opus":0.017517870193375685,"score_gpt":0.28150907578878154,"score_spread":0.26399120559540584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980002832","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.015729401,0.0007273114,0.9795147,0.000109546425,0.00005129879,0.000046805242,0.00022497562,0.0009357581,0.0026601714],"genre_scores_gemma":[0.13288851,0.0012428404,0.85389656,0.00015130818,0.00008033542,0.000073808274,0.001206353,0.0007543227,0.009706033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997454,0.000041313495,0.000014772479,0.0000360059,0.00013538142,0.000027090566],"domain_scores_gemma":[0.9996706,0.00012155788,0.00003290118,0.000066822446,0.00008854697,0.00001958562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562013,0.0006738918,0.00037794997,0.0005855243,0.00017879324,0.00073451234,0.0007398553,0.000504962,0.0045081615],"category_scores_gemma":[0.000995468,0.00041550587,0.00046529603,0.000612997,0.00029233057,0.000559608,0.00082982675,0.00062467624,0.0010536907],"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.00042573956,0.00010433307,0.0013425504,0.00041142068,0.00011096362,0.0002746313,0.00017444247,0.063825086,0.21951835,0.013977198,0.009037696,0.69079757],"study_design_scores_gemma":[0.00002364118,0.00016168901,0.0033815631,0.00006551743,0.0000724627,0.0014162993,0.000080891354,0.7930667,0.18121009,0.0058646337,0.014602781,0.00005376611],"about_ca_topic_score_codex":0.0015677856,"about_ca_topic_score_gemma":0.003928137,"teacher_disagreement_score":0.0045081615,"about_ca_system_score_codex":0.00033193777,"about_ca_system_score_gemma":0.000679172,"threshold_uncertainty_score":0.015081346},"labels":[],"label_agreement":null},{"id":"W2980081166","doi":"10.1007/978-3-030-32248-9_95","title":"Automated Infarct Segmentation from Follow-up Non-Contrast CT Scans in Patients with Acute Ischemic Stroke Using Dense Multi-Path Contextual Generative Adversarial Network","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acute Ischemic Stroke Management","field":"Medicine","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 Calgary","funders":"","keywords":"Discriminator; Computer science; Segmentation; Artificial intelligence; Path (computing); Contrast (vision); Generator (circuit theory); Pattern recognition (psychology); Image segmentation; Random forest; Generative adversarial network; Medicine; Radiology; Deep learning; Power (physics)","score_opus":0.01117046190913557,"score_gpt":0.24417537699037678,"score_spread":0.23300491508124122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980081166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1470664,0.0047048787,0.83572364,0.0012795351,0.0003186172,0.00020215995,0.002828218,0.0038027284,0.004073776],"genre_scores_gemma":[0.76611286,0.0034013297,0.21432105,0.00046538108,0.00033717832,0.0001618554,0.006571863,0.0007422994,0.007886118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.000040138464,0.000013674488,0.00006628206,0.000033105345,0.000030471998],"domain_scores_gemma":[0.99970007,0.00018838835,0.000026228581,0.00003359803,0.000034751265,0.000016968392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408573,0.0008024777,0.00066600845,0.00091691717,0.00023039883,0.0009811004,0.0010260054,0.0010741564,0.0014575904],"category_scores_gemma":[0.0015295933,0.00067806605,0.001342025,0.0005358204,0.00030436885,0.00046246115,0.00081898057,0.0010811641,0.0011138837],"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.00069725566,0.00019401073,0.020716438,0.00023243972,0.00036298105,0.0014852936,0.0002492,0.32213518,0.014649497,0.0024100132,0.015555589,0.62131214],"study_design_scores_gemma":[0.000012210107,0.00005335297,0.008522733,0.000051305775,0.00008816835,0.0010132522,0.0000531939,0.9775669,0.005089823,0.0050888215,0.0024351496,0.000025194975],"about_ca_topic_score_codex":0.0071966113,"about_ca_topic_score_gemma":0.014198032,"teacher_disagreement_score":0.0071966113,"about_ca_system_score_codex":0.00045301727,"about_ca_system_score_gemma":0.0005440725,"threshold_uncertainty_score":0.014309406},"labels":[],"label_agreement":null},{"id":"W2980081640","doi":"10.1007/978-3-030-32239-7_17","title":"Task Adaptive Metric Space for Medium-Shot Medical Image Classification","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Metric (unit); Artificial intelligence; Baseline (sea); Task (project management); Machine learning; Shot (pellet); Domain (mathematical analysis); Meta learning (computer science); Image (mathematics); Space (punctuation); Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.03696009152504456,"score_gpt":0.284568985770106,"score_spread":0.2476088942450614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980081640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062807635,0.0008507773,0.9913078,0.0001232491,0.000051980718,0.000038824463,0.00016750499,0.00063490384,0.0005441865],"genre_scores_gemma":[0.31742948,0.0020089475,0.66742676,0.0003310489,0.00027113385,0.0003322969,0.0027229697,0.00044965305,0.009027763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993327,0.00022657143,0.000040436797,0.00014632987,0.00019200188,0.000061877174],"domain_scores_gemma":[0.99915135,0.00035893268,0.00004807889,0.00015175853,0.00022955757,0.00006033159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011032037,0.00081679993,0.0016075271,0.0009388662,0.00032659018,0.00087795797,0.0019004805,0.0010803718,0.0023184954],"category_scores_gemma":[0.002706694,0.00031025178,0.0008971817,0.0013619609,0.0004786781,0.0011602803,0.0016441325,0.0016016603,0.0011890461],"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.0001857119,0.0001547769,0.00044321513,0.00020635297,0.00010377879,0.000053157193,0.00007317448,0.10582,0.014746229,0.008860808,0.010887833,0.85846496],"study_design_scores_gemma":[0.0000048650313,0.000075475175,0.0004100025,0.000011619541,0.000011262645,0.00008267103,0.000021193442,0.9845389,0.0030976194,0.009783968,0.0019484631,0.000014016856],"about_ca_topic_score_codex":0.0039400775,"about_ca_topic_score_gemma":0.0035296553,"teacher_disagreement_score":0.0039400775,"about_ca_system_score_codex":0.0006447241,"about_ca_system_score_gemma":0.000838708,"threshold_uncertainty_score":0.007834256},"labels":[],"label_agreement":null},{"id":"W2980220913","doi":"10.1007/978-3-030-32785-9_6","title":"Smart Mat for Respiratory Activity Detection: Study in a Clinical Setting","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Centre Hospitalier de l’Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Estimator; Computer science; Cardiorespiratory fitness; Respiratory rate; Context (archaeology); Population; Machine learning; Artificial intelligence; Medicine; Statistics; Mathematics; Heart rate","score_opus":0.03588774300703966,"score_gpt":0.2960834210005985,"score_spread":0.2601956779935588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980220913","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.9637482,0.0042413287,0.02747008,0.00055081304,0.00015967994,0.00036364846,0.0006536265,0.0001684698,0.0026440904],"genre_scores_gemma":[0.9689627,0.002582566,0.024914095,0.0006082957,0.00041916806,0.0003059714,0.00066420226,0.000038860744,0.0015040541],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987771,0.0006195609,0.000065398526,0.00026633797,0.0002176766,0.000054010852],"domain_scores_gemma":[0.9969669,0.0018875087,0.00036950991,0.0002346021,0.00033242017,0.00020914235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755012,0.0005155081,0.0006177959,0.0005744647,0.0001375094,0.0006276302,0.00047856613,0.0010492532,0.0021789414],"category_scores_gemma":[0.0051961523,0.00018465125,0.00037354964,0.0004717096,0.0004886446,0.00051533815,0.00044373612,0.00037724554,0.0009018101],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007448734,0.0049302992,0.28485414,0.0041460623,0.0008400285,0.0023719505,0.0016551818,0.0127777085,0.07108533,0.0015106014,0.004381316,0.60399866],"study_design_scores_gemma":[0.0009009122,0.06267928,0.76168,0.00083782227,0.0010282992,0.014063586,0.0029349192,0.08610234,0.044908367,0.0015492806,0.023069613,0.00024563118],"about_ca_topic_score_codex":0.0005228255,"about_ca_topic_score_gemma":0.0006498171,"teacher_disagreement_score":0.0021789414,"about_ca_system_score_codex":0.00015633585,"about_ca_system_score_gemma":0.0002115666,"threshold_uncertainty_score":0.0072892904},"labels":[],"label_agreement":null},{"id":"W2980365261","doi":"10.1007/978-3-030-33636-3_3","title":"Certification of Breadth-First Algorithms by Extraction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Certification; Computer science; Extraction (chemistry); Algorithm; Chromatography; Chemistry; Political science; Law","score_opus":0.029191592871803822,"score_gpt":0.28726548133904184,"score_spread":0.258073888467238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980365261","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.01285116,0.00037535984,0.96831435,0.00045078807,0.00013978341,0.00021147465,0.00021451338,0.005558313,0.011884377],"genre_scores_gemma":[0.29490647,0.00077156565,0.68613976,0.00042567396,0.00019358637,0.00034353306,0.0013058241,0.0033694012,0.012544157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906673,0.0023660539,0.0005727227,0.0015592361,0.0038013346,0.0010333379],"domain_scores_gemma":[0.9680447,0.017314166,0.0010250465,0.009729434,0.0034731652,0.00041336587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052141966,0.001254815,0.0015175324,0.0021935126,0.0014872638,0.004126762,0.0032226343,0.0025151705,0.01409923],"category_scores_gemma":[0.030326564,0.0017900195,0.0025231913,0.001837562,0.0039668344,0.009453246,0.0052957875,0.0042935046,0.0054683047],"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.0008383057,0.00027170728,0.0017410646,0.0011775723,0.00013343534,0.0003021533,0.00060812716,0.0614045,0.022864806,0.5130546,0.01615485,0.38144884],"study_design_scores_gemma":[0.00019405394,0.00012452574,0.0005226181,0.00039906253,0.000099262405,0.00044890042,0.00014347104,0.19019814,0.053168792,0.7258428,0.028772982,0.000085398184],"about_ca_topic_score_codex":0.0016231153,"about_ca_topic_score_gemma":0.0016677245,"teacher_disagreement_score":0.01409923,"about_ca_system_score_codex":0.001971769,"about_ca_system_score_gemma":0.0045521576,"threshold_uncertainty_score":0.047166646},"labels":[],"label_agreement":null},{"id":"W2980777135","doi":"10.1007/978-3-030-60117-1_18","title":"CountMarks: Multi-finger Marking Menus for Mobile Interaction with Head-Mounted Displays","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Carleton University","funders":"","keywords":"Touchscreen; Computer science; Mobile device; Head (geology); Interaction technique; Selection (genetic algorithm); Mobile interaction; Computer vision; Computer graphics (images); Human–computer interaction; Artificial intelligence; Gesture","score_opus":0.020211655214268803,"score_gpt":0.2968280684715392,"score_spread":0.2766164132572704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980777135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021088257,0.0050085597,0.8380972,0.00021467175,0.0007088047,0.00041995946,0.0034718236,0.07097646,0.060014196],"genre_scores_gemma":[0.19436656,0.004619232,0.437414,0.00073312805,0.00037730657,0.001033167,0.0066702752,0.010024801,0.34476164],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998062,0.000022271339,0.000009983011,0.000027968503,0.000102762555,0.000030754356],"domain_scores_gemma":[0.99966383,0.00018812767,0.000015716847,0.00004188674,0.00005455782,0.000035823905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021928016,0.001208578,0.00063421245,0.0007441123,0.0003990392,0.00091472437,0.001964972,0.0010811157,0.113620505],"category_scores_gemma":[0.00080635404,0.00048919383,0.00047803496,0.00069627876,0.00020288324,0.0012344767,0.0014515048,0.00064148055,0.02097828],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090142584,0.00013406642,0.0003740615,0.001043211,0.00004298133,0.00051908684,0.00035681183,0.0009793375,0.13039924,0.006392905,0.11374557,0.7451112],"study_design_scores_gemma":[0.00029808917,0.00086039054,0.0060673743,0.0006130513,0.00018973523,0.0042934585,0.0003514748,0.04343621,0.19253235,0.009894873,0.74116117,0.00030183978],"about_ca_topic_score_codex":0.000626702,"about_ca_topic_score_gemma":0.0015048598,"teacher_disagreement_score":0.113620505,"about_ca_system_score_codex":0.00020999479,"about_ca_system_score_gemma":0.00017161015,"threshold_uncertainty_score":0.38009846},"labels":[],"label_agreement":null},{"id":"W2981444879","doi":"10.1007/978-3-030-33723-0_37","title":"Fast Contextual View Generation in 3D Medical Images Using a 3D Widget User Interface and Super-Ellipsoids","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Rendering (computer graphics); Ellipsoid; Visualization; Computer graphics (images); Focus (optics); Computer vision; Volume rendering; User interface; Artificial intelligence; Context (archaeology)","score_opus":0.027965527114255595,"score_gpt":0.30065725509075264,"score_spread":0.27269172797649704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981444879","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.010166697,0.00043545497,0.97840834,0.00009574858,0.00007002804,0.00007969026,0.00030900183,0.009246406,0.0011886016],"genre_scores_gemma":[0.085360214,0.0005557348,0.9085093,0.00013051601,0.00006293778,0.00014578676,0.000784971,0.0024580553,0.0019924599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997192,0.00006303382,0.000023822844,0.000039720515,0.0001252179,0.000028882438],"domain_scores_gemma":[0.998919,0.00066027837,0.00004418469,0.00017408848,0.00013745684,0.000065052045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007607833,0.0011457916,0.0008929095,0.00094309787,0.00022200152,0.00134861,0.001091124,0.00095351395,0.012854849],"category_scores_gemma":[0.0024512282,0.0008495479,0.0009509021,0.0006529932,0.00023406062,0.0009048609,0.0022733752,0.00086783624,0.0021712792],"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.0013843343,0.00011313707,0.0010671002,0.0010755594,0.0001232329,0.0010667039,0.00078318676,0.022148166,0.25257245,0.010405082,0.024841173,0.68441975],"study_design_scores_gemma":[0.0003320407,0.00048429755,0.0029147863,0.0002766304,0.0001846656,0.003546633,0.0003030759,0.6929857,0.22245795,0.011997808,0.064301774,0.00021466799],"about_ca_topic_score_codex":0.00058204116,"about_ca_topic_score_gemma":0.0009815608,"teacher_disagreement_score":0.012854849,"about_ca_system_score_codex":0.00018179855,"about_ca_system_score_gemma":0.00029491834,"threshold_uncertainty_score":0.043003738},"labels":[],"label_agreement":null},{"id":"W2981779826","doi":"10.1007/978-3-030-33702-5_5","title":"Towards Automated Microservices Extraction Using Muti-objective Evolutionary Search","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":40,"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; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Microservices; Computer science; Benchmark (surveying); Sorting; Identification (biology); Source code; Set (abstract data type); Software; Software evolution; Plug-in; Genetic programming; Process (computing); Theoretical computer science; Data mining; Machine learning; Software development; Programming language; Cloud computing; Software construction; Operating system","score_opus":0.02359947469198001,"score_gpt":0.29985626001772736,"score_spread":0.2762567853257474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981779826","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.027241502,0.00039879777,0.96162724,0.000105299085,0.000054025688,0.0001284521,0.00036045923,0.004548647,0.005535642],"genre_scores_gemma":[0.13356608,0.0002585787,0.8558306,0.000069748196,0.00002046842,0.00011504689,0.0016837938,0.0007536345,0.0077019194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994809,0.00007405697,0.000031294356,0.00012859094,0.00020883817,0.0000763022],"domain_scores_gemma":[0.9993679,0.00026186492,0.000060165952,0.00014975584,0.0001363086,0.00002410351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048120803,0.0011375812,0.0011833187,0.0021212606,0.00075007306,0.001744159,0.0014763972,0.0014114744,0.0077795642],"category_scores_gemma":[0.0018609148,0.00069349445,0.0018398741,0.0019530281,0.00044947973,0.0013289725,0.0014599243,0.0010606878,0.0029745477],"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.00016453276,0.00022487094,0.0018202435,0.00049164484,0.00011038867,0.0003358272,0.0001648563,0.14240971,0.043241832,0.014933758,0.0069935718,0.78910875],"study_design_scores_gemma":[0.00001965226,0.000060896848,0.0006781572,0.00004290197,0.00004256011,0.00018998161,0.0000949702,0.9617422,0.018809015,0.01158318,0.0067195864,0.000016960026],"about_ca_topic_score_codex":0.002521019,"about_ca_topic_score_gemma":0.004419444,"teacher_disagreement_score":0.0077795642,"about_ca_system_score_codex":0.00055229204,"about_ca_system_score_gemma":0.0011301156,"threshold_uncertainty_score":0.026025236},"labels":[],"label_agreement":null},{"id":"W2981834267","doi":"10.1007/978-3-030-34146-6_10","title":"Getting to Win-Win in Inter-organizational Relationships Through Customer Segmentation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coopetition; Computer science; Adversarial system; Conceptual model; Action (physics); Conceptual framework; Knowledge management; Process management; Business; Industrial organization; Game theory; Artificial intelligence; Microeconomics; Economics","score_opus":0.028686132180907632,"score_gpt":0.24316545655527244,"score_spread":0.21447932437436482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981834267","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2661689,0.002178603,0.047204766,0.012233328,0.0002637854,0.00011040071,0.000043112857,0.00030795846,0.67148924],"genre_scores_gemma":[0.9656663,0.00043794146,0.0074582906,0.0005246679,0.000055949793,0.00006046558,0.00004586347,0.000079143465,0.02567126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988716,0.0005416471,0.000016893724,0.000093652285,0.00019916032,0.00027688354],"domain_scores_gemma":[0.998281,0.0008484856,0.00013981361,0.00013173047,0.000123563,0.00047541995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014329624,0.00033090237,0.00024989995,0.00053187733,0.0025314363,0.005303925,0.0007551609,0.0015184192,0.013428382],"category_scores_gemma":[0.0031116444,0.0003760637,0.00028327908,0.0009117125,0.0031548038,0.009347289,0.0040187584,0.002656016,0.0021947224],"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.00021345819,0.00034939335,0.0039738603,0.00019120425,0.00003654152,0.0003271308,0.020018045,0.0023970196,0.0025065462,0.64179987,0.028855236,0.29933167],"study_design_scores_gemma":[0.000038404698,0.00024638206,0.0060503515,0.00018864124,0.000030845742,0.00020575587,0.023036739,0.009565518,0.0013862838,0.888092,0.071125254,0.000033909353],"about_ca_topic_score_codex":0.0008088498,"about_ca_topic_score_gemma":0.0023562878,"teacher_disagreement_score":0.013428382,"about_ca_system_score_codex":0.0012782929,"about_ca_system_score_gemma":0.0017950585,"threshold_uncertainty_score":0.04492241},"labels":[],"label_agreement":null},{"id":"W2982175325","doi":"10.1007/978-3-030-33904-3_48","title":"A Spatiotemporal Analysis of Taxis Demand: A Case Study in the Manizales City","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Taxis; Computer science; Population; Quarter (Canadian coin); Service (business); Operations research; Geography; Transport engineering; Economy; Economics; Demography; Mathematics; Engineering; Sociology","score_opus":0.03117885930993699,"score_gpt":0.30313934655096186,"score_spread":0.2719604872410249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982175325","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.99119943,0.00024727234,0.0027745795,0.0003306251,0.000007912419,0.00004075935,0.0012893238,0.000035116755,0.004075045],"genre_scores_gemma":[0.9930205,0.00046275728,0.0033729589,0.000019247527,0.000009369919,0.000018135157,0.0008458767,0.000017824463,0.0022333253],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998221,0.00006614383,0.000010719575,0.000027067696,0.000037355057,0.000036761194],"domain_scores_gemma":[0.99946326,0.00032122634,0.000059737664,0.000027801823,0.000085657775,0.000042365882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035464828,0.00033223414,0.00027906217,0.0014702694,0.0006173142,0.0010331523,0.0006370825,0.00062610704,0.0014024623],"category_scores_gemma":[0.00096028106,0.00018657786,0.000490061,0.0040708664,0.00038785546,0.0006327394,0.0004654863,0.00031267124,0.00015656916],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095261267,0.0014714209,0.53524643,0.00069612294,0.0005867405,0.029457606,0.0092203645,0.2732953,0.01076205,0.024107216,0.011411172,0.10279293],"study_design_scores_gemma":[0.000060244693,0.00043776186,0.38324648,0.00011957949,0.0003015557,0.002541618,0.052069176,0.53490335,0.0042729354,0.005846794,0.016063053,0.00013748062],"about_ca_topic_score_codex":0.11741281,"about_ca_topic_score_gemma":0.13868959,"teacher_disagreement_score":0.11741281,"about_ca_system_score_codex":0.0019478293,"about_ca_system_score_gemma":0.0008428089,"threshold_uncertainty_score":0.23345876},"labels":[],"label_agreement":null},{"id":"W2982224576","doi":"10.1007/978-3-030-33843-5_8","title":"Modeling and Analysis Brain Development via Discriminative Dictionary Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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; McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Representation (politics); Machine learning; Rank (graph theory); Pattern recognition (psychology); Class (philosophy); Mathematics","score_opus":0.017411754969218343,"score_gpt":0.2700221907409863,"score_spread":0.252610435771768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982224576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010584764,0.00043383893,0.98784435,0.00009842857,0.000018175533,0.000011347219,0.00012778801,0.00027314687,0.0006082064],"genre_scores_gemma":[0.51513314,0.0021784187,0.4690165,0.00014932505,0.00008782259,0.00014253736,0.0011089294,0.00033066393,0.011852657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999138,0.000016560218,0.0000037586462,0.00002971697,0.000021397105,0.000014599993],"domain_scores_gemma":[0.99973756,0.00014457456,0.000032573378,0.000032022832,0.000038815204,0.000014460303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002683605,0.00039488287,0.00046812696,0.00039991396,0.000097322045,0.00050070754,0.0007318241,0.00051565113,0.0011799886],"category_scores_gemma":[0.0008252265,0.0003600029,0.0005078263,0.0005241108,0.0003080795,0.00047313984,0.0005742082,0.00082532124,0.0005433966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006232214,0.000041855077,0.0014926806,0.00011323439,0.000085856715,0.00009395288,0.000056824563,0.6662869,0.017043091,0.021254085,0.0036086892,0.28986046],"study_design_scores_gemma":[0.0000016011684,0.000009358545,0.0002888148,0.0000032972869,0.0000051063093,0.000038954287,0.000004194987,0.9933733,0.001273022,0.0044491263,0.00055007194,0.0000031899237],"about_ca_topic_score_codex":0.0039069587,"about_ca_topic_score_gemma":0.005527957,"teacher_disagreement_score":0.0039069587,"about_ca_system_score_codex":0.00030672463,"about_ca_system_score_gemma":0.0003873777,"threshold_uncertainty_score":0.007768452},"labels":[],"label_agreement":null},{"id":"W2982225546","doi":"10.1007/978-3-030-34146-6_6","title":"Towards a Catalog of Goals for Strategic Coopetition","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coopetition; Computer science; Empirical research; Knowledge management; Competition (biology); Listing (finance); Hyperlink; Exploratory research; Data science; World Wide Web; Business; Web page; Game theory","score_opus":0.03434081514559421,"score_gpt":0.24530238230496235,"score_spread":0.21096156715936815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982225546","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013061282,0.0110973045,0.47230592,0.006561668,0.001166382,0.00071227795,0.004457838,0.0037962496,0.486841],"genre_scores_gemma":[0.12801921,0.016684579,0.73585534,0.0015656798,0.00051397114,0.0017990806,0.010920049,0.0019943085,0.102647856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984571,0.00040921758,0.00029449703,0.00019812347,0.0004961017,0.00014506045],"domain_scores_gemma":[0.99778074,0.0007761502,0.00015493431,0.00037401877,0.0007060376,0.00020809499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017275452,0.001840652,0.0011144446,0.010038996,0.0034677135,0.011253206,0.0014291927,0.0023066676,0.012664752],"category_scores_gemma":[0.0039242436,0.0011046776,0.0012236421,0.01311795,0.0027014047,0.014397539,0.0032762012,0.0046911594,0.0065960498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013085473,0.00004801115,0.00051780365,0.00025818704,0.000008781971,0.00011487165,0.0013391688,0.0012417774,0.00044838444,0.84402955,0.034701787,0.11727855],"study_design_scores_gemma":[0.000012259196,0.000033323253,0.0006712785,0.00053034484,0.000020012218,0.0003727796,0.0016702489,0.0068154116,0.0006557322,0.5380664,0.45111525,0.000036826463],"about_ca_topic_score_codex":0.0052187517,"about_ca_topic_score_gemma":0.007896966,"teacher_disagreement_score":0.012664752,"about_ca_system_score_codex":0.0028059832,"about_ca_system_score_gemma":0.0039941673,"threshold_uncertainty_score":0.042367876},"labels":[],"label_agreement":null},{"id":"W2982275750","doi":"10.1007/978-3-030-33843-5_24","title":"PredictUS: A Method to Extend the Resolution-Precision Trade-Off in Quantitative Ultrasound Image Reconstruction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Window (computing); Algorithm; Convolutional neural network; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.015633071998861305,"score_gpt":0.2958637541940007,"score_spread":0.28023068219513936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982275750","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.0018556747,0.00015877702,0.9954224,0.000056279663,0.000037871072,0.00002055871,0.000052833817,0.0016276414,0.00076801854],"genre_scores_gemma":[0.04263886,0.00037118592,0.9509836,0.00013679788,0.00008462335,0.00011377179,0.00021763287,0.001723695,0.0037298198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.00026513817,0.00005398138,0.00016558316,0.0006539804,0.00007493815],"domain_scores_gemma":[0.9979146,0.0011580256,0.00015523436,0.00039971012,0.0002985155,0.00007391405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023512666,0.0014262497,0.0011358211,0.0011076302,0.0006084559,0.001921772,0.0023184107,0.0016228263,0.007132577],"category_scores_gemma":[0.0060456274,0.001102899,0.0011069999,0.0010794351,0.0009739821,0.0020599216,0.0029097658,0.0019315475,0.0025442431],"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.0005066577,0.00013752238,0.0015041041,0.00039860647,0.00018383967,0.00021373603,0.00018289224,0.13459642,0.05483471,0.07472527,0.013069684,0.71964663],"study_design_scores_gemma":[0.0000212725,0.000056825647,0.00024226595,0.000020512029,0.000030932362,0.00023163701,0.000013576332,0.95449924,0.020566372,0.016879683,0.0074087903,0.000028826906],"about_ca_topic_score_codex":0.001209369,"about_ca_topic_score_gemma":0.0023746477,"teacher_disagreement_score":0.007132577,"about_ca_system_score_codex":0.0005298687,"about_ca_system_score_gemma":0.0010828684,"threshold_uncertainty_score":0.023860872},"labels":[],"label_agreement":null},{"id":"W2982522501","doi":"10.1007/978-3-030-33720-9_3","title":"Delineation of Road Networks Using Deep Residual Neural Networks and Iterative Hough Transform","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automated Road and Building Extraction","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Orthophoto; Pipeline (software); Segmentation; Artificial intelligence; Hough transform; Artificial neural network; RGB color model; Residual; Image segmentation; Computer vision; Deep learning; Set (abstract data type); Pattern recognition (psychology); Data mining; Image (mathematics); Algorithm","score_opus":0.01116370713301647,"score_gpt":0.22943490437745342,"score_spread":0.21827119724443694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982522501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018993609,0.00019079083,0.9764915,0.00008140222,0.000023708155,0.00006340349,0.00021867685,0.001623,0.0023138626],"genre_scores_gemma":[0.23731835,0.00042920536,0.7521064,0.00008512116,0.000033618635,0.00010929441,0.0011417578,0.0005868257,0.0081893485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997341,0.00003012448,0.000013911118,0.00009086211,0.000081040955,0.000049855746],"domain_scores_gemma":[0.99963844,0.00011261659,0.000041041505,0.00006120563,0.00012690305,0.000019796338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046744524,0.0011185118,0.00082491117,0.0016278806,0.00040479857,0.001763531,0.0014049227,0.0011096499,0.0032965357],"category_scores_gemma":[0.0013033752,0.0007816651,0.00092301087,0.0010681129,0.0004629927,0.0016284945,0.0011348601,0.0012725639,0.001910115],"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.00015693286,0.00009714853,0.0014490731,0.00014434835,0.000058636215,0.00016781216,0.00014969069,0.35831487,0.025417715,0.011730784,0.004648537,0.5976644],"study_design_scores_gemma":[0.000002460153,0.0000116015235,0.00023544225,0.000011403873,0.000008146422,0.0000400436,0.00001775606,0.9890682,0.0063278712,0.003183262,0.0010863084,0.000007637836],"about_ca_topic_score_codex":0.009153724,"about_ca_topic_score_gemma":0.01640704,"teacher_disagreement_score":0.009153724,"about_ca_system_score_codex":0.00085441116,"about_ca_system_score_gemma":0.0013566454,"threshold_uncertainty_score":0.018200874},"labels":[],"label_agreement":null},{"id":"W2982558675","doi":"10.1007/978-3-030-33223-5_43","title":"Factors Affecting Comprehension of Contribution Links in Goal Models: An Experiment","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Computer science; Soundness; Representation (politics); Construct (python library); Comprehension; Meaning (existential); Semantics (computer science); Readability; Quality (philosophy); Artificial intelligence; Human–computer interaction; Psychology; Programming language","score_opus":0.02803798937809541,"score_gpt":0.238226463516228,"score_spread":0.2101884741381326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982558675","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.99686134,0.000028658227,0.0007957139,0.00008928199,0.000021331132,0.0002716925,0.00006610949,0.00005115556,0.0018147076],"genre_scores_gemma":[0.993572,0.000077686745,0.0032088263,0.00020847311,0.000028279363,0.00075882615,0.00024904797,0.000086245505,0.0018105999],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9922742,0.003909829,0.000839207,0.0015318764,0.0010099794,0.00043480346],"domain_scores_gemma":[0.65704346,0.31676286,0.009232508,0.009888838,0.0035287593,0.0035436044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013193127,0.0013411498,0.0012570717,0.00061487034,0.0009643307,0.0049917176,0.002227232,0.0032232273,0.012392261],"category_scores_gemma":[0.1664465,0.0013865663,0.0006623151,0.00061886315,0.0013416045,0.0075232056,0.002033279,0.00437292,0.0015637506],"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.08558503,0.17553484,0.156273,0.0028452734,0.00082523614,0.0027209157,0.2926805,0.009585861,0.14820805,0.0084320875,0.0054874397,0.11182183],"study_design_scores_gemma":[0.030697236,0.17935926,0.44483757,0.0011319382,0.0035390817,0.0024239798,0.081472345,0.10635515,0.08773991,0.038030196,0.022741666,0.0016716928],"about_ca_topic_score_codex":0.002087841,"about_ca_topic_score_gemma":0.0008003821,"teacher_disagreement_score":0.013193127,"about_ca_system_score_codex":0.0008572989,"about_ca_system_score_gemma":0.0014596859,"threshold_uncertainty_score":0.06977278},"labels":[],"label_agreement":null},{"id":"W2982683919","doi":"10.1007/978-3-030-32409-4_29","title":"Assessment of a Formal Requirements Modeling Approach on a Transportation System","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Systems Modeling Language; Computer science; Software engineering; Requirements engineering; Formal specification; Systems engineering; Formal methods; Unified Modeling Language; Requirements analysis; Engineering management; Software; Programming language; Engineering","score_opus":0.05839990213020305,"score_gpt":0.3054174109659546,"score_spread":0.24701750883575155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982683919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3150016,0.00023357928,0.63985264,0.0016378358,0.000089034555,0.0013325216,0.00038675766,0.0016938098,0.039772283],"genre_scores_gemma":[0.7711079,0.00014109722,0.22518487,0.00015490853,0.000022161737,0.0003945608,0.00038800327,0.00017118969,0.0024352018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858474,0.008156099,0.00042625394,0.00032276506,0.004761257,0.00048617274],"domain_scores_gemma":[0.9679267,0.022828765,0.0011302925,0.0026060385,0.005141938,0.00036629158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01286333,0.0010318825,0.0004320718,0.0017866938,0.0009745274,0.0027403177,0.0018325687,0.0013417955,0.0040797554],"category_scores_gemma":[0.030492285,0.00045694248,0.0010509959,0.00075699924,0.0010385079,0.0025129295,0.0016495867,0.0011256245,0.00041386948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001041476,0.0009542031,0.0054138117,0.00073039706,0.00015823671,0.00044281245,0.0018248855,0.689908,0.024986548,0.09790088,0.0029787712,0.17365988],"study_design_scores_gemma":[0.00015098194,0.0007593888,0.0020456817,0.00018048179,0.00014404656,0.0001065386,0.00096919993,0.9616247,0.007622101,0.019397443,0.0069419746,0.000057524372],"about_ca_topic_score_codex":0.010881691,"about_ca_topic_score_gemma":0.009518965,"teacher_disagreement_score":0.01286333,"about_ca_system_score_codex":0.003890352,"about_ca_system_score_gemma":0.0048906356,"threshold_uncertainty_score":0.06802857},"labels":[],"label_agreement":null},{"id":"W2982767570","doi":"10.1007/978-3-030-35758-0_16","title":"Self-regulation Strategies of Students Enrolled in a Distance and Online University Education Program","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Université TÉLUQ","funders":"","keywords":"Respondent; Workload; Schedule; Time management; Distance education; Task (project management); Procrastination; Computer science; Spouse; Psychology; Medical education; Mathematics education; Applied psychology; Social psychology; Medicine; Management","score_opus":0.019838767090468033,"score_gpt":0.3565855339009422,"score_spread":0.33674676681047416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982767570","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.99928457,0.000035945224,0.000019476358,0.00002203066,0.0000056113204,0.000008004379,0.000027917386,0.0000015872743,0.00059490645],"genre_scores_gemma":[0.9970572,0.00006242167,0.0000597898,0.000045909233,0.0000042289153,0.000018415103,0.00006743498,0.0000019976762,0.0026826635],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99984086,0.000041213232,0.000009967651,0.000028763847,0.000032047043,0.00004711702],"domain_scores_gemma":[0.9991067,0.00021328282,0.00013578415,0.000032902826,0.000105529085,0.0004057886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036878962,0.00017723556,0.00030929255,0.00047400428,0.00048515556,0.0012760164,0.00028784882,0.00038757236,0.0026026107],"category_scores_gemma":[0.0013388157,0.0001403556,0.00024928196,0.00027964383,0.0002552981,0.00029524267,0.00044427684,0.00079452293,0.0005865082],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012357131,0.010669167,0.9059561,0.00006187369,0.00011475884,0.0004137019,0.014370749,0.00016823248,0.013403559,0.00039004665,0.00087234634,0.05234393],"study_design_scores_gemma":[0.000019410196,0.0010279733,0.9924597,0.00000867213,0.000025671772,0.00011438204,0.0046758885,0.00029711198,0.0006669212,0.00009374381,0.000598132,0.000012381993],"about_ca_topic_score_codex":0.0030102474,"about_ca_topic_score_gemma":0.0042216675,"teacher_disagreement_score":0.0030102474,"about_ca_system_score_codex":0.0002780641,"about_ca_system_score_gemma":0.00034342112,"threshold_uncertainty_score":0.00870657},"labels":[],"label_agreement":null},{"id":"W2983409491","doi":"10.1007/978-3-030-35758-0_22","title":"Promoting Inclusion Using OER in Vocational Education and Training Programs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","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":"Ontario College of Art and Design","funders":"","keywords":"Open educational resources; Inclusion (mineral); Vocational education; Computer science; Context (archaeology); Multimedia; Knowledge management; World Wide Web; Pedagogy; Psychology; Sociology; Social science","score_opus":0.030880867911797352,"score_gpt":0.2923054633541466,"score_spread":0.26142459544234925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983409491","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.4053768,0.00400353,0.008865019,0.010811067,0.0006301685,0.000208153,0.00008358799,0.00040100852,0.5696207],"genre_scores_gemma":[0.70676035,0.004496745,0.022957059,0.0014957,0.00033740577,0.00019371224,0.00016581241,0.00018783848,0.26340523],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976459,0.00092509796,0.00007187294,0.00013763717,0.0007692101,0.0004502803],"domain_scores_gemma":[0.99843794,0.0005273396,0.00017328956,0.00013981212,0.00021226537,0.0005094264],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0023819199,0.00025238542,0.0003105427,0.0013631306,0.001720416,0.0027735005,0.0008754477,0.0007840101,0.011335456],"category_scores_gemma":[0.0023602804,0.00012786851,0.00037296466,0.0010081548,0.0006781776,0.0018690021,0.006577444,0.0010552815,0.0034298599],"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.00007823056,0.0019462908,0.004910731,0.00032308645,0.000008309468,0.00018018228,0.014530943,0.000088739296,0.003206901,0.009650397,0.010604145,0.954472],"study_design_scores_gemma":[0.000097843054,0.0019230094,0.19053003,0.0043244264,0.00012474185,0.0015116909,0.07810521,0.001421533,0.0099458955,0.022301098,0.6896171,0.00009744244],"about_ca_topic_score_codex":0.0023541711,"about_ca_topic_score_gemma":0.009511352,"teacher_disagreement_score":0.9991245,"about_ca_system_score_codex":0.0007034467,"about_ca_system_score_gemma":0.0020698505,"threshold_uncertainty_score":0.037920892},"labels":[],"label_agreement":null},{"id":"W2983623018","doi":"10.1007/978-3-030-34644-7_20","title":"Enhancing Communication and Awareness in Asymmetric Games","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Modalities; Human–computer interaction; Computer science; Headset; Deixis; Multimedia; Sociology; Telecommunications","score_opus":0.022012054944548373,"score_gpt":0.2768927408956529,"score_spread":0.2548806859511045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983623018","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.43466106,0.0010534497,0.4249928,0.000981758,0.00022303965,0.0001108339,0.00007088669,0.0008262489,0.13707997],"genre_scores_gemma":[0.9721485,0.00019630071,0.019169541,0.000058933976,0.00002684885,0.00003912696,0.00002780986,0.000033279062,0.0082996655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995704,0.00017930752,0.00001371885,0.000050893992,0.000102666425,0.000082952756],"domain_scores_gemma":[0.9986406,0.0009239156,0.00009535702,0.00011370317,0.00008847885,0.00013793004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842694,0.0006918448,0.00027772313,0.0002723462,0.000309325,0.0011732727,0.000765297,0.00047772907,0.006415476],"category_scores_gemma":[0.0029365402,0.00019568646,0.00020524512,0.00018903251,0.0005237987,0.002292282,0.0018813072,0.0011695013,0.0005288112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013323023,0.0017572023,0.0021483218,0.0006782343,0.000095026706,0.00036956373,0.0029038377,0.055680808,0.067893505,0.40323246,0.0058840355,0.45802465],"study_design_scores_gemma":[0.0001978121,0.0009775852,0.0038795625,0.00019456765,0.00013572148,0.0006322325,0.001323787,0.38775352,0.041783582,0.5402383,0.022809997,0.00007327464],"about_ca_topic_score_codex":0.00031119413,"about_ca_topic_score_gemma":0.00039090487,"teacher_disagreement_score":0.006415476,"about_ca_system_score_codex":0.00024658715,"about_ca_system_score_gemma":0.0002743618,"threshold_uncertainty_score":0.021461964},"labels":[],"label_agreement":null},{"id":"W2984743818","doi":"10.1007/978-3-030-45771-6_26","title":"The Integrality Number of an Integer Program","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Einstein Stiftung Berlin","keywords":"Unimodular matrix; Integer (computer science); Combinatorics; Mathematics; Constraint (computer-aided design); Relaxation (psychology); Matrix (chemical analysis); Integer matrix; Discrete mathematics; Computer science; Symmetric matrix; Physics; Nonnegative matrix; Geometry","score_opus":0.033214859811090756,"score_gpt":0.32660962435792634,"score_spread":0.2933947645468356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984743818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69504017,0.0010730157,0.14473157,0.006820256,0.0003381187,0.00009053185,0.001142369,0.0007568084,0.1500071],"genre_scores_gemma":[0.9589421,0.0006163925,0.026603214,0.00042632,0.00036380393,0.0001551781,0.0008243184,0.000312591,0.0117561845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809057,0.0004165553,0.00009077634,0.0005205616,0.00046663903,0.00041492458],"domain_scores_gemma":[0.9833325,0.012838178,0.0011907755,0.0009005842,0.00065806165,0.0010798572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002351919,0.0010358914,0.0013353544,0.0033687074,0.0022827901,0.00580155,0.0020292818,0.0018391773,0.011063908],"category_scores_gemma":[0.014631775,0.0009102377,0.0009809256,0.0028572418,0.004791862,0.008937393,0.0026473978,0.005266645,0.0010618161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059871393,0.00011406927,0.002123741,0.00021969421,0.000046106437,0.00014122772,0.00038028782,0.014039688,0.005696421,0.95598304,0.0038627372,0.016794262],"study_design_scores_gemma":[0.00006371707,0.0000687524,0.001004652,0.000048514543,0.000059907008,0.00025021055,0.000098198354,0.040296838,0.0044111535,0.94979095,0.0038783366,0.00002874715],"about_ca_topic_score_codex":0.00052928674,"about_ca_topic_score_gemma":0.0004115863,"teacher_disagreement_score":0.011063908,"about_ca_system_score_codex":0.0031182454,"about_ca_system_score_gemma":0.0012319384,"threshold_uncertainty_score":0.037012458},"labels":[],"label_agreement":null},{"id":"W2985259086","doi":"10.1007/978-3-030-39881-1_8","title":"Packing Trees into 1-Planar Graphs","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Packing problems; Disjoint sets; Matching (statistics); Path (computing); Graph; Computer science","score_opus":0.02224383213300857,"score_gpt":0.27244506797246365,"score_spread":0.2502012358394551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985259086","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.53551847,0.0019265364,0.4276098,0.00063788786,0.00015697457,0.00021042963,0.0011226851,0.0008838999,0.031933274],"genre_scores_gemma":[0.74586314,0.003129405,0.23647456,0.00036111547,0.00016729745,0.00017577624,0.0025448666,0.00036315309,0.010920588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994673,0.0000876377,0.000036655114,0.00013818464,0.00011950938,0.0001507282],"domain_scores_gemma":[0.9993549,0.00026536954,0.00018232792,0.00009319008,0.000048993163,0.000055285273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023092689,0.00078251545,0.0007363134,0.0011087598,0.0007710794,0.0014216047,0.0008777994,0.0011614016,0.0057524033],"category_scores_gemma":[0.0021129216,0.0008045868,0.0007431577,0.0019843953,0.0008924358,0.0032576444,0.002340687,0.0010558316,0.0013830693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038739142,0.00028740687,0.004313735,0.0010834396,0.00009822553,0.0018237777,0.0011570171,0.34196877,0.0312933,0.40720326,0.013816109,0.19656758],"study_design_scores_gemma":[0.000067249275,0.00038385476,0.0026661616,0.00016703062,0.00007006396,0.0023651402,0.00080731115,0.3541523,0.015048417,0.5929547,0.03126508,0.00005281885],"about_ca_topic_score_codex":0.00073852076,"about_ca_topic_score_gemma":0.0006837536,"teacher_disagreement_score":0.0057524033,"about_ca_system_score_codex":0.0006095553,"about_ca_system_score_gemma":0.00024910638,"threshold_uncertainty_score":0.019243717},"labels":[],"label_agreement":null},{"id":"W2986809465","doi":"10.1007/978-3-030-33617-2_24","title":"An Innovative Deep-Learning Algorithm for Supporting the Approximate Classification of Workloads in Big Data Environments","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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 Manitoba","funders":"","keywords":"Computer science; Deep learning; Artificial neural network; Workload; Artificial intelligence; Compiler; Big data; Machine learning; Deep neural networks; Data mining; Operating system","score_opus":0.03842705501057859,"score_gpt":0.28399289483769985,"score_spread":0.24556583982712127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986809465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015780706,0.00034175138,0.98118746,0.00023534228,0.00010062349,0.000030447349,0.00015841382,0.001299709,0.00086558715],"genre_scores_gemma":[0.3429488,0.00039600965,0.647627,0.00052371854,0.00017617641,0.00017682025,0.0010539712,0.00023756466,0.006859954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996082,0.00007000705,0.000025913852,0.00010464489,0.00012516174,0.00006620421],"domain_scores_gemma":[0.9990262,0.00041683845,0.000060574286,0.00014348433,0.00028606705,0.00006676689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084179884,0.00081592635,0.00080306333,0.0005808674,0.00039680305,0.0009805762,0.0022310833,0.0011314744,0.0023870845],"category_scores_gemma":[0.003117211,0.0004541174,0.00046525302,0.0009354157,0.000463411,0.0017993333,0.0016437209,0.0019083122,0.0007912702],"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.00025654992,0.00024093922,0.0021987678,0.00009771001,0.00008422511,0.00006788551,0.000075411044,0.35655618,0.00796948,0.010586253,0.010771935,0.61109465],"study_design_scores_gemma":[0.0000030000022,0.000009481723,0.000060409133,0.0000024298236,0.0000020146538,0.0000062855793,0.0000030096708,0.99686027,0.0005283007,0.0022485862,0.0002741152,0.0000020619952],"about_ca_topic_score_codex":0.007499269,"about_ca_topic_score_gemma":0.010768214,"teacher_disagreement_score":0.007499269,"about_ca_system_score_codex":0.00077522814,"about_ca_system_score_gemma":0.0012591501,"threshold_uncertainty_score":0.014911234},"labels":[],"label_agreement":null},{"id":"W2987041346","doi":"10.1007/978-3-030-34644-7_15","title":"Playing with Persiflage: The Impact of Free-Form Dialogue on the Play of Computer Role Playing Games","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Converse; Computer science; Conversation; Interactivity; Narrative; Human–computer interaction; Natural (archaeology); Role playing; Metagaming; Multimedia; Communication; Sequential game; Psychology; Epistemology; Game theory; Simultaneous game; Art; Mathematical economics; Mathematics; Literature; History","score_opus":0.016602042953331505,"score_gpt":0.255886628547528,"score_spread":0.23928458559419646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987041346","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.3348365,0.004231488,0.06179062,0.0019381313,0.000326943,0.000114284594,0.00024856813,0.0008048011,0.5957086],"genre_scores_gemma":[0.9379611,0.0010100922,0.016683428,0.00018887434,0.000067121706,0.00009184192,0.00016259518,0.00016238133,0.04367254],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947244,0.00028969132,0.0000095630185,0.000059265243,0.0001075852,0.00006149753],"domain_scores_gemma":[0.9985676,0.0012029869,0.000038230097,0.00004899146,0.000040816292,0.00010133797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059262523,0.0004982589,0.00022900004,0.00031807687,0.0006582804,0.0036989509,0.0006436942,0.00081190345,0.016816769],"category_scores_gemma":[0.0028353313,0.0001536538,0.0002858982,0.00023347509,0.0012353408,0.0032857538,0.0018530868,0.0008839618,0.0012787398],"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.0018958655,0.00078708987,0.0032597065,0.000859552,0.00006365588,0.0010797362,0.046063717,0.0048408792,0.024699945,0.40333182,0.018702522,0.4944155],"study_design_scores_gemma":[0.0006270968,0.00204663,0.026509354,0.0010851217,0.000199646,0.003843942,0.04455411,0.06483108,0.022253565,0.42373368,0.41011757,0.00019824722],"about_ca_topic_score_codex":0.0008708838,"about_ca_topic_score_gemma":0.0012040943,"teacher_disagreement_score":0.016816769,"about_ca_system_score_codex":0.00048651453,"about_ca_system_score_gemma":0.00058023824,"threshold_uncertainty_score":0.056257665},"labels":[],"label_agreement":null},{"id":"W2989202310","doi":"10.1007/978-3-030-39881-1_9","title":"Angle Covers: Algorithms and Complexity","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Graph; Vertex (graph theory); Planar graph; Degree (music); Angle of rotation; Vertex cover; Planar; Regular graph","score_opus":0.038577695229011257,"score_gpt":0.2577262969465937,"score_spread":0.21914860171758246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989202310","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.021400828,0.013814792,0.38233706,0.003334444,0.001809075,0.00014751582,0.0028795325,0.002426387,0.57185036],"genre_scores_gemma":[0.27239716,0.024790836,0.27464205,0.0012912287,0.0039016244,0.00053473917,0.008070534,0.0034388395,0.41093287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886453,0.0001360505,0.000040747676,0.00024010369,0.00059190433,0.00012673347],"domain_scores_gemma":[0.99872106,0.00062515284,0.000054013588,0.00029715637,0.00019134986,0.00011120157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337491,0.0011493379,0.0012329645,0.0019260645,0.0012263112,0.0061499598,0.0018647662,0.0010684554,0.071701154],"category_scores_gemma":[0.0035340353,0.0008601279,0.001003079,0.004919426,0.0012911721,0.009445448,0.0023138304,0.0029434299,0.021345288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090074456,0.000048830112,0.00032757045,0.00025699142,0.00001851241,0.000035220284,0.00012273114,0.0048722546,0.0012898836,0.63866276,0.09216403,0.26211107],"study_design_scores_gemma":[0.000020865034,0.000025445624,0.00040742953,0.00007392762,0.000021046375,0.00019588805,0.00010001766,0.016224675,0.0011374895,0.8037445,0.17803498,0.000013756425],"about_ca_topic_score_codex":0.0013333529,"about_ca_topic_score_gemma":0.0011061556,"teacher_disagreement_score":0.071701154,"about_ca_system_score_codex":0.001980415,"about_ca_system_score_gemma":0.00083792914,"threshold_uncertainty_score":0.23986423},"labels":[],"label_agreement":null},{"id":"W298976848","doi":"10.1007/978-3-319-10599-4_34","title":"Discovering Video Clusters from Visual Features and Noisy Tags","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster analysis; Consistency (knowledge bases); Margin (machine learning); Artificial intelligence; Visualization; Pattern recognition (psychology); Information retrieval; Machine learning","score_opus":0.0072578812683532085,"score_gpt":0.22725329163267932,"score_spread":0.21999541036432613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W298976848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.162362,0.004445533,0.81447643,0.0005514545,0.00043822388,0.00073988695,0.0064047393,0.0050817,0.005499981],"genre_scores_gemma":[0.44038892,0.0029107253,0.51950747,0.00020445847,0.0006965853,0.0004197777,0.023274785,0.000769856,0.0118273785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905187,0.00007778234,0.000058728136,0.00040073736,0.0002615201,0.00014939898],"domain_scores_gemma":[0.99852127,0.00045480413,0.00018312322,0.0001854174,0.00053442875,0.000121015364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060221954,0.0023921984,0.0017524234,0.0071400236,0.0010875666,0.0025467481,0.0017604001,0.001365777,0.0019077375],"category_scores_gemma":[0.002946321,0.0006353117,0.0016080842,0.0077945744,0.00060969533,0.0019976955,0.0013777097,0.0011193788,0.0032746303],"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.0013296965,0.0004529709,0.011275694,0.00075393775,0.00034700407,0.0007222185,0.0005673945,0.016100673,0.0657836,0.0033481016,0.023148807,0.87616986],"study_design_scores_gemma":[0.00013710104,0.0006615124,0.021937087,0.00022796357,0.0009291188,0.0014187143,0.0025646319,0.85060793,0.063231155,0.03333719,0.02477428,0.00017332335],"about_ca_topic_score_codex":0.011587724,"about_ca_topic_score_gemma":0.015260318,"teacher_disagreement_score":0.011587724,"about_ca_system_score_codex":0.0010266164,"about_ca_system_score_gemma":0.0011025608,"threshold_uncertainty_score":0.023040593},"labels":[],"label_agreement":null},{"id":"W2989939367","doi":"10.1007/978-3-030-34500-6_12","title":"Adaptive Task Allocation for Planar Construction Using Response Threshold Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Memorial University of Newfoundland","funders":"","keywords":"Robot; Computer science; Construct (python library); Swarm behaviour; Swarm robotics; Annulus (botany); Task (project management); Distributed computing; Scalar field; Scalar (mathematics); Artificial intelligence; Algorithm; Mathematics; Engineering","score_opus":0.03451456014011499,"score_gpt":0.24642152906249692,"score_spread":0.21190696892238192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989939367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013426697,0.00012114893,0.9830141,0.00006141954,0.00002374476,0.000023839628,0.00002427586,0.00018146519,0.0031233204],"genre_scores_gemma":[0.85312307,0.00027678508,0.13730632,0.000072286035,0.000032905533,0.00019147417,0.000112974514,0.000116723444,0.008767377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999813,0.00004074955,0.000007401318,0.000048287195,0.000047789483,0.00004276128],"domain_scores_gemma":[0.99973875,0.00012883685,0.00003606074,0.000029920535,0.000045430417,0.00002099911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028707404,0.0004871777,0.0007687646,0.00036778953,0.00023945501,0.0005345637,0.0010957087,0.00066285505,0.0031984474],"category_scores_gemma":[0.0009470446,0.00024392515,0.00053236936,0.0005684597,0.00046402833,0.00065702747,0.00090668024,0.0006196485,0.0004191036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006255404,0.00003287682,0.00010260588,0.00005144426,0.00001382122,0.000023937178,0.00002289104,0.94534993,0.005469382,0.014219607,0.0007698745,0.03388109],"study_design_scores_gemma":[0.0000021256055,0.000009121323,0.000023893252,0.0000010922485,0.0000015922311,0.0000036104668,0.000002087966,0.99737513,0.00015785015,0.0023183879,0.00010324588,0.0000018793803],"about_ca_topic_score_codex":0.0023874626,"about_ca_topic_score_gemma":0.0015633992,"teacher_disagreement_score":0.0031984474,"about_ca_system_score_codex":0.000570463,"about_ca_system_score_gemma":0.00058617454,"threshold_uncertainty_score":0.010699868},"labels":[],"label_agreement":null},{"id":"W2990095109","doi":"10.1007/978-3-030-35225-7_7","title":"ADLER: Adaptive Sampling for Precise Monitoring","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Profiling (computer programming); Sampling (signal processing); Adaptive sampling; Anomaly detection; Algorithm; Parallel computing; Real-time computing; Data mining; Programming language; Statistics; Mathematics; Monte Carlo method; Telecommunications","score_opus":0.03729705076844908,"score_gpt":0.2771553264780678,"score_spread":0.2398582757096187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990095109","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.0014136871,0.00048065334,0.99005765,0.000059503094,0.00014934003,0.000026325186,0.000080067715,0.0050744633,0.0026583453],"genre_scores_gemma":[0.14221258,0.0008014946,0.82410073,0.00037020585,0.00031867344,0.00018792188,0.00042300994,0.0017355157,0.029849814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914527,0.00016836623,0.00004042921,0.00020623213,0.0003860751,0.000053673313],"domain_scores_gemma":[0.9991665,0.00043442656,0.00004230615,0.00019000396,0.00013181752,0.000034986904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006424378,0.0011235179,0.000833851,0.00080434536,0.0003311555,0.00109942,0.0013460175,0.0009440267,0.011887815],"category_scores_gemma":[0.0027465587,0.00051899086,0.00032583135,0.0006859027,0.0005426658,0.0013022312,0.0010918739,0.0016054034,0.0044578756],"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.00048076818,0.000061885075,0.00032189192,0.00022712219,0.000046651916,0.00011835696,0.0001064144,0.024901155,0.02697977,0.04083407,0.026499202,0.8794228],"study_design_scores_gemma":[0.0000966034,0.00013650405,0.000552227,0.00006439342,0.00005018974,0.0005272966,0.000027006066,0.8350568,0.04754271,0.052455023,0.063425094,0.00006609005],"about_ca_topic_score_codex":0.00093740574,"about_ca_topic_score_gemma":0.0013500629,"teacher_disagreement_score":0.011887815,"about_ca_system_score_codex":0.00044676953,"about_ca_system_score_gemma":0.00035497147,"threshold_uncertainty_score":0.039768696},"labels":[],"label_agreement":null},{"id":"W2990609819","doi":"10.1007/978-3-030-35288-2_12","title":"An Efficient Solver for Parametrized Difference Revision","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"British Columbia Institute of Technology","funders":"","keywords":"Solver; Problem solver; Computer science; Operator (biology); Range (aeronautics); Theoretical computer science; Algorithm; Artificial intelligence; Mathematical optimization; Computational science; Programming language; Mathematics","score_opus":0.021360837614591163,"score_gpt":0.2653960032096404,"score_spread":0.24403516559504923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990609819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015589228,0.00034135283,0.9547102,0.0007079122,0.0003420621,0.00037546072,0.0009453541,0.008948414,0.018040095],"genre_scores_gemma":[0.25425386,0.00024228949,0.72443956,0.00049581646,0.00019718427,0.00037310456,0.0019058126,0.0022243606,0.015868027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970272,0.00059929857,0.00033054728,0.0006475258,0.001014098,0.0003814236],"domain_scores_gemma":[0.9949621,0.0031943785,0.00014871462,0.0009963365,0.0005608316,0.00013768303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026143305,0.001282926,0.002013151,0.0011523651,0.0011954381,0.003945772,0.0037853478,0.0020695038,0.028608762],"category_scores_gemma":[0.010413728,0.0012177472,0.0022465687,0.002012808,0.0016199526,0.0066423463,0.0063019693,0.0042978246,0.004480659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005677427,0.00032472084,0.0007167446,0.0007319131,0.00012486475,0.0003691993,0.0005943679,0.023102926,0.008646827,0.56080043,0.030956296,0.37306386],"study_design_scores_gemma":[0.00048197506,0.000093300354,0.00015415628,0.000073321324,0.00010928191,0.0002854708,0.0001903438,0.27011672,0.010532164,0.6958887,0.022003725,0.0000707554],"about_ca_topic_score_codex":0.0017383363,"about_ca_topic_score_gemma":0.0031725364,"teacher_disagreement_score":0.028608762,"about_ca_system_score_codex":0.0018440904,"about_ca_system_score_gemma":0.0025759179,"threshold_uncertainty_score":0.09570587},"labels":[],"label_agreement":null},{"id":"W2990666454","doi":"10.1007/978-3-030-35888-4_66","title":"Third Eye: Exploring the Affordances of Third-Person View in Telepresence Robots","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Toronto Metropolitan University","funders":"","keywords":"Affordance; Robot; Computer science; Perspective (graphical); Artificial intelligence; Human–computer interaction; Computer vision; Social robot; Field (mathematics); Mobile robot; Robot control","score_opus":0.03781676701097241,"score_gpt":0.26985751870938923,"score_spread":0.23204075169841681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990666454","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.6378315,0.0036844965,0.23410276,0.001156891,0.00012188751,0.00006695044,0.00028755426,0.0010442961,0.12170365],"genre_scores_gemma":[0.92850745,0.0009022324,0.050370403,0.00010018745,0.000016860307,0.000047651138,0.000111330686,0.00019835167,0.019745538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999269,0.000022303955,0.0000010382897,0.000017266862,0.000016412172,0.000015936803],"domain_scores_gemma":[0.9998579,0.00009580882,0.000008064077,0.000013847238,0.000009326202,0.000015000762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011809226,0.0003396607,0.00024672353,0.00014191642,0.00044408627,0.001196823,0.00044245084,0.0006729461,0.0112535665],"category_scores_gemma":[0.0005215316,0.00020854021,0.0003448619,0.00014533183,0.00072505896,0.0021675073,0.0014299346,0.0005243794,0.0007089735],"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.0014933554,0.00028270198,0.004665117,0.0012899073,0.000095483316,0.0035132887,0.06368629,0.012855703,0.34803513,0.13801043,0.01837625,0.4076964],"study_design_scores_gemma":[0.00029014578,0.0020055736,0.059747722,0.0010972933,0.00027279946,0.010533137,0.07501682,0.20600756,0.12619753,0.18462197,0.33381712,0.00039224818],"about_ca_topic_score_codex":0.0017362621,"about_ca_topic_score_gemma":0.0026442586,"teacher_disagreement_score":0.0112535665,"about_ca_system_score_codex":0.0002473095,"about_ca_system_score_gemma":0.00019127295,"threshold_uncertainty_score":0.03764695},"labels":[],"label_agreement":null},{"id":"W2990726007","doi":"10.1007/978-3-030-34339-2_7","title":"JSLess: A Tale of a Fileless Javascript Memory-Resident Malware","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Thompson Rivers University; University of Windsor","funders":"","keywords":"Malware; JavaScript; Cryptovirology; Computer science; Malware analysis; System call; HTML5; Computer security; Operating system; World Wide Web","score_opus":0.013194722677569236,"score_gpt":0.26707878740082197,"score_spread":0.25388406472325276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990726007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09438673,0.0113935545,0.5029008,0.09919014,0.019404367,0.00030270076,0.0017304549,0.046786647,0.2239047],"genre_scores_gemma":[0.45667517,0.005018094,0.22617267,0.01976823,0.00451152,0.00015105712,0.0014954576,0.012355707,0.2738521],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858475,0.00027845724,0.00003090333,0.00022033474,0.0007040387,0.00018148785],"domain_scores_gemma":[0.9974153,0.0010974292,0.00010224869,0.0005014971,0.0004448526,0.00043871996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027345,0.0012658084,0.00040686893,0.0014137041,0.0028178443,0.0049674343,0.0017785489,0.0032262923,0.011363444],"category_scores_gemma":[0.008870014,0.0005166149,0.00080396753,0.0004888197,0.003806687,0.009098656,0.004954479,0.004048656,0.0039801975],"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.00050968025,0.00022056153,0.0035467031,0.00038224182,0.000104094666,0.0014487259,0.0061441576,0.004437884,0.027107984,0.21124947,0.43963578,0.30521265],"study_design_scores_gemma":[0.00008510078,0.0004097291,0.0015472884,0.00036543785,0.0000960555,0.0028858508,0.0022645711,0.030053154,0.04142924,0.17898759,0.74167365,0.00020238757],"about_ca_topic_score_codex":0.0016073419,"about_ca_topic_score_gemma":0.0020909153,"teacher_disagreement_score":0.011363444,"about_ca_system_score_codex":0.0009793343,"about_ca_system_score_gemma":0.0007462086,"threshold_uncertainty_score":0.03801453},"labels":[],"label_agreement":null},{"id":"W2990854486","doi":"10.1007/978-3-030-35288-2_4","title":"Multi-Minimax: A New AI Paradigm for Simultaneously-Played Multi-player Games","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Minimax; Non-cooperative game; Game tree; Combinatorial game theory; Pruning; Sequential game; Screening game; Adversary; Repeated game; Strategy; Game theory; Artificial intelligence; Mathematical economics; Theoretical computer science; Computer security; Mathematics","score_opus":0.04153817435843266,"score_gpt":0.30482928025162326,"score_spread":0.2632911058931906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990854486","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.001986157,0.00078346673,0.97936773,0.0004168002,0.00018189944,0.000049943978,0.0000395357,0.00019865084,0.016975714],"genre_scores_gemma":[0.18318377,0.00220614,0.78184825,0.00075575034,0.00050498376,0.00057043385,0.00014216239,0.00030223053,0.030486304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988777,0.00038164892,0.000077814846,0.00019408838,0.0003962697,0.000072474366],"domain_scores_gemma":[0.9991835,0.0005120047,0.00004985952,0.000093443814,0.00008737142,0.00007376606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013959928,0.00127251,0.0009887791,0.0006362413,0.0007885863,0.0027925477,0.00315081,0.001591313,0.008469284],"category_scores_gemma":[0.0028165341,0.0005582048,0.0012460967,0.0008574108,0.0018417159,0.0038295302,0.0030688143,0.005219556,0.0012789328],"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.00007942992,0.000054315064,0.00008985658,0.00023608176,0.00005811472,0.00008492008,0.0001770062,0.043320756,0.0030228726,0.8856336,0.0055440078,0.06169908],"study_design_scores_gemma":[0.000039007282,0.00007749643,0.00004922394,0.000058702135,0.00002535596,0.00012745541,0.000029998304,0.3473206,0.0015231004,0.6317335,0.018996665,0.000018964005],"about_ca_topic_score_codex":0.00062470924,"about_ca_topic_score_gemma":0.0011110923,"teacher_disagreement_score":0.008469284,"about_ca_system_score_codex":0.00091811793,"about_ca_system_score_gemma":0.00097168394,"threshold_uncertainty_score":0.028332591},"labels":[],"label_agreement":null},{"id":"W2991049057","doi":"10.1007/978-3-030-45771-6_1","title":"Idealness of k-wise Intersecting Families","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; European Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Ideal (ethics); Matroid; Integer (computer science); Discrete mathematics; Class (philosophy); Field (mathematics); Pure mathematics; Computer science; Law","score_opus":0.0318072301925753,"score_gpt":0.3155950046054573,"score_spread":0.283787774412882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991049057","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.8556936,0.00038266293,0.093055144,0.0005981864,0.00006569795,0.00004393698,0.001015499,0.00042123286,0.048724078],"genre_scores_gemma":[0.97903204,0.00016859076,0.01427756,0.00011599246,0.000077348435,0.0000507307,0.0011610042,0.000076137716,0.00504054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967146,0.00039006834,0.0003029656,0.0010839071,0.0006864584,0.000822102],"domain_scores_gemma":[0.99110353,0.003093104,0.001432347,0.0010940147,0.0014736102,0.0018035257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019193334,0.0005099893,0.00097623316,0.0026114562,0.0034021598,0.0043975967,0.0012300401,0.0008842107,0.009066507],"category_scores_gemma":[0.0066288747,0.0010180208,0.0010297181,0.0017921892,0.004753618,0.007052086,0.0029227077,0.0016083071,0.0009902786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062011345,0.00013937373,0.025783665,0.00016515894,0.000069188194,0.0008806163,0.0029480625,0.0070645385,0.0131632,0.9298578,0.002931119,0.016377252],"study_design_scores_gemma":[0.000055756278,0.00015177332,0.011225793,0.00011366321,0.00008354322,0.003511419,0.0030176,0.018039688,0.017096123,0.92888385,0.017704623,0.000116154326],"about_ca_topic_score_codex":0.0014268626,"about_ca_topic_score_gemma":0.00084409973,"teacher_disagreement_score":0.009066507,"about_ca_system_score_codex":0.0017128525,"about_ca_system_score_gemma":0.0007832797,"threshold_uncertainty_score":0.03033042},"labels":[],"label_agreement":null},{"id":"W2991308980","doi":"10.1007/978-3-030-35288-2_10","title":"Finding ALL Answers to OBDA Queries Using Referring Expressions","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Focus (optics); Conjunctive query; Database query; Constant (computer programming); Theoretical computer science; Information retrieval; Query language; French horn; Natural language processing; Programming language; Relational database","score_opus":0.03814284817311122,"score_gpt":0.30710724483534674,"score_spread":0.26896439666223554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991308980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13574682,0.005175268,0.7677322,0.004448393,0.0005843687,0.0010656236,0.018162752,0.031303845,0.035780743],"genre_scores_gemma":[0.33442146,0.0020495232,0.6115369,0.00089353474,0.00034435297,0.00042799627,0.026172504,0.0038781392,0.020275531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954531,0.0008946133,0.00059123256,0.0009008606,0.001608025,0.0005521322],"domain_scores_gemma":[0.9929109,0.0037425507,0.0003569027,0.0012659141,0.0015375005,0.00018616047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022950864,0.0021922805,0.0033013585,0.004607466,0.0021247528,0.004735205,0.0022833636,0.00245766,0.010781953],"category_scores_gemma":[0.01486645,0.0008598435,0.0028149101,0.0036717155,0.0012074147,0.008145751,0.0038334902,0.0018929556,0.0055162096],"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.0018256396,0.0005263383,0.012625778,0.0037623616,0.000526384,0.0020341256,0.0053785206,0.014995474,0.05156017,0.11275544,0.11308741,0.6809224],"study_design_scores_gemma":[0.000324421,0.0005395769,0.0056694862,0.00112629,0.0012790147,0.0026553527,0.011992457,0.27575275,0.1085672,0.3517709,0.23986243,0.0004600463],"about_ca_topic_score_codex":0.0071554943,"about_ca_topic_score_gemma":0.008559294,"teacher_disagreement_score":0.010781953,"about_ca_system_score_codex":0.0013992272,"about_ca_system_score_gemma":0.0023326678,"threshold_uncertainty_score":0.036069214},"labels":[],"label_agreement":null},{"id":"W2991373829","doi":"10.1007/978-3-030-34339-2_25","title":"Generating Phishing Emails Using Graph Database","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Phishing; Computer science; World Wide Web; Electronic mail; Internet privacy; Database; Computer security; The Internet","score_opus":0.03201318138469305,"score_gpt":0.25679230578293505,"score_spread":0.224779124398242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991373829","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.5124034,0.001581019,0.36406815,0.00065504987,0.00037819275,0.0012841886,0.031735998,0.076571986,0.011321961],"genre_scores_gemma":[0.7050806,0.0005525246,0.24854043,0.00018025152,0.0001278405,0.00021935446,0.038245726,0.0009699115,0.0060833204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995127,0.00005846357,0.00003667507,0.00016374027,0.00017893402,0.00004940571],"domain_scores_gemma":[0.99870825,0.00045583316,0.00008839882,0.0003093772,0.00034989225,0.00008813971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029695057,0.0009771126,0.0008527011,0.006479435,0.000633471,0.0009015408,0.0010024776,0.0010777059,0.002949386],"category_scores_gemma":[0.0019345141,0.00037765107,0.0007755672,0.0032128536,0.0001740997,0.0011008926,0.00071686786,0.000523902,0.0020142032],"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.0010516411,0.0010168946,0.026454017,0.000548113,0.0002982387,0.0011634817,0.00020123243,0.049176775,0.0424647,0.003648451,0.05725953,0.8167169],"study_design_scores_gemma":[0.000063674015,0.00028161917,0.012554508,0.000032212894,0.00015806386,0.00092760206,0.00016561618,0.9327442,0.03450127,0.009356431,0.009171896,0.000042850956],"about_ca_topic_score_codex":0.005628677,"about_ca_topic_score_gemma":0.007657109,"teacher_disagreement_score":0.006479435,"about_ca_system_score_codex":0.00049202895,"about_ca_system_score_gemma":0.00052643544,"threshold_uncertainty_score":0.011191845},"labels":[],"label_agreement":null},{"id":"W2991443058","doi":"10.1007/978-3-030-34500-6_13","title":"Deep Reinforcement Learning for Multi-satellite Collection Scheduling","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Defence Research and Development Canada; Royal Military College of Canada; Queen's University","funders":"","keywords":"Computer science; Reinforcement learning; Scheduling (production processes); Schedule; Artificial intelligence; Heuristic; Baseline (sea); Task (project management); Critical path method; Machine learning; Mathematical optimization","score_opus":0.03757488183802357,"score_gpt":0.2835196784441623,"score_spread":0.24594479660613874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991443058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03939728,0.0011829498,0.95068425,0.0006329646,0.00017422004,0.00004914749,0.00022895027,0.00092646154,0.006723735],"genre_scores_gemma":[0.89348173,0.00051336305,0.093715794,0.00020284131,0.00011689951,0.0001125473,0.00028779238,0.00013604232,0.011432976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978775,0.000049941133,0.000008867612,0.000052939096,0.000036820627,0.000063704974],"domain_scores_gemma":[0.9993243,0.00041378057,0.000060989896,0.00004810951,0.00009711439,0.000055782464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000687745,0.0006276506,0.0011083125,0.00030348162,0.00031546186,0.0005927718,0.0012656365,0.0010662646,0.0051330277],"category_scores_gemma":[0.0018912876,0.0004291015,0.00038065977,0.0005276466,0.00049434684,0.0007634799,0.00079318095,0.0016960092,0.0005398425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048593978,0.00004006242,0.00019195808,0.000035027042,0.000014940296,0.0000132501855,0.000012320415,0.9513878,0.0004944122,0.0040065097,0.0020994213,0.04165572],"study_design_scores_gemma":[0.000002645964,0.0000070488286,0.000028627011,0.000002056305,0.0000018336852,0.0000018397651,0.0000015703753,0.998004,0.00007590609,0.0017400209,0.00013329649,0.0000011239053],"about_ca_topic_score_codex":0.01108646,"about_ca_topic_score_gemma":0.014183556,"teacher_disagreement_score":0.01108646,"about_ca_system_score_codex":0.0012666036,"about_ca_system_score_gemma":0.0012960111,"threshold_uncertainty_score":0.022043884},"labels":[],"label_agreement":null},{"id":"W2991539852","doi":"10.1007/978-3-030-50347-5_13","title":"Color Inference from Semantic Labeling for Person Search in Videos","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Inference; Segmentation; Perception; Focus (optics); Set (abstract data type); Context (archaeology); Semantic search; Information retrieval; Pattern recognition (psychology); Psychology; Semantic Web","score_opus":0.08330024808562296,"score_gpt":0.3547376528803481,"score_spread":0.2714374047947251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991539852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05240162,0.0008912102,0.9344531,0.00026984987,0.00011793749,0.00010784565,0.0015884162,0.0072900895,0.0028799418],"genre_scores_gemma":[0.61884445,0.00061495695,0.3666936,0.0003684181,0.00023509354,0.000117531585,0.0061568585,0.001018228,0.0059508802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989502,0.0001572224,0.00003252073,0.0004562176,0.00017806239,0.00022590334],"domain_scores_gemma":[0.99890435,0.00042267452,0.0000685522,0.0002800163,0.00022981095,0.000094501316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010106618,0.0012855785,0.0024618462,0.0028907107,0.000951517,0.0016963684,0.002319571,0.002159623,0.004869959],"category_scores_gemma":[0.0034050357,0.00080286287,0.0017199657,0.0026234551,0.0008113721,0.002653794,0.0015393127,0.0017257361,0.002223042],"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.002239114,0.00077844755,0.007694539,0.0003814657,0.00034879197,0.0002486953,0.00021056873,0.10101989,0.04869169,0.017615408,0.023574106,0.7971973],"study_design_scores_gemma":[0.000033389184,0.000058731097,0.0012172495,0.000020916408,0.00006125395,0.000070018345,0.000050038518,0.96945626,0.008629382,0.018917935,0.0014666086,0.000018269036],"about_ca_topic_score_codex":0.026011871,"about_ca_topic_score_gemma":0.03183216,"teacher_disagreement_score":0.026011871,"about_ca_system_score_codex":0.0013315057,"about_ca_system_score_gemma":0.0014825925,"threshold_uncertainty_score":0.051720977},"labels":[],"label_agreement":null},{"id":"W2991551264","doi":"10.1007/978-3-030-34339-2_16","title":"Improved Digital Signatures Based on Elliptic Curve Endomorphism Rings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism ring; Endomorphism; Digital signature; Global Positioning System; Computer science; Scheme (mathematics); Elliptic Curve Digital Signature Algorithm; Signature (topology); Algorithm; Post-quantum cryptography; Elliptic curve cryptography; Mathematics; Public-key cryptography; Discrete mathematics; Encryption; Computer security; Hash function; Geometry; Telecommunications; Mathematical analysis","score_opus":0.007823321560337377,"score_gpt":0.20669272299415978,"score_spread":0.1988694014338224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991551264","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.1521269,0.0028866932,0.768671,0.0011566291,0.0012113764,0.000250883,0.00040074438,0.00329171,0.070004165],"genre_scores_gemma":[0.7590797,0.0016421555,0.20208728,0.0003148158,0.00083077577,0.00011958169,0.0005437087,0.0003855582,0.034996413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979242,0.00042554364,0.000119246135,0.00027622684,0.0010251802,0.00022955851],"domain_scores_gemma":[0.9984724,0.00037912824,0.00009682251,0.0007010953,0.00026671897,0.000083909326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010012654,0.0007652985,0.0013551655,0.0011532207,0.0008141164,0.0022915832,0.0011330913,0.00083387765,0.008359703],"category_scores_gemma":[0.0024335855,0.00037090178,0.0008078861,0.0014542394,0.0013559374,0.0050299363,0.0027128612,0.0022417402,0.0030437778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008764337,0.0002635229,0.00046881725,0.00030189607,0.000057088197,0.00023386501,0.00028255978,0.018950846,0.034297474,0.6924559,0.006823902,0.24498774],"study_design_scores_gemma":[0.00023203311,0.0005423495,0.00086101063,0.00011738159,0.00015371125,0.0012980283,0.00013530202,0.16845597,0.071419,0.67874527,0.07787345,0.00016653279],"about_ca_topic_score_codex":0.00013431994,"about_ca_topic_score_gemma":0.00014656749,"teacher_disagreement_score":0.008359703,"about_ca_system_score_codex":0.0008751545,"about_ca_system_score_gemma":0.0007653612,"threshold_uncertainty_score":0.027965963},"labels":[],"label_agreement":null},{"id":"W2991556759","doi":"10.1007/978-3-030-35802-0_36","title":"Homotopy Height, Grid-Major Height and Graph-Drawing Height","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Pathwidth; Planarity testing; Planar graph; Outerplanar graph; Mathematics; Graph; Grid; Combinatorics; Lattice graph; Line graph; Homotopy; Computer science; Discrete mathematics; Geometry; Pure mathematics; Voltage graph","score_opus":0.01081039062675383,"score_gpt":0.22602708188842885,"score_spread":0.21521669126167503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991556759","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.05477415,0.003716444,0.76688015,0.0010959532,0.0009411529,0.00009347711,0.0005588066,0.0028576497,0.16908224],"genre_scores_gemma":[0.6958889,0.0038256075,0.23025054,0.00038733575,0.00071526103,0.00011462253,0.0007904445,0.001953943,0.06607331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.000042109736,0.000014756358,0.00011280472,0.0001713975,0.000059366073],"domain_scores_gemma":[0.99897456,0.00044178742,0.00006756124,0.000197657,0.00016960145,0.00014887952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003114669,0.0005879328,0.00049824564,0.0013794275,0.0007191954,0.002486615,0.0013943154,0.0008404856,0.016837683],"category_scores_gemma":[0.0026034713,0.00043219293,0.0004740095,0.001670367,0.0022568228,0.0033194574,0.0019184822,0.0024511642,0.0028548844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000839412,0.000045278604,0.0006657559,0.00017174867,0.00001216502,0.00008338023,0.00019008452,0.017519575,0.0063230214,0.738163,0.012648089,0.22409393],"study_design_scores_gemma":[0.00001990947,0.000084657026,0.0012603825,0.00004525072,0.000030138994,0.0004348593,0.00019535125,0.08127922,0.008471307,0.86651236,0.04163353,0.000032941138],"about_ca_topic_score_codex":0.0011142822,"about_ca_topic_score_gemma":0.0014724398,"teacher_disagreement_score":0.016837683,"about_ca_system_score_codex":0.00076627673,"about_ca_system_score_gemma":0.0004509019,"threshold_uncertainty_score":0.0563277},"labels":[],"label_agreement":null},{"id":"W2992362114","doi":"10.1007/978-3-030-36412-0_1","title":"Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Longest common subsequence problem; Longest increasing subsequence; Subsequence; Bounded function; Algorithm; Computer science; Simple (philosophy); Exponential function; Sequence (biology); Time complexity; Combinatorics; Discrete mathematics; Mathematics","score_opus":0.02583166160923958,"score_gpt":0.26755837882144345,"score_spread":0.24172671721220387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992362114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014088853,0.0013925132,0.9673719,0.0007705421,0.00032690936,0.00023024483,0.00073561096,0.0032178066,0.011865646],"genre_scores_gemma":[0.11737888,0.0008317203,0.8681422,0.0003658542,0.00040757234,0.0005178208,0.0025501917,0.00090731645,0.008898323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658257,0.00066134124,0.00027653054,0.000945046,0.0010867225,0.0004478554],"domain_scores_gemma":[0.9922321,0.0045069223,0.00039429075,0.0019086367,0.00075841486,0.0001996812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019120796,0.0017114271,0.0027323307,0.001995987,0.0017065746,0.003490733,0.0050919615,0.002417404,0.015624709],"category_scores_gemma":[0.012902556,0.0011388286,0.0015643798,0.005079249,0.0015446395,0.007381506,0.0040043895,0.0035692574,0.0055196323],"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.0009922107,0.00052047474,0.00069087825,0.0007818559,0.00016683529,0.00021616173,0.00038150683,0.14575242,0.0066962857,0.16258043,0.043853503,0.6373675],"study_design_scores_gemma":[0.00032485783,0.00014387623,0.00025161044,0.00007443295,0.000067817426,0.00025039347,0.00017028273,0.56267905,0.003622387,0.42213422,0.010236368,0.000044700573],"about_ca_topic_score_codex":0.0030982106,"about_ca_topic_score_gemma":0.00424307,"teacher_disagreement_score":0.015624709,"about_ca_system_score_codex":0.0019199006,"about_ca_system_score_gemma":0.0034065798,"threshold_uncertainty_score":0.052269816},"labels":[],"label_agreement":null},{"id":"W2994061451","doi":"10.1007/978-3-030-35423-7_18","title":"On the Relationship Between Resilient Boolean Functions and Linear Branch Number of S-Boxes","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Boolean function; Branch predictor; Algorithm; Discrete mathematics; Arithmetic; Mathematics; Parallel computing","score_opus":0.035803269319095436,"score_gpt":0.29684143055128404,"score_spread":0.2610381612321886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994061451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26282865,0.0077034784,0.4346802,0.006009677,0.001029464,0.00016674103,0.0005995426,0.0014712235,0.285511],"genre_scores_gemma":[0.92761785,0.0033998897,0.045177978,0.0009771426,0.0008796477,0.00015645436,0.0002437576,0.00030738418,0.021239802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998771,0.00033050953,0.00006580277,0.0002883256,0.00029757817,0.00024669652],"domain_scores_gemma":[0.98926556,0.008577433,0.00073740515,0.00087105145,0.0003166528,0.00023188186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019215334,0.0010613505,0.0012608976,0.0029299187,0.0015988651,0.0031070407,0.0015441615,0.0016380457,0.009863952],"category_scores_gemma":[0.011799986,0.00077047484,0.001087848,0.0029630219,0.0056004976,0.007746669,0.002573896,0.0050788126,0.0012194209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017403628,0.000027177652,0.00029455422,0.00008649239,0.000016671791,0.000066976005,0.00014393151,0.009363803,0.0012541814,0.96330196,0.0029697982,0.022300467],"study_design_scores_gemma":[0.000015011078,0.000032301738,0.00019686815,0.00003892174,0.000018088434,0.0001265335,0.000024449064,0.02072036,0.00088302157,0.9759745,0.0019502777,0.000019609435],"about_ca_topic_score_codex":0.0006568769,"about_ca_topic_score_gemma":0.0006131536,"teacher_disagreement_score":0.009863952,"about_ca_system_score_codex":0.0020642509,"about_ca_system_score_gemma":0.0008495856,"threshold_uncertainty_score":0.032998204},"labels":[],"label_agreement":null},{"id":"W2994227837","doi":"10.1007/978-3-030-39197-3_14","title":"Variability-Aware Datalog","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Toronto","funders":"","keywords":"Datalog; Computer science; Overhead (engineering); Programming language; Measure (data warehouse); Software; Product (mathematics); Database; Theoretical computer science; Mathematics","score_opus":0.03686147386200285,"score_gpt":0.27606182991992445,"score_spread":0.23920035605792161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994227837","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.010884995,0.0015328147,0.95692825,0.0007030756,0.0003110398,0.000095207804,0.0006808827,0.007907478,0.020956308],"genre_scores_gemma":[0.4738229,0.003586203,0.47014755,0.0010598584,0.00042950775,0.0002382157,0.0036965534,0.004458061,0.04256109],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908495,0.00012466213,0.000058812137,0.00016101814,0.0004963256,0.00007419153],"domain_scores_gemma":[0.9974771,0.00083568785,0.00011185069,0.0011363805,0.0003526453,0.000086292326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009214731,0.00064773834,0.00046613347,0.00065242714,0.00048150416,0.0015606164,0.0016590371,0.00046968405,0.0060011717],"category_scores_gemma":[0.0035908853,0.0006544998,0.0008046159,0.0009293553,0.0005758747,0.003367011,0.0019411405,0.0027140663,0.0024393233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026244286,0.00021537826,0.0017121629,0.00072245026,0.00006146692,0.00027210062,0.00028450598,0.055879768,0.022364775,0.20626841,0.042470265,0.66948634],"study_design_scores_gemma":[0.000046736764,0.00013791106,0.0008072339,0.0002563529,0.000093667026,0.00082898495,0.000114131515,0.27594045,0.046107084,0.4751947,0.2004113,0.00006148273],"about_ca_topic_score_codex":0.0005113071,"about_ca_topic_score_gemma":0.001152616,"teacher_disagreement_score":0.0060011717,"about_ca_system_score_codex":0.00069926516,"about_ca_system_score_gemma":0.0011274924,"threshold_uncertainty_score":0.020075917},"labels":[],"label_agreement":null},{"id":"W2994786370","doi":"10.1007/978-3-030-34885-4_22","title":"Stock Index Forecasting Using Time Series Decomposition-Based and Machine Learning Models","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wilcoxon signed-rank test; Time series; Series (stratigraphy); Artificial neural network; Machine learning; Hilbert–Huang transform; Mean squared error; Artificial intelligence; Stock market index; Econometrics; Stock market; Statistics; Mathematics","score_opus":0.12073694925941139,"score_gpt":0.3468758646996994,"score_spread":0.226138915440288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994786370","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.06514304,0.0025251997,0.92592794,0.000230604,0.00022474707,0.000021161622,0.00023271918,0.00081565493,0.0048789685],"genre_scores_gemma":[0.6333402,0.0035799502,0.3522523,0.00007605612,0.00027739056,0.000060628034,0.0010014848,0.00016956819,0.009242319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998745,0.000032593125,0.0000115944695,0.000027397076,0.000041506664,0.000012509404],"domain_scores_gemma":[0.9997235,0.00014151592,0.000032968695,0.000028067749,0.000063281026,0.000010568446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041977855,0.0005838461,0.00078850257,0.0006515377,0.00011700823,0.0007457031,0.00035538134,0.00045787843,0.0012378496],"category_scores_gemma":[0.0012622331,0.0002745764,0.00080397597,0.0010314923,0.00012145788,0.000887978,0.00028117574,0.00066050823,0.0006248733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015675879,0.00011100629,0.0023547972,0.00013361264,0.0001533347,0.00009785458,0.00003918424,0.54997826,0.014384515,0.011424249,0.0045547094,0.41661185],"study_design_scores_gemma":[0.0000017451692,0.000007101116,0.00028936463,0.0000031963557,0.000008328603,0.000007944057,0.0000013547962,0.99753726,0.00044809998,0.0014335016,0.00025936,0.0000026930622],"about_ca_topic_score_codex":0.0030778546,"about_ca_topic_score_gemma":0.0024389985,"teacher_disagreement_score":0.0030778546,"about_ca_system_score_codex":0.00034788117,"about_ca_system_score_gemma":0.0002897169,"threshold_uncertainty_score":0.006119907},"labels":[],"label_agreement":null},{"id":"W2994791542","doi":"10.1007/978-3-319-21840-3","title":"Algorithms and Data Structures","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Carleton University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.03946967750347083,"score_gpt":0.29903758412407555,"score_spread":0.2595679066206047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994791542","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015634184,0.012838792,0.90801364,0.001803729,0.001283723,0.00012828951,0.0013372925,0.0036640053,0.069367215],"genre_scores_gemma":[0.035779886,0.017984465,0.79384035,0.0014092588,0.0021587224,0.0007041578,0.0075266915,0.0029229843,0.13767354],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846065,0.00024021018,0.00014656178,0.0003913176,0.0006942938,0.00006700489],"domain_scores_gemma":[0.9982951,0.00056683173,0.000049769555,0.00081176637,0.00023550932,0.000040981897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010884606,0.0015235738,0.0016411688,0.0021129185,0.0008895429,0.0046909126,0.002067548,0.0013329592,0.03685845],"category_scores_gemma":[0.0049425866,0.00097230775,0.0012593037,0.00497536,0.0015603334,0.0056539327,0.0026666997,0.0033703218,0.036182366],"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.000039134888,0.0000446643,0.00015933592,0.0004734094,0.000043349988,0.00003792776,0.00009051809,0.004639866,0.0014045819,0.28555652,0.08879801,0.6187126],"study_design_scores_gemma":[0.000019647203,0.000028920113,0.00018951694,0.00016700584,0.000028052773,0.00022467737,0.000037011338,0.022388725,0.0024356898,0.687986,0.2864728,0.000021879487],"about_ca_topic_score_codex":0.00056668825,"about_ca_topic_score_gemma":0.0005354961,"teacher_disagreement_score":0.03685845,"about_ca_system_score_codex":0.000969122,"about_ca_system_score_gemma":0.0013075611,"threshold_uncertainty_score":0.12330377},"labels":[],"label_agreement":null},{"id":"W2995340000","doi":"10.1007/978-3-030-83508-8_29","title":"Graph Pricing with Limited Supply","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bundle; Combinatorics; Vertex (graph theory); Mathematics; Graph; Set (abstract data type); Revenue; Mathematical economics; Discrete mathematics; Computer science; Economics","score_opus":0.023095000448197196,"score_gpt":0.2192333970610218,"score_spread":0.1961383966128246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995340000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24320409,0.0019496831,0.66248876,0.016435646,0.00072794606,0.00021625803,0.0012771459,0.00093588844,0.07276452],"genre_scores_gemma":[0.9381479,0.0009621352,0.0193779,0.0008868657,0.00088515383,0.00015570107,0.00040180562,0.0002538297,0.038928658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978715,0.0009965509,0.00006930706,0.0003777225,0.00035938906,0.00032552177],"domain_scores_gemma":[0.9831061,0.011730205,0.0011951511,0.0016880536,0.00096731837,0.0013132516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244842,0.00085985335,0.003173787,0.0016318114,0.0012166962,0.0045102313,0.0030062073,0.005157203,0.025527287],"category_scores_gemma":[0.02654674,0.0012917822,0.0014175943,0.002045393,0.0030078655,0.009808733,0.002466563,0.004073783,0.002214312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103871746,0.00007206082,0.000332924,0.0000743824,0.00002813843,0.0001343006,0.00007700116,0.029839087,0.00050510565,0.95605963,0.006038118,0.006735452],"study_design_scores_gemma":[0.00003887966,0.000012509086,0.000116840674,0.00000805105,0.000009173916,0.00005868555,0.000023748264,0.12600411,0.00007518146,0.87289923,0.00074229186,0.00001126439],"about_ca_topic_score_codex":0.002607191,"about_ca_topic_score_gemma":0.0018382532,"teacher_disagreement_score":0.025527287,"about_ca_system_score_codex":0.0019672194,"about_ca_system_score_gemma":0.0011253125,"threshold_uncertainty_score":0.0853973},"labels":[],"label_agreement":null},{"id":"W2995428961","doi":"10.1007/978-3-030-59065-9_24","title":"FIBS: A Generic Framework for Classifying Interval-Based Temporal Sequences","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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 Regina","funders":"","keywords":"Computer science; Interval (graph theory); Set (abstract data type); Feature selection; Filter (signal processing); Feature (linguistics); Data mining; Artificial intelligence; Selection (genetic algorithm); Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.049213358679307005,"score_gpt":0.2697120368243289,"score_spread":0.22049867814502191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995428961","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.007790853,0.0007406136,0.9818432,0.00013262562,0.0001677319,0.00018451511,0.0024778119,0.003526026,0.0031365848],"genre_scores_gemma":[0.08851796,0.0009838828,0.8969847,0.00020484535,0.00038515741,0.00038874635,0.0074050925,0.0004933191,0.004636382],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986986,0.00018378477,0.00021700331,0.0003388708,0.00042590796,0.00013583423],"domain_scores_gemma":[0.99813443,0.0005152005,0.00026316752,0.00039504658,0.00047807017,0.00021402143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021510944,0.0014910422,0.0012964822,0.0075135957,0.0012240765,0.004387414,0.0022139477,0.0014485823,0.007859078],"category_scores_gemma":[0.006139369,0.0005498234,0.0023176498,0.005860033,0.0013877677,0.004566801,0.0022783396,0.001752788,0.004145202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005015851,0.00018018752,0.008390325,0.0008822654,0.00018479563,0.0005381325,0.0007367959,0.030294387,0.0146186175,0.38415956,0.027206346,0.5323069],"study_design_scores_gemma":[0.00004845012,0.00031968296,0.0033948894,0.0002904541,0.00014614938,0.0011099618,0.0003527685,0.39711618,0.006947702,0.50732076,0.08283811,0.00011485639],"about_ca_topic_score_codex":0.0027832878,"about_ca_topic_score_gemma":0.0020869463,"teacher_disagreement_score":0.007859078,"about_ca_system_score_codex":0.000933156,"about_ca_system_score_gemma":0.0014786039,"threshold_uncertainty_score":0.026291251},"labels":[],"label_agreement":null},{"id":"W2995439012","doi":"10.1007/978-3-030-58565-5_13","title":"ScanRefer: 3D Object Localization in RGB-D Scans Using Natural Language","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":30,"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":"Object (grammar); Computer science; Artificial intelligence; Point cloud; Minimum bounding box; Task (project management); Computer vision; Natural language; Point (geometry); RGB color model; Bounding overwatch; Pattern recognition (psychology); Sentence; Natural language processing; Image (mathematics); Mathematics; Geometry","score_opus":0.018180355763784246,"score_gpt":0.3058155811202975,"score_spread":0.28763522535651326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995439012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011979168,0.0004168267,0.85314876,0.00019534987,0.00018454177,0.0003556912,0.008800361,0.11934326,0.00557613],"genre_scores_gemma":[0.13015321,0.0007297,0.81691414,0.0004564067,0.00009859832,0.0008928526,0.026498271,0.010718058,0.013538691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992756,0.00008693347,0.000033952816,0.00021734953,0.00030855706,0.00007757378],"domain_scores_gemma":[0.9994825,0.00013974126,0.000032695418,0.00019249879,0.00011579313,0.00003675649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004911129,0.0021203223,0.0012793873,0.0022509282,0.00061466085,0.0015525047,0.0023063198,0.0014347667,0.035902016],"category_scores_gemma":[0.0019827404,0.0010251714,0.0014556742,0.0020113518,0.00075853086,0.0022543224,0.0039280495,0.0007850448,0.015760526],"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.0012244761,0.00023358806,0.001759467,0.0012524568,0.00020376885,0.0009414098,0.00067260367,0.010357691,0.14502436,0.008242202,0.09240744,0.7376805],"study_design_scores_gemma":[0.0005565146,0.0007248607,0.00829329,0.00031075507,0.00022028133,0.0028658954,0.0013385334,0.5110391,0.22016758,0.04022578,0.2139008,0.00035662425],"about_ca_topic_score_codex":0.005951275,"about_ca_topic_score_gemma":0.0135099515,"teacher_disagreement_score":0.035902016,"about_ca_system_score_codex":0.00050992,"about_ca_system_score_gemma":0.00090283883,"threshold_uncertainty_score":0.12010425},"labels":[],"label_agreement":null},{"id":"W2996255323","doi":"10.1007/978-3-030-58558-7_2","title":"Associative Alignment for Few-Shot Image Classification","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Mila - Quebec Artificial Intelligence Institute; Université Laval","funders":"","keywords":"Centroid; Computer science; Artificial intelligence; Pattern recognition (psychology); Associative property; Metric (unit); Feature (linguistics); Set (abstract data type); Domain (mathematical analysis); Image (mathematics); Constructive; Machine learning; Mathematics","score_opus":0.06221222492084128,"score_gpt":0.3203891967185511,"score_spread":0.2581769717977098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996255323","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.027231319,0.0009902017,0.96809363,0.00016199207,0.00010754865,0.000059280606,0.0002283581,0.0020671904,0.0010604614],"genre_scores_gemma":[0.6257348,0.0010764949,0.35982126,0.00043522747,0.00039244714,0.0002731596,0.0030117773,0.000534666,0.0087201875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988669,0.00026500484,0.00006812809,0.0004318025,0.00024247532,0.00012577367],"domain_scores_gemma":[0.9975776,0.0011021249,0.00017435812,0.0006515042,0.00034395632,0.00015053649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014372227,0.0009214586,0.0021341608,0.0016724127,0.00074994436,0.0010859655,0.0023100928,0.0018357612,0.004065455],"category_scores_gemma":[0.0044447617,0.0005661333,0.0008694254,0.0022851273,0.0007932754,0.002995898,0.0023033242,0.002085057,0.0021993648],"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.00051203143,0.00049996225,0.0015361191,0.00031542138,0.00020455335,0.00013654574,0.000115404684,0.06524946,0.03141516,0.0105973175,0.0080947755,0.88132334],"study_design_scores_gemma":[0.000016825132,0.00011229036,0.0008441615,0.000016709457,0.000041974574,0.00012477557,0.000051096667,0.9599706,0.009828471,0.027511176,0.0014631994,0.00001872829],"about_ca_topic_score_codex":0.0023652113,"about_ca_topic_score_gemma":0.0036155458,"teacher_disagreement_score":0.004065455,"about_ca_system_score_codex":0.00052596774,"about_ca_system_score_gemma":0.00093479466,"threshold_uncertainty_score":0.01360029},"labels":[],"label_agreement":null},{"id":"W2996392280","doi":"10.1007/978-3-030-36938-5_5","title":"A Privacy-Enhancing Framework for Internet of Things Services","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Internet of Things; Computer security; Internet privacy; Privacy software; Categorization; Information privacy; Privacy protection; Privacy by Design; Artificial intelligence","score_opus":0.0138331759707297,"score_gpt":0.2505374835100457,"score_spread":0.23670430753931598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996392280","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.00427898,0.00054686365,0.9740736,0.0012157237,0.00031927886,0.00026941544,0.00013056926,0.0022907304,0.016874902],"genre_scores_gemma":[0.2355417,0.0017804226,0.71750224,0.001238914,0.0004514662,0.00046858503,0.0006438536,0.0007735547,0.04159923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980666,0.00043765036,0.00012965674,0.000214714,0.000849355,0.00030201316],"domain_scores_gemma":[0.99907625,0.00021797138,0.000048276972,0.00037883874,0.00016634626,0.000112350244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026010259,0.0007131304,0.0006621359,0.00068102276,0.0017545293,0.003913788,0.0022115926,0.0022547718,0.0049322834],"category_scores_gemma":[0.002325884,0.0005222156,0.0013662265,0.0006580057,0.0017814315,0.006404865,0.0046407073,0.004428645,0.0018888265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012384,0.00011974482,0.00021753531,0.0001305738,0.000035248082,0.00047873976,0.00039228605,0.008367492,0.008222077,0.90782,0.013965505,0.060126927],"study_design_scores_gemma":[0.000045231383,0.00014464174,0.0002992543,0.0001307471,0.000097667646,0.0013560418,0.00024577515,0.22751264,0.021252528,0.49247196,0.25635737,0.000086164764],"about_ca_topic_score_codex":0.0020365878,"about_ca_topic_score_gemma":0.0022292964,"teacher_disagreement_score":0.0049322834,"about_ca_system_score_codex":0.00104603,"about_ca_system_score_gemma":0.00189985,"threshold_uncertainty_score":0.016500115},"labels":[],"label_agreement":null},{"id":"W2997486962","doi":"10.1007/978-3-030-59065-9_9","title":"High-Utility Interval-Based Sequences","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Regina","funders":"","keywords":"Pruning; Range (aeronautics); Sequential Pattern Mining; Sequence (biology); Event (particle physics); Efficient algorithm","score_opus":0.027275872602880835,"score_gpt":0.2597194800584349,"score_spread":0.2324436074555541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997486962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02692358,0.00068186136,0.96459365,0.00012601083,0.00012391486,0.00007555183,0.0005955411,0.0011855887,0.0056943726],"genre_scores_gemma":[0.40111908,0.00077435427,0.58795977,0.00012455192,0.0001506893,0.00016524353,0.0019777413,0.00022408787,0.007504429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901485,0.00018379494,0.00006932073,0.000201573,0.00046602116,0.00006449336],"domain_scores_gemma":[0.9964652,0.0018291032,0.0002562674,0.00053314527,0.00076526863,0.00015110149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040939,0.0006272759,0.00059551344,0.0015817794,0.00043475852,0.001209285,0.001416429,0.00063807,0.007679409],"category_scores_gemma":[0.009449238,0.0002768185,0.00037181002,0.002449466,0.0004822352,0.0020434745,0.0010483859,0.0010499436,0.0020527744],"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.0010266574,0.00019204876,0.002424495,0.0004983437,0.000049326998,0.0004661196,0.00025098812,0.13465047,0.017893838,0.13305745,0.008708896,0.70078135],"study_design_scores_gemma":[0.00005823956,0.00035794856,0.0012136042,0.00013196327,0.00003591825,0.00077002385,0.00010153517,0.8092074,0.0128328325,0.15904158,0.016201684,0.00004727736],"about_ca_topic_score_codex":0.0007132394,"about_ca_topic_score_gemma":0.0007097725,"teacher_disagreement_score":0.007679409,"about_ca_system_score_codex":0.00050595234,"about_ca_system_score_gemma":0.00052928925,"threshold_uncertainty_score":0.025690138},"labels":[],"label_agreement":null},{"id":"W2997702402","doi":"10.1007/978-3-030-37731-1_18","title":"Towards Accurate Panel Detection in Manga: A Combined Effort of CNN and Heuristics","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Pattern recognition (psychology); Machine learning; Information retrieval; Operating system","score_opus":0.02211368890219727,"score_gpt":0.25072010165949143,"score_spread":0.22860641275729415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997702402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04779609,0.0013299261,0.9231025,0.00035970056,0.00026927431,0.00020525302,0.0011309952,0.018126257,0.007679993],"genre_scores_gemma":[0.27017486,0.0009592386,0.711156,0.0006308007,0.0001940851,0.00012451678,0.0030719603,0.0012366496,0.01245182],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996137,0.000035073474,0.000015103108,0.00014730715,0.000083521474,0.00010523673],"domain_scores_gemma":[0.9994444,0.00015710483,0.000059811387,0.00014052172,0.00014542314,0.000052676754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511743,0.0018921277,0.0018841048,0.0015799354,0.0005918378,0.0018781108,0.0021653676,0.0014114657,0.005502966],"category_scores_gemma":[0.00093390886,0.0010232764,0.0011653661,0.0011157735,0.00036969007,0.0018113393,0.0011224321,0.0012181051,0.0049848496],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031600654,0.00018206914,0.0033055136,0.00025094027,0.00018886769,0.00019093479,0.000066837325,0.036337625,0.077533364,0.0020550578,0.015056274,0.86451644],"study_design_scores_gemma":[0.000017989438,0.000119164644,0.0031032555,0.00004420599,0.000105417785,0.00021032397,0.00009159388,0.9580503,0.027179154,0.0046686134,0.0063748155,0.000035199548],"about_ca_topic_score_codex":0.010235749,"about_ca_topic_score_gemma":0.023552494,"teacher_disagreement_score":0.010235749,"about_ca_system_score_codex":0.0006685819,"about_ca_system_score_gemma":0.0012763311,"threshold_uncertainty_score":0.020352364},"labels":[],"label_agreement":null},{"id":"W2998045344","doi":"10.1007/978-3-030-38081-6_7","title":"Predicting Fishing Effort and Catch Using Semantic Trajectories and Machine Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Marine and fisheries research","field":"Environmental Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fishing; Context (archaeology); Machine learning; Artificial intelligence; Set (abstract data type); Fisheries management; Fishery; Geography","score_opus":0.020694557842444148,"score_gpt":0.23667847262335187,"score_spread":0.21598391478090773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998045344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39503324,0.004440295,0.5620567,0.0019528618,0.00024256624,0.0001199253,0.014205961,0.0030722683,0.018876176],"genre_scores_gemma":[0.68809205,0.0025698843,0.28163898,0.00011329872,0.000111629764,0.00011057869,0.019854058,0.00018905655,0.007320395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998184,0.000035473466,0.000014360021,0.00006633987,0.00005368177,0.000011911871],"domain_scores_gemma":[0.99926454,0.00050617027,0.00006777714,0.00006845774,0.00007160296,0.000021473475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000550252,0.00074213825,0.00033207104,0.0024407345,0.00023108194,0.0012380388,0.00066023064,0.000564781,0.0018567975],"category_scores_gemma":[0.0017741886,0.0001980399,0.0007185955,0.0036522783,0.00027205187,0.002295638,0.00035628592,0.0005298498,0.00092003966],"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.00016926927,0.00024387566,0.0852785,0.00027849548,0.00017466521,0.00041238213,0.000260427,0.4077499,0.0027482063,0.014898297,0.006741494,0.48104456],"study_design_scores_gemma":[0.0000064850806,0.000056013094,0.021993304,0.000065522305,0.000029518515,0.0001237048,0.0001828779,0.94476926,0.0017065337,0.02299728,0.008033033,0.000036402493],"about_ca_topic_score_codex":0.0100978725,"about_ca_topic_score_gemma":0.01543128,"teacher_disagreement_score":0.0100978725,"about_ca_system_score_codex":0.00065302,"about_ca_system_score_gemma":0.0004130778,"threshold_uncertainty_score":0.020078182},"labels":[],"label_agreement":null},{"id":"W2998462594","doi":"10.1007/978-3-319-75650-9","title":"Foundations and Practice of Security","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Université du Québec en Outaouais; Polytechnique Montréal","funders":"","keywords":"Political science; Computer science","score_opus":0.0212237812548117,"score_gpt":0.32554006600520874,"score_spread":0.304316284750397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998462594","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070172925,0.02932583,0.14824486,0.06268885,0.001936133,0.000103785394,0.00019311694,0.00017416241,0.75031596],"genre_scores_gemma":[0.81727886,0.018569602,0.062635005,0.0052786055,0.0024081287,0.00058238435,0.00020977497,0.00019906794,0.092838585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99502015,0.0028121877,0.00021878094,0.0006187456,0.00094990165,0.00038026425],"domain_scores_gemma":[0.9941302,0.0033963774,0.00031932892,0.0012723929,0.00058111566,0.00030050604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005628213,0.00077951356,0.000719843,0.0018309994,0.003284091,0.009076001,0.0019023537,0.0043366896,0.016399385],"category_scores_gemma":[0.0089077875,0.0005686933,0.0006084191,0.0020308904,0.034355406,0.009940656,0.0038787774,0.0053768535,0.0028400724],"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.0000012116523,0.0000037645098,0.000027270618,0.0000129669215,0.0000010525773,0.0000046602763,0.00028950092,0.000096263386,0.000010154119,0.99578047,0.0017105201,0.00206219],"study_design_scores_gemma":[0.0000027219744,0.0000029328057,0.000037321664,0.000051385017,0.0000012699467,0.00001642848,0.00025661537,0.0002215173,0.00002245053,0.9609468,0.0384386,0.0000020639236],"about_ca_topic_score_codex":0.0035139152,"about_ca_topic_score_gemma":0.002369191,"teacher_disagreement_score":0.016399385,"about_ca_system_score_codex":0.004702256,"about_ca_system_score_gemma":0.005420456,"threshold_uncertainty_score":0.054861426},"labels":[],"label_agreement":null},{"id":"W2998501520","doi":"10.1007/978-3-030-37188-3_23","title":"Real Time Static Gesture Detection Using Deep Learning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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":"Laurentian University","funders":"","keywords":"Gesture; Computer science; Gesture recognition; Convolutional neural network; Sign (mathematics); Sign language; Artificial intelligence; Alphabet; Set (abstract data type); American Sign Language; Speech recognition; Deep learning; Task (project management); Pattern recognition (psychology); Computer vision; Mathematics","score_opus":0.016568320344135287,"score_gpt":0.24321418997554553,"score_spread":0.22664586963141026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998501520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0363967,0.0012167835,0.9443685,0.00021282824,0.00034059648,0.00007538005,0.0008366811,0.008673415,0.007879157],"genre_scores_gemma":[0.48450914,0.00124319,0.46559152,0.00046609022,0.0001575752,0.00011749539,0.0021792462,0.0006538633,0.045081917],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964845,0.000019682628,0.00001394664,0.000100907135,0.00014745886,0.00006963584],"domain_scores_gemma":[0.9997304,0.000081926206,0.000024378294,0.000051667354,0.00008626773,0.000025246662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034375375,0.0010435649,0.0010173818,0.00080886594,0.0002444054,0.0008781638,0.0011918033,0.0008326061,0.0086095305],"category_scores_gemma":[0.0006268872,0.0005413301,0.00050895516,0.00091286947,0.0002704619,0.0008926462,0.0010108886,0.00085595774,0.0041282126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025217174,0.00010577922,0.0007518606,0.00010320033,0.00005081779,0.00009238324,0.000019703153,0.012790764,0.079425395,0.0010064433,0.007347051,0.8980544],"study_design_scores_gemma":[0.000015892345,0.00016131849,0.002846903,0.000053313797,0.000043354314,0.00037994471,0.000027593393,0.92206603,0.06456702,0.0030108355,0.0067931646,0.0000345904],"about_ca_topic_score_codex":0.004209523,"about_ca_topic_score_gemma":0.0091148,"teacher_disagreement_score":0.0086095305,"about_ca_system_score_codex":0.00047793429,"about_ca_system_score_gemma":0.0005857353,"threshold_uncertainty_score":0.02880174},"labels":[],"label_agreement":null},{"id":"W2999209598","doi":"10.1007/978-3-030-44223-1_5","title":"Benchmarking Post-quantum Cryptography in TLS","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key exchange; Quantum computer; Network packet; Testbed; Cryptography; Computer network; Distributed computing; Public-key cryptography; Computer engineering; Quantum; Algorithm; Encryption","score_opus":0.013379104501830772,"score_gpt":0.2306112219525647,"score_spread":0.21723211745073392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999209598","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.44211417,0.0049072355,0.27199855,0.004043781,0.0026443582,0.00045270514,0.0030341435,0.020910537,0.24989446],"genre_scores_gemma":[0.9562747,0.0003776736,0.027432602,0.00035433922,0.00015258085,0.00009573849,0.0016095605,0.0011525806,0.012550257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928483,0.0024970903,0.0002807769,0.0004644669,0.0029428215,0.0009665815],"domain_scores_gemma":[0.99072814,0.002972772,0.00027414967,0.0038358099,0.001831284,0.00035786768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00531018,0.0008013902,0.0011970111,0.0010517436,0.00092064554,0.003083635,0.0020322236,0.0018807317,0.026451258],"category_scores_gemma":[0.015922545,0.0002801856,0.00051285664,0.0013170814,0.0018435154,0.005689137,0.003225719,0.001959082,0.0059210435],"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.0040041534,0.0011113277,0.0046110125,0.0013722384,0.00021703725,0.0001972334,0.00030685982,0.20936498,0.024462964,0.48171875,0.050992552,0.22164088],"study_design_scores_gemma":[0.00022237854,0.0014458039,0.0016893225,0.00024570158,0.00008138206,0.00019288236,0.0002329537,0.69108397,0.06728812,0.19487141,0.042541213,0.00010493954],"about_ca_topic_score_codex":0.0006687463,"about_ca_topic_score_gemma":0.000735788,"teacher_disagreement_score":0.026451258,"about_ca_system_score_codex":0.0019295793,"about_ca_system_score_gemma":0.0019067308,"threshold_uncertainty_score":0.08848828},"labels":[],"label_agreement":null},{"id":"W3000128872","doi":"10.1007/978-3-030-38651-1_21","title":"Tuning Runtimes in Open Source FaaS","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Computer science; Dependency (UML); Cloud computing; Service (business); Virtual machine; Open source; Database; Operating system; Software engineering; Software","score_opus":0.020867908684409974,"score_gpt":0.24476008181819156,"score_spread":0.2238921731337816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000128872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28760886,0.0029206546,0.55280924,0.00096463173,0.00090270425,0.00021486609,0.0005045854,0.11421508,0.0398594],"genre_scores_gemma":[0.8103677,0.0002868392,0.17356262,0.00025720365,0.00010253037,0.00007067881,0.0005228946,0.007119964,0.007709579],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99768543,0.0005974152,0.0001444171,0.00048798756,0.0007174591,0.0003673236],"domain_scores_gemma":[0.9946597,0.0023520396,0.00022123748,0.001987642,0.0005108999,0.00026840394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024633058,0.0009688045,0.0005812077,0.00072460476,0.00094207504,0.0021300705,0.0023964457,0.0010494611,0.006538435],"category_scores_gemma":[0.012251357,0.0006750424,0.00061039126,0.00075263454,0.00085656357,0.0034857888,0.0015532232,0.0019916347,0.0019602363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018423931,0.0008033605,0.00743324,0.00039848368,0.00019543398,0.00022692629,0.00075321837,0.22914872,0.07732357,0.0345456,0.028492814,0.6188363],"study_design_scores_gemma":[0.00011680337,0.00017158165,0.0028632157,0.000076751276,0.00007088429,0.0001733772,0.0002042937,0.8974505,0.03912401,0.030591602,0.029079119,0.00007787924],"about_ca_topic_score_codex":0.0028286749,"about_ca_topic_score_gemma":0.004048873,"teacher_disagreement_score":0.006538435,"about_ca_system_score_codex":0.0011179983,"about_ca_system_score_gemma":0.0011046086,"threshold_uncertainty_score":0.021873176},"labels":[],"label_agreement":null},{"id":"W3000817392","doi":"10.1007/978-3-030-39219-2_5","title":"Approximating Modular Decomposition Is Hard","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"Agence Nationale de la Recherche","keywords":"Modular design; Computer science; Modular decomposition; Decomposition; Algebraic number; Graph; Time complexity; Data structure; Neighbourhood (mathematics); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Line graph; Pathwidth","score_opus":0.02567637745108079,"score_gpt":0.2885644326627407,"score_spread":0.26288805521165987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000817392","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.25311232,0.0037823408,0.3336505,0.015273508,0.002030067,0.00024943874,0.002663248,0.0025616563,0.38667694],"genre_scores_gemma":[0.7407411,0.0036102964,0.085461855,0.003146621,0.0018971822,0.00040123245,0.0043753637,0.0017217677,0.15864457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986975,0.00023716154,0.000055609948,0.00033249645,0.00043423902,0.00024296006],"domain_scores_gemma":[0.99596196,0.0022077935,0.0002494005,0.00089565985,0.00034530365,0.00033985233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009352936,0.0020021126,0.0021522339,0.0013387264,0.0016711497,0.0048022172,0.0020590934,0.0017379922,0.024091842],"category_scores_gemma":[0.0069526625,0.0011474928,0.0014625019,0.002903688,0.00219186,0.008430207,0.004697369,0.0076680877,0.0061145606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006592943,0.00024482826,0.0013525957,0.00075216196,0.00011345252,0.0002591055,0.00047813306,0.014956655,0.0060600927,0.7502289,0.089817174,0.13507761],"study_design_scores_gemma":[0.00003891942,0.00003375469,0.00034410038,0.000036584785,0.00003463685,0.0001831975,0.00010309165,0.019007046,0.0011530444,0.96789706,0.011155542,0.000012856596],"about_ca_topic_score_codex":0.0006764241,"about_ca_topic_score_gemma":0.0011120627,"teacher_disagreement_score":0.024091842,"about_ca_system_score_codex":0.0017853753,"about_ca_system_score_gemma":0.00073027227,"threshold_uncertainty_score":0.080595255},"labels":[],"label_agreement":null},{"id":"W3001257962","doi":"10.1007/978-3-642-14785-2","title":"Ad-Hoc, Mobile and Wireless Networks","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Wireless network; Computer network; Ad hoc wireless distribution service; Wireless; Vehicular ad hoc network; Mobile wireless; Set (abstract data type); Optimized Link State Routing Protocol; Telecommunications","score_opus":0.006274591855507203,"score_gpt":0.22260059635936105,"score_spread":0.21632600450385386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001257962","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031500238,0.26042312,0.12074961,0.0023261108,0.03571541,0.0003045188,0.00072209863,0.0019376505,0.57467145],"genre_scores_gemma":[0.01189334,0.105275005,0.026028393,0.0014530144,0.0071846857,0.00021370336,0.00073575764,0.00043949354,0.84677655],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995844,0.000049021193,0.000020631283,0.00007199405,0.00024561983,0.000028399443],"domain_scores_gemma":[0.9995871,0.000144583,0.000024861121,0.0000631975,0.00012246249,0.000057706675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031570197,0.0023244084,0.0014470726,0.0015207409,0.0006348844,0.0023686748,0.0011592236,0.0012285964,0.04010595],"category_scores_gemma":[0.0009913982,0.00055187446,0.00041419332,0.003816676,0.00071274006,0.0038650671,0.0010885571,0.001974118,0.029196944],"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.000064811014,0.00011343402,0.00019623245,0.0013211811,0.000044540688,0.00020749563,0.00011646406,0.0051314468,0.004399974,0.047598902,0.3414439,0.5993617],"study_design_scores_gemma":[0.000012767135,0.00008969794,0.00045047354,0.0002906701,0.000025815125,0.0007066859,0.000060710143,0.0052098283,0.0004878186,0.023555368,0.96908957,0.00002055037],"about_ca_topic_score_codex":0.0006758641,"about_ca_topic_score_gemma":0.0015368653,"teacher_disagreement_score":0.04010595,"about_ca_system_score_codex":0.00054436317,"about_ca_system_score_gemma":0.00067763356,"threshold_uncertainty_score":0.13416773},"labels":[],"label_agreement":null},{"id":"W3002002006","doi":"10.1007/978-3-030-39881-1_27","title":"Parameterized Algorithms for the Happy Set Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Undirected graph; Vertex (graph theory); Mathematics; Graph; Vertex cover; Discrete mathematics; Clique; Set (abstract data type); Integer (computer science); Computer science; Algorithm","score_opus":0.051121854598218316,"score_gpt":0.31060824585989527,"score_spread":0.25948639126167694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002002006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01742235,0.0010549312,0.921515,0.0020796524,0.00033327585,0.0003990654,0.0016154768,0.0025867873,0.052993435],"genre_scores_gemma":[0.13444209,0.00178344,0.81852657,0.00077552156,0.00052526436,0.0013383132,0.006515464,0.0024856103,0.03360776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973757,0.00064811396,0.00014676656,0.0007354372,0.0006913611,0.000402674],"domain_scores_gemma":[0.9943704,0.0033488048,0.00024705246,0.0014439103,0.00031625107,0.0002735659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020967748,0.002133174,0.0024222247,0.0014660207,0.0027414176,0.0062621203,0.007496043,0.0030145266,0.039044127],"category_scores_gemma":[0.009954204,0.0016189866,0.0033230707,0.004525982,0.0020981668,0.014135957,0.0062768734,0.008598934,0.008026792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042261963,0.00054947316,0.00039898124,0.0005939873,0.00009868757,0.00006899194,0.00036005478,0.03971188,0.0025705907,0.6081404,0.0725471,0.27453724],"study_design_scores_gemma":[0.0001899492,0.000057183628,0.00022906742,0.00007355209,0.00005482408,0.00012503067,0.00015741817,0.118267916,0.0013736307,0.85900956,0.020428305,0.00003355819],"about_ca_topic_score_codex":0.0021967022,"about_ca_topic_score_gemma":0.0031568094,"teacher_disagreement_score":0.039044127,"about_ca_system_score_codex":0.0038129252,"about_ca_system_score_gemma":0.003097966,"threshold_uncertainty_score":0.13061559},"labels":[],"label_agreement":null},{"id":"W3002348292","doi":"10.1007/978-3-031-12423-5_13","title":"Sentiment and Knowledge Based Algorithmic Trading with Deep Reinforcement Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Computer science; Headline; Reinforcement learning; Sentiment analysis; Artificial intelligence; Stock market; Algorithmic trading; Machine learning; Trading strategy; Econometrics; Finance","score_opus":0.05491265443772168,"score_gpt":0.3334951326512412,"score_spread":0.2785824782135195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002348292","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.067415684,0.0009619673,0.91764486,0.0006360174,0.00021203057,0.000028754608,0.000060813043,0.00037595487,0.012663871],"genre_scores_gemma":[0.9176373,0.0003730693,0.07208068,0.00012466719,0.000107221276,0.00004387672,0.000074170064,0.000058754766,0.009500294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998222,0.000060671075,0.000009858914,0.000035558478,0.00004323183,0.000028430753],"domain_scores_gemma":[0.99917465,0.00055024814,0.00006713888,0.000067599794,0.00009849979,0.000041745476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072960905,0.0004880476,0.00060578727,0.00024030606,0.00020536003,0.00087129924,0.000919332,0.00080351107,0.0030361516],"category_scores_gemma":[0.0029288044,0.0003574222,0.00036954312,0.00028759043,0.0006613882,0.001159497,0.00079829694,0.0012356797,0.00029412928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012440403,0.000107609034,0.0008234544,0.000053037707,0.000059945905,0.00006834947,0.00004390243,0.8213068,0.0021273016,0.0633148,0.002383907,0.10958636],"study_design_scores_gemma":[0.0000036340264,0.000008461338,0.000049469796,0.0000021157787,0.0000024241401,0.0000047915837,0.0000012593148,0.9841173,0.00012849514,0.015562392,0.000117771495,0.0000018729928],"about_ca_topic_score_codex":0.0020133685,"about_ca_topic_score_gemma":0.0018990836,"teacher_disagreement_score":0.0030361516,"about_ca_system_score_codex":0.0005730827,"about_ca_system_score_gemma":0.0004279989,"threshold_uncertainty_score":0.0101569295},"labels":[],"label_agreement":null},{"id":"W3002788228","doi":"10.1007/978-3-030-40014-9_1","title":"Fourier Spectral Domain Functional Principal Component Analysis of EEG Signals","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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 Guelph; Toronto Metropolitan University","funders":"","keywords":"Computer science; Pattern recognition (psychology); Artificial intelligence; Principal component analysis; Functional principal component analysis; Feature extraction; Electroencephalography; Feature (linguistics); Signal processing; Fourier transform; SIGNAL (programming language); Frequency domain; Speech recognition; Computer vision; Mathematics; Digital signal processing","score_opus":0.0235584288822606,"score_gpt":0.2558635877495776,"score_spread":0.23230515886731704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002788228","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.016562719,0.0029630456,0.96448594,0.00015745315,0.00028580066,0.000041535375,0.00046937866,0.00095475256,0.014079413],"genre_scores_gemma":[0.2655808,0.010028152,0.67309177,0.0001200663,0.0004283871,0.00012734358,0.0020335622,0.00060257746,0.047987312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999411,0.000010457821,0.00000308817,0.000014493652,0.000025222136,0.000005612378],"domain_scores_gemma":[0.9998952,0.00004566812,0.0000062110566,0.000015774114,0.00003421666,0.0000029627715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011151115,0.00035344835,0.00020277416,0.00047178558,0.00010871856,0.0004514608,0.00030434303,0.00023985648,0.005575662],"category_scores_gemma":[0.00048436888,0.00009597841,0.00026268497,0.00072860846,0.00018351719,0.0004766758,0.00016785333,0.0003528237,0.0022081346],"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.00010445577,0.000038438935,0.00018770024,0.0004407737,0.000032443862,0.00013051271,0.00006586536,0.009513605,0.2084422,0.019700067,0.008952667,0.7523913],"study_design_scores_gemma":[0.000018785571,0.0002622656,0.014418417,0.00018420356,0.00009327542,0.0022545462,0.00018530371,0.58345515,0.22733386,0.056473445,0.11523642,0.000084193496],"about_ca_topic_score_codex":0.0003379422,"about_ca_topic_score_gemma":0.0003923418,"teacher_disagreement_score":0.005575662,"about_ca_system_score_codex":0.000100572346,"about_ca_system_score_gemma":0.00015733151,"threshold_uncertainty_score":0.01865244},"labels":[],"label_agreement":null},{"id":"W3002989105","doi":"10.1007/978-3-030-39770-8_13","title":"Weed Density Estimation Using Semantic Segmentation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","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 Regina","funders":"","keywords":"Computer science; Intersection (aeronautics); Segmentation; Weed; Pixel; Artificial intelligence; Field (mathematics); Process (computing); Agriculture; Pattern recognition (psychology); Cartography; Mathematics; Geography; Agronomy","score_opus":0.025510596607321304,"score_gpt":0.23007658510650808,"score_spread":0.20456598849918678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002989105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010695577,0.00023415925,0.98409224,0.00004613257,0.000040253126,0.000033642402,0.00015665156,0.0020385224,0.0026628473],"genre_scores_gemma":[0.30408284,0.000692118,0.6836716,0.00012246436,0.00008389405,0.00009429871,0.0018836358,0.0007348898,0.0086343065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998161,0.000013749862,0.0000072263874,0.00006761307,0.00006289226,0.000032302858],"domain_scores_gemma":[0.99982506,0.00005371106,0.000016158761,0.00003574279,0.000059057777,0.000010278659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028044617,0.00088136346,0.000955163,0.001759435,0.00032200917,0.0008597067,0.00094735494,0.0008461516,0.0030927542],"category_scores_gemma":[0.0006889231,0.0007374616,0.0010596527,0.0016897782,0.00039489302,0.0011005553,0.00095033424,0.0005130319,0.0019706234],"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.00023186141,0.00010894707,0.0014692337,0.00019195864,0.00011311494,0.0001738887,0.0000858972,0.1282694,0.06723077,0.0045613525,0.0052672313,0.79229635],"study_design_scores_gemma":[0.000009619023,0.000025887191,0.0012498539,0.000016246035,0.000036682264,0.00015109322,0.000023555544,0.9794429,0.011196889,0.005166935,0.0026654664,0.000014881976],"about_ca_topic_score_codex":0.00578748,"about_ca_topic_score_gemma":0.008812008,"teacher_disagreement_score":0.00578748,"about_ca_system_score_codex":0.00037059994,"about_ca_system_score_gemma":0.00067993166,"threshold_uncertainty_score":0.01150763},"labels":[],"label_agreement":null},{"id":"W3003329346","doi":"10.1007/978-3-030-44223-1_12","title":"Decryption Failure Is More Likely After Success","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"Correctness; Computer science; Adversary; Standardization; NIST; Encryption; Computer security; Key (lock); Semantic security; Public-key cryptography; Theoretical computer science; Algorithm; Attribute-based encryption; Natural language processing","score_opus":0.011590249955672193,"score_gpt":0.2366903117644272,"score_spread":0.225100061808755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003329346","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.887687,0.0019515455,0.014572517,0.0035716528,0.0010575531,0.00018530576,0.0056905197,0.0007944026,0.08448942],"genre_scores_gemma":[0.98608404,0.00038367874,0.0009674194,0.00035831303,0.0003572674,0.000027784688,0.0013185398,0.00017862757,0.010324289],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797267,0.0003372477,0.00023197227,0.00037170397,0.0004955599,0.0005907271],"domain_scores_gemma":[0.969215,0.01512281,0.0077473465,0.0038486395,0.0015890771,0.0024770806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017589687,0.00040948179,0.0006909124,0.0012658703,0.0007821938,0.0014629604,0.00039009535,0.00123846,0.039411396],"category_scores_gemma":[0.025267944,0.00014261369,0.0005898294,0.0009031219,0.0007708656,0.0017810091,0.001115546,0.0015945825,0.008023307],"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.005707864,0.0007560851,0.74577653,0.0008201339,0.00023314683,0.0058196005,0.0009652127,0.003573112,0.010165179,0.017775852,0.043444145,0.16496316],"study_design_scores_gemma":[0.00038255213,0.0032915985,0.72894764,0.0005998003,0.0006456094,0.053504195,0.0033862148,0.01354764,0.026395645,0.07456781,0.0944666,0.00026462701],"about_ca_topic_score_codex":0.0006438464,"about_ca_topic_score_gemma":0.00060559297,"teacher_disagreement_score":0.039411396,"about_ca_system_score_codex":0.00038331552,"about_ca_system_score_gemma":0.00045749953,"threshold_uncertainty_score":0.13184428},"labels":[],"label_agreement":null},{"id":"W3003473369","doi":"10.1007/978-3-030-38919-2_50","title":"Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Saskatchewan","funders":"","keywords":"Spanner; Computer science; Steiner tree problem; Plane (geometry); Combinatorics; Algorithm; Computational science; Geometry; Mathematics; Database","score_opus":0.01842235744981871,"score_gpt":0.2278014774821379,"score_spread":0.20937912003231918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003473369","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.06783487,0.00026078167,0.8857391,0.00020195606,0.000095771575,0.00015168598,0.0007477754,0.0013550124,0.04361313],"genre_scores_gemma":[0.38154566,0.00094745785,0.5604094,0.0001692196,0.000091729315,0.0002072381,0.0025870728,0.0011644827,0.052877724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997013,0.00004070278,0.000014023856,0.00008243803,0.00012247729,0.000038937364],"domain_scores_gemma":[0.9996886,0.000071830786,0.000034299985,0.000121371704,0.00004674368,0.000037151625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014425917,0.0008291866,0.0008317877,0.00081329216,0.0004826698,0.0010590022,0.0015189751,0.0008515043,0.012170095],"category_scores_gemma":[0.0007268251,0.0005885908,0.0007016767,0.0015525845,0.0006767694,0.0018291267,0.0022474153,0.0013752995,0.0035835104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057760236,0.00023719022,0.00070102833,0.0004338879,0.00009520288,0.0010502723,0.00044587703,0.24997291,0.05649342,0.3076846,0.020404723,0.3619033],"study_design_scores_gemma":[0.00009064207,0.00021296612,0.0009235607,0.00006619214,0.0000743369,0.0013378698,0.00024175274,0.5827743,0.022674717,0.32773644,0.06380916,0.000058064277],"about_ca_topic_score_codex":0.0009456029,"about_ca_topic_score_gemma":0.0014707483,"teacher_disagreement_score":0.012170095,"about_ca_system_score_codex":0.00038095366,"about_ca_system_score_gemma":0.00035973886,"threshold_uncertainty_score":0.04071307},"labels":[],"label_agreement":null},{"id":"W3003526064","doi":"10.1007/978-3-030-45371-8_6","title":"Interpreting Machine Learning Malware Detectors Which Leverage N-gram Analysis","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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 Windsor","funders":"","keywords":"Interpretability; Malware; Machine learning; Computer science; False positive paradox; Artificial intelligence; Leverage (statistics); False positives and false negatives; Domain (mathematical analysis); Computer security; Data mining","score_opus":0.01488328139086341,"score_gpt":0.27162062821451793,"score_spread":0.2567373468236545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003526064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18398686,0.0004891271,0.8019543,0.00094496313,0.00038899222,0.00012428244,0.000398882,0.0052322512,0.00648041],"genre_scores_gemma":[0.8728167,0.00017524627,0.122912854,0.00022407925,0.00017220681,0.000041295552,0.0004202344,0.00040087462,0.0028364377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992404,0.0002043232,0.000044844273,0.00016026947,0.00025160215,0.000098633835],"domain_scores_gemma":[0.99687505,0.0015200482,0.0003845812,0.0005299882,0.0005569589,0.00013334354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014605083,0.0012963747,0.00078127376,0.0016116351,0.0005367901,0.0019704415,0.0007549069,0.0019814738,0.0022230463],"category_scores_gemma":[0.009230287,0.00044309153,0.00067513407,0.0005738991,0.0008073947,0.0023622664,0.001381974,0.0013540295,0.0013180238],"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.0018521763,0.00046111352,0.018642224,0.00033987607,0.00021922046,0.0029196183,0.00043067615,0.18148977,0.35469815,0.0443182,0.011732674,0.38289633],"study_design_scores_gemma":[0.000014318713,0.000094726835,0.0018461529,0.00002085396,0.000038233375,0.0003313561,0.00007192026,0.9170504,0.042229522,0.036849473,0.0014294264,0.00002349047],"about_ca_topic_score_codex":0.0009358645,"about_ca_topic_score_gemma":0.0013199319,"teacher_disagreement_score":0.0022230463,"about_ca_system_score_codex":0.00048298138,"about_ca_system_score_gemma":0.0006262634,"threshold_uncertainty_score":0.007723987},"labels":[],"label_agreement":null},{"id":"W3003540023","doi":"10.1007/978-3-030-39951-1_18","title":"Strongly Minimal MapReduce Algorithms: A TeraSort Case Study","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","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","funders":"","keywords":"Computer science; Load balancing (electrical power); Algorithm; Skew; Partition (number theory); Sorting algorithm; Parallel computing; Big data; Sorting; Multiplicative function; Parallel algorithm; Theoretical computer science; Mathematics; Data mining","score_opus":0.026719733449256978,"score_gpt":0.27465729748188533,"score_spread":0.24793756403262834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003540023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.422685,0.0027604129,0.48161703,0.0051125633,0.0001443068,0.00031960104,0.0009425629,0.001055891,0.08536265],"genre_scores_gemma":[0.75591016,0.0015595554,0.22241808,0.00040498064,0.00022218301,0.00018882159,0.0007379647,0.00051612704,0.018042114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981128,0.0006046309,0.00014079483,0.00023262163,0.00055952027,0.00034979105],"domain_scores_gemma":[0.9899357,0.007371219,0.00035777278,0.0011546256,0.0007786208,0.00040206607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029962754,0.0006329167,0.0009832592,0.000741153,0.0014132626,0.0026637525,0.0022549392,0.0014387594,0.0038661337],"category_scores_gemma":[0.012368666,0.00046639104,0.0009683934,0.0025261263,0.0015810506,0.0047958842,0.0020697885,0.0021361813,0.00056286954],"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.0007915057,0.00073675293,0.0026112339,0.0006521296,0.00010106387,0.0007461965,0.00072083075,0.089327574,0.0037210577,0.796451,0.015215204,0.08892552],"study_design_scores_gemma":[0.00011874647,0.00021311756,0.00094374246,0.000058288828,0.00007275647,0.001033279,0.00058761064,0.3236008,0.0036754857,0.65987706,0.009793573,0.000025623433],"about_ca_topic_score_codex":0.0024688882,"about_ca_topic_score_gemma":0.0032103474,"teacher_disagreement_score":0.0038661337,"about_ca_system_score_codex":0.0012271887,"about_ca_system_score_gemma":0.0017692483,"threshold_uncertainty_score":0.015846014},"labels":[],"label_agreement":null},{"id":"W3003706366","doi":"10.1007/978-3-030-51310-8_10","title":"Enhancement of Short Text Clustering by Iterative Classification","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Cluster analysis; CURE data clustering algorithm; Pattern recognition (psychology); Correlation clustering; Computer science; Single-linkage clustering; Outlier; Artificial intelligence; Canopy clustering algorithm; Data mining; Hierarchical clustering","score_opus":0.02989990342643889,"score_gpt":0.29519910866141097,"score_spread":0.2652992052349721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003706366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04492487,0.0015159837,0.9378233,0.0003991817,0.000744372,0.00026735006,0.0012774314,0.010317083,0.0027304573],"genre_scores_gemma":[0.21096048,0.0008016787,0.7628498,0.00027537646,0.0006709643,0.00028192738,0.0064913314,0.0014652162,0.016203236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760675,0.00043518347,0.00022620405,0.0006466948,0.00084314495,0.0002420295],"domain_scores_gemma":[0.9950106,0.001178366,0.0002701666,0.0007662555,0.0026003646,0.00017418069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016303741,0.001624854,0.0019016793,0.005627775,0.0011170002,0.0018383267,0.0018898103,0.0016185506,0.005779833],"category_scores_gemma":[0.005276912,0.00047046418,0.0017004577,0.004767381,0.0004988472,0.0020158053,0.0016083461,0.0012017373,0.00891247],"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.0007091426,0.00029384272,0.0018630272,0.00028101818,0.00015650998,0.00012337916,0.00014577084,0.009862997,0.08500658,0.0013592212,0.014447407,0.8857511],"study_design_scores_gemma":[0.0000672474,0.00035526272,0.005444705,0.0000394145,0.00022999979,0.0004366994,0.00020787312,0.8962077,0.07678062,0.005611341,0.014536538,0.00008258534],"about_ca_topic_score_codex":0.004705004,"about_ca_topic_score_gemma":0.0075626504,"teacher_disagreement_score":0.005779833,"about_ca_system_score_codex":0.0005069009,"about_ca_system_score_gemma":0.0013906758,"threshold_uncertainty_score":0.019335449},"labels":[],"label_agreement":null},{"id":"W3003900572","doi":"10.1007/978-3-030-51938-4_5","title":"Impossible Differential Cryptanalysis of Reduced-Round Tweakable TWINE","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Arithmetic; Mathematics; Algorithm; Cryptography","score_opus":0.026971593269661996,"score_gpt":0.3009952814354262,"score_spread":0.2740236881657642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003900572","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.5256956,0.0008289456,0.41530022,0.0021389518,0.00047505499,0.00016618581,0.00035405066,0.00085625326,0.054184705],"genre_scores_gemma":[0.9541818,0.00019017454,0.02938238,0.00016776715,0.000056857585,0.00004100746,0.00011225972,0.00009425768,0.015773462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985447,0.00028480767,0.00007495976,0.00022627578,0.00053935824,0.00032995915],"domain_scores_gemma":[0.9989292,0.0004344746,0.00008066039,0.0003583616,0.00012816134,0.00006925017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009167831,0.0005806285,0.00069898507,0.0007228302,0.0008154883,0.0019731468,0.00082689716,0.0013426355,0.009873895],"category_scores_gemma":[0.003372762,0.00041021573,0.000744319,0.00062477123,0.0016307995,0.0032664137,0.0026404923,0.0019220356,0.0015848451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014043105,0.00012610549,0.0014824189,0.00027718494,0.0001192584,0.0013413476,0.0006107122,0.016986055,0.046504557,0.8783709,0.0030627362,0.04971452],"study_design_scores_gemma":[0.00020602408,0.0004464094,0.0013725897,0.0001316924,0.00012463001,0.0024429397,0.00027961185,0.15454704,0.11437871,0.7049331,0.020988753,0.00014854991],"about_ca_topic_score_codex":0.00019607026,"about_ca_topic_score_gemma":0.00025928306,"teacher_disagreement_score":0.009873895,"about_ca_system_score_codex":0.00075097923,"about_ca_system_score_gemma":0.0006844717,"threshold_uncertainty_score":0.033031464},"labels":[],"label_agreement":null},{"id":"W3005830511","doi":"10.1007/978-3-030-38085-4_22","title":"Intrinsically Resilient Optical Backbones: An Efficient Ring-Based Interconnection Paradigm","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Network topology; Computer science; Interconnection; Distributed computing; Disjoint sets; Topology (electrical circuits); Computer network; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.011608028974707167,"score_gpt":0.2253666463884457,"score_spread":0.21375861741373853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005830511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09797935,0.0033051744,0.8332627,0.0011869625,0.00055953994,0.00011927241,0.0003702642,0.002417292,0.0607994],"genre_scores_gemma":[0.7175029,0.0027744798,0.2549947,0.00024629876,0.00031288553,0.000092336406,0.0003059989,0.0001818164,0.023588724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984264,0.000029738383,0.0000066767907,0.00004034662,0.000050326325,0.00003032067],"domain_scores_gemma":[0.9997882,0.000050294464,0.000031557927,0.00006994558,0.000041518128,0.000018520976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032064444,0.0003804307,0.00029516616,0.00048524718,0.00054802303,0.00095983234,0.0013223271,0.0005197439,0.0042186216],"category_scores_gemma":[0.0005046644,0.0002661648,0.00024375311,0.0005787591,0.00040380284,0.0018612577,0.0007678011,0.0006474652,0.00094720017],"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.00033427303,0.00016729374,0.00033621173,0.0003590596,0.0000688866,0.00017665233,0.00016743531,0.11241768,0.11567706,0.41199562,0.024231771,0.33406806],"study_design_scores_gemma":[0.000047391928,0.00039943054,0.0005011697,0.0000735161,0.000081978746,0.0005797702,0.0000926566,0.64295316,0.04909143,0.22471106,0.081410445,0.000057979483],"about_ca_topic_score_codex":0.00030224147,"about_ca_topic_score_gemma":0.00071593246,"teacher_disagreement_score":0.0042186216,"about_ca_system_score_codex":0.00049673335,"about_ca_system_score_gemma":0.0003729547,"threshold_uncertainty_score":0.014112651},"labels":[],"label_agreement":null},{"id":"W3006084474","doi":"10.1007/978-3-030-64834-3_22","title":"Improved Classical and Quantum Algorithms for Subset-Sum","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Agence Nationale de la Recherche","keywords":"Quantum walk; Heuristics; Quantum algorithm; Quantum; Mathematics; Random walk; Heuristic; Tilde; Algorithm; Discrete mathematics; Combinatorics; Physics; Quantum mechanics; Mathematical optimization; Statistics","score_opus":0.023886456644541205,"score_gpt":0.27599954598195897,"score_spread":0.2521130893374178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006084474","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.06902642,0.0009482143,0.88236815,0.0024172375,0.00074419455,0.00022553084,0.0005419529,0.001608082,0.04212022],"genre_scores_gemma":[0.47484702,0.0007266774,0.49008492,0.0008262693,0.00082811876,0.0003670928,0.0008998386,0.0008860543,0.030534057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963104,0.0010772481,0.00020837355,0.000561698,0.0014252777,0.00041705737],"domain_scores_gemma":[0.99483573,0.002291938,0.00017192135,0.0017368466,0.00067655294,0.00028696176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009023,0.0011980799,0.0021561629,0.0014260943,0.002238527,0.004300639,0.0041971747,0.0013534436,0.014027151],"category_scores_gemma":[0.010165703,0.00070372794,0.0020455662,0.0025830374,0.0027315866,0.008151042,0.0071489364,0.0045834095,0.0027614238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048823774,0.00021865702,0.0004674864,0.00020012657,0.00008301232,0.000054691478,0.0002506461,0.02912519,0.002585799,0.85258055,0.009389813,0.10455594],"study_design_scores_gemma":[0.00007636508,0.000046895755,0.00016748799,0.000021436743,0.000037042762,0.000051955823,0.000047186415,0.13393612,0.0029114422,0.85928154,0.0033940538,0.000028532093],"about_ca_topic_score_codex":0.0012750766,"about_ca_topic_score_gemma":0.0025317266,"teacher_disagreement_score":0.014027151,"about_ca_system_score_codex":0.00235835,"about_ca_system_score_gemma":0.002367206,"threshold_uncertainty_score":0.046925485},"labels":[],"label_agreement":null},{"id":"W3006101259","doi":"","title":"Deep Convolutional Networks for Automated Detection of Epileptogenic Brain Malformations","year":2018,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Convolutional neural network; Computer science; Cortical dysplasia; Artificial intelligence; Voxel; Pattern recognition (psychology); Magnetic resonance imaging; Medicine; Radiology","score_opus":0.008580735068186154,"score_gpt":0.28663051307550913,"score_spread":0.278049778007323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006101259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40256634,0.0043990994,0.57089955,0.00076989294,0.00020345129,0.00027145952,0.0029914018,0.013586244,0.004312516],"genre_scores_gemma":[0.84618723,0.0006216208,0.14338571,0.00024171741,0.000059332873,0.00018600134,0.0047951676,0.00020651145,0.0043167085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.00010373855,0.000035692483,0.00015911288,0.00012597721,0.00008954547],"domain_scores_gemma":[0.9993218,0.0002937803,0.00009619734,0.00008608531,0.00016803377,0.00003401295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011847669,0.0013004581,0.0007016269,0.0012454694,0.0003052721,0.0005516288,0.0011067864,0.0007771305,0.0011119456],"category_scores_gemma":[0.002128576,0.0004261656,0.0005808389,0.00073424744,0.00028533046,0.0005109069,0.00083820627,0.00089438516,0.0006401345],"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.0006957725,0.000378044,0.012618558,0.0001840274,0.0003212,0.0003456281,0.00010733713,0.27997774,0.042159867,0.0018977757,0.015032173,0.64628184],"study_design_scores_gemma":[0.000015921345,0.000038991955,0.0026820796,0.000011693292,0.000023324877,0.000046060624,0.000010847271,0.98868513,0.0065998817,0.00094540516,0.0009302165,0.000010412903],"about_ca_topic_score_codex":0.01560183,"about_ca_topic_score_gemma":0.017918393,"teacher_disagreement_score":0.01560183,"about_ca_system_score_codex":0.0011126461,"about_ca_system_score_gemma":0.0010374789,"threshold_uncertainty_score":0.031022072},"labels":[],"label_agreement":null},{"id":"W3006916224","doi":"10.1007/978-3-030-45231-5_10","title":"General Supervised Learning as Change Propagation with Delta Lenses","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lens (geology); Computer science; Functor; Delta; Parameterized complexity; Subcategory; Space (punctuation); Through-the-lens metering; Artificial intelligence; Algorithm; Mathematics; Pure mathematics; Optics; Physics","score_opus":0.024735960782958043,"score_gpt":0.23223588902390183,"score_spread":0.2074999282409438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006916224","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.017544769,0.00038101262,0.97308874,0.00056465727,0.000039596736,0.00003777223,0.00009589638,0.00043274352,0.007814764],"genre_scores_gemma":[0.7392623,0.0007773389,0.23881811,0.000500015,0.00019950373,0.00015496937,0.00043457013,0.00029279038,0.01956047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985537,0.00042473484,0.000100962105,0.00040387572,0.00042932245,0.00008734992],"domain_scores_gemma":[0.99693537,0.0016282779,0.00026743615,0.00059929764,0.00041439812,0.00015522244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022643253,0.0005136083,0.00048317225,0.0009933913,0.0004065074,0.0017392634,0.0011604175,0.00093388354,0.0040729493],"category_scores_gemma":[0.005791946,0.00038299043,0.0010818692,0.0009082668,0.0019958008,0.0051193507,0.0030361416,0.0017040092,0.0005653926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004825484,0.000030828305,0.00075799983,0.00010852763,0.000048017777,0.00013731665,0.00017996239,0.06542153,0.002375747,0.87211907,0.0017206131,0.057052102],"study_design_scores_gemma":[0.000006724332,0.000026728765,0.00015924816,0.000017444187,0.000012215331,0.00007164595,0.000030555966,0.39608768,0.0014801372,0.5975145,0.004584355,0.000008836785],"about_ca_topic_score_codex":0.0013122138,"about_ca_topic_score_gemma":0.0011118995,"teacher_disagreement_score":0.0040729493,"about_ca_system_score_codex":0.0019100133,"about_ca_system_score_gemma":0.0006853787,"threshold_uncertainty_score":0.013858199},"labels":[],"label_agreement":null},{"id":"W3008205532","doi":"10.1007/978-3-030-40608-0_13","title":"Alternating Finite Automata with Limited Universal Branching","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Computation; Bounded function; Tree (set theory); Automaton; Finite-state machine; Mathematics; Branching (polymer chemistry); Discrete mathematics; Algorithm; Computer science; Combinatorics; Theoretical computer science","score_opus":0.012989202170072269,"score_gpt":0.21414007564872947,"score_spread":0.2011508734786572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008205532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747853,0.0013934382,0.77586234,0.0005611822,0.00039758877,0.00009258468,0.00048553027,0.0019223415,0.15180643],"genre_scores_gemma":[0.7334662,0.0011157735,0.17757335,0.0002640416,0.0002343363,0.00032103152,0.0006911741,0.0006364969,0.08569767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.00018878392,0.000056556477,0.0001534637,0.00018472015,0.000073415526],"domain_scores_gemma":[0.99816704,0.0011346121,0.00006657219,0.0003372579,0.000195486,0.00009905444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215582,0.00064698374,0.00056531903,0.00056182,0.0008594351,0.0016376363,0.0012183198,0.0008361824,0.009864042],"category_scores_gemma":[0.0027937323,0.0005733133,0.00066401146,0.0007407855,0.0016149983,0.004481623,0.0021342137,0.0020910725,0.0025041397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064826905,0.000030472615,0.00014210361,0.0000873252,0.0000064911565,0.000135398,0.00028017606,0.0049345703,0.004846674,0.95676494,0.00169359,0.031013424],"study_design_scores_gemma":[0.000008695529,0.000019668694,0.000059418904,0.00002027347,0.000008377574,0.00017134029,0.000038324928,0.021474954,0.0029929064,0.96330875,0.011886009,0.000011402163],"about_ca_topic_score_codex":0.0003880219,"about_ca_topic_score_gemma":0.0004905204,"teacher_disagreement_score":0.009864042,"about_ca_system_score_codex":0.00069275626,"about_ca_system_score_gemma":0.00053570984,"threshold_uncertainty_score":0.032998502},"labels":[],"label_agreement":null},{"id":"W3008920641","doi":"10.1007/978-3-030-48478-1_10","title":"Iterated Global Models for Complex Networks","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Iterated function; Node (physics); Focus (optics); Clique; Graph; Cardinality (data modeling); Chromatic scale; Computer science; Mathematics; Dominating set; Set (abstract data type); Discrete mathematics; Combinatorics; Vertex (graph theory); Data mining","score_opus":0.03591934002647342,"score_gpt":0.3052556370190101,"score_spread":0.2693362969925367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008920641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111016,0.0013862198,0.86342096,0.0027207322,0.00015702864,0.00005713239,0.00044237715,0.00033046876,0.020469053],"genre_scores_gemma":[0.9149677,0.0020271654,0.039926816,0.00042809075,0.0005152495,0.00030988365,0.00049912836,0.00026526288,0.0410607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.00033618722,0.000023444203,0.00017659515,0.00012411957,0.00008172201],"domain_scores_gemma":[0.99388146,0.0039053017,0.0008207008,0.0005260435,0.0003744689,0.0004919863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018140242,0.0012753529,0.0015478154,0.001445289,0.0006947013,0.0026820377,0.0020159972,0.002022138,0.007661719],"category_scores_gemma":[0.008989064,0.0007218345,0.0013572334,0.0010022045,0.0022396808,0.004697853,0.002164767,0.002650454,0.0006285237],"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.000024097535,0.00002291817,0.00042430352,0.00005098588,0.000051390132,0.00009648937,0.00014341122,0.10173671,0.00053994864,0.8917345,0.0017636078,0.0034115603],"study_design_scores_gemma":[0.00001043147,0.000013113039,0.00015723579,0.000010429541,0.000014735865,0.000036872054,0.000026409083,0.39122167,0.00006799242,0.60746086,0.00096874457,0.0000115990315],"about_ca_topic_score_codex":0.002929146,"about_ca_topic_score_gemma":0.0032563861,"teacher_disagreement_score":0.007661719,"about_ca_system_score_codex":0.0016750739,"about_ca_system_score_gemma":0.00064857194,"threshold_uncertainty_score":0.02563107},"labels":[],"label_agreement":null},{"id":"W3008953071","doi":"10.1007/978-3-030-41568-6_11","title":"WPA3 Connection Deprivation Attacks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"Queen's University","funders":"","keywords":"Denial-of-service attack; Computer security; Computer science; Exploit; Secrecy; Password; Authentication (law); Computer network; Operating system","score_opus":0.02385582447283554,"score_gpt":0.27882939184820543,"score_spread":0.2549735673753699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008953071","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09753891,0.0018047458,0.29395676,0.0046826433,0.0012484386,0.00050502975,0.0013058252,0.010321075,0.58863664],"genre_scores_gemma":[0.81661403,0.0015923935,0.03882699,0.0015055236,0.00034954798,0.00039290413,0.0013662849,0.001109505,0.13824268],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857473,0.00026054084,0.000057160727,0.0001319517,0.000678093,0.00029760486],"domain_scores_gemma":[0.9968663,0.00078241486,0.00017042557,0.0017197834,0.0003172563,0.0001438358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093681057,0.00077644165,0.00060578925,0.00084568537,0.0016008598,0.0021495025,0.0012733593,0.0020443401,0.01892293],"category_scores_gemma":[0.0037167862,0.00036535796,0.00075384043,0.0014848255,0.0009380892,0.0030004936,0.0036941706,0.0033943083,0.008970313],"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.0010810173,0.00027146764,0.0014610083,0.00040104706,0.000117581076,0.0017660988,0.0005913857,0.015760362,0.03653857,0.36431682,0.1632674,0.4144272],"study_design_scores_gemma":[0.0001351463,0.00031874428,0.0026559061,0.0002566691,0.00016059,0.006578011,0.0003494,0.22174226,0.085949376,0.3312044,0.35054037,0.00010918626],"about_ca_topic_score_codex":0.0006672067,"about_ca_topic_score_gemma":0.0006876601,"teacher_disagreement_score":0.01892293,"about_ca_system_score_codex":0.0009815169,"about_ca_system_score_gemma":0.00066504255,"threshold_uncertainty_score":0.06330347},"labels":[],"label_agreement":null},{"id":"W3009019702","doi":"10.1007/978-3-030-42835-8_10","title":"Cross-Level Matching Model for Information Retrieval","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université de Montréal","funders":"","keywords":"Computer science; Matching (statistics); Information retrieval; Artificial intelligence; Statistics; Mathematics","score_opus":0.045019070994389516,"score_gpt":0.27833373218575,"score_spread":0.23331466119136052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009019702","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.0087166345,0.0028331496,0.983343,0.00039880513,0.00016016595,0.00004805295,0.0005382686,0.0013994252,0.0025624144],"genre_scores_gemma":[0.4443248,0.004640436,0.48497227,0.0007304963,0.0005921678,0.00046389332,0.005409931,0.000928888,0.05793713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868387,0.00052984204,0.000094394534,0.00031280814,0.0002407614,0.00013837055],"domain_scores_gemma":[0.9983052,0.00095348683,0.00009733628,0.00033158227,0.00026341894,0.000049018257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028118466,0.00072554586,0.0019454114,0.001338871,0.00049290113,0.0017210246,0.0034201515,0.0023552007,0.010814857],"category_scores_gemma":[0.0051935525,0.0005099664,0.0016261264,0.0029274945,0.0005437554,0.0038147876,0.0014413155,0.0019229458,0.006226409],"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.00063385704,0.0004317619,0.0019217639,0.0006456257,0.0004710125,0.0002227315,0.00018893804,0.25385615,0.007092749,0.110713206,0.026299797,0.5975224],"study_design_scores_gemma":[0.000013188397,0.000048045058,0.00036008633,0.0000114129325,0.00006161341,0.00006664285,0.000011375389,0.96610725,0.0007731459,0.029594032,0.0029388885,0.000014308567],"about_ca_topic_score_codex":0.0058266735,"about_ca_topic_score_gemma":0.004092312,"teacher_disagreement_score":0.010814857,"about_ca_system_score_codex":0.0010569849,"about_ca_system_score_gemma":0.0009344946,"threshold_uncertainty_score":0.036179245},"labels":[],"label_agreement":null},{"id":"W3010016474","doi":"10.1007/11534273","title":"Algorithms and Data Structures","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","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":"Computer science; Data structure; Theoretical computer science; Programming language","score_opus":0.02530740534750959,"score_gpt":0.27250278019102586,"score_spread":0.24719537484351628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010016474","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032694128,0.024584696,0.7666313,0.005911205,0.0023022306,0.0002547998,0.0030234114,0.006073442,0.18794945],"genre_scores_gemma":[0.055199362,0.032229077,0.61288065,0.003111,0.0033400035,0.0010982853,0.011074996,0.005007901,0.27605876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786586,0.0003348848,0.00019824537,0.0005050561,0.0009800731,0.00011584477],"domain_scores_gemma":[0.9972082,0.0009181293,0.00008242079,0.0013791156,0.00032308738,0.00008910622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779599,0.0019897134,0.0024666332,0.0028046558,0.0018443598,0.007574348,0.0028154494,0.0015627533,0.043488532],"category_scores_gemma":[0.004960009,0.0017148734,0.0015797203,0.009714969,0.0028228464,0.013091469,0.003817115,0.005576643,0.03592772],"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.0000354426,0.00005481438,0.00017267968,0.0005020726,0.000040558873,0.00003538215,0.00019377717,0.002333221,0.00092921103,0.5227688,0.13651505,0.3364189],"study_design_scores_gemma":[0.00001611589,0.000015629712,0.00013044843,0.00012523838,0.000025109666,0.00017486652,0.000048972357,0.005827345,0.0010451751,0.71538574,0.27718863,0.000016823398],"about_ca_topic_score_codex":0.00088517636,"about_ca_topic_score_gemma":0.0009179268,"teacher_disagreement_score":0.043488532,"about_ca_system_score_codex":0.0020242126,"about_ca_system_score_gemma":0.001958781,"threshold_uncertainty_score":0.14548361},"labels":[],"label_agreement":null},{"id":"W3010659905","doi":"10.1007/978-3-030-48516-0_7","title":"The State Complexity of Lexicographically Smallest Words and Computing Successors","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Alphabet; Word (group theory); State (computer science); Upper and lower bounds; Regular language; Successor cardinal; Discrete mathematics; Finite-state machine; Matching (statistics); Finite set; Algorithm; Automaton; Computer science; Geometry","score_opus":0.027792817311278778,"score_gpt":0.26906938661235347,"score_spread":0.2412765693010747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010659905","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.70659226,0.0014013364,0.25815558,0.0046389364,0.00014768724,0.00013822032,0.002865274,0.00092117133,0.025139585],"genre_scores_gemma":[0.95166296,0.00056586706,0.040338006,0.0001640127,0.00019127467,0.00013612206,0.0016782354,0.00028413517,0.004979395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572575,0.001034021,0.00040128888,0.0009482867,0.00126221,0.00062836293],"domain_scores_gemma":[0.9298513,0.060197253,0.0022581317,0.004433921,0.0019271199,0.0013322532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029482169,0.00068974664,0.0017150015,0.0029759451,0.0019186803,0.009603051,0.0030164933,0.0021414298,0.011859628],"category_scores_gemma":[0.03655278,0.001110643,0.002371674,0.0037845427,0.0040837815,0.02146669,0.00318485,0.003660836,0.0008541974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001444952,0.00026693262,0.008507467,0.0005856145,0.00012457612,0.00025491373,0.001530066,0.11414475,0.0060015437,0.8075461,0.005177465,0.05441559],"study_design_scores_gemma":[0.00003247867,0.00003519788,0.0008469393,0.000030903237,0.000046717974,0.000084036394,0.00015446593,0.16273296,0.0022207997,0.83305657,0.00072507665,0.000033971133],"about_ca_topic_score_codex":0.0030663365,"about_ca_topic_score_gemma":0.0032956786,"teacher_disagreement_score":0.011859628,"about_ca_system_score_codex":0.0034417117,"about_ca_system_score_gemma":0.0025999434,"threshold_uncertainty_score":0.0396744},"labels":[],"label_agreement":null},{"id":"W3010859330","doi":"10.1007/978-3-030-41600-3_2","title":"Uncertainty, Modeling and Safety Assurance: Towards a Unified Framework","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"University of Toronto","funders":"","keywords":"Computer science; Safety assurance; Set (abstract data type); Software; Software engineering; Software system; System safety; Software quality assurance; Risk analysis (engineering); Systems engineering; Software construction; Reliability engineering; Programming language; Engineering","score_opus":0.013887232295379262,"score_gpt":0.2177895967963504,"score_spread":0.20390236450097116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010859330","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.001379077,0.005561742,0.97475535,0.0031128332,0.0002496442,0.000021504618,0.00006130778,0.00020273874,0.014655727],"genre_scores_gemma":[0.26960924,0.020634267,0.6851445,0.0019770735,0.0025793093,0.00037315136,0.00037093414,0.0004067777,0.018904787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997614,0.0009046407,0.00016803175,0.00025670184,0.0009064171,0.00015011919],"domain_scores_gemma":[0.9972704,0.0016904675,0.00020374871,0.0004194542,0.00031577027,0.000100106074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038020788,0.0017838954,0.0019033661,0.0021477777,0.00094490574,0.005850521,0.0031155222,0.0035150542,0.0025911075],"category_scores_gemma":[0.0047557326,0.0011885773,0.0018746129,0.0020669864,0.006434111,0.009081123,0.0035666635,0.005926039,0.0008652585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075158387,0.000014561376,0.00005256871,0.00008498417,0.000017492323,0.000027458154,0.00010719446,0.019496856,0.0003289156,0.9635702,0.0016103025,0.014681945],"study_design_scores_gemma":[0.0000032208736,0.000011438542,0.000031188214,0.000060282775,0.000013941531,0.000026039552,0.000033747434,0.0456186,0.0002591206,0.94216835,0.011762253,0.0000118002],"about_ca_topic_score_codex":0.0029227745,"about_ca_topic_score_gemma":0.0018658752,"teacher_disagreement_score":0.005850521,"about_ca_system_score_codex":0.0019799138,"about_ca_system_score_gemma":0.002541823,"threshold_uncertainty_score":0.020107567},"labels":[],"label_agreement":null},{"id":"W3010953995","doi":"10.1007/978-3-030-43687-2_60","title":"Exploring Open Data Initiatives in Higher Education","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","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 British Columbia","funders":"","keywords":"Open data; Computer science; Download; Redistribution (election); Open education; Data science; Open research; World Wide Web; Political science","score_opus":0.29152442667227707,"score_gpt":0.36528793516706815,"score_spread":0.07376350849479107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010953995","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.28995898,0.0073206373,0.012894192,0.051362865,0.00047515065,0.00009219617,0.00034975386,0.00013157977,0.6374147],"genre_scores_gemma":[0.95348537,0.002866764,0.0043395534,0.0014402607,0.000076072356,0.000057976475,0.00017834152,0.000096723954,0.037458837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9957236,0.0024027368,0.0000876861,0.00027695645,0.0006659693,0.0008429157],"domain_scores_gemma":[0.9892686,0.007152438,0.0006558772,0.00033808785,0.00066253537,0.0019224483],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.006667232,0.00024327157,0.00020935964,0.0020607,0.0055647874,0.018563462,0.0013547364,0.0017895995,0.015853781],"category_scores_gemma":[0.008913565,0.00022945004,0.0003006003,0.0070764325,0.006206663,0.017232995,0.009049319,0.0031742544,0.0010442999],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037438884,0.00014185238,0.009162702,0.00013706557,0.000006038775,0.00021717917,0.041230917,0.00025583323,0.00019267689,0.8538994,0.010024318,0.0846944],"study_design_scores_gemma":[0.000012313647,0.00006547626,0.01346139,0.0008295582,0.000015372065,0.00016020765,0.33172184,0.0011132541,0.00084430457,0.19148882,0.46026245,0.000025051204],"about_ca_topic_score_codex":0.009462856,"about_ca_topic_score_gemma":0.022989588,"teacher_disagreement_score":0.99864525,"about_ca_system_score_codex":0.010045073,"about_ca_system_score_gemma":0.01061431,"threshold_uncertainty_score":0.072882414},"labels":[],"label_agreement":null},{"id":"W301125580","doi":"10.1007/978-3-642-40261-6_44","title":"On Achieving Near-Optimal “Anti-Bayesian” Order Statistics-Based Classification for Asymmetric Exponential Distributions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Exponential family; Order statistic; Bayesian probability; Natural exponential family; Computer science; Exponential function; Exponential distribution; Beta distribution; Bayes' theorem; Gamma distribution; Probability distribution; Bayesian statistics; Statistics; Mathematics; Applied mathematics; Bayesian inference; Mathematical analysis","score_opus":0.019986934837925505,"score_gpt":0.27215613209919676,"score_spread":0.25216919726127124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W301125580","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.020167064,0.00053413055,0.97444654,0.00063540734,0.00008026653,0.00006058582,0.00012858595,0.000910468,0.003036952],"genre_scores_gemma":[0.37488577,0.00096574053,0.6130855,0.0011758818,0.000441312,0.0002557604,0.0013633239,0.00044267098,0.0073841154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942941,0.0023623852,0.00036722366,0.0007409376,0.0016730536,0.0005623633],"domain_scores_gemma":[0.98564446,0.010325799,0.0006216271,0.0017757898,0.0011682233,0.00046409186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060687866,0.0019614347,0.0032679213,0.0017766537,0.0014657254,0.003117035,0.003736746,0.0032150445,0.0030852314],"category_scores_gemma":[0.02006704,0.0011760057,0.0017285855,0.0020715836,0.0026568929,0.0055412706,0.005146215,0.004868466,0.0018586648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009098819,0.0004778773,0.0025007622,0.00039807634,0.00019926521,0.00016601951,0.00050074584,0.3100665,0.00943618,0.26058275,0.017686255,0.39707562],"study_design_scores_gemma":[0.000028136727,0.00005447788,0.00020215966,0.000020493637,0.000016644406,0.00005990823,0.000029625946,0.8718752,0.0015579598,0.12523867,0.00089541316,0.000021152384],"about_ca_topic_score_codex":0.0036233652,"about_ca_topic_score_gemma":0.005777945,"teacher_disagreement_score":0.0060687866,"about_ca_system_score_codex":0.0020636173,"about_ca_system_score_gemma":0.0035669464,"threshold_uncertainty_score":0.032095194},"labels":[],"label_agreement":null},{"id":"W3011711392","doi":"10.1007/978-3-030-43120-4_8","title":"Comprehensive LU Factors of Polynomial Matrices","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"LU decomposition; Maple; Classification of discontinuities; Computer science; Polynomial; Decomposition; Factorization; Matrix decomposition; Parametric statistics; Polynomial matrix; Matrix (chemical analysis); Algebra over a field; Algorithm; Applied mathematics; Matrix polynomial; Mathematics; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.019533071307104886,"score_gpt":0.23856634245085412,"score_spread":0.21903327114374924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011711392","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041116476,0.020446874,0.24553186,0.0014846321,0.0014125704,0.00006266575,0.00073604716,0.0018516234,0.68735737],"genre_scores_gemma":[0.40546656,0.017406723,0.07729973,0.0006741886,0.0024668956,0.00012385,0.0013173368,0.0012974757,0.49394724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978787,0.000034327284,0.000007653946,0.00003750316,0.000090776564,0.00004191483],"domain_scores_gemma":[0.99979645,0.000052587922,0.000018487704,0.000039792743,0.00005757434,0.000035157955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000251354,0.0009394277,0.00061097014,0.0012088042,0.00068716315,0.001975541,0.000448272,0.00027279914,0.014031207],"category_scores_gemma":[0.0008825345,0.00039588698,0.0003303895,0.0016470733,0.00088521134,0.0024183195,0.0009420216,0.0016756074,0.007894131],"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.000027423675,0.000018157723,0.0000878384,0.00009188615,0.0000057561756,0.000038430007,0.00024679708,0.00134091,0.0024754468,0.90418655,0.022148121,0.06933262],"study_design_scores_gemma":[0.000007012168,0.000030397747,0.00020718307,0.000056824432,0.000008798358,0.00018361196,0.00009633354,0.0028256937,0.0022266714,0.80720854,0.18713148,0.000017490584],"about_ca_topic_score_codex":0.0006715309,"about_ca_topic_score_gemma":0.0012500605,"teacher_disagreement_score":0.014031207,"about_ca_system_score_codex":0.00079534674,"about_ca_system_score_gemma":0.00046369713,"threshold_uncertainty_score":0.046939075},"labels":[],"label_agreement":null},{"id":"W3012212194","doi":"10.1007/978-3-030-43725-1_7","title":"Short Paper: Deploying PayWord on Ethereum","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Concordia University","funders":"","keywords":"Computer science; Payment; Hash function; Cryptocurrency; Computer security; Digital signature; Smart card; Cryptography; Smart contract; Scheme (mathematics); Point of sale; Blockchain; Operating system; World Wide Web; Mathematics","score_opus":0.0179219022256369,"score_gpt":0.24170451008694924,"score_spread":0.22378260786131232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012212194","genre_codex":"empirical","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46076953,0.002499788,0.20029563,0.012377926,0.00993891,0.0008444484,0.0021999583,0.022628227,0.2884455],"genre_scores_gemma":[0.6876804,0.00078305916,0.045479875,0.0011358223,0.00039332313,0.0001305105,0.0020311803,0.0030061416,0.2593597],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928975,0.0001794472,0.000037301284,0.000104884566,0.00026208456,0.00012652362],"domain_scores_gemma":[0.99847144,0.00056323904,0.000034743065,0.0005125297,0.00024451362,0.00017359691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012698518,0.00041003374,0.0004113645,0.00042116758,0.00076810777,0.001439391,0.0007327411,0.001077031,0.03907035],"category_scores_gemma":[0.0038000944,0.00027904275,0.00020392374,0.00070245384,0.00044697913,0.0043673385,0.0015647992,0.001166833,0.005956711],"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.0020019603,0.000909883,0.003196423,0.0004999441,0.00008452785,0.0013114967,0.0008042756,0.013938335,0.046529364,0.06701324,0.14898214,0.7147284],"study_design_scores_gemma":[0.00052270613,0.0016745485,0.0063411663,0.00027353867,0.00012933677,0.001214242,0.0015890658,0.21615365,0.1332136,0.08242675,0.5562786,0.0001827552],"about_ca_topic_score_codex":0.0014053107,"about_ca_topic_score_gemma":0.0013250483,"teacher_disagreement_score":0.03907035,"about_ca_system_score_codex":0.0004855083,"about_ca_system_score_gemma":0.0008440534,"threshold_uncertainty_score":0.13070333},"labels":[],"label_agreement":null},{"id":"W30133848","doi":"10.1007/978-3-642-45065-5_12","title":"Cross-Tier Application and Data Partitioning of Web Applications for Hybrid Cloud Deployment","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Software deployment; Cloud computing; Flexibility (engineering); Scalability; Database; Distributed computing; Web application; Operating system","score_opus":0.023098278572412173,"score_gpt":0.2783075589890106,"score_spread":0.2552092804165984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30133848","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.5870739,0.0019400246,0.386808,0.0003335947,0.00021788757,0.00023829563,0.00038193536,0.007415079,0.015591327],"genre_scores_gemma":[0.9044224,0.00019090078,0.09049214,0.00008014953,0.000036661128,0.000056920773,0.00054992776,0.00042790323,0.003742996],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999554,0.00007618184,0.00003283932,0.00007817356,0.00013361471,0.0001252359],"domain_scores_gemma":[0.99920815,0.00018811956,0.000037774626,0.00026439322,0.00019547055,0.00010617501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051146094,0.000496829,0.00036181434,0.0005960592,0.0005834928,0.0010783647,0.00093955256,0.0003314271,0.0021842779],"category_scores_gemma":[0.0010448078,0.0003457084,0.00037992056,0.00088969845,0.00026103944,0.0011424806,0.0010255249,0.000529175,0.0006730266],"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.0021150468,0.00083187164,0.010879774,0.00026361336,0.000119939774,0.00048954913,0.000385598,0.10731253,0.29546198,0.007849795,0.015007848,0.5592825],"study_design_scores_gemma":[0.00005665993,0.00023305393,0.010476387,0.000017294366,0.000057415473,0.0003451117,0.00017193846,0.9039773,0.074025065,0.0047384235,0.0058660535,0.000035403085],"about_ca_topic_score_codex":0.0023650278,"about_ca_topic_score_gemma":0.0054006036,"teacher_disagreement_score":0.0023650278,"about_ca_system_score_codex":0.0005352025,"about_ca_system_score_gemma":0.00062755786,"threshold_uncertainty_score":0.007307112},"labels":[],"label_agreement":null},{"id":"W3013538405","doi":"10.1007/978-3-030-59722-1_5","title":"Patch-Based Non-local Bayesian Networks for Blind Confocal Microscopy Denoising","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Artificial intelligence; Noise reduction; Leverage (statistics); Computer science; Pattern recognition (psychology); Posterior probability; Maximum a posteriori estimation; Convolutional neural network; Noise (video); Bayesian probability; Gaussian noise; Shot noise; Gaussian; Machine learning; Computer vision; Mathematics; Statistics; Physics; Image (mathematics)","score_opus":0.02560165186904007,"score_gpt":0.3146057455498374,"score_spread":0.2890040936807973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013538405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022543077,0.000110217006,0.9972256,0.00004753603,0.0000060345315,0.000009081931,0.000030705618,0.00010527567,0.00021121773],"genre_scores_gemma":[0.23750359,0.0010430015,0.7530252,0.00019053488,0.00011268037,0.00020589298,0.00054334913,0.0003412613,0.0070344084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992962,0.00024033143,0.000029932398,0.00018594855,0.00019153456,0.000056048368],"domain_scores_gemma":[0.99814236,0.0010578022,0.0001681464,0.00022465546,0.000339853,0.00006725846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619181,0.0007353545,0.0013159154,0.0007206622,0.00033002935,0.0008685606,0.0017359986,0.0017885299,0.0023064942],"category_scores_gemma":[0.005883221,0.00097425026,0.0009953358,0.0007902706,0.0010053129,0.0015027511,0.0017586773,0.0018408579,0.0009131678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037373533,0.00008544544,0.00069165905,0.00026266542,0.00015976286,0.00007638549,0.00012957785,0.7095428,0.022052621,0.02901152,0.0027455066,0.23486824],"study_design_scores_gemma":[0.0000051685042,0.000013138335,0.000113214344,0.000006309748,0.000011565672,0.000023025887,0.000004269735,0.99024105,0.0016648835,0.0075264005,0.00038356628,0.000007369411],"about_ca_topic_score_codex":0.005472014,"about_ca_topic_score_gemma":0.0073317476,"teacher_disagreement_score":0.005472014,"about_ca_system_score_codex":0.00084148045,"about_ca_system_score_gemma":0.00094268646,"threshold_uncertainty_score":0.010880291},"labels":[],"label_agreement":null},{"id":"W3013621553","doi":"10.1007/978-3-030-42266-0_5","title":"Gaps and Runs in Syntenic Alignments","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological Sciences","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 Ottawa","funders":"","keywords":"Synteny; Genome; Gene; Biology; Computational biology; Computer science; Genetics","score_opus":0.016140221556722966,"score_gpt":0.20939094721737142,"score_spread":0.19325072566064846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013621553","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1335659,0.0061121727,0.8079426,0.0007999355,0.0005076359,0.00012553437,0.0025788902,0.003750619,0.044616677],"genre_scores_gemma":[0.550159,0.0035002008,0.4056512,0.00024671463,0.00058185577,0.00027002275,0.01032512,0.0022257215,0.02704012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977024,0.0005592641,0.00020877754,0.00067786744,0.0006534607,0.00019831008],"domain_scores_gemma":[0.990772,0.007031137,0.00057182857,0.0009552967,0.00044530956,0.0002244594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023325547,0.00074436225,0.0012024106,0.0039888686,0.00154144,0.0027072562,0.0015624058,0.0014663929,0.009535177],"category_scores_gemma":[0.011906526,0.0010574537,0.0007873867,0.006672116,0.0017855037,0.006331819,0.0026183783,0.0019816933,0.0034817746],"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.00091649435,0.00010747837,0.008424529,0.000981538,0.00011256292,0.001977868,0.0026559038,0.034221075,0.01172563,0.5293474,0.018001992,0.39152747],"study_design_scores_gemma":[0.000032080592,0.0000806809,0.0033118688,0.0002948518,0.00007404444,0.0013395197,0.0009243792,0.07715809,0.0066391784,0.87640303,0.03368918,0.000053190903],"about_ca_topic_score_codex":0.0009125203,"about_ca_topic_score_gemma":0.0014361044,"teacher_disagreement_score":0.009535177,"about_ca_system_score_codex":0.00063421007,"about_ca_system_score_gemma":0.0006948387,"threshold_uncertainty_score":0.03189832},"labels":[],"label_agreement":null},{"id":"W3013748178","doi":"10.1007/978-3-030-50347-5_4","title":"Supervised and Unsupervised Detections for Multiple Object Tracking in Traffic Scenes: A Comparative Study","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Unsupervised learning; Tracking (education); Object detection; Object (grammar); Detector; Pattern recognition (psychology); Identification (biology); Ranging; Supervised learning; Computer vision; Machine learning; Artificial neural network","score_opus":0.0853150703390353,"score_gpt":0.35122614615434655,"score_spread":0.26591107581531126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013748178","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.6876861,0.0064337985,0.2916695,0.00031620084,0.00019980413,0.00020800349,0.00062305015,0.002058205,0.010805316],"genre_scores_gemma":[0.9423477,0.0017087932,0.051646914,0.00007134076,0.0000897938,0.00004542897,0.0010770526,0.00033336825,0.0026796795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952335,0.0019082256,0.00018984335,0.00091784477,0.0014139607,0.00033671406],"domain_scores_gemma":[0.9587613,0.03110279,0.0018873923,0.002539092,0.0052513685,0.00045809822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008932449,0.00095076393,0.0012592102,0.0023998385,0.00078060816,0.0028344146,0.0016730608,0.0017250485,0.0013679373],"category_scores_gemma":[0.029013295,0.0005286978,0.0008942543,0.0016477817,0.0009550274,0.0036614675,0.0010334388,0.0007462864,0.000712883],"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.004915859,0.001082429,0.07298875,0.0014767464,0.0012659929,0.00032146933,0.001411123,0.07084689,0.0207396,0.003272945,0.0036684969,0.8180097],"study_design_scores_gemma":[0.00014484505,0.0017107414,0.10627684,0.00024761818,0.0016829182,0.0010741211,0.001848577,0.85047936,0.024453446,0.0058051376,0.0061142566,0.00016206785],"about_ca_topic_score_codex":0.0077097486,"about_ca_topic_score_gemma":0.010446969,"teacher_disagreement_score":0.008932449,"about_ca_system_score_codex":0.0009827473,"about_ca_system_score_gemma":0.0012003267,"threshold_uncertainty_score":0.0472399},"labels":[],"label_agreement":null},{"id":"W3014282585","doi":"10.1007/978-3-030-50516-5_1","title":"Weighted Fisher Discriminant Analysis in the Input and Feature Spaces","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kernel Fisher discriminant analysis; Computer science; Linear discriminant analysis; Weighting; Pattern recognition (psychology); Subspace topology; Artificial intelligence; Kernel (algebra); Feature (linguistics); Discriminant; Class (philosophy); Fisher kernel; Feature vector; Facial recognition system; Mathematics; Discrete mathematics; Medicine","score_opus":0.01551866158589806,"score_gpt":0.23491461448715234,"score_spread":0.21939595290125427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014282585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005166577,0.0009945984,0.98956746,0.00010941129,0.00013346544,0.000010231799,0.00009314991,0.00038792886,0.0035371184],"genre_scores_gemma":[0.16544431,0.003191433,0.7870975,0.00012947137,0.00027000153,0.00008626686,0.00069114554,0.00059723767,0.04249256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995796,0.00007857942,0.000023813158,0.00007362533,0.00020910574,0.000035190547],"domain_scores_gemma":[0.9996388,0.00012266319,0.00002645103,0.000065223205,0.0001348427,0.000011948571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006127023,0.00071269553,0.00085012167,0.0007281934,0.00021970291,0.0010262199,0.00070300436,0.00045438152,0.0048489515],"category_scores_gemma":[0.0018078741,0.00027675307,0.00059128186,0.0011106811,0.00046558926,0.0013387665,0.00088976545,0.00089537335,0.0029009737],"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.00014918098,0.000040816187,0.0003772629,0.0002341612,0.000053181873,0.00008765483,0.00005852864,0.03266625,0.03275174,0.074574836,0.0104888,0.8485176],"study_design_scores_gemma":[0.000010170968,0.000060865514,0.0012172036,0.000060217764,0.000052107327,0.0003561803,0.0000420575,0.88836944,0.023205843,0.06740475,0.019173808,0.0000474126],"about_ca_topic_score_codex":0.0009892216,"about_ca_topic_score_gemma":0.0012562219,"teacher_disagreement_score":0.0048489515,"about_ca_system_score_codex":0.00028574886,"about_ca_system_score_gemma":0.0004038741,"threshold_uncertainty_score":0.016221404},"labels":[],"label_agreement":null},{"id":"W3014301019","doi":"10.1007/978-3-030-50516-5_10","title":"Theoretical Insights into the Use of Structural Similarity Index in Generative Models and Inferential Autoencoders","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generative grammar; Similarity (geometry); Kernel (algebra); Pattern recognition (psychology); Norm (philosophy); Matching (statistics); Adversarial system","score_opus":0.030116069105867033,"score_gpt":0.24010995206335775,"score_spread":0.20999388295749072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014301019","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.008727464,0.0029075057,0.961661,0.0018875805,0.00015013332,0.000025222438,0.00006971761,0.00007120645,0.024500268],"genre_scores_gemma":[0.67597926,0.0064535853,0.29753476,0.0010192997,0.0012413539,0.0002766259,0.0002087435,0.00021988746,0.017066421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868876,0.0006734173,0.00006583401,0.00021162772,0.00028766357,0.00007278576],"domain_scores_gemma":[0.988526,0.010012848,0.00035448946,0.00066247693,0.0003199493,0.00012424152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003766403,0.00092108914,0.0009694319,0.001441945,0.0008042384,0.0031299281,0.0022620803,0.002747148,0.004824501],"category_scores_gemma":[0.012725571,0.00093001744,0.0011032999,0.0019253386,0.0048581944,0.0065609976,0.002285025,0.0047257757,0.00072080543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034911138,0.000008402708,0.000055946533,0.000023120792,0.0000056396916,0.000017036875,0.000034298137,0.007948808,0.00016900561,0.9866628,0.00025072467,0.004820801],"study_design_scores_gemma":[0.0000021741068,0.000006834522,0.00004636244,0.000015894997,0.0000037788366,0.0000315422,0.00000959604,0.07960582,0.00014081484,0.9192933,0.0008368827,0.000007066809],"about_ca_topic_score_codex":0.00076331414,"about_ca_topic_score_gemma":0.0009129834,"teacher_disagreement_score":0.004824501,"about_ca_system_score_codex":0.0016123672,"about_ca_system_score_gemma":0.0007022671,"threshold_uncertainty_score":0.019918859},"labels":[],"label_agreement":null},{"id":"W3014386945","doi":"10.1007/978-3-662-66491-9_4","title":"Generating Weakly Chordal Graphs from Arbitrary Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Algoma University; University of Windsor","funders":"","keywords":"Chordal graph; Combinatorics; Treewidth; Interval graph; Split graph; Mathematics; Pathwidth; Indifference graph; Outerplanar graph; Discrete mathematics; Graph; Computer science; 1-planar graph; Line graph","score_opus":0.019875321825239625,"score_gpt":0.2652933343195548,"score_spread":0.2454180124943152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014386945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1844794,0.00035713526,0.73644376,0.00072480354,0.00022132671,0.0003397703,0.0008887972,0.0015639929,0.074980974],"genre_scores_gemma":[0.738562,0.00043628603,0.21836977,0.0002304633,0.0001428033,0.00037534998,0.0025231224,0.001384082,0.037976082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.00012484741,0.00002273237,0.000082690756,0.0001656926,0.00006324051],"domain_scores_gemma":[0.9978771,0.0013298487,0.00007570236,0.0004127231,0.00019995954,0.00010472152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004228002,0.00055014057,0.0006525531,0.0006325072,0.0007104117,0.0013252931,0.0014157845,0.0006183332,0.00703641],"category_scores_gemma":[0.0035984924,0.00052273954,0.0008482085,0.0009030642,0.0009126024,0.001851335,0.0031734821,0.0015975785,0.0016210374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022486348,0.00010805585,0.0008309851,0.000449159,0.000026806882,0.0002672554,0.0010343982,0.02467856,0.023880983,0.8096824,0.009775052,0.1290415],"study_design_scores_gemma":[0.000032817887,0.00003687074,0.00020920114,0.000029476962,0.00001698538,0.00012173037,0.00014645657,0.06177245,0.007487225,0.9217393,0.008396081,0.000011313018],"about_ca_topic_score_codex":0.0003732188,"about_ca_topic_score_gemma":0.0008389381,"teacher_disagreement_score":0.00703641,"about_ca_system_score_codex":0.0008185,"about_ca_system_score_gemma":0.00040645103,"threshold_uncertainty_score":0.023539186},"labels":[],"label_agreement":null},{"id":"W3014394476","doi":"10.1007/978-3-030-50516-5_23","title":"Studying the Effect of Digital Stain Separation of Histopathology Images on Image Search Performance","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Histopathology; Stain; RGB color model; Artificial intelligence; Digital image; Computer science; Digital pathology; Grayscale; Pattern recognition (psychology); Computer vision; Image (mathematics); Image processing; Pathology; Staining; Medicine","score_opus":0.01936835830922021,"score_gpt":0.30073635603740817,"score_spread":0.28136799772818794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014394476","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.987982,0.0018927236,0.0076119397,0.00021794393,0.00008298594,0.00002156065,0.00034031243,0.00054405036,0.0013064508],"genre_scores_gemma":[0.98845565,0.00044914283,0.00808537,0.00006810394,0.000059269132,0.000011222645,0.00076305575,0.00015439728,0.001953798],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840003,0.00028972566,0.00017315049,0.0003176323,0.00044009244,0.00037936476],"domain_scores_gemma":[0.974732,0.020938616,0.00090643606,0.0010541464,0.0018250732,0.00054367597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015818343,0.0008346293,0.0008741457,0.001119784,0.0005151417,0.0012512632,0.00057593617,0.001165172,0.0028305883],"category_scores_gemma":[0.017757935,0.00030381687,0.0004295328,0.001275365,0.00038537194,0.0019099823,0.0005759567,0.0006061742,0.00082507153],"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.022144303,0.0024218308,0.032521237,0.00083944044,0.00063345855,0.00050168415,0.00025104752,0.14373188,0.45546564,0.0008218048,0.0041330056,0.33653462],"study_design_scores_gemma":[0.000263364,0.0060490994,0.051250245,0.000048881444,0.0005641411,0.0009995631,0.0004456351,0.5597631,0.37809643,0.00068825466,0.0017101872,0.000121227225],"about_ca_topic_score_codex":0.004950273,"about_ca_topic_score_gemma":0.0039066765,"teacher_disagreement_score":0.004950273,"about_ca_system_score_codex":0.00056435727,"about_ca_system_score_gemma":0.0010548803,"threshold_uncertainty_score":0.009842932},"labels":[],"label_agreement":null},{"id":"W3014405193","doi":"10.1007/978-3-030-47358-7_50","title":"Investigating Citation Linkage as a Sentence Similarity Measurement Task Using Deep Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Western University","funders":"","keywords":"Computer science; Sentence; Citation; Task (project management); Similarity (geometry); Linkage (software); Information retrieval; Natural language processing; Artificial intelligence; Semantic similarity; Domain (mathematical analysis); World Wide Web; Image (mathematics)","score_opus":0.06807879427886686,"score_gpt":0.26585730152376397,"score_spread":0.1977785072448971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014405193","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.80276275,0.004004455,0.17855455,0.0021647746,0.0004936401,0.00012379761,0.0021394868,0.0025850367,0.007171583],"genre_scores_gemma":[0.9525535,0.00044046395,0.039887127,0.00019481295,0.00042744924,0.00007932866,0.0029110448,0.00019485867,0.0033114348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975867,0.0009852598,0.00019096526,0.00062242907,0.0004477892,0.00016687672],"domain_scores_gemma":[0.97646934,0.018148694,0.0015501776,0.0011310908,0.001926673,0.0007739339],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0032912523,0.0007215494,0.0010717696,0.0034906387,0.0010814397,0.002739429,0.0015458143,0.0024414815,0.0034668976],"category_scores_gemma":[0.02489044,0.00034520088,0.00073774764,0.0040185964,0.0004272692,0.0059852726,0.0017248361,0.0020484515,0.001487637],"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.003110699,0.003362001,0.09405171,0.0020117625,0.0008536254,0.0013499239,0.0018538651,0.04329427,0.072690465,0.031108715,0.04736708,0.69894594],"study_design_scores_gemma":[0.00009695498,0.00043743127,0.019251319,0.00007090727,0.00022682149,0.00042275887,0.0007275016,0.91583717,0.016338008,0.041025996,0.0055060405,0.0000591601],"about_ca_topic_score_codex":0.0023440155,"about_ca_topic_score_gemma":0.0027053258,"teacher_disagreement_score":0.9965094,"about_ca_system_score_codex":0.000718999,"about_ca_system_score_gemma":0.00083294965,"threshold_uncertainty_score":0.017405987},"labels":[],"label_agreement":null},{"id":"W3014594587","doi":"10.1007/978-3-030-58586-0_27","title":"ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysis","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Vector Institute","funders":"","keywords":"Pooling; Proxy (statistics); Scaling; Metric (unit); Computer science; Similarity (geometry); Recall; Precision and recall; Task (project management); Component (thermodynamics); Artificial intelligence; Algorithm; Machine learning; Pattern recognition (psychology); Mathematics; Image (mathematics); Psychology","score_opus":0.01792349795523812,"score_gpt":0.29121482040543406,"score_spread":0.27329132245019594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014594587","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.0027909833,0.00068382354,0.9883249,0.00028131588,0.00028650017,0.000080070946,0.00022056195,0.005595619,0.0017362818],"genre_scores_gemma":[0.04670907,0.0009645274,0.93968475,0.00039128851,0.00032888076,0.00020537109,0.0011488913,0.004269622,0.006297638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967624,0.0010939583,0.00016212332,0.0005547965,0.0012795501,0.00014709613],"domain_scores_gemma":[0.993411,0.0016411286,0.00014102917,0.0028190967,0.0017650946,0.00022265027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030871625,0.0021234227,0.0026134676,0.0021005285,0.0014418385,0.0047229775,0.0051917764,0.0019003222,0.008717662],"category_scores_gemma":[0.019675074,0.0012676645,0.0019716835,0.0028453113,0.0017692375,0.0040504984,0.006227672,0.0037072897,0.007438551],"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.00033746194,0.00019054058,0.0017539241,0.0004299315,0.00027135544,0.00018242055,0.00028518058,0.060669977,0.0067096483,0.06620942,0.04025554,0.8227046],"study_design_scores_gemma":[0.00004946178,0.000063638116,0.0003815044,0.000067202614,0.00008306047,0.00013567897,0.00006385934,0.90422225,0.0048720753,0.03707827,0.05292455,0.000058491863],"about_ca_topic_score_codex":0.018090812,"about_ca_topic_score_gemma":0.026231572,"teacher_disagreement_score":0.018090812,"about_ca_system_score_codex":0.0010449622,"about_ca_system_score_gemma":0.0034338976,"threshold_uncertainty_score":0.035971045},"labels":[],"label_agreement":null},{"id":"W3014831306","doi":"10.1007/978-3-030-60365-6_15","title":"Graph Domain Adaptation for Alignment-Invariant Brain Surface Segmentation","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Graph; Segmentation; Discriminator; Artificial intelligence; Domain adaptation; Pattern recognition (psychology); Adversarial system; Invariant (physics); Theoretical computer science; Mathematics","score_opus":0.03319126847841496,"score_gpt":0.28098095256651995,"score_spread":0.24778968408810498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014831306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014263094,0.0003209834,0.9826446,0.00013091502,0.000049534643,0.00003541763,0.00015570596,0.0017582184,0.0006414531],"genre_scores_gemma":[0.46862763,0.0007409437,0.5187321,0.0004555741,0.00015230889,0.00017592478,0.002289814,0.0016223096,0.0072033987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999624,0.00009526132,0.000015041541,0.00014813803,0.000064447435,0.00005308162],"domain_scores_gemma":[0.99930024,0.00030511376,0.00005465054,0.00016177294,0.0001313441,0.00004677331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072793075,0.00087713765,0.0013446081,0.0012836496,0.00037937966,0.0007702954,0.0015207683,0.0015509371,0.002872084],"category_scores_gemma":[0.0022253257,0.0005579686,0.0012873214,0.0015078606,0.0007690515,0.0011671275,0.0014469072,0.0017557875,0.0015975222],"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.00039599446,0.00020501373,0.000895073,0.00026176768,0.000222976,0.00012258261,0.00011516055,0.3207836,0.061030038,0.009706734,0.008402682,0.59785837],"study_design_scores_gemma":[0.000010358185,0.000037646696,0.0004889276,0.0000070807387,0.000018396244,0.00006170435,0.000018896255,0.98243505,0.0058161397,0.010126565,0.0009680286,0.000011233649],"about_ca_topic_score_codex":0.0040228716,"about_ca_topic_score_gemma":0.0053526917,"teacher_disagreement_score":0.0040228716,"about_ca_system_score_codex":0.0005336895,"about_ca_system_score_gemma":0.0008758486,"threshold_uncertainty_score":0.00960809},"labels":[],"label_agreement":null},{"id":"W30155951","doi":"10.1007/978-3-642-40811-3_44","title":"Errors in Device Localization in MRI Using Z-Frames","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"","keywords":"Isocenter; Computer science; Computer vision; Distortion (music); Artificial intelligence; Frame (networking); Tracking (education); Position (finance); Reference frame; Pose; Field of view; Optics; Physics; Telecommunications","score_opus":0.022199758348827422,"score_gpt":0.3291850516133231,"score_spread":0.3069852932644957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30155951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13416864,0.0025530728,0.85683906,0.0003514182,0.00044044535,0.000055831493,0.00031723984,0.0020992337,0.0031750272],"genre_scores_gemma":[0.8131461,0.0013345185,0.18124078,0.00011942604,0.00008439614,0.000034709876,0.00043139444,0.0005811104,0.003027513],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977938,0.00054557156,0.00016073308,0.00037598776,0.00093867816,0.0001851765],"domain_scores_gemma":[0.99508554,0.0023762593,0.0006788498,0.0006957938,0.0010528528,0.00011067196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016794357,0.0012366051,0.0008553491,0.0014268251,0.0005692377,0.0018282605,0.0007063127,0.0015952514,0.0013896166],"category_scores_gemma":[0.014536514,0.0007327872,0.00043776698,0.0016358007,0.0006022422,0.0016358529,0.0017590701,0.0012057809,0.0010238839],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004866125,0.00015014752,0.013875021,0.0012684076,0.00033056294,0.0013177664,0.0014781667,0.1814996,0.19338872,0.013689339,0.0055530486,0.5825832],"study_design_scores_gemma":[0.0001387543,0.0006831921,0.028366586,0.00032294245,0.00034853697,0.0038046099,0.00056744314,0.6531241,0.29108384,0.009683282,0.011634674,0.00024199823],"about_ca_topic_score_codex":0.0052474043,"about_ca_topic_score_gemma":0.0046360046,"teacher_disagreement_score":0.0052474043,"about_ca_system_score_codex":0.000551875,"about_ca_system_score_gemma":0.00080181763,"threshold_uncertainty_score":0.010433733},"labels":[],"label_agreement":null},{"id":"W3015713034","doi":"10.1007/978-3-030-45442-5_4","title":"Which BM25 Do You Mean? A Large-Scale Reproducibility Study of Scoring Variants","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reproducibility; Scale (ratio); Information retrieval; Artificial intelligence; Statistics; Mathematics; Cartography","score_opus":0.03285745192629517,"score_gpt":0.2676645239402604,"score_spread":0.23480707201396525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015713034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9182201,0.012483212,0.055914737,0.0012191347,0.0010565085,0.00030335534,0.0038836687,0.0017946945,0.0051246295],"genre_scores_gemma":[0.9758304,0.0005911762,0.016866695,0.00020552054,0.00022451425,0.00014879463,0.0041267686,0.00076687854,0.0012391909],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9495412,0.030376296,0.0033884353,0.009881474,0.0061611496,0.0006514071],"domain_scores_gemma":[0.6871519,0.25075617,0.009507655,0.032053534,0.018065212,0.0024655832],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.07356825,0.0013266425,0.0017396541,0.003176496,0.0017024194,0.003960364,0.0027430893,0.0018472422,0.0019933728],"category_scores_gemma":[0.25292847,0.00056040863,0.0022577452,0.0034561092,0.0022606484,0.0030767357,0.002014762,0.0022393249,0.0016816461],"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.0090097515,0.0007260534,0.5411126,0.0014579312,0.015400277,0.00037479552,0.0047753626,0.00928698,0.006855055,0.0032347701,0.038873672,0.3688927],"study_design_scores_gemma":[0.0013695877,0.004207273,0.80384076,0.0006396945,0.010202762,0.0031204077,0.0029254998,0.12420593,0.013582015,0.015376352,0.019807149,0.00072255055],"about_ca_topic_score_codex":0.0030101216,"about_ca_topic_score_gemma":0.00361878,"teacher_disagreement_score":0.9264318,"about_ca_system_score_codex":0.0010944584,"about_ca_system_score_gemma":0.000851398,"threshold_uncertainty_score":0.38907075},"labels":[{"model":"gemma","categories":["metaresearch"],"domain":"reproducibility","study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["metaresearch"],"domain":"reproducibility","study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W3015809448","doi":"10.1007/978-3-030-47358-7_41","title":"Challenges in Vessel Behavior and Anomaly Detection: From Classical Machine Learning to Deep Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Anomaly detection; Artificial intelligence; Deep learning; Machine learning","score_opus":0.0273795102785721,"score_gpt":0.2546712898518961,"score_spread":0.22729177957332397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015809448","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01395233,0.037521604,0.9214829,0.019195832,0.00069400005,0.00002435133,0.0003129438,0.00049680105,0.0063191676],"genre_scores_gemma":[0.54202664,0.07133618,0.35814393,0.0034002862,0.005057177,0.00011180055,0.00079878955,0.0003951822,0.018729972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990158,0.00027218985,0.000054901626,0.00021630431,0.00036672622,0.00007404948],"domain_scores_gemma":[0.9931179,0.005257698,0.00026520595,0.00043718482,0.0007411806,0.00018071114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002773444,0.000812511,0.0012141655,0.000903976,0.00043461745,0.0028133178,0.0020258836,0.0021109318,0.0017340282],"category_scores_gemma":[0.010029599,0.000614953,0.00054611015,0.001746935,0.0021468347,0.005985551,0.0025558323,0.004770162,0.0006628228],"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.00008726913,0.00011736572,0.0028248546,0.00053760986,0.00009331973,0.000116978306,0.00014327616,0.09743954,0.0013302736,0.12945113,0.022834646,0.74502385],"study_design_scores_gemma":[0.000005089036,0.000027255152,0.0007324876,0.000099969206,0.0000147894825,0.000121207086,0.00008637639,0.52058494,0.0010331934,0.4676,0.009673051,0.000021613074],"about_ca_topic_score_codex":0.0034080774,"about_ca_topic_score_gemma":0.0031623603,"teacher_disagreement_score":0.0034080774,"about_ca_system_score_codex":0.0010826844,"about_ca_system_score_gemma":0.0009385867,"threshold_uncertainty_score":0.014667571},"labels":[],"label_agreement":null},{"id":"W3015851848","doi":"10.1007/978-3-030-43859-3_11","title":"Objective Evaluation of Tonal Fitness for Chord Progressions Using the Tonal Interval Space","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Chord (peer-to-peer); Computer science; Speech recognition; Active listening; Perception; Artificial intelligence; Communication; Psychology","score_opus":0.0686454552781229,"score_gpt":0.33397751872426873,"score_spread":0.26533206344614585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015851848","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.9108696,0.0005385558,0.07471156,0.000039992443,0.000055102217,0.00022581976,0.0010418787,0.00036661437,0.012150933],"genre_scores_gemma":[0.9772708,0.00014758414,0.01896793,0.00001226115,0.000025688822,0.000076927136,0.0007985269,0.000059948583,0.0026402795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992169,0.0002040016,0.00005599979,0.00012494021,0.00034278654,0.000055280907],"domain_scores_gemma":[0.9974412,0.0012494061,0.00026364418,0.00010568183,0.00070309534,0.00023703516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010214593,0.0005697732,0.00040837622,0.0011648318,0.00020971805,0.00090857066,0.00033643504,0.00042111843,0.0050751227],"category_scores_gemma":[0.0043367883,0.00009400381,0.00032416935,0.00055073184,0.00022761906,0.0004973545,0.00060723495,0.00020442912,0.00066020514],"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.011561055,0.0011797127,0.12121798,0.0010610876,0.00051897636,0.0002774912,0.00062099006,0.037665013,0.13630985,0.0018130058,0.0020222783,0.6857526],"study_design_scores_gemma":[0.00049550866,0.011454857,0.59567696,0.00017991281,0.0005481855,0.00080545276,0.001670954,0.33740917,0.046307907,0.0016893807,0.003565232,0.00019640406],"about_ca_topic_score_codex":0.0014050846,"about_ca_topic_score_gemma":0.0021356256,"teacher_disagreement_score":0.0050751227,"about_ca_system_score_codex":0.00019794171,"about_ca_system_score_gemma":0.00024552018,"threshold_uncertainty_score":0.016977966},"labels":[],"label_agreement":null},{"id":"W3015885778","doi":"10.1007/978-3-030-45439-5_49","title":"Temporal Latent Space Modeling for Community Prediction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University; University of New Brunswick","funders":"","keywords":"Computer science; Space (punctuation); Representation (politics); User modeling; Data mining; Machine learning; Probabilistic latent semantic analysis; Artificial intelligence; Information retrieval; User interface","score_opus":0.036437812354549584,"score_gpt":0.2669184827698297,"score_spread":0.23048067041528014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015885778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00809868,0.00095106335,0.98818874,0.00036990567,0.00010359495,0.000038091013,0.00072620367,0.0006668772,0.0008567692],"genre_scores_gemma":[0.5007126,0.0028329715,0.46114022,0.0005024865,0.0008222051,0.00070816354,0.007864756,0.0007048189,0.024711821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888116,0.00046668635,0.000053749165,0.0003102605,0.00015987453,0.00012826546],"domain_scores_gemma":[0.99556005,0.0031869994,0.00025799128,0.00046692268,0.00035575218,0.00017216831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027182966,0.0010931804,0.0017154824,0.0016259684,0.00085048104,0.0012981365,0.003358514,0.0018772305,0.005953396],"category_scores_gemma":[0.008075204,0.0008227117,0.0017292645,0.0032634623,0.00091853796,0.003642012,0.002049092,0.0031963352,0.0021304616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025691855,0.0002773945,0.0023186763,0.0002431729,0.00027561747,0.0000990675,0.00016425476,0.6765038,0.0017117976,0.082726695,0.015746472,0.2196762],"study_design_scores_gemma":[0.0000034200204,0.0000067792075,0.00007757363,0.0000060460834,0.0000072493385,0.0000074952013,0.0000055864843,0.97901845,0.00007884267,0.020358164,0.00042655534,0.0000038206613],"about_ca_topic_score_codex":0.015839383,"about_ca_topic_score_gemma":0.021728758,"teacher_disagreement_score":0.015839383,"about_ca_system_score_codex":0.0013945691,"about_ca_system_score_gemma":0.0012070017,"threshold_uncertainty_score":0.03149438},"labels":[],"label_agreement":null},{"id":"W3016056496","doi":"10.1007/978-3-030-45712-9_1","title":"On the Impact of the Application Domain on Users’ Susceptibility to the Six Weapons of Influence","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Persuasion; Domain (mathematical analysis); Computer science; Recommender system; Persuasive technology; Dimension (graph theory); World Wide Web; Psychology; Social psychology; Mathematics","score_opus":0.015888981271304035,"score_gpt":0.2892458801717015,"score_spread":0.27335689890039744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016056496","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.95447534,0.00032095693,0.0005174894,0.0008514648,0.000013312723,0.000017856388,0.0001846121,0.0000151142085,0.043603804],"genre_scores_gemma":[0.9987696,0.000048476468,0.00007158355,0.000022482716,0.00000752567,0.0000039221723,0.000041838255,0.0000064861415,0.0010280762],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99735487,0.0013197042,0.00010067369,0.00023788193,0.0006961961,0.00029066682],"domain_scores_gemma":[0.79739875,0.18532594,0.0067202346,0.0025439537,0.004501643,0.0035094728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038626096,0.00022947213,0.00027396812,0.0014324302,0.0010245416,0.002673231,0.0005249137,0.0008860687,0.01842248],"category_scores_gemma":[0.05121973,0.00023748603,0.00044001197,0.0012928015,0.0013500886,0.0024121006,0.0015878591,0.0019912869,0.001626017],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016307718,0.00060834945,0.9069661,0.00010010936,0.0002523488,0.00035554118,0.012196061,0.0026369859,0.0026209261,0.010262267,0.0029062198,0.05946446],"study_design_scores_gemma":[0.000022556054,0.0003224063,0.97692424,0.00003530048,0.00015101154,0.00018341589,0.009299596,0.0055109034,0.00093430746,0.004349952,0.0022253972,0.000041017636],"about_ca_topic_score_codex":0.008861286,"about_ca_topic_score_gemma":0.010992872,"teacher_disagreement_score":0.01842248,"about_ca_system_score_codex":0.0009362837,"about_ca_system_score_gemma":0.0004779402,"threshold_uncertainty_score":0.061629355},"labels":[],"label_agreement":null},{"id":"W3016163695","doi":"10.1007/978-3-030-44094-7_18","title":"Classification of Autism Genes Using Network Science and Linear Genetic Programming","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Memorial University of Newfoundland","funders":"","keywords":"Autism; Computer science; Set (abstract data type); Genetic programming; Autism spectrum disorder; Genetic network; Machine learning; Biological network; Gene regulatory network; Artificial intelligence; Gene; Computational biology; Biology; Genetics; Medicine; Psychiatry","score_opus":0.01780806667127422,"score_gpt":0.2655374994877649,"score_spread":0.24772943281649068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016163695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16059649,0.0009094681,0.8278103,0.0009884302,0.000094732924,0.00022592803,0.0021354656,0.0016491947,0.005590016],"genre_scores_gemma":[0.5510825,0.000494628,0.4354962,0.00019991923,0.00009695985,0.0003088868,0.003443472,0.0002203865,0.008656974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.000093668714,0.000017854529,0.000098049444,0.00006571206,0.00003651196],"domain_scores_gemma":[0.9989562,0.0007450729,0.00007554623,0.00005084943,0.00013719595,0.00003522506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079648435,0.00085465785,0.00061122904,0.0021886523,0.00040822034,0.0009627486,0.0011394091,0.00081702607,0.002780079],"category_scores_gemma":[0.002334484,0.00025999252,0.0011854746,0.00094855216,0.00032841484,0.0006240015,0.0005012426,0.0008190411,0.0006759156],"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.0003720364,0.00028412943,0.032835912,0.00022277342,0.00024760995,0.0004989481,0.00013232806,0.4286619,0.011190583,0.010297109,0.00909039,0.5061662],"study_design_scores_gemma":[0.000011247579,0.00003396844,0.0026050124,0.000018201115,0.00003282728,0.00009247177,0.000043320026,0.9825629,0.0015348817,0.012368215,0.0006882199,0.000008727829],"about_ca_topic_score_codex":0.004972379,"about_ca_topic_score_gemma":0.00567,"teacher_disagreement_score":0.004972379,"about_ca_system_score_codex":0.00078801997,"about_ca_system_score_gemma":0.0005910773,"threshold_uncertainty_score":0.009886861},"labels":[],"label_agreement":null},{"id":"W3016194403","doi":"10.1007/978-3-030-45442-5_6","title":"Reproducibility is a Process, Not an Achievement: The Replicability of IR Reproducibility Experiments","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reproducibility; Replicate; Computer science; Process (computing); Set (abstract data type); Artificial intelligence; Data science; Mathematics; Statistics; Programming language","score_opus":0.14700450010855282,"score_gpt":0.38777598236548066,"score_spread":0.24077148225692785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016194403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04243134,0.029786164,0.77340513,0.032866266,0.0074315527,0.0009231419,0.00066300185,0.0023052457,0.11018819],"genre_scores_gemma":[0.57326186,0.007256632,0.38589585,0.009401515,0.004410189,0.0025977865,0.0008733261,0.0023157054,0.0139871435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.8244514,0.13043778,0.0058434927,0.01493233,0.023177462,0.0011576323],"domain_scores_gemma":[0.3547744,0.4161572,0.016826626,0.18930902,0.02096434,0.0019684331],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.1916332,0.0010442625,0.0023619607,0.0033137074,0.002655804,0.008245848,0.0046791392,0.00428429,0.00653789],"category_scores_gemma":[0.46482626,0.0012047734,0.0021134336,0.0031359713,0.020129906,0.01660269,0.0063466723,0.008540066,0.0018911753],"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.0005506115,0.00016497345,0.0075601153,0.0016544351,0.0007108728,0.00033623172,0.0044869864,0.0037979244,0.0068638776,0.7233144,0.018556116,0.23200351],"study_design_scores_gemma":[0.0001354881,0.00042191357,0.0046304897,0.0009201599,0.00036650227,0.0009279855,0.000616258,0.009357964,0.010503511,0.91924834,0.052701943,0.00016951379],"about_ca_topic_score_codex":0.00097117637,"about_ca_topic_score_gemma":0.0006778228,"teacher_disagreement_score":0.8083668,"about_ca_system_score_codex":0.0024394174,"about_ca_system_score_gemma":0.003869459,"threshold_uncertainty_score":0.9968602},"labels":[],"label_agreement":null},{"id":"W3016647053","doi":"10.1007/978-3-030-45371-8_15","title":"Incorporating Off-Line Attribute Delegation into Hierarchical Group and Attribute-Based Access Control","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"","keywords":"Delegation; Computer science; Access control; Protocol (science); Certificate; Computer security; Theoretical computer science","score_opus":0.027866367909466075,"score_gpt":0.2943149721354916,"score_spread":0.26644860422602556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016647053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010525776,0.00010247762,0.9844094,0.0000711047,0.00004984824,0.000071168135,0.00002315454,0.0012301871,0.0035168747],"genre_scores_gemma":[0.5154781,0.000161965,0.47357368,0.000104350096,0.000089291985,0.0001078797,0.00012347408,0.0002740555,0.010087239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651825,0.0010548908,0.00023501347,0.00046642323,0.0012722095,0.0004532795],"domain_scores_gemma":[0.99358904,0.0019682096,0.00022472354,0.003283639,0.000654845,0.00027949805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003942035,0.00053550635,0.0010809865,0.00070041936,0.0010241142,0.0028118358,0.0025512085,0.0008735708,0.0053384327],"category_scores_gemma":[0.007871082,0.00048202838,0.0010085669,0.0010073013,0.0018977463,0.004822334,0.0036640412,0.0023080749,0.0010279323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005031062,0.0008905061,0.0017081507,0.0002162203,0.00013494458,0.00016483596,0.0011721278,0.15522876,0.021639831,0.3329942,0.005735998,0.47961137],"study_design_scores_gemma":[0.000036515292,0.000124917,0.00026021732,0.000023737737,0.000048541962,0.00009296821,0.0000803431,0.8603823,0.013879642,0.11597827,0.009055356,0.00003714133],"about_ca_topic_score_codex":0.003857551,"about_ca_topic_score_gemma":0.0039352183,"teacher_disagreement_score":0.0053384327,"about_ca_system_score_codex":0.0012175866,"about_ca_system_score_gemma":0.0016718323,"threshold_uncertainty_score":0.020847678},"labels":[],"label_agreement":null},{"id":"W3016801111","doi":"10.1007/978-3-030-45371-8_8","title":"Lempel-Ziv Compression with Randomized Input-Output for Anti-compression Side-Channel Attacks Under HTTPS/TLS","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and 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 Waterloo","funders":"","keywords":"Computer science; Side channel attack; Compression (physics); Timing attack; Data compression; Channel (broadcasting); Compression ratio; Computer security; Algorithm; Computer network; Cryptography","score_opus":0.02959906724605882,"score_gpt":0.28309228231983213,"score_spread":0.2534932150737733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016801111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0388979,0.0027021118,0.87301946,0.0032179558,0.0006469847,0.0004940975,0.00052072253,0.0069831023,0.07351772],"genre_scores_gemma":[0.79940796,0.0014766441,0.15967283,0.0015410268,0.0006381131,0.0006035452,0.0008644866,0.0007832035,0.03501223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593,0.000984903,0.00019328065,0.0004030778,0.00185411,0.0006345732],"domain_scores_gemma":[0.9974329,0.0011339685,0.00018050324,0.00092731207,0.00024268158,0.00008271666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019911495,0.0016448356,0.0014137189,0.0013333281,0.0011991685,0.0027871935,0.0016834979,0.002805639,0.011582887],"category_scores_gemma":[0.0061097057,0.0006994575,0.0009364545,0.001309562,0.0027257318,0.003954376,0.0048092185,0.003709145,0.005475724],"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.0010465676,0.00027575588,0.000553418,0.0005644479,0.00011907186,0.00069467083,0.00029253232,0.045647044,0.031149158,0.68138653,0.02636361,0.21190727],"study_design_scores_gemma":[0.00015917188,0.0003071659,0.00033872956,0.0002627532,0.00008763035,0.0011973087,0.00010236433,0.399935,0.06303951,0.5126461,0.02181958,0.00010478373],"about_ca_topic_score_codex":0.00028652253,"about_ca_topic_score_gemma":0.0004410063,"teacher_disagreement_score":0.011582887,"about_ca_system_score_codex":0.0015308718,"about_ca_system_score_gemma":0.0016602095,"threshold_uncertainty_score":0.038748622},"labels":[],"label_agreement":null},{"id":"W3017049137","doi":"10.1007/978-3-030-45778-5_4","title":"A Comprehensive Analysis of Accuracies of Machine Learning Algorithms for Network Intrusion Detection","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Intrusion detection system; Machine learning; Naive Bayes classifier; Artificial intelligence; Anomaly detection; Algorithm; Random forest; Data mining; Feature (linguistics); Support vector machine","score_opus":0.0228744414462932,"score_gpt":0.2552675210298942,"score_spread":0.232393079583601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017049137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3099455,0.07208274,0.5701728,0.0013989323,0.0009993524,0.00020190948,0.0099773165,0.008077546,0.027143927],"genre_scores_gemma":[0.76937324,0.010569331,0.18977375,0.00032822718,0.0008117683,0.00015306474,0.01605634,0.0011818246,0.011752413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911396,0.0017745256,0.0006457687,0.0011799501,0.0048679956,0.0003921453],"domain_scores_gemma":[0.94458383,0.044080164,0.0011657613,0.0043931804,0.005550472,0.00022663489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008680116,0.0016771811,0.0017442246,0.006180117,0.00069261366,0.0019528973,0.0017004682,0.001357991,0.0029685223],"category_scores_gemma":[0.032391563,0.0004830131,0.0017005444,0.0053928634,0.0006317195,0.004199557,0.0010526518,0.0012860793,0.001430517],"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.0006237551,0.00024907303,0.03188117,0.0008405381,0.0009127703,0.00014572372,0.00017031941,0.16243714,0.0073388484,0.007868286,0.018656315,0.7688761],"study_design_scores_gemma":[0.000033415392,0.0008566076,0.06652783,0.00033698019,0.00069151295,0.00093076535,0.00021524011,0.8671148,0.027824448,0.018381527,0.016925016,0.00016187693],"about_ca_topic_score_codex":0.0028479714,"about_ca_topic_score_gemma":0.0037317665,"teacher_disagreement_score":0.008680116,"about_ca_system_score_codex":0.0013782483,"about_ca_system_score_gemma":0.0007115853,"threshold_uncertainty_score":0.04590541},"labels":[],"label_agreement":null},{"id":"W3017077459","doi":"10.1007/978-3-030-44914-8_6","title":"Concise Read-Only Specifications for Better Synthesis of Programs with Pointers","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Yale-NUS College; Yale University; National Science Foundation","keywords":"Computer science; Program synthesis; Correctness; Heap (data structure); Programming language; Separation logic; High-level synthesis; Intuition; Theoretical computer science; Embedded system","score_opus":0.034887188510758595,"score_gpt":0.2531256888930704,"score_spread":0.21823850038231182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017077459","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.055052765,0.00017996848,0.9335807,0.00024038226,0.00005343981,0.000081348546,0.00021249522,0.006819004,0.0037799303],"genre_scores_gemma":[0.45419902,0.00021627225,0.5388739,0.00029027055,0.00003020203,0.00018675458,0.000628463,0.0021962014,0.0033788935],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970854,0.0010247035,0.00028822714,0.00027523367,0.0011496465,0.0001768319],"domain_scores_gemma":[0.98761266,0.007469098,0.0008221926,0.0028118112,0.0011366705,0.0001474408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003298145,0.0007166752,0.0005019265,0.0007424845,0.00039264883,0.0015628255,0.0013628976,0.0007877545,0.0062557673],"category_scores_gemma":[0.011284658,0.00054256106,0.000748556,0.0005466862,0.0014316167,0.0030983977,0.0016143065,0.0017776486,0.0010088332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067188725,0.00038342315,0.003388689,0.0018563826,0.000108248525,0.0004893508,0.0010034203,0.2274225,0.3034917,0.2304153,0.005317324,0.22545184],"study_design_scores_gemma":[0.0001102765,0.0004176672,0.00058708974,0.00018745645,0.00015396942,0.0002633295,0.00020206961,0.4353301,0.4379295,0.093171805,0.0315706,0.000076165015],"about_ca_topic_score_codex":0.00054934877,"about_ca_topic_score_gemma":0.0010822719,"teacher_disagreement_score":0.0062557673,"about_ca_system_score_codex":0.0007063891,"about_ca_system_score_gemma":0.001236767,"threshold_uncertainty_score":0.020927668},"labels":[],"label_agreement":null},{"id":"W3017092891","doi":"10.1007/978-3-030-45778-5_21","title":"Arguments Against Using the 1998 DARPA Dataset for Cloud IDS Design and Evaluation and Some Alternative","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Toronto Metropolitan University; University of Victoria","funders":"","keywords":"Cloud computing; Computer science; Random forest; Support vector machine; Machine learning; Intrusion detection system; Data mining; Artificial intelligence; Cloud service provider; Cloud computing security; Operating system","score_opus":0.05347627649335439,"score_gpt":0.2982566055118124,"score_spread":0.24478032901845798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017092891","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10057371,0.010536881,0.34849527,0.4045937,0.008615586,0.0012820374,0.008778627,0.004160426,0.11296373],"genre_scores_gemma":[0.5616138,0.0031773767,0.36558872,0.042735323,0.0031846694,0.0013289885,0.0048573795,0.0010689563,0.016444774],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9501371,0.025945961,0.0023880142,0.0029738892,0.017497513,0.0010576021],"domain_scores_gemma":[0.8363112,0.10989287,0.005258747,0.019066619,0.027106887,0.0023636573],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0503652,0.001429192,0.0009794146,0.0023996423,0.002161061,0.0089802,0.003571917,0.004632503,0.00416854],"category_scores_gemma":[0.18565063,0.00080408057,0.000943474,0.0030978261,0.0035348195,0.009947622,0.0032557854,0.0067536775,0.002357918],"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.0025027941,0.000880561,0.018232794,0.0006703355,0.00042820862,0.00019932512,0.0007032509,0.02495021,0.0059280465,0.27446273,0.31546438,0.35557738],"study_design_scores_gemma":[0.0011342921,0.00097062706,0.016701322,0.0016905313,0.00028701412,0.0008128976,0.0020772878,0.196041,0.021448262,0.49868163,0.25987285,0.00028232057],"about_ca_topic_score_codex":0.008934678,"about_ca_topic_score_gemma":0.011503827,"teacher_disagreement_score":0.9496348,"about_ca_system_score_codex":0.0049410486,"about_ca_system_score_gemma":0.004072303,"threshold_uncertainty_score":0.2663598},"labels":[],"label_agreement":null},{"id":"W3017197594","doi":"10.1007/978-3-030-45371-8_26","title":"A Rejection-Based Approach for Detecting SQL Injection Vulnerabilities in Web Applications","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Application Security Vulnerabilities","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; SQL injection; Vulnerability (computing); Secure coding; Web application; SQL; Software engineering; Focus (optics); Software; World Wide Web; Database; Software security assurance; Computer security; Information security; Operating system; Web search query; Query by Example","score_opus":0.023173312074629027,"score_gpt":0.25549867006488913,"score_spread":0.2323253579902601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017197594","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.08989332,0.00074980676,0.8847814,0.00064461475,0.00026174157,0.00053749775,0.00031565948,0.008303626,0.014512307],"genre_scores_gemma":[0.57024336,0.000332491,0.40554443,0.0007236222,0.00020121665,0.00019793262,0.0010798713,0.00066163216,0.0210154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945933,0.0010076072,0.000289544,0.00075692154,0.0029249073,0.0004277916],"domain_scores_gemma":[0.99058855,0.0038536799,0.0010675514,0.0011877298,0.0029735172,0.0003290001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035167383,0.0012773576,0.0014144765,0.004159494,0.0010596475,0.0027880166,0.0035682893,0.002482435,0.0042888047],"category_scores_gemma":[0.009494906,0.00050913537,0.001258308,0.0013844874,0.0011245373,0.0026996594,0.0021186098,0.0017937092,0.0027738975],"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.0016510172,0.0012594851,0.035506062,0.00063500897,0.0004112816,0.0015515583,0.0006882447,0.020768672,0.19238453,0.01906836,0.0125599895,0.71351576],"study_design_scores_gemma":[0.00013354252,0.0010328335,0.011755171,0.00009674096,0.00041837431,0.00340543,0.0006081262,0.8522548,0.09181764,0.021514498,0.016750699,0.00021209069],"about_ca_topic_score_codex":0.0016948921,"about_ca_topic_score_gemma":0.003667043,"teacher_disagreement_score":0.0042888047,"about_ca_system_score_codex":0.00067531364,"about_ca_system_score_gemma":0.0012150859,"threshold_uncertainty_score":0.018598497},"labels":[],"label_agreement":null},{"id":"W3017282729","doi":"10.1007/978-3-030-45771-6_3","title":"Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Breakpoint; Parametric statistics; Dimension (graph theory); Mathematics; Algorithm; Combinatorics; Graph; Affine transformation; Value (mathematics); Function (biology); Geometry; Statistics","score_opus":0.0328768550676217,"score_gpt":0.2756329620101791,"score_spread":0.24275610694255742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017282729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005359491,0.00034575633,0.98567724,0.00013931462,0.00012339366,0.00011956462,0.00018278607,0.0027419913,0.0053104754],"genre_scores_gemma":[0.0470061,0.00014633207,0.9445603,0.0001094272,0.000073248164,0.00024455928,0.0008112903,0.0016963413,0.0053524813],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814415,0.00035879234,0.000117891286,0.00039836246,0.0007502468,0.00023053416],"domain_scores_gemma":[0.99500954,0.0029970855,0.00024337902,0.00089057465,0.0007179227,0.00014147356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357086,0.0031432512,0.0025500208,0.0026844712,0.0011780995,0.0032097339,0.00422184,0.0023607498,0.03730956],"category_scores_gemma":[0.010857564,0.0018795693,0.0027203774,0.0028008563,0.0013643099,0.005651301,0.003972617,0.00566026,0.0057791206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008459673,0.00024943383,0.00067107665,0.0004954243,0.00012587027,0.00009193386,0.00033958373,0.16395272,0.0071530496,0.08116626,0.025400402,0.7195083],"study_design_scores_gemma":[0.00021131849,0.000119809454,0.00040685342,0.00007704572,0.0000589071,0.00008320792,0.0001339023,0.86147356,0.004406127,0.12211364,0.010865112,0.000050457416],"about_ca_topic_score_codex":0.0053130845,"about_ca_topic_score_gemma":0.009375789,"teacher_disagreement_score":0.03730956,"about_ca_system_score_codex":0.0020855404,"about_ca_system_score_gemma":0.0017892774,"threshold_uncertainty_score":0.1248129},"labels":[],"label_agreement":null},{"id":"W3017302601","doi":"10.1007/978-3-030-45257-5_12","title":"Stochastic Sampling of Structural Contexts Improves the Scalability and Accuracy of RNA 3D Module Identification","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal; McGill University","funders":"","keywords":"Computer science; Scalability; Sequence (biology); Identification (biology); Scope (computer science); Nucleic acid secondary structure; Algorithm; Theoretical computer science; Data mining; RNA; Database","score_opus":0.01570331506254085,"score_gpt":0.2590219135206993,"score_spread":0.24331859845815845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017302601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12193921,0.00049482216,0.8668638,0.00032390226,0.00009838828,0.0000735025,0.0004931693,0.00686723,0.0028460145],"genre_scores_gemma":[0.5233924,0.00023958235,0.47171864,0.00026940063,0.00009492154,0.00011941317,0.0014389885,0.0008352466,0.0018914271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872005,0.00042113286,0.000059140544,0.00034521238,0.00034168368,0.000112725356],"domain_scores_gemma":[0.9943816,0.0037512283,0.00020843156,0.0010894773,0.00038142246,0.00018790741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018141244,0.0010061259,0.0015095026,0.0007969649,0.0006025855,0.0011714342,0.0021813046,0.0015961843,0.0036295764],"category_scores_gemma":[0.0073725153,0.0007999467,0.0011645965,0.0010313409,0.00081297796,0.0018420183,0.0024933703,0.0013308078,0.0013798795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009902366,0.00026080912,0.005887199,0.00020074449,0.00020175557,0.00017871108,0.00015450793,0.60190916,0.040007357,0.013430935,0.0065201293,0.33025846],"study_design_scores_gemma":[0.000015215485,0.000019695692,0.00019143472,0.0000025312243,0.0000063787843,0.000024426157,0.000008031535,0.99483407,0.0019110348,0.0027589758,0.00022263626,0.000005606514],"about_ca_topic_score_codex":0.0054093827,"about_ca_topic_score_gemma":0.010696195,"teacher_disagreement_score":0.0054093827,"about_ca_system_score_codex":0.0007543209,"about_ca_system_score_gemma":0.0011698401,"threshold_uncertainty_score":0.012142122},"labels":[],"label_agreement":null},{"id":"W3017322388","doi":"10.1007/978-3-642-13122-6_33","title":"The Feline Josephus Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","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":"University of Victoria","funders":"","keywords":"Fibonacci number; Element (criminal law); Sequence (biology); Value (mathematics); Position (finance); Order (exchange); Combinatorics; Constant (computer programming); Arithmetic; Mathematics; Computer science; Discrete mathematics; Statistics","score_opus":0.024379649818972206,"score_gpt":0.2896866901669337,"score_spread":0.2653070403479615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017322388","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025892727,0.0047268406,0.027290441,0.019190338,0.0012703345,0.00003227578,0.00026669452,0.00014803269,0.92118233],"genre_scores_gemma":[0.61581326,0.0076946705,0.021859715,0.0043519856,0.0022355213,0.00013166784,0.0006119332,0.00026144803,0.34703976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958605,0.00010417071,0.000014886792,0.00009155996,0.000116315045,0.00008707898],"domain_scores_gemma":[0.9994282,0.00030856,0.00003341024,0.00008588422,0.00007418673,0.0000697189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007378201,0.00042022057,0.000761011,0.0009264806,0.0034897863,0.0025072633,0.00092643953,0.002477133,0.018491589],"category_scores_gemma":[0.0031936713,0.00027705086,0.0004730722,0.0011865048,0.0031453166,0.0057631256,0.0020085082,0.0035462559,0.002365774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010814609,0.000006501299,0.00002738157,0.000019315932,0.0000020086452,0.00001588767,0.000058902147,0.00026167688,0.00004671735,0.98057,0.011509321,0.0074713305],"study_design_scores_gemma":[0.0000073757406,0.000003990162,0.000058528964,0.000020420695,0.0000026139412,0.000048070608,0.00007632939,0.0007338695,0.00012897947,0.9540029,0.044912245,0.0000046333944],"about_ca_topic_score_codex":0.001892523,"about_ca_topic_score_gemma":0.0019224305,"teacher_disagreement_score":0.018491589,"about_ca_system_score_codex":0.0020059147,"about_ca_system_score_gemma":0.0013419458,"threshold_uncertainty_score":0.06186056},"labels":[],"label_agreement":null},{"id":"W3017335120","doi":"10.1007/978-3-030-45231-5_26","title":"Semantical Analysis of Contextual Types","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Syntax; Type theory; Type (biology); Abstract syntax; Semantics (computer science); Simple (philosophy); Context (archaeology); Modal; Theoretical computer science; Function (biology); Class (philosophy); Algebra over a field; Programming language; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.024404678533265743,"score_gpt":0.2542942838976449,"score_spread":0.22988960536437916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017335120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12467072,0.002318792,0.7269754,0.0026641998,0.00061749655,0.0001340718,0.0007220801,0.0022976883,0.1395996],"genre_scores_gemma":[0.90733737,0.00059788156,0.08101467,0.00038312547,0.00021971395,0.0001383057,0.00040008422,0.00035772557,0.009551086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745613,0.00085288374,0.00013267582,0.00052643154,0.0006596747,0.00037222332],"domain_scores_gemma":[0.99799526,0.0006013895,0.00011617469,0.00051542936,0.00061874185,0.00015294077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216405,0.0005880968,0.00069268624,0.00203163,0.0023115505,0.0053015803,0.00146297,0.0011158893,0.0071368334],"category_scores_gemma":[0.0033457454,0.00060894183,0.0010019095,0.001766162,0.006264385,0.008448654,0.003898391,0.0020689347,0.0005576076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008870386,0.0000035663736,0.00009174041,0.000018255801,0.0000032033834,0.00003122096,0.00021579309,0.00039287057,0.00027758238,0.99703217,0.00026221963,0.0016624031],"study_design_scores_gemma":[0.000013397233,0.000018922863,0.00032639774,0.00007669945,0.000038004593,0.000111998255,0.00053923344,0.010463417,0.0018778954,0.9478439,0.03866521,0.00002510008],"about_ca_topic_score_codex":0.004922931,"about_ca_topic_score_gemma":0.0040790443,"teacher_disagreement_score":0.0071368334,"about_ca_system_score_codex":0.003678935,"about_ca_system_score_gemma":0.0012849767,"threshold_uncertainty_score":0.026692629},"labels":[],"label_agreement":null},{"id":"W3018867236","doi":"10.1007/978-3-030-45234-6_22","title":"Automated Generation of Consistent Graph Models with First-Order Logic Theorem Provers","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; First-order logic; Automated theorem proving; Graph; Programming language; Theoretical computer science; Algorithm","score_opus":0.026527019988795832,"score_gpt":0.2250484707485506,"score_spread":0.19852145075975478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018867236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022948407,0.00012549799,0.9590129,0.00027238796,0.00004509985,0.00016562718,0.00080076227,0.013993799,0.0026354573],"genre_scores_gemma":[0.19617459,0.00026734124,0.7949421,0.00022217183,0.000022850852,0.000294321,0.0029311962,0.0032604712,0.0018850697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938425,0.0024885281,0.00027863003,0.0006147236,0.002415426,0.00036007699],"domain_scores_gemma":[0.9838309,0.011846153,0.000594056,0.0023015486,0.001290249,0.00013710218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039521097,0.0013092596,0.00088815944,0.001902207,0.00070787367,0.0024928225,0.0030033318,0.001282099,0.008768318],"category_scores_gemma":[0.020890588,0.0009897405,0.0019256099,0.0016849458,0.0013224222,0.0037998687,0.0026552293,0.0022865727,0.0023073612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064555206,0.0009877459,0.0034430919,0.001258553,0.00033269398,0.0009091332,0.00086016406,0.40747657,0.061153032,0.1345108,0.020680476,0.36774218],"study_design_scores_gemma":[0.00014843637,0.000103346785,0.00020051136,0.000042542335,0.00006346605,0.00019524587,0.00011726147,0.8706243,0.05926832,0.061153285,0.008054481,0.000028775454],"about_ca_topic_score_codex":0.0026411829,"about_ca_topic_score_gemma":0.0040637027,"teacher_disagreement_score":0.008768318,"about_ca_system_score_codex":0.0012813989,"about_ca_system_score_gemma":0.0032292795,"threshold_uncertainty_score":0.029332936},"labels":[],"label_agreement":null},{"id":"W3020385185","doi":"10.1007/978-3-030-29387-1","title":"Human-Computer Interaction – INTERACT 2019","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Human–computer interaction; Focus (optics); Interaction design; Human–robot interaction; Field (mathematics); Human interaction; Interactive systems engineering; Robot; User experience design; Artificial intelligence; User interface design","score_opus":0.010839804972112847,"score_gpt":0.24564303075721436,"score_spread":0.23480322578510152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020385185","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086620543,0.024528027,0.035216697,0.0020694498,0.009900598,0.00009891027,0.0014019834,0.0021994007,0.9237187],"genre_scores_gemma":[0.0019054876,0.00665156,0.003347065,0.0003344437,0.00082342065,0.000034321238,0.00073205057,0.00048770016,0.9856838],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956423,0.00003585109,0.000019197505,0.00008538072,0.0002642827,0.000031042222],"domain_scores_gemma":[0.9994041,0.00015840313,0.000024125633,0.000069770234,0.00022216178,0.000121407196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051588024,0.0014642738,0.0009286896,0.0022485885,0.00075978786,0.0035656607,0.001049719,0.0013600677,0.2207166],"category_scores_gemma":[0.0007921921,0.0005813866,0.0005065524,0.002443911,0.0006525385,0.0031771662,0.0017757016,0.00213221,0.17115836],"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.00004487691,0.000044978886,0.00006541606,0.00030819824,0.000013099043,0.00004052706,0.00004164932,0.000500972,0.002372429,0.01788876,0.6187436,0.35993546],"study_design_scores_gemma":[0.0000035240632,0.000020712347,0.00019337937,0.000125494,0.000006114196,0.0001401535,0.000016394708,0.0006992575,0.0006024482,0.004162629,0.9940222,0.000007808045],"about_ca_topic_score_codex":0.00192249,"about_ca_topic_score_gemma":0.004940786,"teacher_disagreement_score":0.2207166,"about_ca_system_score_codex":0.0011275101,"about_ca_system_score_gemma":0.0008670631,"threshold_uncertainty_score":0.73837054},"labels":[],"label_agreement":null},{"id":"W3020893582","doi":"10.1007/978-3-030-46165-2_4","title":"Autoencoder Based Methods for Diagnosis of Autism Spectrum Disorder","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autism Spectrum Disorder Research","field":"Neuroscience","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 Saskatchewan","funders":"","keywords":"Autoencoder; Artificial intelligence; Computer science; Autism spectrum disorder; Support vector machine; Subspace topology; Pattern recognition (psychology); Linear discriminant analysis; Artificial neural network; Machine learning; Discriminant; Autism; Medicine; Psychiatry","score_opus":0.0442145544416793,"score_gpt":0.34499279774261515,"score_spread":0.30077824330093583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020893582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012910992,0.007549906,0.96926,0.00037427232,0.00028294564,0.000035118057,0.00038051556,0.0016292423,0.0075770486],"genre_scores_gemma":[0.21505907,0.009992768,0.7249975,0.00036541116,0.00051829015,0.00012950113,0.0019493669,0.00041508352,0.04657295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980444,0.00004139722,0.000013418578,0.00004724858,0.00008029868,0.000013149569],"domain_scores_gemma":[0.9995097,0.00032245458,0.000020334599,0.000029088436,0.0001096928,0.0000086461205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043340234,0.00054861757,0.00040660487,0.000809204,0.00012159231,0.00046990346,0.0006200685,0.00062665984,0.0047016465],"category_scores_gemma":[0.0010401391,0.00027047374,0.00040240792,0.0004438243,0.00020145428,0.00045695686,0.00041675463,0.00062966946,0.0021756585],"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.00007354771,0.0000424267,0.0008856995,0.0001277169,0.0000502542,0.00010091193,0.000035031964,0.04069415,0.016819224,0.0040722536,0.009795562,0.92730325],"study_design_scores_gemma":[0.000010055734,0.00007310983,0.00445476,0.000095535615,0.000052423937,0.0007366396,0.000043591106,0.9503068,0.017130366,0.0118837785,0.015181317,0.00003168527],"about_ca_topic_score_codex":0.0021436878,"about_ca_topic_score_gemma":0.0031709883,"teacher_disagreement_score":0.0047016465,"about_ca_system_score_codex":0.00024261931,"about_ca_system_score_gemma":0.0002591301,"threshold_uncertainty_score":0.015728593},"labels":[],"label_agreement":null},{"id":"W3020939278","doi":"10.1007/978-3-030-58598-3_35","title":"DiVA: Diverse Visual Feature Aggregation for Deep Metric Learning","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto; Université de Montréal","funders":"","keywords":"Discriminative model; Generalization; Computer science; Artificial intelligence; Metric (unit); Machine learning; Benchmark (surveying); Feature (linguistics); Similarity (geometry); Representation (politics); Feature learning; Class (philosophy); Aggregate (composite); Independent and identically distributed random variables; Range (aeronautics); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.02367885656645275,"score_gpt":0.3189809680917443,"score_spread":0.29530211152529157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020939278","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.013059049,0.0006414401,0.9633452,0.00025122464,0.0002132138,0.00013061558,0.0022759163,0.018150883,0.0019323466],"genre_scores_gemma":[0.24714705,0.00040839872,0.72815025,0.00039591212,0.00016901217,0.0004900441,0.011151374,0.00221535,0.009872609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914825,0.00017323796,0.000043998854,0.00023549465,0.00029877707,0.00010033714],"domain_scores_gemma":[0.99897385,0.0002158384,0.000049231712,0.00043472095,0.0002287223,0.000097705044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010791323,0.0019135253,0.0022610226,0.0014427073,0.00065517286,0.0014765518,0.0027732276,0.0014150181,0.008909636],"category_scores_gemma":[0.0035370842,0.0007465773,0.0011532007,0.0018246172,0.00053188315,0.0025093,0.003860071,0.0028665205,0.00350262],"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.00041625852,0.00025119813,0.0009845418,0.00019989023,0.00018270609,0.000105510284,0.000051252602,0.059252586,0.009388997,0.017315894,0.064100556,0.84775066],"study_design_scores_gemma":[0.000050307102,0.00012316598,0.00035151647,0.000018543873,0.000018796509,0.000074064235,0.000019076131,0.9511507,0.006205017,0.034002934,0.0079658115,0.000020005002],"about_ca_topic_score_codex":0.0055946666,"about_ca_topic_score_gemma":0.011068563,"teacher_disagreement_score":0.008909636,"about_ca_system_score_codex":0.0010941196,"about_ca_system_score_gemma":0.0013816364,"threshold_uncertainty_score":0.02980572},"labels":[],"label_agreement":null},{"id":"W3021019922","doi":"10.1007/978-3-030-53291-8_20","title":"Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Grantová Agentura České Republiky; European Commission","keywords":"Liveness; Computer science; Theoretical computer science; Distributed computing; Population; Petri net; Computation; Scheduling (production processes); Graph; Algorithm; Mathematical optimization; Mathematics","score_opus":0.053061724645414886,"score_gpt":0.2981256269397016,"score_spread":0.24506390229428673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021019922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09348129,0.000026489924,0.90377957,0.00010131507,0.0000113711385,0.0000907083,0.00012767034,0.0016117565,0.0007698142],"genre_scores_gemma":[0.8617077,0.000042807053,0.13715608,0.000043196193,0.000015374251,0.00017504906,0.00022867633,0.0001562933,0.00047478423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964623,0.0010429292,0.00020227421,0.0005744304,0.001430838,0.00028732733],"domain_scores_gemma":[0.980624,0.01355014,0.0018865218,0.0025091607,0.0011858406,0.0002443291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034028694,0.00066857715,0.00064436847,0.0007017399,0.00050515286,0.0015663808,0.0019431332,0.00076510815,0.0013347435],"category_scores_gemma":[0.018034969,0.0006020261,0.0013212815,0.00052258087,0.002921249,0.0024195367,0.0016115146,0.0012365545,0.00017338601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036443578,0.00015697464,0.004875483,0.00026253756,0.00014340832,0.00047429418,0.0005079982,0.7657941,0.047871105,0.14205313,0.0004537878,0.037042867],"study_design_scores_gemma":[0.000040253522,0.00007465704,0.00026261515,0.000009887691,0.000023066523,0.000037845384,0.0000353701,0.9245999,0.022759879,0.05177007,0.00037154774,0.000015048543],"about_ca_topic_score_codex":0.0035733553,"about_ca_topic_score_gemma":0.0033427973,"teacher_disagreement_score":0.0035733553,"about_ca_system_score_codex":0.0015784008,"about_ca_system_score_gemma":0.0023437934,"threshold_uncertainty_score":0.017996311},"labels":[],"label_agreement":null},{"id":"W3021111117","doi":"10.1007/978-3-030-45771-6_25","title":"On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Polytechnique Montréal","funders":"","keywords":"Integer programming; Computer science; Duality (order theory); Integer (computer science); Nonlinear programming; Nonlinear system; Mathematical optimization; Applied mathematics; Algebra over a field; Algorithm; Mathematics; Discrete mathematics; Programming language; Pure mathematics; Physics","score_opus":0.055774730431660056,"score_gpt":0.3478965546864528,"score_spread":0.2921218242547928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021111117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050367154,0.0041199545,0.92762935,0.0009879714,0.0008682254,0.000046697533,0.000087481756,0.000109718334,0.061113887],"genre_scores_gemma":[0.30971214,0.010649657,0.61301005,0.0017436874,0.002363833,0.0004726286,0.0005557095,0.00071523676,0.060777098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852425,0.0009488982,0.000038638802,0.00009748073,0.00033139042,0.000059325113],"domain_scores_gemma":[0.9986865,0.0009556242,0.00006229364,0.00011415268,0.00013037452,0.000051059495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028656104,0.0013891034,0.0015610482,0.00087156205,0.0005223465,0.0023411268,0.0014378156,0.0012572674,0.00593755],"category_scores_gemma":[0.0064607435,0.0006633239,0.0013715684,0.0019353044,0.0019044816,0.0026620885,0.002831408,0.0045471042,0.0011596405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006367194,0.000069797694,0.00012276658,0.00026122903,0.000042314827,0.00007860321,0.00007720626,0.084194705,0.00081024406,0.85647875,0.009520183,0.04828047],"study_design_scores_gemma":[0.000012761986,0.00004403341,0.00007652214,0.000094013674,0.000011252108,0.000073297495,0.000023523893,0.3046296,0.00032028178,0.68263936,0.0120636085,0.000011667404],"about_ca_topic_score_codex":0.0004937316,"about_ca_topic_score_gemma":0.0005128302,"teacher_disagreement_score":0.00593755,"about_ca_system_score_codex":0.0008983921,"about_ca_system_score_gemma":0.00072532846,"threshold_uncertainty_score":0.019863069},"labels":[],"label_agreement":null},{"id":"W3021168917","doi":"10.1007/978-3-319-92058-0_63","title":"Fuzzy Clustering Ensemble for Prioritized Sampling Based on Average and Rough Patterns","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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","funders":"","keywords":"Computer science; Cluster analysis; Data mining; Fuzzy clustering; Sampling (signal processing); Fuzzy logic; Object (grammar); Process (computing); Machine learning; Artificial intelligence","score_opus":0.033034685217131377,"score_gpt":0.2655751375920668,"score_spread":0.23254045237493542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021168917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017163845,0.0004012781,0.98070866,0.00005445809,0.00006332835,0.000051837957,0.000056280085,0.0002018549,0.0012985402],"genre_scores_gemma":[0.39650488,0.0005604628,0.5980412,0.000094737195,0.00018635258,0.00027319527,0.000562895,0.00014818466,0.0036280998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777406,0.00049814273,0.00013891904,0.00040128746,0.0009988456,0.0001886841],"domain_scores_gemma":[0.9974402,0.0010213619,0.000119540164,0.00031269935,0.000986232,0.00011999979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025984687,0.00095836126,0.0025666934,0.0025522048,0.0012767366,0.0014741009,0.0020980001,0.0010657915,0.0022659386],"category_scores_gemma":[0.0052907034,0.00058448437,0.001831593,0.0026257094,0.00043114997,0.0023340008,0.0014181108,0.00096975564,0.00041254595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003767327,0.00018706033,0.0025014556,0.00021783663,0.00034470196,0.00016006557,0.00023903565,0.51361847,0.0076702996,0.028320793,0.004561856,0.44180173],"study_design_scores_gemma":[0.000005037993,0.000028271617,0.00027941618,0.000007016019,0.000030137173,0.000039888655,0.000015276943,0.9940069,0.0006568448,0.004444208,0.00047677458,0.000010143558],"about_ca_topic_score_codex":0.0045219124,"about_ca_topic_score_gemma":0.00462585,"teacher_disagreement_score":0.0045219124,"about_ca_system_score_codex":0.001001605,"about_ca_system_score_gemma":0.0010962319,"threshold_uncertainty_score":0.013742149},"labels":[],"label_agreement":null},{"id":"W3021191127","doi":"10.1007/978-3-030-47358-7_45","title":"Happiness Analysis with Fisher Information of Dirichlet-Multinomial Mixture Model","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Korean Urban and Social Studies","field":"Environmental Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multinomial distribution; Happiness; Dirichlet distribution; Latent Dirichlet allocation; Artificial intelligence; Statistics; Mathematics; Topic model","score_opus":0.009236240197345261,"score_gpt":0.19426057625230334,"score_spread":0.18502433605495808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021191127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02816564,0.0008311558,0.96769375,0.00024801036,0.000074126045,0.000030420108,0.000321797,0.00023510905,0.0023999347],"genre_scores_gemma":[0.72514415,0.0015041053,0.2558237,0.00018997115,0.00034005282,0.00023652644,0.0032134957,0.00030133905,0.013246697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988507,0.0005795512,0.00005020304,0.00022962927,0.00015687231,0.00013299748],"domain_scores_gemma":[0.9990201,0.0005821938,0.00006204162,0.00012524053,0.00016542917,0.00004497498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021356428,0.0005500137,0.0008582138,0.0013328907,0.0006338562,0.0012480185,0.0010735859,0.0007489942,0.0030916708],"category_scores_gemma":[0.0046158293,0.00044515668,0.0018363029,0.0014762318,0.00057417894,0.0018676682,0.0015344584,0.0013063847,0.0010534197],"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.0010603716,0.00027841522,0.016802423,0.00039124352,0.000778121,0.0003985192,0.0007372405,0.26177594,0.011501594,0.2873861,0.01656225,0.40232784],"study_design_scores_gemma":[0.0000073745773,0.000018773919,0.0027421524,0.000017279583,0.0000512984,0.000064431086,0.00007129478,0.9498519,0.0010109103,0.04442967,0.0017031999,0.000031793297],"about_ca_topic_score_codex":0.004679432,"about_ca_topic_score_gemma":0.0035694407,"teacher_disagreement_score":0.004679432,"about_ca_system_score_codex":0.0006004963,"about_ca_system_score_gemma":0.0005921882,"threshold_uncertainty_score":0.011294544},"labels":[],"label_agreement":null},{"id":"W3021223889","doi":"10.1007/978-3-030-45385-5_7","title":"Coupled Electro-mechanical Behavior of Microtubules","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Materials and Mechanics","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Microtubule; Displacement (psychology); Piezoelectricity; Mechanics; Materials science; Finite element method; Cell mechanics; Electric potential; Physics; Voltage; Chemistry; Composite material; Cytoskeleton","score_opus":0.01065817883116981,"score_gpt":0.22004407652949917,"score_spread":0.20938589769832935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021223889","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.67793614,0.0041145454,0.12418861,0.0015276205,0.00051508145,0.00006514072,0.0002914282,0.00042661335,0.19093485],"genre_scores_gemma":[0.9597553,0.0010753269,0.00505659,0.00014117997,0.000057295387,0.000036531554,0.00008128202,0.00006865703,0.033727787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993885,0.000012994722,0.0000022235674,0.0000139694375,0.00002400109,0.000007951154],"domain_scores_gemma":[0.99990153,0.000040007973,0.000012028633,0.000010673489,0.000014166598,0.000021500262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090446,0.00022669144,0.00025482755,0.00032960926,0.0003354793,0.0006251578,0.000716358,0.0006484536,0.0048375893],"category_scores_gemma":[0.00044672846,0.00029854593,0.00028056063,0.00022122118,0.00054138404,0.00075543515,0.00061683636,0.0004054667,0.0005639991],"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.00019245295,0.0001343542,0.00069877156,0.00029745777,0.00012677904,0.00083359715,0.0006276553,0.19536085,0.18745168,0.57597256,0.0058286637,0.03247511],"study_design_scores_gemma":[0.00004247745,0.00010652252,0.00336605,0.000058411177,0.000031503678,0.0004947339,0.00021642138,0.69543713,0.011185189,0.28006044,0.008936744,0.00006437448],"about_ca_topic_score_codex":0.0006087228,"about_ca_topic_score_gemma":0.0006675607,"teacher_disagreement_score":0.0048375893,"about_ca_system_score_codex":0.00041363636,"about_ca_system_score_gemma":0.0001865284,"threshold_uncertainty_score":0.016183376},"labels":[],"label_agreement":null},{"id":"W3021319303","doi":"10.1007/978-3-540-27801-6_4","title":"Optimizing Multiple Spaced Seeds for Homology Search","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Computer science; Homology (biology); Biology; Genetics; Gene","score_opus":0.028448366131551064,"score_gpt":0.2648656440587714,"score_spread":0.23641727792722034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021319303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052648272,0.00040791745,0.93864435,0.00016491434,0.00010787646,0.00012603884,0.00011500333,0.0037461377,0.0040394594],"genre_scores_gemma":[0.22864906,0.00016474223,0.7651975,0.00010344672,0.0000556227,0.0001810988,0.0005055551,0.00082574587,0.0043172017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906355,0.00024164138,0.00004800173,0.00025197736,0.0003053445,0.000089516696],"domain_scores_gemma":[0.9978557,0.001112726,0.00015128663,0.000493299,0.00024607798,0.00014083699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872148,0.0009938282,0.0017982526,0.0014582722,0.0007385482,0.00086703995,0.0023975768,0.0022254454,0.009995058],"category_scores_gemma":[0.006103038,0.00077670475,0.00073762046,0.00196711,0.0009956828,0.0026390133,0.0020732246,0.0012371971,0.0028392742],"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.0011875338,0.00046540433,0.0014485306,0.0003083604,0.00008551214,0.00027588787,0.0002077942,0.3565788,0.041169476,0.0539791,0.012479121,0.5318145],"study_design_scores_gemma":[0.0001128256,0.00015728455,0.00016026945,0.000013120647,0.00002138057,0.00011890365,0.000041339274,0.95411664,0.009198744,0.03391529,0.0021299147,0.00001424677],"about_ca_topic_score_codex":0.0009980011,"about_ca_topic_score_gemma":0.0025409998,"teacher_disagreement_score":0.009995058,"about_ca_system_score_codex":0.0009844806,"about_ca_system_score_gemma":0.0010596965,"threshold_uncertainty_score":0.033436835},"labels":[],"label_agreement":null},{"id":"W3021346137","doi":"10.1007/978-3-030-47358-7_46","title":"Personalized Multi-Faceted Trust Modeling in Social Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Personalization; Trustworthiness; Cluster analysis; Task (project management); Social network (sociolinguistics); Data science; Social trust; Social media; World Wide Web; Internet privacy; Artificial intelligence; Social capital","score_opus":0.05137284569558162,"score_gpt":0.2990774591536944,"score_spread":0.24770461345811276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021346137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037166692,0.0004831495,0.95978385,0.00045449004,0.0000524405,0.000043642238,0.00022279807,0.00020742598,0.0015855501],"genre_scores_gemma":[0.8946577,0.0006863087,0.09762178,0.00009846856,0.00015798204,0.00016514034,0.0005086288,0.000109477405,0.0059946184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977404,0.001179805,0.000106001455,0.00042977658,0.00030750857,0.0002366057],"domain_scores_gemma":[0.9924972,0.0056588026,0.00052030064,0.0006146909,0.0004566651,0.0002522968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031926956,0.00085086195,0.0017664093,0.0007265353,0.000876438,0.002347277,0.0023697692,0.001864801,0.0020195404],"category_scores_gemma":[0.013282284,0.001159201,0.001467048,0.0013673909,0.0011294343,0.0045397673,0.0019561185,0.0024586245,0.0004523611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000710388,0.000048624766,0.0014171998,0.000054378164,0.0000966462,0.00008886618,0.0002293156,0.94638544,0.00035083943,0.031138562,0.0013111564,0.018807976],"study_design_scores_gemma":[0.000001402642,0.000005429109,0.00008154432,0.00000326891,0.0000063403986,0.0000073886736,0.000009478679,0.9882648,0.000036595862,0.011461074,0.000119629534,0.0000031260113],"about_ca_topic_score_codex":0.013227047,"about_ca_topic_score_gemma":0.015624877,"teacher_disagreement_score":0.013227047,"about_ca_system_score_codex":0.0020139876,"about_ca_system_score_gemma":0.0010005797,"threshold_uncertainty_score":0.026300132},"labels":[],"label_agreement":null},{"id":"W3021349904","doi":"10.1007/978-3-030-44584-3_40","title":"Interpretable Neuron Structuring with Graph Spectral Regularization","year":2020,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Center for Advancing Translational Sciences; National Institute of General Medical Sciences; National Institutes of Health; Institut de Valorisation des Données","keywords":"Computer science; Graph; Structuring; Regularization (linguistics); Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Laplacian matrix; Visualization; Laplace operator; Theoretical computer science; Mathematics","score_opus":0.004758703153208391,"score_gpt":0.21935181095274825,"score_spread":0.21459310779953986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021349904","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.014759893,0.0000512638,0.98329645,0.00026076994,0.000021329373,0.000016422971,0.00004890581,0.00039036523,0.0011546606],"genre_scores_gemma":[0.40918034,0.00020164675,0.5840193,0.0003019964,0.00006543955,0.00014991511,0.0003222195,0.0005020821,0.0052570733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996599,0.00012367929,0.000014190364,0.000077022174,0.00009115192,0.000034099303],"domain_scores_gemma":[0.9992217,0.00031185988,0.00009584661,0.00017168929,0.00013987544,0.00005898472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008021076,0.0008351814,0.00052185537,0.0006379806,0.00038689075,0.0010261846,0.0009680995,0.0012515695,0.0020858224],"category_scores_gemma":[0.0031524985,0.00042855047,0.0006577395,0.0004691426,0.0011858038,0.0013697312,0.0015425863,0.0017825824,0.0007710367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019710977,0.00009421475,0.0008271459,0.00014330457,0.00005589273,0.0001612514,0.00025230506,0.6845471,0.05477529,0.14090633,0.00546751,0.112572566],"study_design_scores_gemma":[0.000008291584,0.000015194636,0.00006967883,0.000006212479,0.000003328302,0.000017719036,0.000014853302,0.951715,0.002170031,0.04520682,0.0007659659,0.0000069779408],"about_ca_topic_score_codex":0.0015394966,"about_ca_topic_score_gemma":0.0027378364,"teacher_disagreement_score":0.0020858224,"about_ca_system_score_codex":0.000676602,"about_ca_system_score_gemma":0.00084103644,"threshold_uncertainty_score":0.0069777966},"labels":[],"label_agreement":null},{"id":"W3021428704","doi":"10.1007/978-3-030-47358-7_58","title":"Predicting Aggressive Responsive Behaviour Among People with Dementia","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Elder Abuse and Neglect","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":"Acadia University","funders":"","keywords":"Dementia; Aggression; Harm; Computer science; Term (time); Health care; Artificial intelligence; Psychology; Psychiatry; Medicine; Social psychology; Disease","score_opus":0.013589360907565903,"score_gpt":0.2575293490389353,"score_spread":0.2439399881313694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021428704","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.99327165,0.0008248299,0.00041022204,0.00015740863,0.000025650372,0.00002349305,0.0003960696,0.00001650282,0.0048741978],"genre_scores_gemma":[0.9940369,0.0010787311,0.0011796848,0.000063495536,0.000017716691,0.000036882942,0.00057309447,0.0000046853943,0.0030086783],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998754,0.000050778166,0.000010945936,0.000010975706,0.000030443098,0.000021413982],"domain_scores_gemma":[0.9995403,0.0002791243,0.00005952338,0.000009185246,0.000043929987,0.00006786564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037553132,0.00033990998,0.00027896668,0.0009252266,0.00035289652,0.000537398,0.00029392043,0.00048150925,0.0020727818],"category_scores_gemma":[0.0018286704,0.0001917945,0.0003703751,0.0006090225,0.00010226337,0.00027112282,0.00032862186,0.0006309475,0.0005221337],"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.0000709074,0.00016067234,0.9717746,0.000021679,0.000025418905,0.0001308349,0.00037637082,0.00021790317,0.00015401143,0.00004001698,0.0006482701,0.026379373],"study_design_scores_gemma":[0.0000060073926,0.00025465543,0.99496055,0.000055949928,0.00005256691,0.0005479066,0.0013290768,0.0018698148,0.00014613746,0.0002523409,0.0005149251,0.000010029834],"about_ca_topic_score_codex":0.011302154,"about_ca_topic_score_gemma":0.024060722,"teacher_disagreement_score":0.011302154,"about_ca_system_score_codex":0.000266041,"about_ca_system_score_gemma":0.00024328877,"threshold_uncertainty_score":0.02247274},"labels":[],"label_agreement":null},{"id":"W3021440882","doi":"10.1007/978-3-030-47358-7_47","title":"Mixing ICI and CSI Models for More Efficient Probabilistic Inference","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Guelph","funders":"","keywords":"Conditional independence; Computer science; Inference; Bayesian network; Formalism (music); Exponential family; ENCODE; Independence (probability theory); Probabilistic logic; Representation (politics); Theoretical computer science; Approximate inference; Mixing (physics); Conditional probability; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.039023069112959566,"score_gpt":0.2695183756430562,"score_spread":0.23049530653009664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021440882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005162375,0.00028806558,0.9968526,0.00015521889,0.000074142255,0.000010321505,0.00012371778,0.00023441241,0.0017453482],"genre_scores_gemma":[0.08287836,0.0019504564,0.895828,0.0005963947,0.00071308407,0.00018391469,0.001494523,0.0007146799,0.0156406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987729,0.0005130464,0.000067279136,0.00021469124,0.00033516632,0.000096919845],"domain_scores_gemma":[0.99547535,0.0032206615,0.00012846435,0.0008076913,0.00029013513,0.000077681325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002579163,0.0015703533,0.0019462364,0.0011002572,0.00062482094,0.0024570627,0.0030053342,0.0022766178,0.01723599],"category_scores_gemma":[0.0124753285,0.0013786869,0.002086404,0.003430517,0.0010454825,0.004931301,0.0021597585,0.0069640367,0.0040928735],"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.00013885957,0.000102902355,0.0003620391,0.00025006884,0.00016533695,0.0001461942,0.00011353509,0.4074317,0.0027235746,0.41392353,0.015876284,0.15876603],"study_design_scores_gemma":[0.000011347399,0.000011419166,0.00007896594,0.000023298031,0.000033612574,0.00008410267,0.000008733613,0.85964787,0.0008701324,0.13352154,0.005688496,0.000020502288],"about_ca_topic_score_codex":0.0050180256,"about_ca_topic_score_gemma":0.006480633,"teacher_disagreement_score":0.01723599,"about_ca_system_score_codex":0.0011138837,"about_ca_system_score_gemma":0.0014274665,"threshold_uncertainty_score":0.057660162},"labels":[],"label_agreement":null},{"id":"W3021483918","doi":"10.1007/978-3-030-47358-7_54","title":"A Deeper Look at Bongard Problems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Benchmark (surveying); Task (project management); Set (abstract data type); Machine learning; Deep learning; Programming language","score_opus":0.02206970720635547,"score_gpt":0.23107371084120287,"score_spread":0.2090040036348474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021483918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019500643,0.02707218,0.67199254,0.042107243,0.0036751279,0.00006621719,0.00024046711,0.0006430967,0.2347025],"genre_scores_gemma":[0.5628141,0.017106036,0.2001554,0.009049275,0.004847463,0.00015772878,0.0006513899,0.001181593,0.204037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984711,0.00071373256,0.00005379611,0.00027757927,0.00036640183,0.00011746744],"domain_scores_gemma":[0.99546474,0.003430688,0.0001058826,0.00046021296,0.0003562017,0.0001823144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789336,0.0009891324,0.0013660333,0.00138751,0.0021538055,0.0032130491,0.0020678442,0.0026627837,0.020259956],"category_scores_gemma":[0.014803951,0.00047487146,0.00085187634,0.0017991763,0.0046087517,0.012992895,0.003484845,0.007972442,0.0024011505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042093892,0.000036467598,0.0001279892,0.00010622312,0.0000135393,0.000046741447,0.00016355465,0.0043782145,0.00020358138,0.93614644,0.013930386,0.044804752],"study_design_scores_gemma":[0.000004447105,0.000009614866,0.00006374022,0.000044777822,0.0000030185035,0.00005410429,0.000069135596,0.009379898,0.00014840679,0.9792698,0.010942007,0.000011090542],"about_ca_topic_score_codex":0.0030739915,"about_ca_topic_score_gemma":0.003404681,"teacher_disagreement_score":0.020259956,"about_ca_system_score_codex":0.0018613118,"about_ca_system_score_gemma":0.0010162455,"threshold_uncertainty_score":0.06777626},"labels":[],"label_agreement":null},{"id":"W3021610249","doi":"10.1007/978-3-030-47426-3_30","title":"Retrofitting Embeddings for Unsupervised User Identity Linkage","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Saskatchewan","funders":"Key Laboratory of Computer Network and Information Integration; China Scholarship Council; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; National Social Science Fund of China; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; National Research Foundation","keywords":"Computer science; Discriminative model; Embedding; Retrofitting; Leverage (statistics); Matching (statistics); Identity (music); User modeling; Linkage (software); Machine learning; Data mining; Information retrieval; Artificial intelligence; User interface","score_opus":0.020793468286241075,"score_gpt":0.26716948257962636,"score_spread":0.2463760142933853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021610249","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.027550383,0.00054932,0.96472645,0.00020651349,0.00018162256,0.000057392026,0.0004823332,0.0041115223,0.0021344803],"genre_scores_gemma":[0.5140886,0.0006314839,0.45841825,0.00030272096,0.00020799397,0.00020867457,0.0045558037,0.0013257574,0.020260705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982173,0.0006342244,0.000082411876,0.00052715815,0.0003759259,0.00016291866],"domain_scores_gemma":[0.9967644,0.0012610552,0.00016973504,0.0011425479,0.00055264344,0.00010963215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016836188,0.0012439857,0.0014223271,0.0017528855,0.0007290043,0.0013575339,0.0024040157,0.0021391138,0.005332724],"category_scores_gemma":[0.007947282,0.0007314553,0.0011943505,0.0023133284,0.00079113035,0.0037142267,0.0032716838,0.0027405377,0.0055878814],"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.0003485311,0.00039205616,0.0028242047,0.00015170813,0.00014401431,0.00011561737,0.0002559678,0.09565325,0.004521243,0.015623374,0.015516826,0.8644532],"study_design_scores_gemma":[0.000007531332,0.000052336665,0.00039966078,0.000021832071,0.00001785086,0.00009702194,0.000078739315,0.97614735,0.0029646202,0.017693687,0.002505352,0.000014002805],"about_ca_topic_score_codex":0.0026764353,"about_ca_topic_score_gemma":0.0048637623,"teacher_disagreement_score":0.005332724,"about_ca_system_score_codex":0.0005608545,"about_ca_system_score_gemma":0.0007208102,"threshold_uncertainty_score":0.01783979},"labels":[],"label_agreement":null},{"id":"W3021714371","doi":"10.1007/978-3-319-19156-0","title":"Health Information Science","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Coding and Health Information","field":"Health Professions","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 British Columbia","funders":"","keywords":"Computer science; Psychology","score_opus":0.13428574231530016,"score_gpt":0.4366244035551993,"score_spread":0.30233866123989916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021714371","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036772928,0.052693054,0.0124048935,0.018827666,0.006187828,0.000112721755,0.0010253147,0.00062359276,0.9077572],"genre_scores_gemma":[0.0063694715,0.046646673,0.005491121,0.008650329,0.0062148985,0.0001302547,0.0014353353,0.00024968234,0.9248122],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920684,0.00015255943,0.00003375252,0.00010121793,0.00045834025,0.0000473864],"domain_scores_gemma":[0.99894387,0.00043804213,0.000040661314,0.00016906223,0.00029513869,0.00011335935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136727,0.00097215164,0.0009793652,0.003177044,0.0007670475,0.0043790815,0.0007338837,0.0014479471,0.11470632],"category_scores_gemma":[0.003540259,0.00045486994,0.00047870728,0.0035917694,0.0012893792,0.003220183,0.0019409142,0.0027327337,0.06685017],"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.0000075039634,0.00002114287,0.00006966248,0.00029926648,0.0000094855,0.000023051316,0.00014402704,0.00013795853,0.00022969826,0.060059257,0.7214115,0.21758744],"study_design_scores_gemma":[0.0000027340307,0.000008694168,0.00013325467,0.00016616548,0.0000040810037,0.000041228195,0.00004278118,0.0001168594,0.0000722767,0.030613873,0.968795,0.000003024504],"about_ca_topic_score_codex":0.0024254057,"about_ca_topic_score_gemma":0.0034250163,"teacher_disagreement_score":0.11470632,"about_ca_system_score_codex":0.0020631293,"about_ca_system_score_gemma":0.0028870224,"threshold_uncertainty_score":0.3837309},"labels":[],"label_agreement":null},{"id":"W3021747502","doi":"10.1007/978-3-030-59710-8_48","title":"Source-Relaxed Domain Adaptation for Image Segmentation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Segmentation; Prior probability; Adaptation (eye); Pattern recognition (psychology); Entropy (arrow of time); Image segmentation; Minification; Adversarial system; Divergence (linguistics)","score_opus":0.02280201284094537,"score_gpt":0.25200006118630547,"score_spread":0.2291980483453601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021747502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037386327,0.00056651107,0.9932554,0.00008565367,0.000050657796,0.000026216585,0.00010922078,0.0011874932,0.0009803581],"genre_scores_gemma":[0.17846325,0.0014589312,0.8012187,0.00045228822,0.00020782561,0.00019802248,0.0022969749,0.0012889705,0.014415052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995426,0.00013060607,0.000019639407,0.00016449268,0.00008980645,0.00005279857],"domain_scores_gemma":[0.9992101,0.00039717898,0.000028098773,0.00020120307,0.00012894925,0.000034400426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010693244,0.0010173004,0.0016010734,0.0007498508,0.00035802546,0.00087744865,0.0020290618,0.0019871444,0.0045979475],"category_scores_gemma":[0.0023731107,0.00068679947,0.0012253555,0.0012598742,0.0007936505,0.0016142443,0.0020535863,0.0024511628,0.0024896257],"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.0003736116,0.00015940053,0.00029228075,0.00036522694,0.00018083252,0.00013674475,0.00013092838,0.2603691,0.04522644,0.016920857,0.012599299,0.66324526],"study_design_scores_gemma":[0.000009658072,0.000028195498,0.00020108822,0.000013245825,0.000017261302,0.00008806283,0.000015011333,0.97424465,0.007224045,0.015796637,0.0023490826,0.0000129743385],"about_ca_topic_score_codex":0.0031821039,"about_ca_topic_score_gemma":0.0034984061,"teacher_disagreement_score":0.0045979475,"about_ca_system_score_codex":0.00057769107,"about_ca_system_score_gemma":0.0007849789,"threshold_uncertainty_score":0.015381694},"labels":[],"label_agreement":null},{"id":"W3021969544","doi":"10.1007/978-3-030-47358-7_32","title":"Evaluation of a Failure Prediction Model for Large Scale Cloud Applications","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Ontario Tech University","funders":"","keywords":"Cloud computing; Computer science; Reliability (semiconductor); Scale (ratio); Machine learning; Resource (disambiguation); Data mining; Software; Feature (linguistics); Feature selection; Artificial intelligence; Distributed computing; Operating system","score_opus":0.02528559296614924,"score_gpt":0.26186190684642124,"score_spread":0.236576313880272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021969544","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.78583014,0.0007023256,0.20585866,0.0006148578,0.0001691001,0.00020632039,0.00057139224,0.003077936,0.0029692429],"genre_scores_gemma":[0.9814741,0.00008522209,0.017212883,0.000035503228,0.000016111882,0.000040102186,0.00029133685,0.000032546304,0.00081208866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.00015152899,0.000029753744,0.00008583379,0.00011748771,0.00005537271],"domain_scores_gemma":[0.9965753,0.002536603,0.00012902766,0.00014118604,0.00050849956,0.00010940373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018576505,0.00092985306,0.0007842365,0.00045794778,0.00038803986,0.00073743984,0.0011022063,0.00094463746,0.0017987139],"category_scores_gemma":[0.003907226,0.0002438319,0.0004499069,0.00038403936,0.00025071568,0.0006945921,0.00038633088,0.00065265415,0.00027363608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006236803,0.00029702127,0.0037324487,0.000048873746,0.00006203951,0.000053366864,0.000015673259,0.9479477,0.0020299745,0.0002805284,0.0010501606,0.04385852],"study_design_scores_gemma":[0.0000060225284,0.000043631717,0.00032434313,8.4824535e-7,0.000005697156,0.0000029186938,0.0000033639326,0.99923646,0.00029843266,0.000057286394,0.000019588786,0.0000014020163],"about_ca_topic_score_codex":0.029021377,"about_ca_topic_score_gemma":0.0109214205,"teacher_disagreement_score":0.029021377,"about_ca_system_score_codex":0.0011948439,"about_ca_system_score_gemma":0.001206064,"threshold_uncertainty_score":0.057704926},"labels":[],"label_agreement":null},{"id":"W3021984135","doi":"10.1007/978-3-030-47358-7_33","title":"Customer Segmentation and Churn Prediction in Online Retail","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Customer churn and segmentation","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Customer lifetime value; Computer science; Market segmentation; Analytic hierarchy process; Order (exchange); Customer base; Cluster analysis; Churning; Variable (mathematics); Loyalty business model; Customer retention; Process (computing); Customer relationship management; Logistic regression; Marketing; Data mining; Operations research; Business; Artificial intelligence; Machine learning; Mathematics; Database","score_opus":0.02319109800859011,"score_gpt":0.23360488059146747,"score_spread":0.21041378258287735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021984135","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.9259451,0.005189248,0.057537194,0.0009126337,0.00014859089,0.00003238506,0.00096843264,0.00062580465,0.008640683],"genre_scores_gemma":[0.9877216,0.00073759694,0.005888897,0.000054767177,0.00014211623,0.000018146224,0.0008342775,0.000052537092,0.004550025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999676,0.000094451825,0.000015835127,0.000078264115,0.00006395302,0.000071420916],"domain_scores_gemma":[0.9976725,0.001862831,0.00013145259,0.000054979333,0.00014332256,0.00013489548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000979838,0.0005982162,0.00091023336,0.001321996,0.00042242795,0.0011036379,0.0008270584,0.0009352811,0.002409862],"category_scores_gemma":[0.0028087345,0.00052277267,0.00051395333,0.0017323688,0.0003399941,0.0015936458,0.00048013084,0.0010355366,0.0008225008],"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.0012639484,0.00071300694,0.19675098,0.00013893716,0.00024377998,0.00037871703,0.00032553647,0.4590427,0.001484624,0.007287716,0.016499013,0.31587106],"study_design_scores_gemma":[0.0000043154237,0.000042457672,0.013931949,0.0000124563585,0.000014911125,0.000039665585,0.00004257457,0.982381,0.00021058692,0.0029833813,0.0003289335,0.000007801282],"about_ca_topic_score_codex":0.013911161,"about_ca_topic_score_gemma":0.01648819,"teacher_disagreement_score":0.013911161,"about_ca_system_score_codex":0.0009584119,"about_ca_system_score_gemma":0.00051996316,"threshold_uncertainty_score":0.02766037},"labels":[],"label_agreement":null},{"id":"W3022206370","doi":"10.1007/978-3-030-58607-2_7","title":"Defocus Deblurring Using Dual-Pixel Data","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","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":"Centre for Social Innovation; York University","funders":"","keywords":"Deblurring; Artificial intelligence; Computer vision; Computer science; Focus (optics); Aperture (computer memory); Depth of field; Lens (geology); Pixel; Image restoration; Photography; Image (mathematics); Image processing; Optics; Physics","score_opus":0.0560107448646267,"score_gpt":0.30985165035201856,"score_spread":0.25384090548739185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022206370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13883142,0.0009034234,0.84584326,0.0005052449,0.0001782091,0.000108046195,0.00081295695,0.0021567466,0.010660823],"genre_scores_gemma":[0.20632918,0.0007233971,0.7837986,0.00014761931,0.00006630666,0.000082532955,0.0010604033,0.0003862063,0.0074058166],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999582,0.00003959095,0.00002403959,0.00008914185,0.00020564573,0.00005955709],"domain_scores_gemma":[0.99903995,0.00019863881,0.00010331491,0.0003267457,0.00026688332,0.00006441531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039567702,0.00092227635,0.0007012068,0.0012191938,0.00047668876,0.0012568759,0.00058673153,0.0010095946,0.007955474],"category_scores_gemma":[0.0019276434,0.00051910145,0.00046729573,0.0013583008,0.0005360633,0.0018533504,0.0016450861,0.0012442577,0.0022707528],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010344095,0.0001308782,0.0011134762,0.00034435085,0.00005426569,0.00017465302,0.00023046769,0.006265039,0.75208235,0.007477968,0.0023926836,0.2286994],"study_design_scores_gemma":[0.000081007616,0.0002417016,0.0035603454,0.000068771384,0.000075597396,0.0010342792,0.00016123214,0.16404416,0.8062228,0.006606456,0.01780775,0.00009580506],"about_ca_topic_score_codex":0.00094954006,"about_ca_topic_score_gemma":0.0019375603,"teacher_disagreement_score":0.007955474,"about_ca_system_score_codex":0.00043171813,"about_ca_system_score_gemma":0.00063487596,"threshold_uncertainty_score":0.026613653},"labels":[],"label_agreement":null},{"id":"W3022336006","doi":"10.1007/978-3-030-47358-7_3","title":"Investigating Relational Recurrent Neural Networks with Variable Length Memory Pointer","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Western University","funders":"","keywords":"Computer science; Pointer (user interface); Encoder; ENCODE; Sentence; Auxiliary memory; Artificial intelligence; Theoretical computer science; Computer hardware; Operating system","score_opus":0.025206797256334935,"score_gpt":0.22924896301974043,"score_spread":0.2040421657634055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022336006","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.38292167,0.0013876357,0.6071549,0.00059894146,0.00013104503,0.00003995215,0.00010992412,0.0008531632,0.006802672],"genre_scores_gemma":[0.95567125,0.00030026978,0.03831241,0.00007368125,0.00004349823,0.00002547614,0.0001663057,0.00009869226,0.0053084185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978906,0.00006762632,0.000009978851,0.00006451811,0.000035566423,0.000033342458],"domain_scores_gemma":[0.9975084,0.0019200044,0.00013875231,0.00016426943,0.00020051458,0.000068052956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010225718,0.00043265274,0.00058607175,0.0002737535,0.00026681676,0.0010608161,0.0015573706,0.0011866762,0.0030479464],"category_scores_gemma":[0.0059621623,0.00045234602,0.0004232125,0.0003942861,0.00047524984,0.0026272347,0.00077237585,0.0010722087,0.00030056477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036581326,0.0001926809,0.0028286828,0.00021542494,0.00018224401,0.00043744675,0.00022567748,0.7829284,0.022790575,0.10032321,0.002472001,0.08703786],"study_design_scores_gemma":[0.0000021968408,0.000015645952,0.00008161969,0.0000024522235,0.00000765849,0.000009008593,0.000010838699,0.99396616,0.0007902532,0.005032992,0.00007899875,0.0000021522264],"about_ca_topic_score_codex":0.0031519546,"about_ca_topic_score_gemma":0.002969609,"teacher_disagreement_score":0.0031519546,"about_ca_system_score_codex":0.00071622146,"about_ca_system_score_gemma":0.00034303532,"threshold_uncertainty_score":0.010196388},"labels":[],"label_agreement":null},{"id":"W3022338266","doi":"10.1007/978-3-030-45385-5_65","title":"Blood Cell Types Classification Using CNN","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Convolutional neural network; Eosinophil; Immune system; White blood cell; Immunology; Leukemia; Artificial intelligence; Medicine","score_opus":0.029959547207480453,"score_gpt":0.24635901735120672,"score_spread":0.21639947014372626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022338266","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.16538559,0.006885151,0.77698785,0.0008332209,0.0012516457,0.0002774077,0.0036220367,0.007460672,0.037296373],"genre_scores_gemma":[0.62062204,0.005809119,0.30681744,0.00089474744,0.00046132825,0.0002066886,0.0073968074,0.00048152608,0.057310235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988127,0.0000065638087,0.0000052457463,0.000040095012,0.00003454323,0.00003222462],"domain_scores_gemma":[0.9998915,0.00002060022,0.000008688595,0.000017989041,0.00004980419,0.000011391506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000236046,0.00065835414,0.0004646985,0.0009767988,0.00016530612,0.00075804384,0.0006551719,0.0005206522,0.0036097409],"category_scores_gemma":[0.00034450984,0.00029764758,0.0006763883,0.0008745607,0.00013705256,0.0005413546,0.00046261284,0.00041224816,0.0022461815],"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.00019315428,0.00007936544,0.005375735,0.0001265738,0.00011242955,0.00015594269,0.000033290446,0.01341719,0.06639518,0.0016478129,0.014582353,0.89788103],"study_design_scores_gemma":[0.000014659917,0.00014632993,0.012496144,0.00007822683,0.00023871798,0.00067074224,0.00006031996,0.8576361,0.10108397,0.004556663,0.022975383,0.00004267404],"about_ca_topic_score_codex":0.0056825597,"about_ca_topic_score_gemma":0.007124339,"teacher_disagreement_score":0.0056825597,"about_ca_system_score_codex":0.00046655312,"about_ca_system_score_gemma":0.0003513875,"threshold_uncertainty_score":0.012075782},"labels":[],"label_agreement":null},{"id":"W3022446017","doi":"10.1007/978-3-030-47358-7_26","title":"Partial Label Learning by Entropy Minimization","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Ground truth; Training set; Minification; Artificial intelligence; Entropy (arrow of time); Machine learning; Set (abstract data type)","score_opus":0.018584185021082743,"score_gpt":0.243421951344673,"score_spread":0.22483776632359026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022446017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035993734,0.00024230056,0.99353045,0.00019036588,0.00004472882,0.000031188607,0.000121234014,0.00070771144,0.0015326175],"genre_scores_gemma":[0.19064388,0.00060475076,0.7842734,0.0004760799,0.00031085566,0.0003449965,0.0022074722,0.0010142477,0.020124337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986689,0.0005342525,0.00006122954,0.00029781405,0.000340126,0.00009775629],"domain_scores_gemma":[0.99760085,0.0013833015,0.00010446951,0.00055949256,0.00027063186,0.0000812595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016232915,0.0010000604,0.0019918801,0.0011931345,0.0008744636,0.0018529482,0.0022294184,0.0016462895,0.0067550987],"category_scores_gemma":[0.003937634,0.00080307096,0.0014827593,0.0016040762,0.0014461743,0.0032961816,0.0035634213,0.0025274686,0.0026365886],"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.0002064868,0.00012542897,0.0007038669,0.0002474234,0.00013947873,0.00007047626,0.00011865051,0.15757117,0.007843136,0.072110035,0.020738922,0.74012494],"study_design_scores_gemma":[0.0000116292085,0.000040076313,0.00016497502,0.00001828912,0.000020120508,0.00005455277,0.000016119986,0.90794146,0.00273263,0.08666488,0.0023218018,0.00001347803],"about_ca_topic_score_codex":0.0017097164,"about_ca_topic_score_gemma":0.0028155365,"teacher_disagreement_score":0.0067550987,"about_ca_system_score_codex":0.0010175175,"about_ca_system_score_gemma":0.001105673,"threshold_uncertainty_score":0.022598028},"labels":[],"label_agreement":null},{"id":"W3022552813","doi":"10.1007/978-3-030-46133-1_22","title":"Augmenting Semantic Representation of Depressive Language: From Forums to Microblogs","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","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 Alberta","funders":"","keywords":"Word embedding; Computer science; Natural language processing; Artificial intelligence; Word (group theory); Embedding; Lexicon; Word2vec; Representation (politics); Domain (mathematical analysis); Semantics (computer science); Microblogging; Feature (linguistics); Distributional semantics; Task (project management); Social media; Semantic similarity; Linguistics; World Wide Web","score_opus":0.030183106493409606,"score_gpt":0.34439446711885674,"score_spread":0.31421136062544713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022552813","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.5583357,0.005588598,0.34554905,0.0039618593,0.002221484,0.00041784934,0.033537425,0.017240273,0.033147786],"genre_scores_gemma":[0.83381456,0.0011747789,0.13475706,0.00034972906,0.00047303582,0.0001899086,0.023876434,0.0006245687,0.004740025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.00025055764,0.000041692994,0.00018889597,0.00006691156,0.0000677437],"domain_scores_gemma":[0.99686736,0.0021186154,0.0001328361,0.00034889512,0.0004032106,0.00012908911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082564016,0.0008897599,0.00038629517,0.0021286802,0.0004322679,0.0017477768,0.0006702623,0.0010247417,0.006088951],"category_scores_gemma":[0.0051746587,0.0003143103,0.00063104404,0.0013201884,0.00034037125,0.004639502,0.0017539957,0.00096270675,0.0032373182],"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.0017138968,0.0009250533,0.010816862,0.001267004,0.00016990279,0.0008631858,0.0035841349,0.0067496295,0.060561348,0.009458287,0.041969575,0.86192113],"study_design_scores_gemma":[0.0002535823,0.0010604446,0.037864726,0.0006711164,0.0005703268,0.0014631993,0.0073104277,0.65196115,0.055266034,0.122762114,0.12053183,0.00028510616],"about_ca_topic_score_codex":0.0022097772,"about_ca_topic_score_gemma":0.0031813374,"teacher_disagreement_score":0.006088951,"about_ca_system_score_codex":0.0003695023,"about_ca_system_score_gemma":0.00043723334,"threshold_uncertainty_score":0.02036953},"labels":[],"label_agreement":null},{"id":"W3022585926","doi":"10.1007/978-3-030-47358-7_11","title":"Selection Driven Query Focused Abstractive Document Summarization","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Automatic summarization; Computer science; ENCODE; Selection (genetic algorithm); Encoder; Artificial intelligence; Representation (politics); Mechanism (biology); Sequence (biology); Natural language processing; State (computer science); Information retrieval; Algorithm","score_opus":0.016625947420913747,"score_gpt":0.23858851603286704,"score_spread":0.2219625686119533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022585926","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.0338581,0.010236156,0.91451615,0.0012743847,0.0011730053,0.00084068935,0.009456263,0.019671338,0.008973888],"genre_scores_gemma":[0.17875972,0.0040881205,0.738144,0.00077497365,0.0015990754,0.0006837116,0.03409498,0.001449903,0.04040551],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987966,0.0002998206,0.00013527561,0.00022454945,0.00043097607,0.00011278152],"domain_scores_gemma":[0.9976361,0.0007894754,0.00014640667,0.0002936838,0.0010540643,0.00008025607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010771864,0.0016505576,0.0018293704,0.0029844702,0.0008109621,0.0020607351,0.0014612206,0.0011203053,0.0105804475],"category_scores_gemma":[0.0029665767,0.0004385633,0.0010399038,0.0036660174,0.00031356115,0.0017626239,0.0011717058,0.0011450038,0.008003846],"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.00091696146,0.00021869782,0.00065452524,0.0011585102,0.00021297773,0.00031225203,0.00025484772,0.010206287,0.113200806,0.0030596734,0.09008301,0.77972144],"study_design_scores_gemma":[0.0002772536,0.0011244214,0.004953724,0.00016085338,0.0010234741,0.0011383182,0.0007299172,0.6442226,0.19103405,0.013349562,0.14180417,0.00018170566],"about_ca_topic_score_codex":0.0023108579,"about_ca_topic_score_gemma":0.004348916,"teacher_disagreement_score":0.0105804475,"about_ca_system_score_codex":0.0005087354,"about_ca_system_score_gemma":0.0010603247,"threshold_uncertainty_score":0.035395145},"labels":[],"label_agreement":null},{"id":"W3022586029","doi":"10.1007/978-3-030-47358-7_28","title":"From Explicit to Implicit Entity Linking: A Learn to Rank Framework","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Entity linking; Task (project management); Phrase; Natural language processing; Feature (linguistics); Rank (graph theory); Ranking (information retrieval); Information retrieval; Artificial intelligence; Linguistics; Knowledge base; Mathematics","score_opus":0.016466575616550433,"score_gpt":0.2771304388561439,"score_spread":0.26066386323959345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022586029","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.012772185,0.0013126375,0.97632056,0.0009915065,0.00014982591,0.000081751255,0.0011045233,0.0039532944,0.0033136252],"genre_scores_gemma":[0.34847495,0.0017481704,0.6187403,0.0008749029,0.00082070235,0.0002667433,0.0066359993,0.0010594289,0.021378716],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970174,0.00097560807,0.00017263982,0.0008608619,0.00065604004,0.0003174112],"domain_scores_gemma":[0.9916544,0.004710903,0.00050948345,0.0017594112,0.0010797941,0.00028600267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042273803,0.0019628326,0.0027159024,0.0032737197,0.0013273516,0.0043645906,0.0053591616,0.004104899,0.009724383],"category_scores_gemma":[0.013131278,0.0011407025,0.0016441246,0.003776567,0.0017306685,0.011460329,0.004691269,0.005523442,0.0047066165],"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.00060117577,0.0006235217,0.0021806706,0.00038512127,0.0002641513,0.00023552027,0.0002408382,0.10586541,0.0035101005,0.072471194,0.035048388,0.77857393],"study_design_scores_gemma":[0.000044081346,0.00011600692,0.00032960557,0.00005909975,0.00008427041,0.0001237186,0.00008635203,0.8319838,0.0033921825,0.15903956,0.0046925917,0.000048771828],"about_ca_topic_score_codex":0.006430914,"about_ca_topic_score_gemma":0.011909829,"teacher_disagreement_score":0.009724383,"about_ca_system_score_codex":0.001198678,"about_ca_system_score_gemma":0.002171901,"threshold_uncertainty_score":0.03253126},"labels":[],"label_agreement":null},{"id":"W3022604549","doi":"10.1007/978-3-030-47358-7_52","title":"A Scheme for Generating a Dataset for Anomalous Activity Detection in IoT Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":298,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Botnet; Internet of Things; Intrusion detection system; Scheme (mathematics); Data mining; Set (abstract data type); The Internet; Artificial intelligence; Computer security; World Wide Web","score_opus":0.022738886626736152,"score_gpt":0.25205342187563795,"score_spread":0.2293145352489018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022604549","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.02074656,0.00019285662,0.9158563,0.00042501616,0.00026643518,0.001342404,0.028150527,0.031039309,0.0019807033],"genre_scores_gemma":[0.10973959,0.00016457844,0.82398903,0.00018642264,0.00010116829,0.0014419651,0.061333686,0.00049171544,0.002551868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.00016383336,0.0002318778,0.0004240092,0.0006051897,0.0001161027],"domain_scores_gemma":[0.9962919,0.0007088549,0.00027726943,0.0017984331,0.0007492539,0.00017419054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017071196,0.00095783075,0.0009216009,0.0029115998,0.0009861192,0.0018347882,0.0020349536,0.0014184747,0.0032181893],"category_scores_gemma":[0.005503506,0.00056372426,0.0011650342,0.0026686306,0.00037070576,0.0023472155,0.002419874,0.0016890464,0.0032417052],"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.0011517829,0.0010148253,0.019400956,0.0006034902,0.00030768782,0.0008082136,0.00038129895,0.049140483,0.08284389,0.020663545,0.11023975,0.7134441],"study_design_scores_gemma":[0.00014657131,0.0003148564,0.009895876,0.00008297651,0.000090958216,0.0008783362,0.00018690595,0.8582483,0.055134274,0.026276918,0.048622247,0.00012178359],"about_ca_topic_score_codex":0.002518169,"about_ca_topic_score_gemma":0.0046153427,"teacher_disagreement_score":0.0032181893,"about_ca_system_score_codex":0.000909354,"about_ca_system_score_gemma":0.0017946092,"threshold_uncertainty_score":0.01076597},"labels":[],"label_agreement":null},{"id":"W3022618186","doi":"10.1007/978-3-030-72013-1_16","title":"MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Defense Advanced Research Projects Agency","keywords":"Algorithm; Computer science; Machine learning; Ranking (information retrieval); Artificial intelligence","score_opus":0.022442758596539512,"score_gpt":0.2719503525007648,"score_spread":0.2495075939042253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022618186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014150345,0.0009412749,0.7569495,0.0009824374,0.0003556736,0.00056073634,0.004613776,0.21267277,0.008773572],"genre_scores_gemma":[0.14227372,0.00032542174,0.8238674,0.0010345804,0.0002732381,0.0011692676,0.011926711,0.014396933,0.0047327075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99406034,0.002213641,0.0005831995,0.0008737345,0.0018899465,0.0003791242],"domain_scores_gemma":[0.9874464,0.008841435,0.000769965,0.0014782271,0.0012088687,0.0002550241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054383567,0.0028667825,0.0016535808,0.0031014082,0.00083157106,0.0030174588,0.0038679852,0.002031393,0.02517412],"category_scores_gemma":[0.026334854,0.0011923937,0.0034317512,0.0021472047,0.0011910303,0.003951764,0.002812146,0.0036375937,0.009324036],"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.0015750832,0.00048717455,0.007393826,0.0021853326,0.0005002321,0.0003272459,0.00019837265,0.15687434,0.00649809,0.04086069,0.22033028,0.5627693],"study_design_scores_gemma":[0.00032371984,0.00019572384,0.00029931482,0.000089751724,0.000046852918,0.00008874831,0.000035103265,0.9512439,0.0069619766,0.025196884,0.015483038,0.00003502742],"about_ca_topic_score_codex":0.0016717376,"about_ca_topic_score_gemma":0.004881066,"teacher_disagreement_score":0.02517412,"about_ca_system_score_codex":0.0016595474,"about_ca_system_score_gemma":0.00400985,"threshold_uncertainty_score":0.08421582},"labels":[],"label_agreement":null},{"id":"W3022641085","doi":"10.1007/978-3-030-47358-7_48","title":"RideSafe: Detecting Sexual Harassment in Rideshares","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disgust; Harassment; Mel-frequency cepstrum; Computer science; Support vector machine; Speech recognition; Convolutional neural network; Anger; Long short term memory; Cepstrum; Artificial intelligence; Psychology; Artificial neural network; Feature extraction; Recurrent neural network; Social psychology","score_opus":0.04474717212521515,"score_gpt":0.30899940164507683,"score_spread":0.26425222951986166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022641085","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.32052553,0.010793498,0.3039769,0.001807657,0.003367482,0.0018630142,0.056701954,0.17349464,0.12746932],"genre_scores_gemma":[0.36602017,0.002861874,0.3934607,0.0014464706,0.000606189,0.00094272994,0.053254966,0.0043896027,0.17701726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979895,0.000030125057,0.000008443952,0.000050303253,0.00007905424,0.000033144643],"domain_scores_gemma":[0.9998266,0.000052221327,0.0000102315735,0.000023074652,0.000060268183,0.000027608816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033783558,0.0009859867,0.0008251549,0.0010590118,0.00033405717,0.0008315484,0.0011878856,0.0010771223,0.015017823],"category_scores_gemma":[0.00073849043,0.00025812944,0.0004013915,0.0005231435,0.00013968068,0.00057250896,0.0008740632,0.0003646535,0.011677816],"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.000527687,0.00016114279,0.009460389,0.0004237065,0.00012649932,0.0005195939,0.00035215466,0.0013976435,0.0406954,0.00087794435,0.22853635,0.71692145],"study_design_scores_gemma":[0.00030053576,0.001013537,0.16864064,0.0004282042,0.0005748667,0.0067235464,0.002145429,0.21264292,0.14430974,0.0064947214,0.45632476,0.00040109246],"about_ca_topic_score_codex":0.0048302854,"about_ca_topic_score_gemma":0.010983891,"teacher_disagreement_score":0.015017823,"about_ca_system_score_codex":0.00018269381,"about_ca_system_score_gemma":0.00021058448,"threshold_uncertainty_score":0.050239682},"labels":[],"label_agreement":null},{"id":"W3022654911","doi":"10.1007/978-3-030-47358-7_43","title":"Similarity Matching of Temporal Event-Interval Sequences","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Similarity (geometry); Computer science; Cosine similarity; Interval (graph theory); Sequence (biology); Kernel (algebra); Pattern recognition (psychology); Matching (statistics); Event (particle physics); Euclidean distance; Similitude; Nearest neighbor search; Artificial intelligence; Support vector machine; Algorithm; Data mining; Mathematics; Image (mathematics); Combinatorics","score_opus":0.0231037477562405,"score_gpt":0.2495760229332539,"score_spread":0.2264722751770134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022654911","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.107062794,0.0013924948,0.8842707,0.00011527828,0.00020673312,0.00014284278,0.0007620138,0.0012334121,0.0048136557],"genre_scores_gemma":[0.72681254,0.0010568413,0.2624054,0.00008123302,0.00021416566,0.00010401073,0.0034071526,0.00019094304,0.0057276897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988487,0.0001746569,0.000118031334,0.00031371452,0.000459632,0.0000852599],"domain_scores_gemma":[0.99826425,0.0006506272,0.0002376848,0.00031231728,0.000453087,0.000082100865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089859194,0.00029203919,0.0006807444,0.0034567663,0.00032364964,0.0010683043,0.0011094719,0.0007236901,0.0040061185],"category_scores_gemma":[0.0059355972,0.0002129113,0.0006330358,0.004188347,0.0002950145,0.0016956974,0.0008539668,0.00039982476,0.0012559335],"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.0010606206,0.0002564451,0.007688608,0.00037557274,0.00016867668,0.00042080847,0.00028592866,0.052829124,0.034938853,0.027256913,0.0055719656,0.86914647],"study_design_scores_gemma":[0.00004117017,0.0002904707,0.009589671,0.000053899963,0.00008375718,0.0007565254,0.00020918087,0.9200788,0.017686121,0.040462367,0.010708136,0.000039910843],"about_ca_topic_score_codex":0.0015274995,"about_ca_topic_score_gemma":0.0011530981,"teacher_disagreement_score":0.0040061185,"about_ca_system_score_codex":0.00040185303,"about_ca_system_score_gemma":0.0004925576,"threshold_uncertainty_score":0.013401806},"labels":[],"label_agreement":null},{"id":"W3022739968","doi":"10.1007/978-3-030-47358-7_51","title":"Improving Classification Using Topic Correlation and Expectation Propagation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational and Text Analysis Methods","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":"Concordia University","funders":"","keywords":"Latent Dirichlet allocation; Computer science; Dirichlet distribution; Topic model; Probabilistic logic; Artificial intelligence; Inference; Marginal distribution; Independence (probability theory); Machine learning; Mathematics; Statistics; Random variable","score_opus":0.056294409750157016,"score_gpt":0.3279848024457549,"score_spread":0.27169039269559786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022739968","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.024653362,0.002425287,0.96434426,0.0006733318,0.00047321632,0.00012222254,0.0004533792,0.0049620774,0.0018929142],"genre_scores_gemma":[0.33443752,0.0021567792,0.6362099,0.0009391373,0.0021884192,0.00044475278,0.0067085666,0.0016205064,0.0152944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996128,0.0012642237,0.0002686815,0.0010064766,0.0009269198,0.00040560757],"domain_scores_gemma":[0.9896988,0.0068489467,0.0004344478,0.0011145159,0.0016339041,0.00026936043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005254453,0.002620076,0.0034758565,0.0041717277,0.00148441,0.0030987125,0.003545575,0.0036252476,0.0039085625],"category_scores_gemma":[0.010766483,0.0010009091,0.0032633084,0.0054782922,0.00083520054,0.005576878,0.0030646592,0.0043821824,0.0049167215],"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.00078664493,0.0005770314,0.0036358053,0.00033161356,0.0005264699,0.00013553491,0.00026616766,0.05281083,0.011961758,0.005649009,0.029709803,0.8936093],"study_design_scores_gemma":[0.000052164243,0.00010728313,0.001001461,0.00002447077,0.0001893881,0.00010049745,0.000056781653,0.979736,0.005431359,0.010823331,0.002447713,0.000029601219],"about_ca_topic_score_codex":0.0056491653,"about_ca_topic_score_gemma":0.008419906,"teacher_disagreement_score":0.0056491653,"about_ca_system_score_codex":0.0010201519,"about_ca_system_score_gemma":0.0019312524,"threshold_uncertainty_score":0.02778852},"labels":[],"label_agreement":null},{"id":"W3022773562","doi":"10.1007/978-3-030-47358-7_35","title":"Query Focused Abstractive Summarization via Incorporating Query Relevance and Transfer Learning with Transformer Models","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Automatic summarization; Transformer; Artificial intelligence; Transfer of learning; Relevance (law); Relevance feedback; Natural language processing; Information retrieval; Image retrieval; Image (mathematics)","score_opus":0.017357309336434784,"score_gpt":0.21255671522419398,"score_spread":0.1951994058877592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022773562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011376974,0.0011281216,0.98147994,0.0003113145,0.00015720811,0.00013107822,0.00033773974,0.0036327622,0.0014448036],"genre_scores_gemma":[0.44685102,0.0016403449,0.53142065,0.0005618559,0.001008221,0.00038639293,0.00466682,0.0009224133,0.012542243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895006,0.0002953959,0.00010406314,0.0002805624,0.00026837044,0.00010156308],"domain_scores_gemma":[0.99818254,0.00087518996,0.00012946854,0.0002608643,0.0004865541,0.000065450404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015765663,0.0013209367,0.0017097155,0.0017648243,0.0005112206,0.001605531,0.0017541469,0.0011875745,0.0048201536],"category_scores_gemma":[0.0044834954,0.00049842,0.0012434846,0.0019698893,0.00046013462,0.0036992796,0.0015227658,0.0017686127,0.0029852334],"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.0006738356,0.0003043232,0.0005673647,0.00040505175,0.00018642769,0.00014966006,0.00022593512,0.0652157,0.036625203,0.008873969,0.017457487,0.86931497],"study_design_scores_gemma":[0.00003889658,0.00015762643,0.00027988313,0.000013144827,0.00011624906,0.00006968756,0.00004548577,0.97702765,0.010272836,0.009005805,0.00294894,0.000023720086],"about_ca_topic_score_codex":0.0026283655,"about_ca_topic_score_gemma":0.0040955935,"teacher_disagreement_score":0.0048201536,"about_ca_system_score_codex":0.0006682863,"about_ca_system_score_gemma":0.0010478937,"threshold_uncertainty_score":0.016125083},"labels":[],"label_agreement":null},{"id":"W3022817842","doi":"10.1007/978-3-030-47358-7_42","title":"An Energy-Efficient Method with Dynamic GPS Sampling Rate for Transport Mode Detection and Trip Reconstruction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Global Positioning System; Energy consumption; Real-time computing; Sampling (signal processing); Energy (signal processing); Mode (computer interface); Reduction (mathematics); Particle filter; Path (computing); Filter (signal processing); Algorithm; Simulation; Statistics; Telecommunications; Computer vision; Mathematics; Electrical engineering","score_opus":0.019776318820862605,"score_gpt":0.29853404711913917,"score_spread":0.27875772829827655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022817842","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.0031763394,0.00014987733,0.9954407,0.000024566145,0.000048960188,0.000026642405,0.000059465645,0.0004967714,0.00057668786],"genre_scores_gemma":[0.06398178,0.00029662036,0.9300443,0.0000602626,0.000068355344,0.00012335497,0.00052887277,0.00014195862,0.0047545154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996617,0.0000508411,0.000023173096,0.00007779263,0.00015417932,0.00003231466],"domain_scores_gemma":[0.99959475,0.00013848025,0.000023938024,0.00006145903,0.00016455728,0.000016861435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003867257,0.00079963735,0.0008511433,0.00088905107,0.00035797528,0.0006033404,0.0013304853,0.00072676694,0.004739058],"category_scores_gemma":[0.0013196623,0.0004961111,0.0007828701,0.001095808,0.00022502443,0.0007713395,0.00088998245,0.0006924724,0.0025574493],"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.00029605467,0.00012226787,0.0009087685,0.00014960156,0.000089028574,0.00011882353,0.00007990264,0.07291096,0.045196664,0.004339709,0.0044588456,0.8713295],"study_design_scores_gemma":[0.000017549573,0.00003753791,0.0006929714,0.000011773792,0.000031874722,0.0002024328,0.000026680018,0.98375654,0.010397507,0.0015425249,0.0032583906,0.000024240457],"about_ca_topic_score_codex":0.004688814,"about_ca_topic_score_gemma":0.0062517724,"teacher_disagreement_score":0.004739058,"about_ca_system_score_codex":0.00031173934,"about_ca_system_score_gemma":0.00092469744,"threshold_uncertainty_score":0.015853703},"labels":[],"label_agreement":null},{"id":"W3023005106","doi":"10.1007/978-3-030-64834-3_7","title":"Privacy-Preserving Pattern Matching on Encrypted Data","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Polytechnique Montréal","funders":"","keywords":"Plaintext; Computer science; Ciphertext; Encryption; Matching (statistics); Pattern matching; Constant (computer programming); Theoretical computer science; Key (lock); Data mining; Computer security; Artificial intelligence; Mathematics","score_opus":0.03910779902451039,"score_gpt":0.26762151969396664,"score_spread":0.22851372066945624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023005106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059796263,0.0007457379,0.92946297,0.00051045214,0.00013035946,0.00014128741,0.00037157687,0.0010906825,0.007750614],"genre_scores_gemma":[0.6208657,0.0013732394,0.356226,0.00023117152,0.00015135288,0.00012644428,0.0010342418,0.00027981563,0.0197121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978592,0.00037066967,0.00018959382,0.00034139585,0.0009930615,0.00024605726],"domain_scores_gemma":[0.9971583,0.0008767559,0.00019744728,0.0015000749,0.00022836935,0.000039082875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010271599,0.00042095184,0.0008882365,0.0008551947,0.00046297704,0.0015366479,0.0013782902,0.00084412744,0.002397642],"category_scores_gemma":[0.004603098,0.00044918674,0.00077674916,0.0024765236,0.00080434146,0.0038947153,0.0018724815,0.0009952546,0.001313299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079096714,0.00023240624,0.0016293238,0.00048304236,0.000151047,0.00057000277,0.00030633333,0.06852156,0.04045955,0.19887903,0.010323942,0.6776528],"study_design_scores_gemma":[0.00006295568,0.00024932757,0.0007737942,0.000055883298,0.00007362687,0.0017815155,0.000108735345,0.47844955,0.074835755,0.43040204,0.013174961,0.000031920576],"about_ca_topic_score_codex":0.00039171265,"about_ca_topic_score_gemma":0.00031963905,"teacher_disagreement_score":0.002397642,"about_ca_system_score_codex":0.0004969626,"about_ca_system_score_gemma":0.0007523843,"threshold_uncertainty_score":0.008020937},"labels":[],"label_agreement":null},{"id":"W3023022693","doi":"10.1007/978-3-030-47358-7_18","title":"Big Players: Emotion in Twitter Communities Tweeting About Global Warming","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","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":"Université du Québec à Montréal","funders":"","keywords":"Sadness; Lexicon; Anger; Computer science; Social media; Big data; Emotion classification; Sentiment analysis; Artificial intelligence; World Wide Web; Psychology; Social psychology; Data mining","score_opus":0.055623039926217865,"score_gpt":0.3075201222172838,"score_spread":0.25189708229106594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023022693","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.7355074,0.0063975276,0.01734845,0.018613081,0.002509459,0.00012450007,0.003311892,0.00052579906,0.2156618],"genre_scores_gemma":[0.9480569,0.001407255,0.0029692282,0.0014734042,0.00084468356,0.00011335893,0.0010107841,0.00027889313,0.043845635],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997975,0.0000764223,0.000006166081,0.00003336749,0.000051315576,0.000035126726],"domain_scores_gemma":[0.9984623,0.0011341433,0.00012034498,0.000045171997,0.000071183276,0.00016682738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048221706,0.00041214304,0.00017277538,0.0007399251,0.0011869803,0.0036237354,0.00042555018,0.0011470213,0.013573535],"category_scores_gemma":[0.002866188,0.000247409,0.0003402775,0.0014137944,0.00067655655,0.005141869,0.0016276063,0.0014450428,0.0019357557],"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.0013391018,0.00043490235,0.117487304,0.0009833201,0.00032272798,0.0023908047,0.09841502,0.0053653494,0.017715737,0.13937443,0.2489391,0.36723217],"study_design_scores_gemma":[0.00008683269,0.00034575333,0.26065874,0.0007369159,0.0002444586,0.0016921876,0.15095364,0.048106823,0.0057404726,0.2123819,0.31876287,0.00028935287],"about_ca_topic_score_codex":0.0015725686,"about_ca_topic_score_gemma":0.0041678967,"teacher_disagreement_score":0.013573535,"about_ca_system_score_codex":0.00051410054,"about_ca_system_score_gemma":0.0002682674,"threshold_uncertainty_score":0.04540795},"labels":[],"label_agreement":null},{"id":"W3023058189","doi":"10.1007/978-3-030-47358-7_37","title":"Attending Knowledge Facts with BERT-like Models in Question-Answering: Disappointing Results and Some Explanations","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université de Montréal","funders":"","keywords":"Sentence; Computer science; Question answering; Natural language processing; Set (abstract data type); Artificial intelligence; Programming language","score_opus":0.033983566764943754,"score_gpt":0.2610527462836509,"score_spread":0.22706917951870714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023058189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040702723,0.0065511386,0.88187635,0.03932671,0.0010152342,0.00020157432,0.0008777183,0.0034970024,0.025951628],"genre_scores_gemma":[0.66418785,0.00335389,0.3013738,0.0045647193,0.0026449752,0.00027649058,0.0020453497,0.0008584656,0.020694492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881555,0.007525502,0.0006011586,0.0015943799,0.0016180156,0.00050543516],"domain_scores_gemma":[0.82235605,0.15986222,0.0018274541,0.010904175,0.003250772,0.0017994086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019502832,0.0015315666,0.0025691777,0.0014173561,0.002050162,0.006722209,0.0054670707,0.008330337,0.017392313],"category_scores_gemma":[0.09941261,0.0017657703,0.0036218765,0.002473515,0.0038969321,0.032220617,0.0050356067,0.010319003,0.0038979482],"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.0015890771,0.0010541772,0.0038714705,0.0015022355,0.00048647902,0.00041399093,0.0030868012,0.08373757,0.0027765105,0.52886415,0.06801757,0.30459985],"study_design_scores_gemma":[0.00009657205,0.0001036745,0.00049947144,0.000085720785,0.00012887792,0.00018969424,0.00031406988,0.38473898,0.0012884166,0.6037899,0.008706626,0.000058014586],"about_ca_topic_score_codex":0.0057248236,"about_ca_topic_score_gemma":0.0035541453,"teacher_disagreement_score":0.019502832,"about_ca_system_score_codex":0.0025716985,"about_ca_system_score_gemma":0.0014134626,"threshold_uncertainty_score":0.10314208},"labels":[],"label_agreement":null},{"id":"W3023085007","doi":"10.1007/978-3-030-47358-7_16","title":"A Cost Skew Aware Predictive System for Chest Drain Management","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Ottawa Hospital; Dalhousie University; University of Ottawa","funders":"","keywords":"Computer science; Differential evolution; Matrix (chemical analysis); Skew; Mathematical optimization; Health care; Total cost; Artificial intelligence; Mathematics","score_opus":0.036268886737084935,"score_gpt":0.29839727924145354,"score_spread":0.2621283925043686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023085007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087785564,0.0049868366,0.806597,0.001358014,0.0015328496,0.00037483504,0.0038915714,0.07718892,0.016284494],"genre_scores_gemma":[0.7649178,0.0011733207,0.21335089,0.0010766775,0.00051639107,0.0002128103,0.0025848676,0.0007832886,0.0153839225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997458,0.00002143652,0.000019910425,0.00007078057,0.00011780747,0.000024297338],"domain_scores_gemma":[0.9995012,0.00016038945,0.00005316081,0.00007315853,0.00016819942,0.000043810207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029537446,0.00084983616,0.00080709584,0.0011381519,0.00039012864,0.0010992618,0.001721459,0.00067713554,0.0080909245],"category_scores_gemma":[0.0011139038,0.00032563755,0.00027216083,0.0007280241,0.00011067681,0.0009379793,0.00064451003,0.00054206845,0.002498057],"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.001202675,0.0005674553,0.0068008034,0.00025856975,0.000121499936,0.00070319936,0.000060508184,0.033219036,0.034846433,0.0023363964,0.069031075,0.8508524],"study_design_scores_gemma":[0.00008911979,0.00029026833,0.0049904864,0.000047367877,0.00012454341,0.0009982615,0.000049963175,0.9459201,0.026294142,0.0040491796,0.017076515,0.000069998976],"about_ca_topic_score_codex":0.0026805191,"about_ca_topic_score_gemma":0.003586498,"teacher_disagreement_score":0.0080909245,"about_ca_system_score_codex":0.00050351815,"about_ca_system_score_gemma":0.00049788976,"threshold_uncertainty_score":0.027066827},"labels":[],"label_agreement":null},{"id":"W3023274589","doi":"10.1007/978-3-030-47358-7_15","title":"Adapting Ensemble Neural Networks to Clinical Prediction in High-Dimensional Settings","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"","keywords":"Computer science; Brier score; Artificial neural network; Random forest; Artificial intelligence; Machine learning; Ensemble learning; Proportional hazards model; Ensemble forecasting; Data mining; Statistics; Mathematics","score_opus":0.02694841637935416,"score_gpt":0.29506069943721536,"score_spread":0.2681122830578612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023274589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16709654,0.0027146603,0.82266635,0.0013199031,0.0004215042,0.00007696694,0.00042535597,0.0012970176,0.0039817747],"genre_scores_gemma":[0.8751919,0.0010389988,0.11693693,0.00042231096,0.0003807759,0.00011726392,0.0010608273,0.00013711907,0.0047138194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944943,0.00025002382,0.00003111099,0.0001245803,0.00007887662,0.000065994944],"domain_scores_gemma":[0.99671566,0.0024316374,0.00010419183,0.0002557199,0.0004111293,0.00008167136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025216003,0.00089826493,0.0013603437,0.0005930931,0.000319308,0.0006774702,0.0013130264,0.0013347161,0.0014918568],"category_scores_gemma":[0.0068940474,0.00048772577,0.00067859393,0.0009957966,0.0002411829,0.0013932156,0.0013913275,0.0020056474,0.0005240638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018668255,0.00020163532,0.0052631637,0.00003856923,0.00022025716,0.000107643085,0.00005994269,0.7482006,0.001023565,0.0016473877,0.005704016,0.23734656],"study_design_scores_gemma":[0.0000026383532,0.00001371185,0.00023995644,0.0000029161827,0.000008203782,0.000011723023,0.0000039448005,0.9982224,0.00011330006,0.001287063,0.00009183669,0.0000022014872],"about_ca_topic_score_codex":0.0047581075,"about_ca_topic_score_gemma":0.0071555655,"teacher_disagreement_score":0.0047581075,"about_ca_system_score_codex":0.00047910973,"about_ca_system_score_gemma":0.0004931601,"threshold_uncertainty_score":0.013335705},"labels":[],"label_agreement":null},{"id":"W3023448049","doi":"10.1007/978-3-030-45385-5_25","title":"Cancer Detection Based on Image Classification by Using Convolution Neural Network","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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 Windsor","funders":"","keywords":"Computer science; Convolution (computer science); Artificial intelligence; Convolutional neural network; Artificial neural network; Pattern recognition (psychology); Contextual image classification; Image (mathematics)","score_opus":0.02783409588187205,"score_gpt":0.2607649675246651,"score_spread":0.23293087164279305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023448049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12627637,0.0027828277,0.8586154,0.00039532135,0.00033535965,0.00014382307,0.00039271,0.002692149,0.008365945],"genre_scores_gemma":[0.6030499,0.0019847318,0.3811124,0.000283086,0.00018275403,0.00011868827,0.00070674345,0.00011923714,0.012442472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978346,0.000017060127,0.000010978267,0.000065142565,0.00008330661,0.000040057992],"domain_scores_gemma":[0.9998381,0.000044539745,0.0000185004,0.000016490883,0.000070617265,0.000011845144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033748892,0.00058990106,0.0007302998,0.0009769729,0.0002606378,0.0006797923,0.0006835525,0.00074358593,0.001752295],"category_scores_gemma":[0.00051431643,0.00028606207,0.0007233501,0.00083012815,0.00021459637,0.00078496366,0.0004149317,0.00038201956,0.0006145507],"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.0003962032,0.00018753692,0.0061019706,0.00020159436,0.00012460489,0.000256413,0.00005027541,0.02213752,0.13002434,0.0022692347,0.004903071,0.8333473],"study_design_scores_gemma":[0.000014627283,0.00016178604,0.008264148,0.000026653293,0.00013798403,0.000677981,0.000024967683,0.9215497,0.06366912,0.0019529932,0.00348071,0.0000392459],"about_ca_topic_score_codex":0.0027946862,"about_ca_topic_score_gemma":0.0032415758,"teacher_disagreement_score":0.0027946862,"about_ca_system_score_codex":0.0004025447,"about_ca_system_score_gemma":0.0004299093,"threshold_uncertainty_score":0.0058619976},"labels":[],"label_agreement":null},{"id":"W3023453969","doi":"10.1007/978-3-030-47358-7_19","title":"Using Topic Modelling to Improve Prediction of Financial Report Commentary Classes","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Latent Dirichlet allocation; Class (philosophy); Task (project management); Feature selection; Selection (genetic algorithm); Artificial intelligence; Machine learning; Data mining; Feature (linguistics); Finance; Topic model","score_opus":0.03398848257873614,"score_gpt":0.28170749902452086,"score_spread":0.2477190164457847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023453969","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.7660259,0.010581187,0.16506119,0.0036291338,0.002310241,0.00034840725,0.026867004,0.010244605,0.014932288],"genre_scores_gemma":[0.9295074,0.0012588039,0.03148069,0.00023515736,0.0015674116,0.00021811394,0.027235478,0.0003321273,0.00816484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.0005757197,0.000111898036,0.00033218824,0.00021873393,0.00013495317],"domain_scores_gemma":[0.9831638,0.013511438,0.00090427283,0.0004617838,0.0014989439,0.00045987693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033263983,0.0011337817,0.0009005132,0.004098197,0.00049949146,0.0022246821,0.000973158,0.0014608226,0.0037598407],"category_scores_gemma":[0.0148873655,0.00036768068,0.0014806272,0.0027364227,0.0001742633,0.0017793424,0.0007264304,0.0021529652,0.0045057978],"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.0037010887,0.0017180484,0.15788893,0.000842862,0.0007564126,0.0003115476,0.000656028,0.0757333,0.012031632,0.0019741491,0.08261554,0.66177046],"study_design_scores_gemma":[0.00010827653,0.00033533486,0.050793972,0.00008879005,0.00034872317,0.00010749787,0.00027152034,0.930118,0.005760497,0.0032033343,0.008803004,0.00006107242],"about_ca_topic_score_codex":0.010677435,"about_ca_topic_score_gemma":0.010432324,"teacher_disagreement_score":0.010677435,"about_ca_system_score_codex":0.0008596048,"about_ca_system_score_gemma":0.0007776816,"threshold_uncertainty_score":0.021230578},"labels":[],"label_agreement":null},{"id":"W3023458473","doi":"10.1007/978-3-030-45374-9_14","title":"PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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 Waterloo","funders":"","keywords":"Authenticated Key Exchange; Learning with errors; Key exchange; Hash function; Computer science; Theoretical computer science; Password; Key (lock); Lattice (music); Discrete mathematics; Mathematics; Algorithm; Cryptography; Encryption; Public-key cryptography; Physics; Computer security","score_opus":0.0235722967535491,"score_gpt":0.2935766392465645,"score_spread":0.2700043424930154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023458473","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.010769308,0.0014112598,0.93514806,0.0015852534,0.00082321314,0.00009505303,0.00040482057,0.0013086887,0.048454426],"genre_scores_gemma":[0.2075526,0.0035524364,0.7116982,0.0010863577,0.0010937395,0.0005850911,0.0010910003,0.0017912113,0.071549475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670756,0.0010037891,0.00019284435,0.00044261283,0.001326777,0.00032639815],"domain_scores_gemma":[0.9983198,0.0005327279,0.00009969857,0.00066329853,0.00021378086,0.00017068593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025738298,0.0017292695,0.0018727623,0.0018754776,0.0027863176,0.006287879,0.0030777026,0.0021022754,0.014762864],"category_scores_gemma":[0.003822947,0.001205155,0.0022678787,0.0028946921,0.005948962,0.016734924,0.006590509,0.0096299,0.0076815425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000395636,0.00001989197,0.000020108586,0.00005714882,0.00000546129,0.000024661582,0.00007374577,0.00083106017,0.0005774384,0.9845659,0.0028784836,0.01090654],"study_design_scores_gemma":[0.000020052814,0.000022729815,0.00001708847,0.000024013812,0.000010064887,0.00009540933,0.000050092443,0.008718708,0.0012616836,0.9715353,0.018221198,0.000023684164],"about_ca_topic_score_codex":0.0007238583,"about_ca_topic_score_gemma":0.0007789871,"teacher_disagreement_score":0.014762864,"about_ca_system_score_codex":0.0018397463,"about_ca_system_score_gemma":0.0018249499,"threshold_uncertainty_score":0.04938674},"labels":[],"label_agreement":null},{"id":"W3023493350","doi":"10.1007/978-3-030-47358-7_13","title":"Sensitivity to Risk Profiles of Users When Developing AI Systems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Process (computing); Value (mathematics); Risk analysis (engineering); Human–computer interaction; Sensitivity (control systems); Artificial intelligence; Machine learning","score_opus":0.04372073062180226,"score_gpt":0.319887341421977,"score_spread":0.27616661080017474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023493350","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.83474594,0.000406843,0.13215393,0.0012569373,0.000058233865,0.00030305624,0.00035027566,0.0003408331,0.030384036],"genre_scores_gemma":[0.9881373,0.000058798094,0.010839262,0.000076714605,0.000010244633,0.000045058336,0.000083725296,0.000028657707,0.0007202424],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9818013,0.011302633,0.0008994721,0.0012480932,0.0040076626,0.00074092887],"domain_scores_gemma":[0.7921664,0.1811961,0.00956236,0.008878914,0.0066280253,0.0015682067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020202052,0.00051646546,0.00044394977,0.0020219504,0.00080915116,0.004494992,0.00085521827,0.0016468202,0.002933762],"category_scores_gemma":[0.18358995,0.00067974086,0.0005066784,0.0009948612,0.0010179315,0.005450893,0.0021637937,0.0021905683,0.0005296193],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023007253,0.0006516282,0.37062153,0.00036905738,0.0006642824,0.0013151399,0.014477782,0.17934382,0.014028554,0.0646207,0.0028538243,0.34875298],"study_design_scores_gemma":[0.00004193386,0.0009606409,0.13224359,0.00031409936,0.0004137915,0.0017911184,0.009950492,0.6286561,0.022554051,0.19781807,0.0049586245,0.0002975904],"about_ca_topic_score_codex":0.0023929942,"about_ca_topic_score_gemma":0.0022410706,"teacher_disagreement_score":0.020202052,"about_ca_system_score_codex":0.0015563123,"about_ca_system_score_gemma":0.0010132085,"threshold_uncertainty_score":0.106839955},"labels":[],"label_agreement":null},{"id":"W3023581453","doi":"10.1007/978-3-030-47358-7_56","title":"Personalized Student Attribute Inference","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Inference; Machine learning; Artificial intelligence; Graduation (instrument); Set (abstract data type); Support vector machine; Decision tree; Artificial neural network; Data science","score_opus":0.026625944915971193,"score_gpt":0.298469249758169,"score_spread":0.2718433048421978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023581453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024414565,0.001556418,0.9080235,0.0019584817,0.00084592577,0.00025937255,0.012157794,0.025216606,0.025567256],"genre_scores_gemma":[0.40414065,0.001272954,0.48695838,0.0012319193,0.0010818323,0.000275754,0.03900477,0.0019757391,0.064058036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981469,0.00037606634,0.00006626579,0.0008492471,0.00040245705,0.00015916453],"domain_scores_gemma":[0.99785894,0.00063825754,0.000053667743,0.001137432,0.00020020167,0.000111564266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018249082,0.0010542636,0.0013616963,0.0017865518,0.00075478136,0.0019745203,0.0023131776,0.0015949103,0.026442496],"category_scores_gemma":[0.0064736363,0.0006602247,0.0018296952,0.0023582433,0.0004156132,0.003884454,0.0027199711,0.0031635421,0.012701313],"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.00067665585,0.0006262796,0.0044614165,0.00014775358,0.00020089521,0.00008460146,0.00009362662,0.024221905,0.0033908621,0.018350357,0.10852831,0.83921736],"study_design_scores_gemma":[0.00014007995,0.000111454196,0.0042804843,0.00009493916,0.00022537612,0.00027130047,0.00012828055,0.76675844,0.01001867,0.16153613,0.056376036,0.00005879624],"about_ca_topic_score_codex":0.0034334457,"about_ca_topic_score_gemma":0.008301631,"teacher_disagreement_score":0.026442496,"about_ca_system_score_codex":0.00086880266,"about_ca_system_score_gemma":0.0016077077,"threshold_uncertainty_score":0.088458955},"labels":[],"label_agreement":null},{"id":"W3023718816","doi":"10.1007/978-3-030-52240-7_26","title":"Automated Personalized Feedback Improves Learning Gains in An Intelligent Tutoring System","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"McGill University; Mila - Quebec Artificial Intelligence Institute; École de Technologie Supérieure","funders":"","keywords":"Computer science; Personalized learning; Intelligent tutoring system; Scale (ratio); Artificial intelligence; Human–computer interaction; Multimedia; Teaching method; Mathematics education; Cooperative learning; Psychology","score_opus":0.03886914252036177,"score_gpt":0.296853695007329,"score_spread":0.2579845524869672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023718816","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.95728,0.00024371762,0.03461468,0.00013484973,0.00014359978,0.00011179168,0.00014425616,0.004596348,0.002730762],"genre_scores_gemma":[0.98723453,0.00007215834,0.009695,0.000045708824,0.000037667316,0.000054037606,0.00016087528,0.00009410945,0.0026060091],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993698,0.00023978912,0.00004689015,0.00014689824,0.0001346331,0.00006198295],"domain_scores_gemma":[0.99620444,0.0025711968,0.00018266488,0.00036629208,0.00041860086,0.00025683932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006839989,0.00066837744,0.00074527046,0.00039715992,0.00027817918,0.0006781123,0.00067554985,0.0010380192,0.005572894],"category_scores_gemma":[0.0074322554,0.00021159607,0.00018273684,0.000249935,0.00013271566,0.00054112374,0.0006162399,0.00054028496,0.0012851371],"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.012142525,0.0075885425,0.011015702,0.00041925898,0.00023408275,0.0006267301,0.00063895533,0.055659745,0.11765392,0.00039669307,0.007418302,0.78620565],"study_design_scores_gemma":[0.0023619884,0.014871228,0.05224254,0.00007103242,0.00094056677,0.0007339729,0.0003067926,0.7686651,0.15113889,0.002571466,0.005946289,0.00015020937],"about_ca_topic_score_codex":0.0011465035,"about_ca_topic_score_gemma":0.000987147,"teacher_disagreement_score":0.005572894,"about_ca_system_score_codex":0.00022459448,"about_ca_system_score_gemma":0.00036132903,"threshold_uncertainty_score":0.01864314},"labels":[],"label_agreement":null},{"id":"W3023815642","doi":"10.1007/978-3-030-47358-7_34","title":"Detection and Diagnosis of Breast Cancer Using a Bayesian Approach","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Toronto Metropolitan University","funders":"","keywords":"Bayesian network; Breast cancer; Bayesian probability; Computer science; Conditional probability; Classifier (UML); Artificial intelligence; Predictive value; Sensitivity (control systems); Machine learning; Pattern recognition (psychology); Cancer; Algorithm; Statistics; Mathematics; Medicine; Internal medicine","score_opus":0.018992236153140267,"score_gpt":0.25650052346431723,"score_spread":0.23750828731117696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023815642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011697895,0.0016945518,0.9831405,0.00057910656,0.000042182117,0.00006652006,0.00026691973,0.00040887957,0.0021034924],"genre_scores_gemma":[0.37579906,0.0025954742,0.6139192,0.00068844814,0.00032816987,0.0002990602,0.0011592102,0.00010874947,0.005102695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998664,0.00035585507,0.00011496195,0.00028569894,0.00047905656,0.000100377496],"domain_scores_gemma":[0.9972427,0.0021061278,0.00013315289,0.000099566314,0.00036746537,0.000051058083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022150509,0.0007419929,0.0013139128,0.002147602,0.0005451779,0.0013012678,0.0018809161,0.0016023727,0.0022515163],"category_scores_gemma":[0.0070698815,0.00091443205,0.0016281302,0.0009792994,0.00046655646,0.0014834132,0.0011446946,0.0011013341,0.0011770872],"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.000616166,0.00046435656,0.010201462,0.00049051724,0.0005278247,0.0003990401,0.00022638272,0.1811029,0.016428875,0.015940815,0.006700808,0.76690096],"study_design_scores_gemma":[0.000067174136,0.00014376489,0.003503924,0.00010804905,0.00027126612,0.0005944203,0.00005146119,0.9440066,0.003826971,0.04434723,0.0030192798,0.00005981079],"about_ca_topic_score_codex":0.006319345,"about_ca_topic_score_gemma":0.008833195,"teacher_disagreement_score":0.006319345,"about_ca_system_score_codex":0.000809278,"about_ca_system_score_gemma":0.0012812921,"threshold_uncertainty_score":0.012565136},"labels":[],"label_agreement":null},{"id":"W3023897519","doi":"10.1007/978-3-030-47358-7_27","title":"Low-Dimensional Dynamics of Encoding and Learning in Recurrent Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Encoding (memory); Recurrent neural network; Artificial neural network; Artificial intelligence; Dynamics (music)","score_opus":0.013666152127828568,"score_gpt":0.23380113292594623,"score_spread":0.22013498079811766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023897519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17971724,0.004360338,0.7935759,0.0019807445,0.00035797432,0.000029506813,0.0003820128,0.0006685316,0.018927844],"genre_scores_gemma":[0.94407845,0.0016605877,0.04041886,0.0001397493,0.00015721355,0.000052942334,0.0002788792,0.00017522306,0.0130380625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983585,0.00005963679,0.000011624446,0.000037421818,0.000035111756,0.000020185653],"domain_scores_gemma":[0.9990853,0.0005776407,0.00009129503,0.0000794575,0.00011571631,0.000050430124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044392142,0.00031587717,0.00043759734,0.00024998837,0.0002538682,0.001332977,0.00073518424,0.0008698119,0.0037426658],"category_scores_gemma":[0.004406499,0.0003770758,0.00030255862,0.0003889637,0.0006861871,0.0024501674,0.0007336148,0.0012099769,0.00062128267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015840976,0.00007014838,0.0011799692,0.00023495095,0.00005435421,0.00016436403,0.00035311276,0.46515,0.017968025,0.43022674,0.0053594187,0.07908054],"study_design_scores_gemma":[0.0000047294916,0.000014977953,0.00021794591,0.000011298902,0.000004737338,0.000030398041,0.000018081855,0.91774553,0.00073483266,0.08061036,0.0005977544,0.00000933327],"about_ca_topic_score_codex":0.0015417292,"about_ca_topic_score_gemma":0.0018551481,"teacher_disagreement_score":0.0037426658,"about_ca_system_score_codex":0.0006320827,"about_ca_system_score_gemma":0.00026178468,"threshold_uncertainty_score":0.0125204325},"labels":[],"label_agreement":null},{"id":"W3023900646","doi":"10.1007/978-3-030-47358-7_9","title":"FASTT: Team Formation Using Fair Division","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Division (mathematics); Computer science; Task (project management); Order (exchange); Balance (ability); Fair division; Theoretical computer science; Artificial intelligence; Algorithm; Arithmetic; Mathematics; Management; Mathematical economics","score_opus":0.08361027876407079,"score_gpt":0.34534546545211375,"score_spread":0.26173518668804296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023900646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073148822,0.0002868636,0.967367,0.00018385639,0.00035228574,0.00012146141,0.0001938199,0.002303982,0.021875912],"genre_scores_gemma":[0.2836119,0.0005276849,0.65164787,0.00020196936,0.0002731103,0.0005460125,0.0006717645,0.00087908783,0.061640576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994357,0.00013492591,0.000020021847,0.00011444758,0.00020038802,0.00009447894],"domain_scores_gemma":[0.9993641,0.0002631738,0.000032278123,0.00019080625,0.00007712726,0.000072576215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010063737,0.0006200573,0.0007993573,0.00066039746,0.0011212175,0.0016334156,0.001978369,0.0008996268,0.020451706],"category_scores_gemma":[0.0023668522,0.0003978913,0.0005833021,0.0010086001,0.0007488525,0.002380856,0.0026431296,0.0013165163,0.00431127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042999984,0.00016700252,0.00031649045,0.00019282663,0.000056084238,0.00014218497,0.00023607821,0.12557058,0.0057048528,0.2940671,0.044117205,0.5289995],"study_design_scores_gemma":[0.00017266825,0.00013140494,0.00026025364,0.000038565802,0.000022460636,0.00017791589,0.00006722885,0.649178,0.005948931,0.30199558,0.04197429,0.000032662832],"about_ca_topic_score_codex":0.0013958685,"about_ca_topic_score_gemma":0.0014544637,"teacher_disagreement_score":0.020451706,"about_ca_system_score_codex":0.0007920442,"about_ca_system_score_gemma":0.0010514505,"threshold_uncertainty_score":0.06841773},"labels":[],"label_agreement":null},{"id":"W3025751817","doi":"10.1007/978-3-030-48861-1_6","title":"Soft Voting Windowing Ensembles for Learning from Partially Labelled Streams","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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 Ottawa","funders":"","keywords":"Computer science; Concept drift; Voting; Artificial intelligence; Dependency (UML); Data stream; Machine learning; Majority rule; Data stream mining; Sequence (biology); Class (philosophy); Data mining; Baseline (sea); Pattern recognition (psychology)","score_opus":0.027063532895002077,"score_gpt":0.2539265859545156,"score_spread":0.22686305305951354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025751817","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.015972743,0.000563159,0.98191917,0.00007456238,0.000072776405,0.00003396092,0.00008692229,0.00068645645,0.00059017824],"genre_scores_gemma":[0.37554568,0.0008262825,0.612241,0.00020035474,0.0003598671,0.00027674067,0.0013378222,0.00041535535,0.008796877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904376,0.0002924118,0.00007689516,0.00023839569,0.00024464654,0.00010380971],"domain_scores_gemma":[0.99755967,0.0015038714,0.00009986616,0.00034520446,0.00038200046,0.00010938048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028754536,0.0009422334,0.0019887355,0.00082643837,0.0005192895,0.0010978924,0.0020678253,0.0014610904,0.002697441],"category_scores_gemma":[0.004733203,0.0007633334,0.0011045508,0.0011993273,0.00051686534,0.002460583,0.0020972076,0.002329034,0.000972619],"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.00050050276,0.0001704095,0.0010496518,0.00010981687,0.00019847036,0.00004944522,0.00011933123,0.30694404,0.01259908,0.010906837,0.0041822246,0.6631702],"study_design_scores_gemma":[0.0000051597985,0.00003340727,0.00011752106,0.0000063324646,0.000014727002,0.00001030147,0.0000056596705,0.9929724,0.0017701255,0.004654442,0.0004051525,0.0000048428014],"about_ca_topic_score_codex":0.0021350598,"about_ca_topic_score_gemma":0.0044238437,"teacher_disagreement_score":0.0028754536,"about_ca_system_score_codex":0.0005826948,"about_ca_system_score_gemma":0.0007461929,"threshold_uncertainty_score":0.015206993},"labels":[],"label_agreement":null},{"id":"W3026230012","doi":"10.1007/978-3-030-47679-3_18","title":"A Machine Learning Approach for Severe Maternal Morbidity Prediction at Rafael Calvo Clinic in Cartagena-Colombia","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical Methods in Epidemiology","field":"Mathematics","cited_by":1,"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":"Logistic regression; Support vector machine; Pregnancy; Machine learning; Quarter (Canadian coin); Computer science; Artificial intelligence; Medicine; Geography","score_opus":0.12493948547851909,"score_gpt":0.3758399009877948,"score_spread":0.2509004155092757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026230012","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.79601556,0.017958965,0.056199644,0.036651034,0.0017922044,0.00029641052,0.015057942,0.0009657813,0.07506236],"genre_scores_gemma":[0.9298329,0.0038869397,0.0250928,0.0006989172,0.00040885608,0.00015146327,0.0050698924,0.00010998778,0.03474817],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.000080661644,0.000011465648,0.000046825615,0.000036104168,0.000049139042],"domain_scores_gemma":[0.9995771,0.00016947847,0.000029500106,0.0000112325815,0.00013561806,0.00007698906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037551788,0.00026660773,0.00027514162,0.0010185315,0.00057805947,0.00089913665,0.0006534692,0.0005144726,0.0029462092],"category_scores_gemma":[0.0017584607,0.00015670627,0.00029214975,0.0007163679,0.00012727438,0.00022706718,0.0004002645,0.0007751538,0.0005340967],"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.0002841003,0.00043811576,0.5039695,0.00019369966,0.00008233592,0.002100846,0.0014357532,0.028740538,0.0010340662,0.004679613,0.099900134,0.35714132],"study_design_scores_gemma":[0.0000715888,0.00021374688,0.60496515,0.0007120957,0.00013240382,0.0019779813,0.009201073,0.29116356,0.0022209932,0.00833437,0.080893755,0.00011327831],"about_ca_topic_score_codex":0.24675462,"about_ca_topic_score_gemma":0.34129298,"teacher_disagreement_score":0.24675462,"about_ca_system_score_codex":0.0019238024,"about_ca_system_score_gemma":0.0029596824,"threshold_uncertainty_score":0.4906367},"labels":[],"label_agreement":null},{"id":"W3026831842","doi":"10.1007/978-3-642-02614-0","title":"Intelligent Computer Mathematics","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"McMaster University","funders":"","keywords":"Computer science; Computation; Symbolic computation; Algebra over a field; Theoretical computer science; Algorithm; Mathematics; Pure mathematics","score_opus":0.019427436264534245,"score_gpt":0.260039717935297,"score_spread":0.24061228167076276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026831842","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018125959,0.015975628,0.065447934,0.003635088,0.0019358371,0.000059572838,0.000369207,0.00073151663,0.91003275],"genre_scores_gemma":[0.039784066,0.015413259,0.030508958,0.0008970477,0.001827383,0.00011086941,0.0007576267,0.00039845842,0.9103022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970585,0.00003801902,0.000012606858,0.00005864291,0.00016442419,0.000020345185],"domain_scores_gemma":[0.99977154,0.00006524655,0.000012278629,0.000079613834,0.000053506654,0.000017835697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000276927,0.000748342,0.00067566935,0.001186232,0.000732355,0.002140743,0.0006214275,0.0006192225,0.07285507],"category_scores_gemma":[0.00092026143,0.00031662732,0.00042141395,0.0011142683,0.0010618014,0.0027605323,0.0011685942,0.0017083008,0.03294085],"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.000015294003,0.000030400155,0.00013408434,0.0002107838,0.000012251655,0.0000362336,0.00013064219,0.0012664794,0.001011876,0.53114223,0.20492236,0.26108733],"study_design_scores_gemma":[0.000005307044,0.000014160758,0.0002616823,0.000069845686,0.0000076151227,0.000107675696,0.000028119573,0.0024623307,0.0006753646,0.26393992,0.7324222,0.0000058025807],"about_ca_topic_score_codex":0.0004746151,"about_ca_topic_score_gemma":0.0009118775,"teacher_disagreement_score":0.07285507,"about_ca_system_score_codex":0.0010238888,"about_ca_system_score_gemma":0.00068414985,"threshold_uncertainty_score":0.24372447},"labels":[],"label_agreement":null},{"id":"W3027132030","doi":"10.1007/978-3-030-62466-8_28","title":"The OpenCitations Data Model","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università di Bologna; Université de Montréal; Universiteit Leiden; Wellcome Trust","keywords":"Computer science; Ontology; Reuse; Variety (cybernetics); Reusability; Context (archaeology); Semantic Web; Information retrieval; Data model (GIS); Data science; World Wide Web; Data mining; Engineering; Artificial intelligence; Software; Programming language","score_opus":0.1031986247926079,"score_gpt":0.33195555881657074,"score_spread":0.22875693402396285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027132030","genre_codex":"dataset","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.0054877694,0.0014246079,0.23945509,0.007822203,0.0011600509,0.0015495543,0.55171037,0.027515903,0.16387452],"genre_scores_gemma":[0.03917726,0.0022667903,0.14469242,0.002629658,0.00049444364,0.0033510223,0.7625347,0.004974861,0.03987898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98868376,0.0019502713,0.0027748104,0.0016214302,0.004368292,0.0006015077],"domain_scores_gemma":[0.9702711,0.007094627,0.002349391,0.0094629405,0.009507528,0.0013144007],"candidate_categories":["bibliometrics","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007069092,0.0011331404,0.0013632572,0.016562983,0.0029068745,0.013794698,0.0056469105,0.003861032,0.038899403],"category_scores_gemma":[0.036742732,0.00095381116,0.0018928375,0.031564176,0.0017575835,0.014358582,0.006901034,0.0037679116,0.026925532],"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.00023556432,0.00011666352,0.0040283287,0.0011950047,0.00010807974,0.0005206969,0.00088830024,0.008484332,0.00090869033,0.50286114,0.41613892,0.064514205],"study_design_scores_gemma":[0.000027007098,0.000009921058,0.00048367385,0.00015160297,0.000027818089,0.00014938432,0.0001355304,0.002896853,0.00060058484,0.043082505,0.95239234,0.000042787608],"about_ca_topic_score_codex":0.04774516,"about_ca_topic_score_gemma":0.03512357,"teacher_disagreement_score":0.9862053,"about_ca_system_score_codex":0.006758606,"about_ca_system_score_gemma":0.011904917,"threshold_uncertainty_score":0.13013142},"labels":[],"label_agreement":null},{"id":"W3027230419","doi":"10.1007/978-3-030-48077-6_28","title":"An Event-B Model of an Automotive Adaptive Exterior Light System","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Visibility; Context (archaeology); Event (particle physics); Controller (irrigation); Key (lock); Point (geometry); Actuator; Real-time computing; Simulation; Artificial intelligence; Computer security; Mathematics","score_opus":0.03066390509838676,"score_gpt":0.2779981820092014,"score_spread":0.24733427691081464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027230419","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.046538055,0.00027972794,0.8958379,0.00072181766,0.00012098742,0.0002444759,0.0012349369,0.0023953717,0.0526267],"genre_scores_gemma":[0.8882357,0.00036004736,0.076376535,0.00024458798,0.000039533454,0.0004150616,0.0008687313,0.0002217113,0.03323817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997125,0.000060328293,0.000018198996,0.00007309351,0.00009333133,0.00004246711],"domain_scores_gemma":[0.9997886,0.00008366683,0.000028539873,0.000029160225,0.00004972247,0.000020387115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034233814,0.00066368247,0.00039369473,0.00048710528,0.0005077036,0.0019587183,0.0011646198,0.0014705439,0.011998523],"category_scores_gemma":[0.0005104554,0.00033775927,0.00074760255,0.0002707653,0.0008606574,0.001135178,0.00087429315,0.00087912614,0.0014951612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040192925,0.0001271417,0.0008582516,0.00019418233,0.000049895454,0.0010314829,0.0004232693,0.5106331,0.021014377,0.45029113,0.0024009105,0.012574235],"study_design_scores_gemma":[0.00011097626,0.00009841334,0.00029877506,0.00003536884,0.00003337391,0.00010570773,0.000083767685,0.89867824,0.0039588907,0.08471708,0.011852488,0.000026920314],"about_ca_topic_score_codex":0.013217423,"about_ca_topic_score_gemma":0.00639458,"teacher_disagreement_score":0.013217423,"about_ca_system_score_codex":0.0009935796,"about_ca_system_score_gemma":0.0009167735,"threshold_uncertainty_score":0.04013908},"labels":[],"label_agreement":null},{"id":"W3027399283","doi":"10.1007/978-3-030-48077-6_15","title":"Verifying SGAC Access Control Policies: A Comparison of ProB, Alloy and Z3","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Access control; Inheritance (genetic algorithm); Control (management); Programming language; Computer security; Artificial intelligence","score_opus":0.04134018729039641,"score_gpt":0.3377904340494549,"score_spread":0.2964502467590585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027399283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10068699,0.0010502827,0.86754674,0.0008467567,0.00015979602,0.00044516192,0.0010378639,0.017424835,0.010801582],"genre_scores_gemma":[0.54872733,0.0006191518,0.44366223,0.00038069606,0.000081786246,0.00014156403,0.0016723508,0.0011854481,0.0035293603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9812971,0.005584163,0.0014528175,0.001508487,0.008788985,0.0013684372],"domain_scores_gemma":[0.9496774,0.028975118,0.002536825,0.013600956,0.0045770756,0.0006326193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009571198,0.0012231563,0.0018450596,0.0024842636,0.0016986125,0.005075231,0.004691859,0.0017288958,0.006801],"category_scores_gemma":[0.030865584,0.001397641,0.002505399,0.0022438841,0.0037227077,0.010265952,0.0044479133,0.002108292,0.0016579437],"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.0068732407,0.00057611265,0.01392464,0.0018561335,0.000593583,0.0003826905,0.0009631854,0.20018707,0.024910226,0.21675387,0.011614232,0.521365],"study_design_scores_gemma":[0.00030743252,0.000578946,0.0018828142,0.0001674866,0.00031963657,0.00039316269,0.00044524198,0.8481628,0.032323416,0.105797745,0.009547942,0.00007335155],"about_ca_topic_score_codex":0.022063084,"about_ca_topic_score_gemma":0.02394855,"teacher_disagreement_score":0.022063084,"about_ca_system_score_codex":0.0036407025,"about_ca_system_score_gemma":0.01041997,"threshold_uncertainty_score":0.050617933},"labels":[],"label_agreement":null},{"id":"W3028344048","doi":"10.1007/978-3-030-48077-6_29","title":"Modeling of a Speed Control System Using Event-B","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Event (particle physics); Set (abstract data type); Controller (irrigation); Point (geometry); Key (lock); State (computer science); Speed limit; Position (finance); Limit (mathematics); Control (management); Electronic speed control; Real-time computing; Algorithm; Artificial intelligence; Programming language; Computer security; Mathematics","score_opus":0.043906783752162455,"score_gpt":0.28515550324706407,"score_spread":0.24124871949490162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028344048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020917773,0.00017203798,0.9532444,0.000168147,0.000108159686,0.0001436068,0.0002979657,0.0031004709,0.021847446],"genre_scores_gemma":[0.8463104,0.00041309066,0.12287072,0.000115185576,0.000050635015,0.00028959336,0.00037023134,0.00023254486,0.029347593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975663,0.000050844912,0.000016914128,0.00005774614,0.0000908677,0.000027086631],"domain_scores_gemma":[0.9998348,0.000066583656,0.000026140562,0.00002449415,0.00003508528,0.000012932102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027798087,0.0006374673,0.000457993,0.00040800383,0.0005579069,0.0013691364,0.0011888529,0.0010245416,0.010763278],"category_scores_gemma":[0.00045588656,0.00033516478,0.0005784632,0.00027148935,0.0004504549,0.0009227796,0.0005252265,0.0006322987,0.0015147366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023407591,0.00010925081,0.000752448,0.00020000695,0.000043792465,0.0003999029,0.00017826723,0.8745178,0.016788121,0.07822618,0.0020110605,0.026539149],"study_design_scores_gemma":[0.00002315731,0.000054975877,0.00013397216,0.000011775082,0.00001475012,0.00004735214,0.000009932555,0.9848032,0.0035893093,0.0059537673,0.005348601,0.000009229183],"about_ca_topic_score_codex":0.0066954824,"about_ca_topic_score_gemma":0.0034829625,"teacher_disagreement_score":0.010763278,"about_ca_system_score_codex":0.00047004168,"about_ca_system_score_gemma":0.0005913086,"threshold_uncertainty_score":0.03600681},"labels":[],"label_agreement":null},{"id":"W3028586320","doi":"10.1007/978-3-030-46643-5_18","title":"Multimodal Segmentation with MGF-Net and the Focal Tversky Loss Function","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Toronto Metropolitan University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Modality (human–computer interaction); Pattern recognition (psychology); Representation (politics); Feature (linguistics); Network architecture; Image segmentation; Fusion; Function (biology); Algorithm","score_opus":0.01954677547762171,"score_gpt":0.23046772809555127,"score_spread":0.21092095261792956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028586320","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.007400014,0.00055832247,0.9859839,0.00025734454,0.00005847646,0.000047940222,0.0002970507,0.0017747962,0.003622247],"genre_scores_gemma":[0.16175921,0.00082247565,0.8175985,0.00021298337,0.00018850557,0.0002048229,0.0013181502,0.001238659,0.01665671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967694,0.00006948233,0.000020062274,0.00008224214,0.00010450736,0.000046776535],"domain_scores_gemma":[0.99968207,0.00010352526,0.000033239903,0.00006157892,0.00008877552,0.000030872743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014445591,0.0011126519,0.001327916,0.0019755305,0.00056420156,0.0018515183,0.0016244791,0.0023192314,0.0059955562],"category_scores_gemma":[0.0022324529,0.0005070333,0.0010524407,0.0010981429,0.00068140775,0.0017840773,0.0015413146,0.0013243045,0.00294074],"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.00031958317,0.000097495715,0.0006581661,0.0002140838,0.000109985136,0.00013816135,0.000069752175,0.22416057,0.017054481,0.04744349,0.015404725,0.69432956],"study_design_scores_gemma":[0.0000071236095,0.00003860562,0.00024265422,0.000021905527,0.000016453692,0.00011713845,0.000011508259,0.974621,0.0045666737,0.01776183,0.002582503,0.000012571071],"about_ca_topic_score_codex":0.0049472135,"about_ca_topic_score_gemma":0.006207066,"teacher_disagreement_score":0.0059955562,"about_ca_system_score_codex":0.0011450786,"about_ca_system_score_gemma":0.001037638,"threshold_uncertainty_score":0.020057082},"labels":[],"label_agreement":null},{"id":"W302904365","doi":"10.1007/978-3-319-14130-5_23","title":"Mining Software Components from Object-Oriented APIs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Software engineering; Programming language","score_opus":0.018495793163478054,"score_gpt":0.24491322568238794,"score_spread":0.2264174325189099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W302904365","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.20566949,0.0045292084,0.75253826,0.00060138723,0.0002568361,0.00073303445,0.006629565,0.019733943,0.009308336],"genre_scores_gemma":[0.2786863,0.0027649333,0.68039584,0.00013479816,0.000130937,0.00037868856,0.028448155,0.0017401401,0.0073201214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990946,0.00007707265,0.00007746452,0.00020833104,0.00046041165,0.000082181614],"domain_scores_gemma":[0.99825865,0.0007684823,0.0002054981,0.00032928065,0.00037251803,0.000065623404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052683975,0.0019106386,0.0009748172,0.006478539,0.0006762646,0.0021918276,0.0020710356,0.00090788695,0.0018052326],"category_scores_gemma":[0.003907998,0.00076506444,0.0027985906,0.005711096,0.00042156182,0.0025011972,0.0010433497,0.001228646,0.0020030807],"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.00025900156,0.00036316432,0.02603188,0.001224854,0.0002833837,0.0010624705,0.00042469345,0.018329073,0.021242633,0.009223701,0.014208584,0.9073466],"study_design_scores_gemma":[0.00012514101,0.00033946495,0.03184331,0.0005913044,0.0010301848,0.0025975187,0.0012590361,0.7673787,0.055643614,0.075381,0.06369295,0.00011778466],"about_ca_topic_score_codex":0.0043506073,"about_ca_topic_score_gemma":0.0077595413,"teacher_disagreement_score":0.006478539,"about_ca_system_score_codex":0.0004449575,"about_ca_system_score_gemma":0.0014182761,"threshold_uncertainty_score":0.008650541},"labels":[],"label_agreement":null},{"id":"W3029390389","doi":"10.1007/978-3-030-46133-1_36","title":"Compact Representation of a Multi-dimensional Combustion Manifold Using Deep Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Combustion and flame dynamics","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Representation (politics); Manifold (fluid mechanics); Artificial neural network; Combustion; Artificial intelligence; Deep neural networks; Computer science; Pattern recognition (psychology); Mathematics; Topology (electrical circuits); Chemistry; Political science; Engineering; Mechanical engineering; Combinatorics; Physical chemistry","score_opus":0.025713702200456993,"score_gpt":0.25072598281053654,"score_spread":0.22501228061007955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029390389","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.01870157,0.00034570677,0.9767006,0.000176747,0.000090513175,0.000016614194,0.00036718175,0.0008220051,0.0027790524],"genre_scores_gemma":[0.5980968,0.0010816972,0.3849179,0.00018542462,0.0002066152,0.00010941984,0.0020670812,0.00044689828,0.01288821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999213,0.000010668093,0.0000048396,0.000022497463,0.000029582145,0.00001102717],"domain_scores_gemma":[0.999861,0.000041268453,0.000019842202,0.000031220512,0.0000318412,0.000014880055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001577592,0.00066226657,0.0006644809,0.0005375919,0.00024043556,0.000945815,0.0009310884,0.00091330655,0.0038765015],"category_scores_gemma":[0.00052727683,0.0003876503,0.0007038212,0.00056322396,0.0004400822,0.0014785611,0.0011392973,0.0013450024,0.0009573395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012470418,0.000062990315,0.00043428555,0.00015349222,0.00005249158,0.00016111608,0.000063724445,0.7686783,0.016401565,0.048464958,0.006079208,0.15932316],"study_design_scores_gemma":[0.0000010824251,0.0000055513447,0.000042742882,0.0000024784663,0.0000013142877,0.000011784767,0.0000024201615,0.9940655,0.00040183085,0.0049716686,0.0004910128,0.0000024854749],"about_ca_topic_score_codex":0.0024934807,"about_ca_topic_score_gemma":0.00338392,"teacher_disagreement_score":0.0038765015,"about_ca_system_score_codex":0.00041255163,"about_ca_system_score_gemma":0.00041912717,"threshold_uncertainty_score":0.012968183},"labels":[],"label_agreement":null},{"id":"W3030491320","doi":"10.1007/978-3-030-47358-7_23","title":"Anomaly Detection and Prototype Selection Using Polyhedron Curvature","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Anomaly detection; Computer science; Curvature; Vertex (graph theory); Polyhedron; CAD; Anomaly (physics); Kernel (algebra); Artificial intelligence; Pattern recognition (psychology); Projection (relational algebra); Algorithm; Mathematics; Theoretical computer science; Graph; Combinatorics; Geometry; Physics","score_opus":0.017055655212748908,"score_gpt":0.24948962499013608,"score_spread":0.23243396977738717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030491320","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.014442955,0.00019770824,0.982077,0.00008402431,0.00006479541,0.00008060712,0.000084003244,0.0020576431,0.00091122504],"genre_scores_gemma":[0.2497054,0.0002713065,0.74460745,0.00008785608,0.00008350794,0.00013823823,0.00080112286,0.0006276689,0.0036774888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783933,0.0002942528,0.0001116057,0.0005938407,0.00097317726,0.00018784861],"domain_scores_gemma":[0.99723,0.0007580482,0.00019523098,0.00055430084,0.0011336984,0.00012865974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012659222,0.001288207,0.002415034,0.0028364477,0.0008229873,0.0026808851,0.0029123751,0.0015464629,0.004229611],"category_scores_gemma":[0.00557425,0.0008097112,0.0016443954,0.002361563,0.0009585877,0.0021448284,0.0021424734,0.0018143894,0.002266867],"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.0005147471,0.00016059515,0.0029279075,0.00020993751,0.00010997311,0.0003093686,0.00013520088,0.050253898,0.05834098,0.009849929,0.008039351,0.8691481],"study_design_scores_gemma":[0.000016011418,0.00010250284,0.0009231522,0.000012259276,0.000024640502,0.000409651,0.000044330536,0.9721468,0.018527903,0.005562016,0.0022020133,0.000028698858],"about_ca_topic_score_codex":0.0025899052,"about_ca_topic_score_gemma":0.002136085,"teacher_disagreement_score":0.004229611,"about_ca_system_score_codex":0.0008059715,"about_ca_system_score_gemma":0.00088520034,"threshold_uncertainty_score":0.014149427},"labels":[],"label_agreement":null},{"id":"W3032659344","doi":"10.1007/978-3-030-51938-4_12","title":"Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Chaining; Hash function; NIST; Cryptography; Theoretical computer science; Computer security; Distributed computing","score_opus":0.009392661269025862,"score_gpt":0.22482405453817106,"score_spread":0.2154313932691452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032659344","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.021521764,0.0024123252,0.93990934,0.0048337546,0.0009649898,0.00019664635,0.00019145495,0.0015601023,0.028409712],"genre_scores_gemma":[0.47324088,0.002075308,0.4712835,0.0013247019,0.0018110293,0.00021105177,0.00038029772,0.0007358676,0.0489374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465585,0.0012828583,0.00033941213,0.001114125,0.0019720504,0.0006357287],"domain_scores_gemma":[0.9931865,0.0014878698,0.00024052823,0.00391508,0.00088322547,0.00028668693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038814463,0.0008739699,0.0021536518,0.0015484514,0.002180133,0.0060556303,0.005484099,0.0030442295,0.0080205025],"category_scores_gemma":[0.010102278,0.0007634666,0.0012342464,0.003556865,0.0049132095,0.015876079,0.008487157,0.005571296,0.0030664864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034221658,0.00008829055,0.0002974087,0.00011600262,0.00003429731,0.00016448616,0.0002583393,0.0105837835,0.003884175,0.850794,0.008054694,0.12538217],"study_design_scores_gemma":[0.000059186797,0.000117951065,0.0001281043,0.00005477936,0.000049526378,0.0004851959,0.0001309747,0.18771414,0.006278694,0.7697185,0.035200216,0.00006273613],"about_ca_topic_score_codex":0.0007642822,"about_ca_topic_score_gemma":0.0006232692,"teacher_disagreement_score":0.0080205025,"about_ca_system_score_codex":0.00304397,"about_ca_system_score_gemma":0.0027645917,"threshold_uncertainty_score":0.02683121},"labels":[],"label_agreement":null},{"id":"W3032697887","doi":"10.1007/978-3-030-47358-7_39","title":"Exploring Deep Anomaly Detection Methods Based on Capsule Net","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Brock University; Queen's University; University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Autoencoder; Pattern recognition (psychology); Benchmark (surveying); Classifier (UML); Anomaly detection; Deep learning; ENCODE; Anomaly (physics); Cartography","score_opus":0.06106865309463925,"score_gpt":0.2897956188595806,"score_spread":0.22872696576494136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032697887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021045728,0.0004011154,0.97595143,0.00016698684,0.00005352149,0.000021212043,0.000047131536,0.0009840692,0.0013288395],"genre_scores_gemma":[0.5153552,0.00078470504,0.47507468,0.00024543417,0.00014990976,0.000073214884,0.0004637095,0.0003735341,0.007479593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971277,0.000058764126,0.00001221272,0.00007257169,0.00010208798,0.000041557065],"domain_scores_gemma":[0.9990466,0.0005470612,0.00008099642,0.000105231,0.00016137474,0.00005869328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148394,0.0008226493,0.0007819389,0.0009220879,0.00032440588,0.001196007,0.0017262561,0.00081215415,0.0019830537],"category_scores_gemma":[0.002157923,0.00045652475,0.00058758975,0.00075124693,0.00054607424,0.0020836736,0.0013990779,0.0015040352,0.0004983876],"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.00042568517,0.00022107658,0.0033865673,0.00015129693,0.00017401467,0.0001505891,0.000087867935,0.35598493,0.01752766,0.045674242,0.00466591,0.57155013],"study_design_scores_gemma":[0.0000029598825,0.000019125942,0.00010776207,0.0000034473335,0.00000705752,0.00001621196,0.00000462468,0.9917365,0.0010587628,0.006670679,0.00037004674,0.0000027716935],"about_ca_topic_score_codex":0.0028746254,"about_ca_topic_score_gemma":0.0035446486,"teacher_disagreement_score":0.0028746254,"about_ca_system_score_codex":0.00057508977,"about_ca_system_score_gemma":0.0006070064,"threshold_uncertainty_score":0.0066339374},"labels":[],"label_agreement":null},{"id":"W3033290378","doi":"10.1007/978-3-030-49663-0_26","title":"Improving Cognitive and Emotional State Using 3D Virtual Reality Orientation Game","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","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":"Institut Universitaire de Gériatrie de Montréal; Université de Montréal","funders":"","keywords":"Orientation (vector space); Computer science; Cognition; Virtual reality; Human–computer interaction; Serious game; Cognitive load; Cognitive training; Cognitive psychology; Multimedia; Psychology","score_opus":0.02147388159841978,"score_gpt":0.251828790759915,"score_spread":0.2303549091614952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033290378","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9470665,0.00043519452,0.03585066,0.00023160315,0.00012374415,0.00012897,0.00018177179,0.00055793446,0.015423713],"genre_scores_gemma":[0.96717626,0.0003755288,0.01997486,0.00018615427,0.000027503622,0.00016525056,0.00020705804,0.00004611057,0.0118411705],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999248,0.000015245335,0.0000032346306,0.000011667465,0.000024141404,0.000020867532],"domain_scores_gemma":[0.9999378,0.000025688947,0.000006523198,0.000004157821,0.000012844516,0.000012958461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106536405,0.0003560443,0.00020314456,0.00009853705,0.00009185049,0.00036345926,0.00029087684,0.00018353625,0.0037865762],"category_scores_gemma":[0.00034667077,0.00007070471,0.00021981669,0.000052364154,0.000090296235,0.00020506671,0.0003197869,0.00030312422,0.0004378448],"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.0026151733,0.0056526433,0.0071348245,0.00047999516,0.00015487896,0.00030949817,0.0011537006,0.0067508756,0.5697256,0.0032067266,0.008135888,0.39468023],"study_design_scores_gemma":[0.0015367095,0.022080049,0.32207277,0.0003367772,0.0014539807,0.0024920863,0.0028747832,0.1814489,0.38864303,0.009227265,0.0674472,0.00038631912],"about_ca_topic_score_codex":0.0005484139,"about_ca_topic_score_gemma":0.0007309341,"teacher_disagreement_score":0.0037865762,"about_ca_system_score_codex":0.00008938351,"about_ca_system_score_gemma":0.00009562897,"threshold_uncertainty_score":0.012667298},"labels":[],"label_agreement":null},{"id":"W3033367644","doi":"10.1007/978-3-030-48478-1_4","title":"A Scalable Unsupervised Framework for Comparing Graph Embeddings","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Graph embedding; Embedding; Scalability; Theoretical computer science; Graph; Vertex (graph theory); Topological graph theory; Artificial intelligence; Voltage graph; Line graph","score_opus":0.02260866034069164,"score_gpt":0.27252359084416317,"score_spread":0.24991493050347152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033367644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064000096,0.0002931927,0.9835264,0.00008567006,0.000076993165,0.000112083384,0.0010339287,0.007575838,0.0008959093],"genre_scores_gemma":[0.0767623,0.00027205775,0.90823764,0.00015197645,0.00013555496,0.00033285722,0.0082094995,0.0011874055,0.0047106696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972018,0.000534133,0.0001602986,0.0010957727,0.0008132347,0.00019482836],"domain_scores_gemma":[0.9963044,0.0011652504,0.00027598394,0.0012700141,0.00077192765,0.00021247518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721518,0.0023713016,0.0025536788,0.0050750603,0.001317003,0.0025329262,0.0052479724,0.002726004,0.006568772],"category_scores_gemma":[0.0068141925,0.001091398,0.0021703772,0.005756747,0.0010687124,0.006360812,0.0045897686,0.003033458,0.0043612514],"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.00036854082,0.00046290972,0.0019211372,0.0002930559,0.00032044278,0.00016025033,0.00010383667,0.07613652,0.020773847,0.01899148,0.02948689,0.85098106],"study_design_scores_gemma":[0.000037669695,0.00009382574,0.00074214453,0.000024077654,0.0000521746,0.0002094625,0.00006272379,0.9486786,0.0061499905,0.039024297,0.0048885574,0.000036422596],"about_ca_topic_score_codex":0.0077136597,"about_ca_topic_score_gemma":0.018516388,"teacher_disagreement_score":0.0077136597,"about_ca_system_score_codex":0.0011548899,"about_ca_system_score_gemma":0.0017516162,"threshold_uncertainty_score":0.021974683},"labels":[],"label_agreement":null},{"id":"W3033437302","doi":"10.1007/978-3-030-58526-6_37","title":"Info3D: Representation Learning on 3D Objects Using Mutual Information Maximization and Contrastive Learning","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Autodesk (Canada)","funders":"","keywords":"Infomax; Mutual information; Computer science; Artificial intelligence; Maximization; Feature learning; Representation (politics); Cluster analysis; Unsupervised learning; Pattern recognition (psychology); Machine learning; Mathematics; Channel (broadcasting)","score_opus":0.017232329000741144,"score_gpt":0.2470134514731537,"score_spread":0.22978112247241256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033437302","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.0024194124,0.00018952515,0.99293447,0.00010885217,0.000040208794,0.000042404037,0.00020688253,0.003536942,0.00052127626],"genre_scores_gemma":[0.064486116,0.0002523633,0.9286798,0.00022643524,0.00009460953,0.00026297098,0.0014715443,0.001993976,0.0025321143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876046,0.0003796257,0.000054361863,0.0002800032,0.00044214283,0.00008329989],"domain_scores_gemma":[0.9984634,0.00077782274,0.0000747408,0.0003948456,0.00021057468,0.000078607554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022912954,0.0017555126,0.002487587,0.0015914267,0.00063546945,0.0023199695,0.004033449,0.002906655,0.007393979],"category_scores_gemma":[0.005457064,0.0014892586,0.0022510493,0.0018232376,0.001426548,0.0044272975,0.0045993705,0.0031401273,0.0027912464],"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.0005912841,0.00026215738,0.00049377495,0.00040611727,0.00029585935,0.00015907368,0.00012940186,0.26528034,0.009571429,0.033861786,0.025529083,0.6634196],"study_design_scores_gemma":[0.000035141613,0.000039474915,0.00007414165,0.000011799175,0.000013593206,0.00003695806,0.0000065258623,0.97827065,0.0037116727,0.015818711,0.0019677863,0.000013543957],"about_ca_topic_score_codex":0.0037388518,"about_ca_topic_score_gemma":0.004765621,"teacher_disagreement_score":0.007393979,"about_ca_system_score_codex":0.001042739,"about_ca_system_score_gemma":0.0013502454,"threshold_uncertainty_score":0.024735332},"labels":[],"label_agreement":null},{"id":"W3033644511","doi":"10.1007/978-3-030-49663-0_10","title":"SHAPed Automated Essay Scoring: Explaining Writing Features’ Contributions to English Writing Organization","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Athabasca University","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence","score_opus":0.015752658711773327,"score_gpt":0.25879612960165854,"score_spread":0.2430434708898852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033644511","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.6618266,0.0007235493,0.2528069,0.0014855814,0.00028436867,0.00029773416,0.0023387838,0.0033699854,0.07686655],"genre_scores_gemma":[0.9486981,0.00007206349,0.043274816,0.00005031347,0.000041791962,0.00007136645,0.00085948565,0.00031952804,0.006612421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983203,0.0009023376,0.00009465146,0.00030183853,0.00025965847,0.00012120015],"domain_scores_gemma":[0.9754318,0.01726976,0.001923327,0.0015261861,0.00344215,0.00040679786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003130471,0.0005616144,0.0002647707,0.0015557151,0.0008360883,0.0031793327,0.0009038743,0.00069438457,0.008376143],"category_scores_gemma":[0.03625272,0.00032812377,0.00036807486,0.0015145203,0.00064002624,0.0025017513,0.001341938,0.0010418013,0.0022416934],"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.0009768879,0.00033653763,0.14256155,0.00044851,0.00010266276,0.0008049247,0.013395265,0.012387136,0.017299794,0.04097802,0.02824704,0.74246174],"study_design_scores_gemma":[0.00015383403,0.00044980246,0.2359303,0.0005840131,0.0002211594,0.0013637671,0.009420197,0.52721643,0.03062943,0.13929968,0.054531623,0.00019982108],"about_ca_topic_score_codex":0.0022788176,"about_ca_topic_score_gemma":0.0036616153,"teacher_disagreement_score":0.008376143,"about_ca_system_score_codex":0.0007811539,"about_ca_system_score_gemma":0.0007072766,"threshold_uncertainty_score":0.028021038},"labels":[],"label_agreement":null},{"id":"W3033851347","doi":"10.1007/978-3-030-90048-9_3","title":"Negative Instance for the Edge Patrolling Beacon Problem","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Patrolling; Ball (mathematics); Conjecture; Polygon (computer graphics); Combinatorics; Mathematics; Computer science; Artificial intelligence; Geometry; Geography; Telecommunications","score_opus":0.022153382588692344,"score_gpt":0.2726160449172854,"score_spread":0.25046266232859304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033851347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29321486,0.0015206726,0.5038046,0.033550873,0.0015866451,0.0005121223,0.009287434,0.003239161,0.15328355],"genre_scores_gemma":[0.7937402,0.0007718476,0.12509327,0.002600394,0.0011538177,0.0005603964,0.011292344,0.0011176436,0.06367009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986553,0.0003968084,0.00006383705,0.00034341656,0.0002986801,0.0002419334],"domain_scores_gemma":[0.9951898,0.0034201,0.00028406034,0.00032760316,0.00025312192,0.0005253258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012847754,0.001566087,0.0019333332,0.0008443438,0.0015377955,0.003742918,0.003883565,0.005495489,0.023639161],"category_scores_gemma":[0.01020028,0.00081792305,0.0011421443,0.0013190893,0.001668965,0.0065698866,0.002996055,0.0059681963,0.0017032282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027377994,0.0011010417,0.0025328477,0.0015996849,0.00018720333,0.0016052123,0.00049330894,0.13409075,0.0049472745,0.59893274,0.18469408,0.06707812],"study_design_scores_gemma":[0.0008022496,0.00018195929,0.00075883936,0.00010459521,0.00007926993,0.0008390895,0.00031710227,0.3515286,0.0019896014,0.6197358,0.023607524,0.000055289853],"about_ca_topic_score_codex":0.0019066309,"about_ca_topic_score_gemma":0.0021331315,"teacher_disagreement_score":0.023639161,"about_ca_system_score_codex":0.0012569986,"about_ca_system_score_gemma":0.00097593054,"threshold_uncertainty_score":0.07908094},"labels":[],"label_agreement":null},{"id":"W3034049083","doi":"10.1007/978-3-030-59299-8_5","title":"The Requirement Gatherers’ Approach to the 2019 Multi-Agent Programming Contest Scenario","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CONTEST; Debugging; Computer science; Software engineering; Programming language; Political science","score_opus":0.0611044280971996,"score_gpt":0.29043230508154705,"score_spread":0.22932787698434745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034049083","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.12046202,0.00022080445,0.34216988,0.019896185,0.00017549402,0.0005623413,0.00030561315,0.0002929762,0.5159147],"genre_scores_gemma":[0.88915545,0.00009652112,0.07451751,0.0008480047,0.000058972473,0.00032346457,0.00014873859,0.00007835386,0.034773033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923499,0.005538275,0.00014419117,0.00049469835,0.0007511176,0.0007217677],"domain_scores_gemma":[0.9943275,0.00352841,0.00024622914,0.0006457824,0.00037893487,0.00087322615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006094231,0.00048327475,0.0006405965,0.0009031632,0.0035501164,0.004928496,0.0027400558,0.005694632,0.024808597],"category_scores_gemma":[0.012749569,0.00060553756,0.0009613498,0.000932864,0.0030561322,0.0046105217,0.0043058577,0.0043405807,0.0016447542],"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.00019436322,0.000096695665,0.0002534003,0.00005077962,0.000024946394,0.000532682,0.000993171,0.01450588,0.0008122202,0.97331107,0.0033781726,0.0058467393],"study_design_scores_gemma":[0.00025848663,0.00011743528,0.0003765782,0.000043206393,0.000022157246,0.00033558847,0.0015323395,0.16522983,0.0010825632,0.79236406,0.03858322,0.000054486063],"about_ca_topic_score_codex":0.0035325496,"about_ca_topic_score_gemma":0.0045180507,"teacher_disagreement_score":0.024808597,"about_ca_system_score_codex":0.0022266633,"about_ca_system_score_gemma":0.0034150227,"threshold_uncertainty_score":0.08299297},"labels":[],"label_agreement":null},{"id":"W3034161672","doi":"10.1007/978-3-031-43587-4","title":"Fundamentals of Computation Theory","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sorbonne Université; Université Clermont-Auvergne; Korea Advanced Institute of Science and Technology; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Università di Bologna; Uniwersytet Warszawski; Universidad de Chile; Indian Institute of Technology Madras; Technische Universität Wien; University of Haifa; Georg-August-Universität Göttingen; Université de Bordeaux; Montana State University; Augusta University; University of Regina; Centre National de la Recherche Scientifique; Universidade do Porto; Universität Trier; Université Paris Diderot; University of Ottawa; Uniwersytet Wrocławski; Univerzita Karlova v Praze","keywords":"Computer science; Computation; Theoretical computer science; Algorithm","score_opus":0.022186045636357538,"score_gpt":0.2771379641686573,"score_spread":0.2549519185322998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034161672","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016036885,0.071342334,0.19937168,0.007348845,0.0037985323,0.00010373103,0.0009232705,0.0012035255,0.7143044],"genre_scores_gemma":[0.1255401,0.089797184,0.1647192,0.0047125276,0.009261177,0.00081359665,0.002104008,0.0011665308,0.6018857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994717,0.00009358494,0.000028287315,0.00012360024,0.00023215127,0.00005072345],"domain_scores_gemma":[0.99951255,0.00023322683,0.000020670843,0.00010670135,0.00008927995,0.000037709204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498366,0.0012658433,0.0013730243,0.0016612903,0.0011418685,0.004554122,0.0013225243,0.0010885602,0.031735264],"category_scores_gemma":[0.0017806201,0.00065639254,0.00077540986,0.0030424122,0.0030564882,0.0044192867,0.0013112057,0.0039446126,0.01886747],"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.000007648681,0.000011456632,0.000066640976,0.0002009884,0.000008193247,0.000022595006,0.00013987029,0.00061686774,0.0003057794,0.87802917,0.05720833,0.0633825],"study_design_scores_gemma":[0.000005164706,0.000006300279,0.00014352107,0.00009855614,0.0000058021687,0.00006169757,0.00003215406,0.0009766038,0.00012902079,0.7078548,0.29068023,0.0000060903185],"about_ca_topic_score_codex":0.0014772648,"about_ca_topic_score_gemma":0.0014908683,"teacher_disagreement_score":0.031735264,"about_ca_system_score_codex":0.001933578,"about_ca_system_score_gemma":0.0016154536,"threshold_uncertainty_score":0.10616505},"labels":[],"label_agreement":null},{"id":"W3034396897","doi":"10.1007/978-3-030-50578-3_3","title":"Structural Profiling of Web Sites in the Wild","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Profiling (computer programming); Information retrieval; World Wide Web; Point (geometry); Data mining; Data science; Mathematics","score_opus":0.025408006769250525,"score_gpt":0.24920812461273587,"score_spread":0.22380011784348533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034396897","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.8727206,0.0024302108,0.097018756,0.00074997847,0.00013953722,0.00013987336,0.011385596,0.0024090162,0.013006473],"genre_scores_gemma":[0.9370651,0.00084352214,0.045864154,0.000093048584,0.00008605111,0.00006371789,0.0106461,0.00035578932,0.0049824133],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988649,0.00019350207,0.00008463183,0.0002811371,0.00044082696,0.00013502863],"domain_scores_gemma":[0.9954159,0.0017451631,0.00062297797,0.00087682967,0.000984882,0.0003541327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495821,0.0002562228,0.00040012656,0.004223466,0.00056533737,0.0020958919,0.0006480443,0.0005532101,0.0013918251],"category_scores_gemma":[0.00472836,0.00034940962,0.0003737135,0.005596441,0.0003610711,0.0026711253,0.0006676847,0.0007050497,0.0015674932],"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.0004976911,0.000511531,0.46636817,0.00065864605,0.0002461834,0.0008606538,0.002097892,0.019820945,0.06779081,0.025444048,0.020863006,0.39484042],"study_design_scores_gemma":[0.000024642286,0.00027962262,0.40833887,0.00025775106,0.00018246878,0.0029368184,0.0037126865,0.43894455,0.03568158,0.06378625,0.045752175,0.00010263585],"about_ca_topic_score_codex":0.0029766383,"about_ca_topic_score_gemma":0.010817842,"teacher_disagreement_score":0.004223466,"about_ca_system_score_codex":0.00041992965,"about_ca_system_score_gemma":0.00047389203,"threshold_uncertainty_score":0.005918622},"labels":[],"label_agreement":null},{"id":"W3034833495","doi":"10.1007/978-3-030-50120-4_15","title":"An Unsupervised Learning Approach to Discontinuity-Preserving Image Registration","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Ontario Tech University","funders":"","keywords":"Classification of discontinuities; Computer science; Smoothness; Artificial intelligence; Discontinuity (linguistics); Image (mathematics); Image registration; Computer vision; Domain (mathematical analysis); Function (biology); Pattern recognition (psychology); Mathematics","score_opus":0.02248690502111718,"score_gpt":0.27910977858262226,"score_spread":0.2566228735615051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034833495","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.0012220216,0.00007131586,0.9980531,0.000025678237,0.000011524777,0.000015588175,0.000015115856,0.00027074476,0.00031491247],"genre_scores_gemma":[0.0587897,0.0002624664,0.9355889,0.00007893081,0.00007402909,0.000106784726,0.00023704313,0.00031754517,0.004544601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906343,0.00021850785,0.00005476232,0.00026197897,0.00032712534,0.00007409878],"domain_scores_gemma":[0.99879116,0.0004935246,0.00010257954,0.00031832178,0.00025887255,0.00003551985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012068375,0.0005710209,0.0014814608,0.001245905,0.0006416093,0.0013061776,0.0035195383,0.0016854985,0.0027429785],"category_scores_gemma":[0.0027770533,0.0008326684,0.001525185,0.0020736796,0.0011859908,0.0017212107,0.0021417334,0.00204528,0.0014270724],"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.00013550403,0.00018774874,0.00044757864,0.00018384925,0.00015591034,0.00008970606,0.00012827906,0.19652091,0.02966045,0.043076087,0.003685467,0.7257286],"study_design_scores_gemma":[0.000008354655,0.000045213666,0.0002413007,0.000008259084,0.00001890471,0.00009557001,0.000011732157,0.9745657,0.0060839257,0.016862832,0.0020442316,0.000014033388],"about_ca_topic_score_codex":0.0028394961,"about_ca_topic_score_gemma":0.004411822,"teacher_disagreement_score":0.0035195383,"about_ca_system_score_codex":0.00062175625,"about_ca_system_score_gemma":0.0009940668,"threshold_uncertainty_score":0.009176195},"labels":[],"label_agreement":null},{"id":"W3035050964","doi":"10.1007/978-3-030-50578-3_1","title":"Detecting Responsive Web Design Bugs with Declarative Specifications","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Crawling; Window (computing); Software engineering; Web application; Programming language; Human–computer interaction; World Wide Web","score_opus":0.059377615250169914,"score_gpt":0.25285541217276464,"score_spread":0.19347779692259473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035050964","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.12524736,0.00043545352,0.82501537,0.0008675076,0.00014493559,0.0003829233,0.0012669272,0.042581417,0.004058105],"genre_scores_gemma":[0.53252715,0.0003032612,0.45544994,0.00063351245,0.00005569813,0.0003119715,0.0027040485,0.0043460317,0.0036684684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884384,0.0027632052,0.0009467841,0.0012327707,0.00567068,0.0009480712],"domain_scores_gemma":[0.94285685,0.036945377,0.0056166206,0.00842432,0.005598198,0.00055860414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058788946,0.0015615439,0.0007814837,0.0019436226,0.0005066246,0.0026162523,0.0030087966,0.0023284748,0.0026933774],"category_scores_gemma":[0.044966523,0.0016822281,0.0015937103,0.0009522357,0.0012722131,0.004602502,0.0028471425,0.002725873,0.0012791046],"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.0014028301,0.0015274412,0.09144763,0.0027227816,0.00042919806,0.004615346,0.0041625337,0.13652146,0.09724929,0.06355436,0.030728837,0.56563836],"study_design_scores_gemma":[0.00014582832,0.00044880007,0.0040417667,0.00036609528,0.00025833544,0.0012766311,0.0011303694,0.8549489,0.08169668,0.039490294,0.016072249,0.00012417148],"about_ca_topic_score_codex":0.0027430945,"about_ca_topic_score_gemma":0.0049247835,"teacher_disagreement_score":0.0058788946,"about_ca_system_score_codex":0.0007835321,"about_ca_system_score_gemma":0.00227645,"threshold_uncertainty_score":0.031090915},"labels":[],"label_agreement":null},{"id":"W3035455711","doi":"10.1007/978-3-030-58323-1_16","title":"Evaluating a Multi-sense Definition Generation Model for Multiple Languages","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Polysemy; Computer science; Contrast (vision); Word (group theory); Context (archaeology); Natural language processing; Artificial intelligence; Language model; Word-sense disambiguation; Linguistics","score_opus":0.21004608936275568,"score_gpt":0.3725867930988983,"score_spread":0.16254070373614263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035455711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17128275,0.00055618153,0.813751,0.0012478976,0.00024218652,0.0004809709,0.0011106824,0.008386682,0.0029416534],"genre_scores_gemma":[0.6918979,0.00015914567,0.30105314,0.00033321753,0.00009620911,0.0002904776,0.0030983745,0.00089118036,0.0021802885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98902404,0.0053618825,0.0007098786,0.0019143439,0.0025097467,0.00048016803],"domain_scores_gemma":[0.9575825,0.032718625,0.0011761318,0.0035137094,0.003948344,0.0010607747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012289228,0.0014010125,0.0016057251,0.0023081012,0.0009370342,0.0043555507,0.0024739667,0.0025777305,0.004100472],"category_scores_gemma":[0.041957986,0.0007511381,0.0022528972,0.0012816247,0.0009168045,0.005743318,0.0034355235,0.0019657472,0.0011971376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004480844,0.0013769032,0.019845633,0.001239756,0.0010209905,0.0007841214,0.0017428575,0.4631714,0.022898315,0.044108555,0.013768385,0.4255623],"study_design_scores_gemma":[0.000087795495,0.0001665262,0.00049797277,0.000026629992,0.00010909116,0.000066130866,0.00014166605,0.9810115,0.003387636,0.013640728,0.00084385584,0.00002039105],"about_ca_topic_score_codex":0.005156623,"about_ca_topic_score_gemma":0.0065900064,"teacher_disagreement_score":0.012289228,"about_ca_system_score_codex":0.0020366227,"about_ca_system_score_gemma":0.0024233656,"threshold_uncertainty_score":0.06499243},"labels":[],"label_agreement":null},{"id":"W3035513392","doi":"10.1007/978-3-030-53518-6_4","title":"Leveraging the Information Contained in Theory Presentations","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McMaster University","funders":"","keywords":"Computer science; Constructive; Homomorphism; Algebra over a field; Automated theorem proving; Universal algebra; Core (optical fiber); Algebraic number; Theoretical computer science; Programming language; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.021020999260061374,"score_gpt":0.24998420260760862,"score_spread":0.22896320334754725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035513392","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055773132,0.002091254,0.39024436,0.009902741,0.003264252,0.00030767894,0.0020357848,0.0070351623,0.57954144],"genre_scores_gemma":[0.27387413,0.00820457,0.2814878,0.0035498035,0.004939144,0.00067761913,0.007165092,0.010044978,0.41005683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606735,0.0011399678,0.00020994278,0.00059404,0.0016739503,0.00031475115],"domain_scores_gemma":[0.9879702,0.0065602507,0.00041916608,0.0029408517,0.0015193501,0.00059020607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033723293,0.0013668942,0.001136176,0.0043537603,0.002218068,0.013518164,0.0035393068,0.00269068,0.21304081],"category_scores_gemma":[0.028780652,0.0013578488,0.001244742,0.0035814766,0.0016946621,0.029274318,0.007493124,0.0045751194,0.07764047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023019264,0.00012462107,0.0003334543,0.0005560671,0.00003526737,0.00035412802,0.0011552869,0.004144586,0.0041073905,0.5745276,0.118917845,0.2955136],"study_design_scores_gemma":[0.00003363862,0.000054833858,0.00012787209,0.00027886796,0.00004837668,0.00038166982,0.00037707685,0.010196345,0.004032275,0.5993337,0.38507187,0.00006347732],"about_ca_topic_score_codex":0.00086176407,"about_ca_topic_score_gemma":0.0010828468,"teacher_disagreement_score":0.21304081,"about_ca_system_score_codex":0.0021945303,"about_ca_system_score_gemma":0.0019903025,"threshold_uncertainty_score":0.7126925},"labels":[],"label_agreement":null},{"id":"W3035862496","doi":"10.1007/978-3-030-59212-7_16","title":"Practical Random Access to SLP-Compressed Texts","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Grammar; Rule-based machine translation; Simple (philosophy); Encoding (memory); Random access; Process (computing); Compression (physics); Theoretical computer science; Data compression; Artificial intelligence; Programming language; Linguistics","score_opus":0.047602032211029904,"score_gpt":0.3466941386429499,"score_spread":0.29909210643191997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035862496","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.14033626,0.0011478914,0.8258551,0.0047259526,0.0005407604,0.000424147,0.0025616142,0.0060229665,0.018385299],"genre_scores_gemma":[0.7692018,0.000721433,0.20342316,0.0008951602,0.0010703416,0.00048373625,0.0036616942,0.00077102496,0.019771602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931772,0.0021723246,0.0005039332,0.0007950358,0.0024707,0.0008809107],"domain_scores_gemma":[0.9749312,0.014762295,0.0007252119,0.007022178,0.0021068172,0.00045227018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029827156,0.0009553454,0.0014791779,0.001212291,0.0009227291,0.002373168,0.0012799961,0.0019499506,0.017148444],"category_scores_gemma":[0.025828272,0.00071380415,0.00064136076,0.0021703236,0.0015590888,0.00389458,0.0054361057,0.0020156298,0.004915609],"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.0077456473,0.00053157815,0.0017868911,0.0012042206,0.00020242712,0.0016068299,0.0008950535,0.08311617,0.06443833,0.16924646,0.043817528,0.6254089],"study_design_scores_gemma":[0.0005463071,0.0004120928,0.00068619155,0.00013919576,0.00009642131,0.0010258344,0.00032841275,0.6945882,0.06468734,0.22469911,0.012716876,0.00007402939],"about_ca_topic_score_codex":0.00085649703,"about_ca_topic_score_gemma":0.0015387646,"teacher_disagreement_score":0.017148444,"about_ca_system_score_codex":0.0007565207,"about_ca_system_score_gemma":0.001820787,"threshold_uncertainty_score":0.057367206},"labels":[],"label_agreement":null},{"id":"W3035865337","doi":"10.1007/978-3-030-50516-5_28","title":"An Interpretable Data-Driven Score for the Assessment of Fundus Images Quality","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Hôpital Maisonneuve-Rosemont; Polytechnique Montréal","funders":"","keywords":"Computer science; Fundus (uterus); Grading (engineering); Artificial intelligence; Diabetic retinopathy; Image quality; Quality Score; Quality assessment; Image (mathematics); Computer vision; Pattern recognition (psychology); Medicine; Ophthalmology; Pathology; Diabetes mellitus","score_opus":0.08011302836722686,"score_gpt":0.39392092678062857,"score_spread":0.31380789841340173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035865337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031923585,0.00089165376,0.94527227,0.00023862794,0.00030712015,0.00043718817,0.005263134,0.009690277,0.005976133],"genre_scores_gemma":[0.18893448,0.0005517604,0.79656875,0.0002625373,0.00018148732,0.0009553405,0.0048742234,0.00085955765,0.006811899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749774,0.00049633667,0.000237723,0.00041046267,0.0012869188,0.000070765],"domain_scores_gemma":[0.9938362,0.003188908,0.00047652336,0.00045580807,0.0018939648,0.0001485547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026021246,0.001250204,0.0011408329,0.0034287258,0.00018794127,0.0021305142,0.0013867458,0.001307236,0.010603314],"category_scores_gemma":[0.013400829,0.00034105973,0.0007947319,0.0017715271,0.00046105136,0.0010853177,0.0010247846,0.0007338529,0.00471496],"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.0010369177,0.00021862744,0.012546448,0.0005753417,0.00022884837,0.00027983656,0.00014784835,0.017162794,0.05652241,0.00399029,0.015684368,0.8916063],"study_design_scores_gemma":[0.00022099339,0.0013999192,0.056719307,0.00043006477,0.00035079577,0.003040471,0.00027494747,0.8050542,0.09084018,0.016821783,0.024477504,0.00036990375],"about_ca_topic_score_codex":0.0010719937,"about_ca_topic_score_gemma":0.0013545462,"teacher_disagreement_score":0.010603314,"about_ca_system_score_codex":0.0006694784,"about_ca_system_score_gemma":0.0003727377,"threshold_uncertainty_score":0.03547162},"labels":[],"label_agreement":null},{"id":"W3035890040","doi":"10.1007/978-3-030-50371-0_39","title":"Learning Mixed Traffic Signatures in Shared Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bottleneck; Computer network; Perceptron; Airfield traffic pattern; Traffic classification; Data mining; Real-time computing; Artificial intelligence; Distributed computing; Artificial neural network; Embedded system","score_opus":0.011980195038523146,"score_gpt":0.21576615197129298,"score_spread":0.20378595693276982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035890040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16721727,0.00032374283,0.8293261,0.00031899143,0.00006479464,0.000032798423,0.00011859533,0.00095525355,0.0016424162],"genre_scores_gemma":[0.8870428,0.0001775579,0.106510244,0.00010546949,0.00011404765,0.000063429754,0.00040799,0.00012579879,0.0054525533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00021447103,0.00003670353,0.00019452772,0.00015448578,0.000115419185],"domain_scores_gemma":[0.99524575,0.0032357734,0.00035047065,0.0005314725,0.00040926502,0.00022717784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012657649,0.0007263546,0.0010468918,0.0007802578,0.0004007847,0.001313164,0.0019177345,0.0013783829,0.0016317158],"category_scores_gemma":[0.007103003,0.0006618261,0.000541759,0.0009795014,0.0008776087,0.003992365,0.0025169798,0.0015787481,0.0004402471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063335756,0.00014120882,0.004007616,0.00008634333,0.000090881316,0.00010448321,0.00015441485,0.674352,0.004416449,0.021813981,0.0021529011,0.29204646],"study_design_scores_gemma":[0.0000058503088,0.000023254295,0.00010580815,0.0000030619813,0.000004382356,0.000015262134,0.000014062753,0.9830057,0.00068724784,0.015942916,0.00018949535,0.0000028879572],"about_ca_topic_score_codex":0.0013391746,"about_ca_topic_score_gemma":0.0018053133,"teacher_disagreement_score":0.0019177345,"about_ca_system_score_codex":0.0009342391,"about_ca_system_score_gemma":0.0007556907,"threshold_uncertainty_score":0.006778419},"labels":[],"label_agreement":null},{"id":"W3035899512","doi":"10.1007/978-3-030-50420-5_47","title":"Classification of Lung Diseases Using Deep Learning Models","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":58,"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; Convolutional neural network; Transfer of learning; Artificial intelligence; Pipeline (software); Deep learning; Machine learning; Task (project management); Artificial neural network; Pattern recognition (psychology); Data mining","score_opus":0.05891148203128032,"score_gpt":0.31345605031997,"score_spread":0.25454456828868965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035899512","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.17736682,0.011205398,0.78656095,0.0026717205,0.0007197675,0.00014585916,0.0054386915,0.0029446397,0.012946138],"genre_scores_gemma":[0.8160567,0.004109858,0.14752862,0.0006654685,0.00042101703,0.00011784444,0.008525823,0.00014604426,0.02242858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998611,0.000022483304,0.0000115908,0.000036714904,0.000037580485,0.000030607807],"domain_scores_gemma":[0.9996973,0.00014325164,0.000025757829,0.000030972653,0.00007901998,0.000023776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187282,0.00072484615,0.0005150477,0.0008821419,0.0001256822,0.0007594708,0.0006795825,0.00071591133,0.0022873082],"category_scores_gemma":[0.00081996486,0.00021049235,0.0010017434,0.00047798848,0.00012278401,0.00057930796,0.00052800984,0.001012998,0.0014517005],"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.00023813258,0.0002654041,0.015824666,0.0001707112,0.0001576729,0.00023885745,0.000047323843,0.09364749,0.010069028,0.0024740237,0.019391483,0.8574753],"study_design_scores_gemma":[0.000011015366,0.00007319864,0.003908983,0.00007436809,0.000055020497,0.00020775315,0.000029444118,0.9822105,0.0043668533,0.005991082,0.0030578463,0.000013949874],"about_ca_topic_score_codex":0.003750014,"about_ca_topic_score_gemma":0.005793967,"teacher_disagreement_score":0.003750014,"about_ca_system_score_codex":0.00034314097,"about_ca_system_score_gemma":0.0003638517,"threshold_uncertainty_score":0.0076517463},"labels":[],"label_agreement":null},{"id":"W3035908455","doi":"10.1007/978-3-030-51310-8_18","title":"Literary Natural Language Generation with Psychological Traits","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Polytechnique Montréal","funders":"","keywords":"Parsing; Creativity; Computer science; Artificial intelligence; Natural language processing; Text generation; Natural language generation; Natural (archaeology); Personality; Literary language; Linguistics; Natural language; Psychology; History; Philosophy; Social psychology","score_opus":0.03215910308621596,"score_gpt":0.28881465221331426,"score_spread":0.2566555491270983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035908455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26084983,0.00070902606,0.4311884,0.0024755066,0.0003412749,0.0001650499,0.00048676672,0.0022018913,0.30158222],"genre_scores_gemma":[0.9353905,0.00014645934,0.03732661,0.0000982287,0.00008744977,0.00007090237,0.00044078965,0.00034370922,0.026095323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.00036470877,0.000024004758,0.000103553546,0.00011283022,0.00003083748],"domain_scores_gemma":[0.99701715,0.0020991575,0.00011893579,0.00037081333,0.0002973652,0.00009651796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198293,0.00028463762,0.00017176355,0.0006852735,0.00051602506,0.0021329934,0.0005707026,0.00046545634,0.011104945],"category_scores_gemma":[0.0071193753,0.0002994804,0.00033081847,0.000539982,0.0010749359,0.0025187188,0.0011472463,0.0008147427,0.0017472468],"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.00015221322,0.00018012304,0.00485402,0.0002217752,0.000037971055,0.0008053654,0.0048220786,0.0074743954,0.007651143,0.7763009,0.012044826,0.18545525],"study_design_scores_gemma":[0.000047739522,0.00013228819,0.00500304,0.00009296185,0.000038421662,0.0011911026,0.0016915965,0.120372064,0.007302402,0.8316217,0.032464437,0.000042277854],"about_ca_topic_score_codex":0.0002285145,"about_ca_topic_score_gemma":0.0002655876,"teacher_disagreement_score":0.011104945,"about_ca_system_score_codex":0.00042834377,"about_ca_system_score_gemma":0.0002302809,"threshold_uncertainty_score":0.037149727},"labels":[],"label_agreement":null},{"id":"W3035925203","doi":"10.1007/978-3-030-50433-5_17","title":"On the Complementary Role of Data Assimilation and Machine Learning: An Example Derived from Air Quality Analysis","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Meteorological Phenomena and Simulations","field":"Earth and Planetary Sciences","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":"Environment and Climate Change Canada","funders":"","keywords":"Computer science; Covariance; Kalman filter; Statistics; Algorithm; Interpolation (computer graphics); Data assimilation; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.12542892109937723,"score_gpt":0.28466955005173,"score_spread":0.15924062895235278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035925203","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.05800125,0.020824758,0.6142227,0.01609944,0.0011029558,0.00007942054,0.0002997224,0.00031111957,0.28905866],"genre_scores_gemma":[0.6278454,0.016981872,0.28835192,0.0024144175,0.0011463916,0.000068964786,0.00028327474,0.00025511804,0.0626526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973255,0.000105696054,0.0000116433475,0.000035586974,0.00009088839,0.000023545817],"domain_scores_gemma":[0.9991068,0.0007018564,0.000022696035,0.00004852161,0.00010136003,0.000018696597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006531862,0.00044118206,0.00065117824,0.0005895135,0.0008309579,0.002240105,0.00080379064,0.0017289419,0.0027621987],"category_scores_gemma":[0.0019795764,0.00025528984,0.0007647859,0.0016572318,0.0017455843,0.0021275398,0.0015031585,0.0020392237,0.00047171142],"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.00007507859,0.00009771235,0.001653249,0.00024208914,0.000045277724,0.0009995654,0.0007511286,0.025786703,0.0028951615,0.86382973,0.011120883,0.09250336],"study_design_scores_gemma":[0.000016766098,0.00004820623,0.0022952126,0.000105121115,0.000032442993,0.00045581433,0.00042652202,0.1337139,0.0015569758,0.8114321,0.049874246,0.000042683678],"about_ca_topic_score_codex":0.012464189,"about_ca_topic_score_gemma":0.012502769,"teacher_disagreement_score":0.012464189,"about_ca_system_score_codex":0.0006908479,"about_ca_system_score_gemma":0.0006773043,"threshold_uncertainty_score":0.024783313},"labels":[],"label_agreement":null},{"id":"W3036001641","doi":"10.1007/978-3-030-50347-5_14","title":"2D Bidirectional Gated Recurrent Unit Convolutional Neural Networks for End-to-End Violence Detection in Videos","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":26,"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 Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Convolutional neural network; Artificial intelligence; End-to-end principle; Frame (networking); Computer vision; Deep learning; Action recognition; Pattern recognition (psychology); Feature extraction; Computer network","score_opus":0.02282298543659758,"score_gpt":0.2601818844942797,"score_spread":0.23735889905768212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036001641","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.066461176,0.0026172127,0.9102543,0.00036951777,0.00042842864,0.00019628403,0.0042036073,0.008976765,0.0064926213],"genre_scores_gemma":[0.570028,0.0019853727,0.39191413,0.00042376938,0.0002194109,0.00033170872,0.011271045,0.00039555063,0.023430936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978167,0.000026318723,0.0000079939855,0.00006825061,0.000053361353,0.00006237718],"domain_scores_gemma":[0.99983513,0.000051367206,0.000014064712,0.000024724697,0.000058258705,0.00001637093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003382497,0.0013479141,0.0010058776,0.0007975712,0.0002990955,0.0005411333,0.0014018688,0.0010413278,0.0049550384],"category_scores_gemma":[0.00074721436,0.0004530127,0.0007704125,0.0007684441,0.00019173362,0.000625943,0.00094233046,0.00095799373,0.0032230404],"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.0003531408,0.00022612866,0.00182309,0.00015253254,0.00011403455,0.00023415156,0.000048506947,0.07132418,0.024250964,0.00165819,0.017458709,0.8823564],"study_design_scores_gemma":[0.000008121002,0.00006239443,0.0012931002,0.000023659137,0.000025398798,0.00007603796,0.000022253318,0.9849519,0.010205486,0.0015946346,0.0017237014,0.000013275105],"about_ca_topic_score_codex":0.011787632,"about_ca_topic_score_gemma":0.02823053,"teacher_disagreement_score":0.011787632,"about_ca_system_score_codex":0.00051407045,"about_ca_system_score_gemma":0.0007025827,"threshold_uncertainty_score":0.023438036},"labels":[],"label_agreement":null},{"id":"W3036006868","doi":"10.1007/978-3-030-49669-2_1","title":"Modeling and Mitigating Security Threats in Network Functions Virtualization (NFV)","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","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":"Concordia University","funders":"","keywords":"Network Functions Virtualization; Computer science; Virtualization; Software deployment; Full virtualization; Virtual network; Virtual machine; Cloud computing; Agile software development; Computer network; Distributed computing; Operating system; Computer security; Software engineering","score_opus":0.020209958047179188,"score_gpt":0.2351956233108908,"score_spread":0.21498566526371163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036006868","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.08751357,0.0025282602,0.870264,0.0009933983,0.00030203865,0.00005795581,0.00014688344,0.00042608014,0.037767738],"genre_scores_gemma":[0.9216889,0.0022104061,0.060252644,0.0001267744,0.00012973102,0.00005901621,0.00014459323,0.00010659624,0.015281277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971944,0.000086082444,0.0000093197805,0.000042588876,0.00007527,0.000067250854],"domain_scores_gemma":[0.9996629,0.00017695488,0.00005011762,0.000037321402,0.000051313018,0.00002133007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423534,0.00064688944,0.00041495962,0.0003035858,0.0003921997,0.0014105929,0.00090424035,0.00088617246,0.0015664225],"category_scores_gemma":[0.0012275431,0.00037484153,0.00047304423,0.00033893148,0.00058832776,0.0019647288,0.0008173839,0.00090205116,0.00024888606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001880356,0.000033558805,0.0005956337,0.0000438326,0.000016186508,0.00005721151,0.000062707644,0.92093366,0.0014097049,0.060791466,0.0010714021,0.014965765],"study_design_scores_gemma":[0.0000012737295,0.000009023472,0.00012363945,0.000009865355,0.0000051974034,0.00001879452,0.00001718625,0.97830564,0.00031610852,0.019880861,0.0013085849,0.0000037515872],"about_ca_topic_score_codex":0.008301783,"about_ca_topic_score_gemma":0.005660402,"teacher_disagreement_score":0.008301783,"about_ca_system_score_codex":0.0007775931,"about_ca_system_score_gemma":0.0009850801,"threshold_uncertainty_score":0.01650697},"labels":[],"label_agreement":null},{"id":"W3036119971","doi":"10.1007/978-3-030-49669-2_12","title":"Local Differentially Private Matrix Factorization with MoG for Recommendations","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Alberta","funders":"","keywords":"Computer science; Matrix decomposition; Factorization; Matrix (chemical analysis); Artificial intelligence; Algorithm","score_opus":0.027214250074254345,"score_gpt":0.26954929311640113,"score_spread":0.24233504304214679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036119971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008363246,0.0007153074,0.9847282,0.0007672665,0.00015195203,0.000101034966,0.0003573837,0.0009206013,0.0038949812],"genre_scores_gemma":[0.47167996,0.0011474023,0.49768582,0.0010323471,0.00078594073,0.0005095128,0.0015329223,0.00033220477,0.025293792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966768,0.0013115124,0.00012138273,0.0006276331,0.0008344593,0.00042818417],"domain_scores_gemma":[0.9946228,0.0021424617,0.00025318892,0.0023793622,0.00039225793,0.00021004015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027132109,0.0012982035,0.0023563246,0.0007619442,0.0011058695,0.002042726,0.0025040598,0.0023417585,0.009193459],"category_scores_gemma":[0.011895827,0.0009639169,0.0012890318,0.0017925637,0.0018997706,0.0048852223,0.0035748172,0.003060101,0.00457996],"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.0013054662,0.0005152507,0.00094612257,0.00051061006,0.00021203278,0.00025300568,0.00028706793,0.28949344,0.0072090323,0.26144433,0.048350584,0.38947308],"study_design_scores_gemma":[0.0000701616,0.00011455604,0.00013267649,0.000030409348,0.000021119236,0.00011283886,0.00004186976,0.75132143,0.0014568258,0.24292603,0.0037491012,0.000023047605],"about_ca_topic_score_codex":0.0022220935,"about_ca_topic_score_gemma":0.0035615917,"teacher_disagreement_score":0.009193459,"about_ca_system_score_codex":0.0013948977,"about_ca_system_score_gemma":0.0023194675,"threshold_uncertainty_score":0.030755162},"labels":[],"label_agreement":null},{"id":"W3036186109","doi":"10.1007/978-3-030-50347-5_7","title":"Detecting Macroblocking in Images Caused by Transmission Error","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Lossy compression; SPARK (programming language); Packet loss; Artifact (error); Network packet; Artificial intelligence; Transfer of learning; Data transmission; Data compression; Block (permutation group theory); Transmission (telecommunications); Computer vision; Real-time computing; Computer hardware; Telecommunications; Computer network","score_opus":0.026674728600109714,"score_gpt":0.2894609689101344,"score_spread":0.2627862403100247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036186109","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.89493996,0.00049066276,0.10030957,0.00005013999,0.0000672774,0.00006209327,0.00013955645,0.001511368,0.0024292858],"genre_scores_gemma":[0.9691733,0.00023575974,0.028656384,0.000030678406,0.00003599931,0.000021823069,0.00014684336,0.00014488117,0.0015543199],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973124,0.000019926927,0.000014010882,0.00004795847,0.00013117501,0.000055613433],"domain_scores_gemma":[0.9979215,0.00075498834,0.00042837235,0.00024557958,0.0004977431,0.0001517799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030299046,0.00040402348,0.00035041972,0.00096072484,0.00031544233,0.0005670994,0.00046161006,0.00043526487,0.0016174635],"category_scores_gemma":[0.0020605372,0.00020618565,0.00012560455,0.0005208538,0.00025391564,0.00054474105,0.00050679484,0.0003662315,0.00035982204],"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.00354055,0.00020828741,0.045091882,0.0002607561,0.00006243839,0.002370111,0.000500577,0.007831559,0.66820097,0.0011387778,0.0016422204,0.26915184],"study_design_scores_gemma":[0.000065571476,0.001581462,0.09016677,0.00006346453,0.00017941612,0.003966789,0.00048205495,0.3052079,0.5923834,0.0015116993,0.004345002,0.000046490753],"about_ca_topic_score_codex":0.0017133475,"about_ca_topic_score_gemma":0.0023515911,"teacher_disagreement_score":0.0017133475,"about_ca_system_score_codex":0.000356247,"about_ca_system_score_gemma":0.00026298093,"threshold_uncertainty_score":0.0054109693},"labels":[],"label_agreement":null},{"id":"W3036233147","doi":"10.1007/978-3-030-50433-5_15","title":"Node Classification in Complex Social Graphs via Knowledge-Graph Embeddings and Convolutional Neural Network","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Social network (sociolinguistics); Classifier (UML); Machine learning; Graph; Node (physics); Social network analysis; Embedding; Theoretical computer science; World Wide Web","score_opus":0.032333963428220786,"score_gpt":0.2701564825082692,"score_spread":0.2378225190800484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036233147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1989538,0.0015546227,0.7902243,0.0011455518,0.00015362274,0.000113519345,0.0017038641,0.0014927652,0.004657952],"genre_scores_gemma":[0.84743696,0.0008810625,0.13980141,0.0002142702,0.0001627593,0.000087762295,0.0035089923,0.00016961535,0.007737233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964595,0.00008330541,0.000017349765,0.00014614488,0.000060426482,0.00004673776],"domain_scores_gemma":[0.998445,0.0009731789,0.0001685704,0.00017118419,0.00016069476,0.00008141968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061079516,0.0007901889,0.0007552617,0.0016226332,0.00042462122,0.0012473441,0.001260176,0.0013406388,0.0017660687],"category_scores_gemma":[0.0033072913,0.00043468253,0.0007487561,0.0016282628,0.0005473812,0.0034484086,0.0010028277,0.0014475405,0.00077879924],"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.0004018438,0.00041891038,0.013519765,0.00037406734,0.00021547622,0.00024629926,0.00033869408,0.45823556,0.0059590978,0.037768673,0.0182816,0.46424004],"study_design_scores_gemma":[0.0000027860538,0.000008750782,0.00046610614,0.000010307166,0.0000085179945,0.000013395141,0.000022577507,0.980788,0.0004288283,0.017819425,0.0004275793,0.0000036788854],"about_ca_topic_score_codex":0.007866257,"about_ca_topic_score_gemma":0.01371761,"teacher_disagreement_score":0.007866257,"about_ca_system_score_codex":0.0011172801,"about_ca_system_score_gemma":0.00047163517,"threshold_uncertainty_score":0.015640974},"labels":[],"label_agreement":null},{"id":"W3036300525","doi":"10.1007/978-3-030-50347-5_20","title":"Deep Learning for Partial Fingerprint Inpainting and Recognition","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Inpainting; Fingerprint (computing); Artificial intelligence; Computer science; Pattern recognition (psychology); Deep learning; Computer vision; Image (mathematics)","score_opus":0.033280241797872326,"score_gpt":0.25262300029936824,"score_spread":0.21934275850149593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036300525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006847046,0.0017187519,0.986571,0.00013948244,0.00009991946,0.00002023562,0.0001996251,0.0011138452,0.0032900893],"genre_scores_gemma":[0.23499027,0.0039384654,0.706323,0.0003801787,0.00020413529,0.000102268605,0.0012250278,0.0004232529,0.052413404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987864,0.000011918589,0.000006001221,0.0000312266,0.000050121358,0.000022197335],"domain_scores_gemma":[0.9998323,0.000059619855,0.000014022991,0.000042675245,0.00004162708,0.000009735162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025957293,0.0006601964,0.0005171391,0.0003444944,0.00013474315,0.00048198356,0.0008567835,0.00070655067,0.007810692],"category_scores_gemma":[0.0005277457,0.00034326088,0.00046407917,0.0005004389,0.0002929966,0.00074884674,0.0007378201,0.0011458095,0.0017634874],"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.00006574444,0.000057234924,0.00019720069,0.0001631932,0.000045707708,0.0000430911,0.000026884682,0.079523,0.037325323,0.00896596,0.008748897,0.86483765],"study_design_scores_gemma":[0.0000049651658,0.00005904628,0.0003533417,0.000027254375,0.000019883519,0.000087959575,0.000007699364,0.95774347,0.024352465,0.007858612,0.009474224,0.000011163816],"about_ca_topic_score_codex":0.0022173084,"about_ca_topic_score_gemma":0.0047221216,"teacher_disagreement_score":0.007810692,"about_ca_system_score_codex":0.00042954902,"about_ca_system_score_gemma":0.00035968007,"threshold_uncertainty_score":0.026129305},"labels":[],"label_agreement":null},{"id":"W3036303882","doi":"10.1007/978-3-030-50347-5_22","title":"Combining Asynchronous Events and Traditional Frames for Steering Angle Prediction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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":"Université de Moncton","funders":"","keywords":"Computer science; Artificial intelligence; Asynchronous communication; Convolutional neural network; Deep learning; Event (particle physics); Artificial neural network; Computer vision; Path (computing); Curvature; Trajectory; State (computer science); Real-time computing; Algorithm","score_opus":0.014410080159468635,"score_gpt":0.19937585790642007,"score_spread":0.18496577774695144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036303882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073726326,0.00018723692,0.990551,0.000026057085,0.000120746256,0.00001948164,0.000112822774,0.00060116197,0.0010088992],"genre_scores_gemma":[0.52209395,0.00077632454,0.4702231,0.0000992376,0.000421127,0.00011155957,0.0009914075,0.0003572396,0.0049260925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946755,0.00008063562,0.000025607073,0.0001911854,0.00017732606,0.00005769086],"domain_scores_gemma":[0.9991586,0.00037500277,0.00006028326,0.00016980364,0.00018978062,0.000046624362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006683892,0.0013331242,0.0010525173,0.0010633224,0.00040523446,0.0011346228,0.0013085266,0.00057203736,0.0028372651],"category_scores_gemma":[0.0021141819,0.00046275376,0.00045758756,0.0012270726,0.0003565472,0.0016781386,0.0010167888,0.0010792321,0.0010653377],"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.00077350275,0.00023411418,0.002077315,0.00015132567,0.000085997104,0.0001334748,0.00010322605,0.18482724,0.02411282,0.016712984,0.0049394225,0.76584864],"study_design_scores_gemma":[0.000018703564,0.000057436206,0.00044032236,0.000011979212,0.00002864219,0.000024473764,0.000013695911,0.98429245,0.005209009,0.007960536,0.0019291483,0.000013463119],"about_ca_topic_score_codex":0.004272809,"about_ca_topic_score_gemma":0.0065665045,"teacher_disagreement_score":0.004272809,"about_ca_system_score_codex":0.0003034611,"about_ca_system_score_gemma":0.00044575793,"threshold_uncertainty_score":0.009491622},"labels":[],"label_agreement":null},{"id":"W3036411632","doi":"10.1007/978-3-030-50347-5_26","title":"Detecting Defects in Materials Using Deep Convolutional Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Discriminative model; Preprocessor; Mutual information; Convolutional neural network; Artificial intelligence; Entropy (arrow of time); Architecture; Pattern recognition (psychology); Filter (signal processing); Data mining; Machine learning; Computer vision","score_opus":0.02588918408818469,"score_gpt":0.2311149405400483,"score_spread":0.2052257564518636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036411632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17748733,0.0037046075,0.8056542,0.00030793808,0.00020506889,0.00006948776,0.0007320657,0.005271715,0.006567629],"genre_scores_gemma":[0.76685274,0.0017495797,0.22025888,0.00016086594,0.00006909863,0.000035105288,0.0010154289,0.00022621633,0.009632173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987423,0.000008987185,0.0000054021034,0.00003156871,0.000060015358,0.0000197662],"domain_scores_gemma":[0.99969864,0.00012372455,0.00006464961,0.000028226847,0.000071154944,0.000013720661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002462716,0.0009788148,0.0005748886,0.0010766294,0.00014698372,0.00083674514,0.00091044116,0.00090516615,0.0014214762],"category_scores_gemma":[0.00061289273,0.00056814443,0.000651429,0.0005744187,0.00028674418,0.0009823579,0.0005021775,0.0005953012,0.0005972266],"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.00037879738,0.00016849373,0.005081051,0.00047788833,0.00013134738,0.00041634528,0.000070609036,0.3266989,0.13453323,0.0037392613,0.0055815238,0.52272254],"study_design_scores_gemma":[0.00000503605,0.000037225218,0.0010898049,0.000019801297,0.000019045156,0.0000853071,0.000014566654,0.9753795,0.019831315,0.0024350868,0.0010729966,0.000010365995],"about_ca_topic_score_codex":0.0030179878,"about_ca_topic_score_gemma":0.0053157946,"teacher_disagreement_score":0.0030179878,"about_ca_system_score_codex":0.0006488845,"about_ca_system_score_gemma":0.00033451483,"threshold_uncertainty_score":0.0060008764},"labels":[],"label_agreement":null},{"id":"W3036421826","doi":"10.1007/978-3-030-50433-5_27","title":"Microtubule Biomechanics and the Effect of Degradation of Elastic Moduli","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Mechanics and Interactions","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":"Wilfrid Laurier University","funders":"","keywords":"Microtubule; Materials science; Nanoindentation; Degradation (telecommunications); Elastic modulus; Displacement (psychology); Mechanics; Modulus; Composite material; Structural engineering; Physics; Engineering; Electronic engineering","score_opus":0.0058695971008626184,"score_gpt":0.21495003480035457,"score_spread":0.20908043769949194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036421826","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.94613713,0.018294077,0.009111267,0.0008166566,0.0002627792,0.000017602073,0.00036063517,0.00024710156,0.024752775],"genre_scores_gemma":[0.9874033,0.0037905339,0.0010900743,0.00007065608,0.000037550613,0.000008299679,0.00008803343,0.000058393118,0.007453182],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991834,0.00001180679,0.0000048638954,0.000019818903,0.00002683196,0.000018368792],"domain_scores_gemma":[0.99957186,0.00025999092,0.00006494363,0.00003823702,0.000026459,0.000038561368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002543583,0.0002286662,0.00021282342,0.00025967567,0.00019614393,0.0005925879,0.000332383,0.00056468253,0.00531186],"category_scores_gemma":[0.0009116121,0.00021354969,0.0002512802,0.00024553,0.00040379862,0.0006752512,0.00020844658,0.0004286258,0.0007750412],"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.0008998346,0.000071643226,0.0005072919,0.00016464801,0.000024577012,0.00035113038,0.00006011015,0.011674498,0.96136415,0.0054944973,0.00073776057,0.018649839],"study_design_scores_gemma":[0.00010196411,0.00067235413,0.031193985,0.000062880485,0.000070656235,0.001431545,0.00013149875,0.059822842,0.8817396,0.013836986,0.010838203,0.00009741832],"about_ca_topic_score_codex":0.00032739478,"about_ca_topic_score_gemma":0.0003023781,"teacher_disagreement_score":0.00531186,"about_ca_system_score_codex":0.00022575984,"about_ca_system_score_gemma":0.000100673766,"threshold_uncertainty_score":0.017769873},"labels":[],"label_agreement":null},{"id":"W3036469117","doi":"10.1007/978-3-030-51310-8_21","title":"Towards Explainability in Using Deep Learning for the Detection of Anorexia in Social Media","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Anorexia; Artificial intelligence; Human–computer interaction; Multimedia; Medicine","score_opus":0.04121807602272296,"score_gpt":0.27194564052209813,"score_spread":0.23072756449937518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036469117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24234627,0.0035961696,0.7409752,0.0038645307,0.00032904488,0.00015176485,0.0016355081,0.0023873583,0.0047141057],"genre_scores_gemma":[0.88973045,0.001042265,0.10122736,0.00051881355,0.00043041885,0.00013826076,0.0025495992,0.00014247303,0.004220401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.0002779965,0.000031165066,0.00016880227,0.00007690189,0.00008520247],"domain_scores_gemma":[0.99534976,0.0037396927,0.00024806437,0.0002818561,0.0002563954,0.00012415413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019851623,0.00081149704,0.0005638177,0.0011051375,0.00031425006,0.0014982497,0.00085304363,0.001473896,0.0024836196],"category_scores_gemma":[0.0077150688,0.00035220265,0.00088635075,0.000645346,0.00050383795,0.0021468522,0.0014507164,0.0020653491,0.00074595545],"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.0011017347,0.0006802894,0.045905333,0.0004644025,0.0005370425,0.00043822516,0.0009915703,0.09426763,0.022906078,0.017768182,0.015501573,0.7994379],"study_design_scores_gemma":[0.000026376463,0.00011768121,0.008607811,0.000058170703,0.000072242045,0.00012418331,0.00011079085,0.9626081,0.0032109981,0.023086116,0.0019576338,0.000019848025],"about_ca_topic_score_codex":0.003020763,"about_ca_topic_score_gemma":0.0030798465,"teacher_disagreement_score":0.003020763,"about_ca_system_score_codex":0.00052398816,"about_ca_system_score_gemma":0.0005146347,"threshold_uncertainty_score":0.010498643},"labels":[],"label_agreement":null},{"id":"W3036488719","doi":"10.1007/978-3-030-50516-5_31","title":"Deep Retinal Diseases Detection and Explainability Using OCT Images","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Optical coherence tomography; Drusen; Convolutional neural network; Blindness; Retinal; Computer-aided diagnosis; Artificial intelligence; CAD; Retinal Disorder; Ophthalmology; Deep learning; Pattern recognition (psychology); Computer vision; Optometry; Medicine","score_opus":0.015757465076210665,"score_gpt":0.2712025578238605,"score_spread":0.2554450927476498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036488719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23693022,0.0037936124,0.741425,0.0011233559,0.00020248338,0.00013483441,0.0014794272,0.0021006577,0.012810526],"genre_scores_gemma":[0.75783336,0.003143986,0.22366671,0.0001745787,0.00019170318,0.00005130823,0.0015827285,0.00022935774,0.01312623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998766,0.00001978669,0.0000075471426,0.00003464925,0.000038421054,0.000023025224],"domain_scores_gemma":[0.9994192,0.00032225906,0.00008107849,0.00006172298,0.00008268724,0.000032982778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536597,0.00049529347,0.00025522948,0.0012742268,0.00012671782,0.00089245825,0.00032372554,0.00050954876,0.0040819026],"category_scores_gemma":[0.0011776788,0.00017857719,0.00059085037,0.0005242897,0.00027609157,0.0009668597,0.00040328928,0.00052946585,0.00068504136],"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.0003851766,0.0001000549,0.009921877,0.00024088142,0.00007637837,0.0006889706,0.00017245748,0.014232969,0.10238113,0.008730491,0.006994975,0.8560747],"study_design_scores_gemma":[0.000034031582,0.0003009448,0.04996755,0.0001494612,0.00019228991,0.0026555844,0.0003461367,0.79411346,0.099164635,0.036803745,0.016201379,0.00007080626],"about_ca_topic_score_codex":0.0011172917,"about_ca_topic_score_gemma":0.0014008445,"teacher_disagreement_score":0.0040819026,"about_ca_system_score_codex":0.00026808024,"about_ca_system_score_gemma":0.00019762057,"threshold_uncertainty_score":0.013655305},"labels":[],"label_agreement":null},{"id":"W3036537095","doi":"10.1007/978-3-030-50516-5_18","title":"Enhancing the Prediction of Lung Cancer Survival Rates Using 2D Features from 3D Scans","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Carleton University","funders":"","keywords":"Computer science; Lung cancer; Artificial intelligence; Oncology; Medicine","score_opus":0.01874421086188993,"score_gpt":0.29953462889484733,"score_spread":0.2807904180329574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036537095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34722623,0.0042384085,0.63541496,0.00048125393,0.00025134668,0.000095469244,0.002885822,0.004797756,0.004608805],"genre_scores_gemma":[0.7772633,0.0021357336,0.21184678,0.00016932473,0.00018587286,0.0000752868,0.0028761467,0.0002704179,0.005177072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984574,0.000020685033,0.000007995733,0.00003684033,0.00006864888,0.000020069434],"domain_scores_gemma":[0.99953675,0.000276826,0.000044804256,0.000037600414,0.00008824707,0.000015795715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036940878,0.00067824963,0.0005805024,0.0010957563,0.000107288266,0.0007492554,0.00045415008,0.00070340745,0.0014930214],"category_scores_gemma":[0.0013360318,0.0003351018,0.0007897094,0.0006852004,0.00013935541,0.00043257806,0.00045191761,0.00041947313,0.0012746492],"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.0003243519,0.00014952228,0.018069856,0.00016215252,0.000119505276,0.00026266417,0.0000569564,0.07838959,0.0729845,0.0005452661,0.005492802,0.8234428],"study_design_scores_gemma":[0.000013797666,0.00015692951,0.022438431,0.000030580006,0.00011431758,0.0007714105,0.000033778488,0.94197917,0.030549709,0.001286782,0.0025762713,0.000048901955],"about_ca_topic_score_codex":0.002623474,"about_ca_topic_score_gemma":0.004253672,"teacher_disagreement_score":0.002623474,"about_ca_system_score_codex":0.00018586619,"about_ca_system_score_gemma":0.00021442866,"threshold_uncertainty_score":0.0052164793},"labels":[],"label_agreement":null},{"id":"W3036778324","doi":"10.1007/978-3-030-50516-5_13","title":"Anomaly Detection for Images Using Auto-encoder Based Sparse Representation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anomaly detection; Pattern recognition (psychology); Artificial intelligence; Sparse approximation; Encoding (memory); Representation (politics); Encoder; Autoencoder; Anomaly (physics); Computer vision; Deep learning","score_opus":0.03831875270723427,"score_gpt":0.2887622803448364,"score_spread":0.25044352763760214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036778324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01981022,0.00030982413,0.97764516,0.00012610227,0.000069864465,0.00002448342,0.00014423653,0.0012851654,0.0005849335],"genre_scores_gemma":[0.31689063,0.0007422546,0.6768985,0.00012482725,0.00013334455,0.000061019724,0.0011103175,0.00022418155,0.003814952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.000044511824,0.000018451812,0.00008813282,0.00020103474,0.00005332883],"domain_scores_gemma":[0.9993199,0.00021856415,0.00008339085,0.00011598558,0.0002334391,0.000028697086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036999927,0.0006334816,0.0008530616,0.0011321229,0.00021528949,0.00060833007,0.000836606,0.00072773686,0.0011439993],"category_scores_gemma":[0.0014281784,0.00029523004,0.00059607736,0.0011502266,0.000341957,0.0009795802,0.00073197234,0.0011859196,0.00069026346],"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.00027185693,0.00013956185,0.0017611029,0.00011733247,0.00006992238,0.0001872191,0.000057670928,0.05591419,0.099673375,0.005903278,0.005400239,0.83050424],"study_design_scores_gemma":[0.0000048328056,0.000051489103,0.0007664235,0.0000062690506,0.000016081756,0.0002265458,0.000011595057,0.9766092,0.018318009,0.0029738047,0.0010062966,0.000009462418],"about_ca_topic_score_codex":0.0022484814,"about_ca_topic_score_gemma":0.0032815086,"teacher_disagreement_score":0.0022484814,"about_ca_system_score_codex":0.0003944498,"about_ca_system_score_gemma":0.0004915726,"threshold_uncertainty_score":0.0044707656},"labels":[],"label_agreement":null},{"id":"W3036840050","doi":"10.1007/978-3-030-50347-5_29","title":"Generalized Subspace Learning by Roweis Discriminant Analysis","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Subspace topology; Linear discriminant analysis; Artificial intelligence; Discriminant; Pattern recognition (psychology); Optimal discriminant analysis","score_opus":0.016382545383615398,"score_gpt":0.24170796227140673,"score_spread":0.22532541688779134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036840050","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.0039822734,0.0006988761,0.99154776,0.000088894805,0.000118894735,0.000016617676,0.00007176095,0.00064594834,0.0028289992],"genre_scores_gemma":[0.10351988,0.0015203182,0.87077254,0.00016233299,0.00018049862,0.000092344366,0.00074626255,0.0004591025,0.022546832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995882,0.00013034076,0.000017383192,0.00008595139,0.00014932401,0.000028781049],"domain_scores_gemma":[0.99975425,0.00006278662,0.000015820246,0.00007485699,0.00007774806,0.000014564234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004791248,0.00071712537,0.00081454514,0.00068855257,0.0002986185,0.0007501453,0.0006912671,0.00044341118,0.0057297274],"category_scores_gemma":[0.00092598726,0.00028357902,0.00062198355,0.001278448,0.0005168203,0.0011239917,0.0011899361,0.0010565383,0.004797015],"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.00009017828,0.00005022706,0.00024282512,0.00015478978,0.00007103614,0.00003624035,0.000045927147,0.03670836,0.024864312,0.053731814,0.016034981,0.8679693],"study_design_scores_gemma":[0.00001777122,0.00008902074,0.0007774975,0.00003146651,0.00003721164,0.00026376176,0.000046312183,0.87866414,0.018003242,0.06538093,0.036634035,0.000054643922],"about_ca_topic_score_codex":0.00072005397,"about_ca_topic_score_gemma":0.0011094486,"teacher_disagreement_score":0.0057297274,"about_ca_system_score_codex":0.00018853319,"about_ca_system_score_gemma":0.00043808043,"threshold_uncertainty_score":0.0191679},"labels":[],"label_agreement":null},{"id":"W3036842410","doi":"10.1007/978-3-030-50371-0_29","title":"Modelling the Effects of Antibiotics on Gut Flora Using a Nonlinear Compartment Model with Uncertain Parameters","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gut microbiota and health","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph","funders":"","keywords":"Gut flora; Nonlinear system; Computer science; Biological system; Microbial population biology; Antibiotics; Biology; Microbiology; Immunology; Bacteria; Physics","score_opus":0.028000946564828377,"score_gpt":0.2634383950333251,"score_spread":0.23543744846849674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036842410","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.12614435,0.0031039445,0.8539395,0.00083890697,0.00020341716,0.00006832903,0.00083656335,0.0004899706,0.01437502],"genre_scores_gemma":[0.9346168,0.0025183647,0.027873363,0.00016464374,0.00007854095,0.00021289219,0.0004674115,0.00011519148,0.03395283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.00005154758,0.000011369707,0.00006572484,0.000035063305,0.00003112388],"domain_scores_gemma":[0.99941194,0.00041667384,0.00008348629,0.000017235241,0.000054009324,0.00001664708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374099,0.0009977977,0.001090711,0.00028637424,0.0002833955,0.0013075423,0.001240998,0.002152655,0.0022789314],"category_scores_gemma":[0.0014953086,0.00068168447,0.0012665819,0.00041532706,0.0006423401,0.0010820471,0.00088787643,0.0010816436,0.00052330334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004369452,0.000010192785,0.00032936857,0.000073758674,0.000031023672,0.000052661893,0.00003503678,0.99029833,0.0026355253,0.0039026556,0.0001413141,0.0024463842],"study_design_scores_gemma":[0.0000053113495,0.000021837861,0.00016893484,0.0000064776577,0.000020808917,0.000020259571,0.0000068361473,0.9969849,0.00051925296,0.0018534869,0.00038259683,0.000009286377],"about_ca_topic_score_codex":0.013648052,"about_ca_topic_score_gemma":0.0072582345,"teacher_disagreement_score":0.013648052,"about_ca_system_score_codex":0.0009455001,"about_ca_system_score_gemma":0.0008461342,"threshold_uncertainty_score":0.02713722},"labels":[],"label_agreement":null},{"id":"W3036862134","doi":"10.1007/978-3-030-51310-8_13","title":"Analysis and Multilabel Classification of Quebec Court Decisions in the Domain of Housing Law","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Law","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Research Unit on Children's Psychosocial Maladjustment; Concordia University; Université de Montréal","funders":"","keywords":"Landlord; Renting; Computer science; Perspective (graphical); Autonomy; Tribunal; Jurisdiction; Law; Domain (mathematical analysis); Order (exchange); Operations research; Artificial intelligence; Business; Political science; Mathematics; Finance","score_opus":0.06097037605028883,"score_gpt":0.3376735901695853,"score_spread":0.2767032141192965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036862134","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.84119487,0.003711612,0.11629313,0.0041473047,0.0002115348,0.00026366336,0.009259958,0.0010828816,0.023835145],"genre_scores_gemma":[0.9469073,0.00038432886,0.029297654,0.00024183672,0.00010592757,0.00007767444,0.009832599,0.00009558713,0.01305724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984994,0.0005684762,0.000068535395,0.00022401642,0.00032223802,0.00031734418],"domain_scores_gemma":[0.9945334,0.0036088394,0.00027711337,0.00027626872,0.0011163453,0.00018803398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019839494,0.0006278184,0.00062918355,0.0031770954,0.0017711435,0.0025511987,0.0013688365,0.001101535,0.0047714664],"category_scores_gemma":[0.00784396,0.00020286856,0.0006229963,0.0026590633,0.00085690845,0.0013471968,0.00082091993,0.0016070366,0.0007520449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010882362,0.0007316573,0.09983267,0.00041447,0.0003161558,0.0007803191,0.0017014544,0.20348004,0.0040832707,0.052660555,0.095404156,0.5395071],"study_design_scores_gemma":[0.000022752703,0.00003428208,0.02518185,0.000058325903,0.000044296157,0.00006811294,0.0009903137,0.94175595,0.0011526805,0.023192221,0.0074729533,0.00002634064],"about_ca_topic_score_codex":0.5310226,"about_ca_topic_score_gemma":0.74528015,"teacher_disagreement_score":0.4689774,"about_ca_system_score_codex":0.0069258492,"about_ca_system_score_gemma":0.004608065,"threshold_uncertainty_score":0.9434786},"labels":[],"label_agreement":null},{"id":"W3036864681","doi":"10.1007/978-3-030-50347-5_6","title":"4K or Not? - Automatic Image Resolution Assessment","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Ground truth; Feature (linguistics); Resolution (logic); Computer vision; Image quality; Popularity; Enhanced Data Rates for GSM Evolution; High resolution; Image (mathematics); Computer graphics (images); Remote sensing","score_opus":0.023779425741770343,"score_gpt":0.30771856394440034,"score_spread":0.28393913820263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036864681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110643364,0.0054548923,0.54579085,0.004297251,0.002230986,0.00070301985,0.0071333093,0.03124728,0.2924991],"genre_scores_gemma":[0.41100088,0.0019774262,0.41371435,0.0011079431,0.00031586108,0.00020336792,0.0067161936,0.0034452362,0.16151874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925023,0.00009934197,0.000037958733,0.00009971538,0.00043308892,0.00007956329],"domain_scores_gemma":[0.99904794,0.00015198339,0.00005258635,0.00013039871,0.00056943676,0.000047595877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008274588,0.0006244015,0.00047191355,0.0010661545,0.0004561367,0.0018268096,0.0007996617,0.00097220484,0.04403288],"category_scores_gemma":[0.0032295128,0.00023680342,0.00040452214,0.0006480483,0.00033065895,0.0019586997,0.0009939361,0.0005817971,0.022981144],"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.0006098768,0.00007119504,0.0029090296,0.00043231732,0.000039305978,0.00027505326,0.000100858866,0.0030558822,0.053326264,0.007071043,0.047330383,0.8847787],"study_design_scores_gemma":[0.00012674861,0.00066284277,0.03737042,0.00076866546,0.00020914819,0.0050065336,0.0009458814,0.23843652,0.35144535,0.037711896,0.3270077,0.00030836108],"about_ca_topic_score_codex":0.0010881315,"about_ca_topic_score_gemma":0.0015040961,"teacher_disagreement_score":0.04403288,"about_ca_system_score_codex":0.00045454683,"about_ca_system_score_gemma":0.00037965956,"threshold_uncertainty_score":0.14730465},"labels":[],"label_agreement":null},{"id":"W3036873463","doi":"10.1007/978-3-030-50420-5_29","title":"An Empirical Evaluation of Attention and Pointer Networks for Paraphrase Generation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Concordia University","funders":"","keywords":"Paraphrase; Computer science; Pointer (user interface); Machine translation; Artificial intelligence; Natural language processing; Sequence (biology); Artificial neural network; Similarity (geometry); Image (mathematics)","score_opus":0.04518612985403888,"score_gpt":0.3375778526078879,"score_spread":0.29239172275384906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036873463","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.93505204,0.005590931,0.03501914,0.00077628606,0.00023885128,0.00096600904,0.0037827878,0.0038171657,0.014756805],"genre_scores_gemma":[0.9596015,0.0008129361,0.029042676,0.00015028445,0.00013046445,0.0003572969,0.0059276163,0.00035788244,0.003619407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933476,0.004222411,0.00047363498,0.0008730472,0.0009271028,0.00015623063],"domain_scores_gemma":[0.84820503,0.13717198,0.0031505183,0.005940594,0.0043393187,0.001192547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008932009,0.0012827775,0.0007643171,0.0026814116,0.00072934903,0.001976374,0.0024550075,0.0019574054,0.008991842],"category_scores_gemma":[0.08430547,0.0004929923,0.00056263723,0.0019675724,0.0008174595,0.0056439796,0.0021567456,0.0017334156,0.00222116],"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.0139813535,0.0062500667,0.03654167,0.0030954685,0.00083171064,0.00045540964,0.0015820897,0.051238537,0.014457632,0.00397809,0.01578378,0.8518042],"study_design_scores_gemma":[0.0024977876,0.008096129,0.05267587,0.00044533104,0.0014317252,0.0011409054,0.0015579042,0.884675,0.025212962,0.012138548,0.009983112,0.00014475475],"about_ca_topic_score_codex":0.0051175975,"about_ca_topic_score_gemma":0.0047360724,"teacher_disagreement_score":0.008991842,"about_ca_system_score_codex":0.0012049554,"about_ca_system_score_gemma":0.0008347506,"threshold_uncertainty_score":0.047237515},"labels":[],"label_agreement":null},{"id":"W3036940989","doi":"10.1007/978-3-030-50436-6_17","title":"Simulation Based Exploration of Bacterial Cross Talk Between Spatially Separated Colonies in a Multispecies Biofilm Community","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Slime Mold and Myxomycetes Research","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":"University of Guelph","funders":"","keywords":"Mesoscopic physics; Biofilm; Integrator; Biological system; SIGNAL (programming language); Diffusion; Computer science; Singularity; Degeneracy (biology); Statistical physics; Physics; Mathematical analysis; Mathematics; Bacteria; Biology","score_opus":0.05994443773233097,"score_gpt":0.305948412931742,"score_spread":0.24600397519941106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036940989","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.9643751,0.00030358153,0.02684215,0.00044148279,0.000044771103,0.00003252967,0.00023496579,0.00016962181,0.007555946],"genre_scores_gemma":[0.98898685,0.00011076886,0.008881522,0.0000658581,0.000017030117,0.000039169812,0.00013040064,0.000028153288,0.001740336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989855,0.000032880762,0.0000042293623,0.000021826827,0.000018473784,0.00002414084],"domain_scores_gemma":[0.99810237,0.0015780038,0.00007247365,0.000034162575,0.00006337695,0.00014961555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032875786,0.00045164544,0.0007351131,0.0006366773,0.0008716866,0.0010461705,0.0010295175,0.0019568643,0.0032746303],"category_scores_gemma":[0.0014516963,0.00060109183,0.0007803306,0.0006371919,0.00085142965,0.0008328414,0.0011671147,0.0007049856,0.00016827062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121804005,0.00007337113,0.0016019859,0.000033960147,0.00003224949,0.00011470111,0.00007370706,0.99249566,0.00220906,0.0014785065,0.00017824586,0.0015867135],"study_design_scores_gemma":[0.000009389147,0.000014620261,0.00018411137,0.0000017985707,0.0000023873338,0.0000067090386,0.0000146150605,0.9991642,0.00010845636,0.00045946622,0.000031209765,0.0000030116455],"about_ca_topic_score_codex":0.011202438,"about_ca_topic_score_gemma":0.0074952664,"teacher_disagreement_score":0.011202438,"about_ca_system_score_codex":0.0008052621,"about_ca_system_score_gemma":0.0007277795,"threshold_uncertainty_score":0.022274435},"labels":[],"label_agreement":null},{"id":"W3037271262","doi":"10.1007/978-3-030-51517-1_12","title":"Personalized and Contextualized Persuasion System for Older Adults’ Physical Activity Promoting","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Persuasion; Context (archaeology); Computer science; Internet privacy; Psychology; Gerontology; Applied psychology; Social psychology; Medicine","score_opus":0.02249249274067046,"score_gpt":0.2784977796855441,"score_spread":0.2560052869448737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037271262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14419983,0.0039919796,0.7512034,0.0008640465,0.0009353437,0.0010025055,0.0011064452,0.049537778,0.047158647],"genre_scores_gemma":[0.56508654,0.0011880281,0.3741703,0.0006176593,0.00021872552,0.00069520576,0.0017746302,0.000600086,0.055648852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998436,0.000035589743,0.000014785375,0.000048230217,0.000040622166,0.000017114833],"domain_scores_gemma":[0.99974245,0.00012589076,0.0000121421945,0.000028576631,0.00006549739,0.00002532483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036766386,0.0005830419,0.00037593284,0.00044750908,0.00029074875,0.000756819,0.0007144293,0.000882939,0.009780869],"category_scores_gemma":[0.00080836477,0.0001517729,0.0003910506,0.00018047917,0.00014662214,0.00064656674,0.0005407878,0.00056076446,0.0020951221],"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.0012967798,0.0014416149,0.0029565745,0.0014060575,0.00016501083,0.0017188146,0.0029373472,0.0074879993,0.15716116,0.012425014,0.04826479,0.76273876],"study_design_scores_gemma":[0.0008169232,0.0034847627,0.020576255,0.0005703016,0.0010460521,0.0048843143,0.001660867,0.3473985,0.17692879,0.02510621,0.41711533,0.00041173375],"about_ca_topic_score_codex":0.0006096256,"about_ca_topic_score_gemma":0.0005861081,"teacher_disagreement_score":0.009780869,"about_ca_system_score_codex":0.00017546059,"about_ca_system_score_gemma":0.00027232227,"threshold_uncertainty_score":0.03272021},"labels":[],"label_agreement":null},{"id":"W3037302787","doi":"10.1007/978-3-030-51466-2_25","title":"Theoretical and Implementational Aspects of the Formal Language Server (LaSer)","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Saint Mary's University","funders":"","keywords":"Computer science; Prefix; Formal language; Programming language; Theoretical computer science; Linguistics","score_opus":0.008618757042745477,"score_gpt":0.24822439231726856,"score_spread":0.23960563527452308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037302787","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.009379446,0.0005194908,0.9300742,0.0027728234,0.0002418985,0.00004978679,0.00012740884,0.0019037175,0.054931186],"genre_scores_gemma":[0.50591296,0.0010941634,0.43009478,0.0010862275,0.0005462025,0.00041620637,0.00040779123,0.0016895887,0.058751967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988158,0.00038729023,0.00007100362,0.00014963727,0.0004090717,0.00016719836],"domain_scores_gemma":[0.9982857,0.0010755644,0.000064108404,0.00034332107,0.00017687383,0.00005441993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018097123,0.00062250963,0.0004090066,0.000637153,0.001366764,0.0049695233,0.0022015614,0.0016587614,0.012295289],"category_scores_gemma":[0.0044816164,0.0010824085,0.0008799797,0.0009716095,0.005993417,0.009084852,0.0017624586,0.003868656,0.0039487304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010454698,0.000010844079,0.00003145922,0.000019700241,0.0000016345307,0.000022931185,0.000135938,0.001658335,0.0005762417,0.98902965,0.0013391264,0.007163744],"study_design_scores_gemma":[0.000012869745,0.000011984349,0.00003084843,0.000016038544,0.000004539836,0.00008513204,0.00005317691,0.020176666,0.0018132937,0.96156067,0.016222296,0.00001235188],"about_ca_topic_score_codex":0.0019110717,"about_ca_topic_score_gemma":0.001384645,"teacher_disagreement_score":0.012295289,"about_ca_system_score_codex":0.0018917324,"about_ca_system_score_gemma":0.0017208282,"threshold_uncertainty_score":0.041131794},"labels":[],"label_agreement":null},{"id":"W3037464880","doi":"10.1007/978-3-030-50516-5_2","title":"Backprojection for Training Feedforward Neural Networks in the Input and Feature Spaces","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backpropagation; Computer science; Artificial neural network; Feedforward neural network; Feature (linguistics); Artificial intelligence; Projection (relational algebra); Kernel (algebra); Feed forward; Perspective (graphical); Pattern recognition (psychology); Training (meteorology); Time delay neural network; Layer (electronics); Algorithm; Generalization; Rprop; Training set; Types of artificial neural networks; Mathematics","score_opus":0.030173577112763826,"score_gpt":0.2565689401822738,"score_spread":0.22639536306950994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037464880","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.001155622,0.0013289633,0.9944891,0.00006280314,0.00012740455,0.000022313212,0.00009296976,0.0008133973,0.001907423],"genre_scores_gemma":[0.036259856,0.0024976195,0.94215065,0.00008949071,0.00015005624,0.00029680663,0.00069609884,0.00058042794,0.017279008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946207,0.0001581358,0.000049130416,0.00009200425,0.00020828626,0.000030449759],"domain_scores_gemma":[0.99935395,0.00038126705,0.00002477318,0.00009605871,0.00012969392,0.000014201249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088102336,0.0017737055,0.0011304542,0.00044987368,0.0003066536,0.00093556714,0.0013228485,0.0013528533,0.010708579],"category_scores_gemma":[0.0030027553,0.0008050316,0.00083257194,0.0014003409,0.0007105864,0.001659583,0.0010003853,0.0025393327,0.00546388],"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.00013257244,0.000079455625,0.00021450526,0.00074749615,0.00011196302,0.00018387457,0.00010323807,0.15941654,0.009627386,0.03732244,0.017576585,0.774484],"study_design_scores_gemma":[0.000028336222,0.000086471504,0.00024137595,0.00009351056,0.000035524234,0.00016960989,0.00001798369,0.93709844,0.008733184,0.038029265,0.015441449,0.000024928624],"about_ca_topic_score_codex":0.0021530953,"about_ca_topic_score_gemma":0.0034395289,"teacher_disagreement_score":0.010708579,"about_ca_system_score_codex":0.0003676297,"about_ca_system_score_gemma":0.0005216457,"threshold_uncertainty_score":0.035823762},"labels":[],"label_agreement":null},{"id":"W3037796656","doi":"10.1007/978-3-030-51517-1_31","title":"Machine Learning Classification Models with SPD/ED Dataset: Comparative Study of Abstract Versus Full Article Approach","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Artificial intelligence; Boosting (machine learning); Machine learning; Support vector machine; Decision tree; Gradient boosting; Random forest; Precision and recall; Context (archaeology); Recall","score_opus":0.08655538543899494,"score_gpt":0.2932814416779184,"score_spread":0.20672605623892348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037796656","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.6964497,0.021417152,0.029991306,0.0039456496,0.0022519638,0.00092377135,0.21443444,0.012975018,0.01761102],"genre_scores_gemma":[0.37456438,0.0045736656,0.09151069,0.00061664626,0.00060692866,0.00054157083,0.5193835,0.00040204942,0.007800572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655485,0.0008843585,0.00052836095,0.00059953786,0.0012069271,0.00022595217],"domain_scores_gemma":[0.9913783,0.0041034403,0.00050297164,0.0016965698,0.0019441245,0.0003746031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004497274,0.0018889983,0.0018013761,0.007901989,0.00079768145,0.0023469622,0.0022726043,0.001720304,0.0033823135],"category_scores_gemma":[0.009341957,0.00027918085,0.0016583242,0.0058605303,0.0004769301,0.0027215625,0.0011629874,0.0015423101,0.0035945708],"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.0039051853,0.006224681,0.058945905,0.0041598636,0.0011424482,0.00092422945,0.00024053399,0.058080602,0.0056200484,0.002189207,0.26003736,0.59852993],"study_design_scores_gemma":[0.0009274848,0.0023493594,0.070297845,0.00056031375,0.00073494646,0.0017496777,0.0013693933,0.80000013,0.020694578,0.0046190256,0.09637091,0.0003264241],"about_ca_topic_score_codex":0.0126004955,"about_ca_topic_score_gemma":0.016057977,"teacher_disagreement_score":0.0126004955,"about_ca_system_score_codex":0.0014658239,"about_ca_system_score_gemma":0.0013226495,"threshold_uncertainty_score":0.025054276},"labels":[],"label_agreement":null},{"id":"W3038573609","doi":"10.1007/978-3-030-59716-0_48","title":"Semi-supervised Training of Optical Flow Convolutional Neural Networks in Ultrasound Elastography","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Concordia University","funders":"","keywords":"Computer science; Convolutional neural network; Optical flow; Artificial intelligence; Artificial neural network; Displacement (psychology); Elastography; Artifact (error); Deep learning; Pattern recognition (psychology); Ultrasound; Machine learning; Image (mathematics); Acoustics; Physics","score_opus":0.024548183636952065,"score_gpt":0.27319377759302105,"score_spread":0.24864559395606897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038573609","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.07456561,0.0008109117,0.92149734,0.00034719094,0.000077506054,0.00006523093,0.00018965974,0.0014552072,0.0009912633],"genre_scores_gemma":[0.7776529,0.0005537458,0.2146582,0.00022020395,0.000116982126,0.00017296028,0.00075917965,0.0002257157,0.005640104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995407,0.00017290517,0.000025721292,0.00012442663,0.00007114296,0.00006508024],"domain_scores_gemma":[0.99760914,0.0014630008,0.00019425532,0.00021354233,0.0004316225,0.00008855292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015825718,0.0008374945,0.0010167379,0.00057497685,0.00033930843,0.0007507685,0.0013124814,0.0016253291,0.001399893],"category_scores_gemma":[0.005086302,0.00077787694,0.0007200375,0.00048107913,0.0007069275,0.0010595073,0.001080096,0.0015309243,0.0005041574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038011826,0.00017229488,0.0014664785,0.00017282643,0.000085058455,0.00007624438,0.00008574986,0.6353851,0.014932068,0.0031392376,0.0029216646,0.34118313],"study_design_scores_gemma":[0.0000029469384,0.000014738374,0.00014656819,0.000004947398,0.0000032927023,0.00000910313,0.0000024739409,0.9976942,0.0014681447,0.00053937035,0.0001117652,0.0000024901292],"about_ca_topic_score_codex":0.0076792343,"about_ca_topic_score_gemma":0.009042835,"teacher_disagreement_score":0.0076792343,"about_ca_system_score_codex":0.0006473943,"about_ca_system_score_gemma":0.0014476398,"threshold_uncertainty_score":0.015269041},"labels":[],"label_agreement":null},{"id":"W3038610974","doi":"10.1007/978-3-030-51825-7_17","title":"Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.09338436767244732,"score_gpt":0.2992194355844736,"score_spread":0.2058350679120263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038610974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072412514,0.0015152693,0.92777485,0.0037239026,0.00024380375,0.000098994664,0.00019270762,0.0005807884,0.058628496],"genre_scores_gemma":[0.46494168,0.0031881237,0.4832825,0.0028339324,0.0015476523,0.00083665847,0.0011972396,0.0013093982,0.040862896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942238,0.0027597141,0.00035890407,0.0006477281,0.0015228371,0.00048708735],"domain_scores_gemma":[0.9833144,0.012555809,0.000587453,0.0023289812,0.0008613238,0.0003519945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005026837,0.0014257092,0.0015184698,0.0024880215,0.002088316,0.008158429,0.0060768714,0.003410658,0.012317372],"category_scores_gemma":[0.019320885,0.001787849,0.003135733,0.0029303632,0.009017539,0.01780675,0.00534958,0.011993397,0.0021089623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018139046,0.000012595142,0.000058938444,0.000056935827,0.000008541885,0.000027288763,0.0001293455,0.0070648678,0.00021109082,0.9861885,0.0014467421,0.0047770976],"study_design_scores_gemma":[0.00000767664,0.000007681685,0.000048383623,0.000024420215,0.000008795361,0.000025283927,0.000036650064,0.027880799,0.00028753103,0.96810883,0.003555422,0.000008375106],"about_ca_topic_score_codex":0.0023932504,"about_ca_topic_score_gemma":0.002532006,"teacher_disagreement_score":0.012317372,"about_ca_system_score_codex":0.0040176897,"about_ca_system_score_gemma":0.0019295675,"threshold_uncertainty_score":0.041205645},"labels":[],"label_agreement":null},{"id":"W3038898808","doi":"10.1007/978-3-030-52237-7_23","title":"A Data-Driven Student Model to Provide Adaptive Support During Video Watching Across MOOCs","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":28,"is_retracted":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":"Personalization; Adaptation (eye); Computer science; Multimedia; Human–computer interaction; World Wide Web; Psychology","score_opus":0.04213415900172179,"score_gpt":0.32131008796391913,"score_spread":0.27917592896219734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038898808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13436891,0.00036461526,0.853285,0.0016140175,0.00026440277,0.00033233222,0.00096135866,0.0027910564,0.00601831],"genre_scores_gemma":[0.93564945,0.00012322946,0.056544904,0.00023969209,0.00007143846,0.0002403284,0.00058347447,0.00009675417,0.006450841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993753,0.000142068,0.000034631477,0.00022407997,0.00010935741,0.00011450638],"domain_scores_gemma":[0.99783427,0.0010179183,0.00014079985,0.00015324634,0.0005941082,0.00025955407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016206708,0.00066190056,0.00076186727,0.00064041495,0.00037938583,0.001466916,0.0023525546,0.0015877292,0.0044903834],"category_scores_gemma":[0.0048439796,0.00035643132,0.0006054568,0.00062036526,0.0004010786,0.0015408428,0.0013615012,0.0015809987,0.0014327829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012817291,0.0013080275,0.010688279,0.00014768256,0.00017907993,0.00020007323,0.00036376796,0.7471866,0.0057675275,0.011057106,0.005979995,0.21584012],"study_design_scores_gemma":[0.000012117023,0.000045585915,0.00024439988,0.000004011157,0.0000125869565,0.00001063974,0.000014566105,0.99761957,0.00029816863,0.0014783316,0.0002549958,0.000004943142],"about_ca_topic_score_codex":0.008593761,"about_ca_topic_score_gemma":0.0090976795,"teacher_disagreement_score":0.008593761,"about_ca_system_score_codex":0.00093468104,"about_ca_system_score_gemma":0.0013001956,"threshold_uncertainty_score":0.01708752},"labels":[],"label_agreement":null},{"id":"W3039055707","doi":"10.1007/978-3-030-64556-4_26","title":"Offline Versus Online Triplet Mining Based on Extreme Distances of Histopathology Patches","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Data mining; Online and offline; Generalization; Proxy (statistics); Artificial intelligence; Machine learning; Mathematics","score_opus":0.06415590714013483,"score_gpt":0.2905021397773382,"score_spread":0.22634623263720335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039055707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47636208,0.002075814,0.50489765,0.0007684186,0.00043611688,0.00028945328,0.0027655447,0.0061818706,0.0062230276],"genre_scores_gemma":[0.8121545,0.00039977068,0.17668888,0.0002034335,0.00025969115,0.000090969974,0.00646876,0.00040942797,0.0033246207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984921,0.00022048056,0.000114695555,0.0005490132,0.00038871155,0.00023482078],"domain_scores_gemma":[0.9979235,0.00065023015,0.00023953436,0.00053604896,0.00045699958,0.00019360731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014650857,0.00083030376,0.0016905119,0.0022799596,0.00053782156,0.0016935428,0.0018857383,0.0013899774,0.0033639292],"category_scores_gemma":[0.0040511526,0.00031229111,0.0011222963,0.0019367085,0.00038486032,0.0014125387,0.0016631498,0.0009965266,0.0025055895],"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.0026197552,0.0008362204,0.035151526,0.00034111025,0.00037362942,0.0005170148,0.00018004379,0.0288124,0.0500159,0.0019355858,0.016344408,0.8628725],"study_design_scores_gemma":[0.00012761728,0.0007359197,0.025697934,0.0000717271,0.00024064335,0.002078653,0.00040080023,0.9347462,0.02113094,0.010097082,0.00462677,0.00004575787],"about_ca_topic_score_codex":0.0012744713,"about_ca_topic_score_gemma":0.002925598,"teacher_disagreement_score":0.0033639292,"about_ca_system_score_codex":0.00035870977,"about_ca_system_score_gemma":0.00070643827,"threshold_uncertainty_score":0.011253476},"labels":[],"label_agreement":null},{"id":"W3039068804","doi":"10.1007/978-3-030-52237-7_28","title":"SoundHunters: Increasing Learner Phonological Awareness in Plains Cree","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Education Methods and Practices","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phonological awareness; Linguistics; Psychology; Geography; Pedagogy; Philosophy; Literacy","score_opus":0.09082147571388292,"score_gpt":0.38548591406072746,"score_spread":0.2946644383468445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039068804","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94706506,0.0003828585,0.021898173,0.0004872634,0.000115118,0.0002762907,0.00043699177,0.0043417388,0.024996525],"genre_scores_gemma":[0.8006805,0.0009800411,0.07269364,0.00044615456,0.000059466623,0.00044173704,0.00096002466,0.00079778477,0.122940674],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998561,0.000018786377,0.000007039546,0.000044104163,0.000056100365,0.000017829805],"domain_scores_gemma":[0.99961567,0.000205843,0.000024630672,0.000047264803,0.000039349117,0.00006717901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034757736,0.00037569227,0.00029801016,0.00031373458,0.00023213375,0.00080056104,0.0010328075,0.0007160287,0.027261237],"category_scores_gemma":[0.0012130938,0.00017466253,0.00021587139,0.00014662046,0.00036330597,0.0011370818,0.0012507901,0.0006034793,0.003798575],"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.0029667486,0.006524447,0.003232794,0.0006883659,0.00006277582,0.00092922087,0.0076456005,0.0006030368,0.2271375,0.001742713,0.012700574,0.73576623],"study_design_scores_gemma":[0.0045233127,0.047514934,0.16754515,0.0010970396,0.0012981612,0.0067364355,0.019545658,0.025063146,0.47136477,0.01024657,0.24473575,0.0003290331],"about_ca_topic_score_codex":0.0016062106,"about_ca_topic_score_gemma":0.0029200674,"teacher_disagreement_score":0.027261237,"about_ca_system_score_codex":0.00011691444,"about_ca_system_score_gemma":0.00037167958,"threshold_uncertainty_score":0.09119791},"labels":[],"label_agreement":null},{"id":"W3039319660","doi":"10.1007/978-3-030-59716-0_45","title":"Ultra2Speech - A Deep Learning Framework for Formant Frequency Estimation and Tracking from Ultrasound Tongue Images","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Formant; Computer science; Vocal tract; Vowel; Speech recognition; Feature (linguistics); Artificial intelligence; Annotation; Deep learning; Pattern recognition (psychology); Computer vision","score_opus":0.018525410040085146,"score_gpt":0.2842986438698576,"score_spread":0.26577323382977247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039319660","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.009710122,0.00065673,0.9801342,0.00013194466,0.00013331728,0.000052565258,0.0008560886,0.007116853,0.0012081641],"genre_scores_gemma":[0.2003927,0.00088859,0.76806706,0.00043448806,0.00021192005,0.0003308926,0.0058642584,0.0013011659,0.022508917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.0000676955,0.000015663569,0.00010748748,0.00009085965,0.000056077242],"domain_scores_gemma":[0.9996138,0.00016480559,0.000022770462,0.00007239619,0.00009153352,0.000034704026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087702903,0.0011453999,0.0008970786,0.0005872096,0.00041074245,0.000974734,0.001886076,0.0017596303,0.008090335],"category_scores_gemma":[0.0013463387,0.0007123995,0.0009966082,0.0005357527,0.0003242287,0.0011107441,0.001942634,0.0018428067,0.0052520484],"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.0004830823,0.00021806122,0.00092027854,0.0001849638,0.0001784162,0.00017275779,0.00007307634,0.082241274,0.03654982,0.004723737,0.014928921,0.8593255],"study_design_scores_gemma":[0.0000188022,0.00006795281,0.00046986502,0.0000171948,0.00002037601,0.00006378063,0.000011149161,0.98297656,0.0099243345,0.0030854729,0.0033283548,0.00001614926],"about_ca_topic_score_codex":0.006239535,"about_ca_topic_score_gemma":0.013877606,"teacher_disagreement_score":0.008090335,"about_ca_system_score_codex":0.0004637438,"about_ca_system_score_gemma":0.00085506064,"threshold_uncertainty_score":0.02706492},"labels":[],"label_agreement":null},{"id":"W3039689985","doi":"10.1007/978-3-030-52237-7_17","title":"The Sound of Inattention: Predicting Mind Wandering with Automatically Derived Features of Instructor Speech","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mind wandering and attention","field":"Neuroscience","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":"Queen's University; University of Waterloo","funders":"","keywords":"Formant; Computer science; Jitter; Speech recognition; Vowel; Telecommunications","score_opus":0.02212036651863292,"score_gpt":0.2419807555148362,"score_spread":0.21986038899620328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039689985","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.93423975,0.0022899231,0.058022313,0.0001473629,0.00016962644,0.000035066943,0.0012116454,0.0009294066,0.0029549145],"genre_scores_gemma":[0.9665023,0.0008666429,0.027072709,0.000047499794,0.00013545532,0.000039908078,0.001501816,0.00009125264,0.0037422786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999243,0.00001706178,0.0000043299106,0.000022213784,0.000020092115,0.0000119872675],"domain_scores_gemma":[0.999358,0.0004992186,0.0000324984,0.000017622662,0.00005338495,0.000039236424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026305392,0.00047798097,0.00037247647,0.00067659974,0.0001335953,0.0004484376,0.00028848677,0.0004851625,0.0015117056],"category_scores_gemma":[0.001242647,0.00013805515,0.00029223415,0.00046310085,0.00009269678,0.00030184092,0.00029866805,0.00048338648,0.00088268536],"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.0012538258,0.0003938988,0.060087927,0.00015796222,0.00017964414,0.0004245537,0.00026014794,0.008781162,0.09311736,0.00023654122,0.0057900064,0.82931703],"study_design_scores_gemma":[0.00007281995,0.0008540884,0.40139455,0.000055638455,0.00031637563,0.0011452173,0.0002924491,0.5512578,0.040969726,0.0012437879,0.0023312555,0.0000663056],"about_ca_topic_score_codex":0.0024665312,"about_ca_topic_score_gemma":0.004412266,"teacher_disagreement_score":0.0024665312,"about_ca_system_score_codex":0.00011534466,"about_ca_system_score_gemma":0.00012976513,"threshold_uncertainty_score":0.0050570965},"labels":[],"label_agreement":null},{"id":"W3039702553","doi":"10.1007/978-3-030-51825-7_4","title":"Trail Saving on Backtrack","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Toronto","funders":"","keywords":"History; Computer science","score_opus":0.020114391603266862,"score_gpt":0.23654481545452494,"score_spread":0.21643042385125807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039702553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01717663,0.0013264947,0.5574289,0.0014991857,0.0030309507,0.00038413575,0.00512223,0.030064741,0.38396674],"genre_scores_gemma":[0.14808649,0.0012803592,0.40486437,0.0010120274,0.000422729,0.00038681537,0.008475676,0.013510856,0.42196074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999097,0.00008093232,0.000048173348,0.00019547826,0.00035006186,0.000228476],"domain_scores_gemma":[0.9983058,0.00035802834,0.000039099094,0.00087346433,0.0003384198,0.0000850963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005872303,0.0013704377,0.0012902073,0.0018686232,0.002202232,0.0033664575,0.0024387168,0.0011545292,0.14765133],"category_scores_gemma":[0.0029722108,0.0008626645,0.0013505279,0.003098785,0.0011345245,0.005478152,0.004109832,0.0024438147,0.039635535],"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.00072732934,0.0002161011,0.0002672696,0.00036241187,0.000039865594,0.0002494731,0.00025101862,0.009582203,0.0056794737,0.14841439,0.210208,0.6240024],"study_design_scores_gemma":[0.00016568745,0.00013771385,0.0003667372,0.00031053778,0.0001004514,0.00037807028,0.00033026736,0.06675567,0.01791362,0.56772214,0.34572458,0.0000945364],"about_ca_topic_score_codex":0.005681299,"about_ca_topic_score_gemma":0.010460771,"teacher_disagreement_score":0.14765133,"about_ca_system_score_codex":0.0009462743,"about_ca_system_score_gemma":0.0023207709,"threshold_uncertainty_score":0.49394292},"labels":[],"label_agreement":null},{"id":"W3039769181","doi":"10.1007/978-3-030-52240-7_56","title":"Scanpath Analysis of Student Attention During Problem Solving with Worked Examples","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Similarity (geometry); Eye tracking; Artificial intelligence; Image (mathematics)","score_opus":0.02200194963593399,"score_gpt":0.24272026318662593,"score_spread":0.22071831355069194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039769181","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.9654498,0.00027877686,0.023105927,0.000057016037,0.000041839805,0.00011290845,0.0020519765,0.0009289053,0.007972754],"genre_scores_gemma":[0.9836963,0.00015108958,0.00982824,0.000019643849,0.000010707937,0.00008782764,0.0012952527,0.00013595322,0.004775056],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997482,0.000053218388,0.0000136904155,0.000045816603,0.00010269634,0.00003631706],"domain_scores_gemma":[0.9966628,0.002181112,0.00019185431,0.00014140744,0.0006577939,0.00016498328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025174086,0.0002025506,0.00022377197,0.0016156051,0.00021072288,0.00033017603,0.0003533008,0.00022546492,0.007795415],"category_scores_gemma":[0.0036755984,0.00012385585,0.0001871059,0.0012788939,0.00013762261,0.00028775528,0.0004059432,0.00035236456,0.0010930555],"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.005566696,0.0004266561,0.16303353,0.00042946145,0.00017829945,0.0010792017,0.0021849908,0.005512454,0.103815414,0.0018721218,0.0075926543,0.7083085],"study_design_scores_gemma":[0.00010805464,0.0017471581,0.80568504,0.00009041711,0.00015480269,0.0017212458,0.0015638917,0.13527268,0.045172874,0.0019729326,0.0064522014,0.00005877497],"about_ca_topic_score_codex":0.007234051,"about_ca_topic_score_gemma":0.00745729,"teacher_disagreement_score":0.007795415,"about_ca_system_score_codex":0.00027770273,"about_ca_system_score_gemma":0.00047847963,"threshold_uncertainty_score":0.026078284},"labels":[],"label_agreement":null},{"id":"W3039795743","doi":"10.1007/978-3-030-59065-9_18","title":"Building a Competitive Associative Classifier","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Computer science; Artificial intelligence; Machine learning; Classifier (UML); Boosting (machine learning); Support vector machine; Associative property; Ensemble learning; Pruning; Random subspace method; Artificial neural network; Mathematics","score_opus":0.029867308262436644,"score_gpt":0.2990779282720294,"score_spread":0.2692106200095927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039795743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06195346,0.0006874821,0.9214003,0.00082982494,0.0005294902,0.00030503256,0.00045834368,0.004294555,0.009541527],"genre_scores_gemma":[0.48279253,0.00054993504,0.49012518,0.0009731516,0.00064797496,0.00046398735,0.0021195172,0.00035279215,0.021974972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978115,0.0002804624,0.00012043617,0.00050587335,0.0010170845,0.00026453956],"domain_scores_gemma":[0.9973793,0.00067260617,0.000068119014,0.00046663173,0.0012387851,0.000174608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020329673,0.0009013798,0.002060853,0.0019608308,0.00161288,0.002568706,0.0030449487,0.0032320896,0.0075469553],"category_scores_gemma":[0.0054023736,0.00072144176,0.0012827775,0.0015710202,0.0007222046,0.0028101893,0.0024829602,0.0019577192,0.008541278],"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.00047840463,0.0005808392,0.005186077,0.00018330372,0.00024634923,0.00044524754,0.00013631814,0.044085696,0.02594709,0.018604007,0.022488495,0.88161814],"study_design_scores_gemma":[0.00003736208,0.00019116754,0.0006114701,0.00002473881,0.00008716993,0.00031142775,0.00006237132,0.96321106,0.012824111,0.015517435,0.007096869,0.000024755733],"about_ca_topic_score_codex":0.0038364835,"about_ca_topic_score_gemma":0.005212732,"teacher_disagreement_score":0.0075469553,"about_ca_system_score_codex":0.00065495,"about_ca_system_score_gemma":0.0019170356,"threshold_uncertainty_score":0.025247097},"labels":[],"label_agreement":null},{"id":"W3040594194","doi":"10.1007/978-3-030-51825-7_3","title":"Clause Size Reduction with all-UIP Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reduction (mathematics); Artificial intelligence; Computer security; Mathematics","score_opus":0.013602347541774378,"score_gpt":0.2500519772948739,"score_spread":0.2364496297530995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040594194","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.015723525,0.00084168784,0.9289714,0.0015890058,0.00055254967,0.00029108016,0.0019394179,0.019311173,0.030780198],"genre_scores_gemma":[0.18941149,0.00040134252,0.7704091,0.0010689762,0.00035327912,0.0003588313,0.0065592546,0.0036080154,0.027829664],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983365,0.0004248908,0.00009511467,0.0003415427,0.0006056686,0.00019638179],"domain_scores_gemma":[0.99590474,0.0018795802,0.000093678354,0.0015420569,0.0004756404,0.00010433089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107837,0.0012413167,0.0011316178,0.0014122347,0.00090262113,0.0013693946,0.003954137,0.0010653184,0.031988107],"category_scores_gemma":[0.0066340263,0.00081034255,0.0020652509,0.0019538566,0.0009511839,0.004219357,0.0033713325,0.0047376733,0.0060586077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028874227,0.00025570684,0.0005753026,0.0004061037,0.000067695895,0.00014965773,0.000096617725,0.030116145,0.0067245737,0.04093312,0.06686145,0.85352486],"study_design_scores_gemma":[0.00020307169,0.00018645074,0.000668978,0.000117954,0.00014730744,0.0003520583,0.00020951808,0.6285268,0.031404443,0.29963052,0.038507197,0.00004570558],"about_ca_topic_score_codex":0.0028276343,"about_ca_topic_score_gemma":0.0069343615,"teacher_disagreement_score":0.031988107,"about_ca_system_score_codex":0.0009466891,"about_ca_system_score_gemma":0.0018026009,"threshold_uncertainty_score":0.1070109},"labels":[],"label_agreement":null},{"id":"W3040611580","doi":"10.1007/978-3-030-52152-3_22","title":"Learning to Model Another Agent’s Beliefs: A Preliminary Approach","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Process (computing); Order (exchange); Artificial intelligence; Intelligent agent; Belief revision; Natural (archaeology); Cognitive science; Psychology","score_opus":0.027303179272468114,"score_gpt":0.2364933274448766,"score_spread":0.2091901481724085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040611580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005477147,0.00034497184,0.9817822,0.0017467315,0.000051194816,0.00006837269,0.000121761565,0.00012085595,0.010286873],"genre_scores_gemma":[0.3823143,0.001383653,0.59241074,0.00091533887,0.00035686544,0.0004909817,0.0006272909,0.00010140534,0.02139937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998825,0.00053199154,0.000075071875,0.00028706974,0.00021268164,0.000068216126],"domain_scores_gemma":[0.9946583,0.0039273235,0.0001611118,0.0006006576,0.00045178024,0.00020084406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026807447,0.0010306062,0.00088826654,0.00066041347,0.00072493905,0.002571186,0.0032868376,0.0018503097,0.008614053],"category_scores_gemma":[0.008707054,0.00057791325,0.0015080235,0.0010025363,0.00232854,0.0068735983,0.002792889,0.0033984156,0.0011325949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112456495,0.00021705661,0.00093285483,0.0002390275,0.0001231319,0.00019124625,0.00069174235,0.08215757,0.0014412467,0.83544374,0.004057163,0.07439279],"study_design_scores_gemma":[0.000018252873,0.00010349936,0.00021892767,0.000043542015,0.00003324344,0.00008205725,0.000091404254,0.24448702,0.00072453194,0.7485799,0.005592836,0.000024799981],"about_ca_topic_score_codex":0.0035425539,"about_ca_topic_score_gemma":0.0034278717,"teacher_disagreement_score":0.008614053,"about_ca_system_score_codex":0.0015109198,"about_ca_system_score_gemma":0.0013996284,"threshold_uncertainty_score":0.028816938},"labels":[],"label_agreement":null},{"id":"W3040719174","doi":"10.1007/978-3-030-50309-3_24","title":"Enabling Medical Research Through Privacy-Preserving Data Markets","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Information privacy; Computer security; Data science; Internet privacy; World Wide Web","score_opus":0.1219746736883639,"score_gpt":0.35661972674384634,"score_spread":0.23464505305548244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040719174","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.015129596,0.008518884,0.86401576,0.026370032,0.00094723114,0.00023655081,0.0004942005,0.0007879923,0.08349974],"genre_scores_gemma":[0.6677633,0.012441632,0.27122617,0.006096659,0.0024251274,0.00039123598,0.0006207476,0.00032019147,0.038714983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494237,0.002245883,0.00021365585,0.0006142075,0.0015492772,0.0004347341],"domain_scores_gemma":[0.98844224,0.0073693832,0.00068293686,0.002449408,0.0005763879,0.0004795324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009022884,0.00057682366,0.0008912354,0.0012530908,0.00086103275,0.008143086,0.0028840085,0.0031859647,0.012042143],"category_scores_gemma":[0.017677082,0.0006185775,0.0012187161,0.0019752826,0.0043304763,0.014397234,0.0059715747,0.0044871406,0.002789174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109620894,0.00007125845,0.00024875105,0.00013749358,0.00002982476,0.0001494189,0.00012661779,0.006193103,0.0016646896,0.91759133,0.0073200604,0.06635782],"study_design_scores_gemma":[0.000038323553,0.000037603495,0.000081940496,0.000050766823,0.000014145867,0.00021530916,0.00005779569,0.020699525,0.0021057432,0.9488474,0.027838044,0.000013392093],"about_ca_topic_score_codex":0.00024891525,"about_ca_topic_score_gemma":0.00019121896,"teacher_disagreement_score":0.012042143,"about_ca_system_score_codex":0.0013597413,"about_ca_system_score_gemma":0.0019686176,"threshold_uncertainty_score":0.047718108},"labels":[],"label_agreement":null},{"id":"W3040773772","doi":"10.1007/978-3-030-52200-1_48","title":"Implementing the Tangent Graeffe Root Finding Method","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Tangent; Root (linguistics); Mathematics; Geometry; Philosophy","score_opus":0.023802716190138375,"score_gpt":0.2832389407379264,"score_spread":0.25943622454778803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040773772","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.037330315,0.0002717556,0.90754825,0.00027292225,0.00035545975,0.00006776935,0.00015226135,0.006881734,0.047119584],"genre_scores_gemma":[0.30987656,0.00027739807,0.65059817,0.00018929591,0.000089781075,0.000057500176,0.00036199202,0.0018191923,0.03673018],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950814,0.00007204,0.000026181087,0.000058754227,0.00026252534,0.0000723283],"domain_scores_gemma":[0.9994981,0.00012245521,0.00002340156,0.00019510744,0.00013354035,0.00002736011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005142797,0.00055061106,0.00069192785,0.0010134025,0.0006446206,0.0014830728,0.0011740598,0.000766685,0.02177467],"category_scores_gemma":[0.0019316614,0.00032098885,0.00044255838,0.0009362364,0.00070941244,0.0021416547,0.0017752639,0.00088899134,0.0073833545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003569666,0.00012365919,0.00084054004,0.00019089034,0.000043035998,0.00034138156,0.0004058999,0.011744922,0.046308562,0.27555338,0.019098878,0.6449918],"study_design_scores_gemma":[0.00027733154,0.00035806771,0.0009014849,0.00014794858,0.00008504719,0.0017235138,0.0004405381,0.31484812,0.1271727,0.40821669,0.14566955,0.00015904811],"about_ca_topic_score_codex":0.0005131591,"about_ca_topic_score_gemma":0.0010209685,"teacher_disagreement_score":0.02177467,"about_ca_system_score_codex":0.00039968127,"about_ca_system_score_gemma":0.00059281895,"threshold_uncertainty_score":0.07284355},"labels":[],"label_agreement":null},{"id":"W3040829389","doi":"10.1007/978-3-030-50341-3_11","title":"Insights from the Apple Human Interface Guidelines on Intuitive Interaction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Team Dynamics and Performance","field":"Psychology","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":"Computer science; Interface (matter); Context (archaeology); Process (computing); Key (lock); Human–computer interaction; Data science; Academic community; World Wide Web; Programming language; Library science","score_opus":0.04907129884556444,"score_gpt":0.34221406484790656,"score_spread":0.2931427660023421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040829389","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048460387,0.017276073,0.18782431,0.022710979,0.00076179474,0.000097730364,0.00021697757,0.00063592696,0.7220158],"genre_scores_gemma":[0.7504586,0.013764816,0.07816438,0.0036138287,0.00051791663,0.0002311189,0.00027467834,0.0010116822,0.15196301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990909,0.00032506097,0.000048029837,0.00010326176,0.00034989955,0.00008284775],"domain_scores_gemma":[0.99648994,0.0025912826,0.00008636459,0.00019923627,0.00053742935,0.0000957973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013234484,0.000541123,0.00030541472,0.00078494265,0.0007911831,0.005006147,0.0010280767,0.0022146958,0.01771595],"category_scores_gemma":[0.006459513,0.0004479367,0.00021043935,0.0008402718,0.004173852,0.006414701,0.0017512502,0.0030854268,0.002362843],"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.0000629097,0.00005046613,0.00043057607,0.00024413287,0.00000493624,0.00029876066,0.0086507,0.0011119503,0.0029171146,0.833164,0.021354573,0.13170996],"study_design_scores_gemma":[0.000036014408,0.00014081785,0.0043153777,0.00078400754,0.000020765527,0.0010302853,0.0057086605,0.008167155,0.0033707076,0.6223219,0.35405198,0.000052334773],"about_ca_topic_score_codex":0.003628492,"about_ca_topic_score_gemma":0.0061791795,"teacher_disagreement_score":0.01771595,"about_ca_system_score_codex":0.0010082945,"about_ca_system_score_gemma":0.0010689171,"threshold_uncertainty_score":0.059265792},"labels":[],"label_agreement":null},{"id":"W3040876529","doi":"10.1007/978-3-030-49282-3_16","title":"QB-Gest: Qwerty Bimanual Gestural Input for Eyes-Free Smartphone Text Input","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Computer science; Gesture; Phrase; Text entry; Hands free; Human–computer interaction; Speech recognition; Computer vision; Artificial intelligence","score_opus":0.018229883962624184,"score_gpt":0.25572468368810297,"score_spread":0.2374947997254788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040876529","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.024440335,0.0010323882,0.83717424,0.00024106004,0.00048405456,0.00044863662,0.0042555123,0.069359444,0.062564366],"genre_scores_gemma":[0.2467501,0.0016354286,0.5226609,0.00077100744,0.00017960675,0.0012486735,0.011553609,0.013932393,0.20126835],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996712,0.000028283386,0.00002200751,0.00006514954,0.00017237122,0.00004105029],"domain_scores_gemma":[0.9998122,0.0000635335,0.000009484423,0.000040562518,0.00005051824,0.000023690975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027749682,0.0013386831,0.0005828247,0.00039849468,0.00024951997,0.0008673622,0.0014496456,0.0008710643,0.12810427],"category_scores_gemma":[0.00085238833,0.00042844794,0.00032054173,0.00048565204,0.0003274975,0.0011876118,0.0023532924,0.000607834,0.041177507],"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.0009787158,0.00011505205,0.0002557368,0.00075009407,0.00003138175,0.00043307082,0.00032123728,0.001263499,0.15831436,0.004214434,0.070561975,0.7627604],"study_design_scores_gemma":[0.0007894982,0.0016645073,0.010053083,0.0009569333,0.00011787403,0.00508679,0.00062156055,0.12099092,0.34333652,0.021297783,0.49476862,0.00031590863],"about_ca_topic_score_codex":0.0011200155,"about_ca_topic_score_gemma":0.0015871789,"teacher_disagreement_score":0.12810427,"about_ca_system_score_codex":0.0001740197,"about_ca_system_score_gemma":0.0002550694,"threshold_uncertainty_score":0.4285515},"labels":[],"label_agreement":null},{"id":"W3041002373","doi":"10.1007/978-3-030-50341-3_23","title":"Investigating Linguistic Indicators of Generative Content in Enterprise Social Media","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Knowledge Management and Sharing","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":"HEC Montréal","funders":"","keywords":"Generative grammar; Computer science; Generative model; Affordance; Social media; Field (mathematics); Knowledge management; Sample (material); Analytics; Data science; Artificial intelligence; Human–computer interaction; World Wide Web","score_opus":0.055106117955292855,"score_gpt":0.28928278594362056,"score_spread":0.2341766679883277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041002373","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.9910738,0.00009229377,0.0038173252,0.000057974547,0.0000082843435,0.000023444172,0.00026805705,0.00006646295,0.00459248],"genre_scores_gemma":[0.9972832,0.000038841445,0.0018195567,0.000011054123,0.000011995053,0.000030809122,0.00022313051,0.00002883199,0.00055255945],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99891055,0.0005202983,0.000076815726,0.00014498993,0.00025370438,0.000093586736],"domain_scores_gemma":[0.9769818,0.0184513,0.0020222662,0.0005139158,0.0016424108,0.0003882727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015272523,0.00023028572,0.00018257383,0.0035094882,0.00063181977,0.0038634606,0.00042266582,0.00066064956,0.0028666107],"category_scores_gemma":[0.018840058,0.000263781,0.00020625329,0.0027078511,0.00078353955,0.002891908,0.0013675342,0.00071480044,0.0007136781],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022132143,0.00080481125,0.6273493,0.0007657221,0.00028995165,0.0005941365,0.05185331,0.004554512,0.113167,0.012925898,0.0019670934,0.18351497],"study_design_scores_gemma":[0.000038119742,0.0006297552,0.8647067,0.00019263552,0.00025065988,0.00052600156,0.037975535,0.047886938,0.033323422,0.010214675,0.0041202023,0.00013534304],"about_ca_topic_score_codex":0.0028272,"about_ca_topic_score_gemma":0.0027298438,"teacher_disagreement_score":0.0038634606,"about_ca_system_score_codex":0.0005937189,"about_ca_system_score_gemma":0.0002984594,"threshold_uncertainty_score":0.009589732},"labels":[],"label_agreement":null},{"id":"W3041031825","doi":"10.1007/978-3-030-49044-7_7","title":"Effects of Digitally Typesetting Mathematics on Working Memory","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","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":"Trent University","funders":"","keywords":"Computer science; Handwriting; Working memory; Stimulus (psychology); Expression (computer science); Transcription (linguistics); Arabic numerals; Natural language processing; Speech recognition; Arithmetic; Artificial intelligence; Cognitive psychology; Programming language; Linguistics; Mathematics; Cognition; Psychology","score_opus":0.023697950545417214,"score_gpt":0.2598920310833996,"score_spread":0.23619408053798238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041031825","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.99563944,0.00045330537,0.00014326954,0.000102388265,0.00007360318,0.000013954215,0.00020643567,0.000040587107,0.0033271129],"genre_scores_gemma":[0.98679954,0.00059995276,0.00039738443,0.00012846403,0.000069104404,0.000052355765,0.00033575518,0.00008835023,0.01152927],"study_design_codex":"randomized_trial","study_design_gemma":"observational","domain_scores_codex":[0.9995944,0.00012989187,0.00004531958,0.00008202411,0.000071999304,0.000076510965],"domain_scores_gemma":[0.96982175,0.025011837,0.0019702173,0.0012682794,0.0003980335,0.001529802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000684902,0.0007557829,0.000603884,0.00045726905,0.00041382803,0.0017228797,0.0010700006,0.00079321116,0.025962964],"category_scores_gemma":[0.010433294,0.0005438308,0.0004105839,0.0006436258,0.0011484567,0.0011986843,0.001364959,0.0017397278,0.0017163368],"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.421658,0.043448742,0.0468701,0.0014141833,0.0007873138,0.00195293,0.0045977468,0.0040053087,0.28177014,0.0049281768,0.0034286105,0.18513867],"study_design_scores_gemma":[0.012162204,0.052977085,0.69143885,0.0006167174,0.0032353753,0.0023132593,0.0052399035,0.0069288136,0.19989711,0.015867777,0.0089518,0.0003711812],"about_ca_topic_score_codex":0.0021871827,"about_ca_topic_score_gemma":0.0017133118,"teacher_disagreement_score":0.025962964,"about_ca_system_score_codex":0.0004870619,"about_ca_system_score_gemma":0.0006076168,"threshold_uncertainty_score":0.086854815},"labels":[],"label_agreement":null},{"id":"W3041195403","doi":"10.1007/978-3-030-49065-2_11","title":"The Influences of Media Naturalness and Mental Model Alignment on Reducing Patient Uncertainty in Virtual Consultation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Memorial University of Newfoundland","funders":"","keywords":"Naturalness; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.045163467662571635,"score_gpt":0.3150924778398448,"score_spread":0.26992901017727317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041195403","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.98223716,0.00022117242,0.0067292377,0.0007991107,0.000032394506,0.000057639296,0.000026645977,0.000071807866,0.00982482],"genre_scores_gemma":[0.9975535,0.00003715418,0.0021440543,0.000041705578,0.0000125017505,0.000024469397,0.000010065049,0.000010331512,0.00016627324],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99097323,0.007332775,0.00026300564,0.0002346959,0.0008570144,0.000339323],"domain_scores_gemma":[0.830235,0.15946479,0.0052605863,0.0015073413,0.0013792638,0.0021530362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006059282,0.0002576647,0.00022544536,0.00047793332,0.0007920853,0.002799831,0.0005906327,0.0006997715,0.004199944],"category_scores_gemma":[0.1198272,0.00020376629,0.0002860007,0.00037123307,0.0008817599,0.0019489783,0.0015505014,0.0012631328,0.00023541713],"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.01951304,0.005448023,0.2069576,0.000988284,0.00050447014,0.0009939788,0.034779403,0.04725827,0.03315593,0.019549325,0.002706459,0.6281452],"study_design_scores_gemma":[0.0010074322,0.010986277,0.6496395,0.0007049903,0.0010100167,0.0015539064,0.050538186,0.20768514,0.020263162,0.050016206,0.006245853,0.00034938758],"about_ca_topic_score_codex":0.0012858626,"about_ca_topic_score_gemma":0.0016655567,"teacher_disagreement_score":0.006059282,"about_ca_system_score_codex":0.00088539056,"about_ca_system_score_gemma":0.0013436876,"threshold_uncertainty_score":0.032044947},"labels":[],"label_agreement":null},{"id":"W3041200982","doi":"10.1007/978-3-030-52482-1_13","title":"Search-Based Transformation Synthesis for 3-Valued Reversible Circuits","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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; University of Victoria","funders":"","keywords":"Computer science; Transformation (genetics); Key (lock); Bounded function; Electronic circuit; Function (biology); Algorithm; Theoretical computer science; Mathematics; Electrical engineering","score_opus":0.02403921534280661,"score_gpt":0.2443682799480961,"score_spread":0.22032906460528948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041200982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050015982,0.0008445002,0.8885935,0.00022926314,0.00011736369,0.00012623015,0.00026541227,0.0015084866,0.058299195],"genre_scores_gemma":[0.73204803,0.0005396962,0.25076297,0.00014969852,0.000027838716,0.00014955954,0.00037367604,0.00022173475,0.015726784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989295,0.00001919305,0.0000069010557,0.00001725979,0.00004533519,0.000018322453],"domain_scores_gemma":[0.99990356,0.000046500263,0.000008588684,0.000018434066,0.000018117818,0.0000047406893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012617861,0.00032437523,0.00030027205,0.0003359583,0.00024682024,0.0005422708,0.00041318947,0.00042781513,0.0070297965],"category_scores_gemma":[0.00030877077,0.000167233,0.000440078,0.00040424135,0.00035694562,0.0004476603,0.0004344052,0.0005617756,0.0011248555],"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.00021506198,0.00009024266,0.00020455274,0.00037227015,0.00004208874,0.00015363822,0.00017198839,0.12847698,0.13676427,0.37601566,0.004556474,0.35293674],"study_design_scores_gemma":[0.000059817627,0.00022016266,0.0002827392,0.000083833875,0.00004043227,0.00021935745,0.00005395246,0.65271103,0.09879341,0.21652888,0.030963855,0.00004261325],"about_ca_topic_score_codex":0.0006112849,"about_ca_topic_score_gemma":0.0013761681,"teacher_disagreement_score":0.0070297965,"about_ca_system_score_codex":0.00050275464,"about_ca_system_score_gemma":0.000416879,"threshold_uncertainty_score":0.023517013},"labels":[],"label_agreement":null},{"id":"W3041241202","doi":"10.1007/978-3-030-50020-7_10","title":"A Visualization Tool for the CIRMMT Distinguished Lecture Series","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University","funders":"","keywords":"Computer science; Visualization; Metadata; Encyclopedia; Data visualization; Information retrieval; Series (stratigraphy); Task (project management); Data science; World Wide Web; Computer graphics (images); Multimedia; Human–computer interaction; Library science; Artificial intelligence","score_opus":0.02332694641875024,"score_gpt":0.2871689519317753,"score_spread":0.26384200551302506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041241202","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006495985,0.002929163,0.64197123,0.0028220129,0.0040477416,0.0003913738,0.016182633,0.18462798,0.14053184],"genre_scores_gemma":[0.051944688,0.003477762,0.6328381,0.0009829495,0.001591148,0.0008604946,0.03198362,0.04273281,0.23358841],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906594,0.00017165762,0.000080540056,0.00016296108,0.0004202,0.00009881507],"domain_scores_gemma":[0.99772006,0.00072093535,0.00010099563,0.00038288644,0.00067839574,0.00039671702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014112,0.0017596103,0.0008141265,0.004438251,0.0008288772,0.004753573,0.0016145171,0.0010818539,0.14368661],"category_scores_gemma":[0.0047777384,0.0006962516,0.00096279115,0.0039254907,0.00023136767,0.0030231231,0.0026247331,0.0018594725,0.048684254],"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.00019557904,0.00012747828,0.000576885,0.00028507822,0.000018538492,0.00017960765,0.00030610766,0.0011857514,0.00628952,0.01455026,0.5814915,0.39479366],"study_design_scores_gemma":[0.00007607373,0.000066270986,0.00085968076,0.00024429482,0.000028564022,0.00036718542,0.00017884481,0.01833845,0.011062305,0.0126356995,0.9560796,0.00006312017],"about_ca_topic_score_codex":0.0018269791,"about_ca_topic_score_gemma":0.0027369433,"teacher_disagreement_score":0.14368661,"about_ca_system_score_codex":0.0008302828,"about_ca_system_score_gemma":0.001295565,"threshold_uncertainty_score":0.48067957},"labels":[],"label_agreement":null},{"id":"W3041242936","doi":"10.1007/978-3-030-51935-3_34","title":"Considerably Improving Clustering Algorithms Using UMAP Dimensionality Reduction Technique: A Comparative Study","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":238,"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 à Trois-Rivières","funders":"","keywords":"Cluster analysis; Dimensionality reduction; Computer science; Hierarchical clustering; Artificial intelligence; Pattern recognition (psychology); CURE data clustering algorithm; Correlation clustering; Clustering high-dimensional data; Nonlinear dimensionality reduction; Data mining; Canopy clustering algorithm; Embedding; Curse of dimensionality; Preprocessor; Algorithm","score_opus":0.06014161457299876,"score_gpt":0.30660490886128866,"score_spread":0.2464632942882899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041242936","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.5313359,0.04640949,0.3843643,0.0008297768,0.0010579312,0.0005944542,0.0015464773,0.0065666675,0.027295101],"genre_scores_gemma":[0.48641738,0.010165869,0.49152002,0.00018952411,0.00027086138,0.00018027556,0.003353304,0.0005051056,0.0073976964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644095,0.0011617409,0.00028382812,0.000454148,0.0014563126,0.00020306327],"domain_scores_gemma":[0.9938799,0.0026127358,0.00024194905,0.0012158905,0.0019334588,0.000116025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002644598,0.0010650068,0.0015985424,0.0028852485,0.001257334,0.0019075504,0.0019154869,0.0011019559,0.0030859811],"category_scores_gemma":[0.0077997246,0.00022598187,0.001152481,0.0055088955,0.00042421967,0.0023611428,0.0009073535,0.00060087244,0.0017781206],"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.00086944463,0.00060436514,0.0026497024,0.00072200166,0.0003539862,0.00005737787,0.00016107484,0.024701646,0.008777153,0.0022960398,0.0054590213,0.9533482],"study_design_scores_gemma":[0.00027492593,0.004611699,0.039004754,0.00022623439,0.0015634815,0.0015514527,0.0019210071,0.82268435,0.08563241,0.0074830283,0.034807898,0.00023872951],"about_ca_topic_score_codex":0.0052076974,"about_ca_topic_score_gemma":0.005436957,"teacher_disagreement_score":0.0052076974,"about_ca_system_score_codex":0.00091057085,"about_ca_system_score_gemma":0.0010431489,"threshold_uncertainty_score":0.01398617},"labels":[],"label_agreement":null},{"id":"W3041322530","doi":"10.1007/978-3-030-50344-4_43","title":"Returning to Nature: VR Mediated States of Enhanced Wellness","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Global Healthcare and Medical Tourism","field":"Health Professions","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Consciousness; Mindfulness; Meditation; Mental health; Psychotherapist; Psychology; Wonder; Narrative; Social psychology","score_opus":0.028558020590849862,"score_gpt":0.3721734497055526,"score_spread":0.3436154291147027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041322530","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.534778,0.00944738,0.029162932,0.00393047,0.0013315637,0.000093973234,0.0004268204,0.00045409845,0.42037475],"genre_scores_gemma":[0.93732184,0.0019264716,0.0070403623,0.00054079184,0.00008800025,0.000062400984,0.00011157433,0.00009831688,0.052810147],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99989307,0.00004095084,0.0000029671141,0.000019090097,0.000024221767,0.000019685265],"domain_scores_gemma":[0.99987936,0.00006840337,0.000010360649,0.000017902363,0.0000083742325,0.000015650723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023814947,0.0002342372,0.00014090915,0.00017862335,0.00037649198,0.002323589,0.0004411987,0.0006051934,0.01895644],"category_scores_gemma":[0.0005166164,0.00009536879,0.00028959208,0.00024025427,0.00096055056,0.0011232701,0.00085493596,0.00070397044,0.00074172573],"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.0019972967,0.0007734812,0.0033379367,0.0013327163,0.00018763785,0.0018054931,0.048504703,0.004002962,0.14935146,0.29764748,0.031704895,0.45935395],"study_design_scores_gemma":[0.00037015535,0.0027184687,0.08830602,0.0014638456,0.00036945776,0.0036274642,0.05195727,0.009294995,0.043663867,0.29522246,0.5026958,0.00031024445],"about_ca_topic_score_codex":0.00084183016,"about_ca_topic_score_gemma":0.0014370093,"teacher_disagreement_score":0.01895644,"about_ca_system_score_codex":0.00034145502,"about_ca_system_score_gemma":0.00022921912,"threshold_uncertainty_score":0.06341565},"labels":[],"label_agreement":null},{"id":"W3041348913","doi":"10.1007/978-3-030-50309-3_32","title":"An Emerging Strategy for Privacy Preserving Databases: Differential Privacy","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Differential privacy; Computer science; Identification (biology); Data mining; Information privacy; Personally identifiable information; Privacy software; Process (computing); Information sensitivity; Private information retrieval; Information retrieval; Computer security","score_opus":0.07005220781919874,"score_gpt":0.31982302033372123,"score_spread":0.2497708125145225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041348913","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045112995,0.016780457,0.93170017,0.005167859,0.0007264974,0.000069910995,0.00014836194,0.00034372663,0.040551756],"genre_scores_gemma":[0.3976519,0.035068676,0.503178,0.005602616,0.0033739074,0.00036839288,0.0006365458,0.00039234277,0.05372757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633634,0.00096724665,0.00020814656,0.00070112536,0.0015656812,0.00022153961],"domain_scores_gemma":[0.9962196,0.0016113102,0.00014176941,0.0015000125,0.0004087433,0.00011855256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029490045,0.000960395,0.0012432454,0.0016305138,0.0012061232,0.0073401853,0.0032506753,0.0023646194,0.0048032636],"category_scores_gemma":[0.0067095687,0.0006707499,0.001163505,0.0042128307,0.0051322724,0.01399355,0.004557191,0.0061032954,0.0021196646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024461051,0.000025051446,0.00007309507,0.00012219031,0.000012727678,0.000034021814,0.0000941832,0.0011434363,0.00092205184,0.9280072,0.004162324,0.065379255],"study_design_scores_gemma":[0.000014437219,0.000067742374,0.00006450702,0.00008593077,0.00002643747,0.0004894192,0.00006926212,0.017733341,0.0045332676,0.9090315,0.06786152,0.000022726997],"about_ca_topic_score_codex":0.00027600076,"about_ca_topic_score_gemma":0.00016812787,"teacher_disagreement_score":0.0073401853,"about_ca_system_score_codex":0.0016819783,"about_ca_system_score_gemma":0.0010313281,"threshold_uncertainty_score":0.016068518},"labels":[],"label_agreement":null},{"id":"W3041377837","doi":"10.1007/978-3-030-50017-7_27","title":"Expanding and Embedding a High-Level Gesture Vocabulary for Digital and Augmented Musical Instruments","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"Future Earth; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Computer science; Gesture; Musical; Vocabulary; Musical instrument; Embedding; Maturity (psychological); Human–computer interaction; Multimedia; Artificial intelligence; Linguistics; Psychology; Visual arts; Art; Acoustics","score_opus":0.0232149025605049,"score_gpt":0.2506174232309314,"score_spread":0.2274025206704265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041377837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027866237,0.00087100343,0.95188767,0.00011108566,0.00024486307,0.00014267152,0.0005972098,0.006071154,0.012208078],"genre_scores_gemma":[0.34327224,0.0012709588,0.6168231,0.00022635917,0.000108560474,0.00040176595,0.0028964346,0.0014428354,0.03355781],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939024,0.00006558048,0.000070865746,0.00013656082,0.0002602927,0.00007642344],"domain_scores_gemma":[0.9995963,0.00011028291,0.000024838717,0.00012954154,0.00010712069,0.000032031596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035349905,0.0007945732,0.0006016114,0.00080450246,0.00031362812,0.0013980783,0.0012281828,0.0008019888,0.010439223],"category_scores_gemma":[0.0014826653,0.00037714053,0.00067811355,0.00063798757,0.0006755128,0.0032042754,0.003990972,0.0012258873,0.005381249],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037713005,0.0001361767,0.0005756484,0.0007102908,0.000044963177,0.00040818006,0.0008442372,0.007444863,0.34229913,0.03864045,0.0066578747,0.60186106],"study_design_scores_gemma":[0.00010610977,0.00085800403,0.0022442187,0.0005582284,0.00023450574,0.0020540648,0.001311172,0.29923603,0.359521,0.04490334,0.2887351,0.00023816619],"about_ca_topic_score_codex":0.001252332,"about_ca_topic_score_gemma":0.0026156714,"teacher_disagreement_score":0.010439223,"about_ca_system_score_codex":0.00019773291,"about_ca_system_score_gemma":0.0005468581,"threshold_uncertainty_score":0.03492266},"labels":[],"label_agreement":null},{"id":"W3041420828","doi":"10.1007/978-3-030-50788-6_14","title":"Knowledge-to-Information Translation Training (KITT): An Adaptive Approach to Explainable Artificial Intelligence","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Training (meteorology); Translation (biology)","score_opus":0.10456046355613227,"score_gpt":0.2954454831840099,"score_spread":0.19088501962787766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041420828","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.007621238,0.00042978517,0.9741891,0.000489952,0.00010492027,0.00010231021,0.0002038735,0.0041372236,0.012721552],"genre_scores_gemma":[0.13952495,0.0007362233,0.84293765,0.00032895783,0.000095756564,0.0002450613,0.0010376058,0.0005746983,0.01451909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.0001511719,0.000019017154,0.00010758129,0.00008813677,0.000021463446],"domain_scores_gemma":[0.9987018,0.000912318,0.000051733154,0.0002198828,0.000089328925,0.000024846942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395039,0.0007218998,0.00032222507,0.0004328732,0.0002554347,0.00095292734,0.0015616555,0.00084079325,0.010916235],"category_scores_gemma":[0.003526038,0.00035002205,0.0006343162,0.0006186214,0.00058401696,0.0019166835,0.0013891443,0.0015776393,0.0023567248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009261011,0.00016207315,0.00042472585,0.00028807786,0.000052696192,0.000101025355,0.0002986123,0.03660357,0.008980191,0.041700944,0.013289985,0.8980055],"study_design_scores_gemma":[0.000051399085,0.00018245075,0.0011603455,0.00015238023,0.000077239485,0.00027158833,0.00012023592,0.73145074,0.029117761,0.18350437,0.053864803,0.000046711866],"about_ca_topic_score_codex":0.0009366,"about_ca_topic_score_gemma":0.001455837,"teacher_disagreement_score":0.010916235,"about_ca_system_score_codex":0.00038847254,"about_ca_system_score_gemma":0.00056895264,"threshold_uncertainty_score":0.036518455},"labels":[],"label_agreement":null},{"id":"W3041422564","doi":"10.1007/978-3-030-52705-1_21","title":"Concept Analysis Using Quantitative Structured Three-Way Rough Set Approximations","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Intension; Probabilistic logic; Rough set; Extension (predicate logic); Computer science; Set (abstract data type); Approximations of π; Context (archaeology); Theoretical computer science; Semantics (computer science); Artificial intelligence; Algorithm; Mathematics; Applied mathematics","score_opus":0.053619639669343216,"score_gpt":0.2884098050228801,"score_spread":0.2347901653535369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041422564","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.0020890587,0.00018983663,0.99694794,0.00003431809,0.000017197308,0.00001710132,0.00003557487,0.00006872235,0.0006003443],"genre_scores_gemma":[0.11464925,0.00055980915,0.8833213,0.000032648524,0.00003686253,0.000106813895,0.00022124585,0.000048114864,0.00102399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724966,0.00093736453,0.00023915427,0.00028303635,0.0011976168,0.00009317593],"domain_scores_gemma":[0.9967445,0.0019889404,0.00023621923,0.00035655187,0.0006109644,0.00006272363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00293606,0.00073011086,0.0015071887,0.0026340457,0.0005023487,0.003821068,0.0011735333,0.0005409987,0.0020257912],"category_scores_gemma":[0.008860502,0.00059461565,0.0023505925,0.0025337916,0.0011258331,0.0033937339,0.0014021592,0.0017274168,0.0005236394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016462723,0.000077883706,0.00073824765,0.0007107022,0.00027369935,0.00018206237,0.0006208444,0.23235224,0.008822948,0.460907,0.002562936,0.2925868],"study_design_scores_gemma":[0.0000152112325,0.00006847814,0.0003416532,0.000065694076,0.00006378276,0.00013234207,0.00013166467,0.74747336,0.0038047112,0.24396315,0.0038984974,0.000041449533],"about_ca_topic_score_codex":0.0010839847,"about_ca_topic_score_gemma":0.00065658905,"teacher_disagreement_score":0.003821068,"about_ca_system_score_codex":0.0011545032,"about_ca_system_score_gemma":0.0010005749,"threshold_uncertainty_score":0.015527606},"labels":[],"label_agreement":null},{"id":"W3041435679","doi":"10.1007/978-3-030-49108-6_4","title":"Creation Process for a Technology Design Model Promoting Active Participation of End Users with Neurodevelopmental Disorders: Achievements and Pitfalls","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Approaches in Technology and Social Development","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":"Hydro-Québec; Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Mainstream; Process (computing); Conceptualization; Social model of disability; Autism; Autism spectrum disorder; Participatory design; Knowledge management; Intellectual disability; Promotion (chess); Inclusion (mineral); Collaborative model; Citizen journalism; Process management; Engineering ethics; Psychology; World Wide Web; Artificial intelligence; Engineering; Developmental psychology; Political science","score_opus":0.03154969477762143,"score_gpt":0.2576825895518199,"score_spread":0.22613289477419846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041435679","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.045175735,0.00011591501,0.9009385,0.0024249076,0.00013397366,0.0013692604,0.00017763594,0.0016591325,0.048004888],"genre_scores_gemma":[0.29981667,0.00015764449,0.67327696,0.00031596067,0.000027231237,0.0016541661,0.0003929405,0.00044286172,0.023915581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951054,0.0026938654,0.00026643046,0.0005149922,0.0011676212,0.00025169522],"domain_scores_gemma":[0.99009806,0.0058567114,0.00040106825,0.0014749552,0.0014816745,0.0006876214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007168297,0.000921513,0.00031594193,0.0014217104,0.0021124603,0.006865078,0.0020418453,0.0027577416,0.013432393],"category_scores_gemma":[0.010237194,0.00061420177,0.0012106991,0.0007995189,0.0021071695,0.006636953,0.0035277053,0.0020310355,0.0030292356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050592644,0.001611512,0.0066688103,0.0007226433,0.00007513989,0.0011700181,0.027585544,0.023368979,0.027146783,0.6085213,0.011452728,0.29117063],"study_design_scores_gemma":[0.00028523913,0.0013629904,0.0033953812,0.00093247555,0.00026822454,0.0014757825,0.0124595305,0.349232,0.044540998,0.28778753,0.29800403,0.0002558555],"about_ca_topic_score_codex":0.0014911637,"about_ca_topic_score_gemma":0.0014355676,"teacher_disagreement_score":0.013432393,"about_ca_system_score_codex":0.0018931968,"about_ca_system_score_gemma":0.004952855,"threshold_uncertainty_score":0.044935822},"labels":[],"label_agreement":null},{"id":"W3041504937","doi":"10.1007/978-3-030-69535-4_45","title":"To Filter Prune, or to Layer Prune, That Is the Question","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Pruning; Filter (signal processing); Computer science; FLOPS; Reduction (mathematics); Algorithm; Latency (audio); Kernel adaptive filter; Artificial intelligence; Mathematics; Filter design; Parallel computing; Computer vision; Telecommunications","score_opus":0.03906733305325706,"score_gpt":0.3239460670752379,"score_spread":0.28487873402198083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041504937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033223297,0.015902359,0.7611275,0.14203338,0.0043551833,0.00013628813,0.0013517448,0.0029471696,0.03892315],"genre_scores_gemma":[0.34981462,0.006366648,0.55737025,0.025464742,0.004802403,0.00023632924,0.0015914184,0.0052589807,0.04909463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652195,0.0010347409,0.00022977592,0.001331075,0.00050346396,0.00037907425],"domain_scores_gemma":[0.9806193,0.011034623,0.000796185,0.0049453373,0.0018211668,0.00078331627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043597794,0.0010683953,0.0018546149,0.0006575499,0.00120726,0.004690329,0.003351962,0.005306839,0.014846692],"category_scores_gemma":[0.04573655,0.00084291055,0.0008462161,0.0008882759,0.005009065,0.02112468,0.0020085988,0.005458879,0.007615179],"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.0003134944,0.00024884025,0.0027540207,0.0014764834,0.0003123565,0.00021985515,0.00076733844,0.021418875,0.008046272,0.39369726,0.12598135,0.44476375],"study_design_scores_gemma":[0.000046920988,0.000086964006,0.0007379445,0.00029279987,0.000059514212,0.00061490503,0.0005479348,0.048220266,0.0036171838,0.8952421,0.05047734,0.000056213008],"about_ca_topic_score_codex":0.0032048603,"about_ca_topic_score_gemma":0.0047939382,"teacher_disagreement_score":0.014846692,"about_ca_system_score_codex":0.0009989819,"about_ca_system_score_gemma":0.0021775726,"threshold_uncertainty_score":0.04966712},"labels":[],"label_agreement":null},{"id":"W3041519490","doi":"10.1007/978-3-030-51935-3_31","title":"Object Detector Combination for Increasing Accuracy and Detecting More Overlapping Objects","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Pascal (unit); Bounding overwatch; Detector; Artificial intelligence; Convolutional neural network; Object detection; Computer vision; Classifier (UML); Pattern recognition (psychology); Object (grammar); Telecommunications; Programming language","score_opus":0.022191001605907167,"score_gpt":0.27214529766987827,"score_spread":0.2499542960639711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041519490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058797117,0.004177674,0.91704714,0.000432749,0.0011275886,0.00033913093,0.000748613,0.008677149,0.008652797],"genre_scores_gemma":[0.22233866,0.001571938,0.75399524,0.0008421476,0.00036505947,0.00020591752,0.0019550712,0.000868988,0.01785702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818003,0.00015896761,0.00011326273,0.0005774221,0.00073432125,0.00023603662],"domain_scores_gemma":[0.99847895,0.00042458763,0.00007083894,0.00023522471,0.0006829008,0.00010753301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018273445,0.0026725356,0.0028080454,0.004494201,0.0008945078,0.0027470654,0.0023218466,0.002753585,0.009887088],"category_scores_gemma":[0.0020337384,0.0014784167,0.0021262942,0.003499948,0.0004975245,0.002508547,0.00214466,0.0015516335,0.0063705207],"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.0006074726,0.00042447002,0.0026280172,0.0004250418,0.00048777924,0.00032071525,0.000053925105,0.0075632595,0.19626746,0.0015216165,0.007825349,0.78187495],"study_design_scores_gemma":[0.00009540185,0.00062400464,0.008832313,0.00010111097,0.0015949211,0.0025294386,0.00010845752,0.49489355,0.4607017,0.0035560175,0.026799789,0.00016332473],"about_ca_topic_score_codex":0.0022244365,"about_ca_topic_score_gemma":0.004772619,"teacher_disagreement_score":0.009887088,"about_ca_system_score_codex":0.0009073919,"about_ca_system_score_gemma":0.0012055684,"threshold_uncertainty_score":0.03307563},"labels":[],"label_agreement":null},{"id":"W3041637353","doi":"10.1007/978-3-030-50341-3_34","title":"Effectiveness of Banner Ads: An Eye Tracking and Facial Expression Analysis","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Behavior in Brand Consumption and Identification","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":"HEC Montréal","funders":"","keywords":"Valence (chemistry); Banner; Facial expression; Eye tracking; Computer science; Emotional valence; Fixation (population genetics); Cognitive psychology; Psychology; Human–computer interaction; Advertising; Artificial intelligence; Cognition; Linguistics","score_opus":0.024685656569670835,"score_gpt":0.2698991920083247,"score_spread":0.24521353543865385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041637353","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.9787748,0.0005949703,0.0011146225,0.000057649042,0.00004958467,0.0000536666,0.0005823813,0.00006337072,0.018709052],"genre_scores_gemma":[0.9909898,0.00037353966,0.0011582688,0.00008468255,0.000045541048,0.000026174155,0.0005504075,0.00003250921,0.006739057],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99964,0.000117634125,0.000015184702,0.00005829974,0.00014354275,0.000025288933],"domain_scores_gemma":[0.9986418,0.0008487506,0.00015630509,0.000063888685,0.00023693264,0.000052355448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055811857,0.00032335633,0.00026977478,0.00053845195,0.00020486543,0.0005187703,0.0001789858,0.00032957,0.0051614223],"category_scores_gemma":[0.0027568212,0.000118515745,0.00022851277,0.00022174916,0.000103056314,0.0006044031,0.00020978446,0.000281518,0.0010860862],"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.013530852,0.002210486,0.20344841,0.0007418124,0.0006454749,0.0003169461,0.0020613703,0.0023965142,0.3482597,0.0010680315,0.0065575913,0.4187627],"study_design_scores_gemma":[0.000061777544,0.0012046589,0.9726002,0.000027544884,0.00028902866,0.0003907646,0.0005420032,0.008640519,0.0144926105,0.00019516524,0.0015195478,0.00003621574],"about_ca_topic_score_codex":0.0044752853,"about_ca_topic_score_gemma":0.0064987442,"teacher_disagreement_score":0.0051614223,"about_ca_system_score_codex":0.0002606095,"about_ca_system_score_gemma":0.00013425924,"threshold_uncertainty_score":0.01726669},"labels":[],"label_agreement":null},{"id":"W3041765104","doi":"10.1007/978-3-030-52705-1_32","title":"Detecting Overlapping Communities Using Distributed Neighbourhood Threshold in Social Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Computer science; Neighbourhood (mathematics); Preprocessor; Node (physics); Modularity (biology); Algorithm; Boundary (topology); Data mining; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.030228913554229006,"score_gpt":0.2676961226766297,"score_spread":0.23746720912240066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041765104","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.3292141,0.00089921517,0.66640186,0.00017923827,0.00006655862,0.00015938636,0.00033037955,0.0006066138,0.0021425914],"genre_scores_gemma":[0.86332583,0.0002354977,0.13439396,0.00003318148,0.00007229002,0.00008291032,0.00046367012,0.000044982913,0.0013478303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985232,0.00032076385,0.00009246566,0.00044088927,0.00047720803,0.00014547251],"domain_scores_gemma":[0.9956463,0.0028173071,0.0004526713,0.00034334708,0.00049415673,0.00024626925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013843859,0.0005645189,0.0011631958,0.0038406407,0.0010194179,0.0014662797,0.0016559378,0.0014631114,0.0006577461],"category_scores_gemma":[0.007125695,0.00045650493,0.00070901704,0.0026437202,0.00084070023,0.0024823474,0.0019625542,0.0006547363,0.0002840133],"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.0016582238,0.0008094596,0.0635801,0.0006783636,0.0005080907,0.0011228079,0.0012531311,0.3551742,0.0463447,0.026597643,0.004717542,0.4975557],"study_design_scores_gemma":[0.000018464818,0.000063967265,0.0035684349,0.000015522062,0.000035191137,0.00021652416,0.00018569053,0.9792804,0.0030699451,0.0130119715,0.0005186861,0.0000152002785],"about_ca_topic_score_codex":0.003239247,"about_ca_topic_score_gemma":0.0041827187,"teacher_disagreement_score":0.0038406407,"about_ca_system_score_codex":0.00074069545,"about_ca_system_score_gemma":0.000477263,"threshold_uncertainty_score":0.007321477},"labels":[],"label_agreement":null},{"id":"W3041782174","doi":"","title":"Interaction and music technology","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field (mathematics); Musical; Human–computer interaction; Interface (matter); Music technology; Computer science; Sociology; Multimedia; Music education; Visual arts; Pedagogy; Art","score_opus":0.023734034890336306,"score_gpt":0.2446175283650196,"score_spread":0.22088349347468328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041782174","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07079472,0.11612713,0.01663749,0.034308214,0.0014698813,0.000083419814,0.00009599355,0.00018459935,0.7602985],"genre_scores_gemma":[0.86611074,0.041913502,0.0053921617,0.0039841295,0.0012291133,0.00012688903,0.000081673286,0.000073796145,0.08108814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978834,0.0010450393,0.00008309058,0.00028008778,0.000499724,0.00020873097],"domain_scores_gemma":[0.9982857,0.0011730599,0.00016476393,0.00010619501,0.00012616492,0.00014399651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014101577,0.00037850978,0.00035625702,0.0013812023,0.002034513,0.00972984,0.0005455787,0.0025020584,0.017267957],"category_scores_gemma":[0.003962287,0.00014825194,0.00032860495,0.00131365,0.0065999217,0.004984163,0.0032966093,0.0014878758,0.0018271904],"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.00011418984,0.00011474178,0.0033389947,0.0005995086,0.00004466415,0.0007815257,0.022084093,0.00055069744,0.002859228,0.8093491,0.010114498,0.1500488],"study_design_scores_gemma":[0.00006149214,0.00032100943,0.01331342,0.0008971211,0.00004271037,0.0035647887,0.018428655,0.001370562,0.0012801336,0.35347742,0.6071619,0.00008080036],"about_ca_topic_score_codex":0.0024789919,"about_ca_topic_score_gemma":0.0016753387,"teacher_disagreement_score":0.017267957,"about_ca_system_score_codex":0.0016739897,"about_ca_system_score_gemma":0.0010391456,"threshold_uncertainty_score":0.057767093},"labels":[],"label_agreement":null},{"id":"W3041854219","doi":"10.1007/978-3-030-50334-5_14","title":"Cross-Scenario Performance Modelling for Big Data Ecosystems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Computer science; Workload; Big data; Cloud computing; Distributed computing; Reuse; Performance prediction; Scheduling (production processes); Real-time computing; Machine learning; Data mining; Simulation; Operating system","score_opus":0.06941218444725285,"score_gpt":0.2736293616568299,"score_spread":0.20421717720957705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041854219","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.49854755,0.0016997153,0.44108218,0.0020846927,0.0002309378,0.00015925367,0.0030496037,0.0014674724,0.051678583],"genre_scores_gemma":[0.97858536,0.00040869997,0.015697418,0.000068235255,0.000032506294,0.000079061785,0.00074528134,0.00015902404,0.0042243605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995122,0.00025174118,0.000019771556,0.000074482996,0.000056139557,0.00008563314],"domain_scores_gemma":[0.99840933,0.0010717083,0.0001186174,0.00011246461,0.00018117827,0.00010671641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014543461,0.0008810578,0.0005621382,0.0006550661,0.00042947286,0.0016127311,0.0013904088,0.0014147285,0.0036086726],"category_scores_gemma":[0.0034691405,0.00040851333,0.0009488866,0.0011971747,0.0004746276,0.00237149,0.0009088918,0.0011093239,0.0004975444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026063313,0.000018524821,0.0005831871,0.000020833457,0.000019949732,0.00003119632,0.000027098664,0.9898074,0.0002267892,0.006326682,0.00063928426,0.002272976],"study_design_scores_gemma":[0.0000020455698,0.00001186346,0.0003092146,0.000004275577,0.000005402831,0.000012186818,0.000021886517,0.99364245,0.000102225786,0.0054628234,0.000420524,0.0000051282022],"about_ca_topic_score_codex":0.012265324,"about_ca_topic_score_gemma":0.0068525635,"teacher_disagreement_score":0.012265324,"about_ca_system_score_codex":0.001536926,"about_ca_system_score_gemma":0.0006568497,"threshold_uncertainty_score":0.024387836},"labels":[],"label_agreement":null},{"id":"W3041896539","doi":"10.1007/978-3-030-49108-6_5","title":"The STORM Project: Using Video Game to Promote Completion of Morning Routine for Children with Attention Deficit Hyperactivity Disorder and Autism Spectrum Disorder","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Attention Deficit Hyperactivity Disorder","field":"Medicine","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Morning; Attention deficit hyperactivity disorder; Autism spectrum disorder; Psychology; Autism; Attention deficit; Clinical psychology; Developmental psychology; Medicine","score_opus":0.027086707909820235,"score_gpt":0.28682913979385577,"score_spread":0.25974243188403556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041896539","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.61314553,0.0109097855,0.043192502,0.011444656,0.0036371585,0.0015700063,0.0038545523,0.009423852,0.3028219],"genre_scores_gemma":[0.4693688,0.011116974,0.1716306,0.0055211135,0.00047379496,0.0033237247,0.004601753,0.0011229186,0.33284023],"study_design_codex":"design_other","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.99988365,0.000029683782,0.000004657041,0.0000185879,0.00003546631,0.000027938091],"domain_scores_gemma":[0.9998342,0.000051692925,0.000009773842,0.0000035629428,0.000013039627,0.00008773628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026474372,0.000666554,0.00018743803,0.00023857741,0.00039251894,0.00044967662,0.00095718267,0.00056305755,0.009449742],"category_scores_gemma":[0.00054716365,0.00014757326,0.00029814572,0.00010515627,0.0001988209,0.00042747147,0.001025502,0.00090120547,0.0018029502],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006394192,0.0040462054,0.0039903875,0.00053813745,0.000049944723,0.000759446,0.0029451542,0.0007047759,0.0074966974,0.0022240626,0.3214775,0.65512824],"study_design_scores_gemma":[0.001378266,0.006280695,0.09882,0.0012726593,0.00024718206,0.006300195,0.009613084,0.008170697,0.00905252,0.0068726023,0.85175586,0.00023631085],"about_ca_topic_score_codex":0.0047981422,"about_ca_topic_score_gemma":0.015818644,"teacher_disagreement_score":0.009449742,"about_ca_system_score_codex":0.00031124428,"about_ca_system_score_gemma":0.0008629543,"threshold_uncertainty_score":0.031612575},"labels":[],"label_agreement":null},{"id":"W3042024661","doi":"10.1007/978-3-030-50506-6_6","title":"Voice Interaction for Training: Opportunities, Challenges, and Recommendations from HCI Perspective","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","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":"National Research Council Canada","funders":"","keywords":"Usability; Computer science; Human–computer interaction; Perspective (graphical); Set (abstract data type); Context (archaeology); User interface; Interface (matter); Training (meteorology); Multimedia; Artificial intelligence","score_opus":0.14146512915425422,"score_gpt":0.31882519433060336,"score_spread":0.17736006517634914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042024661","genre_codex":"review","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.015413621,0.48836783,0.042084686,0.21461591,0.0067340075,0.00012509417,0.00025320807,0.00070669886,0.23169893],"genre_scores_gemma":[0.33682048,0.44825825,0.06926855,0.02651637,0.0072201183,0.00053637254,0.0004297293,0.0003386114,0.110611506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984921,0.000745141,0.00006270622,0.00010887965,0.00036659412,0.00022452917],"domain_scores_gemma":[0.9952095,0.0037349835,0.000101307814,0.00012006474,0.00047266626,0.00036151966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051293788,0.0005031324,0.0006426782,0.0011624021,0.0010048733,0.0077570598,0.001481194,0.0032647343,0.017850753],"category_scores_gemma":[0.0041453578,0.0002407303,0.00046764108,0.0013278187,0.0018527677,0.0065384414,0.002355781,0.002810955,0.002800574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014016428,0.00014268784,0.0012239256,0.0029635068,0.000019895206,0.0003093275,0.003866238,0.00037211613,0.0020475467,0.083156936,0.066663705,0.839094],"study_design_scores_gemma":[0.00006395504,0.00054476474,0.0042503737,0.013619554,0.00007228391,0.002679017,0.029884772,0.0039416216,0.0027177082,0.0877819,0.85436,0.000083967636],"about_ca_topic_score_codex":0.0016974435,"about_ca_topic_score_gemma":0.0053150654,"teacher_disagreement_score":0.017850753,"about_ca_system_score_codex":0.0011728174,"about_ca_system_score_gemma":0.0026465254,"threshold_uncertainty_score":0.0597167},"labels":[],"label_agreement":null},{"id":"W3042064512","doi":"10.1007/978-3-030-50252-2_18","title":"“Just Because You’re Older…”: Seniors Respond to Telecom Sales Practices in Canada","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications; Computer science","score_opus":0.02849125494799054,"score_gpt":0.2932056646508476,"score_spread":0.26471440970285703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042064512","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.798704,0.005860031,0.00018003618,0.10191305,0.0022241394,0.00013635008,0.00041233414,0.00004531458,0.09052467],"genre_scores_gemma":[0.88688844,0.004461337,0.00033098995,0.024388291,0.00018988193,0.00006898114,0.00017981124,0.000065961765,0.08342626],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9971054,0.0003257555,0.000070943504,0.00015090583,0.0007779447,0.0015690146],"domain_scores_gemma":[0.9937476,0.0003183809,0.00033285082,0.000036097637,0.001580663,0.003984379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020390325,0.0003698159,0.00056466745,0.0012230567,0.02730183,0.007123459,0.0021528844,0.0036227922,0.011100071],"category_scores_gemma":[0.0052856416,0.00046778802,0.00045505687,0.0029628598,0.0048796902,0.0027124486,0.00411146,0.0064685405,0.0010627052],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008240523,0.00016929206,0.0465048,0.00015067114,0.000014889982,0.0012129645,0.78538406,0.000048314258,0.00034664033,0.003101402,0.12148399,0.04150057],"study_design_scores_gemma":[0.000007726094,0.000031619573,0.033042416,0.0001786161,0.000007663885,0.00015562617,0.91260225,0.000028873868,0.00003095939,0.000149117,0.053743064,0.000022031412],"about_ca_topic_score_codex":0.9845005,"about_ca_topic_score_gemma":0.99534166,"teacher_disagreement_score":0.0569535,"about_ca_system_score_codex":0.0569535,"about_ca_system_score_gemma":0.13025293,"threshold_uncertainty_score":0.4132285},"labels":[],"label_agreement":null},{"id":"W3042081386","doi":"10.1007/978-3-030-50249-2_42","title":"Designing an Online Escape Game for Older Adults: The Implications of Playability Testing Sessions with a Variety of Dutch Players","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Game design; Computer science; Pace; Video game design; Game design document; Game Developer; Game testing; Video game development; Variety (cybernetics); Game mechanics; Level design; Multimedia; Human–computer interaction; Internet privacy; Artificial intelligence","score_opus":0.040011350990625555,"score_gpt":0.2956138057631002,"score_spread":0.2556024547724747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042081386","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.9833831,0.00012621685,0.006179695,0.00026526942,0.00003267975,0.0005544347,0.00007079814,0.000043047643,0.009344722],"genre_scores_gemma":[0.9274749,0.00053457887,0.04182891,0.00027111906,0.000012237711,0.0011809232,0.0004808201,0.00015388025,0.028062603],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99841106,0.0006876455,0.00012211327,0.00019267442,0.00035423282,0.00023223291],"domain_scores_gemma":[0.9967824,0.0018992199,0.000116142,0.00009785473,0.00058351184,0.0005208013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005298614,0.0008176776,0.0005685553,0.00078254,0.0017979658,0.0025182564,0.0013446292,0.0008811174,0.0029688822],"category_scores_gemma":[0.0077183517,0.00034506104,0.00035783488,0.00040209,0.0008585528,0.002104302,0.0019590345,0.0010118922,0.00071791344],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017473584,0.022736445,0.07412279,0.0012338636,0.00010448626,0.0036658058,0.39692572,0.0018290333,0.07148259,0.004616166,0.009441418,0.41209438],"study_design_scores_gemma":[0.0011845231,0.020159483,0.25730413,0.0016710301,0.0003728225,0.0061664265,0.50542355,0.013287487,0.04294212,0.007776731,0.14321546,0.00049622945],"about_ca_topic_score_codex":0.00502156,"about_ca_topic_score_gemma":0.018476462,"teacher_disagreement_score":0.005298614,"about_ca_system_score_codex":0.0010690246,"about_ca_system_score_gemma":0.0016871177,"threshold_uncertainty_score":0.02802211},"labels":[],"label_agreement":null},{"id":"W3042571375","doi":"10.1007/978-3-030-53552-0_31","title":"HotelSimu: Simulation-Based Optimization for Hotel Dynamic Pricing","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ioannina; Universite Angers; National Research University Higher School of Economics; Università degli Studi di Ferrara; Università degli Studi di Udine; Università della Calabria; Università Bocconi; Consejo Superior de Investigaciones Científicas; Università di Bologna; University of Haifa; Università degli Studi di Cagliari; Centre National de la Recherche Scientifique; Università degli Studi di Napoli Federico II; China Scholarship Council; Ecole Nationale de l'Aviation Civile; University of Toronto; University of New South Wales; University of Crete; Università degli Studi di Camerino; KU Leuven; University of California, Davis; Far Eastern Federal University; Università degli Studi di Trento; Beijing University of Technology; Università degli Studi di Milano-Bicocca; Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Universitat Pompeu Fabra; Wilfrid Laurier University; Institut national de recherche en informatique et en automatique (INRIA); Aristotle University of Thessaloniki; Indian Council of Agricultural Research; Carnegie Mellon University; Università Degli Studi di Modena e Reggio Emila; Université de Lille; Bournemouth University; University of Pittsburgh; University of Warwick; Université de Lorraine; Universidade de Aveiro","keywords":"Computer science; Mathematical optimization; Set (abstract data type); Revenue management; Revenue; Parametric statistics; Dynamic pricing; Monte Carlo method; Operations research; Mathematics; Finance; Economics","score_opus":0.02069412169056113,"score_gpt":0.25176724024926916,"score_spread":0.23107311855870805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042571375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035501078,0.0008942785,0.90059274,0.0005213789,0.00060010655,0.00021228583,0.0022016407,0.02638603,0.033090558],"genre_scores_gemma":[0.42861837,0.0005985282,0.5443048,0.00035082042,0.00013055721,0.00077704637,0.003540369,0.0059296414,0.015749848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965143,0.00014468555,0.000016697788,0.000035170393,0.00010673043,0.000045275592],"domain_scores_gemma":[0.99941134,0.00034208002,0.000025511597,0.00005559612,0.00011739846,0.000048144542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952182,0.0014619721,0.0011994273,0.00059988507,0.00049838383,0.00084354694,0.0019410574,0.001249268,0.018384438],"category_scores_gemma":[0.0018255278,0.0008359541,0.0009784629,0.0008103708,0.0003896343,0.0007672525,0.000991367,0.0016761075,0.002468529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013025224,0.000102811464,0.000253805,0.00009938275,0.000059435446,0.00005065316,0.000024304929,0.9468693,0.00090767024,0.0055497787,0.013918182,0.03203437],"study_design_scores_gemma":[0.000013890166,0.000006271479,0.00002255362,0.0000022841216,0.0000023385176,0.0000042541765,0.000001568142,0.9980837,0.00019462574,0.0006743296,0.0009909791,0.000003135203],"about_ca_topic_score_codex":0.013616884,"about_ca_topic_score_gemma":0.01338759,"teacher_disagreement_score":0.018384438,"about_ca_system_score_codex":0.0007437482,"about_ca_system_score_gemma":0.0011003856,"threshold_uncertainty_score":0.06150204},"labels":[],"label_agreement":null},{"id":"W3042790181","doi":"10.1007/978-3-030-58545-7_4","title":"AUTO3D: Novel View Synthesis Through Unsupervisely Learned Variational Viewpoint and Global 3D Representation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Fundamental Research Funds for the Central Universities; Virginia Agricultural Experiment Station, Virginia Polytechnic Institute and State University; National Institutes of Health; Hong Kong Government; National Natural Science Foundation of China","keywords":"Computer science; Hallucinating; View synthesis; Artificial intelligence; Computer vision; Invariant (physics); Representation (politics); Image stitching; Pose; Rotation (mathematics); Pattern recognition (psychology); Rendering (computer graphics); Mathematics","score_opus":0.04410303762315976,"score_gpt":0.3054155531957019,"score_spread":0.26131251557254215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042790181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017185773,0.00009250407,0.99486417,0.00003026156,0.000041226896,0.000015354091,0.00012003303,0.0015222224,0.0015956786],"genre_scores_gemma":[0.0722698,0.0002720017,0.91869295,0.00012417803,0.000053579817,0.000053898082,0.0008899441,0.0016737981,0.005969901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959296,0.000039514132,0.000010184834,0.00011196499,0.00021290485,0.000032549473],"domain_scores_gemma":[0.9998048,0.000058600464,0.000012592064,0.000075701035,0.000028793986,0.000019429363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037120935,0.0010222475,0.0010038476,0.0005117162,0.00022285194,0.0013681895,0.0015154688,0.0010911069,0.009507305],"category_scores_gemma":[0.00065798627,0.00093639025,0.001293445,0.0005377167,0.00058756117,0.0010124868,0.0023593844,0.0015859567,0.0036194972],"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.00027245135,0.00008546116,0.00040911106,0.0002784884,0.0002153053,0.0003081225,0.00019844653,0.16877657,0.099373534,0.04371863,0.024442796,0.6619212],"study_design_scores_gemma":[0.000028033766,0.000054850923,0.00015558749,0.000020461626,0.000024597075,0.00037203595,0.000032333635,0.9457591,0.01819334,0.01578742,0.019545157,0.000027103191],"about_ca_topic_score_codex":0.0017271545,"about_ca_topic_score_gemma":0.0038146335,"teacher_disagreement_score":0.009507305,"about_ca_system_score_codex":0.00038026678,"about_ca_system_score_gemma":0.00049621705,"threshold_uncertainty_score":0.031805098},"labels":[],"label_agreement":null},{"id":"W3042797956","doi":"10.1007/978-3-030-51517-1","title":"The Impact of Digital Technologies on Public Health in Developed and Developing Countries","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Health and mHealth Applications","field":"Health Professions","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Health informatics; Informatics; Public health; Digital health; Data science; Internet of Things; Telecommunications; World Wide Web; Political science; Health care; Medicine; Engineering; Electrical engineering","score_opus":0.07013686746012007,"score_gpt":0.4089613198379981,"score_spread":0.33882445237787806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042797956","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020094296,0.30058363,0.0011864409,0.06187459,0.0041306294,0.00006403998,0.0019621386,0.00020107967,0.6099031],"genre_scores_gemma":[0.20037843,0.6373494,0.0023356485,0.01160171,0.002664373,0.00009301623,0.0010064386,0.000097118565,0.14447387],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993274,0.0001965906,0.000023821822,0.000048006903,0.00023722353,0.0001670076],"domain_scores_gemma":[0.9989906,0.0006622186,0.0000862099,0.000029235369,0.000114622664,0.000117205986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008611086,0.0004127802,0.00031757087,0.0015317795,0.0009487948,0.0060752956,0.00026635925,0.00090198073,0.024555704],"category_scores_gemma":[0.0018586399,0.00021762493,0.00033570168,0.005301063,0.0015989945,0.0024300204,0.0025105462,0.001087663,0.0026263962],"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.00007468859,0.00009387456,0.009448585,0.001879944,0.00004920263,0.000510476,0.002832807,0.00084775646,0.0008635051,0.0903925,0.2919303,0.60107636],"study_design_scores_gemma":[0.000007063197,0.000059343885,0.020349318,0.001406254,0.000025002335,0.0003320721,0.004263331,0.00011967314,0.00026826057,0.009254524,0.9638999,0.000015148147],"about_ca_topic_score_codex":0.0076704244,"about_ca_topic_score_gemma":0.0123608215,"teacher_disagreement_score":0.024555704,"about_ca_system_score_codex":0.0026727899,"about_ca_system_score_gemma":0.0039763055,"threshold_uncertainty_score":0.08214706},"labels":[],"label_agreement":null},{"id":"W3043125119","doi":"10.1007/978-3-030-55304-3_1","title":"Lattice Blind Signatures with Forward Security","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer security; Computer science; Blind signature; Digital signature; Key (lock); Electronic voting; Encryption; Public-key cryptography; Voting; Hash function; Law; Political science","score_opus":0.01681857118055318,"score_gpt":0.2632167991532807,"score_spread":0.24639822797272753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043125119","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.03528429,0.00091761275,0.87250197,0.0068342392,0.001734153,0.00023322074,0.00080343493,0.0025767453,0.07911433],"genre_scores_gemma":[0.73169124,0.00092899124,0.19735646,0.0022370454,0.0017977966,0.0004971406,0.0007084395,0.0007365657,0.06404632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99175316,0.0025380584,0.00046287072,0.0010366987,0.0031349834,0.0010742245],"domain_scores_gemma":[0.992014,0.0031049564,0.0006011182,0.0024592895,0.0011950479,0.0006257009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037804458,0.0014836744,0.0022684075,0.0021609068,0.0037415917,0.0074404133,0.0019505472,0.0036541633,0.015087855],"category_scores_gemma":[0.011580386,0.0010140897,0.0016334227,0.0027155676,0.006256043,0.01271332,0.008949624,0.008311246,0.009208444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004570045,0.000081281745,0.00008685118,0.000077923985,0.000015494323,0.00005579943,0.00010249833,0.0054231132,0.0016624718,0.9662653,0.0050612525,0.02071098],"study_design_scores_gemma":[0.000051711526,0.000024569732,0.000013000865,0.000013434295,0.000006800642,0.000059965598,0.000020105412,0.012424309,0.0022990224,0.9812077,0.0038541714,0.000025135098],"about_ca_topic_score_codex":0.0005782854,"about_ca_topic_score_gemma":0.00038586714,"teacher_disagreement_score":0.015087855,"about_ca_system_score_codex":0.0029112024,"about_ca_system_score_gemma":0.003385033,"threshold_uncertainty_score":0.05047387},"labels":[],"label_agreement":null},{"id":"W3043292641","doi":"10.1007/978-3-030-65414-6_27","title":"AutoCount: Unsupervised Segmentation and Counting of Organs in Field Images","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological 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 Saskatchewan","funders":"","keywords":"Benchmark (surveying); Artificial intelligence; Computer science; Segmentation; Pattern recognition (psychology); Annotation; Deep learning; Field (mathematics); Convolutional neural network; Task (project management); Range (aeronautics); Computer vision; Mathematics; Cartography","score_opus":0.015280956583062397,"score_gpt":0.23298116016304682,"score_spread":0.21770020357998443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043292641","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.032166816,0.0006406175,0.89539886,0.00015879275,0.0001572514,0.000295016,0.004118249,0.065178774,0.001885637],"genre_scores_gemma":[0.06504937,0.0002751494,0.916777,0.0001294617,0.00011909658,0.00033362894,0.008396948,0.0042664064,0.0046529565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833316,0.00017093713,0.000091934264,0.00058980816,0.00058923895,0.00022505289],"domain_scores_gemma":[0.9977477,0.00074778026,0.00019306861,0.0006799166,0.00048426387,0.00014733958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015270298,0.0026376797,0.0029314095,0.006981918,0.001283567,0.0029823412,0.0054458827,0.0024141828,0.008906058],"category_scores_gemma":[0.0029669069,0.002257871,0.0019875234,0.004702519,0.0011118604,0.002924313,0.0034801401,0.0012269919,0.005508446],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000852501,0.00025823817,0.0044290107,0.0007690267,0.00040528545,0.00027283767,0.00021371673,0.021210179,0.100767136,0.004265165,0.044400383,0.8221565],"study_design_scores_gemma":[0.00017277343,0.00016358608,0.007914932,0.00006700434,0.00012699873,0.0008829754,0.00015789247,0.8739982,0.086005464,0.014060105,0.016346414,0.00010366133],"about_ca_topic_score_codex":0.0074949227,"about_ca_topic_score_gemma":0.017242147,"teacher_disagreement_score":0.008906058,"about_ca_system_score_codex":0.0011676624,"about_ca_system_score_gemma":0.002154284,"threshold_uncertainty_score":0.02979374},"labels":[],"label_agreement":null},{"id":"W3044911731","doi":"10.1007/978-3-030-58539-6_33","title":"A Unifying Mutual Information View of Metric Learning: Cross-Entropy vs. Pairwise Losses","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"","funders":"","keywords":"Pairwise comparison; Mutual information; Cross entropy; Entropy (arrow of time); Upper and lower bounds; Heuristics; Discriminative model; Computer science; Mathematics; Metric (unit); Mathematical optimization; Artificial intelligence; Principle of maximum entropy; Engineering","score_opus":0.023296499425095516,"score_gpt":0.28304484349496034,"score_spread":0.2597483440698648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044911731","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.008272121,0.0017330629,0.9859927,0.00072222657,0.00010028041,0.000032186075,0.000106270956,0.00009051126,0.002950703],"genre_scores_gemma":[0.69530517,0.005890435,0.28860846,0.00076675124,0.0019173488,0.00039498243,0.0007357937,0.0003855697,0.005995445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303246,0.0038533816,0.0003467081,0.0006792761,0.0018532011,0.00023493115],"domain_scores_gemma":[0.9908269,0.0054428442,0.0006934949,0.0017108958,0.0009984183,0.00032750974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008223846,0.0021768596,0.0024174545,0.002269962,0.00055073074,0.0037818698,0.0031882506,0.0023961894,0.0017634949],"category_scores_gemma":[0.020957282,0.00061193196,0.0013372838,0.0021004474,0.0029100538,0.0102818115,0.004675647,0.0043447986,0.0004953626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018289612,0.000115725874,0.0011815842,0.0002696387,0.00020415719,0.00010675268,0.0001582431,0.12140863,0.002709519,0.7464732,0.0034986073,0.12369109],"study_design_scores_gemma":[0.000015023605,0.00016319708,0.00038086736,0.000041096486,0.000041431605,0.00010420147,0.000023914237,0.46351475,0.0012759116,0.53247064,0.0019314162,0.00003746684],"about_ca_topic_score_codex":0.0007032208,"about_ca_topic_score_gemma":0.0005497791,"teacher_disagreement_score":0.008223846,"about_ca_system_score_codex":0.0012265746,"about_ca_system_score_gemma":0.0011014285,"threshold_uncertainty_score":0.043492377},"labels":[],"label_agreement":null},{"id":"W3045319909","doi":"10.1007/978-3-030-53262-8_19","title":"Quasi-Separable Dantzig-Wolfe Reformulations for Network Design","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fiscal Policy and Economic Growth","field":"Economics, Econometrics and Finance","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":"Computer Research Institute of Montréal; Université de Montréal","funders":"","keywords":"Separable space; Mathematical optimization; Network planning and design; Regular polygon; Lagrangian; Computer science; Flow network; Dual (grammatical number); Flow (mathematics); Property (philosophy); Mathematics; Mathematical economics; Applied mathematics; Telecommunications","score_opus":0.0645976897153378,"score_gpt":0.24314099318864613,"score_spread":0.17854330347330832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045319909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067389878,0.0004664267,0.9739826,0.0011880844,0.000105162566,0.000049101367,0.00016835246,0.00007447881,0.017226867],"genre_scores_gemma":[0.4904048,0.0031441834,0.42956156,0.0012169484,0.0006969568,0.0014661816,0.00077928347,0.00042659853,0.07230344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817705,0.0011815919,0.00006406977,0.00017927133,0.00027437447,0.00012368182],"domain_scores_gemma":[0.9928556,0.00557278,0.00029258023,0.0005700377,0.00053589785,0.00017306047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046597365,0.0012770254,0.0011656076,0.0010417342,0.00083280134,0.0024783127,0.0022914177,0.0025978805,0.014384087],"category_scores_gemma":[0.017806366,0.00078303047,0.0011610946,0.0014750081,0.001959896,0.00522693,0.0019621004,0.0037718748,0.0018308312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014845321,0.000016890983,0.00004900426,0.00003248691,0.0000090217545,0.000013197622,0.000035886867,0.025733976,0.00011118902,0.96313417,0.0025032773,0.008346096],"study_design_scores_gemma":[0.000017392871,0.000010452461,0.000028786146,0.000014568574,0.0000068261406,0.000015356884,0.000012229258,0.15190478,0.00008623207,0.84612685,0.0017711575,0.0000053675553],"about_ca_topic_score_codex":0.0012932984,"about_ca_topic_score_gemma":0.0017386575,"teacher_disagreement_score":0.014384087,"about_ca_system_score_codex":0.0025162701,"about_ca_system_score_gemma":0.0011892715,"threshold_uncertainty_score":0.048119605},"labels":[],"label_agreement":null},{"id":"W3045487471","doi":"10.1007/978-3-031-23473-6","title":"Advances in Computer Graphics","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Shenzhen University; Xiamen University; Nanjing University; Koç Üniversitesi; Freie Universität Berlin; Université de Genève; Universidad de Oviedo; Korea Advanced Institute of Science and Technology; Shanghai Jiao Tong University; Institute of Software, Chinese Academy of Sciences; Wuhan University; Universidade Federal do Rio Grande do Sul; Chinese University of Hong Kong; Tsinghua University; Université Claude Bernard Lyon 1; Université de Strasbourg; Nanjing University of Science and Technology; University of Crete; National University of Defense Technology; Università degli Studi di Padova; Liverpool John Moores University; Technische Universität Wien; Technische Universiteit Delft; Chinese Academy of Sciences; Università di Bologna; University of Science and Technology of China; Nanyang Technological University; Leibniz-Gemeinschaft; Waseda University; Sejong University; Bournemouth University","keywords":"Computer science; Computer graphics (images); Computer graphics; Graphics","score_opus":0.013988102487113279,"score_gpt":0.28602624759541295,"score_spread":0.27203814510829966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045487471","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024042793,0.16545813,0.15534335,0.0033976107,0.016389662,0.00015426477,0.0007911318,0.0057926476,0.650269],"genre_scores_gemma":[0.01085354,0.07403239,0.052786455,0.001106939,0.0032453204,0.00015023656,0.0010281022,0.0014609604,0.855336],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916303,0.000089102454,0.000035509765,0.00012383953,0.0005275454,0.000061005067],"domain_scores_gemma":[0.99907756,0.00022216715,0.00003379598,0.00021789894,0.0003325951,0.00011583423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007524345,0.0021316814,0.0018742523,0.0031938264,0.0008033361,0.0031138062,0.0015594065,0.0014400465,0.13419065],"category_scores_gemma":[0.0016657701,0.0010303525,0.00090123166,0.0046632346,0.000740106,0.0032015198,0.0026999256,0.0033740478,0.09816083],"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.000035034118,0.000056894194,0.00010826088,0.00048763253,0.000031439562,0.000049315877,0.00007213331,0.0009992839,0.0029409141,0.02865468,0.418569,0.5479953],"study_design_scores_gemma":[0.000010754539,0.00003843698,0.00034106468,0.00022488437,0.00002597487,0.00021221746,0.000024431123,0.0030066422,0.0010891672,0.01220787,0.98280334,0.000015159274],"about_ca_topic_score_codex":0.0009830254,"about_ca_topic_score_gemma":0.0019583558,"teacher_disagreement_score":0.13419065,"about_ca_system_score_codex":0.0006519694,"about_ca_system_score_gemma":0.000809835,"threshold_uncertainty_score":0.44891244},"labels":[],"label_agreement":null},{"id":"W3045524274","doi":"10.1007/978-3-030-58583-9_10","title":"Unsupervised Domain Adaptation in the Dissimilarity Space for Person Re-identification","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Benchmark (surveying); Metric (unit); Pattern recognition (psychology); Domain adaptation; Domain (mathematical analysis); Feature vector; Feature (linguistics); Gradient descent; Adaptation (eye); Representation (politics)","score_opus":0.06383244040056965,"score_gpt":0.29747005504263274,"score_spread":0.2336376146420631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045524274","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.01002911,0.00034913747,0.98810005,0.000054853095,0.00006575563,0.000023385644,0.00010657753,0.00043825744,0.00083284074],"genre_scores_gemma":[0.28143176,0.000866206,0.7050264,0.00014979806,0.00019814688,0.00013045376,0.001577395,0.00046900177,0.010150858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.0002189878,0.00003288533,0.00026871994,0.00019572198,0.000083321975],"domain_scores_gemma":[0.9991412,0.000279155,0.00006079894,0.0002754303,0.00019545002,0.000047945254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080507685,0.0005761006,0.0012427198,0.0009095641,0.00035400936,0.00087585027,0.0011734008,0.00074549887,0.0029582279],"category_scores_gemma":[0.0025590737,0.0003004777,0.00095809327,0.001556659,0.0005450906,0.0011461317,0.0017210706,0.0013355693,0.001950979],"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.00038302774,0.00020139497,0.0014634962,0.00016853905,0.00013838334,0.00010042661,0.00013008321,0.10123484,0.039323036,0.015246214,0.007854289,0.83375627],"study_design_scores_gemma":[0.000009743915,0.000088709756,0.0016359958,0.000015828185,0.00002166715,0.00023778346,0.000066534696,0.97092855,0.009336926,0.0130054,0.004624453,0.000028410832],"about_ca_topic_score_codex":0.0019809627,"about_ca_topic_score_gemma":0.0023787064,"teacher_disagreement_score":0.0029582279,"about_ca_system_score_codex":0.00033920768,"about_ca_system_score_gemma":0.00043968216,"threshold_uncertainty_score":0.009896278},"labels":[],"label_agreement":null},{"id":"W3045554800","doi":"10.1007/978-3-030-59137-3_41","title":"A New Local Radon Descriptor for Content-Based Image Search","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Computer science; Discriminative model; Local binary patterns; Radon; Histogram; Content-based image retrieval; Computer vision; Pattern recognition (psychology); Image retrieval; Image (mathematics); Process (computing); Convolution (computer science); Artificial neural network","score_opus":0.06914832276394707,"score_gpt":0.3053729898458533,"score_spread":0.23622466708190626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045554800","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.007305116,0.00090975256,0.9892861,0.00007597049,0.000105627485,0.0000746567,0.00029133132,0.0010841276,0.0008674022],"genre_scores_gemma":[0.18587178,0.0018915149,0.80176735,0.00027707423,0.00035132046,0.00029532437,0.0024272446,0.0005688185,0.0065496997],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990074,0.00013457554,0.00006655076,0.0001668828,0.00052636804,0.00009821749],"domain_scores_gemma":[0.9993241,0.0001503047,0.000064480475,0.00016189301,0.00024700997,0.00005237568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006855629,0.0006255079,0.002080245,0.0024917,0.00035956778,0.0013995375,0.0014314756,0.0010152527,0.0043653925],"category_scores_gemma":[0.0020983208,0.0003438116,0.0010678626,0.0032016174,0.0005478865,0.0020323629,0.0014088604,0.0009756804,0.0031921584],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006198218,0.0002462588,0.000897375,0.00038688743,0.00009911096,0.00014114009,0.00006120474,0.015217486,0.14748883,0.019938882,0.01285018,0.8020529],"study_design_scores_gemma":[0.00011359705,0.00064842147,0.0021220702,0.000061777726,0.0002031768,0.0016849316,0.00011436361,0.8704393,0.08271645,0.012406969,0.029342387,0.00014662692],"about_ca_topic_score_codex":0.0019235673,"about_ca_topic_score_gemma":0.002312886,"teacher_disagreement_score":0.0043653925,"about_ca_system_score_codex":0.0005301423,"about_ca_system_score_gemma":0.00097437983,"threshold_uncertainty_score":0.014603674},"labels":[],"label_agreement":null},{"id":"W3045686195","doi":"10.1007/978-3-030-00928-1_100","title":"Correction to: Medical Image Computing and Computer Assisted Intervention – MICCAI 2018","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","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":"Queen's University","funders":"","keywords":"Computer science; Section (typography); Special section; Information retrieval; Data science; Library science; Operating system; Engineering physics; Engineering","score_opus":0.010067475647963123,"score_gpt":0.24951829252639268,"score_spread":0.23945081687842956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045686195","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010994697,0.019558273,0.020035556,0.043651644,0.8577662,0.00016712965,0.0018721696,0.00501085,0.05083869],"genre_scores_gemma":[0.014443807,0.021024978,0.01976494,0.013810231,0.16589896,0.0002677496,0.002967315,0.0050258758,0.75679606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982651,0.00021126497,0.00023187499,0.000296904,0.00084470375,0.00015031247],"domain_scores_gemma":[0.991544,0.0011096644,0.0005093238,0.0009876427,0.005249205,0.00060017075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014466577,0.0022314824,0.0019631474,0.004003625,0.001326992,0.003715178,0.0019797913,0.0035742312,0.20557825],"category_scores_gemma":[0.012871731,0.00082147704,0.0011687413,0.0021198338,0.001399591,0.00246562,0.002048587,0.00458168,0.10883734],"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.00004078014,0.000006546188,0.000050009497,0.00017238728,0.000010452223,0.00008239598,0.00000771125,0.00013573794,0.0002821757,0.0017886328,0.9562681,0.041154984],"study_design_scores_gemma":[0.000014609058,0.000020887332,0.00048690286,0.00016563304,0.000013302003,0.00069238665,0.00001826493,0.0010087141,0.0010752867,0.0027968658,0.9936824,0.000024829644],"about_ca_topic_score_codex":0.0033908726,"about_ca_topic_score_gemma":0.007909136,"teacher_disagreement_score":0.20557825,"about_ca_system_score_codex":0.0016485143,"about_ca_system_score_gemma":0.002772716,"threshold_uncertainty_score":0.6877278},"labels":[],"label_agreement":null},{"id":"W3046278280","doi":"10.1007/978-3-030-54407-2_5","title":"Semantic Learning for Image Compression (SLIC)","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Image compression; Compression (physics); Artificial intelligence; Image (mathematics); Data compression; Computer vision; Image processing","score_opus":0.0223752880543376,"score_gpt":0.2680967905953072,"score_spread":0.2457215025409696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046278280","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.008179957,0.009015922,0.9651237,0.00042074657,0.00037624873,0.000070465445,0.00039829483,0.0037609215,0.01265371],"genre_scores_gemma":[0.15445262,0.008076406,0.8081615,0.00041090697,0.0006604238,0.00017853844,0.0024067548,0.0007485417,0.024904326],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997185,0.000037392314,0.000016522565,0.00006275019,0.00013414296,0.0000305599],"domain_scores_gemma":[0.99976605,0.00006099434,0.000015292668,0.000076872355,0.00006788426,0.000012918616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044626495,0.00065992144,0.0006579772,0.0010022488,0.00025135162,0.0008851151,0.00075174356,0.000574896,0.008556668],"category_scores_gemma":[0.0007152276,0.0002479389,0.0005680559,0.0017591596,0.0006084359,0.0011743954,0.0009275542,0.0011196663,0.0024960046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008634769,0.000047826226,0.00014350434,0.00019207985,0.0000317656,0.000029699348,0.000030627383,0.011673454,0.010919318,0.034242272,0.015870446,0.92673266],"study_design_scores_gemma":[0.000047708196,0.0002802663,0.001467227,0.00015406829,0.00007868189,0.0006686906,0.00006937134,0.67260236,0.06021211,0.17247163,0.091889784,0.000058107926],"about_ca_topic_score_codex":0.0023014084,"about_ca_topic_score_gemma":0.0026295807,"teacher_disagreement_score":0.008556668,"about_ca_system_score_codex":0.00053795974,"about_ca_system_score_gemma":0.00072932156,"threshold_uncertainty_score":0.028624892},"labels":[],"label_agreement":null},{"id":"W3046361972","doi":"10.1007/978-3-030-54407-2_33","title":"Level Sets Driven by Adaptive Hybrid Region-Based Energy for Medical Image Segmentation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Alberta","funders":"","keywords":"Computer science; Image segmentation; Segmentation; Energy (signal processing); Artificial intelligence; Level set (data structures); Image (mathematics); Region growing; Computer vision; Set (abstract data type); Intensity (physics); Pattern recognition (psychology); Scale-space segmentation; Mathematics; Optics; Statistics; Physics","score_opus":0.028193920657566256,"score_gpt":0.28086967898808535,"score_spread":0.2526757583305191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046361972","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.0037683563,0.00022078677,0.9948026,0.00005850596,0.00002729814,0.00002268039,0.000028973269,0.00024192277,0.00082903326],"genre_scores_gemma":[0.23260142,0.00058142544,0.7599599,0.00019482187,0.00006335934,0.00021892194,0.00023606878,0.00061985245,0.0055242344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973506,0.00006157543,0.000016599235,0.000038921975,0.00012875126,0.000019109482],"domain_scores_gemma":[0.99964166,0.00020770852,0.000028802771,0.00003780807,0.00007147945,0.000012439475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056461664,0.0004680623,0.0008969312,0.00063558517,0.00022196089,0.0010001151,0.001427241,0.0011215706,0.0029019709],"category_scores_gemma":[0.0013904738,0.0006623827,0.0011036636,0.0008572805,0.00044939553,0.00081074995,0.00097243825,0.0010589891,0.0007742462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017786167,0.00007998724,0.00025861475,0.00021653765,0.00012517617,0.00008527794,0.00008836875,0.7521406,0.03689101,0.018762665,0.0024332902,0.18874061],"study_design_scores_gemma":[0.0000028603276,0.000011476401,0.00006866842,0.000006160169,0.0000070821475,0.000022207436,0.0000028152574,0.99513453,0.0019049958,0.0022704992,0.0005633926,0.000005293792],"about_ca_topic_score_codex":0.0015197658,"about_ca_topic_score_gemma":0.0018604685,"teacher_disagreement_score":0.0029019709,"about_ca_system_score_codex":0.00068574026,"about_ca_system_score_gemma":0.00054954283,"threshold_uncertainty_score":0.009708047},"labels":[],"label_agreement":null},{"id":"W3046363932","doi":"10.1007/978-3-030-54407-2_21","title":"Remote Photoplethysmography (rPPG) for Contactless Heart Rate Monitoring Using a Single Monochrome and Color Camera","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Non-Invasive Vital Sign Monitoring","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 Ottawa","funders":"","keywords":"Grayscale; Photoplethysmogram; Computer science; Artificial intelligence; Computer vision; Digital camera; Monochrome; Video camera; Filter (signal processing); Pixel","score_opus":0.02828025687407634,"score_gpt":0.24521755973438286,"score_spread":0.21693730286030652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046363932","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.014000493,0.024421323,0.75296956,0.0004983029,0.0016614114,0.00043656834,0.0008921669,0.0072370493,0.1978831],"genre_scores_gemma":[0.07394529,0.020064631,0.29805264,0.0012541834,0.00093812373,0.00044742684,0.0010995736,0.0012494106,0.60294867],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982846,0.000017832801,0.000006200161,0.000042696007,0.000094097486,0.000010788283],"domain_scores_gemma":[0.9999144,0.00003866028,0.0000055135756,0.000016968052,0.00001606653,0.000008390266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017152018,0.0007168616,0.0004552643,0.0005468868,0.00016806522,0.0005205671,0.0010406784,0.0006625639,0.044159167],"category_scores_gemma":[0.00020595733,0.00030268903,0.00039506247,0.00046183428,0.00015016107,0.00068592915,0.00059764314,0.0007471271,0.030587776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008376708,0.000100899095,0.00019662686,0.00057313975,0.00001837397,0.0002905862,0.000057174435,0.00031422664,0.21107993,0.0034453166,0.027136551,0.7567034],"study_design_scores_gemma":[0.000066794884,0.0011804539,0.008596114,0.0004182732,0.00013132043,0.017375134,0.000071759816,0.013244024,0.23379663,0.004376484,0.72061855,0.00012445672],"about_ca_topic_score_codex":0.00023117758,"about_ca_topic_score_gemma":0.0007612435,"teacher_disagreement_score":0.044159167,"about_ca_system_score_codex":0.0001271361,"about_ca_system_score_gemma":0.0001812471,"threshold_uncertainty_score":0.14772713},"labels":[],"label_agreement":null},{"id":"W3046369427","doi":"10.1007/978-3-030-54407-2_20","title":"Assessing the Capability of Deep-Learning Models in Parkinson’s Disease Diagnosis","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Medical diagnosis; Disease; Parkinson's disease; Computer science; Machine learning; Magnetic resonance imaging; Artificial intelligence; Medicine; Pathology; Radiology","score_opus":0.034711215445524475,"score_gpt":0.28489980943572296,"score_spread":0.2501885939901985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046369427","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.84524304,0.011540201,0.123950295,0.002894612,0.0007871519,0.0001267486,0.0030863804,0.0026687032,0.009702914],"genre_scores_gemma":[0.9785044,0.00071122317,0.016543958,0.00017219399,0.00007143259,0.000020922937,0.0020626883,0.000041402378,0.0018717017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925655,0.00028665605,0.00006173184,0.00015483222,0.00014444535,0.00009579285],"domain_scores_gemma":[0.9921374,0.0063187974,0.00020864671,0.000352901,0.0006877028,0.0002945153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030942115,0.0011357421,0.0005921171,0.00072777085,0.00020300553,0.0010999297,0.0007641183,0.002390067,0.0014656865],"category_scores_gemma":[0.011819552,0.00026609705,0.0005566425,0.00038560125,0.00033146472,0.001195133,0.0009520448,0.0012384923,0.0007897764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025878977,0.0007139658,0.048939764,0.00035512805,0.0005870963,0.00024351632,0.00010927687,0.5831971,0.0057254485,0.0015651572,0.011235747,0.34473994],"study_design_scores_gemma":[0.000021533235,0.00027176246,0.0033807324,0.000042051128,0.00005971685,0.00007083528,0.000035863013,0.9914061,0.002895433,0.0013539628,0.00044882673,0.00001328161],"about_ca_topic_score_codex":0.0068410686,"about_ca_topic_score_gemma":0.004852531,"teacher_disagreement_score":0.0068410686,"about_ca_system_score_codex":0.0005511763,"about_ca_system_score_gemma":0.0007993878,"threshold_uncertainty_score":0.016363919},"labels":[],"label_agreement":null},{"id":"W3046431518","doi":"10.1007/978-3-030-54407-2_35","title":"Fingerprint Liveness Detection Based on Multi-modal Fine-Grained Feature Fusion","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","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 Windsor","funders":"","keywords":"Liveness; Computer science; Fingerprint (computing); Modal; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Fingerprint recognition; Fusion; Biometrics; Computer vision; Theoretical computer science","score_opus":0.022986774298710353,"score_gpt":0.24775437194198766,"score_spread":0.2247675976432773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046431518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10164304,0.00090070703,0.8931436,0.00013807403,0.00010271933,0.00006685687,0.0002557934,0.0012523099,0.002497038],"genre_scores_gemma":[0.7866772,0.00070329726,0.20852956,0.00013834672,0.00009119549,0.00005625554,0.00039218744,0.000071716204,0.003340345],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995906,0.00004610874,0.00001818694,0.000117547126,0.000171102,0.000056456287],"domain_scores_gemma":[0.999622,0.00008688692,0.00005953028,0.000085032014,0.00012207637,0.000024429453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036775816,0.0004947386,0.000839162,0.0011718124,0.00023797016,0.00060411403,0.00064373895,0.00074361963,0.0016965896],"category_scores_gemma":[0.0008677023,0.00024136047,0.0004989057,0.0009373981,0.00030631752,0.0013817259,0.00089578837,0.0005234987,0.00096413837],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005069656,0.00016395318,0.0036315767,0.0001796339,0.000074122174,0.00016223805,0.00006702769,0.009215273,0.41461346,0.0012105856,0.0013682846,0.5688069],"study_design_scores_gemma":[0.000031615553,0.00065043836,0.028355831,0.000050621053,0.00019672308,0.002124097,0.000112573005,0.7409622,0.21944673,0.003998344,0.0039297296,0.00014111123],"about_ca_topic_score_codex":0.00038503887,"about_ca_topic_score_gemma":0.00063589995,"teacher_disagreement_score":0.0016965896,"about_ca_system_score_codex":0.00018005873,"about_ca_system_score_gemma":0.00019370456,"threshold_uncertainty_score":0.0056756735},"labels":[],"label_agreement":null},{"id":"W3046468283","doi":"10.1007/978-3-030-54407-2_39","title":"Poisson Surface Reconstruction from LIDAR for Buttress Root Volume Estimation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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 Alberta","funders":"","keywords":"Buttress; Lidar; Tree (set theory); Volume (thermodynamics); Computer science; Poisson distribution; Ranging; Remote sensing; Mathematics; Geology; Geography; Statistics; Telecommunications","score_opus":0.011728637574327504,"score_gpt":0.22496210966352234,"score_spread":0.21323347208919483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046468283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067767934,0.00020113461,0.99061966,0.000033768156,0.00003600207,0.00001517609,0.000080819394,0.00076733954,0.001469239],"genre_scores_gemma":[0.22526446,0.00064289337,0.76402485,0.00009955642,0.000088601366,0.000062225045,0.0011432432,0.0007056124,0.0079685785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951243,0.000058078775,0.000018657069,0.000090595815,0.00028335355,0.000036808102],"domain_scores_gemma":[0.99956983,0.00014128492,0.000031899755,0.00009772511,0.00014657341,0.000012595962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040826356,0.00064869586,0.0006740633,0.0006739056,0.00023472187,0.0010666527,0.0013837643,0.0008735354,0.0024957089],"category_scores_gemma":[0.0014922916,0.00064512,0.00070284994,0.0008263466,0.0002721284,0.0011416847,0.0009931201,0.0009287131,0.0024277386],"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.0001237381,0.00007804518,0.0026010296,0.00019109997,0.00007208204,0.000191352,0.00013373807,0.17842184,0.091910616,0.016357044,0.006351912,0.7035676],"study_design_scores_gemma":[0.0000024581177,0.000014598651,0.0005821628,0.000008035137,0.000008971857,0.000146436,0.000018275345,0.9764124,0.016367141,0.003455463,0.002969853,0.000014228591],"about_ca_topic_score_codex":0.0013246345,"about_ca_topic_score_gemma":0.0018964697,"teacher_disagreement_score":0.0024957089,"about_ca_system_score_codex":0.0003450344,"about_ca_system_score_gemma":0.00045194564,"threshold_uncertainty_score":0.008348942},"labels":[],"label_agreement":null},{"id":"W3046510065","doi":"10.1007/978-3-030-85947-3_19","title":"Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Infimum and supremum; Combinatorics; Conjecture; Lattice (music); Matching (statistics); Mathematics; Cardinality (data modeling); Stable marriage problem; Girl; Stochastic game; Mathematical economics; Discrete mathematics; Computer science; Statistics; Psychology","score_opus":0.0933094145277734,"score_gpt":0.2900169059499457,"score_spread":0.1967074914221723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046510065","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.5903595,0.00047154198,0.36989167,0.009782787,0.00015437022,0.00016670069,0.00032817063,0.0005557813,0.028289445],"genre_scores_gemma":[0.94377744,0.00017967603,0.051764887,0.00044826255,0.00007487705,0.00011663766,0.00015824585,0.00011018626,0.0033697565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958002,0.0019859432,0.00022334204,0.00072812923,0.00065873156,0.00060374854],"domain_scores_gemma":[0.9796759,0.011927731,0.0023425466,0.00257813,0.0011872762,0.0022884703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00497732,0.00037290546,0.0013683328,0.00063919113,0.0017671603,0.0033414725,0.0016269386,0.0018262977,0.009672418],"category_scores_gemma":[0.04366369,0.0006371958,0.0006864141,0.00084117305,0.0032771698,0.008129798,0.0019566622,0.0020302352,0.0015211985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017905626,0.0004870044,0.015427721,0.00032564733,0.00015549922,0.00033893192,0.0011365208,0.07519235,0.011336445,0.7510322,0.008888523,0.1338886],"study_design_scores_gemma":[0.00021332079,0.00034080926,0.0019191046,0.00004123381,0.000036859776,0.00034800902,0.0008530476,0.21168852,0.003508404,0.7773928,0.0036113814,0.000046502737],"about_ca_topic_score_codex":0.0013841458,"about_ca_topic_score_gemma":0.0017722102,"teacher_disagreement_score":0.009672418,"about_ca_system_score_codex":0.0015390745,"about_ca_system_score_gemma":0.0022410452,"threshold_uncertainty_score":0.032357514},"labels":[],"label_agreement":null},{"id":"W3046528107","doi":"10.1007/978-3-030-54407-2_31","title":"Human Body Fall Recognition System","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Falling (accident); Artificial intelligence; Computer vision; Pattern recognition (psychology)","score_opus":0.03764273890207143,"score_gpt":0.2533086433848125,"score_spread":0.2156659044827411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046528107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1630066,0.0044039506,0.70778686,0.0007430827,0.0016332259,0.0011616206,0.009932197,0.06230989,0.04902255],"genre_scores_gemma":[0.5498431,0.0022593644,0.27962914,0.001636742,0.00045961194,0.00109313,0.019079804,0.0007508818,0.14524822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980253,0.000011766958,0.000010952687,0.00007633542,0.00007714903,0.00002130152],"domain_scores_gemma":[0.9998776,0.000010429439,0.000009550923,0.000017384082,0.00006640229,0.00001868244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001843425,0.00065871654,0.0008381846,0.00090742647,0.00036390894,0.00044241073,0.00073210243,0.0006988698,0.013514986],"category_scores_gemma":[0.00025617026,0.0002031126,0.00036414873,0.00047749325,0.000102091115,0.00035134933,0.0005586934,0.00035976153,0.010929696],"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.0009704521,0.0003544526,0.005153499,0.00023029889,0.00007619508,0.000301717,0.000038844555,0.0019675377,0.09240133,0.00037268893,0.042180244,0.8559528],"study_design_scores_gemma":[0.00055517076,0.0028331398,0.13423224,0.00032831117,0.0007165179,0.008930736,0.00024378013,0.431189,0.2502308,0.003327981,0.16708694,0.0003254119],"about_ca_topic_score_codex":0.0019927847,"about_ca_topic_score_gemma":0.0034826316,"teacher_disagreement_score":0.013514986,"about_ca_system_score_codex":0.0001840106,"about_ca_system_score_gemma":0.00034165249,"threshold_uncertainty_score":0.04521215},"labels":[],"label_agreement":null},{"id":"W3046576094","doi":"10.1007/978-3-030-54407-2_15","title":"Homography-Based Vehicle Pose Estimation from a Single Image by Using Machine-Learning for Wheel-Region and Tire-Road Contact Point Detection","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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 Regina","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Homography; Vanishing point; Robustness (evolution); Metric (unit); Flagging; Machine vision; Truck; Image (mathematics); Automotive engineering; Engineering","score_opus":0.009516551168784543,"score_gpt":0.20134953893227883,"score_spread":0.19183298776349428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046576094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022978889,0.00039126317,0.9727394,0.000029668961,0.000047330996,0.00003984438,0.00015572074,0.0017667867,0.0018510399],"genre_scores_gemma":[0.4304684,0.0008290326,0.5559017,0.00008938996,0.00008374489,0.00010328519,0.0009772393,0.0003049346,0.011242321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978226,0.000014623906,0.0000074749464,0.00007979947,0.00008351986,0.000032259373],"domain_scores_gemma":[0.9998318,0.00003358701,0.000017603614,0.00004008385,0.000067168105,0.000009599723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001873235,0.0006329806,0.00089757104,0.00081322016,0.00025582223,0.000513495,0.000819134,0.0005813451,0.0038145047],"category_scores_gemma":[0.0003836789,0.00046873876,0.0005630015,0.00103382,0.00025713805,0.0008943924,0.0006206595,0.0005106352,0.0029995407],"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.00008138921,0.000090463116,0.00086627336,0.00008068132,0.000052962936,0.000048729107,0.00003572088,0.03814774,0.07732928,0.00062293507,0.0020724789,0.88057137],"study_design_scores_gemma":[0.000008401603,0.00007490225,0.0048991987,0.000013882875,0.000032231983,0.00016000342,0.000029017185,0.95058095,0.040143743,0.0012147652,0.002819345,0.000023471554],"about_ca_topic_score_codex":0.004667703,"about_ca_topic_score_gemma":0.0075082784,"teacher_disagreement_score":0.004667703,"about_ca_system_score_codex":0.00029960577,"about_ca_system_score_gemma":0.00053611,"threshold_uncertainty_score":0.012760818},"labels":[],"label_agreement":null},{"id":"W3046625800","doi":"10.1007/978-3-030-54407-2_1","title":"Fused Geometry Augmented Images for Analyzing Textured Mesh","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Discriminative model; Pattern recognition (psychology); Feature (linguistics); Representation (politics); Convolutional neural network; Feature vector; Inverse; Computer vision; Mathematics; Geometry","score_opus":0.018467686826243588,"score_gpt":0.2521398499695575,"score_spread":0.23367216314331393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046625800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03174009,0.00044936358,0.9608982,0.00006247241,0.00008172117,0.00006186865,0.0005650161,0.0028224958,0.0033186916],"genre_scores_gemma":[0.2711754,0.00084416475,0.72106403,0.00007801394,0.000093233786,0.000086166416,0.0013328169,0.0005478201,0.0047783316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997422,0.00002456744,0.000009259952,0.00004261544,0.00014897688,0.000032324475],"domain_scores_gemma":[0.9997347,0.000058429174,0.000023657578,0.00008858305,0.00008080554,0.000013813641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018328687,0.0006593538,0.0005279442,0.0019679966,0.00017818905,0.0009623895,0.0006576508,0.0006025049,0.0072235353],"category_scores_gemma":[0.00062132854,0.00040262623,0.00060438784,0.0015991125,0.00028571373,0.0008170471,0.00084069464,0.00048562474,0.0018210937],"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.00031181896,0.00006870217,0.0010190438,0.00021049405,0.000078904035,0.00019303535,0.00009469595,0.030485623,0.21752825,0.004395199,0.0045763245,0.7410378],"study_design_scores_gemma":[0.000023045446,0.00012622729,0.0042611277,0.000034007968,0.00008906635,0.00062474137,0.0001400652,0.8799917,0.09951516,0.005199901,0.009953711,0.00004128144],"about_ca_topic_score_codex":0.0013124426,"about_ca_topic_score_gemma":0.0023120532,"teacher_disagreement_score":0.0072235353,"about_ca_system_score_codex":0.00023041993,"about_ca_system_score_gemma":0.00034285747,"threshold_uncertainty_score":0.024165154},"labels":[],"label_agreement":null},{"id":"W3046688479","doi":"10.1007/978-3-030-53291-8_7","title":"Global Guidance for Local Generalization in Model Checking","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Locality; Computer science; Model checking; Heuristics; Generalization; Interpolation (computer graphics); Solver; Theoretical computer science; Satisfiability modulo theories; Formal verification; Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.041737171983816504,"score_gpt":0.3030613982134793,"score_spread":0.26132422622966284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046688479","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.033437595,0.00031526672,0.9505476,0.00033300227,0.000032573953,0.00010789742,0.00012632519,0.010668702,0.004431067],"genre_scores_gemma":[0.45401406,0.0002520919,0.54084176,0.00044680753,0.00004863466,0.00019171192,0.0004340748,0.0021656742,0.0016051804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875916,0.0054534595,0.00093613786,0.0019371954,0.0030881797,0.0009934212],"domain_scores_gemma":[0.97092044,0.0143234655,0.001523886,0.011598262,0.0013212708,0.00031263597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00889616,0.0015506315,0.0013817028,0.0011725929,0.0007708924,0.0027379275,0.0032226082,0.0013571099,0.0036768876],"category_scores_gemma":[0.025232706,0.0010154567,0.0025696296,0.0014568536,0.0039412696,0.006266772,0.006108475,0.004924412,0.0014000576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012980344,0.0003808726,0.011197941,0.0014047686,0.00027062983,0.00038444545,0.0016624578,0.19303237,0.04974285,0.3020402,0.008732885,0.42985266],"study_design_scores_gemma":[0.00017167896,0.0003772779,0.0009133727,0.00027011236,0.00020972431,0.00030552314,0.00022335471,0.70874006,0.07790776,0.19572304,0.015054535,0.000103588645],"about_ca_topic_score_codex":0.0019264633,"about_ca_topic_score_gemma":0.0031938127,"teacher_disagreement_score":0.00889616,"about_ca_system_score_codex":0.0014781422,"about_ca_system_score_gemma":0.0033996352,"threshold_uncertainty_score":0.047047913},"labels":[],"label_agreement":null},{"id":"W3046767631","doi":"10.1007/978-3-030-54407-2_36","title":"Synthetic Aerial Image Generation and Runway Segmentation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","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 Alberta","funders":"","keywords":"Runway; Computer science; Computer vision; Takeoff; Artificial intelligence; Adverse weather; Intersection (aeronautics); SAFER; Segmentation; Orientation (vector space); Point (geometry); Aerospace engineering; Engineering; Geology; Computer security; Cartography","score_opus":0.010452577282404537,"score_gpt":0.22930495247297264,"score_spread":0.2188523751905681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046767631","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.015334213,0.00038616877,0.9638914,0.00012408789,0.00016901303,0.00010684118,0.00084673596,0.00575264,0.0133888405],"genre_scores_gemma":[0.18214914,0.00085823546,0.77903837,0.00012287614,0.00011461008,0.00010619642,0.004840458,0.0013787702,0.031391356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999001,0.000010119986,0.0000033677497,0.000028895685,0.000044393866,0.0000131825445],"domain_scores_gemma":[0.99993134,0.000014862451,0.0000042428687,0.000020171165,0.000025239746,0.000004061595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012582405,0.00059677544,0.00040193886,0.0008076667,0.00021595272,0.0007747171,0.0006107903,0.0005328986,0.008843384],"category_scores_gemma":[0.00024568013,0.0004071413,0.0005206696,0.00091269636,0.0002001472,0.0004963145,0.00039914803,0.00041639383,0.0039826445],"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.00012953804,0.000045859022,0.00046934542,0.00019370962,0.00005830902,0.00023347352,0.00007763922,0.08662269,0.10609906,0.00789412,0.021619508,0.77655673],"study_design_scores_gemma":[0.000024035427,0.00007579174,0.002813554,0.000038370214,0.00004310682,0.00058428966,0.00008767764,0.8448669,0.08383052,0.012123043,0.055474903,0.00003788588],"about_ca_topic_score_codex":0.0020554888,"about_ca_topic_score_gemma":0.004162944,"teacher_disagreement_score":0.008843384,"about_ca_system_score_codex":0.00024412805,"about_ca_system_score_gemma":0.00024712636,"threshold_uncertainty_score":0.02958411},"labels":[],"label_agreement":null},{"id":"W3046886793","doi":"","title":"Materialized views for count aggregates of spatial data","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Aggregate (composite); Online analytical processing; Computer science; Materialized view; Quadtree; Space (punctuation); Spatial analysis; Index (typography); Data mining; Spatial database; Data warehouse; Database; Theoretical computer science; Algorithm; Mathematics; World Wide Web; Statistics","score_opus":0.05278441042897332,"score_gpt":0.3073932149966844,"score_spread":0.2546088045677111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046886793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052654937,0.0012102056,0.936939,0.0003332749,0.00008238923,0.00021711514,0.0013687804,0.0051933005,0.0020009072],"genre_scores_gemma":[0.24755546,0.000664991,0.7458383,0.000116663985,0.00013285532,0.00021736127,0.0037052268,0.0005128696,0.0012561509],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799037,0.00034921188,0.00018175523,0.0003122518,0.0010127772,0.00015356498],"domain_scores_gemma":[0.99479115,0.0013349704,0.00071420934,0.0023188498,0.0006046587,0.00023606385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012112124,0.0007809261,0.0011357627,0.0018720663,0.0006588318,0.0035848867,0.0019414121,0.0007706948,0.002178303],"category_scores_gemma":[0.0065582446,0.0006728038,0.0010066599,0.0038916217,0.00075078965,0.0059798053,0.0029519896,0.0013352355,0.0009170478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011101532,0.00047770003,0.012311877,0.0008276925,0.00036130357,0.00060471543,0.0022025625,0.08901602,0.07191754,0.08659291,0.020127373,0.71445024],"study_design_scores_gemma":[0.00013679397,0.0007986575,0.0036172324,0.000105254214,0.00014486251,0.00090798823,0.0010764133,0.8087566,0.064133,0.07232215,0.047855232,0.0001456963],"about_ca_topic_score_codex":0.0020170799,"about_ca_topic_score_gemma":0.0028631466,"teacher_disagreement_score":0.0035848867,"about_ca_system_score_codex":0.0006885372,"about_ca_system_score_gemma":0.0010962475,"threshold_uncertainty_score":0.0072872043},"labels":[],"label_agreement":null},{"id":"W304693962","doi":"10.1007/978-3-319-13186-3_34","title":"Models for Distributed, Large Scale Data Cleaning","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Computer science; Data quality; Big data; Data mining; Dynamic data; Scale (ratio); Data stream mining; Variety (cybernetics); Distributed computing; Real-time computing; Database; Artificial intelligence","score_opus":0.17030871493081626,"score_gpt":0.3783480416925222,"score_spread":0.20803932676170592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W304693962","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.0014696047,0.0005551538,0.9955706,0.0005142321,0.00007658926,0.00003069954,0.0002430592,0.000463343,0.0010767871],"genre_scores_gemma":[0.24005029,0.003305811,0.72975856,0.00088896375,0.00065618905,0.0010256055,0.0024573335,0.0009247604,0.02093252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792945,0.00090019003,0.00014464445,0.00042775934,0.00045281067,0.00014519812],"domain_scores_gemma":[0.9892757,0.007953207,0.00049104664,0.0012460026,0.0007967301,0.00023729222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042807586,0.0011724137,0.0019093417,0.0008727097,0.0008333764,0.0030400238,0.004388974,0.002231752,0.0074893134],"category_scores_gemma":[0.017726324,0.0010942797,0.0019227307,0.0020008304,0.0011964685,0.004669081,0.0023066248,0.003977892,0.0024484163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001123768,0.000084404266,0.0007402058,0.00021771375,0.0001518247,0.000083546554,0.00011731409,0.7448041,0.00055218296,0.17732045,0.013257139,0.062558696],"study_design_scores_gemma":[0.000013533538,0.000009596249,0.00007205511,0.0000141827295,0.00001651452,0.0000242223,0.000012252329,0.8671008,0.00016174764,0.13017382,0.0023913188,0.000009956846],"about_ca_topic_score_codex":0.0070220185,"about_ca_topic_score_gemma":0.008521091,"teacher_disagreement_score":0.0074893134,"about_ca_system_score_codex":0.0017491773,"about_ca_system_score_gemma":0.0019354114,"threshold_uncertainty_score":0.025054276},"labels":[],"label_agreement":null},{"id":"W3047749157","doi":"10.1007/978-3-030-57602-8_12","title":"The Spherical k-means++ Algorithm via Local Search","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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 New Brunswick","funders":"","keywords":"Unit sphere; Partition (number theory); Combinatorics; Generalization; Cluster analysis; Integer (computer science); Set (abstract data type); Algorithm; Mathematics; Point (geometry); Approximation algorithm; k-means clustering; Computer science; Discrete mathematics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.016940786532604123,"score_gpt":0.2413999742474191,"score_spread":0.224459187714815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047749157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012697345,0.00023319351,0.9947836,0.00005814391,0.00007326452,0.000039026705,0.0000636018,0.0017391582,0.0017404141],"genre_scores_gemma":[0.02383734,0.00023508117,0.9694447,0.00009829434,0.00006922805,0.00016758774,0.00038439367,0.0005698073,0.0051935753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904495,0.000257416,0.000054576485,0.0001999888,0.00037172151,0.00007142548],"domain_scores_gemma":[0.9993315,0.00020193555,0.000039875038,0.00014565443,0.00024250944,0.0000384968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368025,0.001264172,0.0019905544,0.0010793112,0.00088165695,0.0014075374,0.002765625,0.0015565353,0.009308029],"category_scores_gemma":[0.002455594,0.0007621777,0.0014977362,0.0021360167,0.0006633695,0.0014404586,0.0025187237,0.0016348346,0.009257411],"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.00023039347,0.00008571834,0.00027568048,0.00033074955,0.00014666995,0.000053994176,0.00008339303,0.12772828,0.008524031,0.016688539,0.024973024,0.82087946],"study_design_scores_gemma":[0.000047000158,0.000065930384,0.00018294132,0.00002067095,0.000040294217,0.00014901334,0.000029432093,0.97416615,0.0046582753,0.009826913,0.010778907,0.00003451329],"about_ca_topic_score_codex":0.01088701,"about_ca_topic_score_gemma":0.0154608665,"teacher_disagreement_score":0.01088701,"about_ca_system_score_codex":0.0006465218,"about_ca_system_score_gemma":0.002447486,"threshold_uncertainty_score":0.03113848},"labels":[],"label_agreement":null},{"id":"W3047754369","doi":"10.1007/978-3-030-59137-3_21","title":"Forming Local Intersections of Projections for Classifying and Searching Histopathology Images","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Histogram; Benchmark (surveying); Equidistant; Computer science; Intersection (aeronautics); Invariant (physics); Image (mathematics); Mathematics; Geography; Cartography; Geometry","score_opus":0.03894854888260255,"score_gpt":0.31298152556645553,"score_spread":0.27403297668385296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047754369","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.05988081,0.00019520373,0.93613183,0.00011838824,0.000017503315,0.00014171636,0.00020569055,0.0017321411,0.0015766759],"genre_scores_gemma":[0.1912333,0.00022083262,0.8054511,0.000036641217,0.000035265213,0.0001862872,0.0010527631,0.00050508056,0.0012787633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964418,0.0007328178,0.000192354,0.0006638282,0.0015966771,0.00037259609],"domain_scores_gemma":[0.9954721,0.0015070845,0.00041444704,0.0007471025,0.0015560146,0.0003033565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134884,0.0012527884,0.0016894757,0.004080798,0.0013122889,0.0029243922,0.001875738,0.0018114272,0.0050187516],"category_scores_gemma":[0.007061077,0.0011635415,0.0015169666,0.0033145957,0.0012422961,0.0023843653,0.0037531469,0.00216102,0.0023416914],"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.001173803,0.00042578846,0.01329303,0.000569891,0.00021465064,0.0005837406,0.0011537872,0.044478815,0.13008279,0.03276785,0.0060719107,0.76918393],"study_design_scores_gemma":[0.000058339956,0.0005415114,0.006315165,0.000081485654,0.00014657559,0.0014818315,0.0012275458,0.8345927,0.11042948,0.037237614,0.0077901636,0.0000976134],"about_ca_topic_score_codex":0.0014452732,"about_ca_topic_score_gemma":0.002350115,"teacher_disagreement_score":0.0050187516,"about_ca_system_score_codex":0.00063346553,"about_ca_system_score_gemma":0.0015213426,"threshold_uncertainty_score":0.016789377},"labels":[],"label_agreement":null},{"id":"W3047829504","doi":"10.1007/978-3-030-57602-8_37","title":"Computing the One-Visibility Copnumber of Trees","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Algorithm; Mathematics; Combinatorics; Geography; Meteorology","score_opus":0.03476839228761736,"score_gpt":0.29968621143235363,"score_spread":0.2649178191447363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047829504","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.6497097,0.0011804196,0.27827367,0.001552388,0.00035314984,0.00008550263,0.0028376768,0.0019979922,0.06400943],"genre_scores_gemma":[0.8560719,0.0005066824,0.12702104,0.00015596447,0.00023762383,0.0000729602,0.003068456,0.0007795562,0.01208591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990938,0.000117721764,0.000048191065,0.0002938253,0.00027097279,0.00017549997],"domain_scores_gemma":[0.99512947,0.002995775,0.00039088653,0.00072044105,0.00034958767,0.00041389882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078577525,0.000769935,0.0011686996,0.002211946,0.001187436,0.0040395255,0.0020543495,0.0011417874,0.012971571],"category_scores_gemma":[0.009419928,0.00063145976,0.0006633204,0.0024854275,0.0019280841,0.007978841,0.0020598911,0.0021924004,0.002068474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009992706,0.00031377395,0.0139968535,0.00077527744,0.00010450125,0.00047396077,0.0009273252,0.094010904,0.0139193805,0.60491765,0.031548228,0.23801287],"study_design_scores_gemma":[0.00006505357,0.00008366853,0.0027418188,0.00007965834,0.000038134604,0.00032285237,0.00022695234,0.2062416,0.005206927,0.7761356,0.008813844,0.000043992983],"about_ca_topic_score_codex":0.0019209418,"about_ca_topic_score_gemma":0.0036744794,"teacher_disagreement_score":0.012971571,"about_ca_system_score_codex":0.0014269896,"about_ca_system_score_gemma":0.0007626485,"threshold_uncertainty_score":0.043394268},"labels":[],"label_agreement":null},{"id":"W3048074938","doi":"10.1007/978-3-030-52237-7_50","title":"Correction to: SoundHunters: Increasing Learner Phonological Awareness in Plains Cree","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Climate change and permafrost","field":"Earth and Planetary 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":"Computer science; Natural language processing; Artificial intelligence; Linguistics; Mathematics education; Mathematics; Philosophy","score_opus":0.04627820560381937,"score_gpt":0.2562277769107707,"score_spread":0.20994957130695133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048074938","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042228602,0.00058083073,0.0007845823,0.09282512,0.89939356,0.000027980881,0.0013092008,0.0007631237,0.0038932536],"genre_scores_gemma":[0.03782747,0.0054027997,0.0061511607,0.17605278,0.33618367,0.0004701013,0.0032268695,0.003265871,0.4314193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728405,0.00026920755,0.0004389807,0.0004632008,0.0012484674,0.00029617752],"domain_scores_gemma":[0.9777735,0.0046298667,0.0010367245,0.0014937377,0.013854173,0.0012120891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019017906,0.0015248017,0.002149206,0.002737671,0.003268428,0.0030761226,0.0033415328,0.009770963,0.093576334],"category_scores_gemma":[0.040236674,0.0007947516,0.0009789407,0.0019367288,0.0023719852,0.0021096768,0.0023074094,0.009058243,0.04333081],"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.000030074727,0.0000059927183,0.00006177575,0.00008614504,0.0000055564356,0.00020651704,0.000045255543,0.000021320135,0.00004708588,0.00028936475,0.99482346,0.0043774336],"study_design_scores_gemma":[0.00007515591,0.000027549275,0.0015935594,0.00034471622,0.000029829429,0.0009475557,0.00034117242,0.0002978933,0.00060116587,0.00109733,0.9945962,0.000047926016],"about_ca_topic_score_codex":0.026680967,"about_ca_topic_score_gemma":0.03417954,"teacher_disagreement_score":0.093576334,"about_ca_system_score_codex":0.003264877,"about_ca_system_score_gemma":0.0045864275,"threshold_uncertainty_score":0.31304407},"labels":[],"label_agreement":null},{"id":"W3048371688","doi":"10.1007/978-3-030-57663-9_1","title":"Teaching Formal Methods: An Experience Report","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Formal methods; Formal specification; Software engineering; Formal verification; Notation; Software deployment; Unified Modeling Language; Programming language; B-Method; Software","score_opus":0.052022686145985486,"score_gpt":0.3615113901187566,"score_spread":0.3094887039727711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048371688","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.26464158,0.01842906,0.1686051,0.008169329,0.0022046934,0.0011117574,0.0022685383,0.008093616,0.5264764],"genre_scores_gemma":[0.28604499,0.013170127,0.07054312,0.0011103501,0.00032752517,0.00047761376,0.0038792395,0.0024244564,0.6220226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954727,0.0014510565,0.00016927197,0.00042794595,0.002003516,0.0004755769],"domain_scores_gemma":[0.99312735,0.0018072061,0.00011407486,0.0005749733,0.0024490855,0.0019271808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066389902,0.0010881983,0.000540035,0.001857326,0.0014985387,0.00252972,0.0012890139,0.0017358036,0.033931732],"category_scores_gemma":[0.0066255094,0.0005322671,0.00079943804,0.0018905865,0.00081986375,0.0026429787,0.0026880442,0.001650047,0.011850976],"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.00035021213,0.0053191492,0.0035922069,0.00034997275,0.000023174325,0.0004881603,0.010358385,0.0012140458,0.010128859,0.0066943523,0.084745124,0.8767362],"study_design_scores_gemma":[0.00020580454,0.0024166845,0.010044884,0.00042648573,0.000077541226,0.0018697268,0.007634103,0.0029601126,0.02598232,0.0045401445,0.94376194,0.00008022139],"about_ca_topic_score_codex":0.004807265,"about_ca_topic_score_gemma":0.006187733,"teacher_disagreement_score":0.033931732,"about_ca_system_score_codex":0.0015538987,"about_ca_system_score_gemma":0.0036285145,"threshold_uncertainty_score":0.11351293},"labels":[],"label_agreement":null},{"id":"W3048509133","doi":"10.1007/978-3-030-92931-2_7","title":"A Short Proof of the Non-biplanarity of $$K_9$$","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Simplicity; Graph; Combinatorics; Battle; Mathematics; Philosophy; Geography; Epistemology","score_opus":0.022983876769389528,"score_gpt":0.30482644945765736,"score_spread":0.28184257268826785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048509133","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.017662302,0.035317,0.35940358,0.03810938,0.055568658,0.00045959032,0.0058830976,0.0025384994,0.48505792],"genre_scores_gemma":[0.43062177,0.03338481,0.28265426,0.019230671,0.019828316,0.0012204957,0.0077454825,0.0019145012,0.20339969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922097,0.0001264459,0.000055588924,0.0001708537,0.00030432618,0.00012172948],"domain_scores_gemma":[0.99854904,0.0006611007,0.00010352159,0.00012998392,0.00041483852,0.00014146918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007772871,0.0016961568,0.00081902865,0.0010867371,0.0026237883,0.0017078349,0.00110357,0.00112488,0.042511817],"category_scores_gemma":[0.0023596585,0.0007250617,0.0015624401,0.0014682756,0.0025093297,0.002369776,0.004018833,0.0033460795,0.01412272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001818554,0.00014311125,0.000450706,0.0017105901,0.000112697024,0.0016919611,0.00043500404,0.0017948427,0.020056482,0.6127168,0.24839191,0.112314105],"study_design_scores_gemma":[0.00003247461,0.00015708437,0.0021692791,0.0002607329,0.00006115982,0.001196797,0.00015369347,0.0012648926,0.0076220105,0.47795656,0.50901634,0.0001089348],"about_ca_topic_score_codex":0.001612526,"about_ca_topic_score_gemma":0.001740219,"teacher_disagreement_score":0.042511817,"about_ca_system_score_codex":0.0010355534,"about_ca_system_score_gemma":0.0008042786,"threshold_uncertainty_score":0.1422162},"labels":[],"label_agreement":null},{"id":"W3048788593","doi":"10.1007/978-3-030-85616-8_4","title":"Social Companion Robots to Reduce Isolation: A Perception Change Due to COVID-19","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Loneliness; Social isolation; Feeling; Perception; Isolation (microbiology); Coronavirus disease 2019 (COVID-19); Robot; Face (sociological concept); Psychology; Pandemic; Social psychology; Social distance; Internet privacy; Social contact; Computer science; Sociology; Medicine; Artificial intelligence; Psychotherapist","score_opus":0.12693801308342093,"score_gpt":0.4343514506390288,"score_spread":0.3074134375556079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048788593","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.8868966,0.00087375863,0.077239074,0.001296845,0.0004772551,0.00016430477,0.00014126617,0.0008874071,0.03202343],"genre_scores_gemma":[0.9863572,0.000081718776,0.009739819,0.00018714501,0.000040279225,0.000054912965,0.000062179686,0.0000840462,0.0033927],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992348,0.00027491103,0.000022245602,0.00019492101,0.00015051271,0.00012253833],"domain_scores_gemma":[0.9974445,0.0010527786,0.0002596029,0.00049628346,0.00039401333,0.00035276395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074887206,0.0007285845,0.00053199247,0.00028079934,0.00083690893,0.0010518077,0.0008552208,0.0009251142,0.011621584],"category_scores_gemma":[0.0057371105,0.00034005096,0.0004166303,0.00019581373,0.00075114245,0.0014636479,0.0024890148,0.0010877884,0.0009305825],"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.008321383,0.004601034,0.029645916,0.0017887353,0.0005285314,0.0016403763,0.010503321,0.023813138,0.36137748,0.019162038,0.015008031,0.52361006],"study_design_scores_gemma":[0.0010702689,0.016608663,0.27915585,0.00042927542,0.0010301898,0.0038747715,0.01912425,0.4436722,0.1274494,0.06534086,0.041895855,0.00034846365],"about_ca_topic_score_codex":0.0008838456,"about_ca_topic_score_gemma":0.001039413,"teacher_disagreement_score":0.011621584,"about_ca_system_score_codex":0.000352208,"about_ca_system_score_gemma":0.00039926506,"threshold_uncertainty_score":0.038878083},"labels":[],"label_agreement":null},{"id":"W3049379650","doi":"10.1007/978-3-030-54249-8_7","title":"A Diagram of Choice: The Curious Case of Wallis’s Attempted Proof of the Parallel Postulate and the Axiom of Choice","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"History and Theory of Mathematics","field":"Mathematics","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":"Diagrammatic reasoning; Axiom; Constructive; Axiom of choice; Euclidean geometry; Computer science; Mathematical proof; Mathematical economics; Constructive proof; Appeal; Diagram; Constructive set theory; Mathematics; Calculus (dental); Discrete mathematics; Set theory; Programming language","score_opus":0.027269639668630146,"score_gpt":0.27443347098315796,"score_spread":0.24716383131452782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049379650","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008426261,0.002596542,0.30757883,0.022028895,0.0016827333,0.000072823,0.00025389332,0.00032998895,0.65703017],"genre_scores_gemma":[0.60991645,0.0039839894,0.16893397,0.0048876647,0.0009247292,0.00029679554,0.00024576767,0.0008403398,0.20997033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985977,0.0006883951,0.000044575787,0.00022440114,0.00034647677,0.00009849775],"domain_scores_gemma":[0.99794966,0.0013091697,0.00006896606,0.00032088734,0.00024957437,0.00010175536],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022636047,0.00047407864,0.0005247871,0.001149922,0.0031094502,0.0050635715,0.0013810252,0.0030032191,0.014513117],"category_scores_gemma":[0.006764059,0.00068736396,0.00066711515,0.0011192535,0.012065323,0.013499419,0.0027577705,0.0056944704,0.0026969737],"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.0000023764735,7.751699e-7,0.0000040426025,0.0000045049487,4.805077e-7,0.000007861461,0.000105508196,0.00002377801,0.00003330046,0.99804616,0.0011013021,0.0006698583],"study_design_scores_gemma":[0.0000044938806,0.0000019749561,0.000009308935,0.0000142206745,0.0000013409923,0.000027258855,0.00006402902,0.0002185596,0.00014060919,0.9673529,0.032162018,0.0000032844491],"about_ca_topic_score_codex":0.0029094853,"about_ca_topic_score_gemma":0.0034744232,"teacher_disagreement_score":0.99689054,"about_ca_system_score_codex":0.002491091,"about_ca_system_score_gemma":0.0019317064,"threshold_uncertainty_score":0.0485512},"labels":[],"label_agreement":null},{"id":"W3049699960","doi":"10.1007/978-3-030-54956-5_6","title":"Correspondence as the Primary Measure of Quality for Web Archives: A Grounded Theory Study","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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 Alberta","funders":"","keywords":"World Wide Web; Computer science; Grounded theory; Quality (philosophy); The Internet; Web development; Field (mathematics); Relevance (law); Sociology; Qualitative research; Political science; Mathematics","score_opus":0.03758715106019515,"score_gpt":0.2870381769926996,"score_spread":0.24945102593250448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049699960","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.79869646,0.0010237239,0.11533873,0.0055381167,0.000115585135,0.0029817335,0.0009485287,0.000099485085,0.07525761],"genre_scores_gemma":[0.9722269,0.00013973667,0.02620079,0.00012997455,0.00000806442,0.00065464876,0.00011585537,0.00004071629,0.0004832582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9443366,0.038626067,0.0025762417,0.0030277725,0.010404501,0.0010287846],"domain_scores_gemma":[0.67471385,0.28284237,0.0117429895,0.011467529,0.01683383,0.002399481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.045082796,0.0004893825,0.0011161701,0.008499962,0.0067117647,0.010722403,0.0031182957,0.001649743,0.004791216],"category_scores_gemma":[0.13553515,0.0008294457,0.0012959877,0.010897463,0.013606013,0.01200303,0.0059251543,0.004465119,0.00032125702],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068545225,0.0015328625,0.0763822,0.0021768967,0.00021328246,0.00022964066,0.35468513,0.0015722273,0.0024643075,0.39942923,0.0019450656,0.15868375],"study_design_scores_gemma":[0.00028239522,0.0011855423,0.06895759,0.0026384748,0.0007166347,0.0005083405,0.61533505,0.020876464,0.010777663,0.26247963,0.01603321,0.00020902729],"about_ca_topic_score_codex":0.0074486975,"about_ca_topic_score_gemma":0.009151367,"teacher_disagreement_score":0.045082796,"about_ca_system_score_codex":0.017528212,"about_ca_system_score_gemma":0.01548696,"threshold_uncertainty_score":0.23842347},"labels":[],"label_agreement":null},{"id":"W30539646","doi":"10.1007/978-3-642-37899-7_3","title":"Emergency Mobile Access to Personal Health Records Stored on an Untrusted Cloud","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Concordia University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Internet privacy; Operating system","score_opus":0.028417384672233807,"score_gpt":0.3002675208677383,"score_spread":0.27185013619550447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30539646","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50089186,0.010181859,0.27067596,0.0083528785,0.00223414,0.00026915994,0.0013910012,0.0044269757,0.20157623],"genre_scores_gemma":[0.9478102,0.0023057058,0.009035562,0.00042356053,0.0004249925,0.000026658847,0.0004113967,0.00008683769,0.03947518],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997873,0.000033021213,0.000012747516,0.000027240487,0.00007477854,0.000064974425],"domain_scores_gemma":[0.99939847,0.00026698696,0.00005914077,0.00015755884,0.000063572894,0.000054241904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657758,0.00016238098,0.00023123667,0.00021773804,0.0003655081,0.00080568163,0.0006255055,0.0005069342,0.007567831],"category_scores_gemma":[0.0013403549,0.00012439783,0.00018254145,0.00041374742,0.00027014592,0.0014547395,0.001365593,0.0006700347,0.0017786685],"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.0023188593,0.0003033466,0.008896873,0.00072316616,0.000088319226,0.010369542,0.0033420627,0.008936065,0.07771481,0.08633311,0.123487025,0.6774869],"study_design_scores_gemma":[0.00024647728,0.0009753583,0.02891085,0.00079257356,0.00016265897,0.022798013,0.0043161334,0.18149993,0.081384614,0.103921205,0.57483923,0.00015298797],"about_ca_topic_score_codex":0.00034160085,"about_ca_topic_score_gemma":0.00037027962,"teacher_disagreement_score":0.007567831,"about_ca_system_score_codex":0.00020891237,"about_ca_system_score_gemma":0.00018429471,"threshold_uncertainty_score":0.025316894},"labels":[],"label_agreement":null},{"id":"W305579182","doi":"10.1007/978-3-319-07467-2_33","title":"A Data Driven Approach for Smart Lighting","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"National Research Council Canada","funders":"","keywords":"Computer science; Smart lighting; Energy consumption; Energy (signal processing); Control (management); Architectural engineering; Artificial intelligence; Engineering","score_opus":0.054030452318602554,"score_gpt":0.30119107271691153,"score_spread":0.247160620398309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W305579182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014183493,0.00012988894,0.99444216,0.00010367596,0.00005026742,0.00004098155,0.00014862968,0.00087109144,0.002794899],"genre_scores_gemma":[0.13466077,0.0005008811,0.85222626,0.00019645618,0.000074781856,0.00021023111,0.0008779149,0.00059923896,0.010653456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993875,0.00012009873,0.000027165113,0.00011378334,0.0003083727,0.00004306111],"domain_scores_gemma":[0.9994388,0.00020265064,0.000022879525,0.00010829835,0.0002021214,0.000025246642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073247787,0.0007576106,0.0007476321,0.0008245462,0.00057371863,0.0021737092,0.0017874823,0.00092381897,0.00848928],"category_scores_gemma":[0.0017276149,0.00056432636,0.0013728007,0.0010853972,0.0005668406,0.0019031496,0.0016775778,0.0013591897,0.0018590294],"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.00019603844,0.00029205406,0.0012880698,0.00047613156,0.00012926212,0.00022930367,0.00042413658,0.2599327,0.023673315,0.18557234,0.018339304,0.5094474],"study_design_scores_gemma":[0.000010386545,0.000027404494,0.00020599428,0.000031292497,0.00001786218,0.000074036114,0.00008599198,0.8847378,0.007222541,0.08406653,0.023493567,0.000026570215],"about_ca_topic_score_codex":0.0030570624,"about_ca_topic_score_gemma":0.0053496812,"teacher_disagreement_score":0.00848928,"about_ca_system_score_codex":0.0007755166,"about_ca_system_score_gemma":0.00076902943,"threshold_uncertainty_score":0.028399467},"labels":[],"label_agreement":null},{"id":"W3057037158","doi":"10.1007/978-3-030-56150-5_4","title":"Extending Sliding-Step Importance Weighting from Supervised Learning to Reinforcement Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Machine learning; Artificial intelligence; Weighting; Stochastic gradient descent; Robustness (evolution); Online machine learning; Supervised learning; Mathematical optimization; Algorithm; Semi-supervised learning; Mathematics; Artificial neural network","score_opus":0.014479107915693361,"score_gpt":0.24249650176752494,"score_spread":0.22801739385183156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3057037158","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.003733865,0.00020406283,0.99492717,0.000036278478,0.000051561125,0.000018338424,0.000009080862,0.00015829218,0.00086120673],"genre_scores_gemma":[0.4381138,0.0005485763,0.5534914,0.00015913216,0.00018803966,0.00016555288,0.00014658249,0.00021620395,0.006970645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934477,0.0002090235,0.000043695247,0.00014500688,0.00021219593,0.000045263343],"domain_scores_gemma":[0.99770373,0.0014157884,0.00010118748,0.00031459398,0.0003914476,0.00007332048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018749207,0.00063108857,0.0011248082,0.00055445667,0.00023525604,0.00065721193,0.0014743704,0.0008460822,0.0025248372],"category_scores_gemma":[0.005585707,0.0004093323,0.0005311516,0.0007687953,0.0006539181,0.0015681307,0.0013936284,0.0014873013,0.00049079116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012619648,0.00022292227,0.0005284514,0.00017077153,0.00009984468,0.00005827088,0.00007638073,0.46489075,0.0071008615,0.035566222,0.0030375642,0.48812172],"study_design_scores_gemma":[0.000005385951,0.000025600495,0.00005907612,0.0000049561804,0.0000062716554,0.000009050928,0.0000017743797,0.98637706,0.0007087725,0.01228804,0.00051062164,0.0000033620115],"about_ca_topic_score_codex":0.0018858139,"about_ca_topic_score_gemma":0.0019801785,"teacher_disagreement_score":0.0025248372,"about_ca_system_score_codex":0.00048151385,"about_ca_system_score_gemma":0.0006955601,"threshold_uncertainty_score":0.00991565},"labels":[],"label_agreement":null},{"id":"W3057900685","doi":"10.1007/978-3-030-57977-7_8","title":"Invertible Bidirectional Metalogical Translation Between Prolog and RuleML for Knowledge Representation and Querying","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"RuleML; Computer science; Programming language; Prolog; XML; Natural language processing; Artificial intelligence; SGML; Streaming XML; World Wide Web","score_opus":0.08378794783684153,"score_gpt":0.30322450460847056,"score_spread":0.21943655677162904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3057900685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031403382,0.00020516533,0.97825783,0.00033874245,0.00016819593,0.00011196927,0.0005577174,0.005777104,0.011443007],"genre_scores_gemma":[0.10370208,0.0004966048,0.8763926,0.0004422752,0.00014377269,0.00027155288,0.002710441,0.0026714266,0.013169251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978461,0.0006225229,0.00026971792,0.00038985367,0.00069587736,0.00017601415],"domain_scores_gemma":[0.9978619,0.0009270383,0.0000874951,0.0006736013,0.00040235964,0.000047572525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019185625,0.00054475537,0.000668819,0.0012649653,0.0008092753,0.0034276766,0.0017048969,0.00094917003,0.012308789],"category_scores_gemma":[0.005224793,0.0008342953,0.0014639971,0.0015028451,0.0016533155,0.0042119464,0.00333458,0.0027413447,0.0069420463],"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.00017176487,0.00018830961,0.00029221378,0.0005375036,0.00005774742,0.00040970693,0.00085118494,0.0071805622,0.010893599,0.69524366,0.021040658,0.26313314],"study_design_scores_gemma":[0.000074616226,0.00007172262,0.0002791569,0.00022672559,0.00011029088,0.00052916654,0.00032759548,0.09380805,0.04799633,0.6555473,0.20094377,0.000085273656],"about_ca_topic_score_codex":0.0020381836,"about_ca_topic_score_gemma":0.0022804162,"teacher_disagreement_score":0.012308789,"about_ca_system_score_codex":0.0010124771,"about_ca_system_score_gemma":0.0020448694,"threshold_uncertainty_score":0.041176975},"labels":[],"label_agreement":null},{"id":"W30587380","doi":"10.1007/978-3-642-02580-8_72","title":"Development of an Emotional Interface for Sustainable Water Consumption in the Home","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Environmental Education and Sustainability","field":"Environmental 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 Toronto","funders":"","keywords":"Computer science; Shower; Contextualization; Water consumption; Context (archaeology); Consumption (sociology); Interface (matter); Sustainability; User interface; Human–computer interaction; Environmental economics; Water resource management; Environmental science; Ecology; Operating system; Engineering","score_opus":0.013387784115314261,"score_gpt":0.25738763605318754,"score_spread":0.24399985193787327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30587380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16692331,0.00047928936,0.7501096,0.0011382389,0.000538803,0.00077337347,0.00029091866,0.0065373755,0.07320914],"genre_scores_gemma":[0.5265039,0.0005017377,0.41678745,0.0009797949,0.000099962424,0.00095874415,0.000517293,0.0006743405,0.052976802],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997919,0.000078190074,0.000011943838,0.000032845983,0.000060436112,0.000024691935],"domain_scores_gemma":[0.99967563,0.00015664383,0.000009338821,0.000022427548,0.00009501917,0.000041022136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061912485,0.00051399105,0.00022941043,0.00020840266,0.00031388504,0.0011974878,0.0010846365,0.0007994853,0.015159632],"category_scores_gemma":[0.0014914171,0.00015825155,0.00037809345,0.00014987127,0.00031374145,0.0013120028,0.0015154998,0.00060078537,0.001999201],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096017664,0.0015369832,0.0029522968,0.00096416083,0.00011564099,0.0012548062,0.011131517,0.0061655203,0.13344494,0.023885705,0.03557634,0.782012],"study_design_scores_gemma":[0.0006934253,0.0048108865,0.019064397,0.0010463712,0.00092633395,0.0042581623,0.0142333275,0.29157656,0.23795705,0.03893598,0.38608962,0.0004079344],"about_ca_topic_score_codex":0.00040185437,"about_ca_topic_score_gemma":0.00044024753,"teacher_disagreement_score":0.015159632,"about_ca_system_score_codex":0.0001970775,"about_ca_system_score_gemma":0.00028033173,"threshold_uncertainty_score":0.050714016},"labels":[],"label_agreement":null},{"id":"W305950784","doi":"10.1007/978-3-319-14472-6_27","title":"Space- and Time-Efficient Long-Lived Test-And-Set Objects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Calgary","funders":"","keywords":"Computer science; Reset (finance); Asynchronous communication; Set (abstract data type); Time complexity; Implementation; Constant (computer programming); Theoretical computer science; Binary logarithm; Algorithm; Discrete mathematics; Mathematics; Programming language","score_opus":0.011294405239056941,"score_gpt":0.2271747626164213,"score_spread":0.21588035737736436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W305950784","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.055857416,0.0009861065,0.9277818,0.00023398061,0.00021509182,0.00013904851,0.0003813868,0.0051090876,0.009296106],"genre_scores_gemma":[0.5475487,0.00046865613,0.43024063,0.00014351925,0.00014810823,0.00031466965,0.0013342217,0.0009723458,0.01882919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831367,0.00022888025,0.00013862748,0.00028863584,0.00065281894,0.00037744068],"domain_scores_gemma":[0.993089,0.0020315477,0.0004879291,0.0030285825,0.0010427904,0.000320083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013771645,0.001061031,0.0016260613,0.0012323885,0.0014837811,0.0026383784,0.0041713794,0.0009948873,0.0071995454],"category_scores_gemma":[0.0058615613,0.0006114338,0.0009911781,0.0021775248,0.0015405575,0.0047448305,0.0049271304,0.0016862017,0.0020714644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017185892,0.00034804735,0.001844361,0.00060353015,0.00013804954,0.000296368,0.00058986375,0.11263288,0.038478542,0.28756922,0.015372747,0.5404078],"study_design_scores_gemma":[0.000274642,0.00084348454,0.00085315056,0.00011414167,0.00020308657,0.000591504,0.00030646534,0.48022854,0.06410801,0.42596027,0.026391184,0.00012547888],"about_ca_topic_score_codex":0.0012415148,"about_ca_topic_score_gemma":0.001709102,"teacher_disagreement_score":0.0071995454,"about_ca_system_score_codex":0.0014750761,"about_ca_system_score_gemma":0.0021499055,"threshold_uncertainty_score":0.024084926},"labels":[],"label_agreement":null},{"id":"W3062065023","doi":"10.1007/978-3-030-57821-3_16","title":"MiRNA-Disease Associations Prediction Based on Negative Sample Selection and Multi-layer Perceptron","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"MicroRNA in disease regulation","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan","funders":"","keywords":"Semantic similarity; Computer science; Similarity (geometry); Artificial intelligence; microRNA; Perceptron; Computational biology; Kernel (algebra); Disease; Selection (genetic algorithm); Machine learning; Data mining; Bioinformatics; Biology; Medicine; Mathematics; Artificial neural network; Gene; Genetics; Pathology","score_opus":0.017549899368696057,"score_gpt":0.25347107298797983,"score_spread":0.23592117361928377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3062065023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07932346,0.0025674305,0.910737,0.0005792212,0.000329129,0.00009417926,0.00040188458,0.0033235843,0.0026440902],"genre_scores_gemma":[0.74814475,0.0009582696,0.23862599,0.0005789854,0.0003397756,0.00018745178,0.0015019565,0.00019878788,0.009464075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990231,0.00028874344,0.00007436232,0.0002768297,0.00018792569,0.00014910744],"domain_scores_gemma":[0.99861753,0.00095404667,0.0000572031,0.000087468376,0.00022975418,0.000053974007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033258465,0.0013442943,0.0015859748,0.0008312422,0.00047154323,0.0011063289,0.0018674894,0.0014334919,0.002775073],"category_scores_gemma":[0.0033062322,0.0006832184,0.0016461916,0.00079046347,0.00051688874,0.0013523741,0.001069727,0.0017223023,0.0011724131],"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.0012774959,0.0005600037,0.008900787,0.00025038014,0.00046317233,0.00038015604,0.00008626687,0.18299122,0.01991306,0.003130526,0.00907177,0.7729751],"study_design_scores_gemma":[0.000017586754,0.00005221842,0.00072858593,0.000007638293,0.000046963985,0.000054137967,0.0000050729036,0.9958923,0.001758908,0.0011587755,0.00026848473,0.000009381302],"about_ca_topic_score_codex":0.0023422486,"about_ca_topic_score_gemma":0.0033946051,"teacher_disagreement_score":0.0033258465,"about_ca_system_score_codex":0.00048723715,"about_ca_system_score_gemma":0.0008189923,"threshold_uncertainty_score":0.017588973},"labels":[],"label_agreement":null},{"id":"W3071869045","doi":"10.1007/978-3-030-57977-7_10","title":"Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating Dependencies","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Tuple; Computer science; Datalog; Class (philosophy); Ontology; Theoretical computer science; Benchmark (surveying); Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.0271185916498816,"score_gpt":0.25720296923358105,"score_spread":0.23008437758369946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3071869045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02163673,0.00019327596,0.97278565,0.00031359252,0.000035827616,0.00009694199,0.00032907308,0.001472372,0.0031364025],"genre_scores_gemma":[0.43945456,0.00026696772,0.5529409,0.0001830274,0.00009941683,0.00020542968,0.001958332,0.0003677897,0.004523546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954581,0.0013880944,0.00038567666,0.0010647873,0.0013379627,0.0003653455],"domain_scores_gemma":[0.98175174,0.014025735,0.0004515637,0.0026158616,0.0008989024,0.00025620937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044993176,0.0008584707,0.0014306845,0.0013517046,0.0015772532,0.0035170205,0.0045751194,0.0015759689,0.006291631],"category_scores_gemma":[0.019159,0.0011400849,0.002588878,0.0020421653,0.0021341941,0.009807617,0.0051396624,0.003231919,0.0009089715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010085985,0.0005863096,0.00317542,0.0009197751,0.00031701778,0.0010324434,0.0011484377,0.37097743,0.008562878,0.32512915,0.010879544,0.276263],"study_design_scores_gemma":[0.000054751792,0.00002301026,0.00014162502,0.000022320373,0.000053428055,0.00012708837,0.00010171219,0.7323814,0.0044146157,0.26109627,0.0015665664,0.00001722886],"about_ca_topic_score_codex":0.0042522647,"about_ca_topic_score_gemma":0.0071708127,"teacher_disagreement_score":0.006291631,"about_ca_system_score_codex":0.0020289633,"about_ca_system_score_gemma":0.0015061429,"threshold_uncertainty_score":0.023794949},"labels":[],"label_agreement":null},{"id":"W3075941581","doi":"10.1007/978-3-030-57675-2_8","title":"Parallel Scheduling of Data-Intensive Tasks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Locality; Directed acyclic graph; Cache; Distributed computing; Job shop scheduling; Algorithm; Operating system; Mathematical optimization; Schedule","score_opus":0.04864724566646964,"score_gpt":0.2786849660728876,"score_spread":0.23003772040641798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3075941581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1109779,0.00315066,0.8166489,0.0004757797,0.00085154024,0.00027697516,0.0005031724,0.0028271952,0.064287744],"genre_scores_gemma":[0.53450763,0.003257162,0.37906665,0.00018336404,0.0004776638,0.00036354168,0.0017946018,0.00086507644,0.07948434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998282,0.000022473154,0.000009363103,0.00002942476,0.00006887319,0.00004156634],"domain_scores_gemma":[0.99965596,0.0001422294,0.000019653082,0.00006870677,0.00007298267,0.000040504652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003285946,0.00064877566,0.00054670335,0.00043794038,0.00060896797,0.0006999883,0.0011212096,0.000276244,0.0063934317],"category_scores_gemma":[0.00068337866,0.00039356487,0.00032251122,0.0010596825,0.0002325766,0.0004984974,0.0007275556,0.00060675835,0.0018026901],"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.0014527072,0.00050115003,0.0005563427,0.00061125716,0.00007307872,0.00025133957,0.00017628027,0.30623284,0.0944027,0.029950855,0.028395843,0.5373955],"study_design_scores_gemma":[0.00019888284,0.00039720486,0.0009904174,0.00004507323,0.000050261966,0.00014000498,0.00007247393,0.8372767,0.05046449,0.05201413,0.058325607,0.000024779274],"about_ca_topic_score_codex":0.002009968,"about_ca_topic_score_gemma":0.0027542033,"teacher_disagreement_score":0.0063934317,"about_ca_system_score_codex":0.0005009085,"about_ca_system_score_gemma":0.00091261376,"threshold_uncertainty_score":0.021388173},"labels":[],"label_agreement":null},{"id":"W3079594492","doi":"10.1007/978-3-030-57821-3_3","title":"SPOC: Identification of Drug Targets in Biological Networks via Set Preference Output Control","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","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 Saskatchewan","funders":"","keywords":"Computer science; Set (abstract data type); Biological network; Realization (probability); Matching (statistics); Control (management); Identification (biology); Preference; Artificial intelligence; Computational biology; Mathematics; Biology","score_opus":0.01584496413489106,"score_gpt":0.22572914149453566,"score_spread":0.2098841773596446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079594492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01670826,0.0005632559,0.96801466,0.0002165376,0.00014336169,0.00011158473,0.00053408585,0.0037840575,0.009924301],"genre_scores_gemma":[0.47137985,0.00068921933,0.5040204,0.0003225553,0.00017360978,0.0003474985,0.0014335914,0.00067871803,0.020954557],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975055,0.000034459496,0.000009620902,0.000057108635,0.00012153664,0.000026642763],"domain_scores_gemma":[0.99964225,0.00017939105,0.000028896444,0.000047150585,0.000077469005,0.000024867897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047503,0.0006598837,0.00074181793,0.0005373783,0.00023310697,0.00075796,0.00083298853,0.00041625634,0.0050446843],"category_scores_gemma":[0.0011019969,0.00020514964,0.00044337162,0.00054073834,0.0005747583,0.00053340424,0.00070594193,0.0008446162,0.0008242304],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048953976,0.00013940709,0.0007871527,0.0004006649,0.00008845094,0.00013459944,0.00004604323,0.23213638,0.052654423,0.075990595,0.024604384,0.61252826],"study_design_scores_gemma":[0.000019960653,0.00007140942,0.00025713828,0.000008744064,0.000011405334,0.000040173316,0.0000054765524,0.9578676,0.013066476,0.025063004,0.003576423,0.000012105628],"about_ca_topic_score_codex":0.0013915773,"about_ca_topic_score_gemma":0.0014892955,"teacher_disagreement_score":0.0050446843,"about_ca_system_score_codex":0.00047159498,"about_ca_system_score_gemma":0.0005182983,"threshold_uncertainty_score":0.01687622},"labels":[],"label_agreement":null},{"id":"W3080919791","doi":"10.1007/978-3-030-54549-9_3","title":"Just Enough Formality in Assurance Argument Structures","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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 Waterloo; University of Toronto","funders":"","keywords":"Formality; Computer science; Argument (complex analysis); Guard (computer science); Software deployment; Risk analysis (engineering); Software engineering; Programming language","score_opus":0.014488293005319149,"score_gpt":0.21657770431485293,"score_spread":0.20208941130953378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080919791","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.00997026,0.0016607896,0.7507765,0.016595246,0.0008272821,0.00008312611,0.00026618503,0.00081994274,0.21900065],"genre_scores_gemma":[0.7388736,0.0012897388,0.19578177,0.002960257,0.0010830921,0.0004222767,0.00051189086,0.000876084,0.05820121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946407,0.0028054337,0.00038488285,0.00064315164,0.0011587073,0.00036711982],"domain_scores_gemma":[0.98420703,0.011381825,0.00047323815,0.0024242783,0.0012547417,0.00025885156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006523723,0.0009280492,0.0008921964,0.0017083073,0.0022577366,0.0058013685,0.0017366416,0.0036030945,0.02297471],"category_scores_gemma":[0.025937889,0.0014284226,0.0013057609,0.0012216391,0.010073877,0.026666086,0.0045223916,0.007669082,0.0041185142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044241183,0.0000031697937,0.000017954679,0.000018866582,0.0000024277406,0.0000097687935,0.00011267132,0.00016421807,0.000051335188,0.99583375,0.00081283465,0.002968494],"study_design_scores_gemma":[0.0000038205976,0.0000019293095,0.000006682994,0.00001437755,0.0000024290662,0.000012356986,0.000019493142,0.00042825815,0.000089721914,0.99429214,0.005126471,0.0000024193191],"about_ca_topic_score_codex":0.00074778526,"about_ca_topic_score_gemma":0.00078640593,"teacher_disagreement_score":0.02297471,"about_ca_system_score_codex":0.0023537828,"about_ca_system_score_gemma":0.0012999517,"threshold_uncertainty_score":0.07685804},"labels":[],"label_agreement":null},{"id":"W3081090156","doi":"10.1007/978-3-030-57321-8_1","title":"Explainable Artificial Intelligence: Concepts, Applications, Research Challenges and Visions","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":161,"is_retracted":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":"Computer science; Transparency (behavior); Acknowledgement; Vision; Artificial intelligence; European union; Data science; Computer security","score_opus":0.1208874855785112,"score_gpt":0.36651958890720737,"score_spread":0.24563210332869617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081090156","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007422181,0.55416805,0.189313,0.051168,0.003888735,0.000091681766,0.0004477971,0.0008126901,0.19268787],"genre_scores_gemma":[0.18516248,0.5255821,0.15039055,0.0077157477,0.009489617,0.00029632397,0.001568228,0.0006411521,0.11915379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994685,0.00019157837,0.000024819486,0.000081836035,0.00019466768,0.00003861269],"domain_scores_gemma":[0.9977945,0.0016326174,0.00007871688,0.00020535124,0.00018597233,0.00010290888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017757278,0.0008870148,0.0008533851,0.0016879548,0.00060420675,0.006709213,0.0017829294,0.0018684514,0.010560469],"category_scores_gemma":[0.0024420274,0.00047492218,0.0008043193,0.0027458628,0.005113547,0.007966893,0.0018682247,0.0045982287,0.002447315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010170851,0.000021255506,0.00013349323,0.0004537716,0.000014473365,0.000039079427,0.00031317107,0.0009769569,0.00027767933,0.8979458,0.02572398,0.07409013],"study_design_scores_gemma":[0.000004948992,0.000016098782,0.00023074378,0.00046558032,0.000008863772,0.00016876505,0.00020680523,0.0040151463,0.00023965133,0.8116751,0.18295355,0.000014820543],"about_ca_topic_score_codex":0.0013712817,"about_ca_topic_score_gemma":0.0015643322,"teacher_disagreement_score":0.010560469,"about_ca_system_score_codex":0.0016648886,"about_ca_system_score_gemma":0.0012922038,"threshold_uncertainty_score":0.03532833},"labels":[],"label_agreement":null},{"id":"W308166416","doi":"10.1007/978-3-319-16220-1_10","title":"3D Multimodal Simulation of Image Acquisition by X-Ray and MRI for Validation of Seedling Measurements with Segmentation Algorithms","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Plant nutrient uptake and metabolism","field":"Agricultural and Biological Sciences","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":"Canadian Nautical Research Society","funders":"Agence Nationale de la Recherche","keywords":"Seedling; Segmentation; Ground truth; Computer science; Algorithm; Artificial intelligence; Computer vision; Simulation; Agronomy; Biology","score_opus":0.03591537290375244,"score_gpt":0.2579231574363312,"score_spread":0.22200778453257877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W308166416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24405678,0.0007601228,0.74182844,0.00036056878,0.00013407446,0.00025318062,0.0029795677,0.0033130248,0.006314221],"genre_scores_gemma":[0.6890361,0.00062877417,0.30423003,0.000099710924,0.000019183753,0.00029936893,0.0017195009,0.00074032147,0.0032271284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982554,0.00003808011,0.000014945787,0.00003432831,0.00007110136,0.000016080612],"domain_scores_gemma":[0.9990682,0.00062811363,0.000059600945,0.000084126266,0.00013346052,0.000026566191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943046,0.0006063175,0.0004953449,0.0005080538,0.00027877258,0.0010800486,0.0008587951,0.0012209185,0.004490418],"category_scores_gemma":[0.0017339786,0.0005058909,0.00055476197,0.000621676,0.00036909457,0.0004054926,0.000565204,0.00059329154,0.0007317317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002867959,0.00015486461,0.0022085314,0.00046044652,0.00006773953,0.0003028884,0.00033225561,0.836893,0.11590869,0.0033144958,0.0020589312,0.038011387],"study_design_scores_gemma":[0.0000115900875,0.000052001305,0.001229276,0.000020448368,0.000014152705,0.0001044871,0.000031187647,0.97862613,0.017966313,0.00064000656,0.0012805337,0.000023853885],"about_ca_topic_score_codex":0.0054510864,"about_ca_topic_score_gemma":0.00661226,"teacher_disagreement_score":0.0054510864,"about_ca_system_score_codex":0.0007191347,"about_ca_system_score_gemma":0.00096715364,"threshold_uncertainty_score":0.01502192},"labels":[],"label_agreement":null},{"id":"W3081828391","doi":"10.1007/978-3-030-49435-3","title":"Advanced Information Systems Engineering","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Focus (optics); Information engineering; Information system; Process (computing); Data science; Big data; Method engineering; Software engineering; Systems engineering; Data mining; Engineering; Programming language","score_opus":0.02032063828880079,"score_gpt":0.22766420488745015,"score_spread":0.20734356659864936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081828391","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025655918,0.021837879,0.22111468,0.005135083,0.0051863063,0.00016343118,0.000873894,0.0023060343,0.7408171],"genre_scores_gemma":[0.038658388,0.020755718,0.072795,0.0008486609,0.0018052938,0.00025640722,0.0016286606,0.00068318425,0.8625687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993674,0.00006296693,0.000028967925,0.00009406181,0.00041257293,0.000034090073],"domain_scores_gemma":[0.99941015,0.00013385399,0.00002175726,0.0001816888,0.00022557302,0.000027016242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062046753,0.0009143789,0.0007753264,0.0015941763,0.000577805,0.002440289,0.00061189814,0.0008463012,0.06877884],"category_scores_gemma":[0.0013624091,0.00039864038,0.00040518792,0.0017085847,0.00059261953,0.0019543588,0.0013209261,0.0017352519,0.04524365],"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.000016819577,0.00004674373,0.0001758215,0.00030411693,0.000017251297,0.000051635747,0.000094777766,0.0021142005,0.002104353,0.20229901,0.21607596,0.5766992],"study_design_scores_gemma":[0.000006297924,0.000031686184,0.0004036424,0.00014530843,0.000012328773,0.00014125016,0.000029124889,0.005784677,0.0020227295,0.105911896,0.88550055,0.00001052948],"about_ca_topic_score_codex":0.00084683765,"about_ca_topic_score_gemma":0.0008601402,"teacher_disagreement_score":0.06877884,"about_ca_system_score_codex":0.0008046201,"about_ca_system_score_gemma":0.0010085247,"threshold_uncertainty_score":0.23008817},"labels":[],"label_agreement":null},{"id":"W3081929275","doi":"10.1007/978-3-031-65665-1_21","title":"Optimizing Rough Set Flow Graph Inference","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Inference; Graph; Control flow graph; Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.02719852915299577,"score_gpt":0.2595045907320707,"score_spread":0.23230606157907494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081929275","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.009590068,0.00015691132,0.9867033,0.00021253193,0.000038961363,0.00004843464,0.00010237657,0.00061167794,0.0025357967],"genre_scores_gemma":[0.2842208,0.0003029404,0.7080754,0.00015286346,0.00008855881,0.00014089307,0.0005238431,0.0003716198,0.0061230734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993861,0.00023218342,0.000023022225,0.00013617246,0.00016056838,0.00006199549],"domain_scores_gemma":[0.99789643,0.0015801335,0.00007803842,0.000209727,0.00017605055,0.000059560913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015481978,0.0008578235,0.0019721873,0.00166473,0.0006974127,0.0015787513,0.0017855078,0.0017363977,0.006332971],"category_scores_gemma":[0.0053435704,0.0011748882,0.0018736441,0.0014504928,0.0007789982,0.0022631632,0.0015525084,0.0020626455,0.000807549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115774594,0.00007336454,0.0001918396,0.000096531476,0.000058589012,0.000039358856,0.000049571154,0.81633997,0.001149675,0.025540333,0.0038861434,0.15245886],"study_design_scores_gemma":[0.0000036255751,0.000008431845,0.000028006481,0.000004075679,0.000005783815,0.0000044233607,0.0000039507845,0.98651403,0.00024043757,0.012962627,0.00022229143,0.000002411064],"about_ca_topic_score_codex":0.009385207,"about_ca_topic_score_gemma":0.007265704,"teacher_disagreement_score":0.009385207,"about_ca_system_score_codex":0.0016191824,"about_ca_system_score_gemma":0.0013603009,"threshold_uncertainty_score":0.021185875},"labels":[],"label_agreement":null},{"id":"W3082082532","doi":"10.1007/978-3-030-58468-9_9","title":"Dynamic Cutting of a Meshless Model for Interactive Surgery Simulation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Robustness (evolution); Immersion (mathematics); Virtual reality; Collision detection; Collision response; Simulation; Collision; Physics engine; Representation (politics); Artificial intelligence; Computer vision","score_opus":0.023531218308279127,"score_gpt":0.25836955786711424,"score_spread":0.23483833955883512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082082532","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.02563246,0.00021106776,0.95273536,0.00012661886,0.00008932161,0.000060775394,0.0001713099,0.0009560018,0.020017141],"genre_scores_gemma":[0.5314139,0.0005868215,0.43249926,0.00015203503,0.000044201068,0.00015750542,0.0005979543,0.0010425599,0.033505797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997987,0.000022529246,0.0000078502735,0.000023587718,0.0001336293,0.000013764908],"domain_scores_gemma":[0.99982697,0.000067729125,0.0000146044895,0.00005170675,0.000024397721,0.00001453912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019857007,0.00045560504,0.0006021087,0.00052285014,0.00036463665,0.0010937565,0.0013811844,0.0011347813,0.008243041],"category_scores_gemma":[0.00060353475,0.0006831107,0.00077717524,0.00039890248,0.0005947432,0.0007172125,0.0012753366,0.0008776125,0.0010144449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010159513,0.000078349185,0.00032806728,0.00014609216,0.000033581877,0.00019586185,0.0001561876,0.82950467,0.04319969,0.056525365,0.0025578476,0.06717268],"study_design_scores_gemma":[0.000009477192,0.00002870132,0.00011141783,0.000014015201,0.0000073185124,0.00011422855,0.000011472938,0.98589015,0.0033559618,0.00499163,0.005456167,0.000009438813],"about_ca_topic_score_codex":0.0013477908,"about_ca_topic_score_gemma":0.001258525,"teacher_disagreement_score":0.008243041,"about_ca_system_score_codex":0.0004738873,"about_ca_system_score_gemma":0.00041368388,"threshold_uncertainty_score":0.02757579},"labels":[],"label_agreement":null},{"id":"W3082083549","doi":"10.1007/978-3-030-58112-1_13","title":"Simple Surrogate Model Assisted Optimization with Covariance Matrix Adaptation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization 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":"Dalhousie University","funders":"","keywords":"Computer science; Simple (philosophy); CMA-ES; Adaptation (eye); Covariance matrix; Algorithm; Mathematical optimization; Matrix (chemical analysis); Covariance; Artificial intelligence; Covariance function; Mathematics; Statistics","score_opus":0.023973858364599566,"score_gpt":0.2611975937309552,"score_spread":0.23722373536635563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082083549","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.0020703834,0.00013566768,0.9911747,0.000053831078,0.00011070645,0.000017410035,0.00005378438,0.00052901095,0.005854509],"genre_scores_gemma":[0.19356796,0.00032218272,0.7799497,0.00022260414,0.00012819815,0.00019595648,0.0005027163,0.00065843965,0.0244522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965024,0.000106868414,0.000012672574,0.000045227207,0.00016414463,0.000020994728],"domain_scores_gemma":[0.99967754,0.00010189306,0.00001796327,0.000115405244,0.000070020054,0.000017143353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043345,0.00090142916,0.0012184103,0.00029584285,0.00029467803,0.0008811106,0.0010983057,0.0016853783,0.0068988707],"category_scores_gemma":[0.0012142649,0.0005350306,0.0009608214,0.0007437181,0.00036857786,0.0010404509,0.0012497951,0.0015708475,0.0030384664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016043043,0.00012668093,0.00019195185,0.00020264917,0.00009973176,0.00012581117,0.00003359208,0.77912456,0.020262098,0.03871757,0.007959971,0.15299502],"study_design_scores_gemma":[0.0000067468955,0.000022327236,0.00004192462,0.000005193592,0.000004910685,0.000033578675,0.00000195355,0.9907885,0.001466883,0.0051085823,0.0025119642,0.00000740317],"about_ca_topic_score_codex":0.00053774053,"about_ca_topic_score_gemma":0.0010035866,"teacher_disagreement_score":0.0068988707,"about_ca_system_score_codex":0.00021030496,"about_ca_system_score_gemma":0.0004352329,"threshold_uncertainty_score":0.023079038},"labels":[],"label_agreement":null},{"id":"W3082105611","doi":"10.1007/978-3-030-58323-1_27","title":"Authorship Verification with Personalized Language Models","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","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":"Computer science; Reputation; Social media; Task (project management); Word (group theory); Language model; Support vector machine; Class (philosophy); Artificial intelligence; Natural language processing; Machine learning; World Wide Web","score_opus":0.02136597471387049,"score_gpt":0.23353636150388368,"score_spread":0.21217038679001318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082105611","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.025520701,0.0005431178,0.95699036,0.000889364,0.00036687282,0.00015606181,0.0013107102,0.00911001,0.005112929],"genre_scores_gemma":[0.74135476,0.0003470354,0.23730503,0.00052446604,0.0005302484,0.00019433803,0.003965946,0.00090573035,0.014872389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935196,0.00270608,0.0004226962,0.001551478,0.001236057,0.00056406594],"domain_scores_gemma":[0.98211527,0.008677118,0.0008970596,0.006519688,0.0014770067,0.0003138787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039158054,0.0009937746,0.0016988087,0.0020190899,0.0013212583,0.0030571248,0.0017602738,0.0025374745,0.008575365],"category_scores_gemma":[0.019553924,0.0009656547,0.0017124261,0.001317247,0.0010674853,0.0061311233,0.003316668,0.002316759,0.008388303],"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.0010160002,0.0005522628,0.0055692694,0.000337115,0.00033495825,0.0008131246,0.00031853854,0.10389116,0.017685475,0.034800645,0.038329657,0.7963518],"study_design_scores_gemma":[0.00004796332,0.000069522306,0.00057977706,0.000036765145,0.00004980067,0.00028561012,0.00008367544,0.90442824,0.013435268,0.077297784,0.003652119,0.000033499444],"about_ca_topic_score_codex":0.0014419367,"about_ca_topic_score_gemma":0.0027076644,"teacher_disagreement_score":0.008575365,"about_ca_system_score_codex":0.0006451062,"about_ca_system_score_gemma":0.0017088644,"threshold_uncertainty_score":0.028687418},"labels":[],"label_agreement":null},{"id":"W3082166776","doi":"10.1007/978-3-030-58150-3_47","title":"Even Better Fixed-Parameter Algorithms for Bicluster Editing","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Algorithm","score_opus":0.027015017549112483,"score_gpt":0.2637856606953823,"score_spread":0.2367706431462698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082166776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039349394,0.0007678784,0.982959,0.000458433,0.00046186204,0.000063507396,0.00024896444,0.0064353114,0.0046700607],"genre_scores_gemma":[0.031726263,0.00026554771,0.95403475,0.00049171236,0.00024630263,0.00013136379,0.0008985715,0.0028216813,0.009383846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964623,0.0010575178,0.0002900917,0.0010325399,0.0009173,0.00024036286],"domain_scores_gemma":[0.9885443,0.0039028237,0.00027839816,0.005851453,0.0011474023,0.0002756243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002857739,0.0021797658,0.0020624725,0.0015890382,0.0012201709,0.0035582108,0.0041260077,0.003096258,0.038954735],"category_scores_gemma":[0.020802606,0.0010061944,0.0020013275,0.0033506148,0.0016894122,0.007737281,0.003069564,0.004766847,0.017966075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096266915,0.00027097246,0.0005361081,0.00037150976,0.00017202404,0.00015470674,0.00034729752,0.046460263,0.019702084,0.062649004,0.051691014,0.81668234],"study_design_scores_gemma":[0.00037643386,0.00023969568,0.00061345595,0.00015620355,0.00012292402,0.0006662165,0.00025140852,0.64803606,0.030948237,0.24267554,0.07572799,0.00018579977],"about_ca_topic_score_codex":0.0019975244,"about_ca_topic_score_gemma":0.0048801024,"teacher_disagreement_score":0.038954735,"about_ca_system_score_codex":0.0010285738,"about_ca_system_score_gemma":0.0009653222,"threshold_uncertainty_score":0.13031656},"labels":[],"label_agreement":null},{"id":"W3082212141","doi":"10.1007/978-3-319-49583-5","title":"Algorithms and Architectures for Parallel Processing","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":173,"is_retracted":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":"Computer science; Parallel computing; Parallel processing","score_opus":0.016590815646636992,"score_gpt":0.2676664535930699,"score_spread":0.2510756379464329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082212141","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017813339,0.0070579383,0.95083934,0.0007948272,0.0011098773,0.000096498225,0.0002667615,0.0035743732,0.03447916],"genre_scores_gemma":[0.04216345,0.009716127,0.89287794,0.00041524673,0.0014057406,0.0004747626,0.001074271,0.001340011,0.050532486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931896,0.00011898901,0.000058208974,0.00011112096,0.0003292512,0.00006341452],"domain_scores_gemma":[0.9991854,0.00024429793,0.000036454632,0.00029182917,0.00021427867,0.000027744096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218979,0.0018059915,0.0012071743,0.0011766305,0.0008066729,0.0025319518,0.0020325196,0.0010607833,0.022628479],"category_scores_gemma":[0.002390124,0.00088350923,0.0008291273,0.0030932645,0.0009817801,0.0031782917,0.0015116113,0.0025438005,0.011837269],"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.00014616815,0.00006992955,0.00015873894,0.0006897123,0.0000977648,0.00007744616,0.00007824877,0.04517818,0.004612363,0.32867426,0.075233676,0.54498345],"study_design_scores_gemma":[0.00006927441,0.00005149181,0.00015467643,0.00010003723,0.00005577998,0.00018233214,0.00002897942,0.17984055,0.005632278,0.6583417,0.1555128,0.00003013676],"about_ca_topic_score_codex":0.0008739679,"about_ca_topic_score_gemma":0.0009622914,"teacher_disagreement_score":0.022628479,"about_ca_system_score_codex":0.0008005846,"about_ca_system_score_gemma":0.0010086693,"threshold_uncertainty_score":0.075699806},"labels":[],"label_agreement":null},{"id":"W3082276589","doi":"10.1007/978-3-030-58465-8_7","title":"A Driving Simulator Study Exploring the Effect of Different Mental Models on ADAS System Effectiveness","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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 Windsor","funders":"","keywords":"Driving simulator; Computer science; Advanced driver assistance systems; Simulation; Mental model; Work (physics); Control (management); Reading (process); Standard deviation; Position (finance); Artificial intelligence; Psychology; Engineering; Statistics; Mathematics","score_opus":0.042030849611059275,"score_gpt":0.3233178983748102,"score_spread":0.2812870487637509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082276589","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.99965775,0.0000059392482,0.00009873923,0.0000048205875,0.000002073714,0.000025290927,0.000026031359,0.0000039892598,0.00017540655],"genre_scores_gemma":[0.99866354,0.000021485894,0.00038193737,0.00001933248,0.0000037949817,0.00006787191,0.00012584956,0.0000069691046,0.0007091856],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926645,0.00035065954,0.00008044644,0.00009232319,0.00013056837,0.00007955168],"domain_scores_gemma":[0.9896125,0.008113552,0.0005850128,0.000451292,0.00060324534,0.00063425465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219097,0.0005824899,0.000392591,0.00040725115,0.00036907013,0.000820315,0.00068146846,0.0006595631,0.0029376405],"category_scores_gemma":[0.007713222,0.00049471733,0.0004728729,0.00023068656,0.0003832512,0.0007814033,0.00041060484,0.0007520349,0.00045403908],"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.093162976,0.1965735,0.2164325,0.0013232012,0.001714034,0.0013788908,0.03460804,0.018952383,0.30098897,0.0015372217,0.0022794178,0.13104892],"study_design_scores_gemma":[0.004612806,0.42667037,0.44660783,0.00007329128,0.0011917277,0.00073275244,0.011398062,0.04025731,0.06292938,0.001014522,0.004164224,0.00034786473],"about_ca_topic_score_codex":0.0028640523,"about_ca_topic_score_gemma":0.0027016734,"teacher_disagreement_score":0.0029376405,"about_ca_system_score_codex":0.00038756846,"about_ca_system_score_gemma":0.00037627993,"threshold_uncertainty_score":0.009827375},"labels":[],"label_agreement":null},{"id":"W3082489414","doi":"10.1007/978-3-030-66172-4_6","title":"ArchiveSafe: Mass-Leakage-Resistant Storage from Proof-of-Work","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vector Institute; University of Waterloo; McMaster University","funders":"","keywords":"Encryption; Computer science; Computer security; On-the-fly encryption; File system; Information leakage; Filesystem-level encryption; Cryptography; Adversary; Disk encryption; Client-side encryption; Confidentiality; Operating system","score_opus":0.02762596131567758,"score_gpt":0.265626939566902,"score_spread":0.2380009782512244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082489414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014482333,0.0024346302,0.91345906,0.0028864662,0.0012014892,0.00054366916,0.0024528163,0.040514372,0.022025155],"genre_scores_gemma":[0.60583746,0.0022720678,0.32299563,0.0024971922,0.0013861151,0.0013637206,0.0055678673,0.009855464,0.048224412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909949,0.0023296762,0.000712236,0.0010750977,0.0037016273,0.0011864031],"domain_scores_gemma":[0.9700935,0.007042018,0.0010337029,0.01955039,0.0017783451,0.00050192635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004943867,0.0023550505,0.002695889,0.0022910438,0.0024419855,0.0066474983,0.005427564,0.0034991063,0.02946104],"category_scores_gemma":[0.026039658,0.0018864082,0.002231839,0.0024920984,0.004300149,0.01313987,0.01757015,0.0059529175,0.013825011],"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.002156457,0.00040205833,0.0010578169,0.0016263678,0.000323259,0.00066338404,0.0008989458,0.019759795,0.019536292,0.49343488,0.11928257,0.34085816],"study_design_scores_gemma":[0.00031228922,0.00021411886,0.00024488242,0.00030393316,0.00015158315,0.00066560734,0.00016574425,0.07199664,0.04243242,0.823991,0.059367016,0.0001547835],"about_ca_topic_score_codex":0.0005519173,"about_ca_topic_score_gemma":0.00073042087,"teacher_disagreement_score":0.02946104,"about_ca_system_score_codex":0.0015209218,"about_ca_system_score_gemma":0.0045536985,"threshold_uncertainty_score":0.098556936},"labels":[],"label_agreement":null},{"id":"W3082724384","doi":"10.1007/978-3-030-58468-9_12","title":"Vestibular Damage Assessment and Therapy Using Virtual Reality","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vestibular and auditory disorders","field":"Neuroscience","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":"York University","funders":"","keywords":"Computer science; Virtual reality; Vestibular system; Human–computer interaction; Medicine; Audiology","score_opus":0.05282725182389761,"score_gpt":0.309535820914016,"score_spread":0.2567085690901184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082724384","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025517557,0.065851144,0.44256094,0.002416759,0.002457551,0.0003247417,0.0006949083,0.0022226402,0.45795384],"genre_scores_gemma":[0.18923245,0.07421291,0.15547745,0.0014150173,0.0008497113,0.00035131717,0.00071474776,0.0004163596,0.5773301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998037,0.000034664437,0.0000101664455,0.000020741723,0.00011711639,0.000013631116],"domain_scores_gemma":[0.99988604,0.000069592046,0.0000041136655,0.000008383805,0.00001994863,0.000011889591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033324413,0.00068697234,0.0003837552,0.00076447154,0.00016841991,0.0008872933,0.0006769678,0.0008129818,0.024484254],"category_scores_gemma":[0.00045388954,0.00016180293,0.00042960572,0.00032115597,0.00024689484,0.0006706975,0.0009229603,0.00061438174,0.006179367],"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.000075189026,0.00012558751,0.00030829522,0.00027187375,0.000014766001,0.00040743244,0.00017627268,0.0022044028,0.010097652,0.0056453813,0.025141548,0.9555317],"study_design_scores_gemma":[0.00009264533,0.0014208951,0.016878199,0.0021181211,0.000100500554,0.027703878,0.001161465,0.026241533,0.027093848,0.04088456,0.8561139,0.00019039633],"about_ca_topic_score_codex":0.000612891,"about_ca_topic_score_gemma":0.001096588,"teacher_disagreement_score":0.024484254,"about_ca_system_score_codex":0.00015271125,"about_ca_system_score_gemma":0.00026728652,"threshold_uncertainty_score":0.08190799},"labels":[],"label_agreement":null},{"id":"W3082766113","doi":"10.1007/978-3-030-65414-6_23","title":"Unsupervised Domain Adaptation for Plant Organ Counting","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological 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 Saskatchewan","funders":"","keywords":"Domain adaptation; Object (grammar); Domain (mathematical analysis); Computer science; Artificial intelligence; Adaptation (eye); Object detection; Image (mathematics); Computer vision; Pattern recognition (psychology); Plant species; Mathematics; Ecology; Biology","score_opus":0.03155046869710831,"score_gpt":0.22544182315915479,"score_spread":0.19389135446204647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082766113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030096058,0.0006807994,0.9621284,0.0001179519,0.00008521301,0.0000529456,0.0007973505,0.004633391,0.0014079557],"genre_scores_gemma":[0.39153352,0.0007110148,0.5896902,0.00029576753,0.00020351382,0.00021580541,0.007414062,0.0011225984,0.008813556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993955,0.0001367351,0.000027317335,0.00023783366,0.00010311352,0.00009942466],"domain_scores_gemma":[0.9989567,0.0004242319,0.000074011274,0.00026819287,0.00022086606,0.000055999997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082026067,0.0008712934,0.0013735587,0.0014412928,0.0004207609,0.0008094944,0.0019875935,0.0014045273,0.0026140658],"category_scores_gemma":[0.0018921862,0.0004320553,0.00124457,0.0017545235,0.00047268948,0.0009784712,0.0015939494,0.0012932288,0.00259128],"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.0005043791,0.00024816763,0.002203422,0.00024902704,0.00017892172,0.00015003199,0.00007147779,0.1459688,0.0656605,0.0031465923,0.011416223,0.77020246],"study_design_scores_gemma":[0.000016214524,0.000037887647,0.0015811796,0.000012511667,0.00003203316,0.00011978821,0.000029839148,0.97897995,0.011531599,0.0050752806,0.0025654885,0.000018234947],"about_ca_topic_score_codex":0.0041398695,"about_ca_topic_score_gemma":0.006483682,"teacher_disagreement_score":0.0041398695,"about_ca_system_score_codex":0.00039010297,"about_ca_system_score_gemma":0.0007238032,"threshold_uncertainty_score":0.008744895},"labels":[],"label_agreement":null},{"id":"W3082880435","doi":"10.1007/978-3-030-62401-9_10","title":"Fast Byzantine Gathering with Visibility in Graphs","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Robot; Computer science; Node (physics); Task (project management); Graph; Time complexity; Visibility; Identifier; Mobile robot; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Mathematics; Computer network; Engineering; Geography","score_opus":0.02180060328076514,"score_gpt":0.2709419330904639,"score_spread":0.24914132980969875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082880435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09663917,0.0004708079,0.88627666,0.0007726994,0.00013757075,0.00028347975,0.00057988806,0.004808326,0.010031271],"genre_scores_gemma":[0.47839415,0.00030039533,0.5112825,0.00015029001,0.00008562361,0.00020839978,0.00087832223,0.0010210837,0.0076793074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981021,0.0005124388,0.00008907238,0.0004153831,0.00043924738,0.00044165127],"domain_scores_gemma":[0.9933816,0.003211337,0.0004642329,0.002168559,0.00043522727,0.00033913998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014139916,0.0017086806,0.0022154788,0.0017345696,0.002076788,0.0024011359,0.0019494384,0.0016466924,0.007252443],"category_scores_gemma":[0.008415794,0.0010554745,0.0016837296,0.0019236167,0.0016242741,0.0059311707,0.0068239355,0.002156726,0.0016687528],"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.0029528837,0.0005137965,0.0033773761,0.0015967364,0.00029972914,0.000733105,0.001980342,0.19624756,0.047522344,0.17771387,0.030528875,0.5365333],"study_design_scores_gemma":[0.00026121794,0.0003802406,0.000690148,0.000105473584,0.00011185506,0.00028603847,0.00043579986,0.63539267,0.02603793,0.32437536,0.011859822,0.000063443884],"about_ca_topic_score_codex":0.003151102,"about_ca_topic_score_gemma":0.005380478,"teacher_disagreement_score":0.007252443,"about_ca_system_score_codex":0.00088945095,"about_ca_system_score_gemma":0.0015681022,"threshold_uncertainty_score":0.024261892},"labels":[],"label_agreement":null},{"id":"W3083041626","doi":"10.1007/978-3-030-58475-7_2","title":"Combinatorial Search in CP-Based Iterated Belief Propagation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Heuristics; Constraint programming; Constraint satisfaction problem; Iterated function; Computer science; Constraint satisfaction; Combinatorial optimization; Combinatorial search; Iterated local search; Constraint (computer-aided design); Theoretical computer science; Benchmark (surveying); Set (abstract data type); Combinatorial explosion; Mathematical optimization; Local search (optimization); Search algorithm; Algorithm; Artificial intelligence; Mathematics; Beam search; Stochastic programming; Combinatorics; Programming language","score_opus":0.015918711317595764,"score_gpt":0.24043512632256184,"score_spread":0.22451641500496608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083041626","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.008320411,0.00042193802,0.97929263,0.00030423707,0.00006592578,0.000042653544,0.00006153807,0.00024630493,0.0112442905],"genre_scores_gemma":[0.45569247,0.00074452645,0.52846724,0.0003189003,0.00023559306,0.000495696,0.00030549258,0.00040981654,0.01333028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981458,0.0009729007,0.000082182225,0.0002058811,0.00043888137,0.0001543548],"domain_scores_gemma":[0.98916143,0.00940881,0.00025370508,0.00046092158,0.000544102,0.00017103224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388598,0.00096994644,0.0019266026,0.0012126704,0.0008130969,0.0031159413,0.0036835978,0.0027619149,0.007150158],"category_scores_gemma":[0.016635325,0.0012097809,0.0014246744,0.002472194,0.0022818171,0.0038434984,0.0026718916,0.0035055317,0.00090396206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010488907,0.000058897953,0.00018533567,0.00012994533,0.000054872864,0.00005006686,0.000063678046,0.74600846,0.0004358623,0.2115971,0.002540705,0.038770147],"study_design_scores_gemma":[0.000007975676,0.000006277512,0.000016350581,0.000007649022,0.0000050514495,0.000006302316,0.0000034675486,0.96109176,0.00008274932,0.038531132,0.00023744271,0.000003772304],"about_ca_topic_score_codex":0.0076908967,"about_ca_topic_score_gemma":0.006087837,"teacher_disagreement_score":0.0076908967,"about_ca_system_score_codex":0.0022858016,"about_ca_system_score_gemma":0.0016605646,"threshold_uncertainty_score":0.023919642},"labels":[],"label_agreement":null},{"id":"W3083392746","doi":"10.1007/978-3-030-58475-7_44","title":"The Confidence Constraint: A Step Towards Stochastic CP Solvers","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Satisfiability; Scheduling (production processes); Computation; Constraint satisfaction; Random variable; Constraint programming; Binary constraint; Probability distribution; Constraint logic programming; Algorithm; Stochastic programming; Mathematics; Artificial intelligence","score_opus":0.016476273938045665,"score_gpt":0.23629550182278874,"score_spread":0.2198192278847431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083392746","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.000308875,0.00009144426,0.99665725,0.00026576812,0.000059326674,0.000020788138,0.000082087376,0.00023166915,0.0022828518],"genre_scores_gemma":[0.039161764,0.00049044326,0.9519373,0.000698721,0.00035273796,0.00031497606,0.0005635071,0.00092298357,0.0055575427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951624,0.0018746434,0.00029112137,0.00063575315,0.0018588754,0.00017723098],"domain_scores_gemma":[0.9833588,0.011877286,0.0006042386,0.0018757583,0.0019079464,0.00037604908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050444715,0.0015314419,0.0016145401,0.0009867849,0.0008081383,0.0040771854,0.0048452304,0.0026307742,0.016602011],"category_scores_gemma":[0.036597893,0.001528689,0.0016654783,0.002714669,0.0016038036,0.0051835645,0.005137517,0.00863712,0.0035365347],"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.00013332375,0.00010111435,0.0003186589,0.0003724029,0.000115972514,0.00009931543,0.00010239733,0.31478846,0.001234806,0.47660714,0.024389317,0.18173714],"study_design_scores_gemma":[0.000022309281,0.000016921018,0.000036360027,0.000045807068,0.000016643562,0.000029138217,0.000008537227,0.80555403,0.0006097826,0.18527785,0.008369472,0.0000131357665],"about_ca_topic_score_codex":0.003519217,"about_ca_topic_score_gemma":0.0039321766,"teacher_disagreement_score":0.016602011,"about_ca_system_score_codex":0.0012721143,"about_ca_system_score_gemma":0.00350974,"threshold_uncertainty_score":0.05553925},"labels":[],"label_agreement":null},{"id":"W3083699309","doi":"10.1007/978-3-030-55789-8_74","title":"Efficient Mining of Pareto-Front High Expected Utility Patterns","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Brandon University","funders":"","keywords":"Computer science; Convergence (economics); Set (abstract data type); Data mining; Mathematical optimization; Multi-objective optimization; Pareto optimal; Pareto principle; Machine learning; Mathematics","score_opus":0.02182699020125378,"score_gpt":0.24341930406334686,"score_spread":0.22159231386209308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083699309","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.170073,0.0012516243,0.82035136,0.0007705307,0.00006169206,0.00019496359,0.00164516,0.0008825012,0.0047690463],"genre_scores_gemma":[0.72591764,0.0006156943,0.2619918,0.00023203566,0.00013931934,0.00020848573,0.004524767,0.0001537276,0.006216522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984835,0.00037151438,0.00010745272,0.00028916137,0.0005311451,0.00021730298],"domain_scores_gemma":[0.99314284,0.004979036,0.0003940455,0.0005079951,0.0007971777,0.00017900947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001924493,0.00081940443,0.0015950196,0.0030758858,0.0007688133,0.0021413402,0.0020362225,0.0012538723,0.0025170972],"category_scores_gemma":[0.012038191,0.0006349319,0.0015491629,0.0029483205,0.00060810894,0.00197765,0.0014904715,0.0013383764,0.00080907485],"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.00074306084,0.00091905,0.028658187,0.0006740117,0.0004125219,0.0008666648,0.00038977645,0.30802926,0.0052999207,0.052119818,0.015605593,0.5862821],"study_design_scores_gemma":[0.000032031356,0.00008002209,0.001754362,0.000046860365,0.000036405763,0.00021210469,0.00008579216,0.93696845,0.0012607642,0.058481492,0.0010305772,0.000011118737],"about_ca_topic_score_codex":0.0014909251,"about_ca_topic_score_gemma":0.0026973113,"teacher_disagreement_score":0.0030758858,"about_ca_system_score_codex":0.0008024429,"about_ca_system_score_gemma":0.0013571854,"threshold_uncertainty_score":0.010177851},"labels":[],"label_agreement":null},{"id":"W3083731879","doi":"10.1007/978-3-030-58666-9_1","title":"Process Minding: Closing the Big Data Gap","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Big data; Closing (real estate); Data science; Computer science; Process (computing); Field (mathematics); Variety (cybernetics); Process mining; Software; Work in process; Business process management; Data mining; Business process; Artificial intelligence; Engineering; Political science","score_opus":0.09504897127498742,"score_gpt":0.27213478888489584,"score_spread":0.17708581760990844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083731879","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.012075552,0.03497214,0.73602337,0.07446603,0.004340314,0.00013583241,0.0012785265,0.0043153106,0.13239281],"genre_scores_gemma":[0.339902,0.05417362,0.50336957,0.020638414,0.007258534,0.0004995089,0.004334494,0.0032894053,0.06653444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691063,0.00097586284,0.00013577116,0.0005313044,0.0012529813,0.00019361568],"domain_scores_gemma":[0.97895104,0.014615058,0.0005953891,0.0037400133,0.0012272057,0.00087126385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007982665,0.0008888744,0.0008250747,0.0022562162,0.0010729056,0.010029404,0.00247675,0.002135081,0.010355278],"category_scores_gemma":[0.016805442,0.00071902986,0.001170768,0.0038338145,0.0049904888,0.029892733,0.0062876525,0.0059198877,0.002884594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008835092,0.000060642087,0.0006023186,0.0006645774,0.000047998565,0.00006352455,0.0018127344,0.0017806755,0.0010141934,0.6087283,0.055000912,0.33013588],"study_design_scores_gemma":[0.000011839176,0.000014257585,0.00030225277,0.00021287393,0.000014059035,0.00006291798,0.0003182323,0.004787259,0.0007428563,0.83230937,0.16120802,0.000016064743],"about_ca_topic_score_codex":0.0012922568,"about_ca_topic_score_gemma":0.0010529556,"teacher_disagreement_score":0.010355278,"about_ca_system_score_codex":0.0013173517,"about_ca_system_score_gemma":0.0029686675,"threshold_uncertainty_score":0.042216897},"labels":[],"label_agreement":null},{"id":"W30846217","doi":"10.1007/978-3-642-33122-0_28","title":"Sparse Learning Based Linear Coherent Bi-clustering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Cluster analysis; Correlation clustering; Computer science; Artificial intelligence; CURE data clustering algorithm; Data mining; Fuzzy clustering; Class (philosophy); Machine learning; Clustering high-dimensional data; Pattern recognition (psychology)","score_opus":0.024200349169078532,"score_gpt":0.2620621926915659,"score_spread":0.23786184352248735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30846217","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.0030066902,0.0003409381,0.9950512,0.00012053766,0.000040500163,0.000027296268,0.00012630215,0.00039480266,0.00089174235],"genre_scores_gemma":[0.113888,0.00065183034,0.87348795,0.0002898657,0.00015494514,0.00024798446,0.0025399541,0.00043096175,0.008308499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982559,0.0006304593,0.00010668252,0.00036648536,0.00050601515,0.00013446495],"domain_scores_gemma":[0.99749136,0.0009831388,0.00016218821,0.0005054791,0.0007573818,0.00010047088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016744877,0.0013134374,0.0022115717,0.001822104,0.0010277956,0.0015763502,0.0031040069,0.0019174014,0.003716673],"category_scores_gemma":[0.005374505,0.0010813876,0.00171851,0.0035865423,0.0009397804,0.0021065942,0.0033029579,0.0017825102,0.0030322012],"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.0003745777,0.00017938479,0.00074140757,0.00031819375,0.00031171436,0.00008931865,0.00021178118,0.41118324,0.0099114785,0.036486696,0.018146142,0.5220461],"study_design_scores_gemma":[0.000009463043,0.000024529541,0.0001391181,0.0000074167415,0.000016315298,0.000036974307,0.000014353424,0.9878641,0.0011169874,0.009547583,0.0012089304,0.000014285975],"about_ca_topic_score_codex":0.0060384856,"about_ca_topic_score_gemma":0.0089589255,"teacher_disagreement_score":0.0060384856,"about_ca_system_score_codex":0.0008986442,"about_ca_system_score_gemma":0.0013960865,"threshold_uncertainty_score":0.012433529},"labels":[],"label_agreement":null},{"id":"W3084790339","doi":"10.1007/978-3-030-58219-7_7","title":"Argument Retrieval from Web","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute of Steel Construction","keywords":"Argumentative; Computer science; Information retrieval; PageRank; Search engine; Relevance (law); Argument (complex analysis); Task (project management); World Wide Web","score_opus":0.023068733615182305,"score_gpt":0.2370536448138783,"score_spread":0.213984911198696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084790339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097943306,0.016331188,0.6221437,0.004416241,0.0013124419,0.0007130799,0.017045824,0.027692191,0.21240205],"genre_scores_gemma":[0.45393637,0.0076969434,0.3523134,0.0009484292,0.0010347201,0.00041509935,0.04964173,0.0029968726,0.13101642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999255,0.00021968444,0.000047027745,0.000121871046,0.0002970964,0.000059233254],"domain_scores_gemma":[0.99867,0.0008262376,0.00005069949,0.00023153918,0.0001808597,0.000040656138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248974,0.00077081635,0.0009644286,0.0038583938,0.000675072,0.0028397175,0.000903892,0.0011992296,0.03464388],"category_scores_gemma":[0.0058756126,0.00040074743,0.00081288157,0.0029737258,0.00037781455,0.004886667,0.0017629476,0.0011830723,0.021641305],"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.00045481627,0.00027276165,0.0007465722,0.0008686462,0.00010562747,0.00041317334,0.0003764674,0.0054669017,0.015856069,0.037507463,0.13729124,0.8006402],"study_design_scores_gemma":[0.00018341297,0.00026485874,0.0034614783,0.00053754286,0.00031554425,0.0015377321,0.0009872469,0.31246865,0.046768766,0.22913639,0.40422288,0.000115428],"about_ca_topic_score_codex":0.0008060153,"about_ca_topic_score_gemma":0.0016005253,"teacher_disagreement_score":0.03464388,"about_ca_system_score_codex":0.00062045985,"about_ca_system_score_gemma":0.0005784836,"threshold_uncertainty_score":0.11589533},"labels":[],"label_agreement":null},{"id":"W308490833","doi":"10.1007/978-3-319-16498-4_14","title":"Interior Illumination Design Using Genetic Programming","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"Brock University","funders":"","keywords":"Radiance; Computer science; Genetic programming; Window (computing); Genetic algorithm; Exploit; Interior design; Artificial intelligence; Computer vision; Optics; Architectural engineering; Machine learning; Engineering","score_opus":0.04878339261381368,"score_gpt":0.24822549734368213,"score_spread":0.19944210472986845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W308490833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005203725,0.00007414448,0.98798394,0.00003000145,0.000023682953,0.000026017706,0.000015105687,0.0002869057,0.00635651],"genre_scores_gemma":[0.25043076,0.00019855372,0.7384527,0.000106568325,0.000035603134,0.00019657091,0.00008918607,0.0003998165,0.010090307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.00006177,0.000006446417,0.000060076298,0.000072737465,0.00003719242],"domain_scores_gemma":[0.9997559,0.00011435353,0.000024603114,0.000026333084,0.00006298865,0.00001581071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004592809,0.0008100788,0.0009206434,0.0006596388,0.0004227204,0.000858442,0.0010080059,0.000945542,0.0058247843],"category_scores_gemma":[0.0008890773,0.0005587696,0.0013836807,0.0005839106,0.00054451654,0.0005797164,0.0009242512,0.0010408201,0.0008118934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004976976,0.00006824332,0.00027819345,0.000064050364,0.000026454989,0.000043092434,0.000060778537,0.8720401,0.007160779,0.011711025,0.0012966106,0.10720099],"study_design_scores_gemma":[0.000013591992,0.000032662574,0.00006445239,0.000013289067,0.0000119081315,0.000018851762,0.00001042319,0.99256456,0.0014827834,0.004407495,0.0013729843,0.000006932464],"about_ca_topic_score_codex":0.0026136728,"about_ca_topic_score_gemma":0.0027215611,"teacher_disagreement_score":0.0058247843,"about_ca_system_score_codex":0.0006953292,"about_ca_system_score_gemma":0.00061478274,"threshold_uncertainty_score":0.019485831},"labels":[],"label_agreement":null},{"id":"W3085032677","doi":"10.1007/978-3-030-59585-2_8","title":"Cognitive and Predictive Analytics on Big Open Data","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Psychology of Social Influence","field":"Social Sciences","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 Manitoba","funders":"","keywords":"Big data; Computer science; Data science; Predictive analytics; Open data; Analytics; Competition (biology); Data analysis; Variety (cybernetics); World Wide Web; Artificial intelligence; Data mining","score_opus":0.12629891790018385,"score_gpt":0.38513202691798354,"score_spread":0.25883310901779966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085032677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036753457,0.013636152,0.8773687,0.009153623,0.0008423778,0.00010011897,0.0010169643,0.0018010512,0.05932769],"genre_scores_gemma":[0.6205526,0.01626722,0.32702956,0.0008342356,0.0017305382,0.00019696042,0.0023768898,0.0004093932,0.030602548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989673,0.000277548,0.000047354664,0.0001421039,0.00049445644,0.00007124815],"domain_scores_gemma":[0.98718053,0.010811436,0.00025975617,0.0010064938,0.00053809496,0.00020377456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113878,0.0007561114,0.0005957269,0.0020535765,0.0005396815,0.00481067,0.0011129428,0.0007163481,0.004649243],"category_scores_gemma":[0.014196797,0.00039015154,0.0007714306,0.0035107692,0.0018301558,0.007659464,0.0022043167,0.0022587702,0.0009133837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008171033,0.000121910925,0.0034329642,0.00042218828,0.000083779436,0.00018443391,0.00082688365,0.030343456,0.0016689354,0.49708366,0.027034163,0.43871588],"study_design_scores_gemma":[0.0000031925977,0.000012463744,0.0012181618,0.000086584616,0.0000138139985,0.00007124267,0.0002457273,0.18030964,0.0009371627,0.8009022,0.016182937,0.000016809285],"about_ca_topic_score_codex":0.0025634496,"about_ca_topic_score_gemma":0.0030469366,"teacher_disagreement_score":0.00481067,"about_ca_system_score_codex":0.0009916617,"about_ca_system_score_gemma":0.000713945,"threshold_uncertainty_score":0.015553296},"labels":[],"label_agreement":null},{"id":"W3085057536","doi":"10.1007/978-3-030-58796-3_5","title":"Consigliere Evaluation: Evaluating Complex Interactive Systems with Users with Disabilities","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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 Prince Edward Island","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia","score_opus":0.09524741775078463,"score_gpt":0.3569122772896677,"score_spread":0.2616648595388831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085057536","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.23461705,0.025202425,0.35185602,0.004649486,0.0017418518,0.0050280383,0.0021789102,0.004502072,0.3702241],"genre_scores_gemma":[0.49835184,0.00836166,0.25880408,0.0013591787,0.00032875803,0.0048094722,0.0039771,0.0012931951,0.22271469],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9949132,0.0032805183,0.00015358574,0.00022394511,0.0013156142,0.00011298974],"domain_scores_gemma":[0.994615,0.00368152,0.00014211347,0.00030867363,0.0010857708,0.00016687477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004240673,0.0014561836,0.00066751835,0.0009133519,0.0006319273,0.0026506747,0.0009336504,0.0014430156,0.01285724],"category_scores_gemma":[0.013091864,0.00031948887,0.00053621526,0.00061808276,0.00068618194,0.0023690613,0.0013931493,0.00084460864,0.0028545463],"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.0010164134,0.0009260221,0.001803673,0.0013175268,0.000083144245,0.00013553775,0.0021537696,0.0037220274,0.009653073,0.0073385555,0.037489697,0.93436056],"study_design_scores_gemma":[0.0019566147,0.014507658,0.05380374,0.0047454596,0.0009791203,0.0026464323,0.004105795,0.098291226,0.069297366,0.044603802,0.7046636,0.00039925668],"about_ca_topic_score_codex":0.0036060591,"about_ca_topic_score_gemma":0.0053343736,"teacher_disagreement_score":0.01285724,"about_ca_system_score_codex":0.0009944078,"about_ca_system_score_gemma":0.001140117,"threshold_uncertainty_score":0.043011725},"labels":[],"label_agreement":null},{"id":"W3085136136","doi":"10.1007/978-3-030-58768-0_17","title":"Formal Verification of Human-Robot Interaction in Healthcare Scenarios","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Toolchain; Computer science; Automaton; Model checking; Formalism (music); Formal verification; Human–computer interaction; Robot; Formal methods; Representation (politics); Human–robot interaction; Artificial intelligence; Software engineering; Theoretical computer science; Programming language","score_opus":0.05406738394847032,"score_gpt":0.32825334805878387,"score_spread":0.27418596411031354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085136136","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.0074487366,0.00019524232,0.9846742,0.000277737,0.000059446877,0.0001285486,0.000101059486,0.0010222545,0.0060928483],"genre_scores_gemma":[0.63764036,0.0004616631,0.35377315,0.00020054053,0.00006695655,0.00030178402,0.00042587236,0.0002712206,0.0068583684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959539,0.001822514,0.00023456386,0.00037028242,0.0012488728,0.00036976617],"domain_scores_gemma":[0.9933466,0.0050522774,0.00028088863,0.0007230682,0.0005016482,0.000095609576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033910563,0.0006503295,0.0005733775,0.0005419124,0.00067456777,0.0021677022,0.0018292399,0.0013135587,0.0063475533],"category_scores_gemma":[0.010087229,0.0006007703,0.0013974727,0.00026743946,0.0027627805,0.002165018,0.0022611753,0.0013850123,0.0010277599],"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.000370699,0.0001895237,0.0009513241,0.00091832754,0.000100625424,0.0011044925,0.0011504531,0.24327825,0.019987594,0.62570333,0.004710182,0.10153518],"study_design_scores_gemma":[0.00011208574,0.00011679386,0.00038970326,0.00025692553,0.000053118372,0.00037998392,0.00018501311,0.6076883,0.020972533,0.3531951,0.016604783,0.000045690136],"about_ca_topic_score_codex":0.002897628,"about_ca_topic_score_gemma":0.0021742906,"teacher_disagreement_score":0.0063475533,"about_ca_system_score_codex":0.0012273922,"about_ca_system_score_gemma":0.0022712487,"threshold_uncertainty_score":0.02123475},"labels":[],"label_agreement":null},{"id":"W3085566775","doi":"10.1007/978-3-030-59051-2_28","title":"Privacy-Preserving Spatio-Temporal Patient Data Publishing","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Data publishing; Publishing; Differential privacy; Temporal database; Hierarchy; Information privacy; Big data; Focus (optics); Data science; Data mining; Internet privacy","score_opus":0.055835603072760386,"score_gpt":0.26957323304772796,"score_spread":0.21373762997496756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085566775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014550826,0.0032277766,0.96132594,0.002563358,0.00068994774,0.000104758445,0.0019429085,0.0014858921,0.014108632],"genre_scores_gemma":[0.68651843,0.008647469,0.26432723,0.0013903978,0.0016521858,0.00020828877,0.0047281617,0.00041569746,0.032112163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971328,0.0008141911,0.00032950265,0.00040118312,0.0010912862,0.00023103619],"domain_scores_gemma":[0.99019647,0.0036957539,0.0005669171,0.0047237705,0.0006366338,0.00018049787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031478251,0.00046434693,0.0011306684,0.00096549,0.0006282461,0.0035950097,0.002551751,0.0013610616,0.004305279],"category_scores_gemma":[0.012023127,0.00057430455,0.0010773194,0.0032539663,0.0010313665,0.0036846288,0.0027644706,0.0017673639,0.0026210784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008903802,0.00021254877,0.0037254642,0.0006084733,0.00021513384,0.001727848,0.0007163506,0.08279795,0.009779793,0.31931835,0.04317995,0.53682774],"study_design_scores_gemma":[0.000115563766,0.0002456941,0.0015636897,0.00016162817,0.00020005273,0.009065918,0.0004160532,0.4204801,0.036046594,0.4224776,0.10915472,0.00007238537],"about_ca_topic_score_codex":0.00047862265,"about_ca_topic_score_gemma":0.0004387234,"teacher_disagreement_score":0.004305279,"about_ca_system_score_codex":0.00065502553,"about_ca_system_score_gemma":0.0015242151,"threshold_uncertainty_score":0.016647518},"labels":[],"label_agreement":null},{"id":"W3085893373","doi":"10.1007/978-3-030-58923-3_14","title":"Architectural Technical Debt: A Grounded Theory","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Technical debt; Grounded theory; Computer science; Architectural pattern; Software engineering; Debt; Software; Software development; Management science; Qualitative research; Software design; Engineering; Business; Programming language; Finance; Sociology","score_opus":0.016722561261827036,"score_gpt":0.25364832393597747,"score_spread":0.23692576267415044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085893373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04681611,0.0034448358,0.48665577,0.023975762,0.0003471445,0.00062681537,0.0010977921,0.00028400225,0.43675175],"genre_scores_gemma":[0.8501956,0.0024935093,0.13087617,0.0011399859,0.00009239167,0.00054948445,0.0010479691,0.00021971024,0.013385124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9951519,0.0030480041,0.00025776183,0.0005167082,0.0007617475,0.00026387523],"domain_scores_gemma":[0.9866377,0.009631632,0.0005856507,0.0016546233,0.0011992821,0.00029113496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006577335,0.00082156155,0.0006670531,0.0059839194,0.0037424946,0.0077776466,0.0027535132,0.0021350535,0.009806357],"category_scores_gemma":[0.013805249,0.00097545446,0.0007114181,0.007615053,0.017840624,0.016062649,0.0036710803,0.0042878943,0.0010218472],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062042404,0.000015335827,0.00019199488,0.00005587178,0.0000034496154,0.000021194,0.002327214,0.00025395828,0.00003286466,0.9878755,0.0008410147,0.008375342],"study_design_scores_gemma":[0.000008074256,0.0000055788096,0.00020044949,0.00014672165,0.0000072876605,0.000030154994,0.0042540734,0.0012304868,0.00011250998,0.981296,0.012704035,0.0000045856573],"about_ca_topic_score_codex":0.007194731,"about_ca_topic_score_gemma":0.009318139,"teacher_disagreement_score":0.0104335835,"about_ca_system_score_codex":0.0104335835,"about_ca_system_score_gemma":0.006456937,"threshold_uncertainty_score":0.0757013},"labels":[],"label_agreement":null},{"id":"W30861034","doi":"10.1007/978-3-642-27654-5_28","title":"Triangular and Hexagonal Tile Self-assembly Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"Western University","funders":"","keywords":"Tile; Equilateral triangle; Hexagonal crystal system; Square (algebra); Computer science; Division (mathematics); Packing problems; Hexagonal tiling; Topology (electrical circuits); Geometry; Mathematics; Combinatorics; Algorithm; Materials science; Crystallography; Arithmetic","score_opus":0.013274098434641314,"score_gpt":0.2121588822323159,"score_spread":0.1988847837976746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30861034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3097528,0.0036334656,0.42755693,0.0005261816,0.0006494334,0.00012728994,0.00038515494,0.0006473934,0.25672135],"genre_scores_gemma":[0.868835,0.0012277022,0.06611487,0.00008904749,0.00008929947,0.00011065358,0.00033507205,0.00008143769,0.06311686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999923,0.000012324827,0.000004307894,0.000015134689,0.0000254758,0.00001970193],"domain_scores_gemma":[0.99991417,0.000021850368,0.0000132848445,0.000017444872,0.000018075418,0.000015132103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081615304,0.00018958759,0.00026891116,0.0002540079,0.00033662,0.00066576037,0.0004088505,0.0004605598,0.006379631],"category_scores_gemma":[0.00040868486,0.00015918625,0.0002593649,0.00029604966,0.00044919812,0.00050023716,0.0005789674,0.00026775582,0.0006114513],"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.000105057814,0.000048132377,0.00042067815,0.0001957863,0.000017902503,0.00025889056,0.000314515,0.17821962,0.020420417,0.71337104,0.007612846,0.07901515],"study_design_scores_gemma":[0.000037935828,0.000116171,0.0008136096,0.000028137392,0.00001103019,0.0002449481,0.00013154537,0.644319,0.0052027083,0.31939167,0.029669097,0.00003417751],"about_ca_topic_score_codex":0.00084281544,"about_ca_topic_score_gemma":0.0010649038,"teacher_disagreement_score":0.006379631,"about_ca_system_score_codex":0.00026994766,"about_ca_system_score_gemma":0.00021351814,"threshold_uncertainty_score":0.02134198},"labels":[],"label_agreement":null},{"id":"W3086117886","doi":"10.1007/978-3-030-53552-0","title":"Learning and Intelligent Optimization","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Management science; Artificial intelligence; Optimization problem; Operations research; Mathematical optimization; Algorithm; Mathematics; Engineering","score_opus":0.019819963772325627,"score_gpt":0.2804922444318599,"score_spread":0.26067228065953424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086117886","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045371456,0.08011345,0.4264763,0.0053056595,0.0024585163,0.000062182786,0.00028381022,0.00084001577,0.47992292],"genre_scores_gemma":[0.13956207,0.055730898,0.14569622,0.0018170394,0.0032946859,0.00028411596,0.00069816376,0.0008301446,0.6520867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977654,0.000055197466,0.000008493812,0.000038933318,0.00010516207,0.000015708774],"domain_scores_gemma":[0.9997613,0.00013297064,0.000014069374,0.000047953556,0.000031600684,0.000012181616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032974224,0.0009533968,0.0011376294,0.0006385043,0.00033669607,0.0014765004,0.0005985812,0.00072452775,0.019335238],"category_scores_gemma":[0.0010392051,0.00033782978,0.00048951915,0.0011115533,0.0011461541,0.0018029861,0.0010053804,0.0017153984,0.0064304536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027618826,0.00005685182,0.00018412095,0.0004010162,0.000057993304,0.000039252656,0.00010111713,0.037478883,0.0010652755,0.42306706,0.10913434,0.4283865],"study_design_scores_gemma":[0.000011961344,0.00004123585,0.00041026584,0.00018047652,0.00002245395,0.00010812859,0.000040514205,0.05949474,0.0010228559,0.66683227,0.27181804,0.000017049628],"about_ca_topic_score_codex":0.00063215854,"about_ca_topic_score_gemma":0.0008758987,"teacher_disagreement_score":0.019335238,"about_ca_system_score_codex":0.00066385174,"about_ca_system_score_gemma":0.00039621996,"threshold_uncertainty_score":0.06468284},"labels":[],"label_agreement":null},{"id":"W3086426149","doi":"10.1007/978-3-030-58219-7_13","title":"Twitter User Profiling: Bot and Gender Identification","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Dalhousie University","funders":"","keywords":"Computer science; Profiling (computer programming); Artificial intelligence; Identification (biology); Social media; Natural language processing; Information retrieval; Set (abstract data type); World Wide Web","score_opus":0.04060697912333124,"score_gpt":0.2598521077028582,"score_spread":0.21924512857952697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086426149","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.43298388,0.0049551637,0.35055017,0.005043948,0.0021813714,0.000644482,0.023994401,0.023611205,0.15603544],"genre_scores_gemma":[0.73488355,0.0026457808,0.11429239,0.0007318456,0.0009596664,0.0003291459,0.013408587,0.0014446134,0.13130455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995283,0.000105055275,0.000018482711,0.00008578386,0.00017274778,0.00008961028],"domain_scores_gemma":[0.9993111,0.00022781189,0.0000816825,0.000107662454,0.00015956034,0.00011217866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060891913,0.00080080016,0.0006036553,0.0019142386,0.0007998096,0.00112869,0.00053776335,0.0007638606,0.007391929],"category_scores_gemma":[0.0016357617,0.0003462947,0.00039130062,0.0011985165,0.00022087619,0.0019026742,0.0009781594,0.0005503865,0.01193002],"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.00045977623,0.000288844,0.043618783,0.00023981923,0.00005108257,0.0004737005,0.00059798686,0.0024620567,0.041477032,0.0051971395,0.123234466,0.78189933],"study_design_scores_gemma":[0.0000339806,0.0005793283,0.16038717,0.00035211636,0.00021660575,0.007325607,0.002336328,0.40883574,0.13072082,0.03170154,0.25717318,0.0003375633],"about_ca_topic_score_codex":0.0017338515,"about_ca_topic_score_gemma":0.004992087,"teacher_disagreement_score":0.007391929,"about_ca_system_score_codex":0.00043186406,"about_ca_system_score_gemma":0.00035248967,"threshold_uncertainty_score":0.024728477},"labels":[],"label_agreement":null},{"id":"W3086749086","doi":"10.1007/978-3-030-26766-7_13","title":"Learning Automata-Based Solutions to the Multi-Elevator Problem","year":2019,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Elevator Systems and Control","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":"Carleton University","funders":"","keywords":"Computer science; Elevator; Learning automata; Automaton; Artificial intelligence","score_opus":0.008700790232580023,"score_gpt":0.21356908228153892,"score_spread":0.2048682920489589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086749086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07820495,0.0002971449,0.9138915,0.0005435,0.0001016375,0.00006352547,0.00016308538,0.00067582575,0.0060588457],"genre_scores_gemma":[0.8599765,0.0001633091,0.13471685,0.0001535318,0.000055472796,0.00017600594,0.00032883632,0.00008763108,0.0043419274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960476,0.0001194408,0.000029710589,0.00012115303,0.00005299461,0.000071972456],"domain_scores_gemma":[0.9967765,0.002499542,0.00017870337,0.00014551847,0.0002920135,0.000107581276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000812775,0.0007775042,0.0009860107,0.00063215254,0.0004741333,0.0009779041,0.001545888,0.0021595971,0.004804859],"category_scores_gemma":[0.005674418,0.00054565066,0.00092297705,0.0004484904,0.00077442324,0.0011601952,0.0017438816,0.0014625201,0.0005107925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008771323,0.00004593095,0.00048017365,0.000056125813,0.000027299955,0.000038283604,0.0000508276,0.9644732,0.00064219884,0.006886372,0.00076945,0.02644242],"study_design_scores_gemma":[0.000011572842,0.000016791208,0.000035757213,0.0000037304167,0.0000037299972,0.00000383173,0.000007780256,0.9948867,0.000113521695,0.0048263287,0.00008783192,0.0000024617736],"about_ca_topic_score_codex":0.0050621806,"about_ca_topic_score_gemma":0.007110591,"teacher_disagreement_score":0.0050621806,"about_ca_system_score_codex":0.0006948387,"about_ca_system_score_gemma":0.0011581663,"threshold_uncertainty_score":0.016073823},"labels":[],"label_agreement":null},{"id":"W3086773305","doi":"10.1007/978-3-030-66823-5_16","title":"L2-Constrained RemNet for Camera Model Identification and Image Manipulation Detection","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Digital Media Forensic Detection","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 Windsor","funders":"","keywords":"Computer science; Preprocessor; Block (permutation group theory); Artificial intelligence; Convolutional neural network; Identification (biology); Categorical variable; Image (mathematics); Pattern recognition (psychology); Standard test image; Computer vision; Image processing; Machine learning; Mathematics","score_opus":0.024300206999211548,"score_gpt":0.26251434615863545,"score_spread":0.2382141391594239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086773305","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.0018225893,0.00016384956,0.9962919,0.00007538873,0.000049255617,0.000031469586,0.0001834001,0.000603649,0.00077861757],"genre_scores_gemma":[0.17701589,0.000643981,0.7993037,0.00045910318,0.0002491677,0.0005022607,0.0034917374,0.0011453651,0.017188841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986255,0.00035652734,0.000069182846,0.00033690172,0.00044263448,0.00016932181],"domain_scores_gemma":[0.9982596,0.0008285022,0.00012359384,0.0002853344,0.0004220514,0.000080852464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016631577,0.002081466,0.0027334394,0.0015159466,0.0007911993,0.0019753727,0.0030178907,0.0030065277,0.0112075005],"category_scores_gemma":[0.005594056,0.0010856843,0.0014718061,0.0019754386,0.0009113954,0.0019930785,0.0036219677,0.0025313774,0.004989643],"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.0014001229,0.0002381571,0.00089779444,0.00048061708,0.00023001603,0.00036427728,0.00008310379,0.40746137,0.013988846,0.024449911,0.015788201,0.53461754],"study_design_scores_gemma":[0.000009570396,0.000034149387,0.00012426711,0.000013349772,0.000007640467,0.000044663055,0.000008593882,0.99153805,0.0016635599,0.0053591477,0.0011855187,0.000011548869],"about_ca_topic_score_codex":0.0077379723,"about_ca_topic_score_gemma":0.007931895,"teacher_disagreement_score":0.0112075005,"about_ca_system_score_codex":0.0008237506,"about_ca_system_score_gemma":0.00216789,"threshold_uncertainty_score":0.03749281},"labels":[],"label_agreement":null},{"id":"W3087750740","doi":"10.1007/978-3-030-67070-2_1","title":"AIM 2020 Challenge on Efficient Super-Resolution: Methods and Results","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Social Innovation; McMaster University","funders":"","keywords":"Computer science; Image (mathematics); Focus (optics); Resolution (logic); Set (abstract data type); FLOPS; Magnification; Artificial intelligence; Factor (programming language); Superresolution; State (computer science); Algorithm; Parallel computing","score_opus":0.0374974150302877,"score_gpt":0.3556962747484532,"score_spread":0.3181988597181655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087750740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035431564,0.014152252,0.93532705,0.012501116,0.0024720917,0.00022721215,0.0022129095,0.0022136483,0.027350523],"genre_scores_gemma":[0.05642092,0.015449148,0.8472341,0.005922046,0.0052579218,0.0008151908,0.0105827255,0.002266279,0.056051694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963211,0.0008535921,0.00013779511,0.00043899514,0.001949872,0.00029868752],"domain_scores_gemma":[0.9895689,0.0046109054,0.00026092207,0.0015969505,0.0030701607,0.0008921964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007614141,0.0023263518,0.0022391777,0.0014761391,0.000970754,0.0041567176,0.003478353,0.0054690205,0.018265411],"category_scores_gemma":[0.015902929,0.0011408519,0.0012933488,0.0015621799,0.0020227472,0.004644645,0.006033997,0.0067450404,0.0137565015],"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.0010125145,0.00023542879,0.00034123875,0.0025713642,0.0002959739,0.00024256553,0.00019064533,0.028480021,0.025291232,0.29529363,0.27172875,0.37431657],"study_design_scores_gemma":[0.00015841232,0.00028899324,0.0010399238,0.000459224,0.00014086918,0.00081924844,0.00011259715,0.27865088,0.034754053,0.43384624,0.24961112,0.00011839408],"about_ca_topic_score_codex":0.0022752234,"about_ca_topic_score_gemma":0.001593425,"teacher_disagreement_score":0.018265411,"about_ca_system_score_codex":0.0013386594,"about_ca_system_score_gemma":0.003134338,"threshold_uncertainty_score":0.06110382},"labels":[],"label_agreement":null},{"id":"W3087853503","doi":"10.1007/978-3-030-59137-3_39","title":"A CIG Integration Framework to Provide Decision Support for Comorbid Conditions Using Transaction-Based Semantics and Temporal Planning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Semantics (computer science); Database transaction; A priori and a posteriori; Medical diagnosis; SNOMED CT; Comorbidity; System integration; Artificial intelligence; Machine learning; Programming language; Database; Medicine","score_opus":0.04450801603922365,"score_gpt":0.314975447369897,"score_spread":0.27046743133067336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087853503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031168016,0.00030468317,0.9708208,0.00025144668,0.00013479179,0.0002316999,0.0009334488,0.015220965,0.008985372],"genre_scores_gemma":[0.08641748,0.000436931,0.9022596,0.0002933125,0.000076216034,0.00026863685,0.0028409187,0.0012854633,0.006121492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878365,0.00019745233,0.0001720985,0.00024457704,0.00046754148,0.00013471695],"domain_scores_gemma":[0.99862456,0.00045449994,0.00007655609,0.00031499573,0.00040795567,0.00012148744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002467226,0.0011082592,0.001080798,0.003037812,0.0010279357,0.004216032,0.0031179418,0.0014773485,0.0118900165],"category_scores_gemma":[0.004487944,0.000665584,0.0017954712,0.0027954704,0.0009074183,0.003106562,0.0031318152,0.0019171123,0.003650863],"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.00052263757,0.0005451509,0.0045509357,0.00065267493,0.00041007,0.001968443,0.00078015233,0.15909134,0.007561961,0.25483844,0.049680483,0.5193978],"study_design_scores_gemma":[0.00012716973,0.00007438387,0.00050524867,0.00019335115,0.00034922865,0.00076317554,0.00026282304,0.764332,0.01278624,0.124698795,0.095786735,0.00012081457],"about_ca_topic_score_codex":0.014239918,"about_ca_topic_score_gemma":0.02140147,"teacher_disagreement_score":0.014239918,"about_ca_system_score_codex":0.0008931418,"about_ca_system_score_gemma":0.0030773222,"threshold_uncertainty_score":0.039776087},"labels":[],"label_agreement":null},{"id":"W3087873390","doi":"10.1007/978-3-030-58577-8_3","title":"Towards Efficient Coarse-to-Fine Networks for Action and Gesture Recognition","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Gesture recognition; Gesture; Action recognition; Action (physics); Speech recognition; Artificial intelligence; Human–computer interaction","score_opus":0.038039217130177105,"score_gpt":0.26417632911279015,"score_spread":0.22613711198261305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087873390","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.0068401466,0.00040415642,0.98627186,0.00013107162,0.000073112395,0.000053249067,0.00025624057,0.004289095,0.0016810286],"genre_scores_gemma":[0.20870742,0.0006908244,0.7694165,0.00056201563,0.0001660363,0.00025550267,0.001770597,0.0005862509,0.017844828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994092,0.000066090164,0.00003520522,0.00022507149,0.00013154723,0.00013299458],"domain_scores_gemma":[0.9991399,0.00037372866,0.00006178776,0.00022470763,0.0001348272,0.00006500744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085545756,0.0020638667,0.0022256041,0.0010166435,0.0008130009,0.0016115544,0.0032067008,0.0025270924,0.008650947],"category_scores_gemma":[0.0018371649,0.0011747405,0.001156647,0.0013762874,0.0010260693,0.002256068,0.0027813124,0.0026941935,0.0042229183],"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.00031988142,0.00023553176,0.0005426592,0.00016095498,0.00010298249,0.00010004335,0.000072377814,0.17721646,0.031510144,0.010038182,0.0114366915,0.7682642],"study_design_scores_gemma":[0.000010177485,0.00004631241,0.00023912873,0.000011276122,0.000013801755,0.000040427007,0.000019638243,0.97991794,0.006253079,0.0115224775,0.0019149572,0.000010757821],"about_ca_topic_score_codex":0.018051557,"about_ca_topic_score_gemma":0.03828571,"teacher_disagreement_score":0.018051557,"about_ca_system_score_codex":0.0010925875,"about_ca_system_score_gemma":0.001329959,"threshold_uncertainty_score":0.035892963},"labels":[],"label_agreement":null},{"id":"W3087924192","doi":"10.1007/978-3-030-58577-8_6","title":"Weight Excitation: Built-in Attention Mechanisms in Convolutional Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Backpropagation; Convolutional neural network; Inference; Convolution (computer science); Artificial intelligence; Block (permutation group theory); Baseline (sea); Code (set theory); Artificial neural network; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.018592354694867173,"score_gpt":0.2496386267304804,"score_spread":0.23104627203561323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087924192","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.047387984,0.0029782818,0.9224436,0.00076710276,0.00041092504,0.000034934557,0.00015517241,0.002532177,0.023289822],"genre_scores_gemma":[0.83255935,0.0022415796,0.12953676,0.0002733978,0.00029566878,0.00006450241,0.0002777628,0.00057603756,0.03417495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989307,0.000020570886,0.000005925155,0.000029972107,0.000026788048,0.00002358864],"domain_scores_gemma":[0.9996872,0.00015823674,0.000025046647,0.00005166433,0.00005555538,0.000022325441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035005977,0.0006331203,0.000322023,0.00024822442,0.00026295436,0.0011037961,0.0011445475,0.00092723523,0.006273674],"category_scores_gemma":[0.0020071866,0.00033218027,0.00023056738,0.0005437163,0.0003937041,0.001954624,0.0009792672,0.0012863998,0.0011793588],"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.00026439244,0.00010494122,0.0007483607,0.00026763356,0.00006427917,0.00015551415,0.00018165709,0.083842434,0.06252873,0.18242693,0.011203443,0.6582116],"study_design_scores_gemma":[0.000024634193,0.00006619555,0.0010277423,0.00006160285,0.000055070028,0.00010545093,0.00003166425,0.7689035,0.034215517,0.18699293,0.008490271,0.000025517007],"about_ca_topic_score_codex":0.001320706,"about_ca_topic_score_gemma":0.0016594644,"teacher_disagreement_score":0.006273674,"about_ca_system_score_codex":0.0004945615,"about_ca_system_score_gemma":0.0003052331,"threshold_uncertainty_score":0.02098757},"labels":[],"label_agreement":null},{"id":"W3087988836","doi":"10.1007/978-3-030-58942-4_25","title":"Multi-speed Gearbox Synthesis Using Global Search and Non-convex Optimization","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gear and Bearing Dynamics Analysis","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":"Autodesk (Canada); AUG Signals (Canada)","funders":"","keywords":"Simulated annealing; Computer science; Mathematical optimization; Regular polygon; Optimization problem; Algorithm; Convex optimization; Decomposition; Mathematics","score_opus":0.018315157109803578,"score_gpt":0.23354015396976088,"score_spread":0.2152249968599573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087988836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061551603,0.00017910438,0.9877567,0.000030354257,0.000026674348,0.000022521383,0.000021375306,0.00024406162,0.005563952],"genre_scores_gemma":[0.4622305,0.00034452186,0.52951205,0.00005734668,0.00004898899,0.0002225766,0.000108853004,0.00028988987,0.0071852584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998661,0.000026075899,0.000008233537,0.000028897044,0.000056007913,0.000014660687],"domain_scores_gemma":[0.99980253,0.00011225835,0.000020606565,0.000022922126,0.000032656553,0.000009043334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035613784,0.0009518843,0.0010100021,0.00046841757,0.00033428305,0.00061881304,0.0005732663,0.00075391086,0.0049856137],"category_scores_gemma":[0.0007680872,0.000628556,0.0006883725,0.00044098275,0.00030943914,0.00058013346,0.00086626736,0.00061499106,0.0008025897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079246995,0.00004717055,0.0001590293,0.0001962997,0.000042058273,0.000054302283,0.000054638593,0.82971704,0.01669553,0.0113271205,0.0014470071,0.14018062],"study_design_scores_gemma":[0.000007611403,0.000032903048,0.000050193168,0.000009044973,0.0000047419508,0.000016204925,0.0000059951653,0.9954594,0.0012657787,0.0023967812,0.00074793736,0.0000034565842],"about_ca_topic_score_codex":0.00070651027,"about_ca_topic_score_gemma":0.0013089716,"teacher_disagreement_score":0.0049856137,"about_ca_system_score_codex":0.00024712092,"about_ca_system_score_gemma":0.00037732683,"threshold_uncertainty_score":0.016678512},"labels":[],"label_agreement":null},{"id":"W3088564874","doi":"10.1007/978-3-030-60152-2_51","title":"The Impact of Trust and Fairness on Information System’s Resistance","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision 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":"HEC Montréal","funders":"","keywords":"Resistance (ecology); Business; Psychology; Computer science; Biology","score_opus":0.04266297690295368,"score_gpt":0.3209631333952905,"score_spread":0.2783001564923368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088564874","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.6464488,0.0009818515,0.0231634,0.01420165,0.0002724632,0.000073271796,0.000077795725,0.00004490216,0.31473583],"genre_scores_gemma":[0.9981352,0.000043288233,0.00028811014,0.000075882854,0.000027517726,0.000005524347,0.0000022438705,0.0000055106348,0.0014167714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99085253,0.005877993,0.00025128343,0.00051367667,0.0013314018,0.0011730993],"domain_scores_gemma":[0.9126077,0.073266685,0.004954106,0.004011803,0.0030323989,0.0021271692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010591395,0.00020355075,0.0004063685,0.00061932433,0.0017410093,0.004856655,0.0006656478,0.0018364289,0.008938757],"category_scores_gemma":[0.057227667,0.00026955522,0.00053350185,0.00059330114,0.0054653003,0.005381236,0.00220626,0.0034851113,0.00033678405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009261799,0.0003269985,0.018066589,0.0001037719,0.00010443311,0.00034725224,0.004820651,0.011235393,0.0018165181,0.9033384,0.0028984211,0.05601531],"study_design_scores_gemma":[0.00013853775,0.0005063563,0.049120795,0.00012326668,0.00013967947,0.00033686115,0.005410528,0.041981198,0.0020102058,0.8891889,0.010947519,0.00009621264],"about_ca_topic_score_codex":0.0027673552,"about_ca_topic_score_gemma":0.002001059,"teacher_disagreement_score":0.010591395,"about_ca_system_score_codex":0.0032371168,"about_ca_system_score_gemma":0.0015586168,"threshold_uncertainty_score":0.056013346},"labels":[],"label_agreement":null},{"id":"W3089055884","doi":"10.1007/978-3-030-59747-4_46","title":"Pricing and Quality Investments in a Mixed Brown-Green Product Market","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sustainable Supply Chain 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":"Université de Montréal","funders":"","keywords":"Greening; Product (mathematics); Position (finance); Sustainability; Dilemma; Business; Quality (philosophy); Supply chain; Industrial organization; Economics; Environmental economics; Marketing; Mathematics","score_opus":0.02401622862137407,"score_gpt":0.23466894910792563,"score_spread":0.21065272048655156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089055884","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.8330868,0.0014434442,0.030304294,0.0035358316,0.0001299272,0.0000792346,0.00028842,0.00015361332,0.13097858],"genre_scores_gemma":[0.9809791,0.00028267488,0.0011352298,0.000071486254,0.00007024895,0.000011450679,0.00003330967,0.000016271002,0.017400187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994961,0.00016674199,0.000017341392,0.000069931935,0.00010576743,0.00014397957],"domain_scores_gemma":[0.9979227,0.0013825388,0.0002718612,0.000073950396,0.00012600637,0.00022305225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645263,0.0005070669,0.0008617727,0.00054084865,0.00072417606,0.004743513,0.001082207,0.0024444433,0.02000913],"category_scores_gemma":[0.004303115,0.0006078285,0.00073963567,0.0007008871,0.0014240355,0.006324755,0.001095103,0.0022915287,0.00064538437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015194911,0.00076942396,0.004545242,0.00015727214,0.00006787058,0.0010312757,0.00041824998,0.10593523,0.0074346904,0.827074,0.0074892864,0.043557886],"study_design_scores_gemma":[0.00021873317,0.000523013,0.008200104,0.000043578493,0.00011659741,0.0002735226,0.00069893815,0.46915022,0.0016899303,0.5144527,0.0045328424,0.000099854195],"about_ca_topic_score_codex":0.003742223,"about_ca_topic_score_gemma":0.0042215954,"teacher_disagreement_score":0.02000913,"about_ca_system_score_codex":0.0024975461,"about_ca_system_score_gemma":0.00083887856,"threshold_uncertainty_score":0.06693721},"labels":[],"label_agreement":null},{"id":"W3089376279","doi":"10.1007/978-3-030-57521-2_8","title":"Analysis of Differentially-Private Microdata Using SIMEX","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Université Laval","funders":"","keywords":"Microdata (statistics); Differential privacy; Confidentiality; Computer science; Data mining; Data science; Econometrics; Computer security; Mathematics; Census; Sociology; Population","score_opus":0.038330580506733616,"score_gpt":0.27242143772171196,"score_spread":0.23409085721497835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089376279","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.17536187,0.0005906988,0.8026608,0.0018587409,0.00010024613,0.0002504924,0.0016140547,0.0035176566,0.014045482],"genre_scores_gemma":[0.9082576,0.00036875292,0.07854257,0.00028162287,0.00020498056,0.00018884416,0.0020376332,0.0005015465,0.009616597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935916,0.0020849353,0.00022335371,0.0006515482,0.0024057897,0.0010427242],"domain_scores_gemma":[0.976103,0.014715848,0.0010338002,0.006160761,0.0015966354,0.00039006598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005717959,0.0009800218,0.0015250862,0.002243583,0.0014123578,0.0040057898,0.002177814,0.0009830433,0.010901124],"category_scores_gemma":[0.023450742,0.0006326012,0.0016592962,0.0026553709,0.0024250182,0.005833818,0.0038016634,0.0019362578,0.0017684123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018977633,0.00035062982,0.012034616,0.0002535253,0.00023198535,0.00052213034,0.0004458141,0.18442361,0.0075420425,0.68083227,0.013284571,0.09818105],"study_design_scores_gemma":[0.000040202503,0.0000801761,0.0013615679,0.000031138345,0.00003131022,0.00015487295,0.0001144765,0.7834036,0.0074157114,0.20437257,0.0029747009,0.000019695482],"about_ca_topic_score_codex":0.001355649,"about_ca_topic_score_gemma":0.0015499789,"teacher_disagreement_score":0.010901124,"about_ca_system_score_codex":0.0038318024,"about_ca_system_score_gemma":0.0040062554,"threshold_uncertainty_score":0.03646791},"labels":[],"label_agreement":null},{"id":"W3089508844","doi":"10.1007/978-3-030-60735-7_2","title":"Virtual Reality Orientation Game for Alzheimer’s Disease Using Real-Time Help System","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","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":"Institut Universitaire de Gériatrie de Montréal; Université de Montréal","funders":"","keywords":"Computer science; Virtual reality; Orientation (vector space); Immersion (mathematics); Human–computer interaction; Cognition; Serious game; Cognitive impairment; Cognitive load; Multimedia; Psychology","score_opus":0.04973607674487897,"score_gpt":0.3373924969418231,"score_spread":0.28765642019694415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089508844","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.4471972,0.011602912,0.3536243,0.002187419,0.0018633801,0.0010552689,0.0029534241,0.010941963,0.16857412],"genre_scores_gemma":[0.6685238,0.006824468,0.1581666,0.0012164542,0.00024093638,0.0007911532,0.002006366,0.0004024244,0.16182779],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99996006,0.000008249449,0.0000023176485,0.0000072520206,0.000012462997,0.000009648206],"domain_scores_gemma":[0.9999573,0.000016609369,0.0000022620118,0.0000020967066,0.000008136632,0.000013646139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008630397,0.0006603096,0.0002662153,0.00017861619,0.00011608384,0.00032044304,0.00063229,0.00038978813,0.013106399],"category_scores_gemma":[0.00017700842,0.00009752913,0.0003270532,0.0000632213,0.00006662961,0.00026715023,0.00043465226,0.00033913396,0.0020352441],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023954483,0.0032478112,0.0023181725,0.0011139847,0.00013667159,0.001772369,0.0008692401,0.007974539,0.10904278,0.007731267,0.124386415,0.73901135],"study_design_scores_gemma":[0.0019004721,0.009732639,0.045545675,0.001036937,0.0009456639,0.018993024,0.0015048761,0.20554309,0.091485,0.015333259,0.607422,0.0005574306],"about_ca_topic_score_codex":0.0009546662,"about_ca_topic_score_gemma":0.0014846228,"teacher_disagreement_score":0.013106399,"about_ca_system_score_codex":0.00008927601,"about_ca_system_score_gemma":0.00016201568,"threshold_uncertainty_score":0.043845296},"labels":[],"label_agreement":null},{"id":"W3089543401","doi":"10.1007/978-3-030-58942-4_9","title":"An Ising Framework for Constrained Clustering on Special Purpose Hardware","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","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 Toronto","funders":"","keywords":"Computer science; Cluster analysis; Heuristic; Benchmark (surveying); Theoretical computer science; Constraint programming; Partition (number theory); Constrained clustering; Constraint (computer-aided design); Machine learning; Artificial intelligence; Correlation clustering; Mathematical optimization; CURE data clustering algorithm","score_opus":0.036714655109650836,"score_gpt":0.3189121647864331,"score_spread":0.28219750967678225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089543401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027813632,0.0018306517,0.9002105,0.0009755182,0.00034002136,0.00006786628,0.00023055209,0.000799775,0.06773154],"genre_scores_gemma":[0.6980526,0.0024972784,0.2500113,0.0005771716,0.00041349506,0.00025049207,0.0003309975,0.0006751026,0.047191586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996977,0.00007002408,0.000011149534,0.00004332938,0.00011731176,0.000060520153],"domain_scores_gemma":[0.9995591,0.00016502995,0.00002833407,0.00014334155,0.00006800361,0.00003616422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041102737,0.0005689936,0.0009034313,0.00073433353,0.0010603605,0.0014882479,0.00185808,0.0013649195,0.0087272525],"category_scores_gemma":[0.0013342542,0.00040167783,0.0006478973,0.001203615,0.0012164685,0.0019944478,0.0010740688,0.0017140019,0.0010622567],"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.00002026264,0.000017057613,0.00004270897,0.000055535227,0.00001093566,0.000031400872,0.000029192392,0.047536083,0.0011094046,0.9394959,0.0032336235,0.008417892],"study_design_scores_gemma":[0.000008031994,0.000011433415,0.000059599377,0.0000138295,0.0000070478745,0.000030355446,0.000013153671,0.2859761,0.00039034264,0.70947075,0.004007997,0.000011460915],"about_ca_topic_score_codex":0.0021820124,"about_ca_topic_score_gemma":0.0041891746,"teacher_disagreement_score":0.0087272525,"about_ca_system_score_codex":0.0012099238,"about_ca_system_score_gemma":0.00096161815,"threshold_uncertainty_score":0.029195547},"labels":[],"label_agreement":null},{"id":"W3089564409","doi":"10.1007/978-3-030-59728-3_4","title":"Parkinson’s Disease Detection from fMRI-Derived Brainstem Regional Functional Connectivity Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Brainstem; Functional connectivity; Computer science; Neuroscience; Disease; Parkinson's disease; Artificial intelligence; Support vector machine; Classifier (UML); Machine learning; Pattern recognition (psychology); Medicine; Psychology; Pathology","score_opus":0.025479375992216943,"score_gpt":0.23278797872365797,"score_spread":0.20730860273144103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089564409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0970091,0.022084385,0.83165556,0.00096518215,0.0006081521,0.00009400839,0.0022980247,0.0019384581,0.043347135],"genre_scores_gemma":[0.52324927,0.019277865,0.4073048,0.00035079187,0.0006629125,0.00011477188,0.0027500733,0.0004341354,0.04585534],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9999682,0.000005832035,0.000001412403,0.000010921279,0.000010575146,0.0000030565884],"domain_scores_gemma":[0.9999304,0.000052074953,0.0000047637263,0.0000031675474,0.0000071779014,0.0000024357314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011820976,0.00035487217,0.00015216137,0.00031047285,0.00006263089,0.0003822201,0.00026913098,0.0003309377,0.0044615637],"category_scores_gemma":[0.00045662155,0.00014770517,0.00026883915,0.0003560579,0.00010462656,0.00035324914,0.00016179122,0.00024142585,0.0013706655],"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.0001352793,0.00003349643,0.0012856687,0.00035018113,0.00008912173,0.00046546722,0.00006428822,0.012004827,0.24387719,0.0055560176,0.011640289,0.72449803],"study_design_scores_gemma":[0.00004118715,0.00034068618,0.06634866,0.00037338084,0.00032834616,0.008775488,0.00013457063,0.5692529,0.24121654,0.047918115,0.06513682,0.00013335743],"about_ca_topic_score_codex":0.00047661425,"about_ca_topic_score_gemma":0.00226295,"teacher_disagreement_score":0.0044615637,"about_ca_system_score_codex":0.000103501276,"about_ca_system_score_gemma":0.00007513234,"threshold_uncertainty_score":0.01492542},"labels":[],"label_agreement":null},{"id":"W3089612884","doi":"10.1007/978-3-030-59725-2_68","title":"Multi-vertebrae Segmentation from Arbitrary Spine MR Images Under Global View","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Leverage (statistics); Segmentation; Pattern recognition (psychology); Adjacency list; Feature (linguistics); Vertebra; Adjacency matrix; Graph; Computer vision; Anatomy; Algorithm; Medicine","score_opus":0.015209967781366145,"score_gpt":0.24814219965346673,"score_spread":0.23293223187210058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089612884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022916043,0.0011431902,0.969893,0.0001166248,0.00007064988,0.000060439146,0.00042319,0.0016840273,0.003692921],"genre_scores_gemma":[0.18695731,0.0015727581,0.7986886,0.00009467543,0.00014681373,0.000053798223,0.0014637373,0.0010847292,0.009937574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977,0.000019286299,0.000017234477,0.00008150006,0.00008140001,0.00003053176],"domain_scores_gemma":[0.99976915,0.000067447414,0.000028182492,0.00006869536,0.0000510066,0.000015542742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030533847,0.0008321481,0.00090836635,0.0013783205,0.0003327676,0.0013063324,0.000892952,0.0013652348,0.0038748663],"category_scores_gemma":[0.0006213002,0.00080126623,0.0012673042,0.0016738566,0.00048102872,0.0009634478,0.0010824879,0.0006482506,0.0021552232],"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.00031033414,0.00004040665,0.00094137824,0.0005400274,0.00014392377,0.00043387662,0.00019745537,0.05333696,0.30514258,0.006320398,0.0042935135,0.6282991],"study_design_scores_gemma":[0.000023951556,0.00016591177,0.008074178,0.0000893008,0.00017082939,0.0027060218,0.00010425059,0.83254343,0.12412306,0.015829789,0.016105806,0.00006343739],"about_ca_topic_score_codex":0.0014679199,"about_ca_topic_score_gemma":0.0031083226,"teacher_disagreement_score":0.0038748663,"about_ca_system_score_codex":0.0003124734,"about_ca_system_score_gemma":0.00041576382,"threshold_uncertainty_score":0.012962699},"labels":[],"label_agreement":null},{"id":"W3089652464","doi":"10.1007/978-3-030-58942-4_28","title":"CP and Hybrid Models for Two-Stage Batching and Scheduling","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Computer science; Bin packing problem; Scheduling (production processes); Mathematical optimization; Constraint programming; Job shop scheduling; Heuristic; Algorithm; Bin; Artificial intelligence; Mathematics; Schedule","score_opus":0.018378803155528055,"score_gpt":0.23311934143731478,"score_spread":0.2147405382817867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089652464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005324347,0.001388868,0.9820203,0.000348692,0.00019907435,0.00004664624,0.0002904315,0.00023562067,0.010146002],"genre_scores_gemma":[0.51689863,0.005459235,0.39664516,0.00050341507,0.0006214592,0.0007495071,0.0012046439,0.00044319796,0.07747477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995474,0.00015383287,0.00002395644,0.00008930529,0.00013269964,0.0000527244],"domain_scores_gemma":[0.999113,0.0005873316,0.000057900033,0.0000840327,0.000114053415,0.000043618045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000928603,0.0012366611,0.0011409557,0.0005102684,0.00043331744,0.001878962,0.0025446087,0.0017153339,0.009784666],"category_scores_gemma":[0.002750892,0.0008040035,0.0013344778,0.0018682283,0.0007389526,0.0023907847,0.0009325521,0.002545617,0.0012300783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062036306,0.000057715282,0.000107543616,0.000147888,0.000035298046,0.000054160246,0.000026660986,0.82590675,0.0009785363,0.1445854,0.003766134,0.024271796],"study_design_scores_gemma":[0.000006232165,0.000012148924,0.00003967124,0.000005464795,0.0000057009647,0.000012296446,0.00000393015,0.9539372,0.000115247865,0.044266008,0.0015902764,0.0000057500306],"about_ca_topic_score_codex":0.0094913505,"about_ca_topic_score_gemma":0.0055633048,"teacher_disagreement_score":0.009784666,"about_ca_system_score_codex":0.0014321057,"about_ca_system_score_gemma":0.0012893596,"threshold_uncertainty_score":0.032732964},"labels":[],"label_agreement":null},{"id":"W3089737151","doi":"10.1007/978-3-030-57980-7_20","title":"A General Framework for Computing the Nucleolus via Dynamic Programming","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dynamic programming; Programming language; Algorithm","score_opus":0.02581692898765839,"score_gpt":0.24311532235237326,"score_spread":0.21729839336471488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089737151","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.001542119,0.000113904134,0.99507517,0.00010925634,0.000028138724,0.00001720788,0.00005526697,0.00019566747,0.0028631894],"genre_scores_gemma":[0.1294743,0.00053799205,0.8627821,0.00019052831,0.00018328434,0.00025773392,0.000418279,0.0006551482,0.005500576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858594,0.0005107939,0.000061758685,0.0003773408,0.00027780453,0.00018637152],"domain_scores_gemma":[0.99780077,0.0013914292,0.00010553075,0.00036683446,0.0001896254,0.00014580601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025310933,0.00128394,0.0021949208,0.0016073702,0.0015206727,0.0041961465,0.004205759,0.0022184427,0.01106824],"category_scores_gemma":[0.009142037,0.001215381,0.002035892,0.0030229462,0.0027980371,0.0056319023,0.0034963356,0.0042580464,0.0021668372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003285337,0.00003210224,0.00012529545,0.000060028786,0.00002211556,0.00002893742,0.00004316629,0.14210163,0.0006845797,0.8317991,0.0019914685,0.023078693],"study_design_scores_gemma":[0.000010488491,0.000008320241,0.000027287264,0.000013044825,0.000007162373,0.000010493855,0.000008104476,0.38898724,0.0002418236,0.6085783,0.002098656,0.000009084723],"about_ca_topic_score_codex":0.0041491627,"about_ca_topic_score_gemma":0.0045041274,"teacher_disagreement_score":0.01106824,"about_ca_system_score_codex":0.002154733,"about_ca_system_score_gemma":0.0018039416,"threshold_uncertainty_score":0.037027},"labels":[],"label_agreement":null},{"id":"W3089750468","doi":"10.1007/978-3-030-58942-4_17","title":"An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cluster analysis; Cardinality (data modeling); Computer science; Euclidean geometry; Mathematical optimization; Constrained clustering; Algorithm; Correlation clustering; Mathematics; Canopy clustering algorithm; Artificial intelligence; Data mining","score_opus":0.032993069767874895,"score_gpt":0.2621210442020565,"score_spread":0.22912797443418162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089750468","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.0011784744,0.000246745,0.9952559,0.00012859216,0.000080448364,0.000042930267,0.00012309519,0.00022427726,0.0027194512],"genre_scores_gemma":[0.054893862,0.0005646318,0.93716896,0.0002444575,0.00027006256,0.000297464,0.000802385,0.0003874955,0.00537071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836224,0.00038376058,0.000080606915,0.00036033062,0.0006713065,0.00014178033],"domain_scores_gemma":[0.9976355,0.0012663205,0.00009726217,0.00033781797,0.00055481907,0.00010825057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015867491,0.0015042673,0.0022571685,0.0012492411,0.0009801581,0.0023243134,0.004410949,0.0024852715,0.012710938],"category_scores_gemma":[0.008441484,0.0009942742,0.0017498054,0.004165099,0.0008295307,0.0032723339,0.0031048139,0.003942818,0.0027950678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016733712,0.00016669999,0.00024978304,0.00039774718,0.000093591756,0.00011530509,0.00008991538,0.6328873,0.002404337,0.065822914,0.01998108,0.27762398],"study_design_scores_gemma":[0.000014030279,0.000020097064,0.000059791633,0.000013038307,0.000009510343,0.000045362918,0.000019097619,0.96904,0.00032347598,0.028473414,0.0019731729,0.0000090240355],"about_ca_topic_score_codex":0.011312841,"about_ca_topic_score_gemma":0.0115793655,"teacher_disagreement_score":0.012710938,"about_ca_system_score_codex":0.0016039571,"about_ca_system_score_gemma":0.0033347812,"threshold_uncertainty_score":0.04252231},"labels":[],"label_agreement":null},{"id":"W3089766067","doi":"10.1007/978-3-030-61056-2_1","title":"Composition of Transformations in the Registration of Sets of Points or Oriented Points","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing and 3D Reconstruction","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Outlier; Robustness (evolution); Expectation–maximization algorithm; Computer science; Algorithm; Orientation (vector space); Point set registration; Context (archaeology); Maximization; Point (geometry); Mathematics; Artificial intelligence; Mathematical optimization; Maximum likelihood; Statistics; Geometry","score_opus":0.01692331473134778,"score_gpt":0.250738252580868,"score_spread":0.23381493784952023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089766067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023422843,0.00054576265,0.94930923,0.00012440301,0.00025537773,0.00011816662,0.00009350692,0.00083272613,0.025297955],"genre_scores_gemma":[0.16505688,0.0011670871,0.7844766,0.00015820812,0.00015417727,0.00017999862,0.0005320523,0.00091479736,0.047360253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986059,0.00029014354,0.0000811469,0.0004233986,0.00049784075,0.0001015491],"domain_scores_gemma":[0.9993309,0.00023335352,0.00007982707,0.00013890603,0.00015033153,0.000066686305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011471119,0.00051090546,0.0006657623,0.0012511159,0.0008434304,0.0022823405,0.00097492855,0.00078041916,0.0070007415],"category_scores_gemma":[0.00215473,0.0005472017,0.00104514,0.0011687858,0.002025448,0.002723691,0.0023352948,0.0015772607,0.0038775655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003327024,0.00013002918,0.000840757,0.0003832227,0.00006202609,0.00059892365,0.0010478109,0.010537388,0.047379963,0.5632491,0.0046551456,0.3707829],"study_design_scores_gemma":[0.00006991828,0.00046623658,0.0018212836,0.00019294916,0.00014541208,0.0023375456,0.0010159201,0.11836313,0.080801755,0.6550007,0.13969904,0.00008621512],"about_ca_topic_score_codex":0.0007977848,"about_ca_topic_score_gemma":0.00092544704,"teacher_disagreement_score":0.0070007415,"about_ca_system_score_codex":0.00036560238,"about_ca_system_score_gemma":0.00054107374,"threshold_uncertainty_score":0.023419797},"labels":[],"label_agreement":null},{"id":"W3089842617","doi":"10.1007/978-3-030-58799-4_65","title":"Classification of Actors in Social Networks Using RLVECO","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Computer science; Classifier (UML); Categorization; Artificial intelligence; Social network (sociolinguistics); Graph; Node (physics); Machine learning; Social network analysis; Data science; Theoretical computer science; World Wide Web","score_opus":0.039362634082580325,"score_gpt":0.27704550950975365,"score_spread":0.2376828754271733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089842617","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.5322009,0.0031608748,0.41483483,0.0017164217,0.0008373272,0.00045473294,0.018332561,0.0078118746,0.020650452],"genre_scores_gemma":[0.87866014,0.0006357967,0.08237273,0.00021328064,0.0002820405,0.00023240942,0.02430188,0.0002100874,0.013091609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947757,0.00011893222,0.00002846316,0.00015432904,0.000107619824,0.00011308639],"domain_scores_gemma":[0.9995353,0.00018314984,0.000055246284,0.00006386534,0.000104303,0.000058142454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046814463,0.0009831946,0.0005644861,0.0029474292,0.00040888632,0.0011450169,0.00073328597,0.0009722085,0.0037667537],"category_scores_gemma":[0.0012687492,0.00019898781,0.0011081615,0.0017752547,0.0003360829,0.00094136485,0.00069785817,0.0008453292,0.00318941],"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.00088484475,0.0006179683,0.060034342,0.00035901272,0.00042098635,0.00046436975,0.00027707874,0.0636635,0.019593928,0.0065771504,0.046335075,0.8007718],"study_design_scores_gemma":[0.000024399578,0.00012854727,0.011718468,0.00007413568,0.00007664029,0.00017269557,0.000238707,0.967502,0.0063085523,0.006835237,0.0068975636,0.00002312131],"about_ca_topic_score_codex":0.007344165,"about_ca_topic_score_gemma":0.01373606,"teacher_disagreement_score":0.007344165,"about_ca_system_score_codex":0.00069876993,"about_ca_system_score_gemma":0.0005861921,"threshold_uncertainty_score":0.01460284},"labels":[],"label_agreement":null},{"id":"W3089850879","doi":"10.1007/978-3-030-59716-0_5","title":"Improved Resection Margins in Surgical Oncology Using Intraoperative Mass Spectrometry","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Queen's University","funders":"","keywords":"Medicine; Perioperative; Prospective cohort study; Resection; Radiology; Surgery; Surgical resection","score_opus":0.024779867940828593,"score_gpt":0.2828160949736791,"score_spread":0.2580362270328505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089850879","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.21347706,0.19960524,0.54172593,0.005348236,0.0025115586,0.00009872464,0.0008185618,0.003121195,0.033293556],"genre_scores_gemma":[0.6646037,0.04203972,0.26935315,0.0011576216,0.0013122588,0.00006877922,0.0005024694,0.0006586246,0.020303674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997634,0.00004266946,0.000010325458,0.000041483454,0.00012826762,0.000013854859],"domain_scores_gemma":[0.99958545,0.00022952528,0.000055041954,0.000030790405,0.0000832697,0.000015914324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065457553,0.0004438461,0.00033089324,0.0006906501,0.00013771109,0.00068165944,0.00059845997,0.0006999536,0.00226295],"category_scores_gemma":[0.0013096692,0.0002660887,0.00032840826,0.00045219687,0.00025680632,0.0008677139,0.0004630346,0.00061557215,0.00083481375],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069617253,0.00008999408,0.009390499,0.0008993621,0.00007941987,0.00062527036,0.0001387618,0.005105307,0.25183588,0.0025881417,0.007978845,0.72057235],"study_design_scores_gemma":[0.00012494368,0.001981068,0.053159397,0.00074909104,0.0007315967,0.019597962,0.0005242741,0.08545749,0.6745197,0.018575711,0.14436707,0.00021163729],"about_ca_topic_score_codex":0.00030899988,"about_ca_topic_score_gemma":0.0010356323,"teacher_disagreement_score":0.00226295,"about_ca_system_score_codex":0.00018546397,"about_ca_system_score_gemma":0.00017334602,"threshold_uncertainty_score":0.0075703263},"labels":[],"label_agreement":null},{"id":"W3089919202","doi":"10.1007/978-3-030-57980-7_21","title":"How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electoral Systems and Political Participation","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Voting; Mechanism (biology); Metric (unit); Political science; Epistemology; Law; Politics","score_opus":0.04994957277876925,"score_gpt":0.29746871531552765,"score_spread":0.2475191425367584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089919202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23913513,0.0023785,0.6409494,0.010715574,0.0006080195,0.00015921301,0.00048357176,0.0005692379,0.105001315],"genre_scores_gemma":[0.91823125,0.000512217,0.05735629,0.00041274654,0.00024297784,0.00019559769,0.0002548077,0.00014897413,0.022645157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512166,0.0026535029,0.0002484142,0.00074157474,0.0006339541,0.00060084375],"domain_scores_gemma":[0.98567146,0.009382224,0.0010312663,0.0017745256,0.0011633507,0.0009771873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006584221,0.0005399982,0.0017566395,0.001078805,0.0022742806,0.005372989,0.002738128,0.0031863856,0.010798825],"category_scores_gemma":[0.02701128,0.00064805325,0.0010061063,0.0020091007,0.0031729979,0.013370728,0.0023771136,0.002741518,0.0018134026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013894137,0.000025620397,0.0003289222,0.00007563209,0.000024884152,0.000024310306,0.00023826955,0.005068247,0.000550866,0.9643162,0.0031919298,0.026016217],"study_design_scores_gemma":[0.000029062527,0.000026255453,0.00013775713,0.000016615564,0.000011263655,0.000033960172,0.00016425096,0.0301461,0.00041382966,0.96582866,0.0031742633,0.000018041927],"about_ca_topic_score_codex":0.00085823797,"about_ca_topic_score_gemma":0.00073435414,"teacher_disagreement_score":0.010798825,"about_ca_system_score_codex":0.0012850105,"about_ca_system_score_gemma":0.0011239724,"threshold_uncertainty_score":0.0361256},"labels":[],"label_agreement":null},{"id":"W3090043985","doi":"10.1007/978-3-030-60114-0_3","title":"The Effect of Device-Affordance Alignment with the User Goal on User Experience","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Retail Behavior Studies","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":"HEC Montréal","funders":"","keywords":"Affordance; Computer science; Human–computer interaction; User interface; User experience design; Programming language","score_opus":0.014620304467394232,"score_gpt":0.23763188910851485,"score_spread":0.2230115846411206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090043985","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.99167097,0.00026697852,0.0020643342,0.000059486712,0.00004132322,0.000031025964,0.00013095286,0.0001353171,0.0055994974],"genre_scores_gemma":[0.9977047,0.000061855426,0.0011475106,0.000022935694,0.000011224946,0.000023837956,0.00006276938,0.0000862963,0.00087888056],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99892646,0.00047746088,0.00007366055,0.00018275325,0.00020853152,0.00013112706],"domain_scores_gemma":[0.9660592,0.03069377,0.000976615,0.0008165591,0.0005176184,0.00093626376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013497993,0.00056514214,0.00047140237,0.00032125672,0.0002532399,0.0017978915,0.0004915501,0.000726733,0.015341611],"category_scores_gemma":[0.02449405,0.00039724985,0.0003699058,0.00031954705,0.00039991265,0.0015581361,0.0010917651,0.0007212682,0.0008026845],"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.070728764,0.0051404755,0.11865382,0.0022521268,0.00062875624,0.00096725905,0.005076112,0.015197136,0.5405391,0.0038731843,0.0023167222,0.2346266],"study_design_scores_gemma":[0.0010404947,0.015411597,0.91770333,0.00015862947,0.0011045628,0.00077735307,0.0018111796,0.023336243,0.033168953,0.0032752827,0.0020576543,0.00015466087],"about_ca_topic_score_codex":0.0011033998,"about_ca_topic_score_gemma":0.00084554474,"teacher_disagreement_score":0.015341611,"about_ca_system_score_codex":0.00023772322,"about_ca_system_score_gemma":0.0003179765,"threshold_uncertainty_score":0.051322818},"labels":[],"label_agreement":null},{"id":"W3090069572","doi":"10.1007/978-3-030-60114-0_42","title":"How Contextual Data Influences User Experience with Scholarly Recommender Systems: An Empirical Framework","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Recommender system; RSS; Computer science; Information retrieval; Empirical research; Conceptual framework; Conceptual model; World Wide Web; Database","score_opus":0.08993080607009007,"score_gpt":0.3232109513423965,"score_spread":0.23328014527230645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090069572","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.9940754,0.00024232944,0.0016278123,0.0001712554,0.000008545189,0.00003998068,0.0002529745,0.000028286378,0.0035534129],"genre_scores_gemma":[0.99770975,0.00008335118,0.001443794,0.00003590052,0.000011278495,0.000023160646,0.00019305317,0.000017257882,0.00048257355],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945701,0.0035187416,0.00033287352,0.0004959988,0.0008464516,0.0002357727],"domain_scores_gemma":[0.81948483,0.15728448,0.008288662,0.006152516,0.0056655337,0.0031240329],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005965713,0.00019637129,0.0004049904,0.0012179787,0.0007968602,0.0056825737,0.00068842596,0.0012456196,0.0037845639],"category_scores_gemma":[0.09292367,0.0003142174,0.00044221256,0.0022390555,0.00085704937,0.0042698295,0.00144378,0.0011841187,0.00077258865],"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.0016144459,0.0015053651,0.9129893,0.0004987769,0.0005486611,0.00024269136,0.026217293,0.001632012,0.0036436543,0.0025828646,0.0012586759,0.047266185],"study_design_scores_gemma":[0.00010085662,0.001917613,0.93635076,0.00018689017,0.00071782875,0.00043274573,0.030075792,0.019030372,0.003109767,0.003166943,0.00471444,0.00019608218],"about_ca_topic_score_codex":0.004462832,"about_ca_topic_score_gemma":0.0063868198,"teacher_disagreement_score":0.9943174,"about_ca_system_score_codex":0.0005666345,"about_ca_system_score_gemma":0.00050089153,"threshold_uncertainty_score":0.03155005},"labels":[],"label_agreement":null},{"id":"W3090216777","doi":"10.1007/978-3-030-60114-0_28","title":"Information Design to Save Lives: Visualizing Data in the Design of Overdose Kits","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Digital Economy","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":"Alberta Health Services; University of Alberta","funders":"","keywords":"Computer science; Usability; Iterative design; Program comprehension; Comprehension; Visualization; Data visualization; Human–computer interaction; Data collection; Demographics; Data science; Software engineering; Software; Data mining; Programming language","score_opus":0.08951706051183494,"score_gpt":0.2829235434369619,"score_spread":0.19340648292512697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090216777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07484427,0.007003688,0.67988783,0.0236542,0.001131235,0.00089658133,0.0023952676,0.010994545,0.19919248],"genre_scores_gemma":[0.34359053,0.00452375,0.60056114,0.001435003,0.00013967724,0.00062633597,0.0023949847,0.0018861707,0.04484246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977397,0.0015246033,0.00011374413,0.0001401582,0.00039356618,0.00008834088],"domain_scores_gemma":[0.9924359,0.005038868,0.00040583345,0.00077800767,0.0010004967,0.00034095268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035988875,0.0009112209,0.00037063225,0.0016195587,0.0010684207,0.0076996535,0.0015889435,0.0012641648,0.013123556],"category_scores_gemma":[0.016229877,0.0004280662,0.0005738323,0.0015651255,0.0013031363,0.006128776,0.0024020167,0.001220042,0.0024332716],"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.00029074468,0.00034479858,0.007114864,0.0018193714,0.00010520398,0.00050452905,0.032542776,0.010459654,0.0034569355,0.17407121,0.11910074,0.65018916],"study_design_scores_gemma":[0.00008771374,0.0003408447,0.0034387347,0.002118949,0.00016820565,0.0006416509,0.020581685,0.028461441,0.008188012,0.21156482,0.72427475,0.0001332061],"about_ca_topic_score_codex":0.0016070573,"about_ca_topic_score_gemma":0.0025352186,"teacher_disagreement_score":0.013123556,"about_ca_system_score_codex":0.0012202314,"about_ca_system_score_gemma":0.0018718062,"threshold_uncertainty_score":0.043902636},"labels":[],"label_agreement":null},{"id":"W3090294949","doi":"10.1007/978-3-030-59725-2_35","title":"Deep Learning Automatic Fetal Structures Segmentation in MRI Scans with Few Annotated Datasets","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fetal and Pediatric Neurological Disorders","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":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Sørensen–Dice coefficient; Pattern recognition (psychology); Region of interest; Fully automatic; Computer vision; Image segmentation","score_opus":0.012435297254459896,"score_gpt":0.24632116961516368,"score_spread":0.2338858723607038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090294949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044814944,0.007364761,0.9261744,0.00085403887,0.0003421734,0.00010594636,0.0039054349,0.009253849,0.007184349],"genre_scores_gemma":[0.2691248,0.0060168654,0.6848511,0.0005737157,0.0003112751,0.00017596454,0.01567529,0.0015801735,0.021690764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999629,0.000054986795,0.000023456623,0.00014584877,0.0000825422,0.000064123444],"domain_scores_gemma":[0.99936956,0.000288636,0.00004881167,0.00014212995,0.000115295676,0.000035553436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076875795,0.0013401022,0.0008103823,0.0010931091,0.00026406255,0.0011165704,0.0014460208,0.0015058962,0.0035571575],"category_scores_gemma":[0.001723759,0.0008218607,0.0012214285,0.0011044644,0.00033624153,0.000993962,0.0011752973,0.0013027497,0.0028286898],"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.00017314222,0.00007616359,0.0018009568,0.00028559344,0.00011789025,0.00021501668,0.00006127035,0.06842522,0.027867364,0.0028861484,0.022462888,0.87562835],"study_design_scores_gemma":[0.0000124918715,0.00008970445,0.0020915084,0.00012262231,0.00008650684,0.0006704903,0.000044751796,0.94734335,0.028551202,0.008690562,0.012264888,0.000031969492],"about_ca_topic_score_codex":0.005408218,"about_ca_topic_score_gemma":0.011992115,"teacher_disagreement_score":0.005408218,"about_ca_system_score_codex":0.0005514987,"about_ca_system_score_gemma":0.00093439757,"threshold_uncertainty_score":0.011899829},"labels":[],"label_agreement":null},{"id":"W3090343440","doi":"10.1007/978-3-030-59713-9_56","title":"A Deep Bayesian Video Analysis Framework: Towards a More Robust Estimation of Ejection Fraction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Ejection fraction; Computer science; Bayesian probability; Artificial intelligence; Workflow; Probabilistic logic; Cardiac cycle; Baseline (sea); Population; Machine learning; Cardiology; Medicine","score_opus":0.015410549463510856,"score_gpt":0.31133639622372816,"score_spread":0.2959258467602173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090343440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011894277,0.0003233667,0.9975783,0.000114815724,0.0000299479,0.000007036703,0.00010835984,0.000227191,0.00042164652],"genre_scores_gemma":[0.099176005,0.0016956313,0.8888534,0.00047497888,0.00033259977,0.00008860636,0.000895881,0.0003846465,0.008098265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.00010274403,0.000017422108,0.000107530854,0.00011031355,0.00003878301],"domain_scores_gemma":[0.9994392,0.00027028355,0.000052439245,0.000057948546,0.00014265793,0.000037572154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013242377,0.0009209356,0.0009807807,0.000633247,0.00022789375,0.0011909368,0.0012978814,0.0013650566,0.0027655303],"category_scores_gemma":[0.00288244,0.000682051,0.00084111776,0.00068283925,0.0004509159,0.0010285674,0.001295718,0.002011748,0.0015390472],"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.00014838748,0.000088873974,0.00083283056,0.0001378329,0.00014268896,0.000072172355,0.00005786637,0.18813068,0.031668585,0.022605922,0.010437262,0.7456769],"study_design_scores_gemma":[0.0000061540763,0.00001953111,0.00035738025,0.000019799063,0.000018364113,0.000049122096,0.0000041698304,0.9841568,0.0027836745,0.010209046,0.002363686,0.000012247319],"about_ca_topic_score_codex":0.0058075297,"about_ca_topic_score_gemma":0.0073687653,"teacher_disagreement_score":0.0058075297,"about_ca_system_score_codex":0.00053528283,"about_ca_system_score_gemma":0.00088477874,"threshold_uncertainty_score":0.011547446},"labels":[],"label_agreement":null},{"id":"W3090815075","doi":"10.1007/978-3-030-60128-7_52","title":"Enhancing Social Ties Through Manual Player Matchmaking in Online Multiplayer Games","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Computer science; Leverage (statistics); Complement (music); Human–computer interaction; Turns, rounds and time-keeping systems in games; Multitude; Simple (philosophy); Multimedia; World Wide Web; Game mechanics; Artificial intelligence; Video game design","score_opus":0.0316884808774036,"score_gpt":0.3100412811976899,"score_spread":0.2783528003202863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090815075","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.73620266,0.0005335521,0.09504496,0.00055764324,0.00022174961,0.00026492486,0.00010678636,0.0011372906,0.16593039],"genre_scores_gemma":[0.94448555,0.0001719051,0.027305994,0.00008102971,0.000044085726,0.00010093075,0.00007299391,0.000057267906,0.027680133],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99960464,0.000127046,0.000011573909,0.00007427034,0.000116231604,0.000066381246],"domain_scores_gemma":[0.9989502,0.000654097,0.00009167448,0.00010522196,0.00005536559,0.0001434407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005419912,0.00042354892,0.00023252603,0.00041249054,0.00066289137,0.0014562586,0.0010445706,0.0005418998,0.017562816],"category_scores_gemma":[0.00253855,0.00017589261,0.00023506745,0.0003609971,0.00027168822,0.0016949938,0.0017027874,0.0006174419,0.0022665681],"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.0011281187,0.007641322,0.0089957295,0.0006350233,0.00013505424,0.0003119638,0.0036817754,0.009415732,0.040334184,0.03629417,0.012234745,0.8791922],"study_design_scores_gemma":[0.001057933,0.0065848115,0.11931868,0.0006276073,0.0007400641,0.0018789402,0.014583612,0.38699266,0.08208727,0.21756169,0.16831698,0.00024971674],"about_ca_topic_score_codex":0.0005259986,"about_ca_topic_score_gemma":0.0018751052,"teacher_disagreement_score":0.017562816,"about_ca_system_score_codex":0.00020182747,"about_ca_system_score_gemma":0.00029371007,"threshold_uncertainty_score":0.05875343},"labels":[],"label_agreement":null},{"id":"W3090855434","doi":"10.1007/978-3-030-59861-7_30","title":"Structural Connectivity Enriched Functional Brain Network Using Simplex Regression with GraphNet","year":2020,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health","keywords":"Computer science; Simplex; Artificial intelligence; Constraint (computer-aided design); Regression; Graph; Neuroimaging; Pattern recognition (psychology); Machine learning; Theoretical computer science; Mathematics; Neuroscience","score_opus":0.0576159344100826,"score_gpt":0.2773209408015493,"score_spread":0.21970500639146667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090855434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027250906,0.00023004993,0.9681407,0.00021835785,0.00006931709,0.00007558525,0.0007047747,0.002020739,0.0012895738],"genre_scores_gemma":[0.4492998,0.0004110394,0.5384476,0.00011363354,0.00009418378,0.00041064253,0.0026945816,0.0016069579,0.0069215414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996629,0.00015005385,0.000008970216,0.00009608767,0.000051436833,0.000030619867],"domain_scores_gemma":[0.99907136,0.0005285494,0.000059235186,0.00012944042,0.00015915386,0.00005236773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093402766,0.0010885032,0.0012285413,0.0016510008,0.00076137006,0.00126721,0.0015041291,0.0009806709,0.0053987135],"category_scores_gemma":[0.0042342125,0.0007172539,0.0016723832,0.0013470666,0.0005073903,0.0013760003,0.001249479,0.0019329468,0.0014689462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023286037,0.00015639499,0.001867456,0.00021715468,0.00037959195,0.00022705177,0.00015298599,0.8428322,0.0043939934,0.02747597,0.0069883266,0.115076035],"study_design_scores_gemma":[0.0000060284356,0.000010334355,0.00016700354,0.0000057491484,0.000018488154,0.000016877571,0.0000102082595,0.99091583,0.0003783764,0.00786871,0.00059614796,0.000006215399],"about_ca_topic_score_codex":0.012838347,"about_ca_topic_score_gemma":0.02012394,"teacher_disagreement_score":0.012838347,"about_ca_system_score_codex":0.00071487745,"about_ca_system_score_gemma":0.0013060078,"threshold_uncertainty_score":0.025527239},"labels":[],"label_agreement":null},{"id":"W3090876412","doi":"10.1007/978-3-030-60735-7_10","title":"Hypocrates+: A Virtual Reality Medical Education Platform with Intelligent Real-Time Help System","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Université de Montréal","funders":"","keywords":"Frustration; Computer science; Virtual reality; Multimedia; Human–computer interaction; Virtual patient; Medical education; Psychology; Medicine","score_opus":0.023170782092297146,"score_gpt":0.2679870495065801,"score_spread":0.24481626741428295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090876412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0324679,0.0018413776,0.6877525,0.000643689,0.0007343836,0.0007214773,0.005529936,0.21205544,0.05825329],"genre_scores_gemma":[0.28074828,0.0031308231,0.4552935,0.0025509158,0.00056473986,0.0010936758,0.018981664,0.01661937,0.22101703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973994,0.000035527493,0.00001985941,0.000044906414,0.000120229335,0.000039509316],"domain_scores_gemma":[0.9997974,0.00004589303,0.000015548696,0.00003306415,0.00004082414,0.00006733241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031232298,0.0010670841,0.0006095524,0.0006087915,0.00020250135,0.0010764212,0.001778915,0.0008691218,0.04182212],"category_scores_gemma":[0.0005632492,0.0006019116,0.00067866925,0.00030191345,0.0001735074,0.0008396552,0.0019064641,0.0008119147,0.017083885],"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.0020098328,0.0005973663,0.001021296,0.0009459025,0.00018561484,0.00077537366,0.00037020957,0.009810761,0.14936212,0.008273358,0.22166267,0.6049855],"study_design_scores_gemma":[0.0009785604,0.0014019685,0.006583467,0.000253759,0.0003751016,0.0040302575,0.00014873699,0.15393439,0.14668621,0.00694572,0.67819256,0.00046926507],"about_ca_topic_score_codex":0.0008942168,"about_ca_topic_score_gemma":0.00082765036,"teacher_disagreement_score":0.04182212,"about_ca_system_score_codex":0.0002014635,"about_ca_system_score_gemma":0.000578667,"threshold_uncertainty_score":0.13990891},"labels":[],"label_agreement":null},{"id":"W3090881117","doi":"10.1007/978-3-030-60946-7_4","title":"Image-Based Subthalamic Nucleus Segmentation for Deep Brain Surgery with Electrophysiology Aided Refinement","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Subthalamic nucleus; Computer science; Electrophysiology; Segmentation; Artificial intelligence; Nucleus; Computer vision; Neuroscience; Deep brain stimulation; Medicine; Psychology; Parkinson's disease; Pathology","score_opus":0.017156011951886697,"score_gpt":0.2512429435223019,"score_spread":0.2340869315704152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090881117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00354351,0.0002940846,0.9927511,0.000060649825,0.000034215398,0.00002779971,0.00015753963,0.0013450795,0.0017860853],"genre_scores_gemma":[0.08335533,0.0007807563,0.9055677,0.00011781578,0.00005442151,0.00007884878,0.00084193714,0.0008375195,0.008365663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998704,0.000012032125,0.000007514031,0.000029601297,0.00006420135,0.000016132088],"domain_scores_gemma":[0.99983287,0.000081640384,0.000011802425,0.00002885153,0.00003830808,0.000006534088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025170197,0.000712794,0.0005451839,0.0005152431,0.00017929412,0.000844898,0.000893212,0.00073798397,0.006280098],"category_scores_gemma":[0.00067038246,0.00043475543,0.00072581595,0.00055558106,0.00022711525,0.0005031471,0.0006181308,0.0007158902,0.0024323876],"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.00010508716,0.000036882062,0.00051381555,0.00018304207,0.00006775819,0.00014915186,0.000085457985,0.10610533,0.09544797,0.006078328,0.0086252,0.78260195],"study_design_scores_gemma":[0.00001381209,0.000059791353,0.0011706807,0.00003915936,0.000041289193,0.0005808564,0.000029703777,0.9225127,0.053092793,0.009493926,0.012934199,0.00003106538],"about_ca_topic_score_codex":0.003967988,"about_ca_topic_score_gemma":0.010461526,"teacher_disagreement_score":0.006280098,"about_ca_system_score_codex":0.00033951664,"about_ca_system_score_gemma":0.00072981836,"threshold_uncertainty_score":0.021009028},"labels":[],"label_agreement":null},{"id":"W3090937968","doi":"10.1007/978-3-030-69541-5_41","title":"Utilizing Transfer Learning and a Customized Loss Function for Optic Disc Segmentation from Retinal Images","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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 Calgary","funders":"","keywords":"Optic disc; Artificial intelligence; Segmentation; Computer science; Retinal; Optic cup (embryology); Computer vision; Glaucoma; Fundus (uterus); Robustness (evolution); Sørensen–Dice coefficient; Image segmentation; Pattern recognition (psychology); Ophthalmology; Medicine","score_opus":0.01564782765400996,"score_gpt":0.2982146050625069,"score_spread":0.28256677740849695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090937968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03709115,0.00019218314,0.96062315,0.0001676387,0.000030519728,0.000050693012,0.00007979672,0.0011746234,0.0005902225],"genre_scores_gemma":[0.465134,0.00041034273,0.52927196,0.00019413847,0.000090906426,0.00013520509,0.00056959724,0.00036020187,0.0038336616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975485,0.0000525013,0.000017469092,0.00006147795,0.00007210941,0.000041558298],"domain_scores_gemma":[0.99949384,0.00017253404,0.00005120141,0.00009520078,0.00015638028,0.000030889427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010491038,0.00065434945,0.0007097066,0.0008050956,0.00030041952,0.0009183673,0.0009817961,0.0012716328,0.00132304],"category_scores_gemma":[0.0019859786,0.00036893346,0.000685939,0.0007420473,0.0004533955,0.0009613429,0.0013447796,0.000885793,0.0006783702],"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.0005136861,0.0001997546,0.0017326254,0.00017517789,0.000106834705,0.00015191268,0.00009165592,0.2321615,0.096212044,0.004372509,0.0033502022,0.66093206],"study_design_scores_gemma":[0.0000075279604,0.000036963607,0.00041445726,0.000006206231,0.000013003579,0.000057965102,0.000008981882,0.9838725,0.0135514615,0.0016550188,0.00036877958,0.000007111815],"about_ca_topic_score_codex":0.004705808,"about_ca_topic_score_gemma":0.0038001863,"teacher_disagreement_score":0.004705808,"about_ca_system_score_codex":0.00058753655,"about_ca_system_score_gemma":0.0012600715,"threshold_uncertainty_score":0.009356856},"labels":[],"label_agreement":null},{"id":"W3090987700","doi":"10.1007/978-3-030-58942-4_22","title":"Leveraging Constraint Scheduling: A Case Study to the Textile Industry","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Heuristics; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Leverage (statistics); Constraint programming; Resource constraints; Textile industry; Industrial engineering; Operations research; Distributed computing; Artificial intelligence; Mathematics; Engineering; Stochastic programming","score_opus":0.027474374922740047,"score_gpt":0.25232194952697573,"score_spread":0.22484757460423568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090987700","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.82999825,0.0008701205,0.082768574,0.0014740598,0.00018348469,0.00074478076,0.0005509943,0.0007142504,0.08269559],"genre_scores_gemma":[0.9039254,0.0007797538,0.07286438,0.00017977967,0.000041621803,0.00014090561,0.00035514304,0.00016775505,0.021545246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988951,0.000475746,0.0000364673,0.00010608992,0.00022877322,0.00025793194],"domain_scores_gemma":[0.99728954,0.0016537713,0.00018318379,0.0002657055,0.00024829264,0.00035962128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014278358,0.0008190204,0.00043769705,0.0010089529,0.0021426866,0.0018745502,0.0014597484,0.0022466327,0.0071393577],"category_scores_gemma":[0.0031665387,0.0003385865,0.0006206884,0.003422634,0.0007896929,0.0011577471,0.0011698679,0.0010107625,0.0008299834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002179911,0.005165652,0.015643178,0.0014418518,0.00017011749,0.018864943,0.0037244707,0.47982046,0.035746906,0.0446855,0.025775852,0.3667812],"study_design_scores_gemma":[0.00048588947,0.003029286,0.014357915,0.00030228557,0.00019580468,0.00370588,0.01597419,0.7604829,0.030593062,0.033255145,0.13740003,0.00021764489],"about_ca_topic_score_codex":0.012086815,"about_ca_topic_score_gemma":0.023386683,"teacher_disagreement_score":0.012086815,"about_ca_system_score_codex":0.0015271286,"about_ca_system_score_gemma":0.0020362593,"threshold_uncertainty_score":0.02403289},"labels":[],"label_agreement":null},{"id":"W3091014565","doi":"10.1007/978-3-030-60114-0_52","title":"Multiuser Human-Computer Interaction Settings: Preliminary Evidence of Online Shopping Platform Use by Couples","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"HEC Montréal","funders":"","keywords":"Computer science; Human–computer interaction; Variety (cybernetics); Interface (matter); Adaptation (eye); Task (project management); User interface; Joint (building); Cognition; World Wide Web; Artificial intelligence; Psychology","score_opus":0.14896886490308928,"score_gpt":0.3832087378696275,"score_spread":0.23423987296653823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091014565","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.9985934,0.00018050864,0.00008424706,0.000033320503,0.0000028658055,0.000010080481,0.0000769836,0.0000016064203,0.001017104],"genre_scores_gemma":[0.9993303,0.00014516157,0.00008173191,0.000023206143,0.0000028287184,0.00001798421,0.000067217115,0.0000018575407,0.0003297162],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99845624,0.0009221163,0.00010040592,0.0001791589,0.00018961738,0.00015247465],"domain_scores_gemma":[0.9906211,0.005525474,0.0020169243,0.0004854943,0.0003655762,0.000985471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359079,0.00022970856,0.00035734964,0.001351572,0.0014890367,0.001978338,0.0006444139,0.00065911503,0.006565017],"category_scores_gemma":[0.009840523,0.0005782703,0.00026400844,0.0021347417,0.0009376625,0.0012620786,0.0017011475,0.000832018,0.00076315843],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026345486,0.0004422891,0.9704146,0.00004436157,0.000073850155,0.00034184297,0.015630592,0.000028672102,0.0006152062,0.00025406352,0.00014279535,0.011748355],"study_design_scores_gemma":[0.00001339202,0.00048335778,0.97993886,0.000041165444,0.000059529317,0.00066332915,0.017750533,0.0001474817,0.00026044247,0.00020487818,0.00042303748,0.000013928898],"about_ca_topic_score_codex":0.0045190156,"about_ca_topic_score_gemma":0.006063982,"teacher_disagreement_score":0.006565017,"about_ca_system_score_codex":0.00023179424,"about_ca_system_score_gemma":0.00031315096,"threshold_uncertainty_score":0.021962106},"labels":[],"label_agreement":null},{"id":"W3091028802","doi":"10.1007/978-3-030-58942-4_19","title":"Optimizing Student Course Preferences in School Timetabling","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Quest University Canada","funders":"","keywords":"Computer science; Course (navigation); Set (abstract data type); Graph coloring; Integer programming; Graph; Linear programming; Mathematics education; Core (optical fiber); Mathematical optimization; Operations research; Theoretical computer science; Programming language; Algorithm; Mathematics; Engineering; Telecommunications","score_opus":0.09666459316536698,"score_gpt":0.36772344332159135,"score_spread":0.2710588501562244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091028802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2788327,0.0008567054,0.69592273,0.0004037777,0.000083189654,0.00021206483,0.00050656375,0.0006770922,0.02250519],"genre_scores_gemma":[0.76093507,0.0005777964,0.22058007,0.000104301784,0.000068564164,0.00019993434,0.000680995,0.00042129774,0.01643203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939,0.00029952414,0.000016847582,0.000083075836,0.00010599419,0.00010454914],"domain_scores_gemma":[0.9990362,0.0006708362,0.000066520704,0.00006364367,0.00007415657,0.00008863394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200264,0.00060293335,0.0009336367,0.0005757926,0.0002980988,0.0008583594,0.0010927931,0.0006167464,0.008827995],"category_scores_gemma":[0.0030461792,0.00046588024,0.00055075675,0.0014538903,0.0002215205,0.0011152193,0.000669471,0.0009111879,0.00086272164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004667318,0.0004264086,0.0025226977,0.00012832544,0.00005152446,0.000025038202,0.00009068586,0.6167778,0.003611839,0.013804856,0.0071011665,0.35499287],"study_design_scores_gemma":[0.000030330977,0.00015452677,0.0012025827,0.000010654631,0.00002171454,0.000015570762,0.00004843961,0.98639154,0.0012624549,0.009415229,0.0014387829,0.000008207015],"about_ca_topic_score_codex":0.0037352126,"about_ca_topic_score_gemma":0.006170527,"teacher_disagreement_score":0.008827995,"about_ca_system_score_codex":0.0009892017,"about_ca_system_score_gemma":0.0009776237,"threshold_uncertainty_score":0.029532552},"labels":[],"label_agreement":null},{"id":"W3091133972","doi":"10.1007/978-3-030-60114-0_51","title":"The Effect of Experience on Learnability and Usability of a Neuroimaging Platform","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"HEC Montréal; Centre Hospitalier Universitaire Sainte-Justine; Polytechnique Montréal","funders":"","keywords":"Learnability; Usability; Computer science; Data science; Human–computer interaction","score_opus":0.1136395357524832,"score_gpt":0.3793055417014903,"score_spread":0.2656660059490071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091133972","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.99430263,0.0004039726,0.0011810905,0.000074791235,0.000031441275,0.00003271902,0.000047987596,0.0000614596,0.0038640162],"genre_scores_gemma":[0.99671894,0.00015013835,0.0010433665,0.000041675536,0.000050129638,0.00003130201,0.000072823925,0.00007768474,0.0018139121],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9965061,0.0015413013,0.00033087394,0.0005067484,0.0007916789,0.00032338744],"domain_scores_gemma":[0.70517963,0.2765837,0.0059799287,0.0050795763,0.0033398208,0.003837393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048898794,0.0004363452,0.000379976,0.00085936725,0.00030786043,0.0017254231,0.0007133265,0.0009498472,0.010262532],"category_scores_gemma":[0.08678702,0.00039269784,0.0005949252,0.00042555973,0.000695307,0.0022748434,0.0011597693,0.00085683377,0.0005421919],"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.05175409,0.014110609,0.36281943,0.0016163932,0.0016107695,0.0016409837,0.008320563,0.007413106,0.117710985,0.00159287,0.0024482165,0.42896202],"study_design_scores_gemma":[0.00069090363,0.03582947,0.91409713,0.0002117243,0.001341081,0.0015005205,0.0022373104,0.0089130495,0.03024779,0.0024742188,0.0022284272,0.00022840558],"about_ca_topic_score_codex":0.00078545115,"about_ca_topic_score_gemma":0.0012088848,"teacher_disagreement_score":0.010262532,"about_ca_system_score_codex":0.00034173785,"about_ca_system_score_gemma":0.00036670454,"threshold_uncertainty_score":0.03433156},"labels":[],"label_agreement":null},{"id":"W3091154752","doi":"10.1007/978-3-030-60114-0_43","title":"rScholar: An Interactive Contextual User Interface to Enhance UX of Scholarly Recommender Systems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Recommender system; Computer science; Interface (matter); User interface; Situational ethics; Human–computer interaction; World Wide Web; User experience design; User modeling; Information retrieval","score_opus":0.028255224517971755,"score_gpt":0.30325509827801445,"score_spread":0.2749998737600427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091154752","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.079463616,0.0039100284,0.66242427,0.0008090248,0.0007258777,0.0014993376,0.009024025,0.20125775,0.04088612],"genre_scores_gemma":[0.22028495,0.002132295,0.69105345,0.001191614,0.00036909795,0.0016842821,0.008885825,0.010969349,0.06342914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995214,0.00018254167,0.000041744355,0.00006004655,0.0001622417,0.000032034997],"domain_scores_gemma":[0.99717015,0.0020527442,0.00007979223,0.0002193296,0.00031907426,0.00015892008],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011259168,0.0012758463,0.000743857,0.0010621384,0.00038343397,0.0020032693,0.0010026208,0.0011370643,0.05771972],"category_scores_gemma":[0.0046800007,0.0003524715,0.00056111306,0.0006808333,0.00015551945,0.0020750307,0.0021464291,0.0008511665,0.011184485],"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.0029225866,0.00067053665,0.0024559181,0.004340131,0.00022682587,0.0007304648,0.0054270597,0.0019344846,0.05701141,0.0059040007,0.16489124,0.7534853],"study_design_scores_gemma":[0.0013311023,0.0021683692,0.015754843,0.0015849074,0.0008703169,0.0014539747,0.0031483357,0.09021961,0.057642616,0.013952249,0.8113164,0.00055738754],"about_ca_topic_score_codex":0.0007052419,"about_ca_topic_score_gemma":0.0025891438,"teacher_disagreement_score":0.99799675,"about_ca_system_score_codex":0.00018797317,"about_ca_system_score_gemma":0.00024100773,"threshold_uncertainty_score":0.19309169},"labels":[],"label_agreement":null},{"id":"W3091223841","doi":"10.1007/978-3-030-60735-7_8","title":"Real-Time Gesture Recognition Using Deep Learning Towards Alzheimer’s Disease Applications","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Université de Montréal","funders":"","keywords":"Computer science; Skeleton (computer programming); Artificial intelligence; Computer vision; Cartesian coordinate system; Human skeleton; Position (finance); Interpolation (computer graphics); Representation (politics); Coordinate system; Convolutional neural network; Convolution (computer science); Gesture; Image (mathematics); Pattern recognition (psychology); Artificial neural network; Mathematics; Geometry","score_opus":0.03884705790335233,"score_gpt":0.2703443831086751,"score_spread":0.23149732520532276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091223841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23370548,0.023833103,0.7080381,0.0015366946,0.0011114075,0.00016934468,0.0051143835,0.006745883,0.019745508],"genre_scores_gemma":[0.7196068,0.007842458,0.23657206,0.00078747515,0.0004131449,0.00011007698,0.0041709845,0.00030781687,0.03018918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988437,0.00001220677,0.000007924219,0.000036863894,0.000032396445,0.000026247628],"domain_scores_gemma":[0.9998779,0.000034891887,0.000013033708,0.000011560348,0.00004825557,0.000014375044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026679083,0.00087694544,0.00047656335,0.000654798,0.00012022621,0.0005682844,0.00047322238,0.00059002364,0.0025634544],"category_scores_gemma":[0.00041279063,0.0001970788,0.000555813,0.0005683765,0.00011849654,0.00033581132,0.0004674822,0.00060611934,0.001856466],"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.00031286673,0.00013553133,0.0043167747,0.00020399265,0.00008001635,0.00030678348,0.00004055936,0.009130458,0.055221543,0.00066421885,0.014315072,0.9152721],"study_design_scores_gemma":[0.0000529009,0.0006002447,0.027608287,0.00029176552,0.00033747283,0.0024974933,0.00012171473,0.7972024,0.13640355,0.005781364,0.029003497,0.00009927873],"about_ca_topic_score_codex":0.003399023,"about_ca_topic_score_gemma":0.007700335,"teacher_disagreement_score":0.003399023,"about_ca_system_score_codex":0.00019714196,"about_ca_system_score_gemma":0.00030135326,"threshold_uncertainty_score":0.008575559},"labels":[],"label_agreement":null},{"id":"W3091246508","doi":"10.1007/978-3-030-59713-9_41","title":"CDF-Net: Cross-Domain Fusion Network for Accelerated MRI Reconstruction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Vector Institute; University of Toronto; University Health Network","funders":"","keywords":"Computer science; Frequency domain; Artificial intelligence; Iterative reconstruction; Deep learning; Interpolation (computer graphics); Domain (mathematical analysis); Margin (machine learning); Algorithm; Artificial neural network; Inpainting; Pattern recognition (psychology); Computer vision; Data mining; Machine learning; Image (mathematics); Mathematics","score_opus":0.029767781178996318,"score_gpt":0.3171117437897072,"score_spread":0.2873439626107109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091246508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021927285,0.0003525415,0.9849637,0.00010437275,0.00011897516,0.000044769207,0.00052175875,0.00890357,0.0027975969],"genre_scores_gemma":[0.069800325,0.00081024325,0.9075075,0.0002820219,0.0001226371,0.00018898498,0.003005938,0.0016893669,0.01659292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.00003301734,0.000009967071,0.00004767706,0.00010277553,0.00002569033],"domain_scores_gemma":[0.9996722,0.00010440555,0.000019128247,0.000068298075,0.00010772087,0.00002822766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074911333,0.0008150801,0.0006148067,0.00081693113,0.0003802744,0.0010106686,0.0013655598,0.00090660376,0.018097721],"category_scores_gemma":[0.0014267327,0.00041468441,0.0005892768,0.000839154,0.00032004554,0.0010265611,0.0014632995,0.001237087,0.0063615474],"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.00043505122,0.000102106664,0.0005928147,0.00018701953,0.00010534427,0.00019777723,0.000057327692,0.089557275,0.01968834,0.017848564,0.070052855,0.8011756],"study_design_scores_gemma":[0.00002678733,0.000060469607,0.0003316632,0.000027372485,0.000025490273,0.0002783584,0.000019792902,0.9369944,0.018852653,0.013924474,0.029428296,0.000030214293],"about_ca_topic_score_codex":0.003651357,"about_ca_topic_score_gemma":0.005561965,"teacher_disagreement_score":0.018097721,"about_ca_system_score_codex":0.00059635664,"about_ca_system_score_gemma":0.00078161445,"threshold_uncertainty_score":0.06054294},"labels":[],"label_agreement":null},{"id":"W3091468588","doi":"10.1007/978-3-030-60334-2_19","title":"Kinematics Data Representations for Skills Assessment in Ultrasound-Guided Needle Insertion","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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":"Carleton University","funders":"","keywords":"Computer science; Kinematics; Ultrasound; Engineering drawing; Computer vision; Artificial intelligence; Medical physics; Radiology; Medicine; Engineering","score_opus":0.04333267318333246,"score_gpt":0.31596229422015504,"score_spread":0.2726296210368226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091468588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047631,0.0005108147,0.9806943,0.00010429115,0.00007686193,0.00008106478,0.0005852472,0.0015934951,0.0013063544],"genre_scores_gemma":[0.53519136,0.0014420573,0.45303753,0.00011799225,0.00008805679,0.00043722527,0.0032796885,0.00029266873,0.006113449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995468,0.000094739014,0.00004481475,0.00009404362,0.00017770835,0.000041936553],"domain_scores_gemma":[0.99923563,0.0002964844,0.00008325056,0.00008813446,0.0002616246,0.000034856243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006022132,0.0008154064,0.0007426876,0.0010546724,0.00020449639,0.0013492274,0.0008730382,0.00096417364,0.0047061336],"category_scores_gemma":[0.0028892828,0.0003576826,0.0007192265,0.0010854577,0.00026498284,0.0010614672,0.0008613167,0.00088234775,0.0022811932],"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.00034602586,0.00013412729,0.0010482013,0.00021017856,0.00003780752,0.00006339381,0.00009182958,0.13279907,0.012035172,0.0037133659,0.003230597,0.84629023],"study_design_scores_gemma":[0.00001678407,0.00013716807,0.0014153372,0.000081556194,0.000022319093,0.000108907065,0.000086708875,0.9845957,0.006524371,0.004869592,0.002117407,0.000024122983],"about_ca_topic_score_codex":0.004253024,"about_ca_topic_score_gemma":0.003058846,"teacher_disagreement_score":0.0047061336,"about_ca_system_score_codex":0.0003829596,"about_ca_system_score_gemma":0.00069471484,"threshold_uncertainty_score":0.015743613},"labels":[],"label_agreement":null},{"id":"W3091652022","doi":"10.1007/978-3-030-59725-2_15","title":"2D X-Ray Mammogram and 3D Breast MRI Registration","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mammography; Breast imaging; Breast MRI; Magnetic resonance imaging; Artificial intelligence; Residual; Curse of dimensionality; Transformation (genetics); Digital mammography; Breast ultrasound; Pattern recognition (psychology); Data set; Medical imaging; Computer vision; Radiology; Breast cancer; Medicine; Algorithm","score_opus":0.017966834033184425,"score_gpt":0.27900365924810255,"score_spread":0.2610368252149181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091652022","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.004947495,0.009402603,0.94185746,0.0006345192,0.0008787418,0.000094742645,0.00058339396,0.0027498826,0.03885119],"genre_scores_gemma":[0.12481876,0.01874919,0.6774833,0.0008843681,0.0011978726,0.00017746091,0.0026924682,0.002185405,0.17181116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996061,0.00006350767,0.000025830108,0.00009301992,0.00018782583,0.000023758575],"domain_scores_gemma":[0.99964,0.00013573673,0.000030766692,0.000120901524,0.00005860025,0.000014028615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047737398,0.0007283918,0.0007255677,0.0012760279,0.0002077337,0.0015483305,0.000945611,0.00122608,0.019944856],"category_scores_gemma":[0.0014561289,0.00078173773,0.0009427906,0.0016861958,0.0005165464,0.001374027,0.0013349577,0.00076893164,0.014145816],"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.0001919884,0.00006665434,0.0006958855,0.00052619167,0.000046960067,0.0006991956,0.00012943357,0.015027523,0.046950612,0.03617087,0.02321028,0.8762845],"study_design_scores_gemma":[0.00003946804,0.0003899913,0.011090986,0.00032006044,0.00013577605,0.025683314,0.00020602059,0.25869513,0.093367286,0.09168077,0.5181767,0.00021448081],"about_ca_topic_score_codex":0.00044776552,"about_ca_topic_score_gemma":0.0008285649,"teacher_disagreement_score":0.019944856,"about_ca_system_score_codex":0.00019584324,"about_ca_system_score_gemma":0.00031694685,"threshold_uncertainty_score":0.066722155},"labels":[],"label_agreement":null},{"id":"W3091659559","doi":"10.1007/978-3-030-60946-7_1","title":"Optimal Targeting Visualizations for Surgical Navigation of Iliosacral Screws","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Pelvic and Acetabular Injuries","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer graphics (images); Human–computer interaction; Computer vision","score_opus":0.019969965837174638,"score_gpt":0.30366269980404215,"score_spread":0.2836927339668675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091659559","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.010840536,0.0013798135,0.97699714,0.0001628312,0.000094207026,0.000030121433,0.000093709445,0.0017764673,0.00862511],"genre_scores_gemma":[0.19307663,0.0024531386,0.79736346,0.00009527766,0.00010501894,0.000089138026,0.00024609215,0.00062026625,0.0059509254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997336,0.000067445784,0.000017526761,0.00003063237,0.00012342694,0.000027318263],"domain_scores_gemma":[0.99958223,0.00023751812,0.000040966428,0.000042704465,0.000074507174,0.000022096632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033348982,0.0007551774,0.0003474879,0.0007418084,0.00016945081,0.0011264832,0.0005098733,0.0005555983,0.0042614103],"category_scores_gemma":[0.0018608219,0.0004990201,0.00039728906,0.0006936722,0.00026413382,0.0006721571,0.0007690261,0.00081722933,0.0008886217],"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.0004798328,0.000054505996,0.0010635864,0.0003657437,0.000035500314,0.0005665673,0.0005239434,0.061254725,0.10978156,0.0414037,0.014939559,0.7695307],"study_design_scores_gemma":[0.00015742594,0.00066772837,0.0039938386,0.00048113105,0.00014990233,0.0085546775,0.0002829655,0.7407921,0.093292005,0.0646985,0.086685404,0.0002443454],"about_ca_topic_score_codex":0.0008623933,"about_ca_topic_score_gemma":0.0012546811,"teacher_disagreement_score":0.0042614103,"about_ca_system_score_codex":0.0002808542,"about_ca_system_score_gemma":0.0004808575,"threshold_uncertainty_score":0.014255822},"labels":[],"label_agreement":null},{"id":"W3091846787","doi":"10.1007/978-3-030-58526-6_46","title":"On Diverse Asynchronous Activity Anticipation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Anticipation (artificial intelligence); Inference; Naturalness; Softmax function; Artificial intelligence; Asynchronous communication; Machine learning; Simple (philosophy); Artificial neural network","score_opus":0.021874736966227108,"score_gpt":0.2618794578580614,"score_spread":0.24000472089183428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091846787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03593276,0.0011467556,0.938918,0.00051385316,0.00035050247,0.000035691788,0.00015980609,0.00063730153,0.022305286],"genre_scores_gemma":[0.88902926,0.001504175,0.08706464,0.00026236565,0.00047938825,0.0000858643,0.00047044936,0.0002028099,0.020901179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.000098638695,0.000025006932,0.0001448521,0.00013504238,0.00007140578],"domain_scores_gemma":[0.99793845,0.00128443,0.0001692978,0.0002494621,0.00020484917,0.00015346358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031172,0.00065658905,0.000772959,0.0008923656,0.00053365115,0.0014147034,0.0011266565,0.00059594837,0.0056302836],"category_scores_gemma":[0.005209121,0.00031992563,0.00041256775,0.0012557774,0.00073593814,0.002030623,0.0024345755,0.0013593944,0.0008431334],"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.00053182425,0.00011896653,0.0024844888,0.0001379049,0.000057334346,0.00047067364,0.0002550576,0.16096279,0.009851476,0.6012246,0.007207662,0.2166972],"study_design_scores_gemma":[0.000016703802,0.00006624324,0.0007571936,0.00002378386,0.0000244615,0.00015264182,0.000052053856,0.72752595,0.0016493369,0.26470688,0.005006926,0.000017848826],"about_ca_topic_score_codex":0.0012269574,"about_ca_topic_score_gemma":0.0010335353,"teacher_disagreement_score":0.0056302836,"about_ca_system_score_codex":0.00044979024,"about_ca_system_score_gemma":0.00040882768,"threshold_uncertainty_score":0.018835187},"labels":[],"label_agreement":null},{"id":"W3091879132","doi":"10.1007/978-3-030-59990-4_24","title":"Text Input in Virtual Reality Using a Tracked Drawing Tablet","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Carleton University","funders":"","keywords":"Stylus; Words per minute; Computer science; Tablet pc; Text entry; Virtual reality; Controller (irrigation); Test (biology); Virtual keyboard; Human–computer interaction; Computer graphics (images); Simulation; Multimedia; Computer hardware; Computer vision; Reading (process)","score_opus":0.03177309587923935,"score_gpt":0.2790113133090684,"score_spread":0.24723821742982907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091879132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10020982,0.0016066949,0.8292526,0.00022522078,0.00030990315,0.00022379185,0.00082056114,0.013662573,0.05368885],"genre_scores_gemma":[0.64313567,0.0020128351,0.26076338,0.00023683328,0.000158593,0.0003299447,0.0012128517,0.0017637196,0.09038614],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995683,0.00012172546,0.0000251814,0.00009226244,0.00014132027,0.000051271723],"domain_scores_gemma":[0.999508,0.00032764726,0.000014830112,0.00006200087,0.00005572816,0.000031760308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030991685,0.0010279048,0.00076907745,0.00040057712,0.000464897,0.001759734,0.001652067,0.0012130812,0.043749344],"category_scores_gemma":[0.0012750729,0.0005672676,0.00058173697,0.00062555354,0.00038954016,0.001451822,0.0015484978,0.00055065256,0.0054772194],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003325287,0.00022578798,0.0005655732,0.0010409551,0.00008364097,0.0015517434,0.0017934295,0.012664334,0.41527846,0.0098653855,0.019102339,0.5345029],"study_design_scores_gemma":[0.000948313,0.0031539882,0.010841457,0.00064160564,0.00044413825,0.0068356297,0.0022726944,0.3124395,0.48586726,0.012458756,0.16353954,0.0005571007],"about_ca_topic_score_codex":0.0012298803,"about_ca_topic_score_gemma":0.0011911159,"teacher_disagreement_score":0.043749344,"about_ca_system_score_codex":0.00023191627,"about_ca_system_score_gemma":0.00017644357,"threshold_uncertainty_score":0.1463561},"labels":[],"label_agreement":null},{"id":"W3091895434","doi":"10.1007/978-3-030-59830-3_58","title":"A Blob Detector Images-Based Method for Counterfeit Coin Detection by Fuzzy Association Rules Mining","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Currency Recognition and Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Counterfeit; Data mining; Fuzzy logic; Field (mathematics); Association rule learning; Artificial intelligence; Detector; Image (mathematics); Pattern recognition (psychology); Image processing; Computer vision; Mathematics","score_opus":0.020018459240340385,"score_gpt":0.2700852879106995,"score_spread":0.2500668286703591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091895434","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.030573646,0.0012538969,0.96093565,0.00014599346,0.00024823428,0.00017259088,0.00028283545,0.002935678,0.0034514654],"genre_scores_gemma":[0.17615679,0.0010764131,0.80940765,0.00022330946,0.0001247733,0.00020178733,0.00094057823,0.00016630723,0.01170232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993957,0.000043126845,0.000042057407,0.00016120145,0.0002975233,0.00006043389],"domain_scores_gemma":[0.99956316,0.00008164912,0.000030788247,0.000051962485,0.00024616357,0.000026353655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700834,0.00073294045,0.0012879414,0.0026250477,0.0005730693,0.00088378956,0.0017012941,0.0010054049,0.0036137102],"category_scores_gemma":[0.0009314079,0.00047633328,0.0009465326,0.00181871,0.00030279753,0.0010828339,0.00070645736,0.00068249897,0.002112992],"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.00021055611,0.00018268153,0.0017406236,0.00014088575,0.00009689373,0.0001903733,0.000056419547,0.00579751,0.05187026,0.0013977697,0.0056168116,0.9326992],"study_design_scores_gemma":[0.00005093053,0.00025171993,0.008232892,0.000055661974,0.00020483547,0.0013609538,0.00011035733,0.8839405,0.08987584,0.0026638051,0.013141096,0.00011131985],"about_ca_topic_score_codex":0.0029893976,"about_ca_topic_score_gemma":0.0040674056,"teacher_disagreement_score":0.0036137102,"about_ca_system_score_codex":0.00033820022,"about_ca_system_score_gemma":0.0007419455,"threshold_uncertainty_score":0.012089074},"labels":[],"label_agreement":null},{"id":"W3091895957","doi":"10.1007/978-3-030-60887-3_19","title":"Evaluation of Similarity Measures in a Benchmark for Spanish Paraphrasing Detection","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Paraphrase; Similarity (geometry); Computer science; Natural language processing; Artificial intelligence; Vocabulary; Benchmark (surveying); Semantic similarity; Boundary (topology); Computation; Information retrieval; Linguistics; Algorithm; Mathematics","score_opus":0.0693253929892796,"score_gpt":0.29153093333462454,"score_spread":0.22220554034534495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091895957","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.825232,0.010939461,0.086589016,0.00060827786,0.0012838303,0.0018244176,0.021499466,0.028413609,0.023609836],"genre_scores_gemma":[0.70531315,0.0017120972,0.17984253,0.00031149414,0.0003863945,0.000893425,0.10011677,0.0018081248,0.009616056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933775,0.0020224017,0.0009971136,0.0015727386,0.0016400397,0.000390259],"domain_scores_gemma":[0.98272055,0.007632533,0.00077803177,0.0023512996,0.0052598375,0.0012576631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048957323,0.0023121356,0.0018498474,0.007838544,0.0014771065,0.003183865,0.0027707876,0.0028376724,0.0067309546],"category_scores_gemma":[0.021740275,0.0003636499,0.0010751336,0.005231481,0.0006317583,0.0034717547,0.0029999444,0.0012199072,0.005757358],"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.005604555,0.0042245993,0.016937781,0.004581843,0.0011084629,0.0010935114,0.0012446297,0.016529897,0.060133964,0.0028073143,0.059237055,0.8264963],"study_design_scores_gemma":[0.0026215645,0.008548601,0.09561217,0.00063072005,0.0011556955,0.004464874,0.0051516746,0.6728785,0.14494722,0.007606424,0.05594873,0.00043390732],"about_ca_topic_score_codex":0.0067182654,"about_ca_topic_score_gemma":0.008006216,"teacher_disagreement_score":0.007838544,"about_ca_system_score_codex":0.0010077428,"about_ca_system_score_gemma":0.0012548269,"threshold_uncertainty_score":0.025891423},"labels":[],"label_agreement":null},{"id":"W3091897201","doi":"10.1007/978-3-030-59830-3_38","title":"Facial Beauty Prediction Using Transfer and Multi-task Learning Techniques","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Benchmark (surveying); Deep learning; Machine learning; Transfer of learning; Face (sociological concept); Task (project management); Facial recognition system; Residual; Multi-task learning; Pattern recognition (psychology); Facial attractiveness; Attractiveness","score_opus":0.025879509718348775,"score_gpt":0.2494847243090696,"score_spread":0.22360521459072083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091897201","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.24586356,0.0010823607,0.73905516,0.0002565023,0.00034775992,0.00019239445,0.0007459466,0.0028916872,0.009564689],"genre_scores_gemma":[0.86305445,0.00053717074,0.12132427,0.00013032614,0.00015253853,0.0001196136,0.0011923417,0.00023393224,0.013255332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967706,0.00005643786,0.000010874652,0.00010473446,0.00009054483,0.000060356197],"domain_scores_gemma":[0.99929297,0.00026358003,0.00004537596,0.000119669276,0.00023685707,0.000041564694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009045269,0.000828295,0.0009663578,0.0008812798,0.00027998345,0.0005884321,0.00080116576,0.0007144027,0.003842341],"category_scores_gemma":[0.0012334889,0.00025748493,0.0010923123,0.00078745844,0.00025776227,0.00079288665,0.0007178755,0.0011226063,0.0019368127],"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.0004248208,0.00035088471,0.0039384267,0.00007419659,0.00009379238,0.000075199816,0.000031660198,0.05950868,0.0295333,0.00052361254,0.005473646,0.8999718],"study_design_scores_gemma":[0.0000070180113,0.00008983653,0.0042027063,0.0000070765013,0.00002759124,0.00006817842,0.000016751363,0.987845,0.006544985,0.0007587476,0.00042055073,0.000011523985],"about_ca_topic_score_codex":0.002691855,"about_ca_topic_score_gemma":0.0031060863,"teacher_disagreement_score":0.003842341,"about_ca_system_score_codex":0.00033539714,"about_ca_system_score_gemma":0.00032821577,"threshold_uncertainty_score":0.01285398},"labels":[],"label_agreement":null},{"id":"W3091933531","doi":"10.1007/978-3-030-59830-3_11","title":"Comparison of Persian Handwritten Digit Recognition in Three Color Modalities Using Deep Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Convolutional neural network; Numerical digit; Artificial intelligence; Modalities; Pattern recognition (psychology); Digit recognition; Set (abstract data type); Speech recognition; Artificial neural network; Deep learning; Handwriting recognition; Feature extraction; Arithmetic; Mathematics","score_opus":0.04831912484570828,"score_gpt":0.28412145579972703,"score_spread":0.23580233095401876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091933531","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.90951186,0.0049723526,0.043850977,0.00040092776,0.0008568784,0.00010552593,0.0043048384,0.003377878,0.03261877],"genre_scores_gemma":[0.9522583,0.0011841498,0.025030605,0.00017958309,0.000089937625,0.000040868552,0.00544679,0.00014462629,0.015625218],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996557,0.00006436644,0.00003155308,0.00008511739,0.00010436133,0.000058825703],"domain_scores_gemma":[0.99925333,0.00026683955,0.000025011792,0.00008255534,0.0003351757,0.000037020847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006050899,0.00071911,0.00041234997,0.00083466707,0.00020146332,0.00092514115,0.00048283546,0.00044303175,0.008336157],"category_scores_gemma":[0.0016107331,0.00010175813,0.0004039112,0.0005285738,0.00018872708,0.000905274,0.00048217914,0.00032234183,0.0031261365],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037227736,0.00027879642,0.010950652,0.00046811014,0.0003154679,0.00044283783,0.00015181422,0.017191071,0.03442727,0.0011541747,0.015300223,0.9155968],"study_design_scores_gemma":[0.00021411947,0.0020809923,0.11789567,0.00027924817,0.00076968153,0.0020756554,0.0019047512,0.60744303,0.23334366,0.0051985453,0.028583929,0.00021069875],"about_ca_topic_score_codex":0.008609148,"about_ca_topic_score_gemma":0.010053389,"teacher_disagreement_score":0.008609148,"about_ca_system_score_codex":0.00038011695,"about_ca_system_score_gemma":0.00049226097,"threshold_uncertainty_score":0.027887225},"labels":[],"label_agreement":null},{"id":"W3091943591","doi":"10.1007/978-3-030-59830-3_60","title":"Abusive Language Detection Using BERT Pre-trained Embedding","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","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":"Concordia University","funders":"","keywords":"Computer science; Language model; Embedding; Recall; Artificial intelligence; Natural language processing; Word embedding; Meaning (existential); Linguistics","score_opus":0.012534629575203607,"score_gpt":0.25467544026353983,"score_spread":0.24214081068833623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091943591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1839839,0.0027887023,0.77535,0.00058893184,0.0017437355,0.00037022622,0.0022653393,0.014279987,0.018629158],"genre_scores_gemma":[0.6264708,0.0015976321,0.31414393,0.0003564221,0.00038844455,0.0002460078,0.006445793,0.0008624054,0.04948863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948275,0.00006309527,0.00003009698,0.00017170157,0.00015374577,0.00009862135],"domain_scores_gemma":[0.99938977,0.00015324476,0.000037383088,0.00013691481,0.00024519104,0.000037511974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004685855,0.0016827896,0.0009729758,0.0011671598,0.0004087815,0.0010386192,0.0007680356,0.0011221552,0.00705602],"category_scores_gemma":[0.001262345,0.000361873,0.000851773,0.0006325111,0.00037345386,0.0014788046,0.0013706244,0.0014421159,0.01094722],"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.00033307835,0.0002446076,0.0022001555,0.00020026819,0.00009003487,0.00038069027,0.000078898236,0.009946131,0.106610216,0.0012398278,0.008710481,0.86996573],"study_design_scores_gemma":[0.000034978275,0.0006105701,0.009043624,0.00012713272,0.00020774255,0.0018685564,0.00023603032,0.75716615,0.20824933,0.0040324344,0.018330647,0.00009287145],"about_ca_topic_score_codex":0.0017243548,"about_ca_topic_score_gemma":0.0033011825,"teacher_disagreement_score":0.00705602,"about_ca_system_score_codex":0.00026008103,"about_ca_system_score_gemma":0.00055774796,"threshold_uncertainty_score":0.02360475},"labels":[],"label_agreement":null},{"id":"W3091948559","doi":"10.1007/978-3-030-59830-3_29","title":"Predicting US Elections with Social Media and Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Artificial neural network; Social media; Artificial intelligence; World Wide Web","score_opus":0.01842359035266617,"score_gpt":0.22315437148536824,"score_spread":0.20473078113270207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091948559","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.7695846,0.009771404,0.18059023,0.0036178872,0.0010450933,0.00016668346,0.0063789748,0.0017131822,0.027131995],"genre_scores_gemma":[0.9671765,0.001126828,0.019325294,0.00012030987,0.0009030946,0.000055305743,0.002819645,0.00007209983,0.008400895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.00010965652,0.000015208852,0.000069233414,0.00004131156,0.000049659615],"domain_scores_gemma":[0.99802196,0.0015971585,0.00012337846,0.000077472905,0.00011728479,0.00006275575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096388435,0.00077081344,0.00064566586,0.001958848,0.00035933458,0.0013002892,0.0005780556,0.00076794927,0.004181398],"category_scores_gemma":[0.004537906,0.0004776808,0.000775938,0.0015262135,0.0002433036,0.0021107302,0.0004825318,0.0012474344,0.0015553982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008216521,0.00066783,0.07325427,0.000220748,0.0005474798,0.00013626693,0.00009795675,0.44421023,0.0014189945,0.008993683,0.033878546,0.4357523],"study_design_scores_gemma":[0.000009746148,0.000021600494,0.005166169,0.000012753398,0.000026835423,0.000015019366,0.000023857543,0.9868951,0.00026826482,0.00665075,0.00090350525,0.000006387554],"about_ca_topic_score_codex":0.00975568,"about_ca_topic_score_gemma":0.023413518,"teacher_disagreement_score":0.00975568,"about_ca_system_score_codex":0.0007531978,"about_ca_system_score_gemma":0.00029278465,"threshold_uncertainty_score":0.019397795},"labels":[],"label_agreement":null},{"id":"W3092028377","doi":"10.1007/978-3-030-59267-7_13","title":"Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Cardinality (data modeling); Constraint (computer-aided design); Mathematics; Maximization; Approximation algorithm; Combinatorics; Discrete mathematics; Function (biology); Mathematical optimization; Computer science","score_opus":0.014829903372045872,"score_gpt":0.23276656047874233,"score_spread":0.21793665710669646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092028377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04353565,0.0011607577,0.90260834,0.0031584955,0.00029638995,0.00031485394,0.0011234919,0.00037782814,0.047424223],"genre_scores_gemma":[0.51332915,0.0015365954,0.40084437,0.0010777112,0.0006685798,0.00075497455,0.0014963972,0.0005853717,0.07970685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986871,0.00056647055,0.000044626995,0.000332808,0.00016069741,0.00020829256],"domain_scores_gemma":[0.99631715,0.0025891475,0.00016014172,0.0003615355,0.00023191432,0.00034005623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027296802,0.0015142579,0.0021489093,0.00042967845,0.00086766103,0.0020629035,0.003507401,0.0030332159,0.015216705],"category_scores_gemma":[0.0060958113,0.0010802215,0.0015049193,0.001208205,0.0015444556,0.006252774,0.0025747872,0.004672595,0.0013286144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000700148,0.00052982185,0.00063631,0.0011572081,0.00018871493,0.00053390115,0.0003307527,0.14813708,0.006132528,0.7046331,0.041134033,0.09588644],"study_design_scores_gemma":[0.00014820592,0.0002093726,0.0004400679,0.000065992026,0.000051010735,0.00027046603,0.00007691278,0.39524576,0.0019495621,0.59129333,0.010206869,0.000042504165],"about_ca_topic_score_codex":0.0009742694,"about_ca_topic_score_gemma":0.0014433635,"teacher_disagreement_score":0.015216705,"about_ca_system_score_codex":0.0016276203,"about_ca_system_score_gemma":0.0018270114,"threshold_uncertainty_score":0.05090499},"labels":[],"label_agreement":null},{"id":"W3092039472","doi":"10.1007/978-3-030-61255-9_8","title":"Lying About Lying on Social Media: A Case Study of the 2019 Canadian Elections","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":7,"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":"Lying; Misinformation; Social media; Mainstream; Computer science; Viewpoints; Fake news; Internet privacy; Political activism; Set (abstract data type); Politics; World Wide Web; Media studies; Computer security; Political science; Sociology; Law","score_opus":0.05326241181017343,"score_gpt":0.31096968795510643,"score_spread":0.257707276144933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092039472","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.9042522,0.0007481304,0.0006816542,0.012751074,0.00013485605,0.00014383855,0.0002944555,0.000024534998,0.080969386],"genre_scores_gemma":[0.9852012,0.0005357464,0.00050600007,0.0008862109,0.000040968636,0.000036795667,0.00010620792,0.000021190635,0.012665677],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9937441,0.0023513304,0.00009697134,0.00030281,0.0011500975,0.002354746],"domain_scores_gemma":[0.98711747,0.008051797,0.0009887184,0.00043752024,0.0015587276,0.0018458556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004306872,0.0006354301,0.0005155123,0.0020229944,0.04054647,0.006348143,0.0032202154,0.0062814937,0.007698699],"category_scores_gemma":[0.017004643,0.0004836443,0.0003974315,0.0050648376,0.009307769,0.0029111675,0.0032668407,0.005050575,0.00068888016],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037262865,0.00091698155,0.06182638,0.00031175322,0.000078467594,0.022540575,0.7409395,0.0014089331,0.000900526,0.062543854,0.050013546,0.058146827],"study_design_scores_gemma":[0.000042810112,0.00010481004,0.03738178,0.00027298668,0.00005244419,0.0020727613,0.85924816,0.0015280554,0.00042637275,0.0036119206,0.09517122,0.00008657543],"about_ca_topic_score_codex":0.9249926,"about_ca_topic_score_gemma":0.9664161,"teacher_disagreement_score":0.07500738,"about_ca_system_score_codex":0.033105053,"about_ca_system_score_gemma":0.03145347,"threshold_uncertainty_score":0.2401951},"labels":[],"label_agreement":null},{"id":"W3092090573","doi":"10.1007/978-3-030-59830-3_48","title":"A Comprehensive Unconstrained, License Plate Database","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle License Plate Recognition","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":"Concordia University","funders":"","keywords":"License; Computer science; Computer vision; Artificial intelligence; Computer graphics (images); Shutter; Shadow (psychology); Database; Optics","score_opus":0.021603406374036117,"score_gpt":0.22220925550921197,"score_spread":0.20060584913517585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092090573","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04052783,0.007879371,0.3513647,0.00038586007,0.0008923798,0.0016231501,0.43173236,0.093577065,0.072017245],"genre_scores_gemma":[0.035856597,0.00244196,0.19050026,0.00023591271,0.00011141793,0.00045681614,0.7099976,0.0029162844,0.05748316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933064,0.000032282645,0.000059499765,0.00016642243,0.00036483395,0.000046448986],"domain_scores_gemma":[0.99926263,0.000053166474,0.000022445047,0.0002461372,0.0003635042,0.00005216032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048372964,0.0016577479,0.0011753064,0.004626801,0.0007518571,0.0015483659,0.0030237641,0.00086778466,0.05205625],"category_scores_gemma":[0.0012365369,0.0007959092,0.0006483492,0.0050095096,0.00022157245,0.002502025,0.0015107667,0.0006292762,0.053530216],"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.00035472793,0.00033387847,0.0011106498,0.00062437064,0.00008365992,0.00030643336,0.000032524822,0.0036410936,0.01817073,0.0014210988,0.3362872,0.63763356],"study_design_scores_gemma":[0.00027378724,0.00041253184,0.017913666,0.00031304927,0.0002805666,0.0033348768,0.00028668117,0.09388605,0.10202101,0.005301082,0.77572984,0.00024698646],"about_ca_topic_score_codex":0.008042031,"about_ca_topic_score_gemma":0.014067542,"teacher_disagreement_score":0.05205625,"about_ca_system_score_codex":0.0003974053,"about_ca_system_score_gemma":0.0013085166,"threshold_uncertainty_score":0.17414552},"labels":[],"label_agreement":null},{"id":"W3092111998","doi":"10.1007/978-3-030-59830-3_25","title":"Manifold-Based Classifier Ensembles","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Classifier (UML); Computer science; Nonlinear system; Manifold (fluid mechanics); Riemannian geometry; Artificial intelligence; Nonlinear dimensionality reduction; Riemannian manifold; Pattern recognition (psychology); Mathematics; Pure mathematics; Physics; Dimensionality reduction","score_opus":0.025799406950174516,"score_gpt":0.24103383246622082,"score_spread":0.2152344255160463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092111998","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.014810756,0.0018633201,0.97353244,0.00023432935,0.00032285863,0.000052179446,0.00019775462,0.0011498532,0.007836488],"genre_scores_gemma":[0.39787942,0.0024513504,0.5642778,0.00029822535,0.0008000108,0.00022606178,0.0026536451,0.00063790753,0.030775491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856466,0.00041066663,0.00007242126,0.00029086595,0.00056466827,0.00009667856],"domain_scores_gemma":[0.9983165,0.0004679992,0.00006206868,0.00044251885,0.00064122584,0.000069622496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013588514,0.000926338,0.001904915,0.0011424115,0.00071533705,0.0012398278,0.0014401267,0.0012483115,0.004801217],"category_scores_gemma":[0.0034827988,0.0006811039,0.0012592534,0.0013104535,0.00044984513,0.002169313,0.0022272174,0.002131226,0.0035308225],"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.00012843586,0.00011321246,0.0007645096,0.00010129251,0.0002380321,0.00005919106,0.00009238334,0.17355174,0.0085393265,0.034123614,0.017188787,0.76509947],"study_design_scores_gemma":[0.0000037106786,0.00006531305,0.00031337322,0.000015818154,0.000029648292,0.00008012769,0.000016334026,0.9671701,0.0024195663,0.02429332,0.005577993,0.00001461713],"about_ca_topic_score_codex":0.0009980396,"about_ca_topic_score_gemma":0.0022705302,"teacher_disagreement_score":0.004801217,"about_ca_system_score_codex":0.00047415524,"about_ca_system_score_gemma":0.0005387227,"threshold_uncertainty_score":0.016061664},"labels":[],"label_agreement":null},{"id":"W3092160587","doi":"10.1007/978-3-030-59990-4_30","title":"Improving the Visual Perception and Spatial Awareness of Downhill Winter Athletes with Augmented Reality","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Headset; Perception; Computer science; Athletes; Usability; Augmented reality; Human–computer interaction; Applied psychology; Virtual reality; Psychology; Medicine","score_opus":0.021114421978215905,"score_gpt":0.26759013811709925,"score_spread":0.24647571613888336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092160587","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.9251389,0.0019666257,0.05718363,0.00041498075,0.0001360098,0.00006597528,0.00024775002,0.00030859464,0.014537546],"genre_scores_gemma":[0.96194524,0.0014616287,0.026837831,0.00011566008,0.00006725444,0.000048754486,0.00018575249,0.000056421515,0.009281551],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989474,0.000024911094,0.000004577263,0.000021687847,0.00003016733,0.000024012897],"domain_scores_gemma":[0.99987626,0.00005836688,0.000011997031,0.000008988489,0.00003043572,0.000013923555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014624248,0.0004111563,0.00024484718,0.00026334627,0.00013247518,0.00077208964,0.00032589378,0.0003939228,0.0045079775],"category_scores_gemma":[0.0005522494,0.00017956358,0.00028956722,0.00017621071,0.0002111106,0.00047611,0.00072634354,0.00032644387,0.0003839671],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022016678,0.00064665667,0.018105749,0.000929312,0.0002446871,0.0005121328,0.0029947476,0.012188072,0.3977044,0.0012815072,0.0057766247,0.5574145],"study_design_scores_gemma":[0.0004974751,0.007331158,0.57886523,0.00096561096,0.001318435,0.004811379,0.016530825,0.12822764,0.2026658,0.00841807,0.050020423,0.00034799878],"about_ca_topic_score_codex":0.003918581,"about_ca_topic_score_gemma":0.004722148,"teacher_disagreement_score":0.0045079775,"about_ca_system_score_codex":0.00010366909,"about_ca_system_score_gemma":0.00020646203,"threshold_uncertainty_score":0.01508075},"labels":[],"label_agreement":null},{"id":"W3092214631","doi":"10.1007/978-3-030-59830-3_33","title":"License Plate Detection and Recognition by Convolutional Neural Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle License Plate Recognition","field":"Engineering","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":"License; Computer science; Convolutional neural network; Artificial intelligence; Process (computing); Optical character recognition; Deep learning; Truck; Character recognition; Pattern recognition (psychology); Computer vision; Image (mathematics); Engineering","score_opus":0.012311779438658525,"score_gpt":0.19017940759726373,"score_spread":0.1778676281586052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092214631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0395017,0.0052525457,0.9246021,0.00034773521,0.00046001188,0.000090405134,0.0010470435,0.006679662,0.022018872],"genre_scores_gemma":[0.4598,0.0056140055,0.41370714,0.00031943968,0.00033539912,0.000117104595,0.004773768,0.00051809003,0.11481509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999795,0.000014991152,0.000008349381,0.000052874442,0.000085883294,0.00004282025],"domain_scores_gemma":[0.9997836,0.00006694226,0.00002331594,0.00003885488,0.000076682816,0.000010647953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021378377,0.0009085693,0.00045151156,0.0008860927,0.00017220518,0.0009367258,0.0011638458,0.00065934594,0.0070532016],"category_scores_gemma":[0.00062899257,0.00054237415,0.00055317837,0.0008525126,0.00027150125,0.0008890662,0.0006456342,0.0007275018,0.004943255],"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.00016774946,0.0000906044,0.0010216002,0.00016701389,0.00008193072,0.00009849281,0.000023335871,0.057990387,0.060138594,0.0034554335,0.015479395,0.8612855],"study_design_scores_gemma":[0.000007011107,0.00004098587,0.0023378772,0.000032467015,0.000046393274,0.00015673957,0.000017544115,0.92531234,0.05584791,0.003027109,0.0131486915,0.00002496384],"about_ca_topic_score_codex":0.009119207,"about_ca_topic_score_gemma":0.015377914,"teacher_disagreement_score":0.009119207,"about_ca_system_score_codex":0.00052712735,"about_ca_system_score_gemma":0.00047152548,"threshold_uncertainty_score":0.023595273},"labels":[],"label_agreement":null},{"id":"W3092224781","doi":"10.1007/978-3-030-58526-6_27","title":"On Transferability of Histological Tissue Labels in Computational Pathology","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Jacobs (Canada); St. Michael's Hospital; University of Toronto","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Transferability; Workflow; Transfer of learning; Domain (mathematical analysis); Deep learning; Task (project management); Pattern recognition (psychology); Pathology; Machine learning; Medicine","score_opus":0.022524198242228833,"score_gpt":0.2618781675710318,"score_spread":0.23935396932880293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092224781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02553796,0.0004833695,0.96596956,0.00088263367,0.00006076649,0.00006862066,0.000242913,0.0005819033,0.0061722714],"genre_scores_gemma":[0.6568441,0.0019711389,0.31389207,0.0006788177,0.00049959595,0.00032122512,0.0015050601,0.0011757835,0.023112183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717736,0.0011482491,0.00016672841,0.0006598455,0.0006328052,0.00021500752],"domain_scores_gemma":[0.94997233,0.03938943,0.0017269378,0.0066994224,0.001527675,0.0006841577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006080233,0.00081796636,0.001305621,0.0021208024,0.00091228285,0.0022597162,0.003354797,0.0020722058,0.008549984],"category_scores_gemma":[0.035773747,0.00076568656,0.0019243199,0.0022448075,0.0041046166,0.007248729,0.0064750286,0.0038389442,0.0013681654],"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.0005876218,0.00017434561,0.0035286492,0.0005731185,0.000112611626,0.00037327534,0.00087922014,0.26568288,0.016716128,0.4031115,0.004636902,0.30362388],"study_design_scores_gemma":[0.000018325585,0.00009138375,0.0013998204,0.000057427616,0.000030395335,0.00017190547,0.00010499665,0.4056072,0.0054557687,0.5849844,0.0020603559,0.000018040819],"about_ca_topic_score_codex":0.0022256507,"about_ca_topic_score_gemma":0.0012558264,"teacher_disagreement_score":0.008549984,"about_ca_system_score_codex":0.002089857,"about_ca_system_score_gemma":0.00086621835,"threshold_uncertainty_score":0.032155752},"labels":[],"label_agreement":null},{"id":"W3092248730","doi":"10.1007/978-3-030-59830-3_56","title":"An Integrated Deep Architecture for Lesion Detection in Breast MRI","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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; National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Detector; Object detection; Process (computing); Computer vision; Architecture; Deep learning; Set (abstract data type); Object (grammar); Pattern recognition (psychology); Operating system","score_opus":0.014547379438402525,"score_gpt":0.24691594693178331,"score_spread":0.23236856749338078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092248730","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.03358938,0.0021868912,0.9509208,0.00031862987,0.00021609265,0.0000888085,0.00089187594,0.0073967744,0.0043907603],"genre_scores_gemma":[0.32431224,0.001814605,0.64388984,0.0007700393,0.00016626203,0.00017487488,0.0023434823,0.00046649668,0.026062101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998516,0.000015718344,0.0000073653405,0.00003579443,0.00005838442,0.000031093517],"domain_scores_gemma":[0.99983394,0.000045720186,0.000010829555,0.000027678248,0.00006525367,0.000016562797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033642014,0.00073679147,0.0005459772,0.00045156796,0.00021297242,0.00064217026,0.0014154452,0.00079922745,0.004948899],"category_scores_gemma":[0.0005473063,0.00045004673,0.0005219628,0.00050657074,0.00014616566,0.0006193379,0.0010598364,0.00074634573,0.0019701284],"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.00025085156,0.00016486474,0.00097436825,0.00018119409,0.00014953269,0.00010415744,0.00004362944,0.04523837,0.06716966,0.0026465193,0.01245747,0.87061936],"study_design_scores_gemma":[0.000017324355,0.00021609943,0.0012615847,0.000040193147,0.000105940395,0.00020855918,0.000021774978,0.9487386,0.037075486,0.0038177208,0.0084716845,0.000025021578],"about_ca_topic_score_codex":0.004557662,"about_ca_topic_score_gemma":0.012794806,"teacher_disagreement_score":0.004948899,"about_ca_system_score_codex":0.00042914404,"about_ca_system_score_gemma":0.00069046154,"threshold_uncertainty_score":0.016555667},"labels":[],"label_agreement":null},{"id":"W3092260289","doi":"10.1007/978-3-030-59830-3_9","title":"Hand-Drawn Object Detection for Scoring Wartegg Zeichen Test","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Psychological Testing and Assessment","field":"Psychology","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":"Concordia University","funders":"","keywords":"Computer science; Object (grammar); Artificial intelligence; Square (algebra); Object detection; Test (biology); Computer vision; Quality (philosophy); Character (mathematics); Pattern recognition (psychology); Mathematics","score_opus":0.058942717477191764,"score_gpt":0.33767859188028604,"score_spread":0.2787358744030943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092260289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0859047,0.0022789577,0.8457833,0.00026904757,0.000506154,0.00081027206,0.0037382264,0.017576134,0.043133244],"genre_scores_gemma":[0.39719146,0.0014479309,0.5284632,0.00026089206,0.00012977306,0.00085068506,0.006029537,0.0010121248,0.06461439],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989814,0.0001502576,0.00006111718,0.00019284314,0.0005291231,0.00008524188],"domain_scores_gemma":[0.99890614,0.0004220626,0.00006293619,0.0001339716,0.0004077513,0.00006714637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756168,0.00080541254,0.0006051611,0.0018836304,0.00024574337,0.0008598787,0.0015259221,0.001006962,0.021700466],"category_scores_gemma":[0.0024623792,0.00032497634,0.00038516038,0.0006146787,0.00027718692,0.00077644543,0.000882397,0.00052486965,0.013284515],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000489444,0.00007424338,0.0060890685,0.00014901809,0.00003430003,0.00019629873,0.000045701865,0.0035583861,0.04138981,0.0018899265,0.014906586,0.93117726],"study_design_scores_gemma":[0.00023127535,0.0011670568,0.11409428,0.00035262105,0.00024141965,0.0070954612,0.0003406164,0.48371786,0.27543944,0.016998118,0.09992722,0.00039450818],"about_ca_topic_score_codex":0.0020360432,"about_ca_topic_score_gemma":0.0034109012,"teacher_disagreement_score":0.021700466,"about_ca_system_score_codex":0.00035324137,"about_ca_system_score_gemma":0.00049978535,"threshold_uncertainty_score":0.0725953},"labels":[],"label_agreement":null},{"id":"W3092278480","doi":"10.1007/978-3-030-59990-4_29","title":"Camera-Based Selection with Cardboard Head-Mounted Displays","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Carleton University","funders":"","keywords":"Selection (genetic algorithm); Computer science; cardboard; Computer vision; Artificial intelligence; Head (geology); Computer graphics (images); Mobile device; Engineering","score_opus":0.01188727006304356,"score_gpt":0.25968869749891205,"score_spread":0.2478014274358685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092278480","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07125369,0.002724677,0.8378219,0.0001658868,0.0006247787,0.0004731499,0.0012253688,0.012024901,0.0736856],"genre_scores_gemma":[0.4299764,0.0026538903,0.45626235,0.0003381887,0.0003306581,0.00029551433,0.001634333,0.0014098199,0.10709879],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963355,0.000064223,0.0000130055305,0.00007861837,0.0001507544,0.0000598344],"domain_scores_gemma":[0.99957174,0.0001474318,0.00001867019,0.00008825092,0.00013185237,0.000041902254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023037204,0.0010222504,0.0007796428,0.000684918,0.0003672027,0.0010822766,0.0014898089,0.0006036645,0.033503085],"category_scores_gemma":[0.00061037036,0.0005050409,0.0004494602,0.0010341618,0.00017324126,0.00071935373,0.0008546566,0.00050750596,0.006946972],"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.001647707,0.00023031731,0.0009659617,0.00044197502,0.00007310251,0.00058058306,0.0001805569,0.0027424893,0.5108725,0.0037958515,0.026688762,0.4517801],"study_design_scores_gemma":[0.0003923539,0.0014582931,0.014336855,0.00017385148,0.00025701083,0.0036610563,0.00023382665,0.13112727,0.69297343,0.0022798546,0.15282027,0.00028587782],"about_ca_topic_score_codex":0.0014437517,"about_ca_topic_score_gemma":0.0023511304,"teacher_disagreement_score":0.033503085,"about_ca_system_score_codex":0.00027684093,"about_ca_system_score_gemma":0.0002510886,"threshold_uncertainty_score":0.112078965},"labels":[],"label_agreement":null},{"id":"W3092297108","doi":"10.1007/978-3-030-59990-4_18","title":"Text Entry in Virtual Reality: Implementation of FLIK Method and Text Entry Testbed","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Testbed; Text entry; Computer science; Virtual reality; Variety (cybernetics); Human–computer interaction; World Wide Web; Artificial intelligence","score_opus":0.020317556342431375,"score_gpt":0.31209288366727994,"score_spread":0.29177532732484857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092297108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048919596,0.00022043502,0.8662627,0.00015516285,0.00017374515,0.00042951517,0.00080820353,0.06924092,0.013789789],"genre_scores_gemma":[0.37760442,0.00016883604,0.5979958,0.00011487031,0.00003402776,0.00047968925,0.0019155582,0.002580046,0.019106705],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936336,0.000112679474,0.00005031069,0.00013295386,0.00025293115,0.000087871435],"domain_scores_gemma":[0.99931777,0.00016537325,0.000025585834,0.00020554021,0.00019844825,0.00008725776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047753082,0.0007515352,0.00059363147,0.0006836776,0.00042575772,0.0011524502,0.0025911175,0.00092720607,0.03019289],"category_scores_gemma":[0.0013295544,0.00037943086,0.00047341906,0.0004510216,0.0003053204,0.0010303289,0.0013619869,0.00055406755,0.0063955863],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024625468,0.0011711394,0.0015525948,0.0007304496,0.00011162638,0.0006848525,0.0010629449,0.014843914,0.2573136,0.009191712,0.023798747,0.6870758],"study_design_scores_gemma":[0.00062313094,0.0012544335,0.0040309015,0.00012414002,0.00012285591,0.0012051832,0.0006368173,0.41890854,0.48128742,0.00313932,0.08838486,0.00028237878],"about_ca_topic_score_codex":0.0019904096,"about_ca_topic_score_gemma":0.0013333274,"teacher_disagreement_score":0.03019289,"about_ca_system_score_codex":0.00027570224,"about_ca_system_score_gemma":0.0004973936,"threshold_uncertainty_score":0.101005256},"labels":[],"label_agreement":null},{"id":"W3092344991","doi":"10.1007/978-3-030-59830-3_1","title":"Gender Detection from Handwritten Documents Using Concept of Transfer-Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Transfer of learning; Support vector machine; Arabic; Pattern recognition (psychology); Natural language processing; Task (project management); Convolution (computer science); Set (abstract data type); Data set; Feature (linguistics); Artificial neural network","score_opus":0.025633938871819147,"score_gpt":0.2571517025986135,"score_spread":0.23151776372679433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092344991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08210811,0.00085410825,0.9100764,0.00010591052,0.00017016543,0.000115576644,0.00032958481,0.0020717832,0.0041683954],"genre_scores_gemma":[0.5879325,0.0008434157,0.3950537,0.00014344323,0.00015918321,0.0001358671,0.0012688282,0.00028282427,0.014180284],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996643,0.000051759118,0.000017383258,0.00012141761,0.000088662855,0.00005641201],"domain_scores_gemma":[0.9995473,0.00014108785,0.000046907644,0.00007953246,0.00015326118,0.00003182866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006219824,0.0005767426,0.00068899075,0.0010087586,0.0002817167,0.0006815835,0.00083851255,0.0005334136,0.0028849766],"category_scores_gemma":[0.00094733876,0.00015628383,0.00063307263,0.00087120547,0.0003587202,0.0010212084,0.00081603206,0.00052688847,0.0017915939],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022323098,0.00014340591,0.0016542331,0.00009460112,0.000048777823,0.00011886477,0.00006239242,0.013547691,0.069584414,0.0020206869,0.0027036169,0.909798],"study_design_scores_gemma":[0.000013966875,0.00028007934,0.006266014,0.00003664058,0.000057694655,0.00057805906,0.000118528944,0.9096524,0.06965971,0.008314058,0.004983036,0.00003978872],"about_ca_topic_score_codex":0.0013474316,"about_ca_topic_score_gemma":0.0013349525,"teacher_disagreement_score":0.0028849766,"about_ca_system_score_codex":0.00035869607,"about_ca_system_score_gemma":0.00045214774,"threshold_uncertainty_score":0.009651244},"labels":[],"label_agreement":null},{"id":"W3092426380","doi":"10.1007/978-3-030-59830-3_57","title":"Single Image Super-Resolution for Medical Image Applications","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Concordia University","funders":"","keywords":"MNIST database; Computer science; Discriminator; Artificial intelligence; Image (mathematics); Computer vision; Feature (linguistics); Pixel; Image resolution; Resolution (logic); Feature extraction; Superresolution; Mean squared error; Pattern recognition (psychology); High resolution; Deep learning; Telecommunications; Mathematics","score_opus":0.017470334031618406,"score_gpt":0.284122529824334,"score_spread":0.2666521957927156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092426380","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.005379053,0.024087122,0.9205351,0.0006335272,0.0006627478,0.000085445376,0.0004167092,0.0019389387,0.046261378],"genre_scores_gemma":[0.067752324,0.038380653,0.77534384,0.0007299531,0.00075903843,0.00014188218,0.0009592728,0.0009059496,0.11502701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99988246,0.000013122908,0.000005649693,0.000017054625,0.00007364567,0.000008065552],"domain_scores_gemma":[0.99974555,0.0001276122,0.000015629612,0.000045801982,0.00005386837,0.0000115654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022548235,0.00060032867,0.00040771204,0.0006363356,0.00015786724,0.00071338867,0.0005916435,0.00054556486,0.025537109],"category_scores_gemma":[0.0005277495,0.00041764628,0.00029555164,0.0009449264,0.0002772781,0.0011568216,0.0006308534,0.0009576095,0.008781469],"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.00010224683,0.000039240902,0.00009420785,0.0011865235,0.000049605096,0.00024155268,0.000085010564,0.0055197654,0.25557685,0.025172925,0.04314604,0.668786],"study_design_scores_gemma":[0.000025531677,0.00021537169,0.0017504762,0.00037874107,0.00013602857,0.005308646,0.00011070156,0.17449522,0.28437832,0.053754628,0.47938153,0.00006488926],"about_ca_topic_score_codex":0.00022298498,"about_ca_topic_score_gemma":0.0006055999,"teacher_disagreement_score":0.025537109,"about_ca_system_score_codex":0.00017415365,"about_ca_system_score_gemma":0.00021294582,"threshold_uncertainty_score":0.085430145},"labels":[],"label_agreement":null},{"id":"W3092537323","doi":"10.1007/978-3-030-59830-3_63","title":"A Survey on Peripheral Blood Smear Analysis Using Deep Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Concordia University","funders":"","keywords":"Computer science; Context (archaeology); Peripheral blood; Deep learning; Artificial neural network; Artificial intelligence; Process (computing); Machine learning; Medicine; Immunology","score_opus":0.024419705581243997,"score_gpt":0.25573689412559253,"score_spread":0.23131718854434852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092537323","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019129343,0.7743042,0.18300717,0.002225447,0.0011956188,0.00010857506,0.0019507435,0.0015980627,0.01648087],"genre_scores_gemma":[0.09287628,0.76015764,0.11044411,0.0028271344,0.0019498038,0.00012256899,0.007871312,0.00040457243,0.023346527],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999577,0.000064680964,0.000051064,0.00011916477,0.0001572654,0.00003073666],"domain_scores_gemma":[0.99912435,0.0004990502,0.00004478876,0.000064160915,0.00022980152,0.0000379596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089661166,0.00058590225,0.0006759501,0.0018234312,0.00012114627,0.00067602034,0.00097026903,0.0005930643,0.0037791778],"category_scores_gemma":[0.002108903,0.00037748585,0.00068790914,0.002144511,0.00014443701,0.0014175564,0.00058621506,0.0006120796,0.0018409516],"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.000055430708,0.000062257604,0.0020514051,0.00091346266,0.000054728105,0.000036371173,0.000011535769,0.0016546162,0.0016867366,0.00081512413,0.015070216,0.9775882],"study_design_scores_gemma":[0.00007270355,0.0008824333,0.026553938,0.0046117143,0.0007802307,0.003931865,0.00024061819,0.14163557,0.035361975,0.019251255,0.7664599,0.00021789246],"about_ca_topic_score_codex":0.0020490473,"about_ca_topic_score_gemma":0.0028645275,"teacher_disagreement_score":0.0037791778,"about_ca_system_score_codex":0.00027939148,"about_ca_system_score_gemma":0.0006483179,"threshold_uncertainty_score":0.012642622},"labels":[],"label_agreement":null},{"id":"W3092561602","doi":"10.1007/978-3-030-59830-3_13","title":"Automating Stress Detection from Handwritten Documents","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition 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":"Concordia University","funders":"","keywords":"Handwriting; Computer science; Stress (linguistics); Focus (optics); Automation; Process (computing); Handwriting recognition; Artificial intelligence; Field (mathematics); Speech recognition; Natural language processing; Feature extraction; Programming language; Engineering","score_opus":0.01565083413286273,"score_gpt":0.23883267184358536,"score_spread":0.22318183771072264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092561602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3268147,0.004963225,0.6153117,0.00035352758,0.0012543076,0.00055778585,0.0070707337,0.03284666,0.010827409],"genre_scores_gemma":[0.44588754,0.0033478024,0.50067085,0.00034254693,0.0007371026,0.00044721432,0.011554418,0.0026623716,0.03435023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955195,0.000020902566,0.00003456586,0.00014944412,0.00016562271,0.00007745861],"domain_scores_gemma":[0.9988733,0.00029364252,0.0001623601,0.0001280281,0.0004623903,0.000080279766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186171,0.0021015352,0.0014716857,0.0028445392,0.00057299534,0.0013116192,0.001053077,0.000969794,0.0074199364],"category_scores_gemma":[0.0010424913,0.0006010738,0.0007467207,0.0018486099,0.00030022167,0.0009438836,0.0012380312,0.00068715337,0.009939098],"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.00045698503,0.00008082783,0.0022339285,0.00028054634,0.000043350537,0.00037920577,0.00007203319,0.00076979666,0.29879966,0.00016486611,0.006818557,0.6899003],"study_design_scores_gemma":[0.00013524978,0.0012038874,0.092121445,0.00030622384,0.00047222796,0.0039521973,0.00096801884,0.23474394,0.6140339,0.004193239,0.047668237,0.00020146203],"about_ca_topic_score_codex":0.002021123,"about_ca_topic_score_gemma":0.0057494836,"teacher_disagreement_score":0.0074199364,"about_ca_system_score_codex":0.00029077815,"about_ca_system_score_gemma":0.0005895523,"threshold_uncertainty_score":0.024822176},"labels":[],"label_agreement":null},{"id":"W3092569441","doi":"10.1007/978-3-030-60975-7_23","title":"Regional Influences on Tourists Mobility Through the Lens of Social Sensing","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lens (geology); Through-the-lens metering; Human–computer interaction; Remote sensing; Optics; Geology; Physics","score_opus":0.04111003033634084,"score_gpt":0.3055592203686146,"score_spread":0.26444919003227374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092569441","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.8133556,0.0035687715,0.012090107,0.005178549,0.000075388474,0.000015353258,0.0007843046,0.00006051964,0.16487142],"genre_scores_gemma":[0.9973264,0.0005343933,0.00063907506,0.00003411971,0.000027441907,0.0000032822948,0.000034100616,0.000011784025,0.0013893275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9997528,0.00013534485,0.0000040519412,0.000039937375,0.000023497638,0.00004437006],"domain_scores_gemma":[0.99882835,0.0008195351,0.00016229443,0.000054854587,0.000059796297,0.00007523238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042326574,0.00018539466,0.00016604322,0.00079081417,0.0006019188,0.003016016,0.00034336973,0.00042242912,0.005117457],"category_scores_gemma":[0.0018187248,0.00014608903,0.00031134338,0.0016073289,0.0015546452,0.0018346738,0.001242231,0.0006871828,0.00022327795],"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.00030743785,0.00007999802,0.1976844,0.00040184968,0.0003567299,0.0008897566,0.043060496,0.021117218,0.005635794,0.63334554,0.00976484,0.087355815],"study_design_scores_gemma":[0.000023418319,0.0001893713,0.6268725,0.00040842572,0.00033865785,0.00063178263,0.100231566,0.03400535,0.0014018401,0.15435846,0.08142069,0.0001180121],"about_ca_topic_score_codex":0.028186666,"about_ca_topic_score_gemma":0.04639028,"teacher_disagreement_score":0.028186666,"about_ca_system_score_codex":0.001104897,"about_ca_system_score_gemma":0.00046445138,"threshold_uncertainty_score":0.056045234},"labels":[],"label_agreement":null},{"id":"W3092606344","doi":"10.1007/978-3-030-61255-9_16","title":"Canadian Federal Election and Hashtags that Do Not Belong","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Interpretability; Scalability; Modularity (biology); Simple (philosophy); Interpretation (philosophy); Social media; Social network analysis; Perspective (graphical); Data science; World Wide Web; Artificial intelligence","score_opus":0.012999323780317883,"score_gpt":0.23298521891374027,"score_spread":0.2199858951334224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092606344","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.41508818,0.004305724,0.0012603689,0.030877419,0.0010585577,0.000153297,0.08991273,0.00020960132,0.45713413],"genre_scores_gemma":[0.9279767,0.0011098776,0.00032257548,0.0008868433,0.00010678806,0.000025848774,0.012194404,0.00005830408,0.05731879],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9975352,0.00016151817,0.00006158566,0.00021716495,0.0008745161,0.0011499798],"domain_scores_gemma":[0.9906178,0.0021057753,0.001402629,0.0004818754,0.0036173016,0.0017744661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012534885,0.0002766077,0.00047898348,0.0026053998,0.0056376406,0.0037285287,0.00095697615,0.0010426377,0.03339207],"category_scores_gemma":[0.01710207,0.0002495064,0.00038500712,0.009982849,0.0012532776,0.0016459933,0.0011084382,0.001885769,0.0022556118],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00127296,0.00011646703,0.31751102,0.00021403655,0.00013180313,0.00028321779,0.0023026688,0.0019038976,0.00024131851,0.11389971,0.5101849,0.051938027],"study_design_scores_gemma":[0.00010613004,0.00004986336,0.6328353,0.00017530423,0.0001459639,0.00029551785,0.01039371,0.0044181147,0.0006823243,0.013814353,0.33692375,0.0001597299],"about_ca_topic_score_codex":0.9873718,"about_ca_topic_score_gemma":0.9944938,"teacher_disagreement_score":0.03339207,"about_ca_system_score_codex":0.029984718,"about_ca_system_score_gemma":0.03792274,"threshold_uncertainty_score":0.2175554},"labels":[],"label_agreement":null},{"id":"W3092616113","doi":"10.1007/978-3-030-59830-3_15","title":"A Hybrid Multiple Classifier System Applied in Life Insurance Underwriting","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Underwriting; Computer science; Classifier (UML); Life insurance; Insurance industry; Linear discriminant analysis; CHAID; Artificial intelligence; Medical underwriting; Support vector machine; Machine learning; Data mining; Pattern recognition (psychology); Insurance policy; Actuarial science; General insurance; Decision tree; Business","score_opus":0.022107116090388193,"score_gpt":0.2090633479821192,"score_spread":0.186956231891731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092616113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2200525,0.0039221267,0.7629424,0.0005042497,0.0014477824,0.00019858466,0.00045945708,0.0041634263,0.0063094757],"genre_scores_gemma":[0.8081372,0.00080510456,0.17809203,0.00025318682,0.00036564862,0.00009962776,0.00048449257,0.000085948646,0.011676728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996018,0.00006756448,0.00003437704,0.00010934006,0.00013789831,0.000049167284],"domain_scores_gemma":[0.9994816,0.00014161332,0.000022538563,0.000035873913,0.00028718612,0.0000312301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078520033,0.00043518958,0.0009969538,0.00087766896,0.00057494617,0.000958784,0.0008232539,0.001083483,0.0027036397],"category_scores_gemma":[0.001038002,0.00027882945,0.0004946273,0.00068651355,0.000121252364,0.0007793364,0.00045906776,0.0006400171,0.0011412292],"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.000640383,0.0003821317,0.0051709465,0.00012027804,0.00015161191,0.00031806793,0.00005890549,0.03636045,0.04268061,0.00096504437,0.0060214065,0.90713024],"study_design_scores_gemma":[0.000019343242,0.00019181763,0.002668301,0.0000122054835,0.00009425575,0.00014053124,0.000025323947,0.9822206,0.011600248,0.00061111903,0.0023935814,0.00002251858],"about_ca_topic_score_codex":0.0034783909,"about_ca_topic_score_gemma":0.004824103,"teacher_disagreement_score":0.0034783909,"about_ca_system_score_codex":0.00039512725,"about_ca_system_score_gemma":0.0005282699,"threshold_uncertainty_score":0.009044588},"labels":[],"label_agreement":null},{"id":"W3092942046","doi":"10.1007/978-3-030-64559-5_33","title":"Semantic Segmentation with Peripheral Vision","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Pascal (unit); Segmentation; Encoder; Artificial intelligence; Convolutional neural network; Benchmark (surveying); Deep learning; Image segmentation; Machine vision; Computer vision; Machine learning; Pattern recognition (psychology)","score_opus":0.013320507794946439,"score_gpt":0.25853472666804217,"score_spread":0.24521421887309572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092942046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00604725,0.0018635681,0.9414026,0.00024326358,0.00035533644,0.00005612034,0.00053535774,0.010058413,0.039438043],"genre_scores_gemma":[0.15288374,0.002028868,0.7833858,0.0004046294,0.00031609274,0.00010532994,0.0037226044,0.0027457743,0.054407258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973804,0.000025700576,0.000013855114,0.00012626438,0.000060177623,0.000035988876],"domain_scores_gemma":[0.99983203,0.000041464547,0.000008717541,0.00006290442,0.000036207155,0.000018636925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035010482,0.0011498973,0.0009588954,0.0011968093,0.0005373373,0.0022330096,0.0013338653,0.0011841812,0.029778121],"category_scores_gemma":[0.00066874694,0.0007173373,0.0009687939,0.0017353748,0.00083536404,0.0024865712,0.0018510944,0.0012397363,0.012735879],"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.0002746693,0.000049729235,0.00010758595,0.00032707184,0.000044741908,0.00010399978,0.00006744799,0.008048626,0.043246634,0.07158351,0.028587088,0.847559],"study_design_scores_gemma":[0.00004472908,0.000163219,0.00082612445,0.00014404519,0.00009002837,0.00094746257,0.00009626707,0.33984506,0.10717774,0.40216294,0.14844318,0.00005918338],"about_ca_topic_score_codex":0.0014815179,"about_ca_topic_score_gemma":0.0018796229,"teacher_disagreement_score":0.029778121,"about_ca_system_score_codex":0.0006002128,"about_ca_system_score_gemma":0.0005683925,"threshold_uncertainty_score":0.09961772},"labels":[],"label_agreement":null},{"id":"W3093693419","doi":"10.1007/978-3-030-60376-2_18","title":"Robot Distancing: Planar Construction with Lanes","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Robot; Swarm behaviour; Robustness (evolution); Deadlock; Computer science; Planar; Task (project management); Cluster analysis; Distributed computing; Swarm robotics; Artificial intelligence; Simulation; Engineering","score_opus":0.01223757733065365,"score_gpt":0.19556826521872156,"score_spread":0.18333068788806792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093693419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010743642,0.00090194464,0.930561,0.00014938274,0.00011915433,0.000059721286,0.0001161586,0.0018592785,0.05548973],"genre_scores_gemma":[0.25563058,0.0021971045,0.66221404,0.000094485054,0.000062657105,0.00013905448,0.0006611806,0.00095202733,0.078048825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980015,0.000028139722,0.000005570031,0.000049243026,0.00008907309,0.000027903408],"domain_scores_gemma":[0.9999076,0.000025296618,0.000011005628,0.000025946496,0.000018994308,0.000011201652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013569457,0.00091599114,0.00040684894,0.0004651552,0.00048305778,0.0009269773,0.0012620137,0.00064817467,0.0167624],"category_scores_gemma":[0.00037445224,0.0006580066,0.0004925815,0.00078524306,0.0009948864,0.001383626,0.0016436662,0.0009923253,0.0044827717],"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.00017351934,0.000078206074,0.00037732188,0.0005403562,0.000017302204,0.00011835642,0.00025918926,0.10874821,0.042763963,0.17194098,0.01366851,0.66131413],"study_design_scores_gemma":[0.000067028916,0.0004653689,0.001184028,0.00021725032,0.00004730848,0.0011040281,0.00037851385,0.354642,0.054301824,0.24192539,0.3455622,0.00010503004],"about_ca_topic_score_codex":0.00085798773,"about_ca_topic_score_gemma":0.0013588973,"teacher_disagreement_score":0.0167624,"about_ca_system_score_codex":0.00036098526,"about_ca_system_score_gemma":0.00052776985,"threshold_uncertainty_score":0.05607581},"labels":[],"label_agreement":null},{"id":"W3094293236","doi":"10.1007/978-3-030-67670-4_30","title":"SoccerMap: A Deep Learning Architecture for Visually-Interpretable Analysis in Soccer","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Flexibility (engineering); Architecture; Deep learning; Set (abstract data type); Adaptation (eye); Convolutional neural network; Hierarchy; Identification (biology); Feature (linguistics); Network architecture","score_opus":0.01736987876051415,"score_gpt":0.2383954794056918,"score_spread":0.22102560064517765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094293236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0156276,0.0014127485,0.9532013,0.00042337997,0.00030666735,0.00011742926,0.0026788658,0.016905226,0.009326822],"genre_scores_gemma":[0.23748934,0.0023274622,0.7067729,0.0007689504,0.00017086368,0.00040029455,0.008955119,0.00238657,0.04072852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998921,0.000015850157,0.0000045188026,0.000036882884,0.000030566836,0.000020153606],"domain_scores_gemma":[0.99987626,0.00003837384,0.0000058339024,0.000022311442,0.00004073363,0.000016425589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003145258,0.001148395,0.00043076643,0.0004911527,0.0002864783,0.00089865876,0.0015138823,0.0009137,0.01745329],"category_scores_gemma":[0.0008131953,0.00055570767,0.0008100843,0.000563922,0.0002807244,0.0011014988,0.0014582236,0.0014245076,0.003840279],"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.00024806976,0.00014560242,0.0006929788,0.00021779235,0.00013138987,0.00012787915,0.00007929383,0.09479732,0.017373867,0.008313807,0.05640583,0.82146615],"study_design_scores_gemma":[0.000021933734,0.000059104073,0.00076323096,0.000051809748,0.000031264008,0.000074520845,0.000024616564,0.95450443,0.0093700085,0.018200766,0.016877053,0.000021263508],"about_ca_topic_score_codex":0.008619956,"about_ca_topic_score_gemma":0.016889716,"teacher_disagreement_score":0.01745329,"about_ca_system_score_codex":0.0005280091,"about_ca_system_score_gemma":0.0008138507,"threshold_uncertainty_score":0.05838704},"labels":[],"label_agreement":null},{"id":"W3094520011","doi":"10.1007/978-3-662-64322-8_18","title":"SoK: Securing Email—A Stakeholder-Based Analysis","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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; Concordia University","funders":"","keywords":"Interoperability; Variety (cybernetics); Stakeholder; Cryptography; Computer science; Computer security; Key (lock); Key management; Internet privacy; World Wide Web; Public relations; Political science","score_opus":0.04306368391948214,"score_gpt":0.3104427026965355,"score_spread":0.2673790187770534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094520011","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64333135,0.00031178148,0.2950222,0.003307126,0.00007132745,0.0005865393,0.002175053,0.0010697464,0.05412489],"genre_scores_gemma":[0.9787459,0.000064566884,0.018650774,0.000053407588,0.0000085076235,0.000066112414,0.0004407152,0.00005322302,0.0019167407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9963368,0.001659809,0.00013087157,0.00034930222,0.0010361926,0.0004870015],"domain_scores_gemma":[0.9902201,0.006176443,0.00077435345,0.0011184791,0.001398719,0.00031195418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038568783,0.00045663398,0.0004913943,0.0022204532,0.0010671325,0.0033476686,0.0011289556,0.0013375245,0.0048273066],"category_scores_gemma":[0.014069665,0.00022627207,0.00069400907,0.0020858839,0.00168456,0.006136635,0.0019056095,0.0012100685,0.0005228768],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010932174,0.00046607037,0.0840071,0.00085505086,0.00021692296,0.0011929079,0.0076722438,0.113737226,0.009432828,0.64002085,0.009846965,0.1314586],"study_design_scores_gemma":[0.00003754811,0.00028093377,0.019805511,0.00014039196,0.00011875671,0.00042718972,0.009812579,0.81713927,0.006129321,0.13253559,0.0134980045,0.0000750138],"about_ca_topic_score_codex":0.005386624,"about_ca_topic_score_gemma":0.0035398568,"teacher_disagreement_score":0.005386624,"about_ca_system_score_codex":0.0021995332,"about_ca_system_score_gemma":0.0013934645,"threshold_uncertainty_score":0.020397365},"labels":[],"label_agreement":null},{"id":"W3094530067","doi":"","title":"MoHex 2.0: A Pattern-Based MCTS Hex Player","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","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 Alberta","funders":"","keywords":"Softmax function; Olympiad; Computer science; Monte Carlo tree search; Tree (set theory); Artificial intelligence; Monte Carlo method; Artificial neural network","score_opus":0.011689371281429935,"score_gpt":0.23765753986911461,"score_spread":0.22596816858768468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094530067","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.05197692,0.00039203712,0.69667095,0.00049164926,0.0006935138,0.0017304999,0.005097181,0.1064892,0.13645801],"genre_scores_gemma":[0.3983082,0.00033098692,0.4166869,0.000551272,0.00008279784,0.0017506259,0.0091040805,0.010880787,0.16230443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.00006947886,0.000061733466,0.00011546821,0.00033261013,0.00016265406],"domain_scores_gemma":[0.9994413,0.00009772448,0.00002594892,0.00019405183,0.00012331014,0.00011763543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005828317,0.000922337,0.0009224552,0.0007580203,0.0007532089,0.001770057,0.0048395316,0.001372836,0.089854516],"category_scores_gemma":[0.0018558644,0.00061570655,0.00058287807,0.0007621849,0.0005589683,0.0021815193,0.0055365507,0.0010788784,0.021716096],"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.009105566,0.001313057,0.0032555908,0.0011683139,0.00018869156,0.0014325529,0.001002109,0.02970744,0.10288318,0.10469971,0.1697981,0.5754456],"study_design_scores_gemma":[0.0012342603,0.001107357,0.0015097685,0.00022227183,0.00010506118,0.001074899,0.0005398494,0.5306364,0.10435075,0.044230625,0.31477866,0.00021017899],"about_ca_topic_score_codex":0.0024481635,"about_ca_topic_score_gemma":0.0033679984,"teacher_disagreement_score":0.089854516,"about_ca_system_score_codex":0.00067766523,"about_ca_system_score_gemma":0.0009602358,"threshold_uncertainty_score":0.30059326},"labels":[],"label_agreement":null},{"id":"W3094751736","doi":"10.1007/978-3-030-62401-9_9","title":"Weighted Group Search on a Line","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Group (periodic table); Line (geometry); Mathematics; Geometry","score_opus":0.03669237838102849,"score_gpt":0.27552589137066497,"score_spread":0.23883351298963648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094751736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019755384,0.00048975553,0.9137488,0.00061228964,0.0002853204,0.00010855111,0.00016907495,0.0008288823,0.064001985],"genre_scores_gemma":[0.2381638,0.0005712229,0.6239385,0.0004796421,0.00021328314,0.00040175644,0.0005415409,0.00063449907,0.13505574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996333,0.00014755793,0.00001072619,0.00006506697,0.00009026231,0.000053164997],"domain_scores_gemma":[0.9996159,0.00016427836,0.00002609559,0.000087950575,0.000061833,0.000043885317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900101,0.0007129503,0.0010188378,0.00059156655,0.00061604875,0.0010799319,0.0013671076,0.001173872,0.024428964],"category_scores_gemma":[0.0015162671,0.00033496,0.00060630334,0.0012935201,0.0006125327,0.0017492074,0.0014167859,0.0015139385,0.0048680315],"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.00042776734,0.00021956333,0.00032599995,0.00019529875,0.00007164482,0.00014329424,0.00016467604,0.20065652,0.0045601698,0.34080946,0.055304114,0.39712146],"study_design_scores_gemma":[0.000099926874,0.00020488045,0.00014198302,0.000040554165,0.00002244527,0.000088141685,0.00006192907,0.66648114,0.0015292012,0.2953843,0.03592872,0.000016845719],"about_ca_topic_score_codex":0.0009529782,"about_ca_topic_score_gemma":0.0011338822,"teacher_disagreement_score":0.024428964,"about_ca_system_score_codex":0.00054697826,"about_ca_system_score_gemma":0.00048733447,"threshold_uncertainty_score":0.081723034},"labels":[],"label_agreement":null},{"id":"W3094862917","doi":"10.1007/978-3-030-61814-8_7","title":"Design and Implementation of a Serious Game to Make Construction Workers Aware of Exposure to Silica Dust in the Workplace","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","field":"Engineering","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":"Centre Intégré Universitaire de Santé et de Services Sociaux du Saguenay–Lac-Saint-Jean; Université du Québec à Chicoutimi","funders":"","keywords":"Silicosis; Computer science; Work (physics); Risk analysis (engineering); Business; Medicine; Engineering; Pathology","score_opus":0.010782416865345158,"score_gpt":0.2305440920370108,"score_spread":0.21976167517166564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094862917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2626388,0.00017611009,0.7067253,0.00046522846,0.00021551053,0.0037493217,0.00028154714,0.0072485353,0.018499613],"genre_scores_gemma":[0.49660555,0.00013306845,0.48241892,0.00031049416,0.000010437786,0.0025314947,0.00035645807,0.0004089545,0.017224696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934083,0.0002093231,0.000046385274,0.00013942728,0.00015165753,0.000112435846],"domain_scores_gemma":[0.9990538,0.00043114333,0.000050806015,0.000059057882,0.00020071378,0.00020453143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693517,0.0013116729,0.0005013174,0.00039332878,0.0005480706,0.0015407864,0.003091421,0.0014701155,0.009048738],"category_scores_gemma":[0.0019123581,0.0006214032,0.00051796396,0.00011778411,0.0005653794,0.0008805085,0.0015347652,0.00072755065,0.0013505489],"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.005146982,0.0143512385,0.015520388,0.0031267172,0.00046262884,0.0028430545,0.012646425,0.078862615,0.347013,0.017006794,0.013753591,0.48926654],"study_design_scores_gemma":[0.0025593073,0.014361388,0.017123332,0.00057238026,0.00087882945,0.0016932783,0.0068692868,0.693934,0.14850499,0.010148771,0.10295098,0.00040344213],"about_ca_topic_score_codex":0.0026319106,"about_ca_topic_score_gemma":0.0026948163,"teacher_disagreement_score":0.009048738,"about_ca_system_score_codex":0.00047865164,"about_ca_system_score_gemma":0.001374974,"threshold_uncertainty_score":0.030270994},"labels":[],"label_agreement":null},{"id":"W3094926059","doi":"10.1007/978-3-030-62522-1_25","title":"Ontology-Based Modeling and Analysis of Trustworthiness Requirements: Preliminary Results","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Ontology; Requirements elicitation; Operationalization; Class (philosophy); Requirements analysis; Software engineering; Trustworthiness; Adversary; Requirements management; Judgement; Software; Computer security; Data science; Artificial intelligence","score_opus":0.037787944268536926,"score_gpt":0.302515752880493,"score_spread":0.26472780861195605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094926059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16271561,0.00036678018,0.8287744,0.00037982623,0.000029248193,0.00025763523,0.0007441791,0.00067489385,0.0060574976],"genre_scores_gemma":[0.6423717,0.0005736663,0.35228541,0.000071728464,0.000025772499,0.00027468443,0.0015190745,0.00022510205,0.0026528651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972397,0.0009521713,0.00018754961,0.0003345708,0.0010982777,0.00018766627],"domain_scores_gemma":[0.9838425,0.012962343,0.0006223853,0.0010539119,0.0013431438,0.00017569907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029267306,0.00061041315,0.0007673235,0.0016636938,0.0007819146,0.0021907727,0.0014448357,0.0007268376,0.0030310724],"category_scores_gemma":[0.016548831,0.00044130636,0.0024844394,0.0020428337,0.00076445914,0.0041470705,0.0012130598,0.0013733736,0.00040962076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043236208,0.0009142932,0.010841557,0.00043384492,0.0002869364,0.00022528032,0.0010602009,0.71596575,0.00788925,0.07767584,0.0025128264,0.18176189],"study_design_scores_gemma":[0.000011298677,0.000024247944,0.0008205806,0.0000135946275,0.000049926082,0.000023638151,0.00014172359,0.9800893,0.001126693,0.016854363,0.00083245547,0.000012154203],"about_ca_topic_score_codex":0.036894586,"about_ca_topic_score_gemma":0.024569927,"teacher_disagreement_score":0.036894586,"about_ca_system_score_codex":0.0025163803,"about_ca_system_score_gemma":0.0031356167,"threshold_uncertainty_score":0.07335967},"labels":[],"label_agreement":null},{"id":"W3094990874","doi":"10.1007/978-3-030-60026-6_7","title":"Power Series Arithmetic with the BPAS Library","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Computer science; Arithmetic; Series (stratigraphy); Power (physics); Mathematics","score_opus":0.007876717954030232,"score_gpt":0.19267990443386337,"score_spread":0.18480318647983315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094990874","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002837495,0.007447772,0.28804967,0.0013742141,0.0020428686,0.00007854699,0.0019942063,0.009288127,0.6868871],"genre_scores_gemma":[0.06684357,0.016092448,0.20953998,0.001262147,0.0035709115,0.00025794137,0.00643683,0.0070196255,0.6889766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994665,0.00007360204,0.000037423768,0.000090361966,0.0002930029,0.000039145973],"domain_scores_gemma":[0.9996549,0.00009024196,0.000021487907,0.00011077416,0.00008778431,0.00003476269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048048244,0.0010089913,0.0009598232,0.0027227146,0.0011566035,0.003117199,0.001506627,0.0006116868,0.08699134],"category_scores_gemma":[0.0014329788,0.00076118077,0.001210525,0.004508459,0.0010852121,0.005198272,0.0017561067,0.003128912,0.070161425],"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.00006475901,0.000042366846,0.000082214516,0.0003843391,0.000020753332,0.0000710825,0.00012224169,0.0011166616,0.002381731,0.4881904,0.16226591,0.3452576],"study_design_scores_gemma":[0.0000143216885,0.000015965574,0.00012311107,0.000096934564,0.000014800537,0.00027653668,0.000020705884,0.0019963146,0.002644676,0.30043438,0.69434166,0.000020712283],"about_ca_topic_score_codex":0.0005410856,"about_ca_topic_score_gemma":0.00088632706,"teacher_disagreement_score":0.08699134,"about_ca_system_score_codex":0.0010219091,"about_ca_system_score_gemma":0.0009176225,"threshold_uncertainty_score":0.29101503},"labels":[],"label_agreement":null},{"id":"W3095136631","doi":"10.1007/978-3-030-61746-2_5","title":"Geocaching-Inspired Navigation for Micro Aerial Vehicles with Fallible Place Recognition","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Global Positioning System; A priori and a posteriori; Artificial intelligence; Trajectory; Swarm behaviour; Computer vision; Machine learning; Human–computer interaction","score_opus":0.0253881843898928,"score_gpt":0.24211193241087658,"score_spread":0.2167237480209838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095136631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080034316,0.0015846188,0.9022957,0.00020628239,0.00029410745,0.00003599137,0.00013009398,0.0019013877,0.013517472],"genre_scores_gemma":[0.71576816,0.00061962666,0.26999334,0.000117479394,0.000060884944,0.000049573842,0.00027400628,0.00011812077,0.012998757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999422,0.0000039741785,0.0000017060206,0.000019131076,0.000022403556,0.000010577433],"domain_scores_gemma":[0.99995303,0.00001018895,0.000005182334,0.0000129752425,0.000013030063,0.0000056982954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049523227,0.00030528023,0.00037037584,0.00023358194,0.00028363476,0.0003274082,0.00085122406,0.00039620695,0.0014699048],"category_scores_gemma":[0.00018396287,0.00013968375,0.0001846273,0.00049975223,0.00027903155,0.00045156945,0.0004888195,0.000410479,0.00032479144],"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.00013949357,0.000069653295,0.0009274184,0.00012305357,0.000032955304,0.00018261881,0.00016314437,0.3298333,0.06990648,0.028783854,0.010719258,0.5591188],"study_design_scores_gemma":[0.0000059808417,0.000052973,0.00039213672,0.000007282388,0.000008846263,0.00010832494,0.000030618125,0.98032516,0.0061033275,0.00669284,0.0062643015,0.000008192229],"about_ca_topic_score_codex":0.0053143096,"about_ca_topic_score_gemma":0.007475509,"teacher_disagreement_score":0.0053143096,"about_ca_system_score_codex":0.000327148,"about_ca_system_score_gemma":0.00038931688,"threshold_uncertainty_score":0.010566771},"labels":[],"label_agreement":null},{"id":"W3095314349","doi":"10.1007/978-3-030-60026-6_9","title":"The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Bivariate analysis; Speedup; Parallel computing; Factorization; Maple; Interpolation (computer graphics); Artificial intelligence","score_opus":0.06510990149325345,"score_gpt":0.31830714447756303,"score_spread":0.25319724298430957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095314349","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.1345273,0.0008330367,0.82728446,0.00096459244,0.00038507182,0.00024347097,0.0004954054,0.0074342275,0.027832476],"genre_scores_gemma":[0.37895957,0.00042063877,0.603414,0.0002486922,0.0002760884,0.00028192252,0.001332712,0.00075090275,0.014315446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985415,0.00017314036,0.00009630501,0.00024756734,0.00055058644,0.0003909354],"domain_scores_gemma":[0.9979387,0.00080003706,0.00012047657,0.0007304455,0.00029462893,0.00011556478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073428976,0.0012232175,0.0010498175,0.00096104934,0.001175541,0.0026068091,0.0018469513,0.0009637425,0.016257178],"category_scores_gemma":[0.0034649197,0.00064442743,0.0010376801,0.002015164,0.0009195843,0.004480053,0.0025217216,0.0017349017,0.003584607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016582514,0.00049769564,0.001903288,0.00038592416,0.000096943855,0.00026443406,0.00043917962,0.034156572,0.04522687,0.11893819,0.02418583,0.7722468],"study_design_scores_gemma":[0.0005348502,0.0004431694,0.0019433893,0.00006998186,0.00017019083,0.00054119376,0.00046109388,0.74355423,0.06541899,0.16451603,0.022216046,0.00013086645],"about_ca_topic_score_codex":0.0036093965,"about_ca_topic_score_gemma":0.007927416,"teacher_disagreement_score":0.016257178,"about_ca_system_score_codex":0.0013905679,"about_ca_system_score_gemma":0.0023021302,"threshold_uncertainty_score":0.054385662},"labels":[],"label_agreement":null},{"id":"W3095348168","doi":"10.1007/978-3-030-88238-9_9","title":"Improved Attacks Against Key Reuse in Learning with Errors Key Exchange","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Reuse; Key exchange; Computer security; Public-key cryptography; Encryption; Engineering","score_opus":0.018335870091285594,"score_gpt":0.2421084689024504,"score_spread":0.22377259881116482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095348168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108003736,0.0012069239,0.8615648,0.0009947773,0.0002648542,0.00021891402,0.000115810435,0.0034553418,0.024174796],"genre_scores_gemma":[0.8869414,0.00044866174,0.09627041,0.00017497443,0.00014562428,0.00008832795,0.00012286169,0.00026444273,0.015543258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99262214,0.0022392527,0.00039190988,0.0006715744,0.0027718393,0.0013032877],"domain_scores_gemma":[0.9872502,0.005020885,0.00064720155,0.0060311668,0.00083174795,0.00021880551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031012709,0.001302702,0.0018201874,0.0014631916,0.001293551,0.0020441534,0.0020378996,0.0027353067,0.0043607233],"category_scores_gemma":[0.010855415,0.00069016614,0.0010361578,0.0017458759,0.002172181,0.0059607527,0.0060423934,0.0029819102,0.0018863425],"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.0033050557,0.000510995,0.0018685198,0.00034192682,0.00021593309,0.00072555646,0.00074512727,0.10295589,0.042662177,0.33574137,0.011557479,0.49936995],"study_design_scores_gemma":[0.00018035063,0.00049059914,0.0008279946,0.00009576077,0.00015806661,0.0014377869,0.00014247358,0.69435036,0.084974185,0.20177086,0.015475638,0.000095924464],"about_ca_topic_score_codex":0.00046495904,"about_ca_topic_score_gemma":0.00032457788,"teacher_disagreement_score":0.0043607233,"about_ca_system_score_codex":0.0013077236,"about_ca_system_score_gemma":0.0008680881,"threshold_uncertainty_score":0.01640129},"labels":[],"label_agreement":null},{"id":"W3095661913","doi":"10.1007/978-3-030-62466-8_32","title":"Reasoning Engine for Support Maintenance","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Thales (Canada)","funders":"","keywords":"Computer science; Broadcasting (networking); Cluster analysis; Pipeline (software); Representation (politics); Artificial intelligence; Data mining; Machine learning; Information retrieval; Programming language; Computer security","score_opus":0.0175610983378918,"score_gpt":0.2502699543932576,"score_spread":0.23270885605536581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095661913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066073476,0.00076886587,0.929994,0.0007107945,0.0002821737,0.0003339518,0.0034044746,0.043025658,0.014872736],"genre_scores_gemma":[0.081302285,0.00047632083,0.8919352,0.0005453161,0.00013032944,0.00019678651,0.007664143,0.0013874284,0.016362142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875116,0.000158858,0.00014582023,0.0003057796,0.0005373267,0.00010101452],"domain_scores_gemma":[0.99807537,0.00076018675,0.000088948094,0.0006232119,0.0003849051,0.00006736178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439353,0.001185539,0.0009838641,0.0022049525,0.00075536926,0.0029618458,0.0038189287,0.0015828474,0.02015925],"category_scores_gemma":[0.00536013,0.00078814797,0.0018303083,0.0015895156,0.00060978567,0.0043715355,0.0017611335,0.0020027538,0.008523847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061649334,0.0004172935,0.001189487,0.0008355302,0.00019985085,0.00047703428,0.0002533266,0.019765178,0.014242462,0.09748907,0.06937056,0.7951437],"study_design_scores_gemma":[0.00022517548,0.00017242934,0.00075878104,0.00028534207,0.0005953595,0.00088429305,0.00014445987,0.572243,0.05694675,0.21272963,0.15491275,0.000102031416],"about_ca_topic_score_codex":0.004225564,"about_ca_topic_score_gemma":0.004872751,"teacher_disagreement_score":0.02015925,"about_ca_system_score_codex":0.0008366553,"about_ca_system_score_gemma":0.0016895216,"threshold_uncertainty_score":0.06743938},"labels":[],"label_agreement":null},{"id":"W3095732274","doi":"10.1007/978-3-030-60290-1_17","title":"DeepStyle: User Style Embedding for Authorship Attribution of Short Texts","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Authorship Attribution and Profiling","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 Saskatchewan","funders":"","keywords":"Computer science; Task (project management); Salient; Authorship attribution; Embedding; Word embedding; Style (visual arts); Word (group theory); Artificial intelligence; Natural language processing; Attribution; Writing style; Information retrieval; Linguistics","score_opus":0.04678901294171871,"score_gpt":0.3068086415893817,"score_spread":0.260019628647663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095732274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061267238,0.0021054912,0.8813132,0.00048439245,0.0013707081,0.00020395765,0.00964102,0.03676166,0.006852424],"genre_scores_gemma":[0.46782696,0.001669328,0.4632616,0.0003033133,0.0011073772,0.00043738703,0.02462968,0.0045320727,0.0362323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998642,0.0003497593,0.0001123103,0.00041544595,0.00037564893,0.00010489708],"domain_scores_gemma":[0.9968374,0.001227458,0.00024600132,0.0010044606,0.0004789256,0.00020583153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388799,0.0015068889,0.00072175055,0.0030746916,0.00054863974,0.0017331006,0.000848335,0.0010546598,0.009637575],"category_scores_gemma":[0.006243602,0.0005157617,0.0007666668,0.0024161853,0.00037790262,0.0038361754,0.0023378024,0.0015357615,0.0076514874],"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.00046687704,0.00027953868,0.0042178747,0.00031695887,0.00009452069,0.0001425567,0.00049274246,0.007773196,0.0150998635,0.004636804,0.051479276,0.9149998],"study_design_scores_gemma":[0.00007953386,0.0003161242,0.007822172,0.0001680738,0.00010647497,0.00079002837,0.00032592073,0.8435799,0.03785366,0.05185326,0.056969367,0.00013554748],"about_ca_topic_score_codex":0.0007881228,"about_ca_topic_score_gemma":0.002080721,"teacher_disagreement_score":0.009637575,"about_ca_system_score_codex":0.00039945327,"about_ca_system_score_gemma":0.00047715043,"threshold_uncertainty_score":0.032240868},"labels":[],"label_agreement":null},{"id":"W3095754584","doi":"10.1007/978-3-030-58610-2_23","title":"Generating Videos of Zero-Shot Compositions of Actions and Objects","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Vector Institute; University of British Columbia; Canadian Institute for Advanced Research; Collège Boréal; Simon Fraser University","funders":"","keywords":"Computer science; Object (grammar); Generalization; Artificial intelligence; Shot (pellet); Task (project management); Action (physics); Adversarial system; Computer vision; Human–computer interaction; Mathematics","score_opus":0.036812572196931195,"score_gpt":0.2650436895924925,"score_spread":0.22823111739556134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095754584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16783918,0.00082464743,0.8004918,0.0003102816,0.00048987963,0.0008876582,0.0058600586,0.011031188,0.012265348],"genre_scores_gemma":[0.33660352,0.00061265414,0.631982,0.00014995082,0.00012348895,0.00027335293,0.015030028,0.000906458,0.014318435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980515,0.000020131529,0.000005517896,0.00007495831,0.00006448427,0.00002979572],"domain_scores_gemma":[0.9996798,0.00013044587,0.000017603037,0.00003953046,0.00008193831,0.0000506498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002374602,0.0011993381,0.00056835107,0.00078348804,0.0002987136,0.0004929512,0.0010450279,0.0009263394,0.008013794],"category_scores_gemma":[0.0010015583,0.00037522372,0.00064034626,0.00058163493,0.0002692511,0.0004925738,0.0006700909,0.00074836845,0.0018871884],"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.0015173136,0.0004765207,0.0021598781,0.0006560993,0.0001553938,0.0014912763,0.00017569677,0.03824662,0.17193115,0.0050919587,0.027914852,0.75018317],"study_design_scores_gemma":[0.00012966536,0.0004977669,0.0043885713,0.000081760365,0.000084163345,0.0012594698,0.00030613554,0.8777366,0.09420068,0.007988829,0.013286659,0.000039733965],"about_ca_topic_score_codex":0.0057018264,"about_ca_topic_score_gemma":0.010770247,"teacher_disagreement_score":0.008013794,"about_ca_system_score_codex":0.0004133246,"about_ca_system_score_gemma":0.0005159267,"threshold_uncertainty_score":0.026808798},"labels":[],"label_agreement":null},{"id":"W3096190105","doi":"10.1007/978-3-030-61609-0_38","title":"Unsupervised Anomaly Detection with a GAN Augmented Autoencoder","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Concordia University","funders":"","keywords":"Autoencoder; Computer science; Anomaly detection; Artificial intelligence; Anomaly (physics); Pattern recognition (psychology); Artificial neural network; Physics; Condensed matter physics","score_opus":0.012412822279327683,"score_gpt":0.22099166406703585,"score_spread":0.20857884178770816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096190105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009230683,0.00016297247,0.9881352,0.0000740398,0.000074667914,0.000016335629,0.000063258616,0.0013465782,0.0008962914],"genre_scores_gemma":[0.42526174,0.0003004498,0.5645329,0.00021586377,0.00015609666,0.00007747785,0.0008113653,0.0003122432,0.008331971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.00007518527,0.000015468271,0.00014196061,0.00012820035,0.000055141543],"domain_scores_gemma":[0.9995167,0.00017146472,0.000035574645,0.00009924005,0.0001552363,0.000021669477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561257,0.00075592875,0.00082443224,0.00046182214,0.00017547682,0.0004890721,0.0009975595,0.0007610875,0.0010823306],"category_scores_gemma":[0.0010609374,0.00043972075,0.0007255549,0.000488881,0.00032219835,0.00066186365,0.0008359823,0.0014777418,0.00076807075],"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.00022442626,0.00013648799,0.0017796017,0.000074216005,0.00016147176,0.0001907542,0.000048751997,0.24549092,0.044929836,0.005777612,0.0070983917,0.69408756],"study_design_scores_gemma":[0.0000019644172,0.000014517818,0.0002843732,0.0000021695212,0.0000069731364,0.00005402498,0.0000021616647,0.995097,0.0029433104,0.0011225704,0.0004667865,0.0000041645176],"about_ca_topic_score_codex":0.002270955,"about_ca_topic_score_gemma":0.0043614274,"teacher_disagreement_score":0.002270955,"about_ca_system_score_codex":0.00028123765,"about_ca_system_score_gemma":0.0004302393,"threshold_uncertainty_score":0.0045154095},"labels":[],"label_agreement":null},{"id":"W3096266342","doi":"10.1007/978-3-030-61377-8_28","title":"BERTimbau: Pretrained BERT Models for Brazilian Portuguese","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":598,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Transformer; Language model; Sentence; Encoder; Portuguese; Transfer of learning; Textual entailment; Named-entity recognition; Logical consequence; Linguistics","score_opus":0.029260968444769126,"score_gpt":0.25291092292700496,"score_spread":0.22364995448223582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096266342","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.08035384,0.0032864816,0.7756815,0.0046134396,0.0008435063,0.0001623093,0.010073113,0.004093669,0.12089214],"genre_scores_gemma":[0.74947745,0.0019855404,0.12897764,0.0004105178,0.00028640288,0.0002636437,0.0074339984,0.0019270743,0.10923769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972814,0.00009838288,0.000014078021,0.000058155,0.00004917988,0.00005199624],"domain_scores_gemma":[0.9993741,0.0003527912,0.000039035698,0.00008598504,0.00010226373,0.000045889217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009027429,0.0012110532,0.0008981635,0.00052037416,0.0008505856,0.0020344045,0.0017743718,0.0015011287,0.015197346],"category_scores_gemma":[0.004401272,0.0006696854,0.0012501123,0.00081597996,0.0004539629,0.0022015632,0.0010675157,0.001811847,0.0024446459],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017798285,0.000063366126,0.0010495366,0.00013589457,0.000052358308,0.0001755508,0.00022432164,0.7455327,0.00060861214,0.17086875,0.024075154,0.05703569],"study_design_scores_gemma":[0.0000119183605,0.0000078567955,0.00021062231,0.000025181724,0.00001329347,0.000022709859,0.000030920128,0.9444594,0.00021063977,0.04464785,0.010348361,0.000011318339],"about_ca_topic_score_codex":0.07336289,"about_ca_topic_score_gemma":0.08831627,"teacher_disagreement_score":0.07336289,"about_ca_system_score_codex":0.0019788663,"about_ca_system_score_gemma":0.001749722,"threshold_uncertainty_score":0.14587176},"labels":[],"label_agreement":null},{"id":"W3096288126","doi":"10.1007/978-3-030-60816-3_30","title":"Challenges Related to 4D BIM Simulation in the Construction Industry","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"École de Technologie Supérieure","funders":"","keywords":"Perspective (graphical); Computer science; Construction industry; Knowledge management; Software; Engineering management; Qualitative property; Construction engineering; Engineering; Artificial intelligence","score_opus":0.023101771775548573,"score_gpt":0.2391388738017311,"score_spread":0.21603710202618254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096288126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042114537,0.031773876,0.6899355,0.04488365,0.002831349,0.00017491185,0.00094887207,0.0031234757,0.18421386],"genre_scores_gemma":[0.456428,0.04702633,0.42765713,0.0034609989,0.0009716646,0.00038973815,0.0018541105,0.0013104556,0.06090149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812955,0.0007337826,0.000055966702,0.00009633517,0.0008827887,0.000101695994],"domain_scores_gemma":[0.99631494,0.0026060315,0.00008320029,0.00028909964,0.0005081135,0.00019860738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004060903,0.0006794073,0.0013299754,0.0010103601,0.0012179886,0.006686549,0.0031464247,0.0030940499,0.016958302],"category_scores_gemma":[0.005462437,0.0009779461,0.0008822293,0.0017879835,0.002071565,0.0049873735,0.003862767,0.0028126612,0.0035870587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089714114,0.000105578685,0.0011361098,0.00069475704,0.00005481855,0.00026058932,0.0006501987,0.524394,0.002295397,0.23170018,0.029010119,0.20960863],"study_design_scores_gemma":[0.000016419048,0.00004547665,0.00038405502,0.00046017478,0.000018481005,0.0003158991,0.0008989607,0.6296383,0.0019352965,0.18778546,0.17843898,0.00006245524],"about_ca_topic_score_codex":0.0068454016,"about_ca_topic_score_gemma":0.007838986,"teacher_disagreement_score":0.016958302,"about_ca_system_score_codex":0.0020280695,"about_ca_system_score_gemma":0.0022676976,"threshold_uncertainty_score":0.056731164},"labels":[],"label_agreement":null},{"id":"W3096564917","doi":"10.1007/978-3-030-60117-1_6","title":"Creating Emotional Attachment with Assistive Wearables","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Carleton University","funders":"","keywords":"Wearable computer; Assistive technology; Computer science; Wearable technology; Human–computer interaction; Stigma (botany); Internet privacy; Psychology","score_opus":0.020711362502886847,"score_gpt":0.2676808128968941,"score_spread":0.24696945039400725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096564917","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44760695,0.003944993,0.3288677,0.0021747844,0.0016873484,0.00027137648,0.00025787074,0.0019199353,0.2132691],"genre_scores_gemma":[0.8627195,0.001995342,0.08652553,0.00068291085,0.00017135571,0.00023417774,0.00022367056,0.0003330842,0.047114413],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964,0.00016192567,0.000014488597,0.000051685052,0.000083913605,0.00004790121],"domain_scores_gemma":[0.9994603,0.0003185709,0.000031108568,0.0000754458,0.0000600698,0.000054545613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005591681,0.0006330717,0.00025135977,0.00023650873,0.0005712942,0.0018243352,0.0006658721,0.00065966527,0.012686738],"category_scores_gemma":[0.0026653544,0.00026672086,0.00041552586,0.000248192,0.00068011344,0.0021206571,0.003183367,0.0008515461,0.0024779602],"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.0005766399,0.00051930733,0.004160275,0.0014079626,0.00011466409,0.0021046938,0.042409398,0.0017672909,0.17442615,0.041221123,0.029677397,0.7016152],"study_design_scores_gemma":[0.0002897877,0.0026595874,0.046269506,0.002830304,0.00082886213,0.010773889,0.059746068,0.048018742,0.15037785,0.17243978,0.5052969,0.00046876643],"about_ca_topic_score_codex":0.00010103971,"about_ca_topic_score_gemma":0.00026299976,"teacher_disagreement_score":0.012686738,"about_ca_system_score_codex":0.00015224874,"about_ca_system_score_gemma":0.00009806844,"threshold_uncertainty_score":0.04244131},"labels":[],"label_agreement":null},{"id":"W3096764502","doi":"10.1007/978-3-030-72084-1_39","title":"A Two-Stage Cascade Model with Variational Autoencoders and Attention Gates for MRI Brain Tumor Segmentation","year":2021,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute on Aging; National Institutes of Health; York University","keywords":"Autoencoder; Computer science; Overfitting; Dice; Hausdorff distance; Artificial intelligence; Segmentation; Cascade; Pattern recognition (psychology); Encoder; Stage (stratigraphy); Deep learning; Artificial neural network; Mathematics","score_opus":0.02463991576076465,"score_gpt":0.2800392262772498,"score_spread":0.2553993105164852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096764502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022750596,0.0010819988,0.97278655,0.00035737257,0.00009876476,0.000047965284,0.00013219047,0.000426931,0.0023176465],"genre_scores_gemma":[0.80483496,0.0008273611,0.17576234,0.00032695156,0.00015562556,0.00023051086,0.00043243592,0.00021397759,0.017215883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975747,0.00005495737,0.000014182143,0.00007660399,0.000042051448,0.000054749584],"domain_scores_gemma":[0.9995883,0.0002469026,0.000026215046,0.000026678199,0.000080937076,0.00003101858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008762705,0.00087641994,0.0014130742,0.00042997958,0.00043874996,0.0008010929,0.002641551,0.0028648162,0.00363509],"category_scores_gemma":[0.0012685994,0.0012339678,0.0012509443,0.0004278657,0.0007401391,0.0013028869,0.0013248337,0.0017989951,0.0008437483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002149701,0.00007466686,0.0004363247,0.000107722364,0.00010164749,0.00012465459,0.00007419376,0.91469896,0.006381676,0.013997828,0.0016520218,0.062135234],"study_design_scores_gemma":[0.0000029574148,0.000011514888,0.000037699123,0.0000024717594,0.000007595519,0.0000098696855,0.0000015783605,0.9985757,0.00028546233,0.0009440097,0.00011759992,0.000003423193],"about_ca_topic_score_codex":0.015285563,"about_ca_topic_score_gemma":0.019323563,"teacher_disagreement_score":0.015285563,"about_ca_system_score_codex":0.0008630333,"about_ca_system_score_gemma":0.0013033083,"threshold_uncertainty_score":0.030393183},"labels":[],"label_agreement":null},{"id":"W3096808947","doi":"10.1007/978-3-030-58558-7_14","title":"Deep Feedback Inverse Problem Solver","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Leverage (statistics); Solver; Inverse problem; Range (aeronautics); Inverse kinematics; Inverse; Process (computing); Key (lock); Artificial intelligence; Artificial neural network; Algorithm; Mathematical optimization; Machine learning; Mathematics; Robot","score_opus":0.017409899330397376,"score_gpt":0.24759462089680742,"score_spread":0.23018472156641004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096808947","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.0015930325,0.00019905595,0.98034453,0.00021700661,0.00015741472,0.000039415205,0.00019610224,0.002526107,0.014727278],"genre_scores_gemma":[0.1400406,0.00045825238,0.7788494,0.0005379293,0.00022243452,0.00027553836,0.0013859295,0.0013301775,0.07689969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999765,0.000024788713,0.000008957489,0.00006944268,0.00009778046,0.000034090397],"domain_scores_gemma":[0.9997514,0.00009318635,0.000013236237,0.000043747932,0.00007862381,0.000019744799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029163074,0.0010937753,0.0010256051,0.00032997524,0.0003475704,0.001101557,0.0011833282,0.0016703288,0.036274627],"category_scores_gemma":[0.0010828741,0.00054894446,0.00070881,0.00034646725,0.0004417024,0.00091257156,0.0020368057,0.0023388425,0.010553491],"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.00018013458,0.00013195428,0.00019718552,0.0004191319,0.00007423617,0.00020771679,0.00008088565,0.22796622,0.013089055,0.055697214,0.054153506,0.6478028],"study_design_scores_gemma":[0.00004020953,0.00005117646,0.000059644142,0.00003879564,0.000016648284,0.000107651955,0.000028053995,0.9491397,0.0048710806,0.027619023,0.018016053,0.000011846477],"about_ca_topic_score_codex":0.0027496035,"about_ca_topic_score_gemma":0.0059716683,"teacher_disagreement_score":0.036274627,"about_ca_system_score_codex":0.0003800267,"about_ca_system_score_gemma":0.0011841689,"threshold_uncertainty_score":0.121350765},"labels":[],"label_agreement":null},{"id":"W3096884914","doi":"10.1007/978-3-030-65411-5_24","title":"Integral Cryptanalysis of Reduced-Round Tweakable TWINE","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Computer science; Cryptanalysis; Computer security; Cryptography","score_opus":0.023477293588727122,"score_gpt":0.27317043801397156,"score_spread":0.24969314442524443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096884914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24317193,0.0015348124,0.6255484,0.001946315,0.00076067826,0.00016230378,0.00023243889,0.0016424839,0.12500066],"genre_scores_gemma":[0.86265194,0.00068453635,0.066691644,0.00028133826,0.00015573483,0.00006156481,0.0001557182,0.00036507822,0.06895248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905664,0.00015444086,0.00003775521,0.000126196,0.00040870317,0.00021623622],"domain_scores_gemma":[0.99926907,0.00025483372,0.00004729395,0.00027402915,0.0001062149,0.00004851033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663939,0.0006975114,0.00081288617,0.0008786957,0.00081639725,0.0021206825,0.0009267764,0.0012285046,0.012843213],"category_scores_gemma":[0.0027168298,0.00044819593,0.00076586904,0.0009153046,0.0019661607,0.0038331172,0.0026595944,0.0028010241,0.002806776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006331643,0.00008010616,0.0004142382,0.00015983652,0.00005506052,0.00038161504,0.0003890547,0.010399507,0.024671199,0.8887434,0.0037817995,0.07029101],"study_design_scores_gemma":[0.00009079228,0.00030593938,0.0007682405,0.00013554872,0.00009314404,0.001538344,0.00019195172,0.11453144,0.081649944,0.76176035,0.03882843,0.00010595134],"about_ca_topic_score_codex":0.00022435305,"about_ca_topic_score_gemma":0.00028563285,"teacher_disagreement_score":0.012843213,"about_ca_system_score_codex":0.000870158,"about_ca_system_score_gemma":0.00066021713,"threshold_uncertainty_score":0.042964876},"labels":[],"label_agreement":null},{"id":"W3097362767","doi":"10.1007/978-3-030-60117-1_19","title":"Single-Actuator Simultaneous Haptic Rendering for Multiple Vital Signs","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Healthcare Technology and Patient Monitoring","field":"Medicine","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; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Actuator; Haptic technology; Computer science; ALARM; Rendering (computer graphics); Perception; Vital signs; Computer vision; Artificial intelligence; Human–computer interaction; Simulation; Engineering; Psychology; Medicine; Electrical engineering","score_opus":0.05611778607526313,"score_gpt":0.29087804080602064,"score_spread":0.2347602547307575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097362767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021929977,0.0011063563,0.9593432,0.00015163494,0.0004206173,0.000058863217,0.0001556244,0.0029750778,0.01385862],"genre_scores_gemma":[0.516822,0.0018796292,0.42993143,0.00016476477,0.00027438375,0.0001053415,0.00033559327,0.00087090937,0.049615934],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997075,0.000033374,0.000011069503,0.000029823026,0.00019088601,0.000027278373],"domain_scores_gemma":[0.99963284,0.0002247784,0.000019029478,0.000047141908,0.000050402017,0.000025747644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029371903,0.00077665667,0.00045442572,0.00023940868,0.00016590253,0.000955864,0.0008122037,0.00076220126,0.014829726],"category_scores_gemma":[0.0009292969,0.00045278305,0.00049679424,0.0002346033,0.0002961962,0.0007722769,0.0012461399,0.0007680228,0.0018545127],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066026504,0.00008871573,0.00029237187,0.0006685097,0.000060102186,0.00092583103,0.00047516802,0.01987276,0.5864905,0.009690701,0.0110299485,0.3697451],"study_design_scores_gemma":[0.00018369479,0.0008781249,0.0029603022,0.0002381476,0.000103884806,0.0047328006,0.00024942213,0.6568294,0.24660563,0.011718845,0.07532462,0.00017514077],"about_ca_topic_score_codex":0.00047025635,"about_ca_topic_score_gemma":0.00084185187,"teacher_disagreement_score":0.014829726,"about_ca_system_score_codex":0.0001720422,"about_ca_system_score_gemma":0.00023449147,"threshold_uncertainty_score":0.049610376},"labels":[],"label_agreement":null},{"id":"W3097373299","doi":"10.1007/978-3-030-61746-2_3","title":"Fast and Cost-Efficient Virtualized Network Function Placement Algorithm in Wireless Multi-hop Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","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":"Carleton University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Heuristic; Shortest path problem; Wireless network; Computer network; Software deployment; Mathematical optimization; Wireless; Graph","score_opus":0.017335451724067613,"score_gpt":0.23376874344798734,"score_spread":0.21643329172391973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097373299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015925435,0.0004165677,0.9803082,0.00010598645,0.00012981672,0.000062522115,0.000057645382,0.00094065105,0.0020532054],"genre_scores_gemma":[0.39303002,0.00041997226,0.60147846,0.000092296235,0.000072606956,0.00019075007,0.00029484052,0.0001581737,0.0042627966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994586,0.00014234961,0.000024461104,0.000079326346,0.0001931936,0.000102075646],"domain_scores_gemma":[0.99948007,0.00020442091,0.000041833613,0.00008121042,0.00015530329,0.000037221962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057164056,0.000844741,0.0012181973,0.00065789215,0.0006927714,0.0009429096,0.0016695268,0.0006502015,0.0023048304],"category_scores_gemma":[0.0013760778,0.00040177468,0.00044776444,0.0010727119,0.00039162568,0.0011776631,0.0011522159,0.0008514402,0.00047952708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033373444,0.000097636745,0.00038267733,0.000104151564,0.000039493003,0.00006780808,0.000064269974,0.681556,0.009469386,0.0150073515,0.0070226965,0.2858548],"study_design_scores_gemma":[0.000011437999,0.00003962063,0.00007249688,0.0000038074686,0.000004806023,0.000028716979,0.000011824118,0.99530584,0.0011696978,0.0025768718,0.0007701163,0.000004681011],"about_ca_topic_score_codex":0.0037031022,"about_ca_topic_score_gemma":0.0038889642,"teacher_disagreement_score":0.0037031022,"about_ca_system_score_codex":0.0010788286,"about_ca_system_score_gemma":0.0015866396,"threshold_uncertainty_score":0.007827461},"labels":[],"label_agreement":null},{"id":"W3097396506","doi":"10.1007/978-3-030-60117-1_15","title":"Automatic Page-Turner for Pianists with Wearable Motion Detector","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"MIDI; Computer science; sync; Wearable computer; Numbering; Notation; Computer graphics (images); Measure (data warehouse); Detector; Programming language; Arithmetic; Embedded system; Data mining; Telecommunications","score_opus":0.017224008317665136,"score_gpt":0.22818364089313684,"score_spread":0.2109596325754717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097396506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09966988,0.0021182706,0.8330273,0.0003029435,0.00089709996,0.00045973755,0.0025571247,0.04673902,0.014228601],"genre_scores_gemma":[0.33466163,0.001065859,0.6241569,0.0003839076,0.0002853566,0.00031461753,0.004288108,0.0016410516,0.03320256],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997856,0.000017318875,0.000009236556,0.00007074978,0.000075021206,0.000042238687],"domain_scores_gemma":[0.99975365,0.000038309754,0.000014885496,0.00004959888,0.00009791971,0.000045610737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024127513,0.0010603034,0.0008750682,0.0013253707,0.00051605655,0.00067372166,0.0009101376,0.000928979,0.02324835],"category_scores_gemma":[0.0006081069,0.0004816738,0.0005022762,0.00069842103,0.00015705422,0.00067067676,0.00092992,0.000587501,0.011055632],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012512937,0.00012272115,0.0031870885,0.00027960693,0.000058451114,0.00027906668,0.00007664453,0.00083010003,0.1845255,0.0006366088,0.019398987,0.78935397],"study_design_scores_gemma":[0.00043438416,0.0012230509,0.049529076,0.00020511831,0.00040383087,0.003978329,0.0004237555,0.3135611,0.5372958,0.004500357,0.08822203,0.00022306443],"about_ca_topic_score_codex":0.0008924132,"about_ca_topic_score_gemma":0.0032896318,"teacher_disagreement_score":0.02324835,"about_ca_system_score_codex":0.00020921078,"about_ca_system_score_gemma":0.0004289199,"threshold_uncertainty_score":0.07777345},"labels":[],"label_agreement":null},{"id":"W3097505059","doi":"10.1007/978-3-030-60799-9_20","title":"Noise Robust Illumination Invariant Face Recognition via Contourlet Transform in Logarithm Domain","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Contourlet; Invariant (physics); Artificial intelligence; Logarithm; Computer science; Facial recognition system; Pattern recognition (psychology); Face (sociological concept); Computer vision; Classifier (UML); Mathematics; Wavelet transform; Wavelet; Mathematical analysis","score_opus":0.021977339834546177,"score_gpt":0.22294847466531717,"score_spread":0.200971134830771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097505059","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.02537648,0.00044986224,0.9687487,0.00008833258,0.00009028919,0.000025103554,0.00008222367,0.0009922397,0.004146731],"genre_scores_gemma":[0.4059362,0.0011875044,0.5687663,0.00022145697,0.00014320902,0.00007924706,0.00077955826,0.00034734706,0.022539182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997956,0.00002238577,0.000007347964,0.000041281935,0.000115693285,0.00001760088],"domain_scores_gemma":[0.99985313,0.000038458864,0.000014473565,0.000043617278,0.000041971853,0.000008345272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019699222,0.00031565863,0.00044396354,0.00032564532,0.00014033954,0.00055510574,0.0005639577,0.0004096155,0.0026359402],"category_scores_gemma":[0.0005421403,0.0001730428,0.0003930662,0.00044007695,0.00024439028,0.0006679876,0.00049474044,0.0005804064,0.002070021],"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.00020882826,0.00010557256,0.0004699348,0.00007399457,0.000028703247,0.00014294896,0.000033412103,0.0158577,0.33959123,0.0060636066,0.0033203666,0.63410366],"study_design_scores_gemma":[0.000013680648,0.0001652391,0.0023649845,0.00001927653,0.000039617276,0.0008183366,0.000029335562,0.7261621,0.2579065,0.005061121,0.007390591,0.000029253848],"about_ca_topic_score_codex":0.0003552609,"about_ca_topic_score_gemma":0.0004351344,"teacher_disagreement_score":0.0026359402,"about_ca_system_score_codex":0.00017719872,"about_ca_system_score_gemma":0.00018403286,"threshold_uncertainty_score":0.00881803},"labels":[],"label_agreement":null},{"id":"W3097511258","doi":"10.1007/978-3-030-63000-3_6","title":"Quantum Candies and Quantum Cryptography","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum cryptography; BB84; Computer science; Quantum key distribution; Quantum information science; Quantum information; Quantum network; Theoretical computer science; Quantum entanglement; Quantum technology; Quantum computer; Cryptography; Quantum; Open quantum system; Quantum mechanics; Computer security; Physics","score_opus":0.013879806109036892,"score_gpt":0.2366027005689923,"score_spread":0.2227228944599554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097511258","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.0068196813,0.04596705,0.04947318,0.008064476,0.0033018405,0.000045223995,0.000096338474,0.0001741861,0.88605803],"genre_scores_gemma":[0.3010172,0.0380044,0.02137675,0.002200562,0.0073232823,0.00013291043,0.00015791075,0.0002322431,0.62955487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995509,0.00012299092,0.00001218012,0.000044462617,0.00022501325,0.00004454742],"domain_scores_gemma":[0.9994048,0.00032146866,0.000041560226,0.00012769335,0.00006556669,0.00003893124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062847935,0.0007415281,0.00087527995,0.0013311445,0.0016871113,0.0033689283,0.0009388475,0.0017866183,0.020496404],"category_scores_gemma":[0.0019725808,0.0005183998,0.00042127518,0.0019835664,0.0049222093,0.006480679,0.0015046175,0.004353496,0.004127399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004565653,0.0000067031374,0.000008036343,0.000024985637,0.0000022427746,0.0000057807915,0.000022335376,0.00033386712,0.00007744673,0.9871651,0.0047958945,0.0075530433],"study_design_scores_gemma":[0.0000026368436,0.0000033657373,0.000022342576,0.000017384195,0.0000012460475,0.00002564696,0.000010325246,0.00057937653,0.000082315215,0.9676303,0.031620786,0.000004298989],"about_ca_topic_score_codex":0.000542164,"about_ca_topic_score_gemma":0.0006590673,"teacher_disagreement_score":0.020496404,"about_ca_system_score_codex":0.001834157,"about_ca_system_score_gemma":0.00084941526,"threshold_uncertainty_score":0.068567276},"labels":[],"label_agreement":null},{"id":"W3097831276","doi":"10.1007/978-3-030-62516-0_18","title":"When the Fourth Layer Meets the Fourth Wall: The Case for Critical Game Retellings","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"","keywords":"Narrative; Scrutiny; Computer science; Rendering (computer graphics); Game design; Game art design; Video game; Epistemology; Aesthetics; Multimedia; Game Developer; Artificial intelligence; Literature; Art; Law; Philosophy; Political science","score_opus":0.04233824779545186,"score_gpt":0.2986963909350258,"score_spread":0.25635814313957395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097831276","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11968136,0.001442555,0.049328197,0.061188653,0.0014388872,0.00022904898,0.000104190396,0.00057894795,0.7660082],"genre_scores_gemma":[0.94553375,0.000327035,0.01089103,0.0034327963,0.00023169121,0.00013715669,0.00006120231,0.0006197325,0.038765546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9849049,0.008614685,0.00045671142,0.0014957985,0.0027920913,0.0017357698],"domain_scores_gemma":[0.95410657,0.03140301,0.0022556295,0.004548023,0.00383152,0.0038551793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012036206,0.00074860384,0.0006026541,0.0020933482,0.011642214,0.024443684,0.0036376626,0.010439583,0.01818999],"category_scores_gemma":[0.0736243,0.0009650688,0.00044390364,0.0011632434,0.023852708,0.027843561,0.0114389295,0.010111474,0.0053666243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019030804,0.00006355195,0.0014072151,0.0001791455,0.000020633397,0.003884697,0.28152937,0.00022418862,0.0015817152,0.6501514,0.02412696,0.036640875],"study_design_scores_gemma":[0.000044652727,0.000055211895,0.0010023211,0.001073442,0.000038968832,0.0030523564,0.23482594,0.0020622632,0.0019443422,0.46037355,0.29540986,0.00011716516],"about_ca_topic_score_codex":0.0050838464,"about_ca_topic_score_gemma":0.0066665597,"teacher_disagreement_score":0.024443684,"about_ca_system_score_codex":0.0035959953,"about_ca_system_score_gemma":0.0045983465,"threshold_uncertainty_score":0.0636543},"labels":[],"label_agreement":null},{"id":"W3097879951","doi":"10.1007/978-3-030-62522-1_38","title":"Towards a Framework for Empirical Measurement of Conceptualization Qualities","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"York University","funders":"","keywords":"Conceptualization; Computer science; Domain (mathematical analysis); Set (abstract data type); Modeling language; Empirical research; Population; Human–computer interaction; Data science; Natural language processing; Artificial intelligence; Software engineering; Programming language; Epistemology; Software; Mathematics","score_opus":0.15042673598029935,"score_gpt":0.3588409112188476,"score_spread":0.20841417523854824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097879951","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.060049754,0.0012412443,0.87020653,0.0064414777,0.0001009768,0.0013174198,0.00096295186,0.0005014837,0.059178118],"genre_scores_gemma":[0.53191626,0.0003867533,0.46196708,0.0003812694,0.000037082664,0.0032115737,0.0009958113,0.00011944784,0.0009847289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94785064,0.035018086,0.004283128,0.0037484837,0.008073384,0.001026311],"domain_scores_gemma":[0.8307372,0.114371374,0.012051024,0.019489866,0.021189878,0.0021605964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05870682,0.001228505,0.0011383416,0.012534859,0.0027828908,0.014450271,0.0040150178,0.0028709348,0.005980177],"category_scores_gemma":[0.15973568,0.0011011416,0.0015352557,0.012220012,0.011358384,0.024838725,0.0076646456,0.0056684,0.00079716585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036657155,0.0002090827,0.012797217,0.00029840093,0.00006351573,0.000050319013,0.008401738,0.0010009197,0.00096925494,0.9128402,0.0019475794,0.06138525],"study_design_scores_gemma":[0.000044010547,0.00011322107,0.021860374,0.00070082303,0.00006698434,0.00015498554,0.01625369,0.0140456585,0.001057787,0.932516,0.013116299,0.000070230264],"about_ca_topic_score_codex":0.0056566996,"about_ca_topic_score_gemma":0.004482872,"teacher_disagreement_score":0.05870682,"about_ca_system_score_codex":0.0072777555,"about_ca_system_score_gemma":0.0077237724,"threshold_uncertainty_score":0.31047505},"labels":[],"label_agreement":null},{"id":"W3098985043","doi":"10.1007/978-3-319-14130-5_2","title":"Recovering Architectural Variability of a Family of Product Variants","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université de Montréal","funders":"","keywords":"Software product line; Reuse; Product (mathematics); Software; Domain (mathematical analysis); Architectural pattern; Set (abstract data type); Software development; Software architecture","score_opus":0.03303828813212605,"score_gpt":0.2712042318759455,"score_spread":0.23816594374381944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098985043","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.4962469,0.00039283937,0.4994884,0.00007366375,0.00002757942,0.000028220336,0.0004265476,0.001806099,0.0015098396],"genre_scores_gemma":[0.894262,0.00013482478,0.103663415,0.000015673402,0.00001439374,0.000021291871,0.0006725494,0.00033475755,0.0008809604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990927,0.0001253315,0.00004299806,0.0002815471,0.0003945154,0.00006292622],"domain_scores_gemma":[0.9965186,0.0013429086,0.00050773245,0.0010387991,0.0004948936,0.000097029115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071482087,0.00079825515,0.0005979953,0.0014420424,0.0003252113,0.00091432745,0.0008390081,0.00082218106,0.0007215171],"category_scores_gemma":[0.0043928097,0.0005758634,0.0010380895,0.0013518757,0.0004800052,0.0010028129,0.000707558,0.0010478782,0.0003043529],"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.0009995543,0.00017744629,0.043514445,0.00026497437,0.00030818782,0.0025463996,0.00070127274,0.34331843,0.116667785,0.020756561,0.0031838042,0.46756116],"study_design_scores_gemma":[0.000017185412,0.00016952415,0.008912653,0.000024405903,0.00008586062,0.0009795739,0.00013009598,0.95782363,0.012641776,0.016720397,0.0024632441,0.00003164017],"about_ca_topic_score_codex":0.0015158658,"about_ca_topic_score_gemma":0.0013061097,"teacher_disagreement_score":0.0015158658,"about_ca_system_score_codex":0.00030812592,"about_ca_system_score_gemma":0.00035458762,"threshold_uncertainty_score":0.003780365},"labels":[],"label_agreement":null},{"id":"W309977538","doi":"10.1007/978-3-319-16549-3_14","title":"An Experimental Evaluation of Multi-objective Evolutionary Algorithms for Detecting Critical Nodes in Complex Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Brock University","funders":"","keywords":"Computer science; Evolutionary algorithm; Pairwise comparison; Benchmark (surveying); Algorithm; Complex network; Task (project management); Node (physics); Graph; Theoretical computer science; Artificial intelligence","score_opus":0.08116319810565686,"score_gpt":0.37909890846291655,"score_spread":0.2979357103572597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W309977538","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.89258564,0.000916205,0.10014671,0.00032201223,0.00019777451,0.00025457577,0.0003972392,0.0008269462,0.0043529035],"genre_scores_gemma":[0.9190787,0.00016505404,0.07866473,0.00005729985,0.000019668369,0.000105446255,0.00044718428,0.00008716419,0.0013747179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999064,0.00040296,0.00006064901,0.0001783235,0.00021192743,0.000082150655],"domain_scores_gemma":[0.9860341,0.011244893,0.0005649643,0.0007579716,0.001142413,0.00025570553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030581073,0.0012561567,0.0008473965,0.0014921401,0.0004842639,0.00072642486,0.0015856049,0.001455589,0.0017507117],"category_scores_gemma":[0.011762435,0.0003376981,0.00046307742,0.00093389413,0.00063919934,0.0011330718,0.0006825849,0.0008319942,0.00022457346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019820316,0.0016189347,0.004440311,0.00055605714,0.0002497508,0.00012317087,0.00012793449,0.8758388,0.010970213,0.0031979533,0.0015207041,0.09937412],"study_design_scores_gemma":[0.00007148862,0.0003918047,0.0009099825,0.00001288053,0.000027396483,0.000029440165,0.00003673264,0.99417925,0.0034391677,0.0007764247,0.00011761677,0.000007699902],"about_ca_topic_score_codex":0.0042539043,"about_ca_topic_score_gemma":0.0038487036,"teacher_disagreement_score":0.0042539043,"about_ca_system_score_codex":0.000866712,"about_ca_system_score_gemma":0.00063410366,"threshold_uncertainty_score":0.016173005},"labels":[],"label_agreement":null},{"id":"W3099960508","doi":"10.1007/978-3-030-62536-8_8","title":"Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallelism (grammar); Automaton; Finite-state machine; Parallel computing; Theoretical computer science; Algorithm","score_opus":0.019800135212385092,"score_gpt":0.240125828284948,"score_spread":0.2203256930725629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099960508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04677243,0.0007937482,0.9330432,0.00047649065,0.00014412028,0.00004436261,0.00005255775,0.0005029196,0.018170083],"genre_scores_gemma":[0.77530867,0.00076000136,0.21411036,0.00016806678,0.0002573,0.00016370292,0.00012850636,0.00025291578,0.008850478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868757,0.00057369896,0.00009677957,0.00021919774,0.00034197458,0.00008080316],"domain_scores_gemma":[0.9926945,0.0055797165,0.00019601306,0.0010335888,0.00033056724,0.00016573591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909226,0.00063712324,0.00087485067,0.0004921228,0.0007452009,0.0015299196,0.0013764604,0.00085624127,0.0031118724],"category_scores_gemma":[0.008083592,0.00077530567,0.0008869455,0.0007908477,0.0020666872,0.0070346612,0.0029577974,0.0026220544,0.0005084727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002151881,0.00009742098,0.0006219798,0.00024104636,0.00004502422,0.00025284413,0.0004053815,0.055498686,0.013707564,0.83840513,0.0013684393,0.08914119],"study_design_scores_gemma":[0.000015298887,0.000029451267,0.00006686544,0.0000127657895,0.000017164342,0.00007656326,0.000017252423,0.109667376,0.0025637264,0.8854247,0.0020980155,0.000010948218],"about_ca_topic_score_codex":0.00036191478,"about_ca_topic_score_gemma":0.0006128784,"teacher_disagreement_score":0.0031118724,"about_ca_system_score_codex":0.0006447558,"about_ca_system_score_gemma":0.00076420826,"threshold_uncertainty_score":0.010410249},"labels":[],"label_agreement":null},{"id":"W3100107676","doi":"10.1007/978-3-030-62056-1_4","title":"HRI Physio Lib: A Software Framework to Support the Integration of Physiological Adaptation in HRI","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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 Waterloo","funders":"","keywords":"Computer science; Popularity; Human–computer interaction; Modular design; Implementation; Robot; Reusability; Adaptation (eye); Software; Software framework; Artificial intelligence; State (computer science); Software engineering; Software system; Component-based software engineering; Psychology","score_opus":0.07484564867918048,"score_gpt":0.3269610400712718,"score_spread":0.2521153913920913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100107676","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029586798,0.0003200568,0.48142567,0.00013991543,0.00019290476,0.00025246976,0.0057036513,0.50193053,0.0070762686],"genre_scores_gemma":[0.1662742,0.0014536338,0.53354126,0.002197068,0.0005566521,0.0032373765,0.02906146,0.19235487,0.071323566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995652,0.000041348063,0.000038181886,0.00011972642,0.00017977848,0.000055846696],"domain_scores_gemma":[0.99909484,0.00042133895,0.000058688616,0.00018666293,0.000137642,0.00010082211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011378278,0.0015711854,0.0011396381,0.0009987225,0.00039137187,0.0016895385,0.0024842387,0.0010793761,0.062053774],"category_scores_gemma":[0.0026057642,0.001155751,0.00088276283,0.0007760633,0.0004449153,0.0014196789,0.002478342,0.0017730868,0.02496815],"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.0016892338,0.00033320056,0.0033813138,0.0014793816,0.00043734774,0.0006366534,0.0008065742,0.009866961,0.043762725,0.0100090755,0.3189227,0.6086749],"study_design_scores_gemma":[0.00096576504,0.0004266789,0.01600426,0.00051940314,0.0004632024,0.0018680029,0.0001847984,0.39875275,0.15682958,0.036487613,0.38683233,0.000665662],"about_ca_topic_score_codex":0.0019893348,"about_ca_topic_score_gemma":0.0021826946,"teacher_disagreement_score":0.062053774,"about_ca_system_score_codex":0.00041143724,"about_ca_system_score_gemma":0.00066933135,"threshold_uncertainty_score":0.20759052},"labels":[],"label_agreement":null},{"id":"W3101417881","doi":"10.1007/978-3-030-38919-2_10","title":"Burning Two Worlds","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.02539464190771653,"score_gpt":0.29514440310651924,"score_spread":0.26974976119880273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101417881","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.0031361475,0.0022593024,0.0120844245,0.009763678,0.0017970658,0.00002158909,0.000077486,0.00012015606,0.97074014],"genre_scores_gemma":[0.18324566,0.0031560534,0.009303568,0.0059519387,0.00089838344,0.00015449236,0.00025524714,0.0006435771,0.79639107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903154,0.00032262263,0.000020939697,0.00020211072,0.00023524875,0.00018758044],"domain_scores_gemma":[0.9991517,0.00025597875,0.00003541224,0.0002676177,0.00010553908,0.00018382694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011242727,0.00078244123,0.00069422374,0.0012379144,0.0059170625,0.0067353523,0.0014544035,0.0028722985,0.09839005],"category_scores_gemma":[0.0037841592,0.00049350265,0.00062828534,0.0009196597,0.011326167,0.014436918,0.007214561,0.007172408,0.019531129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012655819,0.0000069869275,0.000018679346,0.000015949294,0.0000021344028,0.00002027324,0.00058134354,0.000050038074,0.000062992855,0.9722234,0.018627295,0.008378283],"study_design_scores_gemma":[0.000006177429,0.000007483391,0.000027709037,0.00008146453,0.0000030576468,0.00006391859,0.000882839,0.00015498327,0.000110666195,0.7448196,0.25383574,0.000006397619],"about_ca_topic_score_codex":0.0011561298,"about_ca_topic_score_gemma":0.0021114051,"teacher_disagreement_score":0.09839005,"about_ca_system_score_codex":0.0020126107,"about_ca_system_score_gemma":0.001238763,"threshold_uncertainty_score":0.32914746},"labels":[],"label_agreement":null},{"id":"W3102247173","doi":"10.1007/978-3-319-06605-9_16","title":"NLPMM: A Next Location Predictor with Markov Modeling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Markov chain; Trajectory; Markov model; Hidden Markov model; Artificial intelligence; Data mining; Markov process; Factor (programming language); Machine learning; Statistics; Mathematics","score_opus":0.019829909991617326,"score_gpt":0.25630732754422564,"score_spread":0.23647741755260832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102247173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006942555,0.00043952087,0.97614753,0.00024569873,0.00027418273,0.00011303503,0.0021560322,0.012576793,0.0011045919],"genre_scores_gemma":[0.13576595,0.0003849332,0.84805703,0.00032950792,0.0002844008,0.00048446565,0.007371374,0.001116708,0.0062057003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00021249324,0.00005730053,0.00024864636,0.00019999486,0.00008629518],"domain_scores_gemma":[0.9981206,0.0011499065,0.000078912955,0.0002816511,0.0002741416,0.00009476484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019447644,0.0010261202,0.0019603886,0.0011797813,0.00085951714,0.0011411296,0.0035647103,0.0015810513,0.011570114],"category_scores_gemma":[0.0075185685,0.0012273098,0.0015641691,0.0014413827,0.0003819591,0.0024865498,0.0024571128,0.0028165262,0.005048594],"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.00095315935,0.000428244,0.0056413584,0.0002979211,0.00034173208,0.00019866029,0.00010510186,0.39112738,0.0016248213,0.014057398,0.049102824,0.5361213],"study_design_scores_gemma":[0.00002625329,0.000017281023,0.00013721085,0.000011157286,0.000014773012,0.000017617222,0.0000057396755,0.992851,0.00040975472,0.0049584894,0.0015417333,0.000008953178],"about_ca_topic_score_codex":0.018515192,"about_ca_topic_score_gemma":0.024905402,"teacher_disagreement_score":0.018515192,"about_ca_system_score_codex":0.0007729395,"about_ca_system_score_gemma":0.0024753038,"threshold_uncertainty_score":0.038705945},"labels":[],"label_agreement":null},{"id":"W3103319788","doi":"10.1007/978-3-030-62056-1_45","title":"Using AI-Enhanced Social Robots to Improve Children’s Healthcare Experiences","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Pediatric Pain Management Techniques","field":"Medicine","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":"Toronto Metropolitan University; McMaster University; Izaak Walton Killam Health Centre; Hospital for Sick Children; University of Alberta","funders":"","keywords":"Robot; Computer science; Social robot; Flexibility (engineering); Teleoperation; Health care; Artificial intelligence; Robustness (evolution); Robotics; Psychological intervention; Human–computer interaction; Nursing; Mobile robot; Medicine; Robot control","score_opus":0.028000205819774613,"score_gpt":0.31824463171045575,"score_spread":0.2902444258906811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103319788","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.48575106,0.004998837,0.17009471,0.0054612574,0.0013257037,0.0003933887,0.00062360713,0.004106261,0.3272451],"genre_scores_gemma":[0.75858593,0.0024161781,0.15893717,0.00067745906,0.0001611592,0.00048719544,0.0004915427,0.00032261346,0.077920765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996927,0.00012497693,0.000008855158,0.000042176238,0.00008723773,0.000044181987],"domain_scores_gemma":[0.99949074,0.00029339673,0.000041929798,0.00003178706,0.00004861804,0.00009344625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043024917,0.0004778504,0.00013904892,0.00025165136,0.0004772809,0.001065097,0.0007300708,0.00047993247,0.011576746],"category_scores_gemma":[0.0013601714,0.000107031374,0.00033666575,0.00018995472,0.0006005269,0.0009925767,0.0012381095,0.000754236,0.0017423292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000336711,0.0014754211,0.007076169,0.0012926972,0.00008267035,0.0010659338,0.024434019,0.006719091,0.03874211,0.028557252,0.0686012,0.82161677],"study_design_scores_gemma":[0.00019320758,0.002598281,0.05130656,0.0011978452,0.00020515379,0.003732613,0.032585345,0.040641434,0.04863295,0.030061817,0.78856975,0.00027499173],"about_ca_topic_score_codex":0.00061517686,"about_ca_topic_score_gemma":0.0015149083,"teacher_disagreement_score":0.011576746,"about_ca_system_score_codex":0.00037692362,"about_ca_system_score_gemma":0.0004233128,"threshold_uncertainty_score":0.03872806},"labels":[],"label_agreement":null},{"id":"W3103645939","doi":"10.1007/978-3-030-83508-8_44","title":"Routing on Heavy-Path WSPD-Spanners","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Mathematics; Routing algorithm; Bounded function; Graph; Discrete mathematics; Static routing; Computer science; Computer network; Distributed computing; Routing protocol","score_opus":0.02440027243317933,"score_gpt":0.24931211597163747,"score_spread":0.22491184353845814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103645939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29296336,0.0007239924,0.61338127,0.0006249066,0.00038199848,0.00033413357,0.001957577,0.0020753248,0.08755742],"genre_scores_gemma":[0.7148985,0.0012358907,0.21971819,0.00025107872,0.00014814042,0.00021139925,0.002378795,0.00049629743,0.06066169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972063,0.000039473227,0.000023880883,0.00007364976,0.0000713301,0.00007099979],"domain_scores_gemma":[0.9993711,0.00014974918,0.00006564394,0.0002096619,0.0001019525,0.00010188524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030582672,0.0006306376,0.00065005716,0.00085091585,0.00073851756,0.0014569202,0.001208757,0.00054477947,0.011985343],"category_scores_gemma":[0.0011340441,0.00037370477,0.00043657588,0.0017070189,0.00049218326,0.002604181,0.0020889433,0.0009465727,0.0019397524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006528331,0.00020720379,0.0010267828,0.00053316413,0.000091431924,0.0005810398,0.0003294492,0.16323611,0.033279076,0.52944916,0.017813634,0.25280008],"study_design_scores_gemma":[0.0000537474,0.0002421466,0.0005783782,0.00008481739,0.00004431601,0.0004308393,0.00020043534,0.29426387,0.011815457,0.66625524,0.025997017,0.000033685013],"about_ca_topic_score_codex":0.000882125,"about_ca_topic_score_gemma":0.0014978659,"teacher_disagreement_score":0.011985343,"about_ca_system_score_codex":0.0006401916,"about_ca_system_score_gemma":0.00044375873,"threshold_uncertainty_score":0.040094912},"labels":[],"label_agreement":null},{"id":"W3103675051","doi":"10.1007/978-3-030-63461-2_21","title":"Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Leverage (statistics); Solver; Computer science; Mathematical optimization; Boolean data type; Polynomial; Boolean satisfiability problem; True quantified Boolean formula; Optimization problem; Constraint (computer-aided design); Constrained optimization problem; Function (biology); Mathematics; Applied mathematics; Algorithm; Theoretical computer science","score_opus":0.010560714340691654,"score_gpt":0.22565879945845727,"score_spread":0.21509808511776563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103675051","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.0049457927,0.00044142487,0.9293309,0.0012878311,0.00037016967,0.00015900678,0.00074957294,0.0008270058,0.06188837],"genre_scores_gemma":[0.16937515,0.0017599885,0.7605519,0.0011608287,0.00060159864,0.0004995721,0.0027398514,0.00087553455,0.062435526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923146,0.00024543083,0.000036402256,0.00015357805,0.00024220551,0.00009090575],"domain_scores_gemma":[0.99922466,0.00045356315,0.000034558332,0.00013432602,0.00012713586,0.00002583227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007199267,0.0008498921,0.00077159057,0.0004985107,0.00052439363,0.0019310649,0.0015063437,0.0007525298,0.023230508],"category_scores_gemma":[0.0024918707,0.0005052735,0.0013658721,0.001180006,0.0011397093,0.0027069873,0.0015761934,0.0031013093,0.004895602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010702932,0.00012436048,0.00011500104,0.00036037373,0.000044797707,0.00014048292,0.0001316851,0.08532396,0.0038849998,0.74195766,0.03692018,0.13088953],"study_design_scores_gemma":[0.000099919154,0.000084498366,0.00020174966,0.00014276714,0.000050749593,0.00012770205,0.000085845066,0.30324903,0.004506532,0.59411114,0.097312614,0.000027500497],"about_ca_topic_score_codex":0.0036163004,"about_ca_topic_score_gemma":0.005269941,"teacher_disagreement_score":0.023230508,"about_ca_system_score_codex":0.0010414614,"about_ca_system_score_gemma":0.0019381599,"threshold_uncertainty_score":0.07771385},"labels":[],"label_agreement":null},{"id":"W3104057576","doi":"10.1007/978-3-030-58571-6_20","title":"Learning Pairwise Inter-plane Relations for Piecewise Planar Reconstruction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Piecewise; Convolutional neural network; Planar; Plane (geometry); Segmentation; Artificial intelligence; Artificial neural network; Pairwise comparison; Algorithm; Computer vision; Pattern recognition (psychology); Mathematics; Geometry; Computer graphics (images)","score_opus":0.03344542217011895,"score_gpt":0.2487633015323969,"score_spread":0.21531787936227795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104057576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010787571,0.00033038165,0.986403,0.000109875284,0.000024944735,0.000035053134,0.00025246973,0.0010022714,0.0010544235],"genre_scores_gemma":[0.25588006,0.0011454667,0.7345772,0.00018870042,0.00012765346,0.00015781583,0.0028873258,0.0006087201,0.004427057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990466,0.00020289148,0.000046045036,0.00033277133,0.00026970368,0.000101852056],"domain_scores_gemma":[0.9978777,0.0012062734,0.00018547736,0.00048468597,0.00016896332,0.000076915734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083798624,0.0014238579,0.0018327195,0.0012986591,0.00046456896,0.0012328193,0.0030068178,0.002052952,0.006209372],"category_scores_gemma":[0.005041801,0.0011699165,0.0014956468,0.0025035453,0.0010308812,0.0028583885,0.002637129,0.0031857162,0.0022633453],"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.00037925233,0.00011706412,0.00075907004,0.00038018406,0.00010060241,0.00012768121,0.00014759589,0.26949558,0.013644564,0.018929223,0.007985219,0.6879339],"study_design_scores_gemma":[0.000013550609,0.000074487565,0.00021508908,0.000024650597,0.000021083084,0.0001378826,0.00004987038,0.9723299,0.003427502,0.022081671,0.001609636,0.0000146404445],"about_ca_topic_score_codex":0.0024748917,"about_ca_topic_score_gemma":0.003290597,"teacher_disagreement_score":0.006209372,"about_ca_system_score_codex":0.00063872465,"about_ca_system_score_gemma":0.0007636259,"threshold_uncertainty_score":0.020772398},"labels":[],"label_agreement":null},{"id":"W3104370314","doi":"10.1007/978-3-319-67558-9","title":"Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":1132,"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":"Computer science; Artificial intelligence; Generalization; Normalization (sociology); Deep learning; Machine learning; Pattern recognition (psychology); Domain (mathematical analysis); Representation (politics); Mathematics","score_opus":0.02024162509865219,"score_gpt":0.3487750863579071,"score_spread":0.3285334612592549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104370314","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010413552,0.039682884,0.93509406,0.0028016616,0.00060992414,0.000051614938,0.0005401629,0.0011219408,0.009684172],"genre_scores_gemma":[0.29908425,0.042645745,0.5959982,0.0011358748,0.0015778687,0.00017816633,0.0014290224,0.00038797967,0.057562966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997845,0.000055949797,0.000015028958,0.000038218688,0.000079992205,0.000026314532],"domain_scores_gemma":[0.99951434,0.00030325213,0.00002834945,0.00003953583,0.000093687966,0.000020894267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006644888,0.00064834324,0.00067562296,0.00066125207,0.00012533895,0.0009577049,0.000866804,0.0009315569,0.0052866624],"category_scores_gemma":[0.0015561797,0.00039010352,0.00059698906,0.0009918975,0.000393051,0.0010291841,0.0011264994,0.0016780732,0.0015909283],"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.00007952388,0.00008901133,0.00042565967,0.00046629083,0.000088326975,0.0000817286,0.000041381754,0.058266215,0.0058677737,0.019443521,0.027680818,0.8874697],"study_design_scores_gemma":[0.000013058635,0.00007802119,0.0010649054,0.00016058957,0.00004600367,0.00023975788,0.000030592284,0.8872365,0.00818253,0.07565,0.02726554,0.000032521035],"about_ca_topic_score_codex":0.0018097156,"about_ca_topic_score_gemma":0.0028892555,"teacher_disagreement_score":0.0052866624,"about_ca_system_score_codex":0.0005431846,"about_ca_system_score_gemma":0.000423201,"threshold_uncertainty_score":0.017685652},"labels":[],"label_agreement":null},{"id":"W3105017984","doi":"10.1007/978-3-030-58589-1_12","title":"EGDCL: An Adaptive Curriculum Learning Framework for Unbiased Glaucoma Diagnosis","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Western University","funders":"","keywords":"Computer science; Curriculum; Glaucoma; Artificial intelligence; CAD; Debiasing; Machine learning; Fundus (uterus); Process (computing); Sensitivity (control systems); Class (philosophy); Categorization; Dual (grammatical number); Ophthalmology; Medicine; Engineering drawing","score_opus":0.024874217345476974,"score_gpt":0.2967810849737178,"score_spread":0.27190686762824084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105017984","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.0032471814,0.0001124616,0.9906378,0.000100467296,0.00003306633,0.000054717384,0.00019907196,0.0040056976,0.001609507],"genre_scores_gemma":[0.08295287,0.00019752052,0.90900755,0.00020945058,0.000039221995,0.0002174125,0.0008007245,0.0002784272,0.006296883],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973065,0.000056423552,0.000014133965,0.00006464138,0.00009922457,0.000034785193],"domain_scores_gemma":[0.99965763,0.0001251036,0.000017222485,0.00003927721,0.000117422795,0.000043346077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060517463,0.0005077239,0.00045224512,0.00059491524,0.00029418792,0.0006628847,0.0017041068,0.00095804845,0.009328736],"category_scores_gemma":[0.0014748934,0.00022347027,0.00047394758,0.00042647086,0.000267529,0.0007345078,0.0019586103,0.0012028688,0.002210732],"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.00013488652,0.00013650881,0.00096063386,0.00007614623,0.000028409379,0.00008107579,0.0000687514,0.08197912,0.0063540605,0.008173413,0.014064241,0.8879428],"study_design_scores_gemma":[0.000027982313,0.000057862708,0.00030185498,0.000019032788,0.00001180948,0.000066584835,0.000027615983,0.9742434,0.005535563,0.009568604,0.010127585,0.000012107499],"about_ca_topic_score_codex":0.0069083385,"about_ca_topic_score_gemma":0.010137965,"teacher_disagreement_score":0.009328736,"about_ca_system_score_codex":0.00063376385,"about_ca_system_score_gemma":0.001151298,"threshold_uncertainty_score":0.03120768},"labels":[],"label_agreement":null},{"id":"W3105826472","doi":"10.1007/978-3-030-68799-1_16","title":"Local Anomaly Detection in Videos Using Object-Centric Adversarial Learning","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Polytechnique Montréal","funders":"","keywords":"Artificial intelligence; Computer science; Discriminator; Adversarial system; Classifier (UML); Pattern recognition (psychology); Inference; Computer vision; Anomaly detection; Object (grammar); Object detection; Image (mathematics); Detector","score_opus":0.013895541371072883,"score_gpt":0.26036010055919495,"score_spread":0.24646455918812207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105826472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030963734,0.00017806716,0.96753,0.00019085425,0.000050065228,0.00002957524,0.0000673122,0.0005667685,0.00042358862],"genre_scores_gemma":[0.87759924,0.0002571812,0.11904455,0.00017712542,0.00012103651,0.00007136872,0.00039968453,0.00011139627,0.0022184122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914145,0.00017250744,0.000030771356,0.00029028807,0.0002348673,0.00013010595],"domain_scores_gemma":[0.9979685,0.0011460404,0.00024125385,0.00026900598,0.00026992723,0.00010522617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013912899,0.0009799341,0.0012698403,0.0009297614,0.0003214062,0.0007559399,0.001782086,0.0012361947,0.0008404363],"category_scores_gemma":[0.004711828,0.0004410225,0.0007649084,0.0010116088,0.0010170024,0.0012665096,0.0018236665,0.002076548,0.00028491343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038067938,0.0001463198,0.0037204348,0.000087050335,0.00011709178,0.00023429202,0.000067084766,0.78607,0.013160604,0.008213748,0.002475671,0.18532705],"study_design_scores_gemma":[0.000002422799,0.000017277598,0.00016430121,0.0000018936995,0.0000040521318,0.000023134315,0.0000030704612,0.9966629,0.0010637417,0.0019702434,0.000084718544,0.000002266388],"about_ca_topic_score_codex":0.0031529735,"about_ca_topic_score_gemma":0.0029208115,"teacher_disagreement_score":0.0031529735,"about_ca_system_score_codex":0.00083369645,"about_ca_system_score_gemma":0.00069041643,"threshold_uncertainty_score":0.007357955},"labels":[],"label_agreement":null},{"id":"W3106282085","doi":"10.1007/978-3-662-48433-3_10","title":"The Combinatorial World (of Auctions) According to GARP","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Valuation (finance); Bidding; Common value auction; Combinatorial auction; Rationality; Computer science; Mathematical optimization; Mathematical economics; Function (biology); Mechanism design; Mathematics; Microeconomics; Economics; Finance","score_opus":0.08660673437855398,"score_gpt":0.3672198739915741,"score_spread":0.2806131396130201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106282085","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.054520585,0.007856963,0.34714818,0.012627963,0.001031029,0.00015175776,0.00068927405,0.00033075453,0.57564354],"genre_scores_gemma":[0.7958682,0.0072803586,0.124155276,0.0019304417,0.0018603778,0.0004270335,0.0006063732,0.00032195332,0.067549996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969562,0.0014565015,0.00015412306,0.00040412758,0.00080866076,0.00022032624],"domain_scores_gemma":[0.9982805,0.0007910438,0.00012874872,0.0004627245,0.00019917387,0.00013774862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023115021,0.0008213503,0.0012047694,0.0017717995,0.0019076412,0.011220026,0.0017584934,0.0024370826,0.007102028],"category_scores_gemma":[0.0066913455,0.00057668705,0.0012460728,0.0034724094,0.0067017935,0.01294841,0.0033588968,0.0045119254,0.001721564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004075482,0.0000021270534,0.000013255877,0.000008379847,0.0000025569814,0.000010360882,0.000024630466,0.00039468455,0.00002184662,0.99754554,0.0006919198,0.0012805928],"study_design_scores_gemma":[0.0000026566759,0.000001946127,0.000012516089,0.000005527344,0.0000015856507,0.000028713452,0.000011054956,0.001297946,0.000018508872,0.99654645,0.0020707063,0.0000024820229],"about_ca_topic_score_codex":0.00053090864,"about_ca_topic_score_gemma":0.00033353877,"teacher_disagreement_score":0.011220026,"about_ca_system_score_codex":0.0014873247,"about_ca_system_score_gemma":0.0009091344,"threshold_uncertainty_score":0.02375871},"labels":[],"label_agreement":null},{"id":"W3106587394","doi":"10.1007/978-3-030-58520-4_39","title":"Cross-Modal Weighting Network for RGB-D Salient Object Detection","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Manitoba","funders":"","keywords":"Weighting; RGB color model; Computer science; Artificial intelligence; Modal; Computer vision; Feature (linguistics); Object (grammar); Pattern recognition (psychology)","score_opus":0.020967453399750955,"score_gpt":0.2793071646912517,"score_spread":0.25833971129150074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106587394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020796679,0.0008542777,0.97359437,0.00012541928,0.00011745177,0.00005424002,0.00029384386,0.0013964853,0.002767121],"genre_scores_gemma":[0.54692644,0.0013416102,0.4293281,0.0004394821,0.00017117197,0.00020065405,0.001763003,0.0002551827,0.019574469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998149,0.000020503005,0.000008905465,0.00006538281,0.000053504642,0.000036791196],"domain_scores_gemma":[0.9997836,0.000046654903,0.000017828599,0.000032911805,0.000100011996,0.00001904008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053899654,0.00078274775,0.0006471518,0.0006909344,0.00027449522,0.00060752325,0.0014663893,0.0007643437,0.005099407],"category_scores_gemma":[0.0008064516,0.0003426575,0.0005569397,0.0009658433,0.00025017103,0.00090051617,0.0011983584,0.00064678804,0.0014197073],"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.0002052172,0.0002183097,0.0007182402,0.00015335593,0.00011148999,0.000065320935,0.000048674796,0.05619833,0.07330291,0.006211807,0.009921603,0.8528449],"study_design_scores_gemma":[0.0000055985674,0.000059787177,0.0008299326,0.00001258783,0.000034580386,0.000058753536,0.000011600092,0.97973347,0.013498327,0.0034673943,0.0022747386,0.000013305965],"about_ca_topic_score_codex":0.0078106695,"about_ca_topic_score_gemma":0.010900559,"teacher_disagreement_score":0.0078106695,"about_ca_system_score_codex":0.00062166265,"about_ca_system_score_gemma":0.0005320249,"threshold_uncertainty_score":0.017059267},"labels":[],"label_agreement":null},{"id":"W3106593688","doi":"10.1007/978-3-030-63419-3_4","title":"DeSupGAN: Multi-scale Feature Averaging Generative Adversarial Network for Simultaneous De-blurring and Super-Resolution of Retinal Fundus Images","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Feature (linguistics); Fuse (electrical); Convolutional neural network; Pattern recognition (psychology); Computer vision; Image quality; Fundus (uterus); Kernel (algebra); Block (permutation group theory); Image (mathematics); Mathematics","score_opus":0.01803985101655244,"score_gpt":0.2698584384653617,"score_spread":0.2518185874488093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106593688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042206882,0.00083876797,0.9910272,0.00014513986,0.00007274015,0.00003055489,0.00018328827,0.0016806305,0.001800991],"genre_scores_gemma":[0.21804686,0.0019956196,0.75694823,0.0004697486,0.00014205804,0.00014841554,0.0013082776,0.0006750846,0.020265639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986196,0.00003058744,0.0000050469876,0.00003380713,0.000050368824,0.000018235718],"domain_scores_gemma":[0.9998307,0.00008846003,0.00001195107,0.000030709125,0.000029063141,0.000009093872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041286228,0.0007300483,0.00053781335,0.00028411055,0.00016328976,0.00040022345,0.0009717048,0.00073449063,0.003272094],"category_scores_gemma":[0.0007732784,0.00035795994,0.0005947871,0.0003024372,0.00027381408,0.0005328775,0.0010181221,0.0012859863,0.0012207296],"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.0001367433,0.00006552087,0.00034682496,0.00013645724,0.00015019318,0.00015763966,0.000051384875,0.42716566,0.025807835,0.011389766,0.016688209,0.51790375],"study_design_scores_gemma":[0.0000032102082,0.000015616453,0.000102503196,0.00000756516,0.000009271114,0.000065346096,0.0000031050672,0.9902715,0.004419053,0.0026921588,0.002404545,0.000006163855],"about_ca_topic_score_codex":0.002931344,"about_ca_topic_score_gemma":0.0060452865,"teacher_disagreement_score":0.003272094,"about_ca_system_score_codex":0.00039091508,"about_ca_system_score_gemma":0.00034749418,"threshold_uncertainty_score":0.010946214},"labels":[],"label_agreement":null},{"id":"W3106645934","doi":"10.1007/978-3-030-58589-1_16","title":"Adaptive Video Highlight Detection by Learning from User History","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Manitoba","funders":"","keywords":"Computer science; Normalization (sociology); Artificial intelligence; Affine transformation; User modeling; Machine learning; Human–computer interaction; User interface","score_opus":0.0141309733185947,"score_gpt":0.19343315935093133,"score_spread":0.17930218603233664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106645934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1355967,0.0029639783,0.849987,0.00020613837,0.00028337757,0.0001825529,0.0009895047,0.005548965,0.00424185],"genre_scores_gemma":[0.6848925,0.0023292857,0.2956779,0.00017550858,0.0004959773,0.00016659567,0.0023228405,0.0005177168,0.0134216705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977547,0.000021524505,0.00000907348,0.00009277643,0.000059606748,0.00004159571],"domain_scores_gemma":[0.99953914,0.00018998202,0.000048958613,0.000048403504,0.00011820318,0.00005531424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033514656,0.0009996245,0.0010029768,0.0018005179,0.0002468426,0.00057833036,0.00073239655,0.0005118884,0.0020713443],"category_scores_gemma":[0.0009295639,0.00028567723,0.00050925306,0.0011253292,0.0001590802,0.00077661703,0.0006251232,0.0006898219,0.0020689897],"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.00061750016,0.00021980659,0.004011163,0.00016406189,0.0000819975,0.0001466135,0.000056669134,0.007223255,0.10544226,0.0003724603,0.005431354,0.87623274],"study_design_scores_gemma":[0.000045435892,0.00059237116,0.020246867,0.000042147556,0.00023186223,0.00072147243,0.00011444784,0.8798753,0.08907747,0.0018027413,0.007197032,0.000052895033],"about_ca_topic_score_codex":0.002224083,"about_ca_topic_score_gemma":0.0049370877,"teacher_disagreement_score":0.002224083,"about_ca_system_score_codex":0.00025169263,"about_ca_system_score_gemma":0.0003093309,"threshold_uncertainty_score":0.006929338},"labels":[],"label_agreement":null},{"id":"W3106756511","doi":"10.1007/978-3-030-61792-9_19","title":"An $$\\varOmega (n^3)$$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Shortest path problem; Upper and lower bounds; Combinatorics; Generalization; Sharpening; Path (computing); Mathematics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015562966957420864,"score_gpt":0.2614847325972661,"score_spread":0.24592176563984525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106756511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04405794,0.010057879,0.5843584,0.0076788794,0.0042657712,0.00030895145,0.0045462823,0.0035173774,0.34120855],"genre_scores_gemma":[0.29270202,0.01041429,0.51891756,0.0031458782,0.002637957,0.0018108743,0.00611445,0.0052863774,0.15897061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978861,0.00028176865,0.000097921235,0.000561713,0.00073645444,0.0004360578],"domain_scores_gemma":[0.9929235,0.004954294,0.00023826148,0.0009780725,0.0005023593,0.000403505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018513007,0.003996892,0.002457369,0.0031816682,0.0025815254,0.005169389,0.0066771396,0.0030753158,0.0534793],"category_scores_gemma":[0.011750113,0.0016379006,0.0033927117,0.0038294136,0.0024553651,0.008522593,0.0075587644,0.011296219,0.0135738095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010458339,0.0005650806,0.0016311542,0.0015964304,0.00024023965,0.00031059832,0.00042386583,0.07019852,0.020516463,0.43141916,0.15096955,0.32108316],"study_design_scores_gemma":[0.00011985783,0.00020886619,0.0025483689,0.00052525784,0.00032082025,0.000708735,0.0002150051,0.33729464,0.010231678,0.5617448,0.08592801,0.00015392913],"about_ca_topic_score_codex":0.0041996147,"about_ca_topic_score_gemma":0.010776457,"teacher_disagreement_score":0.0534793,"about_ca_system_score_codex":0.0037555117,"about_ca_system_score_gemma":0.0021678486,"threshold_uncertainty_score":0.17890608},"labels":[],"label_agreement":null},{"id":"W3106774124","doi":"10.1007/978-3-030-63833-7_3","title":"Discrete Mother Tree Optimization for the Traveling Salesman Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Travelling salesman problem; Swap (finance); Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Swarm behaviour; Particle swarm optimization; Combinatorial optimization; Tree (set theory); Algorithm; Mathematics; Combinatorics","score_opus":0.02949725858594019,"score_gpt":0.27493606879401594,"score_spread":0.24543881020807576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106774124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01580258,0.0023453496,0.93802106,0.000942709,0.00034227842,0.000057888632,0.0002283247,0.00019987384,0.042059895],"genre_scores_gemma":[0.37855875,0.0049332296,0.54431087,0.00041836986,0.00048333415,0.00036593984,0.000817516,0.00050176814,0.06961021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975413,0.0000958698,0.000006280879,0.000037358433,0.00007876016,0.000027533983],"domain_scores_gemma":[0.9996582,0.00023061517,0.000024976629,0.000020386322,0.000035201338,0.000030611987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047147562,0.00059689145,0.0009679994,0.00048383226,0.00030275164,0.0010386755,0.0012725543,0.0011837662,0.0104674855],"category_scores_gemma":[0.0018180894,0.00037929107,0.0005775994,0.001094508,0.0004969034,0.0012594945,0.0008229845,0.0018855239,0.0013692309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011252487,0.00012213935,0.0001953595,0.00034633285,0.000040419465,0.00007512453,0.000081141116,0.5734168,0.0022238859,0.25297505,0.021917112,0.14849408],"study_design_scores_gemma":[0.000021050504,0.000044959164,0.00007279041,0.000027172257,0.000008428762,0.00003344285,0.000021031643,0.942912,0.0002989882,0.04848322,0.008071431,0.000005534965],"about_ca_topic_score_codex":0.0015253498,"about_ca_topic_score_gemma":0.0013227888,"teacher_disagreement_score":0.0104674855,"about_ca_system_score_codex":0.0010612195,"about_ca_system_score_gemma":0.0007927064,"threshold_uncertainty_score":0.035017252},"labels":[],"label_agreement":null},{"id":"W3106965408","doi":"10.1007/978-3-030-58601-0_18","title":"ScribbleBox: Interactive Annotation Framework for Video Object Segmentation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Annotation; Segmentation; Artificial intelligence; Computer vision; Object (grammar); Trajectory; Track (disk drive); Computer graphics (images)","score_opus":0.023568015670990615,"score_gpt":0.2988393565910849,"score_spread":0.2752713409200943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106965408","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.0015576293,0.0003850556,0.9106987,0.0000825644,0.000094285126,0.00015784879,0.0025805586,0.080592394,0.0038509252],"genre_scores_gemma":[0.0332094,0.0007163172,0.9165867,0.0003295461,0.000090195885,0.000472148,0.011541914,0.018071815,0.018981973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.000060546652,0.000031122312,0.00016738349,0.00021012941,0.00008105901],"domain_scores_gemma":[0.9995338,0.00014550814,0.000027442227,0.00010892746,0.00011976503,0.000064700995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008096444,0.0024890858,0.0014768267,0.0028471453,0.0011572515,0.0026671765,0.0038096665,0.0023622517,0.058314618],"category_scores_gemma":[0.0016622997,0.001419172,0.00163404,0.002173345,0.0005942358,0.0020532724,0.003776542,0.0019186054,0.020478345],"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.0010123517,0.00014981812,0.00044255055,0.00089545076,0.00015233742,0.0005577658,0.00055080355,0.00995983,0.07655346,0.01928694,0.19772922,0.6927095],"study_design_scores_gemma":[0.00021869097,0.00022828538,0.0014098169,0.0003986377,0.00013160886,0.001302475,0.0003131055,0.44462055,0.14082015,0.05763078,0.35268348,0.00024244253],"about_ca_topic_score_codex":0.008757276,"about_ca_topic_score_gemma":0.018231774,"teacher_disagreement_score":0.058314618,"about_ca_system_score_codex":0.00093226106,"about_ca_system_score_gemma":0.0010485076,"threshold_uncertainty_score":0.19508183},"labels":[],"label_agreement":null},{"id":"W3107002483","doi":"10.1007/978-3-030-63419-3_3","title":"What is the Optimal Attribution Method for Explainable Ophthalmic Disease Classification?","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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 Waterloo","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Robustness (evolution); Deep learning; Machine learning; Attribution; Segmentation; Relevance (law); Domain (mathematical analysis)","score_opus":0.04354080973976497,"score_gpt":0.3383004788744485,"score_spread":0.2947596691346835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107002483","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.052320316,0.008321411,0.9200082,0.008574739,0.0012032846,0.00013060347,0.0016418623,0.0020363673,0.0057633226],"genre_scores_gemma":[0.5460715,0.0045235003,0.43449128,0.00079778995,0.0021497642,0.00018791652,0.0032323098,0.0005762548,0.0079697445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975357,0.0010012196,0.00019088684,0.00064667495,0.00042062104,0.0002049826],"domain_scores_gemma":[0.9914169,0.0056004794,0.00052921183,0.00095038087,0.0012023797,0.00030063477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006502594,0.0009598068,0.0014752642,0.0019968096,0.00056576135,0.0025316675,0.002408725,0.0022918263,0.006413443],"category_scores_gemma":[0.025588233,0.00042829642,0.0013902362,0.0015693129,0.0010989682,0.0045098057,0.0012761598,0.0024867048,0.0024003556],"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.000419974,0.00017065369,0.011516208,0.00036613934,0.00032287225,0.0001157544,0.00017512748,0.020865817,0.0035486983,0.014717273,0.027962726,0.9198188],"study_design_scores_gemma":[0.000083182174,0.00015605078,0.0104086455,0.00031950723,0.00028037728,0.00057406863,0.00043157017,0.827097,0.00633954,0.14569063,0.008507385,0.00011209097],"about_ca_topic_score_codex":0.0025869112,"about_ca_topic_score_gemma":0.0019926603,"teacher_disagreement_score":0.006502594,"about_ca_system_score_codex":0.000830388,"about_ca_system_score_gemma":0.0014128691,"threshold_uncertainty_score":0.034389436},"labels":[],"label_agreement":null},{"id":"W3107066575","doi":"10.1007/978-3-030-58520-4_27","title":"Conditional Entropy Coding for Efficient Video Compression","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Entropy encoding; Codec; Decoding methods; Conditional entropy; Data compression; Artificial intelligence; Autoregressive model; Deep learning; Entropy (arrow of time); Algorithm; Image compression; Theoretical computer science; Speech recognition; Computer vision; Computer engineering; Image processing; Principle of maximum entropy; Image (mathematics); Computer hardware","score_opus":0.020204340808646998,"score_gpt":0.2805028317985322,"score_spread":0.2602984909898852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107066575","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.0070743673,0.0025115216,0.97571313,0.00025776084,0.00022688948,0.00003622129,0.00027482025,0.00060032355,0.013304948],"genre_scores_gemma":[0.38926387,0.007139751,0.55158734,0.00049597234,0.0008006027,0.0002219121,0.0018721328,0.00053307356,0.04808526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998049,0.000034287754,0.000008265713,0.000017512002,0.00011412054,0.000021034575],"domain_scores_gemma":[0.99966896,0.00020829264,0.000014840226,0.00005007416,0.00005058688,0.0000072993607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002722849,0.0005652003,0.00040755095,0.0005925685,0.00017496591,0.00052993745,0.0005621899,0.0004965021,0.0077598463],"category_scores_gemma":[0.001020973,0.00022498173,0.0002647894,0.0010611988,0.00039258032,0.0010397785,0.0006594949,0.0011909986,0.0013026407],"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.00014736633,0.00008272346,0.00016145145,0.00025789463,0.000034076602,0.00018627981,0.00005616096,0.09572075,0.06055498,0.24957946,0.024701754,0.5685171],"study_design_scores_gemma":[0.0000138202595,0.00005430904,0.0005102123,0.00006814856,0.000020020665,0.00028308117,0.000011802835,0.8865951,0.041699734,0.055051334,0.015665576,0.000026861091],"about_ca_topic_score_codex":0.0008028609,"about_ca_topic_score_gemma":0.0012411966,"teacher_disagreement_score":0.0077598463,"about_ca_system_score_codex":0.0003349769,"about_ca_system_score_gemma":0.00029041243,"threshold_uncertainty_score":0.025959253},"labels":[],"label_agreement":null},{"id":"W3107090469","doi":"10.1007/978-3-030-58604-1_4","title":"Adaptive Object Detection with Dual Multi-label Prediction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Regularization (linguistics); Pattern recognition (psychology); Benchmark (surveying); Object (grammar); Object detection; Cognitive neuroscience of visual object recognition; Feature (linguistics); Computer vision; Machine learning","score_opus":0.029416488666864145,"score_gpt":0.23852544253333371,"score_spread":0.20910895386646958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107090469","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.0099971015,0.0004128902,0.98637515,0.00012234379,0.00013716941,0.000034392342,0.00008939781,0.0013541318,0.0014774186],"genre_scores_gemma":[0.2736187,0.0005563663,0.70730174,0.00046401986,0.00025617218,0.00011752253,0.00092690054,0.00036372035,0.01639482],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898976,0.00015899903,0.00003548638,0.00041353988,0.00027386114,0.00012825358],"domain_scores_gemma":[0.9987129,0.00048155469,0.000056465648,0.00037316766,0.00029511348,0.000080800506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011850332,0.000941914,0.0017153305,0.0010289449,0.000466297,0.0012660851,0.002879832,0.001973531,0.0032027224],"category_scores_gemma":[0.0017390564,0.0006977092,0.0010457494,0.0011458615,0.0006631173,0.0016934437,0.0025822192,0.002267497,0.0027345587],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040147995,0.00033575375,0.0009545098,0.00013400143,0.00015047145,0.00011832804,0.000056812547,0.0675627,0.05529315,0.0049678884,0.0069546276,0.86307037],"study_design_scores_gemma":[0.0000071134623,0.000033854838,0.00038607197,0.0000061520445,0.000022677512,0.000075812044,0.000008026005,0.98386,0.009355158,0.005171573,0.0010607932,0.000012714867],"about_ca_topic_score_codex":0.0028365473,"about_ca_topic_score_gemma":0.0041317716,"teacher_disagreement_score":0.0032027224,"about_ca_system_score_codex":0.0005023944,"about_ca_system_score_gemma":0.0006345922,"threshold_uncertainty_score":0.010714233},"labels":[],"label_agreement":null},{"id":"W3107387689","doi":"10.1007/978-3-030-63464-3_9","title":"Use of Virtual Reality Technology for CANDU 6 Reactor Fuel Channel Operation Training","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Ontario Power Generation; Ontario Tech University","funders":"","keywords":"Nuclear engineering; Nuclear fuel; Coolant; Virtual reality; Nuclear reactor core; Computer science; Spent nuclear fuel; Channel (broadcasting); Nuclear reactor; Environmental science; Simulation; Mechanical engineering; Engineering; Telecommunications; Human–computer interaction","score_opus":0.09116023637764106,"score_gpt":0.29437726826823696,"score_spread":0.2032170318905959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107387689","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18416978,0.009710626,0.38014787,0.001984563,0.001070931,0.00039562787,0.00036690617,0.0029559033,0.41919774],"genre_scores_gemma":[0.64230156,0.00825671,0.16440935,0.00060668826,0.0002109177,0.00031363498,0.00034010943,0.00030346177,0.18325761],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995678,0.0001366763,0.000012362845,0.000043739896,0.00018263634,0.000056753895],"domain_scores_gemma":[0.9996846,0.0001620554,0.00001717604,0.00003689542,0.000046742953,0.000052606865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006286471,0.00051749067,0.00021139842,0.00089890836,0.00041679438,0.0012653213,0.0010614212,0.00086860976,0.019130876],"category_scores_gemma":[0.000761167,0.00027589028,0.00046846646,0.00039539835,0.00031435286,0.0006710466,0.0014463251,0.0006583385,0.002302002],"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.0004042264,0.0008241819,0.00090255716,0.00030484804,0.000035213787,0.00045770963,0.0013107919,0.008370711,0.044599377,0.011108777,0.01642192,0.9152597],"study_design_scores_gemma":[0.0002515009,0.0050086835,0.025309913,0.0013485961,0.00022120349,0.008127558,0.003524842,0.089358754,0.1207753,0.014455257,0.73120975,0.00040865355],"about_ca_topic_score_codex":0.0011912902,"about_ca_topic_score_gemma":0.0019891502,"teacher_disagreement_score":0.019130876,"about_ca_system_score_codex":0.00028960037,"about_ca_system_score_gemma":0.00049115997,"threshold_uncertainty_score":0.063999176},"labels":[],"label_agreement":null},{"id":"W3107547765","doi":"10.1007/978-3-030-58452-8_10","title":"House-GAN: Relational Generative Adversarial Networks for Graph-Constrained House Layout Generation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":259,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Theoretical computer science; Adjacency list; Graph; Algorithm","score_opus":0.02765445398485078,"score_gpt":0.2303174894395121,"score_spread":0.20266303545466133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107547765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015429,0.00022251208,0.99218774,0.00009744957,0.000064460866,0.00004633065,0.00033313196,0.0025388473,0.0029666184],"genre_scores_gemma":[0.20341931,0.00079447665,0.7629199,0.000775966,0.00016660552,0.0003990889,0.0039342763,0.0027466055,0.024843726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996904,0.00007591402,0.000008486562,0.00011195059,0.00008178453,0.000031581996],"domain_scores_gemma":[0.99956614,0.00024048233,0.000022635186,0.0001010104,0.000047447444,0.000022265756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051690306,0.0012773016,0.0009878696,0.00051462295,0.000277908,0.00087531673,0.0024595533,0.0016298837,0.012654096],"category_scores_gemma":[0.0015953948,0.00096580235,0.0011698061,0.00071442284,0.00055221806,0.0010321897,0.0016984636,0.002381553,0.0047544055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008305423,0.000056765355,0.00019939696,0.00011776983,0.00007111068,0.00011961245,0.00003707535,0.7709017,0.0058478094,0.017823964,0.02035742,0.18438433],"study_design_scores_gemma":[0.0000039475954,0.0000072945386,0.000027834874,0.0000058953383,0.000003707312,0.000022460341,0.0000023988903,0.992462,0.00078294845,0.0052309586,0.0014468409,0.0000037599234],"about_ca_topic_score_codex":0.0038634224,"about_ca_topic_score_gemma":0.008717947,"teacher_disagreement_score":0.012654096,"about_ca_system_score_codex":0.0007212496,"about_ca_system_score_gemma":0.00054985506,"threshold_uncertainty_score":0.042332172},"labels":[],"label_agreement":null},{"id":"W3107556511","doi":"10.1007/978-3-030-64694-3_18","title":"An Exploratory Study on How Software Reuse is Discussed in Stack Overflow","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Expert finding and Q&A systems","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Reuse; Software engineering; Reusability; Software development; Code reuse; Software; Source code; Java; Software quality; Software construction; Domain engineering; Software peer review; Component-based software engineering; Legacy code; World Wide Web; Programming language; Engineering","score_opus":0.03513971116291101,"score_gpt":0.2661512959179345,"score_spread":0.2310115847550235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107556511","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.9919145,0.00009350041,0.0017435057,0.00025925736,0.0000067554774,0.000041029158,0.000023823884,0.000029588657,0.005888194],"genre_scores_gemma":[0.99455416,0.00011852606,0.0019847138,0.000109737826,0.000006690725,0.000030867166,0.00004652028,0.000036309033,0.0031124721],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9972063,0.0016761456,0.000116791736,0.00018785837,0.0005234148,0.0002895537],"domain_scores_gemma":[0.9711067,0.023750124,0.002184049,0.0009008168,0.0011074131,0.0009509292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003104215,0.000327201,0.00024437092,0.0021320984,0.0046918434,0.0024802622,0.0009502496,0.0016467646,0.0028103497],"category_scores_gemma":[0.028256904,0.00041633612,0.00027531953,0.0018501107,0.002750123,0.0062828665,0.0027391736,0.0019508222,0.00031073135],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025060488,0.0007931784,0.0408637,0.00024151421,0.000020145859,0.0026192267,0.8973108,0.00023277038,0.008744613,0.008736483,0.0010108579,0.039176043],"study_design_scores_gemma":[0.000030688054,0.0008553096,0.06896604,0.0003210701,0.00005659889,0.0023701945,0.8851122,0.002227831,0.0072084526,0.005332892,0.027449505,0.00006909233],"about_ca_topic_score_codex":0.005613086,"about_ca_topic_score_gemma":0.014207946,"teacher_disagreement_score":0.005613086,"about_ca_system_score_codex":0.0017280196,"about_ca_system_score_gemma":0.0017422994,"threshold_uncertainty_score":0.016416848},"labels":[],"label_agreement":null},{"id":"W3108122746","doi":"10.1007/978-3-030-64984-5_4","title":"Novel Block Diagonalization for Reducing Features and Computations in Medical Diagnosis","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Computer science; Computation; Block (permutation group theory); Theoretical computer science; Algorithm; Combinatorics; Mathematics","score_opus":0.020956887789508636,"score_gpt":0.2721678922696865,"score_spread":0.25121100448017786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108122746","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.0039406717,0.0002068724,0.9935129,0.0001465966,0.000076715114,0.00003853753,0.00013590747,0.0008330127,0.0011087776],"genre_scores_gemma":[0.05342639,0.0003419321,0.9364127,0.00021495123,0.00016932227,0.00016568284,0.00070007396,0.00031515918,0.008253868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951804,0.00011059287,0.000033789445,0.00008340594,0.00020809898,0.000045998757],"domain_scores_gemma":[0.9991979,0.00035490099,0.000050663104,0.00015835534,0.00019213754,0.00004615881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004480345,0.00089019316,0.00083929393,0.0006317373,0.00044559926,0.00080025743,0.0009035019,0.0007285817,0.008813958],"category_scores_gemma":[0.0018246354,0.0004261181,0.00075057463,0.00082338654,0.00051997777,0.00077451294,0.0011419811,0.0012255196,0.003131674],"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.0004510006,0.0002482682,0.0004964088,0.00026206748,0.00008815879,0.00014770003,0.0001332826,0.0754314,0.08891344,0.040177867,0.022899209,0.77075124],"study_design_scores_gemma":[0.000047327456,0.00013238346,0.00041556294,0.000019693114,0.000031789823,0.00016459824,0.00004081656,0.95120376,0.018628458,0.019810744,0.009484092,0.000020824746],"about_ca_topic_score_codex":0.0038145047,"about_ca_topic_score_gemma":0.0067697675,"teacher_disagreement_score":0.008813958,"about_ca_system_score_codex":0.00032164928,"about_ca_system_score_gemma":0.0010246012,"threshold_uncertainty_score":0.029485583},"labels":[],"label_agreement":null},{"id":"W3108159626","doi":"10.1007/978-3-030-80049-9_38","title":"Positive Enumerable Functors","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"Functor; Recursively enumerable language; Mathematics; Enumeration; Pure mathematics; Discrete mathematics","score_opus":0.02284298081447123,"score_gpt":0.3061794627422242,"score_spread":0.28333648192775296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108159626","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.19762191,0.0027340208,0.4390642,0.004118019,0.0015309922,0.00010555648,0.0009628738,0.0019693645,0.35189307],"genre_scores_gemma":[0.7994848,0.0016429761,0.058520827,0.0009996508,0.00078315067,0.00019732991,0.0009917087,0.0005865547,0.13679297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983327,0.00034032876,0.000085745414,0.00036505747,0.000612354,0.000263983],"domain_scores_gemma":[0.9972595,0.0014525779,0.00015742928,0.00030637352,0.00045697042,0.00036717797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015474688,0.0011469874,0.00074242544,0.0037674427,0.0023549956,0.0038202167,0.0012399282,0.0014305387,0.015199723],"category_scores_gemma":[0.0039297645,0.0007775438,0.00092977245,0.0020611323,0.0031288778,0.008681352,0.004847316,0.0043245154,0.0029108424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016650674,0.000024471383,0.00012875439,0.000030265624,0.000004172696,0.000061015282,0.00015142413,0.00019057086,0.0008877904,0.9871454,0.0019165834,0.009442952],"study_design_scores_gemma":[0.000007917453,0.000010136385,0.00020529666,0.000018182613,0.0000116215,0.00029147803,0.000058623536,0.0015039059,0.0012861626,0.9837532,0.012840358,0.000013245792],"about_ca_topic_score_codex":0.00023491085,"about_ca_topic_score_gemma":0.00033415368,"teacher_disagreement_score":0.015199723,"about_ca_system_score_codex":0.0011931828,"about_ca_system_score_gemma":0.00060155697,"threshold_uncertainty_score":0.050848126},"labels":[],"label_agreement":null},{"id":"W3108307345","doi":"10.1007/978-3-030-58568-6_21","title":"3D Human Shape Reconstruction from a Polarization Image","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical measurement and interference techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Simon Fraser University; University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Polarization (electrochemistry); Body shape; Human body; Pattern recognition (psychology)","score_opus":0.029954358938353215,"score_gpt":0.25386036509591775,"score_spread":0.22390600615756454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108307345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030943753,0.0005108294,0.9534958,0.00022361221,0.0000860766,0.000042901902,0.00047917868,0.0012399027,0.012977994],"genre_scores_gemma":[0.3567407,0.0023379764,0.6193187,0.00027903233,0.000072076364,0.000060353836,0.00136632,0.00068985595,0.019135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998871,0.000012703022,0.0000032760054,0.000024648569,0.00005794368,0.000014378714],"domain_scores_gemma":[0.9999021,0.00003001523,0.0000058920027,0.00003216079,0.000023014945,0.000006836394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017180172,0.00048537672,0.00034739848,0.0004344033,0.00018281039,0.00096833706,0.0003579197,0.0007668812,0.0055151163],"category_scores_gemma":[0.00036787897,0.00056733406,0.00062657864,0.0005591308,0.00045548976,0.0005550883,0.0008657966,0.0007489314,0.0026287807],"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.00052199676,0.00007416116,0.0012381488,0.00036248844,0.00009299658,0.00094070233,0.00039279714,0.06782701,0.36479846,0.015629265,0.009602217,0.5385198],"study_design_scores_gemma":[0.00004274125,0.00024667796,0.0060293623,0.00017635433,0.00010749565,0.011816587,0.00048908516,0.65071154,0.26117483,0.022041751,0.04700299,0.00016052682],"about_ca_topic_score_codex":0.0009275374,"about_ca_topic_score_gemma":0.0011442341,"teacher_disagreement_score":0.0055151163,"about_ca_system_score_codex":0.00014289697,"about_ca_system_score_gemma":0.00038236534,"threshold_uncertainty_score":0.018449962},"labels":[],"label_agreement":null},{"id":"W3108413361","doi":"10.1007/978-3-030-58583-9_22","title":"Structure-Aware Generation Network for Recipe Generation from Images","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Research (Canada)","funders":"","keywords":"Recipe; Computer science; Closed captioning; Task (project management); Benchmark (surveying); Tree (set theory); Artificial intelligence; Tree structure; Natural language processing; Sentence; Machine learning; Image (mathematics); Information retrieval; Data structure","score_opus":0.027145977666984025,"score_gpt":0.26912500691998603,"score_spread":0.24197902925300202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108413361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01870496,0.00041050167,0.9579482,0.00022266545,0.00016496514,0.0001582809,0.00094892585,0.015825335,0.005616102],"genre_scores_gemma":[0.30859515,0.0004021568,0.66682976,0.00029298896,0.00010979283,0.00031999947,0.0048967367,0.0012043461,0.017349068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981004,0.000022317881,0.0000081493345,0.00009155244,0.000044699595,0.000023269997],"domain_scores_gemma":[0.9997445,0.00008669724,0.000013840993,0.00007164432,0.00006211627,0.000021313896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034724714,0.0010129382,0.00076489453,0.00081638014,0.0005120458,0.0006777905,0.0020176,0.0012001953,0.012106361],"category_scores_gemma":[0.00087912445,0.00060775114,0.0009080764,0.0006888299,0.00037877364,0.0010948083,0.0010940259,0.0012840048,0.003310932],"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.00038765432,0.0003120856,0.0007781602,0.00017263176,0.00009511309,0.00021755413,0.00009126861,0.17590834,0.030547172,0.010816437,0.02261163,0.758062],"study_design_scores_gemma":[0.000014637074,0.000027090136,0.00014682785,0.0000066529647,0.000014723681,0.000042547857,0.000007809276,0.98557997,0.007321882,0.0047236397,0.0021054375,0.000008830068],"about_ca_topic_score_codex":0.0068050465,"about_ca_topic_score_gemma":0.0115604,"teacher_disagreement_score":0.012106361,"about_ca_system_score_codex":0.0007754708,"about_ca_system_score_gemma":0.0007216109,"threshold_uncertainty_score":0.040499806},"labels":[],"label_agreement":null},{"id":"W3108501164","doi":"10.1007/978-3-030-62536-8_17","title":"Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Automaton; Projection (relational algebra); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.057440604303737285,"score_gpt":0.2945945398114124,"score_spread":0.23715393550767513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108501164","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.27032787,0.0020192931,0.6296986,0.002746144,0.00034559067,0.0002483356,0.0011286524,0.0014854077,0.09200021],"genre_scores_gemma":[0.8335774,0.0013208467,0.13864857,0.00063555496,0.00055057433,0.0005149851,0.0020875914,0.0004722692,0.022192126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985133,0.00021156431,0.0001363169,0.0003964333,0.00054775376,0.00019469077],"domain_scores_gemma":[0.9894645,0.008501734,0.0004096886,0.00075366604,0.00052786205,0.00034255814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009450966,0.0010092763,0.0012812128,0.0012891466,0.0015491535,0.005529755,0.0019800682,0.0015965566,0.008649001],"category_scores_gemma":[0.007056942,0.0009977882,0.0027752367,0.0021873333,0.0030497524,0.011546508,0.0033821692,0.0054680402,0.0011641402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023986818,0.00016363066,0.0009425583,0.00030053718,0.000036148598,0.0002203908,0.0006738243,0.025111279,0.007102835,0.92176926,0.0042746225,0.039165072],"study_design_scores_gemma":[0.000015665522,0.000030052643,0.00036612657,0.000014697825,0.000011867242,0.0001453221,0.00008855119,0.055320635,0.0018703509,0.9409405,0.0011678991,0.000028347258],"about_ca_topic_score_codex":0.0013864065,"about_ca_topic_score_gemma":0.00096673635,"teacher_disagreement_score":0.008649001,"about_ca_system_score_codex":0.0016530205,"about_ca_system_score_gemma":0.0008554111,"threshold_uncertainty_score":0.028933764},"labels":[],"label_agreement":null},{"id":"W3109067620","doi":"10.1007/978-3-030-69532-3_21","title":"Synergistic Saliency and Depth Prediction for RGB-D Saliency Detection","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"RGB color model; Artificial intelligence; Ground truth; Computer science; Inference; Computer vision; Pattern recognition (psychology); Visualization","score_opus":0.01886506836099714,"score_gpt":0.25896786866512084,"score_spread":0.2401028003041237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109067620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018468821,0.0012888442,0.9737289,0.00010069998,0.00014328714,0.00007173419,0.00020244956,0.0016166297,0.004378709],"genre_scores_gemma":[0.46778968,0.0012875219,0.5227954,0.00019187815,0.00018596476,0.00008465872,0.0004017787,0.00025995154,0.0070032068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986005,0.000011560869,0.0000044863414,0.000039115585,0.000060904687,0.000023861037],"domain_scores_gemma":[0.9998266,0.00005791376,0.000016603954,0.000023500785,0.00005723932,0.000018219482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022914878,0.00075695856,0.0005603899,0.00091586856,0.00017130803,0.0006090132,0.00078259455,0.0004854137,0.0055803116],"category_scores_gemma":[0.00071404263,0.0003949525,0.0004713561,0.00084669155,0.00018559453,0.000787517,0.0007722221,0.00036012538,0.0013436787],"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.0002721074,0.00008895741,0.0007180043,0.00024330773,0.000059860544,0.00010215896,0.000053683878,0.022010017,0.25194633,0.0036139195,0.0058382023,0.71505344],"study_design_scores_gemma":[0.000026803637,0.00015184974,0.0030106867,0.000036368667,0.000062728526,0.00034737447,0.000024141833,0.9086374,0.07358693,0.006476421,0.007610579,0.000028592056],"about_ca_topic_score_codex":0.0021734268,"about_ca_topic_score_gemma":0.0041848104,"teacher_disagreement_score":0.0055803116,"about_ca_system_score_codex":0.00037252353,"about_ca_system_score_gemma":0.00035916606,"threshold_uncertainty_score":0.018667996},"labels":[],"label_agreement":null},{"id":"W3109211147","doi":"10.1007/978-3-030-72084-1_23","title":"Efficient Embedding Network for 3D Brain Tumor Segmentation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Embedding; Segmentation; Artificial intelligence; Convolutional neural network; Dimension (graph theory); Field (mathematics); Encoder; Deep learning; Encoding (memory); Image (mathematics); Pattern recognition (psychology); Artificial neural network; Transfer of learning; Machine learning; Mathematics","score_opus":0.030911221847663498,"score_gpt":0.30389666442392665,"score_spread":0.27298544257626317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109211147","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.025077436,0.0004106509,0.9707944,0.00023111363,0.000054261487,0.000057463538,0.0005108567,0.0017372464,0.0011266023],"genre_scores_gemma":[0.3926612,0.0007000562,0.5914518,0.0001939512,0.00010598569,0.00027635932,0.0027650765,0.0006513096,0.01119422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999713,0.00005902678,0.000014626603,0.00008884146,0.00008086406,0.00004353271],"domain_scores_gemma":[0.9994424,0.000236601,0.000051842664,0.00010357212,0.00012882902,0.00003677956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003987472,0.0013831536,0.0012760273,0.0012529949,0.00041102388,0.00090685295,0.0014189044,0.0017617038,0.0045844577],"category_scores_gemma":[0.0014927875,0.00082722266,0.0008923357,0.0011969832,0.00046583742,0.0013604992,0.0017169318,0.0011614918,0.0018850807],"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.0003124829,0.00013159189,0.00087001413,0.00016646757,0.000104564504,0.00015664929,0.00009674178,0.468971,0.022648932,0.007390738,0.0075266385,0.49162418],"study_design_scores_gemma":[0.0000035815626,0.000013745253,0.00011817376,0.0000051905886,0.000005801244,0.000029290535,0.000007404973,0.99495417,0.0017695992,0.0025811745,0.0005079249,0.0000039858664],"about_ca_topic_score_codex":0.007229655,"about_ca_topic_score_gemma":0.010640793,"teacher_disagreement_score":0.007229655,"about_ca_system_score_codex":0.00079265016,"about_ca_system_score_gemma":0.00075695454,"threshold_uncertainty_score":0.015336573},"labels":[],"label_agreement":null},{"id":"W3109475013","doi":"10.1007/978-3-030-58598-3_42","title":"Vectorizing World Buildings: Planar Graph Reconstruction by Primitive Detection and Relationship Inference","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Computer science; Convolutional neural network; Inference; Graph; Artificial intelligence; Benchmark (surveying); RGB color model; Theoretical computer science; Computer vision","score_opus":0.014264601294327509,"score_gpt":0.22134305051709996,"score_spread":0.20707844922277246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109475013","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.0030699663,0.00016596666,0.9940102,0.00005819614,0.000019042358,0.000028699325,0.00019929602,0.0016228269,0.00082589284],"genre_scores_gemma":[0.067028314,0.0005935727,0.92577004,0.000059436647,0.00004177024,0.00006190745,0.0019226948,0.0007217402,0.0038004774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994179,0.00009261933,0.000021915364,0.0001895838,0.00021035389,0.00006758891],"domain_scores_gemma":[0.9993773,0.00025359477,0.000047682315,0.00019000871,0.000101945356,0.00002944615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047560714,0.0015303232,0.0018095572,0.0018966601,0.0003987907,0.0017727738,0.0035658046,0.0015179955,0.0070565445],"category_scores_gemma":[0.0018215835,0.0019853862,0.0018132319,0.0034018185,0.0008674275,0.0019110325,0.0018783289,0.0021934563,0.004571752],"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.00010918552,0.00008477741,0.00048344696,0.0002164636,0.000092931994,0.00008557786,0.00008124401,0.26211238,0.010755167,0.012390721,0.00912245,0.7044656],"study_design_scores_gemma":[0.000008801111,0.000017138109,0.00020038326,0.0000082316255,0.000013660918,0.000065140026,0.000027418899,0.9819452,0.0028478412,0.012546363,0.00230581,0.000013863638],"about_ca_topic_score_codex":0.011118101,"about_ca_topic_score_gemma":0.019699255,"teacher_disagreement_score":0.011118101,"about_ca_system_score_codex":0.0006315377,"about_ca_system_score_gemma":0.0011826392,"threshold_uncertainty_score":0.02360648},"labels":[],"label_agreement":null},{"id":"W3109948023","doi":"10.1007/978-3-030-63007-2_60","title":"Towards a Context-Aware Knowledge Model for Smart Service Systems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Context (archaeology); Service model; Service (business); Software engineering; Human–computer interaction; World Wide Web","score_opus":0.059836687757828765,"score_gpt":0.27637144022799276,"score_spread":0.216534752470164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109948023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005303835,0.0003103291,0.9889936,0.00047808728,0.00005269201,0.00009130431,0.0003941263,0.0010278104,0.003348232],"genre_scores_gemma":[0.2560468,0.001084882,0.7351669,0.0003859947,0.00010013115,0.000370356,0.0018188483,0.00023015638,0.0047958903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988249,0.00021133728,0.00016116454,0.00029480705,0.000386984,0.00012076873],"domain_scores_gemma":[0.998953,0.0003117109,0.00009431459,0.0002597088,0.00028150395,0.00009975152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011062194,0.0007033491,0.001004949,0.0015998031,0.0008494836,0.0044710683,0.0025428375,0.001726284,0.002340276],"category_scores_gemma":[0.0032728657,0.00072076416,0.0015924135,0.0018800176,0.0010550136,0.0074868253,0.0029360726,0.0027390043,0.0012269007],"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.00017669688,0.0003623503,0.0020629065,0.00046332408,0.00018511298,0.00056216575,0.0012743449,0.23283474,0.008656459,0.5163446,0.009137491,0.22793984],"study_design_scores_gemma":[0.000013919163,0.00003579037,0.0003552853,0.00010694706,0.000079892976,0.0001418764,0.00021752337,0.7590463,0.0027686623,0.21824063,0.018962212,0.000030996915],"about_ca_topic_score_codex":0.011537641,"about_ca_topic_score_gemma":0.013250631,"teacher_disagreement_score":0.011537641,"about_ca_system_score_codex":0.0013602497,"about_ca_system_score_gemma":0.0021722824,"threshold_uncertainty_score":0.022940993},"labels":[],"label_agreement":null},{"id":"W3109991383","doi":"10.1007/978-3-030-58536-5_36","title":"V2VNet: Vehicle-to-Vehicle Communication for Joint Perception and Prediction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":449,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Viewpoints; Perception; Artificial intelligence; Bandwidth (computing); Joint (building); Feature (linguistics); Computer vision; Range (aeronautics); Real-time computing; Telecommunications; Engineering","score_opus":0.03757137983663022,"score_gpt":0.2797818468397802,"score_spread":0.24221046700314997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109991383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049213427,0.0010005578,0.9722239,0.00015344593,0.0006782786,0.000071493654,0.00089982175,0.010313762,0.009737459],"genre_scores_gemma":[0.41778165,0.0021143637,0.506105,0.00044260867,0.00057323993,0.00048990233,0.008888494,0.001966824,0.06163798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996234,0.000057575577,0.000014879342,0.00010586781,0.00014414465,0.00005404306],"domain_scores_gemma":[0.9997757,0.0000727029,0.000010895636,0.00006067884,0.00006168644,0.000018346602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044117597,0.001234465,0.000979696,0.0004902911,0.00037490905,0.0010883289,0.00215625,0.0009854537,0.013276812],"category_scores_gemma":[0.001061894,0.0003807817,0.00033206344,0.0008072632,0.00031741196,0.0012755345,0.0014878722,0.0010103129,0.0042565693],"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.0006189415,0.00014955917,0.00048371,0.00022552547,0.0000935425,0.0001606194,0.000069536094,0.1395086,0.014261881,0.017039843,0.11370176,0.7136864],"study_design_scores_gemma":[0.000038422662,0.00007732739,0.00023036389,0.000025612078,0.0000115008625,0.00008347048,0.000018742057,0.95198745,0.0077058445,0.011113053,0.02868915,0.000019037203],"about_ca_topic_score_codex":0.00571372,"about_ca_topic_score_gemma":0.0057033896,"teacher_disagreement_score":0.013276812,"about_ca_system_score_codex":0.00038104574,"about_ca_system_score_gemma":0.0007481677,"threshold_uncertainty_score":0.044415355},"labels":[],"label_agreement":null},{"id":"W3110112816","doi":"10.1007/978-3-030-63000-3_13","title":"Line Reconfiguration by Programmable Particles Maintaining Connectivity","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"Carleton University","funders":"","keywords":"Computer science; Control reconfiguration; Line (geometry); Node (physics); Grid; Plane (geometry); Basis (linear algebra); Algorithm; Topology (electrical circuits); Distributed computing; Mathematics; Geometry; Physics; Combinatorics; Embedded system","score_opus":0.021895485403527787,"score_gpt":0.23094627219307295,"score_spread":0.20905078678954517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110112816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10103818,0.00032864686,0.86313045,0.00017458173,0.00017861396,0.000063018495,0.00009285646,0.0027695065,0.032224145],"genre_scores_gemma":[0.89270854,0.00020209023,0.091448806,0.00008072574,0.00004140823,0.000091229784,0.00014641944,0.00020702378,0.015073897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991405,0.000016225025,0.0000039242927,0.0000309125,0.000020928253,0.0000138402265],"domain_scores_gemma":[0.9998418,0.000044499022,0.000026560001,0.000051796454,0.000018216562,0.000017017785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079802274,0.00035497028,0.0002832159,0.0003316528,0.00032999853,0.0007261958,0.00078717934,0.00043321852,0.004804688],"category_scores_gemma":[0.0003351098,0.00018735924,0.00019994634,0.0004956505,0.00042439112,0.00078090274,0.00053815794,0.00038996057,0.0008799256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007468453,0.00015350613,0.00067761674,0.00020670194,0.00006292697,0.0004232127,0.00027483972,0.4464137,0.14520366,0.06426974,0.009029579,0.33253765],"study_design_scores_gemma":[0.00008872959,0.00028939513,0.0003833756,0.000015398347,0.000025212365,0.00023421134,0.00006577155,0.92944384,0.030554252,0.026243469,0.012628107,0.000028097551],"about_ca_topic_score_codex":0.00042438775,"about_ca_topic_score_gemma":0.00044714918,"teacher_disagreement_score":0.004804688,"about_ca_system_score_codex":0.00026288666,"about_ca_system_score_gemma":0.00009826465,"threshold_uncertainty_score":0.016073346},"labels":[],"label_agreement":null},{"id":"W3110299726","doi":"10.1007/978-3-030-58589-1_18","title":"DR-KFS: A Differentiable Visual Similarity Metric for 3D Shape Reconstruction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Simon Fraser University","funders":"","keywords":"Artificial intelligence; Similarity (geometry); Metric (unit); Computer science; Differentiable function; Distortion (music); Pattern recognition (psychology); Computer vision; Pixel; Mathematics; Image (mathematics); Mathematical analysis","score_opus":0.024061709317751125,"score_gpt":0.28545331093420806,"score_spread":0.2613916016164569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110299726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015738227,0.00018106955,0.99660623,0.00005086216,0.00004534624,0.000019729912,0.000109814915,0.00070758496,0.0007055722],"genre_scores_gemma":[0.08178123,0.0007012385,0.90859294,0.00018470567,0.00010569171,0.000101658436,0.0010524604,0.00087936904,0.006600704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998879,0.00018712731,0.00007114307,0.00019178099,0.00062074343,0.000050233008],"domain_scores_gemma":[0.99904245,0.00021021512,0.00008674815,0.00026262784,0.00032139992,0.000076579716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008967039,0.00075545424,0.0012989554,0.0015980463,0.0003309011,0.0015517791,0.0019150678,0.0013894935,0.0057008183],"category_scores_gemma":[0.003198116,0.00040605446,0.0010810976,0.0018850053,0.0008115357,0.002523759,0.0023633095,0.001813413,0.0034949242],"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.00020110307,0.00008183273,0.00031631076,0.0002471099,0.000053645723,0.0001012359,0.000108181375,0.05998678,0.036835037,0.054935668,0.013087262,0.8340458],"study_design_scores_gemma":[0.000017176273,0.00012572132,0.00040788748,0.000031953092,0.00001509612,0.00046235998,0.000037243546,0.9289544,0.014623118,0.03692046,0.018357,0.000047542995],"about_ca_topic_score_codex":0.002425429,"about_ca_topic_score_gemma":0.0022655528,"teacher_disagreement_score":0.0057008183,"about_ca_system_score_codex":0.0006988741,"about_ca_system_score_gemma":0.000736338,"threshold_uncertainty_score":0.019071162},"labels":[],"label_agreement":null},{"id":"W3110418800","doi":"10.1007/978-3-030-64694-3_4","title":"Reusable Formal Models for Threat Specification, Detection, and Treatment","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Software engineering; Software security assurance; Formal specification; Formal methods; Security engineering; Component (thermodynamics); Component-based software engineering; Software development; Computer security; Software; Information security; Security service; Programming language","score_opus":0.06394911561408247,"score_gpt":0.2752144986183782,"score_spread":0.21126538300429576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110418800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015007562,0.00028232817,0.9900649,0.0005527543,0.000056622015,0.0001634899,0.00027170067,0.0018125379,0.005294886],"genre_scores_gemma":[0.08683558,0.0010042118,0.89418226,0.0003362102,0.00013011711,0.00079691235,0.0016478389,0.0010090016,0.014057883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945716,0.002081471,0.0006710512,0.0005489065,0.0018123775,0.00031458974],"domain_scores_gemma":[0.9867605,0.006235604,0.0010671178,0.004448195,0.001252771,0.00023576435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005744342,0.0017869336,0.00084552256,0.002256651,0.001016614,0.005590596,0.0042818524,0.0024461686,0.008381412],"category_scores_gemma":[0.017699767,0.0016904168,0.0020506217,0.0014804383,0.002571246,0.0065217796,0.0025489973,0.0036437823,0.0029652216],"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.000046287183,0.00011523588,0.00034672229,0.00024778733,0.00004389878,0.00014272543,0.0005059696,0.044608444,0.0021693313,0.8817102,0.006893791,0.06316974],"study_design_scores_gemma":[0.00005600616,0.00007094665,0.00016656848,0.0003960552,0.00010886554,0.00024931598,0.00017293493,0.24318731,0.006280824,0.66513795,0.08409931,0.00007395436],"about_ca_topic_score_codex":0.00639788,"about_ca_topic_score_gemma":0.008786282,"teacher_disagreement_score":0.008381412,"about_ca_system_score_codex":0.0026754518,"about_ca_system_score_gemma":0.0048871166,"threshold_uncertainty_score":0.030379355},"labels":[],"label_agreement":null},{"id":"W3111025744","doi":"10.1007/978-3-030-88210-5_5","title":"Conditional Generation of Medical Images via Disentangled Adversarial Inference","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Université de Montréal","funders":"","keywords":"Computer science; Inference; Regularization (linguistics); Adversarial system; Artificial intelligence; Image (mathematics); Content (measure theory); Machine learning; Algorithm; Mathematics","score_opus":0.02258513356379293,"score_gpt":0.26399085297556135,"score_spread":0.24140571941176842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111025744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030859571,0.00017482054,0.9948407,0.00021561285,0.0000398506,0.00003492698,0.00012621572,0.00048807077,0.0009939212],"genre_scores_gemma":[0.4118394,0.0008555517,0.57172364,0.0006570173,0.00020981238,0.00031612377,0.0014503276,0.00055487826,0.012393204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958605,0.00013180434,0.000016316824,0.000097439886,0.00012933344,0.00003905843],"domain_scores_gemma":[0.9986934,0.0009054839,0.00008691439,0.00017095839,0.00009870825,0.000044540284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011992634,0.00077681727,0.0007473415,0.0005860888,0.00017892114,0.0009173423,0.0014268876,0.0013391797,0.0038882738],"category_scores_gemma":[0.0037080771,0.0009053965,0.0012403552,0.00052178476,0.00083,0.00093325507,0.002216744,0.0020721506,0.0013523593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021092969,0.000064135485,0.00038605573,0.00016122569,0.000093375515,0.00024509913,0.00007331261,0.80298847,0.01224477,0.03764389,0.0059011066,0.13998766],"study_design_scores_gemma":[0.000008872202,0.000016392489,0.000068664645,0.00000847632,0.000007461403,0.00008078152,0.000002540683,0.98730963,0.0017442195,0.010102324,0.0006444808,0.0000062289346],"about_ca_topic_score_codex":0.0011797751,"about_ca_topic_score_gemma":0.0015094775,"teacher_disagreement_score":0.0038882738,"about_ca_system_score_codex":0.0005783841,"about_ca_system_score_gemma":0.00060225424,"threshold_uncertainty_score":0.013007581},"labels":[],"label_agreement":null},{"id":"W3111046435","doi":"10.1007/978-3-030-78191-0_40","title":"Teach Me to Segment with Mixed Supervision: Confident Students Become Masters","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Segmentation; Pixel; Computer science; Kullback–Leibler divergence; Entropy (arrow of time); Artificial intelligence; Divergence (linguistics); Market segmentation; Minification; Pattern recognition (psychology); Machine learning","score_opus":0.018917922523192326,"score_gpt":0.29204038906765867,"score_spread":0.27312246654446637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111046435","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.92172337,0.00045571916,0.018895313,0.015536936,0.0012312365,0.0002625034,0.0003602671,0.0027338942,0.038800873],"genre_scores_gemma":[0.9598911,0.00022647702,0.01335715,0.0018142965,0.00022182707,0.00018402988,0.0004099139,0.00021556842,0.02367965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933124,0.00017422062,0.000016980162,0.00014740393,0.00016236948,0.00016779403],"domain_scores_gemma":[0.99133813,0.001382652,0.000711243,0.00068494753,0.0007704664,0.005112628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017261559,0.00046149277,0.00032882713,0.00022602799,0.0008597104,0.0017639827,0.0008103572,0.0011679778,0.01825461],"category_scores_gemma":[0.012246252,0.0003608548,0.00033764238,0.00014405463,0.00038189997,0.0019194055,0.002344565,0.0025478667,0.007542599],"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.0028501905,0.009253991,0.0652754,0.00024311629,0.0000792036,0.0007094949,0.0071116514,0.0021745875,0.01912609,0.0036035746,0.21316896,0.67640376],"study_design_scores_gemma":[0.0023880089,0.022682423,0.29356095,0.0010236185,0.0006652376,0.0044891336,0.032379225,0.075608365,0.10421093,0.10959752,0.35278574,0.00060882955],"about_ca_topic_score_codex":0.00054423715,"about_ca_topic_score_gemma":0.0020795995,"teacher_disagreement_score":0.01825461,"about_ca_system_score_codex":0.00042655377,"about_ca_system_score_gemma":0.0015979391,"threshold_uncertainty_score":0.06106776},"labels":[],"label_agreement":null},{"id":"W3111179841","doi":"10.1007/978-3-030-64330-0_3","title":"Identifying and Analyzing Implicit Interactions in a Wastewater Dechlorination System","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Carleton University","funders":"","keywords":"Computer science; Resilience (materials science); Stability (learning theory); Risk analysis (engineering); Software; Systems engineering; Software engineering; Machine learning; Programming language","score_opus":0.02186539925350545,"score_gpt":0.26256190693578424,"score_spread":0.2406965076822788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111179841","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.97944355,0.000058687492,0.018514186,0.00006290373,0.000007620848,0.000023212358,0.00013480542,0.0002922199,0.0014628771],"genre_scores_gemma":[0.9932191,0.000020911088,0.0050584166,0.000010926715,0.0000021864166,0.000009224781,0.00012588386,0.000020197023,0.0015332855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996568,0.00006265214,0.00001981459,0.00007744279,0.00012522502,0.000058039157],"domain_scores_gemma":[0.99887735,0.0007123226,0.00013179446,0.000073422685,0.00016018678,0.00004490949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031430367,0.00034671224,0.00039559838,0.0004799631,0.0006374755,0.00072601135,0.000613874,0.0006532665,0.0014912816],"category_scores_gemma":[0.0011155843,0.00023025807,0.00021589652,0.00038367874,0.00029241838,0.00061479677,0.00065638975,0.0004769719,0.0002777178],"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.003166902,0.0013301183,0.16893384,0.00040120175,0.00020599959,0.0019034267,0.0016138237,0.27266392,0.2775734,0.0032591913,0.002109312,0.26683888],"study_design_scores_gemma":[0.000021303553,0.00041954388,0.042984188,0.00000888653,0.0000545411,0.00014943114,0.0004503165,0.90967023,0.043438897,0.0015170432,0.00125458,0.000030989835],"about_ca_topic_score_codex":0.008022293,"about_ca_topic_score_gemma":0.011292667,"teacher_disagreement_score":0.008022293,"about_ca_system_score_codex":0.00062184426,"about_ca_system_score_gemma":0.0005816019,"threshold_uncertainty_score":0.015951216},"labels":[],"label_agreement":null},{"id":"W31112237","doi":"10.1007/978-3-642-34123-6_18","title":"Diagnose the Premalignant Pancreatic Cancer Using High Dimensional Linear Machine","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Medicine; Pancreatic cancer; Cancer; Computer science; Internal medicine","score_opus":0.019931380534478543,"score_gpt":0.28357806821966847,"score_spread":0.26364668768518995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31112237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17760435,0.0098959105,0.79598475,0.0020701664,0.00044461113,0.00027525326,0.0014439725,0.004311927,0.007969006],"genre_scores_gemma":[0.4391725,0.0044190595,0.5412952,0.0009058579,0.00032867293,0.00017129668,0.0027211537,0.00015508843,0.010831127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998178,0.000026219213,0.00001686285,0.000050120027,0.000057607645,0.000031500374],"domain_scores_gemma":[0.9998523,0.0000642294,0.000014402903,0.00001410579,0.000042185704,0.000012769942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559549,0.0008138942,0.0005753875,0.0009900663,0.00027841373,0.00080999936,0.00059300207,0.0009406319,0.0017732108],"category_scores_gemma":[0.0006520427,0.0003062352,0.0007007669,0.00048330514,0.00020139341,0.0006544842,0.0005729574,0.00079274003,0.0015387777],"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.0002728248,0.00016827865,0.018617295,0.00029675697,0.000096129035,0.00082512083,0.00010184195,0.012540885,0.06594797,0.0010026882,0.009817573,0.8903127],"study_design_scores_gemma":[0.0000799595,0.00071313896,0.031598847,0.00017159691,0.00031648972,0.0060535874,0.0005050731,0.76665366,0.15767922,0.010520075,0.02555708,0.00015123631],"about_ca_topic_score_codex":0.0009129616,"about_ca_topic_score_gemma":0.0017609391,"teacher_disagreement_score":0.0017732108,"about_ca_system_score_codex":0.00017754424,"about_ca_system_score_gemma":0.00035875442,"threshold_uncertainty_score":0.0059319735},"labels":[],"label_agreement":null},{"id":"W3111738653","doi":"10.1007/978-3-030-64327-0_8","title":"Shape Completion by U-Net: An Approach to the AutoImplant MICCAI Cranial Implant Design Challenge","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dental Radiography and Imaging","field":"Dentistry","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 Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Artificial intelligence; Subtraction; Cosmesis; Hausdorff distance; Set (abstract data type); Pattern recognition (psychology); Mathematics","score_opus":0.03345803707356378,"score_gpt":0.2529961249120712,"score_spread":0.2195380878385074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111738653","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.0036948163,0.00090501306,0.985636,0.00030013573,0.00012086425,0.000046828347,0.00013591816,0.0006386838,0.008521776],"genre_scores_gemma":[0.07487122,0.0020947198,0.89612633,0.0002405795,0.00023474755,0.000114150374,0.00062215613,0.0008229023,0.024873203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993019,0.00013506258,0.000031846466,0.00013890558,0.00032929928,0.00006302559],"domain_scores_gemma":[0.9993168,0.0003365386,0.000034781835,0.0001406251,0.00012180084,0.00004945193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011585746,0.0009684995,0.0014644754,0.00085534994,0.00073201867,0.0021716591,0.0027275418,0.0017298342,0.010496809],"category_scores_gemma":[0.0018100111,0.000875295,0.0019193963,0.0013861946,0.0010011409,0.0020525574,0.002886029,0.0023169464,0.0027460377],"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.0001661049,0.0001155702,0.00041352402,0.00046915334,0.00006271069,0.00025804125,0.0002067012,0.17866203,0.008915477,0.16956493,0.024677843,0.616488],"study_design_scores_gemma":[0.0000156006,0.00008816378,0.00018711432,0.00006557239,0.000015106424,0.00029775265,0.0000907876,0.8216321,0.003940252,0.135801,0.037838392,0.000028160142],"about_ca_topic_score_codex":0.002839523,"about_ca_topic_score_gemma":0.00329865,"teacher_disagreement_score":0.010496809,"about_ca_system_score_codex":0.0007634654,"about_ca_system_score_gemma":0.0010258582,"threshold_uncertainty_score":0.0351153},"labels":[],"label_agreement":null},{"id":"W3111910297","doi":"10.1007/978-3-642-22300-6","title":"Algorithms and Data Structures","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data structure; Theoretical computer science; Programming language","score_opus":0.03499058993141908,"score_gpt":0.27945401055225794,"score_spread":0.24446342062083887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111910297","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027339873,0.04905748,0.70054585,0.003162094,0.0037097943,0.00019925558,0.0013757168,0.004167777,0.2350481],"genre_scores_gemma":[0.050974187,0.05626008,0.49077883,0.002175392,0.0048652985,0.0007862029,0.005219263,0.0036279568,0.38531277],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849296,0.00020097528,0.00012450856,0.00026630054,0.0008439327,0.00007137049],"domain_scores_gemma":[0.9987822,0.000418962,0.00004360776,0.0004983677,0.00021373267,0.000043201155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007774686,0.0019214108,0.0019924187,0.0028706533,0.0012018707,0.004741697,0.0018729726,0.0011829366,0.038805235],"category_scores_gemma":[0.0028284988,0.0010803615,0.0011578156,0.008136033,0.0024312378,0.006900465,0.0023586047,0.004061644,0.031738285],"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.000028894814,0.000038792547,0.00010950507,0.0006342804,0.000038534516,0.000046136407,0.0001951774,0.002596733,0.0016024224,0.3866347,0.120233946,0.4878408],"study_design_scores_gemma":[0.000017018943,0.000031584594,0.00020473365,0.00019900064,0.000030411418,0.0003506723,0.000054020573,0.0071940487,0.0019761724,0.52365136,0.46626756,0.000023380459],"about_ca_topic_score_codex":0.0006177409,"about_ca_topic_score_gemma":0.0007094368,"teacher_disagreement_score":0.038805235,"about_ca_system_score_codex":0.0014154919,"about_ca_system_score_gemma":0.0013615289,"threshold_uncertainty_score":0.12981647},"labels":[],"label_agreement":null},{"id":"W3111992288","doi":"10.1007/978-3-030-64843-5_36","title":"Cutting Stock with Rotation: Packing Square Items into Square Bins","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Manitoba","funders":"","keywords":"Square (algebra); Computer science; Rotation (mathematics); Algorithm; Artificial intelligence; Mathematics; Geometry","score_opus":0.015159298363094247,"score_gpt":0.2222894581413716,"score_spread":0.20713015977827737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111992288","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.036063775,0.005409105,0.8787733,0.00032128245,0.0007801065,0.00024064827,0.0003700957,0.0023989086,0.075642824],"genre_scores_gemma":[0.17724855,0.0052714273,0.75217205,0.00019888674,0.00021099327,0.00017219126,0.00081674237,0.0009917394,0.06291737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973375,0.000029130551,0.000013139337,0.000057633242,0.00012133623,0.000045003155],"domain_scores_gemma":[0.9998884,0.00003335121,0.00001072052,0.000035333498,0.00002026377,0.0000119495035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023221473,0.001294201,0.0010601293,0.0006565048,0.00040999093,0.0012159437,0.0017082773,0.0007323219,0.017776301],"category_scores_gemma":[0.00056417927,0.0010603762,0.0009551798,0.0030775606,0.0007378155,0.0019020005,0.0012161382,0.0011445753,0.0049141813],"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.00048319466,0.00011596335,0.00036261935,0.0007376117,0.000052879503,0.00024116847,0.0001668624,0.095752515,0.033544928,0.051599797,0.024907686,0.79203475],"study_design_scores_gemma":[0.00017054165,0.00074907736,0.0021559289,0.00015682471,0.00016057341,0.0017536514,0.00026896255,0.65852845,0.04672749,0.14442907,0.14476633,0.0001331566],"about_ca_topic_score_codex":0.002668133,"about_ca_topic_score_gemma":0.0029962684,"teacher_disagreement_score":0.017776301,"about_ca_system_score_codex":0.0005610973,"about_ca_system_score_gemma":0.0007138899,"threshold_uncertainty_score":0.059467673},"labels":[],"label_agreement":null},{"id":"W3112099004","doi":"10.1007/978-3-030-64559-5_3","title":"Image Categorization Using Agglomerative Clustering Based Smoothed Dirichlet Mixtures","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Hierarchical clustering; Cluster analysis; Artificial intelligence; Categorization; Pattern recognition (psychology); Robustness (evolution); Dirichlet distribution; Metric (unit); Divergence (linguistics); Machine learning; Mathematics","score_opus":0.02548097859121622,"score_gpt":0.26728823803479695,"score_spread":0.24180725944358072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112099004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01253373,0.00060090283,0.9851171,0.00008007958,0.000050688195,0.00006385116,0.000058739533,0.0008666363,0.0006283202],"genre_scores_gemma":[0.23882549,0.0006611502,0.7503953,0.00019527225,0.0001665069,0.00028107045,0.000770403,0.00070316717,0.008001631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967333,0.00093389925,0.00022093444,0.0009167343,0.00090150145,0.00029371117],"domain_scores_gemma":[0.99720216,0.0012146865,0.00015311479,0.0005383348,0.0007831291,0.000108559936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030421633,0.0010706241,0.0031617098,0.003639668,0.0022195787,0.0027978187,0.0031340832,0.002492019,0.0023062837],"category_scores_gemma":[0.0049559344,0.0012150366,0.0040268,0.0039758845,0.0016118805,0.0033641912,0.0025145365,0.0024194114,0.0023766558],"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.001120695,0.00042624175,0.0020309845,0.00042202903,0.00057001726,0.00019122014,0.0010025465,0.22023416,0.036262117,0.037462734,0.0086027775,0.6916744],"study_design_scores_gemma":[0.0000123909285,0.000042218548,0.00040934648,0.000009961576,0.000050723556,0.00008971801,0.00006378836,0.9763806,0.0054159416,0.016209882,0.0012769509,0.00003856501],"about_ca_topic_score_codex":0.009775938,"about_ca_topic_score_gemma":0.011262352,"teacher_disagreement_score":0.009775938,"about_ca_system_score_codex":0.0021166198,"about_ca_system_score_gemma":0.0013566898,"threshold_uncertainty_score":0.019438088},"labels":[],"label_agreement":null},{"id":"W3113424924","doi":"10.1007/978-3-030-61792-9_25","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2020,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotone polygon; Clique; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Discrete mathematics; Function (biology); Generalization; Boolean function","score_opus":0.03200032741610515,"score_gpt":0.23597260365970743,"score_spread":0.20397227624360229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113424924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08625239,0.0050412696,0.73675483,0.005508568,0.0008593535,0.00044966335,0.0022920957,0.0023790004,0.1604628],"genre_scores_gemma":[0.7897599,0.005109843,0.15347657,0.0035086363,0.0017618537,0.00076928776,0.0024753914,0.0016815965,0.041456964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715245,0.0004967385,0.000108278975,0.0006342345,0.0010849641,0.0005232813],"domain_scores_gemma":[0.98796356,0.008781473,0.0006205679,0.0013195628,0.0007286019,0.0005863353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028573286,0.0034092518,0.002660189,0.0030686753,0.0017025386,0.00477638,0.0056775287,0.0028644009,0.030122008],"category_scores_gemma":[0.017214358,0.0015841986,0.003444182,0.003265296,0.0027716628,0.011285435,0.006314358,0.008230297,0.0027428116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071383757,0.00029662275,0.00065660966,0.00083639205,0.00019978044,0.00022188164,0.0002933829,0.093502246,0.008310554,0.7865267,0.023002932,0.08543921],"study_design_scores_gemma":[0.00006545913,0.00011055866,0.00027584223,0.000096938114,0.00009954252,0.00009719564,0.00003554728,0.114923455,0.0026827762,0.87590504,0.0056697745,0.000037892787],"about_ca_topic_score_codex":0.0016919586,"about_ca_topic_score_gemma":0.0024506408,"teacher_disagreement_score":0.030122008,"about_ca_system_score_codex":0.003740948,"about_ca_system_score_gemma":0.001405326,"threshold_uncertainty_score":0.10076815},"labels":[],"label_agreement":null},{"id":"W3113563511","doi":"10.1007/978-3-030-01258-8_25","title":"End-to-End Deep Structured Models for Drawing Crosswalks","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Schema crosswalk; Leverage (statistics); Computer science; Lidar; Artificial intelligence; Convolutional neural network; Pedestrian; Computer vision; Automation; Geography; Remote sensing; Transport engineering; Engineering","score_opus":0.01708518583944227,"score_gpt":0.2699851509327337,"score_spread":0.2528999650932914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113563511","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.0068912795,0.00017796324,0.97944564,0.00018878981,0.000107929656,0.00009376662,0.0010612077,0.010470863,0.0015625677],"genre_scores_gemma":[0.18276367,0.00046753322,0.7918253,0.0005227167,0.000120001714,0.00033180206,0.0092622,0.0031413594,0.011565484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937314,0.000065428554,0.000031082433,0.00027015715,0.00016597206,0.00009428778],"domain_scores_gemma":[0.99889946,0.00030783965,0.000058974136,0.00036747786,0.00021991016,0.0001462773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058974535,0.003336214,0.0023338823,0.0012483905,0.00085550285,0.00325388,0.0051116967,0.003941655,0.019561674],"category_scores_gemma":[0.0033400103,0.002454667,0.0031319908,0.001594785,0.0007823525,0.0029696797,0.0037637325,0.006078991,0.009407083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037687237,0.00024510917,0.0008776278,0.00020025471,0.00016784407,0.00019184177,0.00013730019,0.6497217,0.006826426,0.011238951,0.024175968,0.30584016],"study_design_scores_gemma":[0.000010749903,0.000017476626,0.00003454819,0.000010495005,0.0000062654913,0.000017559625,0.000011131078,0.99228036,0.0011764832,0.0052975966,0.0011304056,0.0000069661955],"about_ca_topic_score_codex":0.014256333,"about_ca_topic_score_gemma":0.03729818,"teacher_disagreement_score":0.019561674,"about_ca_system_score_codex":0.0014235664,"about_ca_system_score_gemma":0.0020856059,"threshold_uncertainty_score":0.06544036},"labels":[],"label_agreement":null},{"id":"W3114606521","doi":"10.1007/978-3-030-65955-4_13","title":"Formal Verification of a Certified Policy Language","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Mathematical proof; Security policy; Certification; Enforcement; Semantics (computer science); Exploit; Programming language; Computer security; Operational semantics; Access control; Computer security model; Formal verification; Law","score_opus":0.022798385617488693,"score_gpt":0.2955412972925517,"score_spread":0.272742911675063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114606521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010145876,0.00006613642,0.97532314,0.0006519437,0.00018586169,0.00021237896,0.0002503892,0.0047496245,0.008414492],"genre_scores_gemma":[0.38988057,0.00019952618,0.5936294,0.00062929577,0.00015541396,0.00041605474,0.000801011,0.001401737,0.012886938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99341995,0.0020903891,0.00044901267,0.00076910877,0.0024494708,0.0008220046],"domain_scores_gemma":[0.9789002,0.014601865,0.00077296555,0.0028819873,0.0025691711,0.0002738244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006169711,0.0006398009,0.00069974153,0.0010046345,0.0014825333,0.005178079,0.0033001897,0.0016257307,0.008531782],"category_scores_gemma":[0.021276789,0.0011085643,0.0017996347,0.0007593503,0.0049289376,0.0055365954,0.0031150675,0.0031013372,0.0020065457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020074686,0.00024110537,0.00063322054,0.0003547553,0.00004834152,0.00040718188,0.00053248124,0.037418872,0.010816073,0.87704086,0.007858287,0.06444804],"study_design_scores_gemma":[0.0002548146,0.00014226648,0.00019408071,0.00022637434,0.000117840966,0.0003095727,0.00022663148,0.3851908,0.054564983,0.5203071,0.03837745,0.00008801446],"about_ca_topic_score_codex":0.0070748036,"about_ca_topic_score_gemma":0.006708999,"teacher_disagreement_score":0.008531782,"about_ca_system_score_codex":0.0028318,"about_ca_system_score_gemma":0.009425252,"threshold_uncertainty_score":0.032628894},"labels":[],"label_agreement":null},{"id":"W3114813405","doi":"10.1007/978-3-030-64694-3_15","title":"How Does Library Migration Impact Software Quality and Comprehension? An Empirical Study","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software quality; Software engineering; Software development; Software peer review; Software quality analyst; Software quality control; Software; Quality (philosophy); Personal software process; Readability; World Wide Web; Software construction; Operating system; Programming language","score_opus":0.044024959112230644,"score_gpt":0.3310284279706528,"score_spread":0.28700346885842215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114813405","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.9990233,0.00004652473,0.00012618436,0.00006508819,0.0000022649801,0.000010544287,0.000035005654,0.000015364585,0.0006757879],"genre_scores_gemma":[0.9986815,0.000056227225,0.00022391522,0.0000571325,0.000009699246,0.000019832369,0.00009495537,0.000019899151,0.00083697744],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9950058,0.0023952848,0.00042321888,0.0004915754,0.0012888302,0.0003952806],"domain_scores_gemma":[0.801133,0.14592436,0.032034483,0.005240054,0.010094883,0.0055731754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006962177,0.00036749354,0.0006282703,0.001698923,0.0008235552,0.0026993707,0.00080998667,0.0012643478,0.004866854],"category_scores_gemma":[0.07500073,0.00043667914,0.00065704534,0.0019653076,0.0011242148,0.003742932,0.0014836447,0.0015717706,0.0011093629],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015799479,0.0061988737,0.9204987,0.00022537973,0.00014218804,0.00034330433,0.030076995,0.00046505456,0.0024344863,0.0003172068,0.0010267567,0.036691003],"study_design_scores_gemma":[0.00008929509,0.0031399638,0.9703789,0.00007323364,0.00016809002,0.00026452975,0.019528113,0.0019596608,0.0023971703,0.0006266428,0.0013175426,0.000056836983],"about_ca_topic_score_codex":0.0039613764,"about_ca_topic_score_gemma":0.0038017463,"teacher_disagreement_score":0.006962177,"about_ca_system_score_codex":0.0012244111,"about_ca_system_score_gemma":0.0013214357,"threshold_uncertainty_score":0.036819994},"labels":[],"label_agreement":null},{"id":"W3114893254","doi":"10.1007/978-3-030-66172-4_21","title":"Privacy Preserving Netting Protocol for Inter-bank Payments","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and 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":"Concordia University","funders":"","keywords":"Netting; Computer science; Payment; Protocol (science); Computer security; World Wide Web; Finance; Business","score_opus":0.0292348931266388,"score_gpt":0.29314052070407354,"score_spread":0.26390562757743474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114893254","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.025595758,0.0005916515,0.93749934,0.0012005547,0.0004996113,0.00045684332,0.0005235927,0.0012183127,0.032414388],"genre_scores_gemma":[0.6754053,0.0010892132,0.24756932,0.0004629907,0.00026859678,0.00074716663,0.0011945476,0.0002826475,0.07298012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783653,0.00061650487,0.00018071171,0.00032046318,0.0007839569,0.00026183398],"domain_scores_gemma":[0.9975781,0.0008206639,0.0001334782,0.0010402894,0.00030307076,0.00012448254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021622747,0.00057816395,0.0008901559,0.0006041935,0.0016107345,0.0027949575,0.0018402254,0.0019475558,0.0073958207],"category_scores_gemma":[0.0037924498,0.00040003005,0.000556499,0.0013439064,0.001408959,0.0048466055,0.0028189244,0.0040053255,0.0020741157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005950035,0.00018349844,0.00024725523,0.00027008742,0.00003281442,0.0003762021,0.00036117074,0.022535155,0.013459925,0.8156313,0.008081802,0.1382258],"study_design_scores_gemma":[0.00015653664,0.00021128789,0.00024615965,0.00009160994,0.00006131788,0.00057957275,0.000096223914,0.18038747,0.034584805,0.7332285,0.050288077,0.00006841619],"about_ca_topic_score_codex":0.0005062982,"about_ca_topic_score_gemma":0.0004874069,"teacher_disagreement_score":0.0073958207,"about_ca_system_score_codex":0.0011696122,"about_ca_system_score_gemma":0.0022269704,"threshold_uncertainty_score":0.02474153},"labels":[],"label_agreement":null},{"id":"W3114997257","doi":"10.1007/978-3-030-65847-2_3","title":"Superimposition: Augmenting Machine Learning Outputs with Conceptual Models for Explainable AI","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Memorial University of Newfoundland; HEC Montréal","funders":"","keywords":"Superimposition; Computer science; Artificial intelligence; Machine learning; Domain (mathematical analysis); Mathematics","score_opus":0.034230608920964446,"score_gpt":0.25495340429432556,"score_spread":0.22072279537336112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114997257","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.0058270036,0.00018498233,0.9777157,0.0004091171,0.00009325975,0.00005175536,0.0002857997,0.0059463214,0.009486069],"genre_scores_gemma":[0.20456655,0.0005669141,0.78016114,0.00026272607,0.00009025375,0.00015846586,0.0017099417,0.0015621466,0.010921877],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999393,0.00021566986,0.00002740136,0.0001498669,0.00018503038,0.000028989365],"domain_scores_gemma":[0.9976533,0.0015616074,0.00007368801,0.00055078015,0.00011964304,0.000040917606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009428428,0.00095294643,0.0004476445,0.00067482016,0.0002954243,0.0017994744,0.0019727787,0.0011127742,0.019082233],"category_scores_gemma":[0.006476808,0.0005117118,0.0014363081,0.0010048581,0.0012664878,0.0045819827,0.0031776284,0.0017916866,0.0036839147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002639585,0.00014800858,0.00096173934,0.00047508,0.00015143125,0.0004828137,0.0009391284,0.077748224,0.012979147,0.21002345,0.014253706,0.68157333],"study_design_scores_gemma":[0.00003253357,0.00006541473,0.00034435213,0.00006212159,0.000066825385,0.00015491103,0.00012042551,0.6001106,0.017039752,0.35450548,0.027463287,0.000034340257],"about_ca_topic_score_codex":0.0013407808,"about_ca_topic_score_gemma":0.0019731536,"teacher_disagreement_score":0.019082233,"about_ca_system_score_codex":0.00047376892,"about_ca_system_score_gemma":0.00046637724,"threshold_uncertainty_score":0.063836396},"labels":[],"label_agreement":null},{"id":"W3115382655","doi":"10.1007/978-3-030-64556-4_23","title":"Hierarchical Action Classification with Network Pruning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Preprocessor; Robustness (evolution); Pruning; RGB color model; Machine learning; Pattern recognition (psychology); Focus (optics)","score_opus":0.041391276407785324,"score_gpt":0.2597774989240755,"score_spread":0.21838622251629014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115382655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024394598,0.0016818789,0.9539505,0.00057343947,0.00026148724,0.00023999468,0.0010551017,0.005498431,0.012344559],"genre_scores_gemma":[0.39581987,0.0010377318,0.5568287,0.0007241299,0.00034565286,0.000443956,0.005120652,0.0007525173,0.038926814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993488,0.00007306338,0.000039774775,0.00023515138,0.00017009141,0.00013302105],"domain_scores_gemma":[0.99891305,0.00043756602,0.00005547627,0.00031581116,0.0002154255,0.000062734565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089936587,0.001358524,0.0020695245,0.0015098656,0.00085827155,0.0013288017,0.0030131452,0.0017968238,0.009600879],"category_scores_gemma":[0.002114559,0.0008516605,0.0012246042,0.0014948061,0.0005810875,0.0016999131,0.0018379661,0.0023994413,0.0032148915],"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.00023354849,0.00020716444,0.00090556504,0.00011746088,0.00012971513,0.00012313551,0.00004635354,0.115893885,0.008523921,0.011022649,0.018169897,0.8446267],"study_design_scores_gemma":[0.000014552035,0.000036120928,0.0004257529,0.000023289684,0.000051095438,0.000060915452,0.000017431013,0.9802091,0.003594821,0.012918711,0.002641283,0.0000070122387],"about_ca_topic_score_codex":0.017927004,"about_ca_topic_score_gemma":0.035557255,"teacher_disagreement_score":0.017927004,"about_ca_system_score_codex":0.0013444166,"about_ca_system_score_gemma":0.0018286165,"threshold_uncertainty_score":0.035645306},"labels":[],"label_agreement":null},{"id":"W3115680971","doi":"10.1007/978-3-030-64556-4_28","title":"Ink Marker Segmentation in Histopathology Images Using Deep Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Histopathology; Digital pathology; Pixel; Artificial intelligence; Segmentation; Image segmentation; Computer vision; Pattern recognition (psychology); Process (computing); Digital image; Image processing; Image (mathematics); Pathology; Medicine","score_opus":0.01709739416420251,"score_gpt":0.2532742017611951,"score_spread":0.23617680759699258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115680971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035748564,0.0016598534,0.951671,0.0003576556,0.00012349029,0.000076248536,0.00045907206,0.005092436,0.004811665],"genre_scores_gemma":[0.30574244,0.0022118662,0.6708176,0.0003294114,0.0001040061,0.000071240815,0.0014175234,0.0010688513,0.018237015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998097,0.000020080597,0.00001198555,0.0000520048,0.00006336941,0.00004285201],"domain_scores_gemma":[0.99963284,0.00013001024,0.000041721272,0.00007283789,0.00010113118,0.000021477601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051736395,0.0006232802,0.0005652027,0.0013206871,0.0002579132,0.001662287,0.00094608363,0.001231112,0.003308609],"category_scores_gemma":[0.00086724566,0.0005479716,0.0007206007,0.0009942212,0.0003128099,0.0009764411,0.00078901596,0.0008309049,0.0024137523],"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.00028258134,0.000101080186,0.0022692713,0.00036748472,0.000075411845,0.00032542256,0.00013474292,0.051385287,0.10855401,0.0045592356,0.008158865,0.82378656],"study_design_scores_gemma":[0.00001145872,0.00007864193,0.0018149288,0.0001020008,0.00006757405,0.00064569677,0.000078021156,0.8476423,0.12998794,0.008217596,0.011318652,0.000035207697],"about_ca_topic_score_codex":0.0026263876,"about_ca_topic_score_gemma":0.005432333,"teacher_disagreement_score":0.003308609,"about_ca_system_score_codex":0.0006167875,"about_ca_system_score_gemma":0.0007512988,"threshold_uncertainty_score":0.011068344},"labels":[],"label_agreement":null},{"id":"W3116201698","doi":"10.1007/978-3-030-68211-8_19","title":"Upward Point Set Embeddings of Paths and Trees","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Path (computing); General position; Tree (set theory); Regular polygon; Point (geometry); Upper and lower bounds; Graph; Discrete mathematics; Computer science; Geometry","score_opus":0.01621143534357818,"score_gpt":0.26991946931503585,"score_spread":0.2537080339714577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116201698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23146388,0.0008301273,0.71997035,0.0008453428,0.00026226765,0.000091408976,0.0011380311,0.00075824553,0.04464029],"genre_scores_gemma":[0.68597895,0.0015617892,0.27019727,0.00025450625,0.00020571506,0.00017835818,0.0025087409,0.0009715239,0.038143188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928445,0.00012276364,0.00004801848,0.00017175838,0.0002710082,0.000102033526],"domain_scores_gemma":[0.9981444,0.00079515006,0.00018944952,0.0003333636,0.00029879957,0.00023887533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043940582,0.00081660383,0.00065161684,0.0020771646,0.00082726876,0.0027449618,0.0012664607,0.0011820102,0.010677576],"category_scores_gemma":[0.0045712576,0.00074345805,0.0008446882,0.0015968644,0.0014146179,0.00475093,0.004204685,0.0038364234,0.0017380367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010194757,0.000051529147,0.0007065808,0.00011043563,0.000013522748,0.00019453092,0.00060874486,0.009181339,0.0034141338,0.9379867,0.0028466883,0.044783857],"study_design_scores_gemma":[0.000018971554,0.000056998168,0.00051642244,0.000049261518,0.000019438294,0.0002806932,0.00037825934,0.039052956,0.0023806065,0.9414509,0.015777525,0.000018060618],"about_ca_topic_score_codex":0.0010880262,"about_ca_topic_score_gemma":0.0010872678,"teacher_disagreement_score":0.010677576,"about_ca_system_score_codex":0.00083501067,"about_ca_system_score_gemma":0.00032911633,"threshold_uncertainty_score":0.03572005},"labels":[],"label_agreement":null},{"id":"W3116827229","doi":"10.1007/978-3-030-71158-0_8","title":"Cost-Sensitive Semi-supervised Classification for Fraud Applications","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Bidding; Scarcity; Machine learning; Labeled data; Artificial intelligence; Domain (mathematical analysis); Data mining; Business; Mathematics","score_opus":0.05000733513116704,"score_gpt":0.318667674835975,"score_spread":0.26866033970480796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116827229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14383423,0.001813635,0.8454962,0.001319688,0.00028675984,0.0003905647,0.0013779235,0.003065104,0.0024159213],"genre_scores_gemma":[0.81186193,0.00038896702,0.17905901,0.00034374572,0.0002900537,0.0002854975,0.0027524675,0.00022747065,0.004790864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476624,0.0020351904,0.00044058004,0.00065549015,0.0016534779,0.00044906797],"domain_scores_gemma":[0.98706657,0.006327125,0.0012327849,0.0023442805,0.00262194,0.00040724585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006990549,0.001196986,0.0026218486,0.0027061638,0.0010648227,0.002151631,0.0029185861,0.0023803795,0.0023208128],"category_scores_gemma":[0.015879126,0.00065698614,0.0011274322,0.002444532,0.00088226,0.0023783466,0.0023124085,0.0021614702,0.0013513975],"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.0018395603,0.0015754196,0.011635813,0.00044127263,0.00036044986,0.0002802965,0.00017023167,0.17164826,0.01245518,0.008783667,0.021408742,0.769401],"study_design_scores_gemma":[0.000019199666,0.00008621787,0.0013455963,0.00001960944,0.00002689903,0.00010911305,0.000033936758,0.9854396,0.003954516,0.007980108,0.00097080995,0.000014397024],"about_ca_topic_score_codex":0.0020728419,"about_ca_topic_score_gemma":0.0029478695,"teacher_disagreement_score":0.006990549,"about_ca_system_score_codex":0.0012092729,"about_ca_system_score_gemma":0.0020812063,"threshold_uncertainty_score":0.03697002},"labels":[],"label_agreement":null},{"id":"W3117804044","doi":"10.1007/978-3-030-01270-0_39","title":"Deep Continuous Fusion for Multi-sensor 3D Object Detection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":841,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fuse (electrical); Benchmark (surveying); Artificial intelligence; Computer vision; Lidar; Object detection; Detector; Exploit; Object (grammar); ENCODE; Feature (linguistics); Image sensor; State (computer science); Sensor fusion; Pattern recognition (psychology); Algorithm; Remote sensing","score_opus":0.02506021675575439,"score_gpt":0.27528089048730403,"score_spread":0.25022067373154966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117804044","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.00817928,0.00097136275,0.987528,0.00013841302,0.00012781474,0.000029591243,0.00026574047,0.0015118134,0.0012479665],"genre_scores_gemma":[0.35194308,0.0018590913,0.6356465,0.00041520246,0.00021443647,0.0001316167,0.0017282238,0.00028550168,0.0077764317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994697,0.000054891272,0.000025448739,0.00014227736,0.00022548709,0.00008208438],"domain_scores_gemma":[0.9995466,0.00013786335,0.000046330537,0.00011059803,0.00012971408,0.000028754612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072150637,0.0012714257,0.0012857757,0.0010641112,0.00031667654,0.0010548407,0.0014982903,0.0014335689,0.0038582084],"category_scores_gemma":[0.0012981193,0.00080420164,0.0011174009,0.0018071883,0.00054676016,0.0017619067,0.0024714402,0.0016390863,0.0019975016],"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.00026514972,0.0001552637,0.0008458727,0.00019446759,0.00016560032,0.00010951599,0.00008180324,0.082362935,0.04630359,0.004718403,0.0065175933,0.8582798],"study_design_scores_gemma":[0.000006046825,0.00006244889,0.0010194166,0.00002117834,0.000034841374,0.000118401425,0.000023155922,0.9722687,0.016175164,0.0070283655,0.003219748,0.000022511334],"about_ca_topic_score_codex":0.0033528144,"about_ca_topic_score_gemma":0.0059144124,"teacher_disagreement_score":0.0038582084,"about_ca_system_score_codex":0.00060556096,"about_ca_system_score_gemma":0.00079335214,"threshold_uncertainty_score":0.012906969},"labels":[],"label_agreement":null},{"id":"W3118132944","doi":"10.1007/978-3-030-58523-5_29","title":"RadarNet: Exploiting Radar for Robust Perception of Dynamic Objects","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Radar; Computer vision; Artificial intelligence; Exploit; Lidar; Context (archaeology); Radar engineering details; Sensor fusion; Doppler radar; Noise (video); Radar tracker; Radar imaging; Perception; Remote sensing; Geography; Image (mathematics); Telecommunications","score_opus":0.022821377492750622,"score_gpt":0.24116710411781705,"score_spread":0.21834572662506643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118132944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067589823,0.001891469,0.9580917,0.00019136874,0.00041836663,0.000047588903,0.00047031947,0.012921692,0.019208629],"genre_scores_gemma":[0.111798875,0.0036708538,0.8298062,0.00048800628,0.0004293161,0.00014052242,0.0031351203,0.0025420086,0.047989137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998159,0.000017651228,0.0000059066497,0.000040713814,0.000102382146,0.000017450095],"domain_scores_gemma":[0.999863,0.000045314988,0.000010040878,0.000029785455,0.00003871574,0.000013081381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003624641,0.00092071615,0.0005345418,0.00057842076,0.00015120202,0.0010085121,0.0010641838,0.00081452343,0.01024866],"category_scores_gemma":[0.00038716485,0.00041033147,0.0003413707,0.0005205014,0.0004334949,0.0016092997,0.0008439895,0.00065031025,0.0051246937],"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.00036095554,0.00011610496,0.00035049763,0.00036899946,0.00008228451,0.00023062654,0.00010019742,0.049638964,0.13083751,0.036786817,0.07427786,0.7068492],"study_design_scores_gemma":[0.0000662455,0.00022594085,0.0008881043,0.000078602025,0.00005678032,0.0007756359,0.000039371935,0.67051196,0.090904474,0.032384682,0.20399871,0.00006951246],"about_ca_topic_score_codex":0.0010267935,"about_ca_topic_score_gemma":0.0015192956,"teacher_disagreement_score":0.01024866,"about_ca_system_score_codex":0.0002378021,"about_ca_system_score_gemma":0.00025995335,"threshold_uncertainty_score":0.034285188},"labels":[],"label_agreement":null},{"id":"W3118400252","doi":"","title":"Synchronization in two uncoupled chaotic neurons","year":2004,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"McMaster University","funders":"","keywords":"Synchronization (alternating current); Lyapunov exponent; Control theory (sociology); Chaotic; SIGNAL (programming language); Synchronization of chaos; Phase synchronization; Interval (graph theory); Phase (matter); Neuron; Physics; Stimulation; Mathematics; Topology (electrical circuits); Biological system; Neuroscience; Computer science; Artificial intelligence; Biology; Combinatorics","score_opus":0.014722470655250936,"score_gpt":0.2586634825910856,"score_spread":0.2439410119358347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118400252","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.9484292,0.00013947746,0.04392892,0.00029648602,0.00010888497,0.0000223542,0.000038713766,0.00011181973,0.0069241305],"genre_scores_gemma":[0.9954462,0.000031077205,0.0024085464,0.000019135852,0.000010986804,0.000009324967,0.000014078292,0.0000128457095,0.0020478053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987435,0.000029972747,0.000009596013,0.000025946723,0.000034652603,0.000025372801],"domain_scores_gemma":[0.9995347,0.0001646653,0.00008018842,0.000043188582,0.000069161026,0.0001081504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027513952,0.0002800972,0.00048952684,0.00041630416,0.00046741494,0.0007009489,0.0006904201,0.0008610754,0.0015908086],"category_scores_gemma":[0.0015167566,0.00029454965,0.00036058642,0.0002598322,0.0006936398,0.0006702202,0.0011877454,0.00056206266,0.00020386191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001643982,0.0002637329,0.008458534,0.00033299558,0.00027850005,0.00479097,0.0021059501,0.44487324,0.27054694,0.2301042,0.0021476727,0.034453336],"study_design_scores_gemma":[0.00006766666,0.00016001971,0.002575638,0.000013313216,0.000032931424,0.00020508881,0.00014308716,0.9701506,0.005624787,0.020479131,0.0005081189,0.000039655508],"about_ca_topic_score_codex":0.001021331,"about_ca_topic_score_gemma":0.0008934001,"teacher_disagreement_score":0.0015908086,"about_ca_system_score_codex":0.0004648139,"about_ca_system_score_gemma":0.00025838896,"threshold_uncertainty_score":0.0053218007},"labels":[],"label_agreement":null},{"id":"W3119699145","doi":"10.1007/978-3-030-66046-8_17","title":"A New Metric to Evaluate Communities in Social Networks Using Geodesic Distance","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Geodesic; Metric (unit); Mathematics; Computer science; Geometry; Engineering; Operations management","score_opus":0.039033687030454754,"score_gpt":0.3000970075186551,"score_spread":0.26106332048820036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119699145","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.04019569,0.0014222165,0.95258236,0.00023446942,0.00021798043,0.00025498838,0.0010510957,0.0008372749,0.0032038728],"genre_scores_gemma":[0.3416583,0.0008990392,0.6499571,0.00014918753,0.0002987167,0.0005597107,0.0026379717,0.00035622893,0.003483717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948061,0.0014914513,0.00039958916,0.0007280936,0.002389746,0.00018513424],"domain_scores_gemma":[0.9922984,0.0030337726,0.0008391898,0.0009852049,0.0022746664,0.0005687846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026359342,0.0015595321,0.0015439661,0.010316398,0.0013264151,0.002505592,0.0019211584,0.0019545755,0.0017127262],"category_scores_gemma":[0.014937344,0.00044884562,0.0011093889,0.0081545245,0.0015548998,0.0062681376,0.0034749515,0.0013165101,0.00076642464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007908022,0.00049305346,0.031334504,0.0010525994,0.0010552594,0.000479083,0.0011699733,0.13768235,0.026242584,0.13014868,0.021706795,0.6478443],"study_design_scores_gemma":[0.00007008974,0.00048801932,0.008127312,0.000127156,0.00022572574,0.0009447527,0.0005568911,0.8574761,0.007381416,0.10956609,0.014875391,0.0001611304],"about_ca_topic_score_codex":0.0039642956,"about_ca_topic_score_gemma":0.004220982,"teacher_disagreement_score":0.010316398,"about_ca_system_score_codex":0.0015344546,"about_ca_system_score_gemma":0.0009946773,"threshold_uncertainty_score":0.013940334},"labels":[],"label_agreement":null},{"id":"W3120078791","doi":"","title":"Dynamic mean semi-variance portfolio selection","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Risk and Portfolio Optimization","field":"Decision 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 Calgary","funders":"","keywords":"Efficient frontier; Portfolio; Portfolio optimization; Downside risk; Variance (accounting); Selection (genetic algorithm); Mathematical optimization; Modern portfolio theory; Optimization problem; Mathematics; Computer science; Econometrics; Economics; Financial economics; Artificial intelligence","score_opus":0.02247822449264877,"score_gpt":0.31778966941669995,"score_spread":0.2953114449240512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120078791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02228435,0.00029283826,0.973502,0.00038521545,0.00007305432,0.000028404587,0.000035721812,0.0002682388,0.0031301854],"genre_scores_gemma":[0.8142644,0.00048234113,0.17192303,0.0002860739,0.00025118684,0.00017942257,0.0002332934,0.00017792326,0.012202345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852306,0.0006148398,0.000057154717,0.00020908819,0.0004718652,0.0001240813],"domain_scores_gemma":[0.99614173,0.0023808808,0.0002893321,0.00040578496,0.00060758996,0.00017470811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030609537,0.00071968697,0.0016379841,0.00067050324,0.00036207697,0.001667195,0.0011499817,0.0013060987,0.0033035935],"category_scores_gemma":[0.009094989,0.00086235837,0.00078273355,0.0008680699,0.0008464266,0.0017370252,0.0018610319,0.0013094104,0.0007730438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003082147,0.00010580138,0.0012181074,0.00010932648,0.00021669982,0.00012732057,0.00004114364,0.77871764,0.0030560025,0.09231577,0.0039098873,0.11987404],"study_design_scores_gemma":[0.000025602503,0.000055629785,0.00016423517,0.0000068950994,0.00001769909,0.00004379022,0.0000021586904,0.97551155,0.0005751358,0.023089621,0.000498764,0.000008977233],"about_ca_topic_score_codex":0.0003842959,"about_ca_topic_score_gemma":0.000399125,"teacher_disagreement_score":0.0033035935,"about_ca_system_score_codex":0.00065675547,"about_ca_system_score_gemma":0.0009416689,"threshold_uncertainty_score":0.016188025},"labels":[],"label_agreement":null},{"id":"W3121206596","doi":"10.1007/978-3-030-67731-2_8","title":"Bike Assisted Evacuation on a Line","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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":"Carleton University","funders":"","keywords":"Computer science; Line (geometry); Human–computer interaction; Mathematics","score_opus":0.022815213337957954,"score_gpt":0.2527418839519942,"score_spread":0.22992667061403627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121206596","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.061068006,0.0040100478,0.3142735,0.0014290911,0.0029692121,0.00018909104,0.00086457597,0.0042995266,0.61089694],"genre_scores_gemma":[0.32212898,0.0031855002,0.054009777,0.00025941202,0.00021020552,0.00011706195,0.0012791598,0.00033567095,0.6184743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989474,0.000020933718,0.000004058937,0.000017192171,0.000038108832,0.000024945708],"domain_scores_gemma":[0.9999393,0.000012361849,0.000003243206,0.000010873181,0.000020577509,0.000013634212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010281946,0.00091064983,0.00049531355,0.0004198884,0.0010916356,0.0010285587,0.0007629963,0.0009978433,0.029159913],"category_scores_gemma":[0.00023152477,0.00022875234,0.00032649646,0.00061238324,0.00023521789,0.0010760777,0.001529787,0.0009286697,0.0064902524],"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.001082056,0.00034948235,0.0009604553,0.0005481146,0.000083898325,0.0014733147,0.00087655394,0.17729416,0.025725206,0.07366084,0.15280227,0.5651436],"study_design_scores_gemma":[0.000055540393,0.00050817075,0.0018867352,0.0002498798,0.000054740674,0.0011259927,0.0014012831,0.28267884,0.013161571,0.031162411,0.66762227,0.000092551825],"about_ca_topic_score_codex":0.002498581,"about_ca_topic_score_gemma":0.004559543,"teacher_disagreement_score":0.029159913,"about_ca_system_score_codex":0.0003161664,"about_ca_system_score_gemma":0.00040009225,"threshold_uncertainty_score":0.09754962},"labels":[],"label_agreement":null},{"id":"W3122656764","doi":"10.1007/978-3-031-43254-5","title":"Algorithmic Game Theory","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Goethe-Universität Frankfurt am Main; Technische Universität Berlin; Sapienza Università di Roma; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; École Polytechnique Fédérale de Lausanne; Università degli Studi G. d'Annunzio Chieti - Pescara; University of Glasgow; University of Edinburgh; Technische Universität Wien; Aarhus Universitet; European Commission; University of Toronto; London School of Economics and Political Science; Deutsche Forschungsgemeinschaft; King's College London; Royal Holloway, University of London; University of Essex; University of Patras; University of Illinois at Urbana-Champaign; City University of Hong Kong; Ben-Gurion University of the Negev; Harvard University","keywords":"Computer science; Game theory; Division (mathematics); Algorithmic game theory; Mechanism (biology); Mechanism design; Matching (statistics); Computational complexity theory; Social choice theory; Theoretical computer science; Mathematical economics; Artificial intelligence; Algorithm; Sequential game; Arithmetic; Mathematics; Epistemology","score_opus":0.02634159435788425,"score_gpt":0.2293361764770248,"score_spread":0.20299458211914057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122656764","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068659033,0.003821008,0.55741423,0.0026728907,0.0006674151,0.00014772448,0.0006518755,0.0005844963,0.42717445],"genre_scores_gemma":[0.3713671,0.0068132733,0.2434419,0.0016604547,0.0008758739,0.00072204694,0.002197797,0.0007892618,0.37213233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940574,0.00018376517,0.000027087404,0.000110900444,0.00021677458,0.00005578004],"domain_scores_gemma":[0.99949193,0.00025461602,0.000024599527,0.00011174769,0.00008474595,0.000032420165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458338,0.0009797609,0.00090400607,0.00088689185,0.000816828,0.00300081,0.0011974986,0.0010944282,0.026997456],"category_scores_gemma":[0.002394611,0.00047191692,0.00083082926,0.0011442776,0.0013952977,0.0025172492,0.0014689609,0.002455017,0.0062370105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000908553,0.000022509477,0.00007477921,0.0000588581,0.000014650018,0.000017801742,0.000049918886,0.00684634,0.00015934072,0.93809724,0.01734555,0.037304003],"study_design_scores_gemma":[0.0000068494905,0.0000056289364,0.00005688734,0.000021568989,0.000005734114,0.000027850976,0.000018445382,0.015844807,0.000083367355,0.94946396,0.034460824,0.000004102538],"about_ca_topic_score_codex":0.0011537699,"about_ca_topic_score_gemma":0.001336875,"teacher_disagreement_score":0.026997456,"about_ca_system_score_codex":0.0012672987,"about_ca_system_score_gemma":0.0009773863,"threshold_uncertainty_score":0.09031546},"labels":[],"label_agreement":null},{"id":"W3123230313","doi":"10.1007/978-3-030-66906-5_2","title":"A Review on Visualization of Educational Data in Online Learning","year":2021,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Athabasca University","funders":"","keywords":"Computer science; Visualization; Interactivity; Data science; Data visualization; Educational data mining; Information visualization; Context (archaeology); Strengths and weaknesses; Human–computer interaction; Multimedia; Data mining","score_opus":0.06259406852289136,"score_gpt":0.41689573822339665,"score_spread":0.3543016697005053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123230313","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011097026,0.9982407,0.00073095266,0.00029861784,0.00020057187,0.000015177422,0.00006396298,0.000026379801,0.0003126383],"genre_scores_gemma":[0.0008413976,0.99664885,0.0016453277,0.00029312444,0.00024107803,0.000026166288,0.00011588945,0.000012097905,0.00017606236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986047,0.00043940527,0.00026160033,0.00021537278,0.00041586664,0.000063085245],"domain_scores_gemma":[0.98741156,0.009695685,0.0007320623,0.00028239228,0.001664709,0.00021359738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210341,0.0012557087,0.0028022951,0.007552404,0.00036102106,0.0025150725,0.002058439,0.0017122582,0.0050007417],"category_scores_gemma":[0.012554557,0.00073760987,0.0018215072,0.0074937586,0.0008821733,0.003385805,0.0012109956,0.0015103646,0.001553562],"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.00009171065,0.000070890805,0.0003545521,0.05708508,0.00026828542,0.00009559728,0.00010528706,0.00026451296,0.00086461485,0.0019599423,0.03406021,0.90477943],"study_design_scores_gemma":[0.00006880293,0.00019318078,0.0024966488,0.054582115,0.0015760575,0.001154065,0.0001955838,0.000601992,0.0018772007,0.0038905793,0.9332398,0.00012394205],"about_ca_topic_score_codex":0.0035578671,"about_ca_topic_score_gemma":0.005445906,"teacher_disagreement_score":0.007552404,"about_ca_system_score_codex":0.0009023185,"about_ca_system_score_gemma":0.0027148642,"threshold_uncertainty_score":0.016978085},"labels":[],"label_agreement":null},{"id":"W3123267850","doi":"10.1007/978-3-030-67731-2_2","title":"Towards Knowledge Exchange: State-of-the-Art and Open Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Knowledge graph; Task (project management); Knowledge management; Property (philosophy); Data science; State (computer science); Data exchange; Artificial intelligence; World Wide Web; Programming language; Engineering; Epistemology","score_opus":0.0337138624606843,"score_gpt":0.2762919369261551,"score_spread":0.2425780744654708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123267850","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013122501,0.17389663,0.6529993,0.05021605,0.0014101331,0.00022238005,0.0004902288,0.00093573274,0.10670713],"genre_scores_gemma":[0.2619738,0.2120753,0.49251863,0.0059776898,0.0029100028,0.00048594168,0.0027046846,0.0006045027,0.02074943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9825187,0.009422342,0.0010714525,0.0021843542,0.003902572,0.0009005574],"domain_scores_gemma":[0.95602053,0.031288575,0.0011602977,0.008075043,0.0023944334,0.0010611538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022806143,0.0015411561,0.0031621845,0.004786864,0.003317983,0.027195996,0.007926189,0.009123326,0.011737873],"category_scores_gemma":[0.037189353,0.001248811,0.0018717794,0.014149275,0.013359729,0.083710924,0.017223403,0.0062315864,0.005503595],"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.000056552402,0.00010440487,0.0004081831,0.0013387013,0.00007623243,0.00008732401,0.00177088,0.0019012723,0.00025259223,0.7799077,0.009256832,0.20483933],"study_design_scores_gemma":[0.000011603538,0.000011072785,0.000110993074,0.0007425921,0.000016054242,0.00013339406,0.0011459182,0.004761547,0.0003698513,0.9385267,0.05415229,0.000018020584],"about_ca_topic_score_codex":0.0033616452,"about_ca_topic_score_gemma":0.0015265151,"teacher_disagreement_score":0.027195996,"about_ca_system_score_codex":0.0034118823,"about_ca_system_score_gemma":0.005523845,"threshold_uncertainty_score":0.12061185},"labels":[],"label_agreement":null},{"id":"W3125298265","doi":"10.1007/978-3-030-38081-6","title":"Multiple-Aspect Analysis of Semantic Trajectories","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Agence Nationale de la Recherche; European Regional Development Fund; Deutsche Forschungsgemeinschaft; European Commission","keywords":"Computer science; Representation (politics); Domain (mathematical analysis); Trajectory; Semantic data model; Information retrieval; Artificial intelligence; Theoretical computer science; Natural language processing","score_opus":0.0178577376462061,"score_gpt":0.24152132075792132,"score_spread":0.22366358311171522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125298265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03201127,0.0020306262,0.9395152,0.00073177007,0.00023934703,0.00006645179,0.0011502537,0.0010928133,0.023162331],"genre_scores_gemma":[0.5246592,0.0026708702,0.43502048,0.0001820486,0.00029439174,0.00014856574,0.0052166833,0.0010464143,0.030761346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955755,0.00009030868,0.00002504703,0.00009633297,0.00018626807,0.0000445137],"domain_scores_gemma":[0.99948335,0.00022012349,0.000061502185,0.000076435594,0.00012734582,0.000031268984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054464734,0.0004335042,0.0004512547,0.0016938386,0.00050930306,0.0018380116,0.0006387947,0.0004023918,0.006832207],"category_scores_gemma":[0.0025339916,0.00026370355,0.00097010913,0.002374624,0.0005151262,0.0019935244,0.0011281854,0.00097426196,0.00105648],"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.00014631067,0.000063591535,0.0049177594,0.00031528855,0.00013389857,0.0007887343,0.0008375448,0.072764814,0.010439746,0.47878072,0.027087644,0.40372398],"study_design_scores_gemma":[0.0000076242454,0.000025356172,0.002965882,0.00005416445,0.000033765613,0.0002137766,0.00042657126,0.66764504,0.0032589643,0.28146973,0.043874618,0.0000245655],"about_ca_topic_score_codex":0.0039369348,"about_ca_topic_score_gemma":0.003909684,"teacher_disagreement_score":0.006832207,"about_ca_system_score_codex":0.0008969081,"about_ca_system_score_gemma":0.0005096442,"threshold_uncertainty_score":0.022855997},"labels":[],"label_agreement":null},{"id":"W3125715386","doi":"10.1007/978-3-642-16170-4_23","title":"Braess’s Paradox for Flows over Time","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Conjecture; Context (archaeology); Network topology; Flow (mathematics); Symmetry (geometry); Flow network","score_opus":0.04601507177148041,"score_gpt":0.33944348014179604,"score_spread":0.29342840837031564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125715386","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.110641964,0.007673733,0.4076775,0.037461843,0.0016496674,0.00015420683,0.00079122477,0.00032718052,0.4336227],"genre_scores_gemma":[0.8721328,0.0030611027,0.05857001,0.0026801713,0.0010500757,0.00029579637,0.000241575,0.00018408544,0.061784472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975434,0.0009356661,0.0001824033,0.0004036846,0.0006461359,0.00028861593],"domain_scores_gemma":[0.98945516,0.007520549,0.00048630184,0.0013165434,0.00069696666,0.0005244074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005819295,0.0006884181,0.0014016185,0.0020544445,0.0028843281,0.006813292,0.0017894948,0.005212616,0.01395997],"category_scores_gemma":[0.02816567,0.0005789221,0.0012700193,0.0025210956,0.008931026,0.021341803,0.0034369149,0.006930278,0.0011730833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006037935,0.000002981251,0.000015913014,0.000009876376,0.0000024526328,0.000013843607,0.000059902988,0.00028517787,0.000030707353,0.99767953,0.00068975246,0.0012038851],"study_design_scores_gemma":[0.0000030809067,9.153658e-7,0.000007737498,0.0000033379708,8.693163e-7,0.000013581805,0.0000107108835,0.00055106834,0.000010333685,0.99860674,0.00078958925,0.000001948496],"about_ca_topic_score_codex":0.0013826513,"about_ca_topic_score_gemma":0.0008880059,"teacher_disagreement_score":0.01395997,"about_ca_system_score_codex":0.002541469,"about_ca_system_score_gemma":0.0018016676,"threshold_uncertainty_score":0.046700776},"labels":[],"label_agreement":null},{"id":"W3125870306","doi":"10.1007/978-3-030-67220-1_21","title":"A Semantic-Aware, Accurate and Efficient API for (Co-)Simulation of CPS","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Debugging; Semantics (computer science); Application programming interface; Interface (matter); Event (particle physics); Programming language; Simple (philosophy); Isolation (microbiology); Distributed computing; Operating system","score_opus":0.03308390282301867,"score_gpt":0.30128219297438275,"score_spread":0.2681982901513641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125870306","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.0014035767,0.00005927286,0.9680854,0.000041859785,0.000039472005,0.00005963813,0.0003974073,0.027559666,0.0023536466],"genre_scores_gemma":[0.1381489,0.00048833585,0.83180004,0.00029501694,0.00008010349,0.0006250821,0.0042863316,0.014726217,0.00954998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986865,0.00024227113,0.00013863349,0.00019340607,0.0006260641,0.00011313425],"domain_scores_gemma":[0.9982546,0.0006867347,0.00010244858,0.00066116994,0.00023274789,0.00006230365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012788001,0.0018999352,0.0012156159,0.0013010175,0.00060698704,0.0028467677,0.0034577076,0.001581269,0.016840152],"category_scores_gemma":[0.0046226126,0.0011752219,0.0018888238,0.0011045607,0.000966228,0.0032166676,0.0037221455,0.0026419368,0.0067917584],"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.0008298059,0.0003839998,0.0023610212,0.0013870702,0.00028038648,0.00069958146,0.0006967471,0.2694246,0.040002655,0.21035504,0.050965473,0.42261365],"study_design_scores_gemma":[0.00005939519,0.000051839066,0.00021218775,0.00006478789,0.000060018636,0.00023921361,0.00003771595,0.8652837,0.02458607,0.05906239,0.050297398,0.00004524637],"about_ca_topic_score_codex":0.002226641,"about_ca_topic_score_gemma":0.0033756467,"teacher_disagreement_score":0.016840152,"about_ca_system_score_codex":0.0008336254,"about_ca_system_score_gemma":0.0012440889,"threshold_uncertainty_score":0.056335926},"labels":[],"label_agreement":null},{"id":"W3126348830","doi":"10.1007/978-3-030-67731-2_11","title":"Concatenation Operations and Restricted Variants of Two-Dimensional Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Diagonal; Closure (psychology); Computer science; Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Discrete mathematics; Algorithm; Automata theory; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.015236191860627867,"score_gpt":0.24741043209524152,"score_spread":0.23217424023461367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126348830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14003891,0.004423854,0.6764287,0.0008354359,0.0014567509,0.00010835523,0.00052883185,0.0013506972,0.17482851],"genre_scores_gemma":[0.79831433,0.0021643706,0.14714657,0.00031919565,0.000521219,0.0002550725,0.00074623973,0.000400484,0.050132453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886215,0.00029857672,0.00016434246,0.00028446192,0.00024961442,0.00014087716],"domain_scores_gemma":[0.9983999,0.00076599,0.00010231781,0.00045520207,0.00016621398,0.00011032239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074357784,0.0006031694,0.0006220953,0.0008140788,0.0010110524,0.0037248076,0.0013115829,0.0008494597,0.0054748124],"category_scores_gemma":[0.0019820537,0.00048656928,0.0011807908,0.0013647745,0.0032831158,0.006131786,0.002582477,0.0025759696,0.0014105338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000463941,0.0000168338,0.000075730975,0.000039919258,0.0000063852112,0.00010360016,0.00028649287,0.0009956158,0.0026453298,0.9828782,0.00072688673,0.012178629],"study_design_scores_gemma":[0.000012228925,0.000037941565,0.00012343029,0.000019864692,0.000015592406,0.00029649425,0.00012176831,0.0065273237,0.0031340732,0.97399515,0.015684256,0.000031807293],"about_ca_topic_score_codex":0.0004863013,"about_ca_topic_score_gemma":0.00042334062,"teacher_disagreement_score":0.0054748124,"about_ca_system_score_codex":0.0006486684,"about_ca_system_score_gemma":0.00042884695,"threshold_uncertainty_score":0.018315077},"labels":[],"label_agreement":null},{"id":"W3127104388","doi":"10.1007/978-3-030-77961-0_30","title":"Validating Optimal COVID-19 Vaccine Distribution Models","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","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":"Lakehead University","funders":"","keywords":"Flexibility (engineering); Distribution (mathematics); Coronavirus disease 2019 (COVID-19); Computer science; Constraint (computer-aided design); Range (aeronautics); Vaccination; Demographics; Operations research; Process (computing); Cluster (spacecraft); Mass vaccination; Business; Engineering; Medicine; Mathematics; Disease; Virology; Statistics; Infectious disease (medical specialty); Computer network","score_opus":0.2138849129840651,"score_gpt":0.42352192493915536,"score_spread":0.20963701195509027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127104388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38371,0.0005776858,0.5890997,0.0036418086,0.0003683706,0.00048420666,0.0056729983,0.00092799764,0.015517149],"genre_scores_gemma":[0.9363726,0.000173576,0.056849908,0.00026511517,0.000056467652,0.0002572333,0.002779625,0.00013819642,0.0031073152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958989,0.0021107488,0.00017234783,0.0006649457,0.0005733068,0.0005797246],"domain_scores_gemma":[0.9419004,0.050369624,0.0018640528,0.002100974,0.002906481,0.0008585358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109306555,0.0010536937,0.0017102179,0.0013354542,0.0006433569,0.0027268196,0.0024028062,0.0030963921,0.0071685184],"category_scores_gemma":[0.06348942,0.0014542851,0.0012575291,0.00084632216,0.0015025616,0.0022916126,0.002277156,0.0023540861,0.0007655391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009636675,0.000043735756,0.0016399793,0.000036460544,0.000020108233,0.00002680332,0.000017658207,0.9851008,0.00013415792,0.009576557,0.00058393367,0.002723484],"study_design_scores_gemma":[0.000028159637,0.00003108954,0.00013693601,0.000011652576,0.000008076493,0.000007324579,0.00001441563,0.9863819,0.00022117545,0.012906028,0.0002488142,0.000004498586],"about_ca_topic_score_codex":0.013128115,"about_ca_topic_score_gemma":0.0067310436,"teacher_disagreement_score":0.013128115,"about_ca_system_score_codex":0.004177292,"about_ca_system_score_gemma":0.0068711215,"threshold_uncertainty_score":0.057807505},"labels":[],"label_agreement":null},{"id":"W3127889730","doi":"10.1007/978-3-030-65651-5_8","title":"Fully Automated Deep Learning Based Segmentation of Normal, Infarcted and Edema Regions from Multiple Cardiac MRI Sequences","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","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":"Canadian VIGOUR Centre; University of Alberta","funders":"","keywords":"Segmentation; Convolutional neural network; Computer science; Deep learning; Myocardial infarction; Artificial intelligence; Magnetic resonance imaging; Steady-state free precession imaging; Test set; Pattern recognition (psychology); Medicine; Radiology; Cardiology","score_opus":0.01293546436169152,"score_gpt":0.2529609279803325,"score_spread":0.24002546361864097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127889730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03421417,0.0017366491,0.95538455,0.0003182486,0.00012214099,0.00009509638,0.0013002252,0.0039949175,0.002834041],"genre_scores_gemma":[0.24790287,0.0021947501,0.7262032,0.00046819344,0.00017007354,0.00014496184,0.0044549927,0.001018291,0.017442616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981433,0.000017606717,0.000011563009,0.000054747685,0.000057394238,0.00004428076],"domain_scores_gemma":[0.9997266,0.00009273819,0.000032529744,0.000039694376,0.000085391905,0.000023013252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156782,0.0010103423,0.0007740337,0.0010606064,0.00027016396,0.0011287647,0.0009880526,0.0012860929,0.0026460257],"category_scores_gemma":[0.00069523044,0.00061147753,0.00094045803,0.000730203,0.00027478902,0.00067627133,0.000905541,0.0008178857,0.0017945963],"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.00028118002,0.00013998269,0.0012923739,0.00023314488,0.00012285098,0.00027098515,0.00008134782,0.07982738,0.098127365,0.002361361,0.010527541,0.80673456],"study_design_scores_gemma":[0.000012933627,0.000073752955,0.0025172639,0.00006911357,0.00006902136,0.0006224643,0.000030200568,0.9416431,0.04348791,0.0056104017,0.0058335355,0.000030387546],"about_ca_topic_score_codex":0.006109364,"about_ca_topic_score_gemma":0.01584867,"teacher_disagreement_score":0.006109364,"about_ca_system_score_codex":0.0005056722,"about_ca_system_score_gemma":0.00095955486,"threshold_uncertainty_score":0.012147605},"labels":[],"label_agreement":null},{"id":"W3128717465","doi":"10.1007/978-3-030-64583-0_1","title":"Revisiting Clustering as Matrix Factorisation on the Stiefel Manifold","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Stiefel manifold; Cluster analysis; Estimator; Computer science; Context (archaeology); Rank (graph theory); Manifold (fluid mechanics); Applied mathematics; Factorization; Matrix decomposition; Matrix (chemical analysis); Algorithm; Mathematics; Artificial intelligence; Combinatorics; Eigenvalues and eigenvectors; Physics; Pure mathematics; Statistics","score_opus":0.03231176423547592,"score_gpt":0.28039685951657034,"score_spread":0.2480850952810944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128717465","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.0040919585,0.0009974733,0.9850649,0.00043788378,0.0002301704,0.000025883182,0.00006526633,0.00019078847,0.008895666],"genre_scores_gemma":[0.14303105,0.0030702986,0.8261203,0.00044403883,0.000865452,0.00012606298,0.00037936855,0.0009246713,0.025038727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987698,0.0004906692,0.000048636746,0.00029961218,0.0003258077,0.00006551503],"domain_scores_gemma":[0.99782866,0.001088346,0.00012089717,0.00044947417,0.00042167574,0.00009095388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018383283,0.0010050419,0.0013472319,0.0018923762,0.0012137127,0.0025532902,0.0022916126,0.0019317655,0.0066264383],"category_scores_gemma":[0.0068499027,0.00074540963,0.0017104514,0.002503824,0.0030838915,0.005243983,0.0030087437,0.003068054,0.0021960721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022413307,0.000013560873,0.000119069504,0.00013293859,0.000026424723,0.00003451344,0.00024736515,0.026557209,0.0013797703,0.91083753,0.0041136076,0.056515638],"study_design_scores_gemma":[0.0000047247304,0.00002109747,0.00012387865,0.000029847097,0.0000090652775,0.00005508685,0.00004444283,0.13202217,0.00056013284,0.8537986,0.01331117,0.000019898367],"about_ca_topic_score_codex":0.0046952916,"about_ca_topic_score_gemma":0.0053960974,"teacher_disagreement_score":0.0066264383,"about_ca_system_score_codex":0.0014356942,"about_ca_system_score_gemma":0.0009462829,"threshold_uncertainty_score":0.022167623},"labels":[],"label_agreement":null},{"id":"W31287713","doi":"10.1007/978-3-642-31753-8_18","title":"JSART: JavaScript Assertion-Based Regression Testing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Programming language; Correctness; Regression testing; Assertion; Rich Internet application; Source code; Test case; Web application; Data mining; Artificial intelligence; Machine learning; Operating system; Regression analysis; Software; Software development","score_opus":0.04071869676340591,"score_gpt":0.2725068548380246,"score_spread":0.23178815807461872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31287713","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046458365,0.00028830976,0.87469196,0.00017378542,0.00020058511,0.00008835494,0.000509914,0.112243086,0.0071582547],"genre_scores_gemma":[0.25121418,0.00074823946,0.6708354,0.0007578321,0.00025928137,0.00033651982,0.004270162,0.044176687,0.027401753],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970306,0.0006068257,0.0002184356,0.00043144828,0.0015121454,0.00020040666],"domain_scores_gemma":[0.9951781,0.0025528271,0.00032944497,0.001134554,0.00066173036,0.00014334607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181398,0.001982767,0.0010156551,0.0013908566,0.0004484231,0.0015301803,0.0035746982,0.0013574447,0.015927985],"category_scores_gemma":[0.007294555,0.0010384257,0.0012311325,0.0008745598,0.0010635235,0.00279632,0.0017366781,0.0025149612,0.0068248473],"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.0008482565,0.0005128182,0.0028020483,0.001023424,0.00017485449,0.0009202764,0.0003860093,0.030277537,0.059944373,0.040682487,0.08739787,0.77503],"study_design_scores_gemma":[0.00036659656,0.00044658856,0.0027159406,0.00047213215,0.00029247746,0.00203711,0.000087935405,0.61716074,0.15574838,0.092926376,0.12752475,0.00022102002],"about_ca_topic_score_codex":0.0012863722,"about_ca_topic_score_gemma":0.0012540204,"teacher_disagreement_score":0.015927985,"about_ca_system_score_codex":0.00034604044,"about_ca_system_score_gemma":0.0007581233,"threshold_uncertainty_score":0.053284466},"labels":[],"label_agreement":null},{"id":"W3129088492","doi":"10.1007/978-3-030-75242-2_10","title":"Fragile Complexity of Adaptive Algorithms","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Carleton University","funders":"Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; National Foundation for Science and Technology Development; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Parameterized complexity; Binary logarithm; Sequence (biology); Element (criminal law); Mathematics; Log-log plot; Sorting; Time complexity; Combinatorics; Computational complexity theory; Rank (graph theory); Algorithm; Worst-case complexity; Algorithmic complexity; Discrete mathematics; Computer science; Theoretical computer science","score_opus":0.043164411612213745,"score_gpt":0.28486172452057607,"score_spread":0.24169731290836233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129088492","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.1343933,0.0014760636,0.8289927,0.0041730106,0.00033294977,0.0000867352,0.0003331232,0.00049472693,0.029717388],"genre_scores_gemma":[0.93633884,0.0007812267,0.050683588,0.00044835344,0.00049740996,0.00023110819,0.00029634664,0.00023158255,0.010491612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656844,0.001108454,0.00014566872,0.00056089344,0.0012382419,0.00037832282],"domain_scores_gemma":[0.9458343,0.04522979,0.0020713394,0.003898858,0.0020413639,0.00092436327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034059694,0.00101428,0.0012022641,0.0019177801,0.0011803529,0.003914952,0.0018471314,0.0023222144,0.008117096],"category_scores_gemma":[0.050690215,0.0007378841,0.0008729666,0.00123178,0.0039126356,0.007345117,0.0037422832,0.0052965465,0.00083708996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029917437,0.000049606697,0.00089180196,0.000121285564,0.000044165314,0.000089514506,0.00013229046,0.10141727,0.0024338218,0.871134,0.002948336,0.020438796],"study_design_scores_gemma":[0.00003425895,0.000048974838,0.0004418632,0.000021361535,0.000013411904,0.00007925919,0.000026111245,0.36924586,0.0011049057,0.6281015,0.0008581629,0.000024315088],"about_ca_topic_score_codex":0.0008629469,"about_ca_topic_score_gemma":0.000602907,"teacher_disagreement_score":0.008117096,"about_ca_system_score_codex":0.002211644,"about_ca_system_score_gemma":0.0014659342,"threshold_uncertainty_score":0.027154446},"labels":[],"label_agreement":null},{"id":"W3129270229","doi":"10.1007/978-3-030-68887-5_8","title":"A Posteriori Analysis of Policy Temporal Compliance","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Access control; Computer security; Sanctions; Event calculus; Flexibility (engineering); Security policy; Compliance (psychology); A priori and a posteriori; Process (computing); Event (particle physics); Control (management); Risk analysis (engineering); Process management; Artificial intelligence; Law; Programming language; Political science","score_opus":0.03626190390708545,"score_gpt":0.3285659715522549,"score_spread":0.2923040676451695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129270229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012011656,0.0001580475,0.9840873,0.00030846643,0.000034345245,0.000033840093,0.00012303988,0.00028534874,0.0029579357],"genre_scores_gemma":[0.65964997,0.0005942275,0.32746226,0.00020472615,0.0002858892,0.0002971625,0.000592986,0.000585515,0.010327175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362826,0.00331012,0.00028322192,0.00077228976,0.0015943355,0.00041182892],"domain_scores_gemma":[0.9183985,0.073597364,0.0017138176,0.0033003872,0.0025062591,0.00048361128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008945887,0.0010261915,0.0013154654,0.0020373915,0.0008397116,0.0034627833,0.0019074151,0.0014462005,0.008059849],"category_scores_gemma":[0.042323664,0.0012411972,0.0021692459,0.0016694608,0.0027059333,0.006824934,0.0026242414,0.004030655,0.00077734084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003614486,0.00009453072,0.0016249196,0.00023588896,0.00019003332,0.0001445416,0.0003185201,0.30447218,0.003120436,0.6337977,0.0020348371,0.05360494],"study_design_scores_gemma":[0.00001074643,0.000025950409,0.00021220309,0.000025471645,0.000023273578,0.000030862135,0.00002811954,0.76897776,0.0009850726,0.22906204,0.0006048168,0.000013803427],"about_ca_topic_score_codex":0.0034905274,"about_ca_topic_score_gemma":0.0029742676,"teacher_disagreement_score":0.008945887,"about_ca_system_score_codex":0.0021351816,"about_ca_system_score_gemma":0.0030722853,"threshold_uncertainty_score":0.04731089},"labels":[],"label_agreement":null},{"id":"W3129546243","doi":"10.1007/978-3-030-67661-2_3","title":"Adaptive Momentum Coefficient for Neural Network Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","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":"York University","funders":"","keywords":"Momentum (technical analysis); Artificial neural network; Computer science; Convergence (economics); Rate of convergence; Mathematical optimization; Term (time); Algorithm; Mathematics; Artificial intelligence; Key (lock); Physics","score_opus":0.020382289840261098,"score_gpt":0.24335972441667206,"score_spread":0.22297743457641095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129546243","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.003546384,0.004042644,0.9790467,0.0003688201,0.0005911976,0.00001944397,0.000048719947,0.0003485178,0.011987581],"genre_scores_gemma":[0.28548262,0.007202909,0.6116278,0.0004505877,0.0010858403,0.00028727992,0.00033547418,0.00095831044,0.0925692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985516,0.000044055443,0.0000062617164,0.000024014742,0.0000567141,0.000013682339],"domain_scores_gemma":[0.99974114,0.00014831824,0.000013449449,0.00002547634,0.000061466686,0.000010153871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044409494,0.0007477996,0.00072673056,0.00029499255,0.00027115902,0.0006791697,0.001086897,0.0011148613,0.005932289],"category_scores_gemma":[0.0021732862,0.0003637005,0.00031229947,0.00072467414,0.00050607655,0.0011314588,0.0008294442,0.0020448316,0.0014268346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008170403,0.00006189805,0.00017649162,0.00026508127,0.000059430797,0.00007413576,0.000039656934,0.5508263,0.005692964,0.10782359,0.025062773,0.30983597],"study_design_scores_gemma":[0.0000043535083,0.000008608224,0.00005895785,0.000014740643,0.000004695187,0.000015066968,0.0000022552342,0.9796952,0.00052664196,0.016355416,0.0033092108,0.000004906989],"about_ca_topic_score_codex":0.0020597568,"about_ca_topic_score_gemma":0.0027220713,"teacher_disagreement_score":0.005932289,"about_ca_system_score_codex":0.00057814294,"about_ca_system_score_gemma":0.0004137671,"threshold_uncertainty_score":0.019845545},"labels":[],"label_agreement":null},{"id":"W3129833897","doi":"10.1007/978-3-030-68790-8_56","title":"Deep Image Clustering Using Self-learning Optimization in a Variational Auto-Encoder","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cluster analysis; Computer science; Autoencoder; Artificial intelligence; Benchmark (surveying); Deep learning; Pattern recognition (psychology); Correlation clustering; Regularization (linguistics); Machine learning; Data mining","score_opus":0.01613476539706432,"score_gpt":0.24639422648682693,"score_spread":0.2302594610897626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129833897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037001679,0.0001374254,0.99466246,0.00007241258,0.000030792402,0.000022810806,0.000040113016,0.00052641146,0.0008074618],"genre_scores_gemma":[0.16929998,0.0002547409,0.820116,0.00021183191,0.00007649104,0.000142044,0.00040430852,0.00065010623,0.0088445265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00009620612,0.000020510402,0.00014404491,0.00010230389,0.000048591126],"domain_scores_gemma":[0.99925715,0.00030948647,0.00005216436,0.00016224831,0.00015944433,0.000059458067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098565,0.0007043537,0.0017324598,0.0007648235,0.00055707694,0.0011114458,0.002468664,0.0020704435,0.0038730998],"category_scores_gemma":[0.0017845834,0.0010283662,0.001309216,0.0011231209,0.0010249184,0.001614853,0.0018925105,0.0020104102,0.0016834635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008685167,0.000092200076,0.00033567933,0.000102728685,0.00009350325,0.000055853096,0.000064957094,0.77976406,0.010253337,0.036212347,0.0047262744,0.16821226],"study_design_scores_gemma":[0.0000017981108,0.0000072920025,0.000019184075,0.000002434211,0.0000028072236,0.000011231486,0.0000023424072,0.9958252,0.00069784326,0.0031820466,0.00024487308,0.0000030536094],"about_ca_topic_score_codex":0.0080386195,"about_ca_topic_score_gemma":0.01056818,"teacher_disagreement_score":0.0080386195,"about_ca_system_score_codex":0.0014878382,"about_ca_system_score_gemma":0.0013453139,"threshold_uncertainty_score":0.015983641},"labels":[],"label_agreement":null},{"id":"W3129849415","doi":"10.1007/978-3-030-67664-3_35","title":"AMQAN: Adaptive Multi-Attention Question-Answer Networks for Answer Selection","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"York University","funders":"","keywords":"Computer science; Question answering; Automatic summarization; Selection (genetic algorithm); Subject (documents); SemEval; Questions and answers; Information retrieval; Artificial intelligence; Data science; World Wide Web; Task (project management)","score_opus":0.02582063519263548,"score_gpt":0.2638765607864926,"score_spread":0.2380559255938571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129849415","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.020167818,0.0022014284,0.93369126,0.0009855215,0.00060555735,0.0004394484,0.0047753267,0.030766705,0.006366926],"genre_scores_gemma":[0.25365517,0.0010434792,0.7028281,0.0011580698,0.000482435,0.0011533569,0.014347312,0.0015424027,0.02378961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992786,0.00019028768,0.000035302724,0.00028044413,0.0001403108,0.00007507712],"domain_scores_gemma":[0.99823856,0.0011654623,0.000054190215,0.00018985919,0.0002492308,0.000102826234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215807,0.0013594235,0.0013412008,0.0015751303,0.00085509766,0.0013731328,0.003037132,0.002159216,0.018683279],"category_scores_gemma":[0.0065341187,0.0007257703,0.0010583829,0.0014919058,0.00047443892,0.003144961,0.002817007,0.0024209253,0.0061397417],"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.0010579034,0.00040425945,0.0014909129,0.0004644514,0.00015925145,0.00013494925,0.00022163834,0.04449568,0.015430949,0.013860722,0.09558989,0.8266894],"study_design_scores_gemma":[0.00006407784,0.00006856635,0.00039517987,0.000024906942,0.000040059593,0.000042306117,0.00003235128,0.96076,0.0045117405,0.024351152,0.009692427,0.000017277003],"about_ca_topic_score_codex":0.008660194,"about_ca_topic_score_gemma":0.012681894,"teacher_disagreement_score":0.018683279,"about_ca_system_score_codex":0.001133947,"about_ca_system_score_gemma":0.0009786385,"threshold_uncertainty_score":0.06250179},"labels":[],"label_agreement":null},{"id":"W3130227814","doi":"10.1007/978-3-030-69480-7_23","title":"Modeling Carbon Dioxide Dispersion Indoors","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic control and management","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":"Carleton University","funders":"","keywords":"Carbon dioxide; Dispersion (optics); Computer science; Carbon dioxide sensor; Space (punctuation); Energy consumption; Process engineering; Simulation; Environmental science; Electrical engineering; Physics; Optics; Chemistry; Engineering","score_opus":0.00856057156082274,"score_gpt":0.19030781178884784,"score_spread":0.1817472402280251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130227814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33129972,0.002610788,0.5519214,0.0012375698,0.00077731645,0.000115685856,0.0024197374,0.001364199,0.10825356],"genre_scores_gemma":[0.94975173,0.0009539713,0.013160687,0.0000971858,0.00010667584,0.00006418298,0.000616365,0.0001626465,0.035086572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998666,0.000020021238,0.0000039329707,0.000048847312,0.000032331947,0.000028243707],"domain_scores_gemma":[0.9997799,0.00012548038,0.000018793115,0.000017084536,0.000039926043,0.00001886739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016104856,0.0009679663,0.0008117425,0.000411065,0.000521314,0.0010728989,0.0011327557,0.0016477369,0.002472201],"category_scores_gemma":[0.0005485963,0.0005786298,0.0008074936,0.00059027283,0.0005560849,0.001158809,0.0006390538,0.00073615735,0.00042640395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010383615,0.000023293296,0.00044201396,0.0000142688405,0.000011204505,0.00002922955,0.00000845267,0.9931156,0.00089617027,0.0026324526,0.00035859612,0.0024584027],"study_design_scores_gemma":[0.0000026924338,0.0000059746553,0.00017077352,0.0000019794609,0.000004601256,0.0000068053932,0.0000058477244,0.9981103,0.00038348685,0.0009562909,0.00034675875,0.000004480097],"about_ca_topic_score_codex":0.056416996,"about_ca_topic_score_gemma":0.031571396,"teacher_disagreement_score":0.056416996,"about_ca_system_score_codex":0.0011424071,"about_ca_system_score_gemma":0.0010030618,"threshold_uncertainty_score":0.11217719},"labels":[],"label_agreement":null},{"id":"W3130382364","doi":"10.1007/978-3-662-53357-4","title":"Financial Cryptography and Data Security","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Banking stability, regulation, efficiency","field":"Economics, Econometrics and Finance","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cryptography; Financial cryptography; Computer security; Data security; Public-key cryptography; Encryption","score_opus":0.020401568787257067,"score_gpt":0.2372191912515711,"score_spread":0.21681762246431402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130382364","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0165838,0.14923096,0.1310164,0.022904405,0.00432065,0.0000889878,0.00038964802,0.00042007267,0.675045],"genre_scores_gemma":[0.51744366,0.10012349,0.036621787,0.004033111,0.0095017515,0.00022113591,0.0005021703,0.00028974775,0.3312632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936765,0.00019951632,0.000031171556,0.000086850734,0.00024631148,0.000068403315],"domain_scores_gemma":[0.9991242,0.0004478895,0.00009249098,0.00021810891,0.00008390887,0.00003335819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071259437,0.0009414842,0.0005295471,0.0013928044,0.0007541512,0.0037946934,0.0003996367,0.0012830416,0.013474866],"category_scores_gemma":[0.002941295,0.00034266745,0.0003233671,0.0019775482,0.0027625903,0.0050826506,0.001243468,0.0032923454,0.0059651104],"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.000025036601,0.000022558688,0.00010049552,0.00009807237,0.000008492949,0.000034619537,0.000056514822,0.0013316413,0.00044522376,0.88933295,0.028053513,0.0804908],"study_design_scores_gemma":[0.000009605978,0.0000135318305,0.000110734836,0.00009425345,0.00000593333,0.00017621563,0.000025462645,0.002114873,0.0005525016,0.90351486,0.093373686,0.00000821415],"about_ca_topic_score_codex":0.00022499484,"about_ca_topic_score_gemma":0.0001621936,"teacher_disagreement_score":0.013474866,"about_ca_system_score_codex":0.0014440914,"about_ca_system_score_gemma":0.0005533419,"threshold_uncertainty_score":0.04507786},"labels":[],"label_agreement":null},{"id":"W3131584316","doi":"10.1007/978-3-030-68787-8_20","title":"Simultaneous Detection of Regular Patterns in Ancient Manuscripts Using GAN-Based Deep Unsupervised Segmentation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Ornaments; Task (project management); Deep learning; Market segmentation; Pattern recognition (psychology); Noise (video); Architecture; Unsupervised learning; Image (mathematics); Archaeology","score_opus":0.020694113141351483,"score_gpt":0.24898078988582437,"score_spread":0.2282866767444729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131584316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16381153,0.0010764796,0.82306534,0.00020569908,0.00026472303,0.00006723462,0.0007947431,0.004399039,0.0063151424],"genre_scores_gemma":[0.7270302,0.0006732986,0.26006848,0.00013954884,0.00016653506,0.000057327612,0.0018853967,0.0006058165,0.0093732765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.000028890448,0.000008531192,0.000091250105,0.00005228043,0.00004375648],"domain_scores_gemma":[0.9996753,0.000087347675,0.00003095074,0.00007069449,0.00010364517,0.00003199416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032666491,0.0007366426,0.0007634399,0.0012183604,0.00022176372,0.0008477681,0.00081584125,0.0005393285,0.0016234331],"category_scores_gemma":[0.00062790455,0.000388614,0.0007879715,0.0011757682,0.0003625849,0.00069593475,0.0007135264,0.0008725309,0.0014095174],"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.0006853731,0.00015670537,0.005091862,0.0002661515,0.00021312316,0.00046161565,0.0002077215,0.078168325,0.16015764,0.0024817765,0.008040465,0.7440692],"study_design_scores_gemma":[0.00001226828,0.000070044865,0.0058265193,0.000021574073,0.000057485446,0.00036597886,0.00007561099,0.9544518,0.03196178,0.0038873907,0.0032430224,0.000026594907],"about_ca_topic_score_codex":0.001723192,"about_ca_topic_score_gemma":0.005420798,"teacher_disagreement_score":0.001723192,"about_ca_system_score_codex":0.00024887468,"about_ca_system_score_gemma":0.0003649378,"threshold_uncertainty_score":0.005430877},"labels":[],"label_agreement":null},{"id":"W3132186272","doi":"10.1007/978-3-642-25324-9","title":"Advances in Artificial Intelligence","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":80,"is_retracted":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":"Computer science; Artificial intelligence; Management science; Economics","score_opus":0.12019662203074666,"score_gpt":0.39583625170935083,"score_spread":0.27563962967860417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132186272","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010542772,0.2450958,0.041056003,0.0080674505,0.010315657,0.00008210244,0.00026112702,0.000620027,0.6934475],"genre_scores_gemma":[0.015152578,0.1727047,0.022469157,0.0032178091,0.0059053735,0.00015869651,0.0005446499,0.00037736457,0.7794697],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993175,0.00010092916,0.0000313398,0.000080665355,0.0004291279,0.000040492294],"domain_scores_gemma":[0.9992459,0.00034632723,0.000035623492,0.00015950276,0.0001451961,0.00006747129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007926524,0.0014371381,0.0014143196,0.0021279268,0.0006832399,0.0036737148,0.0010002552,0.0012556716,0.04316871],"category_scores_gemma":[0.0018899362,0.0005696624,0.0005419478,0.0025355637,0.0015539126,0.0046037585,0.0022933774,0.003525349,0.027348544],"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.000021494652,0.00005665199,0.00013049362,0.00078858837,0.000035394307,0.00006196398,0.00024790608,0.0010173244,0.0007655094,0.1812821,0.35610616,0.4594864],"study_design_scores_gemma":[0.0000054933043,0.0000158315,0.0002065785,0.0003528038,0.000011118092,0.00012276616,0.00005053601,0.00079761416,0.00021133058,0.070919156,0.9273004,0.000006384291],"about_ca_topic_score_codex":0.0005909658,"about_ca_topic_score_gemma":0.0014745741,"teacher_disagreement_score":0.04316871,"about_ca_system_score_codex":0.0011084354,"about_ca_system_score_gemma":0.0011667062,"threshold_uncertainty_score":0.14441365},"labels":[],"label_agreement":null},{"id":"W3132219808","doi":"10.1007/978-3-030-68780-9_53","title":"Explainable Model Selection of a Convolutional Neural Network for Driver’s Facial Emotion Identification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Queen's University","funders":"","keywords":"Computer science; Convolutional neural network; Sadness; Interpretability; Distraction; Artificial intelligence; Anger; Machine learning; Economic shortage; Deep learning; Artificial neural network; Facial expression; Identification (biology); Cognitive psychology","score_opus":0.03967410699317006,"score_gpt":0.29396101977187794,"score_spread":0.25428691277870785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132219808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0876027,0.0005959201,0.9069898,0.00044741394,0.00009858433,0.000048765003,0.00037537946,0.0013634869,0.0024779537],"genre_scores_gemma":[0.8872038,0.0003160803,0.10309577,0.00010192815,0.00005649982,0.000117091666,0.0010472109,0.0001883437,0.007873259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999062,0.000019748139,0.000003795481,0.000032885844,0.000017240853,0.00002011867],"domain_scores_gemma":[0.99979264,0.00010987422,0.000014596803,0.000024787081,0.000048636295,0.0000095737305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003866568,0.00061709626,0.00033643376,0.0002463714,0.00022073132,0.00042761353,0.00080967875,0.0006669387,0.0020828398],"category_scores_gemma":[0.0008971607,0.00038473506,0.0006588763,0.00021906721,0.00019293407,0.0005164787,0.00045178842,0.0009787369,0.00054127927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016793267,0.000055007025,0.0012163733,0.000054449665,0.00009803427,0.00010195311,0.000038744598,0.85699195,0.013021952,0.0058274884,0.002624295,0.119801864],"study_design_scores_gemma":[0.0000012588101,0.0000045135307,0.00013219735,0.0000011666098,0.000004250142,0.0000040207083,0.0000011141161,0.9983847,0.0006497687,0.00071106676,0.000104596875,0.0000013554273],"about_ca_topic_score_codex":0.010914721,"about_ca_topic_score_gemma":0.011156291,"teacher_disagreement_score":0.010914721,"about_ca_system_score_codex":0.00061864883,"about_ca_system_score_gemma":0.0006341708,"threshold_uncertainty_score":0.02170235},"labels":[],"label_agreement":null},{"id":"W3132265601","doi":"10.1007/978-3-030-68887-5_3","title":"Frequency Hopping Spread Spectrum to Counter Relay Attacks in PKESs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Frequency-hopping spread spectrum; Relay; Computer science; Spread spectrum; Computer security; Computer network; Telecommunications; Countermeasure; Bandwidth (computing); Channel (broadcasting); Engineering","score_opus":0.018919738290902554,"score_gpt":0.25790296244847,"score_spread":0.23898322415756745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132265601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11532338,0.006679965,0.8307198,0.00071266317,0.00063378527,0.00016860949,0.00011457285,0.002844138,0.04280308],"genre_scores_gemma":[0.88453805,0.0025665115,0.08478653,0.00024334528,0.00020585116,0.000047529393,0.00011670612,0.00010006623,0.02739541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996815,0.000086518005,0.000013419501,0.000047169706,0.00013876302,0.000032630403],"domain_scores_gemma":[0.9992478,0.00043110494,0.000042412044,0.00015591936,0.00010595445,0.000016876815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038038642,0.00044139134,0.00039562854,0.00057530956,0.0002841536,0.0008897633,0.00047459477,0.0006603474,0.0040961285],"category_scores_gemma":[0.0014580423,0.00016458044,0.00019575401,0.00044190683,0.0004965776,0.0012453805,0.00068840233,0.0009867009,0.0010230752],"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.00093328493,0.00023139582,0.0013427037,0.00055296626,0.00014478544,0.0006742289,0.00039934093,0.070105284,0.12358663,0.13758655,0.00873744,0.6557054],"study_design_scores_gemma":[0.000117780364,0.0015320526,0.0018910388,0.00028963524,0.00029308052,0.003922107,0.00030522046,0.67282903,0.16638568,0.09463648,0.0577299,0.000067991525],"about_ca_topic_score_codex":0.00018257591,"about_ca_topic_score_gemma":0.0002888027,"teacher_disagreement_score":0.0040961285,"about_ca_system_score_codex":0.0002456527,"about_ca_system_score_gemma":0.00020583207,"threshold_uncertainty_score":0.013702869},"labels":[],"label_agreement":null},{"id":"W3132347104","doi":"10.1007/978-3-030-67661-2_23","title":"Incremental Sensitivity Analysis for Kernelized Models","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Regularization (linguistics); Computation; Differentiable function; Training set; Set (abstract data type); Artificial intelligence; Sensitivity (control systems); Regular polygon; Algorithm; Machine learning; Mathematics","score_opus":0.033448647320029425,"score_gpt":0.275059048417063,"score_spread":0.2416104010970336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132347104","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.010556184,0.00046185477,0.98573107,0.00026759753,0.00004707866,0.00006804089,0.00013800249,0.00089778914,0.0018324156],"genre_scores_gemma":[0.6758729,0.0008551536,0.31320632,0.00025380217,0.00027116068,0.00039891846,0.00087489263,0.00090238836,0.007364461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967769,0.0014754506,0.0001480659,0.00045555402,0.0008608689,0.0002832207],"domain_scores_gemma":[0.9721048,0.023567673,0.00076241716,0.0019032314,0.0013959319,0.0002659446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057530603,0.0014796455,0.0018715532,0.001974056,0.0005382585,0.0023219814,0.0027954944,0.0012454541,0.006133399],"category_scores_gemma":[0.031366345,0.0010398988,0.002457882,0.0013036502,0.0013691253,0.004554604,0.0031665405,0.004422233,0.000648267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029450865,0.0001967706,0.0019820582,0.0003864205,0.0002796594,0.00019840828,0.00017294456,0.7696608,0.0033957171,0.10721382,0.0044718925,0.11174708],"study_design_scores_gemma":[0.0000035077546,0.0000131782945,0.00012350306,0.000009685553,0.00001731772,0.000019591756,0.0000060192215,0.9647432,0.00041875403,0.034335654,0.0003029369,0.0000066408174],"about_ca_topic_score_codex":0.002899425,"about_ca_topic_score_gemma":0.002098892,"teacher_disagreement_score":0.006133399,"about_ca_system_score_codex":0.0019049067,"about_ca_system_score_gemma":0.001630042,"threshold_uncertainty_score":0.03042543},"labels":[],"label_agreement":null},{"id":"W3132491413","doi":"10.1007/978-3-030-67658-2_37","title":"Parameterless Semi-supervised Anomaly Detection in Univariate Time Series","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Anomaly detection; Computer science; Univariate; Series (stratigraphy); Data mining; Time series; Cluster analysis; Anomaly (physics); Representation (politics); Process (computing); Pattern recognition (psychology); Artificial intelligence; Machine learning; Multivariate statistics","score_opus":0.01122024185259916,"score_gpt":0.2248268616107407,"score_spread":0.21360661975814155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132491413","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.020888345,0.00023237901,0.9776188,0.000064185675,0.000044091288,0.000009159608,0.00006768164,0.00059112604,0.00048408462],"genre_scores_gemma":[0.70220244,0.00044468272,0.2902558,0.0000753711,0.00028848203,0.000056316938,0.0007172634,0.0003480189,0.005611605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933535,0.0001685215,0.000045932626,0.00020269092,0.00019881829,0.00004859375],"domain_scores_gemma":[0.9974293,0.0014624358,0.0002547763,0.00046075988,0.0003299853,0.00006272351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502943,0.00058365223,0.0010713107,0.00043072068,0.00019066149,0.00071191834,0.0011383818,0.0006660643,0.0008805114],"category_scores_gemma":[0.0047382396,0.0003743926,0.00060063053,0.0006416206,0.00064948987,0.001291139,0.0008792572,0.0012690646,0.0005564889],"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.000472591,0.00013210405,0.0026932845,0.0002405026,0.0001386037,0.00014474847,0.00010842184,0.29210642,0.039833244,0.016083015,0.004839367,0.64320767],"study_design_scores_gemma":[0.0000018311916,0.00002787151,0.00042582696,0.000003124825,0.000005456329,0.000059931906,0.0000032185558,0.99199283,0.0023221688,0.00480356,0.00034959725,0.0000045921574],"about_ca_topic_score_codex":0.0006153094,"about_ca_topic_score_gemma":0.00080075744,"teacher_disagreement_score":0.0011383818,"about_ca_system_score_codex":0.00029940705,"about_ca_system_score_gemma":0.00041036727,"threshold_uncertainty_score":0.005554557},"labels":[],"label_agreement":null},{"id":"W3132571997","doi":"10.1007/978-3-030-68787-8_21","title":"A Two-Stage Unsupervised Deep Learning Framework for Degradation Removal in Ancient Documents","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Task (project management); Generative grammar; Stage (stratigraphy); Degradation (telecommunications); Generative adversarial network; Machine learning; Artificial neural network; State (computer science); Pattern recognition (psychology); Engineering; Algorithm","score_opus":0.021642343373121195,"score_gpt":0.28469750886643447,"score_spread":0.26305516549331326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132571997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022048362,0.000841106,0.97274244,0.00015787629,0.0000820864,0.00004115622,0.0002557807,0.001919487,0.0019116985],"genre_scores_gemma":[0.3386568,0.0011551933,0.63034654,0.0002677044,0.00017721952,0.00015758262,0.0020704533,0.00040376154,0.026764791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997993,0.000026656006,0.000009834893,0.000051762552,0.00006139702,0.000051015188],"domain_scores_gemma":[0.99977416,0.000049357262,0.000017102711,0.00003479377,0.0001051582,0.000019375551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047705468,0.0007088627,0.0008145187,0.00055267353,0.00035828666,0.0007167704,0.001465694,0.00092683337,0.0029831294],"category_scores_gemma":[0.00052542955,0.00041195037,0.0010332552,0.0006476723,0.000324144,0.0008306682,0.0009113655,0.0014103773,0.001419547],"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.0002577681,0.00016143889,0.0007068196,0.00013726238,0.00010203996,0.00010312116,0.00007454881,0.16209409,0.03590711,0.0048771645,0.0067859306,0.78879267],"study_design_scores_gemma":[0.000005421436,0.000035306955,0.00031454762,0.000008008812,0.000016993648,0.00003327103,0.00000845295,0.9915189,0.005512132,0.0012823951,0.0012562829,0.000008137429],"about_ca_topic_score_codex":0.009324533,"about_ca_topic_score_gemma":0.016689045,"teacher_disagreement_score":0.009324533,"about_ca_system_score_codex":0.0005011948,"about_ca_system_score_gemma":0.0010115843,"threshold_uncertainty_score":0.018540502},"labels":[],"label_agreement":null},{"id":"W3132891169","doi":"10.1007/978-3-662-45912-6_7","title":"Meaning–Focused and Quantum–Inspired Information Retrieval","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Meaning (existential); Formalism (music); Scheme (mathematics); Natural language processing; Representation (politics); Artificial intelligence; Information retrieval; Identification (biology); Quantum; Epistemology; Mathematics; Philosophy; Quantum mechanics; Physics","score_opus":0.018553993762251614,"score_gpt":0.22672798980814246,"score_spread":0.20817399604589085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132891169","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.031037437,0.040200308,0.83660257,0.005384354,0.0013986991,0.00010876796,0.0002629948,0.0005631908,0.08444173],"genre_scores_gemma":[0.5623706,0.022571273,0.35421762,0.0016278224,0.003048223,0.00019009295,0.0009114017,0.00034415742,0.054718863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931455,0.00021718063,0.00004788904,0.00011896261,0.00024836016,0.000053063566],"domain_scores_gemma":[0.9989549,0.0006060374,0.00006233374,0.00018829426,0.0001515102,0.000037012367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011719107,0.00041169184,0.00077826803,0.0013829,0.0006815523,0.0026320608,0.0013372857,0.001219299,0.005986374],"category_scores_gemma":[0.0039630304,0.00037010157,0.0007713499,0.0020334783,0.0016673958,0.0052618855,0.001512682,0.0014583159,0.0016283039],"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.00006061744,0.000047656282,0.00020743809,0.0006857366,0.00005800098,0.000060784736,0.00046434542,0.0072968197,0.009658173,0.7809637,0.014199554,0.1862971],"study_design_scores_gemma":[0.000011675407,0.00003296193,0.00040598674,0.000064202926,0.000029433093,0.00018089754,0.00008493242,0.060606584,0.0033741428,0.9069198,0.028250402,0.000039049075],"about_ca_topic_score_codex":0.00044189088,"about_ca_topic_score_gemma":0.00051850063,"teacher_disagreement_score":0.005986374,"about_ca_system_score_codex":0.00094173214,"about_ca_system_score_gemma":0.00048171976,"threshold_uncertainty_score":0.020026386},"labels":[],"label_agreement":null},{"id":"W3133930710","doi":"10.1007/978-3-030-67661-2_2","title":"Exponential Convergence of Gradient Methods in Concave Network Zero-Sum Games","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Zero-sum game; Zero (linguistics); Generalization; Lipschitz continuity; Convergence (economics); Nash equilibrium; Mathematics; Regular polygon; Computer science; Applied mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.09317908722572378,"score_gpt":0.42548853662502933,"score_spread":0.33230944939930557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133930710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01674632,0.0017040404,0.9548767,0.0013632819,0.00023152451,0.000110341345,0.00008919904,0.00023518529,0.0246434],"genre_scores_gemma":[0.5843815,0.005869577,0.33565798,0.001161373,0.00071106665,0.0013312908,0.00042581907,0.0015043293,0.06895711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978581,0.001255792,0.000061493716,0.00019785928,0.00040658357,0.00022019605],"domain_scores_gemma":[0.98038906,0.016958335,0.00041620835,0.000500727,0.0012151987,0.00052046735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006209532,0.0026172989,0.0021816336,0.001862861,0.0009993684,0.003037721,0.003295984,0.002490598,0.0069724703],"category_scores_gemma":[0.033190932,0.0012155198,0.0014506074,0.0016629827,0.004581145,0.0050924397,0.0048829466,0.0058640987,0.0011975026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022696113,0.00014883153,0.0005377072,0.0004453014,0.000085182044,0.00008178934,0.00035721934,0.36484587,0.0015527931,0.58923477,0.0076653203,0.034818225],"study_design_scores_gemma":[0.000020607302,0.00002554907,0.00007720716,0.000046494137,0.0000113699325,0.000020963806,0.00003294385,0.8423066,0.00027894886,0.15617485,0.0009925672,0.0000118398975],"about_ca_topic_score_codex":0.004797605,"about_ca_topic_score_gemma":0.0030019202,"teacher_disagreement_score":0.0069724703,"about_ca_system_score_codex":0.0034588645,"about_ca_system_score_gemma":0.0024723916,"threshold_uncertainty_score":0.032839537},"labels":[],"label_agreement":null},{"id":"W3134042610","doi":"10.1007/978-3-030-68799-1_5","title":"Use of Frequency Domain for Complexity Reduction of Convolutional Neural Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"McMaster University","funders":"","keywords":"Fast Fourier transform; Convolutional neural network; Computer science; Split-radix FFT algorithm; Reduction (mathematics); Computation; Convolution (computer science); Prime-factor FFT algorithm; Computational complexity theory; Quantization (signal processing); Frequency domain; Algorithm; Pruning; Rader's FFT algorithm; Redundancy (engineering); Twiddle factor; Multiplication (music); Parallel computing; Artificial neural network; Fourier transform; Mathematics; Artificial intelligence; Fractional Fourier transform; Fourier analysis","score_opus":0.055151961088720114,"score_gpt":0.2787569622757698,"score_spread":0.22360500118704968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134042610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012012072,0.0010599428,0.9782525,0.00016532216,0.00015213162,0.000028608276,0.00009022746,0.00083135423,0.0074078823],"genre_scores_gemma":[0.18502255,0.0017821349,0.7988176,0.00019135696,0.00022679947,0.00012693382,0.00045296375,0.00040611697,0.012973501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979824,0.00003545611,0.000012223401,0.000036022055,0.000096128366,0.000021871869],"domain_scores_gemma":[0.99955815,0.00021018647,0.00002361026,0.00010387951,0.0000929782,0.000011208239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023834393,0.0008262643,0.00041725353,0.00065351155,0.0002835182,0.0007210142,0.0005425564,0.00041746197,0.0049773506],"category_scores_gemma":[0.001431841,0.00025948262,0.0006170821,0.0005963433,0.0003445939,0.001016218,0.00064657815,0.0010665571,0.0012947188],"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.00018421607,0.0001377992,0.00041492752,0.0002670869,0.00008126518,0.00012787062,0.000057609148,0.09478431,0.09773685,0.06346798,0.005343845,0.73739624],"study_design_scores_gemma":[0.000024374207,0.00016091212,0.00074132043,0.00005094712,0.00006310707,0.00033261816,0.000031480962,0.85004294,0.072522596,0.056605406,0.019392807,0.000031512744],"about_ca_topic_score_codex":0.001023197,"about_ca_topic_score_gemma":0.00234696,"teacher_disagreement_score":0.0049773506,"about_ca_system_score_codex":0.00039443554,"about_ca_system_score_gemma":0.0003501806,"threshold_uncertainty_score":0.016650856},"labels":[],"label_agreement":null},{"id":"W3134117472","doi":"10.1007/978-3-030-68211-8_22","title":"APX-Hardness and Approximation for the k-Burning Number Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; APX; Generalization; Approximation algorithm; Running time; Graph; Mathematics; Sequence (biology); Binary logarithm; Discrete mathematics; Physics; Algorithm; Chemistry; Mathematical analysis","score_opus":0.015196728174047318,"score_gpt":0.2623620611385883,"score_spread":0.24716533296454096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134117472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13087381,0.008258182,0.65648246,0.02903606,0.0020824352,0.0006225253,0.007616018,0.0033978617,0.16163066],"genre_scores_gemma":[0.5732127,0.006856293,0.29758504,0.004726211,0.0032845382,0.0016871346,0.008419402,0.0022966221,0.10193212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996421,0.00088505633,0.00018745981,0.0009976217,0.0009028293,0.00060611474],"domain_scores_gemma":[0.984486,0.011209922,0.00068859797,0.0023733915,0.00056856754,0.0006735854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030063547,0.0025379802,0.0037735323,0.0015177542,0.0032116733,0.007237812,0.00783291,0.0044468385,0.02749172],"category_scores_gemma":[0.018472737,0.0015933234,0.0036797132,0.004565056,0.004354796,0.02068919,0.006747539,0.01466996,0.0044793515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017644105,0.0005870998,0.0018427621,0.0018541474,0.0002598809,0.00030761934,0.0006679375,0.114035524,0.0031867903,0.66401225,0.09149383,0.1199878],"study_design_scores_gemma":[0.00012673304,0.000056926732,0.0004074898,0.00008591296,0.00005852802,0.00021050715,0.00012623679,0.09250974,0.00082645327,0.897949,0.0076125627,0.000029812616],"about_ca_topic_score_codex":0.0030364029,"about_ca_topic_score_gemma":0.0025705684,"teacher_disagreement_score":0.02749172,"about_ca_system_score_codex":0.0043528406,"about_ca_system_score_gemma":0.003143066,"threshold_uncertainty_score":0.09196895},"labels":[],"label_agreement":null},{"id":"W3134132121","doi":"10.1007/978-3-030-88238-9_2","title":"Constructions for Quantum Indistinguishability Obfuscation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Bank of Canada; University of Ottawa","funders":"","keywords":"Obfuscation; Probabilistic logic; Electronic circuit; Logarithm; Boolean circuit; Computer science; Function (biology); Boolean function; Hierarchy; Theoretical computer science; Discrete mathematics; Topology (electrical circuits); Mathematics; Algorithm; Combinatorics; Physics; Quantum mechanics","score_opus":0.0166103677544678,"score_gpt":0.2751060675227601,"score_spread":0.25849569976829234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134132121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04231088,0.0011219576,0.8928579,0.0039110137,0.00070727017,0.00026874073,0.0004867164,0.0018972277,0.056438204],"genre_scores_gemma":[0.74505776,0.0015846802,0.22310247,0.0012111836,0.0004996709,0.0007912938,0.0008882437,0.0010495144,0.02581525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504244,0.0011713863,0.0003160941,0.00066652615,0.0018185485,0.0009850158],"domain_scores_gemma":[0.9915308,0.00424112,0.00032385398,0.0031156915,0.00042116948,0.00036736578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003638233,0.001789039,0.001966626,0.0023520978,0.0047636246,0.0052269124,0.003096376,0.0039051867,0.011159609],"category_scores_gemma":[0.010478901,0.0019097768,0.003084758,0.002812807,0.007799174,0.011227126,0.015616196,0.012482121,0.0028661513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003976464,0.000023525012,0.000077668206,0.000052728894,0.000007817229,0.00003941348,0.00014398756,0.0012953446,0.0007033674,0.9910733,0.0009992407,0.0055437824],"study_design_scores_gemma":[0.000016961845,0.000016061294,0.000055226006,0.000040812312,0.000021531265,0.00006671096,0.000035990437,0.0071387114,0.003345799,0.98477316,0.0044637593,0.00002524908],"about_ca_topic_score_codex":0.0004703424,"about_ca_topic_score_gemma":0.0004748769,"teacher_disagreement_score":0.011159609,"about_ca_system_score_codex":0.0025777135,"about_ca_system_score_gemma":0.0016033952,"threshold_uncertainty_score":0.037332594},"labels":[],"label_agreement":null},{"id":"W3134165843","doi":"10.1007/978-3-030-68799-1_21","title":"Deep Neural Networks for Detecting Real Emotions Using Biofeedback and Voice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Brandon University","funders":"","keywords":"Computer science; Artificial neural network; Deep learning; Set (abstract data type); Biometrics; Biofeedback; Artificial intelligence; Emotion recognition; Deep neural networks; Psychology","score_opus":0.04761155724984085,"score_gpt":0.31188055243194585,"score_spread":0.264268995182105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134165843","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.07753928,0.008210124,0.8992867,0.00045540842,0.00051654957,0.00007910507,0.0010050639,0.0024600993,0.0104476875],"genre_scores_gemma":[0.6607382,0.004691653,0.30158103,0.00031187554,0.00018422773,0.00015943291,0.0013182075,0.00016350274,0.030851727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999461,0.0000063311754,0.0000033374247,0.000014263007,0.000019599687,0.000010398144],"domain_scores_gemma":[0.99992085,0.00004595331,0.0000055563887,0.000007233695,0.000017177525,0.0000031508384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017452436,0.0005859193,0.00022884725,0.00022918919,0.00014271899,0.00042993898,0.00038900969,0.00047504666,0.0038513697],"category_scores_gemma":[0.00039673722,0.00020213888,0.00028152767,0.00034290602,0.00011290542,0.00049260806,0.00032927198,0.00056044146,0.0009028027],"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.00014547056,0.00008689758,0.0009211733,0.00014928203,0.00006011555,0.00005603364,0.000033846038,0.031828213,0.073376104,0.0023579204,0.0045452877,0.88643956],"study_design_scores_gemma":[0.000017183924,0.00013491476,0.0050268187,0.00006190966,0.00007534546,0.00012485539,0.00004110918,0.9343225,0.046097998,0.006267063,0.007802767,0.000027511313],"about_ca_topic_score_codex":0.0028979767,"about_ca_topic_score_gemma":0.006388342,"teacher_disagreement_score":0.0038513697,"about_ca_system_score_codex":0.00028764282,"about_ca_system_score_gemma":0.00018585466,"threshold_uncertainty_score":0.01288414},"labels":[],"label_agreement":null},{"id":"W3134406394","doi":"10.1007/978-3-030-99336-8_1","title":"Categorical Foundations of Gradient-Based Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Gradient descent; Softmax function; Categorical variable; Artificial intelligence; Theoretical computer science; Variety (cybernetics); Python (programming language); Entropy (arrow of time); Algorithm; Machine learning; Artificial neural network; Programming language","score_opus":0.023384148691827804,"score_gpt":0.2553564875562189,"score_spread":0.23197233886439111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134406394","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.009397705,0.0012904,0.95875436,0.0019148203,0.00012752332,0.00003252296,0.00023604622,0.0004444107,0.027802223],"genre_scores_gemma":[0.602478,0.002166694,0.37167865,0.0011117546,0.0004874599,0.00021688097,0.00051959953,0.00046770897,0.020873245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984634,0.0005148461,0.00009272203,0.0002622214,0.000569162,0.00009760502],"domain_scores_gemma":[0.9981275,0.00081881485,0.000115356044,0.00027517605,0.0005081638,0.00015498225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001912501,0.0004245065,0.0004411316,0.0020783679,0.0006806883,0.0035545083,0.0011481576,0.0009708067,0.0062952866],"category_scores_gemma":[0.004779829,0.0002743053,0.0006402108,0.0013835799,0.0046627275,0.0046521192,0.0023475618,0.0024259605,0.0012767129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031503703,0.0000030010112,0.00005359382,0.000018659995,0.0000028380966,0.0000114965505,0.000042374453,0.0014883248,0.00015516969,0.99159473,0.0005474549,0.006079165],"study_design_scores_gemma":[0.0000032600706,0.000007752083,0.00008860383,0.00001678058,0.0000023597083,0.00003222641,0.000018429017,0.016932776,0.00028990084,0.9735657,0.009034769,0.000007325756],"about_ca_topic_score_codex":0.0014276536,"about_ca_topic_score_gemma":0.0008572494,"teacher_disagreement_score":0.0062952866,"about_ca_system_score_codex":0.0016353216,"about_ca_system_score_gemma":0.00066309195,"threshold_uncertainty_score":0.02105987},"labels":[],"label_agreement":null},{"id":"W3134587302","doi":"10.1007/978-3-030-79460-6_9","title":"Mobile Persuasive Application for Responsible Alcohol Use: Drivers for Use and Impact of Social Influence Strategies","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Audit; Alcohol Use Disorders Identification Test; Intervention (counseling); Control (management); Applied psychology; Computer science; Set (abstract data type); Mobile device; Competition (biology); Test (biology); Psychology; Internet privacy; Poison control; Medicine; Injury prevention; Medical emergency; World Wide Web; Artificial intelligence; Business; Psychiatry","score_opus":0.07055621299837173,"score_gpt":0.4171341336076541,"score_spread":0.3465779206092824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134587302","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.9324533,0.005917352,0.008494484,0.0017881156,0.00045974925,0.00044705637,0.0007515869,0.001190176,0.048498172],"genre_scores_gemma":[0.95173734,0.003032391,0.011412233,0.00042225752,0.00019096826,0.00039335183,0.0005454601,0.00011514329,0.03215089],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99985445,0.000043848846,0.0000062761383,0.000015847369,0.00006066493,0.000018794912],"domain_scores_gemma":[0.9982835,0.0014013695,0.00006780798,0.000028059118,0.00013013725,0.000089017056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043585006,0.00034412756,0.00019575439,0.00046477735,0.00022580914,0.00078538817,0.0003238382,0.000531419,0.017714182],"category_scores_gemma":[0.0029458518,0.00009368423,0.00032173732,0.00026224132,0.000068865505,0.0004940088,0.00032730366,0.0004580161,0.0020881223],"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.0013807886,0.003214368,0.03368697,0.00081109616,0.000093271825,0.00045522413,0.0017826741,0.00029749481,0.005776892,0.0011244942,0.016746594,0.9346302],"study_design_scores_gemma":[0.0012721175,0.02273957,0.6609779,0.003995906,0.0026098075,0.0048409435,0.014474817,0.030752469,0.034418833,0.012921686,0.21068789,0.0003080692],"about_ca_topic_score_codex":0.00080568355,"about_ca_topic_score_gemma":0.0015850962,"teacher_disagreement_score":0.017714182,"about_ca_system_score_codex":0.00016546444,"about_ca_system_score_gemma":0.00037690063,"threshold_uncertainty_score":0.059259832},"labels":[],"label_agreement":null},{"id":"W3134710142","doi":"10.1007/978-3-030-70881-8_12","title":"Pisces: A New Zero-Knowledge Protocol for Blockchain Privacy","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Computer science; Gas meter prover; Cryptography; Blockchain; Anonymity; Protocol (science); Verifiable secret sharing; Cryptographic protocol; Theoretical computer science; Hash function; Encryption; Computer security; Programming language; Mathematics","score_opus":0.03576689538066626,"score_gpt":0.3034397396076183,"score_spread":0.26767284422695203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134710142","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.0126888035,0.00085192255,0.9497714,0.0013140842,0.0007960733,0.00033401098,0.00057009055,0.0031704695,0.03050318],"genre_scores_gemma":[0.48654595,0.0026814886,0.3857943,0.0012252503,0.0007560428,0.0015602651,0.0020813495,0.0013684338,0.11798704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976241,0.00055308914,0.00015466804,0.0003057201,0.0010927322,0.00026965374],"domain_scores_gemma":[0.9980393,0.00069783384,0.0001043493,0.0007878565,0.00022667125,0.00014407882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001937588,0.0007997471,0.0010927692,0.0008528576,0.0015702223,0.003037672,0.0026052438,0.0021483982,0.013237826],"category_scores_gemma":[0.0038712146,0.0006371144,0.00067633577,0.0015032701,0.002560899,0.007644659,0.0062729158,0.004394658,0.004715837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008192497,0.00014179476,0.00025170133,0.00037316393,0.00006709846,0.00039958506,0.00043717198,0.018931169,0.012467834,0.7502707,0.025693512,0.190147],"study_design_scores_gemma":[0.00020202603,0.00018706569,0.0001357463,0.00010174222,0.00006595129,0.00047426025,0.00009479746,0.13467304,0.024642715,0.7162142,0.12312194,0.00008646806],"about_ca_topic_score_codex":0.000530139,"about_ca_topic_score_gemma":0.00061239494,"teacher_disagreement_score":0.013237826,"about_ca_system_score_codex":0.0010446621,"about_ca_system_score_gemma":0.001830264,"threshold_uncertainty_score":0.04428494},"labels":[],"label_agreement":null},{"id":"W3134771323","doi":"10.1007/978-3-030-70866-5_8","title":"Active Probing for Improved Machine-Learned Recognition of Network Traffic","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Limiting; Protocol (science); Classifier (UML); Artificial intelligence; Machine learning; Data mining; Computer network; Real-time computing","score_opus":0.021686793890052944,"score_gpt":0.24033722988559553,"score_spread":0.21865043599554257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134771323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01774409,0.00057010166,0.9770897,0.00010075087,0.00013062838,0.000022077706,0.00013909524,0.0035537677,0.00064990314],"genre_scores_gemma":[0.4013939,0.00050977437,0.58861536,0.00021912705,0.00023778137,0.00016396676,0.0010130752,0.000585873,0.0072611533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999271,0.00019458059,0.000041020827,0.00021434935,0.00019964394,0.00007952019],"domain_scores_gemma":[0.9976979,0.0015074171,0.00010217637,0.00036870927,0.00027409344,0.000049617454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009613502,0.0011684167,0.001131834,0.00079082657,0.00031871584,0.001034077,0.002067414,0.0011818238,0.002989318],"category_scores_gemma":[0.0040163086,0.00046986897,0.00058164715,0.0012072243,0.00052565674,0.0018494485,0.001088863,0.0023109557,0.0013386525],"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.0003383886,0.00020974509,0.0009193814,0.00009918586,0.000073754025,0.000071726114,0.00008686511,0.12275944,0.04245006,0.0065632793,0.0062458212,0.82018244],"study_design_scores_gemma":[0.0000036805502,0.000024851193,0.00016625162,0.0000023830823,0.0000053857298,0.00002004036,0.0000037288505,0.99158996,0.0053439946,0.0023407768,0.0004946574,0.000004401107],"about_ca_topic_score_codex":0.0019911863,"about_ca_topic_score_gemma":0.0019996606,"teacher_disagreement_score":0.002989318,"about_ca_system_score_codex":0.0005317942,"about_ca_system_score_gemma":0.00041356342,"threshold_uncertainty_score":0.0100002885},"labels":[],"label_agreement":null},{"id":"W3134820790","doi":"10.1007/978-3-030-70210-6_38","title":"Augmentation of Sonic Meditation Practices: Resonance, Feedback and Interaction Through an Ecosystemic Approach","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"York University","funders":"","keywords":"Active listening; Computer science; Performative utterance; Human–computer interaction; Meditation; Context (archaeology); Audio feedback; Acoustics; Aesthetics; Psychology; Communication","score_opus":0.04272134335404914,"score_gpt":0.3009596412936985,"score_spread":0.25823829793964936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134820790","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.83288866,0.00084508775,0.0836597,0.0012118209,0.00015523218,0.0001230061,0.00008943509,0.0004507388,0.080576345],"genre_scores_gemma":[0.96533304,0.0002683926,0.028248394,0.00007505376,0.00003243779,0.000076204786,0.00003190384,0.000049128834,0.005885405],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976665,0.00009247104,0.000009911819,0.00004078778,0.00006123637,0.000028929684],"domain_scores_gemma":[0.9996056,0.00022732292,0.00003114774,0.00004891314,0.000037019807,0.000049971568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423271,0.000227421,0.00014157203,0.0002747801,0.0006126428,0.0017679663,0.00039801231,0.0004929117,0.0055650803],"category_scores_gemma":[0.0010759732,0.00016528736,0.00022963586,0.0002516763,0.00053315563,0.0011522367,0.0019008749,0.00048431486,0.00049791567],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001950048,0.0015527165,0.013696051,0.001068691,0.00015059918,0.00056464813,0.022099253,0.0035780966,0.32951534,0.038943067,0.0026394872,0.58424205],"study_design_scores_gemma":[0.0009854698,0.011153191,0.32375595,0.001719653,0.0011971688,0.003746623,0.06518146,0.09592745,0.15743586,0.12462053,0.21393414,0.00034254874],"about_ca_topic_score_codex":0.00035326867,"about_ca_topic_score_gemma":0.0008788041,"teacher_disagreement_score":0.0055650803,"about_ca_system_score_codex":0.00023512193,"about_ca_system_score_gemma":0.0003792645,"threshold_uncertainty_score":0.018617034},"labels":[],"label_agreement":null},{"id":"W3135169176","doi":"10.1007/978-3-030-80209-7_7","title":"An Auditory Cortex Model for Sound Processing","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Neuroscience and Music Perception","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"Agence Nationale de la Recherche","keywords":"Auditory cortex; Fourier transform; Sound (geography); Heisenberg group; Iterative reconstruction; Computer science; Computational auditory scene analysis; Frequency domain; Domain (mathematical analysis); Speech recognition; Image (mathematics); Acoustics; Algorithm; Computer vision; Artificial intelligence; Mathematics; Physics; Psychology; Mathematical analysis; Neuroscience","score_opus":0.058516942681775305,"score_gpt":0.3306460188902743,"score_spread":0.27212907620849897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135169176","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.030307246,0.0014978863,0.9146286,0.0023154605,0.00047697106,0.000057184643,0.00078542816,0.0009164498,0.049014732],"genre_scores_gemma":[0.8668335,0.0018709786,0.07082813,0.0006468933,0.00046004975,0.0001738759,0.0004453104,0.00033408456,0.058407143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999367,0.000013737259,0.0000028809802,0.000017362807,0.00001409149,0.000015213287],"domain_scores_gemma":[0.99989176,0.00004013591,0.000006719362,0.000013538954,0.000031540312,0.000016269878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019550648,0.0005488215,0.00051899435,0.00036934292,0.00032358052,0.0009531734,0.0013476844,0.0014378799,0.01129409],"category_scores_gemma":[0.00058845704,0.0002866037,0.0008951503,0.00039620092,0.0003079083,0.0011673388,0.0006109806,0.0007607928,0.002286787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022538513,0.00009515825,0.0005350098,0.00029672607,0.00016064687,0.0005989871,0.00019722813,0.5122141,0.034115076,0.3870979,0.010828149,0.0536356],"study_design_scores_gemma":[0.000026246718,0.000020428142,0.00016003031,0.000008755529,0.000029646759,0.00008349904,0.000014881942,0.9141126,0.00084110774,0.08227379,0.002418759,0.000010231693],"about_ca_topic_score_codex":0.0031413843,"about_ca_topic_score_gemma":0.0028758694,"teacher_disagreement_score":0.01129409,"about_ca_system_score_codex":0.0004206139,"about_ca_system_score_gemma":0.000504473,"threshold_uncertainty_score":0.03778249},"labels":[],"label_agreement":null},{"id":"W3135339118","doi":"10.1007/978-3-030-70210-6_10","title":"Modelling 4-Dimensional Tonal Pitch Spaces with Hopf Fibration","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Hyperspace; Hopf fibration; Space (punctuation); Computer science; Harmonic; Euler's formula; Musical; Pure mathematics; Mathematics; Mathematical analysis; Acoustics; Artificial intelligence; Physics; Visual arts; Art","score_opus":0.018009294409065714,"score_gpt":0.22083962051174108,"score_spread":0.20283032610267537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135339118","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.2844717,0.0006106077,0.67067677,0.0001972172,0.0001977568,0.000047032947,0.00015546005,0.00095377024,0.042689614],"genre_scores_gemma":[0.9350416,0.0003640944,0.05023294,0.000031495787,0.00006259726,0.00003690126,0.00011137766,0.00012633158,0.013992589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986374,0.000034210465,0.000009953364,0.000027947766,0.000029766506,0.000034306453],"domain_scores_gemma":[0.9998357,0.000051867322,0.000025766061,0.000030540614,0.00002451696,0.000031511787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022552081,0.0007054923,0.0004444479,0.00067495194,0.0005597336,0.0019365149,0.00062144734,0.0008849069,0.006325459],"category_scores_gemma":[0.0005080706,0.0003867998,0.0007278315,0.000386137,0.0013422909,0.0021871545,0.0016197676,0.0006518271,0.0011899463],"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.00021701802,0.00005012761,0.0009828105,0.00014634346,0.000051109855,0.0006912826,0.0009167177,0.18350142,0.03243354,0.7527172,0.00082587806,0.02746645],"study_design_scores_gemma":[0.00002590817,0.00009675818,0.0004697956,0.000031018517,0.000023959377,0.00021695127,0.00033566085,0.51386714,0.005870077,0.47010806,0.008910844,0.000043865188],"about_ca_topic_score_codex":0.0010506816,"about_ca_topic_score_gemma":0.0007903471,"teacher_disagreement_score":0.006325459,"about_ca_system_score_codex":0.00056302914,"about_ca_system_score_gemma":0.00023493548,"threshold_uncertainty_score":0.021160722},"labels":[],"label_agreement":null},{"id":"W3135349823","doi":"10.1007/978-3-030-67070-2_30","title":"AIM 2020: Scene Relighting and Illumination Estimation Challenge","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Standard illuminant; Computer science; Track (disk drive); Artificial intelligence; Computer vision; Orientation (vector space); Position (finance); Computer graphics (images); Mathematics","score_opus":0.013392730387762496,"score_gpt":0.24703800825525146,"score_spread":0.23364527786748895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135349823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08413439,0.0069276504,0.767782,0.007987879,0.0024588297,0.0007777132,0.02549057,0.026193224,0.07824772],"genre_scores_gemma":[0.22358127,0.0022942533,0.63974184,0.003138667,0.0011766488,0.00040725758,0.07947059,0.00401136,0.046178136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851686,0.00031810207,0.00004172898,0.00031214376,0.00064301665,0.0001680607],"domain_scores_gemma":[0.99838114,0.00058260345,0.00004669679,0.00044384782,0.00036473628,0.00018100477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019319417,0.0015148686,0.0017371741,0.00072434306,0.0008814369,0.0018713741,0.0021685709,0.0026160297,0.010263511],"category_scores_gemma":[0.004322806,0.00059732224,0.0014886163,0.00086641806,0.0009007663,0.0015571082,0.002831113,0.0030968795,0.009254971],"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.0016493115,0.00072258286,0.0013332969,0.0019471522,0.00024291483,0.00043713537,0.00022943704,0.047284734,0.041904666,0.0137616,0.37470376,0.5157834],"study_design_scores_gemma":[0.0005073516,0.001484608,0.008122224,0.0003251566,0.00018710115,0.0022247988,0.00054070476,0.61959815,0.0786071,0.06708149,0.22118086,0.0001404554],"about_ca_topic_score_codex":0.0037630103,"about_ca_topic_score_gemma":0.0049703275,"teacher_disagreement_score":0.010263511,"about_ca_system_score_codex":0.0004798396,"about_ca_system_score_gemma":0.0013495178,"threshold_uncertainty_score":0.03433484},"labels":[],"label_agreement":null},{"id":"W3135419330","doi":"10.1007/978-3-030-91445-5_11","title":"RevDet: Robust and Memory Efficient Event Detection and Tracking in Large News Feeds","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Event (particle physics); Cluster analysis; Data mining; Redundancy (engineering); Ground truth; Tracking (education); Task (project management); Artificial intelligence; Focus (optics); Robustness (evolution); Machine learning","score_opus":0.012680521811543562,"score_gpt":0.2479529390415176,"score_spread":0.23527241722997405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135419330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031862058,0.001772135,0.8756186,0.00040060488,0.00069127517,0.00021800179,0.0072765015,0.078710645,0.0034502745],"genre_scores_gemma":[0.18636553,0.0009430153,0.77046466,0.0003030803,0.0005646087,0.00029841665,0.017628612,0.0022812886,0.021150835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993692,0.00009111611,0.000044710236,0.00019770229,0.00023529641,0.0000620804],"domain_scores_gemma":[0.9982665,0.0009062499,0.00010346625,0.0004343808,0.00021556116,0.00007395373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011390011,0.0017748541,0.0014388437,0.0018220622,0.0005947287,0.0018910095,0.002082085,0.0012127605,0.006306895],"category_scores_gemma":[0.0039663184,0.00087974075,0.00062641565,0.00205183,0.00038198588,0.0026829268,0.0019505612,0.0011462255,0.0056615216],"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.0014949212,0.00022788209,0.0023265528,0.00030685333,0.0001901705,0.0002815756,0.000088439774,0.039194867,0.028359843,0.0043126117,0.092657916,0.8305583],"study_design_scores_gemma":[0.0001217143,0.00015610266,0.0016083795,0.000022968537,0.000054961583,0.00032562774,0.00006219422,0.94109166,0.030226164,0.009252625,0.017025508,0.000052134834],"about_ca_topic_score_codex":0.0048649535,"about_ca_topic_score_gemma":0.008571182,"teacher_disagreement_score":0.006306895,"about_ca_system_score_codex":0.0005120719,"about_ca_system_score_gemma":0.0007184189,"threshold_uncertainty_score":0.021098614},"labels":[],"label_agreement":null},{"id":"W3135867811","doi":"10.1007/978-3-030-85947-3_1","title":"Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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":"McGill University","funders":"","keywords":"Revenue; Valuation (finance); Linear programming; Integer programming; Sample (material); Mathematical optimization; Upper and lower bounds; Integer (computer science); Mathematics; Computer science; Microeconomics; Business; Economics; Finance","score_opus":0.047478539683634295,"score_gpt":0.367429399331766,"score_spread":0.3199508596481317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135867811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044152755,0.001094284,0.9339944,0.0020975696,0.00042337575,0.00019556822,0.00064007903,0.0015753249,0.015826562],"genre_scores_gemma":[0.69042456,0.0006892839,0.2917906,0.0010723083,0.00087557686,0.0005988397,0.001005769,0.001379943,0.012163082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991651,0.003474551,0.00026703678,0.0011774579,0.0020470018,0.0013829882],"domain_scores_gemma":[0.97616684,0.01751461,0.0008946787,0.0032892476,0.0011833219,0.00095128577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0089478865,0.0036691537,0.004736113,0.0013443455,0.0013240511,0.006303265,0.0064565702,0.0028613203,0.014956728],"category_scores_gemma":[0.03367215,0.0019819057,0.0024717918,0.0026953456,0.0023675112,0.009154892,0.006246534,0.008777632,0.0029554768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004088352,0.0016231816,0.002166891,0.0008884413,0.00035766693,0.00043781352,0.00029998066,0.46776426,0.007919697,0.34778512,0.027406335,0.1392623],"study_design_scores_gemma":[0.00014294666,0.00011409175,0.00018023323,0.00002831693,0.00002996042,0.000070102855,0.000021616326,0.8969449,0.0011398931,0.1003504,0.00095549173,0.000022000037],"about_ca_topic_score_codex":0.0007784349,"about_ca_topic_score_gemma":0.0011005228,"teacher_disagreement_score":0.014956728,"about_ca_system_score_codex":0.0024271624,"about_ca_system_score_gemma":0.0032920686,"threshold_uncertainty_score":0.050035298},"labels":[],"label_agreement":null},{"id":"W3136224158","doi":"10.1007/978-3-030-85172-9_9","title":"SEH: Size Estimate Hedging for Single-Server Queues","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision 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":"McMaster University","funders":"","keywords":"Queue; Computer science; Scheduling (production processes); Heuristic; Simple (philosophy); Real-time computing; Distributed computing; Mathematical optimization; Computer network; Mathematics; Artificial intelligence","score_opus":0.12103199500715305,"score_gpt":0.4367620829872396,"score_spread":0.31573008798008656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136224158","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.046635367,0.00066287594,0.93818325,0.00083035894,0.00037007863,0.00020089802,0.0006661558,0.0094488375,0.00300221],"genre_scores_gemma":[0.7333971,0.0004923914,0.25181305,0.00035361858,0.0004904168,0.00020014987,0.0011547421,0.0009073279,0.011191173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823344,0.0005176838,0.00010655333,0.00021068224,0.0006586851,0.00027305319],"domain_scores_gemma":[0.9947542,0.0023511003,0.00024265917,0.0017610742,0.0005705937,0.0003203556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004030324,0.0011069361,0.0016822056,0.0011898322,0.00061999407,0.0023004704,0.0028388451,0.0011177607,0.010178245],"category_scores_gemma":[0.012774686,0.000739345,0.00080369785,0.0013194405,0.001042378,0.0031409378,0.0033274433,0.0025561776,0.0019398761],"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.003962215,0.00050833094,0.002976151,0.00030397862,0.00021615319,0.00024168054,0.00022248311,0.40286148,0.012693719,0.080562994,0.039076302,0.45637456],"study_design_scores_gemma":[0.00015401459,0.00015895175,0.00034631448,0.000010886553,0.000023372537,0.000044787517,0.000022491839,0.95016235,0.004287837,0.0434297,0.0013375924,0.000021760745],"about_ca_topic_score_codex":0.00159057,"about_ca_topic_score_gemma":0.0014579,"teacher_disagreement_score":0.010178245,"about_ca_system_score_codex":0.0011567958,"about_ca_system_score_gemma":0.0018537623,"threshold_uncertainty_score":0.03404957},"labels":[],"label_agreement":null},{"id":"W3136294708","doi":"","title":"Active Media Technology: Preface","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.018152196509765635,"score_gpt":0.2480455347625912,"score_spread":0.22989333825282557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136294708","genre_codex":"review","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026568335,0.4773605,0.02486873,0.017918656,0.13831969,0.00032557608,0.00083180005,0.00021980093,0.33749855],"genre_scores_gemma":[0.026279755,0.39890394,0.00473049,0.0058696093,0.07747974,0.00038140605,0.0013742474,0.00039501415,0.48458588],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969673,0.000061949206,0.000030293153,0.000063677064,0.00011603874,0.000031348554],"domain_scores_gemma":[0.9987423,0.00035806568,0.00005445593,0.00010436426,0.0005260625,0.00021484359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477003,0.001510251,0.000682367,0.003255442,0.001744443,0.0035677787,0.0008379567,0.0020637214,0.025856303],"category_scores_gemma":[0.0019239509,0.0003819187,0.00043325796,0.003665451,0.0012279225,0.0048219766,0.0021587312,0.003944946,0.016590752],"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.00006202726,0.00022904358,0.00031219635,0.001986091,0.00001084256,0.00030160593,0.00087769487,0.0007858869,0.001638962,0.0614135,0.48072693,0.45165518],"study_design_scores_gemma":[0.0000024170654,0.00004140715,0.0005422669,0.00084023114,0.00000374651,0.00014834455,0.00020661466,0.00007108973,0.00027385599,0.0069053993,0.99095494,0.000009760134],"about_ca_topic_score_codex":0.0020265018,"about_ca_topic_score_gemma":0.0025372053,"teacher_disagreement_score":0.025856303,"about_ca_system_score_codex":0.0015001455,"about_ca_system_score_gemma":0.0015350035,"threshold_uncertainty_score":0.08649802},"labels":[],"label_agreement":null},{"id":"W3136625733","doi":"10.1007/978-3-662-63170-6_7","title":"Novel Hybrid GWO-WOA and BAT-PSO Algorithms for Solving Design Optimization Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mathematical optimization; Optimization algorithm; Algorithm; Mathematics","score_opus":0.05171167206694603,"score_gpt":0.2819092111108858,"score_spread":0.23019753904393975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136625733","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.0104933735,0.00081110507,0.97876465,0.000086222164,0.0001642256,0.00005492078,0.000056443027,0.0005040451,0.009065072],"genre_scores_gemma":[0.21495749,0.0007052363,0.769893,0.00018809787,0.00011722649,0.00034961037,0.00028600296,0.00022147373,0.013281835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973994,0.000058766847,0.000014797441,0.000035627512,0.0001250633,0.000025863688],"domain_scores_gemma":[0.9997913,0.00008111889,0.000022158954,0.000024626848,0.00006481706,0.000015953678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046756535,0.0008950215,0.001122791,0.00058418815,0.0003433674,0.0009222224,0.0011523234,0.0010104722,0.0042566764],"category_scores_gemma":[0.0007459821,0.0004407388,0.00081502023,0.0013025773,0.0002962925,0.00076837715,0.0008154973,0.0008137973,0.0010308101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012690412,0.00016033955,0.00058596826,0.00026691283,0.00014454285,0.00008931648,0.00004330025,0.68756706,0.008176967,0.01642339,0.0044734525,0.2819419],"study_design_scores_gemma":[0.000009908655,0.000026169739,0.000085617634,0.000005819678,0.000008587894,0.000019318875,0.000003985379,0.99684685,0.00037024685,0.0013884,0.0012311508,0.0000039752404],"about_ca_topic_score_codex":0.0014799436,"about_ca_topic_score_gemma":0.0031269672,"teacher_disagreement_score":0.0042566764,"about_ca_system_score_codex":0.00023100089,"about_ca_system_score_gemma":0.00057616126,"threshold_uncertainty_score":0.014239967},"labels":[],"label_agreement":null},{"id":"W3136821436","doi":"10.1007/978-3-030-78361-7_22","title":"Impact of Task Cycle Pattern on Project Success in Software Crowdsourcing","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Crowdsourcing; Waterfall model; Crowdsourcing software development; Computer science; Task (project management); Software; Waterfall; Software development; Resource (disambiguation); Upload; Software development process; Software engineering; Systems engineering; World Wide Web; Engineering; Operating system; Geography","score_opus":0.017974336614667196,"score_gpt":0.31041730116081667,"score_spread":0.2924429645461495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136821436","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.9969438,0.00008309218,0.00091418007,0.0001062295,0.000015679449,0.000042756732,0.00012465609,0.000066616594,0.0017030347],"genre_scores_gemma":[0.9986745,0.000019249115,0.000416468,0.000018476296,0.000007326674,0.000023859582,0.00011021989,0.000017892833,0.00071196165],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9934881,0.0024610385,0.000441018,0.0009705386,0.0016839299,0.0009554722],"domain_scores_gemma":[0.8441572,0.11500944,0.013533144,0.009800569,0.00804141,0.009458169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011523494,0.00033086925,0.00051268947,0.0015961706,0.0012175366,0.0025219868,0.001069836,0.0016254776,0.0052033593],"category_scores_gemma":[0.10163363,0.00031680698,0.0004964766,0.0017927395,0.00058153074,0.0020423876,0.0015091656,0.0011703528,0.0011640842],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009404224,0.0036173211,0.73049575,0.00046359387,0.0005269208,0.00041985634,0.0022019448,0.041460197,0.010312354,0.0020345598,0.004692902,0.19437034],"study_design_scores_gemma":[0.00046062536,0.0038434684,0.86571133,0.00014553066,0.00030390898,0.00035835075,0.0058962894,0.10899857,0.0030662154,0.00826858,0.0028026488,0.00014453976],"about_ca_topic_score_codex":0.0076745194,"about_ca_topic_score_gemma":0.008549353,"teacher_disagreement_score":0.011523494,"about_ca_system_score_codex":0.0012501695,"about_ca_system_score_gemma":0.0029488814,"threshold_uncertainty_score":0.06094283},"labels":[],"label_agreement":null},{"id":"W3137514950","doi":"10.1007/978-3-642-29645-1_10","title":"Summary of the Workshop on Multi-Paradigm Modelling: Concepts and Tools","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Computer science; Management science; Software engineering; Data science; Operations research; Engineering","score_opus":0.04384727044702007,"score_gpt":0.2685007000944661,"score_spread":0.224653429647446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137514950","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008626668,0.15697402,0.4311371,0.04768774,0.11737456,0.001753597,0.0059720036,0.003020065,0.22745425],"genre_scores_gemma":[0.034303874,0.1200191,0.16256912,0.009636769,0.018536171,0.0014286569,0.017581312,0.0034107366,0.6325143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836427,0.00033267253,0.00013151964,0.00036662514,0.000641355,0.00016351174],"domain_scores_gemma":[0.99812144,0.00028134824,0.000047172285,0.0002281813,0.0009897151,0.0003321713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004515028,0.00218444,0.0016787931,0.0024004574,0.0012935528,0.007011875,0.0027181944,0.0028050654,0.04102337],"category_scores_gemma":[0.0037673318,0.00097317557,0.002534664,0.0036647303,0.0006282308,0.0058902088,0.0031227116,0.0051542707,0.023720028],"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.00023507264,0.00029208246,0.0002763388,0.0017474265,0.00006851264,0.00026991504,0.0007745788,0.0038487678,0.005671511,0.042559393,0.58450776,0.35974872],"study_design_scores_gemma":[0.000026361004,0.00007336523,0.00027927136,0.0006292895,0.000044763172,0.00018026524,0.00018778308,0.001932818,0.002167323,0.015983505,0.97844815,0.000047069952],"about_ca_topic_score_codex":0.004410348,"about_ca_topic_score_gemma":0.0060409103,"teacher_disagreement_score":0.04102337,"about_ca_system_score_codex":0.0026194905,"about_ca_system_score_gemma":0.003969241,"threshold_uncertainty_score":0.13723683},"labels":[],"label_agreement":null},{"id":"W3137583499","doi":"10.1007/978-3-030-71292-1_49","title":"Locating Embodied Forms of Urban Wayfinding: An Exploration","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situated; Embodied cognition; Situational ethics; Context (archaeology); Human–computer interaction; Sociology; Computer science; Geography; Psychology; Social psychology; Artificial intelligence","score_opus":0.05019263495259416,"score_gpt":0.2951478053576973,"score_spread":0.24495517040510315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137583499","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.22047524,0.030293314,0.30381662,0.006114408,0.00034609585,0.000087587,0.00032302624,0.00031464023,0.43822905],"genre_scores_gemma":[0.8322346,0.011553523,0.11298119,0.00017925915,0.000066001885,0.000062253894,0.00019254732,0.00011345806,0.04261721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9997485,0.00011454729,0.000008031123,0.000053911597,0.000043969234,0.000031011547],"domain_scores_gemma":[0.9996551,0.00020755845,0.000028445229,0.000052532123,0.00003975321,0.000016541353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000471539,0.00046625015,0.00030928344,0.0010194188,0.00093574286,0.0061277677,0.0015231791,0.001449444,0.0075632874],"category_scores_gemma":[0.0017420416,0.00034096543,0.00035798707,0.0026502549,0.0033372846,0.008232204,0.002179996,0.00070660864,0.0011349439],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010291035,0.00004681811,0.0020602494,0.00046268536,0.000018137403,0.0007299455,0.030192794,0.003714388,0.003823093,0.76128227,0.0059020407,0.19166474],"study_design_scores_gemma":[0.000023777693,0.00011567515,0.0062293913,0.0008901359,0.000046937945,0.003611107,0.07077203,0.026191741,0.004346243,0.6369544,0.25073186,0.00008663585],"about_ca_topic_score_codex":0.003960944,"about_ca_topic_score_gemma":0.0059706355,"teacher_disagreement_score":0.0075632874,"about_ca_system_score_codex":0.0009557829,"about_ca_system_score_gemma":0.0006716509,"threshold_uncertainty_score":0.025301754},"labels":[],"label_agreement":null},{"id":"W3137739144","doi":"10.1007/978-3-030-71305-8_19","title":"Data and Privacy in a Quasi-Public Space: Disney World as a Smart City","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"York University","funders":"","keywords":"Smart city; Private space; Normative; Corporate governance; Big data; Internet privacy; Public space; Public relations; Theme (computing); Information privacy; Space (punctuation); Computer science; Business; Political science; Architectural engineering; World Wide Web; Engineering; Internet of Things","score_opus":0.06068954037903392,"score_gpt":0.3194477431396397,"score_spread":0.2587582027606058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137739144","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.011809344,0.032003947,0.03286013,0.10847556,0.004550282,0.0000495362,0.00028311074,0.00025253356,0.80971557],"genre_scores_gemma":[0.33676788,0.024261268,0.016128708,0.013635287,0.0022560963,0.00009653507,0.00027624797,0.00041315227,0.6061649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9991823,0.00028585075,0.000024993205,0.00012801347,0.00026922583,0.00010967768],"domain_scores_gemma":[0.9993685,0.00023931499,0.000031687683,0.000141679,0.00011796229,0.00010096232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010430779,0.0004330191,0.00030757382,0.00054179574,0.0041438662,0.0108489655,0.0006691135,0.0021294442,0.011298904],"category_scores_gemma":[0.0016684495,0.0002750257,0.00029490763,0.0019396842,0.011735135,0.016236022,0.0038411224,0.004668208,0.0020798142],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008310284,0.000004350892,0.000044303786,0.000011752093,0.0000010098628,0.000019563906,0.0014736662,0.00013034888,0.000047854683,0.9571336,0.03111707,0.010008227],"study_design_scores_gemma":[0.0000031801885,0.000008399946,0.000102377104,0.00006047834,0.0000025979243,0.00007613151,0.0018626556,0.00045461356,0.00012855962,0.30838853,0.68890244,0.000009998298],"about_ca_topic_score_codex":0.018882938,"about_ca_topic_score_gemma":0.019469243,"teacher_disagreement_score":0.018882938,"about_ca_system_score_codex":0.0038799052,"about_ca_system_score_gemma":0.0032068016,"threshold_uncertainty_score":0.037798584},"labels":[],"label_agreement":null},{"id":"W3137928250","doi":"10.1007/978-3-540-75563-0_26","title":"A Goal Oriented Approach for Modeling and Analyzing Security Trade-Offs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Software engineering","score_opus":0.04646338717370364,"score_gpt":0.29509569811493847,"score_spread":0.24863231094123484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137928250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002351515,0.00016885574,0.9936785,0.0002348832,0.000017823317,0.0000998684,0.00009908886,0.00031132108,0.003038025],"genre_scores_gemma":[0.0900174,0.00061628956,0.9051332,0.00019044723,0.000053876898,0.00045288468,0.0002763641,0.00017407638,0.0030854733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964994,0.0013830728,0.0002888729,0.0004991528,0.0010144459,0.00031490778],"domain_scores_gemma":[0.9960276,0.0023975389,0.00043580763,0.00054807635,0.00044026575,0.00015079591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046836203,0.0027547062,0.0014778228,0.0033447598,0.0011238278,0.0054833842,0.0041493718,0.0023555344,0.0034165191],"category_scores_gemma":[0.0069048125,0.0016545611,0.003699292,0.0030158123,0.0027518678,0.005432879,0.0022353057,0.0037682212,0.00079620053],"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.000052408053,0.00015528659,0.0010323292,0.00023635107,0.00021188676,0.00024200349,0.00031648146,0.31545684,0.0017723069,0.64550376,0.0018090144,0.033211395],"study_design_scores_gemma":[0.000024338073,0.000041611835,0.00014607662,0.00006390245,0.0001326104,0.00007170077,0.00008053112,0.6240401,0.0011336539,0.36828113,0.005957682,0.00002666598],"about_ca_topic_score_codex":0.00776534,"about_ca_topic_score_gemma":0.008332877,"teacher_disagreement_score":0.00776534,"about_ca_system_score_codex":0.0024284858,"about_ca_system_score_gemma":0.002855528,"threshold_uncertainty_score":0.024769604},"labels":[],"label_agreement":null},{"id":"W3138170179","doi":"10.1007/978-3-642-16170-4_22","title":"On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Price of anarchy; Marginal cost; Mathematical economics; Upper and lower bounds; Economics; Competition (biology); Market clearing; Microeconomics; Mathematics; Price of stability","score_opus":0.014951081354875011,"score_gpt":0.19718448475667172,"score_spread":0.1822334034017967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138170179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07460864,0.0031997699,0.8515906,0.004437125,0.00029688948,0.00025121894,0.00026994018,0.00033131975,0.0650145],"genre_scores_gemma":[0.78736717,0.0033067532,0.1775276,0.0010701406,0.0010518505,0.0006714599,0.00033612127,0.000507555,0.02816134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.980984,0.011537713,0.00080561964,0.0016018458,0.0034740923,0.001596741],"domain_scores_gemma":[0.88796633,0.093572885,0.0038896988,0.010168313,0.0031914178,0.001211385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024387049,0.001725418,0.0042693084,0.002241765,0.0021559894,0.008652808,0.00658662,0.004867313,0.01539327],"category_scores_gemma":[0.091856755,0.001767767,0.0026476006,0.003262276,0.010181819,0.0210095,0.0054810573,0.0066856844,0.0016128577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103574144,0.00005012092,0.00020238839,0.00006754194,0.00003623461,0.000031603362,0.000091504065,0.01598528,0.00032334664,0.9732964,0.0012814893,0.008530505],"study_design_scores_gemma":[0.000067105364,0.000020820653,0.00008840591,0.00001757453,0.00001606128,0.00004337497,0.00001964764,0.049997456,0.00022015849,0.94875115,0.00074452587,0.000013728485],"about_ca_topic_score_codex":0.001489172,"about_ca_topic_score_gemma":0.0008375332,"teacher_disagreement_score":0.024387049,"about_ca_system_score_codex":0.003941217,"about_ca_system_score_gemma":0.0037923239,"threshold_uncertainty_score":0.12897259},"labels":[],"label_agreement":null},{"id":"W3138190335","doi":"10.1007/978-3-030-75762-5_55","title":"AngryBERT: Joint Learning Target and Emotion for Hate Speech Detection","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","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 Saskatchewan","funders":"","keywords":"Multi-task learning; Computer science; Voice activity detection; Task (project management); Artificial intelligence; Speech recognition; Emotion detection; Joint (building); Identification (biology); Natural language processing; Machine learning; Speech processing; Emotion recognition","score_opus":0.01452091940684636,"score_gpt":0.23903550936458817,"score_spread":0.22451458995774182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138190335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084582604,0.0014329451,0.8074286,0.00051001756,0.00070728146,0.00037150935,0.003474416,0.09467934,0.00681326],"genre_scores_gemma":[0.48982376,0.00050926197,0.44402307,0.0006048662,0.0003536592,0.00052315113,0.0074416245,0.0031553123,0.05356534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928904,0.00012829727,0.000017886932,0.00024271525,0.00018195322,0.00014010248],"domain_scores_gemma":[0.99948454,0.00017341647,0.000028221932,0.00010296774,0.00014317977,0.00006762791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010461679,0.0024553756,0.0013983,0.0011300596,0.000633419,0.00116425,0.0016075331,0.0023270515,0.009278738],"category_scores_gemma":[0.0019081904,0.00069978816,0.000779564,0.0006131884,0.00031672636,0.0013746887,0.002339873,0.001495179,0.008306351],"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.001588036,0.00049958547,0.0042973934,0.00015084023,0.0003146282,0.00026888592,0.00012308733,0.016093362,0.07148074,0.00097346364,0.04358258,0.8606275],"study_design_scores_gemma":[0.0001165485,0.00036982636,0.006181554,0.00002185742,0.0001256815,0.00028712262,0.000068906666,0.89816934,0.082949184,0.0034058485,0.008231111,0.00007304139],"about_ca_topic_score_codex":0.0055325273,"about_ca_topic_score_gemma":0.012539322,"teacher_disagreement_score":0.009278738,"about_ca_system_score_codex":0.0005654042,"about_ca_system_score_gemma":0.000720149,"threshold_uncertainty_score":0.03104049},"labels":[],"label_agreement":null},{"id":"W3138361797","doi":"10.1007/978-3-030-71292-1_46","title":"Multidisciplinary Blockchain Research and Design: A Case Study in Moving from Theory to Pedagogy to Practice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multidisciplinary approach; Blockchain; Computer science; Discipline; Field (mathematics); Management science; Engineering ethics; Knowledge management; Sociology; Engineering","score_opus":0.05545670654782353,"score_gpt":0.37064797729296456,"score_spread":0.31519127074514103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138361797","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.80296475,0.0012513325,0.05597733,0.011926959,0.00020989907,0.001395036,0.000073271294,0.00013467763,0.12606676],"genre_scores_gemma":[0.9520109,0.00069452304,0.02398994,0.00065044354,0.000022362781,0.00059710373,0.000039757,0.000048132413,0.021946765],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.981152,0.015422832,0.00031800932,0.00065560156,0.0013244894,0.0011270378],"domain_scores_gemma":[0.97667354,0.016716802,0.0008199526,0.0014588414,0.0010350976,0.0032957653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013067852,0.0004588985,0.00040646983,0.0012307403,0.009716934,0.006910174,0.0019541895,0.004376675,0.00705424],"category_scores_gemma":[0.015576136,0.00045514706,0.00031893924,0.0020070672,0.007056642,0.005510212,0.0088022975,0.0036660626,0.0011786007],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038514409,0.005741696,0.009513733,0.0009907173,0.000025380195,0.005447808,0.51819867,0.0033096238,0.0042974516,0.18132763,0.01060924,0.26015294],"study_design_scores_gemma":[0.00025823148,0.0025278346,0.0063809683,0.0016908478,0.0000377212,0.0030125207,0.672973,0.008220794,0.007366082,0.07405272,0.22337863,0.00010073204],"about_ca_topic_score_codex":0.0017958824,"about_ca_topic_score_gemma":0.005866751,"teacher_disagreement_score":0.013067852,"about_ca_system_score_codex":0.004937852,"about_ca_system_score_gemma":0.009938065,"threshold_uncertainty_score":0.069110274},"labels":[],"label_agreement":null},{"id":"W3139123588","doi":"10.1007/978-3-030-87202-1_56","title":"Rapid Treatment Planning for Low-dose-rate Prostate Brachytherapy with TP-GAN","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Radiation treatment planning; Brachytherapy; Simulated annealing; Plan (archaeology); Computer science; Prostate; Medical physics; Prostate brachytherapy; Generative model; Dose rate; Medicine; Operations management; Nuclear medicine; Radiation therapy; Artificial intelligence; Surgery; Algorithm; Generative grammar; Engineering; Internal medicine","score_opus":0.022329961863238445,"score_gpt":0.2645064045352531,"score_spread":0.24217644267201466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139123588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011330045,0.0008991745,0.9782548,0.00023945844,0.000069205424,0.0001086263,0.00034848176,0.0019073393,0.0068429695],"genre_scores_gemma":[0.60399485,0.0009382448,0.38244903,0.00037776283,0.00004799048,0.00026830888,0.0007301959,0.001585719,0.009607855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999757,0.00007771418,0.000009362098,0.000042628188,0.000088977475,0.00002421048],"domain_scores_gemma":[0.99978226,0.00012603476,0.000021953752,0.0000312448,0.000022390637,0.000016114642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047962446,0.0006337956,0.000403511,0.00027631276,0.00017253717,0.00074298633,0.0006360972,0.0005140584,0.004239765],"category_scores_gemma":[0.0012444621,0.0006335685,0.0006241674,0.0003984221,0.00029316734,0.0003723165,0.0007634232,0.0010704217,0.0009802333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042063996,0.00004838113,0.000992858,0.00026141625,0.000072393086,0.00019708792,0.00011923359,0.8287294,0.02863807,0.0060013714,0.008243277,0.12627581],"study_design_scores_gemma":[0.000025444604,0.0000764836,0.000711253,0.000028178018,0.000021993397,0.0003264668,0.000019955021,0.9799136,0.009978192,0.0044605234,0.0044106385,0.000027347534],"about_ca_topic_score_codex":0.0029723167,"about_ca_topic_score_gemma":0.0046224217,"teacher_disagreement_score":0.004239765,"about_ca_system_score_codex":0.00061961834,"about_ca_system_score_gemma":0.0007844174,"threshold_uncertainty_score":0.014183462},"labels":[],"label_agreement":null},{"id":"W3139149903","doi":"10.1007/978-3-662-63170-6_5","title":"A New Bio-heuristic Hybrid Optimization for Constrained Continuous Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Evolutionary algorithm; Benchmark (surveying); Convergence (economics); Computer science; Evolutionary computation; Metaheuristic; Premature convergence; Process (computing); Global optimization; Mathematics; Genetic algorithm","score_opus":0.02199607920956767,"score_gpt":0.2639593538183612,"score_spread":0.24196327460879355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139149903","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.007525397,0.0010628487,0.97132945,0.00016788747,0.00036550203,0.00007317267,0.00005651477,0.0004870454,0.018932248],"genre_scores_gemma":[0.1961841,0.0012230973,0.7759837,0.00036434585,0.00029892288,0.00059021387,0.00022552785,0.00027191165,0.024858205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997154,0.000069106136,0.000014112764,0.000044920904,0.00013068122,0.000025807765],"domain_scores_gemma":[0.9998074,0.00009209619,0.000015651925,0.000022007718,0.00004541712,0.000017469945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013052,0.00095191604,0.0008792016,0.00087780866,0.00046680446,0.0012120618,0.0015008721,0.0014553769,0.0068763527],"category_scores_gemma":[0.0007050248,0.0004950591,0.00086873554,0.0010814705,0.0006084163,0.0008389298,0.0013340286,0.001107262,0.0010918379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012868101,0.00014308168,0.0003036701,0.0003422819,0.00015966511,0.00017462937,0.000079070356,0.70261884,0.014194981,0.04976777,0.005283862,0.2268034],"study_design_scores_gemma":[0.000024209075,0.000093663104,0.00010135629,0.000022825954,0.000023562143,0.000067870664,0.000011045229,0.9855517,0.0010834229,0.0057598306,0.0072471523,0.000013373144],"about_ca_topic_score_codex":0.0012313806,"about_ca_topic_score_gemma":0.0016501657,"teacher_disagreement_score":0.0068763527,"about_ca_system_score_codex":0.0003843604,"about_ca_system_score_gemma":0.00049203227,"threshold_uncertainty_score":0.023003697},"labels":[],"label_agreement":null},{"id":"W3139263963","doi":"10.1007/978-3-540-75563-0_16","title":"An Ontological Metamodel of Classifiers and Its Application to Conceptual Modelling and Database Design","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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":"Memorial University of Newfoundland","funders":"","keywords":"Metamodeling; Computer science; Representation (politics); Conceptual model; Confusion; Object (grammar); Database; Artificial intelligence; Software engineering; Data science","score_opus":0.06453791910723744,"score_gpt":0.2850765305870246,"score_spread":0.22053861147978715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139263963","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.0029972563,0.000116869596,0.9922759,0.0005074514,0.00004523877,0.00009997749,0.0003960055,0.0005630961,0.0029981125],"genre_scores_gemma":[0.055942405,0.00038567654,0.93847674,0.00022682465,0.00005711686,0.00029352983,0.0012819755,0.00022268006,0.003113046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840385,0.00045430526,0.00031530418,0.00024373045,0.0004921932,0.000090665344],"domain_scores_gemma":[0.99772507,0.0008140906,0.00015683068,0.0006840786,0.00049082557,0.0001290177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032725607,0.00046924927,0.0006602203,0.0022275692,0.001439104,0.0040419684,0.0019725142,0.0015443969,0.0028205654],"category_scores_gemma":[0.0063187224,0.0008416621,0.0020768652,0.0026696508,0.0016797698,0.007151925,0.0017762892,0.0025329152,0.0011356446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026502134,0.000055881384,0.00063221646,0.00011643104,0.000024145293,0.00016767894,0.0009269259,0.009242113,0.0025627133,0.94056326,0.0040548095,0.041627444],"study_design_scores_gemma":[0.000022529592,0.00003509151,0.00041733886,0.00021388411,0.000105445,0.0003765443,0.00038626534,0.1741749,0.003821987,0.6953185,0.12508091,0.000046571942],"about_ca_topic_score_codex":0.007356766,"about_ca_topic_score_gemma":0.010287713,"teacher_disagreement_score":0.007356766,"about_ca_system_score_codex":0.0018204517,"about_ca_system_score_gemma":0.0025172709,"threshold_uncertainty_score":0.017307162},"labels":[],"label_agreement":null},{"id":"W3139450621","doi":"10.1007/978-3-540-75563-0_8","title":"From Business Models to Service-Oriented Design: A Reference Catalog Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Service-orientation; Business process modeling; Artifact-centric business process model; Business Process Model and Notation; Business rule; Service (business); Service-oriented architecture; Software engineering; Business domain; Business process; Process management; Business model; Set (abstract data type); Business architecture; Web service; World Wide Web; Programming language; Operations management; Engineering; Business","score_opus":0.056250011224206135,"score_gpt":0.2569411716606598,"score_spread":0.20069116043645363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139450621","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.0018613269,0.038359787,0.70580035,0.008644409,0.0018040324,0.00039324912,0.0014420069,0.0029782327,0.23871656],"genre_scores_gemma":[0.054139502,0.13305518,0.6009618,0.0037448192,0.0020913095,0.001514816,0.008346646,0.0039012984,0.19224468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959895,0.0010294137,0.0005577629,0.00038551286,0.0018599405,0.00017789972],"domain_scores_gemma":[0.9945926,0.002012865,0.00025555195,0.0013330389,0.0016199712,0.00018607819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047151344,0.0017960903,0.0025884262,0.015012421,0.0022925679,0.016394803,0.0038651496,0.004283184,0.028681546],"category_scores_gemma":[0.013251062,0.0017754794,0.0016617522,0.032217376,0.0034490118,0.02541067,0.0034858899,0.0037959698,0.015533633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134911925,0.000056406734,0.000112958965,0.00074124715,0.00002243709,0.00013298324,0.0004556968,0.0025479316,0.00038328636,0.7764046,0.06088158,0.15824735],"study_design_scores_gemma":[0.000020507941,0.000023517092,0.0000994138,0.0011209837,0.0000455606,0.00024240672,0.00033449943,0.0064388,0.00056745904,0.34618184,0.6448919,0.000033032662],"about_ca_topic_score_codex":0.0084693795,"about_ca_topic_score_gemma":0.009397986,"teacher_disagreement_score":0.028681546,"about_ca_system_score_codex":0.0062052933,"about_ca_system_score_gemma":0.0063715354,"threshold_uncertainty_score":0.09594935},"labels":[],"label_agreement":null},{"id":"W3139958101","doi":"10.1007/978-3-030-73280-6_12","title":"Mixture-Based Unsupervised Learning for Positively Correlated Count Data","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Mixture model; Multinomial distribution; Artificial intelligence; Feature selection; Data mining; Dimensionality reduction; Curse of dimensionality; Pattern recognition (psychology); Machine learning; Statistics; Mathematics","score_opus":0.03559352313604585,"score_gpt":0.281113702822973,"score_spread":0.24552017968692713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139958101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027191513,0.00015942643,0.9962515,0.00005132284,0.000018982915,0.000021773549,0.00007279206,0.0004466988,0.0002583796],"genre_scores_gemma":[0.10824274,0.00059561676,0.8805842,0.00020551482,0.00023319661,0.00047443478,0.002767714,0.0007720364,0.00612454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545056,0.002131007,0.0003054706,0.0010368132,0.0008289105,0.00024734816],"domain_scores_gemma":[0.9810184,0.014117377,0.0008304423,0.0023475718,0.0014188318,0.0002674352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00581512,0.001506391,0.002894816,0.0027130067,0.001094436,0.002334333,0.006447531,0.002529798,0.003127968],"category_scores_gemma":[0.024266781,0.0018874308,0.0029559233,0.0047102612,0.0020026746,0.0038991189,0.0045683337,0.0040139174,0.0023493883],"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.00039646483,0.00023786825,0.003904709,0.00044821727,0.0004793178,0.0001525535,0.0004752429,0.32547128,0.005929107,0.0657812,0.009236343,0.58748764],"study_design_scores_gemma":[0.000009665875,0.000015738298,0.0004248905,0.000015867545,0.000022477734,0.00006263741,0.0000151196045,0.9627703,0.0009881055,0.034545608,0.0011080888,0.000021563155],"about_ca_topic_score_codex":0.00414254,"about_ca_topic_score_gemma":0.00836119,"teacher_disagreement_score":0.006447531,"about_ca_system_score_codex":0.0012644953,"about_ca_system_score_gemma":0.0013485227,"threshold_uncertainty_score":0.030753672},"labels":[],"label_agreement":null},{"id":"W3140853032","doi":"10.1007/978-3-030-72240-1_11","title":"Comparing Score Aggregation Approaches for Document Retrieval with Pretrained Transformers","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Question answering; Information retrieval; Machine learning","score_opus":0.05235121322312605,"score_gpt":0.24538324773872552,"score_spread":0.19303203451559947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140853032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2492177,0.008249388,0.72062534,0.00070242205,0.0004418943,0.00037925044,0.0013440421,0.010784286,0.008255657],"genre_scores_gemma":[0.78181374,0.0022498867,0.20448603,0.00013925298,0.00032723031,0.00018899936,0.0039744494,0.00075986446,0.0060606063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678826,0.0011335324,0.00031700646,0.0003997878,0.0010064938,0.00035493053],"domain_scores_gemma":[0.98953944,0.007093222,0.00023260861,0.0015871585,0.0013675875,0.00017995783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060982816,0.0012009386,0.0019031396,0.002884908,0.0006142278,0.0025065597,0.001817707,0.0013450794,0.003683409],"category_scores_gemma":[0.015433875,0.00048984704,0.0012056734,0.0034116793,0.0007083484,0.0058530173,0.0019197654,0.001479995,0.0015723476],"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.003186555,0.00052104704,0.0033275802,0.00048744457,0.00057375774,0.000088711524,0.00023687718,0.11618608,0.0072459355,0.014475814,0.012765162,0.840905],"study_design_scores_gemma":[0.00016237033,0.0005704115,0.0019697521,0.000026151316,0.00021716738,0.00009496183,0.00012556535,0.9717405,0.006157625,0.017261509,0.0016372093,0.000036697355],"about_ca_topic_score_codex":0.007844736,"about_ca_topic_score_gemma":0.007132871,"teacher_disagreement_score":0.007844736,"about_ca_system_score_codex":0.0012170566,"about_ca_system_score_gemma":0.0015854132,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3140997097","doi":"10.1007/978-3-030-90567-5_6","title":"On MILP-Based Automatic Search for Bit-Based Division Property for Ciphers with (Large) Linear Layers","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Concordia University","funders":"","keywords":"Division (mathematics); Permutation (music); Computer science; Multiplication (music); Integer programming; Algorithm; Integer (computer science); Linear programming; Matrix (chemical analysis); Set (abstract data type); Invertible matrix; Theoretical computer science; Mathematics; Mathematical optimization; Arithmetic","score_opus":0.023792039517128483,"score_gpt":0.28191057570485345,"score_spread":0.25811853618772496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140997097","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.05248456,0.00039418883,0.93533653,0.00039961454,0.00012819462,0.00014236465,0.00022935495,0.0015717124,0.0093134465],"genre_scores_gemma":[0.67239976,0.00033028814,0.3204408,0.00045258302,0.00017923731,0.0002647766,0.00077796064,0.0003630901,0.004791407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987205,0.00034548325,0.00008730804,0.00020138528,0.0004090852,0.0002362969],"domain_scores_gemma":[0.9972939,0.0015296796,0.00015152871,0.00059136597,0.0003083889,0.00012511418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181663,0.0008185913,0.0013181757,0.0015358368,0.0007963694,0.0020563547,0.001237839,0.0010659645,0.007744485],"category_scores_gemma":[0.00650094,0.000465249,0.0011179732,0.0013342967,0.0014093851,0.0034415382,0.0030437575,0.0019619388,0.0015819932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015596586,0.0004126542,0.0019356492,0.00068264344,0.00015436778,0.0003792351,0.00036670142,0.16667476,0.039827287,0.44141367,0.01684414,0.32974926],"study_design_scores_gemma":[0.00006232733,0.00013224666,0.00016220515,0.00003971469,0.000030720905,0.00010014568,0.00003781497,0.8162149,0.0070329583,0.17446367,0.0016957698,0.000027546264],"about_ca_topic_score_codex":0.00082606665,"about_ca_topic_score_gemma":0.00091262936,"teacher_disagreement_score":0.007744485,"about_ca_system_score_codex":0.0008908564,"about_ca_system_score_gemma":0.0014317333,"threshold_uncertainty_score":0.025907874},"labels":[],"label_agreement":null},{"id":"W3141426434","doi":"10.1007/978-3-642-35725-1","title":"Advances in Multimedia Modeling","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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 Ottawa","funders":"","keywords":"Computer science; Multimedia","score_opus":0.010845832095693208,"score_gpt":0.24117189074660064,"score_spread":0.23032605865090744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141426434","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039110836,0.06180926,0.8649144,0.0025878751,0.0016993062,0.00005997156,0.00068894826,0.002316712,0.062012352],"genre_scores_gemma":[0.17950156,0.14259396,0.5136959,0.0016047683,0.0049749757,0.00025255157,0.004219876,0.0016989947,0.15145744],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995716,0.00008410431,0.000023532666,0.00010523401,0.0001872876,0.000028220891],"domain_scores_gemma":[0.99927217,0.00032582955,0.000032680622,0.00016931951,0.0001733358,0.000026759135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007425029,0.0010598757,0.00094687985,0.0017455311,0.00037996983,0.0021708815,0.0015472304,0.0009205723,0.010951672],"category_scores_gemma":[0.0025574262,0.0005050176,0.0007807799,0.0023239527,0.00047573663,0.0033513696,0.0010194669,0.0013512045,0.005207058],"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.000035545458,0.00007816538,0.00037318864,0.00040209142,0.000064095424,0.0001274291,0.000105735766,0.022214834,0.0033261625,0.17032793,0.066198006,0.7367468],"study_design_scores_gemma":[0.0000097311095,0.000046277673,0.0006278543,0.00024224436,0.00009274625,0.00044724037,0.000104391045,0.3143705,0.0068648746,0.33041865,0.34672752,0.000047914822],"about_ca_topic_score_codex":0.002810888,"about_ca_topic_score_gemma":0.0020644963,"teacher_disagreement_score":0.010951672,"about_ca_system_score_codex":0.0008229355,"about_ca_system_score_gemma":0.00061582425,"threshold_uncertainty_score":0.03663701},"labels":[],"label_agreement":null},{"id":"W3141909004","doi":"","title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genetics, Bioinformatics, and Biomedical Research","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":"Carleton University","funders":"","keywords":"Mathematics education; Computer science; Artificial intelligence; Mathematics","score_opus":0.042488760588149745,"score_gpt":0.2945290849608065,"score_spread":0.2520403243726567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141909004","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005993633,0.06883946,0.11229063,0.017126532,0.18417011,0.0009005003,0.008366402,0.003604881,0.59870785],"genre_scores_gemma":[0.01229685,0.047073673,0.036489516,0.002489806,0.038619693,0.00060037035,0.008217033,0.0032225524,0.8509905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833786,0.00013818311,0.00012651164,0.00048863975,0.00079491443,0.00011384381],"domain_scores_gemma":[0.99392384,0.0018714764,0.0001736372,0.00057293585,0.0023648136,0.0010932947],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018001539,0.0031480226,0.004303045,0.0025177163,0.0012471315,0.0064053987,0.0018304407,0.0014317906,0.39805108],"category_scores_gemma":[0.0059119714,0.00070287706,0.0015477814,0.0061301966,0.0008912592,0.0035300895,0.0016765817,0.0052244854,0.3365984],"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.00010101131,0.00015858501,0.00017979018,0.00049414684,0.000026255379,0.0000892347,0.00005308388,0.0010647671,0.001327233,0.0074001076,0.5798286,0.4092771],"study_design_scores_gemma":[0.000057117737,0.00016542229,0.0013432914,0.0005950454,0.000042289485,0.00030116405,0.00008610369,0.0032512536,0.0009923961,0.02045279,0.972669,0.00004408117],"about_ca_topic_score_codex":0.0011402869,"about_ca_topic_score_gemma":0.0010424858,"teacher_disagreement_score":0.39805108,"about_ca_system_score_codex":0.0013971266,"about_ca_system_score_gemma":0.0020436146,"threshold_uncertainty_score":0.85860705},"labels":[],"label_agreement":null},{"id":"W3142126176","doi":"10.1007/3-540-44674-5","title":"Implementation and Application of Automata","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Western University","funders":"","keywords":"Computer science; Automaton; Programming language; Theoretical computer science","score_opus":0.009006027540785454,"score_gpt":0.26415630273412993,"score_spread":0.2551502751933445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142126176","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096220765,0.00019766417,0.96195406,0.00022391109,0.00022652846,0.0000905779,0.00011512289,0.0064271875,0.021142803],"genre_scores_gemma":[0.343358,0.00039984987,0.63805866,0.00016820112,0.00006468505,0.0003525689,0.00042636637,0.0009839322,0.016187813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986664,0.00040310936,0.0001402207,0.0002698596,0.00038397234,0.00013639465],"domain_scores_gemma":[0.9976859,0.0008019612,0.000057826812,0.0009259458,0.00044396278,0.000084435735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011046613,0.00059793604,0.0006585072,0.00077507703,0.0010398241,0.003397891,0.0021401036,0.0011605502,0.014264022],"category_scores_gemma":[0.0062132142,0.000753402,0.0012280634,0.0006384514,0.001534031,0.0025207156,0.0024869684,0.0015315119,0.0043258113],"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.00019394851,0.00015966297,0.0010830205,0.00032121153,0.0000755674,0.000323425,0.0008633562,0.044122763,0.016293764,0.7088666,0.007898081,0.2197987],"study_design_scores_gemma":[0.00010114393,0.00011377753,0.00030201973,0.00013769524,0.00012208748,0.0003917509,0.00017536055,0.46762756,0.039463926,0.40458697,0.08691239,0.0000653587],"about_ca_topic_score_codex":0.002259929,"about_ca_topic_score_gemma":0.0020061801,"teacher_disagreement_score":0.014264022,"about_ca_system_score_codex":0.00088008406,"about_ca_system_score_gemma":0.0012732701,"threshold_uncertainty_score":0.04771787},"labels":[],"label_agreement":null},{"id":"W3143876921","doi":"10.1007/978-3-030-73128-1_5","title":"Automatically Classifying Non-functional Requirements with Feature Extraction and Supervised Machine Learning Techniques: A Research Preview","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Western University","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Machine learning; Context (archaeology); Feature extraction; Precision and recall; Process (computing); Decision tree; Data mining; Pattern recognition (psychology)","score_opus":0.05603098863808203,"score_gpt":0.32850835352302515,"score_spread":0.2724773648849431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143876921","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.015320161,0.017100364,0.9483141,0.000830215,0.00028756933,0.00016851486,0.0004991897,0.0036709316,0.013808885],"genre_scores_gemma":[0.122843094,0.02201124,0.80557245,0.00039800777,0.0005463802,0.00014682942,0.0041413936,0.0006635734,0.04367711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927,0.00007653196,0.000056980563,0.00018308323,0.0003742389,0.000039156832],"domain_scores_gemma":[0.99870145,0.0005680029,0.000103805825,0.00016977289,0.00042240776,0.000034586945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010237708,0.0007845736,0.00069980155,0.0026699875,0.00024569698,0.001706369,0.0013602853,0.0008401573,0.004042679],"category_scores_gemma":[0.0018769437,0.00049584825,0.0011997038,0.0023434989,0.00043167267,0.0021822264,0.00037355482,0.00086461066,0.004039044],"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.000035605495,0.00012348668,0.0011963433,0.00047742235,0.000026710299,0.00008324983,0.00008680323,0.0037024727,0.023798732,0.005347782,0.009195885,0.95592546],"study_design_scores_gemma":[0.00003672638,0.0007460115,0.020242589,0.0014596964,0.00020567466,0.0042134323,0.00062123354,0.41470614,0.14908434,0.07082,0.337618,0.0002461972],"about_ca_topic_score_codex":0.0013871818,"about_ca_topic_score_gemma":0.0019842912,"teacher_disagreement_score":0.004042679,"about_ca_system_score_codex":0.0004692448,"about_ca_system_score_gemma":0.0005675077,"threshold_uncertainty_score":0.013524115},"labels":[],"label_agreement":null},{"id":"W3145100375","doi":"10.1007/978-3-030-72013-1_1","title":"Directed Reachability for Infinite-State Systems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Petri net; Computer science; Algorithm; Graph; Reachability problem; Theoretical computer science; State (computer science); Stochastic Petri net; Domain (mathematical analysis); Mathematics","score_opus":0.03548021178645722,"score_gpt":0.28647125512758237,"score_spread":0.25099104334112515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145100375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033558514,0.0003477777,0.956836,0.00041627794,0.000033955963,0.0001354995,0.00034152792,0.0038595083,0.0044709644],"genre_scores_gemma":[0.5855849,0.00034127734,0.4094659,0.00018102556,0.000034099572,0.00030727775,0.0012422903,0.00033754442,0.0025057588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710923,0.0010206385,0.00020351617,0.00043951298,0.0010079457,0.00021917945],"domain_scores_gemma":[0.9906288,0.007886581,0.00035163361,0.00055942073,0.0004580382,0.00011544514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018154944,0.0008424741,0.00065443304,0.001353809,0.0008340922,0.0017131813,0.0016316825,0.0011913134,0.004969771],"category_scores_gemma":[0.008681672,0.00057838357,0.0013539637,0.00097458175,0.0026785964,0.0022509303,0.002375679,0.0020027861,0.0006582214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033745947,0.000121362544,0.0012092751,0.0007109049,0.00007784599,0.00049919984,0.00039622915,0.62373036,0.013906903,0.28169054,0.0020331622,0.07528676],"study_design_scores_gemma":[0.00004926257,0.00003552757,0.00015719557,0.00004969205,0.00002263412,0.000064952284,0.00004180709,0.7645059,0.006707087,0.22477278,0.0035751555,0.000018020832],"about_ca_topic_score_codex":0.0057683494,"about_ca_topic_score_gemma":0.0071982816,"teacher_disagreement_score":0.0057683494,"about_ca_system_score_codex":0.002121723,"about_ca_system_score_gemma":0.0017734128,"threshold_uncertainty_score":0.016625583},"labels":[],"label_agreement":null},{"id":"W314696747","doi":"10.1007/978-3-319-13105-4_49","title":"First Contribution to Complex Emotion Recognition in Patients with Alzheimer’s Disease","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Emotion recognition; Disease; Field (mathematics); Depression (economics); Emotion classification; Cognitive psychology; Artificial intelligence; Psychology; Medicine","score_opus":0.035041453078727594,"score_gpt":0.2754677202607725,"score_spread":0.2404262671820449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W314696747","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.5221656,0.3065539,0.0066842954,0.013706617,0.008200735,0.0001292537,0.0023140602,0.00023543306,0.14001004],"genre_scores_gemma":[0.88245237,0.07011831,0.0038406895,0.0039183944,0.0049553537,0.00006119158,0.0015650427,0.000101155696,0.032987434],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998418,0.000032410888,0.000015246396,0.000043197233,0.000039430604,0.000027809594],"domain_scores_gemma":[0.999376,0.00036294662,0.000042488336,0.00006398976,0.00010157722,0.00005295142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050439726,0.0005453112,0.0005771327,0.00073277566,0.00034873755,0.0013649773,0.0004563046,0.0007646457,0.0053164596],"category_scores_gemma":[0.0020898827,0.00018152848,0.00055223226,0.00051824196,0.00044530266,0.00070610107,0.0005857937,0.001334143,0.0012867906],"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.0019322219,0.0005833358,0.08461742,0.0012858135,0.00031908156,0.011301582,0.002196202,0.0003241354,0.015797831,0.0049883253,0.045442864,0.83121127],"study_design_scores_gemma":[0.00017978733,0.0012865158,0.6962253,0.001000893,0.00055067014,0.062351815,0.0016415095,0.0013951253,0.010518689,0.020867582,0.20386608,0.00011599011],"about_ca_topic_score_codex":0.0016193182,"about_ca_topic_score_gemma":0.0014335117,"teacher_disagreement_score":0.0053164596,"about_ca_system_score_codex":0.0006027234,"about_ca_system_score_gemma":0.0003111968,"threshold_uncertainty_score":0.01778537},"labels":[],"label_agreement":null},{"id":"W3147584502","doi":"10.1007/978-3-030-60470-7_7","title":"Adversarial Deep Factorization for Recommender Systems","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Adversarial system; Recommender system; Artificial intelligence; Deep learning; Robustness (evolution); Machine learning; Factorization; Deep neural networks; MovieLens; Tensor (intrinsic definition); Data mining; Algorithm; Collaborative filtering","score_opus":0.029928345553336465,"score_gpt":0.2540894922198237,"score_spread":0.22416114666648723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147584502","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.0024097897,0.0018394007,0.9920781,0.0003901684,0.0001267518,0.000020469835,0.00015935699,0.0004096443,0.0025663371],"genre_scores_gemma":[0.28125328,0.005559319,0.659439,0.000703749,0.0006205697,0.00024565984,0.0015936384,0.00033405976,0.05025069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944,0.00023813274,0.000024348166,0.00011014491,0.00013110679,0.00005629677],"domain_scores_gemma":[0.99847037,0.0010066992,0.00005787973,0.00023863338,0.000177023,0.000049468505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012597428,0.0009771409,0.0011742852,0.00048202425,0.0004080297,0.00097089965,0.0014170901,0.00140923,0.007809154],"category_scores_gemma":[0.004106642,0.0007502993,0.00068718183,0.00084093184,0.000628462,0.001998072,0.0015712461,0.0028754906,0.0034112222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117092706,0.00013743024,0.00047579553,0.0003229671,0.00012891564,0.000077950135,0.00009921459,0.4506498,0.0031266364,0.0903394,0.032472134,0.4220526],"study_design_scores_gemma":[0.00000495058,0.000019863774,0.00006858209,0.000020810508,0.000008236082,0.000025543419,0.0000061323967,0.96296966,0.00045322868,0.033337753,0.0030771221,0.000008141705],"about_ca_topic_score_codex":0.004191134,"about_ca_topic_score_gemma":0.0077300468,"teacher_disagreement_score":0.007809154,"about_ca_system_score_codex":0.0007998141,"about_ca_system_score_gemma":0.0006367572,"threshold_uncertainty_score":0.026124239},"labels":[],"label_agreement":null},{"id":"W3147804948","doi":"10.1007/978-3-642-35476-2","title":"Principles of Distributed Systems","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.020069998974450217,"score_gpt":0.24285091999175845,"score_spread":0.22278092101730823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147804948","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013834295,0.042926118,0.4570825,0.0070862267,0.0040071807,0.0002556107,0.0004780075,0.002276218,0.48450476],"genre_scores_gemma":[0.13292544,0.05550117,0.34029588,0.004598308,0.005159466,0.0012378768,0.0010903897,0.0012684994,0.45792305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887055,0.00020607794,0.00006774957,0.00017109701,0.0005956509,0.0000888873],"domain_scores_gemma":[0.9992847,0.00022966768,0.000035805126,0.00021761138,0.00017631162,0.000055921933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004039,0.001336152,0.001162335,0.0011596616,0.0013606702,0.0047350386,0.0017153666,0.0016904122,0.013744389],"category_scores_gemma":[0.0023310448,0.0008308399,0.0007414783,0.0015948517,0.0041941027,0.004093982,0.0018500094,0.004516481,0.009435256],"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.0000088566285,0.000014742427,0.00006018092,0.00013855538,0.000012912646,0.00003835158,0.00021975362,0.0012560192,0.00031894888,0.9309474,0.031801417,0.035182778],"study_design_scores_gemma":[0.000016995013,0.000012871227,0.000095254545,0.00009339398,0.000010043662,0.00013343336,0.000037260117,0.0021460294,0.00029570173,0.5517308,0.44541806,0.000010090822],"about_ca_topic_score_codex":0.0014716107,"about_ca_topic_score_gemma":0.0012982696,"teacher_disagreement_score":0.013744389,"about_ca_system_score_codex":0.0016649092,"about_ca_system_score_gemma":0.0020351685,"threshold_uncertainty_score":0.04597956},"labels":[],"label_agreement":null},{"id":"W3148065246","doi":"10.1007/978-3-030-96731-4_9","title":"StreamTable: An Area Proportional Visualization for Tables with Flowing Streams","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"STREAMS; Rectangle; Row; Computer science; Visualization; Bounding overwatch; Minimum bounding box; Intersection (aeronautics); Geometry; Algorithm; Combinatorics; Mathematics; Artificial intelligence; Image (mathematics); Cartography; Database","score_opus":0.02470293285722995,"score_gpt":0.28553906090803816,"score_spread":0.2608361280508082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148065246","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.0056903986,0.001107985,0.7132732,0.00071593607,0.0008374955,0.00045128036,0.026219513,0.23841906,0.013285181],"genre_scores_gemma":[0.060099404,0.0022763298,0.8507139,0.0007258288,0.00038697157,0.0010510685,0.025670333,0.039931785,0.019144371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994522,0.00007733639,0.000062439925,0.00008722214,0.00026760346,0.00005318934],"domain_scores_gemma":[0.9980324,0.0009591819,0.00009413543,0.00025327087,0.00047281053,0.00018828656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010343732,0.0023455245,0.0010560282,0.003273407,0.00076546514,0.0040487773,0.0022377423,0.0010828081,0.09064038],"category_scores_gemma":[0.0051064226,0.0009653217,0.0011040185,0.0036516364,0.00030808683,0.0034028473,0.0026510933,0.001665583,0.011873271],"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.0010530122,0.000175281,0.0015966711,0.001753167,0.00018591921,0.00042317537,0.00077018206,0.0076608495,0.017461475,0.014935083,0.44583386,0.50815135],"study_design_scores_gemma":[0.0007695421,0.00023862011,0.0025254916,0.00070921227,0.0002626766,0.0010235931,0.0005145863,0.25676993,0.05433005,0.054885264,0.6276243,0.00034674667],"about_ca_topic_score_codex":0.0043829107,"about_ca_topic_score_gemma":0.0057597305,"teacher_disagreement_score":0.09064038,"about_ca_system_score_codex":0.0005670162,"about_ca_system_score_gemma":0.001119067,"threshold_uncertainty_score":0.3032223},"labels":[],"label_agreement":null},{"id":"W3149775200","doi":"10.1007/978-3-319-07956-1","title":"Algorithmic Aspects in Information and Management","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.0074382173001235515,"score_gpt":0.22047447918241148,"score_spread":0.21303626188228791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149775200","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076763746,0.058470562,0.3532999,0.02059843,0.0026545532,0.000104387436,0.00030230865,0.00021674905,0.5566768],"genre_scores_gemma":[0.42917904,0.0852381,0.18876767,0.004222615,0.0102880085,0.00061324186,0.0010061023,0.0003720195,0.2803133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918324,0.00021919445,0.00005243762,0.000093501825,0.00038979982,0.000061806706],"domain_scores_gemma":[0.9990088,0.0005850276,0.00006582408,0.00016061049,0.00014041923,0.00003928542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008949805,0.00085438957,0.0006755785,0.0016319606,0.0010128466,0.0047971653,0.001234455,0.0013643443,0.010242993],"category_scores_gemma":[0.003103201,0.0004737202,0.0005971888,0.0033523187,0.003854395,0.008175103,0.0015286636,0.0031240347,0.0024038248],"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.000001443025,0.0000051346497,0.00002718235,0.000036164984,0.0000029969458,0.000009647458,0.000028961967,0.00063699257,0.00003772226,0.98588955,0.004445324,0.008878858],"study_design_scores_gemma":[0.0000012988432,0.0000018330729,0.00003697512,0.000021223002,0.0000024507456,0.000025954952,0.00001983502,0.0014849748,0.000037732087,0.9724912,0.025874628,0.0000018675236],"about_ca_topic_score_codex":0.0008979338,"about_ca_topic_score_gemma":0.0009105656,"teacher_disagreement_score":0.010242993,"about_ca_system_score_codex":0.002123166,"about_ca_system_score_gemma":0.0010314254,"threshold_uncertainty_score":0.034266233},"labels":[],"label_agreement":null},{"id":"W3150524533","doi":"10.1007/978-3-030-73197-7_5","title":"Generating Contextually Coherent Responses by Learning Structured Vectorized Semantics","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Windsor","funders":"","keywords":"Semantics (computer science); Computer science; Linguistics; Psychology; Natural language processing; Communication; Programming language; Philosophy","score_opus":0.021901773331410506,"score_gpt":0.25503664621272787,"score_spread":0.23313487288131737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150524533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028660763,0.000266087,0.96272975,0.00034789884,0.00019215948,0.00014948551,0.00041933323,0.004984164,0.002250404],"genre_scores_gemma":[0.42515537,0.0003995754,0.563366,0.00040821006,0.00030790956,0.00042606622,0.002816197,0.00088962406,0.006231062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981622,0.0007846279,0.00007333061,0.000553149,0.00027576467,0.00015091084],"domain_scores_gemma":[0.9968677,0.0021865314,0.00013516562,0.00027837505,0.00042412488,0.00010810085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775512,0.001386742,0.001013668,0.0009061029,0.00041536705,0.0012290622,0.0014822051,0.0015895973,0.00767057],"category_scores_gemma":[0.0074319597,0.00052330684,0.001132557,0.00092941156,0.0005912419,0.0025663748,0.0021535852,0.002070356,0.003702541],"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.0017837523,0.0005249321,0.0014964988,0.0005567012,0.00019016223,0.00033346104,0.0009003653,0.034445047,0.075619124,0.024810148,0.018322136,0.84101766],"study_design_scores_gemma":[0.00014264298,0.00038702597,0.0007758105,0.00006706979,0.000111072135,0.00020152135,0.0005779835,0.89745384,0.025084984,0.06852352,0.00660967,0.000064834836],"about_ca_topic_score_codex":0.0010039614,"about_ca_topic_score_gemma":0.001831402,"teacher_disagreement_score":0.00767057,"about_ca_system_score_codex":0.00043616784,"about_ca_system_score_gemma":0.0008793151,"threshold_uncertainty_score":0.025660634},"labels":[],"label_agreement":null},{"id":"W3150672550","doi":"10.1007/978-3-030-72113-8_21","title":"An Argument Extraction Decoder in Open Information Extraction","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Predicate (mathematical logic); Argument (complex analysis); Information extraction; Artificial intelligence; Sentence; Natural language processing; Algorithm; Theoretical computer science; Programming language","score_opus":0.017036013368029224,"score_gpt":0.3120898653853281,"score_spread":0.2950538520172989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150672550","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.0031171332,0.0003580381,0.9622306,0.00043051524,0.00030956845,0.00013604142,0.0012341747,0.02177822,0.010405755],"genre_scores_gemma":[0.06373523,0.0004495175,0.9012164,0.0005219815,0.00025533276,0.0002257384,0.0042610103,0.005206434,0.024128288],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871194,0.00031596294,0.00017467295,0.00026343885,0.00044582487,0.000088196204],"domain_scores_gemma":[0.9957736,0.0023267958,0.000112447044,0.0008499065,0.0008549255,0.00008234627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016923621,0.0010869763,0.0013510855,0.0023545118,0.0011059775,0.0033560153,0.0020473981,0.002204191,0.026605763],"category_scores_gemma":[0.007332091,0.0012039796,0.0011737266,0.002409055,0.001063861,0.005820575,0.004313756,0.0023160782,0.017529197],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003827627,0.00013580517,0.00058316934,0.00055029587,0.00005933313,0.00049921236,0.0004277481,0.0035832266,0.015122989,0.13360254,0.061226998,0.78382593],"study_design_scores_gemma":[0.00015384694,0.000109697656,0.0005006126,0.00035340176,0.00019633291,0.0011342149,0.00030112546,0.26680258,0.12283497,0.36370316,0.24379736,0.00011273451],"about_ca_topic_score_codex":0.00094691146,"about_ca_topic_score_gemma":0.0018892708,"teacher_disagreement_score":0.026605763,"about_ca_system_score_codex":0.0007797517,"about_ca_system_score_gemma":0.0016635901,"threshold_uncertainty_score":0.08900511},"labels":[],"label_agreement":null},{"id":"W3151350767","doi":"10.1007/978-3-642-16181-0_21","title":"Consistency of Sequence-Based Gene Clusters","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Consistency (knowledge bases); Gene cluster; Gene; Genome; Computational biology; Completeness (order theory); Sequence (biology); Genomics; Biology; Set (abstract data type); Cluster (spacecraft); Comparative genomics; Genetics; Gene sequence; Evolutionary biology; Computer science; Mathematics; Artificial intelligence; Phylogenetic tree","score_opus":0.016975422149013188,"score_gpt":0.24131757281208133,"score_spread":0.22434215066306815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151350767","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.31720835,0.001234765,0.6687834,0.00067006995,0.00014833121,0.00016558071,0.0044393544,0.0019139895,0.0054361257],"genre_scores_gemma":[0.8027817,0.00046556548,0.18353297,0.00022219795,0.00019820944,0.00025371037,0.009397698,0.0009731,0.0021748247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99246866,0.0019173243,0.0005671882,0.0023162896,0.0023023803,0.00042821985],"domain_scores_gemma":[0.93635094,0.042769633,0.0036256039,0.010051011,0.0061106323,0.0010922486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047607976,0.00065009523,0.002396652,0.0052331737,0.0014142522,0.0043565147,0.006459905,0.0017808498,0.0039403467],"category_scores_gemma":[0.052201644,0.0014723206,0.0014843273,0.0065805386,0.0031734956,0.0062716794,0.0029470846,0.0023248894,0.0008401777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004375937,0.00038701794,0.07530674,0.0015669527,0.0007978454,0.0008448074,0.0016745911,0.36721537,0.024072636,0.3191551,0.011897357,0.19270574],"study_design_scores_gemma":[0.00019344136,0.0001608145,0.00973384,0.00010008347,0.00016851719,0.0006643034,0.00035810468,0.47818348,0.012160728,0.4944136,0.0037920133,0.000070973256],"about_ca_topic_score_codex":0.0018685581,"about_ca_topic_score_gemma":0.0022010554,"teacher_disagreement_score":0.006459905,"about_ca_system_score_codex":0.001468124,"about_ca_system_score_gemma":0.0015062146,"threshold_uncertainty_score":0.025177836},"labels":[],"label_agreement":null},{"id":"W3151395092","doi":"10.1007/978-3-030-72132-9_8","title":"Educational Escape Room – Challenges and Obstacles","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":1,"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":"Scope (computer science); Reading (process); Process (computing); Population; Quarter (Canadian coin); Phenomenon; Psychology; Computer science; Political science; Sociology; History; Law; Epistemology","score_opus":0.0253956722737493,"score_gpt":0.2570455298852023,"score_spread":0.231649857611453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151395092","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.041046456,0.064284116,0.09646276,0.24355486,0.018412782,0.00015538585,0.00039425725,0.0047190487,0.53097034],"genre_scores_gemma":[0.28452078,0.027169585,0.04560272,0.018551687,0.0028079343,0.00034532498,0.00061570667,0.001616206,0.6187701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981975,0.00065970235,0.00005243332,0.00018791799,0.00043992238,0.000462461],"domain_scores_gemma":[0.9964012,0.0008485853,0.00010728345,0.00020651164,0.00042363562,0.0020127825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039891717,0.000744408,0.0007251391,0.0005098133,0.0028556134,0.008468899,0.0033800078,0.0029996263,0.070407435],"category_scores_gemma":[0.0052210167,0.00036857472,0.00072838383,0.0005264299,0.0026046925,0.010766218,0.009329454,0.006655674,0.01754341],"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.00018460295,0.00035700892,0.0007238845,0.00037900303,0.0000105689705,0.0005532221,0.004247745,0.00061079586,0.0004981932,0.16237521,0.37302643,0.45703337],"study_design_scores_gemma":[0.00004042306,0.00014738443,0.00058866973,0.0013036204,0.000010085489,0.0011077567,0.014555862,0.00097278325,0.00042956628,0.08965903,0.89114004,0.000044866923],"about_ca_topic_score_codex":0.0013763156,"about_ca_topic_score_gemma":0.0049404134,"teacher_disagreement_score":0.070407435,"about_ca_system_score_codex":0.0013818825,"about_ca_system_score_gemma":0.005202989,"threshold_uncertainty_score":0.23553634},"labels":[],"label_agreement":null},{"id":"W3151909024","doi":"10.1007/978-3-030-72582-2_7","title":"An Empirical Measurement Study of Free Live Streaming Services","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scalability; Quality of experience; Live streaming; The Internet; Internet privacy; Analytics; Android (operating system); Network packet; Broadcasting (networking); Computer security; World Wide Web; Multimedia; Quality of service; Computer network; Data science; Database","score_opus":0.05850408391236641,"score_gpt":0.3300232906885589,"score_spread":0.2715192067761925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151909024","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.9968714,0.00004879187,0.00084615627,0.000054559478,0.000003953889,0.000051782437,0.0001481223,0.000006122992,0.0019691603],"genre_scores_gemma":[0.998577,0.00003286337,0.00061046175,0.000021892287,0.0000072321277,0.000040885905,0.00020586379,0.000005307922,0.0004983736],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9941554,0.0034666301,0.00033764352,0.00036059198,0.0013597079,0.0003200089],"domain_scores_gemma":[0.86913127,0.10582623,0.008211005,0.0038575626,0.0104097,0.0025643196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006821622,0.0002605069,0.00023998643,0.0016543367,0.0008140877,0.0011896861,0.0012525779,0.0006683491,0.0035861726],"category_scores_gemma":[0.066636436,0.00031572665,0.00026758,0.0024594024,0.0010152947,0.002420984,0.0010018488,0.0011787282,0.0006268289],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077107985,0.0044582547,0.9335084,0.00014557828,0.000107985856,0.00033598425,0.010742513,0.0008345651,0.0019418378,0.0052528144,0.0013054203,0.04059555],"study_design_scores_gemma":[0.00007815703,0.0026961064,0.9618965,0.000067136716,0.00012272818,0.0004991354,0.01906085,0.009908806,0.0017972809,0.001276036,0.0025585957,0.000038688097],"about_ca_topic_score_codex":0.017245848,"about_ca_topic_score_gemma":0.009831703,"teacher_disagreement_score":0.017245848,"about_ca_system_score_codex":0.0015945922,"about_ca_system_score_gemma":0.0012744981,"threshold_uncertainty_score":0.036076605},"labels":[],"label_agreement":null},{"id":"W3153073926","doi":"10.1007/978-3-030-73203-5_8","title":"Social Requirements Models for Services","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Dependency (UML); Obligation; Semantics (computer science); Specification language; Expressive power; Programming language specification; Requirements analysis; Programming language; Software engineering; Knowledge management; Law; Political science","score_opus":0.05620033992798338,"score_gpt":0.2955183675531093,"score_spread":0.2393180276251259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153073926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010722974,0.00082125154,0.819673,0.004983884,0.00022621966,0.00038147802,0.0006438504,0.00050412613,0.16204318],"genre_scores_gemma":[0.49718454,0.0015027866,0.41826227,0.00096186553,0.00028101253,0.0014983825,0.001926381,0.00045617597,0.077926554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670595,0.001704457,0.00020556214,0.00027796146,0.0008162113,0.00028987802],"domain_scores_gemma":[0.99689627,0.0019039818,0.00019842782,0.0003526018,0.00050907995,0.00013953978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028554625,0.001431884,0.00073239655,0.0014274734,0.0011235185,0.0033008954,0.002029649,0.0019788793,0.015172738],"category_scores_gemma":[0.0079733925,0.00087876467,0.0014515948,0.0014597533,0.0018514239,0.004765334,0.002359076,0.0025216257,0.0027207716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018514793,0.000029642813,0.00007451292,0.00007419561,0.000015308517,0.00010412163,0.00030037732,0.024521044,0.00030113425,0.95839435,0.004732474,0.011434445],"study_design_scores_gemma":[0.000023991806,0.000017276694,0.00007746681,0.000056416327,0.000015712378,0.000084146785,0.00025885837,0.15466592,0.0003224624,0.79928404,0.045179114,0.000014743334],"about_ca_topic_score_codex":0.0057894033,"about_ca_topic_score_gemma":0.005510311,"teacher_disagreement_score":0.015172738,"about_ca_system_score_codex":0.0032415728,"about_ca_system_score_gemma":0.0017124083,"threshold_uncertainty_score":0.050757885},"labels":[],"label_agreement":null},{"id":"W3154622536","doi":"10.1007/978-3-030-78270-2_59","title":"A Comparative Study of Learning Outcomes for Online Learning Platforms","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Personalization; Computer science; Context (archaeology); Personalized learning; Online learning; Multimedia; Educational technology; Metacognition; Active learning (machine learning); Blended learning; Key (lock); Artificial intelligence; Cooperative learning; Open learning; World Wide Web; Teaching method; Psychology; Mathematics education; Cognition","score_opus":0.04039646823116006,"score_gpt":0.3470661825068869,"score_spread":0.30666971427572687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154622536","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.9940122,0.0001648151,0.0002041935,0.00014924392,0.000025836009,0.000045449506,0.00022277077,0.000014435635,0.005161085],"genre_scores_gemma":[0.9982742,0.00006520943,0.000100991805,0.00001792461,0.000016541486,0.000041030977,0.00015020536,0.0000070644073,0.0013268022],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9952749,0.0020554487,0.000254985,0.00036674604,0.0014155672,0.0006323911],"domain_scores_gemma":[0.9403276,0.037678216,0.0071875933,0.0018243061,0.0060886517,0.006893637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066917827,0.0003521731,0.0005387238,0.0032330914,0.0009319409,0.00284051,0.0007858782,0.0010168876,0.012789621],"category_scores_gemma":[0.040488325,0.00013071184,0.00068987743,0.002419889,0.0008765595,0.0037241227,0.0020269628,0.0011060433,0.0021365911],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02094642,0.021577347,0.71907765,0.0007738077,0.0008671137,0.0005465262,0.010582454,0.0018022299,0.0037722702,0.007445725,0.0043624286,0.208246],"study_design_scores_gemma":[0.0005243021,0.016176501,0.9546313,0.00023965663,0.0003564603,0.00021598874,0.014369735,0.0024241519,0.002618435,0.0033417835,0.0050191693,0.00008247317],"about_ca_topic_score_codex":0.0014457454,"about_ca_topic_score_gemma":0.0015041033,"teacher_disagreement_score":0.012789621,"about_ca_system_score_codex":0.0010644342,"about_ca_system_score_gemma":0.0012298843,"threshold_uncertainty_score":0.042785525},"labels":[],"label_agreement":null},{"id":"W3156953634","doi":"10.1007/978-3-030-86838-3_29","title":"Labeling Schemes for Deterministic Radio Multi-broadcast","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Set (abstract data type); Radio broadcasting; Radio networks; Broadcasting (networking); Broadcast engineering; Distributed computing; Theoretical computer science; Telecommunications; Engineering; Wireless network; Wireless","score_opus":0.04539100033866524,"score_gpt":0.32003762845249817,"score_spread":0.27464662811383295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156953634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022583993,0.000704424,0.95069325,0.0016119912,0.00024237469,0.00023245084,0.00074970163,0.0010601485,0.02212169],"genre_scores_gemma":[0.5934585,0.0012831268,0.37055755,0.0012268443,0.00047401857,0.001089014,0.0011857921,0.0006348873,0.03009027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584645,0.0013442367,0.00026697366,0.0007875836,0.00093845575,0.0008163556],"domain_scores_gemma":[0.9838054,0.009579232,0.00083337317,0.004422353,0.00078377244,0.0005758498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040713227,0.0011736886,0.0020298567,0.001117384,0.0022384196,0.0038001882,0.0044331253,0.0025282176,0.010014497],"category_scores_gemma":[0.014955948,0.0010910799,0.0012804583,0.0025603168,0.0023656872,0.0058230036,0.006048181,0.004094923,0.0017863921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006755423,0.00013396067,0.00023121045,0.00034741883,0.000046466084,0.00007138269,0.0003192987,0.10039028,0.0028326863,0.81710356,0.011271474,0.066576764],"study_design_scores_gemma":[0.00016338145,0.000082971754,0.00012044845,0.00008278325,0.000049810904,0.0000844003,0.00005923043,0.24424076,0.0017822395,0.7446974,0.008586951,0.000049547292],"about_ca_topic_score_codex":0.0019474382,"about_ca_topic_score_gemma":0.0021723227,"teacher_disagreement_score":0.010014497,"about_ca_system_score_codex":0.0044658906,"about_ca_system_score_gemma":0.0029439714,"threshold_uncertainty_score":0.033501863},"labels":[],"label_agreement":null},{"id":"W3157306088","doi":"10.1007/978-3-642-31254-0_49","title":"Rotation Invariant Fuzzy Shape Contexts Based on Eigenshapes and Fourier Transforms for Efficient Radiological Image Retrieval","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université de Moncton","funders":"","keywords":"Invariant (physics); Computer science; Artificial intelligence; Rotation (mathematics); Histogram; Fourier transform; Computer vision; Pattern recognition (psychology); Fast Fourier transform; Translation (biology); Algorithm; Mathematics; Image (mathematics); Mathematical analysis","score_opus":0.021530914043905298,"score_gpt":0.2572866360991458,"score_spread":0.2357557220552405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157306088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043054614,0.0016493538,0.95279884,0.00010302897,0.00007573119,0.000036767586,0.000113001624,0.0004665162,0.0017021383],"genre_scores_gemma":[0.4110456,0.0016947635,0.58331925,0.00009849017,0.00015438483,0.00005961763,0.00042149608,0.0001410286,0.0030653775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961287,0.000075777214,0.00002486387,0.00007153351,0.00017618762,0.000038739625],"domain_scores_gemma":[0.9995734,0.00014401118,0.000047432404,0.00008641333,0.00012805236,0.000020622872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035137878,0.00039414913,0.0009546871,0.0011382607,0.00027852974,0.0008052749,0.0007657796,0.00049641175,0.0017431189],"category_scores_gemma":[0.0013982367,0.00026008848,0.0007264505,0.0012160282,0.00039113988,0.0011372676,0.00077566446,0.00060556934,0.00074965606],"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.0004547185,0.00011843988,0.00057870464,0.00018693904,0.000059487706,0.00013871292,0.00010873486,0.049422685,0.16994074,0.024853136,0.0031823702,0.75095534],"study_design_scores_gemma":[0.000017372204,0.00013075683,0.0018851004,0.000034182085,0.000050931936,0.00043249188,0.000091256436,0.94147855,0.036282353,0.015668308,0.0038790123,0.00004970923],"about_ca_topic_score_codex":0.0011655911,"about_ca_topic_score_gemma":0.0018838466,"teacher_disagreement_score":0.0017431189,"about_ca_system_score_codex":0.00031373036,"about_ca_system_score_gemma":0.00029908636,"threshold_uncertainty_score":0.005831301},"labels":[],"label_agreement":null},{"id":"W3158053678","doi":"10.1007/978-3-030-73200-4_47","title":"LSTM Based Sentiment Analysis for Cryptocurrency Prediction","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":90,"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":"Computer science; Sentiment analysis; Social media; Cryptocurrency; Pipeline (software); Big data; Artificial intelligence; Precision and recall; Volume (thermodynamics); Social media analytics; Analytics; Data science; Natural language processing; Machine learning; Data mining; World Wide Web","score_opus":0.08994810533514011,"score_gpt":0.37372897833953367,"score_spread":0.2837808730043936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158053678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12483438,0.0039662025,0.84240913,0.0008062653,0.0014535368,0.000107755084,0.0023585344,0.0073743155,0.01668987],"genre_scores_gemma":[0.7905841,0.0020807402,0.17206648,0.00032719015,0.0007467783,0.0001081661,0.0036862926,0.00033519053,0.030065067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999131,0.000014170046,0.000006674982,0.000018573492,0.000029270295,0.000018142095],"domain_scores_gemma":[0.9998672,0.000040316336,0.000012150278,0.0000113047045,0.00006163927,0.000007342137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002286686,0.0005728318,0.0003769055,0.0004882086,0.0001826715,0.000517652,0.0003547196,0.00042767916,0.006592476],"category_scores_gemma":[0.00049446843,0.00015035708,0.00041992465,0.0006705438,0.00008990461,0.0006167608,0.00030865482,0.0006871969,0.0030172034],"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.00021898198,0.00014650403,0.001273008,0.00013534864,0.00008154573,0.00010338591,0.000031862706,0.036576737,0.07939744,0.0018050065,0.018536136,0.86169404],"study_design_scores_gemma":[0.0000070093006,0.00005466942,0.0011275006,0.00001209019,0.000034782657,0.000035480658,0.000013361146,0.98101014,0.013203941,0.0014728368,0.0030186863,0.00000956577],"about_ca_topic_score_codex":0.0023672215,"about_ca_topic_score_gemma":0.003889511,"teacher_disagreement_score":0.006592476,"about_ca_system_score_codex":0.00026204664,"about_ca_system_score_gemma":0.00026625287,"threshold_uncertainty_score":0.022054076},"labels":[],"label_agreement":null},{"id":"W3158084603","doi":"10.1007/978-3-030-83903-1_9","title":"Towards Certified Analysis of Software Product Line Safety Cases","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","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":"General Motors (Canada); University of Toronto","funders":"","keywords":"Correctness; Computer science; Certification; Mathematical proof; Gas meter prover; Software product line; Automated theorem proving; Software engineering; Product (mathematics); Formal methods; Proof assistant; Software; Lift (data mining); Programming language; Software development; Data mining; Mathematics","score_opus":0.020505091285421658,"score_gpt":0.24785155885653384,"score_spread":0.22734646757111218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158084603","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.031611245,0.000090539565,0.9604178,0.00045281072,0.00004864644,0.00027208315,0.00024854337,0.0026366073,0.004221747],"genre_scores_gemma":[0.49802378,0.00020887825,0.4939064,0.00032610598,0.000101278165,0.00033307646,0.0021780597,0.0010142764,0.003908002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9804954,0.0053891377,0.0011969553,0.0022859122,0.008378531,0.0022540123],"domain_scores_gemma":[0.9443632,0.031603694,0.0023253714,0.0099786045,0.010915888,0.00081323937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007981109,0.001453633,0.0012679296,0.0052233236,0.0015583772,0.007915934,0.0048313653,0.002601486,0.006328538],"category_scores_gemma":[0.05737211,0.0020571523,0.0042003803,0.0020652874,0.0040565124,0.00647398,0.004903216,0.004596699,0.0017722625],"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.00069466705,0.0012722149,0.008202694,0.0007460754,0.00036210023,0.0019374972,0.0012761052,0.30247527,0.026544334,0.42923898,0.009702793,0.21754721],"study_design_scores_gemma":[0.0000923322,0.00009163324,0.00054451876,0.00013020878,0.00010971101,0.00020776113,0.00027793998,0.7751047,0.017139971,0.20172909,0.0045259334,0.00004621079],"about_ca_topic_score_codex":0.0077828774,"about_ca_topic_score_gemma":0.01009425,"teacher_disagreement_score":0.007981109,"about_ca_system_score_codex":0.0033555003,"about_ca_system_score_gemma":0.007886614,"threshold_uncertainty_score":0.042208612},"labels":[],"label_agreement":null},{"id":"W3158353526","doi":"10.1007/978-3-030-81293-5_16","title":"Memory Optimization Techniques for Computing Discrete Logarithms in Compressed SIKE","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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":"National Research Council Canada; University of Waterloo","funders":"","keywords":"Computer science; Isogeny; Key encapsulation; Logarithm; Suite; Discrete logarithm; Key (lock); Public-key cryptography; Algorithm; Theoretical computer science; Mathematics; Elliptic curve; Symmetric-key algorithm; Computer security","score_opus":0.012629593172033736,"score_gpt":0.24925357093429615,"score_spread":0.2366239777622624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158353526","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.0367789,0.0021202273,0.93745136,0.0006566085,0.0002858357,0.00012145387,0.0002931146,0.0033854137,0.01890708],"genre_scores_gemma":[0.4495194,0.0014662634,0.5262851,0.00043508588,0.00043087592,0.0002729935,0.0007693041,0.00083490013,0.019986145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909556,0.00016157977,0.000063831816,0.00010600218,0.0004297701,0.0001432606],"domain_scores_gemma":[0.9989298,0.0005036775,0.000072173134,0.00030934936,0.00015252295,0.000032451375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057380286,0.00084849866,0.0011442957,0.0010550332,0.00069656415,0.0017451132,0.0013555055,0.00065091794,0.00801982],"category_scores_gemma":[0.0030967705,0.0003772011,0.00076356146,0.0023290773,0.00094396184,0.003237366,0.0017004432,0.0017676094,0.0020941792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008349531,0.00025602223,0.0008054288,0.00039018184,0.00011361156,0.00015891038,0.00029391778,0.12981872,0.026583454,0.24932417,0.02124513,0.57017547],"study_design_scores_gemma":[0.000081293256,0.00014718216,0.00035893143,0.000061883475,0.000046061763,0.00016899608,0.00012377655,0.76471525,0.02578606,0.20011874,0.008348196,0.000043564924],"about_ca_topic_score_codex":0.0015472524,"about_ca_topic_score_gemma":0.005235006,"teacher_disagreement_score":0.00801982,"about_ca_system_score_codex":0.001089071,"about_ca_system_score_gemma":0.0012442732,"threshold_uncertainty_score":0.026829004},"labels":[],"label_agreement":null},{"id":"W3158396170","doi":"10.1007/978-3-031-45673-2_38","title":"IA-GCN: Interpretable Attention Based Graph Convolutional Network for Disease Prediction","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute on Aging; National Institutes of Health; Technische Universität München","keywords":"Interpretability; Computer science; Novelty; Artificial intelligence; Machine learning; Graph; Task (project management); Domain (mathematical analysis); Feature (linguistics); Medical diagnosis; Theoretical computer science; Medicine","score_opus":0.014841997937179269,"score_gpt":0.28927527152010074,"score_spread":0.27443327358292147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158396170","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.12632206,0.0052117654,0.8151357,0.0021705027,0.0010575079,0.00035287868,0.010811028,0.030108789,0.008829773],"genre_scores_gemma":[0.74644303,0.001477053,0.21829209,0.0015202006,0.00026425993,0.00027727408,0.01318257,0.00056229805,0.017981144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981517,0.000027064563,0.0000070132314,0.00007917473,0.000028854127,0.000042713033],"domain_scores_gemma":[0.99970895,0.00010554196,0.000022596078,0.00005180024,0.00007439336,0.000036680623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045145693,0.0011897059,0.00078247406,0.00093947107,0.00037403748,0.00052741205,0.0017722702,0.0014262302,0.003829781],"category_scores_gemma":[0.0012790869,0.00035907602,0.00080613507,0.00084085134,0.0003155422,0.000714657,0.0011088352,0.0016011717,0.0012712888],"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.0006585319,0.0004817557,0.0066145184,0.00027827983,0.00035680964,0.0004502146,0.00010701522,0.2466931,0.02262922,0.008668416,0.056405183,0.6566569],"study_design_scores_gemma":[0.000021448908,0.000054015865,0.0008943317,0.000017735334,0.00004018941,0.00004794787,0.000009659542,0.98693615,0.0030201937,0.0069931136,0.001952807,0.000012424597],"about_ca_topic_score_codex":0.040235303,"about_ca_topic_score_gemma":0.05922453,"teacher_disagreement_score":0.040235303,"about_ca_system_score_codex":0.0011498552,"about_ca_system_score_gemma":0.0013192394,"threshold_uncertainty_score":0.08000225},"labels":[],"label_agreement":null},{"id":"W3159453235","doi":"10.1007/978-3-662-63170-6_4","title":"Algorithms for Generating Strongly Chordal Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Chordal graph; Interval graph; Split graph; Pathwidth; Indifference graph; Combinatorics; Treewidth; Computer science; Outerplanar graph; Mathematics; Graph; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.03295453966932661,"score_gpt":0.30288861939613304,"score_spread":0.26993407972680644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159453235","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.026138403,0.00038581234,0.9171953,0.00063260517,0.00018466568,0.0005776438,0.0017577981,0.00499849,0.048129212],"genre_scores_gemma":[0.15353937,0.00050619745,0.8148391,0.00023470372,0.00010708589,0.0005563907,0.005590658,0.0013841459,0.023242313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00017979692,0.00007099041,0.00021240099,0.0004374275,0.00013303406],"domain_scores_gemma":[0.9956481,0.0024206338,0.00013377913,0.0010890386,0.0005615904,0.00014678588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083485356,0.0011018972,0.0007343647,0.0011688393,0.0011192088,0.0019927884,0.002923672,0.0011829614,0.020908918],"category_scores_gemma":[0.005690381,0.00087530754,0.0013497422,0.0022183456,0.00086448836,0.003540405,0.003499349,0.0021538003,0.006149328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029053364,0.00029952198,0.0008558196,0.0008148901,0.0000516531,0.00015785015,0.0005785063,0.026198262,0.00944003,0.29878235,0.050918594,0.61161196],"study_design_scores_gemma":[0.00018415324,0.00010990201,0.00043618155,0.00011041826,0.00008047246,0.00030105643,0.00029860993,0.16503869,0.013532368,0.774812,0.045056287,0.000039991795],"about_ca_topic_score_codex":0.0010169647,"about_ca_topic_score_gemma":0.0024313582,"teacher_disagreement_score":0.020908918,"about_ca_system_score_codex":0.001284105,"about_ca_system_score_gemma":0.0012572699,"threshold_uncertainty_score":0.0699473},"labels":[],"label_agreement":null},{"id":"W3160226286","doi":"10.1007/978-3-030-73879-2_23","title":"Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Disjoint sets; Cardinality (data modeling); Bounded function; Mathematics; Combinatorics; Constant (computer programming); Discrete mathematics; Tree (set theory); Routing (electronic design automation); Computer science","score_opus":0.016773846219433224,"score_gpt":0.2219259976952959,"score_spread":0.20515215147586266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160226286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10362939,0.0013131229,0.8506771,0.0012704462,0.00022220892,0.00021518154,0.00040553734,0.0022575103,0.040009584],"genre_scores_gemma":[0.36553356,0.0014039186,0.6086577,0.00042963328,0.00023062908,0.00036112257,0.00087127375,0.0013243231,0.021187803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892104,0.00022975956,0.0000489261,0.00027613487,0.00034028263,0.00018384833],"domain_scores_gemma":[0.99420327,0.004448678,0.00022700828,0.0006530943,0.00026904966,0.0001989526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294111,0.0016281907,0.0015309192,0.0013871785,0.0009863169,0.0031225795,0.0035625836,0.0019486294,0.009601201],"category_scores_gemma":[0.01100254,0.0010205524,0.0015554368,0.002600468,0.0015734484,0.0061062984,0.0042174077,0.005045232,0.0016541871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093847606,0.0005099973,0.0011309041,0.00092948787,0.00012045703,0.00021063017,0.0010053425,0.28143042,0.008030201,0.35879874,0.018166972,0.32872835],"study_design_scores_gemma":[0.00009595681,0.00007966404,0.00023237489,0.00010997779,0.000083632935,0.00013880106,0.00016570729,0.54140484,0.00312813,0.44880566,0.0057375887,0.000017666174],"about_ca_topic_score_codex":0.0021678146,"about_ca_topic_score_gemma":0.0039121676,"teacher_disagreement_score":0.009601201,"about_ca_system_score_codex":0.0025158848,"about_ca_system_score_gemma":0.0014209875,"threshold_uncertainty_score":0.032119215},"labels":[],"label_agreement":null},{"id":"W3161409247","doi":"10.1007/978-3-030-81688-9_14","title":"An SMT Solver for Regular Expressions and Linear Arithmetic over String Length","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Web Application Security Vulnerabilities","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Speedup; Computer science; String (physics); Heuristics; Benchmark (surveying); Solver; Regular expression; Parallel computing; Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.02201155295383307,"score_gpt":0.30052475827172775,"score_spread":0.2785132053178947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161409247","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.036933698,0.0005325748,0.9009076,0.00138504,0.00021528313,0.00027943525,0.003096341,0.02629389,0.030356213],"genre_scores_gemma":[0.18403554,0.00033828805,0.79839194,0.000485731,0.00010599955,0.00030459603,0.0037766395,0.0024726528,0.01008861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982962,0.00041525907,0.00012795193,0.0003072213,0.00062200835,0.00023136401],"domain_scores_gemma":[0.99708,0.0020358856,0.00018525132,0.00030765485,0.00032488073,0.00006626621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015566086,0.0011763553,0.0007399769,0.0011457354,0.000655127,0.0019600808,0.0022216898,0.0010869892,0.017142097],"category_scores_gemma":[0.0059388173,0.00063276285,0.0020833167,0.002175529,0.0010395225,0.0024946788,0.002036081,0.0020398283,0.003266103],"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.00047661463,0.0003397301,0.002591584,0.0016349477,0.0001661717,0.00044297133,0.0003662469,0.32110485,0.012641754,0.2555297,0.06121388,0.34349146],"study_design_scores_gemma":[0.00024213243,0.000075841795,0.0002824001,0.00009026816,0.000055621083,0.00016361749,0.0001471226,0.86581033,0.015583655,0.09065252,0.026871411,0.00002511916],"about_ca_topic_score_codex":0.0049006874,"about_ca_topic_score_gemma":0.009319544,"teacher_disagreement_score":0.017142097,"about_ca_system_score_codex":0.0019286923,"about_ca_system_score_gemma":0.0039945086,"threshold_uncertainty_score":0.057345986},"labels":[],"label_agreement":null},{"id":"W3161421710","doi":"10.1007/978-3-030-74296-6_32","title":"Automated Repair of Layout Bugs in Web Pages with Linear Programming","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Solver; Integer programming; Container (type theory); Linear programming; Web page; State (computer science); Programming language; Parallel computing; Algorithm; World Wide Web; Engineering","score_opus":0.019652387797870846,"score_gpt":0.2611711895946186,"score_spread":0.24151880179674776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161421710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052189976,0.0003437075,0.91653204,0.00022679016,0.00005490385,0.00007900546,0.00016032996,0.026512524,0.0039008162],"genre_scores_gemma":[0.3454806,0.00020949269,0.644632,0.000107489315,0.000027263119,0.000074636824,0.00042258878,0.0019237134,0.0071222726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987558,0.0003571003,0.00007979482,0.00025282727,0.00038457807,0.00016997832],"domain_scores_gemma":[0.9951066,0.0029645998,0.0004652284,0.00086168695,0.0005104966,0.00009139799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886407,0.0009640942,0.0008111054,0.0008345911,0.00065767404,0.0011816781,0.0020553372,0.00088345865,0.007711562],"category_scores_gemma":[0.005310628,0.000954091,0.0008453932,0.001055098,0.00092710886,0.0020942828,0.0016957758,0.0014518816,0.0023290287],"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.00058759196,0.00036573145,0.0029757812,0.0006354962,0.00007965289,0.000533787,0.0004955201,0.10526855,0.045170378,0.013796619,0.014793144,0.8152977],"study_design_scores_gemma":[0.00011151592,0.00029602041,0.0011492405,0.00010049127,0.00008626203,0.00052758615,0.0002179587,0.8984508,0.06247438,0.0290997,0.007437607,0.00004848303],"about_ca_topic_score_codex":0.0031068516,"about_ca_topic_score_gemma":0.003918565,"teacher_disagreement_score":0.007711562,"about_ca_system_score_codex":0.00062766916,"about_ca_system_score_gemma":0.0010432339,"threshold_uncertainty_score":0.025797725},"labels":[],"label_agreement":null},{"id":"W3161838415","doi":"10.1007/978-3-030-75765-6_52","title":"SILVER: Generating Persuasive Chinese Product Pitch","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Product (mathematics); Rank (graph theory); Natural language generation; Artificial intelligence; Deep learning; Hierarchy; Statistic; Generator (circuit theory); Artificial neural network; Natural language processing; Information retrieval; Natural language; Power (physics)","score_opus":0.017426941477831692,"score_gpt":0.24929634065845116,"score_spread":0.23186939918061947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161838415","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.17254664,0.0013558319,0.66985583,0.0009146151,0.0018101343,0.0010586379,0.0028242688,0.050981287,0.09865279],"genre_scores_gemma":[0.5305633,0.00050332624,0.38318115,0.0003109691,0.00028235134,0.00069653714,0.0051623913,0.0032615745,0.076038554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996276,0.00010589116,0.000014414518,0.0000910079,0.00013103438,0.000029938556],"domain_scores_gemma":[0.9990477,0.0006181106,0.000028817603,0.0000948316,0.00016514164,0.00004528477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007162976,0.0011659436,0.00050936063,0.00075406465,0.0004920576,0.0010987635,0.0008318611,0.0006961915,0.03408262],"category_scores_gemma":[0.0037144735,0.0003282117,0.00042078816,0.0005867399,0.0002884257,0.0017186579,0.0014425623,0.0006235859,0.0078715095],"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.00088781456,0.00021793964,0.0014924823,0.0007614966,0.00006416715,0.0005053037,0.0019045307,0.008496239,0.03229503,0.013400808,0.08148815,0.85848606],"study_design_scores_gemma":[0.00058672036,0.0018132915,0.0066305622,0.00031478924,0.00031998317,0.00089898636,0.003103151,0.6621862,0.09721779,0.047984693,0.17877528,0.00016852652],"about_ca_topic_score_codex":0.00094302284,"about_ca_topic_score_gemma":0.0011804181,"teacher_disagreement_score":0.03408262,"about_ca_system_score_codex":0.00029580534,"about_ca_system_score_gemma":0.00035152456,"threshold_uncertainty_score":0.114017725},"labels":[],"label_agreement":null},{"id":"W3162511581","doi":"","title":"A UML Model of the Client Tracking System at the Learning Enrichment Foundation in Toronto, Canada: A Study of Class, Object, and State Diagrams","year":2008,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Class diagram; Unified Modeling Language; Class (philosophy); Foundation (evidence); Object (grammar); Object-oriented programming; State diagram; Artificial intelligence; State (computer science); Tracking (education); Sequence diagram; Programming language; Object model; Software engineering","score_opus":0.017988856313256966,"score_gpt":0.22663678161614428,"score_spread":0.2086479253028873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162511581","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.4391967,0.000971945,0.3660023,0.006016472,0.00011620501,0.0009143955,0.019544015,0.0047854413,0.16245247],"genre_scores_gemma":[0.8448681,0.00082469673,0.111238435,0.00018052457,0.000014521813,0.0002494089,0.004995624,0.0004209315,0.03720781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941146,0.00011047177,0.00003002271,0.000064293046,0.0002762122,0.0001075965],"domain_scores_gemma":[0.9982298,0.0006793978,0.00016495262,0.000117548865,0.0006655203,0.00014276116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008111116,0.00037806513,0.00021858026,0.0021330898,0.0019060775,0.0042199316,0.0014522044,0.0011917459,0.005339365],"category_scores_gemma":[0.0028772755,0.0005406481,0.0003548307,0.0025506467,0.001447843,0.0015711152,0.0004998289,0.0008776376,0.00076660287],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025615326,0.0002120585,0.03248056,0.0003847669,0.000038824077,0.0021279277,0.034493092,0.22422138,0.012827174,0.5625968,0.02672203,0.103639275],"study_design_scores_gemma":[0.00009960453,0.00010275455,0.03738806,0.00054627494,0.00013002865,0.0006170114,0.010394022,0.7009071,0.008527894,0.02979541,0.211263,0.00022878549],"about_ca_topic_score_codex":0.9515665,"about_ca_topic_score_gemma":0.9463442,"teacher_disagreement_score":0.9515665,"about_ca_system_score_codex":0.022291236,"about_ca_system_score_gemma":0.032179914,"threshold_uncertainty_score":0.161735},"labels":[],"label_agreement":null},{"id":"W3162638080","doi":"10.1007/978-3-030-75245-3_24","title":"Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Google (Canada)","funders":"Viet Nam National University Ho Chi Minh City; Agence Nationale de la Recherche; European Commission","keywords":"Computer science; Random oracle; Encryption; Semantic security; Theoretical computer science; Cryptosystem; Server; Public-key cryptography; Threshold cryptosystem; Ciphertext; Standard Model (mathematical formulation); Discrete logarithm; Computer security; Computer network; Attribute-based encryption","score_opus":0.01697826202774497,"score_gpt":0.25201385858266684,"score_spread":0.23503559655492187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162638080","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.052960284,0.0015516172,0.8180837,0.0012939618,0.00042129587,0.00014678044,0.0003107511,0.0018916435,0.123340085],"genre_scores_gemma":[0.7965851,0.0015027516,0.12774009,0.0004073974,0.0003175033,0.00020815355,0.0003759666,0.00060776644,0.07225529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985185,0.00020825541,0.00006313963,0.00025074012,0.00067698676,0.00028246746],"domain_scores_gemma":[0.9987866,0.00042970688,0.00006915884,0.00047315613,0.00015357498,0.00008779946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088373816,0.0008547483,0.0006774508,0.00083428464,0.00090542965,0.003648172,0.0013566299,0.0012412617,0.00695929],"category_scores_gemma":[0.0025442082,0.00056848075,0.00069702003,0.0015497834,0.0021858332,0.0065513733,0.0038571935,0.0040117525,0.00267592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019168474,0.000048483384,0.00012608801,0.00011688323,0.000015672575,0.00006231977,0.00017479295,0.007405419,0.010477381,0.94182664,0.0044410457,0.035113614],"study_design_scores_gemma":[0.000045258865,0.00007046372,0.00019573461,0.000033705586,0.000018703498,0.00024487975,0.00005259923,0.1067829,0.019829579,0.8504268,0.0222595,0.00004000397],"about_ca_topic_score_codex":0.0003207123,"about_ca_topic_score_gemma":0.0004146235,"teacher_disagreement_score":0.00695929,"about_ca_system_score_codex":0.0016270083,"about_ca_system_score_gemma":0.0012653141,"threshold_uncertainty_score":0.023281157},"labels":[],"label_agreement":null},{"id":"W3163332497","doi":"10.1007/978-3-030-86838-3_30","title":"On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Grantová Agentura, Univerzita Karlova; Grantová Agentura České Republiky; European Commission; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Graph coloring; Graph; Class (philosophy); Discrete mathematics; Time complexity; Computer science; Artificial intelligence","score_opus":0.02491208453577773,"score_gpt":0.30208095628936305,"score_spread":0.2771688717535853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163332497","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.74455273,0.00044519344,0.15362708,0.0018160446,0.00041591102,0.00022921544,0.0022282081,0.0010455654,0.09564015],"genre_scores_gemma":[0.9158867,0.00027416644,0.043300517,0.0006475371,0.00010722502,0.00014378759,0.0027164605,0.00043655807,0.036487084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.00017955856,0.000024610516,0.00015710891,0.00013509359,0.0002715567],"domain_scores_gemma":[0.99832755,0.0007104716,0.00020647726,0.00020240562,0.0002802948,0.00027282018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005088729,0.00067995075,0.0005199118,0.00094787544,0.0022716054,0.0018105375,0.0007890749,0.0007781227,0.012087521],"category_scores_gemma":[0.0014312132,0.00042496278,0.000984609,0.00096791744,0.0014659131,0.0014603407,0.0010327651,0.00095838634,0.001215304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007196912,0.0002672069,0.005089681,0.00038305164,0.00009735838,0.001712872,0.0011003072,0.050634433,0.018110994,0.8219921,0.043887876,0.056004405],"study_design_scores_gemma":[0.00009707238,0.0000969828,0.0042421618,0.00008784105,0.00006135628,0.0007013536,0.0006769933,0.11852857,0.01519994,0.8226133,0.037624724,0.000069723515],"about_ca_topic_score_codex":0.011805914,"about_ca_topic_score_gemma":0.015296338,"teacher_disagreement_score":0.012087521,"about_ca_system_score_codex":0.0025017061,"about_ca_system_score_gemma":0.0011767974,"threshold_uncertainty_score":0.040436804},"labels":[],"label_agreement":null},{"id":"W3163835182","doi":"10.1007/978-3-030-99253-8_9","title":"Categorical composable cryptography","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; University of Ottawa","keywords":"Computer science; Theoretical computer science; Cryptography; Bipartite graph; Financial cryptography; Computer security; Set (abstract data type); Modular design; String (physics); Programming language; Mathematics; Public-key cryptography; Encryption","score_opus":0.014220224505262526,"score_gpt":0.23349144187826407,"score_spread":0.21927121737300154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163835182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02506331,0.0023928478,0.6872822,0.002615322,0.00074690365,0.0001210434,0.0003584681,0.0010826152,0.28033736],"genre_scores_gemma":[0.74013114,0.0025788224,0.14636463,0.0011324122,0.0005109944,0.000327931,0.0006642383,0.0004018521,0.10788791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00029060393,0.000048642985,0.00019103564,0.00039915543,0.00009734079],"domain_scores_gemma":[0.9991074,0.0003406884,0.000045624525,0.00029510594,0.00013237205,0.000078837744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008499868,0.00041453537,0.00043288292,0.0009224636,0.0011663747,0.0031596783,0.0009627293,0.0008991346,0.008707667],"category_scores_gemma":[0.0015232046,0.00026582775,0.000714828,0.00087830436,0.0037506693,0.005326488,0.0022952144,0.0027336746,0.0019684732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031381096,0.000002049866,0.000017117387,0.000011802062,0.0000011260396,0.0000066751822,0.000046891193,0.0005255508,0.00022293633,0.99679923,0.00040887858,0.0019545762],"study_design_scores_gemma":[0.0000029975945,0.000008652108,0.000027853988,0.000012270612,0.00000241871,0.000035299938,0.000023935027,0.004115085,0.00060394336,0.963055,0.032108042,0.000004640636],"about_ca_topic_score_codex":0.00080523797,"about_ca_topic_score_gemma":0.00049661216,"teacher_disagreement_score":0.008707667,"about_ca_system_score_codex":0.002591709,"about_ca_system_score_gemma":0.0010080981,"threshold_uncertainty_score":0.029130042},"labels":[],"label_agreement":null},{"id":"W316429726","doi":"10.1007/978-3-540-24767-8_3","title":"On Local Transformations in Plane Geometric Graphs Embedded on Small Grids","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Plane (geometry); Parallel computing; Computational science; Geometry; Mathematics","score_opus":0.015815487866797782,"score_gpt":0.23223586929794654,"score_spread":0.21642038143114875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316429726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4331062,0.0018830386,0.44692305,0.001267476,0.0003859879,0.00017525589,0.00040344428,0.0006059585,0.11524951],"genre_scores_gemma":[0.8665272,0.0024670642,0.06401463,0.00026090577,0.00030165,0.00012811179,0.0006248099,0.00072096015,0.06495474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998054,0.000051791656,0.0000074287414,0.000044178327,0.000061001974,0.000030231622],"domain_scores_gemma":[0.9994185,0.00026306466,0.00009347266,0.000096380776,0.000053344003,0.000075233846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023752314,0.00068380014,0.0007680038,0.0013215119,0.0008042656,0.0011530663,0.0010784043,0.0007817534,0.007605049],"category_scores_gemma":[0.0014796575,0.00048336343,0.0005818734,0.0014174364,0.0019089045,0.0022148115,0.0020273197,0.0018306664,0.000960157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008344211,0.000059951915,0.0004141265,0.00013295183,0.000014977435,0.0001866682,0.00048305487,0.066973306,0.005087297,0.8924416,0.0047237775,0.029398788],"study_design_scores_gemma":[0.000019242221,0.00005055263,0.00055854267,0.000024843028,0.000010136089,0.0001435024,0.00028699648,0.108911686,0.001204974,0.8824099,0.006363422,0.000016265149],"about_ca_topic_score_codex":0.0017194417,"about_ca_topic_score_gemma":0.0019595965,"teacher_disagreement_score":0.007605049,"about_ca_system_score_codex":0.00066089985,"about_ca_system_score_gemma":0.00020470942,"threshold_uncertainty_score":0.025441408},"labels":[],"label_agreement":null},{"id":"W3165058318","doi":"10.1007/978-3-030-85165-1_6","title":"On the Complexity and Parallel Implementation of Hensel’s Lemma and Weierstrass Preparation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Factorization; Weierstrass factorization theorem; Lemma (botany); Computer science; Leverage (statistics); Degree (music); Speedup; Pipeline (software); Factor (programming language); Parallel computing; Algorithm; Artificial intelligence","score_opus":0.03210184032855441,"score_gpt":0.2982190984638437,"score_spread":0.2661172581352893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165058318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14768301,0.0013709723,0.739362,0.0041265003,0.00074866,0.00050861633,0.00075760344,0.008595126,0.0968475],"genre_scores_gemma":[0.7316556,0.0007265639,0.23270583,0.00076108536,0.0006060014,0.00055847166,0.0016273771,0.0022311083,0.029127993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930815,0.0015500694,0.00049148576,0.0010727391,0.0024309552,0.0013733115],"domain_scores_gemma":[0.98550725,0.0072326786,0.00061447744,0.005139254,0.0012035883,0.00030278557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038430968,0.0015018363,0.00255279,0.0019886256,0.002751589,0.0072649135,0.0045638992,0.0016628221,0.028647685],"category_scores_gemma":[0.013303893,0.0013715384,0.0029791896,0.0035408863,0.0037194567,0.017971763,0.0068654227,0.004004751,0.0048248493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017116459,0.0004439496,0.0018642981,0.0004744442,0.00019078908,0.00037368888,0.0007894582,0.028977767,0.013655838,0.7843348,0.018983945,0.14819941],"study_design_scores_gemma":[0.00034301626,0.00016108877,0.00066974224,0.000057748188,0.00018792729,0.00017949291,0.00023404107,0.15650262,0.026564877,0.80383223,0.011153906,0.000113376875],"about_ca_topic_score_codex":0.004437031,"about_ca_topic_score_gemma":0.0055344165,"teacher_disagreement_score":0.028647685,"about_ca_system_score_codex":0.0042123985,"about_ca_system_score_gemma":0.004249877,"threshold_uncertainty_score":0.0958361},"labels":[],"label_agreement":null},{"id":"W3165329374","doi":"10.1007/978-3-030-87199-4_56","title":"Orthogonal Ensemble Networks for Biomedical Image Segmentation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Orthogonality; Segmentation; Artificial intelligence; Ensemble learning; Benchmark (surveying); Context (archaeology); Machine learning; Pattern recognition (psychology); Pairwise comparison; Ensemble forecasting; Mathematics","score_opus":0.01809883677509189,"score_gpt":0.29905016874005025,"score_spread":0.28095133196495836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165329374","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.009816098,0.00070055044,0.98793936,0.00012673321,0.00004162337,0.000022391172,0.00011424502,0.0005698909,0.0006690857],"genre_scores_gemma":[0.3301385,0.0020074234,0.6561764,0.0002072271,0.00020733841,0.0002125253,0.0011821422,0.00047322613,0.0093952315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956304,0.00015551376,0.000026469012,0.000091603615,0.00010956253,0.00005382049],"domain_scores_gemma":[0.99930644,0.0003300462,0.000053341384,0.00011368354,0.00017096351,0.000025520405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867784,0.00070316414,0.0011889781,0.0010908144,0.00036661088,0.00079156127,0.0008190325,0.0011648601,0.0022141289],"category_scores_gemma":[0.0021497817,0.0005935726,0.0012363996,0.0014121467,0.0003573038,0.0010844268,0.0013668571,0.0013487649,0.0007747669],"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.00025050194,0.0001025063,0.0007218706,0.00012177466,0.00021270695,0.000058485595,0.000057462676,0.3661024,0.019044222,0.012472997,0.00448075,0.5963743],"study_design_scores_gemma":[0.0000025286943,0.000011860735,0.0001590969,0.000004275137,0.000014889696,0.000013930239,0.0000043364475,0.9937032,0.001883481,0.0036816366,0.0005172737,0.0000035890462],"about_ca_topic_score_codex":0.004066965,"about_ca_topic_score_gemma":0.004831049,"teacher_disagreement_score":0.004066965,"about_ca_system_score_codex":0.0004836881,"about_ca_system_score_gemma":0.0007174662,"threshold_uncertainty_score":0.008086622},"labels":[],"label_agreement":null},{"id":"W3165430365","doi":"10.1007/978-3-030-75248-4_24","title":"Group Encryption: Full Dynamicity, Message Filtering and Code-Based Instantiation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Ministry of Education, India","keywords":"Computer science; Encryption; Code (set theory); Programming language; Group (periodic table); Theoretical computer science; Computer security","score_opus":0.0136483921077029,"score_gpt":0.2297850883350434,"score_spread":0.2161366962273405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165430365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01522245,0.0009707311,0.9620317,0.0004996724,0.00018224178,0.00014531647,0.00013790824,0.0026286263,0.018181272],"genre_scores_gemma":[0.45660922,0.0016145547,0.5009929,0.0004253578,0.00032424252,0.00028328807,0.0006304281,0.0014270181,0.03769301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980557,0.0004215183,0.00013121268,0.00034485612,0.00073270424,0.000314034],"domain_scores_gemma":[0.99762744,0.00045423518,0.00009799215,0.001533133,0.00021847215,0.00006879405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014235834,0.00081221457,0.0010742081,0.0009422446,0.000850263,0.0029369018,0.0014531187,0.001289569,0.0043435018],"category_scores_gemma":[0.0034201383,0.0006212164,0.0010050534,0.0013711427,0.0019973437,0.006058406,0.0033072631,0.0022506882,0.0027713715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034545132,0.00012489448,0.00038503608,0.00020655578,0.000037850365,0.00015130028,0.00033494027,0.014581912,0.014653797,0.6915073,0.011541409,0.26612964],"study_design_scores_gemma":[0.0000824173,0.00015687782,0.0003567165,0.00010260374,0.00008063919,0.0009688815,0.0000806745,0.18082327,0.036316685,0.71728635,0.06367176,0.000073104566],"about_ca_topic_score_codex":0.00043137855,"about_ca_topic_score_gemma":0.00039531037,"teacher_disagreement_score":0.0043435018,"about_ca_system_score_codex":0.0012232623,"about_ca_system_score_gemma":0.0010654889,"threshold_uncertainty_score":0.01453048},"labels":[],"label_agreement":null},{"id":"W3166952120","doi":"10.1007/978-3-030-36412-0_10","title":"A Randomized Approximation Algorithm for Metric Triangle Packing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Triangle inequality; Approximation algorithm; Combinatorics; Disjoint sets; Randomized algorithm; Vertex (graph theory); Mathematics; Metric (unit); Graph; Discrete mathematics; Algorithm; Computer science","score_opus":0.027703865774299303,"score_gpt":0.2624524088311046,"score_spread":0.2347485430568053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166952120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033862635,0.0012846874,0.93036336,0.0014770362,0.0007446743,0.0006162173,0.0012264367,0.007702191,0.02272276],"genre_scores_gemma":[0.14242113,0.0005711097,0.83945143,0.0005189592,0.00035972698,0.0007800648,0.0034837453,0.00092695886,0.0114869075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961002,0.00075793895,0.00024001625,0.0009021983,0.0014347143,0.0005650666],"domain_scores_gemma":[0.9950464,0.0019316322,0.0002572623,0.0018388258,0.0005260006,0.00039991213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015192428,0.0024983254,0.0036835473,0.0021435195,0.001839123,0.0036541254,0.0068640867,0.0033001679,0.02365098],"category_scores_gemma":[0.0098224,0.0014906959,0.001958749,0.0071732444,0.0015146299,0.0068797665,0.0063760797,0.0040710308,0.0070921965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001898675,0.0011474119,0.0010675963,0.00056107837,0.0001533884,0.00017085686,0.00024297046,0.1377714,0.009286409,0.07337985,0.06120063,0.71311975],"study_design_scores_gemma":[0.0005397639,0.0003072782,0.00044963878,0.000053492688,0.000072247676,0.00026718198,0.00011985925,0.8899399,0.0036415844,0.092809916,0.01174706,0.000052031053],"about_ca_topic_score_codex":0.005417398,"about_ca_topic_score_gemma":0.0065680253,"teacher_disagreement_score":0.02365098,"about_ca_system_score_codex":0.0035595722,"about_ca_system_score_gemma":0.0038666753,"threshold_uncertainty_score":0.0791204},"labels":[],"label_agreement":null},{"id":"W3167010744","doi":"10.1007/978-3-030-77211-6_13","title":"Semantic Web Framework to Computerize Staged Reflex Testing Protocols to Mitigate Underutilization of Pathology Tests for Diagnosing Pituitary Disorders","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Nova Scotia Health Authority; Dalhousie University","funders":"","keywords":"Computer science; Reflex; Protocol (science); Presentation (obstetrics); Psychological intervention; Test (biology); Intervention (counseling); Medical physics; Medicine; Intensive care medicine; Pathology; Surgery; Psychiatry; Alternative medicine","score_opus":0.0447250111411927,"score_gpt":0.3374563926055723,"score_spread":0.2927313814643796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167010744","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.0026317192,0.00014353982,0.9673872,0.00031925034,0.00010285002,0.00027797592,0.0018811717,0.023520749,0.0037356839],"genre_scores_gemma":[0.06837473,0.00038350446,0.91476667,0.00058143906,0.000058217116,0.00053648977,0.008472606,0.0021214616,0.0047048577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986872,0.00024257602,0.00019713843,0.00024181102,0.0005196651,0.000111588204],"domain_scores_gemma":[0.9982943,0.0006290475,0.00010588465,0.0003917103,0.00045124744,0.00012780899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029485533,0.0008047148,0.0007472154,0.0024520084,0.00088453636,0.002814554,0.0019896217,0.0013316206,0.004790402],"category_scores_gemma":[0.0041539688,0.00047426234,0.0022287015,0.0014358718,0.0007111711,0.0033499936,0.0026154649,0.0016023177,0.0022232123],"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.00070208043,0.0010969087,0.0043556904,0.0011104569,0.0004409775,0.0014029647,0.000913592,0.083968066,0.018880162,0.2935352,0.074651964,0.51894194],"study_design_scores_gemma":[0.00009584304,0.00007498239,0.0010522249,0.00028543553,0.00022127983,0.0005353777,0.00025849996,0.594287,0.023520065,0.19571793,0.18385197,0.00009931629],"about_ca_topic_score_codex":0.008579115,"about_ca_topic_score_gemma":0.011739858,"teacher_disagreement_score":0.008579115,"about_ca_system_score_codex":0.0013430013,"about_ca_system_score_gemma":0.0029630414,"threshold_uncertainty_score":0.017058313},"labels":[],"label_agreement":null},{"id":"W3167121994","doi":"10.1007/978-3-030-78270-2_49","title":"Multi-armed Bandit Algorithms for Adaptive Learning: A Survey","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Athabasca University","funders":"","keywords":"Computer science; Adaptive learning; Artificial intelligence; Machine learning","score_opus":0.20252700003973068,"score_gpt":0.420883279384972,"score_spread":0.21835627934524132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167121994","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028167376,0.21343867,0.77175015,0.0010864028,0.00044536096,0.000063462874,0.000111247675,0.00044882356,0.009839155],"genre_scores_gemma":[0.120482884,0.3101536,0.5502674,0.0016840498,0.0038589702,0.0005092172,0.0006794489,0.00050390733,0.011860506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786913,0.00078431156,0.00019910357,0.00045581016,0.0005693588,0.00012221948],"domain_scores_gemma":[0.995452,0.0034680457,0.00019917781,0.00037589498,0.00043267597,0.00007235383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033010715,0.0021710177,0.0035361452,0.0018179647,0.0006778683,0.0038725354,0.0029865594,0.0033989341,0.003963196],"category_scores_gemma":[0.00793594,0.001220683,0.0014555502,0.0066699674,0.0014948794,0.0038130467,0.0022044322,0.0036082289,0.0037359898],"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.0001557906,0.00029424013,0.00079049193,0.0017696533,0.00019505927,0.000043581258,0.000095890515,0.1014349,0.00083059166,0.078635216,0.0092558395,0.8064988],"study_design_scores_gemma":[0.00008031932,0.00033835822,0.0008163065,0.0008051699,0.00014282283,0.00035920282,0.00009790407,0.75926477,0.001820026,0.18112813,0.05505806,0.000088905625],"about_ca_topic_score_codex":0.0015243632,"about_ca_topic_score_gemma":0.0012095268,"teacher_disagreement_score":0.003963196,"about_ca_system_score_codex":0.00087843026,"about_ca_system_score_gemma":0.0012254233,"threshold_uncertainty_score":0.017457902},"labels":[],"label_agreement":null},{"id":"W3168081317","doi":"10.1007/978-3-030-78372-3_17","title":"Password Protected Secret Sharing from Lattices","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Password; Computer science; Secret sharing; Server; Computer security; Shared secret; Zero-knowledge password proof; One-time password; Encryption; Password policy; Computer network; Cryptography","score_opus":0.020924660005316956,"score_gpt":0.2418055103353354,"score_spread":0.22088085033001845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168081317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05148281,0.0014715483,0.8149683,0.0016570874,0.00052051945,0.0002553864,0.0006750672,0.0023466202,0.12662265],"genre_scores_gemma":[0.78966606,0.0013689443,0.13064022,0.0003926494,0.00039120216,0.0003109017,0.0007614997,0.00072128425,0.07574726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983878,0.00038693566,0.00007761389,0.0001629698,0.0007580502,0.00022671322],"domain_scores_gemma":[0.9976895,0.0009535706,0.0001213628,0.0009649844,0.00017089992,0.00009978634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118445,0.0007067422,0.0010302161,0.0008148024,0.0011872776,0.0026555664,0.0011632667,0.0010039356,0.014669546],"category_scores_gemma":[0.0039238073,0.00058013486,0.0007362303,0.0016218642,0.0020879493,0.004493004,0.004584628,0.0025010568,0.0046036798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002539131,0.00006618635,0.000105715684,0.00015854888,0.000017695193,0.00015480876,0.00021538127,0.014709427,0.005879945,0.891614,0.0094333505,0.077390976],"study_design_scores_gemma":[0.00004564337,0.00005783784,0.000053722746,0.0000486964,0.000008693528,0.00023333672,0.00004340658,0.04428912,0.006628429,0.93416494,0.014398331,0.00002789732],"about_ca_topic_score_codex":0.00027971133,"about_ca_topic_score_gemma":0.00029846624,"teacher_disagreement_score":0.014669546,"about_ca_system_score_codex":0.0011274226,"about_ca_system_score_gemma":0.0008856311,"threshold_uncertainty_score":0.04907447},"labels":[],"label_agreement":null},{"id":"W3168143505","doi":"10.1007/978-3-030-78292-4_17","title":"Investigating Students’ Reasoning in a Code-Tracing Tutor","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Carleton University","funders":"","keywords":"TUTOR; Tracing; Computer science; Protocol analysis; Coding (social sciences); Code (set theory); Think aloud protocol; Programming language; Human–computer interaction; Cognitive science; Psychology; Usability","score_opus":0.022055190392314922,"score_gpt":0.2847361647559424,"score_spread":0.2626809743636275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168143505","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.9934343,0.000047296042,0.002786163,0.00021923136,0.000027594668,0.000039261657,0.000040676157,0.00013758494,0.0032678524],"genre_scores_gemma":[0.9928203,0.000029634748,0.0022588952,0.00009056427,0.0000063683133,0.000016959737,0.00006857181,0.00003157546,0.004677135],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99870706,0.00052007404,0.00009002254,0.00029768542,0.00023155792,0.00015358675],"domain_scores_gemma":[0.98924166,0.0067489236,0.0007682675,0.00063871173,0.001503368,0.0010990488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017181974,0.0003749327,0.0004112588,0.0006133409,0.00086160394,0.002324393,0.0010209763,0.0020082816,0.006448224],"category_scores_gemma":[0.021088937,0.000254838,0.00024221018,0.00029454712,0.0007177428,0.0013215616,0.0014092046,0.0017282976,0.0014521346],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006013012,0.01729482,0.28118134,0.00067919027,0.00016695933,0.012825363,0.2565581,0.0071212417,0.15920863,0.00786134,0.0108116185,0.2402784],"study_design_scores_gemma":[0.0012392689,0.026849395,0.32913566,0.0005622255,0.0005662246,0.016733587,0.15939395,0.139312,0.23600094,0.022560775,0.067099765,0.0005462175],"about_ca_topic_score_codex":0.0013488535,"about_ca_topic_score_gemma":0.0014288641,"teacher_disagreement_score":0.006448224,"about_ca_system_score_codex":0.00077121897,"about_ca_system_score_gemma":0.0007382597,"threshold_uncertainty_score":0.021571517},"labels":[],"label_agreement":null},{"id":"W3168615033","doi":"10.1007/978-3-031-17587-9_7","title":"SPeCiaL: Self-supervised Pretraining for Continual Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"McGill University","funders":"","keywords":"Forgetting; Computer science; Artificial intelligence; Machine learning; Process (computing); Supervised learning; Unsupervised learning; Artificial neural network","score_opus":0.022553856770973903,"score_gpt":0.2512191963977332,"score_spread":0.2286653396267593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168615033","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.005845368,0.018974874,0.73822373,0.0024427404,0.028935706,0.0003366739,0.003823278,0.04315882,0.1582588],"genre_scores_gemma":[0.03658401,0.006885745,0.14971885,0.0014176889,0.009412837,0.0002867319,0.012358878,0.010167604,0.7731677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971575,0.000020546338,0.000015950161,0.00011737901,0.00009848004,0.000031908065],"domain_scores_gemma":[0.99918646,0.00022000146,0.000023516825,0.00018996952,0.000266133,0.00011398948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042467666,0.0014237841,0.0012519557,0.00085709704,0.00041024483,0.001212041,0.0015641713,0.0012128714,0.15344368],"category_scores_gemma":[0.0012614417,0.00053566793,0.000623298,0.001017932,0.00034421188,0.0025122066,0.00140229,0.0018711168,0.09885663],"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.000107872605,0.00011158901,0.00007836762,0.000366674,0.00002736999,0.00006789207,0.000025149764,0.0024073136,0.0076434254,0.0031734882,0.4390385,0.5469524],"study_design_scores_gemma":[0.000038367943,0.00024130297,0.0012519028,0.00020479059,0.00006428486,0.0010114977,0.00003753932,0.06898592,0.031895034,0.027709886,0.86848295,0.00007656837],"about_ca_topic_score_codex":0.000768264,"about_ca_topic_score_gemma":0.0017607975,"teacher_disagreement_score":0.15344368,"about_ca_system_score_codex":0.0004348696,"about_ca_system_score_gemma":0.00048374207,"threshold_uncertainty_score":0.5133202},"labels":[],"label_agreement":null},{"id":"W3168789248","doi":"10.1007/978-3-030-81097-9_4","title":"Formalization of RBD-Based Cause Consequence Analysis in HOL","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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":"Concordia University","funders":"","keywords":"HOL; Computer science; Programming language; Theoretical computer science","score_opus":0.012936381376869267,"score_gpt":0.2280740803853471,"score_spread":0.21513769900847785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168789248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046327827,0.00016779313,0.9851003,0.0003147763,0.00008311846,0.00014453393,0.00031748816,0.0015582766,0.0076808664],"genre_scores_gemma":[0.31658146,0.00042600188,0.6701156,0.00054695184,0.00018208574,0.00038946146,0.0011926902,0.00072484365,0.009840896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640745,0.00090453937,0.00041755513,0.0006184409,0.0012178253,0.00043422237],"domain_scores_gemma":[0.99505025,0.0027296853,0.00023514825,0.0010324287,0.00083899644,0.00011352032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040155994,0.00071708637,0.00083170773,0.0023150216,0.0010358868,0.0038979982,0.0025352766,0.0009876475,0.010558746],"category_scores_gemma":[0.0071343393,0.0008719039,0.0034059775,0.0012268499,0.0031454754,0.0038241385,0.0043818434,0.0029766837,0.0018099492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013850357,0.00012442014,0.0013028622,0.00050502346,0.0001271778,0.0005781686,0.00073329627,0.056189943,0.0047738007,0.856777,0.0037636345,0.07498618],"study_design_scores_gemma":[0.000067780566,0.000060631402,0.00050754624,0.00020544895,0.00020063517,0.00028846122,0.00019458342,0.26919287,0.008227372,0.69751865,0.023476413,0.000059661634],"about_ca_topic_score_codex":0.004471605,"about_ca_topic_score_gemma":0.006553093,"teacher_disagreement_score":0.010558746,"about_ca_system_score_codex":0.0017902964,"about_ca_system_score_gemma":0.0022158173,"threshold_uncertainty_score":0.035322547},"labels":[],"label_agreement":null},{"id":"W3169024472","doi":"10.1007/978-3-030-85947-3_25","title":"Two Birds with One Stone: Fairness and Welfare via Transfers","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Economics; Welfare; Microeconomics; Social Welfare; Transfer payment; Mathematical economics; Homogeneous; Payment; Social welfare function; Nash equilibrium; Monotone polygon; Transfer (computing); Constant (computer programming); Mathematics; Computer science; Law; Combinatorics","score_opus":0.020941773936946368,"score_gpt":0.22643459647822117,"score_spread":0.2054928225412748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169024472","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.5624527,0.000560701,0.31646645,0.0072061587,0.00023962538,0.000117858755,0.00013503066,0.00010171092,0.11271985],"genre_scores_gemma":[0.97515327,0.0000935839,0.012526122,0.00023287954,0.00005797339,0.00006050799,0.000018148017,0.000028675544,0.011828698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972276,0.0016214711,0.000073410556,0.0004109897,0.00029426822,0.00037218755],"domain_scores_gemma":[0.9912907,0.006106989,0.0006716247,0.0010364286,0.00030351747,0.0005908961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003908319,0.00043226665,0.001154638,0.0005505895,0.0020154056,0.003497296,0.0011146681,0.0033987823,0.009131115],"category_scores_gemma":[0.015694644,0.00042522702,0.0006124291,0.0006241255,0.0042907293,0.004501114,0.0024526103,0.0022681474,0.0005491412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003212917,0.000073882715,0.00179729,0.000053976426,0.000059591446,0.000210564,0.00065834,0.012566939,0.0010680684,0.9636869,0.0017305359,0.017772695],"study_design_scores_gemma":[0.00003553365,0.000036801834,0.00050595554,0.000009055633,0.000020161453,0.000087263965,0.00021045654,0.019888088,0.00020479057,0.9778324,0.0011577745,0.000011658976],"about_ca_topic_score_codex":0.0011395753,"about_ca_topic_score_gemma":0.0010490278,"teacher_disagreement_score":0.009131115,"about_ca_system_score_codex":0.0009585853,"about_ca_system_score_gemma":0.0008004893,"threshold_uncertainty_score":0.030546606},"labels":[],"label_agreement":null},{"id":"W3169054238","doi":"10.1007/978-3-030-77977-1_17","title":"Addressing Missing Data in a Healthcare Dataset Using an Improved kNN Algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","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":"Cape Breton University","funders":"","keywords":"Computer science; Missing data; Health care; Data mining; Algorithm; Machine learning; Political science","score_opus":0.396577230241086,"score_gpt":0.5102513893714219,"score_spread":0.1136741591303359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169054238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034119554,0.0015503528,0.95727825,0.000623351,0.00046255704,0.00014788978,0.0024695531,0.0021139341,0.0012346171],"genre_scores_gemma":[0.20695218,0.0006172618,0.777242,0.00036972895,0.00035332647,0.00016391218,0.009785622,0.00020578926,0.004310255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974337,0.00044376883,0.00027980865,0.0009316323,0.0006474526,0.00026369098],"domain_scores_gemma":[0.9946702,0.0026721838,0.00027568897,0.0008496091,0.0014096171,0.00012275475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042333137,0.000989914,0.0019622534,0.0024170326,0.0010966031,0.0018039235,0.002465994,0.0024989862,0.0022251871],"category_scores_gemma":[0.01037123,0.00057915004,0.001755241,0.0037618736,0.0004975271,0.0024524552,0.0016817077,0.0024653913,0.0015926008],"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.0005325016,0.00045903985,0.009459688,0.0003725256,0.00030301572,0.0003600457,0.00016173365,0.25109905,0.0048928075,0.0035227723,0.016705234,0.7121316],"study_design_scores_gemma":[0.000016616325,0.00004528465,0.0012596765,0.000027799097,0.00005106029,0.00013766807,0.00006423449,0.9892966,0.0013551519,0.004917094,0.0028096572,0.000019122463],"about_ca_topic_score_codex":0.018300021,"about_ca_topic_score_gemma":0.01734699,"teacher_disagreement_score":0.018300021,"about_ca_system_score_codex":0.00078733877,"about_ca_system_score_gemma":0.002257425,"threshold_uncertainty_score":0.036387026},"labels":[],"label_agreement":null},{"id":"W3170003207","doi":"10.1007/978-3-030-78230-6_16","title":"On the Usefulness of Linear Modular Arithmetic in Constraint Programming","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Modular design; Hash function; Theoretical computer science; Checksum; Linear programming; Mathematical optimization; Algorithm; Programming language; Mathematics","score_opus":0.02747435905450191,"score_gpt":0.2477633709259295,"score_spread":0.2202890118714276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170003207","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.020187324,0.013213184,0.70054007,0.008088967,0.0009954055,0.00006856001,0.00022401997,0.0006032712,0.25607914],"genre_scores_gemma":[0.454798,0.014226978,0.48285654,0.0030707156,0.004419428,0.00022777397,0.00038710292,0.0007393867,0.03927407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983987,0.00074448076,0.00008410077,0.00021099726,0.0004302185,0.00013138102],"domain_scores_gemma":[0.9855032,0.012923918,0.00025422842,0.00081355346,0.00038651878,0.00011861502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034192365,0.0012721355,0.0008887898,0.0016295803,0.0012835187,0.0029885776,0.0020048278,0.0010224369,0.010710968],"category_scores_gemma":[0.014862763,0.0009920874,0.0011915609,0.004188528,0.007824753,0.010168338,0.0029450285,0.0055033835,0.0017398049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032068885,0.000017535069,0.000085461914,0.000098208584,0.000008821459,0.000038512,0.00011420755,0.004846906,0.0002474371,0.95581293,0.0045843106,0.034113523],"study_design_scores_gemma":[0.000012013123,0.000012647057,0.00005840761,0.00004665796,0.000009930028,0.000030666783,0.000018906956,0.012728788,0.00021784416,0.9807123,0.0061410805,0.000010720262],"about_ca_topic_score_codex":0.0019869609,"about_ca_topic_score_gemma":0.0019483921,"teacher_disagreement_score":0.010710968,"about_ca_system_score_codex":0.0018818814,"about_ca_system_score_gemma":0.0007954134,"threshold_uncertainty_score":0.03583169},"labels":[],"label_agreement":null},{"id":"W3170458595","doi":"10.1007/978-3-030-77980-1_50","title":"How Do Teams of Novice Modelers Choose an Approach? An Iterated, Repeated Experiment in a First-Year Modeling Course","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Decision Making","field":"Decision Sciences","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":"Thompson Rivers University","funders":"","keywords":"Computer science; Iterated function; Course (navigation); Artificial intelligence; Software engineering; Operations research; Industrial engineering; Mathematics education; Mathematics; Engineering","score_opus":0.09832824163809353,"score_gpt":0.34704931700602837,"score_spread":0.24872107536793484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170458595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972836,0.000028802622,0.0011381152,0.00014801293,0.00002962885,0.00016122076,0.000026107227,0.000025241954,0.0011592335],"genre_scores_gemma":[0.98732144,0.000084226136,0.007707811,0.00031299508,0.000032186203,0.0007935634,0.00017718053,0.000043357268,0.0035273386],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99122095,0.005171801,0.0004833103,0.0012652102,0.001239504,0.0006192112],"domain_scores_gemma":[0.91502863,0.06582027,0.0060223853,0.006161558,0.0025499365,0.004417149],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.013883265,0.00084079884,0.0012819415,0.00039518488,0.0014999527,0.0040060556,0.002881129,0.0037094604,0.0024613629],"category_scores_gemma":[0.081656724,0.0008962631,0.00081617525,0.0003477086,0.0013263526,0.003566689,0.0018830881,0.0037182732,0.0010616366],"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.08358983,0.21857956,0.19785087,0.0013157415,0.0024066984,0.0010382887,0.07998145,0.03673786,0.077448584,0.010023413,0.011144493,0.2798832],"study_design_scores_gemma":[0.018047817,0.25494424,0.32245642,0.0007764583,0.0018378355,0.0008480145,0.05842987,0.230912,0.053135417,0.036426794,0.020495148,0.0016899573],"about_ca_topic_score_codex":0.0019290103,"about_ca_topic_score_gemma":0.0024503912,"teacher_disagreement_score":0.9861167,"about_ca_system_score_codex":0.0010115659,"about_ca_system_score_gemma":0.0015412273,"threshold_uncertainty_score":0.07342261},"labels":[],"label_agreement":null},{"id":"W3170671676","doi":"10.1007/978-3-031-15714-1_14","title":"An Improved Bound for the Tree Conjecture in Network Creation Games","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Vertex (graph theory); Nash equilibrium; Combinatorics; Game tree; Computer science; Alpha (finance); Tree (set theory); Spanning tree; Mathematics; Discrete mathematics; Game theory; Mathematical economics; Sequential game; Graph; Statistics","score_opus":0.04664564556279533,"score_gpt":0.3433433622714432,"score_spread":0.29669771670864786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170671676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067354955,0.006673919,0.5386084,0.029158419,0.003628526,0.00050029886,0.003388368,0.0022365106,0.3484507],"genre_scores_gemma":[0.674052,0.0076842275,0.19682509,0.010951507,0.0072523477,0.0019818968,0.0048712716,0.0027652984,0.09361627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916536,0.002377,0.0002598713,0.0017162748,0.0022093854,0.0017838156],"domain_scores_gemma":[0.93273145,0.05427473,0.0013502815,0.0056455815,0.0031723494,0.0028255675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071920236,0.0036806853,0.006115033,0.0042858226,0.0048593795,0.010684142,0.011353367,0.008372884,0.055576876],"category_scores_gemma":[0.0527676,0.0020666164,0.005035872,0.0070383926,0.008474098,0.028494084,0.010339892,0.020377671,0.010359129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007226102,0.0004065222,0.0008606591,0.00070628175,0.00011923497,0.0001860493,0.0005000492,0.031096958,0.0018320323,0.8657133,0.06110827,0.036747996],"study_design_scores_gemma":[0.00008919152,0.000049802024,0.00028572197,0.0001172454,0.000084970816,0.00009111153,0.000068645895,0.06874297,0.00047356362,0.9230703,0.006882511,0.000043979315],"about_ca_topic_score_codex":0.004496817,"about_ca_topic_score_gemma":0.0056324517,"teacher_disagreement_score":0.055576876,"about_ca_system_score_codex":0.007969071,"about_ca_system_score_gemma":0.0043515717,"threshold_uncertainty_score":0.18592316},"labels":[],"label_agreement":null},{"id":"W3172480584","doi":"","title":"Tight bounds on the relative performances of pricing mechanisms in storable good markets","year":2018,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monopoly; Economics; Microeconomics; Profitability index; Profit (economics); Valuation (finance); Finance","score_opus":0.03842223953332585,"score_gpt":0.3253753769700697,"score_spread":0.28695313743674383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172480584","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.4788022,0.011457805,0.4642494,0.004340477,0.00041901672,0.0004037715,0.0006781907,0.0024603177,0.037188884],"genre_scores_gemma":[0.9472945,0.003075806,0.045718472,0.00037021632,0.00033941583,0.0002717303,0.00028505977,0.0003628207,0.0022819126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9838966,0.0065965285,0.0009729202,0.0016436648,0.0030970692,0.0037932661],"domain_scores_gemma":[0.83111787,0.13072123,0.013985958,0.01690587,0.0032065385,0.0040625217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025544468,0.0029869669,0.0044971392,0.0027472512,0.0025103563,0.009864441,0.006291616,0.005402089,0.009209048],"category_scores_gemma":[0.10797071,0.0020556122,0.0023185164,0.003140187,0.0057448377,0.021525882,0.006402359,0.0062498325,0.0016415126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064886142,0.0011291673,0.0031307095,0.00090718595,0.00044277692,0.00031372745,0.00049000076,0.5573116,0.013819202,0.30702883,0.004862812,0.10407541],"study_design_scores_gemma":[0.00042499197,0.0013343442,0.0011400952,0.00022348201,0.00021229534,0.00045117104,0.00019284875,0.6753483,0.008832721,0.30928114,0.002406795,0.00015188234],"about_ca_topic_score_codex":0.0006543501,"about_ca_topic_score_gemma":0.0004187458,"teacher_disagreement_score":0.025544468,"about_ca_system_score_codex":0.0039022702,"about_ca_system_score_gemma":0.0032150657,"threshold_uncertainty_score":0.13509363},"labels":[],"label_agreement":null},{"id":"W3173291058","doi":"10.1007/978-3-030-79382-1_31","title":"Cut to the Trace! Process-Aware Partitioning of Long-Running Cases in Customer Journey Logs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Process mining; TRACE (psycholinguistics); Process (computing); Partition (number theory); Business process discovery; Probabilistic logic; Abstraction; Analytics; Context (archaeology); Data mining; Artificial intelligence; Work in process; Data science; Machine learning; Business process; Business process management; Business process modeling; Programming language","score_opus":0.033028176154759066,"score_gpt":0.26850832152766585,"score_spread":0.2354801453729068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173291058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1121799,0.001114681,0.85303205,0.001436904,0.0003463673,0.000390558,0.0031770996,0.019561129,0.008761388],"genre_scores_gemma":[0.43270627,0.0005433727,0.5440186,0.00027592125,0.00012951212,0.00021042934,0.0085903,0.0022725307,0.011253029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.000107752385,0.000039410705,0.00019391083,0.00021811297,0.000097728094],"domain_scores_gemma":[0.9978005,0.0008066286,0.00016976328,0.0005417023,0.0004929392,0.00018847796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610172,0.00084558903,0.00072087074,0.0016480443,0.00084432535,0.0024350374,0.0014342511,0.0007141815,0.0058436356],"category_scores_gemma":[0.004146789,0.00066328346,0.0009066879,0.0015094026,0.0006155927,0.002292001,0.001850587,0.0011156129,0.002407858],"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.0007805733,0.00043667882,0.013114679,0.00040993007,0.00013233064,0.0007447927,0.0013255863,0.038476486,0.03730852,0.014665943,0.036387973,0.8562165],"study_design_scores_gemma":[0.00006575485,0.00033122255,0.018418051,0.00021882317,0.0001355788,0.00073388923,0.0021600483,0.8362142,0.030321538,0.058375895,0.052928284,0.00009673185],"about_ca_topic_score_codex":0.0065882583,"about_ca_topic_score_gemma":0.011667336,"teacher_disagreement_score":0.0065882583,"about_ca_system_score_codex":0.0005674928,"about_ca_system_score_gemma":0.0010062865,"threshold_uncertainty_score":0.019548893},"labels":[],"label_agreement":null},{"id":"W3174452707","doi":"10.1007/978-3-030-85610-6_4","title":"HyperBrush: Exploring the Influence of Flexural Stiffness on the Performance and Preference for Bendable Stylus Interfaces","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Stylus; Modular design; Stiffness; Computer science; Human–computer interaction; Engineering; Structural engineering; Computer vision","score_opus":0.049925755767793276,"score_gpt":0.2522745179123119,"score_spread":0.20234876214451863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174452707","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.9850122,0.0003859044,0.010289892,0.000034208148,0.000012627695,0.000026634398,0.0002240683,0.00018886842,0.0038256072],"genre_scores_gemma":[0.9880851,0.00022221482,0.0061591566,0.000021673488,0.0000067073565,0.00003521311,0.00023219675,0.00016717282,0.005070558],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99979645,0.000052865842,0.0000068006625,0.00003673614,0.00008148496,0.000025672312],"domain_scores_gemma":[0.998283,0.0014457806,0.00009208187,0.00005989968,0.00007606117,0.00004312602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003392625,0.00039024843,0.0003500965,0.00016878806,0.00020534085,0.0009391861,0.0005199453,0.0003396601,0.009969841],"category_scores_gemma":[0.0032733355,0.00019958674,0.00018553808,0.00025719052,0.0002693944,0.00093346805,0.00055514066,0.00030972663,0.00095204345],"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.0028868155,0.00021523473,0.0043237302,0.00063706905,0.000033565782,0.00023438809,0.0012184684,0.0031971615,0.8665483,0.0010380822,0.0009906951,0.11867636],"study_design_scores_gemma":[0.00038131292,0.010802763,0.26482224,0.00018104565,0.00040299143,0.0021781314,0.004284594,0.14282985,0.5576086,0.006452873,0.009734766,0.0003208142],"about_ca_topic_score_codex":0.0009591692,"about_ca_topic_score_gemma":0.0014466351,"teacher_disagreement_score":0.009969841,"about_ca_system_score_codex":0.00012495421,"about_ca_system_score_gemma":0.00016899918,"threshold_uncertainty_score":0.033352435},"labels":[],"label_agreement":null},{"id":"W3174556860","doi":"10.1007/978-3-030-78191-0_8","title":"Blind Stain Separation Using Model-Aware Generative Learning and Its Applications on Fluorescence Microscopy Images","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","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","funders":"","keywords":"Computer science; Artificial intelligence; Confusion; Generative grammar; Stain; Machine learning; Process (computing); Set (abstract data type); Generator (circuit theory); Pattern recognition (psychology); Image (mathematics); Generative model; Computer vision; Pathology","score_opus":0.015509039552809948,"score_gpt":0.32012895697805027,"score_spread":0.3046199174252403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174556860","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.005598663,0.0001389557,0.9931798,0.000050954775,0.000012191556,0.00001164804,0.00002641548,0.00058591284,0.0003955293],"genre_scores_gemma":[0.20662482,0.0005108659,0.7865091,0.0001336944,0.00005783921,0.000059545666,0.00038080307,0.00055085553,0.0051724277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996402,0.000089268186,0.000016656217,0.000097050724,0.000116135234,0.000040596828],"domain_scores_gemma":[0.9987061,0.0007527525,0.00008137623,0.00020705136,0.00019708878,0.000055584656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009295665,0.0007637736,0.0010076243,0.00086964417,0.0004239795,0.0012164707,0.0014488961,0.0013211513,0.0016363724],"category_scores_gemma":[0.002246594,0.0005641913,0.0015749069,0.0010688565,0.00087019906,0.0011338779,0.0016050969,0.0013479309,0.00076250784],"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.00023174794,0.00013842194,0.00072785397,0.00014791114,0.00011059876,0.0001522107,0.00015985993,0.42579854,0.044550378,0.016787726,0.0028072458,0.5083875],"study_design_scores_gemma":[0.0000018897268,0.0000073734823,0.000070415415,0.0000020465952,0.000005868984,0.00003208104,0.000004411086,0.9927602,0.0035480855,0.0033359956,0.00022619011,0.0000053861345],"about_ca_topic_score_codex":0.0042464132,"about_ca_topic_score_gemma":0.0043296968,"teacher_disagreement_score":0.0042464132,"about_ca_system_score_codex":0.00079847046,"about_ca_system_score_gemma":0.0007422323,"threshold_uncertainty_score":0.008443415},"labels":[],"label_agreement":null},{"id":"W3174688402","doi":"10.1007/978-3-030-79987-8_23","title":"Complexity and Algorithms for MUL-Tree Pruning","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Université de Montréal","funders":"","keywords":"Pruning; Tree (set theory); Parameterized complexity; Set (abstract data type); Heuristic; Computer science; Algorithm; Search tree; Tree rearrangement; Weight-balanced tree; K-ary tree; Combinatorics; Mathematics; Binary tree; Phylogenetic tree; Artificial intelligence; Tree structure; Binary search tree; Biology; Gene; Search algorithm; Botany","score_opus":0.04652306749869173,"score_gpt":0.28116399451586715,"score_spread":0.23464092701717543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174688402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01676988,0.0051727784,0.9115703,0.0032116538,0.0006030106,0.0002487828,0.001398871,0.0019450482,0.059079748],"genre_scores_gemma":[0.14604957,0.004964078,0.80032057,0.0009993396,0.0015607999,0.00079366483,0.0035063804,0.0017845544,0.04002106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518824,0.00093347306,0.00034204763,0.00069206115,0.0023546915,0.0004894555],"domain_scores_gemma":[0.9800181,0.014520542,0.00052308134,0.003247863,0.0013880257,0.00030246208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026690022,0.0019457085,0.002659206,0.0031813886,0.0021243042,0.0077925944,0.005746466,0.0031241789,0.022302244],"category_scores_gemma":[0.02190671,0.0015235143,0.0031021587,0.0070114136,0.0031654225,0.017384443,0.004627776,0.008138208,0.005157188],"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.00038737193,0.00020640121,0.0007657667,0.00072470744,0.00008728716,0.00012877933,0.0002868955,0.06493353,0.0027874438,0.6078733,0.043954663,0.27786383],"study_design_scores_gemma":[0.000043340828,0.000029329844,0.00025069815,0.000070692775,0.000052988467,0.00020676575,0.00005492375,0.17817016,0.0015002365,0.809786,0.009806701,0.000028115726],"about_ca_topic_score_codex":0.0025812185,"about_ca_topic_score_gemma":0.0033338447,"teacher_disagreement_score":0.022302244,"about_ca_system_score_codex":0.004291043,"about_ca_system_score_gemma":0.0023835746,"threshold_uncertainty_score":0.074608445},"labels":[],"label_agreement":null},{"id":"W3174717610","doi":"10.1007/978-3-030-80599-9_28","title":"Using Document Embeddings for Background Linking of News Articles","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Embedding; Pooling; Information retrieval; Variety (cybernetics); Security token; Natural language processing; Artificial intelligence","score_opus":0.06072423983579282,"score_gpt":0.3040035160247984,"score_spread":0.24327927618900558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174717610","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.12573273,0.0101844845,0.7878379,0.0013890933,0.0040656356,0.00047945938,0.013045381,0.03602471,0.021240622],"genre_scores_gemma":[0.45826846,0.0048024217,0.4464044,0.0004246914,0.0027358492,0.0003726273,0.05390292,0.003520703,0.029567838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988802,0.00026222784,0.00009667877,0.00043865343,0.00019224413,0.000130001],"domain_scores_gemma":[0.9963003,0.0018993897,0.0002672757,0.00054961524,0.00075716485,0.00022641705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015533632,0.0022587948,0.0010716307,0.006961254,0.00088596996,0.002929856,0.0010714357,0.001728956,0.007684884],"category_scores_gemma":[0.006627091,0.0006969051,0.0012546752,0.0048799333,0.00028225087,0.0050696842,0.0020715138,0.0020614474,0.009282964],"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.0009823543,0.0006412656,0.004914255,0.0005483353,0.00026320136,0.00031035184,0.0003602342,0.010614953,0.014907,0.0039843065,0.055327356,0.90714633],"study_design_scores_gemma":[0.00016773898,0.0004401254,0.0075818095,0.00029551936,0.0006783026,0.0006499334,0.00070572615,0.8815923,0.029094804,0.025887858,0.052783094,0.00012280593],"about_ca_topic_score_codex":0.0030420842,"about_ca_topic_score_gemma":0.004965898,"teacher_disagreement_score":0.007684884,"about_ca_system_score_codex":0.0005967126,"about_ca_system_score_gemma":0.0007412162,"threshold_uncertainty_score":0.025708497},"labels":[],"label_agreement":null},{"id":"W3174826346","doi":"10.1007/978-3-030-81293-5_9","title":"The “Quantum Annoying” Property of Password-Authenticated Key Exchange Protocols","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Password; Random oracle; Discrete logarithm; Theoretical computer science; Quantum computer; Oracle; Computer security; Quantum; Adversary; Protocol (science); Encryption; Public-key cryptography; Quantum mechanics; Physics","score_opus":0.030300945464490782,"score_gpt":0.2673557013913502,"score_spread":0.2370547559268594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174826346","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.066300385,0.0026914375,0.76016706,0.006893202,0.0014735567,0.00017310998,0.00022364121,0.0010120461,0.1610655],"genre_scores_gemma":[0.9009388,0.002117202,0.05322813,0.001286985,0.0011097986,0.00025835904,0.0001630644,0.0003265787,0.040571056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655116,0.0011411983,0.00022398203,0.0005306609,0.0011525049,0.0004006315],"domain_scores_gemma":[0.9917282,0.004105155,0.0004951004,0.0028236173,0.00059924554,0.00024867494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002467524,0.00066259137,0.0008561172,0.0005911294,0.0020186382,0.0041389554,0.0013910221,0.0022656766,0.0062820865],"category_scores_gemma":[0.010985089,0.000678929,0.0006357657,0.0012624544,0.0071305144,0.011036307,0.0032600223,0.0060693473,0.0019695847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012961178,0.000020108515,0.00009418,0.00007213315,0.000009296039,0.00007960644,0.00027528193,0.0012987405,0.0026414404,0.9772843,0.003054386,0.015040933],"study_design_scores_gemma":[0.000025754074,0.00004866781,0.00010501886,0.000028103175,0.000018339288,0.00024708174,0.00006363189,0.011906224,0.005021547,0.9660511,0.016459586,0.000024857725],"about_ca_topic_score_codex":0.00025395997,"about_ca_topic_score_gemma":0.00016124971,"teacher_disagreement_score":0.0062820865,"about_ca_system_score_codex":0.0008802011,"about_ca_system_score_gemma":0.0012347226,"threshold_uncertainty_score":0.021015704},"labels":[],"label_agreement":null},{"id":"W3175390890","doi":"10.1007/978-3-030-78191-0_36","title":"EnMcGAN: Adversarial Ensemble Learning for 3D Complete Renal Structures Segmentation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","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":"Western University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Pattern recognition (psychology); Inference; Computer vision","score_opus":0.01425883061066173,"score_gpt":0.238649604516317,"score_spread":0.22439077390565526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175390890","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.003715383,0.0005406551,0.98921156,0.0001675795,0.0001047702,0.000053268865,0.00035279006,0.0038420067,0.0020119697],"genre_scores_gemma":[0.14160454,0.0009348646,0.8323031,0.0006970449,0.00018871858,0.00031569725,0.003866755,0.0017893607,0.018299956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995183,0.00010431255,0.000017332848,0.00013976039,0.00015903795,0.000061324296],"domain_scores_gemma":[0.9995171,0.00021995108,0.000024543177,0.00010856319,0.00010115053,0.000028733368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010842693,0.0014668145,0.0013442328,0.00071129476,0.00037846286,0.0009832536,0.0024302502,0.0022557965,0.0055272933],"category_scores_gemma":[0.0017402935,0.000978861,0.0012897637,0.000758943,0.00052957336,0.0010303063,0.0024333042,0.002595333,0.0027583777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001385073,0.00006301207,0.00038129938,0.000115374976,0.00016500938,0.000098124816,0.000047884372,0.5495912,0.0064772638,0.006749541,0.02344988,0.41272292],"study_design_scores_gemma":[0.000002900777,0.000011654578,0.00006831907,0.000008717428,0.0000071060877,0.00003623004,0.000003118824,0.9949909,0.0013756962,0.002055906,0.0014341462,0.0000052602686],"about_ca_topic_score_codex":0.007402807,"about_ca_topic_score_gemma":0.013611376,"teacher_disagreement_score":0.007402807,"about_ca_system_score_codex":0.00069961185,"about_ca_system_score_gemma":0.0008832273,"threshold_uncertainty_score":0.018490613},"labels":[],"label_agreement":null},{"id":"W3175401212","doi":"10.1007/978-3-030-79942-7_4","title":"The Explicated Addressee: A (Mainly) Pragmatic Account of Japanese ka-Questions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language, Discourse, Communication Strategies","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Honorific; Utterance; Linguistics; Politeness; Computer science; Morpheme; Philosophy","score_opus":0.03531567682358685,"score_gpt":0.2831756656501491,"score_spread":0.24785998882656227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175401212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13106406,0.004762244,0.23636149,0.010481728,0.00082075526,0.00018983343,0.00076880417,0.0007565465,0.6147945],"genre_scores_gemma":[0.9527355,0.0006389001,0.014123316,0.00055605534,0.00028477595,0.000114048584,0.0003583221,0.00026866482,0.030920602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987331,0.00064886356,0.00008028665,0.00022335094,0.00016352256,0.00015097541],"domain_scores_gemma":[0.9988286,0.0005947691,0.000083872364,0.00017353485,0.0002496891,0.00006956354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862369,0.0008413105,0.00049299677,0.0013918463,0.0036055006,0.005603794,0.0016893084,0.0035449702,0.011204795],"category_scores_gemma":[0.0031366288,0.00077933527,0.00079972536,0.0016482625,0.006343395,0.013908943,0.0028225174,0.0029601988,0.0015882055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055625173,0.000014915007,0.0004174292,0.00018269883,0.0000101556625,0.00030816864,0.021872738,0.00027022985,0.0019314665,0.96530485,0.0028755174,0.0067562168],"study_design_scores_gemma":[0.00006529399,0.00010960998,0.0047241226,0.0002527415,0.00016390976,0.001485872,0.021452883,0.012853726,0.003126816,0.78953713,0.16611248,0.00011536705],"about_ca_topic_score_codex":0.0056227418,"about_ca_topic_score_gemma":0.0051457174,"teacher_disagreement_score":0.011204795,"about_ca_system_score_codex":0.001723915,"about_ca_system_score_gemma":0.001182215,"threshold_uncertainty_score":0.03748381},"labels":[],"label_agreement":null},{"id":"W3175565214","doi":"10.1007/978-3-030-78710-3_52","title":"Sensitivity Analysis of a Smooth Muscle Cell Electrophysiological Model","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","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":"Lawson Health Research Institute; Western University","funders":"","keywords":"Computer science; Sensitivity (control systems); Mathematical model; Biological system; Linear model; Model validation; Artificial intelligence; Machine learning; Mathematics; Electronic engineering; Biology","score_opus":0.009418319421258672,"score_gpt":0.22026502029636724,"score_spread":0.21084670087510857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175565214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11758689,0.0006127001,0.8660063,0.0004653932,0.000054429725,0.00008811164,0.00028207665,0.00067421765,0.014229942],"genre_scores_gemma":[0.97512925,0.0002772284,0.019907389,0.00008504618,0.000026782544,0.00007495735,0.00014063274,0.000091255075,0.004267571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999603,0.00017961631,0.000012701956,0.00006609788,0.00009762244,0.000041000305],"domain_scores_gemma":[0.9984869,0.0012688397,0.000059670827,0.00005629728,0.000100904326,0.000027356107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006391969,0.00084230804,0.0006762452,0.0005312534,0.0002988475,0.00068499864,0.0006159795,0.0008389621,0.0021459768],"category_scores_gemma":[0.0030059859,0.0003232312,0.0010260195,0.00027035593,0.000433066,0.0004246139,0.00085066905,0.0008581382,0.00020080993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067537025,0.00004348023,0.00034099963,0.0000969076,0.0000734353,0.00017879231,0.000061146675,0.95658034,0.018849676,0.0135171795,0.0005197509,0.009670719],"study_design_scores_gemma":[0.0000015636505,0.000015335218,0.00012425715,0.0000030625538,0.000011349375,0.00001786349,0.0000032552684,0.9964786,0.0007265561,0.002513967,0.00009894897,0.000005224525],"about_ca_topic_score_codex":0.0047618886,"about_ca_topic_score_gemma":0.002232474,"teacher_disagreement_score":0.0047618886,"about_ca_system_score_codex":0.0008912783,"about_ca_system_score_gemma":0.00042067305,"threshold_uncertainty_score":0.009468317},"labels":[],"label_agreement":null},{"id":"W3176232965","doi":"10.1007/978-3-030-79121-6_7","title":"Degrees of Restriction for Two-Dimensional Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Automaton; Computer science; Closure (psychology); Mobile automaton; Deterministic automaton; Automata theory; Nested word; ω-automaton; Quantum finite automata; Deterministic finite automaton; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01989656258438412,"score_gpt":0.25560705739146267,"score_spread":0.23571049480707854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176232965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2377696,0.0020768302,0.40235788,0.0022221769,0.0007642206,0.00016932191,0.0009985527,0.0010851747,0.35255635],"genre_scores_gemma":[0.9161724,0.0009614716,0.039978795,0.0003548471,0.00040446705,0.00032201686,0.000646045,0.0002463967,0.040913645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987851,0.00031483703,0.00010886414,0.00023872158,0.00032824624,0.00022426608],"domain_scores_gemma":[0.99700016,0.0018683494,0.00014444528,0.00043138122,0.00022599041,0.00032971503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825919,0.00070047274,0.0008647199,0.0016910704,0.0017973345,0.004673027,0.0011902092,0.00083538354,0.008946254],"category_scores_gemma":[0.0031639284,0.0007366426,0.0010771223,0.0015572055,0.004355226,0.0072908783,0.003409161,0.004124901,0.0014558391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041763862,0.000015506143,0.00006860853,0.00003022323,0.0000033261774,0.000023957158,0.0002627542,0.0004835982,0.00071666733,0.9918526,0.0006185734,0.005882329],"study_design_scores_gemma":[0.000018898698,0.000014938143,0.00012250392,0.000012197111,0.0000054773323,0.00007302483,0.00008887133,0.0019038387,0.0007204537,0.992105,0.0049186717,0.000016250342],"about_ca_topic_score_codex":0.0005695248,"about_ca_topic_score_gemma":0.0005139722,"teacher_disagreement_score":0.008946254,"about_ca_system_score_codex":0.0012448907,"about_ca_system_score_gemma":0.0005373384,"threshold_uncertainty_score":0.029928148},"labels":[],"label_agreement":null},{"id":"W3176798136","doi":"10.1007/978-3-030-79942-7_16","title":"The Application of Text Entailment Techniques in COLIEE 2020","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Textual entailment; Computer science; Logical consequence; Natural language processing; Fragment (logic); Statute; Artificial intelligence; Context (archaeology); Information retrieval; Programming language; Law; Political science","score_opus":0.008027562739232033,"score_gpt":0.2624456943354297,"score_spread":0.25441813159619764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176798136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010824029,0.001259187,0.9392362,0.0017955097,0.00043690176,0.00037753262,0.0017994215,0.0062738126,0.03799735],"genre_scores_gemma":[0.08316032,0.0008320399,0.87287945,0.0005052611,0.00034140804,0.0002357426,0.005494992,0.0023325835,0.03421828],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99592906,0.0015801118,0.00028484126,0.0006413869,0.0013861728,0.00017833021],"domain_scores_gemma":[0.992539,0.0042714505,0.00021681272,0.0012337894,0.0015850269,0.00015401855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004175087,0.00079347385,0.0007114795,0.003481566,0.0019675405,0.00407674,0.0022362,0.0013493302,0.024607655],"category_scores_gemma":[0.017395834,0.00085659785,0.0014217326,0.0032274874,0.0012913051,0.006935596,0.0036230553,0.0025614968,0.007841841],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020591677,0.00020613169,0.00063413946,0.0005282566,0.00006478266,0.00029285284,0.0008217848,0.0049795425,0.00904285,0.16184504,0.03718901,0.7841897],"study_design_scores_gemma":[0.00007346949,0.00014711896,0.0015479653,0.0003000634,0.00015363538,0.0009635516,0.0006253155,0.22447217,0.0798593,0.33272806,0.35899353,0.00013585987],"about_ca_topic_score_codex":0.009477661,"about_ca_topic_score_gemma":0.016467936,"teacher_disagreement_score":0.024607655,"about_ca_system_score_codex":0.0018760489,"about_ca_system_score_gemma":0.0028742196,"threshold_uncertainty_score":0.08232081},"labels":[],"label_agreement":null},{"id":"W3176973838","doi":"10.1007/978-3-030-79460-6_18","title":"A Systematic Review of Persuasive Strategies in Mobile E-Commerce Applications and Their Implementations","year":2021,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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":"Dalhousie University","funders":"","keywords":"Computer science; Implementation; Personalization; Persuasive technology; Popularity; E-commerce; Domain (mathematical analysis); World Wide Web; Human–computer interaction; Persuasion; Software engineering","score_opus":0.029949068063471026,"score_gpt":0.38092300171418203,"score_spread":0.350973933650711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176973838","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001515704,0.99671704,0.00033028124,0.0002979753,0.00011829557,0.0005203591,0.00017741814,0.000010019064,0.0003129731],"genre_scores_gemma":[0.020019585,0.9752577,0.0027829173,0.0006481463,0.00007638162,0.00087847165,0.00016609192,0.0000107914875,0.00015988464],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.97996324,0.008602627,0.0069051273,0.0010007689,0.0031687508,0.00035946033],"domain_scores_gemma":[0.9443945,0.043240346,0.0065620765,0.00079476886,0.0045100683,0.0004981685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020473612,0.0016126351,0.0072058365,0.012799819,0.00078303384,0.0039623436,0.0025200057,0.0024805027,0.004280114],"category_scores_gemma":[0.07867704,0.0014010819,0.0072760773,0.0112078125,0.0014940888,0.0038348527,0.002423859,0.002253131,0.0003306359],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037585496,0.00004994452,0.0004341147,0.87925476,0.007569947,0.000064495645,0.00055987405,0.00008956802,0.00018523454,0.00034908368,0.0011167403,0.10995049],"study_design_scores_gemma":[0.0005148767,0.0004405801,0.0025977376,0.9201292,0.05447368,0.00022353175,0.00058971485,0.000096266784,0.00024565172,0.00048062825,0.020159047,0.00004915645],"about_ca_topic_score_codex":0.008429231,"about_ca_topic_score_gemma":0.028986955,"teacher_disagreement_score":0.020473612,"about_ca_system_score_codex":0.004146348,"about_ca_system_score_gemma":0.01621335,"threshold_uncertainty_score":0.10827613},"labels":[],"label_agreement":null},{"id":"W3177819996","doi":"10.1007/978-3-030-88210-5_25","title":"Label Noise in Segmentation Networks: Mitigation Must Deal with Bias","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Segmentation; Noise (video); Artificial intelligence; Pattern recognition (psychology); Machine learning","score_opus":0.023540115029536256,"score_gpt":0.2589179553971054,"score_spread":0.23537784036756912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177819996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01722603,0.00090166315,0.97654825,0.0012797021,0.00020713703,0.000057921825,0.00011625774,0.0007709804,0.0028920288],"genre_scores_gemma":[0.42801014,0.0017284899,0.5422148,0.0015561209,0.0010213737,0.00024039186,0.0007258192,0.0012433566,0.0232595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985304,0.0004165541,0.000057868365,0.0004156466,0.00042471846,0.00015488594],"domain_scores_gemma":[0.9949621,0.0027614606,0.00030923545,0.0008832095,0.00089472224,0.0001894126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003961068,0.0015026747,0.0014691135,0.0008641977,0.0010615917,0.0025099851,0.0021553217,0.0037992927,0.002950452],"category_scores_gemma":[0.014651644,0.0011625079,0.0007067133,0.0011571462,0.0018311588,0.004779947,0.002639459,0.0028957454,0.002109203],"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.00053711864,0.00020174374,0.0053102258,0.00043094147,0.00020549844,0.00021678193,0.00058441877,0.1608868,0.05483129,0.07152781,0.014047067,0.6912202],"study_design_scores_gemma":[0.0000297679,0.00015611938,0.0018313964,0.00008806834,0.00010700375,0.00029418388,0.000113943795,0.83128166,0.034839995,0.12192098,0.009296994,0.00003981923],"about_ca_topic_score_codex":0.0023599335,"about_ca_topic_score_gemma":0.0043295776,"teacher_disagreement_score":0.003961068,"about_ca_system_score_codex":0.001459938,"about_ca_system_score_gemma":0.0013388041,"threshold_uncertainty_score":0.02094841},"labels":[],"label_agreement":null},{"id":"W3178710666","doi":"10.1007/978-3-030-78321-1_13","title":"Improving User Experience Through Recommendation Message Design: A Systematic Literature Review of Extant Literature on Recommender Systems and Message Design","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","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":"HEC Montréal","funders":"","keywords":"Extant taxon; Computer science; Recommender system; Relevance (law); Context (archaeology); Systematic review; World Wide Web; Knowledge management","score_opus":0.04012821448706688,"score_gpt":0.3011682731184919,"score_spread":0.26104005863142504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178710666","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008160936,0.9880193,0.001469236,0.00068023265,0.00012440397,0.00047897306,0.00023823445,0.000034579094,0.0007940096],"genre_scores_gemma":[0.06795175,0.91017747,0.018600766,0.001180234,0.00022434763,0.0010054861,0.00037301503,0.00002875977,0.00045815366],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.991971,0.0038226435,0.0017251964,0.00072272134,0.0015621891,0.00019619662],"domain_scores_gemma":[0.9126105,0.07725605,0.005060606,0.000822398,0.0038096628,0.0004408491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019259965,0.0010570679,0.0040835547,0.007550474,0.0007777654,0.003253292,0.00139216,0.0019066674,0.0035137364],"category_scores_gemma":[0.0583381,0.00081789,0.0032106861,0.007104524,0.0009340397,0.004134396,0.0013600528,0.0013898555,0.0004248208],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004024759,0.00028690443,0.003070099,0.41843417,0.002764577,0.000070737406,0.0015125852,0.000207669,0.00058713433,0.00073133246,0.0024289456,0.5695034],"study_design_scores_gemma":[0.0009498165,0.003046656,0.026082722,0.81786245,0.046150427,0.0009951846,0.0036938568,0.0013324181,0.0024040304,0.0029861873,0.0941922,0.00030407155],"about_ca_topic_score_codex":0.0036949327,"about_ca_topic_score_gemma":0.012168748,"teacher_disagreement_score":0.019259965,"about_ca_system_score_codex":0.0018324886,"about_ca_system_score_gemma":0.006516489,"threshold_uncertainty_score":0.1018576},"labels":[],"label_agreement":null},{"id":"W3178837857","doi":"10.1007/978-3-030-80421-3_8","title":"Checking Method for Fake News to Avoid the Twitter Effect","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Université de Montréal","funders":"","keywords":"Fake news; Internet privacy; Computer science; Computer security; Advertising; Business","score_opus":0.025857543029884168,"score_gpt":0.29153743736110194,"score_spread":0.26567989433121775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178837857","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.23123877,0.0022953688,0.6292806,0.0029535387,0.002560918,0.0012553215,0.0032663147,0.080386974,0.046762124],"genre_scores_gemma":[0.7240189,0.0004174948,0.23405577,0.00064787857,0.00066253357,0.00023308372,0.002246461,0.003449204,0.034268722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622947,0.00049705256,0.0002980549,0.00085878366,0.0017455162,0.00037106744],"domain_scores_gemma":[0.981474,0.00570693,0.0018692319,0.00556753,0.0048385845,0.00054377003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014891281,0.0010805952,0.0012739422,0.0031678365,0.0016492491,0.0024801216,0.0013451723,0.0017725881,0.018150587],"category_scores_gemma":[0.015502141,0.00063971983,0.0009873628,0.0011569324,0.0006938762,0.004429074,0.0014932291,0.0013042955,0.009903275],"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.0022211496,0.0006697367,0.022639122,0.0009080704,0.00029779563,0.0015463724,0.0008725905,0.0030373575,0.09753738,0.015871223,0.063633166,0.790766],"study_design_scores_gemma":[0.00039295136,0.001191671,0.022196705,0.00041559662,0.0009460663,0.006874569,0.0009762327,0.2673505,0.55384153,0.033385206,0.11196188,0.00046714867],"about_ca_topic_score_codex":0.001362919,"about_ca_topic_score_gemma":0.0011576418,"teacher_disagreement_score":0.018150587,"about_ca_system_score_codex":0.0005594706,"about_ca_system_score_gemma":0.0013089585,"threshold_uncertainty_score":0.060719788},"labels":[],"label_agreement":null},{"id":"W3178976564","doi":"10.1007/978-3-030-81242-3_18","title":"The $${tkl}\\hbox {-}\\mathrm {Score}$$ for Data-Sharing Misuseability","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Alberta","funders":"","keywords":"Combinatorics; Physics; Crystallography; Mathematics","score_opus":0.08984236205901279,"score_gpt":0.31128675545323237,"score_spread":0.22144439339421956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178976564","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.002554301,0.0006974947,0.86362785,0.0048833117,0.0011095705,0.00016154996,0.0010192702,0.006718029,0.11922876],"genre_scores_gemma":[0.1710719,0.002269808,0.59166753,0.004172336,0.0014794247,0.0007297121,0.002211081,0.009871253,0.21652694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557805,0.0012047584,0.0003174255,0.00078185956,0.0016735629,0.0004443064],"domain_scores_gemma":[0.9964972,0.0011309816,0.00016083097,0.001514372,0.0005444715,0.0001521936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00245755,0.0012511254,0.0010045375,0.0018506665,0.002275535,0.005613277,0.0025752787,0.0022217731,0.05586074],"category_scores_gemma":[0.00890623,0.00090159406,0.001291412,0.00277032,0.005639483,0.012543679,0.005835112,0.006459201,0.023710065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034998426,0.0000249044,0.00009523235,0.00010190986,0.0000069940866,0.0000472689,0.00013553421,0.00065674237,0.00088834873,0.8827105,0.04017282,0.07512476],"study_design_scores_gemma":[0.00001280409,0.000020856796,0.00009140681,0.00011919126,0.000014811773,0.00026972903,0.00007722356,0.009132992,0.003744887,0.75355315,0.23292705,0.000035857054],"about_ca_topic_score_codex":0.0022871646,"about_ca_topic_score_gemma":0.0023378537,"teacher_disagreement_score":0.05586074,"about_ca_system_score_codex":0.0024967063,"about_ca_system_score_gemma":0.0017599755,"threshold_uncertainty_score":0.18687278},"labels":[],"label_agreement":null},{"id":"W3180198077","doi":"10.1007/978-3-030-78743-1_5","title":"Liminal Tones: Swarm Aesthetics and Materiality in Sound Art","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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":"Soundscape; Materiality (auditing); Swarm behaviour; Perception; Computer science; Liminality; Acoustics; Dream; Musical; Sound (geography); Aesthetics; Art; Visual arts; Artificial intelligence; Psychology; Philosophy; Epistemology; Physics","score_opus":0.014820120131232987,"score_gpt":0.2615972224318935,"score_spread":0.2467771023006605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180198077","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.041070927,0.005135853,0.0761803,0.0036488282,0.001450884,0.000054426313,0.00008581664,0.00038872127,0.8719842],"genre_scores_gemma":[0.7860307,0.0017788609,0.024379143,0.00066576776,0.0008869736,0.00011699463,0.00009271283,0.0005496973,0.18549913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997769,0.00008944462,0.0000067819547,0.0000307695,0.00007167351,0.000024430889],"domain_scores_gemma":[0.99962676,0.00021617317,0.000014530027,0.000048944607,0.000042307198,0.000051297615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004993496,0.00049541245,0.0002498683,0.000691825,0.0015868896,0.0058355713,0.00065339135,0.0008576314,0.019993316],"category_scores_gemma":[0.0019342444,0.00017185742,0.00026659045,0.0006120516,0.0037187766,0.0036441407,0.0018597319,0.001592738,0.001446405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078061596,0.00002186968,0.00017232852,0.00017936499,0.000009165798,0.00012684018,0.0072479337,0.00090903084,0.0025965478,0.9200117,0.013470893,0.05517621],"study_design_scores_gemma":[0.00004461031,0.00014223876,0.0010268261,0.00019609713,0.000020059348,0.00058031664,0.006612134,0.008015415,0.0016737405,0.7519249,0.22972266,0.000040944607],"about_ca_topic_score_codex":0.00028437097,"about_ca_topic_score_gemma":0.00057501195,"teacher_disagreement_score":0.019993316,"about_ca_system_score_codex":0.00066122686,"about_ca_system_score_gemma":0.00022509742,"threshold_uncertainty_score":0.06688428},"labels":[],"label_agreement":null},{"id":"W3180215949","doi":"10.1007/978-3-030-80421-3_43","title":"Confusion Detection Within a 3D Adventure Game","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Université de Montréal","funders":"","keywords":"Confusion; Computer science; Adventure; Confusion matrix; Entertainment; Artificial intelligence; Human–computer interaction; Electroencephalography; Psychology","score_opus":0.020494410540327464,"score_gpt":0.2519209778011671,"score_spread":0.23142656726083966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180215949","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.7503357,0.00038903442,0.23411557,0.00020237085,0.00028075196,0.00026220598,0.00040809257,0.0026848149,0.011321451],"genre_scores_gemma":[0.9334123,0.0000762368,0.060072746,0.00009993053,0.000029089957,0.00007030756,0.00018500852,0.00015742447,0.0058969557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.000041250667,0.000008148411,0.000061612845,0.00008400807,0.00004420084],"domain_scores_gemma":[0.99944836,0.0002739863,0.000037206017,0.000025924317,0.00009761302,0.000116963274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022663393,0.0009914138,0.00072784646,0.00042340718,0.00041352084,0.0010301999,0.0009067329,0.0008925824,0.0048730723],"category_scores_gemma":[0.001317747,0.00032217195,0.00031087772,0.00021503653,0.00025857185,0.0005606178,0.0013412634,0.0006149096,0.00076019386],"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.009204622,0.0011888248,0.016820366,0.00038164612,0.00029501706,0.0035003773,0.0025076836,0.036702134,0.40292937,0.00494922,0.01091108,0.5106097],"study_design_scores_gemma":[0.000104783896,0.0014878535,0.035299573,0.00006874235,0.000098546945,0.0015006587,0.0007082572,0.90579545,0.044934858,0.004069827,0.0057898466,0.000141483],"about_ca_topic_score_codex":0.00445539,"about_ca_topic_score_gemma":0.007816443,"teacher_disagreement_score":0.0048730723,"about_ca_system_score_codex":0.00032729335,"about_ca_system_score_gemma":0.00036687538,"threshold_uncertainty_score":0.01630205},"labels":[],"label_agreement":null},{"id":"W3180605944","doi":"10.1007/978-3-030-80421-3_22","title":"Expert, Novice, and Intermediate Performance: Exploring the Relationship Between Clinical Reasoning Behaviors and Diagnostic Performance","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical Reasoning and Diagnostic Skills","field":"Medicine","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":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.08044834264296553,"score_gpt":0.35157271966701936,"score_spread":0.27112437702405384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180605944","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.99372333,0.00065155444,0.00029005928,0.0002471984,0.000013391882,0.000012584973,0.00019799368,0.0000144370015,0.004849405],"genre_scores_gemma":[0.9962606,0.0004672472,0.0004637875,0.00005546367,0.000014349425,0.00003709265,0.0003834386,0.0000111318495,0.0023068115],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99928635,0.00026629542,0.000044514865,0.00008955852,0.00022706641,0.00008615732],"domain_scores_gemma":[0.97525364,0.020082997,0.0021746492,0.00036850956,0.0006251127,0.0014950891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818466,0.00031499245,0.00034518723,0.0012389395,0.0004566945,0.0020601253,0.00085259514,0.00093243254,0.0056935605],"category_scores_gemma":[0.018161952,0.00039160118,0.0005666472,0.0011249032,0.000554094,0.0018729387,0.0012406476,0.0018135745,0.0007675684],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003709888,0.0006172928,0.96383333,0.00003897652,0.00012299993,0.00013471783,0.0025636377,0.00035513972,0.0004009883,0.00081259623,0.0010288664,0.029720474],"study_design_scores_gemma":[0.00000802083,0.00025547034,0.9949739,0.000034445893,0.000031978452,0.00016772377,0.001850606,0.0011200929,0.000116010124,0.0010743856,0.00035253257,0.000014914652],"about_ca_topic_score_codex":0.0033732764,"about_ca_topic_score_gemma":0.005011195,"teacher_disagreement_score":0.0056935605,"about_ca_system_score_codex":0.000521226,"about_ca_system_score_gemma":0.0006539243,"threshold_uncertainty_score":0.019046843},"labels":[],"label_agreement":null},{"id":"W3181123080","doi":"10.1007/978-3-030-79876-5_38","title":"Harpoon: Mechanizing Metatheory Interactively","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Assertion; Computer science; Normalization (sociology); Programming language; Metatheory; Representation (politics); Set (abstract data type); Proof of concept; Theoretical computer science; Mathematics","score_opus":0.028262155754654204,"score_gpt":0.2531520141780269,"score_spread":0.2248898584233727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181123080","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.013795227,0.00037716763,0.92754936,0.0010179968,0.00026716816,0.00014835205,0.00020516713,0.017310018,0.039329603],"genre_scores_gemma":[0.37688226,0.00068117643,0.58688,0.0013854937,0.00018204053,0.0002723838,0.00058849266,0.0045364904,0.028591616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996662,0.0013684027,0.000115382376,0.00036442676,0.0012084747,0.00028143026],"domain_scores_gemma":[0.9951381,0.0033495415,0.00013243139,0.00082180195,0.00043190434,0.00012629296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033928019,0.00072452816,0.0005577634,0.0015304514,0.00092138315,0.0027024713,0.002367796,0.0007269044,0.015830228],"category_scores_gemma":[0.008827861,0.00095670536,0.0012559749,0.00059346884,0.0033424622,0.004846428,0.005067186,0.0030031349,0.0028862897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016205921,0.00012256834,0.0005507644,0.0005128819,0.000058915983,0.00037138237,0.0011344933,0.0131427925,0.013394014,0.8104705,0.03320999,0.1268696],"study_design_scores_gemma":[0.00018268706,0.00011163731,0.0005007118,0.00039001906,0.00010363414,0.00069386105,0.00029308716,0.17152558,0.060716305,0.5053737,0.25997117,0.00013764823],"about_ca_topic_score_codex":0.003072675,"about_ca_topic_score_gemma":0.005294906,"teacher_disagreement_score":0.015830228,"about_ca_system_score_codex":0.0015651949,"about_ca_system_score_gemma":0.0020527244,"threshold_uncertainty_score":0.052957356},"labels":[],"label_agreement":null},{"id":"W3181185981","doi":"10.1007/978-3-030-80421-3_56","title":"Extraction of 3D Pose in Video for Building Virtual Learning Avatars","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Université de Montréal","funders":"","keywords":"Avatar; Computer vision; Computer science; Artificial intelligence; Pose; RGB color model; Process (computing); Human–computer interaction","score_opus":0.02069765040996759,"score_gpt":0.2730799213008291,"score_spread":0.2523822708908615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181185981","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.024208495,0.00055145496,0.96374154,0.00009986787,0.00017974863,0.00017561138,0.0011655685,0.003523769,0.0063540246],"genre_scores_gemma":[0.23650312,0.0015347914,0.7446323,0.00010198922,0.00012487546,0.00022136254,0.004042596,0.00069120305,0.012147819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996388,0.000046162222,0.000012070433,0.00013154847,0.00011940648,0.000052041898],"domain_scores_gemma":[0.9997749,0.000046074776,0.000020833028,0.000039026185,0.00008112065,0.000038036007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312723,0.0014667343,0.00075479294,0.0014523088,0.0003008222,0.0009471795,0.00073764083,0.00074382155,0.009748902],"category_scores_gemma":[0.00086824654,0.0004721948,0.00077306846,0.00096211216,0.000258779,0.0007290231,0.00091125997,0.0006285449,0.007892242],"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.00022575942,0.000096344585,0.0013138269,0.00025228693,0.000037908983,0.00018913829,0.00013340323,0.0065405876,0.17319214,0.0014370293,0.00793267,0.80864877],"study_design_scores_gemma":[0.00004893978,0.00074369943,0.012958572,0.00028335326,0.00017504528,0.002484041,0.0009293632,0.60523814,0.31420314,0.007641264,0.055180453,0.00011386959],"about_ca_topic_score_codex":0.0013271783,"about_ca_topic_score_gemma":0.0027767245,"teacher_disagreement_score":0.009748902,"about_ca_system_score_codex":0.00024696736,"about_ca_system_score_gemma":0.00032298907,"threshold_uncertainty_score":0.032613337},"labels":[],"label_agreement":null},{"id":"W3181333984","doi":"10.1007/978-3-030-80825-9_16","title":"PetaDroid: Adaptive Android Malware Detection Using Deep Learning","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Malware; Android (operating system); Android malware; Cluster analysis; Artificial intelligence; Machine learning; Operating system","score_opus":0.01750434426896871,"score_gpt":0.249396561514712,"score_spread":0.2318922172457433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181333984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11111713,0.003674539,0.6894067,0.0007839715,0.0011101603,0.00040495378,0.0048726085,0.16710344,0.021526542],"genre_scores_gemma":[0.4684701,0.0010189062,0.4714263,0.0010392679,0.00018672565,0.0003316703,0.008970068,0.002861703,0.045695283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996915,0.00002038844,0.0000120689265,0.000088487875,0.00013593868,0.00005161068],"domain_scores_gemma":[0.9997601,0.00007158794,0.000019023408,0.00005996469,0.00006583722,0.00002348309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028737006,0.0012160612,0.0006402788,0.0008074374,0.00028861608,0.0007663486,0.0016546502,0.000821452,0.0051364372],"category_scores_gemma":[0.00078267575,0.000461647,0.00068365905,0.00035021434,0.00026963642,0.0013031159,0.001331277,0.0011208961,0.0026018473],"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.0005267066,0.00029010666,0.002640469,0.0002227782,0.00014876814,0.00022817108,0.000060913586,0.02412502,0.0363786,0.0023734856,0.07842243,0.8545825],"study_design_scores_gemma":[0.000060835173,0.00022259967,0.0015593265,0.000037572976,0.00005658599,0.0004076935,0.000032844226,0.9303439,0.042598695,0.004181713,0.020449132,0.00004910147],"about_ca_topic_score_codex":0.0037905355,"about_ca_topic_score_gemma":0.007489281,"teacher_disagreement_score":0.0051364372,"about_ca_system_score_codex":0.0005819685,"about_ca_system_score_gemma":0.00065865787,"threshold_uncertainty_score":0.017183065},"labels":[],"label_agreement":null},{"id":"W3181822265","doi":"10.1007/978-3-030-93043-1_1","title":"On the Fault-Tolerant Online Bin Packing Problem","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Replica; Bin packing problem; Server; Bin; Computer science; Fault tolerance; Competitive analysis; Sequence (biology); Distributed computing; Mathematics; Algorithm; Parallel computing; Computer network; Upper and lower bounds","score_opus":0.030603976821063923,"score_gpt":0.28629887795508696,"score_spread":0.25569490113402304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181822265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16754255,0.0034971142,0.79190516,0.0057265735,0.001035277,0.00020518522,0.0010465196,0.00092110195,0.028120408],"genre_scores_gemma":[0.8413859,0.0026488786,0.13474257,0.0009831995,0.0010909705,0.00022631393,0.0012667929,0.00047375844,0.017181674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979311,0.00064824946,0.000096122676,0.00032398337,0.0006143318,0.00038614983],"domain_scores_gemma":[0.99141425,0.0063610687,0.0005456955,0.0008791252,0.00045103228,0.00034888356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019102114,0.0011373688,0.0024488322,0.0011309868,0.0012807741,0.0027125543,0.00294194,0.002391591,0.008975473],"category_scores_gemma":[0.0145461485,0.0006412251,0.0009237573,0.003227133,0.0014318773,0.0062282626,0.0024099937,0.0028651555,0.00074759364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016096975,0.00042601232,0.0011342629,0.00052796636,0.00010358825,0.00031839396,0.00019856413,0.7078538,0.002658472,0.13916202,0.022069851,0.12393748],"study_design_scores_gemma":[0.00007420772,0.000099263685,0.0004001044,0.000034170156,0.000027789572,0.00015261602,0.00007509614,0.7912288,0.0008134272,0.20457177,0.0025059073,0.000016978274],"about_ca_topic_score_codex":0.0023053335,"about_ca_topic_score_gemma":0.0016404142,"teacher_disagreement_score":0.008975473,"about_ca_system_score_codex":0.0016861511,"about_ca_system_score_gemma":0.0012458509,"threshold_uncertainty_score":0.030025959},"labels":[],"label_agreement":null},{"id":"W3181858657","doi":"10.1007/978-3-030-81242-3_2","title":"Comparing Local and Central Differential Privacy Using Membership Inference Attacks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential privacy; Inference; Computer science; Upper and lower bounds; Differential (mechanical device); Data mining; Artificial intelligence; Mathematics","score_opus":0.06331319455675687,"score_gpt":0.29165787768095186,"score_spread":0.22834468312419498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181858657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17812121,0.001259351,0.79906565,0.0014260588,0.00019833176,0.00012749403,0.00023202461,0.0007759191,0.018793857],"genre_scores_gemma":[0.96094775,0.00025195765,0.03555518,0.0001487306,0.00012354588,0.00006153548,0.00011875221,0.00012778374,0.0026648424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98173404,0.008774432,0.0004499764,0.0017297418,0.005409554,0.0019022154],"domain_scores_gemma":[0.93240404,0.046133623,0.0020429231,0.015915157,0.0026503857,0.0008538143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012559902,0.00072330324,0.0020377636,0.0010688652,0.0015002592,0.0048629134,0.0032472007,0.00236317,0.004170286],"category_scores_gemma":[0.04735349,0.000702482,0.0010765351,0.0022321087,0.004311391,0.0112359235,0.0075362907,0.0041713635,0.000640093],"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.0043332046,0.00043274355,0.0054314323,0.00027430375,0.0002900851,0.00024726297,0.0007301889,0.1965279,0.008812168,0.62160313,0.005144363,0.15617323],"study_design_scores_gemma":[0.00010726677,0.0003718947,0.0012702302,0.000043116008,0.00013242054,0.00030794248,0.00024240385,0.6923433,0.011401509,0.29064825,0.0030753142,0.000056335753],"about_ca_topic_score_codex":0.00047261134,"about_ca_topic_score_gemma":0.00052357104,"teacher_disagreement_score":0.012559902,"about_ca_system_score_codex":0.0029068692,"about_ca_system_score_gemma":0.0018606944,"threshold_uncertainty_score":0.06642395},"labels":[],"label_agreement":null},{"id":"W3181892836","doi":"10.1007/978-3-030-78743-1_21","title":"Two Modified NichePSO Algorithms for Multimodal Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Brock University","funders":"","keywords":"Computer science; Benchmark (surveying); Particle swarm optimization; Heuristic; Mathematical optimization; Algorithm; Evolutionary algorithm; Metaheuristic; Optimization algorithm; Multi-swarm optimization; Genetic algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.040345808245364365,"score_gpt":0.3135425495727767,"score_spread":0.27319674132741234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181892836","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.008236183,0.0011306785,0.97163534,0.0002676438,0.00049527193,0.00014323728,0.00011081595,0.00065319403,0.017327638],"genre_scores_gemma":[0.10545994,0.0006390758,0.87062114,0.00032532684,0.000268647,0.0006570467,0.0003080538,0.00060724997,0.021113537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992366,0.00021963766,0.000035310735,0.00008104102,0.0003440329,0.00008349824],"domain_scores_gemma":[0.99933285,0.00029256757,0.000035892117,0.000095603296,0.00018145623,0.00006162854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009684086,0.001488425,0.0013999776,0.0011194727,0.00059592054,0.0013577951,0.0026344114,0.0022600451,0.0087742675],"category_scores_gemma":[0.0033794378,0.00061541557,0.0012542867,0.0016732113,0.0006945586,0.0013559447,0.0026064063,0.002018451,0.001757392],"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.00040831981,0.00027343057,0.00040527442,0.0002998646,0.0001459127,0.00012854738,0.00014797406,0.36761916,0.0047821794,0.06517928,0.013458177,0.54715186],"study_design_scores_gemma":[0.00007455393,0.00008546484,0.00017716363,0.00002083803,0.00002294471,0.00006729274,0.000019589841,0.97799885,0.00081248535,0.012594332,0.00810246,0.000024032575],"about_ca_topic_score_codex":0.0022087083,"about_ca_topic_score_gemma":0.0032438396,"teacher_disagreement_score":0.0087742675,"about_ca_system_score_codex":0.0007262224,"about_ca_system_score_gemma":0.00089841516,"threshold_uncertainty_score":0.029352903},"labels":[],"label_agreement":null},{"id":"W3182151148","doi":"","title":"METIS:有限状態特性の資源と文脈意識モニタリング【JST・京大機械翻訳】","year":2018,"lang":"ja","type":"article","venue":"Lecture notes in computer science","topic":"Military Technology and Strategies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Metis; World Wide Web","score_opus":0.010057768187577998,"score_gpt":0.23314305697754223,"score_spread":0.22308528878996423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182151148","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.03889263,0.0015341167,0.19781138,0.006954818,0.0028564434,0.00020628111,0.0029351402,0.0058541596,0.74295497],"genre_scores_gemma":[0.48294663,0.0015217813,0.14530057,0.0011762959,0.0013715272,0.00028413621,0.0025800085,0.002307949,0.36251113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999268,0.00011329377,0.0000401483,0.00014665749,0.00035508737,0.00007685033],"domain_scores_gemma":[0.9993618,0.00014933407,0.00007087238,0.00012364241,0.00021981186,0.00007459162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008010372,0.00052487495,0.0003574847,0.001058927,0.0015950167,0.0036704738,0.0007714009,0.0008291794,0.035808004],"category_scores_gemma":[0.002699218,0.00027785657,0.00038656758,0.000927784,0.0015784559,0.0040011844,0.0018495744,0.0012591628,0.0125894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032516927,0.0000788188,0.0023950313,0.00028311976,0.000034203367,0.00037049147,0.0015553932,0.0015589239,0.011812046,0.6965906,0.06371046,0.22128569],"study_design_scores_gemma":[0.000061594226,0.0001574291,0.0036923548,0.00017770827,0.00006898943,0.000968773,0.0016005768,0.013331471,0.034022946,0.24868947,0.6971466,0.00008217064],"about_ca_topic_score_codex":0.0026233618,"about_ca_topic_score_gemma":0.0023765846,"teacher_disagreement_score":0.035808004,"about_ca_system_score_codex":0.0011164821,"about_ca_system_score_gemma":0.0015509016,"threshold_uncertainty_score":0.11978966},"labels":[],"label_agreement":null},{"id":"W3182613696","doi":"10.1007/978-3-030-88885-5_13","title":"Verifying Verified Code","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Compiler; Reuse; Code (set theory); Semantics (computer science); Model checking; Formal verification; Verification; Software verification; Functional verification; Intelligent verification; Perspective (graphical); Software engineering; Software; Software development; Software construction; Engineering; Set (abstract data type)","score_opus":0.0448862475193956,"score_gpt":0.31948062360021434,"score_spread":0.2745943760808187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182613696","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.047196027,0.00017267498,0.9318353,0.00040781155,0.0003367648,0.00019191462,0.00049902446,0.009946444,0.009414033],"genre_scores_gemma":[0.635884,0.0002457357,0.341965,0.00027262294,0.00011296519,0.00018170063,0.0015958411,0.0032835954,0.016458558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934736,0.001354511,0.00040965754,0.0009789254,0.003261697,0.00052154233],"domain_scores_gemma":[0.98483074,0.006339562,0.00071547134,0.005228406,0.0027138817,0.0001719604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029359064,0.0008488853,0.00070691033,0.0008045013,0.0009875788,0.0018606111,0.0013691396,0.0013191868,0.013197573],"category_scores_gemma":[0.02076873,0.0008327188,0.0015160395,0.0005965059,0.0015904617,0.0029708545,0.0021454042,0.0014540601,0.0033317269],"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.0016967767,0.0003425327,0.007414528,0.00146476,0.0002650836,0.002245717,0.0010458877,0.09138908,0.11923144,0.35156208,0.019145785,0.40419635],"study_design_scores_gemma":[0.00027522794,0.00040362703,0.0016177502,0.00026305823,0.00018237418,0.0009915262,0.00022572863,0.4246922,0.29160747,0.23500234,0.04465081,0.000087925946],"about_ca_topic_score_codex":0.0022773687,"about_ca_topic_score_gemma":0.0021417763,"teacher_disagreement_score":0.013197573,"about_ca_system_score_codex":0.0012250725,"about_ca_system_score_gemma":0.003314544,"threshold_uncertainty_score":0.044150293},"labels":[],"label_agreement":null},{"id":"W3182955983","doi":"10.1007/978-3-030-80421-3_41","title":"A Comparative Evaluation of the Effect of Social Comparison, Competition, and Social Learning in Persuasive Technology on Learning","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online and Blended Learning","field":"Social Sciences","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 Saskatchewan","funders":"","keywords":"Computer science; Persuasive technology; Social learning; Competition (biology); Active learning (machine learning); Online learning; Knowledge management; Learning Management; Social media; Cooperative learning; Synchronous learning; Multimedia; Mathematics education; Psychology; Artificial intelligence; World Wide Web; Teaching method; Social psychology; Persuasion","score_opus":0.025178264099519787,"score_gpt":0.34601155969962827,"score_spread":0.3208332956001085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182955983","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.9646971,0.0026852868,0.0014330095,0.00029384036,0.00018440778,0.0003532385,0.00007141008,0.000056609857,0.030224983],"genre_scores_gemma":[0.99191827,0.0009062577,0.002127499,0.000081924634,0.00011435737,0.00023983972,0.000072660645,0.000028978142,0.0045102113],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9868689,0.0092391055,0.00061151985,0.0005768161,0.0023928392,0.00031075318],"domain_scores_gemma":[0.7067622,0.2836283,0.0025380715,0.0016069409,0.0029570826,0.0025073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011101348,0.000728293,0.0009091252,0.0018050675,0.0006944689,0.0025630335,0.0012366145,0.001358702,0.013608221],"category_scores_gemma":[0.06356008,0.00031347683,0.0010432652,0.000979326,0.0014329166,0.00298251,0.001512998,0.0010842977,0.00076108385],"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.127266,0.055096123,0.033394758,0.008317331,0.0021810792,0.00043600396,0.013504683,0.004063039,0.01742984,0.01451478,0.002614293,0.72118205],"study_design_scores_gemma":[0.034674864,0.43631595,0.36340195,0.0027850918,0.013103178,0.0011698559,0.023024054,0.024953417,0.047222517,0.025449583,0.027215393,0.0006840859],"about_ca_topic_score_codex":0.0006577147,"about_ca_topic_score_gemma":0.00082153425,"teacher_disagreement_score":0.013608221,"about_ca_system_score_codex":0.00094809534,"about_ca_system_score_gemma":0.0011460531,"threshold_uncertainty_score":0.058710277},"labels":[],"label_agreement":null},{"id":"W3183069751","doi":"10.1007/978-3-030-80421-3_53","title":"Voice Emotion Recognition in Real Time Applications","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Computer science; Sadness; Surprise; Machine learning; Happiness; Artificial intelligence; Random forest; Anger; Boosting (machine learning); Emotion classification; AdaBoost; Emotion recognition; Speech recognition; Classifier (UML); Psychology","score_opus":0.03474575501260076,"score_gpt":0.2988464766347562,"score_spread":0.2641007216221555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183069751","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008863554,0.046857733,0.80889326,0.0007718129,0.003688461,0.00010183627,0.0006653358,0.0068687755,0.123289205],"genre_scores_gemma":[0.116596155,0.035999816,0.31131727,0.0011753675,0.0022721526,0.00021731686,0.002101932,0.0016831242,0.5286369],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99986386,0.000018523613,0.000009449241,0.000033941622,0.000060096412,0.000014200462],"domain_scores_gemma":[0.99980646,0.00009242411,0.000009628398,0.000023934053,0.000057169156,0.000010348931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027207704,0.0005568614,0.0004173456,0.00040929794,0.00013702067,0.0012355202,0.00073863304,0.00081665674,0.037093926],"category_scores_gemma":[0.0004569283,0.00022608835,0.00024156724,0.0007356009,0.00020413267,0.0010013618,0.00039154373,0.0005885342,0.019914987],"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.00008243397,0.00003245534,0.00012010875,0.000301493,0.000012486042,0.0000814607,0.000078564066,0.0012711161,0.055701304,0.00797098,0.03573299,0.89861465],"study_design_scores_gemma":[0.000023718641,0.000312226,0.002711207,0.00037844837,0.00008294361,0.0014962656,0.00020550798,0.070288606,0.085743085,0.021235729,0.8174529,0.000069356334],"about_ca_topic_score_codex":0.00026459483,"about_ca_topic_score_gemma":0.0003937499,"teacher_disagreement_score":0.037093926,"about_ca_system_score_codex":0.00014833522,"about_ca_system_score_gemma":0.000099578545,"threshold_uncertainty_score":0.124091566},"labels":[],"label_agreement":null},{"id":"W3183335868","doi":"10.1007/978-3-030-79457-6_48","title":"Collapsed Gibbs Sampling of Beta-Liouville Multinomial for Short Text Clustering","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Gibbs sampling; Multinomial distribution; Cluster analysis; Sampling (signal processing); Social media; Data mining; Artificial intelligence; World Wide Web; Statistics; Mathematics; Bayesian probability","score_opus":0.04681323560420386,"score_gpt":0.2805330171014423,"score_spread":0.23371978149723843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183335868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012834202,0.0005300724,0.98443896,0.00024369276,0.000100242585,0.00012498435,0.00037319906,0.0006283327,0.0007263072],"genre_scores_gemma":[0.32878986,0.0011747669,0.6390702,0.000709511,0.000870673,0.0017187443,0.009291771,0.0016231012,0.016751416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430907,0.0034648916,0.0002711318,0.0009961582,0.0006086827,0.00035009722],"domain_scores_gemma":[0.9764355,0.018714568,0.0004538731,0.0022196274,0.001498102,0.0006784213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081256,0.001130058,0.0030129978,0.0041106753,0.0024434985,0.003685984,0.005766449,0.0036238388,0.007979943],"category_scores_gemma":[0.035409037,0.001494093,0.0029784646,0.005043009,0.0025175489,0.0045042303,0.0041498346,0.003395226,0.002950497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090922887,0.00037941284,0.0043049953,0.0007000974,0.0004529217,0.00045008867,0.0015908201,0.42009377,0.0059076305,0.33141333,0.01938857,0.2144091],"study_design_scores_gemma":[0.000024186173,0.000017286065,0.00024285409,0.000023755902,0.000016034546,0.000039480714,0.000039411836,0.93105847,0.00038360307,0.06685813,0.0012771018,0.00001961643],"about_ca_topic_score_codex":0.010174997,"about_ca_topic_score_gemma":0.017482597,"teacher_disagreement_score":0.010174997,"about_ca_system_score_codex":0.002663674,"about_ca_system_score_gemma":0.0023991957,"threshold_uncertainty_score":0.042972803},"labels":[],"label_agreement":null},{"id":"W3183406529","doi":"10.1007/978-3-030-79457-6_27","title":"Deep Forecasting of COVID-19: Canadian Case Study","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Moncton","funders":"","keywords":"Univariate; Computer science; Coronavirus disease 2019 (COVID-19); Context (archaeology); Multivariate statistics; Time series; Artificial intelligence; Machine learning; Statistics; Econometrics; Infectious disease (medical specialty); Mathematics; Medicine; Geography; Disease","score_opus":0.247676874594161,"score_gpt":0.39376569785343385,"score_spread":0.14608882325927286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183406529","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.82065403,0.0063366373,0.044587385,0.026300052,0.0005703904,0.00020244428,0.027848726,0.00074988906,0.07275051],"genre_scores_gemma":[0.96830946,0.0016924317,0.007957306,0.00025715955,0.00007275411,0.000030672585,0.0066325264,0.00007046662,0.014977207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999423,0.00010370809,0.00001788005,0.00006856393,0.00018585956,0.00020101904],"domain_scores_gemma":[0.99758303,0.0008819272,0.00012524777,0.00016212564,0.0010031328,0.00024452803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018541561,0.0006862852,0.00050398824,0.0013796721,0.0013701166,0.0019237155,0.0016629141,0.0014529162,0.0032415572],"category_scores_gemma":[0.0066541396,0.0002596831,0.00048217524,0.0038730297,0.0007516096,0.0008784366,0.00058836146,0.00160686,0.00044932056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062380853,0.00032322583,0.12542363,0.00020856284,0.00020467493,0.0014664576,0.00084604445,0.47587174,0.0007640547,0.07235502,0.19386163,0.12805119],"study_design_scores_gemma":[0.00011205217,0.00009487696,0.071849674,0.00011211438,0.00012642005,0.00023736787,0.0026325586,0.8431711,0.0012145767,0.024064835,0.056228403,0.00015596002],"about_ca_topic_score_codex":0.96846473,"about_ca_topic_score_gemma":0.9602781,"teacher_disagreement_score":0.031535268,"about_ca_system_score_codex":0.014431892,"about_ca_system_score_gemma":0.012638556,"threshold_uncertainty_score":0.104711235},"labels":[],"label_agreement":null},{"id":"W3183859668","doi":"10.1007/978-3-030-79987-8_26","title":"Approximation Algorithms for Hitting Subgraphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Combinatorics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Graph; Discrete mathematics; Computer science; Mathematics; Algorithm","score_opus":0.033338767995964066,"score_gpt":0.26544700857681075,"score_spread":0.23210824058084667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183859668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04179594,0.0032966216,0.8973497,0.0022433493,0.00052452093,0.00043308464,0.0023026268,0.0053277845,0.04672633],"genre_scores_gemma":[0.26893976,0.004192672,0.67188054,0.0010218384,0.00080245093,0.0009166126,0.009599077,0.002558527,0.04008847],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977946,0.00048495168,0.0001119843,0.0005135126,0.0006844872,0.00041046971],"domain_scores_gemma":[0.9928001,0.004076604,0.00029454767,0.0019817776,0.00048232137,0.0003647013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016191539,0.0027599484,0.0028208564,0.0029452846,0.001614557,0.004689653,0.0071014767,0.002728193,0.029133096],"category_scores_gemma":[0.013115586,0.0015251022,0.0026686254,0.008801453,0.0017211043,0.0108627025,0.0037280063,0.005680871,0.0058459328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076977094,0.00055420975,0.001277379,0.0009637056,0.0002082562,0.00015591482,0.0004234479,0.15152177,0.003279495,0.29676688,0.076528214,0.467551],"study_design_scores_gemma":[0.00017271009,0.00009380731,0.00040465305,0.0001026917,0.00014171033,0.00022213912,0.00013756038,0.4334154,0.0020622108,0.5517837,0.011437432,0.00002613009],"about_ca_topic_score_codex":0.0049070865,"about_ca_topic_score_gemma":0.0057570166,"teacher_disagreement_score":0.029133096,"about_ca_system_score_codex":0.004279706,"about_ca_system_score_gemma":0.0021374808,"threshold_uncertainty_score":0.09745997},"labels":[],"label_agreement":null},{"id":"W3184053854","doi":"10.1007/978-3-030-79457-6_25","title":"Birth-Death MCMC Approach for Multivariate Beta Mixture Models in Medical Applications","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Multivariate statistics; Mixture model; Bayesian probability; Artificial intelligence; Multivariate normal distribution; Data mining; Machine learning; Flexibility (engineering); Bayesian inference; Statistics; Mathematics","score_opus":0.03484743283623854,"score_gpt":0.2923724810792327,"score_spread":0.25752504824299416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184053854","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.0006122711,0.0005474849,0.99748373,0.00014582976,0.00006204938,0.000022134644,0.000055673034,0.0001880643,0.00088285044],"genre_scores_gemma":[0.057612322,0.0022047823,0.9238606,0.00040744658,0.00037573682,0.0004538958,0.0006629882,0.00070974027,0.013712469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984907,0.00077836605,0.00007470607,0.00018429125,0.00037919052,0.000092650225],"domain_scores_gemma":[0.9949845,0.0037918924,0.00014606603,0.0003767335,0.0005782629,0.00012260479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037898782,0.0010961174,0.0020480547,0.0016654038,0.0010052354,0.0022096552,0.004493339,0.0034439906,0.009177654],"category_scores_gemma":[0.013778702,0.0018414372,0.0022009318,0.002527952,0.0013834251,0.0018022002,0.0023671945,0.005844425,0.0029230719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009627858,0.00006229298,0.0007807469,0.0003418754,0.00023176886,0.00019059579,0.00022979992,0.59893674,0.0017881176,0.250274,0.010744294,0.13632356],"study_design_scores_gemma":[0.000007987196,0.0000066200464,0.00009968407,0.0000247168,0.000022490593,0.000043110358,0.00000899528,0.9541095,0.00028934993,0.042559836,0.0028110507,0.000016699569],"about_ca_topic_score_codex":0.009466901,"about_ca_topic_score_gemma":0.010557023,"teacher_disagreement_score":0.009466901,"about_ca_system_score_codex":0.001522974,"about_ca_system_score_gemma":0.0018752598,"threshold_uncertainty_score":0.030702293},"labels":[],"label_agreement":null},{"id":"W3184086089","doi":"10.1007/978-3-030-77414-1_27","title":"Exploring Coordination Patterns in VR-Based Rehabilitation for Stroke Using the Kinect Sensor","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interactivity; Computer science; Rehabilitation; Human–computer interaction; Virtual reality; Motion (physics); Motion capture; Motion analysis; Multimedia; Artificial intelligence; Medicine","score_opus":0.06848214305795147,"score_gpt":0.3021876791229307,"score_spread":0.23370553606497924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184086089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3831951,0.0059009683,0.5786972,0.00033044987,0.00017323311,0.00022093278,0.0034673696,0.002213718,0.025800938],"genre_scores_gemma":[0.76860356,0.004538148,0.2086314,0.00009519422,0.00003815,0.00016953074,0.0013081182,0.00030842438,0.016307494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998704,0.000019997116,0.000008381293,0.000042136333,0.00004700455,0.000012155417],"domain_scores_gemma":[0.9999237,0.000040555045,0.000010534192,0.0000062351623,0.000010755779,0.000008324003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015880815,0.000433074,0.0003441689,0.00046798063,0.00013184105,0.0006184304,0.00035119927,0.0003624451,0.004989878],"category_scores_gemma":[0.00044651236,0.00027936883,0.00032684684,0.0007792079,0.00016316416,0.00045402412,0.00043349116,0.00021798855,0.00090575754],"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.00087047176,0.00015459188,0.0062740375,0.0010572319,0.00009382983,0.0003582709,0.0010235714,0.03743939,0.26666433,0.0021280106,0.005190773,0.67874545],"study_design_scores_gemma":[0.00019394628,0.0017762523,0.2656048,0.00089424365,0.00029427797,0.0044868994,0.002388438,0.5066794,0.15527621,0.014167934,0.04791968,0.00031790734],"about_ca_topic_score_codex":0.002046273,"about_ca_topic_score_gemma":0.0043845735,"teacher_disagreement_score":0.004989878,"about_ca_system_score_codex":0.00012636464,"about_ca_system_score_gemma":0.00029473336,"threshold_uncertainty_score":0.016692877},"labels":[],"label_agreement":null},{"id":"W3184271129","doi":"10.1007/978-3-030-77873-6_6","title":"Modelling and Quantifying Learner Motivation for Adaptive Systems: Current Insight and Future Perspectives","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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 Saskatchewan","funders":"","keywords":"Personalization; Computer science; Adaptation (eye); Process (computing); Adaptive learning; Knowledge management; Human–computer interaction; Artificial intelligence; Psychology; World Wide Web","score_opus":0.05508357946908587,"score_gpt":0.2849825935359044,"score_spread":0.2298990140668185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184271129","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14579041,0.011296922,0.8256498,0.0050901473,0.00018199101,0.00010895863,0.00022779466,0.0004288824,0.011225179],"genre_scores_gemma":[0.89843744,0.005194549,0.09135986,0.00014567145,0.00028166076,0.0001298854,0.00018334412,0.00010304416,0.0041644964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982262,0.00087954086,0.0000745444,0.00033198445,0.0003442678,0.00014350771],"domain_scores_gemma":[0.9925822,0.005879138,0.00055772736,0.00035319227,0.00039805207,0.00022957839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036742312,0.0012436877,0.0014459911,0.00092952483,0.00031216283,0.0063110744,0.0023483639,0.0018911788,0.0021700396],"category_scores_gemma":[0.013719958,0.0005031065,0.0009774636,0.0011296544,0.0015528772,0.0068998775,0.0015367372,0.0021911834,0.0002996635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013748705,0.0005938631,0.024348471,0.0010213533,0.0003286794,0.00010765651,0.0011204946,0.42371362,0.0023732414,0.3571022,0.0029908507,0.18616205],"study_design_scores_gemma":[0.000008549162,0.00009259955,0.004314225,0.00015600334,0.000034017554,0.000044906345,0.00028668175,0.7434343,0.00046175558,0.24853967,0.0025731644,0.000054113592],"about_ca_topic_score_codex":0.0032296542,"about_ca_topic_score_gemma":0.0022116874,"teacher_disagreement_score":0.0063110744,"about_ca_system_score_codex":0.0014609896,"about_ca_system_score_gemma":0.0014257446,"threshold_uncertainty_score":0.019431412},"labels":[],"label_agreement":null},{"id":"W3184294918","doi":"10.1007/978-3-030-77392-2_1","title":"Authentication Management of Home IoT Devices","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"National Research Council Canada; Carleton University","funders":"","keywords":"Internet of Things; Authentication (law); Computer security; Computer science; Internet privacy; Business","score_opus":0.018750367933385127,"score_gpt":0.25054111730067463,"score_spread":0.2317907493672895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184294918","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15472077,0.010168043,0.66411936,0.001147418,0.0009864395,0.00041369887,0.00058782427,0.011891042,0.15596542],"genre_scores_gemma":[0.8819551,0.0022852088,0.033585556,0.00026616253,0.00026392177,0.00011873548,0.0006612101,0.00026945747,0.080594726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997173,0.000044962308,0.000023094562,0.000050156108,0.00010731005,0.000057197758],"domain_scores_gemma":[0.99972934,0.00005010083,0.000035385096,0.00009031472,0.00006856709,0.000026270905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028934178,0.00052279234,0.00044632686,0.00052987604,0.0006177798,0.0014241502,0.0008311448,0.0005189993,0.0070981723],"category_scores_gemma":[0.0004680931,0.00022298498,0.00023104735,0.00043831667,0.00026366182,0.0014787496,0.0010053143,0.0006034971,0.003095253],"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.0009463462,0.0002610708,0.0025169202,0.00035840212,0.000054626737,0.0010102896,0.0008787403,0.014098697,0.111089386,0.042619724,0.045814108,0.78035176],"study_design_scores_gemma":[0.00006904959,0.0006226449,0.012273968,0.00041536923,0.00024380066,0.0029154364,0.0009994245,0.44324526,0.17780915,0.05442632,0.30684346,0.00013616972],"about_ca_topic_score_codex":0.0007598244,"about_ca_topic_score_gemma":0.0007189021,"teacher_disagreement_score":0.0070981723,"about_ca_system_score_codex":0.0005058086,"about_ca_system_score_gemma":0.0002769901,"threshold_uncertainty_score":0.023745716},"labels":[],"label_agreement":null},{"id":"W3184581557","doi":"10.1007/978-3-030-79457-6_29","title":"Deep Efficient Neural Networks for Explainable COVID-19 Detection on CXR Images","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Université de Moncton","funders":"","keywords":"Computer science; Coronavirus disease 2019 (COVID-19); Deep learning; Generalization; Artificial intelligence; Modalities; Artificial neural network; Deep neural networks; Machine learning; Medical imaging; Disease; Pathology; Medicine; Infectious disease (medical specialty); Mathematics","score_opus":0.025539646117904335,"score_gpt":0.3005821953637334,"score_spread":0.27504254924582905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184581557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034691337,0.0029132226,0.95072955,0.0010436318,0.00022691111,0.000077207114,0.0010938221,0.0034434581,0.005780845],"genre_scores_gemma":[0.5232921,0.0032937916,0.44229156,0.00050686055,0.0003481811,0.00012518287,0.0034280485,0.00048590353,0.026228338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998863,0.000015350164,0.0000052791565,0.000033051827,0.000034300196,0.000025755473],"domain_scores_gemma":[0.99978465,0.00009946072,0.000024845434,0.000027205131,0.000051264145,0.000012692444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003341419,0.00087026093,0.00043114545,0.0004925264,0.00021181912,0.00063679146,0.00082238246,0.0009249154,0.0047549335],"category_scores_gemma":[0.0010015869,0.00037595237,0.0006566459,0.00042594085,0.00020049501,0.00062917004,0.00073704496,0.0011964006,0.0013363188],"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.00016132586,0.000066194174,0.0019326027,0.00013244423,0.00007390221,0.00028506966,0.000049686194,0.15488435,0.018657362,0.0064850845,0.017708264,0.79956377],"study_design_scores_gemma":[0.00000408087,0.000024676952,0.00083242235,0.000021772745,0.000018269177,0.0001225012,0.000010204018,0.9863349,0.004991194,0.0051575224,0.0024752046,0.000007140802],"about_ca_topic_score_codex":0.0057507646,"about_ca_topic_score_gemma":0.012805031,"teacher_disagreement_score":0.0057507646,"about_ca_system_score_codex":0.0005858883,"about_ca_system_score_gemma":0.00053475914,"threshold_uncertainty_score":0.01590681},"labels":[],"label_agreement":null},{"id":"W3184587613","doi":"10.1007/978-3-030-78462-1_13","title":"AI Creativity and the Human-AI Co-creation Model","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Creativity; Artificial intelligence; Cognitive science; Human–computer interaction; Psychology","score_opus":0.027230070978038295,"score_gpt":0.3209335503109648,"score_spread":0.2937034793329265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184587613","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.024415249,0.0044719744,0.14911562,0.0075097308,0.0005845573,0.00009315769,0.000057957834,0.00018841159,0.81356335],"genre_scores_gemma":[0.8767267,0.0019803252,0.050349306,0.000663354,0.00033513736,0.00030420156,0.00008975953,0.00009951776,0.069451615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830925,0.00090249634,0.000048749698,0.00023522333,0.0003318725,0.00017226613],"domain_scores_gemma":[0.99536455,0.0032957587,0.00019870252,0.00061740784,0.00020576865,0.0003177599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022841883,0.0005910153,0.0004002776,0.0011331771,0.0016171209,0.00734558,0.0014971053,0.002018112,0.012425909],"category_scores_gemma":[0.0046901004,0.0003716415,0.0008369405,0.0012196086,0.011846672,0.007200029,0.0033468907,0.0028492769,0.0018025785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014075158,0.000020049794,0.00008368586,0.000039695908,0.000005066424,0.000040721876,0.0006203095,0.0012946954,0.00012977375,0.9883795,0.0010171974,0.008355165],"study_design_scores_gemma":[0.000020291609,0.000020148987,0.00013996432,0.000037737223,0.0000047993603,0.000121959645,0.00036308807,0.005790131,0.00021539138,0.97260046,0.020675613,0.000010287515],"about_ca_topic_score_codex":0.00076066225,"about_ca_topic_score_gemma":0.00063010893,"teacher_disagreement_score":0.012425909,"about_ca_system_score_codex":0.0017744252,"about_ca_system_score_gemma":0.0015956768,"threshold_uncertainty_score":0.041568756},"labels":[],"label_agreement":null},{"id":"W3184628204","doi":"10.1007/978-3-030-77392-2_2","title":"Emics and Etics of Usable Security: Culturally-Specific or Culturally-Universal?","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"Insider; USable; Computer science; Usability; Password; Software security assurance; Computer security; Software; Internet privacy; Information security; World Wide Web; Human–computer interaction; Political science; Security service","score_opus":0.028284500650702597,"score_gpt":0.2720239176866902,"score_spread":0.24373941703598762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184628204","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.099727795,0.012003597,0.033039205,0.025735587,0.0009520522,0.00004813712,0.00014165918,0.000093405906,0.8282586],"genre_scores_gemma":[0.9717667,0.004627242,0.0030848973,0.0017872337,0.00016203008,0.000057922385,0.00007047544,0.00010906688,0.01833446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99668926,0.00212228,0.00014906331,0.00024888574,0.00039853837,0.00039199836],"domain_scores_gemma":[0.9962417,0.0018895481,0.00042083045,0.00064605934,0.00041510438,0.00038682096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034416905,0.0005685832,0.0004308106,0.0016588523,0.0026208614,0.008304772,0.0007897053,0.0013189442,0.0072287694],"category_scores_gemma":[0.009012755,0.00040256276,0.0003163277,0.0018369814,0.025430162,0.0091244215,0.0042292513,0.005071,0.0007702928],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012883522,0.00001625207,0.0012689874,0.00005967367,0.0000069614953,0.00007903419,0.033825677,0.000098405806,0.00024138333,0.94608796,0.0021675224,0.016135296],"study_design_scores_gemma":[0.000009307949,0.000042665746,0.0072027813,0.0007863531,0.00002523117,0.0007865155,0.06995604,0.000450934,0.00086522405,0.72839415,0.19144157,0.000039179373],"about_ca_topic_score_codex":0.0025456282,"about_ca_topic_score_gemma":0.0029358617,"teacher_disagreement_score":0.008304772,"about_ca_system_score_codex":0.0025109882,"about_ca_system_score_gemma":0.0023394367,"threshold_uncertainty_score":0.024182618},"labels":[],"label_agreement":null},{"id":"W3184919107","doi":"10.1007/978-3-030-81685-8_29","title":"Effective Hybrid System Falsification Using Monte Carlo Tree Search Guided by QB-Robustness","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"JST-Mirai Program; Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Robustness (evolution); Computer science; Tree traversal; Scalability; Computation; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.041068489676639376,"score_gpt":0.3003669894834916,"score_spread":0.2592984998068522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184919107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08716977,0.00028703705,0.9068879,0.00030760502,0.00003967283,0.00011081472,0.00009458511,0.0018795264,0.0032230506],"genre_scores_gemma":[0.8449983,0.000070069174,0.15351959,0.0001480034,0.000013976264,0.000115052964,0.00018472021,0.00016877163,0.00078146195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857974,0.0005161653,0.00006812396,0.00017814613,0.00047256163,0.00018532573],"domain_scores_gemma":[0.99467754,0.0038151722,0.00040586607,0.00036721042,0.0005811867,0.00015310572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020083713,0.0010111338,0.0013357074,0.0010129262,0.0006409688,0.001036459,0.0011277002,0.0010270738,0.0030413494],"category_scores_gemma":[0.0068151504,0.0004056223,0.0011707759,0.00053671,0.0014075896,0.0010221398,0.001338386,0.0011508057,0.00029415087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012599319,0.00004816894,0.0014398374,0.000098580764,0.00004085192,0.00011398462,0.000058128328,0.9626319,0.003810695,0.011216701,0.0004853541,0.01992994],"study_design_scores_gemma":[0.000007806573,0.000020552072,0.000055577082,0.0000050194503,0.000005310102,0.000009917029,0.0000061861,0.99643624,0.0007118424,0.002617421,0.000121231504,0.000002832665],"about_ca_topic_score_codex":0.0051563513,"about_ca_topic_score_gemma":0.0039575514,"teacher_disagreement_score":0.0051563513,"about_ca_system_score_codex":0.0011121485,"about_ca_system_score_gemma":0.0019727892,"threshold_uncertainty_score":0.0106214285},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W3185052987","doi":"10.1007/978-3-030-78462-1_9","title":"Machine-Human Interaction: A Paradigm Shift?","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.024324116627055022,"score_gpt":0.2896904527569267,"score_spread":0.26536633612987165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185052987","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004282906,0.17820187,0.106699355,0.40364817,0.03006166,0.00007019147,0.00025649127,0.00071603555,0.2760633],"genre_scores_gemma":[0.35635853,0.23260686,0.09528579,0.13856965,0.052571803,0.0007483506,0.0006216048,0.0012582031,0.12197916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618185,0.0017583903,0.00016443976,0.0005842883,0.001010022,0.00030098378],"domain_scores_gemma":[0.99429387,0.0032890753,0.00019553528,0.0005597542,0.00094495696,0.00071680173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074703987,0.0013266356,0.0018659604,0.0020816827,0.0020307968,0.014432386,0.0037385605,0.009149798,0.025783965],"category_scores_gemma":[0.0045491164,0.00056416664,0.00085236074,0.0023859504,0.01579647,0.034640912,0.0055958093,0.009215702,0.009161114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035131532,0.000062148756,0.00009536917,0.0005095058,0.00001618675,0.00005267876,0.00075754547,0.0001382967,0.00029090987,0.8973378,0.03620768,0.06449675],"study_design_scores_gemma":[0.000021508973,0.000051572646,0.00021467549,0.00061111135,0.000015774121,0.00035573763,0.001754708,0.0009189704,0.00021802224,0.6637874,0.33202365,0.000026786405],"about_ca_topic_score_codex":0.0012581103,"about_ca_topic_score_gemma":0.00150446,"teacher_disagreement_score":0.025783965,"about_ca_system_score_codex":0.0035395254,"about_ca_system_score_gemma":0.005330956,"threshold_uncertainty_score":0.08625591},"labels":[],"label_agreement":null},{"id":"W3185054184","doi":"10.1007/978-3-030-79987-8_6","title":"All Subgraphs of a Wheel Are 5-Coupled-Choosable","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Wheel graph; Computer science; Combinatorics; Planar graph; Treewidth; Vertex (graph theory); Graph; Discrete mathematics; Mathematics; Graph power; Pathwidth; Line graph","score_opus":0.024440167776545955,"score_gpt":0.27814393798431986,"score_spread":0.2537037702077739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185054184","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55250835,0.0005313633,0.15512466,0.0007224941,0.00042221174,0.0003965346,0.004855632,0.0013158004,0.284123],"genre_scores_gemma":[0.80537957,0.0005548383,0.054681513,0.00036811488,0.00006308337,0.00040441792,0.0058657457,0.0006881759,0.13199459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962425,0.000030559175,0.000018493602,0.00011316438,0.00007951364,0.00013402011],"domain_scores_gemma":[0.9993975,0.00015388125,0.00009033306,0.000108257525,0.00011587563,0.00013409826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015869038,0.00079118053,0.00072656956,0.0007461662,0.001284411,0.0016907398,0.0012947503,0.0008789523,0.028107008],"category_scores_gemma":[0.0006352727,0.0009210154,0.001155055,0.0010790583,0.00090827496,0.0016400394,0.0012361978,0.0012070806,0.0050854404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086028466,0.00024014553,0.0043539,0.0012150715,0.00025252797,0.0014181079,0.0011221309,0.012881806,0.081654586,0.7708841,0.028848201,0.09626911],"study_design_scores_gemma":[0.0002412056,0.00025615277,0.014366271,0.00026331787,0.0003907007,0.0019950343,0.0013582362,0.027580384,0.064946756,0.7673044,0.12115067,0.00014692498],"about_ca_topic_score_codex":0.0026788076,"about_ca_topic_score_gemma":0.0050448542,"teacher_disagreement_score":0.028107008,"about_ca_system_score_codex":0.0007852756,"about_ca_system_score_gemma":0.0006423184,"threshold_uncertainty_score":0.09402734},"labels":[],"label_agreement":null},{"id":"W3185067521","doi":"10.1007/978-3-030-81688-9_24","title":"Foundations of Fine-Grained Explainability","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Set (abstract data type); Process (computing); Theoretical computer science; Algorithm; Programming language","score_opus":0.09671984472921487,"score_gpt":0.35973997240083194,"score_spread":0.2630201276716171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185067521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02591223,0.0007648378,0.93431437,0.0022753016,0.000082602,0.00010552108,0.000317104,0.0010954589,0.03513261],"genre_scores_gemma":[0.73527586,0.0007694935,0.25378108,0.00048808724,0.00017174306,0.0003355592,0.0007153341,0.0003831888,0.008079657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973635,0.0007747207,0.00020233807,0.00061994797,0.0007717191,0.00026769008],"domain_scores_gemma":[0.9898218,0.005799482,0.0005404343,0.0028453246,0.00076264783,0.00023041229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035592827,0.00075827434,0.00059369375,0.0013674372,0.0010242127,0.0035381268,0.0018072374,0.0017321744,0.008305121],"category_scores_gemma":[0.012351493,0.0006344005,0.0017218458,0.00081647007,0.006655835,0.0076736445,0.0038111433,0.0025929825,0.0009400912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012827831,0.000014131219,0.000279136,0.00006776474,0.00001730505,0.000063751795,0.0002286539,0.008195595,0.00091899076,0.979486,0.0005498011,0.010166045],"study_design_scores_gemma":[0.000006497925,0.000010806975,0.0001656226,0.000017232021,0.000008329539,0.00003827596,0.000021711678,0.015316067,0.00071513286,0.98035276,0.0033387565,0.00000881177],"about_ca_topic_score_codex":0.0016565006,"about_ca_topic_score_gemma":0.0008823247,"teacher_disagreement_score":0.008305121,"about_ca_system_score_codex":0.0019922252,"about_ca_system_score_gemma":0.0011844509,"threshold_uncertainty_score":0.027783453},"labels":[],"label_agreement":null},{"id":"W3185285780","doi":"10.1007/978-3-030-78462-1_18","title":"Guidelines for Collecting Automatic Facial Expression Detection Data Synchronized with a Dynamic Stimulus in Remote Moderated User Tests","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"HEC Montréal","funders":"","keywords":"Computer science; Facial expression; Human–computer interaction; Stimulus (psychology); World Wide Web; Multimedia; Artificial intelligence; Psychology","score_opus":0.08416454091826556,"score_gpt":0.3687516818551751,"score_spread":0.2845871409369095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185285780","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.008212417,0.0008067038,0.93109226,0.0003431764,0.00022028557,0.009272304,0.008722569,0.02262194,0.018708272],"genre_scores_gemma":[0.017104348,0.0009306073,0.9160334,0.00064148824,0.0000939165,0.027403466,0.009152343,0.0033525482,0.02528786],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758506,0.0006285191,0.00038289727,0.00029447928,0.0009395774,0.00016944844],"domain_scores_gemma":[0.9924765,0.0030075873,0.00019067097,0.0011912403,0.0028623824,0.00027164962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037947798,0.0017444121,0.0011422231,0.0030253027,0.0010499576,0.0011222322,0.0034246726,0.0018843091,0.057804573],"category_scores_gemma":[0.009769261,0.0016132817,0.0007330013,0.0011129063,0.0004988703,0.00092490227,0.0012711157,0.0010322704,0.051192895],"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.0011910134,0.0009742694,0.005742199,0.0016269049,0.00007082039,0.0010768415,0.0006429446,0.0028664526,0.31306055,0.0040436685,0.10987173,0.5588326],"study_design_scores_gemma":[0.00059087184,0.0023258163,0.05129562,0.001913712,0.00022436194,0.005467512,0.0006791372,0.02736859,0.44373193,0.009782081,0.45621437,0.00040597806],"about_ca_topic_score_codex":0.0018592045,"about_ca_topic_score_gemma":0.007432815,"teacher_disagreement_score":0.057804573,"about_ca_system_score_codex":0.0003222008,"about_ca_system_score_gemma":0.00085518206,"threshold_uncertainty_score":0.19337553},"labels":[],"label_agreement":null},{"id":"W3185285983","doi":"10.1007/978-3-030-77750-0_39","title":"An Experiment on the Impact of Information on the Trust in Artificial Intelligence","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interpretability; Variety (cybernetics); Artificial intelligence; Respondent; Data science; Decision support system; Test (biology); Machine learning","score_opus":0.13082343985410547,"score_gpt":0.40807225700237254,"score_spread":0.2772488171482671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185285983","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.98927003,0.00014249508,0.0020718076,0.0006692378,0.0000950664,0.00017079606,0.0003205757,0.00005124009,0.0072088516],"genre_scores_gemma":[0.9951304,0.000060871247,0.0023276482,0.00012798408,0.000023993505,0.0001267401,0.00019625133,0.00002034627,0.001985697],"study_design_codex":"randomized_trial","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.9959037,0.0026805887,0.0002848981,0.00040167038,0.00053761736,0.00019155504],"domain_scores_gemma":[0.75204855,0.22873545,0.005068623,0.009001498,0.0024595154,0.002686409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006123292,0.00042903522,0.0004957989,0.0003112986,0.0006479658,0.0015748258,0.0009202983,0.0014978218,0.014991085],"category_scores_gemma":[0.056948196,0.00034290945,0.0004319151,0.00042211518,0.001487026,0.0028554911,0.0010148735,0.002354095,0.0010446724],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.2635534,0.116218984,0.10466671,0.0055578067,0.002605184,0.0021132934,0.0134925395,0.0714171,0.11531818,0.07234373,0.021330956,0.21138215],"study_design_scores_gemma":[0.040149655,0.20044458,0.1524108,0.0006726381,0.0030383347,0.0016548325,0.008883131,0.35173044,0.0811255,0.13268189,0.026502963,0.000705152],"about_ca_topic_score_codex":0.0018035029,"about_ca_topic_score_gemma":0.0009285047,"teacher_disagreement_score":0.014991085,"about_ca_system_score_codex":0.00071825495,"about_ca_system_score_gemma":0.00071456784,"threshold_uncertainty_score":0.050150156},"labels":[],"label_agreement":null},{"id":"W3185361098","doi":"10.1007/978-3-030-80387-2_10","title":"GPU Accelerated PMCMC Algorithm with System Dynamics Modelling","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health Research Topics","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Computer science; Markov chain Monte Carlo; Particle filter; Speedup; Monte Carlo method; Markov chain; Algorithm; Acceleration; General-purpose computing on graphics processing units; Bayesian probability; Theoretical computer science; Parallel computing; Artificial intelligence; Machine learning","score_opus":0.06867399086443807,"score_gpt":0.3466020641993704,"score_spread":0.2779280733349323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185361098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005647193,0.0005504948,0.97426176,0.00029831115,0.0003250944,0.000059972157,0.00018914366,0.0011732257,0.017494714],"genre_scores_gemma":[0.20589854,0.00051389873,0.76380455,0.000297635,0.00021144052,0.0003371204,0.00060843816,0.0008901766,0.027438225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998449,0.000029258474,0.0000058562837,0.000022238646,0.000080680606,0.000017026196],"domain_scores_gemma":[0.99960464,0.00017188568,0.00002324153,0.000052745327,0.00011837179,0.000029219967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303951,0.0005030456,0.0008422045,0.0003390767,0.00053130934,0.00092334376,0.0015750095,0.0014233679,0.012196637],"category_scores_gemma":[0.0014374712,0.00048242,0.0006041474,0.00064790255,0.00032474162,0.00059494696,0.00100654,0.0014721286,0.0030076783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007166903,0.000039267787,0.0002857083,0.00012790527,0.00004073982,0.00014437128,0.000059222293,0.906705,0.0020402854,0.016488114,0.008424072,0.06557366],"study_design_scores_gemma":[0.0000054807647,0.000004241508,0.00002192772,0.000004308002,0.000002189931,0.000014747895,0.0000032035123,0.99637836,0.00026275663,0.0011987223,0.0021020009,0.0000021393196],"about_ca_topic_score_codex":0.011779209,"about_ca_topic_score_gemma":0.011279631,"teacher_disagreement_score":0.012196637,"about_ca_system_score_codex":0.00048354128,"about_ca_system_score_gemma":0.0014890132,"threshold_uncertainty_score":0.040801764},"labels":[],"label_agreement":null},{"id":"W3185401111","doi":"10.1007/978-3-030-77820-0_5","title":"Principles for Designing an mHealth App for Participatory Research and Management of Chronic Pain","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo; Concordia University","funders":"","keywords":"Computer science; Psychological intervention; Psychosocial; mHealth; Applied psychology; Health care; Mindfulness; Sense of agency; Psychology; Knowledge management; Internet privacy; Nursing; Medicine; Social psychology; Psychotherapist","score_opus":0.30845030980497345,"score_gpt":0.4772368731339563,"score_spread":0.16878656332898284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185401111","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.001646187,0.00047824217,0.947361,0.0040050903,0.00020980707,0.0043839244,0.00016307224,0.0006238602,0.041128762],"genre_scores_gemma":[0.01017621,0.0003432017,0.97273976,0.00059212005,0.000016731445,0.0047973823,0.00005566828,0.00010992077,0.011169066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888742,0.007089088,0.000667489,0.0006217856,0.0023692427,0.00037829822],"domain_scores_gemma":[0.98927736,0.007829716,0.00025363732,0.00077903445,0.0014866814,0.0003735516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018276632,0.0013306951,0.0005213977,0.0015011223,0.0034589828,0.0057877186,0.0028605247,0.004046077,0.013277424],"category_scores_gemma":[0.0162176,0.0015994764,0.0011518992,0.0009922936,0.0062317196,0.0034380062,0.004108177,0.0044239424,0.0070345243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009184557,0.00045881417,0.0010461551,0.0022651982,0.000043537133,0.0007113332,0.047420517,0.0028769323,0.009350642,0.6077516,0.028914347,0.2990691],"study_design_scores_gemma":[0.00012821528,0.0003214595,0.0014485011,0.004051712,0.00007008499,0.0016277403,0.009838006,0.009692257,0.008055149,0.44515145,0.51949066,0.00012477902],"about_ca_topic_score_codex":0.0031967394,"about_ca_topic_score_gemma":0.009855225,"teacher_disagreement_score":0.018276632,"about_ca_system_score_codex":0.0018790434,"about_ca_system_score_gemma":0.005703162,"threshold_uncertainty_score":0.09665722},"labels":[],"label_agreement":null},{"id":"W3185412097","doi":"10.1007/978-3-030-81688-9_33","title":"Formally Validating a Practical Verification Condition Generator","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Correctness; Computer science; Soundness; Programming language; Generator (circuit theory); Certificate; Implementation; Control flow; Transformation (genetics); Theoretical computer science","score_opus":0.03547950934745849,"score_gpt":0.28419710335614384,"score_spread":0.24871759400868534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185412097","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.019293072,0.0000922259,0.9628146,0.0005627286,0.00015392217,0.00039840906,0.00019866686,0.008299342,0.0081870565],"genre_scores_gemma":[0.3330016,0.00020002229,0.6550856,0.00040625426,0.000083377476,0.00040879523,0.00071890076,0.0019189187,0.008176392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933616,0.0027406185,0.0003486064,0.00088120654,0.00214767,0.00052034965],"domain_scores_gemma":[0.9792879,0.013463449,0.00060423376,0.0038191937,0.002587224,0.00023797726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008450008,0.0006631453,0.0005302431,0.00094385754,0.00085745734,0.0029961232,0.0017676466,0.0018386137,0.010016001],"category_scores_gemma":[0.023711847,0.0006905036,0.00087525835,0.00049214275,0.003877573,0.0036245638,0.0029043036,0.002477886,0.0033308703],"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.00045125152,0.00040144764,0.0025899543,0.00077960273,0.00007515603,0.001296392,0.0014578522,0.07687826,0.0633062,0.6832654,0.017516121,0.15198232],"study_design_scores_gemma":[0.00037207015,0.00048555102,0.0006356164,0.00046664046,0.000100477475,0.0010883728,0.00023838607,0.36576474,0.28596082,0.21951832,0.12521759,0.0001513922],"about_ca_topic_score_codex":0.0013207789,"about_ca_topic_score_gemma":0.0010562475,"teacher_disagreement_score":0.010016001,"about_ca_system_score_codex":0.0015321879,"about_ca_system_score_gemma":0.0032140773,"threshold_uncertainty_score":0.044688404},"labels":[],"label_agreement":null},{"id":"W318551555","doi":"10.1007/978-3-662-43984-5_26","title":"A Hybrid Scale-Out Cloud-Based Data Service for Worldwide Sensors","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cloud computing; Scalability; Geospatial analysis; Computer science; Construct (python library); Search engine indexing; Distributed computing; Scale (ratio); Service (business); Architecture; Tree (set theory); Volume (thermodynamics); Data science; Database; Geography; Remote sensing; Computer network; World Wide Web; Cartography; Operating system","score_opus":0.031971041188222526,"score_gpt":0.2619694287126282,"score_spread":0.22999838752440566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W318551555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105459146,0.0014766967,0.8459711,0.0014818402,0.0009642955,0.00070704386,0.0010749171,0.018143278,0.024721585],"genre_scores_gemma":[0.82523113,0.000424354,0.15788822,0.0007525269,0.00027957433,0.00016421931,0.0013701614,0.0005131137,0.01337679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992582,0.00007078499,0.00003913061,0.00013496281,0.00031009363,0.00018692327],"domain_scores_gemma":[0.99940956,0.000062629064,0.000031582036,0.00017367901,0.00019853804,0.00012403002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065606483,0.00078169006,0.001009059,0.00068656163,0.0011331474,0.0016764953,0.0029312703,0.0009579253,0.007588774],"category_scores_gemma":[0.000991811,0.00032294443,0.00063025847,0.0017318199,0.00041771875,0.0021054298,0.0029145705,0.0008438211,0.0021805419],"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.0023387256,0.0013072253,0.006280489,0.00037067322,0.00024432247,0.0016662298,0.00046966583,0.0654676,0.14391299,0.027548056,0.107455075,0.64293903],"study_design_scores_gemma":[0.00016826249,0.00033997186,0.0028025343,0.000029385223,0.000076231976,0.0006697055,0.00036460004,0.92357785,0.02205896,0.011777429,0.03804855,0.000086586435],"about_ca_topic_score_codex":0.007239594,"about_ca_topic_score_gemma":0.0076868543,"teacher_disagreement_score":0.007588774,"about_ca_system_score_codex":0.0009855152,"about_ca_system_score_gemma":0.0013231031,"threshold_uncertainty_score":0.02538699},"labels":[],"label_agreement":null},{"id":"W3185579844","doi":"10.1007/978-3-030-82427-3_1","title":"A High-Resolution Model of the Human Entorhinal Cortex in the ‘BigBrain’ – Use Case for Machine Learning and 3D Analyses","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital; National Research Council Canada","funders":"Horizon 2020 Framework Programme; European Commission","keywords":"Entorhinal cortex; Computer science; Data set; Set (abstract data type); High resolution; Pattern recognition (psychology); Artificial intelligence; Visual cortex; Neuroscience; Hippocampus; Biology; Geology; Remote sensing","score_opus":0.028652243702726267,"score_gpt":0.3041817925893112,"score_spread":0.27552954888658493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185579844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38419214,0.001290256,0.5778337,0.0012691952,0.00011181328,0.00021626223,0.0028699941,0.0023662276,0.029850414],"genre_scores_gemma":[0.897811,0.00037338072,0.09441219,0.00006620528,0.000025684176,0.00009683332,0.0007505151,0.00028558067,0.006178678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992776,0.000019158408,0.000003539767,0.000018204373,0.000022044649,0.000009277105],"domain_scores_gemma":[0.9998994,0.00004610381,0.000007650479,0.00001657129,0.000018108312,0.00001214036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014339421,0.0003586496,0.00030175605,0.0003400025,0.0003101894,0.0011480417,0.0007265948,0.0010793379,0.0041605546],"category_scores_gemma":[0.00038120724,0.0002911618,0.0006057194,0.00025279794,0.0004797991,0.0002930047,0.00057011325,0.0002949754,0.0007302994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011701786,0.00005134852,0.002086003,0.00012918105,0.000057614823,0.001940585,0.00033332582,0.9439992,0.01921336,0.012763624,0.0027804319,0.016528206],"study_design_scores_gemma":[0.000013858064,0.000015872993,0.0011826468,0.000010402279,0.000006762131,0.00028361307,0.00003859321,0.9910779,0.0012892099,0.0033827075,0.0026871085,0.0000113276565],"about_ca_topic_score_codex":0.013987269,"about_ca_topic_score_gemma":0.010500862,"teacher_disagreement_score":0.013987269,"about_ca_system_score_codex":0.0004578027,"about_ca_system_score_gemma":0.00046470738,"threshold_uncertainty_score":0.027811706},"labels":[],"label_agreement":null},{"id":"W3185765993","doi":"10.1007/978-3-030-77277-2_8","title":"Persuasive Technology in Games: A Brief Review and Reappraisal","year":2021,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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; Wilfrid Laurier University","funders":"","keywords":"Persuasive technology; Computer science; Set (abstract data type); Field (mathematics); Work (physics); Government (linguistics); Game design; Game mechanics; Management science; Human–computer interaction; Data science; Persuasion; Psychology; Engineering; Social psychology","score_opus":0.028917958645230734,"score_gpt":0.35693347406170256,"score_spread":0.32801551541647184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185765993","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046794543,0.99949074,0.000065287786,0.000125613,0.00009463004,0.0000045444212,0.0000053855024,0.000002076118,0.0001648444],"genre_scores_gemma":[0.0005408935,0.998696,0.0001977927,0.0002525174,0.00016493339,0.000010532623,0.0000113608185,0.0000014002961,0.00012455454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927884,0.0001610156,0.00017480228,0.00012730557,0.0002071377,0.000050922834],"domain_scores_gemma":[0.9963092,0.002807196,0.00025682568,0.00005140267,0.0004690273,0.00010641601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023994881,0.0012621972,0.0027388209,0.004712844,0.00042074424,0.0026355141,0.0017139178,0.0026838956,0.0031629466],"category_scores_gemma":[0.0042502983,0.0007053219,0.001147465,0.0044727665,0.0010649784,0.0034280627,0.0011585646,0.0028456943,0.001442048],"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.00018064644,0.00018633118,0.00024446077,0.08528309,0.00027562949,0.00017347498,0.00020687211,0.00027270656,0.00086166145,0.0047151144,0.015430607,0.89216936],"study_design_scores_gemma":[0.00013495769,0.0005217978,0.0025867312,0.055316404,0.0013093498,0.0019684809,0.0004259937,0.00032694745,0.0010307593,0.0043930896,0.93188035,0.00010519702],"about_ca_topic_score_codex":0.0018722436,"about_ca_topic_score_gemma":0.0039917263,"teacher_disagreement_score":0.004712844,"about_ca_system_score_codex":0.0010726368,"about_ca_system_score_gemma":0.002564775,"threshold_uncertainty_score":0.0126898885},"labels":[],"label_agreement":null},{"id":"W3185817438","doi":"10.1007/978-3-030-78224-5_31","title":"Lessons Learned in Developing a Patient-Centered Website to Support Stroke Patients and Caregivers During Transitions of Care","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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":"HEC Montréal","funders":"","keywords":"Psychological intervention; Transitional care; Stakeholder; Intervention (counseling); Stroke (engine); Service (business); Nursing; Medicine; Medical education; Psychology; Public relations; Health care; Business; Political science; Engineering; Marketing","score_opus":0.02066967109494099,"score_gpt":0.27334514645236935,"score_spread":0.25267547535742835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185817438","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.17689382,0.016572082,0.2794032,0.081547484,0.008243087,0.0021231412,0.0006480889,0.00686222,0.42770696],"genre_scores_gemma":[0.17261615,0.013461563,0.5589474,0.010755558,0.0009389847,0.00087705604,0.0009778354,0.0012495915,0.24017587],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9988707,0.0006127127,0.00004417307,0.00006685308,0.0003111358,0.000094432726],"domain_scores_gemma":[0.9976078,0.001214781,0.00005723143,0.00010132625,0.0004429034,0.0005759238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002868274,0.00057402736,0.00027481286,0.00043965428,0.00083024165,0.0032402817,0.0012123175,0.0014616054,0.008328229],"category_scores_gemma":[0.0044398773,0.00025236016,0.0004243187,0.0004148732,0.00058504124,0.0032823232,0.0014174411,0.0019656548,0.0030937525],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068641224,0.002104262,0.0023111391,0.0010636629,0.000025917396,0.0024517677,0.011575159,0.0013157552,0.0043229065,0.00854958,0.15618393,0.8100273],"study_design_scores_gemma":[0.00012909996,0.0016381809,0.008692601,0.0027905186,0.000116734685,0.011395357,0.018266281,0.009578238,0.00842609,0.01633352,0.92248374,0.0001497123],"about_ca_topic_score_codex":0.0014001635,"about_ca_topic_score_gemma":0.004328289,"teacher_disagreement_score":0.008328229,"about_ca_system_score_codex":0.0006232644,"about_ca_system_score_gemma":0.0019119541,"threshold_uncertainty_score":0.027860701},"labels":[],"label_agreement":null},{"id":"W3185871609","doi":"10.1007/978-3-030-77750-0_18","title":"Mobile Wallet Adoption: Does Ubiquity Make a Difference?","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Popularity; Mobile payment; Computer science; Mobile device; Payment; Innovation diffusion; Internet privacy; Mobile commerce; Business; Computer security; World Wide Web; Knowledge management; Political science","score_opus":0.056927814973440245,"score_gpt":0.3311977437101498,"score_spread":0.2742699287367096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185871609","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.64636666,0.05154801,0.0021681415,0.064610556,0.0013170826,0.000045990255,0.00063724763,0.00006662144,0.23323971],"genre_scores_gemma":[0.97619516,0.0118489945,0.00049616117,0.0017180885,0.00049660634,0.000012115013,0.00014840177,0.000022112716,0.0090624755],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992981,0.00020383167,0.000033789387,0.000113043,0.00018365918,0.0001674799],"domain_scores_gemma":[0.99625444,0.0022883164,0.00070959964,0.00011514946,0.00029926005,0.00033324052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013923654,0.00026629984,0.0004369204,0.000849293,0.00060594257,0.004950935,0.0004937951,0.0018147988,0.017968321],"category_scores_gemma":[0.0063894195,0.00021372468,0.00040553202,0.0019890345,0.0011144616,0.00881432,0.00087822526,0.0017119307,0.0018686943],"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.00092585076,0.00076323753,0.21747422,0.0014434627,0.00031250194,0.0013577197,0.008614063,0.0004801753,0.0018806277,0.099429734,0.03616833,0.63115007],"study_design_scores_gemma":[0.00011640939,0.00077114324,0.68130636,0.0034648606,0.0006017586,0.0023484293,0.048603915,0.00278399,0.0015966739,0.09646902,0.16181043,0.00012705397],"about_ca_topic_score_codex":0.002194052,"about_ca_topic_score_gemma":0.0037369006,"teacher_disagreement_score":0.017968321,"about_ca_system_score_codex":0.0005678139,"about_ca_system_score_gemma":0.0005912661,"threshold_uncertainty_score":0.060110033},"labels":[],"label_agreement":null},{"id":"W3185895498","doi":"10.1007/978-3-030-81685-8_39","title":"Counterexample-Guided Partial Bounding for Recursive Function Synthesis","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Bounding overwatch; Counterexample; Computer science; μ operator; Function (biology); Primitive recursive function; Set (abstract data type); Recursive functions; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.06086517328587813,"score_gpt":0.3070521637342828,"score_spread":0.24618699044840467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185895498","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.052306805,0.00040352065,0.9343275,0.00015872568,0.000052981297,0.00006558854,0.00007036857,0.003155202,0.009459248],"genre_scores_gemma":[0.5937921,0.0003101084,0.39990896,0.00014281026,0.000023523291,0.00017280175,0.00024156067,0.0008173755,0.0045908326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988973,0.00037266768,0.00007284805,0.0001688336,0.00035012813,0.00013817975],"domain_scores_gemma":[0.9978771,0.0013610359,0.00010292701,0.00045341867,0.00016403297,0.000041454772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012634763,0.0007894397,0.0007262231,0.0008075983,0.0005270796,0.0013024248,0.0010836977,0.00074146985,0.0035304555],"category_scores_gemma":[0.0031076963,0.00035271692,0.000611979,0.00049341115,0.0016820959,0.0014246934,0.0015009686,0.0011754496,0.00062219345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037059793,0.0001921897,0.0011687697,0.00058284006,0.0000679173,0.00058259716,0.0006847571,0.1831318,0.112891145,0.43387148,0.004235533,0.26222035],"study_design_scores_gemma":[0.00003918587,0.00014503981,0.00019850263,0.00010671895,0.000062919586,0.0003035852,0.00007613365,0.6793428,0.16449068,0.13354677,0.02164676,0.000040855342],"about_ca_topic_score_codex":0.0010020545,"about_ca_topic_score_gemma":0.0013085876,"teacher_disagreement_score":0.0035304555,"about_ca_system_score_codex":0.00084438646,"about_ca_system_score_gemma":0.00083372864,"threshold_uncertainty_score":0.011810482},"labels":[],"label_agreement":null},{"id":"W3186128878","doi":"10.1007/978-3-030-78111-8_9","title":"A Goal Oriented Storytelling Model for Improvement of Health Game Experiences Among Older Adults","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Coaching; Storytelling; GSM; Session (web analytics); Persuasion; Psychology; Set (abstract data type); Multimedia; Applied psychology; Computer science; Social psychology; Psychotherapist; Telecommunications","score_opus":0.016019809572913764,"score_gpt":0.2787800362692811,"score_spread":0.26276022669636734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186128878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44266024,0.0009100247,0.4619773,0.0017682808,0.0001398099,0.0017740187,0.0006413032,0.0034656504,0.086663306],"genre_scores_gemma":[0.73451394,0.0005406202,0.24945495,0.00021100773,0.000015026143,0.0012580343,0.0004931991,0.00008780355,0.013425469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980396,0.00009165104,0.000009017391,0.00003530882,0.00004255273,0.000017483433],"domain_scores_gemma":[0.9995347,0.00030334597,0.0000328942,0.00002441838,0.000049482198,0.00005514524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043799717,0.0005126758,0.00014952598,0.00036959333,0.00020980627,0.0008420997,0.0009290826,0.00047827765,0.0050697974],"category_scores_gemma":[0.0012713269,0.00012717479,0.0002883721,0.0001855464,0.0001758116,0.0006688387,0.00051098265,0.00048160058,0.0006206651],"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.0009819488,0.008769519,0.0088645425,0.0011341947,0.00013910995,0.0004118556,0.010956239,0.022389041,0.03658411,0.045701254,0.016943812,0.8471245],"study_design_scores_gemma":[0.0014234228,0.008729332,0.06221433,0.0010594709,0.00095389265,0.0012382471,0.0111576505,0.6894278,0.03723039,0.06869887,0.117641136,0.00022545739],"about_ca_topic_score_codex":0.0013420678,"about_ca_topic_score_gemma":0.0025207743,"teacher_disagreement_score":0.0050697974,"about_ca_system_score_codex":0.00036839172,"about_ca_system_score_gemma":0.0005887294,"threshold_uncertainty_score":0.016960144},"labels":[],"label_agreement":null},{"id":"W3186196535","doi":"10.1007/978-3-030-78221-4_14","title":"Is Your App Conducive to Behaviour Change? A Novel Heuristic Evaluation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Usability; Heuristic evaluation; Heuristic; Computer science; Digital health; Product (mathematics); Human–computer interaction; Health care; Artificial intelligence","score_opus":0.1795247261767964,"score_gpt":0.4300696981910363,"score_spread":0.25054497201423986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186196535","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.7537537,0.0026762274,0.09068865,0.003561655,0.00079277175,0.013004768,0.0011309524,0.0003948394,0.1339964],"genre_scores_gemma":[0.89710927,0.00065666146,0.089238025,0.0006096782,0.00006364593,0.0045641824,0.00034204626,0.0000472874,0.007369196],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9916794,0.0060077724,0.0003798132,0.0003605769,0.0013452814,0.00022708856],"domain_scores_gemma":[0.9325366,0.060935363,0.0010610799,0.0015214125,0.0030079097,0.0009375666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009022552,0.0007855567,0.00062404195,0.0014695072,0.0012654798,0.0029737528,0.0010565227,0.0015401645,0.013074341],"category_scores_gemma":[0.05185562,0.00027649564,0.000602888,0.0008378712,0.0014330914,0.0027807506,0.001524925,0.0011740918,0.0007756027],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016219415,0.017751621,0.0141445715,0.006770294,0.00044994475,0.00040343692,0.012060781,0.0049770307,0.0051834257,0.099007234,0.014084434,0.8089478],"study_design_scores_gemma":[0.01851005,0.13007553,0.06867278,0.011313193,0.0053914622,0.0021935564,0.085494265,0.23298045,0.03585346,0.2573934,0.15112069,0.0010012217],"about_ca_topic_score_codex":0.001476123,"about_ca_topic_score_gemma":0.0024278888,"teacher_disagreement_score":0.013074341,"about_ca_system_score_codex":0.0013337918,"about_ca_system_score_gemma":0.0019920906,"threshold_uncertainty_score":0.04771638},"labels":[],"label_agreement":null},{"id":"W3186439195","doi":"10.1007/978-3-030-88708-7_1","title":"Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Type-2 fuzzy sets and systems; Fuzzy number; Fuzzy set operations; Discrete mathematics; Fuzzy classification; Membership function; Fuzzy logic; Fuzzy set; Fuzzy mathematics; Hierarchy; Theoretical computer science; Artificial intelligence; Computer science","score_opus":0.0174014376128767,"score_gpt":0.26071349960057194,"score_spread":0.24331206198769523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186439195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09814557,0.0065727443,0.85815716,0.0035671957,0.0001829213,0.000050422906,0.00021657284,0.00020790753,0.032899477],"genre_scores_gemma":[0.88674647,0.0022250267,0.10511445,0.0002748339,0.00026284374,0.000046072106,0.00023082212,0.000056841403,0.0050427034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649894,0.0011152793,0.00018510083,0.00032186275,0.001546312,0.00033248446],"domain_scores_gemma":[0.9951565,0.0029206108,0.00037078533,0.00070722884,0.00062587723,0.00021885935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045246673,0.0005049177,0.0018969562,0.0022754788,0.0013306083,0.004162519,0.0018394224,0.0015856728,0.003089172],"category_scores_gemma":[0.017320568,0.000586955,0.0013436185,0.0022898111,0.003411451,0.007117788,0.0029123928,0.0032818005,0.00035979666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009119768,0.00002724643,0.00053383585,0.000120834586,0.0000543988,0.00005885392,0.00037237426,0.037840195,0.00055879477,0.93037045,0.0011735454,0.028798228],"study_design_scores_gemma":[0.00001267819,0.000016014603,0.00019016134,0.000027949494,0.000015147781,0.000028428998,0.00008659973,0.113917634,0.00019258262,0.88417655,0.0013263556,0.000009817635],"about_ca_topic_score_codex":0.0068012574,"about_ca_topic_score_gemma":0.004749638,"teacher_disagreement_score":0.0068012574,"about_ca_system_score_codex":0.0035970188,"about_ca_system_score_gemma":0.0012583325,"threshold_uncertainty_score":0.026098311},"labels":[],"label_agreement":null},{"id":"W3186464624","doi":"10.1007/978-3-030-77750-0_7","title":"Augmented Reality: Does It Encourage Customer Loyalty?","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"Loyalty; Beauty; Advertising; Augmented reality; Value (mathematics); Loyalty business model; Computer science; Brand loyalty; Business; Service (business); Marketing; Service quality; Internet privacy; Human–computer interaction; Aesthetics","score_opus":0.06951746084826063,"score_gpt":0.3537851324538558,"score_spread":0.2842676716055952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186464624","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.75994563,0.025728479,0.014069945,0.017964559,0.0014441414,0.00007530987,0.00019336813,0.00019219903,0.18038641],"genre_scores_gemma":[0.9741356,0.0045022373,0.0037101363,0.0009186082,0.0002608001,0.000025867268,0.00006091834,0.000023467172,0.016362313],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992405,0.00036935825,0.000028001425,0.00006819356,0.00020059092,0.00009334556],"domain_scores_gemma":[0.9965932,0.0024641072,0.00035706782,0.00017549196,0.00025276988,0.00015732109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011040322,0.00030650274,0.00032158796,0.00042034176,0.00044290975,0.004565468,0.0007101748,0.0015110789,0.021296175],"category_scores_gemma":[0.0053894296,0.00024165981,0.00038522537,0.00075608364,0.0007464382,0.0033933406,0.0009452628,0.001066826,0.0017298886],"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.0019763848,0.0008764703,0.027620556,0.0008790008,0.00022895623,0.0003408368,0.00409074,0.00087181857,0.0034133045,0.029997578,0.020814342,0.90889007],"study_design_scores_gemma":[0.0007980364,0.00933868,0.4262562,0.004897264,0.0026126835,0.007871497,0.05487068,0.0481271,0.020584168,0.13528976,0.28863165,0.00072227063],"about_ca_topic_score_codex":0.0012857047,"about_ca_topic_score_gemma":0.0025353127,"teacher_disagreement_score":0.021296175,"about_ca_system_score_codex":0.00037524538,"about_ca_system_score_gemma":0.000370757,"threshold_uncertainty_score":0.07124281},"labels":[],"label_agreement":null},{"id":"W3186525817","doi":"10.1007/978-3-030-80209-7_52","title":"Projections with Logarithmic Divergences","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exponential family; Logarithm; Divergence (linguistics); Statistical manifold; Manifold (fluid mechanics); Mathematics; Information geometry; Foliation (geology); Exponential function; Pure mathematics; Curvature; Bregman divergence; Combinatorics; Mathematical analysis; Geometry; Scalar curvature; Applied mathematics","score_opus":0.01725900388395399,"score_gpt":0.2235685066444627,"score_spread":0.20630950276050872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186525817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027072364,0.0025584905,0.8334361,0.0034471438,0.0012123154,0.00010188571,0.001039367,0.0017404878,0.12939186],"genre_scores_gemma":[0.49366996,0.005405624,0.29608747,0.0027445885,0.0026490237,0.00075300114,0.0042952714,0.0041720327,0.19022302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784684,0.0007708537,0.00011456243,0.000402767,0.0006412469,0.00022373277],"domain_scores_gemma":[0.9930528,0.0039363266,0.00034842655,0.0010473818,0.0009913688,0.00062379433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026396762,0.0018795013,0.0013291789,0.002670216,0.0013480104,0.0036739346,0.0016672092,0.0015448218,0.027867086],"category_scores_gemma":[0.019362569,0.0008409727,0.0014370764,0.0026393912,0.0029933425,0.007338778,0.0066918842,0.0067489394,0.008131463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008095295,0.00003533343,0.0002340399,0.00008987316,0.000017430419,0.000066212655,0.00010197987,0.004293407,0.00065882225,0.9451606,0.012327499,0.03693376],"study_design_scores_gemma":[0.000009753899,0.000012736146,0.00007516603,0.000019347082,0.0000050351714,0.00008433993,0.000017355898,0.014960345,0.00036980942,0.9788142,0.005621998,0.000009817958],"about_ca_topic_score_codex":0.0008170845,"about_ca_topic_score_gemma":0.00061447424,"teacher_disagreement_score":0.027867086,"about_ca_system_score_codex":0.001507511,"about_ca_system_score_gemma":0.0010001904,"threshold_uncertainty_score":0.093224645},"labels":[],"label_agreement":null},{"id":"W3186619231","doi":"10.1007/978-3-030-80879-2_4","title":"Online Coloring and a New Type of Adversary for Online Graph Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"McGill University; Concordia University; Université de Montréal","funders":"","keywords":"Adversary; Bipartite graph; Parameterized complexity; Combinatorics; Computer science; Bounded function; Mathematics; Discrete mathematics; Graph; Theoretical computer science; Computer security","score_opus":0.0589688178431416,"score_gpt":0.2940742975132717,"score_spread":0.2351054796701301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186619231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010534443,0.00069143344,0.9410013,0.0018055061,0.000773171,0.00013803238,0.00022710688,0.0005343335,0.044294562],"genre_scores_gemma":[0.38622317,0.00251564,0.49238607,0.0023526046,0.003127288,0.0007535309,0.000684426,0.00086711854,0.11109025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599165,0.0014398101,0.0001328781,0.00078504207,0.0011461688,0.0005045822],"domain_scores_gemma":[0.98849386,0.0067540267,0.00044630535,0.003036208,0.000595359,0.00067430787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029900784,0.0019049521,0.0017063121,0.0011536201,0.0019341247,0.0040740534,0.00583475,0.0041081733,0.009704471],"category_scores_gemma":[0.00972391,0.0011204717,0.0024508701,0.0025231468,0.004138342,0.009409869,0.0052615735,0.01050499,0.0017900306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017284934,0.00015547637,0.00030268668,0.00016870105,0.000043672826,0.0001341116,0.00014364521,0.0408106,0.002479453,0.90732706,0.01454976,0.03371204],"study_design_scores_gemma":[0.00004232201,0.00008678159,0.00014014973,0.000034714376,0.00003929702,0.00025400185,0.000038863727,0.22690393,0.0013744521,0.7516643,0.019389173,0.000032073505],"about_ca_topic_score_codex":0.00076642935,"about_ca_topic_score_gemma":0.0013509246,"teacher_disagreement_score":0.009704471,"about_ca_system_score_codex":0.0026958135,"about_ca_system_score_gemma":0.0018107117,"threshold_uncertainty_score":0.032464683},"labels":[],"label_agreement":null},{"id":"W3186687041","doi":"10.1007/978-3-030-78111-8_1","title":"The Belief in Health Benefits of Digital Play Modulates Physiological Responses to Games: A Repeated-Measures Quantitative Study of Game Stress in Older Adults Playing Different Game Genres","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","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":"Concordia University","funders":"","keywords":"Computer science; Game play; Stress (linguistics); Game theory; Human–computer interaction; Multimedia; Mathematical economics; Mathematics","score_opus":0.037194811092659215,"score_gpt":0.32374957281609673,"score_spread":0.2865547617234375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186687041","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.9992668,0.00004517641,0.00014528888,0.000011941107,0.000004896028,0.000031467498,0.00006423864,0.0000024172002,0.00042782468],"genre_scores_gemma":[0.99747723,0.00007873907,0.0005516785,0.000059503713,0.000011151686,0.000123305,0.00012828909,0.0000033484964,0.0015667469],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998235,0.000039883296,0.000012336583,0.00005282202,0.000048764407,0.000022715261],"domain_scores_gemma":[0.9993407,0.00027482718,0.00013517802,0.000054079894,0.0000837078,0.00011139755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043326066,0.00040858221,0.00033084402,0.00019375667,0.0002940516,0.00063023745,0.000267468,0.0005530445,0.0015758435],"category_scores_gemma":[0.0018667732,0.00043301997,0.00021846443,0.00014668213,0.0003576463,0.00022633313,0.00035651747,0.00079868047,0.0003343041],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007389321,0.024796294,0.74100333,0.00032824278,0.00076842785,0.0004115615,0.019442989,0.00043467275,0.15819387,0.00034522856,0.0009174219,0.04596869],"study_design_scores_gemma":[0.000043217417,0.0022227028,0.99548787,0.0000065612767,0.000038467777,0.00008535174,0.0007118757,0.00016272641,0.0009672736,0.000046195815,0.00021919963,0.000008592478],"about_ca_topic_score_codex":0.0020387706,"about_ca_topic_score_gemma":0.0038525756,"teacher_disagreement_score":0.0020387706,"about_ca_system_score_codex":0.00016607963,"about_ca_system_score_gemma":0.00011952675,"threshold_uncertainty_score":0.0052717924},"labels":[],"label_agreement":null},{"id":"W3186762121","doi":"10.1007/978-3-030-79463-7_47","title":"A ML-Based Stock Trading Model for Profit Predication","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Brandon University","funders":"","keywords":"Futures contract; Computer science; Stock (firearms); Profit (economics); Trading strategy; Convolutional neural network; Econometrics; Artificial intelligence; Finance; Economics; Microeconomics","score_opus":0.1614263243761809,"score_gpt":0.39205843750770303,"score_spread":0.23063211313152213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186762121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013575885,0.0004813606,0.98202676,0.00022701094,0.00009514516,0.00002688798,0.00020743595,0.0015401423,0.001819318],"genre_scores_gemma":[0.76922894,0.00053780264,0.21854107,0.0003396088,0.00030499263,0.00022735335,0.0008340067,0.00026439532,0.009721757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997452,0.0000649803,0.000022451217,0.000070159556,0.00007092559,0.000026310185],"domain_scores_gemma":[0.9992207,0.0004935976,0.00003905473,0.000055791683,0.00016604141,0.00002472494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008011776,0.0005589832,0.0012420216,0.00045763038,0.00032637635,0.0013941567,0.0015345657,0.0010721255,0.004151699],"category_scores_gemma":[0.0020496617,0.0004883245,0.00066614087,0.00064779574,0.00033200235,0.001404728,0.0008414171,0.0013037372,0.001675901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018790802,0.000097783544,0.0006062987,0.000058455582,0.000088672714,0.00006430525,0.000023861521,0.84051234,0.003996322,0.0038872287,0.0016997794,0.14877696],"study_design_scores_gemma":[0.000002391849,0.000005293422,0.000034232144,8.803946e-7,0.0000035760531,0.000003108633,4.7382707e-7,0.99923396,0.00015994793,0.00047950068,0.000075025375,0.0000016047061],"about_ca_topic_score_codex":0.0057215355,"about_ca_topic_score_gemma":0.0050781886,"teacher_disagreement_score":0.0057215355,"about_ca_system_score_codex":0.00051991805,"about_ca_system_score_gemma":0.0006724951,"threshold_uncertainty_score":0.013888836},"labels":[],"label_agreement":null},{"id":"W318854254","doi":"10.1007/978-3-319-11915-1_23","title":"Linked Open Data Driven Game Generation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Battle; Terrain; Cultural heritage; Data modeling; Video game development; Data science; Human–computer interaction; Game design; Database; Cartography; History; Archaeology; Geography","score_opus":0.08224342505436458,"score_gpt":0.30292433035260197,"score_spread":0.2206809052982374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W318854254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026731627,0.00013852715,0.93608993,0.00027149005,0.00020951834,0.00053290697,0.0013216117,0.012524067,0.022180326],"genre_scores_gemma":[0.46273768,0.00015949114,0.5049694,0.0002381089,0.00004270788,0.00096418476,0.0054845694,0.0019217595,0.023482112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.00013751267,0.00002525987,0.000115426265,0.00028552147,0.000068559544],"domain_scores_gemma":[0.9988487,0.0005952109,0.000025249088,0.00019964104,0.00026832017,0.000062910134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087176973,0.0006216944,0.0003815372,0.0009357839,0.00053744076,0.0014961326,0.0020288755,0.0009050338,0.014978712],"category_scores_gemma":[0.004092648,0.000335369,0.0007448259,0.00069896335,0.0005409427,0.0014332688,0.0026067845,0.0011015272,0.002856765],"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.0006396125,0.00088610174,0.002601744,0.00034185045,0.00011119426,0.00060420256,0.000658287,0.19732282,0.014137976,0.09939146,0.0462271,0.6370777],"study_design_scores_gemma":[0.00007398382,0.00006976661,0.00030135395,0.00003070168,0.000019399387,0.000102228034,0.000114270064,0.90914845,0.00888742,0.060993005,0.020234803,0.000024668414],"about_ca_topic_score_codex":0.0022954273,"about_ca_topic_score_gemma":0.0031712942,"teacher_disagreement_score":0.014978712,"about_ca_system_score_codex":0.0006370413,"about_ca_system_score_gemma":0.0007329859,"threshold_uncertainty_score":0.05010879},"labels":[],"label_agreement":null},{"id":"W3188841658","doi":"10.1007/978-3-030-84522-3_11","title":"A Comparable Study on Dimensionality Reduction Methods for Endmember Extraction","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","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":"Concordia University","funders":"","keywords":"Endmember; Hyperspectral imaging; Dimensionality reduction; Principal component analysis; Pattern recognition (psychology); Artificial intelligence; Computer science; Curse of dimensionality; Feature extraction; Extraction (chemistry); Mathematics; Chromatography; Chemistry","score_opus":0.063088422999893,"score_gpt":0.3597475841231494,"score_spread":0.2966591611232564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188841658","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.07500926,0.022847587,0.8678785,0.00087451376,0.0010658306,0.0003876725,0.0007012596,0.00097260077,0.030262861],"genre_scores_gemma":[0.2401782,0.019369485,0.6633344,0.0006672779,0.0012589536,0.0002756056,0.0035508336,0.00078100123,0.07058426],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878937,0.00028535738,0.00009011354,0.00026019328,0.0005176476,0.000057227564],"domain_scores_gemma":[0.99693966,0.0014846842,0.00006186544,0.0006627246,0.00081425154,0.000036812573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011325042,0.0008126179,0.0010973107,0.0016620109,0.0008272306,0.0016178117,0.00061961275,0.00070093625,0.0060901595],"category_scores_gemma":[0.004300286,0.00023608156,0.001315037,0.002498877,0.00051564083,0.0021066163,0.00079361565,0.00078359514,0.002231648],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034730273,0.0003786953,0.0014154129,0.00093841885,0.00022494896,0.00013665148,0.00024258312,0.009965719,0.04950752,0.010674875,0.010879218,0.91528857],"study_design_scores_gemma":[0.000102788574,0.0017539414,0.033084717,0.00053428713,0.00066085736,0.0024616732,0.0010795805,0.5472917,0.19479352,0.028517798,0.18945256,0.00026653652],"about_ca_topic_score_codex":0.0026741363,"about_ca_topic_score_gemma":0.003446513,"teacher_disagreement_score":0.0060901595,"about_ca_system_score_codex":0.00042406743,"about_ca_system_score_gemma":0.00045778003,"threshold_uncertainty_score":0.020373642},"labels":[],"label_agreement":null},{"id":"W3189794101","doi":"10.1007/978-3-030-87722-4_10","title":"Cohort Bias Adaptation in Aggregated Datasets for Lesion Segmentation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"NeuroRx Research (Canada); McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Generalizability theory; Pooling; Cohort; Artificial intelligence; Normalization (sociology); Computer science; Machine learning; Segmentation; Statistics; Mathematics","score_opus":0.055550809972475176,"score_gpt":0.3125225474226076,"score_spread":0.2569717374501324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189794101","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.2819962,0.008307226,0.680676,0.0026523385,0.0014770092,0.00077477284,0.011325233,0.009632236,0.0031590373],"genre_scores_gemma":[0.8143675,0.001549037,0.14770193,0.0010746823,0.0009070553,0.0007499338,0.025205962,0.0014923179,0.006951578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99307406,0.0034695005,0.0003383044,0.0020764014,0.00060962886,0.0004320149],"domain_scores_gemma":[0.9763001,0.012408373,0.0010402221,0.0072551486,0.0023524542,0.00064359617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027939128,0.001384233,0.0023529227,0.0020498498,0.0013764447,0.0027687636,0.0029488155,0.0032552397,0.003638937],"category_scores_gemma":[0.049486913,0.0010420261,0.003356746,0.0021468613,0.0011556899,0.0017629326,0.0035619896,0.0029095626,0.0021638144],"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.0044612065,0.00084045925,0.17198184,0.0009827041,0.0068711187,0.0008838304,0.0010262844,0.20313808,0.01650016,0.011947638,0.06506064,0.51630604],"study_design_scores_gemma":[0.00031713478,0.00063866586,0.04272928,0.00027326253,0.001561464,0.0009231886,0.00028429335,0.88806117,0.011485433,0.034270022,0.019285085,0.00017109729],"about_ca_topic_score_codex":0.0123577425,"about_ca_topic_score_gemma":0.018125387,"teacher_disagreement_score":0.027939128,"about_ca_system_score_codex":0.0011712534,"about_ca_system_score_gemma":0.003205724,"threshold_uncertainty_score":0.147758},"labels":[],"label_agreement":null},{"id":"W3190367304","doi":"10.1007/978-3-030-83508-8_30","title":"Fair Correlation Clustering with Global and Local Guarantees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Mathematics; Combinatorics; Correlation; Partition (number theory); Correlation clustering; Similarity (geometry); k-medians clustering; Constant (computer programming); Statistics; CURE data clustering algorithm; Artificial intelligence; Computer science; Geometry","score_opus":0.01671011317613314,"score_gpt":0.20613986428411818,"score_spread":0.18942975110798504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190367304","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.04296941,0.00067382463,0.9276673,0.001379552,0.00016286533,0.00012824913,0.0002908482,0.0007209733,0.026007002],"genre_scores_gemma":[0.8224307,0.000633003,0.12796803,0.0005835987,0.0004747869,0.000339834,0.00041935692,0.0005029649,0.04664784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632215,0.0013226434,0.00010905639,0.0008148146,0.00082829193,0.0006031118],"domain_scores_gemma":[0.9762947,0.0123197,0.0012543111,0.0069485563,0.0017756871,0.0014071591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005865831,0.00098011,0.003011205,0.0015192118,0.0024652763,0.0041545704,0.004401598,0.0032000958,0.010746355],"category_scores_gemma":[0.02816866,0.0009746709,0.001236369,0.0028702945,0.0042828606,0.005418755,0.0042217257,0.0034258298,0.0017881546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014495806,0.000045181958,0.00028435705,0.000059430564,0.00003643163,0.000044006116,0.00008928563,0.08524972,0.00062522857,0.88990164,0.0068389974,0.016680703],"study_design_scores_gemma":[0.000035718713,0.000029841425,0.00019847468,0.0000148288955,0.000014773197,0.000045135203,0.00002776163,0.22865222,0.0005008415,0.7685333,0.0019255134,0.00002156602],"about_ca_topic_score_codex":0.0021520671,"about_ca_topic_score_gemma":0.0029194439,"teacher_disagreement_score":0.010746355,"about_ca_system_score_codex":0.0032327748,"about_ca_system_score_gemma":0.0029091423,"threshold_uncertainty_score":0.035950184},"labels":[],"label_agreement":null},{"id":"W3191242629","doi":"10.1007/978-3-030-89240-1_6","title":"Evacuating from $$\\ell _p$$ Unit Disks in the Wireless Model","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Unit disk; Homogeneous space; Metric (unit); Metric space; Combinatorics; Mathematics; Circumference; Upper and lower bounds; Regular polygon; Euclidean space; Type (biology); Unit (ring theory); Chord (peer-to-peer); Unit sphere; Euclidean geometry; Wireless; Space (punctuation); Computer science; Discrete mathematics; Geometry; Mathematical analysis; Engineering; Distributed computing","score_opus":0.05171197795241873,"score_gpt":0.30831687088632176,"score_spread":0.25660489293390304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191242629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38830885,0.0040289136,0.45812595,0.028461624,0.0012929849,0.00024967958,0.0034497392,0.0007301851,0.115352154],"genre_scores_gemma":[0.9115784,0.0024979198,0.010465539,0.000876915,0.00040600126,0.00019326585,0.00059757195,0.00028806578,0.07309632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891436,0.00035634966,0.000038783946,0.0002024236,0.00011987153,0.00036816666],"domain_scores_gemma":[0.9958443,0.002135641,0.000519661,0.00033900878,0.00031249752,0.0008489841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014102559,0.0013364593,0.002307952,0.0010724498,0.0021595992,0.004423617,0.0056818514,0.0043469034,0.02239356],"category_scores_gemma":[0.007696831,0.0010837612,0.0011432013,0.0015990281,0.002891013,0.010022191,0.0039155246,0.0029930994,0.0027054688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039376647,0.00016681847,0.0010035412,0.00020356661,0.00004832388,0.00056020316,0.00038054524,0.2941267,0.00057282386,0.67685604,0.017766068,0.007921591],"study_design_scores_gemma":[0.00011817013,0.00012175218,0.00037017764,0.000071110546,0.0000419249,0.00027111446,0.0006294268,0.7038492,0.0002701193,0.2900447,0.0041519515,0.000060281593],"about_ca_topic_score_codex":0.010491937,"about_ca_topic_score_gemma":0.0060766577,"teacher_disagreement_score":0.02239356,"about_ca_system_score_codex":0.0017528146,"about_ca_system_score_gemma":0.0014805674,"threshold_uncertainty_score":0.07491392},"labels":[],"label_agreement":null},{"id":"W3191911242","doi":"10.1007/978-3-030-84060-0_19","title":"On the Trustworthiness of Tree Ensemble Explainability Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Georgian College","funders":"","keywords":"Computer science; Feature (linguistics); Stability (learning theory); Trustworthiness; Machine learning; Tree (set theory); Focus (optics); Artificial intelligence; Variety (cybernetics); Measure (data warehouse); Ensemble learning; Random forest; Data mining; Noise (video); Computer security; Mathematics","score_opus":0.04130715168566368,"score_gpt":0.3148927649232393,"score_spread":0.27358561323757563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191911242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050947748,0.002723382,0.9380016,0.0015505493,0.00015830428,0.00009976149,0.00022656434,0.00038171216,0.005910394],"genre_scores_gemma":[0.7669291,0.0015852607,0.22606122,0.0005150887,0.0007483565,0.0002501293,0.0008497877,0.00042355477,0.0026376036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9799492,0.01200057,0.0009714503,0.0019366174,0.004622808,0.0005193701],"domain_scores_gemma":[0.6458458,0.3215289,0.006140231,0.015601142,0.009394127,0.0014897918],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.031514846,0.0011484666,0.0020019049,0.003568869,0.0014624839,0.0029800422,0.0023619249,0.002669915,0.0033494127],"category_scores_gemma":[0.18558657,0.0008079265,0.0020626935,0.0022307276,0.0034527343,0.007046079,0.00410058,0.0053161345,0.00046782877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008763492,0.00017853841,0.016220551,0.00059394585,0.00089478027,0.0002177873,0.00092485966,0.4208955,0.001972101,0.3138293,0.005829255,0.23756702],"study_design_scores_gemma":[0.000026487862,0.00007708837,0.0011643878,0.00010571436,0.000058868874,0.000046277357,0.000048522495,0.8199039,0.00060808606,0.17718758,0.0007556596,0.00001745273],"about_ca_topic_score_codex":0.002870719,"about_ca_topic_score_gemma":0.0022378317,"teacher_disagreement_score":0.9684852,"about_ca_system_score_codex":0.0020564897,"about_ca_system_score_gemma":0.001330837,"threshold_uncertainty_score":0.16666842},"labels":[],"label_agreement":null},{"id":"W3193102863","doi":"10.1007/978-3-030-83508-8_43","title":"A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Guelph","funders":"","keywords":"Multiset; Concatenation (mathematics); Combinatorics; Mathematics; Discrete mathematics; Fixed point; Binary number; Computer science; Arithmetic","score_opus":0.02066918100351257,"score_gpt":0.24744158913076997,"score_spread":0.2267724081272574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193102863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0661751,0.005259978,0.5184874,0.001380971,0.0032274735,0.0004631836,0.0014883527,0.0017500432,0.40176743],"genre_scores_gemma":[0.43454078,0.0050341953,0.29754278,0.001656104,0.0010834786,0.00095317693,0.0018636235,0.0021018428,0.25522408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.000089506946,0.000038005022,0.00019315089,0.00012307722,0.00010407722],"domain_scores_gemma":[0.99926263,0.00026763437,0.000057292968,0.00021922754,0.00011465563,0.00007848943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045964753,0.00067149475,0.0006787045,0.0021577873,0.0026898305,0.0028631343,0.0009600039,0.0016636549,0.021323668],"category_scores_gemma":[0.0018456558,0.00060532236,0.0014382806,0.0027830878,0.0024948712,0.005905731,0.002347553,0.0026013213,0.0049393303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019739817,0.000010521759,0.000042821128,0.000070176204,0.0000034245652,0.000052120096,0.00014063786,0.00026040745,0.001310576,0.96565676,0.0026471633,0.02978559],"study_design_scores_gemma":[0.00000602023,0.000025026373,0.00007694357,0.000068501635,0.000009106615,0.00019759887,0.00006639837,0.0012551761,0.0021246637,0.94229937,0.05385319,0.000017997201],"about_ca_topic_score_codex":0.0007661854,"about_ca_topic_score_gemma":0.0008447873,"teacher_disagreement_score":0.021323668,"about_ca_system_score_codex":0.0010558758,"about_ca_system_score_gemma":0.00084968924,"threshold_uncertainty_score":0.07133484},"labels":[],"label_agreement":null},{"id":"W3193216832","doi":"10.1007/978-3-030-87592-3_5","title":"Synth-by-Reg (SbR): Contrastive Learning for Synthesis-Based Registration of Paired Images","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Polytechnique Montréal","funders":"National Institute of Mental Health; National Institute on Aging","keywords":"Overfitting; Artificial intelligence; Computer science; Image registration; Translation (biology); Reduction (mathematics); Complement (music); Pattern recognition (psychology); Modality (human–computer interaction); Computer vision; Natural language processing; Image (mathematics); Artificial neural network; Mathematics","score_opus":0.015152389055290798,"score_gpt":0.2593618590153644,"score_spread":0.24420946996007362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193216832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021923739,0.00010609512,0.9892786,0.000047035486,0.000045797744,0.00007009464,0.00021755627,0.0073789153,0.00066337443],"genre_scores_gemma":[0.033773914,0.0001425749,0.96000487,0.000096052296,0.00004939193,0.00017908243,0.0009648081,0.001797267,0.0029919278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990693,0.00020702792,0.00005088036,0.0002520451,0.00032661197,0.000094221905],"domain_scores_gemma":[0.99903333,0.00037235816,0.00006979858,0.0003359258,0.00013045737,0.00005823986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018820605,0.0018215941,0.0013770814,0.0013274223,0.00047457777,0.0012913838,0.002671481,0.0017998703,0.017932404],"category_scores_gemma":[0.0036566798,0.0010035253,0.0015294317,0.001131002,0.0007837897,0.0014719891,0.003136186,0.0025499929,0.00943847],"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.0006417442,0.0001753782,0.0003041903,0.00038900803,0.00013848984,0.0001144186,0.000113426664,0.022970865,0.07662538,0.0122555215,0.014970231,0.8713015],"study_design_scores_gemma":[0.0001578791,0.00031322404,0.0004675359,0.000040802955,0.00005971894,0.00035505154,0.00004667605,0.8161492,0.14133914,0.017492564,0.023517182,0.000061080646],"about_ca_topic_score_codex":0.001711151,"about_ca_topic_score_gemma":0.004264175,"teacher_disagreement_score":0.017932404,"about_ca_system_score_codex":0.00048931997,"about_ca_system_score_gemma":0.0011498579,"threshold_uncertainty_score":0.05998993},"labels":[],"label_agreement":null},{"id":"W3193265284","doi":"10.1007/978-3-030-83508-8_16","title":"Improved Bounds on the Spanning Ratio of the Theta-5-Graph","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Combinatorics; Spanner; Upper and lower bounds; Graph; Mathematics; Pi; Physics; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.01947050066859001,"score_gpt":0.23687851008290012,"score_spread":0.2174080094143101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193265284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18646184,0.021983307,0.40328613,0.008451486,0.0017551099,0.00025977584,0.0037911208,0.0030766411,0.3709346],"genre_scores_gemma":[0.71916544,0.013942594,0.20909306,0.0021977,0.0026874412,0.0006445692,0.004451826,0.0027168181,0.045100547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975931,0.00058730843,0.00009382231,0.00048050057,0.00077139854,0.00047377753],"domain_scores_gemma":[0.9843174,0.011985877,0.00051044306,0.0014751338,0.0009761004,0.0007350471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003381449,0.0029223117,0.002288979,0.004494749,0.001473783,0.004031526,0.0060114544,0.001939483,0.0225513],"category_scores_gemma":[0.018649476,0.0011653046,0.0020899733,0.004488711,0.0026751894,0.008382324,0.0043595624,0.007585184,0.00562231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001582534,0.0003960114,0.002676494,0.0014795177,0.0002640213,0.00040942777,0.00070444203,0.091213115,0.02052145,0.67457324,0.053807426,0.15237232],"study_design_scores_gemma":[0.00010089179,0.00027055357,0.0031413105,0.0003325312,0.00034074305,0.00064866664,0.0003121663,0.24899098,0.008623546,0.7135399,0.023598026,0.00010053401],"about_ca_topic_score_codex":0.0020150593,"about_ca_topic_score_gemma":0.0031748265,"teacher_disagreement_score":0.0225513,"about_ca_system_score_codex":0.0033878637,"about_ca_system_score_gemma":0.0011652496,"threshold_uncertainty_score":0.0754416},"labels":[],"label_agreement":null},{"id":"W3193697788","doi":"10.1007/978-3-030-86324-1_9","title":"Where Did the Web Archive Go?","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Columbia College","funders":"","keywords":"World Wide Web; Sample (material); Computer science; Web page; Code (set theory); History","score_opus":0.014523735052984326,"score_gpt":0.25279544355612504,"score_spread":0.23827170850314072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193697788","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071236566,0.025846403,0.04565802,0.35369375,0.022359783,0.00041186807,0.034019668,0.019903349,0.42687058],"genre_scores_gemma":[0.5359206,0.024281807,0.060082246,0.04137134,0.0090451995,0.00029330418,0.02567201,0.021934483,0.28139907],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99704665,0.00064430083,0.00025576312,0.00052852544,0.0009609635,0.0005638303],"domain_scores_gemma":[0.9817784,0.0023255716,0.0010772954,0.0036573785,0.00823843,0.0029228767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052744616,0.0004941214,0.0010174593,0.0079526035,0.0044388743,0.019885411,0.0016595111,0.004123387,0.040430285],"category_scores_gemma":[0.023721186,0.0006929071,0.0007198358,0.009702977,0.0033139011,0.035607252,0.0036729749,0.005616126,0.030887369],"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.00039114934,0.00012562251,0.013809495,0.0005520226,0.000046055105,0.0008711885,0.003210711,0.00038146795,0.0017353977,0.13183555,0.5678095,0.2792318],"study_design_scores_gemma":[0.000024521469,0.000025617823,0.00584949,0.00067773875,0.00003764707,0.00064608396,0.005731593,0.0007637217,0.0028786585,0.033143748,0.9501219,0.00009927729],"about_ca_topic_score_codex":0.024066275,"about_ca_topic_score_gemma":0.02422781,"teacher_disagreement_score":0.040430285,"about_ca_system_score_codex":0.003691646,"about_ca_system_score_gemma":0.005313029,"threshold_uncertainty_score":0.13525277},"labels":[],"label_agreement":null},{"id":"W3194658714","doi":"10.1007/978-3-030-85165-1_14","title":"Towards Extending Fulton’s Algorithm for Computing Intersection Multiplicities Beyond the Bivariate Case","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Intersection (aeronautics); Generalization; Bivariate analysis; Cover (algebra); Basis (linear algebra); Computer science; Planar; Algorithm; Multiplicity (mathematics); Mathematics; Computer graphics (images); Geometry; Cartography","score_opus":0.018669400749556662,"score_gpt":0.2602697904573892,"score_spread":0.2416003897078325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194658714","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.017608864,0.00050164154,0.9617356,0.0003973645,0.0002287388,0.00012378451,0.00017651441,0.0026353637,0.016592104],"genre_scores_gemma":[0.12478349,0.0004915807,0.8576015,0.00038803398,0.00022683044,0.00015097548,0.00083314505,0.0006198025,0.014904662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781275,0.00031423548,0.0001928304,0.00054093363,0.00078654644,0.00035272946],"domain_scores_gemma":[0.99678963,0.0009974822,0.00012862131,0.0011080257,0.0008205894,0.00015562867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018650574,0.0017287708,0.001692711,0.005680281,0.0016204572,0.004253355,0.0035182573,0.0015803206,0.016836561],"category_scores_gemma":[0.008257712,0.0009247868,0.0017778354,0.0058784126,0.0020032027,0.009098802,0.0062517165,0.003398248,0.0069060386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032470727,0.00017798804,0.001992334,0.00023931751,0.00005615934,0.0001708242,0.00041028394,0.010526569,0.007863776,0.20199631,0.012167875,0.7640738],"study_design_scores_gemma":[0.000100685385,0.00018297958,0.001100578,0.00021802595,0.000105743224,0.0006819354,0.00039442297,0.18439697,0.021217883,0.7061372,0.08532804,0.00013558833],"about_ca_topic_score_codex":0.0038969505,"about_ca_topic_score_gemma":0.0050151427,"teacher_disagreement_score":0.016836561,"about_ca_system_score_codex":0.0014707504,"about_ca_system_score_gemma":0.0017161637,"threshold_uncertainty_score":0.056323886},"labels":[],"label_agreement":null},{"id":"W3194881641","doi":"10.1007/978-3-030-85610-6_3","title":"Empirical Evaluation of Moving Target Selection in Virtual Reality Using Egocentric Metaphors","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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 Manitoba; Huawei Technologies (Canada); University of Waterloo","funders":"","keywords":"Computer science; Pointer (user interface); Human–computer interaction; Virtual reality; Selection (genetic algorithm); Target acquisition; Context (archaeology); Empirical research; Artificial intelligence","score_opus":0.05960320811310002,"score_gpt":0.3384196252414216,"score_spread":0.2788164171283216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194881641","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.98682076,0.00024220572,0.004356102,0.000036246365,0.000011084222,0.00010233985,0.00007505108,0.000022768761,0.008333401],"genre_scores_gemma":[0.9966233,0.00008406025,0.0023066495,0.000013432346,0.000004699503,0.00006951727,0.00009682752,0.000017454942,0.00078400306],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9919499,0.00639307,0.0003187328,0.00037811114,0.0007876137,0.00017260178],"domain_scores_gemma":[0.88173425,0.106457986,0.0037252528,0.004310215,0.0031298774,0.00064241065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068392875,0.00044700853,0.00032057535,0.0008362899,0.0003946377,0.0015488606,0.001201109,0.0006733904,0.008362668],"category_scores_gemma":[0.10009587,0.00029158403,0.00023261961,0.0008406807,0.0011790218,0.0022392343,0.0014600925,0.0005503446,0.0008121863],"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.031596616,0.013352977,0.32641104,0.004512161,0.0006903507,0.0018855178,0.0643533,0.027306216,0.047054514,0.047943074,0.004778214,0.43011603],"study_design_scores_gemma":[0.0019729927,0.02949845,0.73120344,0.0007031823,0.0012419879,0.0038943193,0.054721557,0.11736671,0.023022655,0.016480533,0.019488906,0.0004052488],"about_ca_topic_score_codex":0.001301504,"about_ca_topic_score_gemma":0.000949309,"teacher_disagreement_score":0.008362668,"about_ca_system_score_codex":0.00036703332,"about_ca_system_score_gemma":0.00029880906,"threshold_uncertainty_score":0.036170065},"labels":[],"label_agreement":null},{"id":"W3195058979","doi":"10.1007/978-3-030-85613-7_10","title":"Fingerprint Scroll: Comparison of Touchless and Touch-Based Scroll Navigation Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Scroll; Fingerprint (computing); Computer science; Gesture; Artificial intelligence; Computer vision; Frame (networking); Engineering; Telecommunications; Mechanical engineering","score_opus":0.029397476565449412,"score_gpt":0.33943582312806786,"score_spread":0.31003834656261847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195058979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22507787,0.01410342,0.72985643,0.00016778459,0.0007391173,0.00038642844,0.0015928063,0.012715435,0.015360698],"genre_scores_gemma":[0.57141143,0.005516724,0.39633825,0.00020655141,0.00015093123,0.00019292675,0.0023027032,0.0015475696,0.022332901],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902904,0.000187139,0.00004529442,0.00010516224,0.0005685749,0.00006484532],"domain_scores_gemma":[0.99701464,0.0015692832,0.0001437841,0.00032069802,0.00080395426,0.00014761655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006715037,0.0006884506,0.000859269,0.001166079,0.0002454914,0.0010561901,0.0013121951,0.0006139088,0.010421534],"category_scores_gemma":[0.0042967843,0.00024459726,0.0003605703,0.0013055576,0.00017852493,0.0011997535,0.0007599113,0.00032072698,0.0018238644],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026230332,0.00021925282,0.001347185,0.0010651059,0.00010617409,0.00007896565,0.00015719899,0.0024386402,0.049323425,0.00069478573,0.00472255,0.93722373],"study_design_scores_gemma":[0.001952785,0.012353528,0.08572757,0.0010371224,0.001978095,0.0072951326,0.0017810265,0.44416526,0.3630404,0.0065446272,0.07332092,0.00080355664],"about_ca_topic_score_codex":0.0021148378,"about_ca_topic_score_gemma":0.0036957997,"teacher_disagreement_score":0.010421534,"about_ca_system_score_codex":0.00019789983,"about_ca_system_score_gemma":0.00052547385,"threshold_uncertainty_score":0.03486353},"labels":[],"label_agreement":null},{"id":"W3195572326","doi":"10.1007/978-3-030-85613-7_1","title":"Diegetic and Non-diegetic Health Interfaces in VR Shooter Games","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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 Waterloo","funders":"","keywords":"Computer science; Computer graphics (images); Human–computer interaction","score_opus":0.019512755196652236,"score_gpt":0.2773068480045774,"score_spread":0.25779409280792515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195572326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2121029,0.043109193,0.46224704,0.0013525621,0.0012421428,0.00040547847,0.00038925765,0.0022218726,0.27692962],"genre_scores_gemma":[0.691106,0.011088208,0.08190199,0.00090160803,0.00024948514,0.00022946656,0.00043514423,0.00029989422,0.21378824],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978036,0.00005563638,0.0000118271455,0.00003189802,0.00009179084,0.000028609127],"domain_scores_gemma":[0.9997607,0.00017149595,0.000009446239,0.0000108906115,0.000030636857,0.000016861402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002909509,0.00042155987,0.00028650725,0.00036846,0.00015613459,0.0015054654,0.00059034454,0.0007849535,0.01871048],"category_scores_gemma":[0.00071576156,0.00017922747,0.00025510686,0.0002171397,0.0002947637,0.00084164005,0.0010186746,0.00043834612,0.0014245448],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011986659,0.00031217016,0.00088707334,0.0016464016,0.00004468785,0.00045642987,0.0016236845,0.0021320349,0.10711162,0.04194286,0.00911368,0.8335307],"study_design_scores_gemma":[0.0006003151,0.0073213954,0.06343413,0.00454389,0.00061923853,0.020785592,0.0062581184,0.11067399,0.15860167,0.09108751,0.5357669,0.00030727178],"about_ca_topic_score_codex":0.00031060874,"about_ca_topic_score_gemma":0.0006942324,"teacher_disagreement_score":0.01871048,"about_ca_system_score_codex":0.00015593061,"about_ca_system_score_gemma":0.0001433975,"threshold_uncertainty_score":0.062592745},"labels":[],"label_agreement":null},{"id":"W3195860440","doi":"10.1007/978-3-030-85616-8_28","title":"Reducing the UX Skill Gap Through Experiential Learning: Description and Initial Assessment of Collaborative Learning of Usability Experiences Program","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Higher Education and Employability","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Internship; Experiential learning; Usability; Computer science; Knowledge management; Human–computer interaction; Mathematics education; Medical education; Psychology","score_opus":0.04975589861500893,"score_gpt":0.38608297567771993,"score_spread":0.336327077062711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195860440","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.91462785,0.00023725627,0.06775716,0.00020544414,0.000044104752,0.00096968986,0.00008875754,0.0005731224,0.015496575],"genre_scores_gemma":[0.9211523,0.00017469196,0.066064194,0.000070858325,0.00001603601,0.00075128954,0.00018936033,0.00008170152,0.011499461],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992094,0.0002841497,0.000052868374,0.00012185258,0.00024133649,0.00009036112],"domain_scores_gemma":[0.99683064,0.0018853564,0.00012576865,0.00036550834,0.00046919758,0.00032366684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473073,0.00035030398,0.00028873413,0.0005264778,0.00045073387,0.00081808085,0.0010695012,0.0004209936,0.003765172],"category_scores_gemma":[0.004608321,0.00013094486,0.00029615583,0.00027589526,0.0003952574,0.00079911936,0.0012768102,0.00066261215,0.00035012],"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.0010275067,0.012970514,0.005854881,0.00052745437,0.000029786808,0.00026286126,0.007098754,0.0014308791,0.05117724,0.0032247852,0.0026918007,0.9137036],"study_design_scores_gemma":[0.002350454,0.106351905,0.23085049,0.0007146609,0.00054723304,0.0048691574,0.016182197,0.059924174,0.48075548,0.011741712,0.08540479,0.00030778247],"about_ca_topic_score_codex":0.00070863235,"about_ca_topic_score_gemma":0.0007505274,"teacher_disagreement_score":0.003765172,"about_ca_system_score_codex":0.00041170442,"about_ca_system_score_gemma":0.0010760659,"threshold_uncertainty_score":0.012595713},"labels":[],"label_agreement":null},{"id":"W3196009497","doi":"10.1007/978-3-030-85610-6_5","title":"Leveraging CD Gain for Precise Barehand Video Timeline Browsing on Smart Displays","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"Huawei Technologies (Canada); University of Waterloo","funders":"","keywords":"Timeline; Computer science; Constant (computer programming); Task (project management); Function (biology); Interval (graph theory); Statistics; Mathematics","score_opus":0.021596057173311714,"score_gpt":0.26516310704537877,"score_spread":0.24356704987206707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196009497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12693119,0.0017375236,0.81490993,0.00026715355,0.0003409212,0.00020222715,0.00062697526,0.01811777,0.036866345],"genre_scores_gemma":[0.6160911,0.0010181422,0.33322787,0.00034949643,0.00015014398,0.00013647017,0.0008784572,0.001432682,0.046715673],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997197,0.00002564208,0.000010735181,0.00005855777,0.00013251156,0.000052840514],"domain_scores_gemma":[0.9995128,0.0001752258,0.000024368945,0.00014506461,0.00010201578,0.00004054333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018744,0.0005786441,0.00041387836,0.0005545634,0.00029334484,0.0010766166,0.0011581414,0.0004939641,0.020982923],"category_scores_gemma":[0.0007652973,0.0003915301,0.00022437378,0.00059849676,0.00024678282,0.0016469503,0.0014395418,0.00066110713,0.004336183],"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.0004948729,0.00014753787,0.00054502377,0.00023316017,0.000022564038,0.00018039002,0.00015560472,0.0017678225,0.66767824,0.0038792694,0.009115435,0.31578],"study_design_scores_gemma":[0.000102996055,0.0005946184,0.00322957,0.00008225921,0.00008018649,0.0014010182,0.00014716547,0.11821044,0.7834602,0.003536425,0.0890312,0.00012388214],"about_ca_topic_score_codex":0.001162246,"about_ca_topic_score_gemma":0.0028376372,"teacher_disagreement_score":0.020982923,"about_ca_system_score_codex":0.0002756481,"about_ca_system_score_gemma":0.00023137117,"threshold_uncertainty_score":0.07019484},"labels":[],"label_agreement":null},{"id":"W3196034421","doi":"10.1007/978-3-030-85037-1_5","title":"Closing the Gap Between Discrete Abstractions and Continuous Control: Completeness via Robustness and Controllability","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Controllability; Temporal logic; Reachability; Decidability; Linear temporal logic; Computer science; Completeness (order theory); Robustness (evolution); Control theory (sociology); Nonlinear system; Abstraction; Nonlinear control; Bisimulation; Control system; Theoretical computer science; Mathematics; Control (management); Artificial intelligence; Applied mathematics","score_opus":0.03050971816796247,"score_gpt":0.28087853149942305,"score_spread":0.25036881333146055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196034421","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.010210451,0.002041833,0.9661108,0.0019467457,0.00017118605,0.00003428795,0.000103678205,0.00030572762,0.019075258],"genre_scores_gemma":[0.63660383,0.0045789834,0.3392126,0.0014625877,0.00085840176,0.00042131086,0.00054604356,0.0005280427,0.01578823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967751,0.0009554161,0.0001995137,0.000727583,0.0011084724,0.00023383199],"domain_scores_gemma":[0.9906543,0.00635823,0.0003375966,0.0020082453,0.00048208368,0.00015953733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040594204,0.000921888,0.0016352152,0.00076537614,0.0008663487,0.003775064,0.0020947184,0.002092902,0.004278499],"category_scores_gemma":[0.0087248515,0.001064342,0.0018325242,0.0007290627,0.008405682,0.012271698,0.0049738144,0.0076543447,0.00078773615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006129183,0.00002340328,0.00008420365,0.00020402497,0.000026723103,0.000035828143,0.00023880726,0.013011306,0.0008589898,0.9613894,0.0014916325,0.022574393],"study_design_scores_gemma":[0.000017819571,0.000025200397,0.000044213735,0.00004360783,0.00001033397,0.000024159064,0.000031180272,0.025166338,0.0007495315,0.9693626,0.004515264,0.000009835198],"about_ca_topic_score_codex":0.0009273421,"about_ca_topic_score_gemma":0.0004056397,"teacher_disagreement_score":0.004278499,"about_ca_system_score_codex":0.0009653258,"about_ca_system_score_gemma":0.0015871353,"threshold_uncertainty_score":0.02146852},"labels":[],"label_agreement":null},{"id":"W3196065071","doi":"10.1007/978-3-030-85165-1_15","title":"On the Pseudo-Periodicity of the Integer Hull of Parametric Convex Polygons","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Convex hull; Computer science; Regular polygon; Integer (computer science); Hull; Parametric statistics; Algorithm; Combinatorics; Mathematics; Geometry; Programming language; Geology; Statistics","score_opus":0.01877098087548923,"score_gpt":0.2373048214993603,"score_spread":0.21853384062387107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196065071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31997842,0.002349642,0.49081984,0.000552982,0.00065817323,0.00005422377,0.00042630572,0.00027615525,0.18488415],"genre_scores_gemma":[0.88091093,0.0014954259,0.08365129,0.00015997728,0.0003244869,0.000046433397,0.0005248315,0.00028593082,0.0326007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997402,0.000061908024,0.000014441874,0.000043546806,0.000100234145,0.000039673723],"domain_scores_gemma":[0.9995185,0.00024018736,0.00006446086,0.000079976184,0.00004845428,0.00004835383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737509,0.00033615116,0.000423565,0.00068478874,0.0005033687,0.0014454185,0.0006322438,0.00037259827,0.005164036],"category_scores_gemma":[0.001855838,0.00038531443,0.00040795075,0.0006308961,0.0013406397,0.0015104063,0.0011703956,0.0015196472,0.00068589323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010534539,0.000020901369,0.0004989729,0.00008881942,0.0000068004256,0.0002163337,0.0002682296,0.012183229,0.004586151,0.93959045,0.003193113,0.039241586],"study_design_scores_gemma":[0.000023319553,0.00012066942,0.0017263048,0.000064619635,0.000013920413,0.0008281243,0.00036745495,0.14606974,0.0030212044,0.82232934,0.025400048,0.000035256435],"about_ca_topic_score_codex":0.0005263308,"about_ca_topic_score_gemma":0.0004776184,"teacher_disagreement_score":0.005164036,"about_ca_system_score_codex":0.00031059215,"about_ca_system_score_gemma":0.00019074458,"threshold_uncertainty_score":0.017275393},"labels":[],"label_agreement":null},{"id":"W3196112518","doi":"10.1007/978-3-030-85613-7_31","title":"Recognition of a Robot’s Affective Expressions Under Conditions with Limited Visibility","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Visibility; Computer science; Modalities; Robot; Modality (human–computer interaction); Human–computer interaction; Artificial intelligence; Computer vision; Social robot; Human–robot interaction; Mobile robot; Robot control","score_opus":0.05505196337660103,"score_gpt":0.3488532305715138,"score_spread":0.2938012671949128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196112518","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.95854986,0.0003008335,0.03233686,0.000094523435,0.000079019774,0.000029394021,0.00019494009,0.00018083357,0.008233724],"genre_scores_gemma":[0.9947848,0.00008291033,0.0037624321,0.000025835434,0.000014816373,0.00001499733,0.00010035069,0.000024092482,0.0011898311],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985695,0.000024701973,0.0000044123067,0.000040160627,0.00003570203,0.00003797367],"domain_scores_gemma":[0.9997148,0.00012469229,0.000051836127,0.00003035663,0.000042130578,0.000036078767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014579111,0.00017976966,0.00024768987,0.0001222662,0.00017866217,0.00064964837,0.00024009055,0.0003070608,0.0018343558],"category_scores_gemma":[0.0011883333,0.0001531607,0.0001712703,0.00011466035,0.00028709293,0.00051527284,0.00053702015,0.00029689763,0.00040142532],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015409883,0.00007358247,0.005616153,0.00010112527,0.000021300337,0.0001604789,0.0005233263,0.0013625923,0.9213729,0.00059275614,0.00061470753,0.06802012],"study_design_scores_gemma":[0.00007756638,0.0013464454,0.50999177,0.0000838735,0.0001555668,0.0011750543,0.002141412,0.118865915,0.35825828,0.004146545,0.0036395618,0.00011800871],"about_ca_topic_score_codex":0.0007322636,"about_ca_topic_score_gemma":0.0006665136,"teacher_disagreement_score":0.0018343558,"about_ca_system_score_codex":0.0001316673,"about_ca_system_score_gemma":0.00014189964,"threshold_uncertainty_score":0.0061365366},"labels":[],"label_agreement":null},{"id":"W3196200074","doi":"10.1007/978-3-030-85623-6_18","title":"Co-designing Tangible Break Reminders with People with Repetitive Strain Injury","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"","keywords":"Computer science; Human–computer interaction; Strain (injury); Physical therapy; Medicine","score_opus":0.07742844687748589,"score_gpt":0.3494253074231143,"score_spread":0.2719968605456284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196200074","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.8072954,0.00085528474,0.15380731,0.0010966274,0.00046798654,0.001098332,0.0002476671,0.003968085,0.031163262],"genre_scores_gemma":[0.8094262,0.000530769,0.16336673,0.0004227759,0.00008414596,0.00088356656,0.0003063519,0.00031360754,0.024665922],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9994622,0.00020407836,0.000034264496,0.00010525961,0.00011897168,0.00007516621],"domain_scores_gemma":[0.9975533,0.0016868615,0.00018893581,0.00019061608,0.0001669262,0.00021333089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010599016,0.00068861496,0.00039023205,0.00041360204,0.00064893486,0.0010251142,0.0011811042,0.0010663866,0.016055174],"category_scores_gemma":[0.0062055634,0.00032301337,0.0004712568,0.00022818141,0.00018883904,0.0011430874,0.0012319366,0.00073899527,0.0028261621],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016728323,0.006005383,0.011192057,0.0014822381,0.00015334522,0.0011560586,0.020937543,0.0028093767,0.03417137,0.0009398677,0.01689578,0.90258425],"study_design_scores_gemma":[0.004232716,0.05461632,0.20107828,0.0040690787,0.0037849424,0.012961084,0.124117404,0.09937385,0.14248158,0.015358554,0.33712286,0.0008033199],"about_ca_topic_score_codex":0.00038053334,"about_ca_topic_score_gemma":0.0014119026,"teacher_disagreement_score":0.016055174,"about_ca_system_score_codex":0.00019632973,"about_ca_system_score_gemma":0.00043685047,"threshold_uncertainty_score":0.053709865},"labels":[],"label_agreement":null},{"id":"W3196382033","doi":"10.1007/978-3-030-86198-8_23","title":"Improving Handwritten Arabic Text Recognition Using an Adaptive Data-Augmentation Algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Cambrian College","funders":"","keywords":"Computer science; Lexicon; Word (group theory); Artificial intelligence; Arabic; Natural language processing; Task (project management); Pattern recognition (psychology); Handwriting recognition; Speech recognition; Feature extraction; Mathematics","score_opus":0.06282409887958935,"score_gpt":0.29128631287973106,"score_spread":0.22846221400014172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196382033","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.054761484,0.0009437197,0.9295334,0.00017514976,0.0005835904,0.00011405988,0.00028526678,0.009211736,0.004391564],"genre_scores_gemma":[0.18571275,0.00048661325,0.7958341,0.00019913114,0.00015528595,0.00014559967,0.0013797298,0.00045361993,0.015633246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996393,0.000040507337,0.00003154107,0.00010547796,0.00014945774,0.000033686974],"domain_scores_gemma":[0.9993431,0.00016428475,0.000035824945,0.00011869946,0.00030653618,0.00003154818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032823236,0.0010948083,0.0008717618,0.0007315905,0.00036588465,0.000803136,0.001058149,0.0006729112,0.0058057075],"category_scores_gemma":[0.00096045574,0.00031536323,0.0008011551,0.0009509302,0.00032791146,0.001058799,0.00075798715,0.0010552115,0.0040458576],"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.000334202,0.0001728722,0.0004625717,0.0001235192,0.00005035418,0.00010530765,0.000049021157,0.0152677875,0.17708808,0.000926626,0.004926498,0.8004932],"study_design_scores_gemma":[0.00002480976,0.00019666656,0.0013628034,0.000017753104,0.00006782343,0.0003234561,0.000045725097,0.80458343,0.18248557,0.00084521685,0.010012614,0.000034101486],"about_ca_topic_score_codex":0.002363498,"about_ca_topic_score_gemma":0.0031040113,"teacher_disagreement_score":0.0058057075,"about_ca_system_score_codex":0.00023342343,"about_ca_system_score_gemma":0.0005369009,"threshold_uncertainty_score":0.019421995},"labels":[],"label_agreement":null},{"id":"W3196833675","doi":"10.1007/978-3-030-86472-9_24","title":"Improving Quality of Ensemble Technique for Categorical Data Clustering Using Granule Computing","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Data mining; Categorical variable; Computer science; Leverage (statistics); Consensus clustering; Machine learning; Artificial intelligence; Correlation clustering; CURE data clustering algorithm","score_opus":0.09470476381794642,"score_gpt":0.32834685312399503,"score_spread":0.23364208930604863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196833675","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.043461956,0.0005147143,0.95405275,0.00009575318,0.00012103966,0.00003641031,0.000115595474,0.00083431473,0.0007674641],"genre_scores_gemma":[0.41444394,0.00045852037,0.58219385,0.00006705547,0.00012200308,0.0000758872,0.00085069716,0.00021924153,0.0015688118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978695,0.00045145262,0.00016237538,0.000349261,0.0010160197,0.00015143756],"domain_scores_gemma":[0.9959627,0.0013311768,0.00016688382,0.00061624334,0.0018257207,0.00009728353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025321697,0.0006176311,0.0018872638,0.0019301258,0.0009839016,0.0016018471,0.0013960127,0.0008758949,0.0015136892],"category_scores_gemma":[0.0061362744,0.00028046916,0.0014546606,0.0025827766,0.00034997583,0.0021790224,0.0013135112,0.0010427237,0.00048055072],"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.0005687462,0.0001909164,0.007941097,0.00020916118,0.0003774554,0.0001603303,0.00031388813,0.09585759,0.027818028,0.0058951885,0.0059230947,0.85474443],"study_design_scores_gemma":[0.0000172005,0.00010226061,0.0027284364,0.000016646529,0.00010026483,0.0001561422,0.000113524926,0.98087007,0.010069038,0.004400192,0.0014014414,0.000024803632],"about_ca_topic_score_codex":0.0032821374,"about_ca_topic_score_gemma":0.0025901871,"teacher_disagreement_score":0.0032821374,"about_ca_system_score_codex":0.0004786491,"about_ca_system_score_gemma":0.000769807,"threshold_uncertainty_score":0.013391554},"labels":[],"label_agreement":null},{"id":"W3196887708","doi":"10.1007/978-3-030-86159-9_37","title":"Graph Representation Learning in Document Wikification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Dalhousie University","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Knowledge base; Paragraph; Representation (politics); Entity linking; Graph; Task (project management); Annotation; Word (group theory); Information retrieval; Context (archaeology); Natural language understanding; Natural language; Theoretical computer science; World Wide Web; Linguistics","score_opus":0.015304455452964782,"score_gpt":0.28531269871287535,"score_spread":0.2700082432599106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196887708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030439926,0.0033717153,0.9503955,0.0006219043,0.00033149097,0.00013594661,0.0008772448,0.0055842153,0.008242042],"genre_scores_gemma":[0.2163337,0.0023220698,0.7553703,0.00018182273,0.00015463136,0.00019715374,0.005340837,0.00079710165,0.019302303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993643,0.0002550603,0.0000477813,0.00015039994,0.00014024993,0.00004219887],"domain_scores_gemma":[0.9976683,0.0013909249,0.00009978489,0.00049093267,0.00026603136,0.000083998624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010375491,0.0005118372,0.0008065558,0.0018619195,0.0006176829,0.001253655,0.0016520937,0.0008460121,0.003820438],"category_scores_gemma":[0.00507896,0.00035208097,0.0007302726,0.002958852,0.00047412087,0.0033750962,0.0013354841,0.0015926856,0.0013803113],"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.00008045003,0.00017401602,0.0009945852,0.00034074357,0.00007352635,0.000072617855,0.00019509492,0.035118807,0.0023818891,0.030567564,0.022486841,0.90751386],"study_design_scores_gemma":[0.000026866994,0.00008863231,0.0011204302,0.00015178224,0.000080221966,0.00021229874,0.00022419514,0.8073606,0.0077264905,0.1499133,0.03305591,0.00003934944],"about_ca_topic_score_codex":0.0044695763,"about_ca_topic_score_gemma":0.00867007,"teacher_disagreement_score":0.0044695763,"about_ca_system_score_codex":0.0008477491,"about_ca_system_score_gemma":0.0009247485,"threshold_uncertainty_score":0.012780666},"labels":[],"label_agreement":null},{"id":"W3197492799","doi":"10.1007/978-3-030-86331-9_23","title":"Sparse Document Analysis Using Beta-Liouville Naive Bayes with Vocabulary Knowledge","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; BETA (programming language); Bayes' theorem; Artificial intelligence; Naive Bayes classifier; Vocabulary; Natural language processing; Machine learning; Bayesian probability; Programming language; Philosophy; Linguistics; Support vector machine","score_opus":0.024601828288167968,"score_gpt":0.260545632630907,"score_spread":0.23594380434273904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197492799","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.0037090061,0.00094353297,0.99325824,0.00014859266,0.0000891207,0.00006927039,0.0002000395,0.00094092934,0.0006414213],"genre_scores_gemma":[0.13780129,0.0015003536,0.8490766,0.00034602813,0.00071907614,0.00036629837,0.003163549,0.00036910173,0.006657627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957832,0.0016085982,0.00043760042,0.00075788744,0.0011630093,0.00024981727],"domain_scores_gemma":[0.99134314,0.0060812193,0.00026014124,0.00078516686,0.0013823701,0.00014804023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004192374,0.0011872443,0.002759842,0.004696221,0.0015837958,0.0035462405,0.002511479,0.0021581212,0.0045507643],"category_scores_gemma":[0.01470317,0.0010593559,0.0024085015,0.004210253,0.001022413,0.0046637277,0.0018697467,0.0029318612,0.0034778095],"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.00037782817,0.00029941447,0.0020025421,0.00041512653,0.00031887917,0.0002030764,0.00021621556,0.07040436,0.006690847,0.020693736,0.012470875,0.88590705],"study_design_scores_gemma":[0.00003442281,0.000050761326,0.000338792,0.000044496835,0.00009746849,0.00014660499,0.000046232293,0.95328397,0.001992342,0.04112548,0.002809176,0.00003031719],"about_ca_topic_score_codex":0.0076657548,"about_ca_topic_score_gemma":0.010204676,"teacher_disagreement_score":0.0076657548,"about_ca_system_score_codex":0.0011113113,"about_ca_system_score_gemma":0.002062989,"threshold_uncertainty_score":0.022171617},"labels":[],"label_agreement":null},{"id":"W3197610636","doi":"10.1007/978-3-030-88238-9_4","title":"Post-quantum Key-Blinding for Authentication in Anonymity Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blinding; Computer science; Anonymity; Authentication (law); Key (lock); Computer security; Internet privacy; Medicine","score_opus":0.017605154456151496,"score_gpt":0.25560346677721996,"score_spread":0.23799831232106847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197610636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01194975,0.0020230599,0.9431573,0.00092688925,0.00067807327,0.00011675638,0.000112744485,0.00074475474,0.040290575],"genre_scores_gemma":[0.6484734,0.0033664673,0.25066307,0.0006764013,0.0007349625,0.00030478128,0.00020404368,0.0004910552,0.0950859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00037330404,0.000053300046,0.00019167342,0.00041308597,0.00015844086],"domain_scores_gemma":[0.9988726,0.0004916322,0.00006337229,0.000409791,0.00012527424,0.00003741947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010167239,0.00058949355,0.0007665765,0.0005446089,0.0014323026,0.0023006857,0.0013090695,0.0017742654,0.01204405],"category_scores_gemma":[0.002455747,0.0003748228,0.00067059207,0.0008918471,0.0028428289,0.005079097,0.0023625595,0.0027300646,0.0040969243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014908177,0.000045094483,0.00006792078,0.00015949798,0.000013841951,0.00007171142,0.00014123005,0.0063663507,0.008515788,0.9226038,0.0058919364,0.05597374],"study_design_scores_gemma":[0.00002357146,0.000085763786,0.00012985017,0.000053159292,0.000021613067,0.0003014064,0.00005853855,0.09081962,0.013159693,0.86537826,0.02991656,0.000051991436],"about_ca_topic_score_codex":0.00023806003,"about_ca_topic_score_gemma":0.0002965596,"teacher_disagreement_score":0.01204405,"about_ca_system_score_codex":0.0012490752,"about_ca_system_score_gemma":0.00088827754,"threshold_uncertainty_score":0.04029131},"labels":[],"label_agreement":null},{"id":"W3197640590","doi":"10.1007/978-3-030-85987-9_12","title":"(Short Paper) Analysis of a Strong Fault Attack on Static/Ephemeral CSIDH","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Binary number; Logarithm; Upper and lower bounds; Discrete logarithm; Theoretical computer science; Countermeasure; Function (biology); Discrete mathematics; Algorithm; Public-key cryptography; Mathematics; Arithmetic; Computer security; Encryption","score_opus":0.037852699792482535,"score_gpt":0.3191274654758222,"score_spread":0.2812747656833397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197640590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16027388,0.0028520594,0.7195069,0.0071484633,0.0018627709,0.0002315592,0.0006862515,0.0018571079,0.10558101],"genre_scores_gemma":[0.9579504,0.00077008596,0.018435678,0.0004734852,0.0006376971,0.000044180942,0.00019437687,0.00015482804,0.02133933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884146,0.00018050871,0.000046804656,0.00015368772,0.00056325627,0.0002143602],"domain_scores_gemma":[0.99614704,0.002166556,0.0002815621,0.0007962911,0.00048017435,0.00012833886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080334337,0.00064983446,0.00074544235,0.0010116912,0.000757346,0.0018701578,0.0007657074,0.0010671904,0.010295144],"category_scores_gemma":[0.0048619974,0.00034985377,0.00093036,0.0010942463,0.0021807742,0.0036570535,0.0019478162,0.0018772769,0.0014740784],"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.0005609589,0.00009375289,0.0018517853,0.0003853095,0.0001229764,0.0006879535,0.0002687968,0.07324051,0.012615152,0.821614,0.018612433,0.06994633],"study_design_scores_gemma":[0.000053149808,0.00022422985,0.0015093324,0.00007407903,0.00013362689,0.0007562513,0.00010106378,0.29138625,0.014896269,0.67299384,0.017814603,0.00005738097],"about_ca_topic_score_codex":0.0007590663,"about_ca_topic_score_gemma":0.00060469296,"teacher_disagreement_score":0.010295144,"about_ca_system_score_codex":0.0018845003,"about_ca_system_score_gemma":0.0010531086,"threshold_uncertainty_score":0.034440696},"labels":[],"label_agreement":null},{"id":"W319768494","doi":"10.1007/978-3-662-44199-2_71","title":"Doing Algebraic Geometry with the RegularChains Library","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Gröbner basis; Algebra over a field; Algebraic number; Computer science; Computation; Tangent; Intersection (aeronautics); Algebraic geometry; Dimension of an algebraic variety; Differential algebraic geometry; Mathematics; Pure mathematics; Algorithm; Geometry","score_opus":0.007286269031130672,"score_gpt":0.20052079420740876,"score_spread":0.1932345251762781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W319768494","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.004311048,0.001296435,0.7737408,0.0009628086,0.0005534735,0.000065345346,0.0009705942,0.016209455,0.20188998],"genre_scores_gemma":[0.10925828,0.004313059,0.6715047,0.00067731517,0.00085837574,0.00021278205,0.004880713,0.017054338,0.19124055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896455,0.00021717166,0.00005847783,0.00017898022,0.0004972403,0.000083628416],"domain_scores_gemma":[0.9991536,0.00027090556,0.000030105066,0.00036041994,0.000113285234,0.00007166347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719811,0.0009753974,0.0011640154,0.0019754732,0.0015488657,0.0034938296,0.0019765473,0.0006236854,0.08611958],"category_scores_gemma":[0.0020194396,0.0010883611,0.0015906678,0.0022611883,0.0017875113,0.0061411727,0.00373144,0.0030981265,0.04574398],"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.00006793366,0.00006850487,0.0002551518,0.00033690783,0.000041661602,0.000096163014,0.0003940899,0.0024939922,0.0024268066,0.604783,0.09990774,0.28912807],"study_design_scores_gemma":[0.000033662305,0.000020984608,0.00014055286,0.00011897005,0.000020261983,0.00028373022,0.00009711554,0.00707029,0.004814645,0.60532385,0.38203645,0.00003946625],"about_ca_topic_score_codex":0.00075504073,"about_ca_topic_score_gemma":0.0021201265,"teacher_disagreement_score":0.08611958,"about_ca_system_score_codex":0.0008471475,"about_ca_system_score_gemma":0.0009973419,"threshold_uncertainty_score":0.2880987},"labels":[],"label_agreement":null},{"id":"W3198035914","doi":"10.1007/978-3-030-86337-1_16","title":"A More Effective Sentence-Wise Text Segmentation Approach Using BERT","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Ontario Tech University","funders":"","keywords":"Computer science; Segmentation; Encoder; Artificial intelligence; Sentence; Transformer; Natural language processing; Text segmentation; Feature (linguistics); Heuristic; Feature engineering; Language model; Deep learning; Natural language","score_opus":0.025975732776636576,"score_gpt":0.2658582777646642,"score_spread":0.23988254498802764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198035914","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.013991864,0.0012211634,0.94198275,0.0006212687,0.00088178023,0.00042919288,0.0026484118,0.03243456,0.005788951],"genre_scores_gemma":[0.086761564,0.00059058965,0.8768255,0.000481641,0.0006446001,0.00032871452,0.010658698,0.0029737167,0.020734975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857914,0.00023637299,0.00012545595,0.0005692358,0.00034622557,0.00014367446],"domain_scores_gemma":[0.99833906,0.0005368031,0.00006616305,0.00026332794,0.0006698029,0.00012477879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009910172,0.0025640042,0.0022027432,0.0038612173,0.0015312661,0.0028690938,0.0019849562,0.002099946,0.029174848],"category_scores_gemma":[0.002229796,0.00084404665,0.0019072864,0.003094906,0.000429223,0.0036223873,0.0021190916,0.0022125063,0.022647647],"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.0006898867,0.00023006542,0.00047798952,0.00047201588,0.00013535855,0.0002605633,0.00022731548,0.0037324065,0.1719147,0.0038991405,0.03439333,0.78356725],"study_design_scores_gemma":[0.0002106429,0.0005844026,0.0036582125,0.000110094246,0.00046276362,0.0011267039,0.0007858861,0.70961165,0.17251363,0.014352307,0.0963772,0.0002065429],"about_ca_topic_score_codex":0.005765282,"about_ca_topic_score_gemma":0.0091684265,"teacher_disagreement_score":0.029174848,"about_ca_system_score_codex":0.00058919337,"about_ca_system_score_gemma":0.0016207905,"threshold_uncertainty_score":0.097599566},"labels":[],"label_agreement":null},{"id":"W3198331920","doi":"10.1007/978-3-030-87993-8_3","title":"Robust Real-Time Computing with Chemical Reaction Networks","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Carleton University","funders":"","keywords":"Bounded function; Real number; Turing machine; Class (philosophy); Computation; Algebraic number; Discrete mathematics; Mathematics; Computer science; Combinatorics; Algorithm; Mathematical analysis","score_opus":0.014296448545736388,"score_gpt":0.23923277375610713,"score_spread":0.22493632521037074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198331920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010660709,0.00035604506,0.98647135,0.00026867772,0.00006521905,0.000032580723,0.000046743495,0.00076593086,0.0013328186],"genre_scores_gemma":[0.74087334,0.00037715462,0.25415745,0.00014676077,0.00014517023,0.00018033986,0.00017247992,0.00037108597,0.003576184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978168,0.0007131145,0.00012682397,0.0005879877,0.0006038553,0.00015140342],"domain_scores_gemma":[0.9930983,0.0047642626,0.0006904715,0.0007436603,0.00053687807,0.00016648989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028768198,0.0015554604,0.0018141529,0.00084456115,0.0005497131,0.0020907093,0.0022972177,0.001661201,0.0030597607],"category_scores_gemma":[0.014113368,0.0011012948,0.0009704632,0.0009838865,0.0019753848,0.0027017915,0.0021867964,0.0023794726,0.0006538115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015627878,0.000023560682,0.00012982509,0.000058830043,0.000034037505,0.000033165834,0.0000213248,0.95953804,0.0021142745,0.0145648895,0.00036001188,0.022965804],"study_design_scores_gemma":[0.00000491535,0.000007958005,0.000015170189,0.0000016589313,0.0000030594763,0.000005017031,0.0000011615497,0.9931143,0.00064012007,0.006076873,0.00012728243,0.0000025355873],"about_ca_topic_score_codex":0.0031647994,"about_ca_topic_score_gemma":0.0023198393,"teacher_disagreement_score":0.0031647994,"about_ca_system_score_codex":0.0015567325,"about_ca_system_score_gemma":0.0012041,"threshold_uncertainty_score":0.015214264},"labels":[],"label_agreement":null},{"id":"W3198507813","doi":"10.1007/978-3-030-83508-8_36","title":"Uniform Embeddings for Robinson Similarity Matrices","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Embedding; Diagonal; Combinatorics; Adjacency matrix; Similarity (geometry); Mathematics; Matrix (chemical analysis); Interval (graph theory); Row; Discrete mathematics; Graph; Diagonal matrix; Computer science; Artificial intelligence","score_opus":0.010761991444864649,"score_gpt":0.2194520355252555,"score_spread":0.20869004408039085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198507813","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.062176004,0.002555463,0.71509093,0.0010354664,0.000963771,0.00014739497,0.00061358954,0.00092437526,0.21649309],"genre_scores_gemma":[0.6293992,0.0033247932,0.20961237,0.00111675,0.0015686875,0.00038843864,0.001960301,0.0012701238,0.15135942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992077,0.00022762414,0.000055807235,0.00020112775,0.00022115765,0.0000865534],"domain_scores_gemma":[0.99888176,0.0004401167,0.00014310857,0.00021403139,0.00020170823,0.00011920983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054524234,0.0008963545,0.0006718443,0.0014495399,0.00082445424,0.002140411,0.0011091622,0.00093848124,0.016666798],"category_scores_gemma":[0.0037934952,0.0005253114,0.00061517395,0.0015369267,0.0012832321,0.004925279,0.002088961,0.0022925898,0.005541867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002514802,0.000018207655,0.000045413406,0.00005332713,0.0000042702222,0.00003743151,0.0001055399,0.0010171296,0.0010679635,0.9700519,0.003807918,0.023765787],"study_design_scores_gemma":[0.0000066249877,0.000025473333,0.00006866148,0.000015988673,0.00000406652,0.00012091425,0.000065518056,0.006304684,0.0007271087,0.97993064,0.012717819,0.000012494767],"about_ca_topic_score_codex":0.000339891,"about_ca_topic_score_gemma":0.00038917956,"teacher_disagreement_score":0.016666798,"about_ca_system_score_codex":0.0005589712,"about_ca_system_score_gemma":0.000229603,"threshold_uncertainty_score":0.055755973},"labels":[],"label_agreement":null},{"id":"W3198730144","doi":"10.1007/978-3-030-86472-9_18","title":"BERT-Based Multi-Task Learning for Aspect-Based Opinion Mining","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Pooling; Sentiment analysis; SemEval; Task (project management); Artificial intelligence; Machine learning; Artificial neural network; Natural language processing","score_opus":0.03343226142974383,"score_gpt":0.28241887930439863,"score_spread":0.24898661787465481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198730144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017493112,0.00093349314,0.9762296,0.000321492,0.0002710815,0.00017700122,0.0005262334,0.0025315415,0.0015164622],"genre_scores_gemma":[0.41739058,0.00085249986,0.568281,0.00066963426,0.0006693767,0.00069168943,0.0049053114,0.000462034,0.006077856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998423,0.0004649919,0.00014373011,0.00044089547,0.00030349067,0.00022382865],"domain_scores_gemma":[0.9958224,0.0024750654,0.00020522662,0.00033927252,0.0009532449,0.00020469261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033035462,0.0020596618,0.002140246,0.0017650612,0.0010237654,0.001785473,0.003002821,0.0024467702,0.0046939747],"category_scores_gemma":[0.0072716256,0.0007204215,0.0019371307,0.0027466083,0.0005118845,0.0025903992,0.002666281,0.0033144539,0.0032592567],"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.00072106515,0.0006314095,0.0020984665,0.0002610001,0.00031327363,0.00021159304,0.00018953823,0.060962163,0.013994887,0.0030561637,0.01930723,0.89825314],"study_design_scores_gemma":[0.000021287478,0.00007421257,0.0003132695,0.000009901466,0.00003772333,0.000031368516,0.000027727378,0.99261683,0.001778108,0.004050552,0.0010263177,0.000012649562],"about_ca_topic_score_codex":0.004787234,"about_ca_topic_score_gemma":0.005990932,"teacher_disagreement_score":0.004787234,"about_ca_system_score_codex":0.00084401533,"about_ca_system_score_gemma":0.0010497851,"threshold_uncertainty_score":0.017471015},"labels":[],"label_agreement":null},{"id":"W3198775993","doi":"10.1007/978-3-030-86159-9_12","title":"Contextualized Knowledge Base Sense Embeddings in Word Sense Disambiguation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Knowledge base; Embedding; Natural language processing; Artificial intelligence; Ambiguity; Representation (politics); Word (group theory); Base (topology); Knowledge representation and reasoning; Task (project management); Linguistics; Mathematics; Programming language","score_opus":0.01915145585384681,"score_gpt":0.2885088080800382,"score_spread":0.2693573522261914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198775993","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.02350989,0.0038200212,0.96360564,0.0003506174,0.0004648143,0.00009607196,0.0013031733,0.0033512062,0.0034985822],"genre_scores_gemma":[0.2725435,0.0023221122,0.7127912,0.00026875298,0.00022630428,0.00019889268,0.0055736857,0.00090457767,0.0051710405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985127,0.0004727767,0.00019426481,0.00042152376,0.0003033475,0.00009542823],"domain_scores_gemma":[0.9977794,0.0011231742,0.000099496945,0.0004583844,0.0004723883,0.00006724273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014882499,0.00083619787,0.0012496446,0.0029836134,0.00086057506,0.0022800765,0.0015512953,0.0012485903,0.0055565005],"category_scores_gemma":[0.00575673,0.0008943468,0.0008360796,0.004748838,0.00083295366,0.0070503,0.0030031975,0.0016222702,0.0033081404],"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.00042882873,0.00022166259,0.00114069,0.00055712636,0.0001887235,0.00025062056,0.00042669819,0.03218051,0.010678342,0.05119678,0.0190555,0.8836745],"study_design_scores_gemma":[0.000051559833,0.0001421449,0.0015229217,0.00027780342,0.00018051811,0.0005152909,0.0006167442,0.67595726,0.021051591,0.26442748,0.03516296,0.0000936378],"about_ca_topic_score_codex":0.0026450017,"about_ca_topic_score_gemma":0.0054483833,"teacher_disagreement_score":0.0055565005,"about_ca_system_score_codex":0.0005160718,"about_ca_system_score_gemma":0.0010420395,"threshold_uncertainty_score":0.018588305},"labels":[],"label_agreement":null},{"id":"W3198964105","doi":"10.1007/978-3-030-86593-1_14","title":"Minimum Consistent Subset Problem for Trees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Combinatorics; Vertex (graph theory); Colored; Planar graph; Chromatic scale; Graph; Undirected graph; Mathematics; Time complexity; Computer science; Discrete mathematics","score_opus":0.026286471008057522,"score_gpt":0.26399217281602244,"score_spread":0.2377057018079649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198964105","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.040886514,0.003081033,0.91608644,0.0038605805,0.00027536883,0.00016858405,0.0017191276,0.0005576724,0.033364642],"genre_scores_gemma":[0.28321204,0.0033056464,0.6802063,0.0006920505,0.00090996345,0.0006321876,0.0056749377,0.0007229876,0.024643918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899155,0.00038620492,0.00005766751,0.00017359196,0.00032483405,0.00006615082],"domain_scores_gemma":[0.9968832,0.0024138575,0.0001144889,0.00030804795,0.00018736799,0.00009299524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013484451,0.00063813897,0.0017731915,0.00088019733,0.00079215557,0.001981271,0.0016665721,0.0017634506,0.0078042424],"category_scores_gemma":[0.006109277,0.0007034356,0.0010159749,0.0019184949,0.0010253316,0.004391405,0.001350275,0.0035047706,0.0010951608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002655612,0.00014806532,0.00054701214,0.00079871935,0.00008323132,0.00016018595,0.00038289727,0.047184896,0.0038758353,0.6850361,0.053550724,0.20796673],"study_design_scores_gemma":[0.00005389811,0.000044727825,0.00027494942,0.00005917602,0.000023902869,0.0001771103,0.000072365474,0.078183234,0.0010783663,0.9084789,0.011542387,0.000011100368],"about_ca_topic_score_codex":0.0005197263,"about_ca_topic_score_gemma":0.00066076603,"teacher_disagreement_score":0.0078042424,"about_ca_system_score_codex":0.0007803426,"about_ca_system_score_gemma":0.00079867744,"threshold_uncertainty_score":0.026107788},"labels":[],"label_agreement":null},{"id":"W3198985826","doi":"10.1007/978-3-662-63958-0_12","title":"Red-Black Coins: Dai Without Liquidations","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Concordia University","funders":"","keywords":"Fungibility; Computer science; Isolation (microbiology); Black box; Mechanism (biology); Asset (computer security); Computer security; Economics; Finance; Artificial intelligence","score_opus":0.03140416614448433,"score_gpt":0.2281416040811438,"score_spread":0.1967374379366595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198985826","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.045874733,0.0022644007,0.2713015,0.0040971097,0.0018673121,0.000120897144,0.0006106513,0.002048518,0.6718149],"genre_scores_gemma":[0.6551476,0.0014269903,0.07028777,0.0012896548,0.00091379165,0.00016840307,0.00046088677,0.00117734,0.26912764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993067,0.00017305967,0.000032628654,0.00019184258,0.00015495461,0.00014080484],"domain_scores_gemma":[0.99838877,0.00040215746,0.00013681225,0.00062094576,0.00021033298,0.00024091944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009486511,0.00071347127,0.0010624157,0.0010817307,0.0020611247,0.003942423,0.0010856072,0.002054863,0.03486766],"category_scores_gemma":[0.0067225434,0.0005975694,0.0007101626,0.0013959683,0.003678203,0.008240936,0.003214001,0.0039346,0.0094840415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005978104,0.000022447843,0.00013767189,0.000029658548,0.000005726408,0.00009295086,0.00008538611,0.0013456054,0.00038241845,0.9681202,0.0072432887,0.022474755],"study_design_scores_gemma":[0.00001582124,0.000010727722,0.000075678574,0.000016438831,0.000006545435,0.00009762362,0.0000315598,0.00736087,0.00042417334,0.96578807,0.02616299,0.000009526768],"about_ca_topic_score_codex":0.00095786684,"about_ca_topic_score_gemma":0.0011977941,"teacher_disagreement_score":0.03486766,"about_ca_system_score_codex":0.00082869804,"about_ca_system_score_gemma":0.0009463744,"threshold_uncertainty_score":0.116643965},"labels":[],"label_agreement":null},{"id":"W3198999572","doi":"10.1007/978-3-030-90439-5_5","title":"Image Prior Transfer and Ensemble Architectures for Parkinson’s Disease Detection","year":2021,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Parkinson's disease; Computer science; Artificial intelligence; Disease; Pattern recognition (psychology); Medicine; Pathology","score_opus":0.011422626325690237,"score_gpt":0.2713475290014914,"score_spread":0.25992490267580115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198999572","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.08934194,0.0011285662,0.9049104,0.0003335013,0.000098781886,0.000040867315,0.00019060001,0.0018261751,0.002129226],"genre_scores_gemma":[0.74523187,0.0010215573,0.23698273,0.00019766844,0.00014039107,0.00008919579,0.0011202339,0.00021780285,0.014998505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998073,0.000037538204,0.000010581172,0.000052695526,0.0000482058,0.000043690754],"domain_scores_gemma":[0.9996321,0.00010980756,0.000019807185,0.00007165253,0.00014563657,0.000021053756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079125556,0.00072137685,0.0006253366,0.0005281921,0.0003305423,0.0005035515,0.0007348824,0.00087980117,0.0020114158],"category_scores_gemma":[0.0011812482,0.00030684308,0.0007997737,0.00051079295,0.00019683133,0.0007873166,0.000863238,0.001270936,0.00087922456],"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.00034411522,0.0001861122,0.0018222331,0.000052274838,0.00014562545,0.000072837414,0.00007145232,0.15568757,0.030439906,0.002669072,0.0035840226,0.80492467],"study_design_scores_gemma":[0.000004400463,0.00006451521,0.0014168327,0.0000060989246,0.000037736143,0.000050461447,0.000012586401,0.98840207,0.0077825096,0.0015034048,0.0007112162,0.000008146418],"about_ca_topic_score_codex":0.006607363,"about_ca_topic_score_gemma":0.010918877,"teacher_disagreement_score":0.006607363,"about_ca_system_score_codex":0.0003534408,"about_ca_system_score_gemma":0.00072513806,"threshold_uncertainty_score":0.013137817},"labels":[],"label_agreement":null},{"id":"W319908677","doi":"10.1007/978-3-642-55220-5_22","title":"Non-Interactive Secure Computation Based on Cut-and-Choose","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Oblivious transfer; Protocol (science); Encryption; Homomorphic encryption; Random oracle; Cheating; Secure multi-party computation; Computation; Key (lock); Secure two-party computation; Computer security; Public-key cryptography; Theoretical computer science; Cryptography; Algorithm","score_opus":0.009336624494466228,"score_gpt":0.24490798204613615,"score_spread":0.2355713575516699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W319908677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02968404,0.00043009137,0.9371199,0.0007158933,0.00021283464,0.00023988732,0.00024853056,0.0017874074,0.0295613],"genre_scores_gemma":[0.6646907,0.00048077476,0.304074,0.0003724354,0.00019885442,0.0005321266,0.00055552466,0.0005794408,0.028516183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724007,0.0005908927,0.00014648176,0.00055540603,0.0010317201,0.00043540035],"domain_scores_gemma":[0.99719894,0.0011674211,0.000105084575,0.001133516,0.00024056624,0.00015440024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011938204,0.00088604423,0.0019444793,0.0011271514,0.0021069953,0.003060628,0.0021666226,0.0011411394,0.009554786],"category_scores_gemma":[0.0038319991,0.0005945624,0.0018821079,0.0015506491,0.0031582308,0.0054493523,0.0056336513,0.0036390265,0.002507689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059319433,0.00012811794,0.00035176857,0.0001421977,0.000070012495,0.00012694526,0.00027951048,0.01519662,0.0057561276,0.90147066,0.0074574235,0.06842746],"study_design_scores_gemma":[0.000097789234,0.00008219168,0.00015261001,0.000028581962,0.000051379524,0.00017137635,0.000042228836,0.17151886,0.006462543,0.81495476,0.0063939593,0.000043786637],"about_ca_topic_score_codex":0.00096793997,"about_ca_topic_score_gemma":0.0015417162,"teacher_disagreement_score":0.009554786,"about_ca_system_score_codex":0.0019452687,"about_ca_system_score_gemma":0.0023548051,"threshold_uncertainty_score":0.031963885},"labels":[],"label_agreement":null},{"id":"W3199128408","doi":"10.1007/978-3-662-63958-0_29","title":"Publicly Verifiable and Secrecy Preserving Periodic Auctions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Concordia University","funders":"","keywords":"Transparency (behavior); Computer science; Verifiable secret sharing; Exploit; Common value auction; Price discovery; Order (exchange); Secrecy; Protocol (science); Smart contract; Computer security; Forward secrecy; Market liquidity; Public-key cryptography; Business; Finance; Microeconomics; Futures contract; Economics; Blockchain","score_opus":0.016030168853823256,"score_gpt":0.23158182680885647,"score_spread":0.21555165795503323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199128408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12872772,0.0015922453,0.66768384,0.0037129163,0.000631448,0.0002770711,0.00073807494,0.0018047735,0.19483197],"genre_scores_gemma":[0.8754969,0.0009604092,0.05181355,0.0002636143,0.00038320187,0.00020433162,0.000444495,0.00029585915,0.07013746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964799,0.0008877644,0.00018083779,0.0004503008,0.0014377079,0.00056357327],"domain_scores_gemma":[0.9882256,0.0056718714,0.0008825657,0.004160422,0.0007292852,0.0003302294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029376782,0.0009510262,0.0014410644,0.0006894315,0.00136825,0.0067919483,0.0030212468,0.0026084858,0.009076314],"category_scores_gemma":[0.014053284,0.0010422568,0.0010013975,0.0016979486,0.0029057483,0.009925897,0.0025550008,0.005618837,0.0027285756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046004835,0.00013645552,0.00017390224,0.00010847325,0.000027450538,0.00020173685,0.00017777052,0.017891953,0.0026376743,0.93888867,0.0048477277,0.034448147],"study_design_scores_gemma":[0.00007203649,0.00006032263,0.00011132593,0.000025350499,0.000017931352,0.00023461628,0.000029194724,0.039442707,0.0016994373,0.95395195,0.0043319864,0.000023184122],"about_ca_topic_score_codex":0.0004233727,"about_ca_topic_score_gemma":0.0003004579,"teacher_disagreement_score":0.009076314,"about_ca_system_score_codex":0.0016386245,"about_ca_system_score_gemma":0.002192202,"threshold_uncertainty_score":0.030363321},"labels":[],"label_agreement":null},{"id":"W3199751110","doi":"10.1007/978-3-662-63958-0_37","title":"Privacy-Preserving Resource Sharing Using Permissioned Blockchains","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer security; Shared resource; Secret sharing; Resource (disambiguation); Internet privacy; Computer network; Cryptography","score_opus":0.026659218305808786,"score_gpt":0.26373882675166155,"score_spread":0.23707960844585277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199751110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03829806,0.00061660033,0.9331358,0.0005410831,0.00014219788,0.00017237067,0.00018168992,0.0006455599,0.02626675],"genre_scores_gemma":[0.87457776,0.000924507,0.101619825,0.00009854093,0.00010363267,0.00021046738,0.00026696944,0.00013741858,0.02206095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964478,0.0010097947,0.00022433825,0.0004906834,0.0013845966,0.00044269016],"domain_scores_gemma":[0.9947601,0.002156109,0.00022162093,0.0023535932,0.00034074477,0.00016791881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024345394,0.000587983,0.001014293,0.0006945437,0.0013684,0.0029452106,0.0019898016,0.0014051769,0.0059054424],"category_scores_gemma":[0.005854119,0.0005729907,0.00073071785,0.0020703687,0.0021988929,0.0072180354,0.0038386197,0.0022685057,0.001311491],"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.00037987976,0.00012930071,0.0002707797,0.0001927891,0.00005371459,0.00027911115,0.00041145092,0.124160536,0.014312524,0.72610456,0.0028746307,0.13083075],"study_design_scores_gemma":[0.000049061084,0.00008583784,0.00008960521,0.000034549543,0.000019808258,0.0001740153,0.000062494175,0.3047488,0.010784852,0.67287004,0.011049139,0.000031814267],"about_ca_topic_score_codex":0.0007304745,"about_ca_topic_score_gemma":0.00070976274,"teacher_disagreement_score":0.0059054424,"about_ca_system_score_codex":0.0009825237,"about_ca_system_score_gemma":0.0015080386,"threshold_uncertainty_score":0.019755721},"labels":[],"label_agreement":null},{"id":"W3199768470","doi":"10.1007/978-3-030-86520-7_11","title":"Self-bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Bounding overwatch; Computer science; Upper and lower bounds; Algorithm; Margin (machine learning); Bayesian probability; Artificial intelligence; Machine learning; Classifier (UML); Mathematics","score_opus":0.008154924065312942,"score_gpt":0.23681703442254523,"score_spread":0.2286621103572323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199768470","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.0021061057,0.0004786047,0.9917276,0.0003538201,0.00013520771,0.00003829369,0.000049286587,0.00033794847,0.00477312],"genre_scores_gemma":[0.21481812,0.0009165675,0.7561233,0.0011903652,0.0007599619,0.00072466605,0.00060179,0.0013396629,0.023525594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930159,0.0030651074,0.00025416887,0.0010843279,0.0021279815,0.0004525565],"domain_scores_gemma":[0.9860261,0.010178319,0.00035746332,0.0018622278,0.0012643104,0.00031167417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063961735,0.001830967,0.0029592447,0.001286909,0.0011746573,0.0033144022,0.004424566,0.0038960364,0.008791034],"category_scores_gemma":[0.028049719,0.0014470615,0.0014936983,0.002213199,0.0027988115,0.0051597524,0.007027653,0.0060313293,0.0035147266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030382065,0.00017195653,0.0005847066,0.00036669162,0.0001578116,0.00007219381,0.00015019572,0.39317226,0.0028746964,0.343395,0.027724553,0.23102605],"study_design_scores_gemma":[0.000015989504,0.00003127544,0.00006344808,0.000027642569,0.000013480035,0.000032414267,0.0000097314605,0.8896164,0.0008361225,0.107424065,0.0019175994,0.000011902739],"about_ca_topic_score_codex":0.0018656896,"about_ca_topic_score_gemma":0.0028480429,"teacher_disagreement_score":0.008791034,"about_ca_system_score_codex":0.0021681075,"about_ca_system_score_gemma":0.0027001104,"threshold_uncertainty_score":0.03382659},"labels":[],"label_agreement":null},{"id":"W3199799534","doi":"10.1007/978-3-030-86062-2_36","title":"The Presence of Diagrams and Problems Requiring Diagram Construction: Comparing Mathematical Word Problems in Japanese and Canadian Textbooks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics Education and Teaching Techniques","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Diagram; Computer science; Construct (python library); Story-driven modeling; Set (abstract data type); Word (group theory); Use Case Diagram; Mathematics education; Class diagram; Mathematics; Programming language; Unified Modeling Language; Geometry","score_opus":0.03429934897635429,"score_gpt":0.28950202281100706,"score_spread":0.2552026738346528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199799534","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.99467635,0.0005500932,0.0002520053,0.00005119832,0.000012139472,0.000037647653,0.0002702021,0.000012862683,0.00413751],"genre_scores_gemma":[0.99361444,0.0008948099,0.0012917806,0.000044657918,0.000006376526,0.000042038984,0.0010063642,0.000020282674,0.0030791583],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9973557,0.00038831244,0.00033016648,0.00030305382,0.0013560308,0.00026674688],"domain_scores_gemma":[0.9761229,0.00843495,0.00410356,0.00045614134,0.009345014,0.0015374921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016948413,0.000503786,0.0006205178,0.006212784,0.0015839458,0.0027087089,0.00095509115,0.00049382146,0.002459703],"category_scores_gemma":[0.023767456,0.0003220448,0.000302758,0.010760345,0.0015083832,0.00096985174,0.0014399189,0.0005293316,0.00024307451],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004120458,0.00030182692,0.799333,0.0015983098,0.00010054663,0.001995687,0.08883548,0.00077320356,0.0066249548,0.002149636,0.003449882,0.09442539],"study_design_scores_gemma":[0.0000134204765,0.000084332685,0.9442743,0.00030685065,0.00010380826,0.0003761492,0.04040903,0.000492105,0.0014828292,0.00018977026,0.012219332,0.000048139562],"about_ca_topic_score_codex":0.49313238,"about_ca_topic_score_gemma":0.7444241,"teacher_disagreement_score":0.50686765,"about_ca_system_score_codex":0.008533649,"about_ca_system_score_gemma":0.009105553,"threshold_uncertainty_score":0.98052406},"labels":[],"label_agreement":null},{"id":"W3199905177","doi":"10.1007/978-3-030-87334-9_25","title":"3RD: A Multi-criteria Decision-Making Method Based on Three-Way Rankings","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"ELECTRE; Multiple-criteria decision analysis; Ranking (information retrieval); Computer science; Set (abstract data type); Dominance (genetics); Decision theory; Prospect theory; Construct (python library); Data mining; Operations research; Artificial intelligence; Mathematics; Statistics","score_opus":0.029707755805782478,"score_gpt":0.30689651142228513,"score_spread":0.27718875561650264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199905177","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.0033594365,0.00017196377,0.9924683,0.00010135147,0.00014443936,0.0001960196,0.00019426116,0.00057273253,0.0027914618],"genre_scores_gemma":[0.040373854,0.00010328857,0.95547193,0.00007525663,0.000044127824,0.00040944558,0.00025541187,0.0001568758,0.0031097808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447435,0.002453439,0.0004387976,0.0006011591,0.001774866,0.0002574768],"domain_scores_gemma":[0.99746895,0.0011996481,0.00015204694,0.00023048744,0.00080969254,0.0001392232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005682969,0.002171409,0.0034484433,0.0042631268,0.0014720998,0.0034445797,0.0024838925,0.0015667672,0.01345737],"category_scores_gemma":[0.007393118,0.0009157975,0.0048137894,0.00325992,0.0008807816,0.0023187383,0.0023948776,0.002109201,0.0018681625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063218386,0.00033772306,0.0015917424,0.001398949,0.001047232,0.00039038714,0.0006675842,0.16141029,0.008257094,0.06295749,0.010711461,0.7505978],"study_design_scores_gemma":[0.00021324737,0.00063331093,0.0014988203,0.00023576504,0.00046540922,0.00036062693,0.00023998237,0.87185764,0.006689661,0.09251138,0.025039861,0.0002542299],"about_ca_topic_score_codex":0.00345755,"about_ca_topic_score_gemma":0.0054937224,"teacher_disagreement_score":0.01345737,"about_ca_system_score_codex":0.0017382791,"about_ca_system_score_gemma":0.0026241066,"threshold_uncertainty_score":0.04501933},"labels":[],"label_agreement":null},{"id":"W3199928492","doi":"10.1007/978-3-030-86982-3_9","title":"Conceptual Relevance Index for Identifying Actionable Formal Concepts","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"HEC Montréal; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Relevance (law); Index (typography); Formal methods; Formal description; Information retrieval; Software engineering; Programming language","score_opus":0.03864498562993494,"score_gpt":0.2914611830790264,"score_spread":0.25281619744909145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199928492","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.17545556,0.004671878,0.7826828,0.00052265276,0.00033165578,0.0004278528,0.0029852109,0.0018994926,0.031022806],"genre_scores_gemma":[0.71018547,0.0008598452,0.28223574,0.00006793097,0.00019132881,0.0002577207,0.0027225888,0.000107133375,0.0033722415],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979942,0.00029074418,0.00017352105,0.0003526839,0.0010695901,0.00011924848],"domain_scores_gemma":[0.99639976,0.0018999199,0.00029900696,0.00039216413,0.0008096717,0.00019941613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940422,0.0005567943,0.00087681675,0.010390074,0.00072581007,0.0023124393,0.00090482563,0.00077181164,0.0049984176],"category_scores_gemma":[0.010802295,0.0001677047,0.00079701206,0.0052626417,0.0008273066,0.0038832333,0.0013879661,0.0009986322,0.0011765537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009848842,0.00044534958,0.016321559,0.0010150131,0.00019115926,0.00032246517,0.0006693643,0.014450529,0.02272114,0.16076578,0.0135887135,0.76852393],"study_design_scores_gemma":[0.00014106253,0.0009922266,0.031077338,0.00036828322,0.00060529826,0.0014370028,0.0014866164,0.53217894,0.02562979,0.36924794,0.0366137,0.00022175367],"about_ca_topic_score_codex":0.0008863773,"about_ca_topic_score_gemma":0.0007649296,"teacher_disagreement_score":0.010390074,"about_ca_system_score_codex":0.0010901843,"about_ca_system_score_gemma":0.00094663,"threshold_uncertainty_score":0.016721368},"labels":[],"label_agreement":null},{"id":"W3199989184","doi":"10.1007/978-3-030-86365-4_34","title":"FMSNet: Underwater Image Restoration by Learning from a Synthesized Dataset","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"McMaster University","funders":"","keywords":"Underwater; Computer science; Convolutional neural network; Artificial intelligence; Image restoration; Process (computing); Feature (linguistics); Image (mathematics); Artificial neural network; Pattern recognition (psychology); Decomposition; Image processing; Computer vision","score_opus":0.016406195931919245,"score_gpt":0.2518439014843075,"score_spread":0.23543770555238827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199989184","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.03328883,0.0012144194,0.86855197,0.00034064965,0.00069379987,0.00043224712,0.013030918,0.07579781,0.0066492264],"genre_scores_gemma":[0.07682337,0.0004965305,0.862501,0.00023588874,0.00014540697,0.0003087288,0.044169415,0.002539264,0.012780326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995833,0.0000467285,0.000015727803,0.00017150951,0.0001287316,0.00005404672],"domain_scores_gemma":[0.99969745,0.00006999181,0.000018065763,0.000121969904,0.00007403508,0.000018519047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000775033,0.0017772382,0.0011500573,0.0014094132,0.00041219767,0.00076766836,0.0021527603,0.0013401335,0.0075836764],"category_scores_gemma":[0.0015515226,0.0005567839,0.0013170337,0.0011659857,0.00032750683,0.0010360596,0.0012382759,0.0012601274,0.0050888145],"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.0006525747,0.0002944539,0.0009802848,0.00034114442,0.0002458296,0.00019038044,0.00003715892,0.060810443,0.026641425,0.0018048312,0.104260124,0.8037412],"study_design_scores_gemma":[0.000089686095,0.00017909365,0.0012048677,0.00004310797,0.000066379456,0.00023344498,0.000040836974,0.93776435,0.030795233,0.0036501447,0.025893085,0.000039691684],"about_ca_topic_score_codex":0.007591587,"about_ca_topic_score_gemma":0.012112014,"teacher_disagreement_score":0.007591587,"about_ca_system_score_codex":0.0004662926,"about_ca_system_score_gemma":0.0009154441,"threshold_uncertainty_score":0.025369942},"labels":[],"label_agreement":null},{"id":"W3200109625","doi":"10.1007/978-3-031-04673-5_13","title":"Robustness Analysis of Deep Learning Frameworks on Mobile Platforms","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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 Calgary","funders":"","keywords":"Robustness (evolution); Computer science; Deep learning; Mobile device; Artificial intelligence; Deep neural networks; Machine learning; Artificial neural network; Computer engineering","score_opus":0.010323369697730228,"score_gpt":0.2548251061674014,"score_spread":0.24450173646967116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200109625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042511947,0.0009236419,0.9473472,0.00067310286,0.00008131204,0.000043520293,0.00013971003,0.0005409671,0.0077385944],"genre_scores_gemma":[0.93691367,0.00082165026,0.051419698,0.00019328984,0.00011762595,0.00011137015,0.00023281053,0.00034020212,0.00984972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898654,0.00031478074,0.000031271633,0.00017146941,0.0002931495,0.00020270734],"domain_scores_gemma":[0.99527836,0.0033664303,0.00031104655,0.00040971776,0.00047517172,0.00015919826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023279751,0.0011627737,0.00094911904,0.0007558355,0.00043998004,0.0014095213,0.0015815978,0.001485286,0.0045942976],"category_scores_gemma":[0.011329136,0.00061867334,0.00088383124,0.00053942204,0.0016693202,0.0021941816,0.002691261,0.0023943365,0.00045353145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010021204,0.000025024712,0.00028876937,0.000063855936,0.000040205658,0.00005010724,0.000030055155,0.9088111,0.0021401406,0.06735873,0.0015214204,0.019570436],"study_design_scores_gemma":[0.0000018666852,0.000014256295,0.00007081909,0.00000668756,0.0000041619232,0.0000069642824,0.000004647515,0.9839229,0.00042695797,0.0153556755,0.0001817636,0.0000032476278],"about_ca_topic_score_codex":0.0028883435,"about_ca_topic_score_gemma":0.0016528049,"teacher_disagreement_score":0.0045942976,"about_ca_system_score_codex":0.0017982903,"about_ca_system_score_gemma":0.0008613532,"threshold_uncertainty_score":0.015369475},"labels":[],"label_agreement":null},{"id":"W3200111860","doi":"10.1007/978-3-030-87802-3_1","title":"Text-Independent Speaker Verification Employing CNN-LSTM-TDNN Hybrid Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Speech recognition; NIST; Artificial neural network; Time delay neural network; Speaker recognition; Artificial intelligence; Pattern recognition (psychology); Utterance; Pooling; Convolutional neural network","score_opus":0.023570762265196613,"score_gpt":0.2391657481355195,"score_spread":0.21559498587032289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200111860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04848864,0.0017579561,0.9297771,0.00030708913,0.0008856139,0.00015946744,0.00088790565,0.008526504,0.009209638],"genre_scores_gemma":[0.5384581,0.0011990562,0.42389527,0.0004063901,0.0003433095,0.00018592938,0.0033562824,0.000657886,0.03149784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934477,0.000082690385,0.000039464783,0.00023535932,0.00018565884,0.00011212811],"domain_scores_gemma":[0.99923396,0.00017499525,0.000049912134,0.00013121334,0.0003712811,0.00003868389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092699716,0.0011240725,0.0009530953,0.0005795609,0.0005195237,0.0009159654,0.0011937647,0.001140576,0.0070190104],"category_scores_gemma":[0.0015542404,0.00044125417,0.0009201952,0.0004760952,0.0002582215,0.0012968143,0.0011152995,0.0014207818,0.0074231788],"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.0007316186,0.000104390696,0.0008760438,0.00017541791,0.00016529874,0.00017527994,0.000045938457,0.01960722,0.18035872,0.00096550083,0.006325971,0.7904686],"study_design_scores_gemma":[0.000023699786,0.00015905678,0.0020581593,0.000044248663,0.000160252,0.00031032055,0.000047629972,0.8405095,0.1510859,0.0011863491,0.004367374,0.000047488185],"about_ca_topic_score_codex":0.004992909,"about_ca_topic_score_gemma":0.0102827335,"teacher_disagreement_score":0.0070190104,"about_ca_system_score_codex":0.00045877622,"about_ca_system_score_gemma":0.0010060334,"threshold_uncertainty_score":0.023480952},"labels":[],"label_agreement":null},{"id":"W3200245047","doi":"10.1007/978-3-030-87583-1_20","title":"Deep Video Networks for Automatic Assessment of Aortic Stenosis in Echocardiography","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Stenosis; Artificial intelligence; Medicine; Radiology; Deep learning; Segmentation; Cardiology; Internal medicine; Pattern recognition (psychology)","score_opus":0.012665663685565248,"score_gpt":0.31461897848162557,"score_spread":0.3019533147960603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200245047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034221772,0.0105686635,0.94407845,0.0006869426,0.000607224,0.000065397944,0.0015689865,0.0019059913,0.0062966803],"genre_scores_gemma":[0.460219,0.01220572,0.48284072,0.00064343243,0.0009499515,0.0001390563,0.0035145166,0.00040024106,0.039087348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988556,0.000022304544,0.000006117888,0.00003094158,0.000036938472,0.000018122091],"domain_scores_gemma":[0.99977857,0.00012522702,0.000011853604,0.000016219563,0.000055435023,0.000012825434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003843529,0.0006790053,0.00037325578,0.0005134747,0.00009983974,0.000493457,0.00046891306,0.00066989294,0.0030365905],"category_scores_gemma":[0.00076006446,0.00021691974,0.0004185682,0.00035907756,0.00013213443,0.00043368174,0.0005097336,0.0006238171,0.0013236577],"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.00011259101,0.000054710177,0.0007969783,0.00009676432,0.00005224466,0.00009349562,0.000022945149,0.031260185,0.014654815,0.0020210475,0.013461919,0.93737227],"study_design_scores_gemma":[0.000009053863,0.00009409642,0.0024502724,0.00006844961,0.000058916554,0.00032475818,0.000022554448,0.96500087,0.016988218,0.006685872,0.0082757175,0.000021245813],"about_ca_topic_score_codex":0.0030198034,"about_ca_topic_score_gemma":0.0066325055,"teacher_disagreement_score":0.0030365905,"about_ca_system_score_codex":0.00022463237,"about_ca_system_score_gemma":0.00023852783,"threshold_uncertainty_score":0.01015842},"labels":[],"label_agreement":null},{"id":"W3200263231","doi":"10.1007/978-3-662-63958-0_31","title":"Absentia: Secure Multiparty Computation on Ethereum","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and 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":"Concordia University","funders":"","keywords":"Computer science; Protocol (science); Blockchain; Benchmark (surveying); Computation; Cryptography; Verifiable secret sharing; Function (biology); Secure multi-party computation; Spec#; Distributed computing; Computer security; Algorithm; Programming language","score_opus":0.014502940087544424,"score_gpt":0.2519162808040286,"score_spread":0.23741334071648418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200263231","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.011326725,0.0010661881,0.8707113,0.00077958574,0.0008676289,0.00021725999,0.0003942036,0.0047985394,0.10983851],"genre_scores_gemma":[0.41819918,0.0020738805,0.35267425,0.0005970227,0.0004965814,0.0005185278,0.001391969,0.0022579974,0.22179055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993814,0.00013307348,0.000031806172,0.000095065516,0.00026255188,0.00009608627],"domain_scores_gemma":[0.999678,0.00009948901,0.0000149892685,0.00015071238,0.000028722596,0.00002802659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047736,0.0006564914,0.00063509314,0.0006347516,0.001000178,0.0025128555,0.0013747338,0.0009477856,0.017271841],"category_scores_gemma":[0.0013674651,0.00047252458,0.0007398486,0.00081895874,0.0010979192,0.0041766474,0.0032923722,0.003081425,0.006760754],"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.00027091766,0.0001095283,0.00010800663,0.00023660438,0.000027071765,0.00017092822,0.00013311242,0.010253586,0.0117830355,0.78810734,0.016388724,0.17241122],"study_design_scores_gemma":[0.00009445845,0.00011040743,0.0002394269,0.00013930185,0.00003163494,0.00046572697,0.00004603037,0.12714675,0.029544715,0.63601875,0.20610607,0.000056679208],"about_ca_topic_score_codex":0.00023624842,"about_ca_topic_score_gemma":0.00033365074,"teacher_disagreement_score":0.017271841,"about_ca_system_score_codex":0.00078047905,"about_ca_system_score_gemma":0.00066544797,"threshold_uncertainty_score":0.057780087},"labels":[],"label_agreement":null},{"id":"W3200349658","doi":"10.1007/978-3-662-63958-0_26","title":"Short Paper: Ballot Secrecy for Liquid Democracy","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Concordia University","funders":"","keywords":"Ballot; Secrecy; Delegate; Voting; Direct democracy; Democracy; Computer science; Legislation; Internet privacy; Computer security; Political science; Overhead (engineering); Law and economics; Law; Economics; Politics","score_opus":0.016474857939738578,"score_gpt":0.24851021811151416,"score_spread":0.2320353601717756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200349658","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.011284146,0.023830168,0.0497957,0.13754088,0.042110723,0.00009248191,0.0016510923,0.00030452423,0.73339033],"genre_scores_gemma":[0.28917846,0.015139,0.0065254583,0.013169882,0.03088215,0.00020899225,0.0009920758,0.0005542536,0.6433497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988777,0.00043889834,0.00004925205,0.00018914987,0.00032171732,0.00012321016],"domain_scores_gemma":[0.9959073,0.0029012996,0.00019235443,0.00033686621,0.00048629649,0.00017592029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011627143,0.0007625169,0.000745895,0.0007938547,0.0020967617,0.0034283835,0.00083100743,0.004387341,0.061417107],"category_scores_gemma":[0.008089716,0.00037900644,0.0006675247,0.0020190668,0.00217884,0.006267612,0.0013039067,0.005268689,0.012472731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006275765,0.000036954203,0.000077512355,0.00018812442,0.000012400877,0.00003269549,0.00010158119,0.0013509386,0.00018543337,0.7033681,0.27641916,0.018164318],"study_design_scores_gemma":[0.00002619784,0.000019514999,0.00022569233,0.00011440903,0.0000135659175,0.00003748307,0.00005414901,0.0021951718,0.00032169963,0.86541617,0.1315604,0.000015586633],"about_ca_topic_score_codex":0.001453145,"about_ca_topic_score_gemma":0.0014672462,"teacher_disagreement_score":0.061417107,"about_ca_system_score_codex":0.0024863547,"about_ca_system_score_gemma":0.0015753673,"threshold_uncertainty_score":0.20546067},"labels":[],"label_agreement":null},{"id":"W3200579651","doi":"10.1007/978-3-030-87802-3_18","title":"An Ensemble Approach for the Diagnosis of COVID-19 from Speech and Cough Sounds","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Softmax function; Speech recognition; Random forest; Artificial intelligence; Convolutional neural network; Hidden Markov model; Feature (linguistics); Artificial neural network; Pattern recognition (psychology); Machine learning","score_opus":0.05260598119568732,"score_gpt":0.3249145686843563,"score_spread":0.272308587488669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200579651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028894033,0.0025512606,0.9631656,0.00030792176,0.0002511447,0.0000946621,0.00047957574,0.0014671476,0.0027886839],"genre_scores_gemma":[0.46939552,0.0021175425,0.51517594,0.00049700285,0.0006715505,0.00021469755,0.0023266792,0.00020583218,0.009395244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918157,0.00014742248,0.000078308854,0.00022749668,0.00024136658,0.00012397264],"domain_scores_gemma":[0.99901426,0.00046573475,0.00004285787,0.00006662597,0.00034783757,0.000062588406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218282,0.001582474,0.0016477564,0.0018068469,0.00066737074,0.0012301386,0.001403604,0.0015418438,0.0019456762],"category_scores_gemma":[0.0022141796,0.00037561957,0.0017011977,0.0012228894,0.00024468638,0.0008793641,0.0013177075,0.001545005,0.0015523938],"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.00029195024,0.0002303055,0.0047673434,0.00013951305,0.00032268366,0.00046457606,0.00014584884,0.05739264,0.02246851,0.0013351137,0.004833325,0.9076082],"study_design_scores_gemma":[0.000010924503,0.00019007365,0.0032406554,0.000038399063,0.00021437692,0.00045760878,0.00010604364,0.98292714,0.0070687775,0.0034368448,0.0022764008,0.000032748627],"about_ca_topic_score_codex":0.006732549,"about_ca_topic_score_gemma":0.009833156,"teacher_disagreement_score":0.006732549,"about_ca_system_score_codex":0.00034983642,"about_ca_system_score_gemma":0.0006517597,"threshold_uncertainty_score":0.013386726},"labels":[],"label_agreement":null},{"id":"W3200582272","doi":"10.1007/978-3-030-87193-2_25","title":"Learning Consistency- and Discrepancy-Context for 2D Organ Segmentation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Segmentation; Computer science; Context (archaeology); Consistency (knowledge bases); Artificial intelligence; Overhead (engineering); Image segmentation; Ground truth; Variance (accounting); Market segmentation; Pattern recognition (psychology); Data mining","score_opus":0.018253255734269894,"score_gpt":0.26415022849453845,"score_spread":0.24589697276026856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200582272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023320982,0.0011393087,0.9719135,0.00024261768,0.00010356586,0.0000498904,0.00023438182,0.0023312175,0.00066450535],"genre_scores_gemma":[0.39226127,0.00071221404,0.60042894,0.00041570445,0.00038027065,0.00019353765,0.0023048387,0.0010913578,0.0022119214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879897,0.00022967518,0.00007414179,0.00052520755,0.00024114671,0.00013083141],"domain_scores_gemma":[0.9979157,0.0010103068,0.00022116107,0.0003908005,0.00031101803,0.00015113884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018405626,0.0015803477,0.0032637056,0.0017060318,0.00071210763,0.0017146987,0.0038198684,0.003467733,0.0024052532],"category_scores_gemma":[0.005139221,0.0014633609,0.002018568,0.001752179,0.0012754622,0.0019558847,0.00401514,0.0029242686,0.0012708422],"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.0009293356,0.00020415301,0.0032163893,0.00046806666,0.00022615507,0.00021208398,0.00017368526,0.31700546,0.029525531,0.01119078,0.007570271,0.62927806],"study_design_scores_gemma":[0.000017665196,0.00005191243,0.00040345723,0.00002026414,0.000016972452,0.00007187942,0.00001580387,0.98627466,0.0026562335,0.00964912,0.0008070069,0.000014961547],"about_ca_topic_score_codex":0.0037712175,"about_ca_topic_score_gemma":0.0070704073,"teacher_disagreement_score":0.0038198684,"about_ca_system_score_codex":0.0010183296,"about_ca_system_score_gemma":0.001410261,"threshold_uncertainty_score":0.009733915},"labels":[],"label_agreement":null},{"id":"W3200693607","doi":"10.1007/978-3-030-87334-9_22","title":"Tolerance-Based Short Text Sentiment Classifier","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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 Winnipeg","funders":"","keywords":"Computer science; Sentiment analysis; Classifier (UML); Artificial intelligence; Polarity (international relations); Natural language processing; Pattern recognition (psychology)","score_opus":0.02704774461835764,"score_gpt":0.26115359351646295,"score_spread":0.23410584889810532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200693607","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.15296762,0.0024154603,0.8147416,0.00071365474,0.001672799,0.0005239141,0.0029341043,0.0065371357,0.017493691],"genre_scores_gemma":[0.6787774,0.0012759152,0.27187335,0.0005271966,0.0012807893,0.00048814996,0.013484925,0.0005855688,0.031706695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991233,0.000094099836,0.00010659828,0.0001546398,0.00041599848,0.00010532996],"domain_scores_gemma":[0.9984339,0.00031913823,0.0001322697,0.000119762575,0.0008937939,0.00010117832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019678,0.0008409246,0.0011703143,0.0019159201,0.0008064228,0.0012632014,0.00097419467,0.0007288376,0.0068134796],"category_scores_gemma":[0.0026790025,0.00017357344,0.0007504434,0.0014431422,0.00021257681,0.0014386846,0.0009292295,0.001003556,0.0056764227],"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.0010041707,0.00032496985,0.0034152141,0.00023410283,0.00011427262,0.00019196597,0.00007378719,0.006324932,0.05257789,0.0026414108,0.029565947,0.90353143],"study_design_scores_gemma":[0.00010935558,0.0006474721,0.007993106,0.00006695146,0.00026017748,0.000607726,0.00021337949,0.9199904,0.04331779,0.006447877,0.020272473,0.000073201336],"about_ca_topic_score_codex":0.0011099306,"about_ca_topic_score_gemma":0.0015973366,"teacher_disagreement_score":0.0068134796,"about_ca_system_score_codex":0.0004379865,"about_ca_system_score_gemma":0.00071518985,"threshold_uncertainty_score":0.022793293},"labels":[],"label_agreement":null},{"id":"W3200693755","doi":"10.1007/978-3-030-86486-6_38","title":"Continual Learning with Dual Regularizations","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Computer science; Forgetting; Interleaving; Dual (grammatical number); Artificial intelligence; Set (abstract data type); Representation (politics); Machine learning; Process (computing); Key (lock)","score_opus":0.012988653077602878,"score_gpt":0.22655033146337047,"score_spread":0.2135616783857676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200693755","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.009052796,0.000941626,0.9839716,0.00040525256,0.00011087508,0.000023247107,0.00006272806,0.0003671263,0.005064604],"genre_scores_gemma":[0.4765752,0.0014622704,0.48100853,0.00053785386,0.0005594328,0.00027978298,0.00071478134,0.00061489036,0.0382473],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994394,0.0002138827,0.00002625282,0.00015928084,0.0001167251,0.000044479286],"domain_scores_gemma":[0.998519,0.00088709587,0.000060874358,0.00024566663,0.00018851011,0.000098885655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019311514,0.0007551073,0.0010727793,0.00064384757,0.0003888104,0.001044082,0.0018429427,0.0016701961,0.0061575626],"category_scores_gemma":[0.0047762017,0.00057791546,0.00067766977,0.0006841182,0.0013370699,0.0025104135,0.0032071539,0.002917332,0.001400735],"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.00033916545,0.00025528372,0.0005444852,0.0003819791,0.00013757072,0.00009506634,0.00015520345,0.2989223,0.008110464,0.24333799,0.014833696,0.43288678],"study_design_scores_gemma":[0.000011496185,0.00003665063,0.00007185219,0.000018534918,0.000009432725,0.00003113956,0.000009174356,0.91952443,0.00087443774,0.077547476,0.0018559715,0.000009395842],"about_ca_topic_score_codex":0.0010526357,"about_ca_topic_score_gemma":0.0012857419,"teacher_disagreement_score":0.0061575626,"about_ca_system_score_codex":0.00060341024,"about_ca_system_score_gemma":0.000551086,"threshold_uncertainty_score":0.020599127},"labels":[],"label_agreement":null},{"id":"W3200773861","doi":"10.1007/978-3-031-44274-2_3","title":"The Fence Complexity of Persistent Sets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linearizability; Computer science; Fence (mathematics); Crash; Property (philosophy); Lock (firearm); Set (abstract data type); Shared memory; Distributed computing; Theoretical computer science; Extension (predicate logic); Algorithm; Parallel computing; Programming language; Mathematics; Correctness","score_opus":0.04555124974121188,"score_gpt":0.2630009112628464,"score_spread":0.21744966152163453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200773861","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.28673786,0.0066299746,0.21239004,0.014116115,0.0008618371,0.00009343575,0.0013362169,0.0004984079,0.47733614],"genre_scores_gemma":[0.9058575,0.003744651,0.018941687,0.00068350387,0.00065254077,0.00015603568,0.000636431,0.00022687778,0.06910081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.0001549466,0.000055543118,0.00019466228,0.0004775664,0.00021676336],"domain_scores_gemma":[0.995165,0.0034609872,0.00019966043,0.00064746203,0.00031539946,0.0002114578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009553683,0.00047544058,0.001041023,0.0015342137,0.0028150305,0.0055685095,0.0018675331,0.0017713298,0.013445993],"category_scores_gemma":[0.008160786,0.000767684,0.00085199776,0.0029577212,0.004511566,0.018107053,0.0028481418,0.005091809,0.0011194742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026251733,0.0000072664798,0.00009891308,0.00002862905,0.000003287335,0.000028071594,0.000117076466,0.0019792798,0.00014899166,0.9894093,0.0021145272,0.0060382932],"study_design_scores_gemma":[0.000004990834,0.0000033058384,0.00006391985,0.000010534286,0.0000028184447,0.000036484293,0.0000434151,0.0022371334,0.00014464746,0.9941362,0.003311441,0.000005106431],"about_ca_topic_score_codex":0.0025454103,"about_ca_topic_score_gemma":0.0014528836,"teacher_disagreement_score":0.013445993,"about_ca_system_score_codex":0.002839477,"about_ca_system_score_gemma":0.0013285404,"threshold_uncertainty_score":0.04498136},"labels":[],"label_agreement":null},{"id":"W3200904653","doi":"10.1007/978-3-030-32689-0_3","title":"Propagating Uncertainty Across Cascaded Medical Imaging Tasks for Improved Deep Learning Inference","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Montreal Neurological Institute and Hospital; NeuroRx Research (Canada); McGill University","funders":"","keywords":"Computer science; Inference; Segmentation; Artificial intelligence; Deep learning; Pattern recognition (psychology); Voxel; Machine learning; Dropout (neural networks); Image segmentation","score_opus":0.008051284158769389,"score_gpt":0.29077299225749564,"score_spread":0.28272170809872627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200904653","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.008348558,0.00042556511,0.9891371,0.00028101457,0.00006984261,0.000035689023,0.00018133702,0.00084083976,0.0006800317],"genre_scores_gemma":[0.4085384,0.00079158443,0.5787622,0.00057088543,0.00036934155,0.00021126571,0.0014079512,0.00051401474,0.008834377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990779,0.00020128835,0.00007168442,0.0002523191,0.00029091974,0.00010576685],"domain_scores_gemma":[0.9963727,0.0024489043,0.00019224714,0.00047426188,0.00038973082,0.00012214297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028756573,0.0016708435,0.0017020919,0.0010345702,0.00065097003,0.0013376672,0.0026755242,0.002871015,0.0054570152],"category_scores_gemma":[0.008368977,0.0016180351,0.0017000791,0.0011460776,0.00095124467,0.002726804,0.0036867613,0.004254912,0.0011033608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028798875,0.00012696804,0.0009648941,0.00014920994,0.00018694605,0.00016575743,0.00007064396,0.6958006,0.009043574,0.013791517,0.005454852,0.27395713],"study_design_scores_gemma":[0.0000037778473,0.000014631329,0.00006804572,0.000006116632,0.000010987125,0.000015163634,0.0000018336881,0.9935802,0.0014815117,0.0045876936,0.00022615468,0.0000037734796],"about_ca_topic_score_codex":0.008777508,"about_ca_topic_score_gemma":0.013316525,"teacher_disagreement_score":0.008777508,"about_ca_system_score_codex":0.0013457425,"about_ca_system_score_gemma":0.0014635525,"threshold_uncertainty_score":0.018255532},"labels":[],"label_agreement":null},{"id":"W3200908759","doi":"10.1007/978-3-030-86062-2_34","title":"The Science of Seeing Science: Examining the Visuality Hypothesis","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Thomas University; University of New Brunswick","funders":"","keywords":"Discipline; Space (punctuation); Computer science; Imperfect; Visualization; Data science; Sociology; Social science; Artificial intelligence","score_opus":0.05070707667579359,"score_gpt":0.30571477226864757,"score_spread":0.25500769559285397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200908759","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.7934929,0.0063315807,0.053637695,0.007942665,0.00032445035,0.00029680633,0.0007588035,0.00016042053,0.13705471],"genre_scores_gemma":[0.98662776,0.0013351489,0.009628409,0.00045471816,0.00017740118,0.00022789907,0.0002250179,0.000064903244,0.0012587836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875366,0.007490146,0.00057089975,0.0011384407,0.0027518522,0.0005120121],"domain_scores_gemma":[0.822517,0.14865096,0.016003877,0.0057859975,0.0047929124,0.00224923],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.014479199,0.00045154773,0.0005889398,0.009840968,0.00146216,0.008210645,0.0014894891,0.0010777732,0.007804374],"category_scores_gemma":[0.09575597,0.0004197331,0.00072103215,0.009319667,0.010548886,0.011599702,0.0069430196,0.0019088918,0.0006534415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013911171,0.0004803413,0.31620926,0.0037235965,0.0004795627,0.00079308794,0.08143089,0.0022427128,0.0069672223,0.3492584,0.0067786453,0.23024519],"study_design_scores_gemma":[0.00013130615,0.0006151628,0.39560243,0.0033095737,0.00042652205,0.0016989872,0.107972376,0.008986103,0.005044229,0.43326697,0.04276103,0.0001852366],"about_ca_topic_score_codex":0.0012595885,"about_ca_topic_score_gemma":0.00083303225,"teacher_disagreement_score":0.99853784,"about_ca_system_score_codex":0.0017691667,"about_ca_system_score_gemma":0.0015308129,"threshold_uncertainty_score":0.076574266},"labels":[],"label_agreement":null},{"id":"W3200919677","doi":"10.1007/978-3-030-79290-9_4","title":"Metabolic Pathway Prediction using Non-negative Matrix Factorization with Improved Precision","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","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":"Non-negative matrix factorization; Inference; Computer science; Probabilistic logic; Matrix decomposition; Cluster analysis; Metabolic pathway; Graph; Artificial intelligence; Genome; Computational biology; Machine learning; Data mining; Theoretical computer science; Biology; Gene; Genetics; Eigenvalues and eigenvectors","score_opus":0.007803126388566362,"score_gpt":0.24468162849882738,"score_spread":0.236878502110261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200919677","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.038129106,0.0015875215,0.952385,0.00027858428,0.000249658,0.000079122205,0.0011173168,0.0046160584,0.0015576879],"genre_scores_gemma":[0.2557265,0.00067833054,0.73582923,0.0001959686,0.0002352413,0.0001445838,0.0037038946,0.00018194463,0.0033042626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926025,0.00015004032,0.000059931564,0.00025048002,0.0002054882,0.000073832045],"domain_scores_gemma":[0.99822825,0.000885906,0.00010510902,0.00027618188,0.00045713809,0.00004743109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016086815,0.0015021767,0.0015633272,0.0010950873,0.000624362,0.0011641313,0.0011582026,0.0011399736,0.0025365201],"category_scores_gemma":[0.0035706225,0.0005041408,0.0013758582,0.0011171427,0.0003649286,0.0016272306,0.0010131134,0.0014245863,0.002226517],"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.0010973632,0.00035303005,0.0024171583,0.0003410913,0.00033386715,0.00025855238,0.00008597122,0.14023037,0.04107016,0.004184654,0.017699907,0.79192793],"study_design_scores_gemma":[0.000051760595,0.00006883537,0.00051494176,0.0000118955395,0.00003998982,0.00007616918,0.000015284637,0.99003536,0.005039082,0.0031168426,0.0010097135,0.00002007159],"about_ca_topic_score_codex":0.0059133503,"about_ca_topic_score_gemma":0.00778865,"teacher_disagreement_score":0.0059133503,"about_ca_system_score_codex":0.00035123192,"about_ca_system_score_gemma":0.00088341575,"threshold_uncertainty_score":0.011757851},"labels":[],"label_agreement":null},{"id":"W3201059575","doi":"10.1007/978-3-030-87583-1_9","title":"Robust Ultrasound-to-Ultrasound Registration for Intra-operative Brain Shift Correction with a Siamese Neural Network","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Artificial neural network; Ultrasound; Artificial intelligence; Image registration; Radiology; Medicine","score_opus":0.01454031125714971,"score_gpt":0.2510639613269858,"score_spread":0.23652365006983606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201059575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00400174,0.000368179,0.9938413,0.00012951775,0.00007076563,0.000025736872,0.000051076266,0.0005975474,0.00091414724],"genre_scores_gemma":[0.1783006,0.0009904325,0.804884,0.00023672287,0.00012472742,0.00013914284,0.0004148675,0.00036245896,0.0145471115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971896,0.000048456975,0.000019891102,0.000083952735,0.00010352226,0.000025167596],"domain_scores_gemma":[0.9996669,0.0001261809,0.000027396954,0.000056048313,0.000108165535,0.000015244877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073498074,0.00071571546,0.00054935145,0.00034515763,0.00026081828,0.00066840893,0.000936042,0.0010941562,0.0030963097],"category_scores_gemma":[0.0014328695,0.00045672173,0.00077275647,0.00054900435,0.00037968124,0.0008063233,0.0011559845,0.0013590273,0.001331008],"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.00016883267,0.00009005912,0.00043630536,0.00010592074,0.00013899073,0.00011025607,0.00005832682,0.2018151,0.04456082,0.005753744,0.005836652,0.74092495],"study_design_scores_gemma":[0.0000047613594,0.000051714615,0.0003098102,0.000008162261,0.00002254251,0.00013933708,0.000007208373,0.98437345,0.011362853,0.0018552783,0.0018519522,0.000012998703],"about_ca_topic_score_codex":0.0039652465,"about_ca_topic_score_gemma":0.008057718,"teacher_disagreement_score":0.0039652465,"about_ca_system_score_codex":0.00040730624,"about_ca_system_score_gemma":0.0010365798,"threshold_uncertainty_score":0.010358214},"labels":[],"label_agreement":null},{"id":"W3201237299","doi":"10.1007/978-3-030-87802-3_2","title":"End-to-End Voice Spoofing Detection Employing Time Delay Neural Networks and Higher Order Statistics","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Spoofing attack; Speech recognition; Artificial neural network; Higher-order statistics; Artificial intelligence; Computer network; Telecommunications; Signal processing","score_opus":0.018339856872574663,"score_gpt":0.23781070371785273,"score_spread":0.21947084684527807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201237299","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.06713439,0.0005489538,0.92484665,0.000114889546,0.00013350163,0.000047747242,0.0003262403,0.0024153285,0.0044322726],"genre_scores_gemma":[0.5459833,0.00069304864,0.43370637,0.00013072486,0.00009737019,0.000056146793,0.00095955597,0.00018826139,0.018185185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998363,0.000017571609,0.000010013376,0.00003469507,0.00007324793,0.00002811094],"domain_scores_gemma":[0.99961567,0.0001776015,0.000025004092,0.000031944117,0.00013329953,0.000016331633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029373722,0.00063739746,0.00045976933,0.0004934834,0.0002857892,0.00078929414,0.00048129013,0.0007049305,0.0021105232],"category_scores_gemma":[0.00072433724,0.00024714592,0.00024484273,0.00038317853,0.00019570735,0.000982539,0.00045974678,0.0006003567,0.0014656535],"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.00062247535,0.00023793882,0.0026919676,0.00013388156,0.00006637049,0.00028875924,0.0000518913,0.044385727,0.29222745,0.003713436,0.0029737265,0.6526063],"study_design_scores_gemma":[0.000009803482,0.00011869145,0.002995249,0.000016518601,0.000027458726,0.0002736669,0.00002530644,0.87319607,0.11950715,0.0019726167,0.0018314243,0.000025973655],"about_ca_topic_score_codex":0.0015211311,"about_ca_topic_score_gemma":0.0050823754,"teacher_disagreement_score":0.0021105232,"about_ca_system_score_codex":0.00031702363,"about_ca_system_score_gemma":0.00039191754,"threshold_uncertainty_score":0.007060349},"labels":[],"label_agreement":null},{"id":"W3201392051","doi":"10.1007/978-3-030-87583-1_11","title":"Evaluation of Low-Cost Hardware Alternatives for 3D Freehand Ultrasound Reconstruction in Image-Guided Neurosurgery","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital; Concordia University","funders":"","keywords":"Neurosurgery; Computer science; Computer vision; Ultrasound; Medical physics; Artificial intelligence; Radiology; Medicine","score_opus":0.07198891706177969,"score_gpt":0.33882462450741163,"score_spread":0.26683570744563195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201392051","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.75081706,0.0055487966,0.22456476,0.00030613906,0.00022985713,0.0003257626,0.00085732085,0.0017695527,0.015580863],"genre_scores_gemma":[0.8330799,0.001424336,0.15860693,0.00007537626,0.000024701998,0.000094681774,0.00067038956,0.00027941252,0.0057442226],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992867,0.00015937697,0.000030353589,0.00006191305,0.00039787957,0.000063833075],"domain_scores_gemma":[0.99776816,0.0014049262,0.00012462719,0.00017371503,0.00046591167,0.00006264186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061636086,0.0004718695,0.00035986493,0.0008465568,0.0001282155,0.0010149103,0.0011525414,0.00062109827,0.011001077],"category_scores_gemma":[0.0030557313,0.00030554435,0.0003124689,0.0006650346,0.00021172622,0.00087626517,0.0004703713,0.00021524516,0.0008726814],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059960177,0.0007608026,0.004369811,0.0017900871,0.00015837679,0.00050003116,0.00016575283,0.08730041,0.2828795,0.005007434,0.0031137888,0.6079579],"study_design_scores_gemma":[0.000455494,0.013951722,0.028900325,0.00034579894,0.000669726,0.0031402854,0.00056301994,0.5193147,0.40577188,0.0018479775,0.024837114,0.0002019702],"about_ca_topic_score_codex":0.0009293398,"about_ca_topic_score_gemma":0.0013079796,"teacher_disagreement_score":0.011001077,"about_ca_system_score_codex":0.00038766235,"about_ca_system_score_gemma":0.00039062192,"threshold_uncertainty_score":0.036802292},"labels":[],"label_agreement":null},{"id":"W3201395773","doi":"10.1007/978-3-030-86365-4_54","title":"Uncertainty Quantification and Estimation in Medical Image Classification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Medical imaging; Uncertainty quantification; Deep neural networks; Machine learning; Deep learning; Variety (cybernetics); Artificial neural network; Medical decision making; Estimation; Data mining","score_opus":0.03899668969504954,"score_gpt":0.33692861633410415,"score_spread":0.2979319266390546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201395773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016496424,0.0054589743,0.99103373,0.00036619965,0.000064860375,0.000013912586,0.000038766004,0.0000840134,0.0012899734],"genre_scores_gemma":[0.2965921,0.012939796,0.6785101,0.00040988304,0.00096755236,0.0002025253,0.00032250976,0.00023801807,0.009817582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980994,0.0007376783,0.00013934175,0.0002507862,0.00069324777,0.00007960106],"domain_scores_gemma":[0.99180716,0.0068953205,0.00035190923,0.00034884346,0.0005262677,0.00007055092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040957183,0.0007206426,0.0017033175,0.0022825012,0.0005039654,0.0027827835,0.0017465376,0.0016433485,0.0017571152],"category_scores_gemma":[0.013963285,0.0009282748,0.0011349185,0.0025743232,0.0025210322,0.0035495346,0.0021614425,0.0020161825,0.00043254715],"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.000076425924,0.00003918609,0.0006468021,0.0006210123,0.00011653918,0.00007646216,0.00022755352,0.30717307,0.0030595148,0.27144164,0.005769947,0.41075176],"study_design_scores_gemma":[0.0000025928628,0.000022212782,0.00036873668,0.000073268115,0.000023836155,0.00006398212,0.000026352483,0.7931298,0.0013749104,0.20160055,0.0032878623,0.000025918207],"about_ca_topic_score_codex":0.0030469324,"about_ca_topic_score_gemma":0.0019507377,"teacher_disagreement_score":0.0040957183,"about_ca_system_score_codex":0.0014687687,"about_ca_system_score_gemma":0.00072393456,"threshold_uncertainty_score":0.021660507},"labels":[],"label_agreement":null},{"id":"W3201573568","doi":"10.1007/978-3-030-85088-3_15","title":"Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Guelph","funders":"","keywords":"Swap (finance); Gray code; Prefix; Binary number; Combinatorics; Computer science; Arithmetic; Discrete mathematics; Algorithm; Mathematics","score_opus":0.01933508492961864,"score_gpt":0.28034523455753396,"score_spread":0.2610101496279153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201573568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08840971,0.0017672235,0.7117098,0.0007583125,0.00079963444,0.00018014696,0.00034131517,0.0019020673,0.19413178],"genre_scores_gemma":[0.6045518,0.0020010571,0.28110486,0.0010671313,0.00037339827,0.00029007273,0.00036848045,0.0017359492,0.10850734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996892,0.00006447851,0.000017478313,0.000043320088,0.00011569642,0.00006978421],"domain_scores_gemma":[0.99966097,0.00012503067,0.000023605351,0.00009171172,0.00007426566,0.00002442286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031868333,0.00048777502,0.00039287872,0.0006570647,0.000573495,0.0018446811,0.0005904881,0.00068389496,0.009192061],"category_scores_gemma":[0.001098788,0.00030668837,0.00042078976,0.0011285482,0.0015490996,0.002505815,0.0008306495,0.0013987562,0.0025326707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072131574,0.000026472331,0.00006321102,0.00007995889,0.0000035968408,0.00008118112,0.0002787352,0.0064344555,0.0071505164,0.92114055,0.004927259,0.059741993],"study_design_scores_gemma":[0.000019485378,0.000069515074,0.000104049606,0.000070346425,0.000007021175,0.00022165496,0.000079827376,0.031687394,0.013117333,0.905894,0.048688326,0.000040997118],"about_ca_topic_score_codex":0.0008234187,"about_ca_topic_score_gemma":0.0011679571,"teacher_disagreement_score":0.009192061,"about_ca_system_score_codex":0.0007276297,"about_ca_system_score_gemma":0.0007132041,"threshold_uncertainty_score":0.030750453},"labels":[],"label_agreement":null},{"id":"W3201730240","doi":"10.1007/978-3-030-87202-1_23","title":"Personalized Respiratory Motion Model Using Conditional Generative Networks for MR-Guided Radiotherapy","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier de l’Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Generative model; Conditional probability distribution; Scalability; Conditional random field; Motion (physics); Population; Pattern recognition (psychology); Machine learning; Computer vision; Generative grammar; Mathematics","score_opus":0.039395920999231684,"score_gpt":0.3170845572546071,"score_spread":0.27768863625537543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201730240","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.0050179926,0.00067003525,0.9914118,0.00016613188,0.000051428116,0.00002386865,0.00025260943,0.0014414812,0.00096471555],"genre_scores_gemma":[0.5999028,0.0019375449,0.37792903,0.0006318305,0.00025862613,0.00023751742,0.002145876,0.0012950412,0.015661836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997371,0.00007434198,0.000011015763,0.00008844541,0.000056292774,0.000032927164],"domain_scores_gemma":[0.99959725,0.0002502316,0.000039149858,0.000048823815,0.00004472901,0.000019836703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055689324,0.00076687755,0.0010465299,0.0005209175,0.00031260063,0.00069932285,0.0016197475,0.0013137194,0.0033167498],"category_scores_gemma":[0.0013842791,0.0010291041,0.0014964431,0.00085124874,0.00040939337,0.0007126986,0.0010324194,0.0017803456,0.0013434701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073425734,0.00002614031,0.00023619621,0.00004036993,0.000060022998,0.00004074441,0.000029147668,0.9251422,0.0021689523,0.0023513215,0.0017986597,0.068032734],"study_design_scores_gemma":[0.0000019809538,0.0000049923333,0.00005603952,0.00000292401,0.000007215025,0.00001612961,0.0000012068135,0.9982022,0.00030036972,0.001132106,0.00027095026,0.0000038319545],"about_ca_topic_score_codex":0.014318895,"about_ca_topic_score_gemma":0.020640874,"teacher_disagreement_score":0.014318895,"about_ca_system_score_codex":0.0009827792,"about_ca_system_score_gemma":0.0006942582,"threshold_uncertainty_score":0.028471053},"labels":[],"label_agreement":null},{"id":"W3201843693","doi":"10.1007/978-3-030-87196-3_55","title":"CPNet: Cycle Prototype Network for Weakly-Supervised 3D Renal Compartments Segmentation on CT Images","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Western University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Compartment (ship); Pattern recognition (psychology); Feature (linguistics); Deep learning; Consistency (knowledge bases)","score_opus":0.022409565163791174,"score_gpt":0.28236557673314644,"score_spread":0.25995601156935527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201843693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016694266,0.0006623841,0.966704,0.00023540297,0.00022896056,0.00020184975,0.0014673256,0.010809063,0.0029967416],"genre_scores_gemma":[0.25143677,0.0006479751,0.72112584,0.00041409678,0.00018317363,0.0006162144,0.0070225904,0.0019281831,0.016625233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966764,0.000042585165,0.000018824709,0.00013969265,0.000088529654,0.000042767257],"domain_scores_gemma":[0.9994848,0.00015172653,0.000034804903,0.00010646847,0.00017904576,0.00004310799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007851566,0.0012134827,0.0010111488,0.0008213671,0.0005167821,0.00121914,0.0033774856,0.0018698563,0.008812142],"category_scores_gemma":[0.00217707,0.0009313152,0.0008982136,0.0011529926,0.000520482,0.0014763556,0.0016957661,0.0017246996,0.0032025597],"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.00049831823,0.00011055762,0.00079402083,0.00024724478,0.00012750468,0.00015627028,0.000061939245,0.14116366,0.014009527,0.0047341967,0.032718968,0.80537784],"study_design_scores_gemma":[0.000014060912,0.000052875086,0.0002623986,0.000017100814,0.000015151393,0.000060836333,0.000010076231,0.9884588,0.0052779415,0.0028808394,0.0029385737,0.000011378233],"about_ca_topic_score_codex":0.011457585,"about_ca_topic_score_gemma":0.017619643,"teacher_disagreement_score":0.011457585,"about_ca_system_score_codex":0.00091790274,"about_ca_system_score_gemma":0.0015030504,"threshold_uncertainty_score":0.029479504},"labels":[],"label_agreement":null},{"id":"W3202032847","doi":"10.1007/978-3-030-88272-3_14","title":"Development of a Mobile Exergame to Implement Brief Interventions to Increase Physical Activity for Adults with Schizophrenia","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Eating Disorders and Behaviors","field":"Psychology","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":"Université de Montréal; Institut Universitaire en Santé Mentale de Québec; Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Schizophrenia (object-oriented programming); Affect (linguistics); Population; Psychology; Psychological intervention; Psychiatry; Gerontology; Medicine; Communication","score_opus":0.0262949671210562,"score_gpt":0.3370005775203689,"score_spread":0.31070561039931266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202032847","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.7957716,0.00084237586,0.14699592,0.0011346715,0.0004893042,0.0063824453,0.00083153154,0.00322977,0.044322327],"genre_scores_gemma":[0.48465022,0.0014335149,0.44013846,0.00080423977,0.00005217215,0.0046313386,0.0015041707,0.0003415637,0.06644433],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999043,0.000019963552,0.000006002892,0.000016330367,0.0000365242,0.000016946935],"domain_scores_gemma":[0.9999267,0.000028395245,0.00000476859,0.0000041083795,0.0000142199615,0.000021884342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034375096,0.00053412287,0.00021030477,0.00025871338,0.00018705578,0.00025456867,0.00073976925,0.00029189693,0.005417994],"category_scores_gemma":[0.00038960736,0.00022021968,0.00040306867,0.00007489657,0.00013036082,0.00026855888,0.0006112395,0.0004010241,0.0008820468],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000922538,0.009615919,0.0035930418,0.0006509391,0.00009592539,0.0006393565,0.0010707437,0.0028855857,0.050562307,0.0013312119,0.013586093,0.91504645],"study_design_scores_gemma":[0.006237083,0.09119688,0.2527565,0.0023537942,0.0012481025,0.009123804,0.004885049,0.12137968,0.19069931,0.0051173395,0.31462848,0.00037397147],"about_ca_topic_score_codex":0.0016783662,"about_ca_topic_score_gemma":0.0037017388,"teacher_disagreement_score":0.005417994,"about_ca_system_score_codex":0.0001678066,"about_ca_system_score_gemma":0.00064729585,"threshold_uncertainty_score":0.018124998},"labels":[],"label_agreement":null},{"id":"W3202130907","doi":"10.1007/978-3-030-85947-3_12","title":"On the Complexity of Nucleolus Computation for Bipartite b-Matching Games","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Matching (statistics); Combinatorics; Computation; Complement (music); Bounded function; Simple (philosophy); 3-dimensional matching; Computer science; Discrete mathematics; Time complexity; Mathematics; Algorithm; Graph","score_opus":0.07190557685468692,"score_gpt":0.254570813321545,"score_spread":0.18266523646685812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202130907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23799141,0.002154105,0.641143,0.010579439,0.00050955877,0.0005576259,0.0030181636,0.0021234935,0.10192315],"genre_scores_gemma":[0.82690823,0.0015684994,0.14472649,0.001457703,0.0007956496,0.00072161324,0.0028316446,0.0011226141,0.01986751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952136,0.0019909937,0.0002395567,0.0008405819,0.00093394023,0.00078136096],"domain_scores_gemma":[0.9564904,0.036924012,0.0012813847,0.003150818,0.001049414,0.0011039851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032564916,0.0013850795,0.0033368624,0.0016317259,0.0029246383,0.008049372,0.0046464326,0.0034603425,0.02664348],"category_scores_gemma":[0.029013166,0.0012523845,0.0025319734,0.0034540584,0.0039127287,0.015147122,0.0054360335,0.005946524,0.0027314045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096872036,0.00032708127,0.0014276252,0.00045875905,0.00013105854,0.00013311213,0.00047270497,0.1032269,0.001935508,0.82866997,0.020653522,0.041595105],"study_design_scores_gemma":[0.000060489292,0.000020887363,0.0001778941,0.000025641617,0.00001955819,0.00003102574,0.000053744494,0.15416043,0.00030223036,0.84419197,0.00093689834,0.000019243002],"about_ca_topic_score_codex":0.0058264523,"about_ca_topic_score_gemma":0.005854211,"teacher_disagreement_score":0.02664348,"about_ca_system_score_codex":0.004470544,"about_ca_system_score_gemma":0.0036887624,"threshold_uncertainty_score":0.089131355},"labels":[],"label_agreement":null},{"id":"W3202151048","doi":"10.1007/978-3-030-88207-5_11","title":"Integrating 4D Simulations and Virtual Reality Environments: An Innovative Prototype","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Virtual reality; Human–computer interaction; Computer graphics (images)","score_opus":0.015445849310168557,"score_gpt":0.2409989838705758,"score_spread":0.22555313456040724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202151048","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.074466415,0.0003778861,0.8857358,0.0004954202,0.00037635883,0.0006868131,0.00031878226,0.010566611,0.026975935],"genre_scores_gemma":[0.2602941,0.00049137214,0.6945844,0.0003208823,0.00005580673,0.00072795176,0.0005866147,0.0012696442,0.04166918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993869,0.00015113606,0.000026157526,0.00008098391,0.00028946824,0.000065194836],"domain_scores_gemma":[0.9994772,0.00019230509,0.000016125727,0.0001218649,0.00010933738,0.000083139916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089063693,0.0009657601,0.00058894715,0.0005610778,0.00044676915,0.0017418896,0.0043186843,0.0019252617,0.017532656],"category_scores_gemma":[0.0010806739,0.0009281072,0.00088748947,0.00042628753,0.00062299124,0.0017393287,0.0025553908,0.0008857939,0.003263808],"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.0015526755,0.0026570887,0.0021538804,0.0008235218,0.0002208264,0.0022292056,0.0037768157,0.035265706,0.3311123,0.03378413,0.021529071,0.5648948],"study_design_scores_gemma":[0.0009168622,0.0041802777,0.004416674,0.00040681596,0.00045427398,0.0047958894,0.0012187527,0.37891173,0.25319308,0.016979354,0.33416006,0.0003662063],"about_ca_topic_score_codex":0.0010852856,"about_ca_topic_score_gemma":0.0009657121,"teacher_disagreement_score":0.017532656,"about_ca_system_score_codex":0.00029559166,"about_ca_system_score_gemma":0.0006558657,"threshold_uncertainty_score":0.05865252},"labels":[],"label_agreement":null},{"id":"W3202436968","doi":"10.1007/978-3-030-87237-3_65","title":"Training Deep Networks for Prostate Cancer Diagnosis Using Coarse Histopathological Labels","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver General Hospital; Queen's University; University of British Columbia","funders":"","keywords":"Computer science; Prostate cancer; Artificial intelligence; Constraint (computer-aided design); Artificial neural network; Histopathology; Pattern recognition (psychology); Deep learning; Biopsy; Cancer; Radiology; Medicine; Pathology; Mathematics","score_opus":0.05455803568230379,"score_gpt":0.29117450365872205,"score_spread":0.23661646797641828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202436968","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.12224023,0.0026526868,0.8551472,0.00097225996,0.00046065578,0.00013812559,0.0021405239,0.006111682,0.010136593],"genre_scores_gemma":[0.71730936,0.0012501614,0.24726231,0.00065711007,0.00021446515,0.00017008535,0.00436615,0.00039964862,0.028370738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999848,0.000019819438,0.000007032805,0.000053375075,0.000032219312,0.000039603037],"domain_scores_gemma":[0.9995347,0.0002164406,0.000031417334,0.000074203344,0.00011819004,0.000024943101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055231754,0.0010530475,0.0005289503,0.0006135628,0.00029412648,0.0006567692,0.000980642,0.0011368445,0.0045138146],"category_scores_gemma":[0.0013483032,0.0005926407,0.0007446879,0.00046951036,0.00025305912,0.00079765555,0.0010333823,0.0014381778,0.0023041505],"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.00022471588,0.00015332608,0.0037504185,0.00013218593,0.00012220946,0.00012677016,0.000061341285,0.20475888,0.018158408,0.003019066,0.014100529,0.7553921],"study_design_scores_gemma":[0.000007557898,0.000054810822,0.00090002106,0.000030991454,0.000036144953,0.00005475659,0.000019714855,0.98624694,0.007060225,0.0038049554,0.0017753196,0.000008661148],"about_ca_topic_score_codex":0.007593538,"about_ca_topic_score_gemma":0.01571218,"teacher_disagreement_score":0.007593538,"about_ca_system_score_codex":0.00061323604,"about_ca_system_score_gemma":0.00072872685,"threshold_uncertainty_score":0.015100181},"labels":[],"label_agreement":null},{"id":"W3202437243","doi":"10.1007/978-3-030-87202-1_27","title":"Real-Time Rotated Convolutional Descriptor for Surgical Environments","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; USable; Computer vision; Pattern recognition (psychology); Ground truth; Feature (linguistics); Binary number; Tracking (education); Mathematics","score_opus":0.012427022911632363,"score_gpt":0.2061723185902073,"score_spread":0.19374529567857493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202437243","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.008773091,0.0008117317,0.9857431,0.00010053699,0.00023593806,0.00003430854,0.00051434705,0.0018700577,0.0019168865],"genre_scores_gemma":[0.37071434,0.003108036,0.58414984,0.0002405743,0.00025108768,0.00012476546,0.005208434,0.0006434904,0.035559367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979013,0.00001888555,0.000009525394,0.00004850194,0.0000927862,0.000040123872],"domain_scores_gemma":[0.99980646,0.000031715026,0.000020785583,0.000055304503,0.00006970554,0.000016122533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029767,0.0006560142,0.0005192982,0.0005173866,0.00012823616,0.0005411508,0.00092312077,0.00050812063,0.005046211],"category_scores_gemma":[0.0006247111,0.00030235705,0.00039082175,0.0007800466,0.000248808,0.00061266235,0.0007498147,0.0006784956,0.0028559095],"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.00024652987,0.00006854367,0.0004038702,0.00015392835,0.000040156105,0.00008558828,0.000026232747,0.07908591,0.05659566,0.0077044554,0.019466469,0.8361227],"study_design_scores_gemma":[0.000013966808,0.000087468645,0.0010389992,0.000023439732,0.000025315429,0.00026092428,0.000019331059,0.9506067,0.030098986,0.0041363924,0.01366164,0.000026723586],"about_ca_topic_score_codex":0.004184977,"about_ca_topic_score_gemma":0.007314741,"teacher_disagreement_score":0.005046211,"about_ca_system_score_codex":0.00046430685,"about_ca_system_score_gemma":0.00070138957,"threshold_uncertainty_score":0.016881287},"labels":[],"label_agreement":null},{"id":"W3202466114","doi":"10.1007/978-3-030-86549-8_9","title":"LayoutParser: A Unified Toolkit for Deep Learning Based Document Image Analysis","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parsing; Digitization; Set (abstract data type); Reuse; Reusability; Extensibility; Artificial intelligence; Software engineering; World Wide Web; Programming language; Software; Computer vision","score_opus":0.01471688984861719,"score_gpt":0.2596056761146642,"score_spread":0.244888786266047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202466114","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014416744,0.00035592756,0.78996164,0.00007737401,0.0001195006,0.000100428166,0.00459626,0.2003939,0.002953256],"genre_scores_gemma":[0.024162522,0.0007364649,0.91631746,0.00029198895,0.000051150953,0.00048818058,0.0160335,0.02162668,0.020291984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995421,0.00004071268,0.000032484248,0.0001252742,0.00019892336,0.00006050318],"domain_scores_gemma":[0.9995221,0.00014490142,0.000030207928,0.00011779122,0.00014131724,0.000043641565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303078,0.0024158636,0.0011554066,0.0020315913,0.0005453949,0.0022543846,0.004194463,0.0013686664,0.05179321],"category_scores_gemma":[0.0015645631,0.0015979444,0.001958009,0.001922513,0.00036553302,0.0024457334,0.0025025953,0.0028882981,0.030882489],"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.00032975734,0.00018236329,0.0006187082,0.000842015,0.00022051635,0.00024055365,0.00012482151,0.022873897,0.033828255,0.009039584,0.20812815,0.72357136],"study_design_scores_gemma":[0.0001343047,0.0001119635,0.0009822068,0.00015932493,0.00009546763,0.00047422145,0.00007756676,0.74219364,0.077151105,0.028120765,0.15035656,0.00014285362],"about_ca_topic_score_codex":0.005506082,"about_ca_topic_score_gemma":0.013145096,"teacher_disagreement_score":0.05179321,"about_ca_system_score_codex":0.00075926236,"about_ca_system_score_gemma":0.0011101828,"threshold_uncertainty_score":0.17326558},"labels":[],"label_agreement":null},{"id":"W3202691700","doi":"10.1007/978-3-030-88418-5_1","title":"More Efficient Post-quantum KEMTLS with Pre-distributed Public Keys","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Computer security; Distributed computing; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.012078580367377379,"score_gpt":0.2292305578338348,"score_spread":0.21715197746645742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202691700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0501746,0.0006638598,0.8803501,0.0011937295,0.00071787374,0.00035809836,0.00070266007,0.0045235404,0.06131556],"genre_scores_gemma":[0.5613554,0.00038649532,0.37890902,0.00077255984,0.00034213418,0.00029656242,0.0011842931,0.0010502416,0.055703357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976768,0.00054343033,0.00018335455,0.0003522755,0.0008285378,0.00041566527],"domain_scores_gemma":[0.99773395,0.0005702071,0.00009283224,0.0012433907,0.00025300856,0.00010656371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644888,0.00084281544,0.0014587861,0.0007661522,0.0012026253,0.0027633524,0.001961582,0.0011481757,0.04050768],"category_scores_gemma":[0.0033461275,0.0005733029,0.0012372679,0.0013696307,0.0015983224,0.0058044908,0.004411198,0.002195441,0.012811188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019596983,0.00046112412,0.0005137069,0.00065980834,0.00015781443,0.00027292996,0.00039620098,0.02417174,0.036679987,0.6706884,0.02424567,0.23979302],"study_design_scores_gemma":[0.0006883632,0.0004456529,0.0005910617,0.00013329624,0.00015254546,0.0007177833,0.00026591096,0.1713549,0.06043284,0.7094146,0.05563948,0.00016352572],"about_ca_topic_score_codex":0.00047033638,"about_ca_topic_score_gemma":0.0010559799,"teacher_disagreement_score":0.04050768,"about_ca_system_score_codex":0.0012086004,"about_ca_system_score_gemma":0.0017447543,"threshold_uncertainty_score":0.1355117},"labels":[],"label_agreement":null},{"id":"W3202770052","doi":"10.1007/978-3-030-87234-2_16","title":"Culprit-Prune-Net: Efficient Continual Sequential Multi-domain Learning with Application to Skin Lesion Classification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Pruning; Artificial intelligence; Deep learning; Machine learning; Domain knowledge; Artificial neural network; Oracle; Inference; Domain (mathematical analysis); Contextual image classification; Forgetting; Image (mathematics); Pattern recognition (psychology)","score_opus":0.019323937570082828,"score_gpt":0.2634131805385865,"score_spread":0.24408924296850365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202770052","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.0141448835,0.00088977895,0.9625766,0.0001973625,0.00016626739,0.0001470741,0.0005860007,0.018946305,0.0023456474],"genre_scores_gemma":[0.10229178,0.00036649252,0.8852558,0.00023533715,0.00009513624,0.00021332188,0.0019752064,0.0008263546,0.00874056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954873,0.00006407404,0.00003087451,0.0001465481,0.00014098824,0.00006877328],"domain_scores_gemma":[0.9992525,0.0003165249,0.000041777406,0.00013585683,0.00018401581,0.00006921037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012258763,0.0015544742,0.0015020195,0.0012007711,0.00064342434,0.0012034281,0.0030535327,0.0018086557,0.008878234],"category_scores_gemma":[0.0018461875,0.00081589137,0.0009962365,0.0014897146,0.00051876093,0.0013837821,0.002277698,0.0017697404,0.0044493787],"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.000383656,0.00019626567,0.0006617498,0.00014811929,0.00009014579,0.00014994475,0.000044233304,0.059484385,0.008437201,0.0028205228,0.020217445,0.90736634],"study_design_scores_gemma":[0.000028850553,0.00006394814,0.00021304809,0.000009431874,0.000016794756,0.0001080462,0.000016514192,0.9878627,0.005246113,0.002738323,0.0036865477,0.000009722406],"about_ca_topic_score_codex":0.006931286,"about_ca_topic_score_gemma":0.014168016,"teacher_disagreement_score":0.008878234,"about_ca_system_score_codex":0.00071284396,"about_ca_system_score_gemma":0.0013029935,"threshold_uncertainty_score":0.029700637},"labels":[],"label_agreement":null},{"id":"W3202818103","doi":"10.1007/978-3-030-87626-5_3","title":"Quantified Boolean Solving for Achievement Games","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Quantifier (linguistics); Theoretical computer science; Existentialism; Representation (politics); String (physics); ENCODE; Propositional calculus; Space (punctuation); Algebra over a field; Artificial intelligence; Mathematics; Programming language; Pure mathematics","score_opus":0.04473661279791708,"score_gpt":0.29259626210567397,"score_spread":0.2478596493077569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202818103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019070532,0.0031431967,0.7231767,0.0025712454,0.0004036572,0.00017206666,0.0007761835,0.0010516755,0.24963468],"genre_scores_gemma":[0.56912196,0.0037940207,0.31237394,0.0007399365,0.00052907964,0.0005107522,0.0024805826,0.00061737397,0.1098323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986621,0.0004247441,0.0000907523,0.00019294077,0.00042276309,0.00020675574],"domain_scores_gemma":[0.99902344,0.0006371315,0.00005239179,0.00009888156,0.00012541318,0.00006271613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481717,0.0012902097,0.0010892312,0.0011078413,0.0013610162,0.003666158,0.0023981598,0.00092238665,0.016834145],"category_scores_gemma":[0.003985865,0.0006212703,0.0014246304,0.0022439002,0.0024566068,0.005354418,0.0023831779,0.004398421,0.0021736699],"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.000018718645,0.00003627697,0.00005043129,0.00014308207,0.000013004626,0.000019799583,0.0001332347,0.004187878,0.00036277526,0.9596546,0.0048273606,0.030552832],"study_design_scores_gemma":[0.000013028651,0.00000769865,0.00007211231,0.000041758773,0.000013708983,0.000016637143,0.000044125994,0.013433133,0.00035997643,0.9776123,0.008374956,0.000010441136],"about_ca_topic_score_codex":0.0052379845,"about_ca_topic_score_gemma":0.006305488,"teacher_disagreement_score":0.016834145,"about_ca_system_score_codex":0.0037782893,"about_ca_system_score_gemma":0.00146766,"threshold_uncertainty_score":0.05631578},"labels":[],"label_agreement":null},{"id":"W32031805","doi":"10.1007/978-3-319-06483-3_14","title":"A Consensus Approach for Annotation Projection in an Advanced Dialog Context","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Nuance Communications (Canada); Université de Montréal","funders":"","keywords":"Computer science; Annotation; Dialog box; Projection (relational algebra); Exploit; Context (archaeology); Universalization; Artificial intelligence; Process (computing); Natural language processing; World Wide Web; Programming language; Algorithm","score_opus":0.021150735817669256,"score_gpt":0.2822775895014908,"score_spread":0.26112685368382155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32031805","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.0016928045,0.000069895585,0.9952099,0.00014518075,0.000051679664,0.00010885738,0.00008935579,0.00069394027,0.0019383823],"genre_scores_gemma":[0.09760063,0.00015079971,0.8944666,0.00015891694,0.000098046046,0.00049323007,0.0007180998,0.0004750092,0.005838642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9896187,0.003910987,0.0008746827,0.0025758173,0.0024319342,0.00058788137],"domain_scores_gemma":[0.9870863,0.005456393,0.00035115596,0.0026364918,0.0039060141,0.00056357717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008826677,0.0013919054,0.0019696231,0.0029514788,0.004162404,0.004916458,0.004951713,0.0035384912,0.011521936],"category_scores_gemma":[0.020569434,0.0017888398,0.0025940533,0.0032053005,0.0029165403,0.010311521,0.011062401,0.004338166,0.00419674],"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.00057253276,0.00029271396,0.00095676223,0.0006600274,0.00018677747,0.0006645421,0.00432598,0.045269907,0.015498547,0.530236,0.015795583,0.38554063],"study_design_scores_gemma":[0.000052300613,0.0001260628,0.00028658658,0.00015288393,0.000128228,0.00023391696,0.0010983687,0.4906816,0.013932586,0.47113496,0.022053884,0.000118637676],"about_ca_topic_score_codex":0.0064705363,"about_ca_topic_score_gemma":0.007467748,"teacher_disagreement_score":0.011521936,"about_ca_system_score_codex":0.0016033706,"about_ca_system_score_gemma":0.0047435784,"threshold_uncertainty_score":0.04668045},"labels":[],"label_agreement":null},{"id":"W3203331301","doi":"10.1007/978-3-031-32415-4_36","title":"Lissy: Experimenting with On-Chain Order Books","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Popularity; Computer science; Order (exchange); Benchmark (surveying); Block (permutation group theory); Blockchain; Front (military); Layer (electronics); Computer security; Operations research; Finance; Business","score_opus":0.015608490497910334,"score_gpt":0.24300797340267755,"score_spread":0.22739948290476722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203331301","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.13548182,0.00066608057,0.17933136,0.0036531237,0.0011240352,0.0007075089,0.006756234,0.016948637,0.6553312],"genre_scores_gemma":[0.41471234,0.0005373076,0.11286106,0.0005787235,0.000118806485,0.0006002282,0.006012979,0.0039743176,0.46060422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848723,0.0004462775,0.000038397975,0.00016286063,0.0007663003,0.0000988778],"domain_scores_gemma":[0.993877,0.0035425944,0.000101876634,0.0014902616,0.0006996562,0.0002886806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016298845,0.0004946775,0.0005776519,0.000739703,0.0012072887,0.0033168101,0.001755546,0.001072053,0.16197397],"category_scores_gemma":[0.0090336725,0.00054620695,0.00032092302,0.0012502177,0.0009880055,0.0066033956,0.0021236502,0.0016643378,0.021999184],"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.0017742865,0.0018518241,0.0022075595,0.000796658,0.00007187468,0.00036476197,0.0022560041,0.024626179,0.019835634,0.3361936,0.23674542,0.3732763],"study_design_scores_gemma":[0.000479401,0.00086563395,0.0013367272,0.00021023746,0.0000521061,0.000220324,0.0014400394,0.16282845,0.06967327,0.2038597,0.5589199,0.00011424777],"about_ca_topic_score_codex":0.0019059586,"about_ca_topic_score_gemma":0.0034473455,"teacher_disagreement_score":0.16197397,"about_ca_system_score_codex":0.0011888167,"about_ca_system_score_gemma":0.0014255423,"threshold_uncertainty_score":0.5418569},"labels":[],"label_agreement":null},{"id":"W3203565869","doi":"10.1007/978-3-030-88494-9_16","title":"A Theoretical Framework for Understanding the Relationship Between Log Parsing and Anomaly Detection","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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 Ottawa","funders":"","keywords":"Parsing; Anomaly detection; Computer science; Anomaly (physics); Identification (biology); Root (linguistics); Dependency grammar; Artificial intelligence; Dependency (UML); Ideal (ethics); Data mining; Root cause analysis; Natural language processing","score_opus":0.05297428643905471,"score_gpt":0.28572406101282,"score_spread":0.23274977457376528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203565869","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.0034334976,0.00069000246,0.9827723,0.002995264,0.00010399206,0.00003696173,0.00012036652,0.0002439321,0.009603754],"genre_scores_gemma":[0.4162894,0.002838188,0.56701577,0.0017219201,0.0014962249,0.00046185392,0.00053511094,0.00034791688,0.009293639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966813,0.0013279909,0.00023723052,0.0006616824,0.00079462916,0.00029711906],"domain_scores_gemma":[0.97006106,0.024749637,0.0014963816,0.0018161751,0.0014567485,0.00041996967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062491633,0.0011060201,0.0011452122,0.0049008597,0.0019228295,0.0066325525,0.0049971202,0.004569095,0.010216168],"category_scores_gemma":[0.02718622,0.0015297236,0.0018431864,0.0042883726,0.009426627,0.016902516,0.003426872,0.0050366484,0.0014060971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097918755,0.000032034055,0.00035822098,0.000048927453,0.000014716431,0.00008404316,0.00015925684,0.008469303,0.000317217,0.9795432,0.001002637,0.009960765],"study_design_scores_gemma":[0.000004060271,0.000009897081,0.00009784739,0.000014819381,0.00000848919,0.00008465668,0.00005521602,0.045048464,0.00015479853,0.95289445,0.0016162244,0.000011111468],"about_ca_topic_score_codex":0.004195182,"about_ca_topic_score_gemma":0.0025810748,"teacher_disagreement_score":0.010216168,"about_ca_system_score_codex":0.0025598211,"about_ca_system_score_gemma":0.0026374753,"threshold_uncertainty_score":0.03417653},"labels":[],"label_agreement":null},{"id":"W3203827531","doi":"10.1007/978-3-030-87986-0_23","title":"A Graphic CNN-LSTM Model for Stock Price Predication","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Brandon University","funders":"","keywords":"Computer science; Convolutional neural network; Futures contract; Pooling; Artificial intelligence; Flowchart; Stock (firearms); Machine learning; Programming language; Finance","score_opus":0.12217356327894496,"score_gpt":0.3787448804729337,"score_spread":0.25657131719398873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203827531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032815393,0.0022136685,0.926264,0.0010547898,0.0010449179,0.000086210246,0.0031025466,0.012795985,0.020622412],"genre_scores_gemma":[0.5642918,0.0020282357,0.35872203,0.0009303468,0.00034724094,0.000209648,0.00558165,0.0007250691,0.067164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999416,0.0000061705937,0.000003265055,0.000021597156,0.000015013969,0.00001240134],"domain_scores_gemma":[0.9999223,0.0000220476,0.000005431572,0.0000134487955,0.000030403788,0.000006360145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013506501,0.00064923277,0.00040769184,0.00034604687,0.00020914535,0.0006537124,0.0011923192,0.00096116884,0.014406548],"category_scores_gemma":[0.00049820147,0.00038723813,0.0007203319,0.0005979944,0.00015880406,0.00072140293,0.0005318294,0.000829752,0.0039139255],"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.00025081023,0.000096690696,0.00078290794,0.00020704645,0.00015504564,0.00026071406,0.00003989009,0.34100977,0.036077723,0.009345577,0.034407634,0.5773661],"study_design_scores_gemma":[0.000005817757,0.00002069472,0.00024167425,0.000009231142,0.000019160616,0.000031701038,0.0000032306173,0.9916014,0.0027915088,0.0026439712,0.0026244216,0.0000071955656],"about_ca_topic_score_codex":0.015441188,"about_ca_topic_score_gemma":0.021025006,"teacher_disagreement_score":0.015441188,"about_ca_system_score_codex":0.0005805516,"about_ca_system_score_gemma":0.0005069437,"threshold_uncertainty_score":0.048194766},"labels":[],"label_agreement":null},{"id":"W3204160450","doi":"10.1007/978-3-030-88428-4_27","title":"Training Differentially Private Neural Networks with Lottery Tickets","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lottery; Computer science; Ticket; Margin (machine learning); Artificial neural network; Quality (philosophy); Function (biology); Machine learning; Artificial intelligence; Deep neural networks; Computer security; Microeconomics","score_opus":0.03400915162097332,"score_gpt":0.2471313070363142,"score_spread":0.21312215541534088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204160450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08704842,0.0010328777,0.90040344,0.0017284323,0.00032764644,0.000092430055,0.00020280028,0.0013230345,0.007840881],"genre_scores_gemma":[0.88839054,0.00043732396,0.09516397,0.0004671868,0.0002497345,0.0001926972,0.0003802422,0.00014945044,0.014568887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998841,0.00044306112,0.00008002303,0.00024848856,0.0002191388,0.0001683453],"domain_scores_gemma":[0.995464,0.0032306886,0.00022454913,0.0007597551,0.00020899165,0.00011209563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003081938,0.0008950121,0.0013026821,0.0004747746,0.00058110914,0.0015656399,0.002179322,0.0021978281,0.0056678574],"category_scores_gemma":[0.012109886,0.0010309794,0.0007216986,0.00061863026,0.0017666044,0.005229995,0.003386663,0.0038150954,0.0011326002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007470462,0.00025047746,0.0008241091,0.00011665247,0.00011266594,0.000077618046,0.000099034056,0.7780913,0.0022492504,0.08643801,0.0039934926,0.12700032],"study_design_scores_gemma":[0.00002816783,0.000044626824,0.00005669837,0.0000131656725,0.000008313375,0.000011998724,0.0000075908324,0.9481348,0.0007544381,0.050635364,0.000298365,0.0000064466503],"about_ca_topic_score_codex":0.001314237,"about_ca_topic_score_gemma":0.0025188169,"teacher_disagreement_score":0.0056678574,"about_ca_system_score_codex":0.0013743744,"about_ca_system_score_gemma":0.0012608543,"threshold_uncertainty_score":0.018960893},"labels":[],"label_agreement":null},{"id":"W3204235424","doi":"10.1007/978-3-030-87193-2_29","title":"Context-Aware Virtual Adversarial Training for Anatomically-Plausible Segmentation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Adversarial system; Segmentation; Artificial intelligence; Context (archaeology); Differentiable function; Constraint (computer-aided design); Deep neural networks; Function (biology); Artificial neural network; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.020423302838745754,"score_gpt":0.25155699425918693,"score_spread":0.23113369142044118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204235424","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.0055847634,0.0005108028,0.990759,0.00016988571,0.00006907324,0.00003316785,0.00009242553,0.0010714016,0.0017093882],"genre_scores_gemma":[0.45123124,0.0011617932,0.5339186,0.00064246164,0.00023307417,0.00020565664,0.0010100547,0.0009374347,0.010659737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942565,0.00018006976,0.00002290077,0.00015113586,0.0001400555,0.00008019803],"domain_scores_gemma":[0.99877197,0.0008240221,0.000059846152,0.00017115731,0.000115528106,0.000057428526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618979,0.001239116,0.0013836661,0.00065011723,0.00046378156,0.0011422335,0.0025185235,0.0022067702,0.004588895],"category_scores_gemma":[0.003725009,0.0010423716,0.001198298,0.000764225,0.0011151534,0.0011385271,0.0032021909,0.0027771073,0.0014542526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019590219,0.000051894363,0.0001952438,0.00011573143,0.0000656805,0.000116699535,0.00007764966,0.7712193,0.008440886,0.012045274,0.004715951,0.20275985],"study_design_scores_gemma":[0.000002965345,0.000012400604,0.00003666372,0.000009202533,0.0000046452406,0.000039658436,0.000003854713,0.9933896,0.0011769377,0.0048168465,0.0005029936,0.000004305464],"about_ca_topic_score_codex":0.0041502225,"about_ca_topic_score_gemma":0.006078902,"teacher_disagreement_score":0.004588895,"about_ca_system_score_codex":0.0007885225,"about_ca_system_score_gemma":0.0008731247,"threshold_uncertainty_score":0.015351415},"labels":[],"label_agreement":null},{"id":"W3204260092","doi":"10.1007/978-3-030-87615-9_8","title":"Fast Tractography Streamline Search","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Computer science; Tractography; Artificial intelligence; Diffusion MRI; Radiology; Magnetic resonance imaging","score_opus":0.018846315805942968,"score_gpt":0.240362149454587,"score_spread":0.22151583364864402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204260092","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.0045452365,0.00054679444,0.9860622,0.00017150892,0.00014267012,0.00009602227,0.0005998828,0.004122921,0.0037127277],"genre_scores_gemma":[0.07341862,0.00058357284,0.90211725,0.00015726945,0.00020289738,0.00029740736,0.002593886,0.0012701155,0.019358942],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995154,0.00009682092,0.00003185631,0.00011393537,0.00018254772,0.00005949193],"domain_scores_gemma":[0.9981852,0.00095117895,0.000107575725,0.00036105645,0.00030646904,0.00008839053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083980674,0.0015873559,0.0021207824,0.002024389,0.00064310886,0.0018149086,0.0015457069,0.0021012553,0.03000123],"category_scores_gemma":[0.004919251,0.0009895953,0.0011124229,0.0030704204,0.000526067,0.0022052473,0.0017616817,0.0015113421,0.010264503],"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.0005551166,0.00009485485,0.00067774614,0.00030104516,0.00013714231,0.00023721483,0.000090870315,0.17777595,0.007566261,0.020619912,0.043149903,0.74879396],"study_design_scores_gemma":[0.00006158771,0.00006391753,0.00024975583,0.000028035702,0.00002615491,0.00019504873,0.000025230413,0.96709406,0.0030939567,0.016355772,0.0127901705,0.000016181917],"about_ca_topic_score_codex":0.0076717534,"about_ca_topic_score_gemma":0.012176351,"teacher_disagreement_score":0.03000123,"about_ca_system_score_codex":0.0007151588,"about_ca_system_score_gemma":0.0017901132,"threshold_uncertainty_score":0.10036409},"labels":[],"label_agreement":null},{"id":"W3204322147","doi":"10.1007/978-3-030-87196-3_31","title":"Few-Shot Domain Adaptation with Polymorphic Transformers","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Domain adaptation; Transformer; Domain (mathematical analysis); Shot (pellet); Artificial intelligence; Electrical engineering; Engineering; Mathematics; Voltage","score_opus":0.02422040998477934,"score_gpt":0.23479222907096492,"score_spread":0.21057181908618558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204322147","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.0065975217,0.00019423952,0.98938775,0.000073976444,0.00003470567,0.000030435707,0.000054517892,0.0016895719,0.0019373744],"genre_scores_gemma":[0.46289325,0.00046988885,0.5237645,0.00029468298,0.00007334046,0.00015326789,0.000811026,0.0008919101,0.010648216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991327,0.00030349073,0.00004564565,0.0002742273,0.0001764626,0.00006747625],"domain_scores_gemma":[0.9982439,0.00087396806,0.00004227338,0.00056548533,0.00020444088,0.00006992138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014180156,0.00067801017,0.0007812306,0.0006497239,0.00040265484,0.0010711647,0.0018302221,0.0009892484,0.005202984],"category_scores_gemma":[0.0052877306,0.00046030764,0.0008381012,0.0007218534,0.00097277743,0.0033397088,0.0035739972,0.0019603756,0.0017652762],"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.00040565868,0.0002092244,0.0009926102,0.00017599268,0.00010208636,0.00018346145,0.00026205755,0.07776844,0.019424224,0.07784128,0.008461331,0.8141737],"study_design_scores_gemma":[0.00002781605,0.00006275681,0.00023195845,0.000024810517,0.000029755218,0.00017720956,0.000064433974,0.8662242,0.009919855,0.11893927,0.0042796186,0.000018344146],"about_ca_topic_score_codex":0.0011868051,"about_ca_topic_score_gemma":0.0017294498,"teacher_disagreement_score":0.005202984,"about_ca_system_score_codex":0.00053014327,"about_ca_system_score_gemma":0.000625097,"threshold_uncertainty_score":0.017405689},"labels":[],"label_agreement":null},{"id":"W3204337192","doi":"10.1007/978-3-030-87234-2_9","title":"Graph Transformers for Characterization and Interpretation of Surgical Margins","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Interpretability; Computer science; Visualization; Transformer; Graph; Machine learning; Artificial intelligence; Data mining; Theoretical computer science","score_opus":0.005982533676123927,"score_gpt":0.21744217150477227,"score_spread":0.21145963782864835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204337192","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.0073985634,0.0004919897,0.9760188,0.00029009132,0.00009325357,0.00012537708,0.0022097004,0.002351097,0.01102112],"genre_scores_gemma":[0.26209125,0.0011314243,0.7214881,0.00022242223,0.00020621152,0.0001785213,0.0056548053,0.001354542,0.0076727294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999387,0.00015504897,0.000049700746,0.00018267997,0.00016367972,0.000061909464],"domain_scores_gemma":[0.9979668,0.0011378082,0.000119996985,0.0003567386,0.00035813672,0.00006047723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008704628,0.0008314209,0.00057059765,0.0030749459,0.0005303015,0.0022572072,0.0015740073,0.0010215713,0.0110586975],"category_scores_gemma":[0.0050106407,0.00053835934,0.0013620178,0.002486617,0.0011879151,0.0042918664,0.00097014563,0.0015624654,0.0028987306],"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.00015908788,0.000056164485,0.0013176063,0.00039886852,0.00005322788,0.00032115172,0.00033528043,0.045656208,0.0064037135,0.7145294,0.016559396,0.21420991],"study_design_scores_gemma":[0.000018822233,0.000024992403,0.00052956527,0.00010174193,0.000053114472,0.0002503528,0.00011046744,0.14589673,0.003984958,0.82977307,0.019232223,0.000023944132],"about_ca_topic_score_codex":0.0031569835,"about_ca_topic_score_gemma":0.0035338185,"teacher_disagreement_score":0.0110586975,"about_ca_system_score_codex":0.0010704757,"about_ca_system_score_gemma":0.0007284026,"threshold_uncertainty_score":0.036994994},"labels":[],"label_agreement":null},{"id":"W3204344247","doi":"10.1007/978-3-030-87986-0_28","title":"Abrupt Change Detection by the Nonparametric Approach Based on Orthogonal Series Estimates","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","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":"Concordia University","funders":"","keywords":"Nonparametric statistics; Computer science; Change detection; Series (stratigraphy); Kernel (algebra); Key (lock); Kernel density estimation; Nonparametric regression; Kernel regression; Estimation; Algorithm; Time series; Kernel method; Data mining; Artificial intelligence; Pattern recognition (psychology); Machine learning; Statistics; Mathematics; Support vector machine","score_opus":0.014494617951084962,"score_gpt":0.21285146193939158,"score_spread":0.1983568439883066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204344247","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.007829103,0.00012811345,0.99121034,0.000026130416,0.000024821098,0.0000079647825,0.000023241206,0.00017329714,0.00057700387],"genre_scores_gemma":[0.43600675,0.0006897067,0.5576036,0.00006670624,0.00024355305,0.000094364696,0.00029924157,0.00016831745,0.0048277504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996748,0.00011072546,0.000018045052,0.00006644893,0.000101157995,0.00002888909],"domain_scores_gemma":[0.9985455,0.00097537774,0.00012534481,0.00013470576,0.00018640592,0.00003270283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008569533,0.0005318847,0.0008901937,0.0010018145,0.00025009114,0.00084356184,0.00059992826,0.0006328588,0.0014356655],"category_scores_gemma":[0.0036959173,0.00032388297,0.0006328093,0.00096729875,0.0004826868,0.0012493576,0.00082012545,0.001080076,0.0005040529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039823944,0.00013592059,0.0027128642,0.00020550872,0.00015231097,0.00018841914,0.00009022241,0.20536408,0.033891246,0.028535556,0.0026334086,0.7256922],"study_design_scores_gemma":[0.0000041514745,0.000037792088,0.00068536383,0.000005374303,0.000015867385,0.00008695335,0.0000074335676,0.99057466,0.002185587,0.0057984274,0.00058584654,0.0000125278575],"about_ca_topic_score_codex":0.00059660623,"about_ca_topic_score_gemma":0.0008353565,"teacher_disagreement_score":0.0014356655,"about_ca_system_score_codex":0.00020402916,"about_ca_system_score_gemma":0.00033534886,"threshold_uncertainty_score":0.0048027635},"labels":[],"label_agreement":null},{"id":"W3204393944","doi":"10.1007/978-3-030-87589-3_14","title":"Exploring Gyro-Sulcal Functional Connectivity Differences Across Task Domains via Anatomy-Guided Spatio-Temporal Graph Convolutional Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Science North","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Task (project management); Theoretical computer science","score_opus":0.08709987728897473,"score_gpt":0.2752149274024232,"score_spread":0.18811505011344848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204393944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26121515,0.0016141684,0.72798306,0.0006561251,0.00008577825,0.000054557724,0.001485253,0.0019619432,0.0049439617],"genre_scores_gemma":[0.8570504,0.0011200131,0.13209176,0.00012572535,0.000045601926,0.00005519386,0.0022410646,0.0004555088,0.0068147173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999933,0.000010534311,0.0000021875767,0.000027401164,0.000011681142,0.000015262482],"domain_scores_gemma":[0.9997974,0.00011786176,0.000027288605,0.000020653044,0.000021641483,0.000015060401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029059022,0.0006038472,0.00029336527,0.00050089275,0.00020720316,0.00063755084,0.0006416215,0.0004909208,0.001723357],"category_scores_gemma":[0.0011125157,0.0003724944,0.0007979023,0.0007355854,0.000279105,0.0006661472,0.00055257394,0.0006706259,0.0004937596],"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.0004672326,0.00016915091,0.008665517,0.00029538534,0.00049160817,0.00040724277,0.00026617036,0.40790915,0.1333049,0.017269557,0.009639031,0.42111504],"study_design_scores_gemma":[0.000010163961,0.000046229743,0.0072421636,0.000018265438,0.00006253375,0.0001471419,0.000045507637,0.96447796,0.008579545,0.017982434,0.0013691983,0.000018860761],"about_ca_topic_score_codex":0.008827841,"about_ca_topic_score_gemma":0.023442449,"teacher_disagreement_score":0.008827841,"about_ca_system_score_codex":0.00044876945,"about_ca_system_score_gemma":0.00056514126,"threshold_uncertainty_score":0.017552912},"labels":[],"label_agreement":null},{"id":"W3204473813","doi":"10.1007/978-3-030-88361-4_33","title":"The Punya Platform: Building Mobile Research Apps with Linked Data and Semantic Features","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Dalhousie University","funders":"","keywords":"Computer science; Linked data; World Wide Web; Semantic Web; Information retrieval","score_opus":0.06282182354520272,"score_gpt":0.32469980495909795,"score_spread":0.26187798141389523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204473813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018659072,0.0018294395,0.73404825,0.0012814534,0.00094231946,0.0011685824,0.0071294317,0.16387874,0.07106276],"genre_scores_gemma":[0.08984466,0.0033414916,0.7594217,0.0017035074,0.00035399926,0.0023042224,0.024566034,0.02200308,0.09646125],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929476,0.00010358339,0.000069592956,0.0001501553,0.0003212794,0.00006064109],"domain_scores_gemma":[0.99887973,0.00044292855,0.00006697155,0.0002983372,0.00015372,0.00015833875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014642614,0.0011565869,0.0007926604,0.0023138842,0.000890175,0.0036891478,0.0019830726,0.0012137798,0.012589477],"category_scores_gemma":[0.0036329804,0.0012265221,0.0012906024,0.0019380086,0.00071846857,0.0065614046,0.006277066,0.0020190272,0.01168059],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084661366,0.000556615,0.0042993133,0.0015676267,0.00025462825,0.00096605025,0.0020727909,0.0021913212,0.049055777,0.07267366,0.20781529,0.6577003],"study_design_scores_gemma":[0.0001971609,0.00030006847,0.004615205,0.0004866026,0.00023635197,0.0014051746,0.00045559258,0.030455556,0.023328098,0.062018964,0.8762575,0.00024390905],"about_ca_topic_score_codex":0.00094139,"about_ca_topic_score_gemma":0.0013732977,"teacher_disagreement_score":0.012589477,"about_ca_system_score_codex":0.0003632554,"about_ca_system_score_gemma":0.0010740412,"threshold_uncertainty_score":0.042116046},"labels":[],"label_agreement":null},{"id":"W3204608968","doi":"10.1007/978-3-030-87615-9_13","title":"Accelerating Geometry-Based Spherical Harmonics Glyphs Rendering for dMRI Using Modern OpenGL","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"OpenGL; Computer science; Spherical harmonics; Rendering (computer graphics); Slicing; Computer graphics (images); Ellipsoid; Voxel; Shader; Visualization; Spline (mechanical); Computer vision; Artificial intelligence; Computational science; Physics","score_opus":0.15591232312858366,"score_gpt":0.3677652341556015,"score_spread":0.2118529110270178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204608968","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.0042200945,0.00024482503,0.9637459,0.00021042193,0.00017365796,0.000080902064,0.0006378383,0.019025655,0.01166068],"genre_scores_gemma":[0.07461763,0.000659796,0.8998623,0.00026264,0.000111775924,0.00016591961,0.0016699488,0.0092198225,0.013430206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975187,0.000025134483,0.0000133444955,0.000027081673,0.00014978109,0.00003276614],"domain_scores_gemma":[0.9996325,0.00014361931,0.0000136463395,0.00007817433,0.00009617789,0.000035893056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003375962,0.0011970111,0.0004885717,0.0007447394,0.0002933566,0.0019261946,0.0011638602,0.00070037466,0.036941048],"category_scores_gemma":[0.0014308215,0.0004947367,0.000766662,0.0005771041,0.00026485452,0.0008316071,0.0016704641,0.0013955124,0.008181372],"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.00037530402,0.000086716056,0.00072045554,0.0006344001,0.000100033496,0.00052026036,0.0006686662,0.034416918,0.11796738,0.04527791,0.09175478,0.7074773],"study_design_scores_gemma":[0.00015239579,0.0001140333,0.0010490279,0.00016596876,0.00005987127,0.0010773042,0.00021127715,0.5975691,0.13637501,0.0393692,0.2237409,0.00011595462],"about_ca_topic_score_codex":0.002123641,"about_ca_topic_score_gemma":0.0032913743,"teacher_disagreement_score":0.036941048,"about_ca_system_score_codex":0.00049080333,"about_ca_system_score_gemma":0.0006372168,"threshold_uncertainty_score":0.12358016},"labels":[],"label_agreement":null},{"id":"W3204737315","doi":"10.1007/978-3-030-90874-4_12","title":"On the Fairness of Swarm Learning in Skin Lesion Classification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","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 British Columbia","funders":"","keywords":"Computer science; Trustworthiness; Artificial intelligence; Machine learning; Node (physics); Enhanced Data Rates for GSM Evolution; Swarm behaviour; Computer security","score_opus":0.03039702956433326,"score_gpt":0.2651947620116579,"score_spread":0.23479773244732466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204737315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041930128,0.0025498804,0.94015425,0.004186899,0.00069256866,0.00012811592,0.00017304502,0.0002545582,0.009930584],"genre_scores_gemma":[0.79237914,0.0017244722,0.18820794,0.0015998797,0.001990617,0.00031126878,0.0002862035,0.00036978576,0.013130615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99152136,0.005006432,0.00034341542,0.0012674816,0.0012376722,0.0006237102],"domain_scores_gemma":[0.8817286,0.1042776,0.002465438,0.0052797133,0.004524142,0.0017244439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027227268,0.0014701316,0.0036318863,0.0016287753,0.0017911649,0.0031560818,0.003926125,0.0034183462,0.0038986986],"category_scores_gemma":[0.08658735,0.0008786793,0.0013414404,0.0014198208,0.0058991024,0.006144935,0.00490423,0.0046735285,0.0006080348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006782241,0.000112485905,0.0046269684,0.0002543645,0.00016770871,0.00009348792,0.00034818024,0.6225478,0.0014149256,0.2810002,0.009149514,0.07960617],"study_design_scores_gemma":[0.000026841228,0.00006747503,0.00033768147,0.00002955992,0.000015041565,0.000031161144,0.000029498697,0.9054667,0.00023899313,0.09314469,0.0005988217,0.000013513398],"about_ca_topic_score_codex":0.004517497,"about_ca_topic_score_gemma":0.0030746125,"teacher_disagreement_score":0.027227268,"about_ca_system_score_codex":0.0035371447,"about_ca_system_score_gemma":0.002574403,"threshold_uncertainty_score":0.14399326},"labels":[],"label_agreement":null},{"id":"W3204810936","doi":"10.1007/978-3-030-87234-2_61","title":"SegRecon: Learning Joint Brain Surface Reconstruction and Segmentation from Images","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Voxel; Artificial intelligence; Segmentation; Computation; Surface reconstruction; Atlas (anatomy); Computer vision; Pattern recognition (psychology); Surface (topology); Representation (politics); Artificial neural network; Algorithm; Mathematics; Geometry","score_opus":0.017554499705453794,"score_gpt":0.25683165406568953,"score_spread":0.23927715436023572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204810936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054485505,0.0007052966,0.97659385,0.00016713819,0.00011339579,0.00009013223,0.00043629468,0.014908853,0.0015364246],"genre_scores_gemma":[0.041096535,0.0007170138,0.94044673,0.00027412662,0.000113158465,0.00024900146,0.0031457408,0.002436487,0.011521257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.00009960717,0.000028752542,0.00021573128,0.00025538736,0.00006696997],"domain_scores_gemma":[0.99940825,0.00025523794,0.00003674706,0.00014266222,0.00012008576,0.000037103393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323392,0.002467213,0.0020621526,0.0013286036,0.00043406512,0.0015116819,0.0036098764,0.0026889045,0.010902399],"category_scores_gemma":[0.0019938687,0.0014208929,0.0021875051,0.0017298161,0.00086145336,0.001445839,0.0019789857,0.0022561657,0.0066247974],"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.00025138492,0.000087521956,0.0003269622,0.00019404264,0.00017477044,0.00011342341,0.000062926956,0.07659887,0.013419861,0.0041871327,0.029458612,0.8751246],"study_design_scores_gemma":[0.000039259226,0.00010749649,0.00032854953,0.000023223349,0.000048494625,0.00019929228,0.00002716188,0.96804404,0.012832755,0.008153138,0.010169307,0.000027186343],"about_ca_topic_score_codex":0.008998039,"about_ca_topic_score_gemma":0.016740637,"teacher_disagreement_score":0.010902399,"about_ca_system_score_codex":0.0007703122,"about_ca_system_score_gemma":0.0013474989,"threshold_uncertainty_score":0.0364722},"labels":[],"label_agreement":null},{"id":"W3205152901","doi":"10.1007/978-3-030-90739-6_5","title":"A Simulation System for Scene Synthesis in Virtual Reality","year":2021,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"BC Research (Canada)","funders":"","keywords":"Virtual reality; Computer graphics (images); Computer science; Augmented reality; Human–computer interaction; Computer vision; Artificial intelligence","score_opus":0.029521789000735585,"score_gpt":0.316984735106764,"score_spread":0.2874629461060284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205152901","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.014441081,0.00010776611,0.9413281,0.00009372262,0.00011574579,0.00026054404,0.0008999693,0.036034133,0.0067189457],"genre_scores_gemma":[0.33943886,0.00053163193,0.6285547,0.00022724556,0.00006588376,0.0011323903,0.0037635379,0.008351475,0.017934231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.00009406261,0.000026660908,0.00005544441,0.00012809006,0.000030140405],"domain_scores_gemma":[0.9994361,0.00027369361,0.000020698337,0.00009475698,0.00010953837,0.00006524052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061336666,0.0010751571,0.0008113145,0.00072933926,0.00051223737,0.0011597914,0.0017555652,0.0010070662,0.03124734],"category_scores_gemma":[0.0015450256,0.00074769836,0.0008273224,0.00038806628,0.0004026654,0.00071183825,0.0013584063,0.00081399817,0.0047916346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024448512,0.0007226821,0.0033546935,0.0010269115,0.00043719914,0.0010195078,0.0012662974,0.48353985,0.14965178,0.029292364,0.035650697,0.29159316],"study_design_scores_gemma":[0.00035738532,0.00023000513,0.0005052516,0.000050968,0.000103784696,0.00027248662,0.000059654947,0.9096616,0.043218065,0.0036239105,0.041843858,0.00007308303],"about_ca_topic_score_codex":0.002392861,"about_ca_topic_score_gemma":0.001977374,"teacher_disagreement_score":0.03124734,"about_ca_system_score_codex":0.00048440005,"about_ca_system_score_gemma":0.0007827787,"threshold_uncertainty_score":0.10453278},"labels":[],"label_agreement":null},{"id":"W3205213491","doi":"10.1007/978-3-031-30445-3_35","title":"A Cross-Platform Benchmark for Interval Computation Libraries","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Benchmark (surveying); Computation; Interval (graph theory); Interval arithmetic; Parallel computing; Theoretical computer science; Computational science; Algorithm; Mathematics; Cartography; Combinatorics","score_opus":0.04205215407942594,"score_gpt":0.31812423413195146,"score_spread":0.27607208005252554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205213491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10154039,0.0029564078,0.47706208,0.00076777226,0.0012886571,0.0009104974,0.013478917,0.29825327,0.10374208],"genre_scores_gemma":[0.30864546,0.0013779576,0.5129438,0.00092489115,0.00024217907,0.0012897083,0.059242927,0.05846737,0.056865685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753857,0.00047522748,0.00027833643,0.00033646892,0.001033519,0.00033785703],"domain_scores_gemma":[0.995635,0.0016491085,0.0001715666,0.0011491303,0.0011019302,0.00029321606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025395912,0.0024704528,0.00086986256,0.0017040338,0.00094955444,0.0023551467,0.0050044633,0.0013212677,0.031887423],"category_scores_gemma":[0.007353323,0.0009366696,0.0012502004,0.0039529903,0.00065773766,0.0033285317,0.002805276,0.0021503526,0.0112588415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031383005,0.0015157228,0.003961879,0.0017258151,0.0003110429,0.000532207,0.00044158683,0.053406075,0.024587933,0.036026597,0.34204394,0.53230894],"study_design_scores_gemma":[0.001716515,0.0012235092,0.0040890975,0.00036131733,0.00027446734,0.00057735015,0.0003610676,0.59600574,0.12526147,0.03705594,0.23280565,0.00026789872],"about_ca_topic_score_codex":0.0045860466,"about_ca_topic_score_gemma":0.005843298,"teacher_disagreement_score":0.031887423,"about_ca_system_score_codex":0.0009188333,"about_ca_system_score_gemma":0.0018012569,"threshold_uncertainty_score":0.106674016},"labels":[],"label_agreement":null},{"id":"W3205430877","doi":"10.1007/978-3-030-88483-3_23","title":"Towards Unifying the Explainability Evaluation Methods for NLP","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Interpretability; Computer science; Artificial intelligence; Phrase; Metric (unit); Set (abstract data type); Machine learning; Feature (linguistics); Focus (optics); Natural language; Deep learning; Key (lock); Natural language processing; Training set","score_opus":0.08998709768257471,"score_gpt":0.3780216545665107,"score_spread":0.288034556883936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205430877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002002978,0.0008826519,0.99364626,0.00049281615,0.0000738663,0.00014320489,0.00019407483,0.00089385646,0.0016704184],"genre_scores_gemma":[0.064705685,0.00084362796,0.92960215,0.00022549176,0.00029324892,0.00048666238,0.0011388907,0.00069536874,0.002008914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97217464,0.013810897,0.0032151134,0.0027292066,0.007384778,0.0006854265],"domain_scores_gemma":[0.8934941,0.075667456,0.003789636,0.013352763,0.012427291,0.0012687797],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03422286,0.0020101871,0.0030041817,0.010424637,0.0012194321,0.010076493,0.0042279386,0.0030767252,0.0057578497],"category_scores_gemma":[0.089282185,0.001313635,0.0039508543,0.0060190465,0.0034428844,0.015564136,0.0075699226,0.0064945556,0.0021062163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023833149,0.0002464073,0.0041467776,0.0010653747,0.00040334344,0.00009485707,0.0012860153,0.016205674,0.003669543,0.33107036,0.0058301715,0.6357432],"study_design_scores_gemma":[0.00004996031,0.00013361736,0.00256807,0.00051733287,0.0002604426,0.00013667543,0.0004997077,0.33769953,0.004696964,0.6334565,0.019858839,0.0001223061],"about_ca_topic_score_codex":0.0037940843,"about_ca_topic_score_gemma":0.0041956683,"teacher_disagreement_score":0.96577716,"about_ca_system_score_codex":0.0025152673,"about_ca_system_score_gemma":0.0030449326,"threshold_uncertainty_score":0.18098992},"labels":[],"label_agreement":null},{"id":"W3205594023","doi":"10.1007/978-3-030-89029-2_30","title":"Curvature Analysis of Sculpted Hair Meshes for Hair Guides Generation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"École de Technologie Supérieure; Ubisoft (Canada)","funders":"","keywords":"Polygon mesh; Computer science; Curvature; Computer graphics (images); Scalp; Volume mesh; Hair growth; Mesh generation; Anatomy; Mathematics; Physics; Geometry","score_opus":0.02414973717468944,"score_gpt":0.2442654321873764,"score_spread":0.22011569501268696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205594023","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.038317878,0.00021099206,0.95300245,0.00006899724,0.00005896156,0.000060745897,0.00017718563,0.0014137315,0.0066890693],"genre_scores_gemma":[0.6437144,0.00031858648,0.3395118,0.000050284307,0.000035038043,0.000055247052,0.00073434354,0.0012016622,0.014378593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973017,0.000028513858,0.0000079305955,0.000038331,0.00017064252,0.000024319123],"domain_scores_gemma":[0.999476,0.00014557618,0.00003389776,0.00009531463,0.00021335189,0.000035745958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024196069,0.00046120802,0.00043988466,0.00077826355,0.00031984024,0.00090744934,0.0008331319,0.0006831702,0.0057815677],"category_scores_gemma":[0.0012344073,0.00035450343,0.00072600617,0.00045681593,0.00037547384,0.0004823621,0.00068470166,0.0005431222,0.0015094135],"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.00038646755,0.00010720615,0.0017866516,0.00028390373,0.00006092249,0.00036600832,0.00049291033,0.3781242,0.20344505,0.02528813,0.0098139085,0.3798446],"study_design_scores_gemma":[0.0000051253755,0.000028599265,0.0005503736,0.00001569635,0.000006929284,0.000112551126,0.000042049385,0.9790922,0.014481901,0.002889929,0.0027618704,0.000012793822],"about_ca_topic_score_codex":0.0018075231,"about_ca_topic_score_gemma":0.0021275948,"teacher_disagreement_score":0.0057815677,"about_ca_system_score_codex":0.000493063,"about_ca_system_score_gemma":0.00037617714,"threshold_uncertainty_score":0.01934123},"labels":[],"label_agreement":null},{"id":"W3206379208","doi":"10.1007/978-3-030-89022-3_26","title":"Empirically Evaluating the Semantic Qualities of Language Vocabularies","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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; University of Toronto; York University","funders":"","keywords":"Computer science; Operationalization; Vocabulary; Set (abstract data type); Documentation; Domain (mathematical analysis); Meaning (existential); Natural language processing; Design language; Artificial intelligence; Human–computer interaction; Software engineering; Programming language; Linguistics","score_opus":0.04808444048484034,"score_gpt":0.32746416313404925,"score_spread":0.2793797226492089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206379208","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.96779746,0.0012409502,0.017017152,0.0009136006,0.000040407554,0.00012459978,0.0008757356,0.00014956151,0.01184062],"genre_scores_gemma":[0.98574394,0.00021476504,0.012255874,0.000062101935,0.000016025495,0.0000463921,0.0012965422,0.000044471137,0.0003200289],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9866283,0.008175922,0.0012010086,0.00101445,0.0025783502,0.0004019322],"domain_scores_gemma":[0.6789151,0.2999968,0.0072335424,0.0057453006,0.006846582,0.0012626672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020696705,0.0006158718,0.0005787241,0.0038584447,0.0010632332,0.0052925255,0.0013429302,0.0016803856,0.0033357814],"category_scores_gemma":[0.21831016,0.00042610793,0.0006243182,0.0037072634,0.002177906,0.011068516,0.0024985217,0.0015904398,0.0003278639],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062550097,0.0018764599,0.39528245,0.002110814,0.0012484496,0.00061582925,0.007896435,0.10029765,0.016522536,0.15002488,0.007342585,0.31052694],"study_design_scores_gemma":[0.0009224591,0.002237444,0.12675141,0.0010204067,0.0013312148,0.0010345314,0.020890683,0.6085138,0.017303683,0.20624548,0.013505752,0.00024323187],"about_ca_topic_score_codex":0.0060748984,"about_ca_topic_score_gemma":0.008114083,"teacher_disagreement_score":0.020696705,"about_ca_system_score_codex":0.0017549394,"about_ca_system_score_gemma":0.0015520857,"threshold_uncertainty_score":0.10945594},"labels":[],"label_agreement":null},{"id":"W3206384689","doi":"10.1007/978-3-030-88806-0_21","title":"Compositional Verification of Smart Contracts Through Communication Abstraction","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Solidity; Abstraction; Mathematical proof; Parameterized complexity; Bundle; Property (philosophy); State (computer science); Static analysis; Theoretical computer science; Distributed computing; Programming language; Algorithm; Mathematics","score_opus":0.016664786782544568,"score_gpt":0.2520339808658232,"score_spread":0.2353691940832786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206384689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021284001,0.000069914015,0.970414,0.00015597316,0.000058700713,0.00012134141,0.000058523186,0.0015303339,0.0063072396],"genre_scores_gemma":[0.6736024,0.00019529396,0.3172132,0.0001821924,0.00006510386,0.00027218653,0.00027632338,0.00053436065,0.00765892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962134,0.0012005451,0.00018188065,0.00040264337,0.0014972984,0.00050413527],"domain_scores_gemma":[0.9941585,0.003118845,0.00024401833,0.0017866688,0.0005542141,0.00013777087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031292676,0.00079484476,0.00082247413,0.0007177424,0.0011495687,0.0018104798,0.0019825122,0.0010734162,0.005316954],"category_scores_gemma":[0.00756541,0.0010787839,0.0017373346,0.0007144344,0.004344974,0.0040701535,0.0046727676,0.0029940172,0.0011605617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035235749,0.00011893199,0.00036901628,0.0003028153,0.000058316236,0.00032284716,0.000778484,0.088816114,0.025725633,0.81835234,0.0019319108,0.062871315],"study_design_scores_gemma":[0.00010873682,0.00008138632,0.00014187988,0.0000652453,0.000058452722,0.000098455945,0.00010157808,0.38543186,0.032654528,0.5727161,0.008500762,0.00004097543],"about_ca_topic_score_codex":0.001775837,"about_ca_topic_score_gemma":0.00221378,"teacher_disagreement_score":0.005316954,"about_ca_system_score_codex":0.0012026608,"about_ca_system_score_gemma":0.0020705706,"threshold_uncertainty_score":0.01778692},"labels":[],"label_agreement":null},{"id":"W320681438","doi":"10.1007/978-3-642-40760-4_58","title":"Separation of Benign and Malignant Glands in Prostatic Adenocarcinoma","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Computing, Information and Cognitive Systems; Canadian Institutes of Health Research; British Columbia Innovation Council","keywords":"Lumen (anatomy); Adenocarcinoma; Histopathology; Histology; Prostate; Pathology; High resolution; Prostate cancer; Cancer; Prostate gland; Anatomy; Biology; Medicine; Internal medicine; Geology","score_opus":0.012182442285669632,"score_gpt":0.2735693448031242,"score_spread":0.2613869025174546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320681438","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.9371746,0.021040702,0.03721775,0.00045624757,0.00024433728,0.00009400711,0.00025444545,0.00042982557,0.0030881045],"genre_scores_gemma":[0.9693095,0.003107153,0.025218613,0.000088996676,0.00013945387,0.000019328441,0.00036950805,0.00010022879,0.0016471981],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958163,0.00005278175,0.000039949122,0.0000619832,0.00014846114,0.000115171104],"domain_scores_gemma":[0.9990816,0.00032541557,0.00010298199,0.000090041875,0.00022600849,0.00017388731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072804175,0.0004954833,0.0008114316,0.0033324251,0.0006058132,0.0017071554,0.0005528611,0.0008492113,0.0014510178],"category_scores_gemma":[0.0019608429,0.0005805273,0.00042172745,0.0009250861,0.000705336,0.0010333261,0.0012410979,0.00076840166,0.0009884627],"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.0074776267,0.00014975705,0.068238296,0.0010136573,0.00013702537,0.0040750485,0.0008206835,0.0020412994,0.6758119,0.0014976412,0.0006668268,0.23807028],"study_design_scores_gemma":[0.0002402166,0.0012883904,0.17947224,0.00025676689,0.00077095325,0.032765318,0.0029596235,0.041854717,0.7190079,0.00490955,0.016319089,0.00015507199],"about_ca_topic_score_codex":0.0012306841,"about_ca_topic_score_gemma":0.0015993568,"teacher_disagreement_score":0.0033324251,"about_ca_system_score_codex":0.00032125917,"about_ca_system_score_gemma":0.00063552096,"threshold_uncertainty_score":0.0048541427},"labels":[],"label_agreement":null},{"id":"W3207388056","doi":"10.1007/978-3-030-88942-5_21","title":"Controlling BigGAN Image Generation with a Segmentation Network","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Dalhousie University","funders":"","keywords":"Computer science; Silhouette; Artificial intelligence; Segmentation; Pattern recognition (psychology); Image segmentation; Pascal (unit); Mixture model; Computer vision; Gaussian; Conditional random field","score_opus":0.014757396378625463,"score_gpt":0.2246717194340237,"score_spread":0.20991432305539823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207388056","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.02190934,0.00023822396,0.97147197,0.00024860358,0.00010216914,0.000052031082,0.000082070714,0.0019480884,0.0039474536],"genre_scores_gemma":[0.68835974,0.00022262114,0.2989728,0.00036755108,0.000097106575,0.00014412167,0.0002639472,0.0005187566,0.011053377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998667,0.0000247197,0.000003078898,0.00005259187,0.000031134998,0.000021688107],"domain_scores_gemma":[0.9997389,0.00016267569,0.000016758246,0.000037974074,0.00002788002,0.000015753669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037373256,0.0006807626,0.00041503203,0.00023935048,0.00022565051,0.00051748793,0.0007500223,0.00091447553,0.0040304735],"category_scores_gemma":[0.0010570493,0.0004250552,0.00036746447,0.00018820973,0.00050669553,0.0007657413,0.0011107678,0.0010892495,0.00082141056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035947675,0.00011051062,0.0005190202,0.00009302618,0.000058000333,0.00015265934,0.00006160341,0.6938397,0.061189733,0.017453942,0.0051667565,0.22099552],"study_design_scores_gemma":[0.000004658971,0.00001603434,0.00004591982,0.0000025400614,0.000003358712,0.000019960524,0.0000017958527,0.99043065,0.006130633,0.0028862683,0.0004554288,0.00000269762],"about_ca_topic_score_codex":0.001257395,"about_ca_topic_score_gemma":0.002026465,"teacher_disagreement_score":0.0040304735,"about_ca_system_score_codex":0.00051408977,"about_ca_system_score_gemma":0.00029875519,"threshold_uncertainty_score":0.013483226},"labels":[],"label_agreement":null},{"id":"W3207612168","doi":"10.1007/978-3-030-88323-2_4","title":"Security Analysis of DGM and GM Group Signature Schemes Instantiated with XMSS-T","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Victoria","funders":"","keywords":"Merkle tree; Stateful firewall; Hash function; Computer science; Digital signature; Signature (topology); Merkle signature scheme; Theoretical computer science; Computer network; Hash chain; Computer security; Mathematics; Blind signature","score_opus":0.008342640998972353,"score_gpt":0.22136974513797242,"score_spread":0.21302710413900006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207612168","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.5866274,0.0015999065,0.33823025,0.0023543695,0.00022634158,0.00050444837,0.0013309089,0.0024585063,0.066667855],"genre_scores_gemma":[0.97842133,0.00018058602,0.016409945,0.00014155594,0.00007427685,0.000059329752,0.00039041688,0.00009906193,0.0042234748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579763,0.001140462,0.00015829067,0.00044294272,0.00141893,0.0010417815],"domain_scores_gemma":[0.9944371,0.0025014952,0.00044764555,0.0019437355,0.0004735948,0.00019640285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028058765,0.0005827967,0.00074897485,0.0012564247,0.0012487984,0.002935129,0.0013650202,0.0012324337,0.0061258785],"category_scores_gemma":[0.0067922026,0.0003202867,0.0011847566,0.001186597,0.0023053521,0.0040926384,0.003029773,0.001700873,0.0011181857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019376936,0.00014999682,0.003465893,0.00027243618,0.00009684282,0.00033403112,0.00042371644,0.06520349,0.018761517,0.85916406,0.0055629453,0.04462741],"study_design_scores_gemma":[0.00015151463,0.0003321047,0.0023880126,0.00012389048,0.00013136341,0.0008070641,0.00030048747,0.4703312,0.026156006,0.48402756,0.015184069,0.00006679152],"about_ca_topic_score_codex":0.0007095835,"about_ca_topic_score_gemma":0.00051825435,"teacher_disagreement_score":0.0061258785,"about_ca_system_score_codex":0.003197154,"about_ca_system_score_gemma":0.0019263393,"threshold_uncertainty_score":0.023197055},"labels":[],"label_agreement":null},{"id":"W3207991465","doi":"10.1007/978-3-662-64331-0_3","title":"Short Paper: Debt Representation in UTXO Blockchains","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and 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 Toronto","funders":"","keywords":"Transparency (behavior); Computer science; Debt; Representation (politics); Scalability; Loan; Flexibility (engineering); Computer security; Finance; Business; Economics; Database","score_opus":0.016016510473570784,"score_gpt":0.25883023401637756,"score_spread":0.24281372354280678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207991465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08830849,0.007819744,0.54039896,0.01760822,0.008451918,0.00030946007,0.0027705226,0.0021211777,0.3322115],"genre_scores_gemma":[0.6776906,0.004478101,0.062751986,0.0011826026,0.00217892,0.00016369883,0.0027093855,0.0007492496,0.24809538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945325,0.00020098581,0.000034990073,0.000105641026,0.00014350691,0.00006164967],"domain_scores_gemma":[0.99828523,0.00093610963,0.00007805468,0.00034857096,0.00024730942,0.00010464402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081288663,0.0003641562,0.00042141922,0.00046374334,0.00088881934,0.0027222368,0.000917116,0.0014504789,0.037157856],"category_scores_gemma":[0.006129706,0.00026152123,0.00034697825,0.0022233413,0.0007460208,0.006188173,0.0013902878,0.0018180228,0.0042107864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032267795,0.00011046073,0.0006227253,0.0003123003,0.000022202525,0.00015993077,0.00024702091,0.032032218,0.0015577229,0.7238682,0.068275675,0.17246892],"study_design_scores_gemma":[0.00007408653,0.00006057577,0.0005417175,0.00021547718,0.00002038056,0.00017255658,0.00014419538,0.15519488,0.0034661277,0.6793184,0.16075742,0.000034105407],"about_ca_topic_score_codex":0.0024984884,"about_ca_topic_score_gemma":0.0017204874,"teacher_disagreement_score":0.037157856,"about_ca_system_score_codex":0.0013870524,"about_ca_system_score_gemma":0.0009620626,"threshold_uncertainty_score":0.12430543},"labels":[],"label_agreement":null},{"id":"W3208101893","doi":"10.1007/978-3-030-90567-5_35","title":"Verifiable Obtained Random Subsets for Improving SPHINCS+","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"NIST; Verifiable secret sharing; Computer science; Hash function; Digital signature; Cryptography; Theoretical computer science; Standardization; Computation; Algorithm; Set (abstract data type); Computer security","score_opus":0.013122364782367344,"score_gpt":0.2334616501309755,"score_spread":0.22033928534860817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208101893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0617087,0.0006829976,0.8733279,0.0019174003,0.0007424875,0.0007843656,0.0022922542,0.013085695,0.045458212],"genre_scores_gemma":[0.5980087,0.00038076774,0.35835275,0.0012182221,0.00054882606,0.0008951563,0.004701672,0.0015123343,0.034381516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479204,0.0012504692,0.00026718256,0.00087222096,0.0020847637,0.00073329423],"domain_scores_gemma":[0.99287605,0.001962033,0.00024501275,0.0039874217,0.0006819873,0.00024751064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024220934,0.00125231,0.0015567294,0.000880725,0.0013796772,0.0020386649,0.0027411648,0.0011587958,0.014905888],"category_scores_gemma":[0.007829412,0.00059524504,0.0014258927,0.001091789,0.0017248761,0.0034608424,0.007086675,0.0030123105,0.005101914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039675157,0.00061643985,0.0016793063,0.0006246497,0.0001642123,0.00031533992,0.0003706218,0.055361025,0.029737402,0.4744851,0.058232423,0.37444592],"study_design_scores_gemma":[0.000467379,0.0006653646,0.00075751403,0.000155671,0.00018309617,0.0005057805,0.00013813497,0.38040027,0.043085173,0.5278982,0.0456702,0.00007317992],"about_ca_topic_score_codex":0.0010036951,"about_ca_topic_score_gemma":0.0016313787,"teacher_disagreement_score":0.014905888,"about_ca_system_score_codex":0.0016087044,"about_ca_system_score_gemma":0.0033546248,"threshold_uncertainty_score":0.049865186},"labels":[],"label_agreement":null},{"id":"W3208390159","doi":"10.1007/978-3-030-89817-5_25","title":"Linear Structures Identification in Images Using Scale Space Radon Transform and Multiscale Image Hessian","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Hessian matrix; Computer science; Radon transform; Computation; Maxima and minima; Image (mathematics); Artificial intelligence; Scale (ratio); Computer vision; Pattern recognition (psychology); Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Physics","score_opus":0.010688356926085886,"score_gpt":0.26005411976552795,"score_spread":0.24936576283944206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208390159","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.013154017,0.00031692215,0.9837034,0.000051481566,0.00002097479,0.000016726579,0.000040909974,0.00044904777,0.0022464886],"genre_scores_gemma":[0.21037856,0.00083954673,0.77728045,0.000044267068,0.0000391851,0.000038749713,0.00019997924,0.00026568843,0.010913584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984217,0.000017246048,0.00000760207,0.0000440763,0.00007698202,0.000011900403],"domain_scores_gemma":[0.9998367,0.00005476087,0.000023665067,0.000030229685,0.000046361973,0.000008206765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020811951,0.00032050323,0.0004429315,0.00069536694,0.00016185109,0.00061149354,0.0003640092,0.0003955337,0.002378903],"category_scores_gemma":[0.0005998599,0.00030581333,0.00045935297,0.00064042315,0.00035860125,0.0009612683,0.00047526453,0.0004538774,0.0011988904],"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.00006084397,0.000051492192,0.0009593952,0.00024706405,0.00004963767,0.00025677477,0.00017442275,0.043656144,0.22363523,0.08100354,0.0034508267,0.6464547],"study_design_scores_gemma":[0.0000066406274,0.000084176485,0.0030505331,0.000020043113,0.000035726487,0.0006242339,0.00007992244,0.89933306,0.051781807,0.0379839,0.0069672344,0.000032736476],"about_ca_topic_score_codex":0.00082302483,"about_ca_topic_score_gemma":0.0014313699,"teacher_disagreement_score":0.002378903,"about_ca_system_score_codex":0.00024278267,"about_ca_system_score_gemma":0.00026589644,"threshold_uncertainty_score":0.007958233},"labels":[],"label_agreement":null},{"id":"W3208671521","doi":"10.1007/978-3-031-17143-7_15","title":"Mixed-Technique Multi-Party Computations Composed of Two-Party Computations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Homomorphic encryption; Computer science; Secure multi-party computation; Computation; Theoretical computer science; Secure two-party computation; Encryption; Set (abstract data type); Oblivious transfer; Multiplicative function; Secret sharing; Construct (python library); Communication complexity; Computer security; Computer network; Cryptography; Algorithm; Mathematics","score_opus":0.030368300369527233,"score_gpt":0.2780407050033518,"score_spread":0.2476724046338246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208671521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017267814,0.000345618,0.9625691,0.00016533272,0.00014632002,0.00019985485,0.00007200836,0.0007589039,0.01847498],"genre_scores_gemma":[0.4015981,0.00042130952,0.5644581,0.00018238589,0.00016554148,0.00036599362,0.0002535609,0.00032794478,0.032227136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979944,0.00058971153,0.00011757563,0.00029973406,0.00075975223,0.00023892375],"domain_scores_gemma":[0.99773276,0.00072007196,0.000090613736,0.0011187482,0.00024712234,0.00009063741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015677776,0.000901314,0.0009794342,0.0006536402,0.0010955735,0.002696766,0.0016073756,0.0011765171,0.012198476],"category_scores_gemma":[0.003096931,0.00069762144,0.0015698441,0.0011185186,0.0011225737,0.004129832,0.0039661997,0.0024039128,0.0040636966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012636125,0.0002527289,0.00083571917,0.0007596538,0.00028169193,0.00062359276,0.0003580751,0.023456119,0.07178221,0.6930845,0.0053840093,0.20191808],"study_design_scores_gemma":[0.00021798168,0.00071343506,0.0007999105,0.00020747418,0.0003006455,0.0019137064,0.000104775936,0.47340673,0.096607566,0.37572023,0.049900457,0.00010706257],"about_ca_topic_score_codex":0.00011224298,"about_ca_topic_score_gemma":0.00025361901,"teacher_disagreement_score":0.012198476,"about_ca_system_score_codex":0.0005751566,"about_ca_system_score_gemma":0.00073088356,"threshold_uncertainty_score":0.040807962},"labels":[],"label_agreement":null},{"id":"W3209252692","doi":"10.1007/978-3-030-90567-5_1","title":"Leakage Resilient Cheating Detectable Secret Sharing Schemes","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Secret sharing; Computer science; Secure multi-party computation; Access structure; Homomorphic secret sharing; Cryptography; Theoretical computer science; Cheating; Shamir's Secret Sharing; Adversary; Compiler; Computer security; Verifiable secret sharing; Set (abstract data type); Programming language","score_opus":0.016733130514906425,"score_gpt":0.24294874280422302,"score_spread":0.22621561228931658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209252692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0778082,0.0019073092,0.8892665,0.0016946157,0.0003294457,0.00020483175,0.00021260472,0.0028824212,0.02569411],"genre_scores_gemma":[0.90410286,0.0007233804,0.07764941,0.00035837022,0.000177237,0.00011416009,0.000166844,0.00018148212,0.016526295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952415,0.0011829839,0.00020620384,0.0005169282,0.0022515708,0.00060080463],"domain_scores_gemma":[0.99059993,0.0038887435,0.0007670897,0.0038725394,0.00066047505,0.00021119598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023543134,0.001131379,0.0011337488,0.00097429444,0.0009321216,0.0021229994,0.0025253575,0.0019726774,0.004404466],"category_scores_gemma":[0.007670087,0.0008013212,0.00073194026,0.0013895319,0.0021004793,0.004085599,0.0044308174,0.0046109003,0.0013923044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015891464,0.00044578404,0.00076530594,0.00054857455,0.00016196174,0.00062067545,0.00078489684,0.10529263,0.06866195,0.56897974,0.011428231,0.24072117],"study_design_scores_gemma":[0.00019461756,0.0006513516,0.00048201284,0.0001626974,0.00012972469,0.0014480277,0.00009638537,0.4856866,0.07881973,0.417074,0.015144717,0.00011019329],"about_ca_topic_score_codex":0.00016011683,"about_ca_topic_score_gemma":0.00014700305,"teacher_disagreement_score":0.004404466,"about_ca_system_score_codex":0.0015729399,"about_ca_system_score_gemma":0.00096463255,"threshold_uncertainty_score":0.014734387},"labels":[],"label_agreement":null},{"id":"W3209317464","doi":"10.1007/978-3-031-06901-7_7","title":"Improving the Cook et al. Proximity Bound Given Integral Valued Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 British Columbia","funders":"","keywords":"Physics; Combinatorics; Upper and lower bounds; Mathematics; Mathematical analysis","score_opus":0.04196334111085764,"score_gpt":0.3287179370376539,"score_spread":0.28675459592679625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209317464","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.01294255,0.004467104,0.9242658,0.0024348751,0.0010527401,0.00010376388,0.00043474307,0.000970719,0.053327642],"genre_scores_gemma":[0.24892414,0.0046633985,0.6684934,0.0023123175,0.0013183276,0.00027489476,0.0014664526,0.0014621684,0.07108491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969892,0.000688071,0.0001298143,0.0006258792,0.0013158065,0.0002513503],"domain_scores_gemma":[0.99144495,0.005638215,0.00019350884,0.0012040208,0.0012342666,0.00028503206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030169582,0.0019587155,0.0025814613,0.0023549239,0.0015295371,0.0035553966,0.0033647364,0.0034022601,0.02328069],"category_scores_gemma":[0.023745345,0.00094786554,0.0014173695,0.00423831,0.0019416513,0.0067965016,0.006887769,0.007184524,0.0066003124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005234809,0.00023862191,0.00087223394,0.00074811454,0.00012449101,0.00027086996,0.00034921378,0.13698873,0.0047563487,0.42299715,0.0648079,0.36732292],"study_design_scores_gemma":[0.00008960401,0.0001900977,0.00039269248,0.0002193623,0.000076465105,0.0002900137,0.00013881449,0.5656992,0.0039993674,0.387929,0.04091015,0.000065153305],"about_ca_topic_score_codex":0.0041883173,"about_ca_topic_score_gemma":0.004585318,"teacher_disagreement_score":0.02328069,"about_ca_system_score_codex":0.0017625105,"about_ca_system_score_gemma":0.0022119125,"threshold_uncertainty_score":0.077881634},"labels":[],"label_agreement":null},{"id":"W3209445097","doi":"10.1007/978-3-030-89394-1_25","title":"What Is a Game Mechanic?","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Carleton University","funders":"","keywords":"Computer science; Human–computer interaction; Computer graphics (images)","score_opus":0.0310701420552602,"score_gpt":0.27770099581282276,"score_spread":0.24663085375756255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209445097","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.018890025,0.003517009,0.08844602,0.02139908,0.0012489022,0.00007812576,0.0002333784,0.00035608053,0.86583143],"genre_scores_gemma":[0.7513983,0.004475756,0.05642655,0.0051259995,0.00086352177,0.00028716022,0.00035681302,0.00038321322,0.18068267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993278,0.0002496946,0.00004058066,0.00013604925,0.0001522815,0.00009363448],"domain_scores_gemma":[0.99910754,0.0005022355,0.000060423263,0.00009956735,0.00014104783,0.00008920871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007736083,0.0006430586,0.00063673506,0.0010096182,0.0015816017,0.0034581365,0.001039629,0.0019626776,0.01594143],"category_scores_gemma":[0.003367214,0.0004980891,0.0005535856,0.00078893395,0.005315913,0.008677811,0.001160754,0.0027964078,0.0030024424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010762839,0.000012518114,0.00007792405,0.000048750742,0.0000053309454,0.000019258698,0.00013119714,0.00033200352,0.0001443937,0.9855487,0.0049396586,0.008729561],"study_design_scores_gemma":[0.00000747606,0.000011369784,0.00014739962,0.000083593826,0.0000065834147,0.0000782335,0.00021114001,0.0013922139,0.0002263772,0.9516574,0.046169687,0.000008477377],"about_ca_topic_score_codex":0.0016968312,"about_ca_topic_score_gemma":0.0024094642,"teacher_disagreement_score":0.01594143,"about_ca_system_score_codex":0.001178163,"about_ca_system_score_gemma":0.0011698963,"threshold_uncertainty_score":0.05332941},"labels":[],"label_agreement":null},{"id":"W3209535718","doi":"10.1007/978-3-030-89543-3_5","title":"A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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 Guelph","funders":"","keywords":"Listing (finance); Spanning tree; Gray (unit); Computer science; Combinatorics; Mathematics; Business; Medicine","score_opus":0.03706637153232336,"score_gpt":0.29979928516799187,"score_spread":0.26273291363566853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209535718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030521171,0.0009656148,0.7069571,0.00064897997,0.0007116349,0.00068216486,0.006962476,0.040619027,0.21193185],"genre_scores_gemma":[0.12169647,0.000757953,0.74876237,0.00041643367,0.0001127593,0.0003985131,0.0075683957,0.008277158,0.11200993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.00002403055,0.000012591679,0.00003206077,0.00011418037,0.000045857185],"domain_scores_gemma":[0.99959403,0.00013805211,0.000019804902,0.000087744906,0.00012772155,0.00003267466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023109294,0.00082714943,0.00060653366,0.0017071888,0.0009731241,0.001211243,0.0009998436,0.00080675253,0.06829979],"category_scores_gemma":[0.0013721779,0.00042998043,0.00051098387,0.0021559882,0.00040300755,0.0015330921,0.0008887597,0.0007727296,0.016261548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035768055,0.00019541524,0.00067194557,0.0005119972,0.000013305175,0.00074760296,0.0002664771,0.009272752,0.017056486,0.1591705,0.15116026,0.66057557],"study_design_scores_gemma":[0.00013000585,0.0002589763,0.0015988194,0.0004616833,0.000039285947,0.0017857344,0.000268072,0.09508578,0.03765696,0.28626746,0.5763037,0.00014355381],"about_ca_topic_score_codex":0.003936383,"about_ca_topic_score_gemma":0.0065439628,"teacher_disagreement_score":0.06829979,"about_ca_system_score_codex":0.00092072977,"about_ca_system_score_gemma":0.0011279774,"threshold_uncertainty_score":0.22848558},"labels":[],"label_agreement":null},{"id":"W3209656157","doi":"10.1007/978-3-030-90525-5_66","title":"What Happened While I Was Away? Leveraging Visual Transition Techniques to Convey Robot States in Multi-robot Teleoperation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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 Manitoba","funders":"","keywords":"Teleoperation; Robot; Computer science; Human–computer interaction; Situation awareness; Leverage (statistics); Transition (genetics); Operator (biology); Artificial intelligence; Engineering","score_opus":0.04439888103287349,"score_gpt":0.3517926480852965,"score_spread":0.307393767052423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209656157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16167144,0.003042178,0.8014232,0.0009204239,0.00059357984,0.000078575875,0.00020868352,0.0037251674,0.028336862],"genre_scores_gemma":[0.88082093,0.0016226998,0.10393295,0.00025767845,0.00006707644,0.000037283102,0.00016725676,0.000225884,0.012868352],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999485,0.0000122243055,0.0000024726212,0.000015078154,0.0000135778155,0.000008139307],"domain_scores_gemma":[0.9997427,0.00017292099,0.000029603441,0.000014612315,0.000022913235,0.000017318349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015479245,0.00031241798,0.00015349829,0.000182597,0.00013724061,0.0006517712,0.00027324216,0.0003623893,0.0045573423],"category_scores_gemma":[0.0010712612,0.000106273204,0.00019197143,0.0001826271,0.00028122478,0.0010982937,0.00043157433,0.0006509834,0.0008337501],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007805967,0.00015967998,0.0018846695,0.00047974015,0.00003297792,0.00050405815,0.0017565903,0.008675282,0.18709503,0.016655143,0.007284188,0.77469206],"study_design_scores_gemma":[0.000109251356,0.0013801956,0.019751836,0.0006469753,0.00022638074,0.0027306539,0.0044810246,0.55310595,0.24468994,0.108458586,0.06420982,0.0002094902],"about_ca_topic_score_codex":0.0006255562,"about_ca_topic_score_gemma":0.0012233456,"teacher_disagreement_score":0.0045573423,"about_ca_system_score_codex":0.000103370774,"about_ca_system_score_gemma":0.00014774334,"threshold_uncertainty_score":0.015245855},"labels":[],"label_agreement":null},{"id":"W3210593278","doi":"10.1007/978-3-030-90525-5_8","title":"Developing a Robot’s Empathetic Reactive Response Inspired by a Bottom-Up Attention Model","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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 Manitoba","funders":"","keywords":"Computer science; Robot; Perception; Behavior-based robotics; Stimulus (psychology); Repertoire; Human–computer interaction; Artificial intelligence; Cognitive psychology; Psychology; Mobile robot; Neuroscience","score_opus":0.054618896427181124,"score_gpt":0.3442847826875185,"score_spread":0.2896658862603374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210593278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03548258,0.00019678395,0.9523215,0.00024821862,0.00013769648,0.00005555127,0.000024284203,0.001608611,0.00992476],"genre_scores_gemma":[0.7886409,0.00018130356,0.19666627,0.00028634229,0.000043339413,0.00011301887,0.00006621505,0.00020170053,0.013800903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987185,0.000024959772,0.0000047235612,0.00004866038,0.000026089006,0.000023593899],"domain_scores_gemma":[0.9998373,0.00007490405,0.000010677038,0.000022686347,0.00003280727,0.000021573125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030264084,0.0004900904,0.0003975201,0.00013230363,0.000283562,0.00061332603,0.0011800786,0.000847884,0.0044744657],"category_scores_gemma":[0.0007748352,0.0002807699,0.0005806109,0.00013088482,0.00035285583,0.00071201095,0.00091698486,0.00084564503,0.00093346316],"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.0004198948,0.00036623838,0.0012679816,0.00034836135,0.00020253324,0.0006591656,0.00093202956,0.33031753,0.2472719,0.061667554,0.0068687717,0.34967804],"study_design_scores_gemma":[0.000015975933,0.0000884782,0.0002412539,0.000007549116,0.000033935554,0.00005672582,0.0000358301,0.98484844,0.0077441605,0.005630309,0.0012841444,0.000013256468],"about_ca_topic_score_codex":0.001473804,"about_ca_topic_score_gemma":0.0010636953,"teacher_disagreement_score":0.0044744657,"about_ca_system_score_codex":0.00029746996,"about_ca_system_score_gemma":0.00035480317,"threshold_uncertainty_score":0.014968574},"labels":[],"label_agreement":null},{"id":"W3210701102","doi":"10.1007/978-3-030-88004-0_8","title":"Attentive Contrast Learning Network for Fine-Grained Classification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Pairwise comparison; Contrast (vision); Feature learning; Leverage (statistics); Feature (linguistics); Representation (politics); Pattern recognition (psychology); Benchmark (surveying); Generator (circuit theory); Machine learning; Power (physics)","score_opus":0.029991139601150366,"score_gpt":0.26005333933723634,"score_spread":0.230062199736086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210701102","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.045602717,0.0035414032,0.9349003,0.00047185915,0.00044138503,0.00012550903,0.0004798142,0.004440612,0.009996496],"genre_scores_gemma":[0.618139,0.0015031481,0.34922713,0.0007987835,0.0003392021,0.00017369217,0.0017691948,0.00034183016,0.027708065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.000023534676,0.0000068188906,0.00009647119,0.000024773677,0.000032206364],"domain_scores_gemma":[0.99971503,0.00011415098,0.000017245122,0.00005798953,0.000067533794,0.000027933913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005130718,0.0009662948,0.00080945465,0.0004736714,0.0003985108,0.0009103192,0.0019907146,0.0011855863,0.0067282766],"category_scores_gemma":[0.00087264227,0.0003816707,0.00065331446,0.0005562978,0.00044308687,0.0015809964,0.0014232153,0.0020495798,0.0019533453],"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.00037293247,0.00035991645,0.0010365432,0.0001975291,0.00014817092,0.00016426743,0.00009725463,0.05011848,0.05318685,0.015666297,0.015132941,0.86351883],"study_design_scores_gemma":[0.00001847975,0.00016289212,0.0008455138,0.000029327137,0.00009329109,0.00011453211,0.000029169038,0.95436436,0.018952208,0.019236317,0.006130252,0.000023548573],"about_ca_topic_score_codex":0.0038077089,"about_ca_topic_score_gemma":0.006426492,"teacher_disagreement_score":0.0067282766,"about_ca_system_score_codex":0.00070750073,"about_ca_system_score_gemma":0.0005602943,"threshold_uncertainty_score":0.022508264},"labels":[],"label_agreement":null},{"id":"W3210851624","doi":"10.1007/978-3-662-64331-0_30","title":"Practical Witness-Key-Agreement for Blockchain-Based Dark Pools Financial Trading","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Environment Research Council; Sight Research UK","keywords":"Computer science; Zero-knowledge proof; Witness; Computer security; Key (lock); Database transaction; Argument (complex analysis); Relation (database); Asset (computer security); Cryptography; Internet privacy; Database","score_opus":0.023234897351944686,"score_gpt":0.2743167088209869,"score_spread":0.25108181146904224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210851624","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.058548305,0.00045091053,0.91969186,0.0009871345,0.00022950002,0.00033294686,0.0003593771,0.00073528336,0.018664608],"genre_scores_gemma":[0.89291143,0.00036868494,0.09054911,0.00017970905,0.00009055853,0.00025301913,0.0004461373,0.00015924651,0.015042107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969368,0.0011322091,0.0001880198,0.0005953105,0.0006757822,0.0004718989],"domain_scores_gemma":[0.9934823,0.0037584663,0.00022890535,0.0016322795,0.0005050746,0.0003929461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038498605,0.0007619773,0.002013881,0.000507122,0.0019089199,0.0035861318,0.0028651445,0.0028104086,0.01598413],"category_scores_gemma":[0.011851931,0.00068698736,0.0008450445,0.0014309945,0.0022790194,0.0076549454,0.008409621,0.003465348,0.0023801632],"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.0016741618,0.00030270632,0.00064461364,0.00048762513,0.00010697605,0.0006136217,0.000676568,0.1583191,0.011530969,0.7046244,0.008976607,0.1120426],"study_design_scores_gemma":[0.00014347349,0.00011206232,0.00007820928,0.000039837123,0.000021009831,0.000102621576,0.00009688063,0.504219,0.004136616,0.4873923,0.0036286975,0.00002931531],"about_ca_topic_score_codex":0.0008242147,"about_ca_topic_score_gemma":0.0009528175,"teacher_disagreement_score":0.01598413,"about_ca_system_score_codex":0.0013823773,"about_ca_system_score_gemma":0.0029095432,"threshold_uncertainty_score":0.05347222},"labels":[],"label_agreement":null},{"id":"W3210928534","doi":"10.1007/978-3-030-87756-9_1","title":"Aggregating Preferences Represented by Conditional Preference Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Preference; Artificial intelligence; Operations research; Statistics; Mathematics","score_opus":0.022759261580288456,"score_gpt":0.2396448238417689,"score_spread":0.21688556226148045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210928534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020885812,0.00017252762,0.9725175,0.00014217934,0.00003655255,0.00005476726,0.00029925202,0.00025011695,0.00564135],"genre_scores_gemma":[0.42760706,0.00071474875,0.5614707,0.00014784401,0.00009179957,0.00026974,0.0016984487,0.00014826789,0.007851311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973475,0.0012768187,0.00018062674,0.00037551578,0.0006555179,0.00016402629],"domain_scores_gemma":[0.9942517,0.003957761,0.00027207116,0.0008327565,0.00053927244,0.00014643319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027451094,0.0007591622,0.0007181403,0.0010285886,0.00039117716,0.0021216099,0.0011425322,0.0005051348,0.0051216343],"category_scores_gemma":[0.010465727,0.0006086993,0.0012593894,0.0025917077,0.0005599548,0.005167724,0.0017659772,0.0016565922,0.00083083636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036221574,0.00016870079,0.0018166861,0.00035227084,0.00031124786,0.00028846372,0.00057583774,0.24668795,0.0056023416,0.50993955,0.00616446,0.22773027],"study_design_scores_gemma":[0.00001837626,0.000051254043,0.00047066045,0.000044367724,0.00007598313,0.000084859865,0.0000902359,0.67835027,0.0020228883,0.31306586,0.0057007815,0.00002447864],"about_ca_topic_score_codex":0.0016181236,"about_ca_topic_score_gemma":0.0033353013,"teacher_disagreement_score":0.0051216343,"about_ca_system_score_codex":0.00082105445,"about_ca_system_score_gemma":0.0005615031,"threshold_uncertainty_score":0.017133594},"labels":[],"label_agreement":null},{"id":"W3211769661","doi":"10.1007/978-3-031-37660-3_29","title":"Leveraging Sentiment Analysis Knowledge to Solve Emotion Detection Tasks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Air Canada; Polytechnique Montréal","funders":"","keywords":"Computer science; Sentiment analysis; Artificial intelligence; Adapter (computing); Transformer; Task (project management); Natural language processing; Key (lock)","score_opus":0.030065510210739315,"score_gpt":0.27669674892741764,"score_spread":0.24663123871667833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211769661","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.040566236,0.0015596483,0.9299721,0.00088076905,0.000905804,0.0003528609,0.0017721714,0.0066414294,0.01734895],"genre_scores_gemma":[0.29404512,0.0020095878,0.6758638,0.0006842759,0.00093327864,0.00031303952,0.0079624895,0.0008777453,0.017310627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994362,0.000097356366,0.00005041258,0.00017855076,0.0001715407,0.00006592293],"domain_scores_gemma":[0.99890983,0.00044010684,0.000099032535,0.0001324407,0.00036573596,0.000052825108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092655787,0.0016781689,0.00089945714,0.0018953867,0.000488683,0.0017142515,0.00085042586,0.00079086993,0.0055992734],"category_scores_gemma":[0.0025485163,0.00043490526,0.0014648066,0.0014731481,0.00020853784,0.0023001889,0.0009637815,0.0015690849,0.006617828],"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.00017251409,0.00044757166,0.0019946203,0.00028221583,0.00017947424,0.00022855694,0.00013778967,0.0045713056,0.094896495,0.0021784594,0.02878307,0.86612797],"study_design_scores_gemma":[0.000060481296,0.00031430487,0.005963651,0.00016775768,0.00044311647,0.00057263055,0.00032758206,0.82725954,0.09588155,0.028715465,0.040199835,0.00009406351],"about_ca_topic_score_codex":0.0011761922,"about_ca_topic_score_gemma":0.0022385877,"teacher_disagreement_score":0.0055992734,"about_ca_system_score_codex":0.00032175786,"about_ca_system_score_gemma":0.00048427633,"threshold_uncertainty_score":0.018731415},"labels":[],"label_agreement":null},{"id":"W3212043211","doi":"10.1007/978-3-030-91431-8_10","title":"Formalising Solutions to REST API Practices as Design (Anti)Patterns","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"","keywords":"Rest (music); Computer science; Architectural style; Best practice; Software versioning; World Wide Web; Software engineering; Simple (philosophy); Programming language; Architecture; Software","score_opus":0.041608713184663956,"score_gpt":0.28421980796153223,"score_spread":0.24261109477686826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212043211","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.0090227695,0.00016054588,0.9831286,0.0008744129,0.000087631495,0.00018484693,0.000081763064,0.001420221,0.0050391313],"genre_scores_gemma":[0.15200402,0.00036189446,0.83931696,0.00043185562,0.000068986745,0.00046891434,0.0005070311,0.00076490804,0.0060753045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98901075,0.0040816227,0.0017026535,0.0014506499,0.0026670902,0.0010871432],"domain_scores_gemma":[0.98366976,0.0071081235,0.0016380177,0.0050393282,0.0022024834,0.00034226375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009876404,0.0014585208,0.00073482736,0.0018206597,0.0013776422,0.0068128337,0.0029625809,0.0029019353,0.004357102],"category_scores_gemma":[0.022712095,0.0023586473,0.0023668648,0.0017172849,0.0046363655,0.009049096,0.006489047,0.0051060645,0.0014618294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010904546,0.00017655101,0.0021155523,0.0005785695,0.000076929755,0.00040758293,0.0034623542,0.020044032,0.007819487,0.8374398,0.0036035697,0.1241665],"study_design_scores_gemma":[0.00012291978,0.00012596753,0.0005144653,0.000619803,0.00016831867,0.000492602,0.0016318798,0.15536238,0.020354442,0.7369925,0.08353239,0.0000823689],"about_ca_topic_score_codex":0.003954641,"about_ca_topic_score_gemma":0.0066348147,"teacher_disagreement_score":0.009876404,"about_ca_system_score_codex":0.0020331028,"about_ca_system_score_gemma":0.0046036225,"threshold_uncertainty_score":0.052232027},"labels":[],"label_agreement":null},{"id":"W3212376312","doi":"10.1007/978-3-030-90963-5_1","title":"Towards Effective Odor Diffusion with Fuzzy Logic in an Olfactory Interface for a Serious Game","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Olfactory and Sensory Function Studies","field":"Neuroscience","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":"Ontario Tech University; Algoma University","funders":"","keywords":"Odor; Computer science; Fuzzy logic; Olfactory system; Interface (matter); Olfaction; Human–computer interaction; Artificial intelligence; Neuroscience; Operating system; Psychology","score_opus":0.07579175776926722,"score_gpt":0.28103206969755645,"score_spread":0.20524031192828923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212376312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035366416,0.00016087458,0.9571914,0.00010983496,0.000051165807,0.000065154796,0.000016263552,0.0005855538,0.006453301],"genre_scores_gemma":[0.5178857,0.00022424788,0.46536845,0.00011495186,0.000020510206,0.000071642564,0.00004168922,0.00008807446,0.016184766],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987435,0.000018252491,0.0000064326478,0.000028923585,0.000053461605,0.000018510882],"domain_scores_gemma":[0.9998894,0.00005194158,0.000006348579,0.000009455342,0.000027104208,0.00001584325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028611362,0.00051437184,0.00039164117,0.00016745622,0.00040026772,0.00085581664,0.0010847657,0.0007688162,0.0042614467],"category_scores_gemma":[0.0005153089,0.00020927501,0.0004096727,0.00012456591,0.0003274307,0.00083018147,0.0008965138,0.0007514538,0.00045351565],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006281674,0.00046697067,0.0006106894,0.00031952353,0.000065303844,0.00038113544,0.0005272083,0.09639312,0.4527847,0.07085689,0.002678566,0.37428784],"study_design_scores_gemma":[0.000033225817,0.00021536356,0.00021327467,0.000020863354,0.000027376538,0.00015113506,0.00005710736,0.94254404,0.03989452,0.012099682,0.0047246763,0.000018667537],"about_ca_topic_score_codex":0.0017908248,"about_ca_topic_score_gemma":0.0019373326,"teacher_disagreement_score":0.0042614467,"about_ca_system_score_codex":0.00036602907,"about_ca_system_score_gemma":0.00034286434,"threshold_uncertainty_score":0.014255941},"labels":[],"label_agreement":null},{"id":"W3212683876","doi":"10.1007/978-3-030-92548-2_8","title":"GMMT: A Revocable Group Merkle Multi-tree Signature Scheme","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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","funders":"","keywords":"Merkle tree; Group signature; Computer science; Scheme (mathematics); Tree (set theory); Group (periodic table); Computer security; Ring signature; Computer network; Digital signature; Mathematics; Cryptography; Hash function; Public-key cryptography; Combinatorics; Cryptographic hash function; Physics; Encryption","score_opus":0.01833215298826052,"score_gpt":0.26309401199586174,"score_spread":0.24476185900760122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212683876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14759064,0.0033592796,0.7832184,0.003299262,0.0014118911,0.0007553205,0.003706028,0.022220759,0.03443841],"genre_scores_gemma":[0.8155014,0.00089910225,0.14949854,0.00085542694,0.00024636553,0.00031347698,0.0018558296,0.00076105807,0.030068845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985122,0.00025618917,0.00011422216,0.00026102638,0.00061628077,0.00024003047],"domain_scores_gemma":[0.99852705,0.00015425788,0.00016763725,0.0007779588,0.00020539344,0.0001676123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090914994,0.00050955295,0.00095385296,0.0006138761,0.00076304324,0.0017266012,0.0010537428,0.001258315,0.005289943],"category_scores_gemma":[0.0021084002,0.00031243227,0.00042819174,0.0008958452,0.00095688726,0.0033388217,0.0038659554,0.0021868765,0.003222216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003253685,0.00027827485,0.0011832356,0.0009929963,0.00012554487,0.0009562338,0.0007843532,0.014830855,0.15390971,0.3669072,0.045488577,0.41128933],"study_design_scores_gemma":[0.0010024288,0.0013501516,0.0017628376,0.00024634312,0.0001856416,0.0040457947,0.00031125487,0.09009999,0.20446092,0.37780076,0.31833816,0.00039577452],"about_ca_topic_score_codex":0.00025664258,"about_ca_topic_score_gemma":0.00025008016,"teacher_disagreement_score":0.005289943,"about_ca_system_score_codex":0.0009702519,"about_ca_system_score_gemma":0.0013348496,"threshold_uncertainty_score":0.017696619},"labels":[],"label_agreement":null},{"id":"W3213275511","doi":"10.1007/978-3-030-90456-2_5","title":"Amortizing Rate-1 OT and Applications to PIR and PSI","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Security parameter; Communication source; Homomorphic encryption; Algorithm; Group (periodic table); Theoretical computer science; Encryption; Discrete mathematics; Cryptography; Mathematics; Computer network","score_opus":0.016506355082970568,"score_gpt":0.252182351647094,"score_spread":0.23567599656412344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213275511","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.010817437,0.0024015661,0.9320423,0.0012006457,0.00090382894,0.00019492234,0.00021894732,0.0017225416,0.05049777],"genre_scores_gemma":[0.41421646,0.0044091768,0.50268596,0.0010700789,0.0031819288,0.0006409318,0.0005303786,0.0016962308,0.071568854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949427,0.00140602,0.00026249693,0.00064425106,0.0020148999,0.000729643],"domain_scores_gemma":[0.9875093,0.006260069,0.00076511444,0.0038814924,0.0012552005,0.0003287835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053134975,0.0024111588,0.002602455,0.0027188978,0.002468994,0.0044783545,0.004000263,0.0027890918,0.0127916625],"category_scores_gemma":[0.022003813,0.00076900196,0.0023166232,0.004776666,0.0050543603,0.0063146516,0.0077741817,0.005839127,0.004125596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002199095,0.00014650974,0.0003557009,0.00015458968,0.000039109174,0.00013367819,0.00017816781,0.054381587,0.0028381662,0.7967141,0.012340548,0.13249792],"study_design_scores_gemma":[0.000022805752,0.00008873483,0.00015862413,0.00007209042,0.000048098023,0.00038230894,0.000063965555,0.32548305,0.0030034527,0.6609116,0.009708018,0.000057285008],"about_ca_topic_score_codex":0.0016828057,"about_ca_topic_score_gemma":0.0020142684,"teacher_disagreement_score":0.0127916625,"about_ca_system_score_codex":0.0037613874,"about_ca_system_score_gemma":0.0029480278,"threshold_uncertainty_score":0.04279238},"labels":[],"label_agreement":null},{"id":"W3213445389","doi":"10.1007/978-3-030-90874-4_16","title":"Data Imputation and Reconstruction of Distributed Parkinson’s Disease Clinical Assessments: A Comparative Evaluation of Two Aggregation Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Imputation (statistics); Algorithm; Data mining; Artificial intelligence; Missing data; Machine learning","score_opus":0.11968388576448762,"score_gpt":0.4176756314055621,"score_spread":0.29799174564107445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213445389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109436005,0.0021069727,0.88236415,0.00088174234,0.00022961809,0.00024672705,0.0006073517,0.0024522198,0.0016752306],"genre_scores_gemma":[0.3379009,0.0012247862,0.6567433,0.00023187496,0.00013260933,0.000217574,0.0015334609,0.00036482932,0.0016505823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937556,0.0045521595,0.00035576106,0.00054733385,0.0006008019,0.00018833953],"domain_scores_gemma":[0.92351323,0.06723949,0.0015018996,0.0040196767,0.0031617477,0.0005639492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021762911,0.0010363646,0.002098103,0.0015726389,0.000662299,0.0027428637,0.0027920217,0.001976392,0.002614603],"category_scores_gemma":[0.041291825,0.00075575156,0.0014514807,0.0025471565,0.0007884658,0.0023937821,0.0023539371,0.0017391797,0.0007353373],"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.0077215414,0.00072916166,0.020670844,0.0005210758,0.001247043,0.0001754382,0.000996597,0.23050594,0.0014529165,0.009066208,0.0057555335,0.7211577],"study_design_scores_gemma":[0.000303622,0.00031165412,0.0042347466,0.00008163221,0.00020153188,0.0001679961,0.00025157587,0.98365706,0.0010316597,0.008618393,0.0011062237,0.000033920078],"about_ca_topic_score_codex":0.008209946,"about_ca_topic_score_gemma":0.005932323,"teacher_disagreement_score":0.021762911,"about_ca_system_score_codex":0.00087923504,"about_ca_system_score_gemma":0.0022697006,"threshold_uncertainty_score":0.1150946},"labels":[],"label_agreement":null},{"id":"W3213910993","doi":"10.1007/978-3-642-35139-6","title":"Brain Informatics","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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 Regina","funders":"","keywords":"Computer science; Informatics; Artificial intelligence; Electrical engineering","score_opus":0.023476823379018227,"score_gpt":0.2690826107697093,"score_spread":0.24560578739069105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213910993","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010729588,0.015271272,0.061107926,0.0025731234,0.0027229462,0.00007666178,0.00056150625,0.0021460494,0.91446763],"genre_scores_gemma":[0.008236475,0.010221417,0.013798374,0.0007081043,0.00094359764,0.00008781396,0.0008040077,0.00042669248,0.9647736],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998535,0.000014351996,0.0000061380174,0.000032672917,0.00008044289,0.0000129060045],"domain_scores_gemma":[0.9998485,0.000031739844,0.000005716853,0.000039538976,0.000050637187,0.000023819794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020805086,0.00087955344,0.0004913023,0.0012133955,0.0005333137,0.0023044595,0.00070742116,0.0006467371,0.12969585],"category_scores_gemma":[0.0005631767,0.0002716579,0.00029758541,0.0012823518,0.00053757965,0.0020940576,0.0013457381,0.0013344898,0.0848853],"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.000020266712,0.000029826953,0.00007589736,0.00026512466,0.000008423547,0.000058856134,0.00012605081,0.0005140372,0.0027012003,0.09729294,0.32664055,0.57226676],"study_design_scores_gemma":[0.0000034159784,0.000012371836,0.00019684115,0.00007562193,0.000004933257,0.00017630597,0.000040346775,0.00064101355,0.0011308128,0.043948844,0.95376366,0.000005816818],"about_ca_topic_score_codex":0.00043838623,"about_ca_topic_score_gemma":0.00088841125,"teacher_disagreement_score":0.12969585,"about_ca_system_score_codex":0.0005081311,"about_ca_system_score_gemma":0.0006290972,"threshold_uncertainty_score":0.43387586},"labels":[],"label_agreement":null},{"id":"W3214090100","doi":"10.1007/978-3-030-96731-4_11","title":"The Polygon Burning Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Voronoi diagram; Geodesic; Combinatorics; Polygon (computer graphics); Vertex (graph theory); Regular polygon; Polygon covering; Approximation algorithm; Monotone polygon; Simple polygon; Mathematics; Computer science; Algorithm; Discrete mathematics; Geometry; Graph","score_opus":0.013597865343706703,"score_gpt":0.23599516161983927,"score_spread":0.22239729627613258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214090100","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04175573,0.007706306,0.42205867,0.0049211397,0.0015489619,0.00013939633,0.0007925248,0.00037136988,0.5207058],"genre_scores_gemma":[0.42391714,0.010213839,0.23778659,0.0015469884,0.0016393897,0.00040731428,0.003236741,0.0010794263,0.32017252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950504,0.000108766755,0.000022130353,0.00014054177,0.00015991612,0.00006356251],"domain_scores_gemma":[0.99947745,0.00026543855,0.000045269615,0.000110607885,0.000054192416,0.000047008707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351104,0.0007471983,0.0010621495,0.0006973705,0.0012775316,0.0025495416,0.0017251348,0.0018143834,0.028774325],"category_scores_gemma":[0.0031346763,0.0007087958,0.0009341999,0.0013662258,0.0017801676,0.004098989,0.0028630255,0.004011859,0.0040322463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008755395,0.0000442907,0.00014495161,0.00019405845,0.000021916288,0.00011220278,0.00012321866,0.013805581,0.0010006931,0.8743465,0.026792698,0.08332637],"study_design_scores_gemma":[0.000018902874,0.000013864237,0.00010888824,0.000054343822,0.000010498403,0.00017055166,0.00009117861,0.027443008,0.00074240426,0.9338281,0.03750862,0.000009593279],"about_ca_topic_score_codex":0.00081220135,"about_ca_topic_score_gemma":0.0006977049,"teacher_disagreement_score":0.028774325,"about_ca_system_score_codex":0.0007317725,"about_ca_system_score_gemma":0.0005833185,"threshold_uncertainty_score":0.09625971},"labels":[],"label_agreement":null},{"id":"W3215370305","doi":"10.1007/978-3-030-90966-6_10","title":"User Perceptions of Security and Privacy Risks with Contact Tracing Apps","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 Digital Contact Tracing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Contact tracing; Internet privacy; Confidentiality; Pandemic; Coronavirus disease 2019 (COVID-19); Tracing; Government (linguistics); Computer security; Computer science; Perception; Work (physics); Psychology; Engineering; Medicine","score_opus":0.024395378385651565,"score_gpt":0.2750882347009145,"score_spread":0.2506928563152629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215370305","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.9843976,0.00026260086,0.0009858335,0.00043726948,0.000019049156,0.00003176448,0.00003361018,0.000021654738,0.013810712],"genre_scores_gemma":[0.9968996,0.00013208433,0.00044554367,0.00008663509,0.000009608574,0.000014223865,0.000021929862,0.0000074242794,0.002382873],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9962057,0.0017761418,0.00023755529,0.0001650223,0.0013375063,0.00027807427],"domain_scores_gemma":[0.96912026,0.022063315,0.0038462454,0.00090785156,0.0027482791,0.0013140222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003852162,0.00029088627,0.00018707772,0.0007509506,0.0012253346,0.0042433175,0.00031844978,0.0009327378,0.0070316773],"category_scores_gemma":[0.029432487,0.00028046756,0.00043470217,0.0004319526,0.0008464919,0.0027534424,0.0015285814,0.0011136481,0.00075748924],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001996869,0.0016930852,0.54629546,0.0005739728,0.00014761189,0.0019600845,0.28856108,0.00091988564,0.009068366,0.009681863,0.00424099,0.13486086],"study_design_scores_gemma":[0.00008008193,0.0032192005,0.57561946,0.00078941154,0.00039432294,0.0047244737,0.36779016,0.007205539,0.0055878907,0.0046163406,0.029661115,0.00031197158],"about_ca_topic_score_codex":0.00253856,"about_ca_topic_score_gemma":0.002371322,"teacher_disagreement_score":0.0070316773,"about_ca_system_score_codex":0.00058751105,"about_ca_system_score_gemma":0.00057855446,"threshold_uncertainty_score":0.02352333},"labels":[],"label_agreement":null},{"id":"W3215715196","doi":"10.1007/978-3-030-96731-4_33","title":"On Approximating Shortest Paths in Weighted Triangular Tessellations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Universidad de Alcalá","keywords":"Combinatorics; Tessellation (computer graphics); Shortest path problem; Vertex (graph theory); Hexagonal tiling; Mathematics; Path (computing); Space (punctuation); Geometry; Grid; Computer science; Graph","score_opus":0.01708299613129252,"score_gpt":0.24380700712824172,"score_spread":0.2267240109969492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215715196","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.04265261,0.00066170795,0.9476447,0.00015952848,0.00011235413,0.00010089625,0.00027534048,0.00050326745,0.007889586],"genre_scores_gemma":[0.22522785,0.0013514858,0.7594041,0.00015874108,0.00009172136,0.00024131806,0.0011107429,0.00074140966,0.011672546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993106,0.000206481,0.00003773522,0.00010334595,0.0002678561,0.00007398766],"domain_scores_gemma":[0.99674404,0.002414721,0.00015417654,0.0002457628,0.0003124165,0.000128867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645472,0.0016148614,0.00175236,0.0017916613,0.0006202393,0.0016587442,0.0025644896,0.0013326153,0.0065367254],"category_scores_gemma":[0.008307391,0.0010402928,0.0010052703,0.0032552052,0.0010891027,0.0027370488,0.002985635,0.0020888646,0.00094851106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021519403,0.00009865643,0.0009497455,0.00031132787,0.000055242792,0.000083275896,0.00027521412,0.76992077,0.0037320515,0.0671472,0.005781855,0.15142947],"study_design_scores_gemma":[0.000010448093,0.000033658962,0.000098651166,0.000024038394,0.00000961208,0.000035206736,0.000063595464,0.965967,0.0006527954,0.03123077,0.0018672659,0.0000069578796],"about_ca_topic_score_codex":0.009208396,"about_ca_topic_score_gemma":0.0112973815,"teacher_disagreement_score":0.009208396,"about_ca_system_score_codex":0.0015055377,"about_ca_system_score_gemma":0.0006363765,"threshold_uncertainty_score":0.021867514},"labels":[],"label_agreement":null},{"id":"W3215797190","doi":"10.1007/978-3-540-39903-2_28","title":"Hand-Held Steerable Needle Device","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer vision; Computer graphics (images); Artificial intelligence","score_opus":0.01580175250428423,"score_gpt":0.22138009230373404,"score_spread":0.2055783397994498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215797190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04194235,0.0025370563,0.89958733,0.00027530492,0.00040918586,0.00018095445,0.00032777447,0.0041057216,0.050634366],"genre_scores_gemma":[0.41953313,0.0029170043,0.4269366,0.00054206594,0.00018365149,0.00019957502,0.0006818998,0.00025589002,0.14875026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973613,0.000018094861,0.000007970129,0.000057469053,0.00015644563,0.000023784725],"domain_scores_gemma":[0.99983025,0.000039931707,0.000016679287,0.00004090873,0.000045770317,0.000026386655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019803515,0.0005279394,0.00052471913,0.0004178982,0.0003581439,0.00050298043,0.0009802711,0.0010618697,0.009672455],"category_scores_gemma":[0.00028117036,0.0003016827,0.00033685035,0.00032291672,0.00030871105,0.00084651,0.0007454033,0.0005567131,0.0042630676],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025346334,0.0000945653,0.00045966893,0.00033240073,0.000043252563,0.0005983595,0.0002107842,0.005002116,0.47442603,0.01150404,0.010106535,0.4969688],"study_design_scores_gemma":[0.00016694413,0.0024443239,0.007641423,0.00031429995,0.00017905846,0.014180893,0.0002489701,0.13494106,0.4964831,0.0075839027,0.33554798,0.0002680414],"about_ca_topic_score_codex":0.0007115853,"about_ca_topic_score_gemma":0.0011721529,"teacher_disagreement_score":0.009672455,"about_ca_system_score_codex":0.00022266271,"about_ca_system_score_gemma":0.0004369046,"threshold_uncertainty_score":0.032357633},"labels":[],"label_agreement":null},{"id":"W3215889892","doi":"10.1007/978-3-030-91608-4_56","title":"Multimodal Semi-supervised Bipolar Disorder Classification","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mania; Classifier (UML); Bipolar disorder; Annotation; Artificial intelligence; Recall; Machine learning; Pattern recognition (psychology); Psychiatry; Cognitive psychology; Psychology; Cognition","score_opus":0.035141876839191004,"score_gpt":0.2930483051960947,"score_spread":0.2579064283569037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215889892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1043403,0.008375826,0.84588265,0.0011844578,0.00091746886,0.0003754893,0.0097807,0.007554369,0.021588726],"genre_scores_gemma":[0.6847571,0.002457855,0.250009,0.00067964947,0.00081583293,0.00052813767,0.026627759,0.0004980333,0.033626694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997464,0.00008024855,0.000019853253,0.00006454324,0.000043865435,0.00004507043],"domain_scores_gemma":[0.9996898,0.0001267487,0.00002531239,0.000048593785,0.00008844925,0.000021188298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020743,0.0006473088,0.000614979,0.0005551383,0.00021557439,0.00058584363,0.0006397305,0.00045061854,0.0047894972],"category_scores_gemma":[0.00085954,0.00017644778,0.00069692306,0.00048761678,0.00012865663,0.00031735143,0.00078075426,0.0004888533,0.0033372387],"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.00038146722,0.0001391021,0.0043943156,0.0001800237,0.00013917389,0.00012691,0.00005469915,0.009447408,0.014739097,0.0008968385,0.04342072,0.9260802],"study_design_scores_gemma":[0.000054648204,0.000276512,0.019472517,0.00020595125,0.00021844737,0.0010524094,0.00024421982,0.9207497,0.02110893,0.00953169,0.027030699,0.00005430433],"about_ca_topic_score_codex":0.0014736482,"about_ca_topic_score_gemma":0.004223646,"teacher_disagreement_score":0.0047894972,"about_ca_system_score_codex":0.00017673588,"about_ca_system_score_gemma":0.00035337458,"threshold_uncertainty_score":0.016022503},"labels":[],"label_agreement":null},{"id":"W3216623747","doi":"10.1007/978-3-030-91608-4_9","title":"Fast and Optimal Planner for the Discrete Grid-Based Coverage Path-Planning Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Grid; Mathematical optimization; Heuristic; Path (computing); Planner; Motion planning; Algorithm; Branch and bound; Mathematics; Artificial intelligence; Robot","score_opus":0.01851515627556675,"score_gpt":0.25225026786352184,"score_spread":0.2337351115879551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216623747","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.005721408,0.00023532317,0.9895376,0.00009904966,0.00003264169,0.00004392654,0.00015305966,0.00046316537,0.0037138155],"genre_scores_gemma":[0.23438603,0.00066581264,0.75793064,0.000056228382,0.00003910745,0.00026699717,0.00063684094,0.00022714562,0.005791294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.000046525784,0.000008456483,0.000047449535,0.00009515005,0.000028251978],"domain_scores_gemma":[0.9996649,0.00022635792,0.00002126011,0.000031812557,0.000033904293,0.00002180055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003379728,0.000612168,0.00079852866,0.0005721107,0.00039373734,0.0005906769,0.00087033137,0.0006029742,0.003944043],"category_scores_gemma":[0.0012167994,0.0004896118,0.0004960759,0.0010947848,0.0005881175,0.0008415567,0.0010632914,0.0012522008,0.00042835195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007852095,0.000033565495,0.00014524464,0.00013939152,0.00001691798,0.00003979821,0.000043433993,0.8560566,0.0016473607,0.030781265,0.0053519225,0.10566606],"study_design_scores_gemma":[0.000016821323,0.000013787092,0.000053043103,0.000005361712,0.0000036548568,0.000016201146,0.000008462164,0.977526,0.0002948946,0.020434756,0.0016230949,0.0000037996817],"about_ca_topic_score_codex":0.008667369,"about_ca_topic_score_gemma":0.009198981,"teacher_disagreement_score":0.008667369,"about_ca_system_score_codex":0.00092188676,"about_ca_system_score_gemma":0.0013911433,"threshold_uncertainty_score":0.017233849},"labels":[],"label_agreement":null},{"id":"W3216702545","doi":"","title":"Modeling and Verifying Timed Compensable Workflows and an Application to Health Care","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Workflow; Computer science; Software engineering; Reliability (semiconductor); Model checking; Semantics (computer science); Petri net; Workflow management system; Programming language; Formal verification; Database","score_opus":0.026755003336224745,"score_gpt":0.26151239762980066,"score_spread":0.23475739429357592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216702545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077818106,0.000103586186,0.990476,0.00011869432,0.000031669013,0.00006764063,0.000053006843,0.0006409918,0.00072653394],"genre_scores_gemma":[0.30935866,0.00049095403,0.687512,0.000080789505,0.000056149216,0.0002113104,0.00022326043,0.00016999213,0.0018969554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746037,0.0009660393,0.00028494178,0.0004244701,0.00072637014,0.00013779779],"domain_scores_gemma":[0.9956363,0.0029496404,0.0004987221,0.00042265872,0.00040062878,0.000092093396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035211255,0.00091580005,0.00050312665,0.0009331582,0.0007437298,0.0015345197,0.0015616161,0.0014460488,0.00177929],"category_scores_gemma":[0.00941114,0.00064668723,0.0015574204,0.00088333286,0.0022613595,0.0017857169,0.001188228,0.0012797347,0.00022242908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013056997,0.00008409971,0.0012202502,0.00023415544,0.000044553046,0.0007428193,0.00043290557,0.7959312,0.009763947,0.15592614,0.00066686166,0.03482251],"study_design_scores_gemma":[0.000038782706,0.000060467228,0.00016301773,0.000040544044,0.000025522644,0.00014063275,0.000045227996,0.9384187,0.0043274728,0.052492734,0.0042295116,0.000017359029],"about_ca_topic_score_codex":0.012736767,"about_ca_topic_score_gemma":0.008176665,"teacher_disagreement_score":0.012736767,"about_ca_system_score_codex":0.0014579966,"about_ca_system_score_gemma":0.0024139464,"threshold_uncertainty_score":0.025325239},"labels":[],"label_agreement":null},{"id":"W3217194746","doi":"10.1007/978-3-030-91669-5_29","title":"Integrating Heterogeneous Data About Quebec Literature into an IFLA LRM Knowledge Base","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Interoperability; Schema (genetic algorithms); Knowledge base; Data integration; Data science; Base (topology); Linked data; World Wide Web; Information retrieval; Data mining; Semantic Web","score_opus":0.03207575581690115,"score_gpt":0.2899730177300848,"score_spread":0.2578972619131837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217194746","genre_codex":"dataset","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.12775117,0.008812579,0.11003772,0.0035381871,0.00033297692,0.0014660993,0.5295456,0.013279317,0.20523648],"genre_scores_gemma":[0.30708063,0.005165369,0.21565685,0.0006318005,0.00010975429,0.0005772792,0.43131965,0.00071582646,0.03874292],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992762,0.00008719199,0.000081006685,0.0001647061,0.00030795723,0.00008293934],"domain_scores_gemma":[0.9979157,0.00060316286,0.00013317798,0.0002477253,0.0009784382,0.00012174891],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007605369,0.00091411057,0.0006933127,0.030844422,0.002307506,0.0035939116,0.001832737,0.0008202318,0.018015316],"category_scores_gemma":[0.004530941,0.00041417396,0.0009875204,0.023581758,0.0007144531,0.0030136753,0.0014847437,0.0007630356,0.0042320495],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043276837,0.00030416672,0.04950322,0.0023638078,0.0005324914,0.0027286632,0.0032655096,0.018275771,0.009385776,0.032882906,0.24016674,0.6401582],"study_design_scores_gemma":[0.000053623993,0.000056027664,0.045812182,0.0014712295,0.00076749595,0.000687665,0.0034732842,0.04619665,0.00941086,0.009396247,0.88251233,0.00016229808],"about_ca_topic_score_codex":0.8156996,"about_ca_topic_score_gemma":0.9205854,"teacher_disagreement_score":0.9964061,"about_ca_system_score_codex":0.009346994,"about_ca_system_score_gemma":0.010987985,"threshold_uncertainty_score":0.3707716},"labels":[],"label_agreement":null},{"id":"W3217283631","doi":"10.1007/978-3-030-91431-8_50","title":"Sprelog: Log-Based Anomaly Detection with Self-matching Networks and Pre-trained Models","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"York University","funders":"","keywords":"Computer science; Word (group theory); Discriminative model; Pooling; Artificial intelligence; Anomaly detection; Matching (statistics); Sequence (biology); Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.007761047392614001,"score_gpt":0.20699081936952268,"score_spread":0.1992297719769087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217283631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063664597,0.00023475659,0.9505382,0.00010350042,0.00017522046,0.000085573105,0.0006586697,0.040613797,0.0012237616],"genre_scores_gemma":[0.15489766,0.00026569847,0.8230375,0.00022295456,0.00013607147,0.00022955809,0.0036723884,0.0027952997,0.014742829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.00009082383,0.000038653503,0.00027007933,0.00030779207,0.0000702051],"domain_scores_gemma":[0.9989889,0.0003773788,0.00006492941,0.00031283265,0.00021567951,0.000040307554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804126,0.0013067394,0.0013864731,0.0016180659,0.00045887835,0.0013678677,0.0032453062,0.001278285,0.006891256],"category_scores_gemma":[0.0035885451,0.00079099427,0.0008651731,0.0012128991,0.0004492735,0.0021531477,0.0016767852,0.0016746232,0.0048334706],"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.00041498343,0.00021153521,0.0015453792,0.00011091724,0.00016546887,0.00014750098,0.000055020406,0.082183115,0.008771738,0.0035008604,0.02765602,0.8752374],"study_design_scores_gemma":[0.000014164682,0.000031508098,0.00032644518,0.0000070562673,0.000013558004,0.0000753751,0.000008650121,0.98434895,0.0065065986,0.005541434,0.0031135627,0.000012638847],"about_ca_topic_score_codex":0.0067452677,"about_ca_topic_score_gemma":0.007822511,"teacher_disagreement_score":0.006891256,"about_ca_system_score_codex":0.00070404826,"about_ca_system_score_gemma":0.0007453656,"threshold_uncertainty_score":0.023053527},"labels":[],"label_agreement":null},{"id":"W3217288127","doi":"10.1007/978-3-030-92652-6_8","title":"Cranial Implant Prediction by Learning an Ensemble of Slice-Based Skull Completion Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Overfitting; Skull; Ensemble learning; Artificial intelligence; Slicing; Machine learning; Artificial neural network; Surgery; Computer graphics (images)","score_opus":0.008559510515706541,"score_gpt":0.20921480758652405,"score_spread":0.2006552970708175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217288127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095289335,0.0018199204,0.89660656,0.00034669123,0.00026479142,0.00006869224,0.00072531885,0.0026820286,0.0021966817],"genre_scores_gemma":[0.7496891,0.001350803,0.2361374,0.00021640648,0.00027551333,0.000108398606,0.0029407279,0.00028190512,0.008999709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999777,0.000034966175,0.000010450532,0.000081453545,0.000050246726,0.00004576055],"domain_scores_gemma":[0.9993938,0.00021672508,0.000053027103,0.00006743649,0.00022267386,0.000046370216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000796843,0.0013466829,0.0010935784,0.0010100146,0.00029123924,0.0007107032,0.0016128278,0.0011610483,0.0015272428],"category_scores_gemma":[0.0014356395,0.000647377,0.0013455267,0.00085077196,0.00032941546,0.00091610156,0.00088125176,0.0015068925,0.0011200822],"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.00036139152,0.00016088979,0.0054210355,0.00006143688,0.00023198,0.00016794969,0.00004664862,0.4616241,0.008011481,0.0012964508,0.007961372,0.51465523],"study_design_scores_gemma":[0.0000029654489,0.000023124616,0.00037939253,0.0000064572514,0.000022100032,0.000036589976,0.0000053906374,0.9974371,0.0011643934,0.00067672704,0.00024060327,0.000005132522],"about_ca_topic_score_codex":0.011008425,"about_ca_topic_score_gemma":0.01658231,"teacher_disagreement_score":0.011008425,"about_ca_system_score_codex":0.00045921857,"about_ca_system_score_gemma":0.0008970577,"threshold_uncertainty_score":0.021888673},"labels":[],"label_agreement":null},{"id":"W3217492267","doi":"10.1007/978-3-030-99739-7_18","title":"Less is Less: When are Snippets Insufficient for Human vs Machine Relevance Estimation?","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Microsoft (Canada)","funders":"","keywords":"Snippet; Computer science; Information retrieval; Relevance (law); Ranking (information retrieval); Search engine; Document retrieval; Query expansion; Language model; Range (aeronautics); Artificial intelligence; Natural language processing","score_opus":0.03607754583885837,"score_gpt":0.27603009777235954,"score_spread":0.23995255193350118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217492267","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.711716,0.02762343,0.16470729,0.020850407,0.003379047,0.0006108157,0.0076444284,0.010892748,0.052575774],"genre_scores_gemma":[0.92917657,0.0027186568,0.04800677,0.0024639,0.0019665721,0.00015865959,0.005981333,0.002254799,0.007272759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99301094,0.0025632514,0.0006555503,0.0012136868,0.0021745323,0.00038193958],"domain_scores_gemma":[0.9400612,0.044486895,0.0027107084,0.0038865302,0.0077074417,0.0011472204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008126549,0.000887038,0.0013831222,0.0036997474,0.0012741758,0.0037257862,0.0011933686,0.0027148318,0.0076085445],"category_scores_gemma":[0.09465191,0.0005829975,0.00069648813,0.0022247338,0.0014196599,0.014073257,0.0015270459,0.0023028618,0.006082228],"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.0038934483,0.00054946356,0.08007272,0.0016573101,0.000391297,0.0007938748,0.0016074156,0.00277812,0.019923933,0.0072360346,0.08092405,0.8001724],"study_design_scores_gemma":[0.0005257249,0.0027852282,0.28032798,0.003185168,0.00258751,0.008564576,0.014012949,0.20057954,0.065328516,0.21441633,0.2069804,0.00070617156],"about_ca_topic_score_codex":0.0032094258,"about_ca_topic_score_gemma":0.005802188,"teacher_disagreement_score":0.008126549,"about_ca_system_score_codex":0.00068660383,"about_ca_system_score_gemma":0.0013065203,"threshold_uncertainty_score":0.04297775},"labels":[],"label_agreement":null},{"id":"W3217601300","doi":"10.1007/978-3-030-91825-5_24","title":"A Short Note on the System-Length Distribution in a Finite-Buffer $$GI^X/C$$-MSP/1/N Queue Using Roots","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Computer science; Queue; Markov chain; Queueing theory; Markov process; Stationary distribution; Buffer (optical fiber); Distribution (mathematics); Queueing system; Exponential distribution; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Computer network; Statistics; Mathematical analysis; Telecommunications","score_opus":0.020293249713014192,"score_gpt":0.24510655534773584,"score_spread":0.22481330563472166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217601300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006434006,0.0071490863,0.95075995,0.001807224,0.003139601,0.00005446233,0.00024027021,0.0009962085,0.02941924],"genre_scores_gemma":[0.39816386,0.019552981,0.43874565,0.0024834368,0.008625874,0.00024798667,0.0005758219,0.0029775305,0.12862694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941444,0.00012187375,0.000029334986,0.00015199854,0.00023400641,0.000048441794],"domain_scores_gemma":[0.9984376,0.0011463205,0.00006156999,0.000111728004,0.00017668644,0.000066219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016311846,0.0013542778,0.0011848345,0.0009799574,0.00094399153,0.0018903915,0.0024334013,0.0010999878,0.00831057],"category_scores_gemma":[0.005789867,0.0007251605,0.0009799266,0.0019078074,0.0019676164,0.0044438043,0.0014174281,0.004037341,0.0021596116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007910337,0.000046780206,0.0002726773,0.00022649438,0.000027971377,0.00037203252,0.00025574237,0.030813308,0.0047891308,0.90261394,0.02119238,0.03931032],"study_design_scores_gemma":[0.0000156525,0.000052912856,0.00046100368,0.00007193122,0.00002418423,0.00036932016,0.000052560554,0.24994494,0.0017641624,0.71088874,0.036294118,0.00006051431],"about_ca_topic_score_codex":0.0031059077,"about_ca_topic_score_gemma":0.002640157,"teacher_disagreement_score":0.00831057,"about_ca_system_score_codex":0.0022291914,"about_ca_system_score_gemma":0.0010314648,"threshold_uncertainty_score":0.027801573},"labels":[],"label_agreement":null},{"id":"W3217650841","doi":"10.1007/978-3-031-17143-7_19","title":"Real-Time Adversarial Perturbations Against Deep Reinforcement Learning Policies: Attacks and Defenses","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adversarial system; Computer science; Reinforcement learning; Artificial intelligence; Computer security","score_opus":0.012097065327787046,"score_gpt":0.24990895340961897,"score_spread":0.23781188808183193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217650841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033603493,0.0019739151,0.94732004,0.0014239012,0.00035285574,0.000087222266,0.00006872464,0.0010951539,0.014074625],"genre_scores_gemma":[0.92746955,0.0013883776,0.060893953,0.00045936712,0.00020636017,0.00010924071,0.00008875432,0.00013431994,0.009250124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988096,0.00038670137,0.00004125381,0.00018040142,0.00040365037,0.00017852886],"domain_scores_gemma":[0.9962374,0.0025198446,0.00029207135,0.00057547615,0.0002551513,0.00012014187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018827209,0.0011314399,0.0008429194,0.00042927905,0.00040445873,0.001040098,0.0010227058,0.0017668919,0.0019057301],"category_scores_gemma":[0.0076636802,0.00042437657,0.00057169946,0.00046265955,0.0016238751,0.001797812,0.0025183258,0.0036316726,0.000520824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003781078,0.000104044026,0.00047908796,0.00010346478,0.00008549724,0.00011086916,0.000072743336,0.7299228,0.011271191,0.13174689,0.0062617366,0.11946362],"study_design_scores_gemma":[0.0000079451065,0.00006021032,0.000103244,0.00001468714,0.0000066763955,0.000059907154,0.000010454766,0.9571596,0.0023469895,0.03923658,0.0009854641,0.000008298448],"about_ca_topic_score_codex":0.00062045926,"about_ca_topic_score_gemma":0.00043406224,"teacher_disagreement_score":0.0019057301,"about_ca_system_score_codex":0.000945474,"about_ca_system_score_gemma":0.00065730244,"threshold_uncertainty_score":0.009956896},"labels":[],"label_agreement":null},{"id":"W322462744","doi":"10.1007/11535706_12","title":"Privacy-Preserving Collaborative Association Rule Mining","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Association rule learning; Computer science; Data mining; Data science","score_opus":0.011467744624427624,"score_gpt":0.2665805409993017,"score_spread":0.25511279637487405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W322462744","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.018302921,0.0003419509,0.97853684,0.00047393434,0.00007941362,0.000096217955,0.000269195,0.00054042734,0.001358988],"genre_scores_gemma":[0.6374813,0.00045294134,0.35548767,0.00044201332,0.00033527875,0.00023682845,0.0014104063,0.00010791861,0.0040456634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.972765,0.01096866,0.0021823691,0.0040517165,0.008593925,0.001438256],"domain_scores_gemma":[0.9077415,0.033161253,0.0036705318,0.049465343,0.0048167706,0.0011446088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014209376,0.00100386,0.0034867497,0.0018928491,0.002460184,0.0042352923,0.0062745595,0.0029674398,0.0020955729],"category_scores_gemma":[0.06414599,0.0014837027,0.002534019,0.003987825,0.0019921314,0.007822159,0.0077734245,0.0033320957,0.0017389338],"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.0034570019,0.0012823396,0.014718301,0.0005757786,0.0010058266,0.0019456182,0.0012117131,0.15404922,0.01802854,0.10132346,0.015365167,0.68703705],"study_design_scores_gemma":[0.0002479607,0.000477826,0.0012019958,0.000050697596,0.0002954784,0.0031296173,0.00031114,0.7794987,0.024134135,0.18370926,0.006865036,0.00007813451],"about_ca_topic_score_codex":0.0007657165,"about_ca_topic_score_gemma":0.000998468,"teacher_disagreement_score":0.014209376,"about_ca_system_score_codex":0.0006148413,"about_ca_system_score_gemma":0.0029719549,"threshold_uncertainty_score":0.07514727},"labels":[],"label_agreement":null},{"id":"W324611277","doi":"10.1007/978-3-642-24425-4_67","title":"Parallel Computation in Finding Near Neighbourhoods","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Winnipeg","funders":"","keywords":"Computer science; Computation; Algorithm","score_opus":0.03420826927937105,"score_gpt":0.2734581298651053,"score_spread":0.23924986058573428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W324611277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03123164,0.0015748566,0.95310014,0.00036376645,0.00020900929,0.00006736548,0.00016514094,0.0010709162,0.012217261],"genre_scores_gemma":[0.3341499,0.001412795,0.6500817,0.0001552409,0.00024181625,0.00020472829,0.0006211338,0.00044123665,0.012691521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993794,0.00012324924,0.00004706959,0.00015705207,0.0002277586,0.00006539921],"domain_scores_gemma":[0.9987192,0.0006754373,0.000055308414,0.0003350323,0.00016219376,0.000052858766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078394136,0.00067380193,0.0015179558,0.0014569002,0.001190563,0.0017835696,0.001820229,0.0008732628,0.0060293917],"category_scores_gemma":[0.004179808,0.00056306215,0.00093846157,0.0031880583,0.0014763029,0.0033848963,0.0023857027,0.0011555408,0.001255115],"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.0005283091,0.00012921213,0.0013000388,0.0004885972,0.00012521938,0.00015886879,0.00033466626,0.3249322,0.0066484045,0.25538963,0.011088148,0.39887676],"study_design_scores_gemma":[0.000039746017,0.000029276453,0.00024171,0.000019234878,0.000033221393,0.000079044614,0.000057982634,0.7515415,0.0023097568,0.2404336,0.005203847,0.00001111795],"about_ca_topic_score_codex":0.0048317066,"about_ca_topic_score_gemma":0.0050997506,"teacher_disagreement_score":0.0060293917,"about_ca_system_score_codex":0.0010091354,"about_ca_system_score_gemma":0.00073498045,"threshold_uncertainty_score":0.020170331},"labels":[],"label_agreement":null},{"id":"W32539537","doi":"10.1007/978-3-642-31612-8_18","title":"Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":92,"is_retracted":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":"Solver; Exploit; Computer science; Portfolio; Set (abstract data type); Competition (biology); Algorithm; Theoretical computer science; Programming language","score_opus":0.023701134907869622,"score_gpt":0.3029840092867271,"score_spread":0.27928287437885746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32539537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21082751,0.0039295875,0.7370796,0.0013713816,0.0007500775,0.0004750024,0.00067281735,0.0047616716,0.04013233],"genre_scores_gemma":[0.6227394,0.0007898998,0.36680108,0.00022301383,0.00025376922,0.00025825147,0.0011391871,0.0012025412,0.0065928614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99127614,0.004272644,0.00037832363,0.0005923482,0.0029119677,0.00056851003],"domain_scores_gemma":[0.9551264,0.03504111,0.0010344068,0.002734638,0.005139799,0.0009237082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010499802,0.0019010729,0.0015783025,0.0024497514,0.0007250931,0.0035802159,0.0021184352,0.0022095565,0.010256954],"category_scores_gemma":[0.064404465,0.00086461357,0.0010465024,0.002329741,0.0009233451,0.00331736,0.002495791,0.0020196808,0.0013796305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024162196,0.00039161948,0.0056556314,0.0004359853,0.00028033313,0.00012651377,0.00012069218,0.59181136,0.0023162782,0.022481605,0.010214379,0.36374938],"study_design_scores_gemma":[0.00006146583,0.00011767055,0.00038860497,0.0000342087,0.000067935325,0.000023760618,0.000025380637,0.99022245,0.0015791762,0.0065457723,0.0009266011,0.000006992561],"about_ca_topic_score_codex":0.0022710478,"about_ca_topic_score_gemma":0.004838574,"teacher_disagreement_score":0.010499802,"about_ca_system_score_codex":0.0018195646,"about_ca_system_score_gemma":0.002639901,"threshold_uncertainty_score":0.05552894},"labels":[],"label_agreement":null},{"id":"W325712476","doi":"10.1007/978-3-319-16199-0_7","title":"Learning Action Primitives for Multi-level Video Event Understanding","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Simon Fraser University","funders":"","keywords":"Computer science; Action (physics); Discriminative model; Class (philosophy); Artificial intelligence; Set (abstract data type); Variation (astronomy); Action recognition; Event (particle physics); Cluster analysis; Pattern recognition (psychology); Machine learning; Programming language","score_opus":0.2305388851663455,"score_gpt":0.3451464742467226,"score_spread":0.11460758908037713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W325712476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012152039,0.0003147909,0.9823315,0.00007939518,0.0000340683,0.000068883026,0.00033535005,0.0038143632,0.00086957554],"genre_scores_gemma":[0.3352328,0.0009883721,0.65587765,0.00013956962,0.000058718175,0.00024309142,0.0027251572,0.0005269086,0.0042078365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962866,0.00003267,0.000023486096,0.0001955558,0.000063698724,0.000055825214],"domain_scores_gemma":[0.99952114,0.00022866785,0.00004976979,0.00010507476,0.000041875526,0.000053471984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049536664,0.001495703,0.0014818778,0.0010186427,0.00036573556,0.000904936,0.002192225,0.0014717558,0.006620628],"category_scores_gemma":[0.0012671612,0.0007624537,0.0017443408,0.0012951122,0.0005249613,0.001853488,0.001837053,0.0027600415,0.0021857521],"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.00031424116,0.00015682334,0.0008292174,0.00019829755,0.00007202025,0.00016880571,0.000093337054,0.08763391,0.034694504,0.0062588253,0.004059951,0.8655201],"study_design_scores_gemma":[0.000015119025,0.00007770552,0.00062520587,0.000021553242,0.00002081574,0.00007354801,0.000044000193,0.97344196,0.008095032,0.016162775,0.001410757,0.000011491642],"about_ca_topic_score_codex":0.0065664705,"about_ca_topic_score_gemma":0.008963939,"teacher_disagreement_score":0.006620628,"about_ca_system_score_codex":0.00074337766,"about_ca_system_score_gemma":0.000922112,"threshold_uncertainty_score":0.022148192},"labels":[],"label_agreement":null},{"id":"W32579068","doi":"10.1007/978-3-642-21593-3_21","title":"Infinite Generalized Gaussian Mixture Modeling and Applications","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Overfitting; Mixture model; Computer science; Bayesian probability; Gaussian; Artificial intelligence; Gaussian process; Pattern recognition (psychology); Face (sociological concept); Machine learning; Algorithm; Artificial neural network","score_opus":0.02856930667628637,"score_gpt":0.26323900702226843,"score_spread":0.23466970034598206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32579068","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.0011732752,0.021294339,0.9640332,0.00049907673,0.00024809196,0.000017367136,0.00009978745,0.00047106892,0.012163884],"genre_scores_gemma":[0.07969421,0.049350794,0.82595783,0.0006264644,0.0014368783,0.00032849173,0.0008991961,0.0006979005,0.04100829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912363,0.00033559944,0.000046487577,0.00014962816,0.00030415118,0.000040541385],"domain_scores_gemma":[0.9983582,0.0011511871,0.00005856028,0.00016528899,0.00022536052,0.00004134416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546912,0.0015735885,0.0028775423,0.0014702757,0.0005356937,0.00242462,0.0027543148,0.0031275693,0.008343855],"category_scores_gemma":[0.004767053,0.0012122812,0.0018967097,0.0034430348,0.0013032816,0.0026938065,0.002166193,0.0035371615,0.0043180324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042733995,0.000073455296,0.0004003545,0.0005845085,0.000105394494,0.00019216082,0.00028588506,0.09584018,0.0016899229,0.5747528,0.022070955,0.30396158],"study_design_scores_gemma":[0.0000107364995,0.000019086148,0.000288122,0.00013063966,0.000037372676,0.000375505,0.000041623618,0.35924217,0.0006008169,0.59211487,0.047088996,0.00005006958],"about_ca_topic_score_codex":0.002164529,"about_ca_topic_score_gemma":0.0017420688,"teacher_disagreement_score":0.008343855,"about_ca_system_score_codex":0.0009592098,"about_ca_system_score_gemma":0.00071199704,"threshold_uncertainty_score":0.027912915},"labels":[],"label_agreement":null},{"id":"W32588857","doi":"10.1007/978-3-642-37256-8_12","title":"Using Google n-Grams to Expand Word-Emotion Association Lexicon","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Dalhousie University","funders":"","keywords":"Lexicon; Trigram; Computer science; Natural language processing; Word (group theory); Artificial intelligence; Association (psychology); Word Association; n-gram; Feeling; Speech recognition; Linguistics; Language model; Psychology","score_opus":0.03738423959584312,"score_gpt":0.27995138154211324,"score_spread":0.24256714194627013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32588857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14053991,0.0037898305,0.6236742,0.00127215,0.0035269628,0.0011400658,0.07181809,0.08760723,0.06663167],"genre_scores_gemma":[0.30010468,0.0019371777,0.5745167,0.0005480518,0.00049570657,0.00081892696,0.09215634,0.004228087,0.025194326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949515,0.000067357585,0.00008243321,0.0001244079,0.00017544208,0.000055248227],"domain_scores_gemma":[0.999215,0.00021617544,0.000048435133,0.00008235732,0.00039246024,0.00004546698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043864458,0.0012874594,0.0006099354,0.0048034773,0.0007961983,0.0015098131,0.0004852666,0.0004531764,0.008735453],"category_scores_gemma":[0.002143541,0.0005388452,0.0009831927,0.0043679485,0.0002082783,0.0026632561,0.0015143688,0.0009861384,0.010378368],"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.00045978426,0.00018294869,0.0055721328,0.000992002,0.00017702612,0.00093858084,0.00092855503,0.0021576358,0.06386127,0.007267948,0.11925047,0.79821163],"study_design_scores_gemma":[0.00018965793,0.00034353885,0.026798561,0.000575883,0.000663433,0.0029318386,0.0019933945,0.23741789,0.07701383,0.05366336,0.59806836,0.00034022395],"about_ca_topic_score_codex":0.005973168,"about_ca_topic_score_gemma":0.016686676,"teacher_disagreement_score":0.008735453,"about_ca_system_score_codex":0.0005316652,"about_ca_system_score_gemma":0.0009777569,"threshold_uncertainty_score":0.029222965},"labels":[],"label_agreement":null},{"id":"W32592253","doi":"10.1007/3-540-45105-6_38","title":"PalmPrints: A Novel Co-evolutionary Algorithm for Clustering Finger Images","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Concordia University","funders":"","keywords":"Cluster analysis; Computer science; Fitness function; Artificial intelligence; Genetic algorithm; Correlation clustering; Pattern recognition (psychology); Evolutionary algorithm; Canopy clustering algorithm; Algorithm; Machine learning","score_opus":0.023760405071552946,"score_gpt":0.2710031404315853,"score_spread":0.24724273536003236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32592253","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.0072898194,0.00021927673,0.99059045,0.00005559342,0.000068241265,0.000039930135,0.00003292259,0.00088303233,0.00082064647],"genre_scores_gemma":[0.06713752,0.00019406404,0.92732614,0.000116177376,0.00005231947,0.000131595,0.00014319923,0.0002917517,0.0046072453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991278,0.0001333321,0.000041012132,0.00020170539,0.00042156567,0.00007471775],"domain_scores_gemma":[0.9991972,0.00025998492,0.000059562215,0.00013683816,0.00029303014,0.000053429936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134632,0.001017499,0.0016942855,0.0016065271,0.00079639856,0.0012467175,0.0026497836,0.0020601489,0.0035332127],"category_scores_gemma":[0.0022037013,0.0007328154,0.0009113216,0.0024323252,0.0006943396,0.0015305877,0.0016680689,0.0012708876,0.0014319296],"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.0001848273,0.0001399678,0.0012233752,0.00011310372,0.00018116133,0.00014033631,0.00013991843,0.16081348,0.024835823,0.0048684413,0.004867903,0.80249166],"study_design_scores_gemma":[0.000027671347,0.000055669538,0.0004189173,0.000010275854,0.000028827839,0.00018133222,0.000023368997,0.98695415,0.006628643,0.0023495771,0.0032977343,0.000023712479],"about_ca_topic_score_codex":0.003595095,"about_ca_topic_score_gemma":0.004984521,"teacher_disagreement_score":0.003595095,"about_ca_system_score_codex":0.000570612,"about_ca_system_score_gemma":0.00085320417,"threshold_uncertainty_score":0.01181978},"labels":[],"label_agreement":null},{"id":"W326289323","doi":"10.1007/978-3-642-02017-9_29","title":"Kolmogorov Complexity and Combinatorial Methods in Communication Complexity","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Kolmogorov complexity; Communication complexity; Kolmogorov structure function; Minimax; Mathematics; Upper and lower bounds; Worst-case complexity; Quantum complexity theory; Mutual information; Intuition; Computational complexity theory; Dimension (graph theory); Discrete mathematics; Matching (statistics); Kolmogorov equations (Markov jump process); Theoretical computer science; Computer science; Quantum; Combinatorics; Time complexity; Algorithm; Mathematical optimization; Quantum information; Statistics","score_opus":0.047070984818778014,"score_gpt":0.34114653367503217,"score_spread":0.29407554885625414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326289323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022564508,0.031163478,0.8290741,0.032637306,0.0014877056,0.000088968365,0.0008182315,0.000365013,0.08180063],"genre_scores_gemma":[0.71370375,0.03963132,0.19312972,0.0046862867,0.013826667,0.0008827266,0.0013210982,0.00047365442,0.032344755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958412,0.0018350824,0.00025788357,0.00060176203,0.0011638404,0.0003001661],"domain_scores_gemma":[0.9592794,0.03598513,0.00084266445,0.0019637898,0.0014359461,0.0004930241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004522475,0.0017596654,0.0023501664,0.0046882485,0.0026933504,0.007943159,0.0031768477,0.0041271714,0.011844578],"category_scores_gemma":[0.023439245,0.0011760808,0.0023544345,0.005968049,0.011124385,0.027109193,0.0033741423,0.011306289,0.0014337252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056532976,0.000009204334,0.000090478214,0.00005390375,0.000006763176,0.000011898894,0.000044375294,0.0014886489,0.00003933338,0.9943176,0.001424497,0.002507642],"study_design_scores_gemma":[0.0000035791168,0.000002596201,0.000059338356,0.000014416388,0.000004710115,0.000015800753,0.000015987174,0.0055577136,0.00004148427,0.99199694,0.0022808062,0.000006510828],"about_ca_topic_score_codex":0.0017120171,"about_ca_topic_score_gemma":0.001252666,"teacher_disagreement_score":0.011844578,"about_ca_system_score_codex":0.004978146,"about_ca_system_score_gemma":0.0017816646,"threshold_uncertainty_score":0.039624035},"labels":[],"label_agreement":null},{"id":"W32639513","doi":"10.1007/978-3-642-04271-3_72","title":"Towards Accurate, Automatic Segmentation of the Hippocampus and Amygdala from MRI","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"McGill University; Douglas Mental Health University Institute; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Amygdala; Hippocampus; Segmentation; Artificial intelligence; Neuroscience; Pattern recognition (psychology); Psychology","score_opus":0.011018618152189696,"score_gpt":0.28078535783275294,"score_spread":0.26976673968056325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32639513","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.014180974,0.0017422688,0.97901845,0.00025174592,0.000074518146,0.00008334104,0.00034944492,0.0035376444,0.0007617425],"genre_scores_gemma":[0.06633478,0.0013620419,0.92669225,0.0002979236,0.000095845106,0.00010321585,0.0013088522,0.00089518476,0.0029099947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991578,0.00013148668,0.0000609538,0.0001759986,0.00035388165,0.00011983889],"domain_scores_gemma":[0.9985909,0.00046955593,0.00015479549,0.00025056396,0.00047100295,0.00006312946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573355,0.0015749901,0.0020269675,0.0029988778,0.00070059457,0.0029142834,0.0024172282,0.0035269929,0.0016211338],"category_scores_gemma":[0.0039523854,0.0017424844,0.0015307099,0.0017066451,0.0008081594,0.0014372249,0.0020759325,0.002139582,0.0034649395],"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.00042916057,0.00011777585,0.0023650893,0.0007408921,0.00022558607,0.0004522886,0.00033941367,0.029822452,0.4188393,0.0036419209,0.008451431,0.53457475],"study_design_scores_gemma":[0.0001062989,0.00021440248,0.010035918,0.00018130176,0.00031354648,0.0028376519,0.00032645927,0.7382623,0.20553394,0.021534907,0.020504085,0.00014919422],"about_ca_topic_score_codex":0.008558731,"about_ca_topic_score_gemma":0.019530918,"teacher_disagreement_score":0.008558731,"about_ca_system_score_codex":0.0005772892,"about_ca_system_score_gemma":0.0023201196,"threshold_uncertainty_score":0.017017782},"labels":[],"label_agreement":null},{"id":"W326778424","doi":"10.1007/978-3-540-24838-5_28","title":"Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Minimum spanning tree; Spanning tree; Wireless ad hoc network; Computer science; Enhanced Data Rates for GSM Evolution; Node (physics); RADIUS; Combinatorics; Algorithm; Topology (electrical circuits); Mathematics; Computer network; Physics; Wireless; Telecommunications","score_opus":0.01774785019716523,"score_gpt":0.24540984768245863,"score_spread":0.2276619974852934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326778424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019929705,0.0006719048,0.9775474,0.00010382047,0.000028958531,0.000047307083,0.000047939735,0.00030194712,0.0013210323],"genre_scores_gemma":[0.16368116,0.0010819639,0.83282423,0.000039262162,0.000059328042,0.00013049376,0.00020665424,0.00029160277,0.0016852068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922264,0.00023222162,0.00006741002,0.00014718481,0.00027959415,0.000050910938],"domain_scores_gemma":[0.9977022,0.0015274787,0.0002307318,0.0002666279,0.00021363048,0.00005943783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121005,0.000975772,0.0013788575,0.0010900343,0.00061713415,0.000988449,0.0021447008,0.0012276524,0.0014045361],"category_scores_gemma":[0.006731857,0.00095061085,0.0007396872,0.0016311147,0.00081915304,0.0031089922,0.0013462604,0.0010355671,0.0005092002],"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.00041808918,0.00015358084,0.0009623624,0.0009531546,0.000102488724,0.00020864255,0.00070734177,0.33563852,0.052114505,0.10409538,0.007424649,0.49722132],"study_design_scores_gemma":[0.00005291851,0.00028250282,0.0005030465,0.0000720094,0.00009399673,0.00063614745,0.00022352036,0.8501793,0.029371016,0.11238166,0.006154506,0.000049444967],"about_ca_topic_score_codex":0.00043505372,"about_ca_topic_score_gemma":0.00055202097,"teacher_disagreement_score":0.0021447008,"about_ca_system_score_codex":0.00045016664,"about_ca_system_score_gemma":0.00039580624,"threshold_uncertainty_score":0.0053525567},"labels":[],"label_agreement":null},{"id":"W32776509","doi":"10.1007/978-3-642-24425-4_68","title":"ε-Near Collections","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Rough set; Set (abstract data type); Context (archaeology); Fuzzy set; Feature (linguistics); Data mining; Information retrieval; Fuzzy logic; Artificial intelligence; Geography; Archaeology; Programming language","score_opus":0.02576411791713864,"score_gpt":0.2304912780696928,"score_spread":0.20472716015255416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32776509","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034477137,0.0021323115,0.13371615,0.0014704749,0.0012018137,0.00016881626,0.0017909242,0.0010050012,0.82403743],"genre_scores_gemma":[0.2732011,0.0032562467,0.0834335,0.0011448807,0.00094177655,0.00034081246,0.0054501453,0.0011787339,0.6310528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986999,0.00015471497,0.000111997964,0.00043635032,0.00045272656,0.00014422741],"domain_scores_gemma":[0.9984061,0.0003243033,0.000108336775,0.0005104075,0.00042229373,0.0002286549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000697906,0.00067855057,0.0009885333,0.002472889,0.0030491115,0.004590237,0.0015374896,0.00078942504,0.040582724],"category_scores_gemma":[0.003274649,0.00059525867,0.0010584686,0.0028225442,0.0019269336,0.009392506,0.0043667876,0.003508723,0.014439014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006508919,0.00003048014,0.00015588777,0.00012295545,0.000013662002,0.00007733573,0.00028540732,0.00033109632,0.0011418144,0.93553954,0.01755302,0.044683844],"study_design_scores_gemma":[0.000010233093,0.00002699596,0.00023754397,0.000053841697,0.000019556359,0.0004067492,0.00027894948,0.0007582477,0.0015859668,0.81227183,0.1843334,0.00001665811],"about_ca_topic_score_codex":0.0006926447,"about_ca_topic_score_gemma":0.0008947499,"teacher_disagreement_score":0.040582724,"about_ca_system_score_codex":0.0012330561,"about_ca_system_score_gemma":0.0008088471,"threshold_uncertainty_score":0.13576269},"labels":[],"label_agreement":null},{"id":"W32819663","doi":"10.1007/978-3-642-24500-8_64","title":"To Virtualize or Not? The Importance of Physical and Virtual Components in Augmented Reality Board Games","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Human–computer interaction; Context (archaeology); Gesture; Augmented reality; Multimedia; Game mechanics; Virtual reality; Virtual world; Artificial intelligence","score_opus":0.03708946147740668,"score_gpt":0.2843962194412004,"score_spread":0.24730675796379373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32819663","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.100605115,0.09180818,0.15751524,0.025627347,0.0033666533,0.0000803869,0.00008170181,0.00044334654,0.6204721],"genre_scores_gemma":[0.8334629,0.03698834,0.04311166,0.0015862514,0.0004440548,0.0000989116,0.000054189884,0.00019278754,0.084061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999403,0.00028762346,0.000020058671,0.00004713413,0.00018463157,0.00005753983],"domain_scores_gemma":[0.9992163,0.00059442007,0.00003414628,0.00003434779,0.00006571857,0.000055005836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006201628,0.00054713734,0.0002782919,0.00031946998,0.0004058801,0.004729379,0.0005608508,0.00076201063,0.004770307],"category_scores_gemma":[0.0025580295,0.00036422652,0.00019331748,0.00028715946,0.0025852027,0.005007934,0.0013255393,0.0016813563,0.0007946369],"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.00021470373,0.00012934528,0.00089617353,0.0005944841,0.000031253094,0.00017234735,0.005241021,0.0018046887,0.005630613,0.52775306,0.017687047,0.43984526],"study_design_scores_gemma":[0.00009339301,0.00043946027,0.006082017,0.0017285825,0.00014858818,0.0021424817,0.014,0.019373488,0.008017024,0.48870343,0.45911187,0.00015977211],"about_ca_topic_score_codex":0.0010262027,"about_ca_topic_score_gemma":0.0019227939,"teacher_disagreement_score":0.004770307,"about_ca_system_score_codex":0.00035769865,"about_ca_system_score_gemma":0.0004514399,"threshold_uncertainty_score":0.01595825},"labels":[],"label_agreement":null},{"id":"W331118651","doi":"10.1007/978-3-642-44973-4_41","title":"Using Racing to Automatically Configure Algorithms for Scaling Performance","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scaling; Computer science; Algorithm; Mathematics; Geometry","score_opus":0.06047288991167197,"score_gpt":0.3144251707782464,"score_spread":0.2539522808665744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W331118651","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.1058572,0.00041554373,0.811269,0.00022145791,0.0002581526,0.0002664552,0.000298177,0.06873475,0.012679359],"genre_scores_gemma":[0.53683114,0.0001299599,0.4517295,0.00018165921,0.00006023132,0.0002615758,0.0009849508,0.005754245,0.0040667295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.0002859726,0.00010647177,0.00039592615,0.00034593645,0.00012371453],"domain_scores_gemma":[0.9936668,0.0029902025,0.00050475023,0.001544534,0.0010444619,0.00024932984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001808023,0.0015354158,0.00089332013,0.00160195,0.00067285186,0.0016076977,0.002018498,0.0010683043,0.00895251],"category_scores_gemma":[0.012199441,0.0008297402,0.0005812717,0.0008075136,0.00051729515,0.0027040937,0.0012699722,0.001171804,0.0027770624],"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.0010253709,0.0004125081,0.010109149,0.0003049221,0.0001253945,0.00020078574,0.00038321214,0.08255087,0.044622503,0.005294358,0.018071828,0.8368991],"study_design_scores_gemma":[0.000059620786,0.0001376752,0.0014899769,0.000033458968,0.000030994725,0.000107931504,0.00006383099,0.9581464,0.026931655,0.006101667,0.006859167,0.000037631704],"about_ca_topic_score_codex":0.0013851257,"about_ca_topic_score_gemma":0.0019422929,"teacher_disagreement_score":0.00895251,"about_ca_system_score_codex":0.00075939693,"about_ca_system_score_gemma":0.0007653372,"threshold_uncertainty_score":0.029949069},"labels":[],"label_agreement":null},{"id":"W331231","doi":"10.1007/978-3-642-24571-8_20","title":"Automatic Emotion Recognition from Speech A PhD Research Proposal","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"École de Technologie Supérieure; Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Ambiguity; Proposition; Confusion; Domain (mathematical analysis); Emotion recognition; Class (philosophy); Speech recognition; Natural language processing; State (computer science); SIGNAL (programming language); Artificial intelligence; Algorithm; Linguistics; Programming language; Psychology","score_opus":0.12300958984486046,"score_gpt":0.35027160245068534,"score_spread":0.22726201260582488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W331231","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030870013,0.020039134,0.7691857,0.021960728,0.015691116,0.00045336917,0.0011736775,0.002008753,0.13861747],"genre_scores_gemma":[0.18658988,0.018886752,0.21736628,0.0035042309,0.011655233,0.00041549111,0.0025510774,0.0006437892,0.5583873],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946266,0.00006729222,0.000026345753,0.00020149707,0.000188062,0.000054215445],"domain_scores_gemma":[0.9987631,0.00033328694,0.000022968105,0.00010219039,0.00063258683,0.00014587704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705181,0.00055072526,0.0005305171,0.00081499194,0.00043321337,0.0024203495,0.0007631381,0.0012343205,0.014248388],"category_scores_gemma":[0.00177629,0.00028757533,0.0005731693,0.0006000163,0.0006244664,0.0018333732,0.0007832872,0.0012083511,0.009565564],"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.00022006095,0.0003198029,0.00050852064,0.00021028504,0.000043373257,0.000092323615,0.0002716789,0.002080542,0.06673647,0.03893655,0.061786763,0.8287937],"study_design_scores_gemma":[0.00015698167,0.0013194741,0.006775771,0.00027120044,0.00018963563,0.0011867268,0.00049070345,0.066756785,0.17548156,0.10330486,0.6438653,0.00020101195],"about_ca_topic_score_codex":0.0011756177,"about_ca_topic_score_gemma":0.00062500767,"teacher_disagreement_score":0.014248388,"about_ca_system_score_codex":0.0005774945,"about_ca_system_score_gemma":0.0009531034,"threshold_uncertainty_score":0.047665656},"labels":[],"label_agreement":null},{"id":"W332845930","doi":"10.1007/978-3-319-07221-0_43","title":"Students’ Adaptation and Transfer of Strategies across Levels of Scaffolding in an Exploratory Environment","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Affordance; Scaffold; Adaptation (eye); Context (archaeology); Computer science; Transfer of learning; Exploratory research; Multivariate analysis of variance; Task (project management); Mathematics education; Learning environment; Human–computer interaction; Artificial intelligence; Psychology; Machine learning; Engineering","score_opus":0.08540508472752897,"score_gpt":0.3702134673827659,"score_spread":0.2848083826552369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W332845930","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.9961204,0.000034506276,0.0012826391,0.000021953385,0.000009040809,0.000023420303,0.000023519055,0.000036431367,0.002448087],"genre_scores_gemma":[0.9957611,0.000046438483,0.0013158995,0.000012688107,0.0000022861527,0.00003397269,0.000053994518,0.000020120897,0.002753601],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993486,0.00018154943,0.000042883665,0.00015357524,0.00016704459,0.00010639764],"domain_scores_gemma":[0.9957841,0.0023396972,0.0004535827,0.0005357672,0.00042114372,0.000465614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012416786,0.00037430233,0.00025659706,0.00036301964,0.0002147419,0.0019538354,0.0007398017,0.0005003898,0.0031638728],"category_scores_gemma":[0.011707356,0.00025267,0.0003031664,0.00036603064,0.00042960062,0.0008524691,0.0012106973,0.0009672808,0.0009197662],"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.004036244,0.0078864675,0.124847606,0.0004307797,0.00028288696,0.0007194648,0.054186523,0.009100137,0.20694333,0.0045648483,0.0031662132,0.58383554],"study_design_scores_gemma":[0.00041071346,0.010694291,0.79162157,0.00029106147,0.00037919127,0.001192552,0.021632833,0.027709117,0.11490226,0.012882075,0.018010203,0.00027409475],"about_ca_topic_score_codex":0.00060905557,"about_ca_topic_score_gemma":0.0005084448,"teacher_disagreement_score":0.0031638728,"about_ca_system_score_codex":0.00017392018,"about_ca_system_score_gemma":0.00040496374,"threshold_uncertainty_score":0.010584235},"labels":[],"label_agreement":null},{"id":"W33459561","doi":"10.1007/978-3-642-31900-6_40","title":"A Granular Computing Perspective on Image Organization within an Image Retrieval Context","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"","keywords":"Granular computing; Computer science; Image retrieval; Abstraction; Context (archaeology); Perspective (graphical); Aggregate (composite); Image (mathematics); Cluster analysis; Information retrieval; Domain (mathematical analysis); Image processing; Field (mathematics); Automatic image annotation; Artificial intelligence; Data mining; Mathematics; Geography","score_opus":0.01537200521224091,"score_gpt":0.24956992766679073,"score_spread":0.23419792245454982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33459561","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.027418049,0.008945044,0.93424475,0.0043933415,0.0004904715,0.000085233645,0.00028821305,0.00032013506,0.023814661],"genre_scores_gemma":[0.59897673,0.0069811386,0.38343328,0.00060224463,0.00147533,0.00015881073,0.00030179863,0.00015741625,0.007913198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.0003435885,0.00016856554,0.00022750306,0.0005592592,0.00017353136],"domain_scores_gemma":[0.9982014,0.0007347748,0.0003129329,0.00031921393,0.00023082942,0.00020076815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015028822,0.00075757224,0.0015361396,0.004687421,0.0010325792,0.0064720754,0.0020101566,0.0017397775,0.003682954],"category_scores_gemma":[0.0044104047,0.0007463173,0.0012650465,0.006965451,0.003810935,0.011160241,0.0026918151,0.0022418546,0.0005052687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041984007,0.000026062573,0.00032358576,0.00021157213,0.000041164425,0.0002506087,0.00035286174,0.009670474,0.0025052375,0.9649286,0.0014731619,0.020174496],"study_design_scores_gemma":[0.000011713951,0.00003555245,0.00070707896,0.00006698387,0.000055195516,0.00019523139,0.00024976835,0.04727975,0.0009127198,0.94289076,0.0075623533,0.000032858825],"about_ca_topic_score_codex":0.0022359446,"about_ca_topic_score_gemma":0.001789068,"teacher_disagreement_score":0.0064720754,"about_ca_system_score_codex":0.0015778751,"about_ca_system_score_gemma":0.0004910331,"threshold_uncertainty_score":0.012320638},"labels":[],"label_agreement":null},{"id":"W3349379","doi":"10.1007/978-3-319-09940-8_9","title":"Bi-objective Genetic Search for Release Planning in Support of Themes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sorting; Theme (computing); Genetic algorithm; Set (abstract data type); Operations research; Multi-objective optimization; Preference; Management science; Machine learning; Algorithm; World Wide Web; Mathematics","score_opus":0.023381579251515135,"score_gpt":0.2838028446062741,"score_spread":0.26042126535475896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3349379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034792107,0.0005324977,0.95338935,0.00019759222,0.000100765785,0.00011895404,0.00010169644,0.0005834744,0.010183512],"genre_scores_gemma":[0.503019,0.00037189425,0.48435345,0.00016089313,0.000065407556,0.00043246456,0.00033687247,0.00027599395,0.010984031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999566,0.00014519732,0.000020441443,0.00006491812,0.00012631285,0.00007700804],"domain_scores_gemma":[0.9990237,0.0006539646,0.00006502394,0.000060453982,0.00014100007,0.000055836248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013813976,0.0010854289,0.0012903136,0.0013296284,0.0006486956,0.0010234797,0.0018863506,0.0018953752,0.004982114],"category_scores_gemma":[0.0026065921,0.0007457759,0.0009538466,0.001406647,0.00066486915,0.00095548056,0.001176765,0.0014294827,0.0006647067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006670501,0.000055123634,0.00018697287,0.000057658774,0.000033733086,0.000048805734,0.000044902128,0.9576373,0.0008740403,0.005535187,0.00092078943,0.034538712],"study_design_scores_gemma":[0.0000145335125,0.000030333023,0.00004492611,0.000007286162,0.000008489824,0.000009213718,0.000009441646,0.99783856,0.00020407839,0.0015798277,0.00024972798,0.000003590247],"about_ca_topic_score_codex":0.00605524,"about_ca_topic_score_gemma":0.0054419995,"teacher_disagreement_score":0.00605524,"about_ca_system_score_codex":0.00094821915,"about_ca_system_score_gemma":0.0014224803,"threshold_uncertainty_score":0.01666683},"labels":[],"label_agreement":null},{"id":"W33594364","doi":"10.1007/978-3-540-31862-0_28","title":"Real Time Reactive Programming in Lucid Enriched with Contexts","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Programming language; Lucid dream; Class (philosophy); State (computer science); Property (philosophy); Declarative programming; Theoretical computer science; Programming paradigm; Inductive programming; Artificial intelligence","score_opus":0.009640569646042582,"score_gpt":0.23626985810264522,"score_spread":0.22662928845660263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33594364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013551243,0.0004551595,0.95140225,0.00022314505,0.00015308581,0.00005353163,0.0001390893,0.007024907,0.026997626],"genre_scores_gemma":[0.24930303,0.00046018758,0.7172013,0.00028209522,0.00008579453,0.00018949201,0.00034378117,0.0023426395,0.029791653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.00013304588,0.0000385615,0.00011549935,0.00018715794,0.000106694526],"domain_scores_gemma":[0.9996126,0.00016079342,0.000025449903,0.00011268748,0.00005220716,0.00003625608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008539603,0.00069613644,0.0006240889,0.00047799188,0.00064880535,0.001747557,0.0015111027,0.00042269478,0.006420685],"category_scores_gemma":[0.0014385243,0.0007817805,0.0009826345,0.00047500545,0.0012609672,0.0024330553,0.0024035757,0.0024917698,0.001807166],"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.0004069183,0.00008800779,0.0005729538,0.0003862779,0.000045702447,0.0002952527,0.0010021264,0.057954565,0.013520935,0.7458918,0.009075579,0.17075981],"study_design_scores_gemma":[0.00011083167,0.00010572798,0.0003241428,0.00019293714,0.00009640331,0.0002708937,0.00015273664,0.25241628,0.021343773,0.5975313,0.12736087,0.00009409706],"about_ca_topic_score_codex":0.0020553723,"about_ca_topic_score_gemma":0.0050168517,"teacher_disagreement_score":0.006420685,"about_ca_system_score_codex":0.0008453662,"about_ca_system_score_gemma":0.00078110996,"threshold_uncertainty_score":0.021479309},"labels":[],"label_agreement":null},{"id":"W336146807","doi":"10.1007/978-3-662-44196-1_34","title":"Comparison of Multimodal Notifications During Telesurgery","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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 Calgary","funders":"","keywords":"Modality (human–computer interaction); Haptic technology; Computer science; Margin (machine learning); Modalities; Task force; Task (project management); Set (abstract data type); Treatment modality; Simulation; Artificial intelligence; Human–computer interaction; Machine learning; Surgery; Medicine; Engineering","score_opus":0.04515747838436995,"score_gpt":0.32539759318529754,"score_spread":0.2802401148009276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W336146807","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.9281143,0.0086210575,0.0346093,0.0003003547,0.0011951224,0.0003988211,0.0010653487,0.0012348087,0.024460873],"genre_scores_gemma":[0.9838742,0.0020228226,0.007827452,0.00011801467,0.00018565835,0.00015174758,0.00047301676,0.00017802714,0.0051689227],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989506,0.00044690163,0.00008045438,0.000088576395,0.00033825237,0.00009522366],"domain_scores_gemma":[0.9909204,0.0074818525,0.00036488578,0.00022285013,0.00073683163,0.00027313858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014470642,0.0006090582,0.00055366347,0.00091080036,0.00026661967,0.00095928204,0.00061942113,0.00070243515,0.013109255],"category_scores_gemma":[0.015989412,0.00021055418,0.00042072538,0.00041595666,0.00020230509,0.00082074513,0.0007140781,0.00039604853,0.0013673127],"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.06824829,0.0019357821,0.016894888,0.0034896655,0.00039029526,0.0007310259,0.0020068553,0.0066486155,0.08390562,0.0016813348,0.0050402847,0.8090274],"study_design_scores_gemma":[0.0043932567,0.07536477,0.6561628,0.0037890517,0.004997796,0.006275801,0.00783347,0.070607625,0.12753169,0.0071561146,0.03511322,0.0007744019],"about_ca_topic_score_codex":0.0010964945,"about_ca_topic_score_gemma":0.0011318211,"teacher_disagreement_score":0.013109255,"about_ca_system_score_codex":0.00030250382,"about_ca_system_score_gemma":0.00051617954,"threshold_uncertainty_score":0.043854892},"labels":[],"label_agreement":null},{"id":"W33863052","doi":"10.1007/978-3-642-38457-8_22","title":"Detecting and Categorizing Indices in Lecture Video Using Supervised Machine Learning","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Supervised learning; Pattern recognition (psychology); Artificial neural network","score_opus":0.024337151493192592,"score_gpt":0.2533469240577634,"score_spread":0.22900977256457078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33863052","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.564283,0.0033313592,0.4152746,0.00038419204,0.0005557563,0.0005215373,0.003371075,0.0047353897,0.007543005],"genre_scores_gemma":[0.72988725,0.0013788755,0.25793716,0.00008899391,0.0003492513,0.00022907383,0.00527176,0.00021506245,0.0046425518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992436,0.00006029149,0.000059336042,0.0002158022,0.0003002856,0.0001207088],"domain_scores_gemma":[0.9984113,0.00037511432,0.0002454851,0.00015935951,0.0006692869,0.00013945923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909391,0.00076516246,0.00093722844,0.0050804373,0.00041304,0.0011701817,0.000851971,0.0006014563,0.0010563859],"category_scores_gemma":[0.002086803,0.00018898386,0.0005706697,0.0028298723,0.00029370698,0.0013527347,0.0007392432,0.00083698303,0.0013758282],"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.00057988934,0.00040187605,0.03479936,0.0002421406,0.00008052259,0.00022620712,0.0002441324,0.0032446382,0.078177765,0.0012507186,0.008445067,0.8723076],"study_design_scores_gemma":[0.000054878285,0.0008754956,0.14460845,0.00018753817,0.00033667366,0.0012375454,0.0013162513,0.6915647,0.13865474,0.007849288,0.0132011175,0.00011335186],"about_ca_topic_score_codex":0.0027372285,"about_ca_topic_score_gemma":0.00471905,"teacher_disagreement_score":0.0050804373,"about_ca_system_score_codex":0.0005721385,"about_ca_system_score_gemma":0.0005159638,"threshold_uncertainty_score":0.0054425597},"labels":[],"label_agreement":null},{"id":"W339444614","doi":"10.1007/978-3-319-09129-7_28","title":"Closest-Point Queries for Complex Objects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Windsor","funders":"","keywords":"Rectangle; Ellipse; Line segment; Polygon (computer graphics); Regular polygon; Computer science; Heuristic; Boundary (topology); Convex polygon; Convex hull; Line (geometry); Preprocessor; Point (geometry); Object (grammar); Computational geometry; Simple polygon; Algorithm; Set (abstract data type); Combinatorics; Mathematics; Artificial intelligence; Geometry","score_opus":0.0256635057544411,"score_gpt":0.26198613340106813,"score_spread":0.23632262764662704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W339444614","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.00820345,0.0020831889,0.96791315,0.00048575428,0.000228072,0.0001111531,0.0014523313,0.0055610985,0.013961834],"genre_scores_gemma":[0.15070385,0.0035958996,0.8031508,0.00037094727,0.00031963902,0.0003094038,0.009678488,0.0031226513,0.028748319],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979843,0.00023279585,0.00018321422,0.00033389713,0.0011530063,0.00011272032],"domain_scores_gemma":[0.99802315,0.00081834244,0.00006773575,0.0007640546,0.00025307876,0.000073696276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009190439,0.0012012721,0.00226677,0.0015307758,0.0010091331,0.0032551945,0.002864793,0.0024874972,0.017961608],"category_scores_gemma":[0.0069155293,0.0007369926,0.0010522251,0.0033767456,0.0010986008,0.0077266307,0.0064363093,0.0023095994,0.00858773],"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.0003446403,0.0001216681,0.0006347811,0.0010872487,0.000068540336,0.00036992846,0.00069245667,0.04283044,0.012507287,0.26337123,0.098778404,0.5791934],"study_design_scores_gemma":[0.00008288311,0.00006530652,0.0003336299,0.00015282165,0.00003348883,0.0010816606,0.0003698914,0.3172238,0.01180389,0.54444385,0.12434336,0.000065360044],"about_ca_topic_score_codex":0.0016680873,"about_ca_topic_score_gemma":0.0016990984,"teacher_disagreement_score":0.017961608,"about_ca_system_score_codex":0.0010419437,"about_ca_system_score_gemma":0.000555651,"threshold_uncertainty_score":0.06008762},"labels":[],"label_agreement":null},{"id":"W340259442","doi":"10.1007/978-3-319-14678-2_28","title":"Registration of Real-Time and Prior Imaging Data with Applications to MR Guided Cardiac Interventions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Sunnybrook Hospital; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Image registration; Real-time MRI; Magnetic resonance imaging; Computer vision; Artificial intelligence; Image quality; Interventional magnetic resonance imaging; Cardiac imaging; Image resolution; Metric (unit); Cardiac magnetic resonance imaging; Temporal resolution; Medical physics; Medicine; Radiology; Image (mathematics)","score_opus":0.03495488569563527,"score_gpt":0.34539361765601556,"score_spread":0.3104387319603803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340259442","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.005905018,0.0026118595,0.98547864,0.00019205455,0.00023953694,0.00004516257,0.00013819759,0.0013646653,0.0040248972],"genre_scores_gemma":[0.1151182,0.008462843,0.8508466,0.00021072775,0.0004666313,0.00011721094,0.001285455,0.0013280733,0.022164362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943835,0.0001007054,0.00005299645,0.00010995602,0.00026592426,0.000032060245],"domain_scores_gemma":[0.9992607,0.00032748777,0.00008154404,0.00018384261,0.00012332854,0.0000230845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010793883,0.00067197613,0.0007910757,0.0010860411,0.0002127094,0.0017012797,0.0011438231,0.0010054642,0.0048977514],"category_scores_gemma":[0.0027840715,0.0005614303,0.0008701104,0.0023959123,0.0006122488,0.0011363606,0.0010560965,0.00091675686,0.0033088054],"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.00024403507,0.00013128345,0.00052645354,0.0004414717,0.0000833224,0.0003192944,0.00015486109,0.037676778,0.078922756,0.01573238,0.009718174,0.85604924],"study_design_scores_gemma":[0.000055947756,0.00054025656,0.0054655587,0.00019335111,0.00022959031,0.0052121235,0.00025242992,0.6351574,0.17475963,0.046098296,0.13186188,0.00017346797],"about_ca_topic_score_codex":0.0006361573,"about_ca_topic_score_gemma":0.0011034365,"teacher_disagreement_score":0.0048977514,"about_ca_system_score_codex":0.00020155264,"about_ca_system_score_gemma":0.00043922785,"threshold_uncertainty_score":0.016384602},"labels":[],"label_agreement":null},{"id":"W341760123","doi":"10.1007/978-3-319-10437-9_13","title":"Linear Object Registration of Interventional Tools","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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":"Queen's University","funders":"","keywords":"Computer science; Image registration; Computer vision; Artificial intelligence; Point set registration; Ground truth; Point (geometry); Iterative closest point; Set (abstract data type); Object (grammar); Data set; Algorithm; Point cloud; Mathematics; Image (mathematics)","score_opus":0.020261125430909875,"score_gpt":0.23513391138790107,"score_spread":0.2148727859569912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W341760123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024027843,0.0012762685,0.9910812,0.00007465122,0.000068909394,0.000035659352,0.00004851749,0.001063508,0.003948484],"genre_scores_gemma":[0.16998218,0.004320351,0.7848158,0.0001587901,0.00020006175,0.00020240652,0.0009952381,0.0012491792,0.03807599],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986665,0.00027771064,0.00008183965,0.00040121132,0.00048090654,0.00009175191],"domain_scores_gemma":[0.9993088,0.00023888891,0.00008332792,0.00023381796,0.00011043946,0.00002471081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009407919,0.0008920357,0.0011650065,0.0014967287,0.00034900047,0.00221507,0.0020424013,0.0014465282,0.0070561906],"category_scores_gemma":[0.0020265046,0.0009839099,0.000992956,0.0023500388,0.0010736688,0.0020035773,0.0023683526,0.0014089865,0.007037573],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018797658,0.000058032183,0.0003656871,0.00052679284,0.00006616514,0.00017198289,0.00025107313,0.03613816,0.043301206,0.030846335,0.008124288,0.8799623],"study_design_scores_gemma":[0.000050845596,0.0004959797,0.0033069837,0.00033221886,0.00014180988,0.0032088165,0.00035953327,0.6107335,0.16787092,0.073451355,0.13985994,0.00018803914],"about_ca_topic_score_codex":0.00058739824,"about_ca_topic_score_gemma":0.0006671686,"teacher_disagreement_score":0.0070561906,"about_ca_system_score_codex":0.0005689036,"about_ca_system_score_gemma":0.00073660817,"threshold_uncertainty_score":0.023605287},"labels":[],"label_agreement":null},{"id":"W342307487","doi":"10.1007/978-3-319-13332-4_21","title":"A Comparison of Graph-Based and Statistical Metrics for Learning Domain Keywords","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Pointwise mutual information; Graph; Pointwise; Artificial intelligence; Phrase; Machine learning; Data mining; Mutual information; Theoretical computer science; Mathematics","score_opus":0.021132709711514663,"score_gpt":0.3197664553226307,"score_spread":0.29863374561111605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W342307487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14827523,0.016766481,0.81277466,0.0020257332,0.0005012693,0.0003237713,0.0043642484,0.0038239823,0.011144758],"genre_scores_gemma":[0.6727279,0.0041037304,0.3107551,0.0002566456,0.00030063,0.0002846913,0.007357826,0.00079649105,0.0034169652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99326706,0.0026178507,0.00051738473,0.000796454,0.0025994573,0.00020175352],"domain_scores_gemma":[0.959436,0.02871728,0.00186873,0.003189042,0.0059003583,0.00088865886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00665919,0.0010368351,0.0013824939,0.01070774,0.00067653303,0.0031624069,0.0016327866,0.001646034,0.0022905467],"category_scores_gemma":[0.035437796,0.00025237794,0.0007539647,0.008507063,0.0010814643,0.006519321,0.0022287725,0.0012185205,0.00083519815],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009920071,0.00032766987,0.030552227,0.0010289736,0.0005105113,0.00007678609,0.0002773244,0.067757666,0.0044502895,0.0418105,0.015899163,0.8363168],"study_design_scores_gemma":[0.00010125807,0.0012076863,0.022752581,0.00026119142,0.00026695302,0.00039954702,0.00052285986,0.8250442,0.0052856575,0.13000557,0.014039834,0.000112688234],"about_ca_topic_score_codex":0.003592203,"about_ca_topic_score_gemma":0.005029838,"teacher_disagreement_score":0.01070774,"about_ca_system_score_codex":0.0021011091,"about_ca_system_score_gemma":0.0014554621,"threshold_uncertainty_score":0.035217583},"labels":[],"label_agreement":null},{"id":"W342532617","doi":"10.1007/978-3-642-40787-1_23","title":"Runtime Monitoring of Temporal Logic Properties in a Platform Game","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Temporal logic; Video game; Context (archaeology); Set (abstract data type); Video game development; Programming language; Human–computer interaction; Game design; Multimedia","score_opus":0.060071991616505886,"score_gpt":0.2713337788102536,"score_spread":0.21126178719374772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W342532617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3283447,0.00030900678,0.6339039,0.000431804,0.00014771802,0.00026262907,0.0003916124,0.0291922,0.0070164716],"genre_scores_gemma":[0.8701602,0.00007005314,0.12610704,0.00008757403,0.000026136064,0.0000709554,0.0002592304,0.0009902328,0.0022285434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779046,0.0005005379,0.00014654249,0.000613342,0.00064860086,0.00030052284],"domain_scores_gemma":[0.9930006,0.0043107425,0.00044683059,0.0013130108,0.0005322963,0.00039639507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024825495,0.0011898816,0.00083312596,0.00094499934,0.00076408044,0.0025316891,0.0023848077,0.0008691132,0.0029909755],"category_scores_gemma":[0.009134135,0.0009177055,0.0009389056,0.00041928142,0.0014073411,0.0031774822,0.0022699318,0.0020133387,0.000561646],"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.0065124957,0.00197868,0.02132384,0.00082732295,0.00043706148,0.0033983327,0.0035622376,0.17544104,0.2541156,0.12718664,0.011110836,0.39410585],"study_design_scores_gemma":[0.00015760814,0.00022290926,0.001435855,0.000040093815,0.00011917089,0.00023003759,0.00013064603,0.90612125,0.049061865,0.03877544,0.0036500543,0.000055040848],"about_ca_topic_score_codex":0.004817647,"about_ca_topic_score_gemma":0.006476198,"teacher_disagreement_score":0.004817647,"about_ca_system_score_codex":0.0010455512,"about_ca_system_score_gemma":0.0015754551,"threshold_uncertainty_score":0.013129115},"labels":[],"label_agreement":null},{"id":"W34303698","doi":"10.1007/978-3-642-23713-3_22","title":"Granular Data Regression with Neural Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Alberta","funders":"","keywords":"Granularity; Computer science; Granular computing; Interval (graph theory); Data mining; Interval data; Artificial neural network; Artificial intelligence; Multilayer perceptron; Perceptron; Pattern recognition (psychology); Algorithm; Machine learning; Rough set; Mathematics","score_opus":0.038521766662791015,"score_gpt":0.24625594220829813,"score_spread":0.2077341755455071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34303698","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.0042973263,0.0010202838,0.9925168,0.00013680528,0.000094595925,0.000020982492,0.00005795562,0.0004723923,0.0013829565],"genre_scores_gemma":[0.3546218,0.0023517625,0.63236415,0.00016321198,0.0003960678,0.00016790602,0.00047434584,0.000332511,0.009128214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990938,0.0003153025,0.00007450252,0.00019303302,0.0002649283,0.000058477366],"domain_scores_gemma":[0.99834645,0.0010535847,0.00013558267,0.00027493524,0.00016040944,0.000029082168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022167356,0.00093629846,0.0017607019,0.0011324896,0.0002976728,0.0016487536,0.0011153527,0.0009645393,0.0032688703],"category_scores_gemma":[0.006798095,0.000704636,0.0009638747,0.002436407,0.00061659596,0.0020794007,0.0015997742,0.0018504489,0.001079395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018161835,0.000062016756,0.0006633046,0.00023226839,0.00020124918,0.000086321,0.000042208667,0.63922083,0.0021162601,0.032260682,0.00389132,0.32104197],"study_design_scores_gemma":[0.0000042192255,0.000007115833,0.00009654611,0.000011544246,0.000009802774,0.000011206976,0.000003709199,0.9811348,0.00038323982,0.017722934,0.000609963,0.000004947181],"about_ca_topic_score_codex":0.0015784777,"about_ca_topic_score_gemma":0.001368413,"teacher_disagreement_score":0.0032688703,"about_ca_system_score_codex":0.0005274721,"about_ca_system_score_gemma":0.00031235843,"threshold_uncertainty_score":0.011723399},"labels":[],"label_agreement":null},{"id":"W34314470","doi":"10.1007/978-3-642-14287-1_43","title":"German Noch So: Scalar Degree Operator and Negative Polarity Item","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polarity (international relations); German; Scalar (mathematics); Operator (biology); Meaning (existential); Computer science; Sensitivity (control systems); Algorithm; Mathematics; Linguistics; Philosophy; Epistemology; Chemistry; Engineering; Geometry","score_opus":0.016653918416623857,"score_gpt":0.26168164345408496,"score_spread":0.2450277250374611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34314470","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.017044086,0.004429604,0.011059556,0.0072582304,0.006767705,0.000020416226,0.0003062044,0.00012753985,0.95298666],"genre_scores_gemma":[0.30348486,0.005036795,0.00467236,0.0025012775,0.0029730613,0.000041865533,0.0005597253,0.00035399167,0.6803761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99991703,0.000018533878,0.0000039788074,0.000017128534,0.000028038987,0.000015306914],"domain_scores_gemma":[0.99992347,0.000018284994,0.0000061279015,0.000012340452,0.000027214308,0.000012681212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015209697,0.0003997396,0.00027069586,0.0006994065,0.001124878,0.0015030397,0.00032055855,0.0005654707,0.025670314],"category_scores_gemma":[0.00033592834,0.00015341063,0.0002554203,0.00073583086,0.0011781956,0.0030142546,0.0008913797,0.0014503414,0.005493251],"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.000013196635,0.000008036686,0.00004371782,0.00003338989,0.0000020855869,0.000051945422,0.000097730204,0.000037925547,0.00079631223,0.95040447,0.039804682,0.0087065585],"study_design_scores_gemma":[0.0000068676377,0.000017354085,0.00035087706,0.00003431122,0.000005451329,0.0005164846,0.00014752547,0.00030157974,0.0011880125,0.73174036,0.26567787,0.000013301258],"about_ca_topic_score_codex":0.00053981063,"about_ca_topic_score_gemma":0.0008695862,"teacher_disagreement_score":0.025670314,"about_ca_system_score_codex":0.00050174474,"about_ca_system_score_gemma":0.00026913895,"threshold_uncertainty_score":0.08587575},"labels":[],"label_agreement":null},{"id":"W34504510","doi":"10.1007/978-3-319-15612-5_24","title":"Non-repetitive Strings over Alphabet Lists","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Alphabet; Computer science; Generality; Extension (predicate logic); Combinatorics on words; Symbol (formal); Word (group theory); Combinatorics; Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Linguistics; Programming language","score_opus":0.019235466901796998,"score_gpt":0.26398280817754954,"score_spread":0.24474734127575254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34504510","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.06122838,0.017397285,0.6878457,0.0014623493,0.0022267278,0.00015293447,0.0012542725,0.004071411,0.22436097],"genre_scores_gemma":[0.41073233,0.017981393,0.27769214,0.0010283379,0.0019275573,0.00030813014,0.003688171,0.001798739,0.2848432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.00006778775,0.000054251457,0.00007532435,0.00025753008,0.000048790916],"domain_scores_gemma":[0.99869907,0.00071097363,0.00009158032,0.00026020224,0.00020136808,0.00003688873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029307287,0.0005093366,0.00055438635,0.0015117329,0.00056073215,0.001277135,0.0010934804,0.00056583335,0.017166827],"category_scores_gemma":[0.002480497,0.0003216214,0.00034087704,0.0035071748,0.00059457286,0.0029227997,0.0010385119,0.0009138209,0.0073110512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012808735,0.000045912184,0.00027269043,0.0010863518,0.000027571768,0.00045377185,0.00034554082,0.0064164754,0.012851408,0.41999123,0.020976447,0.5374046],"study_design_scores_gemma":[0.00002731452,0.00014409679,0.00056031195,0.00046018366,0.000042225503,0.0020382255,0.00017002343,0.022780959,0.025202528,0.72875696,0.21977037,0.000046729387],"about_ca_topic_score_codex":0.00017295456,"about_ca_topic_score_gemma":0.00025305816,"teacher_disagreement_score":0.017166827,"about_ca_system_score_codex":0.00044530755,"about_ca_system_score_gemma":0.000481672,"threshold_uncertainty_score":0.057428718},"labels":[],"label_agreement":null},{"id":"W346258806","doi":"10.1007/978-3-319-16354-3_1","title":"Towards Query Level Resource Weighting for Diversified Query Expansion","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Université de Montréal","funders":"","keywords":"Weighting; Computer science; Query expansion; Resource (disambiguation); Benchmark (surveying); Query optimization; Web query classification; Sargable; Diversification (marketing strategy); Web search query; Information retrieval; Set (abstract data type); Data mining; Search engine","score_opus":0.07238390860555381,"score_gpt":0.3041685558103236,"score_spread":0.23178464720476977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W346258806","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.016834736,0.0015566584,0.977233,0.00021213632,0.00008602167,0.00014008148,0.0002833564,0.0017940899,0.0018600067],"genre_scores_gemma":[0.23945618,0.0013917797,0.7500915,0.0003394368,0.0002414103,0.00028405004,0.0015521458,0.00056979735,0.006073669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706644,0.0007952979,0.00024235377,0.0004036736,0.0011779242,0.00031431357],"domain_scores_gemma":[0.9966916,0.0012754285,0.00014122837,0.00086138776,0.00090301246,0.00012737839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028254448,0.0012474136,0.0021554048,0.0025212623,0.0006192434,0.00210431,0.001879275,0.001009723,0.0035687557],"category_scores_gemma":[0.008381602,0.0007007355,0.0008104163,0.0036665502,0.00070075353,0.0040361146,0.002742479,0.0018101172,0.0015629445],"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.00064616004,0.00037538732,0.0015498843,0.0005106212,0.00015055519,0.00020467714,0.00031818688,0.07004753,0.07305999,0.029838052,0.017733082,0.8055659],"study_design_scores_gemma":[0.0000381182,0.00010665056,0.0005206761,0.000036232188,0.000087544235,0.00021431154,0.00012742459,0.9466929,0.019369254,0.025162192,0.0076068575,0.000037869384],"about_ca_topic_score_codex":0.0036381849,"about_ca_topic_score_gemma":0.0055841655,"teacher_disagreement_score":0.0036381849,"about_ca_system_score_codex":0.00087468437,"about_ca_system_score_gemma":0.0014361133,"threshold_uncertainty_score":0.014942527},"labels":[],"label_agreement":null},{"id":"W34647140","doi":"10.1007/978-3-642-21969-6_20","title":"Differential Fault Analysis of Sosemanuk","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Fault (geology); Differential (mechanical device); Computer science; Geology; Seismology; Engineering; Aerospace engineering","score_opus":0.02377345204130989,"score_gpt":0.268941645781219,"score_spread":0.24516819373990908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34647140","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24994056,0.0010571692,0.70419,0.0012755435,0.00039466133,0.00009190212,0.0003504685,0.0008919091,0.04180775],"genre_scores_gemma":[0.97201085,0.0002187118,0.018031674,0.0001292656,0.00008625888,0.000024595574,0.00017894917,0.00010355706,0.009216207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914765,0.00014524233,0.00004861076,0.00013642666,0.00037071286,0.00015143947],"domain_scores_gemma":[0.99812144,0.00080311357,0.00016167476,0.00035692385,0.00048917136,0.000067661065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006609544,0.00051072746,0.00073596026,0.0013605452,0.0006574149,0.0013381616,0.00076765404,0.0006986673,0.0043621315],"category_scores_gemma":[0.0043377355,0.00023699903,0.0006404494,0.00095525716,0.0016124332,0.0025596155,0.0017181572,0.0012848733,0.0005232742],"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.00027351224,0.000033953664,0.0016811996,0.000118758384,0.00002903477,0.00027914252,0.00020409536,0.03810686,0.004908151,0.91238993,0.0024087136,0.039566785],"study_design_scores_gemma":[0.000012991042,0.000048819405,0.000508019,0.00003119059,0.000021977534,0.0002147083,0.000057481586,0.18912712,0.0060120756,0.801194,0.0027489425,0.000022650494],"about_ca_topic_score_codex":0.00087255257,"about_ca_topic_score_gemma":0.00069936283,"teacher_disagreement_score":0.0043621315,"about_ca_system_score_codex":0.0012120301,"about_ca_system_score_gemma":0.00084136066,"threshold_uncertainty_score":0.014592826},"labels":[],"label_agreement":null},{"id":"W346782365","doi":"10.1007/978-3-319-10470-6_58","title":"Modeling the Variability in Brain Morphology and Lesion Distribution in Multiple Sclerosis by Deep Learning","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Deep belief network; Artificial intelligence; Computer science; Lesion; Multiple sclerosis; Deep learning; Pattern recognition (psychology); White matter; Pathology; Magnetic resonance imaging; Medicine","score_opus":0.018790441674859604,"score_gpt":0.234210093374649,"score_spread":0.21541965169978938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W346782365","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.62114716,0.00067809946,0.37601304,0.0006620035,0.00003821313,0.000022291752,0.00036821084,0.00042056738,0.00065033755],"genre_scores_gemma":[0.9908117,0.00014096942,0.008012832,0.000046227495,0.000019145558,0.000014947636,0.00016879766,0.00003178521,0.00075354223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998746,0.000032977703,0.0000066396547,0.00004250062,0.000020074147,0.000023216966],"domain_scores_gemma":[0.9990677,0.0006497979,0.0001232678,0.00005119095,0.000070261005,0.00003779083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083006884,0.00040109715,0.00043581,0.0004623005,0.00018046626,0.0005493779,0.0006748623,0.0008484469,0.00038964747],"category_scores_gemma":[0.00266683,0.0004581744,0.00056167005,0.00051133614,0.00040289504,0.0006751357,0.00051442726,0.00095830497,0.00010053169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011457027,0.0000487385,0.0069779702,0.000023684212,0.000050166836,0.000065799075,0.000035086014,0.96471244,0.0025149097,0.0008424037,0.00042040864,0.024193862],"study_design_scores_gemma":[0.0000014787851,0.000005864509,0.00084150187,0.000001002298,0.000002263196,0.000011881177,0.00000252151,0.99819833,0.00014734162,0.0007598948,0.000025860527,0.0000020992993],"about_ca_topic_score_codex":0.0089963395,"about_ca_topic_score_gemma":0.010254389,"teacher_disagreement_score":0.0089963395,"about_ca_system_score_codex":0.00063009333,"about_ca_system_score_gemma":0.000522137,"threshold_uncertainty_score":0.01788795},"labels":[],"label_agreement":null},{"id":"W34706521","doi":"10.1007/978-3-319-08123-6_26","title":"Artificial Astrocyte Networks, as Components in Artificial Neural Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"Memorial University of Newfoundland","funders":"","keywords":"Artificial neural network; Computer science; Neuron; Astrocyte; Nervous system network models; Artificial neuron; Neurophysiology; Neuroscience; Artificial intelligence; Types of artificial neural networks; Time delay neural network; Biology","score_opus":0.03271414925775096,"score_gpt":0.24343685752903566,"score_spread":0.2107227082712847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34706521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034701616,0.025532618,0.85503983,0.0018268379,0.0029182972,0.000064326094,0.00023791681,0.00056698464,0.07911157],"genre_scores_gemma":[0.53913534,0.027857868,0.32680568,0.0005995049,0.0008386102,0.00022399533,0.0004304865,0.00035077665,0.10375779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998939,0.000024841895,0.000007758074,0.000017914459,0.00004512482,0.0000104012315],"domain_scores_gemma":[0.9998883,0.000037532973,0.00001113439,0.000013227423,0.000039627943,0.000010323892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022995265,0.00044839852,0.0003794627,0.00032961054,0.00027842223,0.0013283828,0.0007482618,0.00084081327,0.0021534478],"category_scores_gemma":[0.0007163764,0.00030900814,0.00033167237,0.0005662183,0.0005432863,0.0011799178,0.0007108197,0.0010104424,0.0013177564],"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.00011538213,0.000056127912,0.00049585075,0.0006454873,0.00008423315,0.00020427148,0.00013861313,0.123535715,0.03681961,0.6277175,0.013709405,0.19647783],"study_design_scores_gemma":[0.000020106158,0.00007091096,0.00036000155,0.00011600767,0.00006470175,0.00042119002,0.00006095466,0.49178967,0.018825708,0.38253617,0.105698854,0.000035779918],"about_ca_topic_score_codex":0.00029306224,"about_ca_topic_score_gemma":0.0006384124,"teacher_disagreement_score":0.0021534478,"about_ca_system_score_codex":0.00028466366,"about_ca_system_score_gemma":0.00024756475,"threshold_uncertainty_score":0.007204056},"labels":[],"label_agreement":null},{"id":"W34874223","doi":"10.1007/978-3-642-23544-3_28","title":"Learning Actions in Complex Software Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Computer science; Event (particle physics); Set (abstract data type); Data mining; Process (computing); Euclidean distance; Service (business); Software system; Software architecture; Software; Metric (unit); Service-oriented architecture; Process mining; Web service; Server; Artificial intelligence; Software engineering; Machine learning; Business process; Programming language; World Wide Web; Work in process; Business process management","score_opus":0.05122646729565192,"score_gpt":0.2698560062218605,"score_spread":0.2186295389262086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34874223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088996105,0.0010721126,0.90127605,0.0005486411,0.000040716775,0.00003325029,0.00012728901,0.0005475429,0.0073582097],"genre_scores_gemma":[0.79589504,0.0014107763,0.19359583,0.00008464359,0.00006063522,0.000095030846,0.0004286723,0.000080230086,0.008349124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975115,0.00008186122,0.000015650476,0.000072791096,0.000058109657,0.000020388994],"domain_scores_gemma":[0.9970457,0.0025914584,0.00010281989,0.00010381424,0.000090211724,0.00006600685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511096,0.00049106934,0.00035647632,0.00048268982,0.0002452556,0.0007536242,0.000612226,0.00055068824,0.0027755932],"category_scores_gemma":[0.003910884,0.00026260284,0.0003710199,0.00052618637,0.0008199872,0.0016897122,0.0007987619,0.0012874741,0.00033452726],"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.00010061696,0.00013735578,0.008480491,0.00032751096,0.00007081685,0.00016804034,0.00073299144,0.37247285,0.0030670206,0.11609212,0.0034216456,0.4949286],"study_design_scores_gemma":[0.0000072971657,0.000045727833,0.001185958,0.000038623173,0.000011652721,0.00004125748,0.000101495665,0.8290713,0.0011391361,0.16634095,0.0020079294,0.000008586297],"about_ca_topic_score_codex":0.0026601295,"about_ca_topic_score_gemma":0.0043034134,"teacher_disagreement_score":0.0027755932,"about_ca_system_score_codex":0.00047062922,"about_ca_system_score_gemma":0.00046405973,"threshold_uncertainty_score":0.009285212},"labels":[],"label_agreement":null},{"id":"W34943095","doi":"10.1007/978-3-642-40627-0_6","title":"Parallel Discrepancy-Based Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Backtracking; Computer science; Scalability; Heuristic; Parallel computing; Computation; Supercomputer; Load balancing (electrical power); Massively parallel; Constraint satisfaction problem; Algorithm; Artificial intelligence; Grid","score_opus":0.01845673057410436,"score_gpt":0.2484697395635229,"score_spread":0.23001300898941854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34943095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011823599,0.0009066873,0.95378417,0.0004897186,0.00029251966,0.00009962062,0.0002747077,0.0024686141,0.029860448],"genre_scores_gemma":[0.2515677,0.00055841694,0.7163939,0.00036446308,0.00024861074,0.00032858146,0.0013110553,0.0013568904,0.027870396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986091,0.00032685502,0.00006489142,0.0002634582,0.0005993665,0.0001363538],"domain_scores_gemma":[0.9981787,0.000747429,0.00008218109,0.00059189094,0.0003077775,0.000091946866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566885,0.0012764747,0.0019456382,0.0012703357,0.00083772,0.0016229401,0.0028779225,0.001565305,0.018388186],"category_scores_gemma":[0.005425093,0.0008527783,0.001045338,0.0024886783,0.0011229145,0.0025599198,0.003727755,0.002855054,0.0041187294],"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.00086254533,0.00028237142,0.0005264804,0.00034124823,0.00010086581,0.0000893446,0.00011818009,0.33142078,0.0042823046,0.18771756,0.03148801,0.44277033],"study_design_scores_gemma":[0.00010640508,0.00006098122,0.00011837922,0.000026795256,0.000020744195,0.00007827896,0.000020971274,0.86409605,0.0018739908,0.12334709,0.010235205,0.000015164421],"about_ca_topic_score_codex":0.0020502605,"about_ca_topic_score_gemma":0.002794616,"teacher_disagreement_score":0.018388186,"about_ca_system_score_codex":0.0012307181,"about_ca_system_score_gemma":0.001602919,"threshold_uncertainty_score":0.061514616},"labels":[],"label_agreement":null},{"id":"W3498247","doi":"10.1007/978-3-319-07887-8_52","title":"Development of a Micro-Simulation Model for Breast Cancer to Evaluate the Impacts of Personalized Early Detection Strategies","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Global Cancer Incidence and Screening","field":"Medicine","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":"BC Cancer Agency","funders":"","keywords":"Breast cancer; Medicine; Mammography; Context (archaeology); Breast cancer screening; Health care; Cancer; Population; Oncology; Intensive care medicine; Medical physics; Internal medicine; Environmental health","score_opus":0.07336944040907732,"score_gpt":0.35690733850659473,"score_spread":0.2835378980975174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3498247","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.30670345,0.0013682027,0.63277733,0.00233134,0.00046369046,0.0004981357,0.0050352304,0.001773945,0.049048632],"genre_scores_gemma":[0.87816143,0.0008321217,0.10572128,0.00031881375,0.00007053976,0.00067130564,0.0018426212,0.00024243016,0.012139348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982363,0.000062798514,0.000009832731,0.000026744197,0.000044218126,0.000032876233],"domain_scores_gemma":[0.99837375,0.0011910041,0.00008694045,0.000054245334,0.0002257013,0.00006845949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004450731,0.00058164244,0.0010165477,0.0004887452,0.00043339553,0.0008076206,0.0017184607,0.0018311903,0.0071399794],"category_scores_gemma":[0.0022205368,0.0005704372,0.001105355,0.0005655915,0.00036028164,0.00046401063,0.0005582686,0.0011421165,0.0006194359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014184611,0.00001640516,0.00030837467,0.000013251808,0.000009741784,0.000016214497,0.000006082675,0.9974847,0.00018981514,0.00083778735,0.00018570885,0.0009177002],"study_design_scores_gemma":[0.000008716579,0.000009232753,0.00007721184,0.0000026298992,0.0000055305172,0.0000048919464,0.000004298041,0.99917185,0.000113954346,0.0003812212,0.00021724676,0.0000031488687],"about_ca_topic_score_codex":0.039550163,"about_ca_topic_score_gemma":0.01957686,"teacher_disagreement_score":0.039550163,"about_ca_system_score_codex":0.0010554941,"about_ca_system_score_gemma":0.001924919,"threshold_uncertainty_score":0.078639925},"labels":[],"label_agreement":null},{"id":"W35038405","doi":"10.1007/978-3-319-07440-5_10","title":"Accessible Metadata Generation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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":"Ontario College of Art and Design","funders":"","keywords":"Metadata; Computer science; Personalization; Suite; World Wide Web; Process (computing); Matching (statistics); Geospatial metadata; Point (geometry); Metadata repository; Information retrieval; Meta Data Services","score_opus":0.053608427081714344,"score_gpt":0.31810502796664,"score_spread":0.26449660088492566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35038405","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.007884281,0.0013603647,0.8237888,0.0012036231,0.0011981397,0.00042207976,0.003911619,0.020000977,0.1402301],"genre_scores_gemma":[0.18367115,0.0032974167,0.55185497,0.00097053865,0.00044396418,0.00066702615,0.029641964,0.007399837,0.22205319],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986066,0.00022936394,0.0001030569,0.00021837003,0.0007448122,0.00009767779],"domain_scores_gemma":[0.99788815,0.0004387438,0.00005295701,0.0010572359,0.00049254124,0.000070489754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016342246,0.0008548879,0.00049674377,0.0032857521,0.001183654,0.004113098,0.0018194729,0.0011147131,0.04172591],"category_scores_gemma":[0.0054195,0.0005317975,0.0009046239,0.0032365215,0.0007065261,0.0066821487,0.004572846,0.0016521668,0.016026003],"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.00016958182,0.00018512315,0.00060992636,0.0003995233,0.00003523443,0.00035336913,0.0006645581,0.002589315,0.011100495,0.23840664,0.08692891,0.6585573],"study_design_scores_gemma":[0.000043621545,0.00005561569,0.0005716551,0.00038954537,0.000075218166,0.00072625093,0.00047737153,0.03774372,0.054446183,0.2139208,0.69147295,0.00007710715],"about_ca_topic_score_codex":0.001235851,"about_ca_topic_score_gemma":0.0014322698,"teacher_disagreement_score":0.04172591,"about_ca_system_score_codex":0.00076325523,"about_ca_system_score_gemma":0.0011510206,"threshold_uncertainty_score":0.13958704},"labels":[],"label_agreement":null},{"id":"W3514895","doi":"10.1007/978-3-642-31037-9_18","title":"Towards a Data-Driven Approach to Intervention Design: A Predictive Path Model of Healthy Eating Determinants","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Psychological intervention; Eating behavior; Intervention (counseling); Psychology; Healthy eating; Variance (accounting); Obesity; Path analysis (statistics); Variables; Applied psychology; Social psychology; Developmental psychology; Computer science; Medicine; Physical activity; Machine learning; Psychiatry","score_opus":0.17970984407254287,"score_gpt":0.4027798277733501,"score_spread":0.22306998370080722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3514895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045244703,0.0000980698,0.9934505,0.0007157199,0.000021768872,0.00020530442,0.0002223754,0.00021286683,0.0005487872],"genre_scores_gemma":[0.15042558,0.0003195829,0.84525424,0.0003762631,0.000038633247,0.0021113364,0.0005586578,0.00012506313,0.0007906224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924238,0.006096625,0.00021335129,0.000659986,0.00047938575,0.00012696584],"domain_scores_gemma":[0.9553389,0.04095789,0.00080188573,0.0011222227,0.0014388369,0.00034028306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016323451,0.0015426289,0.0020526473,0.0016749958,0.0006836502,0.0032429148,0.003154243,0.0018279159,0.00470468],"category_scores_gemma":[0.05576898,0.0020927,0.0018733016,0.001864832,0.0016669212,0.0037531846,0.0024898078,0.0043207374,0.0005899978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007540557,0.00078735827,0.009617085,0.0010393244,0.00094997726,0.000202268,0.001403373,0.59275997,0.0013247676,0.1685165,0.0058184504,0.21682692],"study_design_scores_gemma":[0.00009616922,0.00013142117,0.0006147996,0.000103983526,0.00013655542,0.000027941769,0.00010624709,0.81548923,0.00030420526,0.18181711,0.0011427128,0.000029647315],"about_ca_topic_score_codex":0.0057984046,"about_ca_topic_score_gemma":0.0069905296,"teacher_disagreement_score":0.016323451,"about_ca_system_score_codex":0.0018774878,"about_ca_system_score_gemma":0.0047904225,"threshold_uncertainty_score":0.08632767},"labels":[],"label_agreement":null},{"id":"W351801676","doi":"10.1007/978-3-319-07046-9_32","title":"A Constraint Programming-Based Column Generation Approach for Operating Room Planning and Scheduling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Computer science; Column generation; Constraint programming; Scheduling (production processes); Column (typography); Constraint logic programming; Constraint satisfaction; Mathematical optimization; Artificial intelligence; Stochastic programming; Telecommunications; Mathematics","score_opus":0.08566073471279212,"score_gpt":0.3750879163069074,"score_spread":0.2894271815941153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W351801676","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.0024686756,0.00014698299,0.9935548,0.00011978408,0.00005727124,0.00011730951,0.00021775444,0.00069922267,0.0026181522],"genre_scores_gemma":[0.062373325,0.00020587015,0.93398464,0.00015203992,0.000053338623,0.00030047804,0.0005437224,0.00027460678,0.0021120121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990941,0.0002799133,0.000045810044,0.00013509697,0.00033926798,0.000105670166],"domain_scores_gemma":[0.9984144,0.0009561801,0.00007844868,0.00011187041,0.0003657551,0.00007333059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698095,0.001259336,0.0014023342,0.0012422707,0.0008361561,0.0015186253,0.0030837844,0.001256274,0.009496293],"category_scores_gemma":[0.0026929074,0.001091384,0.0017354493,0.002872935,0.0005369272,0.0011646831,0.0012306707,0.0022539278,0.0011119784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008256507,0.00014894079,0.00019088587,0.00014163466,0.00005736185,0.0001059443,0.00005165746,0.85572344,0.0021987231,0.011474893,0.0075100656,0.12231393],"study_design_scores_gemma":[0.000010102192,0.000011779309,0.00003372604,0.000005899973,0.0000076048295,0.000011795451,0.000006657183,0.99613935,0.00034089896,0.0026485915,0.00077745673,0.00000613172],"about_ca_topic_score_codex":0.025816506,"about_ca_topic_score_gemma":0.027666112,"teacher_disagreement_score":0.025816506,"about_ca_system_score_codex":0.0011867948,"about_ca_system_score_gemma":0.002404623,"threshold_uncertainty_score":0.051332474},"labels":[],"label_agreement":null},{"id":"W35270298","doi":"10.1007/978-3-540-88425-5_41","title":"Experiments with Rough Set Approach to Face Recognition","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Rough set; Classifier (UML); Artificial intelligence; Probabilistic logic; Pattern recognition (psychology); Facial recognition system; Principal component analysis; Dominance-based rough set approach; Feature extraction; Data mining","score_opus":0.05218499885867423,"score_gpt":0.25462372433845953,"score_spread":0.2024387254797853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35270298","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.88937527,0.0008992801,0.101555735,0.00022124103,0.0003197074,0.0004437128,0.000759643,0.0008493253,0.00557614],"genre_scores_gemma":[0.91154575,0.0005367433,0.08166596,0.00008488472,0.000050968905,0.00020957322,0.0011765127,0.00012517974,0.0046044155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863654,0.0005474292,0.00011169487,0.00022194076,0.00034998794,0.00013241849],"domain_scores_gemma":[0.9949935,0.0035504,0.000089688154,0.0007594728,0.0005156269,0.00009135972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001875414,0.0007323638,0.0011656921,0.00082664826,0.0005261462,0.0008908436,0.0009151951,0.0009796768,0.0039107352],"category_scores_gemma":[0.0077211345,0.00035901784,0.00090375374,0.0007613117,0.00053575094,0.0011426514,0.0006610076,0.0008125052,0.0010116464],"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.011599099,0.0054957285,0.0065312604,0.0014636166,0.0004944021,0.0006551741,0.0014657014,0.13357498,0.19603677,0.004743984,0.0074282135,0.630511],"study_design_scores_gemma":[0.00042278282,0.0055169016,0.014553403,0.0000751698,0.0003875437,0.0008243865,0.0010750776,0.8386119,0.12852946,0.0060396,0.0038105503,0.00015311754],"about_ca_topic_score_codex":0.0033744439,"about_ca_topic_score_gemma":0.0011665868,"teacher_disagreement_score":0.0039107352,"about_ca_system_score_codex":0.00036190974,"about_ca_system_score_gemma":0.00027477642,"threshold_uncertainty_score":0.013082743},"labels":[],"label_agreement":null},{"id":"W35382807","doi":"10.1007/978-3-319-07446-7_25","title":"Recovery Prediction in the Framework of Cloud-Based Rehabilitation Exergame","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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 Ottawa","funders":"","keywords":"Dynamic time warping; Rehabilitation; Computer science; Session (web analytics); Cloud computing; Movement (music); Artificial intelligence; Physical medicine and rehabilitation; Simulation; Machine learning; Physical therapy; Medicine","score_opus":0.009828344982980136,"score_gpt":0.2538963197970011,"score_spread":0.24406797481402098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35382807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36286852,0.0030121773,0.6168922,0.0009772638,0.00026584184,0.00029807905,0.0013590446,0.0030763717,0.011250437],"genre_scores_gemma":[0.9505212,0.0005182356,0.04476892,0.00008479196,0.000050114497,0.000071146416,0.00062429527,0.000039332393,0.003322072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982494,0.0000224049,0.000008771534,0.00006052734,0.000030807856,0.00005260271],"domain_scores_gemma":[0.9998709,0.00005253895,0.0000106619,0.000008597384,0.000035179655,0.000022226795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036303455,0.00061615417,0.000819811,0.0003494834,0.0002788837,0.0007476749,0.0009427161,0.0005201319,0.0025914477],"category_scores_gemma":[0.0006304979,0.00020580165,0.00046389076,0.00034161226,0.00014900051,0.0006146002,0.0005909894,0.0005364075,0.00048149252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015600764,0.0009942814,0.036281925,0.00028993466,0.00026518528,0.0008536009,0.00016022864,0.5878977,0.009553055,0.0069768843,0.01230499,0.3428622],"study_design_scores_gemma":[0.000007222973,0.000039675924,0.0025848178,0.0000058615437,0.000018457722,0.00004193207,0.000023717528,0.995237,0.00060646125,0.001120246,0.00030832953,0.0000062975623],"about_ca_topic_score_codex":0.017771963,"about_ca_topic_score_gemma":0.0167907,"teacher_disagreement_score":0.017771963,"about_ca_system_score_codex":0.00046572997,"about_ca_system_score_gemma":0.0007275458,"threshold_uncertainty_score":0.03533703},"labels":[],"label_agreement":null},{"id":"W35429012","doi":"10.1007/978-3-319-08599-9_62","title":"TerpTube: A Signed Language Mentoring Management System","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hearing Impairment and Communication","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interpreter; Asynchronous communication; Sign language; Computer science; American Sign Language; Face (sociological concept); Language interpretation; Multimedia; Human–computer interaction; Interface (matter); Linguistics; Programming language","score_opus":0.01817995200682969,"score_gpt":0.28692475687186697,"score_spread":0.26874480486503727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35429012","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.057821862,0.00063763116,0.5336938,0.0008616189,0.00090719655,0.0013231343,0.0061626267,0.32646114,0.072131045],"genre_scores_gemma":[0.26226062,0.0009171897,0.34845302,0.0008497702,0.00041374503,0.0020078097,0.018733755,0.019821644,0.34654242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950933,0.000114216346,0.00004370173,0.00004625711,0.00023141419,0.000055115554],"domain_scores_gemma":[0.9989249,0.00029401638,0.00007872297,0.0002203211,0.00019805702,0.0002840076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095879915,0.00058372144,0.00039206963,0.000772766,0.0005492668,0.0011930065,0.0013834836,0.0006028601,0.043661036],"category_scores_gemma":[0.002521152,0.00028069253,0.00032997777,0.0006035198,0.00018034069,0.001426328,0.0028177437,0.0008774708,0.01501836],"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.0010120551,0.00043048355,0.0013294183,0.00022285308,0.000032965574,0.00026739718,0.00042199498,0.0014333605,0.0229318,0.0031980828,0.166628,0.8020915],"study_design_scores_gemma":[0.0008443566,0.0013276084,0.009077831,0.00019337922,0.00013762305,0.0019024494,0.00068473385,0.08598799,0.08527879,0.0127526745,0.80145407,0.00035854502],"about_ca_topic_score_codex":0.0006607097,"about_ca_topic_score_gemma":0.0012059709,"teacher_disagreement_score":0.043661036,"about_ca_system_score_codex":0.00027233397,"about_ca_system_score_gemma":0.00073440315,"threshold_uncertainty_score":0.1460607},"labels":[],"label_agreement":null},{"id":"W35468436","doi":"10.1007/978-3-642-54756-0_3","title":"Proximity System: A Description-Based System for Quantifying the Nearness or Apartness of Visual Rough Sets","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Winnipeg","funders":"","keywords":"Computer science; Pixel; Rough set; Partition (number theory); Intersection (aeronautics); Artificial intelligence; Human visual system model; Context (archaeology); Set (abstract data type); Pattern recognition (psychology); Image (mathematics); Data mining; Mathematics; Cartography; Geography","score_opus":0.06173934184874003,"score_gpt":0.2924642433047425,"score_spread":0.2307249014560025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35468436","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.013788479,0.0003532644,0.979844,0.0000887411,0.000065423985,0.00014206886,0.0007663474,0.0020031845,0.002948489],"genre_scores_gemma":[0.33700746,0.00057319965,0.6560768,0.00011254262,0.00009645975,0.00031026945,0.001746333,0.00022900177,0.003847952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846065,0.00030360083,0.00014546674,0.00034709723,0.00065604807,0.00008711053],"domain_scores_gemma":[0.99893254,0.0003456283,0.00017230464,0.00016069047,0.0002961187,0.00009270722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00143364,0.00073822594,0.0009963989,0.0036794108,0.00058365223,0.003087576,0.0012265285,0.00087492354,0.003951633],"category_scores_gemma":[0.0042918865,0.000417063,0.0013086387,0.0023742295,0.001067944,0.0033259415,0.0028212161,0.000971101,0.0011614099],"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.0007859785,0.00019765367,0.008807362,0.0014469944,0.00035249058,0.00047999193,0.0019417125,0.04879762,0.05226042,0.15138276,0.016011186,0.71753573],"study_design_scores_gemma":[0.000089540496,0.000489344,0.009622698,0.00023244516,0.00040169584,0.0010475072,0.0010900112,0.7920906,0.035619564,0.11954171,0.03946808,0.00030683773],"about_ca_topic_score_codex":0.0030845439,"about_ca_topic_score_gemma":0.0020065038,"teacher_disagreement_score":0.003951633,"about_ca_system_score_codex":0.0009789319,"about_ca_system_score_gemma":0.00092691544,"threshold_uncertainty_score":0.013219535},"labels":[],"label_agreement":null},{"id":"W35595736","doi":"10.1007/978-3-642-37140-0_16","title":"Knowledge Transfer Strategies for Vector Evaluated Particle Swarm Optimization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Brock University","funders":"","keywords":"Particle swarm optimization; Crossover; Computer science; Multi-swarm optimization; Inefficiency; Swarm behaviour; Mathematical optimization; Set (abstract data type); Algorithm; Artificial intelligence; Mathematics","score_opus":0.030469963994475928,"score_gpt":0.29060637780074855,"score_spread":0.2601364138062726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35595736","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.005267414,0.000646512,0.98444116,0.00013898833,0.00011155816,0.000055041735,0.000019725656,0.00011664689,0.009203084],"genre_scores_gemma":[0.6565151,0.0012021746,0.3160106,0.0003225322,0.0002658148,0.0006257688,0.0001753972,0.00021335509,0.024669245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996119,0.00013633785,0.000024646793,0.000038523765,0.00015300325,0.00003563151],"domain_scores_gemma":[0.9992843,0.0004356206,0.000047574053,0.00004584901,0.0001604937,0.000026289932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012307134,0.001113968,0.0011383351,0.00066519115,0.00048281084,0.0012848091,0.0017559312,0.0017016424,0.0049272026],"category_scores_gemma":[0.0034804924,0.00044091066,0.00061985845,0.00083540304,0.00084592984,0.0014316556,0.0019005518,0.0013193155,0.0008528929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008344055,0.00009024682,0.00011252969,0.0001686729,0.000058123427,0.00006691637,0.0000816554,0.80712414,0.00165539,0.054169994,0.0029128655,0.13347612],"study_design_scores_gemma":[0.000006602713,0.000024075396,0.00002476753,0.000007936202,0.0000042662814,0.0000068942104,0.0000056886925,0.9917857,0.00018231779,0.0075350464,0.0004132414,0.000003402862],"about_ca_topic_score_codex":0.0028755711,"about_ca_topic_score_gemma":0.0019051544,"teacher_disagreement_score":0.0049272026,"about_ca_system_score_codex":0.000795805,"about_ca_system_score_gemma":0.0006447407,"threshold_uncertainty_score":0.016483068},"labels":[],"label_agreement":null},{"id":"W35907325","doi":"10.1007/978-3-642-31594-7_2","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Combinatorics; Communication complexity; Physics; Function (biology); Mathematics; Discrete mathematics","score_opus":0.04896195018404148,"score_gpt":0.2646787093088615,"score_spread":0.21571675912482002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35907325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1769479,0.0071572186,0.48628846,0.020474574,0.0011079204,0.00019362677,0.0016007768,0.00060434575,0.30562523],"genre_scores_gemma":[0.899152,0.003659419,0.045690596,0.0010872524,0.002024243,0.0006254024,0.0008721001,0.0004939246,0.046395022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947055,0.0017143145,0.00021735312,0.000882743,0.0016005912,0.00087953254],"domain_scores_gemma":[0.9706232,0.022913074,0.0009041056,0.003548511,0.0011225094,0.00088861084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081412,0.0013121101,0.0024397713,0.001870424,0.003043659,0.006908983,0.0040583373,0.004499347,0.014244404],"category_scores_gemma":[0.025765348,0.0011813472,0.0022603655,0.002430611,0.004903737,0.022680454,0.004479717,0.009280307,0.0018135459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071088216,0.000030306679,0.0002049426,0.000083659164,0.000018051871,0.000037558086,0.00010490218,0.007810835,0.00027158562,0.97808707,0.0037987893,0.009481196],"study_design_scores_gemma":[0.000010246981,0.0000067258343,0.00014236278,0.000017997721,0.000010987893,0.000044327266,0.00001818842,0.018759679,0.00020525885,0.97933394,0.0014386346,0.000011558817],"about_ca_topic_score_codex":0.0010834014,"about_ca_topic_score_gemma":0.00074402645,"teacher_disagreement_score":0.014244404,"about_ca_system_score_codex":0.005632318,"about_ca_system_score_gemma":0.0021520609,"threshold_uncertainty_score":0.047652304},"labels":[],"label_agreement":null},{"id":"W36522252","doi":"10.1007/978-3-319-07527-3_3","title":"Untangling Operator Monitoring Approaches When Designing Intelligent Adaptive Systems for Operational Environments","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Operator (biology); Software engineering; Real-time computing; Distributed computing; Systems engineering; Engineering","score_opus":0.09632047085518865,"score_gpt":0.31448329931045566,"score_spread":0.21816282845526702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36522252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006772875,0.0009518172,0.98501587,0.0002799815,0.000047046524,0.000027512588,0.000006477259,0.00020780282,0.006690602],"genre_scores_gemma":[0.36012697,0.0019981007,0.62865573,0.00020974042,0.00007014665,0.00008341703,0.00002996379,0.00018518901,0.0086407475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991885,0.0003106613,0.000042053056,0.00015551345,0.00025679014,0.00004652572],"domain_scores_gemma":[0.99807525,0.0013607102,0.000118649645,0.00023703885,0.00016377134,0.000044646553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012658035,0.00080235576,0.0003262099,0.00030185818,0.0004465262,0.0020396244,0.0011681548,0.0011093018,0.0026157147],"category_scores_gemma":[0.0040174113,0.00063368445,0.0004598965,0.00026768717,0.0008821398,0.0041438066,0.0012230678,0.0019299816,0.000599257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001290863,0.00012564502,0.0012951771,0.00068880804,0.00008508504,0.0002794997,0.0024738286,0.10661393,0.06301183,0.14753671,0.0024189227,0.6753414],"study_design_scores_gemma":[0.000022137127,0.0003758841,0.0012417875,0.0003627315,0.0001729516,0.00058650563,0.0008249879,0.65958804,0.038903818,0.23974597,0.058105398,0.00006970578],"about_ca_topic_score_codex":0.00070569234,"about_ca_topic_score_gemma":0.002429409,"teacher_disagreement_score":0.0026157147,"about_ca_system_score_codex":0.0003731978,"about_ca_system_score_gemma":0.0005452239,"threshold_uncertainty_score":0.008750439},"labels":[],"label_agreement":null},{"id":"W36751344","doi":"10.1007/978-3-642-37192-9_20","title":"On the Utility of Trading Criteria Based Retraining in Forex Markets","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"Dalhousie University","funders":"","keywords":"Retraining; Foreign exchange market; Business; Foreign exchange; Computer science; Financial economics; Economics; Monetary economics; International trade","score_opus":0.048440032444271454,"score_gpt":0.2936856222458886,"score_spread":0.24524558980161718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36751344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33656064,0.009084823,0.6213225,0.0038470367,0.00062468665,0.0001845993,0.00014960073,0.0008555107,0.027370581],"genre_scores_gemma":[0.9548903,0.0008510177,0.03708775,0.0003434739,0.00021236928,0.00004199215,0.00007653997,0.00013254833,0.006364046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880266,0.000683044,0.00005880129,0.00011657133,0.00019469408,0.0001442831],"domain_scores_gemma":[0.98435694,0.01361673,0.00042766213,0.0005915148,0.000726129,0.0002809707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065949773,0.0011401615,0.0017849054,0.0005779653,0.00065974507,0.0015860677,0.0023633083,0.0019330069,0.0039966456],"category_scores_gemma":[0.026945002,0.00037749088,0.00048929197,0.0006045036,0.0013754442,0.0030902647,0.0012847424,0.0026527024,0.00029559052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014892663,0.00045664338,0.001950509,0.00022191198,0.00012703243,0.00022552742,0.0001353582,0.7883879,0.0015909702,0.05990394,0.005111082,0.14039987],"study_design_scores_gemma":[0.000031194228,0.00010226964,0.00023528513,0.000020083293,0.000019289175,0.000026454587,0.000017259334,0.9799534,0.00034750343,0.019052545,0.00018768712,0.000006976934],"about_ca_topic_score_codex":0.002896168,"about_ca_topic_score_gemma":0.0018733401,"teacher_disagreement_score":0.0065949773,"about_ca_system_score_codex":0.00077472365,"about_ca_system_score_gemma":0.0010117418,"threshold_uncertainty_score":0.034877956},"labels":[],"label_agreement":null},{"id":"W36765866","doi":"10.1007/978-3-642-25289-1_45","title":"The Reading Glove: A Non-linear Adaptive Tangible Narrative","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Narrative; Computer science; Reading (process); Human–computer interaction; Multimedia; World Wide Web; Art; Literature; Linguistics","score_opus":0.039695281977111904,"score_gpt":0.28251665902655115,"score_spread":0.24282137704943924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36765866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03689752,0.0009778873,0.7296323,0.0010433588,0.00037538103,0.00035873667,0.0004297305,0.004800888,0.22548419],"genre_scores_gemma":[0.37221056,0.0010445283,0.38823378,0.0004929993,0.000068101144,0.0004933142,0.0007511626,0.0009593178,0.23574632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.000074797485,0.000010048265,0.000045249137,0.00006441604,0.000021580476],"domain_scores_gemma":[0.9996973,0.00015672074,0.000017357326,0.000054343982,0.000031190582,0.000042988482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003304418,0.00070036866,0.00029158933,0.00027431236,0.0006156781,0.0023983857,0.0014543335,0.0011500579,0.044155985],"category_scores_gemma":[0.0015774777,0.00030594223,0.00041212124,0.00022882914,0.0008717157,0.0027699617,0.0032934428,0.0010652092,0.0051755914],"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.0006518581,0.00029167233,0.0008536305,0.0014887104,0.00006766032,0.0012869422,0.0146467015,0.0115544405,0.061086126,0.3377129,0.05256682,0.51779264],"study_design_scores_gemma":[0.0002578062,0.0010137768,0.001908474,0.00089411356,0.000116554416,0.0029004877,0.007213305,0.1091551,0.030574284,0.15473111,0.69102997,0.00020510418],"about_ca_topic_score_codex":0.00044712998,"about_ca_topic_score_gemma":0.00096104766,"teacher_disagreement_score":0.044155985,"about_ca_system_score_codex":0.00027772257,"about_ca_system_score_gemma":0.000368571,"threshold_uncertainty_score":0.14771646},"labels":[],"label_agreement":null},{"id":"W37006938","doi":"10.1007/978-3-540-39701-4_27","title":"Multimodal Registration Using Patch Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle License Plate Recognition","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":"National Research Council Institute for Biodiagnostics","funders":"","keywords":"Artificial intelligence; Computer vision; Affine transformation; Image registration; Computer science; Pattern recognition (psychology); Algorithm; Image (mathematics); Mathematics","score_opus":0.017765786782072232,"score_gpt":0.22874015306939743,"score_spread":0.2109743662873252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37006938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075765518,0.00023144051,0.98449045,0.00004424835,0.0001031732,0.000069445196,0.00010947552,0.0029195866,0.0044555864],"genre_scores_gemma":[0.08300005,0.00039483263,0.89796513,0.0000828035,0.00009587911,0.00011085638,0.0009497601,0.0013242193,0.016076498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.00006170086,0.000020980053,0.00019931246,0.00017180892,0.00006495379],"domain_scores_gemma":[0.9996736,0.000038576294,0.000019611303,0.00016276703,0.00008525792,0.00002013541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004618497,0.0008836881,0.0012745393,0.0016162066,0.00053351966,0.0012052107,0.001030271,0.0009786073,0.015979316],"category_scores_gemma":[0.00088188594,0.00050269335,0.0012068569,0.0016321151,0.00044578983,0.0012754435,0.001562475,0.000881762,0.0107524395],"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.00024494177,0.00006439638,0.0004339832,0.00011896426,0.0000896875,0.00009240855,0.000067098175,0.0074988618,0.101047,0.005814497,0.008637947,0.8758902],"study_design_scores_gemma":[0.000069199385,0.00045392645,0.0053196847,0.000058901343,0.0003242059,0.002777035,0.00017832353,0.6366921,0.26035243,0.01578381,0.077868044,0.00012235256],"about_ca_topic_score_codex":0.0011034607,"about_ca_topic_score_gemma":0.0016256851,"teacher_disagreement_score":0.015979316,"about_ca_system_score_codex":0.00025403357,"about_ca_system_score_gemma":0.00048814926,"threshold_uncertainty_score":0.053456128},"labels":[],"label_agreement":null},{"id":"W37052258","doi":"10.1007/978-3-642-30054-7_25","title":"Maximizing Lifetime of Connected-Dominating-Set in Cognitive Radio Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cognitive radio; Computer science; Overhead (engineering); Connected dominating set; Set (abstract data type); Pruning; Wireless; Bounded function; Distributed computing; Computer network; Optimization problem; Wireless network; Mathematical optimization; Algorithm; Telecommunications; Mathematics","score_opus":0.018110803450929382,"score_gpt":0.2454469551420453,"score_spread":0.2273361516911159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37052258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066423595,0.0046830107,0.91232735,0.0008119434,0.00021284544,0.00013342488,0.0002176765,0.0003120221,0.014878214],"genre_scores_gemma":[0.8604543,0.005233791,0.12479095,0.0002827343,0.00034480487,0.00031582153,0.00021918846,0.00026105493,0.008097191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992551,0.00029181116,0.000029259849,0.00014070589,0.00019473881,0.0000882834],"domain_scores_gemma":[0.997888,0.0015641123,0.00011682322,0.00009313613,0.00021903122,0.000118864074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014982439,0.0015678119,0.0015424833,0.00088844215,0.0006089421,0.0012826163,0.002372377,0.001352018,0.0015345585],"category_scores_gemma":[0.005843533,0.0006017496,0.0006462356,0.001344804,0.00094774953,0.0021753926,0.0013045501,0.0009861914,0.00024898432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017470337,0.00009022304,0.00040628508,0.0006093695,0.00009053151,0.000119307675,0.00028956353,0.81494504,0.006443153,0.09736288,0.0054417504,0.074027225],"study_design_scores_gemma":[0.000018432069,0.00008198818,0.0001423575,0.000045402965,0.000035213176,0.00013523214,0.000040202325,0.91883045,0.0011319846,0.07798445,0.0015386976,0.000015512374],"about_ca_topic_score_codex":0.00089136197,"about_ca_topic_score_gemma":0.0009397818,"teacher_disagreement_score":0.002372377,"about_ca_system_score_codex":0.0017344673,"about_ca_system_score_gemma":0.0007730279,"threshold_uncertainty_score":0.012584507},"labels":[],"label_agreement":null},{"id":"W37361839","doi":"10.1007/978-3-642-41392-6_10","title":"Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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":"McMaster University","funders":"","keywords":"Reputation; Computer science; Price of anarchy; Operator (biology); Complete information; Routing (electronic design automation); Order (exchange); Trustworthiness; Game theory; Commodity; Mathematical economics; Computer security; Computer network; Economics; Price of stability","score_opus":0.07362549245182819,"score_gpt":0.32760947868987556,"score_spread":0.25398398623804735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37361839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08020822,0.0007364387,0.9068799,0.0012576886,0.00023566568,0.00006665042,0.00008525751,0.0003861179,0.010143992],"genre_scores_gemma":[0.9210703,0.00041492746,0.06873067,0.00013829036,0.00018723501,0.000067900815,0.00004864514,0.00015423726,0.009187751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616855,0.0023593341,0.00015488044,0.00054338295,0.00041478072,0.0003591071],"domain_scores_gemma":[0.9721624,0.0208347,0.002114735,0.0030035097,0.0011492507,0.00073523144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006448934,0.0010261221,0.00243927,0.0012800065,0.0013136832,0.0029992724,0.003991823,0.003591184,0.0031728998],"category_scores_gemma":[0.03062281,0.0015104365,0.0017517396,0.0013687771,0.0034361277,0.009170034,0.0027752619,0.0031488128,0.00048540934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035586162,0.0001267271,0.0011180917,0.00021826719,0.00019196322,0.00024183614,0.00029574527,0.5033593,0.0018397442,0.4539943,0.0028345447,0.03542362],"study_design_scores_gemma":[0.000025281986,0.000059738883,0.00011975445,0.000021011738,0.00004951842,0.00008240129,0.00003615921,0.75820553,0.00034513627,0.24050033,0.000514011,0.000041059968],"about_ca_topic_score_codex":0.0018313141,"about_ca_topic_score_gemma":0.0019587025,"teacher_disagreement_score":0.006448934,"about_ca_system_score_codex":0.002173249,"about_ca_system_score_gemma":0.0010508773,"threshold_uncertainty_score":0.03410566},"labels":[],"label_agreement":null},{"id":"W37577332","doi":"10.1007/978-3-642-22056-2_25","title":"A Systematic Review of Compliance Measurement Based on Goals and Indicators","year":2011,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"Compliance (psychology); Performance indicator; Process management; Process (computing); Corporate governance; Computer science; Performance measurement; Knowledge management; Management science; Accounting; Business; Engineering; Psychology; Marketing","score_opus":0.07460921552092897,"score_gpt":0.2925578831402833,"score_spread":0.21794866761935433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37577332","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027843607,0.9916619,0.0016217654,0.00067445374,0.00029582973,0.0014861249,0.000867612,0.00002749077,0.0005804326],"genre_scores_gemma":[0.05142185,0.931587,0.011493692,0.0013527783,0.00014273892,0.0026803177,0.0010747836,0.000028945433,0.00021799238],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9219432,0.026952196,0.03339423,0.0038076497,0.0132328635,0.000669839],"domain_scores_gemma":[0.83605206,0.10745636,0.033102084,0.004062364,0.01817639,0.0011506431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.057810806,0.002357586,0.011539266,0.023774555,0.0012519045,0.0035808047,0.004458081,0.002676873,0.0024526746],"category_scores_gemma":[0.18969606,0.0018540819,0.008799423,0.01964871,0.002269904,0.005161153,0.0033919767,0.0018851955,0.0003071387],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031973788,0.000038906124,0.0028392174,0.87380743,0.013454404,0.00009075471,0.0005659167,0.00015408699,0.00022454103,0.00050186616,0.0024566646,0.105546474],"study_design_scores_gemma":[0.00051283167,0.0004914018,0.008590973,0.8657611,0.092572756,0.00041829486,0.0008110493,0.00021633778,0.00060588436,0.0011978069,0.028707206,0.00011431097],"about_ca_topic_score_codex":0.008362775,"about_ca_topic_score_gemma":0.027239403,"teacher_disagreement_score":0.057810806,"about_ca_system_score_codex":0.005580473,"about_ca_system_score_gemma":0.027910508,"threshold_uncertainty_score":0.30573636},"labels":[],"label_agreement":null},{"id":"W37989463","doi":"10.1007/978-3-642-39371-6_33","title":"User-Centered Investigation of Social Commerce Design","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":28,"is_retracted":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":"Social commerce; Perspective (graphical); Point (geometry); Perception; Computer science; World Wide Web; Human–computer interaction; Knowledge management; Social media; Psychology; Artificial intelligence","score_opus":0.043301240319683354,"score_gpt":0.27718492001365325,"score_spread":0.2338836796939699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37989463","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.76289916,0.0007040099,0.068720594,0.0012028223,0.000054184176,0.0002957209,0.00013274181,0.00023538913,0.1657554],"genre_scores_gemma":[0.9797497,0.000120431745,0.01282712,0.00008580421,0.000012733775,0.00008259481,0.000057219502,0.000055990044,0.007008471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9949681,0.0036478038,0.00011687619,0.00030424332,0.00081343605,0.00014953625],"domain_scores_gemma":[0.98057425,0.014755158,0.00089384045,0.00168363,0.0015425198,0.0005505048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004574444,0.00044975808,0.0002946617,0.002174755,0.00165691,0.0065217665,0.00095781265,0.001091388,0.006758833],"category_scores_gemma":[0.014064909,0.00049636373,0.00044290783,0.0017168467,0.0030826984,0.005060445,0.0017723487,0.0010408796,0.00070488144],"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.0006690668,0.0011217998,0.06560599,0.0004991057,0.000095081276,0.0006933323,0.1835021,0.0013964165,0.011367878,0.57292354,0.0033509857,0.15877472],"study_design_scores_gemma":[0.00018386445,0.0021207875,0.15304218,0.00065367384,0.00029591203,0.0026773037,0.19497749,0.080615,0.029911531,0.37931654,0.15597184,0.00023390404],"about_ca_topic_score_codex":0.0012274694,"about_ca_topic_score_gemma":0.0016331908,"teacher_disagreement_score":0.006758833,"about_ca_system_score_codex":0.0016199265,"about_ca_system_score_gemma":0.00137359,"threshold_uncertainty_score":0.024192274},"labels":[],"label_agreement":null},{"id":"W3814096","doi":"10.1007/978-3-642-35139-6_33","title":"Rule Measures Tradeoff Using Game-Theoretic Rough Sets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Probabilistic logic; Computer science; Competition (biology); Set (abstract data type); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.037948091763445796,"score_gpt":0.2578302507469758,"score_spread":0.21988215898353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3814096","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.05404481,0.0013015255,0.9119554,0.0014827093,0.0002071915,0.00019290541,0.000105244355,0.0002883642,0.030421834],"genre_scores_gemma":[0.7985404,0.0007337541,0.1934835,0.00020009892,0.00016657679,0.00019879921,0.000101134196,0.00012340311,0.006452278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880042,0.0053427424,0.0005449227,0.00091023574,0.004516972,0.0006808794],"domain_scores_gemma":[0.97331333,0.02115622,0.0007140953,0.0028375115,0.0013562809,0.0006225902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0116205,0.0011951119,0.0022132432,0.00164339,0.00088538934,0.007348355,0.0032996957,0.0023262382,0.005054693],"category_scores_gemma":[0.03900675,0.0008788334,0.0016290954,0.0014607796,0.001894274,0.009443414,0.002675122,0.003368863,0.00069186155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047211113,0.00019714239,0.00059359503,0.00021848638,0.00022587425,0.00014080212,0.00034177527,0.18453164,0.002818482,0.68853414,0.0021633804,0.119762614],"study_design_scores_gemma":[0.000051787894,0.00019481899,0.0003107742,0.000040443534,0.00010175943,0.00009963831,0.00007626111,0.4584132,0.0012197602,0.5373896,0.0020546063,0.00004740524],"about_ca_topic_score_codex":0.0008690572,"about_ca_topic_score_gemma":0.0007005816,"teacher_disagreement_score":0.0116205,"about_ca_system_score_codex":0.0023472535,"about_ca_system_score_gemma":0.0014513135,"threshold_uncertainty_score":0.061455846},"labels":[],"label_agreement":null},{"id":"W38163742","doi":"10.1007/978-3-319-12418-6_17","title":"Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Genome; Contig; Ancient DNA; Phylogenetic tree; Sequence assembly; Evolutionary biology; DNA sequencing; Extant taxon; Phylogenetics; Genomics; Biology; Computational biology; Computer science; DNA; Genetics; Gene","score_opus":0.00798738282598577,"score_gpt":0.23732986533636347,"score_spread":0.2293424825103777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38163742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04502639,0.0005199461,0.9508459,0.00023656969,0.00003126103,0.00003481505,0.00053528824,0.00091010286,0.0018597853],"genre_scores_gemma":[0.2470449,0.00095895235,0.74555665,0.00009834076,0.000075000644,0.00010014988,0.003592945,0.000779072,0.0017939901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988896,0.00035685947,0.000088595836,0.0004174235,0.00014336445,0.00010414738],"domain_scores_gemma":[0.994362,0.0034744407,0.00038564604,0.0011051499,0.00041859545,0.00025424268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031980812,0.00070899614,0.001358689,0.0037402448,0.0020029272,0.003233474,0.0032869643,0.0017388096,0.005582217],"category_scores_gemma":[0.013288223,0.00116152,0.0019084994,0.0053054243,0.0024018863,0.004509446,0.0034006387,0.0026081472,0.0012352961],"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.000777983,0.00012594672,0.005391617,0.0007167566,0.00015124191,0.00063944195,0.0016784124,0.23751558,0.014413093,0.5505597,0.002203771,0.18582651],"study_design_scores_gemma":[0.00005134104,0.00010240832,0.0010064775,0.00016167361,0.00011962861,0.00022771863,0.00036035266,0.35598242,0.003712165,0.63035774,0.007869025,0.000049073293],"about_ca_topic_score_codex":0.0028951864,"about_ca_topic_score_gemma":0.004854913,"teacher_disagreement_score":0.005582217,"about_ca_system_score_codex":0.0011224417,"about_ca_system_score_gemma":0.0013613967,"threshold_uncertainty_score":0.018674374},"labels":[],"label_agreement":null},{"id":"W38682500","doi":"10.1007/978-3-642-40480-1_27","title":"A Dog Tail for Utility Robots: Exploring Affective Properties of Tail Movement","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Robot; Perception; Human–computer interaction; Gesture; Set (abstract data type); Movement (music); Affect (linguistics); Interface (matter); State (computer science); Artificial intelligence; Psychology; Communication; Algorithm; Programming language; Aesthetics","score_opus":0.10810584809486623,"score_gpt":0.32580102902134034,"score_spread":0.2176951809264741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38682500","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.6450561,0.0007093218,0.3291751,0.00032243834,0.00008134296,0.0002946235,0.00023391975,0.0017569902,0.022370046],"genre_scores_gemma":[0.8720422,0.00035433014,0.12035836,0.00022278269,0.000027288605,0.00023676227,0.00019694472,0.00019238579,0.0063688075],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998896,0.00004641234,0.0000033486845,0.000020469719,0.000027132946,0.000013003132],"domain_scores_gemma":[0.9995448,0.00032617492,0.0000268056,0.000028151966,0.000042665415,0.00003142757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029915565,0.0004156116,0.00019127275,0.00015764417,0.0002488875,0.00076216465,0.00042793402,0.0004762298,0.004162525],"category_scores_gemma":[0.001520893,0.00016999507,0.00022116046,0.00013890302,0.00045647536,0.0010184587,0.0007020292,0.00043835072,0.0007630291],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009995931,0.00046661278,0.0101355035,0.0011709185,0.000043589494,0.0010531876,0.016151417,0.0045762938,0.6982722,0.005570249,0.005584419,0.25597605],"study_design_scores_gemma":[0.0002871875,0.0060514696,0.24334012,0.0007938172,0.00041596085,0.0075883316,0.025516972,0.25803798,0.29710677,0.035183985,0.12513113,0.00054623286],"about_ca_topic_score_codex":0.00027381172,"about_ca_topic_score_gemma":0.00076832774,"teacher_disagreement_score":0.004162525,"about_ca_system_score_codex":0.00014055648,"about_ca_system_score_gemma":0.00008792121,"threshold_uncertainty_score":0.013925016},"labels":[],"label_agreement":null},{"id":"W38955421","doi":"10.1007/978-3-319-10599-4_33","title":"CollageParsing: Nonparametric Scene Parsing by Adaptive Overlapping Windows","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nonparametric statistics; Computer science; Parsing; Benchmark (surveying); Scalability; Artificial intelligence; Pixel; Pattern recognition (psychology); Database; Cartography; Mathematics; Statistics","score_opus":0.01924969520640395,"score_gpt":0.26362496119213896,"score_spread":0.244375265985735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38955421","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.004886437,0.00018122718,0.9892679,0.00003271106,0.00003267941,0.00003829299,0.00016565788,0.0048261615,0.000568893],"genre_scores_gemma":[0.04070945,0.00021205706,0.9544554,0.000059958846,0.000047746496,0.00009215868,0.0010772514,0.0013785373,0.0019673556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.00015268876,0.00006265593,0.0003297071,0.0003766045,0.00015584512],"domain_scores_gemma":[0.9991165,0.0003182042,0.00005580076,0.00033854897,0.00012287559,0.00004794544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097227196,0.0016880616,0.0024918623,0.0017782638,0.0007020416,0.0018709939,0.0034352574,0.0012900014,0.008864373],"category_scores_gemma":[0.0025133563,0.0014386058,0.0017586784,0.0030282105,0.00072222186,0.002773436,0.0041256626,0.0020966907,0.0035628797],"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.00043539755,0.00015859205,0.0006322946,0.00017870513,0.0001337466,0.00017289881,0.00013221437,0.030000739,0.04205722,0.0099889,0.011216341,0.9048929],"study_design_scores_gemma":[0.000056175926,0.00010375978,0.00093114626,0.000024192921,0.00007638977,0.00033136952,0.000076404416,0.9158325,0.050021417,0.019845966,0.012639842,0.000060862883],"about_ca_topic_score_codex":0.004257921,"about_ca_topic_score_gemma":0.0073768613,"teacher_disagreement_score":0.008864373,"about_ca_system_score_codex":0.0004958988,"about_ca_system_score_gemma":0.0012689076,"threshold_uncertainty_score":0.029654264},"labels":[],"label_agreement":null},{"id":"W39084266","doi":"10.1007/978-3-642-21437-0_9","title":"Sampling-Based Runtime Verification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Runtime verification; Benchmark (surveying); Overhead (engineering); Formal verification; Sampling (signal processing); Integer programming; Distributed computing; Algorithm; Programming language; Filter (signal processing)","score_opus":0.05135206870084809,"score_gpt":0.28860412819111275,"score_spread":0.23725205949026468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39084266","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.009137759,0.00024146505,0.97977966,0.00006552971,0.00008313963,0.000060122657,0.00007600216,0.0047301888,0.005826085],"genre_scores_gemma":[0.52981013,0.000368551,0.45543262,0.00016329106,0.00012389767,0.00026443906,0.0006470684,0.0020802917,0.011109744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995641,0.0011729161,0.00020376511,0.0007103554,0.0018882495,0.00038373182],"domain_scores_gemma":[0.99409074,0.0023316713,0.00020184669,0.0026312107,0.0006180533,0.00012648795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022162315,0.0010598117,0.001569162,0.000973375,0.00071445445,0.0015968416,0.002035147,0.0007456014,0.0070235385],"category_scores_gemma":[0.0063561667,0.00085637416,0.0013264852,0.0009853814,0.0017572666,0.0023580415,0.002762396,0.0023388125,0.002636338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013033184,0.0002021287,0.001326052,0.0005511999,0.0001267796,0.0001866449,0.00032998936,0.12388494,0.06341429,0.25695524,0.008802254,0.54291713],"study_design_scores_gemma":[0.0000880332,0.00014043177,0.0004663445,0.000054963144,0.0000675424,0.00016502023,0.00003478961,0.7559849,0.06378026,0.16783392,0.011337566,0.000046233494],"about_ca_topic_score_codex":0.0008716604,"about_ca_topic_score_gemma":0.0013556948,"teacher_disagreement_score":0.0070235385,"about_ca_system_score_codex":0.0012255779,"about_ca_system_score_gemma":0.0011719251,"threshold_uncertainty_score":0.023496091},"labels":[],"label_agreement":null},{"id":"W391464563","doi":"10.1007/978-3-319-06608-0_21","title":"Mining Contrast Subspaces","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Simon Fraser University","funders":"","keywords":"Linear subspace; Contrast (vision); Computer science; Pruning; Set (abstract data type); Object (grammar); Time complexity; Data mining; Polynomial; Algorithm; Artificial intelligence; Pattern recognition (psychology); Mathematics; Programming language","score_opus":0.01654142079109158,"score_gpt":0.24524898497943437,"score_spread":0.2287075641883428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W391464563","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.078623034,0.0036981136,0.887856,0.000811516,0.0003638683,0.00024457206,0.0035525397,0.00515848,0.019691829],"genre_scores_gemma":[0.43318844,0.0025189535,0.5212375,0.00043934656,0.00048880413,0.00031769348,0.022652589,0.0011887171,0.01796794],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990972,0.00012294202,0.000052807616,0.00038939618,0.00024165897,0.00009601133],"domain_scores_gemma":[0.99880016,0.00037904514,0.00012114306,0.0003164604,0.00028984703,0.000093421244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007805021,0.0013482075,0.0011563792,0.0034715664,0.0010233597,0.0026466944,0.0013772931,0.0009940279,0.010035281],"category_scores_gemma":[0.0040784343,0.00058197154,0.0014602579,0.0030283607,0.0008040702,0.0033346654,0.0023808233,0.0018069906,0.0063106045],"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.00067115674,0.00022941905,0.008228978,0.00037908225,0.00022864672,0.00043398378,0.00025689843,0.008809305,0.026090631,0.03546297,0.029802516,0.8894064],"study_design_scores_gemma":[0.00014172208,0.00057240145,0.012437935,0.000371611,0.00041724247,0.0034611854,0.0012993984,0.5287139,0.043832522,0.30642217,0.10219557,0.0001343935],"about_ca_topic_score_codex":0.00080410886,"about_ca_topic_score_gemma":0.0013670119,"teacher_disagreement_score":0.010035281,"about_ca_system_score_codex":0.0003753427,"about_ca_system_score_gemma":0.0005869897,"threshold_uncertainty_score":0.033571362},"labels":[],"label_agreement":null},{"id":"W39359494","doi":"10.1007/978-3-319-10404-1_70","title":"Multi-parametric 3D Quantitative Ultrasound Vibro-Elastography Imaging for Detecting Palpable Prostate Tumors","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Elastography; Ultrasound elastography; Computer science; Parametric statistics; Radiology; Prostate; Ultrasound; Artificial intelligence; Medicine; Internal medicine; Mathematics; Cancer; Statistics","score_opus":0.012637235506698135,"score_gpt":0.2759922780928482,"score_spread":0.26335504258615006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39359494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40754133,0.007069017,0.58018756,0.00043800066,0.00010516945,0.00014749094,0.0005141544,0.00088774686,0.0031094702],"genre_scores_gemma":[0.8517729,0.0016704669,0.14476514,0.00016015489,0.000072500145,0.000092703274,0.0001833896,0.000142489,0.0011402805],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994435,0.00018504643,0.000039202456,0.00008283835,0.00020125679,0.000048256967],"domain_scores_gemma":[0.998858,0.0007570645,0.00011373552,0.000086651606,0.00014315115,0.00004146921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235611,0.00058011326,0.0004716118,0.0013452575,0.00016287147,0.0010318717,0.0006749385,0.0012207686,0.0019216302],"category_scores_gemma":[0.0027662644,0.000727412,0.0004905714,0.00053365296,0.000308827,0.0011674755,0.0010219115,0.0005308709,0.000423665],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091944565,0.00016619058,0.016304104,0.00081687974,0.00017288404,0.000579128,0.0002837523,0.016939837,0.671556,0.00065331813,0.00074748864,0.29086095],"study_design_scores_gemma":[0.000099175915,0.0009631395,0.0897394,0.00021309298,0.0006094353,0.012922418,0.0005155223,0.5678935,0.31889448,0.0022880123,0.005500308,0.000361448],"about_ca_topic_score_codex":0.0003779761,"about_ca_topic_score_gemma":0.00077335915,"teacher_disagreement_score":0.0019216302,"about_ca_system_score_codex":0.00013584993,"about_ca_system_score_gemma":0.0001897887,"threshold_uncertainty_score":0.00642848},"labels":[],"label_agreement":null},{"id":"W39440519","doi":"10.1007/978-3-642-21341-0_24","title":"Extended Watson-Crick L Systems with Regular Trigger Languages","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Queen's University","funders":"","keywords":"Recursively enumerable language; Watson; Computer science; Expressive power; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Bounded function; Complementarity (molecular biology); Formal language; Relation (database); Recursively enumerable set; Regular language; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Automaton; DNA; Artificial intelligence; Base pair","score_opus":0.013943044915379723,"score_gpt":0.23268963096823006,"score_spread":0.21874658605285033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39440519","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.14628334,0.000805578,0.74438494,0.00066673267,0.0004659832,0.0002948568,0.00043941685,0.007143607,0.09951551],"genre_scores_gemma":[0.7670409,0.0005115422,0.17759089,0.00049060705,0.000114454524,0.0006088001,0.00053795584,0.0013446965,0.051760074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992955,0.00018670646,0.000055534565,0.00014861212,0.00017758507,0.00013605665],"domain_scores_gemma":[0.9990251,0.00039645119,0.000072362054,0.00028296543,0.00013014542,0.000092931106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077364506,0.0006457886,0.00075886125,0.00055214774,0.0009034984,0.0028556024,0.001979013,0.0013453997,0.011687534],"category_scores_gemma":[0.0027983657,0.00068041944,0.0006502238,0.00073873857,0.0016208607,0.0028528937,0.0018053752,0.0016673576,0.0038921358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026289906,0.00008073775,0.00017734183,0.00013075868,0.000017876642,0.00034768533,0.00034078298,0.017102506,0.016773889,0.93415177,0.0035673738,0.027046386],"study_design_scores_gemma":[0.000155348,0.0001411102,0.00008225832,0.00003825878,0.00002417659,0.00023312091,0.00012363943,0.13495559,0.03313151,0.79820174,0.032811854,0.000101324105],"about_ca_topic_score_codex":0.00064509996,"about_ca_topic_score_gemma":0.0005553441,"teacher_disagreement_score":0.011687534,"about_ca_system_score_codex":0.0008702459,"about_ca_system_score_gemma":0.0007964499,"threshold_uncertainty_score":0.03909874},"labels":[],"label_agreement":null},{"id":"W394845274","doi":"10.1007/978-3-662-45391-9_50","title":"Single Source of Truth (SSOT) for Service Oriented Architecture (SOA)","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Service-oriented architecture; Interoperability; Data as a service; Service (business); sync; Replication (statistics); Service provider; World Wide Web; Computer security; Web service; Computer network","score_opus":0.01237876356758106,"score_gpt":0.22329822502098948,"score_spread":0.21091946145340842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W394845274","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.0041007344,0.0025360624,0.90687126,0.0030504838,0.0016125282,0.00012979678,0.00032158912,0.0023719226,0.079005584],"genre_scores_gemma":[0.2977671,0.0038117222,0.6243923,0.0013560042,0.0012085628,0.00035455803,0.0009825892,0.0018103615,0.068316855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803036,0.0005105138,0.0001829203,0.000364267,0.0007451033,0.00016686626],"domain_scores_gemma":[0.9972806,0.0013990614,0.00010181407,0.0006183023,0.0004907695,0.00010946842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021221915,0.0007851798,0.000978111,0.001576014,0.0015759487,0.0038561712,0.0016140498,0.0024141704,0.018513758],"category_scores_gemma":[0.008195577,0.0006572802,0.0016477125,0.0020497688,0.004499322,0.007735637,0.003663745,0.0042279405,0.0053757466],"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.00003726118,0.000013441519,0.00007407176,0.00015077702,0.000009666303,0.00008515223,0.00028642593,0.0015798435,0.0007414346,0.9160925,0.007896065,0.07303335],"study_design_scores_gemma":[0.000010622586,0.000018042798,0.000033785982,0.00008758646,0.000014830113,0.00014395494,0.000062129664,0.013430212,0.0012222419,0.93797,0.046991024,0.000015713918],"about_ca_topic_score_codex":0.0018305794,"about_ca_topic_score_gemma":0.0020273342,"teacher_disagreement_score":0.018513758,"about_ca_system_score_codex":0.0020920904,"about_ca_system_score_gemma":0.0022924533,"threshold_uncertainty_score":0.06193471},"labels":[],"label_agreement":null},{"id":"W39638318","doi":"10.1007/978-3-319-02267-3_24","title":"Improving Probabilistic Image Registration via Reinforcement Learning and Uncertainty Evaluation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Pointwise; Probabilistic logic; Artificial intelligence; Entropy (arrow of time); Image registration; Probability distribution; Measure (data warehouse); Image (mathematics); Displacement (psychology); Computer vision; Pattern recognition (psychology); Data mining; Mathematics; Statistics","score_opus":0.01725708167757557,"score_gpt":0.28061525860767383,"score_spread":0.2633581769300983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39638318","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.008798846,0.00020083657,0.9895858,0.000086670094,0.000027649487,0.000025905343,0.000011178425,0.0005257971,0.00073727506],"genre_scores_gemma":[0.5140363,0.0002282161,0.48196626,0.00017585102,0.00009544551,0.00014024055,0.00012056505,0.00031550875,0.0029216062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818367,0.00060428533,0.00009805735,0.00040445116,0.0005465493,0.0001629851],"domain_scores_gemma":[0.99536973,0.0031307254,0.00037569116,0.00047251338,0.0005113382,0.00014003654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034669456,0.0013836595,0.0024302644,0.0010964653,0.00060502184,0.0013022604,0.0028747593,0.002568309,0.0026011383],"category_scores_gemma":[0.010191665,0.001141806,0.001292133,0.0010574799,0.0015196927,0.0025595922,0.0032714973,0.0024884145,0.000634311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020563314,0.00012337654,0.00042718562,0.000078634905,0.00006753298,0.000056057324,0.00006389206,0.82544065,0.0049167755,0.008333113,0.0010998743,0.1591874],"study_design_scores_gemma":[0.000005778848,0.000021377811,0.00003671016,0.0000025062736,0.000004821763,0.000012165004,0.0000018444342,0.99709535,0.0005981667,0.002138173,0.00007918996,0.000003862612],"about_ca_topic_score_codex":0.005741363,"about_ca_topic_score_gemma":0.0044836593,"teacher_disagreement_score":0.005741363,"about_ca_system_score_codex":0.0012099636,"about_ca_system_score_gemma":0.0013453678,"threshold_uncertainty_score":0.018335223},"labels":[],"label_agreement":null},{"id":"W39924371","doi":"10.1007/978-3-540-75142-7_38","title":"Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Fault tolerance; Implementation; Set (abstract data type); Models of communication; Distributed computing; Theoretical computer science; State (computer science); Message passing; Fault model; Model checking; Parallel computing; Programming language","score_opus":0.02415324342239464,"score_gpt":0.2774749835312237,"score_spread":0.253321740108829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39924371","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.08269786,0.00023390693,0.89837444,0.0008828738,0.0002295948,0.00009593269,0.00009728408,0.0011860332,0.016202226],"genre_scores_gemma":[0.7753179,0.00031391194,0.21053977,0.0002946873,0.00017982755,0.00025653813,0.0002032279,0.00030256534,0.012591516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986374,0.00035277294,0.00012509838,0.00013138234,0.00056980265,0.00018354354],"domain_scores_gemma":[0.99473274,0.0019591593,0.00032393512,0.002059766,0.00069762906,0.00022677078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022711763,0.00042894078,0.0006825269,0.00061107584,0.0012256352,0.0024749846,0.0034180423,0.0012864745,0.0068646655],"category_scores_gemma":[0.007499876,0.0005350663,0.00053767575,0.00082197663,0.0017112015,0.0063287746,0.0021433572,0.0029543554,0.00080952863],"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.00033764442,0.000121463054,0.00028372338,0.00012499475,0.000022886266,0.00007067884,0.0005039591,0.029747944,0.0087650325,0.9313359,0.0021425441,0.026543232],"study_design_scores_gemma":[0.00011244226,0.00010352356,0.00012202583,0.000026222127,0.00004922481,0.00007454916,0.000114123155,0.43007183,0.009611746,0.5505106,0.009174038,0.00002974251],"about_ca_topic_score_codex":0.0011471191,"about_ca_topic_score_gemma":0.001858657,"teacher_disagreement_score":0.0068646655,"about_ca_system_score_codex":0.001172408,"about_ca_system_score_gemma":0.0010033533,"threshold_uncertainty_score":0.022964597},"labels":[],"label_agreement":null},{"id":"W40033625","doi":"10.1007/978-3-642-25243-3_32","title":"Situational Assessment of Intrusion Alerts: A Multi Attack Scenario Evaluation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Intrusion detection system; Situation awareness; Network security; Visualization; Computer security; Focus (optics); Attack patterns; Process (computing); Situation analysis; Intelligence analysis; Network monitoring; Data science; Data mining","score_opus":0.0793679378694384,"score_gpt":0.35839041375308917,"score_spread":0.27902247588365076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40033625","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.9718122,0.00019057337,0.024818184,0.000107166656,0.000034460543,0.0004152339,0.00032820855,0.00033380737,0.0019601125],"genre_scores_gemma":[0.98760635,0.00007677508,0.011495498,0.000017763226,0.000009482108,0.000079541634,0.00035759155,0.000019387546,0.0003375096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965224,0.0020581607,0.0002360709,0.0002848917,0.0007407167,0.00015776967],"domain_scores_gemma":[0.98848534,0.006906661,0.000775626,0.00067848724,0.0025261985,0.0006277414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048422837,0.0011292003,0.00077102723,0.0019175446,0.00047511395,0.0010955924,0.0009533981,0.00085858844,0.0012031845],"category_scores_gemma":[0.012562955,0.00022705745,0.0005486023,0.00073244335,0.0003993998,0.0013570891,0.0012059055,0.00059706956,0.00025604328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.021459293,0.009914694,0.11827157,0.001425166,0.0013994174,0.0014199417,0.002277701,0.3957376,0.07140457,0.0033252074,0.0048460634,0.36851883],"study_design_scores_gemma":[0.0005095568,0.014975907,0.050864827,0.00008289665,0.00062195683,0.00078761694,0.0017441696,0.89522815,0.031511042,0.0020205167,0.0015280341,0.00012530746],"about_ca_topic_score_codex":0.0013241784,"about_ca_topic_score_gemma":0.001460904,"teacher_disagreement_score":0.0048422837,"about_ca_system_score_codex":0.0006934822,"about_ca_system_score_gemma":0.00070121215,"threshold_uncertainty_score":0.025608718},"labels":[],"label_agreement":null},{"id":"W402333417","doi":"10.1007/978-3-319-09955-2_11","title":"Efficient Computation of the Outer Hull of a Discrete Path","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Université du Québec à Montréal","funders":"","keywords":"Intersection (aeronautics); Convex hull; Path (computing); Hull; Algorithm; Traverse; Plane (geometry); Computation; Data structure; Mathematics; Code (set theory); Time complexity; Space (punctuation); Linear space; Computer science; Regular polygon; Topology (electrical circuits); Geometry; Combinatorics; Engineering","score_opus":0.010684282420554107,"score_gpt":0.23573714037302668,"score_spread":0.22505285795247257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W402333417","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.13613418,0.00015878398,0.84658957,0.00015042414,0.00008052644,0.000093479954,0.0006902203,0.002239907,0.013862902],"genre_scores_gemma":[0.5156483,0.0001618199,0.47216207,0.000041301846,0.000038650513,0.000073408846,0.0019108831,0.0006987876,0.009264773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996427,0.00003136962,0.000016600121,0.000060949547,0.00018710972,0.00006132784],"domain_scores_gemma":[0.9990533,0.0004939871,0.000058313668,0.00015944464,0.00015081123,0.000084164334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028455188,0.0008352101,0.0010126135,0.0011876713,0.00057212735,0.0018140449,0.0010188314,0.0006536209,0.01048724],"category_scores_gemma":[0.0023467822,0.00042407896,0.0006625392,0.00095504604,0.0008614952,0.0019016323,0.0022044857,0.0013710101,0.0017923359],"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.0011081577,0.00021597273,0.0037577495,0.00082796765,0.000080811005,0.0006033191,0.00096093345,0.25194162,0.045286864,0.18846916,0.014485026,0.49226245],"study_design_scores_gemma":[0.00004558931,0.00012614412,0.0008292168,0.000039476658,0.000019708938,0.00014680036,0.0002619816,0.8913324,0.011616298,0.087649584,0.007907456,0.000025444813],"about_ca_topic_score_codex":0.0020376425,"about_ca_topic_score_gemma":0.0036637487,"teacher_disagreement_score":0.01048724,"about_ca_system_score_codex":0.0007111351,"about_ca_system_score_gemma":0.00070319965,"threshold_uncertainty_score":0.035083294},"labels":[],"label_agreement":null},{"id":"W4033662","doi":"10.1007/978-3-319-11298-5_4","title":"A Novel Method for Scene Categorization Using an Improved Visual Vocabulary Approach","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Categorization; Artificial intelligence; Pattern recognition (psychology); Gaussian; Vocabulary; Word (group theory); Visual Word; Cluster analysis; Representation (politics); Bag-of-words model in computer vision; Mixture model; Image (mathematics); Natural language processing; Image retrieval; Mathematics","score_opus":0.03749307710223955,"score_gpt":0.3314606638497251,"score_spread":0.2939675867474856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4033662","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.005579633,0.0007274546,0.9856161,0.00008645976,0.00022990901,0.00020286768,0.0005096896,0.0043468466,0.0027010164],"genre_scores_gemma":[0.07714646,0.00081042806,0.904647,0.00023781389,0.00021932607,0.00037080364,0.0037971814,0.00075444736,0.012016594],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986443,0.000105589956,0.000082677354,0.0004892509,0.0005187238,0.00015951257],"domain_scores_gemma":[0.99936146,0.00009808799,0.000028299657,0.00016346073,0.000304443,0.00004420856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005032166,0.0012917479,0.0017799075,0.004395378,0.0010782459,0.0018769356,0.0027668641,0.0014157305,0.0073738624],"category_scores_gemma":[0.0014478699,0.00055718527,0.0017399323,0.0037760914,0.00057489553,0.00309777,0.002609723,0.0015240409,0.0063593145],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013290341,0.00013661747,0.0004457416,0.0002781208,0.000095240204,0.00008817608,0.00011337982,0.0026788956,0.08077401,0.006572806,0.012892244,0.89579195],"study_design_scores_gemma":[0.00015022319,0.0004156592,0.00456343,0.00012914307,0.00036176675,0.0015990586,0.00058083,0.7617779,0.11794069,0.03627952,0.07598728,0.0002144681],"about_ca_topic_score_codex":0.011559587,"about_ca_topic_score_gemma":0.014263733,"teacher_disagreement_score":0.011559587,"about_ca_system_score_codex":0.0006334456,"about_ca_system_score_gemma":0.0012056952,"threshold_uncertainty_score":0.024668038},"labels":[],"label_agreement":null},{"id":"W40396644","doi":"10.1007/978-3-642-31612-8_48","title":"Single-Solver Algorithms for 2QBF","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Problem solver; Solver; Algorithm; Computational science; Programming language","score_opus":0.03092021923973902,"score_gpt":0.252007707080522,"score_spread":0.22108748784078297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40396644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153355105,0.0019862761,0.9396743,0.0011707194,0.00027400206,0.00016753275,0.0011970932,0.006232949,0.03396154],"genre_scores_gemma":[0.17675227,0.0013755222,0.7798374,0.00043720112,0.0002628008,0.00042201005,0.0038203031,0.00227649,0.034816053],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832743,0.00031969606,0.000112686736,0.0004083579,0.0005725156,0.00025920308],"domain_scores_gemma":[0.99724907,0.001464222,0.000108733315,0.00074711186,0.00034833557,0.000082539016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001307454,0.001703504,0.0017212394,0.0014213313,0.0015024693,0.0035063117,0.0033033078,0.0018236535,0.047543637],"category_scores_gemma":[0.0054950486,0.0011596169,0.001927485,0.003854395,0.0009944442,0.008161577,0.0035370523,0.0033869268,0.010303077],"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.00047692584,0.0002350383,0.0005786484,0.0010993072,0.00011415783,0.000118569136,0.00035676942,0.03691218,0.0062809987,0.27954593,0.04793026,0.62635124],"study_design_scores_gemma":[0.00022466606,0.00007256214,0.0002481321,0.00011548914,0.00007399535,0.00022294959,0.00012670943,0.19871542,0.008827609,0.76085186,0.030475719,0.000044856828],"about_ca_topic_score_codex":0.0031313836,"about_ca_topic_score_gemma":0.0073838686,"teacher_disagreement_score":0.047543637,"about_ca_system_score_codex":0.002484606,"about_ca_system_score_gemma":0.0023249637,"threshold_uncertainty_score":0.15904933},"labels":[],"label_agreement":null},{"id":"W40607377","doi":"10.1007/978-3-319-04298-5_39","title":"Unary NFAs with Limited Nondeterminism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; Regular language; Computer science; Nondeterministic finite automaton; Discrete mathematics; Automaton; Bounded function; Finite-state machine; Deterministic finite automaton; Exponential function; Mathematics; Combinatorics; Algorithm; Automata theory; Theoretical computer science","score_opus":0.01104340316334352,"score_gpt":0.21656867968437515,"score_spread":0.20552527652103164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40607377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041805603,0.0020563353,0.84794086,0.0010836844,0.00046999715,0.00012039433,0.00042588313,0.0027931014,0.10330412],"genre_scores_gemma":[0.71682096,0.0017740258,0.22935581,0.00041982584,0.00041317433,0.0003295961,0.00060976326,0.00085569965,0.049421173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984736,0.0003371095,0.0001518876,0.00041218777,0.00045314096,0.00017207576],"domain_scores_gemma":[0.9966666,0.0018531338,0.00013087335,0.0009778857,0.00029638901,0.00007499508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015624282,0.0007575412,0.0008600315,0.00076777145,0.0010235606,0.0029883392,0.0016299364,0.0011616352,0.008291269],"category_scores_gemma":[0.0059480714,0.00080809015,0.0012845063,0.000781553,0.0025131258,0.011518542,0.0020374611,0.0030037272,0.0024520643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079186786,0.000027658401,0.0001665653,0.00026012055,0.000016732369,0.00012644168,0.00032010165,0.004367325,0.0042661806,0.9238137,0.0025941343,0.0639618],"study_design_scores_gemma":[0.000020520823,0.000024449531,0.00008453203,0.00008842009,0.00003341552,0.00029458612,0.00003149938,0.016161127,0.005227827,0.9483234,0.02968799,0.00002223963],"about_ca_topic_score_codex":0.0004767126,"about_ca_topic_score_gemma":0.00056982995,"teacher_disagreement_score":0.008291269,"about_ca_system_score_codex":0.0011579914,"about_ca_system_score_gemma":0.000708397,"threshold_uncertainty_score":0.027737081},"labels":[],"label_agreement":null},{"id":"W406481330","doi":"10.1007/978-3-319-13186-3_37","title":"A Scalable Data Analytics Algorithm for Mining Frequent Patterns from Uncertain Data","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Computer science; Scalability; Data mining; Tree (set theory); Analytics; Data analysis; Association rule learning; Data structure; Tree structure; Algorithm; Database; Binary tree; Mathematics","score_opus":0.07842976898321406,"score_gpt":0.3042055701348772,"score_spread":0.22577580115166312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W406481330","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.009170138,0.0006139545,0.9848525,0.00033847778,0.00012585214,0.00020231846,0.000900321,0.003082647,0.0007137568],"genre_scores_gemma":[0.052408084,0.0003133306,0.9427687,0.00014415948,0.0001534479,0.00028900403,0.0024729362,0.00013658381,0.00131379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835026,0.00015245147,0.00019836261,0.0004060411,0.0007973258,0.00009545794],"domain_scores_gemma":[0.99671835,0.0017088744,0.00021117635,0.0005426869,0.0007024257,0.00011643284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017303185,0.0013066498,0.002035337,0.002726944,0.0010685353,0.0018984039,0.002689517,0.0011849649,0.0034252682],"category_scores_gemma":[0.007905211,0.0007556151,0.001456203,0.0055049467,0.000594589,0.0037857848,0.0023025505,0.002086702,0.0018349908],"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.00039299403,0.00031547618,0.0023936767,0.00029279018,0.00018543005,0.00031964132,0.00014949197,0.049839187,0.009304418,0.008336646,0.021282457,0.90718794],"study_design_scores_gemma":[0.00009981728,0.00009278695,0.00064814824,0.000032180582,0.000061918574,0.00033481236,0.00007720243,0.9567978,0.0040794876,0.032281183,0.0054708715,0.000023768245],"about_ca_topic_score_codex":0.0031301274,"about_ca_topic_score_gemma":0.004507443,"teacher_disagreement_score":0.0034252682,"about_ca_system_score_codex":0.00071536534,"about_ca_system_score_gemma":0.0019415509,"threshold_uncertainty_score":0.011458695},"labels":[],"label_agreement":null},{"id":"W408182588","doi":"10.1007/978-3-319-08846-4_25","title":"Pairwise Rational Kernels Obtained by Automaton Operations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","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 Manitoba","funders":"","keywords":"Pairwise comparison; Computer science; Automaton; Finite-state machine; Sequence (biology); Theoretical computer science; Algorithm; Kernel (algebra); State (computer science); Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.006041113190459282,"score_gpt":0.23842748043244924,"score_spread":0.23238636724198997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W408182588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25915134,0.00073055003,0.61830103,0.00079915824,0.0008092839,0.0001224175,0.0003383165,0.0017960691,0.117951825],"genre_scores_gemma":[0.9131029,0.0005081555,0.05046729,0.00029548237,0.00024589742,0.00013248279,0.000474588,0.0010390223,0.0337343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929166,0.00009721332,0.000048616377,0.00017156267,0.00020964083,0.00018128028],"domain_scores_gemma":[0.99925715,0.00027572902,0.00006964717,0.00019109866,0.000109946785,0.000096316886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004230487,0.0010333542,0.0012320622,0.0012481177,0.0010774758,0.0021991848,0.0011249626,0.0012158708,0.011600139],"category_scores_gemma":[0.0023923067,0.0005240698,0.00148689,0.0007340721,0.0018166094,0.003587243,0.0028271677,0.003063794,0.0030253816],"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.000073812684,0.000042020838,0.00010278894,0.00005783897,0.000017772443,0.00009181451,0.00010786128,0.0038001295,0.0034350746,0.97328657,0.0018237559,0.017160604],"study_design_scores_gemma":[0.00001913736,0.00002737494,0.00009855866,0.000013244714,0.00001278745,0.00009548043,0.000033015,0.019116707,0.0020004045,0.9761652,0.0023928273,0.00002530298],"about_ca_topic_score_codex":0.0005602388,"about_ca_topic_score_gemma":0.00067190634,"teacher_disagreement_score":0.011600139,"about_ca_system_score_codex":0.00084546895,"about_ca_system_score_gemma":0.00048309282,"threshold_uncertainty_score":0.03880632},"labels":[],"label_agreement":null},{"id":"W4085598","doi":"10.1007/978-3-540-79232-1_1","title":"The Flattening Internet Topology: Natural Evolution, Unsightly Barnacles or Contrived Collapse?","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":145,"is_retracted":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":"Internet topology; The Internet; Internet service provider; traceroute; Service provider; Computer science; Network topology; Provisioning; Computer network; Computer security; World Wide Web; Topology (electrical circuits); Internet privacy; Service (business); Engineering; Business","score_opus":0.014140061480717002,"score_gpt":0.23681750338603821,"score_spread":0.2226774419053212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4085598","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.18298958,0.019862235,0.33909383,0.085292235,0.0036935434,0.00009595373,0.0005551038,0.0018214246,0.36659613],"genre_scores_gemma":[0.91486555,0.008249359,0.039496545,0.0033451782,0.0012731233,0.00007995228,0.00029335276,0.000438997,0.03195783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.00013174838,0.000018684577,0.00012004491,0.00011065448,0.000064409156],"domain_scores_gemma":[0.9979291,0.00063141435,0.00020508026,0.00074978766,0.00023318047,0.00025145608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122815,0.00023900089,0.00051132345,0.0006666826,0.0012532591,0.0033488667,0.0012378956,0.0015496026,0.0049921554],"category_scores_gemma":[0.008303542,0.00034468278,0.00030058742,0.0009001546,0.009204438,0.009169359,0.0017768525,0.0030392408,0.0012589481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016888756,0.0000068875243,0.00035121953,0.00004992843,0.000007869446,0.000080839134,0.0005823549,0.0015504803,0.00052416394,0.9628071,0.007310176,0.02671203],"study_design_scores_gemma":[0.0000067313767,0.000012146106,0.00036422687,0.00004186678,0.0000052521596,0.00030056326,0.0003106281,0.0033533808,0.0002939689,0.9609303,0.034367453,0.000013427024],"about_ca_topic_score_codex":0.0014403489,"about_ca_topic_score_gemma":0.0014643478,"teacher_disagreement_score":0.0049921554,"about_ca_system_score_codex":0.0008265085,"about_ca_system_score_gemma":0.0005960319,"threshold_uncertainty_score":0.016700447},"labels":[],"label_agreement":null},{"id":"W40976406","doi":"10.1007/978-3-642-41392-6_3","title":"Plurality Voting with Truth-Biased Agents","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nash equilibrium; Mathematical economics; Computer science; Outcome (game theory); Equilibrium selection; Voting; Best response; Risk dominance; Correlated equilibrium; Condorcet method; Focus (optics); Game theory; Epsilon-equilibrium; Mathematics; Repeated game","score_opus":0.04036305987728673,"score_gpt":0.22466575303443995,"score_spread":0.18430269315715322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40976406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19629821,0.0009796512,0.67667377,0.009418896,0.000538949,0.00022386809,0.00028200733,0.00020526254,0.115379356],"genre_scores_gemma":[0.9126128,0.00032761053,0.056253843,0.0006230392,0.00050840195,0.00017835875,0.00017245267,0.000080502534,0.029242942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98542345,0.009161426,0.00060660887,0.0015780829,0.0020258145,0.001204705],"domain_scores_gemma":[0.9576259,0.031782366,0.0022495068,0.005451456,0.00181794,0.0010727651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014047384,0.000569733,0.0014603741,0.0008287877,0.0022175172,0.004946073,0.0019773487,0.0033246928,0.009139281],"category_scores_gemma":[0.0569566,0.00073303055,0.0008926794,0.0012648369,0.0033152653,0.005408026,0.0031067217,0.0036704824,0.0015852842],"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.00023883468,0.00005722752,0.0011392852,0.00008853155,0.0000654256,0.00018457403,0.0007077707,0.01309732,0.0008307705,0.94921565,0.0045048986,0.02986959],"study_design_scores_gemma":[0.00004425836,0.000016445834,0.00013743216,0.000011983931,0.000010670618,0.000056806806,0.00007155847,0.03699721,0.00032123606,0.960366,0.0019571574,0.0000092139],"about_ca_topic_score_codex":0.00048173926,"about_ca_topic_score_gemma":0.00073225284,"teacher_disagreement_score":0.014047384,"about_ca_system_score_codex":0.0013166242,"about_ca_system_score_gemma":0.00092642853,"threshold_uncertainty_score":0.07429057},"labels":[],"label_agreement":null},{"id":"W40989923","doi":"10.1007/3-540-45108-0_71","title":"A Cognitive Model for Automatic Narrative Summarization in a Self-Educational System","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université Laval","funders":"","keywords":"Automatic summarization; Computer science; Reuse; Narrative; Field (mathematics); Generator (circuit theory); Artificial intelligence; Linguistics; Engineering","score_opus":0.021239410143157268,"score_gpt":0.2613588401457524,"score_spread":0.2401194300025951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40989923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026407111,0.00010343407,0.96210945,0.00036965453,0.000033407,0.00024054969,0.00040616072,0.0042943927,0.0060358983],"genre_scores_gemma":[0.44946286,0.00015667829,0.5417075,0.00015782974,0.000047186957,0.00040209544,0.0010957144,0.00031150493,0.006658529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00018704474,0.00006512891,0.00019497825,0.00014700575,0.000056851968],"domain_scores_gemma":[0.9980446,0.0009948724,0.00014543664,0.0002399137,0.0004600541,0.0001151225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010606237,0.0005772972,0.0003851044,0.0013962174,0.000768223,0.0029554584,0.0017181752,0.0009903102,0.008749411],"category_scores_gemma":[0.0047147586,0.00047093528,0.001151896,0.0007625773,0.0007321049,0.0035370642,0.0011669981,0.00084463955,0.0016331708],"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.0009250094,0.0007165063,0.007236409,0.0011155072,0.0003687613,0.00081044785,0.010174794,0.1154037,0.05219595,0.24219751,0.018793827,0.5500615],"study_design_scores_gemma":[0.000056992798,0.00010864105,0.0012828499,0.000057108628,0.00016081744,0.00018089055,0.000621782,0.9162011,0.009235682,0.06094356,0.011097382,0.000053213178],"about_ca_topic_score_codex":0.008944902,"about_ca_topic_score_gemma":0.008267843,"teacher_disagreement_score":0.008944902,"about_ca_system_score_codex":0.0010736703,"about_ca_system_score_gemma":0.0011184504,"threshold_uncertainty_score":0.029269755},"labels":[],"label_agreement":null},{"id":"W4104734","doi":"10.1007/978-3-642-39742-4_26","title":"A Multi-objective Genetic Algorithm for Generating Test Suites from Extended Finite State Machines","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Carleton University","funders":"Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Computer science; Test suite; Finite-state machine; Genetic algorithm; Similarity (geometry); Algorithm; Set (abstract data type); State (computer science); Test (biology); Suite; Test case; Artificial intelligence; Machine learning; Programming language","score_opus":0.020592682319030896,"score_gpt":0.2616508539926293,"score_spread":0.2410581716735984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4104734","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.024845554,0.00019951105,0.9708773,0.0000958964,0.00003787613,0.00015566459,0.00008584318,0.0012294727,0.0024729439],"genre_scores_gemma":[0.19801143,0.000117985524,0.79888844,0.000097479875,0.000022847053,0.00045596834,0.00030891597,0.0002121968,0.001884829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994373,0.00018384565,0.000026366726,0.00010724819,0.00018526636,0.00005998015],"domain_scores_gemma":[0.9984226,0.0012173987,0.00008248671,0.000061677136,0.00017594076,0.000039930208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010840441,0.001228133,0.001196775,0.0014896394,0.0004903472,0.00069712405,0.0016517713,0.0017432004,0.0028566753],"category_scores_gemma":[0.0034327542,0.00068362907,0.0012848385,0.0011197436,0.0007360108,0.00063830503,0.0009337185,0.0013145831,0.00040387042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005917088,0.00009593178,0.00037382316,0.000066050634,0.00005773331,0.00008548695,0.000046531404,0.87448996,0.0023028282,0.0042066397,0.0008358107,0.117379986],"study_design_scores_gemma":[0.000016581096,0.000025043204,0.00006959585,0.000006523242,0.000009777391,0.000012495472,0.0000036661127,0.9980258,0.0003628763,0.0013247811,0.00013918911,0.000003676273],"about_ca_topic_score_codex":0.0070237876,"about_ca_topic_score_gemma":0.006551438,"teacher_disagreement_score":0.0070237876,"about_ca_system_score_codex":0.0010590077,"about_ca_system_score_gemma":0.0014208028,"threshold_uncertainty_score":0.0139657855},"labels":[],"label_agreement":null},{"id":"W41182841","doi":"10.1007/978-3-642-28209-6_11","title":"On Barrier Resilience of Sensor Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Computer science; Materials science","score_opus":0.009986137173119657,"score_gpt":0.2212717249477825,"score_spread":0.21128558777466283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41182841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026750728,0.048346583,0.82987744,0.0072723716,0.0028881405,0.00011896493,0.0002677523,0.00064302515,0.08383492],"genre_scores_gemma":[0.7338901,0.07214476,0.13020967,0.0018338257,0.0041981735,0.0003881602,0.00043712003,0.00067422935,0.056223918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992731,0.00019623902,0.000035599467,0.000114485614,0.00028067429,0.00009993902],"domain_scores_gemma":[0.9976419,0.0015638928,0.00014030226,0.00032805855,0.00023846654,0.00008736242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011841384,0.0011564504,0.0010344317,0.0014142846,0.0006013388,0.0013882318,0.0016333782,0.0011829247,0.004504816],"category_scores_gemma":[0.006056816,0.0004890908,0.0006913906,0.0015445336,0.0023595686,0.004157831,0.0022629327,0.003481078,0.0007962275],"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.00009374816,0.00002717075,0.00016108419,0.00049004436,0.000055238514,0.00014534657,0.00017332184,0.10629051,0.0041936454,0.810875,0.011781261,0.06571368],"study_design_scores_gemma":[0.000014351802,0.000046508314,0.00017154391,0.00014831737,0.000026662126,0.00016257752,0.000054731656,0.124318376,0.0014830909,0.84980685,0.023743214,0.000023835542],"about_ca_topic_score_codex":0.0008308708,"about_ca_topic_score_gemma":0.0005236928,"teacher_disagreement_score":0.004504816,"about_ca_system_score_codex":0.0010874299,"about_ca_system_score_gemma":0.00043977774,"threshold_uncertainty_score":0.01507014},"labels":[],"label_agreement":null},{"id":"W41271234","doi":"10.1007/978-3-642-23623-5_24","title":"Augmented Virtuality for Arthroscopic Knee Surgery","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition Systems","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":"Kingston General Hospital; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; California HIV/AIDS Research Program","keywords":"Computer science; Knee surgery; Virtuality (gaming); Artificial intelligence; Osteoarthritis; Medicine; Pathology","score_opus":0.05302927964703044,"score_gpt":0.27287737808734475,"score_spread":0.2198480984403143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41271234","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12028974,0.004169584,0.8462978,0.0004573061,0.0009683147,0.00011075868,0.00081302976,0.0035666958,0.023326673],"genre_scores_gemma":[0.7847862,0.0021736845,0.19932282,0.00023648546,0.00022064848,0.00016800626,0.00057220814,0.00034144538,0.012178455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955934,0.00011609761,0.000019983976,0.00004225894,0.0002270442,0.000035309306],"domain_scores_gemma":[0.9996939,0.00011893277,0.000026624462,0.00007571327,0.000055840785,0.000029005922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030369524,0.00075983093,0.0004991362,0.0004399144,0.00021864258,0.0014823851,0.00078759243,0.0006046114,0.010901716],"category_scores_gemma":[0.0008687956,0.00041214484,0.00056730624,0.0003044652,0.00033939915,0.00073255185,0.0017764703,0.0005796258,0.0012492738],"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.0019388378,0.0002020663,0.001962814,0.0008403863,0.00019609253,0.00135621,0.0006338217,0.06377427,0.21048878,0.019154202,0.015004309,0.68444824],"study_design_scores_gemma":[0.0005611997,0.0033607113,0.014776219,0.00062922394,0.0005667686,0.012714989,0.0006128165,0.62112665,0.11662686,0.038903132,0.18957573,0.0005456843],"about_ca_topic_score_codex":0.0004923114,"about_ca_topic_score_gemma":0.0008375735,"teacher_disagreement_score":0.010901716,"about_ca_system_score_codex":0.00015460482,"about_ca_system_score_gemma":0.00026584676,"threshold_uncertainty_score":0.036469877},"labels":[],"label_agreement":null},{"id":"W41530335","doi":"10.1007/978-3-319-11662-4_20","title":"Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Dimension (graph theory); Compression (physics); Computer science; Sample (material); Graph; VC dimension; Binary number; Data compression; Algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics; Arithmetic","score_opus":0.024913944128829878,"score_gpt":0.2833774274205435,"score_spread":0.25846348329171365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41530335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097688725,0.0007224294,0.9856128,0.00030618775,0.00017407362,0.00010867422,0.00024463364,0.001092284,0.001970072],"genre_scores_gemma":[0.22016747,0.0015143486,0.7606151,0.00062589964,0.0010394674,0.00033047766,0.002628713,0.000660371,0.012418232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982186,0.00035932247,0.00009299176,0.00041567473,0.0007825514,0.00013086716],"domain_scores_gemma":[0.9963568,0.0015561295,0.00013410948,0.0011775894,0.0006965066,0.00007890854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020070309,0.0014736862,0.0014948494,0.0021893515,0.0006890591,0.0018143472,0.0023565958,0.0017744926,0.0043506157],"category_scores_gemma":[0.008810626,0.0005653438,0.0012111241,0.002791362,0.001430816,0.0034990383,0.0027563048,0.0028351278,0.0016638997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003057123,0.00018734668,0.00069957995,0.00019772306,0.000091354,0.00010603689,0.00015149215,0.093293056,0.009746802,0.025793262,0.010565594,0.85886216],"study_design_scores_gemma":[0.000022667964,0.000051033865,0.0004195692,0.000035544097,0.000034290366,0.0001303311,0.00004250665,0.93491334,0.008477087,0.05162788,0.0042295386,0.00001620201],"about_ca_topic_score_codex":0.004339612,"about_ca_topic_score_gemma":0.005671556,"teacher_disagreement_score":0.0043506157,"about_ca_system_score_codex":0.0010752277,"about_ca_system_score_gemma":0.0012934752,"threshold_uncertainty_score":0.014554203},"labels":[],"label_agreement":null},{"id":"W41647797","doi":"10.1007/978-3-319-10061-6_14","title":"Answering Yes/No Questions in Legal Bar Exams","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Alberta","funders":"","keywords":"Computer science; Question answering; Sentence; Artificial intelligence; Natural language processing; Task (project management); Negation; Construct (python library); Knowledge base; Variety (cybernetics); Natural language; Domain (mathematical analysis); Programming language","score_opus":0.016528756874145904,"score_gpt":0.2411456648454812,"score_spread":0.2246169079713353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41647797","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.48221344,0.0027169678,0.12378997,0.02021088,0.002510763,0.0010084551,0.0038643624,0.0040395567,0.35964563],"genre_scores_gemma":[0.8593863,0.0007907717,0.054451153,0.0024524515,0.000788016,0.00038219368,0.004715375,0.0005251567,0.076508656],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9942673,0.003053308,0.00031713003,0.00067281025,0.0011431748,0.0005462132],"domain_scores_gemma":[0.9780742,0.017128743,0.0011859593,0.0007223326,0.0018685955,0.0010201908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00542865,0.00057568285,0.0006538981,0.00089638267,0.0014503746,0.0035186121,0.0011434937,0.0021461148,0.03483853],"category_scores_gemma":[0.046410188,0.00043015997,0.0005510755,0.000686685,0.0007860018,0.0058331955,0.0025167488,0.00227912,0.011997291],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012223095,0.0017698177,0.053805914,0.000611019,0.00007324704,0.00066976465,0.010746297,0.0033924482,0.0054688742,0.04741181,0.18861297,0.6862156],"study_design_scores_gemma":[0.00026351766,0.0009946261,0.09658445,0.0020669925,0.00021932511,0.0013270311,0.026457101,0.048803754,0.016268432,0.2937201,0.5130827,0.0002120101],"about_ca_topic_score_codex":0.0015060869,"about_ca_topic_score_gemma":0.0024489288,"teacher_disagreement_score":0.03483853,"about_ca_system_score_codex":0.0007944166,"about_ca_system_score_gemma":0.0010978945,"threshold_uncertainty_score":0.11654651},"labels":[],"label_agreement":null},{"id":"W420436089","doi":"10.1007/978-3-319-09274-4_30","title":"Compression and Decompression in Cognition","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","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":"Carleton University","funders":"","keywords":"Computer science; Decompression; Compression (physics); Context (archaeology); Cognition; Data compression; Cognitive science; Artificial intelligence; Cognitive psychology; Psychology; Surgery; Neuroscience; Medicine; History","score_opus":0.0077334477379933765,"score_gpt":0.25769178021470074,"score_spread":0.24995833247670737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W420436089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047533747,0.061220706,0.5559953,0.006811887,0.0018337679,0.00011565445,0.0008757812,0.00271323,0.3229],"genre_scores_gemma":[0.6910103,0.024137305,0.14188874,0.0007230955,0.0019162436,0.00022662796,0.0010743792,0.0005857504,0.13843763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998275,0.000034295335,0.000013709872,0.00003945893,0.00006636103,0.000018597317],"domain_scores_gemma":[0.99966955,0.00014655184,0.000018009954,0.00009737352,0.00005347151,0.000015086361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022773693,0.00052932405,0.00043065232,0.0007152812,0.00039332092,0.0018481261,0.0005277014,0.0005863874,0.012822113],"category_scores_gemma":[0.0012300548,0.00019111288,0.000313366,0.00109586,0.0020502312,0.0030681419,0.00074968755,0.0009144633,0.0021617818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009447497,0.0000219811,0.00013311955,0.00029222062,0.000022649505,0.0001310311,0.00042256477,0.0033456616,0.0056745834,0.62519354,0.018774325,0.34589377],"study_design_scores_gemma":[0.000015422747,0.00002884502,0.0004234773,0.000065798915,0.0000129469645,0.00025982165,0.0001326298,0.008662242,0.0047104214,0.94293433,0.042738084,0.00001595678],"about_ca_topic_score_codex":0.0010002309,"about_ca_topic_score_gemma":0.0006464925,"teacher_disagreement_score":0.012822113,"about_ca_system_score_codex":0.00061915495,"about_ca_system_score_gemma":0.0003969608,"threshold_uncertainty_score":0.042894244},"labels":[],"label_agreement":null},{"id":"W4205148537","doi":"10.1007/978-3-030-86356-2_16","title":"On Computing in the Network: Covid-19 Coughs Detection Case Study","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","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":"Concordia University; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Edge computing; Cloud computing; Quality of service; Latency (audio); Enhanced Data Rates for GSM Evolution; Mist; Edge device; Computer network; Distributed computing; Operating system; Artificial intelligence; Telecommunications","score_opus":0.03593698811021508,"score_gpt":0.2800680999908639,"score_spread":0.24413111188064882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205148537","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.850462,0.0018675381,0.05266884,0.0050101485,0.00020746564,0.0007191718,0.0018356247,0.0006881351,0.086541034],"genre_scores_gemma":[0.96235436,0.0006722362,0.025606558,0.0003032426,0.00006051447,0.00008860906,0.0007241097,0.0000829484,0.010107595],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978362,0.00063525385,0.00010564265,0.00029289039,0.00064617576,0.000483874],"domain_scores_gemma":[0.99273527,0.004467491,0.00036094154,0.0006365965,0.0012230792,0.0005765904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015661123,0.00049428886,0.00051397097,0.0013631689,0.0026469573,0.0020575693,0.0014414424,0.0033609106,0.0030588736],"category_scores_gemma":[0.008537249,0.00029171974,0.00038760024,0.0027654476,0.0012375755,0.0021351064,0.001311513,0.0011241189,0.00053938606],"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.0024963298,0.0047540553,0.209255,0.0013368576,0.00026946506,0.03397255,0.008646371,0.12050577,0.014718793,0.12596947,0.10247021,0.3756051],"study_design_scores_gemma":[0.00025352728,0.0013942446,0.050631013,0.0004334316,0.00022036603,0.021920566,0.018832205,0.72280234,0.029004555,0.04425372,0.11007734,0.00017678645],"about_ca_topic_score_codex":0.027528668,"about_ca_topic_score_gemma":0.03300167,"teacher_disagreement_score":0.027528668,"about_ca_system_score_codex":0.001807696,"about_ca_system_score_gemma":0.0014617633,"threshold_uncertainty_score":0.054736853},"labels":[],"label_agreement":null},{"id":"W4205250726","doi":"10.1007/978-3-030-91434-9_6","title":"Differentially Private Submodular Maximization over Integer Lattice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Computer science; Maximization; Cardinality (data modeling); Automatic summarization; Greedy algorithm; Integer (computer science); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Data mining; Algorithm","score_opus":0.01746079052434353,"score_gpt":0.2340155430445845,"score_spread":0.21655475252024098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205250726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07546539,0.002047923,0.80631167,0.006055843,0.00037190746,0.00017050124,0.0022025688,0.0014922186,0.10588195],"genre_scores_gemma":[0.78610706,0.0019741806,0.16487738,0.0008946379,0.00063536235,0.00024850472,0.0013404037,0.0005517203,0.04337069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985499,0.000602071,0.000041623996,0.00022079128,0.00037869078,0.00020694279],"domain_scores_gemma":[0.99793303,0.00123723,0.00012355963,0.0004588959,0.000112589696,0.00013469518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492875,0.0007149292,0.0011227358,0.00041464466,0.00062244764,0.0024160314,0.0013388303,0.00078712945,0.006840777],"category_scores_gemma":[0.0057738326,0.00048317522,0.0004959494,0.0015792045,0.001242089,0.0042268904,0.0021599045,0.0029883503,0.0016305107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003516812,0.000123415,0.00022964504,0.00022516293,0.000031709587,0.000067468594,0.00011072949,0.07638684,0.0031154451,0.8240876,0.023923326,0.07134694],"study_design_scores_gemma":[0.000057691057,0.00003815081,0.000102868384,0.00002925272,0.000011917377,0.00008869534,0.000029840689,0.16536619,0.0017365755,0.82447195,0.008051844,0.000015056357],"about_ca_topic_score_codex":0.00064830837,"about_ca_topic_score_gemma":0.00093919237,"teacher_disagreement_score":0.006840777,"about_ca_system_score_codex":0.0023214356,"about_ca_system_score_gemma":0.0013502243,"threshold_uncertainty_score":0.022884667},"labels":[],"label_agreement":null},{"id":"W4205301710","doi":"10.1007/978-3-030-93489-7_8","title":"Width Measures of Alternating Finite Automata","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Automaton; Exponential function; Tree (set theory); Existentialism; Exponential growth; Finite-state machine; Polynomial; Computation; Discrete mathematics; Combinatorics; State (computer science); Algorithm; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.027431598995972806,"score_gpt":0.24702915329241187,"score_spread":0.21959755429643907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205301710","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.36094058,0.006197905,0.49728888,0.0016469905,0.0006648855,0.00007798638,0.0006661523,0.00074500754,0.13177156],"genre_scores_gemma":[0.88898987,0.0021102624,0.071692795,0.00037292935,0.00090730883,0.00025833983,0.0006085934,0.0006108419,0.034449104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987902,0.00028354576,0.000102332524,0.00030115663,0.0003882692,0.00013452487],"domain_scores_gemma":[0.9943178,0.00367403,0.00043861184,0.0005582425,0.0005113347,0.0005000551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012906626,0.00084823195,0.0009065394,0.0024064735,0.001036029,0.0042418693,0.0018213504,0.0011322006,0.0063601374],"category_scores_gemma":[0.007428896,0.0009254709,0.0007717557,0.0020680192,0.0023423133,0.01096949,0.002064738,0.0034902769,0.0008275325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039175906,0.000017634708,0.0001737861,0.000043823085,0.0000069658645,0.000021283593,0.00020553546,0.0013987524,0.0018028335,0.9861513,0.0007167638,0.009422115],"study_design_scores_gemma":[0.000005144065,0.00001803318,0.00023152336,0.00002116774,0.000007791553,0.00005404063,0.000071120405,0.007861253,0.0007640009,0.98872757,0.0022275154,0.000010953888],"about_ca_topic_score_codex":0.00032325616,"about_ca_topic_score_gemma":0.00032232003,"teacher_disagreement_score":0.0063601374,"about_ca_system_score_codex":0.0012870118,"about_ca_system_score_gemma":0.0003483483,"threshold_uncertainty_score":0.021276772},"labels":[],"label_agreement":null},{"id":"W4205355385","doi":"10.1007/978-3-030-93722-5_15","title":"Statistical Shape Analysis of the Tricuspid Valve in Hypoplastic Left Heart Syndrome","year":2022,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Congenital heart defects research","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":"Queen's University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Heart, Lung, and Blood Institute","keywords":"Atrioventricular valve; Tricuspid valve; Hypoplastic left heart syndrome; Regurgitation (circulation); Heart valve; Cardiology; Computer science; Representation (politics); Heart disease; Medicine; Internal medicine; Ventricle","score_opus":0.010458000347446964,"score_gpt":0.27894504190841013,"score_spread":0.26848704156096315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205355385","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.9769208,0.0003571032,0.021259386,0.000120154,0.00002873459,0.00002139703,0.00045121866,0.00018776373,0.00065349246],"genre_scores_gemma":[0.99469405,0.00008899166,0.0044089863,0.000021852524,0.000022527627,0.0000091617,0.00037380986,0.000083742765,0.0002968741],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999321,0.00021482994,0.00006594369,0.000110483365,0.00023448333,0.00005324818],"domain_scores_gemma":[0.995462,0.0020913188,0.00073194224,0.0004724544,0.0008587938,0.00038349075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012508776,0.00027450334,0.00040526674,0.002177932,0.00030804513,0.00089157815,0.00049062935,0.0004253573,0.0011009455],"category_scores_gemma":[0.0062414543,0.00017432794,0.00072711956,0.00086891727,0.00041300556,0.0002357336,0.0005771134,0.00041024192,0.00032460788],"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.002649123,0.00013784895,0.60957736,0.00018349798,0.00042269853,0.0032250802,0.00046681403,0.01818716,0.16345184,0.0021983492,0.0015880602,0.19791216],"study_design_scores_gemma":[0.000039055696,0.00031795463,0.8143402,0.000026425147,0.00015183986,0.0058101183,0.00043434862,0.15430073,0.020286478,0.0031702525,0.0010339413,0.000088588866],"about_ca_topic_score_codex":0.001471374,"about_ca_topic_score_gemma":0.001599644,"teacher_disagreement_score":0.002177932,"about_ca_system_score_codex":0.00032693567,"about_ca_system_score_gemma":0.00038739652,"threshold_uncertainty_score":0.0066153407},"labels":[],"label_agreement":null},{"id":"W4205532491","doi":"10.1007/978-3-540-69073-3_1","title":"11th International Workshop on Aspect-Oriented Modeling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"McGill University","funders":"","keywords":"Computer science; Presentation (obstetrics); Software engineering; Aspect-oriented programming; Process (computing); Software; Systems engineering; Engineering; Programming language","score_opus":0.04883113951744619,"score_gpt":0.29297219533266977,"score_spread":0.24414105581522358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205532491","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055918563,0.0043379636,0.92691404,0.0019390965,0.0035808943,0.00016355955,0.00034516034,0.004921376,0.05220613],"genre_scores_gemma":[0.06959641,0.010376467,0.7643624,0.0013403932,0.0014624605,0.00037277344,0.005052148,0.004700135,0.1427368],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824095,0.00049413176,0.00017190905,0.00025187747,0.0006915993,0.00014947103],"domain_scores_gemma":[0.99864215,0.00027970396,0.00004884848,0.00057785586,0.0003422608,0.0001092105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031484612,0.001492217,0.0012701887,0.0011220013,0.000577336,0.0037141016,0.0024224457,0.0013117272,0.02276603],"category_scores_gemma":[0.0033224737,0.0008892264,0.0019051614,0.0011826673,0.00051802665,0.0035974754,0.002435195,0.002771805,0.008188599],"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.00028584755,0.0004013876,0.0010746414,0.0005454307,0.00015507595,0.00041660757,0.0006284581,0.01171681,0.012551206,0.12133339,0.10457696,0.74631405],"study_design_scores_gemma":[0.000049421782,0.0001258568,0.0007369567,0.0004017482,0.00016863663,0.0007385349,0.00013863895,0.068707146,0.012220029,0.09634488,0.82032764,0.000040528063],"about_ca_topic_score_codex":0.0012537834,"about_ca_topic_score_gemma":0.0019516755,"teacher_disagreement_score":0.97723395,"about_ca_system_score_codex":0.0005915962,"about_ca_system_score_gemma":0.001233577,"threshold_uncertainty_score":0.076159954},"labels":[],"label_agreement":null},{"id":"W4205605711","doi":"10.1007/978-3-319-91464-0","title":"Intelligent Tutoring Systems","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Multimedia; Data science; Human–computer interaction","score_opus":0.02347945695604161,"score_gpt":0.2558925872747761,"score_spread":0.23241313031873448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205605711","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010971727,0.017132945,0.32652175,0.0019140559,0.002895301,0.0002870376,0.0011905665,0.017073035,0.6220135],"genre_scores_gemma":[0.115970835,0.008482689,0.10172045,0.0006867968,0.0009637572,0.00022668247,0.0031108195,0.00061096565,0.76822704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997509,0.00003485254,0.000014602098,0.000059103204,0.00011952527,0.000020933703],"domain_scores_gemma":[0.9997918,0.000048332564,0.000008494735,0.000047869984,0.00008309767,0.000020439606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027046216,0.00063779636,0.00047437698,0.0005552152,0.0003846874,0.0015053973,0.0008202958,0.00091467076,0.047574952],"category_scores_gemma":[0.0010170053,0.00021749134,0.00026449317,0.00052323006,0.0002143837,0.0014128691,0.0011988654,0.00073450705,0.029910732],"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.000060392897,0.00008673352,0.0001713298,0.00018748149,0.000017169903,0.000054919128,0.00008666258,0.002392172,0.007794193,0.016583158,0.100504525,0.8720613],"study_design_scores_gemma":[0.00003732299,0.00018244158,0.0011023841,0.0001551581,0.000045153152,0.00044325844,0.0000829429,0.027258962,0.019655984,0.032744903,0.9182634,0.000027981658],"about_ca_topic_score_codex":0.00033485433,"about_ca_topic_score_gemma":0.00048475483,"teacher_disagreement_score":0.047574952,"about_ca_system_score_codex":0.00032689015,"about_ca_system_score_gemma":0.00033403744,"threshold_uncertainty_score":0.15915412},"labels":[],"label_agreement":null},{"id":"W4205606434","doi":"10.1007/978-3-030-90439-5_8","title":"Putting Table Cartograms into Practice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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 Saskatchewan","funders":"","keywords":"Computer science; Table (database); Artificial intelligence; Data mining","score_opus":0.020523478250309386,"score_gpt":0.29755575248280897,"score_spread":0.2770322742324996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205606434","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.004021523,0.0020315517,0.68339926,0.004495595,0.0013980797,0.00012622427,0.0011722407,0.006701919,0.29665357],"genre_scores_gemma":[0.070127964,0.0035369426,0.8324435,0.00049588195,0.00020551088,0.0002350807,0.0016238631,0.0035249786,0.08780623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908876,0.00033069574,0.00005692575,0.00017595726,0.00028418613,0.000063524465],"domain_scores_gemma":[0.99799675,0.0006490852,0.000061928135,0.0006821526,0.0005137895,0.00009622751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011690508,0.0012261659,0.00056695193,0.0029275403,0.0018226338,0.007191486,0.0015587355,0.0014858213,0.10330769],"category_scores_gemma":[0.008012395,0.0010353945,0.00082328415,0.0055510746,0.0028140564,0.009046497,0.002947359,0.002052968,0.023360135],"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.000031437292,0.000018039029,0.0003474061,0.0002174156,0.000012420267,0.00013177557,0.0016727935,0.004248317,0.00054270745,0.6717857,0.06994049,0.2510515],"study_design_scores_gemma":[0.000015028885,0.000024729032,0.00018742753,0.0003899957,0.000013914326,0.0001570898,0.0015788757,0.009962389,0.00074833265,0.41259968,0.5742949,0.000027497947],"about_ca_topic_score_codex":0.008098466,"about_ca_topic_score_gemma":0.012053518,"teacher_disagreement_score":0.10330769,"about_ca_system_score_codex":0.0013828013,"about_ca_system_score_gemma":0.0017501776,"threshold_uncertainty_score":0.34559864},"labels":[],"label_agreement":null},{"id":"W4205679529","doi":"10.1007/978-3-030-93176-6_35","title":"An Efficient Oracle for Counting Shortest Paths in Planar Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Voronoi diagram; Planar graph; Shortest path problem; Mathematics; Path (computing); Binary logarithm; Planar; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.022331315858264866,"score_gpt":0.29187573104238107,"score_spread":0.2695444151841162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205679529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045522805,0.0021997758,0.89645433,0.0024230347,0.0006069112,0.0005201732,0.005148456,0.014323721,0.0328009],"genre_scores_gemma":[0.2496929,0.0015693232,0.70856315,0.0008568921,0.0007014252,0.0008564848,0.011893106,0.0022768034,0.023589972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951567,0.0009061431,0.00046763348,0.0009774719,0.00193121,0.00056084566],"domain_scores_gemma":[0.9844765,0.009875654,0.0004937422,0.003574682,0.0010104156,0.0005689493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022016368,0.0022606333,0.0031498575,0.0021437786,0.0012985163,0.00552499,0.0069598756,0.0035293603,0.02146043],"category_scores_gemma":[0.014916492,0.0016814356,0.0019171742,0.00688221,0.0017621826,0.01587324,0.0064414307,0.005926986,0.005897358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020548243,0.00088879117,0.002200349,0.0017459827,0.00015950657,0.0003288355,0.0004414163,0.041788574,0.030709162,0.15760148,0.07372327,0.68835783],"study_design_scores_gemma":[0.0007503276,0.00046349724,0.0023804316,0.0002440496,0.00031846346,0.0010877254,0.0005085931,0.4321297,0.024685826,0.48881295,0.048412025,0.00020645505],"about_ca_topic_score_codex":0.002642613,"about_ca_topic_score_gemma":0.0041029616,"teacher_disagreement_score":0.02146043,"about_ca_system_score_codex":0.002598234,"about_ca_system_score_gemma":0.0035844673,"threshold_uncertainty_score":0.071792364},"labels":[],"label_agreement":null},{"id":"W4205718953","doi":"10.1007/978-3-030-90439-5_4","title":"DeepSolfège: Recognizing Solfège Hand Signs Using Convolutional Neural Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition 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 Victoria","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; RGB color model; Deep learning; Sign (mathematics); Pixel; Domain (mathematical analysis); Image (mathematics); Computer vision; Pattern recognition (psychology); Speech recognition","score_opus":0.04383600625549706,"score_gpt":0.26004821374262643,"score_spread":0.21621220748712938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205718953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047060058,0.001711754,0.8904006,0.0002693817,0.00043993085,0.00015621261,0.0023668532,0.03863634,0.01895885],"genre_scores_gemma":[0.2887525,0.0015131937,0.59738386,0.00046167985,0.00009008456,0.00020768245,0.0112095475,0.0016571276,0.098724335],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998863,0.00000789383,0.0000049813357,0.000035374655,0.000042087,0.000023408238],"domain_scores_gemma":[0.9998981,0.000020949046,0.000007971482,0.00002382329,0.000036739664,0.000012422083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017776123,0.0011882993,0.00058098615,0.0005766337,0.00024649053,0.0008557967,0.0010812341,0.0007976985,0.011451117],"category_scores_gemma":[0.00036716159,0.0004794704,0.0005706346,0.00038989534,0.00028174487,0.0011270945,0.0011471234,0.00093193783,0.0058093057],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026422262,0.00009897949,0.000997715,0.00016284338,0.00008156605,0.00019926582,0.00006072919,0.031399064,0.077754036,0.0033628256,0.03167581,0.853943],"study_design_scores_gemma":[0.000031560983,0.00019940689,0.00215806,0.000098673285,0.000056199504,0.0004447212,0.000052283678,0.845625,0.09567819,0.006923877,0.048676405,0.000055638015],"about_ca_topic_score_codex":0.0072624413,"about_ca_topic_score_gemma":0.017291691,"teacher_disagreement_score":0.011451117,"about_ca_system_score_codex":0.00045595717,"about_ca_system_score_gemma":0.0005555885,"threshold_uncertainty_score":0.038307846},"labels":[],"label_agreement":null},{"id":"W4205934954","doi":"10.1007/978-3-030-92681-6_9","title":"A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Monotone polygon; Time complexity; Function (biology); Combinatorics; Matching (statistics); Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Streaming algorithm; Binary logarithm; Mathematics; Computer science; Algorithm; Upper and lower bounds","score_opus":0.023621794034393018,"score_gpt":0.2539519593697021,"score_spread":0.2303301653353091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205934954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03368455,0.00073048833,0.94699204,0.0007742494,0.00017724291,0.0006842123,0.0016081729,0.0051313285,0.010217735],"genre_scores_gemma":[0.11654353,0.0002578208,0.8743124,0.00024840346,0.00011252503,0.00048030846,0.002731029,0.0005691071,0.0047448506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987016,0.00020980298,0.00010169034,0.0004133912,0.00037110716,0.00020248453],"domain_scores_gemma":[0.99752134,0.0014131718,0.00013415115,0.00043670938,0.0003230819,0.00017156098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015918904,0.001967063,0.0026967993,0.0010602812,0.001000657,0.002378867,0.00423803,0.001938956,0.015027038],"category_scores_gemma":[0.005404557,0.0011492611,0.0015185666,0.0030244873,0.00073892483,0.0047656284,0.0034100213,0.00298577,0.0026758905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613285,0.0007755433,0.0010758945,0.0007883049,0.00015425056,0.00018382038,0.00027981546,0.16146168,0.013968653,0.04872838,0.040996388,0.730426],"study_design_scores_gemma":[0.00022653301,0.00013486508,0.0002760599,0.000037429974,0.00003311485,0.00015043753,0.0001033053,0.93348336,0.0030125189,0.05900714,0.003509949,0.00002517631],"about_ca_topic_score_codex":0.0039027096,"about_ca_topic_score_gemma":0.006808506,"teacher_disagreement_score":0.015027038,"about_ca_system_score_codex":0.0024345904,"about_ca_system_score_gemma":0.0032784268,"threshold_uncertainty_score":0.050270498},"labels":[],"label_agreement":null},{"id":"W4205947909","doi":"10.1007/978-3-030-92681-6_11","title":"Computing the One-Visibility Cop-Win Strategies for Trees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Key (lock); Search tree; Tree structure; Algorithm; Theoretical computer science; Combinatorics; Search algorithm; Mathematics; Binary tree; Computer security","score_opus":0.0434007628512319,"score_gpt":0.31865329805760945,"score_spread":0.27525253520637755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205947909","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.5612909,0.0011622034,0.38338673,0.002348377,0.00020841171,0.00026336228,0.0014329522,0.0013417936,0.0485653],"genre_scores_gemma":[0.9075993,0.0004563201,0.07715538,0.00022100504,0.000118094606,0.00014968032,0.0010671712,0.00044315838,0.01278981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846387,0.00034246157,0.00008025483,0.00033869295,0.00024876973,0.0005260473],"domain_scores_gemma":[0.98961455,0.007914054,0.00047464535,0.00080018194,0.0003733836,0.00082326465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016062465,0.0015342772,0.0022147663,0.0015056798,0.0016014704,0.0071265115,0.0032629997,0.002597206,0.014560189],"category_scores_gemma":[0.015125003,0.0012459619,0.0014727301,0.0020638118,0.0029473677,0.010162863,0.0028737327,0.003528235,0.0019258189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001134159,0.00052492996,0.004444905,0.0005736188,0.00017407976,0.00027922494,0.000980644,0.19274421,0.0036932253,0.67820334,0.018123547,0.099124044],"study_design_scores_gemma":[0.00006301319,0.000073100484,0.00039297782,0.000038920352,0.000036248257,0.000067330024,0.00022675806,0.21338029,0.000767395,0.7838434,0.0010872047,0.000023362025],"about_ca_topic_score_codex":0.003175652,"about_ca_topic_score_gemma":0.0049804193,"teacher_disagreement_score":0.014560189,"about_ca_system_score_codex":0.002547434,"about_ca_system_score_gemma":0.002287158,"threshold_uncertainty_score":0.048708677},"labels":[],"label_agreement":null},{"id":"W4205949109","doi":"10.1007/3-540-45009-2","title":"OpenMP Shared Memory Parallel Programming","year":2003,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing 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":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Shared memory; Programming language; Operating system","score_opus":0.019064524919647035,"score_gpt":0.25253108506596217,"score_spread":0.23346656014631514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205949109","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053361515,0.003171841,0.8156406,0.000650293,0.0017861371,0.00009811938,0.00034474378,0.01254299,0.16042905],"genre_scores_gemma":[0.071911424,0.0040888404,0.56536645,0.00047538136,0.00094330136,0.0003578627,0.0016730777,0.0050352244,0.35014844],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997477,0.000023796638,0.000013978146,0.00003512196,0.0001505492,0.000028879793],"domain_scores_gemma":[0.99955744,0.00009971141,0.000016217276,0.00012412351,0.00016498468,0.000037450023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025176725,0.0007331333,0.0006174734,0.0004324703,0.00076276803,0.0012577322,0.0017108253,0.00049100665,0.029271698],"category_scores_gemma":[0.0010171802,0.000623648,0.00042914794,0.0011211433,0.00045034348,0.0015629936,0.0013819673,0.0018968902,0.012869519],"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.0001618145,0.00008029819,0.00022117041,0.00046605713,0.000038777896,0.0001297074,0.00019044382,0.009874774,0.0071982886,0.13091144,0.17078182,0.6799454],"study_design_scores_gemma":[0.000080076265,0.000072908384,0.00039529087,0.00012529243,0.000057426765,0.0005364504,0.00004578037,0.059933033,0.013994535,0.23582475,0.6888966,0.000037909747],"about_ca_topic_score_codex":0.00040360406,"about_ca_topic_score_gemma":0.00060791255,"teacher_disagreement_score":0.029271698,"about_ca_system_score_codex":0.0003341148,"about_ca_system_score_gemma":0.0005188843,"threshold_uncertainty_score":0.09792358},"labels":[],"label_agreement":null},{"id":"W4205983800","doi":"10.1007/978-3-642-23774-4","title":"Human-Computer Interaction – INTERACT 2011","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Queen's University","funders":"","keywords":"Human interaction; Set (abstract data type); Computer science; Human–computer interaction; Volume (thermodynamics); World Wide Web; Physics; Programming language","score_opus":0.028839607579266426,"score_gpt":0.29161251588461284,"score_spread":0.26277290830534644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205983800","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005668115,0.088176005,0.21930781,0.002885262,0.018329455,0.00025862418,0.0010711192,0.008409284,0.65589434],"genre_scores_gemma":[0.010753057,0.02421128,0.018254256,0.00046776165,0.0013524817,0.00015465629,0.0011945767,0.0008835894,0.94272834],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948955,0.000055021505,0.000023419601,0.00009699807,0.00029436356,0.000040489995],"domain_scores_gemma":[0.999308,0.0002305922,0.000024531584,0.000103290105,0.00023406117,0.00009950199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059396285,0.0019272187,0.0013206274,0.001292426,0.0007694194,0.00284098,0.0013865372,0.0017434144,0.10874242],"category_scores_gemma":[0.000966512,0.00079682487,0.0005744983,0.0016293918,0.000677403,0.0038670758,0.0014790419,0.0022768269,0.07006095],"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.00010045453,0.00010529964,0.000109248766,0.0005451583,0.000026105628,0.00007824034,0.000104371444,0.0012592452,0.005904635,0.01086143,0.3987977,0.58210814],"study_design_scores_gemma":[0.000018884803,0.00012018786,0.0011486599,0.00036651996,0.000041606974,0.0007711645,0.000069480964,0.0065100933,0.0041613425,0.0073300074,0.97942126,0.000040904106],"about_ca_topic_score_codex":0.001447892,"about_ca_topic_score_gemma":0.0028397175,"teacher_disagreement_score":0.10874242,"about_ca_system_score_codex":0.0007765749,"about_ca_system_score_gemma":0.00082042365,"threshold_uncertainty_score":0.3637796},"labels":[],"label_agreement":null},{"id":"W4206056756","doi":"10.1007/978-3-030-90439-5_46","title":"Unsupervised Pixel-Wise Weighted Adversarial Domain Adaptation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Leverage (statistics); Weighting; Pattern recognition (psychology); Domain adaptation; Pixel; Machine learning; Domain (mathematical analysis); Feature (linguistics); Convolutional neural network; Adaptation (eye); Classifier (UML); Mathematics","score_opus":0.019715056771635906,"score_gpt":0.23448757379452811,"score_spread":0.2147725170228922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206056756","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.0036748417,0.0002792705,0.9936212,0.00006307814,0.000054342392,0.000022404996,0.00007817816,0.00054373866,0.0016629859],"genre_scores_gemma":[0.36249867,0.0014384851,0.59851956,0.0005292083,0.0002215121,0.00021917476,0.0019138189,0.000811604,0.033848036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996402,0.0000791667,0.000011849115,0.0001358695,0.000091612696,0.00004134872],"domain_scores_gemma":[0.99941957,0.0002621283,0.00003312,0.00016596283,0.000087416076,0.00003184645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006973496,0.0009326347,0.0010804932,0.00047431886,0.00026434165,0.0007580872,0.0018227926,0.0011748127,0.0035369615],"category_scores_gemma":[0.0016514112,0.00048660915,0.0009145165,0.0007682809,0.00074022653,0.001205635,0.0021724147,0.0020047878,0.0020723636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015492892,0.00012488142,0.00036028586,0.00016100876,0.00014015884,0.00012521187,0.00005529432,0.5495808,0.027108844,0.02130355,0.011272637,0.38961238],"study_design_scores_gemma":[0.000002887577,0.000018068524,0.000111940295,0.0000072094517,0.000009394069,0.00006761763,0.000004944254,0.9865819,0.0036705825,0.008054116,0.0014642435,0.0000071613604],"about_ca_topic_score_codex":0.0015087647,"about_ca_topic_score_gemma":0.002290273,"teacher_disagreement_score":0.0035369615,"about_ca_system_score_codex":0.00041301028,"about_ca_system_score_gemma":0.00045180434,"threshold_uncertainty_score":0.011832356},"labels":[],"label_agreement":null},{"id":"W4206092953","doi":"10.1007/978-3-030-90436-4_20","title":"Hyperspectral Video Super-Resolution Using Beta Process and Bayesian Dictionary Learning","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","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":"Concordia University","funders":"","keywords":"Hyperspectral imaging; Computer science; Artificial intelligence; Image resolution; Pattern recognition (psychology); Coding (social sciences); Frame (networking); Computer vision; Bayesian probability; Dictionary learning; Sparse approximation; Mathematics; Telecommunications; Statistics","score_opus":0.00977172602150067,"score_gpt":0.2406529710151301,"score_spread":0.23088124499362944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206092953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017714626,0.00017397461,0.99718946,0.000047118712,0.000011664034,0.0000069259854,0.000020908363,0.000090165726,0.000688267],"genre_scores_gemma":[0.08369647,0.0010677696,0.9106037,0.00008835742,0.000072078714,0.000055258082,0.00023924721,0.00014058113,0.004036492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997218,0.00006965471,0.000014263711,0.0000537423,0.00011905571,0.000021416921],"domain_scores_gemma":[0.99953234,0.00024376545,0.00004252174,0.000059365644,0.000103055085,0.000018903851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007458836,0.000545541,0.0007029223,0.0005192905,0.00020260624,0.0008037163,0.00068533357,0.0005764293,0.0018404933],"category_scores_gemma":[0.0018288917,0.00052052224,0.00064264814,0.0009639518,0.00051760045,0.0014547477,0.00107399,0.0014917651,0.00089564256],"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.0001889357,0.00008876884,0.0006314067,0.00021762912,0.00012334045,0.000075301934,0.00010609031,0.26507774,0.044059157,0.05312911,0.0036523,0.63265026],"study_design_scores_gemma":[0.0000056736085,0.000016124086,0.00020839121,0.0000110787,0.000012350581,0.00006411581,0.0000074593254,0.9819179,0.0053021056,0.010990771,0.0014523675,0.000011573619],"about_ca_topic_score_codex":0.0014255511,"about_ca_topic_score_gemma":0.0026397677,"teacher_disagreement_score":0.0018404933,"about_ca_system_score_codex":0.00034017029,"about_ca_system_score_gemma":0.0004727573,"threshold_uncertainty_score":0.0061571},"labels":[],"label_agreement":null},{"id":"W4206207168","doi":"10.1007/978-3-030-92124-8_2","title":"Validating Safety Arguments with Lean","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"University of Toronto","funders":"","keywords":"Computer science; Leverage (statistics); Automated theorem proving; Lean manufacturing; Software engineering; Gas meter prover; Programming language; Artificial intelligence; Mathematical proof; Manufacturing engineering; Engineering","score_opus":0.009532352927065292,"score_gpt":0.19920878163334646,"score_spread":0.18967642870628118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206207168","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.017540164,0.00034103866,0.9123054,0.0025953404,0.00036175986,0.00019016322,0.0006760962,0.004254274,0.061735783],"genre_scores_gemma":[0.39396688,0.0004754713,0.5782804,0.0011593325,0.00026108036,0.00027210882,0.0023311574,0.001781537,0.021472061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855278,0.0063718227,0.00067580305,0.001573168,0.0050519225,0.000799525],"domain_scores_gemma":[0.93423915,0.051259495,0.0016591349,0.0077437395,0.004611946,0.00048654198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010774861,0.0012479448,0.0009963191,0.0028651883,0.0013968992,0.005795697,0.0028614034,0.0021735067,0.025291102],"category_scores_gemma":[0.066220276,0.0013028025,0.0023926594,0.0015363247,0.005109966,0.009544941,0.0075337947,0.004853132,0.0060945284],"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.00027096548,0.00019451932,0.0018404832,0.0003998508,0.000114463626,0.00039630465,0.0008618365,0.023537356,0.003127409,0.8157981,0.013967977,0.13949074],"study_design_scores_gemma":[0.00003801054,0.000039050785,0.00021082026,0.00020534474,0.000048635793,0.000099846526,0.00031329942,0.06878573,0.006247652,0.9024617,0.021524573,0.000025395737],"about_ca_topic_score_codex":0.0014594203,"about_ca_topic_score_gemma":0.002397383,"teacher_disagreement_score":0.025291102,"about_ca_system_score_codex":0.0020321975,"about_ca_system_score_gemma":0.002735952,"threshold_uncertainty_score":0.084607184},"labels":[],"label_agreement":null},{"id":"W4206233727","doi":"10.1007/978-3-030-92121-7","title":"Learning and Intelligent Optimization","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.011794082589354405,"score_gpt":0.24780645400041365,"score_spread":0.23601237141105924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206233727","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004112594,0.046721593,0.61099327,0.003626753,0.001619406,0.000051843235,0.0003913611,0.001207451,0.33127576],"genre_scores_gemma":[0.11382997,0.036286432,0.2111019,0.0013824129,0.002454462,0.00025578213,0.0009822175,0.0012949089,0.63241196],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980885,0.000041350846,0.000007425983,0.00003934944,0.0000912738,0.000011837402],"domain_scores_gemma":[0.99980515,0.000106769854,0.000010051448,0.000040407675,0.00002685058,0.000010827912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029417273,0.0009360813,0.0012294053,0.00059628015,0.0003220715,0.0013546442,0.00053354434,0.0006572351,0.020714985],"category_scores_gemma":[0.00096443685,0.00038033948,0.0004896713,0.0011544867,0.00093513326,0.0015764807,0.0009372539,0.0016078929,0.008575689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027334065,0.000050675488,0.00017236189,0.0003535832,0.00005465236,0.00003660158,0.00008233041,0.031525794,0.0013587427,0.38133198,0.1284501,0.45655578],"study_design_scores_gemma":[0.000011259851,0.000033658307,0.00044706362,0.0001290997,0.000023493612,0.00011445183,0.000028141965,0.06983423,0.0012552651,0.68209493,0.2460104,0.000017996676],"about_ca_topic_score_codex":0.00058769924,"about_ca_topic_score_gemma":0.0009103791,"teacher_disagreement_score":0.020714985,"about_ca_system_score_codex":0.0005190223,"about_ca_system_score_gemma":0.0003553302,"threshold_uncertainty_score":0.069298565},"labels":[],"label_agreement":null},{"id":"W4206235154","doi":"10.1007/978-3-540-78195-0_14","title":"Object-Oriented Reengineering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Université de Montréal","funders":"","keywords":"Business process reengineering; Computer science; Object (grammar); Engineering; Artificial intelligence; Operations management","score_opus":0.011814596666597843,"score_gpt":0.2183424629988468,"score_spread":0.20652786633224895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206235154","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030348642,0.002469176,0.89363575,0.00022299883,0.00018716665,0.00011369751,0.00006600463,0.0043084803,0.06864808],"genre_scores_gemma":[0.24965589,0.004544728,0.6168741,0.00024829432,0.0001343239,0.00009900145,0.0005676726,0.0017591885,0.12611681],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994261,0.000085385866,0.000029958454,0.00007175387,0.00033773697,0.000049134367],"domain_scores_gemma":[0.99940586,0.00019523758,0.000031269512,0.00026685125,0.000085959975,0.000014782848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009642357,0.0006266497,0.00041680472,0.0005741064,0.00028182627,0.0012061927,0.0014418439,0.00077583815,0.006232723],"category_scores_gemma":[0.0014487029,0.0004911548,0.00051099405,0.0008362556,0.00042147143,0.0020709303,0.00070224266,0.0010383324,0.002042995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006554266,0.00012428896,0.00034812547,0.00031214487,0.000031256055,0.00023013442,0.0004350934,0.010298081,0.029029196,0.11696334,0.0056697354,0.83649313],"study_design_scores_gemma":[0.00013173975,0.00024588872,0.0022274677,0.0003602013,0.0002244623,0.0027467755,0.00018108977,0.167747,0.1372011,0.2110003,0.47783753,0.00009641137],"about_ca_topic_score_codex":0.0004549825,"about_ca_topic_score_gemma":0.00083440106,"teacher_disagreement_score":0.006232723,"about_ca_system_score_codex":0.000250725,"about_ca_system_score_gemma":0.00026925237,"threshold_uncertainty_score":0.02085048},"labels":[],"label_agreement":null},{"id":"W4206247875","doi":"10.1007/978-3-030-92659-5_11","title":"ScaleNet: An Unsupervised Representation Learning Method for Limited Information","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Canadian Institute for Advanced Research","keywords":"Computer science; Artificial intelligence; Task (project management); Convolutional neural network; Representation (politics); Pattern recognition (psychology); Rotation (mathematics); Enhanced Data Rates for GSM Evolution; Scale (ratio); Machine learning; Artificial neural network; Deep learning; Feature learning","score_opus":0.025142420801092375,"score_gpt":0.31748589307844777,"score_spread":0.2923434722773554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206247875","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.001661057,0.00016655223,0.99258655,0.00008218313,0.00006839012,0.000032141903,0.00026631373,0.00401548,0.0011212163],"genre_scores_gemma":[0.05738563,0.0004955646,0.92677176,0.00019442248,0.00014950753,0.0002748692,0.0025841405,0.0018597529,0.010284351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994573,0.00012691478,0.000029523053,0.00013764034,0.00020237318,0.000046124933],"domain_scores_gemma":[0.99929214,0.0002511616,0.00003869648,0.00021519078,0.00016298289,0.00003981966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010514726,0.0011826832,0.0011498852,0.0014254106,0.0006325455,0.0014007164,0.0020790454,0.0011988231,0.009155294],"category_scores_gemma":[0.002938026,0.0006861871,0.0010172233,0.0019286658,0.00073559885,0.0028813083,0.0019037043,0.0018838386,0.0044665285],"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.00015600112,0.00008455039,0.0004086222,0.00017962675,0.00010763229,0.00010331271,0.00007976956,0.07201002,0.0087121455,0.037442677,0.03408994,0.8466256],"study_design_scores_gemma":[0.000019680141,0.000027148262,0.00017560185,0.000020143843,0.00002200207,0.0000667503,0.000020321439,0.9392544,0.0054461183,0.0424988,0.012430323,0.000018666986],"about_ca_topic_score_codex":0.004895855,"about_ca_topic_score_gemma":0.008578925,"teacher_disagreement_score":0.009155294,"about_ca_system_score_codex":0.00062358705,"about_ca_system_score_gemma":0.0010020913,"threshold_uncertainty_score":0.030627549},"labels":[],"label_agreement":null},{"id":"W4206253804","doi":"10.1007/3-540-45111-0","title":"Distributed Communities on the Web","year":2000,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Montréal","funders":"","keywords":"World Wide Web; Computer science","score_opus":0.018966275390775365,"score_gpt":0.23660146955550326,"score_spread":0.2176351941647279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206253804","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12022013,0.014030489,0.52338517,0.008087019,0.0015146808,0.00047717852,0.00059314485,0.0065116016,0.32518056],"genre_scores_gemma":[0.6761274,0.006823608,0.1305142,0.00044630186,0.0009836867,0.00034955214,0.0013621977,0.0009051734,0.18248796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00022701509,0.00003588189,0.00015769298,0.0003414766,0.00007363258],"domain_scores_gemma":[0.9979557,0.0007616655,0.000084428364,0.00052156503,0.00035271203,0.00032386035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529685,0.00040899607,0.00065118476,0.001570141,0.0019060757,0.0034240298,0.0010701917,0.0012289522,0.010279099],"category_scores_gemma":[0.0037867038,0.0004983506,0.0003947485,0.001932179,0.0011120113,0.0058378847,0.003434172,0.0011631509,0.0034972562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022511196,0.00021747012,0.0013619008,0.00041956423,0.00006915571,0.00050854514,0.0015728783,0.016719487,0.0068326565,0.6033929,0.05019095,0.3184894],"study_design_scores_gemma":[0.00009157598,0.00007994349,0.00094123953,0.00013029545,0.000038960232,0.0004473278,0.0006530479,0.0650486,0.003095045,0.7015566,0.22788,0.000037335216],"about_ca_topic_score_codex":0.0013478178,"about_ca_topic_score_gemma":0.0015714706,"teacher_disagreement_score":0.010279099,"about_ca_system_score_codex":0.00058835663,"about_ca_system_score_gemma":0.0007676226,"threshold_uncertainty_score":0.034386992},"labels":[],"label_agreement":null},{"id":"W4206256537","doi":"10.1007/11536444","title":"Artificial Immune Systems","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Immune Systems Applications","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.012810069277343501,"score_gpt":0.22917147526381562,"score_spread":0.21636140598647213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206256537","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.009584257,0.033689983,0.41690782,0.003052755,0.0051904316,0.0002043612,0.00029853432,0.0023938192,0.52867806],"genre_scores_gemma":[0.14766428,0.020531604,0.18078332,0.0021760224,0.0015472216,0.00030137826,0.00080023456,0.00043659998,0.6457594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998103,0.0000306078,0.000007682038,0.000036587633,0.0000977366,0.000017193866],"domain_scores_gemma":[0.9998267,0.000057235018,0.000011469612,0.000030899246,0.000060116472,0.000013607297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026380538,0.00059497793,0.00052187353,0.0006041158,0.0004019837,0.0013633942,0.000708608,0.0009096616,0.02103716],"category_scores_gemma":[0.00089400343,0.00022195728,0.0003333528,0.00047454363,0.00042118426,0.0013118564,0.0008259007,0.0011132503,0.008516294],"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.00004262268,0.00009535912,0.00024477503,0.00043408351,0.000048098518,0.0001666457,0.00014409664,0.009764933,0.009131596,0.2129378,0.10814374,0.6588462],"study_design_scores_gemma":[0.000025751742,0.0001334439,0.0005276381,0.00019810213,0.00005359472,0.0010202468,0.000077559045,0.04207936,0.009663307,0.2414426,0.7047462,0.0000322436],"about_ca_topic_score_codex":0.00016743947,"about_ca_topic_score_gemma":0.0002847383,"teacher_disagreement_score":0.02103716,"about_ca_system_score_codex":0.00031096133,"about_ca_system_score_gemma":0.00035913457,"threshold_uncertainty_score":0.07037634},"labels":[],"label_agreement":null},{"id":"W4206259777","doi":"10.1007/978-3-030-91100-3_8","title":"AI Methods of Autonomous Geological Target Selection in the Hunt for Signs of Extraterrestrial Life","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Support vector machine; Naive Bayes classifier; Classifier (UML); Random forest; Feature vector; Identification (biology); Feature selection; QUIET; Invariant (physics); Computer vision; Mathematics","score_opus":0.03913319094643349,"score_gpt":0.3036396473594522,"score_spread":0.26450645641301873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206259777","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.0037093307,0.0008122958,0.98711336,0.00016670272,0.000098475495,0.000022170716,0.000036469482,0.0002715021,0.0077696685],"genre_scores_gemma":[0.22968943,0.0015632592,0.7350306,0.0002751866,0.00021089352,0.00019601783,0.00022137482,0.00026464034,0.03254862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975353,0.00006597337,0.000014458383,0.000056953526,0.000086675376,0.00002247587],"domain_scores_gemma":[0.9991493,0.00060174137,0.00003894936,0.00005934793,0.0001224802,0.000028227214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049554446,0.000410326,0.00052622875,0.000691275,0.0004505232,0.001093854,0.00147387,0.0008783989,0.005665926],"category_scores_gemma":[0.0019029849,0.00037436854,0.00048122296,0.0009331529,0.00078443973,0.000991539,0.00092269864,0.0010898302,0.0011048286],"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.00011150948,0.000079654616,0.0007353305,0.0002483276,0.00008730038,0.0001429481,0.00029681379,0.4020331,0.011016804,0.11257524,0.0099384235,0.46273452],"study_design_scores_gemma":[0.0000069740586,0.000018975581,0.00019876371,0.00001255327,0.000008929004,0.000048226073,0.000037286805,0.9558532,0.001186522,0.03905765,0.003562227,0.000008701551],"about_ca_topic_score_codex":0.005309198,"about_ca_topic_score_gemma":0.0065591983,"teacher_disagreement_score":0.005665926,"about_ca_system_score_codex":0.00056132465,"about_ca_system_score_gemma":0.0005482809,"threshold_uncertainty_score":0.018954396},"labels":[],"label_agreement":null},{"id":"W4206363421","doi":"10.1007/978-3-540-75209-7_18","title":"A Business-Process-Driven Approach for Generating E-Commerce User Interfaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Queen's University","funders":"","keywords":"Computer science; Artifact-centric business process model; Usability; Business process modeling; Business process; Business Process Model and Notation; Business process management; Workflow; Business rule; Business process discovery; Interdependence; Process management; Software engineering; User interface; Knowledge management; Human–computer interaction; Work in process; Database; Engineering; Programming language","score_opus":0.041438178418240164,"score_gpt":0.2682192086273,"score_spread":0.22678103020905982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206363421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052517406,0.00004598018,0.98803383,0.00009175717,0.000033618202,0.00028526734,0.0002824773,0.00378997,0.0021853629],"genre_scores_gemma":[0.08369829,0.00008881468,0.91082823,0.0000935481,0.00001537172,0.00035825357,0.0011000077,0.00059275236,0.0032246667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912137,0.00020260326,0.000043226002,0.00014447374,0.00043453975,0.000053832326],"domain_scores_gemma":[0.99823916,0.0008982236,0.00004772345,0.00019141701,0.00058063096,0.000042858857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013439347,0.00081617443,0.0005271394,0.0013663189,0.0006474448,0.0019284161,0.0018334499,0.0012602054,0.0078558745],"category_scores_gemma":[0.0055963215,0.00071392726,0.0015028127,0.0010660057,0.0004682638,0.0012514283,0.0009844102,0.001268382,0.0022815773],"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.00039608998,0.0006478021,0.0037150988,0.0005416289,0.0001918043,0.00081601174,0.0009178937,0.23222156,0.033692356,0.08273435,0.015417737,0.6287076],"study_design_scores_gemma":[0.000028010854,0.000056513483,0.00039225814,0.000023983095,0.000038426988,0.00012507635,0.00005618991,0.95823133,0.015531801,0.017493417,0.007999952,0.000022952585],"about_ca_topic_score_codex":0.0039898255,"about_ca_topic_score_gemma":0.0062104966,"teacher_disagreement_score":0.0078558745,"about_ca_system_score_codex":0.0007839466,"about_ca_system_score_gemma":0.001327576,"threshold_uncertainty_score":0.026280463},"labels":[],"label_agreement":null},{"id":"W4206364501","doi":"10.1007/978-3-642-33503-7","title":"Intelligent Robotics and Applications","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Robotics; Artificial intelligence; Robot","score_opus":0.01319773463491632,"score_gpt":0.22707117822996783,"score_spread":0.2138734435950515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206364501","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016284104,0.064585656,0.15007591,0.0014740935,0.004491009,0.00015645752,0.00058701437,0.0031500137,0.77385145],"genre_scores_gemma":[0.009554611,0.030697703,0.039992876,0.00058530894,0.0010471672,0.00011497301,0.00095746765,0.0005604553,0.91648936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996356,0.000022769154,0.000014955492,0.000063806176,0.00023560548,0.000027183492],"domain_scores_gemma":[0.9998,0.00003893653,0.000008834447,0.000050355622,0.00007663056,0.000025218364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028761948,0.0016260257,0.0011535386,0.001755952,0.00058022357,0.0022910805,0.0012717558,0.001101991,0.06980697],"category_scores_gemma":[0.0006229224,0.0005577469,0.00056636805,0.0017805777,0.00067808677,0.0022325898,0.0018801328,0.0014511885,0.054347806],"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.000023184619,0.000037831556,0.00007461759,0.0005087924,0.000020395286,0.000059337228,0.000083977815,0.0019364918,0.004481259,0.050210744,0.2386504,0.70391303],"study_design_scores_gemma":[0.000003980306,0.000030173262,0.00026547295,0.00016744158,0.000012046048,0.00022855776,0.000028958819,0.0029280693,0.0014634498,0.0275992,0.9672579,0.000014754004],"about_ca_topic_score_codex":0.00058713654,"about_ca_topic_score_gemma":0.0014406581,"teacher_disagreement_score":0.06980697,"about_ca_system_score_codex":0.0005342657,"about_ca_system_score_gemma":0.000648951,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206395156","doi":"10.1007/978-3-030-61527-7","title":"Discovery Science","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Statistics Education and Methodologies","field":"Mathematics","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":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.13239265823221572,"score_gpt":0.397327139275625,"score_spread":0.26493448104340933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206395156","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012425478,0.018213276,0.2413283,0.009637963,0.003172989,0.00014317775,0.0025864476,0.004193369,0.7194818],"genre_scores_gemma":[0.028401429,0.01836342,0.09232495,0.0036934495,0.0028233756,0.00034148482,0.0052519687,0.0017151221,0.8470847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877125,0.00021778289,0.0000456766,0.0002767908,0.0006272067,0.00006119302],"domain_scores_gemma":[0.99799746,0.00080912485,0.000057419355,0.00070369244,0.00031797998,0.0001141722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015411649,0.0009191464,0.0011393233,0.0023594575,0.00095096504,0.0046833227,0.0016560418,0.0015873233,0.09043144],"category_scores_gemma":[0.0037803503,0.0007158639,0.000746189,0.0021408,0.0016643617,0.0041943234,0.0023456295,0.002687923,0.06759392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020811382,0.000028423116,0.00016119432,0.00034311498,0.000027557562,0.000051016174,0.000086356595,0.00073353236,0.0008303502,0.46719727,0.29870254,0.23181787],"study_design_scores_gemma":[0.000005885341,0.000010317802,0.00011431473,0.000078945304,0.000008949511,0.000118600256,0.000027874572,0.0016301029,0.00075885275,0.3225418,0.6746964,0.0000080316595],"about_ca_topic_score_codex":0.000805877,"about_ca_topic_score_gemma":0.0012089394,"teacher_disagreement_score":0.09043144,"about_ca_system_score_codex":0.0014595204,"about_ca_system_score_gemma":0.0015638331,"threshold_uncertainty_score":0.30252331},"labels":[],"label_agreement":null},{"id":"W4206506156","doi":"10.1007/10720107_21","title":"Performance of Protocols","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Block cipher; CONTEST; Encryption; NIST; Computer security; Advanced Encryption Standard; Cryptography; Political science; Law","score_opus":0.016436553190073613,"score_gpt":0.2531006181311678,"score_spread":0.23666406494109418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206506156","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.11605482,0.007798158,0.43532634,0.0074367207,0.0020788596,0.00057364017,0.002475323,0.012682649,0.41557354],"genre_scores_gemma":[0.8533796,0.0023926736,0.061524,0.00061166636,0.0007629932,0.000498784,0.002636502,0.0018774214,0.07631642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914767,0.0019786668,0.00033740595,0.0011148485,0.004155772,0.0009365002],"domain_scores_gemma":[0.9841061,0.0062324926,0.00058237603,0.006328536,0.002128175,0.00062233006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004860449,0.0014294153,0.0012184132,0.0019129725,0.0016171887,0.006998876,0.0020356847,0.0019032421,0.03510304],"category_scores_gemma":[0.023035547,0.00084752653,0.0006198133,0.0022402168,0.0019096668,0.008926177,0.0031611505,0.002754523,0.008057565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084002374,0.00033855136,0.0019495342,0.000324107,0.00007925801,0.0001135663,0.00041091995,0.036424153,0.011685687,0.7105674,0.038901523,0.1983652],"study_design_scores_gemma":[0.0001277719,0.00038537142,0.0016072217,0.00012780151,0.00010474197,0.00038842595,0.00034717662,0.29350722,0.038825504,0.5849211,0.07959441,0.00006313771],"about_ca_topic_score_codex":0.0008876671,"about_ca_topic_score_gemma":0.0005382849,"teacher_disagreement_score":0.03510304,"about_ca_system_score_codex":0.002315992,"about_ca_system_score_gemma":0.0025770562,"threshold_uncertainty_score":0.1174314},"labels":[],"label_agreement":null},{"id":"W4206548155","doi":"10.1007/978-3-030-92300-6_25","title":"The Applicability of Greimassian Semiotics to Meaningful Procedural Quest Generation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Semiotics; Narrative; Meaning (existential); Sketch; Computer science; Generative grammar; Context (archaeology); Focus (optics); Artificial intelligence; Epistemology; Linguistics; Philosophy; Algorithm; History","score_opus":0.03074043560171967,"score_gpt":0.28154679991902903,"score_spread":0.25080636431730935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206548155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021056358,0.0014624469,0.6782884,0.0024112363,0.00029259818,0.000083637526,0.000118407654,0.00037395975,0.29591295],"genre_scores_gemma":[0.76764756,0.00090127595,0.19918521,0.0004428004,0.00020724109,0.0002244838,0.00022415265,0.0004364958,0.030730654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985915,0.00077164825,0.000080089674,0.00022140185,0.00023361624,0.0001017547],"domain_scores_gemma":[0.9978537,0.0013712506,0.00007546559,0.0004433841,0.00020052929,0.00005568518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616073,0.00053742825,0.0005469306,0.0010876507,0.0018414292,0.004593953,0.0012482372,0.0017505243,0.008155461],"category_scores_gemma":[0.0067611635,0.00057427416,0.0012257326,0.0007495696,0.012540455,0.007984119,0.002473369,0.0030949442,0.0014756108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038597254,0.0000021060669,0.000014240886,0.000008939077,0.0000010494929,0.000009589827,0.00025091632,0.00034303288,0.00008045698,0.9968616,0.00016405588,0.002260103],"study_design_scores_gemma":[0.0000042875395,0.0000039960564,0.000015127992,0.000009153505,0.0000013876593,0.000021340014,0.00007222126,0.0018956523,0.00014005452,0.99330395,0.0045292727,0.0000035652165],"about_ca_topic_score_codex":0.0016950227,"about_ca_topic_score_gemma":0.001267874,"teacher_disagreement_score":0.008155461,"about_ca_system_score_codex":0.0018065495,"about_ca_system_score_gemma":0.0009951787,"threshold_uncertainty_score":0.027282774},"labels":[],"label_agreement":null},{"id":"W4206651709","doi":"10.1007/978-3-030-94029-4_14","title":"The Analysis and Implication of Data Deduplication in Digital Forensics","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Cyber Forensics","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 Guelph","funders":"","keywords":"Data deduplication; Computer science; Digital forensics; File system; Volume (thermodynamics); Database; Data recovery; File server; Operating system","score_opus":0.01883267994078941,"score_gpt":0.24771258336938853,"score_spread":0.22887990342859912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206651709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16885895,0.035126925,0.66099554,0.020774605,0.0024888972,0.0002981763,0.0014638841,0.0007429691,0.109250054],"genre_scores_gemma":[0.8795999,0.012704132,0.08146961,0.0010154934,0.0017759128,0.00010383371,0.0005436369,0.00018554917,0.0226018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645257,0.0014461543,0.00018489073,0.0005094807,0.0011313903,0.00027555996],"domain_scores_gemma":[0.96073556,0.028918387,0.0021532157,0.0045375586,0.0032976374,0.00035757967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057521444,0.00081119547,0.0010231535,0.0039197803,0.0022224877,0.0061802045,0.0021165675,0.0026992399,0.005480259],"category_scores_gemma":[0.032810077,0.0006681281,0.00089286396,0.005286519,0.0048352736,0.010478515,0.0023044094,0.0026686164,0.00091328914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023430317,0.000098217206,0.0053680553,0.00045402275,0.000048562284,0.0009073833,0.00056506443,0.019197665,0.0029847852,0.8789773,0.007644618,0.08351996],"study_design_scores_gemma":[0.000019685882,0.00011210076,0.0028591214,0.0003689643,0.0001101403,0.0022959711,0.0008859827,0.14604054,0.01191974,0.8133082,0.022005806,0.00007373373],"about_ca_topic_score_codex":0.0008163794,"about_ca_topic_score_gemma":0.00060993334,"teacher_disagreement_score":0.0061802045,"about_ca_system_score_codex":0.0017786692,"about_ca_system_score_gemma":0.0017044483,"threshold_uncertainty_score":0.030420601},"labels":[],"label_agreement":null},{"id":"W4206652101","doi":"10.1007/11817949","title":"CONCUR 2006 – Concurrency Theory","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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":"Universität Duisburg-Essen; Universität des Saarlandes; Università degli Studi di Trento; Rheinische Friedrich-Wilhelms-Universität Bonn; Università di Pisa; Technische Universiteit Eindhoven; Aalborg Universitet; Università degli Studi di Verona; State University of New York; European Research Consortium for Informatics and Mathematics; Imperial College London; York University; Masarykova Univerzita; Deutsche Forschungsgemeinschaft; National ICT Australia; Massachusetts Institute of Technology; Uppsala Universitet; Carl von Ossietzky Universität Oldenburg; Universiteit van Amsterdam; National University of Singapore; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Concurrency; Computer science; Series (stratigraphy); Programming language; Library science","score_opus":0.016647124756150856,"score_gpt":0.27778327976688505,"score_spread":0.26113615501073417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206652101","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023078527,0.025041044,0.6383494,0.0029975309,0.007939727,0.00022457149,0.00069601415,0.006131544,0.31631234],"genre_scores_gemma":[0.05576103,0.019164992,0.32817322,0.001999344,0.0045556813,0.0004983491,0.0032412224,0.0056084595,0.58099765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865746,0.00015625673,0.0000675398,0.00017407908,0.0008766508,0.00006795239],"domain_scores_gemma":[0.99893373,0.00032032764,0.000046238056,0.00029529276,0.00031230802,0.00009211721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244316,0.0012836533,0.0011305376,0.0013708078,0.0010576728,0.0028596746,0.0014792792,0.0008803369,0.026123641],"category_scores_gemma":[0.0027656145,0.0010399652,0.000747397,0.002455532,0.0011659524,0.0037127538,0.0015687033,0.002866717,0.017127201],"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.000059102535,0.000048883656,0.00010289064,0.0004160568,0.000025885543,0.0001200192,0.00018688272,0.003888572,0.0038591903,0.3116993,0.3087312,0.37086198],"study_design_scores_gemma":[0.000019199791,0.000034886525,0.00019683978,0.00014286801,0.000016318616,0.000421527,0.000034352473,0.0077397483,0.002916276,0.17889349,0.80955505,0.000029470166],"about_ca_topic_score_codex":0.0014817365,"about_ca_topic_score_gemma":0.0026461505,"teacher_disagreement_score":0.026123641,"about_ca_system_score_codex":0.001239375,"about_ca_system_score_gemma":0.0017093958,"threshold_uncertainty_score":0.08739227},"labels":[],"label_agreement":null},{"id":"W4206667539","doi":"10.1007/978-3-030-92270-2_13","title":"An Implicit Learning Approach for Solving the Nurse Scheduling Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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 Calgary; University of Regina","funders":"","keywords":"Computer science; Nurse scheduling problem; Scheduling (production processes); Job shop scheduling; Artificial intelligence; Operations research; Mathematical optimization; Flow shop scheduling; Schedule; Mathematics; Operating system","score_opus":0.06718189093934655,"score_gpt":0.3475020556820189,"score_spread":0.28032016474267235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206667539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067584235,0.00018279851,0.98943734,0.00017401767,0.00003903465,0.000019974668,0.000022016773,0.00009883837,0.0032675772],"genre_scores_gemma":[0.36031473,0.0006333992,0.6198045,0.00022303862,0.00021952452,0.00027637763,0.00019440216,0.00011236433,0.018221682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955314,0.00016888921,0.000020460331,0.00006711398,0.00013337334,0.00005700432],"domain_scores_gemma":[0.9987602,0.000899994,0.00006985894,0.000068525376,0.00016076253,0.000040674087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009812724,0.00057446986,0.0007716641,0.00032516292,0.00038341768,0.0007210431,0.00228299,0.0010350144,0.004573712],"category_scores_gemma":[0.0040788837,0.00044517152,0.00047175435,0.00073564437,0.0007181505,0.0015227782,0.0014631755,0.002202388,0.0005010568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011780213,0.00014194196,0.00029911558,0.00013138744,0.000029621653,0.000038776026,0.00008830935,0.77880144,0.0010573813,0.06869801,0.0023377603,0.14825845],"study_design_scores_gemma":[0.0000089147225,0.000013686832,0.00003074657,0.000004982645,0.0000037922382,0.0000042297443,0.0000042670554,0.984447,0.00013545867,0.014860622,0.00048389973,0.0000024223314],"about_ca_topic_score_codex":0.0058913007,"about_ca_topic_score_gemma":0.007288339,"teacher_disagreement_score":0.0058913007,"about_ca_system_score_codex":0.00077076274,"about_ca_system_score_gemma":0.0015053435,"threshold_uncertainty_score":0.015300572},"labels":[],"label_agreement":null},{"id":"W4206681002","doi":"10.1007/978-3-540-77120-3_3","title":"Integer Representation and Counting in the Bit Probe Model","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Logarithm; Bit (key); Bitwise operation; Mathematics; Discrete mathematics; Representation (politics); Subtraction; Measure (data warehouse); Arithmetic; Computation; Constant (computer programming); Omega; Algorithm; Combinatorics; Computer science","score_opus":0.05007665314434419,"score_gpt":0.29048685802540014,"score_spread":0.24041020488105597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206681002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081645295,0.0022682953,0.7680932,0.0061044195,0.0006826172,0.00010318547,0.0007016344,0.0011235141,0.13927783],"genre_scores_gemma":[0.731111,0.0026315537,0.19816868,0.0017172556,0.0011921166,0.00048719693,0.0010593649,0.0008542039,0.062778704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820113,0.00058121386,0.00008085867,0.00026809098,0.0005679997,0.00030069958],"domain_scores_gemma":[0.99624395,0.0021321054,0.0002957693,0.0009161121,0.0002552435,0.00015688846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014972314,0.0010684222,0.0015402965,0.0018583199,0.0014896819,0.005648817,0.0027694888,0.0027538368,0.0116667375],"category_scores_gemma":[0.009360748,0.0006635196,0.0010026242,0.003998071,0.0031002953,0.013203468,0.0023994835,0.0041968934,0.0021671175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027209342,0.000013861142,0.000034447105,0.000019618048,0.0000019859895,0.000017433751,0.000031784406,0.0030590403,0.00024398472,0.98890907,0.0018706183,0.005770942],"study_design_scores_gemma":[0.0000058166447,0.000004100651,0.00001455766,0.0000069525227,0.0000027514222,0.000028142736,0.000010792911,0.01834106,0.0002281997,0.97983354,0.0015180277,0.000006091561],"about_ca_topic_score_codex":0.00085396395,"about_ca_topic_score_gemma":0.0006592155,"teacher_disagreement_score":0.0116667375,"about_ca_system_score_codex":0.0017960928,"about_ca_system_score_gemma":0.0010128741,"threshold_uncertainty_score":0.03902912},"labels":[],"label_agreement":null},{"id":"W4206728070","doi":"10.1007/978-3-030-92300-6_23","title":"Blabbeur - An Accessible Text Generation Authoring System for Unity","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Computer science; Scripting language; Generative grammar; Syntax; Programming language; Context (archaeology); Simple (philosophy); Rule-based machine translation; Grammar; Text generation; Natural language processing; Artificial intelligence; Linguistics","score_opus":0.055180783372976376,"score_gpt":0.3078544213443861,"score_spread":0.25267363797140974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206728070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007661536,0.00033589016,0.54363286,0.00009568178,0.00018795895,0.0001946794,0.0026144178,0.41315088,0.03212608],"genre_scores_gemma":[0.15165296,0.0008069108,0.5439156,0.00034604827,0.00018207016,0.0005929036,0.018902818,0.11160461,0.17199616],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953556,0.000057898895,0.00004104237,0.00012229325,0.0002028853,0.000040316303],"domain_scores_gemma":[0.999315,0.00026590007,0.000029597779,0.00017118393,0.0001260874,0.00009230453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057618023,0.0012940431,0.0009287901,0.0014184308,0.00065606076,0.0019545848,0.0020292741,0.0011102511,0.0937789],"category_scores_gemma":[0.002235547,0.00077371404,0.0008318464,0.00095982413,0.00049518864,0.0023085491,0.0030347088,0.0012479698,0.034782346],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014499079,0.00019704607,0.0007135299,0.00082680606,0.00008125757,0.00061580166,0.0012463082,0.0051260726,0.10098024,0.022487624,0.14092334,0.72535205],"study_design_scores_gemma":[0.0008358499,0.00034203316,0.001965731,0.0002454244,0.00016039213,0.0018358971,0.00030308703,0.13913,0.1592396,0.029067082,0.6666072,0.00026776327],"about_ca_topic_score_codex":0.0016629733,"about_ca_topic_score_gemma":0.0020803825,"teacher_disagreement_score":0.0937789,"about_ca_system_score_codex":0.00044558354,"about_ca_system_score_gemma":0.00067171274,"threshold_uncertainty_score":0.31372172},"labels":[],"label_agreement":null},{"id":"W4206777409","doi":"10.1007/b100437","title":"Image Analysis and Recognition","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","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":"Computer science; Artificial intelligence; Computer vision; Pattern recognition (psychology); Computer graphics (images)","score_opus":0.013096029702195505,"score_gpt":0.22491161204326518,"score_spread":0.21181558234106967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206777409","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020422123,0.010756675,0.83520526,0.00055176555,0.0016129304,0.0002321249,0.0014351687,0.0140156215,0.13414828],"genre_scores_gemma":[0.0187263,0.011477055,0.3254325,0.0006878665,0.0006378915,0.0002766875,0.004785384,0.0018658284,0.6361104],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996132,0.000018093257,0.000018432635,0.00010038058,0.0002235079,0.000026316524],"domain_scores_gemma":[0.99963355,0.000046552217,0.0000130018725,0.00013522922,0.00015197461,0.000019712988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003293847,0.0013510925,0.0011306669,0.0018293164,0.00045520675,0.0017074512,0.0015205635,0.0009589704,0.08558909],"category_scores_gemma":[0.00060700095,0.0005904036,0.0007047692,0.0016937854,0.00055009965,0.0012892663,0.0011012265,0.0008771933,0.10987091],"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.000041300984,0.00003226853,0.00007891656,0.0002639239,0.000025874522,0.000060235387,0.000029339393,0.0009375342,0.032532718,0.008539639,0.11286992,0.8445884],"study_design_scores_gemma":[0.000013353146,0.00008579629,0.001041702,0.00009769077,0.000051538365,0.0009143308,0.000041670937,0.012456459,0.06649826,0.012892662,0.9058647,0.00004180245],"about_ca_topic_score_codex":0.00094987254,"about_ca_topic_score_gemma":0.0014856828,"teacher_disagreement_score":0.08558909,"about_ca_system_score_codex":0.0003233409,"about_ca_system_score_gemma":0.00049936934,"threshold_uncertainty_score":0.28632402},"labels":[],"label_agreement":null},{"id":"W4206796990","doi":"10.1007/978-3-030-92300-6_39","title":"Contextualization of Design Qualities in Interactive Story-Based Visualization Applied to Engineering","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; Novelty; Contextualization; Information visualization; Engineering design process; Human–computer interaction; Context (archaeology); Terminology; Data science; Field (mathematics); Usability; Artificial intelligence; Interpretation (philosophy); Engineering","score_opus":0.028742911557229398,"score_gpt":0.289626012274527,"score_spread":0.2608831007172976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206796990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3468383,0.002298554,0.4693368,0.0028022104,0.00021711671,0.00034965185,0.00066569244,0.0015386736,0.17595306],"genre_scores_gemma":[0.91413873,0.0006041094,0.07451009,0.0001280638,0.000042818425,0.00014181536,0.00028411762,0.00035220938,0.0097981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99943227,0.0003347878,0.000017811699,0.000061516286,0.00010132808,0.00005222946],"domain_scores_gemma":[0.99795735,0.0013692296,0.00013757657,0.00018545837,0.0002227303,0.00012775659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075160677,0.000481095,0.00018855117,0.0009671785,0.00096859585,0.0038938702,0.0005789572,0.00066386594,0.013251168],"category_scores_gemma":[0.005449293,0.0003151814,0.00029442387,0.0009791981,0.001727471,0.0030427433,0.0017445734,0.00080477615,0.0005791186],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007490572,0.00019183593,0.011335085,0.0021991236,0.000074141746,0.0019724304,0.26976022,0.009641164,0.059974916,0.3848119,0.018210394,0.24107976],"study_design_scores_gemma":[0.00012827835,0.00062468345,0.053326722,0.002256046,0.00029466016,0.004015188,0.18173108,0.07620728,0.029520726,0.25171643,0.39998093,0.00019801452],"about_ca_topic_score_codex":0.0012087269,"about_ca_topic_score_gemma":0.0022386643,"teacher_disagreement_score":0.013251168,"about_ca_system_score_codex":0.00063802896,"about_ca_system_score_gemma":0.0003739275,"threshold_uncertainty_score":0.044329524},"labels":[],"label_agreement":null},{"id":"W4206978675","doi":"10.1007/978-3-030-95018-7_24","title":"Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Time complexity; Butterfly graph; Vertex (graph theory); Algorithm; Discrete mathematics; Graph; Theoretical computer science; Combinatorics; Line graph; Voltage graph; Mathematics","score_opus":0.010894208617090121,"score_gpt":0.20614941249938376,"score_spread":0.19525520388229364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206978675","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.092893586,0.0057357713,0.85235053,0.00536837,0.0007081435,0.0002849357,0.0018612437,0.0044151684,0.036382247],"genre_scores_gemma":[0.47355786,0.0037110632,0.49137312,0.001044565,0.0009980707,0.0004710366,0.0037444127,0.0017566773,0.023343157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970469,0.0007204496,0.00013512341,0.0008667306,0.00056192215,0.0006688396],"domain_scores_gemma":[0.98277515,0.012063636,0.0007373699,0.0030883846,0.0007246024,0.00061082735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031203702,0.0024735653,0.00274986,0.0019846465,0.0023316203,0.0055654077,0.0070763817,0.0036781018,0.009777632],"category_scores_gemma":[0.017777625,0.0016151182,0.0025518504,0.0058728363,0.0020496722,0.010678312,0.0029695483,0.0058200923,0.0026507806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027325586,0.00086930016,0.0023369603,0.001163124,0.00033376715,0.00020537848,0.00085002696,0.48310676,0.0041190847,0.18713771,0.053757094,0.2633882],"study_design_scores_gemma":[0.00027364888,0.000112448026,0.00046061323,0.000096512114,0.00014971574,0.00017971541,0.00020515769,0.7204393,0.0025846316,0.27047896,0.004987515,0.000031747986],"about_ca_topic_score_codex":0.0072430386,"about_ca_topic_score_gemma":0.01080653,"teacher_disagreement_score":0.009777632,"about_ca_system_score_codex":0.0064171236,"about_ca_system_score_gemma":0.0048423526,"threshold_uncertainty_score":0.04655975},"labels":[],"label_agreement":null},{"id":"W4207062810","doi":"10.1007/978-3-030-95018-7_17","title":"Approximation and Parameterized Algorithms for Balanced Connected Partition Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Parameterized complexity; Partition (number theory); Disjoint sets; Mathematics; Graph partition; Vertex (graph theory); Approximation algorithm; Discrete mathematics; Graph","score_opus":0.034742319451082984,"score_gpt":0.2855835556091444,"score_spread":0.2508412361580614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207062810","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048883963,0.0028617133,0.91051775,0.00219017,0.00031392116,0.00033723726,0.0011743053,0.0022396112,0.03148126],"genre_scores_gemma":[0.28506,0.0026198162,0.68013424,0.0007391927,0.00060146913,0.0010866505,0.0054637706,0.0015250432,0.022769727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744797,0.0007663391,0.00012570764,0.00057026336,0.00067058945,0.00041914536],"domain_scores_gemma":[0.9930427,0.0043372884,0.0003961426,0.001442851,0.00041980852,0.00036131853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232898,0.0028188883,0.002563375,0.0020159504,0.0018570325,0.005384348,0.0065844893,0.0031180335,0.018500756],"category_scores_gemma":[0.014470697,0.0016609179,0.002147366,0.007175411,0.0019594075,0.013000089,0.004722713,0.0065643834,0.0033831692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014606104,0.0010325359,0.0015304562,0.0009594537,0.00018041377,0.00013420274,0.0005911237,0.24708459,0.0047148517,0.31596926,0.050183907,0.37615865],"study_design_scores_gemma":[0.00026560028,0.00008250173,0.00036455697,0.000081324804,0.00007501315,0.00013392272,0.00017566311,0.515646,0.0014389661,0.47372603,0.007983567,0.000026779535],"about_ca_topic_score_codex":0.003834124,"about_ca_topic_score_gemma":0.005914026,"teacher_disagreement_score":0.018500756,"about_ca_system_score_codex":0.00433663,"about_ca_system_score_gemma":0.0027675182,"threshold_uncertainty_score":0.06189114},"labels":[],"label_agreement":null},{"id":"W4208076","doi":"10.1007/978-3-319-07725-3_42","title":"The Semantics of Refinement Chart","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Notation; Computer science; Chart; Programming language; Semantics (computer science); Representation (politics); Refinement calculus; Theoretical computer science; Mathematics","score_opus":0.02357222707120969,"score_gpt":0.27201239991722026,"score_spread":0.24844017284601058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4208076","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.01133931,0.002277256,0.79611886,0.0014469537,0.00040970303,0.0001076597,0.0003468431,0.0012603175,0.18669306],"genre_scores_gemma":[0.6438779,0.004256956,0.273023,0.00060523045,0.0005508752,0.0004077451,0.00093885313,0.00093583565,0.075403616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868613,0.00041892153,0.00009678857,0.00026493668,0.0003805306,0.00015277248],"domain_scores_gemma":[0.99904484,0.0003694147,0.000051664232,0.0002843444,0.00020503307,0.000044630982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984586,0.0006837265,0.0005406049,0.0014203854,0.0012608357,0.003283543,0.0012081014,0.001105039,0.008518191],"category_scores_gemma":[0.002951225,0.00070771354,0.0010546991,0.0018149656,0.005340755,0.007153168,0.0017596822,0.0026020082,0.0018406871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006786721,0.0000021273243,0.000015149612,0.000015768137,0.000001786475,0.000012513274,0.00010761496,0.00046067097,0.0002208585,0.99269366,0.00070869067,0.005754344],"study_design_scores_gemma":[0.000009392424,0.000008004697,0.000044474084,0.000023064973,0.0000071905165,0.000029980294,0.00005019821,0.002563897,0.000752212,0.9709811,0.025522457,0.0000080239115],"about_ca_topic_score_codex":0.0029644705,"about_ca_topic_score_gemma":0.0016135398,"teacher_disagreement_score":0.008518191,"about_ca_system_score_codex":0.0017847344,"about_ca_system_score_gemma":0.0011875508,"threshold_uncertainty_score":0.028496206},"labels":[],"label_agreement":null},{"id":"W4210451664","doi":"10.1007/978-3-030-70881-8","title":"Foundations and Practice of Security","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Computer security; Computer science","score_opus":0.021076055723640713,"score_gpt":0.32203704270170114,"score_spread":0.3009609869780604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210451664","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056962674,0.027186364,0.131002,0.05422605,0.0017614806,0.00010367388,0.00018319338,0.00017078676,0.7796702],"genre_scores_gemma":[0.78408355,0.01949826,0.07492292,0.0052646897,0.0024442265,0.0006962336,0.00021975236,0.00021954141,0.112650804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537414,0.0026141498,0.00019404595,0.0005717195,0.00090240216,0.00034363972],"domain_scores_gemma":[0.99459875,0.0031485753,0.00028982185,0.0011403232,0.0005421276,0.00028045528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005278131,0.00079086464,0.0007469769,0.0017439763,0.0031960465,0.008951341,0.0018279394,0.0041788295,0.016772926],"category_scores_gemma":[0.008393877,0.00059518544,0.0005751399,0.0020901053,0.03233062,0.009482308,0.0035085848,0.005049135,0.0029181144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011548076,0.000003567916,0.000024587533,0.000012128515,9.636916e-7,0.000004247678,0.00027484665,0.000096634496,0.000009839981,0.9955419,0.0019371122,0.002093042],"study_design_scores_gemma":[0.0000029818402,0.0000029398304,0.00004029725,0.000048423062,0.0000013208764,0.000016251126,0.00026890275,0.00024973275,0.00002172572,0.95371467,0.045630664,0.0000020872897],"about_ca_topic_score_codex":0.0038666644,"about_ca_topic_score_gemma":0.0026982748,"teacher_disagreement_score":0.016772926,"about_ca_system_score_codex":0.0046681287,"about_ca_system_score_gemma":0.0055047274,"threshold_uncertainty_score":0.056111038},"labels":[],"label_agreement":null},{"id":"W4210521435","doi":"10.1007/978-3-030-95408-6_14","title":"Sparse Generalized Dirichlet Prior Based Bayesian Multinomial Estimation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dirichlet distribution; Multinomial distribution; Multinomial probit; Computer science; Bayesian probability; Context (archaeology); Probabilistic logic; Categorical distribution; Prior probability; Artificial intelligence; Property (philosophy); Machine learning; Econometrics; Mathematics; Bayesian hierarchical modeling; Bayesian inference; Multinomial logistic regression; Geography","score_opus":0.02178237617829529,"score_gpt":0.2685821701325137,"score_spread":0.2467997939542184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210521435","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.0012576258,0.00036181608,0.9966736,0.00011624522,0.00004738943,0.000013761971,0.000092666305,0.00021677282,0.0012200718],"genre_scores_gemma":[0.110670045,0.001775502,0.86651057,0.00041026683,0.00037163997,0.00031953395,0.0018392268,0.00071809866,0.017385224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980714,0.0010000983,0.00007431656,0.00028537205,0.00045614893,0.00011265578],"domain_scores_gemma":[0.99444276,0.0043644076,0.00015644821,0.00048504357,0.00046929656,0.000082026534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026681607,0.0009885097,0.002537658,0.0013438687,0.0006877948,0.0021956519,0.0032168175,0.0021851738,0.008329565],"category_scores_gemma":[0.013488318,0.0016804241,0.0017166865,0.002882824,0.0011474388,0.00329162,0.0024886841,0.0030600633,0.0035474168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002404631,0.000093299444,0.0007389598,0.00030797493,0.00017651443,0.00014087446,0.00024769598,0.51546186,0.0024600865,0.20933606,0.014124841,0.25667146],"study_design_scores_gemma":[0.000009675145,0.000007268178,0.00010700584,0.00001853541,0.00001658198,0.000057422945,0.000011298959,0.9277558,0.00038809315,0.06916572,0.0024446566,0.000018040917],"about_ca_topic_score_codex":0.0050937035,"about_ca_topic_score_gemma":0.008171009,"teacher_disagreement_score":0.008329565,"about_ca_system_score_codex":0.0011272223,"about_ca_system_score_gemma":0.0012553069,"threshold_uncertainty_score":0.027865171},"labels":[],"label_agreement":null},{"id":"W4210540074","doi":"10.1007/978-3-030-95470-3_30","title":"Active Learning for Capturing Human Decision Policies in a Data Frugal Context","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Université Laval; Thales (Canada)","funders":"","keywords":"Computer science; Machine learning; Oracle; Artificial intelligence; Domain (mathematical analysis); Context (archaeology); Software engineering","score_opus":0.034503564701649135,"score_gpt":0.307258719742429,"score_spread":0.2727551550407799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210540074","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.026613401,0.0005747083,0.9708865,0.00020152621,0.00004442219,0.00002737273,0.00012945835,0.00033128826,0.0011911873],"genre_scores_gemma":[0.75762606,0.00066033367,0.23640227,0.00010486464,0.00012738684,0.00012387657,0.0003300318,0.00012997106,0.004495252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995161,0.00020307957,0.000020803696,0.00013270359,0.000078665675,0.000048615708],"domain_scores_gemma":[0.99737096,0.0020900415,0.0001415283,0.0001880043,0.00012998866,0.00007950012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011058447,0.0005771905,0.0005471037,0.0005997344,0.00039648352,0.00136537,0.0011312265,0.0009379788,0.0015983293],"category_scores_gemma":[0.0057429965,0.000431455,0.00045167303,0.000738233,0.00093640236,0.0025884372,0.0010924902,0.002016933,0.0003480316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004881131,0.00024788702,0.0034225457,0.00021504267,0.000096037205,0.00021469717,0.0006989132,0.5226146,0.0109436205,0.14358583,0.0035471148,0.31392562],"study_design_scores_gemma":[0.0000039872766,0.000023209885,0.00031192115,0.00000875165,0.0000068842273,0.000016872753,0.000023455588,0.95262694,0.0011499566,0.044937592,0.00088276196,0.0000075496046],"about_ca_topic_score_codex":0.003825972,"about_ca_topic_score_gemma":0.005428048,"teacher_disagreement_score":0.003825972,"about_ca_system_score_codex":0.00081846566,"about_ca_system_score_gemma":0.0005885075,"threshold_uncertainty_score":0.0076074004},"labels":[],"label_agreement":null},{"id":"W4210567757","doi":"10.1007/978-3-030-95470-3_6","title":"Online Semi-supervised Learning from Evolving Data Streams with Meta-features and Deep Reinforcement Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Reinforcement learning; Benchmark (surveying); Artificial intelligence; Machine learning; Cluster analysis; Meta learning (computer science); Data stream mining; Domain (mathematical analysis); Online learning; Data mining; World Wide Web","score_opus":0.03733525315068209,"score_gpt":0.2616556173531308,"score_spread":0.22432036420244872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210567757","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.015786756,0.0003207069,0.9824181,0.00016170078,0.000045729044,0.000030413403,0.00005572822,0.0005687082,0.00061207055],"genre_scores_gemma":[0.7324227,0.00036116896,0.2610835,0.00021247221,0.00013768185,0.00024341316,0.00040518734,0.00021139694,0.0049224207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993724,0.00019664576,0.000050072966,0.0001946768,0.0001245391,0.00006172622],"domain_scores_gemma":[0.99490005,0.0037450786,0.00034553534,0.00038012172,0.0004962906,0.00013293083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002163671,0.0008577495,0.0016267232,0.0005067864,0.00030061408,0.0011049164,0.002020147,0.001400863,0.0016058725],"category_scores_gemma":[0.0070766234,0.00084463554,0.00080620544,0.00076525327,0.00089589047,0.0020876753,0.0017976459,0.0023443298,0.0005362595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018883169,0.00017028948,0.00128276,0.00012513968,0.00010882303,0.000092493,0.000088417335,0.78985614,0.0023232114,0.009637574,0.0024575694,0.19366866],"study_design_scores_gemma":[0.0000027743754,0.000010733729,0.000037589838,0.0000025610373,0.0000023604184,0.0000058429277,0.0000011991361,0.99758744,0.00019414071,0.002099617,0.000053988566,0.0000017199437],"about_ca_topic_score_codex":0.0025738948,"about_ca_topic_score_gemma":0.0032460869,"teacher_disagreement_score":0.0025738948,"about_ca_system_score_codex":0.0007995538,"about_ca_system_score_gemma":0.00094276154,"threshold_uncertainty_score":0.011442661},"labels":[],"label_agreement":null},{"id":"W4210804557","doi":"10.1007/978-3-642-18098-9","title":"Implementation and Application of Automata","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Queen's University; University of Manitoba","funders":"","keywords":"Computer science; Automaton; Programming language; Theoretical computer science","score_opus":0.012093401686933623,"score_gpt":0.2586349253584856,"score_spread":0.24654152367155197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210804557","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.009380919,0.00020476311,0.9601267,0.00021850367,0.00024641553,0.00009152683,0.0001251484,0.00679686,0.022809165],"genre_scores_gemma":[0.32401046,0.00039820228,0.65577567,0.00016318976,0.00006343036,0.0003449779,0.00044688268,0.0010237199,0.01777354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876356,0.00035701215,0.00012993028,0.00025190096,0.0003702014,0.00012745695],"domain_scores_gemma":[0.99796486,0.0006782135,0.00004946176,0.0008257649,0.00040578353,0.0000759428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010008796,0.0006006815,0.0006652555,0.000744524,0.0010125885,0.0032019352,0.002157578,0.001106634,0.015741128],"category_scores_gemma":[0.0053847795,0.00071098364,0.0012352603,0.0006404784,0.0014153954,0.0023593856,0.0023942613,0.0014862417,0.004671674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020551294,0.00016981884,0.0010906154,0.00036055283,0.000080431615,0.0003474114,0.00083747547,0.047915876,0.019539135,0.67396075,0.008584159,0.24690826],"study_design_scores_gemma":[0.000099878336,0.00012165751,0.0003233905,0.00014616245,0.00011726912,0.00041331397,0.00017303407,0.49064824,0.042653985,0.37084845,0.09438655,0.00006817089],"about_ca_topic_score_codex":0.002317782,"about_ca_topic_score_gemma":0.002026817,"teacher_disagreement_score":0.015741128,"about_ca_system_score_codex":0.0008861013,"about_ca_system_score_gemma":0.0012608243,"threshold_uncertainty_score":0.052659333},"labels":[],"label_agreement":null},{"id":"W4210854536","doi":"10.1007/978-3-030-96527-3_5","title":"Alternative Difficulty Adjustment Algorithms for Preventing Selfish Mining Attack","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Zeno's paradoxes; Computer science; Scalability; Algorithm; Parametric statistics; Quantum Zeno effect; Mathematics; Philosophy; Physics; Epistemology; Statistics","score_opus":0.02731922539896306,"score_gpt":0.2780569423378291,"score_spread":0.25073771693886604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210854536","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.038473915,0.00039643515,0.9529637,0.00052205345,0.00020958092,0.00019944336,0.000119192264,0.0019236472,0.0051919958],"genre_scores_gemma":[0.51469725,0.00023591681,0.47205064,0.0003891934,0.00027973234,0.0003043949,0.0006328182,0.00040308703,0.011007048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763656,0.0005827406,0.00017576385,0.0005425255,0.00075469504,0.00030768363],"domain_scores_gemma":[0.9914954,0.003629633,0.00070933474,0.0023138756,0.0014903273,0.000361475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021858946,0.001167346,0.0015795459,0.001690652,0.0010497306,0.0018014685,0.003686567,0.0021634991,0.005528992],"category_scores_gemma":[0.015650317,0.00051142485,0.0010484367,0.0014267518,0.0011973133,0.004804563,0.0032451442,0.0029787829,0.0017112318],"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.0015037995,0.0007169194,0.0030117664,0.00024107828,0.00016669488,0.00017722,0.00036382995,0.14624956,0.0116098225,0.08658335,0.021713825,0.7276621],"study_design_scores_gemma":[0.00009607585,0.00012801727,0.00048774332,0.000014516908,0.000032006457,0.00011645652,0.00004308751,0.95184577,0.0028116184,0.041600283,0.002798832,0.000025596988],"about_ca_topic_score_codex":0.0012006979,"about_ca_topic_score_gemma":0.0013658538,"teacher_disagreement_score":0.005528992,"about_ca_system_score_codex":0.000989322,"about_ca_system_score_gemma":0.0012204534,"threshold_uncertainty_score":0.018496275},"labels":[],"label_agreement":null},{"id":"W4210914383","doi":"10.1007/978-3-319-06251-8","title":"Relational and Algebraic Methods in Computer Science","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Science and Mapping","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":"McMaster University","funders":"","keywords":"Algebraic number; Computer science; Algebra over a field; Mathematics education; Mathematics; Pure mathematics","score_opus":0.030620500106092557,"score_gpt":0.3085595284980688,"score_spread":0.2779390283919762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210914383","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033795428,0.14954446,0.27971584,0.006605544,0.005457357,0.000076488606,0.00045115393,0.000775341,0.5539943],"genre_scores_gemma":[0.0973367,0.13431042,0.18451858,0.0017975171,0.010037081,0.0002930096,0.0010262284,0.0010572304,0.56962323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992453,0.00014853974,0.0000517315,0.000098750934,0.00042422643,0.00003154235],"domain_scores_gemma":[0.99923146,0.00046130305,0.000030370787,0.00011064174,0.0001321579,0.00003418182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549291,0.0009471001,0.00091570575,0.002322212,0.0008872476,0.003551674,0.00093164935,0.0006810815,0.02492612],"category_scores_gemma":[0.0018780124,0.00050662097,0.0006215104,0.0046741692,0.0025139053,0.0069345394,0.0012925995,0.0024480377,0.0080884],"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.000005502576,0.000012673167,0.000040625437,0.0002905157,0.000010146754,0.00001829191,0.000187162,0.0005642101,0.00030412583,0.86517066,0.046666086,0.08673],"study_design_scores_gemma":[0.0000057171715,0.00000835885,0.00012332574,0.00012691971,0.000009412315,0.00012574169,0.00006388915,0.0014586978,0.0002031528,0.6450371,0.35282812,0.000009561622],"about_ca_topic_score_codex":0.0010156846,"about_ca_topic_score_gemma":0.0014681708,"teacher_disagreement_score":0.02492612,"about_ca_system_score_codex":0.0015806232,"about_ca_system_score_gemma":0.0010598631,"threshold_uncertainty_score":0.08338618},"labels":[],"label_agreement":null},{"id":"W4211013020","doi":"10.1007/978-3-319-14122-0_17","title":"Parallel OWL Reasoning: Merge Classification","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Computer science; Ontology language; Merge (version control); Web Ontology Language; Speedup; Description logic; Ontology; Benchmark (surveying); Semantic Web; Artificial intelligence; Theoretical computer science; Programming language; Information retrieval; Parallel computing","score_opus":0.029379036458399694,"score_gpt":0.25996907751577714,"score_spread":0.23059004105737743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211013020","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.00707229,0.00048169968,0.9614271,0.00055903883,0.00025509592,0.00023431299,0.00096339424,0.010750075,0.018257005],"genre_scores_gemma":[0.067850836,0.0004308473,0.91178954,0.0004610923,0.00011199777,0.00016613494,0.004900316,0.0017381371,0.012551018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996772,0.0005519513,0.0002847522,0.0007544157,0.0013706017,0.00026626044],"domain_scores_gemma":[0.99687505,0.0009583931,0.00010374888,0.0013816715,0.000578101,0.000102954844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382539,0.00142722,0.0013017954,0.0026182625,0.0015740463,0.005106905,0.005225085,0.0016750857,0.023489779],"category_scores_gemma":[0.0074828365,0.0015162202,0.0030713156,0.003354056,0.001416359,0.011783105,0.0061676963,0.0031092982,0.007906413],"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.00048050267,0.00053363125,0.0012302574,0.0004396022,0.00021003955,0.00029941564,0.00045497224,0.013818616,0.006498939,0.100642465,0.05364019,0.82175136],"study_design_scores_gemma":[0.00017197608,0.00005625013,0.0006861615,0.00016158276,0.0002803978,0.00042723748,0.00037097483,0.30660605,0.029559124,0.5674151,0.094191074,0.00007408932],"about_ca_topic_score_codex":0.008194697,"about_ca_topic_score_gemma":0.012316078,"teacher_disagreement_score":0.023489779,"about_ca_system_score_codex":0.0017986044,"about_ca_system_score_gemma":0.0027753145,"threshold_uncertainty_score":0.078581095},"labels":[],"label_agreement":null},{"id":"W42110184","doi":"10.1007/978-3-642-24434-6_1","title":"Finding Homoglyphs - A Step towards Detecting Unicode-Based Visual Spoofing Attacks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Media Forensic Detection","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Unicode; Computer science; Spoofing attack; Artificial intelligence; Programming language; Computer security","score_opus":0.026597054720817758,"score_gpt":0.2590963164364769,"score_spread":0.23249926171565916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42110184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38014108,0.0029577455,0.5921218,0.00050307304,0.00030184138,0.00026655197,0.0006178761,0.0031582275,0.019931892],"genre_scores_gemma":[0.5775619,0.0017734688,0.4087715,0.00020783937,0.00011905286,0.00006825828,0.0008338683,0.00035052252,0.010313655],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996088,0.000037894508,0.000017618382,0.00009434905,0.00017690535,0.00006442606],"domain_scores_gemma":[0.9992347,0.0002429774,0.00010514166,0.00020613695,0.00014546154,0.00006562358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026010038,0.0008657257,0.00082525756,0.0018907514,0.00057092163,0.0013454522,0.0006633286,0.00123049,0.0037678867],"category_scores_gemma":[0.0016997805,0.00041735836,0.00039429156,0.0009855514,0.0006368758,0.0022105817,0.001376149,0.00109716,0.0024017629],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005994673,0.00015749795,0.006707293,0.0003648362,0.00007406835,0.0010359308,0.00056535634,0.004088386,0.315713,0.011423754,0.0035839926,0.65568644],"study_design_scores_gemma":[0.00007688077,0.0011218847,0.01624859,0.00027540114,0.00025363048,0.010462233,0.001579454,0.2698142,0.61688554,0.04291631,0.040216796,0.00014909441],"about_ca_topic_score_codex":0.00045751888,"about_ca_topic_score_gemma":0.0007341526,"teacher_disagreement_score":0.0037678867,"about_ca_system_score_codex":0.0002134992,"about_ca_system_score_gemma":0.00034752119,"threshold_uncertainty_score":0.012604833},"labels":[],"label_agreement":null},{"id":"W4211029969","doi":"10.1007/978-3-030-11072-7_18","title":"Dangerous Graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Process (computing); Computer security; Node (physics); Computer network","score_opus":0.0199495572327793,"score_gpt":0.24972878476151233,"score_spread":0.22977922752873303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211029969","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021773709,0.0014170737,0.09372518,0.003168953,0.0013381131,0.00007650154,0.00093238853,0.0008337827,0.8767343],"genre_scores_gemma":[0.36553133,0.0034275649,0.04108549,0.0023805632,0.0009603817,0.00020180488,0.0029958112,0.0014829563,0.58193415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967694,0.00006483387,0.000009370111,0.00007748831,0.00012469449,0.000046702004],"domain_scores_gemma":[0.99937445,0.00018432178,0.000047981557,0.00014976197,0.00012994221,0.00011353721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022695962,0.00067451986,0.0004337092,0.0016006121,0.0017608075,0.0019752316,0.00076673686,0.00097505876,0.041959736],"category_scores_gemma":[0.001478378,0.0003579833,0.00049002573,0.0009673633,0.001412573,0.0028886222,0.0017049253,0.002446974,0.008518811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000859515,0.0000053164545,0.000043584383,0.000027027854,0.000002713611,0.00004076747,0.00006937559,0.000336455,0.00027437584,0.9734935,0.017368583,0.00832974],"study_design_scores_gemma":[0.0000027643036,0.0000038694984,0.000047469282,0.000015005147,0.0000041942403,0.00011969316,0.000052483912,0.00095266395,0.00026920048,0.93881977,0.059708904,0.000004002943],"about_ca_topic_score_codex":0.0008807334,"about_ca_topic_score_gemma":0.0011829783,"teacher_disagreement_score":0.041959736,"about_ca_system_score_codex":0.00075712305,"about_ca_system_score_gemma":0.0004964936,"threshold_uncertainty_score":0.1403693},"labels":[],"label_agreement":null},{"id":"W4211214109","doi":"10.1007/11864219_55","title":"DISC at Its 20th Anniversary: Past, Present and Future","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Computational Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"History","score_opus":0.012141287823250848,"score_gpt":0.2534960214945032,"score_spread":0.24135473367125232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211214109","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022532372,0.101636045,0.0026955237,0.037673134,0.21456844,0.00011718991,0.004652499,0.0026645937,0.6337394],"genre_scores_gemma":[0.009578044,0.02224917,0.0012104145,0.0044344272,0.020080423,0.000094106246,0.0024759586,0.00065808743,0.9392193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992594,0.000058796886,0.000037939397,0.00009432166,0.00041260585,0.00013689473],"domain_scores_gemma":[0.9970343,0.00025166658,0.00010557386,0.00025291796,0.0014862333,0.00086923025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012964661,0.0009091629,0.0013656664,0.0026035071,0.001968642,0.010797512,0.0023734968,0.0028776024,0.18516126],"category_scores_gemma":[0.0037818144,0.00037929468,0.0008097212,0.0026853178,0.00105881,0.004127158,0.002823965,0.0028695082,0.14553054],"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.000060326685,0.000019521714,0.00014596923,0.00025675437,0.0000036951897,0.00004286861,0.000026215705,0.00005593793,0.00011448923,0.0038379165,0.91241884,0.08301755],"study_design_scores_gemma":[0.0000046557516,0.000020378604,0.00026842367,0.00010107675,0.0000046094246,0.00008531434,0.000039242557,0.000031089254,0.00010224862,0.0008895612,0.99844813,0.0000052610517],"about_ca_topic_score_codex":0.0021021653,"about_ca_topic_score_gemma":0.0043161693,"teacher_disagreement_score":0.18516126,"about_ca_system_score_codex":0.002012785,"about_ca_system_score_gemma":0.0019976166,"threshold_uncertainty_score":0.61942613},"labels":[],"label_agreement":null},{"id":"W4212789678","doi":"10.1007/978-3-030-96068-1","title":"Internet of Things – ICIOT 2021","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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 Prince Edward Island","funders":"","keywords":"Internet privacy; Computer science","score_opus":0.014606361195257437,"score_gpt":0.2349356924876542,"score_spread":0.22032933129239676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212789678","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012369389,0.013684173,0.055037405,0.0015836487,0.00963805,0.00042923164,0.0039219125,0.004869199,0.90959954],"genre_scores_gemma":[0.005922758,0.012333738,0.024834251,0.0014481802,0.0014560453,0.00019203208,0.009254305,0.0018573158,0.94270134],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952245,0.00003284972,0.000018716975,0.000055621393,0.00032069653,0.00004975163],"domain_scores_gemma":[0.99959975,0.00005892308,0.000021935955,0.000056299108,0.00017366056,0.000089534675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057479437,0.00151337,0.0007535283,0.0023274235,0.0006402453,0.0024443853,0.00097242906,0.0017000497,0.08570663],"category_scores_gemma":[0.00071116595,0.00059580384,0.00060502987,0.001980875,0.000316736,0.0029117658,0.0011969574,0.002003895,0.07661435],"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.000054062533,0.00004585835,0.000055530483,0.00023428242,0.000012910786,0.00006438123,0.000016550812,0.0008754624,0.0033523596,0.018504333,0.7402184,0.23656578],"study_design_scores_gemma":[0.0000054537322,0.000039066927,0.00012380056,0.000095184434,0.000005573568,0.00012957383,0.000006172014,0.0015118826,0.00068158656,0.002924915,0.9944669,0.00000995098],"about_ca_topic_score_codex":0.0029801344,"about_ca_topic_score_gemma":0.0050469893,"teacher_disagreement_score":0.08570663,"about_ca_system_score_codex":0.0010360389,"about_ca_system_score_gemma":0.0009628632,"threshold_uncertainty_score":0.28671724},"labels":[],"label_agreement":null},{"id":"W4212863801","doi":"10.1007/3-540-45848-4_60","title":"Graph-Drawing Contest Report","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Mitsubishi Electric Research Laboratories","keywords":"CONTEST; Computer science; Graph; Ninth; Graph drawing; Graph algorithms; Theoretical computer science; Political science","score_opus":0.01777484275730002,"score_gpt":0.2308942981831741,"score_spread":0.2131194554258741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212863801","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010137591,0.0027228184,0.039420713,0.030185709,0.019082319,0.0010984225,0.062255453,0.015894532,0.8192024],"genre_scores_gemma":[0.042488776,0.0021408524,0.03376593,0.0028626905,0.0038563653,0.00066033704,0.12960307,0.007089519,0.7775325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979395,0.0003059171,0.00006477794,0.00035033823,0.0009656254,0.00037369676],"domain_scores_gemma":[0.9939201,0.00070774526,0.00007504919,0.0010372658,0.0017455171,0.0025144184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035211423,0.0012037336,0.0012079823,0.0021021902,0.0024009484,0.0051305974,0.0028983736,0.0020356828,0.23730461],"category_scores_gemma":[0.006116467,0.000510517,0.0009640832,0.0028978938,0.0005095957,0.0026574237,0.002849625,0.0032335094,0.14913201],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088815636,0.00011122026,0.00009324218,0.00004749966,0.0000051043376,0.000030052146,0.000017143147,0.00042794587,0.00026871715,0.0048413207,0.9595225,0.034546535],"study_design_scores_gemma":[0.00007869554,0.00006395401,0.0006276409,0.000037319165,0.000009346927,0.00007395871,0.000082844526,0.0029316533,0.0011853629,0.011647208,0.98324895,0.000013060504],"about_ca_topic_score_codex":0.013169856,"about_ca_topic_score_gemma":0.021655057,"teacher_disagreement_score":0.23730461,"about_ca_system_score_codex":0.0019882983,"about_ca_system_score_gemma":0.003941595,"threshold_uncertainty_score":0.793863},"labels":[],"label_agreement":null},{"id":"W4212950046","doi":"10.1007/978-3-030-83508-8_48","title":"Correction to: Algorithms and Data Structures","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Dalhousie University; University of Alberta; University of Waterloo","funders":"","keywords":"Computer science; Volume (thermodynamics); Algorithm; Information retrieval","score_opus":0.026530653083448676,"score_gpt":0.27889382068523627,"score_spread":0.2523631676017876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212950046","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024314219,0.0013397497,0.0063823024,0.051616646,0.9298448,0.000055702505,0.001140184,0.0027193797,0.0066581485],"genre_scores_gemma":[0.023708226,0.006863468,0.029778076,0.07710357,0.38681194,0.00038600122,0.004288741,0.008366022,0.46269384],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907231,0.001308743,0.0011866139,0.0013779424,0.0045235553,0.0008799869],"domain_scores_gemma":[0.95160484,0.0057106623,0.0015465193,0.0068271826,0.032741096,0.0015696987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034663542,0.0033967718,0.0041547325,0.0069927974,0.005478851,0.006296149,0.006093344,0.010979355,0.14228122],"category_scores_gemma":[0.06175659,0.0020804717,0.003035456,0.0059273876,0.0037522162,0.0052308585,0.003522692,0.011457536,0.10690283],"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.000034495333,0.000008661237,0.000041986284,0.00011085158,0.000014313561,0.000103124294,0.000018165687,0.00010650278,0.0000990286,0.0022343644,0.9880646,0.009164048],"study_design_scores_gemma":[0.0000322276,0.000025415939,0.00035403823,0.00016130129,0.00003298874,0.00041665303,0.000050157825,0.0011532803,0.00092955097,0.006340665,0.990457,0.00004665296],"about_ca_topic_score_codex":0.012504405,"about_ca_topic_score_gemma":0.016090006,"teacher_disagreement_score":0.14228122,"about_ca_system_score_codex":0.0064745196,"about_ca_system_score_gemma":0.0053186766,"threshold_uncertainty_score":0.47597808},"labels":[],"label_agreement":null},{"id":"W4213020116","doi":"10.1007/978-3-642-21827-9_5","title":"Model Checking Commitment Protocols","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Model checking; Protocol (science); Temporal logic; Modalities; Communications protocol; Programming language; Theoretical computer science; Computer network","score_opus":0.09944316654341848,"score_gpt":0.327938671029536,"score_spread":0.22849550448611752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213020116","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.01031248,0.0017679359,0.92843634,0.000995586,0.0004015274,0.00013130711,0.00017296377,0.0038855644,0.05389633],"genre_scores_gemma":[0.53250396,0.0037584961,0.34357888,0.0006596067,0.00046529892,0.0005050883,0.0014478642,0.0027421932,0.11433862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791425,0.00053523184,0.00010263894,0.00029720642,0.000987417,0.000163241],"domain_scores_gemma":[0.99796164,0.0009499213,0.00007992505,0.00077131967,0.00019147496,0.000045797886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014935732,0.0011092103,0.0008810821,0.0010232705,0.0009823607,0.0026814458,0.0023085657,0.0014596295,0.013213443],"category_scores_gemma":[0.005164646,0.0012448202,0.0010359456,0.0015567725,0.0018559006,0.0051520267,0.0025768285,0.0044058547,0.004222058],"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.0001276723,0.00007847583,0.00017114561,0.00029965234,0.000039654973,0.000112012385,0.000314087,0.017111992,0.00790436,0.80790377,0.011211086,0.15472601],"study_design_scores_gemma":[0.000042562366,0.0000591398,0.00010359066,0.00012224787,0.00003678477,0.00015749646,0.000060838018,0.06201922,0.017733585,0.87188685,0.047740463,0.000037267928],"about_ca_topic_score_codex":0.00068072305,"about_ca_topic_score_gemma":0.0008331295,"teacher_disagreement_score":0.013213443,"about_ca_system_score_codex":0.001293049,"about_ca_system_score_gemma":0.000976023,"threshold_uncertainty_score":0.0442034},"labels":[],"label_agreement":null},{"id":"W4213286017","doi":"10.1007/11751649","title":"Computational Science and Its Applications - ICCSA 2006","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.04817489263326968,"score_gpt":0.3399309816177417,"score_spread":0.29175608898447203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213286017","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044224095,0.15630986,0.19582914,0.013778303,0.034321737,0.00037404738,0.0035571794,0.005556662,0.58585066],"genre_scores_gemma":[0.025819158,0.10597622,0.07050058,0.0016865833,0.009529006,0.00034561474,0.0050023957,0.002221194,0.7789192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920124,0.000136532,0.000049326296,0.000116873816,0.00044254598,0.000053554628],"domain_scores_gemma":[0.99773467,0.0006145073,0.00007276651,0.0004694538,0.00083304034,0.00027552585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015888603,0.0014053843,0.002122868,0.0030901001,0.00090713426,0.0041181543,0.0012688411,0.0010693113,0.057890367],"category_scores_gemma":[0.0033071265,0.0009116681,0.0008183495,0.0061828294,0.001066706,0.0029758643,0.0023972108,0.0031740193,0.030942548],"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.000051683888,0.000071500355,0.00025444798,0.00044937007,0.00002762171,0.00003177742,0.00005507149,0.0029169891,0.00060248596,0.03447587,0.6600216,0.30104154],"study_design_scores_gemma":[0.000008846163,0.000039226637,0.0008567734,0.00034201247,0.000025876634,0.0002076342,0.00004205804,0.008564822,0.0007288351,0.032075964,0.9570884,0.000019539304],"about_ca_topic_score_codex":0.00334393,"about_ca_topic_score_gemma":0.0056259795,"teacher_disagreement_score":0.057890367,"about_ca_system_score_codex":0.0016676212,"about_ca_system_score_gemma":0.002231718,"threshold_uncertainty_score":0.19366258},"labels":[],"label_agreement":null},{"id":"W4213406532","doi":"10.1007/978-3-031-01333-1_14","title":"Exploring the Geometry and Topology of Neural Network Loss Landscapes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","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":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Maxima and minima; Dimensionality reduction; Generalization; Artificial neural network; Visualization; Nonlinear dimensionality reduction; Topology (electrical circuits); Jump; Reduction (mathematics); Trajectory; Manifold (fluid mechanics); Algorithm; Artificial intelligence; Mathematics; Geometry","score_opus":0.03630738852770949,"score_gpt":0.24030680133088006,"score_spread":0.20399941280317058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213406532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36131105,0.003857618,0.60404426,0.0027015633,0.000083732404,0.00003991848,0.00049750495,0.0005583688,0.026905943],"genre_scores_gemma":[0.92191124,0.0017009752,0.07030087,0.00015268609,0.0000867123,0.000048807175,0.00041100231,0.00022553233,0.0051620854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997422,0.00012268187,0.000010830255,0.000042709587,0.000055708744,0.000025862391],"domain_scores_gemma":[0.9970692,0.0023572538,0.00018648851,0.00013551254,0.00015179784,0.00009981212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151171,0.00052162784,0.0005300607,0.0014344887,0.000384665,0.0022927828,0.00096531113,0.0010252281,0.0028730389],"category_scores_gemma":[0.00807761,0.0005912016,0.00035484968,0.0008162355,0.00096817606,0.0030104993,0.0010745391,0.0012846243,0.00034874768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009651923,0.00005417234,0.0032278325,0.00017265292,0.000054428205,0.00024048885,0.00029111962,0.6746045,0.0043319464,0.25691324,0.003711037,0.056302115],"study_design_scores_gemma":[0.00000604369,0.000022845963,0.0006774706,0.000021921729,0.0000065154472,0.00008245504,0.0000705743,0.78673387,0.00045989617,0.21081181,0.0010952951,0.000011349332],"about_ca_topic_score_codex":0.0012263363,"about_ca_topic_score_gemma":0.0015345783,"teacher_disagreement_score":0.0028730389,"about_ca_system_score_codex":0.0008492104,"about_ca_system_score_gemma":0.00029378792,"threshold_uncertainty_score":0.009611249},"labels":[],"label_agreement":null},{"id":"W42142495","doi":"10.1007/978-3-642-21596-4_31","title":"Multiple Classifier System for Urban Area’s Extraction from High Resolution Remote Sensing Imagery","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","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":"University of Waterloo","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Particle swarm optimization; Pattern recognition (psychology); Land cover; Thematic map; Feature extraction; Machine learning; Geography; Land use; Engineering; Cartography","score_opus":0.03281128768504257,"score_gpt":0.22638569657220373,"score_spread":0.19357440888716115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42142495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086818285,0.002007946,0.89457333,0.00021911121,0.00052943407,0.0002123976,0.0013735114,0.008428828,0.005837229],"genre_scores_gemma":[0.3719998,0.0012942094,0.6053812,0.00024810113,0.00027088405,0.00027829848,0.0035413885,0.00026627345,0.016719831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963546,0.000022139468,0.00002349257,0.0001234446,0.00014109598,0.000054387907],"domain_scores_gemma":[0.9997111,0.000046845227,0.000019705722,0.00003385875,0.00016940084,0.000019172769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046678112,0.00062848895,0.00094247994,0.0016330618,0.00057195645,0.0007137416,0.0009838387,0.00089129276,0.003526584],"category_scores_gemma":[0.00057189213,0.00031663215,0.00064019585,0.0011752644,0.00012399092,0.00083663105,0.00057776563,0.00056638697,0.0027236224],"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.00023349097,0.00013676038,0.0023517322,0.00012701382,0.000070874885,0.00016833722,0.000061969986,0.004832003,0.09196081,0.0006692379,0.008111974,0.89127594],"study_design_scores_gemma":[0.000038617218,0.00029344537,0.022430126,0.000056541314,0.0002882602,0.000798995,0.00018088147,0.82469493,0.12582046,0.0020939677,0.023204425,0.00009935535],"about_ca_topic_score_codex":0.0035943438,"about_ca_topic_score_gemma":0.0065025412,"teacher_disagreement_score":0.0035943438,"about_ca_system_score_codex":0.0003764801,"about_ca_system_score_gemma":0.00049813784,"threshold_uncertainty_score":0.011797667},"labels":[],"label_agreement":null},{"id":"W4214486901","doi":"10.1007/978-3-642-23641-9","title":"Ubiquitous Intelligence and Computing","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Artificial intelligence; Data science; Human–computer interaction","score_opus":0.026282389797406717,"score_gpt":0.2513833874920307,"score_spread":0.225100997694624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214486901","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015768198,0.13968535,0.039513163,0.0058525177,0.007226506,0.000081524304,0.00013932535,0.00060119166,0.80532366],"genre_scores_gemma":[0.0307669,0.096680425,0.016269745,0.0034255476,0.0044085965,0.00016075672,0.000295011,0.00032619244,0.8476668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961495,0.00006258688,0.000019262447,0.000072606745,0.00018966984,0.000040804043],"domain_scores_gemma":[0.9997888,0.00006252712,0.0000121397015,0.00005098596,0.000047468515,0.000038144568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040032205,0.0014040004,0.001090923,0.0013090912,0.0010646766,0.0040673497,0.00067728135,0.0013872597,0.027299754],"category_scores_gemma":[0.00083732925,0.0004165598,0.00038990463,0.0023004233,0.002120078,0.006207451,0.002374948,0.0024753816,0.015572305],"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.000021013095,0.00004226826,0.00013386302,0.00040235213,0.000017220435,0.00009206142,0.00063583656,0.00048855535,0.0012501954,0.45246583,0.20143688,0.34301388],"study_design_scores_gemma":[0.0000033571405,0.000023453958,0.00022687731,0.00022534395,0.000008354396,0.00021365513,0.00015889195,0.0005272211,0.00022432438,0.086380236,0.9119997,0.000008618937],"about_ca_topic_score_codex":0.0010703972,"about_ca_topic_score_gemma":0.0020957412,"teacher_disagreement_score":0.027299754,"about_ca_system_score_codex":0.0011428777,"about_ca_system_score_gemma":0.000848017,"threshold_uncertainty_score":0.09132677},"labels":[],"label_agreement":null},{"id":"W4214619279","doi":"10.1007/978-3-642-21652-7_8","title":"A Model Driven Approach for AMF Configuration Generation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.04855387118183844,"score_gpt":0.24649906906051228,"score_spread":0.19794519787867385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214619279","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.0014179192,0.00003744413,0.9930916,0.00005023976,0.000024297513,0.00010200206,0.000102600105,0.0028739793,0.0022998424],"genre_scores_gemma":[0.07669664,0.00010937585,0.9184794,0.00009449023,0.000018836688,0.0003293295,0.00060171634,0.0009164069,0.0027538298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870694,0.0002992147,0.00006341486,0.00016614844,0.0006897063,0.000074499825],"domain_scores_gemma":[0.99826473,0.0007943712,0.00007879837,0.00043202066,0.00037480483,0.00005530096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012604467,0.0011152624,0.0008342802,0.0015729999,0.000763743,0.0020495318,0.002654997,0.0014683987,0.011127573],"category_scores_gemma":[0.0046380623,0.00093680434,0.0014017966,0.0011380591,0.00070274615,0.0016625538,0.0017725223,0.001617791,0.0024672963],"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.00019559979,0.0002646303,0.000799483,0.00034319074,0.00012147835,0.0005288739,0.00029551337,0.39832163,0.021669848,0.06134479,0.014659558,0.5014554],"study_design_scores_gemma":[0.000022183296,0.000030766514,0.00006898196,0.000027287091,0.000020602229,0.00013110737,0.000025440188,0.9657809,0.0055123176,0.020721843,0.0076391967,0.00001935059],"about_ca_topic_score_codex":0.0030604328,"about_ca_topic_score_gemma":0.0057868296,"teacher_disagreement_score":0.011127573,"about_ca_system_score_codex":0.00089510117,"about_ca_system_score_gemma":0.0010985746,"threshold_uncertainty_score":0.037225425},"labels":[],"label_agreement":null},{"id":"W4214874003","doi":"10.1007/978-3-662-45908-9_11","title":"Modelling Techniques for Simulating Large QCA Circuits","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Electronic circuit; Computer science; Electronic engineering; Engineering; Electrical engineering","score_opus":0.0285095164435084,"score_gpt":0.26151320676072004,"score_spread":0.23300369031721163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214874003","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.005900716,0.00018527292,0.9864465,0.00013865349,0.000045747314,0.00005669992,0.00012635745,0.00055978535,0.00654023],"genre_scores_gemma":[0.41068602,0.0010994177,0.5717317,0.00022023369,0.00007737092,0.00071600196,0.0006630517,0.000964913,0.013841412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969184,0.000072171526,0.000019600348,0.000039546016,0.00014446474,0.00003244756],"domain_scores_gemma":[0.9990865,0.0005522857,0.000058700327,0.00016231393,0.00010787668,0.000032273405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005275747,0.0008846797,0.0010083325,0.0005409484,0.0007350224,0.0010712811,0.0023612687,0.001664681,0.005736379],"category_scores_gemma":[0.002375112,0.0007488892,0.0011678181,0.0007973254,0.00087820645,0.0018349664,0.0010864426,0.0019255741,0.0014850738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004102117,0.00005000984,0.00019616634,0.00019295732,0.00003518189,0.00008868544,0.00014559379,0.7690532,0.013716642,0.19394086,0.0013478142,0.021191813],"study_design_scores_gemma":[0.0000068721074,0.000006752789,0.000024077503,0.000008279452,0.0000063637635,0.000021931683,0.000007450132,0.9569086,0.0012829344,0.04021917,0.0015009291,0.000006645561],"about_ca_topic_score_codex":0.0036453616,"about_ca_topic_score_gemma":0.0045493455,"teacher_disagreement_score":0.005736379,"about_ca_system_score_codex":0.0011713187,"about_ca_system_score_gemma":0.00086487975,"threshold_uncertainty_score":0.019190133},"labels":[],"label_agreement":null},{"id":"W4214886323","doi":"10.1007/978-3-642-16373-9_6","title":"The Model Role Level – A Vision","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Documentation; Context (archaeology); Perspective (graphical); Data science; Comprehension; Focus (optics); Software engineering; Knowledge management; Human–computer interaction; Artificial intelligence; Programming language","score_opus":0.016104034656652808,"score_gpt":0.24499104649305753,"score_spread":0.22888701183640472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214886323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022437384,0.0018528373,0.9592166,0.005023627,0.0004826397,0.000092541595,0.000112259215,0.0017996838,0.029176055],"genre_scores_gemma":[0.12677774,0.0030686024,0.8407086,0.0021342018,0.00080293097,0.00031199298,0.0005102781,0.0015297552,0.024155788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963457,0.0011570851,0.0003020513,0.0007867447,0.0011231444,0.00028530604],"domain_scores_gemma":[0.996073,0.0011471984,0.00018415807,0.0016069362,0.0005180674,0.0004706037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005212534,0.0013690667,0.001314833,0.0025897303,0.0014354871,0.009050845,0.0050675636,0.0034506184,0.010729164],"category_scores_gemma":[0.005213568,0.0015815136,0.0027131618,0.0017594929,0.007921763,0.021727927,0.0049021225,0.008589635,0.00564871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003343423,0.000040376402,0.00011867374,0.00014074214,0.000011923478,0.000051662893,0.0003435385,0.0016211917,0.0011521693,0.95482635,0.0046080686,0.037051816],"study_design_scores_gemma":[0.000024509096,0.0000537662,0.000108836335,0.00025095925,0.000041840583,0.00018103656,0.00021592341,0.036218457,0.0027637158,0.8093247,0.1507836,0.00003274944],"about_ca_topic_score_codex":0.002483349,"about_ca_topic_score_gemma":0.0016619223,"teacher_disagreement_score":0.010729164,"about_ca_system_score_codex":0.0027554177,"about_ca_system_score_gemma":0.0030856966,"threshold_uncertainty_score":0.035892606},"labels":[],"label_agreement":null},{"id":"W4214905240","doi":"10.1007/978-3-030-97099-4_5","title":"Improved Approximation Algorithms for Multiprocessor Scheduling with Testing","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"University of Alberta","funders":"","keywords":"Computer science; Multiprocessor scheduling; Multiprocessing; Job shop scheduling; Competitive analysis; Scheduling (production processes); Upper and lower bounds; Parallel computing; Flow shop scheduling; sort; Algorithm; Partition (number theory); Online algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Schedule; Combinatorics; Operating system","score_opus":0.022041914195645218,"score_gpt":0.23508858272435498,"score_spread":0.21304666852870977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214905240","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.005646191,0.00068041467,0.9875738,0.00026719828,0.00019554369,0.000056820394,0.00009578192,0.0012787997,0.004205458],"genre_scores_gemma":[0.14847626,0.00048571927,0.84403926,0.00024862873,0.00026224766,0.00025746488,0.00051601155,0.0005399602,0.0051745074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969907,0.001180703,0.00015900911,0.0003517891,0.000971495,0.0003462704],"domain_scores_gemma":[0.989319,0.0069648745,0.00043174558,0.0021849335,0.0008580212,0.00024138925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036078328,0.00199644,0.0023611272,0.0015363072,0.0007798058,0.0016742328,0.0047861165,0.0015973701,0.007353268],"category_scores_gemma":[0.016538737,0.0009743278,0.0017076747,0.0033222844,0.0016812395,0.0039863894,0.0022438916,0.0055002756,0.0013513435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070610066,0.00030624654,0.00067524216,0.00026614137,0.000107212494,0.00007542917,0.00009250081,0.5217766,0.0026471415,0.102956496,0.012437909,0.35795295],"study_design_scores_gemma":[0.000049673312,0.00003878665,0.00010794845,0.000016551858,0.000019349553,0.000026677308,0.0000090303565,0.9422116,0.0006598392,0.055463996,0.0013884928,0.000007884369],"about_ca_topic_score_codex":0.0046095964,"about_ca_topic_score_gemma":0.0049838726,"teacher_disagreement_score":0.007353268,"about_ca_system_score_codex":0.0026086757,"about_ca_system_score_gemma":0.0020386784,"threshold_uncertainty_score":0.024599135},"labels":[],"label_agreement":null},{"id":"W42177340","doi":"10.1007/978-3-319-07425-2_15","title":"Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Rendezvous; Modular design; Clock synchronization; Computer science; Algorithm; Cognitive radio; Block (permutation group theory); Channel (broadcasting); Real-time computing; Mathematics; Synchronization (alternating current); Computer network; Engineering; Telecommunications; Geometry","score_opus":0.01394187529074443,"score_gpt":0.23446319697466017,"score_spread":0.22052132168391575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42177340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12700674,0.004310423,0.8451981,0.0005888731,0.00040897637,0.00006138469,0.00010720342,0.00077998993,0.021538386],"genre_scores_gemma":[0.9030379,0.0013496664,0.09082924,0.00015138187,0.00018719336,0.000042534695,0.000088356865,0.00022160863,0.00409217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864584,0.00046655105,0.00004361811,0.00016046643,0.00045948388,0.00022404052],"domain_scores_gemma":[0.9947332,0.004107671,0.00017218517,0.00039772058,0.00052150514,0.00006773121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027779513,0.0012221572,0.00088287174,0.0006916341,0.0006276662,0.0020733727,0.0014422724,0.00096690166,0.003664175],"category_scores_gemma":[0.015656967,0.00034509704,0.00032779423,0.0011063378,0.0013729224,0.002130196,0.0018098672,0.0012930521,0.00061313953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001313832,0.00014362672,0.0013687122,0.0003371009,0.0000985219,0.0001220625,0.00027584733,0.6025075,0.027126003,0.10128581,0.0043463954,0.26107463],"study_design_scores_gemma":[0.000038211405,0.00015930457,0.00030208766,0.000040533792,0.000028303517,0.00010084103,0.000050994357,0.96414274,0.0067209345,0.026859593,0.0015278021,0.00002852828],"about_ca_topic_score_codex":0.0028215663,"about_ca_topic_score_gemma":0.0035512368,"teacher_disagreement_score":0.003664175,"about_ca_system_score_codex":0.0011084978,"about_ca_system_score_gemma":0.0020250962,"threshold_uncertainty_score":0.014691353},"labels":[],"label_agreement":null},{"id":"W4220732665","doi":"10.1007/978-3-030-99277-4_22","title":"Towards Post-Quantum Key-Updatable Public-Key Encryption via Supersingular Isogenies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptosystem; Encryption; Forward secrecy; Symmetric-key algorithm; Public-key cryptography; Key encapsulation; Discrete logarithm; Theoretical computer science; Secrecy; Computer security; Key (lock)","score_opus":0.016129514259756065,"score_gpt":0.22846537243721513,"score_spread":0.21233585817745906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220732665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034459796,0.00096751994,0.8971567,0.0012609973,0.0006347887,0.0001429664,0.00024302896,0.0015726709,0.063561596],"genre_scores_gemma":[0.6661163,0.0015960358,0.26295552,0.0010261118,0.0006116938,0.00023805925,0.0007146857,0.0011881052,0.06555346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998415,0.0003082134,0.00008763766,0.0002478679,0.000687069,0.0002541814],"domain_scores_gemma":[0.99838185,0.00039604236,0.00008311647,0.0009061956,0.00018390529,0.000049009777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012826353,0.00087181956,0.0010862398,0.0005888453,0.0009874443,0.002842926,0.0013932626,0.0013001481,0.01047288],"category_scores_gemma":[0.0029069022,0.0007058894,0.000887541,0.0010064509,0.0029103665,0.0065747052,0.004600176,0.004449852,0.005018542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121130666,0.00004327949,0.000072812814,0.00009705612,0.000014364204,0.000074996366,0.00015565327,0.004245498,0.0052534062,0.9534834,0.0039610397,0.03247729],"study_design_scores_gemma":[0.0000364118,0.000058397363,0.00010454888,0.00003709605,0.000017021299,0.0001952035,0.00005091896,0.0466608,0.015178662,0.9178369,0.019788345,0.000035596117],"about_ca_topic_score_codex":0.00023595283,"about_ca_topic_score_gemma":0.00028851896,"teacher_disagreement_score":0.01047288,"about_ca_system_score_codex":0.0009852288,"about_ca_system_score_gemma":0.0007809637,"threshold_uncertainty_score":0.035035312},"labels":[],"label_agreement":null},{"id":"W4221020012","doi":"10.1007/978-3-030-98978-1_9","title":"Deep Reinforcement Learning for Cost-Effective Controller Placement in Software-Defined Multihop Wireless Networking","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","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":"Computer science; Reinforcement learning; Software-defined networking; Controller (irrigation); Wireless network; Overhead (engineering); Wireless; Computer network; Software; Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.016230425766496206,"score_gpt":0.24629367552207612,"score_spread":0.2300632497555799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221020012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013802258,0.0005398255,0.9823391,0.00025979037,0.00008357636,0.000027770573,0.000036580605,0.00034378312,0.0025673544],"genre_scores_gemma":[0.87060726,0.00035473998,0.12204854,0.00020532381,0.0000883486,0.00012403594,0.000092422335,0.00010437973,0.0063750404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00010522211,0.000016414378,0.00007996292,0.0000772659,0.00008524341],"domain_scores_gemma":[0.9984503,0.0011857786,0.000071452705,0.000058761718,0.00017697687,0.000056712834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009488229,0.0010621288,0.00133055,0.00027684358,0.0003326699,0.00084283866,0.0014952694,0.0013585078,0.0035784962],"category_scores_gemma":[0.003282657,0.0006015231,0.00036815312,0.00041500275,0.00076899026,0.0008926896,0.001260685,0.0020949426,0.0003841789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059814454,0.00004352399,0.00015049575,0.000046465386,0.000016869493,0.000022656004,0.000021107047,0.94686943,0.00075671304,0.0055894786,0.0013479698,0.045075502],"study_design_scores_gemma":[0.0000026841394,0.000008151398,0.000010879654,0.000001948283,0.000001205414,0.0000020831521,0.0000015229682,0.9987129,0.00007647237,0.001129565,0.000051609644,9.292536e-7],"about_ca_topic_score_codex":0.0066610607,"about_ca_topic_score_gemma":0.007451405,"teacher_disagreement_score":0.0066610607,"about_ca_system_score_codex":0.0011872075,"about_ca_system_score_gemma":0.0012109593,"threshold_uncertainty_score":0.013244569},"labels":[],"label_agreement":null},{"id":"W4221036817","doi":"10.1007/978-3-030-98978-1_5","title":"Machine Learning Models for Malicious Traffic Detection in IoT Networks /IoT-23 Dataset/","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Internet of Things; Intrusion detection system; Decision tree; Artificial intelligence; Machine learning; Random forest; Artificial neural network; Classifier (UML); Data mining; Computer network; Computer security","score_opus":0.020288526199955546,"score_gpt":0.23373281330983492,"score_spread":0.21344428710987937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221036817","genre_codex":"dataset","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.17222115,0.001243684,0.012129437,0.0011626855,0.00090222096,0.00055549317,0.7895118,0.013536559,0.00873694],"genre_scores_gemma":[0.08593401,0.00033398782,0.013733021,0.00018440039,0.00009433928,0.00035820866,0.89448905,0.00029523356,0.0045776125],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00010591253,0.000066136556,0.0002059249,0.00027068445,0.00014276276],"domain_scores_gemma":[0.9985898,0.0003668664,0.00009883393,0.0003847689,0.0004495923,0.00011014235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096704403,0.0022045695,0.0007806873,0.0024956781,0.0006410005,0.00075744704,0.0018467499,0.0017111356,0.005502167],"category_scores_gemma":[0.0031363785,0.00032993688,0.0017796677,0.0016204385,0.00031721985,0.0007219105,0.0006935671,0.0016631355,0.0073805284],"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.0013144156,0.001814936,0.027348552,0.0013050067,0.00048149092,0.00047826205,0.00007040912,0.063061394,0.005150552,0.0013502408,0.77804667,0.11957814],"study_design_scores_gemma":[0.0012720128,0.001698569,0.093599066,0.00055762514,0.0006185642,0.0018412683,0.0005409479,0.6238502,0.029053293,0.006359189,0.24030846,0.00030086783],"about_ca_topic_score_codex":0.018862216,"about_ca_topic_score_gemma":0.031033866,"teacher_disagreement_score":0.018862216,"about_ca_system_score_codex":0.0010365637,"about_ca_system_score_gemma":0.0011293972,"threshold_uncertainty_score":0.03750485},"labels":[],"label_agreement":null},{"id":"W4221145401","doi":"10.1007/978-3-031-16449-1_29","title":"Deep Multimodal Guidance for Medical Image Classification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modality (human–computer interaction); Modalities; Context (archaeology); Medical imaging; Computer science; Artificial intelligence; Magnetic resonance imaging; Task (project management); Deep learning; Inference; Medical physics; Radiology; Medicine","score_opus":0.018277121006169586,"score_gpt":0.27898915648621586,"score_spread":0.2607120354800463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221145401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003698276,0.0041031823,0.98004156,0.0005303377,0.00021568015,0.000031077452,0.0003378788,0.0023786225,0.00866343],"genre_scores_gemma":[0.14129432,0.009810316,0.76329714,0.001187755,0.0004956451,0.00015311204,0.0014165607,0.0010547959,0.08129043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998987,0.000017506181,0.000004021732,0.000017930372,0.00004693461,0.000014877422],"domain_scores_gemma":[0.9998623,0.00006077665,0.000009696982,0.000019019712,0.000038364746,0.000009785514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022975652,0.0006088362,0.00037571447,0.00037546185,0.00010867917,0.0006516902,0.00055644487,0.00077300915,0.011110062],"category_scores_gemma":[0.00056119915,0.00023757388,0.0003618673,0.00040610286,0.00022352164,0.0005143824,0.0007121918,0.0008551409,0.0035163288],"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.000054751155,0.0000301939,0.00017337137,0.00015924053,0.000027232532,0.00007781233,0.000027842145,0.021711277,0.028602004,0.007057293,0.036462717,0.90561634],"study_design_scores_gemma":[0.000013202978,0.00011097224,0.00087032706,0.00015584704,0.000043086697,0.00084004964,0.000033853987,0.8455749,0.040842503,0.027489947,0.083992,0.000033313365],"about_ca_topic_score_codex":0.0014650067,"about_ca_topic_score_gemma":0.0033036547,"teacher_disagreement_score":0.011110062,"about_ca_system_score_codex":0.00026536157,"about_ca_system_score_gemma":0.00029475612,"threshold_uncertainty_score":0.037166893},"labels":[],"label_agreement":null},{"id":"W4225362522","doi":"10.1007/978-3-030-99739-7_24","title":"How Different are Pre-trained Transformers for Text Ranking?","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":12,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute of Steel Construction","keywords":"Computer science; Transformer; Artificial intelligence; Ranking (information retrieval); Machine learning; Information retrieval; Relevance (law); Question answering; Encoder; Task (project management); Recall; Artificial neural network; Learning to rank; Precision and recall; Deep learning; Natural language processing; Deep neural networks","score_opus":0.02048011377708883,"score_gpt":0.23805279336187277,"score_spread":0.21757267958478393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225362522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10479865,0.009184176,0.8302152,0.006971478,0.0025278316,0.00038140136,0.003716363,0.025811512,0.016393345],"genre_scores_gemma":[0.7054167,0.0030310408,0.26223588,0.0019765291,0.001187335,0.00029951253,0.009303985,0.00401352,0.012535555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99252397,0.0033312507,0.00050554785,0.0017414502,0.001191487,0.00070626667],"domain_scores_gemma":[0.985658,0.0076769954,0.00033157913,0.0034135715,0.002274496,0.00064535474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008871355,0.0017449288,0.0017714191,0.002509979,0.00091912405,0.0046997773,0.0026406392,0.0029160744,0.007967296],"category_scores_gemma":[0.04243112,0.0008516066,0.0015399093,0.0019110771,0.0011318373,0.016683428,0.0016900572,0.0043965233,0.011557779],"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.0018336232,0.00039080935,0.0075336797,0.00047208203,0.0005076202,0.00005599829,0.00018252817,0.01421436,0.011523782,0.012201909,0.04174099,0.9093427],"study_design_scores_gemma":[0.00076445384,0.0013222303,0.0109126195,0.0004389734,0.0009266257,0.00065133616,0.0010639795,0.7102238,0.06508983,0.1709856,0.037322722,0.00029783876],"about_ca_topic_score_codex":0.004799989,"about_ca_topic_score_gemma":0.009493167,"teacher_disagreement_score":0.008871355,"about_ca_system_score_codex":0.0013749878,"about_ca_system_score_gemma":0.0026689097,"threshold_uncertainty_score":0.046916783},"labels":[],"label_agreement":null},{"id":"W4225474367","doi":"10.1007/978-3-030-99527-0_35","title":"Ultimate GemCutter and the Axes of Generalization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generalization; Correctness; Computer science; Counterexample; Spurious relationship; Concurrency; Interpolation (computer graphics); Theoretical computer science; Algorithm; Programming language; Artificial intelligence; Discrete mathematics; Mathematics; Machine learning; Image (mathematics)","score_opus":0.020933760023833955,"score_gpt":0.26664843946888384,"score_spread":0.24571467944504988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225474367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09014214,0.0008388463,0.85336035,0.0009677148,0.00020783485,0.00010029326,0.000088221466,0.003157606,0.05113703],"genre_scores_gemma":[0.800504,0.00048026294,0.18452732,0.00079935155,0.000125237,0.00009394383,0.00017128221,0.00056977343,0.012728863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651295,0.0009098571,0.00015794791,0.0007986351,0.001249549,0.00037104753],"domain_scores_gemma":[0.9960104,0.0015628183,0.00014977202,0.0014987239,0.00063728815,0.00014102114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039369795,0.0005953846,0.0007444357,0.0010222557,0.0007898585,0.0017439672,0.0016762464,0.00094487466,0.0036198364],"category_scores_gemma":[0.00526645,0.0006010824,0.0012135659,0.0007747437,0.0047180667,0.004358981,0.004184868,0.0040011425,0.0005566934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021255478,0.000059327154,0.0010016557,0.000110738394,0.00002051692,0.00022996373,0.0003795142,0.016468989,0.00854195,0.903881,0.0017512706,0.067342445],"study_design_scores_gemma":[0.000039644427,0.00026024767,0.0005454945,0.00008236929,0.00003587093,0.00040967276,0.00014695778,0.10999529,0.021076927,0.8365239,0.030832037,0.000051610266],"about_ca_topic_score_codex":0.0012049726,"about_ca_topic_score_gemma":0.0013297652,"teacher_disagreement_score":0.0039369795,"about_ca_system_score_codex":0.0011241988,"about_ca_system_score_gemma":0.0010731596,"threshold_uncertainty_score":0.020820975},"labels":[],"label_agreement":null},{"id":"W4225515473","doi":"10.1007/978-3-030-98438-0_11","title":"Player Personality Traits and the Effectiveness of a Persuasive Game for Disease Awareness Among the African Population","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","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":"","keywords":"Agreeableness; Conscientiousness; Big Five personality traits; Personality; Persuasion; Neuroticism; Population; Persuasive technology; Social psychology; Psychology; Applied psychology; Computer science; Extraversion and introversion; Medicine","score_opus":0.03017684233362398,"score_gpt":0.3388012646921144,"score_spread":0.3086244223584904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225515473","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.9983039,0.00009339068,0.000038837392,0.000091006565,0.000010244382,0.00001018561,0.000023766102,0.0000024867556,0.0014261389],"genre_scores_gemma":[0.9982413,0.00012932681,0.00016665786,0.00003167668,0.00000956089,0.000015041091,0.000026316444,0.0000017955149,0.001378413],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99970204,0.00015295458,0.000019005874,0.000023018898,0.000062268315,0.000040681465],"domain_scores_gemma":[0.9962131,0.0025764683,0.00052071334,0.00006932384,0.00013702344,0.00048340004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008485617,0.00023421485,0.00018159531,0.00039959536,0.00035022534,0.00081978017,0.00022866098,0.00039775533,0.003791263],"category_scores_gemma":[0.007972231,0.00016908589,0.00026494495,0.00022610667,0.00012688976,0.00041233934,0.0003773817,0.0007219686,0.00036874993],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022247385,0.0073827463,0.913173,0.00007581176,0.0002604334,0.00038059303,0.0025094408,0.00028262468,0.0024535162,0.00030877526,0.0009095572,0.07003887],"study_design_scores_gemma":[0.000063277446,0.002139925,0.99426645,0.000026050819,0.00010990767,0.00016324533,0.0013035949,0.0009685272,0.00041727186,0.00014760159,0.00038361724,0.000010516923],"about_ca_topic_score_codex":0.0016375491,"about_ca_topic_score_gemma":0.002495702,"teacher_disagreement_score":0.003791263,"about_ca_system_score_codex":0.00023440363,"about_ca_system_score_gemma":0.00022165613,"threshold_uncertainty_score":0.012683094},"labels":[],"label_agreement":null},{"id":"W4225621597","doi":"10.1007/978-3-030-97457-2_8","title":"BDI for Autonomous Mobile Robot Navigation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Carleton University","funders":"","keywords":"Computer science; Mobile robot; Asynchronous communication; Robot; Plan (archaeology); Human–computer interaction; Grid; Motion planning; Premise; Artificial intelligence; Mobile robot navigation; Path (computing); Real-time computing; Simulation; Robot control; Telecommunications; Programming language","score_opus":0.0215486507329825,"score_gpt":0.26212903826326267,"score_spread":0.24058038753028016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225621597","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.0022619497,0.006974212,0.9318597,0.00044855013,0.0011660698,0.00008123344,0.0010370701,0.004800124,0.051371068],"genre_scores_gemma":[0.11783187,0.008282125,0.73376024,0.00078709977,0.00059335236,0.00072526856,0.0040910477,0.0014580007,0.13247102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997862,0.000026509584,0.000018805355,0.000042941698,0.00010682547,0.000018698182],"domain_scores_gemma":[0.99987626,0.000044848635,0.000009235685,0.00003079619,0.00003262842,0.0000061873025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002216255,0.0010861233,0.0011349224,0.00081627286,0.0004371183,0.0013609068,0.0010395339,0.00076686917,0.022501031],"category_scores_gemma":[0.0005305313,0.00049595605,0.00062323,0.001421049,0.00055780855,0.0012531489,0.00090682367,0.0019536975,0.011052171],"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.0001802002,0.000063666244,0.00014981724,0.0008468707,0.000050022467,0.00011670282,0.00008803799,0.021117868,0.0071994136,0.27545828,0.0606931,0.634036],"study_design_scores_gemma":[0.0000963686,0.0000976095,0.00034966614,0.00023644144,0.00005258743,0.00040504694,0.000052329982,0.18651855,0.0075791245,0.52048784,0.28406745,0.000056984718],"about_ca_topic_score_codex":0.0010767392,"about_ca_topic_score_gemma":0.0014736616,"teacher_disagreement_score":0.022501031,"about_ca_system_score_codex":0.0006780086,"about_ca_system_score_gemma":0.00041428139,"threshold_uncertainty_score":0.075273395},"labels":[],"label_agreement":null},{"id":"W4225649457","doi":"10.1007/978-3-030-98358-1_21","title":"Mining Minority-Class Examples with Uncertainty Estimates","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Simon Fraser University; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Class (philosophy); Data mining; Artificial intelligence","score_opus":0.02613424390481921,"score_gpt":0.2570335863880409,"score_spread":0.2308993424832217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225649457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048510473,0.0018048957,0.94497347,0.0006062326,0.00010698682,0.000075226686,0.00029466208,0.0006771965,0.0029508078],"genre_scores_gemma":[0.5041724,0.0009894603,0.48550633,0.0003697514,0.0004427637,0.0002521495,0.0020986085,0.00024440777,0.0059241494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976283,0.0005548505,0.00015765819,0.0005102458,0.0010257699,0.00012317758],"domain_scores_gemma":[0.9916963,0.0060924753,0.00041704904,0.00078373385,0.00089076714,0.00011966736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032210052,0.0010017863,0.0015463319,0.0016204702,0.00071094336,0.0021362335,0.0025393388,0.0017418625,0.0022086587],"category_scores_gemma":[0.017680004,0.00081753935,0.0010030579,0.0015174384,0.00076438923,0.0038074956,0.002741573,0.0021631678,0.0008635745],"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.00065105775,0.00023247843,0.0085192,0.00048423078,0.00025431422,0.0004986587,0.00041258868,0.1485095,0.0075203325,0.030054957,0.01205816,0.7908045],"study_design_scores_gemma":[0.000015185926,0.00004639485,0.0008026336,0.00006227292,0.000041529493,0.00021321875,0.00007409486,0.95747095,0.0046144323,0.033755615,0.002890746,0.000012787332],"about_ca_topic_score_codex":0.0006872444,"about_ca_topic_score_gemma":0.0010404756,"teacher_disagreement_score":0.0032210052,"about_ca_system_score_codex":0.0005444377,"about_ca_system_score_gemma":0.0004767115,"threshold_uncertainty_score":0.01703453},"labels":[],"label_agreement":null},{"id":"W4225656840","doi":"10.1007/978-3-030-99739-7_21","title":"GameOfThronesQA: Answer-Aware Question-Answer Pairs for TV Series","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Toronto Metropolitan University","funders":"","keywords":"Paragraph; Computer science; Information retrieval; Series (stratigraphy); Snapshot (computer storage); Set (abstract data type); Television series; Questions and answers; Pipeline (software); Artificial intelligence; Natural language processing; Data science; World Wide Web; Database; Media studies","score_opus":0.020473852071755335,"score_gpt":0.2545611907355675,"score_spread":0.23408733866381215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225656840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01633671,0.0008234943,0.70570046,0.0008355875,0.00079099723,0.0011030143,0.015564081,0.21296096,0.045884747],"genre_scores_gemma":[0.22730784,0.0005795187,0.64540803,0.0009763281,0.00029737956,0.0016519615,0.038932238,0.020796336,0.06405037],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982687,0.00052960915,0.00010876522,0.00044598646,0.00048692685,0.00015990043],"domain_scores_gemma":[0.9981839,0.0011343483,0.000047587695,0.00025982904,0.00022927758,0.0001449895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437811,0.0022199482,0.0014065244,0.0012089227,0.00084060937,0.0021699013,0.002846482,0.0018050737,0.08407521],"category_scores_gemma":[0.0069671962,0.0009769185,0.0014228473,0.0007192731,0.00064228964,0.005074841,0.004397388,0.0019922005,0.026279218],"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.002358342,0.00072473934,0.0013180516,0.0019213088,0.00017146564,0.00044278754,0.0018320866,0.009006026,0.033139605,0.07754873,0.44068295,0.4308538],"study_design_scores_gemma":[0.00079444674,0.0005869646,0.0014126265,0.0002488806,0.00016768227,0.0004771838,0.00076534314,0.26609567,0.03960651,0.14871053,0.5409087,0.00022551705],"about_ca_topic_score_codex":0.0038776225,"about_ca_topic_score_gemma":0.006311394,"teacher_disagreement_score":0.08407521,"about_ca_system_score_codex":0.0008983454,"about_ca_system_score_gemma":0.0008981764,"threshold_uncertainty_score":0.2812596},"labels":[],"label_agreement":null},{"id":"W4225760253","doi":"10.1007/978-3-030-98438-0_15","title":"Saving Life and Keeping Privacy: A Study on Mobile Apps for Suicide Prevention and Privacy Policies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Computer science; Internet privacy; Computer security; Privacy policy; Information privacy; Privacy protection; Mobile apps; World Wide Web","score_opus":0.06044916359163638,"score_gpt":0.38590035324372657,"score_spread":0.3254511896520902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225760253","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.9971898,0.00031758423,0.00009768778,0.0002112994,0.000020727388,0.00018184583,0.000037391543,0.0000030206713,0.0019407806],"genre_scores_gemma":[0.99129885,0.0016962745,0.00087236613,0.0007707416,0.000042878575,0.00071806734,0.00010293867,0.000014252411,0.004483549],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9979235,0.0010584528,0.00017295779,0.00020994482,0.000366701,0.0002682957],"domain_scores_gemma":[0.9803019,0.016384352,0.0011629105,0.0004864202,0.00068061677,0.0009839091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045146975,0.0006203694,0.0008378237,0.0009052559,0.0028667008,0.0026753168,0.0008012101,0.0019423779,0.006121664],"category_scores_gemma":[0.018137768,0.00092303375,0.0011539194,0.001041001,0.0015411914,0.00326396,0.0016176739,0.003343924,0.0010131433],"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.0092120515,0.14467421,0.21901561,0.0032531228,0.000724265,0.0019939162,0.32718164,0.00031253338,0.003294015,0.004898087,0.005009897,0.28043067],"study_design_scores_gemma":[0.005227623,0.108967684,0.48462698,0.0026558745,0.0024520648,0.002085826,0.3606109,0.0015067223,0.0030881371,0.0029145482,0.025492007,0.00037160167],"about_ca_topic_score_codex":0.0041469387,"about_ca_topic_score_gemma":0.007512476,"teacher_disagreement_score":0.006121664,"about_ca_system_score_codex":0.0009828167,"about_ca_system_score_gemma":0.0024320683,"threshold_uncertainty_score":0.02387625},"labels":[],"label_agreement":null},{"id":"W4225930644","doi":"10.1007/978-3-030-98438-0_13","title":"Player Matching in a Persuasive Mobile Exergame: Towards Performance-Driven Collaboration and Adaptivity","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Dalhousie University","funders":"","keywords":"Matching (statistics); Context (archaeology); Computer science; Persuasive technology; Baseline (sea); Dimension (graph theory); Group (periodic table); Intervention (counseling); Propensity score matching; Human–computer interaction; Psychology; Social psychology; Mathematics","score_opus":0.014599459246949721,"score_gpt":0.26064244705636525,"score_spread":0.24604298780941553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225930644","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26451123,0.0005996632,0.69143033,0.00034746627,0.00015380654,0.00035891644,0.00010165198,0.0017963117,0.04070054],"genre_scores_gemma":[0.77381265,0.0003301784,0.19858585,0.00011452502,0.0000463376,0.00030322143,0.0001933752,0.00023108802,0.02638278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994803,0.00014523596,0.000021334616,0.00015936939,0.0001414977,0.000052290183],"domain_scores_gemma":[0.9996213,0.00020465914,0.000029405568,0.00004975693,0.00004526283,0.000049557937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582576,0.00062734645,0.00041430723,0.00031437352,0.0003463814,0.0013334607,0.0010789714,0.0009958365,0.004985346],"category_scores_gemma":[0.0013705251,0.00031153165,0.00032147882,0.00027329818,0.00034070906,0.0014452594,0.0021373904,0.00071456685,0.0018781786],"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.0016673728,0.0019100979,0.0028956695,0.0008771334,0.0001862644,0.00043858276,0.0040176213,0.022431733,0.32284003,0.03658038,0.0047648298,0.60139024],"study_design_scores_gemma":[0.00037439924,0.0041491766,0.019634785,0.00031129186,0.0004206047,0.0022299609,0.0029469347,0.6145593,0.19725253,0.08593594,0.07200072,0.00018433075],"about_ca_topic_score_codex":0.00021807566,"about_ca_topic_score_gemma":0.00027145311,"teacher_disagreement_score":0.004985346,"about_ca_system_score_codex":0.000118735414,"about_ca_system_score_gemma":0.00028191364,"threshold_uncertainty_score":0.016677618},"labels":[],"label_agreement":null},{"id":"W4226021634","doi":"10.1007/978-3-030-98785-5_25","title":"Zoom Session Quality: A Network-Level View","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Zoom; Computer science; Session (web analytics); Videoconferencing; Multimedia; Scale (ratio); Quality (philosophy); World Wide Web; Engineering","score_opus":0.035524688644608504,"score_gpt":0.2709814551200631,"score_spread":0.2354567664754546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226021634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029726028,0.016096754,0.79156303,0.0038582536,0.0007530048,0.00016434569,0.0022321225,0.01140043,0.14420599],"genre_scores_gemma":[0.696284,0.015959049,0.21789134,0.0013851464,0.0023175997,0.00014504137,0.002067355,0.0031193942,0.060831126],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992255,0.0000922323,0.00002943491,0.00010061004,0.00046037187,0.00009180458],"domain_scores_gemma":[0.9981931,0.0006263231,0.00011292372,0.00024660974,0.00058879034,0.00023233304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166968,0.0007108465,0.0007216893,0.0020516864,0.00051896094,0.0046279537,0.0016437396,0.000914246,0.017906139],"category_scores_gemma":[0.0030350722,0.00051334035,0.0004439388,0.001998418,0.000648397,0.0048728315,0.0013516156,0.0019283363,0.0025700647],"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.00059721194,0.0002539148,0.00757001,0.0012941846,0.0001891023,0.00049596664,0.00093766826,0.08838792,0.055685192,0.2739543,0.06791857,0.50271595],"study_design_scores_gemma":[0.00004742848,0.00026831575,0.013765696,0.00042492137,0.00023999016,0.0011234963,0.0006818959,0.6308231,0.027809782,0.11993074,0.20471448,0.00017019652],"about_ca_topic_score_codex":0.0071582696,"about_ca_topic_score_gemma":0.0058099944,"teacher_disagreement_score":0.017906139,"about_ca_system_score_codex":0.001812293,"about_ca_system_score_gemma":0.0006524396,"threshold_uncertainty_score":0.059901953},"labels":[],"label_agreement":null},{"id":"W4226048757","doi":"10.1007/978-3-030-98438-0_10","title":"Investigating the Efficacy of Persuasive Strategies on Promoting Fair Recommendations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Computer science; Recommender system; Active listening; User satisfaction; Empirical research; User interface; Work (physics); Computer user satisfaction; Internet privacy; World Wide Web; User experience design; Human–computer interaction; User interface design; Psychology","score_opus":0.03554257312488931,"score_gpt":0.2846684188917957,"score_spread":0.2491258457669064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226048757","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.98724556,0.00063886284,0.001617505,0.0003792009,0.00007188866,0.00017703163,0.000078847996,0.000038191505,0.009752836],"genre_scores_gemma":[0.9940691,0.00038145678,0.0031929999,0.00010960671,0.0000594534,0.00020659102,0.000093148774,0.000019604344,0.0018679098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945022,0.0033438278,0.00036830123,0.0005560578,0.0010192833,0.00021028203],"domain_scores_gemma":[0.62889916,0.35492176,0.0074546556,0.0049383757,0.0023178472,0.0014681971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012244325,0.00072993897,0.00062477565,0.0010646055,0.00046898387,0.0020346718,0.00090297865,0.001936481,0.0054312996],"category_scores_gemma":[0.16333136,0.0006072286,0.0005905013,0.0006910593,0.0006432735,0.0022788253,0.0007798167,0.0020113708,0.00087413494],"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.04552941,0.038733266,0.25600484,0.005328482,0.0039880145,0.00038692658,0.01389518,0.014982306,0.029525785,0.015150534,0.004430229,0.5720451],"study_design_scores_gemma":[0.010950068,0.08852738,0.67638546,0.0020952371,0.009942121,0.0010423029,0.010965989,0.120015584,0.03263026,0.036420498,0.010482607,0.0005426247],"about_ca_topic_score_codex":0.0014805786,"about_ca_topic_score_gemma":0.0010997558,"teacher_disagreement_score":0.012244325,"about_ca_system_score_codex":0.00038607352,"about_ca_system_score_gemma":0.00065477646,"threshold_uncertainty_score":0.06475496},"labels":[],"label_agreement":null},{"id":"W4226054115","doi":"10.1007/978-3-030-99739-7_6","title":"A Light-Weight Strategy for Restraining Gender Biases in Neural Rankers","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Machine learning; Training set; Sampling (signal processing); Sampling bias; Statistics; Sample size determination; Mathematics","score_opus":0.0781440851206188,"score_gpt":0.29463180214013907,"score_spread":0.21648771701952027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226054115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056418005,0.00085398584,0.931347,0.00066369347,0.00036199956,0.0000877345,0.000240661,0.002947641,0.007079296],"genre_scores_gemma":[0.66863996,0.00037139416,0.30581167,0.0007218945,0.0003121585,0.0001457184,0.0006008188,0.00079297036,0.022603374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995289,0.000106374115,0.000027218877,0.00015662413,0.0000968914,0.00008404587],"domain_scores_gemma":[0.9989197,0.00033893695,0.00006414955,0.0002702732,0.00032257574,0.00008431913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014797194,0.0008838014,0.0007232078,0.00061528507,0.0005688841,0.0008682163,0.00197449,0.0014985864,0.0062421877],"category_scores_gemma":[0.0056040306,0.0004133358,0.0005480249,0.00067588285,0.00077496696,0.0016830043,0.001765851,0.0021304423,0.0023087007],"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.00038849888,0.00026783792,0.0015011908,0.00012141598,0.00012242662,0.00007172204,0.00017856085,0.04299221,0.04869472,0.0146800475,0.009635976,0.88134533],"study_design_scores_gemma":[0.00006212274,0.00020152352,0.0016711237,0.000035922865,0.00010921966,0.00016917095,0.00010051093,0.93592566,0.028097179,0.028527789,0.0050545787,0.000045188528],"about_ca_topic_score_codex":0.0032125681,"about_ca_topic_score_gemma":0.007826976,"teacher_disagreement_score":0.0062421877,"about_ca_system_score_codex":0.0005030315,"about_ca_system_score_gemma":0.00084190717,"threshold_uncertainty_score":0.02088219},"labels":[],"label_agreement":null},{"id":"W4226074176","doi":"10.1007/978-3-030-99253-8_19","title":"Complete and tractable machine-independent characterizations of second-order polytime","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Order (exchange); Completeness (order theory); Polynomial; Algorithm; Computer science; Type (biology); Characterization (materials science); Discrete mathematics; Artificial intelligence; Mathematics; Physics; Finance","score_opus":0.019633193197427727,"score_gpt":0.23999419098161007,"score_spread":0.22036099778418233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226074176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26542282,0.00076137343,0.6719435,0.0038132335,0.0001221266,0.00020259531,0.0040286025,0.002510013,0.0511959],"genre_scores_gemma":[0.92452353,0.0003049521,0.05718014,0.0004911537,0.00023029067,0.00031054261,0.0025451225,0.00062611914,0.013788002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608177,0.0008089939,0.00021832953,0.00093152904,0.0012298764,0.0007293802],"domain_scores_gemma":[0.9859007,0.009460493,0.00094449567,0.0020678127,0.0010793961,0.00054711977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020283705,0.0011016474,0.0013076338,0.0015534334,0.001561422,0.0055443486,0.0028863708,0.0015301527,0.010571446],"category_scores_gemma":[0.0110162245,0.0009519886,0.0026566212,0.002248809,0.0033480502,0.009586507,0.0025488664,0.0057974122,0.0009614185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021775295,0.0000953945,0.0011804029,0.00019120912,0.000033579454,0.00015590519,0.00052704156,0.029067237,0.0019411276,0.9558111,0.002835175,0.007944191],"study_design_scores_gemma":[0.00005639894,0.0000498653,0.00075548474,0.000043320997,0.000033501226,0.00017112948,0.00016863599,0.12369707,0.0024330826,0.86540806,0.007144479,0.000038992745],"about_ca_topic_score_codex":0.0038548987,"about_ca_topic_score_gemma":0.0044487217,"teacher_disagreement_score":0.010571446,"about_ca_system_score_codex":0.003540935,"about_ca_system_score_gemma":0.0019466096,"threshold_uncertainty_score":0.035365045},"labels":[],"label_agreement":null},{"id":"W4226084239","doi":"10.1007/978-3-031-19787-1_31","title":"Layered Controllable Video Generation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"Vector Institute; Government of British Columbia; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; University of British Columbia","funders":"","keywords":"Computer science; Frame (networking); Benchmark (surveying); Artificial intelligence; Generator (circuit theory); Parameterized complexity; Key (lock); Set (abstract data type); Process (computing); Computer vision; Algorithm; Power (physics)","score_opus":0.018552475249241404,"score_gpt":0.2464461734108119,"score_spread":0.2278936981615705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226084239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015924,0.00060013373,0.929834,0.0001172469,0.0002303084,0.000069527654,0.00020071524,0.0023994455,0.050624654],"genre_scores_gemma":[0.5341002,0.00087950495,0.41173843,0.00015684756,0.00012139048,0.00015681838,0.0008661965,0.00072518317,0.051255397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998565,0.00001643211,0.0000044945177,0.000030468516,0.00007285912,0.00001929722],"domain_scores_gemma":[0.9998493,0.000043483666,0.000012839926,0.00004492105,0.00003090935,0.000018535182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015950137,0.0005562349,0.00024927862,0.00038159153,0.00021467681,0.00067789387,0.0007389896,0.000392707,0.0115393],"category_scores_gemma":[0.00037032113,0.0002762764,0.00032275668,0.00027425168,0.0002818889,0.0007051542,0.0010778491,0.0007830615,0.0021978344],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029098013,0.00009220221,0.00029077043,0.00021993824,0.000038654645,0.00027644035,0.00012384854,0.03296901,0.37533966,0.15097167,0.013162926,0.4262239],"study_design_scores_gemma":[0.000046231744,0.00018378103,0.0005900515,0.00007539741,0.000030604973,0.0007369246,0.000039611743,0.59896046,0.3024531,0.04098417,0.055843852,0.000055867644],"about_ca_topic_score_codex":0.00028291956,"about_ca_topic_score_gemma":0.0003592911,"teacher_disagreement_score":0.0115393,"about_ca_system_score_codex":0.00029908406,"about_ca_system_score_gemma":0.00016064795,"threshold_uncertainty_score":0.03860283},"labels":[],"label_agreement":null},{"id":"W4226084777","doi":"10.1007/978-3-030-98253-9_1","title":"Overview of the HECKTOR Challenge at MICCAI 2021: Automatic Head and Neck Tumor Segmentation and Outcome Prediction in PET/CT Images","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Contouring; Computer science; Artificial intelligence; Task (project management); Segmentation; Sørensen–Dice coefficient; Head and neck; Ground truth; Pattern recognition (psychology); Image segmentation; Computer vision; Medicine; Computer graphics (images)","score_opus":0.02126084119170922,"score_gpt":0.29995053990377396,"score_spread":0.2786896987120647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226084777","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.011610238,0.2213541,0.48017928,0.03115035,0.015296695,0.0016043652,0.027476825,0.03523172,0.1760965],"genre_scores_gemma":[0.030112898,0.10511702,0.4621149,0.009529095,0.010006845,0.0012095094,0.10147055,0.010811045,0.26962817],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978726,0.00039553206,0.00010955116,0.00052502676,0.0008852374,0.0002119763],"domain_scores_gemma":[0.9978986,0.00050847477,0.00004510578,0.00031390248,0.0008513856,0.00038253976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040112208,0.0025028642,0.0018871239,0.0038287244,0.00087367976,0.0044381833,0.0033904763,0.003289091,0.031572655],"category_scores_gemma":[0.004403371,0.0011059248,0.0013268908,0.004517006,0.0005802432,0.003938169,0.0036709409,0.0037663402,0.039781068],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011595458,0.00013026559,0.00017550448,0.00060118653,0.000060035,0.00008632624,0.000054332668,0.003691383,0.003611866,0.0032962936,0.53025043,0.45792645],"study_design_scores_gemma":[0.00007256379,0.00026589396,0.0011449003,0.00031000064,0.000053435062,0.000658593,0.000084613785,0.03074571,0.008551001,0.022549184,0.9354468,0.00011721575],"about_ca_topic_score_codex":0.007713171,"about_ca_topic_score_gemma":0.0118926205,"teacher_disagreement_score":0.031572655,"about_ca_system_score_codex":0.0014647334,"about_ca_system_score_gemma":0.0022633367,"threshold_uncertainty_score":0.1056211},"labels":[],"label_agreement":null},{"id":"W4226127985","doi":"10.1007/978-3-030-98682-7_28","title":"Improving Dribbling, Passing, and Marking Actions in Soccer Simulation 2D Games Using Machine Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Memorial University of Newfoundland; Dalhousie University","funders":"","keywords":"Computer science; League; Action (physics); Artificial intelligence; Matching (statistics); SAFER; Competition (biology); Machine learning; Human–computer interaction; Operations research; Computer security","score_opus":0.043496756140618806,"score_gpt":0.2542418091761838,"score_spread":0.21074505303556496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226127985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24816218,0.0013435563,0.73411196,0.00029958773,0.00025083753,0.00014365565,0.00037638587,0.004698625,0.010613253],"genre_scores_gemma":[0.7888376,0.00038065502,0.20087226,0.00011930541,0.00004863549,0.00012275566,0.0006376812,0.0002542792,0.0087269405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973017,0.000043962176,0.000013412504,0.00009182879,0.00006140905,0.000059221195],"domain_scores_gemma":[0.99939406,0.00033718738,0.00004210991,0.000041247964,0.00012678168,0.000058693764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004990698,0.0012713507,0.001165087,0.0005471183,0.00030353921,0.0006968909,0.0012758322,0.00096083654,0.0046388283],"category_scores_gemma":[0.0015653066,0.00054297026,0.0005074474,0.0004286285,0.0002666202,0.0008097354,0.0008978007,0.0011826858,0.0009168836],"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.0005663206,0.00050889445,0.0018966516,0.00014104162,0.00007012536,0.000047354897,0.000077367775,0.4514112,0.011340651,0.0020029577,0.0034779212,0.52845955],"study_design_scores_gemma":[0.000011281111,0.00006510637,0.00045632443,0.0000052539144,0.000011621987,0.000008373038,0.000008920503,0.9966259,0.0017493754,0.00074336503,0.0003093015,0.0000051844654],"about_ca_topic_score_codex":0.013153301,"about_ca_topic_score_gemma":0.018290995,"teacher_disagreement_score":0.013153301,"about_ca_system_score_codex":0.00065408327,"about_ca_system_score_gemma":0.0009377577,"threshold_uncertainty_score":0.026153505},"labels":[],"label_agreement":null},{"id":"W4226140795","doi":"10.1007/978-3-031-01333-1_18","title":"AGS: Attribution Guided Sharpening as a Defense Against Adversarial Attacks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"MNIST database; Sharpening; Computer science; Adversarial system; Oracle; Deep neural networks; Artificial intelligence; Deep learning; Classifier (UML); Artificial neural network; Benchmark (surveying); Machine learning; Handwriting; Software engineering","score_opus":0.02268317233576097,"score_gpt":0.27692089995432223,"score_spread":0.2542377276185613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226140795","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.021259928,0.0008508414,0.9558185,0.0007055352,0.00048337338,0.00010444784,0.00012821416,0.0058264635,0.014822807],"genre_scores_gemma":[0.79052436,0.00083471835,0.17484,0.0010203355,0.00048084612,0.00013782714,0.00033286566,0.0009876366,0.030841382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885225,0.0002218979,0.000038891238,0.00023616066,0.00046842854,0.00018228557],"domain_scores_gemma":[0.99764246,0.0009772839,0.00022425147,0.0008143362,0.00021656905,0.0001249728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013848626,0.0011931203,0.0009405491,0.00086884777,0.00052137853,0.001618331,0.0018069467,0.0021756669,0.008368495],"category_scores_gemma":[0.0044804104,0.0004881018,0.00069145253,0.0006243022,0.0022784001,0.002486791,0.0042135348,0.004178008,0.0027676392],"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.0010569915,0.00023997392,0.0007133625,0.00029234806,0.000114720846,0.00032526287,0.00021034603,0.2845096,0.06464784,0.21944728,0.028844511,0.39959785],"study_design_scores_gemma":[0.000053960033,0.00027691436,0.0003540063,0.000037234535,0.000032389653,0.00025866774,0.000045707235,0.77401006,0.020804727,0.19371755,0.010365036,0.00004382086],"about_ca_topic_score_codex":0.00030883792,"about_ca_topic_score_gemma":0.00027654838,"teacher_disagreement_score":0.008368495,"about_ca_system_score_codex":0.0005643083,"about_ca_system_score_gemma":0.00057614234,"threshold_uncertainty_score":0.027995408},"labels":[],"label_agreement":null},{"id":"W4226176814","doi":"10.1007/978-3-030-99527-0_19","title":"Automatic Repair for Network Programs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Debugging; Modular design; Reuse; Abstraction; Set (abstract data type); Domain (mathematical analysis); Symbolic execution; Task (project management); Programming language; Software; Software engineering; Distributed computing; Embedded system; Systems engineering","score_opus":0.02667669564335165,"score_gpt":0.2650263496974982,"score_spread":0.23834965405414657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226176814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068858944,0.00034193986,0.9109875,0.000155324,0.000032976597,0.0001041193,0.00020443823,0.015468067,0.0038465979],"genre_scores_gemma":[0.556252,0.00028109047,0.43536648,0.00010042955,0.00002452893,0.000114079325,0.0008165234,0.0016124005,0.0054324646],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901617,0.0002593881,0.00006245306,0.00020802305,0.00035783218,0.00009610577],"domain_scores_gemma":[0.9966947,0.0015630018,0.00044951346,0.0008725314,0.0003832707,0.000036985755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008247037,0.000734909,0.00048608487,0.0010550382,0.0003748439,0.00066545274,0.0015524094,0.00057849573,0.0040432126],"category_scores_gemma":[0.0045149378,0.00028416552,0.00049272995,0.0006342823,0.0007996636,0.0012358198,0.0009353533,0.00070188736,0.0005208582],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003927082,0.00014973903,0.0031206822,0.0008897787,0.00006236298,0.00073734927,0.00077258545,0.14596048,0.092500634,0.03891587,0.008727099,0.7077707],"study_design_scores_gemma":[0.000059952312,0.00041216277,0.002026469,0.00016575576,0.00008509703,0.0010976725,0.00021717815,0.73520726,0.18771136,0.044646632,0.028319845,0.00005065303],"about_ca_topic_score_codex":0.0017794584,"about_ca_topic_score_gemma":0.0017295,"teacher_disagreement_score":0.0040432126,"about_ca_system_score_codex":0.0007040365,"about_ca_system_score_gemma":0.00071096775,"threshold_uncertainty_score":0.013525903},"labels":[],"label_agreement":null},{"id":"W4226185516","doi":"10.1007/978-3-031-02067-4","title":"Risks and Security of Internet and Systems","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information and Cyber 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":"Polytechnique Montréal","funders":"","keywords":"Computer security; Internet privacy; The Internet; Computer science; Business; World Wide Web","score_opus":0.0169938143446997,"score_gpt":0.24843869161724805,"score_spread":0.23144487727254834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226185516","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012180238,0.053056594,0.025046874,0.011696709,0.00091535534,0.000027493323,0.00010286931,0.00011476929,0.896859],"genre_scores_gemma":[0.42269713,0.07687588,0.013609681,0.0022033218,0.003209724,0.00010441402,0.00017992516,0.00013258337,0.48098734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998103,0.000059089863,0.0000063075845,0.00001481797,0.0000953036,0.000014150845],"domain_scores_gemma":[0.9994748,0.00035544264,0.000046497706,0.000042757456,0.00005186838,0.000028680905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030074624,0.0005804191,0.00027259634,0.00084326,0.0005313972,0.002379802,0.00027246954,0.0010378174,0.008788001],"category_scores_gemma":[0.0011747517,0.0001779885,0.00017778497,0.0007006971,0.0017521966,0.0029860241,0.00064731034,0.0017012666,0.0013493873],"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.000008293623,0.000012447069,0.00017423717,0.0000478075,0.0000050356407,0.00005254885,0.00031137443,0.0010802399,0.00026034802,0.94562244,0.020260142,0.032165166],"study_design_scores_gemma":[0.0000024126373,0.00001453029,0.00034180708,0.000088233486,0.0000043009413,0.00014330861,0.00018615187,0.0009185056,0.00010816924,0.8809998,0.11718857,0.000004228193],"about_ca_topic_score_codex":0.00081236195,"about_ca_topic_score_gemma":0.00092644885,"teacher_disagreement_score":0.008788001,"about_ca_system_score_codex":0.00081720285,"about_ca_system_score_gemma":0.0006225695,"threshold_uncertainty_score":0.02939874},"labels":[],"label_agreement":null},{"id":"W4226208814","doi":"10.1007/978-3-030-99736-6_41","title":"Another Look at DPR: Reproduction of Training and Replication of Retrieval","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Question answering; Replication (statistics); Codebase; Ranking (information retrieval); Scope (computer science); Encoder; Artificial intelligence; Natural language processing; Programming language; Source code","score_opus":0.03770741802576652,"score_gpt":0.2571676180958307,"score_spread":0.2194602000700642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226208814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013053104,0.0018366496,0.6409673,0.011226422,0.0027509644,0.00025197206,0.0013038642,0.023214372,0.3053953],"genre_scores_gemma":[0.19160445,0.0011576179,0.505405,0.004472386,0.0014605719,0.00032435634,0.0015480906,0.014753218,0.27927428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985044,0.0005468621,0.000079172954,0.0003413844,0.0004352939,0.00009296003],"domain_scores_gemma":[0.9892285,0.0037450227,0.00013352743,0.0059313974,0.0007227586,0.00023887455],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0023021705,0.00061491044,0.0006874272,0.0010097086,0.0009684897,0.0031459269,0.0028663925,0.0014205404,0.061511],"category_scores_gemma":[0.015428376,0.0006546184,0.000851207,0.0012339231,0.0022207059,0.009268157,0.002721284,0.0033229932,0.018686833],"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.0002999476,0.00020463625,0.0003251575,0.00036632954,0.000024198302,0.00021495124,0.0016507545,0.0039356723,0.023952255,0.28680533,0.114175506,0.5680453],"study_design_scores_gemma":[0.00016172059,0.00027184046,0.0010158687,0.0001615384,0.000057824713,0.0011840677,0.0006353341,0.04220979,0.031356547,0.2208529,0.701957,0.00013563645],"about_ca_topic_score_codex":0.0025667239,"about_ca_topic_score_gemma":0.0026426844,"teacher_disagreement_score":0.99769783,"about_ca_system_score_codex":0.0010838779,"about_ca_system_score_gemma":0.0009895312,"threshold_uncertainty_score":0.20577478},"labels":[],"label_agreement":null},{"id":"W4226218108","doi":"10.1007/978-3-030-97457-2_13","title":"Analysis of the Execution Time of the Jason BDI Reasoning Cycle","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Computer science; Execution time; Time complexity; Exploit; Running time; Worst-case execution time; Frame (networking); Profiling (computer programming); Response time; Programming language; Parallel computing; Algorithm; Operating system","score_opus":0.00913418617803789,"score_gpt":0.22096968387614668,"score_spread":0.2118354976981088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226218108","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.804165,0.0011851793,0.15376468,0.0006787416,0.00013658748,0.0002370839,0.0018169854,0.003867737,0.03414797],"genre_scores_gemma":[0.9105427,0.00019212134,0.08171662,0.000087155284,0.000018228,0.00010761214,0.0010023236,0.0004232569,0.0059099207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981997,0.0003676388,0.000064437416,0.00026122056,0.0007726987,0.0003341406],"domain_scores_gemma":[0.990257,0.0077813556,0.0003597417,0.00054630515,0.0008931925,0.00016245843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016786396,0.0007662234,0.0005496568,0.0015916426,0.0008691107,0.0015557441,0.0011856683,0.0005608869,0.010175664],"category_scores_gemma":[0.009643802,0.00045329114,0.0007747975,0.001454745,0.00079862337,0.0016857979,0.000593653,0.0011188127,0.000676473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005291118,0.00071273244,0.013016882,0.0010675003,0.00018790386,0.00035745034,0.00073094794,0.4704888,0.04699217,0.13515252,0.010384193,0.31561783],"study_design_scores_gemma":[0.00007475524,0.0001517036,0.0021565943,0.000025529695,0.00007422479,0.000060302387,0.00009049301,0.9701914,0.011712085,0.013762942,0.0016787703,0.000021157957],"about_ca_topic_score_codex":0.012102437,"about_ca_topic_score_gemma":0.015813477,"teacher_disagreement_score":0.012102437,"about_ca_system_score_codex":0.0024456636,"about_ca_system_score_gemma":0.0033023625,"threshold_uncertainty_score":0.034041047},"labels":[],"label_agreement":null},{"id":"W4226230274","doi":"10.1007/978-3-030-98438-0_2","title":"SortOut: Persuasive Stress Management Mobile Application for Higher Education Students","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Perfectionism, Procrastination, Anxiety Studies","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Anxiety; Stress management; Time management; Thematic analysis; Mobile apps; Applied psychology; Usability; Stress (linguistics); Control (management); Perception; Computer science; Intervention (counseling); Psychology; Perceived Stress Scale; Multimedia; Clinical psychology; Human–computer interaction; Qualitative research; World Wide Web; Artificial intelligence","score_opus":0.016541663367706193,"score_gpt":0.3301878802853243,"score_spread":0.3136462169176181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226230274","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23916982,0.011608231,0.20928189,0.0052475017,0.0037566666,0.0026598466,0.015926478,0.22934243,0.28300723],"genre_scores_gemma":[0.20853,0.005814239,0.09790141,0.004447986,0.0013740971,0.0016088065,0.0072881873,0.006751067,0.66628426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999337,0.000009822773,0.000004181623,0.000010897899,0.00003077268,0.00001062865],"domain_scores_gemma":[0.99964356,0.00019741984,0.000019051275,0.000018963521,0.00005301881,0.00006798861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023878155,0.001020318,0.00042386193,0.0005369518,0.00028405283,0.0007318447,0.0006750382,0.00086610194,0.11859695],"category_scores_gemma":[0.0006976616,0.00020700213,0.00029680313,0.00025956033,0.00006285832,0.0006270688,0.0007053978,0.0006094528,0.026648102],"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.0008088623,0.0006597689,0.0015204981,0.00059345516,0.000030362493,0.00033536166,0.000529343,0.00014938874,0.015715979,0.00051011343,0.22357869,0.755568],"study_design_scores_gemma":[0.001172395,0.004463777,0.044026457,0.00068575377,0.0005223954,0.0042516305,0.0016167391,0.008429315,0.039973933,0.0054571507,0.88908374,0.00031674764],"about_ca_topic_score_codex":0.00028998716,"about_ca_topic_score_gemma":0.0010398602,"teacher_disagreement_score":0.11859695,"about_ca_system_score_codex":0.00009516004,"about_ca_system_score_gemma":0.00018353363,"threshold_uncertainty_score":0.39674628},"labels":[],"label_agreement":null},{"id":"W4226244807","doi":"10.1007/978-3-031-02067-4_9","title":"Policy Modeling and Anomaly Detection in ABAC Policies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Flexibility (engineering); Anomaly detection; Access control; Redundancy (engineering); Security policy; Role-based access control; Computer security; Data mining","score_opus":0.01948630414541034,"score_gpt":0.2841106733264225,"score_spread":0.2646243691810121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226244807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015259997,0.00023914065,0.9791822,0.0005865172,0.00007844632,0.000058517322,0.00020439009,0.0014019889,0.0029888724],"genre_scores_gemma":[0.5587466,0.00046370729,0.43377468,0.00019424767,0.000119657445,0.00014394295,0.0006860503,0.00031736333,0.00555376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684393,0.0011473947,0.00019557908,0.000568415,0.00093569857,0.00030894607],"domain_scores_gemma":[0.98877305,0.0077790846,0.00062474847,0.0013190417,0.0012607827,0.00024340066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004227952,0.00065900915,0.001064237,0.0014744666,0.0010129089,0.0037305718,0.0021220664,0.001380172,0.0035127383],"category_scores_gemma":[0.015045709,0.0008326216,0.0012043614,0.0017712109,0.0013036013,0.0042646267,0.0014044497,0.0032475407,0.0007674514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023042112,0.00019153989,0.0055838684,0.0001337859,0.00009045927,0.00015622925,0.00026682354,0.65197396,0.001954715,0.18769275,0.0054305466,0.14629488],"study_design_scores_gemma":[0.000002036391,0.0000060628304,0.00010272226,0.000005786368,0.0000061421356,0.00001907939,0.000014841709,0.9693216,0.0004288002,0.029363386,0.00072462345,0.000004928985],"about_ca_topic_score_codex":0.013472668,"about_ca_topic_score_gemma":0.010296117,"teacher_disagreement_score":0.013472668,"about_ca_system_score_codex":0.0027343233,"about_ca_system_score_gemma":0.00263015,"threshold_uncertainty_score":0.026788533},"labels":[],"label_agreement":null},{"id":"W4226248605","doi":"10.1007/978-3-030-98785-5_26","title":"Zoomiversity: A Case Study of Pandemic Effects on Post-secondary Teaching and Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Pandemic; Campus network; Coronavirus disease 2019 (COVID-19); Zoom; Work (physics); Computer science; Transport engineering; Geography; Computer security; Engineering; Medicine","score_opus":0.009241002347274995,"score_gpt":0.22364390470501463,"score_spread":0.21440290235773965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226248605","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.98050755,0.00022233406,0.0004183412,0.001260304,0.00003499549,0.00008927834,0.00008408129,0.000027692082,0.017355504],"genre_scores_gemma":[0.9909859,0.00025014082,0.0004022938,0.00020759524,0.000017416001,0.000032862252,0.000039377504,0.000011637327,0.008052943],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99918455,0.0002777498,0.00001425088,0.000060791604,0.00011258939,0.00035008285],"domain_scores_gemma":[0.99805,0.000616687,0.00018074001,0.000097643366,0.000113053095,0.00094188994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089845277,0.00041926382,0.00024768515,0.0010552332,0.008666526,0.0015663137,0.0016975631,0.002750383,0.008606804],"category_scores_gemma":[0.0021822085,0.00021873036,0.00030707923,0.0010693102,0.0027957123,0.0012040845,0.0033105055,0.0018009507,0.0006564542],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005759608,0.0059025907,0.11133754,0.00055121974,0.000086677275,0.15041631,0.5572501,0.002191758,0.0050936723,0.020738937,0.017851464,0.12800373],"study_design_scores_gemma":[0.000120741606,0.0021086435,0.100629374,0.0003274487,0.000048045145,0.02368036,0.7835213,0.0016858221,0.002335453,0.0037535615,0.08171666,0.00007261342],"about_ca_topic_score_codex":0.031538878,"about_ca_topic_score_gemma":0.10136497,"teacher_disagreement_score":0.031538878,"about_ca_system_score_codex":0.003981776,"about_ca_system_score_gemma":0.0030259744,"threshold_uncertainty_score":0.06271058},"labels":[],"label_agreement":null},{"id":"W4226313671","doi":"10.1007/978-3-030-98682-7_12","title":"Engineering Features to Improve Pass Prediction in Soccer Simulation 2D Games","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Memorial University of Newfoundland; Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Aerospace engineering; Engineering","score_opus":0.01375504023573012,"score_gpt":0.20983683017606933,"score_spread":0.1960817899403392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226313671","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.5416923,0.0008052988,0.44484758,0.00039658707,0.0002386167,0.00009411642,0.0010492689,0.004348715,0.0065274728],"genre_scores_gemma":[0.9653478,0.00010360718,0.031228801,0.00005900072,0.000036677662,0.00003276565,0.000870372,0.0001316078,0.0021893121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998436,0.000021698239,0.000010474786,0.000041065592,0.000051377734,0.00003172129],"domain_scores_gemma":[0.9992692,0.00035775473,0.00006373366,0.000051501036,0.00021111636,0.000046788187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039514873,0.0007868407,0.00060581614,0.0007758729,0.00024038258,0.0007648297,0.0006089531,0.00064072054,0.0027049875],"category_scores_gemma":[0.002033793,0.00037741422,0.0004040331,0.0004650468,0.00014932365,0.0006266996,0.0005104403,0.0006633271,0.00082602503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010117387,0.00061135925,0.0138786845,0.00009799666,0.00007295882,0.00012068667,0.00004150421,0.59672445,0.0129244905,0.0008891442,0.004975466,0.3686516],"study_design_scores_gemma":[0.000007746178,0.00005667422,0.0020685156,0.000004271812,0.00000980964,0.0000107862115,0.0000072318294,0.99556726,0.0017839766,0.0002557007,0.00022404191,0.000003959233],"about_ca_topic_score_codex":0.0056903246,"about_ca_topic_score_gemma":0.006690477,"teacher_disagreement_score":0.0056903246,"about_ca_system_score_codex":0.000270115,"about_ca_system_score_gemma":0.00030057307,"threshold_uncertainty_score":0.011314452},"labels":[],"label_agreement":null},{"id":"W4226328072","doi":"10.1007/978-3-031-04083-2_1","title":"xxAI - Beyond Explainable Artificial Intelligence","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Bundesministerium für Bildung und Forschung; Austrian Science Fund; European Commission","keywords":"Computer science; Artificial intelligence; Generalization; Transparency (behavior); Field (mathematics); Machine learning; Artificial neural network; Reinforcement learning; Convolutional neural network; Big data; Data science; Data mining","score_opus":0.03385876189431535,"score_gpt":0.2695380502781973,"score_spread":0.23567928838388197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226328072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008767359,0.07053788,0.40678582,0.14414257,0.013273783,0.00020206676,0.0014302563,0.0023454535,0.35251486],"genre_scores_gemma":[0.46565565,0.064079,0.22918208,0.026183844,0.015026312,0.00072487537,0.0033811177,0.0021856185,0.19358142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786264,0.001119244,0.000101792786,0.0003290458,0.00047084445,0.000116421084],"domain_scores_gemma":[0.9933468,0.0044336966,0.00026135182,0.0010343675,0.0006734964,0.0002502771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003104023,0.00087977,0.0006773469,0.0015264497,0.001480439,0.0063195997,0.0016928423,0.0025446415,0.024986248],"category_scores_gemma":[0.010597204,0.00047185912,0.0013645575,0.0013681138,0.0070111617,0.009858715,0.003717247,0.0067700753,0.0043004677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142592335,0.00001520072,0.00017166775,0.00020236569,0.000019824303,0.000058873866,0.00036518104,0.0018229067,0.00023536925,0.94801337,0.025907082,0.02317385],"study_design_scores_gemma":[0.0000051241327,0.00001000438,0.00011102682,0.00021864571,0.0000080664995,0.00005598251,0.00011233245,0.0043621124,0.00029178898,0.8552996,0.1395118,0.00001357626],"about_ca_topic_score_codex":0.0017739428,"about_ca_topic_score_gemma":0.0013139979,"teacher_disagreement_score":0.024986248,"about_ca_system_score_codex":0.0029833706,"about_ca_system_score_gemma":0.0019780667,"threshold_uncertainty_score":0.08358729},"labels":[],"label_agreement":null},{"id":"W4226337630","doi":"10.1007/978-3-030-98253-9_22","title":"Segmentation and Risk Score Prediction of Head and Neck Cancers in PET/CT Volumes with 3D U-Net and Cox Proportional Hazard Neural Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Segmentation; Convolutional neural network; Computer science; Artificial intelligence; Proportional hazards model; Artificial neural network; Pattern recognition (psychology); Deep learning; Statistics; Mathematics","score_opus":0.008779037312565059,"score_gpt":0.24823082437210467,"score_spread":0.23945178705953962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226337630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12807004,0.005576861,0.85757375,0.00080134126,0.00025642663,0.00011392881,0.0012762422,0.0021484715,0.0041829213],"genre_scores_gemma":[0.6364356,0.0030830048,0.34419104,0.00020745724,0.00019738945,0.00014489397,0.0018826074,0.0004142603,0.013443662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997949,0.00005062863,0.000015506099,0.000059290243,0.0000583604,0.000021267964],"domain_scores_gemma":[0.9995945,0.00025876344,0.00003379448,0.000028728798,0.000070456925,0.0000137378765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010550453,0.00059850473,0.00059799355,0.0009272281,0.00021328698,0.0010690122,0.00088700844,0.0007192841,0.0015589775],"category_scores_gemma":[0.0018498721,0.00051984,0.0010628692,0.00070397946,0.0002508075,0.00061586354,0.0005217049,0.0006327037,0.0005802891],"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.00043656694,0.000088783825,0.013928141,0.00014494563,0.00016392101,0.00017310637,0.000074048075,0.299716,0.005965641,0.0040219068,0.0053707077,0.6699162],"study_design_scores_gemma":[0.0000045303495,0.000034320616,0.0025618495,0.000014605261,0.0000275521,0.00009637773,0.00001102933,0.99061906,0.002496983,0.0033273902,0.0007931298,0.000013172614],"about_ca_topic_score_codex":0.0077647744,"about_ca_topic_score_gemma":0.009667993,"teacher_disagreement_score":0.0077647744,"about_ca_system_score_codex":0.00073590165,"about_ca_system_score_gemma":0.0005669251,"threshold_uncertainty_score":0.015439153},"labels":[],"label_agreement":null},{"id":"W4226424099","doi":"10.1007/978-3-030-99253-8_5","title":"Separators in Continuous Petri Nets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.018722145016363868,"score_gpt":0.252299790098892,"score_spread":0.2335776450825281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226424099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0554691,0.0022897886,0.8909818,0.001827028,0.00052700716,0.00015140418,0.0004297924,0.0034137722,0.04491024],"genre_scores_gemma":[0.7621433,0.0016974895,0.19029425,0.0007646505,0.00051663676,0.0004088395,0.0009277201,0.0007726469,0.04247449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969463,0.0007657988,0.0003510994,0.0007723904,0.00082950713,0.00033489108],"domain_scores_gemma":[0.9925821,0.004848002,0.00082034955,0.00065165764,0.00067682366,0.00042106493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030390788,0.0010047939,0.0008939757,0.0019482761,0.0013627439,0.0029215394,0.0010499486,0.001231227,0.0091566825],"category_scores_gemma":[0.0070704506,0.00073087384,0.0018900188,0.001218462,0.003722347,0.0055888095,0.003368413,0.0037302491,0.0016515566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002533197,0.000058116188,0.0003813351,0.00027201272,0.000050774805,0.00041966347,0.0006843896,0.028414585,0.004593292,0.9320464,0.0019632867,0.03086283],"study_design_scores_gemma":[0.000094121126,0.00009390246,0.00015575493,0.00011134064,0.000052925618,0.00009707515,0.00010677188,0.086340025,0.006902382,0.87787974,0.02811846,0.000047488393],"about_ca_topic_score_codex":0.0021192026,"about_ca_topic_score_gemma":0.0015543965,"teacher_disagreement_score":0.0091566825,"about_ca_system_score_codex":0.0026953558,"about_ca_system_score_gemma":0.0020427988,"threshold_uncertainty_score":0.030632138},"labels":[],"label_agreement":null},{"id":"W4226474270","doi":"10.1007/978-3-030-96731-4_18","title":"Machine Learning Advised Ski Rental Problem with a Discount","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Oracle; Online machine learning; Online algorithm; Context (archaeology); Online learning; Renting; Algorithm; Active learning (machine learning)","score_opus":0.011572906254450168,"score_gpt":0.23349785847203353,"score_spread":0.22192495221758335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226474270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.162451,0.0016783339,0.7353271,0.009070391,0.0009066798,0.0003511791,0.0026194549,0.0013309402,0.086264856],"genre_scores_gemma":[0.784809,0.0006765988,0.103860274,0.0004809275,0.0005082958,0.00018221719,0.0015758316,0.00043656686,0.10747032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991467,0.00023162163,0.000049986276,0.0002497429,0.00014530968,0.00017655495],"domain_scores_gemma":[0.9978167,0.0013401669,0.00010920717,0.00033007283,0.00016879772,0.00023512542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016607945,0.0007659467,0.0023924285,0.0006436694,0.00091496314,0.002306298,0.0026373875,0.0035271219,0.02527562],"category_scores_gemma":[0.0069791954,0.00064604107,0.0010951859,0.001075469,0.0016604933,0.005479483,0.0020328872,0.0035027943,0.0024601303],"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.00096578366,0.00047838583,0.0017308308,0.00041259892,0.00010952757,0.00045311154,0.00020339018,0.3304978,0.001121851,0.46310386,0.06849841,0.13242447],"study_design_scores_gemma":[0.00008399258,0.00006365502,0.00025318467,0.00004379454,0.000023812107,0.000093503215,0.000058835343,0.73658824,0.00049398665,0.2558825,0.00639212,0.000022427463],"about_ca_topic_score_codex":0.0039087,"about_ca_topic_score_gemma":0.0040118992,"teacher_disagreement_score":0.02527562,"about_ca_system_score_codex":0.0016148445,"about_ca_system_score_gemma":0.0018455576,"threshold_uncertainty_score":0.08455539},"labels":[],"label_agreement":null},{"id":"W4226475036","doi":"10.1007/978-3-030-99372-6_8","title":"A Hybrid Synchronization Mechanism for Parallel Sparse Triangular Solve","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Synchronization (alternating current); sync; Data synchronization; Set (abstract data type); Parallel computing; Sparse matrix; Algorithm; Theoretical computer science; Wireless sensor network","score_opus":0.015603290893889043,"score_gpt":0.23415461465705276,"score_spread":0.21855132376316372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226475036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01185306,0.00016678192,0.97533685,0.000106561405,0.00017579463,0.000086140906,0.00013605517,0.00565198,0.006486813],"genre_scores_gemma":[0.3288097,0.00023825587,0.64564836,0.0003261812,0.00026172918,0.00051237753,0.0006969458,0.0015277583,0.02197877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917966,0.00014881755,0.00006183243,0.00016486508,0.0003318177,0.00011303284],"domain_scores_gemma":[0.99853694,0.0003184178,0.00009732221,0.0007003698,0.00026320913,0.000083682025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000834854,0.00076239055,0.0009701623,0.0009706458,0.0010096229,0.0013844663,0.0033986773,0.00092409016,0.015924944],"category_scores_gemma":[0.002262343,0.0006931429,0.0005413804,0.0019415619,0.0007634203,0.0022135528,0.003313558,0.0012815173,0.0032343655],"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.0027741306,0.00048036716,0.001107761,0.00042059665,0.00022749939,0.000323196,0.00048232087,0.0903119,0.10930677,0.18879241,0.03776753,0.56800544],"study_design_scores_gemma":[0.00036436698,0.0003485665,0.0003553114,0.00003492225,0.00007807102,0.00022095063,0.00008873399,0.8590968,0.048342124,0.064439304,0.026558435,0.00007239288],"about_ca_topic_score_codex":0.0013367726,"about_ca_topic_score_gemma":0.0019692904,"teacher_disagreement_score":0.015924944,"about_ca_system_score_codex":0.0006140837,"about_ca_system_score_gemma":0.00084002526,"threshold_uncertainty_score":0.053274214},"labels":[],"label_agreement":null},{"id":"W4229045235","doi":"10.1007/978-3-031-15839-1_5","title":"Robustly Complete Finite-State Abstractions for Verification of Stochastic Systems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Soundness; Probabilistic logic; State space; Markov chain; Computer science; Nonlinear system; Mathematics; Theoretical computer science","score_opus":0.05683049799423852,"score_gpt":0.28891691553133997,"score_spread":0.23208641753710146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229045235","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.0038732046,0.00013666901,0.99310666,0.000060631814,0.00002432749,0.00004392646,0.00010359224,0.0013197818,0.0013312249],"genre_scores_gemma":[0.44085497,0.00061320694,0.54957354,0.0001687285,0.00011301794,0.0004619219,0.0009104525,0.0009505867,0.0063535376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947596,0.0013963813,0.0003718937,0.00065436534,0.0024639405,0.0003537899],"domain_scores_gemma":[0.99162745,0.0045447177,0.00054900046,0.0025225568,0.0006362598,0.000120126366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003917824,0.0014465579,0.0014935277,0.00082957733,0.00056808215,0.002368134,0.002510791,0.0012360746,0.004108183],"category_scores_gemma":[0.01053764,0.0013129021,0.0027400427,0.0006213182,0.0024311845,0.0036178022,0.003243214,0.0045563276,0.0011836332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038395083,0.000096846525,0.00025579103,0.0005965437,0.00019399151,0.00023305391,0.0003802163,0.44847095,0.026096912,0.43767068,0.0021830811,0.08343792],"study_design_scores_gemma":[0.00005848668,0.00009537736,0.000102882026,0.000076875614,0.000060421098,0.00006108716,0.000029090366,0.6658224,0.02228425,0.3041137,0.007261538,0.000033913337],"about_ca_topic_score_codex":0.0012561872,"about_ca_topic_score_gemma":0.0016422895,"teacher_disagreement_score":0.004108183,"about_ca_system_score_codex":0.0015004298,"about_ca_system_score_gemma":0.0023066688,"threshold_uncertainty_score":0.020719707},"labels":[],"label_agreement":null},{"id":"W4229734559","doi":"10.1007/978-3-319-20233-4","title":"Big Data Benchmarking","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmarking; Computer science; Big data; Data science; Data mining; Management","score_opus":0.13296650882791783,"score_gpt":0.2999898996181478,"score_spread":0.16702339079023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229734559","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.014254919,0.0179035,0.2863154,0.018985664,0.01034048,0.00073915964,0.019407474,0.025632104,0.6064212],"genre_scores_gemma":[0.26076397,0.0146067375,0.2492661,0.0068684057,0.004971335,0.0012348938,0.06922149,0.013550412,0.37951663],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501485,0.0011643616,0.0003012583,0.000662164,0.0024237959,0.00043361713],"domain_scores_gemma":[0.9921185,0.0015673807,0.0003432937,0.0031002767,0.0023253607,0.0005450701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076337736,0.0016583445,0.001502116,0.004858351,0.0012408745,0.0054633203,0.0025195458,0.001437522,0.056653675],"category_scores_gemma":[0.01690281,0.0008010417,0.0009855311,0.007414333,0.0009081171,0.0076685343,0.003822778,0.00209658,0.020351764],"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.00019822553,0.00011126398,0.0014880144,0.0003236721,0.000080463156,0.00006502919,0.00010130353,0.00695144,0.0008797522,0.08869214,0.4660583,0.43505028],"study_design_scores_gemma":[0.00005456309,0.00014300241,0.004457032,0.0005786795,0.00006323806,0.000335293,0.0002554241,0.031762,0.0055984007,0.24484701,0.7118291,0.00007626854],"about_ca_topic_score_codex":0.002333852,"about_ca_topic_score_gemma":0.002510181,"teacher_disagreement_score":0.056653675,"about_ca_system_score_codex":0.0016051128,"about_ca_system_score_gemma":0.0024125378,"threshold_uncertainty_score":0.18952543},"labels":[],"label_agreement":null},{"id":"W4229753534","doi":"10.1007/978-3-540-76292-8_26","title":"Preface to RIGiM 2007","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Requirements engineering; Computer science; Requirements analysis; Interactivity; Domain (mathematical analysis); Conceptual model; Systems engineering; Management science; Software engineering; Engineering; Knowledge management; World Wide Web","score_opus":0.027373503957533088,"score_gpt":0.25397191521500706,"score_spread":0.226598411257474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229753534","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011319781,0.023350256,0.01366736,0.032338846,0.2309228,0.00029932283,0.005646187,0.0028198077,0.68982345],"genre_scores_gemma":[0.0046620974,0.006892917,0.0033703547,0.0040780804,0.024647906,0.00010091151,0.003588836,0.0015895069,0.9510694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930143,0.00010995669,0.000034519977,0.00012240309,0.00037303483,0.000058629023],"domain_scores_gemma":[0.99743503,0.0003490209,0.000083300496,0.00023126828,0.0015500713,0.00035134223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606957,0.001039881,0.0008493432,0.002828952,0.0011814215,0.0038892194,0.0012317243,0.0011136115,0.2866177],"category_scores_gemma":[0.0060747718,0.00028629342,0.00055345346,0.0023146428,0.00046191,0.0020322187,0.0016847975,0.0020792314,0.22554739],"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.000014225022,0.000014025614,0.00002392947,0.000053045263,0.0000014183049,0.000012257661,0.000012969458,0.000087323,0.000073725176,0.002149689,0.96104443,0.03651294],"study_design_scores_gemma":[0.0000038412527,0.000013071829,0.00017026562,0.00010300928,0.000002481055,0.000026618813,0.000022981452,0.00010530495,0.00009896277,0.0020255954,0.9974221,0.0000058346877],"about_ca_topic_score_codex":0.004091587,"about_ca_topic_score_gemma":0.0059376624,"teacher_disagreement_score":0.2866177,"about_ca_system_score_codex":0.0021799703,"about_ca_system_score_gemma":0.0016279272,"threshold_uncertainty_score":0.9588317},"labels":[],"label_agreement":null},{"id":"W4229875031","doi":"10.1007/978-3-030-51831-8","title":"Application and Theory of Petri Nets and Concurrency","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Concurrency; Petri net; Computer science; Programming language; Semantics (computer science); Field (mathematics); Process architecture; Concurrent computing; Theoretical computer science","score_opus":0.013241371630474697,"score_gpt":0.220266206692041,"score_spread":0.2070248350615663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229875031","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.004921532,0.020558387,0.8760204,0.0032782909,0.0017106092,0.00007390377,0.00017793805,0.0003419206,0.09291707],"genre_scores_gemma":[0.4247459,0.034718126,0.47711706,0.0014526966,0.0032880988,0.00063946855,0.00047988165,0.0003377062,0.05722111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854785,0.00051626546,0.000098518016,0.0002059473,0.0005239665,0.00010734697],"domain_scores_gemma":[0.9972046,0.0021536637,0.000111352114,0.00024308877,0.00020454965,0.00008260345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016118529,0.0011535832,0.0011158622,0.0019218241,0.0010861823,0.0036504276,0.0017240996,0.0014237562,0.008114904],"category_scores_gemma":[0.0052119363,0.00091611507,0.0016186236,0.0021393623,0.005197397,0.0054975143,0.0020029577,0.004225275,0.0010414583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049215755,0.0000065142294,0.00004880052,0.00005072917,0.00000813245,0.000028352519,0.00006163841,0.0056909663,0.00010895604,0.98614097,0.0010927431,0.0067573134],"study_design_scores_gemma":[0.0000044611115,0.0000036318004,0.000023929366,0.000025595993,0.000005695312,0.00003460625,0.00001633077,0.010098939,0.0000848487,0.9815524,0.008144909,0.000004597449],"about_ca_topic_score_codex":0.0043366402,"about_ca_topic_score_gemma":0.002323661,"teacher_disagreement_score":0.008114904,"about_ca_system_score_codex":0.002659125,"about_ca_system_score_gemma":0.0023383207,"threshold_uncertainty_score":0.027147055},"labels":[],"label_agreement":null},{"id":"W4230195253","doi":"10.1007/3-540-44843-8_92","title":"Preconditionning Techniques for the Solution of the Helmholtz Equation by the Finite Element Method","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical methods in engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Helmholtz equation; Generalized minimal residual method; Krylov subspace; Discretization; Finite element method; Galerkin method; Applied mathematics; Convergence (economics); Computer science; Discontinuous Galerkin method; Mathematics; Boundary value problem; Mathematical analysis; Algorithm; Iterative method; Physics","score_opus":0.02596006498315092,"score_gpt":0.28261579499668515,"score_spread":0.25665573001353426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230195253","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.0013322871,0.0003634391,0.99603504,0.00005948333,0.00007181556,0.000018043247,0.000031678395,0.00023699937,0.0018511278],"genre_scores_gemma":[0.039324626,0.001425128,0.9511507,0.00007728729,0.00010905202,0.00017371705,0.00021509187,0.00036886035,0.0071555385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994479,0.00017453799,0.000027944456,0.00004462655,0.00026887574,0.000036063488],"domain_scores_gemma":[0.99936,0.0003597217,0.0000274277,0.00010070135,0.00012604691,0.000026092244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006509583,0.0007603104,0.0009136856,0.0005287124,0.0005734584,0.000782417,0.0010694473,0.0009786562,0.004830563],"category_scores_gemma":[0.0022248523,0.0005438759,0.00080440973,0.00070670486,0.00082887645,0.0012495304,0.0014505727,0.0030952487,0.0022120073],"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.00022443033,0.00015377457,0.00029629268,0.00067884254,0.00006886091,0.00019984064,0.0004403991,0.1991538,0.049015447,0.2879718,0.0154241305,0.44637242],"study_design_scores_gemma":[0.000058258534,0.000057656394,0.00021126977,0.00006845796,0.000024733677,0.00014285388,0.000044553537,0.8310722,0.014437949,0.118538365,0.035311848,0.00003177018],"about_ca_topic_score_codex":0.0015906547,"about_ca_topic_score_gemma":0.0022236335,"teacher_disagreement_score":0.004830563,"about_ca_system_score_codex":0.00032546563,"about_ca_system_score_gemma":0.0007605872,"threshold_uncertainty_score":0.016159892},"labels":[],"label_agreement":null},{"id":"W4230201191","doi":"10.1007/978-3-030-60365-6","title":"Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, and Graphs in Biomedical Image Analysis","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":40,"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":"Computer science; Medical imaging; Artificial intelligence; Image (mathematics); Machine learning; Computer vision","score_opus":0.05262950808515613,"score_gpt":0.3868612186109675,"score_spread":0.33423171052581135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230201191","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.004295102,0.0038817613,0.9836188,0.0013129795,0.00023770417,0.000019502904,0.000105680556,0.00025060275,0.006277853],"genre_scores_gemma":[0.41416803,0.00932306,0.5532047,0.0009076371,0.0014641566,0.0001904028,0.0005056538,0.00064539415,0.019590875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862146,0.00033880133,0.00008438967,0.00018145247,0.00069908914,0.00007488321],"domain_scores_gemma":[0.99509037,0.0037283157,0.00027645213,0.00040600044,0.00040593348,0.00009301648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013210627,0.00068353687,0.0009650895,0.0012586328,0.0006095425,0.001899766,0.0010190211,0.0012079172,0.0031527816],"category_scores_gemma":[0.008551585,0.00054231624,0.0010221209,0.0011574351,0.0019676238,0.003581718,0.0019243924,0.002562952,0.00058087485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011677812,0.00003693534,0.0004175151,0.00040124933,0.00006235477,0.00015302822,0.0001712861,0.16944401,0.0043727653,0.5665384,0.010857901,0.24742776],"study_design_scores_gemma":[0.000004927692,0.000024421182,0.00019238668,0.00006670095,0.000017561659,0.00011257027,0.000024795423,0.33379182,0.0020018676,0.6559076,0.007836071,0.000019266236],"about_ca_topic_score_codex":0.0016504225,"about_ca_topic_score_gemma":0.0011650005,"teacher_disagreement_score":0.0031527816,"about_ca_system_score_codex":0.0011694568,"about_ca_system_score_gemma":0.0009312921,"threshold_uncertainty_score":0.0105471015},"labels":[],"label_agreement":null},{"id":"W4230219052","doi":"10.1007/978-3-642-38986-3","title":"Reversible Computation","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.016879001587677477,"score_gpt":0.24909641908318278,"score_spread":0.2322174174955053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230219052","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036201107,0.006742893,0.0733566,0.0011389005,0.00094937667,0.00007456029,0.00038169787,0.0007840384,0.9129519],"genre_scores_gemma":[0.20076299,0.015505796,0.042388793,0.00084883923,0.0012634821,0.0002719375,0.0011600587,0.000981521,0.7368166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.000031416424,0.000008465896,0.000054532185,0.000118820164,0.000027405498],"domain_scores_gemma":[0.99985063,0.000043798023,0.000008112815,0.000059596223,0.000026989874,0.000010894791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017163699,0.00065120833,0.00053452625,0.00084455626,0.0008629029,0.0017130873,0.00080556603,0.00053850916,0.053747587],"category_scores_gemma":[0.0007036552,0.0003607465,0.00055057806,0.0011656783,0.0016226496,0.0022509594,0.0010465637,0.0014829506,0.013433063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015707104,0.000011137538,0.00002417117,0.00012529206,0.000008466022,0.00002366589,0.00004261807,0.0015268233,0.0011934662,0.8951984,0.025406957,0.07642331],"study_design_scores_gemma":[0.0000119515835,0.00001580963,0.0000790931,0.000066277076,0.0000115723215,0.00010466798,0.000022369932,0.0032120077,0.0033329448,0.6765354,0.3165932,0.000014571614],"about_ca_topic_score_codex":0.0006382646,"about_ca_topic_score_gemma":0.0009783328,"teacher_disagreement_score":0.053747587,"about_ca_system_score_codex":0.0011226048,"about_ca_system_score_gemma":0.00084837456,"threshold_uncertainty_score":0.17980361},"labels":[],"label_agreement":null},{"id":"W4230231196","doi":"10.1007/978-3-642-21822-4_7","title":"Basic Object Oriented Genetic Programming","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Computer science; Genetic programming; Object (grammar); Object-oriented programming; Theoretical computer science; Programming language; Linear programming; Artificial intelligence; Algorithm","score_opus":0.01606424199300017,"score_gpt":0.23396050537295532,"score_spread":0.21789626337995516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230231196","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.0027411676,0.0012923247,0.87971586,0.00025505596,0.0002215897,0.00011270077,0.00020668046,0.0016909542,0.11376371],"genre_scores_gemma":[0.05213085,0.0034975177,0.8393544,0.00042012866,0.00013976615,0.0003717286,0.0009754632,0.0007462648,0.1023638],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998097,0.000021073649,0.000010878656,0.000034119406,0.00010656607,0.000017731089],"domain_scores_gemma":[0.9999118,0.000028093227,0.000005607399,0.000024065946,0.000023377535,0.0000070487386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025262567,0.00055376027,0.00044273853,0.00049261533,0.0003474917,0.0013060414,0.0012574239,0.00088918355,0.011009972],"category_scores_gemma":[0.00047292205,0.00031641638,0.0005941024,0.0010100006,0.00058937166,0.00085237337,0.0006263147,0.0011776183,0.0050276695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027770602,0.000071924514,0.00019083061,0.00034738937,0.000030331308,0.00012305731,0.00020544614,0.016626934,0.008921353,0.44157416,0.013684992,0.51819575],"study_design_scores_gemma":[0.000043462995,0.000074485055,0.00044901093,0.00028414707,0.000047637397,0.0006126282,0.00004928691,0.065979205,0.008795859,0.47825631,0.44536436,0.000043690816],"about_ca_topic_score_codex":0.0005204607,"about_ca_topic_score_gemma":0.0005587555,"teacher_disagreement_score":0.011009972,"about_ca_system_score_codex":0.00029508173,"about_ca_system_score_gemma":0.00047972327,"threshold_uncertainty_score":0.036831975},"labels":[],"label_agreement":null},{"id":"W4230438007","doi":"10.1007/978-3-540-78195-0_6","title":"Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Programming language; Object-oriented programming; Object (grammar); Software engineering; Artificial intelligence","score_opus":0.015878736008292423,"score_gpt":0.27369590291390583,"score_spread":0.2578171669056134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230438007","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013935075,0.00690341,0.9389041,0.0007052062,0.00040198956,0.00013172741,0.00015718375,0.0067534395,0.03210792],"genre_scores_gemma":[0.12825118,0.0076185833,0.81446713,0.0003547272,0.0003264732,0.00029324487,0.0007348233,0.0034549579,0.044498924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991173,0.00017142906,0.000065355816,0.00008924796,0.00047010084,0.00008647479],"domain_scores_gemma":[0.99933237,0.00023912589,0.000052572388,0.00022606456,0.00012283582,0.000027027487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828658,0.00071058504,0.00064650393,0.000597777,0.0005340172,0.0028033508,0.0014621259,0.0007314884,0.0036461689],"category_scores_gemma":[0.0024186992,0.00082329666,0.00060834375,0.0012662002,0.0010875044,0.0019497891,0.0009185773,0.0015417689,0.00173794],"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.0001598107,0.00021385506,0.0007406237,0.0007908847,0.000063036336,0.00013110039,0.00033395612,0.033860087,0.015975324,0.30323908,0.02473853,0.6197537],"study_design_scores_gemma":[0.00012098164,0.00021816762,0.002064967,0.00032228083,0.00017693998,0.0008231585,0.00016581449,0.17529929,0.042731397,0.41622368,0.36176997,0.00008328693],"about_ca_topic_score_codex":0.0013795091,"about_ca_topic_score_gemma":0.0017990523,"teacher_disagreement_score":0.0036461689,"about_ca_system_score_codex":0.0006295888,"about_ca_system_score_gemma":0.0012602948,"threshold_uncertainty_score":0.012197614},"labels":[],"label_agreement":null},{"id":"W4230442289","doi":"10.1007/978-3-642-22321-1_10","title":"Theory of Átomata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic finite automaton; Deterministic automaton; Büchi automaton; Computer science; Deterministic finite automaton; Two-way deterministic finite automaton; Automaton; Nondeterministic algorithm; Finite-state machine; Regular language; Regular expression; Quotient; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Programming language; Automata theory","score_opus":0.020207786188411674,"score_gpt":0.22664638615806523,"score_spread":0.20643859996965355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230442289","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009796644,0.010257561,0.34330788,0.005507989,0.0016986327,0.000117817195,0.0018078402,0.0016523784,0.62585324],"genre_scores_gemma":[0.4835736,0.011170522,0.21116814,0.0030370934,0.0024890047,0.00067968486,0.0039533777,0.00137306,0.2825555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892116,0.00030538772,0.00007801804,0.0002495275,0.0003195724,0.00012640074],"domain_scores_gemma":[0.9992693,0.00028171827,0.00003985955,0.00019508509,0.00017232493,0.00004163627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095703494,0.0008778354,0.00093665806,0.0021304768,0.0026827203,0.005932326,0.0018786873,0.0015673029,0.025853883],"category_scores_gemma":[0.0022886079,0.0010866346,0.0015312546,0.0025453412,0.005289519,0.010772305,0.0027383051,0.0041546947,0.008657873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003601786,0.0000025830066,0.000023325454,0.000023871204,0.0000022315403,0.000008340482,0.00007981753,0.00008820161,0.00006571707,0.99297225,0.002960084,0.0037698962],"study_design_scores_gemma":[0.0000042844194,0.0000023385778,0.000029146808,0.000016824086,0.0000046340288,0.000036674184,0.000028719456,0.00041690157,0.00012841068,0.96534747,0.03398073,0.0000038277676],"about_ca_topic_score_codex":0.0019214848,"about_ca_topic_score_gemma":0.0016114317,"teacher_disagreement_score":0.025853883,"about_ca_system_score_codex":0.0027724404,"about_ca_system_score_gemma":0.0012982498,"threshold_uncertainty_score":0.0864898},"labels":[],"label_agreement":null},{"id":"W4230462025","doi":"10.1007/978-3-319-14127-5_13","title":"Automatic Optimization of Depth Electrode Trajectory Planning","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Trajectory; Electrode; Computer science; Trajectory optimization; Physics","score_opus":0.009838093480714198,"score_gpt":0.21181698941193433,"score_spread":0.20197889593122012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230462025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039415355,0.00025481067,0.9913133,0.000051171846,0.00003323334,0.000015627249,0.00006333056,0.0004966462,0.0038303141],"genre_scores_gemma":[0.38754892,0.00054961286,0.59969527,0.00006419638,0.000063316635,0.00012233383,0.00033532342,0.00040874656,0.011212249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998004,0.00003538346,0.000008585423,0.000043924614,0.00008637742,0.000025370102],"domain_scores_gemma":[0.9997353,0.00015424436,0.000020075178,0.00003215343,0.0000466607,0.00001151177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026375786,0.00080765603,0.00070430426,0.00040284605,0.0002563457,0.0006623978,0.0008504421,0.00068999646,0.0049907207],"category_scores_gemma":[0.0009673914,0.0006231988,0.00050024287,0.00062577985,0.00035256497,0.0005912906,0.00085802254,0.0006891595,0.0009265349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000926274,0.000017017212,0.0001497964,0.00008760407,0.000018973247,0.00004670867,0.00003290505,0.8077759,0.007418961,0.005945615,0.00249316,0.17592071],"study_design_scores_gemma":[0.0000056621548,0.000018173476,0.000081799175,0.0000066351454,0.0000038183803,0.000033230855,0.0000054815932,0.99367636,0.0019290757,0.0029925217,0.0012425247,0.000004693693],"about_ca_topic_score_codex":0.0037740273,"about_ca_topic_score_gemma":0.0058168317,"teacher_disagreement_score":0.0049907207,"about_ca_system_score_codex":0.0005014383,"about_ca_system_score_gemma":0.0007512766,"threshold_uncertainty_score":0.016695619},"labels":[],"label_agreement":null},{"id":"W4230517044","doi":"10.1007/978-3-030-11072-7_4","title":"Gathering","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Robot; Focus (optics); Visibility; Convergence (economics); Point (geometry); Plane (geometry); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Geometry; Physics","score_opus":0.021054986344928115,"score_gpt":0.25062823023311026,"score_spread":0.22957324388818215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230517044","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005579589,0.0006849333,0.057837483,0.0015446269,0.001121017,0.00140858,0.014207606,0.0079189455,0.9096972],"genre_scores_gemma":[0.034724906,0.0012493823,0.040388647,0.0010083552,0.00046155235,0.00087378087,0.028410548,0.0026536945,0.89022917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913365,0.00012324903,0.000041638483,0.00021537386,0.0003357747,0.00015029826],"domain_scores_gemma":[0.9984945,0.00021634717,0.00006644824,0.0005902902,0.00048008625,0.00015243802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007842948,0.0014526643,0.00078181224,0.0036763984,0.0023831315,0.0028077385,0.0014192023,0.0008822284,0.38019824],"category_scores_gemma":[0.0031196347,0.00057734974,0.0008881909,0.002999883,0.0005136994,0.0030152146,0.004141698,0.0015525543,0.22391464],"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.00031009136,0.00016126712,0.00056636793,0.0005828192,0.000021453634,0.0002151185,0.00059408846,0.0009223096,0.006476905,0.057627834,0.58476764,0.34775403],"study_design_scores_gemma":[0.000024629511,0.000072895535,0.00056152424,0.00014012083,0.000018845565,0.00019849732,0.00029875257,0.0009873216,0.0035181537,0.01732588,0.9768346,0.000018668206],"about_ca_topic_score_codex":0.0017585058,"about_ca_topic_score_gemma":0.0032360905,"teacher_disagreement_score":0.38019824,"about_ca_system_score_codex":0.0007569805,"about_ca_system_score_gemma":0.0014993673,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4230556844","doi":"10.1007/978-3-642-03761-0_14","title":"University of Waterloo at INEX 2008: Adhoc, Book, and Link-the-Wiki Tracks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Task (project management); PageRank; Context (archaeology); Track (disk drive); Information retrieval; Link (geometry); World Wide Web; Computer network; Operating system","score_opus":0.01151207044429106,"score_gpt":0.20230034885294138,"score_spread":0.1907882784086503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230556844","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.0045595476,0.0618149,0.04069577,0.020462431,0.015029958,0.00017411984,0.022835176,0.010320226,0.82410777],"genre_scores_gemma":[0.0061659757,0.016128903,0.01754181,0.00083860825,0.0013740555,0.00007591212,0.008830007,0.0023422474,0.94670254],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880433,0.00007064866,0.000052378506,0.00012984914,0.000865445,0.000077320765],"domain_scores_gemma":[0.998086,0.00024126016,0.000082025166,0.00017448093,0.0009957284,0.0004206107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012462331,0.0008136802,0.0010019104,0.0038230068,0.0019043747,0.0056744693,0.0009790219,0.000822972,0.11163225],"category_scores_gemma":[0.003824596,0.00076449633,0.00032294073,0.009494485,0.0006948509,0.0054925424,0.0015317671,0.0013539109,0.05545204],"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.000010538262,0.000025064786,0.00015774737,0.000098664015,0.000002118209,0.000015130215,0.00006136,0.0001482988,0.00018333846,0.0054038684,0.80546445,0.18842943],"study_design_scores_gemma":[0.0000018785671,0.0000055560354,0.00040482782,0.000077871606,0.0000019570703,0.000052831456,0.000047100628,0.00021661371,0.00024040604,0.0015242278,0.9974191,0.000007554024],"about_ca_topic_score_codex":0.053659372,"about_ca_topic_score_gemma":0.12698701,"teacher_disagreement_score":0.11163225,"about_ca_system_score_codex":0.003639583,"about_ca_system_score_gemma":0.008051028,"threshold_uncertainty_score":0.37344712},"labels":[],"label_agreement":null},{"id":"W4230925513","doi":"10.1007/978-3-642-24606-7_26","title":"System Identification for Adaptive Software Systems: A Requirements Engineering Perspective","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Toronto","funders":"","keywords":"Computer science; Identification (biology); Perspective (graphical); Process (computing); Software system; Requirements engineering; Software; Control system; Software requirements; System identification; Control engineering; Software engineering; Artificial intelligence; Software construction; Data modeling; Engineering; Programming language","score_opus":0.0595757578511155,"score_gpt":0.28340568561130286,"score_spread":0.22382992776018737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230925513","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.0020171152,0.0011121246,0.9894666,0.000701218,0.000031473963,0.00005316109,0.000020014713,0.000193698,0.006404528],"genre_scores_gemma":[0.22137855,0.0062458296,0.7603717,0.0005475709,0.00037967236,0.00043291703,0.00020440693,0.0001936776,0.010245711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971042,0.0011305078,0.00019721864,0.00025341884,0.0011658634,0.00014881395],"domain_scores_gemma":[0.9940555,0.004757614,0.0002261246,0.0004469358,0.00046398374,0.00004992755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030548933,0.0012042095,0.0013096137,0.0010885368,0.0004524273,0.002369288,0.0019106196,0.002228151,0.0031887752],"category_scores_gemma":[0.007194292,0.0011686182,0.0012247633,0.00087897875,0.0021261799,0.0030311518,0.0014123631,0.0026774346,0.0011369209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007575302,0.00012757852,0.00057962147,0.0014644802,0.00011900837,0.00070396945,0.0007554226,0.18436721,0.013109572,0.6195633,0.0032747912,0.17585938],"study_design_scores_gemma":[0.0000360774,0.00019088657,0.0004878352,0.0004874169,0.0000773279,0.0006750062,0.00035470023,0.50986296,0.00886929,0.449663,0.029231025,0.000064418105],"about_ca_topic_score_codex":0.0013644873,"about_ca_topic_score_gemma":0.0009651617,"teacher_disagreement_score":0.0031887752,"about_ca_system_score_codex":0.0009236675,"about_ca_system_score_gemma":0.001078431,"threshold_uncertainty_score":0.016155958},"labels":[],"label_agreement":null},{"id":"W4231059779","doi":"10.1007/978-3-319-10602-1","title":"Computer Vision – ECCV 2014","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":233,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simon Fraser University; Lunds Universitet; Technische Universität Dresden; University of Toronto; Albert-Ludwigs-Universität Freiburg; Carnegie Mellon University; Institute of Science and Technology Austria; University College London; Imperial College London; Drexel University; Technische Universität Darmstadt; Tel Aviv University; Seoul National University; University of South Florida; California Institute of Technology; RWTH Aachen University; State University of New York; Microsoft Research; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Massachusetts Institute of Technology","keywords":"Computer science; Volume (thermodynamics); Computer graphics (images); Set (abstract data type); Computer vision; Artificial intelligence; Programming language","score_opus":0.009582690174665225,"score_gpt":0.22831043900542425,"score_spread":0.21872774883075902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231059779","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046081324,0.06535157,0.63504237,0.004326851,0.019958429,0.00028772166,0.0041479263,0.019650642,0.24662644],"genre_scores_gemma":[0.031893723,0.042062342,0.16992888,0.0010628339,0.0036289115,0.0003850438,0.012442276,0.005016095,0.73358],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987897,0.00011485827,0.000053645825,0.00025996318,0.00069392176,0.000087848144],"domain_scores_gemma":[0.99887973,0.00014843572,0.000037017944,0.00040424,0.00044320847,0.00008735378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562536,0.0026055574,0.0026973432,0.003043063,0.00057121227,0.0033485435,0.003434771,0.0022788318,0.09306283],"category_scores_gemma":[0.0023865427,0.0012266178,0.0011041752,0.0031577072,0.0007869097,0.0029739127,0.0022079782,0.002739692,0.06550509],"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.000033587094,0.000038973674,0.00006703765,0.0002950651,0.000050376508,0.000027879032,0.0000108918475,0.0038619633,0.0018859608,0.009309848,0.3702833,0.6141352],"study_design_scores_gemma":[0.000027081,0.000080047575,0.0013233193,0.00033008074,0.000075145406,0.0005895034,0.000033519656,0.041340575,0.0062507666,0.05135486,0.8985328,0.00006236514],"about_ca_topic_score_codex":0.002757704,"about_ca_topic_score_gemma":0.0034339079,"teacher_disagreement_score":0.09306283,"about_ca_system_score_codex":0.0018036788,"about_ca_system_score_gemma":0.0015105004,"threshold_uncertainty_score":0.3113262},"labels":[],"label_agreement":null},{"id":"W4231180551","doi":"10.1007/11925071_8","title":"Dynamic Load Balancing in Distributed Content-Based Publish/Subscribe","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Load balancing (electrical power); Scalability; Distributed computing; Publication; Context (archaeology); Overhead (engineering); Load management; Network Load Balancing Services; Computer network; Server; Operating system","score_opus":0.015817985556279925,"score_gpt":0.22562995923080448,"score_spread":0.20981197367452456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231180551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10997046,0.0020184885,0.8720815,0.00068606547,0.00054337655,0.000350131,0.00024302349,0.005148186,0.008958709],"genre_scores_gemma":[0.8467551,0.0005224475,0.14164285,0.00017825307,0.00039548415,0.00026557705,0.00034562938,0.00048590716,0.0094088325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982755,0.0003904954,0.00013454648,0.000298022,0.0006708194,0.00023058825],"domain_scores_gemma":[0.9957164,0.0024701767,0.00020723711,0.00064481254,0.00073084014,0.00023056395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027225423,0.00075562554,0.0021447395,0.001294664,0.0021231591,0.002825368,0.0033710536,0.0011885178,0.0038909877],"category_scores_gemma":[0.005752537,0.00087657705,0.00040544174,0.0023557362,0.00096934964,0.0028722372,0.0017447243,0.0011714536,0.001063286],"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.0025918384,0.0012305637,0.0025415188,0.00060114183,0.00020849406,0.0004178912,0.0006501192,0.39005303,0.042609487,0.053562142,0.01944761,0.48608613],"study_design_scores_gemma":[0.00010734406,0.00008377833,0.0003124121,0.000009645848,0.00003739456,0.00009728128,0.00006775524,0.9700014,0.006130757,0.020626979,0.0025040219,0.000021218751],"about_ca_topic_score_codex":0.0020862482,"about_ca_topic_score_gemma":0.0028416663,"teacher_disagreement_score":0.0038909877,"about_ca_system_score_codex":0.0012954768,"about_ca_system_score_gemma":0.0009777346,"threshold_uncertainty_score":0.014398396},"labels":[],"label_agreement":null},{"id":"W4231232253","doi":"10.1007/11925071_10","title":"DBFarm: A Scalable Cluster for Multiple Databases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Middleware (distributed applications); Scalability; Software deployment; Database; Server; Exploit; Flexibility (engineering); Common Object Request Broker Architecture; Distributed computing; Distributed database; Database server; Operating system","score_opus":0.02354540944593317,"score_gpt":0.25614445517132045,"score_spread":0.23259904572538728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231232253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060540114,0.0034430928,0.7207992,0.001494118,0.0018077658,0.0008803031,0.0048074154,0.18011604,0.026111986],"genre_scores_gemma":[0.28876525,0.0019645046,0.6194605,0.001059499,0.00048637865,0.0009683598,0.018337587,0.0100525925,0.05890528],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916196,0.00011415248,0.00006173588,0.00018575483,0.0003641995,0.00011221211],"domain_scores_gemma":[0.9983272,0.00021987013,0.000057722944,0.0007132493,0.0003325596,0.0003495047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589891,0.0010027866,0.0012372631,0.0012564391,0.0013001146,0.0021052624,0.0042739166,0.0009041284,0.016908038],"category_scores_gemma":[0.0021830488,0.0011867218,0.00050290156,0.0021510464,0.000554421,0.0032594458,0.003109577,0.0017513436,0.0046880282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021588358,0.0005769124,0.002621789,0.0008702087,0.0002719824,0.00033218667,0.00043419472,0.034130912,0.046066023,0.023655793,0.40288308,0.4859981],"study_design_scores_gemma":[0.00156909,0.00089008216,0.0033225145,0.00013244797,0.0002846371,0.0009396802,0.0004918555,0.52749133,0.06093013,0.047916908,0.3557297,0.0003016502],"about_ca_topic_score_codex":0.003784794,"about_ca_topic_score_gemma":0.0046152314,"teacher_disagreement_score":0.016908038,"about_ca_system_score_codex":0.0008828596,"about_ca_system_score_gemma":0.0014819666,"threshold_uncertainty_score":0.05656308},"labels":[],"label_agreement":null},{"id":"W4231296399","doi":"10.1007/978-3-540-78195-0_16","title":"Quantitative Approaches in Object-Oriented Software Engineering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Université de Montréal","funders":"","keywords":"Session (web analytics); Computer science; Object (grammar); Closing (real estate); Software; Quality (philosophy); Metric (unit); Data science; Software engineering; Engineering; World Wide Web; Artificial intelligence; Epistemology; Political science; Operations management","score_opus":0.039633547060391586,"score_gpt":0.2562359961047838,"score_spread":0.21660244904439224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231296399","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.0018846514,0.010163854,0.95835096,0.0014817861,0.00038516376,0.00006631803,0.00009764271,0.0003397885,0.027229758],"genre_scores_gemma":[0.12755047,0.018438589,0.8121339,0.00091491267,0.0013003661,0.0006024681,0.00034936852,0.00054906745,0.038160898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99668556,0.0010878713,0.0002232249,0.00026006254,0.0016564543,0.00008672559],"domain_scores_gemma":[0.99322444,0.005306244,0.00024193642,0.00050225575,0.00063095556,0.000094179544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038264026,0.0012070438,0.0010786072,0.0027008513,0.00081701984,0.0029973027,0.0020125762,0.00085751334,0.006276504],"category_scores_gemma":[0.009999759,0.0009425387,0.0007053549,0.003451335,0.003912305,0.0057475124,0.0014140806,0.0026408364,0.0012786442],"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.000005604083,0.000030400797,0.00010409647,0.0003306567,0.000011941372,0.000019298617,0.00024361689,0.0027173373,0.00041832542,0.94251734,0.0037889504,0.049812283],"study_design_scores_gemma":[0.000005042668,0.000010935314,0.00013220636,0.000100348705,0.00000971236,0.000029958974,0.00006470367,0.0065713394,0.00031088846,0.9700787,0.02267665,0.00000947392],"about_ca_topic_score_codex":0.0010786785,"about_ca_topic_score_gemma":0.0012015977,"teacher_disagreement_score":0.006276504,"about_ca_system_score_codex":0.0017855979,"about_ca_system_score_gemma":0.0012165033,"threshold_uncertainty_score":0.020997047},"labels":[],"label_agreement":null},{"id":"W4231341663","doi":"10.1007/978-3-642-34713-9","title":"Machine Learning and Interpretation in Neuroimaging","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Neuroimaging; Interpretation (philosophy); Artificial intelligence; Cognitive science; Computer science; Psychology; Neuroscience","score_opus":0.009650860820995562,"score_gpt":0.2640385200137727,"score_spread":0.2543876591927771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231341663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051730396,0.069973394,0.8584056,0.014868951,0.0014084777,0.00006752386,0.0006019652,0.0011162183,0.048384808],"genre_scores_gemma":[0.19052796,0.06343086,0.6867297,0.0018951007,0.0029138562,0.00029076755,0.0009642209,0.0005211264,0.052726362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993831,0.0003077171,0.000058651935,0.00007615421,0.00015491224,0.000019563915],"domain_scores_gemma":[0.99729925,0.0022057057,0.00008685897,0.00023956632,0.00013705136,0.00003146934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018078663,0.00048109383,0.0006212628,0.0012195103,0.00025079792,0.002071021,0.0008066757,0.0010327101,0.0065779923],"category_scores_gemma":[0.0066390056,0.00044508136,0.00048122866,0.0014945961,0.0022078499,0.0032493346,0.00088684325,0.0013609476,0.00133904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022179649,0.000023252409,0.00052266533,0.000622203,0.000046781788,0.00028882467,0.00038097036,0.0040321387,0.0009079526,0.41377893,0.04362847,0.53574556],"study_design_scores_gemma":[0.0000030659398,0.000007020911,0.00053515687,0.00013477053,0.00001060492,0.00039391973,0.000096161035,0.009663339,0.00068422995,0.94861454,0.039845806,0.000011454357],"about_ca_topic_score_codex":0.001152246,"about_ca_topic_score_gemma":0.0018403499,"teacher_disagreement_score":0.0065779923,"about_ca_system_score_codex":0.00064106565,"about_ca_system_score_gemma":0.00079549034,"threshold_uncertainty_score":0.022005618},"labels":[],"label_agreement":null},{"id":"W4231658064","doi":"10.1007/3-540-44884-5_10","title":"To Play or to Control: A Game-Based Control-Theoretic Approach to Peer-to-Peer Incentive Engineering","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Toronto","funders":"","keywords":"Computer science; Stochastic game; Incentive; Peer-to-peer; Cournot competition; Shared resource; Game theory; Distributed computing; Valuation (finance); Sequential game; Control (management); Operations research; Microeconomics; Computer security; Artificial intelligence; Economics","score_opus":0.011532303471379199,"score_gpt":0.2250983422451517,"score_spread":0.2135660387737725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231658064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024853495,0.00064849766,0.9697434,0.0012231919,0.00020119203,0.0001060355,0.000037906866,0.00009353871,0.025460865],"genre_scores_gemma":[0.5475511,0.0025666011,0.40977165,0.0010400249,0.0006925473,0.0007102598,0.00008190847,0.0002218673,0.037363973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998451,0.00071127,0.000053388307,0.00022822378,0.00040987495,0.00014612828],"domain_scores_gemma":[0.99863964,0.0009086713,0.00009241702,0.0001120146,0.00014101955,0.00010625839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022894188,0.0013775707,0.0013402292,0.0005687485,0.0010046345,0.0035653894,0.002968724,0.002459571,0.006715345],"category_scores_gemma":[0.0050607882,0.00057211047,0.0009786013,0.0010267568,0.0041039614,0.0050556865,0.0024142575,0.003650639,0.00067354634],"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.000014876329,0.000025217965,0.000039264054,0.000054476048,0.000015145484,0.000027530557,0.000094996234,0.03370941,0.00034474474,0.954039,0.0017741,0.009861263],"study_design_scores_gemma":[0.000020959671,0.000031909854,0.000036019523,0.000032104417,0.000015090783,0.000040363775,0.000037656955,0.21092668,0.00032580848,0.7809001,0.007614154,0.000019028748],"about_ca_topic_score_codex":0.0020024497,"about_ca_topic_score_gemma":0.001841544,"teacher_disagreement_score":0.006715345,"about_ca_system_score_codex":0.0017652812,"about_ca_system_score_gemma":0.0017164528,"threshold_uncertainty_score":0.02246511},"labels":[],"label_agreement":null},{"id":"W4231706495","doi":"10.1007/bfb0034937","title":"Medical image segmentation using topologically adaptable snakes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Segmentation; Computer science; Merge (version control); Subdivision; Parametric statistics; Image segmentation; Artificial intelligence; Computer vision; Representation (politics); Topology (electrical circuits); Mathematics; Engineering","score_opus":0.02640009259363726,"score_gpt":0.30391874191386664,"score_spread":0.2775186493202294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231706495","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.0067154597,0.0005031358,0.99072284,0.00008950143,0.000037215505,0.000040080995,0.000029432644,0.00091158,0.0009506802],"genre_scores_gemma":[0.113751434,0.00093183294,0.88145095,0.00012218326,0.00005532167,0.00008671671,0.000150289,0.00054431043,0.0029070352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995834,0.00008941068,0.000034388675,0.00008890545,0.00017376474,0.000030049274],"domain_scores_gemma":[0.9992644,0.0003549781,0.00006905521,0.0001549655,0.00012151196,0.000035058678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009816922,0.00079578377,0.0008820843,0.0016668069,0.00027848806,0.0014686616,0.001287636,0.0016103412,0.0019015436],"category_scores_gemma":[0.0025524853,0.0012827427,0.0013589768,0.001643929,0.0007736156,0.0015074192,0.0013301895,0.001220536,0.0009238709],"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.00026515973,0.00006890375,0.00064300065,0.0004098087,0.00019821193,0.0004052866,0.00028960465,0.20278755,0.17296152,0.022327134,0.0035345126,0.59610933],"study_design_scores_gemma":[0.000031817508,0.00015495637,0.00082768535,0.00005929877,0.00009155715,0.0011816277,0.000037548867,0.91550624,0.04642786,0.026779179,0.008828024,0.00007422179],"about_ca_topic_score_codex":0.00047188098,"about_ca_topic_score_gemma":0.00061735156,"teacher_disagreement_score":0.0019015436,"about_ca_system_score_codex":0.0004059099,"about_ca_system_score_gemma":0.00036210628,"threshold_uncertainty_score":0.006361246},"labels":[],"label_agreement":null},{"id":"W4231729257","doi":"10.1007/978-3-662-45942-3_6","title":"Mining Multiple Related Data Sources Using Object-Oriented Model","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; Class hierarchy; Joins; Data mining; Database; Object (grammar); Inheritance (genetic algorithm); Theoretical computer science; Object-oriented programming; Artificial intelligence; Programming language","score_opus":0.0452442112778649,"score_gpt":0.27486780110831577,"score_spread":0.22962358983045086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231729257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04199513,0.0019700206,0.94687605,0.0006811846,0.0001656117,0.0006125614,0.0019443246,0.0035943605,0.002160712],"genre_scores_gemma":[0.13896821,0.0014433557,0.8502812,0.0003168283,0.000107720385,0.00035961042,0.006191548,0.00025725062,0.0020743043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662507,0.00037898045,0.00044115377,0.0006487843,0.0017540188,0.0001519312],"domain_scores_gemma":[0.99638355,0.0016606731,0.00046002772,0.00054174097,0.00081229233,0.00014164759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028390249,0.0017150008,0.0018281197,0.010280574,0.0013246628,0.0044348324,0.003175794,0.0014343965,0.0011860004],"category_scores_gemma":[0.0066978238,0.00096835184,0.0034315474,0.012763279,0.00058371614,0.0047900407,0.0023739494,0.0012990594,0.00084179046],"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.0006781153,0.0010674419,0.041056108,0.0014890685,0.0014754726,0.00368285,0.0009956363,0.034281302,0.014258649,0.025710708,0.013570413,0.86173415],"study_design_scores_gemma":[0.00018908372,0.00030036716,0.009753327,0.0004706226,0.0017973927,0.0025169984,0.0009827152,0.8249326,0.020404158,0.10583638,0.03266045,0.00015589272],"about_ca_topic_score_codex":0.004063056,"about_ca_topic_score_gemma":0.005796151,"teacher_disagreement_score":0.010280574,"about_ca_system_score_codex":0.0008945069,"about_ca_system_score_gemma":0.0019626066,"threshold_uncertainty_score":0.01501441},"labels":[],"label_agreement":null},{"id":"W4231762586","doi":"10.1007/978-3-030-81645-2","title":"Applied Cryptography and Network Security Workshops","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Concordia University","funders":"","keywords":"Cryptography; Computer science; Computer security; Neural cryptography; Public-key cryptography; Encryption","score_opus":0.007178357840903732,"score_gpt":0.21232025258555057,"score_spread":0.20514189474464684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231762586","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009255981,0.04936086,0.10338859,0.014069129,0.031927556,0.00027089578,0.00066666777,0.0021243885,0.7889359],"genre_scores_gemma":[0.0179481,0.013671629,0.013242317,0.00065462384,0.0031345373,0.00009632407,0.0006136341,0.00029733634,0.95034146],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990883,0.00020147672,0.000032674638,0.0001298588,0.0004186568,0.00012907453],"domain_scores_gemma":[0.9991047,0.00017458208,0.000032642594,0.00014422162,0.00030391375,0.00023989864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016107943,0.0013720348,0.0007725791,0.0012457555,0.0011155428,0.0032427344,0.0014008525,0.0011927503,0.082185],"category_scores_gemma":[0.0013204104,0.0005947574,0.0007830835,0.002219133,0.0005455701,0.0027160547,0.002078723,0.0025387965,0.049369235],"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.00014691529,0.00024853708,0.00021065044,0.00033589854,0.000023602432,0.00015169414,0.00020522875,0.0029429696,0.0042045154,0.040021807,0.5530128,0.3984954],"study_design_scores_gemma":[0.000017411874,0.000096962925,0.0004999268,0.00021365205,0.000018722196,0.00032397974,0.00012238574,0.0060965354,0.00232672,0.026621914,0.963643,0.000018789164],"about_ca_topic_score_codex":0.0010478182,"about_ca_topic_score_gemma":0.0025689749,"teacher_disagreement_score":0.082185,"about_ca_system_score_codex":0.0011493438,"about_ca_system_score_gemma":0.0019215799,"threshold_uncertainty_score":0.2749362},"labels":[],"label_agreement":null},{"id":"W4231869404","doi":"10.1007/978-3-642-21827-9_52","title":"Negotiating Privacy Preferences in Video Surveillance Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Ontario Tech University","funders":"","keywords":"Computer science; Privacy protection; Negotiation; Information privacy; Feature (linguistics); Internet privacy; Privacy software; Computer security","score_opus":0.0426056042202764,"score_gpt":0.27646402656661734,"score_spread":0.23385842234634094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231869404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17763643,0.00086325017,0.8072977,0.0010467876,0.00006007364,0.00013368859,0.00010124776,0.00020755164,0.012653237],"genre_scores_gemma":[0.9527956,0.00028888808,0.043679062,0.000085933534,0.000041717183,0.00006072976,0.0000881533,0.00003865287,0.0029212276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9947184,0.0030642122,0.00022811381,0.00053631834,0.0009189301,0.0005340708],"domain_scores_gemma":[0.98565173,0.011760136,0.00065203564,0.0010019284,0.00056211656,0.0003721275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064613954,0.0005087982,0.00085036433,0.00042698643,0.00080689706,0.0032606914,0.0012926396,0.0014851756,0.0027221607],"category_scores_gemma":[0.022193871,0.00067389116,0.0005322701,0.00076688227,0.0011819848,0.0065365396,0.00214025,0.0023840738,0.0003325082],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025384084,0.0004821752,0.007680847,0.00041062295,0.00023630711,0.00078735425,0.0037362592,0.27436122,0.01681648,0.4001743,0.0048210328,0.28795496],"study_design_scores_gemma":[0.00005530049,0.00021778043,0.001070888,0.000038026865,0.00004532547,0.0002433363,0.0007976971,0.7950781,0.0077381767,0.19162357,0.0030466728,0.000045220335],"about_ca_topic_score_codex":0.0009383181,"about_ca_topic_score_gemma":0.00081436743,"teacher_disagreement_score":0.0064613954,"about_ca_system_score_codex":0.000956293,"about_ca_system_score_gemma":0.0005976708,"threshold_uncertainty_score":0.03417152},"labels":[],"label_agreement":null},{"id":"W4231973565","doi":"10.1007/978-3-642-13022-9_30","title":"Analysis of the Inducing Factors Involved in Stem Cell Differentiation Using Feature Selection Techniques, Support Vector Machines and Decision Trees","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Health Research Foundation","funders":"","keywords":"Computer science; Feature selection; Decision tree; Stem cell; Support vector machine; Feature (linguistics); Selection (genetic algorithm); Process (computing); Cellular differentiation; Machine learning; Artificial intelligence; Data mining; Biology; Cell biology; Genetics; Gene","score_opus":0.016785735800871983,"score_gpt":0.2436260520724966,"score_spread":0.22684031627162463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231973565","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.46229273,0.0032523354,0.5308192,0.00012910798,0.000056311947,0.00010640652,0.0010855179,0.00083163084,0.0014268243],"genre_scores_gemma":[0.8008103,0.0016702999,0.19379456,0.000028422459,0.00003951449,0.00013164175,0.0017863114,0.000088723806,0.0016501996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980265,0.000027586731,0.00001869225,0.000030100067,0.00009252024,0.000028491784],"domain_scores_gemma":[0.99928504,0.00044944923,0.00009014339,0.000030091142,0.00012340979,0.000021801912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251739,0.00047812675,0.00085762603,0.00095024373,0.00021536442,0.00081510184,0.00029344333,0.0002504247,0.0007214208],"category_scores_gemma":[0.0011803984,0.00019992005,0.00076386094,0.0011014658,0.00020759272,0.00041341558,0.00015610541,0.0005331468,0.00028272677],"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.0009278532,0.00033144353,0.009889133,0.00041088194,0.0001029919,0.00023821743,0.000074832016,0.08987496,0.40910923,0.00332035,0.0012268911,0.48449323],"study_design_scores_gemma":[0.000028718729,0.00042559515,0.018495498,0.000021307293,0.00017662859,0.00023695346,0.00006430498,0.76484174,0.20959963,0.004146363,0.001922268,0.00004107582],"about_ca_topic_score_codex":0.0011549208,"about_ca_topic_score_gemma":0.0011692179,"teacher_disagreement_score":0.0011549208,"about_ca_system_score_codex":0.00034485877,"about_ca_system_score_gemma":0.0004707548,"threshold_uncertainty_score":0.0033062696},"labels":[],"label_agreement":null},{"id":"W4232175613","doi":"10.1007/978-3-642-35182-2_17","title":"Concurrent Test Generation Using Concolic Multi-trace Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concolic testing; Computer science; Thread (computing); Concurrency; Code coverage; Programming language; Symbolic execution; TRACE (psycholinguistics); Test case; Parallel computing; Software; Machine learning","score_opus":0.07016234621544544,"score_gpt":0.3164600363995561,"score_spread":0.24629769018411068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232175613","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.025477802,0.000054293032,0.96384,0.00007429405,0.000049266444,0.00020095237,0.00007621838,0.007195163,0.003031998],"genre_scores_gemma":[0.50693387,0.00004452113,0.4870943,0.00011575457,0.000043731274,0.00023721822,0.0003463791,0.0015561432,0.00362807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969416,0.0006812559,0.00016866834,0.00058667193,0.0012564976,0.00036529222],"domain_scores_gemma":[0.9895281,0.005257574,0.0005819218,0.0022323679,0.0021343962,0.00026569577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018502815,0.0013539514,0.0007285605,0.0022956838,0.0007097986,0.0011018625,0.0026274244,0.0011609282,0.0055686417],"category_scores_gemma":[0.008754922,0.0006796411,0.001104293,0.0011726643,0.0010943745,0.001709692,0.002018967,0.0012763573,0.0009701337],"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.0013366902,0.0007621462,0.0064704106,0.00051502703,0.00018884422,0.0014781383,0.0005678408,0.122002475,0.08079152,0.055860594,0.0067281695,0.72329813],"study_design_scores_gemma":[0.00018390779,0.00033701753,0.0007598785,0.000056084322,0.00011883767,0.00060057297,0.000045793113,0.87252176,0.08115163,0.039738044,0.004437274,0.00004932197],"about_ca_topic_score_codex":0.002236713,"about_ca_topic_score_gemma":0.0028974076,"teacher_disagreement_score":0.0055686417,"about_ca_system_score_codex":0.000742315,"about_ca_system_score_gemma":0.0016697063,"threshold_uncertainty_score":0.018629014},"labels":[],"label_agreement":null},{"id":"W4232709059","doi":"10.1007/978-3-642-22362-4_17","title":"Leveraging Collaborative Filtering to Tag-Based Personalized Search","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Ottawa","funders":"","keywords":"Computer science; Social media; Collaborative filtering; Information retrieval; Ranking (information retrieval); World Wide Web; Personalized search; Personalization; Recommender system","score_opus":0.04413880515709913,"score_gpt":0.2781181616361555,"score_spread":0.23397935647905638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232709059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025416575,0.0024186457,0.963399,0.00032992352,0.0003545372,0.00013682684,0.000314479,0.0019925332,0.0056374134],"genre_scores_gemma":[0.5065354,0.0019324238,0.4747953,0.00037976075,0.0007534556,0.0001364922,0.0011104991,0.00032047284,0.0140362065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966961,0.0010017297,0.00017950743,0.00063209643,0.0012619565,0.00022858045],"domain_scores_gemma":[0.9912511,0.004881601,0.00028958803,0.0022130352,0.0011960126,0.00016864543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025638824,0.0011407754,0.0025701725,0.0036322281,0.0012560437,0.0027590995,0.0023979284,0.0024132747,0.0034887418],"category_scores_gemma":[0.013252633,0.0009835735,0.0016832823,0.00564949,0.0006834304,0.00481941,0.0017177591,0.0017571839,0.0034948844],"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.000801481,0.001044674,0.005042328,0.000546683,0.000817398,0.0003173653,0.00048027403,0.105858535,0.030347,0.020898465,0.019506792,0.8143391],"study_design_scores_gemma":[0.000044086104,0.00020620802,0.0013010395,0.00003485928,0.00021776106,0.00035624148,0.000059422295,0.9562615,0.00979106,0.02554839,0.0060884906,0.00009104725],"about_ca_topic_score_codex":0.008027532,"about_ca_topic_score_gemma":0.018161314,"teacher_disagreement_score":0.008027532,"about_ca_system_score_codex":0.0006736507,"about_ca_system_score_gemma":0.00087720575,"threshold_uncertainty_score":0.015961587},"labels":[],"label_agreement":null},{"id":"W4232773967","doi":"10.1007/978-3-540-69489-2_16","title":"Modelling and Analysis of Real Time and Embedded Systems – Using UML","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"IBM (Canada)","funders":"","keywords":"Computer science; Unified Modeling Language; Perspective (graphical); Model transformation; Transformation (genetics); Software engineering; Data science; Programming language; Artificial intelligence; Software; Consistency (knowledge bases)","score_opus":0.055091772421228556,"score_gpt":0.30631898091861115,"score_spread":0.2512272084973826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232773967","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.0058942833,0.00077192177,0.9875772,0.000109674125,0.000035515088,0.00006876223,0.00011321244,0.0013680599,0.0040613753],"genre_scores_gemma":[0.22051567,0.0025017557,0.76583594,0.000085344276,0.000057733057,0.00024854476,0.00070299604,0.00065535685,0.009396689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.00039183372,0.00014936647,0.0001358745,0.0005468275,0.00007673623],"domain_scores_gemma":[0.9984975,0.0008029546,0.00021017941,0.0002755625,0.00018630011,0.000027515167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516266,0.0009608032,0.0006019019,0.0011568834,0.0003381109,0.0023863667,0.0013722524,0.0009532883,0.0029849724],"category_scores_gemma":[0.0027689845,0.00093393645,0.0014315459,0.0006471395,0.0009926698,0.0023676327,0.0008116234,0.0010110071,0.000986346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001298319,0.00009964112,0.0012033699,0.0012166686,0.00012462851,0.0006329236,0.0013901505,0.37032768,0.056596346,0.41036484,0.0024946963,0.15541928],"study_design_scores_gemma":[0.000044960532,0.000096757445,0.00078841584,0.00035340124,0.00012440371,0.00057540426,0.00014418413,0.72756624,0.050868362,0.12874621,0.09062867,0.00006302748],"about_ca_topic_score_codex":0.0034262484,"about_ca_topic_score_gemma":0.0023836563,"teacher_disagreement_score":0.0034262484,"about_ca_system_score_codex":0.0009887575,"about_ca_system_score_gemma":0.0010166784,"threshold_uncertainty_score":0.009985745},"labels":[],"label_agreement":null},{"id":"W4233005118","doi":"10.1007/3-540-44977-9_10","title":"Feedback-Free Circuits in the Algebra of Transients","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Automaton; Electronic circuit; State (computer science); Computer science; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Arithmetic; Engineering; Electrical engineering; Pure mathematics; Programming language","score_opus":0.014021645481956214,"score_gpt":0.22002589122422989,"score_spread":0.20600424574227366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233005118","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.15519641,0.0037576705,0.6906927,0.0016386803,0.00045708977,0.00009365197,0.0005424559,0.0008532035,0.1467681],"genre_scores_gemma":[0.94360894,0.0015527323,0.029774372,0.00026542463,0.00046933972,0.00011061812,0.00020548607,0.00009336877,0.023919724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00016212293,0.000046309186,0.00015594138,0.0001953939,0.00009788193],"domain_scores_gemma":[0.9984931,0.00093668234,0.00012968789,0.00014439308,0.0001722157,0.00012382319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064271706,0.00043253932,0.00066510466,0.0007935986,0.0010030967,0.0028812275,0.0010820316,0.0009181442,0.008006659],"category_scores_gemma":[0.0020967296,0.00037489051,0.0008386516,0.00084908586,0.0020162708,0.0043625045,0.0010102137,0.0016745732,0.0009772112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017433602,0.0000075262396,0.00004248274,0.000021997821,0.000004194532,0.000039865365,0.00007530393,0.0022189645,0.0007325342,0.993616,0.00034091255,0.002882673],"study_design_scores_gemma":[0.0000104468,0.000014400878,0.000043119548,0.0000062571476,0.000005284995,0.000062808256,0.000019791352,0.009021564,0.00047455035,0.9881505,0.002183783,0.0000075861167],"about_ca_topic_score_codex":0.00065049285,"about_ca_topic_score_gemma":0.000624124,"teacher_disagreement_score":0.008006659,"about_ca_system_score_codex":0.0011197585,"about_ca_system_score_gemma":0.0006199695,"threshold_uncertainty_score":0.026784956},"labels":[],"label_agreement":null},{"id":"W4233043174","doi":"10.1007/3-540-45603-1_119","title":"McGill Reddogs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Interpreter; Architecture; Monte Carlo method; Computer graphics (images); Competition (biology); Artificial intelligence; Programming language; Visual arts; Art; Mathematics","score_opus":0.01910680074838257,"score_gpt":0.2122759195114742,"score_spread":0.19316911876309162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233043174","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.00046504335,0.0029411875,0.004153441,0.0015275766,0.0009147558,0.00005943586,0.0014611658,0.003154382,0.9853231],"genre_scores_gemma":[0.00068800565,0.0005535184,0.0007215507,0.00020827314,0.000038360795,0.000011763051,0.00027628415,0.00034146546,0.9971608],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966586,0.00002991088,0.000009256384,0.000064894455,0.00018211872,0.00004801565],"domain_scores_gemma":[0.99925977,0.00008363535,0.000024347815,0.00014396914,0.00028501108,0.00020330185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004897411,0.0013213293,0.00062788633,0.0023002985,0.0015005571,0.003021159,0.0015320779,0.0010589563,0.6443461],"category_scores_gemma":[0.0011667396,0.0006319152,0.0004696912,0.0017059182,0.00045608217,0.0018801589,0.0017895075,0.0013105302,0.40977523],"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.00002674865,0.000016612876,0.00005570337,0.00006163526,0.0000018845897,0.000037465375,0.000047583366,0.000088644556,0.00040717056,0.0057016574,0.8191148,0.17444018],"study_design_scores_gemma":[0.0000034880022,0.0000058223063,0.00014198474,0.000029119916,0.0000019474146,0.00003103301,0.000027828371,0.000063306856,0.00015862261,0.0009965809,0.9985361,0.000004104427],"about_ca_topic_score_codex":0.026375398,"about_ca_topic_score_gemma":0.11476069,"teacher_disagreement_score":0.6443461,"about_ca_system_score_codex":0.0014938541,"about_ca_system_score_gemma":0.0018203562,"threshold_uncertainty_score":0.50729704},"labels":[],"label_agreement":null},{"id":"W4233049285","doi":"10.1007/978-3-030-91550-6","title":"Formal Methods Teaching","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mathematics Education and Teaching Techniques","field":"Social Sciences","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":"McMaster University","funders":"","keywords":"Computer science; Formal methods; Programming language; Software engineering","score_opus":0.041088246577773546,"score_gpt":0.4136507655398406,"score_spread":0.37256251896206705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233049285","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011885236,0.0066490853,0.08850079,0.0040810723,0.0017924577,0.000072864,0.00033807245,0.0015974744,0.89577955],"genre_scores_gemma":[0.012671937,0.004403456,0.020459428,0.0007427123,0.0005580618,0.000057826084,0.00042929463,0.00077847054,0.95989877],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933535,0.000114109804,0.000024101348,0.00009906905,0.00037808396,0.000049254926],"domain_scores_gemma":[0.99898726,0.00044394872,0.00003112785,0.00020355481,0.00022994993,0.00010417743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009166512,0.0010574405,0.0006269702,0.0016632711,0.0011914752,0.0026734725,0.00097241194,0.0008753425,0.1683811],"category_scores_gemma":[0.002353741,0.00074389635,0.00083211676,0.0014424428,0.0013674307,0.0034513364,0.0020148493,0.003051783,0.059653092],"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.000027093009,0.00009579408,0.00012844546,0.0002508045,0.0000080828995,0.000049280014,0.0005364536,0.0008803269,0.001471922,0.29092988,0.34524804,0.36037394],"study_design_scores_gemma":[0.000007592607,0.000017970922,0.00017814762,0.0001684954,0.000004214782,0.00015641791,0.000106444386,0.00089444144,0.0007750866,0.1288532,0.8688303,0.0000075568782],"about_ca_topic_score_codex":0.0012728197,"about_ca_topic_score_gemma":0.00299362,"teacher_disagreement_score":0.1683811,"about_ca_system_score_codex":0.0019149784,"about_ca_system_score_gemma":0.0017013274,"threshold_uncertainty_score":0.56329083},"labels":[],"label_agreement":null},{"id":"W4233531354","doi":"10.1007/978-3-030-50402-1","title":"Artificial Intelligence and Machine Learning for Digital Pathology","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"University of Alberta","funders":"","keywords":"Biobank; Computer science; Digital pathology; Artificial intelligence; Block (permutation group theory); Data science; Deep learning; Bioinformatics","score_opus":0.030907480100315403,"score_gpt":0.2575827554205666,"score_spread":0.22667527532025117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233531354","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002309606,0.41373613,0.18094376,0.009798619,0.009029952,0.00013919915,0.00090916315,0.0016759115,0.38145766],"genre_scores_gemma":[0.019149054,0.17423607,0.15041421,0.0025491535,0.0062075453,0.00016278143,0.0010445575,0.0005236186,0.645713],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997745,0.000040749965,0.000011930232,0.00003422477,0.00012774594,0.000010798901],"domain_scores_gemma":[0.9992343,0.0005507475,0.000026931442,0.00006534005,0.000088825764,0.000033796478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042617618,0.0008054816,0.00065129896,0.0016193034,0.00032997085,0.0019536382,0.0008188113,0.00088396895,0.05033461],"category_scores_gemma":[0.0014990326,0.00030129033,0.00042795952,0.0018024464,0.0008565366,0.0026897795,0.001026126,0.001525479,0.018706627],"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.000025184934,0.000051897834,0.00013356454,0.00092635665,0.000028951214,0.00007620867,0.00005988051,0.0027560762,0.0015391271,0.09828628,0.2769566,0.61915994],"study_design_scores_gemma":[0.000009851791,0.000037610756,0.0005579702,0.00042250293,0.00001860414,0.00048351815,0.000043844808,0.007896233,0.0008261759,0.20041353,0.78927064,0.000019619627],"about_ca_topic_score_codex":0.0007194552,"about_ca_topic_score_gemma":0.0015796978,"teacher_disagreement_score":0.05033461,"about_ca_system_score_codex":0.0006272275,"about_ca_system_score_gemma":0.00048927544,"threshold_uncertainty_score":0.16838604},"labels":[],"label_agreement":null},{"id":"W4233604128","doi":"10.1007/978-3-319-25783-9","title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Granular computing; Rough set; Computer science; Data mining; Fuzzy set; Fuzzy logic; Artificial intelligence","score_opus":0.04374779765459733,"score_gpt":0.28371843531639274,"score_spread":0.2399706376617954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233604128","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.011176057,0.4107427,0.47098488,0.008303476,0.0029096243,0.00016708007,0.00078774046,0.0006708151,0.09425773],"genre_scores_gemma":[0.2684778,0.26199436,0.42623866,0.002088907,0.0054754764,0.0004006941,0.0015492416,0.0001866579,0.033588145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984353,0.00034114954,0.00015974267,0.00019008359,0.00080637465,0.00006727602],"domain_scores_gemma":[0.9984409,0.0010550751,0.00014940591,0.00017182283,0.0001349026,0.000048010446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001835321,0.0011381129,0.0023493625,0.0035143143,0.0005561557,0.0052303844,0.0010571198,0.0010378027,0.0034187036],"category_scores_gemma":[0.004794482,0.0006092948,0.0011860773,0.0077564646,0.0027339645,0.004791798,0.0013864785,0.00267593,0.0010964794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055987064,0.000053685642,0.00052738306,0.0017631929,0.00013237062,0.00015603796,0.0003604303,0.012146034,0.0008604232,0.7077808,0.02629511,0.24986865],"study_design_scores_gemma":[0.0000089336745,0.000024605111,0.00047531194,0.0002753253,0.000036456084,0.00019357038,0.0001271409,0.01071456,0.00022256623,0.94327533,0.044620015,0.000026234455],"about_ca_topic_score_codex":0.0010518037,"about_ca_topic_score_gemma":0.001032619,"teacher_disagreement_score":0.0052303844,"about_ca_system_score_codex":0.0011337801,"about_ca_system_score_gemma":0.00089285977,"threshold_uncertainty_score":0.01143676},"labels":[],"label_agreement":null},{"id":"W4233714500","doi":"10.1007/3-540-40011-7_27","title":"Consistent Behaviour Representation in Activity and Sequence Diagrams","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Carleton University","funders":"","keywords":"Sequence diagram; Computer science; Activity diagram; Story-driven modeling; Graph rewriting; Interaction overview diagram; Communication diagram; Block diagram; Sequence (biology); Unified Modeling Language; Theoretical computer science; Programming language; Diagram; Consistency (knowledge bases); Graph; Representation (politics); Control flow; Data flow diagram; Class diagram; Artificial intelligence","score_opus":0.06065128398025846,"score_gpt":0.31375218937467947,"score_spread":0.253100905394421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233714500","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.0034643991,0.000076979035,0.9941539,0.00008029049,0.00001688628,0.00005381886,0.000106431246,0.00084186136,0.0012054647],"genre_scores_gemma":[0.15295461,0.000262723,0.8410325,0.00010055899,0.000038453007,0.0004064801,0.0011499798,0.00052916806,0.0035255454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508923,0.0017718499,0.0005318965,0.00073256536,0.0016261231,0.0002483431],"domain_scores_gemma":[0.9917189,0.004632599,0.00059179217,0.0017444255,0.0011584954,0.00015377907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037951604,0.00079238846,0.00095460477,0.0021469707,0.00083111157,0.0034333332,0.0024655212,0.0020160768,0.0032692591],"category_scores_gemma":[0.013828302,0.0011288304,0.0015418519,0.0021015422,0.0018510072,0.0058286684,0.0017227508,0.0022600826,0.0009258959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018332664,0.00013320087,0.0012466521,0.00036550884,0.00006121524,0.00030740458,0.0013164156,0.061060693,0.0051885736,0.7534001,0.0030441068,0.1736929],"study_design_scores_gemma":[0.00006543112,0.000083062085,0.00032142288,0.00015114162,0.00011606956,0.00020527089,0.00020127717,0.33695728,0.009476349,0.6290567,0.023323247,0.000042834115],"about_ca_topic_score_codex":0.0042299805,"about_ca_topic_score_gemma":0.0043344027,"teacher_disagreement_score":0.0042299805,"about_ca_system_score_codex":0.0012943391,"about_ca_system_score_gemma":0.0019693307,"threshold_uncertainty_score":0.02007097},"labels":[],"label_agreement":null},{"id":"W4233810285","doi":"10.1007/978-3-540-69052-8_37","title":"A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Web Polling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Polling; Computer science; Knapsack problem; Learning automata; Resource allocation; Automaton; Hierarchy; Convergence (economics); Theoretical computer science; Algorithm; Computer network","score_opus":0.02209309194474442,"score_gpt":0.26533987824354915,"score_spread":0.24324678629880472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233810285","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.10632188,0.00061451306,0.86489797,0.00049248186,0.00021288083,0.00019665422,0.00050484994,0.0064614043,0.020297362],"genre_scores_gemma":[0.62985003,0.000252544,0.36197755,0.00025943786,0.00007883973,0.00037525772,0.00052197196,0.00034277164,0.006341628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.00028034585,0.00017791372,0.00028726048,0.00025464655,0.0002486094],"domain_scores_gemma":[0.9950723,0.0021735774,0.0002460179,0.0014401847,0.00064755796,0.00042030643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010012902,0.0006708519,0.0016748218,0.0009502604,0.0016914126,0.003468346,0.0027411256,0.0017997418,0.011286361],"category_scores_gemma":[0.005497238,0.00094455207,0.0009889209,0.0010383575,0.0013388533,0.0027176375,0.0028786615,0.002334323,0.0018011155],"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.0010475476,0.0005939713,0.0023612385,0.00070082425,0.00012785142,0.0005581767,0.0007541849,0.16684555,0.047568254,0.5667641,0.009505289,0.20317297],"study_design_scores_gemma":[0.00008573505,0.00009570449,0.0002474083,0.000047977017,0.00006241029,0.00015655569,0.00007603097,0.7853175,0.006227593,0.204151,0.0034819362,0.000050112798],"about_ca_topic_score_codex":0.0021604442,"about_ca_topic_score_gemma":0.0035682197,"teacher_disagreement_score":0.011286361,"about_ca_system_score_codex":0.0012790163,"about_ca_system_score_gemma":0.0018317166,"threshold_uncertainty_score":0.03775662},"labels":[],"label_agreement":null},{"id":"W4234001087","doi":"10.1007/978-3-319-23820-3","title":"Runtime Verification","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Samsung; Stony Brook University; Aristotle University of Thessaloniki; Austrian Institute of Technology; Universität des Saarlandes; Universidad Politécnica de Madrid; Universität zu Lübeck; Bar-Ilan University; Aalborg Universitet; Technische Universität Darmstadt; Technische Universität Wien; University of Manchester; University of Oxford; McMaster University; National University of Singapore; University of Texas at Austin; Imperial College London; Queen Mary University of London; University of Washington; Fraunhofer-Institut für Sichere Informationstechnologie; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; Microsoft Research; Arizona State University; University of Missouri; University of Pennsylvania; National Aeronautics and Space Administration","keywords":"Computer science; Programming language; Runtime verification; Formal verification; Software engineering","score_opus":0.015803980941418074,"score_gpt":0.2440882948610569,"score_spread":0.22828431391963883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234001087","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038454817,0.0020357065,0.7865212,0.00065519765,0.0010238215,0.00014747298,0.000863238,0.019472511,0.1854353],"genre_scores_gemma":[0.18192954,0.004347695,0.43760762,0.0008423823,0.0007330721,0.00030993152,0.0071700485,0.01116827,0.35589144],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985948,0.000188594,0.000069746115,0.00030775488,0.00072923145,0.000109824985],"domain_scores_gemma":[0.9988563,0.00028380533,0.00004033873,0.0005647567,0.00022436058,0.000030376214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497673,0.0013536176,0.00090536714,0.0008942181,0.00070242945,0.002224826,0.0013676807,0.0007960219,0.04992487],"category_scores_gemma":[0.0027336318,0.0007710661,0.0012975754,0.0006975596,0.00078836957,0.0025895122,0.0018885218,0.002231565,0.031246036],"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.00020165162,0.00010276908,0.00027309443,0.000517228,0.00003927022,0.00015778384,0.00014375578,0.008772589,0.019885544,0.2085286,0.0875145,0.6738631],"study_design_scores_gemma":[0.000081893915,0.000099381046,0.00063187035,0.00038855372,0.00008948803,0.00076085655,0.00006685363,0.05816417,0.07539539,0.3149684,0.5492847,0.00006841357],"about_ca_topic_score_codex":0.000661109,"about_ca_topic_score_gemma":0.0009664477,"teacher_disagreement_score":0.04992487,"about_ca_system_score_codex":0.0008017225,"about_ca_system_score_gemma":0.001122477,"threshold_uncertainty_score":0.16701531},"labels":[],"label_agreement":null},{"id":"W4234150660","doi":"10.1007/978-3-642-21827-9_53","title":"The Bayesian Pursuit Algorithm: A New Family of Estimator Learning Automata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Carleton University","funders":"","keywords":"Learning automata; Computer science; Prior probability; Bayesian probability; Estimator; Conjugate prior; Artificial intelligence; Algorithm; Machine learning; Mathematical optimization; Automaton; Mathematics; Statistics","score_opus":0.02299867247613641,"score_gpt":0.253557143766679,"score_spread":0.23055847129054258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234150660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054802344,0.00025088785,0.99836105,0.00005997044,0.000033673237,0.0000124899225,0.000024595489,0.00018120215,0.0005280583],"genre_scores_gemma":[0.038956128,0.0010548944,0.955866,0.00018969529,0.00018159083,0.0002455729,0.00014440481,0.0003317637,0.0030300447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713254,0.001031716,0.00020008835,0.0005773054,0.00095365196,0.000104704864],"domain_scores_gemma":[0.99394953,0.0038137508,0.00029705555,0.0008675381,0.0009136894,0.0001584461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041905134,0.001194494,0.0022891534,0.0016513546,0.0007695631,0.0029471153,0.0037220516,0.002852887,0.003716899],"category_scores_gemma":[0.01801561,0.0011685882,0.0016606704,0.0019822877,0.0019223702,0.005015988,0.003911448,0.004246216,0.0019294516],"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.00016865908,0.000073872296,0.0008516677,0.0002708438,0.00015657926,0.00006897768,0.00017782243,0.20047839,0.0035517185,0.36285093,0.005511748,0.4258388],"study_design_scores_gemma":[0.000018150278,0.00004327833,0.00007630441,0.000034424524,0.000025293644,0.00007318784,0.000008613036,0.85760933,0.0012175903,0.13416347,0.006703802,0.000026456953],"about_ca_topic_score_codex":0.0015802551,"about_ca_topic_score_gemma":0.0015689834,"teacher_disagreement_score":0.0041905134,"about_ca_system_score_codex":0.00090728723,"about_ca_system_score_gemma":0.0013624214,"threshold_uncertainty_score":0.022161841},"labels":[],"label_agreement":null},{"id":"W4234335214","doi":"10.1007/978-3-319-30303-1","title":"Foundations and Practice of Security","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Computer science; Programming language; Software engineering; Computer security","score_opus":0.019485851282066462,"score_gpt":0.3186419016319987,"score_spread":0.2991560503499322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234335214","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065775607,0.029799275,0.14332509,0.06020713,0.001915494,0.000100746576,0.00018740604,0.00017168683,0.7577156],"genre_scores_gemma":[0.80791533,0.019951835,0.0637665,0.005405393,0.0025358351,0.0005844943,0.00021058941,0.00020716958,0.09942286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525166,0.0026516458,0.00021038593,0.0005919955,0.0009326381,0.00036170825],"domain_scores_gemma":[0.9946467,0.003043434,0.00030460197,0.0011761851,0.000546543,0.00028251307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054098167,0.0007949357,0.00073266117,0.0017674464,0.003195928,0.009058058,0.001881833,0.004339194,0.016527928],"category_scores_gemma":[0.0083669955,0.00057121116,0.0006028762,0.002018356,0.03370902,0.009767231,0.003806264,0.005290573,0.0028839589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012170011,0.0000037517887,0.000026434225,0.000013260273,0.0000010599183,0.000004590427,0.00028966955,0.000098081306,0.000010384292,0.9955817,0.0018027325,0.0021670372],"study_design_scores_gemma":[0.0000027093615,0.000002956541,0.00003689547,0.00005125116,0.0000012478434,0.000016207749,0.00025058576,0.00022007994,0.000021797496,0.95917785,0.040216245,0.0000020402283],"about_ca_topic_score_codex":0.003524115,"about_ca_topic_score_gemma":0.0024094067,"teacher_disagreement_score":0.016527928,"about_ca_system_score_codex":0.0046663205,"about_ca_system_score_gemma":0.0054490785,"threshold_uncertainty_score":0.055291414},"labels":[],"label_agreement":null},{"id":"W4234540327","doi":"10.1007/978-3-030-88701-8","title":"Relational and Algebraic Methods in Computer Science","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Algebraic number; Field (mathematics); Relation (database); Algebra over a field; Relational algebra; Relational database; Theoretical computer science; Management science; Mathematics; Information retrieval; Pure mathematics; Data mining","score_opus":0.0333349647249997,"score_gpt":0.3007006305452636,"score_spread":0.2673656658202639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234540327","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020604706,0.2301473,0.22036223,0.0073322654,0.007193135,0.00009650129,0.00064483244,0.0012342156,0.5309291],"genre_scores_gemma":[0.056006663,0.18391465,0.21685526,0.0029313755,0.013178994,0.00038419227,0.0015971278,0.0015625291,0.5235692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991966,0.00018219648,0.000049259503,0.00012061117,0.00041233306,0.00003893278],"domain_scores_gemma":[0.998417,0.0010895845,0.00005119089,0.00018436168,0.00020156267,0.00005620826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091178634,0.0010386177,0.0012276021,0.002126871,0.000956818,0.004134677,0.0011246819,0.00077638763,0.029990189],"category_scores_gemma":[0.0028073338,0.00066523615,0.0006890774,0.004743905,0.0023995086,0.0069723115,0.0012012189,0.0031882492,0.010257152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001159798,0.000021352545,0.0000766257,0.00039971765,0.0000145980175,0.000023467404,0.00020743068,0.0005964028,0.00033713895,0.79361594,0.104743056,0.09995255],"study_design_scores_gemma":[0.00001131005,0.000011403539,0.00018411367,0.0001641049,0.000010823139,0.00014398848,0.000061134844,0.0012848236,0.00018516312,0.52866805,0.46926388,0.000011184661],"about_ca_topic_score_codex":0.0013471729,"about_ca_topic_score_gemma":0.0017057622,"teacher_disagreement_score":0.029990189,"about_ca_system_score_codex":0.0014849938,"about_ca_system_score_gemma":0.001204186,"threshold_uncertainty_score":0.100327194},"labels":[],"label_agreement":null},{"id":"W4234761739","doi":"10.1007/978-3-030-04503-6","title":"Trends and Applications in Knowledge Discovery and Data Mining","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Knowledge extraction; Data science; Data mining; Information retrieval","score_opus":0.028540261169193573,"score_gpt":0.3035353017582714,"score_spread":0.27499504058907787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234761739","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062402524,0.7667844,0.110407576,0.012407587,0.013822852,0.0002667918,0.0024553353,0.0018124365,0.085802644],"genre_scores_gemma":[0.04125809,0.7440648,0.105897,0.0033454087,0.013175316,0.00039486235,0.004024089,0.00047632377,0.087364145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892896,0.0001495849,0.00012587028,0.00013331395,0.0005985621,0.00006372715],"domain_scores_gemma":[0.9968545,0.0016291958,0.00026712872,0.00023973825,0.0008524542,0.00015703926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121744,0.0010350099,0.0015313552,0.007004515,0.0005407597,0.0043160506,0.0014540448,0.0010956858,0.013604599],"category_scores_gemma":[0.006006766,0.00047072922,0.0008296406,0.017642332,0.0008199844,0.006868971,0.001485267,0.0020693678,0.007613129],"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.000050208648,0.00006873031,0.0008659609,0.0029376857,0.000075028445,0.00012141025,0.00014981475,0.0010832566,0.0012120375,0.0695618,0.10353758,0.8203365],"study_design_scores_gemma":[0.000023085622,0.00009219562,0.0016613598,0.0013486923,0.00012456355,0.00094686204,0.00032876342,0.009452394,0.0015499021,0.23851247,0.74591565,0.00004400935],"about_ca_topic_score_codex":0.0007533101,"about_ca_topic_score_gemma":0.0010369137,"teacher_disagreement_score":0.013604599,"about_ca_system_score_codex":0.000777921,"about_ca_system_score_gemma":0.001297636,"threshold_uncertainty_score":0.04551196},"labels":[],"label_agreement":null},{"id":"W4234959268","doi":"10.1007/978-3-319-60252-3","title":"Descriptional Complexity of Formal Systems","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","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 Prince Edward Island","funders":"","keywords":"Computer science; Formal methods; Formal system; Programming language; Software engineering","score_opus":0.05476019861187439,"score_gpt":0.2714581221125291,"score_spread":0.21669792350065473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234959268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12220365,0.014123513,0.59877205,0.016466713,0.0006528694,0.00013638783,0.0017992639,0.00063785736,0.24520773],"genre_scores_gemma":[0.89591473,0.0073954384,0.061499253,0.0007461477,0.001075859,0.00028848223,0.0017227547,0.0002820829,0.0310753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720746,0.0006018907,0.00018006566,0.00037631983,0.0014163424,0.00021797964],"domain_scores_gemma":[0.99438065,0.0038796787,0.0002697408,0.0006814615,0.00056072365,0.00022774102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426906,0.00078263436,0.0010779558,0.0022801915,0.0013674222,0.0065641096,0.0014617014,0.00097612984,0.007525368],"category_scores_gemma":[0.006846607,0.00080660224,0.0013206481,0.0026802092,0.004243688,0.012345166,0.003505227,0.0052385833,0.0008230853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000880773,0.000007293458,0.000100426754,0.00005494966,0.000008284954,0.00001627801,0.00012573435,0.0018765829,0.00015553732,0.98926485,0.0015570577,0.006824094],"study_design_scores_gemma":[0.0000025362206,0.00000266752,0.00005462047,0.000009128004,0.000003518072,0.000021685948,0.000025295405,0.0033773961,0.000086862085,0.99322414,0.0031879365,0.0000042209053],"about_ca_topic_score_codex":0.0011894205,"about_ca_topic_score_gemma":0.00075269694,"teacher_disagreement_score":0.007525368,"about_ca_system_score_codex":0.003970876,"about_ca_system_score_gemma":0.001178443,"threshold_uncertainty_score":0.028810859},"labels":[],"label_agreement":null},{"id":"W4234998342","doi":"10.1007/978-3-642-22362-4_18","title":"Modelling Symmetry of Activity as an Indicator of Collocated Group Collaboration","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scale (ratio); Exploit; Collaborative learning; Human–computer interaction; Key (lock); Group (periodic table); Data science; Knowledge management","score_opus":0.04973181216892903,"score_gpt":0.3460605175684366,"score_spread":0.29632870539950756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234998342","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.95143884,0.000037563917,0.046230428,0.000059939677,0.000013792031,0.00003960917,0.00035122267,0.00014384103,0.0016847405],"genre_scores_gemma":[0.99727374,0.0000064619285,0.0023913118,0.000002079006,0.0000025693212,0.000014686152,0.00013928386,0.000009383759,0.000160532],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.0006128052,0.00006736388,0.0002891671,0.00017959537,0.00015045391],"domain_scores_gemma":[0.974663,0.019112378,0.002478761,0.001930962,0.0009462973,0.00086861674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023971004,0.00032882337,0.0004721572,0.0011344105,0.00024368687,0.0014370019,0.0009914237,0.0008520347,0.0030266577],"category_scores_gemma":[0.025159305,0.0002725675,0.00070336525,0.0011026941,0.00071566744,0.0011597842,0.0010307035,0.0008042043,0.0005666547],"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.00268885,0.0006493825,0.598715,0.00017592593,0.00047372252,0.00045150015,0.0014377122,0.30872545,0.010898283,0.018778933,0.0011929618,0.055812232],"study_design_scores_gemma":[0.000036940433,0.00032320883,0.12247808,0.000018503584,0.000046265508,0.00017192542,0.00030904738,0.8629403,0.001969808,0.011466834,0.00020150308,0.000037545462],"about_ca_topic_score_codex":0.003723509,"about_ca_topic_score_gemma":0.0020170307,"teacher_disagreement_score":0.003723509,"about_ca_system_score_codex":0.00061327545,"about_ca_system_score_gemma":0.000584838,"threshold_uncertainty_score":0.012677252},"labels":[],"label_agreement":null},{"id":"W4235078688","doi":"10.1007/11687061_9","title":"abc : An Extensible AspectJ Compiler","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Computer science; Programming language; Polyglot; Aspect-oriented programming; Compiler; Modular design; Workbench; Syntax; Code generation; Software engineering; Software; Artificial intelligence; Operating system; Key (lock)","score_opus":0.034768223375661,"score_gpt":0.2806857056810714,"score_spread":0.24591748230541038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235078688","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.01958353,0.00072490197,0.8021667,0.0002724514,0.0006506134,0.000243119,0.0005759162,0.15281917,0.022963524],"genre_scores_gemma":[0.13876945,0.0009891536,0.7349494,0.0010196873,0.00028054844,0.00029458897,0.0033981553,0.08678446,0.033514563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911684,0.00007438852,0.00009537521,0.000120525205,0.00051373057,0.000079189864],"domain_scores_gemma":[0.99879384,0.00033202724,0.00008752304,0.00038627177,0.00033457967,0.00006575534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000904414,0.0010155874,0.0007301742,0.001144227,0.0004919429,0.0016859119,0.002130856,0.0010294317,0.007769203],"category_scores_gemma":[0.0029925627,0.0017803285,0.0009759487,0.0009974911,0.0005205282,0.0024269347,0.0015945012,0.0024500135,0.0044909357],"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.0007089936,0.00031482335,0.0030166125,0.0009126037,0.00017542455,0.00068949314,0.0007979381,0.008165892,0.08461409,0.0511202,0.10353178,0.745952],"study_design_scores_gemma":[0.00053068355,0.0002477848,0.0029863394,0.0003364305,0.0005744323,0.0024023538,0.00017372693,0.17536594,0.11559479,0.058232166,0.64331543,0.00023991129],"about_ca_topic_score_codex":0.001240897,"about_ca_topic_score_gemma":0.0024514953,"teacher_disagreement_score":0.007769203,"about_ca_system_score_codex":0.00032025523,"about_ca_system_score_gemma":0.0008037132,"threshold_uncertainty_score":0.025990546},"labels":[],"label_agreement":null},{"id":"W4235379383","doi":"10.1007/b101423","title":"Mobility Aware Technologies and Applications","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Telecommunications; Wireless; Mobile telephony; Computer network; Mobile radio","score_opus":0.010254110374715386,"score_gpt":0.23396334126570614,"score_spread":0.22370923089099076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235379383","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006641776,0.26885074,0.14911287,0.0035581868,0.0056225103,0.00018015502,0.00032462558,0.002053628,0.56365556],"genre_scores_gemma":[0.041973867,0.1938891,0.06397634,0.0014718521,0.0026295702,0.00027737135,0.000831399,0.00044589266,0.6945047],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983037,0.000023527065,0.000009134234,0.000026187954,0.000090015055,0.000020699039],"domain_scores_gemma":[0.9998491,0.00005430809,0.000010033961,0.00002874812,0.00003643132,0.000021359003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022201295,0.0009887886,0.0005379469,0.0011172215,0.00047929108,0.0021038323,0.00068999716,0.0009740902,0.01640538],"category_scores_gemma":[0.0005339172,0.00040469458,0.00028926838,0.0020976688,0.00045247344,0.0028102815,0.0011189661,0.0012226845,0.009823365],"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.000046335976,0.00008969974,0.00019599118,0.0006282397,0.000025526635,0.00024438297,0.00048494083,0.0019001082,0.009861953,0.15248166,0.14139406,0.69264704],"study_design_scores_gemma":[0.000005897105,0.00004023642,0.00034625793,0.00029412238,0.000018926032,0.00059565436,0.00011819726,0.0022322508,0.0011811792,0.04026526,0.95488495,0.0000170824],"about_ca_topic_score_codex":0.0004096413,"about_ca_topic_score_gemma":0.00072502164,"teacher_disagreement_score":0.01640538,"about_ca_system_score_codex":0.00034425783,"about_ca_system_score_gemma":0.0002886568,"threshold_uncertainty_score":0.054881454},"labels":[],"label_agreement":null},{"id":"W4235561823","doi":"10.1007/978-3-642-13544-6_32","title":"Interaction with a Virtual Character through Performance Based Animation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":"University of Alberta","funders":"","keywords":"Computer science; Character (mathematics); Animation; Character animation; Human–computer interaction; Natural (archaeology); Computer animation; Virtual machine; Multimedia; Virtual reality; Computer facial animation; Video game; Computer graphics (images)","score_opus":0.012767789147468595,"score_gpt":0.21667084872358316,"score_spread":0.20390305957611457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235561823","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.17073262,0.00089194166,0.605944,0.0005696092,0.00048432234,0.00025272186,0.00026073802,0.004928888,0.21593511],"genre_scores_gemma":[0.75322276,0.00095595536,0.11695006,0.00015729439,0.000115933384,0.00031375568,0.00045011568,0.0008354173,0.12699881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.000097246164,0.000009111692,0.000040712344,0.000089504014,0.000040852985],"domain_scores_gemma":[0.9997576,0.000121123725,0.000011891693,0.000036667472,0.000026008127,0.000046725952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030783404,0.0009177567,0.00043089048,0.00032964887,0.0006353253,0.0014101685,0.0009907929,0.0008635169,0.02099375],"category_scores_gemma":[0.0009798921,0.00027448818,0.0003542043,0.00026248698,0.00070501276,0.0012889212,0.0024547623,0.00064946053,0.002449128],"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.0012292117,0.00042935996,0.0019195942,0.0012504291,0.0001310058,0.0026385735,0.012343664,0.047756076,0.38877818,0.054218028,0.034021165,0.4552847],"study_design_scores_gemma":[0.0003228734,0.0019850787,0.013222548,0.0008289161,0.0003448359,0.00854405,0.0061447825,0.33880737,0.13807319,0.037152536,0.45419326,0.00038050025],"about_ca_topic_score_codex":0.0005305442,"about_ca_topic_score_gemma":0.00058217294,"teacher_disagreement_score":0.02099375,"about_ca_system_score_codex":0.00016858555,"about_ca_system_score_gemma":0.00013532606,"threshold_uncertainty_score":0.07023108},"labels":[],"label_agreement":null},{"id":"W4235894236","doi":"10.1007/978-3-540-89856-6_15","title":"Towards End-to-End Quality of Service: Controlling I/O Interference in Shared Storage Servers","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Quality of service; Operating system; Computer network; End user; Leverage (statistics); Database; Server farm; Distributed computing; Client–server model","score_opus":0.03403365839089718,"score_gpt":0.26985670659912436,"score_spread":0.2358230482082272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235894236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032685015,0.001875993,0.95850414,0.0004911901,0.00019172722,0.00003413944,0.000037387257,0.001276804,0.0049036313],"genre_scores_gemma":[0.85543513,0.0014631167,0.13691996,0.00036241385,0.00025583888,0.000049568585,0.00010000265,0.00029401135,0.005119897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990722,0.00017793661,0.000049241673,0.00016336996,0.00036149652,0.00017579316],"domain_scores_gemma":[0.9987031,0.00045489453,0.00011235381,0.00021278065,0.00042890495,0.00008779614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014296821,0.0011696072,0.0010539317,0.00030923655,0.0007042613,0.0029767177,0.0024069499,0.0012277715,0.0017216793],"category_scores_gemma":[0.0025102738,0.0004438184,0.00038384047,0.00065766554,0.0011756155,0.0028576877,0.0013805204,0.0024339072,0.0006032421],"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.00094277045,0.0004535873,0.0025044708,0.0005263141,0.00020158013,0.00028777015,0.00091250177,0.30510995,0.16024053,0.10293043,0.014135351,0.41175467],"study_design_scores_gemma":[0.000018324545,0.00012496475,0.00044230375,0.00003290102,0.000052239968,0.00012059429,0.00009857612,0.9221401,0.03452766,0.037621398,0.00478884,0.00003203712],"about_ca_topic_score_codex":0.001298149,"about_ca_topic_score_gemma":0.0014792919,"teacher_disagreement_score":0.0029767177,"about_ca_system_score_codex":0.0010599227,"about_ca_system_score_gemma":0.0006010159,"threshold_uncertainty_score":0.0076903105},"labels":[],"label_agreement":null},{"id":"W4235979983","doi":"10.1007/3-540-45491-8_63","title":"Accessible Digital Media","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Toronto Metropolitan University","funders":"","keywords":"NTSC; Digital television; Telecommunications; Computer science; European union; Transmission (telecommunications); Terrestrial television; Digital Revolution; Digital media; Process (computing); Multimedia; Digital broadcasting; World Wide Web; International trade; Business","score_opus":0.040749907002926446,"score_gpt":0.3035100438102257,"score_spread":0.26276013680729926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235979983","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.00082323735,0.0024801206,0.003999419,0.0007298165,0.00056257227,0.000026702564,0.00027691107,0.00044860368,0.99065256],"genre_scores_gemma":[0.0072063752,0.0037064226,0.0012518563,0.00028894292,0.00031665273,0.000025145788,0.0003235538,0.00016532133,0.98671585],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997465,0.000026772297,0.000009527785,0.000042958956,0.00014200658,0.000032151398],"domain_scores_gemma":[0.9996815,0.00007568923,0.000015277745,0.00008267441,0.00007468027,0.000070240036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025898856,0.0006987543,0.00034679953,0.0025846632,0.001189084,0.006204678,0.00081253384,0.0011775644,0.29863384],"category_scores_gemma":[0.0010163022,0.00028044457,0.00031942825,0.002559311,0.00085017114,0.007203616,0.0033866775,0.0012183835,0.11738284],"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.000036358964,0.00008405333,0.00020249853,0.00034812902,0.000006799194,0.00020151862,0.0010582817,0.00016315171,0.0023398548,0.18487667,0.31016335,0.50051934],"study_design_scores_gemma":[0.0000020398693,0.000009488785,0.0002521068,0.0001328806,0.000004042529,0.00015179015,0.00023561185,0.00009588141,0.00047495644,0.013208249,0.9854284,0.000004522869],"about_ca_topic_score_codex":0.0007198704,"about_ca_topic_score_gemma":0.0017871156,"teacher_disagreement_score":0.29863384,"about_ca_system_score_codex":0.0005573279,"about_ca_system_score_gemma":0.00053794845,"threshold_uncertainty_score":0.99902976},"labels":[],"label_agreement":null},{"id":"W4236020682","doi":"10.1007/978-3-642-21822-4_18","title":"Discovering Patterns for Prognostics: A Case Study in Prognostics of Train Wheels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"National Research Council Canada","funders":"","keywords":"Prognostics; Computer science; Data mining; Component (thermodynamics); Machine learning; Reliability engineering; Artificial intelligence; Engineering","score_opus":0.03743374576646853,"score_gpt":0.25871938893508106,"score_spread":0.22128564316861254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236020682","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.85026264,0.0014494859,0.13338247,0.0040604956,0.00011181265,0.00028823374,0.0023483676,0.00045931168,0.00763726],"genre_scores_gemma":[0.9513141,0.00044306472,0.044782188,0.0000820644,0.000028867322,0.000036558,0.00054129615,0.00003616763,0.0027355908],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99923813,0.0002949352,0.000064253465,0.00010426881,0.00022248509,0.00007596591],"domain_scores_gemma":[0.9914363,0.007005565,0.0003329624,0.00044361252,0.0005985689,0.00018290896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020207067,0.0005732455,0.00057197904,0.0010767012,0.0009094268,0.0013197573,0.0012559025,0.0023723803,0.0027543327],"category_scores_gemma":[0.0108155515,0.00030535067,0.0005856611,0.0022412508,0.000641245,0.0014560304,0.0008143767,0.0010274393,0.00036712378],"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.0018962796,0.0015197258,0.15261614,0.0013476774,0.0002395326,0.016907535,0.0051467903,0.27563325,0.0097661335,0.016314669,0.017805211,0.50080705],"study_design_scores_gemma":[0.00023884833,0.0009994663,0.056908827,0.00028829655,0.00023479573,0.006747006,0.007408313,0.84576,0.014796406,0.04445377,0.02201487,0.00014942385],"about_ca_topic_score_codex":0.007876923,"about_ca_topic_score_gemma":0.01173623,"teacher_disagreement_score":0.007876923,"about_ca_system_score_codex":0.00070736994,"about_ca_system_score_gemma":0.00079450395,"threshold_uncertainty_score":0.015662193},"labels":[],"label_agreement":null},{"id":"W4236057684","doi":"10.1007/978-3-540-87873-5_9","title":"JML4: Towards an Industrial Grade IVE for Java and Next Generation Research Platform for JML","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Java; Programming language; Java Modeling Language; Software engineering; Java annotation; Java applet","score_opus":0.22844208070376634,"score_gpt":0.34518733654241146,"score_spread":0.11674525583864512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236057684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075076963,0.00042804028,0.79959464,0.00083614414,0.0005947748,0.00039993724,0.0010749642,0.11677562,0.07278819],"genre_scores_gemma":[0.04978224,0.00059724564,0.63257,0.0011017821,0.00024842613,0.0005214257,0.006565672,0.07013657,0.23847666],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984091,0.00023455977,0.00012541449,0.0002318892,0.00078818307,0.00021093406],"domain_scores_gemma":[0.99854654,0.0003190805,0.00007896907,0.00041721744,0.00037646995,0.00026169763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026361647,0.0011742114,0.0007702862,0.0015908957,0.0006605164,0.0036454757,0.004302018,0.0020030758,0.042180773],"category_scores_gemma":[0.0048130103,0.0016099947,0.0013254225,0.00078902795,0.00082312565,0.0052151512,0.0035524839,0.0037907516,0.02606215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054549,0.0006287768,0.0010767176,0.0009855516,0.0000694644,0.00031678934,0.0010442615,0.003332039,0.11315719,0.08281493,0.19654751,0.5994812],"study_design_scores_gemma":[0.00019754459,0.00025008962,0.0009228831,0.00024883018,0.00006451526,0.00041944248,0.00009148217,0.025294347,0.06252772,0.026111757,0.8837565,0.000114865994],"about_ca_topic_score_codex":0.0014133852,"about_ca_topic_score_gemma":0.001696441,"teacher_disagreement_score":0.042180773,"about_ca_system_score_codex":0.0010163443,"about_ca_system_score_gemma":0.001641293,"threshold_uncertainty_score":0.14110875},"labels":[],"label_agreement":null},{"id":"W4237078454","doi":"10.1007/978-3-540-31484-4","title":"Web Engineering","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","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 British Columbia","funders":"","keywords":"Computer science; Web application; World Wide Web; Software engineering; Programming language","score_opus":0.008761247307133398,"score_gpt":0.22078304149052005,"score_spread":0.21202179418338665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237078454","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002696645,0.0031486289,0.075933464,0.002001649,0.0013847838,0.00013299858,0.00038712012,0.0034257667,0.9108889],"genre_scores_gemma":[0.015509371,0.0034754004,0.01616926,0.000633631,0.0003442706,0.00005515994,0.0007997458,0.0007928146,0.96222043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993606,0.000054274933,0.000022394132,0.00007505164,0.00044615782,0.00004152167],"domain_scores_gemma":[0.99945456,0.00008407649,0.000015406471,0.00020527841,0.00018358059,0.00005717106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004967933,0.000631032,0.00031730242,0.0016026953,0.0006192789,0.0030756297,0.0007933756,0.0009162897,0.10681873],"category_scores_gemma":[0.0014080944,0.00035049656,0.00034065335,0.001254086,0.00041284808,0.0030732653,0.0015174405,0.0012838831,0.07975069],"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.00002648422,0.00015626817,0.00021133586,0.00020494453,0.000006824386,0.0001530698,0.00017203273,0.0006796488,0.0051011397,0.08512114,0.21569607,0.6924711],"study_design_scores_gemma":[0.0000045793254,0.000017408223,0.0002843924,0.000088159395,0.0000046198124,0.0003094168,0.00006277784,0.0016698394,0.0041494276,0.025071353,0.96833044,0.0000074969016],"about_ca_topic_score_codex":0.00065251574,"about_ca_topic_score_gemma":0.001084009,"teacher_disagreement_score":0.10681873,"about_ca_system_score_codex":0.00048767834,"about_ca_system_score_gemma":0.00056319096,"threshold_uncertainty_score":0.35734427},"labels":[],"label_agreement":null},{"id":"W4237199268","doi":"10.1007/3-540-44977-9_6","title":"The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Unary operation; Combinatorics; Equivalence relation; Nondeterministic finite automaton; Upper and lower bounds; Cover (algebra); Mathematics; Quantum finite automata; Discrete mathematics; Finite-state machine; Alphabet; DFA minimization; Similarity (geometry); Automaton; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.011695310336480172,"score_gpt":0.2502640338655513,"score_spread":0.23856872352907113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237199268","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.85687095,0.0011737602,0.10384248,0.0024866639,0.00012193116,0.0001291244,0.0012383175,0.00047409863,0.033662606],"genre_scores_gemma":[0.96616125,0.0004062687,0.026400305,0.00017303054,0.00019000552,0.00017819602,0.0007738401,0.00010339922,0.005613626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606603,0.0009249124,0.00038752938,0.0010243775,0.0011303348,0.00046687096],"domain_scores_gemma":[0.96282554,0.028618969,0.0024815793,0.0027871134,0.0012567189,0.002030019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381784,0.0005269412,0.0019068897,0.0020208634,0.0028526739,0.005123566,0.0026951279,0.0027585367,0.008243915],"category_scores_gemma":[0.018037412,0.0012154666,0.001645832,0.0021737837,0.0042957827,0.010312854,0.002288439,0.0022045758,0.0007146714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010402583,0.0002208826,0.009014898,0.00052508817,0.00018643387,0.0002688222,0.0009404074,0.020875493,0.012177305,0.908823,0.0041141366,0.0418133],"study_design_scores_gemma":[0.00007282907,0.000090597496,0.0020565316,0.000037343318,0.0001030453,0.0005564576,0.00016552227,0.03943572,0.005409924,0.94911516,0.002915659,0.000041243617],"about_ca_topic_score_codex":0.00046461544,"about_ca_topic_score_gemma":0.00070425496,"teacher_disagreement_score":0.008243915,"about_ca_system_score_codex":0.0022242873,"about_ca_system_score_gemma":0.0011564564,"threshold_uncertainty_score":0.027578652},"labels":[],"label_agreement":null},{"id":"W4237236521","doi":"10.1007/10719619","title":"Intelligent Agents VI. Agent Theories, Architectures, and Languages","year":2000,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Intelligent agent; Programming language; Agent architecture; Artificial intelligence; Cognitive science","score_opus":0.014895793742313345,"score_gpt":0.26375599984667825,"score_spread":0.2488602061043649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237236521","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035720384,0.26072013,0.13960768,0.008265485,0.002948928,0.00013191823,0.0003360798,0.00072812993,0.58368963],"genre_scores_gemma":[0.15230614,0.1710577,0.13756157,0.003739606,0.003049195,0.00065822015,0.0010406385,0.0005541253,0.53003275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973756,0.00006560772,0.000026334834,0.000041683677,0.00010383199,0.000024990026],"domain_scores_gemma":[0.99970055,0.0001492632,0.000027709099,0.00003448032,0.00005558389,0.000032469794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039069567,0.0009759282,0.0008079454,0.0010819996,0.0007198742,0.0034542587,0.0009270895,0.001292197,0.01243976],"category_scores_gemma":[0.0010331923,0.00058182236,0.00044819593,0.0014120787,0.0017547765,0.0041501457,0.0010713077,0.0022141922,0.006397162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029054088,0.000026807495,0.00018472369,0.0005602056,0.000029359866,0.00009165011,0.00059143716,0.002101325,0.0007980546,0.79452395,0.078593835,0.12246957],"study_design_scores_gemma":[0.000009834892,0.000015380712,0.00018871138,0.0004898487,0.000022697492,0.00020074937,0.0002532738,0.0027689524,0.00048178315,0.45089433,0.5446633,0.000011190838],"about_ca_topic_score_codex":0.0010674777,"about_ca_topic_score_gemma":0.0013071159,"teacher_disagreement_score":0.01243976,"about_ca_system_score_codex":0.001112574,"about_ca_system_score_gemma":0.0010156212,"threshold_uncertainty_score":0.04161513},"labels":[],"label_agreement":null},{"id":"W4237407686","doi":"10.1007/3-540-36175-8_8","title":"Automatic Extraction of Clusters from Hierarchical Clustering Representations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":95,"is_retracted":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":"Computer science; Hierarchical clustering; Hierarchical clustering of networks; Cluster analysis; Single-linkage clustering; Reachability; Brown clustering; Data mining; Dendrogram; Complete-linkage clustering; Correlation clustering; Set (abstract data type); Representation (politics); Cluster (spacecraft); Canopy clustering algorithm; Artificial intelligence; Theoretical computer science","score_opus":0.026161983350778222,"score_gpt":0.31537102485687596,"score_spread":0.2892090415060977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237407686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017416434,0.0006932954,0.9639372,0.0002440693,0.00016051136,0.00036427067,0.0022551357,0.010726307,0.004202748],"genre_scores_gemma":[0.079262614,0.0004991587,0.90659076,0.00008752153,0.00008003434,0.0002818222,0.008277352,0.0013816415,0.003539172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985739,0.0002100516,0.00009631181,0.00039234495,0.00052333623,0.00020410474],"domain_scores_gemma":[0.99747604,0.000709982,0.0001892826,0.0004916275,0.0010276019,0.000105402476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937096,0.0017766461,0.0019747484,0.006144172,0.0015361096,0.0035880748,0.0027144717,0.0014980515,0.0056109834],"category_scores_gemma":[0.0062914877,0.0011976487,0.0019458929,0.0064450023,0.00077313435,0.0021658095,0.0025306935,0.0021045343,0.007067174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046364832,0.00016288685,0.002185713,0.00068686414,0.00018685599,0.00034474663,0.0007283212,0.017072508,0.036081966,0.015695563,0.04748762,0.87890327],"study_design_scores_gemma":[0.00018062063,0.00019087075,0.0069797053,0.0002989761,0.00049862056,0.0011402409,0.0012770147,0.77150625,0.04717517,0.10824301,0.062317193,0.00019242833],"about_ca_topic_score_codex":0.0055195615,"about_ca_topic_score_gemma":0.009911517,"teacher_disagreement_score":0.006144172,"about_ca_system_score_codex":0.0010109706,"about_ca_system_score_gemma":0.0020497767,"threshold_uncertainty_score":0.018770576},"labels":[],"label_agreement":null},{"id":"W4237615549","doi":"10.1007/3-540-44977-9_5","title":"Simulation of Gate Circuits in the Algebra of Transients","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"SIGNAL (programming language); Computer science; Binary number; State (computer science); Algorithm; Transient (computer programming); Electronic circuit; Word (group theory); Process (computing); Logic gate; Theoretical computer science; Arithmetic; Mathematics; Programming language; Electrical engineering; Engineering","score_opus":0.035443016791599315,"score_gpt":0.2878685339540906,"score_spread":0.2524255171624913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237615549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13425982,0.00031702244,0.82604057,0.00027301675,0.00012817814,0.000094966745,0.00018872943,0.001139301,0.03755836],"genre_scores_gemma":[0.9533864,0.00021179533,0.040055543,0.000048362097,0.000025569658,0.00007037167,0.00014309553,0.00010133859,0.005957423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958056,0.00016335817,0.000022348877,0.00006990544,0.00010699119,0.00005678223],"domain_scores_gemma":[0.9991486,0.00057668105,0.00005465314,0.00010811224,0.000065084314,0.000046867026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056860165,0.00041946492,0.0006882259,0.0003306542,0.00052489573,0.0012276202,0.001146563,0.0007499033,0.005437212],"category_scores_gemma":[0.001908702,0.00029671116,0.000832856,0.00043344902,0.0013526651,0.0016567215,0.0008155665,0.00086039095,0.00047448277],"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.00018391972,0.00005767632,0.00035724053,0.00007146603,0.000027525084,0.0001168356,0.00013313556,0.40054056,0.0067998995,0.5836472,0.00052339723,0.007541144],"study_design_scores_gemma":[0.000040476247,0.000048203576,0.00007047693,0.000010959642,0.000011575511,0.000037678645,0.000023979965,0.74753577,0.0048705065,0.24545841,0.0018808966,0.000011057109],"about_ca_topic_score_codex":0.0020502654,"about_ca_topic_score_gemma":0.0018194425,"teacher_disagreement_score":0.005437212,"about_ca_system_score_codex":0.0009046234,"about_ca_system_score_gemma":0.0008631488,"threshold_uncertainty_score":0.018189311},"labels":[],"label_agreement":null},{"id":"W4238204305","doi":"10.1007/978-3-642-33314-9","title":"Relational and Algebraic Methods in Computer Science","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Science and Mapping","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":"McMaster University","funders":"","keywords":"Computer science; Algebraic number; Algebra over a field; Theoretical computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.03889305186486651,"score_gpt":0.31642089794499706,"score_spread":0.27752784608013054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238204305","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037285392,0.15894683,0.33961838,0.0063846945,0.004943841,0.000087413646,0.0004494203,0.00083012274,0.4850108],"genre_scores_gemma":[0.111357324,0.14697883,0.24908164,0.0018406118,0.01027661,0.00035630388,0.0010576384,0.0010904479,0.4779606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992461,0.00015585488,0.000058924707,0.000103369646,0.0004032895,0.00003234494],"domain_scores_gemma":[0.9991216,0.0005503523,0.000033388143,0.00012466016,0.00013492919,0.000035040965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071610307,0.00095774734,0.0010282912,0.0022270437,0.0009401741,0.003633327,0.0009993727,0.0007053007,0.021716882],"category_scores_gemma":[0.0019895004,0.00053207687,0.0006670436,0.0047599482,0.0027242778,0.0074556908,0.0012511571,0.002478619,0.006887267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005187375,0.000012221906,0.000038609025,0.00029782165,0.0000102219865,0.000019626934,0.0002022565,0.00052932644,0.00028938332,0.88699424,0.035104882,0.076496184],"study_design_scores_gemma":[0.000006132561,0.000009142074,0.000116291405,0.000112700494,0.000010855819,0.00014126793,0.00006549432,0.0014407515,0.00019808093,0.691481,0.30640844,0.000009758341],"about_ca_topic_score_codex":0.0009893139,"about_ca_topic_score_gemma":0.0013883692,"teacher_disagreement_score":0.021716882,"about_ca_system_score_codex":0.0014365147,"about_ca_system_score_gemma":0.0010149083,"threshold_uncertainty_score":0.072650254},"labels":[],"label_agreement":null},{"id":"W4238366930","doi":"10.1007/3-540-40011-7_2","title":"On the Extension of UML with Use Case Maps Concepts","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Mitel (Canada); University of Ottawa","funders":"","keywords":"Computer science; Unified Modeling Language; Notation; Programming language; Applications of UML; Abstraction; Semantics (computer science); Class diagram; Bridging (networking); Component (thermodynamics); Software engineering; Software","score_opus":0.0437506566886111,"score_gpt":0.2821385289714918,"score_spread":0.23838787228288066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238366930","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.014322722,0.0027828217,0.91316336,0.0019277299,0.00032966334,0.00012327344,0.000103630686,0.0010655244,0.0661813],"genre_scores_gemma":[0.24685219,0.0066182534,0.7077895,0.0008699646,0.000522221,0.0002975561,0.0005654104,0.0009028261,0.03558208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737287,0.0012730444,0.00018131807,0.00024070436,0.00078474014,0.00014732455],"domain_scores_gemma":[0.9960179,0.0025779642,0.00018959785,0.00073481427,0.00037154646,0.000108182496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042725247,0.0009444499,0.000513392,0.0019061929,0.0010767023,0.0032778427,0.0018945534,0.0013334862,0.0054757935],"category_scores_gemma":[0.007619915,0.0010471122,0.0011031406,0.0025973134,0.0028852783,0.00999527,0.003882833,0.0028635033,0.0011533811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005947242,0.00006923546,0.00036297203,0.00015892954,0.000019221483,0.00041966006,0.0020393154,0.0044996766,0.0022371518,0.8142154,0.0048247697,0.17109415],"study_design_scores_gemma":[0.000025683692,0.000050936666,0.00056006,0.0004505065,0.00006429241,0.00074046676,0.00033176446,0.026954876,0.0034061957,0.74327743,0.22409192,0.00004582606],"about_ca_topic_score_codex":0.0032772585,"about_ca_topic_score_gemma":0.0037197766,"teacher_disagreement_score":0.0054757935,"about_ca_system_score_codex":0.0010873035,"about_ca_system_score_gemma":0.0008924532,"threshold_uncertainty_score":0.022595525},"labels":[],"label_agreement":null},{"id":"W4238710876","doi":"10.1007/3-540-36175-8_33","title":"Position Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; Prefix; Tree (set theory); Trie; Fractal tree index; Suffix tree; Node (physics); Binary tree; Preorder; Suffix; Web log analysis software; Data mining; Tree structure; Theoretical computer science; Algorithm; Web server; Interval tree; Data structure; World Wide Web; Combinatorics; Mathematics; The Internet; Discrete mathematics; Operating system","score_opus":0.02219605984107578,"score_gpt":0.26807849165285247,"score_spread":0.24588243181177669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238710876","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.051755555,0.0003401082,0.9282742,0.00019266854,0.00015129536,0.00034070766,0.004077212,0.011865873,0.0030023635],"genre_scores_gemma":[0.21623501,0.00017112293,0.770273,0.00009677984,0.000048323305,0.00036408682,0.0077761197,0.00041387885,0.0046216394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955934,0.000069351765,0.000060464536,0.00008041026,0.00017923611,0.000051217023],"domain_scores_gemma":[0.9981413,0.00065915956,0.00008131935,0.0005109091,0.00052091235,0.0000864612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058493443,0.00036077315,0.0006060468,0.0017375544,0.00070414925,0.0010367552,0.001515479,0.00081438484,0.0055499272],"category_scores_gemma":[0.0048478013,0.00032766926,0.00047011985,0.0027476312,0.0002970171,0.001165223,0.0007533894,0.00090531324,0.0020470766],"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.001032757,0.00036027527,0.0036902146,0.00032060145,0.00005260461,0.00038789152,0.000190024,0.048232827,0.0152332615,0.012946425,0.02006378,0.8974893],"study_design_scores_gemma":[0.00011793745,0.00026724164,0.0019953107,0.00007420848,0.0000564234,0.00037430273,0.00013897037,0.9293905,0.017416487,0.03449129,0.015634682,0.000042676573],"about_ca_topic_score_codex":0.0044148955,"about_ca_topic_score_gemma":0.007352376,"teacher_disagreement_score":0.0055499272,"about_ca_system_score_codex":0.0004316385,"about_ca_system_score_gemma":0.0015115495,"threshold_uncertainty_score":0.01856637},"labels":[],"label_agreement":null},{"id":"W4238854784","doi":"10.1007/978-3-642-44949-9","title":"Multi-disciplinary Trends in Artificial Intelligence","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Saint Mary's University; University of Winnipeg","funders":"Indian Institute of Technology Indore; University of Hyderabad; Jawaharlal Nehru Technological University Hyderabad; Southeast University; Yeungnam University; Technische Universität Clausthal; Indian Institute of Technology Delhi; King Mongkut's Institute of Technology Ladkrabang; University of Crete; Universität Trier; Commonwealth Scientific and Industrial Research Organisation; Technische Universität Darmstadt; Purdue University; Centre National de la Recherche Scientifique; Thammasat University; Indian Institute of Science; Université du Luxembourg","keywords":"Discipline; Computer science; Artificial intelligence; Social science; Sociology","score_opus":0.0446468636590377,"score_gpt":0.2975143364681765,"score_spread":0.2528674728091388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238854784","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044908198,0.5613049,0.017448097,0.033635836,0.009164242,0.00004198838,0.00009994714,0.00018727065,0.3736268],"genre_scores_gemma":[0.122533865,0.57457745,0.035851605,0.01106679,0.021338124,0.00021917198,0.00044801141,0.00031803566,0.23364693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.00029443475,0.00011442608,0.000150163,0.00064555026,0.00009058238],"domain_scores_gemma":[0.99694747,0.0014780452,0.00019271682,0.00032961738,0.00060889154,0.00044326964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020233854,0.0007560347,0.000727098,0.0033422748,0.0009541969,0.007337056,0.0011314324,0.0015214954,0.014865891],"category_scores_gemma":[0.0033654782,0.0003770992,0.00055149297,0.007070973,0.0030377035,0.00929746,0.0033315592,0.0037849,0.0045875534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003231085,0.000092885675,0.0005566228,0.0014126352,0.000035597433,0.000089449015,0.0008136507,0.00060204644,0.00073845993,0.48082927,0.09688542,0.41791165],"study_design_scores_gemma":[0.000008156528,0.000035210454,0.0012092934,0.00081261666,0.000013698228,0.0003577277,0.00056296634,0.0011409466,0.0001993937,0.2605733,0.7350748,0.000011808724],"about_ca_topic_score_codex":0.00045501455,"about_ca_topic_score_gemma":0.0014473909,"teacher_disagreement_score":0.014865891,"about_ca_system_score_codex":0.001984963,"about_ca_system_score_gemma":0.0025421493,"threshold_uncertainty_score":0.049731433},"labels":[],"label_agreement":null},{"id":"W4239060830","doi":"10.1007/978-3-540-75209-7_44","title":"Model-Based Design of Computer-Controlled Game Character Behavior","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University","funders":"","keywords":"Computer science; Formalism (music); Slicing; Programming language; Game programming; Abstraction; Game design; Theoretical computer science; Game Developer; Human–computer interaction; Distributed computing; Computer graphics (images); Game design document","score_opus":0.034807113074292635,"score_gpt":0.26277461925584555,"score_spread":0.22796750618155293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239060830","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.025322603,0.000056595945,0.9663677,0.00010309989,0.000039260183,0.00033942756,0.000049937935,0.00069896365,0.007022426],"genre_scores_gemma":[0.83575207,0.00007574362,0.15883641,0.000058240486,0.000009907734,0.000787748,0.000077685196,0.00012402085,0.0042782947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992773,0.00031256178,0.000027314494,0.00011305295,0.00020145433,0.00006840862],"domain_scores_gemma":[0.99861026,0.00083572813,0.000103082624,0.00010731007,0.00029263578,0.000050940573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445676,0.00069759384,0.00058998936,0.00036318804,0.00042386254,0.0011390721,0.0017334851,0.0009576816,0.0053801336],"category_scores_gemma":[0.0035519453,0.0005906124,0.0006243182,0.00015397984,0.0008523063,0.0006230524,0.00075427303,0.0008255832,0.0004151626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015294741,0.00015026116,0.0004312601,0.00012859641,0.000041578405,0.000055716162,0.00017934955,0.9474035,0.005217775,0.02896038,0.00043960178,0.016839089],"study_design_scores_gemma":[0.000026293386,0.000041618146,0.000072969924,0.000004684744,0.000009279607,0.0000066009743,0.0000071907,0.99600923,0.00090307865,0.0024440116,0.0004712971,0.0000037851876],"about_ca_topic_score_codex":0.0056863897,"about_ca_topic_score_gemma":0.006288549,"teacher_disagreement_score":0.0056863897,"about_ca_system_score_codex":0.0013348548,"about_ca_system_score_gemma":0.0013558599,"threshold_uncertainty_score":0.017998278},"labels":[],"label_agreement":null},{"id":"W4239061549","doi":"10.1007/978-3-642-24485-8_10","title":"Aspect-Oriented Modelling for Distributed Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Distributed computing; Node (physics); MODELLER; Aspect-oriented programming; Programming language; Engineering; Software","score_opus":0.05861922604520475,"score_gpt":0.271629143193649,"score_spread":0.21300991714844425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239061549","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.0018548999,0.001816434,0.98220325,0.0002932708,0.00009666269,0.000069355665,0.000083958614,0.0009938905,0.012588233],"genre_scores_gemma":[0.09812966,0.009058937,0.86391264,0.0002629875,0.00025984034,0.00039696734,0.0010322619,0.0014699971,0.025476782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918884,0.00020685296,0.00008360931,0.000099187055,0.00037200007,0.000049505095],"domain_scores_gemma":[0.99945384,0.00023801389,0.000044842644,0.00015727348,0.00008125989,0.000024858304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204217,0.0014291533,0.000853985,0.0006908015,0.00049110915,0.002504436,0.0018796087,0.0011315537,0.00341813],"category_scores_gemma":[0.0019321155,0.0010953065,0.0012449952,0.0012997363,0.00097210985,0.0029607927,0.0010604995,0.0028802399,0.001707683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042921056,0.00007913204,0.0002709589,0.00070196186,0.00006366472,0.00030343296,0.0008836784,0.0635735,0.0061617205,0.7352364,0.010508974,0.18217362],"study_design_scores_gemma":[0.000040046325,0.000039709605,0.00019872043,0.00034419098,0.000079483274,0.0005202286,0.00009660885,0.17360245,0.0039512007,0.5853642,0.23573144,0.000031608335],"about_ca_topic_score_codex":0.0015681925,"about_ca_topic_score_gemma":0.0018933581,"teacher_disagreement_score":0.00341813,"about_ca_system_score_codex":0.0006256713,"about_ca_system_score_gemma":0.00078393164,"threshold_uncertainty_score":0.011434734},"labels":[],"label_agreement":null},{"id":"W4239208506","doi":"10.1007/978-3-642-21827-9_8","title":"Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Probabilistic logic; Formalism (music); Model checking; Exploit; Markov chain; Epistemic modal logic; Modal logic; Theoretical computer science; Probabilistic CTL; Temporal logic; Modal; Markov decision process; Artificial intelligence; Algorithm; Markov process; Machine learning; Description logic; Probabilistic analysis of algorithms; Multimodal logic; Mathematics","score_opus":0.10375025140732115,"score_gpt":0.2722667960767132,"score_spread":0.1685165446693921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239208506","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.063287124,0.00034321754,0.92965734,0.00032904433,0.00006170603,0.00008629879,0.000105409476,0.0012510018,0.0048788777],"genre_scores_gemma":[0.8882541,0.0002575904,0.10912426,0.000066846274,0.00006165936,0.000113244976,0.000166068,0.00020025646,0.0017558949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944864,0.0018959306,0.00034915959,0.0006438554,0.0022169387,0.00040778614],"domain_scores_gemma":[0.97902805,0.016245404,0.0011518669,0.0024840776,0.00089625636,0.00019436194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005061886,0.0008698666,0.0011269415,0.0009971205,0.00080595264,0.0033401628,0.002648365,0.0017555208,0.0024049731],"category_scores_gemma":[0.022497213,0.0010994169,0.002199954,0.000841663,0.0031099454,0.006109364,0.0026579,0.0031527728,0.0003122024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005124729,0.00014668207,0.0020349284,0.00036114268,0.00019848808,0.00038637136,0.00042156354,0.556356,0.0111919185,0.38025874,0.00086580054,0.047265857],"study_design_scores_gemma":[0.000039021208,0.000039762384,0.00019696922,0.000024413377,0.000040756247,0.00007234976,0.000024680807,0.79471827,0.007619543,0.19639651,0.0008112768,0.000016397214],"about_ca_topic_score_codex":0.0020233826,"about_ca_topic_score_gemma":0.0025112282,"teacher_disagreement_score":0.005061886,"about_ca_system_score_codex":0.0015776332,"about_ca_system_score_gemma":0.0015122591,"threshold_uncertainty_score":0.026770115},"labels":[],"label_agreement":null},{"id":"W4239405777","doi":"10.1007/978-3-540-76778-7_17","title":"Consistent and Scalable Cache Replication for Multi-tier J2EE Applications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Replication (statistics); Cache; Quality of service; Protocol (science); Benchmark (surveying); Distributed computing; Computer network; High availability; Database","score_opus":0.04869352010582008,"score_gpt":0.2996462552106217,"score_spread":0.25095273510480165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239405777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11311376,0.0037669486,0.85882586,0.00092310796,0.00049108773,0.00021857322,0.0004143292,0.0077099516,0.014536432],"genre_scores_gemma":[0.75525934,0.00095061236,0.22799292,0.00015517705,0.00018788569,0.00013801892,0.0007955338,0.0006357352,0.013884727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920636,0.0001406883,0.00006315632,0.000103418584,0.00036068002,0.00012578917],"domain_scores_gemma":[0.99816126,0.00030897843,0.000083593775,0.00084959384,0.0005079087,0.00008871294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512753,0.0004924881,0.0006490561,0.0004707526,0.0012925399,0.0017865467,0.0023050022,0.0008875664,0.0023454542],"category_scores_gemma":[0.0029060373,0.00055138493,0.0003483702,0.0012569214,0.00044083607,0.0022892156,0.0014818318,0.0011147169,0.00073019747],"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.0012482543,0.0004711882,0.003961082,0.00047857637,0.00019755853,0.00079178973,0.0006721895,0.15169282,0.1602867,0.05640439,0.052449998,0.5713454],"study_design_scores_gemma":[0.00012380209,0.00020641818,0.0014764393,0.000031562562,0.000088197754,0.000539394,0.00023440422,0.88139075,0.05703439,0.035172272,0.023626195,0.000076288765],"about_ca_topic_score_codex":0.0032926772,"about_ca_topic_score_gemma":0.007825913,"teacher_disagreement_score":0.0032926772,"about_ca_system_score_codex":0.00058900274,"about_ca_system_score_gemma":0.001154941,"threshold_uncertainty_score":0.007846296},"labels":[],"label_agreement":null},{"id":"W4239454488","doi":"10.1007/978-3-642-24606-7_33","title":"Strategic Models for Business Intelligence","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Ottawa; University of Toronto","funders":"","keywords":"Computer science; Business rule; Business intelligence; Artifact-centric business process model; Knowledge management; Key (lock); Business process modeling; Semantics of Business Vocabulary and Business Rules; Management science; Process management; Business process; Business; Computer security; Engineering","score_opus":0.12353023178943434,"score_gpt":0.29971109890338055,"score_spread":0.1761808671139462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239454488","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.0067918366,0.010881218,0.35635006,0.016342783,0.0010034922,0.00009433222,0.00032173624,0.0004050129,0.60780954],"genre_scores_gemma":[0.7000152,0.015140311,0.107372195,0.0024972034,0.0013294998,0.0005289635,0.00102638,0.00035155474,0.17173879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989812,0.00050226867,0.00005212932,0.00009600337,0.00027975623,0.00008863117],"domain_scores_gemma":[0.99929273,0.00033990285,0.00006432583,0.00011178286,0.00012040843,0.00007074566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012350025,0.0016812194,0.0007503562,0.0017420871,0.001135084,0.005937598,0.0012074129,0.0019660008,0.015563778],"category_scores_gemma":[0.0022021397,0.00062385545,0.0008908966,0.0029471572,0.003737032,0.008194333,0.0017014124,0.003138641,0.0035904062],"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.0000015634546,0.0000048399515,0.000013041773,0.000017099166,0.0000030922645,0.0000072573034,0.000051775198,0.00091095804,0.000017475902,0.9923028,0.0025764094,0.0040937327],"study_design_scores_gemma":[0.000002149326,0.0000020936425,0.000009263008,0.000014377563,0.0000021133799,0.000007969784,0.00003642771,0.0021568509,0.000015925883,0.9860541,0.011696801,0.0000018411091],"about_ca_topic_score_codex":0.0029144194,"about_ca_topic_score_gemma":0.0034147806,"teacher_disagreement_score":0.015563778,"about_ca_system_score_codex":0.0037049043,"about_ca_system_score_gemma":0.0021067255,"threshold_uncertainty_score":0.052066028},"labels":[],"label_agreement":null},{"id":"W4239499741","doi":"10.1007/978-3-540-37275-2_79","title":"Intelligent Process Trend Recognition Fault Diagnosis and Industrial Application","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","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 Alberta","funders":"","keywords":"Computer science; Hidden Markov model; Process (computing); Artificial intelligence; Fault (geology); Representation (politics); Fault detection and isolation; Pattern recognition (psychology); Wavelet transform; Intelligent decision support system; Wavelet; Machine learning; Data mining","score_opus":0.021872149112018815,"score_gpt":0.2357066637488149,"score_spread":0.2138345146367961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239499741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018608166,0.005074942,0.95788246,0.00033944656,0.00033005566,0.000051076335,0.00010839973,0.004177584,0.013427805],"genre_scores_gemma":[0.42407468,0.0085833585,0.5056784,0.00021257857,0.00041712634,0.00008448674,0.00055863865,0.00044027372,0.059950467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998111,0.000012525898,0.000012820764,0.000044549543,0.00010158685,0.000017402432],"domain_scores_gemma":[0.9997129,0.00009325886,0.000029148228,0.00003792542,0.00011889387,0.000007824913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027418163,0.0005604145,0.0006946904,0.001010595,0.00020183784,0.0007498537,0.0007567717,0.0008104742,0.0040621087],"category_scores_gemma":[0.0007070431,0.000399254,0.00047830364,0.0013108567,0.00033425025,0.0009838463,0.00027947273,0.0005884475,0.0018224934],"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.00013721004,0.000044424924,0.0005422931,0.0002324687,0.000027061942,0.00013353577,0.0000722569,0.014409064,0.04683771,0.006881346,0.006401995,0.9242806],"study_design_scores_gemma":[0.00003505033,0.00049088517,0.0045252335,0.000099685254,0.00019256883,0.0013433422,0.000079779464,0.70959777,0.17657384,0.02798039,0.079016484,0.0000649095],"about_ca_topic_score_codex":0.00077558646,"about_ca_topic_score_gemma":0.00078351866,"teacher_disagreement_score":0.0040621087,"about_ca_system_score_codex":0.00028179915,"about_ca_system_score_gemma":0.00021612595,"threshold_uncertainty_score":0.013589144},"labels":[],"label_agreement":null},{"id":"W4239552899","doi":"10.1007/11548706","title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Granular computing; Rough set; Data mining; Fuzzy set; Fuzzy logic; Artificial intelligence","score_opus":0.03111439390510311,"score_gpt":0.27425807276313185,"score_spread":0.24314367885802873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239552899","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.012860483,0.3761404,0.53045964,0.008510441,0.002298427,0.00016711967,0.0006960019,0.0005988279,0.06826868],"genre_scores_gemma":[0.29522365,0.2211234,0.45280704,0.0019445466,0.0047216807,0.0004458842,0.001336955,0.00013388834,0.022263043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981173,0.0004964529,0.00018163989,0.00021431434,0.0009166757,0.0000735844],"domain_scores_gemma":[0.9978023,0.0015880005,0.00019950152,0.00019975225,0.00015346738,0.000057004087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002236182,0.0012002918,0.0026963197,0.0032243396,0.00060999586,0.0052594324,0.0011534787,0.0013184727,0.0032339827],"category_scores_gemma":[0.005957055,0.00067651016,0.0010783174,0.0076460475,0.0032923487,0.005449536,0.0013077292,0.002498681,0.0008967679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006735637,0.000053714495,0.00057871913,0.0015930317,0.00014548657,0.0001960086,0.00041627506,0.014197913,0.00079600216,0.76538354,0.019821208,0.19675072],"study_design_scores_gemma":[0.000010845507,0.000022783064,0.00039946134,0.00018952446,0.000035882807,0.0001788397,0.00013158009,0.01077996,0.00019888816,0.9607557,0.027272537,0.000023953899],"about_ca_topic_score_codex":0.0012372732,"about_ca_topic_score_gemma":0.0012702444,"teacher_disagreement_score":0.0052594324,"about_ca_system_score_codex":0.001095499,"about_ca_system_score_gemma":0.00086689857,"threshold_uncertainty_score":0.011826217},"labels":[],"label_agreement":null},{"id":"W4239711818","doi":"10.1007/978-3-319-14115-2_31","title":"Linear Arrangement Problems and Interval Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Bounding overwatch; Interval (graph theory); Indifference graph; Interval graph; Combinatorics; Mathematics; Upper and lower bounds; Chordal graph; Discrete mathematics; Pathwidth; Focus (optics); Computer science; 1-planar graph; Graph; Line graph; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.025509850149295066,"score_gpt":0.24055500380338335,"score_spread":0.21504515365408827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239711818","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047136776,0.032086786,0.39365312,0.006930121,0.0016738937,0.00014397554,0.00084735773,0.0006331231,0.5168949],"genre_scores_gemma":[0.51045513,0.052219365,0.24080019,0.0017021913,0.00540362,0.00059875206,0.0038869276,0.00056034856,0.1843734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942756,0.00018395855,0.000028349097,0.00012820913,0.00016704107,0.00006493067],"domain_scores_gemma":[0.99896765,0.000678307,0.00009926635,0.00011464692,0.00007969933,0.00006041497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056811544,0.0009270002,0.00079931546,0.00096534,0.0009891975,0.002743233,0.0018711345,0.0013494189,0.016452666],"category_scores_gemma":[0.002389827,0.00062099914,0.00071583013,0.004118831,0.0016953851,0.0051164813,0.0012938787,0.004298759,0.002979929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033861055,0.00006227437,0.00010359358,0.00028499964,0.000013170371,0.000060821345,0.00014016265,0.008273075,0.0005297119,0.8921389,0.027611217,0.070748195],"study_design_scores_gemma":[0.000012738426,0.000012940508,0.00009342381,0.000047517493,0.0000067687533,0.00009128742,0.000088410394,0.0053120735,0.00017300608,0.9710244,0.023128742,0.000008704797],"about_ca_topic_score_codex":0.0007248845,"about_ca_topic_score_gemma":0.0006501814,"teacher_disagreement_score":0.016452666,"about_ca_system_score_codex":0.0012400369,"about_ca_system_score_gemma":0.00043691188,"threshold_uncertainty_score":0.055039644},"labels":[],"label_agreement":null},{"id":"W4239741176","doi":"10.1007/3-540-44977-9_8","title":"Prime Decompositions of Regular Prefix Codes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Université du Québec en Outaouais","funders":"","keywords":"Prefix; Prefix code; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Linear code; Combinatorics; Programming language; Block code; Decoding methods","score_opus":0.011576820774909497,"score_gpt":0.2315566761640496,"score_spread":0.2199798553891401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239741176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27253228,0.002912828,0.43751618,0.0015003617,0.0007113317,0.00018836427,0.0007678248,0.00063929526,0.28323156],"genre_scores_gemma":[0.7369312,0.003080526,0.13247998,0.0005569737,0.0008191162,0.0002489188,0.0010727055,0.0005524564,0.12425818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995772,0.00008638516,0.00002324648,0.00006779207,0.00016701972,0.000078359066],"domain_scores_gemma":[0.9992248,0.00031122117,0.00008241736,0.00014990098,0.00012637346,0.00010531212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005880363,0.0005909225,0.00063254096,0.001631212,0.00096688274,0.0021154003,0.00050436286,0.0004873094,0.007497051],"category_scores_gemma":[0.001906287,0.0004926503,0.00061147026,0.0014053101,0.0016902358,0.0026618063,0.0013902428,0.002032101,0.0018469881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029755773,0.000009764933,0.00006089752,0.000020416428,0.0000026881112,0.00003078414,0.00011177506,0.00079683756,0.00075350696,0.9846428,0.0015682383,0.01197263],"study_design_scores_gemma":[0.0000070869937,0.000011950154,0.00006480401,0.000009546111,0.0000039586007,0.0000737628,0.000027121689,0.0024657717,0.0005493541,0.9911663,0.0056144632,0.000005919192],"about_ca_topic_score_codex":0.00040279998,"about_ca_topic_score_gemma":0.0004117274,"teacher_disagreement_score":0.007497051,"about_ca_system_score_codex":0.0009132579,"about_ca_system_score_gemma":0.0006472635,"threshold_uncertainty_score":0.025080085},"labels":[],"label_agreement":null},{"id":"W4239785813","doi":"10.1007/978-3-319-18356-5_2","title":"Darwinian Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Simple (philosophy); Inference; Bayesian network; Darwinism; Artificial intelligence; Theoretical computer science; Biology; Epistemology; Evolutionary biology","score_opus":0.037679688686674755,"score_gpt":0.2653256151345582,"score_spread":0.22764592644788345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239785813","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028256409,0.0032953315,0.36202782,0.0050954474,0.00068448903,0.00007249331,0.0006947597,0.0004353247,0.5994379],"genre_scores_gemma":[0.5870429,0.006632961,0.08537076,0.0011786692,0.00086370594,0.00028739817,0.0011861414,0.0005190587,0.3169184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998342,0.00004272978,0.0000057367765,0.00005032604,0.00005382277,0.000013197424],"domain_scores_gemma":[0.99961346,0.00018644235,0.000030258467,0.00006980608,0.000064980166,0.000035105055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031032902,0.00029809598,0.00031292654,0.00073461526,0.00060594146,0.0011318922,0.00057063974,0.0007835399,0.016907493],"category_scores_gemma":[0.0019834389,0.00022076437,0.0002807185,0.0005812908,0.0010453361,0.0019090852,0.00094014406,0.0011719816,0.0020189034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003227083,0.000002581969,0.00007174001,0.00002120576,0.000005255741,0.000013863405,0.000037881702,0.004298606,0.00019946111,0.97553027,0.0045619477,0.015254074],"study_design_scores_gemma":[0.0000016556745,0.0000020780521,0.00009350726,0.000009164625,0.0000025262182,0.000028964023,0.000010924357,0.007659972,0.00012587997,0.96766424,0.024398034,0.000002991918],"about_ca_topic_score_codex":0.00084782747,"about_ca_topic_score_gemma":0.0008340903,"teacher_disagreement_score":0.016907493,"about_ca_system_score_codex":0.00096568326,"about_ca_system_score_gemma":0.000372834,"threshold_uncertainty_score":0.056561172},"labels":[],"label_agreement":null},{"id":"W4240005132","doi":"10.1007/3-540-45327-x_103","title":"McGill RedDogs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01105456716852928,"score_gpt":0.20168878932783948,"score_spread":0.1906342221593102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240005132","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.0005326327,0.0033196544,0.0052873115,0.0013687301,0.00081770134,0.00006296968,0.0020316641,0.003753444,0.98282593],"genre_scores_gemma":[0.000793395,0.0007128641,0.0009807725,0.00019797351,0.00003744767,0.000015049537,0.0004059353,0.00041418962,0.9964424],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996331,0.00003089279,0.00001046627,0.00008446106,0.00018987888,0.000051259794],"domain_scores_gemma":[0.9992465,0.00008753748,0.000027944048,0.00014938448,0.0002834984,0.0002050903],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004963327,0.0016400011,0.0007517174,0.002347479,0.0013562372,0.0029520153,0.0016460826,0.001099019,0.64342016],"category_scores_gemma":[0.0011402956,0.000671235,0.00047734394,0.0019305054,0.00045761836,0.0020240394,0.001915849,0.0013318058,0.44913074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003394463,0.000020173555,0.00007561487,0.00007842461,0.0000026231064,0.000048685702,0.000050023682,0.00013009316,0.0005757608,0.0059434148,0.76329416,0.22974715],"study_design_scores_gemma":[0.0000035825908,0.0000071069576,0.00015639573,0.000032311036,0.0000022117574,0.000034408444,0.000028301316,0.00007320752,0.0002082384,0.00096887926,0.99848074,0.000004671711],"about_ca_topic_score_codex":0.024905704,"about_ca_topic_score_gemma":0.09693862,"teacher_disagreement_score":0.64342016,"about_ca_system_score_codex":0.0014147554,"about_ca_system_score_gemma":0.0016908202,"threshold_uncertainty_score":0.5086179},"labels":[],"label_agreement":null},{"id":"W4240051959","doi":"10.1007/978-3-642-22362-4_36","title":"User Perceptions of Adaptivity in an Interactive Narrative","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Simon Fraser University","funders":"","keywords":"Computer science; Narrative; Perception; Wearable computer; Human–computer interaction; Reading (process); User interface; Multimedia; User experience design; User satisfaction; World Wide Web; Psychology","score_opus":0.02917191997602899,"score_gpt":0.29168469328277685,"score_spread":0.2625127733067479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240051959","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.9890449,0.00014254282,0.0019727945,0.00008565544,0.0000107017595,0.00004233657,0.000036670222,0.000074834505,0.008589594],"genre_scores_gemma":[0.99741,0.00007298194,0.0010205789,0.000030668944,0.000004770157,0.000030313462,0.000041814827,0.000028737073,0.001360238],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99825937,0.0009686645,0.00009478298,0.00014968704,0.00040131327,0.00012625172],"domain_scores_gemma":[0.98664224,0.010046454,0.0011184423,0.00051122915,0.00089474226,0.0007869903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024259514,0.00040245012,0.00026615363,0.0007430876,0.0009957289,0.0042005223,0.0006143024,0.0008935925,0.005459215],"category_scores_gemma":[0.022117414,0.00032313168,0.0004065512,0.00034740113,0.00085772417,0.0026004903,0.0017845028,0.0007460453,0.00045204605],"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.0030594503,0.00054645847,0.098758295,0.000693643,0.000214434,0.0016625887,0.7919788,0.0013963298,0.0453201,0.0041556773,0.0017461065,0.05046814],"study_design_scores_gemma":[0.00023351786,0.0038192505,0.36448687,0.00046316994,0.0005801798,0.0036155987,0.5676041,0.011732423,0.013818122,0.0044816746,0.028723696,0.00044143098],"about_ca_topic_score_codex":0.0019004289,"about_ca_topic_score_gemma":0.0015931065,"teacher_disagreement_score":0.005459215,"about_ca_system_score_codex":0.00051122427,"about_ca_system_score_gemma":0.00024704414,"threshold_uncertainty_score":0.018262923},"labels":[],"label_agreement":null},{"id":"W4240056463","doi":"10.1007/978-3-030-24900-7","title":"Security, Privacy, and Anonymity in Computation, Communication, and Storage","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Computer science; Anonymity; Computer security; Information privacy; Cryptography; Internet privacy","score_opus":0.01706823130738596,"score_gpt":0.26667740995512357,"score_spread":0.2496091786477376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240056463","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016768023,0.17490095,0.40835884,0.018504506,0.004481224,0.0002097597,0.0006498527,0.0008572973,0.3752696],"genre_scores_gemma":[0.39997232,0.14581044,0.13746943,0.0031540089,0.007666778,0.0006466837,0.00079060637,0.00059299095,0.30389684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772435,0.0005375016,0.00014439011,0.00036466843,0.0010029774,0.00022611553],"domain_scores_gemma":[0.9975432,0.0013707906,0.00015648718,0.0006141533,0.0002288262,0.000086524335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012718218,0.0012610368,0.0011831191,0.0013236974,0.0017920604,0.0072838003,0.00136461,0.0019383406,0.0061303275],"category_scores_gemma":[0.003783415,0.00080886827,0.0009204359,0.004257412,0.0075719105,0.011957362,0.0026740446,0.0047365106,0.002484534],"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.000046735677,0.000017104,0.0001068035,0.00013416,0.0000116041,0.00004617507,0.00022591894,0.0023466134,0.0005881732,0.9251999,0.015807463,0.05546924],"study_design_scores_gemma":[0.000007870142,0.000031911975,0.00015512254,0.00009651252,0.000015333891,0.00030548105,0.00011662023,0.0049551143,0.00069917744,0.88511354,0.108485356,0.000017974726],"about_ca_topic_score_codex":0.0012524388,"about_ca_topic_score_gemma":0.0008678107,"teacher_disagreement_score":0.0072838003,"about_ca_system_score_codex":0.0019351654,"about_ca_system_score_gemma":0.0020570152,"threshold_uncertainty_score":0.02050805},"labels":[],"label_agreement":null},{"id":"W4240079786","doi":"10.1007/978-3-540-74853-3_11","title":"An Exploration of Location Error Estimation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":28,"is_retracted":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":"Estimation; Computer science; Engineering; Systems engineering","score_opus":0.033827221528103024,"score_gpt":0.2736534265513825,"score_spread":0.23982620502327945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240079786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001311636,0.01904562,0.967951,0.00094060553,0.00043079176,0.000010523889,0.00007045895,0.0001434867,0.010095921],"genre_scores_gemma":[0.16463383,0.06478492,0.71267045,0.0009342594,0.0027779704,0.000114099304,0.00044126346,0.0003589668,0.053284243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988451,0.00049971597,0.00006422182,0.0002033555,0.0003408542,0.000046741177],"domain_scores_gemma":[0.9963366,0.002849588,0.00009525913,0.00026913913,0.00041245334,0.000036898673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963607,0.001126597,0.0013913024,0.0013450467,0.000410533,0.0026861911,0.0020369813,0.0017105687,0.005702843],"category_scores_gemma":[0.009302345,0.0010139424,0.0011057442,0.0032043345,0.0017079535,0.004679194,0.0022092042,0.0024058048,0.0019324586],"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.000083275896,0.000050320476,0.0005775831,0.0007246602,0.00010772427,0.00030709454,0.00028258085,0.09141126,0.0011706251,0.55029106,0.015464136,0.3395297],"study_design_scores_gemma":[0.0000139488775,0.00008345416,0.00043951676,0.00038505328,0.000051633866,0.0006069216,0.000152656,0.4505425,0.0012883305,0.49731547,0.049072318,0.00004813953],"about_ca_topic_score_codex":0.0027139348,"about_ca_topic_score_gemma":0.001889893,"teacher_disagreement_score":0.005702843,"about_ca_system_score_codex":0.0008893857,"about_ca_system_score_gemma":0.0006402719,"threshold_uncertainty_score":0.019077957},"labels":[],"label_agreement":null},{"id":"W4240292363","doi":"10.1007/978-3-642-24485-8_26","title":"Diagram Definition: A Case Study with the UML Class Diagram","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Carleton University; IBM (Canada)","funders":"","keywords":"Computer science; Class diagram; Programming language; Metamodeling; Syntax; Unified Modeling Language; Communication diagram; Activity diagram; Abstract syntax; State diagram; Semantics (computer science); Artificial intelligence; Finite-state machine; Software","score_opus":0.02897614498998831,"score_gpt":0.2373533202837623,"score_spread":0.20837717529377398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240292363","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.36606807,0.001443296,0.5585657,0.0040165265,0.0002963187,0.0019992446,0.0012683225,0.0012522329,0.06509033],"genre_scores_gemma":[0.64119405,0.00085983897,0.33577177,0.00051888934,0.00004344265,0.00055000494,0.0010897786,0.00065384473,0.019318415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953381,0.0026563627,0.00021134899,0.00040800544,0.0012626431,0.00012364177],"domain_scores_gemma":[0.9898868,0.0074203876,0.00042804782,0.0006351078,0.0013498781,0.00027987055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040259813,0.00041516163,0.00045679312,0.0020958132,0.0016400558,0.0032950994,0.0014819192,0.0027535015,0.005833859],"category_scores_gemma":[0.013390153,0.00038274296,0.0005735376,0.002009181,0.0012949691,0.0032505041,0.0013132959,0.0016540027,0.0012016961],"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.0011696845,0.002878218,0.025506422,0.0034457615,0.00007697025,0.036074534,0.09918172,0.014727537,0.074586935,0.17347062,0.025192523,0.54368913],"study_design_scores_gemma":[0.00047736935,0.0012078297,0.025970828,0.0025534078,0.00026460655,0.051740095,0.053787332,0.0822485,0.0794227,0.055842277,0.6461673,0.00031779264],"about_ca_topic_score_codex":0.0038490214,"about_ca_topic_score_gemma":0.006254336,"teacher_disagreement_score":0.005833859,"about_ca_system_score_codex":0.0015668216,"about_ca_system_score_gemma":0.0016932655,"threshold_uncertainty_score":0.021291673},"labels":[],"label_agreement":null},{"id":"W4240323496","doi":"10.1007/3-540-45526-4","title":"Automata Implementation","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Western University","funders":"","keywords":"Computer science; Automaton; Programming language; Theoretical computer science","score_opus":0.026548195699811768,"score_gpt":0.33060929576119646,"score_spread":0.3040611000613847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240323496","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075861258,0.00022645915,0.7090016,0.0006636872,0.0008505616,0.0004017989,0.0013916442,0.019279199,0.26059896],"genre_scores_gemma":[0.24817556,0.00051609665,0.41548952,0.0006036792,0.00017052946,0.0009561954,0.004644904,0.004597258,0.3248463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990761,0.00015158483,0.00006108493,0.00025742967,0.00033699078,0.00011677385],"domain_scores_gemma":[0.99905187,0.00014781707,0.000018700403,0.00046571143,0.00027191092,0.000044032222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156108,0.0007221248,0.00059261953,0.000776566,0.0012109119,0.0025410303,0.0016691231,0.0009887293,0.09360363],"category_scores_gemma":[0.002076619,0.0006490354,0.001066825,0.00061677926,0.00078483345,0.0025112103,0.002194667,0.0018425304,0.037749816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001929045,0.00017936746,0.0003731475,0.00025758683,0.000034681092,0.00015135242,0.00026437835,0.005269244,0.01467954,0.68493885,0.04935745,0.24430147],"study_design_scores_gemma":[0.000104924184,0.000100794394,0.00032356795,0.00012677655,0.00009914497,0.0003761219,0.0001863388,0.06494681,0.049618382,0.37223366,0.5118296,0.00005382097],"about_ca_topic_score_codex":0.0015649772,"about_ca_topic_score_gemma":0.0021931527,"teacher_disagreement_score":0.09360363,"about_ca_system_score_codex":0.0007881536,"about_ca_system_score_gemma":0.0014820003,"threshold_uncertainty_score":0.3131354},"labels":[],"label_agreement":null},{"id":"W4240428965","doi":"10.1007/3-540-36175-8_40","title":"HOT: Hypergraph-Based Outlier Test for Categorical Data","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Simon Fraser University","funders":"","keywords":"Categorical variable; Computer science; Outlier; Data mining; Robustness (evolution); Linear subspace; Anomaly detection; Curse of dimensionality; Missing data; Computation; Hypergraph; Cluster analysis; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.033845504952530595,"score_gpt":0.2738144117525889,"score_spread":0.23996890680005833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240428965","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.03300986,0.00023631852,0.95179594,0.0002822098,0.00014713118,0.00014134025,0.0011264099,0.012445698,0.0008150723],"genre_scores_gemma":[0.36589324,0.0001862967,0.6233563,0.00026636722,0.0003125091,0.00032889986,0.005005126,0.0011134436,0.0035378519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666506,0.0010071922,0.00019668206,0.0005454327,0.0013592796,0.00022634275],"domain_scores_gemma":[0.9907268,0.0047315755,0.0006630217,0.002091417,0.0013620758,0.00042504593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023546494,0.0009833309,0.001872109,0.0044559794,0.0008381951,0.0014101337,0.0028031815,0.0017714007,0.0039852876],"category_scores_gemma":[0.011720484,0.0004991455,0.0010862764,0.0033805703,0.0010477918,0.0031184368,0.0025371185,0.0017026252,0.0015235251],"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.0016215029,0.00043344096,0.019488594,0.00032440078,0.00049220375,0.00046298318,0.00021452524,0.062273216,0.023981286,0.011066377,0.025487479,0.854154],"study_design_scores_gemma":[0.0001250522,0.00042542876,0.006802814,0.00002965591,0.00009708835,0.00058368285,0.00014848362,0.92407125,0.017501263,0.045200266,0.0049448805,0.00007010399],"about_ca_topic_score_codex":0.001603941,"about_ca_topic_score_gemma":0.0019824726,"teacher_disagreement_score":0.0044559794,"about_ca_system_score_codex":0.000580152,"about_ca_system_score_gemma":0.0009866721,"threshold_uncertainty_score":0.0133321285},"labels":[],"label_agreement":null},{"id":"W4241039965","doi":"10.1007/978-3-642-21822-4_16","title":"A Global Unsupervised Data Discretization Algorithm Based on Collective Correlation Coefficient","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Discretization; Computer science; Benchmark (surveying); Principal component analysis; Correlation coefficient; Algorithm; Data mining; Set (abstract data type); Data set; Association rule learning; Discretization of continuous features; Mean squared error; Artificial intelligence; Machine learning; Discretization error; Mathematics; Statistics","score_opus":0.029912099738934293,"score_gpt":0.2486779202076774,"score_spread":0.2187658204687431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241039965","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.0046827677,0.000083031824,0.9945868,0.000028600802,0.000035648965,0.000022556627,0.000026167145,0.00026233873,0.00027201808],"genre_scores_gemma":[0.06439638,0.00012304328,0.9335698,0.00006300856,0.00004957229,0.00012421548,0.00029317144,0.00012522742,0.0012556857],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989104,0.00017719527,0.00008879291,0.00034578796,0.0004082106,0.000069555244],"domain_scores_gemma":[0.99843377,0.0005576207,0.00011204449,0.00030629142,0.00052288687,0.00006749036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390454,0.0006514355,0.002262553,0.0016683859,0.0008886673,0.0013479545,0.0019192055,0.0010056079,0.001529975],"category_scores_gemma":[0.0027133862,0.00053867575,0.0012991027,0.0025759365,0.00080914964,0.0016172788,0.002121812,0.0015193969,0.00068159675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002063073,0.00013805926,0.0019258127,0.0001693531,0.00024272085,0.00011490618,0.00020343486,0.11462179,0.020684302,0.017868439,0.0051071295,0.8387178],"study_design_scores_gemma":[0.000018653845,0.000050184673,0.00063735637,0.000013446936,0.00004142406,0.000109085624,0.00003264894,0.98557436,0.0046361545,0.0069434536,0.0019192398,0.000023863271],"about_ca_topic_score_codex":0.0023380604,"about_ca_topic_score_gemma":0.0037535501,"teacher_disagreement_score":0.0023380604,"about_ca_system_score_codex":0.00057682174,"about_ca_system_score_gemma":0.0011271025,"threshold_uncertainty_score":0.0073535442},"labels":[],"label_agreement":null},{"id":"W4241400486","doi":"10.1007/978-3-319-10584-0","title":"Computer Vision – ECCV 2014","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence","score_opus":0.009582690174665225,"score_gpt":0.22831043900542425,"score_spread":0.21872774883075902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241400486","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046081324,0.06535157,0.63504237,0.004326851,0.019958429,0.00028772166,0.0041479263,0.019650642,0.24662644],"genre_scores_gemma":[0.031893723,0.042062342,0.16992888,0.0010628339,0.0036289115,0.0003850438,0.012442276,0.005016095,0.73358],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987897,0.00011485827,0.000053645825,0.00025996318,0.00069392176,0.000087848144],"domain_scores_gemma":[0.99887973,0.00014843572,0.000037017944,0.00040424,0.00044320847,0.00008735378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562536,0.0026055574,0.0026973432,0.003043063,0.00057121227,0.0033485435,0.003434771,0.0022788318,0.09306283],"category_scores_gemma":[0.0023865427,0.0012266178,0.0011041752,0.0031577072,0.0007869097,0.0029739127,0.0022079782,0.002739692,0.06550509],"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.000033587094,0.000038973674,0.00006703765,0.0002950651,0.000050376508,0.000027879032,0.0000108918475,0.0038619633,0.0018859608,0.009309848,0.3702833,0.6141352],"study_design_scores_gemma":[0.000027081,0.000080047575,0.0013233193,0.00033008074,0.000075145406,0.0005895034,0.000033519656,0.041340575,0.0062507666,0.05135486,0.8985328,0.00006236514],"about_ca_topic_score_codex":0.002757704,"about_ca_topic_score_gemma":0.0034339079,"teacher_disagreement_score":0.09306283,"about_ca_system_score_codex":0.0018036788,"about_ca_system_score_gemma":0.0015105004,"threshold_uncertainty_score":0.3113262},"labels":[],"label_agreement":null},{"id":"W4241787440","doi":"10.1007/978-3-030-12029-0","title":"Statistical Atlases and Computational Models of the Heart. Atrial Segmentation and LV Quantification Challenges","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Toronto","funders":"","keywords":"Computer science; Segmentation; Computational model; Artificial intelligence; Statistical model; Ventricle; Data science; Cardiology; Medicine","score_opus":0.036169264610538196,"score_gpt":0.29952407118032837,"score_spread":0.26335480656979016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241787440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003046842,0.011231128,0.9759939,0.00312641,0.00039819573,0.000015391548,0.00049830676,0.0005624764,0.0051273485],"genre_scores_gemma":[0.2340125,0.04724348,0.68759996,0.0011203435,0.0026534959,0.00021040133,0.0024361645,0.0008449838,0.023878729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995415,0.00012765116,0.000027132739,0.00009517845,0.00018527951,0.000023223447],"domain_scores_gemma":[0.9980515,0.0012508457,0.00011908337,0.00024886584,0.0002569624,0.00007269922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015971322,0.0006037174,0.0010938096,0.0014620717,0.00023530515,0.002711805,0.0015074895,0.0009997673,0.0023959556],"category_scores_gemma":[0.0047319764,0.00091467384,0.00096086087,0.002036739,0.001603251,0.0024266774,0.0013976502,0.0023279353,0.0015768304],"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.000037562877,0.00002433313,0.00075310323,0.00047153936,0.00011554478,0.00012744665,0.00013274339,0.17194341,0.0051845443,0.42375016,0.03980319,0.35765645],"study_design_scores_gemma":[0.000005909318,0.00003260547,0.0009120093,0.000092454124,0.00002753722,0.00042195438,0.000054651086,0.48310444,0.0014035769,0.47926146,0.0346495,0.00003386761],"about_ca_topic_score_codex":0.0019579718,"about_ca_topic_score_gemma":0.0024000567,"teacher_disagreement_score":0.002711805,"about_ca_system_score_codex":0.0008343716,"about_ca_system_score_gemma":0.00084566756,"threshold_uncertainty_score":0.008446574},"labels":[],"label_agreement":null},{"id":"W4241904514","doi":"10.1007/978-3-540-73589-2_12","title":"Non-null References by Default in Java: Alleviating the Nullity Annotation Burden","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Java; Programming language; Null (SQL); Annotation; Semantics (computer science); Java Modeling Language; Software engineering; Information retrieval; Natural language processing; Artificial intelligence; Java annotation; Database; Real time Java","score_opus":0.027390508133668202,"score_gpt":0.2866930219036231,"score_spread":0.2593025137699549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241904514","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.026609583,0.0008832961,0.909383,0.002317382,0.00095789577,0.00016850705,0.00047840993,0.04415064,0.015051304],"genre_scores_gemma":[0.31061935,0.0013735411,0.5935778,0.0033654533,0.0010570778,0.00032102494,0.001538615,0.06153409,0.026613047],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98066276,0.00611266,0.0023337717,0.0025448352,0.006726854,0.0016190419],"domain_scores_gemma":[0.8936813,0.04203352,0.0046487115,0.047146086,0.011009555,0.0014809539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016284708,0.0020957612,0.0033334345,0.0026578659,0.0036243778,0.008013752,0.011775562,0.0054263333,0.010921168],"category_scores_gemma":[0.06668647,0.004854318,0.002392335,0.0037395465,0.007014562,0.023106152,0.018130368,0.010292818,0.0075890296],"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.0014417239,0.00053229346,0.009164294,0.0019328584,0.0001644894,0.0020388651,0.0063059325,0.0061624115,0.03492986,0.3986762,0.07428639,0.4643648],"study_design_scores_gemma":[0.00043007106,0.00028080033,0.0017006041,0.0010700269,0.00077765825,0.0027500084,0.00122519,0.09303285,0.092632376,0.5684722,0.23702209,0.0006060421],"about_ca_topic_score_codex":0.0020493641,"about_ca_topic_score_gemma":0.0036643718,"teacher_disagreement_score":0.016284708,"about_ca_system_score_codex":0.0014148961,"about_ca_system_score_gemma":0.006200857,"threshold_uncertainty_score":0.08612275},"labels":[],"label_agreement":null},{"id":"W4241907497","doi":"10.1007/978-3-642-22655-7_5","title":"Using Structure-Based Recommendations to Facilitate Discoverability in APIs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Discoverability; Computer science; Task (project management); Application programming interface; World Wide Web; Key (lock); Software engineering; Programming language; Engineering; Operating system","score_opus":0.08450920162949963,"score_gpt":0.299782116642758,"score_spread":0.21527291501325838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241907497","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.23522729,0.0026290184,0.69826716,0.0042586583,0.0006814795,0.0010817483,0.005020233,0.0294434,0.023390986],"genre_scores_gemma":[0.4426244,0.0010814955,0.5364292,0.00045518947,0.00020451512,0.00032069502,0.0077226465,0.0013802263,0.009781639],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960278,0.0007831653,0.00033125872,0.00065754884,0.001974471,0.0002257304],"domain_scores_gemma":[0.98081434,0.011462048,0.0010269266,0.0034697568,0.0028226308,0.00040432895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027466828,0.0010717087,0.000990918,0.005062796,0.00129906,0.003230061,0.0020103133,0.0021632533,0.0061177746],"category_scores_gemma":[0.034149177,0.0008393528,0.0015501627,0.0029267778,0.0004755088,0.007822811,0.0020163092,0.0024547135,0.0027090774],"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.0008017579,0.0010294504,0.031199606,0.00070103107,0.0003198058,0.0006426201,0.0018529049,0.016255552,0.016189743,0.018092003,0.03848489,0.8744307],"study_design_scores_gemma":[0.00023908193,0.00048543338,0.0135574555,0.0006138255,0.00069265085,0.0009224038,0.0013742518,0.80630976,0.04643638,0.05898699,0.07014996,0.00023184286],"about_ca_topic_score_codex":0.0104036005,"about_ca_topic_score_gemma":0.028890284,"teacher_disagreement_score":0.0104036005,"about_ca_system_score_codex":0.00095137017,"about_ca_system_score_gemma":0.0018587648,"threshold_uncertainty_score":0.02068609},"labels":[],"label_agreement":null},{"id":"W4242476382","doi":"10.1007/978-3-642-24918-1","title":"Integrated Uncertainty in Knowledge Modelling and Decision Making","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Management science; Artificial intelligence; Operations research","score_opus":0.031060322655582923,"score_gpt":0.26589674851083067,"score_spread":0.23483642585524775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242476382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007989117,0.020064643,0.94852865,0.0017497437,0.00030984878,0.000036783684,0.00020353701,0.0001674523,0.020950159],"genre_scores_gemma":[0.64490783,0.025840705,0.3126074,0.00033058957,0.00081875327,0.0002479483,0.000663261,0.00013035297,0.014453075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733967,0.00084348535,0.00020736246,0.00024235316,0.0012147417,0.00015237051],"domain_scores_gemma":[0.994785,0.003946163,0.00026100533,0.0004294318,0.0004748225,0.000103549624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586958,0.0009691885,0.0015274042,0.0018657439,0.0005212633,0.004366711,0.0016671662,0.00127172,0.0028137525],"category_scores_gemma":[0.01028269,0.0009887227,0.0012715892,0.0036538783,0.00227125,0.008197433,0.002304201,0.0026195913,0.00060105004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000670573,0.000049932274,0.00035181647,0.0004256801,0.00018068627,0.00011839709,0.00028083785,0.16996656,0.0004830101,0.680092,0.0039631235,0.144021],"study_design_scores_gemma":[0.000003795851,0.000012865873,0.00009890319,0.00006866837,0.000027320824,0.0000332696,0.000032456042,0.10560254,0.00028756337,0.8882409,0.005575325,0.000016378985],"about_ca_topic_score_codex":0.0032070011,"about_ca_topic_score_gemma":0.0023524126,"teacher_disagreement_score":0.004366711,"about_ca_system_score_codex":0.002064452,"about_ca_system_score_gemma":0.0013586509,"threshold_uncertainty_score":0.014978707},"labels":[],"label_agreement":null},{"id":"W4243393140","doi":"10.1007/978-3-030-57321-8","title":"Machine Learning and Knowledge Extraction","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Information extraction; Artificial intelligence; Knowledge extraction; Extraction (chemistry); Machine learning; Knowledge graph","score_opus":0.015111058131641989,"score_gpt":0.28067347228424916,"score_spread":0.2655624141526072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243393140","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032660314,0.033047654,0.76921725,0.002628667,0.0019991961,0.00017772766,0.0025470909,0.004918381,0.18219796],"genre_scores_gemma":[0.035152473,0.035388544,0.49246126,0.0011108012,0.0016441309,0.00029724598,0.010462915,0.0014032212,0.42207935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996057,0.00005141682,0.000032606873,0.00010978561,0.00017707983,0.000023350041],"domain_scores_gemma":[0.99933463,0.00036223244,0.000024135024,0.00014025901,0.00011642371,0.000022236327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045666794,0.0010746421,0.0011373125,0.0024794233,0.00058130326,0.0029630414,0.0012898969,0.00074749533,0.04536654],"category_scores_gemma":[0.0017778752,0.00069291535,0.001125534,0.004420768,0.0007235011,0.004427287,0.0016470663,0.0014921508,0.035072383],"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.000030298643,0.000040299044,0.000098003155,0.00048441035,0.000041975327,0.00008161767,0.000052059357,0.002429813,0.00229511,0.04026006,0.08690377,0.8672826],"study_design_scores_gemma":[0.000017082679,0.000043279666,0.0006728094,0.00039162897,0.00007080628,0.0006519146,0.000088117646,0.032986164,0.00999725,0.31231463,0.642717,0.000049348884],"about_ca_topic_score_codex":0.00088888506,"about_ca_topic_score_gemma":0.0012990235,"teacher_disagreement_score":0.04536654,"about_ca_system_score_codex":0.00065821764,"about_ca_system_score_gemma":0.0007424852,"threshold_uncertainty_score":0.15176624},"labels":[],"label_agreement":null},{"id":"W4243540118","doi":"10.1007/3-540-45518-3","title":"Middleware 2001","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering and Design Patterns","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade de Lisboa; Eidgenössische Technische Hochschule Zürich; RMIT University; Imperial College London; Newcastle University; Institut national de recherche en informatique et en automatique (INRIA); Centre National de la Recherche Scientifique; University of Ottawa; State University of New York; Università di Bologna; Microsoft Research","keywords":"Computer science; Middleware (distributed applications); Operating system","score_opus":0.026831566686701273,"score_gpt":0.27975618250870055,"score_spread":0.25292461582199927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243540118","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045139776,0.018297767,0.33874178,0.0038293086,0.0070363283,0.0004165566,0.00729586,0.03308577,0.5867826],"genre_scores_gemma":[0.005233142,0.007254763,0.027852029,0.0005476425,0.00048301264,0.000117288604,0.009420146,0.002986228,0.9461058],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999561,0.00003871276,0.000028642758,0.00010717056,0.00022343529,0.000041102718],"domain_scores_gemma":[0.9991442,0.00015956533,0.00003055703,0.00028769762,0.00027004688,0.00010784557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077844155,0.0017952473,0.0013969656,0.0017775588,0.00085593824,0.0040093716,0.001747735,0.0011875146,0.17034936],"category_scores_gemma":[0.001783735,0.0012485189,0.00073528686,0.0031411452,0.00041586527,0.003293939,0.0016358271,0.0018691149,0.20570433],"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.00005964348,0.00007387371,0.00017292681,0.00031830004,0.000020254774,0.00008478842,0.00006514235,0.0013652346,0.0034051195,0.010553482,0.54252595,0.44135532],"study_design_scores_gemma":[0.000024445995,0.000036019126,0.00046218635,0.00016882896,0.000031743115,0.0003272607,0.000034748242,0.0041123587,0.0019863246,0.009119891,0.9836745,0.000021840038],"about_ca_topic_score_codex":0.002730367,"about_ca_topic_score_gemma":0.006294097,"teacher_disagreement_score":0.17034936,"about_ca_system_score_codex":0.00096137676,"about_ca_system_score_gemma":0.00082881405,"threshold_uncertainty_score":0.56987536},"labels":[],"label_agreement":null},{"id":"W4243674558","doi":"10.1007/978-3-642-13544-6_1","title":"Sketch Based Volumetric Clouds","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sketch; Computer science; Cloud computing; Procedural modeling; Computer graphics (images); Volume (thermodynamics); Distributed computing; Algorithm; Operating system","score_opus":0.01684939560265646,"score_gpt":0.27036564780007105,"score_spread":0.2535162521974146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243674558","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005162543,0.00085790956,0.9672734,0.00017231097,0.0001892121,0.000086032866,0.00060540024,0.0030706362,0.02258267],"genre_scores_gemma":[0.21820468,0.0044935592,0.714094,0.00015603982,0.00019141349,0.00013192871,0.0027398446,0.0020241817,0.057964247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996165,0.000026771855,0.000014750712,0.000057944348,0.00024583627,0.00003812854],"domain_scores_gemma":[0.9995431,0.00009162826,0.000026872023,0.00018961425,0.00010740151,0.00004142577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026707,0.0011092642,0.0010363143,0.0012596138,0.0004812,0.002590097,0.0017169022,0.00081670494,0.026373923],"category_scores_gemma":[0.0014222508,0.0009755195,0.0011504189,0.0019871397,0.00064530317,0.0021327273,0.002771399,0.0017297964,0.0072333147],"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.00026164358,0.000074716976,0.0004215959,0.00047183913,0.00009217072,0.00024872262,0.00016679491,0.22328985,0.04146318,0.16499975,0.026233243,0.5422765],"study_design_scores_gemma":[0.000040233037,0.000064028485,0.00045281643,0.00012338225,0.000042496948,0.00080491556,0.00009069829,0.7641031,0.0349634,0.08539694,0.11383813,0.000079838625],"about_ca_topic_score_codex":0.0027960064,"about_ca_topic_score_gemma":0.003044267,"teacher_disagreement_score":0.026373923,"about_ca_system_score_codex":0.00064717646,"about_ca_system_score_gemma":0.0006578555,"threshold_uncertainty_score":0.08822954},"labels":[],"label_agreement":null},{"id":"W4243692630","doi":"10.1007/978-3-319-07491-7","title":"Pattern Recognition","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Library science","score_opus":0.01746567312772625,"score_gpt":0.23780883129458616,"score_spread":0.2203431581668599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243692630","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.005857097,0.010298621,0.6673768,0.0012824916,0.0031956746,0.00039269606,0.0045247474,0.021888647,0.2851832],"genre_scores_gemma":[0.042891074,0.008488991,0.27668208,0.0011610863,0.00064796855,0.00036879195,0.013693209,0.0015917809,0.6544751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935204,0.000036465302,0.000038862487,0.00016169326,0.00035661188,0.000054433756],"domain_scores_gemma":[0.99954,0.000035227225,0.000020761205,0.00017181083,0.00020930433,0.00002287353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004382632,0.0012529494,0.0010955997,0.0019374985,0.0005068883,0.002127459,0.0017688196,0.0011270054,0.09580987],"category_scores_gemma":[0.0008606595,0.0005207684,0.00064730295,0.0021622202,0.00045127558,0.0014508899,0.0012137752,0.0009707698,0.12082184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051413546,0.000051577772,0.00018969543,0.00025041375,0.000025839909,0.00008167193,0.00002060139,0.0013382513,0.025131416,0.0077566323,0.13178681,0.8333156],"study_design_scores_gemma":[0.000026541566,0.00014325074,0.0019561604,0.0001594515,0.000053533484,0.0012023842,0.00007321334,0.03169562,0.075726844,0.019625109,0.86927754,0.000060338283],"about_ca_topic_score_codex":0.0012639319,"about_ca_topic_score_gemma":0.0017457813,"teacher_disagreement_score":0.09580987,"about_ca_system_score_codex":0.0004154938,"about_ca_system_score_gemma":0.00068368705,"threshold_uncertainty_score":0.320516},"labels":[],"label_agreement":null},{"id":"W4243971583","doi":"10.1007/978-3-030-68887-5","title":"Risks and Security of Internet and Systems","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Economic and Technological Systems Analysis","field":"Business, Management and Accounting","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer security; The Internet; Information security; Internet security; Internet privacy; World Wide Web; Security service","score_opus":0.021616792332460617,"score_gpt":0.22115769811414485,"score_spread":0.19954090578168424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243971583","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13512972,0.045133993,0.07136229,0.020669183,0.00067518756,0.00004981691,0.0002573671,0.00015205526,0.7265704],"genre_scores_gemma":[0.921507,0.01461928,0.0056753824,0.00044400917,0.00086993736,0.00004321302,0.00008922559,0.00004263742,0.056709323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995515,0.00018357947,0.000017892482,0.000034825785,0.00017418989,0.000038075043],"domain_scores_gemma":[0.99802375,0.0014144608,0.00019325892,0.00014554431,0.00015461481,0.000068432295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067150494,0.00041298248,0.00023891524,0.0009467049,0.0004994934,0.0029201824,0.00027076324,0.0012351443,0.0047522355],"category_scores_gemma":[0.0035139,0.00021198136,0.00022130854,0.00072256953,0.0022929823,0.0040636924,0.00076462055,0.0015057735,0.00046788185],"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.000024313327,0.000013413106,0.0006977847,0.00003235635,0.0000089206915,0.00006747541,0.00030755703,0.003129569,0.00028616795,0.97226906,0.0038630837,0.019300247],"study_design_scores_gemma":[0.0000022756576,0.000014871877,0.0006327478,0.00004546617,0.000005328834,0.000103939885,0.00017999583,0.0028171905,0.00013074896,0.98015606,0.015906718,0.0000045601023],"about_ca_topic_score_codex":0.001019041,"about_ca_topic_score_gemma":0.0007868902,"teacher_disagreement_score":0.0047522355,"about_ca_system_score_codex":0.0009933354,"about_ca_system_score_gemma":0.00058178185,"threshold_uncertainty_score":0.01589787},"labels":[],"label_agreement":null},{"id":"W4243985816","doi":"10.1007/978-3-030-42048-2","title":"Computer Security","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information and Cyber 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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer security; Computer science; Focus (optics); Security engineering; Information security; Engineering; Security service; Software security assurance; Physics","score_opus":0.0104118099995481,"score_gpt":0.22977901375680557,"score_spread":0.21936720375725746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243985816","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005815191,0.0044700913,0.0047794487,0.0012771593,0.00085563486,0.000038387767,0.0001935265,0.00049396814,0.9873102],"genre_scores_gemma":[0.0066892398,0.004566431,0.0017885513,0.00042985205,0.0003967596,0.000027401224,0.00032353806,0.00014685832,0.98563135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967957,0.000041410254,0.000007440781,0.000055180008,0.00018189695,0.000034604942],"domain_scores_gemma":[0.9995845,0.00007161394,0.000023157101,0.00013742763,0.00012503767,0.000058386588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030517342,0.0010832126,0.00043899595,0.0014742468,0.0008812378,0.0026798754,0.0005151498,0.0010004153,0.21692492],"category_scores_gemma":[0.0010114079,0.00033061573,0.00030819818,0.0012213774,0.00060127315,0.0022646969,0.0015021096,0.0015670409,0.16207238],"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.0000231193,0.000040749404,0.00012597402,0.00014863553,0.000006182731,0.000051237657,0.00010008711,0.0003820031,0.0013876914,0.06987631,0.5985094,0.32934862],"study_design_scores_gemma":[0.000002886903,0.000019053889,0.00023438239,0.000089984846,0.0000035269284,0.00015504203,0.00003326951,0.00032934183,0.0004449514,0.012771754,0.9859125,0.0000034414638],"about_ca_topic_score_codex":0.00092554314,"about_ca_topic_score_gemma":0.0018046132,"teacher_disagreement_score":0.21692492,"about_ca_system_score_codex":0.0007674514,"about_ca_system_score_gemma":0.0010448681,"threshold_uncertainty_score":0.7256862},"labels":[],"label_agreement":null},{"id":"W4243991137","doi":"10.1007/978-3-540-24840-8_3","title":"Emotional Pathfinding","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Pathfinding; Computer science; Human–computer interaction; Psychology; Artificial intelligence; Theoretical computer science","score_opus":0.04062679041595902,"score_gpt":0.3346037969855636,"score_spread":0.29397700656960457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243991137","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.018299447,0.0027691424,0.09969128,0.0015794901,0.0005567257,0.000058206548,0.0002391451,0.00090429594,0.8759023],"genre_scores_gemma":[0.33111182,0.005589333,0.05267353,0.0005790372,0.00015767002,0.00015450853,0.0008067337,0.0004931741,0.6084342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999391,0.000007984179,0.000001991373,0.0000184581,0.000019671252,0.000012800768],"domain_scores_gemma":[0.99991643,0.00001796482,0.000007196822,0.000016516571,0.000025555886,0.000016466087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001070961,0.00052282825,0.00017353207,0.00043442132,0.00051610376,0.0013157937,0.00051013,0.0006277753,0.04259224],"category_scores_gemma":[0.00055977365,0.00017543616,0.0002378055,0.00036788054,0.00051160523,0.0015142182,0.0010328094,0.00082816597,0.011550002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001019365,0.00007410573,0.0006595379,0.0003210275,0.00001695866,0.00026851313,0.0014184195,0.0022172425,0.021423552,0.24949571,0.062405284,0.6615977],"study_design_scores_gemma":[0.000030673622,0.00015492237,0.0055587427,0.0004362556,0.00004780556,0.0016155049,0.0025929352,0.00992719,0.017664183,0.2811126,0.68080264,0.00005646549],"about_ca_topic_score_codex":0.00051790394,"about_ca_topic_score_gemma":0.000810441,"teacher_disagreement_score":0.04259224,"about_ca_system_score_codex":0.00028093162,"about_ca_system_score_gemma":0.0003279496,"threshold_uncertainty_score":0.1424852},"labels":[],"label_agreement":null},{"id":"W4244182939","doi":"10.1007/978-3-030-92182-8","title":"Games and Learning Alliance","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Université Laval","funders":"","keywords":"Computer science; Alliance; Artificial intelligence; History","score_opus":0.03204533227437712,"score_gpt":0.3512866456439669,"score_spread":0.3192413133695898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244182939","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014066764,0.0032408154,0.012758847,0.0022535203,0.00037492966,0.000052600488,0.000037717884,0.00014386929,0.9670709],"genre_scores_gemma":[0.45082945,0.0044999034,0.008887354,0.0005608917,0.0001929696,0.00023802229,0.00013024677,0.000096746706,0.53456444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976104,0.00010894672,0.000006591271,0.000027646262,0.00005614208,0.000039694532],"domain_scores_gemma":[0.9994962,0.00024584561,0.0000391979,0.000040683484,0.000034845256,0.00014319207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033440226,0.000587746,0.00029717345,0.0005748147,0.00081786077,0.0025772844,0.0006807707,0.0009235004,0.03098555],"category_scores_gemma":[0.0016574843,0.0001941539,0.00025804382,0.0005587877,0.0009871264,0.0032518173,0.0020548806,0.0017794145,0.0046033342],"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.000065480235,0.00013908393,0.00031300721,0.000076,0.000010396099,0.00011114402,0.0009119394,0.0018422405,0.00036855036,0.85854423,0.026617637,0.111000314],"study_design_scores_gemma":[0.00003516913,0.00010330169,0.00094457954,0.00014091498,0.0000107541755,0.00031345096,0.0014528083,0.0037378105,0.00042608514,0.80427366,0.18854906,0.000012400026],"about_ca_topic_score_codex":0.00050772197,"about_ca_topic_score_gemma":0.0011448096,"teacher_disagreement_score":0.03098555,"about_ca_system_score_codex":0.0007751125,"about_ca_system_score_gemma":0.00070480414,"threshold_uncertainty_score":0.10365707},"labels":[],"label_agreement":null},{"id":"W4244209731","doi":"10.1007/3-540-45499-3_35","title":"A New Logic for Electronic Commerce Protocols","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"Université Laval","funders":"","keywords":"Computer science; Atomicity; Programming language; Modal logic; Secrecy; Theoretical computer science; Anonymity; Protocol (science); TRACE (psycholinguistics); Modular design; Authentication (law); Computer security; Modal; Database transaction","score_opus":0.027565721778659975,"score_gpt":0.3145789074643448,"score_spread":0.28701318568568485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244209731","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.005741392,0.002271906,0.83462995,0.006198291,0.0015728376,0.00016273778,0.0004761983,0.0013207537,0.14762601],"genre_scores_gemma":[0.29797828,0.00467377,0.5247272,0.006558567,0.004488969,0.00079380843,0.0012238302,0.0011568387,0.1583988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780935,0.0006450907,0.00021257848,0.0004287071,0.0006715685,0.00023271599],"domain_scores_gemma":[0.9983584,0.00082476414,0.000085643995,0.00029281824,0.00030485904,0.00013339343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021961087,0.0013427959,0.0010946023,0.002947631,0.0037525317,0.008032994,0.002752585,0.002719049,0.017576924],"category_scores_gemma":[0.0032543237,0.0013375271,0.0021097069,0.0030079458,0.0071192207,0.024910364,0.004356833,0.008338976,0.005109304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098458095,0.000008622134,0.000016046033,0.00002738361,0.000002458222,0.000031438038,0.000098269964,0.00014827728,0.000259192,0.9900315,0.00256944,0.0067975814],"study_design_scores_gemma":[0.000014578168,0.0000118719445,0.000017644397,0.000023403489,0.000012840195,0.00010471476,0.000049298636,0.0030465436,0.00045659408,0.9578509,0.03839632,0.00001534834],"about_ca_topic_score_codex":0.001121788,"about_ca_topic_score_gemma":0.0011165895,"teacher_disagreement_score":0.017576924,"about_ca_system_score_codex":0.0031743525,"about_ca_system_score_gemma":0.0012490477,"threshold_uncertainty_score":0.058800697},"labels":[],"label_agreement":null},{"id":"W4244307312","doi":"10.1007/978-3-540-37275-2_97","title":"Analyzing Livestock Farm Odour Using a Neuro-fuzzy Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Odor and Emission Control Technologies","field":"Chemical Engineering","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 Guelph","funders":"","keywords":"Computer science; Livestock; Artificial neural network; Fuzzy logic; Function (biology); Artificial intelligence; Neuro-fuzzy; Data mining; Machine learning; Fuzzy control system; Geography; Forestry","score_opus":0.02978471994977472,"score_gpt":0.2396707049915931,"score_spread":0.20988598504181838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244307312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46216148,0.0007181844,0.5315068,0.00008868947,0.00004613034,0.00006827747,0.00014242031,0.0002758687,0.004992131],"genre_scores_gemma":[0.94907045,0.0001924267,0.049308546,0.0000144550195,0.00001362717,0.000024385694,0.00007710208,0.000011837978,0.0012872105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992025,0.000009099874,0.000005036353,0.000019038434,0.000030147221,0.00001645143],"domain_scores_gemma":[0.9998692,0.000063473286,0.000014153515,0.000006245011,0.00004065782,0.000006217912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020433811,0.00041401017,0.00045984934,0.0005652412,0.00036792594,0.0006523395,0.00039038592,0.00054291746,0.00056456414],"category_scores_gemma":[0.00040827636,0.00023835119,0.0006042698,0.00045460573,0.00016634526,0.00040163664,0.00021225761,0.00024234787,0.00011281815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033354314,0.00018071222,0.008795522,0.00013531673,0.00018778199,0.0002657828,0.000101933496,0.75486404,0.061623357,0.0010550676,0.00037550397,0.17208143],"study_design_scores_gemma":[0.0000024794915,0.000024228017,0.0020334236,0.000003108393,0.000018462139,0.000018402581,0.000029170382,0.9949122,0.002471273,0.00038642006,0.000094246156,0.0000064435594],"about_ca_topic_score_codex":0.01263852,"about_ca_topic_score_gemma":0.01387204,"teacher_disagreement_score":0.01263852,"about_ca_system_score_codex":0.0004043893,"about_ca_system_score_gemma":0.00035446865,"threshold_uncertainty_score":0.025129914},"labels":[],"label_agreement":null},{"id":"W4244317386","doi":"10.1007/978-3-642-22362-4_5","title":"Modeling Mental Workload Using EEG Features for Intelligent Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Workload; Electroencephalography; Context (archaeology); Human–computer interaction; Mental state; Cognition; Artificial intelligence; Cognitive psychology; Psychology","score_opus":0.05542999486497601,"score_gpt":0.2737028149177157,"score_spread":0.21827282005273968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244317386","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.3848917,0.00081185787,0.6106564,0.00019532038,0.00009916222,0.00006385321,0.00057091785,0.0010060318,0.0017048231],"genre_scores_gemma":[0.9765335,0.00017124151,0.022260685,0.0000113304095,0.000030611394,0.00004225094,0.00021886505,0.00003235058,0.0006992153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992585,0.000015756405,0.0000060041557,0.000020848738,0.000016610225,0.000014996173],"domain_scores_gemma":[0.9996357,0.0002515136,0.000026829495,0.000021922042,0.000047471658,0.000016662309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023586399,0.0006257789,0.0003554574,0.00044470266,0.0001556739,0.0006732781,0.00040446335,0.00038942302,0.0009950052],"category_scores_gemma":[0.0019630503,0.0002463094,0.0004458591,0.00042806644,0.00009272745,0.00064196164,0.0002791617,0.000443686,0.00028698894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005717958,0.00027975783,0.014638971,0.0001178529,0.00017144371,0.00017131446,0.00011703025,0.6891051,0.02422502,0.0011576243,0.0015342614,0.2679098],"study_design_scores_gemma":[0.0000023443647,0.000021932608,0.0027640369,0.0000024088154,0.000007699708,0.000012031689,0.000006535655,0.99558395,0.0009914082,0.00053084665,0.00007251008,0.000004308075],"about_ca_topic_score_codex":0.005028302,"about_ca_topic_score_gemma":0.004913298,"teacher_disagreement_score":0.005028302,"about_ca_system_score_codex":0.0002796073,"about_ca_system_score_gemma":0.00017785787,"threshold_uncertainty_score":0.009998083},"labels":[],"label_agreement":null},{"id":"W4244365690","doi":"10.1007/978-3-540-76778-7_19","title":"A Policy Management Framework for Content-Based Publish/Subscribe Middleware","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Publication; Middleware (distributed applications); Distributed computing; Business; Advertising","score_opus":0.059728723721645664,"score_gpt":0.29173745792197736,"score_spread":0.2320087342003317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244365690","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.0018483012,0.00035728622,0.9710163,0.0006222497,0.00038215474,0.00048080174,0.00026852274,0.020676887,0.004347472],"genre_scores_gemma":[0.08079938,0.0012171116,0.88995755,0.0007874332,0.0005924944,0.0013858579,0.0021141223,0.0041895886,0.018956471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458945,0.000929573,0.001019255,0.0005144305,0.0023238384,0.0006233678],"domain_scores_gemma":[0.9948585,0.0014905756,0.00032728334,0.0016924272,0.0008609937,0.0007701545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012173273,0.0013314696,0.0023928918,0.0025117071,0.0034995053,0.013297429,0.0068578934,0.0043415017,0.0073351213],"category_scores_gemma":[0.009896232,0.0024875624,0.0022161554,0.0025777367,0.0026908913,0.010056085,0.0059965686,0.006801435,0.0051051727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065839064,0.0009770422,0.0012943418,0.0007187407,0.0002963761,0.00091982837,0.0016581278,0.03280802,0.018595528,0.61864626,0.069067016,0.2543603],"study_design_scores_gemma":[0.00035830535,0.00019022322,0.00048595777,0.00030555172,0.00036844224,0.0006359718,0.00032805747,0.35684946,0.030548241,0.30544513,0.3041532,0.00033137828],"about_ca_topic_score_codex":0.006037341,"about_ca_topic_score_gemma":0.0048243157,"teacher_disagreement_score":0.013297429,"about_ca_system_score_codex":0.0026830658,"about_ca_system_score_gemma":0.0044478583,"threshold_uncertainty_score":0.064379215},"labels":[],"label_agreement":null},{"id":"W4244470190","doi":"10.1007/3-540-45139-0_3","title":"Model-checking in finite state-space systems with fine-grained abstractions using SPIN","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Model checking; Computer science; Abstraction model checking; Finite-state machine; Automaton; Finite state; Class (philosophy); State (computer science); State space; Theoretical computer science; Temporal logic; Transition system; Algorithm; Programming language; Mathematics; Artificial intelligence","score_opus":0.058099221225778756,"score_gpt":0.3018569842492009,"score_spread":0.2437577630234221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244470190","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.06366223,0.00021528875,0.92936486,0.00023756477,0.000089896894,0.00009431074,0.000093014496,0.0032723295,0.0029704536],"genre_scores_gemma":[0.77533865,0.00018110492,0.22217171,0.00009909563,0.00003623487,0.00016644182,0.00018176711,0.0003232847,0.0015017542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723274,0.0009995361,0.00024283958,0.00036887403,0.0007875401,0.0003684249],"domain_scores_gemma":[0.9922943,0.004547475,0.000413126,0.0022570298,0.00034555778,0.00014262051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032993145,0.00082648086,0.0017318957,0.0008733103,0.0011728174,0.0027052502,0.002206448,0.001117887,0.0024686016],"category_scores_gemma":[0.008456147,0.0011900755,0.002468502,0.0008796364,0.003485398,0.0064511336,0.0034983647,0.003639926,0.00026862163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000529463,0.00013757836,0.0020125965,0.00033623373,0.00023318655,0.0002674726,0.0005495666,0.5506855,0.010820438,0.3851218,0.0014068651,0.04789919],"study_design_scores_gemma":[0.000058053727,0.000036373778,0.00013024647,0.000022460841,0.000055691304,0.000026599877,0.00003694567,0.75299627,0.0066879964,0.23880798,0.0011183566,0.000023011035],"about_ca_topic_score_codex":0.0045601334,"about_ca_topic_score_gemma":0.00842378,"teacher_disagreement_score":0.0045601334,"about_ca_system_score_codex":0.0014860387,"about_ca_system_score_gemma":0.0019172253,"threshold_uncertainty_score":0.017448604},"labels":[],"label_agreement":null},{"id":"W4244505959","doi":"10.1007/3-540-36175-8_23","title":"Distinguishing Causal and Acausal Temporal Relations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Set (abstract data type); Sequence (biology); Computer science; Window (computing); Artificial intelligence; Algorithm; Programming language","score_opus":0.02579565807516324,"score_gpt":0.25654047699338384,"score_spread":0.2307448189182206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244505959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027811889,0.0021410806,0.89480364,0.0017110456,0.0002471077,0.00008392068,0.00047266716,0.00056485296,0.07216378],"genre_scores_gemma":[0.6110014,0.0033575792,0.36505446,0.0005380876,0.0008602734,0.00017782599,0.0014484691,0.00039394072,0.01716795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749583,0.0008992473,0.00022915819,0.000491655,0.00063937536,0.00024472637],"domain_scores_gemma":[0.9829959,0.013358394,0.00089978153,0.0016194206,0.0008492407,0.0002772935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035788417,0.0008578239,0.0007654713,0.0029615953,0.00198696,0.0056702816,0.0015196747,0.0020867833,0.012810909],"category_scores_gemma":[0.022167606,0.0012252085,0.0014403894,0.0031277195,0.0041017714,0.015410119,0.0022545368,0.00326646,0.0018619248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004149371,0.000016462282,0.0002740453,0.000070179645,0.0000074843792,0.000058460348,0.00036618035,0.000715042,0.0007675034,0.9729646,0.0010172011,0.023701422],"study_design_scores_gemma":[0.000008295466,0.0000074842296,0.00016402255,0.000031368745,0.000018341934,0.00013620751,0.00011507469,0.009216236,0.00089123787,0.98179525,0.0076048956,0.000011503216],"about_ca_topic_score_codex":0.0018003671,"about_ca_topic_score_gemma":0.0021957094,"teacher_disagreement_score":0.012810909,"about_ca_system_score_codex":0.0009955121,"about_ca_system_score_gemma":0.0011870136,"threshold_uncertainty_score":0.042856753},"labels":[],"label_agreement":null},{"id":"W4244541561","doi":"10.1007/978-3-319-60840-2","title":"Rough Sets","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science","score_opus":0.02309082688667286,"score_gpt":0.2670718017904029,"score_spread":0.24398097490373005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244541561","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049205665,0.026581224,0.6689336,0.0027206494,0.0022871653,0.00017976451,0.0012036021,0.0011600201,0.29201347],"genre_scores_gemma":[0.22558963,0.03770864,0.4894565,0.001125965,0.002433554,0.0004676603,0.003013398,0.0006468022,0.23955785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984322,0.00028993734,0.00011219016,0.00019210659,0.0009137202,0.000059693743],"domain_scores_gemma":[0.9990683,0.00034650552,0.000053590724,0.00028687142,0.0002134722,0.00003126525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011854633,0.001179429,0.0015483054,0.0025496995,0.0007214108,0.003762117,0.00086012663,0.0007815589,0.015744623],"category_scores_gemma":[0.0044261357,0.00054425554,0.00118983,0.0026015404,0.0012022508,0.002672954,0.0014084291,0.0019678222,0.007767259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023934983,0.000024370216,0.00011724072,0.0002799427,0.00005829387,0.000059971913,0.0001418694,0.00742651,0.0005899363,0.71327454,0.035816815,0.24218656],"study_design_scores_gemma":[0.000010961656,0.0000342243,0.00026263128,0.00015108292,0.00004756652,0.00019890445,0.00006913025,0.012271183,0.00088539807,0.7800296,0.20601532,0.00002398707],"about_ca_topic_score_codex":0.00058636285,"about_ca_topic_score_gemma":0.000521693,"teacher_disagreement_score":0.015744623,"about_ca_system_score_codex":0.0008775737,"about_ca_system_score_gemma":0.00078506867,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4244617291","doi":"10.1007/978-3-540-78646-7_41","title":"Improving Complex Interactive Question Answering with Wikipedia Anchor Text","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Question answering; Information retrieval; World Wide Web; Natural language processing","score_opus":0.01781618558530727,"score_gpt":0.2947730575723194,"score_spread":0.27695687198701213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244617291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117652416,0.001646231,0.75132275,0.00089537364,0.0006072556,0.0006916457,0.006196042,0.10669503,0.014293206],"genre_scores_gemma":[0.2105306,0.0004735369,0.7466027,0.00037236864,0.00026014927,0.00045222536,0.02013954,0.0035247053,0.017644146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784124,0.0006703102,0.00016476143,0.0005598718,0.0006051776,0.00015853204],"domain_scores_gemma":[0.9878377,0.009337271,0.00018609667,0.0010121989,0.0013946951,0.00023201798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017984137,0.0021883433,0.0023663626,0.0024846073,0.0011950089,0.00264135,0.0026108788,0.0024345568,0.028107628],"category_scores_gemma":[0.0125812935,0.00092253915,0.0013393838,0.002740749,0.000513826,0.0075365943,0.004590267,0.0017910388,0.011908517],"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.0009632587,0.00082857965,0.002123623,0.0013097007,0.00024041056,0.0005390658,0.0013804032,0.012680478,0.05341023,0.0045975717,0.08083508,0.84109163],"study_design_scores_gemma":[0.0003186337,0.0005805519,0.0027898028,0.00016626976,0.00040977183,0.00064376154,0.0017868745,0.7818859,0.098707795,0.029184232,0.08337342,0.00015290093],"about_ca_topic_score_codex":0.005043973,"about_ca_topic_score_gemma":0.008471258,"teacher_disagreement_score":0.028107628,"about_ca_system_score_codex":0.0005513363,"about_ca_system_score_gemma":0.00075712445,"threshold_uncertainty_score":0.09402931},"labels":[],"label_agreement":null},{"id":"W4244978924","doi":"10.1007/978-3-030-19311-9","title":"Unconventional Computation and Natural Computation","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Natural computing; Computation; Computer science; Cover (algebra); Natural (archaeology); Theoretical computer science; Artificial intelligence; Algorithm; History","score_opus":0.012514188077470801,"score_gpt":0.25819537448685725,"score_spread":0.24568118640938647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244978924","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013280012,0.06209407,0.06716586,0.00782993,0.00226985,0.000029771314,0.00012617666,0.00023233856,0.846972],"genre_scores_gemma":[0.46420065,0.04193021,0.040178843,0.0018827235,0.0042224224,0.00018538862,0.00033142013,0.00029282976,0.44677547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998161,0.000056419554,0.0000066322164,0.0000335821,0.00006928099,0.000017986536],"domain_scores_gemma":[0.99963546,0.00023124373,0.000015440562,0.00006775511,0.000034767087,0.000015290741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654164,0.00041149312,0.0003880197,0.0007743506,0.00086587336,0.0022610119,0.0005896158,0.0006557182,0.011456888],"category_scores_gemma":[0.0010235232,0.00021454482,0.0003082117,0.0010919742,0.0037731417,0.0040328265,0.0009485342,0.0019271022,0.0016855963],"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.0000036961633,0.0000033088431,0.0000194916,0.000041975447,0.0000013642523,0.000009806779,0.000061218125,0.0002456329,0.000103474355,0.98439676,0.005036444,0.010076737],"study_design_scores_gemma":[0.0000015265153,0.000001738716,0.000045988643,0.00002061191,0.0000010616726,0.00003177412,0.000016413182,0.00062081486,0.00006461301,0.9576508,0.041542906,0.0000018356833],"about_ca_topic_score_codex":0.00073162635,"about_ca_topic_score_gemma":0.0010917312,"teacher_disagreement_score":0.011456888,"about_ca_system_score_codex":0.0013725889,"about_ca_system_score_gemma":0.000499481,"threshold_uncertainty_score":0.038327098},"labels":[],"label_agreement":null},{"id":"W4245528340","doi":"10.1007/978-3-662-44196-1_50","title":"Erratum to: Performance Evaluation of a Surgical Telerobotic System Using Kinematic Indices of the Master Hand-Controller","year":2014,"lang":"en","type":"erratum","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Kinematics; Computer science; Controller (irrigation); Surgical robot; Simulation; Control engineering; Artificial intelligence; Robot; Engineering; Physics","score_opus":0.02807811273803864,"score_gpt":0.2916591429844874,"score_spread":0.2635810302464488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245528340","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.005464716,0.002231296,0.004408087,0.054918498,0.9238959,0.00012901245,0.0016982958,0.0009921085,0.0062620244],"genre_scores_gemma":[0.123627506,0.010763652,0.028267585,0.08663229,0.18748184,0.0006163318,0.0068046115,0.0028183735,0.5529877],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997563,0.00026214242,0.0005591763,0.00022628107,0.0012277741,0.00016167709],"domain_scores_gemma":[0.9820911,0.0038649768,0.0009271889,0.00068465766,0.011920895,0.0005110878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012877254,0.0017173585,0.0016460904,0.0016642547,0.0022727512,0.001220933,0.0017722913,0.0063201203,0.027565554],"category_scores_gemma":[0.027320389,0.0007624232,0.0008816238,0.0009591221,0.0013013973,0.0010893211,0.001073268,0.0034506626,0.01872759],"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.0004279462,0.00006336558,0.0005787652,0.00034674138,0.00002481323,0.002862288,0.000102162994,0.00029925432,0.0009091532,0.00073810964,0.97056895,0.023078458],"study_design_scores_gemma":[0.00022518945,0.00074511574,0.008181155,0.0009339978,0.00021066309,0.006832466,0.0008717619,0.0037994578,0.010016637,0.0022123111,0.965725,0.0002462577],"about_ca_topic_score_codex":0.010896636,"about_ca_topic_score_gemma":0.009658802,"teacher_disagreement_score":0.027565554,"about_ca_system_score_codex":0.0021013042,"about_ca_system_score_gemma":0.0023569681,"threshold_uncertainty_score":0.092216015},"labels":[],"label_agreement":null},{"id":"W4245565213","doi":"10.1007/11732990_49","title":"Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"MicroRNA in disease regulation","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"microRNA; Gene; Computational biology; Gene expression; Regulation of gene expression; Biology; Computer science; Genetics","score_opus":0.016826481698970414,"score_gpt":0.2507421171134429,"score_spread":0.2339156354144725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245565213","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.3500252,0.0025293936,0.62483066,0.00031133593,0.00013182338,0.00033915008,0.007228957,0.009090702,0.005512701],"genre_scores_gemma":[0.3719829,0.0014797968,0.60681224,0.00027818748,0.00011373465,0.00047346542,0.01516829,0.0004734135,0.0032180115],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00012819638,0.00005536689,0.00020023694,0.00025524452,0.000052733852],"domain_scores_gemma":[0.9988796,0.0007229361,0.00013865872,0.0000894242,0.00013092287,0.00003852926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011451184,0.0008167739,0.0009642274,0.002656524,0.00023152147,0.0011238412,0.00059997145,0.00090306334,0.0014499106],"category_scores_gemma":[0.002593307,0.0005164209,0.00089655013,0.0022520283,0.0002965084,0.0009374093,0.00070047105,0.00055864814,0.00238749],"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.00077057676,0.0003269326,0.025468769,0.0007055036,0.0002684234,0.0004758343,0.00012236413,0.012498907,0.680334,0.0012241998,0.0023198253,0.27548468],"study_design_scores_gemma":[0.00010802204,0.0007600253,0.03781418,0.00010718918,0.00049640593,0.0025274088,0.0002500613,0.30226874,0.63254297,0.010854029,0.01213523,0.00013571748],"about_ca_topic_score_codex":0.0004076479,"about_ca_topic_score_gemma":0.0009480336,"teacher_disagreement_score":0.002656524,"about_ca_system_score_codex":0.00021074257,"about_ca_system_score_gemma":0.0003031034,"threshold_uncertainty_score":0.0060560703},"labels":[],"label_agreement":null},{"id":"W4245733707","doi":"10.1007/978-3-642-16129-2_13","title":"Inferring Meta-models for Runtime System Data from the Clients of Management APIs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Set (abstract data type); Code (set theory); Runtime system; Range (aeronautics); Data mining; Distributed computing; Programming language","score_opus":0.1242389593893893,"score_gpt":0.31140637404190435,"score_spread":0.18716741465251507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245733707","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.09453459,0.00032915967,0.8788611,0.0006279975,0.0000695105,0.00014966048,0.004657142,0.017459653,0.003311213],"genre_scores_gemma":[0.57477194,0.00050561887,0.4112414,0.0001510196,0.000056975852,0.0001844374,0.007654604,0.0031023447,0.0023316243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971942,0.0006039598,0.00019620798,0.00055120594,0.001187338,0.00026700422],"domain_scores_gemma":[0.98901504,0.0055670915,0.0007841496,0.0035816398,0.0008568647,0.00019515099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003156868,0.0012626823,0.0009067095,0.0020635447,0.00067598233,0.0051166634,0.0030449848,0.0022818455,0.0024465735],"category_scores_gemma":[0.01741805,0.0024602332,0.0029845298,0.0017929486,0.0010990697,0.007858409,0.0019552454,0.0038067866,0.0017595297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015122994,0.0007711137,0.107613474,0.0010127567,0.00073790544,0.0011056934,0.0024008672,0.37352893,0.031879615,0.16362922,0.017532034,0.29827616],"study_design_scores_gemma":[0.000023025537,0.000031507225,0.002877398,0.00005244125,0.00011651478,0.00010994208,0.00012855137,0.9250913,0.017515399,0.0506811,0.0033325125,0.000040318766],"about_ca_topic_score_codex":0.009024671,"about_ca_topic_score_gemma":0.018658677,"teacher_disagreement_score":0.009024671,"about_ca_system_score_codex":0.0016155228,"about_ca_system_score_gemma":0.0025916942,"threshold_uncertainty_score":0.017944276},"labels":[],"label_agreement":null},{"id":"W4245824053","doi":"10.1007/978-3-540-68636-1_62","title":"Maximum Entropy Modeling with Feature Selection for Text Categorization","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Feature selection; Categorization; Principle of maximum entropy; Text categorization; Computer science; Artificial intelligence; Entropy (arrow of time); Pattern recognition (psychology); Feature (linguistics); Selection (genetic algorithm); Data mining; Machine learning; Natural language processing","score_opus":0.018386091831786494,"score_gpt":0.23345593499830458,"score_spread":0.2150698431665181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245824053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010912959,0.00049322465,0.9870602,0.00014484607,0.00005584601,0.00004624872,0.00016356831,0.0006540855,0.0004689447],"genre_scores_gemma":[0.5628306,0.0008957451,0.42583218,0.00019621609,0.00036040068,0.0004819935,0.0017580639,0.00033604223,0.007308687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898046,0.00050464185,0.00006311217,0.00016951465,0.00020401637,0.00007818088],"domain_scores_gemma":[0.99767727,0.0018437017,0.00008095339,0.00018695708,0.00017827735,0.000032863583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022114518,0.00079753814,0.0014633532,0.0010741092,0.00056426635,0.0011140263,0.001347379,0.00091242633,0.0020559535],"category_scores_gemma":[0.0045665884,0.0004644288,0.001490588,0.001480532,0.00041548666,0.0020494969,0.0010534147,0.0013119839,0.0010985694],"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.00052609027,0.0002951717,0.0014946903,0.00022988454,0.00027913266,0.00020012794,0.0001565619,0.38858312,0.009732528,0.013811996,0.008851782,0.5758389],"study_design_scores_gemma":[0.000004965672,0.000021130822,0.0002603818,0.000004717073,0.0000130536655,0.00001895743,0.0000057884977,0.9903115,0.0011451753,0.007872181,0.00033433558,0.000007824043],"about_ca_topic_score_codex":0.0022214942,"about_ca_topic_score_gemma":0.0021506075,"teacher_disagreement_score":0.0022214942,"about_ca_system_score_codex":0.0005595272,"about_ca_system_score_gemma":0.0006030877,"threshold_uncertainty_score":0.011695385},"labels":[],"label_agreement":null},{"id":"W4245891106","doi":"10.1007/978-3-642-24606-7_1","title":"The Role of Conceptual Modeling in Managing and Changing the Business","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Conceptual model; Knowledge management; Conceptual framework; Conceptual schema; Context (archaeology); Dual (grammatical number); Process management; Management science; Business; Engineering","score_opus":0.02219528664785833,"score_gpt":0.20448422225365667,"score_spread":0.18228893560579834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245891106","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.0069431737,0.021362968,0.8313511,0.027814867,0.0010746463,0.000171104,0.00020381555,0.0006281225,0.11045014],"genre_scores_gemma":[0.2327467,0.02334245,0.7220932,0.0030692292,0.00094929786,0.00057489605,0.00049984234,0.0005710154,0.016153416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928335,0.0047999592,0.0003539339,0.00050830015,0.0012647787,0.00023964609],"domain_scores_gemma":[0.986761,0.009864423,0.00048487133,0.0016369021,0.00083906506,0.00041378898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011688233,0.0015316774,0.001175031,0.0033516672,0.0023515094,0.014359142,0.0046373536,0.0033855797,0.0053019254],"category_scores_gemma":[0.015627878,0.00180687,0.0019883693,0.004307988,0.015346667,0.027678886,0.0032524015,0.008026727,0.0013485323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039242095,0.000014100929,0.0000668727,0.000114590504,0.000011045633,0.00003100183,0.0009957647,0.002251523,0.0000995496,0.9804074,0.0017524941,0.014251678],"study_design_scores_gemma":[0.0000068731706,0.0000098283635,0.00005443214,0.00021777092,0.000015216779,0.00006651672,0.00057280576,0.011253933,0.00017003354,0.9341004,0.053514417,0.000017880262],"about_ca_topic_score_codex":0.008231881,"about_ca_topic_score_gemma":0.006863284,"teacher_disagreement_score":0.014359142,"about_ca_system_score_codex":0.0066106566,"about_ca_system_score_gemma":0.005781713,"threshold_uncertainty_score":0.06181401},"labels":[],"label_agreement":null},{"id":"W4246072790","doi":"10.1007/978-3-642-22362-4_7","title":"Performance Comparison of Item-to-Item Skills Models with the IRT Single Latent Trait Model","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Item response theory; Trait; Artificial intelligence; Statistics; Natural language processing; Programming language; Mathematics; Psychometrics","score_opus":0.042491956371650985,"score_gpt":0.23959531536178746,"score_spread":0.19710335899013648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246072790","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.71788037,0.0026673314,0.2516743,0.001975896,0.0008833535,0.00047243136,0.0045144013,0.011989737,0.00794219],"genre_scores_gemma":[0.9081932,0.0005401305,0.075570874,0.0002700829,0.00009351358,0.00041606562,0.009475997,0.0013046556,0.0041354815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9827518,0.013873751,0.00062617706,0.0018355489,0.00058577076,0.00032695493],"domain_scores_gemma":[0.90615356,0.08347751,0.0007775946,0.004486223,0.003766819,0.0013382938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030878764,0.002241576,0.002017674,0.0015657926,0.0009472183,0.0030522167,0.002824315,0.0022564651,0.0065709823],"category_scores_gemma":[0.057173353,0.00081120286,0.0025123104,0.0015314944,0.00068462826,0.0039623603,0.0019781017,0.002832352,0.0040157996],"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.023270974,0.0016721868,0.06713443,0.0010827238,0.0061605377,0.0003436385,0.0018451844,0.40477648,0.0029412757,0.00637161,0.02074809,0.46365288],"study_design_scores_gemma":[0.00028021642,0.00065826287,0.011626025,0.000056391713,0.00042719956,0.000085611195,0.00048329934,0.98155516,0.0011165843,0.0025956694,0.0010184806,0.00009699899],"about_ca_topic_score_codex":0.02344544,"about_ca_topic_score_gemma":0.013958684,"teacher_disagreement_score":0.030878764,"about_ca_system_score_codex":0.001527949,"about_ca_system_score_gemma":0.0025257166,"threshold_uncertainty_score":0.16330451},"labels":[],"label_agreement":null},{"id":"W4246180010","doi":"10.1007/978-3-642-16129-2_15","title":"A Common Framework for Synchronization in Requirements Modelling Languages","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Synchronization (alternating current); Arity; Workflow; Parameterized complexity; Theoretical computer science; Distributed computing; Domain (mathematical analysis); Programming language; Algorithm; Database; Mathematics","score_opus":0.022549608017443122,"score_gpt":0.2830538101074313,"score_spread":0.2605042020899882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246180010","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.00036188157,0.00012259517,0.9954882,0.00034047602,0.00006745207,0.00014102801,0.00007720728,0.0012306742,0.0021703443],"genre_scores_gemma":[0.024003979,0.0004405781,0.9685254,0.00039769258,0.00013734859,0.00077345176,0.00052973366,0.0013535991,0.003838242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9838988,0.0061411415,0.0033647856,0.0019159723,0.0037730758,0.00090617785],"domain_scores_gemma":[0.9867263,0.0044472073,0.0007887913,0.005162485,0.0023332185,0.0005420409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016739499,0.0021386598,0.0025534919,0.0042798803,0.0032334693,0.011716988,0.0071373666,0.0054002553,0.0092538465],"category_scores_gemma":[0.02519806,0.0030189422,0.005992193,0.004792924,0.0056773894,0.014138276,0.008751934,0.011295549,0.0046855235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040148207,0.000050404364,0.00012331305,0.00029672298,0.000050675913,0.00020916687,0.0012556711,0.005441162,0.0015785636,0.940999,0.004885839,0.04506931],"study_design_scores_gemma":[0.00010551243,0.00010481861,0.00016608207,0.00081613974,0.00022626518,0.00048676776,0.0005657677,0.08728387,0.0076944693,0.66720754,0.23518443,0.00015834218],"about_ca_topic_score_codex":0.0040539354,"about_ca_topic_score_gemma":0.004355582,"teacher_disagreement_score":0.016739499,"about_ca_system_score_codex":0.0029651315,"about_ca_system_score_gemma":0.0057542147,"threshold_uncertainty_score":0.08852804},"labels":[],"label_agreement":null},{"id":"W4246206803","doi":"10.1007/978-3-642-21210-9_16","title":"Specifying Overlaps of Heterogeneous Models for Global Consistency Checking","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Consistency (knowledge bases); Metamodeling; Sketch; Consistency model; Set (abstract data type); Semantics (computer science); Model checking; Theoretical computer science; Formal specification; Programming language; Artificial intelligence; Algorithm","score_opus":0.04013181817282049,"score_gpt":0.2534036394125893,"score_spread":0.21327182123976882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246206803","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.02514232,0.00008050035,0.969887,0.00008754004,0.000034280256,0.0001759477,0.00009329365,0.0022392592,0.0022597725],"genre_scores_gemma":[0.42676193,0.00011025025,0.56860054,0.00010084332,0.00003670236,0.00036758388,0.00052469544,0.0018153641,0.0016821484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873842,0.0040980116,0.0011883831,0.0014485404,0.00451699,0.0013638842],"domain_scores_gemma":[0.97328633,0.016385132,0.0015466679,0.0063353176,0.002011453,0.00043514703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076552504,0.0016677886,0.0020332285,0.001994181,0.0019058399,0.003997718,0.003923416,0.002107288,0.0051526865],"category_scores_gemma":[0.028000316,0.0027239344,0.0031952716,0.0018015159,0.0035312388,0.009540912,0.0096648885,0.0043299557,0.000736862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011665582,0.00032853175,0.009622726,0.0010177299,0.0003735623,0.0024679769,0.0048615593,0.22108307,0.033372913,0.5932453,0.004710578,0.12774934],"study_design_scores_gemma":[0.00015519047,0.00013567928,0.0005785525,0.00025467816,0.00030557506,0.00044993128,0.00092690426,0.65008444,0.042990208,0.2913574,0.01266532,0.00009607348],"about_ca_topic_score_codex":0.003295057,"about_ca_topic_score_gemma":0.00626426,"teacher_disagreement_score":0.0076552504,"about_ca_system_score_codex":0.0018343665,"about_ca_system_score_gemma":0.0028099234,"threshold_uncertainty_score":0.040485322},"labels":[],"label_agreement":null},{"id":"W4246438261","doi":"10.1007/11536482","title":"Smart Graphics","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Simon Fraser University","funders":"","keywords":"Graphics; Computer science; Computer graphics (images)","score_opus":0.01661405282727038,"score_gpt":0.2787526267750336,"score_spread":0.2621385739477632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246438261","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001505627,0.0017040515,0.28841907,0.0005334066,0.0011040295,0.00015183656,0.0032643033,0.04232856,0.6609891],"genre_scores_gemma":[0.010581925,0.0016115409,0.07748934,0.00052134634,0.00020483305,0.00017910707,0.004746311,0.0054513854,0.89921415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999686,0.000020422383,0.000011966138,0.00005940411,0.00019482372,0.000027427699],"domain_scores_gemma":[0.9996604,0.000057572433,0.000009942014,0.000128211,0.000098944794,0.000045008182],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002742789,0.0017155642,0.0011178986,0.0017260688,0.0006665568,0.0020747287,0.0016297542,0.001253258,0.43947992],"category_scores_gemma":[0.000817678,0.0011101892,0.00087478396,0.0015436213,0.00038156682,0.002044458,0.0021370975,0.002139243,0.26443768],"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.00009403839,0.000039635175,0.00011201028,0.00019528776,0.0000159154,0.00006944008,0.00006805557,0.0010434161,0.008234418,0.024395203,0.5441804,0.42155215],"study_design_scores_gemma":[0.00004221757,0.00003598296,0.00036161483,0.00006620066,0.000026503974,0.00035888716,0.000023753953,0.008507782,0.006259903,0.013183289,0.9711057,0.000028194827],"about_ca_topic_score_codex":0.00086816965,"about_ca_topic_score_gemma":0.0019608233,"teacher_disagreement_score":0.43947992,"about_ca_system_score_codex":0.00028740513,"about_ca_system_score_gemma":0.00039081112,"threshold_uncertainty_score":0.7995139},"labels":[],"label_agreement":null},{"id":"W4246575585","doi":"10.1007/978-3-030-00834-5","title":"Comparative Genomics","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolution and Genetic Dynamics","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":"Université de Sherbrooke; McGill University","funders":"","keywords":"Computer science; Genomics; Data science; Genome; Biology","score_opus":0.011360343330951775,"score_gpt":0.264909994422672,"score_spread":0.25354965109172023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246575585","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016414015,0.032271065,0.14748016,0.0030709475,0.0021007224,0.00010719784,0.010841669,0.0046620895,0.78305215],"genre_scores_gemma":[0.18280406,0.023683423,0.085635334,0.0021785286,0.0009644947,0.000276023,0.040863663,0.0024689967,0.66112554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975485,0.000027265643,0.0000064758,0.00009984521,0.00008124204,0.000030336603],"domain_scores_gemma":[0.9998845,0.00002029382,0.000006305508,0.000044366803,0.00002576577,0.000018819512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003940276,0.0006365063,0.0007476136,0.0013819193,0.0007262487,0.0014671094,0.0009592889,0.00077293656,0.05469561],"category_scores_gemma":[0.00042491354,0.00039972988,0.00054111757,0.001534885,0.0006029966,0.0013668701,0.000949194,0.0013282108,0.024025466],"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.00015422597,0.000048816215,0.0009289554,0.00056021655,0.00006552503,0.00027295615,0.0003052597,0.0007888259,0.064045094,0.25225964,0.17189488,0.5086755],"study_design_scores_gemma":[0.000010201896,0.0000277493,0.0026461123,0.000064636806,0.000023752671,0.00071619503,0.00007217747,0.0005871623,0.009493746,0.055269018,0.93107563,0.00001357673],"about_ca_topic_score_codex":0.0010981655,"about_ca_topic_score_gemma":0.0017193675,"teacher_disagreement_score":0.05469561,"about_ca_system_score_codex":0.0007527163,"about_ca_system_score_gemma":0.00041192054,"threshold_uncertainty_score":0.18297505},"labels":[],"label_agreement":null},{"id":"W4246953298","doi":"10.1007/11538356","title":"Advances in Intelligent Computing","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Digital Economy","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.018116643354716532,"score_gpt":0.26081228724043365,"score_spread":0.24269564388571713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246953298","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002755194,0.23117615,0.09529696,0.0136746885,0.01364747,0.00009040777,0.00030280152,0.0014027932,0.6416536],"genre_scores_gemma":[0.047172613,0.18547726,0.051238604,0.0038758148,0.008882357,0.00015306889,0.00081295014,0.0006169465,0.70177037],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993672,0.000092086455,0.000031138497,0.00008212482,0.0003804632,0.000047077905],"domain_scores_gemma":[0.9991799,0.0003239022,0.00003180989,0.00019984804,0.00019305518,0.000071494964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008340894,0.0010580387,0.0012715576,0.001514472,0.0007047954,0.0035353757,0.0010976938,0.0012199809,0.041748587],"category_scores_gemma":[0.002010655,0.00042183962,0.00041185552,0.002206322,0.0015131745,0.005306197,0.0019133622,0.0022496372,0.02202725],"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.000024820945,0.000058126236,0.00015322141,0.0005510547,0.000023373736,0.000049227143,0.0001989092,0.0008622475,0.0009737915,0.2407054,0.25873378,0.4976659],"study_design_scores_gemma":[0.0000058658106,0.000021420672,0.0002669498,0.00019466104,0.000013947925,0.00011928045,0.00006370342,0.0019272474,0.0004906992,0.10878362,0.8881045,0.000008091184],"about_ca_topic_score_codex":0.0004480407,"about_ca_topic_score_gemma":0.00085041823,"teacher_disagreement_score":0.041748587,"about_ca_system_score_codex":0.0008293759,"about_ca_system_score_gemma":0.00088220695,"threshold_uncertainty_score":0.13966292},"labels":[],"label_agreement":null},{"id":"W4247108637","doi":"10.1007/978-3-540-24840-8_47","title":"Knowledge Provenance","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Toronto","funders":"","keywords":"Computer science; Provenance; Ontology; Semantics (computer science); Certainty; Relation (database); Semantic Web; Knowledge management; Dependency (UML); Knowledge-based systems; Information retrieval; Artificial intelligence; Data mining; Epistemology; Programming language","score_opus":0.0213873118591734,"score_gpt":0.2571703268964707,"score_spread":0.2357830150372973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247108637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006117506,0.0021318346,0.6943668,0.005195064,0.0019035103,0.00093774014,0.007266665,0.006089531,0.27599135],"genre_scores_gemma":[0.23364864,0.005693069,0.4727343,0.0016921506,0.0009182498,0.00071870943,0.026275897,0.0026476167,0.25567138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573624,0.0008194393,0.00040265557,0.00088584685,0.0019410303,0.0002148002],"domain_scores_gemma":[0.99113995,0.0019671083,0.00021895439,0.004286798,0.0021649878,0.00022223365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003973485,0.00074434595,0.00069134514,0.0037610037,0.0018851354,0.006604065,0.0017667935,0.0014218985,0.040613905],"category_scores_gemma":[0.018654242,0.00075172924,0.0011903986,0.0031985252,0.00171977,0.012149528,0.0045868806,0.0024591333,0.014844383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001739958,0.000108575725,0.00087313086,0.00040798573,0.000050470062,0.00036316342,0.00086673076,0.0028474473,0.0027998497,0.59284925,0.058318168,0.3403412],"study_design_scores_gemma":[0.000026114896,0.000030685034,0.00033749273,0.00024486615,0.00006574971,0.00038843657,0.0003260294,0.00940399,0.0066439533,0.4278479,0.554648,0.000036802972],"about_ca_topic_score_codex":0.005519164,"about_ca_topic_score_gemma":0.00505744,"teacher_disagreement_score":0.040613905,"about_ca_system_score_codex":0.0016880198,"about_ca_system_score_gemma":0.004599067,"threshold_uncertainty_score":0.13586712},"labels":[],"label_agreement":null},{"id":"W4247619421","doi":"10.1007/978-3-319-68699-8","title":"Information Retrieval","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":127,"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":"Computer science; Information retrieval","score_opus":0.018085433261847226,"score_gpt":0.26992867091771905,"score_spread":0.2518432376558718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247619421","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024608967,0.06144868,0.097413175,0.0029808164,0.003296153,0.00044308713,0.0041952073,0.0076142424,0.82014775],"genre_scores_gemma":[0.0128904395,0.034886446,0.03784736,0.0011823485,0.0017701719,0.00020033105,0.008417675,0.0011227495,0.90168256],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987907,0.0001210315,0.000080114056,0.00018288585,0.0007478722,0.00007744864],"domain_scores_gemma":[0.9989214,0.00020555942,0.000050384977,0.00039293995,0.0003563627,0.00007339897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094127335,0.0016407719,0.001792568,0.0076667015,0.0009775283,0.0049876412,0.0016930391,0.0012558217,0.14688616],"category_scores_gemma":[0.0025447358,0.00066061714,0.0009211435,0.008423338,0.0008220773,0.005597508,0.0019228223,0.0014605854,0.24674955],"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.000025161977,0.00005773955,0.00010710615,0.00066849287,0.000034416626,0.000041441985,0.00005931514,0.00031898657,0.0028854266,0.020807603,0.34331068,0.6316836],"study_design_scores_gemma":[0.000010296576,0.000051692958,0.00049340376,0.00029123653,0.00003548501,0.0004360373,0.00005942689,0.0012087148,0.0038529404,0.021859165,0.97167635,0.000025294417],"about_ca_topic_score_codex":0.0009138872,"about_ca_topic_score_gemma":0.0015318496,"teacher_disagreement_score":0.14688616,"about_ca_system_score_codex":0.0012238609,"about_ca_system_score_gemma":0.0015319634,"threshold_uncertainty_score":0.49138314},"labels":[],"label_agreement":null},{"id":"W4247849392","doi":"10.1007/3-540-36208-8_12","title":"Quantitative Approaches in Object-Oriented Software Engineering","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Université de Montréal","funders":"","keywords":"Computer science; Presentation (obstetrics); Software engineering; Software; Software quality; Software development; Software sizing; Software construction; Programming language","score_opus":0.03452165125240626,"score_gpt":0.23481564206714636,"score_spread":0.20029399081474009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247849392","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.0019302231,0.0054297415,0.9796053,0.00083601696,0.00019371466,0.000056189005,0.000061449035,0.0002599313,0.011627504],"genre_scores_gemma":[0.14696598,0.010821554,0.8208282,0.0006084933,0.00068237924,0.00064253085,0.00024340402,0.00037750095,0.018829975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602735,0.0014037336,0.00025544973,0.00028807015,0.0019219986,0.00010344359],"domain_scores_gemma":[0.9923046,0.005961079,0.00031069116,0.00060051656,0.0007181467,0.0001049912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004394089,0.0011727381,0.0011801567,0.0026123556,0.000805474,0.0028084207,0.0020106635,0.00094236946,0.0049228864],"category_scores_gemma":[0.0119821755,0.0010810286,0.0006935737,0.0029123626,0.003840976,0.0053574434,0.0014181229,0.002455198,0.0008955879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008480702,0.000048816524,0.0001347469,0.0003631845,0.000015073324,0.000023526904,0.00022415162,0.0060918005,0.00059912703,0.9376936,0.0023039465,0.05249356],"study_design_scores_gemma":[0.000007807148,0.0000148325535,0.0001443164,0.000095185205,0.000011999677,0.000029053195,0.00006650355,0.014546673,0.00046073948,0.9701141,0.014497259,0.000011536104],"about_ca_topic_score_codex":0.0011679071,"about_ca_topic_score_gemma":0.0011166523,"teacher_disagreement_score":0.0049228864,"about_ca_system_score_codex":0.0017643647,"about_ca_system_score_gemma":0.0012074439,"threshold_uncertainty_score":0.02323842},"labels":[],"label_agreement":null},{"id":"W4248078382","doi":"10.1007/978-3-319-71682-4_17","title":"Multiple-Profile Prediction-of-Use Games","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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 Toronto","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.08432636468321983,"score_gpt":0.3379894447725103,"score_spread":0.2536630800892905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248078382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065303825,0.0007694025,0.828251,0.004340026,0.00026315483,0.00046777347,0.0009817583,0.0004196214,0.09920356],"genre_scores_gemma":[0.88479966,0.0009786676,0.054718032,0.0005339032,0.00029320281,0.00056012213,0.0005087796,0.000106306834,0.057501245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952618,0.0026100934,0.00018095432,0.00062582165,0.00071411533,0.00060719514],"domain_scores_gemma":[0.99066275,0.007233583,0.00046943605,0.0007791585,0.00036338673,0.0004917466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039073057,0.002273995,0.0025179642,0.00067419757,0.0011387657,0.0042322967,0.0044775954,0.004358341,0.011715116],"category_scores_gemma":[0.017694596,0.000833604,0.0012702377,0.0012714596,0.0017864353,0.007435788,0.002866879,0.004151301,0.001872659],"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.00039863156,0.00022043538,0.0010446303,0.00018507212,0.0001174258,0.0003686254,0.00028803514,0.0864534,0.00086555834,0.8600927,0.012050249,0.037915174],"study_design_scores_gemma":[0.000086757034,0.000073320094,0.00028544283,0.000034835826,0.000028220546,0.00017932468,0.00007252665,0.41930366,0.00041841858,0.57600677,0.0034749426,0.000035788948],"about_ca_topic_score_codex":0.0019273886,"about_ca_topic_score_gemma":0.0028983916,"teacher_disagreement_score":0.011715116,"about_ca_system_score_codex":0.0024791686,"about_ca_system_score_gemma":0.0015714825,"threshold_uncertainty_score":0.039190948},"labels":[],"label_agreement":null},{"id":"W4248290991","doi":"10.1007/978-3-642-16373-9_5","title":"Finding Solutions in Goal Models: An Interactive Backward Reasoning Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":43,"is_retracted":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":"Viewpoints; Computer science; Ask price; Human–computer interaction; Domain (mathematical analysis); Goal orientation; Management science","score_opus":0.066060017546595,"score_gpt":0.30086303419435645,"score_spread":0.23480301664776143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248290991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018704992,0.0000538714,0.9938678,0.00016199806,0.000010433393,0.00009431923,0.0001258058,0.00085821655,0.002957012],"genre_scores_gemma":[0.027562521,0.00012758511,0.96890736,0.000079008285,0.000011665709,0.00014724726,0.00056955824,0.00028174513,0.0023133564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962083,0.001420128,0.00029831415,0.0005085038,0.0013199955,0.00024476548],"domain_scores_gemma":[0.9886143,0.009445044,0.00025287698,0.00091303553,0.0006335194,0.00014106599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065588346,0.002484931,0.0018966339,0.0034021968,0.002345905,0.0053075133,0.0068267933,0.0030816875,0.02414362],"category_scores_gemma":[0.017619,0.0023304739,0.0064361994,0.0027073491,0.0024245647,0.010451209,0.008037041,0.0056704353,0.004000829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006476437,0.0007303073,0.0011373147,0.0019753475,0.00045259576,0.0006227265,0.002152659,0.14794329,0.0100245755,0.43419233,0.011673198,0.38844803],"study_design_scores_gemma":[0.0001748973,0.00007807947,0.00014691301,0.00022829288,0.0003166398,0.00016633172,0.0003841493,0.49760386,0.009405361,0.47834247,0.013087503,0.00006546638],"about_ca_topic_score_codex":0.0061496394,"about_ca_topic_score_gemma":0.009850968,"teacher_disagreement_score":0.02414362,"about_ca_system_score_codex":0.0017602376,"about_ca_system_score_gemma":0.00269343,"threshold_uncertainty_score":0.08076841},"labels":[],"label_agreement":null},{"id":"W4248568606","doi":"10.1007/978-3-540-76778-7_6","title":"Correlation-Based Content Adaptation for Mobile Web Browsing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Toronto","funders":"","keywords":"Computer science; Adaptation (eye); Content adaptation; Web content; Fidelity; World Wide Web; Resource (disambiguation); Multimedia; Mobile device; Web page; Human–computer interaction; Ubiquitous computing; Computer network","score_opus":0.06438257793434539,"score_gpt":0.27984647427698744,"score_spread":0.21546389634264207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248568606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064871065,0.0017826499,0.9238628,0.00015100272,0.00017701449,0.0001440749,0.0003076246,0.0055614174,0.0031422772],"genre_scores_gemma":[0.73494464,0.0007135541,0.25757736,0.00014564481,0.00020590692,0.00015742012,0.000617264,0.0004902343,0.0051480094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991392,0.00023367193,0.000044248492,0.00021639251,0.00027911447,0.00008732848],"domain_scores_gemma":[0.998026,0.0009868144,0.00010713035,0.00031790748,0.00048319934,0.000079121666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010503387,0.00060736464,0.0013001653,0.001127647,0.00047636693,0.00079060736,0.0013895048,0.0009330142,0.0027781785],"category_scores_gemma":[0.004452994,0.0004413503,0.0006388461,0.0017927779,0.00033705126,0.0011288503,0.0008741091,0.001067225,0.0014969056],"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.0010632433,0.0007362568,0.0039590215,0.00021468449,0.00023669227,0.00017992248,0.00015854742,0.14654052,0.046741303,0.0030069815,0.010340035,0.7868228],"study_design_scores_gemma":[0.000018737686,0.000062215346,0.0017096008,0.000007471856,0.00003450871,0.0000744596,0.000015387734,0.99106604,0.0052096387,0.0009072983,0.00087384135,0.000020843721],"about_ca_topic_score_codex":0.0100492565,"about_ca_topic_score_gemma":0.0150708435,"teacher_disagreement_score":0.0100492565,"about_ca_system_score_codex":0.00064005004,"about_ca_system_score_gemma":0.00061311765,"threshold_uncertainty_score":0.019981503},"labels":[],"label_agreement":null},{"id":"W4248627736","doi":"10.1007/978-3-540-30229-2_8","title":"iOverlay: A Lightweight Middleware Infrastructure for Overlay Application Implementations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Toronto","funders":"","keywords":"PlanetLab; Computer science; Testbed; Overlay; Overlay network; Implementation; Middleware (distributed applications); Distributed computing; Set (abstract data type); Computer network; Operating system; Software engineering; The Internet; Programming language","score_opus":0.012777402824378765,"score_gpt":0.2607294191314862,"score_spread":0.24795201630710742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248627736","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.010602994,0.00065387285,0.8684391,0.0003303878,0.0004165375,0.00021247384,0.000365426,0.10945567,0.009523506],"genre_scores_gemma":[0.22184934,0.0015254123,0.69338316,0.00069608126,0.00036465144,0.0005635358,0.0050885226,0.02436276,0.052166518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859923,0.0001617742,0.00014858521,0.00017245229,0.00064859627,0.0002694675],"domain_scores_gemma":[0.99785197,0.00037058428,0.00014672577,0.0010416345,0.00032776262,0.00026140487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021796373,0.0010082494,0.0009745994,0.0010956462,0.001068115,0.0030549995,0.004250133,0.0013585673,0.008351173],"category_scores_gemma":[0.004304858,0.0013793842,0.00087606936,0.0009903399,0.00071171485,0.0050272997,0.0043145344,0.002548943,0.0038511464],"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.0014685445,0.00042080905,0.0023398567,0.001076042,0.00029334624,0.0005743928,0.0012464569,0.0154291345,0.098010235,0.102098964,0.13856366,0.6384785],"study_design_scores_gemma":[0.00041887208,0.00046301022,0.002398816,0.000248149,0.00033884728,0.0010388646,0.0003643648,0.23911382,0.14488429,0.071741946,0.53864664,0.00034243634],"about_ca_topic_score_codex":0.0025842304,"about_ca_topic_score_gemma":0.0031576212,"teacher_disagreement_score":0.008351173,"about_ca_system_score_codex":0.0012110169,"about_ca_system_score_gemma":0.001783944,"threshold_uncertainty_score":0.027937472},"labels":[],"label_agreement":null},{"id":"W4248900233","doi":"10.1007/978-3-642-22362-4_4","title":"Coping with Poor Advice from Peers in Peer-Based Intelligent Tutoring: The Case of Avoiding Bad Annotations of Learning Objects","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reputation; Coping (psychology); Advice (programming); Annotation; Learning environment; Artificial intelligence; Human–computer interaction; Knowledge management; Mathematics education; Psychology","score_opus":0.02972895015138399,"score_gpt":0.26163286242078426,"score_spread":0.23190391226940027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248900233","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.8621454,0.0015259535,0.10470132,0.009599791,0.00027170975,0.00010063891,0.00009401597,0.0011057666,0.020455329],"genre_scores_gemma":[0.9794447,0.00017831457,0.017942738,0.00017873458,0.00006269879,0.000021396634,0.000043322587,0.000060576265,0.0020675978],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99672854,0.0018913815,0.00012430063,0.00034880725,0.0005119674,0.00039493656],"domain_scores_gemma":[0.97208756,0.019775912,0.0021306206,0.0022321707,0.0017937986,0.001979962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054416773,0.0006427198,0.00076987525,0.00062470423,0.0022112348,0.0022946673,0.0025405937,0.006817424,0.0017613407],"category_scores_gemma":[0.034988493,0.00035655126,0.00042015407,0.00069003983,0.0017774489,0.0036362752,0.0024812084,0.0024505288,0.00051592645],"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.0031995815,0.0020560005,0.10993363,0.001533409,0.0005645758,0.045490075,0.08828485,0.059560813,0.034486476,0.04651743,0.040900033,0.56747323],"study_design_scores_gemma":[0.00047462696,0.002079736,0.045048,0.0004410761,0.0009045599,0.03958504,0.047914155,0.5881094,0.03206221,0.19632845,0.046581622,0.00047120158],"about_ca_topic_score_codex":0.0025434277,"about_ca_topic_score_gemma":0.0036562232,"teacher_disagreement_score":0.006817424,"about_ca_system_score_codex":0.0006172453,"about_ca_system_score_gemma":0.0007891467,"threshold_uncertainty_score":0.028778672},"labels":[],"label_agreement":null},{"id":"W4249254142","doi":"10.1007/978-3-642-39310-5","title":"Descriptional Complexity of Formal Systems","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","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":"Western University","funders":"","keywords":"Computer science; Formal system; Formal methods; Formal language; Programming language; Software engineering","score_opus":0.04094704262930757,"score_gpt":0.2482400812262219,"score_spread":0.20729303859691434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249254142","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13320045,0.0153841805,0.58001465,0.0149602555,0.0005224509,0.0001391222,0.0017627876,0.00054826576,0.25346783],"genre_scores_gemma":[0.8995021,0.0075454847,0.06324464,0.000613584,0.00096463045,0.000279114,0.0015695299,0.00021876572,0.026062204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743927,0.0005415801,0.00017818075,0.000336558,0.0013130716,0.00019123772],"domain_scores_gemma":[0.99507153,0.0033890372,0.00025184368,0.00060461083,0.00048729585,0.00019571155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013476388,0.0007098466,0.0009963271,0.0021725895,0.0012722355,0.0060379505,0.0014014062,0.0008796687,0.006626325],"category_scores_gemma":[0.006054408,0.00073812396,0.0011947955,0.002639051,0.004089833,0.011438083,0.0029416883,0.0045266137,0.00069326744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008240994,0.0000076058527,0.000113656395,0.00005365779,0.000008046708,0.000017715549,0.00013464184,0.0019051253,0.00017031234,0.9890616,0.001407556,0.0071117715],"study_design_scores_gemma":[0.0000026431487,0.0000025976626,0.000061413135,0.00000861067,0.0000032912778,0.000024344568,0.000027726986,0.0034469003,0.00009079752,0.9932278,0.0030996816,0.000004212018],"about_ca_topic_score_codex":0.0011356956,"about_ca_topic_score_gemma":0.0007443651,"teacher_disagreement_score":0.006626325,"about_ca_system_score_codex":0.0036091066,"about_ca_system_score_gemma":0.0010613737,"threshold_uncertainty_score":0.02618599},"labels":[],"label_agreement":null},{"id":"W4249399562","doi":"10.1007/978-3-540-75698-9_12","title":"Automatic Composition of Stateless Components: A Logical Reasoning Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stateless protocol; Component (thermodynamics); Computer science; Reuse; Workflow; Component-based software engineering; Composition (language); Simple (philosophy); Software; Programming language; Process (computing); Software engineering; Software system; Distributed computing; Theoretical computer science; Database; Engineering","score_opus":0.023052242737066346,"score_gpt":0.2535276898149459,"score_spread":0.23047544707787954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249399562","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.0028999161,0.00006458938,0.99453944,0.00007978355,0.000027923375,0.000061511826,0.000025129564,0.0010432447,0.0012584113],"genre_scores_gemma":[0.0658574,0.00015988444,0.9309255,0.00010008442,0.000038174865,0.00010764642,0.00020498734,0.0003234464,0.00228294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591285,0.0009936373,0.00041120715,0.0007159717,0.0016555252,0.00031073467],"domain_scores_gemma":[0.9910499,0.0060557798,0.00038403503,0.001408035,0.00092785974,0.00017433985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00547101,0.001335568,0.001293139,0.0020459692,0.0024136135,0.0046394495,0.0048007406,0.0022620556,0.0070504],"category_scores_gemma":[0.013017929,0.002367562,0.0042399317,0.0014916812,0.004765734,0.008987578,0.003880524,0.0033149142,0.0015617344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048765694,0.00037066982,0.000998262,0.0009874476,0.00026771863,0.00095150276,0.0012315726,0.07931582,0.031639036,0.65501416,0.0050761406,0.22366002],"study_design_scores_gemma":[0.00013307692,0.00007380284,0.00015320549,0.00012653053,0.0003543834,0.00038700472,0.00016937485,0.42605048,0.034985196,0.5263503,0.0111394245,0.0000772245],"about_ca_topic_score_codex":0.002007224,"about_ca_topic_score_gemma":0.0033524956,"teacher_disagreement_score":0.0070504,"about_ca_system_score_codex":0.0012855479,"about_ca_system_score_gemma":0.0020984034,"threshold_uncertainty_score":0.028933764},"labels":[],"label_agreement":null},{"id":"W4249594181","doi":"10.1007/978-3-319-10590-1","title":"Computer Vision – ECCV 2014","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence","score_opus":0.009582690174665225,"score_gpt":0.22831043900542425,"score_spread":0.21872774883075902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249594181","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046081324,0.06535157,0.63504237,0.004326851,0.019958429,0.00028772166,0.0041479263,0.019650642,0.24662644],"genre_scores_gemma":[0.031893723,0.042062342,0.16992888,0.0010628339,0.0036289115,0.0003850438,0.012442276,0.005016095,0.73358],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987897,0.00011485827,0.000053645825,0.00025996318,0.00069392176,0.000087848144],"domain_scores_gemma":[0.99887973,0.00014843572,0.000037017944,0.00040424,0.00044320847,0.00008735378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562536,0.0026055574,0.0026973432,0.003043063,0.00057121227,0.0033485435,0.003434771,0.0022788318,0.09306283],"category_scores_gemma":[0.0023865427,0.0012266178,0.0011041752,0.0031577072,0.0007869097,0.0029739127,0.0022079782,0.002739692,0.06550509],"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.000033587094,0.000038973674,0.00006703765,0.0002950651,0.000050376508,0.000027879032,0.0000108918475,0.0038619633,0.0018859608,0.009309848,0.3702833,0.6141352],"study_design_scores_gemma":[0.000027081,0.000080047575,0.0013233193,0.00033008074,0.000075145406,0.0005895034,0.000033519656,0.041340575,0.0062507666,0.05135486,0.8985328,0.00006236514],"about_ca_topic_score_codex":0.002757704,"about_ca_topic_score_gemma":0.0034339079,"teacher_disagreement_score":0.09306283,"about_ca_system_score_codex":0.0018036788,"about_ca_system_score_gemma":0.0015105004,"threshold_uncertainty_score":0.3113262},"labels":[],"label_agreement":null},{"id":"W4249628154","doi":"10.1007/978-3-642-31368-4","title":"Autonomous and Intelligent Systems","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Internet of Things and AI","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.013471142474363264,"score_gpt":0.2344277073931301,"score_spread":0.22095656491876683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249628154","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034428271,0.040847335,0.0853478,0.006397572,0.0025244174,0.00008656991,0.00017163726,0.00046973457,0.86071223],"genre_scores_gemma":[0.16777511,0.04076773,0.043780558,0.0029984114,0.0027612755,0.00032113912,0.0005948209,0.00027560006,0.74072534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970835,0.000053036812,0.000013203618,0.000059232327,0.00013704064,0.00002901907],"domain_scores_gemma":[0.99980325,0.000068744695,0.0000136928675,0.00005762329,0.000031866457,0.000024896417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003065261,0.00076607557,0.0005686881,0.00045566566,0.0005740766,0.0030601025,0.00069180154,0.001011326,0.015095993],"category_scores_gemma":[0.00070611486,0.0003527398,0.00029309271,0.00057384715,0.0030880813,0.003712556,0.0017640315,0.0015537395,0.005589912],"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.00001101168,0.00002406241,0.0001061815,0.00019281798,0.000017249025,0.000051579143,0.0003885275,0.0014938804,0.0010297664,0.87595624,0.04170196,0.07902676],"study_design_scores_gemma":[0.0000069379385,0.00002054681,0.00022466568,0.000110685025,0.000007630729,0.000113946364,0.00012306566,0.0017456171,0.00045501633,0.4789578,0.51822644,0.0000076173937],"about_ca_topic_score_codex":0.0006223207,"about_ca_topic_score_gemma":0.0007241309,"teacher_disagreement_score":0.015095993,"about_ca_system_score_codex":0.0008147698,"about_ca_system_score_gemma":0.00081638794,"threshold_uncertainty_score":0.05050111},"labels":[],"label_agreement":null},{"id":"W4250270811","doi":"10.1007/978-3-319-12206-9","title":"Conceptual Modeling","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Atlanta; Conceptual model; Software engineering; Operations research; Library science; Engineering; Database; History","score_opus":0.026330389011102084,"score_gpt":0.25304330291807664,"score_spread":0.22671291390697457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250270811","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.0020525248,0.0028039897,0.74195707,0.0027746225,0.0005454494,0.000272648,0.0023035973,0.0032882702,0.24400182],"genre_scores_gemma":[0.09941946,0.008917262,0.59358966,0.001432963,0.00043954796,0.00068117806,0.020322487,0.0018409269,0.27335647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984534,0.00036001383,0.00014962394,0.00037408766,0.00057978136,0.000083145176],"domain_scores_gemma":[0.99889165,0.0002780778,0.000039450955,0.00044536366,0.000297529,0.000047956502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014854869,0.0011958771,0.00068615703,0.0024059182,0.0013003931,0.006491237,0.0023224463,0.0012344627,0.041360512],"category_scores_gemma":[0.0039325575,0.00070072414,0.001637178,0.0031733387,0.0012257992,0.00821061,0.0025548514,0.0022056722,0.020493502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011136986,0.00003072611,0.00010557876,0.00013866198,0.000017227438,0.000053918182,0.00027728896,0.0015811779,0.0005166391,0.8598816,0.026330281,0.111055814],"study_design_scores_gemma":[0.000007411714,0.0000084022495,0.00009522063,0.00013599083,0.000027632246,0.00015587517,0.00017390843,0.009766898,0.0011669596,0.4037737,0.5846753,0.000012662783],"about_ca_topic_score_codex":0.005045407,"about_ca_topic_score_gemma":0.004082145,"teacher_disagreement_score":0.041360512,"about_ca_system_score_codex":0.0020366577,"about_ca_system_score_gemma":0.0024608055,"threshold_uncertainty_score":0.13836473},"labels":[],"label_agreement":null},{"id":"W4250281318","doi":"10.1007/978-3-030-33327-0","title":"Machine Learning and Medical Engineering for Cardiovascular Health and Intravascular Imaging and Computer Assisted Stenting","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cerebrovascular and Carotid Artery Diseases","field":"Medicine","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 Calgary; École de Technologie Supérieure","funders":"","keywords":"Computer science; Medical imaging; Stent; Artificial intelligence; Medical physics; Software engineering; Radiology; Medicine","score_opus":0.006362522901052031,"score_gpt":0.22973413073594712,"score_spread":0.2233716078348951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250281318","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027371934,0.2952908,0.30674896,0.010454215,0.021818807,0.0001364837,0.0009530989,0.0015758994,0.36028457],"genre_scores_gemma":[0.012506264,0.09921946,0.08281228,0.0022474069,0.011379218,0.00013774705,0.0007806656,0.0005738492,0.79034305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973243,0.000030945812,0.000014656112,0.00004806081,0.00016327192,0.000010614904],"domain_scores_gemma":[0.9994598,0.0003035776,0.000025975423,0.000042951146,0.00012747236,0.00004026257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038911056,0.0014170955,0.0011907093,0.002074174,0.00034462,0.0014998405,0.0006779362,0.001089128,0.029876575],"category_scores_gemma":[0.0010813891,0.00040074208,0.00069635076,0.0017610899,0.0007095835,0.0020811658,0.000997541,0.0024582434,0.019684551],"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.00002094488,0.000050900748,0.00014656108,0.0006603925,0.00003409752,0.00008994001,0.00007697337,0.004239317,0.0027481085,0.059490167,0.30244985,0.6299927],"study_design_scores_gemma":[0.00000911675,0.00007837063,0.0011985938,0.0005174689,0.000029187682,0.0008002461,0.00003689715,0.01533411,0.0014614275,0.10663087,0.87386423,0.00003948792],"about_ca_topic_score_codex":0.0005856943,"about_ca_topic_score_gemma":0.0014385799,"teacher_disagreement_score":0.029876575,"about_ca_system_score_codex":0.00058941636,"about_ca_system_score_gemma":0.00051196624,"threshold_uncertainty_score":0.099947035},"labels":[],"label_agreement":null},{"id":"W4250349204","doi":"10.1007/978-3-642-24485-8_49","title":"Correctness of Model Synchronization Based on Triple Graph Grammars","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Rule-based machine translation; Graph; Synchronization (alternating current); Theoretical computer science; Programming language; Artificial intelligence; Computer network","score_opus":0.018451680413677424,"score_gpt":0.22602475468852,"score_spread":0.2075730742748426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250349204","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.025902312,0.00014227671,0.96408814,0.00032717196,0.00012068788,0.00009959272,0.00015367693,0.0030663672,0.0060997815],"genre_scores_gemma":[0.7338647,0.0003882719,0.25537774,0.0003601668,0.00013820364,0.00038374276,0.0011912395,0.0021253228,0.0061705606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99398816,0.0017582492,0.0005030452,0.0009620753,0.0021940346,0.00059447176],"domain_scores_gemma":[0.9883752,0.0063458565,0.00051011983,0.0032307971,0.0013477036,0.00019034863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003960752,0.00067133544,0.0015048477,0.0010030642,0.0013020217,0.0033400785,0.0023953333,0.0017531761,0.0046371487],"category_scores_gemma":[0.015300958,0.0012363879,0.0023069978,0.0012217078,0.0042984,0.0056751394,0.003573693,0.003486011,0.0011571826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041751558,0.00011088054,0.0015132262,0.00027917608,0.00010754086,0.00043220713,0.0009588076,0.069926515,0.011920917,0.84691703,0.004075239,0.063340954],"study_design_scores_gemma":[0.00015272108,0.00008499948,0.0003403402,0.00006171955,0.000111274065,0.00016747268,0.00013897922,0.19336568,0.022240918,0.77712065,0.006166963,0.000048183712],"about_ca_topic_score_codex":0.0039110603,"about_ca_topic_score_gemma":0.0026652236,"teacher_disagreement_score":0.0046371487,"about_ca_system_score_codex":0.0013091724,"about_ca_system_score_gemma":0.00331859,"threshold_uncertainty_score":0.020946741},"labels":[],"label_agreement":null},{"id":"W4250640589","doi":"10.1007/978-3-540-89856-6_1","title":"Adaptive Content-Based Routing in General Overlay Topologies","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network topology; PlanetLab; Computer network; Overlay; Overlay network; Distributed computing; Software deployment; Publication; Routing (electronic design automation); The Internet; World Wide Web; Operating system","score_opus":0.043332359430174903,"score_gpt":0.25036198966899237,"score_spread":0.20702963023881746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250640589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038093407,0.00089560414,0.9507985,0.00020401475,0.00011712286,0.00008246377,0.00007296513,0.0010706167,0.0086653195],"genre_scores_gemma":[0.72437674,0.0012702062,0.26320484,0.000075832606,0.00019480618,0.00009605001,0.00025849894,0.00021639754,0.0103065735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955815,0.000109468725,0.000019837364,0.00008715048,0.00016923978,0.000056278568],"domain_scores_gemma":[0.99873,0.00068117946,0.00006421981,0.0002898181,0.00017970367,0.000055173616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066223496,0.00040071268,0.0007379439,0.0007728909,0.00054327026,0.00097198586,0.00152824,0.00079685746,0.0014774153],"category_scores_gemma":[0.0028864366,0.00038052918,0.00030677347,0.0011501461,0.00056759425,0.0020179872,0.0010573434,0.00071172125,0.00039767573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030887345,0.00012188281,0.0011370933,0.00035814097,0.00009760208,0.00040132727,0.00035319358,0.50147957,0.055052094,0.13569935,0.008900274,0.29609057],"study_design_scores_gemma":[0.000014263467,0.00004178001,0.0003328934,0.000009972986,0.00002130114,0.00022286361,0.000036671794,0.9432367,0.005102737,0.04719976,0.0037675349,0.000013511902],"about_ca_topic_score_codex":0.0008170035,"about_ca_topic_score_gemma":0.0011066868,"teacher_disagreement_score":0.00152824,"about_ca_system_score_codex":0.0005911568,"about_ca_system_score_gemma":0.00025677597,"threshold_uncertainty_score":0.0049424767},"labels":[],"label_agreement":null},{"id":"W4251361823","doi":"10.1007/978-3-642-41218-9","title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Granular computing; Computer science; Rough set; Data mining; Fuzzy set; Fuzzy logic; Artificial intelligence","score_opus":0.03163605036387624,"score_gpt":0.2674393513137891,"score_spread":0.23580330094991286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251361823","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012166589,0.3922343,0.5019663,0.008526328,0.00256446,0.00016876671,0.00076590327,0.0006510484,0.08095632],"genre_scores_gemma":[0.28604287,0.24321878,0.43521997,0.0019798547,0.0049053775,0.00040983988,0.0014461607,0.00016051636,0.02661664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982614,0.000402957,0.00017961694,0.0002070561,0.00087636075,0.00007271146],"domain_scores_gemma":[0.9982358,0.0012095453,0.00017519564,0.00018434227,0.0001440723,0.000051006187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020043985,0.0011398786,0.0024756982,0.0034998762,0.0005782053,0.0053234366,0.0010871963,0.001150905,0.0032462226],"category_scores_gemma":[0.005192281,0.0006330805,0.0011648756,0.0076633827,0.0029449288,0.0050230487,0.0013866831,0.0025963935,0.0009786899],"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.000058882542,0.000055823246,0.00058697554,0.0017753268,0.00013947052,0.00017568622,0.00037598546,0.013023106,0.00088951504,0.73014325,0.0223365,0.2304395],"study_design_scores_gemma":[0.000009522264,0.000024481486,0.00047443958,0.00025064332,0.000037206548,0.00019746507,0.00013440404,0.011118311,0.00023558653,0.95127594,0.03621562,0.000026395926],"about_ca_topic_score_codex":0.0011103431,"about_ca_topic_score_gemma":0.0010729097,"teacher_disagreement_score":0.0053234366,"about_ca_system_score_codex":0.001137877,"about_ca_system_score_gemma":0.0009004334,"threshold_uncertainty_score":0.010859668},"labels":[],"label_agreement":null},{"id":"W4251596819","doi":"10.1007/978-3-540-78646-7_22","title":"Automatic Extraction of Domain-Specific Stopwords from Labeled Documents","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Classifier (UML); Information loss; Filter (signal processing); Data mining; Set (abstract data type); Artificial intelligence; Information retrieval","score_opus":0.016860157106389422,"score_gpt":0.25073532390945685,"score_spread":0.23387516680306744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251596819","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.23881242,0.0090813,0.6758901,0.0010817674,0.0014373355,0.0013706535,0.022263598,0.03889545,0.011167378],"genre_scores_gemma":[0.23784034,0.0039240373,0.65891296,0.0005011,0.00040835567,0.0006231207,0.08146454,0.0021161125,0.014209536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00014173622,0.00017378556,0.00025396774,0.00039061316,0.000121005505],"domain_scores_gemma":[0.99530953,0.0015081926,0.0004611314,0.00035183618,0.002210665,0.00015872056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076447777,0.0021874239,0.0019860042,0.0062684915,0.001396435,0.0025056396,0.0013795478,0.0018409245,0.0023027402],"category_scores_gemma":[0.0031647212,0.0007532107,0.0012463483,0.004833257,0.0004474839,0.0015409603,0.0009874395,0.0016409883,0.007610884],"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.0007764255,0.00041706004,0.006500702,0.0030118194,0.00026411825,0.0027411869,0.0006736444,0.0025856683,0.29176006,0.0025701546,0.041768085,0.646931],"study_design_scores_gemma":[0.0002522324,0.000784207,0.028054696,0.00085883576,0.0013525714,0.007786584,0.0019845178,0.2016178,0.6168149,0.010392459,0.12981123,0.0002899544],"about_ca_topic_score_codex":0.002476505,"about_ca_topic_score_gemma":0.0053109457,"teacher_disagreement_score":0.0062684915,"about_ca_system_score_codex":0.0006389024,"about_ca_system_score_gemma":0.00229727,"threshold_uncertainty_score":0.0077034235},"labels":[],"label_agreement":null},{"id":"W4251839725","doi":"10.1007/3-540-45139-0_17","title":"Modeling and verifying a price model for congestion control in computer networks using promela/spin","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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 Toronto","funders":"","keywords":"Promela; Computer science; Network packet; Network congestion; Convergence (economics); Enforcement; Model checking; Computer network; Distributed computing; Theoretical computer science","score_opus":0.025443230262340966,"score_gpt":0.24967872851485948,"score_spread":0.2242354982525185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251839725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053481124,0.00008793549,0.9401393,0.0002479099,0.000057238398,0.000107102795,0.00011500735,0.0021158105,0.0036485791],"genre_scores_gemma":[0.84031254,0.00012430399,0.15680538,0.00009486348,0.000028511009,0.00012971913,0.00014269188,0.0002796789,0.0020823244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998171,0.0005646699,0.00015645579,0.0002631862,0.0006006809,0.00024405202],"domain_scores_gemma":[0.99596596,0.0023520319,0.0003491532,0.0008305388,0.00040802947,0.00009426728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027467038,0.0007903734,0.00095038355,0.0005708742,0.0010618465,0.0023979726,0.0017180364,0.0011802742,0.0027696418],"category_scores_gemma":[0.008390509,0.00093662407,0.0015406279,0.00049094396,0.0025124408,0.0040811854,0.0016308336,0.002376604,0.00032779144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028230058,0.000120617915,0.0012720287,0.00021403955,0.000078702236,0.0002553178,0.000299311,0.6524795,0.0073133106,0.31731042,0.0010757941,0.019298626],"study_design_scores_gemma":[0.00005291073,0.000038594022,0.00006107256,0.000011777293,0.00003173211,0.000036025183,0.000030693227,0.91050994,0.0052207652,0.082978085,0.0010136332,0.000014804698],"about_ca_topic_score_codex":0.0056248326,"about_ca_topic_score_gemma":0.0058512664,"teacher_disagreement_score":0.0056248326,"about_ca_system_score_codex":0.0010489858,"about_ca_system_score_gemma":0.002181649,"threshold_uncertainty_score":0.014526129},"labels":[],"label_agreement":null},{"id":"W42521912","doi":"10.1007/978-3-319-07863-2_20","title":"Human-Centered Interfaces for Situation Awareness in Maintenance","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Computer science; Task (project management); Multidisciplinary approach; Field (mathematics); Work (physics); Human–computer interaction; Knowledge management; Process management; Risk analysis (engineering); Systems engineering; Engineering","score_opus":0.04907973392265315,"score_gpt":0.3612924362550551,"score_spread":0.31221270233240195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42521912","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.0111775845,0.008567127,0.94826895,0.0002935593,0.00041361243,0.000105299856,0.00010944942,0.003972291,0.027092146],"genre_scores_gemma":[0.35770965,0.007140588,0.5847292,0.0008122341,0.0003629942,0.00040237675,0.0004643114,0.0004815746,0.047897056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970704,0.0000857363,0.00001753696,0.000052494484,0.00011429048,0.000022845043],"domain_scores_gemma":[0.99956185,0.00028483715,0.000021648064,0.000048690545,0.00006229201,0.000020574036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042712258,0.0007393675,0.00038105264,0.00031272226,0.00015730316,0.0014302608,0.0011794469,0.0009865866,0.016930874],"category_scores_gemma":[0.0012843754,0.00025551507,0.00030608868,0.00029223526,0.00026560304,0.0014922944,0.0009049476,0.00084338454,0.0030106124],"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.00024248088,0.00017865798,0.00025976493,0.0009494108,0.00006199508,0.00020113855,0.0014367056,0.0027770584,0.066974044,0.028201602,0.021325815,0.87739146],"study_design_scores_gemma":[0.00021740644,0.0013942684,0.0068051927,0.0017695519,0.00040274888,0.0032501353,0.0012811766,0.1676265,0.10617324,0.15183917,0.5590168,0.00022378835],"about_ca_topic_score_codex":0.00020053516,"about_ca_topic_score_gemma":0.0003132964,"teacher_disagreement_score":0.016930874,"about_ca_system_score_codex":0.00013559847,"about_ca_system_score_gemma":0.00015320918,"threshold_uncertainty_score":0.056639433},"labels":[],"label_agreement":null},{"id":"W4252201318","doi":"10.1007/3-540-39205-x","title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","year":2003,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":64,"is_retracted":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":"Granular computing; Rough set; Data mining; Computer science; Fuzzy logic; Fuzzy set; Artificial intelligence","score_opus":0.03225029911667897,"score_gpt":0.2710384390504259,"score_spread":0.23878813993374692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252201318","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013268235,0.3837955,0.5302448,0.008100108,0.0021851393,0.00016411615,0.0006522001,0.0005749429,0.061014913],"genre_scores_gemma":[0.30786464,0.221414,0.44205463,0.0018209057,0.0046385583,0.00045110335,0.0012900905,0.00012256562,0.020343577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808383,0.0005254305,0.00018384987,0.00021654154,0.0009139786,0.00007636628],"domain_scores_gemma":[0.99776566,0.0016147807,0.00020830747,0.00019826402,0.0001543044,0.000058714704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022792567,0.0012261226,0.0027703543,0.003133988,0.0006399488,0.005346057,0.0011671219,0.0013721145,0.0032103308],"category_scores_gemma":[0.00624023,0.00068403577,0.0010405474,0.0075827613,0.0033891373,0.005591585,0.0013427153,0.0024226694,0.00085252407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074948344,0.000056539408,0.0006217696,0.0016656482,0.00015658476,0.000211422,0.00045325593,0.0155947795,0.00081521674,0.75992185,0.01958828,0.20083973],"study_design_scores_gemma":[0.000011782586,0.00002370588,0.00040508783,0.00018531423,0.000037847185,0.00018095686,0.0001483392,0.011317271,0.00020200467,0.96146554,0.025997497,0.000024689363],"about_ca_topic_score_codex":0.0013171497,"about_ca_topic_score_gemma":0.0014051957,"teacher_disagreement_score":0.005346057,"about_ca_system_score_codex":0.0010873678,"about_ca_system_score_gemma":0.00089665526,"threshold_uncertainty_score":0.0120539665},"labels":[],"label_agreement":null},{"id":"W4252548155","doi":"10.1007/978-3-540-27836-8_65","title":"Simple Permutations Mix Well","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Toronto","funders":"","keywords":"Random permutation; Simple (philosophy); Combinatorics; Permutation (music); Closeness; Independence (probability theory); Mixing (physics); Mathematics; Computer science; Discrete mathematics; Random graph; Graph; Symmetric group; Statistics","score_opus":0.028473993203507034,"score_gpt":0.3011472341835518,"score_spread":0.2726732409800448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252548155","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055975735,0.00135246,0.055264376,0.0015987232,0.000886144,0.000104522616,0.00035157995,0.0007658288,0.88370055],"genre_scores_gemma":[0.5453055,0.0023977768,0.026569918,0.0012945915,0.0007225174,0.0002200565,0.00051882275,0.0009030773,0.42206773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.000116662355,0.00003293753,0.00014397899,0.00024176437,0.0001452399],"domain_scores_gemma":[0.99952006,0.0001260368,0.000046150974,0.00012380691,0.00009259709,0.00009139175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047288398,0.0010995881,0.0009938495,0.0021957264,0.0022227247,0.0037326987,0.0006479245,0.0012885579,0.025700888],"category_scores_gemma":[0.0013394309,0.0006243569,0.00081232056,0.0016955788,0.0026958839,0.0068452586,0.002683806,0.0026871918,0.0072592064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016349117,0.000012116769,0.000048096324,0.000022899294,0.0000055321925,0.000039665338,0.00009897359,0.00010497452,0.0007564785,0.9875553,0.0034381931,0.0079013975],"study_design_scores_gemma":[0.000006454473,0.000013680991,0.00009988483,0.000014604537,0.000009318786,0.00017065814,0.00007519037,0.00046584583,0.0010439458,0.9707391,0.027350618,0.0000106329735],"about_ca_topic_score_codex":0.00029339577,"about_ca_topic_score_gemma":0.0008105136,"teacher_disagreement_score":0.025700888,"about_ca_system_score_codex":0.00082770205,"about_ca_system_score_gemma":0.0004357205,"threshold_uncertainty_score":0.08597809},"labels":[],"label_agreement":null},{"id":"W4252781940","doi":"10.1007/978-3-540-30229-2_23","title":"Extending a J2EETM Server with Dynamic and Flexible Resource Management","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Operating system; Scalability; Java; Virtual machine; Interface (matter); Overhead (engineering); Resource management (computing); Distributed computing","score_opus":0.008632475092773761,"score_gpt":0.22011853205848964,"score_spread":0.21148605696571587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252781940","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.099227756,0.00068781024,0.7736461,0.0011834531,0.0012445309,0.00050052436,0.0008656562,0.08693428,0.03570981],"genre_scores_gemma":[0.49499786,0.0005041793,0.43144968,0.001137939,0.0005810018,0.0002697833,0.003503819,0.009220221,0.058335464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863714,0.00015555682,0.00014449877,0.00024476048,0.00055472396,0.00026327322],"domain_scores_gemma":[0.9981787,0.00021908479,0.00004976736,0.000978556,0.00035421827,0.00021962934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019468442,0.0010154994,0.00091805146,0.00067862787,0.0009044171,0.0030000056,0.003862624,0.0015589487,0.009943031],"category_scores_gemma":[0.002961619,0.0009285888,0.0007613095,0.0011689684,0.00054777996,0.0053666984,0.0040830798,0.0021313792,0.004198789],"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.0026230246,0.0021053934,0.006174293,0.00059693045,0.00032430686,0.0018314213,0.0012161421,0.03469529,0.2002258,0.0377084,0.11167657,0.6008225],"study_design_scores_gemma":[0.0004280013,0.0006287757,0.003844239,0.000085213214,0.0002901308,0.0018076862,0.00030897607,0.55570215,0.13182569,0.02946284,0.2753004,0.00031591766],"about_ca_topic_score_codex":0.0031971086,"about_ca_topic_score_gemma":0.002871554,"teacher_disagreement_score":0.009943031,"about_ca_system_score_codex":0.0005030262,"about_ca_system_score_gemma":0.00077698013,"threshold_uncertainty_score":0.03326279},"labels":[],"label_agreement":null},{"id":"W4252871232","doi":"10.1007/978-3-030-22102-7_19","title":"FunDL","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Philosophy","score_opus":0.02187386086311817,"score_gpt":0.2463141904580935,"score_spread":0.22444032959497534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252871232","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.0008668517,0.0011388555,0.013073434,0.0020941633,0.0012675062,0.00014181674,0.030413594,0.022594878,0.9284088],"genre_scores_gemma":[0.004862851,0.00084568176,0.0067912764,0.000882061,0.00032157137,0.00019831304,0.02828543,0.007453584,0.95035934],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911374,0.00011619213,0.000050074228,0.00017812976,0.00042620447,0.00011570162],"domain_scores_gemma":[0.99881434,0.000185544,0.000060258808,0.00032179634,0.00039455632,0.00022351315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010136869,0.0013284195,0.00075525406,0.004333263,0.0012130534,0.005336081,0.00202387,0.0016222887,0.74903995],"category_scores_gemma":[0.0035699643,0.0005383152,0.0006190293,0.0023937912,0.00047806025,0.0036365911,0.0035322206,0.0011496394,0.7225404],"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.000065548455,0.0000410067,0.0001987156,0.00025880302,0.000008101663,0.000054601995,0.00008629166,0.00013310114,0.0010800648,0.016161527,0.74281317,0.23909909],"study_design_scores_gemma":[0.0000078393505,0.0000048733414,0.000088260436,0.000037949518,0.0000029337855,0.00003486092,0.000018149121,0.00010409355,0.00032470172,0.0024189749,0.9969518,0.0000054403913],"about_ca_topic_score_codex":0.0031723976,"about_ca_topic_score_gemma":0.0037827233,"teacher_disagreement_score":0.74903995,"about_ca_system_score_codex":0.0014418125,"about_ca_system_score_gemma":0.0015966424,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4253180224","doi":"10.1007/978-3-030-11072-7_15","title":"Patrolling","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Patrolling; Computer science; Robot; Variety (cybernetics); Mobile robot; Graph; Point (geometry); Artificial intelligence; Theoretical computer science; Mathematics; Geometry","score_opus":0.02041638483535308,"score_gpt":0.2504378034000851,"score_spread":0.23002141856473202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253180224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043071296,0.0008680824,0.60121006,0.00052894594,0.0009023005,0.00042182428,0.001638138,0.032953344,0.318406],"genre_scores_gemma":[0.275185,0.00097084197,0.30402678,0.00055961916,0.00023508012,0.00031216844,0.0051846295,0.0036713553,0.40985456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969494,0.000014044525,0.000011863446,0.00011655191,0.000105951534,0.000056667708],"domain_scores_gemma":[0.9996973,0.000041638697,0.000022160906,0.00015072578,0.00006256267,0.000025626645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001447221,0.00083197956,0.0005093218,0.00070408784,0.00077461515,0.0009263504,0.0011941065,0.0005755109,0.07965349],"category_scores_gemma":[0.000659307,0.00041841457,0.0005219924,0.000777775,0.00042673107,0.0013316212,0.001130731,0.00096590683,0.023841353],"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.00027691232,0.00019139914,0.0005832384,0.00025350103,0.000020405163,0.00018335144,0.00016819304,0.010704044,0.051167537,0.03557588,0.05384226,0.84703314],"study_design_scores_gemma":[0.000084639825,0.00048250493,0.0024085513,0.00015202267,0.00006629658,0.0010569027,0.0002654743,0.15213414,0.121185705,0.06089496,0.66119426,0.00007455902],"about_ca_topic_score_codex":0.0013033168,"about_ca_topic_score_gemma":0.001541545,"teacher_disagreement_score":0.07965349,"about_ca_system_score_codex":0.00029114957,"about_ca_system_score_gemma":0.00046920255,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4253764863","doi":"10.1007/978-3-642-13544-6_4","title":"Animated Volume Texture Mapping for Complex Scene Generation and Editing","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Texture mapping; Projective texture mapping; Computer science; Volume (thermodynamics); Computer graphics (images); Visualization; Displacement mapping; Texture (cosmology); Process (computing); Computer vision; Texture atlas; Surface (topology); Artificial intelligence; Focus (optics); Image texture; Image (mathematics); Image processing; Geometry; Mathematics","score_opus":0.040134121828505114,"score_gpt":0.28594330852097394,"score_spread":0.24580918669246882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253764863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033711328,0.00008740784,0.9902351,0.000029742338,0.000068147994,0.00003161593,0.00006778411,0.0030839432,0.0030251725],"genre_scores_gemma":[0.13305077,0.00030380624,0.8553868,0.00006967029,0.00008100375,0.00009912632,0.00041219592,0.0025469926,0.008049628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997855,0.00003209264,0.0000088986835,0.000029677472,0.00012039981,0.000023456],"domain_scores_gemma":[0.9995389,0.00021091633,0.000019173707,0.00011761034,0.00008417923,0.000029301618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025368188,0.00076931313,0.0005362723,0.00061885227,0.00029942073,0.0012061502,0.0012263346,0.0006228719,0.017352859],"category_scores_gemma":[0.0013891145,0.0005397363,0.0005174401,0.0006480946,0.00035241272,0.0006935364,0.0010578713,0.00095662114,0.0020609226],"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.00036769343,0.00010985151,0.0002949265,0.0003171894,0.000070962415,0.000386653,0.00037213395,0.06491828,0.22997712,0.039113495,0.019396119,0.6446757],"study_design_scores_gemma":[0.00008681857,0.00010295979,0.00039319295,0.000037681366,0.00003520049,0.00073725014,0.000058081754,0.8146733,0.109671354,0.018347794,0.055808738,0.000047574602],"about_ca_topic_score_codex":0.000733323,"about_ca_topic_score_gemma":0.0010462173,"teacher_disagreement_score":0.017352859,"about_ca_system_score_codex":0.00026876712,"about_ca_system_score_gemma":0.00021896783,"threshold_uncertainty_score":0.05805105},"labels":[],"label_agreement":null},{"id":"W4253787990","doi":"10.1007/978-3-642-54268-8","title":"Statistical Atlases and Computational Models of the Heart. Imaging and Modelling Challenges","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Data science","score_opus":0.026950835788959866,"score_gpt":0.27486681650116984,"score_spread":0.24791598071220997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253787990","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.005787616,0.012782883,0.96877027,0.006185358,0.0003397675,0.000019369489,0.00079424784,0.00049182767,0.0048287017],"genre_scores_gemma":[0.42243776,0.04806116,0.5030464,0.0014907087,0.0027374085,0.00031380515,0.0035363939,0.0007667406,0.017609691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994324,0.00020056132,0.000038953072,0.00011027671,0.00018265462,0.000035175366],"domain_scores_gemma":[0.9968831,0.0021173311,0.00024788134,0.00037486767,0.00025541894,0.00012134927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021336216,0.00067012216,0.0014937146,0.0014431139,0.0003335903,0.0035582173,0.0024354395,0.001587469,0.0021396014],"category_scores_gemma":[0.0075060287,0.0013503073,0.00126203,0.0020643852,0.0023569793,0.0034961465,0.0016914061,0.0030333586,0.001009726],"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.000031718835,0.000020218036,0.0009134337,0.00033226018,0.00011533902,0.00013255881,0.00017712092,0.23058905,0.0016523317,0.62567234,0.02237692,0.11798676],"study_design_scores_gemma":[0.0000068715917,0.000016104603,0.0007518402,0.000051195355,0.00001895016,0.00028371092,0.000060034257,0.3288648,0.00032467555,0.65598255,0.013613716,0.000025587075],"about_ca_topic_score_codex":0.0035839805,"about_ca_topic_score_gemma":0.0037328515,"teacher_disagreement_score":0.0035839805,"about_ca_system_score_codex":0.0010611254,"about_ca_system_score_gemma":0.0010991053,"threshold_uncertainty_score":0.011283815},"labels":[],"label_agreement":null},{"id":"W4253814772","doi":"10.1007/978-3-642-40450-4_36","title":"Table Cartograms","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of British Columbia","funders":"","keywords":"Rectangle; Quadrilateral; Table (database); Regular polygon; Adjacency list; Partition (number theory); Combinatorics; Mathematics; Computer science; Geometry; Physics; Database","score_opus":0.01645269611225484,"score_gpt":0.24541285603035037,"score_spread":0.22896015991809554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253814772","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030827466,0.0015831721,0.08736767,0.00060857064,0.0016835391,0.0003276268,0.024625696,0.011700836,0.86902016],"genre_scores_gemma":[0.033795834,0.0044523217,0.12175005,0.00037063673,0.0003352346,0.00027229634,0.035901096,0.004569962,0.7985525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982774,0.000012564104,0.000008450535,0.0000394472,0.00009176954,0.000019950396],"domain_scores_gemma":[0.9997693,0.000027849565,0.000008751595,0.00006189181,0.00010877507,0.00002342209],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012220512,0.0011966428,0.00065696205,0.002758766,0.0010365271,0.0025039932,0.0010206603,0.00060136546,0.49398154],"category_scores_gemma":[0.00074178434,0.0005543969,0.00066572963,0.0043564523,0.00037831315,0.0016998354,0.0009608251,0.0007792198,0.21477702],"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.0001442398,0.000031534764,0.00020953889,0.00045461062,0.000014424607,0.0002455669,0.00015291208,0.002260129,0.004599091,0.0627963,0.44964454,0.4794471],"study_design_scores_gemma":[0.0000135076125,0.0000233737,0.00025197415,0.00006693679,0.000009529194,0.0002751282,0.00010472089,0.0014025697,0.0016617153,0.009541008,0.9866332,0.000016435979],"about_ca_topic_score_codex":0.0040413584,"about_ca_topic_score_gemma":0.0051733893,"teacher_disagreement_score":0.49398154,"about_ca_system_score_codex":0.00047125743,"about_ca_system_score_gemma":0.00088014995,"threshold_uncertainty_score":0.7217739},"labels":[],"label_agreement":null},{"id":"W4253985509","doi":"10.1007/978-3-642-35170-9","title":"Middleware 2012","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Universidade do Minho; Universidade de São Paulo; University of Toronto; University of Illinois at Urbana-Champaign; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; Middleware (distributed applications); Programming language; Operating system","score_opus":0.016669605524698105,"score_gpt":0.2318633767028391,"score_spread":0.215193771178141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253985509","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043393457,0.03383712,0.4412459,0.004130788,0.009101138,0.00052557763,0.008564647,0.07007747,0.42817804],"genre_scores_gemma":[0.0076861824,0.013287905,0.061022755,0.00081583555,0.0007432214,0.00020470093,0.01958956,0.008275884,0.888374],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910945,0.00009111127,0.0000735038,0.00019685931,0.00043724032,0.00009186283],"domain_scores_gemma":[0.9990023,0.00016297915,0.00003535002,0.0003713035,0.0002886788,0.00013945583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171561,0.0021261396,0.0016131126,0.0021122943,0.0009487063,0.0053793327,0.0022403256,0.0014366145,0.14460576],"category_scores_gemma":[0.0023443196,0.0015279002,0.0010917671,0.0028435453,0.0004392842,0.004458193,0.0023069254,0.002688231,0.17868556],"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.00008822921,0.0001303641,0.00016622573,0.00043481775,0.000034752775,0.000098978875,0.00010178361,0.0011213043,0.0049552275,0.011765393,0.4978063,0.4832965],"study_design_scores_gemma":[0.00002455701,0.000035168578,0.00040572992,0.00019340799,0.000029473162,0.00033746383,0.00004548128,0.0033156204,0.002519214,0.009881745,0.9831813,0.00003080245],"about_ca_topic_score_codex":0.002053212,"about_ca_topic_score_gemma":0.0042038644,"teacher_disagreement_score":0.14460576,"about_ca_system_score_codex":0.00093781395,"about_ca_system_score_gemma":0.0010496256,"threshold_uncertainty_score":0.48375446},"labels":[],"label_agreement":null},{"id":"W4254679254","doi":"10.1007/bfb0036347","title":"Simulation of bibliographic retrieval databases using hyperterms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Western University","funders":"","keywords":"Computer science; Information retrieval; Database","score_opus":0.05749656067956718,"score_gpt":0.298897370226395,"score_spread":0.24140080954682783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254679254","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.7730212,0.0006069766,0.1994615,0.0020179232,0.00021188667,0.00026445236,0.0021974402,0.0017756219,0.020443005],"genre_scores_gemma":[0.9739246,0.00020514107,0.021105075,0.00011429313,0.000027743663,0.00015214812,0.0006614915,0.00009590884,0.0037135608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883157,0.0005236997,0.00010221378,0.00015947632,0.00021513346,0.00016788342],"domain_scores_gemma":[0.9812707,0.015629457,0.00053517416,0.0008415032,0.0011721533,0.00055113964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019282381,0.0003955337,0.0013508666,0.001472055,0.00091280893,0.0030384634,0.0025270479,0.0024121294,0.009078489],"category_scores_gemma":[0.01881386,0.00086112914,0.00095399603,0.002016455,0.0012589451,0.002819155,0.0015147711,0.0010035555,0.0007567172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021746811,0.00009107821,0.0016394843,0.000045005745,0.000024013505,0.000068634865,0.00009210621,0.9769786,0.0004297486,0.016608616,0.0006274776,0.0031777415],"study_design_scores_gemma":[0.000020387917,0.000009703161,0.000057331887,0.0000031625145,0.0000044528565,0.000006106682,0.000014453697,0.9965456,0.00018336547,0.003037142,0.00011486039,0.000003364162],"about_ca_topic_score_codex":0.024116464,"about_ca_topic_score_gemma":0.01155039,"teacher_disagreement_score":0.024116464,"about_ca_system_score_codex":0.0025117728,"about_ca_system_score_gemma":0.0022538302,"threshold_uncertainty_score":0.047952175},"labels":[],"label_agreement":null},{"id":"W4254685321","doi":"10.1007/978-3-030-39752-4","title":"Computational Methods and Clinical Applications for Spine Imaging","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Image segmentation; Set (abstract data type); Computer vision; Curvature; Mathematics; Programming language","score_opus":0.02176961428002727,"score_gpt":0.36537121378762094,"score_spread":0.34360159950759367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254685321","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015280817,0.17398383,0.66133267,0.0043780208,0.007824095,0.00010930026,0.0012393341,0.002504227,0.14710045],"genre_scores_gemma":[0.012563065,0.12182081,0.4631562,0.0017105184,0.0063670212,0.000297346,0.0017819345,0.001911649,0.3903915],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995869,0.00006692909,0.000023131928,0.000045816643,0.0002633927,0.00001386744],"domain_scores_gemma":[0.9989624,0.00059934356,0.0000367457,0.00009220669,0.00025176833,0.000057466434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006633824,0.0015046821,0.0010631214,0.0018267775,0.00031452818,0.0016422879,0.0014135151,0.0012626912,0.049433555],"category_scores_gemma":[0.0023086285,0.0005896956,0.000812808,0.0024414514,0.00068466517,0.001359474,0.0013441548,0.0020142673,0.027487557],"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.000035359815,0.00004362413,0.00014870764,0.0009735187,0.00003668139,0.000101603204,0.0000729482,0.0076833153,0.0029217275,0.06714138,0.3604578,0.5603833],"study_design_scores_gemma":[0.000016512842,0.0000549821,0.000749762,0.00045791405,0.000037136466,0.0011581088,0.000056182253,0.040925566,0.0015759744,0.1586172,0.7963071,0.000043606397],"about_ca_topic_score_codex":0.0007305848,"about_ca_topic_score_gemma":0.00186402,"teacher_disagreement_score":0.049433555,"about_ca_system_score_codex":0.00033838308,"about_ca_system_score_gemma":0.00063443254,"threshold_uncertainty_score":0.16537172},"labels":[],"label_agreement":null},{"id":"W4254991678","doi":"10.1007/978-3-540-69489-2_8","title":"A Unified Ontology-Based Process Model for Software Maintenance and Comprehension","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","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; Concordia University","funders":"","keywords":"Computer science; Software engineering; Traceability; Ontology; Process (computing); Comprehension; Software development process; Context (archaeology); Software maintenance; Knowledge representation and reasoning; Process management; Software development; Systems engineering; Software; Knowledge management; Artificial intelligence; Programming language; Engineering","score_opus":0.02583666095507008,"score_gpt":0.26896425003791113,"score_spread":0.24312758908284104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254991678","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.0015570442,0.00011329353,0.9931485,0.00031133904,0.000031133946,0.00011456244,0.00020503327,0.0008496942,0.003669447],"genre_scores_gemma":[0.061161295,0.00036027934,0.9331467,0.00015423857,0.000040782717,0.0004470076,0.0009959482,0.0002973097,0.0033965188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740356,0.0006001761,0.00045000055,0.00047428758,0.00086336216,0.00020857331],"domain_scores_gemma":[0.99725133,0.0010509301,0.00021688855,0.0006303699,0.0007182893,0.00013224919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031627947,0.0009031176,0.0011915546,0.0026427838,0.0014097784,0.0061476375,0.0037211922,0.0027220894,0.0050057387],"category_scores_gemma":[0.007552472,0.0009741789,0.0029464848,0.0028675145,0.0021135672,0.011617773,0.002562256,0.003123913,0.0021108636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004888501,0.00011420673,0.0005253089,0.00019568294,0.00004872076,0.00022902952,0.0016119005,0.026128104,0.0028606874,0.88381,0.0034610291,0.08096646],"study_design_scores_gemma":[0.000047356545,0.000044844786,0.00032515923,0.00015554544,0.00013023168,0.0002475753,0.0003227022,0.30490392,0.0027525492,0.64426166,0.046744917,0.000063457934],"about_ca_topic_score_codex":0.014852028,"about_ca_topic_score_gemma":0.010951274,"teacher_disagreement_score":0.014852028,"about_ca_system_score_codex":0.0023058578,"about_ca_system_score_gemma":0.0051144594,"threshold_uncertainty_score":0.029531121},"labels":[],"label_agreement":null},{"id":"W4255050506","doi":"10.1007/978-3-030-64694-3","title":"Reuse in Emerging Software Engineering Practices","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Université du Québec à Montréal","funders":"","keywords":"Reuse; Computer science; Relevance (law); Software engineering; Software; Domain engineering; Engineering management; Software development; Component-based software engineering; Operating system; Engineering","score_opus":0.08296612322531084,"score_gpt":0.3553237596971925,"score_spread":0.27235763647188166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255050506","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.33839014,0.027701735,0.15600401,0.012547856,0.0002922936,0.000056901325,0.0000968515,0.00051714294,0.46439302],"genre_scores_gemma":[0.89226973,0.009102938,0.034190215,0.0003210887,0.00020931983,0.000042044292,0.00011605447,0.00015240358,0.06359616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977843,0.0009359527,0.00013752558,0.00017610098,0.0007852777,0.00018087844],"domain_scores_gemma":[0.99262685,0.005123833,0.00045221768,0.0009998353,0.0006016148,0.00019562211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002056845,0.00020230257,0.00021212045,0.0020623568,0.0010311445,0.0055876593,0.0007975328,0.001054705,0.0039891982],"category_scores_gemma":[0.006408957,0.0003094238,0.00038717611,0.0034451627,0.0034985545,0.0070723887,0.0023737643,0.0013210343,0.0005851029],"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.000020245181,0.000049090042,0.0032477991,0.00015525946,0.000013366824,0.000399677,0.018259306,0.0012585587,0.0010200092,0.66958344,0.004796593,0.30119675],"study_design_scores_gemma":[0.000010458328,0.000079903,0.007941816,0.00070429937,0.00002547825,0.0018535628,0.016140057,0.006979763,0.001718877,0.7621418,0.20238052,0.000023478111],"about_ca_topic_score_codex":0.0040388373,"about_ca_topic_score_gemma":0.0070202104,"teacher_disagreement_score":0.0055876593,"about_ca_system_score_codex":0.0020906834,"about_ca_system_score_gemma":0.0017710506,"threshold_uncertainty_score":0.0151690245},"labels":[],"label_agreement":null},{"id":"W4255413586","doi":"10.1007/978-3-540-45193-8_41","title":"An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Kent","keywords":"Cardinality (data modeling); Consistency (knowledge bases); Local consistency; Constraint (computer-aided design); Algorithm; Computer science; Mathematics; Constraint satisfaction; Artificial intelligence; Data mining","score_opus":0.016376349289765564,"score_gpt":0.263311045854145,"score_spread":0.24693469656437944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255413586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004891372,0.0002383879,0.9877236,0.00023178486,0.00009443888,0.00014419215,0.0002530678,0.0021198262,0.004303367],"genre_scores_gemma":[0.06962407,0.00023322094,0.92216635,0.00018212422,0.00011280227,0.00030259482,0.0012110731,0.0011308793,0.0050368253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638015,0.00072353194,0.00023279167,0.00086222595,0.0014176663,0.00038371672],"domain_scores_gemma":[0.99352586,0.0030879201,0.00031941186,0.001884868,0.001015759,0.0001662434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273827,0.0016250474,0.0023261395,0.0022786083,0.0016769918,0.00440951,0.0048864996,0.002194833,0.014350027],"category_scores_gemma":[0.012665802,0.0015550525,0.0018865266,0.0041403905,0.001285715,0.007883525,0.0051355627,0.0047272625,0.003371964],"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.00069378153,0.00033718345,0.00075102,0.00037308442,0.00012482466,0.00013612885,0.00031852588,0.11996327,0.011137613,0.11542237,0.029780446,0.72096175],"study_design_scores_gemma":[0.00029782183,0.00010412396,0.00043092459,0.000078551326,0.000104129416,0.00017756426,0.00013006858,0.8098611,0.0151371015,0.15689765,0.01672273,0.00005815058],"about_ca_topic_score_codex":0.00406077,"about_ca_topic_score_gemma":0.0047986316,"teacher_disagreement_score":0.014350027,"about_ca_system_score_codex":0.0017878074,"about_ca_system_score_gemma":0.0032060805,"threshold_uncertainty_score":0.04800564},"labels":[],"label_agreement":null},{"id":"W4255802862","doi":"10.1007/978-3-540-24671-8_37","title":"Adaptive Probabilistic Visual Tracking with Incremental Subspace Update","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Probabilistic logic; Computer vision; Subspace topology; Tracking (education); A priori and a posteriori; Prior probability; Affine transformation; Video tracking; Object (grammar); Bayesian probability; Mathematics","score_opus":0.024209143394415305,"score_gpt":0.277435982169378,"score_spread":0.25322683877496266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255802862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018473162,0.00011956728,0.9969313,0.000022797823,0.00002632257,0.000011341815,0.000017619617,0.00038421762,0.0006394924],"genre_scores_gemma":[0.16982992,0.00047971084,0.82287127,0.00012350497,0.00009496169,0.000118278134,0.00030802903,0.00019388892,0.005980392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923754,0.000123779,0.000029050885,0.00018650379,0.00037318142,0.000049956172],"domain_scores_gemma":[0.9990551,0.00035212407,0.000070217655,0.00023731726,0.00025419836,0.000031085998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083516707,0.00072052586,0.0009746213,0.0008043779,0.0003063704,0.0008460153,0.0017167332,0.0008495087,0.002275275],"category_scores_gemma":[0.0033149803,0.0007720238,0.000683207,0.0014376047,0.0005219648,0.0015585895,0.0016774804,0.0010791492,0.0013299551],"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.00015675562,0.00007274561,0.00044335605,0.00009671627,0.00009108565,0.00004720574,0.000061024133,0.14189565,0.0192651,0.00854251,0.0036656708,0.8256622],"study_design_scores_gemma":[0.000010983451,0.000036060468,0.00031570165,0.0000054146517,0.000021454898,0.00011092151,0.0000053066724,0.9862499,0.005668165,0.0055469093,0.0020135876,0.000015521799],"about_ca_topic_score_codex":0.002924669,"about_ca_topic_score_gemma":0.0035886972,"teacher_disagreement_score":0.002924669,"about_ca_system_score_codex":0.0003439111,"about_ca_system_score_gemma":0.0004958121,"threshold_uncertainty_score":0.0076115727},"labels":[],"label_agreement":null},{"id":"W4255958309","doi":"10.1007/978-3-642-36961-2","title":"Statistical Atlases and Computational Models of the Heart. Imaging and Modelling Challenges","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Computational model; Artificial intelligence","score_opus":0.028715848373016148,"score_gpt":0.2731042600856948,"score_spread":0.24438841171267867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255958309","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.006084709,0.01203122,0.96952784,0.006036232,0.00031762978,0.00002004039,0.00079934945,0.00048804664,0.004694951],"genre_scores_gemma":[0.43821907,0.044894148,0.4920885,0.0014337247,0.0025600279,0.00032285583,0.0034428283,0.00073356106,0.01630536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994332,0.0002035459,0.000038952883,0.00010847677,0.0001804082,0.00003539007],"domain_scores_gemma":[0.99684566,0.0021412673,0.00026090626,0.00037263372,0.00025487965,0.00012455435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021532062,0.00065869425,0.0015014588,0.0014668509,0.00033992328,0.003574926,0.0024799753,0.0015856622,0.0021308083],"category_scores_gemma":[0.007705131,0.0013532592,0.0012508866,0.0020712102,0.0023772563,0.00352339,0.0016839884,0.0029487354,0.0009801367],"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.000032304866,0.000020601461,0.0009412601,0.00032296812,0.00011314251,0.00013162654,0.00017794197,0.24458976,0.001578143,0.6191599,0.0207525,0.11217992],"study_design_scores_gemma":[0.000007276119,0.000016137112,0.000755124,0.000049241353,0.000018729626,0.00026998235,0.000059930113,0.34409544,0.0003061712,0.64193815,0.012458516,0.00002524571],"about_ca_topic_score_codex":0.003677691,"about_ca_topic_score_gemma":0.0038226147,"teacher_disagreement_score":0.003677691,"about_ca_system_score_codex":0.0010587969,"about_ca_system_score_gemma":0.001107619,"threshold_uncertainty_score":0.011387348},"labels":[],"label_agreement":null},{"id":"W4256075351","doi":"10.1007/978-3-540-75209-7_4","title":"Guided Development with Multiple Domain-Specific Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Eclipse; Programming language; Domain-specific language; Consistency (knowledge bases); Context (archaeology); Software engineering; Domain (mathematical analysis); Key (lock); Development (topology); Set (abstract data type); Extension (predicate logic); Database; Artificial intelligence; Operating system","score_opus":0.02297673402337171,"score_gpt":0.25024982230468296,"score_spread":0.22727308828131124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256075351","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.020170797,0.00009431388,0.96755576,0.00008744813,0.0000149867565,0.000106315674,0.00002788208,0.003301895,0.008640568],"genre_scores_gemma":[0.13974753,0.00013502564,0.84891224,0.000104330975,0.0000067978303,0.00019124435,0.00015247038,0.00060868106,0.010141623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987785,0.0003909275,0.00007136449,0.00023899952,0.00041449766,0.00010570833],"domain_scores_gemma":[0.9981201,0.00091063435,0.00016251842,0.00051032606,0.00021243286,0.00008401342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010821605,0.00065746,0.00035513783,0.00047312002,0.00029594806,0.0010030254,0.0012561362,0.0007862269,0.0033226993],"category_scores_gemma":[0.0033462655,0.0006417448,0.00059765024,0.00036723912,0.0005034392,0.0012426677,0.002190163,0.0014187727,0.0010126922],"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.00030001524,0.00050403003,0.00229159,0.00058450503,0.00011629985,0.0005964291,0.0023317875,0.049358126,0.10077112,0.09946432,0.0059623895,0.7377195],"study_design_scores_gemma":[0.00022126088,0.0006273173,0.0019438333,0.0004793086,0.00024224387,0.0017353557,0.0005124472,0.5351521,0.19040184,0.11233047,0.15622868,0.00012520314],"about_ca_topic_score_codex":0.0005697208,"about_ca_topic_score_gemma":0.0019522466,"teacher_disagreement_score":0.0033226993,"about_ca_system_score_codex":0.00040228173,"about_ca_system_score_gemma":0.0012370457,"threshold_uncertainty_score":0.011115491},"labels":[],"label_agreement":null},{"id":"W4256184007","doi":"10.1007/978-3-642-21210-9_28","title":"Simplifying Model Transformation Chains by Rule Composition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Université de Montréal; McGill University","funders":"","keywords":"Computer science; Model transformation; Graph rewriting; Transformation (genetics); Programming language; Program transformation; Unified Modeling Language; Theoretical computer science; Java; Metamodeling; Graph; Software engineering; Artificial intelligence; Software","score_opus":0.019046207651122044,"score_gpt":0.23173344580140637,"score_spread":0.2126872381502843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256184007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053518554,0.000058299276,0.98747444,0.00006987218,0.00004692088,0.00014567378,0.0000835583,0.0028019345,0.003967408],"genre_scores_gemma":[0.111253895,0.00029354283,0.87733346,0.00012401253,0.000052491683,0.0002285861,0.00084396667,0.002267217,0.0076027513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962578,0.0009423624,0.00029187682,0.00061346695,0.0015778049,0.00031675314],"domain_scores_gemma":[0.992576,0.0036064538,0.00020219562,0.0029314393,0.0005827551,0.00010118302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024984598,0.001202792,0.0011573927,0.0014747685,0.0011865422,0.0018598948,0.002327109,0.0011210457,0.013004439],"category_scores_gemma":[0.01095658,0.0013420902,0.003207163,0.0016698168,0.0016334367,0.0039800485,0.0043889866,0.004100944,0.0057036867],"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.00045618223,0.0003993383,0.0008818386,0.00068692263,0.00022470109,0.0009904505,0.00069555733,0.17345197,0.026617901,0.1946911,0.010350044,0.59055406],"study_design_scores_gemma":[0.000109633416,0.000084798965,0.0001663372,0.00013894137,0.00026822608,0.00036727163,0.00015337516,0.53225094,0.05642257,0.38008127,0.029904697,0.000051927855],"about_ca_topic_score_codex":0.0023924753,"about_ca_topic_score_gemma":0.003576895,"teacher_disagreement_score":0.013004439,"about_ca_system_score_codex":0.0005594496,"about_ca_system_score_gemma":0.0015610504,"threshold_uncertainty_score":0.043504238},"labels":[],"label_agreement":null},{"id":"W4256228093","doi":"10.1007/3-540-36175-8_56","title":"DBRS: A Density-Based Spatial Clustering Method with Random Sampling","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":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":"DBSCAN; Cluster analysis; Computer science; Sampling (signal processing); Point (geometry); Data mining; Pattern recognition (psychology); Artificial intelligence; Algorithm; Correlation clustering; CURE data clustering algorithm; Mathematics; Computer vision","score_opus":0.02417341461940737,"score_gpt":0.2638808334063544,"score_spread":0.239707418786947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256228093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00112495,0.00008988822,0.9970048,0.000036418147,0.000044482964,0.000060313,0.00008075452,0.0011772125,0.00038121262],"genre_scores_gemma":[0.02658744,0.0001259776,0.9701635,0.000084264975,0.00005710589,0.00024064271,0.00048326975,0.00037963438,0.0018781773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973347,0.0009863664,0.00010833761,0.00039692284,0.0010607204,0.00011293502],"domain_scores_gemma":[0.9974503,0.0009435224,0.00012558165,0.0005627478,0.00080272707,0.000115174706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026195056,0.0011181888,0.002346719,0.0023673342,0.0013513371,0.0014443878,0.0046623843,0.0015550051,0.005354723],"category_scores_gemma":[0.0073974133,0.0012450472,0.0019183462,0.003005876,0.00093335385,0.0018968713,0.003080876,0.0016524106,0.003704723],"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.0004401336,0.00020184922,0.001260842,0.0003874047,0.0003471435,0.00011373602,0.00029594914,0.2939896,0.007511781,0.037563033,0.01834347,0.6395451],"study_design_scores_gemma":[0.000053612177,0.000035772417,0.00021078359,0.000015040862,0.00003088045,0.00009420696,0.000024524992,0.9825439,0.0021201672,0.009316698,0.005518916,0.000035611512],"about_ca_topic_score_codex":0.011555055,"about_ca_topic_score_gemma":0.013622194,"teacher_disagreement_score":0.011555055,"about_ca_system_score_codex":0.0010836233,"about_ca_system_score_gemma":0.0019800202,"threshold_uncertainty_score":0.022975564},"labels":[],"label_agreement":null},{"id":"W4256485164","doi":"10.1007/3-540-44566-8","title":"User Modeling 2001","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science","score_opus":0.028821965012807507,"score_gpt":0.26782045026331985,"score_spread":0.23899848525051234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256485164","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051279026,0.04436268,0.6080663,0.0095796995,0.0054493607,0.00029489573,0.008469476,0.014707297,0.30394238],"genre_scores_gemma":[0.03482392,0.033498973,0.105257034,0.0012198446,0.0011827945,0.00031951335,0.018911358,0.0026020769,0.80218446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934167,0.00015475786,0.000033913057,0.00015239009,0.00026407852,0.000053097305],"domain_scores_gemma":[0.99802136,0.0005094985,0.000040127823,0.00068135146,0.00063462683,0.00011315718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015368294,0.0014852266,0.0017719369,0.0017517322,0.0009356671,0.0029818593,0.002124868,0.0012311466,0.09343879],"category_scores_gemma":[0.0032790347,0.0013039185,0.0010620094,0.003330891,0.00051690376,0.0032409364,0.0012783143,0.0022322438,0.08966275],"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.000045590903,0.00010210344,0.00042603878,0.00017758686,0.00003740647,0.00005482346,0.00006756404,0.0042511667,0.0005589418,0.016457878,0.58642143,0.39139953],"study_design_scores_gemma":[0.000016661515,0.000046110392,0.0013552579,0.00028485284,0.000082525854,0.00041738333,0.00008820795,0.040800635,0.0018445784,0.037607078,0.9174155,0.000041186086],"about_ca_topic_score_codex":0.009932901,"about_ca_topic_score_gemma":0.018021667,"teacher_disagreement_score":0.09343879,"about_ca_system_score_codex":0.0013361953,"about_ca_system_score_gemma":0.0012669493,"threshold_uncertainty_score":0.31258386},"labels":[],"label_agreement":null},{"id":"W4256561526","doi":"10.1007/978-3-540-79228-4_15","title":"Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Planar graph; Combinatorics; Unit disk graph; Vertex (graph theory); Computer science; Graph factorization; Graph coloring; Graph; Complete coloring; Mathematics; Graph power; Line graph","score_opus":0.032815704219324796,"score_gpt":0.28332560821975944,"score_spread":0.25050990400043466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256561526","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.5005966,0.0025551685,0.3173814,0.0012932525,0.00027150373,0.00018472422,0.00088004884,0.0019829522,0.17485426],"genre_scores_gemma":[0.85124314,0.0016196151,0.08014516,0.00034649277,0.00024464098,0.00034027157,0.0019210362,0.0009186216,0.06322102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996855,0.0000667495,0.00001280161,0.000077377255,0.000078737634,0.00007886855],"domain_scores_gemma":[0.9991492,0.0003497588,0.00008660952,0.00016518631,0.00010154022,0.00014770943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031426625,0.0005983624,0.0008661077,0.0008535331,0.0012384404,0.0015832613,0.0017082017,0.00060877757,0.0130256275],"category_scores_gemma":[0.0009922562,0.0006262849,0.00080245023,0.0014768062,0.0011507723,0.0020143306,0.0015515855,0.0019022134,0.002252279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044196364,0.0001839917,0.0011301845,0.0007681301,0.00005127677,0.00039780542,0.0009215223,0.019862238,0.018005567,0.8536653,0.020722073,0.083849914],"study_design_scores_gemma":[0.00009714289,0.00008223537,0.0013428398,0.00005529068,0.00007844119,0.00041353365,0.00043387973,0.040809583,0.007079725,0.9330336,0.016535731,0.000038023132],"about_ca_topic_score_codex":0.0016263376,"about_ca_topic_score_gemma":0.0030868733,"teacher_disagreement_score":0.0130256275,"about_ca_system_score_codex":0.0014876322,"about_ca_system_score_gemma":0.00058332825,"threshold_uncertainty_score":0.043575108},"labels":[],"label_agreement":null},{"id":"W4256608473","doi":"10.1007/978-3-642-04052-8_57","title":"You Are Here","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Art, Technology, and Culture","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Conversation; Computer science; Curiosity; The arts; Meaning (existential); Augmented reality; Simple (philosophy); Space (punctuation); Relevance (law); Virtual reality; Emerging technologies; Aesthetics; Visual arts; Media studies; Sociology; Human–computer interaction; Epistemology; Artificial intelligence; Art; Psychology; Communication","score_opus":0.02374913328768003,"score_gpt":0.22358613119515416,"score_spread":0.19983699790747414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256608473","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000556656,0.0016160936,0.0013725632,0.007519832,0.017826404,0.00029860504,0.0013377573,0.0036513547,0.9658207],"genre_scores_gemma":[0.00035425293,0.0003824941,0.00029089212,0.0016813698,0.00045371582,0.00003868126,0.00019981648,0.00038616813,0.9962126],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996201,0.00003623399,0.000013687656,0.000079849255,0.0001607787,0.000089383095],"domain_scores_gemma":[0.9983646,0.000109639994,0.00004294211,0.00009939829,0.00047554547,0.00090781564],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006140001,0.001130675,0.0013418281,0.00080990366,0.002920874,0.006706941,0.0011327573,0.0025023858,0.8935929],"category_scores_gemma":[0.0029223799,0.0005522236,0.00087893056,0.0006764328,0.0004829422,0.0049020643,0.0043502953,0.0045848996,0.8629594],"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.000024615012,0.00005295872,0.000071510534,0.00004108922,0.0000021360588,0.000048377588,0.00004907129,0.000014382504,0.00015731786,0.0015829261,0.9412847,0.05667104],"study_design_scores_gemma":[0.0000061491414,0.000013955883,0.00012319401,0.000036421985,0.0000017662654,0.000029539307,0.00009322534,0.000008666488,0.000042141794,0.00034871697,0.9992907,0.0000054895027],"about_ca_topic_score_codex":0.0018548666,"about_ca_topic_score_gemma":0.0052147824,"teacher_disagreement_score":0.8935929,"about_ca_system_score_codex":0.00046827694,"about_ca_system_score_gemma":0.0011202999,"threshold_uncertainty_score":0.15177685},"labels":[],"label_agreement":null},{"id":"W4281966321","doi":"10.1007/978-3-031-18158-0_37","title":"Investigating End-User Acceptance of Last-Mile Delivery by Autonomous Vehicles in the United States","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Mile; Perception; Last mile (transportation); Technology acceptance model; Computer science; Structural equation modeling; Partial least squares regression; Gauge (firearms); Applied psychology; Psychology; Human–computer interaction; Usability; Geography; Machine learning","score_opus":0.013898979775973062,"score_gpt":0.22083282500905188,"score_spread":0.2069338452330788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281966321","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.9986092,0.00003385741,0.00014811415,0.0000483033,0.0000020719933,0.000007699785,0.000021104624,0.0000031346196,0.001126641],"genre_scores_gemma":[0.9994209,0.00003840215,0.00012331716,0.000017650716,0.0000015630952,0.0000085196825,0.000030191764,0.0000011252176,0.00035853987],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99898404,0.00054047833,0.000044984976,0.000056809207,0.00029572277,0.00007795802],"domain_scores_gemma":[0.9915769,0.0047507524,0.0012923789,0.00018742781,0.0016994822,0.00049312244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019341625,0.00012510217,0.0001685579,0.00047957033,0.00027411003,0.0009115796,0.000306117,0.00028569,0.0018765973],"category_scores_gemma":[0.006487845,0.00007433112,0.0001757429,0.0003674648,0.00021417488,0.00049048156,0.0004403785,0.00038918792,0.000261895],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018667316,0.0003568036,0.9398055,0.0000917829,0.00004496464,0.0002330579,0.0148653565,0.00039493467,0.00203892,0.00025834853,0.0004541136,0.04126954],"study_design_scores_gemma":[0.000005256115,0.0008051196,0.9548541,0.000060461614,0.000022323296,0.000166803,0.038772527,0.0021290497,0.0008897875,0.000075923635,0.0022013327,0.000017415037],"about_ca_topic_score_codex":0.0058383197,"about_ca_topic_score_gemma":0.0058870907,"teacher_disagreement_score":0.0058383197,"about_ca_system_score_codex":0.00036664898,"about_ca_system_score_gemma":0.00027158723,"threshold_uncertainty_score":0.01160872},"labels":[],"label_agreement":null},{"id":"W4283320645","doi":"10.1007/978-3-031-16443-9_19","title":"Position-Prior Clustering-Based Self-attention Module for Knee Cartilage Segmentation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Osteoarthritis Treatment and Mechanisms","field":"Medicine","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":"Western University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Pattern recognition (psychology); Computer vision; Feature (linguistics); Image segmentation; Osteoarthritis; Medicine","score_opus":0.012021026206905682,"score_gpt":0.25128319571025093,"score_spread":0.23926216950334525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283320645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013935231,0.00086179806,0.9769678,0.00009571745,0.00011410346,0.00008719763,0.0002944885,0.0045910543,0.0030525],"genre_scores_gemma":[0.17603654,0.0010107306,0.79681396,0.0003568195,0.00014854391,0.00015719168,0.001953751,0.0010436933,0.022478752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997266,0.000017640163,0.000013338407,0.00009639808,0.00008988091,0.000056174576],"domain_scores_gemma":[0.999775,0.000045025838,0.000012751711,0.000038013088,0.000107511594,0.000021718797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004480202,0.00081498147,0.0009159789,0.0011865948,0.00039824707,0.0007392485,0.0017401419,0.0012786429,0.008152654],"category_scores_gemma":[0.00047552967,0.000501866,0.0010921531,0.00121886,0.0002413271,0.00074726494,0.0009281425,0.00072447944,0.0038591195],"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.00022933674,0.0001093187,0.00058827625,0.00013949604,0.000077874836,0.00006694843,0.000059109396,0.014393869,0.11796342,0.0013568569,0.0068302476,0.8581852],"study_design_scores_gemma":[0.000024918601,0.0001591517,0.005470358,0.00004466281,0.00016683618,0.0004352387,0.000057251575,0.8419235,0.13749321,0.0033091658,0.010856418,0.00005929243],"about_ca_topic_score_codex":0.008146179,"about_ca_topic_score_gemma":0.016747506,"teacher_disagreement_score":0.008152654,"about_ca_system_score_codex":0.0005812429,"about_ca_system_score_gemma":0.0010636197,"threshold_uncertainty_score":0.027273357},"labels":[],"label_agreement":null},{"id":"W4283824745","doi":"10.1007/978-3-031-16980-9_15","title":"Backdoor Attack is a Devil in Federated GAN-Based Medical Image Synthesis","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backdoor; Computer science; Discriminator; Image (mathematics); Adversarial system; Training set; Deep learning; Artificial intelligence; Regularization (linguistics); Machine learning; Computer security","score_opus":0.018382007862446165,"score_gpt":0.2748480418714027,"score_spread":0.25646603400895657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283824745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009769531,0.00029239102,0.9863002,0.00021821212,0.00008570365,0.000028890727,0.000042464555,0.0005020767,0.0027605428],"genre_scores_gemma":[0.6294205,0.00062139996,0.35656014,0.0005031062,0.0001317929,0.00007982072,0.00019408473,0.00023588807,0.0122533385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993844,0.00019650695,0.00002500408,0.00012051197,0.0002122774,0.00006123895],"domain_scores_gemma":[0.99938035,0.00031800484,0.000042533808,0.00016589508,0.000065376335,0.000027746199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010616897,0.00060673745,0.0007401229,0.00027960094,0.00023126863,0.000805462,0.00075927324,0.0012789335,0.0021389765],"category_scores_gemma":[0.0021596805,0.00036540136,0.0006689015,0.0002601118,0.0008650863,0.001103845,0.0019012025,0.0019671277,0.0006310624],"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.0008705367,0.00014041238,0.0010668765,0.00027133588,0.00022865372,0.00067015813,0.00021471661,0.3907964,0.091012634,0.1129508,0.0065198354,0.39525765],"study_design_scores_gemma":[0.000011557284,0.000090056776,0.00017449557,0.000024851284,0.000020229632,0.00040572265,0.000011973082,0.96168786,0.016422916,0.018696595,0.0024381126,0.000015628522],"about_ca_topic_score_codex":0.0003338044,"about_ca_topic_score_gemma":0.000446678,"teacher_disagreement_score":0.0021389765,"about_ca_system_score_codex":0.000303217,"about_ca_system_score_gemma":0.00040095148,"threshold_uncertainty_score":0.007155597},"labels":[],"label_agreement":null},{"id":"W4283830494","doi":"10.1007/978-3-031-16440-8_31","title":"Class Impression for Data-Free Incremental Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Forgetting; Margin (machine learning); Class (philosophy); Artificial intelligence; Machine learning; Cross entropy; Pattern recognition (psychology)","score_opus":0.04018152908418219,"score_gpt":0.2830577955797941,"score_spread":0.24287626649561192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283830494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010528344,0.0013977484,0.9278185,0.00096566806,0.0009498427,0.00014287452,0.00047995438,0.005768575,0.051948514],"genre_scores_gemma":[0.47978556,0.0013120985,0.40062732,0.0007749817,0.0013520889,0.00043003936,0.0022478432,0.0027019687,0.11076813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00008082271,0.000024598858,0.00015785989,0.00024769377,0.00006522293],"domain_scores_gemma":[0.99776757,0.0009030688,0.000042768523,0.00080573006,0.00033245626,0.00014838969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187994,0.0005560997,0.0007341754,0.00069082715,0.0006298396,0.0017707978,0.002167165,0.001098776,0.0525484],"category_scores_gemma":[0.0077584875,0.0004113925,0.00051393325,0.00060815184,0.0007381907,0.0036167763,0.002315471,0.0022511617,0.009495822],"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.00047930746,0.00014308473,0.00031597732,0.00021374998,0.000026012254,0.000083779414,0.00008020924,0.011911295,0.008030159,0.06668655,0.052471425,0.85955846],"study_design_scores_gemma":[0.000109051995,0.00025918934,0.0012984797,0.000085308544,0.000059381302,0.00037959174,0.000080836166,0.645789,0.016105367,0.2695553,0.06621868,0.000059753052],"about_ca_topic_score_codex":0.00091897126,"about_ca_topic_score_gemma":0.0013907176,"teacher_disagreement_score":0.0525484,"about_ca_system_score_codex":0.00071343424,"about_ca_system_score_gemma":0.0004771934,"threshold_uncertainty_score":0.17579192},"labels":[],"label_agreement":null},{"id":"W42843301","doi":"10.1007/978-3-642-25591-5_38","title":"Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Algorithm; Path (computing); Planar graph; Planar; Grid; Graph theory; Mathematics; Time complexity; Minor (academic); Computer science; Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.038764956491295466,"score_gpt":0.3027215662326018,"score_spread":0.26395660974130636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42843301","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.18296939,0.0026054126,0.75949186,0.0023885206,0.00050429394,0.00038438858,0.0007751863,0.00092438114,0.04995656],"genre_scores_gemma":[0.49079168,0.0012172682,0.49478635,0.0003241329,0.00026703696,0.0004184487,0.0015133263,0.00020493148,0.010476784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988373,0.00036366787,0.00006385829,0.0002867728,0.0002872269,0.00016125817],"domain_scores_gemma":[0.99680746,0.0022008035,0.00015107986,0.0003978324,0.00031454465,0.0001283501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009385461,0.0005895335,0.0011566553,0.0012744792,0.0013959669,0.0024935459,0.0026975716,0.0010605247,0.012041583],"category_scores_gemma":[0.0060349894,0.00033702576,0.0011355587,0.0024616367,0.0009869325,0.004601696,0.0015281441,0.0018444634,0.0008481462],"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.00081853895,0.0006146995,0.003583553,0.000948793,0.00012253804,0.0001935906,0.00043232169,0.28229994,0.0059805145,0.43607625,0.02473882,0.24419035],"study_design_scores_gemma":[0.000083130646,0.00016432563,0.00052488875,0.000051823365,0.000054696564,0.000172359,0.0001565066,0.8223852,0.0015192427,0.1702845,0.004577893,0.000025449055],"about_ca_topic_score_codex":0.0030810328,"about_ca_topic_score_gemma":0.0029381642,"teacher_disagreement_score":0.012041583,"about_ca_system_score_codex":0.0018230737,"about_ca_system_score_gemma":0.0022499505,"threshold_uncertainty_score":0.040283084},"labels":[],"label_agreement":null},{"id":"W42849043","doi":"10.1007/978-3-642-24425-4_92","title":"Top-Down Progressive Computing","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Granular computing; Granulation; Sequence (biology); Mode (computer interface); Algorithm; Theoretical computer science; Computational science; Artificial intelligence; Human–computer interaction; Engineering","score_opus":0.022375383616479963,"score_gpt":0.24605778767920614,"score_spread":0.22368240406272616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42849043","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019147813,0.0013226868,0.82866615,0.00082702504,0.00038699017,0.00016029477,0.00039495117,0.0019028016,0.14719138],"genre_scores_gemma":[0.4202484,0.0021871605,0.4923579,0.00043808317,0.00034968628,0.00020286908,0.0009564957,0.00070732273,0.08255209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927765,0.00010024616,0.000039302253,0.00016645422,0.00029856965,0.00011787949],"domain_scores_gemma":[0.9991973,0.00017619334,0.000022426631,0.0003592973,0.00018221296,0.00006252249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053890556,0.0007021878,0.00080601947,0.0009443662,0.0016717776,0.002914336,0.0014445549,0.00051778916,0.020440476],"category_scores_gemma":[0.0024312714,0.00041839725,0.00085864164,0.0019692155,0.0017632004,0.0039265426,0.0027816338,0.0022816372,0.0042558294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082117425,0.00003253863,0.00010216911,0.00015632297,0.000015303802,0.00004535335,0.00015967547,0.006581556,0.0027122756,0.8298785,0.009768915,0.15046526],"study_design_scores_gemma":[0.000016234218,0.00003972367,0.00013283239,0.00003359935,0.000026531257,0.00010185633,0.00005892642,0.04267498,0.0034758754,0.91793233,0.03549201,0.000015020441],"about_ca_topic_score_codex":0.001955384,"about_ca_topic_score_gemma":0.0028030775,"teacher_disagreement_score":0.020440476,"about_ca_system_score_codex":0.0010826276,"about_ca_system_score_gemma":0.0011207131,"threshold_uncertainty_score":0.06838024},"labels":[],"label_agreement":null},{"id":"W4285024120","doi":"10.1007/978-3-031-10684-2","title":"Data and Applications Security and Privacy XXXVI","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Concordia University; Polytechnique Montréal; University of Toronto","funders":"","keywords":"Computer science; Computer security; Information privacy; Internet privacy","score_opus":0.03002974534810476,"score_gpt":0.2851870951109125,"score_spread":0.25515734976280774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285024120","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002089937,0.09006828,0.05642506,0.0053502023,0.011730121,0.00015515569,0.0017330928,0.0015204302,0.83092767],"genre_scores_gemma":[0.0045536673,0.022080444,0.0044340203,0.00063739746,0.0019305781,0.000063667474,0.000731515,0.00033418965,0.9652345],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996062,0.0000408934,0.0000168052,0.00006930463,0.00023321176,0.00003357905],"domain_scores_gemma":[0.99955505,0.00017102234,0.000029258978,0.00008240435,0.00011855855,0.00004361987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030851713,0.0015443374,0.0009041146,0.0017670038,0.00083971594,0.0036876793,0.0006358451,0.0011273485,0.07476875],"category_scores_gemma":[0.0009110989,0.00054347276,0.00052354584,0.0036500508,0.0008122409,0.0025130813,0.000905752,0.0025197254,0.06123216],"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.00004038313,0.00006359983,0.00012599939,0.00038155276,0.000012516397,0.00009656729,0.00014152516,0.00094255625,0.0025823321,0.08985609,0.65774477,0.24801214],"study_design_scores_gemma":[0.000005582148,0.000025858204,0.0003432788,0.00021652399,0.000007270183,0.0001959406,0.000039745155,0.0013959743,0.00082030514,0.028772134,0.96816885,0.000008619018],"about_ca_topic_score_codex":0.0017747959,"about_ca_topic_score_gemma":0.0024570755,"teacher_disagreement_score":0.07476875,"about_ca_system_score_codex":0.0012725112,"about_ca_system_score_gemma":0.0009530381,"threshold_uncertainty_score":0.25012642},"labels":[],"label_agreement":null},{"id":"W4285037962","doi":"10.1007/978-3-031-10684-2_1","title":"Assessing Differentially Private Variational Autoencoders Under Membership Inference","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential privacy; Computer science; Inference; Differential (mechanical device); Artificial intelligence; Algorithm; Data mining; Machine learning","score_opus":0.053532024949322764,"score_gpt":0.29712214998813796,"score_spread":0.2435901250388152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285037962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06613504,0.000677266,0.9281316,0.0017522093,0.00009023794,0.00007201061,0.0003018973,0.000444775,0.0023949507],"genre_scores_gemma":[0.84889686,0.0009054238,0.13933434,0.00061718427,0.00058745925,0.0002125524,0.0013332526,0.00031335626,0.0077995514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99101675,0.004822789,0.00035758928,0.0013116591,0.0020094763,0.00048167034],"domain_scores_gemma":[0.9081334,0.08222594,0.0020038458,0.0043745544,0.0019805976,0.0012816243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01597856,0.0016625561,0.0033061805,0.0011219034,0.0010015192,0.0041781887,0.0041745557,0.0058870097,0.0039544343],"category_scores_gemma":[0.08055633,0.001779245,0.0015106436,0.0011571131,0.004731085,0.007407763,0.007032706,0.006076825,0.00066778174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009750121,0.00023207451,0.004810308,0.00026259891,0.00026546844,0.00022820845,0.00021750918,0.72696275,0.0020361405,0.20206721,0.0025185505,0.059424188],"study_design_scores_gemma":[0.00002786356,0.00006900705,0.00031373903,0.000023479632,0.000016989921,0.000045547502,0.000019538242,0.8656862,0.00090724067,0.13263768,0.000238463,0.000014303142],"about_ca_topic_score_codex":0.0018465855,"about_ca_topic_score_gemma":0.0017104335,"teacher_disagreement_score":0.01597856,"about_ca_system_score_codex":0.0030315192,"about_ca_system_score_gemma":0.002124944,"threshold_uncertainty_score":0.08450371},"labels":[],"label_agreement":null},{"id":"W4285058078","doi":"10.1007/978-3-031-05637-6_4","title":"Spell Painter: Motion Controlled Spellcasting for a Wizard Video Game","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Ontario Tech University","funders":"","keywords":"Spell; Computer science; Wizard of oz; Wizard; Motion (physics); Video game; Popularity; Computer graphics (images); Painting; Work (physics); Computer vision; Artificial intelligence; Multimedia; Human–computer interaction; Simulation; Visual arts; Art; World Wide Web; Engineering","score_opus":0.01818388902039307,"score_gpt":0.23907727078724542,"score_spread":0.22089338176685236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285058078","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04933774,0.0019562107,0.77328885,0.00038975864,0.0007432019,0.0007788384,0.0019971156,0.031482764,0.14002548],"genre_scores_gemma":[0.19851957,0.0020959654,0.31782573,0.00038056416,0.00019183202,0.0006261426,0.0042711394,0.00471583,0.47137335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998919,0.000008827375,0.00000560887,0.000021925569,0.000055956927,0.000015888714],"domain_scores_gemma":[0.9999068,0.000028930372,0.0000051458724,0.000010756602,0.000027935113,0.000020540683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015350325,0.0011486559,0.00040904677,0.00053058664,0.0003000789,0.00069694297,0.0011271181,0.0006569235,0.046503212],"category_scores_gemma":[0.00039448668,0.0002912309,0.0003315418,0.0003287334,0.00018005598,0.0007055155,0.0007751033,0.00066457805,0.008377514],"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.000835806,0.00028920462,0.00029019866,0.00047852608,0.000051256433,0.0004029505,0.00032780477,0.0037324936,0.19718334,0.008515568,0.06534082,0.72255194],"study_design_scores_gemma":[0.00050708663,0.0015906439,0.0063614347,0.00030398095,0.00019990577,0.0027551646,0.00035319623,0.15536931,0.1917158,0.007967553,0.63267744,0.00019844319],"about_ca_topic_score_codex":0.002429893,"about_ca_topic_score_gemma":0.0049102586,"teacher_disagreement_score":0.046503212,"about_ca_system_score_codex":0.00028747667,"about_ca_system_score_gemma":0.0003444837,"threshold_uncertainty_score":0.15556878},"labels":[],"label_agreement":null},{"id":"W4285059318","doi":"10.1007/978-3-031-05657-4_14","title":"The Effect of Multitasking During an E-learning Video Conference on Learning Performance: A Psychophysiological Experiment","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","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":"HEC Montréal","funders":"","keywords":"Human multitasking; Videoconferencing; Computer science; Affect (linguistics); Session (web analytics); Task (project management); Multimedia; Psychology; Cognitive psychology; World Wide Web; Engineering","score_opus":0.10155717122870161,"score_gpt":0.3812313404863019,"score_spread":0.2796741692576003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285059318","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.99841344,0.000043297867,0.000307662,0.00003232097,0.00004118659,0.00010378311,0.00014167136,0.000014363097,0.0009022984],"genre_scores_gemma":[0.9944325,0.000115380266,0.0010909799,0.00015085077,0.00010354383,0.00048560483,0.00027477145,0.000039160917,0.0033071884],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924624,0.00015938375,0.00005504537,0.00023786371,0.00012474801,0.00017675299],"domain_scores_gemma":[0.99174154,0.005800114,0.00048982824,0.00034199006,0.0002051562,0.0014214672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007833021,0.00094708917,0.00065610575,0.0003448433,0.0006900961,0.0010543239,0.0011740135,0.0015939297,0.0066933935],"category_scores_gemma":[0.004328708,0.0007463966,0.00041162674,0.00036673652,0.00084615004,0.0008216176,0.0009956909,0.0018769028,0.00074108486],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.17576912,0.0710346,0.010009608,0.00047507448,0.0002833317,0.00026522402,0.0018350503,0.0011113649,0.71395975,0.00043008337,0.0005278112,0.024298994],"study_design_scores_gemma":[0.018514058,0.38277486,0.36793375,0.00009301849,0.00078198925,0.00038531917,0.0014489762,0.009343836,0.2147652,0.0016013044,0.0021064123,0.0002512635],"about_ca_topic_score_codex":0.0018244556,"about_ca_topic_score_gemma":0.0013566337,"teacher_disagreement_score":0.0066933935,"about_ca_system_score_codex":0.00035909232,"about_ca_system_score_gemma":0.0006986773,"threshold_uncertainty_score":0.022391617},"labels":[],"label_agreement":null},{"id":"W4285059325","doi":"10.1007/978-3-031-05581-2_26","title":"A Social-Media Study of the Older Adults Coping with the COVID-19 Stress by Information and Communication Technologies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Coping (psychology); Coronavirus disease 2019 (COVID-19); ICTS; Social media; Affordance; Information and Communications Technology; Psychology; Pandemic; Internet privacy; Public relations; Computer science; Political science; Medicine; World Wide Web; Cognitive psychology; Clinical psychology","score_opus":0.014393151291983198,"score_gpt":0.26657257197705525,"score_spread":0.25217942068507204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285059325","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.9982126,0.00012272883,0.000052151896,0.00023492391,0.000013360672,0.000022431235,0.00003766156,0.0000014004542,0.0013027887],"genre_scores_gemma":[0.99838376,0.00031515234,0.0000934492,0.00025614764,0.0000491262,0.000046706533,0.00003509492,0.000003321211,0.0008171764],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99900156,0.00055724016,0.00006613633,0.000065769396,0.00015397527,0.00015541693],"domain_scores_gemma":[0.9954992,0.0022256565,0.00091554073,0.00014594436,0.00056028843,0.0006533627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021071658,0.00037199986,0.00039707756,0.0021241563,0.003249974,0.0031254725,0.00036205488,0.00088753266,0.0023079605],"category_scores_gemma":[0.006073019,0.00037728276,0.00023564797,0.0012199694,0.0012545562,0.0024751155,0.0020956206,0.0010697326,0.000355148],"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.00012827145,0.00060908654,0.20627306,0.00017453235,0.00003090858,0.00089592446,0.773223,0.0000213153,0.001509291,0.0004887147,0.000888598,0.015757337],"study_design_scores_gemma":[0.00001353929,0.00048916915,0.18682647,0.00009468093,0.000022729579,0.00033038587,0.8059105,0.00009143324,0.00026084864,0.00011678006,0.0058217635,0.00002163426],"about_ca_topic_score_codex":0.0054521156,"about_ca_topic_score_gemma":0.011653033,"teacher_disagreement_score":0.0054521156,"about_ca_system_score_codex":0.0005655797,"about_ca_system_score_gemma":0.000592243,"threshold_uncertainty_score":0.011143863},"labels":[],"label_agreement":null},{"id":"W4285060627","doi":"10.1007/978-3-031-05409-9_9","title":"DESSK: Description Space for Soft Keyboards","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Representation (politics); Relation (database); Space (punctuation); Blank; Computer science; Context (archaeology); Human–computer interaction; Engineering; Mechanical engineering; Data mining","score_opus":0.02230010512367159,"score_gpt":0.25851472621492494,"score_spread":0.23621462109125335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285060627","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.004195185,0.0012019295,0.8523077,0.00032145492,0.00037158307,0.0001354135,0.008021064,0.088274635,0.045171145],"genre_scores_gemma":[0.16623813,0.0029774003,0.49941555,0.0007596437,0.0002126435,0.00088812277,0.03598946,0.06844331,0.22507568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904567,0.00015098104,0.000116710275,0.00014726994,0.00040276357,0.00013652806],"domain_scores_gemma":[0.99906534,0.0003341323,0.000034462915,0.0003056961,0.00017504032,0.00008532899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007628196,0.0017991979,0.0010222172,0.0010252837,0.00071023975,0.0038030178,0.0022866575,0.0011533211,0.13870849],"category_scores_gemma":[0.0026078543,0.0012037433,0.0013295664,0.0013777037,0.0008613901,0.0062071104,0.0046238415,0.0020956486,0.050258845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083488814,0.00007697459,0.0003552234,0.0016091539,0.00005262283,0.00031615037,0.0011271974,0.005205804,0.022877606,0.22073644,0.2451923,0.50161564],"study_design_scores_gemma":[0.0001132817,0.0000782872,0.00024346131,0.00025183457,0.000034456632,0.000560262,0.00027511193,0.020413822,0.02184594,0.08508589,0.8710097,0.00008790841],"about_ca_topic_score_codex":0.0014164384,"about_ca_topic_score_gemma":0.0017448905,"teacher_disagreement_score":0.13870849,"about_ca_system_score_codex":0.00078475196,"about_ca_system_score_gemma":0.0007630457,"threshold_uncertainty_score":0.4640261},"labels":[],"label_agreement":null},{"id":"W4285060639","doi":"10.1007/978-3-031-05581-2_30","title":"Tech Mentors, Warm Experts and Digital Care Work: Pandemic Lessons from a Remote Digital Literacy Training Program for Older Adults","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Concordia University","funders":"","keywords":"Work (physics); Digital literacy; Pandemic; Training (meteorology); Medical education; Computer science; Coronavirus disease 2019 (COVID-19); Engineering; Medicine; World Wide Web","score_opus":0.022367444021856073,"score_gpt":0.3077487314176085,"score_spread":0.2853812873957524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285060639","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.6576059,0.025583044,0.0033436783,0.080307655,0.0042812205,0.00071086205,0.00016569268,0.0003261464,0.22767588],"genre_scores_gemma":[0.7103974,0.029457452,0.011535045,0.02145344,0.0012039293,0.0007826482,0.00024237104,0.00022469112,0.22470298],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99937016,0.00025766902,0.000014266787,0.00004577998,0.000100825564,0.00021131476],"domain_scores_gemma":[0.998747,0.00032047858,0.000042069645,0.000028305085,0.000057182584,0.00080504635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021792173,0.0005222024,0.0004000634,0.00037970114,0.0050873253,0.0022248884,0.0015032551,0.0023885304,0.0087798815],"category_scores_gemma":[0.0018903195,0.00028153652,0.00039903997,0.00038700856,0.0011388796,0.0027746563,0.00480868,0.0033257029,0.0012170422],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002857857,0.0138493115,0.0061968663,0.0010733976,0.000026054073,0.0025123602,0.12600668,0.00020365114,0.0019569919,0.006131546,0.16067222,0.68108517],"study_design_scores_gemma":[0.00049490575,0.005690097,0.04383063,0.0026257301,0.00010692875,0.0029035385,0.3886626,0.00035237157,0.0022713258,0.0075499136,0.54541004,0.0001019687],"about_ca_topic_score_codex":0.003378272,"about_ca_topic_score_gemma":0.030008825,"teacher_disagreement_score":0.0087798815,"about_ca_system_score_codex":0.0010311665,"about_ca_system_score_gemma":0.004200588,"threshold_uncertainty_score":0.02937162},"labels":[],"label_agreement":null},{"id":"W4285060878","doi":"10.1007/978-3-031-06018-2_5","title":"The Bigger Picture of Digital Interventions for Pain, Anxiety and Stress: A Systematic Review of 1200+ Controlled Trials","year":2022,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Anxiety; Psychological intervention; Distraction; Randomized controlled trial; Systematic review; Population; Inclusion (mineral); Chronic pain; Depression (economics); Medicine; Clinical psychology; Psychology; Psychiatry; MEDLINE; Cognitive psychology; Social psychology","score_opus":0.10889179593607849,"score_gpt":0.44619922588816807,"score_spread":0.33730742995208957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285060878","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056834775,0.9979292,0.0001780148,0.00026100065,0.00014869467,0.00042671978,0.00022164127,0.00000949899,0.00025678784],"genre_scores_gemma":[0.011098524,0.985622,0.00093145284,0.0007849609,0.00010896664,0.0010745318,0.00022093489,0.000011983993,0.00014664672],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9830049,0.006234736,0.0067209504,0.0010555369,0.0025854935,0.00039841433],"domain_scores_gemma":[0.9392175,0.04780843,0.0075417617,0.0010030713,0.003996073,0.00043320798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0186682,0.002072544,0.013036378,0.009933183,0.00087371434,0.0046225707,0.0021152243,0.002568673,0.007905276],"category_scores_gemma":[0.07423278,0.0015158844,0.0116333775,0.010832306,0.0012308276,0.0037598475,0.001905167,0.002267129,0.00066560274],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035380494,0.000017753287,0.00022723079,0.95748395,0.009585874,0.00004259129,0.0001019662,0.00005792415,0.00015244093,0.00018791137,0.0008538649,0.030934667],"study_design_scores_gemma":[0.0005005907,0.00022271872,0.0016340037,0.9209273,0.06530371,0.00013743763,0.00018344277,0.000057418063,0.00014769548,0.00027590728,0.010584488,0.000025292164],"about_ca_topic_score_codex":0.006630112,"about_ca_topic_score_gemma":0.020634865,"teacher_disagreement_score":0.0186682,"about_ca_system_score_codex":0.0048844763,"about_ca_system_score_gemma":0.011795911,"threshold_uncertainty_score":0.09872806},"labels":[],"label_agreement":null},{"id":"W4285066308","doi":"10.1007/978-3-031-05581-2_16","title":"Why It is Easier to Slay a Dragon Than to Kill a Myth About Older People’s Smartphone Use","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":3,"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":"Canadian Institutes of Health Research; ZonMw; Joint Programming Initiative More Years, Better Lives","keywords":"Everyday life; Phone; Context (archaeology); Mythology; Sketch; Empirical research; Computer science; Internet privacy; Smartphone application; Smart phone; Applied psychology; Psychology; Multimedia; Telecommunications; History","score_opus":0.01672756608694176,"score_gpt":0.270627846583138,"score_spread":0.25390028049619623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285066308","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.11809016,0.06233545,0.0073219407,0.15308799,0.018517975,0.00009605574,0.00031853231,0.0003216947,0.63991016],"genre_scores_gemma":[0.42719847,0.03347406,0.0042671147,0.05265794,0.0033599548,0.00009939688,0.00023393892,0.00028892557,0.47842023],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9996026,0.000114257724,0.000018431736,0.00004579884,0.00013996946,0.00007889262],"domain_scores_gemma":[0.9990664,0.00045409155,0.00008545499,0.000038322578,0.00019354478,0.00016219013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008192577,0.00034068179,0.000206189,0.00035920803,0.0012925023,0.0024500964,0.00031812477,0.0017482967,0.0166207],"category_scores_gemma":[0.003338233,0.00018419755,0.0003601462,0.00027768948,0.001786846,0.003926432,0.0011171071,0.002803528,0.004292105],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010760061,0.00008434818,0.006246596,0.0007402412,0.000054672793,0.001485936,0.11183,0.00006499636,0.0034059102,0.048283167,0.47892562,0.34877104],"study_design_scores_gemma":[0.00001847373,0.000107401895,0.010550456,0.0011574381,0.000036092897,0.0034251744,0.06450244,0.000092703995,0.00073674286,0.014117081,0.9052199,0.000036002824],"about_ca_topic_score_codex":0.003546456,"about_ca_topic_score_gemma":0.0073168506,"teacher_disagreement_score":0.0166207,"about_ca_system_score_codex":0.0006228001,"about_ca_system_score_gemma":0.0006214449,"threshold_uncertainty_score":0.055601776},"labels":[],"label_agreement":null},{"id":"W4285108804","doi":"10.1007/978-3-031-09843-7","title":"Graph Transformation","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McMaster University; Queen's University","funders":"","keywords":"Computer science","score_opus":0.01041855646850432,"score_gpt":0.2274565165825371,"score_spread":0.21703796011403279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285108804","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005490513,0.00033944362,0.69753915,0.00063668203,0.0006646554,0.00047987263,0.0034312191,0.0136322,0.27778623],"genre_scores_gemma":[0.13952146,0.0014056274,0.45890862,0.0009471526,0.00018966352,0.0005802987,0.017003778,0.010079907,0.3713636],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948514,0.00007686871,0.000017891773,0.00017908306,0.00019338212,0.00004763828],"domain_scores_gemma":[0.99955946,0.00008043666,0.000012319595,0.00020910092,0.00011421543,0.000024412557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023823486,0.0008673936,0.00041583413,0.0014879275,0.0006590277,0.001266372,0.0009906197,0.00051608135,0.08349447],"category_scores_gemma":[0.0010713593,0.0003624786,0.0011326175,0.0013125788,0.0005590778,0.0015316082,0.0016791095,0.0014621927,0.041490633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010863068,0.00014553411,0.00025762522,0.00033248466,0.000042063064,0.00020879906,0.00018937362,0.0062174136,0.015691848,0.33102033,0.13185744,0.5139285],"study_design_scores_gemma":[0.000042968,0.000055965585,0.00033622448,0.000081531005,0.00005815716,0.0004023079,0.00013821357,0.025445467,0.027817804,0.34535757,0.60023826,0.00002553631],"about_ca_topic_score_codex":0.0019261661,"about_ca_topic_score_gemma":0.0026486483,"teacher_disagreement_score":0.08349447,"about_ca_system_score_codex":0.00057068275,"about_ca_system_score_gemma":0.00076267024,"threshold_uncertainty_score":0.27931684},"labels":[],"label_agreement":null},{"id":"W4285110495","doi":"10.1007/978-3-031-09593-1_4","title":"IoT Architecture with Plug and Play for Fast Deployment and System Reliability: AMI Platform","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Software deployment; Internet of Things; Dashboard; Architecture; Visualization; Reliability (semiconductor); Plug and play; Embedded system; Operating system; Software engineering","score_opus":0.011851299112071573,"score_gpt":0.21397542295164637,"score_spread":0.2021241238395748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285110495","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.16141199,0.0010972886,0.7186727,0.0012073626,0.00062249595,0.0006787239,0.00042283747,0.033953816,0.081932776],"genre_scores_gemma":[0.8311136,0.00042932562,0.14071201,0.00032334405,0.0001622747,0.00038867208,0.00056615076,0.0005592052,0.025745437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975294,0.00003369543,0.000017218346,0.000031840947,0.00011685919,0.0000474957],"domain_scores_gemma":[0.99979955,0.00003130123,0.00001676091,0.000039642266,0.00006903805,0.000043747787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038092714,0.00051314954,0.00022316686,0.0004122904,0.00027596654,0.00093120424,0.0011663717,0.0005207751,0.005939754],"category_scores_gemma":[0.0003977883,0.00019472455,0.00026089538,0.00022010147,0.00025119877,0.0010021414,0.0009193907,0.0007005198,0.0019755834],"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.001417921,0.0013921447,0.005238294,0.00081126945,0.00015334183,0.0034506142,0.001117052,0.039388604,0.35585114,0.09116849,0.07301476,0.42699626],"study_design_scores_gemma":[0.00023135431,0.0015156729,0.007275472,0.00013790418,0.00015187179,0.0022172756,0.00030235935,0.6766125,0.109369695,0.022776036,0.17926645,0.00014345442],"about_ca_topic_score_codex":0.0008124185,"about_ca_topic_score_gemma":0.00077159173,"teacher_disagreement_score":0.005939754,"about_ca_system_score_codex":0.00024329663,"about_ca_system_score_gemma":0.00036712867,"threshold_uncertainty_score":0.01987046},"labels":[],"label_agreement":null},{"id":"W4285111204","doi":"10.1007/978-3-030-98438-0_21","title":"Correction to: SortOut: Persuasive Stress Management Mobile Application for Higher Education Students","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technostress in Professional Settings","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Stress (linguistics); Resolution (logic); Multimedia; Artificial intelligence; Linguistics","score_opus":0.013799026778176682,"score_gpt":0.3500585232592217,"score_spread":0.33625949648104503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285111204","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002993882,0.0006470067,0.00065429945,0.09803409,0.894757,0.000041991512,0.000939382,0.00094884535,0.0036780979],"genre_scores_gemma":[0.017323483,0.0041184123,0.0035509875,0.24257429,0.28152907,0.00045508542,0.0017761576,0.0024131646,0.44625932],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959902,0.00045060006,0.00055853435,0.00061248126,0.0019427392,0.00044549568],"domain_scores_gemma":[0.9665995,0.0066275834,0.0016753264,0.0025708214,0.020225098,0.0023016403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026550489,0.0017350685,0.0022884738,0.002728625,0.0038693838,0.004014074,0.0030918398,0.012957543,0.08075868],"category_scores_gemma":[0.053977218,0.0008050642,0.0013910201,0.0019450864,0.0023123447,0.0018738483,0.002445097,0.013324333,0.06002753],"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.000027447279,0.000007662859,0.000049255123,0.00007415785,0.000004650202,0.00013089494,0.000030135654,0.000019180467,0.000035705496,0.00022973676,0.994926,0.0044651674],"study_design_scores_gemma":[0.000041073574,0.000025261848,0.00078827277,0.00025217162,0.000021882875,0.0004443411,0.00015797211,0.00018409884,0.00032828804,0.00071376236,0.99700695,0.000035942936],"about_ca_topic_score_codex":0.016698502,"about_ca_topic_score_gemma":0.021252802,"teacher_disagreement_score":0.08075868,"about_ca_system_score_codex":0.0038428155,"about_ca_system_score_gemma":0.0057074847,"threshold_uncertainty_score":0.27016473},"labels":[],"label_agreement":null},{"id":"W4285113967","doi":"10.1007/978-3-031-09037-0_25","title":"Using Convolutional Neural Network to Handle Word Shape Similarities in Handwritten Cursive Arabic Scripts of Pashto Language","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cursive; Computer science; Artificial intelligence; Scripting language; Convolutional neural network; Word (group theory); Natural language processing; Speech recognition; Set (abstract data type); Class (philosophy); Pattern recognition (psychology); Mathematics","score_opus":0.03087748646269007,"score_gpt":0.27256729797719026,"score_spread":0.2416898115145002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285113967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46016246,0.0009825911,0.51677567,0.00025270984,0.00035863568,0.00015434869,0.00093184615,0.00736526,0.013016472],"genre_scores_gemma":[0.7786871,0.000425548,0.20278256,0.00012408447,0.00005948814,0.00005117626,0.0019704858,0.00036136634,0.015538138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986255,0.000011933217,0.000009402943,0.0000534851,0.000035746958,0.00002683356],"domain_scores_gemma":[0.99975663,0.00005612475,0.00003042108,0.000035032623,0.000099689256,0.000022231972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014178672,0.00063040084,0.00034982475,0.0006366901,0.00031904996,0.00055010937,0.0004263117,0.00036000062,0.0031757394],"category_scores_gemma":[0.0005061713,0.00025284183,0.00051385193,0.0006097886,0.00022633205,0.0006776039,0.00042720832,0.00047978974,0.0012786235],"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.00051646796,0.00012844862,0.0033725142,0.00021802327,0.00009089802,0.00073829724,0.00018973886,0.04298289,0.21932074,0.0021277627,0.0054680835,0.7248461],"study_design_scores_gemma":[0.000011385936,0.00011047932,0.0058887675,0.000020843154,0.0000590909,0.0003421542,0.00011533797,0.9288861,0.05872835,0.0018796177,0.0039298963,0.000028003058],"about_ca_topic_score_codex":0.01377547,"about_ca_topic_score_gemma":0.020182056,"teacher_disagreement_score":0.01377547,"about_ca_system_score_codex":0.00040159567,"about_ca_system_score_gemma":0.0004907629,"threshold_uncertainty_score":0.0273906},"labels":[],"label_agreement":null},{"id":"W4285122128","doi":"10.1007/978-3-031-09342-5_11","title":"Integrating Graph Convolutional Networks (GCNNs) and Long Short-Term Memory (LSTM) for Efficient Diagnosis of Autism","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autism Spectrum Disorder Research","field":"Neuroscience","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Autism spectrum disorder; Deep learning; Convolutional neural network; Long short term memory; Autism; Recall; Graph; Machine learning; Recurrent neural network; Neurodevelopmental disorder; Artificial neural network; Psychology; Cognitive psychology; Psychiatry","score_opus":0.027175935581796637,"score_gpt":0.2817601208846044,"score_spread":0.25458418530280774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285122128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03742816,0.010726648,0.92733115,0.0015297278,0.00045991992,0.00008072103,0.0011634049,0.007017113,0.014263079],"genre_scores_gemma":[0.32971323,0.007989575,0.63562894,0.00062488305,0.00026469308,0.000070561975,0.002226868,0.00051645905,0.02296478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998957,0.000017542763,0.000005373071,0.00003100679,0.000033620185,0.000016739374],"domain_scores_gemma":[0.99981767,0.00009248343,0.000011201584,0.00001672476,0.000051337858,0.000010523457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003028619,0.0007673871,0.0003129492,0.00058613013,0.00012894439,0.00053397653,0.0006072283,0.00075244164,0.0032483619],"category_scores_gemma":[0.00066894654,0.00022815967,0.0004268206,0.00059677596,0.00017486568,0.0007444105,0.0005527873,0.000710897,0.0012059095],"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.00009130683,0.0000358217,0.0011780646,0.00016168009,0.00007796567,0.00017673406,0.000031424825,0.03573851,0.018612988,0.0061132144,0.01444226,0.92334],"study_design_scores_gemma":[0.000022693643,0.00015420673,0.0032998188,0.00014530146,0.00021757276,0.00081784005,0.00006429967,0.88225335,0.0380934,0.046069954,0.028812619,0.00004892407],"about_ca_topic_score_codex":0.007776793,"about_ca_topic_score_gemma":0.021267066,"teacher_disagreement_score":0.007776793,"about_ca_system_score_codex":0.00045765715,"about_ca_system_score_gemma":0.00064457546,"threshold_uncertainty_score":0.015463054},"labels":[],"label_agreement":null},{"id":"W4285124098","doi":"10.1007/978-3-031-07704-3_5","title":"The Role of Astrocytes in Alzheimer’s Disease Progression","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Alzheimer's disease research and treatments","field":"Medicine","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":"Wilfrid Laurier University","funders":"","keywords":"Disease; Neuroscience; Psychology; Medicine; Pathology","score_opus":0.021752830938617986,"score_gpt":0.3093535751225311,"score_spread":0.2876007441839131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285124098","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018743608,0.73493844,0.00706059,0.011259279,0.007828714,0.000064636646,0.00041573885,0.00013403578,0.21955495],"genre_scores_gemma":[0.09792162,0.5589792,0.009738742,0.0033657397,0.0035801318,0.00011629,0.0004429581,0.00009350173,0.32576177],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999318,0.000011448512,0.0000037894079,0.000010399086,0.000029471566,0.000013115824],"domain_scores_gemma":[0.9999275,0.0000221868,0.000006058457,0.0000037891893,0.000025337251,0.00001499464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020789559,0.0003200727,0.0003135716,0.0005426283,0.00032074132,0.001223147,0.0003866901,0.00064067193,0.0054361676],"category_scores_gemma":[0.00015344954,0.00017927088,0.00026286463,0.0005800279,0.00029726556,0.0007562923,0.0004756525,0.0016242069,0.0024153716],"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.00042306815,0.00021443026,0.0010383939,0.0021170522,0.00004841747,0.0023502354,0.0008623889,0.0007965114,0.08951845,0.09655764,0.121358484,0.684715],"study_design_scores_gemma":[0.000029276396,0.00020920392,0.0034769978,0.0005733443,0.000044898967,0.002278432,0.00040091932,0.0004335753,0.012961152,0.038710583,0.9408632,0.000018475348],"about_ca_topic_score_codex":0.0013960373,"about_ca_topic_score_gemma":0.0031092595,"teacher_disagreement_score":0.0054361676,"about_ca_system_score_codex":0.00037098912,"about_ca_system_score_gemma":0.00046608996,"threshold_uncertainty_score":0.018185854},"labels":[],"label_agreement":null},{"id":"W4285124429","doi":"10.1007/978-3-031-09342-5_45","title":"Development of AI-Enabled Apps by Patients and Domain Experts Using the Punya Platform: A Case Study for Diabetes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Computer science; Domain (mathematical analysis); Mobile apps; World Wide Web; Semantic Web; Human–computer interaction; Multimedia; Data science","score_opus":0.08637581802385638,"score_gpt":0.33792888863468573,"score_spread":0.2515530706108293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285124429","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.9629536,0.00031155118,0.00913942,0.0018870559,0.000064002495,0.0003603251,0.00013323488,0.0002856638,0.02486513],"genre_scores_gemma":[0.948047,0.00038712745,0.033896204,0.0007268459,0.000023148843,0.00020767128,0.00021930777,0.00013433199,0.016358443],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99811137,0.0010644936,0.00009270259,0.00016306799,0.00031334217,0.00025507697],"domain_scores_gemma":[0.9944596,0.0038574957,0.00023705412,0.00030935972,0.00035684116,0.0007795547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027162756,0.00040668008,0.0002202558,0.00059470325,0.0019625812,0.0021532746,0.0010992808,0.0015668357,0.0034036492],"category_scores_gemma":[0.0062763914,0.0002850243,0.00040858437,0.00044913433,0.0009158708,0.0014137689,0.0022185883,0.0014126793,0.00097614195],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012430823,0.013567405,0.10794295,0.0011683732,0.00013645286,0.058633547,0.25752535,0.002959232,0.024362696,0.011864316,0.025695248,0.4949014],"study_design_scores_gemma":[0.0007725653,0.009368528,0.15503803,0.0016296137,0.0005100548,0.068117216,0.3668643,0.045606297,0.048163522,0.011198207,0.29226327,0.00046843957],"about_ca_topic_score_codex":0.0025338964,"about_ca_topic_score_gemma":0.0050643403,"teacher_disagreement_score":0.0034036492,"about_ca_system_score_codex":0.00073942955,"about_ca_system_score_gemma":0.0015641616,"threshold_uncertainty_score":0.014365196},"labels":[],"label_agreement":null},{"id":"W4285130250","doi":"10.1007/978-3-031-08473-7_41","title":"A BERT-Based Approach for Multilingual Discourse Connective Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Linguistics; Natural language processing; Philosophy","score_opus":0.01765158086032472,"score_gpt":0.2870702121837653,"score_spread":0.2694186313234406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285130250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108862715,0.0005494667,0.9598691,0.00031095094,0.00021993712,0.00029537635,0.0019383148,0.01633271,0.00959781],"genre_scores_gemma":[0.12779447,0.00031548107,0.84565365,0.00019243965,0.00018836725,0.00029617097,0.0047955266,0.0011577705,0.019606134],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834883,0.0003089637,0.00009882393,0.00039958215,0.0006745782,0.00016927732],"domain_scores_gemma":[0.9973571,0.00088506023,0.00013364374,0.00036801325,0.0010779372,0.00017833064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012579287,0.0017662462,0.001417632,0.0053465464,0.0018645631,0.002626805,0.002540072,0.0017249286,0.021227255],"category_scores_gemma":[0.0035535204,0.0008609355,0.001062029,0.003729661,0.0006779575,0.0033046033,0.0032914006,0.0017063292,0.013266233],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001044174,0.00030396975,0.0020570667,0.0003801719,0.00012521367,0.00056425337,0.0003560378,0.009216516,0.07012103,0.021117626,0.028811403,0.8659026],"study_design_scores_gemma":[0.000059781716,0.00021221218,0.0023188945,0.00008494289,0.00011308358,0.00080775283,0.00046202805,0.88308376,0.042081397,0.032797854,0.03786533,0.000112985814],"about_ca_topic_score_codex":0.009122146,"about_ca_topic_score_gemma":0.018373434,"teacher_disagreement_score":0.021227255,"about_ca_system_score_codex":0.00094162056,"about_ca_system_score_gemma":0.0018066535,"threshold_uncertainty_score":0.07101232},"labels":[],"label_agreement":null},{"id":"W4285132338","doi":"10.1007/978-3-031-06427-2_27","title":"AD-CGAN: Contrastive Generative Adversarial Network for Anomaly Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Concordia University","funders":"","keywords":"Discriminative model; Computer science; Generative grammar; Anomaly detection; Anomaly (physics); Artificial intelligence; Pattern recognition (psychology); Normality; Sample (material); Machine learning; Mathematics; Statistics","score_opus":0.013507685870105863,"score_gpt":0.24085072677112368,"score_spread":0.2273430409010178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285132338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020812517,0.0002451126,0.99338853,0.00010151367,0.00008534062,0.000036745907,0.00014847305,0.0029804066,0.00093265885],"genre_scores_gemma":[0.20181134,0.00059278915,0.7797219,0.00052338885,0.00017449065,0.0002777834,0.0016515834,0.0011870088,0.014059716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999278,0.00021780758,0.000024164543,0.00020188103,0.00021585327,0.00006222457],"domain_scores_gemma":[0.99890304,0.0006154951,0.000051239855,0.00022220673,0.00016811992,0.000039921928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012619513,0.0012957946,0.0010386924,0.0008060568,0.00040416542,0.00085316965,0.0025978435,0.0015588113,0.0051298337],"category_scores_gemma":[0.0030608315,0.00057743373,0.0008993779,0.0007520384,0.0007603354,0.0012481742,0.0022150562,0.003311283,0.0022545883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002196287,0.00012096288,0.00075123506,0.0001313498,0.00014411955,0.0001590643,0.000052549367,0.52175355,0.009174362,0.02527459,0.02364733,0.41857126],"study_design_scores_gemma":[0.0000036563092,0.000012534037,0.000056764962,0.0000036829836,0.000006165461,0.00003642515,0.0000020107277,0.98917013,0.0016236647,0.0076975683,0.0013819628,0.0000053667595],"about_ca_topic_score_codex":0.0027718158,"about_ca_topic_score_gemma":0.004107385,"teacher_disagreement_score":0.0051298337,"about_ca_system_score_codex":0.0007410284,"about_ca_system_score_gemma":0.0006219563,"threshold_uncertainty_score":0.017161012},"labels":[],"label_agreement":null},{"id":"W4285135231","doi":"10.1007/978-3-031-09593-1_11","title":"Design COVID-19 Ontology: A Healthcare and Safety Perspective","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Ontology; Computer science; RDF; Health care; Coronavirus disease 2019 (COVID-19); Work (physics); Perspective (graphical); Representation (politics); Pandemic; Web Ontology Language; Knowledge management; Data science; World Wide Web; Semantic Web; Medicine; Artificial intelligence","score_opus":0.046398209425217565,"score_gpt":0.302612387080654,"score_spread":0.25621417765543647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285135231","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.0121465055,0.0013284876,0.9083148,0.0061937342,0.0005950517,0.0007737351,0.0024954642,0.0011197875,0.067032434],"genre_scores_gemma":[0.1118812,0.0020918997,0.8545043,0.0015033049,0.000165472,0.0006418886,0.0073534627,0.00045473437,0.021403844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976725,0.0006195719,0.0002531812,0.00040788515,0.00078103435,0.00026585898],"domain_scores_gemma":[0.9990054,0.0001799858,0.00008164707,0.00014401336,0.00041919775,0.00016978844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027857465,0.00052188546,0.00039243404,0.0027261802,0.0017221597,0.003907226,0.0015658112,0.0013647616,0.0044087004],"category_scores_gemma":[0.0022147105,0.00040289562,0.0012788988,0.0024160887,0.0016441756,0.0043627196,0.003923269,0.0016740535,0.0015814196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036868616,0.000110908106,0.0016845921,0.00047805664,0.000044138164,0.00070149783,0.0014110494,0.0050396603,0.0053739357,0.8938394,0.020325169,0.0709548],"study_design_scores_gemma":[0.000022322913,0.00003743693,0.00092123135,0.00056708965,0.00007877992,0.0010543236,0.0018190801,0.031828716,0.0050972793,0.1832925,0.7752366,0.000044711247],"about_ca_topic_score_codex":0.012274616,"about_ca_topic_score_gemma":0.009727148,"teacher_disagreement_score":0.012274616,"about_ca_system_score_codex":0.0028388575,"about_ca_system_score_gemma":0.0056376117,"threshold_uncertainty_score":0.024406374},"labels":[],"label_agreement":null},{"id":"W4285135707","doi":"10.1007/978-3-031-06678-8_15","title":"An Efficient Algorithm for the Proximity Connected Two Center Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Context (archaeology); Mathematics; Combinatorics; Algorithm; Cutting stock problem; Discrete mathematics; Computer science; Optimization problem; Geography","score_opus":0.016819547470137097,"score_gpt":0.26198397635610154,"score_spread":0.24516442888596446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285135707","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.004902991,0.00016183968,0.98520976,0.00018821757,0.000112391346,0.00018278808,0.00012097765,0.0013676382,0.007753355],"genre_scores_gemma":[0.04419568,0.00013506405,0.9467305,0.0001129591,0.00006193374,0.0003597621,0.0006200785,0.00048418972,0.007299771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991517,0.00012890768,0.000040193696,0.00022960713,0.00033599217,0.00011364968],"domain_scores_gemma":[0.99905974,0.0004608531,0.00004984536,0.00018570361,0.00016939543,0.000074431955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192352,0.0016030899,0.0019216348,0.0018362594,0.0015826124,0.0019658727,0.0036169223,0.0023740558,0.027228164],"category_scores_gemma":[0.0034299626,0.0010075825,0.0013593511,0.0025938102,0.000989551,0.0032004488,0.0055443062,0.0031282876,0.0061077513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034814863,0.00040352973,0.0005059266,0.00041708883,0.00007543681,0.00024589308,0.0002722588,0.092555195,0.008283841,0.12908113,0.036394596,0.7314169],"study_design_scores_gemma":[0.00030687824,0.00014668607,0.00025523314,0.0000463407,0.000047447105,0.00031839218,0.00018762203,0.80110353,0.0049346853,0.16804725,0.024561029,0.000044918845],"about_ca_topic_score_codex":0.003137619,"about_ca_topic_score_gemma":0.0037173,"teacher_disagreement_score":0.027228164,"about_ca_system_score_codex":0.0010458117,"about_ca_system_score_gemma":0.0016701308,"threshold_uncertainty_score":0.09108734},"labels":[],"label_agreement":null},{"id":"W4285137928","doi":"10.1007/978-3-031-09342-5_6","title":"Explainable Clinical Decision Support: Towards Patient-Facing Explanations for Education and Long-Term Behavior Change","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Dalhousie University","funders":"","keywords":"Term (time); Behavior change; Work (physics); Computer science; Psychology; Applied psychology; Knowledge management; Medicine; Social psychology","score_opus":0.07493354672405587,"score_gpt":0.3572985281964533,"score_spread":0.2823649814723974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285137928","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.023603505,0.0043822196,0.9039615,0.023378732,0.0006466173,0.00037077858,0.0011188721,0.0047520236,0.037785728],"genre_scores_gemma":[0.23308383,0.0034298496,0.73215157,0.0020760796,0.00033450543,0.00032155393,0.0023623356,0.00042028667,0.025820065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876726,0.0007107032,0.00006232322,0.00012429808,0.0002881813,0.000047384845],"domain_scores_gemma":[0.9929763,0.0058598947,0.00029882768,0.00038056896,0.00031583934,0.0001686542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027064686,0.00069439574,0.00026348614,0.00056379545,0.00028536364,0.0024319135,0.0016046406,0.0020761755,0.017186789],"category_scores_gemma":[0.0132832965,0.00031936617,0.00058327295,0.00043846297,0.00062115834,0.0027442987,0.0016605787,0.0021886774,0.0022580859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023201307,0.00040317135,0.0033359898,0.0008960401,0.00012410383,0.00048428733,0.0037650696,0.017108845,0.0032996424,0.13887765,0.05790101,0.77357215],"study_design_scores_gemma":[0.00021552049,0.0002977963,0.0033649364,0.0011971997,0.00020492083,0.0010195746,0.0013492632,0.2504733,0.006786085,0.48726618,0.24772547,0.00009970323],"about_ca_topic_score_codex":0.0010825678,"about_ca_topic_score_gemma":0.0019133012,"teacher_disagreement_score":0.017186789,"about_ca_system_score_codex":0.00070306094,"about_ca_system_score_gemma":0.0014443465,"threshold_uncertainty_score":0.057495534},"labels":[],"label_agreement":null},{"id":"W4285140022","doi":"10.1007/978-3-031-06220-9_8","title":"Reconciliation with Segmental Duplication, Transfer, Loss and Gain","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"CRISPR and Genetic Engineering","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Gene duplication; Tree (set theory); CRISPR; Genome; Set (abstract data type); Gene; Computer science; Dynamic programming; Diversification (marketing strategy); Segmental duplication; Theoretical computer science; Gene family; Biology; Computational biology; Algorithm; Combinatorics; Genetics; Mathematics; Programming language","score_opus":0.006469011369344214,"score_gpt":0.240688279890445,"score_spread":0.23421926852110078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285140022","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.045479286,0.012070684,0.8396774,0.004143168,0.002479124,0.00014169046,0.000831267,0.004234768,0.09094263],"genre_scores_gemma":[0.59097654,0.00869372,0.34596157,0.0020091243,0.0009901962,0.00037195202,0.0024648958,0.0033851909,0.045146823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981358,0.0007369992,0.00011196684,0.00048065145,0.00034865044,0.00018591231],"domain_scores_gemma":[0.9966665,0.0018349515,0.00015636517,0.0011471105,0.00014051239,0.000054571883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031369003,0.0007662975,0.0014293663,0.001082525,0.0011312282,0.0033746378,0.0023637726,0.0019289494,0.009822187],"category_scores_gemma":[0.009698601,0.0006243444,0.0012563001,0.0023865486,0.0040487656,0.0060241497,0.004214377,0.0027142756,0.003288952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003980619,0.000040534025,0.00068020565,0.0005298791,0.00012309165,0.0008478329,0.00080806157,0.0234322,0.008282244,0.6645778,0.015931584,0.2843484],"study_design_scores_gemma":[0.00003850902,0.00004234603,0.00021629216,0.00007762532,0.00006192555,0.0007875816,0.00015339797,0.017716406,0.007486307,0.91785425,0.055529267,0.000036043504],"about_ca_topic_score_codex":0.00036958943,"about_ca_topic_score_gemma":0.0005445575,"teacher_disagreement_score":0.009822187,"about_ca_system_score_codex":0.0008852016,"about_ca_system_score_gemma":0.0009130704,"threshold_uncertainty_score":0.03285849},"labels":[],"label_agreement":null},{"id":"W4285141020","doi":"10.1007/978-3-031-08147-7_8","title":"Implementation of Lightweight Ciphers and Their Integration into Entity Authentication with IEEE 802.11 Physical Layer Transmission","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Handshaking; Computer science; Computer network; Handshake; Physical layer; Mutual authentication; Authentication protocol; Embedded system; Wireless; Operating system","score_opus":0.013506559331970886,"score_gpt":0.2748908163341187,"score_spread":0.26138425700214785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285141020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019604333,0.0011388689,0.9574535,0.00035840712,0.00037919183,0.00019753013,0.00011069462,0.0026262833,0.018131165],"genre_scores_gemma":[0.4359994,0.0028348104,0.5074334,0.00028557162,0.00032840043,0.00046315775,0.00057936145,0.0006727071,0.051403176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894196,0.00022689985,0.000113067625,0.00006840236,0.0005300194,0.000119696175],"domain_scores_gemma":[0.9983486,0.00044253556,0.00015831448,0.00066110224,0.00034816618,0.000041350544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158164,0.00065488415,0.00046419667,0.00069545576,0.00045213118,0.0020359957,0.0010789719,0.0008850241,0.0066093854],"category_scores_gemma":[0.0035137497,0.00058589195,0.00046243845,0.00063413306,0.0006768752,0.0031448128,0.0014013881,0.0017154417,0.004289126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059153856,0.00026608066,0.0010794175,0.00054871663,0.00007245239,0.00046341168,0.0003928864,0.022510262,0.1442238,0.41254783,0.014055332,0.4032483],"study_design_scores_gemma":[0.00016478944,0.0010115239,0.0013420959,0.00032216305,0.00014680905,0.0018730833,0.00012885543,0.3356501,0.35077408,0.11632614,0.19213074,0.00012952914],"about_ca_topic_score_codex":0.00020725671,"about_ca_topic_score_gemma":0.0002648967,"teacher_disagreement_score":0.0066093854,"about_ca_system_score_codex":0.00043130267,"about_ca_system_score_gemma":0.00095624244,"threshold_uncertainty_score":0.022110581},"labels":[],"label_agreement":null},{"id":"W4285146274","doi":"10.1007/978-3-031-08147-7_7","title":"Employing Feature Selection to Improve the Performance of Intrusion Detection Systems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Geotab (Canada); Université du Québec à Chicoutimi","funders":"","keywords":"Intrusion detection system; Computer science; Feature selection; Feature (linguistics); Data mining; Selection (genetic algorithm); Artificial intelligence; Anomaly detection; Pattern recognition (psychology); Intrusion; Feature extraction; Machine learning","score_opus":0.009035598866206862,"score_gpt":0.21414971142231254,"score_spread":0.20511411255610568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285146274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21975657,0.0030054187,0.7652703,0.00049881183,0.00045831705,0.000078008394,0.00029197114,0.008240779,0.0023999056],"genre_scores_gemma":[0.7826349,0.0008331945,0.21251698,0.00014213643,0.00026361455,0.000052649146,0.0006245611,0.00026186008,0.0026700522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999468,0.00012841108,0.000047608584,0.00009778592,0.0001869404,0.00007118794],"domain_scores_gemma":[0.9980038,0.001335274,0.0000927408,0.00016396886,0.00037058024,0.000033590477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010738836,0.00097608764,0.0010247475,0.0009544934,0.00030256496,0.0009861026,0.00072743796,0.0005891406,0.0013426674],"category_scores_gemma":[0.0036791451,0.00030540716,0.00045343678,0.0012091052,0.00021961746,0.0011586739,0.00045655607,0.0007567749,0.00063997746],"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.00056313694,0.0002215411,0.0033587376,0.00009195641,0.00010635964,0.00010271724,0.000037488204,0.05496629,0.06302517,0.0006558467,0.004820488,0.8720502],"study_design_scores_gemma":[0.00003151735,0.00031604714,0.0033054936,0.0000084974845,0.00007533456,0.00015455305,0.00001173344,0.9566384,0.036560047,0.0012749764,0.0016041506,0.00001923041],"about_ca_topic_score_codex":0.0015538958,"about_ca_topic_score_gemma":0.0015192956,"teacher_disagreement_score":0.0015538958,"about_ca_system_score_codex":0.00028131274,"about_ca_system_score_gemma":0.00030745333,"threshold_uncertainty_score":0.0056793094},"labels":[],"label_agreement":null},{"id":"W4285153081","doi":"10.1007/978-3-031-07469-1_15","title":"Nondeterministic State Complexity of Site-Directed Deletion","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Queen's University","funders":"","keywords":"Substring; Nondeterministic algorithm; String (physics); Upper and lower bounds; Deterministic finite automaton; Prefix; Computer science; Nondeterministic finite automaton; Finite-state machine; Combinatorics; Suffix; Discrete mathematics; Regular language; Mathematics; Algorithm; Automaton; Data structure; Theoretical computer science; Automata theory","score_opus":0.026532722682505405,"score_gpt":0.25770493954687707,"score_spread":0.23117221686437167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285153081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.396719,0.0009284981,0.50445044,0.0051800036,0.00020292102,0.00020910062,0.0015388426,0.0012536792,0.089517444],"genre_scores_gemma":[0.9650695,0.00039737023,0.023380117,0.00024304425,0.00014757106,0.00021784207,0.00054935913,0.00024775424,0.009747329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705815,0.0007608905,0.00015486966,0.0004299958,0.0011158041,0.00048024472],"domain_scores_gemma":[0.9712545,0.025062175,0.0006848826,0.0017703449,0.0007610452,0.00046706942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023220887,0.00064086163,0.0015681867,0.0009351675,0.0012888863,0.0042724945,0.0028031054,0.0016815381,0.008511025],"category_scores_gemma":[0.015268331,0.0007853946,0.0016971817,0.0014262905,0.0033649749,0.0072934953,0.0025482324,0.00493369,0.0007185668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002404375,0.00008433753,0.00065333385,0.00011656329,0.000027471433,0.00012835958,0.00029950935,0.076303564,0.0022724676,0.9020347,0.002291853,0.015547465],"study_design_scores_gemma":[0.000023182325,0.00001427568,0.00020857746,0.000008561328,0.000014333959,0.00004181762,0.00002814075,0.12395714,0.0013165465,0.873723,0.0006487358,0.000015721827],"about_ca_topic_score_codex":0.002011616,"about_ca_topic_score_gemma":0.0015133439,"teacher_disagreement_score":0.008511025,"about_ca_system_score_codex":0.0032419087,"about_ca_system_score_gemma":0.0021789758,"threshold_uncertainty_score":0.028472245},"labels":[],"label_agreement":null},{"id":"W4285156117","doi":"10.1007/978-3-031-05544-7_37","title":"Online Shopping During COVID-19: A Comparison of USA and Canada","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Consumer Retail Behavior Studies","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":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Continuance; Coronavirus disease 2019 (COVID-19); Pandemic; Perception; Advertising; Marketing; Business; Brick and mortar; Risk perception; Psychology; Computer science; Social psychology; Medicine; The Internet; World Wide Web","score_opus":0.038641877581772524,"score_gpt":0.27752351998908503,"score_spread":0.23888164240731252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285156117","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.94514465,0.0023098015,0.00011713995,0.0015302049,0.00006963458,0.00008658918,0.017074512,0.000051606778,0.033615895],"genre_scores_gemma":[0.9665991,0.0017766687,0.00021562874,0.00053966936,0.000017622238,0.000028312752,0.008239965,0.000054818483,0.02252811],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990839,0.00004268423,0.000030877643,0.00009540599,0.0003435895,0.00040351984],"domain_scores_gemma":[0.9959598,0.00023252443,0.000388453,0.000053650267,0.0021152874,0.0012503079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062368694,0.00032308517,0.0005069944,0.0032046714,0.0043030353,0.0045880303,0.0014572123,0.0008668949,0.009383344],"category_scores_gemma":[0.0020280906,0.00033428974,0.0005632049,0.009027959,0.0009902404,0.001152745,0.0017930663,0.0012404061,0.0011670775],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080929033,0.00038137863,0.8877728,0.0002602904,0.0001221639,0.0006364615,0.024991823,0.00021950844,0.0004145667,0.0028535298,0.030595591,0.050942514],"study_design_scores_gemma":[0.0000070693004,0.000029797571,0.96187943,0.00009351437,0.000022366483,0.00005447107,0.026090035,0.000098962264,0.00008453743,0.000041825646,0.01157602,0.000021991978],"about_ca_topic_score_codex":0.99534494,"about_ca_topic_score_gemma":0.9987796,"teacher_disagreement_score":0.029940119,"about_ca_system_score_codex":0.029940119,"about_ca_system_score_gemma":0.03509968,"threshold_uncertainty_score":0.21723181},"labels":[],"label_agreement":null},{"id":"W4285159045","doi":"10.1007/978-3-031-09593-1_14","title":"Tree-Based Models for Pain Detection from Biomedical Signals","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"AdaBoost; Boosting (machine learning); Computer science; Artificial intelligence; Random forest; Pattern recognition (psychology); Gradient boosting; Decision tree; Tree (set theory); Machine learning; Support vector machine; Mathematics","score_opus":0.037410187868179144,"score_gpt":0.2628585907486344,"score_spread":0.22544840288045523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285159045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06587215,0.0015578989,0.9278033,0.0004469118,0.00012904164,0.00006735545,0.00034538537,0.00061856577,0.003159367],"genre_scores_gemma":[0.8793356,0.0012348886,0.11105388,0.00018812597,0.00013343895,0.00025089647,0.00073671294,0.00007073614,0.0069958596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997241,0.00011184701,0.00001366069,0.000053532083,0.00006524177,0.00003158541],"domain_scores_gemma":[0.9992142,0.0005116866,0.00006551193,0.000025833897,0.00016076061,0.000022010272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354706,0.00058058783,0.00074420444,0.00068324973,0.00022960542,0.00085096003,0.0009768979,0.00093135773,0.002415382],"category_scores_gemma":[0.00231305,0.00033379803,0.00063864246,0.0006659825,0.00029841444,0.00083600066,0.00040077054,0.00087880786,0.0007813731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079585196,0.00004591101,0.0011177482,0.0000618687,0.00004574039,0.000033630557,0.000028232347,0.94325733,0.0010008273,0.0050726323,0.0011190741,0.04813747],"study_design_scores_gemma":[9.78071e-7,0.0000040246223,0.000073573734,0.0000023192758,0.0000019819718,0.000002177302,7.69593e-7,0.9987239,0.00003629318,0.0010779877,0.000074833275,0.0000011413921],"about_ca_topic_score_codex":0.0050135422,"about_ca_topic_score_gemma":0.004304864,"teacher_disagreement_score":0.0050135422,"about_ca_system_score_codex":0.00061210117,"about_ca_system_score_gemma":0.0004300626,"threshold_uncertainty_score":0.009968758},"labels":[],"label_agreement":null},{"id":"W4285161621","doi":"10.1007/978-3-031-05412-9_1","title":"A Study on How Users Choose Apps","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Dalhousie University","funders":"","keywords":"Computer science; Download; App store; Process (computing); World Wide Web; Mobile apps; Smartphone app; Human–computer interaction; Information retrieval","score_opus":0.02299183009925696,"score_gpt":0.2679248927683065,"score_spread":0.24493306266904954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285161621","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.98291713,0.0003013333,0.00061233965,0.00027810546,0.000019000674,0.000033329256,0.00015854635,0.00003029814,0.015649904],"genre_scores_gemma":[0.9746884,0.0003797969,0.0010087027,0.00027585984,0.0000103303555,0.000051967803,0.000338925,0.000039567796,0.02320644],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99936074,0.00027939666,0.000036159556,0.00008427362,0.0001732383,0.00006614624],"domain_scores_gemma":[0.98843443,0.009689244,0.00046902825,0.00033728514,0.0006685463,0.00040139642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007808078,0.0002721157,0.00021284958,0.00086689455,0.0013844314,0.002160523,0.00041418104,0.0008120373,0.008698991],"category_scores_gemma":[0.009366645,0.0002551302,0.00027333337,0.0009804481,0.0005867039,0.0029787987,0.0007153085,0.0010841917,0.00213796],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011518991,0.00406967,0.48033518,0.0006168439,0.00008793458,0.0018645931,0.20903388,0.00042414476,0.012162954,0.010738801,0.018218452,0.26129577],"study_design_scores_gemma":[0.00008365901,0.003323826,0.5504275,0.0004322689,0.0001748699,0.0034299016,0.33242726,0.0067409296,0.010063784,0.006167035,0.08650604,0.00022294308],"about_ca_topic_score_codex":0.0040412163,"about_ca_topic_score_gemma":0.0061618043,"teacher_disagreement_score":0.008698991,"about_ca_system_score_codex":0.0004586015,"about_ca_system_score_gemma":0.0004141692,"threshold_uncertainty_score":0.029101074},"labels":[],"label_agreement":null},{"id":"W4285162239","doi":"10.1007/978-3-031-06516-3","title":"The Transdisciplinary Reach of Design Science Research","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Design Education and Practice","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":"Polytechnique Montréal; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; HEC Montréal","funders":"","keywords":"Engineering ethics; Sociology; Architectural engineering; Engineering","score_opus":0.07347725977051314,"score_gpt":0.3557764399983415,"score_spread":0.2822991802278284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285162239","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.0057046167,0.06941628,0.065985575,0.07267361,0.0030889437,0.00006565018,0.000076560355,0.0002288357,0.78276],"genre_scores_gemma":[0.4972053,0.0753781,0.08547153,0.034709815,0.008577706,0.0007391878,0.00025949106,0.0009893784,0.29666945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886662,0.006487099,0.00033486067,0.0007863055,0.0032228844,0.00050281436],"domain_scores_gemma":[0.9748064,0.018825436,0.00036299496,0.0026741845,0.0017235538,0.0016073508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013205462,0.00082319387,0.001191343,0.0042446516,0.0038890496,0.017623944,0.0012970917,0.004849474,0.017027607],"category_scores_gemma":[0.016819915,0.00081932487,0.000794236,0.002825633,0.024630412,0.023249324,0.011664852,0.009100956,0.004274438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012696751,0.000015126909,0.0000809629,0.00008731082,0.000007759496,0.00004229281,0.0020954718,0.0001011604,0.00015997667,0.96986187,0.0076761167,0.019859154],"study_design_scores_gemma":[0.000009510274,0.000010541641,0.000104310224,0.00017047845,0.0000033560054,0.000108326116,0.0011860467,0.00022582765,0.00006653424,0.81685776,0.18124965,0.000007759032],"about_ca_topic_score_codex":0.0009179478,"about_ca_topic_score_gemma":0.0015531449,"teacher_disagreement_score":0.017623944,"about_ca_system_score_codex":0.0033227692,"about_ca_system_score_gemma":0.004385063,"threshold_uncertainty_score":0.06983805},"labels":[],"label_agreement":null},{"id":"W4285163403","doi":"10.1007/978-3-031-06220-9_2","title":"Syntenic Dimensions of Genomic Evolution","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Synteny; Evolutionary biology; Computational biology; Biology; Genetics; Genome; Gene","score_opus":0.010081470971726804,"score_gpt":0.2181670916664985,"score_spread":0.2080856206947717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285163403","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.73939186,0.0076082675,0.14473912,0.002113064,0.00007810173,0.000025378444,0.0008238932,0.00020679737,0.10501358],"genre_scores_gemma":[0.9837832,0.0012189336,0.010501799,0.000085119995,0.000094257986,0.000023769253,0.00031648303,0.00003386214,0.0039426093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993581,0.000236078,0.000028415281,0.00013767576,0.00019093872,0.000048675654],"domain_scores_gemma":[0.99677485,0.0023963386,0.00024624832,0.00025895453,0.00017902751,0.00014462034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007506919,0.00021357209,0.00029459628,0.001990185,0.00058117945,0.0017634856,0.00056981307,0.00042051708,0.0051910873],"category_scores_gemma":[0.0043350365,0.00038172962,0.00024914794,0.0028637813,0.0016848545,0.0033073763,0.0012125757,0.0011264978,0.00027792045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109276,0.000024935818,0.010958448,0.000111688525,0.000057195102,0.0002449998,0.0010698513,0.0060177306,0.010243732,0.8884467,0.0007254371,0.08199015],"study_design_scores_gemma":[0.00000809787,0.000027198252,0.021789793,0.000034327553,0.000029666746,0.00042865254,0.00050711527,0.0072945505,0.0013911581,0.9634218,0.00505112,0.000016544374],"about_ca_topic_score_codex":0.00049367483,"about_ca_topic_score_gemma":0.0007849086,"teacher_disagreement_score":0.0051910873,"about_ca_system_score_codex":0.0005861419,"about_ca_system_score_gemma":0.00024409733,"threshold_uncertainty_score":0.017365932},"labels":[],"label_agreement":null},{"id":"W4285165080","doi":"10.1007/978-3-031-09680-8_17","title":"Evaluating the Effect of Imperfect Data in Voice Emotion Recognition","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Emotion recognition; Emotion classification; Speech recognition; Variety (cybernetics); Training set; Imperfect; Natural language processing","score_opus":0.09025694224502177,"score_gpt":0.377352819835289,"score_spread":0.2870958775902672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285165080","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.806201,0.0033634931,0.183098,0.00070890115,0.00035173766,0.0001927255,0.0009219628,0.0015616639,0.0036005175],"genre_scores_gemma":[0.94054407,0.00030377434,0.056536667,0.00017772529,0.00008915478,0.00005611736,0.00095640635,0.0001958651,0.0011403309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902902,0.0051508253,0.0008209742,0.0013039053,0.0019373512,0.0004967138],"domain_scores_gemma":[0.69756866,0.2865133,0.0029625464,0.007288819,0.0046955566,0.00097112125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01332812,0.0010947228,0.0011832004,0.00062164606,0.00048464787,0.0021506606,0.0015597065,0.0031227386,0.0022523766],"category_scores_gemma":[0.12423512,0.0006089003,0.0005643081,0.00075892924,0.0013624155,0.0036327075,0.0018588373,0.0020053708,0.0005982299],"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.031061333,0.002089401,0.042560853,0.0010970923,0.000778473,0.0006193587,0.00035954828,0.38459823,0.080592915,0.0036870588,0.0031278776,0.44942796],"study_design_scores_gemma":[0.00017271467,0.0023416816,0.014011748,0.000056128745,0.00027388782,0.0002919249,0.0001651214,0.92559385,0.05259897,0.0037081526,0.00070746255,0.00007838723],"about_ca_topic_score_codex":0.0039158817,"about_ca_topic_score_gemma":0.003218821,"teacher_disagreement_score":0.01332812,"about_ca_system_score_codex":0.00094299007,"about_ca_system_score_gemma":0.00075147103,"threshold_uncertainty_score":0.070486665},"labels":[],"label_agreement":null},{"id":"W4285167813","doi":"10.1007/978-3-031-06220-9_16","title":"A Mixed Integer Linear Programming Algorithm for Plasmid Binning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nanoparticles: synthesis and applications","field":"Materials Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Integer programming; Linear programming; Integer (computer science); Computer science; Algorithm; Mathematical optimization; Mathematics; Programming language","score_opus":0.02943505311033339,"score_gpt":0.2632653099853061,"score_spread":0.23383025687497272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285167813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004211514,0.00010676913,0.98936206,0.00012900757,0.00007280251,0.000110110974,0.00012444209,0.0014731492,0.0044102143],"genre_scores_gemma":[0.028909568,0.000059199014,0.96552205,0.000113618604,0.000025744388,0.0003230186,0.0003084218,0.00037560903,0.0043627173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938476,0.00013896744,0.000028332965,0.00018026016,0.00016406113,0.000103643615],"domain_scores_gemma":[0.99901676,0.0006533015,0.000046979017,0.00006504023,0.00016472286,0.000053300293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093538716,0.0014208663,0.0015235359,0.00088248105,0.00096082425,0.0015332053,0.0020942998,0.0017254304,0.019876933],"category_scores_gemma":[0.0024174557,0.0010060626,0.0012946571,0.0014287443,0.00067898654,0.0015679834,0.0019542787,0.0026181343,0.0036558756],"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.00024846126,0.00032830163,0.00036222336,0.00018961352,0.00005330717,0.000075221484,0.00010059107,0.45086336,0.0043692873,0.023694426,0.011046783,0.5086684],"study_design_scores_gemma":[0.000042878855,0.000049235638,0.00004779282,0.000011841642,0.000007671715,0.000016840835,0.000023484583,0.9877325,0.00085211004,0.009014169,0.002191494,0.000009944407],"about_ca_topic_score_codex":0.006116259,"about_ca_topic_score_gemma":0.006990858,"teacher_disagreement_score":0.019876933,"about_ca_system_score_codex":0.0010014876,"about_ca_system_score_gemma":0.001983807,"threshold_uncertainty_score":0.06649494},"labels":[],"label_agreement":null},{"id":"W4285170776","doi":"10.1007/978-3-031-08147-7_12","title":"EXMULF: An Explainable Multimodal Content-Based Fake News Detection System","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","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":"Computer science; Latent Dirichlet allocation; Topic model; Relevance (law); Artificial intelligence; Content (measure theory); Information retrieval; Modalities; Multimodal learning; Natural language processing","score_opus":0.04330071039132526,"score_gpt":0.2792358181569334,"score_spread":0.2359351077656081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285170776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13985573,0.0019514526,0.44332236,0.0008800316,0.0004981671,0.001036499,0.025670126,0.3715568,0.015228773],"genre_scores_gemma":[0.5283215,0.0007186675,0.3959109,0.00090313534,0.0003762897,0.0010201707,0.029722482,0.0039606066,0.039066195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995782,0.000082258484,0.000024072628,0.00012408289,0.00015295066,0.0000383665],"domain_scores_gemma":[0.99874,0.00069492724,0.0001404527,0.000182894,0.00017312227,0.00006854132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006330518,0.0013991345,0.0010062117,0.0018846806,0.00045770558,0.0008738301,0.0013939356,0.0014663733,0.016765002],"category_scores_gemma":[0.0029753482,0.00033040336,0.0004588377,0.00046534435,0.00027414213,0.0019019399,0.0018204214,0.00069619686,0.006315849],"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.0034997477,0.00066117063,0.0062498823,0.00097530254,0.00031247965,0.0015631927,0.0005893281,0.005917323,0.06705717,0.0035774566,0.13647841,0.7731185],"study_design_scores_gemma":[0.0004326424,0.0010141121,0.014914468,0.0001715841,0.00032136418,0.0018620412,0.00045518257,0.779274,0.110444024,0.0118124345,0.07900063,0.00029753943],"about_ca_topic_score_codex":0.00201251,"about_ca_topic_score_gemma":0.0028023364,"teacher_disagreement_score":0.016765002,"about_ca_system_score_codex":0.00044987368,"about_ca_system_score_gemma":0.0003145675,"threshold_uncertainty_score":0.056084514},"labels":[],"label_agreement":null},{"id":"W4285177260","doi":"10.1007/978-3-031-08648-9_39","title":"TBS$$^3$$: Two-Bar Single-Switch Scanning for Target Selection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","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":"York University","funders":"","keywords":"Bar (unit); Task (project management); Selection (genetic algorithm); Intersection (aeronautics); Computer science; Process (computing); Simulation; Artificial intelligence; Engineering; Physics; Operating system","score_opus":0.04328857006973984,"score_gpt":0.28645037363030934,"score_spread":0.2431618035605695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285177260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026827676,0.0026817436,0.8307378,0.0006327943,0.0013892504,0.00015445598,0.0014123194,0.030129636,0.10603427],"genre_scores_gemma":[0.41234326,0.0028033468,0.4360115,0.00070348405,0.00030752234,0.00031308865,0.0020628343,0.0067713787,0.13868365],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998871,0.000008882443,0.000004015672,0.00003183535,0.000044642376,0.000023359686],"domain_scores_gemma":[0.9999112,0.000028087936,0.000005490848,0.00002867149,0.00001319727,0.000013355752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001621571,0.00073279697,0.0006865675,0.00043526696,0.0004193182,0.001014167,0.0022748867,0.0007374693,0.034367472],"category_scores_gemma":[0.00022021549,0.0005161768,0.00041741226,0.0006513499,0.00052985107,0.0010811476,0.0008201747,0.0009630825,0.013100281],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076589227,0.00010977012,0.00021127007,0.00042282874,0.000055299308,0.00016601893,0.000090408,0.0049468074,0.36271065,0.070436426,0.0643616,0.49572307],"study_design_scores_gemma":[0.00011827916,0.00028004084,0.0015721646,0.00009756435,0.00008560097,0.0011602832,0.00009648739,0.22135687,0.44634923,0.122453794,0.20627524,0.00015447637],"about_ca_topic_score_codex":0.0017562581,"about_ca_topic_score_gemma":0.0036336067,"teacher_disagreement_score":0.034367472,"about_ca_system_score_codex":0.0007183234,"about_ca_system_score_gemma":0.00045884663,"threshold_uncertainty_score":0.114970624},"labels":[],"label_agreement":null},{"id":"W4285180287","doi":"10.1007/978-3-031-05061-9_41","title":"Engagement as Leadership-Practice for Today’s Global Wicked Problems: Leadership Learning for Artificial Intelligence","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovation and Socioeconomic Development","field":"Business, Management and Accounting","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":"Royal Roads University","funders":"","keywords":"Computer science; Space (punctuation); Work (physics); Leadership style; Artificial intelligence; Knowledge management; Engineering ethics; Management science; Political science; Public relations; Engineering","score_opus":0.14276746145378694,"score_gpt":0.29999515699555,"score_spread":0.15722769554176308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285180287","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.031773645,0.01733155,0.117994346,0.084252946,0.001691634,0.00009795459,0.00003628889,0.00035189762,0.74646974],"genre_scores_gemma":[0.8587613,0.0076539707,0.046545748,0.0029191268,0.000569749,0.00020906489,0.000091104725,0.00014128149,0.08310872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989416,0.00071393204,0.000017354329,0.00007440101,0.00014991954,0.00010276636],"domain_scores_gemma":[0.99869895,0.0007990409,0.00006677271,0.00009564922,0.00009131266,0.00024821237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002190638,0.00043544188,0.0003215941,0.00042110978,0.0017653779,0.0067487764,0.0010276557,0.0016397708,0.006515918],"category_scores_gemma":[0.002457716,0.0001641446,0.0002629732,0.0008492824,0.0077523855,0.007905548,0.0031412023,0.0037066205,0.0010838541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142883,0.00013489262,0.00049118756,0.00011957538,0.0000083716595,0.000055495086,0.012170134,0.00080702495,0.00022601058,0.85437787,0.02683522,0.104759924],"study_design_scores_gemma":[0.000013672742,0.000043017142,0.00039975904,0.00021469142,0.000004958262,0.000049371443,0.009378508,0.003453543,0.00026521448,0.85836506,0.12780033,0.000011983733],"about_ca_topic_score_codex":0.00073542737,"about_ca_topic_score_gemma":0.0020403874,"teacher_disagreement_score":0.0067487764,"about_ca_system_score_codex":0.001492087,"about_ca_system_score_gemma":0.0027370162,"threshold_uncertainty_score":0.021797895},"labels":[],"label_agreement":null},{"id":"W4285182772","doi":"10.1007/978-3-031-08011-1_21","title":"A MinCumulative Resource Constraint","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Resource (disambiguation); Computer science; Mathematics; Computer network; Geometry","score_opus":0.09723528290310375,"score_gpt":0.353271974118806,"score_spread":0.2560366912157023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285182772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014696037,0.0028076954,0.6850558,0.0033990683,0.0010458345,0.0001485057,0.0009144138,0.00035756966,0.29157504],"genre_scores_gemma":[0.31462574,0.0037414746,0.4375573,0.0017454376,0.00097249914,0.000588295,0.0010438946,0.000605124,0.2391202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991398,0.00025404032,0.000044820004,0.00018978537,0.00025984878,0.00011173186],"domain_scores_gemma":[0.9984664,0.00092512136,0.00009036896,0.00021067413,0.0002233013,0.000084222855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000878789,0.00092918176,0.000695142,0.00069448416,0.0012756378,0.0021986575,0.0018225828,0.00126343,0.02242099],"category_scores_gemma":[0.003806056,0.0006174704,0.0005791738,0.0020877675,0.0011937818,0.0035381736,0.0016319489,0.0026148863,0.0029052193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007693791,0.000038565435,0.000081576865,0.0002234956,0.000012109649,0.00015627375,0.00008568846,0.01916779,0.0028429509,0.8984179,0.018116891,0.060779855],"study_design_scores_gemma":[0.000032834094,0.00007565881,0.00022954216,0.00018159334,0.00002458785,0.00051861093,0.000093488365,0.09470254,0.0057840915,0.6883285,0.2099947,0.00003380623],"about_ca_topic_score_codex":0.0021163095,"about_ca_topic_score_gemma":0.0028077662,"teacher_disagreement_score":0.02242099,"about_ca_system_score_codex":0.0013734906,"about_ca_system_score_gemma":0.0014372577,"threshold_uncertainty_score":0.07500571},"labels":[],"label_agreement":null},{"id":"W4285182866","doi":"10.1007/978-3-031-09342-5_46","title":"Using Visual Analytics to Optimize Blood Product Inventory at a Hospital’s Blood Transfusion Service","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blood donation and transfusion practices","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":"Dalhousie University","funders":"","keywords":"Analytics; Blood management; Service (business); Blood transfusion; Blood product; Operations management; Visual analytics; Medicine; Computer science; Business; Engineering; Database; Surgery; Marketing; Visualization; Data mining","score_opus":0.028711380209415542,"score_gpt":0.25779973063462724,"score_spread":0.2290883504252117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285182866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4417977,0.001993778,0.45631424,0.0028714058,0.0005239644,0.00029738853,0.0031578431,0.026716152,0.06632748],"genre_scores_gemma":[0.81032693,0.0006866099,0.17870596,0.00021335832,0.00008283739,0.000053903885,0.0014604053,0.00075416744,0.0077157733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974674,0.000043818374,0.000014464643,0.00003961289,0.000117341915,0.000038063674],"domain_scores_gemma":[0.9992493,0.00036574932,0.000081533624,0.000044917004,0.0001950237,0.000063506326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048451594,0.0007391551,0.00036560203,0.0010991007,0.00029691547,0.0026571266,0.00062081683,0.00039254758,0.0038141462],"category_scores_gemma":[0.0017399754,0.00031725553,0.00039689476,0.0008604591,0.00014201971,0.0009859825,0.000583663,0.0005042903,0.00075788854],"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.0013962303,0.0005718621,0.0139371995,0.00028626213,0.00011869135,0.0004787236,0.00056750927,0.1420651,0.040004343,0.0056007467,0.035543453,0.7594299],"study_design_scores_gemma":[0.00007358972,0.00026843348,0.0072830105,0.000063639236,0.00008928472,0.00013326341,0.00052165287,0.9514214,0.02087326,0.0072956868,0.011917312,0.000059585564],"about_ca_topic_score_codex":0.0078070406,"about_ca_topic_score_gemma":0.012065932,"teacher_disagreement_score":0.0078070406,"about_ca_system_score_codex":0.00064924447,"about_ca_system_score_gemma":0.000813505,"threshold_uncertainty_score":0.015523195},"labels":[],"label_agreement":null},{"id":"W4285185551","doi":"10.1007/978-3-031-05887-5_15","title":"Adaptive Instructional System for Complex Equipment Trainings in the Post-covid Era: Breaking the Ice of Time-Consuming Tasks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Engineering Education and Technology","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":"Montreal Clinical Research Institute; McGill University","funders":"","keywords":"Computer science; Modular design; Personalization; Training (meteorology); Task (project management); Training system; Multimedia; Set (abstract data type); Engineering management; Human–computer interaction; World Wide Web; Systems engineering","score_opus":0.025062229956822894,"score_gpt":0.2509946706828242,"score_spread":0.22593244072600133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285185551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20002545,0.005032229,0.6564761,0.0017622004,0.001057165,0.0008104374,0.0009357878,0.014258954,0.11964175],"genre_scores_gemma":[0.41153762,0.0033771195,0.4423205,0.00086400023,0.00022125895,0.00085157464,0.0012337915,0.0006149001,0.1389793],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999069,0.000018336465,0.000006358009,0.000021469767,0.00003478993,0.000012207021],"domain_scores_gemma":[0.9998221,0.00007953112,0.000009614995,0.000015483733,0.000040088584,0.000033214103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443895,0.00038142424,0.00017688575,0.00041556687,0.00022858949,0.00048198565,0.0009774761,0.00051608385,0.015178867],"category_scores_gemma":[0.0004985171,0.00009809043,0.00018180998,0.000263,0.000108424014,0.0004227593,0.0005859458,0.0005935899,0.0022169636],"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.00024296058,0.0007046246,0.0011181987,0.00029031278,0.000014974501,0.00013315618,0.00040705415,0.0029426157,0.033064723,0.0037489021,0.020004911,0.9373276],"study_design_scores_gemma":[0.0007058099,0.0050105364,0.06836632,0.0013415574,0.00042040335,0.0038627808,0.0019651805,0.18746187,0.08980378,0.01843197,0.62242,0.00020965423],"about_ca_topic_score_codex":0.0011599648,"about_ca_topic_score_gemma":0.0021932537,"teacher_disagreement_score":0.015178867,"about_ca_system_score_codex":0.00028251822,"about_ca_system_score_gemma":0.0006894299,"threshold_uncertainty_score":0.05077833},"labels":[],"label_agreement":null},{"id":"W4285186651","doi":"10.1007/978-3-031-09342-5_22","title":"Wrist Ultrasound Segmentation by Deep Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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","funders":"","keywords":"Deep learning; Artificial intelligence; Computer science; Segmentation; Wrist; Medical imaging; Computer vision; Medicine; Radiology","score_opus":0.05180124473039738,"score_gpt":0.3529140157499653,"score_spread":0.3011127710195679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285186651","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.0057641957,0.0009721058,0.9870575,0.00017791701,0.000082674815,0.000031369826,0.0002113859,0.002361523,0.0033413714],"genre_scores_gemma":[0.19307643,0.0023836896,0.77341896,0.0005574102,0.0002360724,0.0001162169,0.001329552,0.0010594514,0.027822176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998118,0.000021612217,0.000012680836,0.000056077824,0.00006248152,0.0000353894],"domain_scores_gemma":[0.9997365,0.00010176845,0.000023769562,0.00004795438,0.00006848863,0.000021544902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043179572,0.00076663936,0.0008947026,0.0011409671,0.00020748645,0.0012506351,0.00084152905,0.0012286158,0.006381073],"category_scores_gemma":[0.0007667877,0.0007697806,0.000993352,0.00085640606,0.0003284834,0.0007220729,0.0009988896,0.0009903985,0.0046756826],"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.00017476764,0.00005523249,0.0006754309,0.00014764722,0.000053883203,0.000115566916,0.00004745368,0.04891207,0.03227943,0.0025059357,0.009627704,0.90540487],"study_design_scores_gemma":[0.000010878352,0.00005303903,0.00087965967,0.00008414341,0.000044629025,0.00042814558,0.000019819126,0.9623219,0.02258928,0.005776896,0.0077658608,0.000025808986],"about_ca_topic_score_codex":0.0032410794,"about_ca_topic_score_gemma":0.0052473773,"teacher_disagreement_score":0.006381073,"about_ca_system_score_codex":0.00046421593,"about_ca_system_score_gemma":0.0007096122,"threshold_uncertainty_score":0.021346807},"labels":[],"label_agreement":null},{"id":"W4285187747","doi":"10.1007/978-3-031-08147-7","title":"Foundations and Practice of Security","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; Software engineering; Computer security","score_opus":0.020854487010211385,"score_gpt":0.3189670073719898,"score_spread":0.29811252036177843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285187747","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006064727,0.026235512,0.13610287,0.056414414,0.0017314233,0.00010677457,0.00018357989,0.00016926856,0.7729914],"genre_scores_gemma":[0.7988279,0.01749282,0.072857425,0.0051891166,0.0023327009,0.00068809657,0.0002077482,0.00021001016,0.10219432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951727,0.0027430898,0.0002022914,0.00060228957,0.0009237956,0.00035585955],"domain_scores_gemma":[0.99430084,0.0033362838,0.0003054876,0.001199824,0.0005688583,0.00028880674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055377847,0.00079834415,0.0007536196,0.0017665909,0.0033114671,0.009088687,0.0018319093,0.0043106605,0.016102163],"category_scores_gemma":[0.008691781,0.00060937897,0.0005932932,0.0020735245,0.034040354,0.009731462,0.0035787718,0.0051544732,0.0027932583],"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.0000011519604,0.000003542523,0.00002457397,0.000011526094,9.708781e-7,0.0000042044876,0.00027555594,0.00009544888,0.000009589097,0.995886,0.0017627819,0.0019246099],"study_design_scores_gemma":[0.000003085951,0.000002923534,0.000039552946,0.000046029567,0.0000013147288,0.000015718078,0.00026702302,0.00024869444,0.000021645423,0.9577847,0.041567087,0.0000020852353],"about_ca_topic_score_codex":0.0039764396,"about_ca_topic_score_gemma":0.0027244436,"teacher_disagreement_score":0.016102163,"about_ca_system_score_codex":0.004749796,"about_ca_system_score_gemma":0.005578116,"threshold_uncertainty_score":0.0538671},"labels":[],"label_agreement":null},{"id":"W4285190221","doi":"10.1007/978-3-031-06901-7_19","title":"Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Rounding; Combinatorics; Approximation algorithm; Mathematics; Bounded function; Alpha (finance); Running time; Routing (electronic design automation); Algorithm; Computer science; Mathematical analysis; Statistics","score_opus":0.018654160847531697,"score_gpt":0.23936847856681842,"score_spread":0.22071431771928673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285190221","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.019448582,0.0011635924,0.9620398,0.000690637,0.00026228325,0.000096999654,0.00046064818,0.0005611846,0.015276243],"genre_scores_gemma":[0.4490223,0.0018952945,0.5111921,0.0004887325,0.00040612568,0.0005241049,0.0014996545,0.0010470704,0.03392474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823976,0.00069701514,0.000052500487,0.00021121367,0.0004976938,0.00030183836],"domain_scores_gemma":[0.9923814,0.005545512,0.0002689806,0.0006662548,0.0008620399,0.00027569744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029915217,0.0018570104,0.0022750609,0.0012281927,0.00090657437,0.0028014425,0.005380552,0.0020067405,0.009738219],"category_scores_gemma":[0.01590343,0.001400405,0.0016984515,0.0027728858,0.0014455334,0.003679215,0.0022676124,0.005039715,0.001593105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014857798,0.00005736096,0.00019405241,0.000088623136,0.000023521367,0.00004101284,0.00006439796,0.9415883,0.00029031374,0.039615232,0.00413818,0.013750565],"study_design_scores_gemma":[0.0000042624706,0.000005850214,0.000019525449,0.000006610128,0.000003707242,0.0000049308205,0.000007843772,0.98805946,0.00004763915,0.011482307,0.00035504738,0.0000028090847],"about_ca_topic_score_codex":0.021305267,"about_ca_topic_score_gemma":0.023094025,"teacher_disagreement_score":0.021305267,"about_ca_system_score_codex":0.0055140518,"about_ca_system_score_gemma":0.0032291338,"threshold_uncertainty_score":0.04236251},"labels":[],"label_agreement":null},{"id":"W4285191474","doi":"10.1007/978-3-031-09342-5_21","title":"Predicting Waiting Time and Quality of Kidney Offers for Kidney Transplant Candidates","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal Transplantation Outcomes and Treatments","field":"Medicine","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":"Centre Hospitalier de l’Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Kidney transplant; Waiting list; Computer science; Kidney transplantation; Quality (philosophy); Medicine; Process (computing); Transplantation; Intensive care medicine; Renal transplant; Surgery","score_opus":0.027901794844263406,"score_gpt":0.290000385589366,"score_spread":0.2620985907451026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285191474","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.9402261,0.004338283,0.01993189,0.0039021804,0.0004764767,0.00003475324,0.0059841704,0.00026452454,0.024841538],"genre_scores_gemma":[0.9664915,0.0016198292,0.010697391,0.00020453305,0.00029564058,0.00002422735,0.0034276631,0.000050728424,0.017188426],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986994,0.000039737643,0.000009887332,0.00002216818,0.000035380963,0.000022787766],"domain_scores_gemma":[0.9973628,0.0021920917,0.0001665963,0.000041748935,0.0000800786,0.00015662338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322571,0.00024898504,0.00020355775,0.0005991571,0.00010024154,0.0005950516,0.0003045015,0.0003466688,0.009831244],"category_scores_gemma":[0.0033706005,0.00014361109,0.00042203953,0.0005695848,0.00008690212,0.0004299296,0.00019120127,0.0005976842,0.0011135166],"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.00034198613,0.00025146737,0.8242292,0.000048058926,0.00012114665,0.00012970726,0.00007985929,0.011128669,0.00039553258,0.0016837403,0.014003531,0.14758717],"study_design_scores_gemma":[0.000052742005,0.0007403291,0.7957331,0.00014823918,0.00020639702,0.00083735574,0.00078627263,0.17634459,0.0012152981,0.015771892,0.008094728,0.00006901392],"about_ca_topic_score_codex":0.0035009088,"about_ca_topic_score_gemma":0.007479455,"teacher_disagreement_score":0.009831244,"about_ca_system_score_codex":0.00028997916,"about_ca_system_score_gemma":0.00035021984,"threshold_uncertainty_score":0.03288883},"labels":[],"label_agreement":null},{"id":"W4285192846","doi":"10.1007/978-3-031-06427-2_23","title":"Landmark-Guided Conditional GANs for Face Aging","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Guelph; Memorial University of Newfoundland","funders":"","keywords":"Discriminative model; Computer science; Landmark; Consistency (knowledge bases); Artificial intelligence; Task (project management); Identity (music); Face (sociological concept); Generative grammar; Computer vision; Scope (computer science); Aesthetics; Art","score_opus":0.024058852724427558,"score_gpt":0.25670236338904157,"score_spread":0.232643510664614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285192846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049945563,0.000679614,0.990449,0.00012490666,0.00009987207,0.000018321076,0.00013676316,0.0009949808,0.0025020328],"genre_scores_gemma":[0.5989582,0.0019096003,0.36279917,0.0005543719,0.0003074034,0.00016561721,0.0012817847,0.0010304789,0.03299349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.000051863175,0.0000054232096,0.000061217725,0.000045417895,0.00003060651],"domain_scores_gemma":[0.9996025,0.00021799034,0.00002588624,0.000073545954,0.000057771107,0.000022280205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006327448,0.00080621993,0.00077645876,0.00034585112,0.00019178135,0.00046215268,0.0013118039,0.0009111137,0.0057350984],"category_scores_gemma":[0.0015507886,0.00046229982,0.0006382838,0.0003622254,0.00045361338,0.0008011547,0.0012291132,0.0018364874,0.0020039235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018202806,0.00006264858,0.0003351145,0.000093121154,0.00006349245,0.000079823585,0.000052715157,0.65578,0.013095197,0.03081434,0.013655471,0.28578612],"study_design_scores_gemma":[0.0000022925392,0.000012946185,0.000061533625,0.0000048313937,0.000005641457,0.000032607753,0.0000023952034,0.99020725,0.0012758067,0.007404231,0.000986141,0.0000043849095],"about_ca_topic_score_codex":0.0022421116,"about_ca_topic_score_gemma":0.0035833165,"teacher_disagreement_score":0.0057350984,"about_ca_system_score_codex":0.00052603567,"about_ca_system_score_gemma":0.000417035,"threshold_uncertainty_score":0.019185841},"labels":[],"label_agreement":null},{"id":"W4285196323","doi":"10.1007/978-3-031-06086-1_31","title":"Degrading Human Factors Through the Invisible ‘Freaky 13th’ Element","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Occupational Health and Safety Research","field":"Health Professions","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aviation; Element (criminal law); Safety culture; Civil aviation; Psychosocial; Affect (linguistics); Aircraft maintenance; Business; Public relations; Psychology; Applied psychology; Engineering; Aeronautics; Management; Political science; Law","score_opus":0.13507900625121805,"score_gpt":0.4498852949621769,"score_spread":0.31480628871095884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285196323","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010920957,0.020917675,0.08031177,0.038661405,0.004503842,0.000055939316,0.000070137794,0.00041101992,0.84414726],"genre_scores_gemma":[0.5342315,0.021185303,0.054142363,0.020182058,0.0032902216,0.00026643486,0.000096822354,0.0009116353,0.3656937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99608505,0.0015387748,0.00012828474,0.00033529208,0.001457816,0.00045485186],"domain_scores_gemma":[0.9951696,0.0023796125,0.00021660801,0.0012907399,0.00069883926,0.00024459427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046199453,0.0012827939,0.0005976386,0.0012758978,0.0040336177,0.009145445,0.0013533784,0.0034168328,0.016683625],"category_scores_gemma":[0.006396377,0.00061656657,0.00072218536,0.00063367595,0.033526525,0.012151359,0.007445634,0.00919379,0.0037704525],"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.00003918758,0.00003200185,0.00021290472,0.00018700807,0.00001756134,0.00012223992,0.00864769,0.0005400576,0.0014828636,0.87760514,0.027052453,0.08406089],"study_design_scores_gemma":[0.000009391902,0.000070158494,0.00044088534,0.0007407299,0.000015916914,0.0004887371,0.0027160537,0.00058362435,0.0014253958,0.46122682,0.5322292,0.000053118856],"about_ca_topic_score_codex":0.0042687044,"about_ca_topic_score_gemma":0.0065946,"teacher_disagreement_score":0.016683625,"about_ca_system_score_codex":0.0026384462,"about_ca_system_score_gemma":0.0038346467,"threshold_uncertainty_score":0.05581236},"labels":[],"label_agreement":null},{"id":"W4285198837","doi":"10.1007/978-3-031-08147-7_22","title":"$$\\mathbb {K}$$-Smali: An Executable Semantics for Program Verification of Reversed Android Applications","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université Laval","funders":"","keywords":"Executable; Computer science; Programming language; Android (operating system); Semantics (computer science); Android application; Operating system; Software engineering","score_opus":0.02007427276300648,"score_gpt":0.28779799827550034,"score_spread":0.26772372551249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285198837","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.0047800946,0.00019459058,0.9609555,0.00030011518,0.0001593222,0.0000860769,0.00053423736,0.020123346,0.012866602],"genre_scores_gemma":[0.34884554,0.0006842093,0.5911826,0.00083654624,0.00024652804,0.00037932556,0.0026857774,0.017007502,0.038132012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.00022410357,0.000118390635,0.00026686664,0.00042052497,0.00016889597],"domain_scores_gemma":[0.99888366,0.0004554391,0.0000730605,0.0002861272,0.00026312508,0.000038499446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009937794,0.0015818103,0.00069701474,0.001343669,0.0008818493,0.0029064892,0.0020779436,0.00119989,0.015697652],"category_scores_gemma":[0.002783195,0.0009525316,0.0015778465,0.0006322833,0.0023109787,0.00515208,0.0027601374,0.0027104574,0.008954235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035437377,0.00013768376,0.0007423102,0.0008223955,0.000055925662,0.00033100054,0.00081768254,0.008921257,0.027197285,0.71723133,0.031487986,0.21190083],"study_design_scores_gemma":[0.00008509804,0.00016772539,0.0005729352,0.0003708089,0.00013584798,0.00064939185,0.00021319225,0.13486035,0.0887977,0.59766144,0.17633845,0.00014708083],"about_ca_topic_score_codex":0.0019557544,"about_ca_topic_score_gemma":0.0029153852,"teacher_disagreement_score":0.015697652,"about_ca_system_score_codex":0.0010254772,"about_ca_system_score_gemma":0.001346184,"threshold_uncertainty_score":0.052513897},"labels":[],"label_agreement":null},{"id":"W4285213303","doi":"10.1007/978-3-031-09593-1_1","title":"Self-healing Approach for IoT Architecture: AMI Platform","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Architecture; Autonomy; Internet of Things; Self-healing; Computer security; Point (geometry); Embedded system; Distributed computing; Human–computer interaction","score_opus":0.024515855133762417,"score_gpt":0.2417942774539804,"score_spread":0.217278422320218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285213303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11640361,0.0034987384,0.7131453,0.002473343,0.0007405145,0.00046965352,0.00014464132,0.0052300757,0.15789409],"genre_scores_gemma":[0.7221064,0.0013763699,0.22014473,0.00044679304,0.00017477413,0.00028782742,0.00026415815,0.0001392653,0.055059742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989724,0.000016536555,0.0000065879954,0.000014159433,0.000046404683,0.000019181038],"domain_scores_gemma":[0.99992406,0.000011800666,0.0000060706743,0.000011319211,0.000026491402,0.000020272379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017761976,0.00018207975,0.00012024651,0.00022531235,0.00039581262,0.0008521723,0.00070801197,0.0005466606,0.004775884],"category_scores_gemma":[0.00018747932,0.00009518681,0.00022712152,0.000166108,0.00020800524,0.0007014527,0.00067480025,0.0006378584,0.0010169878],"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.0002454759,0.00037547483,0.0015246373,0.0005220076,0.00006767206,0.0023131685,0.0014141152,0.032545555,0.21899408,0.3546522,0.033873685,0.35347208],"study_design_scores_gemma":[0.00007727041,0.0006037255,0.002806164,0.0001669103,0.000094058116,0.0018919745,0.00068251113,0.49776283,0.06791919,0.09458472,0.33332908,0.00008166481],"about_ca_topic_score_codex":0.00042856086,"about_ca_topic_score_gemma":0.00064181327,"teacher_disagreement_score":0.004775884,"about_ca_system_score_codex":0.00029241643,"about_ca_system_score_gemma":0.0002443905,"threshold_uncertainty_score":0.015976906},"labels":[],"label_agreement":null},{"id":"W4285216656","doi":"10.1007/978-3-031-09234-3_14","title":"Improving the Privacy of Tor Onion Services","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Computer security; Service (business); Context (archaeology); Metadata; Implementation; Private information retrieval; World Wide Web; Order (exchange)","score_opus":0.01066949736767707,"score_gpt":0.2235128092343473,"score_spread":0.21284331186667022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285216656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18473007,0.0029820467,0.699131,0.006400225,0.0006618686,0.00022282523,0.0006492031,0.0033577313,0.10186501],"genre_scores_gemma":[0.947192,0.0007565169,0.034850013,0.00040077203,0.00021511767,0.00003703523,0.00020354193,0.00025988164,0.016085163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927994,0.0023992758,0.00020336095,0.00068036426,0.002364329,0.001553266],"domain_scores_gemma":[0.9906837,0.0035597156,0.00034411953,0.004379116,0.0008178511,0.00021547743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033699453,0.0008143717,0.0011978482,0.00085603405,0.0017172244,0.0045545804,0.0019184886,0.0017222713,0.0075815525],"category_scores_gemma":[0.015091611,0.0005101871,0.0007350207,0.0013576936,0.0020868191,0.008644194,0.0045089386,0.003916527,0.0014808296],"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.0017396667,0.00024546863,0.0027130705,0.00018820592,0.00010463724,0.00029106453,0.0007585813,0.09994671,0.012134765,0.55939215,0.022202656,0.30028298],"study_design_scores_gemma":[0.00006558524,0.00013846856,0.0006743571,0.000049178638,0.000079417805,0.0003486322,0.00032557544,0.64268655,0.019739764,0.31635955,0.019493822,0.0000391723],"about_ca_topic_score_codex":0.0029420939,"about_ca_topic_score_gemma":0.0023579248,"teacher_disagreement_score":0.0075815525,"about_ca_system_score_codex":0.0023771918,"about_ca_system_score_gemma":0.002410457,"threshold_uncertainty_score":0.02536285},"labels":[],"label_agreement":null},{"id":"W4285217173","doi":"10.1007/978-3-031-09680-8_18","title":"Application of 3D Human Pose Estimation for Behavioral Reproduction","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Reproduction; Human reproduction; Pose; Estimation; Computer science; Artificial intelligence; Computer vision; Psychology; Biology; Engineering; Ecology; Anatomy; Systems engineering","score_opus":0.030134052076133063,"score_gpt":0.2996254146294636,"score_spread":0.26949136255333056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285217173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01113807,0.00037025052,0.977993,0.00006566472,0.00011244718,0.00008351983,0.00043088416,0.0029775968,0.0068285847],"genre_scores_gemma":[0.26534158,0.0010461425,0.7171828,0.00014951249,0.000088964865,0.00013769032,0.0011494989,0.0006863143,0.014217473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971455,0.000056429537,0.000011786306,0.0000678587,0.0001288164,0.00002052853],"domain_scores_gemma":[0.9995702,0.00016664084,0.000017055965,0.0001182285,0.00010864063,0.000019238416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035409626,0.0007400012,0.0004521615,0.00082931895,0.00015369702,0.0006358975,0.0006297373,0.0006151704,0.013727439],"category_scores_gemma":[0.0010799067,0.00038765476,0.0005415915,0.0007920631,0.00021204118,0.00034056892,0.00070797995,0.00030485413,0.004029643],"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.0001556482,0.00006274151,0.0009318874,0.00016717034,0.0000431973,0.00015618111,0.00011096624,0.015425269,0.22558519,0.0013903872,0.0035798266,0.7523915],"study_design_scores_gemma":[0.000045871722,0.00036727608,0.012467835,0.00008696568,0.000111216475,0.0020631254,0.00017421681,0.6863962,0.25540647,0.00370703,0.03906995,0.00010394233],"about_ca_topic_score_codex":0.0018625249,"about_ca_topic_score_gemma":0.0020688835,"teacher_disagreement_score":0.013727439,"about_ca_system_score_codex":0.000162054,"about_ca_system_score_gemma":0.00028241912,"threshold_uncertainty_score":0.045922816},"labels":[],"label_agreement":null},{"id":"W4285218816","doi":"10.1007/978-3-031-09342-5_9","title":"Extracting Surrogate Decision Trees from Black-Box Models to Explain the Temporal Importance of Clinical Features in Predicting Kidney Graft Survival","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Black box; Decision tree; Artificial intelligence; Transparency (behavior); Machine learning; Kidney transplant; Kidney transplantation; Transplantation; Medicine; Internal medicine","score_opus":0.06477605988601004,"score_gpt":0.3294905642090311,"score_spread":0.26471450432302107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285218816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079536416,0.001406293,0.9156285,0.000616334,0.000110101544,0.00004379069,0.0007045588,0.0005719071,0.001382193],"genre_scores_gemma":[0.7793709,0.0008879612,0.21439818,0.00019060954,0.00014053607,0.000108152715,0.0023107335,0.00014797774,0.002444975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995646,0.00020312352,0.00003551787,0.00007627221,0.00007542115,0.000045036366],"domain_scores_gemma":[0.9946702,0.0045591635,0.00024701405,0.00016385189,0.00027374813,0.0000859824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023802277,0.00071893935,0.0009211536,0.00084226264,0.00025334253,0.0010252027,0.00076915586,0.0010781797,0.00135954],"category_scores_gemma":[0.0068078125,0.00058515137,0.0011012685,0.00082254934,0.00027878693,0.0010450952,0.00052128336,0.0015330762,0.0006571593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030732263,0.00014886713,0.00655306,0.00013524678,0.00014180123,0.00027882098,0.00013705576,0.8399316,0.0032699462,0.011085516,0.0035075685,0.13450325],"study_design_scores_gemma":[0.0000037623206,0.000016528546,0.00028933558,0.000010326189,0.000008580795,0.000018763263,0.0000037636485,0.9918927,0.00017266623,0.0073936344,0.00018628642,0.0000036589468],"about_ca_topic_score_codex":0.0016160251,"about_ca_topic_score_gemma":0.0023808798,"teacher_disagreement_score":0.0023802277,"about_ca_system_score_codex":0.0004918911,"about_ca_system_score_gemma":0.00056087406,"threshold_uncertainty_score":0.012587965},"labels":[],"label_agreement":null},{"id":"W4285223750","doi":"10.1007/978-3-031-06794-5_31","title":"A Multi-task Learning Framework for Semantic Segmentation in MLS Point Clouds","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Point cloud; Segmentation; Artificial intelligence; Correctness; Task (project management); Annotation; Artificial neural network; Point (geometry); Machine learning; Pattern recognition (psychology); Computer vision; Algorithm","score_opus":0.015538000104700758,"score_gpt":0.26309051599446337,"score_spread":0.24755251588976263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285223750","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.0020112938,0.00018723181,0.9955622,0.00007495614,0.000033947446,0.00003667333,0.00011756659,0.0016363091,0.0003397475],"genre_scores_gemma":[0.10200615,0.00037844514,0.8904563,0.00023311013,0.00018348485,0.00025336078,0.0016696809,0.00069421384,0.0041252156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883395,0.00022579478,0.00007717793,0.00036736822,0.00032284716,0.00017293161],"domain_scores_gemma":[0.99909294,0.0003065468,0.000060392424,0.00016555234,0.0002979533,0.00007662962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087248,0.0013447489,0.0022522684,0.0016992415,0.001146183,0.002423557,0.004041746,0.0029855245,0.0055887857],"category_scores_gemma":[0.002675435,0.0012412239,0.002559518,0.0026787235,0.0009594456,0.0027076271,0.0032119192,0.0030689745,0.0029420855],"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.00031680724,0.00024488507,0.00050256046,0.00014294207,0.00015981995,0.00009819711,0.000096783835,0.3254328,0.011231702,0.012103391,0.008527695,0.6411424],"study_design_scores_gemma":[0.000007243948,0.000020117262,0.00010482919,0.0000066741,0.000008834337,0.000019587444,0.000009260257,0.9920195,0.0013709626,0.00545355,0.0009714534,0.000008131513],"about_ca_topic_score_codex":0.021733046,"about_ca_topic_score_gemma":0.023736944,"teacher_disagreement_score":0.021733046,"about_ca_system_score_codex":0.0013240782,"about_ca_system_score_gemma":0.001969503,"threshold_uncertainty_score":0.04321307},"labels":[],"label_agreement":null},{"id":"W4285232850","doi":"10.1007/978-3-031-10419-0_8","title":"Service Function Chaining Design &amp; Implementation Using Network Service Mesh in Kubernetes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Chaining; Computer science; Microservices; Cloud computing; Service (business); Container (type theory); Distributed computing; Node (physics); Function (biology); Computer network; Operating system; Software engineering; Engineering","score_opus":0.05194001181782846,"score_gpt":0.27750535752356087,"score_spread":0.22556534570573242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285232850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27909365,0.00032216078,0.6788857,0.00031972656,0.00024248334,0.0004990385,0.00019850931,0.015215299,0.025223449],"genre_scores_gemma":[0.7311643,0.00017228573,0.25733998,0.000108041335,0.000019864747,0.00021440323,0.00041958585,0.00068445783,0.009877167],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995309,0.00010698036,0.00004583763,0.00006481506,0.00016208009,0.00008937529],"domain_scores_gemma":[0.99944013,0.0001215754,0.00003990269,0.00014970754,0.00016524497,0.00008340286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010533705,0.00029426953,0.00022606873,0.0005301145,0.000501993,0.0012184411,0.0012281674,0.00037223383,0.0032395488],"category_scores_gemma":[0.0011455778,0.00026097152,0.0003108143,0.00039410553,0.0004978765,0.0009493202,0.0010564976,0.0007123876,0.00057657075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015065867,0.0010158884,0.018894497,0.0008515731,0.00013116586,0.0023860668,0.0019101792,0.25994313,0.19763638,0.108414635,0.017005185,0.39030477],"study_design_scores_gemma":[0.000091094465,0.0004338757,0.0028674344,0.000077019155,0.00004597362,0.00040010494,0.00027413736,0.85299134,0.07761224,0.0068824044,0.058244113,0.00008021766],"about_ca_topic_score_codex":0.003315803,"about_ca_topic_score_gemma":0.002487953,"teacher_disagreement_score":0.003315803,"about_ca_system_score_codex":0.0011624298,"about_ca_system_score_gemma":0.0007770579,"threshold_uncertainty_score":0.010837376},"labels":[],"label_agreement":null},{"id":"W4285234761","doi":"10.1007/978-3-031-09680-8_10","title":"Towards Adaptive Coaching in Piloting Tasks: Learning Pilots’ Behavioral Profiles from Flight Data","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université du Québec à Montréal","funders":"","keywords":"Coaching; Psychology; Applied psychology; Aeronautics; Computer science; Human–computer interaction; Cognitive psychology; Engineering; Psychotherapist","score_opus":0.06595846282155617,"score_gpt":0.2901922313604589,"score_spread":0.22423376853890276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285234761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32834557,0.0005493479,0.6586866,0.00070896116,0.000053508455,0.00014017592,0.00044762576,0.0020729909,0.00899532],"genre_scores_gemma":[0.80286366,0.00039660075,0.18972045,0.00009988548,0.000019518515,0.0000898951,0.000981157,0.0001142798,0.0057144645],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997775,0.00007724936,0.000010134003,0.00007690909,0.000038116752,0.000020030204],"domain_scores_gemma":[0.99857295,0.0009896529,0.000096547235,0.00012459527,0.00015231992,0.000063882326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007862823,0.00041053692,0.00024388098,0.00056307524,0.00021557788,0.0009317873,0.00052177033,0.00065147894,0.0014390039],"category_scores_gemma":[0.0039978945,0.0002233252,0.00024214417,0.00074612885,0.00017211965,0.0010095513,0.0007282704,0.00085101405,0.0011210536],"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.000112781694,0.0003717199,0.0253982,0.000097854754,0.000045159657,0.00010159422,0.0018573786,0.013186459,0.013413731,0.0014240466,0.0038475266,0.94014347],"study_design_scores_gemma":[0.000033035532,0.0005176318,0.095616706,0.00021773115,0.00011216853,0.00064850505,0.0023376895,0.8440379,0.025037395,0.017383834,0.013987387,0.000070019516],"about_ca_topic_score_codex":0.0019108488,"about_ca_topic_score_gemma":0.00296428,"teacher_disagreement_score":0.0019108488,"about_ca_system_score_codex":0.0001934469,"about_ca_system_score_gemma":0.00034777788,"threshold_uncertainty_score":0.004813969},"labels":[],"label_agreement":null},{"id":"W4285234937","doi":"10.1007/978-3-031-10363-6_5","title":"A Case Study in the Automated Translation of BSV Hardware to PVS Formal Logic with Subsequent Verification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Translation (biology); Programming language; Chemistry","score_opus":0.050191414335830166,"score_gpt":0.29135527608880873,"score_spread":0.24116386175297858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285234937","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.67562443,0.0006782446,0.23823372,0.0027345333,0.00023123523,0.00056716125,0.0006756239,0.0032785262,0.07797642],"genre_scores_gemma":[0.87714696,0.00021473454,0.10021086,0.00018643866,0.000021231204,0.000090323665,0.00023332184,0.0004054157,0.021490745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822205,0.00068170944,0.00006369267,0.00015123845,0.0007114977,0.00016986643],"domain_scores_gemma":[0.99670535,0.002283501,0.00010520661,0.00048183702,0.00033070034,0.000093482246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014772458,0.0005826481,0.0003699079,0.00059535366,0.001390015,0.0018435154,0.001283028,0.002780453,0.009531584],"category_scores_gemma":[0.005446247,0.00036407725,0.00057732913,0.0008474337,0.0014722042,0.0016021568,0.0011553784,0.0014580354,0.0016989723],"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.0030371104,0.0022567713,0.010768462,0.0017772353,0.0000957286,0.049452595,0.013288095,0.116429955,0.16722308,0.22041164,0.023330314,0.39192906],"study_design_scores_gemma":[0.0006093205,0.0026558372,0.008193262,0.00034556273,0.00014990283,0.01954787,0.008298101,0.3414463,0.37076217,0.07863438,0.16917764,0.00017963361],"about_ca_topic_score_codex":0.0037224654,"about_ca_topic_score_gemma":0.0039637084,"teacher_disagreement_score":0.009531584,"about_ca_system_score_codex":0.0010427133,"about_ca_system_score_gemma":0.0008135166,"threshold_uncertainty_score":0.03188634},"labels":[],"label_agreement":null},{"id":"W4285236424","doi":"10.1007/978-3-031-09342-5_3","title":"A Knowledge Graph Completion Method Applied to Literature-Based Discovery for Predicting Missing Links Targeting Cancer Drug Repurposing","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Dalhousie University","funders":"","keywords":"Repurposing; Computer science; Drug repositioning; Knowledge graph; Knowledge extraction; Graph; Drug discovery; Artificial intelligence; Information retrieval; Theoretical computer science; Drug; Bioinformatics; Medicine","score_opus":0.01953491837939493,"score_gpt":0.30579614245022957,"score_spread":0.28626122407083465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285236424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02202531,0.0006031698,0.9670738,0.00026613873,0.00011095,0.00031303943,0.0029338943,0.004430143,0.0022435954],"genre_scores_gemma":[0.09572325,0.00036659857,0.89365935,0.000087577515,0.00006515288,0.000219423,0.005828446,0.00024650214,0.003803677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.00010776679,0.000058610727,0.00020233385,0.00025392562,0.000043659722],"domain_scores_gemma":[0.99786276,0.0011781114,0.00012668004,0.00023964887,0.00049239065,0.0001004394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010222767,0.0007427931,0.0010130507,0.0051582893,0.0008381882,0.001110332,0.0014800867,0.0010333728,0.0047492976],"category_scores_gemma":[0.0039865826,0.00037402945,0.0014599584,0.004132357,0.0004851362,0.0012894142,0.0012636026,0.0010719019,0.0016905842],"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.00029624568,0.0004680433,0.0034036736,0.00039494698,0.00026232476,0.00043265364,0.00017749426,0.08370095,0.010188109,0.009356873,0.018928863,0.8723899],"study_design_scores_gemma":[0.00003825966,0.00007029851,0.0012136768,0.000037536938,0.00007632273,0.00017809465,0.000070649075,0.9772092,0.002996064,0.012373778,0.0057105385,0.000025640042],"about_ca_topic_score_codex":0.016483806,"about_ca_topic_score_gemma":0.018151797,"teacher_disagreement_score":0.016483806,"about_ca_system_score_codex":0.0005009467,"about_ca_system_score_gemma":0.0022712217,"threshold_uncertainty_score":0.03277576},"labels":[],"label_agreement":null},{"id":"W4285240847","doi":"10.1007/978-3-031-08760-8_45","title":"Digging Deeper into the State of the Practice for Domain Specific Research Software","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"McMaster University","funders":"","keywords":"Computer science; Documentation; Usability; Software; Best practice; Domain (mathematical analysis); Software engineering; Ranking (information retrieval); Data science; World Wide Web; Information retrieval; Human–computer interaction; Programming language","score_opus":0.03214978094487921,"score_gpt":0.31231830375869574,"score_spread":0.28016852281381655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285240847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095214555,0.08823263,0.3628689,0.20623098,0.0024818368,0.00012358377,0.00022824049,0.001466854,0.32884553],"genre_scores_gemma":[0.29800797,0.119994536,0.357737,0.036301512,0.0033652876,0.00040111202,0.00077234494,0.0023853828,0.18103483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9913936,0.004681502,0.00046674904,0.00083926215,0.0021937175,0.00042510167],"domain_scores_gemma":[0.9707818,0.01927893,0.0006103547,0.00652148,0.0020422107,0.00076518406],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012697415,0.00078541925,0.00084109243,0.0034039048,0.0019503587,0.01624431,0.002386031,0.0057440316,0.015024696],"category_scores_gemma":[0.019187136,0.00086486817,0.0008344118,0.004384886,0.01813247,0.036643222,0.005862881,0.011442564,0.0047991346],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009367096,0.000019137617,0.00008042367,0.00019445045,0.0000055582846,0.000021016274,0.0018898898,0.00023826954,0.00031890767,0.92697406,0.009261561,0.06098745],"study_design_scores_gemma":[0.000006814708,0.000023098974,0.00018045816,0.00099948,0.0000065373542,0.00011499195,0.0010656825,0.0014152536,0.00046073875,0.67288345,0.32282525,0.000018145694],"about_ca_topic_score_codex":0.0033093889,"about_ca_topic_score_gemma":0.004507261,"teacher_disagreement_score":0.9873026,"about_ca_system_score_codex":0.004310057,"about_ca_system_score_gemma":0.006513002,"threshold_uncertainty_score":0.06715113},"labels":[],"label_agreement":null},{"id":"W4285241410","doi":"10.1007/978-3-031-07704-3_1","title":"Calculation of DNA Strand Breaks by Types of Electron Interaction with Monte Carlo Simulation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Atomic and Molecular Physics","field":"Physics and Astronomy","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":"Université de Sherbrooke","funders":"","keywords":"DNA; Monte Carlo method; Electron; RADIUS; Atomic physics; van der Waals force; Double strand; Physics; Molecular physics; Chemistry; DNA damage; Quantum mechanics; Molecule; Computer science","score_opus":0.0059500831594961985,"score_gpt":0.23554648491936536,"score_spread":0.22959640175986917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285241410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27319077,0.0014295256,0.67711836,0.00044987918,0.00044767975,0.00023421735,0.00061746227,0.001043957,0.045468148],"genre_scores_gemma":[0.900348,0.0004308776,0.089531794,0.00013619749,0.000075919845,0.00025368427,0.0002673753,0.00037109735,0.008585053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997389,0.000095299794,0.000009634113,0.000023851797,0.000089119116,0.000043186606],"domain_scores_gemma":[0.99871373,0.0008276409,0.0000654431,0.000115871575,0.00019055176,0.00008669314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006060399,0.0005061933,0.0011582721,0.00097281084,0.0008158032,0.00076690206,0.0017168785,0.0013978953,0.0047950237],"category_scores_gemma":[0.0020079566,0.000616881,0.0010262115,0.0011678687,0.0006302287,0.0008535502,0.0006979965,0.0008644991,0.00041655527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118437936,0.000051264684,0.0006318164,0.00008677278,0.000054263848,0.000106249536,0.000029202662,0.9634689,0.0013557891,0.02787172,0.00062647753,0.0055990936],"study_design_scores_gemma":[0.000014442831,0.00001435499,0.00018604298,0.0000061992323,0.000012398281,0.000020225312,0.0000065433496,0.99277264,0.0006893389,0.0059149996,0.00035617908,0.0000066513635],"about_ca_topic_score_codex":0.002968268,"about_ca_topic_score_gemma":0.0024205938,"teacher_disagreement_score":0.0047950237,"about_ca_system_score_codex":0.0008604742,"about_ca_system_score_gemma":0.00066858035,"threshold_uncertainty_score":0.016040921},"labels":[],"label_agreement":null},{"id":"W4285244075","doi":"10.1007/978-3-031-08147-7_16","title":"Cut It: Deauthentication Attacks on Protected Management Frames in WPA2 and WPA3","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bluetooth and Wireless Communication Technologies","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":"Queen's University","funders":"","keywords":"Computer science; Denial-of-service attack; Computer security; Spoofing attack; Authentication (law); Computer network; Frame (networking); Confidentiality; The Internet; Operating system","score_opus":0.019175803546936782,"score_gpt":0.2539012699149245,"score_spread":0.23472546636798772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285244075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18817624,0.0022263909,0.6385026,0.0016602254,0.001244607,0.00036155863,0.00047317593,0.0066009327,0.16075419],"genre_scores_gemma":[0.84750307,0.0008673605,0.07033015,0.0006142658,0.00023127726,0.0001628776,0.0005650507,0.0007809715,0.078945056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937916,0.000098797136,0.000029355722,0.00006518916,0.0002939611,0.00013355541],"domain_scores_gemma":[0.99884665,0.0004278751,0.00008317467,0.0004586592,0.00013148712,0.0000520605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006405318,0.0006274574,0.00041287742,0.00059143495,0.00088454393,0.0014523821,0.0007490559,0.0013699718,0.0062766294],"category_scores_gemma":[0.002058963,0.0003301027,0.0003411895,0.00054494565,0.00075382175,0.0024087434,0.0014569313,0.0018041246,0.0017627119],"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.0013519824,0.00024470163,0.0025344028,0.00027666902,0.00008097923,0.0020004467,0.0013874619,0.018938877,0.10683628,0.2515872,0.049873378,0.5648876],"study_design_scores_gemma":[0.00017066626,0.0007318619,0.0072671357,0.00028763656,0.0002115671,0.00613381,0.00092290784,0.3636652,0.22814268,0.23062462,0.16169587,0.00014614643],"about_ca_topic_score_codex":0.0011762555,"about_ca_topic_score_gemma":0.001113357,"teacher_disagreement_score":0.0062766294,"about_ca_system_score_codex":0.0007059187,"about_ca_system_score_gemma":0.000510597,"threshold_uncertainty_score":0.020997465},"labels":[],"label_agreement":null},{"id":"W4285247392","doi":"10.1007/978-3-031-06791-4_6","title":"Intrusion Detection Model Based on KNN-AE-DNN","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Inflamax Research (Canada)","funders":"","keywords":"Computer science; Intrusion detection system; Data pre-processing; Preprocessor; Artificial neural network; Pattern recognition (psychology); Artificial intelligence; Data mining; Feature (linguistics); Encoder; Dimension (graph theory)","score_opus":0.013578999685457976,"score_gpt":0.22327019233335874,"score_spread":0.20969119264790076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285247392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07953142,0.0026251855,0.89938056,0.0006775029,0.0006072627,0.00026178916,0.0010363678,0.0037223625,0.0121575855],"genre_scores_gemma":[0.78326404,0.0018827344,0.19571964,0.0005421613,0.00025363427,0.0002887198,0.0025210257,0.00012683218,0.015401312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994215,0.0000597896,0.00005632107,0.00023799778,0.0001448639,0.00007954157],"domain_scores_gemma":[0.9995534,0.00012075163,0.000027816583,0.000032198175,0.00024300994,0.000022882388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075098564,0.00084785616,0.0011526577,0.0010722388,0.0005099511,0.00093389244,0.002035407,0.0009151559,0.0020670267],"category_scores_gemma":[0.0010995687,0.0003154733,0.00085143297,0.00076994754,0.0003133379,0.0016321439,0.00063505926,0.001031424,0.0007785603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063362357,0.00029953645,0.0051187943,0.00023560536,0.00020024132,0.0002857333,0.000059734826,0.516648,0.0098818615,0.008292609,0.0070951483,0.45124915],"study_design_scores_gemma":[0.0000054374664,0.000038183567,0.000351607,0.000006146714,0.000031271367,0.000057185895,0.000005723753,0.9958895,0.0015249244,0.0015091606,0.00057315925,0.000007713855],"about_ca_topic_score_codex":0.009823342,"about_ca_topic_score_gemma":0.008760837,"teacher_disagreement_score":0.009823342,"about_ca_system_score_codex":0.0008835812,"about_ca_system_score_gemma":0.00081034447,"threshold_uncertainty_score":0.019532323},"labels":[],"label_agreement":null},{"id":"W4285250766","doi":"10.1007/978-3-031-08757-8_60","title":"Augmenting Graph Inductive Learning Model with Topographical Features","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Embedding; Knowledge graph; Computer science; Graph; Adjacency matrix; Theoretical computer science; Heuristic; Artificial intelligence; Artificial neural network; Machine learning","score_opus":0.012995329388682192,"score_gpt":0.23331388451614446,"score_spread":0.22031855512746226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285250766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020411074,0.0002757876,0.9719282,0.00028351924,0.00008557021,0.000049017894,0.0003726406,0.0021953268,0.004398978],"genre_scores_gemma":[0.5794965,0.00052942155,0.40186915,0.0003871569,0.00013790754,0.00018490147,0.0021735262,0.00046093942,0.014760467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999833,0.00004218324,0.0000062383438,0.0000536867,0.000046123176,0.00001874514],"domain_scores_gemma":[0.99946445,0.0002505866,0.0000257912,0.00010996572,0.00013070602,0.000018597799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035496656,0.00043246677,0.00044134003,0.00076182873,0.00027817627,0.0006131843,0.0016804058,0.0006373504,0.004164504],"category_scores_gemma":[0.0014268488,0.00026912228,0.00069942814,0.000931513,0.00033697017,0.0014075796,0.0008865995,0.00093877455,0.0017567547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013636431,0.0002158352,0.0016666766,0.00017021902,0.00009481103,0.00017146699,0.00007778242,0.48154372,0.009342513,0.023791898,0.011731627,0.47105715],"study_design_scores_gemma":[0.0000053491376,0.00001970312,0.00013067362,0.000006543989,0.000016208518,0.000032408243,0.000007876599,0.980885,0.0017545966,0.015320993,0.0018159971,0.000004714186],"about_ca_topic_score_codex":0.0041452846,"about_ca_topic_score_gemma":0.00850578,"teacher_disagreement_score":0.004164504,"about_ca_system_score_codex":0.00042971203,"about_ca_system_score_gemma":0.00056332594,"threshold_uncertainty_score":0.013931692},"labels":[],"label_agreement":null},{"id":"W4285252860","doi":"10.1007/978-3-031-09680-8_12","title":"Deep Knowledge Tracing on Skills with Small Datasets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Tracing; Artificial intelligence; Function (biology); Generalization; A priori and a posteriori; Machine learning; Architecture","score_opus":0.021281867961656785,"score_gpt":0.24502714016628244,"score_spread":0.22374527220462564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285252860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41973403,0.0026609763,0.527793,0.0019338838,0.0003490027,0.0003495443,0.012781112,0.015437231,0.018961178],"genre_scores_gemma":[0.8087361,0.00040972978,0.16343164,0.00025103922,0.000112315916,0.0001760683,0.014497322,0.0006594396,0.011726274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905473,0.0001969905,0.00006546663,0.00036662232,0.00016565308,0.00015050426],"domain_scores_gemma":[0.9878116,0.008192881,0.0002703388,0.0026485207,0.00074262137,0.00033406855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015304717,0.00085829146,0.00080937636,0.0025320589,0.0005816921,0.0016688219,0.0016248287,0.0016538698,0.0064406465],"category_scores_gemma":[0.016268605,0.0006029282,0.0008748581,0.0025949047,0.0006485704,0.0043033212,0.0026326955,0.0024586024,0.0021202757],"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.00075986015,0.00049552106,0.020224413,0.00034964198,0.00022380074,0.00031514736,0.0003801385,0.20961769,0.0036467446,0.0073505207,0.036612026,0.7200246],"study_design_scores_gemma":[0.00003699013,0.000072295494,0.0028220415,0.000061673,0.000032046897,0.00005814305,0.0001380748,0.9584434,0.0034661505,0.03086657,0.003991899,0.000010813183],"about_ca_topic_score_codex":0.012424815,"about_ca_topic_score_gemma":0.021507425,"teacher_disagreement_score":0.012424815,"about_ca_system_score_codex":0.0010584384,"about_ca_system_score_gemma":0.0016508036,"threshold_uncertainty_score":0.024704993},"labels":[],"label_agreement":null},{"id":"W4285256993","doi":"10.1007/978-3-031-09282-4","title":"Pattern Recognition and Artificial Intelligence","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.04235816556134437,"score_gpt":0.2634067356421219,"score_spread":0.22104857008077755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285256993","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028009976,0.11198661,0.48755607,0.0028495383,0.0078074713,0.00023274394,0.0012810676,0.005013177,0.38047242],"genre_scores_gemma":[0.027305216,0.062665686,0.15872806,0.00134914,0.0028062207,0.00033093564,0.0022028305,0.0010586582,0.74355334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996331,0.000041627285,0.000025209561,0.00008272403,0.00019866049,0.000018600405],"domain_scores_gemma":[0.9996352,0.00011426276,0.000021537051,0.00012470367,0.00008079094,0.000023442679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031697558,0.0014147836,0.0020283754,0.001452024,0.00033154906,0.0023419878,0.001190368,0.00087501074,0.07343648],"category_scores_gemma":[0.0010360734,0.0005089714,0.0005805439,0.003120222,0.00084595685,0.002718202,0.0012359256,0.0013436319,0.0591524],"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.000031653828,0.000032887634,0.00011200968,0.000815048,0.00005043398,0.00008084762,0.000048325972,0.002145305,0.0030950755,0.0525353,0.14451261,0.79654044],"study_design_scores_gemma":[0.00001966146,0.000079633326,0.00072873896,0.00031281562,0.000047383874,0.00077648653,0.000050059374,0.012576054,0.0027244145,0.1458525,0.8368081,0.000024161694],"about_ca_topic_score_codex":0.00052861014,"about_ca_topic_score_gemma":0.0006455247,"teacher_disagreement_score":0.07343648,"about_ca_system_score_codex":0.00037953397,"about_ca_system_score_gemma":0.00045564066,"threshold_uncertainty_score":0.24566948},"labels":[],"label_agreement":null},{"id":"W4285258326","doi":"10.1007/978-3-031-05654-3_27","title":"Virtual Museum Visits in a Pandemic: Older Adults Discuss Experiences of Art, Culture and Social Connection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Concordia University","funders":"","keywords":"Conversation; The arts; Pandemic; Social media; Socialization; Social distance; Coronavirus disease 2019 (COVID-19); Medical education; Psychology; Visual arts; Medicine; Sociology; Computer science; World Wide Web; Art; Social science","score_opus":0.015065842673875994,"score_gpt":0.2614380491896595,"score_spread":0.2463722065157835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285258326","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.95065033,0.0050848983,0.00021708633,0.009276521,0.00066180644,0.000037751877,0.00016238933,0.000046768033,0.033862375],"genre_scores_gemma":[0.9816289,0.0029812139,0.00031903439,0.0028616786,0.00016845267,0.00004720311,0.000118456606,0.000024891615,0.0118500795],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9995388,0.00022543517,0.000015816988,0.000027389211,0.00004291891,0.00014967278],"domain_scores_gemma":[0.9986154,0.00031741464,0.00015585516,0.00003624341,0.000068060945,0.0008070648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014423467,0.0004916124,0.00042678235,0.000617529,0.0061061108,0.004431171,0.0006168246,0.0023618517,0.0069567263],"category_scores_gemma":[0.0026083642,0.00040038393,0.00056583656,0.00057633896,0.002057771,0.004413888,0.0061776103,0.002801577,0.00066311785],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013220533,0.00015662923,0.037361167,0.00017067559,0.00003747397,0.0021965953,0.9162071,0.000029087423,0.00056958315,0.0012703604,0.020022308,0.021846684],"study_design_scores_gemma":[0.000014354159,0.00012555522,0.019847477,0.00014118868,0.000025532427,0.0011363281,0.94500065,0.00001853712,0.000060590864,0.00038384428,0.033226945,0.000019075329],"about_ca_topic_score_codex":0.0061903372,"about_ca_topic_score_gemma":0.025973188,"teacher_disagreement_score":0.0069567263,"about_ca_system_score_codex":0.0008497086,"about_ca_system_score_gemma":0.00097411807,"threshold_uncertainty_score":0.023272574},"labels":[],"label_agreement":null},{"id":"W4285259144","doi":"10.1007/978-3-031-09037-0","title":"Pattern Recognition and Artificial Intelligence","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.04235816556134437,"score_gpt":0.2634067356421219,"score_spread":0.22104857008077755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285259144","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028009976,0.11198661,0.48755607,0.0028495383,0.0078074713,0.00023274394,0.0012810676,0.005013177,0.38047242],"genre_scores_gemma":[0.027305216,0.062665686,0.15872806,0.00134914,0.0028062207,0.00033093564,0.0022028305,0.0010586582,0.74355334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996331,0.000041627285,0.000025209561,0.00008272403,0.00019866049,0.000018600405],"domain_scores_gemma":[0.9996352,0.00011426276,0.000021537051,0.00012470367,0.00008079094,0.000023442679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031697558,0.0014147836,0.0020283754,0.001452024,0.00033154906,0.0023419878,0.001190368,0.00087501074,0.07343648],"category_scores_gemma":[0.0010360734,0.0005089714,0.0005805439,0.003120222,0.00084595685,0.002718202,0.0012359256,0.0013436319,0.0591524],"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.000031653828,0.000032887634,0.00011200968,0.000815048,0.00005043398,0.00008084762,0.000048325972,0.002145305,0.0030950755,0.0525353,0.14451261,0.79654044],"study_design_scores_gemma":[0.00001966146,0.000079633326,0.00072873896,0.00031281562,0.000047383874,0.00077648653,0.000050059374,0.012576054,0.0027244145,0.1458525,0.8368081,0.000024161694],"about_ca_topic_score_codex":0.00052861014,"about_ca_topic_score_gemma":0.0006455247,"teacher_disagreement_score":0.07343648,"about_ca_system_score_codex":0.00037953397,"about_ca_system_score_gemma":0.00045564066,"threshold_uncertainty_score":0.24566948},"labels":[],"label_agreement":null},{"id":"W4285260888","doi":"10.1007/978-3-031-09342-5_7","title":"Assessing Knee Osteoarthritis Severity and Biomechanical Changes After Total Knee Arthroplasty Using Self-organizing Maps","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Osteoarthritis Treatment and Mechanisms","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Gait; Osteoarthritis; Biomechanics; Physical medicine and rehabilitation; Sagittal plane; Gait analysis; Medicine; WOMAC; Physical therapy; Anatomy; Pathology","score_opus":0.016673744606641047,"score_gpt":0.24983412963438117,"score_spread":0.2331603850277401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285260888","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.71673536,0.010078306,0.24112855,0.00068512256,0.0004243637,0.00026525365,0.0028639524,0.0015485637,0.026270526],"genre_scores_gemma":[0.8714602,0.0041196863,0.103101745,0.00009298264,0.00014467204,0.00014924238,0.0017182683,0.00007537788,0.019137824],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9999001,0.000019229943,0.000008130924,0.000014561039,0.000051214698,0.0000067928568],"domain_scores_gemma":[0.9998355,0.00010731701,0.000014526036,0.000006086681,0.000028982045,0.000007601454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024147278,0.00025515404,0.00020892393,0.0005777067,0.00006158274,0.000285635,0.00020015005,0.00016240343,0.0014712092],"category_scores_gemma":[0.0005615577,0.00008000313,0.00030237317,0.00051258196,0.00007429285,0.00034405736,0.00016796443,0.00012942913,0.0003812754],"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.00024696835,0.00013268065,0.041570544,0.0002340764,0.00012247947,0.00015123027,0.000303024,0.005910685,0.010440464,0.0005707475,0.0068541216,0.933463],"study_design_scores_gemma":[0.000043701708,0.0015720766,0.796195,0.0001811211,0.00029760637,0.0022839173,0.0017773455,0.15252432,0.01653682,0.008988816,0.019447234,0.00015198825],"about_ca_topic_score_codex":0.001427642,"about_ca_topic_score_gemma":0.002883708,"teacher_disagreement_score":0.0014712092,"about_ca_system_score_codex":0.00009176425,"about_ca_system_score_gemma":0.000097544194,"threshold_uncertainty_score":0.0049217343},"labels":[],"label_agreement":null},{"id":"W4285263180","doi":"10.1007/978-3-031-08757-8_44","title":"DSCAN for Geo-social Team Formation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","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 Windsor","funders":"","keywords":"Impromptu; Computer science; Process (computing); Service (business); Social network (sociolinguistics); Artificial intelligence; Data science; Social media; World Wide Web","score_opus":0.022409353709061552,"score_gpt":0.2891276030842128,"score_spread":0.26671824937515126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285263180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007755303,0.0007897003,0.96360385,0.00046701755,0.00041205017,0.00007795482,0.0005116507,0.0007455599,0.025636975],"genre_scores_gemma":[0.4060569,0.0018046822,0.47727725,0.00053853454,0.0006349822,0.00068399665,0.0023669174,0.00076279003,0.10987399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993193,0.00018621975,0.000030029792,0.00018466594,0.00020217261,0.000077576144],"domain_scores_gemma":[0.99871826,0.00055854453,0.000086419815,0.00034141517,0.00019021075,0.00010517024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009618171,0.0008404432,0.0011810333,0.0010469711,0.0011755129,0.0015473239,0.0023243164,0.0011055182,0.01598083],"category_scores_gemma":[0.0037593374,0.00043716308,0.0009558822,0.0013812792,0.000979479,0.0019295757,0.0043761763,0.0020331638,0.0046401257],"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.00011284079,0.0000735358,0.0008815717,0.00018267057,0.000050747956,0.0001004891,0.00017246579,0.100152865,0.0014283947,0.7357468,0.019860089,0.1412376],"study_design_scores_gemma":[0.000010283855,0.000021604137,0.00020832494,0.000022750157,0.000011999699,0.000058325382,0.000058438964,0.62222683,0.0006371945,0.3578862,0.018847939,0.000010171628],"about_ca_topic_score_codex":0.0038101638,"about_ca_topic_score_gemma":0.0055622263,"teacher_disagreement_score":0.01598083,"about_ca_system_score_codex":0.0012262961,"about_ca_system_score_gemma":0.0013439755,"threshold_uncertainty_score":0.053461254},"labels":[],"label_agreement":null},{"id":"W4285266389","doi":"10.1007/978-3-031-07802-6_28","title":"Comparative Analysis of Supervised Cell Type Detection in Single-Cell RNA-seq Data","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Single-cell and spatial transcriptomics","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 Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Support vector machine; Feature selection; Identification (biology); Random forest; Machine learning; Feature vector; Annotation; Feature (linguistics); Supervised learning; Pattern recognition (psychology); Data mining; Artificial neural network","score_opus":0.042159340247245436,"score_gpt":0.2579859429504683,"score_spread":0.21582660270322285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285266389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23834963,0.0020191353,0.7273177,0.00022055715,0.00027939063,0.00021841959,0.019304223,0.0076344996,0.004656422],"genre_scores_gemma":[0.30141065,0.0008762394,0.6559853,0.00022304867,0.000084771214,0.0006039137,0.034849573,0.0024408128,0.0035257752],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887604,0.00017038181,0.000060880386,0.00051402935,0.00029443324,0.00008419058],"domain_scores_gemma":[0.9981641,0.0008761275,0.00014264547,0.00024298782,0.0005083797,0.00006584902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017254271,0.0005239739,0.00073753047,0.0013136124,0.00043621793,0.0013955488,0.0009311026,0.00043616595,0.0033358159],"category_scores_gemma":[0.0023102367,0.0002826098,0.0010785414,0.0014852922,0.00041024951,0.0006323704,0.00055396726,0.00059781375,0.0017836246],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048134773,0.00011298039,0.005726068,0.0006243171,0.0003311749,0.000100113415,0.0002004929,0.0057412935,0.78743625,0.0023309544,0.0056052757,0.19130974],"study_design_scores_gemma":[0.000048923466,0.00032816106,0.114720196,0.00011834992,0.00034023557,0.0006874186,0.00039419247,0.26336947,0.5847968,0.009246309,0.025798036,0.00015187376],"about_ca_topic_score_codex":0.0019971593,"about_ca_topic_score_gemma":0.005615676,"teacher_disagreement_score":0.0033358159,"about_ca_system_score_codex":0.0008187621,"about_ca_system_score_gemma":0.00088996766,"threshold_uncertainty_score":0.01115936},"labels":[],"label_agreement":null},{"id":"W4285275121","doi":"10.1007/978-3-031-08757-8_34","title":"Intersection Representation of Big Data Networks and Triangle Enumeration","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Lethbridge","funders":"","keywords":"Enumeration; Adjacency matrix; Sparse matrix; Matrix exponential; Computer science; Matrix (chemical analysis); Matrix representation; Graph; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.04218794373737904,"score_gpt":0.28765478835607416,"score_spread":0.2454668446186951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285275121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101277,0.00082847354,0.96548283,0.000652714,0.00015097324,0.000049378195,0.0007048458,0.0006604801,0.02134261],"genre_scores_gemma":[0.3810266,0.0029528278,0.57668257,0.0004334006,0.00048481987,0.00045033,0.005638762,0.0010017245,0.031328995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985337,0.00047408632,0.00010008693,0.0002709909,0.0004617784,0.0001593596],"domain_scores_gemma":[0.9964977,0.0016979468,0.0002564804,0.0008340357,0.00052511855,0.0001887881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015879234,0.0007959233,0.0011731761,0.0027163285,0.001023981,0.004153616,0.0025825053,0.0009525915,0.013313712],"category_scores_gemma":[0.00846067,0.00060627476,0.0011159033,0.0064790887,0.0012564893,0.007883674,0.00338623,0.0032823433,0.0020884562],"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.00006400954,0.000029676326,0.00031294764,0.00009709552,0.00001679787,0.000043062508,0.00012945323,0.033343997,0.0003454131,0.9053779,0.008026544,0.0522131],"study_design_scores_gemma":[0.0000062666636,0.000011355473,0.00008115379,0.000032520376,0.000010608404,0.000050353025,0.00007240374,0.19886078,0.00040462997,0.7879331,0.0125285955,0.000008201199],"about_ca_topic_score_codex":0.0029711004,"about_ca_topic_score_gemma":0.0026797378,"teacher_disagreement_score":0.013313712,"about_ca_system_score_codex":0.0015607071,"about_ca_system_score_gemma":0.0009184333,"threshold_uncertainty_score":0.044538796},"labels":[],"label_agreement":null},{"id":"W4285275910","doi":"10.1007/978-3-031-06220-9_1","title":"On the Comparison of Bacteriophage Populations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bacteriophages and microbial interactions","field":"Environmental 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":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Population; Bacteriophage; Phylogenetic tree; Biology; Inference; Computer science; Genetics; Gene; Artificial intelligence","score_opus":0.027623416745204542,"score_gpt":0.27211173134120636,"score_spread":0.24448831459600182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285275910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20664245,0.031131797,0.57867855,0.0016703252,0.0028516997,0.00024132284,0.0011027495,0.00093529536,0.17674579],"genre_scores_gemma":[0.71089494,0.016338449,0.20692259,0.00086253084,0.0007324129,0.00037229297,0.0029511878,0.0010012473,0.05992422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983553,0.00062933145,0.00007078425,0.00028413162,0.00052956847,0.00013075036],"domain_scores_gemma":[0.9960561,0.0031587447,0.00012523065,0.00021986716,0.0003533373,0.00008672737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002277218,0.0005749481,0.0011182459,0.0023793639,0.0006640178,0.0020006276,0.0017393684,0.0010999417,0.006741566],"category_scores_gemma":[0.010270153,0.0003089401,0.0008624101,0.0022486537,0.0012211134,0.0032266593,0.0018776039,0.0012296787,0.0009864419],"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.00072259,0.00019313635,0.0050664614,0.00092943356,0.000117310134,0.00032448105,0.0007308912,0.032080263,0.058110986,0.5871684,0.010459703,0.3040964],"study_design_scores_gemma":[0.000061974184,0.00053914706,0.015844434,0.0002776312,0.00009193548,0.001124765,0.0006668904,0.16405168,0.059826322,0.68408483,0.0732938,0.00013664462],"about_ca_topic_score_codex":0.0014637691,"about_ca_topic_score_gemma":0.00096005056,"teacher_disagreement_score":0.006741566,"about_ca_system_score_codex":0.0012841613,"about_ca_system_score_gemma":0.00039347805,"threshold_uncertainty_score":0.022552729},"labels":[],"label_agreement":null},{"id":"W4285278578","doi":"10.1007/978-3-031-05578-2_15","title":"Visit-Bounded Stack Automata","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Saskatchewan","funders":"","keywords":"Stack (abstract data type); Bounded function; Automaton; Computer science; Theoretical computer science; Programming language; Mathematics; Mathematical analysis","score_opus":0.014314477135930469,"score_gpt":0.24041885681952363,"score_spread":0.22610437968359315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285278578","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.07811336,0.0021035692,0.5136359,0.0021396605,0.0005795859,0.000119476295,0.0016248225,0.0052318927,0.39645174],"genre_scores_gemma":[0.7395695,0.0016372447,0.07185816,0.0004425958,0.0002010053,0.00026801525,0.0017559612,0.0013209855,0.18294656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993717,0.00010282531,0.000035784447,0.00015785571,0.0001959881,0.00013588612],"domain_scores_gemma":[0.9986811,0.00051870785,0.000057560042,0.00040590615,0.00020741022,0.0001293203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132062,0.000650642,0.00072388735,0.0007895096,0.0016255248,0.0031993827,0.0014974987,0.0010822285,0.019265682],"category_scores_gemma":[0.0025511333,0.0006992302,0.0010249633,0.0013386703,0.0020160712,0.005730475,0.0032751735,0.0029244411,0.0057805614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005048777,0.00001583927,0.00012213155,0.000054518914,0.0000063901907,0.000050218518,0.00026888665,0.002797522,0.0014707487,0.96744394,0.005031526,0.022687888],"study_design_scores_gemma":[0.000009243817,0.000013314105,0.00008231455,0.000023585268,0.000014008033,0.00008242311,0.00009692404,0.012602669,0.0019581192,0.9594865,0.0256174,0.000013531602],"about_ca_topic_score_codex":0.0020999997,"about_ca_topic_score_gemma":0.002204466,"teacher_disagreement_score":0.019265682,"about_ca_system_score_codex":0.0016302693,"about_ca_system_score_gemma":0.0012534885,"threshold_uncertainty_score":0.064450145},"labels":[],"label_agreement":null},{"id":"W4285286145","doi":"10.1007/978-3-031-08751-6_35","title":"Consistency Fences for Partial Order Delivery to Reduce Latency","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Latency (audio); Consistency (knowledge bases); Computer science; Order (exchange); Business; Telecommunications; Artificial intelligence","score_opus":0.02446658024418878,"score_gpt":0.26178568520003503,"score_spread":0.23731910495584627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285286145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0311815,0.0016992083,0.9408542,0.0014173588,0.0012297496,0.00050484476,0.00058003736,0.0064560063,0.016077062],"genre_scores_gemma":[0.4840726,0.0012260521,0.47842076,0.0012869358,0.00068084226,0.000756495,0.0010525243,0.002245171,0.030258775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977985,0.00043002382,0.00018870113,0.00033549077,0.00077838154,0.0004688852],"domain_scores_gemma":[0.9891199,0.003887196,0.00057468074,0.004372837,0.0016438178,0.00040155774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003527067,0.0011944262,0.0019626503,0.0015037361,0.0023539583,0.0026325614,0.0036347103,0.0012699553,0.018597122],"category_scores_gemma":[0.012307323,0.0009518235,0.0012628477,0.002465397,0.0016583683,0.0049733985,0.0037835287,0.003937522,0.0025934451],"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.0023001374,0.0004395652,0.0011976451,0.000829814,0.0001326233,0.00031746228,0.0006008688,0.07673539,0.014925809,0.41203547,0.052973114,0.43751222],"study_design_scores_gemma":[0.00055774325,0.0006321439,0.00051149,0.00023194788,0.000224629,0.00038068424,0.0003470135,0.48069686,0.03415217,0.42412153,0.0580199,0.00012386135],"about_ca_topic_score_codex":0.004066411,"about_ca_topic_score_gemma":0.0054477453,"teacher_disagreement_score":0.018597122,"about_ca_system_score_codex":0.0022821887,"about_ca_system_score_gemma":0.0050516175,"threshold_uncertainty_score":0.0622136},"labels":[],"label_agreement":null},{"id":"W4285286727","doi":"10.1007/978-3-031-09593-1_8","title":"Toward a Trip Planner Adapted to Older Adults Context: Mobilaînés Project","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Planner; Computer science; Socialization; Context (archaeology); Public transport; Human–computer interaction; Transport engineering; Artificial intelligence; Psychology; Engineering; Social psychology","score_opus":0.02146200136001295,"score_gpt":0.24099766287103624,"score_spread":0.2195356615110233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285286727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1889319,0.0011942014,0.6699666,0.0020641193,0.0007381054,0.0028194473,0.0034965759,0.0618505,0.06893864],"genre_scores_gemma":[0.21412455,0.0010315157,0.68330926,0.0005243694,0.00009434118,0.001780709,0.00818057,0.0052435715,0.0857111],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999603,0.00013646542,0.000025291998,0.000076428485,0.00011973472,0.000039149225],"domain_scores_gemma":[0.9993807,0.00016246039,0.000025353263,0.000082801474,0.0001528783,0.00019581013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011478493,0.0006129716,0.0002590651,0.0005542939,0.00038051812,0.0012178319,0.0010641798,0.00087555987,0.0103170015],"category_scores_gemma":[0.0018945147,0.0003197561,0.00038006966,0.00030110453,0.00031147047,0.0014484022,0.0025536765,0.0010022531,0.0041527483],"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.000742227,0.0022560782,0.0076836315,0.0010882482,0.00009777907,0.002118397,0.008533485,0.013535447,0.059245493,0.024855321,0.1479718,0.7318721],"study_design_scores_gemma":[0.00033099065,0.001250468,0.0055675395,0.0005044536,0.00012817515,0.0018124816,0.0029032647,0.09820101,0.02840938,0.0101304725,0.8506407,0.000120978955],"about_ca_topic_score_codex":0.0017630871,"about_ca_topic_score_gemma":0.001721459,"teacher_disagreement_score":0.0103170015,"about_ca_system_score_codex":0.00033696726,"about_ca_system_score_gemma":0.0009580344,"threshold_uncertainty_score":0.03451377},"labels":[],"label_agreement":null},{"id":"W4285290135","doi":"10.1007/978-3-031-08757-8_43","title":"A Sparse Matrix Approach for Covering Large Complex Networks by Cliques","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Lethbridge","funders":"","keywords":"Heuristics; Clique; Pairwise comparison; Computer science; Benchmark (surveying); Theoretical computer science; Graph; Algorithm; Scalability; Computation; Heuristic; Mathematics; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.01887177657334158,"score_gpt":0.27372450926857533,"score_spread":0.25485273269523373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285290135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034561504,0.00026325198,0.993129,0.00017581994,0.000044608572,0.000026397815,0.00010097973,0.00013322932,0.0026705507],"genre_scores_gemma":[0.20125511,0.0016195654,0.7789452,0.0004086174,0.0006273931,0.00035418005,0.00067761814,0.00036039425,0.015751943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936086,0.00024223066,0.000019898698,0.00014968024,0.00017394387,0.000053431453],"domain_scores_gemma":[0.9971929,0.0019714688,0.00013599067,0.00035874383,0.00022124658,0.000119674536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007761757,0.0009985346,0.001276347,0.0013392511,0.00077700644,0.0011667346,0.0022787384,0.0013318355,0.0051798946],"category_scores_gemma":[0.0044758655,0.0008355117,0.0013894975,0.0025737516,0.0011857885,0.0026635993,0.0019901907,0.0025592525,0.0009324676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078792524,0.000094079434,0.00047727337,0.0002931182,0.000105400955,0.00013695334,0.00026830376,0.48084366,0.00572933,0.4004531,0.01395419,0.09756581],"study_design_scores_gemma":[0.000007418427,0.000018859024,0.000094237665,0.000009313244,0.000013203679,0.000053001917,0.000025630932,0.8465864,0.0003521401,0.14954905,0.0032813305,0.000009499957],"about_ca_topic_score_codex":0.0040158792,"about_ca_topic_score_gemma":0.0063046985,"teacher_disagreement_score":0.0051798946,"about_ca_system_score_codex":0.00086977385,"about_ca_system_score_gemma":0.00050593907,"threshold_uncertainty_score":0.017328441},"labels":[],"label_agreement":null},{"id":"W4285293202","doi":"10.1007/978-3-031-05637-6_1","title":"Movement Control Methods for Mobile Devices: An Empirical Study of Displacement Interfaces","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Joystick; Computer science; Tilt (camera); Displacement (psychology); Simulation; Path (computing); Computer vision; Mathematics; Geometry","score_opus":0.03148032127660075,"score_gpt":0.3764740414730391,"score_spread":0.34499372019643837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285293202","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.9746937,0.0013011472,0.012659579,0.0001266616,0.000016919324,0.00035619977,0.000086031825,0.000035740723,0.010724032],"genre_scores_gemma":[0.98923266,0.00047837,0.0071619423,0.00004297655,0.000008642976,0.0001998638,0.00007419056,0.000032648375,0.0027686078],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9958002,0.0021645627,0.00026656588,0.00033997037,0.0012334525,0.00019510841],"domain_scores_gemma":[0.9124499,0.078991495,0.0035743108,0.0013977872,0.0031928457,0.00039380873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052107666,0.00048360837,0.00032867104,0.001317791,0.00066401146,0.0019594575,0.0012031352,0.0009699839,0.005527875],"category_scores_gemma":[0.075698346,0.00040857578,0.00026324988,0.0012144239,0.0011534079,0.0023284536,0.0012697477,0.0007806092,0.0005188153],"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.0027110865,0.0032078947,0.2612414,0.0034092884,0.00017271138,0.00074302196,0.13986194,0.001991886,0.028034812,0.01662402,0.0020341403,0.5399678],"study_design_scores_gemma":[0.0004473613,0.0063435268,0.8097892,0.0015138831,0.00039055065,0.0024869742,0.10961541,0.029104814,0.01121719,0.008520885,0.020401796,0.00016845003],"about_ca_topic_score_codex":0.002680672,"about_ca_topic_score_gemma":0.0024407208,"teacher_disagreement_score":0.005527875,"about_ca_system_score_codex":0.0007454888,"about_ca_system_score_gemma":0.0006455357,"threshold_uncertainty_score":0.027557552},"labels":[],"label_agreement":null},{"id":"W4285293764","doi":"10.1007/978-3-031-09593-1_7","title":"Smart Technology in the Home for People Living in the Community with Mental Illness and Physical Comorbidities","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Health Authority; Dalhousie University; Lawson Health Research Institute; Western University","funders":"Canadian Mental Health Association; London Health Sciences Centre; Lawson Health Research Institute","keywords":"Mental health; Descriptive statistics; Mental illness; Scale (ratio); Intervention (counseling); Sample (material); Health care; Medicine; Psychology; Nursing; Psychiatry","score_opus":0.029545972165354588,"score_gpt":0.3232910168673259,"score_spread":0.2937450447019713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285293764","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.72617877,0.03430438,0.0058471644,0.009850566,0.0014574383,0.0010047873,0.00041622022,0.0004325421,0.2205081],"genre_scores_gemma":[0.8930443,0.02136616,0.015968917,0.003157911,0.0003096185,0.0007146149,0.00028306764,0.000041360763,0.06511413],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99985266,0.000077856406,0.0000061339224,0.000009363404,0.000034368193,0.00001963778],"domain_scores_gemma":[0.9998055,0.00011326621,0.0000140589045,0.0000075940097,0.000014784516,0.00004478499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035386224,0.00018004398,0.00016709862,0.00019563663,0.00038309343,0.000792757,0.00026049523,0.00034190321,0.010632849],"category_scores_gemma":[0.0004885887,0.000046799953,0.00021142363,0.00020467566,0.00023773861,0.0005417131,0.0006632709,0.00035083506,0.0007045188],"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.00027005177,0.0017551165,0.00854356,0.0018570176,0.000031761072,0.0005262669,0.0075024217,0.00033367588,0.004536237,0.004688403,0.041317623,0.92863786],"study_design_scores_gemma":[0.00041179723,0.012898855,0.16155599,0.005323008,0.0002452083,0.0025760694,0.041061983,0.0029388762,0.009047246,0.010659284,0.75317115,0.00011051466],"about_ca_topic_score_codex":0.00076689257,"about_ca_topic_score_gemma":0.0025544735,"teacher_disagreement_score":0.010632849,"about_ca_system_score_codex":0.00026483383,"about_ca_system_score_gemma":0.0005879102,"threshold_uncertainty_score":0.035570383},"labels":[],"label_agreement":null},{"id":"W4285303404","doi":"10.1007/978-3-031-06773-0_5","title":"The Prusti Project: Formal Verification for Rust","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Rust (programming language); Correctness; Programming language; Key (lock); Overhead (engineering); Feature (linguistics); Formal verification; Memory safety; Software engineering; Software; Operating system","score_opus":0.03897975609536008,"score_gpt":0.30002799376774086,"score_spread":0.2610482376723808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285303404","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.0020158382,0.0015073955,0.9411346,0.0006297792,0.0005905292,0.00011677718,0.0005982534,0.017911438,0.03549549],"genre_scores_gemma":[0.08828183,0.0035502892,0.8044212,0.0009123542,0.00059959636,0.00061260856,0.0041727326,0.018631907,0.07881751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974807,0.0007558036,0.00012504504,0.0004378592,0.001030376,0.00017021653],"domain_scores_gemma":[0.99784803,0.0009553388,0.00009014786,0.00063955475,0.00039914102,0.00006782508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029731407,0.0016521307,0.00085196126,0.0012703708,0.0007062407,0.0022742937,0.002577071,0.0014754379,0.02670122],"category_scores_gemma":[0.005276737,0.001245689,0.0017492883,0.0010078897,0.0018709173,0.003933395,0.0023163876,0.0032889019,0.013527586],"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.00021479504,0.00008649684,0.00020425094,0.0010834964,0.00007275586,0.00018226255,0.00043580058,0.01936348,0.011465994,0.50008625,0.105313875,0.36149064],"study_design_scores_gemma":[0.00014949837,0.0001414023,0.00029314522,0.00045993895,0.00007413371,0.00047029613,0.00006257962,0.09388461,0.035295635,0.36953613,0.49953535,0.0000971891],"about_ca_topic_score_codex":0.0011493077,"about_ca_topic_score_gemma":0.0007598016,"teacher_disagreement_score":0.02670122,"about_ca_system_score_codex":0.0011066556,"about_ca_system_score_gemma":0.0015527147,"threshold_uncertainty_score":0.089324474},"labels":[],"label_agreement":null},{"id":"W4285308427","doi":"10.1007/978-3-031-08011-1_22","title":"Practically Uniform Solution Sampling in Constraint Programming","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Modular design; Sampling (signal processing); Hash function; Theoretical computer science; Constraint (computer-aided design); Set (abstract data type); Fraction (chemistry); Algorithm; Sample (material); Linear programming; Mathematical optimization; Programming language; Mathematics; Artificial intelligence","score_opus":0.03316662803312574,"score_gpt":0.27408729310945784,"score_spread":0.24092066507633209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285308427","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.0036082582,0.0006164998,0.99212074,0.00023350715,0.0000375731,0.000054095,0.00004790522,0.00013309304,0.0031482517],"genre_scores_gemma":[0.22944148,0.0009974256,0.7631948,0.0004403705,0.00022068444,0.00064602925,0.00042104046,0.00041862234,0.0042196317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892588,0.0073274085,0.0002813715,0.00094436825,0.0018303461,0.00035765313],"domain_scores_gemma":[0.9558523,0.038317468,0.0006351685,0.0033719575,0.001317363,0.0005057313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010913655,0.0012117698,0.0025871866,0.0012495178,0.000870129,0.0021163416,0.0033554204,0.0018619382,0.004617512],"category_scores_gemma":[0.05285466,0.0018506445,0.001057229,0.003290098,0.0032241251,0.004625163,0.0039772857,0.0047904155,0.00061634975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040120748,0.00013298132,0.0007636952,0.0003982265,0.00008616877,0.000071948794,0.00015560398,0.45493153,0.0010383223,0.41926345,0.0052467263,0.11751009],"study_design_scores_gemma":[0.000035502388,0.000036636586,0.00010231188,0.000033392716,0.000011004683,0.000026459556,0.000019452533,0.8060454,0.00040986817,0.19182438,0.0014483288,0.0000072974203],"about_ca_topic_score_codex":0.0033091356,"about_ca_topic_score_gemma":0.003604137,"teacher_disagreement_score":0.010913655,"about_ca_system_score_codex":0.0023570848,"about_ca_system_score_gemma":0.0015793211,"threshold_uncertainty_score":0.05771762},"labels":[],"label_agreement":null},{"id":"W4285310629","doi":"10.1007/978-3-031-08129-3_1","title":"Fine-Grained Analysis of Similar Code Snippets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Université de Montréal","funders":"","keywords":"Computer science; Code (set theory); Information retrieval; World Wide Web; Programming language","score_opus":0.019778436055914693,"score_gpt":0.26693290289161986,"score_spread":0.24715446683570516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285310629","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.60868275,0.0018952471,0.33041945,0.0004885714,0.0004113252,0.00068140234,0.010555155,0.030414347,0.016451733],"genre_scores_gemma":[0.69520926,0.00062465,0.2639819,0.00034666999,0.00015527953,0.00030119528,0.017038442,0.0052895583,0.017053042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987746,0.00007411085,0.00008465808,0.00035161973,0.0005695387,0.00014556883],"domain_scores_gemma":[0.99619895,0.0014307545,0.0004599989,0.0007605372,0.0009894569,0.00016034735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004409483,0.0006860204,0.0006836271,0.004475993,0.0010089845,0.0014672916,0.0010994944,0.0010044196,0.0073588802],"category_scores_gemma":[0.004441003,0.00040534016,0.0012427185,0.0031246005,0.0006410225,0.001588604,0.0015268102,0.0009112274,0.0030633016],"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.0015601914,0.000499062,0.04089282,0.0013529412,0.00038072476,0.003428255,0.0013179327,0.02590303,0.30437684,0.013887621,0.022096688,0.5843038],"study_design_scores_gemma":[0.00012949173,0.00085644255,0.10452191,0.00038856248,0.0006336013,0.004984083,0.001717483,0.5532917,0.22687912,0.042085525,0.06426058,0.00025153908],"about_ca_topic_score_codex":0.0045218095,"about_ca_topic_score_gemma":0.009947608,"teacher_disagreement_score":0.0073588802,"about_ca_system_score_codex":0.00062870403,"about_ca_system_score_gemma":0.0010321214,"threshold_uncertainty_score":0.02461791},"labels":[],"label_agreement":null},{"id":"W4285413088","doi":"10.1007/978-3-031-10522-7_5","title":"Prediction of the Impact of the End of year Festivities on the Local Epidemiology of COVID-19 Using Agent-Based Simulation with Hidden Markov Models","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre; Styrelsen för Internationellt Utvecklingssamarbete","keywords":"Computer science; Pandemic; Hidden Markov model; Epidemiology; Coronavirus disease 2019 (COVID-19); Markov model; Transmission (telecommunications); Public health; Markov chain; Geography; Operations research; Artificial intelligence; Medicine; Machine learning; Telecommunications; Disease; Mathematics","score_opus":0.2724732786618076,"score_gpt":0.3925176809722917,"score_spread":0.12004440231048413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285413088","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.89140624,0.00057847484,0.09094961,0.00060134515,0.00010969021,0.000077810204,0.0018197928,0.00037221616,0.014084791],"genre_scores_gemma":[0.98473006,0.0002015769,0.0113826785,0.00002193898,0.000014902429,0.00003986135,0.0007247131,0.000018181185,0.0028660337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986374,0.00007447246,0.0000053345298,0.00002430586,0.000017193966,0.000014979263],"domain_scores_gemma":[0.99841034,0.0013358981,0.00007149019,0.00003892968,0.00008875599,0.000054522574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006975895,0.00033939126,0.00029302563,0.00042103592,0.00018336081,0.0006996022,0.00042285197,0.00045074054,0.0021887212],"category_scores_gemma":[0.001867125,0.00018117574,0.00037264675,0.0003307472,0.00017518477,0.00044674697,0.0003706637,0.0004239377,0.00030210867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036723945,0.000034110657,0.008198094,0.000017162403,0.000016022035,0.000042707343,0.000019293615,0.9843439,0.00022543671,0.0012310587,0.0006056664,0.005229852],"study_design_scores_gemma":[0.0000025331,0.000014532553,0.0009379057,0.0000038870935,0.000003306963,0.0000034780603,0.000010891835,0.9983542,0.00009801932,0.0004155663,0.00015344392,0.0000022702036],"about_ca_topic_score_codex":0.021887979,"about_ca_topic_score_gemma":0.014356463,"teacher_disagreement_score":0.021887979,"about_ca_system_score_codex":0.000680318,"about_ca_system_score_gemma":0.00051324075,"threshold_uncertainty_score":0.043521166},"labels":[],"label_agreement":null},{"id":"W4285505036","doi":"10.1007/978-3-031-09002-8_37","title":"Multi-institutional Travelling Model for Tumor Segmentation in MRI Datasets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Alberta Children's Hospital; Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Artificial intelligence; Computer science; Machine learning; Segmentation; Conditional random field; Dice; Implementation; Big data; Random forest; Deep learning; Forgetting; Data mining","score_opus":0.027595564054971454,"score_gpt":0.30947514045646696,"score_spread":0.2818795764014955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285505036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035379246,0.0019157544,0.95666087,0.00096147944,0.000109038614,0.000118554824,0.0017736267,0.0015231126,0.0015582734],"genre_scores_gemma":[0.6239218,0.0021417674,0.34085095,0.0005217828,0.00027596162,0.00080031995,0.009494695,0.0010373555,0.020955319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992735,0.0002663034,0.00004760776,0.00021627161,0.000074177435,0.00012206022],"domain_scores_gemma":[0.99738055,0.001755464,0.00017622624,0.00025349244,0.00031210922,0.00012216478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032655583,0.0010655518,0.0021516883,0.0021531722,0.0007609787,0.0019108444,0.0047341352,0.004303176,0.004592863],"category_scores_gemma":[0.0074568735,0.0010378907,0.0030764767,0.0032095157,0.0010431852,0.0025927608,0.0018047713,0.0031633377,0.001990416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003473302,0.00007767054,0.0009877711,0.00013650104,0.0001650252,0.000091904236,0.00007186955,0.91365325,0.00075546437,0.012678347,0.0050439276,0.065990806],"study_design_scores_gemma":[0.0000037599625,0.000009849358,0.000063396685,0.0000052893865,0.0000095453515,0.000011775208,0.000005151699,0.9964631,0.00010581447,0.0031006532,0.00021720813,0.000004428485],"about_ca_topic_score_codex":0.02479557,"about_ca_topic_score_gemma":0.018983448,"teacher_disagreement_score":0.02479557,"about_ca_system_score_codex":0.002231148,"about_ca_system_score_gemma":0.0017938431,"threshold_uncertainty_score":0.04930246},"labels":[],"label_agreement":null},{"id":"W4285506182","doi":"10.1007/978-3-031-09002-8_35","title":"Federated Learning Using Variable Local Training for Brain Tumor Segmentation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Alberta Children's Hospital; Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Variable (mathematics); Training (meteorology); Geography; Mathematics","score_opus":0.04854723820764354,"score_gpt":0.2880287534572601,"score_spread":0.23948151524961656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285506182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03717435,0.0005335978,0.95833653,0.00015937041,0.000053790158,0.000032379696,0.00016023604,0.002491777,0.001058028],"genre_scores_gemma":[0.6367351,0.00032253805,0.35505554,0.00023406206,0.00009168764,0.00009592687,0.0010437544,0.0002692127,0.006152281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995566,0.000100961195,0.000025418156,0.00015360807,0.00007961767,0.000083829014],"domain_scores_gemma":[0.99938226,0.00028216987,0.000037478436,0.00016791704,0.00010436294,0.00002569148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243532,0.0006339049,0.0012405271,0.00071942667,0.00046086262,0.00082381227,0.0015544017,0.0012810437,0.0021791563],"category_scores_gemma":[0.001649516,0.00037584844,0.00095828634,0.00091650273,0.0005499914,0.0011004516,0.0012469213,0.0011661501,0.000706974],"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.0005137484,0.0002094876,0.0015799743,0.00007259312,0.00013207948,0.0001499368,0.00009100798,0.266731,0.01395393,0.0039715474,0.0056739976,0.70692074],"study_design_scores_gemma":[0.000005909061,0.000036620408,0.00025099958,0.0000042973556,0.00001563666,0.000060566173,0.0000104454975,0.99184227,0.004496571,0.0028524273,0.00041911573,0.000005176758],"about_ca_topic_score_codex":0.00375848,"about_ca_topic_score_gemma":0.004684683,"teacher_disagreement_score":0.00375848,"about_ca_system_score_codex":0.0005585872,"about_ca_system_score_gemma":0.0008594757,"threshold_uncertainty_score":0.0074732304},"labels":[],"label_agreement":null},{"id":"W4285522404","doi":"10.1007/978-3-030-93046-2_56","title":"Classification Beats Regression: Counting of Cells from Greyscale Microscopic Images Based on Annotation-Free Training Samples","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia","funders":"","keywords":"Artificial intelligence; Computer science; Grayscale; Pattern recognition (psychology); Cell counting; Convolutional neural network; Segmentation; Code (set theory); Annotation; Image (mathematics); Machine learning; Cell","score_opus":0.02071092809676657,"score_gpt":0.27046156905691476,"score_spread":0.2497506409601482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285522404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00867509,0.00048388718,0.97979707,0.00013618045,0.00014932196,0.00010097177,0.00070280157,0.007656318,0.0022984596],"genre_scores_gemma":[0.067132674,0.0008319062,0.91093457,0.00017870626,0.00015191399,0.0002474401,0.0028360265,0.0017017821,0.015984897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916995,0.00006349777,0.0000346066,0.00028547968,0.00036396147,0.00008249454],"domain_scores_gemma":[0.9989845,0.0003857723,0.00007659055,0.00024777572,0.00025440546,0.00005102926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011293375,0.0011462796,0.0014170394,0.0011205182,0.00039018705,0.0014283778,0.0036112557,0.0013710669,0.007124302],"category_scores_gemma":[0.0017967254,0.00066863955,0.0008685415,0.0017517162,0.0005241413,0.0010270126,0.0010308252,0.0013335478,0.007526055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001922252,0.00008250805,0.0011248132,0.00023319841,0.00005118446,0.00007134071,0.00006774724,0.015546096,0.1037998,0.0028956437,0.014237487,0.861698],"study_design_scores_gemma":[0.000020253625,0.00010119949,0.0041882684,0.000042216245,0.000054393888,0.0002732238,0.00004533991,0.86837846,0.10444157,0.0061325273,0.016275479,0.000047055626],"about_ca_topic_score_codex":0.0029459903,"about_ca_topic_score_gemma":0.005612612,"teacher_disagreement_score":0.007124302,"about_ca_system_score_codex":0.00066873484,"about_ca_system_score_gemma":0.0006818131,"threshold_uncertainty_score":0.023833156},"labels":[],"label_agreement":null},{"id":"W4285552674","doi":"10.1007/978-3-030-83164-6","title":"Mobile Web and Intelligent Information Systems","year":2021,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Concordia University","funders":"","keywords":"Computer science; Focus (optics); World Wide Web; Information system; Mobile computing; Multimedia; Telecommunications","score_opus":0.009229003626618631,"score_gpt":0.2208185228319935,"score_spread":0.21158951920537486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285552674","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045378236,0.20130846,0.043917287,0.00433148,0.0034556543,0.00006226424,0.00022598506,0.00058383314,0.74157715],"genre_scores_gemma":[0.049339034,0.102835625,0.01967915,0.001595103,0.0032935117,0.00012111231,0.0004670033,0.00029666052,0.82237285],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998648,0.000025709816,0.00000484133,0.000018087872,0.000073655254,0.000012868271],"domain_scores_gemma":[0.99984527,0.00008212877,0.00001079396,0.000020032901,0.000026748094,0.000014974973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016662052,0.00068016886,0.000575727,0.0016348377,0.00036912345,0.0026979567,0.00040894205,0.0010287807,0.029809907],"category_scores_gemma":[0.00041866134,0.00026955316,0.00023918327,0.0027837814,0.0006235297,0.0040841247,0.00067954167,0.0010842036,0.011420078],"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.00004514594,0.00009920307,0.00019558522,0.0005797727,0.000027268357,0.00019506774,0.00024457576,0.0017579034,0.0022855035,0.36379713,0.17350571,0.4572671],"study_design_scores_gemma":[0.000013590855,0.00004059849,0.0004439962,0.0003028348,0.000017049239,0.00037421935,0.00010375268,0.0031656018,0.0005695228,0.14900567,0.8459525,0.000010676327],"about_ca_topic_score_codex":0.0006703882,"about_ca_topic_score_gemma":0.0011066999,"teacher_disagreement_score":0.029809907,"about_ca_system_score_codex":0.0005178699,"about_ca_system_score_gemma":0.000267555,"threshold_uncertainty_score":0.099724114},"labels":[],"label_agreement":null},{"id":"W4285717408","doi":"10.1007/978-3-030-59719-1","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2020","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Computer science; Computer graphics (images); Multimedia; Human–computer interaction","score_opus":0.008707190340137857,"score_gpt":0.2952506030000074,"score_spread":0.28654341265986955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285717408","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034252629,0.118530326,0.22045301,0.0069871126,0.037303012,0.00034378114,0.0031328434,0.0058270013,0.6039976],"genre_scores_gemma":[0.014814514,0.0491656,0.08593812,0.0010513216,0.009006844,0.00024422578,0.0039814813,0.0024480666,0.8333499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999193,0.000074445285,0.00003885134,0.00014713076,0.00049643044,0.0000500666],"domain_scores_gemma":[0.9989145,0.00021320597,0.000044983135,0.00012753958,0.00048936723,0.00021039354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335168,0.0017704371,0.00094877725,0.0028211505,0.0004485073,0.0023517555,0.0012869267,0.0012373974,0.060565516],"category_scores_gemma":[0.0019243393,0.0007035382,0.0006094144,0.002384871,0.000660642,0.0023585474,0.0020522997,0.0026583741,0.04325707],"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.00005189513,0.00003093939,0.00007767681,0.00029374554,0.000022974187,0.000025718315,0.000015739171,0.0019107737,0.0023153934,0.015985955,0.52499855,0.45427078],"study_design_scores_gemma":[0.000008480183,0.000059307033,0.0008793684,0.00015509862,0.000014914827,0.00038927252,0.00001108766,0.011744311,0.0026276961,0.01147886,0.9726007,0.000030951225],"about_ca_topic_score_codex":0.002301609,"about_ca_topic_score_gemma":0.0032144943,"teacher_disagreement_score":0.060565516,"about_ca_system_score_codex":0.0009352664,"about_ca_system_score_gemma":0.0014103875,"threshold_uncertainty_score":0.20261186},"labels":[],"label_agreement":null},{"id":"W4285717795","doi":"10.1007/978-3-030-59713-9","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2020","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.008707190340137857,"score_gpt":0.2952506030000074,"score_spread":0.28654341265986955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285717795","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034252629,0.118530326,0.22045301,0.0069871126,0.037303012,0.00034378114,0.0031328434,0.0058270013,0.6039976],"genre_scores_gemma":[0.014814514,0.0491656,0.08593812,0.0010513216,0.009006844,0.00024422578,0.0039814813,0.0024480666,0.8333499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999193,0.000074445285,0.00003885134,0.00014713076,0.00049643044,0.0000500666],"domain_scores_gemma":[0.9989145,0.00021320597,0.000044983135,0.00012753958,0.00048936723,0.00021039354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335168,0.0017704371,0.00094877725,0.0028211505,0.0004485073,0.0023517555,0.0012869267,0.0012373974,0.060565516],"category_scores_gemma":[0.0019243393,0.0007035382,0.0006094144,0.002384871,0.000660642,0.0023585474,0.0020522997,0.0026583741,0.04325707],"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.00005189513,0.00003093939,0.00007767681,0.00029374554,0.000022974187,0.000025718315,0.000015739171,0.0019107737,0.0023153934,0.015985955,0.52499855,0.45427078],"study_design_scores_gemma":[0.000008480183,0.000059307033,0.0008793684,0.00015509862,0.000014914827,0.00038927252,0.00001108766,0.011744311,0.0026276961,0.01147886,0.9726007,0.000030951225],"about_ca_topic_score_codex":0.002301609,"about_ca_topic_score_gemma":0.0032144943,"teacher_disagreement_score":0.060565516,"about_ca_system_score_codex":0.0009352664,"about_ca_system_score_gemma":0.0014103875,"threshold_uncertainty_score":0.20261186},"labels":[],"label_agreement":null},{"id":"W4285751350","doi":"10.1007/978-3-030-59710-8","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2020","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":154,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Multimedia; Data science; Computer graphics (images)","score_opus":0.008707190340137857,"score_gpt":0.2952506030000074,"score_spread":0.28654341265986955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285751350","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034252629,0.118530326,0.22045301,0.0069871126,0.037303012,0.00034378114,0.0031328434,0.0058270013,0.6039976],"genre_scores_gemma":[0.014814514,0.0491656,0.08593812,0.0010513216,0.009006844,0.00024422578,0.0039814813,0.0024480666,0.8333499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999193,0.000074445285,0.00003885134,0.00014713076,0.00049643044,0.0000500666],"domain_scores_gemma":[0.9989145,0.00021320597,0.000044983135,0.00012753958,0.00048936723,0.00021039354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335168,0.0017704371,0.00094877725,0.0028211505,0.0004485073,0.0023517555,0.0012869267,0.0012373974,0.060565516],"category_scores_gemma":[0.0019243393,0.0007035382,0.0006094144,0.002384871,0.000660642,0.0023585474,0.0020522997,0.0026583741,0.04325707],"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.00005189513,0.00003093939,0.00007767681,0.00029374554,0.000022974187,0.000025718315,0.000015739171,0.0019107737,0.0023153934,0.015985955,0.52499855,0.45427078],"study_design_scores_gemma":[0.000008480183,0.000059307033,0.0008793684,0.00015509862,0.000014914827,0.00038927252,0.00001108766,0.011744311,0.0026276961,0.01147886,0.9726007,0.000030951225],"about_ca_topic_score_codex":0.002301609,"about_ca_topic_score_gemma":0.0032144943,"teacher_disagreement_score":0.060565516,"about_ca_system_score_codex":0.0009352664,"about_ca_system_score_gemma":0.0014103875,"threshold_uncertainty_score":0.20261186},"labels":[],"label_agreement":null},{"id":"W4285817825","doi":"10.1007/978-3-031-10986-7_17","title":"CLINER: Clinical Interrogation Named Entity Recognition","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Interrogation; Dialog box; Computer science; Named-entity recognition; Information extraction; Context (archaeology); Task (project management); Artificial intelligence; Exploit; Natural language processing; Information retrieval; World Wide Web; Computer security","score_opus":0.06366758333984053,"score_gpt":0.3129572673007279,"score_spread":0.2492896839608874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285817825","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.006864625,0.0034854873,0.6776112,0.0028776808,0.0018556347,0.00078355067,0.036475755,0.19989914,0.07014699],"genre_scores_gemma":[0.07278485,0.002580227,0.7043473,0.0027837579,0.001108426,0.0009188334,0.093493804,0.01849214,0.10349066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876785,0.00029729784,0.00013425616,0.00032105733,0.0004038152,0.000075625685],"domain_scores_gemma":[0.9982584,0.00092293636,0.00008777102,0.00036813057,0.00025786663,0.0001048055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021542902,0.0013696287,0.0009169831,0.0022702096,0.00043331087,0.0025090193,0.002001497,0.0013619869,0.058210466],"category_scores_gemma":[0.0046618357,0.00069073006,0.0006683815,0.0019043674,0.0004978205,0.0029506919,0.0023475394,0.0015645467,0.050774958],"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.00017867192,0.00006321251,0.0006785403,0.00038239264,0.00004549185,0.0003249512,0.00017739023,0.001281675,0.0068223793,0.010496663,0.44218466,0.53736407],"study_design_scores_gemma":[0.00010109279,0.00011611642,0.0022192637,0.00030158577,0.00008765763,0.002673708,0.00020232379,0.054896567,0.04079043,0.042623684,0.8558535,0.00013398853],"about_ca_topic_score_codex":0.0010524923,"about_ca_topic_score_gemma":0.0014105836,"teacher_disagreement_score":0.058210466,"about_ca_system_score_codex":0.00052128267,"about_ca_system_score_gemma":0.0009021333,"threshold_uncertainty_score":0.19473338},"labels":[],"label_agreement":null},{"id":"W4285820037","doi":"10.1007/978-3-031-10986-7_13","title":"DISEL: A Language for Specifying DIS-Based Ontologies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"McMaster University","funders":"","keywords":"Computer science; Ontology; Process ontology; Upper ontology; Ontology components; Ontology-based data integration; XML; Programming language; Suggested Upper Merged Ontology; Ontology language; Web Ontology Language; Formalism (music); Syntax; Specification language; Natural language processing; Software engineering; Information retrieval; World Wide Web; Semantic Web","score_opus":0.030523220559942346,"score_gpt":0.2774552344374624,"score_spread":0.24693201387752006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285820037","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.0013240441,0.00022602113,0.9579525,0.00033697512,0.00013943376,0.00014481597,0.0055542346,0.019083567,0.01523849],"genre_scores_gemma":[0.06362059,0.0016514299,0.83176875,0.0010716134,0.00014072143,0.000945871,0.038475085,0.016066456,0.046259604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986583,0.00026575802,0.0003025388,0.00019290305,0.00046521286,0.000115224495],"domain_scores_gemma":[0.998579,0.0005665233,0.00012335954,0.00031724933,0.00032917812,0.000084771564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015258415,0.0017970701,0.00081501406,0.002414129,0.0011879926,0.005006342,0.0021863615,0.0013418403,0.016713446],"category_scores_gemma":[0.0038911116,0.0016823643,0.0015851024,0.0024463139,0.0013035161,0.007181844,0.003505703,0.002854378,0.009736863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013627607,0.000081570586,0.001131452,0.0011420604,0.00006804774,0.00062596967,0.0015185227,0.009180136,0.0077616163,0.7076819,0.11788503,0.15278742],"study_design_scores_gemma":[0.00003405886,0.000017811706,0.000159097,0.0001536843,0.000039399594,0.0005276239,0.00020734631,0.022139734,0.010460219,0.14389597,0.8222882,0.000076800054],"about_ca_topic_score_codex":0.007198397,"about_ca_topic_score_gemma":0.0117378235,"teacher_disagreement_score":0.016713446,"about_ca_system_score_codex":0.0016404229,"about_ca_system_score_gemma":0.0023707377,"threshold_uncertainty_score":0.055912018},"labels":[],"label_agreement":null},{"id":"W4287383862","doi":"10.1007/978-3-031-10548-7_31","title":"Security Evaluation Criteria of Open-Source Libraries","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Source code; Open source; Software engineering; Software; Code review; Process (computing); Code (set theory); Open source software; Static program analysis; Checklist; World Wide Web; Computer security; Database; Software development; Operating system; Programming language","score_opus":0.0364567715616366,"score_gpt":0.30967840584871315,"score_spread":0.2732216342870766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287383862","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.6532708,0.008149189,0.2602791,0.0011612355,0.00022227844,0.00080932426,0.0010858094,0.0013508602,0.073671475],"genre_scores_gemma":[0.9476263,0.0005928396,0.04553063,0.00004686591,0.00009199013,0.00012779923,0.0008253692,0.00009475809,0.005063479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99067163,0.002472624,0.0007227714,0.0003664616,0.0052525704,0.0005139489],"domain_scores_gemma":[0.959746,0.022846226,0.002504203,0.001538087,0.011701562,0.0016639087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007948666,0.0008281522,0.00080827455,0.009483308,0.0010878288,0.004234721,0.0009079168,0.0008439626,0.0039108223],"category_scores_gemma":[0.030770915,0.00022412362,0.0007689053,0.002912767,0.0010093907,0.0032853496,0.0015922906,0.0006744691,0.00061689224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003991862,0.000826631,0.057408426,0.0015404491,0.00026208133,0.0005625614,0.0009770422,0.060070638,0.03337691,0.12415221,0.015298109,0.701533],"study_design_scores_gemma":[0.00022436866,0.0023671775,0.043486368,0.000869145,0.00051682536,0.0012740915,0.0017107587,0.79337007,0.05325136,0.08282497,0.019925907,0.0001789526],"about_ca_topic_score_codex":0.0015698405,"about_ca_topic_score_gemma":0.0014660235,"teacher_disagreement_score":0.009483308,"about_ca_system_score_codex":0.0023428437,"about_ca_system_score_gemma":0.0015832983,"threshold_uncertainty_score":0.04203707},"labels":[],"label_agreement":null},{"id":"W4287383897","doi":"10.1007/978-3-031-11647-6_65","title":"Learning Optimal and Personalized Knowledge Component Sequencing Policies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Athabasca University","funders":"","keywords":"Computer science; Adaptation (eye); Component (thermodynamics); Adaptive learning; Personalized learning; Artificial intelligence; Context (archaeology); Path (computing); Machine learning; Sequence learning; Sequence (biology); Domain (mathematical analysis); Active learning (machine learning); Cooperative learning; Open learning; Teaching method","score_opus":0.021239807614209058,"score_gpt":0.27189961730151957,"score_spread":0.2506598096873105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287383897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10836302,0.0004083572,0.87977046,0.0008619517,0.000077327175,0.0001488262,0.00031106378,0.001346643,0.008712273],"genre_scores_gemma":[0.73082715,0.0005668664,0.25498635,0.00023686203,0.00011576343,0.00026197603,0.0008525997,0.00028272832,0.011869686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00026214027,0.00005670906,0.00032724973,0.00015392982,0.00014849978],"domain_scores_gemma":[0.99188024,0.006720081,0.00025113084,0.0005466115,0.00034254554,0.00025940916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018858219,0.00086355605,0.0011797374,0.00086230045,0.00049222104,0.0014966597,0.0014225724,0.0017050966,0.0070110783],"category_scores_gemma":[0.01347057,0.0009590047,0.0007644173,0.0010735395,0.00091848976,0.004285485,0.0014413497,0.0023494677,0.0009773104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005211393,0.00035422348,0.0018669115,0.00014223649,0.000051487037,0.000054738193,0.00015736608,0.69499004,0.0010672316,0.04257104,0.0057273908,0.25249612],"study_design_scores_gemma":[0.000024111432,0.000027244892,0.00013708879,0.000013385203,0.000011039049,0.000011350745,0.000026324233,0.94883513,0.0005091349,0.050015353,0.00038418785,0.000005672053],"about_ca_topic_score_codex":0.0051157433,"about_ca_topic_score_gemma":0.005317597,"teacher_disagreement_score":0.0070110783,"about_ca_system_score_codex":0.0016480279,"about_ca_system_score_gemma":0.0034021176,"threshold_uncertainty_score":0.023454428},"labels":[],"label_agreement":null},{"id":"W4287384489","doi":"10.1007/978-3-031-10548-7","title":"Computational Science and Its Applications – ICCSA 2022 Workshops","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"RIKEN; University of West Attica; Kauno Technologijos Universitetas; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Universitat Autònoma de Barcelona; Masarykova Univerzita; Università degli Studi di Perugia; Universidade do Minho; Universidad de Cádiz; Universidade Federal do Rio Grande do Norte; Università di Pisa; Universidade Federal de Minas Gerais; Università degli Studi Roma Tre; Università della Calabria; Regione Campania; Università degli Studi di Salerno; Silesian University of Technology; High Energy Accelerator Research Organization; Università degli Studi della Campania Luigi Vanvitelli; University of Aizu; Defence Science and Technology Group; Universidad de Oviedo; Technion-Israel Institute of Technology; ISCTE – Instituto Universitário de Lisboa; Università degli Studi dell'Aquila; Università degli Studi della Basilicata; Università degli Studi Mediterranea di Reggio Calabria; Luleå Tekniska Universitet; Universidade de Coimbra; Universidade de Lisboa; Uniwersytet Łódzki; Università degli Studi di Firenze; Università degli Studi di Sassari; Brock University; Università degli Studi di Parma; Universidade do Estado de Santa Catarina; Sapienza Università di Roma; Università degli Studi di Torino; Università degli Studi di Trento; Università degli Studi di Cagliari; Ege Üniversitesi; Università per Stranieri di Perugia; Universitatea \"Lucian Blaga\" din Sibiu; Università di Cagliari; Aristotle University of Thessaloniki; Indian Council of Agricultural Research; École Polytechnique Fédérale de Lausanne; La Trobe University; Universidade de Aveiro; Dipartimento della Protezione Civile, Presidenza del Consiglio dei Ministri; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Saint Petersburg State University; Bergische Universität Wuppertal; Università degli Studi di Brescia; Politecnico di Torino; National Institute of Technology Rourkela; Western Michigan University","keywords":"Computer science; Computational science; Software engineering","score_opus":0.055964432759194056,"score_gpt":0.34594589697061895,"score_spread":0.2899814642114249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287384489","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009706161,0.04743569,0.17074451,0.015212698,0.044938758,0.0005503851,0.0063047134,0.008119985,0.69698703],"genre_scores_gemma":[0.021971637,0.024379017,0.057413064,0.0015663938,0.008084405,0.00039196011,0.010100073,0.002783942,0.87330955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998611,0.00034669292,0.000051948344,0.00018277274,0.00063291227,0.00017473377],"domain_scores_gemma":[0.9972006,0.0004989755,0.00006662327,0.0005014734,0.001003436,0.00072891754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003406128,0.0015561315,0.0013779378,0.0023218687,0.0010120798,0.004622064,0.0019459577,0.0016276699,0.10500586],"category_scores_gemma":[0.0027949389,0.0007157612,0.0013043886,0.003149015,0.000626099,0.0024140659,0.0039800843,0.0029465298,0.07866121],"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.00012992157,0.00014881894,0.00017973979,0.00032280767,0.00003394544,0.00004984316,0.000048092996,0.0020665799,0.0021250185,0.011969068,0.8037267,0.17919952],"study_design_scores_gemma":[0.000015287456,0.000066436405,0.000687834,0.00022990213,0.000017512335,0.00013744536,0.000056581754,0.005757933,0.0015284376,0.011192092,0.980293,0.000017626307],"about_ca_topic_score_codex":0.0033043567,"about_ca_topic_score_gemma":0.006314945,"teacher_disagreement_score":0.10500586,"about_ca_system_score_codex":0.0012207807,"about_ca_system_score_gemma":0.003152431,"threshold_uncertainty_score":0.35127962},"labels":[],"label_agreement":null},{"id":"W4287384500","doi":"10.1007/978-3-031-11647-6_25","title":"Complex Learning Environments: Tensions in Student Perspectives that Indicate Competing Values","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online and Blended Learning","field":"Social Sciences","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 Alberta","funders":"","keywords":"Computer science; Online learning; Perception; Focus (optics); Learning environment; Virtual learning environment; Online course; Human–computer interaction; Multimedia; World Wide Web; Mathematics education; Psychology","score_opus":0.03568825544175897,"score_gpt":0.3191133486568855,"score_spread":0.28342509321512654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287384500","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.81969404,0.00075330934,0.016207153,0.0056862584,0.0002634281,0.00003836936,0.00010255313,0.00008368243,0.15717117],"genre_scores_gemma":[0.99530137,0.00012650558,0.0011742499,0.00020054793,0.000025413809,0.000019755484,0.000036645648,0.000033894885,0.0030814987],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9963321,0.0019748332,0.00008370535,0.0002438353,0.0010346853,0.00033078776],"domain_scores_gemma":[0.98790693,0.008142854,0.0011644632,0.00044205989,0.00084424217,0.0014994416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028718847,0.00024921686,0.00024779383,0.0010306289,0.0021511293,0.007704515,0.00074731477,0.001191495,0.0038946264],"category_scores_gemma":[0.014805286,0.00021099587,0.00021389124,0.0013941117,0.003351374,0.0049478,0.0058972123,0.0027858496,0.00049912854],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041102304,0.00023308005,0.023938017,0.00021950998,0.000047181067,0.0009273977,0.75627893,0.0003799863,0.009644895,0.10985148,0.010581248,0.087487295],"study_design_scores_gemma":[0.000044473694,0.0002698508,0.047863755,0.0002364519,0.00003972925,0.0014663701,0.80398107,0.0021867736,0.002653795,0.0721159,0.06905123,0.0000905709],"about_ca_topic_score_codex":0.00034227208,"about_ca_topic_score_gemma":0.0006997648,"teacher_disagreement_score":0.007704515,"about_ca_system_score_codex":0.0009822147,"about_ca_system_score_gemma":0.00074564945,"threshold_uncertainty_score":0.015188158},"labels":[],"label_agreement":null},{"id":"W4287384532","doi":"10.1007/978-3-031-11647-6_83","title":"Investigating the Role of Direct Instruction About the Notional Machine in Improving Novice Programmer Mental Models","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Notional amount; Computer science; Programmer; Construct (python library); Abstraction; Software engineering; Programming language; Artificial intelligence; Human–computer interaction","score_opus":0.015201274844876432,"score_gpt":0.23657632839469644,"score_spread":0.22137505354982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287384532","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.9870968,0.000120200406,0.004964312,0.00020829207,0.000013764618,0.00003289294,0.000026512977,0.00006393507,0.0074734027],"genre_scores_gemma":[0.99130285,0.000076344266,0.005942994,0.000050233706,0.0000033994088,0.000028880648,0.00003840893,0.000029933219,0.0025268793],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99956423,0.00020973502,0.000015349906,0.000100492616,0.00007651005,0.00003365917],"domain_scores_gemma":[0.9859,0.012121971,0.00049578125,0.0007349255,0.0004022889,0.00034503822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086874265,0.0002770569,0.0002224853,0.0001096162,0.00018853553,0.0013095028,0.00084592873,0.0006543423,0.0056981593],"category_scores_gemma":[0.018262483,0.00021651266,0.00017267904,0.00014610785,0.0005979264,0.0021936232,0.0006536302,0.0017558158,0.00046823855],"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.009337358,0.009033423,0.05538254,0.0013766176,0.0001575537,0.00046163204,0.023813123,0.013382432,0.23536137,0.028965704,0.0048350235,0.6178932],"study_design_scores_gemma":[0.0020116682,0.026878899,0.2328985,0.0005792621,0.0010268925,0.0015391897,0.020706082,0.276654,0.29574266,0.122595586,0.01908812,0.00027912806],"about_ca_topic_score_codex":0.0011573221,"about_ca_topic_score_gemma":0.0013224405,"teacher_disagreement_score":0.0056981593,"about_ca_system_score_codex":0.00028408237,"about_ca_system_score_gemma":0.0005697941,"threshold_uncertainty_score":0.01906228},"labels":[],"label_agreement":null},{"id":"W4287455646","doi":"10.1007/978-3-031-12670-3_19","title":"Q-VIPER: Quantitative Vertical Bitwise Algorithm to Mine Frequent Patterns","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Bitmap; Computer science; Database transaction; Data mining; Algorithm; Big data; Association rule learning; Bitwise operation; Information retrieval; Database; Artificial intelligence","score_opus":0.025681869737629343,"score_gpt":0.2803757633153318,"score_spread":0.25469389357770245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287455646","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.012368811,0.0005690112,0.9717401,0.00020449384,0.00017964662,0.00024171399,0.00317025,0.010149967,0.0013760515],"genre_scores_gemma":[0.05258015,0.00021952043,0.93701017,0.00014983033,0.000081673854,0.00033076384,0.0060577095,0.0005697909,0.0030003597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984755,0.00033002565,0.00018880342,0.00032945586,0.000552376,0.00012379918],"domain_scores_gemma":[0.9974533,0.0011976585,0.00018509442,0.0004526529,0.00061278755,0.00009846954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019971242,0.0011051601,0.0012144025,0.0039977217,0.00086442207,0.0016679927,0.0022822893,0.001311343,0.0146834],"category_scores_gemma":[0.008170812,0.00068390014,0.0011549602,0.0051015387,0.00054815336,0.002468179,0.0019796246,0.0016642483,0.0045773718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008544027,0.00019390725,0.0033926778,0.00082205207,0.00021018126,0.00018970357,0.00012954189,0.014635201,0.014096147,0.016096197,0.03206126,0.9173187],"study_design_scores_gemma":[0.0004026573,0.0005995503,0.0028605184,0.00018234021,0.000188058,0.0009996475,0.00017114746,0.85608804,0.025842607,0.08454582,0.028038025,0.0000815703],"about_ca_topic_score_codex":0.0010923409,"about_ca_topic_score_gemma":0.001572797,"teacher_disagreement_score":0.0146834,"about_ca_system_score_codex":0.00041104655,"about_ca_system_score_gemma":0.0016236849,"threshold_uncertainty_score":0.049120843},"labels":[],"label_agreement":null},{"id":"W4287455910","doi":"10.1007/978-3-031-12670-3_17","title":"Discovery of Keys for Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"McMaster University","funders":"","keywords":"Computer science; Data deduplication; Theoretical computer science; Key (lock); Graph; Modular decomposition; Object (grammar); Pathwidth; Artificial intelligence; Computer security; Line graph","score_opus":0.09635541844843103,"score_gpt":0.35710321165896763,"score_spread":0.2607477932105366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287455910","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.037497666,0.0021487367,0.9031263,0.0036170464,0.00059600646,0.00047529285,0.0050178384,0.0046149306,0.042906243],"genre_scores_gemma":[0.29000372,0.0033015783,0.6479608,0.0010988093,0.0003971584,0.0005208951,0.0116479695,0.0030158642,0.042053204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973564,0.00045609483,0.0002156931,0.00091170473,0.00076068053,0.00029949078],"domain_scores_gemma":[0.9883266,0.006350291,0.00045367642,0.0036407681,0.0008352117,0.00039343495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461261,0.0015394225,0.0016178349,0.003596585,0.001964137,0.0054479004,0.0029622654,0.002165211,0.017724473],"category_scores_gemma":[0.01744394,0.001626762,0.0030730169,0.004553392,0.0026843243,0.020209985,0.0068346504,0.004681129,0.0083591575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017586886,0.000074640906,0.0011368021,0.00080927764,0.00009797347,0.00033839906,0.00090099795,0.004600849,0.006282797,0.77490324,0.04242071,0.16825856],"study_design_scores_gemma":[0.000015059856,0.000016165082,0.00016869836,0.00008392364,0.00003918707,0.00021330535,0.00017631735,0.011023005,0.0024689818,0.9655722,0.02020163,0.00002162399],"about_ca_topic_score_codex":0.0014147438,"about_ca_topic_score_gemma":0.002110508,"teacher_disagreement_score":0.017724473,"about_ca_system_score_codex":0.0018351785,"about_ca_system_score_gemma":0.0014264461,"threshold_uncertainty_score":0.059294283},"labels":[],"label_agreement":null},{"id":"W4287887881","doi":"10.1007/978-3-031-11647-6_122","title":"Considering Disengaged Responses in Bayesian and Deep Knowledge Tracing","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 Alberta","funders":"","keywords":"Disengagement theory; Tracing; Computer science; Baseline (sea); Machine learning; Artificial intelligence; Bayesian probability","score_opus":0.026726602918411255,"score_gpt":0.26038647827038314,"score_spread":0.23365987535197189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287887881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10350991,0.0002943111,0.88381547,0.0008966087,0.0000650568,0.000044003224,0.00009430802,0.00031067219,0.010969713],"genre_scores_gemma":[0.91026974,0.00024797057,0.07666699,0.0001482541,0.00005955199,0.000050353105,0.00009855942,0.00017291978,0.012285657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734867,0.0011710672,0.00014469586,0.0004727203,0.0005455544,0.00031727576],"domain_scores_gemma":[0.94887763,0.043109093,0.0017472471,0.0031999932,0.0020713564,0.0009945862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005385329,0.0005557055,0.00080624147,0.001020509,0.00080126734,0.0034875034,0.002408716,0.0031146205,0.007984693],"category_scores_gemma":[0.06750373,0.00086912315,0.0007142281,0.0012076308,0.0018885685,0.009697653,0.003914158,0.0033363237,0.00071986427],"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.0007557265,0.00018207903,0.0054388526,0.00020399879,0.00011159284,0.0006094035,0.0023766286,0.20291705,0.0029508902,0.62695843,0.0014770394,0.15601826],"study_design_scores_gemma":[0.00001782482,0.000039523395,0.00049116806,0.000033655346,0.000027784297,0.0000793939,0.0001597914,0.5204308,0.0011615087,0.47669932,0.0008366668,0.000022556935],"about_ca_topic_score_codex":0.005282491,"about_ca_topic_score_gemma":0.0036189056,"teacher_disagreement_score":0.007984693,"about_ca_system_score_codex":0.0014323571,"about_ca_system_score_gemma":0.001529369,"threshold_uncertainty_score":0.028480649},"labels":[],"label_agreement":null},{"id":"W4287890484","doi":"10.1007/978-3-031-11647-6_31","title":"Where Is the AI? AI Literacy for Educators","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":28,"is_retracted":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":"Promotion (chess); Computer science; Inclusion (mineral); Scholarship; Literacy; Engineering ethics; Information literacy; Reading (process); Mathematics education; Pedagogy; Psychology; World Wide Web; Sociology; Political science; Engineering; Social science","score_opus":0.027542670874943546,"score_gpt":0.3622616853887714,"score_spread":0.33471901451382785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287890484","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.010782559,0.03430756,0.0123954015,0.26040205,0.0038163108,0.00003487439,0.00006115698,0.00014911126,0.67805105],"genre_scores_gemma":[0.3561238,0.03897019,0.016509896,0.04364709,0.0023102404,0.00018888559,0.00014134981,0.00021142505,0.5418972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852645,0.00075815833,0.000052166848,0.00012276274,0.0003438566,0.0001965612],"domain_scores_gemma":[0.99474573,0.003186548,0.00018877782,0.00022031416,0.000805795,0.0008529312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002501743,0.00031905816,0.00037943214,0.0011090867,0.0030305984,0.009597641,0.00055937225,0.003098698,0.0143829705],"category_scores_gemma":[0.00798993,0.00030964898,0.00021208607,0.00096103945,0.0063766693,0.012652989,0.0035402605,0.006343152,0.0030807748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015654598,0.000110885034,0.0010229115,0.0002671481,0.000004370211,0.0002272559,0.021752391,0.00012093792,0.00036473275,0.6766965,0.1344775,0.16493978],"study_design_scores_gemma":[0.000005032945,0.000025033029,0.00060377055,0.0013032984,0.000005194228,0.0002822564,0.019620022,0.00019129904,0.00035207736,0.3238783,0.65372205,0.000011547552],"about_ca_topic_score_codex":0.0035248338,"about_ca_topic_score_gemma":0.0074969693,"teacher_disagreement_score":0.0143829705,"about_ca_system_score_codex":0.002561961,"about_ca_system_score_gemma":0.006864272,"threshold_uncertainty_score":0.04811579},"labels":[],"label_agreement":null},{"id":"W4288468691","doi":"10.1007/978-3-031-12673-4_5","title":"Semantic Annotation of Parliamentary Debates and Legislative Intelligence Enhancing Citizen Experience","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","field":"Social Sciences","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Suite; Annotation; Process (computing); Legislature; World Wide Web; Data science; Software engineering; Knowledge management; Artificial intelligence; Political science; Programming language; Law","score_opus":0.02135657144962537,"score_gpt":0.28452524552724423,"score_spread":0.26316867407761885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288468691","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.190751,0.0017235897,0.46689007,0.0046032337,0.0010589557,0.00043126475,0.007208649,0.007679695,0.3196536],"genre_scores_gemma":[0.75551796,0.00076829235,0.18761994,0.00040693997,0.0002733825,0.00025947494,0.017411675,0.0014543452,0.036288053],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800605,0.0010071411,0.00013262725,0.00030052528,0.00040839097,0.00014525815],"domain_scores_gemma":[0.9960962,0.0022731214,0.0002583642,0.000555619,0.00067606935,0.000140531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016671863,0.00043797566,0.00034585161,0.0027933936,0.001541019,0.00469008,0.0008904613,0.001087128,0.0149577195],"category_scores_gemma":[0.007601699,0.00033416643,0.0007375287,0.0034277416,0.0013290865,0.0072652744,0.002237638,0.0014990553,0.0036793496],"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.000870419,0.0006100133,0.008597514,0.0010954743,0.00007891862,0.00067721686,0.020401781,0.008273062,0.01609284,0.4052178,0.054039083,0.48404583],"study_design_scores_gemma":[0.0000631376,0.00012604125,0.015211869,0.00058666075,0.0001771956,0.00055536383,0.014783568,0.12758975,0.027079059,0.30862185,0.5050855,0.000120017685],"about_ca_topic_score_codex":0.0036910358,"about_ca_topic_score_gemma":0.0067402413,"teacher_disagreement_score":0.0149577195,"about_ca_system_score_codex":0.0012297824,"about_ca_system_score_gemma":0.0016534604,"threshold_uncertainty_score":0.050038576},"labels":[],"label_agreement":null},{"id":"W4288472938","doi":"10.1007/978-3-031-12426-6_22","title":"ARDBS: Efficient Processing of Provenance Queries Over Annotated Relations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Computer science; SQL; Semantics (computer science); Base (topology); Rewriting; Class (philosophy); Relational database; Extension (predicate logic); Information retrieval; Database; Programming language; Artificial intelligence","score_opus":0.05081578591810713,"score_gpt":0.32617775450447717,"score_spread":0.27536196858637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288472938","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.01151925,0.0014294218,0.83117247,0.00081608765,0.0005778664,0.00078554644,0.017063709,0.13012765,0.006508101],"genre_scores_gemma":[0.11156221,0.0015322875,0.81109595,0.00054619246,0.0003043748,0.00056933775,0.048918217,0.011514312,0.013957134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959857,0.000662587,0.0004855798,0.0005840641,0.0020603917,0.00022173279],"domain_scores_gemma":[0.99192095,0.0032438305,0.00042326006,0.0028568858,0.0012613155,0.00029376443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004141692,0.0015180389,0.0016444048,0.0038254212,0.0012840121,0.0056843357,0.003165195,0.0012388893,0.0143059455],"category_scores_gemma":[0.014143103,0.0014952609,0.001751953,0.004816237,0.0011987066,0.0071413317,0.004577728,0.0020641673,0.005730516],"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.0019685875,0.0004099478,0.0026924433,0.0017446468,0.00028235043,0.0006670865,0.0014662774,0.017807554,0.03149136,0.06815079,0.23121192,0.6421072],"study_design_scores_gemma":[0.00079587713,0.0003874647,0.002280348,0.0005234399,0.00023328002,0.0010550891,0.0010222559,0.44676292,0.08386272,0.17886618,0.28386542,0.000344912],"about_ca_topic_score_codex":0.010526101,"about_ca_topic_score_gemma":0.010602268,"teacher_disagreement_score":0.0143059455,"about_ca_system_score_codex":0.0012607841,"about_ca_system_score_gemma":0.0026702376,"threshold_uncertainty_score":0.04785818},"labels":[],"label_agreement":null},{"id":"W4288781673","doi":"10.1007/978-3-031-12748-9_5","title":"DL-CapsNet: A Deep and Light Capsule Network","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Affine transformation; Automatic summarization; Deep learning; Pattern recognition (psychology); Inference; Process (computing); Mathematics","score_opus":0.012040986194202028,"score_gpt":0.23367137156207302,"score_spread":0.221630385367871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288781673","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.03216222,0.0030526957,0.8255394,0.0022790718,0.0021106482,0.0003775115,0.010844903,0.06996619,0.053667404],"genre_scores_gemma":[0.253514,0.0021040568,0.5931984,0.003137775,0.00053329073,0.00056437147,0.029413851,0.0059452583,0.11158904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981195,0.000020898753,0.000008470306,0.00006881259,0.000055667173,0.00003425701],"domain_scores_gemma":[0.9996649,0.00005782328,0.000015772013,0.00009099847,0.000110125366,0.000060386552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955128,0.0014196864,0.00058800745,0.00067277363,0.00045298444,0.001165968,0.0027062227,0.0012408143,0.020496042],"category_scores_gemma":[0.0012968045,0.00063684303,0.00059042894,0.0008152114,0.0004628872,0.0022604312,0.0018156352,0.0021720612,0.0093420055],"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.00051933574,0.00028254034,0.00070085994,0.0003667148,0.0001466169,0.00016120462,0.00004142415,0.079342164,0.012174659,0.0181488,0.24075937,0.6473563],"study_design_scores_gemma":[0.000095757656,0.00017447623,0.000301465,0.000060941908,0.000056329594,0.00009990188,0.000029990946,0.8920627,0.020245573,0.024062134,0.062775224,0.000035516907],"about_ca_topic_score_codex":0.010324926,"about_ca_topic_score_gemma":0.02067822,"teacher_disagreement_score":0.020496042,"about_ca_system_score_codex":0.000946589,"about_ca_system_score_gemma":0.0012611005,"threshold_uncertainty_score":0.068566084},"labels":[],"label_agreement":null},{"id":"W4288860568","doi":"10.1007/978-3-030-32248-9","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2019","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":540,"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":"Computer science; Intervention (counseling); Medical imaging; Multimedia; Data science; Medical physics; Human–computer interaction; Artificial intelligence; Medicine","score_opus":0.00762688133724588,"score_gpt":0.29620353554551576,"score_spread":0.2885766542082699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288860568","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00390817,0.14164001,0.22371848,0.009585126,0.057144895,0.0004034796,0.0035287493,0.0049877684,0.55508333],"genre_scores_gemma":[0.01268381,0.055489004,0.062243517,0.0011917815,0.011092808,0.00019315163,0.0033479463,0.0016868811,0.85207117],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992743,0.000059043206,0.000043904558,0.0001505316,0.00042787564,0.000044242915],"domain_scores_gemma":[0.99897027,0.00020755893,0.000050675528,0.00012411391,0.0004561885,0.00019113513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099314,0.0014455195,0.0010464978,0.0030202044,0.00047447783,0.0025824034,0.0012029593,0.0011782865,0.0639509],"category_scores_gemma":[0.0016658066,0.00067940605,0.0006309893,0.0027764232,0.0006938034,0.0022909476,0.0020766004,0.0027648835,0.042948436],"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.000046524037,0.00003296438,0.00009793392,0.0003614773,0.000025016303,0.000035365956,0.000015887748,0.0015581849,0.0024981971,0.015672917,0.4739632,0.50569236],"study_design_scores_gemma":[0.0000076026495,0.00004645184,0.0008885507,0.00019527714,0.00001655756,0.00045926665,0.00001233967,0.008114946,0.0018747973,0.011549713,0.97680455,0.000029858315],"about_ca_topic_score_codex":0.002028639,"about_ca_topic_score_gemma":0.0033468667,"teacher_disagreement_score":0.0639509,"about_ca_system_score_codex":0.001067136,"about_ca_system_score_gemma":0.0013076682,"threshold_uncertainty_score":0.21393704},"labels":[],"label_agreement":null},{"id":"W4289323664","doi":"10.1007/978-3-031-11488-5_11","title":"BoxOff is NP-Complete","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Colored; Rectangle; Computer science; Boolean satisfiability problem; Satisfiability; NP-complete; Computational complexity theory; Algorithm; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Geometry; Law","score_opus":0.03969446407276851,"score_gpt":0.27460624047377985,"score_spread":0.23491177640101135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289323664","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.12990604,0.0034861295,0.23731941,0.008257426,0.0017232053,0.00058415515,0.0080943005,0.0017862648,0.6088431],"genre_scores_gemma":[0.605765,0.00524694,0.09124238,0.0025180038,0.0008394783,0.0009962256,0.010713019,0.0009855408,0.28169346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945635,0.000052683714,0.000030219222,0.00013596143,0.00016860235,0.00015614984],"domain_scores_gemma":[0.9981426,0.0013301256,0.00010056659,0.00011088689,0.0002162536,0.000099662626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055602,0.0010663499,0.0018125759,0.0007999932,0.0021934563,0.0034743438,0.001250322,0.0017336955,0.029317971],"category_scores_gemma":[0.0021276553,0.00068542635,0.0014023689,0.0014673197,0.001645241,0.0060612406,0.0016203352,0.004383895,0.005269241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074553146,0.00031641545,0.0007851451,0.0013844112,0.000096643555,0.0006556399,0.00033629496,0.022831475,0.0063095647,0.75185883,0.09190533,0.122774765],"study_design_scores_gemma":[0.00012857666,0.000063518055,0.00036203288,0.00013918451,0.000051030158,0.00045260758,0.00024133132,0.022873875,0.0035612704,0.9161189,0.055976685,0.00003095481],"about_ca_topic_score_codex":0.0026698604,"about_ca_topic_score_gemma":0.0031980781,"teacher_disagreement_score":0.029317971,"about_ca_system_score_codex":0.0012781213,"about_ca_system_score_gemma":0.001559648,"threshold_uncertainty_score":0.09807837},"labels":[],"label_agreement":null},{"id":"W4289356281","doi":"10.1007/978-3-031-11488-5_13","title":"On the Road to Perfection? Evaluating Leela Chess Zero Against Endgame Tablebases","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Chess endgame; Heuristics; Computer science; Zero (linguistics); Perfection; Artificial intelligence; Epistemology","score_opus":0.05198616385661934,"score_gpt":0.30933623630099566,"score_spread":0.2573500724443763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289356281","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.8393385,0.003345561,0.042988326,0.0037307641,0.0008409071,0.000214499,0.002369432,0.0030642443,0.10410788],"genre_scores_gemma":[0.9714267,0.00015127644,0.015028232,0.00020690766,0.00004670669,0.000032069278,0.0018604659,0.00017515503,0.011072525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978611,0.0009243278,0.00012966589,0.00032524997,0.00059438427,0.00016530897],"domain_scores_gemma":[0.9906908,0.0068435147,0.00035498556,0.00064777397,0.0009501179,0.00051279116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036200255,0.0007501006,0.0008556442,0.00091597415,0.00063748646,0.003248907,0.0012193873,0.001267449,0.015443819],"category_scores_gemma":[0.025782367,0.0002735015,0.0002641079,0.00044961876,0.00070956326,0.0038121138,0.0016429604,0.0014824126,0.0020518955],"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.009217362,0.0011008767,0.043849144,0.00083744456,0.000434521,0.00023069646,0.00078763353,0.12555756,0.0074534994,0.060601577,0.122615315,0.6273143],"study_design_scores_gemma":[0.000625287,0.0027673268,0.023682885,0.00033562275,0.0001788026,0.00022396672,0.001358969,0.8699946,0.010437101,0.05749062,0.032817107,0.000087697175],"about_ca_topic_score_codex":0.009765313,"about_ca_topic_score_gemma":0.019900197,"teacher_disagreement_score":0.015443819,"about_ca_system_score_codex":0.0012623708,"about_ca_system_score_gemma":0.0011068227,"threshold_uncertainty_score":0.05166477},"labels":[],"label_agreement":null},{"id":"W4289922222","doi":"10.1007/978-3-031-13188-2_23","title":"Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Soundness; Petri net; Computer science; Workflow; Reachability; Formalism (music); Scalability; Business process; Data mining; Theoretical computer science; Programming language; Algorithm; Database; Work in process; Engineering","score_opus":0.0198667367749768,"score_gpt":0.22760801028251235,"score_spread":0.20774127350753555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289922222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043579146,0.000111208865,0.9512945,0.000275441,0.00005539407,0.00021090698,0.00019096461,0.0012240276,0.00305839],"genre_scores_gemma":[0.5325133,0.00023643114,0.46356174,0.00025204968,0.000077978206,0.0003241854,0.00062929693,0.00043543987,0.0019695382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98933417,0.0036636651,0.0009438832,0.001963766,0.0031950395,0.0008994507],"domain_scores_gemma":[0.9361481,0.051440917,0.0029040033,0.005191223,0.0033545024,0.0009612355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009664196,0.0009207982,0.0011776155,0.0012254822,0.0008187961,0.0031096453,0.0022594193,0.0011799487,0.0033823252],"category_scores_gemma":[0.048744783,0.0011625688,0.0031997294,0.0009070993,0.0058873417,0.0043504587,0.004861626,0.006067518,0.0007221991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012791253,0.00041399023,0.002228168,0.0010956413,0.00029186826,0.0009214451,0.0014839126,0.45515966,0.05041396,0.37784573,0.0024040185,0.10646247],"study_design_scores_gemma":[0.00013235467,0.00021527552,0.00045113146,0.00013091115,0.000084179024,0.00018475365,0.00021137754,0.6316539,0.019740785,0.34468767,0.0024369417,0.0000706956],"about_ca_topic_score_codex":0.0029161244,"about_ca_topic_score_gemma":0.0025823948,"teacher_disagreement_score":0.009664196,"about_ca_system_score_codex":0.0016729907,"about_ca_system_score_gemma":0.0035133127,"threshold_uncertainty_score":0.05110973},"labels":[],"label_agreement":null},{"id":"W4289924505","doi":"10.1007/978-3-031-13188-2_7","title":"Sound Automation of Magic Wands","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; HOL; Algorithm; MAGIC (telescope); Morphism; Programming language; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.020974985870182872,"score_gpt":0.24604123222100147,"score_spread":0.2250662463508186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289924505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040573154,0.000082605926,0.9466032,0.00027173277,0.000055334523,0.00010559474,0.000094367904,0.0060840934,0.0061299494],"genre_scores_gemma":[0.46286288,0.00012427013,0.5269582,0.00035395136,0.00004348949,0.00018314474,0.0004445421,0.0015325729,0.007496931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995411,0.0011822357,0.00028673586,0.0010563075,0.0012556518,0.0008081639],"domain_scores_gemma":[0.99291503,0.003920532,0.00033963728,0.001567643,0.0010095543,0.0002476292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026608873,0.0008882589,0.0009439182,0.0011769123,0.0013311051,0.0020358611,0.0018840554,0.0013131209,0.0076143504],"category_scores_gemma":[0.009816763,0.0012349454,0.002154731,0.0007443598,0.0044692177,0.0045383177,0.005202098,0.0034040795,0.0014651191],"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.0007030064,0.00026471805,0.003103683,0.00047075909,0.00009450072,0.0006976826,0.001598629,0.04794034,0.036868382,0.7164392,0.006728083,0.185091],"study_design_scores_gemma":[0.00017276082,0.00033313764,0.0007591942,0.00019861186,0.00013040147,0.0003543267,0.00039652293,0.27382812,0.07409485,0.6225396,0.027079431,0.000113109505],"about_ca_topic_score_codex":0.0022227406,"about_ca_topic_score_gemma":0.0024037503,"teacher_disagreement_score":0.0076143504,"about_ca_system_score_codex":0.0013317176,"about_ca_system_score_gemma":0.0018928571,"threshold_uncertainty_score":0.025472522},"labels":[],"label_agreement":null},{"id":"W4290017147","doi":"10.1007/978-3-031-13502-6_7","title":"PSPACE-Completeness of Reversible Deterministic Systems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Gadget; Mathematical proof; Completeness (order theory); Computer science; Mathematics; Discrete mathematics; Algorithm; Computational complexity theory","score_opus":0.026799192136958166,"score_gpt":0.24710742989923476,"score_spread":0.2203082377622766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290017147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16415802,0.0026032226,0.5118164,0.006811425,0.00035253068,0.00037900315,0.0029072224,0.0020532198,0.30891898],"genre_scores_gemma":[0.88774306,0.0014998646,0.046176884,0.00074402423,0.00021144633,0.00038953478,0.0021395623,0.00040416344,0.060691446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998552,0.00034207889,0.00008451629,0.00030068625,0.0004727153,0.00024804426],"domain_scores_gemma":[0.9954656,0.0033524767,0.000104287465,0.0005686091,0.00037861898,0.00013038694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013080032,0.00069344544,0.001122399,0.0005616573,0.002098768,0.0031451555,0.0021988333,0.001367727,0.0119515],"category_scores_gemma":[0.0050084544,0.00090702024,0.0013991765,0.0011022268,0.003060664,0.005110436,0.0024057317,0.004796098,0.0013828415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013982557,0.000076539,0.00020930635,0.0003459881,0.000043090196,0.00011653154,0.0003806189,0.043439943,0.003200485,0.92362773,0.0050009633,0.023419],"study_design_scores_gemma":[0.000042232026,0.000013229768,0.00009083053,0.000017201735,0.000010365345,0.00003057672,0.000046153797,0.022790588,0.0021870255,0.9701569,0.0046064756,0.0000085943375],"about_ca_topic_score_codex":0.003973887,"about_ca_topic_score_gemma":0.004489205,"teacher_disagreement_score":0.0119515,"about_ca_system_score_codex":0.002488154,"about_ca_system_score_gemma":0.002699915,"threshold_uncertainty_score":0.039981782},"labels":[],"label_agreement":null},{"id":"W4290087445","doi":"10.1007/978-3-031-13185-1_2","title":"Program Verification with Constrained Horn Clauses (Invited Paper)","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Horn clause; Computer science; Satisfiability; Programming language; Boolean satisfiability problem; Satisfiability modulo theories; Fragment (logic); Formal verification; Solver; Type inference; Model checking; Automated theorem proving; Theoretical computer science; Software verification; Inference; Algorithm; Prolog; Artificial intelligence; Software","score_opus":0.024336521792334805,"score_gpt":0.27434275704658523,"score_spread":0.2500062352542504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290087445","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.01111479,0.0073378677,0.9183724,0.0025204131,0.0013671047,0.00016704532,0.0005294023,0.0019344722,0.056656476],"genre_scores_gemma":[0.25660977,0.011558477,0.5971296,0.0024102388,0.0008747161,0.00027307298,0.0026228623,0.0014083429,0.12711297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.000115170486,0.000023234867,0.00010889823,0.00018486094,0.000040207633],"domain_scores_gemma":[0.999278,0.00049593986,0.000022996303,0.000057124882,0.0001224621,0.000023501421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964442,0.00041001415,0.00027888687,0.00061334216,0.00028381732,0.0010738847,0.00055288634,0.00050781516,0.014011239],"category_scores_gemma":[0.0021039376,0.00028068907,0.00052105886,0.0011272164,0.00065987115,0.001340494,0.0006890197,0.0009785701,0.0024242604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015248763,0.00007635765,0.00040033777,0.00076736783,0.00004684913,0.0003588673,0.00034885792,0.01596717,0.01741336,0.4882926,0.07372406,0.40245166],"study_design_scores_gemma":[0.000085425236,0.00007594495,0.00063427794,0.00042054072,0.000057379093,0.0007155689,0.00012150408,0.089434266,0.0337534,0.4677232,0.40693521,0.00004329231],"about_ca_topic_score_codex":0.0018069192,"about_ca_topic_score_gemma":0.0017765049,"teacher_disagreement_score":0.014011239,"about_ca_system_score_codex":0.00073083484,"about_ca_system_score_gemma":0.00079248287,"threshold_uncertainty_score":0.04687226},"labels":[],"label_agreement":null},{"id":"W4290669654","doi":"10.1007/11867661","title":"Image Analysis and Recognition","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.011866757002449236,"score_gpt":0.2204167698162916,"score_spread":0.20855001281384236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290669654","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019960145,0.010239123,0.82887495,0.0005349094,0.0015977978,0.00025496783,0.00150668,0.0135038085,0.14149173],"genre_scores_gemma":[0.01938079,0.011385339,0.33635896,0.0007050806,0.0006414578,0.00030191636,0.0050546336,0.0018911631,0.6242807],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995945,0.000018599934,0.000019371664,0.000104619205,0.00023549651,0.00002734454],"domain_scores_gemma":[0.99963045,0.000045588415,0.000013207765,0.00013625136,0.00015396351,0.000020464724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034316388,0.0013396498,0.0011009927,0.0018286714,0.0004508613,0.0017393627,0.0015648609,0.0009592464,0.08801275],"category_scores_gemma":[0.0006157664,0.00056560524,0.000691701,0.0016678561,0.00054437487,0.0012912264,0.001156115,0.0008940515,0.11448003],"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.00004224272,0.000033640277,0.00007826979,0.00027271986,0.000024890638,0.000057111352,0.00002899459,0.00088615203,0.033838622,0.0088148555,0.10785643,0.84806615],"study_design_scores_gemma":[0.000012765017,0.00008783837,0.001009372,0.0001021198,0.000046640867,0.0008725844,0.00003901743,0.01183233,0.066858694,0.011954305,0.9071428,0.000041500105],"about_ca_topic_score_codex":0.0008470313,"about_ca_topic_score_gemma":0.0013346252,"teacher_disagreement_score":0.08801275,"about_ca_system_score_codex":0.00031885382,"about_ca_system_score_gemma":0.00051612075,"threshold_uncertainty_score":0.29443198},"labels":[],"label_agreement":null},{"id":"W4291108983","doi":"10.1007/978-3-319-03841-4_13","title":"On Balanced -Contact Representations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar; Planar graph; Vertex (graph theory); Graph; Physics; Representation (politics); Mathematics; Computer science; Computer graphics (images)","score_opus":0.01714351726157777,"score_gpt":0.26131635969327727,"score_spread":0.2441728424316995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291108983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076721884,0.0012077738,0.55548066,0.001194181,0.00082912954,0.000097128046,0.00053650996,0.0009355445,0.36299726],"genre_scores_gemma":[0.664506,0.0019577686,0.112174824,0.00077290105,0.0008096744,0.00020271359,0.0016783876,0.0017207714,0.21617694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967504,0.00006289232,0.000016464595,0.00005758393,0.00013545917,0.00005253613],"domain_scores_gemma":[0.9997023,0.000062460254,0.000036062487,0.00008046663,0.000067851135,0.00005084079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571645,0.0008424317,0.00062509347,0.0016160274,0.0009508052,0.0021441379,0.0008601221,0.0010255142,0.026817301],"category_scores_gemma":[0.0014251799,0.0003496072,0.0004626155,0.0014399531,0.0012066282,0.0037518349,0.0025574847,0.0022671367,0.00573475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001630033,0.000014703274,0.000033742454,0.000021671132,0.000002345407,0.00002566212,0.000081236336,0.00093643443,0.0007122948,0.9726456,0.0033809342,0.022129113],"study_design_scores_gemma":[0.0000074280642,0.000013157352,0.00005575721,0.000018229062,0.0000034634556,0.00006434087,0.0000578679,0.008899693,0.00045830396,0.9771867,0.0132293105,0.000005751553],"about_ca_topic_score_codex":0.0005457498,"about_ca_topic_score_gemma":0.0007519374,"teacher_disagreement_score":0.026817301,"about_ca_system_score_codex":0.0006171539,"about_ca_system_score_gemma":0.00025731316,"threshold_uncertainty_score":0.0897128},"labels":[],"label_agreement":null},{"id":"W4291270603","doi":"10.1007/978-3-031-14714-2_6","title":"Adaptive Function Value Warping for Surrogate Model Assisted Evolutionary Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Surrogate model; Image warping; Mathematical optimization; Evolutionary algorithm; Function (biology); Bellman equation; Sensitivity (control systems); Black box; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.027269641510260293,"score_gpt":0.2562967161073696,"score_spread":0.2290270745971093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291270603","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.005268846,0.00032278316,0.98841816,0.00007014971,0.00007664718,0.000020463363,0.000023652543,0.0002466368,0.0055526076],"genre_scores_gemma":[0.29781038,0.00060323405,0.6869701,0.00016442787,0.00007671689,0.00019957154,0.00020588245,0.00052212225,0.013447548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997515,0.000092689486,0.000008985919,0.00002738407,0.000102576385,0.000016843025],"domain_scores_gemma":[0.9996631,0.00017957263,0.000019988644,0.00006548876,0.00005867251,0.000013226411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572182,0.00062581233,0.0007219817,0.00043763279,0.00023447695,0.0006962712,0.0009595887,0.001155668,0.0044757463],"category_scores_gemma":[0.0018506319,0.0004234064,0.00060498813,0.0006728368,0.00045768882,0.0007280116,0.0012107602,0.001484458,0.0010096966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000603269,0.000051013765,0.00015245068,0.000092572955,0.00004447523,0.00007860147,0.000051423583,0.7984613,0.010639532,0.023295578,0.0025510082,0.16452178],"study_design_scores_gemma":[0.0000022733166,0.000014250257,0.000029630264,0.000005840869,0.0000021017845,0.0000185615,0.0000025854906,0.9935736,0.0009779395,0.0039039874,0.0014661555,0.000003018631],"about_ca_topic_score_codex":0.0003891432,"about_ca_topic_score_gemma":0.00043937654,"teacher_disagreement_score":0.0044757463,"about_ca_system_score_codex":0.0002801116,"about_ca_system_score_gemma":0.0002511068,"threshold_uncertainty_score":0.014972866},"labels":[],"label_agreement":null},{"id":"W4291302232","doi":"10.1007/978-3-031-13829-4_51","title":"Covid-19 Detection by Wavelet Entropy and Genetic Algorithm","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Computer science; Coronavirus disease 2019 (COVID-19); Wavelet; Entropy (arrow of time); Algorithm; Wavelet transform; Genetic algorithm; Artificial intelligence; Data mining; Pattern recognition (psychology); Machine learning; Pathology; Medicine","score_opus":0.016518686099077442,"score_gpt":0.27793577361324334,"score_spread":0.2614170875141659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291302232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036282446,0.00047413752,0.95596683,0.000266566,0.00012857217,0.0000899532,0.00014590715,0.0009723011,0.005673297],"genre_scores_gemma":[0.37380287,0.00038310047,0.6154908,0.00018654346,0.00009731037,0.000097422904,0.00061489193,0.00022680325,0.009100267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921286,0.00013110049,0.00004576173,0.0001668288,0.00034157367,0.00010181966],"domain_scores_gemma":[0.99907184,0.00043689247,0.00008623212,0.000080542064,0.0002866512,0.00003780414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011796284,0.00076730194,0.0010938795,0.0026796907,0.0005569434,0.001585626,0.0011094592,0.0014590159,0.0022771542],"category_scores_gemma":[0.0034229236,0.00033304692,0.00084908743,0.0013433269,0.0005457659,0.0009810798,0.0011235912,0.0008673679,0.0012337269],"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.0004012761,0.00017773088,0.0055577094,0.00011105623,0.00011349854,0.00032185102,0.00008305932,0.111298405,0.0354484,0.016265796,0.0061999755,0.8240212],"study_design_scores_gemma":[0.000012449266,0.000049190912,0.0014296954,0.000016208174,0.000028563369,0.00021220351,0.000022487526,0.9781804,0.011704493,0.006649837,0.0016769,0.000017661101],"about_ca_topic_score_codex":0.0028390072,"about_ca_topic_score_gemma":0.0020347522,"teacher_disagreement_score":0.0028390072,"about_ca_system_score_codex":0.00075757445,"about_ca_system_score_gemma":0.0008572706,"threshold_uncertainty_score":0.007617891},"labels":[],"label_agreement":null},{"id":"W4291302264","doi":"10.1007/978-3-031-13870-6_35","title":"A Systematic Study for the Effects of PCA on Hyperspectral Imagery Denoising","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hyperspectral imaging; Noise reduction; Principal component analysis; Computer science; Artificial intelligence; Pattern recognition (psychology); Noise (video); Video denoising; Wavelet; Block (permutation group theory); Computer vision; Matching (statistics); Image (mathematics); Mathematics; Video processing; Statistics; Video tracking","score_opus":0.018967257845856175,"score_gpt":0.27669302365248993,"score_spread":0.25772576580663376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291302264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039082058,0.017235208,0.92353153,0.0002993429,0.00022018634,0.00017105156,0.00027532954,0.00050624844,0.018678922],"genre_scores_gemma":[0.2852403,0.04164237,0.6308576,0.0005623147,0.00048649008,0.00025817563,0.00091264764,0.0009323127,0.03910783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939096,0.00015493,0.000031224827,0.00011513025,0.0002798427,0.00002795518],"domain_scores_gemma":[0.998538,0.0007298179,0.00009262856,0.00020785112,0.00041140066,0.000020312622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007982315,0.00089766225,0.0008001419,0.0009196198,0.0004579417,0.0008524371,0.0005270728,0.0006827527,0.003034837],"category_scores_gemma":[0.0027987303,0.00032269853,0.0010625235,0.0013308434,0.0006030316,0.0010836052,0.0005512136,0.00090540515,0.0008863655],"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.0002733725,0.00028545398,0.0021550916,0.0029834847,0.0002870611,0.00046855226,0.00033022385,0.028962146,0.36674836,0.076893955,0.0054341303,0.5151781],"study_design_scores_gemma":[0.000027933616,0.0005998889,0.009664353,0.00064199115,0.00054527784,0.0023446898,0.00020096367,0.3725005,0.5062739,0.054714482,0.05233684,0.00014903564],"about_ca_topic_score_codex":0.0009579713,"about_ca_topic_score_gemma":0.0015323529,"teacher_disagreement_score":0.003034837,"about_ca_system_score_codex":0.0002940216,"about_ca_system_score_gemma":0.0004367917,"threshold_uncertainty_score":0.010152519},"labels":[],"label_agreement":null},{"id":"W4291302383","doi":"10.1007/978-3-031-13870-6_27","title":"Illumination Invariant Face Recognition Using Directional Gradient Maps","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Facial recognition system; Pixel; Invariant (physics); Computer vision; Face (sociological concept); Noise (video); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.03352909154472673,"score_gpt":0.24568311200469914,"score_spread":0.2121540204599724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291302383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032151718,0.0015382202,0.94306993,0.00009006252,0.00019037093,0.00005930563,0.00039065248,0.004419388,0.018090278],"genre_scores_gemma":[0.26842886,0.0029673718,0.6761213,0.00021636991,0.000097273376,0.00011901271,0.0020477113,0.0007223844,0.04927965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999915,0.000005734582,0.000002981865,0.000020335028,0.000040001683,0.000015838401],"domain_scores_gemma":[0.999938,0.000011132172,0.0000048715397,0.000018005308,0.00002277461,0.000005212183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000822826,0.00041012754,0.00042352043,0.0005958215,0.00014031478,0.0005120316,0.0005168053,0.0002904141,0.00607185],"category_scores_gemma":[0.00019646119,0.00021382535,0.00035975414,0.00057474757,0.00016316977,0.00054489006,0.000395287,0.00035687606,0.0035609624],"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.00007611481,0.000050013092,0.00031266932,0.000077680466,0.000022102098,0.000056198045,0.000017554772,0.0043106005,0.20166266,0.0027147767,0.0064616166,0.784238],"study_design_scores_gemma":[0.000023628963,0.00021124675,0.008887403,0.00006121667,0.000106786276,0.001685383,0.00010117362,0.41230112,0.52152044,0.009821352,0.045206226,0.00007400107],"about_ca_topic_score_codex":0.0010364688,"about_ca_topic_score_gemma":0.0016642618,"teacher_disagreement_score":0.00607185,"about_ca_system_score_codex":0.00014900164,"about_ca_system_score_gemma":0.00015930757,"threshold_uncertainty_score":0.02031231},"labels":[],"label_agreement":null},{"id":"W4291302748","doi":"10.1007/3-540-45554-x","title":"Rough Sets and Current Trends in Computing","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Current (fluid); Computer science; Data science; Geology; Oceanography","score_opus":0.023656357814208887,"score_gpt":0.2832117175609313,"score_spread":0.2595553597467224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291302748","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00615613,0.7401958,0.15306698,0.016578915,0.006465554,0.00007727988,0.00029464424,0.00042869907,0.07673595],"genre_scores_gemma":[0.18310113,0.62594545,0.13886018,0.0029908225,0.011944292,0.0002864239,0.00055887166,0.00019032747,0.036122475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997497,0.00055364484,0.00022139256,0.00023296394,0.0013993295,0.000095552066],"domain_scores_gemma":[0.99613744,0.0026387055,0.00021751372,0.0003098397,0.0005917216,0.00010477439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025461041,0.0009693423,0.0020562215,0.0040250733,0.0007944022,0.0068079284,0.0011561767,0.0012051866,0.0058067865],"category_scores_gemma":[0.008331085,0.00046720647,0.00078247406,0.008111677,0.00404497,0.009544963,0.0012164894,0.0026215233,0.0017464901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021219663,0.00002328347,0.0001899844,0.0008723973,0.00004010875,0.00003149316,0.00036563954,0.0019799275,0.00021147009,0.81083995,0.019483006,0.16594152],"study_design_scores_gemma":[0.000009662491,0.000032294698,0.0004232892,0.00033212977,0.00003521459,0.00013402411,0.00025748622,0.003673424,0.000112896974,0.864632,0.13033076,0.000026870217],"about_ca_topic_score_codex":0.0011593617,"about_ca_topic_score_gemma":0.0012500795,"teacher_disagreement_score":0.0068079284,"about_ca_system_score_codex":0.0018414679,"about_ca_system_score_gemma":0.0013402503,"threshold_uncertainty_score":0.019425571},"labels":[],"label_agreement":null},{"id":"W4291470723","doi":"10.1007/978-3-031-14391-5_4","title":"Active Federated YOLOR Model for Enhancing Autonomous Vehicles Safety","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Concordia University","funders":"","keywords":"Computer science; Gossip; Convolutional neural network; Artificial intelligence; Object detection; Object (grammar); Representation (politics); Deep learning; Distributed computing; Machine learning; Real-time computing; Pattern recognition (psychology)","score_opus":0.022878768798895156,"score_gpt":0.26512032461424667,"score_spread":0.2422415558153515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291470723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0539704,0.00039012375,0.93080664,0.00019512634,0.00016545097,0.00004062113,0.00011869486,0.000997799,0.013315124],"genre_scores_gemma":[0.953209,0.00021419728,0.028357165,0.00006561281,0.000030426952,0.00008266755,0.00013170134,0.000067676985,0.01784145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999151,0.000016016453,0.000003492976,0.000019611196,0.000024898942,0.000020839549],"domain_scores_gemma":[0.9998803,0.00002432027,0.000013053643,0.00001206368,0.00005816807,0.000011983826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023547505,0.00045684734,0.0006103396,0.00021586503,0.00028372317,0.0008088563,0.0011073063,0.0007131256,0.004586717],"category_scores_gemma":[0.00031157234,0.0001640809,0.00046187168,0.00014175792,0.00032180204,0.00077221805,0.0007753241,0.0006880852,0.0007627317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001649213,0.00006318815,0.0002617623,0.00004867441,0.0000268941,0.000061171086,0.00003158876,0.95740056,0.0058167153,0.007818047,0.0009472165,0.027359188],"study_design_scores_gemma":[0.0000034960385,0.000025084464,0.00002874303,0.0000021452288,0.0000042332417,0.0000038499065,0.0000035988987,0.99873906,0.0003917512,0.0005042741,0.00029219274,0.0000015577889],"about_ca_topic_score_codex":0.0051213936,"about_ca_topic_score_gemma":0.004757674,"teacher_disagreement_score":0.0051213936,"about_ca_system_score_codex":0.00038838957,"about_ca_system_score_gemma":0.00062392326,"threshold_uncertainty_score":0.015344143},"labels":[],"label_agreement":null},{"id":"W4291470783","doi":"10.1007/978-3-031-14391-5_18","title":"Model Checking Intelligent Information Systems with 3-Valued Timed Commitments","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Model checking; Semantics (computer science); Temporal logic; Computation tree logic; Domain (mathematical analysis); Logic model; Software engineering; Set (abstract data type); Reliability (semiconductor); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.04172249753148007,"score_gpt":0.27690135554843787,"score_spread":0.2351788580169578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291470783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08566735,0.00015224075,0.90563077,0.00033158387,0.00008373126,0.000100338664,0.00013141081,0.0026270137,0.0052755564],"genre_scores_gemma":[0.80241674,0.0001290278,0.19277632,0.00010716202,0.00003429552,0.00014791926,0.0002542348,0.0003723342,0.003761909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697137,0.0009710446,0.0002412874,0.0003938005,0.001039458,0.00038300708],"domain_scores_gemma":[0.9913796,0.0064476645,0.00046151047,0.0011919413,0.0003643426,0.00015495889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299992,0.0008040231,0.00095174595,0.0008338971,0.00062401243,0.0034239143,0.002234673,0.0014446175,0.0031497618],"category_scores_gemma":[0.011215038,0.00088306866,0.001983856,0.0009598987,0.0028327235,0.0054295072,0.0036751758,0.0030938867,0.0005799613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000659384,0.00009817127,0.000924611,0.00023290684,0.00012476143,0.00037240598,0.0005743034,0.4741593,0.015672913,0.46312603,0.0014553784,0.04259992],"study_design_scores_gemma":[0.000062363055,0.00005398102,0.0000834533,0.000023220979,0.000034831202,0.000053809657,0.00005711557,0.7738475,0.0104172975,0.21397354,0.0013676848,0.000025242938],"about_ca_topic_score_codex":0.0022224288,"about_ca_topic_score_gemma":0.002726779,"teacher_disagreement_score":0.0034239143,"about_ca_system_score_codex":0.0016593531,"about_ca_system_score_gemma":0.0014941045,"threshold_uncertainty_score":0.015865266},"labels":[],"label_agreement":null},{"id":"W4292558110","doi":"10.1007/11557654","title":"High Performance Computing and Communications","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Distributed computing","score_opus":0.015705498048116558,"score_gpt":0.2658146575328502,"score_spread":0.25010915948473367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292558110","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022445205,0.06931229,0.123989895,0.005587882,0.019585377,0.000240436,0.00080707704,0.00445202,0.7737806],"genre_scores_gemma":[0.0067286496,0.022133492,0.016632505,0.0008357186,0.0034108472,0.00014119917,0.00054024335,0.0006338106,0.94894344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994413,0.00004275949,0.000017056143,0.00008166759,0.00037586337,0.000041310934],"domain_scores_gemma":[0.9992968,0.00017261358,0.00003737483,0.00015145775,0.00023844787,0.00010324187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047583843,0.0022202334,0.0018862349,0.0018877832,0.0011216989,0.00280962,0.0011768506,0.001329541,0.09978428],"category_scores_gemma":[0.0014072285,0.0007123696,0.00041011715,0.0038181574,0.0009621699,0.0031718805,0.0019963118,0.0033545948,0.08873051],"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.000042203344,0.0000457706,0.00008954238,0.00035523856,0.000022436441,0.000052517804,0.00006325228,0.001328982,0.0022471817,0.052699,0.53438133,0.40867245],"study_design_scores_gemma":[0.000010408445,0.0000466222,0.0002661556,0.00014061872,0.000013653138,0.00017401841,0.000025775329,0.0032303187,0.0011487325,0.028650751,0.9662788,0.000014214494],"about_ca_topic_score_codex":0.0006923461,"about_ca_topic_score_gemma":0.0013601941,"teacher_disagreement_score":0.09978428,"about_ca_system_score_codex":0.00079153833,"about_ca_system_score_gemma":0.00091349153,"threshold_uncertainty_score":0.3338117},"labels":[],"label_agreement":null},{"id":"W4292826129","doi":"10.1007/978-3-031-15777-6_30","title":"TapTree: Process-Tree Based Host Behavior Modeling and Threat Detection Framework via Sequential Pattern Mining","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"National Research Council Canada; Research and Productivity Council","funders":"University of Windsor","keywords":"Computer science; Semantics (computer science); Benchmark (surveying); Data mining; Process (computing); Behavioral pattern; Abstraction; Pattern matching; Tree (set theory); Host (biology); Event (particle physics); Audit; Artificial intelligence; Software engineering; Programming language","score_opus":0.017553240583026486,"score_gpt":0.25610672898194653,"score_spread":0.23855348839892004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292826129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046850718,0.00011709614,0.99072194,0.00006543507,0.000015288413,0.00006185003,0.0005276545,0.0031632741,0.00064240076],"genre_scores_gemma":[0.21965207,0.00048488379,0.77363026,0.00009604633,0.000038390495,0.00027652518,0.0026291786,0.00039585368,0.0027967994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995801,0.00008033735,0.000028597668,0.00010523369,0.00016553879,0.000040202263],"domain_scores_gemma":[0.999501,0.00023875717,0.0000554696,0.000067187066,0.00010245693,0.00003505721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007489613,0.000762295,0.0008941486,0.0012261302,0.00043405106,0.0012210076,0.0020473758,0.00071383343,0.0026020417],"category_scores_gemma":[0.0022188681,0.00044034782,0.001212649,0.0013445998,0.00030256755,0.0017337408,0.0009553637,0.0010895131,0.0008550623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022933036,0.00026085158,0.0055064172,0.0003472665,0.0002559318,0.0004023582,0.00023573046,0.654861,0.006442189,0.04629643,0.011491072,0.27367148],"study_design_scores_gemma":[0.000003935754,0.000012883765,0.00017306712,0.0000056194467,0.000012784538,0.00003791038,0.00001137101,0.98942846,0.0004826344,0.008523567,0.0013025216,0.0000052974697],"about_ca_topic_score_codex":0.008704955,"about_ca_topic_score_gemma":0.010269548,"teacher_disagreement_score":0.008704955,"about_ca_system_score_codex":0.00054752233,"about_ca_system_score_gemma":0.0013277233,"threshold_uncertainty_score":0.017308593},"labels":[],"label_agreement":null},{"id":"W4292906384","doi":"10.1007/978-3-642-37453-1","title":"Advances in Knowledge Discovery and Data Mining","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Simon Fraser University","funders":"","keywords":"Computer science; Knowledge extraction; Data science; Volume (thermodynamics); Data mining; Information retrieval","score_opus":0.023846120441123983,"score_gpt":0.2973966520615528,"score_spread":0.2735505316204288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292906384","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014084355,0.7895001,0.14860304,0.0063447184,0.004887012,0.00010456203,0.00073951203,0.0009801971,0.04743232],"genre_scores_gemma":[0.015708245,0.7455308,0.16322547,0.0032566157,0.00847931,0.00019104542,0.0020166459,0.00036362253,0.061228223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853957,0.00018967081,0.00012673478,0.00019010362,0.0008955327,0.000058410715],"domain_scores_gemma":[0.9949411,0.0035774314,0.00021476382,0.00044570983,0.0006728978,0.00014806546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021167668,0.0014839132,0.0025155905,0.0047861757,0.00045364624,0.003895807,0.0021583235,0.0012465667,0.011350637],"category_scores_gemma":[0.0069108256,0.00069579354,0.0010641153,0.0098451795,0.0014640467,0.006687002,0.0019551867,0.0031594876,0.011038498],"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.000041188312,0.00008400292,0.00033082627,0.0038844945,0.0001365304,0.00009426103,0.00010329866,0.001737464,0.00096796383,0.05777434,0.121855296,0.8129903],"study_design_scores_gemma":[0.000018975175,0.00004911906,0.00062462356,0.00105531,0.00010127387,0.00056442845,0.00007992665,0.006717671,0.0011367323,0.21857935,0.77103627,0.00003623087],"about_ca_topic_score_codex":0.0006731139,"about_ca_topic_score_gemma":0.00088250963,"teacher_disagreement_score":0.011350637,"about_ca_system_score_codex":0.0009095983,"about_ca_system_score_gemma":0.0016283466,"threshold_uncertainty_score":0.037971675},"labels":[],"label_agreement":null},{"id":"W4292924664","doi":"10.1007/978-3-319-89441-6","title":"Approximation and Online Algorithms","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Western University","funders":"","keywords":"Computer science; Algorithm; Online algorithm","score_opus":0.020703148704578293,"score_gpt":0.27208474132042837,"score_spread":0.2513815926158501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292924664","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.004776416,0.052846923,0.6042455,0.006592868,0.0052957125,0.00014511179,0.0013691289,0.003105205,0.32162312],"genre_scores_gemma":[0.1477591,0.05383626,0.3708916,0.0031756323,0.008798538,0.00064263854,0.0052014943,0.0035367748,0.406158],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857724,0.00026425096,0.000053726715,0.00030186208,0.00065325917,0.00014972899],"domain_scores_gemma":[0.9984909,0.0006566739,0.00006509416,0.00053690386,0.00017232787,0.000077985635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095862645,0.002461467,0.0025998177,0.0017101314,0.0008373165,0.003857776,0.0025655425,0.0018777989,0.038150005],"category_scores_gemma":[0.004518784,0.00090114924,0.0013459892,0.0052666324,0.0015221772,0.005366739,0.0023532184,0.006771229,0.01810801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017836112,0.00022538142,0.00026298495,0.0006475247,0.00008470969,0.000058424186,0.000055207296,0.026936801,0.0009426309,0.32895038,0.20410559,0.437552],"study_design_scores_gemma":[0.000059521983,0.00005058638,0.00045313718,0.00023580276,0.00006401673,0.00024899156,0.00003799114,0.090422645,0.0012695462,0.70960706,0.19752502,0.000025684625],"about_ca_topic_score_codex":0.0015539607,"about_ca_topic_score_gemma":0.0015101611,"teacher_disagreement_score":0.038150005,"about_ca_system_score_codex":0.0025456387,"about_ca_system_score_gemma":0.001397267,"threshold_uncertainty_score":0.12762451},"labels":[],"label_agreement":null},{"id":"W4292935249","doi":"10.1007/978-3-642-23629-7","title":"Medical Image Computing and Computer-Assisted Intervention – MICCAI 2011","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Sunnybrook Hospital; Queen's University","funders":"","keywords":"Computer science; Set (abstract data type); Intervention (counseling); Multimedia; Medicine; Nursing","score_opus":0.011788956385331005,"score_gpt":0.29178293543071643,"score_spread":0.2799939790453854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292935249","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051949234,0.18200406,0.5319731,0.0077130785,0.027360888,0.00029585403,0.0018127837,0.006264636,0.23738053],"genre_scores_gemma":[0.032483336,0.10627389,0.19131777,0.0011509965,0.009873759,0.00031572816,0.0031049296,0.002307542,0.653172],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932706,0.000059262893,0.000042404205,0.00015954112,0.00037455608,0.00003714811],"domain_scores_gemma":[0.9990194,0.0002327064,0.000044828197,0.00017563222,0.0004114316,0.000115983006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097124936,0.0017816289,0.0017319262,0.0023707796,0.0004752623,0.002124956,0.0013702353,0.0012940371,0.040653147],"category_scores_gemma":[0.0019253001,0.00094414665,0.0007492732,0.002862929,0.0008683177,0.002669444,0.0018279769,0.002727377,0.01934494],"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.000050721188,0.000035749184,0.000101148944,0.00045178557,0.000038487087,0.000042130465,0.000030319809,0.004323604,0.003053873,0.015277366,0.30960304,0.6669917],"study_design_scores_gemma":[0.00001968375,0.00009696677,0.002755731,0.0003766573,0.000067666035,0.0013436204,0.000041557985,0.05599107,0.0060301623,0.036337912,0.89684755,0.000091313996],"about_ca_topic_score_codex":0.0021849337,"about_ca_topic_score_gemma":0.003602155,"teacher_disagreement_score":0.040653147,"about_ca_system_score_codex":0.00093072525,"about_ca_system_score_gemma":0.0011630883,"threshold_uncertainty_score":0.13599831},"labels":[],"label_agreement":null},{"id":"W4293041274","doi":"10.1007/978-3-031-15273-3_9","title":"Facilitating Geometry Learning Through Real-Time Collaborative Activities with Augmented Reality in Authentic Context","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Athabasca University","funders":"","keywords":"Context (archaeology); Human–computer interaction; Computer science; Multimedia; Function (biology); Collaborative learning; Knowledge management","score_opus":0.01736522487941162,"score_gpt":0.26482780034542225,"score_spread":0.24746257546601064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293041274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18321794,0.0007063856,0.7050027,0.00037764816,0.00015027309,0.00027932512,0.0001543225,0.0040638,0.10604764],"genre_scores_gemma":[0.68897086,0.00071978796,0.27963522,0.00007770301,0.000043533884,0.00027133923,0.0002232048,0.00023218172,0.029826107],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993326,0.00020817609,0.000022357826,0.00013030657,0.00022072635,0.00008573852],"domain_scores_gemma":[0.9994562,0.00026783868,0.00004065215,0.00012799901,0.00004745897,0.000059936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034226978,0.0009417641,0.0004968861,0.00046697358,0.0005171502,0.0024234417,0.0015042688,0.0010181303,0.016188534],"category_scores_gemma":[0.0014111915,0.00033268484,0.0006066212,0.00042518345,0.0009484383,0.0031149092,0.005190469,0.00079091283,0.0038115652],"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.0006560905,0.0016878183,0.0018271689,0.0010393192,0.000071064715,0.0010116128,0.015773386,0.025272908,0.14809169,0.063971385,0.012280663,0.7283169],"study_design_scores_gemma":[0.00043921158,0.0034805334,0.01564663,0.0008476741,0.00026575557,0.004980851,0.02534048,0.23087999,0.19982097,0.14212754,0.37566492,0.0005053566],"about_ca_topic_score_codex":0.0005554794,"about_ca_topic_score_gemma":0.000898687,"teacher_disagreement_score":0.016188534,"about_ca_system_score_codex":0.00022415591,"about_ca_system_score_gemma":0.00041319206,"threshold_uncertainty_score":0.054156005},"labels":[],"label_agreement":null},{"id":"W4293195734","doi":"10.1007/978-3-030-95953-1_14","title":"Reordering Under the ECMAScript Memory Consistency Model","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Computer science; Sequential consistency; Memory model; Compiler; Consistency model; Consistency (knowledge bases); Programming language; Semantics (computer science); Parallel computing; Optimizing compiler; Shared memory; Artificial intelligence","score_opus":0.026494084379799363,"score_gpt":0.2501140650597196,"score_spread":0.22361998067992025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293195734","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.08828289,0.0017189194,0.7890743,0.003212356,0.0013337818,0.00024158518,0.0021470247,0.0063879085,0.107601255],"genre_scores_gemma":[0.7269126,0.0011286861,0.19403817,0.0013507297,0.0007409036,0.00030529793,0.0024118267,0.0021646668,0.07094712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975352,0.0005536732,0.0002061745,0.0003102008,0.0009813269,0.0004134246],"domain_scores_gemma":[0.99284184,0.0013239245,0.0003529287,0.004370162,0.00097572466,0.00013539691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018484674,0.00057643943,0.000885796,0.00084903603,0.0011596892,0.0029049804,0.0029833326,0.0011799925,0.011312682],"category_scores_gemma":[0.0076966668,0.00050428574,0.00063733,0.0017885325,0.0016336987,0.008131898,0.0024026132,0.0022648263,0.0024500568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033289084,0.000084794796,0.0005021759,0.00013271812,0.000022778528,0.0003132082,0.00020831141,0.020584757,0.003847915,0.89547515,0.017366588,0.061128803],"study_design_scores_gemma":[0.00007550227,0.000049005317,0.00019951265,0.00004117871,0.000039389728,0.0003017615,0.00010944733,0.09741265,0.01420997,0.8511664,0.036357034,0.000038078928],"about_ca_topic_score_codex":0.00285176,"about_ca_topic_score_gemma":0.0026744148,"teacher_disagreement_score":0.011312682,"about_ca_system_score_codex":0.0011891752,"about_ca_system_score_gemma":0.0019346745,"threshold_uncertainty_score":0.037844718},"labels":[],"label_agreement":null},{"id":"W4293203540","doi":"10.1007/978-3-031-08011-1_17","title":"Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Integer programming; Cutting stock problem; Mathematical optimization; Scheduling (production processes); Constraint programming; Linear programming; Constraint (computer-aided design); Job shop scheduling; Algorithm; Optimization problem; Mathematics; Stochastic programming; Operating system","score_opus":0.035354685620466335,"score_gpt":0.2604574626300776,"score_spread":0.22510277700961123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293203540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013481546,0.00027427386,0.9766192,0.00018417266,0.00012052552,0.00010825466,0.00017008757,0.00030633752,0.0087355785],"genre_scores_gemma":[0.113134526,0.0004910053,0.87828565,0.00014316062,0.00008544005,0.00028646013,0.00032461548,0.0004488218,0.0068002953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995389,0.00010273185,0.00002612595,0.00009251092,0.0001751936,0.00006466408],"domain_scores_gemma":[0.9989994,0.0007178373,0.0000780304,0.00006956973,0.000082548846,0.000052604915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077942736,0.001352389,0.0018944461,0.0009656542,0.0008452217,0.0023625037,0.0018333942,0.0021927163,0.009544251],"category_scores_gemma":[0.0023100127,0.0017075373,0.0016174081,0.0028661569,0.00088464934,0.0018593966,0.0016232582,0.0017333976,0.0008666868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005667531,0.000058697082,0.00018995615,0.00014588838,0.000026447311,0.0001244103,0.000056448644,0.93089586,0.001953757,0.019416433,0.0034620762,0.04361336],"study_design_scores_gemma":[0.000010151986,0.00001325787,0.00004727539,0.0000069878856,0.0000046626974,0.000024569834,0.000011006915,0.99017966,0.0003604887,0.008037147,0.0012972421,0.000007522303],"about_ca_topic_score_codex":0.0101033645,"about_ca_topic_score_gemma":0.0087411525,"teacher_disagreement_score":0.0101033645,"about_ca_system_score_codex":0.0011967049,"about_ca_system_score_gemma":0.0015738124,"threshold_uncertainty_score":0.031928718},"labels":[],"label_agreement":null},{"id":"W4293451216","doi":"10.1007/978-3-031-08530-7_36","title":"A Generalized Inverted Dirichlet Predictive Model for Activity Recognition Using Small Training Data","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Dirichlet distribution; Computer science; Inference; Flexibility (engineering); Artificial intelligence; Machine learning; Bounded function; Bayesian inference; Bayesian probability; Algorithm; Pattern recognition (psychology); Data mining; Training set; Mathematics; Statistics","score_opus":0.20407600592725775,"score_gpt":0.3237577202768275,"score_spread":0.11968171434956973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293451216","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.002832407,0.0004888001,0.994839,0.00014500019,0.000065570726,0.000030553594,0.00020915603,0.0006733419,0.0007161002],"genre_scores_gemma":[0.2919819,0.0019605483,0.6805558,0.00069698464,0.0005295936,0.00080896256,0.0036526127,0.000792229,0.019021232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986523,0.00045957233,0.00008476403,0.00042764295,0.00024867532,0.00012711514],"domain_scores_gemma":[0.99690527,0.0022646305,0.00009370774,0.00037900783,0.00029229472,0.000064966494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002624059,0.0009762769,0.0024328737,0.0011288589,0.00069599616,0.0018640654,0.004771942,0.0021202678,0.0052230977],"category_scores_gemma":[0.007796108,0.0013001108,0.0021645362,0.0023586247,0.0012281238,0.0028594015,0.0020906476,0.0038084106,0.0035155637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038747911,0.0001604324,0.00070392824,0.00019121617,0.00014426617,0.00012721251,0.00019610874,0.52358,0.0032598206,0.052363127,0.008312625,0.41057372],"study_design_scores_gemma":[0.000006302832,0.000009469994,0.00008326299,0.000010185121,0.000013299468,0.000021678976,0.0000066488183,0.9810667,0.00037950778,0.017765785,0.00062651193,0.000010663669],"about_ca_topic_score_codex":0.01661462,"about_ca_topic_score_gemma":0.019172393,"teacher_disagreement_score":0.01661462,"about_ca_system_score_codex":0.0013108798,"about_ca_system_score_gemma":0.0013343742,"threshold_uncertainty_score":0.033035815},"labels":[],"label_agreement":null},{"id":"W4293451258","doi":"10.1007/978-3-031-08530-7_57","title":"Detecting Use Case Scenarios in Requirements Artifacts: A Deep Learning Approach","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Calgary","funders":"","keywords":"Computer science; Classifier (UML); Transformer; Use Case Diagram; Artificial intelligence; Machine learning; Process (computing); Sequence diagram; Natural language; Requirements elicitation; Unified Modeling Language; Requirements analysis; Programming language; Class diagram; Software","score_opus":0.04203983792780778,"score_gpt":0.27241968032165065,"score_spread":0.23037984239384288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293451258","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.25992668,0.00079303974,0.72478,0.00076812285,0.000058290265,0.00034730774,0.0024112614,0.0047440366,0.006171354],"genre_scores_gemma":[0.77488613,0.00031128534,0.21754411,0.00013589585,0.000025875674,0.00011310009,0.0038602417,0.00009703263,0.0030263215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990103,0.00018277942,0.00008000042,0.00029275526,0.0002748131,0.00015916978],"domain_scores_gemma":[0.9969651,0.00171804,0.00045636785,0.0003242475,0.0003818928,0.00015432462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010308867,0.0010893357,0.00052302436,0.0029651935,0.0003643642,0.0016501294,0.0014917799,0.0012787648,0.0016237283],"category_scores_gemma":[0.0035855016,0.0005767159,0.0011322282,0.001479766,0.0003662113,0.0018635119,0.0014145707,0.0016896091,0.00081986137],"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.00035061827,0.0012106653,0.043199584,0.00039845798,0.00022891819,0.00084763364,0.00046432676,0.13194673,0.01784763,0.004801222,0.009170439,0.7895337],"study_design_scores_gemma":[0.0000050960716,0.000041870902,0.0031926115,0.000040323608,0.000025242221,0.00011555305,0.00010137084,0.9865753,0.0033316605,0.0054939203,0.0010668775,0.000010134342],"about_ca_topic_score_codex":0.006665707,"about_ca_topic_score_gemma":0.014264398,"teacher_disagreement_score":0.006665707,"about_ca_system_score_codex":0.00100891,"about_ca_system_score_gemma":0.0009987667,"threshold_uncertainty_score":0.013253808},"labels":[],"label_agreement":null},{"id":"W4293657573","doi":"10.1007/978-3-031-15740-0_16","title":"Querying Temporal Anomalies in Healthcare Information Systems and Beyond","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Tuple; Temporal database; Redundancy (engineering); Relation (database); Operator (biology); Data redundancy; Information retrieval; Contradiction; Relational database; Data mining; Database; Mathematics","score_opus":0.014082681555149603,"score_gpt":0.2426607450001257,"score_spread":0.22857806344497608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293657573","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.051245462,0.03083112,0.86780137,0.011174128,0.0012513933,0.0001269327,0.0040725055,0.007310267,0.02618679],"genre_scores_gemma":[0.5567969,0.016509129,0.40396163,0.0014062551,0.0010852859,0.00008866652,0.0055361963,0.00067944644,0.013936498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843055,0.00030272867,0.00018272683,0.00027670426,0.00071409094,0.00009314519],"domain_scores_gemma":[0.9969901,0.0021259168,0.00017729284,0.00034737756,0.0002724297,0.00008690926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990618,0.0005866619,0.0010165307,0.002217761,0.000421009,0.0040789824,0.0013019659,0.0011421122,0.0034880985],"category_scores_gemma":[0.008411995,0.0004494103,0.00072661217,0.0038351566,0.0010824667,0.007895868,0.0015760334,0.0017713087,0.0007642203],"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.0002857505,0.000088019944,0.0054037953,0.0008318645,0.00011398223,0.00083752186,0.001155649,0.037073236,0.0090258615,0.387042,0.039829917,0.5183124],"study_design_scores_gemma":[0.000020841931,0.000062822044,0.0018035418,0.00022187886,0.00008395222,0.0015685156,0.000647819,0.3144332,0.008335063,0.55842227,0.11434059,0.000059465616],"about_ca_topic_score_codex":0.0035442882,"about_ca_topic_score_gemma":0.0028245167,"teacher_disagreement_score":0.0040789824,"about_ca_system_score_codex":0.0012888286,"about_ca_system_score_gemma":0.00076854223,"threshold_uncertainty_score":0.011668861},"labels":[],"label_agreement":null},{"id":"W4294273444","doi":"10.1007/978-3-031-15911-4_5","title":"The Effect of Exogenous Shocks on the Administration of Online Voting: Evidence from Ontario, Canada","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electoral Systems and Political Participation","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University; York University; Brock University; Toronto Metropolitan University; McGill University","funders":"","keywords":"Voting; Coronavirus disease 2019 (COVID-19); Pandemic; Administration (probate law); Perception; Contrast (vision); Demographic economics; Computer science; Political science; Psychology; Economics; Medicine; Politics; Law","score_opus":0.0388984942898089,"score_gpt":0.30394993931803055,"score_spread":0.26505144502822164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294273444","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.97376674,0.0009974807,0.00024509546,0.0024605289,0.000042091797,0.00009895559,0.0033488555,0.000013170896,0.019027127],"genre_scores_gemma":[0.9931196,0.00088657904,0.00008391056,0.00022361794,0.00001038527,0.000025451376,0.0012063249,0.000008269032,0.0044358745],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.997097,0.0003813666,0.00011927156,0.00023594631,0.0011988056,0.0009675846],"domain_scores_gemma":[0.98512256,0.0024217453,0.0036225598,0.00067076215,0.0060972767,0.002065185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019210295,0.00025562936,0.0004623818,0.0011303525,0.004511,0.002518084,0.001272009,0.00052879454,0.00418489],"category_scores_gemma":[0.0088869985,0.00029655846,0.0003910217,0.0052501257,0.0026890272,0.0007120177,0.00152398,0.0010896106,0.00031316976],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022266243,0.000097700475,0.9538012,0.00017210007,0.000096398624,0.0002650011,0.018691476,0.0005651305,0.000338127,0.0023490079,0.009289856,0.014111296],"study_design_scores_gemma":[0.000017068336,0.000029408951,0.9676395,0.00007866049,0.000027557,0.000016940112,0.022493633,0.00025848814,0.00011222896,0.00010475595,0.009197076,0.000024644569],"about_ca_topic_score_codex":0.9985362,"about_ca_topic_score_gemma":0.99919397,"teacher_disagreement_score":0.056833934,"about_ca_system_score_codex":0.056833934,"about_ca_system_score_gemma":0.07077807,"threshold_uncertainty_score":0.41236103},"labels":[],"label_agreement":null},{"id":"W4294273463","doi":"10.1007/978-3-031-15911-4_3","title":"Review Your Choices: When Confirmation Pages Break Ballot Secrecy in Online Elections","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Voting; Secrecy; Ballot; Computer security; Law","score_opus":0.029435087180145134,"score_gpt":0.27090567055737275,"score_spread":0.2414705833772276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294273463","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.7130032,0.0012298992,0.21094503,0.0065060146,0.0007340444,0.00036088075,0.0007565261,0.003325696,0.06313875],"genre_scores_gemma":[0.9781964,0.00013330797,0.014032494,0.00028738476,0.00010173669,0.000043489068,0.00019200944,0.00025072167,0.0067626075],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98281443,0.009793408,0.0005688654,0.0012070603,0.0042538755,0.0013624188],"domain_scores_gemma":[0.9319381,0.041715838,0.0059323967,0.013714065,0.005507159,0.0011925029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009407402,0.00033161137,0.0006678766,0.0009360018,0.0016290814,0.0039628725,0.0010769864,0.0012478057,0.005442526],"category_scores_gemma":[0.08136829,0.00046169388,0.00034391487,0.0010852902,0.0020547719,0.00545155,0.0022206455,0.0021546502,0.0030327186],"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.0033971919,0.00039779968,0.08775895,0.00048311977,0.00017718574,0.0016446818,0.009009718,0.04389122,0.01947189,0.2595576,0.044685375,0.52952534],"study_design_scores_gemma":[0.00019521538,0.0010513649,0.040543914,0.00055228005,0.00020441489,0.0016398856,0.008032858,0.4531676,0.08815523,0.26052794,0.14555362,0.00037576718],"about_ca_topic_score_codex":0.0014902097,"about_ca_topic_score_gemma":0.0018123551,"teacher_disagreement_score":0.009407402,"about_ca_system_score_codex":0.0011731632,"about_ca_system_score_gemma":0.0013041234,"threshold_uncertainty_score":0.0497517},"labels":[],"label_agreement":null},{"id":"W4294699201","doi":"10.1007/978-3-319-66182-7","title":"Medical Image Computing and Computer Assisted Intervention − MICCAI 2017","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Université Laval; McGill University; Université de Sherbrooke","funders":"","keywords":"Computer science; Set (abstract data type); Volume (thermodynamics); Multimedia; Programming language","score_opus":0.013530093645760499,"score_gpt":0.3250767243462824,"score_spread":0.31154663070052185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294699201","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050608483,0.22920346,0.3044972,0.008370513,0.051604185,0.00027552404,0.0021405136,0.0064782538,0.39236954],"genre_scores_gemma":[0.020876294,0.13262342,0.084635355,0.0011762443,0.0155670345,0.00023612544,0.0035079587,0.0024565072,0.73892105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992699,0.00005049864,0.000036327114,0.00013286817,0.0004702574,0.000040065148],"domain_scores_gemma":[0.99920565,0.00015635144,0.00003690927,0.00014016229,0.00031220782,0.00014875486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081744697,0.0017355938,0.0015265144,0.0031359638,0.0005436839,0.002859646,0.0014542234,0.0010603226,0.0521123],"category_scores_gemma":[0.0015265283,0.00085463753,0.00080354745,0.0031487513,0.0010185626,0.0029506187,0.002475085,0.0030334683,0.0318563],"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.000040224848,0.000040530398,0.00010209797,0.00041483893,0.000034510438,0.00003554834,0.000025562615,0.0024646546,0.0020598776,0.017232535,0.3529447,0.62460494],"study_design_scores_gemma":[0.00001153785,0.00005749054,0.001215877,0.00033625157,0.000032510296,0.000783283,0.000038756298,0.016560648,0.0027659826,0.035932425,0.94221354,0.000051779716],"about_ca_topic_score_codex":0.0017321915,"about_ca_topic_score_gemma":0.0024767183,"teacher_disagreement_score":0.0521123,"about_ca_system_score_codex":0.0010580008,"about_ca_system_score_gemma":0.0016007227,"threshold_uncertainty_score":0.17433298},"labels":[],"label_agreement":null},{"id":"W4294831628","doi":"10.1007/978-3-031-14862-0_22","title":"A Safety Assurable Human-Inspired Perception Architecture","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interpretability; Cognitive architecture; Architecture; Sketch; Computer science; Artificial intelligence; Perception; Process (computing); Task (project management); Cognitive science; Vulnerability (computing); Cognition; Engineering; Systems engineering; Psychology; Computer security","score_opus":0.015045063438191673,"score_gpt":0.2582018612503229,"score_spread":0.24315679781213123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294831628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015032124,0.0002113058,0.9705067,0.00030018893,0.0001483664,0.000038242346,0.000050614773,0.0017335264,0.011979008],"genre_scores_gemma":[0.67470956,0.0003015977,0.30152214,0.0004505522,0.000073372124,0.00008547675,0.00012386015,0.00021968319,0.022513779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998485,0.000017941205,0.000004451954,0.000048510232,0.000056226934,0.000024363508],"domain_scores_gemma":[0.9998723,0.000025170544,0.000010495506,0.000035503268,0.000035878562,0.000020571204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002401629,0.00041384794,0.00028707404,0.0001651993,0.00030536146,0.00063238543,0.0013053791,0.00090501615,0.006621014],"category_scores_gemma":[0.00046944633,0.00022055565,0.00042400073,0.00012615936,0.0005719403,0.0007721389,0.001296954,0.00092709775,0.0013944475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034848272,0.00019102891,0.00046372705,0.0001722215,0.00009492751,0.00024245513,0.00018031831,0.2955206,0.21851464,0.14295483,0.010271561,0.3310452],"study_design_scores_gemma":[0.000016550104,0.00023931803,0.00036307555,0.00001971352,0.000027260912,0.0001504709,0.00002151651,0.90825975,0.02680699,0.05271765,0.011351784,0.00002581649],"about_ca_topic_score_codex":0.0010335594,"about_ca_topic_score_gemma":0.0011460765,"teacher_disagreement_score":0.006621014,"about_ca_system_score_codex":0.0004646161,"about_ca_system_score_gemma":0.00050310243,"threshold_uncertainty_score":0.022149444},"labels":[],"label_agreement":null},{"id":"W4294837602","doi":"10.1007/978-3-031-15146-0_15","title":"Tables as Powerful Representational Tools","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Gestalt psychology; Computer science; Notation; Table (database); Identification (biology); Perception; Cognition; Information retrieval; Cognitive science; Artificial intelligence; Theoretical computer science; Data mining; Psychology; Linguistics","score_opus":0.03067867280457398,"score_gpt":0.3066730428419283,"score_spread":0.27599437003735433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294837602","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.015129204,0.019667318,0.78189397,0.004647649,0.0021151167,0.00014451495,0.0039813127,0.0075623943,0.16485855],"genre_scores_gemma":[0.31479475,0.019435644,0.56009877,0.0014308889,0.0013976012,0.00044506876,0.005376655,0.0024258185,0.09459483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909365,0.00030970384,0.00007477001,0.00012929106,0.00033827854,0.000054323602],"domain_scores_gemma":[0.9974529,0.001393572,0.00017785418,0.00059088186,0.00026900574,0.00011573523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043565,0.0007168839,0.00047873877,0.0023843583,0.00087332854,0.0088365525,0.0014475943,0.0008521887,0.026056752],"category_scores_gemma":[0.004229008,0.00052730774,0.00073834974,0.003843442,0.002275049,0.010903875,0.0027465548,0.001453498,0.0062078047],"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.00004646228,0.000010077096,0.00015497369,0.00028290082,0.000016435142,0.00012339094,0.00080287084,0.00278113,0.002162842,0.8934275,0.022401847,0.0777894],"study_design_scores_gemma":[0.000017878154,0.000024542618,0.00016712872,0.0002600454,0.000027227517,0.00035522608,0.0002638296,0.00844789,0.0023562105,0.47283125,0.51521736,0.000031450956],"about_ca_topic_score_codex":0.00085577584,"about_ca_topic_score_gemma":0.0006659165,"teacher_disagreement_score":0.026056752,"about_ca_system_score_codex":0.0007486873,"about_ca_system_score_gemma":0.0007475851,"threshold_uncertainty_score":0.087168455},"labels":[],"label_agreement":null},{"id":"W4294837693","doi":"10.1007/978-3-031-15146-0_7","title":"A Diagram Must Never Be Ten Thousand Words: Text-Based (Sentential) Approaches to Diagrams Accessibility Limit Users’ Potential for Normative Agency","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Warnings and Signage","field":"Psychology","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":"Ontario College of Art and Design","funders":"","keywords":"Diagrammatic reasoning; Normative; Computer science; Agency (philosophy); Representation (politics); Affordance; Diagram; Constraint (computer-aided design); Human–computer interaction; Epistemology; Mathematics; Political science; Programming language; Law","score_opus":0.0751523018056459,"score_gpt":0.29393674311104384,"score_spread":0.21878444130539793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294837693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025193602,0.0007068874,0.62654275,0.007049889,0.00044849038,0.000070883594,0.00012957415,0.0027129762,0.33714485],"genre_scores_gemma":[0.6830716,0.00094403356,0.19548206,0.00108129,0.00014970807,0.00019180703,0.0002087589,0.0016194412,0.1172512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985518,0.00072651234,0.00008457844,0.00017682296,0.00039751263,0.00006275327],"domain_scores_gemma":[0.99099463,0.0059782797,0.0003604515,0.001377475,0.0010232826,0.00026587595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019433987,0.000434229,0.00019892975,0.00081768964,0.0010994959,0.0049720234,0.0010144656,0.0016593403,0.018474625],"category_scores_gemma":[0.012534693,0.00045216372,0.0002242675,0.0006312976,0.005493913,0.013501732,0.0023779767,0.0021330654,0.004335829],"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.00003639249,0.000022771013,0.00022467008,0.0001307448,0.0000037991813,0.00009477135,0.009406343,0.00044030487,0.0035559274,0.8944348,0.012897983,0.07875145],"study_design_scores_gemma":[0.000017461138,0.000030548872,0.00023518602,0.00013945345,0.000019588153,0.00056916126,0.0031053675,0.0055585084,0.008009192,0.65859336,0.32369244,0.000029765206],"about_ca_topic_score_codex":0.0010267104,"about_ca_topic_score_gemma":0.001818151,"teacher_disagreement_score":0.018474625,"about_ca_system_score_codex":0.0007156456,"about_ca_system_score_gemma":0.0010895785,"threshold_uncertainty_score":0.061803818},"labels":[],"label_agreement":null},{"id":"W4295135780","doi":"10.1007/978-3-031-15471-3_32","title":"Assessment of Creditworthiness Models Privacy-Preserving Training with Synthetic Data","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Western University","funders":"","keywords":"Computer science; Synthetic data; Scarcity; Quality (philosophy); Training set; Work (physics); Data quality; Credit risk; Data mining; Artificial intelligence; Finance; Business; Metric (unit)","score_opus":0.07513686561004515,"score_gpt":0.30561069643383176,"score_spread":0.2304738308237866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295135780","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.5324397,0.0031064262,0.4550227,0.002252121,0.000178723,0.00013572731,0.0013385473,0.0017184402,0.0038075955],"genre_scores_gemma":[0.96128917,0.00032468422,0.035798103,0.00011659007,0.000053624084,0.000030673116,0.001076417,0.00006960138,0.0012411291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821305,0.0009326386,0.000093943134,0.00027041885,0.00035192192,0.00013809785],"domain_scores_gemma":[0.96792096,0.025164625,0.0009485366,0.0041181776,0.0014489536,0.000398597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0093367025,0.00081742986,0.00090255414,0.00063791615,0.00046796727,0.0012154342,0.0016791192,0.0016802553,0.0012277763],"category_scores_gemma":[0.0278647,0.00028581618,0.000527162,0.00084338733,0.0011941344,0.002376233,0.0013982727,0.0014818629,0.00022386157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009901773,0.000112143956,0.0045416267,0.00010808481,0.000084796375,0.00006129202,0.000061269704,0.9169157,0.0014106123,0.0043918006,0.0021027343,0.06921976],"study_design_scores_gemma":[0.000011517051,0.00007592009,0.0005092897,0.000008955777,0.000010170132,0.000025441155,0.0000117403515,0.9953695,0.0013609809,0.0024344735,0.00017808712,0.000003839681],"about_ca_topic_score_codex":0.0037732278,"about_ca_topic_score_gemma":0.002387676,"teacher_disagreement_score":0.0093367025,"about_ca_system_score_codex":0.0015801153,"about_ca_system_score_gemma":0.0014538947,"threshold_uncertainty_score":0.04937774},"labels":[],"label_agreement":null},{"id":"W4295135817","doi":"10.1007/978-3-031-15471-3_31","title":"SHAP Algorithm for Healthcare Data Classification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Athabasca University","funders":"","keywords":"Computer science; Health care; Transparency (behavior); Middleware (distributed applications); Information privacy; Architecture; Data mining; Computer security; Database","score_opus":0.10096880389661363,"score_gpt":0.3259688583671617,"score_spread":0.2250000544705481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295135817","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.010902767,0.0006928852,0.9814026,0.00063719356,0.00019005143,0.00013100242,0.0003118837,0.0005239128,0.0052077672],"genre_scores_gemma":[0.38966465,0.0009609625,0.5885397,0.0005652171,0.00038340033,0.00043086018,0.0016835991,0.00021250125,0.017559007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895406,0.00045703023,0.00006116157,0.00020536571,0.0002461053,0.00007619495],"domain_scores_gemma":[0.99811673,0.0010639186,0.000077423545,0.00038010857,0.00026410038,0.00009760427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002620044,0.0006186686,0.0017713769,0.0011035952,0.00082545646,0.0016656806,0.0022328608,0.0012373609,0.008176189],"category_scores_gemma":[0.005536682,0.00030572296,0.000871614,0.0018397605,0.00092928536,0.0023627698,0.001964095,0.0021113327,0.0012683783],"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.00035454996,0.00026658332,0.0012060016,0.00021283154,0.00014493681,0.00005976501,0.00007681375,0.16396517,0.0011668988,0.22083254,0.030014602,0.5816994],"study_design_scores_gemma":[0.000034871064,0.00005307941,0.00020674564,0.000022983,0.000018215726,0.000051119583,0.000022250324,0.7860356,0.0005873997,0.20942794,0.0035315207,0.000008349842],"about_ca_topic_score_codex":0.0012325587,"about_ca_topic_score_gemma":0.0011245866,"teacher_disagreement_score":0.008176189,"about_ca_system_score_codex":0.0011279575,"about_ca_system_score_gemma":0.0019706516,"threshold_uncertainty_score":0.027352035},"labels":[],"label_agreement":null},{"id":"W4295746342","doi":"10.1007/978-3-031-16525-2_1","title":"AugPaste: One-Shot Anomaly Detection for Medical Images","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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 British Columbia","funders":"","keywords":"Anomaly detection; Artificial intelligence; Computer science; Anomaly (physics); Pattern recognition (psychology); Image (mathematics); Scale (ratio); Cartography; Geography","score_opus":0.025876900182814046,"score_gpt":0.27773260976637254,"score_spread":0.2518557095835585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295746342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005355458,0.00047990863,0.95699954,0.00011364389,0.000134511,0.00012115016,0.00078520697,0.034876186,0.0011343907],"genre_scores_gemma":[0.047794264,0.00043432662,0.9411015,0.00014607233,0.00008767404,0.00017260197,0.0027766277,0.0018440101,0.0056428527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.00007069795,0.000031983705,0.00015049052,0.0003719242,0.00006274653],"domain_scores_gemma":[0.9994646,0.00018357244,0.000036645437,0.00012769003,0.00014788829,0.000039599367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072989863,0.001648457,0.0013964782,0.0018557718,0.0004388809,0.0013668687,0.002341461,0.0013653283,0.009102762],"category_scores_gemma":[0.0020116714,0.0006820061,0.001007883,0.0011925078,0.0004321202,0.0012752102,0.0019903982,0.001491589,0.0045636976],"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.00044698812,0.000102148166,0.00071754237,0.00023130246,0.00012550918,0.00020823644,0.00006510592,0.011118984,0.041481573,0.0029141672,0.039449904,0.90313864],"study_design_scores_gemma":[0.00006442371,0.00022725704,0.0017510175,0.000035014637,0.00006479315,0.0011999299,0.000050936524,0.8942079,0.063384205,0.012921196,0.026032684,0.000060644106],"about_ca_topic_score_codex":0.002246232,"about_ca_topic_score_gemma":0.004202286,"teacher_disagreement_score":0.009102762,"about_ca_system_score_codex":0.00038904752,"about_ca_system_score_gemma":0.0006706038,"threshold_uncertainty_score":0.030451775},"labels":[],"label_agreement":null},{"id":"W4295747743","doi":"10.1007/978-3-031-16431-6_20","title":"Multi-site Normative Modeling of Diffusion Tensor Imaging Metrics Using Hierarchical Bayesian Regression","year":2022,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Montréal","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute on Aging; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Normative; Bayesian probability; Diffusion MRI; Artificial intelligence; Regression; Tensor (intrinsic definition); Diffusion; Multilevel model; Pattern recognition (psychology); Data mining; Algorithm; Machine learning; Statistics; Mathematics; Magnetic resonance imaging","score_opus":0.06032372092394443,"score_gpt":0.35846170821556356,"score_spread":0.2981379872916191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295747743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011455808,0.00011494443,0.9870803,0.00018459595,0.000022072507,0.00004812397,0.00016648123,0.00034688902,0.00058070984],"genre_scores_gemma":[0.53911126,0.0008363597,0.44643942,0.00020308717,0.00013863694,0.00075349543,0.0022308943,0.0010728748,0.009213949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961371,0.0019341166,0.00018447015,0.00090986054,0.0006133274,0.00022122572],"domain_scores_gemma":[0.9804505,0.012149824,0.0017252248,0.0018664395,0.0033342305,0.00047377512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012119096,0.0015737871,0.0024332139,0.0024528052,0.0010405484,0.0028340858,0.0050072805,0.0031070965,0.003118951],"category_scores_gemma":[0.041901458,0.002512614,0.0020976798,0.0021745088,0.0024019661,0.0050821416,0.0027423552,0.0038710125,0.0012295827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011153527,0.00013410016,0.003153597,0.00011964346,0.00014955731,0.0001924545,0.00034057905,0.8308005,0.0014473802,0.1253164,0.0020013524,0.03623299],"study_design_scores_gemma":[0.000004697488,0.000009977888,0.00025887767,0.000010644181,0.000010591809,0.000024839925,0.000010416606,0.97589976,0.0001678787,0.023292068,0.00029425943,0.000015828748],"about_ca_topic_score_codex":0.024784913,"about_ca_topic_score_gemma":0.030766776,"teacher_disagreement_score":0.024784913,"about_ca_system_score_codex":0.0020641899,"about_ca_system_score_gemma":0.0035070197,"threshold_uncertainty_score":0.064092696},"labels":[],"label_agreement":null},{"id":"W4295747953","doi":"10.1007/978-3-031-16876-5","title":"Resource-Efficient Medical Image Analysis","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Medical imaging; Resource (disambiguation); Image (mathematics); Image processing; Computer vision; Artificial intelligence; Data science; Computer network","score_opus":0.007137007011840505,"score_gpt":0.28133520751129265,"score_spread":0.27419820049945215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295747953","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002774861,0.0011570972,0.9855063,0.00027684233,0.00011223877,0.00005407678,0.00037542594,0.003205123,0.006537998],"genre_scores_gemma":[0.08860296,0.0018168255,0.8794729,0.00028649197,0.0002711161,0.00015730505,0.0018370833,0.000904876,0.026650423],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994443,0.00008123873,0.00003130712,0.000094184135,0.0002778342,0.00007110286],"domain_scores_gemma":[0.9992805,0.00028511297,0.00003213623,0.00024067008,0.00013578228,0.000025722102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004946905,0.0010009472,0.0010622516,0.0012906455,0.00032671692,0.0012954682,0.001966275,0.00063930353,0.020781353],"category_scores_gemma":[0.0018004656,0.00050651183,0.0007846895,0.0017038723,0.0003848112,0.0013175287,0.0018355952,0.0008326609,0.009169354],"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.0003031288,0.00008298096,0.00022685896,0.00018380412,0.000071182025,0.00013791995,0.000032205433,0.045582835,0.03599134,0.014201028,0.040458493,0.86272824],"study_design_scores_gemma":[0.000054938184,0.00006993575,0.0006963569,0.000038998824,0.00006283371,0.00057996606,0.000053435826,0.883839,0.03605482,0.041440144,0.037077196,0.000032280786],"about_ca_topic_score_codex":0.0019037158,"about_ca_topic_score_gemma":0.0028958032,"teacher_disagreement_score":0.020781353,"about_ca_system_score_codex":0.0003847039,"about_ca_system_score_gemma":0.0007174952,"threshold_uncertainty_score":0.06952059},"labels":[],"label_agreement":null},{"id":"W4295793116","doi":"10.1007/978-3-031-15325-9_9","title":"Designing an Anti-Bullying Serious Game: Insights from Interviews with Teachers","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bullying, Victimization, and Aggression","field":"Psychology","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 Manitoba; University of Waterloo","funders":"","keywords":"Psychological intervention; Intervention (counseling); Psychology; Robot; Qualitative research; Work (physics); Applied psychology; Computer science; Engineering; Sociology; Artificial intelligence","score_opus":0.02701582161042486,"score_gpt":0.280518019803076,"score_spread":0.25350219819265113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295793116","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.97294575,0.00065423,0.011044908,0.0016110849,0.000076259654,0.0003915078,0.00008535157,0.000082298604,0.013108474],"genre_scores_gemma":[0.9839018,0.0005861134,0.0059173885,0.0005295501,0.000011345258,0.00024783146,0.000058439688,0.00008227111,0.008665286],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9947988,0.0034091778,0.0001967,0.00036291147,0.0005222184,0.00071010727],"domain_scores_gemma":[0.98978525,0.007155102,0.0007304265,0.00016678883,0.000690486,0.0014719855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006060549,0.00076633913,0.0007433061,0.0010387285,0.0074903835,0.004948531,0.0018734746,0.00178549,0.0019014088],"category_scores_gemma":[0.0140281925,0.0009783785,0.0003091331,0.00059487583,0.0048033474,0.0039165607,0.0030800076,0.004000797,0.00046064542],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003299588,0.00032420587,0.005125027,0.00013645848,0.000006409299,0.00082367146,0.9800143,0.00009267851,0.0023177408,0.00097613526,0.0009835425,0.009166926],"study_design_scores_gemma":[0.000010333143,0.00015628472,0.0053871195,0.00015033153,0.000015114192,0.00058301777,0.97639364,0.00026582033,0.0009266449,0.00043466897,0.015652683,0.000024266394],"about_ca_topic_score_codex":0.007993907,"about_ca_topic_score_gemma":0.024658298,"teacher_disagreement_score":0.007993907,"about_ca_system_score_codex":0.0025355236,"about_ca_system_score_gemma":0.0038855853,"threshold_uncertainty_score":0.032051682},"labels":[],"label_agreement":null},{"id":"W4295793620","doi":"10.1007/978-3-031-16431-6_9","title":"Feature Robustness and Sex Differences in Medical Imaging: A Case Study in MRI-Based Alzheimer’s Disease Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":33,"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":"Canadian Institutes of Health Research; University of California, Los Angeles; University of California, San Diego; National Institutes of Health; Northern California Institute for Research and Education","keywords":"Computer science; Robustness (evolution); Artificial intelligence; Convolutional neural network; Logistic regression; Pattern recognition (psychology); Spurious relationship; Feature selection; Machine learning; Medical imaging; Regression; Training set; Statistics","score_opus":0.018122556531423632,"score_gpt":0.2913809454110273,"score_spread":0.2732583888796037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295793620","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.9641101,0.0063906717,0.020701397,0.0013269368,0.000102180304,0.000077953686,0.0004534373,0.000094038696,0.006743351],"genre_scores_gemma":[0.9874949,0.0015427038,0.007938365,0.00013246854,0.00009690377,0.000010181199,0.00015903627,0.000075198965,0.0025502043],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999559,0.00011606889,0.00004128216,0.00009209737,0.00013100915,0.000060642782],"domain_scores_gemma":[0.996985,0.0021601836,0.00027677574,0.00021858586,0.00025099452,0.0001084074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015192088,0.00047524984,0.00048792662,0.0008960992,0.00038243827,0.00097333,0.0005573194,0.0012612556,0.0022075905],"category_scores_gemma":[0.0069251833,0.00019509364,0.00055056624,0.0007795581,0.0005949926,0.0004651277,0.00045880247,0.00051160133,0.00046752073],"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.0019666655,0.0006737356,0.3911504,0.000583305,0.00030836216,0.10143517,0.00294964,0.0039997348,0.037948985,0.0042135892,0.006078961,0.44869152],"study_design_scores_gemma":[0.0000741233,0.0018159214,0.51901203,0.00028221594,0.0006001809,0.37602073,0.0038054273,0.033554383,0.037540037,0.0119873,0.015167499,0.00014008285],"about_ca_topic_score_codex":0.0015611657,"about_ca_topic_score_gemma":0.0021763025,"teacher_disagreement_score":0.0022075905,"about_ca_system_score_codex":0.00028618428,"about_ca_system_score_gemma":0.00019548317,"threshold_uncertainty_score":0.008034408},"labels":[],"label_agreement":null},{"id":"W4295915720","doi":"10.1007/978-3-031-16452-1_47","title":"CRISP - Reliable Uncertainty Estimation for Medical Image Segmentation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Probabilistic logic; Pixel; Image (mathematics); Image segmentation; Pattern recognition (psychology); Estimation; Machine learning","score_opus":0.01105213752361479,"score_gpt":0.3077883532308969,"score_spread":0.29673621570728215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295915720","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.0014440344,0.0005779768,0.9970497,0.00006832228,0.000024966705,0.000013177373,0.000053770837,0.00026263416,0.000505491],"genre_scores_gemma":[0.19935991,0.0014079297,0.7924906,0.00017789438,0.00018547833,0.00012623615,0.0005876702,0.0005308803,0.005133287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903226,0.00021165388,0.00006798126,0.00021166014,0.0004198988,0.000056474873],"domain_scores_gemma":[0.99820447,0.0010610372,0.0001246289,0.00026098848,0.00031483502,0.000034007335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014018033,0.00088590913,0.0015426663,0.0012587071,0.00035076647,0.0014758137,0.0016389786,0.00164586,0.0037524179],"category_scores_gemma":[0.006991381,0.0009802576,0.0012131811,0.0015190273,0.0010686503,0.0017124792,0.0023242468,0.0017308408,0.0009978946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024882026,0.00003856195,0.00029810236,0.00044595957,0.0000983946,0.00012562916,0.000117567,0.50165033,0.017301513,0.032405242,0.004822412,0.4424475],"study_design_scores_gemma":[0.0000036461802,0.000021899607,0.00017054967,0.000018524515,0.000012067072,0.000048856593,0.0000066818566,0.9734019,0.003674836,0.021193855,0.00143428,0.000012940066],"about_ca_topic_score_codex":0.0025504248,"about_ca_topic_score_gemma":0.0018843712,"teacher_disagreement_score":0.0037524179,"about_ca_system_score_codex":0.00085811364,"about_ca_system_score_gemma":0.00082125637,"threshold_uncertainty_score":0.012553036},"labels":[],"label_agreement":null},{"id":"W4295915865","doi":"10.1007/978-3-031-16452-1_26","title":"Leveraging Labeling Representations in Uncertainty-Based Semi-supervised Segmentation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Representation (politics); Inference; Consistency (knowledge bases); Pattern recognition (psychology); Pixel; Image segmentation; Scale-space segmentation; Labeled data; Machine learning","score_opus":0.029018815216041022,"score_gpt":0.2846402789262108,"score_spread":0.2556214637101698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295915865","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.0097723715,0.00036989857,0.9874906,0.00015550539,0.000043590127,0.00005228212,0.00013067122,0.0013240572,0.0006610413],"genre_scores_gemma":[0.36565682,0.0005857179,0.627195,0.00042093435,0.00023817123,0.00024571916,0.0020372304,0.0009712318,0.0026491282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747086,0.0007349611,0.00018787418,0.0007669061,0.00059215614,0.00024721396],"domain_scores_gemma":[0.9934807,0.0036001422,0.0006636769,0.0010464948,0.0009894954,0.0002194828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324707,0.0017263102,0.0031631857,0.0025931194,0.0011184845,0.0033852484,0.004130385,0.0040290114,0.0022395358],"category_scores_gemma":[0.00954233,0.0015948003,0.002313751,0.0031759674,0.0018273802,0.0048044007,0.0040399553,0.0031890874,0.0013550326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005460899,0.00023311534,0.0010479691,0.00034681108,0.00021318428,0.00018627905,0.00036464675,0.5012993,0.014267622,0.0171915,0.005461946,0.45884153],"study_design_scores_gemma":[0.000005881532,0.000026602898,0.00008406137,0.0000163403,0.000014613446,0.00003169575,0.00001426325,0.9860255,0.001831883,0.011522974,0.0004149113,0.000011238313],"about_ca_topic_score_codex":0.005991082,"about_ca_topic_score_gemma":0.007682557,"teacher_disagreement_score":0.005991082,"about_ca_system_score_codex":0.0014130392,"about_ca_system_score_gemma":0.0017306957,"threshold_uncertainty_score":0.017582893},"labels":[],"label_agreement":null},{"id":"W4295917217","doi":"10.1007/978-3-031-16440-8_21","title":"Physically Inspired Constraint for Unsupervised Regularized Ultrasound Elastography","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Elastography; Computer science; Optical flow; Displacement field; Displacement (psychology); Imaging phantom; Artificial intelligence; Kinematics; Rendering (computer graphics); Radio frequency; Computer vision; Ultrasound; Acoustics; Physics; Optics; Image (mathematics); Finite element method; Telecommunications","score_opus":0.01242581611539651,"score_gpt":0.2420482096116571,"score_spread":0.2296223934962606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295917217","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.000802289,0.00015334655,0.9974247,0.0000772245,0.000032940978,0.000011183452,0.00004152273,0.00017578233,0.0012809347],"genre_scores_gemma":[0.08484689,0.0007630946,0.89711237,0.00024307301,0.00019627254,0.0001730907,0.00056588254,0.00077110954,0.01532826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994816,0.00015695719,0.000024138182,0.000105387924,0.00020460029,0.000027324979],"domain_scores_gemma":[0.9989819,0.00060275785,0.0000796447,0.0001790827,0.00011414823,0.000042353637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071546866,0.00069229124,0.0011883678,0.0004461603,0.00029722787,0.0010876418,0.0017866539,0.0014342675,0.005104255],"category_scores_gemma":[0.0026714988,0.0007374205,0.00083612546,0.0008051643,0.0011174009,0.0012638969,0.0020093436,0.0020147515,0.0015011587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011246129,0.00006322082,0.00019248127,0.0003720761,0.000091071925,0.00014936742,0.00008967247,0.67003256,0.02407105,0.0992333,0.010739706,0.194853],"study_design_scores_gemma":[0.0000052387136,0.000014255899,0.0000567781,0.000013445196,0.0000043426403,0.00006267346,0.000004043619,0.9754617,0.0016336186,0.018640095,0.00409338,0.00001044731],"about_ca_topic_score_codex":0.0013192144,"about_ca_topic_score_gemma":0.0022667558,"teacher_disagreement_score":0.005104255,"about_ca_system_score_codex":0.00048504118,"about_ca_system_score_gemma":0.0006447075,"threshold_uncertainty_score":0.01707542},"labels":[],"label_agreement":null},{"id":"W4295935374","doi":"10.1007/978-3-031-16443-9_24","title":"Learning Tumor-Induced Deformations to Improve Tumor-Bearing Brain MR Segmentation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Atlas (anatomy); Brain tumor; Ground truth; Deep learning; Brain atlas; Computer vision; Image segmentation; Pattern recognition (psychology); Geology; Medicine","score_opus":0.015978571254670216,"score_gpt":0.2737064840033303,"score_spread":0.2577279127486601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295935374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07658852,0.002273081,0.91240036,0.00040920664,0.00015181031,0.00007794035,0.00041492018,0.00529293,0.0023911293],"genre_scores_gemma":[0.5277179,0.0027016057,0.4541489,0.00041137583,0.00030342353,0.00009256296,0.0022281138,0.0018579927,0.010538159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.000026330072,0.000011819031,0.000062658706,0.000068391535,0.0000319907],"domain_scores_gemma":[0.9996216,0.00013609209,0.00006333725,0.0000696049,0.00008094293,0.0000283259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056793465,0.0010295876,0.00087672827,0.00090207736,0.00024114677,0.0008738151,0.0008981058,0.0011955746,0.0019046993],"category_scores_gemma":[0.0013818154,0.0004918435,0.0008641433,0.0010520307,0.0003862725,0.0007609178,0.00078606623,0.0010727063,0.0012124579],"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.00042711105,0.0001709074,0.001316895,0.00022647575,0.00015318024,0.0001783021,0.00009290886,0.1286231,0.14013153,0.0019240428,0.0062364317,0.7205191],"study_design_scores_gemma":[0.000016333086,0.00012728016,0.0017881952,0.000023249178,0.00008801537,0.0004742183,0.000030869614,0.9409806,0.05045809,0.0029180658,0.0030723473,0.000022737071],"about_ca_topic_score_codex":0.0021378268,"about_ca_topic_score_gemma":0.0036515966,"teacher_disagreement_score":0.0021378268,"about_ca_system_score_codex":0.00030880052,"about_ca_system_score_gemma":0.0006171439,"threshold_uncertainty_score":0.0063718557},"labels":[],"label_agreement":null},{"id":"W4295936750","doi":"10.1007/978-3-031-16440-8_40","title":"Towards Confident Detection of Prostate Cancer Using High Resolution Micro-ultrasound","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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 British Columbia; Queen's University","funders":"","keywords":"Computer science; Artificial intelligence; Prostate cancer; Prostate biopsy; Ultrasound; Deep learning; Biopsy; Cancer detection; Metric (unit); Prostate; Noise (video); Pattern recognition (psychology); Machine learning; Cancer; Radiology; Medicine; Image (mathematics)","score_opus":0.021460835886286944,"score_gpt":0.27762795952032204,"score_spread":0.2561671236340351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295936750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072919843,0.009532938,0.97101843,0.00091397844,0.0003715792,0.000054679505,0.00022531551,0.0017040219,0.008887082],"genre_scores_gemma":[0.09891171,0.0111661935,0.8426766,0.0012800962,0.0006024338,0.00007009925,0.00084121875,0.0004380871,0.04401351],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920267,0.0001078382,0.00002681874,0.00009779567,0.0005244977,0.00004041484],"domain_scores_gemma":[0.9982488,0.001071064,0.0000969553,0.00022349166,0.0003182148,0.000041486233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095293554,0.0006811,0.0007369502,0.0008236635,0.00020342873,0.0015340799,0.0015617574,0.0014785349,0.0055957483],"category_scores_gemma":[0.00306637,0.0008356232,0.00053822924,0.0005407726,0.00061795226,0.0015122225,0.0015303749,0.001646861,0.005962688],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018734812,0.00006820235,0.0010868568,0.0007454486,0.000083278144,0.000267367,0.00012646613,0.011851012,0.27110076,0.017166816,0.015950726,0.6813657],"study_design_scores_gemma":[0.000034935412,0.00042059054,0.008434243,0.00036319136,0.00020387513,0.006313264,0.00015197165,0.47617227,0.34962708,0.041564435,0.11653633,0.00017779644],"about_ca_topic_score_codex":0.00040716826,"about_ca_topic_score_gemma":0.00068992184,"teacher_disagreement_score":0.0055957483,"about_ca_system_score_codex":0.00023343368,"about_ca_system_score_gemma":0.00033428558,"threshold_uncertainty_score":0.018719614},"labels":[],"label_agreement":null},{"id":"W4295938638","doi":"10.1007/978-3-031-16440-8_35","title":"EchoGNN: Explainable Ejection Fraction Estimation with Graph Neural Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiovascular Function and Risk Factors","field":"Medicine","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Tracing; Ejection fraction; Classifier (UML); Pattern recognition (psychology); Theoretical computer science; Heart failure","score_opus":0.010868557923345843,"score_gpt":0.2297374645726314,"score_spread":0.21886890664928554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295938638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057596373,0.0012801922,0.9841648,0.0003722844,0.00034416496,0.00003003617,0.0011316155,0.004479948,0.0024374048],"genre_scores_gemma":[0.21052687,0.0023291835,0.7524874,0.00059029757,0.00054011215,0.00023008548,0.0058439216,0.0019947411,0.025457319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998907,0.000022367882,0.000004382148,0.00004173263,0.00003008659,0.000010807151],"domain_scores_gemma":[0.9997377,0.00016386854,0.000013446325,0.000039202067,0.000036436573,0.000009262949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033953946,0.00079139584,0.00048830215,0.00033250917,0.00014141243,0.0004973211,0.0011591801,0.00090847624,0.0054335077],"category_scores_gemma":[0.0015037783,0.00044747812,0.000718436,0.0003808714,0.00022854307,0.0008052637,0.0006919417,0.0013211261,0.0021010092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009189047,0.00004931078,0.00058475434,0.000119656026,0.00012126559,0.00012775687,0.000025745736,0.60662276,0.0032330228,0.010823855,0.028495986,0.3497041],"study_design_scores_gemma":[0.000006761126,0.00000849344,0.00021317926,0.000010534934,0.000008644438,0.000023296328,0.000002075116,0.98453563,0.0006916511,0.011127299,0.00336553,0.0000068277373],"about_ca_topic_score_codex":0.0048495866,"about_ca_topic_score_gemma":0.0068419077,"teacher_disagreement_score":0.0054335077,"about_ca_system_score_codex":0.00027135556,"about_ca_system_score_gemma":0.00032065972,"threshold_uncertainty_score":0.018176854},"labels":[],"label_agreement":null},{"id":"W4295940462","doi":"10.1007/978-3-031-16270-1_17","title":"A Novel Hybrid Framework to Enhance Zero-shot Classification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Exploit; Transformer; Artificial intelligence; Categorical variable; Language model; Data mining; Machine learning; Natural language processing","score_opus":0.03860569090495036,"score_gpt":0.28756313973566006,"score_spread":0.2489574488307097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295940462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010461488,0.0014718267,0.9800046,0.00017034805,0.00026795318,0.000100937694,0.0003587277,0.004506877,0.0026572957],"genre_scores_gemma":[0.18827544,0.001210637,0.78000575,0.0005269783,0.0005985015,0.00026909256,0.0040035355,0.0010934114,0.024016634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985493,0.0002380828,0.00005851817,0.00041390955,0.0005391988,0.00020091436],"domain_scores_gemma":[0.99904495,0.00023608778,0.000035263954,0.00020317538,0.00038026783,0.000100212594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012164923,0.001371127,0.0020894003,0.002619838,0.0010025721,0.0021472413,0.0029006647,0.0020681059,0.006065224],"category_scores_gemma":[0.0018378516,0.00045447142,0.0013366676,0.0023296946,0.00053132983,0.0029625667,0.0027417499,0.0018991857,0.0046547893],"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.0003518572,0.00043963385,0.00068167294,0.00019619713,0.00013982905,0.00009320763,0.000115579154,0.012192694,0.043263003,0.0069799805,0.016389288,0.91915697],"study_design_scores_gemma":[0.00002858176,0.00014306686,0.0009494537,0.000028918066,0.00010594649,0.00022565627,0.00006033023,0.9538683,0.0213451,0.011162414,0.012036475,0.000045765264],"about_ca_topic_score_codex":0.008856818,"about_ca_topic_score_gemma":0.01899955,"teacher_disagreement_score":0.008856818,"about_ca_system_score_codex":0.00067359547,"about_ca_system_score_gemma":0.0014255132,"threshold_uncertainty_score":0.020290196},"labels":[],"label_agreement":null},{"id":"W4295990989","doi":"10.1007/978-3-031-16802-4_30","title":"Conducting the Opera: The Evolution of the RDA Work to the Share-VDE Opus and BIBFRAME Hub","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Library Science and Information 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":"Opera; Computer science; Framing (construction); Opus; Work (physics); World Wide Web; Operations research; Visual arts; History; Art; Engineering; Operating system; Mechanical engineering","score_opus":0.03125923945418539,"score_gpt":0.22946378916276441,"score_spread":0.19820454970857904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295990989","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.012886062,0.0014335553,0.07217412,0.0121180415,0.002506255,0.0001627683,0.00020432663,0.002541217,0.89597356],"genre_scores_gemma":[0.09404356,0.0015167572,0.0648429,0.0026969702,0.00048821294,0.00012498697,0.00025508847,0.003915594,0.8321158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9980149,0.0006015264,0.000046995287,0.0003856705,0.00068532425,0.00026558226],"domain_scores_gemma":[0.99739385,0.0006733502,0.00007127038,0.0007559638,0.0004514886,0.0006542044],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00386622,0.0005206547,0.00033859297,0.0015890956,0.004134088,0.01260234,0.0024069864,0.002538928,0.053692386],"category_scores_gemma":[0.005610196,0.0006607604,0.00051033066,0.0016800201,0.0072885635,0.009749837,0.0059855394,0.0047461274,0.015047144],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007515006,0.00009524442,0.0005490009,0.000085913656,0.000005989757,0.00011695125,0.0070637735,0.0005106448,0.0013394469,0.67971087,0.08573863,0.22470854],"study_design_scores_gemma":[0.000010448497,0.000043174903,0.0004637952,0.00010567825,0.0000054633156,0.0001245269,0.0018919911,0.0010430517,0.0007795233,0.035945438,0.9595633,0.00002348718],"about_ca_topic_score_codex":0.015357738,"about_ca_topic_score_gemma":0.022146294,"teacher_disagreement_score":0.9873977,"about_ca_system_score_codex":0.0058755567,"about_ca_system_score_gemma":0.007778486,"threshold_uncertainty_score":0.1796189},"labels":[],"label_agreement":null},{"id":"W4296050254","doi":"10.1007/978-3-031-16681-5_2","title":"On the Formalization of the Heat Conduction Problem in HOL","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Heat equation; Computer science; Heat transfer; Partial differential equation; Thermal conduction; Heat generation; Multivariable calculus; Applied mathematics; Mathematics; Algorithm; Mathematical analysis; Thermodynamics; Physics; Control engineering; Programming language","score_opus":0.02465029961017543,"score_gpt":0.23365780606932549,"score_spread":0.20900750645915006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296050254","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.026182232,0.0063151116,0.51257503,0.012498471,0.0018962842,0.00007981602,0.00033447583,0.0005835399,0.43953502],"genre_scores_gemma":[0.77324504,0.006276675,0.109705985,0.0035029121,0.0028773171,0.0002525454,0.00048223804,0.0008492575,0.10280806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994168,0.00021167216,0.000035244255,0.00009361505,0.00015575966,0.000086888394],"domain_scores_gemma":[0.99881953,0.0007879402,0.000049240396,0.00019211405,0.0001019148,0.00004916841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013222295,0.0005787128,0.00074665947,0.0010790906,0.0018427427,0.0033943967,0.0014881712,0.0014037791,0.010859573],"category_scores_gemma":[0.0026225746,0.0005495784,0.0012002581,0.0012865395,0.008065726,0.011704284,0.0022477927,0.004968394,0.0010917567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003856846,0.0000034611535,0.000009557209,0.000013492626,8.586652e-7,0.000010631101,0.000067896355,0.0002608433,0.000066044304,0.9974572,0.00081826927,0.0012879722],"study_design_scores_gemma":[0.000003466649,0.0000024832434,0.000020771391,0.000011740482,0.00000143298,0.000016753736,0.000026277337,0.0009426476,0.00009669368,0.99331325,0.0055614915,0.0000030239073],"about_ca_topic_score_codex":0.0013993838,"about_ca_topic_score_gemma":0.0014750165,"teacher_disagreement_score":0.010859573,"about_ca_system_score_codex":0.00209876,"about_ca_system_score_gemma":0.00079255534,"threshold_uncertainty_score":0.03632891},"labels":[],"label_agreement":null},{"id":"W4296054188","doi":"10.1007/978-3-031-16449-1_60","title":"On Surgical Planning of Percutaneous Nephrolithotomy with Patient-Specific CTRs","year":2022,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Kidney Stones and Urolithiasis Treatments","field":"Medicine","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":"Western University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Diabetes and Digestive and Kidney Diseases; National Institutes of Health; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Percutaneous nephrolithotomy; Percutaneous; Medicine; Surgery; Kidney stones; Computer science","score_opus":0.011964518980787061,"score_gpt":0.2567495171157574,"score_spread":0.24478499813497032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296054188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014615087,0.0019673249,0.96469206,0.00074488757,0.0001614606,0.000107650565,0.0002949523,0.000894256,0.016522232],"genre_scores_gemma":[0.42406774,0.0063072667,0.55655766,0.00032727787,0.00045950452,0.0001754627,0.0011719366,0.0004017607,0.010531458],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993573,0.00017374413,0.00004607196,0.00013005601,0.00023007461,0.0000627927],"domain_scores_gemma":[0.999446,0.00032674946,0.000030699415,0.000057226425,0.00010971866,0.000029547786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037965283,0.00069672253,0.0005455012,0.0009923186,0.0005221594,0.0011760987,0.0009410914,0.0007192163,0.008138966],"category_scores_gemma":[0.002180881,0.00066908327,0.001108597,0.00091617275,0.00041287308,0.00072027324,0.0012234038,0.00053931173,0.0010737369],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029983043,0.00008182697,0.009744645,0.00060801045,0.00009186578,0.0026305143,0.00025475209,0.370124,0.011378622,0.025186414,0.013057879,0.56654173],"study_design_scores_gemma":[0.000038842853,0.000187025,0.007304745,0.00017216426,0.000112456306,0.00666883,0.00024271921,0.9029453,0.012543346,0.03198903,0.037680652,0.00011485851],"about_ca_topic_score_codex":0.008626658,"about_ca_topic_score_gemma":0.00936108,"teacher_disagreement_score":0.008626658,"about_ca_system_score_codex":0.00055536855,"about_ca_system_score_gemma":0.0013704377,"threshold_uncertainty_score":0.027227521},"labels":[],"label_agreement":null},{"id":"W4296139443","doi":"10.1007/978-3-031-17114-7_23","title":"Automated Utterance Labeling of Conversations Using Natural Language Processing","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","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; University of British Columbia","funders":"","keywords":"Computer science; Utterance; Artificial intelligence; Python (programming language); Natural language processing; Domain adaptation; Task (project management); Context (archaeology); Classifier (UML); Programming language","score_opus":0.0318175748855377,"score_gpt":0.35639825419695326,"score_spread":0.32458067931141554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296139443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020336295,0.0007100676,0.9390452,0.00038434076,0.00028450318,0.0004475782,0.005548345,0.025927983,0.0073156827],"genre_scores_gemma":[0.10560251,0.00031791558,0.87047553,0.00011750885,0.00012065396,0.00042900228,0.015764872,0.0012807795,0.0058912565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726284,0.00104721,0.00017882125,0.00088485,0.00039050815,0.00023571744],"domain_scores_gemma":[0.99520004,0.0026424548,0.0002924285,0.000558822,0.001122844,0.00018331551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015005327,0.0015672117,0.0010641691,0.0024044663,0.0015808421,0.002669646,0.0018607696,0.0013175494,0.010304696],"category_scores_gemma":[0.004889923,0.00070543383,0.001348337,0.001603951,0.0005601806,0.0019037013,0.0019900657,0.0018865752,0.009770234],"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.00052250264,0.00027558437,0.0023654085,0.0006799424,0.000074144875,0.00033209752,0.001309364,0.007107011,0.093232974,0.0075899083,0.03693571,0.8495753],"study_design_scores_gemma":[0.000065238855,0.0002926969,0.00580089,0.00033325056,0.00018010603,0.0007700054,0.0026098443,0.74658406,0.1388752,0.03299863,0.07133085,0.00015918285],"about_ca_topic_score_codex":0.0064606396,"about_ca_topic_score_gemma":0.0099261645,"teacher_disagreement_score":0.010304696,"about_ca_system_score_codex":0.0008512715,"about_ca_system_score_gemma":0.0021875633,"threshold_uncertainty_score":0.034472644},"labels":[],"label_agreement":null},{"id":"W4296168370","doi":"10.1007/978-3-031-16081-3_34","title":"Fast Searching on k-Combinable Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Regina","funders":"","keywords":"Cartesian product; Product (mathematics); Graph; Search tree; Tree (set theory); Depth-first search; Search algorithm; Cartesian coordinate system","score_opus":0.021495394991355426,"score_gpt":0.2802285690483312,"score_spread":0.25873317405697577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296168370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2623999,0.003222096,0.600159,0.0015878888,0.00037961607,0.0003427546,0.0029219424,0.009908287,0.119078435],"genre_scores_gemma":[0.37306488,0.0021571973,0.56041485,0.0003208674,0.00014951878,0.00028190887,0.0042101815,0.0020225346,0.05737818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939394,0.0001041783,0.000039916948,0.0001514157,0.00018577902,0.00012477134],"domain_scores_gemma":[0.9974808,0.0015784249,0.00013267633,0.0005366386,0.00016834323,0.000103105966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003790368,0.0010000708,0.0014521657,0.0019033388,0.0012543208,0.001914427,0.0022587574,0.0011246996,0.021865033],"category_scores_gemma":[0.0030852638,0.0008332156,0.0011909776,0.0055916086,0.0008716164,0.006952412,0.0026354727,0.0012914551,0.004642357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074147107,0.00019853594,0.0016480702,0.0017226752,0.00014894009,0.0005405291,0.0007675326,0.059407517,0.026686609,0.18834361,0.064282015,0.65551245],"study_design_scores_gemma":[0.00015174651,0.00017506305,0.0015465794,0.00019405564,0.00014296436,0.0009894248,0.00045834537,0.24373579,0.011142494,0.7101522,0.031238634,0.00007282446],"about_ca_topic_score_codex":0.003062175,"about_ca_topic_score_gemma":0.0056119678,"teacher_disagreement_score":0.021865033,"about_ca_system_score_codex":0.0013844399,"about_ca_system_score_gemma":0.0008792291,"threshold_uncertainty_score":0.07314587},"labels":[],"label_agreement":null},{"id":"W4296195801","doi":"10.1007/978-3-031-16749-2_12","title":"Joint Paraspinal Muscle Segmentation and Inter-rater Labeling Variability Prediction with Multi-task TransUNet","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Western University; Concordia University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Pattern recognition (psychology); Convolutional neural network; Task (project management); Image segmentation; Machine learning","score_opus":0.013844293997364114,"score_gpt":0.221047465462829,"score_spread":0.20720317146546488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296195801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03620145,0.001487452,0.9549732,0.0002248985,0.00021407595,0.00010823924,0.00086210796,0.0038140551,0.0021144748],"genre_scores_gemma":[0.37743622,0.0011553566,0.593097,0.00032383038,0.00024164047,0.0003931235,0.004791886,0.002284198,0.020276627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854624,0.00034642257,0.000078072626,0.00062610896,0.0002470888,0.0001559895],"domain_scores_gemma":[0.9978124,0.0009173444,0.00020178767,0.00044198523,0.0005484239,0.00007799286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003498039,0.0015291913,0.0015392995,0.00093840127,0.0006852621,0.0019136237,0.0016688927,0.0018301655,0.0027361247],"category_scores_gemma":[0.0045998115,0.0007804292,0.0018037544,0.0013926803,0.0004750476,0.001275509,0.0017763282,0.001799657,0.0031918033],"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.00044221862,0.00013811243,0.002683009,0.0001361791,0.000342252,0.00016693972,0.00016744084,0.028128013,0.0383937,0.0012203774,0.0074891583,0.9206926],"study_design_scores_gemma":[0.00001567504,0.00020538642,0.009762071,0.000046087145,0.00016555013,0.0006276043,0.00011673106,0.9532639,0.026388982,0.005183206,0.0041616443,0.000063173364],"about_ca_topic_score_codex":0.0052834465,"about_ca_topic_score_gemma":0.012659757,"teacher_disagreement_score":0.0052834465,"about_ca_system_score_codex":0.0005480685,"about_ca_system_score_gemma":0.00096406153,"threshold_uncertainty_score":0.018499613},"labels":[],"label_agreement":null},{"id":"W4296196909","doi":"10.1007/978-3-031-16902-1_10","title":"Left Ventricle Contouring of Apical Three-Chamber Views on 2D Echocardiography","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Contouring; Artificial intelligence; Ground truth; Segmentation; Computer science; Apex (geometry); Contour line; Algorithm; Geometry; Computer vision; Mathematics; Computer graphics (images); Cartography; Geography","score_opus":0.021110290498877412,"score_gpt":0.3007098543464924,"score_spread":0.279599563847615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296196909","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.05252949,0.00026074165,0.9436894,0.000110494286,0.000043152733,0.0000639318,0.00027085576,0.0022775598,0.000754317],"genre_scores_gemma":[0.35640046,0.00036015152,0.64064354,0.00010626217,0.00005279588,0.00007625741,0.00056458917,0.00029062378,0.0015052594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999553,0.00008837274,0.000025863787,0.00014506408,0.00015337406,0.00003433873],"domain_scores_gemma":[0.9993661,0.00025744346,0.00008452423,0.00010047509,0.00014927034,0.00004219621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007377249,0.0007339788,0.00070703536,0.0014438322,0.00026993972,0.0013912746,0.00081254117,0.0011757486,0.0014616401],"category_scores_gemma":[0.0019542146,0.0005552629,0.0007070266,0.00054751453,0.0003928628,0.0010213943,0.0008175522,0.0005395334,0.0009311076],"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.00044965988,0.00009781998,0.008795261,0.00019650078,0.000110883586,0.0004605228,0.00027597384,0.12241129,0.114448555,0.0017316419,0.0029927879,0.7480291],"study_design_scores_gemma":[0.00001077062,0.0000468429,0.0036051197,0.000021262327,0.000019037083,0.00021993206,0.00003372864,0.9732233,0.020493517,0.0010196967,0.001280908,0.000025825082],"about_ca_topic_score_codex":0.002633597,"about_ca_topic_score_gemma":0.004934125,"teacher_disagreement_score":0.002633597,"about_ca_system_score_codex":0.00035001338,"about_ca_system_score_gemma":0.00042310017,"threshold_uncertainty_score":0.0052365065},"labels":[],"label_agreement":null},{"id":"W4296433611","doi":"10.1007/978-3-031-15922-0_5","title":"Towards Automatic OpenMP-Aware Utilization of Fast GPU Memory","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Western University","funders":"","keywords":"Computer science; Compiler; Parallel computing; Reuse; Shared memory; Memory management; Computer architecture; Operating system; Embedded system; Semiconductor memory","score_opus":0.028979810775775147,"score_gpt":0.27768554365217474,"score_spread":0.24870573287639958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296433611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0905233,0.002744491,0.87175804,0.00037639905,0.00031890345,0.00008108128,0.00048550696,0.01970343,0.014008808],"genre_scores_gemma":[0.44249442,0.00078115304,0.5444819,0.00026000073,0.00011216867,0.0001107992,0.0012650137,0.0023660979,0.008128464],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994041,0.00009180627,0.00003452145,0.00012250956,0.00022543703,0.000121657424],"domain_scores_gemma":[0.99895775,0.0002711561,0.000064280044,0.0003186565,0.00033202724,0.000056074714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039326467,0.00086690066,0.0006572752,0.0007800444,0.0007072614,0.0017848986,0.0020589777,0.00067784544,0.0038606268],"category_scores_gemma":[0.0018672842,0.0006269905,0.00043535762,0.0010508607,0.0003544296,0.001618972,0.0016862017,0.0010737404,0.0016753554],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078622263,0.00021290558,0.0032750426,0.00052563415,0.00010914537,0.00028163812,0.00026459168,0.056669477,0.1815818,0.01229912,0.023678275,0.72031605],"study_design_scores_gemma":[0.000051557166,0.00010717353,0.0016842998,0.000049404473,0.000056200806,0.00021501708,0.00009834618,0.8701415,0.096724965,0.012441528,0.018394552,0.000035421137],"about_ca_topic_score_codex":0.0019993752,"about_ca_topic_score_gemma":0.0038705857,"teacher_disagreement_score":0.0038606268,"about_ca_system_score_codex":0.00041856102,"about_ca_system_score_gemma":0.00091678137,"threshold_uncertainty_score":0.012915075},"labels":[],"label_agreement":null},{"id":"W4296872766","doi":"10.1007/978-3-031-16815-4","title":"Applied Cryptography and Network Security Workshops","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Concordia University","funders":"","keywords":"Cryptography; Computer security; Computer science; Neural cryptography; Network security; Public-key cryptography; Encryption","score_opus":0.006504317476246971,"score_gpt":0.2122069726922096,"score_spread":0.20570265521596262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296872766","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092167985,0.0368434,0.08151521,0.014065478,0.030318284,0.00025668912,0.0005989646,0.0017959405,0.82538927],"genre_scores_gemma":[0.018208917,0.009507909,0.010005568,0.00060281623,0.002849216,0.00007941443,0.0005191917,0.00025309657,0.9579741],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991535,0.00020477592,0.00002827246,0.00011498506,0.0003696991,0.00012881843],"domain_scores_gemma":[0.99918026,0.00015702916,0.000030764775,0.00011788835,0.0002724131,0.0002417141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015763036,0.0012939434,0.0006523563,0.0011960433,0.0011189337,0.0031229968,0.0012582553,0.0011415646,0.0851218],"category_scores_gemma":[0.0012423185,0.0005289614,0.0007089738,0.001883185,0.00047273116,0.0025622037,0.001979809,0.0023805562,0.046472896],"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.00015214943,0.0002605574,0.00020652142,0.0002936748,0.000021029777,0.00016391624,0.00021533319,0.002532973,0.0041155694,0.03669027,0.6044923,0.35085577],"study_design_scores_gemma":[0.000018997334,0.000102717335,0.0005209633,0.00020045896,0.000017871229,0.00029314318,0.00013988072,0.005812519,0.002387473,0.025119461,0.96536916,0.000017459623],"about_ca_topic_score_codex":0.00097342866,"about_ca_topic_score_gemma":0.0027379312,"teacher_disagreement_score":0.0851218,"about_ca_system_score_codex":0.0010455786,"about_ca_system_score_gemma":0.0017914063,"threshold_uncertainty_score":0.28476083},"labels":[],"label_agreement":null},{"id":"W4296878065","doi":"10.1007/978-3-031-17120-8_31","title":"Coarse-to-Fine Retriever for Better Open-Domain Question Answering","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Labrador Retriever; Computer science; Domain (mathematical analysis); Representation (politics); Construct (python library); Information retrieval; Artificial intelligence; Reading (process); Natural language processing; Linguistics; Mathematics; Programming language","score_opus":0.02721815459113205,"score_gpt":0.2740297315924848,"score_spread":0.24681157700135273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296878065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029288696,0.003209458,0.7698499,0.0014603212,0.0010904229,0.0007435098,0.008192949,0.17266354,0.01350118],"genre_scores_gemma":[0.13740303,0.0010532188,0.7980401,0.0014992324,0.0007878595,0.00042299,0.03068357,0.008193841,0.02191618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974093,0.0006308859,0.00032513094,0.0008009514,0.0005555954,0.00027821117],"domain_scores_gemma":[0.9935096,0.0022347271,0.00014121275,0.0027345896,0.0010487272,0.00033112368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023971198,0.0026155345,0.003106172,0.0041977228,0.0012356173,0.0037160763,0.0031142368,0.0031561207,0.05008301],"category_scores_gemma":[0.0103554195,0.0010560554,0.0021968747,0.0032629922,0.0008846363,0.010059564,0.0064116353,0.0036504588,0.044418924],"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.0008201114,0.0006521488,0.0011431768,0.00091802806,0.00013270564,0.00036380443,0.0004331142,0.003504741,0.05533867,0.010071245,0.15465201,0.7719702],"study_design_scores_gemma":[0.0005226311,0.0008632884,0.0034450558,0.00027336096,0.00042345797,0.0020499628,0.0012773369,0.5554572,0.12901054,0.103395514,0.202963,0.00031859684],"about_ca_topic_score_codex":0.00366304,"about_ca_topic_score_gemma":0.0072179567,"teacher_disagreement_score":0.05008301,"about_ca_system_score_codex":0.0008302132,"about_ca_system_score_gemma":0.0016792286,"threshold_uncertainty_score":0.16754436},"labels":[],"label_agreement":null},{"id":"W4296959973","doi":"10.1007/978-3-031-17027-0_11","title":"Efficient Medical Image Assessment via Self-supervised Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Leverage (statistics); Artificial intelligence; Embedding; Autoencoder; Machine learning; Image (mathematics); Pattern recognition (psychology); Data mining; Deep learning","score_opus":0.008906780855070427,"score_gpt":0.2545659366843183,"score_spread":0.24565915582924788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296959973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009259143,0.000271573,0.9872131,0.00010516125,0.000029858606,0.00005663985,0.000078688034,0.0019043359,0.0010815118],"genre_scores_gemma":[0.24064593,0.00044422798,0.7494337,0.00020431523,0.00012718045,0.00011415417,0.00063240906,0.0004615174,0.007936516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911314,0.00018138986,0.000055623434,0.00020603286,0.00037986424,0.00006394206],"domain_scores_gemma":[0.9982108,0.0006523587,0.0001460572,0.00031506587,0.0006139861,0.00006180894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012713543,0.0007162075,0.0011835857,0.0011145236,0.00028273487,0.001174061,0.0013956545,0.0011137325,0.0039910194],"category_scores_gemma":[0.003297363,0.00044930898,0.0007793575,0.0006852144,0.0003887472,0.0013690203,0.0016081808,0.00096394675,0.002734651],"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.0001534611,0.000105279425,0.00081464613,0.00010080689,0.00005718999,0.00005006725,0.00003299965,0.033050425,0.028696666,0.001544982,0.0053412556,0.93005234],"study_design_scores_gemma":[0.000008634469,0.00007307542,0.0008129048,0.000012956436,0.000024418563,0.00023975044,0.00001665093,0.9755613,0.018450137,0.0031062947,0.0016823808,0.000011463188],"about_ca_topic_score_codex":0.0011368851,"about_ca_topic_score_gemma":0.0023860023,"teacher_disagreement_score":0.0039910194,"about_ca_system_score_codex":0.0003687543,"about_ca_system_score_gemma":0.0005867961,"threshold_uncertainty_score":0.013351262},"labels":[],"label_agreement":null},{"id":"W4296960568","doi":"10.1007/978-3-031-16760-7_1","title":"Heatmap Regression for Lesion Detection Using Pointwise Annotations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Segmentation; Computer science; Pointwise; Artificial intelligence; Probabilistic logic; Pattern recognition (psychology); Regression; Point (geometry); Lesion; Computer vision; Mathematics; Statistics; Medicine; Pathology","score_opus":0.04466713705296635,"score_gpt":0.30923647288546136,"score_spread":0.264569335832495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296960568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014100165,0.00073857175,0.9706307,0.00019402737,0.00022233278,0.00011733077,0.0015184932,0.010270158,0.002208295],"genre_scores_gemma":[0.27245173,0.0009806323,0.69307816,0.00018182065,0.00025495762,0.00040857377,0.0057584057,0.0024498245,0.02443591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947447,0.00008700045,0.000017249904,0.0001643015,0.00018336064,0.00007357596],"domain_scores_gemma":[0.9989575,0.00038823445,0.0000648695,0.00020730325,0.0003453394,0.00003670034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008064282,0.0013605984,0.001260673,0.0017852451,0.0005011038,0.0012735176,0.0020297107,0.0013408299,0.009721624],"category_scores_gemma":[0.002968573,0.00057086337,0.0013678519,0.0020461164,0.00037289463,0.0010119159,0.0010726046,0.0014494896,0.0074629635],"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.00031995584,0.00012481149,0.0013396838,0.0002504978,0.00011409389,0.000092966686,0.00007326961,0.048881628,0.034971673,0.0027559742,0.029974058,0.8811014],"study_design_scores_gemma":[0.0000123704785,0.00007357479,0.0023064923,0.000037476682,0.00004461234,0.00014704176,0.00003370816,0.9527554,0.031083742,0.0063008927,0.007159416,0.00004529587],"about_ca_topic_score_codex":0.0051839557,"about_ca_topic_score_gemma":0.006310168,"teacher_disagreement_score":0.009721624,"about_ca_system_score_codex":0.0004898917,"about_ca_system_score_gemma":0.00063097366,"threshold_uncertainty_score":0.032522142},"labels":[],"label_agreement":null},{"id":"W4296962373","doi":"10.1007/978-3-031-16760-7_8","title":"Multi-Feature Vision Transformer via Self-Supervised Representation Learning for Improvement of COVID-19 Diagnosis","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Semi-supervised learning; Feature (linguistics); Machine learning; Coronavirus disease 2019 (COVID-19); Feature learning; Supervised learning; Labeled data; Deep learning; Context (archaeology); Pattern recognition (psychology); Artificial neural network; Infectious disease (medical specialty); Medicine; Pathology; Disease","score_opus":0.03159226809544642,"score_gpt":0.33671018786161755,"score_spread":0.30511791976617114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296962373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513984,0.0005125284,0.9843035,0.00014336067,0.00009677317,0.000055147735,0.00012735279,0.002283654,0.0019637537],"genre_scores_gemma":[0.39945236,0.0005631243,0.5894788,0.0003058096,0.00012610336,0.00009889587,0.001280773,0.00034577373,0.00834848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994875,0.000075108495,0.0000300748,0.00016248644,0.00017027814,0.00007461695],"domain_scores_gemma":[0.999524,0.0001188951,0.000038302565,0.00009244428,0.00020072707,0.000025609008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068295415,0.00090743124,0.0010048714,0.0010253378,0.00037012575,0.0009327018,0.0013972265,0.0010458849,0.0041373596],"category_scores_gemma":[0.0015054094,0.00034524413,0.0010800394,0.0008951093,0.00031612904,0.0011771405,0.001190347,0.0013484046,0.0019533872],"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.00018618711,0.00016467413,0.000655333,0.0000948917,0.0000691187,0.00010589407,0.00004354472,0.03267845,0.02758287,0.0030154493,0.008016405,0.92738736],"study_design_scores_gemma":[0.000011325973,0.00008764668,0.0005401599,0.000012176957,0.0000442562,0.000205959,0.000016692682,0.9750914,0.019113598,0.002417616,0.0024458107,0.000013400174],"about_ca_topic_score_codex":0.0037251294,"about_ca_topic_score_gemma":0.004093278,"teacher_disagreement_score":0.0041373596,"about_ca_system_score_codex":0.0004576035,"about_ca_system_score_gemma":0.0008704437,"threshold_uncertainty_score":0.013840854},"labels":[],"label_agreement":null},{"id":"W4296962792","doi":"10.1007/978-3-031-16760-7_2","title":"Partial Annotations for the Segmentation of Large Structures with Low Annotation Cost","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"","keywords":"Dice; Annotation; Computer science; Segmentation; Artificial intelligence; Task (project management); Pattern recognition (psychology); Sørensen–Dice coefficient; Image segmentation; Mathematics; Statistics","score_opus":0.018462691204214482,"score_gpt":0.273551194052744,"score_spread":0.25508850284852946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296962792","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.007737921,0.00090771087,0.9790638,0.00016367373,0.0001304443,0.000102829705,0.0012233353,0.007942477,0.0027276813],"genre_scores_gemma":[0.100879274,0.0011003604,0.8735017,0.00029693925,0.00022616451,0.0002702331,0.010125353,0.004165493,0.009434541],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871325,0.00024895722,0.00006931388,0.0005407225,0.0002849718,0.00014273796],"domain_scores_gemma":[0.996626,0.0012521165,0.00012093147,0.001344581,0.00048379716,0.00017254688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012034951,0.002226714,0.002149697,0.0022719651,0.0012513804,0.0019745466,0.0031537844,0.0030590235,0.015472295],"category_scores_gemma":[0.0049320585,0.0014791046,0.001675309,0.0029546574,0.0010877226,0.00416159,0.0032348684,0.0029085544,0.010004994],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006389871,0.00015711536,0.0004278294,0.0006997881,0.0001560176,0.00033616138,0.00020362917,0.038194165,0.08061878,0.012096802,0.028632391,0.8378384],"study_design_scores_gemma":[0.00007257367,0.0002058933,0.0012959839,0.00012872058,0.00015880853,0.00077140116,0.00019255129,0.8151037,0.06497409,0.08538415,0.031622566,0.00008956038],"about_ca_topic_score_codex":0.0035965368,"about_ca_topic_score_gemma":0.00894773,"teacher_disagreement_score":0.015472295,"about_ca_system_score_codex":0.0006958824,"about_ca_system_score_gemma":0.0016143243,"threshold_uncertainty_score":0.05175996},"labels":[],"label_agreement":null},{"id":"W4297198863","doi":"10.1007/978-3-031-16564-1_37","title":"Similarity Embedded Temporal Transformers: Enhancing Stock Predictions with Historically Similar Trends","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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 Ottawa","funders":"","keywords":"Econometrics; Autoregressive model; Transformer; Computer science; Extrapolation; Heteroscedasticity; Time horizon; Autoregressive integrated moving average; Time series; Stock market; Artificial intelligence; Machine learning; Economics; Finance; Engineering; Mathematics; Statistics; Geography","score_opus":0.0696663475278447,"score_gpt":0.34255120675554085,"score_spread":0.2728848592276961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297198863","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.13551866,0.00067710294,0.8574491,0.00022729987,0.00022508447,0.00005972028,0.00028858674,0.0018341907,0.0037202076],"genre_scores_gemma":[0.84152406,0.00068475463,0.1523628,0.000118932316,0.00019669702,0.000031617543,0.0005501148,0.00020330425,0.004327706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000036148693,0.000015934249,0.00005894264,0.000090732836,0.000022112516],"domain_scores_gemma":[0.9989711,0.00049371994,0.00012110787,0.00015533723,0.00019758433,0.00006114908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075904065,0.0004570538,0.0004692207,0.0006800243,0.00017780141,0.000829411,0.000763025,0.00051094906,0.0034558547],"category_scores_gemma":[0.003686809,0.0002426591,0.0003756373,0.0010823142,0.00024794837,0.002171806,0.0010251558,0.00069052767,0.0010183952],"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.00093915896,0.00035749844,0.004258097,0.00011017247,0.00008554749,0.00020800089,0.00011014746,0.10352237,0.03017563,0.01220614,0.004907,0.8431202],"study_design_scores_gemma":[0.000027748016,0.000120768214,0.0009128282,0.000008423342,0.000041796404,0.000112820926,0.000024245657,0.9784495,0.008890541,0.010161493,0.0012392297,0.0000105594345],"about_ca_topic_score_codex":0.0013904441,"about_ca_topic_score_gemma":0.002062763,"teacher_disagreement_score":0.0034558547,"about_ca_system_score_codex":0.0002562841,"about_ca_system_score_gemma":0.00038595338,"threshold_uncertainty_score":0.0115609765},"labels":[],"label_agreement":null},{"id":"W4297665265","doi":"10.1007/978-981-99-8248-6","title":"Entertainment Computing – ICEC 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":3,"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":"Conservatoire National des Arts et Métiers; Universidade do Minho; Peking University; Universität Bremen; Università degli Studi di Brescia; Universidade Federal Fluminense; Bauhaus-Universität Weimar; University of Crete; University of Glasgow; Universidade de Coimbra; International Science and Technology Center; Technische Universität Darmstadt; Beijing Jiaotong University; Universidade Federal do Rio Grande do Sul; Universidade Nova de Lisboa; Kungliga Tekniska Högskolan; Universiteit Maastricht; Orta Doğu Teknik Üniversitesi; Thompson Rivers University; Budapesti Műszaki és Gazdaságtudományi Egyetem; University of Hull; Universität Wien; Bournemouth University; Tongji University; Technische Universiteit Eindhoven; Zhejiang University; Università di Bologna; Universiti Utara Malaysia; Jyväskylän Yliopisto; Universidade de Aveiro; Nagoya City University; Universidad Politécnica de Madrid; Carnegie Mellon University","keywords":"Computer science; Entertainment; Computer graphics (images); Multimedia; Visual arts; Art","score_opus":0.018969574220959934,"score_gpt":0.29115150333152384,"score_spread":0.27218192911056394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297665265","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013580691,0.007383212,0.009523614,0.0014667754,0.0064950767,0.00017502253,0.0024881545,0.0020026679,0.9691075],"genre_scores_gemma":[0.0029561105,0.003132178,0.0021678898,0.00036151882,0.00070064416,0.0000737612,0.0027787825,0.0007290558,0.9871],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945015,0.000043332286,0.000016414455,0.00007240222,0.00033581894,0.00008185725],"domain_scores_gemma":[0.99933547,0.00008021037,0.000021672637,0.000069215195,0.00029211724,0.00020125923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010442208,0.0016249608,0.0008888176,0.0021605326,0.0009721469,0.0040871263,0.0012471647,0.001887456,0.30405053],"category_scores_gemma":[0.00087358325,0.0005272122,0.00071290106,0.0019868861,0.00047023935,0.0024700346,0.0015955613,0.0024789495,0.18600492],"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.00006979938,0.00006824539,0.00006462977,0.0001388046,0.000008541301,0.000029083454,0.00001367082,0.00056224497,0.0012348621,0.007149397,0.8490177,0.14164302],"study_design_scores_gemma":[0.0000115674375,0.000041377207,0.00032960437,0.0000925497,0.0000055759006,0.000052501695,0.000013084445,0.001230356,0.00073050504,0.0015084136,0.99597675,0.000007726694],"about_ca_topic_score_codex":0.0077305036,"about_ca_topic_score_gemma":0.012576449,"teacher_disagreement_score":0.30405053,"about_ca_system_score_codex":0.0016696771,"about_ca_system_score_gemma":0.0017771528,"threshold_uncertainty_score":0.99268746},"labels":[],"label_agreement":null},{"id":"W4297809233","doi":"10.1007/978-3-031-16770-6_12","title":"Same/Different Concept: An Embodied Spiking Neural Model in a Learning Context","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","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":"Cégep du Vieux Montréal; University of Ottawa","funders":"","keywords":"Computer science; Embodied cognition; Artificial intelligence; Spiking neural network; Context (archaeology); Novelty; Reinforcement learning; Robot; Discriminative model; Machine learning; Artificial neural network; Psychology","score_opus":0.02718551329419612,"score_gpt":0.2505099574343493,"score_spread":0.22332444414015318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297809233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24163797,0.0010490624,0.6889197,0.0043770354,0.0006931026,0.000066922126,0.00039198928,0.0005113036,0.062352944],"genre_scores_gemma":[0.9278155,0.00043184528,0.05780697,0.00023327544,0.00007864555,0.00004693691,0.00010318457,0.00006995754,0.013413734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999106,0.000019419691,0.000005193255,0.000032596414,0.000019850831,0.000012183597],"domain_scores_gemma":[0.9998017,0.00008949573,0.000021849119,0.000030023119,0.000026857066,0.00003021511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026486034,0.00029496473,0.00043509476,0.00018154408,0.00035620914,0.0014137843,0.0015619448,0.0015424261,0.0039074337],"category_scores_gemma":[0.0011361998,0.00027932168,0.00066419085,0.0003883844,0.00092051044,0.002768986,0.0011710626,0.0017291699,0.0004914571],"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.00034231183,0.00015224425,0.0010223081,0.00019294728,0.00013077397,0.0005594721,0.0007298742,0.4417945,0.022967177,0.447474,0.0030618175,0.08157257],"study_design_scores_gemma":[0.000018370776,0.000038666043,0.00020973133,0.00001410714,0.000026503865,0.000073977484,0.000047173377,0.84930557,0.0014402991,0.14760286,0.0012048844,0.00001787096],"about_ca_topic_score_codex":0.0016468938,"about_ca_topic_score_gemma":0.0016355594,"teacher_disagreement_score":0.0039074337,"about_ca_system_score_codex":0.00043683194,"about_ca_system_score_gemma":0.00044551623,"threshold_uncertainty_score":0.013071716},"labels":[],"label_agreement":null},{"id":"W4298022694","doi":"10.1007/978-3-319-40946-7","title":"Implementation and Application of Automata","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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":"Queen's University","funders":"","keywords":"Computer science; Automaton; Software engineering; Programming language; Theoretical computer science","score_opus":0.008300455354603761,"score_gpt":0.2613579820020829,"score_spread":0.2530575266474791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298022694","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009543108,0.0002291143,0.9553157,0.00024174036,0.0002818036,0.000095542666,0.00013700846,0.0072653606,0.026890632],"genre_scores_gemma":[0.3277063,0.0004269833,0.6492183,0.00017335729,0.00006860865,0.00034009625,0.00047105225,0.0011087446,0.020486498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880135,0.00033554414,0.0001237449,0.00024988264,0.000367385,0.00012211569],"domain_scores_gemma":[0.9980709,0.00060767797,0.000046875717,0.00080544566,0.00039474346,0.00007434616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492144,0.00061950734,0.0006583215,0.00074200385,0.0010046021,0.003200881,0.0021315557,0.0010815968,0.017045885],"category_scores_gemma":[0.005116452,0.0006835665,0.0012241901,0.00064071955,0.0013652224,0.002347249,0.0023974767,0.0015005649,0.005133137],"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.00019877049,0.00017198708,0.0010696314,0.00036860706,0.00007855398,0.0003381943,0.0008048286,0.046535127,0.020500397,0.66211265,0.009099173,0.25872213],"study_design_scores_gemma":[0.00009590429,0.00012715398,0.00033544496,0.00015683644,0.000112904294,0.00041590806,0.00017522284,0.4813513,0.043505117,0.3696966,0.10395882,0.000068915004],"about_ca_topic_score_codex":0.0022894323,"about_ca_topic_score_gemma":0.0019780386,"teacher_disagreement_score":0.017045885,"about_ca_system_score_codex":0.0009106472,"about_ca_system_score_gemma":0.0012604755,"threshold_uncertainty_score":0.05702418},"labels":[],"label_agreement":null},{"id":"W4298133261","doi":"10.1007/978-3-642-53914-5","title":"Advanced Data Mining and Applications","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Volume (thermodynamics); Data mining; Data set; Set (abstract data type); Data science; Artificial intelligence; Programming language","score_opus":0.022654819517960285,"score_gpt":0.27534971972639344,"score_spread":0.25269490020843316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298133261","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037622086,0.13399982,0.6932629,0.0056057815,0.010230099,0.00048919424,0.0032869407,0.0062208544,0.1431422],"genre_scores_gemma":[0.020930283,0.12748948,0.4305625,0.0034402444,0.00803742,0.0006142979,0.008474664,0.001184481,0.39926666],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991135,0.000066618544,0.000085115615,0.00015082392,0.00055036467,0.00003348184],"domain_scores_gemma":[0.9984187,0.0005051819,0.00008763196,0.00035227515,0.00053790235,0.00009836821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011700641,0.0015228522,0.0018746351,0.0033410517,0.00053529255,0.0024507362,0.0015619284,0.0009381562,0.034500573],"category_scores_gemma":[0.002675262,0.0008028977,0.0011572306,0.0059812376,0.0006507284,0.0033656384,0.002224133,0.002506597,0.037882186],"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.000031455405,0.000060656344,0.00022666626,0.00081775995,0.000054435655,0.000072197276,0.000056005363,0.0014098672,0.0032151975,0.014543715,0.1620678,0.81744426],"study_design_scores_gemma":[0.000014336209,0.000089243644,0.0012366207,0.00045294652,0.00006669967,0.0009159654,0.00005256941,0.014843567,0.0042384667,0.07760353,0.9004437,0.000042359952],"about_ca_topic_score_codex":0.00028338848,"about_ca_topic_score_gemma":0.00042611486,"teacher_disagreement_score":0.034500573,"about_ca_system_score_codex":0.0004364488,"about_ca_system_score_gemma":0.00093186373,"threshold_uncertainty_score":0.11541593},"labels":[],"label_agreement":null},{"id":"W4298150609","doi":"10.1007/978-3-642-37456-2","title":"Advances in Knowledge Discovery and Data Mining","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Knowledge extraction; Computer science; Data science; Volume (thermodynamics); Data mining; Set (abstract data type); Information retrieval","score_opus":0.023846120441123983,"score_gpt":0.2973966520615528,"score_spread":0.2735505316204288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298150609","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014084355,0.7895001,0.14860304,0.0063447184,0.004887012,0.00010456203,0.00073951203,0.0009801971,0.04743232],"genre_scores_gemma":[0.015708245,0.7455308,0.16322547,0.0032566157,0.00847931,0.00019104542,0.0020166459,0.00036362253,0.061228223],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853957,0.00018967081,0.00012673478,0.00019010362,0.0008955327,0.000058410715],"domain_scores_gemma":[0.9949411,0.0035774314,0.00021476382,0.00044570983,0.0006728978,0.00014806546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021167668,0.0014839132,0.0025155905,0.0047861757,0.00045364624,0.003895807,0.0021583235,0.0012465667,0.011350637],"category_scores_gemma":[0.0069108256,0.00069579354,0.0010641153,0.0098451795,0.0014640467,0.006687002,0.0019551867,0.0031594876,0.011038498],"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.000041188312,0.00008400292,0.00033082627,0.0038844945,0.0001365304,0.00009426103,0.00010329866,0.001737464,0.00096796383,0.05777434,0.121855296,0.8129903],"study_design_scores_gemma":[0.000018975175,0.00004911906,0.00062462356,0.00105531,0.00010127387,0.00056442845,0.00007992665,0.006717671,0.0011367323,0.21857935,0.77103627,0.00003623087],"about_ca_topic_score_codex":0.0006731139,"about_ca_topic_score_gemma":0.00088250963,"teacher_disagreement_score":0.011350637,"about_ca_system_score_codex":0.0009095983,"about_ca_system_score_gemma":0.0016283466,"threshold_uncertainty_score":0.037971675},"labels":[],"label_agreement":null},{"id":"W4298169796","doi":"10.1007/978-3-540-74484-9","title":"Computational Science and Its Applications – ICCSA 2007","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","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":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.06389391921650768,"score_gpt":0.3658120808462502,"score_spread":0.30191816162974255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298169796","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051780106,0.12326702,0.22953582,0.015140091,0.03417082,0.0003932667,0.0036838704,0.007463969,0.5811671],"genre_scores_gemma":[0.024228586,0.09105524,0.081841566,0.0018341156,0.009640917,0.0003447151,0.0055193673,0.002830539,0.782705],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989957,0.0001671239,0.000057073572,0.00014884691,0.0005630624,0.00006824795],"domain_scores_gemma":[0.9973335,0.00066562515,0.000079869875,0.0005634904,0.0010474545,0.00031003132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019395808,0.0012756323,0.0019657959,0.003350844,0.0009233003,0.004110257,0.0013284347,0.0011347797,0.062224846],"category_scores_gemma":[0.0036443295,0.0009072557,0.00082161836,0.0057356115,0.0011430683,0.0029346086,0.002556672,0.0031710635,0.033081308],"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.00004518613,0.000065396,0.00022502278,0.000338277,0.00002616829,0.00002702431,0.00004324894,0.00264858,0.0006686072,0.02988687,0.6848047,0.281221],"study_design_scores_gemma":[0.000007954166,0.000034503348,0.00074912776,0.00027969535,0.000027408278,0.00018162845,0.000038887756,0.009104807,0.00085902336,0.024399897,0.96429694,0.000020238025],"about_ca_topic_score_codex":0.0037995311,"about_ca_topic_score_gemma":0.005627284,"teacher_disagreement_score":0.062224846,"about_ca_system_score_codex":0.0017230527,"about_ca_system_score_gemma":0.0028384984,"threshold_uncertainty_score":0.20816284},"labels":[],"label_agreement":null},{"id":"W4298439955","doi":"10.1007/978-3-031-14788-3_14","title":"Computing the Integer Hull of Convex Polyhedral Sets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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":"Western University","funders":"","keywords":"Convex hull; Integer (computer science); Integer programming; Hull; Polyhedron; Computer science; Set (abstract data type); Maple; Regular polygon; Mathematical optimization; Algorithm; Combinatorics; Mathematics; Programming language; Geometry","score_opus":0.017855201496251517,"score_gpt":0.2560381028199989,"score_spread":0.23818290132374736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298439955","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.15457809,0.0005912031,0.80510324,0.00035007406,0.00016690668,0.00011439865,0.0015673474,0.0024567586,0.035071995],"genre_scores_gemma":[0.5278345,0.00041975887,0.4530896,0.00009737438,0.00009282742,0.00007462166,0.0049695163,0.0011280775,0.012293792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993352,0.000079572186,0.000040349376,0.00013373487,0.00029642545,0.000114670846],"domain_scores_gemma":[0.99871826,0.00074190256,0.00009054317,0.00020202884,0.00015038616,0.000096857715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053592917,0.0009707618,0.0013518538,0.0011717986,0.00058903836,0.0032146792,0.0014993337,0.0006957998,0.013808819],"category_scores_gemma":[0.0035815192,0.00079885666,0.00084155786,0.0014044945,0.0009572744,0.003508325,0.0023147815,0.0019943824,0.0024613836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009964852,0.00026612208,0.004704976,0.0009766292,0.00011546567,0.0005483374,0.0005809598,0.36283258,0.018376442,0.13554677,0.021204436,0.45385075],"study_design_scores_gemma":[0.000041109088,0.00012806525,0.0013236424,0.00009366746,0.000026960617,0.00019967591,0.00036323394,0.89440554,0.008188281,0.08733473,0.00786717,0.000028029473],"about_ca_topic_score_codex":0.0014132566,"about_ca_topic_score_gemma":0.0024787171,"teacher_disagreement_score":0.013808819,"about_ca_system_score_codex":0.0006192284,"about_ca_system_score_gemma":0.0004523797,"threshold_uncertainty_score":0.04619509},"labels":[],"label_agreement":null},{"id":"W4299155068","doi":"10.1007/11751588","title":"Computational Science and Its Applications - ICCSA 2006","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computational science","score_opus":0.04817489263326968,"score_gpt":0.3399309816177417,"score_spread":0.29175608898447203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299155068","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044224076,0.15630987,0.19582933,0.013778299,0.034321714,0.00037404758,0.0035571863,0.0055566677,0.5858504],"genre_scores_gemma":[0.025819177,0.1059763,0.07050078,0.0016865858,0.009528997,0.0003456151,0.005002415,0.0022211983,0.77891886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920124,0.00013653214,0.00004932639,0.000116873816,0.00044254557,0.000053554628],"domain_scores_gemma":[0.99773467,0.0006145064,0.000072766445,0.00046945343,0.00083303876,0.00027552506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015888603,0.001405385,0.002122868,0.0030901001,0.00090713426,0.00411815,0.0012688398,0.0010693118,0.05789042],"category_scores_gemma":[0.003307125,0.0009116677,0.0008183503,0.0061828266,0.0010667056,0.0029758643,0.002397212,0.0031740163,0.03094257],"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.000051683965,0.00007150046,0.0002544486,0.0004493707,0.000027621778,0.000031777436,0.000055071465,0.0029169894,0.0006024863,0.034475867,0.6600213,0.30104184],"study_design_scores_gemma":[0.000008846179,0.000039226714,0.0008567743,0.0003420131,0.000025876685,0.0002076346,0.00004205804,0.008564831,0.0007288365,0.03207602,0.9570884,0.000019539304],"about_ca_topic_score_codex":0.003343927,"about_ca_topic_score_gemma":0.0056259744,"teacher_disagreement_score":0.05789042,"about_ca_system_score_codex":0.0016676204,"about_ca_system_score_gemma":0.002231718,"threshold_uncertainty_score":0.1936627},"labels":[],"label_agreement":null},{"id":"W4299530430","doi":"10.1007/978-3-319-28684-6","title":"Approximation and Online Algorithms","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Approximation algorithm; Algorithm","score_opus":0.04492900763069252,"score_gpt":0.3104928981351183,"score_spread":0.2655638905044258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299530430","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005682437,0.041936185,0.60005194,0.0058679995,0.0041353106,0.0001167611,0.0013575436,0.0026388082,0.33821303],"genre_scores_gemma":[0.17677587,0.051042303,0.30694163,0.0029161014,0.008379312,0.0005126619,0.0056659416,0.003193433,0.4445727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865854,0.00021125814,0.00006062468,0.00027711794,0.00067951524,0.00011290345],"domain_scores_gemma":[0.9988582,0.00048664855,0.0000527675,0.00039481948,0.000147053,0.00006051826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008233669,0.0018436866,0.0020593344,0.0015858819,0.000803768,0.0038900375,0.0018742505,0.0014202928,0.03431972],"category_scores_gemma":[0.0035911156,0.00073708995,0.0011549647,0.0050558615,0.0013730407,0.006422042,0.002112004,0.005594783,0.016683875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001060899,0.00012678592,0.00020865115,0.0004971846,0.00005498893,0.00004147941,0.00006850189,0.0124233775,0.00095820526,0.49812576,0.13084152,0.35654745],"study_design_scores_gemma":[0.000029771694,0.00003244954,0.00034678497,0.00014939821,0.00003558451,0.00018285196,0.00003659998,0.037647672,0.001085783,0.79786044,0.16257285,0.000019895022],"about_ca_topic_score_codex":0.001069377,"about_ca_topic_score_gemma":0.0010458152,"teacher_disagreement_score":0.03431972,"about_ca_system_score_codex":0.0023013514,"about_ca_system_score_gemma":0.0012311033,"threshold_uncertainty_score":0.11481094},"labels":[],"label_agreement":null},{"id":"W4299902784","doi":"10.1007/978-3-642-02457-3","title":"Computational Science and Its Applications – ICCSA 2009","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.05467497713950305,"score_gpt":0.3503634830825434,"score_spread":0.29568850594304036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299902784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042958786,0.14031641,0.1980718,0.015952196,0.032939,0.00033814652,0.003554478,0.0053037815,0.59922826],"genre_scores_gemma":[0.02702205,0.10253465,0.07179298,0.0018097293,0.009922269,0.00031451468,0.004667186,0.0024707469,0.7794659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991897,0.00012218309,0.000053879976,0.00014404432,0.0004355835,0.00005470644],"domain_scores_gemma":[0.99803144,0.0004948094,0.00006670404,0.00043025016,0.00074475846,0.00023191381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016457943,0.0012849573,0.0017043833,0.002900247,0.0008096664,0.0035705464,0.001229126,0.001107541,0.060502984],"category_scores_gemma":[0.0034880885,0.0008606669,0.0008159473,0.0054125185,0.001110214,0.0031257458,0.002338997,0.0031610979,0.03177702],"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.00004769093,0.00005984527,0.00022344095,0.0003986633,0.000025215715,0.000030846364,0.000044402328,0.0032049597,0.0007880198,0.03750889,0.64976996,0.30789804],"study_design_scores_gemma":[0.000007287875,0.000029133267,0.00080996513,0.0003188784,0.000021914782,0.00017991201,0.000031761385,0.008344697,0.0007337771,0.027851257,0.9616526,0.000018877097],"about_ca_topic_score_codex":0.0041491785,"about_ca_topic_score_gemma":0.006307493,"teacher_disagreement_score":0.060502984,"about_ca_system_score_codex":0.0018866721,"about_ca_system_score_gemma":0.0025028882,"threshold_uncertainty_score":0.20240259},"labels":[],"label_agreement":null},{"id":"W4299948441","doi":"10.1007/11663430_10","title":"Report of the 7th International Workshop on Aspect-Oriented Modeling","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software engineering; Aspect-oriented programming; Software development; Software; Software development process; Process (computing); Software architecture; Systems engineering; Programming language; Engineering","score_opus":0.03583171043254513,"score_gpt":0.2880519063948245,"score_spread":0.25222019596227935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299948441","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042615116,0.028654927,0.6650634,0.04051556,0.04053619,0.0014290003,0.004333584,0.006294393,0.17055774],"genre_scores_gemma":[0.1055005,0.04806213,0.36906868,0.0051828497,0.010378857,0.00107826,0.02845156,0.00769305,0.42458412],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99524117,0.001349615,0.0002894048,0.0004660463,0.0022559331,0.00039782407],"domain_scores_gemma":[0.9933976,0.001441709,0.00020735044,0.0014174697,0.002830691,0.0007052285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010031498,0.0017405546,0.0015913009,0.0017128111,0.0009285577,0.005636756,0.0020925286,0.0016012753,0.026699046],"category_scores_gemma":[0.0083028395,0.0009976636,0.002006838,0.0020493758,0.00077242265,0.004974343,0.0023835679,0.0042088777,0.008822447],"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.00094481494,0.0012041669,0.002522258,0.00081939664,0.00015749641,0.0005454469,0.001158233,0.007467561,0.019199211,0.029131424,0.4042504,0.5325996],"study_design_scores_gemma":[0.00017318099,0.0003897658,0.0028107774,0.00041860712,0.0002622192,0.0005575752,0.0004118151,0.016679546,0.028779132,0.016836533,0.93260455,0.000076452336],"about_ca_topic_score_codex":0.0054884567,"about_ca_topic_score_gemma":0.0070529873,"teacher_disagreement_score":0.026699046,"about_ca_system_score_codex":0.0011886519,"about_ca_system_score_gemma":0.0030476726,"threshold_uncertainty_score":0.0893172},"labels":[],"label_agreement":null},{"id":"W4299969830","doi":"10.1007/978-3-319-44799-5","title":"Collaboration and Technology","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","field":"Engineering","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 Saskatchewan","funders":"","keywords":"Computer science; Library science; Operations research; Engineering","score_opus":0.0047396332592689085,"score_gpt":0.20550121299336246,"score_spread":0.20076157973409356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299969830","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.001523348,0.032814335,0.012041743,0.004912757,0.0019682134,0.000027322416,0.000051674186,0.00012521748,0.94653535],"genre_scores_gemma":[0.089373715,0.03358493,0.0064669685,0.0012611642,0.0015556178,0.00019490505,0.00017780474,0.0002019632,0.8671829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00027001748,0.000032866796,0.00013933243,0.00029127297,0.00011769155],"domain_scores_gemma":[0.9995851,0.000120760415,0.000029045335,0.00010148285,0.0000572202,0.00010634459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090393284,0.0010258812,0.00067243486,0.0011585718,0.0026359465,0.0071094735,0.00095498824,0.0018814612,0.040959284],"category_scores_gemma":[0.0016018838,0.00032153432,0.00043818445,0.001748147,0.004499221,0.008531431,0.0058675515,0.0024654625,0.014611708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011193271,0.000016905396,0.000079292244,0.000115747105,0.0000062222684,0.000050837327,0.001556825,0.00021886108,0.0002510538,0.85660845,0.058235254,0.08284936],"study_design_scores_gemma":[0.0000044245758,0.000016124759,0.00013063129,0.00019254461,0.0000041925255,0.00016106201,0.0008188059,0.00015730567,0.00013654394,0.28428322,0.7140892,0.000005873664],"about_ca_topic_score_codex":0.0011558689,"about_ca_topic_score_gemma":0.001427449,"teacher_disagreement_score":0.040959284,"about_ca_system_score_codex":0.0020153238,"about_ca_system_score_gemma":0.0024621063,"threshold_uncertainty_score":0.13702238},"labels":[],"label_agreement":null},{"id":"W4299973565","doi":"10.1007/978-3-642-31254-0","title":"Image and Signal Processing","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Image processing; Signal processing; SIGNAL (programming language); Digital image processing; Computer graphics (images); Image (mathematics); Computer vision; Artificial intelligence; Speech recognition; Digital signal processing; Computer hardware; Programming language","score_opus":0.013724523955110677,"score_gpt":0.25123269566719025,"score_spread":0.23750817171207958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299973565","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.0029958698,0.053326976,0.336527,0.0017873538,0.0074094986,0.00020730431,0.0013504745,0.005182544,0.59121305],"genre_scores_gemma":[0.010945131,0.020669028,0.043646358,0.0006390565,0.0018835204,0.000092987626,0.001163597,0.0005981105,0.9203622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996965,0.000016233875,0.000011518461,0.00006390896,0.00019398978,0.000017871167],"domain_scores_gemma":[0.9997397,0.000045503697,0.000011772886,0.00007586869,0.00009485549,0.000032302454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002663062,0.0013995722,0.0011554417,0.0017806244,0.00042221154,0.0017653898,0.0009848366,0.0010751181,0.1156675],"category_scores_gemma":[0.0005888026,0.00041068997,0.0004595216,0.002049725,0.0006842072,0.0016562153,0.0012998626,0.001255087,0.09575808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004870633,0.000039485705,0.000068495276,0.0005394892,0.000029442319,0.00008785821,0.00004319012,0.0010618925,0.014355734,0.021702098,0.1854143,0.7766094],"study_design_scores_gemma":[0.000010128633,0.000091575945,0.0006687885,0.00013619786,0.000028724748,0.0006668995,0.000037820893,0.0057911403,0.009537765,0.019495606,0.9635109,0.00002448976],"about_ca_topic_score_codex":0.00052831345,"about_ca_topic_score_gemma":0.0011454718,"teacher_disagreement_score":0.1156675,"about_ca_system_score_codex":0.00036497344,"about_ca_system_score_gemma":0.000410167,"threshold_uncertainty_score":0.38694632},"labels":[],"label_agreement":null},{"id":"W4300031334","doi":"10.1007/978-3-642-23626-6","title":"Medical Image Computing and Computer-Assisted Intervention – MICCAI 2011","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":261,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Sunnybrook Hospital; Queen's University","funders":"","keywords":"Computer science; Intervention (counseling); Medicine; Nursing","score_opus":0.011788956385331005,"score_gpt":0.29178293543071643,"score_spread":0.2799939790453854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300031334","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051949234,0.18200406,0.5319731,0.0077130785,0.027360888,0.00029585403,0.0018127837,0.006264636,0.23738053],"genre_scores_gemma":[0.032483336,0.10627389,0.19131777,0.0011509965,0.009873759,0.00031572816,0.0031049296,0.002307542,0.653172],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932706,0.000059262893,0.000042404205,0.00015954112,0.00037455608,0.00003714811],"domain_scores_gemma":[0.9990194,0.0002327064,0.000044828197,0.00017563222,0.0004114316,0.000115983006],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097124936,0.0017816289,0.0017319262,0.0023707796,0.0004752623,0.002124956,0.0013702353,0.0012940371,0.040653147],"category_scores_gemma":[0.0019253001,0.00094414665,0.0007492732,0.002862929,0.0008683177,0.002669444,0.0018279769,0.002727377,0.01934494],"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.000050721188,0.000035749184,0.000101148944,0.00045178557,0.000038487087,0.000042130465,0.000030319809,0.004323604,0.003053873,0.015277366,0.30960304,0.6669917],"study_design_scores_gemma":[0.00001968375,0.00009696677,0.002755731,0.0003766573,0.000067666035,0.0013436204,0.000041557985,0.05599107,0.0060301623,0.036337912,0.89684755,0.000091313996],"about_ca_topic_score_codex":0.0021849337,"about_ca_topic_score_gemma":0.003602155,"teacher_disagreement_score":0.95934683,"about_ca_system_score_codex":0.00093072525,"about_ca_system_score_gemma":0.0011630883,"threshold_uncertainty_score":0.13599831},"labels":[],"label_agreement":null},{"id":"W4300051771","doi":"10.1007/978-3-319-46379-7","title":"Algorithmic Learning Theory","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","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":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.010626130519115914,"score_gpt":0.239478027910941,"score_spread":0.2288518973918251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300051771","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.0030800884,0.03861008,0.3347307,0.010106814,0.0022703852,0.00006541943,0.00059864105,0.0009343429,0.6096036],"genre_scores_gemma":[0.18804109,0.048258413,0.14238513,0.0043677273,0.0069208005,0.000434814,0.00255762,0.0011145121,0.6059201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00015029224,0.000024831314,0.00012060115,0.00028773872,0.000038142003],"domain_scores_gemma":[0.9994462,0.00025918367,0.000024430541,0.00013911365,0.00009662623,0.000034422137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435924,0.00086568616,0.000818965,0.0011064474,0.00073412916,0.0031427583,0.0010415879,0.00095958,0.023270369],"category_scores_gemma":[0.0020979731,0.00036299246,0.0006089038,0.0015230748,0.001791737,0.0031896876,0.0014339227,0.0031719774,0.00995261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007694757,0.000023529457,0.00013221387,0.00017440651,0.000021301537,0.000020046928,0.0000760954,0.00227125,0.00020844424,0.7878381,0.07601004,0.13321686],"study_design_scores_gemma":[0.000003832586,0.0000046675827,0.00011578481,0.0000563928,0.000006136856,0.0000397217,0.00001825588,0.0030843723,0.00010521115,0.880648,0.115913466,0.0000042379675],"about_ca_topic_score_codex":0.00061494,"about_ca_topic_score_gemma":0.00085119647,"teacher_disagreement_score":0.023270369,"about_ca_system_score_codex":0.0014795081,"about_ca_system_score_gemma":0.0010500832,"threshold_uncertainty_score":0.07784712},"labels":[],"label_agreement":null},{"id":"W4300076287","doi":"10.1007/978-3-642-21596-4","title":"Image Analysis and Recognition","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":33,"is_retracted":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":"Artificial intelligence; Computer science; Pattern recognition (psychology); Computer vision","score_opus":0.019773685077724954,"score_gpt":0.22430361378792615,"score_spread":0.2045299287102012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300076287","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.00214893,0.014249121,0.7919434,0.0005681094,0.0018915853,0.0002739746,0.0017978688,0.013247814,0.17387918],"genre_scores_gemma":[0.017206617,0.013205729,0.27529997,0.00067843986,0.0006726121,0.0002927287,0.005433959,0.0018922214,0.6853177],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957424,0.000019383651,0.000019702686,0.00010538835,0.00025218018,0.000029164985],"domain_scores_gemma":[0.99966466,0.00004556094,0.000012190479,0.00012168741,0.00013711778,0.000018730709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003288867,0.0014003057,0.0011338104,0.0018843272,0.00044279065,0.0017740619,0.0015814609,0.0009610037,0.09652114],"category_scores_gemma":[0.00057699607,0.0005945669,0.0007464582,0.0017931055,0.0005315694,0.0013094423,0.0012318306,0.0009533445,0.12099569],"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.000039813498,0.000030907824,0.000070791844,0.00030369606,0.000025091103,0.00005576236,0.000027509974,0.00087838364,0.029696466,0.0074554663,0.11345743,0.84795874],"study_design_scores_gemma":[0.000011742733,0.00008133321,0.00096385396,0.00011380811,0.00004410558,0.00082079734,0.00003801392,0.009941679,0.05463514,0.0108761005,0.92243254,0.00004088665],"about_ca_topic_score_codex":0.0008628573,"about_ca_topic_score_gemma":0.0014195099,"teacher_disagreement_score":0.09652114,"about_ca_system_score_codex":0.00033389,"about_ca_system_score_gemma":0.0005183492,"threshold_uncertainty_score":0.3228954},"labels":[],"label_agreement":null},{"id":"W4300177118","doi":"10.1007/978-3-030-00928-1","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2018","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Image quality; Artificial intelligence; Computer vision; Medical physics; Medical imaging; Image processing; Image (mathematics); Data science; Medicine","score_opus":0.00976282647887128,"score_gpt":0.30470891768569547,"score_spread":0.2949460912068242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300177118","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057481173,0.22599453,0.37038478,0.0104070315,0.05503346,0.00029834677,0.0020045307,0.005621167,0.324508],"genre_scores_gemma":[0.03280177,0.118673794,0.14607146,0.0012536617,0.024978485,0.000350299,0.0031331622,0.0025686817,0.6701687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992902,0.00006499789,0.000039290266,0.00016372022,0.0004045616,0.000037119044],"domain_scores_gemma":[0.99895656,0.00024319858,0.000050056802,0.00018248428,0.0004114171,0.00015633066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009511246,0.0017160747,0.001443145,0.002547886,0.00045435707,0.0023263975,0.0014353935,0.0012458889,0.04075987],"category_scores_gemma":[0.001982184,0.0007398733,0.0006809482,0.0025254006,0.00090211054,0.0028154885,0.0019247229,0.0027405797,0.021618651],"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.000056921635,0.00004089649,0.000101631165,0.00044631228,0.000035395697,0.00004221352,0.000027609818,0.0027795031,0.0027391957,0.018662525,0.3958394,0.5792284],"study_design_scores_gemma":[0.000015499372,0.00007876366,0.0015708972,0.0003096178,0.000036945898,0.00089254713,0.000030502164,0.025775652,0.0036711635,0.035608936,0.931953,0.000056326688],"about_ca_topic_score_codex":0.001316828,"about_ca_topic_score_gemma":0.0018516602,"teacher_disagreement_score":0.04075987,"about_ca_system_score_codex":0.000945561,"about_ca_system_score_gemma":0.0011123732,"threshold_uncertainty_score":0.13635534},"labels":[],"label_agreement":null},{"id":"W4300221964","doi":"10.1007/978-3-031-14788-3_11","title":"An Interpolation Algorithm for Computing Dixon Resultants","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Subroutine; Maple; Algorithm; Interpolation (computer graphics); Polynomial interpolation; Mathematics; Univariate; Polynomial; Computer science; Algebra over a field; Multivariate statistics; Linear interpolation; Pure mathematics; Computer graphics (images)","score_opus":0.01695797807085452,"score_gpt":0.2659098690330344,"score_spread":0.24895189096217984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300221964","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.033748765,0.00042035527,0.9295522,0.00021815671,0.00031071887,0.0001637197,0.0004158108,0.0034223667,0.03174805],"genre_scores_gemma":[0.19462684,0.00032964905,0.7771196,0.000120976205,0.00015737217,0.00016233827,0.0013505316,0.00077681453,0.02535592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990447,0.00014384622,0.000067598856,0.00018926161,0.0004099963,0.0001444701],"domain_scores_gemma":[0.99855036,0.00056157255,0.00007533377,0.00033225352,0.0003906903,0.00008975769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010793668,0.0011745548,0.0010531523,0.0027644418,0.0014394041,0.0021023713,0.0018501036,0.0006705508,0.02055301],"category_scores_gemma":[0.0040085604,0.0005546681,0.0010450234,0.003172476,0.0009715196,0.0033377572,0.0025421265,0.0017961294,0.005003507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062593573,0.00018883,0.0012462634,0.0002742709,0.000048457467,0.00012229862,0.00027775424,0.014323891,0.011919688,0.23021838,0.013157666,0.7275966],"study_design_scores_gemma":[0.00025866093,0.00050527236,0.0018224653,0.00016435611,0.00014616366,0.0005006167,0.00040331951,0.3636021,0.054143667,0.49035472,0.08794621,0.00015241782],"about_ca_topic_score_codex":0.0014572594,"about_ca_topic_score_gemma":0.0034497825,"teacher_disagreement_score":0.02055301,"about_ca_system_score_codex":0.0012027124,"about_ca_system_score_gemma":0.0010834803,"threshold_uncertainty_score":0.0687567},"labels":[],"label_agreement":null},{"id":"W4300412797","doi":"10.1007/978-3-642-10698-9","title":"Theory of Quantum Computation, Communication, and Cryptography","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Quantum computer; Theoretical computer science; Computation; Quantum; Computer security; Encryption; Algorithm; Public-key cryptography; Quantum information; Quantum mechanics; Physics","score_opus":0.009411363779440485,"score_gpt":0.24024378427563325,"score_spread":0.23083242049619276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300412797","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004044277,0.1735026,0.17749399,0.009544299,0.0064840536,0.00014123002,0.00050202024,0.00055769307,0.62772983],"genre_scores_gemma":[0.24379803,0.17783774,0.11679951,0.0051926775,0.014124468,0.00077802595,0.0009908705,0.00041382303,0.4400648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994318,0.00013383951,0.000020820875,0.00006234072,0.00029505396,0.000056199107],"domain_scores_gemma":[0.99939203,0.00030255906,0.00003659088,0.000110884954,0.000114099625,0.000043843327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377549,0.001200441,0.0016450501,0.0015347397,0.0015590577,0.003434087,0.0015923497,0.0018003646,0.013137371],"category_scores_gemma":[0.0014372612,0.0006387225,0.0007856412,0.0024006136,0.004655843,0.004068924,0.001072388,0.003785871,0.0040234067],"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.0000052581195,0.000009231553,0.000026881817,0.00011907645,0.000009195107,0.000017402614,0.00006231836,0.0013235399,0.0001900892,0.95845205,0.024150023,0.015634976],"study_design_scores_gemma":[0.000005129906,0.000008965515,0.00005371179,0.000053218886,0.0000051049974,0.000064473075,0.000024644154,0.0023036099,0.00009602028,0.91429955,0.0830785,0.0000070306196],"about_ca_topic_score_codex":0.0014671666,"about_ca_topic_score_gemma":0.001448241,"teacher_disagreement_score":0.013137371,"about_ca_system_score_codex":0.0021448345,"about_ca_system_score_gemma":0.0022291765,"threshold_uncertainty_score":0.04394889},"labels":[],"label_agreement":null},{"id":"W4300536553","doi":"10.1007/978-3-031-14788-3_3","title":"Subresultant Chains Using Bézout Matrices","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Speedup; Computation; Gaussian elimination; Fraction (chemistry); Yield (engineering); Gaussian; Multivariate statistics; Matrix (chemical analysis); Mathematics; Algorithm; Combinatorics; Computer science; Parallel computing; Computational chemistry; Chemistry; Physics; Statistics; Organic chemistry; Chromatography; Thermodynamics","score_opus":0.02086754038059347,"score_gpt":0.2482668397128955,"score_spread":0.22739929933230205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300536553","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.083126344,0.0010140662,0.6736096,0.0003081594,0.0008728684,0.00014786099,0.00021846523,0.001354202,0.2393484],"genre_scores_gemma":[0.5007993,0.00259354,0.26240602,0.00027906083,0.00060331373,0.00017303931,0.00051595195,0.0017476184,0.23088223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964774,0.000063265376,0.000017288916,0.00007379829,0.00014293831,0.000055083452],"domain_scores_gemma":[0.99972624,0.00008331297,0.000025385694,0.000070490605,0.000054482036,0.000040149785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038322932,0.0011431413,0.00082827173,0.0013626199,0.0012748629,0.0018310151,0.0007688528,0.0005171103,0.0181078],"category_scores_gemma":[0.0007029253,0.0006452027,0.0007370513,0.0011779963,0.0013686592,0.0028312262,0.001681835,0.0023162477,0.006116647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112831454,0.00006346128,0.0001523012,0.00010344611,0.000014958071,0.00014810906,0.00033371354,0.0038459168,0.011880339,0.90186197,0.0044466676,0.077036254],"study_design_scores_gemma":[0.00003107798,0.00015015615,0.00016786518,0.00006988905,0.00002990719,0.00037298928,0.00017125883,0.02324039,0.019004742,0.88447875,0.072239056,0.000043834414],"about_ca_topic_score_codex":0.0006388434,"about_ca_topic_score_gemma":0.0014118536,"teacher_disagreement_score":0.0181078,"about_ca_system_score_codex":0.00068119256,"about_ca_system_score_gemma":0.00040011684,"threshold_uncertainty_score":0.060576618},"labels":[],"label_agreement":null},{"id":"W4300649475","doi":"10.1007/3-540-36086-7","title":"Mobile Agents for Telecommunication Applications","year":2002,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","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 Ottawa","funders":"","keywords":"Computer science; Telecommunications; Wireless; Mobile telephony; Wireless network; Computer network; Mobile radio","score_opus":0.020921570305272294,"score_gpt":0.26553837895896265,"score_spread":0.24461680865369034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300649475","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005596369,0.115399174,0.39797512,0.002213333,0.0073301634,0.0004173593,0.00061828026,0.0047584833,0.46569172],"genre_scores_gemma":[0.030955696,0.04608609,0.16568397,0.0010533618,0.0016939522,0.00042624737,0.0012672618,0.00089727703,0.7519361],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998368,0.00002910806,0.000008501066,0.000022703694,0.00008687128,0.000015978707],"domain_scores_gemma":[0.9998248,0.000060315975,0.000015034852,0.000025174342,0.00005415286,0.000020556106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018526691,0.0013825992,0.00079969177,0.0007923767,0.00050340226,0.001753964,0.0010064701,0.0013891582,0.029771999],"category_scores_gemma":[0.0004708403,0.00039588605,0.00031937467,0.0011588318,0.0002641197,0.0019282849,0.0009604517,0.0013911652,0.021990329],"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.000113702095,0.00013886504,0.00011372465,0.00074030174,0.00004229962,0.00025510052,0.00024561174,0.002653265,0.011743772,0.10539599,0.20988333,0.66867405],"study_design_scores_gemma":[0.00002650333,0.00006944366,0.00014417096,0.00018756693,0.000028636883,0.00037083926,0.000048328402,0.0047641094,0.0019137674,0.022268822,0.97016394,0.000013861301],"about_ca_topic_score_codex":0.0003893477,"about_ca_topic_score_gemma":0.00073083414,"teacher_disagreement_score":0.029771999,"about_ca_system_score_codex":0.00025385997,"about_ca_system_score_gemma":0.00028517976,"threshold_uncertainty_score":0.099597335},"labels":[],"label_agreement":null},{"id":"W4300721790","doi":"10.1007/978-3-642-13711-2","title":"Information Processing in Computer-Assisted Interventions","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Education","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Information processing; Human–computer interaction","score_opus":0.03390074207375771,"score_gpt":0.31916063170963477,"score_spread":0.28525988963587706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300721790","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.013955434,0.1972615,0.45967397,0.0054177283,0.003591045,0.00030139898,0.0003301421,0.0009788553,0.3184899],"genre_scores_gemma":[0.39384395,0.14147599,0.2147813,0.0022687896,0.0033030831,0.00079431897,0.0006289479,0.00022847646,0.24267511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966,0.00014584606,0.000018810442,0.000041754767,0.00011144611,0.00002217731],"domain_scores_gemma":[0.9993905,0.0004932078,0.000018836026,0.00003586339,0.000046457,0.000015152244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004256317,0.0004366465,0.000529792,0.00058748084,0.00022207815,0.0011489125,0.00052959984,0.000809715,0.017251993],"category_scores_gemma":[0.0014065405,0.00014832024,0.00031397364,0.00076818094,0.00078206783,0.001151704,0.000476048,0.00087466347,0.0021355506],"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.00011064903,0.000108215,0.00016204083,0.0012389912,0.00004547892,0.00015601306,0.00021728566,0.0050265314,0.0021949953,0.104549974,0.041460015,0.84472984],"study_design_scores_gemma":[0.00009129424,0.00055236084,0.0036989253,0.0018470134,0.00013791819,0.0021051192,0.00044251236,0.0531182,0.008758587,0.57551014,0.35366216,0.00007588347],"about_ca_topic_score_codex":0.00072433066,"about_ca_topic_score_gemma":0.000792396,"teacher_disagreement_score":0.017251993,"about_ca_system_score_codex":0.00049346976,"about_ca_system_score_gemma":0.0005326962,"threshold_uncertainty_score":0.057713687},"labels":[],"label_agreement":null},{"id":"W4300910038","doi":"10.1007/978-3-642-16720-1","title":"Web-Age Information Management","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Architecture and Usability","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Computer science; Web application; World Wide Web; China; Information management; Library science; Knowledge management; Political science","score_opus":0.007053916386111561,"score_gpt":0.22515965652769276,"score_spread":0.2181057401415812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300910038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047467193,0.03643699,0.12097645,0.002884929,0.002087285,0.00011093631,0.00037684274,0.00346153,0.8289183],"genre_scores_gemma":[0.0357186,0.022276333,0.03274402,0.0010332521,0.001132697,0.00008160156,0.0009598573,0.00052517577,0.9055284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997218,0.00003819895,0.000014157287,0.00003195461,0.00017241349,0.000021397078],"domain_scores_gemma":[0.9996939,0.00009105353,0.000016792766,0.00008480196,0.0000753961,0.0000380515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031651204,0.00051902153,0.00033723545,0.0015744106,0.00051337876,0.0030891942,0.0005789566,0.0007886528,0.031411707],"category_scores_gemma":[0.0007751826,0.00035846516,0.00026261638,0.0027622695,0.00044024794,0.0057189562,0.0012069466,0.0012409709,0.021335836],"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.000022194023,0.000098380944,0.00021235699,0.00034905027,0.000015956572,0.00009823732,0.00028804244,0.00054762803,0.0040012076,0.124322385,0.15394121,0.7161034],"study_design_scores_gemma":[0.0000050119256,0.000020332998,0.0006074308,0.0001884149,0.000012991468,0.00038399323,0.00008691938,0.002044702,0.0024652395,0.06026052,0.9339134,0.000011057011],"about_ca_topic_score_codex":0.0004895346,"about_ca_topic_score_gemma":0.0010093868,"teacher_disagreement_score":0.031411707,"about_ca_system_score_codex":0.0004953624,"about_ca_system_score_gemma":0.00046639418,"threshold_uncertainty_score":0.10508263},"labels":[],"label_agreement":null},{"id":"W4300915482","doi":"10.1007/978-3-642-33515-0","title":"Intelligent Robotics and Applications","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","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":"Concordia University","funders":"","keywords":"Robotics; Artificial intelligence; Computer science; Robot","score_opus":0.01319773463491632,"score_gpt":0.22707117822996783,"score_spread":0.2138734435950515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300915482","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016284104,0.064585656,0.15007591,0.0014740935,0.004491009,0.00015645752,0.00058701437,0.0031500137,0.77385145],"genre_scores_gemma":[0.009554611,0.030697703,0.039992876,0.00058530894,0.0010471672,0.00011497301,0.00095746765,0.0005604553,0.91648936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996356,0.000022769154,0.000014955492,0.000063806176,0.00023560548,0.000027183492],"domain_scores_gemma":[0.9998,0.00003893653,0.000008834447,0.000050355622,0.00007663056,0.000025218364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028761948,0.0016260257,0.0011535386,0.001755952,0.00058022357,0.0022910805,0.0012717558,0.001101991,0.06980697],"category_scores_gemma":[0.0006229224,0.0005577469,0.00056636805,0.0017805777,0.00067808677,0.0022325898,0.0018801328,0.0014511885,0.054347806],"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.000023184619,0.000037831556,0.00007461759,0.0005087924,0.000020395286,0.000059337228,0.000083977815,0.0019364918,0.004481259,0.050210744,0.2386504,0.70391303],"study_design_scores_gemma":[0.000003980306,0.000030173262,0.00026547295,0.00016744158,0.000012046048,0.00022855776,0.000028958819,0.0029280693,0.0014634498,0.0275992,0.9672579,0.000014754004],"about_ca_topic_score_codex":0.00058713654,"about_ca_topic_score_gemma":0.0014406581,"teacher_disagreement_score":0.06980697,"about_ca_system_score_codex":0.0005342657,"about_ca_system_score_gemma":0.000648951,"threshold_uncertainty_score":0.23352754},"labels":[],"label_agreement":null},{"id":"W4301143134","doi":"10.1007/3-540-47789-6","title":"Computational Science — ICCS 2002","year":2002,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":130,"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":"Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.07835596792503394,"score_gpt":0.34582644314822375,"score_spread":0.2674704752231898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301143134","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009136623,0.04544856,0.2979924,0.017726576,0.03842951,0.00034505813,0.008263407,0.021656374,0.5610015],"genre_scores_gemma":[0.021914795,0.018227713,0.045437023,0.0012019385,0.0034733398,0.00016480955,0.007883291,0.0037858512,0.8979113],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992575,0.00012350637,0.000041094936,0.00015166658,0.00036054026,0.00006561882],"domain_scores_gemma":[0.9971079,0.00050308934,0.00007195759,0.0009149007,0.0010912648,0.00031091567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016275529,0.0012004881,0.001655527,0.0017398627,0.0010274892,0.0047071013,0.0016812444,0.00096795056,0.104587525],"category_scores_gemma":[0.0041493084,0.0008583828,0.0006066464,0.0037953535,0.00074249937,0.0033235284,0.0015133064,0.0025688808,0.069983825],"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.000057018176,0.00004284807,0.00015912857,0.00017360589,0.000017268885,0.000037131602,0.000024718236,0.0017148328,0.00048475876,0.012759967,0.77522177,0.20930697],"study_design_scores_gemma":[0.000018341963,0.000031643205,0.00067475095,0.00013276564,0.00003165317,0.00017304266,0.000040052524,0.012279091,0.001179644,0.019437369,0.96598387,0.00001765887],"about_ca_topic_score_codex":0.004360243,"about_ca_topic_score_gemma":0.008806933,"teacher_disagreement_score":0.104587525,"about_ca_system_score_codex":0.0015280887,"about_ca_system_score_gemma":0.002128431,"threshold_uncertainty_score":0.3498801},"labels":[],"label_agreement":null},{"id":"W4301202287","doi":"10.1007/b136271","title":"Computational Science and Its Applications – ICCSA 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Exhibition; Computer science; Convention; Set (abstract data type); Library science; Computer graphics (images); Computational science; Art history; Programming language; Political science; History; Law","score_opus":0.05567509002823586,"score_gpt":0.35274773898727524,"score_spread":0.2970726489590394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301202287","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005503199,0.13318428,0.20031558,0.015559016,0.033529714,0.00037174535,0.003865848,0.007199586,0.600471],"genre_scores_gemma":[0.027681418,0.08293104,0.061860856,0.0015950646,0.008304639,0.00027536313,0.0049875593,0.0020554364,0.8103086],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991053,0.0001495936,0.000057214445,0.0001384754,0.00048736046,0.00006211517],"domain_scores_gemma":[0.9974154,0.0005844305,0.00008804694,0.0005490751,0.0010450494,0.0003179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019101887,0.0013022455,0.0017444786,0.003441934,0.0009190671,0.004134041,0.0013351274,0.0010413964,0.06089853],"category_scores_gemma":[0.0039002039,0.0009328497,0.00072725886,0.005981127,0.0011443332,0.0030060145,0.0022280451,0.0026495857,0.030149747],"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.000052981282,0.000056884,0.00025981336,0.00032957102,0.000023736786,0.00002946165,0.000049610942,0.003016164,0.00051282876,0.027998386,0.6852105,0.28246003],"study_design_scores_gemma":[0.000007584969,0.000030816485,0.00084496086,0.00027975082,0.000025310175,0.00014187863,0.00003693132,0.008201757,0.0006863767,0.01977627,0.9699516,0.000016727105],"about_ca_topic_score_codex":0.006203743,"about_ca_topic_score_gemma":0.009319156,"teacher_disagreement_score":0.06089853,"about_ca_system_score_codex":0.0020405806,"about_ca_system_score_gemma":0.0027992427,"threshold_uncertainty_score":0.20372587},"labels":[],"label_agreement":null},{"id":"W4301283137","doi":"10.1007/978-3-319-21410-8","title":"Computational Science and Its Applications -- ICCSA 2015","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Calgary","funders":"","keywords":"Computer science; Set (abstract data type); Volume (thermodynamics); Computational science; Programming language","score_opus":0.0835687946524721,"score_gpt":0.37677233538205834,"score_spread":0.2932035407295862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301283137","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002381154,0.22465666,0.0957773,0.01308256,0.037109926,0.00025594982,0.002576825,0.002445179,0.6217145],"genre_scores_gemma":[0.024207259,0.13960415,0.033736553,0.0024979818,0.013100687,0.000286441,0.0036903487,0.0017935289,0.781083],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921215,0.00012433721,0.000047451635,0.0001342922,0.0004264213,0.00005535788],"domain_scores_gemma":[0.9984547,0.00049236824,0.00005303758,0.00027616552,0.00048662527,0.00023712286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159291,0.0014424043,0.001422061,0.0037809147,0.00093480136,0.0043647974,0.0009706939,0.0010510819,0.056628015],"category_scores_gemma":[0.002943777,0.00069220486,0.0007619301,0.0061752046,0.0011978665,0.0033454723,0.0026275534,0.0030103133,0.029277503],"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.000030359406,0.000050138384,0.0002133117,0.00048989634,0.000019868285,0.00002085925,0.00004948134,0.0021880968,0.000552073,0.057116646,0.63023925,0.30902994],"study_design_scores_gemma":[0.000004910841,0.000025714506,0.00073356234,0.00055431447,0.0000133636095,0.00012065297,0.000040421353,0.0039125243,0.00046660219,0.041765437,0.9523462,0.000016319373],"about_ca_topic_score_codex":0.003216978,"about_ca_topic_score_gemma":0.0063660494,"teacher_disagreement_score":0.056628015,"about_ca_system_score_codex":0.0024283598,"about_ca_system_score_gemma":0.0027912252,"threshold_uncertainty_score":0.1894396},"labels":[],"label_agreement":null},{"id":"W4301511280","doi":"10.1007/978-3-642-33509-9","title":"Intelligent Robotics and Applications","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","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":"Concordia University","funders":"","keywords":"Robotics; Computer science; Artificial intelligence; Future of robotics; Robot","score_opus":0.01319773463491632,"score_gpt":0.22707117822996783,"score_spread":0.2138734435950515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301511280","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016284104,0.064585656,0.15007591,0.0014740935,0.004491009,0.00015645752,0.00058701437,0.0031500137,0.77385145],"genre_scores_gemma":[0.009554611,0.030697703,0.039992876,0.00058530894,0.0010471672,0.00011497301,0.00095746765,0.0005604553,0.91648936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996356,0.000022769154,0.000014955492,0.000063806176,0.00023560548,0.000027183492],"domain_scores_gemma":[0.9998,0.00003893653,0.000008834447,0.000050355622,0.00007663056,0.000025218364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028761948,0.0016260257,0.0011535386,0.001755952,0.00058022357,0.0022910805,0.0012717558,0.001101991,0.06980697],"category_scores_gemma":[0.0006229224,0.0005577469,0.00056636805,0.0017805777,0.00067808677,0.0022325898,0.0018801328,0.0014511885,0.054347806],"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.000023184619,0.000037831556,0.00007461759,0.0005087924,0.000020395286,0.000059337228,0.000083977815,0.0019364918,0.004481259,0.050210744,0.2386504,0.70391303],"study_design_scores_gemma":[0.000003980306,0.000030173262,0.00026547295,0.00016744158,0.000012046048,0.00022855776,0.000028958819,0.0029280693,0.0014634498,0.0275992,0.9672579,0.000014754004],"about_ca_topic_score_codex":0.00058713654,"about_ca_topic_score_gemma":0.0014406581,"teacher_disagreement_score":0.06980697,"about_ca_system_score_codex":0.0005342657,"about_ca_system_score_gemma":0.000648951,"threshold_uncertainty_score":0.23352754},"labels":[],"label_agreement":null},{"id":"W4301775964","doi":"10.1007/3-540-45123-4","title":"Combinatorial Pattern Matching","year":2000,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Université de Montréal","funders":"","keywords":"Matching (statistics); Computer science; Mathematics; Statistics","score_opus":0.009172885170588025,"score_gpt":0.23714737469962857,"score_spread":0.22797448952904054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301775964","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031217072,0.005358043,0.44390914,0.0020741988,0.0012423623,0.00038813255,0.0028041184,0.0030021605,0.5100049],"genre_scores_gemma":[0.34661934,0.006455844,0.3529506,0.0012014036,0.0010673375,0.00056216633,0.012261773,0.0015445022,0.27733704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993925,0.00008183153,0.000035313045,0.00018222978,0.0002442351,0.00006386432],"domain_scores_gemma":[0.9993937,0.00014497597,0.00003996798,0.00027695298,0.000097544034,0.000046872803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003690566,0.00077630894,0.0010101632,0.0018140828,0.0008546009,0.0020711273,0.0017018465,0.00094844826,0.041628983],"category_scores_gemma":[0.0017519931,0.00048471737,0.0008544233,0.003674022,0.0007328102,0.003155393,0.0018378637,0.001471486,0.013156897],"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.000121693825,0.00015083636,0.0003559504,0.0003553782,0.000053955082,0.00011034509,0.00006608105,0.0064395103,0.0050759786,0.37633884,0.07254419,0.53838724],"study_design_scores_gemma":[0.000037084832,0.000070159935,0.0005508671,0.00007630852,0.000056110766,0.00061194616,0.00006107367,0.028035432,0.006175429,0.8308151,0.1334873,0.000023158034],"about_ca_topic_score_codex":0.00040007068,"about_ca_topic_score_gemma":0.00058954896,"teacher_disagreement_score":0.041628983,"about_ca_system_score_codex":0.0007830686,"about_ca_system_score_gemma":0.0007129768,"threshold_uncertainty_score":0.13926286},"labels":[],"label_agreement":null},{"id":"W4302343786","doi":"10.1007/978-3-642-17508-4","title":"Learning Classifier Systems","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Classifier (UML); Artificial intelligence; Computer science","score_opus":0.012436757185495206,"score_gpt":0.24047724926240355,"score_spread":0.22804049207690835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302343786","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009503432,0.0046001147,0.939965,0.001286325,0.000982818,0.00017198958,0.00056195515,0.002891831,0.040036485],"genre_scores_gemma":[0.2559618,0.006044311,0.5806965,0.0009762706,0.0013048704,0.0005078799,0.0044804965,0.00072495634,0.14930293],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936706,0.00010061451,0.00004014539,0.00022744627,0.00022233135,0.000042462198],"domain_scores_gemma":[0.99918324,0.0003037154,0.00002913862,0.00025224677,0.00020609921,0.000025514119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008935626,0.00066345546,0.0008937079,0.0009480642,0.0007481392,0.0020981599,0.0012508503,0.0011341453,0.017964838],"category_scores_gemma":[0.00340851,0.0004285296,0.0006846622,0.0009545448,0.0006635304,0.002813814,0.0013269711,0.0016748608,0.01032196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005871712,0.000058165246,0.0007129312,0.00018826607,0.00007300819,0.000071549526,0.00011069291,0.015480388,0.0051125786,0.08510876,0.035324294,0.8577008],"study_design_scores_gemma":[0.000026436706,0.00013373823,0.000971904,0.0001628747,0.00011219073,0.0004960415,0.00010075739,0.42278835,0.014050301,0.3823301,0.17878452,0.00004282434],"about_ca_topic_score_codex":0.00081764255,"about_ca_topic_score_gemma":0.00122625,"teacher_disagreement_score":0.017964838,"about_ca_system_score_codex":0.0006076382,"about_ca_system_score_gemma":0.00063836103,"threshold_uncertainty_score":0.06009835},"labels":[],"label_agreement":null},{"id":"W4302423171","doi":"10.1007/978-3-540-69939-2","title":"Artificial Neural Networks in Pattern Recognition","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.026350020297131842,"score_gpt":0.24492401224480026,"score_spread":0.2185739919476684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302423171","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.003195043,0.12310945,0.7785996,0.0018167499,0.007421737,0.00009138255,0.00060781144,0.002340095,0.08281804],"genre_scores_gemma":[0.049442243,0.10929703,0.46253145,0.0011966167,0.0039038649,0.0003031478,0.0018938418,0.0010572178,0.37037456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971145,0.000041032217,0.000029494027,0.000056638874,0.00014412697,0.000017328759],"domain_scores_gemma":[0.9996481,0.00014590219,0.000029382783,0.00007059172,0.00009191964,0.000014098484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039087096,0.0009578162,0.0013442072,0.00097540254,0.00020590627,0.0014146611,0.0012001535,0.0010484183,0.019680176],"category_scores_gemma":[0.0011995574,0.0005232819,0.00044807376,0.0026155044,0.00054141035,0.002340893,0.00077224197,0.001231532,0.013147898],"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.00003780344,0.0000330809,0.0001769759,0.0010705991,0.000060496663,0.000092626164,0.000044496417,0.014134435,0.003406254,0.040524215,0.07502509,0.8653939],"study_design_scores_gemma":[0.00002818539,0.00010942563,0.0013031822,0.0007546036,0.00013005067,0.0009441815,0.000076606775,0.16518317,0.00858712,0.15969977,0.6631118,0.00007189365],"about_ca_topic_score_codex":0.0008390793,"about_ca_topic_score_gemma":0.0011315315,"teacher_disagreement_score":0.019680176,"about_ca_system_score_codex":0.000297915,"about_ca_system_score_gemma":0.00036287794,"threshold_uncertainty_score":0.06583673},"labels":[],"label_agreement":null},{"id":"W4302556148","doi":"10.1007/978-3-319-41501-7","title":"Image Analysis and Recognition","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Image (mathematics); Artificial intelligence; Library science; Operations research; Engineering","score_opus":0.013607163514049987,"score_gpt":0.2267060538329625,"score_spread":0.21309889031891252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302556148","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.0022887276,0.016320625,0.7337244,0.00072456297,0.002499151,0.00027209826,0.0018762233,0.013336803,0.22895734],"genre_scores_gemma":[0.016283123,0.013272615,0.2105916,0.0006668279,0.00080660015,0.00023329457,0.004980942,0.0018931484,0.7512719],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995402,0.000019212499,0.000020152875,0.00011134427,0.0002796977,0.000029445586],"domain_scores_gemma":[0.9996569,0.000041078525,0.0000129023465,0.00012407717,0.0001433393,0.000021718159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035255135,0.0015127071,0.0011243465,0.0021278975,0.00042864995,0.0020068735,0.0015880171,0.0009769812,0.10212858],"category_scores_gemma":[0.00060442503,0.0005964488,0.00075219217,0.0018749733,0.0005575295,0.0014552985,0.0014289015,0.0010439075,0.13371131],"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.000040879484,0.000031901774,0.00006995794,0.00031490665,0.000023932504,0.000054243872,0.000028931776,0.0008696755,0.029224668,0.008079228,0.12067348,0.84058815],"study_design_scores_gemma":[0.000010440839,0.00007046152,0.0008326435,0.00011598267,0.000035659603,0.00072541356,0.000036046997,0.008158992,0.045796234,0.011341702,0.93283993,0.00003652572],"about_ca_topic_score_codex":0.00076837314,"about_ca_topic_score_gemma":0.0012153995,"teacher_disagreement_score":0.10212858,"about_ca_system_score_codex":0.0003646935,"about_ca_system_score_gemma":0.0005696958,"threshold_uncertainty_score":0.34165412},"labels":[],"label_agreement":null},{"id":"W43061790","doi":"10.1007/978-3-642-30615-0_18","title":"Word-Oriented Transformation Shift Registers and Their Linear Complexity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Carleton University","funders":"","keywords":"Shift register; Transformation (genetics); Computer science; Word (group theory); Arithmetic; Time complexity; Word length; Linear map; Algorithm; Mathematics; Natural language processing; Pure mathematics; Telecommunications","score_opus":0.028436077941673105,"score_gpt":0.24101112186937168,"score_spread":0.21257504392769858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43061790","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.28356904,0.0061859884,0.466167,0.0031615975,0.00054873934,0.00018748779,0.0007989152,0.0012974775,0.2380838],"genre_scores_gemma":[0.84200644,0.0030289846,0.07860765,0.00062930974,0.0007002872,0.00030086562,0.0005784555,0.00042612795,0.073721826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992588,0.00012113999,0.000048572885,0.00011610411,0.00033396474,0.00012129281],"domain_scores_gemma":[0.99903476,0.00056616194,0.00010466418,0.00015957921,0.00010146548,0.000033319593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032387712,0.0005656953,0.0004847421,0.0011535814,0.0006833991,0.0024874262,0.00078094326,0.0008075821,0.011805914],"category_scores_gemma":[0.0024129443,0.00044823892,0.0005182207,0.0017274052,0.0017489301,0.0038771916,0.0012548245,0.0019468118,0.002344517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007500316,0.000023823422,0.000088249,0.00005194614,0.0000079355195,0.000044411678,0.00010238585,0.0029820716,0.0019429912,0.9611606,0.0019306196,0.03158987],"study_design_scores_gemma":[0.000018953555,0.000031818636,0.00009596592,0.000016303638,0.000009375382,0.00008432278,0.000024819783,0.011142503,0.00278862,0.979545,0.006223303,0.00001911307],"about_ca_topic_score_codex":0.0004741955,"about_ca_topic_score_gemma":0.0005872029,"teacher_disagreement_score":0.011805914,"about_ca_system_score_codex":0.0010840797,"about_ca_system_score_gemma":0.0007760485,"threshold_uncertainty_score":0.039494753},"labels":[],"label_agreement":null},{"id":"W4311397232","doi":"10.1007/978-3-031-23443-9_18","title":"APHYN-EP: Physics-Based Deep Learning Framework to Learn and Forecast Cardiac Electrophysiology Dynamics","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","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":"Sunnybrook Hospital","funders":"Agence Nationale de la Recherche","keywords":"Cardiac electrophysiology; Computer science; Artificial intelligence; Deep learning; Noise (video); Machine learning; Electrophysiology; Theoretical computer science; Neuroscience","score_opus":0.006980866094085526,"score_gpt":0.23806864837503713,"score_spread":0.23108778228095161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311397232","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.006599254,0.00060803874,0.9838817,0.00018733788,0.000187576,0.000036152684,0.00075791345,0.0051948917,0.0025471426],"genre_scores_gemma":[0.26409712,0.0013168696,0.7030972,0.00052909396,0.00021401461,0.0002726033,0.0044176816,0.0011926695,0.024862712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999232,0.000011205064,0.000004591481,0.00002517922,0.000024363797,0.000011355519],"domain_scores_gemma":[0.9998381,0.000067282126,0.000010058309,0.000021480002,0.000044077842,0.000018934465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036024782,0.0007676614,0.00047493193,0.00035506304,0.00021371976,0.0006381335,0.0013176159,0.0010189931,0.0072464785],"category_scores_gemma":[0.0008911059,0.00041386767,0.0006062646,0.00032268188,0.0002114722,0.00090364646,0.0010110206,0.0019366625,0.002015726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001657468,0.00012955794,0.00093717343,0.00013548322,0.00012605058,0.00016320405,0.00003514367,0.5535334,0.008138698,0.014932206,0.029881964,0.39182135],"study_design_scores_gemma":[0.000004820019,0.000010430699,0.00007022774,0.0000051297434,0.0000049403725,0.00001385801,0.0000014636089,0.99355435,0.0007917917,0.004142647,0.0013969099,0.0000033759115],"about_ca_topic_score_codex":0.005493204,"about_ca_topic_score_gemma":0.009161953,"teacher_disagreement_score":0.0072464785,"about_ca_system_score_codex":0.00037307595,"about_ca_system_score_gemma":0.0007448203,"threshold_uncertainty_score":0.024241865},"labels":[],"label_agreement":null},{"id":"W4311426076","doi":"10.1007/978-3-031-19745-1_16","title":"The RPM3D Project: 3D Kinematics for Remote Patient Monitoring","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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":"Polytechnique Montréal","funders":"Agència de Gestió d'Ajuts Universitaris i de Recerca; Generalitat de Catalunya; Centres de Recerca de Catalunya","keywords":"Neurorehabilitation; Computer science; Kinematics; Telemedicine; Health care; Remote patient monitoring; Work (physics); Smartwatch; Human–computer interaction; Rehabilitation; Data science; Embedded system; Medicine; Engineering; Wearable computer","score_opus":0.025519339213196456,"score_gpt":0.29436743453714004,"score_spread":0.2688480953239436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311426076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012834562,0.0016772039,0.9540009,0.00016561683,0.00046312684,0.00009182746,0.0017323052,0.019751826,0.020833785],"genre_scores_gemma":[0.045983594,0.0062085562,0.79020435,0.0004254995,0.00038324893,0.00060895144,0.009355131,0.014467929,0.13236266],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944454,0.00006648096,0.000027040782,0.00008951616,0.0003481391,0.000024260664],"domain_scores_gemma":[0.99960965,0.0001459769,0.000017167413,0.00007446171,0.000121255915,0.000031455427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074798486,0.00198715,0.00094348664,0.0007283593,0.0002164588,0.0012505732,0.0018563943,0.0014596144,0.059206653],"category_scores_gemma":[0.0010478296,0.0010181516,0.00094652636,0.00092840474,0.00041251528,0.0011513574,0.0015908858,0.0011687474,0.02477103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016950927,0.00005707176,0.00025680146,0.000546067,0.000042959236,0.0001392595,0.00021738722,0.022962222,0.026755279,0.011484446,0.15698394,0.78038514],"study_design_scores_gemma":[0.0001384281,0.00034494157,0.0022964184,0.00040274407,0.00007410279,0.0016394007,0.0000876071,0.18371709,0.042640872,0.023853974,0.74461186,0.00019249177],"about_ca_topic_score_codex":0.0014626142,"about_ca_topic_score_gemma":0.0016886869,"teacher_disagreement_score":0.059206653,"about_ca_system_score_codex":0.00028042827,"about_ca_system_score_gemma":0.0005829792,"threshold_uncertainty_score":0.198066},"labels":[],"label_agreement":null},{"id":"W4311838665","doi":"10.1007/978-3-031-20624-5_42","title":"Local Routing Algorithms on Euclidean Spanners with Small Diameter","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Delaunay triangulation; Vertex (graph theory); Mathematics; Path (computing); Routing (electronic design automation); Euclidean geometry; Triangulation; Discrete mathematics; Algorithm; Graph; Computer science; Geometry","score_opus":0.022383886416188988,"score_gpt":0.23250546014862314,"score_spread":0.21012157373243415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311838665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041558057,0.0008691603,0.94035894,0.00033917886,0.0001472012,0.00015475799,0.00018733933,0.001297395,0.0150881],"genre_scores_gemma":[0.2753802,0.0011549084,0.6945708,0.00027054295,0.00021215668,0.0005014799,0.00075354567,0.0008965195,0.026259769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00017639376,0.00004265246,0.0001647275,0.00018417211,0.00008978177],"domain_scores_gemma":[0.99776065,0.0012360753,0.00017726344,0.00048276,0.00019885536,0.00014440664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088087603,0.0011221268,0.00139818,0.0011198967,0.00084402855,0.0015389873,0.0026639032,0.0010256139,0.009302367],"category_scores_gemma":[0.004575975,0.0007047971,0.00069340284,0.0017914728,0.0009239823,0.004289768,0.0036485773,0.0018931879,0.0023520028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005661275,0.00024062459,0.00057414925,0.00061661255,0.00008364304,0.00013787644,0.00038565655,0.37170652,0.013445636,0.27966437,0.01823053,0.31434822],"study_design_scores_gemma":[0.00010333998,0.00020268444,0.00019243822,0.000060281593,0.000036235848,0.00012199312,0.00013640696,0.75982046,0.004153282,0.22793123,0.007214769,0.00002686781],"about_ca_topic_score_codex":0.00069329684,"about_ca_topic_score_gemma":0.0013238203,"teacher_disagreement_score":0.009302367,"about_ca_system_score_codex":0.00086521433,"about_ca_system_score_gemma":0.0005723643,"threshold_uncertainty_score":0.031119525},"labels":[],"label_agreement":null},{"id":"W4312076523","doi":"10.1007/978-3-031-26409-2_18","title":"MEAD: A Multi-Armed Approach for Evaluation of Adversarial Examples Detectors","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Computer science; Adversarial system; Detector; Metric (unit); Artificial intelligence; Machine learning; Computer security; Data mining; Telecommunications","score_opus":0.07078720065733597,"score_gpt":0.31251728003652635,"score_spread":0.2417300793791904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312076523","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.0062444527,0.0003120531,0.9862726,0.00011952587,0.000074498734,0.00014446407,0.00022130116,0.004809578,0.0018015788],"genre_scores_gemma":[0.11099521,0.00013788298,0.8830902,0.00022700756,0.000052743784,0.00035798896,0.0008095969,0.0007077766,0.003621641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963607,0.0017970941,0.00019436779,0.0005085232,0.000915196,0.00022420549],"domain_scores_gemma":[0.9951574,0.0030184363,0.00021397446,0.0006204597,0.0008229857,0.00016671103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006960776,0.0023076762,0.0019204554,0.0023417706,0.00077448937,0.0020287712,0.003858438,0.004573532,0.008959327],"category_scores_gemma":[0.013871023,0.001234291,0.0014056728,0.0010958988,0.0010434481,0.0022459636,0.0034492349,0.0025178504,0.0021601582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009870157,0.0002505922,0.0013722986,0.00032777083,0.0004670663,0.00014398644,0.000094598414,0.5755744,0.007714341,0.016050339,0.017761836,0.37925577],"study_design_scores_gemma":[0.000023716007,0.000057770358,0.000083082756,0.000011637077,0.00001002861,0.000027793802,0.0000070751794,0.9936009,0.0018955554,0.0034185431,0.0008534946,0.0000103998],"about_ca_topic_score_codex":0.0027189662,"about_ca_topic_score_gemma":0.004650923,"teacher_disagreement_score":0.008959327,"about_ca_system_score_codex":0.0010563632,"about_ca_system_score_gemma":0.0012850049,"threshold_uncertainty_score":0.036812544},"labels":[],"label_agreement":null},{"id":"W4312235560","doi":"10.1007/978-3-031-21541-4_13","title":"Magic Sets in Interpolation-Based Rule Driven Query Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Query optimization; MAGIC (telescope); Transformation (genetics); Query language; Sargable; Interpolation (computer graphics); Query expansion; Set (abstract data type); Theoretical computer science; Extension (predicate logic); RDF query language; Algorithm; Web search query; Web query classification; Data mining; Information retrieval; Programming language; Artificial intelligence; Search engine","score_opus":0.012400352977995079,"score_gpt":0.24266850787988348,"score_spread":0.2302681549018884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312235560","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.007350672,0.0006752861,0.9882068,0.00012733847,0.000054020304,0.00006645504,0.00009166249,0.00077184686,0.0026559657],"genre_scores_gemma":[0.19535036,0.0006317977,0.7969186,0.00025776585,0.0001374894,0.00022771653,0.0005573033,0.00051928795,0.0053997096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961604,0.0011530522,0.0002944988,0.00045490882,0.0016700939,0.00026702392],"domain_scores_gemma":[0.99500555,0.0035882865,0.00012866015,0.0007732776,0.0004158194,0.0000883926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035503136,0.0007992903,0.0024830312,0.0015693629,0.0007642152,0.0019513189,0.0034811622,0.0012479936,0.0063186293],"category_scores_gemma":[0.009745836,0.0011725036,0.0015102769,0.0029963837,0.0017667069,0.0038477676,0.003723693,0.0033461365,0.0012341171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009461164,0.00023754522,0.0006836792,0.00035320557,0.00012508815,0.00015326646,0.00023135285,0.31394356,0.006118107,0.25645378,0.00780379,0.41295046],"study_design_scores_gemma":[0.00002779059,0.0000706046,0.00007101518,0.000025429948,0.000023553355,0.000048145583,0.000023052526,0.8793576,0.0023425492,0.11553838,0.0024534233,0.000018449127],"about_ca_topic_score_codex":0.0037541508,"about_ca_topic_score_gemma":0.0030888151,"teacher_disagreement_score":0.0063186293,"about_ca_system_score_codex":0.0010116826,"about_ca_system_score_gemma":0.0013543332,"threshold_uncertainty_score":0.021137893},"labels":[],"label_agreement":null},{"id":"W4312250727","doi":"10.1007/978-3-031-19775-8_3","title":"You Already Have It: A Generator-Free Low-Precision DNN Training Framework Using Stochastic Rounding","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Simon Fraser University","funders":"","keywords":"Computer science; Rounding; NIST; Random number generation; Generator (circuit theory); Artificial neural network; Application-specific integrated circuit; Stochastic computing; Field-programmable gate array; Artificial intelligence; Algorithm; Computer engineering; Speech recognition; Computer hardware","score_opus":0.04120259046185975,"score_gpt":0.29585350691733087,"score_spread":0.2546509164554711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312250727","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.0016814416,0.00017618296,0.9938082,0.00011547322,0.00008743142,0.000026823236,0.00008248329,0.0014624019,0.0025595874],"genre_scores_gemma":[0.1273487,0.00040366035,0.85641944,0.00037066266,0.00015712022,0.00014337072,0.0005723364,0.0009647526,0.013619841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954057,0.00010533747,0.000023875946,0.00011496085,0.00016805467,0.00004734453],"domain_scores_gemma":[0.9994949,0.00021088634,0.000026105325,0.00011413956,0.00011460881,0.000039279956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011686856,0.00094920944,0.0010254551,0.00039384354,0.0005430311,0.0013127615,0.0023219825,0.0017698448,0.011275229],"category_scores_gemma":[0.0027503176,0.00071943563,0.00070439925,0.0004633662,0.00071837305,0.0016160941,0.0022581243,0.0036932635,0.0053756367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002832925,0.000075973716,0.0001952314,0.00014546992,0.00006314681,0.00016020382,0.00006393689,0.49190572,0.013367022,0.09356842,0.014563801,0.38560775],"study_design_scores_gemma":[0.000011627921,0.000021135958,0.000020980098,0.000014568972,0.0000064968344,0.000027071874,0.0000042137804,0.9738764,0.0020286168,0.021817654,0.0021631636,0.000008112597],"about_ca_topic_score_codex":0.0040189573,"about_ca_topic_score_gemma":0.007268443,"teacher_disagreement_score":0.011275229,"about_ca_system_score_codex":0.0006680036,"about_ca_system_score_gemma":0.0010674247,"threshold_uncertainty_score":0.03771943},"labels":[],"label_agreement":null},{"id":"W4312276895","doi":"10.1007/978-3-031-22061-6_23","title":"Motion Segmentation Based on Pixel Distribution Learning on Unseen Videos","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science; Segmentation; Computer vision; Motion (physics); Optical flow; Pixel; Convolutional neural network; Generalization; Focus (optics); Convolution (computer science); Process (computing); Image segmentation; Pattern recognition (psychology); Artificial neural network; Image (mathematics); Mathematics","score_opus":0.013885215912518513,"score_gpt":0.26367470019392586,"score_spread":0.24978948428140735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312276895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043736685,0.00092573167,0.9506227,0.00014073077,0.00009638463,0.00008685698,0.00041180447,0.0023933544,0.0015858441],"genre_scores_gemma":[0.4018844,0.0015713322,0.5836321,0.00025200172,0.0002528291,0.00010913252,0.003087874,0.00055611396,0.008654151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997271,0.00002153792,0.000012813184,0.00012887837,0.000058305657,0.000051333744],"domain_scores_gemma":[0.99971515,0.00008832876,0.000035903144,0.000056908884,0.000076339085,0.000027287193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037803632,0.00094058755,0.0013503124,0.0016267077,0.00032385427,0.0007835661,0.0009737191,0.0009625348,0.0020979533],"category_scores_gemma":[0.00080091925,0.0004796821,0.0008599738,0.0014408757,0.00044629263,0.0010392318,0.0005881871,0.00078930915,0.0014197871],"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.00037226663,0.00012964029,0.0016702604,0.00012360858,0.000092485,0.000115028444,0.000042110038,0.0626679,0.081047736,0.0016471654,0.0032226366,0.8488692],"study_design_scores_gemma":[0.000009074462,0.00005111022,0.0020341277,0.000011609823,0.00002894924,0.0001111637,0.00001118872,0.97917044,0.015675982,0.0018558028,0.0010307773,0.000009780386],"about_ca_topic_score_codex":0.006392387,"about_ca_topic_score_gemma":0.010654135,"teacher_disagreement_score":0.006392387,"about_ca_system_score_codex":0.00057560357,"about_ca_system_score_gemma":0.000667848,"threshold_uncertainty_score":0.0127103925},"labels":[],"label_agreement":null},{"id":"W4312278544","doi":"10.1007/978-3-031-21206-2_11","title":"Clustering in Tractography Using Autoencoders (CINTA)","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Tractography; Cluster analysis; Artificial intelligence; Computer science; Pattern recognition (psychology); Streamlines, streaklines, and pathlines; Autoencoder; Thresholding; Diffusion MRI; Artificial neural network; Magnetic resonance imaging; Physics; Image (mathematics); Medicine; Radiology","score_opus":0.0737373760954931,"score_gpt":0.34269315229404446,"score_spread":0.2689557761985514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312278544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016400858,0.0006810725,0.995989,0.000069532485,0.00008364254,0.000013728761,0.000063481326,0.0006623558,0.0007970464],"genre_scores_gemma":[0.042815708,0.0014237508,0.94640285,0.00009309893,0.00016378248,0.00010730316,0.0003885811,0.00053723616,0.008067759],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957913,0.000107440115,0.00002507429,0.00015369008,0.0001006396,0.000033981403],"domain_scores_gemma":[0.99889624,0.0005696572,0.00008275218,0.00020375749,0.00020577098,0.000041777173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009335206,0.0008192191,0.001117617,0.0011105738,0.00057300075,0.0013610454,0.0014586201,0.0015989298,0.0038609165],"category_scores_gemma":[0.0021440154,0.0009872759,0.0014781106,0.001791737,0.0007799203,0.0012402666,0.0012207638,0.0022310906,0.0021607894],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000704456,0.00005069107,0.00056395784,0.00026055906,0.00019416405,0.00011674707,0.0001665179,0.38292447,0.011258277,0.050586257,0.012354119,0.54145384],"study_design_scores_gemma":[0.000003572385,0.000016372027,0.00030415368,0.000025054875,0.000019462408,0.000089937246,0.000013112369,0.971839,0.0031128246,0.019360533,0.0051979288,0.000018029938],"about_ca_topic_score_codex":0.009615598,"about_ca_topic_score_gemma":0.014572873,"teacher_disagreement_score":0.009615598,"about_ca_system_score_codex":0.0008855707,"about_ca_system_score_gemma":0.0009802502,"threshold_uncertainty_score":0.019119263},"labels":[],"label_agreement":null},{"id":"W4312283072","doi":"10.1007/978-3-031-21707-4_39","title":"Exploring the Role of Trust During Human-AI Collaboration in Managerial Decision-Making Processes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Interpretability; Computer science; Popularity; Knowledge management; Process (computing); Trustworthiness; Artificial intelligence; Decision-making; Data science; Management science; Psychology; Marketing; Business; Social psychology; Engineering","score_opus":0.04039027055210212,"score_gpt":0.34239859520594124,"score_spread":0.3020083246538391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312283072","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.83668417,0.00086268154,0.04821524,0.0047838963,0.00006187987,0.00008347743,0.00003848961,0.00004231584,0.10922788],"genre_scores_gemma":[0.99753225,0.00005679632,0.0014239954,0.000030320502,0.0000035597604,0.0000131635,0.0000064051133,0.00000684148,0.00092663744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9921415,0.0063339854,0.00014505026,0.00029853146,0.0005223072,0.0005586613],"domain_scores_gemma":[0.9221676,0.06957161,0.003860441,0.0015201744,0.0015110677,0.0013690407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008962356,0.00027101013,0.00027877046,0.00047641824,0.002369191,0.006341634,0.0009136908,0.0019816908,0.006820879],"category_scores_gemma":[0.052128956,0.00041824274,0.0004165606,0.00065907417,0.004282822,0.008505197,0.0032224949,0.0029970333,0.00038177476],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012793492,0.00064388494,0.053240478,0.000489878,0.00018416437,0.0016599044,0.23060054,0.014469819,0.005170932,0.59604913,0.0019416559,0.09427016],"study_design_scores_gemma":[0.00012985183,0.00060829776,0.04773189,0.0004795443,0.00019041749,0.00075602805,0.1596478,0.085115395,0.0039586597,0.6843058,0.016941074,0.00013513585],"about_ca_topic_score_codex":0.0052042184,"about_ca_topic_score_gemma":0.004555355,"teacher_disagreement_score":0.008962356,"about_ca_system_score_codex":0.002636754,"about_ca_system_score_gemma":0.003519095,"threshold_uncertainty_score":0.04739797},"labels":[],"label_agreement":null},{"id":"W4312287159","doi":"10.1007/978-3-031-15982-4_10","title":"Accelerating the Delfs–Galbraith Algorithm with Fast Subfield Root Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Mathematics; Supersingular elliptic curve; Elliptic curve; Algorithm; Elliptic curve cryptography; Discrete mathematics; Arithmetic; Computer science; Pure mathematics; Public-key cryptography","score_opus":0.01139558803246537,"score_gpt":0.21220417259784896,"score_spread":0.20080858456538359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312287159","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.026647372,0.00092261075,0.9455089,0.00041034634,0.00040606316,0.0000776358,0.00012952246,0.0054127662,0.020484835],"genre_scores_gemma":[0.17727095,0.0004633873,0.7968471,0.00018154418,0.00016772134,0.0000662365,0.0003677793,0.0005866975,0.024048507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993413,0.00010223483,0.000025575386,0.00009664835,0.00035012394,0.00008409793],"domain_scores_gemma":[0.99939024,0.00019228984,0.000037470694,0.00017295055,0.0001746463,0.000032323143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049613573,0.0009785239,0.0007133836,0.0012711163,0.00048670892,0.0012074881,0.00089700683,0.0007434825,0.014688637],"category_scores_gemma":[0.0022706296,0.0002927224,0.0005361842,0.0011078544,0.0006409293,0.0017565867,0.0013746873,0.0011988464,0.0075857653],"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.0003941097,0.00007414376,0.0005885227,0.00016496296,0.000041610558,0.00012030177,0.000114259754,0.015979912,0.034412157,0.055126265,0.015579286,0.8774046],"study_design_scores_gemma":[0.00030712906,0.00041870374,0.0016067447,0.00013072744,0.00007191054,0.0012234047,0.00019267223,0.5656918,0.12905411,0.19255179,0.108630575,0.000120419805],"about_ca_topic_score_codex":0.0013631864,"about_ca_topic_score_gemma":0.0026225469,"teacher_disagreement_score":0.014688637,"about_ca_system_score_codex":0.0006686698,"about_ca_system_score_gemma":0.0010745892,"threshold_uncertainty_score":0.049138427},"labels":[],"label_agreement":null},{"id":"W4312294641","doi":"10.1007/978-3-031-17615-9_2","title":"Holistic Multimodal Interaction and Design","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Modalities; Computer science; Set (abstract data type); Multimodal interaction; Human–computer interaction; Value (mathematics); Management science; Engineering; Sociology","score_opus":0.05680101783938137,"score_gpt":0.2857044238986658,"score_spread":0.22890340605928441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312294641","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.020610198,0.04167643,0.31922394,0.002517926,0.00087978045,0.000111799054,0.00010031443,0.0009499132,0.6139296],"genre_scores_gemma":[0.460249,0.021307405,0.116195574,0.0009347216,0.0004800759,0.00065070204,0.00022082953,0.00043657207,0.39952505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968874,0.00010015025,0.000011328014,0.00005469327,0.000114232054,0.00003086818],"domain_scores_gemma":[0.99988997,0.00003876507,0.0000058200785,0.000029460778,0.000020709356,0.000015177031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042255118,0.0006845477,0.00043007985,0.0005186989,0.00067660783,0.0026543317,0.00053714175,0.00075943425,0.017568175],"category_scores_gemma":[0.00072825793,0.00032473044,0.00034075274,0.0004628698,0.0021295028,0.0027113366,0.0023198966,0.00093722576,0.0022536565],"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.000038222675,0.000032368644,0.00018339328,0.00049591705,0.000019650968,0.000094822244,0.0035281507,0.0014625256,0.0073020635,0.68085515,0.01978567,0.28620204],"study_design_scores_gemma":[0.000018030727,0.00017503543,0.001711168,0.00063525833,0.000040277962,0.00093962136,0.0025689926,0.005937582,0.0035410721,0.45368585,0.5307113,0.000035834757],"about_ca_topic_score_codex":0.00045713026,"about_ca_topic_score_gemma":0.0007177315,"teacher_disagreement_score":0.017568175,"about_ca_system_score_codex":0.0006383108,"about_ca_system_score_gemma":0.000574151,"threshold_uncertainty_score":0.05877137},"labels":[],"label_agreement":null},{"id":"W4312298943","doi":"10.1007/978-3-031-20980-2_26","title":"Harnessing Uncertainty - Multi-label Dysfluency Classification with Uncertain Labels","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Certainty; Computer science; Artificial intelligence; Machine learning; Uncertain data; Data mining; Mathematics","score_opus":0.04531384017437876,"score_gpt":0.27784002625415416,"score_spread":0.2325261860797754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312298943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097605646,0.002224338,0.8906811,0.0012129957,0.0004328732,0.000090882684,0.0012344747,0.0026857902,0.0038318192],"genre_scores_gemma":[0.8395066,0.0006479336,0.15083346,0.00049054285,0.0006052011,0.00013088746,0.0029622593,0.0002388926,0.0045842687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984609,0.00034854093,0.000110422385,0.00047191617,0.00039619463,0.00021192839],"domain_scores_gemma":[0.9939219,0.0042399154,0.0003996633,0.00055297103,0.00071941176,0.00016615556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021749227,0.0015068902,0.0016885607,0.0016556492,0.00073920225,0.0022085453,0.0017553086,0.0020946595,0.0015085047],"category_scores_gemma":[0.007697417,0.00040856274,0.0012080357,0.0014163959,0.00072086207,0.0028406424,0.002799067,0.002157151,0.00096117123],"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.0009076012,0.00037218622,0.010596401,0.00031657403,0.00035326206,0.00055919687,0.0004419795,0.09892577,0.020386105,0.007554999,0.0124599375,0.84712595],"study_design_scores_gemma":[0.000011201406,0.00005905432,0.0016628547,0.000026471194,0.000062509804,0.0000860714,0.000080957136,0.97295815,0.0046895635,0.019188704,0.0011426148,0.000031799496],"about_ca_topic_score_codex":0.0041889776,"about_ca_topic_score_gemma":0.004248519,"teacher_disagreement_score":0.0041889776,"about_ca_system_score_codex":0.00061922043,"about_ca_system_score_gemma":0.0007868854,"threshold_uncertainty_score":0.011502266},"labels":[],"label_agreement":null},{"id":"W4312307809","doi":"10.1007/978-3-031-22298-6_14","title":"Dramatic Situations for Emergent Narrative System Authorship","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Concordia University","funders":"","keywords":"Narrative; Computer science; Construct (python library); Relevance (law); Artifact (error); Process (computing); Heuristic; Space (punctuation); Tracing; Cognitive psychology; Cognitive science; Psychology; Artificial intelligence; Political science; Literature; Art","score_opus":0.04832716144921945,"score_gpt":0.29987093999201453,"score_spread":0.2515437785427951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312307809","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16977014,0.00038079327,0.27882504,0.0023135236,0.00034491505,0.00015244534,0.00028665655,0.0009034366,0.54702306],"genre_scores_gemma":[0.95676833,0.00006782496,0.02448913,0.00005158385,0.0000385659,0.000060027618,0.00015736501,0.00009530471,0.01827183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992213,0.00032754077,0.00005915657,0.00014889486,0.00013114976,0.00011190714],"domain_scores_gemma":[0.9972458,0.001601789,0.00016598037,0.00041181425,0.00030457767,0.0002701246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082739454,0.000363479,0.00027912844,0.00076394243,0.002507818,0.0033666715,0.0007643448,0.0011859377,0.027793277],"category_scores_gemma":[0.008613056,0.0003630499,0.00038686028,0.00048498128,0.002762339,0.00618649,0.0030075253,0.001533723,0.0013825544],"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.00003546879,0.000018916833,0.00037906945,0.00003707871,0.0000040006644,0.00022564684,0.0018339109,0.0014900862,0.000597441,0.9846705,0.002288547,0.008419376],"study_design_scores_gemma":[0.000021420823,0.000027389291,0.00033788718,0.000027225251,0.0000064612686,0.0003567306,0.0014614562,0.025265912,0.00078403077,0.95613813,0.015558366,0.000014968313],"about_ca_topic_score_codex":0.00052684505,"about_ca_topic_score_gemma":0.0007723899,"teacher_disagreement_score":0.027793277,"about_ca_system_score_codex":0.0010347718,"about_ca_system_score_gemma":0.0004790111,"threshold_uncertainty_score":0.09297782},"labels":[],"label_agreement":null},{"id":"W4312321689","doi":"10.1007/978-3-031-18523-6_11","title":"Cluster Based Secure Multi-party Computation in Federated Learning for Histopathology Images","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Vector Institute; University of Waterloo","funders":"","keywords":"Computer science; Federated learning; Differential privacy; Computation; Overhead (engineering); Cluster (spacecraft); Data mining; Artificial intelligence; Computer network; Algorithm; Operating system","score_opus":0.02974617077757063,"score_gpt":0.28108581536269317,"score_spread":0.25133964458512253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312321689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036985025,0.00023625298,0.9583805,0.00023647952,0.000055971068,0.00009115403,0.00013335544,0.0015464813,0.0023347687],"genre_scores_gemma":[0.7340623,0.00014591833,0.2593189,0.00008583169,0.000046578953,0.0001468377,0.00027443544,0.00009770294,0.005821504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988728,0.0002880463,0.00005923285,0.00020403115,0.00037179218,0.00020413275],"domain_scores_gemma":[0.9988912,0.00029636297,0.00006511317,0.0005475369,0.0001446566,0.000055118668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011981039,0.00035039432,0.0011457687,0.0006300503,0.0011634047,0.0013775274,0.0018322145,0.0011318281,0.0031251234],"category_scores_gemma":[0.0020881959,0.00026930092,0.000951459,0.0011194518,0.0007757117,0.0016449507,0.002638849,0.0010506174,0.0008522442],"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.001913095,0.00043522823,0.0020201262,0.00019455145,0.00018957276,0.0005156001,0.000334371,0.38474286,0.035006735,0.09231198,0.012300931,0.47003493],"study_design_scores_gemma":[0.000018056793,0.000061674975,0.00034868123,0.000007833388,0.000014559563,0.00018245204,0.000044009914,0.943779,0.012172893,0.041629456,0.0017282822,0.000013107064],"about_ca_topic_score_codex":0.0012903651,"about_ca_topic_score_gemma":0.0016576326,"teacher_disagreement_score":0.0031251234,"about_ca_system_score_codex":0.0013048135,"about_ca_system_score_gemma":0.0012792288,"threshold_uncertainty_score":0.010454595},"labels":[],"label_agreement":null},{"id":"W4312330522","doi":"10.1007/978-3-031-20044-1_16","title":"Open-World Semantic Segmentation via Contrasting and Clustering Vision-Language Embedding","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Pipeline (software); Cluster analysis; Image segmentation; Encoder; Embedding; Semantics (computer science); Object (grammar); Segmentation-based object categorization; Natural language processing; Pattern recognition (psychology); Scale-space segmentation; Computer vision","score_opus":0.013622829848246207,"score_gpt":0.30939730922828884,"score_spread":0.29577447938004264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312330522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013137918,0.00026453612,0.97885203,0.00013398484,0.00007639943,0.000067687506,0.00027361617,0.0033530553,0.0038407824],"genre_scores_gemma":[0.25056785,0.0005294568,0.7360241,0.00019308201,0.00009698131,0.00013974901,0.0030621416,0.0015276666,0.007858878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992219,0.00010839232,0.00003897307,0.00034898106,0.00014960679,0.00013210851],"domain_scores_gemma":[0.99941206,0.00013215154,0.000046446923,0.00018703354,0.00016761085,0.00005470051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000691706,0.0013529165,0.0012052062,0.0022670547,0.0008713321,0.0032750242,0.002303997,0.0017544532,0.0054719904],"category_scores_gemma":[0.0017400559,0.0007438432,0.0017328216,0.0028759788,0.0013000049,0.004079548,0.003314484,0.0018971694,0.00487588],"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.00036991513,0.00021849995,0.00078144664,0.00026229848,0.000118692966,0.00026799552,0.0004323989,0.0525857,0.06055855,0.051073693,0.010136781,0.823194],"study_design_scores_gemma":[0.000018045692,0.00008401264,0.0006774464,0.000043126725,0.000055096305,0.00023857498,0.00027390607,0.88433117,0.03514801,0.069857985,0.009223359,0.00004931793],"about_ca_topic_score_codex":0.0050713657,"about_ca_topic_score_gemma":0.007852389,"teacher_disagreement_score":0.0054719904,"about_ca_system_score_codex":0.0010191605,"about_ca_system_score_gemma":0.0014220793,"threshold_uncertainty_score":0.01830566},"labels":[],"label_agreement":null},{"id":"W4312349151","doi":"10.1007/978-3-031-23223-7_2","title":"Disproportionate Subgroup Impacts and Other Challenges of Fairness in Artificial Intelligence for Medical Image Analysis","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","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":"Alberta Children's Hospital; Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Debiasing; Computer science; Socioeconomic status; Odds; Artificial intelligence; Machine learning; Race (biology); Logistic regression; Psychology; Medicine; Social psychology; Environmental health","score_opus":0.10196219583463387,"score_gpt":0.3962910039154798,"score_spread":0.29432880808084594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312349151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13123281,0.004901483,0.6972947,0.051962577,0.001559169,0.00046674945,0.0008914668,0.0003621678,0.11132881],"genre_scores_gemma":[0.8757984,0.0008836422,0.104168676,0.0040613264,0.0015892489,0.00039334976,0.00023840833,0.00028151256,0.012585471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96124035,0.025547918,0.0012448902,0.003978117,0.006456995,0.0015317851],"domain_scores_gemma":[0.86253846,0.10032524,0.0053062066,0.02289678,0.0071161822,0.0018172179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042928565,0.000588769,0.0020470005,0.001387195,0.0033900768,0.0059815375,0.0031922811,0.0025742683,0.008485677],"category_scores_gemma":[0.17521761,0.00049547123,0.0011094068,0.0022269504,0.010351076,0.009251272,0.00701324,0.0057116183,0.0008075463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016843209,0.000062712665,0.006228563,0.000076761055,0.000116814226,0.00011511655,0.0007773725,0.007410712,0.0003876394,0.9168052,0.0072244015,0.06062634],"study_design_scores_gemma":[0.000012117454,0.000019198807,0.0011096068,0.00003437454,0.00002333948,0.000081173675,0.00019249824,0.011875838,0.00037981445,0.98218966,0.0040687136,0.000013671579],"about_ca_topic_score_codex":0.0026641835,"about_ca_topic_score_gemma":0.0032870562,"teacher_disagreement_score":0.042928565,"about_ca_system_score_codex":0.0030847522,"about_ca_system_score_gemma":0.0035499614,"threshold_uncertainty_score":0.22703063},"labels":[],"label_agreement":null},{"id":"W4312363658","doi":"10.1007/978-3-031-20071-7_34","title":"DVS-Voltmeter: Stochastic Process-Based Event Simulator for Dynamic Vision Sensors","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Voltmeter; Computer science; Noise (video); Event (particle physics); Process (computing); Simulation; Real-time computing; Artificial intelligence; Voltage; Electrical engineering; Physics; Engineering; Image (mathematics)","score_opus":0.011018523372938505,"score_gpt":0.2745387723037066,"score_spread":0.2635202489307681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312363658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009640187,0.00010884921,0.9746236,0.00012256736,0.000100898484,0.00007388843,0.0010333873,0.010568225,0.0037284058],"genre_scores_gemma":[0.642018,0.0003307248,0.3397999,0.00032915783,0.000079016856,0.00048267757,0.002531856,0.0026646343,0.011763969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981207,0.000037832942,0.000011303769,0.00003249029,0.00008997368,0.000016280812],"domain_scores_gemma":[0.99966025,0.00018053234,0.00002380534,0.000043618966,0.000067440575,0.000024287707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003267048,0.0005430223,0.00055837136,0.00028172717,0.00018632843,0.00061598094,0.0015167594,0.0008671928,0.009575955],"category_scores_gemma":[0.0016461853,0.00034163895,0.00040908926,0.00030312652,0.00025442286,0.000573574,0.0005339623,0.0010656376,0.0016463991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026847626,0.00009615783,0.0010241655,0.00021912894,0.000073213116,0.00013094474,0.00007596814,0.8819633,0.016940719,0.021538641,0.015362074,0.062307164],"study_design_scores_gemma":[0.000011576502,0.000008415902,0.000038225877,0.00000245023,0.0000024875058,0.000012189488,0.0000015449458,0.99505335,0.0018739008,0.0012764678,0.0017159405,0.000003516852],"about_ca_topic_score_codex":0.0019556326,"about_ca_topic_score_gemma":0.0019357539,"teacher_disagreement_score":0.009575955,"about_ca_system_score_codex":0.0004924151,"about_ca_system_score_gemma":0.0006016808,"threshold_uncertainty_score":0.032034814},"labels":[],"label_agreement":null},{"id":"W4312364883","doi":"10.1007/978-3-031-21441-7_1","title":"Practical Limits to Transfer Learning of Neural Network Controllers from Earth to Space Environments","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Artificial neural network; Space (punctuation); Computer science; Earth (classical element); Transfer of learning; Transfer (computing); Artificial intelligence; Physics; Astronomy","score_opus":0.01232044170673488,"score_gpt":0.2190194667523614,"score_spread":0.2066990250456265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312364883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031779896,0.007673181,0.8763108,0.009852212,0.0009279199,0.0000818676,0.00022364214,0.00085409137,0.072296396],"genre_scores_gemma":[0.9182613,0.005111315,0.05161809,0.0013663176,0.00082521583,0.00034878418,0.00030044088,0.00041418787,0.021754323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974899,0.0007294239,0.00014111873,0.00040474787,0.0010100051,0.00022478413],"domain_scores_gemma":[0.96603596,0.029773263,0.00046196888,0.0018801455,0.0016107154,0.0002378485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049029463,0.0010565188,0.0010473577,0.0005264914,0.00074536743,0.003582894,0.0022901383,0.0032919121,0.009270732],"category_scores_gemma":[0.043787632,0.00074148015,0.00046761075,0.00066536205,0.0036466867,0.008407594,0.004655735,0.00660379,0.0012785218],"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.00046040307,0.00011275498,0.0006931988,0.0010181359,0.00007568106,0.00027708284,0.00041350475,0.38946432,0.008227435,0.42233238,0.009894212,0.16703093],"study_design_scores_gemma":[0.00002666896,0.000092193375,0.00029615176,0.00014578496,0.000017362434,0.00018296624,0.00009213458,0.65360135,0.0035273656,0.3367056,0.005285496,0.000026860602],"about_ca_topic_score_codex":0.0019617707,"about_ca_topic_score_gemma":0.001083565,"teacher_disagreement_score":0.009270732,"about_ca_system_score_codex":0.0014977091,"about_ca_system_score_gemma":0.0011644741,"threshold_uncertainty_score":0.031013668},"labels":[],"label_agreement":null},{"id":"W4312374764","doi":"10.1007/978-3-031-18192-4_2","title":"Investigating Effects of Centralized Learning Decentralized Execution on Team Coordination in the Level Based Foraging Environment as a Sequential Social Dilemma","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Foraging; Computer science; Dilemma; Social dilemma; Reinforcement learning; Artificial intelligence; Convergence (economics); Social learning; Action (physics); State (computer science); Machine learning; Knowledge management; Ecology; Algorithm; Psychology; Social psychology","score_opus":0.024871536777855238,"score_gpt":0.2559807411380916,"score_spread":0.23110920436023635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312374764","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.9905748,0.000087748245,0.00490421,0.00017735203,0.000015463233,0.00002358365,0.000017841201,0.00001901475,0.004180019],"genre_scores_gemma":[0.99727184,0.00003599276,0.001997627,0.000014226923,0.000005223949,0.000015124938,0.000009966892,0.0000073716296,0.0006426116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.0003543782,0.000020469475,0.00008929162,0.00007986085,0.00009304138],"domain_scores_gemma":[0.9829305,0.014956029,0.00086349633,0.00036746956,0.0003046668,0.00057786383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420608,0.00037629338,0.0004376885,0.00022373315,0.0003344112,0.0009370008,0.0007863475,0.0006107672,0.0030557374],"category_scores_gemma":[0.012818172,0.00021586666,0.00022278969,0.00024536665,0.00092655345,0.0012775796,0.0007731557,0.0011003336,0.00011617319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00616074,0.0032537999,0.012141975,0.0003859635,0.00020365904,0.0004504419,0.00079868734,0.86631334,0.027607083,0.039064668,0.0016352179,0.0419845],"study_design_scores_gemma":[0.0002950781,0.0019919833,0.0067682043,0.00001790906,0.000059267513,0.00003982244,0.00052996393,0.9654018,0.0028513866,0.021782085,0.00023668172,0.000025876629],"about_ca_topic_score_codex":0.0025915166,"about_ca_topic_score_gemma":0.0020267179,"teacher_disagreement_score":0.0030557374,"about_ca_system_score_codex":0.0008588826,"about_ca_system_score_gemma":0.0008057296,"threshold_uncertainty_score":0.010222495},"labels":[],"label_agreement":null},{"id":"W4312383880","doi":"10.1007/978-3-031-22476-8_2","title":"Formalization of Functional Block Diagrams Using HOL Theorem Proving","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","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":"Concordia University","funders":"","keywords":"HOL; Computer science; Dependability; Reliability block diagram; Theoretical computer science; Probabilistic logic; Automated theorem proving; Fault tree analysis; Block diagram; Formal methods; Programming language; Algorithm; Reliability engineering; Software engineering; Artificial intelligence; Engineering","score_opus":0.013594482430902144,"score_gpt":0.19633296923048027,"score_spread":0.18273848679957813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312383880","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.0023940725,0.00015268507,0.9892287,0.00010684345,0.00006255573,0.00005042251,0.000095968964,0.0011288464,0.0067798584],"genre_scores_gemma":[0.20657466,0.00087357964,0.7723727,0.00021747315,0.00014775549,0.00024895402,0.0008443124,0.0011128632,0.0176077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889815,0.000279168,0.000077583536,0.00015343781,0.00046324596,0.00012832196],"domain_scores_gemma":[0.9983998,0.0009654196,0.00007773231,0.00026558916,0.00025249552,0.000039094084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079385,0.00072988507,0.00056384463,0.0010622689,0.0007741248,0.002000185,0.001534454,0.00060390704,0.011487857],"category_scores_gemma":[0.0028736796,0.0007742731,0.0013053915,0.00061773206,0.0016673363,0.0027524764,0.0015269723,0.00243951,0.002065018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072776325,0.00007579227,0.00022512645,0.0004263793,0.00002877771,0.00020081774,0.00037012412,0.022700291,0.0113580525,0.8354885,0.004274837,0.12477852],"study_design_scores_gemma":[0.00006927216,0.000064228756,0.00024065936,0.00019969275,0.00006981586,0.0002704846,0.000097471544,0.14147055,0.034687106,0.74140084,0.08139245,0.00003746473],"about_ca_topic_score_codex":0.0020014122,"about_ca_topic_score_gemma":0.0022740576,"teacher_disagreement_score":0.011487857,"about_ca_system_score_codex":0.00096332293,"about_ca_system_score_gemma":0.0012399566,"threshold_uncertainty_score":0.03843075},"labels":[],"label_agreement":null},{"id":"W4312402298","doi":"10.1007/978-3-031-23223-7_5","title":"User-Centered Design for Surgical Innovations: A Ventriculostomy Case Study","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anatomy and Medical Technology","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":"Concordia University","funders":"","keywords":"Computer science; USable; Context (archaeology); Multidisciplinary approach; Process (computing); Focus (optics); User experience design; Human–computer interaction; User-centered design; New product development; Product design; Product (mathematics); Process management; Multimedia; Engineering","score_opus":0.029631106522007292,"score_gpt":0.2717352335540148,"score_spread":0.2421041270320075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312402298","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.78223133,0.006474922,0.11358164,0.008540421,0.0008524423,0.00040318316,0.00020062792,0.00048684777,0.08722857],"genre_scores_gemma":[0.9382369,0.0013302407,0.037569556,0.00063745235,0.00014801936,0.00008116897,0.0000629814,0.00018627524,0.02174742],"study_design_codex":"case_report","study_design_gemma":"case_report","domain_scores_codex":[0.9983814,0.00045983188,0.000116905845,0.00012448976,0.00068969285,0.00022768027],"domain_scores_gemma":[0.9976019,0.0014617156,0.00022015338,0.00020318243,0.00014224368,0.0003707848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400498,0.00083978276,0.0004224835,0.001479754,0.0020200403,0.0027661156,0.0013507992,0.0051465374,0.004066581],"category_scores_gemma":[0.0044828528,0.00039830664,0.00082520844,0.0010578935,0.002446917,0.0010769351,0.0015185131,0.0022911297,0.00095733366],"study_design_candidate":"case_report","study_design_consensus":"case_report","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003376414,0.0012440137,0.02006451,0.00059367786,0.00008434713,0.68062824,0.020204186,0.005143495,0.015922468,0.05284394,0.01376645,0.18916704],"study_design_scores_gemma":[0.00003324259,0.00064841146,0.0052629006,0.00023863942,0.000047220263,0.9047994,0.005313119,0.009212192,0.0077430597,0.008826149,0.057784088,0.00009163749],"about_ca_topic_score_codex":0.0007946176,"about_ca_topic_score_gemma":0.0025264842,"teacher_disagreement_score":0.0051465374,"about_ca_system_score_codex":0.0011508255,"about_ca_system_score_gemma":0.0008044565,"threshold_uncertainty_score":0.0136041045},"labels":[],"label_agreement":null},{"id":"W4312408638","doi":"10.1007/978-3-031-17899-3_7","title":"Weakly Supervised Intracranial Hemorrhage Segmentation Using Hierarchical Combination of Attention Maps from a Swin Transformer","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intracerebral and Subarachnoid Hemorrhage Research","field":"Medicine","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":"Concordia University","funders":"","keywords":"Segmentation; Artificial intelligence; Computer science; Binary classification; Transformer; Pattern recognition (psychology); Categorical variable; Supervised learning; Machine learning; Artificial neural network; Support vector machine","score_opus":0.021317886795965302,"score_gpt":0.2757775245749672,"score_spread":0.2544596377790019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312408638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022395637,0.0005905871,0.97284126,0.00015405379,0.000071730065,0.000047265174,0.00027030348,0.0015644921,0.0020645685],"genre_scores_gemma":[0.6283455,0.0008045045,0.36110356,0.00027467543,0.00022919019,0.00008942664,0.0014856972,0.00056532025,0.0071022366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976665,0.000042423584,0.000012766779,0.0000731403,0.000053541004,0.00005149803],"domain_scores_gemma":[0.9995782,0.00017531533,0.000030054076,0.000052035863,0.00012703864,0.000037445443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050262624,0.00091966236,0.0011484491,0.0011108217,0.00036371956,0.0010958122,0.0010726266,0.0010105112,0.0022183603],"category_scores_gemma":[0.0010382372,0.00048071152,0.0011203496,0.0010086318,0.00038234403,0.0011126668,0.0010890056,0.00089644204,0.0011678665],"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.0007508915,0.00018506816,0.0017304783,0.00022423979,0.00018137338,0.00034245776,0.0001260316,0.11468092,0.07152059,0.007553687,0.008643401,0.7940608],"study_design_scores_gemma":[0.000008540181,0.00005464139,0.0004556805,0.000009982094,0.00003879084,0.000119298835,0.000019554187,0.98536193,0.0085736355,0.0044746115,0.0008736663,0.000009643528],"about_ca_topic_score_codex":0.0036941795,"about_ca_topic_score_gemma":0.006377757,"teacher_disagreement_score":0.0036941795,"about_ca_system_score_codex":0.00040716786,"about_ca_system_score_gemma":0.0008084317,"threshold_uncertainty_score":0.0074211955},"labels":[],"label_agreement":null},{"id":"W4312419729","doi":"10.1007/978-3-031-20212-4_24","title":"A Reusable Methodology for Player Clustering Using Wasserstein Autoencoders","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Western University","funders":"","keywords":"Autoencoder; Cluster analysis; Computer science; Artificial intelligence; Machine learning; Data mining; Deep learning","score_opus":0.08386138389997486,"score_gpt":0.31017521132604137,"score_spread":0.2263138274260665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312419729","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.00021569348,0.000017930995,0.9982022,0.000008171001,0.000011757763,0.000021436414,0.00003659402,0.001269477,0.00021658851],"genre_scores_gemma":[0.01575973,0.00008426369,0.9784545,0.000037418646,0.00003179067,0.00012966296,0.0005882694,0.0009550831,0.003959351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985812,0.00021680116,0.0001062912,0.0005056551,0.00048858713,0.000101492566],"domain_scores_gemma":[0.99851805,0.00032652114,0.00007454912,0.00053286465,0.00048739047,0.00006055947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715502,0.0016742558,0.0013036137,0.0019453948,0.0010540637,0.00202731,0.003730329,0.0016466265,0.009197874],"category_scores_gemma":[0.004597367,0.0012573058,0.0018558662,0.0018150399,0.0008095006,0.0028153586,0.0031323112,0.002490508,0.007174582],"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.000092188944,0.0001373598,0.0006480518,0.00017890919,0.00023435631,0.00012882882,0.00018887712,0.10558829,0.019297505,0.040951047,0.010134345,0.8224203],"study_design_scores_gemma":[0.000018659557,0.00003718857,0.00032570586,0.00003183523,0.00004248591,0.00011929384,0.00005663629,0.9294959,0.014740675,0.04328748,0.011809315,0.00003497196],"about_ca_topic_score_codex":0.0075034187,"about_ca_topic_score_gemma":0.016713908,"teacher_disagreement_score":0.009197874,"about_ca_system_score_codex":0.0009814692,"about_ca_system_score_gemma":0.0014143283,"threshold_uncertainty_score":0.030769885},"labels":[],"label_agreement":null},{"id":"W4312420260","doi":"10.1007/978-3-031-20980-2_17","title":"Multiresolution Decomposition Analysis via Wavelet Transforms for Audio Deepfake Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Spectrogram; Artificial intelligence; Wavelet transform; Set (abstract data type); Wavelet; Pattern recognition (psychology); Decomposition; Biometrics; Spoofing attack; Speech recognition; Discrete wavelet transform; Face (sociological concept); Multiresolution analysis; Computer security","score_opus":0.0160326319823349,"score_gpt":0.27701136370377716,"score_spread":0.26097873172144226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312420260","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.0075486377,0.0007049869,0.9893462,0.0000829175,0.000060726717,0.000019021347,0.00011863934,0.0005057766,0.0016131819],"genre_scores_gemma":[0.13740641,0.0023397168,0.8436524,0.00012594105,0.00013363897,0.000055147113,0.0006619077,0.0003151679,0.015309713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985015,0.000014600205,0.000007752778,0.000028005872,0.00007790337,0.000021461874],"domain_scores_gemma":[0.99981123,0.00006114065,0.000020621292,0.00003495644,0.00006112871,0.000010885347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023700783,0.00071745145,0.00053937733,0.00090931496,0.00018937838,0.0008036795,0.00046197983,0.0006276213,0.004666108],"category_scores_gemma":[0.00069185765,0.00028251554,0.0006305868,0.0008323316,0.00025631124,0.0009206395,0.00067790423,0.0008466185,0.0023683715],"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.00010704919,0.000051571216,0.00031214757,0.00015815234,0.00003383607,0.0001035674,0.000038442526,0.013527119,0.1853332,0.007020538,0.0036690303,0.7896454],"study_design_scores_gemma":[0.000014506714,0.00013511437,0.0025502832,0.00007077607,0.00007147758,0.0005836059,0.0000716579,0.8159962,0.1451427,0.017044554,0.018278288,0.000040844632],"about_ca_topic_score_codex":0.00064517686,"about_ca_topic_score_gemma":0.0013492184,"teacher_disagreement_score":0.004666108,"about_ca_system_score_codex":0.0001820103,"about_ca_system_score_gemma":0.00024031269,"threshold_uncertainty_score":0.015609741},"labels":[],"label_agreement":null},{"id":"W4312423502","doi":"10.1007/978-3-031-17849-8_19","title":"Similarity-Based Unsupervised Evaluation of Outlier Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Outlier; Cluster analysis; Anomaly detection; Similarity (geometry); Data mining; Index (typography); Artificial intelligence; Similarity measure; Unsupervised learning; Measure (data warehouse); Pattern recognition (psychology); Machine learning; Image (mathematics)","score_opus":0.03191990121459354,"score_gpt":0.27670299434741524,"score_spread":0.2447830931328217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312423502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1940559,0.00087239826,0.7958531,0.00010527042,0.00015344942,0.00017097898,0.00056730426,0.0045289197,0.0036926162],"genre_scores_gemma":[0.74413717,0.00023287095,0.24821827,0.0000507711,0.0000926361,0.00010231777,0.002608561,0.0003997436,0.0041576237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995572,0.0008138521,0.0003023027,0.0006891381,0.0022986587,0.0003241497],"domain_scores_gemma":[0.9923006,0.002215238,0.00072243565,0.00087374216,0.0036426622,0.00024525548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025981155,0.00094290206,0.0017415597,0.0033544367,0.0005963163,0.0018711702,0.001864036,0.0011371786,0.0020534543],"category_scores_gemma":[0.008869285,0.00025049035,0.00068551133,0.0029680734,0.0005638435,0.0016989326,0.0015181986,0.0006779504,0.0012909509],"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.0016363012,0.00054946705,0.015104554,0.00029368195,0.0003433213,0.00019457971,0.0001452696,0.06543631,0.071694545,0.0035151744,0.005733463,0.8353533],"study_design_scores_gemma":[0.000028025355,0.00043781791,0.0071569695,0.000015934229,0.00007131881,0.00038020036,0.00008645904,0.94413465,0.04389142,0.002168525,0.0015924,0.000036319285],"about_ca_topic_score_codex":0.0023020126,"about_ca_topic_score_gemma":0.0032536106,"teacher_disagreement_score":0.0033544367,"about_ca_system_score_codex":0.00080238056,"about_ca_system_score_gemma":0.000838891,"threshold_uncertainty_score":0.013740361},"labels":[],"label_agreement":null},{"id":"W4312433134","doi":"10.1007/978-3-031-23690-7_11","title":"Mining Attribute-Based Access Control Policies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Queen's University","funders":"","keywords":"Computer science; Access control; Flexibility (engineering); Authorization; Data mining; Feature (linguistics); Role-based access control; Distributed computing; Database; Computer security","score_opus":0.03437500449972777,"score_gpt":0.3107837615035622,"score_spread":0.27640875700383444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312433134","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.21006007,0.0020255938,0.77682436,0.0009768498,0.00016273442,0.00032149727,0.0031036967,0.0032329115,0.003292168],"genre_scores_gemma":[0.6985489,0.0012023317,0.29012358,0.00014157659,0.000121789686,0.00018210201,0.006937323,0.00016321837,0.0025791742],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967632,0.00062282244,0.00040469161,0.0007067094,0.0012234144,0.00027907203],"domain_scores_gemma":[0.9907872,0.0059008594,0.00078951457,0.0014310756,0.000865088,0.00022622442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023752463,0.0008166229,0.0011538981,0.0037742907,0.0007865307,0.0029201673,0.0016659494,0.0010756181,0.0013122532],"category_scores_gemma":[0.013602999,0.0006077593,0.0017713399,0.0037349942,0.0006775825,0.0048118783,0.0011007116,0.0016724223,0.0006591458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005818783,0.001060896,0.057869248,0.0006749912,0.00044565674,0.0006533246,0.0005312314,0.15650666,0.013095018,0.0449526,0.011986491,0.71164197],"study_design_scores_gemma":[0.000021842443,0.00009112604,0.0037926065,0.000081767634,0.00009158265,0.0004219889,0.00026165342,0.9056742,0.009331756,0.07642476,0.0037760935,0.000030644736],"about_ca_topic_score_codex":0.0028954465,"about_ca_topic_score_gemma":0.0032551545,"teacher_disagreement_score":0.0037742907,"about_ca_system_score_codex":0.0011546934,"about_ca_system_score_gemma":0.0020320504,"threshold_uncertainty_score":0.012561619},"labels":[],"label_agreement":null},{"id":"W4312454814","doi":"10.1007/978-3-031-22061-6_5","title":"Unsupervised Face Frontalization GAN Driven by 3D Rotation and Symmetric Filling","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Face (sociological concept); Artificial intelligence; Generative grammar; Rotation (mathematics); Artificial neural network; Generative adversarial network; Unsupervised learning; Current (fluid); Texture (cosmology); Pattern recognition (psychology); Deep learning; Machine learning; Computer vision; Image (mathematics)","score_opus":0.01277776503699986,"score_gpt":0.22223022075542104,"score_spread":0.20945245571842117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312454814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01432342,0.00040335787,0.97840685,0.00015180692,0.00014546844,0.00007214869,0.0005098639,0.0025834963,0.0034035903],"genre_scores_gemma":[0.4316483,0.000988446,0.5375562,0.0008127796,0.0002486822,0.00026306798,0.0046066227,0.0012304788,0.022645418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.000041572737,0.0000064815486,0.000082873274,0.00007442341,0.000052845317],"domain_scores_gemma":[0.9997862,0.000059227565,0.000013926922,0.000062721774,0.00005843335,0.00001952222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039806715,0.001035078,0.0010085534,0.00043693394,0.00021410384,0.0005447322,0.0010817354,0.00067760964,0.0051268605],"category_scores_gemma":[0.0006446704,0.0005398842,0.0010249009,0.0005012137,0.0004442751,0.00047461333,0.0009594283,0.0011293407,0.0024948486],"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.00039002937,0.00017152708,0.0013350985,0.00014879866,0.00014756441,0.00014428444,0.00008162582,0.25030133,0.07335655,0.008701404,0.02974047,0.63548136],"study_design_scores_gemma":[0.000009622395,0.000041602518,0.00044127554,0.0000087298895,0.000015623425,0.000107979744,0.000011459725,0.98580337,0.0085416855,0.0023051316,0.0027044464,0.000009114906],"about_ca_topic_score_codex":0.0050040837,"about_ca_topic_score_gemma":0.011124385,"teacher_disagreement_score":0.0051268605,"about_ca_system_score_codex":0.00041304476,"about_ca_system_score_gemma":0.00069041416,"threshold_uncertainty_score":0.017151058},"labels":[],"label_agreement":null},{"id":"W4312458399","doi":"10.1007/978-3-031-20077-9_28","title":"Exploring Resolution and Degradation Clues as Self-supervised Signal for Low Quality Object Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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 British Columbia","funders":"","keywords":"Computer science; Upsampling; Artificial intelligence; Object detection; Degradation (telecommunications); Transformation (genetics); Code (set theory); Computer vision; Pattern recognition (psychology); Representation (politics); Object (grammar); Image (mathematics)","score_opus":0.062232106857731215,"score_gpt":0.2976619037486506,"score_spread":0.23542979689091936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312458399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23419105,0.001307945,0.759834,0.00021582472,0.000073375435,0.00005085535,0.00022077459,0.001003507,0.0031027514],"genre_scores_gemma":[0.7337655,0.0011948134,0.25805897,0.00013556819,0.00012206067,0.000030012521,0.0006163754,0.00032057712,0.005756236],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998338,0.000025446845,0.000006663018,0.000041470554,0.00006558914,0.000026957729],"domain_scores_gemma":[0.99955314,0.00017582261,0.00006413852,0.00005691719,0.00011283509,0.000037188915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004253527,0.0005172599,0.00048566452,0.0008802158,0.00017006592,0.00072184205,0.0004546404,0.00064189767,0.0015223447],"category_scores_gemma":[0.0011549185,0.00022598293,0.0003811022,0.00059062114,0.00032232094,0.0007936372,0.00054571935,0.0006145601,0.00076157687],"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.0006161185,0.00015416606,0.0026245096,0.00027416527,0.00007078263,0.00026338597,0.00015633718,0.028839925,0.51519495,0.0020772216,0.0019604792,0.44776794],"study_design_scores_gemma":[0.000015069406,0.00024827925,0.009690957,0.00003566474,0.00008446487,0.0006652426,0.00008854662,0.8485145,0.1339276,0.003795832,0.0029002908,0.000033477194],"about_ca_topic_score_codex":0.00044211413,"about_ca_topic_score_gemma":0.0008295928,"teacher_disagreement_score":0.0015223447,"about_ca_system_score_codex":0.00016215137,"about_ca_system_score_gemma":0.00017250114,"threshold_uncertainty_score":0.0050926805},"labels":[],"label_agreement":null},{"id":"W4312461425","doi":"10.1007/978-3-031-19745-1_8","title":"Comparison Between Two Sigma-Lognormal Extractors with Primary Schools Students Handwriting","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Motor Control and Adaptation","field":"Neuroscience","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":"Polytechnique Montréal","funders":"","keywords":"Smoothing; Handwriting; Sigma; Log-normal distribution; Extractor; Trajectory; Computer science; Algorithm; Statistics; Mathematics; Pattern recognition (psychology); Artificial intelligence; Physics","score_opus":0.03636837672800633,"score_gpt":0.2978125270912596,"score_spread":0.2614441503632533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312461425","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.9857325,0.00058108615,0.00913063,0.000059824077,0.000058964306,0.00004612286,0.00034414083,0.00020433887,0.0038422747],"genre_scores_gemma":[0.9896374,0.00034208072,0.0031357089,0.000022922068,0.000022029939,0.000016953089,0.00047319554,0.0000579262,0.0062916507],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999132,0.00018360851,0.00011032245,0.00019835554,0.00025138346,0.00012437764],"domain_scores_gemma":[0.993119,0.0040576807,0.00022834401,0.00044072195,0.0018044224,0.00034991087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015510139,0.0005620525,0.00052187504,0.0010705991,0.00041758997,0.0013155595,0.0004984546,0.0008959557,0.009092179],"category_scores_gemma":[0.0061571486,0.00022655012,0.0006162616,0.00070608454,0.00037198656,0.0013167496,0.0007497861,0.00034327497,0.0024229921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02188826,0.0010363505,0.17580396,0.00069050444,0.00048561557,0.001598249,0.002314139,0.005662522,0.043538254,0.00048007336,0.0017465173,0.74475557],"study_design_scores_gemma":[0.0003174662,0.006231971,0.89727473,0.00015016922,0.00090535573,0.002683102,0.0051377765,0.036615565,0.046493206,0.00091807416,0.0031739525,0.00009871667],"about_ca_topic_score_codex":0.0058526928,"about_ca_topic_score_gemma":0.006581025,"teacher_disagreement_score":0.009092179,"about_ca_system_score_codex":0.00037391574,"about_ca_system_score_gemma":0.00072929275,"threshold_uncertainty_score":0.03041637},"labels":[],"label_agreement":null},{"id":"W4312472471","doi":"10.1007/978-3-031-20980-2_25","title":"Multi-label Dysfluency Classification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Voice and Speech Disorders","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Classifier (UML); Stuttering; Computer science; Representation (politics); Feature (linguistics); Artificial intelligence; Machine learning; Population; Speech recognition; Pattern recognition (psychology); Psychology; Linguistics","score_opus":0.04516143162808707,"score_gpt":0.3006845982398994,"score_spread":0.25552316661181235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312472471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120524496,0.020552127,0.7626103,0.0027758663,0.0052593863,0.00060595176,0.02135227,0.010918393,0.055401236],"genre_scores_gemma":[0.52121395,0.004378031,0.324631,0.000966871,0.0022354429,0.00053152884,0.04389138,0.0010509657,0.10110087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885714,0.0001697723,0.000115823685,0.00030127566,0.0003692859,0.00018665945],"domain_scores_gemma":[0.99816626,0.00087503344,0.00011388353,0.00026246908,0.0004908345,0.00009160717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015771564,0.0013734611,0.0010854112,0.003263135,0.0009152727,0.0018722053,0.0016420713,0.0015892863,0.009449591],"category_scores_gemma":[0.0022184015,0.00023374571,0.0014286668,0.0018257145,0.00038815028,0.0016067505,0.0015341282,0.0013056664,0.006375512],"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.00018992499,0.00016088977,0.0037489366,0.00025414533,0.000109447246,0.00020277056,0.000067020046,0.0051448136,0.009646825,0.0013153036,0.04866877,0.9304912],"study_design_scores_gemma":[0.000055611847,0.00055298425,0.024611609,0.00066094607,0.00047842195,0.0026154665,0.0008466361,0.7892146,0.054230515,0.03745531,0.08906826,0.00020972268],"about_ca_topic_score_codex":0.0032735956,"about_ca_topic_score_gemma":0.006227147,"teacher_disagreement_score":0.009449591,"about_ca_system_score_codex":0.0005907307,"about_ca_system_score_gemma":0.0006987046,"threshold_uncertainty_score":0.03161204},"labels":[],"label_agreement":null},{"id":"W4312503114","doi":"10.1007/978-3-031-20713-6_17","title":"A New Approach to Visual Classification Using Concatenated Deep Learning for Multimode Fusion of EEG and Image Data","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Lakehead University","funders":"","keywords":"Artificial intelligence; Computer science; Multi-mode optical fiber; Fusion; Image (mathematics); Image fusion; Electroencephalography; Pattern recognition (psychology); Computer vision; Psychology; Neuroscience; Telecommunications; Linguistics; Optical fiber; Philosophy","score_opus":0.09126671790898412,"score_gpt":0.33325763384690377,"score_spread":0.24199091593791966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312503114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053914567,0.0005063945,0.99183136,0.0001442894,0.00011208093,0.000030539468,0.00010764131,0.000706266,0.0011700332],"genre_scores_gemma":[0.14358926,0.0007984605,0.84361076,0.00029183654,0.00023083287,0.00010157949,0.00056740356,0.00019185066,0.0106181195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.00004869644,0.000024124747,0.000100256984,0.00011348108,0.00005260151],"domain_scores_gemma":[0.9996233,0.000096360716,0.000032383752,0.00006807242,0.00014514707,0.00003464364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061156845,0.00089539203,0.00078651163,0.00096891157,0.00039616314,0.0013515693,0.0014193903,0.0010149151,0.0034794537],"category_scores_gemma":[0.0010085044,0.00041609406,0.0012007819,0.0012987865,0.0004991376,0.0014509727,0.002028136,0.0015228739,0.0011768652],"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.00018385936,0.0001939395,0.0007064691,0.00013105357,0.00021884246,0.00008942056,0.00007950256,0.052139778,0.05693862,0.011993516,0.0054995925,0.8718254],"study_design_scores_gemma":[0.0000073573474,0.00006378677,0.00055350905,0.000015468317,0.000040951192,0.000087423046,0.000017596049,0.972982,0.013764401,0.009256082,0.0031947708,0.000016654456],"about_ca_topic_score_codex":0.0045030713,"about_ca_topic_score_gemma":0.008718037,"teacher_disagreement_score":0.0045030713,"about_ca_system_score_codex":0.0005526538,"about_ca_system_score_gemma":0.00070508296,"threshold_uncertainty_score":0.011639953},"labels":[],"label_agreement":null},{"id":"W4312507510","doi":"10.1007/978-3-031-20837-9_6","title":"Improving Bacterial sRNA Identification By Combining Genomic Context and Sequence-Derived Features","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Memorial University of Newfoundland","funders":"","keywords":"Transfer RNA; Computer science; Computational biology; Sequence (biology); Context (archaeology); Phylogenetic tree; Genetics; Biology; RNA; Gene","score_opus":0.011668153615213112,"score_gpt":0.2238711622254824,"score_spread":0.21220300861026928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312507510","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.27915084,0.0073441057,0.69533473,0.00037309076,0.00035509627,0.00011507297,0.0021657222,0.007481193,0.0076800818],"genre_scores_gemma":[0.2631868,0.0023652716,0.72488326,0.00028150226,0.00015135838,0.00007531843,0.0046489956,0.0007822088,0.0036252313],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972004,0.000034799916,0.000017205173,0.00011439916,0.00009114792,0.000022391509],"domain_scores_gemma":[0.999551,0.0002395215,0.000042835898,0.000055754906,0.00008835233,0.000022664522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046672366,0.0007021717,0.00078990025,0.000655862,0.00018836376,0.0009817497,0.0005240808,0.00055185234,0.0022813373],"category_scores_gemma":[0.0013295846,0.00036819332,0.0006391031,0.0008002399,0.0001904008,0.00093648897,0.0008812341,0.0006771942,0.0030975933],"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.00015094096,0.000041032607,0.0013960317,0.00025403837,0.000026888036,0.000055896224,0.000018552524,0.0024379718,0.83976954,0.00030722495,0.0006469051,0.1548949],"study_design_scores_gemma":[0.000049031885,0.00047341155,0.0099669015,0.000108899396,0.0002831915,0.0011311037,0.000121587575,0.12138685,0.84162664,0.0052061514,0.019556463,0.00008969171],"about_ca_topic_score_codex":0.00028195878,"about_ca_topic_score_gemma":0.0010048676,"teacher_disagreement_score":0.0022813373,"about_ca_system_score_codex":0.00011818204,"about_ca_system_score_gemma":0.0002211124,"threshold_uncertainty_score":0.0076318383},"labels":[],"label_agreement":null},{"id":"W4312527591","doi":"10.1007/978-3-031-19745-1_12","title":"Measuring the Big Five Factors from Handwriting Using Ensemble Learning Model AvgMlSC","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Handwriting; Artificial intelligence","score_opus":0.05032433373247846,"score_gpt":0.26457773012523367,"score_spread":0.2142533963927552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312527591","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.74539477,0.0015746969,0.24175145,0.0002777963,0.00022612436,0.00013255098,0.0024219428,0.0019388638,0.006281811],"genre_scores_gemma":[0.9485562,0.00028335507,0.04510999,0.000041484735,0.000050341885,0.00008030553,0.0024510496,0.00007439552,0.003352783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998987,0.00018357733,0.00008791562,0.00027524628,0.000348668,0.00011761449],"domain_scores_gemma":[0.9962566,0.0015151359,0.0003048838,0.00035821152,0.0013807341,0.00018440468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014402124,0.0010777515,0.000697771,0.002985651,0.00057073985,0.0015462134,0.0005035743,0.0006869186,0.0022757591],"category_scores_gemma":[0.005037203,0.00019383668,0.00090022234,0.0022795561,0.0002793723,0.0013192168,0.0007564415,0.0006684813,0.0012203994],"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.0008257008,0.00037042948,0.1773362,0.00022691298,0.00064520683,0.00024461336,0.0004152039,0.04806749,0.01891144,0.0007286604,0.006712881,0.7455153],"study_design_scores_gemma":[0.000016804623,0.00052175246,0.19050853,0.00007717722,0.00033729142,0.00028554662,0.00046762248,0.7871368,0.015786896,0.0020613316,0.0026946065,0.00010570707],"about_ca_topic_score_codex":0.0062294137,"about_ca_topic_score_gemma":0.00871015,"teacher_disagreement_score":0.0062294137,"about_ca_system_score_codex":0.00040958132,"about_ca_system_score_gemma":0.00057367346,"threshold_uncertainty_score":0.012386262},"labels":[],"label_agreement":null},{"id":"W4312532973","doi":"10.1007/978-3-031-22050-0_6","title":"Triangle Evacuation of 2 Agents in the Wireless Model","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Toronto Metropolitan University","funders":"","keywords":"Equilateral triangle; Combinatorics; Perimeter; Mathematics; Point (geometry); Infimum and supremum; Enhanced Data Rates for GSM Evolution; Square (algebra); Unit square; Incircle and excircles of a triangle; Upper and lower bounds; Computer science; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.05684704296843068,"score_gpt":0.2945540914198583,"score_spread":0.2377070484514276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312532973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15173231,0.0015983233,0.659411,0.0068932427,0.0011227129,0.0002746508,0.0012327508,0.00035532998,0.1773797],"genre_scores_gemma":[0.8180491,0.0016115408,0.04561174,0.0008114397,0.0003673023,0.0003563897,0.00061726524,0.00024390077,0.13233136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949646,0.00016745421,0.000019039406,0.00008744189,0.00008057499,0.00014900646],"domain_scores_gemma":[0.9988446,0.0005892331,0.00013689611,0.000086277076,0.00010069895,0.00024214755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354086,0.0009368641,0.0014988348,0.0007091522,0.0014610529,0.0019756518,0.0030527185,0.0037470045,0.013900307],"category_scores_gemma":[0.003622711,0.00078360416,0.0012725015,0.0011639295,0.0017598011,0.003195905,0.0028568914,0.0025767537,0.001517911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018614314,0.000051183608,0.00027757953,0.00011680834,0.00003189859,0.0004457122,0.00021947398,0.5756178,0.0007429065,0.41001537,0.006958027,0.0053370288],"study_design_scores_gemma":[0.00007139523,0.000044504028,0.00008961145,0.000018156377,0.00001526889,0.000102580256,0.00014751988,0.8577788,0.0001520657,0.13717394,0.0043856865,0.000020506308],"about_ca_topic_score_codex":0.012105072,"about_ca_topic_score_gemma":0.006921315,"teacher_disagreement_score":0.013900307,"about_ca_system_score_codex":0.0014356942,"about_ca_system_score_gemma":0.0010034967,"threshold_uncertainty_score":0.04650116},"labels":[],"label_agreement":null},{"id":"W4312548704","doi":"10.1007/978-3-031-17436-0_3","title":"Recycling Memory in Recoverable Mutex Locks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semaphore; Computer science; Mutual exclusion; Dram; Memory hierarchy; Cache; Correctness; Distributed computing; Focus (optics); Synchronization (alternating current); Context (archaeology); Parallel computing; State (computer science); Memory management; Context switch; Embedded system; Operating system; Computer network; Algorithm; Computer hardware","score_opus":0.017373553250823105,"score_gpt":0.2502129989184866,"score_spread":0.23283944566766349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312548704","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.24666026,0.005746476,0.67157376,0.0013476323,0.001091145,0.00017311417,0.00021494372,0.004770102,0.06842249],"genre_scores_gemma":[0.90612745,0.0011517721,0.041650772,0.00027767583,0.00016491994,0.0001532305,0.00011798803,0.0008982131,0.04945806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.0002192126,0.00005983847,0.00013211722,0.00035680088,0.00029969268],"domain_scores_gemma":[0.9970187,0.0013049296,0.00019555498,0.0012225709,0.0001800309,0.00007819541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012241727,0.00052270986,0.00090772094,0.00077268033,0.0011216888,0.0019377901,0.0020919552,0.0012890232,0.009145121],"category_scores_gemma":[0.007030425,0.0006047451,0.00057068083,0.0008629403,0.002354159,0.005138144,0.0031017796,0.002325499,0.0010998442],"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.00089992373,0.000110434754,0.0005087601,0.00033350507,0.000040021696,0.0004931961,0.00060174696,0.03508841,0.012630799,0.81521344,0.0064931274,0.12758674],"study_design_scores_gemma":[0.00009729819,0.00016027645,0.0003078149,0.00013052061,0.000060253347,0.00048084315,0.0002136947,0.1214308,0.03685691,0.8213719,0.018826794,0.000062801984],"about_ca_topic_score_codex":0.000409619,"about_ca_topic_score_gemma":0.00047512137,"teacher_disagreement_score":0.009145121,"about_ca_system_score_codex":0.0007651793,"about_ca_system_score_gemma":0.00068462075,"threshold_uncertainty_score":0.030593455},"labels":[],"label_agreement":null},{"id":"W4312619734","doi":"10.1007/978-3-031-20624-5_32","title":"On the Zombie Number of Various Graph Classes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University; University of Ottawa; Carleton University","funders":"","keywords":"Zombie; Combinatorics; Vertex (graph theory); Graph; Computer science; Upper and lower bounds; Time complexity; Mathematics; Computer security","score_opus":0.021685132845375713,"score_gpt":0.286610425871994,"score_spread":0.26492529302661827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312619734","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.5198414,0.011290417,0.09718852,0.009591624,0.0004965756,0.00017469695,0.0013487715,0.00089740084,0.35917056],"genre_scores_gemma":[0.9265299,0.0038917933,0.037708674,0.0007818024,0.0005537743,0.00036102507,0.0006658962,0.00049079844,0.029016398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.0002526297,0.00004112143,0.00025562543,0.00024254601,0.00019860796],"domain_scores_gemma":[0.9918704,0.0059546307,0.0005385106,0.00064716995,0.00037994832,0.0006094605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020055969,0.0006644628,0.0015353425,0.008869033,0.0046937144,0.0050670467,0.0025656011,0.0017410931,0.014100025],"category_scores_gemma":[0.013097428,0.0013056545,0.0009922046,0.0047283066,0.0056848447,0.010566744,0.003562866,0.005649929,0.00094965904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104435974,0.000015020855,0.00059290195,0.000095261305,0.000012458416,0.000023859158,0.00034205228,0.0013079701,0.00043385805,0.9839601,0.0033441046,0.009768005],"study_design_scores_gemma":[0.000028751614,0.0000132428995,0.0012685431,0.00008898281,0.000032786058,0.000106493295,0.00021752888,0.0067630284,0.0004493385,0.9843454,0.006665048,0.000020757097],"about_ca_topic_score_codex":0.003661739,"about_ca_topic_score_gemma":0.0050743166,"teacher_disagreement_score":0.014100025,"about_ca_system_score_codex":0.0027136959,"about_ca_system_score_gemma":0.000666251,"threshold_uncertainty_score":0.047169268},"labels":[],"label_agreement":null},{"id":"W4312619978","doi":"10.1007/978-3-031-20179-0_1","title":"TOPS: Transition-Based Volatility-Reduced Policy Search","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Reinforcement learning; Volatility (finance); Computer science; Sublinear function; Parameterized complexity; Mathematical optimization; Variance (accounting); Convergence (economics); Artificial intelligence; Algorithm; Econometrics; Mathematics; Economics","score_opus":0.02929723770295157,"score_gpt":0.24903976890753413,"score_spread":0.21974253120458256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312619978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015195344,0.0011589264,0.9665927,0.0008977311,0.0003710243,0.00012013147,0.0005256152,0.0039057634,0.011232673],"genre_scores_gemma":[0.63717896,0.0012064801,0.3357138,0.00086532277,0.0005887961,0.0004846525,0.0019792207,0.0021308002,0.019851888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897766,0.00052784354,0.000043356926,0.0001298417,0.00021451624,0.000106834],"domain_scores_gemma":[0.99676716,0.0024886793,0.00011980291,0.0002953909,0.00019177177,0.00013721803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022533487,0.00091078255,0.0024198086,0.0010355958,0.00059555774,0.002205244,0.0021867226,0.0020962919,0.0144824395],"category_scores_gemma":[0.011458692,0.0010703758,0.0011897332,0.0014342163,0.0011107541,0.0028032362,0.0032018134,0.002687271,0.0025840546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006622943,0.00016513297,0.00061784324,0.00030410252,0.00019374925,0.00012009658,0.00012137823,0.6194106,0.0011029477,0.16732998,0.031173604,0.17879835],"study_design_scores_gemma":[0.000033091743,0.000021738675,0.000045869565,0.000012061699,0.000008023415,0.000014834885,0.000007120768,0.9509311,0.00015668393,0.047733754,0.0010300382,0.000005704698],"about_ca_topic_score_codex":0.0033765065,"about_ca_topic_score_gemma":0.002642785,"teacher_disagreement_score":0.0144824395,"about_ca_system_score_codex":0.00092657586,"about_ca_system_score_gemma":0.0017437339,"threshold_uncertainty_score":0.048448563},"labels":[],"label_agreement":null},{"id":"W4312639024","doi":"10.1007/978-3-031-18523-6","title":"Distributed, Collaborative, and Federated Learning, and Affordable AI and Healthcare for Resource Diverse Global Health","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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 British Columbia","funders":"","keywords":"Computer science; Health care; Resource (disambiguation); Knowledge management; Data science; World Wide Web; Artificial intelligence; Computer network; Political science","score_opus":0.04256098403002908,"score_gpt":0.386908195838796,"score_spread":0.34434721180876693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312639024","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030078989,0.02414697,0.5761239,0.04742525,0.0029011597,0.00021161318,0.0005346683,0.0023376879,0.31623974],"genre_scores_gemma":[0.5789413,0.0155534865,0.25116155,0.00433499,0.0023301789,0.00027294172,0.001260922,0.00041237366,0.14573233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926335,0.00025094394,0.000026114612,0.000097622884,0.0002491756,0.00011278893],"domain_scores_gemma":[0.9988938,0.0005479685,0.000061341765,0.00022840929,0.000115190574,0.00015332422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018067652,0.00041394937,0.00040011128,0.0007483217,0.0007136338,0.003741652,0.001007261,0.0013249208,0.009622967],"category_scores_gemma":[0.0030886508,0.00023726354,0.00044283227,0.0013999749,0.0016874758,0.0062355716,0.004337291,0.0019802472,0.0014965286],"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.00014188897,0.00015698386,0.0013287689,0.0003033561,0.000085818974,0.00013974436,0.000593835,0.020842956,0.0022267338,0.33973595,0.10715449,0.52728945],"study_design_scores_gemma":[0.000038482856,0.00012768594,0.0024020246,0.00023708567,0.000042779877,0.00029163618,0.0011546278,0.04574617,0.0014765097,0.6984254,0.25002933,0.000028227492],"about_ca_topic_score_codex":0.0018781644,"about_ca_topic_score_gemma":0.0034933419,"teacher_disagreement_score":0.009622967,"about_ca_system_score_codex":0.001376817,"about_ca_system_score_gemma":0.0020998318,"threshold_uncertainty_score":0.03219199},"labels":[],"label_agreement":null},{"id":"W4312659106","doi":"10.1007/978-3-031-22061-6_3","title":"IARG: Improved Actor Relation Graph Based Group Activity Recognition","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Closed captioning; Artificial intelligence; Similarity (geometry); Visualization; Video tracking; Graph; Activity recognition; Convolutional neural network; Action recognition; Object (grammar); Machine learning; Human–computer interaction; Information retrieval; Natural language processing; Theoretical computer science; Image (mathematics)","score_opus":0.02354028716508048,"score_gpt":0.23487258662500568,"score_spread":0.2113322994599252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312659106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010609972,0.0004621975,0.95652866,0.00007771406,0.00015809624,0.00016117707,0.0014707725,0.027487773,0.003043682],"genre_scores_gemma":[0.12072742,0.0004213134,0.8562981,0.0002484858,0.00009565273,0.0003067486,0.0066075586,0.0014321049,0.013862611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994561,0.00007060219,0.000020067428,0.0001774719,0.00019800327,0.00007782226],"domain_scores_gemma":[0.9996662,0.000083309,0.00002590083,0.00010995529,0.00007844815,0.000036307367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102687,0.0014031235,0.0016153381,0.0016791862,0.0004101389,0.0007207852,0.002332882,0.0007833007,0.0105746435],"category_scores_gemma":[0.00071070733,0.0004179151,0.000909409,0.001581168,0.00031793345,0.0008234776,0.0013873032,0.0010252305,0.0069376524],"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.00034243474,0.00023637767,0.00072836946,0.00010968957,0.000101056845,0.00009715697,0.0000594562,0.016833697,0.033358186,0.0018625712,0.02035966,0.92591125],"study_design_scores_gemma":[0.00006635141,0.00020194557,0.0023227606,0.000026607608,0.00007039192,0.00026949772,0.000072480405,0.9424118,0.033781726,0.005077362,0.015654827,0.000044254353],"about_ca_topic_score_codex":0.010213826,"about_ca_topic_score_gemma":0.017684123,"teacher_disagreement_score":0.0105746435,"about_ca_system_score_codex":0.00041464646,"about_ca_system_score_gemma":0.00072288973,"threshold_uncertainty_score":0.035375714},"labels":[],"label_agreement":null},{"id":"W4312663631","doi":"10.1007/978-3-031-19762-8_14","title":"Model-Driven Engineering in Digital Thread Platforms: A Practical Use Case and Future Challenges","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"University of Galway; Science Foundation Ireland; European Commission; National University of Ireland","keywords":"Computer science; Interoperability; Software engineering; Model-driven architecture; Thread (computing); Orchestration; Context (archaeology); Software; Distributed computing; Software development; World Wide Web; Programming language","score_opus":0.05086537225321081,"score_gpt":0.2692703214509965,"score_spread":0.2184049491977857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312663631","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.13254121,0.0028748044,0.74580705,0.008368544,0.00039048394,0.00033429274,0.00021740275,0.0032923887,0.106173806],"genre_scores_gemma":[0.4799077,0.0023052807,0.475238,0.0005520145,0.000120446195,0.00026294834,0.00030530075,0.000849443,0.040458955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986507,0.0005500158,0.00006454725,0.0001093705,0.0005180987,0.000107310945],"domain_scores_gemma":[0.99840146,0.00089578895,0.00006057435,0.00035456874,0.00017408974,0.000113426664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594954,0.00047425786,0.00039345742,0.0005145025,0.0009954382,0.0040427037,0.0014928387,0.0022485466,0.00516323],"category_scores_gemma":[0.0032401648,0.00031671216,0.0005613065,0.00076334574,0.0014309393,0.0036464927,0.0024160142,0.0020648441,0.0011094746],"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.00014161826,0.0004622647,0.0018669927,0.0005107477,0.000029774252,0.0034164246,0.002581856,0.10670439,0.013786202,0.6831938,0.012865217,0.17444067],"study_design_scores_gemma":[0.000091299386,0.00020004812,0.00043692687,0.000387639,0.00003200872,0.0013784134,0.0008591482,0.39515814,0.017906008,0.24430732,0.3391729,0.000070185495],"about_ca_topic_score_codex":0.0021312635,"about_ca_topic_score_gemma":0.0021695597,"teacher_disagreement_score":0.00516323,"about_ca_system_score_codex":0.0013633384,"about_ca_system_score_gemma":0.0012552512,"threshold_uncertainty_score":0.01727271},"labels":[],"label_agreement":null},{"id":"W4312671093","doi":"10.1007/978-3-031-20176-9_22","title":"An Extension of the iMOACO$$\\mathbb {_R}$$ Algorithm Based on Layer-Set Selection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Brandon University","funders":"","keywords":"Selection (genetic algorithm); Fitness proportionate selection; Extension (predicate logic); Rank (graph theory); Layer (electronics); Benchmark (surveying); Algorithm; Reduction (mathematics); Set (abstract data type); Computer science; Mechanism (biology); Ant colony optimization algorithms; Mathematics; Probabilistic logic; Combinatorics; Mathematical optimization; Artificial intelligence; Fitness function; Geography; Physics","score_opus":0.02784172113464203,"score_gpt":0.28892666405086365,"score_spread":0.26108494291622164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312671093","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.007085684,0.0003167717,0.97465026,0.0002320338,0.00043125552,0.00016246035,0.00013559114,0.0017987018,0.015187225],"genre_scores_gemma":[0.0720166,0.0002442704,0.9099126,0.00027743948,0.00015913574,0.0003367885,0.0003403478,0.0005122606,0.016200513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994905,0.000110375506,0.000024067944,0.00010469455,0.00019236561,0.000077863544],"domain_scores_gemma":[0.99962175,0.00013513326,0.000023012704,0.00007960646,0.00010155183,0.000039008453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447616,0.0011293541,0.0012176093,0.0010698915,0.00079928385,0.001235725,0.0026927101,0.0011174893,0.0153795155],"category_scores_gemma":[0.0016207641,0.00043195073,0.0010172171,0.0010419397,0.0005114636,0.001108244,0.001968048,0.0014819687,0.0027261635],"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.00038153966,0.0003622902,0.000700606,0.00022365373,0.00014037652,0.00013893083,0.00008866322,0.14047256,0.009281553,0.048051484,0.021585973,0.77857226],"study_design_scores_gemma":[0.000083048064,0.00008433818,0.00026088243,0.00002346259,0.00004129075,0.000107381,0.000023663166,0.97277945,0.002975206,0.012290177,0.011310705,0.00002031994],"about_ca_topic_score_codex":0.004940092,"about_ca_topic_score_gemma":0.0079350695,"teacher_disagreement_score":0.0153795155,"about_ca_system_score_codex":0.00074829604,"about_ca_system_score_gemma":0.0017259158,"threshold_uncertainty_score":0.051449597},"labels":[],"label_agreement":null},{"id":"W4312671856","doi":"10.1007/978-3-031-19745-1_9","title":"Effects of a Graphomotor Intervention on the Graphic Skills of Children: An Analysis with the Sigma-Lognormal Model","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Writing and Handwriting Education","field":"Social Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Handwriting; Intervention (counseling); Psychology; Session (web analytics); Motor skill; Developmental psychology; Computer science; Artificial intelligence","score_opus":0.007736237943217089,"score_gpt":0.25599341638129675,"score_spread":0.24825717843807965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312671856","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.9910018,0.00043903044,0.0067514926,0.00006495218,0.000030720268,0.00011539657,0.00026572123,0.00006821149,0.0012627289],"genre_scores_gemma":[0.99644595,0.00021451364,0.002017924,0.000021509632,0.000009317807,0.00013044418,0.00018561758,0.000021347923,0.000953334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.995789,0.0030967256,0.00013061242,0.0002956898,0.00027906342,0.00040891633],"domain_scores_gemma":[0.9487989,0.048465144,0.00076436537,0.0011177743,0.00044872673,0.0004051081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069357837,0.0007327006,0.0016902512,0.00090484065,0.0002728475,0.0005820692,0.0010222937,0.0010463892,0.008077454],"category_scores_gemma":[0.0150664365,0.000303337,0.003467542,0.0007874701,0.0010201305,0.00060294574,0.00088242564,0.0014519299,0.00038011765],"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.22217189,0.03044065,0.12061211,0.0023449112,0.008779022,0.0013202875,0.0022205038,0.33327547,0.009860937,0.010357231,0.0025118447,0.2561052],"study_design_scores_gemma":[0.0058922935,0.10764215,0.28442538,0.00030379472,0.010156484,0.00042188668,0.0027278005,0.5701351,0.007196159,0.008764342,0.0021421872,0.0001924204],"about_ca_topic_score_codex":0.01178286,"about_ca_topic_score_gemma":0.004928498,"teacher_disagreement_score":0.01178286,"about_ca_system_score_codex":0.0010094426,"about_ca_system_score_gemma":0.0016434987,"threshold_uncertainty_score":0.0366804},"labels":[],"label_agreement":null},{"id":"W4312680444","doi":"10.1007/978-3-031-20050-2_41","title":"AdaBest: Minimizing Client Drift in Federated Learning via Adaptive Bias Estimation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","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":"Concordia University; Dalhousie University","funders":"CHIST-ERA; Research Nova Scotia; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Concept drift; Variance (accounting); Stability (learning theory); Bandwidth (computing); Federated learning; Norm (philosophy); Trust region; Adaptive learning; Data mining; Artificial intelligence; Algorithm; Machine learning; Computer network; Data stream mining","score_opus":0.04055409203057733,"score_gpt":0.26572068640197033,"score_spread":0.225166594371393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312680444","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.01029479,0.00044896334,0.9847381,0.0002106964,0.00008862468,0.00003563132,0.0000719144,0.0034011502,0.0007100056],"genre_scores_gemma":[0.36199972,0.00032390744,0.62566054,0.00043715016,0.0001620064,0.00021103356,0.00042720383,0.00084009394,0.009938391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976325,0.00073745067,0.000119902346,0.00054702297,0.00069620955,0.0002669354],"domain_scores_gemma":[0.9964226,0.0017411816,0.00020820946,0.0008540659,0.00061311835,0.00016079194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043963064,0.0011962303,0.0023819131,0.00070735574,0.00089327415,0.0019225166,0.0031774426,0.0028282607,0.0033650466],"category_scores_gemma":[0.012385429,0.0009794576,0.000923709,0.0012261414,0.0012489038,0.0033910966,0.003123911,0.0037498805,0.0019668872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007621948,0.00030492546,0.0019809604,0.00011131197,0.00013245945,0.000114472954,0.00014870547,0.5308654,0.004269124,0.012808588,0.011005619,0.43749627],"study_design_scores_gemma":[0.000019366149,0.000026563603,0.000086347245,0.00000770904,0.000008728167,0.000030644638,0.000007843961,0.99050224,0.0016049203,0.0071591893,0.000539739,0.00000674786],"about_ca_topic_score_codex":0.004490908,"about_ca_topic_score_gemma":0.004495628,"teacher_disagreement_score":0.004490908,"about_ca_system_score_codex":0.0015003205,"about_ca_system_score_gemma":0.002232793,"threshold_uncertainty_score":0.023250163},"labels":[],"label_agreement":null},{"id":"W4312694060","doi":"10.1007/978-3-031-22061-6_4","title":"SPGNet: Spatial Projection Guided 3D Human Pose Estimation in Low Dimensional Space","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pose; 3D pose estimation; Artificial intelligence; Projection (relational algebra); Computer science; Constraint (computer-aided design); Computer vision; Ground truth; Articulated body pose estimation; Kinematics; Key (lock); Pattern recognition (psychology); Mathematics; Algorithm; Geometry; Physics","score_opus":0.019584413263197396,"score_gpt":0.2656353076261911,"score_spread":0.24605089436299368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312694060","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.0045327377,0.00038211962,0.97928065,0.00006987132,0.00020864536,0.00009616922,0.00071102614,0.012860288,0.0018584897],"genre_scores_gemma":[0.071841545,0.00066224195,0.9088031,0.0002876959,0.0001111864,0.00028157816,0.004153001,0.0017940955,0.012065465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.00007618209,0.000016568434,0.00015406165,0.0003109603,0.00006227735],"domain_scores_gemma":[0.99966514,0.00011294571,0.000018892122,0.00009271904,0.000082840364,0.00002744429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044002893,0.0018637113,0.0021078887,0.00094506016,0.00042478176,0.0012870566,0.002399115,0.0014806794,0.009202646],"category_scores_gemma":[0.0010820637,0.0008649201,0.0011204024,0.0013402981,0.00056281476,0.0010675163,0.0026170935,0.0013875662,0.006202409],"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.0004333618,0.00015072375,0.00071792124,0.00017960992,0.0001614435,0.0002316001,0.0001051473,0.07441768,0.02603382,0.0031115653,0.049007233,0.8454499],"study_design_scores_gemma":[0.00003179125,0.0000934207,0.00083388336,0.000027295933,0.000024584138,0.00036287555,0.000043108263,0.9674178,0.01463966,0.00429212,0.012197983,0.00003550672],"about_ca_topic_score_codex":0.009006947,"about_ca_topic_score_gemma":0.015882352,"teacher_disagreement_score":0.009202646,"about_ca_system_score_codex":0.0003618532,"about_ca_system_score_gemma":0.00090739486,"threshold_uncertainty_score":0.030785978},"labels":[],"label_agreement":null},{"id":"W4312720629","doi":"10.1007/978-3-031-17531-2_4","title":"Relabeling Metabolic Pathway Data with Groups to Improve Prediction Outcomes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Microbial Metabolic Engineering and Bioproduction","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 British Columbia","funders":"","keywords":"Computer science; Scalability; Inference; Metabolic pathway; Set (abstract data type); Clinical pathway; Artificial intelligence; Computational biology; Biology; Genetics; Gene; Engineering","score_opus":0.010224982603588135,"score_gpt":0.21990310457696832,"score_spread":0.20967812197338018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312720629","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.20078965,0.0024957724,0.7382878,0.0012421637,0.0011586407,0.00038449292,0.022294544,0.02663886,0.006708046],"genre_scores_gemma":[0.45112565,0.000850334,0.46815035,0.0005951281,0.00040062057,0.00029812974,0.06880973,0.0014614051,0.008308702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895453,0.00021872169,0.00006481922,0.00040233546,0.00023330278,0.00012630735],"domain_scores_gemma":[0.99698955,0.0012667032,0.00018684889,0.0009141759,0.00048599136,0.00015678532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001969309,0.0015743438,0.0011883305,0.0022420976,0.0006959567,0.0013420365,0.0015205177,0.0009429852,0.004115228],"category_scores_gemma":[0.0046120915,0.00033891722,0.0018625719,0.0026089014,0.00036088514,0.001872028,0.0016605075,0.0018587401,0.0037574891],"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.0013539632,0.00087469886,0.030489339,0.0004177552,0.00047287284,0.00024901758,0.00015620618,0.06929079,0.021195957,0.002162441,0.05459906,0.8187379],"study_design_scores_gemma":[0.0001252141,0.00052737974,0.009360622,0.00012790602,0.00037380424,0.0002488791,0.00035793107,0.8856972,0.03825808,0.037904285,0.026923833,0.00009488558],"about_ca_topic_score_codex":0.00721536,"about_ca_topic_score_gemma":0.0125412885,"teacher_disagreement_score":0.00721536,"about_ca_system_score_codex":0.00056149776,"about_ca_system_score_gemma":0.0010951646,"threshold_uncertainty_score":0.014346719},"labels":[],"label_agreement":null},{"id":"W4312727954","doi":"10.1007/978-3-031-20624-5_41","title":"Piercing Pairwise Intersecting Convex Shapes in the Plane","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Regular polygon; Convex body; Pairwise comparison; RADIUS; Euclidean geometry; Geometry; Convex hull; Computer science","score_opus":0.021423640429588553,"score_gpt":0.24414056668890252,"score_spread":0.22271692625931397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312727954","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.12601298,0.00039347756,0.82371354,0.00019217702,0.00017854777,0.00015882944,0.00028363458,0.0006774457,0.048389304],"genre_scores_gemma":[0.5249452,0.00093732396,0.42729747,0.00013052725,0.00008722712,0.00021429149,0.00083590474,0.0009808271,0.044571254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893624,0.000117290845,0.0000537139,0.00015813114,0.0005989931,0.00013564077],"domain_scores_gemma":[0.9988815,0.0005533756,0.00011103079,0.00021681363,0.00013474286,0.0001024879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894975,0.0012491078,0.001339681,0.0012084201,0.0009014528,0.0023732393,0.0019012955,0.0017039648,0.009630818],"category_scores_gemma":[0.003056137,0.0012791217,0.0013156733,0.0015543884,0.0016382057,0.0017994111,0.0064123217,0.003114101,0.0029583555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045582122,0.00014857911,0.0016136966,0.0004329465,0.00012871811,0.002653251,0.0016708951,0.3088348,0.04904846,0.33995852,0.0068472615,0.2882071],"study_design_scores_gemma":[0.000067586996,0.00029421743,0.0006200455,0.00018210658,0.00004498432,0.0024280741,0.0011161836,0.7165628,0.025709422,0.2247717,0.028113788,0.00008907753],"about_ca_topic_score_codex":0.0009635262,"about_ca_topic_score_gemma":0.0012693511,"teacher_disagreement_score":0.009630818,"about_ca_system_score_codex":0.0005335204,"about_ca_system_score_gemma":0.00059242925,"threshold_uncertainty_score":0.032218337},"labels":[],"label_agreement":null},{"id":"W4312738503","doi":"10.1007/978-3-031-21244-4_24","title":"A Probabilistic Approach to Analyzing Agent Relations in Three-Way Conflict Analysis Based on Bayesian Confirmation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Computer science; Probabilistic logic; Alliance; Function (biology); Bayesian probability; Set (abstract data type); Binary relation; Neutrality; Semantics (computer science); Construct (python library); Relation (database); Conflict analysis; Artificial intelligence; Data mining; Conflict resolution; Mathematics; Political science","score_opus":0.03675140658481522,"score_gpt":0.26020739707145635,"score_spread":0.22345599048664114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312738503","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.0033830442,0.00012178516,0.99450797,0.00019243879,0.000018068356,0.000030832634,0.00003552698,0.0000600077,0.0016502844],"genre_scores_gemma":[0.30062968,0.00049659057,0.69528085,0.00018476954,0.00014676481,0.00043997605,0.00018066846,0.00011554515,0.0025251259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935456,0.0040148455,0.0003160427,0.00052990933,0.0012852756,0.0003082947],"domain_scores_gemma":[0.9690899,0.027421732,0.0011949287,0.0010013992,0.0009988003,0.0002931171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007732164,0.0012557638,0.0017777644,0.0028609163,0.0015962517,0.0034497199,0.0049282294,0.001881694,0.005692359],"category_scores_gemma":[0.029596973,0.0015199005,0.0029595317,0.004108493,0.0044378485,0.008501145,0.0035642022,0.0034752141,0.0006031572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009326181,0.00010322314,0.0011407181,0.00014513783,0.00021313725,0.00014921313,0.00050194253,0.16456605,0.0009839027,0.7878068,0.0013197394,0.042976867],"study_design_scores_gemma":[0.000010182825,0.000019394185,0.00024108434,0.0000138750665,0.000034135115,0.000048049114,0.000049803522,0.45553687,0.00022396586,0.5432206,0.0005695038,0.00003262742],"about_ca_topic_score_codex":0.0048071262,"about_ca_topic_score_gemma":0.0046893763,"teacher_disagreement_score":0.007732164,"about_ca_system_score_codex":0.0018651125,"about_ca_system_score_gemma":0.002267031,"threshold_uncertainty_score":0.040892124},"labels":[],"label_agreement":null},{"id":"W4312751706","doi":"10.1007/978-3-031-19756-7_17","title":"On Technical Debt in Software Testing - Observations from Industry","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Carleton University","funders":"","keywords":"Technical debt; Computer science; Agile software development; Code refactoring; Test suite; Test case; Software engineering; Test Management Approach; White-box testing; Code coverage; Automation; Test (biology); Software; Software system; Software development; Programming language; Software construction; Engineering; Machine learning","score_opus":0.05620035206899127,"score_gpt":0.2735181785792026,"score_spread":0.2173178265102113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312751706","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.7979055,0.017840393,0.006292589,0.023184087,0.00010597439,0.000037000704,0.00077608455,0.00024687906,0.15361148],"genre_scores_gemma":[0.9911466,0.0025685725,0.0005782207,0.0007073248,0.00006740126,0.0000086662585,0.00026939635,0.000047772413,0.0046060844],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99852175,0.0004761654,0.00009571163,0.00014257591,0.0005422671,0.00022148796],"domain_scores_gemma":[0.94548386,0.043558322,0.0043036025,0.0017837366,0.003658538,0.0012118892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002966444,0.00018541659,0.00024693698,0.002178135,0.0010115684,0.0018557681,0.0007690266,0.0013238827,0.004506756],"category_scores_gemma":[0.030456167,0.00019935658,0.00019673431,0.0044259736,0.00175365,0.004709128,0.0014903474,0.0021711923,0.00057286455],"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.0009148119,0.0007094489,0.33293748,0.00052134326,0.00003752834,0.0031165185,0.025882384,0.00499277,0.0022158558,0.13321891,0.059396517,0.43605652],"study_design_scores_gemma":[0.0000897304,0.00047516025,0.6215741,0.0013524778,0.00006364465,0.0028008895,0.034299728,0.01132005,0.0046965764,0.16019174,0.1630291,0.000106731204],"about_ca_topic_score_codex":0.011025825,"about_ca_topic_score_gemma":0.011526373,"teacher_disagreement_score":0.011025825,"about_ca_system_score_codex":0.0014477706,"about_ca_system_score_gemma":0.0008126581,"threshold_uncertainty_score":0.021923304},"labels":[],"label_agreement":null},{"id":"W4312772843","doi":"10.1007/978-3-031-19745-1_13","title":"Recognition of Graphological Wartegg Hand-Drawings","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Object (grammar); Task (project management); Cognitive neuroscience of visual object recognition; Margin (machine learning); Pattern recognition (psychology); Object detection; Machine learning","score_opus":0.029955437661247572,"score_gpt":0.2590526981907191,"score_spread":0.2290972605294715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312772843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21504503,0.0015752775,0.6823497,0.0003589307,0.00044600948,0.00058901054,0.007774631,0.025594944,0.06626644],"genre_scores_gemma":[0.49086338,0.001776906,0.44459465,0.00013220689,0.0000812792,0.00015500096,0.013924144,0.0025654812,0.04590683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997851,0.00002432765,0.00000932129,0.0000845034,0.00005737877,0.00003948458],"domain_scores_gemma":[0.9996438,0.00008968374,0.000037196864,0.00010005258,0.00009757301,0.000031649684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013728734,0.0012276564,0.0006657782,0.0024181711,0.00038880858,0.0014381798,0.0009047199,0.0008812979,0.029479502],"category_scores_gemma":[0.0010174782,0.00048113926,0.00072598126,0.0018062029,0.00033799748,0.0012050236,0.00053326343,0.00068814127,0.008953009],"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.0005819488,0.000084768624,0.0019084833,0.00048623615,0.00005704507,0.00088164513,0.00016401982,0.015708271,0.09171295,0.009290779,0.019192832,0.859931],"study_design_scores_gemma":[0.00007080833,0.0003310294,0.015271714,0.00033063677,0.00013623148,0.0040731956,0.0009066695,0.6933331,0.16647962,0.022782158,0.09616334,0.0001215223],"about_ca_topic_score_codex":0.004999755,"about_ca_topic_score_gemma":0.010716508,"teacher_disagreement_score":0.029479502,"about_ca_system_score_codex":0.00037014694,"about_ca_system_score_gemma":0.00044530354,"threshold_uncertainty_score":0.098618746},"labels":[],"label_agreement":null},{"id":"W4312775747","doi":"10.1007/978-3-031-21707-4_24","title":"What Are the Factors That Drive AI Acceptance: A Meta-Analysis Approach","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"HEC Montréal","funders":"","keywords":"Extant taxon; Computer science; Affect (linguistics); Context (archaeology); Knowledge management; Service (business); Technology acceptance model; Psychology; Marketing; Human–computer interaction; Business; Usability","score_opus":0.18999539034407006,"score_gpt":0.36638372590688756,"score_spread":0.1763883355628175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312775747","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1206958,0.82671016,0.042166878,0.0034560694,0.0012627192,0.0025882605,0.0011753101,0.00025549575,0.0016893288],"genre_scores_gemma":[0.87673616,0.07226495,0.04414358,0.0016612443,0.0005776684,0.0031831104,0.00062532106,0.00019988691,0.0006080579],"study_design_codex":"meta_analysis","study_design_gemma":"meta_analysis","domain_scores_codex":[0.86156076,0.10340823,0.016760785,0.009072399,0.008024484,0.0011732917],"domain_scores_gemma":[0.6794684,0.2876447,0.013603946,0.009318859,0.0086116055,0.0013524372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.12130697,0.0040282896,0.015390922,0.011426075,0.0018128667,0.008627987,0.004363461,0.0033485692,0.0022631567],"category_scores_gemma":[0.19092977,0.0025544795,0.055085547,0.010170382,0.0028134543,0.008405256,0.0030168765,0.0038493816,0.0003324762],"study_design_candidate":"meta_analysis","study_design_consensus":"meta_analysis","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001503573,0.000114227296,0.021896865,0.030694125,0.9233867,0.000057199035,0.0007537306,0.00058798277,0.00031460554,0.00058512966,0.00031178922,0.019794134],"study_design_scores_gemma":[0.0008372335,0.0010460635,0.00877892,0.008024509,0.9756315,0.00007944924,0.0005289342,0.001082626,0.0005608361,0.0025266714,0.00083619735,0.000067086454],"about_ca_topic_score_codex":0.006995635,"about_ca_topic_score_gemma":0.011213711,"teacher_disagreement_score":0.12130697,"about_ca_system_score_codex":0.0037404404,"about_ca_system_score_gemma":0.005114452,"threshold_uncertainty_score":0.6415403},"labels":[],"label_agreement":null},{"id":"W4312787659","doi":"10.1007/978-3-031-22064-7_19","title":"The Coherence and Divergence Between the Objective and Subjective Measurement of Street Perceptions for Shanghai","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Transport and Accessibility","field":"Social Sciences","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":"IBI Group (Canada)","funders":"","keywords":"Perception; Pairwise comparison; Computer science; Coherence (philosophical gambling strategy); Scale (ratio); Divergence (linguistics); Artificial intelligence; Cartography; Cognitive psychology; Geography; Psychology; Statistics; Mathematics","score_opus":0.03830024455558743,"score_gpt":0.2868303214702798,"score_spread":0.2485300769146924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312787659","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.9956339,0.00009255878,0.0010602261,0.000037944304,0.000004089197,0.0000037179618,0.00009369969,0.000009316822,0.003064623],"genre_scores_gemma":[0.99953556,0.000020447118,0.00019067909,0.000002627557,0.0000016455931,0.0000025024333,0.00008943914,0.0000032678217,0.00015381695],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989146,0.00047860586,0.00006973786,0.00012934534,0.00030174988,0.00010596055],"domain_scores_gemma":[0.99295676,0.0043305857,0.0009561358,0.00039979455,0.0010606259,0.0002960485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003175569,0.0002337829,0.00018425833,0.0016498365,0.00039843254,0.0020491378,0.00025351555,0.00023082056,0.0013788837],"category_scores_gemma":[0.0102115795,0.0001660114,0.0002213974,0.0018236232,0.0010279156,0.0013316422,0.0012967995,0.0003445259,0.00012703553],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003494635,0.000030434052,0.8923886,0.00016473014,0.00011436866,0.000097833654,0.054022904,0.0016560815,0.0028864993,0.0055807936,0.00074694114,0.041961282],"study_design_scores_gemma":[0.0000024657143,0.000072728006,0.98204696,0.000026136951,0.000030088726,0.000026767437,0.014289195,0.0016723629,0.00033220503,0.00078423496,0.00070085196,0.000015931735],"about_ca_topic_score_codex":0.024703382,"about_ca_topic_score_gemma":0.043025315,"teacher_disagreement_score":0.024703382,"about_ca_system_score_codex":0.0011246679,"about_ca_system_score_gemma":0.00065897184,"threshold_uncertainty_score":0.049119174},"labels":[],"label_agreement":null},{"id":"W4312812430","doi":"10.1007/978-3-031-22695-3_44","title":"Optimizing the Feature Set for Machine Learning Charitable Predictions","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nonprofit Sector and Volunteering","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":"Acadia University","funders":"","keywords":"Feature (linguistics); Computer science; Machine learning; Artificial intelligence; Set (abstract data type); Random forest; Focus (optics); Decision tree; Measure (data warehouse); Training set; Data mining","score_opus":0.029154544536631244,"score_gpt":0.28649290654679316,"score_spread":0.2573383620101619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312812430","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.18242572,0.0014489398,0.7895482,0.0026460574,0.00040317498,0.00026794767,0.0027044704,0.006974698,0.013580715],"genre_scores_gemma":[0.808331,0.00030925966,0.16960286,0.000385835,0.00032985985,0.00035585117,0.005691746,0.00040544057,0.014588082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993062,0.00026509786,0.000029598703,0.00013916647,0.00013356654,0.00012639088],"domain_scores_gemma":[0.9973207,0.0019411593,0.00009786706,0.00024608092,0.0003263474,0.00006789748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017928778,0.0008868327,0.0011617064,0.0011128178,0.00056368555,0.0011453197,0.0017220065,0.0017027946,0.00709866],"category_scores_gemma":[0.0060189464,0.00043765575,0.0007758,0.0012767774,0.00044417242,0.0017096766,0.0010357591,0.0021413064,0.0020864299],"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.00033304968,0.0005389907,0.003891819,0.00009783527,0.000080378,0.000085220796,0.000035360266,0.44959304,0.0019056124,0.0063328156,0.02977771,0.5073281],"study_design_scores_gemma":[0.000011448969,0.000024280824,0.00032187256,0.000008912147,0.0000066912057,0.000011595321,0.000008337321,0.993887,0.0006229121,0.004686057,0.00040639797,0.0000044370145],"about_ca_topic_score_codex":0.005034895,"about_ca_topic_score_gemma":0.006165087,"teacher_disagreement_score":0.00709866,"about_ca_system_score_codex":0.0009031111,"about_ca_system_score_gemma":0.0010930711,"threshold_uncertainty_score":0.023747325},"labels":[],"label_agreement":null},{"id":"W4312820254","doi":"10.1007/978-3-031-22298-6_17","title":"Supporting Spatial Thinking in Augmented Reality Narrative: A Field Study","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Dalhousie University","funders":"","keywords":"Augmented reality; Narrative; Field (mathematics); Sociology; Human–computer interaction; Computer science; Art; Literature; Mathematics","score_opus":0.024236075555005624,"score_gpt":0.3157363378168816,"score_spread":0.291500262261876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312820254","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.9533855,0.0005007453,0.0074768267,0.00026237042,0.000039853767,0.0003612117,0.00012822266,0.000054246877,0.037791055],"genre_scores_gemma":[0.9869702,0.00026195796,0.0031602609,0.00004748961,0.00001007591,0.0001318293,0.00005024353,0.000019162651,0.009348781],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.998728,0.00080709887,0.000040558814,0.0001520762,0.00015814418,0.00011418497],"domain_scores_gemma":[0.9915489,0.0069858576,0.0002512486,0.00043764498,0.0004642013,0.00031206163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002728712,0.00080438127,0.00042410564,0.0012455407,0.002385494,0.0041114986,0.0013642976,0.0011139219,0.010326057],"category_scores_gemma":[0.008939083,0.0005242547,0.00033579595,0.00081362046,0.004086837,0.0037194388,0.0023149566,0.0016119105,0.00072337425],"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.0016730677,0.0030246861,0.007225969,0.00086066156,0.000025717187,0.002746466,0.84807634,0.0010853077,0.022466743,0.047471292,0.0028659161,0.062477898],"study_design_scores_gemma":[0.000330894,0.005279652,0.019699499,0.00063854916,0.0000928378,0.004250883,0.8704754,0.00512591,0.01575321,0.017272133,0.060915813,0.00016512479],"about_ca_topic_score_codex":0.0022068806,"about_ca_topic_score_gemma":0.00189667,"teacher_disagreement_score":0.010326057,"about_ca_system_score_codex":0.00105729,"about_ca_system_score_gemma":0.0009326489,"threshold_uncertainty_score":0.03454411},"labels":[],"label_agreement":null},{"id":"W4312821893","doi":"10.1007/978-3-031-21311-3_4","title":"Effective Segmentation of RSSI Timeseries Produced by Stationary IoT Nodes: Comparative Study","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Time series; Profiling (computer programming); Independent and identically distributed random variables; Segmentation; Data mining; Node (physics); Real-time computing; Artificial intelligence; Random variable; Machine learning; Statistics","score_opus":0.015573308054621258,"score_gpt":0.2862315256465502,"score_spread":0.27065821759192893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312821893","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.7364754,0.0021678586,0.2506073,0.00013480117,0.00016269492,0.00008068328,0.0009949891,0.001214037,0.008162315],"genre_scores_gemma":[0.93757874,0.0007576934,0.05681792,0.000022529412,0.000091452246,0.00002801206,0.0017039495,0.00019425855,0.0028055026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938774,0.00012859389,0.00003927413,0.00013475961,0.0002330432,0.00007651674],"domain_scores_gemma":[0.9973327,0.0015481394,0.00020593891,0.00021833868,0.0006036731,0.000091199574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578022,0.0005942831,0.0006213502,0.0028958074,0.00041828296,0.0014487933,0.00066530023,0.00065276306,0.0018284502],"category_scores_gemma":[0.003292211,0.00019501033,0.0005374231,0.0032535533,0.00040704195,0.0012796518,0.00034363155,0.00027123297,0.0009135337],"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.0034696022,0.00043510072,0.043943014,0.00079004647,0.00029835556,0.0008279502,0.0011245784,0.079904966,0.1068271,0.0051340074,0.0035378449,0.75370747],"study_design_scores_gemma":[0.000057532092,0.0013896488,0.21031672,0.00007537725,0.0005817022,0.002195716,0.0022025805,0.6966605,0.07392527,0.0039310707,0.008546439,0.00011739814],"about_ca_topic_score_codex":0.0032559945,"about_ca_topic_score_gemma":0.0030878552,"teacher_disagreement_score":0.0032559945,"about_ca_system_score_codex":0.0004591192,"about_ca_system_score_gemma":0.00038510788,"threshold_uncertainty_score":0.0064740777},"labels":[],"label_agreement":null},{"id":"W4312849998","doi":"10.1007/978-3-031-20624-5_31","title":"Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; Thompson Rivers University","funders":"","keywords":"Homomorphism; Combinatorics; Conjecture; Mathematics; Discrete mathematics; Graph homomorphism; Bipartite graph; Graph; Line graph","score_opus":0.016646946668137996,"score_gpt":0.2586985705551679,"score_spread":0.2420516238870299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312849998","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.38706195,0.0044489284,0.2315218,0.008661102,0.0011961203,0.00012443509,0.0014786371,0.0011187085,0.36438823],"genre_scores_gemma":[0.8937876,0.0018511681,0.038462654,0.0012917464,0.0007854,0.00017869195,0.0010833476,0.0003911099,0.06216831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.0002051245,0.000049677397,0.0001611231,0.00024746227,0.0001780121],"domain_scores_gemma":[0.9977531,0.0014672559,0.00016225474,0.00022585459,0.00019620733,0.00019528663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010521525,0.00054489396,0.00073426944,0.0019134706,0.002501247,0.0050808345,0.0012090402,0.0012092614,0.010831566],"category_scores_gemma":[0.003874255,0.00058632484,0.00091051875,0.0023378236,0.0032983425,0.010928887,0.0022114138,0.0042944592,0.0011228218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059754268,0.000028504324,0.000112961825,0.00003734597,0.0000036087606,0.00003102338,0.00022220975,0.00036103668,0.00043047758,0.98745406,0.0022347178,0.009024274],"study_design_scores_gemma":[0.000008320394,0.0000083526875,0.000084890184,0.000009813005,0.0000036189579,0.00003822504,0.00007675116,0.0013245796,0.0002825337,0.99607974,0.0020767625,0.0000064079236],"about_ca_topic_score_codex":0.00081685674,"about_ca_topic_score_gemma":0.0011126137,"teacher_disagreement_score":0.010831566,"about_ca_system_score_codex":0.0021815856,"about_ca_system_score_gemma":0.001000371,"threshold_uncertainty_score":0.036235213},"labels":[],"label_agreement":null},{"id":"W4312852783","doi":"10.1007/978-3-031-19214-2_28","title":"Target Detection Algorithm Based on Feature Optimization and Sample Equalization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pascal (unit); Feature (linguistics); Artificial intelligence; Cascade; Pattern recognition (psychology); Convergence (economics); Algorithm; Data mining","score_opus":0.017705571299725224,"score_gpt":0.2627131672295567,"score_spread":0.24500759592983146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312852783","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.005118937,0.00010294606,0.99360293,0.000029795092,0.00003511537,0.000017624245,0.000014037235,0.00051399425,0.00056457013],"genre_scores_gemma":[0.11775604,0.00025942284,0.87570643,0.00008348839,0.00007307873,0.0000937371,0.00021557366,0.00014816978,0.00566408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997094,0.000028975737,0.000014974153,0.00009043997,0.00012508432,0.000031018673],"domain_scores_gemma":[0.999739,0.00007571207,0.000017576267,0.000036734098,0.00011803979,0.000013045936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034696455,0.00051236607,0.0011534079,0.0005880769,0.00034443018,0.00057134044,0.00089359295,0.0006283125,0.0026313337],"category_scores_gemma":[0.0007656464,0.0003319071,0.0006287028,0.0008072409,0.00030247265,0.0010553754,0.00067068345,0.00089648314,0.0011227422],"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.00031598378,0.00009835658,0.00047051505,0.000081479295,0.00006557624,0.000045891193,0.000045396835,0.02620817,0.091969006,0.005792832,0.0027722225,0.87213445],"study_design_scores_gemma":[0.000027899381,0.00013069501,0.0011188808,0.0000058618593,0.000047144124,0.00023004966,0.000011515577,0.955406,0.037616882,0.002523472,0.0028528455,0.000028798924],"about_ca_topic_score_codex":0.0014971422,"about_ca_topic_score_gemma":0.001578988,"teacher_disagreement_score":0.0026313337,"about_ca_system_score_codex":0.00033319808,"about_ca_system_score_gemma":0.0007595877,"threshold_uncertainty_score":0.008802712},"labels":[],"label_agreement":null},{"id":"W4312866229","doi":"10.1007/978-3-031-21517-9_6","title":"Mayfly-Algorithm Selected Features for Classification of Breast Histology Images into Benign/Malignant Class","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Brandon University","funders":"","keywords":"Computer science; Artificial intelligence; Concatenation (mathematics); Feature extraction; Feature (linguistics); Pattern recognition (psychology); Pixel; Feature selection; Algorithm; Mathematics","score_opus":0.012015002871406867,"score_gpt":0.2458053075751026,"score_spread":0.23379030470369574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312866229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21529181,0.0024717418,0.73676217,0.00069423503,0.00059533084,0.0006348957,0.008505969,0.017789032,0.017254813],"genre_scores_gemma":[0.34745932,0.0006377642,0.6003055,0.00018396378,0.00014821895,0.0003872835,0.014683813,0.00059522636,0.035599023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999826,0.000014244127,0.000010085938,0.000045657733,0.00007027988,0.00003368414],"domain_scores_gemma":[0.9998393,0.000039732182,0.00001137402,0.000015740352,0.000081659295,0.000012199074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002709923,0.0006058687,0.000412103,0.001204891,0.00042201317,0.0007179336,0.000698679,0.00059550296,0.010690914],"category_scores_gemma":[0.0006018732,0.00014952454,0.0006181004,0.0006439651,0.00012881978,0.00040476228,0.00034498636,0.00037613342,0.0027597174],"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.0006235803,0.00014937094,0.003971332,0.000117936084,0.0000781829,0.00014620622,0.000048287635,0.006891046,0.04494104,0.0016831828,0.030691355,0.9106585],"study_design_scores_gemma":[0.00022892626,0.0008074144,0.03960073,0.00009101527,0.00020465549,0.0018199598,0.00017740008,0.69679564,0.18604137,0.004862478,0.069284014,0.00008637442],"about_ca_topic_score_codex":0.003900847,"about_ca_topic_score_gemma":0.005775842,"teacher_disagreement_score":0.010690914,"about_ca_system_score_codex":0.00037857835,"about_ca_system_score_gemma":0.00055643695,"threshold_uncertainty_score":0.035764694},"labels":[],"label_agreement":null},{"id":"W4312875584","doi":"10.1007/978-3-031-22365-5_8","title":"On the Worst-Case Inefficiency of CGKA","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Forward secrecy; Secrecy; Computer security; Group key; Communication in small groups; Group (periodic table); Context (archaeology); State (computer science); Key (lock); Theoretical computer science; Computer network; Public-key cryptography; Encryption; Algorithm","score_opus":0.016944071611589187,"score_gpt":0.23122983450052906,"score_spread":0.21428576288893986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312875584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13980883,0.009809919,0.6909056,0.018484008,0.0013581065,0.0005771473,0.0018725405,0.005071412,0.13211249],"genre_scores_gemma":[0.849932,0.0031343945,0.12099454,0.0036800927,0.0013839611,0.0006353205,0.0010606012,0.0025026419,0.016676493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9743264,0.012494083,0.0010302537,0.0024976837,0.004245655,0.0054059075],"domain_scores_gemma":[0.778336,0.19138627,0.003444115,0.019346802,0.0051447656,0.0023421443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017156323,0.0032856725,0.004431604,0.0034298976,0.0035722859,0.009705263,0.0080570895,0.0056312797,0.024082294],"category_scores_gemma":[0.10279934,0.0018380091,0.0030519466,0.0061247083,0.007906513,0.017803097,0.0067906235,0.0098731825,0.0041134832],"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.0030964224,0.0005995331,0.003054298,0.0010506603,0.00030324704,0.00039590194,0.0004093642,0.41002196,0.0056755836,0.41407737,0.04250887,0.11880679],"study_design_scores_gemma":[0.00017241527,0.00012829431,0.00038347222,0.00012177049,0.00014116845,0.0003248517,0.00013983402,0.5325303,0.0016353149,0.46132892,0.0030344336,0.000059177328],"about_ca_topic_score_codex":0.006248275,"about_ca_topic_score_gemma":0.0065785437,"teacher_disagreement_score":0.024082294,"about_ca_system_score_codex":0.0063796095,"about_ca_system_score_gemma":0.009408274,"threshold_uncertainty_score":0.090732336},"labels":[],"label_agreement":null},{"id":"W4312884000","doi":"10.1007/978-3-031-19769-7_9","title":"Structural Causal 3D Reconstruction","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Université de Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Causal structure; Regularization (linguistics); Computer science; Latent variable; Ambiguity; Directed acyclic graph; Algorithm; Artificial intelligence; Theoretical computer science","score_opus":0.017083286547032697,"score_gpt":0.26215921931022557,"score_spread":0.24507593276319287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312884000","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.0017329197,0.00025239825,0.9836817,0.00013454066,0.00008529502,0.000017646194,0.000264472,0.0013113928,0.012519766],"genre_scores_gemma":[0.19782843,0.0020509178,0.75890344,0.00024753562,0.00014701583,0.00005294211,0.0020916169,0.0011588983,0.037519224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975663,0.000026793003,0.000007945953,0.000058399535,0.00013125243,0.000018944245],"domain_scores_gemma":[0.9997247,0.00006427604,0.000020018262,0.00012758229,0.00004917436,0.000014162769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000241954,0.00073367916,0.00052878394,0.0007327728,0.00027558714,0.0011774191,0.0007328088,0.0008119948,0.017429773],"category_scores_gemma":[0.0008311012,0.00068986235,0.0006073285,0.0008034617,0.00069394987,0.00093144603,0.0013083408,0.0010903105,0.0047338996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001834024,0.000043541208,0.00041234048,0.00030357073,0.00006715772,0.00019942422,0.000113578004,0.12766522,0.041135527,0.26977894,0.023659691,0.53643763],"study_design_scores_gemma":[0.00002186711,0.00006209016,0.0006417844,0.00008818903,0.000041946012,0.0008898515,0.00007199316,0.7309051,0.03867412,0.14840399,0.08014845,0.000050724673],"about_ca_topic_score_codex":0.0011254064,"about_ca_topic_score_gemma":0.001726243,"teacher_disagreement_score":0.017429773,"about_ca_system_score_codex":0.00035055488,"about_ca_system_score_gemma":0.0005251014,"threshold_uncertainty_score":0.058308363},"labels":[],"label_agreement":null},{"id":"W4312894768","doi":"10.1007/978-3-031-18840-4_20","title":"MQ-OFL: Multi-sensitive Queue-based Online Fair Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Online learning; Queue; Data stream; Data stream mining; Concept drift; Focus (optics); Process (computing); Class (philosophy); Skew; World Wide Web","score_opus":0.026897892129040205,"score_gpt":0.27456518485677134,"score_spread":0.24766729272773114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312894768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070132427,0.0004523445,0.9822435,0.00044368257,0.00046010723,0.0001903796,0.00028653783,0.006428864,0.002481367],"genre_scores_gemma":[0.4397669,0.00035188417,0.54250795,0.00094438944,0.00045394135,0.00047435597,0.0007930964,0.0007671779,0.01394033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997378,0.0005764632,0.00014805574,0.000547571,0.00082663255,0.0005233135],"domain_scores_gemma":[0.99465406,0.0024624704,0.00022016698,0.0011478388,0.0009791702,0.0005362829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059676333,0.0010583093,0.002581189,0.0012965451,0.0017141837,0.0029349544,0.006970328,0.0021028956,0.014468732],"category_scores_gemma":[0.0149246,0.00057371444,0.0009087442,0.0014475749,0.0014037404,0.004499768,0.0049053845,0.0037204605,0.0025734773],"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.0014913444,0.0011221257,0.0017577847,0.00026410221,0.00012860834,0.00012107935,0.00024132541,0.23417349,0.00453268,0.07532651,0.043530267,0.6373107],"study_design_scores_gemma":[0.000070448965,0.00009001327,0.00010226411,0.000013108605,0.000011871156,0.000023781526,0.000017999391,0.9610134,0.0009874011,0.035449866,0.0022010559,0.000018838824],"about_ca_topic_score_codex":0.009689519,"about_ca_topic_score_gemma":0.012532511,"teacher_disagreement_score":0.014468732,"about_ca_system_score_codex":0.0025679572,"about_ca_system_score_gemma":0.006067498,"threshold_uncertainty_score":0.048402727},"labels":[],"label_agreement":null},{"id":"W4312904577","doi":"10.1007/978-3-031-20980-2_29","title":"An Analytic Study on Clustering-Based Pseudo-labels for Self-supervised Deep Speaker Verification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Overfitting; Computer science; Cluster analysis; Discriminative model; Artificial intelligence; Embedding; Pattern recognition (psychology); Set (abstract data type); Speaker recognition; Scheme (mathematics); Speech recognition; Machine learning; Artificial neural network; Mathematics","score_opus":0.03380490464928443,"score_gpt":0.2764592676533605,"score_spread":0.24265436300407606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312904577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01796114,0.0008106633,0.9767651,0.00032374327,0.000046460907,0.00005630978,0.00009484281,0.00020978221,0.0037318363],"genre_scores_gemma":[0.6586372,0.0014263091,0.3236694,0.00036464655,0.00037906648,0.00021890803,0.0007141431,0.0005424217,0.014047762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972263,0.001121426,0.000083769606,0.00057217677,0.0007938885,0.00020236676],"domain_scores_gemma":[0.9704351,0.023150275,0.0011658337,0.0018628637,0.0030620454,0.0003237795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004421866,0.0007986047,0.00097345514,0.0014978867,0.00091707223,0.0019695284,0.0031670718,0.0016114939,0.0045057097],"category_scores_gemma":[0.037629057,0.00073346874,0.0008361147,0.0014405072,0.0025862358,0.0056231553,0.0020782612,0.002273134,0.00082870707],"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.00037363646,0.00014532985,0.002762671,0.0004860674,0.00010751338,0.00020947975,0.0008914091,0.34227288,0.014049037,0.44103178,0.0074793096,0.19019091],"study_design_scores_gemma":[0.0000030957792,0.00003201917,0.00062004046,0.000032820742,0.000015304602,0.00008414891,0.000053378284,0.953626,0.0015105144,0.04307495,0.0009306857,0.000017098384],"about_ca_topic_score_codex":0.0036393376,"about_ca_topic_score_gemma":0.003835423,"teacher_disagreement_score":0.0045057097,"about_ca_system_score_codex":0.0022757028,"about_ca_system_score_gemma":0.0013772662,"threshold_uncertainty_score":0.023385286},"labels":[],"label_agreement":null},{"id":"W4312936899","doi":"10.1007/978-3-031-19833-5_34","title":"TM2T: Stochastic and Tokenized Modeling for the Reciprocal Generation of 3D Human Motions and Texts","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":177,"is_retracted":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":"Computer science; Security token; Pipeline (software); Context (archaeology); Representation (politics); Benchmark (surveying); Artificial intelligence; Motion (physics); Reciprocal; Machine translation; Process (computing); Natural language processing; Machine learning; Theoretical computer science; Programming language","score_opus":0.05355926095335859,"score_gpt":0.2752925466973316,"score_spread":0.22173328574397302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312936899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050698477,0.00018406742,0.9668578,0.00018241673,0.00017859883,0.00010998151,0.003136967,0.022990208,0.0012900376],"genre_scores_gemma":[0.20002465,0.00038198417,0.765068,0.00030065663,0.00018446041,0.00079506723,0.018537996,0.0054598255,0.009247334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903214,0.00022856316,0.00005810742,0.00036206582,0.00023101426,0.00008807905],"domain_scores_gemma":[0.9985713,0.00084164535,0.00007167061,0.00024209214,0.00019008192,0.00008314897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013672333,0.0014967738,0.0012063426,0.0011129312,0.0006715911,0.0019255861,0.0037425763,0.0017280795,0.018215708],"category_scores_gemma":[0.004650451,0.0009209448,0.0021005315,0.0013860513,0.00066464016,0.002043917,0.002407134,0.0021007564,0.008681643],"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.001015136,0.00028365324,0.0024669524,0.00044455734,0.00028181646,0.000470829,0.000358559,0.3150443,0.01055577,0.037270837,0.06378257,0.568025],"study_design_scores_gemma":[0.000017953247,0.000026073461,0.00015407281,0.000010185082,0.000012562153,0.000048534457,0.0000208334,0.9844407,0.0021211102,0.00934695,0.0037876293,0.00001343476],"about_ca_topic_score_codex":0.01577346,"about_ca_topic_score_gemma":0.021878874,"teacher_disagreement_score":0.018215708,"about_ca_system_score_codex":0.0012203383,"about_ca_system_score_gemma":0.0019405652,"threshold_uncertainty_score":0.060937643},"labels":[],"label_agreement":null},{"id":"W4312939004","doi":"10.1007/978-3-031-22061-6_30","title":"Lighting Enhancement Using Self-attention Guided HDR Reconstruction","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"Computer science; Computer vision; Computer graphics (images); Psychology","score_opus":0.021444870988904983,"score_gpt":0.2659043081285082,"score_spread":0.2444594371396032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312939004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03579424,0.0005654801,0.95264566,0.00009377044,0.000098788885,0.000043724234,0.00011450993,0.0016448069,0.008999013],"genre_scores_gemma":[0.2608024,0.0012170356,0.71880037,0.00019045264,0.00009747354,0.000040085855,0.00039838007,0.0006161648,0.017837698],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989927,0.000013109531,0.00000418199,0.000020555777,0.000047156635,0.000015654989],"domain_scores_gemma":[0.9998419,0.000046779256,0.0000151251525,0.00004325714,0.00004284579,0.000010076302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015232904,0.00050770625,0.0003658597,0.00043681465,0.0001481923,0.0005565894,0.00039187758,0.00035285146,0.0060652206],"category_scores_gemma":[0.00032390398,0.00024810067,0.00042664932,0.00038532898,0.00020785179,0.00052373327,0.00050558185,0.00053456164,0.0015696163],"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.0002952734,0.00008663538,0.00044033217,0.0002151087,0.00004071729,0.00015733323,0.000085485786,0.010762053,0.6007924,0.004012204,0.0034250808,0.37968728],"study_design_scores_gemma":[0.000034672266,0.00014705746,0.0024553444,0.000043441472,0.00009751613,0.001234417,0.000055195644,0.29902232,0.67240244,0.002031313,0.022433486,0.000042666372],"about_ca_topic_score_codex":0.00047181168,"about_ca_topic_score_gemma":0.0007638726,"teacher_disagreement_score":0.0060652206,"about_ca_system_score_codex":0.00016094402,"about_ca_system_score_gemma":0.000182881,"threshold_uncertainty_score":0.020290196},"labels":[],"label_agreement":null},{"id":"W4312943943","doi":"10.1007/978-3-031-21037-2_10","title":"Novice Type Error Diagnosis with Natural Language Models","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Flexibility (engineering); Metric (unit); Constraint (computer-aided design); Natural language; Type (biology); Artificial intelligence; Language model; State (computer science); Data type; Machine learning; Natural language understanding; Natural language processing; Algorithm; Programming language","score_opus":0.01822127109074478,"score_gpt":0.26224330893068043,"score_spread":0.24402203783993565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312943943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013942597,0.00024873315,0.9667691,0.00046886405,0.0000861419,0.000090446825,0.00032603816,0.010348559,0.007719535],"genre_scores_gemma":[0.25238273,0.00034943287,0.7312351,0.0004673216,0.000086449094,0.00011286556,0.0013148064,0.0012747212,0.012776641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806434,0.000519927,0.00011260462,0.00044312255,0.00073529955,0.00012478467],"domain_scores_gemma":[0.99204093,0.004760431,0.00041226414,0.001655001,0.0009984712,0.00013292265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014111894,0.0009862403,0.0005987481,0.0011365694,0.00037798152,0.0016391089,0.0024069885,0.0014532096,0.007240238],"category_scores_gemma":[0.01137854,0.0005840718,0.001149443,0.0004560065,0.0007763274,0.0037869215,0.0016981895,0.002259471,0.0031089138],"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.0004489947,0.0005263388,0.0052617774,0.00049193256,0.000099992205,0.0015556981,0.00076927524,0.06356062,0.019278612,0.050270207,0.033261936,0.82447463],"study_design_scores_gemma":[0.000055622422,0.00017804728,0.00095004606,0.00019334185,0.0000821391,0.0017680641,0.00024385615,0.76696324,0.0478326,0.15373746,0.0279296,0.00006605346],"about_ca_topic_score_codex":0.0019336436,"about_ca_topic_score_gemma":0.0039275107,"teacher_disagreement_score":0.007240238,"about_ca_system_score_codex":0.0005994661,"about_ca_system_score_gemma":0.0010863122,"threshold_uncertainty_score":0.024221003},"labels":[],"label_agreement":null},{"id":"W4312945422","doi":"10.1007/978-3-031-19211-1_2","title":"A Time Utility Function Driven Scheduling Scheme for Managing Mixed-Criticality Traffic in TSN","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","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":"Concordia University","funders":"","keywords":"Computer science; Aperiodic graph; Quality of service; Scheduling (production processes); Internet traffic; Benchmark (surveying); Computer network; Criticality; Distributed computing; The Internet; Real-time computing; Mathematical optimization","score_opus":0.015685618206154196,"score_gpt":0.23977244122846267,"score_spread":0.22408682302230848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312945422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053545512,0.00039188055,0.94097006,0.0001626151,0.00025141344,0.00013930179,0.0000801643,0.0009079306,0.0035511376],"genre_scores_gemma":[0.84323305,0.00023386999,0.15188539,0.00011002099,0.00009439835,0.000098730685,0.000107666245,0.0001170032,0.0041199997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.000095764146,0.00002885646,0.000050448325,0.000112297865,0.00007223378],"domain_scores_gemma":[0.99936944,0.00019488482,0.000054891316,0.00010105219,0.00018905448,0.00009071166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000986496,0.0004921868,0.0006826818,0.0004828159,0.000881169,0.00091143016,0.0014511634,0.0004206466,0.0024121397],"category_scores_gemma":[0.0015216084,0.00020706668,0.00027694996,0.00069494266,0.00041034826,0.0007594541,0.0008334419,0.0007489231,0.00032467998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007658633,0.00029575118,0.0006552775,0.00014540192,0.00006622134,0.00020621483,0.00023079642,0.62858045,0.040635746,0.061427966,0.0071545313,0.2598358],"study_design_scores_gemma":[0.000012475208,0.000058262918,0.000056008303,0.000004198204,0.000009068103,0.000029819463,0.000015186011,0.9919397,0.0020075776,0.004669803,0.0011901684,0.000007733897],"about_ca_topic_score_codex":0.0030341013,"about_ca_topic_score_gemma":0.0050638868,"teacher_disagreement_score":0.0030341013,"about_ca_system_score_codex":0.0012616491,"about_ca_system_score_gemma":0.0014238023,"threshold_uncertainty_score":0.009153962},"labels":[],"label_agreement":null},{"id":"W4312955971","doi":"10.1007/978-3-031-19824-3_10","title":"Generalizable Patch-Based Neural Rendering","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute of Public Health Inspectors; Vector Institute; Google (Canada); University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Rendering (computer graphics); Computer vision; Epipolar geometry; Volume rendering; Convolutional neural network; Pattern recognition (psychology); Image (mathematics)","score_opus":0.02316140042268505,"score_gpt":0.2622336754182606,"score_spread":0.23907227499557554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312955971","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.00506196,0.00020105975,0.98069775,0.00007788372,0.00007993281,0.000023047667,0.00010352622,0.0020468615,0.011707989],"genre_scores_gemma":[0.2507485,0.00074955315,0.70581794,0.0001638539,0.00011539604,0.00006528775,0.000471585,0.0017211771,0.04014667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998727,0.000015187309,0.000003878727,0.000024726167,0.000068543115,0.000014859],"domain_scores_gemma":[0.99984515,0.00005127155,0.000008045859,0.000051925617,0.000030846702,0.0000126130035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016785845,0.0005544416,0.00059353077,0.00026106212,0.00012647362,0.0008772547,0.0009980834,0.00067821436,0.01516842],"category_scores_gemma":[0.0007207707,0.00032607312,0.00045466362,0.00035398488,0.0003832021,0.0008871868,0.00097148126,0.0011943614,0.0025064286],"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.0001986655,0.000075354525,0.0001962452,0.00023419624,0.000059956634,0.00014343919,0.00013097843,0.28446206,0.0939919,0.068907976,0.017751673,0.5338476],"study_design_scores_gemma":[0.000009200917,0.00001291987,0.00006299876,0.000010637503,0.0000050918334,0.00008054253,0.000007743562,0.9752446,0.006740629,0.01177028,0.0060479506,0.0000074814056],"about_ca_topic_score_codex":0.0022223166,"about_ca_topic_score_gemma":0.0033832318,"teacher_disagreement_score":0.01516842,"about_ca_system_score_codex":0.00040329335,"about_ca_system_score_gemma":0.0002467501,"threshold_uncertainty_score":0.05074346},"labels":[],"label_agreement":null},{"id":"W4312956563","doi":"10.1007/978-3-031-19836-6_2","title":"Sports Video Analysis on Large-Scale Data","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"York University","funders":"","keywords":"Computer science; Closed captioning; Segmentation; Salient; Artificial intelligence; Transformer; Machine learning; Annotation; Focus (optics); Action recognition; Image (mathematics)","score_opus":0.01675281976667602,"score_gpt":0.25093597353373803,"score_spread":0.234183153767062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312956563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088054135,0.0044753607,0.8807527,0.00086190325,0.0004957473,0.00021739125,0.01059047,0.006371853,0.008180612],"genre_scores_gemma":[0.3860902,0.0044822562,0.54724634,0.00020605896,0.00092640705,0.00027225647,0.041452546,0.0008787527,0.01844513],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99966145,0.000054117892,0.000024515304,0.00011293355,0.00010350762,0.000043383796],"domain_scores_gemma":[0.9992193,0.00037859584,0.00005315352,0.00013231079,0.00017700007,0.00003970228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042746536,0.00090749824,0.0007987581,0.00225432,0.00031686376,0.0010429377,0.000614313,0.00045949113,0.0035482785],"category_scores_gemma":[0.0015995457,0.00026323958,0.00065969385,0.0035429494,0.00018998007,0.0010975929,0.000605735,0.0005674295,0.0031807658],"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.0002062669,0.00012269664,0.004566255,0.00028401028,0.00016741607,0.00019607673,0.00008314614,0.024564888,0.041641656,0.0016212687,0.022209594,0.90433675],"study_design_scores_gemma":[0.000025372932,0.00014854872,0.02511153,0.0000506995,0.00013181953,0.00029265304,0.00036597758,0.90715754,0.02703514,0.013944132,0.025691476,0.000045103778],"about_ca_topic_score_codex":0.0045989035,"about_ca_topic_score_gemma":0.009741466,"teacher_disagreement_score":0.0045989035,"about_ca_system_score_codex":0.00031470397,"about_ca_system_score_gemma":0.00033929144,"threshold_uncertainty_score":0.011870146},"labels":[],"label_agreement":null},{"id":"W4312969765","doi":"10.1007/978-3-031-20713-6_1","title":"Unsupervised Structure-Consistent Image-to-Image Translation","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Concordia University","funders":"","keywords":"Computer science; Image (mathematics); Translation (biology); Artificial intelligence; Autoencoder; Image translation; Generator (circuit theory); Consistency (knowledge bases); Code (set theory); Constraint (computer-aided design); Pattern recognition (psychology); Computer vision; Deep learning; Mathematics","score_opus":0.017927274307776547,"score_gpt":0.2317983931147251,"score_spread":0.21387111880694856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312969765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044027674,0.0002723127,0.9910363,0.000122685,0.00007852371,0.000031536434,0.00013028116,0.0012121977,0.002713386],"genre_scores_gemma":[0.32356593,0.0011315625,0.6463355,0.00040786495,0.0002506462,0.00018868838,0.0016347304,0.0015282193,0.02495691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994635,0.00009509137,0.000018294455,0.00019751908,0.00016716102,0.000058440455],"domain_scores_gemma":[0.9992206,0.00028169056,0.00006990854,0.0002933941,0.00010407067,0.000030249459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005239744,0.0010466913,0.001064814,0.0005448735,0.00031615194,0.0011197467,0.0015937672,0.0014911103,0.005974734],"category_scores_gemma":[0.0021705208,0.0007235431,0.0010069665,0.00096380856,0.00097518455,0.0012863808,0.0022385132,0.0018200739,0.005221976],"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.0003722963,0.00012532862,0.00034743905,0.00028415787,0.00013734956,0.00024050797,0.00011718756,0.2871063,0.09045721,0.04672434,0.014100157,0.5599877],"study_design_scores_gemma":[0.000018388975,0.000056025663,0.00017963364,0.000017331891,0.000021077414,0.00018807374,0.000016523874,0.9457232,0.025530979,0.024019288,0.0042143655,0.000015091],"about_ca_topic_score_codex":0.0010142052,"about_ca_topic_score_gemma":0.0015670805,"teacher_disagreement_score":0.005974734,"about_ca_system_score_codex":0.0005021445,"about_ca_system_score_gemma":0.00074517244,"threshold_uncertainty_score":0.019987524},"labels":[],"label_agreement":null},{"id":"W4312986949","doi":"10.1007/978-3-031-22390-7_27","title":"CFL: Cluster Federated Learning in Large-Scale Peer-to-Peer Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Guelph","funders":"","keywords":"Computer science; Robustness (evolution); Distributed learning; Peer-to-peer; Distributed computing; Protocol (science); Federated learning; Artificial intelligence; Theoretical computer science; Data mining; Machine learning","score_opus":0.018384792189429264,"score_gpt":0.2583233900283385,"score_spread":0.23993859783890922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312986949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004963867,0.0011636112,0.95906526,0.0005311602,0.00033182325,0.00015766051,0.0003621832,0.017283145,0.016141342],"genre_scores_gemma":[0.21545489,0.0017431049,0.7010542,0.00052726234,0.00031171198,0.00042510798,0.0020864808,0.0024806976,0.07591651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.00010515848,0.00002314473,0.00011332453,0.0002687965,0.000082762745],"domain_scores_gemma":[0.9993261,0.00020358755,0.000027606946,0.00027996334,0.00010136371,0.00006139922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008825374,0.00054120703,0.0007604206,0.00079198007,0.0010492837,0.0017215713,0.0022222744,0.0011600644,0.011386406],"category_scores_gemma":[0.0021504264,0.0003425035,0.00040141598,0.0016085788,0.00084121467,0.0031402959,0.0022285064,0.0016328426,0.003947178],"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.00027261415,0.00014389642,0.0002686071,0.00029196232,0.000034720633,0.0001398628,0.00020908393,0.05796605,0.0047265724,0.12327199,0.09460617,0.7180685],"study_design_scores_gemma":[0.000075460346,0.0001590362,0.00060835807,0.00010629545,0.000020016083,0.00055543554,0.00011496907,0.556404,0.011332412,0.23984084,0.1907212,0.00006188999],"about_ca_topic_score_codex":0.0030306603,"about_ca_topic_score_gemma":0.0028423287,"teacher_disagreement_score":0.011386406,"about_ca_system_score_codex":0.0012181719,"about_ca_system_score_gemma":0.0010947885,"threshold_uncertainty_score":0.038091302},"labels":[],"label_agreement":null},{"id":"W4312991107","doi":"10.1007/978-3-031-19842-7_16","title":"Rethinking Closed-Loop Training for Autonomous Driving","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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 Waterloo; University of Toronto","funders":"","keywords":"Closed loop; Training (meteorology); Loop (graph theory); Computer science; Control theory (sociology); Psychology; Aeronautics; Artificial intelligence; Control engineering; Engineering; Mathematics; Geography; Control (management); Meteorology","score_opus":0.021753238671766397,"score_gpt":0.22989596246453475,"score_spread":0.20814272379276835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312991107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06386783,0.0009782593,0.91160166,0.0004444986,0.0005462691,0.0000855758,0.000046585184,0.003988752,0.018440602],"genre_scores_gemma":[0.8295891,0.00039742645,0.14889565,0.00033809306,0.00012224325,0.000105022,0.000113901835,0.00038691133,0.020051591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973327,0.00004661053,0.000010536104,0.00007302947,0.00009614009,0.000040364986],"domain_scores_gemma":[0.9993375,0.00038478736,0.000024605624,0.00007784509,0.00013576049,0.000039413346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038612634,0.00036652965,0.00023931557,0.00017271329,0.0003132937,0.00070299365,0.0011896039,0.0009035927,0.0076026553],"category_scores_gemma":[0.0016383748,0.00017722408,0.00020264642,0.000089820634,0.00045967707,0.0010871907,0.0010925542,0.00094053644,0.0013229991],"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.0003698218,0.00036833747,0.00060413644,0.00025481384,0.000030234747,0.00011184399,0.0007406434,0.033224687,0.10310999,0.00768918,0.004053923,0.84944236],"study_design_scores_gemma":[0.00016036711,0.001628255,0.005665595,0.0003470197,0.00009147225,0.0005984146,0.00061479746,0.77493185,0.089097686,0.035259526,0.09148539,0.00011960922],"about_ca_topic_score_codex":0.00153092,"about_ca_topic_score_gemma":0.0015937802,"teacher_disagreement_score":0.0076026553,"about_ca_system_score_codex":0.00020483183,"about_ca_system_score_gemma":0.00030469926,"threshold_uncertainty_score":0.025433421},"labels":[],"label_agreement":null},{"id":"W4313012597","doi":"10.1007/978-3-031-20643-6_14","title":"KATKA: A KRAKEN-Like Tool with k Given at Query Time","year":2022,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"National Human Genome Research Institute","keywords":"Computer science","score_opus":0.00698868901094241,"score_gpt":0.21366641605087144,"score_spread":0.20667772703992904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313012597","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008479607,0.00036246044,0.6675118,0.0004717713,0.00029846336,0.0001856411,0.0035762056,0.31074968,0.008364317],"genre_scores_gemma":[0.26127276,0.00052122993,0.6234809,0.0012890915,0.00019598992,0.0007230428,0.008717619,0.082177475,0.02162182],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996847,0.0005776328,0.00043731154,0.000735729,0.0009850251,0.00041730487],"domain_scores_gemma":[0.9907155,0.0037836847,0.00040211465,0.0040896563,0.00065626483,0.00035273688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025294228,0.0018640794,0.001629834,0.0019930208,0.0010613686,0.00296611,0.0043501775,0.002104483,0.04320794],"category_scores_gemma":[0.014004548,0.0017060473,0.0016551787,0.0024861535,0.0020843798,0.010399777,0.0070172795,0.0026698478,0.018755317],"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.0056687673,0.00037532763,0.0039630895,0.0032772142,0.0003793385,0.00091711193,0.0018963192,0.008845383,0.058726132,0.11358256,0.22536583,0.577003],"study_design_scores_gemma":[0.0010631249,0.0005865623,0.0019166929,0.00068206235,0.00029522978,0.0021584616,0.0009879067,0.12731795,0.19005544,0.24565789,0.42851824,0.0007603896],"about_ca_topic_score_codex":0.0015196529,"about_ca_topic_score_gemma":0.0026747263,"teacher_disagreement_score":0.04320794,"about_ca_system_score_codex":0.00086924277,"about_ca_system_score_gemma":0.0013240863,"threshold_uncertainty_score":0.14454496},"labels":[],"label_agreement":null},{"id":"W4313016841","doi":"10.1007/978-3-031-20713-6_14","title":"Sensor Fusion Operators for Multimodal 2D Object Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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 Ottawa","funders":"","keywords":"Computer science; Concatenation (mathematics); Leverage (statistics); Pooling; Convolutional neural network; Sensor fusion; Artificial intelligence; Object detection; Fusion; Data mining; Pattern recognition (psychology); Computer vision","score_opus":0.01649318996735038,"score_gpt":0.2610685270858204,"score_spread":0.24457533711847002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313016841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043194303,0.0001941277,0.99397755,0.00004148848,0.000032793403,0.000019824112,0.00004903105,0.00027257833,0.0010931938],"genre_scores_gemma":[0.23486122,0.00080478046,0.752818,0.00015689172,0.00009075072,0.00015580298,0.00038612206,0.0002258558,0.010500511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997509,0.00004228159,0.00001283291,0.000050323484,0.00011716874,0.000026456066],"domain_scores_gemma":[0.999806,0.00007933409,0.000018443538,0.00003427223,0.000053255684,0.000008696224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403554,0.00079891563,0.0005618238,0.00042784776,0.00023734022,0.00054054096,0.0006253848,0.00067521585,0.0042005223],"category_scores_gemma":[0.000817745,0.00027014667,0.0006696702,0.0006955671,0.00035806437,0.0010172805,0.0011259221,0.0007031357,0.001013656],"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.00023962682,0.000088377776,0.00032712618,0.00018170296,0.0000671771,0.00014029004,0.0001346833,0.11103271,0.08443597,0.030807888,0.0064193057,0.7661251],"study_design_scores_gemma":[0.000007520696,0.00007302748,0.00051717437,0.000016491427,0.00001938519,0.00019203387,0.000038801543,0.9530214,0.019863827,0.021361107,0.004869613,0.000019616427],"about_ca_topic_score_codex":0.0010043901,"about_ca_topic_score_gemma":0.0015170064,"teacher_disagreement_score":0.0042005223,"about_ca_system_score_codex":0.00028454885,"about_ca_system_score_gemma":0.00027921732,"threshold_uncertainty_score":0.014052153},"labels":[],"label_agreement":null},{"id":"W4313023011","doi":"10.1007/978-3-031-20643-6_16","title":"Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Prefix; Intersection (aeronautics); Generalization; Connection (principal bundle); String (physics); Set (abstract data type); Bit array; Mathematics; Boolean function; Computer science; Discrete mathematics; Algorithm; Combinatorics","score_opus":0.026209781236246375,"score_gpt":0.24438124650076518,"score_spread":0.2181714652645188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313023011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043942746,0.0011008166,0.9210726,0.0016652347,0.0004135916,0.00010002419,0.00045399033,0.0014718324,0.029779164],"genre_scores_gemma":[0.73071676,0.00090929004,0.24197333,0.0013222039,0.0013021389,0.00036077955,0.00085032365,0.0012844825,0.021280607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463886,0.0014457471,0.00042810157,0.00083132874,0.0020874622,0.00056847185],"domain_scores_gemma":[0.9807735,0.010969941,0.0010273776,0.0057150144,0.0011121396,0.0004020597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031376637,0.0009304304,0.001833455,0.0015408017,0.0017317333,0.0055806474,0.002801092,0.0023640548,0.0071927183],"category_scores_gemma":[0.02308323,0.00090692815,0.0010302563,0.0040547135,0.0038600455,0.012606328,0.0074729132,0.0043516154,0.0017104285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017718284,0.00004625786,0.00030901737,0.00007841429,0.000017492122,0.0001652936,0.0002585946,0.006722207,0.0023300431,0.9517277,0.0033968354,0.034770865],"study_design_scores_gemma":[0.000008432046,0.0000131649485,0.000063519234,0.000012723706,0.000009256623,0.00015572034,0.00002436538,0.040394347,0.0016369144,0.9556079,0.0020566918,0.000016951479],"about_ca_topic_score_codex":0.00045961028,"about_ca_topic_score_gemma":0.00036613812,"teacher_disagreement_score":0.0071927183,"about_ca_system_score_codex":0.0013223309,"about_ca_system_score_gemma":0.001082626,"threshold_uncertainty_score":0.024062097},"labels":[],"label_agreement":null},{"id":"W4313035055","doi":"10.1007/978-3-031-22061-6_31","title":"MoCap Trajectory-Based Animation Synthesis and Perplexity Driven Compression","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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 Alberta","funders":"","keywords":"Perplexity; Computer science; Animation; Trajectory; Compression (physics); Computer graphics (images); Artificial intelligence; Computer vision; Language model; Astronomy","score_opus":0.01819711288147102,"score_gpt":0.2232864353498247,"score_spread":0.20508932246835368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313035055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009226467,0.0002982443,0.9679281,0.000093514034,0.0002059921,0.00012096134,0.00073131383,0.012370416,0.00902498],"genre_scores_gemma":[0.18085356,0.0005847976,0.78324574,0.00021228397,0.00014993886,0.00038144703,0.0038320976,0.0035079927,0.027232157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975175,0.000032076627,0.00001094312,0.000056654717,0.0001168517,0.000031779175],"domain_scores_gemma":[0.99955744,0.0001609837,0.000014532552,0.000085907355,0.00015572364,0.000025333862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035335822,0.001026722,0.0006833242,0.0010638209,0.00042332063,0.0009634234,0.0010690285,0.0009050955,0.027354749],"category_scores_gemma":[0.0015594095,0.000465526,0.0005276426,0.001238677,0.00032669076,0.0008669243,0.0010650494,0.0010290708,0.006437883],"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.00071475544,0.00011895937,0.000288727,0.0002702602,0.00008649477,0.00021222173,0.00011542831,0.085538015,0.08704152,0.014804604,0.017627666,0.7931813],"study_design_scores_gemma":[0.00004925802,0.000108172964,0.00038997794,0.000042181986,0.000031080217,0.00021611631,0.000043883625,0.90285254,0.07286688,0.008339225,0.015029633,0.000031004132],"about_ca_topic_score_codex":0.002970781,"about_ca_topic_score_gemma":0.004198833,"teacher_disagreement_score":0.027354749,"about_ca_system_score_codex":0.0004459069,"about_ca_system_score_gemma":0.0004867043,"threshold_uncertainty_score":0.09151077},"labels":[],"label_agreement":null},{"id":"W4313040688","doi":"10.1007/978-3-031-19745-1_11","title":"Novel Feature Extraction Methods to Detect Age from Handwriting","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Handwriting; Feature extraction; Computer science; Artificial intelligence; Pattern recognition (psychology); Extraction (chemistry); Chromatography; Chemistry","score_opus":0.031047056089029416,"score_gpt":0.31687526766023316,"score_spread":0.28582821157120375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313040688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041068006,0.003187363,0.94880533,0.0001301122,0.00048017365,0.00011147962,0.0007042766,0.0029823307,0.0025308141],"genre_scores_gemma":[0.19328666,0.002369692,0.7791582,0.00017234984,0.00045817398,0.00021531139,0.0019460495,0.00030156499,0.022091983],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970955,0.00001631615,0.000026969032,0.00008901916,0.00012248379,0.000035666682],"domain_scores_gemma":[0.999395,0.00013459618,0.000084375264,0.000063533036,0.00029273116,0.000029827099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003100581,0.0009314088,0.00096502603,0.0015051765,0.00025210474,0.00060044223,0.0008544416,0.00060425885,0.0023269178],"category_scores_gemma":[0.0006230162,0.00031266588,0.0006067806,0.0013845079,0.0001878764,0.0009072912,0.00046593245,0.00056462357,0.0023017314],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016161193,0.000089683774,0.0013238876,0.00015817849,0.00004585621,0.00013543473,0.000044333476,0.0016881918,0.17563005,0.00046147357,0.0041653602,0.81609595],"study_design_scores_gemma":[0.00008925775,0.00064194825,0.040167943,0.00009867023,0.00037641273,0.0035015997,0.00019840997,0.48001578,0.4354314,0.002456483,0.03685589,0.00016619991],"about_ca_topic_score_codex":0.0012245732,"about_ca_topic_score_gemma":0.0025260672,"teacher_disagreement_score":0.0023269178,"about_ca_system_score_codex":0.00022693818,"about_ca_system_score_gemma":0.0002960096,"threshold_uncertainty_score":0.0077842474},"labels":[],"label_agreement":null},{"id":"W4313071422","doi":"10.1007/978-3-031-22832-2","title":"Web and Internet Economics","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Transportation Planning and Optimization","field":"Social Sciences","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 Toronto","funders":"","keywords":"Computer science; The Internet; World Wide Web; Data science","score_opus":0.012784317715647755,"score_gpt":0.24934398859850188,"score_spread":0.23655967088285412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313071422","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005003039,0.050258506,0.00950774,0.015919462,0.0011349963,0.0000201444,0.00020357409,0.00011576118,0.9178369],"genre_scores_gemma":[0.1324129,0.057099555,0.00279009,0.003240826,0.0034474113,0.000066923116,0.00023887547,0.00020125038,0.8005022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998747,0.000037225935,0.0000026574971,0.000015090233,0.000055309123,0.00001498803],"domain_scores_gemma":[0.9997961,0.000109873974,0.000015023686,0.000024441097,0.00003138709,0.00002325441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020164376,0.00054320914,0.0003864913,0.0016380847,0.0006095367,0.0026481068,0.0003273361,0.0013829317,0.044129267],"category_scores_gemma":[0.0008910618,0.00027804394,0.00018998134,0.0025748413,0.0011421117,0.0044487217,0.0006466195,0.0015583112,0.00873101],"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.000011672179,0.000049534312,0.00024054953,0.000067725596,0.000009638649,0.000045926714,0.00008124786,0.0011675092,0.0001257566,0.73630035,0.18784961,0.07405059],"study_design_scores_gemma":[0.0000053968656,0.000007437482,0.0006382003,0.00012771274,0.000006475226,0.00011352065,0.000120953126,0.0015179578,0.000088895606,0.68955034,0.3078181,0.0000050838057],"about_ca_topic_score_codex":0.0026652757,"about_ca_topic_score_gemma":0.003908427,"teacher_disagreement_score":0.044129267,"about_ca_system_score_codex":0.0014388957,"about_ca_system_score_gemma":0.0005688637,"threshold_uncertainty_score":0.14762717},"labels":[],"label_agreement":null},{"id":"W4313128548","doi":"10.1007/978-3-031-23690-7_2","title":"DKS-PKI: A Distributed Key Server Architecture for Public Key Infrastructure","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Public key infrastructure; Certificate authority; Computer science; Public-key cryptography; Revocation list; Public key certificate; Root certificate; Computer security; Implicit certificate; Computer network; Certificate; Key (lock); Encryption","score_opus":0.015670505110888678,"score_gpt":0.230875222144177,"score_spread":0.2152047170332883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313128548","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.0080972565,0.001961289,0.87861586,0.0009830603,0.0008130095,0.00035894557,0.0012076629,0.05072157,0.057241347],"genre_scores_gemma":[0.2671143,0.0039138063,0.58218366,0.00077881635,0.00045543816,0.0005694492,0.0051211733,0.0041776025,0.1356858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927694,0.00009094649,0.000055315926,0.00011298942,0.00034772969,0.00011618508],"domain_scores_gemma":[0.99939704,0.00008655793,0.0000377809,0.00024390894,0.00015482209,0.00007980008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079448626,0.0008042446,0.00065546297,0.0010445735,0.0008745739,0.0027603498,0.0023673174,0.001108698,0.014720756],"category_scores_gemma":[0.0012848446,0.0008131701,0.00046324386,0.0018479009,0.0011153702,0.0053169797,0.0023554785,0.0027714823,0.013115883],"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.0008379981,0.00027723872,0.0006266935,0.00096630317,0.00006982508,0.0002319591,0.0004309304,0.011291369,0.041416537,0.40359285,0.14241748,0.39784086],"study_design_scores_gemma":[0.00022280145,0.00026197056,0.00067986414,0.00014201168,0.00010836285,0.0010291885,0.00014427803,0.11908227,0.07447946,0.14767545,0.6560267,0.00014757783],"about_ca_topic_score_codex":0.00096588646,"about_ca_topic_score_gemma":0.00090800336,"teacher_disagreement_score":0.014720756,"about_ca_system_score_codex":0.0015782478,"about_ca_system_score_gemma":0.0017232775,"threshold_uncertainty_score":0.049245894},"labels":[],"label_agreement":null},{"id":"W4313148067","doi":"10.1007/978-3-031-20980-2_21","title":"CRIM’s Speech Recognition System for OpenASR21 Evaluation with Conformer and Voice Activity Detector Embeddings","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Speech recognition; Computer science; Hidden Markov model; Mel-frequency cepstrum; Word error rate; Sentence; Artificial intelligence; Language model; Natural language processing; Pattern recognition (psychology); Feature extraction","score_opus":0.04380244650141289,"score_gpt":0.27454648629349643,"score_spread":0.23074403979208352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313148067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1969144,0.0039004113,0.36418074,0.0011517049,0.0045887087,0.003041306,0.055669997,0.30113685,0.069415845],"genre_scores_gemma":[0.3020822,0.0009843989,0.39878014,0.0009339107,0.0004558463,0.0027288224,0.20339322,0.012295327,0.0783462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648476,0.00086477434,0.00030153105,0.0008113428,0.0012518811,0.00028570747],"domain_scores_gemma":[0.99689263,0.0006175333,0.000081386184,0.00067862094,0.0014952081,0.00023462267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042520626,0.0024174075,0.0015182463,0.0018497918,0.001055196,0.0021267708,0.0022350661,0.002083519,0.024750678],"category_scores_gemma":[0.0054482906,0.000636573,0.00093872804,0.0010899444,0.0004750947,0.0019145008,0.0020387725,0.0013968319,0.0330814],"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.0027681168,0.0007242631,0.0023497702,0.0007792007,0.00038853913,0.0005855235,0.0002570503,0.007412699,0.07175879,0.002112895,0.20829533,0.7025677],"study_design_scores_gemma":[0.0013951027,0.0029227037,0.017923068,0.00022078815,0.00058522896,0.0024332602,0.00082708354,0.30185682,0.38796124,0.0036663637,0.2797527,0.00045570076],"about_ca_topic_score_codex":0.009911119,"about_ca_topic_score_gemma":0.010583987,"teacher_disagreement_score":0.024750678,"about_ca_system_score_codex":0.00087814656,"about_ca_system_score_gemma":0.0014756037,"threshold_uncertainty_score":0.082799256},"labels":[],"label_agreement":null},{"id":"W4313158210","doi":"10.1007/978-3-031-22695-3_54","title":"Enhancing the Speed of Hierarchical Learning Automata by Ordering the Actions - A Pioneering Approach","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Carleton University","funders":"","keywords":"Computer science; Automaton; Learning automata; Tree (set theory); Hierarchical organization; Artificial intelligence; Theoretical computer science; Action (physics); Machine learning; Algorithm; Mathematics","score_opus":0.013969571760685643,"score_gpt":0.244148616925046,"score_spread":0.23017904516436036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313158210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013916019,0.000750495,0.9723532,0.00026600467,0.0002035058,0.00007366324,0.00010253633,0.0042920806,0.0080425],"genre_scores_gemma":[0.33253416,0.0009659598,0.6563255,0.00031618372,0.0001657942,0.00019363023,0.00025348342,0.0007722614,0.008472965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884146,0.00024405318,0.00009000333,0.00032923135,0.0003689897,0.00012622336],"domain_scores_gemma":[0.9937109,0.0036059304,0.00017046517,0.0017114541,0.0006516668,0.00014963729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013347899,0.0011426662,0.0012253416,0.0009270448,0.00069521985,0.0015840598,0.0032809617,0.0014881585,0.008270968],"category_scores_gemma":[0.0080179125,0.0009832263,0.0009929906,0.0012287579,0.0013541747,0.0052320044,0.0019871357,0.0032288805,0.0030120942],"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.0004875405,0.00024523048,0.00071844907,0.00059041026,0.00007193129,0.00006777177,0.00025575838,0.20474458,0.04425265,0.19000804,0.0065512927,0.55200636],"study_design_scores_gemma":[0.00004174034,0.000107722815,0.00011715638,0.000028819391,0.000036646823,0.000049107384,0.000028296954,0.8490347,0.021008654,0.12181538,0.007700725,0.000031076703],"about_ca_topic_score_codex":0.003850027,"about_ca_topic_score_gemma":0.004424566,"teacher_disagreement_score":0.008270968,"about_ca_system_score_codex":0.0013416673,"about_ca_system_score_gemma":0.001583446,"threshold_uncertainty_score":0.027669191},"labels":[],"label_agreement":null},{"id":"W4313173247","doi":"10.1007/978-3-031-19842-7_24","title":"OPD: Single-View 3D Openable Part Detection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Task (project management); Object (grammar); Computer vision; Generalization; Motion (physics); Image (mathematics); Object detection; Articulation (sociology); RGB color model; Architecture; Pattern recognition (psychology); Mathematics","score_opus":0.030778925098217717,"score_gpt":0.23975212351383232,"score_spread":0.2089731984156146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313173247","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.0014973338,0.00068162894,0.9597438,0.000099073426,0.00025321636,0.0001154763,0.0026861222,0.028432447,0.0064908457],"genre_scores_gemma":[0.03243534,0.0011247302,0.9290635,0.0004145029,0.00012661594,0.00022251434,0.010691562,0.0051853624,0.02073596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.000034352815,0.000026586791,0.00018521168,0.00052864547,0.0000782148],"domain_scores_gemma":[0.9995702,0.00009533944,0.000021446003,0.0001531015,0.00011662744,0.000043234537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049048156,0.002240395,0.0015148144,0.0018371956,0.00035980128,0.0017835431,0.003216929,0.001393219,0.04361645],"category_scores_gemma":[0.0010019438,0.0014571657,0.0013716442,0.0014234397,0.00056578155,0.0017804514,0.0032348204,0.0011046681,0.025282424],"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.0002151525,0.000057476827,0.0003787459,0.00031998314,0.000073829295,0.00014680398,0.000051634437,0.006520196,0.043473132,0.003844106,0.09162436,0.8532946],"study_design_scores_gemma":[0.00008184378,0.00026194018,0.0030297744,0.00020632979,0.000093265866,0.0025794927,0.00009334257,0.5327953,0.13270555,0.025461532,0.30247468,0.00021690507],"about_ca_topic_score_codex":0.0027132097,"about_ca_topic_score_gemma":0.005204986,"teacher_disagreement_score":0.04361645,"about_ca_system_score_codex":0.0003938105,"about_ca_system_score_gemma":0.00076208985,"threshold_uncertainty_score":0.14591151},"labels":[],"label_agreement":null},{"id":"W4313342923","doi":"10.1007/978-3-031-22105-7_41","title":"The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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 Victoria; Toronto Metropolitan University","funders":"","keywords":"Square tiling; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Mathematics; Path (computing); Graph; Hamiltonian path problem; Discrete mathematics; Grid; Square (algebra); Topology (electrical circuits); Geometry; Computer science","score_opus":0.013598181428121399,"score_gpt":0.23224372402874752,"score_spread":0.21864554260062613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313342923","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.6391969,0.0011920518,0.14229557,0.0009995988,0.0004158246,0.000205532,0.0014619343,0.0007859027,0.21344669],"genre_scores_gemma":[0.92790395,0.00085987593,0.038723398,0.00028229077,0.00009166806,0.00017031934,0.000988448,0.00019750757,0.030782515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989915,0.00001705953,0.000004349721,0.00003573453,0.000021966707,0.000021767884],"domain_scores_gemma":[0.9995881,0.00019351939,0.00006111104,0.000045964047,0.000050572657,0.000060821378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096084084,0.00032901778,0.00036472597,0.0007759453,0.0010998626,0.0012898331,0.00054054434,0.00076750596,0.010612147],"category_scores_gemma":[0.0008128692,0.00042627694,0.00041781913,0.0012135092,0.0009846485,0.0015008543,0.0007218107,0.00080488203,0.00089922274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020141687,0.00005012778,0.0007919716,0.00042384735,0.00003695697,0.0004614732,0.00059596065,0.012000302,0.011607168,0.9158777,0.012630164,0.04532295],"study_design_scores_gemma":[0.000051913183,0.00006460324,0.0016809723,0.000040527655,0.000036309117,0.00046010147,0.0003375621,0.023077907,0.0027496181,0.9573856,0.014092874,0.000022055821],"about_ca_topic_score_codex":0.0015557648,"about_ca_topic_score_gemma":0.0022369055,"teacher_disagreement_score":0.010612147,"about_ca_system_score_codex":0.0004376159,"about_ca_system_score_gemma":0.00041741424,"threshold_uncertainty_score":0.035501182},"labels":[],"label_agreement":null},{"id":"W4313343015","doi":"10.1007/978-3-031-22105-7_38","title":"An Evolving Network Model from Clique Extension","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"","keywords":"Frustum; Clique; Computer science; Extension (predicate logic); Set (abstract data type); Clique problem; Theoretical computer science; Graph; Mathematics; Combinatorics; Chordal graph; Geometry","score_opus":0.015913068523936768,"score_gpt":0.2610833883358573,"score_spread":0.24517031981192056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06162605,0.0007288836,0.9104268,0.0014075228,0.00014356402,0.00009591832,0.0007086043,0.00021476584,0.024647925],"genre_scores_gemma":[0.77316386,0.0017509239,0.15500645,0.00050934625,0.0004616831,0.00046060103,0.0012337413,0.0003336094,0.06707991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955875,0.00018782142,0.00001053338,0.00011803495,0.000079227306,0.000045657107],"domain_scores_gemma":[0.9971552,0.0019360326,0.00023820567,0.00018100005,0.00023084998,0.00025871582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506328,0.0006524324,0.0011066989,0.0011974804,0.00083108695,0.0013701075,0.00312556,0.0020827695,0.0066711395],"category_scores_gemma":[0.0059714196,0.00066936034,0.0010006384,0.001703187,0.0013116641,0.0030909611,0.0016201485,0.0024583112,0.0006796787],"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.000048374244,0.000051643132,0.00045845375,0.000063129344,0.000032129712,0.00019306972,0.00016757927,0.43474075,0.0007730706,0.54636306,0.0043329056,0.0127758365],"study_design_scores_gemma":[0.000006954862,0.000008144128,0.00007872452,0.0000056063354,0.000007182268,0.000035547873,0.0000106868,0.894226,0.000042261836,0.10441542,0.00115769,0.0000057654925],"about_ca_topic_score_codex":0.006742447,"about_ca_topic_score_gemma":0.0061082263,"teacher_disagreement_score":0.006742447,"about_ca_system_score_codex":0.0014638654,"about_ca_system_score_gemma":0.00076032133,"threshold_uncertainty_score":0.022317171},"labels":[],"label_agreement":null},{"id":"W4313343183","doi":"10.1007/978-3-031-22105-7_40","title":"Two-Stage BP Maximization Under p-matroid Constraint","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Constraint (computer-aided design); Mathematics; Monotonic function; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Mathematical analysis","score_opus":0.024827609823504546,"score_gpt":0.2528371644592893,"score_spread":0.22800955463578473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014338861,0.00029857957,0.96809155,0.00056965434,0.000096842654,0.00013320832,0.00036827798,0.00054015475,0.01556289],"genre_scores_gemma":[0.32938313,0.00049346295,0.634054,0.0004194869,0.000296307,0.00038573876,0.0009093475,0.00074334274,0.033315152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878377,0.00035581813,0.000049041013,0.00029657624,0.0002587297,0.0002560766],"domain_scores_gemma":[0.9983297,0.00089630135,0.000075221156,0.00029497748,0.00025178553,0.00015203902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400755,0.0011291153,0.0016962247,0.00059112976,0.0008114877,0.0018579918,0.0031964383,0.002107642,0.00944846],"category_scores_gemma":[0.0038132912,0.0010668102,0.001237216,0.0016345693,0.0008582388,0.0035030374,0.002816968,0.0022461785,0.0021371453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011396736,0.0005256927,0.0012741106,0.0013620025,0.00021695273,0.00084855413,0.00043840075,0.28484726,0.03922759,0.33664897,0.037326816,0.296144],"study_design_scores_gemma":[0.00006118982,0.000103395636,0.00041501204,0.000031582793,0.0000428336,0.00025212235,0.000041725565,0.8307702,0.0077751814,0.15625161,0.004223316,0.00003175258],"about_ca_topic_score_codex":0.00212087,"about_ca_topic_score_gemma":0.0029432701,"teacher_disagreement_score":0.00944846,"about_ca_system_score_codex":0.0010979135,"about_ca_system_score_gemma":0.00202244,"threshold_uncertainty_score":0.031608284},"labels":[],"label_agreement":null},{"id":"W4313343184","doi":"10.1007/978-3-031-23028-8_8","title":"Sentiment Analysis from User Reviews Using a Hybrid Generative-Discriminative HMM-SVM Approach","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Concordia University","funders":"","keywords":"Discriminative model; Hidden Markov model; Computer science; Generative grammar; Latent Dirichlet allocation; Artificial intelligence; Support vector machine; Sentiment analysis; Machine learning; Task (project management); Generative model; Context (archaeology); Process (computing); Natural language processing; Topic model; Engineering","score_opus":0.05459002356564102,"score_gpt":0.2907508150165164,"score_spread":0.23616079145087537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07859092,0.0010024206,0.911391,0.00028738048,0.0003001531,0.00013632976,0.00093393464,0.00417511,0.0031827022],"genre_scores_gemma":[0.76097614,0.0008418919,0.21735287,0.00022024316,0.00047207938,0.00020792629,0.0042857104,0.00043173425,0.015211434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994992,0.00011176236,0.00003668181,0.00012926314,0.00013951176,0.00008358282],"domain_scores_gemma":[0.99930036,0.0002441795,0.000049569673,0.00006635408,0.00029624667,0.00004332199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067442184,0.0008683751,0.0011435454,0.0009771315,0.00040367525,0.00077069516,0.00056856533,0.000693237,0.0025277692],"category_scores_gemma":[0.0012616045,0.00035875235,0.0011880593,0.00090571225,0.00016737929,0.0007437801,0.000610327,0.00086569885,0.004021122],"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.0006746767,0.0004043463,0.008328734,0.00027716416,0.00030474048,0.00023853088,0.00016620377,0.032649014,0.097363815,0.0013784361,0.010475584,0.84773874],"study_design_scores_gemma":[0.00001868533,0.00014184845,0.0064152074,0.000017401551,0.00011297168,0.00016290497,0.00005950323,0.9762305,0.013013059,0.0013905717,0.002408625,0.000028644132],"about_ca_topic_score_codex":0.0027127413,"about_ca_topic_score_gemma":0.0047877952,"teacher_disagreement_score":0.0027127413,"about_ca_system_score_codex":0.0002674841,"about_ca_system_score_gemma":0.0004698882,"threshold_uncertainty_score":0.00845623},"labels":[],"label_agreement":null},{"id":"W4313343218","doi":"10.1007/978-3-662-66491-9","title":"Transactions on Computational Science XXXIX","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","field":"Social Sciences","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 Calgary","funders":"Bulgarian Academy of Sciences; Sungkyunkwan University; Monash University; Nanyang Technological University; Université de Limoges; University of Reading; Russian Academy of Sciences; King Fahd University of Petroleum and Minerals; Queen's University Belfast; University of Western Macedonia; Università degli Studi di Perugia; Soongsil University; Hanyang University; University of Southern California; Západočeská Univerzita v Plzni; Institute of Information Science, Academia Sinica; Cairo University; Academia Sinica; Queen's University; Ohio State University; Universidad de Cantabria; York University","keywords":"Computer science","score_opus":0.018272171135250453,"score_gpt":0.28379100818070657,"score_spread":0.2655188370454561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343218","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00800977,0.046032254,0.22237478,0.032439273,0.05148393,0.00023590881,0.0049289423,0.0023524505,0.63214266],"genre_scores_gemma":[0.049593028,0.028197302,0.048691962,0.0024227088,0.008438184,0.00036135502,0.0046913796,0.0015233244,0.8560807],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871576,0.00029163025,0.0000871396,0.0002110238,0.000610751,0.000083751],"domain_scores_gemma":[0.9977209,0.00081672217,0.000062032006,0.0007338278,0.0005247728,0.00014172532],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015138455,0.001090619,0.0016467237,0.0011931151,0.0008675767,0.0049093873,0.0010234388,0.0012275133,0.2095809],"category_scores_gemma":[0.0059173713,0.00042676242,0.0007516136,0.0030702732,0.001369951,0.0025733404,0.002402003,0.0027128097,0.07556108],"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.00008027661,0.00006638006,0.0006119976,0.00040087427,0.000056914705,0.00007140181,0.00008300057,0.0033210437,0.0008561091,0.10338885,0.56166357,0.32939953],"study_design_scores_gemma":[0.000033143293,0.00003427049,0.0008146262,0.0002039442,0.000040427985,0.00017023123,0.00011288289,0.014075231,0.00057328446,0.1294248,0.8545035,0.000013737899],"about_ca_topic_score_codex":0.0027027952,"about_ca_topic_score_gemma":0.002652884,"teacher_disagreement_score":0.7904191,"about_ca_system_score_codex":0.0014354507,"about_ca_system_score_gemma":0.001759848,"threshold_uncertainty_score":0.701118},"labels":[],"label_agreement":null},{"id":"W4313343225","doi":"10.1007/978-3-031-23028-8","title":"Structural, Syntactic, and Statistical Pattern Recognition","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Pattern recognition (psychology); Sketch recognition; Speech recognition; Gesture recognition","score_opus":0.024316487183609348,"score_gpt":0.26366775665991143,"score_spread":0.2393512694763021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343225","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015052444,0.015050034,0.91980946,0.0014947581,0.000890066,0.00009077209,0.001344094,0.006435042,0.039833292],"genre_scores_gemma":[0.1698773,0.015042729,0.7417922,0.00054159993,0.0013531446,0.0002585034,0.0065132133,0.0013041062,0.06331724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948645,0.0000705964,0.00005650281,0.000109345485,0.00023524144,0.000041906595],"domain_scores_gemma":[0.9988827,0.00044057384,0.000091491085,0.0002451564,0.00030231924,0.000037738566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006583347,0.00090142014,0.0007459291,0.0019216146,0.0003391367,0.0017808684,0.0010444685,0.00055179844,0.009144901],"category_scores_gemma":[0.0027548857,0.00039715137,0.00083816465,0.0025988806,0.00093943125,0.002327014,0.00080372737,0.00086877943,0.00882948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006316669,0.000047168836,0.0008175426,0.00029828685,0.000026741918,0.000094142146,0.00004629208,0.0028895258,0.01781612,0.029255971,0.020136004,0.928509],"study_design_scores_gemma":[0.000036032226,0.00039150548,0.00925071,0.00027338002,0.00016271313,0.0028845374,0.00025883174,0.2992339,0.069146,0.45354387,0.16469221,0.00012618543],"about_ca_topic_score_codex":0.0010628651,"about_ca_topic_score_gemma":0.0015870793,"teacher_disagreement_score":0.009144901,"about_ca_system_score_codex":0.00037251305,"about_ca_system_score_gemma":0.00076458266,"threshold_uncertainty_score":0.03059274},"labels":[],"label_agreement":null},{"id":"W4313343246","doi":"10.1007/978-3-031-23028-8_26","title":"Improved Training for 3D Point Cloud Classification","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary Sciences","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":"Concordia University","funders":"","keywords":"Computer science; Point cloud; Artificial intelligence; Voxel; Code (set theory); Point (geometry); Machine learning; Data mining; Set (abstract data type)","score_opus":0.05196929008326432,"score_gpt":0.24357130819114664,"score_spread":0.19160201810788233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022028811,0.00055912964,0.96283674,0.00020434633,0.0002277158,0.0000990667,0.00091767544,0.01077152,0.0023550545],"genre_scores_gemma":[0.18849578,0.00041722914,0.78905326,0.00034550315,0.0001338289,0.0002369069,0.005920199,0.00078849803,0.014608772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992016,0.00009547877,0.000043257933,0.00021933085,0.00032211762,0.00011832542],"domain_scores_gemma":[0.99836785,0.00044719075,0.000055574736,0.0005031402,0.0005677046,0.000058596263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084541895,0.0012582169,0.0011991108,0.0011415564,0.000629695,0.0009704743,0.0028301494,0.001882685,0.013615987],"category_scores_gemma":[0.0025417227,0.0007759354,0.001204061,0.0018655342,0.0003798054,0.0015108738,0.001930168,0.0017832469,0.010292152],"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.0001986011,0.00013079385,0.0011279442,0.00008722309,0.000050866103,0.00006816043,0.000042567473,0.050537515,0.027486987,0.0011291668,0.013290521,0.90584964],"study_design_scores_gemma":[0.0000108738595,0.00004074395,0.001012798,0.000013720608,0.000016975278,0.00007703191,0.000017361603,0.9819842,0.012419848,0.0013224585,0.0030723694,0.000011682203],"about_ca_topic_score_codex":0.013774323,"about_ca_topic_score_gemma":0.01708615,"teacher_disagreement_score":0.013774323,"about_ca_system_score_codex":0.0005561204,"about_ca_system_score_gemma":0.0010953143,"threshold_uncertainty_score":0.04555005},"labels":[],"label_agreement":null},{"id":"W4313343280","doi":"10.1007/978-3-031-23028-8_29","title":"Refining AttnGAN Using Attention on Attention Network","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Architecture; Relation (database); Function (biology); Artificial intelligence; Network architecture; Attention network; State (computer science); Mode (computer interface); Image (mathematics); Natural language processing; Data mining; Human–computer interaction; Programming language","score_opus":0.027820712809457675,"score_gpt":0.28309235193141985,"score_spread":0.25527163912196216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059169907,0.00093462353,0.9143053,0.00030447147,0.00029843187,0.00013374297,0.00027974322,0.007372013,0.017201606],"genre_scores_gemma":[0.676566,0.00044423604,0.289207,0.00034514783,0.0001315162,0.00008453598,0.0011191485,0.0012969424,0.030805428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937314,0.00010091995,0.000025629623,0.00019598893,0.00016794338,0.00013643599],"domain_scores_gemma":[0.9991393,0.00026540947,0.000039425526,0.0002128273,0.00029370532,0.0000492548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007721128,0.0010216399,0.0010735671,0.001139782,0.0008865952,0.0009773048,0.0012140591,0.00094975403,0.01053005],"category_scores_gemma":[0.0023499192,0.0004013188,0.0007368104,0.00084361446,0.00053603615,0.0023682634,0.0013052573,0.0014462658,0.0020785886],"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.00053597504,0.00020239023,0.0023781809,0.00013083071,0.00006595736,0.00021993738,0.00013059497,0.087260015,0.028547976,0.019383915,0.0115060285,0.8496382],"study_design_scores_gemma":[0.000018317989,0.000066620014,0.000761505,0.000015174565,0.000049724556,0.00007668334,0.00004928709,0.9693925,0.0104637435,0.014691286,0.004400399,0.000014711957],"about_ca_topic_score_codex":0.015341019,"about_ca_topic_score_gemma":0.018355593,"teacher_disagreement_score":0.015341019,"about_ca_system_score_codex":0.0010107403,"about_ca_system_score_gemma":0.001100396,"threshold_uncertainty_score":0.035226524},"labels":[],"label_agreement":null},{"id":"W4313343284","doi":"10.1007/978-3-031-23028-8_6","title":"Review of Handwriting Analysis for Predicting Personality Traits","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Handwriting; Computer science; Point (geometry); Process (computing); Data science; Artificial intelligence; Artificial neural network; Data mining; Machine learning; Information retrieval","score_opus":0.030487248102765208,"score_gpt":0.2855566614293807,"score_spread":0.2550694133266155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343284","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006569469,0.99335206,0.0033014975,0.0004020404,0.0005464918,0.000020392123,0.00023765997,0.00008082296,0.0014020689],"genre_scores_gemma":[0.0072700335,0.97752905,0.0077385777,0.0008737833,0.0017148552,0.000051164243,0.00080475846,0.000045113717,0.003972702],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9992035,0.000112274574,0.00012244142,0.00027530539,0.00025553955,0.00003099316],"domain_scores_gemma":[0.99593097,0.002196722,0.00029764549,0.00014731949,0.00132627,0.00010102714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774512,0.0011923261,0.0018992237,0.004061175,0.0002343299,0.0015093675,0.0016728744,0.00095610484,0.003503913],"category_scores_gemma":[0.003775227,0.00053859793,0.00084276404,0.004316952,0.00041566312,0.0013165302,0.00050682476,0.0008885903,0.0036897298],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076284916,0.00006309879,0.0009055205,0.0067324867,0.00020811,0.0000658958,0.000025671488,0.000308379,0.0016434534,0.0004506215,0.021150297,0.96837026],"study_design_scores_gemma":[0.000059464688,0.00075257383,0.022844994,0.013221076,0.001851756,0.003028816,0.00017468697,0.0039789556,0.010193288,0.0031613598,0.94051075,0.00022223839],"about_ca_topic_score_codex":0.003102138,"about_ca_topic_score_gemma":0.004025236,"teacher_disagreement_score":0.004061175,"about_ca_system_score_codex":0.00042953552,"about_ca_system_score_gemma":0.0011124404,"threshold_uncertainty_score":0.01172179},"labels":[],"label_agreement":null},{"id":"W4313343287","doi":"10.1007/978-3-031-23028-8_10","title":"A New Preprocessing Method for Measuring Image Visual Quality Robust to Rotation and Spatial Shifts","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Artificial intelligence; Computer vision; Preprocessor; Cartesian coordinate system; Computer science; Fast Fourier transform; Invariant (physics); Rotation (mathematics); Pattern recognition (psychology); Mathematics; Algorithm; Geometry","score_opus":0.06366449290216145,"score_gpt":0.368739703572455,"score_spread":0.30507521067029353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343287","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.0072962125,0.0006565389,0.98864883,0.000073162206,0.00015977655,0.000110586414,0.00017188766,0.0015475483,0.001335446],"genre_scores_gemma":[0.04810774,0.0007268175,0.94453734,0.00011283551,0.00012994437,0.00015025442,0.0005213442,0.00037018655,0.005343536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988527,0.00009203475,0.000061909064,0.0002330671,0.0007025584,0.000057686226],"domain_scores_gemma":[0.99798894,0.00041873625,0.00019851957,0.0002630042,0.0010556027,0.000075141135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007598461,0.0009778771,0.0010609814,0.0025280938,0.0004485118,0.0011901315,0.0012571602,0.0009250706,0.0039701066],"category_scores_gemma":[0.0018013511,0.00058900664,0.0009490439,0.002148842,0.0007606945,0.0014292581,0.0009052835,0.0011309815,0.0017245814],"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.0002865349,0.0001048231,0.0008724344,0.0004848485,0.00011598201,0.00011213513,0.00009590813,0.0034995042,0.48562253,0.0026986708,0.0043675774,0.5017391],"study_design_scores_gemma":[0.000091868395,0.000713069,0.014532624,0.000088230256,0.00043659424,0.002532554,0.0001231736,0.24810782,0.6888952,0.0034078236,0.040810123,0.00026087955],"about_ca_topic_score_codex":0.0015307465,"about_ca_topic_score_gemma":0.0027301474,"teacher_disagreement_score":0.0039701066,"about_ca_system_score_codex":0.00067323155,"about_ca_system_score_gemma":0.0007320016,"threshold_uncertainty_score":0.013281345},"labels":[],"label_agreement":null},{"id":"W4313343334","doi":"10.1007/978-3-031-23028-8_4","title":"Interactive Generalized Dirichlet Mixture Allocation Model","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Latent Dirichlet allocation; Computer science; Inference; Topic model; Dirichlet distribution; Task (project management); Artificial intelligence; Hierarchical Dirichlet process; Machine learning; Prior probability; Data mining; Mathematics","score_opus":0.021942706797824202,"score_gpt":0.2639456888059402,"score_spread":0.242002982008116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343334","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.00424453,0.00090053934,0.9823397,0.00038147965,0.0001751876,0.00006584431,0.00059326494,0.0014155493,0.009883895],"genre_scores_gemma":[0.32018486,0.0023247956,0.5814515,0.0010243386,0.00079993764,0.0009244276,0.0052277627,0.0019272275,0.086135216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997591,0.001263527,0.000077539305,0.0005196182,0.00033247765,0.0002157782],"domain_scores_gemma":[0.9973385,0.0017701694,0.00007611803,0.00048717234,0.00022599855,0.00010208551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026337786,0.001232685,0.0020863584,0.0013209841,0.00097637874,0.0030476046,0.0037141384,0.002393066,0.01687128],"category_scores_gemma":[0.0069450024,0.0011896845,0.0020098188,0.0020908983,0.0013016267,0.0026842311,0.0032641976,0.0031407764,0.009326185],"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.00060198846,0.00021997803,0.0011344403,0.0003570591,0.00035376535,0.00039392564,0.0005080762,0.31515872,0.0040121046,0.3943905,0.037058778,0.24581058],"study_design_scores_gemma":[0.000037263544,0.000022499908,0.00024273753,0.000029311459,0.00006456013,0.00015585046,0.000035165765,0.8415373,0.0012268407,0.14223664,0.014375786,0.000036143043],"about_ca_topic_score_codex":0.0046617915,"about_ca_topic_score_gemma":0.0056910557,"teacher_disagreement_score":0.01687128,"about_ca_system_score_codex":0.001382929,"about_ca_system_score_gemma":0.0012513829,"threshold_uncertainty_score":0.056440055},"labels":[],"label_agreement":null},{"id":"W4313343335","doi":"10.1007/978-3-031-23028-8_12","title":"Self-supervised Out-of-Distribution Detection with Dynamic Latent Scale GAN","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Latent variable; Computer science; Hyperparameter; Probabilistic latent semantic analysis; Latent variable model; Algorithm; Pattern recognition (psychology); Artificial intelligence","score_opus":0.008967574715919288,"score_gpt":0.2227839771929546,"score_spread":0.21381640247703532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343335","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.0072846874,0.00023607946,0.9894561,0.00012579394,0.00006204531,0.000026529347,0.000083553685,0.0018028477,0.0009224116],"genre_scores_gemma":[0.49151322,0.0004180443,0.49334696,0.0006367437,0.00024217274,0.00016590922,0.0016007267,0.0011102147,0.010966075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989874,0.0002843473,0.000036869336,0.0003461639,0.00022073848,0.00012440911],"domain_scores_gemma":[0.9982339,0.00085404265,0.00011990142,0.0004330439,0.0002877976,0.00007131688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015346806,0.0011390715,0.0019322876,0.0006353484,0.00028867193,0.001046472,0.002332782,0.0014790857,0.0018479862],"category_scores_gemma":[0.0035233584,0.00075136614,0.0010593977,0.0008495479,0.0007048683,0.0015605355,0.0018689957,0.0020502526,0.0014980457],"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.00043086286,0.00025807036,0.0024147811,0.00018914045,0.00027404173,0.00016293985,0.00010804014,0.23985727,0.0230844,0.014050953,0.016888604,0.70228094],"study_design_scores_gemma":[0.0000041999183,0.000013889934,0.0001791087,0.0000035828625,0.0000070230835,0.000050218026,0.000003585084,0.9941977,0.001409896,0.0037123729,0.0004135213,0.000004988069],"about_ca_topic_score_codex":0.0014930598,"about_ca_topic_score_gemma":0.0032756918,"teacher_disagreement_score":0.002332782,"about_ca_system_score_codex":0.00058672734,"about_ca_system_score_gemma":0.00058921974,"threshold_uncertainty_score":0.008116305},"labels":[],"label_agreement":null},{"id":"W4313343362","doi":"10.1007/978-3-662-66544-2","title":"Transactions on Rough Sets XXIII","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Winnipeg; University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.018067828517309106,"score_gpt":0.2463540802573406,"score_spread":0.22828625174003148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343362","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076799733,0.1614961,0.54371315,0.007510972,0.032909922,0.00016491557,0.0017830207,0.0010231242,0.24371879],"genre_scores_gemma":[0.15285426,0.14671502,0.27337998,0.0014571518,0.013633078,0.0005339722,0.003036043,0.00086116424,0.40752923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851745,0.0003251639,0.00016045956,0.000114944414,0.0008317736,0.000050146915],"domain_scores_gemma":[0.9986141,0.00054262637,0.00008767493,0.00035386923,0.00035298613,0.000048790305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014705467,0.0010774097,0.0026132963,0.0016862778,0.0006281664,0.0036794508,0.0006851204,0.0007796595,0.02235982],"category_scores_gemma":[0.0041056653,0.00059857237,0.0011361734,0.0032553864,0.0011368581,0.001993259,0.0011123456,0.0018823813,0.010227192],"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.000077910496,0.000041754298,0.00037438076,0.0008578656,0.0001898453,0.00017198503,0.00031639045,0.009819013,0.0015389376,0.42905805,0.15330344,0.40425038],"study_design_scores_gemma":[0.000022345512,0.000068938665,0.0009978685,0.0003856916,0.00012324129,0.000305965,0.00016144518,0.019302731,0.0007949953,0.39767417,0.58012897,0.0000337056],"about_ca_topic_score_codex":0.001189246,"about_ca_topic_score_gemma":0.00087818137,"teacher_disagreement_score":0.02235982,"about_ca_system_score_codex":0.001012154,"about_ca_system_score_gemma":0.0008622886,"threshold_uncertainty_score":0.07480103},"labels":[],"label_agreement":null},{"id":"W4313343372","doi":"10.1007/978-3-031-22295-5_19","title":"VinciDecoder: Automatically Interpreting Provenance Graphs into Textual Forensic Reports with Application to OpenStack","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Cyber Forensics","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Cloud computing; Provenance; Sentence; Tree (set theory); Testbed; Data science; Natural language processing; Artificial intelligence; World Wide Web; Information retrieval","score_opus":0.005546182153218648,"score_gpt":0.21940104357454746,"score_spread":0.2138548614213288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343372","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.012169536,0.00032421527,0.56435573,0.00021290252,0.00023927256,0.00040766582,0.006792804,0.41118467,0.0043132156],"genre_scores_gemma":[0.12810482,0.0007043524,0.7766798,0.00023182816,0.00012047703,0.0005112845,0.029031666,0.051492568,0.01312325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.000085651795,0.000069966576,0.00018328492,0.00041365507,0.000051314306],"domain_scores_gemma":[0.99752134,0.0011669829,0.0002281148,0.00054361694,0.00044498732,0.00009497105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097561,0.0018656657,0.0008090189,0.0039078346,0.00066216744,0.0026809385,0.0017180477,0.0010620594,0.011688001],"category_scores_gemma":[0.0055038687,0.0008437836,0.0011951164,0.0015359106,0.00088666537,0.0026515585,0.0029149516,0.0012113238,0.005992937],"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.0006136061,0.00025343764,0.0040913024,0.0015829569,0.00023314595,0.0015933744,0.0015721818,0.021692319,0.05400768,0.0147307115,0.14718723,0.75244194],"study_design_scores_gemma":[0.00024267378,0.0002286764,0.0052196304,0.0005580174,0.00022017198,0.0018898164,0.0009346201,0.52920914,0.18008345,0.057135586,0.22392765,0.0003506537],"about_ca_topic_score_codex":0.0042209094,"about_ca_topic_score_gemma":0.0054049487,"teacher_disagreement_score":0.011688001,"about_ca_system_score_codex":0.00063484354,"about_ca_system_score_gemma":0.0014266811,"threshold_uncertainty_score":0.03910023},"labels":[],"label_agreement":null},{"id":"W4313343470","doi":"10.1007/978-3-662-66544-2_3","title":"Named Entity Recognition on CORD-19 Bio-Medical Dataset with Tolerance Rough Sets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Winnipeg; University of Alberta","funders":"","keywords":"Computer science; Named-entity recognition; Task (project management); Artificial intelligence; Natural language processing; Process (computing)","score_opus":0.033834887661863655,"score_gpt":0.27204638316298885,"score_spread":0.2382114955011252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343470","genre_codex":"dataset","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.11458951,0.008200837,0.02395429,0.0017920663,0.0015181326,0.0008685591,0.82770133,0.0137892645,0.0075859986],"genre_scores_gemma":[0.058928676,0.0010166533,0.030166296,0.00024649114,0.0001353489,0.00038884615,0.90663993,0.000111720736,0.0023660497],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983026,0.00026823947,0.00026621166,0.00054624706,0.00040915876,0.00020753655],"domain_scores_gemma":[0.9983444,0.00042714944,0.00011927485,0.0004973735,0.00045419807,0.00015770263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014686253,0.0018064196,0.0016544675,0.0052501434,0.0009969391,0.0015289948,0.0018806771,0.0018580236,0.0042057913],"category_scores_gemma":[0.0037500104,0.00028465173,0.0020539733,0.004088035,0.00045888405,0.0010328213,0.0013476684,0.001132795,0.0050971215],"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.002064234,0.0009896505,0.031125676,0.0029766022,0.00092170166,0.0021269529,0.00020858127,0.01488185,0.009422936,0.0019833834,0.62392175,0.30937666],"study_design_scores_gemma":[0.0012209653,0.0017442931,0.123782575,0.0014382852,0.0020566336,0.0074224453,0.0020896334,0.23675579,0.044747025,0.0123071,0.5658322,0.0006031083],"about_ca_topic_score_codex":0.020081753,"about_ca_topic_score_gemma":0.030213,"teacher_disagreement_score":0.020081753,"about_ca_system_score_codex":0.0013543318,"about_ca_system_score_gemma":0.002712348,"threshold_uncertainty_score":0.039929748},"labels":[],"label_agreement":null},{"id":"W4313343526","doi":"10.1007/978-3-662-66491-9_5","title":"A Novel Machine Learning Framework for Covid-19 Image Classification with Bio-heuristic Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Coronavirus disease 2019 (COVID-19); Machine learning; Dimensionality reduction; Triage; Classifier (UML); Feature extraction; Heuristic; Curse of dimensionality; Pattern recognition (psychology); Feature selection; Economic shortage; Contextual image classification; Categorization; Data mining; Image (mathematics); Infectious disease (medical specialty)","score_opus":0.04117092533576384,"score_gpt":0.3216934168411217,"score_spread":0.28052249150535785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343526","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.0010163686,0.0001829877,0.9960681,0.00011727038,0.000046883484,0.000031352414,0.000034141103,0.00029917012,0.0022036647],"genre_scores_gemma":[0.06153423,0.00031090935,0.92950046,0.00023733065,0.00014736039,0.00025119042,0.00026760585,0.0002716469,0.0074793184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994573,0.00014566153,0.000033380897,0.00011066231,0.00019872731,0.000054231856],"domain_scores_gemma":[0.99954295,0.00018382477,0.000038031318,0.00004839903,0.00015862758,0.000028267974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049916,0.0009543293,0.0014739683,0.001054582,0.000618223,0.0017360591,0.0024133977,0.0017476619,0.005357848],"category_scores_gemma":[0.0018302047,0.0005572118,0.0011848429,0.0012135104,0.0007143445,0.0010911095,0.0017431581,0.0019289246,0.0014366057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052171894,0.000113436596,0.00034628934,0.00012609301,0.00007842684,0.00009384271,0.000053801374,0.6508888,0.0035336758,0.082025334,0.008752461,0.25393572],"study_design_scores_gemma":[0.0000024115284,0.000008015088,0.000021550633,0.0000043934224,0.0000028695017,0.00001120515,0.0000024719059,0.9932968,0.00026940284,0.005176951,0.001201297,0.000002641344],"about_ca_topic_score_codex":0.0060002496,"about_ca_topic_score_gemma":0.0066820844,"teacher_disagreement_score":0.0060002496,"about_ca_system_score_codex":0.0011806227,"about_ca_system_score_gemma":0.0014063088,"threshold_uncertainty_score":0.017923832},"labels":[],"label_agreement":null},{"id":"W4313344236","doi":"10.1007/978-3-031-23028-8_30","title":"An Autoencoding Method for Detecting Counterfeit Coins","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Currency Recognition and Detection","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":"Concordia University","funders":"","keywords":"Counterfeit; Computer science; Artificial intelligence; Image (mathematics); Similarity (geometry); Scale-invariant feature transform; Anomaly detection; Pattern recognition (psychology); Computer vision","score_opus":0.04054337409621988,"score_gpt":0.3143644285758608,"score_spread":0.2738210544796409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313344236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07681534,0.0009655143,0.9050818,0.00013779358,0.00026469352,0.0001139246,0.00048025767,0.007926211,0.008214408],"genre_scores_gemma":[0.40603966,0.00088198064,0.55788904,0.00026096485,0.00016790089,0.00012607184,0.0014607096,0.0005547296,0.032618944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.00003800505,0.00002132976,0.00007431099,0.00013447735,0.00004069414],"domain_scores_gemma":[0.9992036,0.00025765752,0.00005642749,0.00022243644,0.00022701493,0.00003277298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033005484,0.00067200337,0.00061601296,0.001610851,0.00035651118,0.0007917801,0.00092850166,0.0007121375,0.0067007174],"category_scores_gemma":[0.0011515794,0.00034958022,0.00036376153,0.00095093425,0.00039784485,0.0011186454,0.00074832106,0.00045318005,0.0032663904],"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.0002517333,0.000096273245,0.0012855631,0.00008352352,0.000027240998,0.00016412514,0.000052823263,0.0038693382,0.082910955,0.003158503,0.003950728,0.90414923],"study_design_scores_gemma":[0.000049056976,0.0003421114,0.0067318906,0.0000788714,0.00017360954,0.0028714,0.00017633004,0.53439397,0.41968018,0.009374054,0.026028188,0.000100405276],"about_ca_topic_score_codex":0.0011002441,"about_ca_topic_score_gemma":0.0016626179,"teacher_disagreement_score":0.0067007174,"about_ca_system_score_codex":0.00027980653,"about_ca_system_score_gemma":0.0006043487,"threshold_uncertainty_score":0.022416174},"labels":[],"label_agreement":null},{"id":"W4313348914","doi":"10.1007/978-3-031-20350-3","title":"Theory and Applications of Models of Computation","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Algorithm","score_opus":0.015039210410154064,"score_gpt":0.25596311016592743,"score_spread":0.24092389975577336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313348914","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006858747,0.08705396,0.52718526,0.0132587785,0.0026346492,0.00008928807,0.00046708935,0.00072981114,0.3617225],"genre_scores_gemma":[0.53605103,0.081666574,0.27273372,0.00420284,0.0076748454,0.0009008021,0.0010056995,0.00054785836,0.09521667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989108,0.00047888298,0.000067115194,0.00015913162,0.00031417506,0.000069906],"domain_scores_gemma":[0.9982968,0.00114734,0.00009421336,0.0002507918,0.00014450878,0.000066320266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011807875,0.0013186077,0.0013355388,0.0020509562,0.0011736506,0.0052515105,0.001572254,0.0019096968,0.01100556],"category_scores_gemma":[0.0041545173,0.000734224,0.0014276358,0.0031678108,0.0056052003,0.007925971,0.0018459967,0.0040245038,0.0020044195],"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.0000023702703,0.000002451853,0.000025098117,0.000037339174,0.000003701584,0.00000970776,0.000043586195,0.00060212536,0.000042511198,0.99297005,0.0022544092,0.004006656],"study_design_scores_gemma":[0.0000020827438,0.0000018249588,0.00001915988,0.000018023948,0.0000025513928,0.000025838805,0.00001585049,0.0018933103,0.000024856994,0.98251444,0.015479897,0.000002104607],"about_ca_topic_score_codex":0.0014412408,"about_ca_topic_score_gemma":0.0008959878,"teacher_disagreement_score":0.01100556,"about_ca_system_score_codex":0.0027384222,"about_ca_system_score_gemma":0.0012037216,"threshold_uncertainty_score":0.036817253},"labels":[],"label_agreement":null},{"id":"W4313349371","doi":"10.1007/978-3-031-20350-3_13","title":"Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Knapsack problem; Combinatorics; Constraint (computer-aided design); Maximization; Mathematics; Monotone polygon; Similarity (geometry); Discrete mathematics; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.021047011313328538,"score_gpt":0.2545204206725667,"score_spread":0.23347340935923816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01441692,0.00057334354,0.95487493,0.00032072648,0.00008777076,0.0001244768,0.00037792724,0.00030584357,0.028918013],"genre_scores_gemma":[0.3192197,0.0015631648,0.6069951,0.00028162185,0.000255946,0.0005230134,0.0010092641,0.00059233233,0.06955983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924517,0.0002204649,0.000030446316,0.00015481997,0.00020207916,0.00014707433],"domain_scores_gemma":[0.9992612,0.00041498698,0.0000641549,0.000101375015,0.000098177254,0.000060112616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011193602,0.001467326,0.0013593044,0.00052401365,0.00046991667,0.0018265296,0.0021877121,0.0014813353,0.009355797],"category_scores_gemma":[0.0026310259,0.0010516049,0.0012285057,0.0017678131,0.00077220006,0.0033447694,0.0019501909,0.0025892647,0.001966271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039994362,0.00040622495,0.00038206822,0.0009686984,0.000094745716,0.00032614364,0.00021262055,0.43050784,0.016259171,0.33546573,0.025086738,0.18989009],"study_design_scores_gemma":[0.00004659387,0.00015446045,0.0003481049,0.000048237045,0.000022731741,0.0001539177,0.000049571292,0.8083967,0.0048414674,0.17849515,0.0074065924,0.00003648294],"about_ca_topic_score_codex":0.0015149321,"about_ca_topic_score_gemma":0.0020036432,"teacher_disagreement_score":0.009355797,"about_ca_system_score_codex":0.001001272,"about_ca_system_score_gemma":0.001177566,"threshold_uncertainty_score":0.03129822},"labels":[],"label_agreement":null},{"id":"W4313349465","doi":"10.1007/978-3-031-20936-9_15","title":"Sleep Stage Detection on a Wearable Headband Using Deep Neural Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Computer science; Wearable computer; Artificial neural network; Sleep (system call); Classifier (UML); Artificial intelligence; Sleep Stages; Channel (broadcasting); Machine learning; Pattern recognition (psychology); Speech recognition; Polysomnography; Computer network; Electroencephalography; Embedded system; Medicine","score_opus":0.030720825510024946,"score_gpt":0.2629279494772313,"score_spread":0.23220712396720636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27062452,0.0019498011,0.7118175,0.00046044655,0.00044344226,0.00014806699,0.002518026,0.0035369224,0.008501342],"genre_scores_gemma":[0.82659054,0.0013099031,0.15351534,0.00037202047,0.00016620674,0.000106321895,0.0013566285,0.00018191588,0.01640105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995744,0.0000046879545,0.0000022942288,0.000013784027,0.000012281275,0.000009557263],"domain_scores_gemma":[0.99994993,0.000015836507,0.0000044835792,0.000005103307,0.000018973658,0.000005596084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008129536,0.00054844655,0.00033705114,0.00031401945,0.00013682418,0.00028169734,0.00025129,0.00034816185,0.002734517],"category_scores_gemma":[0.00019817494,0.0001375738,0.0003126385,0.0003929156,0.00006130752,0.00021385269,0.00025693807,0.00030464903,0.000958563],"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.0006845743,0.00014031175,0.006608236,0.0002107456,0.00011950424,0.00030150067,0.00008448556,0.00783294,0.23448013,0.00042014662,0.006978234,0.7421392],"study_design_scores_gemma":[0.00009852069,0.00069650816,0.07968959,0.00014245577,0.00036104143,0.0015457786,0.00022160521,0.7351418,0.16602618,0.0035295282,0.012445349,0.00010161813],"about_ca_topic_score_codex":0.0020123513,"about_ca_topic_score_gemma":0.00781234,"teacher_disagreement_score":0.002734517,"about_ca_system_score_codex":0.00010722853,"about_ca_system_score_gemma":0.00018536815,"threshold_uncertainty_score":0.009147882},"labels":[],"label_agreement":null},{"id":"W4313349528","doi":"10.1007/978-3-031-20796-9_14","title":"Bounds for the Oriented Diameter of Planar Triangulations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Planar graph; Treewidth; Outerplanar graph; Pathwidth; Mathematics; Bounded function; Planar; 1-planar graph; Discrete mathematics; Upper and lower bounds; Graph; Book embedding; Chordal graph; Computer science; Line graph","score_opus":0.030204133745168296,"score_gpt":0.2973592118436405,"score_spread":0.2671550780984722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07209388,0.040957965,0.5251452,0.007829445,0.0026168895,0.00017057463,0.002725573,0.0020630104,0.34639752],"genre_scores_gemma":[0.5821423,0.050296307,0.25974247,0.0035169479,0.009975077,0.0013076863,0.0048670312,0.0042070523,0.08394511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997926,0.00034209728,0.00011353777,0.0005031591,0.00077912264,0.00033612386],"domain_scores_gemma":[0.9802208,0.015230761,0.0007945665,0.0012900895,0.0013256017,0.0011381982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025598663,0.0031538922,0.0021751784,0.00593437,0.0018673178,0.006037965,0.005261067,0.0018627279,0.01712237],"category_scores_gemma":[0.019210633,0.0015900484,0.0017676237,0.005267047,0.0036164154,0.011476298,0.006002557,0.007778667,0.0051151607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003433193,0.00013011458,0.0020258804,0.001081026,0.00014349494,0.00021978866,0.00066226773,0.026506925,0.008054124,0.829752,0.037598617,0.09348251],"study_design_scores_gemma":[0.000046302932,0.00009932502,0.0025109446,0.0003787136,0.00020236986,0.00045699926,0.00024973953,0.056096233,0.0029728422,0.89665717,0.04025847,0.00007101236],"about_ca_topic_score_codex":0.0015644424,"about_ca_topic_score_gemma":0.0019953838,"teacher_disagreement_score":0.01712237,"about_ca_system_score_codex":0.0035122512,"about_ca_system_score_gemma":0.00074472517,"threshold_uncertainty_score":0.057280004},"labels":[],"label_agreement":null},{"id":"W4313349612","doi":"10.1007/978-3-031-20936-9","title":"Internet of Things","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Université du Québec à Montréal","funders":"Joint Research Centre; National Technical University of Athens; Universitatea Politehnica din București; Universitat Politècnica de Catalunya; Haute école Spécialisée de Suisse Occidentale; Università di Pisa; Università della Calabria; Technische Universität Berlin; Universidad Carlos III de Madrid; Wojskowa Akademia Techniczna; National Chiao Tung University; National and Kapodistrian University of Athens; Universiti Putra Malaysia; Universität zu Lübeck; Sapienza Università di Roma; Universität Osnabrück; Aarhus Universitet; Aalto-Yliopisto; University College Cork; Università degli Studi di Trento; Shanghai Educational Development Foundation; Universität Passau; University of Glasgow; Università degli Studi Mediterranea di Reggio Calabria; La Rochelle Université; Cairo University; European Commission; Université Mohammed V de Rabat; Technische Universität Kaiserslautern; Danmarks Tekniske Universitet; Universidad de Murcia; Università degli Studi di Messina; Sveučilište u Zagrebu; Universidad de Málaga; Athens University of Economics and Business; Università di Catania; Universitatea din București; Siemens USA","keywords":"Computer science; Implementation; Focus (optics); Internet of Things; Computer security; The Internet; World Wide Web; Internet privacy; Telecommunications; Software engineering","score_opus":0.015754640210406838,"score_gpt":0.23516363180268618,"score_spread":0.21940899159227933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349612","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008614351,0.009252494,0.037795138,0.0014281338,0.005714088,0.00022500752,0.0014148877,0.0030423128,0.94026655],"genre_scores_gemma":[0.0028081078,0.0070203734,0.011336863,0.00095170754,0.0006421551,0.000084380685,0.0025268318,0.0005362177,0.9740933],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974495,0.000021822016,0.000009750692,0.000049261445,0.00015169803,0.000022483178],"domain_scores_gemma":[0.9998079,0.00002605899,0.000009969403,0.000045805187,0.00007496116,0.00003533271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027029405,0.0012508949,0.0006376319,0.0015749751,0.0007579803,0.0022627532,0.00068904524,0.0011774382,0.14597957],"category_scores_gemma":[0.00047680462,0.0004707645,0.00054795225,0.0017264121,0.0002650642,0.002794345,0.0015106256,0.0013929243,0.1532533],"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.000023815832,0.000043680997,0.00007626098,0.00024561846,0.00001607397,0.00010143446,0.000050859027,0.0003753213,0.0045142258,0.02050273,0.610716,0.36333397],"study_design_scores_gemma":[0.0000027492179,0.00002018913,0.0001477565,0.00007662516,0.000007233643,0.00016210458,0.000017028537,0.0004930299,0.0004099641,0.004635699,0.99402076,0.0000067312017],"about_ca_topic_score_codex":0.0007887802,"about_ca_topic_score_gemma":0.002033398,"teacher_disagreement_score":0.14597957,"about_ca_system_score_codex":0.00036686435,"about_ca_system_score_gemma":0.00054366264,"threshold_uncertainty_score":0.48835033},"labels":[],"label_agreement":null},{"id":"W4313351104","doi":"10.1007/978-3-031-22105-7_1","title":"A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Combinatorics; Regular polygon; Mathematics; Oracle; Maximization; Function (biology); Constraint (computer-aided design); Order (exchange); Discrete mathematics; Set (abstract data type); Set function; Convex function; Stochastic ordering; Mathematical optimization; Applied mathematics; Computer science","score_opus":0.016908042043018292,"score_gpt":0.2398259652213626,"score_spread":0.2229179231783443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313351104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04206838,0.0012444963,0.92383915,0.0039538625,0.00022331004,0.00021591007,0.0012199718,0.0002973748,0.026937459],"genre_scores_gemma":[0.6599344,0.0019590107,0.29335743,0.0012134709,0.00077040866,0.00058816327,0.0014608143,0.00048078937,0.040235482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984113,0.0007255547,0.000053614658,0.00043818852,0.0002357646,0.00013559457],"domain_scores_gemma":[0.99693453,0.002277939,0.00020827095,0.0001491684,0.00019705163,0.00023311119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027785972,0.001302036,0.0022716378,0.00060048257,0.0005454892,0.0022751573,0.002135592,0.0029217463,0.0072605745],"category_scores_gemma":[0.0065698833,0.0008937764,0.0012108744,0.0015361704,0.0013076918,0.0028392812,0.0020042497,0.0028808864,0.00071521645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028383895,0.00026477638,0.0005775245,0.0007622988,0.00018037685,0.0004129444,0.00014824049,0.51286286,0.0041064587,0.4089292,0.018664004,0.052807458],"study_design_scores_gemma":[0.00005164014,0.000100332785,0.00024162277,0.00003987147,0.00002131298,0.00015227162,0.000038735077,0.838943,0.00047843164,0.15668279,0.0032298558,0.000020180149],"about_ca_topic_score_codex":0.0015456018,"about_ca_topic_score_gemma":0.0014607906,"teacher_disagreement_score":0.0072605745,"about_ca_system_score_codex":0.002084336,"about_ca_system_score_gemma":0.0017341536,"threshold_uncertainty_score":0.024289012},"labels":[],"label_agreement":null},{"id":"W4313351153","doi":"10.1007/978-3-031-22105-7_25","title":"Semi-strict Chordal Digraphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"Chordal graph; Digraph; Interval graph; Combinatorics; Computer science; Mathematics; Transitive relation; Discrete mathematics; Graph; 1-planar graph","score_opus":0.01945569434449878,"score_gpt":0.273544141588552,"score_spread":0.2540884472440532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313351153","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18141079,0.0016198333,0.21574321,0.0009004148,0.0009114696,0.00028423607,0.0025837682,0.0007913584,0.5957549],"genre_scores_gemma":[0.8064622,0.0016412333,0.060775936,0.00034963663,0.00021669242,0.00015648517,0.0021871638,0.00020973787,0.12800087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976605,0.000032820866,0.000020373574,0.00005793633,0.00007708348,0.000045688746],"domain_scores_gemma":[0.99900347,0.00030948903,0.0000629056,0.00017891824,0.00022847073,0.00021681651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019297401,0.00030388116,0.0004280956,0.0007871891,0.0012814545,0.0018765981,0.0007242047,0.0004601267,0.011462176],"category_scores_gemma":[0.0014108691,0.0003530944,0.00031639528,0.0010710591,0.00079179107,0.0020024334,0.0012763202,0.001302452,0.0024130072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006244721,0.0000255979,0.00026628384,0.0001691396,0.000008196746,0.0001885935,0.00035016338,0.0011723044,0.0032894413,0.9547107,0.0050774124,0.03467971],"study_design_scores_gemma":[0.000021973889,0.000045411525,0.00050345407,0.00004898011,0.0000138395,0.00049470493,0.00031730364,0.0047297725,0.0018178752,0.9331546,0.05883763,0.000014551885],"about_ca_topic_score_codex":0.00074076507,"about_ca_topic_score_gemma":0.0018488888,"teacher_disagreement_score":0.011462176,"about_ca_system_score_codex":0.00062987563,"about_ca_system_score_gemma":0.0004599469,"threshold_uncertainty_score":0.0383448},"labels":[],"label_agreement":null},{"id":"W4313400994","doi":"10.1007/978-3-031-23582-5","title":"Internet of Things – ICIOT 2022","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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 Prince Edward Island","funders":"","keywords":"Computer science; Programming language","score_opus":0.018913168645031717,"score_gpt":0.24624994774278594,"score_spread":0.22733677909775424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313400994","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00140322,0.014531917,0.05656231,0.0015530874,0.010505829,0.0004067956,0.0037139542,0.004847484,0.90647537],"genre_scores_gemma":[0.0064538857,0.011286531,0.023060976,0.001433196,0.0015258482,0.0001678902,0.008120034,0.0018003276,0.9461513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956197,0.000029686518,0.000017219918,0.00005300488,0.00029255706,0.000045535107],"domain_scores_gemma":[0.99962354,0.000051015708,0.00001901218,0.000054359774,0.00016674766,0.00008523869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054995966,0.0014942063,0.0007084801,0.0022130432,0.000604038,0.002413518,0.0008991795,0.0015845175,0.082405955],"category_scores_gemma":[0.00064684724,0.00057110743,0.0005921329,0.0018690892,0.0002989997,0.002611074,0.0010935898,0.0019043194,0.071121],"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.000064410895,0.00004681365,0.00005963656,0.00022764935,0.000014823946,0.00007500574,0.000017019678,0.00087882765,0.0041527296,0.016551482,0.7429214,0.23499021],"study_design_scores_gemma":[0.0000065313498,0.00004186956,0.00014004973,0.00008644686,0.0000064855676,0.0001544099,0.0000067010906,0.0017563317,0.00083774107,0.0027728395,0.99417984,0.000010701024],"about_ca_topic_score_codex":0.0027988395,"about_ca_topic_score_gemma":0.004898244,"teacher_disagreement_score":0.082405955,"about_ca_system_score_codex":0.0009206667,"about_ca_system_score_gemma":0.00085255975,"threshold_uncertainty_score":0.27567536},"labels":[],"label_agreement":null},{"id":"W4313429548","doi":"10.1007/978-3-031-23101-8_6","title":"Morphing Planar Graph Drawings Through 3D","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Morphing; Planar graph; Piecewise linear function; Vertex (graph theory); Planar; Computer science; Graph; Planar straight-line graph; Book embedding; Combinatorics; Line drawings; Line (geometry); Crossing number (knot theory); Line graph; Mathematics; Computer graphics (images); Geometry; Theoretical computer science; Engineering drawing; 1-planar graph","score_opus":0.019048153541340613,"score_gpt":0.24400070596534432,"score_spread":0.2249525524240037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313429548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010560276,0.0003069886,0.96936774,0.00010203675,0.00013937821,0.000081248836,0.00028816122,0.004348445,0.014805681],"genre_scores_gemma":[0.14057988,0.0011217752,0.8316092,0.00009935588,0.000041912786,0.00012471531,0.0010189121,0.0030456353,0.022358598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.00002884139,0.00001432791,0.00006725904,0.00016686824,0.000024868976],"domain_scores_gemma":[0.9997203,0.00008915733,0.00002223371,0.00010270062,0.000048989717,0.000016591772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023846529,0.0011416723,0.0006010566,0.0013090757,0.0003797674,0.0012630185,0.0012632639,0.0007169569,0.017946811],"category_scores_gemma":[0.0010046756,0.0010522777,0.00086503016,0.0012276751,0.00068884925,0.001341777,0.0023270117,0.0013910381,0.003888248],"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.00006069464,0.00005063746,0.00035103105,0.00043672684,0.00006203959,0.00024793166,0.00042106776,0.1518604,0.046045274,0.08469273,0.020928998,0.69484246],"study_design_scores_gemma":[0.000035870093,0.00012643865,0.0005368303,0.0001817202,0.000060683986,0.0010816547,0.00031419404,0.65385544,0.04959612,0.13343944,0.16068505,0.00008645569],"about_ca_topic_score_codex":0.0016505033,"about_ca_topic_score_gemma":0.0032372356,"teacher_disagreement_score":0.017946811,"about_ca_system_score_codex":0.00039939923,"about_ca_system_score_gemma":0.0002890856,"threshold_uncertainty_score":0.06003803},"labels":[],"label_agreement":null},{"id":"W4315483925","doi":"10.1007/978-3-031-22677-9","title":"Algorithms and Architectures for Parallel Processing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Parallel computing; Parallel processing","score_opus":0.02357127204864693,"score_gpt":0.27769350795530373,"score_spread":0.2541222359066568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315483925","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001778572,0.009911884,0.91919845,0.0011704509,0.0017861122,0.00010849824,0.00026843688,0.0030027635,0.06277475],"genre_scores_gemma":[0.042464823,0.013130174,0.8418372,0.0005828558,0.0020690653,0.00053366576,0.0008593111,0.0013113156,0.09721159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946576,0.00010019411,0.00003889457,0.00008678383,0.00026256355,0.000045852874],"domain_scores_gemma":[0.9992204,0.00031565898,0.00002973785,0.00023558893,0.00017105804,0.000027501967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005579035,0.0017120643,0.0011474376,0.0011086436,0.00070113095,0.0026506723,0.0017320985,0.0010413477,0.026308585],"category_scores_gemma":[0.0022718215,0.00086752576,0.00068284216,0.002825845,0.001166415,0.0037149203,0.0013485954,0.0024794093,0.01265891],"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.00010662935,0.00004927034,0.00010042928,0.0005468466,0.00007041381,0.000065146036,0.0000777932,0.027443241,0.003885152,0.51100624,0.08197268,0.37467626],"study_design_scores_gemma":[0.00004807935,0.00004069451,0.00011368151,0.00007954609,0.000038228663,0.00015054322,0.00002338276,0.091762915,0.0027377708,0.705932,0.19905242,0.00002064222],"about_ca_topic_score_codex":0.00065069867,"about_ca_topic_score_gemma":0.00072215236,"teacher_disagreement_score":0.026308585,"about_ca_system_score_codex":0.0007902703,"about_ca_system_score_gemma":0.00082637457,"threshold_uncertainty_score":0.08801103},"labels":[],"label_agreement":null},{"id":"W4315780111","doi":"10.1007/978-3-031-20096-0_31","title":"Adversarial Attack and Defense on Natural Language Processing in Deep Learning: A Survey and Perspective","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Adversarial system; Computer science; Artificial intelligence; Robustness (evolution); Perspective (graphical); Deep learning; Natural language; Natural language processing; Natural language understanding; Granularity; Deep neural networks; Programming language","score_opus":0.019071998195791237,"score_gpt":0.2869613327146658,"score_spread":0.26788933451887453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315780111","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063744546,0.31055686,0.63041943,0.006920524,0.0012478227,0.0001047191,0.0001414584,0.0003449687,0.043889754],"genre_scores_gemma":[0.34820607,0.43254018,0.16245,0.0044998466,0.0081206905,0.00038692376,0.0004631202,0.00030112077,0.043032162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797016,0.000601702,0.00011572371,0.00031294907,0.00081889855,0.00018061012],"domain_scores_gemma":[0.9953432,0.003495981,0.00021762673,0.0005000884,0.00035819382,0.00008491888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028512962,0.0015388861,0.0017306915,0.0018223537,0.00070739014,0.0039743874,0.002167728,0.0032377401,0.0030208044],"category_scores_gemma":[0.0060815155,0.0009895905,0.0010277609,0.003183835,0.0035519742,0.0075280927,0.003622978,0.00587676,0.0011754278],"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.000096034615,0.00019814092,0.0006840234,0.0011759788,0.00011391598,0.00011638588,0.00013361471,0.0704879,0.0015769062,0.5351416,0.016468639,0.37380695],"study_design_scores_gemma":[0.000016359865,0.00018299626,0.00054444,0.00069685426,0.00005582125,0.0005033182,0.00010919966,0.26597804,0.00301407,0.66535,0.0634868,0.00006205026],"about_ca_topic_score_codex":0.0010121174,"about_ca_topic_score_gemma":0.000705839,"teacher_disagreement_score":0.0039743874,"about_ca_system_score_codex":0.0019620322,"about_ca_system_score_gemma":0.0011631768,"threshold_uncertainty_score":0.01507926},"labels":[],"label_agreement":null},{"id":"W4315780125","doi":"10.1007/978-3-031-20096-0_43","title":"Symmetry Structured Analysis Sparse Coding for Key Frame Extraction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Coding (social sciences); Sparse approximation; Neural coding; Key frame; Regularization (linguistics); Minimax; Computational complexity theory; Algorithm; Convex function; Key (lock); Mathematical optimization; Theoretical computer science; Artificial intelligence; Frame (networking); Regular polygon; Mathematics","score_opus":0.028169931146445365,"score_gpt":0.2828784859520778,"score_spread":0.2547085548056325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315780125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018547381,0.00025144397,0.99552274,0.00006191304,0.00004891913,0.000022774255,0.00012534349,0.000406665,0.0017054626],"genre_scores_gemma":[0.064171016,0.0011277077,0.92150575,0.0001544153,0.00013703483,0.00013344859,0.0014279344,0.00026805286,0.011074616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997954,0.000036087727,0.000011478411,0.000028547416,0.00010779325,0.000020823485],"domain_scores_gemma":[0.99960226,0.00013780649,0.000028169457,0.00009015129,0.00012974965,0.000011963823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026045798,0.0006510727,0.00054612727,0.00070702523,0.00024918714,0.00061862555,0.00057704386,0.0006568528,0.007308342],"category_scores_gemma":[0.0010910534,0.0002865097,0.00042877762,0.0013323252,0.00025929417,0.0008212399,0.0006585879,0.00086099503,0.00506496],"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.00015697505,0.000041850293,0.00013992682,0.00014470587,0.000023689452,0.00007556387,0.000049728274,0.019817414,0.11454028,0.024689432,0.0131238215,0.82719666],"study_design_scores_gemma":[0.000023812778,0.000108107655,0.00058703584,0.00005349992,0.00003869799,0.00033891795,0.000039818704,0.87174016,0.083479315,0.018349176,0.02520932,0.000032159838],"about_ca_topic_score_codex":0.0011178891,"about_ca_topic_score_gemma":0.0018916397,"teacher_disagreement_score":0.007308342,"about_ca_system_score_codex":0.0002305175,"about_ca_system_score_gemma":0.00060209323,"threshold_uncertainty_score":0.024448812},"labels":[],"label_agreement":null},{"id":"W4315798474","doi":"10.1007/978-3-031-19907-3_31","title":"Maze Learning Using a Hyperdimensional Predictive Processing Cognitive Architecture","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Computer science; Cognitive architecture; Architecture; Cognition; Artificial intelligence; Cognitive science; Human–computer interaction; Psychology; Neuroscience","score_opus":0.026256872872513812,"score_gpt":0.2637810035091903,"score_spread":0.2375241306366765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315798474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06263138,0.00027303613,0.9253496,0.00029059447,0.000098671975,0.000058214857,0.00008613827,0.00091027335,0.010302121],"genre_scores_gemma":[0.7179766,0.00033866748,0.274409,0.00010231262,0.000044540608,0.00013743319,0.0001199298,0.00006476092,0.0068067145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990094,0.0000157549,0.000006229268,0.00003196984,0.00003072194,0.000014400375],"domain_scores_gemma":[0.9996871,0.00012224067,0.000026747917,0.000057324905,0.000076700424,0.000029896453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022080501,0.00045451106,0.00046267282,0.00024807182,0.00034493505,0.0011985205,0.0013486217,0.00056469487,0.0039366037],"category_scores_gemma":[0.00083568564,0.00029188162,0.0005842705,0.00044790556,0.00056129385,0.0015052245,0.0009853509,0.0011256043,0.00037487654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002084992,0.00015005737,0.0008099386,0.00011872101,0.00011252259,0.00014155296,0.00015773627,0.60612315,0.023784846,0.11107926,0.0028949266,0.2544188],"study_design_scores_gemma":[0.000011391525,0.000046077377,0.0001399868,0.000006781244,0.000013667081,0.00001780751,0.000009552313,0.968411,0.0018654302,0.028833972,0.0006332532,0.000010981609],"about_ca_topic_score_codex":0.0031548743,"about_ca_topic_score_gemma":0.00313309,"teacher_disagreement_score":0.0039366037,"about_ca_system_score_codex":0.00053624675,"about_ca_system_score_gemma":0.0005869262,"threshold_uncertainty_score":0.013169289},"labels":[],"label_agreement":null},{"id":"W4316253332","doi":"10.1007/978-3-642-04159-4","title":"Selected Areas in Cryptography","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Computer science; Cryptography; Neural cryptography; Computer security; Encryption; Public-key cryptography","score_opus":0.008578943467962667,"score_gpt":0.22981651342749648,"score_spread":0.2212375699595338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316253332","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013120152,0.11489433,0.016440397,0.002029697,0.011612935,0.00019050325,0.00075888657,0.00061596977,0.85214514],"genre_scores_gemma":[0.0099743195,0.088707596,0.011505065,0.0011854232,0.00851124,0.00027055034,0.001066921,0.00032731507,0.8784516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995363,0.00005221492,0.00001797605,0.00009598017,0.00025243458,0.000045046647],"domain_scores_gemma":[0.99951375,0.000123594,0.000030085517,0.000069950656,0.00016749927,0.00009521394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041691677,0.002814684,0.0020820443,0.0027324127,0.0011307477,0.0024432484,0.0010374804,0.00096417876,0.1174973],"category_scores_gemma":[0.00097582914,0.00047197271,0.0007308839,0.004289782,0.0010349931,0.002785385,0.0012681554,0.0030008114,0.11064878],"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.000081148515,0.00012034597,0.00028349258,0.0009933033,0.000040748968,0.000108373315,0.00015135402,0.0013084305,0.0026924964,0.054508667,0.5318238,0.40788788],"study_design_scores_gemma":[0.000015875667,0.00006796016,0.0006820705,0.00042861278,0.00001713512,0.00021604884,0.0000377108,0.0006729747,0.00048149802,0.022276616,0.97508913,0.000014427717],"about_ca_topic_score_codex":0.0009054504,"about_ca_topic_score_gemma":0.0018659746,"teacher_disagreement_score":0.1174973,"about_ca_system_score_codex":0.0010821951,"about_ca_system_score_gemma":0.0012076705,"threshold_uncertainty_score":0.3930676},"labels":[],"label_agreement":null},{"id":"W4316662528","doi":"10.1007/978-3-031-24950-1_13","title":"Sound Symbolic Execution via Abstract Interpretation and Its Application to Security","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); Canadian Institute of Steel Construction","keywords":"Soundness; Abstract interpretation; Computer science; Correctness; Symbolic execution; Interpretation (philosophy); Context (archaeology); Theoretical computer science; Static analysis; Symbolic data analysis; Programming language; Software","score_opus":0.018415415957030272,"score_gpt":0.2699051008504644,"score_spread":0.2514896848934341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316662528","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.005535848,0.00048689457,0.978231,0.0003744192,0.00010370706,0.000042193285,0.00004660342,0.0010441319,0.014135043],"genre_scores_gemma":[0.47068223,0.0015748526,0.50791174,0.00032569538,0.00037929683,0.0002585692,0.00020509257,0.00091852277,0.017744076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806076,0.00071474403,0.00013663954,0.00029374607,0.000606419,0.00018774466],"domain_scores_gemma":[0.9951514,0.0037817548,0.0001418622,0.00058826554,0.00026795358,0.0000686614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018717634,0.0012840036,0.00142288,0.0017388023,0.0010604853,0.0034393556,0.0015711316,0.001559299,0.006439048],"category_scores_gemma":[0.008603809,0.0010930159,0.0020725627,0.0020879514,0.00808805,0.004923344,0.0031427718,0.0051899934,0.0011339037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007223055,0.00003307044,0.00012000077,0.000104016945,0.000021429867,0.00013133146,0.00033179505,0.026227213,0.0019499024,0.92334795,0.0014535001,0.046207685],"study_design_scores_gemma":[0.000013785689,0.000012523985,0.000032265776,0.00002145029,0.0000179669,0.000033467306,0.000027265953,0.074833006,0.0013786425,0.9211235,0.0024933394,0.000012776553],"about_ca_topic_score_codex":0.0016848183,"about_ca_topic_score_gemma":0.0013770858,"teacher_disagreement_score":0.006439048,"about_ca_system_score_codex":0.0016094805,"about_ca_system_score_gemma":0.0013329503,"threshold_uncertainty_score":0.02154082},"labels":[],"label_agreement":null},{"id":"W4316662751","doi":"10.1007/978-3-031-24950-1_7","title":"A Pragmatic Approach to Stateful Partial Order Reduction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Computer science; Partial order reduction; Stateful firewall; Reduction (mathematics); Model checking; Context (archaeology); Java; Focus (optics); Overhead (engineering); State space; State (computer science); Theoretical computer science; Programming language; Algorithm; Distributed computing","score_opus":0.03692247566977151,"score_gpt":0.2911935676370818,"score_spread":0.2542710919673103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316662751","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.003338599,0.00030985352,0.9259783,0.0025369516,0.00035232262,0.00014631504,0.00014639572,0.0012548303,0.06593647],"genre_scores_gemma":[0.35673127,0.0010274821,0.5677276,0.0017787202,0.00082604773,0.0009517013,0.0005196737,0.0016964439,0.068741076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498415,0.0018695196,0.00026793362,0.00043268796,0.002085228,0.00036051674],"domain_scores_gemma":[0.9959304,0.002084266,0.00009375084,0.0013343723,0.00045582379,0.00010146515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034701957,0.0009591632,0.0011695755,0.0013055296,0.0024624004,0.0045590405,0.002625752,0.00197429,0.013218704],"category_scores_gemma":[0.00851468,0.0013934624,0.002221954,0.0015518301,0.007105354,0.0075696185,0.004971268,0.0065906276,0.0027701436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011036871,0.000014732672,0.000015391412,0.000037631024,0.0000048618695,0.000023917592,0.00014511908,0.0009573157,0.0004313565,0.9883342,0.0014353943,0.008588957],"study_design_scores_gemma":[0.000014274927,0.000014018557,0.000020163077,0.000016638021,0.000014412704,0.00004140609,0.00004208759,0.008430039,0.0012596942,0.974329,0.015803829,0.000014576798],"about_ca_topic_score_codex":0.0015673155,"about_ca_topic_score_gemma":0.0027868992,"teacher_disagreement_score":0.013218704,"about_ca_system_score_codex":0.0020867744,"about_ca_system_score_gemma":0.0023245001,"threshold_uncertainty_score":0.044220984},"labels":[],"label_agreement":null},{"id":"W4317393977","doi":"10.1007/978-3-031-22203-0","title":"Graph Drawing and Network Visualization","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ioannina; National Technical University of Athens; Università degli Studi di Perugia; Julius-Maximilians-Universität Würzburg; Universität Zürich; National and Kapodistrian University of Athens; Ben-Gurion University of the Negev; Brown University; University of California, San Diego; Universität Passau; University of Crete; University of Aizu; University of Waterloo; Université de Montpellier; Universität Trier; Eidgenössische Technische Hochschule Zürich; Technische Universität Wien; Christian-Albrechts-Universität zu Kiel; Universität Konstanz; Univerzita Karlova v Praze; Centre National de la Recherche Scientifique; Università degli Studi Roma Tre; Universität zu Köln; Monash University; Universität Osnabrück","keywords":"Graph drawing; Visualization; Computer science; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.018498061630371487,"score_gpt":0.2911656766106998,"score_spread":0.2726676149803283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317393977","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014267182,0.0028169346,0.94576776,0.0005605938,0.00046965055,0.00006369433,0.00053412764,0.006097527,0.04226295],"genre_scores_gemma":[0.040722992,0.009758388,0.833291,0.00038793555,0.0007365666,0.0003375953,0.002701069,0.0052104997,0.106854066],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996712,0.000072402356,0.0000150879105,0.00008327073,0.00013378097,0.000024169854],"domain_scores_gemma":[0.99929523,0.00034955112,0.000026348953,0.00015869206,0.00013281377,0.000037319674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003729552,0.0021128252,0.0010778306,0.002695147,0.0006192582,0.0027701424,0.0015396754,0.0008337815,0.051714033],"category_scores_gemma":[0.0018146503,0.00109543,0.0010369305,0.0042551425,0.00080606324,0.0031149078,0.0015931354,0.002207376,0.014987882],"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.000057927995,0.000051215655,0.00022301362,0.00047848793,0.000051497223,0.0001389374,0.00024623968,0.027082575,0.005939081,0.17603928,0.15941824,0.6302735],"study_design_scores_gemma":[0.000024356928,0.000030334319,0.0004113161,0.00015867413,0.000055091194,0.0003938728,0.00012256365,0.16953306,0.007253133,0.4597199,0.36224803,0.000049628317],"about_ca_topic_score_codex":0.0017432957,"about_ca_topic_score_gemma":0.002277363,"teacher_disagreement_score":0.051714033,"about_ca_system_score_codex":0.0006220351,"about_ca_system_score_gemma":0.000426738,"threshold_uncertainty_score":0.1730007},"labels":[],"label_agreement":null},{"id":"W4317639934","doi":"10.1007/978-3-031-23911-3","title":"Fast and Low-Resource Semi-supervised Abdominal Organ Segmentation","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Ontario Tobacco Research Unit; University of Toronto","funders":"","keywords":"Computer science; Resource (disambiguation); Segmentation; Artificial intelligence; Image segmentation; Computer vision","score_opus":0.009952557160992583,"score_gpt":0.2417389707928539,"score_spread":0.2317864136318613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317639934","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.012442288,0.00063566165,0.9730162,0.00015087595,0.00012658948,0.00009854381,0.00091193116,0.010406242,0.0022117607],"genre_scores_gemma":[0.12165761,0.0004892342,0.86115426,0.0001677362,0.00017688921,0.00018879387,0.0038278403,0.001275886,0.011061772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943334,0.000070458795,0.00003340863,0.00016893775,0.00021454615,0.00007932994],"domain_scores_gemma":[0.9989833,0.0003651418,0.00007728235,0.00027112634,0.00024077478,0.00006226107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005307083,0.0013425403,0.0014889678,0.0010822372,0.00042286044,0.0012913487,0.0020797916,0.001508754,0.009076778],"category_scores_gemma":[0.0013429155,0.0010725402,0.0011735047,0.001248754,0.00033578265,0.001053639,0.0016801826,0.0011902717,0.006943605],"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.00048177122,0.000093308714,0.00068414485,0.00028455016,0.00012575628,0.00014087046,0.000049213213,0.025412794,0.07842625,0.0011982493,0.019914415,0.87318873],"study_design_scores_gemma":[0.000050613617,0.00013674621,0.0029244667,0.000046402412,0.00008086637,0.0011031413,0.000056169196,0.92770374,0.05137336,0.0054981736,0.010971369,0.000054917826],"about_ca_topic_score_codex":0.0025119102,"about_ca_topic_score_gemma":0.007833302,"teacher_disagreement_score":0.009076778,"about_ca_system_score_codex":0.0003284546,"about_ca_system_score_gemma":0.001156592,"threshold_uncertainty_score":0.030364811},"labels":[],"label_agreement":null},{"id":"W4317738590","doi":"10.1007/978-3-031-23480-4_9","title":"Identifying Cannabis Use Risk Through Social Media Based on Deep Learning Methods","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cannabis; Computer science; Artificial intelligence; Machine learning; Deep learning; Social media; World Wide Web; Psychology; Psychiatry","score_opus":0.05792646700582233,"score_gpt":0.31895363267719284,"score_spread":0.2610271656713705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317738590","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.82688063,0.0031344404,0.14727618,0.0019922785,0.00029282432,0.00015888063,0.004681935,0.0010220796,0.014560746],"genre_scores_gemma":[0.9754328,0.0005542908,0.01686562,0.00011152822,0.00013577507,0.000045047123,0.0016777638,0.000024566974,0.0051525445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.00007179591,0.000015733342,0.00006405936,0.00007228439,0.00006378162],"domain_scores_gemma":[0.9985461,0.00095942855,0.00015737237,0.00007665249,0.00018728398,0.00007324479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006264314,0.0007668162,0.0005465634,0.0017861794,0.00028139187,0.00083818944,0.0004830249,0.0008067894,0.0027267002],"category_scores_gemma":[0.0022403148,0.0002288564,0.0006127099,0.00075676345,0.00021545561,0.0010933533,0.0007080228,0.0010985081,0.0011709227],"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.00084325374,0.0017199718,0.3265184,0.0002379238,0.0005058878,0.00036782227,0.0002027342,0.054994028,0.00782145,0.0036594393,0.010813785,0.59231526],"study_design_scores_gemma":[0.000011854806,0.00013095327,0.05602636,0.00006117489,0.000090593705,0.00019678165,0.00012679698,0.9318875,0.0030549758,0.006787035,0.00159538,0.00003055283],"about_ca_topic_score_codex":0.005993983,"about_ca_topic_score_gemma":0.011417693,"teacher_disagreement_score":0.005993983,"about_ca_system_score_codex":0.00048508344,"about_ca_system_score_gemma":0.00040515934,"threshold_uncertainty_score":0.011918187},"labels":[],"label_agreement":null},{"id":"W4317738612","doi":"10.1007/978-3-031-23480-4","title":"Artificial Intelligence and Soft Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soft computing; Computer science; Artificial intelligence; Applications of artificial intelligence; Artificial neural network","score_opus":0.02971843992739635,"score_gpt":0.25443124020410984,"score_spread":0.2247128002767135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317738612","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00235046,0.095748626,0.088009715,0.0060988017,0.006773164,0.00009395575,0.0002633529,0.0004738165,0.800188],"genre_scores_gemma":[0.03993399,0.061445314,0.03680928,0.00226735,0.00413411,0.00024014326,0.00031653413,0.0003596262,0.8544936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996221,0.0000765701,0.00001604242,0.000041161013,0.00022667485,0.000017415561],"domain_scores_gemma":[0.99951696,0.0002857396,0.000026184092,0.00007037484,0.00006666158,0.00003404861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041155863,0.001034318,0.0012941689,0.0015030175,0.0006248281,0.0029764345,0.00053570187,0.00081915304,0.048341006],"category_scores_gemma":[0.0012760971,0.00036970328,0.0003705683,0.0028512892,0.0015701558,0.0028022085,0.0013978985,0.0022375602,0.019558642],"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.000022161328,0.00006344016,0.00011564296,0.0006831983,0.000037082038,0.00005998723,0.0001732358,0.0031292015,0.0010029711,0.4486594,0.17124769,0.37480602],"study_design_scores_gemma":[0.0000095835,0.000033564294,0.0003366924,0.00039424532,0.000014037897,0.00014644407,0.00008056787,0.0056318464,0.0004910474,0.47789818,0.51495135,0.000012453266],"about_ca_topic_score_codex":0.0004379794,"about_ca_topic_score_gemma":0.0009198902,"teacher_disagreement_score":0.048341006,"about_ca_system_score_codex":0.0007795168,"about_ca_system_score_gemma":0.00077192264,"threshold_uncertainty_score":0.16171676},"labels":[],"label_agreement":null},{"id":"W4317760681","doi":"10.1007/978-3-031-24670-8_4","title":"The Sound of Actuators in Children with ASD, Beneficial or Disruptive?","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autism Spectrum Disorder Research","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Perception; Gesture; Computer science; Autism; Context (archaeology); Robot; Gaze; Typically developing; Sound (geography); Actuator; Human–computer interaction; Autism spectrum disorder; Cognitive psychology; Psychology; Artificial intelligence; Developmental psychology; Acoustics","score_opus":0.022593818856193954,"score_gpt":0.28058612569235625,"score_spread":0.2579923068361623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317760681","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.8069556,0.04919192,0.0042682323,0.009304997,0.0010734542,0.00006045119,0.0008900309,0.00036211166,0.12789325],"genre_scores_gemma":[0.94274247,0.024173794,0.005146219,0.00079177384,0.00024262024,0.00008433683,0.00036636554,0.00007048918,0.026381975],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998023,0.000037481783,0.0000149900325,0.000031195494,0.000075844575,0.00003821011],"domain_scores_gemma":[0.99959165,0.0002477001,0.00005847092,0.000012117587,0.000032161566,0.000057836027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027121668,0.0005124354,0.0004506883,0.0006351353,0.00041516198,0.00097119063,0.00046254953,0.00093867397,0.006175163],"category_scores_gemma":[0.0019839986,0.00018279783,0.00032090285,0.00034014726,0.0010540667,0.00077521475,0.0006238055,0.00092106406,0.0009084157],"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.0014743656,0.0008050396,0.10954822,0.0014898177,0.000081490325,0.020148115,0.0115173,0.00053957367,0.040688075,0.0075228577,0.033664957,0.7725202],"study_design_scores_gemma":[0.00023987274,0.0038041184,0.6366673,0.0021409495,0.0004959894,0.14103667,0.06587938,0.0015443388,0.019886551,0.030360451,0.09777774,0.00016668128],"about_ca_topic_score_codex":0.0048035276,"about_ca_topic_score_gemma":0.00808685,"teacher_disagreement_score":0.006175163,"about_ca_system_score_codex":0.0004294522,"about_ca_system_score_gemma":0.00052946457,"threshold_uncertainty_score":0.020657957},"labels":[],"label_agreement":null},{"id":"W4317761401","doi":"10.1007/978-3-031-24670-8_5","title":"Evaluating Robot Acceptance in Children with ASD and Their Parents","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autism Spectrum Disorder Research","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robot; Artificial intelligence; Human–computer interaction","score_opus":0.04803323329861107,"score_gpt":0.32013337841604655,"score_spread":0.27210014511743547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317761401","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.9986291,0.00007787081,0.0000922111,0.000025314825,0.0000056902627,0.0000102217755,0.00003265162,0.000005494392,0.0011214354],"genre_scores_gemma":[0.99754745,0.00019670738,0.00042023687,0.000023641953,0.0000026659668,0.000066645174,0.00014338072,0.000005873465,0.0015934194],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99935275,0.00024192788,0.000040765495,0.00008370106,0.00018016709,0.00010069505],"domain_scores_gemma":[0.99703014,0.0014202183,0.0005638941,0.00009719435,0.0004646471,0.00042402736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011800774,0.000444136,0.00045330514,0.000555512,0.000521071,0.00096373464,0.00040245245,0.0005286094,0.0017874448],"category_scores_gemma":[0.005396471,0.00021906932,0.00047436138,0.00027701413,0.0005389993,0.00045202902,0.00073483435,0.0008888562,0.0006109428],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031712023,0.00085933966,0.9450211,0.000052932362,0.000029751152,0.0013181231,0.019639453,0.00016619104,0.0022256973,0.000084179046,0.00076425064,0.029521868],"study_design_scores_gemma":[0.000014940914,0.0016059162,0.9634194,0.000049341033,0.00004161911,0.0023202035,0.02970716,0.00048743267,0.0012983029,0.00012429226,0.00090681325,0.000024592517],"about_ca_topic_score_codex":0.005221686,"about_ca_topic_score_gemma":0.0067413137,"teacher_disagreement_score":0.005221686,"about_ca_system_score_codex":0.0005612797,"about_ca_system_score_gemma":0.00038064673,"threshold_uncertainty_score":0.010382593},"labels":[],"label_agreement":null},{"id":"W4317810549","doi":"10.1007/978-3-031-23492-7_5","title":"Human-AI Collaboration to Increase the Perception of VR","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Brandon University","funders":"","keywords":"Computer science; Perception; Human–computer interaction; Virtual reality; Computer graphics (images); Multimedia; Artificial intelligence; Psychology; Neuroscience","score_opus":0.026306364574433253,"score_gpt":0.3062625333021548,"score_spread":0.27995616872772155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317810549","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4670671,0.0051496257,0.24897571,0.0023731058,0.0005172892,0.00019889772,0.00016424476,0.0018771683,0.27367684],"genre_scores_gemma":[0.9461495,0.000526998,0.04121148,0.0002219518,0.00005625597,0.00007158036,0.00007879572,0.00011334081,0.0115700215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993331,0.00031143185,0.000016598018,0.00010515252,0.00017125756,0.000062389525],"domain_scores_gemma":[0.9985208,0.0009902008,0.00009394243,0.00010515768,0.00014694067,0.00014311553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007547458,0.00039735268,0.00016932936,0.00036998093,0.0003457031,0.0016757095,0.0005189664,0.0007010605,0.019228574],"category_scores_gemma":[0.003686574,0.00011069855,0.00026128272,0.0003182628,0.00034503915,0.001562278,0.0017266227,0.0007749168,0.0010153697],"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.0012862062,0.001612964,0.0051476024,0.0014224112,0.00018205872,0.0004994314,0.016309647,0.009418512,0.22517613,0.052311003,0.01822685,0.6684072],"study_design_scores_gemma":[0.0010604669,0.0067092394,0.1228202,0.001605714,0.0006074772,0.0048692212,0.03695539,0.16360468,0.13257892,0.16893592,0.35991943,0.0003333747],"about_ca_topic_score_codex":0.00066990854,"about_ca_topic_score_gemma":0.0007757018,"teacher_disagreement_score":0.019228574,"about_ca_system_score_codex":0.00027366608,"about_ca_system_score_gemma":0.0003510075,"threshold_uncertainty_score":0.06432599},"labels":[],"label_agreement":null},{"id":"W4317899376","doi":"10.1007/978-3-031-25049-1_11","title":"A Deterministic Model to Predict Execution Time of Spark Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Computer science; SPARK (programming language); Directed acyclic graph; Tree traversal; Execution time; Parallel computing; Cloud computing; Benchmark (surveying); Scheduling (production processes); Graph; Distributed computing; Theoretical computer science; Operating system; Algorithm; Programming language","score_opus":0.019034710912497185,"score_gpt":0.2435101432983835,"score_spread":0.2244754323858863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317899376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15011801,0.0010346756,0.84184396,0.00061288645,0.00021811726,0.00007657315,0.00085111306,0.00185958,0.0033850712],"genre_scores_gemma":[0.9570668,0.0003268044,0.037332855,0.00009119234,0.000116528485,0.00010990375,0.00058516837,0.000100678255,0.0042701736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.000101008496,0.000029683955,0.000155683,0.00012947911,0.00009123686],"domain_scores_gemma":[0.9973557,0.001980134,0.00021342945,0.00013419606,0.0002420944,0.00007446347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079714,0.0006533923,0.000996237,0.00056171534,0.0004851817,0.00080912997,0.0015880943,0.0009918333,0.0013716553],"category_scores_gemma":[0.0037691754,0.0007778654,0.0008726382,0.0006413244,0.0005775074,0.00071134156,0.00054208527,0.0010922832,0.0003418716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033297016,0.00001627958,0.00035689553,0.000012279441,0.0000127865105,0.000011068409,0.0000063382204,0.9944922,0.00026398388,0.0015890988,0.00026704086,0.0029387276],"study_design_scores_gemma":[0.0000015196617,0.000003755912,0.000052265288,4.7273664e-7,0.0000016295415,0.0000015448418,3.8719548e-7,0.9993894,0.000056339784,0.00046070697,0.000030748775,0.0000011954975],"about_ca_topic_score_codex":0.022208141,"about_ca_topic_score_gemma":0.014786178,"teacher_disagreement_score":0.022208141,"about_ca_system_score_codex":0.0013496573,"about_ca_system_score_gemma":0.0015613759,"threshold_uncertainty_score":0.044157803},"labels":[],"label_agreement":null},{"id":"W4317927003","doi":"10.1007/978-3-031-22963-3","title":"Advances in Cryptology – ASIACRYPT 2022","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ariel University; Fujian Normal University; Peking University; University of Haifa; Technische Universität Darmstadt; University of California, Riverside; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Tsinghua University; Télécom Paris; Aarhus Universitet; KU Leuven; Hebrew University of Jerusalem; East China Normal University; National University of Singapore; Radboud Universiteit; Nanyang Technological University; Universitetet i Bergen; Shanghai Jiao Tong University; University of Edinburgh; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Tel Aviv University; University of California, San Diego; Seoul National University; Georgia Institute of Technology; Institut Universitaire de France; Immanuel Kant Baltic Federal University; New York University Shanghai; Indian Institute of Science; Royal Holloway, University of London; University of North Carolina at Chapel Hill; Nanjing University of Aeronautics and Astronautics; University of Connecticut; Purdue University; Florida State University; Nanjing University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security","score_opus":0.018128365111129686,"score_gpt":0.28587990620546944,"score_spread":0.26775154109433974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317927003","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021080256,0.06206754,0.026266696,0.017581437,0.016193032,0.000073190866,0.0005082823,0.0008884413,0.8743134],"genre_scores_gemma":[0.038891315,0.039094836,0.009739101,0.0031761893,0.010889742,0.000078018864,0.0008159462,0.0006699471,0.8966449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989598,0.00020931853,0.000039689927,0.000118612195,0.00057519355,0.000097401586],"domain_scores_gemma":[0.9988527,0.00032070267,0.00007666608,0.0003167482,0.000301621,0.00013146734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012160989,0.0012664341,0.00076705223,0.0020656392,0.0010126146,0.0054181814,0.0007417593,0.0019156483,0.06516049],"category_scores_gemma":[0.0027367573,0.0005367379,0.00032778393,0.0029081395,0.0014402755,0.007597941,0.0020004848,0.004811901,0.048244487],"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.000047778638,0.00004785133,0.000094064366,0.00022788632,0.000012113384,0.000043687458,0.00003944124,0.0007115294,0.0006921602,0.18643291,0.5248079,0.28684267],"study_design_scores_gemma":[0.000011106276,0.000029639767,0.0002152471,0.0001321278,0.0000058711057,0.00021891487,0.00001639144,0.0015505258,0.00075419,0.05154482,0.94551224,0.000008890157],"about_ca_topic_score_codex":0.00080754823,"about_ca_topic_score_gemma":0.00096640433,"teacher_disagreement_score":0.06516049,"about_ca_system_score_codex":0.0021246437,"about_ca_system_score_gemma":0.0015604969,"threshold_uncertainty_score":0.21798354},"labels":[],"label_agreement":null},{"id":"W4317927042","doi":"10.1007/978-3-031-22969-5_17","title":"Short-lived Zero-Knowledge Proofs and Signatures","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical proof; Gas meter prover; Soundness; Computer science; Verifiable secret sharing; Theoretical computer science; Computation; Algorithm; Overhead (engineering); Zero-knowledge proof; Cryptography; Programming language; Mathematics","score_opus":0.020286219034343505,"score_gpt":0.2551109071273008,"score_spread":0.23482468809295728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317927042","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.021801794,0.021559818,0.69223183,0.008983878,0.002341026,0.0001444227,0.00054825697,0.0013254982,0.25106347],"genre_scores_gemma":[0.65381765,0.016971009,0.098515555,0.0017374243,0.0024729741,0.00032129494,0.0008253634,0.00083617,0.22450262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748,0.00079099013,0.00017216291,0.00035305414,0.0009676193,0.00023622924],"domain_scores_gemma":[0.99322057,0.0042216815,0.0003387479,0.0016162284,0.0004472999,0.00015543685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002091562,0.00091143756,0.000912425,0.0014048422,0.0017755277,0.0058796275,0.0017431497,0.002372834,0.013599967],"category_scores_gemma":[0.009382405,0.0009704123,0.00078850973,0.002698027,0.0065705185,0.018392738,0.0038187942,0.0055483016,0.0053349654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002517275,0.000010405866,0.000029400415,0.00011028674,0.000005233176,0.000035642253,0.00021619264,0.000663244,0.000341897,0.9745311,0.0039219907,0.02010927],"study_design_scores_gemma":[0.0000033984975,0.0000061145834,0.00001139028,0.000024739775,0.0000030960941,0.00007080865,0.00001905909,0.0006624576,0.00048251933,0.9848433,0.013866665,0.0000064029523],"about_ca_topic_score_codex":0.00018675583,"about_ca_topic_score_gemma":0.00014587064,"teacher_disagreement_score":0.013599967,"about_ca_system_score_codex":0.0020999468,"about_ca_system_score_gemma":0.0013158582,"threshold_uncertainty_score":0.045496404},"labels":[],"label_agreement":null},{"id":"W4317928322","doi":"10.1007/978-3-031-22972-5_12","title":"Instantiability of Classical Random-Oracle-Model Encryption Transforms","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Encryption; Computer science; Hash function; Theoretical computer science; Functional encryption; Plaintext; Cryptography; Semantic security; Public-key cryptography; Obfuscation; Concrete security; Mathematical proof; Mathematics; Algorithm; Ciphertext; Computer security; Attribute-based encryption","score_opus":0.016451760449138028,"score_gpt":0.2462147380908453,"score_spread":0.22976297764170728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317928322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14460593,0.0012474344,0.72152066,0.0032118848,0.00042808626,0.00014852169,0.0006274885,0.0010337469,0.12717617],"genre_scores_gemma":[0.94185513,0.0006857171,0.039326776,0.000512465,0.0002909851,0.000116565396,0.0005994018,0.00033182267,0.016281236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957196,0.0012495642,0.0002745706,0.00081006595,0.0013112429,0.00063492154],"domain_scores_gemma":[0.9945438,0.002628371,0.00026416229,0.002045311,0.0003467156,0.0001717218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002790741,0.00072342803,0.0013256113,0.00084582315,0.0011164587,0.004404255,0.0015900945,0.0018263488,0.00812811],"category_scores_gemma":[0.010684746,0.00055184396,0.0018870851,0.0011801876,0.0039164377,0.011469321,0.0040496946,0.005085255,0.00179068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047915528,0.000018184566,0.0000665269,0.00001786989,0.0000063393936,0.000042316533,0.000057839396,0.00162082,0.00040338957,0.99332076,0.0005524848,0.0038454498],"study_design_scores_gemma":[0.000013234579,0.000009209315,0.000043913737,0.0000073004,0.000006453846,0.000079893776,0.00001389885,0.010338072,0.0010059607,0.9872437,0.0012312906,0.0000070505976],"about_ca_topic_score_codex":0.00029935793,"about_ca_topic_score_gemma":0.00019239692,"teacher_disagreement_score":0.00812811,"about_ca_system_score_codex":0.0017193272,"about_ca_system_score_gemma":0.0008429431,"threshold_uncertainty_score":0.027191222},"labels":[],"label_agreement":null},{"id":"W4317928338","doi":"10.1007/978-3-031-22972-5","title":"Advances in Cryptology – ASIACRYPT 2022","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":6,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; Ariel University; Fujian Normal University; Peking University; University of Haifa; Technische Universität Darmstadt; University of California, Riverside; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Tsinghua University; Télécom Paris; Aarhus Universitet; KU Leuven; Hebrew University of Jerusalem; East China Normal University; National University of Singapore; Radboud Universiteit; Nanyang Technological University; Universitetet i Bergen; Shanghai Jiao Tong University; University of Edinburgh; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Tel Aviv University; University of California, San Diego; Seoul National University; Georgia Institute of Technology; Institut Universitaire de France; Immanuel Kant Baltic Federal University; New York University Shanghai; Indian Institute of Science; Royal Holloway, University of London; University of North Carolina at Chapel Hill; Nanjing University of Aeronautics and Astronautics; University of Connecticut; Purdue University; Florida State University; Nanjing University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Algorithm","score_opus":0.018128365111129686,"score_gpt":0.28587990620546944,"score_spread":0.26775154109433974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317928338","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021080256,0.06206754,0.026266696,0.017581437,0.016193032,0.000073190866,0.0005082823,0.0008884413,0.8743134],"genre_scores_gemma":[0.038891315,0.039094836,0.009739101,0.0031761893,0.010889742,0.000078018864,0.0008159462,0.0006699471,0.8966449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989598,0.00020931853,0.000039689927,0.000118612195,0.00057519355,0.000097401586],"domain_scores_gemma":[0.9988527,0.00032070267,0.00007666608,0.0003167482,0.000301621,0.00013146734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012160989,0.0012664341,0.00076705223,0.0020656392,0.0010126146,0.0054181814,0.0007417593,0.0019156483,0.06516049],"category_scores_gemma":[0.0027367573,0.0005367379,0.00032778393,0.0029081395,0.0014402755,0.007597941,0.0020004848,0.004811901,0.048244487],"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.000047778638,0.00004785133,0.000094064366,0.00022788632,0.000012113384,0.000043687458,0.00003944124,0.0007115294,0.0006921602,0.18643291,0.5248079,0.28684267],"study_design_scores_gemma":[0.000011106276,0.000029639767,0.0002152471,0.0001321278,0.0000058711057,0.00021891487,0.00001639144,0.0015505258,0.00075419,0.05154482,0.94551224,0.000008890157],"about_ca_topic_score_codex":0.00080754823,"about_ca_topic_score_gemma":0.00096640433,"teacher_disagreement_score":0.06516049,"about_ca_system_score_codex":0.0021246437,"about_ca_system_score_gemma":0.0015604969,"threshold_uncertainty_score":0.21798354},"labels":[],"label_agreement":null},{"id":"W4317928339","doi":"10.1007/978-3-031-22969-5","title":"Advances in Cryptology – ASIACRYPT 2022","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ariel University; Fujian Normal University; Peking University; University of Haifa; Technische Universität Darmstadt; University of California, Riverside; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Tsinghua University; Télécom Paris; Aarhus Universitet; KU Leuven; Hebrew University of Jerusalem; East China Normal University; National University of Singapore; Radboud Universiteit; Nanyang Technological University; Universitetet i Bergen; Shanghai Jiao Tong University; University of Edinburgh; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Tel Aviv University; University of California, San Diego; Seoul National University; Georgia Institute of Technology; Institut Universitaire de France; Immanuel Kant Baltic Federal University; New York University Shanghai; Indian Institute of Science; Royal Holloway, University of London; University of North Carolina at Chapel Hill; Nanjing University of Aeronautics and Astronautics; University of Connecticut; Purdue University; Florida State University; Nanjing University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Computer security","score_opus":0.018128365111129686,"score_gpt":0.28587990620546944,"score_spread":0.26775154109433974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317928339","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021080256,0.06206754,0.026266696,0.017581437,0.016193032,0.000073190866,0.0005082823,0.0008884413,0.8743134],"genre_scores_gemma":[0.038891315,0.039094836,0.009739101,0.0031761893,0.010889742,0.000078018864,0.0008159462,0.0006699471,0.8966449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989598,0.00020931853,0.000039689927,0.000118612195,0.00057519355,0.000097401586],"domain_scores_gemma":[0.9988527,0.00032070267,0.00007666608,0.0003167482,0.000301621,0.00013146734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012160989,0.0012664341,0.00076705223,0.0020656392,0.0010126146,0.0054181814,0.0007417593,0.0019156483,0.06516049],"category_scores_gemma":[0.0027367573,0.0005367379,0.00032778393,0.0029081395,0.0014402755,0.007597941,0.0020004848,0.004811901,0.048244487],"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.000047778638,0.00004785133,0.000094064366,0.00022788632,0.000012113384,0.000043687458,0.00003944124,0.0007115294,0.0006921602,0.18643291,0.5248079,0.28684267],"study_design_scores_gemma":[0.000011106276,0.000029639767,0.0002152471,0.0001321278,0.0000058711057,0.00021891487,0.00001639144,0.0015505258,0.00075419,0.05154482,0.94551224,0.000008890157],"about_ca_topic_score_codex":0.00080754823,"about_ca_topic_score_gemma":0.00096640433,"teacher_disagreement_score":0.06516049,"about_ca_system_score_codex":0.0021246437,"about_ca_system_score_gemma":0.0015604969,"threshold_uncertainty_score":0.21798354},"labels":[],"label_agreement":null},{"id":"W4318023037","doi":"10.1007/978-3-031-25211-2","title":"Algorithms and Discrete Applied Mathematics","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"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":"Université de Paris; Malaviya National Institute of Technology, Jaipur; Università degli Studi di Perugia; Universidade Federal Fluminense; Università di Pisa; Indian Institute of Technology Delhi; Birla Institute of Technology and Science, Pilani; Indian Institute of Technology Palakkad; Indian Institute of Technology Madras; Lunds Universitet; Ahmedabad University; Indian Institute of Technology Gandhinagar; University of Twente; Indian Institute of Technology Bhilai; Institute of Mathematical Sciences; Université Cheikh Anta Diop de Dakar; National Institute of Technology Srinagar; University of Lethbridge; Indian Institute of Science","keywords":"Computer science; Graph theory; Computational complexity theory; Theoretical computer science; Game theory; Computational geometry; Algorithm; Mathematical economics; Mathematics; Combinatorics","score_opus":0.018483627893683272,"score_gpt":0.2547746788875921,"score_spread":0.23629105099390882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318023037","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048484476,0.15065461,0.13553858,0.008640844,0.007374741,0.00008915559,0.00061223115,0.00065120193,0.69159013],"genre_scores_gemma":[0.19036832,0.14751557,0.11890395,0.00584019,0.01602268,0.0008837008,0.001756189,0.0008877897,0.5178217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999485,0.00013740321,0.000027927324,0.0001061459,0.00020799508,0.00003554527],"domain_scores_gemma":[0.9994809,0.0003066378,0.00002638858,0.00008018793,0.00007343876,0.000032539185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005299404,0.0013795925,0.0018625516,0.0016842048,0.0010542043,0.0043436354,0.00083702616,0.0008733548,0.019643513],"category_scores_gemma":[0.0016932971,0.00044702238,0.00063991616,0.0037029139,0.0032868206,0.0035243512,0.0012080438,0.0046966374,0.007254672],"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.000014331963,0.000021948503,0.000097184486,0.00033529624,0.000017270182,0.000024448129,0.00013272946,0.00087011827,0.00034496118,0.86820614,0.049650703,0.080284834],"study_design_scores_gemma":[0.000014341435,0.000013382549,0.00024028875,0.00008847185,0.0000091160755,0.00009375651,0.000048544865,0.0019471725,0.00012149807,0.83380836,0.16360873,0.000006397795],"about_ca_topic_score_codex":0.00092071394,"about_ca_topic_score_gemma":0.0008782617,"teacher_disagreement_score":0.019643513,"about_ca_system_score_codex":0.00221244,"about_ca_system_score_gemma":0.0009991918,"threshold_uncertainty_score":0.06571412},"labels":[],"label_agreement":null},{"id":"W4318023071","doi":"10.1007/978-3-031-25211-2_4","title":"Resource Management in Device-to-Device Communications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MIMO Systems Optimization","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 Lethbridge","funders":"","keywords":"Computer science; Underlay; Interference (communication); Rounding; Mathematical optimization; Channel (broadcasting); Resource allocation; Shared resource; Algorithm; Telecommunications; Computer network; Signal-to-noise ratio (imaging); Mathematics","score_opus":0.02589829707835005,"score_gpt":0.26254048596609,"score_spread":0.2366421888877399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318023071","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007884815,0.025745073,0.8769813,0.001225431,0.0018724648,0.00008453752,0.00015413089,0.00050177827,0.08555046],"genre_scores_gemma":[0.6451267,0.041748278,0.1523304,0.0012101091,0.003063952,0.00028731514,0.00030533402,0.00034183642,0.15558618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959046,0.00013099704,0.00001462018,0.00007258621,0.00012118249,0.00007009172],"domain_scores_gemma":[0.9996648,0.00021690398,0.000015794214,0.000047059955,0.000040164894,0.000015281803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048481906,0.0010905629,0.0010183351,0.000310873,0.00051770854,0.002091782,0.0012371035,0.0008633318,0.009308016],"category_scores_gemma":[0.0009116251,0.00042767383,0.00035308197,0.0011392192,0.00066101423,0.0017350602,0.0012200088,0.0012572082,0.0020863663],"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.00012463049,0.000100121884,0.00024442642,0.0007911237,0.00008932984,0.00033476477,0.00013115935,0.24963142,0.010392165,0.34041566,0.046145514,0.35159972],"study_design_scores_gemma":[0.000016111977,0.000166369,0.0005411773,0.0002096045,0.000062474945,0.0005751563,0.00015977578,0.6582731,0.004762744,0.25006792,0.08511039,0.000055172237],"about_ca_topic_score_codex":0.0007475128,"about_ca_topic_score_gemma":0.0011840358,"teacher_disagreement_score":0.009308016,"about_ca_system_score_codex":0.0007873961,"about_ca_system_score_gemma":0.0004995255,"threshold_uncertainty_score":0.03113842},"labels":[],"label_agreement":null},{"id":"W4318023126","doi":"10.1007/978-3-031-25211-2_7","title":"Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Polygon (computer graphics); Regular polygon; Simple (philosophy); Plane (geometry); Obstacle; Computer science; Metric (unit); Combinatorics; Euclidean geometry; Convex polygon; Mathematics; Geometry; Telecommunications; Geography","score_opus":0.025080428977623633,"score_gpt":0.26063191313751566,"score_spread":0.23555148415989202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318023126","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18405098,0.0010629384,0.60387266,0.0012481596,0.0004086772,0.00031421747,0.000638006,0.00026540304,0.20813894],"genre_scores_gemma":[0.8085474,0.0010279005,0.12687756,0.00018917842,0.000121565216,0.00021688378,0.00024649294,0.00013487198,0.06263815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947757,0.0001846399,0.000022249584,0.0000714137,0.00013776237,0.000106426276],"domain_scores_gemma":[0.9994574,0.000278825,0.000062795574,0.00005148937,0.000043646898,0.00010589121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034106427,0.0008506196,0.0013695596,0.00044296545,0.000865823,0.0022185694,0.0018554643,0.0018253304,0.0072368635],"category_scores_gemma":[0.0017135327,0.000573124,0.0008449511,0.0008348866,0.0013573226,0.002376952,0.002348566,0.0013789487,0.0009473861],"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.000121279576,0.00005628123,0.00016735958,0.00011635413,0.000029706898,0.00022187513,0.00012281175,0.20454714,0.0017297493,0.7780927,0.0037266326,0.011068105],"study_design_scores_gemma":[0.00008494679,0.00006698466,0.00015963471,0.000035640525,0.000016803726,0.00018713967,0.00012546686,0.4912526,0.0006689444,0.49630186,0.011071453,0.000028504073],"about_ca_topic_score_codex":0.003205433,"about_ca_topic_score_gemma":0.0036177454,"teacher_disagreement_score":0.0072368635,"about_ca_system_score_codex":0.0008758215,"about_ca_system_score_gemma":0.00084467663,"threshold_uncertainty_score":0.024209738},"labels":[],"label_agreement":null},{"id":"W4318213591","doi":"10.1007/978-3-031-23443-9_24","title":"Skeletal Model-Based Analysis of the Tricuspid Valve in Hypoplastic Left Heart Syndrome","year":2022,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Heart, Lung, and Blood Institute","keywords":"Tricuspid valve; Atrioventricular valve; Regurgitation (circulation); Computer science; Hypoplastic left heart syndrome; Representation (politics); Heart disease; Population; Medicine; Artificial intelligence; Cardiology","score_opus":0.00954857279652928,"score_gpt":0.28677276577415195,"score_spread":0.2772241929776227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318213591","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.5295494,0.0006614501,0.46354017,0.00035661654,0.00010245522,0.00008687718,0.0010413224,0.0016868338,0.0029747835],"genre_scores_gemma":[0.9426715,0.00026694286,0.052589994,0.000040818,0.000029611025,0.000028268327,0.0011420262,0.0001872285,0.0030437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998907,0.000022688295,0.000007238169,0.000029541881,0.000035894554,0.000013922641],"domain_scores_gemma":[0.9998652,0.000050126084,0.000018935698,0.0000142692525,0.000036334197,0.000015098338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020915671,0.0004744715,0.00043807772,0.0008699632,0.00019067967,0.0006881938,0.0004691878,0.00058227003,0.001700227],"category_scores_gemma":[0.0005329034,0.0001891618,0.00080718315,0.00031270465,0.00016515974,0.00018203896,0.00038871515,0.0003033341,0.0005118872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061125966,0.00016102236,0.02007602,0.00018046843,0.00025000423,0.002528691,0.00012312477,0.5081602,0.13113907,0.004528216,0.00432867,0.32791322],"study_design_scores_gemma":[0.000004950053,0.000032881053,0.0043410324,0.0000062789977,0.000020250613,0.0002848093,0.000018672132,0.9912834,0.0028798839,0.0007562228,0.00036394832,0.000007722547],"about_ca_topic_score_codex":0.0063256836,"about_ca_topic_score_gemma":0.0078647025,"teacher_disagreement_score":0.0063256836,"about_ca_system_score_codex":0.00021055837,"about_ca_system_score_gemma":0.0003799028,"threshold_uncertainty_score":0.012577772},"labels":[],"label_agreement":null},{"id":"W4318213758","doi":"10.1007/978-3-031-23443-9_37","title":"Deep Learning Based Classification and Segmentation for Cardiac Magnetic Resonance Imaging with Respiratory Motion Artifacts","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Context (archaeology); Magnetic resonance imaging; Image segmentation; Computer vision; Focus (optics); Cardiac magnetic resonance; Medical imaging; Cardiac magnetic resonance imaging; Process (computing); Motion (physics); Cardiac imaging; Pattern recognition (psychology); Radiology; Medicine","score_opus":0.02102535234858378,"score_gpt":0.28262342043071403,"score_spread":0.26159806808213026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318213758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014443327,0.0016827411,0.97929364,0.0002801374,0.00011865056,0.000041343563,0.00029359772,0.0017738354,0.002072666],"genre_scores_gemma":[0.20869415,0.002375898,0.7619679,0.00038401302,0.00019205658,0.00011576062,0.0017266278,0.0006461829,0.023897374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997619,0.000027311326,0.000014752056,0.00007256813,0.000071288705,0.000052210376],"domain_scores_gemma":[0.9994374,0.00023711055,0.00004888463,0.00007773892,0.00016801985,0.00003086336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068669085,0.00091019785,0.00094579515,0.0008038174,0.00036593157,0.0010335009,0.001477853,0.0013684449,0.0033418334],"category_scores_gemma":[0.0010894134,0.00064184784,0.00090179464,0.0010793235,0.00036774515,0.0009490833,0.0010402204,0.0015310526,0.0016553411],"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.00012554068,0.00009789835,0.0005857031,0.00011774508,0.000057538135,0.000064322565,0.00005493847,0.086124234,0.025450889,0.005218199,0.008977921,0.87312514],"study_design_scores_gemma":[0.00000367782,0.000030691397,0.0003294033,0.000020806821,0.000016442498,0.00006126545,0.00000925991,0.98132527,0.010172282,0.0052203992,0.0028020209,0.0000085457095],"about_ca_topic_score_codex":0.008688988,"about_ca_topic_score_gemma":0.015658394,"teacher_disagreement_score":0.008688988,"about_ca_system_score_codex":0.0009803963,"about_ca_system_score_gemma":0.0010616239,"threshold_uncertainty_score":0.017276824},"labels":[],"label_agreement":null},{"id":"W4318615885","doi":"10.1007/978-3-031-26118-3_8","title":"A Blockchain-Based Distributed Machine Learning (BDML) Approach for Resource Allocation in Vehicular Ad-Hoc Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"Carleton University","funders":"","keywords":"Computer science; Vehicular ad hoc network; Distributed computing; Leverage (statistics); Wireless ad hoc network; Reinforcement learning; Resource allocation; Edge computing; Computer network; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Wireless","score_opus":0.011020002041464251,"score_gpt":0.20494780421598296,"score_spread":0.19392780217451872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318615885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034047482,0.0002108126,0.99292374,0.00025419446,0.00006839699,0.00006765657,0.000083593564,0.0004125586,0.0025742212],"genre_scores_gemma":[0.45237485,0.000734263,0.53298,0.00028686228,0.0001753435,0.00044890976,0.0005204307,0.00024337304,0.012236058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985857,0.0006027714,0.00008176991,0.00020399994,0.0004044846,0.00012132097],"domain_scores_gemma":[0.99709296,0.0019420859,0.0000961125,0.00037750875,0.000373587,0.000117670024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018242376,0.0005616195,0.0013615187,0.000603695,0.001059896,0.0016373424,0.0023829048,0.0014101793,0.007599803],"category_scores_gemma":[0.0049127894,0.00045256212,0.00059026724,0.0015388025,0.0010870275,0.0026082688,0.0025614153,0.0022590968,0.00112779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013464045,0.00012518765,0.00034113333,0.00014382829,0.000038497587,0.00010030115,0.00011150711,0.75871897,0.001774731,0.0790001,0.0035413455,0.15596975],"study_design_scores_gemma":[0.000008720273,0.000012473931,0.000020259162,0.00000570968,0.000003489768,0.000012032187,0.0000081286,0.96822214,0.00031850155,0.030370971,0.0010141485,0.0000034096138],"about_ca_topic_score_codex":0.004860738,"about_ca_topic_score_gemma":0.0069035767,"teacher_disagreement_score":0.007599803,"about_ca_system_score_codex":0.0012062817,"about_ca_system_score_gemma":0.002122244,"threshold_uncertainty_score":0.025423884},"labels":[],"label_agreement":null},{"id":"W4318711404","doi":"10.1007/978-3-031-24667-8_4","title":"AR Point &amp;Click: An Interface for Setting Robot Navigation Goals","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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 Victoria","funders":"","keywords":"Headset; Computer science; Interface (matter); Robot; Augmented reality; Human–computer interaction; Point (geometry); Gesture; Set (abstract data type); User interface; Mobile robot; Mobile robot navigation; Computer vision; Artificial intelligence; Robot control; Operating system; Programming language","score_opus":0.02886314099213583,"score_gpt":0.3049990271546153,"score_spread":0.27613588616247947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318711404","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017504834,0.0008267513,0.7951993,0.0002762341,0.0006461502,0.00031143904,0.002601852,0.11738917,0.06524432],"genre_scores_gemma":[0.17197132,0.0013116611,0.5344568,0.0016311663,0.00030589433,0.0013399821,0.0064347056,0.021705827,0.26084265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979013,0.00003074204,0.000012104607,0.000037310743,0.00010558345,0.00002412446],"domain_scores_gemma":[0.99915576,0.00052045484,0.00002941111,0.00006277812,0.00014053393,0.00009102136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044274447,0.001596052,0.00070495234,0.0006108548,0.00037011076,0.0010178796,0.0016621818,0.0019269336,0.1186037],"category_scores_gemma":[0.0017536408,0.00046908,0.0003997034,0.0004260886,0.00029434022,0.0014922277,0.0016013798,0.00087337475,0.0404197],"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.0025471759,0.0002928854,0.001098807,0.000883125,0.00004471891,0.0013616767,0.0011072538,0.0020440018,0.12424009,0.009179838,0.28704605,0.5701545],"study_design_scores_gemma":[0.00084316864,0.0012284036,0.00881389,0.0006591935,0.00022351998,0.0045698616,0.0006413517,0.104432344,0.12542161,0.011545024,0.74113464,0.0004869519],"about_ca_topic_score_codex":0.0010945195,"about_ca_topic_score_gemma":0.002188441,"teacher_disagreement_score":0.1186037,"about_ca_system_score_codex":0.00019145888,"about_ca_system_score_gemma":0.00025218024,"threshold_uncertainty_score":0.39676893},"labels":[],"label_agreement":null},{"id":"W4318814399","doi":"10.1007/978-3-031-24670-8_27","title":"Social Robots in the Stuttering Clinic: A Human-Centred Exploration with Speech Language Pathologists","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stuttering Research and Treatment","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Stuttering; Computer science; Robot; Exploratory research; Intervention (counseling); Focus group; Qualitative research; Process (computing); Focus (optics); Applied psychology; Medical education; Psychology; Artificial intelligence; Nursing; Medicine; Sociology; Developmental psychology","score_opus":0.10072337619690291,"score_gpt":0.3809921735025598,"score_spread":0.2802687973056569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318814399","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.8434277,0.0089733,0.014595221,0.025270086,0.0010511691,0.00042378585,0.00024375565,0.0006127397,0.105402194],"genre_scores_gemma":[0.93361986,0.004694358,0.016309714,0.0032455586,0.00017216988,0.000456595,0.00021121226,0.00023665142,0.041053902],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9946202,0.004214084,0.00006337994,0.00027994506,0.00033105502,0.00049130624],"domain_scores_gemma":[0.99495465,0.0027521818,0.00027261532,0.00015625627,0.0003145078,0.0015498446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054270024,0.0008260573,0.00043757047,0.0008527296,0.0068371305,0.0041846177,0.0016620014,0.002624169,0.0080909785],"category_scores_gemma":[0.0062944517,0.00050419034,0.0005008856,0.0006459105,0.0045856964,0.003710079,0.0060211355,0.0029126878,0.0016496471],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005384402,0.0021277706,0.016385436,0.00060482224,0.00005961834,0.0075969617,0.6155022,0.0009657112,0.002320391,0.008924349,0.056080893,0.2888935],"study_design_scores_gemma":[0.00009570548,0.0017317857,0.019671103,0.0007305271,0.000040464467,0.007331293,0.77261883,0.001478438,0.0015881123,0.0067613446,0.18779019,0.00016220912],"about_ca_topic_score_codex":0.0021246315,"about_ca_topic_score_gemma":0.009854228,"teacher_disagreement_score":0.0080909785,"about_ca_system_score_codex":0.002168643,"about_ca_system_score_gemma":0.004387366,"threshold_uncertainty_score":0.028701067},"labels":[],"label_agreement":null},{"id":"W4318814588","doi":"10.1007/978-3-031-24670-8_37","title":"Play Dynamics in a Collaborative Game with a Robot as a Play-Mediator","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joystick; Computer science; Human–computer interaction; Focus (optics); Task (project management); Robot; Dynamics (music); Action (physics); Mobile robot; Multimedia; Artificial intelligence; Simulation; Psychology; Engineering","score_opus":0.014588120607223533,"score_gpt":0.30729143202927944,"score_spread":0.2927033114220559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318814588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25474283,0.0003035794,0.6395662,0.0006229226,0.00011553874,0.00021358857,0.00011550172,0.0007689184,0.1035509],"genre_scores_gemma":[0.8836054,0.00011030656,0.08322712,0.00004717062,0.000013874831,0.00022159624,0.00008063676,0.00010189242,0.03259196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9997372,0.000107658256,0.000007744943,0.000049148723,0.000059053094,0.00003908964],"domain_scores_gemma":[0.99972993,0.00015928793,0.000014167883,0.00001839664,0.000015987212,0.00006220607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032323395,0.0005373161,0.0003903232,0.00027204983,0.001241108,0.0015482103,0.0009600322,0.00089882786,0.008543696],"category_scores_gemma":[0.0008093717,0.00039813964,0.00034645485,0.0001732976,0.0012254028,0.0019070193,0.0019448875,0.0008883194,0.00096940884],"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.0015650333,0.000814944,0.003917917,0.0002479747,0.00006933309,0.0020242168,0.012798617,0.122373454,0.06501614,0.70030594,0.0047920262,0.08607445],"study_design_scores_gemma":[0.00015912765,0.0005834347,0.0023478763,0.00006486114,0.00003722833,0.00068289053,0.0039594225,0.79184717,0.010093528,0.16098596,0.02916872,0.000069806716],"about_ca_topic_score_codex":0.0029544034,"about_ca_topic_score_gemma":0.003141456,"teacher_disagreement_score":0.008543696,"about_ca_system_score_codex":0.0005108324,"about_ca_system_score_gemma":0.0006129985,"threshold_uncertainty_score":0.0285815},"labels":[],"label_agreement":null},{"id":"W4318815495","doi":"10.1007/978-3-031-24670-8_15","title":"Kinesthetic Teaching of a Robot over Multiple Sessions: Impacts on Speed and Success","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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":"University of Waterloo","funders":"","keywords":"Kinesthetic learning; Robot; Computer science; Set (abstract data type); Humanoid robot; Human–computer interaction; Intervention (counseling); Social robot; Artificial intelligence; Multimedia; Robot control; Psychology; Mathematics education; Mobile robot","score_opus":0.019011801130741055,"score_gpt":0.25540476028573195,"score_spread":0.2363929591549909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318815495","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.98907566,0.00033540503,0.0026692778,0.00010085948,0.000040934367,0.00009006313,0.000077997276,0.00025145168,0.0073583527],"genre_scores_gemma":[0.98439145,0.000378768,0.003789062,0.000033970566,0.000029790874,0.00017457298,0.00017382971,0.00014842885,0.010880087],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854434,0.0003697361,0.00007562823,0.00026527522,0.00048724154,0.00025786992],"domain_scores_gemma":[0.9872218,0.0079204915,0.00092674885,0.0006586617,0.0010728275,0.0021994284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015061817,0.00064260594,0.00072402356,0.0008768172,0.00058984343,0.0015706612,0.0010692547,0.00087986613,0.012336936],"category_scores_gemma":[0.013079067,0.00030029897,0.00041688257,0.0006005392,0.0004232688,0.0012291612,0.0018295158,0.0007414091,0.0023840521],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016267272,0.027156625,0.049557507,0.00097595213,0.00034049168,0.0005543329,0.0040062624,0.010113404,0.06069543,0.0012144588,0.0032876735,0.8258305],"study_design_scores_gemma":[0.003219313,0.10112268,0.7158616,0.0008053461,0.0014867962,0.002548286,0.013377395,0.053855795,0.07335728,0.0065443655,0.027419908,0.00040130274],"about_ca_topic_score_codex":0.0012373102,"about_ca_topic_score_gemma":0.0013692101,"teacher_disagreement_score":0.012336936,"about_ca_system_score_codex":0.0005078333,"about_ca_system_score_gemma":0.00096107146,"threshold_uncertainty_score":0.04127115},"labels":[],"label_agreement":null},{"id":"W4318815540","doi":"10.1007/978-3-031-24670-8_14","title":"User Evaluation of Social Robots as a Tool in One-to-One Instructional Settings for Students with Learning Disabilities","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Assistive Technology in Communication and Mobility","field":"Health Professions","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":"Positive Living Society of British Columbia; University of Waterloo","funders":"","keywords":"Session (web analytics); Robot; Task (project management); Computer science; Social robot; Boosting (machine learning); Intervention (counseling); Learning disability; Psychology; Applied psychology; Control (management); Human–computer interaction; Multimedia; Medical education; Mathematics education; Artificial intelligence; Mobile robot; Robot control; Developmental psychology; Engineering; World Wide Web; Medicine","score_opus":0.09125541277771962,"score_gpt":0.4348816780059497,"score_spread":0.34362626522823003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318815540","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.9968719,0.00007459242,0.0012470151,0.000026941254,0.000011629247,0.00023269875,0.00010979664,0.00013868256,0.001286788],"genre_scores_gemma":[0.98847485,0.0001603807,0.006922935,0.000034648856,0.000009864137,0.00061346387,0.00036950991,0.000046828693,0.0033673455],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99783844,0.0012732974,0.00020872634,0.00016136155,0.00038155992,0.00013658851],"domain_scores_gemma":[0.98945135,0.007510028,0.00039712456,0.00042719248,0.0014625902,0.0007516992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029649043,0.0006965671,0.00067872455,0.00083963433,0.00049685483,0.0008584956,0.0010111083,0.0006385411,0.0048471065],"category_scores_gemma":[0.012894058,0.00024701635,0.0005466877,0.00034714089,0.00038599715,0.00080318376,0.00096104393,0.00033592386,0.0010924579],"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.028239762,0.044617496,0.12281325,0.0032487588,0.00046844562,0.0014296345,0.059929773,0.004559364,0.04058984,0.00058329036,0.008771181,0.68474925],"study_design_scores_gemma":[0.0035382526,0.22305833,0.55578864,0.0010238282,0.0017638884,0.0034595686,0.073367976,0.053665522,0.06196036,0.0008319851,0.020877033,0.0006645974],"about_ca_topic_score_codex":0.0019091599,"about_ca_topic_score_gemma":0.0030073423,"teacher_disagreement_score":0.0048471065,"about_ca_system_score_codex":0.0004170165,"about_ca_system_score_gemma":0.0005045071,"threshold_uncertainty_score":0.016215205},"labels":[],"label_agreement":null},{"id":"W4318815635","doi":"10.1007/978-3-031-24670-8_7","title":"Towards Developing Adaptive Robot Controllers for Children with Upper Limb Impairments - Initial Data Collection and Analysis","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cerebral Palsy and Movement Disorders","field":"Medicine","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":"Joystick; Computer science; Robot; Testbed; Artificial intelligence; Simulation; Human–computer interaction","score_opus":0.03248810643900079,"score_gpt":0.29017700919937045,"score_spread":0.25768890276036965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318815635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08308905,0.00044063688,0.90891653,0.00016257593,0.000038155715,0.0009822028,0.0010118491,0.0022158993,0.0031430384],"genre_scores_gemma":[0.15816265,0.00051903306,0.83180684,0.00006658166,0.000010105791,0.0012323973,0.0024341617,0.00019796494,0.005570258],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993315,0.00014511702,0.000051735868,0.00013093087,0.0002839441,0.000056931818],"domain_scores_gemma":[0.9984847,0.00072718674,0.00007017,0.00014414696,0.000537243,0.000036541212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015048812,0.0008348933,0.000551906,0.0006223372,0.0003634764,0.001038966,0.0012490591,0.0007063935,0.0030605448],"category_scores_gemma":[0.0029459428,0.0003756038,0.00039454742,0.0006046258,0.000357124,0.0008064359,0.0009269225,0.0008144897,0.00097398675],"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.0004876585,0.00045538667,0.009848131,0.0006468878,0.000078704055,0.00032765302,0.00088562554,0.041012328,0.11855395,0.0026484977,0.004301938,0.8207533],"study_design_scores_gemma":[0.00018779794,0.0028991986,0.053855274,0.0004189785,0.00022534055,0.0010565287,0.002673391,0.5695259,0.32472724,0.0066439374,0.037654273,0.00013213135],"about_ca_topic_score_codex":0.0050676307,"about_ca_topic_score_gemma":0.006588867,"teacher_disagreement_score":0.0050676307,"about_ca_system_score_codex":0.0003964597,"about_ca_system_score_gemma":0.0010334777,"threshold_uncertainty_score":0.010238528},"labels":[],"label_agreement":null},{"id":"W4318833798","doi":"10.1007/978-3-031-24670-8_20","title":"Deep Learning-Based Multi-modal COVID-19 Screening by Socially Assistive Robots Using Cough and Breathing Symptoms","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Health Sciences North; Baycrest Hospital; Toronto Rehabilitation Institute; University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Coronavirus disease 2019 (COVID-19); Transfer of learning; Robot; Architecture; Modal; Machine learning; Human–computer interaction; Medicine; Disease","score_opus":0.03624407075930807,"score_gpt":0.3221787836988769,"score_spread":0.28593471293956885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318833798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23056735,0.00346888,0.7415644,0.0011643474,0.0006056845,0.00023945521,0.0017991713,0.004501179,0.0160896],"genre_scores_gemma":[0.8891128,0.000847148,0.09693058,0.00048908894,0.00016858753,0.00014809326,0.0014250875,0.00011180221,0.010766803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997919,0.000040620842,0.000010016838,0.00006681902,0.000041571056,0.00004906224],"domain_scores_gemma":[0.9998128,0.00009054927,0.00001589758,0.00001178116,0.000046991307,0.000022117541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029325427,0.0008659798,0.00070159783,0.00043749722,0.00022473777,0.00049337005,0.0006745173,0.0008614895,0.002172393],"category_scores_gemma":[0.0008037925,0.00025380406,0.0007004521,0.0002675022,0.00016929109,0.0004247117,0.0008031513,0.0006553102,0.0009946546],"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.00065340236,0.0004978979,0.016291855,0.0002974006,0.00020795733,0.0007698771,0.00017116025,0.08605567,0.035424903,0.0011225505,0.01468677,0.84382045],"study_design_scores_gemma":[0.000021772094,0.00026972537,0.009523155,0.00005683494,0.00009055611,0.00047730366,0.00010442046,0.9751661,0.009794776,0.0020389257,0.002420715,0.00003577281],"about_ca_topic_score_codex":0.003154657,"about_ca_topic_score_gemma":0.005556005,"teacher_disagreement_score":0.003154657,"about_ca_system_score_codex":0.00024153404,"about_ca_system_score_gemma":0.00034930205,"threshold_uncertainty_score":0.007267356},"labels":[],"label_agreement":null},{"id":"W4319033632","doi":"10.1007/978-3-031-22061-6_35","title":"Correction to: SimFormer: Real-to-Sim Transfer with Recurrent Restoration","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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":"Computer science; Transfer (computing); Artificial intelligence; Information retrieval; Natural language processing; Operating system","score_opus":0.07862311044427413,"score_gpt":0.33833149404794316,"score_spread":0.25970838360366905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319033632","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028709734,0.002198109,0.2020182,0.04902907,0.69933426,0.00022599103,0.0037523801,0.023928776,0.016642235],"genre_scores_gemma":[0.11267494,0.0028920348,0.2752173,0.026086502,0.06284534,0.00046946522,0.0068428055,0.021751443,0.49122018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958723,0.0006534357,0.00050966966,0.000720236,0.0018478686,0.00039656108],"domain_scores_gemma":[0.98777395,0.0029155533,0.00069269584,0.002314458,0.005645158,0.0006581181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026365384,0.004220455,0.0025092952,0.0025912726,0.0025145987,0.004988273,0.00302904,0.008868006,0.24147895],"category_scores_gemma":[0.028761154,0.0012610309,0.0015498564,0.0029100373,0.002577385,0.0040100114,0.0031750982,0.0069856388,0.08121769],"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.00021099174,0.000024937588,0.0001662843,0.00025265655,0.00003770433,0.0007778901,0.00010218299,0.00066102936,0.0025035276,0.0097846305,0.9378414,0.047636677],"study_design_scores_gemma":[0.000101408994,0.000059032216,0.0008489382,0.00015869232,0.000042122807,0.0030489622,0.00016372975,0.023808248,0.012291772,0.02100966,0.9382899,0.00017741571],"about_ca_topic_score_codex":0.0044448567,"about_ca_topic_score_gemma":0.008214404,"teacher_disagreement_score":0.24147895,"about_ca_system_score_codex":0.0024496547,"about_ca_system_score_gemma":0.0027896648,"threshold_uncertainty_score":0.8078276},"labels":[],"label_agreement":null},{"id":"W4319239180","doi":"10.1007/978-3-031-24866-5_35","title":"Strategies for Surviving Aggressive Multiparty Repeated Standoffs (Extended Abstract)","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Victory; Adversary; Survivability; Computer science; Demise; Computer security; Commit; Adversarial system; Operations research; Political science; Computer network; Law; Artificial intelligence; Mathematics","score_opus":0.0795282175057332,"score_gpt":0.3603600284949618,"score_spread":0.2808318109892286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319239180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33687916,0.00094388676,0.4624766,0.0023733329,0.00045900684,0.000220542,0.00022276066,0.00038505308,0.19603959],"genre_scores_gemma":[0.94934046,0.0003538362,0.014388368,0.0001866468,0.00006626654,0.0001478421,0.000066266664,0.000057618738,0.035392664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996902,0.00008394519,0.000016464686,0.00004406422,0.000071643575,0.00009373118],"domain_scores_gemma":[0.9991903,0.00042902294,0.00009391858,0.00008068785,0.000071648195,0.00013449881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048595818,0.0005520265,0.0005438858,0.00046079015,0.001154534,0.0019479173,0.0010224467,0.0017966545,0.009024637],"category_scores_gemma":[0.0024810703,0.00023974126,0.0006125391,0.00038523163,0.001092176,0.0016717567,0.0019212122,0.0015232321,0.0011854452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010432367,0.000065207045,0.000402288,0.00008560285,0.000036203655,0.00045329402,0.00039468106,0.03823119,0.0052617313,0.9275069,0.0053919298,0.022066616],"study_design_scores_gemma":[0.00002708195,0.00007545432,0.00028212558,0.000028333445,0.000014010858,0.00024088343,0.00021505187,0.13650467,0.0010156689,0.8586852,0.002889481,0.000022135366],"about_ca_topic_score_codex":0.0006014933,"about_ca_topic_score_gemma":0.000640919,"teacher_disagreement_score":0.009024637,"about_ca_system_score_codex":0.0005590394,"about_ca_system_score_gemma":0.00049019506,"threshold_uncertainty_score":0.030190468},"labels":[],"label_agreement":null},{"id":"W4319866203","doi":"10.1007/978-3-031-25046-0_8","title":"Disentangling Factors of Morphological Variation in an Invertible Brain Aging Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Invertible matrix; Variation (astronomy); Computer science; Artificial intelligence; Mathematics; Pure mathematics; Astrophysics; Physics","score_opus":0.07849406455399997,"score_gpt":0.2880554570299408,"score_spread":0.2095613924759408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319866203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2516694,0.00038511032,0.7360777,0.0005957713,0.00006756019,0.00003158773,0.00019597515,0.0003110553,0.010665885],"genre_scores_gemma":[0.9456064,0.0004836863,0.03855643,0.000119882185,0.000066931745,0.000046137848,0.00013843262,0.00012992951,0.014852141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999902,0.000025527434,0.000003706914,0.00003360475,0.000018329469,0.000016852244],"domain_scores_gemma":[0.9993882,0.00035020732,0.00008972427,0.00007475098,0.0000502279,0.000046859674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005916297,0.00053718087,0.0005063065,0.0005534366,0.00019696818,0.0005357841,0.0007410492,0.00087229605,0.0027420565],"category_scores_gemma":[0.0019585467,0.00028263812,0.00065308163,0.00034112835,0.00065986865,0.0011678181,0.00055079925,0.000840157,0.00027698878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012307228,0.00009615788,0.0029936898,0.00010519704,0.00009476419,0.0005433788,0.00022400382,0.48250028,0.018895632,0.45079777,0.0016797836,0.041946318],"study_design_scores_gemma":[0.0000052625055,0.00004055908,0.0012275784,0.000004674004,0.00002243464,0.00013053733,0.000017718276,0.91156363,0.00054002606,0.08588813,0.00054710184,0.000012258538],"about_ca_topic_score_codex":0.0024070344,"about_ca_topic_score_gemma":0.00247817,"teacher_disagreement_score":0.0027420565,"about_ca_system_score_codex":0.00032553606,"about_ca_system_score_gemma":0.00040856918,"threshold_uncertainty_score":0.009173095},"labels":[],"label_agreement":null},{"id":"W4319866890","doi":"10.1007/978-3-031-25803-9_3","title":"Shellac: A Compiler Synthesizer for Concurrent Programs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compiler; Computer science; Programming language; Executable; Compiler correctness; Compiler construction; Verilog; Embedded system; Field-programmable gate array","score_opus":0.040762247601643875,"score_gpt":0.2738627897267375,"score_spread":0.23310054212509362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319866890","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.009552148,0.00043967817,0.90429056,0.00006798773,0.00023858459,0.0001481958,0.00044913276,0.0720475,0.0127662225],"genre_scores_gemma":[0.11325397,0.00048728613,0.8339976,0.00026228194,0.0001488583,0.000371418,0.0021490818,0.022515394,0.026814139],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995395,0.000056262117,0.000037903475,0.00010834004,0.00020600445,0.0000519674],"domain_scores_gemma":[0.9994535,0.00022718389,0.000039070084,0.000091367525,0.00015402598,0.000034785233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043693418,0.0012220256,0.0006858851,0.0008706644,0.000455872,0.0008518021,0.0013265338,0.0006051663,0.016810803],"category_scores_gemma":[0.0013674541,0.0011878008,0.00079831755,0.00064766424,0.00036835164,0.0010913335,0.00096869696,0.0012629469,0.0055789514],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079583767,0.00019477386,0.00063363457,0.0009829829,0.00009571689,0.00040686174,0.0003121303,0.021097122,0.17639397,0.028594272,0.053729217,0.7167635],"study_design_scores_gemma":[0.0006117888,0.00063694164,0.001179146,0.0002080316,0.0002161609,0.0012666573,0.0001303185,0.3185351,0.3738188,0.02919358,0.27405825,0.00014521672],"about_ca_topic_score_codex":0.0009336371,"about_ca_topic_score_gemma":0.0015274733,"teacher_disagreement_score":0.016810803,"about_ca_system_score_codex":0.000317675,"about_ca_system_score_gemma":0.0008462524,"threshold_uncertainty_score":0.056237757},"labels":[],"label_agreement":null},{"id":"W4319918286","doi":"10.1007/978-3-031-26303-3_3","title":"Categorizing Memes About the Ukraine Conflict","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","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":"Microsoft (Canada)","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.055772821294062525,"score_gpt":0.31917741568643176,"score_spread":0.26340459439236924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319918286","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.8029614,0.0056480053,0.0044532707,0.0023995957,0.00033417577,0.0000862963,0.0009306003,0.00007154719,0.18311507],"genre_scores_gemma":[0.99183404,0.0012062038,0.0011731039,0.00014383075,0.00007496514,0.000023037339,0.00061548076,0.000039823673,0.0048895516],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9991364,0.00045509255,0.00007467614,0.0000659534,0.00017973031,0.00008818027],"domain_scores_gemma":[0.9957188,0.002717267,0.00066672097,0.00024301586,0.0005302405,0.00012402935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013015375,0.0003341951,0.00021589363,0.0065576574,0.003338893,0.0052551213,0.00050566427,0.0008713914,0.0032924835],"category_scores_gemma":[0.009138892,0.00013428587,0.00017294186,0.0051287217,0.0025050116,0.0048521375,0.002307325,0.0009181135,0.0004415443],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023236638,0.000034059998,0.03732223,0.00072812825,0.00009041494,0.0017441479,0.75816697,0.0009428239,0.003579034,0.081249245,0.008511956,0.107398696],"study_design_scores_gemma":[0.0000063447924,0.00006644819,0.069213904,0.0014704327,0.00006596493,0.0012782441,0.70727813,0.0011933825,0.0016133421,0.022206035,0.19557229,0.000035502228],"about_ca_topic_score_codex":0.0070925057,"about_ca_topic_score_gemma":0.010922029,"teacher_disagreement_score":0.0070925057,"about_ca_system_score_codex":0.0019422107,"about_ca_system_score_gemma":0.0007472332,"threshold_uncertainty_score":0.014102459},"labels":[],"label_agreement":null},{"id":"W4319934816","doi":"10.1007/978-3-031-25049-1_4","title":"A Robust Approximation for Multiclass Multiserver Queues with Applications to Microservices Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Computer science; Server; Scalability; Queue; Distributed computing; Cloud computing; Convergence (economics); Computer network; Operating system","score_opus":0.030099412655477695,"score_gpt":0.25674717963668986,"score_spread":0.22664776698121217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319934816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004404628,0.0007225167,0.9924896,0.00028180785,0.0001325864,0.000025572652,0.000044006265,0.00021137657,0.0016879634],"genre_scores_gemma":[0.56200814,0.0026872281,0.41150045,0.00051947264,0.0006752086,0.00029745992,0.00039472576,0.0005781565,0.021339193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988601,0.0003997879,0.000043167005,0.00016832203,0.0003539547,0.0001746096],"domain_scores_gemma":[0.9960407,0.0025437297,0.00030761887,0.00024440364,0.0006726624,0.00019082175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038368625,0.0012827305,0.0024286578,0.00082604826,0.00064335566,0.0022597387,0.0037659004,0.00265767,0.004218191],"category_scores_gemma":[0.0107139805,0.00086890324,0.0014328498,0.001626995,0.0012690079,0.001954368,0.0022557697,0.0031357312,0.00071213784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093367475,0.000060624567,0.00020904516,0.00009816381,0.000041767948,0.000047790556,0.000039889095,0.93184155,0.0009588536,0.041967854,0.0024423362,0.022198759],"study_design_scores_gemma":[0.0000015913795,0.0000040116465,0.000012431895,0.0000029311066,0.000002154007,0.0000022137226,0.0000017650043,0.9973571,0.00003762264,0.002470975,0.00010525561,0.000001965918],"about_ca_topic_score_codex":0.014307599,"about_ca_topic_score_gemma":0.0071859797,"teacher_disagreement_score":0.014307599,"about_ca_system_score_codex":0.0025623743,"about_ca_system_score_gemma":0.0025851955,"threshold_uncertainty_score":0.028448641},"labels":[],"label_agreement":null},{"id":"W4319944886","doi":"10.1007/978-3-031-26303-3_14","title":"BNnetXtreme: An Enhanced Methodology for Bangla Fake News Detection Online","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Bengali; Artificial intelligence; Information retrieval","score_opus":0.08480233840235103,"score_gpt":0.3165660539399951,"score_spread":0.23176371553764408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319944886","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.03897313,0.0005168522,0.83670604,0.00022763856,0.0005255262,0.0006178918,0.010443968,0.097436756,0.014552149],"genre_scores_gemma":[0.11926024,0.00033087182,0.821749,0.00028827848,0.00016459358,0.0006026914,0.018735113,0.0030079759,0.035861325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990268,0.00014245362,0.000104375766,0.00025763403,0.00037328777,0.00009561522],"domain_scores_gemma":[0.9987519,0.00033417146,0.00008072317,0.0002770656,0.0004892428,0.00006689206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011417842,0.0011183609,0.00073921995,0.0030788353,0.0006730523,0.0016725805,0.0011772616,0.0010752334,0.016274713],"category_scores_gemma":[0.002531842,0.00045886962,0.00066324335,0.0013825999,0.00028036756,0.0017707793,0.0013079932,0.0007384838,0.014756394],"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.0005196465,0.00035487438,0.007418601,0.00045662132,0.00016258974,0.0004972964,0.00032781102,0.004014336,0.060599852,0.0043484787,0.056840505,0.86445946],"study_design_scores_gemma":[0.00012920209,0.000508414,0.021710088,0.00016279274,0.0002271684,0.0026380513,0.00050267775,0.5168462,0.2397901,0.011707563,0.20557399,0.00020378748],"about_ca_topic_score_codex":0.0034390008,"about_ca_topic_score_gemma":0.007247601,"teacher_disagreement_score":0.016274713,"about_ca_system_score_codex":0.00045425445,"about_ca_system_score_gemma":0.00084170303,"threshold_uncertainty_score":0.054444373},"labels":[],"label_agreement":null},{"id":"W4319992880","doi":"10.1007/978-3-031-24538-1_6","title":"Forecasting Overtime Budgets for Naval Fleet Maintenance Facilities Using Time-Series Analysis During Transient System States","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Forecasting Techniques and Applications","field":"Decision 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":"Defence Research and Development Canada","funders":"","keywords":"Overtime; Staffing; Navy; Computer science; Workforce management; Operations research; Fiscal year; Time series; Workforce; Finance; Engineering; Economics","score_opus":0.08036919212605133,"score_gpt":0.3128151267841932,"score_spread":0.2324459346581419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319992880","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.97610396,0.0002830741,0.019536939,0.00012712134,0.000026363638,0.000019329776,0.002013751,0.00024489264,0.0016445571],"genre_scores_gemma":[0.9950583,0.000108664884,0.0029587054,0.000006498291,0.000010741341,0.000012853543,0.0011441307,0.000014355418,0.0006857649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999001,0.000012676128,0.00001033152,0.000026460219,0.00003202444,0.000018327286],"domain_scores_gemma":[0.9990513,0.00049689756,0.00021842789,0.000035216515,0.00014976379,0.00004836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041386334,0.00044614094,0.00032178455,0.0012405987,0.0001459956,0.00043751247,0.00046760746,0.00047023862,0.0011361885],"category_scores_gemma":[0.0020161346,0.00023581655,0.0003397373,0.0009625477,0.00007968395,0.00086241664,0.0001499103,0.00037698526,0.0002723441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047263713,0.00013920375,0.10858485,0.00009957612,0.000101289785,0.00013923243,0.000075487485,0.78116184,0.0067728166,0.0010197683,0.0028297685,0.09860355],"study_design_scores_gemma":[0.000003790212,0.000057448047,0.04788969,0.000009779285,0.000014935242,0.00002220693,0.000040055704,0.9504403,0.0009065198,0.00034797928,0.00025995198,0.000007293517],"about_ca_topic_score_codex":0.014057421,"about_ca_topic_score_gemma":0.017590022,"teacher_disagreement_score":0.014057421,"about_ca_system_score_codex":0.0006552047,"about_ca_system_score_gemma":0.00021627334,"threshold_uncertainty_score":0.027951181},"labels":[],"label_agreement":null},{"id":"W4319996125","doi":"10.1007/978-3-031-22203-0_29","title":"Visibility Representations of Toroidal and Klein-bottle Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Klein bottle; Torus; Visibility; Rectangle; Bounded function; Parallelogram; Representation (politics); Graph; Toroid; Bottle; Combinatorics; Computer science; Mathematics; Physics; Geometry; Mathematical analysis; Artificial intelligence; Optics","score_opus":0.021051156255928592,"score_gpt":0.2765452614974752,"score_spread":0.25549410524154664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319996125","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.38616267,0.0018581814,0.28392598,0.0020082411,0.00067738397,0.00012128367,0.0006599203,0.0009672625,0.32361913],"genre_scores_gemma":[0.9018625,0.0013465091,0.042504415,0.00026150912,0.0003681007,0.0000781462,0.00052426645,0.00045830713,0.052596264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997867,0.000034793775,0.000010187236,0.000037091406,0.00007575815,0.00005549609],"domain_scores_gemma":[0.999577,0.00014307807,0.000064589185,0.000060353952,0.000072135095,0.000082930994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026346958,0.00055805314,0.00050123426,0.0017682802,0.0010427525,0.0032367108,0.001066677,0.0009608096,0.009300364],"category_scores_gemma":[0.0013355789,0.00041901652,0.00058204256,0.0012430832,0.0014707176,0.0034372627,0.0014309441,0.0019065802,0.0011064447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014957995,0.000007803461,0.000040502917,0.000019303843,0.000001984944,0.00003535228,0.00019499296,0.0011530025,0.0005924742,0.9902755,0.0013040176,0.0063600675],"study_design_scores_gemma":[0.000006205558,0.000008379968,0.000099742196,0.000012862128,0.0000046976393,0.00007648389,0.00014187017,0.008596577,0.00039375923,0.98551047,0.005139185,0.000009839152],"about_ca_topic_score_codex":0.0016467881,"about_ca_topic_score_gemma":0.0014607796,"teacher_disagreement_score":0.009300364,"about_ca_system_score_codex":0.0010631041,"about_ca_system_score_gemma":0.0003908609,"threshold_uncertainty_score":0.03111279},"labels":[],"label_agreement":null},{"id":"W4320018714","doi":"10.1007/978-3-031-23492-7","title":"Artificial Intelligence and Soft Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soft computing; Computer science; Artificial intelligence; Applications of artificial intelligence; Natural computing; Artificial neural network","score_opus":0.02971843992739635,"score_gpt":0.25443124020410984,"score_spread":0.2247128002767135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320018714","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00235046,0.095748626,0.088009715,0.0060988017,0.006773164,0.00009395575,0.0002633529,0.0004738165,0.800188],"genre_scores_gemma":[0.03993399,0.061445314,0.03680928,0.00226735,0.00413411,0.00024014326,0.00031653413,0.0003596262,0.8544936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996221,0.0000765701,0.00001604242,0.000041161013,0.00022667485,0.000017415561],"domain_scores_gemma":[0.99951696,0.0002857396,0.000026184092,0.00007037484,0.00006666158,0.00003404861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041155863,0.001034318,0.0012941689,0.0015030175,0.0006248281,0.0029764345,0.00053570187,0.00081915304,0.048341006],"category_scores_gemma":[0.0012760971,0.00036970328,0.0003705683,0.0028512892,0.0015701558,0.0028022085,0.0013978985,0.0022375602,0.019558642],"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.000022161328,0.00006344016,0.00011564296,0.0006831983,0.000037082038,0.00005998723,0.0001732358,0.0031292015,0.0010029711,0.4486594,0.17124769,0.37480602],"study_design_scores_gemma":[0.0000095835,0.000033564294,0.0003366924,0.00039424532,0.000014037897,0.00014644407,0.00008056787,0.0056318464,0.0004910474,0.47789818,0.51495135,0.000012453266],"about_ca_topic_score_codex":0.0004379794,"about_ca_topic_score_gemma":0.0009198902,"teacher_disagreement_score":0.048341006,"about_ca_system_score_codex":0.0007795168,"about_ca_system_score_gemma":0.00077192264,"threshold_uncertainty_score":0.16171676},"labels":[],"label_agreement":null},{"id":"W4320018809","doi":"10.1007/978-3-031-23492-7_31","title":"Convergence of RBF Networks Regression Function Estimates and Classifiers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Computer science; Regression; Artificial intelligence; Artificial neural network; Dimension (graph theory); Regression analysis; Radial basis function; Machine learning; Function (biology); Algorithm; Statistics; Mathematics","score_opus":0.022897502510000334,"score_gpt":0.2510630144253859,"score_spread":0.2281655119153856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320018809","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.0076603885,0.002626884,0.9810667,0.0003433513,0.0001474599,0.000026978763,0.000054710286,0.00020263194,0.007870907],"genre_scores_gemma":[0.36444455,0.007161825,0.5914,0.00030482968,0.00068711536,0.00044663585,0.00054831157,0.0011930935,0.033813745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811363,0.00084689364,0.000095897325,0.000277268,0.0005763626,0.000089948815],"domain_scores_gemma":[0.9869119,0.009766206,0.00044483025,0.00055643194,0.0021860967,0.00013442879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00558087,0.0010728295,0.0013360585,0.0016656194,0.00050314923,0.0021184382,0.0018469548,0.0021705942,0.004093006],"category_scores_gemma":[0.037701134,0.001084137,0.0010847641,0.0012758826,0.0016557131,0.003095278,0.002093635,0.0034253546,0.0018911302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030783933,0.00006660747,0.0008778843,0.00060778775,0.00008967623,0.00009170142,0.0003713697,0.5079282,0.0077756774,0.24455744,0.008118828,0.22920702],"study_design_scores_gemma":[0.0000051715024,0.000018579958,0.00020876116,0.00005883832,0.000009413493,0.000034980578,0.000017494032,0.95857173,0.0013822656,0.037941694,0.0017366172,0.000014578625],"about_ca_topic_score_codex":0.0034505217,"about_ca_topic_score_gemma":0.0017321158,"teacher_disagreement_score":0.00558087,"about_ca_system_score_codex":0.0015587058,"about_ca_system_score_gemma":0.0007899375,"threshold_uncertainty_score":0.02951485},"labels":[],"label_agreement":null},{"id":"W4320036905","doi":"10.1007/978-3-031-25085-9_25","title":"The Tenth Visual Object Tracking VOT2022 Challenge Results","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; BitTorrent tracker; Tracking (education); Eye tracking; Term (time); Bounding overwatch; RGB color model","score_opus":0.044780553239919925,"score_gpt":0.31235569012251246,"score_spread":0.26757513688259255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320036905","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06928499,0.08361362,0.49284643,0.035764206,0.057855867,0.001807998,0.04812358,0.04318108,0.16752225],"genre_scores_gemma":[0.18945628,0.013490805,0.2899053,0.011939614,0.009188158,0.0011583262,0.26181456,0.006144664,0.21690224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967416,0.0004158939,0.00015447347,0.00084558956,0.0013639187,0.00047849474],"domain_scores_gemma":[0.995883,0.0011002345,0.00008801032,0.0008885904,0.0013130774,0.00072725216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045355735,0.002410238,0.00313515,0.0012420333,0.0018239433,0.0048166756,0.0030892103,0.004148776,0.014236051],"category_scores_gemma":[0.00822068,0.0005639123,0.001326638,0.0014214119,0.00093950646,0.0031358923,0.004397523,0.0037217792,0.016513472],"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.0007689725,0.0002886265,0.0007381323,0.0007328758,0.00015288951,0.00022685144,0.000106360356,0.004781886,0.00622253,0.0058216196,0.5886676,0.3914916],"study_design_scores_gemma":[0.00059255405,0.0010923472,0.0055120084,0.00045611142,0.0002972503,0.0011477307,0.00041973818,0.12274938,0.030456688,0.049149133,0.7880025,0.00012455617],"about_ca_topic_score_codex":0.016596274,"about_ca_topic_score_gemma":0.020682605,"teacher_disagreement_score":0.016596274,"about_ca_system_score_codex":0.0016264708,"about_ca_system_score_gemma":0.003056843,"threshold_uncertainty_score":0.04762435},"labels":[],"label_agreement":null},{"id":"W4320036947","doi":"10.1007/978-3-031-25082-8_26","title":"CCRL: Contrastive Cell Representation Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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 British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Cluster analysis; Machine learning; Feature learning; Representation (politics); Context (archaeology); Identification (biology); Annotation; Unsupervised learning; Margin (machine learning); Supervised learning; Pattern recognition (psychology); Artificial neural network","score_opus":0.02115011942808011,"score_gpt":0.2596260242020277,"score_spread":0.23847590477394756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320036947","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.002643455,0.0010053422,0.9680578,0.00031315215,0.00029714403,0.00010992317,0.0011813269,0.0117964605,0.014595317],"genre_scores_gemma":[0.07527499,0.0012309736,0.8604945,0.00076135993,0.00028817303,0.00049570523,0.006441834,0.0026612584,0.052351218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995697,0.00005670943,0.00001647013,0.00011394961,0.00019562223,0.000047549263],"domain_scores_gemma":[0.9994031,0.00021949522,0.000032493797,0.00015781763,0.00014194872,0.000045128145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074944395,0.00088452373,0.0008300197,0.0010675163,0.00037468862,0.0017597962,0.0037946142,0.0014552639,0.03320532],"category_scores_gemma":[0.0020656777,0.00048328,0.0007084409,0.0013687108,0.0005497482,0.0017576889,0.0018181059,0.0020292704,0.0144310165],"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.000071906456,0.00007924305,0.00018057569,0.00020114727,0.000029257502,0.000058091457,0.000039811533,0.02101999,0.011086119,0.027434867,0.06692241,0.87287664],"study_design_scores_gemma":[0.000049001646,0.00012870642,0.0003667561,0.00009968575,0.000032877197,0.00025525977,0.000044400367,0.7660556,0.03307998,0.072360255,0.12747441,0.000053131163],"about_ca_topic_score_codex":0.0026698706,"about_ca_topic_score_gemma":0.0037287965,"teacher_disagreement_score":0.03320532,"about_ca_system_score_codex":0.00072629715,"about_ca_system_score_gemma":0.0008093563,"threshold_uncertainty_score":0.11108291},"labels":[],"label_agreement":null},{"id":"W4320149352","doi":"10.1007/978-3-031-24866-5_7","title":"Binary Black Widow Optimization Algorithm for Feature Selection Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"University of Waterloo","funders":"","keywords":"Feature selection; Selection (genetic algorithm); Algorithm; Computer science; Binary number; Optimization algorithm; Feature (linguistics); Artificial intelligence; Mathematical optimization; Mathematics; Arithmetic; Philosophy","score_opus":0.020966405893147997,"score_gpt":0.26736875263416693,"score_spread":0.24640234674101893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320149352","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.005683645,0.0009090753,0.9906019,0.00009911195,0.000102736,0.000037464273,0.00005478051,0.00034738705,0.002163867],"genre_scores_gemma":[0.1276831,0.0007241271,0.85917443,0.0002256256,0.00010435086,0.00031127664,0.00036098599,0.00023393608,0.011182137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957556,0.00012244121,0.000021877951,0.000072783165,0.00015770132,0.00004960759],"domain_scores_gemma":[0.999701,0.0001556587,0.00002103953,0.000026241914,0.00007939199,0.000016616234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083625806,0.00080961664,0.0014045279,0.0008602738,0.0005144059,0.00092926767,0.001641004,0.0009979673,0.0062965876],"category_scores_gemma":[0.0014087242,0.00044966422,0.0006685255,0.0016388546,0.00040070963,0.00094113615,0.0010547382,0.001174268,0.0011450192],"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.0004457471,0.00020054376,0.00056291913,0.00025500666,0.00014475638,0.000067921894,0.00005955425,0.26274502,0.009273231,0.022012657,0.011876682,0.69235593],"study_design_scores_gemma":[0.000050167873,0.000074019525,0.00019539638,0.00001957109,0.000023183178,0.000042588334,0.000009273161,0.9870012,0.0021214182,0.0069539035,0.0034981198,0.000011175736],"about_ca_topic_score_codex":0.0019137291,"about_ca_topic_score_gemma":0.0018385629,"teacher_disagreement_score":0.0062965876,"about_ca_system_score_codex":0.00038381445,"about_ca_system_score_gemma":0.00059613475,"threshold_uncertainty_score":0.021064162},"labels":[],"label_agreement":null},{"id":"W4320149362","doi":"10.1007/978-3-031-24866-5_8","title":"Learning to Solve a Stochastic Orienteering Problem with Time Windows","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Orienteering; Vehicle routing problem; Computer science; Reinforcement learning; Mathematical optimization; Combinatorial optimization; Variety (cybernetics); Travelling salesman problem; Routing (electronic design automation); Optimization problem; Artificial intelligence; Algorithm; Mathematics","score_opus":0.008960571633318136,"score_gpt":0.222514940281767,"score_spread":0.21355436864844884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320149362","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.039672244,0.00035272047,0.9563624,0.00029259745,0.000062954976,0.00003798114,0.000062671694,0.0001781138,0.002978179],"genre_scores_gemma":[0.7088235,0.0006902025,0.27486736,0.00023243706,0.00022175217,0.00025159202,0.00037817558,0.00016915365,0.014365899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996996,0.00008915787,0.000017998922,0.000096976095,0.00004961668,0.000046703284],"domain_scores_gemma":[0.99835217,0.0013477482,0.00008919373,0.000057550576,0.000085111686,0.000068349655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010837916,0.0008414544,0.0011354138,0.00032512387,0.00023846484,0.00073421345,0.0011197105,0.0017903723,0.0035427983],"category_scores_gemma":[0.0039524403,0.0006246164,0.00073610264,0.0006590723,0.0007340134,0.0015304871,0.0012028201,0.001478813,0.00029737668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070432114,0.000052785334,0.0003054627,0.00005753662,0.000026890317,0.000029225039,0.000023898412,0.94985807,0.0006081665,0.01137138,0.0009808344,0.036615327],"study_design_scores_gemma":[0.000007284827,0.000022577558,0.000029888675,0.000002634588,0.0000030620508,0.0000037660063,0.000002966602,0.99524766,0.00011597655,0.0044247606,0.00013749552,0.0000018720621],"about_ca_topic_score_codex":0.0056297495,"about_ca_topic_score_gemma":0.0034348038,"teacher_disagreement_score":0.0056297495,"about_ca_system_score_codex":0.00063014764,"about_ca_system_score_gemma":0.00093849417,"threshold_uncertainty_score":0.011851907},"labels":[],"label_agreement":null},{"id":"W4320149378","doi":"10.1007/978-3-031-24866-5","title":"Learning and Intelligent Optimization","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","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":"Wilfrid Laurier University","funders":"University of Ioannina; Far Eastern Federal University; SBA Research; Hefei University of Technology; Hefei University; Università di Bologna; Université de Lorraine; Jyväskylän Yliopisto; Univerzita Karlova v Praze; Università degli Studi di Genova; University of Crete; Università degli Studi di Cagliari","keywords":"Computer science; Artificial intelligence","score_opus":0.018030999264643233,"score_gpt":0.28231403016628837,"score_spread":0.2642830309016451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320149378","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047558993,0.070739366,0.47307897,0.0053115333,0.002103432,0.000060920484,0.0002589759,0.0007558986,0.44293508],"genre_scores_gemma":[0.16980821,0.053471074,0.17066127,0.0019577062,0.0031977135,0.00030753255,0.0006788693,0.00082171784,0.5990959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979883,0.000052191193,0.000007821997,0.000034244866,0.00009318019,0.00001369743],"domain_scores_gemma":[0.9997645,0.00013683677,0.000013656005,0.000045802582,0.000028587945,0.000010578942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032118996,0.0008838519,0.0010878211,0.0005810277,0.00033098317,0.0013459129,0.0005485195,0.00069045956,0.01606828],"category_scores_gemma":[0.0010817704,0.00033022356,0.00046462408,0.0010328725,0.0011765105,0.0017548266,0.00091104856,0.0016533526,0.0050650877],"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.00002540267,0.000049904305,0.00018139543,0.00036663297,0.000056914778,0.00003967517,0.000104849154,0.040927928,0.0010024484,0.48536006,0.09545878,0.37642592],"study_design_scores_gemma":[0.00001108304,0.000035283552,0.00035190067,0.00014553433,0.000020201442,0.00009685204,0.000037034017,0.057493683,0.0009207724,0.7234416,0.21743116,0.000014812116],"about_ca_topic_score_codex":0.0006114746,"about_ca_topic_score_gemma":0.0008604148,"teacher_disagreement_score":0.01606828,"about_ca_system_score_codex":0.0006099051,"about_ca_system_score_gemma":0.00035875646,"threshold_uncertainty_score":0.053753734},"labels":[],"label_agreement":null},{"id":"W4320154840","doi":"10.1007/978-3-031-22966-4","title":"Advances in Cryptology – ASIACRYPT 2022","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chemical Reactions and Isotopes","field":"Pharmacology, Toxicology and Pharmaceutics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ariel University; Fujian Normal University; Peking University; University of Haifa; Technische Universität Darmstadt; University of California, Riverside; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Tsinghua University; Télécom Paris; Aarhus Universitet; KU Leuven; Hebrew University of Jerusalem; East China Normal University; National University of Singapore; Radboud Universiteit; Nanyang Technological University; Universitetet i Bergen; Shanghai Jiao Tong University; University of Edinburgh; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Tel Aviv University; University of California, San Diego; Seoul National University; Georgia Institute of Technology; Institut Universitaire de France; Immanuel Kant Baltic Federal University; New York University Shanghai; Indian Institute of Science; Royal Holloway, University of London; University of North Carolina at Chapel Hill; Nanjing University of Aeronautics and Astronautics; University of Connecticut; Purdue University; Florida State University; Nanjing University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Algorithm","score_opus":0.04129124433255317,"score_gpt":0.39408214885087883,"score_spread":0.3527909045183257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320154840","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057584844,0.04981107,0.06303427,0.020179069,0.02598926,0.00012923196,0.001491534,0.0025643043,0.8310427],"genre_scores_gemma":[0.10017157,0.039815366,0.02352994,0.0036985942,0.016938567,0.00018106303,0.0028992072,0.0012280103,0.8115376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991696,0.00017452051,0.00004326818,0.00013051176,0.00038339684,0.00009875589],"domain_scores_gemma":[0.9990754,0.00023294373,0.0000551727,0.00031023414,0.0002317706,0.00009445803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008906285,0.0014928082,0.0009705454,0.0013758392,0.00096531986,0.004089804,0.0007253575,0.0013001956,0.07126459],"category_scores_gemma":[0.0021206199,0.0004913025,0.000353687,0.0025162245,0.0010805215,0.005885291,0.0016151845,0.0038053435,0.056136906],"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.000119412,0.000053057473,0.00012561273,0.0002629374,0.00002199405,0.00006336669,0.00003152564,0.0019149728,0.0014603069,0.103339225,0.5684686,0.32413894],"study_design_scores_gemma":[0.000044014265,0.00007679131,0.0004032047,0.00019649859,0.000021319624,0.000356941,0.000026224434,0.0074523943,0.0024754677,0.07516714,0.91375995,0.000019992362],"about_ca_topic_score_codex":0.0009034089,"about_ca_topic_score_gemma":0.0008810947,"teacher_disagreement_score":0.07126459,"about_ca_system_score_codex":0.0016120232,"about_ca_system_score_gemma":0.0013506481,"threshold_uncertainty_score":0.2384038},"labels":[],"label_agreement":null},{"id":"W4320155353","doi":"10.1007/978-3-031-24667-8_7","title":"Design of a Social Media Voice Assistant for Older Adults","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Computer science; Social media; Multimedia; Speech recognition; Telecommunications; Human–computer interaction; World Wide Web","score_opus":0.023149137026815685,"score_gpt":0.2737152042670317,"score_spread":0.250566067240216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320155353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28503215,0.00040408413,0.6947838,0.0003284567,0.00032587792,0.0031898478,0.0003207654,0.003689124,0.011925851],"genre_scores_gemma":[0.50410366,0.00021754793,0.4724673,0.00030582558,0.000069626425,0.0025941334,0.00023628233,0.00032711143,0.019678446],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9991584,0.0002905367,0.00006597259,0.00020593767,0.00018467248,0.00009455943],"domain_scores_gemma":[0.9991387,0.00031027658,0.00004988254,0.000049670532,0.00030244084,0.00014893623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011465946,0.0007106575,0.00043942864,0.0004957828,0.000793619,0.00118212,0.0016751313,0.0012800931,0.0070924717],"category_scores_gemma":[0.0016369162,0.00040704818,0.0004069888,0.00017391355,0.00027077278,0.00080944656,0.0011143278,0.00038006133,0.0016599093],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031113124,0.0022680915,0.01006165,0.0015817938,0.00018571416,0.0022567294,0.0070310966,0.0071568917,0.4553435,0.004737344,0.006557854,0.49970812],"study_design_scores_gemma":[0.0020573463,0.028737789,0.0328793,0.000467241,0.001685849,0.006040891,0.011759984,0.2574227,0.43023524,0.004676931,0.2236523,0.00038440322],"about_ca_topic_score_codex":0.0007614695,"about_ca_topic_score_gemma":0.00091232156,"teacher_disagreement_score":0.0070924717,"about_ca_system_score_codex":0.00034292368,"about_ca_system_score_gemma":0.00080896425,"threshold_uncertainty_score":0.023726702},"labels":[],"label_agreement":null},{"id":"W4320352240","doi":"10.1007/978-3-031-40773-4_7","title":"Combining Max-Tree and CNN for Segmentation of Cellular FIB-SEM Images","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"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":"Institute of Genetics; Université de Strasbourg; Equipex","keywords":"Computer science; Segmentation; Tree (set theory); Pattern recognition (psychology); Artificial intelligence; Convolutional neural network; Context (archaeology); Representation (politics); Image segmentation; Mathematics","score_opus":0.011317871984724266,"score_gpt":0.25977236867125825,"score_spread":0.248454496686534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320352240","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.023442822,0.0011498543,0.9619146,0.00019876225,0.00014336966,0.00009945912,0.00086914195,0.008354731,0.0038271986],"genre_scores_gemma":[0.18403612,0.0012321239,0.79972184,0.0003322635,0.00013231751,0.00015311116,0.003632598,0.0010832556,0.009676338],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967885,0.000025156796,0.0000148132385,0.000114573726,0.000096489486,0.000070080205],"domain_scores_gemma":[0.9996896,0.00007584093,0.000026688436,0.000057815883,0.00012844236,0.000021606278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333324,0.0015243167,0.0011197089,0.0015660387,0.0004036495,0.0012856245,0.0015309213,0.0013379947,0.0043224506],"category_scores_gemma":[0.0007093344,0.0008866421,0.0011961813,0.0017898644,0.0002955429,0.0014474143,0.00085737935,0.00078310585,0.002623817],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024821516,0.00010939276,0.0010467095,0.00029261527,0.0001845423,0.00014121631,0.000065391956,0.08977617,0.08739301,0.0027429254,0.011149546,0.8068503],"study_design_scores_gemma":[0.0000058342616,0.000049130136,0.0007632759,0.000023041615,0.000053537555,0.00010666616,0.000017785103,0.9668208,0.025033351,0.0032886697,0.0038194654,0.000018492048],"about_ca_topic_score_codex":0.008855349,"about_ca_topic_score_gemma":0.017523155,"teacher_disagreement_score":0.008855349,"about_ca_system_score_codex":0.0009340063,"about_ca_system_score_gemma":0.0011064769,"threshold_uncertainty_score":0.01760757},"labels":[],"label_agreement":null},{"id":"W4320481739","doi":"10.1007/978-3-031-25069-9_15","title":"Distinctive Image Captioning via CLIP Guided Group Optimization","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Closed captioning; Optimal distinctiveness theory; Computer science; Image (mathematics); Artificial intelligence; Metric (unit); Natural language processing; Embedding; Ground truth; Focus (optics); Baseline (sea); Consistency (knowledge bases); Pattern recognition (psychology); Machine learning; Information retrieval","score_opus":0.017930149582978804,"score_gpt":0.27462452038326973,"score_spread":0.25669437080029095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320481739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064592496,0.00018041182,0.984083,0.0001457842,0.00021289317,0.00008624028,0.00016053293,0.0029622803,0.005709596],"genre_scores_gemma":[0.13224731,0.0003141339,0.8469424,0.0003525675,0.0003355688,0.00021939054,0.0013046492,0.0019503206,0.01633372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947697,0.00010217345,0.000015593183,0.00015084438,0.00017787177,0.00007651599],"domain_scores_gemma":[0.9994104,0.00018239248,0.000036428468,0.00016797976,0.00014499042,0.000057762263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304999,0.0014985022,0.0013210941,0.0011510004,0.0006060549,0.0013155644,0.0016309773,0.0015150929,0.018344942],"category_scores_gemma":[0.0015848962,0.0005464517,0.0012359134,0.0014590493,0.0007430146,0.0013076128,0.0019204781,0.0019905004,0.0064101624],"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.0005357747,0.00017736279,0.00017951598,0.00027238182,0.00008788447,0.00025792173,0.00015664667,0.10341656,0.08551177,0.017201219,0.044967744,0.7472351],"study_design_scores_gemma":[0.000031791238,0.000102398226,0.00014153465,0.0000124625285,0.000027531212,0.00015434137,0.00004963399,0.95748526,0.021929054,0.011215586,0.00882696,0.000023406743],"about_ca_topic_score_codex":0.0012414687,"about_ca_topic_score_gemma":0.0017877138,"teacher_disagreement_score":0.018344942,"about_ca_system_score_codex":0.0004241556,"about_ca_system_score_gemma":0.0005245101,"threshold_uncertainty_score":0.061369956},"labels":[],"label_agreement":null},{"id":"W4320481778","doi":"10.1007/978-3-031-25069-9_13","title":"FairDisCo: Fairer AI in Dermatology via Disentanglement Contrastive Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Skin lesion; Computer science; Resampling; Artificial intelligence; Deep learning; Lesion; Feature (linguistics); Pattern recognition (psychology); Machine learning; Task (project management); Dermatology; Medicine; Pathology","score_opus":0.012135286357413493,"score_gpt":0.258569938422091,"score_spread":0.2464346520646775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320481778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047936374,0.0029311036,0.9329552,0.0014216725,0.0011162087,0.00009044907,0.00024804813,0.0041709095,0.052272856],"genre_scores_gemma":[0.16586304,0.0027324446,0.71250427,0.0013369236,0.0009193879,0.00015701879,0.0006129814,0.0012389905,0.114634946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997502,0.00003553301,0.0000082015495,0.000056874036,0.0001271616,0.0000219706],"domain_scores_gemma":[0.99934655,0.00039499783,0.000019294333,0.0000886247,0.00009398498,0.000056572164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006850323,0.00056486577,0.00040858026,0.0006633511,0.00037051443,0.0014683246,0.001242419,0.0009979579,0.022675486],"category_scores_gemma":[0.0023545788,0.0002473439,0.00037038254,0.0004553684,0.00083737436,0.0019563157,0.0016647823,0.0018911436,0.0035661927],"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.00014825746,0.00009851093,0.00026656967,0.00021760579,0.000031748306,0.000114973074,0.00015070036,0.018117784,0.012414477,0.093458,0.05640758,0.8185738],"study_design_scores_gemma":[0.00004738409,0.00013334352,0.00071251264,0.00013559691,0.000031246444,0.0004843868,0.000094265335,0.4019979,0.02258461,0.36423698,0.20946985,0.00007201525],"about_ca_topic_score_codex":0.0015836036,"about_ca_topic_score_gemma":0.0028323291,"teacher_disagreement_score":0.022675486,"about_ca_system_score_codex":0.0005376365,"about_ca_system_score_gemma":0.00047227583,"threshold_uncertainty_score":0.07585704},"labels":[],"label_agreement":null},{"id":"W4320481788","doi":"10.1007/978-3-031-25069-9_14","title":"CIRCLe: Color Invariant Representation Learning for Unbiased Classification of Skin Lesions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skin lesion; Computer science; Artificial intelligence; Invariant (physics); Skin color; Regularization (linguistics); Pattern recognition (psychology); Representation (politics); Mathematics; Dermatology; Medicine","score_opus":0.05192716770898709,"score_gpt":0.3031009170921075,"score_spread":0.2511737493831204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320481788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044414806,0.0008077606,0.98668146,0.00016867214,0.00017789623,0.000041508058,0.0003512895,0.00561652,0.0017133569],"genre_scores_gemma":[0.10326837,0.0012528388,0.87170434,0.00039033033,0.00035226298,0.00019981938,0.0030702914,0.0013315837,0.01843007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931955,0.00012689788,0.000024463649,0.00020633303,0.00023584341,0.00008691714],"domain_scores_gemma":[0.9992071,0.00028273504,0.00004615034,0.00015570156,0.00025953737,0.00004887798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011450268,0.0009774328,0.0010355371,0.0011314776,0.000361343,0.0010756601,0.0017737488,0.0013078201,0.009007722],"category_scores_gemma":[0.0021917494,0.00042128467,0.0008629301,0.001332888,0.00046072996,0.0011419023,0.0012816485,0.0012945413,0.005263952],"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.00018200764,0.00007089524,0.0003388247,0.00011330421,0.000064530235,0.000042478994,0.000031199277,0.03179319,0.016120825,0.0066334167,0.04156456,0.9030447],"study_design_scores_gemma":[0.00001656055,0.00009341825,0.00066171144,0.000021395554,0.000030356998,0.00014784659,0.00001646906,0.9589958,0.01887983,0.008602274,0.012506654,0.000027697572],"about_ca_topic_score_codex":0.0037376904,"about_ca_topic_score_gemma":0.004228195,"teacher_disagreement_score":0.009007722,"about_ca_system_score_codex":0.0005610096,"about_ca_system_score_gemma":0.00086955674,"threshold_uncertainty_score":0.030133843},"labels":[],"label_agreement":null},{"id":"W4320481799","doi":"10.1007/978-3-031-25069-9_2","title":"MoQuad: Motion-focused Quadruple Construction for Video Contrastive Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Motion (physics); Task (project management); Artificial intelligence; Representation (politics); Exploit; Feature learning; Simple (philosophy); Machine learning; Computer vision","score_opus":0.023280378293866488,"score_gpt":0.2495941191303177,"score_spread":0.22631374083645123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320481799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030562084,0.00007417685,0.9912066,0.000019909538,0.000031258598,0.00005273181,0.00013011158,0.0028694873,0.0025595152],"genre_scores_gemma":[0.07036504,0.0001608683,0.91673476,0.000101909485,0.00003365416,0.00015694948,0.00089838076,0.0012986144,0.0102497665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997874,0.00002136015,0.00000804644,0.00006103765,0.00009296264,0.000029100462],"domain_scores_gemma":[0.99977845,0.000059701648,0.000013084005,0.00006177398,0.000056094243,0.0000308984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035807,0.00077533745,0.0005861829,0.0006865489,0.00036372233,0.00063582236,0.0016566332,0.00073426944,0.01879866],"category_scores_gemma":[0.00078532164,0.00037856516,0.00049699174,0.0005446437,0.00046058,0.0009848507,0.0015943858,0.0011412846,0.004747396],"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.0002267058,0.0001025507,0.00024666483,0.00020454325,0.000027842629,0.00010955439,0.000084063104,0.018681545,0.11368405,0.022735797,0.01585384,0.8280429],"study_design_scores_gemma":[0.000052770025,0.0003620294,0.0007725721,0.000068450856,0.00002561879,0.00058800116,0.000074261545,0.739676,0.16515276,0.031408954,0.06176267,0.00005588075],"about_ca_topic_score_codex":0.0013875637,"about_ca_topic_score_gemma":0.00266441,"teacher_disagreement_score":0.01879866,"about_ca_system_score_codex":0.00031946725,"about_ca_system_score_gemma":0.00045880704,"threshold_uncertainty_score":0.06288773},"labels":[],"label_agreement":null},{"id":"W4321230649","doi":"10.1007/978-3-031-25460-4_39","title":"SLIME: State Learning in the Middle of Everything for Tool-Assisted Vulnerability Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Finite-state machine; Artificial intelligence; Machine learning; Automaton; State (computer science); Learning automata; Vulnerability (computing); Implementation; Reliability (semiconductor); Software engineering; Programming language; Computer security","score_opus":0.03277274044482258,"score_gpt":0.26671967468046737,"score_spread":0.23394693423564478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321230649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004498093,0.00032494764,0.9510257,0.00027729908,0.00018599056,0.00010932716,0.0009868162,0.039408345,0.0031835397],"genre_scores_gemma":[0.1748314,0.00045837666,0.8081076,0.0004582246,0.00014636049,0.00048723497,0.0045057125,0.0033553042,0.0076496694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987758,0.00028195238,0.00009116045,0.00035371055,0.00037734397,0.000120084864],"domain_scores_gemma":[0.9971712,0.0015070272,0.00017934757,0.0007772085,0.00026385952,0.000101318525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015591965,0.0017220114,0.001330054,0.0013441049,0.00063890545,0.0021093504,0.0033841338,0.0014630306,0.010821873],"category_scores_gemma":[0.0068357675,0.00080729474,0.0016002923,0.0009170339,0.0011390748,0.0043082684,0.004050487,0.003190235,0.004586245],"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.00045419723,0.0003771046,0.0026271155,0.00055444794,0.00016744691,0.00018183817,0.00027575827,0.12521926,0.007915552,0.04221573,0.06363486,0.7563767],"study_design_scores_gemma":[0.00002159129,0.0000685842,0.00022947683,0.000061144325,0.00002519936,0.000070299204,0.00004136727,0.9222223,0.0068100668,0.06121736,0.009203086,0.000029503777],"about_ca_topic_score_codex":0.0022535021,"about_ca_topic_score_gemma":0.0041109426,"teacher_disagreement_score":0.010821873,"about_ca_system_score_codex":0.0007868493,"about_ca_system_score_gemma":0.0017761422,"threshold_uncertainty_score":0.03620279},"labels":[],"label_agreement":null},{"id":"W4321230989","doi":"10.1007/978-3-031-25460-4","title":"Computer Security. ESORICS 2022 International Workshops","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Computer science; Computer security","score_opus":0.012007206195378201,"score_gpt":0.24210939619855992,"score_spread":0.23010219000318172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321230989","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050824923,0.03657647,0.051709574,0.0057532345,0.021353953,0.00032642353,0.002962178,0.005363024,0.8708727],"genre_scores_gemma":[0.008487843,0.01081257,0.013566924,0.0005953249,0.002078457,0.00011975268,0.0044812732,0.0008680993,0.9589897],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990451,0.0001816285,0.00003849663,0.00013258564,0.00044317765,0.0001590961],"domain_scores_gemma":[0.9989139,0.00016019096,0.00003722934,0.00019891381,0.00041625852,0.00027338942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016766455,0.0018328932,0.0009762778,0.0025420794,0.0011439339,0.00397353,0.0015392371,0.0015227592,0.19237837],"category_scores_gemma":[0.0012577807,0.0007074485,0.00097206316,0.0024413606,0.00043191717,0.0023961256,0.0022341104,0.0019176032,0.14154851],"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.000098021934,0.00016325549,0.00012078909,0.00025302113,0.000014134778,0.000059423328,0.000039334594,0.000805015,0.0017431697,0.0066458182,0.65934783,0.33071023],"study_design_scores_gemma":[0.000017393962,0.000060052076,0.00049285794,0.00019538781,0.000013475588,0.00017297843,0.00004359342,0.0017222946,0.0013144528,0.0045473003,0.9914077,0.000012578575],"about_ca_topic_score_codex":0.0024131313,"about_ca_topic_score_gemma":0.0055096974,"teacher_disagreement_score":0.19237837,"about_ca_system_score_codex":0.0012094548,"about_ca_system_score_gemma":0.0019189625,"threshold_uncertainty_score":0.64356977},"labels":[],"label_agreement":null},{"id":"W4321231180","doi":"10.1007/978-3-031-25072-9_48","title":"Visible-Infrared Person Re-Identification Using Privileged Intermediate Information","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; RGB color model; Representation (politics); Domain (mathematical analysis); Identification (biology); Matching (statistics); Feature (linguistics); Modal; Computer vision; Deep learning; Benchmark (surveying); Pattern recognition (psychology)","score_opus":0.0435553397549575,"score_gpt":0.2976164437715187,"score_spread":0.2540611040165612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321231180","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.06557887,0.0005039515,0.9069049,0.00012888339,0.00030756136,0.000076643366,0.00023617232,0.0028903687,0.023372613],"genre_scores_gemma":[0.577291,0.00050049945,0.37422317,0.0001691908,0.00013702743,0.000060953953,0.00079033175,0.00031917295,0.046508625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993175,0.00007130013,0.00002009088,0.00017904158,0.0002922474,0.000119801254],"domain_scores_gemma":[0.9994374,0.0000681488,0.00003749552,0.00032244937,0.00010688409,0.000027615892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141694,0.00061986496,0.00076416385,0.0008112441,0.0006585396,0.001226417,0.00100171,0.0008019835,0.0056723338],"category_scores_gemma":[0.0009921475,0.00036150235,0.000634516,0.00064743403,0.0005437824,0.0025763824,0.002362265,0.0010553076,0.006333821],"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.0008796294,0.00035695476,0.0027478551,0.00014784875,0.0000708699,0.00037318585,0.00039554643,0.012188407,0.1605416,0.017475642,0.007501215,0.79732126],"study_design_scores_gemma":[0.000052382893,0.000687853,0.012357629,0.00011620745,0.0001575888,0.00276431,0.00045002758,0.5699113,0.35158533,0.027288435,0.03448067,0.00014831116],"about_ca_topic_score_codex":0.0009945655,"about_ca_topic_score_gemma":0.0014827846,"teacher_disagreement_score":0.0056723338,"about_ca_system_score_codex":0.00026039316,"about_ca_system_score_gemma":0.00042496278,"threshold_uncertainty_score":0.018975854},"labels":[],"label_agreement":null},{"id":"W4321231212","doi":"10.1007/978-3-031-25072-9_46","title":"Privacy-Preserving Person Detection Using Low-Resolution Infrared Cameras","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Resolution (logic); Low resolution; Infrared; High resolution; Computer graphics (images); Computer security; Remote sensing; Optics","score_opus":0.049794902575039574,"score_gpt":0.29019806756505373,"score_spread":0.24040316499001416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321231212","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.022035988,0.0008371894,0.970873,0.0001125765,0.0000902001,0.000025909047,0.00013395131,0.0009713456,0.0049198065],"genre_scores_gemma":[0.5205052,0.0024860143,0.45797685,0.0002156399,0.00022417463,0.000057131747,0.0007217389,0.00022026786,0.017592996],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991416,0.000120269615,0.000028088218,0.0002448451,0.00036355533,0.00010170129],"domain_scores_gemma":[0.9993011,0.00018402617,0.00008327396,0.00031475467,0.000094401985,0.000022486875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047984353,0.0006615814,0.0008442815,0.00066680333,0.0004063594,0.0010706434,0.0011444493,0.00062446523,0.0022470718],"category_scores_gemma":[0.0014386489,0.00049851905,0.00077660073,0.0008809672,0.0004517753,0.0019002525,0.0011615625,0.0009899042,0.001923874],"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.000553319,0.00015833507,0.0013826776,0.00027946933,0.000095947464,0.00026109346,0.00016358614,0.02034746,0.16904348,0.012622237,0.006408909,0.7886835],"study_design_scores_gemma":[0.000031878306,0.0003987959,0.004718368,0.000063234,0.00014629547,0.0026580843,0.00013443032,0.594461,0.35755917,0.02145993,0.018294916,0.00007382891],"about_ca_topic_score_codex":0.00042621396,"about_ca_topic_score_gemma":0.0005317828,"teacher_disagreement_score":0.0022470718,"about_ca_system_score_codex":0.00026449873,"about_ca_system_score_gemma":0.00029675162,"threshold_uncertainty_score":0.007517159},"labels":[],"label_agreement":null},{"id":"W4321231835","doi":"10.1007/978-3-031-25066-8_8","title":"AIM 2022 Challenge on Super-Resolution of Compressed Image and Video: Dataset, Methods and Results","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","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":"Huawei Technologies (Canada)","funders":"Julius-Maximilians-Universität Würzburg; MediaTek; Eidgenössische Technische Hochschule Zürich","keywords":"Computer science; Track (disk drive); Artificial intelligence; Computer vision; Image (mathematics); Resolution (logic); Image resolution; Computer graphics (images)","score_opus":0.03778798908087231,"score_gpt":0.342393482447527,"score_spread":0.30460549336665466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321231835","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061065022,0.01585328,0.09785116,0.00721598,0.0046385424,0.0050770203,0.7317488,0.048313566,0.02823664],"genre_scores_gemma":[0.023670375,0.0016962205,0.0688693,0.0010867728,0.0005359215,0.0017695809,0.8928432,0.0009999301,0.008528668],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99567705,0.000783531,0.00033221085,0.000832356,0.0018080147,0.0005668001],"domain_scores_gemma":[0.9935173,0.0012273946,0.00024518598,0.0021415472,0.002119594,0.0007490765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005157641,0.0041888524,0.0029049527,0.0029930284,0.0018385121,0.003429679,0.004341401,0.004301542,0.012305555],"category_scores_gemma":[0.013061636,0.0007370608,0.0028095292,0.0026795187,0.0011318792,0.0022877674,0.0051262793,0.0036201167,0.025180608],"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.0023186728,0.0012888558,0.002727225,0.0031777876,0.0004518785,0.00026870705,0.00008298895,0.0058571724,0.011741916,0.0023015002,0.8040675,0.1657158],"study_design_scores_gemma":[0.002557125,0.002774051,0.03575866,0.0017117837,0.0010200853,0.004136429,0.0009169082,0.14230974,0.092399895,0.024742208,0.6911442,0.00052891154],"about_ca_topic_score_codex":0.013460333,"about_ca_topic_score_gemma":0.01896633,"teacher_disagreement_score":0.013460333,"about_ca_system_score_codex":0.0014227899,"about_ca_system_score_gemma":0.0037183103,"threshold_uncertainty_score":0.041166186},"labels":[],"label_agreement":null},{"id":"W4321504838","doi":"10.1007/978-3-031-26504-4_6","title":"A Learning Metaheuristic Algorithm for a Scheduling Application","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Metaheuristic; Computer science; Parallel metaheuristic; Guided Local Search; Hyper-heuristic; Artificial intelligence; Scheduling (production processes); Mathematical optimization; Search-based software engineering; Machine learning; Algorithm; Mathematics; Software","score_opus":0.02921644708812989,"score_gpt":0.2975934123230751,"score_spread":0.26837696523494525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321504838","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.006059902,0.00029231576,0.9879447,0.0002144029,0.00011100293,0.00007055406,0.00003718182,0.00062938564,0.004640414],"genre_scores_gemma":[0.12006432,0.00034053525,0.8694493,0.00026621972,0.00016611516,0.00034200208,0.00012106707,0.00020640566,0.009043998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.00005828678,0.000011092297,0.00004396353,0.00008248872,0.0000290116],"domain_scores_gemma":[0.9996836,0.0001746984,0.000023697328,0.00002552215,0.00007291491,0.00001950163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005935353,0.0008176858,0.0007786219,0.0005271723,0.00054271804,0.00071511354,0.0014768724,0.0016618164,0.0046409317],"category_scores_gemma":[0.0013785844,0.00043847403,0.00082407804,0.00094799016,0.00050224835,0.0007463888,0.00082817033,0.0015368382,0.0009211733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005835193,0.00009948914,0.00015823414,0.00007555256,0.00003732679,0.00004402006,0.000028294353,0.7906365,0.0028309429,0.010777987,0.0033987195,0.19185464],"study_design_scores_gemma":[0.000011087756,0.000017806475,0.000025783349,0.0000039616816,0.000004905226,0.000008719929,0.000002726407,0.9961498,0.00033381965,0.002432745,0.0010059364,0.0000027127287],"about_ca_topic_score_codex":0.0035925987,"about_ca_topic_score_gemma":0.0035556736,"teacher_disagreement_score":0.0046409317,"about_ca_system_score_codex":0.0009014442,"about_ca_system_score_gemma":0.0011962639,"threshold_uncertainty_score":0.01552546},"labels":[],"label_agreement":null},{"id":"W4321504878","doi":"10.1007/978-3-031-26284-5_35","title":"CCLSL: Combination of Contrastive Learning and Supervised Learning for Handwritten Mathematical Expression Recognition","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Handwriting; Benchmark (surveying); Speech recognition; Pattern recognition (psychology); Robustness (evolution); Handwriting recognition; Deep learning; Feature extraction","score_opus":0.024780742021328704,"score_gpt":0.2660661685124395,"score_spread":0.24128542649111082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321504878","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.012352075,0.0008331272,0.9634203,0.00012539282,0.00018889563,0.0001538779,0.00053714094,0.017974181,0.0044150692],"genre_scores_gemma":[0.09636364,0.00044789477,0.87994885,0.00026300448,0.0001469159,0.00025218682,0.003049413,0.0014480387,0.018080113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927753,0.00010871347,0.000040085557,0.00018773152,0.0003145873,0.00007130651],"domain_scores_gemma":[0.99922013,0.0002520529,0.000040891915,0.00013642877,0.00030094685,0.000049671886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010761578,0.0011530075,0.0010664928,0.0016800722,0.00034486732,0.0012494159,0.0023818633,0.00087220094,0.011091454],"category_scores_gemma":[0.0013261208,0.00050661736,0.0009200502,0.0013622184,0.00042620662,0.0017750503,0.0015046233,0.0013851171,0.00487077],"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.00018007371,0.00019423412,0.000414424,0.00013040462,0.00005848463,0.00006387002,0.000027268938,0.012609697,0.030204915,0.0022891273,0.014461261,0.9393661],"study_design_scores_gemma":[0.000044352993,0.00016816422,0.00085887214,0.000034121553,0.000036026417,0.00014852687,0.00002493783,0.93022376,0.05011651,0.003927901,0.014385316,0.000031561554],"about_ca_topic_score_codex":0.0038327768,"about_ca_topic_score_gemma":0.008226401,"teacher_disagreement_score":0.011091454,"about_ca_system_score_codex":0.00057194603,"about_ca_system_score_gemma":0.0010490823,"threshold_uncertainty_score":0.037104547},"labels":[],"label_agreement":null},{"id":"W4321612638","doi":"10.1007/978-3-031-25734-6_10","title":"No Salvation from Trackers: Privacy Analysis of Religious Websites and Mobile Apps","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Media, Religion, Digital Communication","field":"Arts and Humanities","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":"Concordia University","funders":"","keywords":"Internet privacy; Android (operating system); BitTorrent tracker; Computer science; World Wide Web; Personally identifiable information; Computer security","score_opus":0.028249383561038514,"score_gpt":0.24610869692823553,"score_spread":0.21785931336719702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321612638","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.9404092,0.0014692995,0.02004218,0.002751186,0.000056067805,0.00012827452,0.002069942,0.00014511377,0.032928783],"genre_scores_gemma":[0.9933961,0.0002044045,0.0029283934,0.00009855411,0.00001894532,0.000018840512,0.0007029364,0.00003627658,0.0025956032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9966718,0.0013735226,0.00010887058,0.0003485721,0.0010591685,0.00043809536],"domain_scores_gemma":[0.9552551,0.035614666,0.0024523162,0.0035536955,0.0025897978,0.0005345104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003389355,0.00024478158,0.00032967245,0.0011928071,0.0009840797,0.0035429024,0.0008510651,0.0010239102,0.00403086],"category_scores_gemma":[0.02585731,0.00024206107,0.0005862919,0.0018099843,0.0014136146,0.005403888,0.0012761926,0.0016973878,0.00057965924],"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.0028198462,0.0015789102,0.33204663,0.00079953874,0.00043965195,0.0014243094,0.008913713,0.031691812,0.0053744153,0.35751757,0.028287949,0.2291056],"study_design_scores_gemma":[0.000102233294,0.0007049457,0.22275387,0.00037754586,0.0006558327,0.0025980799,0.022725219,0.49509367,0.016774043,0.2074696,0.030552888,0.00019212613],"about_ca_topic_score_codex":0.0067171897,"about_ca_topic_score_gemma":0.0075860494,"teacher_disagreement_score":0.0067171897,"about_ca_system_score_codex":0.0012597867,"about_ca_system_score_gemma":0.0014147412,"threshold_uncertainty_score":0.017924845},"labels":[],"label_agreement":null},{"id":"W4321612667","doi":"10.1007/978-3-031-25734-6","title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":12,"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":"Insight SFI Research Centre for Data Analytics; Universitat Oberta de Catalunya; University of the Aegean; Université de Lyon; Technische Universität Berlin; Purdue University; Norges Teknisk-Naturvitenskapelige Universitet; Universidad Carlos III de Madrid; Universitat Rovira i Virgili; Università degli Studi di Milano; Middlesex University; Université du Québec à Montréal; Meiji University; Università degli Studi di Padova; University of Ottawa","keywords":"Blockchain; Cryptocurrency; Computer science; Computer security; Information privacy; Big data; Internet privacy; Data mining","score_opus":0.023764287990471124,"score_gpt":0.2715993753645444,"score_spread":0.2478350873740733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321612667","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03525217,0.0325697,0.5922323,0.013423657,0.0016225297,0.00033766296,0.00043595623,0.0005973902,0.3235286],"genre_scores_gemma":[0.6725081,0.022482973,0.06909495,0.00094776397,0.0010493357,0.00037619824,0.0004360564,0.00017021439,0.23293439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833006,0.00050787156,0.000084770065,0.00019026177,0.0007186522,0.0001684072],"domain_scores_gemma":[0.99710375,0.0017837946,0.00017117431,0.0006188256,0.00023598525,0.000086560816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002121172,0.00055341626,0.00065082306,0.000951202,0.0014175713,0.0043525966,0.0010533595,0.001975286,0.010992644],"category_scores_gemma":[0.005057078,0.00041245847,0.00045466534,0.0028260695,0.003917988,0.008296274,0.0020081275,0.0026584615,0.0022212742],"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.00008187815,0.0000401303,0.00015885607,0.0001320201,0.000012774995,0.00007786506,0.00015386497,0.008593728,0.0008043907,0.91443145,0.0062592146,0.06925391],"study_design_scores_gemma":[0.000020109908,0.000038232167,0.00008074491,0.000078035206,0.0000073033575,0.0001290188,0.000059478713,0.019712735,0.0012713381,0.9379546,0.040636897,0.000011488917],"about_ca_topic_score_codex":0.0012672306,"about_ca_topic_score_gemma":0.0012219044,"teacher_disagreement_score":0.010992644,"about_ca_system_score_codex":0.0021912812,"about_ca_system_score_gemma":0.0015379032,"threshold_uncertainty_score":0.03677404},"labels":[],"label_agreement":null},{"id":"W4321612680","doi":"10.1007/978-3-031-25734-6_3","title":"Privacy-Preserving Link Prediction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Concordia University","funders":"","keywords":"Computer science; Homomorphic encryption; Plaintext; Node (physics); Graph; Encryption; Theoretical computer science; Computer network; Computer security; Data mining","score_opus":0.0352438301358976,"score_gpt":0.26463352960900977,"score_spread":0.22938969947311216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321612680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028699437,0.0014396835,0.94764924,0.0012781324,0.00039283867,0.00012636109,0.0020398279,0.004020685,0.014353713],"genre_scores_gemma":[0.7441643,0.0021113625,0.21462944,0.0006024813,0.0006211018,0.00015818239,0.0068232426,0.00044423086,0.030445686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976974,0.00045382883,0.00009978408,0.0005960767,0.000868929,0.0002839796],"domain_scores_gemma":[0.9922044,0.0026409002,0.00036177522,0.0041087633,0.0005348385,0.00014927742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019009318,0.001035764,0.0012316322,0.0015579707,0.0011716534,0.002527458,0.0024366828,0.0013297626,0.0059431223],"category_scores_gemma":[0.009449903,0.00065456156,0.000931096,0.0027831513,0.0010156038,0.0047398745,0.0028992817,0.0029257457,0.0037650329],"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.0008143527,0.0004146166,0.0034978676,0.0002268374,0.00015883218,0.000370807,0.00015825144,0.21050063,0.0071505373,0.123835854,0.05296934,0.59990203],"study_design_scores_gemma":[0.000025652243,0.00007356964,0.0005222832,0.00003241959,0.000048289847,0.0003469569,0.000045102268,0.839945,0.008839586,0.14170054,0.0083945,0.000026145994],"about_ca_topic_score_codex":0.0021444794,"about_ca_topic_score_gemma":0.002672133,"teacher_disagreement_score":0.0059431223,"about_ca_system_score_codex":0.0007987745,"about_ca_system_score_gemma":0.0016334809,"threshold_uncertainty_score":0.019881725},"labels":[],"label_agreement":null},{"id":"W4321851655","doi":"10.1007/978-3-031-24340-0_22","title":"Basic and Depression Specific Emotions Identification in Tweets: Multi-label Classification Experiments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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 Alberta","funders":"","keywords":"Computer science; Emotion classification; Artificial intelligence; Identification (biology); Macro; Deep learning; Machine learning; Sentiment analysis; Empirical research; Natural language processing","score_opus":0.07319826536210684,"score_gpt":0.3081987816288172,"score_spread":0.23500051626671037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321851655","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.9925418,0.00020277548,0.003910874,0.00014000977,0.00025567794,0.00019197738,0.0011859648,0.00014792423,0.0014228917],"genre_scores_gemma":[0.97863275,0.00017559231,0.011137711,0.00012160627,0.00013285661,0.00031191058,0.0054068244,0.000050566727,0.004030112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999275,0.00022788733,0.00007000481,0.00015541175,0.0001434344,0.00012822574],"domain_scores_gemma":[0.99773574,0.0013196254,0.00013611467,0.00020967143,0.00036408045,0.00023482961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635332,0.00079439196,0.00073014986,0.00037813146,0.00068574486,0.00073380535,0.0005288548,0.0010734837,0.0023056518],"category_scores_gemma":[0.0026713908,0.0001627465,0.0006004159,0.00035437674,0.00036444186,0.000750932,0.00074059877,0.0011726996,0.001392697],"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.047744785,0.039571267,0.11413938,0.0020135024,0.0010257914,0.001287294,0.0039003869,0.02348347,0.24230702,0.0013606154,0.030664044,0.4925025],"study_design_scores_gemma":[0.0016907998,0.01915889,0.3523374,0.00020396739,0.0013518248,0.0015395151,0.0072728614,0.44072366,0.1623233,0.0028087539,0.0102296425,0.00035936642],"about_ca_topic_score_codex":0.0021007254,"about_ca_topic_score_gemma":0.0025499894,"teacher_disagreement_score":0.0023056518,"about_ca_system_score_codex":0.00029027154,"about_ca_system_score_gemma":0.00037751318,"threshold_uncertainty_score":0.008648515},"labels":[],"label_agreement":null},{"id":"W4321851696","doi":"10.1007/978-3-031-24340-0_16","title":"Opinion Spam Detection with Attention-Based LSTM Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.01594542915386963,"score_gpt":0.22598570927991893,"score_spread":0.2100402801260493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321851696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10100092,0.0022110224,0.8758152,0.0011471115,0.0008506086,0.0001057382,0.00049268454,0.006269886,0.012106875],"genre_scores_gemma":[0.8475914,0.0006704343,0.13303924,0.0007551041,0.0007113266,0.000089933616,0.0008568617,0.00022551273,0.0160601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969256,0.000063675834,0.00001525878,0.000083078405,0.000073507355,0.000071966824],"domain_scores_gemma":[0.99922574,0.0003127994,0.0000654128,0.000056976955,0.0003063704,0.000032698088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006686695,0.00089613587,0.00067309523,0.00083547353,0.00033669063,0.00087646674,0.0008199814,0.0013257754,0.0033596586],"category_scores_gemma":[0.0020589887,0.00029966634,0.00059061754,0.00068647525,0.00028056063,0.0011084524,0.0006730892,0.0012033272,0.0023620923],"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.00053820707,0.00025630638,0.0025298654,0.00015881508,0.0001502318,0.00017966884,0.00011320015,0.057094537,0.043395422,0.0026528419,0.016026154,0.8769048],"study_design_scores_gemma":[0.0000074890368,0.000058985155,0.0006614074,0.000010686164,0.00004015738,0.00005814094,0.000012223086,0.9866087,0.009489076,0.002097491,0.00094500487,0.000010616654],"about_ca_topic_score_codex":0.0027625153,"about_ca_topic_score_gemma":0.0041477266,"teacher_disagreement_score":0.0033596586,"about_ca_system_score_codex":0.00062947895,"about_ca_system_score_gemma":0.0003497767,"threshold_uncertainty_score":0.011239111},"labels":[],"label_agreement":null},{"id":"W4322096374","doi":"10.1007/978-3-031-23793-5","title":"Computational Linguistics and Intelligent Text Processing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":3,"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":"Zürcher Hochschule für Angewandte Wissenschaften; Universitat Politècnica de València; Pázmány Péter Katolikus Egyetem; National Institute of Technology, Silchar; University of the Aegean; Indian Institute of Technology Delhi; Bulgarian Academy of Sciences; Indian Institute of Technology Bombay; Universität Bielefeld; Institute for Infocomm Research; Waseda University; Euskal Herriko Unibertsitatea; Universidade de São Paulo; Ege Üniversitesi; Joint Research Centre; Concordia University; Jadavpur University; Trinity College Dublin; Nanyang Technological University; Carnegie Mellon University; Universitat Politècnica de Catalunya; Centre National de la Recherche Scientifique; Univerzita Karlova v Praze; University of Wolverhampton; University of Louisiana at Lafayette; Newcastle University; Masarykova Univerzita; De Montfort University; Norges Teknisk-Naturvitenskapelige Universitet; Kent State University; Universidade de Vigo; University of Derby; University of Ottawa; Dalhousie University; Tulane University; Universidad de Alicante; University of North Texas; Hamad Bin Khalifa University; Universidad Nacional de Educación a Distancia; Instituto Politécnico Nacional; Universitat Pompeu Fabra; University of Memphis","keywords":"Computer science; Computational linguistics; Natural language processing; Artificial intelligence; Text processing","score_opus":0.023599166530564868,"score_gpt":0.28108728613052475,"score_spread":0.2574881195999599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322096374","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008654001,0.054485645,0.455161,0.020922428,0.005372295,0.00018356285,0.0020605645,0.0031103492,0.45005012],"genre_scores_gemma":[0.11497768,0.035369262,0.2544062,0.0031851816,0.0076673697,0.00033137552,0.0052375277,0.002936778,0.57588863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999728,0.000082550534,0.00002610673,0.000051300172,0.00009700031,0.000015042862],"domain_scores_gemma":[0.998697,0.00097120047,0.00005574128,0.0000949735,0.0001414251,0.000039766728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265436,0.00068155717,0.00071070966,0.0027843679,0.00083366595,0.0036739362,0.00074222946,0.0007410333,0.035026535],"category_scores_gemma":[0.0023095454,0.00048924604,0.00047879037,0.0028940304,0.0019243172,0.0066149663,0.0010367779,0.001523684,0.015520775],"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.000028755378,0.000033368564,0.0001980382,0.00059859816,0.00003020924,0.00014934457,0.0005923463,0.0009594423,0.00252268,0.44494885,0.17215894,0.37777942],"study_design_scores_gemma":[0.0000090303065,0.00001143861,0.00030418325,0.00017741247,0.0000185783,0.00022444173,0.00021751202,0.0042885384,0.0013812054,0.6480162,0.34533548,0.000016010546],"about_ca_topic_score_codex":0.0006791668,"about_ca_topic_score_gemma":0.0011013567,"teacher_disagreement_score":0.035026535,"about_ca_system_score_codex":0.00069072115,"about_ca_system_score_gemma":0.0007151459,"threshold_uncertainty_score":0.1171754},"labels":[],"label_agreement":null},{"id":"W4322096525","doi":"10.1007/978-3-031-24337-0_22","title":"Building Personalized Language Models Through Language Model Interpolation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Perplexity; Language model; Computer science; Artificial intelligence; Natural language processing; Social media; Interpolation (computer graphics); Cache language model; Natural language; Universal Networking Language; Comprehension approach; World Wide Web","score_opus":0.0376111306386286,"score_gpt":0.2919027307924812,"score_spread":0.2542916001538526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322096525","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.004134963,0.00021484865,0.98473686,0.000093689254,0.000056195247,0.00005458496,0.000551586,0.008385957,0.0017713],"genre_scores_gemma":[0.14119925,0.00089092227,0.83607334,0.0002511814,0.000114603,0.00031542932,0.0057645766,0.0030307868,0.012359891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898154,0.0002734562,0.000052495827,0.00035291153,0.00025445348,0.00008507127],"domain_scores_gemma":[0.9984932,0.0008202241,0.000052617284,0.00039854622,0.00018346892,0.00005201856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011762629,0.0012322735,0.0012140452,0.0013683139,0.0007293257,0.001995872,0.0018015605,0.0011774959,0.009409558],"category_scores_gemma":[0.004298896,0.0015965612,0.00293874,0.0015884852,0.0004902983,0.003971796,0.0019405725,0.0030230628,0.009681283],"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.00036036805,0.00027049714,0.001399156,0.000362267,0.0003522592,0.00037849427,0.0005208606,0.23983498,0.018230755,0.030739289,0.02958912,0.67796195],"study_design_scores_gemma":[0.00002181518,0.000037670896,0.00017962852,0.000021307349,0.00008154415,0.00014914837,0.000063347754,0.94999987,0.0084454045,0.030150436,0.010820147,0.000029756768],"about_ca_topic_score_codex":0.006201977,"about_ca_topic_score_gemma":0.010743846,"teacher_disagreement_score":0.009409558,"about_ca_system_score_codex":0.00085193414,"about_ca_system_score_gemma":0.0010677151,"threshold_uncertainty_score":0.031478047},"labels":[],"label_agreement":null},{"id":"W4322096593","doi":"10.1007/978-3-031-23804-8","title":"Computational Linguistics and Intelligent Text Processing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","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":"Zürcher Hochschule für Angewandte Wissenschaften; Universitat Politècnica de València; Pázmány Péter Katolikus Egyetem; National Institute of Technology, Silchar; University of the Aegean; Indian Institute of Technology Delhi; Bulgarian Academy of Sciences; Indian Institute of Technology Bombay; Universität Bielefeld; Institute for Infocomm Research; Waseda University; Euskal Herriko Unibertsitatea; Universidade de São Paulo; Ege Üniversitesi; Joint Research Centre; Concordia University; Jadavpur University; Trinity College Dublin; Nanyang Technological University; Carnegie Mellon University; Universitat Politècnica de Catalunya; Centre National de la Recherche Scientifique; Univerzita Karlova v Praze; University of Wolverhampton; University of Louisiana at Lafayette; Newcastle University; Masarykova Univerzita; De Montfort University; Norges Teknisk-Naturvitenskapelige Universitet; Kent State University; Universidade de Vigo; University of Derby; University of Ottawa; Dalhousie University; Tulane University; Universidad de Alicante; University of North Texas; Hamad Bin Khalifa University; Universidad Nacional de Educación a Distancia; Instituto Politécnico Nacional; Universitat Pompeu Fabra; University of Memphis","keywords":"Computer science; Computational linguistics; Natural language processing; Artificial intelligence; Text processing","score_opus":0.023599166530564868,"score_gpt":0.28108728613052475,"score_spread":0.2574881195999599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322096593","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008654001,0.054485645,0.455161,0.020922428,0.005372295,0.00018356285,0.0020605645,0.0031103492,0.45005012],"genre_scores_gemma":[0.11497768,0.035369262,0.2544062,0.0031851816,0.0076673697,0.00033137552,0.0052375277,0.002936778,0.57588863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999728,0.000082550534,0.00002610673,0.000051300172,0.00009700031,0.000015042862],"domain_scores_gemma":[0.998697,0.00097120047,0.00005574128,0.0000949735,0.0001414251,0.000039766728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265436,0.00068155717,0.00071070966,0.0027843679,0.00083366595,0.0036739362,0.00074222946,0.0007410333,0.035026535],"category_scores_gemma":[0.0023095454,0.00048924604,0.00047879037,0.0028940304,0.0019243172,0.0066149663,0.0010367779,0.001523684,0.015520775],"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.000028755378,0.000033368564,0.0001980382,0.00059859816,0.00003020924,0.00014934457,0.0005923463,0.0009594423,0.00252268,0.44494885,0.17215894,0.37777942],"study_design_scores_gemma":[0.0000090303065,0.00001143861,0.00030418325,0.00017741247,0.0000185783,0.00022444173,0.00021751202,0.0042885384,0.0013812054,0.6480162,0.34533548,0.000016010546],"about_ca_topic_score_codex":0.0006791668,"about_ca_topic_score_gemma":0.0011013567,"teacher_disagreement_score":0.035026535,"about_ca_system_score_codex":0.00069072115,"about_ca_system_score_gemma":0.0007151459,"threshold_uncertainty_score":0.1171754},"labels":[],"label_agreement":null},{"id":"W4322096648","doi":"10.1007/978-3-031-26351-4_20","title":"Cluster Contrast for Unsupervised Person Re-identification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Softmax function; Artificial intelligence; Pattern recognition (psychology); Feature learning; Contrast (vision); Feature (linguistics); Cluster analysis; Unsupervised learning; Feature vector; Identification (biology); Artificial neural network; Machine learning","score_opus":0.05271762679865026,"score_gpt":0.2996299347600211,"score_spread":0.2469123079613708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322096648","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.011447123,0.000589527,0.9835437,0.000076262564,0.0001238285,0.00007375165,0.0003051786,0.0019170031,0.0019235658],"genre_scores_gemma":[0.1782467,0.00055460044,0.8064847,0.00017390536,0.0001704081,0.00018588235,0.0017444879,0.0010569075,0.011382447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912494,0.0001544685,0.000026704924,0.00031790475,0.00024885352,0.00012718233],"domain_scores_gemma":[0.99865025,0.0005459669,0.00006539109,0.00034458993,0.00034429037,0.000049512677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011629316,0.0010250254,0.0018566251,0.0013720191,0.0006663123,0.0010813243,0.0021880153,0.0012013871,0.005853112],"category_scores_gemma":[0.0026707938,0.00055560435,0.0010090854,0.0015966342,0.0005663292,0.0014538973,0.0020410265,0.0015327462,0.0034383752],"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.00090883486,0.00018194233,0.0011303754,0.00018745087,0.00019417945,0.00009587056,0.00008092636,0.033507973,0.05515072,0.010117918,0.011053293,0.8873905],"study_design_scores_gemma":[0.000028517668,0.00016334806,0.0026180118,0.000029411949,0.000079913065,0.00027383945,0.00006192636,0.9311529,0.046748273,0.010926009,0.00787139,0.000046558587],"about_ca_topic_score_codex":0.0038951153,"about_ca_topic_score_gemma":0.0077038812,"teacher_disagreement_score":0.005853112,"about_ca_system_score_codex":0.00070210046,"about_ca_system_score_gemma":0.0008764764,"threshold_uncertainty_score":0.019580603},"labels":[],"label_agreement":null},{"id":"W4322096737","doi":"10.1007/978-3-031-24337-0_14","title":"Contrastive Reasons Detection and Clustering from Online Polarized Debates","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Computer science; Automatic summarization; Cluster analysis; Pipeline (software); Viewpoints; Relevance (law); Natural language processing; Artificial intelligence; Phrase; Argument (complex analysis); Contrastive analysis; Information retrieval; Linguistics","score_opus":0.021962704253942006,"score_gpt":0.2534200535667218,"score_spread":0.2314573493127798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322096737","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.47943273,0.003234846,0.48254862,0.0011759682,0.0006384337,0.0005123935,0.005731537,0.0034583248,0.02326717],"genre_scores_gemma":[0.81804883,0.00047014796,0.16138722,0.00012287908,0.0004998321,0.00023546851,0.010318663,0.00030690565,0.008610145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850094,0.00035291183,0.00010254406,0.0003693287,0.0004266529,0.00024768198],"domain_scores_gemma":[0.99670726,0.0016241232,0.00025743915,0.00033432676,0.0009202377,0.00015658211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174709,0.00072487927,0.0008182536,0.0051061637,0.0012262699,0.0023884054,0.0010035489,0.00093198795,0.0031838862],"category_scores_gemma":[0.006246049,0.00028563745,0.0009929158,0.0032418561,0.00046059606,0.0017318174,0.0014085431,0.0012683577,0.0027695193],"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.0018008561,0.00044772786,0.031096503,0.0005418939,0.00029852652,0.0005728264,0.0022239992,0.007982811,0.050842375,0.018026307,0.029277906,0.8568883],"study_design_scores_gemma":[0.00009493251,0.00027713014,0.050140336,0.0001980438,0.0003923819,0.00078554364,0.004424574,0.80391663,0.05204874,0.046481814,0.0411252,0.00011470426],"about_ca_topic_score_codex":0.0020730156,"about_ca_topic_score_gemma":0.0040673725,"teacher_disagreement_score":0.0051061637,"about_ca_system_score_codex":0.00060075795,"about_ca_system_score_gemma":0.0007514306,"threshold_uncertainty_score":0.010651112},"labels":[],"label_agreement":null},{"id":"W4322096776","doi":"10.1007/978-3-031-23804-8_2","title":"Using Shallow Semantic Analysis to Implement Automated Quality Assessment of Web Health Care Information","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Health Literacy and Information Accessibility","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Information retrieval; Semantics (computer science); Sentence; Concordance; Quality (philosophy); Health care; Natural language processing; Semantic Web; World Wide Web; Artificial intelligence; Medicine","score_opus":0.12129732221470563,"score_gpt":0.518427868263613,"score_spread":0.39713054604890735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322096776","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.06635534,0.00013295871,0.9069281,0.0005094826,0.000061850646,0.00033856084,0.0010694604,0.020939093,0.0036651413],"genre_scores_gemma":[0.37666222,0.000085695065,0.61800253,0.00020027287,0.000020042202,0.0001733801,0.0026410157,0.0008187385,0.0013961656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969247,0.00081118016,0.00037344065,0.00041716575,0.0012344532,0.00023911646],"domain_scores_gemma":[0.9918411,0.004318562,0.0005876852,0.0009898561,0.00210899,0.00015384686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030123303,0.0007247343,0.0007021249,0.0033394392,0.001053061,0.0031422293,0.0013803284,0.0008980826,0.0022361937],"category_scores_gemma":[0.014587902,0.00068836886,0.0013304073,0.002137001,0.0012420665,0.00405051,0.002977377,0.0012266454,0.00082238007],"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.00071671425,0.0008376262,0.032398608,0.000858113,0.00033769314,0.0006591193,0.0028958414,0.06343735,0.044787265,0.068431504,0.0194469,0.76519334],"study_design_scores_gemma":[0.000037876212,0.00007405724,0.0022824805,0.00006971765,0.000097338234,0.00008522603,0.00040753922,0.9106783,0.024432762,0.056461785,0.0053314986,0.000041414263],"about_ca_topic_score_codex":0.016560134,"about_ca_topic_score_gemma":0.01984899,"teacher_disagreement_score":0.016560134,"about_ca_system_score_codex":0.0019413456,"about_ca_system_score_gemma":0.0035612874,"threshold_uncertainty_score":0.032927513},"labels":[],"label_agreement":null},{"id":"W4322746788","doi":"10.1007/978-3-031-26313-2_5","title":"Blind Image Super-Resolution with Degradation-Aware Adaptation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Upsampling; Degradation (telecommunications); Artificial intelligence; Generalization; Representation (politics); Image (mathematics); Image restoration; Encoder; Computer vision; Adaptation (eye); Image resolution; Pattern recognition (psychology); Image processing; Mathematics","score_opus":0.02943291844688085,"score_gpt":0.27351533011510615,"score_spread":0.2440824116682253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322746788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005128848,0.0010561708,0.9901494,0.00012141688,0.00010207891,0.000024934126,0.00009112273,0.00064958207,0.002676524],"genre_scores_gemma":[0.14936393,0.0028582937,0.83460206,0.00041464897,0.0002437312,0.00009579112,0.0004582232,0.00029939122,0.011663894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959654,0.00008967838,0.00002289608,0.0000806888,0.00017313992,0.000037145655],"domain_scores_gemma":[0.99926835,0.00029780675,0.000046932226,0.00020089383,0.00015723483,0.000028723587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058570935,0.0008386903,0.0007300016,0.00045634547,0.00020687093,0.0007006447,0.0006366255,0.0009908976,0.0030637516],"category_scores_gemma":[0.0018971494,0.00037086906,0.0005884475,0.0007610549,0.00053038896,0.0011451145,0.0010589679,0.0011829382,0.0018812141],"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.0006541193,0.00011760317,0.00037726064,0.00059331063,0.0001905981,0.00029241404,0.00010042147,0.042864252,0.36936194,0.011875798,0.010008885,0.5635634],"study_design_scores_gemma":[0.00003403643,0.00012446959,0.0013539321,0.00006377962,0.0001343584,0.0013165717,0.000025841897,0.79504585,0.17214261,0.015350974,0.014340348,0.00006730877],"about_ca_topic_score_codex":0.00072504056,"about_ca_topic_score_gemma":0.0014081657,"teacher_disagreement_score":0.0030637516,"about_ca_system_score_codex":0.00023178407,"about_ca_system_score_gemma":0.00039736895,"threshold_uncertainty_score":0.0102491975},"labels":[],"label_agreement":null},{"id":"W4323026395","doi":"10.1007/978-3-031-27481-7","title":"Formal Methods","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"College of Engineering, Michigan State University; Gran Sasso Science Institute; Mälardalens högskola; Universidad Nacional de Río Cuarto; RWTH Aachen University; Bauhaus-Universität Weimar; Technische Universität Darmstadt; Technische Universität Wien; Universität zu Lübeck; Macquarie University; Centre National de la Recherche Scientifique; Universität des Saarlandes; Vysoké Učení Technické v Brně; Chinese Academy of Sciences; Radboud Universiteit; Universität Bremen; Nanyang Technological University; Universitetet i Oslo; Universiteit Stellenbosch; Helsingin Yliopisto; University of Alberta; Danmarks Tekniske Universitet; Kennesaw State University; Amazon Web Services; Imperial College London; McMaster University; University of Toronto; Universidade do Minho; Michigan State University; Microsoft Research; University of Waterloo; National Institute of Informatics; University of Twente","keywords":"Computer science","score_opus":0.04229805829515437,"score_gpt":0.35406301768523574,"score_spread":0.31176495939008136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323026395","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.00067518256,0.0062311552,0.6274278,0.0017828783,0.0012343808,0.00023801017,0.0010269613,0.0046305307,0.35675314],"genre_scores_gemma":[0.03871019,0.009021423,0.34486467,0.0014603351,0.001055855,0.0007963633,0.003469273,0.0037600845,0.5968618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790657,0.00047000914,0.0001356939,0.000334912,0.0010364997,0.00011632178],"domain_scores_gemma":[0.99840003,0.0008068858,0.00004696502,0.00042026545,0.00027785986,0.00004783869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021501582,0.0014205944,0.0010150437,0.0019192192,0.0010611336,0.003897138,0.0019904901,0.0012635184,0.11791032],"category_scores_gemma":[0.004188138,0.001110332,0.001345952,0.0013157624,0.0018632796,0.004584806,0.0020034753,0.0031420232,0.063178726],"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.000023799636,0.000044737495,0.000086311935,0.00044011237,0.000019575702,0.0000528021,0.0003455254,0.0008283769,0.0009924633,0.66724193,0.099856764,0.2300677],"study_design_scores_gemma":[0.000020400112,0.000012063474,0.00007380653,0.00022146573,0.000010906821,0.00015941891,0.000053340213,0.0016966196,0.0011695895,0.27424115,0.7223288,0.000012513966],"about_ca_topic_score_codex":0.0008865395,"about_ca_topic_score_gemma":0.0009177103,"teacher_disagreement_score":0.11791032,"about_ca_system_score_codex":0.0013518005,"about_ca_system_score_gemma":0.0012534998,"threshold_uncertainty_score":0.39444935},"labels":[],"label_agreement":null},{"id":"W4323057542","doi":"10.1007/978-3-031-26319-4_5","title":"NEO-3DF: Novel Editing-Oriented 3D Face Creation and Reconstruction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"Huawei Technologies (Canada); University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Face (sociological concept); Artificial intelligence; Computer vision; Image editing; Image (mathematics); Set (abstract data type); Computer graphics (images); Programming language","score_opus":0.01720341035380671,"score_gpt":0.23938246031775556,"score_spread":0.22217904996394885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323057542","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.0051083923,0.00033373985,0.98389786,0.00007863565,0.00018286024,0.000064062646,0.00025111626,0.004956255,0.005127048],"genre_scores_gemma":[0.06723136,0.0006832536,0.91636074,0.00017432639,0.00008490822,0.00009137338,0.00083317974,0.0026845583,0.011856388],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995189,0.000028192477,0.000015171802,0.00006683849,0.00033004992,0.000040862695],"domain_scores_gemma":[0.9997012,0.0000705528,0.00001726188,0.00012320302,0.000062351406,0.000025362458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040392642,0.00073426036,0.00064119394,0.00095319614,0.00027563918,0.0013855498,0.0016068232,0.000771937,0.01027776],"category_scores_gemma":[0.0007479485,0.0005930756,0.0009773211,0.0005711226,0.00043538128,0.000855033,0.0016208752,0.001166574,0.0038423082],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021190078,0.00008963933,0.00067068764,0.0003117912,0.00007276389,0.00032585705,0.00020521581,0.0155475065,0.16811633,0.019844748,0.025837,0.7687666],"study_design_scores_gemma":[0.00005898197,0.00018637872,0.00188384,0.00009906763,0.00007452046,0.006878929,0.000114488146,0.47866893,0.3037428,0.01978878,0.18832631,0.0001769529],"about_ca_topic_score_codex":0.0008230108,"about_ca_topic_score_gemma":0.0013383911,"teacher_disagreement_score":0.01027776,"about_ca_system_score_codex":0.00028338932,"about_ca_system_score_gemma":0.00042985688,"threshold_uncertainty_score":0.034382522},"labels":[],"label_agreement":null},{"id":"W4323057590","doi":"10.1007/978-3-031-26319-4_9","title":"Vectorizing Building Blueprints","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science; Blueprint; Vectorization (mathematics); Segmentation; Heuristics; Preprocessor; Process (computing); Artificial intelligence; Scale (ratio); Programming language; Parallel computing","score_opus":0.03308549063780914,"score_gpt":0.23773356051846878,"score_spread":0.20464806988065964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323057590","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.0129237035,0.00015989933,0.9728855,0.0000644539,0.00011675982,0.00009598412,0.0005512188,0.007889366,0.005313177],"genre_scores_gemma":[0.16178977,0.00043736745,0.8071951,0.00009884604,0.000042511892,0.00015683426,0.0047818497,0.0022397218,0.023258043],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993888,0.000046570476,0.000023065626,0.00019709753,0.00025541734,0.00008899782],"domain_scores_gemma":[0.99943537,0.00009953299,0.000024662611,0.00017040067,0.00023974014,0.000030305977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033955535,0.0016688306,0.00080475165,0.0018814408,0.00046251118,0.0018233004,0.0011878613,0.0007260906,0.01968483],"category_scores_gemma":[0.001477943,0.00071645156,0.000913791,0.0019903432,0.0005499463,0.0016420401,0.0019778248,0.0010613226,0.008198772],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014728309,0.000064883134,0.0006957244,0.00011134328,0.000030454426,0.00006870752,0.00007081299,0.052218743,0.03192187,0.008567682,0.010332498,0.89576995],"study_design_scores_gemma":[0.000029371633,0.00022693405,0.0012914557,0.00005003412,0.000046223493,0.0002909315,0.00024921168,0.864673,0.07480817,0.02218197,0.036111496,0.000041227733],"about_ca_topic_score_codex":0.003960137,"about_ca_topic_score_gemma":0.0060204905,"teacher_disagreement_score":0.01968483,"about_ca_system_score_codex":0.0004688004,"about_ca_system_score_gemma":0.00081343367,"threshold_uncertainty_score":0.065852284},"labels":[],"label_agreement":null},{"id":"W4323527361","doi":"10.1007/978-3-031-28083-2","title":"Relational and Algebraic Methods in Computer Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Algebraic number; Algebra over a field; Theoretical computer science; Programming language; Mathematics","score_opus":0.04354869396609875,"score_gpt":0.32441363785229005,"score_spread":0.2808649438861913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323527361","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028150994,0.09508049,0.27593148,0.005477271,0.0045182183,0.000074712276,0.0005192266,0.0008967547,0.6146867],"genre_scores_gemma":[0.07306514,0.0798739,0.18300864,0.0014787192,0.0069017475,0.00026912722,0.0009437534,0.0011236587,0.6533354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994802,0.00012080775,0.00003575841,0.00007406949,0.00026563703,0.000023678658],"domain_scores_gemma":[0.9991715,0.0005610718,0.000025823112,0.00009909495,0.0001122121,0.000030366533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197108,0.0009052723,0.00092990795,0.0019849648,0.00088087603,0.0035481283,0.0008625601,0.0006702854,0.03700215],"category_scores_gemma":[0.0018758846,0.00054342096,0.0005806045,0.004426022,0.0021766154,0.0068753823,0.0011312794,0.0021011422,0.010786903],"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.0000061778633,0.000012018685,0.00003367331,0.00022284067,0.000008241295,0.000017956512,0.00016109235,0.00056778075,0.00031117874,0.87151563,0.053193282,0.07395018],"study_design_scores_gemma":[0.0000060823013,0.000008932163,0.0001090818,0.000086725995,0.000009643264,0.0001212172,0.000058430283,0.0015868191,0.00020864153,0.6290826,0.36871335,0.000008450892],"about_ca_topic_score_codex":0.0012581149,"about_ca_topic_score_gemma":0.0017931892,"teacher_disagreement_score":0.03700215,"about_ca_system_score_codex":0.0013780685,"about_ca_system_score_gemma":0.00085771346,"threshold_uncertainty_score":0.12378448},"labels":[],"label_agreement":null},{"id":"W4323527413","doi":"10.1007/978-3-031-28083-2_17","title":"Relational Algebraic Approach to the Real Numbers the Additive Group","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Axiom; Relation (database); Abelian group; Object (grammar); Real number; Group (periodic table); Computer science; Algebraic number; Algebraic operation; Algebraic structure; Algebra over a field; Discrete mathematics; Theoretical computer science; Mathematics; Pure mathematics; Artificial intelligence; Data mining","score_opus":0.027827863965791007,"score_gpt":0.23967725196235407,"score_spread":0.21184938799656305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323527413","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026913347,0.024858562,0.28658387,0.0059508868,0.0019683442,0.000037832826,0.00026625764,0.0003462251,0.6530746],"genre_scores_gemma":[0.6788112,0.017899757,0.10758115,0.0012669609,0.0042571337,0.000102255566,0.0002860886,0.00014840516,0.18964703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996147,0.00012636119,0.000021197175,0.00007050479,0.00013911269,0.000028138367],"domain_scores_gemma":[0.9996606,0.0001684465,0.000027364245,0.000057188627,0.000058124184,0.00002814234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128571,0.0005466903,0.00042934908,0.0011933208,0.0008425291,0.0033953697,0.0008958649,0.00055565045,0.0072410167],"category_scores_gemma":[0.0011061302,0.00025272975,0.00047757107,0.001177603,0.0035584606,0.003929326,0.0010384624,0.0022924608,0.0014529459],"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.0000014002234,0.0000018765151,0.0000069414614,0.000008063416,8.603422e-7,0.000008053218,0.000049936403,0.00013067471,0.000095404015,0.99734014,0.0004650279,0.0018915893],"study_design_scores_gemma":[0.0000024740593,0.0000070850983,0.000035507077,0.000009083888,0.0000029300659,0.000056482833,0.000049727703,0.0006384953,0.0001299412,0.9666104,0.032454386,0.000003636406],"about_ca_topic_score_codex":0.00079025334,"about_ca_topic_score_gemma":0.0006882613,"teacher_disagreement_score":0.0072410167,"about_ca_system_score_codex":0.0014349915,"about_ca_system_score_gemma":0.0005707396,"threshold_uncertainty_score":0.024223566},"labels":[],"label_agreement":null},{"id":"W4323527457","doi":"10.1007/978-3-031-28083-2_3","title":"A General Method for Representing Sets of Relations by Vectors","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Algebraic number; Relation (database); Representation (politics); Algebra over a field; Mathematics; Core (optical fiber); Computer science; Discrete mathematics; Pure mathematics; Mathematical analysis; Data mining","score_opus":0.02948213755386343,"score_gpt":0.3004086659942145,"score_spread":0.2709265284403511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323527457","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.00026185942,0.00019223859,0.9952951,0.000095187235,0.00015032991,0.00006714673,0.0003645479,0.0009547057,0.002618809],"genre_scores_gemma":[0.008562575,0.0005274158,0.97782284,0.00016235358,0.00013536292,0.0003264663,0.001052428,0.00063592463,0.010774535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974038,0.00047963712,0.00039965755,0.00074284704,0.0008132357,0.00016078215],"domain_scores_gemma":[0.9986449,0.00041765027,0.00006919468,0.0005180038,0.00029236893,0.000057878646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021749425,0.0018842825,0.0014455251,0.0037950506,0.0015868624,0.0067334766,0.004246575,0.0014539666,0.020512426],"category_scores_gemma":[0.0042146835,0.0013302136,0.0036204779,0.0068051172,0.0022408853,0.0112930825,0.0035100302,0.0043592085,0.009531439],"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.000067632405,0.000037605463,0.00014161733,0.0003200074,0.000057270438,0.00008947277,0.00040767726,0.0022644426,0.0033400727,0.7721206,0.015465209,0.20568836],"study_design_scores_gemma":[0.00004295072,0.00005045353,0.00011775901,0.00018478592,0.00008818556,0.0004575965,0.00013891212,0.029781902,0.0058461824,0.7088067,0.25439835,0.00008623358],"about_ca_topic_score_codex":0.0026575981,"about_ca_topic_score_gemma":0.0032579557,"teacher_disagreement_score":0.020512426,"about_ca_system_score_codex":0.001022549,"about_ca_system_score_gemma":0.001239966,"threshold_uncertainty_score":0.06862092},"labels":[],"label_agreement":null},{"id":"W4323647102","doi":"10.1007/978-3-031-25599-1","title":"Machine Learning, Optimization, and Data Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":5,"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":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Leibniz-Gemeinschaft; University of Ioannina; Lobachevsky State University of Nizhny Novgorod; National Technical University of Athens; Institut Teknologi Bandung; Università di Pisa; RWTH Aachen University; Università degli Studi di Verona; Ural Federal University; Università di Bologna; University College Dublin; North-West University; Kungliga Tekniska Högskolan; Ulster University; Universidad de Granada; National and Kapodistrian University of Athens; Universite Angers; National Research University Higher School of Economics; Technische Universität Wien; Università di Catania; Universidade de Coimbra; Universität Passau; Arizona State University; Vysoká Škola Ekonomická v Praze; University of Crete; Università degli Studi di Udine; Queen Mary University of London; Università della Calabria; Università degli Studi di Padova; Leibniz-Rechenzentrum; University of Reading; York University; Universiteit Leiden; Jyväskylän Yliopisto; Polytechnique Montréal; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; McMaster University; University of Oxford; University of Alberta; Università degli Studi di Urbino Carlo Bo; University of Western Macedonia; Université de Lille; Università degli Studi di Parma; Queensland University of Technology; Chinese University of Hong Kong; Università Ca' Foscari Venezia; University of Minnesota; Centre National de la Recherche Scientifique; Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Università degli Studi di Cagliari; Universidade de Aveiro; Università degli Studi di Torino; Università degli Studi di Milano","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.058349370588264254,"score_gpt":0.2946248138208917,"score_spread":0.23627544323262742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323647102","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028044435,0.38381448,0.38442984,0.020201607,0.0062827975,0.000098486125,0.0012560658,0.0013830448,0.19972923],"genre_scores_gemma":[0.086966306,0.2500262,0.26523045,0.0060191834,0.013233644,0.00039433507,0.002439389,0.0017016019,0.37398887],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992151,0.0001854447,0.00004598903,0.00013273727,0.00038987954,0.000030846142],"domain_scores_gemma":[0.99767154,0.0018344822,0.00008734969,0.00017086769,0.0001782685,0.00005754596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011904899,0.001561385,0.002311434,0.0017127483,0.0004281527,0.0034615824,0.000864133,0.001020562,0.017432615],"category_scores_gemma":[0.003850814,0.00071817794,0.00056268286,0.0041595884,0.0020530156,0.00394211,0.0010725938,0.0035355084,0.007039822],"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.000057777565,0.0000669857,0.0004153844,0.00095671986,0.000102662096,0.0000451651,0.00007621433,0.013639711,0.00060478837,0.30679762,0.30563387,0.3716031],"study_design_scores_gemma":[0.000019731673,0.000030247686,0.00056838815,0.00028047798,0.000029020584,0.00011047591,0.000045854766,0.029025035,0.0003883304,0.6510749,0.31840357,0.000024056822],"about_ca_topic_score_codex":0.0019487676,"about_ca_topic_score_gemma":0.0025437002,"teacher_disagreement_score":0.017432615,"about_ca_system_score_codex":0.0011598427,"about_ca_system_score_gemma":0.0012393389,"threshold_uncertainty_score":0.05831784},"labels":[],"label_agreement":null},{"id":"W4323647112","doi":"10.1007/978-3-031-25599-1_6","title":"A Kernel-Based Multilayer Perceptron Framework to Identify Pathways Related to Cancer Stages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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":"Hospital for Sick Children","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Multilayer perceptron; Machine learning; Classifier (UML); Kernel (algebra); Random forest; Perceptron; Artificial neural network; Pattern recognition (psychology); Mathematics","score_opus":0.02619735311204053,"score_gpt":0.32127235710204777,"score_spread":0.29507500399000725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323647112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013754469,0.00056108733,0.9834885,0.0001292162,0.000052179992,0.000021697802,0.00019895108,0.0011312354,0.00066269294],"genre_scores_gemma":[0.51469857,0.0008223195,0.46961647,0.00017021463,0.0001366701,0.00017996997,0.0012736353,0.0002926633,0.012809461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996835,0.00010073029,0.0000208514,0.00006190952,0.000076361786,0.000056675006],"domain_scores_gemma":[0.9994992,0.00022035908,0.00003784423,0.000053147523,0.00015597808,0.000033377837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140652,0.0006159883,0.00096542697,0.00062365783,0.00033885505,0.0008413783,0.0014612463,0.00086690363,0.0023081803],"category_scores_gemma":[0.0015743341,0.00035936918,0.0011129699,0.0007886566,0.00027862642,0.0008552407,0.0008523428,0.0011464757,0.0010339362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039444055,0.00031684365,0.0021822935,0.0001462409,0.00027267073,0.000104084356,0.00007902741,0.51162815,0.010042093,0.014864217,0.006289167,0.45368078],"study_design_scores_gemma":[0.0000030296408,0.000013594014,0.00016540017,0.000002266622,0.000012082904,0.0000073681554,0.000003168113,0.99676955,0.0003524459,0.0024391315,0.00022792007,0.000003982741],"about_ca_topic_score_codex":0.009502516,"about_ca_topic_score_gemma":0.009122486,"teacher_disagreement_score":0.009502516,"about_ca_system_score_codex":0.00058939133,"about_ca_system_score_gemma":0.00083413866,"threshold_uncertainty_score":0.018894434},"labels":[],"label_agreement":null},{"id":"W4323647213","doi":"10.1007/978-3-031-25599-1_41","title":"Hybrid Human-AI Forecasting for Task Duration Estimation in Ship Refit","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Thales (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Task (project management); Artificial intelligence; Machine learning; Operations research; Estimation; Data mining; Mathematical optimization","score_opus":0.07070962900932702,"score_gpt":0.36523785853752827,"score_spread":0.29452822952820124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323647213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38139814,0.0021966975,0.6048705,0.000307713,0.00024059348,0.00007099173,0.0009939154,0.0031652285,0.006756236],"genre_scores_gemma":[0.9572821,0.0002851298,0.039112993,0.000051303763,0.00007920872,0.000040326544,0.0004175597,0.00005223373,0.0026791047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987435,0.000023097351,0.000007057225,0.000043670272,0.000025598938,0.00002624036],"domain_scores_gemma":[0.99942744,0.00036646085,0.0000403541,0.000028183043,0.00010406035,0.000033544373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004675582,0.0006043003,0.00061687984,0.0009726231,0.00029366554,0.0005627378,0.0005490656,0.00055179506,0.0019955216],"category_scores_gemma":[0.0013474213,0.00020704635,0.0003456802,0.0008961897,0.00009543011,0.0005576956,0.00030721453,0.0005263805,0.00071038667],"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.0006615694,0.00028573422,0.012908948,0.00014597704,0.00010679093,0.00013342033,0.00014320917,0.37138507,0.013931692,0.0006912042,0.0039131534,0.5956932],"study_design_scores_gemma":[0.000003388477,0.000035366636,0.0035341354,0.0000049676078,0.000011050694,0.000012745413,0.000014023512,0.99473345,0.0010246128,0.00035352292,0.00026628975,0.000006373469],"about_ca_topic_score_codex":0.018362498,"about_ca_topic_score_gemma":0.01928066,"teacher_disagreement_score":0.018362498,"about_ca_system_score_codex":0.0003235398,"about_ca_system_score_gemma":0.00041114338,"threshold_uncertainty_score":0.036511242},"labels":[],"label_agreement":null},{"id":"W4323647244","doi":"10.1007/978-3-031-25599-1_39","title":"Adapting to Complexity: Deep Learnable Architecture for Protein-protein Interaction Predictions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Overfitting; Computer science; Artificial intelligence; Machine learning; Network architecture; Process (computing); Deep learning; Artificial neural network","score_opus":0.0592930720187628,"score_gpt":0.31915482073505136,"score_spread":0.25986174871628853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323647244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094476625,0.0016313771,0.88993764,0.00097098295,0.0001924789,0.00007907353,0.0007646552,0.006286206,0.005660953],"genre_scores_gemma":[0.6766278,0.001094559,0.30907843,0.0006075388,0.00014968497,0.00018870269,0.0023959442,0.00043888376,0.009418319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.00003413624,0.000009316482,0.000053876767,0.00005566222,0.00003057106],"domain_scores_gemma":[0.999453,0.0003005093,0.00003503157,0.00007774784,0.00009508438,0.000038664188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742884,0.000787515,0.000692515,0.00041351354,0.00028162778,0.00071705703,0.0019423539,0.0009959699,0.002984283],"category_scores_gemma":[0.0016412985,0.0004937596,0.00075259723,0.0005144635,0.00046666322,0.0015909312,0.0012100172,0.0022898146,0.0009043309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001808474,0.00012937395,0.0010301196,0.000112568945,0.00008854448,0.00008514737,0.00005297301,0.6776678,0.007288731,0.015467201,0.009808654,0.28808808],"study_design_scores_gemma":[0.0000034864822,0.000011975009,0.000046869303,0.0000030365993,0.0000035639644,0.0000050781305,0.000002474935,0.99198496,0.00074071635,0.006855615,0.00033996577,0.0000021446024],"about_ca_topic_score_codex":0.007041649,"about_ca_topic_score_gemma":0.009036474,"teacher_disagreement_score":0.007041649,"about_ca_system_score_codex":0.0009336665,"about_ca_system_score_gemma":0.00079443894,"threshold_uncertainty_score":0.0140013695},"labels":[],"label_agreement":null},{"id":"W4323647344","doi":"10.1007/978-3-031-25599-1_11","title":"Explainable Machine Learning for Drug Shortage Prediction in a Pandemic Setting","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Université Laval; Thales (Canada)","funders":"","keywords":"Computer science; Supply chain; Task (project management); Economic shortage; Benchmark (surveying); Product (mathematics); Feature (linguistics); Operations research; Machine learning; Artificial intelligence; Schedule; Business; Engineering","score_opus":0.023296296595037673,"score_gpt":0.2637352871264486,"score_spread":0.24043899053141093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323647344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0915121,0.0032239277,0.89529395,0.004220406,0.0003445428,0.000056409226,0.0016303166,0.0009673853,0.0027508892],"genre_scores_gemma":[0.8687721,0.0013862608,0.12018747,0.00044055592,0.00055587717,0.00014354916,0.0023778642,0.0001280799,0.006008234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996057,0.00019863022,0.000021606587,0.000084866486,0.00004855593,0.000040737294],"domain_scores_gemma":[0.9954195,0.0039766016,0.00018046351,0.000213742,0.00014043714,0.00006929068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016968207,0.00069316244,0.0006594716,0.0005371622,0.0002869553,0.00065814145,0.001179406,0.0010409823,0.0030170225],"category_scores_gemma":[0.0067300717,0.00032389566,0.0006939996,0.00064294896,0.00041498017,0.0014167286,0.00092649425,0.0019700318,0.00030766797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021897256,0.00011274752,0.0077921795,0.00015742565,0.00015345847,0.00021311166,0.00018146333,0.79492444,0.0006750441,0.03498214,0.013315531,0.14727356],"study_design_scores_gemma":[0.0000070631586,0.000018743953,0.0005480785,0.000010359521,0.0000084402345,0.000014628869,0.000011157251,0.9723407,0.00010831375,0.026402362,0.000525536,0.000004547029],"about_ca_topic_score_codex":0.003932225,"about_ca_topic_score_gemma":0.004517174,"teacher_disagreement_score":0.003932225,"about_ca_system_score_codex":0.0008780642,"about_ca_system_score_gemma":0.000584101,"threshold_uncertainty_score":0.010092914},"labels":[],"label_agreement":null},{"id":"W4323780100","doi":"10.1007/978-3-031-28035-1_3","title":"#Receipts: A Case Study of the Sonja Ahlers Archive as Platform Feminism","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Traditional Archives Management","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of British Columbia","funders":"","keywords":"Computer science; Feminism; Function (biology); World Wide Web; Gender studies; Sociology","score_opus":0.049847266461593674,"score_gpt":0.2354682765420521,"score_spread":0.18562101008045842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323780100","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.7272419,0.0013057616,0.0025472166,0.009044552,0.00034259763,0.000099552424,0.00019516046,0.00009651971,0.25912666],"genre_scores_gemma":[0.89445615,0.0008002188,0.0016933137,0.0005488464,0.00008564026,0.00005349268,0.000074443655,0.00018852962,0.102099344],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9973079,0.0015829317,0.000067773115,0.00020573592,0.00046646883,0.00036915718],"domain_scores_gemma":[0.9968894,0.0019215451,0.0002487862,0.0003102129,0.00021876425,0.00041133116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029392121,0.00043469493,0.000400196,0.0016783623,0.021225777,0.00875697,0.0019918045,0.0029863962,0.017831886],"category_scores_gemma":[0.0058608083,0.0004374522,0.00028527415,0.0025469966,0.009332254,0.006042256,0.007279681,0.0031214294,0.0017553613],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111678266,0.0001827595,0.0034718162,0.00019655778,0.000008351049,0.01098043,0.8465545,0.000118776865,0.0011057794,0.08500894,0.013873344,0.03838698],"study_design_scores_gemma":[0.00000763271,0.000050925537,0.001703602,0.0001919276,0.000010551518,0.0026276032,0.81046534,0.00009967883,0.0008671078,0.0030456048,0.1809157,0.000014282031],"about_ca_topic_score_codex":0.01159768,"about_ca_topic_score_gemma":0.04324772,"teacher_disagreement_score":0.021225777,"about_ca_system_score_codex":0.0040943976,"about_ca_system_score_gemma":0.0033042324,"threshold_uncertainty_score":0.05965364},"labels":[],"label_agreement":null},{"id":"W4323780118","doi":"10.1007/978-3-031-28032-0_45","title":"The Rural Informatization Policies in China: The Power Dynamics and Policy Instruments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"China's Socioeconomic Reforms and Governance","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Informatization; China; Government (linguistics); Christian ministry; Power (physics); System dynamics; Policy analysis; Environmental economics; Rural area; Computer science; Public administration; Political science; Economics; Telecommunications","score_opus":0.006453846375701587,"score_gpt":0.2537186055279361,"score_spread":0.24726475915223453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323780118","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.85472554,0.0060668266,0.0042130384,0.015486756,0.00012813485,0.0001861569,0.0006151494,0.00013313285,0.118445195],"genre_scores_gemma":[0.9860534,0.0018237004,0.00094172853,0.00021831256,0.00004244846,0.000046409456,0.00013519161,0.000009000419,0.010729742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987239,0.00040348526,0.000073315976,0.00015134782,0.00032346553,0.0003244254],"domain_scores_gemma":[0.99861574,0.00051462784,0.00032351134,0.00008105504,0.00023956478,0.0002254595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023081792,0.0002809134,0.0001990766,0.0020858136,0.0021022144,0.0029823242,0.00048246808,0.00048918824,0.0027314837],"category_scores_gemma":[0.0025833666,0.00018370504,0.00014711061,0.0052990867,0.0026213052,0.0024580315,0.0013913249,0.0005792693,0.00017084427],"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.00018805597,0.00012785495,0.10933443,0.000984498,0.0000694086,0.00074207614,0.034881607,0.009041182,0.003522647,0.5675576,0.0179839,0.25556678],"study_design_scores_gemma":[0.00007131862,0.00019425052,0.5544515,0.0007615768,0.000086119755,0.00022720022,0.03193199,0.01858784,0.004156814,0.09291661,0.29649255,0.00012212964],"about_ca_topic_score_codex":0.042378534,"about_ca_topic_score_gemma":0.052124314,"teacher_disagreement_score":0.042378534,"about_ca_system_score_codex":0.012694212,"about_ca_system_score_gemma":0.015662752,"threshold_uncertainty_score":0.09210336},"labels":[],"label_agreement":null},{"id":"W4323780134","doi":"10.1007/978-3-031-28035-1_35","title":"From Noisy Data to Useful Color Palettes: One Step in Making Biodiversity Data FAIR","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Species Distribution and Climate Change","field":"Environmental 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":"Université de Montréal; University of Manitoba; University of Ottawa","funders":"National Science Foundation","keywords":"Color space; Palette (painting); Computer science; Artificial intelligence; Subtractive color; Color quantization; Color model; ICC profile; Color balance; Color depth; High color; Color histogram; Computer vision; Cluster analysis; Color image; Image processing; Art; Visual arts","score_opus":0.1421375338203875,"score_gpt":0.28830660704126465,"score_spread":0.14616907322087716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323780134","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.0049578766,0.0010131797,0.9610317,0.011043529,0.0014794393,0.000112662296,0.0010318621,0.0047116918,0.014618019],"genre_scores_gemma":[0.087389156,0.000990724,0.8899713,0.004187928,0.0011200611,0.00041639313,0.0011285003,0.0053778985,0.009417946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9854403,0.0063821636,0.00091795373,0.0016408049,0.0051702284,0.00044854716],"domain_scores_gemma":[0.914797,0.041972663,0.002161938,0.028253421,0.011416176,0.0013988531],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.026964903,0.00093538535,0.0018833249,0.0029626696,0.0029426923,0.013840916,0.0058600386,0.003976381,0.016421113],"category_scores_gemma":[0.13249817,0.0014922852,0.0013008968,0.0040287473,0.0077391695,0.03014771,0.009660079,0.0123717645,0.005261688],"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.00040732804,0.00019710542,0.0016589188,0.00035531918,0.0001524097,0.000107684944,0.0023176558,0.009499226,0.0033270996,0.5339676,0.08317426,0.36483526],"study_design_scores_gemma":[0.000045071232,0.000038606657,0.0003363746,0.00021821824,0.000039348437,0.000104676095,0.00051514583,0.024519803,0.0034877842,0.89597946,0.074650936,0.000064653985],"about_ca_topic_score_codex":0.0024170899,"about_ca_topic_score_gemma":0.003424069,"teacher_disagreement_score":0.99413997,"about_ca_system_score_codex":0.002309384,"about_ca_system_score_gemma":0.002466976,"threshold_uncertainty_score":0.14260572},"labels":[],"label_agreement":null},{"id":"W4323782439","doi":"10.1007/978-3-031-25891-6","title":"Machine Learning, Optimization, and Data Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Data Processing Techniques","field":"Engineering","cited_by":18,"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":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Leibniz-Gemeinschaft; University of Ioannina; Lobachevsky State University of Nizhny Novgorod; National Technical University of Athens; Institut Teknologi Bandung; Università di Pisa; RWTH Aachen University; Università degli Studi di Verona; Ural Federal University; Università di Bologna; University College Dublin; North-West University; Kungliga Tekniska Högskolan; Ulster University; Universidad de Granada; National and Kapodistrian University of Athens; Universite Angers; National Research University Higher School of Economics; Technische Universität Wien; Università di Catania; Universidade de Coimbra; Universität Passau; Arizona State University; Vysoká Škola Ekonomická v Praze; University of Crete; Università degli Studi di Udine; Queen Mary University of London; Università della Calabria; Università degli Studi di Padova; Leibniz-Rechenzentrum; University of Reading; York University; Universiteit Leiden; Jyväskylän Yliopisto; Polytechnique Montréal; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; McMaster University; University of Oxford; University of Alberta; Università degli Studi di Urbino Carlo Bo; University of Western Macedonia; Université de Lille; Università degli Studi di Parma; Queensland University of Technology; Chinese University of Hong Kong; Università Ca' Foscari Venezia; University of Minnesota; Centre National de la Recherche Scientifique; Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Università degli Studi di Cagliari; Universidade de Aveiro; Università degli Studi di Torino; Università degli Studi di Milano","keywords":"Computer science; Artificial intelligence","score_opus":0.01948159415808589,"score_gpt":0.27984060711202574,"score_spread":0.2603590129539399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323782439","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020102502,0.20828798,0.49933338,0.009061565,0.00781973,0.00014416562,0.0026033532,0.0028381415,0.26790145],"genre_scores_gemma":[0.027090508,0.12753136,0.27788836,0.0036999176,0.0076982155,0.0003561403,0.0040957113,0.0025624218,0.5490773],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993575,0.00008679554,0.000034631623,0.00011772365,0.0003821612,0.00002110884],"domain_scores_gemma":[0.9983815,0.0011120931,0.00006162451,0.00019170319,0.00019420745,0.000058843743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649171,0.0015236246,0.002290308,0.0018572094,0.0004381648,0.0033654447,0.001142652,0.0007995615,0.04283847],"category_scores_gemma":[0.0033427577,0.0007259228,0.00074691215,0.0051811407,0.0011092336,0.0034276359,0.0011361532,0.0031278266,0.026314767],"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.000051894658,0.000047919246,0.00022655915,0.0008160692,0.00006755957,0.00004630544,0.000052562034,0.006426725,0.0010617191,0.119017154,0.37797782,0.49420768],"study_design_scores_gemma":[0.00002024378,0.00004033385,0.0007147972,0.00031070376,0.000036108166,0.0002798934,0.000038200942,0.019763255,0.00073594693,0.3176436,0.660387,0.000029909383],"about_ca_topic_score_codex":0.0011017402,"about_ca_topic_score_gemma":0.0018428752,"teacher_disagreement_score":0.04283847,"about_ca_system_score_codex":0.00070802413,"about_ca_system_score_gemma":0.0009222061,"threshold_uncertainty_score":0.143309},"labels":[],"label_agreement":null},{"id":"W4323782875","doi":"10.1007/978-3-031-25891-6_23","title":"A Comparison of SVM Against Pre-trained Language Models (PLMs) for Text Classification Tasks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Western University","funders":"","keywords":"Computer science; Support vector machine; Artificial intelligence; Classifier (UML); Machine learning; Feature engineering; Natural language processing; Task (project management); Feature (linguistics); Linear classifier; Pattern recognition (psychology); Deep learning","score_opus":0.06515733099742363,"score_gpt":0.3215682359011537,"score_spread":0.2564109049037301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323782875","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.56813174,0.030056156,0.3494113,0.0016890262,0.0039743385,0.00043127587,0.0055118115,0.02691539,0.013879031],"genre_scores_gemma":[0.8318294,0.0033636838,0.13550776,0.00041536425,0.0005011343,0.00023339487,0.014141508,0.00087192125,0.013135683],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981267,0.00072597555,0.00018842635,0.00039384555,0.0004135226,0.00015154046],"domain_scores_gemma":[0.99286807,0.004679858,0.00015329548,0.0004887365,0.0015647908,0.00024532177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037584887,0.0014091013,0.0013504319,0.0013213841,0.0005464577,0.0015070065,0.0012568759,0.0014097193,0.003510776],"category_scores_gemma":[0.0073814895,0.00027708412,0.00076385075,0.0012572836,0.00020465672,0.0022804055,0.0009397625,0.0016190683,0.0030509327],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004330931,0.00072468776,0.004748824,0.00057196897,0.00054663554,0.00012140097,0.00010366254,0.040098608,0.011883518,0.0007040433,0.020515976,0.91564983],"study_design_scores_gemma":[0.00013533865,0.0011493017,0.0049699266,0.00005897618,0.00018390192,0.00014196671,0.0001600586,0.97776216,0.010369652,0.0013912262,0.0036472727,0.000030148896],"about_ca_topic_score_codex":0.005590548,"about_ca_topic_score_gemma":0.0050890367,"teacher_disagreement_score":0.005590548,"about_ca_system_score_codex":0.00082346925,"about_ca_system_score_gemma":0.00088857504,"threshold_uncertainty_score":0.019877017},"labels":[],"label_agreement":null},{"id":"W4323784369","doi":"10.1007/978-3-031-25891-6_40","title":"Brain Structural Saliency over the Ages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Ageing; Relevance (law); Neuroimaging; Computer science; Artificial intelligence; Neuroscience; Human brain; Clinical significance; Aging brain; Psychology; Cognition; Medicine; Pathology; Internal medicine","score_opus":0.034476465958132266,"score_gpt":0.27301078082049984,"score_spread":0.2385343148623676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323784369","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.4643501,0.07101441,0.032721598,0.009145641,0.0010972617,0.00002391402,0.0035621105,0.000469812,0.41761518],"genre_scores_gemma":[0.92750865,0.016392339,0.0060818787,0.00023003963,0.00084877043,0.000014663788,0.0005674124,0.00013946023,0.04821678],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9999627,0.0000041915905,0.0000013153235,0.000015472655,0.0000117567615,0.000004544213],"domain_scores_gemma":[0.9996383,0.00019074706,0.00006055068,0.000023779585,0.00005343115,0.0000332284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020147908,0.00021329697,0.00014590778,0.0006939344,0.00014196799,0.0006328467,0.00018602202,0.00029166884,0.010706897],"category_scores_gemma":[0.0016962448,0.00017979469,0.00015212626,0.0009761016,0.00031766167,0.0011222627,0.00024259686,0.00037920036,0.0008031019],"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.00038647946,0.000046923607,0.020825367,0.00052725273,0.00011283377,0.00053299643,0.0019434374,0.0067043756,0.029014932,0.1880425,0.04411181,0.707751],"study_design_scores_gemma":[0.000021629821,0.00026445958,0.3885497,0.00018691465,0.0001441491,0.0030692846,0.00093921757,0.009747269,0.0071258815,0.45628053,0.1336239,0.000047051122],"about_ca_topic_score_codex":0.0011427852,"about_ca_topic_score_gemma":0.0026181005,"teacher_disagreement_score":0.010706897,"about_ca_system_score_codex":0.0004104993,"about_ca_system_score_gemma":0.00012624252,"threshold_uncertainty_score":0.03581816},"labels":[],"label_agreement":null},{"id":"W4324009296","doi":"10.1007/978-3-031-27051-2_3","title":"Minimum Ply Covering of Points with Unit Squares","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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; University of Manitoba","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Intersection (aeronautics); Set cover problem; Approximation algorithm; Polynomial; Unit (ring theory); Time complexity; Plane (geometry); Set (abstract data type); Constant (computer programming); Square (algebra); Euclidean geometry; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.02263665253275696,"score_gpt":0.24667151914694765,"score_spread":0.2240348666141907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324009296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28166756,0.001464046,0.6650134,0.00033314273,0.00015317922,0.000096558266,0.00074728037,0.00096529967,0.049559627],"genre_scores_gemma":[0.7129461,0.00090259215,0.25734457,0.00007930228,0.00008527152,0.00015999499,0.0010653539,0.0006422183,0.026774572],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.000106346066,0.000023473238,0.000060012855,0.00017362944,0.00006247221],"domain_scores_gemma":[0.9992902,0.00033754305,0.00006169448,0.00017564667,0.000077747485,0.000057003297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025673362,0.00079643045,0.0013395911,0.0008347645,0.00054867245,0.0009945291,0.001204314,0.0008336588,0.006909307],"category_scores_gemma":[0.0026086892,0.0006000503,0.0005642032,0.0010641043,0.00064139557,0.0012500653,0.0023820559,0.0011044724,0.0011216518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012591999,0.00014030494,0.002228326,0.0010669802,0.00012156968,0.0004172561,0.0005463892,0.27565792,0.062180318,0.21046843,0.017256187,0.4286571],"study_design_scores_gemma":[0.00009137478,0.00051578006,0.0029315301,0.00010712891,0.00005008496,0.00091903115,0.00025577442,0.714122,0.029230772,0.22995053,0.021787278,0.000038763385],"about_ca_topic_score_codex":0.0007420728,"about_ca_topic_score_gemma":0.00065318216,"teacher_disagreement_score":0.006909307,"about_ca_system_score_codex":0.00039180118,"about_ca_system_score_gemma":0.0002133482,"threshold_uncertainty_score":0.023113966},"labels":[],"label_agreement":null},{"id":"W4324011378","doi":"10.1007/978-3-031-27051-2_9","title":"Improved and Generalized Algorithms for Burning a Planar Point Set","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Dimension (graph theory); Point (geometry); Integer (computer science); Set (abstract data type); Process (computing); Mathematics; Planar; Computer science; Discrete mathematics; Algorithm; Geometry; Computer graphics (images)","score_opus":0.032431223475990166,"score_gpt":0.27442082206658397,"score_spread":0.2419895985905938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324011378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055365185,0.00021251594,0.9873772,0.000073218216,0.00016979966,0.00007506598,0.00008180602,0.000809353,0.0056645675],"genre_scores_gemma":[0.03229214,0.00022212994,0.95491374,0.000063123094,0.00005102235,0.00014685812,0.00021882466,0.00049429596,0.011597858],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.00012787113,0.000054340824,0.00019912604,0.0004773133,0.00008923277],"domain_scores_gemma":[0.99913895,0.0002269736,0.000039787745,0.00033892423,0.00021183865,0.000043400007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007488899,0.001460977,0.0016110957,0.0013728589,0.00084480335,0.0013581442,0.0038415617,0.0015229572,0.016548652],"category_scores_gemma":[0.002548184,0.0008494221,0.0019836305,0.0018979487,0.0014384422,0.0023059675,0.0038166072,0.002946845,0.0027962814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003151979,0.00014681461,0.00048246572,0.0004901649,0.0001031629,0.0001400581,0.00028794183,0.21754692,0.020120194,0.17355026,0.0108956285,0.5759211],"study_design_scores_gemma":[0.0000754409,0.00008871959,0.00037265528,0.000042001157,0.000054366905,0.00023303185,0.000082864615,0.86992836,0.0063980687,0.10351672,0.019154714,0.000053038006],"about_ca_topic_score_codex":0.0028610427,"about_ca_topic_score_gemma":0.0061268215,"teacher_disagreement_score":0.016548652,"about_ca_system_score_codex":0.0010445312,"about_ca_system_score_gemma":0.001014351,"threshold_uncertainty_score":0.055360794},"labels":[],"label_agreement":null},{"id":"W4324121721","doi":"10.1007/978-3-031-27324-7","title":"Lesion Segmentation in Surgical and Diagnostic Applications","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Computer vision","score_opus":0.01371909370450642,"score_gpt":0.31025898794153856,"score_spread":0.29653989423703214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324121721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006850671,0.065017805,0.8402272,0.00085772533,0.0013031532,0.00010343566,0.0008302366,0.004881554,0.07992821],"genre_scores_gemma":[0.08105911,0.06343336,0.5628099,0.00088160083,0.0014794283,0.00012549562,0.0022909178,0.001976091,0.28594407],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980634,0.000019915542,0.000012400302,0.000048182956,0.00009525589,0.000017994527],"domain_scores_gemma":[0.9996606,0.00016863215,0.000021584912,0.00003523343,0.00009303883,0.00002092371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031494437,0.00089650566,0.00091099436,0.0018618637,0.00022359622,0.0012376556,0.0009382734,0.001013967,0.022310475],"category_scores_gemma":[0.0007341814,0.0005229491,0.0005586993,0.0024829106,0.00048097552,0.0012639757,0.0007481545,0.00065484387,0.014205249],"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.000059704504,0.000022038945,0.00018667722,0.00062602997,0.000019965708,0.0001432339,0.00005512125,0.004528546,0.02584356,0.009059342,0.03662477,0.92283106],"study_design_scores_gemma":[0.000017602495,0.0002383607,0.0035018183,0.0005483674,0.00013187666,0.004996998,0.00016609738,0.09185003,0.07039557,0.06703067,0.76103556,0.00008698287],"about_ca_topic_score_codex":0.00060415635,"about_ca_topic_score_gemma":0.0012868324,"teacher_disagreement_score":0.022310475,"about_ca_system_score_codex":0.00031456118,"about_ca_system_score_gemma":0.00034117416,"threshold_uncertainty_score":0.07463592},"labels":[],"label_agreement":null},{"id":"W4324121743","doi":"10.1007/978-3-031-27324-7_9","title":"Segmentation of Intraoperative 3D Ultrasound Images Using a Pyramidal Blur-Pooled 2D U-Net","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"3D ultrasound; Computer science; Artificial intelligence; Coronal plane; Segmentation; Computer vision; Sagittal plane; Ultrasound; Slicing; Resection; Medicine; Radiology; Computer graphics (images); Surgery","score_opus":0.02261612445414831,"score_gpt":0.2933212259432114,"score_spread":0.2707051014890631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324121743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013691341,0.00029183854,0.9833809,0.000058709255,0.00003509229,0.000074735144,0.00011836704,0.0012574135,0.0010915714],"genre_scores_gemma":[0.06475101,0.00023927413,0.93293715,0.000053285556,0.000030432564,0.000054569013,0.00018761044,0.00022164363,0.001525054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.000042163658,0.000032023538,0.00008061388,0.00013610776,0.000046764202],"domain_scores_gemma":[0.99968886,0.0000856625,0.000034849778,0.00007122085,0.0000908437,0.00002867173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064391113,0.0008693239,0.00089600263,0.0014796301,0.0004926433,0.0014578834,0.0010061724,0.001364655,0.0029426978],"category_scores_gemma":[0.00091660884,0.000843663,0.0010310689,0.0012946042,0.00033251868,0.0010411821,0.001391692,0.00058601284,0.0012320816],"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.0005941971,0.00010630602,0.001734188,0.0004273352,0.00011460074,0.00037059924,0.0002635107,0.061788134,0.19151522,0.004424751,0.003394014,0.73526716],"study_design_scores_gemma":[0.000025598774,0.00024365413,0.0024431904,0.00006061856,0.00009590952,0.0010519627,0.00006677199,0.9025959,0.084207214,0.0031347407,0.0060077463,0.00006676779],"about_ca_topic_score_codex":0.0025633117,"about_ca_topic_score_gemma":0.005111209,"teacher_disagreement_score":0.0029426978,"about_ca_system_score_codex":0.0004991526,"about_ca_system_score_gemma":0.0012736699,"threshold_uncertainty_score":0.009844363},"labels":[],"label_agreement":null},{"id":"W4327498252","doi":"10.1007/978-3-031-28241-6_25","title":"Enticing Local Governments to Produce FAIR Freedom of Information Act Dossiers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Research Data Management Practices","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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Universiteit van Amsterdam; Canadian Institute of Steel Construction","keywords":"Publication; Freedom of information; Transparency (behavior); Computer science; Democracy; Government (linguistics); Open government; Internet privacy; World Wide Web; Political science; Law; Computer security","score_opus":0.03510899761455672,"score_gpt":0.2977710034930754,"score_spread":0.2626620058785187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327498252","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13472986,0.0004579669,0.063275866,0.027719045,0.00030375028,0.0004971848,0.00012144757,0.0006780879,0.77221674],"genre_scores_gemma":[0.93071306,0.00013328694,0.00881381,0.0018610166,0.00009711648,0.0001836133,0.0000398123,0.00009166147,0.058066554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98064315,0.008879459,0.0004172248,0.0013167212,0.0047949813,0.0039484766],"domain_scores_gemma":[0.9503619,0.035744112,0.0022700583,0.006685565,0.0029354792,0.002002918],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.023351965,0.0005010878,0.00077385304,0.0019599781,0.0051460224,0.013430662,0.0021643518,0.006802385,0.027359128],"category_scores_gemma":[0.060719397,0.0007372698,0.00069577695,0.002180075,0.006738339,0.008874056,0.010179651,0.0073215025,0.0032140424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012515609,0.00023855508,0.0018354756,0.000046027904,0.000023023227,0.0001960832,0.0024049077,0.0069141523,0.00076586497,0.9391172,0.0107396385,0.03759384],"study_design_scores_gemma":[0.00032853906,0.00024394236,0.003949551,0.00026560904,0.00009340904,0.00020434054,0.008717345,0.03788388,0.0036188806,0.80444205,0.1401465,0.000105962354],"about_ca_topic_score_codex":0.0075499234,"about_ca_topic_score_gemma":0.02030469,"teacher_disagreement_score":0.99783564,"about_ca_system_score_codex":0.008097839,"about_ca_system_score_gemma":0.014164201,"threshold_uncertainty_score":0.1234985},"labels":[],"label_agreement":null},{"id":"W4327498258","doi":"10.1007/978-3-031-28241-6_38","title":"Uncertainty Quantification for Text Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Uncertainty quantification; Artificial intelligence; Robustness (evolution); Machine learning; Scalability; Generalization; Context (archaeology); Dropout (neural networks); Bayesian probability; Ensemble learning; Deep learning; Data mining; Mathematics; Database","score_opus":0.07459716417679207,"score_gpt":0.2958613792212944,"score_spread":0.22126421504450233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327498258","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.0031205702,0.0045636515,0.9871568,0.00066037435,0.00016078439,0.000048496055,0.00036128354,0.000497543,0.0034303826],"genre_scores_gemma":[0.36100456,0.007505343,0.60341537,0.0008412558,0.0020560657,0.0006913953,0.0035986209,0.0007250349,0.020162422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963659,0.0012533254,0.00029405183,0.00060974114,0.0012786643,0.00019823376],"domain_scores_gemma":[0.9920993,0.0059487615,0.00040199142,0.0007092522,0.0006818978,0.00015884754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042707054,0.0011615411,0.001959741,0.003469139,0.0010571807,0.003400495,0.0020790643,0.0016439039,0.0050652656],"category_scores_gemma":[0.0147172,0.0007424428,0.001962192,0.003397552,0.0017446473,0.0064561847,0.0030594696,0.0036257005,0.0015158982],"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.00014864476,0.00008301225,0.00060441735,0.0006761404,0.0001880055,0.00009359489,0.00028726476,0.08934406,0.003339403,0.33291793,0.023475075,0.5488425],"study_design_scores_gemma":[0.0000059318395,0.000029591898,0.00037779394,0.00010421486,0.000032442556,0.000053942967,0.000046541893,0.45327282,0.0013542145,0.53863144,0.0060622883,0.000028767248],"about_ca_topic_score_codex":0.0025696848,"about_ca_topic_score_gemma":0.001788627,"teacher_disagreement_score":0.0050652656,"about_ca_system_score_codex":0.0023426283,"about_ca_system_score_gemma":0.0010064524,"threshold_uncertainty_score":0.022585928},"labels":[],"label_agreement":null},{"id":"W4327498763","doi":"10.1007/978-3-031-28241-6_10","title":"PyGaggle: A Gaggle of Resources for Open-Domain Question Answering","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Question answering; Codebase; Information retrieval; Open domain; Artificial intelligence; Context (archaeology); Domain (mathematical analysis); Machine learning; Programming language; Source code","score_opus":0.03306528010206973,"score_gpt":0.2818557621392487,"score_spread":0.24879048203717896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327498763","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.0032488003,0.0011623183,0.6911969,0.0011653317,0.0003139036,0.00040258368,0.009684407,0.26894546,0.023880303],"genre_scores_gemma":[0.07584271,0.0017327073,0.7821374,0.0016878551,0.0002553659,0.0014279963,0.047889676,0.05307853,0.035947736],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980233,0.0007186595,0.00016379812,0.0004096519,0.00051701046,0.00016760669],"domain_scores_gemma":[0.99576,0.002458624,0.00008533421,0.0011248395,0.00027197634,0.00029926133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022769393,0.0017831459,0.0014903516,0.0032052533,0.0011802056,0.003967965,0.0032118917,0.0021796622,0.05273448],"category_scores_gemma":[0.010810399,0.0015301076,0.001966507,0.0031180247,0.0014474557,0.0092970645,0.0100217,0.003685567,0.037805483],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086990517,0.00019075794,0.00083295815,0.0011859392,0.000106604704,0.00043337152,0.0015412646,0.0049531893,0.007441981,0.07591446,0.46715838,0.4393712],"study_design_scores_gemma":[0.00019066726,0.00007567026,0.0004490098,0.0003555683,0.0000701217,0.0004976166,0.00051012775,0.050533302,0.011503331,0.19405146,0.7416366,0.00012658552],"about_ca_topic_score_codex":0.0038382025,"about_ca_topic_score_gemma":0.0053593875,"teacher_disagreement_score":0.05273448,"about_ca_system_score_codex":0.0010685745,"about_ca_system_score_gemma":0.0016662206,"threshold_uncertainty_score":0.17641443},"labels":[],"label_agreement":null},{"id":"W4327498768","doi":"10.1007/978-3-031-28241-6_11","title":"Pre-processing Matters! Improved Wikipedia Corpora for Open-Domain Question Answering","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Question answering; Natural language processing; Information retrieval; Domain (mathematical analysis); Landmark; Artificial intelligence; Text corpus; Open domain; Pipeline (software)","score_opus":0.028800474068406422,"score_gpt":0.27818040762012664,"score_spread":0.24937993355172022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327498768","genre_codex":"dataset","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.089596,0.0074307043,0.31039405,0.004558771,0.005320698,0.001732398,0.40187454,0.11182419,0.06726865],"genre_scores_gemma":[0.08103187,0.001245496,0.24851751,0.00053502765,0.0007862792,0.0012432489,0.6391909,0.007877875,0.019571815],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99730116,0.00084959227,0.00030739838,0.00073998776,0.0006245174,0.00017730014],"domain_scores_gemma":[0.98304224,0.006757754,0.00046446844,0.0029644023,0.006096799,0.00067437097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026105212,0.001449152,0.0012388504,0.005171527,0.0017116137,0.0028695113,0.0016759951,0.0012776356,0.028227212],"category_scores_gemma":[0.017618349,0.0010528989,0.001060559,0.0042210277,0.00056884886,0.0051614936,0.0031876825,0.0028654863,0.028439747],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040080826,0.0004847806,0.0027938425,0.0022279203,0.00018267732,0.00040079473,0.0010552914,0.0029580353,0.028920325,0.0067014983,0.63796824,0.31590578],"study_design_scores_gemma":[0.00026654816,0.00023631868,0.012168809,0.0005128859,0.00031810344,0.00072266633,0.0016059817,0.05759106,0.05819633,0.017771108,0.85037506,0.00023521132],"about_ca_topic_score_codex":0.006529718,"about_ca_topic_score_gemma":0.014808228,"teacher_disagreement_score":0.028227212,"about_ca_system_score_codex":0.00064519007,"about_ca_system_score_gemma":0.002021072,"threshold_uncertainty_score":0.09442943},"labels":[],"label_agreement":null},{"id":"W4327499166","doi":"10.1007/978-3-031-28241-6_32","title":"Understanding and Mitigating Gender Bias in Information Retrieval Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Relevance (law); Judgement; Artificial intelligence; Natural language processing; Machine learning; Gender bias; Information retrieval; Psychology; Social psychology","score_opus":0.14747431891481882,"score_gpt":0.286645160080379,"score_spread":0.13917084116556017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327499166","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.8051119,0.0045623733,0.101742096,0.010024246,0.00034255988,0.00013590907,0.00055361487,0.00034967324,0.07717768],"genre_scores_gemma":[0.98695314,0.0004500243,0.009215781,0.0005053505,0.00015861634,0.000023425717,0.00009585784,0.00007247414,0.0025254216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583733,0.002429784,0.00018263345,0.00042740963,0.0008286172,0.00029432354],"domain_scores_gemma":[0.96906036,0.023403564,0.002784818,0.0022264312,0.0020813895,0.00044338638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008613907,0.000329099,0.00043921534,0.0008418414,0.0007935608,0.002234422,0.0006367857,0.000792473,0.0058268947],"category_scores_gemma":[0.052188095,0.00031610343,0.00024034434,0.0008858535,0.0016190868,0.0050425404,0.0014839331,0.0009758008,0.0008194599],"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.0016661977,0.00045017805,0.17006838,0.0008206252,0.00018145023,0.00044281382,0.014563406,0.00638443,0.029659819,0.23904034,0.011483273,0.52523905],"study_design_scores_gemma":[0.00020535666,0.0008312682,0.18617117,0.00047722767,0.0003710749,0.0008948429,0.015276195,0.07292226,0.024455266,0.649614,0.048609335,0.00017207072],"about_ca_topic_score_codex":0.00343913,"about_ca_topic_score_gemma":0.0041446295,"teacher_disagreement_score":0.008613907,"about_ca_system_score_codex":0.0010499686,"about_ca_system_score_gemma":0.0013501709,"threshold_uncertainty_score":0.045555174},"labels":[],"label_agreement":null},{"id":"W4327499178","doi":"10.1007/978-3-031-28241-6","title":"Advances in Information Retrieval","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":25,"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":"Leibniz-Gemeinschaft; University of Massachusetts Amherst; City, University of London; National Institute of Standards and Technology; La Rochelle Université; National Institute of Informatics; Indian Institute of Science Education and Research Mohali; University of Chinese Academy of Sciences; National Institute of Technology Hamirpur; Université de Lyon; Masarykova Univerzita; Ural Federal University; Université de Nantes; Stockholms Universitet; Institut National des Sciences Appliquées de Lyon; Universität Duisburg-Essen; Università di Pisa; Technische Universität Berlin; Bauhaus-Universität Weimar; Universidad de Granada; Università di Bologna; Universität Regensburg; Universitetet i Bergen; University of Windsor; Technische Universität Wien; Radboud Universiteit; University of Waterloo; Commonwealth Scientific and Industrial Research Organisation; Orta Doğu Teknik Üniversitesi; Instituto Superior Técnico; Université de Bretagne Occidentale; Tsinghua University; Chinese Academy of Sciences; Birkbeck, University of London; Universidade de Lisboa; Renmin University of China; Universität Innsbruck; Technische Universiteit Delft; Région Normandie; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Universiteit Utrecht; RMIT University; Haute école Spécialisée de Suisse Occidentale; University of Southampton; Universidade da Coruña; Istituto di Scienza e Tecnologie dell'Informazione; Universidad Nacional de Educación a Distancia; Universiteit Leiden; York University; University of Glasgow; Universität Passau; Universidade do Porto; Dublin City University; Politecnico di Torino; Friedrich-Schiller-Universität Jena; Universitetet i Stavanger; University of Regina; Université Grenoble Alpes; University of Southern Maine; Centre National de la Recherche Scientifique; University of Roehampton; Norges Teknisk-Naturvitenskapelige Universitet; Sun Yat-sen University; Universiteit van Amsterdam; Universidade de Santiago de Compostela; Università degli Studi di Cagliari; Aix-Marseille Université; University of Wolverhampton; Universidade Federal de Minas Gerais; Chinese University of Hong Kong; Aalborg Universitet; Kaiser Permanente; Indian Institute of Technology Kharagpur; Indian Institute of Science; Qatar University; Universidad Autónoma de Madrid; University of Tsukuba; Georgetown University; Universitatea din București; Università degli Studi di Padova; Zürcher Hochschule für Angewandte Wissenschaften; Johns Hopkins University; Indian National Science Academy","keywords":"Computer science; Information retrieval; State (computer science); Artificial intelligence; Programming language","score_opus":0.012864160102574714,"score_gpt":0.2606042818289115,"score_spread":0.24774012172633678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327499178","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020548995,0.6013346,0.077063866,0.00759361,0.01659062,0.0001556802,0.0009657664,0.003014821,0.29122618],"genre_scores_gemma":[0.015498421,0.28447187,0.06282778,0.003391319,0.011766665,0.00014583564,0.002168096,0.0009496012,0.61878043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986004,0.00018051299,0.00009716572,0.00019552911,0.00084009895,0.00008629448],"domain_scores_gemma":[0.9984585,0.00052281434,0.00007426822,0.00032452238,0.0005075905,0.000112209906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016865669,0.0015837514,0.002260586,0.005485951,0.0008260285,0.0046120123,0.0015501849,0.0014542498,0.055534817],"category_scores_gemma":[0.0032750645,0.00067340134,0.00070831197,0.008301434,0.0012261278,0.007467553,0.0018694123,0.0025352293,0.07511046],"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.000026729982,0.000049129983,0.00009760056,0.0009403209,0.00003138429,0.000033220287,0.00007417409,0.0003066723,0.001841202,0.04002342,0.31894687,0.6376292],"study_design_scores_gemma":[0.0000075401254,0.000041000636,0.00031493366,0.00027545632,0.000028259901,0.00025625373,0.000040540206,0.001160666,0.0010295442,0.028041288,0.96878886,0.00001566541],"about_ca_topic_score_codex":0.00094272423,"about_ca_topic_score_gemma":0.0015701798,"teacher_disagreement_score":0.055534817,"about_ca_system_score_codex":0.0011737635,"about_ca_system_score_gemma":0.0012884352,"threshold_uncertainty_score":0.18578243},"labels":[],"label_agreement":null},{"id":"W4327499364","doi":"10.1007/978-3-031-28241-6_35","title":"Deep Learning Methods for Query Auto Completion","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Microsoft (Canada)","funders":"","keywords":"Computer science; Spell; Offensive; Ranking (information retrieval); Personalization; Web search query; Block (permutation group theory); Information retrieval; Artificial intelligence; Gateway (web page); World Wide Web; Search engine; Operations research","score_opus":0.04838016294891931,"score_gpt":0.33528445294508835,"score_spread":0.286904289996169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327499364","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.0043652267,0.0019516015,0.9896798,0.00028150174,0.00011974415,0.00003772937,0.00024638514,0.0015659663,0.0017521089],"genre_scores_gemma":[0.23292923,0.0034947277,0.71754026,0.0005047736,0.00048506606,0.00023585353,0.0028661652,0.0007891989,0.041154705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994373,0.0001398784,0.00003823027,0.00013263011,0.00017338229,0.00007859168],"domain_scores_gemma":[0.9986533,0.0006416086,0.00005424216,0.00034301865,0.00025832315,0.000049426963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011833366,0.0009945139,0.0014961838,0.00071751466,0.0003777499,0.0010064744,0.0021688403,0.0012471296,0.009762648],"category_scores_gemma":[0.0037668666,0.00073024863,0.00078274624,0.0013276468,0.0005538595,0.002313665,0.0016069822,0.002919523,0.0031280273],"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.00014293274,0.00017977484,0.00047856863,0.00019780683,0.00008564714,0.0000435877,0.00007070072,0.14815915,0.004184339,0.02452518,0.027285611,0.7946467],"study_design_scores_gemma":[0.000007713024,0.000018233803,0.00009803459,0.000011539862,0.000010133156,0.0000174397,0.000008370581,0.98350465,0.001061322,0.012648613,0.0026075987,0.0000064423534],"about_ca_topic_score_codex":0.011778914,"about_ca_topic_score_gemma":0.015363321,"teacher_disagreement_score":0.011778914,"about_ca_system_score_codex":0.00087093114,"about_ca_system_score_gemma":0.0011783459,"threshold_uncertainty_score":0.032659292},"labels":[],"label_agreement":null},{"id":"W4327644040","doi":"10.1007/978-3-031-28238-6","title":"Advances in Information Retrieval","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":5,"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":"Zürcher Hochschule für Angewandte Wissenschaften; Leibniz-Gemeinschaft; National Institute of Standards and Technology; La Rochelle Université; Université de Caen Normandie; National Institute of Informatics; Indian Institute of Science Education and Research Mohali; University of Chinese Academy of Sciences; National Institute of Technology Hamirpur; Université de Lyon; Masarykova Univerzita; Universität Konstanz; Ural Federal University; Université de Nantes; Stockholms Universitet; Universität Leipzig; Universität Duisburg-Essen; Università degli Studi di Udine; Università di Pisa; Universidade Federal de Minas Gerais; University of Cape Town; Tsinghua University; Chinese Academy of Sciences; Université de Bretagne Occidentale; Georgetown University; University of Tsukuba; Technion-Israel Institute of Technology; Università di Bologna; Universitetet i Bergen; University of Windsor; Technische Universität Wien; Radboud Universiteit; University of Waterloo; Commonwealth Scientific and Industrial Research Organisation; Orta Doğu Teknik Üniversitesi; Universitatea din București; Università degli Studi di Padova; Universidad de Granada; Universität Innsbruck; Technische Universiteit Delft; Université de Neuchâtel; Région Normandie; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Universiteit Utrecht; National Institute of Advanced Industrial Science and Technology; RMIT University; Universidade da Coruña; Universidad Nacional de Educación a Distancia; University of Glasgow; York University; Universiteit Leiden; University of Regina; Université Grenoble Alpes; Universitetet i Stavanger; Universität Passau; Centre National de la Recherche Scientifique; Aix-Marseille Université; University of Wolverhampton; Universidade de Santiago de Compostela; Università degli Studi di Cagliari; Universidade do Porto; Dublin City University; Politecnico di Torino; Friedrich-Schiller-Universität Jena; Norges Teknisk-Naturvitenskapelige Universitet; Universiteit van Amsterdam; Qatar University; Universidad Autónoma de Madrid; Renmin University of China; University of Otago; Aalborg Universitet; Kaiser Permanente; Indian Institute of Technology Kharagpur; Indian Institute of Science; Sorbonne Université; Accenture","keywords":"Computer science; Information retrieval; State (computer science); Human–computer information retrieval; Artificial intelligence; Search engine; Programming language","score_opus":0.012864160102574714,"score_gpt":0.2606042818289115,"score_spread":0.24774012172633678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644040","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020548995,0.6013346,0.077063866,0.00759361,0.01659062,0.0001556802,0.0009657664,0.003014821,0.29122618],"genre_scores_gemma":[0.015498421,0.28447187,0.06282778,0.003391319,0.011766665,0.00014583564,0.002168096,0.0009496012,0.61878043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986004,0.00018051299,0.00009716572,0.00019552911,0.00084009895,0.00008629448],"domain_scores_gemma":[0.9984585,0.00052281434,0.00007426822,0.00032452238,0.0005075905,0.000112209906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016865669,0.0015837514,0.002260586,0.005485951,0.0008260285,0.0046120123,0.0015501849,0.0014542498,0.055534817],"category_scores_gemma":[0.0032750645,0.00067340134,0.00070831197,0.008301434,0.0012261278,0.007467553,0.0018694123,0.0025352293,0.07511046],"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.000026729982,0.000049129983,0.00009760056,0.0009403209,0.00003138429,0.000033220287,0.00007417409,0.0003066723,0.001841202,0.04002342,0.31894687,0.6376292],"study_design_scores_gemma":[0.0000075401254,0.000041000636,0.00031493366,0.00027545632,0.000028259901,0.00025625373,0.000040540206,0.001160666,0.0010295442,0.028041288,0.96878886,0.00001566541],"about_ca_topic_score_codex":0.00094272423,"about_ca_topic_score_gemma":0.0015701798,"teacher_disagreement_score":0.055534817,"about_ca_system_score_codex":0.0011737635,"about_ca_system_score_gemma":0.0012884352,"threshold_uncertainty_score":0.18578243},"labels":[],"label_agreement":null},{"id":"W4327644054","doi":"10.1007/978-3-031-28238-6_28","title":"Adversarial Adaptation for French Named Entity Recognition","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Overfitting; Domain adaptation; Transformer; Named-entity recognition; Artificial intelligence; Adversarial system; Natural language processing; Machine learning; Task (project management); Adaptation (eye); Language model; Artificial neural network; Classifier (UML)","score_opus":0.05240344038885753,"score_gpt":0.25863514913071334,"score_spread":0.2062317087418558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010104534,0.001816216,0.9748955,0.0005264513,0.00037836717,0.000055280398,0.00073179515,0.0072401725,0.0042517805],"genre_scores_gemma":[0.47133166,0.0025769244,0.46157762,0.0008601454,0.00063798414,0.00032796114,0.009972571,0.002138801,0.05057635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989561,0.00045446248,0.000042197888,0.0002868184,0.00014091983,0.000119578755],"domain_scores_gemma":[0.9987514,0.0007504355,0.00004436719,0.00024494354,0.00017540838,0.000033417688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018025477,0.0014030902,0.0010552071,0.0008463923,0.0006083475,0.0011680311,0.0016502214,0.0014791031,0.0056023593],"category_scores_gemma":[0.0030680439,0.00059169,0.0012760406,0.001277907,0.0005596333,0.0015340457,0.0017681909,0.0022620654,0.0050588027],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028668586,0.000084235784,0.00057419145,0.00012989709,0.00018662345,0.0002177021,0.00009949189,0.33153072,0.008156288,0.014396293,0.038198866,0.606139],"study_design_scores_gemma":[0.0000063454304,0.000021755068,0.00027886298,0.000013912798,0.000019464533,0.00006198642,0.000016080685,0.9849902,0.0036649855,0.006091805,0.004820428,0.000014105179],"about_ca_topic_score_codex":0.012543697,"about_ca_topic_score_gemma":0.012595857,"teacher_disagreement_score":0.012543697,"about_ca_system_score_codex":0.00094876275,"about_ca_system_score_gemma":0.0006159058,"threshold_uncertainty_score":0.024941385},"labels":[],"label_agreement":null},{"id":"W4327644059","doi":"10.1007/978-3-031-28238-6_7","title":"Improving the Generalizability of the Dense Passage Retriever Using Generated Datasets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Overfitting; Generalizability theory; Domain (mathematical analysis); Context (archaeology); Artificial intelligence; Information retrieval; Focus (optics); Encoder; Labrador Retriever; Training set; Data mining; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.042814254776952124,"score_gpt":0.25934468536600996,"score_spread":0.21653043058905785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30840647,0.008775915,0.45545334,0.0024160976,0.0017385742,0.001316998,0.045695644,0.16273496,0.013462038],"genre_scores_gemma":[0.47293293,0.002288706,0.3493857,0.001216209,0.0010240481,0.0007010159,0.15581752,0.006100635,0.010533138],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9931049,0.0021543347,0.00061954436,0.0022345635,0.0015101425,0.0003765755],"domain_scores_gemma":[0.9745285,0.012766729,0.00036035737,0.008650783,0.0033669886,0.00032655703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008357726,0.0024282467,0.0030262475,0.006605639,0.0012131771,0.0038484603,0.0033476606,0.002840825,0.006595774],"category_scores_gemma":[0.046749514,0.0008399564,0.0020849183,0.005525048,0.00071149034,0.006391327,0.0032162212,0.0023669165,0.010474981],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028181493,0.0012052713,0.013920643,0.0016666271,0.0015857914,0.000895124,0.0007304747,0.05054885,0.042143434,0.0037791363,0.14578404,0.73492247],"study_design_scores_gemma":[0.0007301657,0.0006285735,0.010108669,0.0001269472,0.00061607145,0.00088597275,0.0007103024,0.91729593,0.026643613,0.011295177,0.03081142,0.0001472439],"about_ca_topic_score_codex":0.017135173,"about_ca_topic_score_gemma":0.020140368,"teacher_disagreement_score":0.017135173,"about_ca_system_score_codex":0.00080575224,"about_ca_system_score_gemma":0.0020327372,"threshold_uncertainty_score":0.04420036},"labels":[],"label_agreement":null},{"id":"W4327644099","doi":"10.1007/978-3-031-28244-7_34","title":"CoSPLADE: Contextualizing SPLADE for Conversational Information Retrieval","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Task (project management); Conversation; Code (set theory); Rank (graph theory); Artificial intelligence; Source code; Programming language","score_opus":0.034249620816944965,"score_gpt":0.26238429948976755,"score_spread":0.22813467867282258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055418382,0.00079278875,0.90842694,0.00016332776,0.0001991166,0.00029745576,0.0023792342,0.07619519,0.0060041975],"genre_scores_gemma":[0.07216174,0.00065445696,0.89242667,0.00031643038,0.00018821527,0.0006311987,0.010941357,0.00696944,0.01571058],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991892,0.0002554891,0.00006737152,0.00020515366,0.00022418893,0.000058589856],"domain_scores_gemma":[0.9991543,0.00039605596,0.000028146067,0.00021343786,0.0001533012,0.000054723132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093623245,0.0015516292,0.001083179,0.0013482614,0.00074318214,0.0016268124,0.0012926678,0.00083028234,0.02890184],"category_scores_gemma":[0.0029704592,0.000756868,0.0009260945,0.0010229435,0.0004562835,0.0025809703,0.003283612,0.0013260059,0.014183935],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001065377,0.00022825015,0.00062346586,0.0009856116,0.0001099797,0.00020581784,0.00094796496,0.0051380564,0.031664867,0.022947773,0.123849064,0.81223375],"study_design_scores_gemma":[0.00034742782,0.00039104332,0.0011959028,0.00023961811,0.00021231397,0.0006274981,0.0007424258,0.373152,0.083681256,0.068888046,0.47037327,0.00014921495],"about_ca_topic_score_codex":0.0025527668,"about_ca_topic_score_gemma":0.0049707307,"teacher_disagreement_score":0.02890184,"about_ca_system_score_codex":0.00044374037,"about_ca_system_score_gemma":0.0007277608,"threshold_uncertainty_score":0.0966863},"labels":[],"label_agreement":null},{"id":"W4327644549","doi":"10.1007/978-3-031-28238-6_24","title":"De-biasing Relevance Judgements for Fair Ranking","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Microsoft (Canada); University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Ranking (information retrieval); Judgement; Relevance (law); Computer science; Set (abstract data type); Artificial intelligence; Biasing; Gender bias; Process (computing); Machine learning; Information retrieval; Psychology; Social psychology; Voltage","score_opus":0.03901985798360569,"score_gpt":0.2754367443815013,"score_spread":0.2364168863978956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059801103,0.0018003463,0.9843551,0.00091829355,0.00072253897,0.00021972905,0.00026605275,0.0010231577,0.004714704],"genre_scores_gemma":[0.29216465,0.0010952866,0.6894625,0.0010404055,0.0021192355,0.00075634755,0.0014450062,0.0010019834,0.010914625],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.934287,0.040353864,0.0038187413,0.0052496633,0.014563796,0.0017269183],"domain_scores_gemma":[0.84488225,0.107240096,0.0037911616,0.025688076,0.01699183,0.0014066692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04927327,0.0018440393,0.0034448549,0.006000045,0.0025799335,0.00554489,0.004229721,0.0034935276,0.010842023],"category_scores_gemma":[0.20650418,0.0011594456,0.0021259845,0.005567659,0.0031854059,0.0076770047,0.0061154207,0.0060350066,0.0043882513],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011568352,0.00021036799,0.0017043202,0.0012430635,0.00053661177,0.00011535142,0.0006979773,0.027661666,0.007885227,0.13669881,0.035508394,0.7865813],"study_design_scores_gemma":[0.00020350193,0.0002163294,0.0011097427,0.00033785417,0.0002324422,0.00026355468,0.00014910373,0.32254365,0.00812242,0.6475799,0.01912905,0.000112442875],"about_ca_topic_score_codex":0.0017075771,"about_ca_topic_score_gemma":0.0035948406,"teacher_disagreement_score":0.04927327,"about_ca_system_score_codex":0.002308491,"about_ca_system_score_gemma":0.0031435322,"threshold_uncertainty_score":0.26058507},"labels":[],"label_agreement":null},{"id":"W4327644584","doi":"10.1007/978-3-031-28238-6_51","title":"Learning Query-Space Document Representations for High-Recall Retrieval","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Guelph; University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Information retrieval; Set (abstract data type); Recall; Representation (politics); Space (punctuation); Range (aeronautics); Precision and recall; Artificial intelligence","score_opus":0.027236126660376232,"score_gpt":0.2840207212977938,"score_spread":0.2567845946374176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044018473,0.004138328,0.9396754,0.0006539817,0.00022722852,0.0001948488,0.0017616568,0.0074998112,0.0018302397],"genre_scores_gemma":[0.38116974,0.0034469687,0.59122765,0.00054550363,0.0006616867,0.0004982542,0.012288631,0.000628626,0.009532911],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987062,0.00037803192,0.0001225151,0.00030621258,0.00031957738,0.00016752731],"domain_scores_gemma":[0.99776375,0.0011344912,0.00016712598,0.00046498055,0.00038377382,0.000085784035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951683,0.0014191929,0.0019353457,0.0032867393,0.0005626069,0.0021085988,0.002096284,0.002144953,0.00539972],"category_scores_gemma":[0.006581736,0.0005767967,0.0014132169,0.003868878,0.0006431782,0.004024752,0.0015668336,0.0023506638,0.0042765187],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069368025,0.00038567977,0.0012335669,0.00032967018,0.00012919171,0.000092617796,0.00015022389,0.035933472,0.016910026,0.0067278533,0.023094865,0.9143191],"study_design_scores_gemma":[0.00009497979,0.00033254115,0.000836988,0.000061689345,0.00012474456,0.0002810393,0.0001310234,0.95982903,0.009719145,0.023313552,0.0052271485,0.000048124555],"about_ca_topic_score_codex":0.004597288,"about_ca_topic_score_gemma":0.005463167,"teacher_disagreement_score":0.00539972,"about_ca_system_score_codex":0.0012942472,"about_ca_system_score_gemma":0.0013036776,"threshold_uncertainty_score":0.018063903},"labels":[],"label_agreement":null},{"id":"W4327644606","doi":"10.1007/978-3-031-28238-6_57","title":"Neural Ad-Hoc Retrieval Meets Open Information Extraction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto; University of Guelph; Toronto Metropolitan University","funders":"","keywords":"Computer science; Information retrieval; Information extraction; Task (project management); Range (aeronautics); Artificial intelligence; Relationship extraction; Artificial neural network; Natural language processing","score_opus":0.038498278859022225,"score_gpt":0.28689816379407646,"score_spread":0.24839988493505422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108876685,0.006959418,0.9532976,0.0011176016,0.00072027807,0.00017819539,0.0007253795,0.004507144,0.02160678],"genre_scores_gemma":[0.21124451,0.008396041,0.70045394,0.0006022411,0.0018011493,0.00022649686,0.0041762777,0.0008881358,0.07221125],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988502,0.00021531543,0.00013905574,0.00026762957,0.00040057738,0.00012713864],"domain_scores_gemma":[0.9978625,0.00079377554,0.00009785302,0.00069250446,0.0004877901,0.00006544216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014157324,0.0009712569,0.001355578,0.0025389341,0.00089587213,0.0037758616,0.0017378771,0.0016448387,0.011210713],"category_scores_gemma":[0.0045216465,0.00066199293,0.0010416687,0.0036663185,0.00089186954,0.006828119,0.0026730823,0.0014930293,0.0121089555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001409802,0.00012635457,0.00041843663,0.0004228037,0.00006503723,0.00010729536,0.00007712601,0.0064020893,0.018431112,0.026789676,0.026726032,0.92029303],"study_design_scores_gemma":[0.000046557714,0.00019241622,0.0012526175,0.00013294921,0.0002687012,0.0011866076,0.00022802602,0.5986288,0.07648691,0.20838687,0.1131109,0.00007866515],"about_ca_topic_score_codex":0.0017471786,"about_ca_topic_score_gemma":0.003262614,"teacher_disagreement_score":0.011210713,"about_ca_system_score_codex":0.0008847125,"about_ca_system_score_gemma":0.0011234665,"threshold_uncertainty_score":0.03750354},"labels":[],"label_agreement":null},{"id":"W4327644611","doi":"10.1007/978-3-031-28238-6_50","title":"Don’t Raise Your Voice, Improve Your Argument: Learning to Retrieve Convincing Arguments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Relevance (law); Information retrieval; Focus (optics); Content (measure theory); Argument (complex analysis); Value (mathematics); Artificial intelligence; Natural language processing; Machine learning","score_opus":0.02644597134160811,"score_gpt":0.2651516314128106,"score_spread":0.2387056600712025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327644611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069374055,0.0033960904,0.7849421,0.010284402,0.0016435462,0.00036319203,0.0007364349,0.0050100884,0.12425012],"genre_scores_gemma":[0.316048,0.0031667058,0.5931434,0.00305276,0.0010390227,0.00039389115,0.003509308,0.0022195813,0.07742735],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989236,0.0004483482,0.00005756518,0.00022292916,0.00029448097,0.00005303451],"domain_scores_gemma":[0.98210573,0.0153486505,0.0005512716,0.00082126644,0.00084667676,0.0003262966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020188668,0.0011726036,0.00061183254,0.000885022,0.0007658584,0.0041292454,0.0016630001,0.0023379126,0.029244578],"category_scores_gemma":[0.03275114,0.0005409564,0.0008001011,0.00063994667,0.0009732192,0.010928852,0.0021552849,0.004361908,0.022223579],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003478459,0.00031122993,0.0014114534,0.0006380697,0.000056250654,0.00029390544,0.0030032496,0.002055261,0.009358847,0.047475476,0.09007969,0.8449687],"study_design_scores_gemma":[0.00026797634,0.00048367694,0.0027356287,0.0011879144,0.00028080802,0.001956429,0.004556878,0.17133667,0.02517431,0.57691836,0.21495405,0.00014736086],"about_ca_topic_score_codex":0.00035878364,"about_ca_topic_score_gemma":0.00061290443,"teacher_disagreement_score":0.029244578,"about_ca_system_score_codex":0.0005572822,"about_ca_system_score_gemma":0.0008326807,"threshold_uncertainty_score":0.09783286},"labels":[],"label_agreement":null},{"id":"W4327645624","doi":"10.1007/978-3-031-28238-6_13","title":"Privacy-Preserving Fair Item Ranking","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"HEC Montréal; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Canadian Institute for Advanced Research","keywords":"Computer science; Ranking (information retrieval); Differential privacy; Internet privacy; Secure multi-party computation; Information privacy; Quality (philosophy); Equity (law); Privacy protection; Computer security; Information retrieval; World Wide Web; Data mining; Cryptography","score_opus":0.0365363889671584,"score_gpt":0.26890923979915266,"score_spread":0.23237285083199427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327645624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017308239,0.0008809905,0.9653149,0.00088099943,0.00029407648,0.000170321,0.00094445806,0.0015032847,0.012702808],"genre_scores_gemma":[0.52449644,0.0016164278,0.40984967,0.0006540901,0.0007362595,0.00027304885,0.0034291714,0.0005527661,0.05839214],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99272245,0.002443294,0.00037805233,0.0010037357,0.0026311423,0.0008212794],"domain_scores_gemma":[0.9858452,0.004535131,0.00041552616,0.0076636723,0.0011632971,0.00037710278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005476264,0.0012734564,0.0027722914,0.0023392753,0.0019765056,0.004769805,0.0043847756,0.0016185482,0.010096366],"category_scores_gemma":[0.017020918,0.0010295077,0.0014591689,0.0055686785,0.0019829406,0.007557667,0.003590945,0.0031691259,0.0043695644],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084566086,0.0004257003,0.0013029691,0.0003751286,0.00020935018,0.00024340927,0.0002551479,0.11858952,0.004428344,0.3825344,0.046785597,0.44400477],"study_design_scores_gemma":[0.00007701956,0.00019615318,0.0005342308,0.000037099024,0.00008006217,0.0005138926,0.00008646108,0.3330666,0.0052322485,0.64546245,0.014656674,0.00005707555],"about_ca_topic_score_codex":0.0016132386,"about_ca_topic_score_gemma":0.0022398469,"teacher_disagreement_score":0.010096366,"about_ca_system_score_codex":0.0015071457,"about_ca_system_score_gemma":0.0030296647,"threshold_uncertainty_score":0.033775747},"labels":[],"label_agreement":null},{"id":"W4327645767","doi":"10.1007/978-3-031-28244-7_1","title":"Self-supervised Contrastive BERT Fine-tuning for Fusion-Based Reviewed-Item Retrieval","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Ranking (information retrieval); Artificial intelligence; Matching (statistics); Selection (genetic algorithm); Natural language processing; Information retrieval; Task (project management); Embedding; Machine learning","score_opus":0.03059425526710696,"score_gpt":0.25976128234527573,"score_spread":0.22916702707816877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327645767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04501799,0.0024686302,0.94221735,0.00015858383,0.00023917007,0.00018045706,0.00043024882,0.005920604,0.003367017],"genre_scores_gemma":[0.5737909,0.0007173121,0.41100794,0.00043274555,0.00038229034,0.0002942898,0.0022723654,0.0006278949,0.010474196],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989477,0.0002058605,0.00007564349,0.00031149198,0.0003023011,0.00015702196],"domain_scores_gemma":[0.9986299,0.0005416503,0.000081371574,0.0002182577,0.00045874098,0.000070133035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017595214,0.0008296769,0.0018142988,0.0017290481,0.00055539946,0.00092513405,0.002309885,0.0012819098,0.0046714083],"category_scores_gemma":[0.0031593225,0.00037369409,0.000841341,0.001723092,0.00052635616,0.0015786017,0.0016349738,0.0011897456,0.0027508603],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008099151,0.00046094146,0.000992367,0.00021144447,0.00015541517,0.0000713173,0.0000822076,0.03149619,0.07000098,0.0016322598,0.009489745,0.8845973],"study_design_scores_gemma":[0.000044852626,0.00018961403,0.0015279999,0.000017599954,0.00010357581,0.0001401981,0.00003733134,0.97280824,0.019813986,0.002188648,0.003098437,0.00002949285],"about_ca_topic_score_codex":0.0038333612,"about_ca_topic_score_gemma":0.007551578,"teacher_disagreement_score":0.0046714083,"about_ca_system_score_codex":0.00058611284,"about_ca_system_score_gemma":0.0009269022,"threshold_uncertainty_score":0.015627384},"labels":[],"label_agreement":null},{"id":"W4327652278","doi":"10.1007/978-3-031-26390-3","title":"Machine Learning and Knowledge Discovery in Databases","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Microsoft Research Asia; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Insight SFI Research Centre for Data Analytics; Région Normandie; Université de Lyon; Stockholms Universitet; University of Science and Technology of China; Shenzhen University; Julius-Maximilians-Universität Würzburg; Universidad de Córdoba; Rheinische Friedrich-Wilhelms-Universität Bonn; Southeast University; Nanjing University; Univerza v Ljubljani; Universidade Federal de Minas Gerais; Aristotle University of Thessaloniki; Central European Institute of Technology; Universidad de Oviedo; Ludwig-Maximilians-Universität München; Universiteit Utrecht; Temple University; Nankai University; Centre National de la Recherche Scientifique; Universiteit Gent; Sapienza Università di Roma; Université de Liège; Université de Neuchâtel; Technische Universität Wien; Universita degli Studi di Bari Aldo Moro; Université de Caen Normandie; Umeå Universitet; Politechnika Poznańska; University of Southern California; Masdar Institute of Science and Technology; Universitetet i Stavanger; King Abdulaziz University; National and Kapodistrian University of Athens; Johannes Gutenberg-Universität Mainz; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Euskal Herriko Unibertsitatea; Albert-Ludwigs-Universität Freiburg; Dalhousie University; Universidad de Zaragoza; University of Waikato; Shanghai Educational Development Foundation; Chalmers Tekniska Högskola; Rijksuniversiteit Groningen; Aalborg Universitet; Abu Dhabi National Oil Company; University of Texas at Dallas; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; Humboldt-Universität zu Berlin; Sun Yat-sen University; Technische Universität München; Institut National des Sciences Appliquées de Lyon; Università degli Studi di Milano-Bicocca; Tsinghua University; Chinese Academy of Sciences; Masarykova Univerzita; Universiteit van Amsterdam; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; University of Technology Sydney; KU Leuven; University of New South Wales; Gottfried Wilhelm Leibniz Universität Hannover; Université de La Réunion; Jilin University; National University of Singapore; Indian Institute of Technology Palakkad; Commonwealth Scientific and Industrial Research Organisation; University of Oxford; Sorbonne Université; Kungliga Tekniska Högskolan; Ulster University; Universidade do Porto; Utah State University; Indian Institute of Technology, Patna; Carl von Ossietzky Universität Oldenburg; Blekinge Tekniska Högskola; Beihang University; University of Twente; University of Bristol; Harokopio University; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Purdue University; University of Macedonia; Eberhard Karls Universität Tübingen; Itä-Suomen Yliopisto; Shandong University; Politechnika Warszawska; Université Bretagne Sud; Institut \"Jožef Stefan\"; Deakin University; Universiti Kuala Lumpur; Helsingin Yliopisto; Aix-Marseille Université; Universiteit Leiden; Universität Bielefeld; Université Grenoble Alpes; Università degli Studi di Trento; Michigan State University; Arizona State University; Università degli Studi di Cagliari; Georgia State University; Deutsches Krebsforschungszentrum; Högskolan i Halmstad; Korea Advanced Institute of Science and Technology; University of Alberta; Indian Council of Agricultural Research; University of Texas at San Antonio; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; College of Engineering, Michigan State University; University of Wyoming; Danmarks Tekniske Universitet; Shenzhen Technology University; University College London; Politecnico di Torino; Université Catholique de Louvain; Philipps-Universität Marburg; Università degli Studi di Milano; Indian National Science Academy; Institut National Polytechnique de Toulouse; Microsoft Research; University College Dublin; Syracuse University; University of Ottawa; Technische Universiteit Eindhoven","keywords":"Computer science; Knowledge extraction; Database; Information retrieval; Artificial intelligence; Data science; World Wide Web","score_opus":0.024445144512082982,"score_gpt":0.2906166420676732,"score_spread":0.2661714975555902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327652278","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635329,0.2597681,0.5984489,0.007553297,0.0043354067,0.0003002367,0.0020280518,0.0021767137,0.12075399],"genre_scores_gemma":[0.045371886,0.18120953,0.545715,0.0030710488,0.00414011,0.0004037424,0.005208564,0.00074222067,0.21413797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990596,0.00018952906,0.00008884657,0.00014249772,0.00048671025,0.000032737204],"domain_scores_gemma":[0.9975062,0.0018472255,0.00008280166,0.000264167,0.00023900918,0.000060690996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223477,0.00084265234,0.0016497052,0.0025552816,0.00051248306,0.004103264,0.0014350653,0.00085436105,0.014226699],"category_scores_gemma":[0.0043096617,0.00067518523,0.00084276235,0.0071022473,0.0011092684,0.0057409825,0.0014138771,0.0020989408,0.00938921],"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.00006038981,0.000083153915,0.00043509618,0.0018632549,0.000103939026,0.00014537957,0.00015794489,0.0046024676,0.0012510429,0.15520544,0.13710928,0.69898266],"study_design_scores_gemma":[0.000027743301,0.000046173507,0.0008203212,0.00061908335,0.0000770086,0.00085935474,0.000112455564,0.027553957,0.0016254168,0.3994712,0.5687559,0.000031399497],"about_ca_topic_score_codex":0.00083954394,"about_ca_topic_score_gemma":0.00080515514,"teacher_disagreement_score":0.014226699,"about_ca_system_score_codex":0.0007953959,"about_ca_system_score_gemma":0.0008812106,"threshold_uncertainty_score":0.047593057},"labels":[],"label_agreement":null},{"id":"W4327652279","doi":"10.1007/978-3-031-26409-2","title":"Machine Learning and Knowledge Discovery in Databases","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":12,"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":"Microsoft Research Asia; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Insight SFI Research Centre for Data Analytics; Région Normandie; Université de Lyon; Stockholms Universitet; University of Science and Technology of China; Shenzhen University; Julius-Maximilians-Universität Würzburg; Universidad de Córdoba; Rheinische Friedrich-Wilhelms-Universität Bonn; Southeast University; Nanjing University; Univerza v Ljubljani; Universidade Federal de Minas Gerais; Aristotle University of Thessaloniki; Central European Institute of Technology; Universidad de Oviedo; Ludwig-Maximilians-Universität München; Universiteit Utrecht; Temple University; Nankai University; Centre National de la Recherche Scientifique; Universiteit Gent; Sapienza Università di Roma; Université de Liège; Université de Neuchâtel; Technische Universität Wien; Universita degli Studi di Bari Aldo Moro; Université de Caen Normandie; Umeå Universitet; Politechnika Poznańska; University of Southern California; Masdar Institute of Science and Technology; Universitetet i Stavanger; King Abdulaziz University; National and Kapodistrian University of Athens; Johannes Gutenberg-Universität Mainz; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Euskal Herriko Unibertsitatea; Albert-Ludwigs-Universität Freiburg; Dalhousie University; Universidad de Zaragoza; University of Waikato; Shanghai Educational Development Foundation; Chalmers Tekniska Högskola; Rijksuniversiteit Groningen; Aalborg Universitet; Abu Dhabi National Oil Company; University of Texas at Dallas; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; Humboldt-Universität zu Berlin; Sun Yat-sen University; Technische Universität München; Institut National des Sciences Appliquées de Lyon; Università degli Studi di Milano-Bicocca; Tsinghua University; Chinese Academy of Sciences; Masarykova Univerzita; Universiteit van Amsterdam; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; University of Technology Sydney; KU Leuven; University of New South Wales; Gottfried Wilhelm Leibniz Universität Hannover; Université de La Réunion; Jilin University; National University of Singapore; Indian Institute of Technology Palakkad; Commonwealth Scientific and Industrial Research Organisation; University of Oxford; Sorbonne Université; Kungliga Tekniska Högskolan; Ulster University; Universidade do Porto; Utah State University; Indian Institute of Technology, Patna; Carl von Ossietzky Universität Oldenburg; Blekinge Tekniska Högskola; Beihang University; University of Twente; University of Bristol; Harokopio University; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Purdue University; University of Macedonia; Eberhard Karls Universität Tübingen; Itä-Suomen Yliopisto; Shandong University; Politechnika Warszawska; Université Bretagne Sud; Institut \"Jožef Stefan\"; Deakin University; Universiti Kuala Lumpur; Helsingin Yliopisto; Aix-Marseille Université; Universiteit Leiden; Universität Bielefeld; Université Grenoble Alpes; Università degli Studi di Trento; Michigan State University; Arizona State University; Università degli Studi di Cagliari; Georgia State University; Deutsches Krebsforschungszentrum; Högskolan i Halmstad; Korea Advanced Institute of Science and Technology; University of Alberta; Indian Council of Agricultural Research; University of Texas at San Antonio; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; College of Engineering, Michigan State University; University of Wyoming; Danmarks Tekniske Universitet; Shenzhen Technology University; University College London; Politecnico di Torino; Université Catholique de Louvain; Philipps-Universität Marburg; Università degli Studi di Milano; Indian National Science Academy; Institut National Polytechnique de Toulouse; Microsoft Research; University College Dublin; Syracuse University; University of Ottawa; Technische Universiteit Eindhoven","keywords":"Computer science; Knowledge extraction; Database; Artificial intelligence; Information retrieval; Data science; World Wide Web","score_opus":0.024445144512082982,"score_gpt":0.2906166420676732,"score_spread":0.2661714975555902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327652279","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635329,0.2597681,0.5984489,0.007553297,0.0043354067,0.0003002367,0.0020280518,0.0021767137,0.12075399],"genre_scores_gemma":[0.045371886,0.18120953,0.545715,0.0030710488,0.00414011,0.0004037424,0.005208564,0.00074222067,0.21413797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990596,0.00018952906,0.00008884657,0.00014249772,0.00048671025,0.000032737204],"domain_scores_gemma":[0.9975062,0.0018472255,0.00008280166,0.000264167,0.00023900918,0.000060690996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223477,0.00084265234,0.0016497052,0.0025552816,0.00051248306,0.004103264,0.0014350653,0.00085436105,0.014226699],"category_scores_gemma":[0.0043096617,0.00067518523,0.00084276235,0.0071022473,0.0011092684,0.0057409825,0.0014138771,0.0020989408,0.00938921],"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.00006038981,0.000083153915,0.00043509618,0.0018632549,0.000103939026,0.00014537957,0.00015794489,0.0046024676,0.0012510429,0.15520544,0.13710928,0.69898266],"study_design_scores_gemma":[0.000027743301,0.000046173507,0.0008203212,0.00061908335,0.0000770086,0.00085935474,0.000112455564,0.027553957,0.0016254168,0.3994712,0.5687559,0.000031399497],"about_ca_topic_score_codex":0.00083954394,"about_ca_topic_score_gemma":0.00080515514,"teacher_disagreement_score":0.014226699,"about_ca_system_score_codex":0.0007953959,"about_ca_system_score_gemma":0.0008812106,"threshold_uncertainty_score":0.047593057},"labels":[],"label_agreement":null},{"id":"W4327652731","doi":"10.1007/978-3-031-26412-2","title":"Machine Learning and Knowledge Discovery in Databases","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"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":"Microsoft Research Asia; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Insight SFI Research Centre for Data Analytics; Région Normandie; Université de Lyon; Stockholms Universitet; University of Science and Technology of China; Shenzhen University; Julius-Maximilians-Universität Würzburg; Universidad de Córdoba; Rheinische Friedrich-Wilhelms-Universität Bonn; Southeast University; Nanjing University; Univerza v Ljubljani; Universidade Federal de Minas Gerais; Aristotle University of Thessaloniki; Central European Institute of Technology; Universidad de Oviedo; Ludwig-Maximilians-Universität München; Universiteit Utrecht; Temple University; Nankai University; Centre National de la Recherche Scientifique; Universiteit Gent; Sapienza Università di Roma; Université de Liège; Université de Neuchâtel; Technische Universität Wien; Universita degli Studi di Bari Aldo Moro; Université de Caen Normandie; Umeå Universitet; Politechnika Poznańska; University of Southern California; Masdar Institute of Science and Technology; Universitetet i Stavanger; King Abdulaziz University; National and Kapodistrian University of Athens; Johannes Gutenberg-Universität Mainz; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Euskal Herriko Unibertsitatea; Albert-Ludwigs-Universität Freiburg; Dalhousie University; Universidad de Zaragoza; University of Waikato; Shanghai Educational Development Foundation; Chalmers Tekniska Högskola; Rijksuniversiteit Groningen; Aalborg Universitet; Abu Dhabi National Oil Company; University of Texas at Dallas; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; Humboldt-Universität zu Berlin; Sun Yat-sen University; Technische Universität München; Institut National des Sciences Appliquées de Lyon; Università degli Studi di Milano-Bicocca; Tsinghua University; Chinese Academy of Sciences; Masarykova Univerzita; Universiteit van Amsterdam; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; University of Technology Sydney; KU Leuven; University of New South Wales; Gottfried Wilhelm Leibniz Universität Hannover; Université de La Réunion; Jilin University; National University of Singapore; Indian Institute of Technology Palakkad; Commonwealth Scientific and Industrial Research Organisation; University of Oxford; Sorbonne Université; Kungliga Tekniska Högskolan; Ulster University; Universidade do Porto; Utah State University; Indian Institute of Technology, Patna; Carl von Ossietzky Universität Oldenburg; Blekinge Tekniska Högskola; Beihang University; University of Twente; University of Bristol; Harokopio University; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Purdue University; University of Macedonia; Eberhard Karls Universität Tübingen; Itä-Suomen Yliopisto; Shandong University; Politechnika Warszawska; Université Bretagne Sud; Institut \"Jožef Stefan\"; Deakin University; Universiti Kuala Lumpur; Helsingin Yliopisto; Aix-Marseille Université; Universiteit Leiden; Universität Bielefeld; Université Grenoble Alpes; Università degli Studi di Trento; Michigan State University; Arizona State University; Università degli Studi di Cagliari; Georgia State University; Deutsches Krebsforschungszentrum; Högskolan i Halmstad; Korea Advanced Institute of Science and Technology; University of Alberta; Indian Council of Agricultural Research; University of Texas at San Antonio; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; College of Engineering, Michigan State University; University of Wyoming; Danmarks Tekniske Universitet; Shenzhen Technology University; University College London; Politecnico di Torino; Université Catholique de Louvain; Philipps-Universität Marburg; Università degli Studi di Milano; Indian National Science Academy; Institut National Polytechnique de Toulouse; Microsoft Research; University College Dublin; Syracuse University; University of Ottawa; Technische Universiteit Eindhoven","keywords":"Computer science; Knowledge extraction; Database; Information retrieval; Artificial intelligence","score_opus":0.024445144512082982,"score_gpt":0.2906166420676732,"score_spread":0.2661714975555902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327652731","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635329,0.2597681,0.5984489,0.007553297,0.0043354067,0.0003002367,0.0020280518,0.0021767137,0.12075399],"genre_scores_gemma":[0.045371886,0.18120953,0.545715,0.0030710488,0.00414011,0.0004037424,0.005208564,0.00074222067,0.21413797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990596,0.00018952906,0.00008884657,0.00014249772,0.00048671025,0.000032737204],"domain_scores_gemma":[0.9975062,0.0018472255,0.00008280166,0.000264167,0.00023900918,0.000060690996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223477,0.00084265234,0.0016497052,0.0025552816,0.00051248306,0.004103264,0.0014350653,0.00085436105,0.014226699],"category_scores_gemma":[0.0043096617,0.00067518523,0.00084276235,0.0071022473,0.0011092684,0.0057409825,0.0014138771,0.0020989408,0.00938921],"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.00006038981,0.000083153915,0.00043509618,0.0018632549,0.000103939026,0.00014537957,0.00015794489,0.0046024676,0.0012510429,0.15520544,0.13710928,0.69898266],"study_design_scores_gemma":[0.000027743301,0.000046173507,0.0008203212,0.00061908335,0.0000770086,0.00085935474,0.000112455564,0.027553957,0.0016254168,0.3994712,0.5687559,0.000031399497],"about_ca_topic_score_codex":0.00083954394,"about_ca_topic_score_gemma":0.00080515514,"teacher_disagreement_score":0.014226699,"about_ca_system_score_codex":0.0007953959,"about_ca_system_score_gemma":0.0008812106,"threshold_uncertainty_score":0.047593057},"labels":[],"label_agreement":null},{"id":"W4327656811","doi":"10.1007/978-3-031-26387-3","title":"Machine Learning and Knowledge Discovery in Databases","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Microsoft Research Asia; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Insight SFI Research Centre for Data Analytics; Région Normandie; Université de Lyon; Stockholms Universitet; University of Science and Technology of China; Shenzhen University; Julius-Maximilians-Universität Würzburg; Universidad de Córdoba; Rheinische Friedrich-Wilhelms-Universität Bonn; Southeast University; Nanjing University; Univerza v Ljubljani; Universidade Federal de Minas Gerais; Aristotle University of Thessaloniki; Central European Institute of Technology; Universidad de Oviedo; Ludwig-Maximilians-Universität München; Universiteit Utrecht; Temple University; Nankai University; Centre National de la Recherche Scientifique; Universiteit Gent; Sapienza Università di Roma; Université de Liège; Université de Neuchâtel; Technische Universität Wien; Universita degli Studi di Bari Aldo Moro; Université de Caen Normandie; Umeå Universitet; Politechnika Poznańska; University of Southern California; Masdar Institute of Science and Technology; Universitetet i Stavanger; King Abdulaziz University; National and Kapodistrian University of Athens; Johannes Gutenberg-Universität Mainz; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Euskal Herriko Unibertsitatea; Albert-Ludwigs-Universität Freiburg; Dalhousie University; Universidad de Zaragoza; University of Waikato; Shanghai Educational Development Foundation; Chalmers Tekniska Högskola; Rijksuniversiteit Groningen; Aalborg Universitet; Abu Dhabi National Oil Company; University of Texas at Dallas; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; Humboldt-Universität zu Berlin; Sun Yat-sen University; Technische Universität München; Institut National des Sciences Appliquées de Lyon; Università degli Studi di Milano-Bicocca; Tsinghua University; Chinese Academy of Sciences; Masarykova Univerzita; Universiteit van Amsterdam; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; University of Technology Sydney; KU Leuven; University of New South Wales; Gottfried Wilhelm Leibniz Universität Hannover; Université de La Réunion; Jilin University; National University of Singapore; Indian Institute of Technology Palakkad; Commonwealth Scientific and Industrial Research Organisation; University of Oxford; Sorbonne Université; Kungliga Tekniska Högskolan; Ulster University; Universidade do Porto; Utah State University; Indian Institute of Technology, Patna; Carl von Ossietzky Universität Oldenburg; Blekinge Tekniska Högskola; Beihang University; University of Twente; University of Bristol; Harokopio University; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Purdue University; University of Macedonia; Eberhard Karls Universität Tübingen; Itä-Suomen Yliopisto; Shandong University; Politechnika Warszawska; Université Bretagne Sud; Institut \"Jožef Stefan\"; Deakin University; Universiti Kuala Lumpur; Helsingin Yliopisto; Aix-Marseille Université; Universiteit Leiden; Universität Bielefeld; Université Grenoble Alpes; Università degli Studi di Trento; Michigan State University; Arizona State University; Università degli Studi di Cagliari; Georgia State University; Deutsches Krebsforschungszentrum; Högskolan i Halmstad; Korea Advanced Institute of Science and Technology; University of Alberta; Indian Council of Agricultural Research; University of Texas at San Antonio; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; College of Engineering, Michigan State University; University of Wyoming; Danmarks Tekniske Universitet; Shenzhen Technology University; University College London; Politecnico di Torino; Université Catholique de Louvain; Philipps-Universität Marburg; Università degli Studi di Milano; Indian National Science Academy; Institut National Polytechnique de Toulouse; Microsoft Research; University College Dublin; Syracuse University; University of Ottawa; Technische Universiteit Eindhoven","keywords":"Computer science; Knowledge extraction; Database; Information retrieval; Data science; Artificial intelligence","score_opus":0.024445144512082982,"score_gpt":0.2906166420676732,"score_spread":0.2661714975555902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327656811","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.004635329,0.2597681,0.5984489,0.007553297,0.0043354067,0.0003002367,0.0020280518,0.0021767137,0.12075399],"genre_scores_gemma":[0.045371886,0.18120953,0.545715,0.0030710488,0.00414011,0.0004037424,0.005208564,0.00074222067,0.21413797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990596,0.00018952906,0.00008884657,0.00014249772,0.00048671025,0.000032737204],"domain_scores_gemma":[0.9975062,0.0018472255,0.00008280166,0.000264167,0.00023900918,0.000060690996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223477,0.00084265234,0.0016497052,0.0025552816,0.00051248306,0.004103264,0.0014350653,0.00085436105,0.014226699],"category_scores_gemma":[0.0043096617,0.00067518523,0.00084276235,0.0071022473,0.0011092684,0.0057409825,0.0014138771,0.0020989408,0.00938921],"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.00006038981,0.000083153915,0.00043509618,0.0018632549,0.000103939026,0.00014537957,0.00015794489,0.0046024676,0.0012510429,0.15520544,0.13710928,0.69898266],"study_design_scores_gemma":[0.000027743301,0.000046173507,0.0008203212,0.00061908335,0.0000770086,0.00085935474,0.000112455564,0.027553957,0.0016254168,0.3994712,0.5687559,0.000031399497],"about_ca_topic_score_codex":0.00083954394,"about_ca_topic_score_gemma":0.00080515514,"teacher_disagreement_score":0.014226699,"about_ca_system_score_codex":0.0007953959,"about_ca_system_score_gemma":0.0008812106,"threshold_uncertainty_score":0.047593057},"labels":[],"label_agreement":null},{"id":"W4327656993","doi":"10.1007/978-3-031-26387-3_6","title":"Automated Cancer Subtyping via Vector Quantization Mutual Information Maximization","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Subtyping; Computer science; Categorical variable; Cluster analysis; Mutual information; Categorization; Data mining; Expression (computer science); Artificial intelligence; Machine learning; Pattern recognition (psychology); Programming language","score_opus":0.015640582498399544,"score_gpt":0.263272368522845,"score_spread":0.24763178602444547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327656993","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.020424293,0.0005532402,0.97268665,0.00033229947,0.000051516214,0.00013059277,0.00057777774,0.0036484844,0.0015952482],"genre_scores_gemma":[0.33849475,0.00033156836,0.65327406,0.00025902246,0.00008388059,0.00021261808,0.0022375658,0.0005184287,0.004588156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984112,0.000433654,0.00012608428,0.0002794868,0.00055586395,0.0001938409],"domain_scores_gemma":[0.998005,0.0011340346,0.0001193385,0.00027336142,0.00040135722,0.00006694602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015664554,0.00073900295,0.0020655792,0.002322769,0.0006684029,0.0010262575,0.0016578252,0.001007223,0.0042918664],"category_scores_gemma":[0.003613542,0.0004907659,0.0012869647,0.0023667915,0.00074095634,0.0013407086,0.0021457605,0.0011105314,0.001258532],"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.0002678771,0.000106572144,0.0012781031,0.00014991648,0.00008126609,0.00007375119,0.00010007393,0.1174048,0.013837828,0.014155099,0.011375048,0.84116954],"study_design_scores_gemma":[0.0000176229,0.00004431153,0.0003525656,0.00000923119,0.000017175475,0.00004840951,0.000025272544,0.97638863,0.0041472274,0.017712835,0.0012259718,0.00001062397],"about_ca_topic_score_codex":0.007891429,"about_ca_topic_score_gemma":0.00967361,"teacher_disagreement_score":0.007891429,"about_ca_system_score_codex":0.0009875387,"about_ca_system_score_gemma":0.0018501801,"threshold_uncertainty_score":0.015690982},"labels":[],"label_agreement":null},{"id":"W4327657211","doi":"10.1007/978-3-031-28244-7","title":"Advances in Information Retrieval","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Massachusetts Amherst; Universität Innsbruck; Universität Konstanz; Universität Leipzig; Universität Duisburg-Essen; Università di Pisa; Wuhan University; Universidade do Porto; National Institute of Standards and Technology; Technion-Israel Institute of Technology; Rheinische Friedrich-Wilhelms-Universität Bonn; University of Cape Town; Sichuan University; University of Waterloo; Institute of Computing Technology, Chinese Academy of Sciences; Université de Caen Normandie; University of Crete; RMIT University; Tsinghua University; Edinburgh Napier University; Accenture; Renmin University of China; Università degli Studi di Milano-Bicocca; Chinese Academy of Sciences; Technische Universiteit Delft; Universiteit van Amsterdam; Dublin City University; University College London; University of Essex; Sorbonne Université; Università degli Studi di Milano; York University; Montclair State University; National Institute of Advanced Industrial Science and Technology; Universiteit Leiden; University of Otago; Université de Neuchâtel; Région Normandie; Università degli Studi di Udine; Johns Hopkins University","keywords":"Computer science; Information retrieval; State (computer science); Artificial intelligence; Programming language","score_opus":0.012864160102574714,"score_gpt":0.2606042818289115,"score_spread":0.24774012172633678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327657211","genre_codex":"review","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.0020548995,0.6013346,0.077063866,0.00759361,0.01659062,0.0001556802,0.0009657664,0.003014821,0.29122618],"genre_scores_gemma":[0.015498421,0.28447187,0.06282778,0.003391319,0.011766665,0.00014583564,0.002168096,0.0009496012,0.61878043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986004,0.00018051299,0.00009716572,0.00019552911,0.00084009895,0.00008629448],"domain_scores_gemma":[0.9984585,0.00052281434,0.00007426822,0.00032452238,0.0005075905,0.000112209906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016865669,0.0015837514,0.002260586,0.005485951,0.0008260285,0.0046120123,0.0015501849,0.0014542498,0.055534817],"category_scores_gemma":[0.0032750645,0.00067340134,0.00070831197,0.008301434,0.0012261278,0.007467553,0.0018694123,0.0025352293,0.07511046],"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.000026729982,0.000049129983,0.00009760056,0.0009403209,0.00003138429,0.000033220287,0.00007417409,0.0003066723,0.001841202,0.04002342,0.31894687,0.6376292],"study_design_scores_gemma":[0.0000075401254,0.000041000636,0.00031493366,0.00027545632,0.000028259901,0.00025625373,0.000040540206,0.001160666,0.0010295442,0.028041288,0.96878886,0.00001566541],"about_ca_topic_score_codex":0.00094272423,"about_ca_topic_score_gemma":0.0015701798,"teacher_disagreement_score":0.055534817,"about_ca_system_score_codex":0.0011737635,"about_ca_system_score_gemma":0.0012884352,"threshold_uncertainty_score":0.18578243},"labels":[],"label_agreement":null},{"id":"W4327657264","doi":"10.1007/978-3-031-26387-3_23","title":"Neural Networks with Feature Attribution and Contrastive Explanations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Feature (linguistics); Attribution; Pattern recognition (psychology); Natural language processing; Linguistics; Psychology","score_opus":0.02327235018734245,"score_gpt":0.24880301227091442,"score_spread":0.22553066208357198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327657264","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.03337907,0.0015616671,0.9488071,0.00083399,0.00022215258,0.00003373362,0.00014577573,0.0007082633,0.014308117],"genre_scores_gemma":[0.7352167,0.000939111,0.24321182,0.0001913098,0.00026524335,0.00008936562,0.00034474238,0.00015295648,0.01958885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974555,0.00008428926,0.00001649546,0.000079700636,0.000049654936,0.000024325109],"domain_scores_gemma":[0.99818206,0.0013876494,0.00010499416,0.00020414396,0.00009253286,0.000028594734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007263667,0.0005731226,0.000477722,0.0004953626,0.00028123122,0.0010069894,0.0014070971,0.001327375,0.007081238],"category_scores_gemma":[0.005154862,0.00054134143,0.00067381473,0.00067288685,0.0007528741,0.0028977382,0.0011163763,0.0017268173,0.0007130611],"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.00026744755,0.00012436842,0.00090992363,0.00021300257,0.00015877107,0.0002764556,0.0001683232,0.29906014,0.0038154859,0.274492,0.0073180306,0.41319603],"study_design_scores_gemma":[0.000014004898,0.000015408164,0.00013764526,0.000012373655,0.000018185321,0.000041394553,0.000007856141,0.78046423,0.0009632451,0.21716695,0.0011499655,0.000008730764],"about_ca_topic_score_codex":0.0011827733,"about_ca_topic_score_gemma":0.0015745583,"teacher_disagreement_score":0.007081238,"about_ca_system_score_codex":0.0005524313,"about_ca_system_score_gemma":0.00028432568,"threshold_uncertainty_score":0.023689091},"labels":[],"label_agreement":null},{"id":"W4327768895","doi":"10.1007/978-3-031-27420-6","title":"Head and Neck Tumor Segmentation and Outcome Prediction","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Texas MD Anderson Cancer Center; Universitätsspital Zürich; Centre Hospitalier Universitaire de Poitiers; Université de Rouen; Université de Bretagne Occidentale; Siemens Healthineers; Cleveland Clinic Foundation; Centre Hospitalier Universitaire Vaudois; Université de Sherbrooke; Cleveland Clinic","keywords":"Computer science; Head and neck; Segmentation; Focus (optics); Artificial intelligence; Head (geology); Outcome (game theory); Image segmentation; Computer vision; Medicine; Surgery; Optics","score_opus":0.015493607312169389,"score_gpt":0.3092354911410024,"score_spread":0.29374188382883304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327768895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17343639,0.017066678,0.7131804,0.0031955177,0.0012163655,0.00029731123,0.0101522505,0.0078494325,0.07360565],"genre_scores_gemma":[0.6038497,0.008729954,0.23975754,0.00042649423,0.001015438,0.00018452034,0.0115639875,0.00076553284,0.13370691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998946,0.0000130338885,0.0000052412256,0.00003054244,0.00004006386,0.000016489756],"domain_scores_gemma":[0.9998292,0.000087739354,0.000015562156,0.000018878995,0.000034105953,0.000014533732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037122422,0.00041980494,0.0004891728,0.0007082445,0.00012580676,0.0005316857,0.00048089048,0.0003638531,0.006970615],"category_scores_gemma":[0.0007136195,0.00021033445,0.00053246954,0.00055389863,0.00014506641,0.00031183712,0.00034318038,0.0004024248,0.003691329],"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.00022007813,0.000053555337,0.00719912,0.00007985568,0.00004819578,0.00015395963,0.000022469148,0.011944673,0.010105016,0.001454235,0.029124837,0.93959403],"study_design_scores_gemma":[0.00006467856,0.0005379176,0.073774286,0.00017344738,0.00038311403,0.0037220065,0.00018229347,0.69244874,0.09373965,0.04204398,0.09284021,0.0000897674],"about_ca_topic_score_codex":0.0027661605,"about_ca_topic_score_gemma":0.0049390984,"teacher_disagreement_score":0.006970615,"about_ca_system_score_codex":0.00025209683,"about_ca_system_score_gemma":0.00038155136,"threshold_uncertainty_score":0.023319006},"labels":[],"label_agreement":null},{"id":"W4327769465","doi":"10.1007/978-3-031-27420-6_7","title":"Fusion-Based Automated Segmentation in Head and Neck Cancer via Advance Deep Learning Techniques","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Deep learning; Image segmentation; Pattern recognition (psychology); Dice; Artificial neural network; Computer vision","score_opus":0.0096705353155577,"score_gpt":0.30704406289582503,"score_spread":0.2973735275802673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327769465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028206049,0.002248854,0.9628703,0.00032435113,0.00012122433,0.000057813297,0.00041813622,0.002355334,0.0033978696],"genre_scores_gemma":[0.4238818,0.0020254878,0.5623057,0.0003279779,0.00016925496,0.00012551287,0.0015744201,0.00059160555,0.008998121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971896,0.00003025058,0.000017818402,0.000079133,0.0000975555,0.00005618931],"domain_scores_gemma":[0.9997496,0.0000920986,0.000025138022,0.000038539656,0.00007862516,0.000015964457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955674,0.00072410534,0.0010657695,0.0009936667,0.0003096974,0.0011795082,0.0012473844,0.0012203563,0.0019399816],"category_scores_gemma":[0.00090046984,0.0005356097,0.0010810853,0.0010192211,0.0003613392,0.001115112,0.0012616345,0.00084209244,0.0010328359],"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.00023406664,0.00009757442,0.0016029452,0.00021824693,0.00013071303,0.00017364719,0.00011763527,0.16599695,0.039240986,0.0058892095,0.008384631,0.77791345],"study_design_scores_gemma":[0.0000056126673,0.000044900586,0.0007057585,0.000021533986,0.000041005413,0.00021185895,0.000019752595,0.976716,0.014076141,0.0052838163,0.0028566695,0.000017054976],"about_ca_topic_score_codex":0.004705011,"about_ca_topic_score_gemma":0.0073385,"teacher_disagreement_score":0.004705011,"about_ca_system_score_codex":0.0005970118,"about_ca_system_score_gemma":0.0010944564,"threshold_uncertainty_score":0.009355247},"labels":[],"label_agreement":null},{"id":"W4327770221","doi":"10.1007/978-3-031-27420-6_1","title":"Overview of the HECKTOR Challenge at MICCAI 2022: Automatic Head and Neck Tumor Segmentation and Outcome Prediction in PET/CT","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"National Institute of Dental and Craniofacial Research; National Cancer Institute; Siemens Healthineers; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Segmentation; Sørensen–Dice coefficient; Head and neck; Artificial intelligence; Head and neck cancer; Concordance; Medicine; Nuclear medicine; Image segmentation; Radiology; Radiation therapy; Surgery; Internal medicine","score_opus":0.02474895169134162,"score_gpt":0.32345832665877344,"score_spread":0.29870937496743183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327770221","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058045465,0.14248052,0.5244913,0.062405262,0.017027985,0.006493969,0.072738945,0.07000135,0.04631518],"genre_scores_gemma":[0.08533754,0.033974096,0.54929763,0.012196811,0.009430646,0.003547795,0.2529967,0.010441529,0.042777173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99117637,0.0026216009,0.0005246498,0.002388262,0.0023812335,0.00090799265],"domain_scores_gemma":[0.99286664,0.0018923644,0.00014612895,0.0012702364,0.0024853805,0.0013391597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015140267,0.0052976767,0.0052055367,0.0056600156,0.002135147,0.006639713,0.008321813,0.0074826237,0.012521557],"category_scores_gemma":[0.016891181,0.0018979359,0.0032064891,0.0047079166,0.001209297,0.004273943,0.0070309187,0.0065740896,0.016985286],"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.0011712274,0.0010322708,0.0018218126,0.0018135007,0.0007232737,0.00034475443,0.00018878521,0.016337581,0.010214603,0.002503402,0.5117603,0.45208848],"study_design_scores_gemma":[0.0014475033,0.0026351418,0.009527673,0.0008557309,0.0006809852,0.0024324444,0.00058023265,0.327899,0.040760044,0.035927184,0.5766237,0.0006303245],"about_ca_topic_score_codex":0.02274331,"about_ca_topic_score_gemma":0.022734009,"teacher_disagreement_score":0.02274331,"about_ca_system_score_codex":0.002261723,"about_ca_system_score_gemma":0.0058166143,"threshold_uncertainty_score":0.08007032},"labels":[],"label_agreement":null},{"id":"W4327770651","doi":"10.1007/978-3-031-27420-6_10","title":"A U-Net Convolutional Neural Network with Multiclass Dice Loss for Automated Segmentation of Tumors and Lymph Nodes from Head and Neck Cancer PET/CT Images","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dice; Segmentation; Computer science; Test set; Artificial intelligence; Convolutional neural network; Pattern recognition (psychology); Encoder; Head and neck; Medicine; Mathematics","score_opus":0.01221877756972753,"score_gpt":0.2889093639235616,"score_spread":0.27669058635383403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327770651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034725506,0.002137993,0.94861937,0.00047586317,0.00030283353,0.0001724916,0.00073903304,0.005946509,0.0068804147],"genre_scores_gemma":[0.253867,0.001468762,0.7041979,0.00058314245,0.00015862305,0.00022802694,0.0025386466,0.00048414702,0.036473848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.000025671727,0.000013125335,0.00006854829,0.00007900928,0.000041941268],"domain_scores_gemma":[0.99973875,0.00006713527,0.000014789917,0.000041524625,0.00011947698,0.000018233455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079664757,0.0008876383,0.0008002292,0.00063080864,0.0004782624,0.00075180805,0.0017699796,0.0013070268,0.0038129303],"category_scores_gemma":[0.00075977336,0.0005240116,0.0008117549,0.0006175578,0.00033700408,0.00084478647,0.0009806864,0.0010130135,0.0016278551],"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.00023936962,0.00017751935,0.0005203179,0.00011379391,0.00013396236,0.00010225129,0.000038046383,0.11688564,0.02112618,0.005216497,0.01594723,0.83949924],"study_design_scores_gemma":[0.0000059198887,0.00005063189,0.00025085206,0.000010838426,0.00002591532,0.000056014902,0.000005456362,0.98720646,0.009195723,0.0012094022,0.0019728767,0.0000098785185],"about_ca_topic_score_codex":0.017577106,"about_ca_topic_score_gemma":0.026983267,"teacher_disagreement_score":0.017577106,"about_ca_system_score_codex":0.0011249476,"about_ca_system_score_gemma":0.0012039543,"threshold_uncertainty_score":0.0349496},"labels":[],"label_agreement":null},{"id":"W4327770666","doi":"10.1007/978-3-031-27420-6_23","title":"Deep Learning and Machine Learning Techniques for Automated PET/CT Segmentation and Survival Prediction in Head and Neck Cancer","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Artificial intelligence; Segmentation; Computer science; Deep learning; Random forest; Image segmentation; Machine learning; Pattern recognition (psychology)","score_opus":0.015039465974612993,"score_gpt":0.30848395687472047,"score_spread":0.2934444909001075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327770666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020098973,0.019464098,0.9443673,0.0016362765,0.00043338884,0.00004699465,0.00084082433,0.0014348848,0.011677309],"genre_scores_gemma":[0.26745695,0.020806894,0.6466332,0.00070322107,0.0005967574,0.00012705891,0.0023260918,0.0004722768,0.060877524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998585,0.000021250036,0.000009562043,0.000032421915,0.000060129107,0.000018187773],"domain_scores_gemma":[0.9996867,0.00017595195,0.000019114026,0.000028423323,0.000080467995,0.000009425141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496522,0.0005854459,0.00045316282,0.0005887622,0.0001369282,0.00065892347,0.00071032846,0.00074965466,0.0034927889],"category_scores_gemma":[0.0010256374,0.0003888132,0.00057667523,0.00091492094,0.00029206424,0.00073472754,0.0005510821,0.0009927168,0.0012167692],"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.000052691496,0.000045040295,0.00062618376,0.00017623043,0.000046503497,0.00006151547,0.000032907337,0.07917894,0.008191117,0.009057661,0.01490535,0.887626],"study_design_scores_gemma":[0.000006592686,0.000058761885,0.0018583959,0.000081762795,0.000038049493,0.00022141528,0.000021202122,0.94261205,0.010788116,0.025040798,0.019248344,0.000024406474],"about_ca_topic_score_codex":0.003792432,"about_ca_topic_score_gemma":0.007825117,"teacher_disagreement_score":0.003792432,"about_ca_system_score_codex":0.00052576273,"about_ca_system_score_gemma":0.00048992416,"threshold_uncertainty_score":0.011684597},"labels":[],"label_agreement":null},{"id":"W4327771498","doi":"10.1007/978-3-031-27420-6_19","title":"Combining nnUNet and AutoML for Automatic Head and Neck Tumor Segmentation and Recurrence-Free Survival Prediction in PET/CT Images","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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 Toronto","funders":"","keywords":"Segmentation; Concordance; Head and neck; Computer science; Sørensen–Dice coefficient; Primary tumor; Medicine; Artificial intelligence; Radiology; Image segmentation; Metastasis; Surgery; Internal medicine; Cancer","score_opus":0.017141594213212496,"score_gpt":0.2916601097041119,"score_spread":0.2745185154908994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327771498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050572235,0.0047703856,0.8910739,0.0005831236,0.00059282273,0.00022370614,0.002729434,0.0437697,0.005684681],"genre_scores_gemma":[0.19538617,0.00150279,0.7751006,0.000719536,0.00035483824,0.00031310483,0.007935208,0.0031466007,0.015541251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914277,0.00014822948,0.00006351033,0.000309668,0.00022277572,0.00011310393],"domain_scores_gemma":[0.99923587,0.00030149193,0.000046850837,0.00012534563,0.00025620445,0.00003422852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021398773,0.0017177869,0.001700422,0.0023955181,0.0007198893,0.0020826051,0.001523853,0.0018867062,0.0055604065],"category_scores_gemma":[0.0019866298,0.00084419333,0.0016631925,0.0014943058,0.00034402584,0.001728625,0.0010995892,0.0009760127,0.005678918],"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.00035951735,0.00012462858,0.001969956,0.00019242238,0.00018969241,0.000117876756,0.000051031995,0.021724842,0.022507094,0.00075980334,0.013983029,0.93802005],"study_design_scores_gemma":[0.00004505797,0.00016679139,0.003075482,0.00005341497,0.0001518595,0.00031716106,0.00007225668,0.9534154,0.028027805,0.0030782316,0.011530436,0.00006609886],"about_ca_topic_score_codex":0.009934566,"about_ca_topic_score_gemma":0.0214264,"teacher_disagreement_score":0.009934566,"about_ca_system_score_codex":0.0008634745,"about_ca_system_score_gemma":0.0010239625,"threshold_uncertainty_score":0.019753516},"labels":[],"label_agreement":null},{"id":"W4327780894","doi":"10.1007/978-3-031-27420-6_22","title":"Head and Neck Tumor Segmentation with 3D UNet and Survival Prediction with Multiple Instance Neural Network","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Segmentation; Softmax function; Head and neck squamous-cell carcinoma; Computer science; Lymph node; Positron emission tomography; Medicine; Artificial intelligence; Head and neck cancer; Radiology; Artificial neural network; Radiation therapy; Internal medicine","score_opus":0.011300363624939901,"score_gpt":0.25475463167472057,"score_spread":0.24345426804978065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327780894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066372186,0.002642225,0.91912705,0.00054695696,0.00025330778,0.00014365946,0.002865268,0.0050084875,0.0030408867],"genre_scores_gemma":[0.4473201,0.0017402017,0.53438586,0.0002895457,0.00024142019,0.00023146992,0.004962863,0.0005949446,0.010233622],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997682,0.000023144024,0.000016921229,0.00009673685,0.00005985154,0.00003520007],"domain_scores_gemma":[0.9997639,0.000086502696,0.000030392826,0.000040610408,0.000064541404,0.000013967779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763782,0.0009122512,0.0012064651,0.0013327085,0.00029133674,0.0011741242,0.0014162146,0.0014519431,0.002025716],"category_scores_gemma":[0.00091524835,0.0007095456,0.0017475322,0.0012771842,0.00027661404,0.0007007722,0.0008166583,0.00087561994,0.0013236798],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022616528,0.00010033074,0.005478401,0.00012540471,0.00016315134,0.0002551823,0.000056277982,0.20466276,0.014622958,0.0016890971,0.008981373,0.76363885],"study_design_scores_gemma":[0.000002734881,0.000019151204,0.0012306174,0.000009523087,0.000025800862,0.00012517365,0.000009778205,0.9928758,0.0035916201,0.0011517768,0.0009475757,0.000010318638],"about_ca_topic_score_codex":0.010926619,"about_ca_topic_score_gemma":0.015274828,"teacher_disagreement_score":0.010926619,"about_ca_system_score_codex":0.0006701752,"about_ca_system_score_gemma":0.0007435374,"threshold_uncertainty_score":0.021726012},"labels":[],"label_agreement":null},{"id":"W43281984","doi":"10.1007/978-3-642-38088-4_28","title":"Formalization of Infinite Dimension Linear Spaces with Application to Quantum Theory","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Concordia University","funders":"","keywords":"Computer science; Dimension (graph theory); Quantum; Theoretical computer science; Algebra over a field; Algorithm; Mathematics; Pure mathematics; Quantum mechanics; Physics","score_opus":0.006085162571793249,"score_gpt":0.22523994609967782,"score_spread":0.21915478352788456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43281984","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.02781456,0.0024436093,0.88692933,0.0028681953,0.0005313456,0.00005551674,0.00029138944,0.00040469583,0.078661285],"genre_scores_gemma":[0.7187147,0.002209576,0.24315855,0.0010508767,0.0013471807,0.00026660482,0.0005102565,0.0004030941,0.032339234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884987,0.0004397844,0.00009638254,0.00017130212,0.00031009727,0.00013259945],"domain_scores_gemma":[0.99832195,0.00090130494,0.00011642182,0.00018770428,0.00034382683,0.00012885676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016426381,0.0007745723,0.0007770786,0.0018321554,0.0014681555,0.003483754,0.001532347,0.0010809493,0.0074946424],"category_scores_gemma":[0.0026878435,0.0005681284,0.0016047026,0.0013674586,0.005643479,0.0057862177,0.0031945505,0.0036857456,0.0009244164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024117426,0.000004365403,0.000010939907,0.00001050188,0.0000014956039,0.000012137433,0.000059038244,0.0003395321,0.00010141115,0.9980761,0.00026711932,0.0011149095],"study_design_scores_gemma":[0.000004372732,0.0000049953787,0.000020605006,0.000008939645,0.0000024985554,0.000023782512,0.000027628135,0.0038315242,0.00013439661,0.99267006,0.0032657043,0.0000055532137],"about_ca_topic_score_codex":0.0010962872,"about_ca_topic_score_gemma":0.00093251205,"teacher_disagreement_score":0.0074946424,"about_ca_system_score_codex":0.0021837645,"about_ca_system_score_gemma":0.00086498976,"threshold_uncertainty_score":0.025072038},"labels":[],"label_agreement":null},{"id":"W43407050","doi":"10.1007/978-3-319-10470-6_41","title":"Efficient Multi-organ Segmentation in Multi-view Endoscopic Videos Using Pre-operative Priors","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Computer science; Artificial intelligence; Computer vision; Segmentation; Robustness (evolution); Prior probability","score_opus":0.01699336664484452,"score_gpt":0.2750242345100473,"score_spread":0.2580308678652028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43407050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010620579,0.00037271713,0.9875279,0.00012294413,0.000019103427,0.000023914448,0.00009923851,0.0006639429,0.00054975046],"genre_scores_gemma":[0.26972368,0.0012320699,0.7244414,0.00015411018,0.00011263657,0.00011497968,0.000853659,0.0005649433,0.0028024847],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971014,0.00005484252,0.000018621506,0.00006746974,0.00010049147,0.000048473787],"domain_scores_gemma":[0.9993451,0.00033825592,0.00008881867,0.000083618965,0.00009725943,0.000046850684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065512944,0.0010195412,0.0011009297,0.001094838,0.0003270647,0.0012703049,0.001076832,0.0015824459,0.0017908309],"category_scores_gemma":[0.0021034752,0.00116003,0.0012204017,0.0009216027,0.00038792554,0.0012440634,0.0013162538,0.0014562905,0.0010485987],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008241477,0.00014287789,0.0016004497,0.00048160375,0.00015595349,0.00041657,0.00017247617,0.3035489,0.13656695,0.004563816,0.0039823265,0.5475439],"study_design_scores_gemma":[0.000013364126,0.000057238332,0.0011781788,0.00002965501,0.000034377128,0.00033356398,0.000029925759,0.97588444,0.018074093,0.003009245,0.0013328958,0.000023007586],"about_ca_topic_score_codex":0.0031025328,"about_ca_topic_score_gemma":0.0059537156,"teacher_disagreement_score":0.0031025328,"about_ca_system_score_codex":0.00038371715,"about_ca_system_score_gemma":0.0011923255,"threshold_uncertainty_score":0.0061689615},"labels":[],"label_agreement":null},{"id":"W4352994281","doi":"10.1007/978-3-031-25549-6_3","title":"Efficient Deep Reinforcement Learning via Policy-Extended Successor Feature Approximator","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Successor cardinal; Reinforcement learning; Computer science; Artificial intelligence; Generalization; Generalizability theory; Representation (politics); Decoupling (probability); Feature learning; Machine learning; Task (project management); Policy learning; Feature (linguistics); Mathematics","score_opus":0.013348182838903204,"score_gpt":0.25064532749151375,"score_spread":0.23729714465261054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4352994281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016185777,0.0003135743,0.97923136,0.00016941427,0.00008473618,0.00003313396,0.000044797893,0.0009460963,0.0029910468],"genre_scores_gemma":[0.82950586,0.00015793098,0.16381338,0.00013544672,0.00005221927,0.00012639274,0.0001278224,0.00012116683,0.0059597986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996886,0.00006434457,0.000017515478,0.000073459065,0.000092152106,0.00006398274],"domain_scores_gemma":[0.9992582,0.00042990508,0.000056149816,0.000088719346,0.00012515622,0.00004181683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008468799,0.0006441115,0.001236528,0.0002778211,0.0003027889,0.0007618179,0.001292194,0.0011199655,0.00412077],"category_scores_gemma":[0.002058628,0.0005064363,0.00035855675,0.00034804258,0.00063305936,0.0009186539,0.0012982578,0.0017528564,0.0006876234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018338172,0.00012673586,0.00036638923,0.00007869209,0.000034435252,0.00007237656,0.0000358141,0.7883933,0.003542497,0.015219118,0.0028821835,0.1890651],"study_design_scores_gemma":[0.0000055903824,0.000010381875,0.000016909884,0.0000018173978,0.0000017811128,0.000005240022,9.71207e-7,0.99796367,0.0002319319,0.0016605465,0.00009987099,0.000001353177],"about_ca_topic_score_codex":0.004918677,"about_ca_topic_score_gemma":0.0059142555,"teacher_disagreement_score":0.004918677,"about_ca_system_score_codex":0.00084576505,"about_ca_system_score_gemma":0.0014356825,"threshold_uncertainty_score":0.013785362},"labels":[],"label_agreement":null},{"id":"W4360778257","doi":"10.1007/978-3-031-28469-4_12","title":"Cyrus2D Base: Source Code Base for RoboCup 2D Soccer Simulation League","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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; Dalhousie University","funders":"","keywords":"League; Computer science; Offensive; Base (topology); Code (set theory); Champion; Base station; Artificial intelligence; Field (mathematics); Operating system; Operations research; Programming language; Engineering","score_opus":0.05527145403281048,"score_gpt":0.255475284590371,"score_spread":0.20020383055756052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360778257","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006953623,0.00062768534,0.20252451,0.00029901444,0.0005697771,0.00061842974,0.13407032,0.5894737,0.064862914],"genre_scores_gemma":[0.06916949,0.0010142162,0.14498623,0.0008556095,0.00017494078,0.0021665478,0.3394017,0.37441272,0.06781864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996202,0.000034972032,0.000034750083,0.00007244349,0.00017411068,0.00006349331],"domain_scores_gemma":[0.9992423,0.00018967655,0.00003437526,0.00008834712,0.0003590422,0.00008626106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051180035,0.0023638287,0.0008128998,0.001639749,0.0005783756,0.0016100269,0.0034198752,0.001111747,0.1910572],"category_scores_gemma":[0.0029136173,0.001473228,0.0013739001,0.0011978243,0.00036083642,0.0011967038,0.0019226703,0.0019318021,0.110894874],"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.00039445426,0.00013993589,0.001799178,0.0009052591,0.00012410893,0.0002899326,0.00018291628,0.02577469,0.0051432652,0.0055456907,0.88672656,0.07297405],"study_design_scores_gemma":[0.00082852924,0.00009969167,0.0025956351,0.00038259578,0.000089330664,0.00033221752,0.0000960992,0.18193653,0.020833222,0.009779322,0.7828504,0.00017647725],"about_ca_topic_score_codex":0.011404209,"about_ca_topic_score_gemma":0.014831377,"teacher_disagreement_score":0.1910572,"about_ca_system_score_codex":0.00091688964,"about_ca_system_score_gemma":0.0015045188,"threshold_uncertainty_score":0.63915},"labels":[],"label_agreement":null},{"id":"W4360982002","doi":"10.1007/978-3-031-26419-1","title":"Machine Learning and Knowledge Discovery in Databases","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":24,"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":"Microsoft Research Asia; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Insight SFI Research Centre for Data Analytics; Région Normandie; Stockholms Universitet; University of Science and Technology of China; Univerza v Ljubljani; University of Alberta; Korea Advanced Institute of Science and Technology; Harokopio University; Scuola IMT Alti Studi Lucca; Università di Pisa; Central European Institute of Technology; Universidad de Oviedo; Université Grenoble Alpes; Universität Bielefeld; Ludwig-Maximilians-Universität München; College of Engineering, Michigan State University; University of Wyoming; Danmarks Tekniske Universitet; Temple University; Universiteit Utrecht; Nankai University; Centre National de la Recherche Scientifique; Universiteit Gent; Sapienza Università di Roma; Technische Universität Wien; Universita degli Studi di Bari Aldo Moro; Université de Caen Normandie; Politechnika Poznańska; Masdar Institute of Science and Technology; Microsoft Research; Institut National Polytechnique de Toulouse; King Abdulaziz University; National and Kapodistrian University of Athens; Johannes Gutenberg-Universität Mainz; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Euskal Herriko Unibertsitatea; Albert-Ludwigs-Universität Freiburg; Dalhousie University; University of Waikato; Universidad de Zaragoza; Shanghai Educational Development Foundation; Chalmers Tekniska Högskola; Rijksuniversiteit Groningen; Aalborg Universitet; Abu Dhabi National Oil Company; University of Texas at Dallas; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; Sun Yat-sen University; Technische Universität München; Institut National des Sciences Appliquées de Lyon; Università degli Studi di Milano-Bicocca; Tsinghua University; Chinese Academy of Sciences; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Minnesota; Monash University; Julius-Maximilians-Universität Würzburg; University of Technology Sydney; KU Leuven; University of New South Wales; Gottfried Wilhelm Leibniz Universität Hannover; Aix-Marseille Université; Universiteit Leiden; University of Texas at San Antonio; Indian Council of Agricultural Research; Jilin University; National University of Singapore; Indian Institute of Technology Palakkad; Commonwealth Scientific and Industrial Research Organisation; Universiti Kuala Lumpur; Helsingin Yliopisto; Deakin University; Blekinge Tekniska Högskola; Beihang University; University of Twente; University of Bristol; University of Oxford; Southeast University; Kungliga Tekniska Högskolan; Ulster University; Universidade do Porto; Indian Institute of Technology, Patna; Carl von Ossietzky Universität Oldenburg; Itä-Suomen Yliopisto; Shandong University; Politechnika Warszawska; Université Bretagne Sud; Universidad de Córdoba; Institut \"Jožef Stefan\"; Université Catholique de Louvain; Politecnico di Torino; Indian National Science Academy; Università degli Studi di Milano; Purdue University; Università degli Studi di Trento; Michigan State University; Università degli Studi di Cagliari; Georgia State University; Deutsches Krebsforschungszentrum; University of Ottawa; Syracuse University; Masarykova Univerzita; Universiteit van Amsterdam; Aristotle University of Thessaloniki; University College Dublin","keywords":"Computer science; Knowledge extraction; Database; Artificial intelligence; Information retrieval","score_opus":0.024445144512082982,"score_gpt":0.2906166420676732,"score_spread":0.2661714975555902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360982002","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.004635329,0.2597681,0.5984489,0.007553297,0.0043354067,0.0003002367,0.0020280518,0.0021767137,0.12075399],"genre_scores_gemma":[0.045371886,0.18120953,0.545715,0.0030710488,0.00414011,0.0004037424,0.005208564,0.00074222067,0.21413797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990596,0.00018952906,0.00008884657,0.00014249772,0.00048671025,0.000032737204],"domain_scores_gemma":[0.9975062,0.0018472255,0.00008280166,0.000264167,0.00023900918,0.000060690996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223477,0.00084265234,0.0016497052,0.0025552816,0.00051248306,0.004103264,0.0014350653,0.00085436105,0.014226699],"category_scores_gemma":[0.0043096617,0.00067518523,0.00084276235,0.0071022473,0.0011092684,0.0057409825,0.0014138771,0.0020989408,0.00938921],"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.00006038981,0.000083153915,0.00043509618,0.0018632549,0.000103939026,0.00014537957,0.00015794489,0.0046024676,0.0012510429,0.15520544,0.13710928,0.69898266],"study_design_scores_gemma":[0.000027743301,0.000046173507,0.0008203212,0.00061908335,0.0000770086,0.00085935474,0.000112455564,0.027553957,0.0016254168,0.3994712,0.5687559,0.000031399497],"about_ca_topic_score_codex":0.00083954394,"about_ca_topic_score_gemma":0.00080515514,"teacher_disagreement_score":0.014226699,"about_ca_system_score_codex":0.0007953959,"about_ca_system_score_gemma":0.0008812106,"threshold_uncertainty_score":0.047593057},"labels":[],"label_agreement":null},{"id":"W4360982046","doi":"10.1007/978-3-031-26419-1_35","title":"Cubism: Co-balanced Mixup for Unsupervised Volcano-Seismic Knowledge Transfer","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Seismology and Earthquake Studies","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; Burnaby Hospital","funders":"","keywords":"Volcano; Computer science; Seismology; Artificial intelligence; Domain knowledge; Geology; Machine learning; Data mining","score_opus":0.029990221713195358,"score_gpt":0.26840015533331835,"score_spread":0.238409933620123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360982046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003872302,0.0003220158,0.97678375,0.00011481806,0.00008403842,0.00009205658,0.0007792687,0.01676161,0.0011901606],"genre_scores_gemma":[0.09327965,0.0003500328,0.88544923,0.00030417144,0.00012807427,0.0005614934,0.0062921806,0.0028411297,0.010794047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907196,0.00018125409,0.00006721775,0.00032015907,0.0002475572,0.00011187803],"domain_scores_gemma":[0.9984396,0.0007872433,0.0000617953,0.00040761486,0.00022424816,0.0000794873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016607211,0.0020728714,0.0019540454,0.0017176226,0.0010246333,0.0021513219,0.0039342768,0.0023761166,0.017609594],"category_scores_gemma":[0.0042159404,0.001335963,0.0017585302,0.0023847893,0.0008528076,0.0038552117,0.0055572856,0.0026794688,0.008649888],"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.000878438,0.00024785442,0.00049236254,0.00028536058,0.000260405,0.00014783532,0.00011925302,0.07827954,0.009549718,0.009304896,0.030824518,0.8696098],"study_design_scores_gemma":[0.00004687447,0.000058894937,0.00015295355,0.00002056652,0.000035197165,0.000057674897,0.00004330717,0.9638679,0.008547176,0.019904014,0.0072407136,0.000024857953],"about_ca_topic_score_codex":0.0077273184,"about_ca_topic_score_gemma":0.0125879245,"teacher_disagreement_score":0.017609594,"about_ca_system_score_codex":0.00081739796,"about_ca_system_score_gemma":0.0016878558,"threshold_uncertainty_score":0.058909953},"labels":[],"label_agreement":null},{"id":"W4360982396","doi":"10.1007/978-3-031-26422-1_36","title":"Logistics, Graphs, and Transformers: Towards Improving Travel Time Estimation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Transformer; Architecture; Travel time; Estimation; Operations research; Industrial engineering; Real-time computing; Data science; Artificial intelligence; Transport engineering; Systems engineering; Electrical engineering; Geography; Mathematics","score_opus":0.012108280124545305,"score_gpt":0.21385973683237203,"score_spread":0.2017514567078267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360982396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011319958,0.000679244,0.9849091,0.00019295499,0.000084361745,0.000016023443,0.00025044548,0.0009856094,0.0015622345],"genre_scores_gemma":[0.37726685,0.0040709306,0.6104403,0.00019504486,0.00029432913,0.000047017784,0.0014753534,0.0007613116,0.0054488275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.00015692471,0.000020215042,0.000109091656,0.00012000918,0.00003376741],"domain_scores_gemma":[0.99837804,0.000848054,0.000117012416,0.00029743984,0.0003046552,0.000054806118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007191724,0.0011393027,0.0008060137,0.0018284668,0.0002250899,0.0014478886,0.0010105993,0.0005364451,0.0031336662],"category_scores_gemma":[0.0059513687,0.0005421979,0.000628056,0.0036827421,0.00047409537,0.003057132,0.0009339356,0.0011767313,0.0014514993],"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.0001899371,0.00008356894,0.0045185625,0.00020516671,0.000080558224,0.000045989073,0.00009413101,0.35263446,0.0037284167,0.03155449,0.009064158,0.59780055],"study_design_scores_gemma":[0.00001247297,0.000037861315,0.0008260126,0.000022359807,0.000035266938,0.000048734048,0.000045974655,0.9308596,0.0017494044,0.060785647,0.005560998,0.000015749294],"about_ca_topic_score_codex":0.009703054,"about_ca_topic_score_gemma":0.00875416,"teacher_disagreement_score":0.009703054,"about_ca_system_score_codex":0.00045382074,"about_ca_system_score_gemma":0.00095383753,"threshold_uncertainty_score":0.01929313},"labels":[],"label_agreement":null},{"id":"W4360982798","doi":"10.1007/978-3-031-26422-1_48","title":"ImbalancedLearningRegression - A Python Package to Tackle the Imbalanced Regression Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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 Ottawa","funders":"","keywords":"Python (programming language); Computer science; Regression; Machine learning; Regression analysis; Artificial intelligence; R package; Extensibility; Source code; Programming language; Data mining; Statistics; Mathematics","score_opus":0.021747517430019972,"score_gpt":0.27800159908360444,"score_spread":0.2562540816535845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360982798","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036607897,0.0003351587,0.6789937,0.00032368867,0.00041729555,0.00023010398,0.014412768,0.29689136,0.0047351285],"genre_scores_gemma":[0.030105975,0.00048911484,0.811833,0.001012347,0.00032281596,0.0014140407,0.03909971,0.08779834,0.027924728],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861026,0.00024120028,0.00009836514,0.0003264473,0.0005695884,0.00015408797],"domain_scores_gemma":[0.99828714,0.0008777673,0.00012097672,0.00036475758,0.00026813455,0.000081171915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129515,0.0019259469,0.0016222046,0.0016628214,0.00083615846,0.0016739531,0.003085506,0.001061495,0.045201123],"category_scores_gemma":[0.00871655,0.0015774717,0.002215092,0.0019441907,0.00044760716,0.0019181963,0.002977782,0.004076138,0.04401629],"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.00034067078,0.00033423302,0.0041586272,0.0008197012,0.00035500622,0.00027491446,0.00022533012,0.023972623,0.008157124,0.010873129,0.53530765,0.415181],"study_design_scores_gemma":[0.00034026415,0.00016642595,0.004773436,0.00021207948,0.00021043386,0.0005964354,0.00008916434,0.57683975,0.038462,0.05764017,0.32047987,0.00018995948],"about_ca_topic_score_codex":0.0020873584,"about_ca_topic_score_gemma":0.0047885887,"teacher_disagreement_score":0.045201123,"about_ca_system_score_codex":0.0004657331,"about_ca_system_score_gemma":0.001920174,"threshold_uncertainty_score":0.15121281},"labels":[],"label_agreement":null},{"id":"W4360985725","doi":"10.1007/978-3-031-26422-1_8","title":"Banksformer: A Deep Generative Model for Synthetic Transaction Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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":"Queen's University; Verafin (Canada); Memorial University of Newfoundland","funders":"","keywords":"Computer science; Synthetic data; Database transaction; Timestamp; Transaction data; Generative model; Key (lock); Data mining; Code (set theory); Artificial intelligence; Generative grammar; Database; Programming language; Real-time computing; Set (abstract data type)","score_opus":0.04502336997509216,"score_gpt":0.23129195653368065,"score_spread":0.1862685865585885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360985725","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.010266648,0.0003512305,0.97934794,0.00043193976,0.00011397572,0.00005324723,0.0018101252,0.0059222467,0.0017026037],"genre_scores_gemma":[0.4423999,0.0012728351,0.51475626,0.0010403593,0.00030350045,0.0006109812,0.009920587,0.0030394057,0.026656218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997149,0.0001008666,0.000012973389,0.00008104874,0.000058052607,0.000032144253],"domain_scores_gemma":[0.998953,0.00070671923,0.000044882963,0.00014638745,0.0000903263,0.000058624795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440482,0.0009064988,0.0009934627,0.00068814063,0.00034054718,0.0012702027,0.002499117,0.0020607342,0.01204636],"category_scores_gemma":[0.0036933862,0.0012240718,0.001266518,0.0009244666,0.0006154229,0.0016484226,0.0015636948,0.002817871,0.004460454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027977888,0.000097109456,0.0014457336,0.000091773276,0.00014381633,0.00016505946,0.000092721275,0.8164985,0.003469079,0.030000925,0.01705743,0.13065803],"study_design_scores_gemma":[0.000009759172,0.000006783404,0.000057224577,0.0000037793657,0.000005044792,0.000014783331,0.000002090379,0.9908506,0.00033562086,0.007920954,0.0007888497,0.000004504617],"about_ca_topic_score_codex":0.008908327,"about_ca_topic_score_gemma":0.015410743,"teacher_disagreement_score":0.01204636,"about_ca_system_score_codex":0.0009862911,"about_ca_system_score_gemma":0.0010862107,"threshold_uncertainty_score":0.040299118},"labels":[],"label_agreement":null},{"id":"W4360985784","doi":"10.1007/978-3-031-26422-1","title":"Machine Learning and Knowledge Discovery in Databases","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; Instituto Superior Técnico; Leibniz-Gemeinschaft; Microsoft Research Asia; University of California, Riverside; University of Illinois at Urbana-Champaign; Insight SFI Research Centre for Data Analytics; Région Normandie; Technische Universität Dortmund; Basque Center for Applied Mathematics; Universität Kassel; Stockholms Universitet; University of Science and Technology of China; Shenzhen University; Zhejiang University of Technology; Rheinische Friedrich-Wilhelms-Universität Bonn; Southeast University; Nanjing University; Universidade Federal de Minas Gerais; Aristotle University of Thessaloniki; Universidad de Oviedo; Universitat de Barcelona; Ludwig-Maximilians-Universität München; Université de Liège; Turun Yliopisto; National and Kapodistrian University of Athens; Universiteit Utrecht; Temple University; Nankai University; Universidade Federal de Uberlândia; Centre National de la Recherche Scientifique; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Université de Caen Normandie; Umeå Universitet; Politechnika Poznańska; University of Southern California; Masdar Institute of Science and Technology; Gottfried Wilhelm Leibniz Universität Hannover; Universität Potsdam; Universitetet i Stavanger; King Abdulaziz University; University of Oxford; King Abdullah University of Science and Technology; Università degli Studi di Trento; Harokopio University; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Linköpings Universitet; Università degli Studi di Padova; Euskal Herriko Unibertsitatea; Universität Wien; Dalhousie University; Abu Dhabi National Oil Company; Humboldt-Universität zu Berlin; Sun Yat-sen University; Institut National des Sciences Appliquées de Lyon; Università degli Studi di Milano-Bicocca; Tsinghua University; Chinese Academy of Sciences; Masarykova Univerzita; Universiteit van Amsterdam; Central European Institute of Technology; University of South Australia; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; University of Technology Sydney; Itä-Suomen Yliopisto; Eberhard Karls Universität Tübingen; Aix-Marseille Université; Universiteit Leiden; University College Cork; Université de La Réunion; Brown University; Jilin University; National University of Singapore; Indian Institute of Technology Palakkad; Commonwealth Scientific and Industrial Research Organisation; Institut National des Sciences Appliquées Rouen; Danmarks Tekniske Universitet; Shenzhen Technology University; Sorbonne Université; Kungliga Tekniska Högskolan; Ulster University; Universidade do Porto; Utah State University; Indian Institute of Technology, Patna; Beihang University; University of Twente; University of Bristol; University of Macedonia; Shandong University; Politechnika Warszawska; Université Bretagne Sud; Institut \"Jožef Stefan\"; University College London; Universität Passau; Deakin University; Universiti Kuala Lumpur; Helsingin Yliopisto; Arizona State University; Università degli Studi di Cagliari; Université Catholique de Louvain; Politecnico di Torino; Universität Bielefeld; Université Grenoble Alpes; Peking University; KU Leuven; Kyungpook National University; University of New South Wales; National University of Ireland; Institut National Polytechnique de Toulouse; Microsoft Research; Högskolan i Halmstad; University of Alberta; Università degli Studi di Napoli Federico II; New Mexico State University; Università degli Studi di Milano; Université du Luxembourg; Universidad de Zaragoza; University of Waikato; Georgia State University; University of Texas at San Antonio; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; University of Galway; Beijing Normal University; Philipps-Universität Marburg; Georgia Institute of Technology; Technische Universiteit Eindhoven; University of Ottawa; Indian National Science Academy; Universita degli Studi di Bari Aldo Moro; Université de Neuchâtel; University College Dublin; Université de Lyon; Yonsei University","keywords":"Computer science; Knowledge extraction; Database; Artificial intelligence; Information retrieval","score_opus":0.024445144512082982,"score_gpt":0.2906166420676732,"score_spread":0.2661714975555902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360985784","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635329,0.2597681,0.5984489,0.007553297,0.0043354067,0.0003002367,0.0020280518,0.0021767137,0.12075399],"genre_scores_gemma":[0.045371886,0.18120953,0.545715,0.0030710488,0.00414011,0.0004037424,0.005208564,0.00074222067,0.21413797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990596,0.00018952906,0.00008884657,0.00014249772,0.00048671025,0.000032737204],"domain_scores_gemma":[0.9975062,0.0018472255,0.00008280166,0.000264167,0.00023900918,0.000060690996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223477,0.00084265234,0.0016497052,0.0025552816,0.00051248306,0.004103264,0.0014350653,0.00085436105,0.014226699],"category_scores_gemma":[0.0043096617,0.00067518523,0.00084276235,0.0071022473,0.0011092684,0.0057409825,0.0014138771,0.0020989408,0.00938921],"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.00006038981,0.000083153915,0.00043509618,0.0018632549,0.000103939026,0.00014537957,0.00015794489,0.0046024676,0.0012510429,0.15520544,0.13710928,0.69898266],"study_design_scores_gemma":[0.000027743301,0.000046173507,0.0008203212,0.00061908335,0.0000770086,0.00085935474,0.000112455564,0.027553957,0.0016254168,0.3994712,0.5687559,0.000031399497],"about_ca_topic_score_codex":0.00083954394,"about_ca_topic_score_gemma":0.00080515514,"teacher_disagreement_score":0.014226699,"about_ca_system_score_codex":0.0007953959,"about_ca_system_score_gemma":0.0008812106,"threshold_uncertainty_score":0.047593057},"labels":[],"label_agreement":null},{"id":"W4361759320","doi":"10.1007/978-3-031-28996-5_3","title":"Practical and Secure Federated Recommendation with Personalized Mask","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Recommender system; Personalization; Cryptography; Matrix decomposition; Computer security; Information retrieval; World Wide Web","score_opus":0.04527433087333731,"score_gpt":0.2963128844159057,"score_spread":0.2510385535425684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361759320","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.027976526,0.00044518986,0.95855534,0.00052782916,0.00018227097,0.00018089464,0.00055349106,0.004404817,0.007173638],"genre_scores_gemma":[0.60267395,0.00034688794,0.3745281,0.00033218137,0.00019842305,0.00019712276,0.0009984424,0.00023075126,0.020494036],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954066,0.00091204053,0.0002989763,0.00095441117,0.0017298891,0.00069809234],"domain_scores_gemma":[0.99400276,0.0008629643,0.00016973226,0.004300197,0.0005201043,0.00014437846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019801464,0.00095057243,0.0018277715,0.0007916216,0.0017636963,0.0027554138,0.0025723786,0.0023894473,0.006808686],"category_scores_gemma":[0.005976108,0.0006790361,0.001495164,0.0017326609,0.0011246529,0.005036243,0.003408027,0.0020548757,0.0034045517],"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.0030634394,0.0007103872,0.0028980284,0.00035962614,0.00039426,0.00086096156,0.00040624719,0.13873291,0.029027812,0.28617817,0.036136474,0.5012316],"study_design_scores_gemma":[0.000108035885,0.00014371735,0.00045367057,0.000028315822,0.000084853666,0.0008211814,0.000079465804,0.82775724,0.014386065,0.14763728,0.00843556,0.00006462657],"about_ca_topic_score_codex":0.002696298,"about_ca_topic_score_gemma":0.0029488422,"teacher_disagreement_score":0.006808686,"about_ca_system_score_codex":0.0012502683,"about_ca_system_score_gemma":0.0024914297,"threshold_uncertainty_score":0.022777379},"labels":[],"label_agreement":null},{"id":"W4361760461","doi":"10.1007/978-3-031-29689-5_5","title":"Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key encapsulation; Computer science; Cryptography; NIST; Theoretical computer science; Encryption; Public-key cryptography; Post-quantum cryptography; McEliece cryptosystem; Algorithm; Computer engineering; Symmetric-key algorithm; Computer security","score_opus":0.023902914797538918,"score_gpt":0.2659791799049679,"score_spread":0.24207626510742897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361760461","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.0387966,0.00022497681,0.94165826,0.00016046979,0.000185621,0.00019094243,0.00011084243,0.010737415,0.007935014],"genre_scores_gemma":[0.6428786,0.00020589461,0.3433112,0.00023514216,0.00007511647,0.00032489703,0.0004202806,0.0013945265,0.011154424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911743,0.00012441972,0.00008090836,0.000101017846,0.00041318408,0.00016311376],"domain_scores_gemma":[0.9985837,0.00031295547,0.00009903061,0.0006449618,0.00029872588,0.000060763043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680162,0.00052564393,0.0006725489,0.0007927219,0.0005863475,0.0017406712,0.0017262733,0.0009382725,0.00485333],"category_scores_gemma":[0.002403603,0.00047151741,0.0006528258,0.0006960084,0.00075663434,0.0017136649,0.0021847186,0.0012066955,0.002225509],"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.0011940015,0.00034832078,0.0015523251,0.00070339016,0.00019115677,0.00073652045,0.000792364,0.026511936,0.2184334,0.40352398,0.016104193,0.3299085],"study_design_scores_gemma":[0.0003351214,0.0005719268,0.0010712803,0.00015322445,0.00016257088,0.0011493172,0.000120761804,0.44801483,0.3842318,0.09996926,0.064026564,0.00019340213],"about_ca_topic_score_codex":0.000488446,"about_ca_topic_score_gemma":0.00050874753,"teacher_disagreement_score":0.00485333,"about_ca_system_score_codex":0.0006379915,"about_ca_system_score_gemma":0.00090216985,"threshold_uncertainty_score":0.016236007},"labels":[],"label_agreement":null},{"id":"W4361763603","doi":"10.1007/978-3-031-28996-5","title":"Trustworthy Federated Learning","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Trustworthiness; World Wide Web; Computer security","score_opus":0.02524916054775569,"score_gpt":0.2672549746353287,"score_spread":0.24200581408757302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361763603","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.015666597,0.00082755164,0.9581892,0.0012533419,0.0002505711,0.000089087436,0.00026909594,0.0027402628,0.02071433],"genre_scores_gemma":[0.6318981,0.00096411444,0.30623743,0.00046287727,0.0003141331,0.00020490623,0.001078092,0.00047707555,0.058363274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642247,0.0008973781,0.00021354802,0.00066756096,0.0014077646,0.00039119588],"domain_scores_gemma":[0.9903931,0.002456856,0.00031021304,0.0058484143,0.000736363,0.00025511373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032330654,0.0005924315,0.0011077336,0.0009802034,0.0014370367,0.003285393,0.0018252113,0.0017418517,0.00894027],"category_scores_gemma":[0.010588128,0.00051468005,0.00078400224,0.0012623378,0.001852861,0.0067945286,0.0059705023,0.0031280792,0.0031338613],"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.0007705786,0.00025023575,0.0011341826,0.00014462328,0.0000803918,0.00019532775,0.00033523075,0.07262407,0.0028054288,0.38608736,0.018721651,0.51685095],"study_design_scores_gemma":[0.000030189962,0.00007617594,0.00032316856,0.00006741159,0.00002327133,0.0002720047,0.000092295326,0.37926278,0.0066765235,0.59231085,0.020839553,0.000025831092],"about_ca_topic_score_codex":0.0010270115,"about_ca_topic_score_gemma":0.0010330373,"teacher_disagreement_score":0.00894027,"about_ca_system_score_codex":0.0015172954,"about_ca_system_score_gemma":0.002018084,"threshold_uncertainty_score":0.02990824},"labels":[],"label_agreement":null},{"id":"W4361767974","doi":"10.1007/978-3-031-29573-7_4","title":"Phenotype Search Trajectory Networks for Linear Genetic Programming","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Phenotype; Genetic programming; Trajectory; Graph; Genotype-phenotype distinction; Theoretical computer science; Artificial intelligence; Biology; Gene; Genetics","score_opus":0.029315099092381978,"score_gpt":0.27389622426426324,"score_spread":0.24458112517188127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361767974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066282637,0.00038774958,0.9783999,0.00029991296,0.000058518486,0.0000436637,0.000080489015,0.00020258225,0.013898917],"genre_scores_gemma":[0.3628059,0.0013604575,0.58335626,0.00026169815,0.00010092601,0.000671662,0.0004557229,0.00043653746,0.05055085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998323,0.0000668328,0.000006260248,0.000032035186,0.000045542598,0.000016962773],"domain_scores_gemma":[0.9995622,0.00030440977,0.00003099347,0.000025064639,0.000057443165,0.000019842893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547015,0.0006168728,0.00059715577,0.00055192364,0.00040145326,0.0008966903,0.0011592971,0.0011127113,0.009581619],"category_scores_gemma":[0.0026349376,0.00040329545,0.0004687032,0.0008605878,0.0007011714,0.0009586812,0.0011758019,0.00154513,0.0011171295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019911944,0.000018883364,0.0001256731,0.00004774341,0.000012395495,0.000025185393,0.000037747694,0.854739,0.00058430416,0.08935725,0.0016898116,0.053342044],"study_design_scores_gemma":[0.000002716771,0.000005857468,0.000020389174,0.000009177116,0.0000017526411,0.000005850238,0.0000044022668,0.97036,0.00010022361,0.0286306,0.0008569845,0.0000019960394],"about_ca_topic_score_codex":0.0051887827,"about_ca_topic_score_gemma":0.004664038,"teacher_disagreement_score":0.009581619,"about_ca_system_score_codex":0.0013230313,"about_ca_system_score_gemma":0.0007242599,"threshold_uncertainty_score":0.03205371},"labels":[],"label_agreement":null},{"id":"W4361770952","doi":"10.1007/978-3-031-29573-7_9","title":"A Boosting Approach to Constructing an Ensemble Stack","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Boosting (machine learning); Computer science; Residual; Interpretability; Genetic programming; Ensemble learning; Benchmarking; Machine learning; Artificial intelligence; Classifier (UML); Data mining; Algorithm","score_opus":0.03509581858218008,"score_gpt":0.2648130078073741,"score_spread":0.22971718922519402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361770952","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.003633175,0.00021155865,0.99338806,0.0000650392,0.00005673578,0.000028654295,0.000033016826,0.0003796195,0.0022041101],"genre_scores_gemma":[0.1266528,0.00046439408,0.86246675,0.00021701337,0.00023312107,0.00017820585,0.00035671348,0.0003662724,0.009064681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990007,0.00026385425,0.000054520744,0.000171992,0.00038531894,0.00012355791],"domain_scores_gemma":[0.99859756,0.00049958826,0.00005277245,0.00025925442,0.00050559686,0.00008523082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023793401,0.00092513143,0.0015943456,0.0013100405,0.0011229255,0.0014930661,0.0028661992,0.0017461035,0.0049158116],"category_scores_gemma":[0.0036844604,0.0008436414,0.0016477056,0.0015279127,0.0006868047,0.0022701165,0.0024102873,0.0026389481,0.0017783814],"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.00015285493,0.00015390826,0.0011434607,0.00012042761,0.00024773282,0.00010518107,0.00012361618,0.34637648,0.010637178,0.08787161,0.008326521,0.5447411],"study_design_scores_gemma":[0.0000058524015,0.000038418908,0.00015932108,0.00001470867,0.00003782858,0.000047357888,0.000009963762,0.96600527,0.0020710637,0.028590584,0.0030078618,0.000011772717],"about_ca_topic_score_codex":0.0022606892,"about_ca_topic_score_gemma":0.0033055018,"teacher_disagreement_score":0.0049158116,"about_ca_system_score_codex":0.00065211975,"about_ca_system_score_gemma":0.0008368384,"threshold_uncertainty_score":0.016444981},"labels":[],"label_agreement":null},{"id":"W4361984338","doi":"10.1007/978-3-031-30122-3","title":"Foundations and Practice of Security","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Toronto Metropolitan University; University of Ottawa","funders":"University of Ottawa","keywords":"Computer science; Computer security; Software engineering; Programming language","score_opus":0.02649411227556493,"score_gpt":0.3317188694101058,"score_spread":0.3052247571345409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361984338","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005999265,0.026754789,0.14002347,0.05562002,0.001747753,0.00010760773,0.00018511206,0.00017415045,0.7693878],"genre_scores_gemma":[0.7960993,0.017925411,0.07503963,0.0050427187,0.0023418947,0.0006866493,0.0002088472,0.0002121235,0.102443404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99520075,0.0027108358,0.0002053263,0.0005982614,0.00093097053,0.00035384012],"domain_scores_gemma":[0.99422246,0.0033801654,0.00030997602,0.0012189061,0.0005765782,0.00029197274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005547446,0.0008011563,0.00076145824,0.0017805716,0.0032698058,0.009097607,0.001855633,0.0042510713,0.016419074],"category_scores_gemma":[0.008713617,0.0006142102,0.00059836474,0.0020846305,0.033765074,0.009734458,0.0036032742,0.005173377,0.0028487174],"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.0000011591534,0.0000036076453,0.000024829094,0.000011882266,9.885645e-7,0.000004244914,0.00027239783,0.00009855618,0.00000973587,0.99580437,0.0017719095,0.0019964003],"study_design_scores_gemma":[0.0000030455178,0.0000029181256,0.000039609316,0.000047029873,0.0000013227643,0.00001570349,0.0002649608,0.000253522,0.000021713473,0.95773387,0.04161404,0.0000020976058],"about_ca_topic_score_codex":0.003951839,"about_ca_topic_score_gemma":0.0027018252,"teacher_disagreement_score":0.016419074,"about_ca_system_score_codex":0.0047669807,"about_ca_system_score_gemma":0.005582072,"threshold_uncertainty_score":0.05492729},"labels":[],"label_agreement":null},{"id":"W4361987488","doi":"10.1007/978-3-031-30122-3_22","title":"A Decentralized Mnemonic Backup System for Non-custodial Cryptocurrency Wallets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Glycemic Index Laboratories; The Scarborough Hospital; University of Toronto","funders":"","keywords":"Backup; Computer science; Cryptocurrency; Mnemonic; Computer security; Operating system","score_opus":0.016243203435947474,"score_gpt":0.25113233615433694,"score_spread":0.23488913271838946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361987488","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.16764502,0.00095300644,0.77476454,0.0008494264,0.00075051823,0.0006458732,0.00055176223,0.025193812,0.028646002],"genre_scores_gemma":[0.8629356,0.00019698348,0.11065441,0.00017379255,0.00014681742,0.00016918803,0.0005876753,0.0005377715,0.024597742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950683,0.00009693835,0.00003844844,0.00009337088,0.00017050747,0.00009389576],"domain_scores_gemma":[0.9989973,0.00012949725,0.000044172895,0.00053102424,0.00018566367,0.00011240449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006844439,0.00036901946,0.0008398931,0.0006277798,0.001472676,0.0016765177,0.0019027394,0.0008131756,0.011890868],"category_scores_gemma":[0.0012967545,0.00037849174,0.00023549254,0.0005931728,0.00052711676,0.0019131147,0.0020442544,0.00089998095,0.0023651528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035434712,0.0008302631,0.002568809,0.0005476025,0.00015892884,0.0008199656,0.00079389213,0.05835286,0.085941784,0.09689666,0.061497454,0.68804824],"study_design_scores_gemma":[0.0007017118,0.00086261577,0.0016888813,0.00009577183,0.00014345758,0.00083061773,0.0003005846,0.7945757,0.05996496,0.058312114,0.08239216,0.00013149629],"about_ca_topic_score_codex":0.0012160242,"about_ca_topic_score_gemma":0.0019867462,"teacher_disagreement_score":0.011890868,"about_ca_system_score_codex":0.0007416914,"about_ca_system_score_gemma":0.0011476792,"threshold_uncertainty_score":0.03977889},"labels":[],"label_agreement":null},{"id":"W4361987538","doi":"10.1007/978-3-031-30122-3_19","title":"Finding Unchecked Low-Level Calls with Zero False Positives and Negatives in Ethereum Smart Contracts","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"False positive paradox; Computer science; False positives and false negatives; True positive rate; Computer security; Algorithm; Artificial intelligence","score_opus":0.02240942180986955,"score_gpt":0.24916419414344837,"score_spread":0.22675477233357882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361987538","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.5798322,0.0006912047,0.40408745,0.001845454,0.0001712638,0.00017814343,0.00070326857,0.0049510747,0.0075399177],"genre_scores_gemma":[0.92840797,0.000060914113,0.06841428,0.00018360312,0.000052420084,0.000064456784,0.0003576719,0.00028235867,0.0021763544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9834403,0.0048849685,0.00095589604,0.002445253,0.0062846807,0.0019888924],"domain_scores_gemma":[0.901358,0.08007602,0.00382774,0.009927976,0.003467986,0.0013423451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011007891,0.00091458624,0.0018764767,0.0020279007,0.0016299868,0.0038502319,0.0031884355,0.0046146223,0.003259525],"category_scores_gemma":[0.07305353,0.0010530384,0.00090722163,0.0015727946,0.004170983,0.0069539263,0.0038029384,0.0034471604,0.0011469497],"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.0061428878,0.0012533742,0.10946653,0.000725285,0.00031299607,0.0026809557,0.0015336451,0.13074447,0.030892089,0.1882984,0.011165305,0.5167841],"study_design_scores_gemma":[0.00018696905,0.0002718511,0.0049269013,0.00008858212,0.00010713614,0.0011974403,0.0005464993,0.69180745,0.024404583,0.27419364,0.0021768997,0.00009207586],"about_ca_topic_score_codex":0.00072062825,"about_ca_topic_score_gemma":0.0011195287,"teacher_disagreement_score":0.011007891,"about_ca_system_score_codex":0.0010033451,"about_ca_system_score_gemma":0.002044812,"threshold_uncertainty_score":0.058215976},"labels":[],"label_agreement":null},{"id":"W4361988195","doi":"10.1007/978-3-031-30122-3_5","title":"A New Class of Trapdoor Verifiable Delay Functions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Computer science; Class (philosophy); Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.018783626299062644,"score_gpt":0.2298494070743131,"score_spread":0.21106578077525046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361988195","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.060417276,0.0041996315,0.8547137,0.0014329759,0.0008141112,0.00015767523,0.0006060199,0.0020856457,0.075572975],"genre_scores_gemma":[0.76384056,0.0054371753,0.14853658,0.0012243962,0.0010969745,0.0003808966,0.0006266792,0.0007150897,0.07814156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.00010861697,0.0000503593,0.00025127476,0.00037493106,0.00020528701],"domain_scores_gemma":[0.99827516,0.00079827383,0.00017727843,0.00045994672,0.0001787619,0.00011061611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237848,0.0009822077,0.0008205797,0.0014391484,0.00093542505,0.0037391982,0.0013995729,0.0013109554,0.005791627],"category_scores_gemma":[0.0029673453,0.0005370992,0.0009347528,0.0014432163,0.002004904,0.005619895,0.0021455605,0.0047850083,0.0018950106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015331797,0.000045725803,0.00016767759,0.00011668256,0.000018291603,0.000095197836,0.00013283544,0.004083131,0.0074538486,0.922545,0.0039722803,0.061215892],"study_design_scores_gemma":[0.00008277719,0.00016211516,0.0001656451,0.00007890795,0.00005861989,0.00079030363,0.00004666308,0.04584658,0.017717369,0.8669138,0.068067946,0.00006932875],"about_ca_topic_score_codex":0.00021945545,"about_ca_topic_score_gemma":0.00018943759,"teacher_disagreement_score":0.005791627,"about_ca_system_score_codex":0.0014587715,"about_ca_system_score_gemma":0.00097028574,"threshold_uncertainty_score":0.019374967},"labels":[],"label_agreement":null},{"id":"W4361988503","doi":"10.1007/978-3-031-30047-9_10","title":"Diffusion Transport Alignment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Domain (mathematical analysis); Domain adaptation; Process (computing); Diffusion map; Data mining; Manifold (fluid mechanics); Exploit; Diffusion; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Algorithm; Nonlinear dimensionality reduction; Dimensionality reduction; Mathematics","score_opus":0.022354449406243863,"score_gpt":0.24346329672274458,"score_spread":0.2211088473165007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361988503","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.0066218474,0.0011411787,0.91952664,0.000835492,0.001059106,0.00013143501,0.0014378856,0.005849358,0.063397124],"genre_scores_gemma":[0.21991271,0.0018239482,0.5493055,0.00076441537,0.00059921766,0.00036611577,0.008351528,0.0069587803,0.21191777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995029,0.000068428635,0.000022958786,0.00023251769,0.0001222481,0.000050846505],"domain_scores_gemma":[0.9993954,0.00011810416,0.000031832136,0.00024970766,0.0001506047,0.00005436416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067563006,0.0011270762,0.001258628,0.001183286,0.0012416779,0.0022335972,0.0012621507,0.0019341275,0.038858894],"category_scores_gemma":[0.0021083772,0.000649871,0.00081271084,0.0015098815,0.00073027296,0.0029201491,0.0023590513,0.002346117,0.023895578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032192332,0.00014080765,0.00044960988,0.0003163354,0.00010343488,0.00018921061,0.00014170728,0.063506,0.033550486,0.3587202,0.0790399,0.46352038],"study_design_scores_gemma":[0.00003991279,0.000076383054,0.0004991562,0.00007914619,0.000048411373,0.00033724483,0.00009927611,0.57460237,0.037161995,0.24419683,0.14278696,0.00007233692],"about_ca_topic_score_codex":0.0021111679,"about_ca_topic_score_gemma":0.0024412575,"teacher_disagreement_score":0.038858894,"about_ca_system_score_codex":0.00090803276,"about_ca_system_score_gemma":0.0010517591,"threshold_uncertainty_score":0.12999594},"labels":[],"label_agreement":null},{"id":"W4361989366","doi":"10.1007/978-3-031-30122-3_18","title":"SCADA Radio Blackbox Reverse Engineering","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","field":"Engineering","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":"Université de Sherbrooke","funders":"","keywords":"SCADA; Computer science; Supervisory control; Embedded system; Wireless; Programmable logic controller; Network packet; Computer network; Computer hardware; Real-time computing; Telecommunications; Engineering; Electrical engineering; Operating system; Control (management)","score_opus":0.00899106561047427,"score_gpt":0.19368442971886682,"score_spread":0.18469336410839254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361989366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01920927,0.001658867,0.7958566,0.0007532808,0.0009955793,0.00011761873,0.00014043288,0.008251436,0.1730169],"genre_scores_gemma":[0.42123052,0.0031537483,0.17363724,0.0007029029,0.000344685,0.000116592186,0.0003743246,0.0016805857,0.3987594],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979454,0.000030370173,0.0000063678526,0.000029351404,0.0001115997,0.000027888032],"domain_scores_gemma":[0.9996635,0.0000682894,0.000022057811,0.0001265474,0.00010641908,0.000013209398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022760016,0.0006807749,0.0002434709,0.0003968388,0.0003065837,0.00092996337,0.0005595965,0.00048433658,0.015932754],"category_scores_gemma":[0.0006074816,0.00025289247,0.00026888706,0.00022616294,0.00031812995,0.00092011417,0.0004868493,0.0010916246,0.0068318453],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012100475,0.00011430918,0.0004035423,0.00023085078,0.000027285683,0.0003683982,0.00018895887,0.021686094,0.059247974,0.08535898,0.04178675,0.7904658],"study_design_scores_gemma":[0.000040705967,0.00027220108,0.0007926616,0.00019277316,0.00007070975,0.0019470643,0.00014298127,0.15967312,0.13173191,0.058371477,0.64671695,0.00004737278],"about_ca_topic_score_codex":0.00061664387,"about_ca_topic_score_gemma":0.001030402,"teacher_disagreement_score":0.015932754,"about_ca_system_score_codex":0.00036707358,"about_ca_system_score_gemma":0.00034332994,"threshold_uncertainty_score":0.05330044},"labels":[],"label_agreement":null},{"id":"W4361989630","doi":"10.1007/978-3-031-30122-3_26","title":"Two-Layer Architecture for Signature-Based Attacks Detection over Encrypted Network Traffic","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Encryption; Deep packet inspection; Computer network; Cloud computing; Intrusion detection system; Network packet; Computer security; Operating system","score_opus":0.017026647561650537,"score_gpt":0.2523106144963475,"score_spread":0.23528396693469697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361989630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11836441,0.00092671637,0.84899974,0.00037840323,0.00038233158,0.00050387456,0.00031080507,0.021624036,0.008509657],"genre_scores_gemma":[0.80097973,0.00041865552,0.1816356,0.00041737608,0.00011625223,0.00020883158,0.00057893264,0.00021217501,0.015432335],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991333,0.00009981121,0.000074132455,0.00015151719,0.00036478642,0.00017649165],"domain_scores_gemma":[0.9991209,0.00011075966,0.00008048459,0.00025078683,0.00037578368,0.00006127046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060336135,0.00075441034,0.0007498165,0.0011561981,0.0006188163,0.001750091,0.002259774,0.0010841711,0.0045724427],"category_scores_gemma":[0.00074963825,0.00046008106,0.0004453523,0.00064042804,0.00033552042,0.0019773676,0.0011643143,0.00084535417,0.002330396],"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.0021159553,0.0008419888,0.0046030763,0.0006234852,0.00029830736,0.0005284032,0.00043238618,0.020523569,0.54629534,0.01662531,0.014337236,0.39277494],"study_design_scores_gemma":[0.00009859585,0.0009101602,0.0024469066,0.00006805109,0.00021931158,0.0008269924,0.000091732705,0.594711,0.37895045,0.0046342732,0.016910648,0.00013188452],"about_ca_topic_score_codex":0.0014288301,"about_ca_topic_score_gemma":0.0013810279,"teacher_disagreement_score":0.0045724427,"about_ca_system_score_codex":0.0008880833,"about_ca_system_score_gemma":0.00091566617,"threshold_uncertainty_score":0.0152964},"labels":[],"label_agreement":null},{"id":"W4361990104","doi":"10.1007/978-3-031-30122-3_16","title":"Underwater Confidential Communications in JANUS","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Underwater Vehicles and Communication Systems","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":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Computer science; Underwater; Janus; Confidentiality; Cryptography; Computer security; Entropy (arrow of time); Block cipher; Underwater acoustic communication; Key (lock); Communications security; Encryption; Geology","score_opus":0.03727917661371429,"score_gpt":0.256338530887478,"score_spread":0.2190593542737637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361990104","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.008000757,0.03701402,0.024296656,0.009701583,0.015175334,0.00009744411,0.00028309392,0.00061106135,0.9048201],"genre_scores_gemma":[0.035789248,0.012380412,0.004695605,0.00076949876,0.0026572186,0.000035989833,0.00019050263,0.0002271339,0.9432545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994916,0.00010476328,0.00002651694,0.00006678161,0.0002491536,0.000061153005],"domain_scores_gemma":[0.9995968,0.00011391021,0.000027577606,0.00007002549,0.00014240012,0.00004936851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647722,0.0006093497,0.00036087047,0.0010408533,0.0014079242,0.0023529462,0.00067984,0.0011091976,0.026940579],"category_scores_gemma":[0.001505788,0.0003984375,0.0001964908,0.0013057044,0.0008538528,0.0025511042,0.0017989555,0.0016612714,0.008462587],"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.00012492541,0.00005930792,0.00041542566,0.00025646287,0.000011755445,0.0005186709,0.00078457355,0.002590178,0.0019983589,0.21984044,0.35106245,0.42233753],"study_design_scores_gemma":[0.0000018375105,0.000024376595,0.0002648583,0.00013402157,0.0000039885376,0.00021920157,0.00013934415,0.0011586145,0.000765884,0.0088101905,0.9884658,0.00001184092],"about_ca_topic_score_codex":0.0031791134,"about_ca_topic_score_gemma":0.005328337,"teacher_disagreement_score":0.026940579,"about_ca_system_score_codex":0.0012104702,"about_ca_system_score_gemma":0.0011347914,"threshold_uncertainty_score":0.0901252},"labels":[],"label_agreement":null},{"id":"W4361995010","doi":"10.1007/978-3-031-30122-3_17","title":"Defense Models for Data Recovery in Industrial Control Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","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":"Carleton University","funders":"","keywords":"Computer science; Computer security; Automaton; Industrial control system; Language change; Work (physics); Control (management); Risk analysis (engineering); Artificial intelligence; Business; Engineering","score_opus":0.0591159600742843,"score_gpt":0.2403173908939618,"score_spread":0.18120143081967752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361995010","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.008909499,0.0022785042,0.9563258,0.0015533442,0.00026442495,0.000034619705,0.00015721649,0.0003229491,0.030153615],"genre_scores_gemma":[0.85250187,0.004283967,0.07955031,0.00053187134,0.0004362041,0.00020216129,0.00043104694,0.0002797603,0.061782792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996426,0.00013324352,0.000019175313,0.000051826453,0.000094273186,0.00005884031],"domain_scores_gemma":[0.9993591,0.0004014191,0.000051508516,0.00006692737,0.00009466722,0.000026468204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881239,0.0008358597,0.0008062914,0.00047005154,0.0004837799,0.0016802305,0.0011589443,0.0013068614,0.0070891213],"category_scores_gemma":[0.00211452,0.00038323915,0.00077473035,0.0006367062,0.00091739953,0.0020736647,0.0009668349,0.0023204584,0.0009988105],"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.000032810036,0.00003217666,0.00012810745,0.00008791724,0.000020110174,0.000055763976,0.00008934783,0.4231895,0.0006658047,0.55147547,0.005074367,0.019148607],"study_design_scores_gemma":[0.000005227702,0.00001281329,0.000042752734,0.000016782993,0.000006522219,0.000014796609,0.000018671195,0.8035183,0.0001419465,0.19306713,0.003148817,0.000006225469],"about_ca_topic_score_codex":0.004016984,"about_ca_topic_score_gemma":0.0029699467,"teacher_disagreement_score":0.0070891213,"about_ca_system_score_codex":0.0014307575,"about_ca_system_score_gemma":0.00080495526,"threshold_uncertainty_score":0.023715436},"labels":[],"label_agreement":null},{"id":"W4361997635","doi":"10.1007/978-3-031-30122-3_14","title":"A Taxonomy and Gap-Analysis in Digital Privacy Education","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Confidentiality; Curriculum; Taxonomy (biology); Mobile device; Internet privacy; Information privacy; Information security; Computer security; Multimedia; World Wide Web","score_opus":0.041759072210913524,"score_gpt":0.29462957691092334,"score_spread":0.2528705047000098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361997635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075886466,0.011682781,0.63550586,0.026889013,0.00051341945,0.000602751,0.001403837,0.0008432209,0.24667272],"genre_scores_gemma":[0.64904803,0.0041054767,0.327755,0.001194779,0.00011796769,0.000792264,0.0013715841,0.00017773765,0.015437091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951946,0.0022109603,0.00047700273,0.0006585287,0.0009558464,0.0005029689],"domain_scores_gemma":[0.99101907,0.005611159,0.00052509404,0.0007834784,0.0016184066,0.00044272313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042221285,0.00074252166,0.00080081966,0.007813622,0.0049747624,0.008016922,0.0026590896,0.0031288883,0.01172445],"category_scores_gemma":[0.012432997,0.00050544983,0.0011683701,0.014095976,0.008073856,0.029034426,0.005783898,0.0035347238,0.0015952163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015570839,0.00004685777,0.001706153,0.00012200293,0.0000039214115,0.00007929946,0.0049727685,0.0005186002,0.00009707174,0.9605629,0.0028158482,0.029059034],"study_design_scores_gemma":[0.0000067009287,0.000022322565,0.0006472497,0.0002842487,0.000009372834,0.00023566057,0.01642222,0.006579486,0.00028697084,0.9389929,0.036497787,0.000015055251],"about_ca_topic_score_codex":0.0061579864,"about_ca_topic_score_gemma":0.0050906064,"teacher_disagreement_score":0.01172445,"about_ca_system_score_codex":0.00573954,"about_ca_system_score_gemma":0.0053965016,"threshold_uncertainty_score":0.0416435},"labels":[],"label_agreement":null},{"id":"W4361997648","doi":"10.1007/978-3-031-30122-3_25","title":"Towards Characterizing IoT Software Update Practices","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Computer science; Internet of Things; Software; Computer security; Mobile device; Service (business); Best practice; World Wide Web; Operating system","score_opus":0.029945966602058754,"score_gpt":0.29168660135249547,"score_spread":0.26174063475043674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361997648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40791246,0.006127907,0.38731182,0.0016033847,0.00021332843,0.0002390628,0.006241384,0.0028464766,0.1875042],"genre_scores_gemma":[0.8149533,0.0053613484,0.14307134,0.0003168097,0.00016520573,0.00025067016,0.006484448,0.000611857,0.02878496],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988869,0.00017598312,0.00007923244,0.00023152342,0.00052059395,0.00010588165],"domain_scores_gemma":[0.9951214,0.002614244,0.0006789666,0.0007304605,0.0007568931,0.00009794896],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0009566293,0.0005166304,0.00031909588,0.004403538,0.0005011095,0.0042443653,0.0006802356,0.0007113131,0.003532291],"category_scores_gemma":[0.0061199353,0.00038783162,0.0004365391,0.004950806,0.00064197724,0.004882467,0.0009279639,0.00095993525,0.0019969647],"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.00011777777,0.00019932144,0.078155644,0.0005169388,0.00006380904,0.00020909475,0.002980801,0.012687591,0.015261296,0.12498265,0.009391402,0.75543374],"study_design_scores_gemma":[0.000015212606,0.00030889342,0.16997972,0.0010973716,0.00019457341,0.0029756941,0.007146546,0.26386347,0.041995395,0.2597628,0.25253108,0.00012934218],"about_ca_topic_score_codex":0.0018026636,"about_ca_topic_score_gemma":0.0024914595,"teacher_disagreement_score":0.99904335,"about_ca_system_score_codex":0.000966671,"about_ca_system_score_gemma":0.000615801,"threshold_uncertainty_score":0.01181668},"labels":[],"label_agreement":null},{"id":"W4361999850","doi":"10.1007/978-3-031-30122-3_23","title":"If-This-Then-Allow-That (to Phone Home): A Trigger-Based Network Policy Enforcement Framework for Smart Homes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Queen's University","funders":"","keywords":"Computer science; Smart phone; Phone; Enforcement; Computer security; Home automation; Computer network; Telecommunications","score_opus":0.02164158440238799,"score_gpt":0.2680468960310966,"score_spread":0.2464053116287086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361999850","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.0028055226,0.00010993789,0.94460565,0.00043480453,0.0001683156,0.00022688191,0.00033707827,0.041063845,0.010247984],"genre_scores_gemma":[0.2471479,0.0003986516,0.6980706,0.0016606415,0.00024792724,0.0006574814,0.0013993328,0.010310945,0.040106557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984901,0.00039469806,0.0001256199,0.00025339815,0.00045110594,0.00028509944],"domain_scores_gemma":[0.998514,0.00066337286,0.00009020184,0.00045633464,0.0001336456,0.00014234711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036119916,0.000835464,0.0009594955,0.00086442946,0.001409957,0.0036491167,0.0031642716,0.002621183,0.020785421],"category_scores_gemma":[0.0035971538,0.0009212962,0.0011820591,0.00062234706,0.0023137268,0.005829953,0.0038944394,0.0043516937,0.005782206],"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.0011199358,0.00063815154,0.0013406638,0.00036919944,0.00009845004,0.00077456894,0.0013651518,0.02797159,0.014526614,0.63292414,0.09772822,0.22114328],"study_design_scores_gemma":[0.0002774634,0.00015131923,0.00037805818,0.0001482271,0.00009868856,0.00051097176,0.00021410103,0.42440534,0.038245756,0.35086462,0.18455964,0.0001458318],"about_ca_topic_score_codex":0.0033209992,"about_ca_topic_score_gemma":0.0057079336,"teacher_disagreement_score":0.020785421,"about_ca_system_score_codex":0.0012556788,"about_ca_system_score_gemma":0.0015090895,"threshold_uncertainty_score":0.06953418},"labels":[],"label_agreement":null},{"id":"W43621356","doi":"10.1007/978-3-319-08783-2_39","title":"Improved Approximation for Time-Dependent Shortest Paths","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lambda; Combinatorics; Shortest path problem; Approximation algorithm; Binary logarithm; Time complexity; Computation; Dijkstra's algorithm; Mathematics; Path (computing); Piecewise linear function; Node (physics); Function (biology); Algorithm; Discrete mathematics; Computer science; Physics; Mathematical analysis; Graph","score_opus":0.012753644988605888,"score_gpt":0.2283138038738385,"score_spread":0.2155601588852326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43621356","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.021225076,0.0024854753,0.95249313,0.00097590726,0.00079901156,0.00023732329,0.00093275844,0.0023688262,0.018482411],"genre_scores_gemma":[0.16842557,0.0021349224,0.8004078,0.00047028146,0.0007019745,0.0007081761,0.0029971197,0.001051239,0.023102866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605197,0.00082721136,0.00018407866,0.0007048682,0.0017123747,0.0005196584],"domain_scores_gemma":[0.99148047,0.005037345,0.00029391778,0.0018533707,0.00094050996,0.00039440714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029095972,0.0030684758,0.00304103,0.002613392,0.0012085595,0.0028345843,0.0069463965,0.0024596036,0.018447055],"category_scores_gemma":[0.017568149,0.0011564883,0.0025158452,0.005599797,0.0014504761,0.005751424,0.004449182,0.006597624,0.0040969476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013920022,0.00068307744,0.00086740794,0.00093374786,0.0001690607,0.00016851728,0.00033719596,0.4916939,0.0047572027,0.11392754,0.045318037,0.33975226],"study_design_scores_gemma":[0.00013391767,0.00010303126,0.00023236751,0.00005818657,0.00006921943,0.00011848606,0.00005049016,0.92501384,0.0011548781,0.066482686,0.0065615065,0.00002142613],"about_ca_topic_score_codex":0.0081044175,"about_ca_topic_score_gemma":0.010021326,"teacher_disagreement_score":0.018447055,"about_ca_system_score_codex":0.0048712827,"about_ca_system_score_gemma":0.003571549,"threshold_uncertainty_score":0.06171149},"labels":[],"label_agreement":null},{"id":"W4362476330","doi":"10.1007/978-3-031-30617-4_14","title":"Supersingular Curves You Can Trust","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Academia Sinica; Ministero dell’Istruzione, dell’Università e della Ricerca; Banff International Research Station for Mathematical Innovation and Discovery; Università degli Studi di Roma Tor Vergata; Agence Nationale de la Recherche","keywords":"Computer science; Discrete logarithm; Isogeny; Direct Anonymous Attestation; Protocol (science); Theoretical computer science; Cryptography; Cryptographic protocol; Elliptic curve; Public-key cryptography; Algorithm; Mathematics; Encryption; Computer security; Trusted Computing; Pure mathematics","score_opus":0.015917235906931896,"score_gpt":0.23077026830351813,"score_spread":0.21485303239658624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362476330","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021348415,0.0020387857,0.049477965,0.0048107756,0.0016479138,0.000047514866,0.0002387684,0.0012888749,0.91910106],"genre_scores_gemma":[0.25157455,0.00554703,0.015129944,0.0009249473,0.0009983958,0.000051066774,0.00040971529,0.0010069128,0.7243574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997317,0.000035071862,0.000010492449,0.000036278143,0.00012807154,0.0000583433],"domain_scores_gemma":[0.99939907,0.00009336073,0.000050258488,0.0002827233,0.00010853205,0.00006608836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000280141,0.0006154686,0.00041669307,0.0005951143,0.0010411692,0.0020674388,0.0003760805,0.0008818519,0.05153758],"category_scores_gemma":[0.0019200057,0.00036634834,0.00036973198,0.00072162464,0.0014855023,0.0072067,0.0019909637,0.0026702033,0.02830472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006474691,0.00001708155,0.00017349362,0.00008106349,0.000011749856,0.00021759189,0.0006532624,0.0007917007,0.0029035797,0.82939196,0.07089141,0.094802365],"study_design_scores_gemma":[0.000012260168,0.000039529234,0.0001445853,0.000081184015,0.000010805453,0.0004515233,0.00023544315,0.0016487266,0.0030845895,0.35978845,0.6344841,0.000018729786],"about_ca_topic_score_codex":0.00048325816,"about_ca_topic_score_gemma":0.00048506772,"teacher_disagreement_score":0.05153758,"about_ca_system_score_codex":0.00063590327,"about_ca_system_score_gemma":0.00036161402,"threshold_uncertainty_score":0.17241037},"labels":[],"label_agreement":null},{"id":"W4362499614","doi":"10.1007/978-3-031-29119-7_11","title":"T-Cell Receptor Optimization with Reinforcement Learning and Mutation Polices for Precision Immunotherapy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"vaccines and immunoinformatics approaches","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":"National Research Council Canada","funders":"","keywords":"T-cell receptor; Reinforcement learning; T cell; Immunotherapy; Mutation; Artificial intelligence; Computer science; Computational biology; Biology; Combinatorics; Physics; Algorithm; Immune system; Gene; Mathematics; Genetics","score_opus":0.010319695724003774,"score_gpt":0.23486544758279196,"score_spread":0.2245457518587882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362499614","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.03631852,0.0022846402,0.94201934,0.00069605827,0.00017402526,0.00004466905,0.000046689755,0.0005677425,0.017848315],"genre_scores_gemma":[0.79223067,0.0011716746,0.18314792,0.0002822648,0.00014711257,0.0001224641,0.00006722964,0.00016766625,0.022662928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999866,0.000042367596,0.0000059061017,0.000022787266,0.000042315183,0.000020554367],"domain_scores_gemma":[0.9997353,0.0001752018,0.000024143803,0.000021900758,0.000031366508,0.000012055122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044917624,0.00046364806,0.0006054406,0.00019290023,0.0001877967,0.00048458227,0.0007419703,0.0006883335,0.0030880254],"category_scores_gemma":[0.0010370826,0.0002467793,0.00039220534,0.00024148938,0.0005411663,0.0006423554,0.0005422847,0.001194779,0.00044290107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005891694,0.000041264157,0.00013297248,0.00004303941,0.00002621074,0.000028604114,0.000019272182,0.8825323,0.0038322401,0.031090949,0.0019103177,0.080283955],"study_design_scores_gemma":[0.000008478957,0.00003155595,0.000042137377,0.0000047179183,0.000005869316,0.000012276214,0.0000027194822,0.98134696,0.0006791344,0.017070215,0.0007920173,0.000003792295],"about_ca_topic_score_codex":0.0009351946,"about_ca_topic_score_gemma":0.00095076265,"teacher_disagreement_score":0.0030880254,"about_ca_system_score_codex":0.00050169765,"about_ca_system_score_gemma":0.00037845367,"threshold_uncertainty_score":0.010330498},"labels":[],"label_agreement":null},{"id":"W4362500047","doi":"10.1007/978-3-031-29504-1_11","title":"HoneyGAN: Creating Indistinguishable Honeywords with Improved Generative Adversarial Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Ontario Tech University","funders":"","keywords":"Password; Computer science; Metric (unit); Adversarial system; Representation (politics); Task (project management); Generative grammar; Computer security; Artificial intelligence; Theoretical computer science; Machine learning","score_opus":0.015214734348324295,"score_gpt":0.23216779361469805,"score_spread":0.21695305926637376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362500047","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.027834771,0.00021183303,0.9611102,0.0002082565,0.00017935275,0.00012332706,0.00007365713,0.002855639,0.007402946],"genre_scores_gemma":[0.6276599,0.00022670401,0.35104784,0.000399945,0.000099364624,0.00029974204,0.0003073308,0.0011043758,0.018854776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999185,0.0002540247,0.00002856075,0.00012328052,0.0003208556,0.00008819996],"domain_scores_gemma":[0.99875045,0.0005909422,0.00006722592,0.00045575376,0.00008624623,0.000049410894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067721517,0.0007067635,0.0006637628,0.0003218278,0.0004211375,0.00083430245,0.0013908262,0.0011917118,0.007003404],"category_scores_gemma":[0.002559915,0.0004928955,0.0006538825,0.00023210011,0.0012288954,0.002071411,0.0036344016,0.0019892638,0.0018781286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007384429,0.0002993958,0.00071380177,0.00031941995,0.00016258405,0.0006551975,0.0003694005,0.39398706,0.0835362,0.15288787,0.013758165,0.35257247],"study_design_scores_gemma":[0.00005554613,0.00014601725,0.00012866143,0.000028548939,0.000022193644,0.00026081427,0.000027438808,0.9075536,0.02288303,0.063333616,0.005526277,0.000034280885],"about_ca_topic_score_codex":0.00018608429,"about_ca_topic_score_gemma":0.00041566588,"teacher_disagreement_score":0.007003404,"about_ca_system_score_codex":0.00033475854,"about_ca_system_score_gemma":0.00027412284,"threshold_uncertainty_score":0.023428679},"labels":[],"label_agreement":null},{"id":"W4362502773","doi":"10.1007/978-3-031-29419-8_2","title":"Low Profile CPW Fed Tri-Band Millimeter Wave Antenna Design for Future 5G Application","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Antenna Design and Analysis","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":"University of Alberta","funders":"","keywords":"Coplanar waveguide; Monopole antenna; Standing wave ratio; Extremely high frequency; Ground plane; Physics; Optics; Bandwidth (computing); Antenna (radio); Reflection coefficient; Telecommunications; Computer science; Microstrip antenna; Microwave","score_opus":0.021869258207514217,"score_gpt":0.22127261461292505,"score_spread":0.19940335640541085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362502773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10806421,0.0015675905,0.82133067,0.0010959478,0.0004044188,0.00008431605,0.00044588177,0.0023748812,0.06463207],"genre_scores_gemma":[0.69158965,0.0012463989,0.24092828,0.0005843504,0.00016898607,0.00014770705,0.000858799,0.00055171753,0.063924015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982774,0.000030265355,0.0000062380973,0.00002562114,0.00008445286,0.000025595009],"domain_scores_gemma":[0.9997497,0.00003060875,0.00005791583,0.000029631276,0.00011256985,0.000019504556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018048003,0.0004892479,0.00037872326,0.00025739757,0.00014373838,0.0010052315,0.00082099147,0.00095443573,0.0040951967],"category_scores_gemma":[0.0002501381,0.00025976927,0.00049976533,0.00044566873,0.0001367261,0.00041942412,0.00028760277,0.00051285955,0.00415193],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005038939,0.00013859534,0.0015300175,0.00047397206,0.00019115143,0.00039912466,0.00021343057,0.03101459,0.7674224,0.017054673,0.019678054,0.16138022],"study_design_scores_gemma":[0.00011340159,0.0024161937,0.0063773408,0.0002091146,0.00027176348,0.003847731,0.00029203136,0.42231604,0.43862125,0.0056242677,0.11976203,0.00014882679],"about_ca_topic_score_codex":0.00036648856,"about_ca_topic_score_gemma":0.00056008535,"teacher_disagreement_score":0.0040951967,"about_ca_system_score_codex":0.00050136563,"about_ca_system_score_gemma":0.00028476058,"threshold_uncertainty_score":0.01369977},"labels":[],"label_agreement":null},{"id":"W4362502900","doi":"10.1007/978-3-031-29419-8_11","title":"Deep Reinforcement Learning to Improve Vehicle-to-Vulnerable Road User Communications in C-V2X","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"Polytechnique Montréal; Université de Sherbrooke","funders":"","keywords":"Reinforcement learning; Computer science; Network packet; Scheme (mathematics); Transmission (telecommunications); Throughput; Computer network; Real-time computing; Distributed computing; Artificial intelligence; Telecommunications; Wireless","score_opus":0.014047055275976753,"score_gpt":0.23890063225386388,"score_spread":0.22485357697788713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362502900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12981625,0.0015104375,0.8487264,0.0006858237,0.00043867686,0.00009884826,0.0002898642,0.005685241,0.012748402],"genre_scores_gemma":[0.92613596,0.00018875698,0.06263111,0.00026192868,0.0000669652,0.00005086987,0.00024444936,0.00017936001,0.010240621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996247,0.00007473773,0.000010700535,0.00007174541,0.000085858184,0.00013209258],"domain_scores_gemma":[0.99899596,0.00053591875,0.00004742671,0.00009529103,0.00025188818,0.00007357904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196667,0.00081079704,0.0006448046,0.0002806928,0.0004729879,0.00054573757,0.0013149381,0.000794261,0.004518825],"category_scores_gemma":[0.002355231,0.00023989582,0.00021558323,0.00029200467,0.00041346665,0.0008015289,0.0010103649,0.0015122037,0.00072109944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031241303,0.00019000054,0.000853869,0.000051320774,0.000037760095,0.000076199256,0.000050670118,0.7998755,0.0050144983,0.004715402,0.010056701,0.17876567],"study_design_scores_gemma":[0.000004538475,0.000030966556,0.000059409846,0.0000025021784,0.000002746533,0.0000076093856,0.000005230353,0.9979917,0.00083394017,0.00080410653,0.00025509868,0.0000022114543],"about_ca_topic_score_codex":0.017548515,"about_ca_topic_score_gemma":0.024443286,"teacher_disagreement_score":0.017548515,"about_ca_system_score_codex":0.0010620974,"about_ca_system_score_gemma":0.0014258545,"threshold_uncertainty_score":0.034892738},"labels":[],"label_agreement":null},{"id":"W4362502915","doi":"10.1007/978-3-031-29419-8_16","title":"Reinforcement Learning Aided Routing in Tactical Wireless Sensor Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Network packet; Geographic routing; Routing protocol; Key distribution in wireless sensor networks; Dynamic Source Routing; Real-time computing; Wireless; Wireless network; Telecommunications","score_opus":0.01696218349917092,"score_gpt":0.23950515274020268,"score_spread":0.22254296924103176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362502915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010640465,0.0023735517,0.9778055,0.00025747443,0.00020219694,0.00001966619,0.000022214774,0.0004186726,0.0082602585],"genre_scores_gemma":[0.72305125,0.0034203345,0.24249543,0.00015055745,0.00029883743,0.000094026684,0.00010623592,0.00015453536,0.030228702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997898,0.00008057927,0.000007876705,0.000028440814,0.000072640716,0.000020766214],"domain_scores_gemma":[0.9994998,0.00034544352,0.000027733537,0.000042174655,0.0000700243,0.00001478421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045848396,0.00034730064,0.0004998911,0.00019319843,0.00013921662,0.00042856534,0.00074200245,0.00052660884,0.0020351133],"category_scores_gemma":[0.0011770995,0.00019261094,0.0001815169,0.00043446044,0.0003740676,0.00056860765,0.00044166239,0.0009096365,0.0004184956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047859285,0.000037842376,0.00015192847,0.00006719255,0.000016193682,0.000028142618,0.000025280851,0.796958,0.0027319964,0.019406386,0.0030122546,0.1775169],"study_design_scores_gemma":[0.0000028565503,0.000021600623,0.00006476169,0.0000045972974,0.0000022910185,0.00001515521,0.0000032627433,0.9911607,0.0004852365,0.0065643797,0.0016728723,0.000002366452],"about_ca_topic_score_codex":0.0011593297,"about_ca_topic_score_gemma":0.0013396938,"teacher_disagreement_score":0.0020351133,"about_ca_system_score_codex":0.0004040466,"about_ca_system_score_gemma":0.00031368373,"threshold_uncertainty_score":0.006808102},"labels":[],"label_agreement":null},{"id":"W4362502973","doi":"10.1007/978-3-031-29419-8","title":"Ubiquitous Networking","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Université Hassan II de Casablanca; Avignon Université; Université de Tunis; Università della Calabria; Università degli Studi di Salerno; Università di Bologna; Politechnika Warszawska; Universiteit Gent; Qatar University; Universidad Pública de Navarra; Università degli Studi Mediterranea di Reggio Calabria; Hankuk University of Foreign Studies; Incheon National University; La Rochelle Université; King Abdullah University of Science and Technology; Cairo University; Independent University, Bangladesh; European Commission; University of Carthage; Joint Research Centre; Indian National Science Academy; Universidade Federal do ABC; Università degli Studi di Milano; Insight SFI Research Centre for Data Analytics; Kent State University; McGill University; Université Mohammed V de Rabat; Indian Institute of Information Technology, Allahabad; King's College London; Institut National des Sciences Appliquées de Lyon; Université du Québec à Montréal; Université de Lorraine; University of the West of England; University of Louisville; Université de Technologie de Troyes; Georgia State University; Imperial College London; Università degli Studi di Napoli Federico II; University of Glasgow; Jackson State University","keywords":"Computer science; World Wide Web; Computer network","score_opus":0.024777909864119284,"score_gpt":0.25122653151824875,"score_spread":0.22644862165412946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362502973","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018807128,0.023491116,0.07254411,0.0015739499,0.0059476946,0.0001594922,0.00081620103,0.004043875,0.88954276],"genre_scores_gemma":[0.0064105396,0.010770911,0.010118609,0.0004614565,0.0008076577,0.00006366397,0.00094996084,0.00036452917,0.97005266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997924,0.000019330759,0.000007058969,0.000048097674,0.00010764941,0.000025554642],"domain_scores_gemma":[0.99977225,0.000029485696,0.000008752606,0.00006118435,0.00007118571,0.00005717669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029550373,0.0010844325,0.0006401867,0.0011668019,0.0007757476,0.0021365627,0.0007734026,0.00088984054,0.122494034],"category_scores_gemma":[0.000566041,0.00036273303,0.00030197907,0.0015377532,0.00028429425,0.002199028,0.0014586617,0.0010296126,0.09414473],"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.00003799344,0.00004853793,0.00010616066,0.00018055092,0.000008440872,0.00007890846,0.00006059938,0.0006470977,0.0027318879,0.030378096,0.4545713,0.5111504],"study_design_scores_gemma":[0.0000041439052,0.00002271016,0.00019527662,0.000081269056,0.0000064619417,0.00018839535,0.000028604512,0.0014459197,0.00064711575,0.007167867,0.99020493,0.0000074278523],"about_ca_topic_score_codex":0.00093055714,"about_ca_topic_score_gemma":0.0027492049,"teacher_disagreement_score":0.122494034,"about_ca_system_score_codex":0.0004905924,"about_ca_system_score_gemma":0.00042219122,"threshold_uncertainty_score":0.40978342},"labels":[],"label_agreement":null},{"id":"W4362503060","doi":"10.1007/978-3-031-29419-8_17","title":"A Green and Scalable Clustering for Massive IoT Sensors with Selective Deactivation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scalability; Cluster analysis; Internet of Things; Distributed computing; Embedded system; Artificial intelligence; Database","score_opus":0.014734393051357089,"score_gpt":0.22473962055588237,"score_spread":0.21000522750452527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362503060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023391103,0.0009948536,0.96189266,0.00041386916,0.00030663362,0.00010270597,0.00015607994,0.0021351662,0.010606985],"genre_scores_gemma":[0.52779084,0.0008841264,0.43977946,0.00039001394,0.00017161554,0.00018895425,0.00043706346,0.00046383197,0.029894063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998153,0.000021132755,0.000005402573,0.000051422507,0.000081652426,0.000025118898],"domain_scores_gemma":[0.9997898,0.00004890639,0.00001566706,0.00006680734,0.000053558684,0.00002545257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019578611,0.00057204504,0.0005767852,0.0003009926,0.00058424665,0.0005269505,0.0017652854,0.00058207085,0.0032308148],"category_scores_gemma":[0.00043557328,0.00026401147,0.0003821598,0.0005030538,0.00035485238,0.0007871141,0.0012230526,0.00078145694,0.0011178582],"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.00055514125,0.00026074413,0.0006010441,0.00034862052,0.00011185626,0.0003180307,0.00022681254,0.28637043,0.2001549,0.033810176,0.0290897,0.4481526],"study_design_scores_gemma":[0.000026353027,0.00016088995,0.00055577187,0.00002006862,0.000029454997,0.00028327364,0.00008196673,0.93943894,0.027644036,0.017131286,0.0145934895,0.000034516837],"about_ca_topic_score_codex":0.0013776303,"about_ca_topic_score_gemma":0.0037329402,"teacher_disagreement_score":0.0032308148,"about_ca_system_score_codex":0.00050238555,"about_ca_system_score_gemma":0.0005557267,"threshold_uncertainty_score":0.01080811},"labels":[],"label_agreement":null},{"id":"W4362503189","doi":"10.1007/978-3-031-29419-8_5","title":"Towards Facilitating URLLC in UAV-enabled MEC Systems for 6G Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"UAV Applications and Optimization","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Energy consumption; Context (archaeology); Edge computing; Convexity; Software deployment; Distributed computing; Real-time computing; Mathematical optimization; Internet of Things; Embedded system","score_opus":0.015997645857468337,"score_gpt":0.22617853178695752,"score_spread":0.2101808859294892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362503189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059998736,0.007335501,0.8244877,0.0019359381,0.00067057373,0.00021133345,0.00023022809,0.004360763,0.10076927],"genre_scores_gemma":[0.84332496,0.003513793,0.1255907,0.00062395504,0.00021972384,0.00011130359,0.00037696742,0.0001778516,0.026060741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996526,0.00012921581,0.000014102125,0.000041590083,0.000089113804,0.00007331966],"domain_scores_gemma":[0.9994324,0.00016856374,0.000036335274,0.00012869386,0.0002003694,0.00003357052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057795946,0.0005149085,0.00040575844,0.0003384329,0.0003834316,0.0014774061,0.00088875456,0.0007648133,0.0077677616],"category_scores_gemma":[0.0013242529,0.00017498227,0.00024198493,0.0003527613,0.0003375619,0.0020640485,0.0014707064,0.0010088518,0.002275637],"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.0003509185,0.0002125177,0.002115818,0.0010553937,0.000082821236,0.0010195306,0.00057561026,0.09530759,0.08634402,0.11101684,0.027241038,0.67467797],"study_design_scores_gemma":[0.000041542102,0.00046345813,0.0015280402,0.00047464538,0.00010068122,0.0009024478,0.0006206214,0.7159108,0.06448332,0.04088881,0.17453356,0.000052104966],"about_ca_topic_score_codex":0.0016377246,"about_ca_topic_score_gemma":0.003109428,"teacher_disagreement_score":0.0077677616,"about_ca_system_score_codex":0.00047198305,"about_ca_system_score_gemma":0.00048097438,"threshold_uncertainty_score":0.025985777},"labels":[],"label_agreement":null},{"id":"W4362513283","doi":"10.1007/978-3-031-29786-1_5","title":"Understanding the Role of Human-Related Factors in Security Requirements Elicitation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Carleton University; Ontario Tech University","funders":"","keywords":"Requirements elicitation; Computer science; Requirements engineering; Quality (philosophy); Requirements management; Context (archaeology); Principal (computer security); Knowledge management; Security engineering; Requirements analysis; Work (physics); Risk analysis (engineering); Process management; Information security; Computer security; Security service; Engineering; Business; Software security assurance; Software","score_opus":0.05763246625800346,"score_gpt":0.27961324269551957,"score_spread":0.22198077643751613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362513283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11806527,0.0029302735,0.79254466,0.005111424,0.00006731372,0.00037209046,0.00026241527,0.00038839685,0.080258116],"genre_scores_gemma":[0.7037463,0.0018331741,0.28753188,0.00052694307,0.00003068057,0.0001882333,0.00041866576,0.00009327284,0.005630821],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99652207,0.0021817768,0.00017927663,0.00029458606,0.0006428398,0.00017949441],"domain_scores_gemma":[0.9652884,0.031967722,0.0008686923,0.0006171523,0.0010845991,0.00017349224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005899578,0.00065097195,0.00029682802,0.0012443869,0.00060553325,0.0046200748,0.0010243133,0.0010325541,0.0045282836],"category_scores_gemma":[0.018610895,0.0005712114,0.0006037779,0.0010150167,0.001609259,0.006605423,0.0013533282,0.0016808554,0.0005955696],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037757368,0.0004533784,0.0111944275,0.00251332,0.00013738616,0.0012116858,0.02847131,0.04746884,0.027047224,0.32658026,0.006613937,0.54793054],"study_design_scores_gemma":[0.00008075385,0.00038098788,0.02069646,0.0022546335,0.00023472408,0.0013420676,0.027860623,0.31753016,0.02224628,0.5158866,0.09128243,0.00020433929],"about_ca_topic_score_codex":0.0064385235,"about_ca_topic_score_gemma":0.008665014,"teacher_disagreement_score":0.0064385235,"about_ca_system_score_codex":0.00212628,"about_ca_system_score_gemma":0.0023776973,"threshold_uncertainty_score":0.03120035},"labels":[],"label_agreement":null},{"id":"W4362513801","doi":"10.1007/978-3-031-29786-1","title":"Requirements Engineering: Foundation for Software Quality","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fondazione Bruno Kessler; Università di Pisa; Universität Zürich; Göteborgs Universitet; Universität Hamburg; Universitetet i Bergen; Háskólinn í Reykjavík; Lunds Universitet; Leibniz-Gemeinschaft; Chalmers Tekniska Högskola; University of Twente; University of Ottawa; Universität zu Köln; Blekinge Tekniska Högskola; Universiteit Utrecht; Universität Heidelberg; Politechnika Poznańska; University College Dublin; University College London; University of Cincinnati; University of Canterbury; Kennesaw State University; Università degli Studi di Trento; Commonwealth Scientific and Industrial Research Organisation; McGill University","keywords":"Computer science; Software quality; Software engineering; Foundation (evidence); Quality (philosophy); Software; Software development; Programming language","score_opus":0.051259948355492364,"score_gpt":0.3302340854669246,"score_spread":0.27897413711143226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362513801","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022114725,0.011104342,0.86190724,0.006849712,0.00067176466,0.0000978356,0.00021618845,0.001256932,0.11568458],"genre_scores_gemma":[0.1533602,0.024902072,0.7314142,0.002174837,0.0020959761,0.00052327046,0.00089221564,0.0015062084,0.08313099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974968,0.000557971,0.00014841523,0.00024852267,0.0014236935,0.00012455978],"domain_scores_gemma":[0.99592495,0.0024671543,0.00019681941,0.0006350955,0.00069664774,0.0000793051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026226295,0.0009873708,0.0007196876,0.0015658612,0.0005766744,0.0030235238,0.0011830977,0.0014533119,0.012055904],"category_scores_gemma":[0.008933082,0.00084696995,0.00096767355,0.0016207998,0.0024836904,0.0055759447,0.001675325,0.0026911562,0.004957263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014263891,0.000024192048,0.00012258199,0.00038322926,0.000018623716,0.000052636242,0.00019682173,0.0047335997,0.0011851736,0.7770874,0.025846832,0.19033462],"study_design_scores_gemma":[0.000018498898,0.000024345045,0.00017993925,0.00027294675,0.000020580781,0.00015380103,0.00005930451,0.01368621,0.0011881982,0.8382738,0.14610693,0.000015360394],"about_ca_topic_score_codex":0.001333765,"about_ca_topic_score_gemma":0.0008508567,"teacher_disagreement_score":0.012055904,"about_ca_system_score_codex":0.0012262143,"about_ca_system_score_gemma":0.0016334094,"threshold_uncertainty_score":0.040331006},"labels":[],"label_agreement":null},{"id":"W4362513832","doi":"10.1007/978-3-031-29786-1_6","title":"Scope Determined (D) and Scope Determining (G) Requirements: A New Categorization of Functional Requirements","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"","keywords":"Scope (computer science); Computer science; Requirements management; Requirements analysis; Requirements engineering; Context (archaeology); Functional requirement; Non-functional requirement; Software engineering; System requirements specification; Statement of work; Software requirements specification; User requirements document; Requirement; Systems engineering; Agile software development; Risk analysis (engineering); Software; Software development; Engineering; Software design; Programming language; Business","score_opus":0.0553492677093169,"score_gpt":0.29020898054831173,"score_spread":0.23485971283899484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362513832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02607723,0.0036524932,0.88565147,0.0018384604,0.0002440574,0.00064527604,0.00048741448,0.0011111051,0.0802925],"genre_scores_gemma":[0.2492833,0.002439506,0.7294468,0.00074643997,0.00022123361,0.00082970964,0.0011787373,0.00061754644,0.015236671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932106,0.0017901938,0.00084095827,0.0006512102,0.0031344777,0.00037250883],"domain_scores_gemma":[0.99007726,0.0051185326,0.0009910879,0.0014468009,0.0019007984,0.00046544723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040506986,0.0010337756,0.000705613,0.0055579655,0.0010030527,0.0053326506,0.002000124,0.0022513813,0.004112612],"category_scores_gemma":[0.011944778,0.0005659579,0.0016451918,0.004052342,0.004765164,0.007384309,0.0021670938,0.0025616481,0.0014987084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098797165,0.00013046575,0.0028132845,0.00046403354,0.000036097837,0.00047217667,0.005262947,0.0027236557,0.01016203,0.73372936,0.0066132275,0.23749392],"study_design_scores_gemma":[0.0001027221,0.0005686576,0.008613703,0.001108431,0.00017354013,0.0037460958,0.0047019473,0.049409296,0.007192854,0.74656636,0.17758286,0.00023340843],"about_ca_topic_score_codex":0.0035889477,"about_ca_topic_score_gemma":0.0029304551,"teacher_disagreement_score":0.0055579655,"about_ca_system_score_codex":0.0019821443,"about_ca_system_score_gemma":0.0031424,"threshold_uncertainty_score":0.021422386},"labels":[],"label_agreement":null},{"id":"W4362514913","doi":"10.1007/978-3-031-29786-1_7","title":"Using Language Models for Enhancing the Completeness of Natural-Language Requirements","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":28,"is_retracted":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":"Computer science; Terminology; Completeness (order theory); Natural language; Context (archaeology); Principal (computer security); Measure (data warehouse); Artificial intelligence; Noise (video); Filter (signal processing); Language model; Natural language processing; Data mining; Linguistics; Computer security","score_opus":0.06258945467229786,"score_gpt":0.32607047861426136,"score_spread":0.2634810239419635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362514913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01222097,0.000099376295,0.98245054,0.00040383544,0.000035004097,0.00015876061,0.00014160325,0.0014746793,0.0030152032],"genre_scores_gemma":[0.22123197,0.00026965444,0.7730824,0.00026960173,0.00006890587,0.00034003262,0.0010057975,0.0010406204,0.002691007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881837,0.005663488,0.0007562116,0.0009430028,0.0039658537,0.00048777924],"domain_scores_gemma":[0.95708305,0.02885012,0.0020506997,0.0077527715,0.0039283605,0.0003350572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008380263,0.0011990629,0.0009469431,0.0016104969,0.0007461868,0.002864759,0.0021052235,0.0012873355,0.0038408726],"category_scores_gemma":[0.043977857,0.0014437374,0.0031663477,0.0011014784,0.0016546722,0.008491837,0.0039982456,0.0034472651,0.0010504278],"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.0005351441,0.00058555615,0.0021848178,0.0011788227,0.00025495663,0.00052869064,0.0018430798,0.30131754,0.029028378,0.38611677,0.00815222,0.26827398],"study_design_scores_gemma":[0.0001113426,0.00014629778,0.00020073613,0.0001544383,0.00012323221,0.00018420319,0.0002038088,0.75154334,0.021580309,0.21300699,0.012688886,0.00005648146],"about_ca_topic_score_codex":0.0026223874,"about_ca_topic_score_gemma":0.00568363,"teacher_disagreement_score":0.008380263,"about_ca_system_score_codex":0.001396157,"about_ca_system_score_gemma":0.0032329164,"threshold_uncertainty_score":0.04431963},"labels":[],"label_agreement":null},{"id":"W4362563922","doi":"10.1007/978-3-031-29956-8_10","title":"SUNMASK: Mask Enhanced Control in Step Unrolled Denoising Autoencoders","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Security token; Noise reduction; Masking (illustration); Artificial intelligence; Generative model; Transformer; Language model; Algorithm; Generative grammar; Pattern recognition (psychology); Speech recognition","score_opus":0.01526811095811526,"score_gpt":0.24143908827592653,"score_spread":0.22617097731781127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362563922","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.009736172,0.00030427,0.98512125,0.00004517867,0.0001213556,0.000025007297,0.00006192005,0.0020717904,0.002512999],"genre_scores_gemma":[0.2833312,0.0003036157,0.6944951,0.00013102563,0.00009825007,0.00009484394,0.00029480222,0.0007661351,0.020485071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985325,0.000019499174,0.000007381364,0.000038890805,0.00006600431,0.000014938277],"domain_scores_gemma":[0.99986064,0.00005935049,0.000008628288,0.000030308815,0.00003348225,0.0000076088254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027285013,0.00044134716,0.00041357207,0.0001268871,0.00016775588,0.00047586567,0.00065718027,0.00046796078,0.0056420635],"category_scores_gemma":[0.00066492875,0.0002619442,0.0002599551,0.00016075384,0.00032965833,0.00050512375,0.000561661,0.00075680885,0.001071176],"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.00046118314,0.00009772405,0.00024146118,0.0001871249,0.000060577455,0.00012257283,0.00010478282,0.09260358,0.12581433,0.019665826,0.008376624,0.7522642],"study_design_scores_gemma":[0.000019832654,0.000075466996,0.00021329128,0.000013806235,0.000011069031,0.000057350317,0.000009426813,0.9496933,0.037598945,0.004401059,0.007894386,0.000011949817],"about_ca_topic_score_codex":0.0016632891,"about_ca_topic_score_gemma":0.0035126498,"teacher_disagreement_score":0.0056420635,"about_ca_system_score_codex":0.0002072486,"about_ca_system_score_gemma":0.00027948339,"threshold_uncertainty_score":0.018874586},"labels":[],"label_agreement":null},{"id":"W4362563956","doi":"10.1007/978-3-031-29956-8_20","title":"Searching for Human Bias Against AI-Composed Music","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Musical; Preference; Computer science; Rank (graph theory); Empirical research; Artificial intelligence; Information retrieval; Human–computer interaction; Visual arts; Statistics; Art; Mathematics","score_opus":0.06783134225847895,"score_gpt":0.2932887952803645,"score_spread":0.22545745302188555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362563956","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.7932029,0.0014913464,0.05155273,0.0031358916,0.00011741887,0.000043480668,0.00020456138,0.00039551654,0.1498562],"genre_scores_gemma":[0.9899058,0.00012336376,0.0060323733,0.00027546225,0.000027781432,0.000008847003,0.00008042167,0.000051791394,0.003494103],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988589,0.00046552822,0.000046041783,0.00026859483,0.00028619706,0.000074634765],"domain_scores_gemma":[0.99092895,0.0061605494,0.00096819695,0.0010743169,0.0006306339,0.0002373748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015039099,0.0002517795,0.00027634966,0.0007886585,0.00065440784,0.0018104409,0.00052609306,0.00073225837,0.01010284],"category_scores_gemma":[0.016900947,0.00018792784,0.00023682011,0.0005896768,0.0017770615,0.0024956854,0.0008972184,0.0007234925,0.00085331727],"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.0030065037,0.00023851178,0.18080276,0.0012512222,0.00046464673,0.00077992433,0.013361646,0.0049997033,0.06288365,0.19247624,0.015009584,0.52472556],"study_design_scores_gemma":[0.0005335015,0.00093617436,0.20030116,0.0005970534,0.00048744414,0.0036035834,0.029265357,0.07523474,0.07767796,0.5114102,0.09979004,0.00016279447],"about_ca_topic_score_codex":0.0013620626,"about_ca_topic_score_gemma":0.0021601191,"teacher_disagreement_score":0.01010284,"about_ca_system_score_codex":0.00054743077,"about_ca_system_score_gemma":0.00051930215,"threshold_uncertainty_score":0.033797383},"labels":[],"label_agreement":null},{"id":"W4362564049","doi":"10.1007/978-3-031-29956-8_27","title":"Musical Genre Recognition Based on Deep Descriptors of Harmony, Instrumentation, and Segments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Overfitting; Computer science; Interpretability; Artificial intelligence; Music information retrieval; Feature selection; Machine learning; Deep learning; Feature (linguistics); Pattern recognition (psychology); Speech recognition; Musical; Artificial neural network","score_opus":0.03432718476478811,"score_gpt":0.24593066791632107,"score_spread":0.21160348315153296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362564049","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.12933877,0.0033898116,0.8344386,0.00035926918,0.00086308393,0.000171272,0.003131661,0.00601966,0.022287792],"genre_scores_gemma":[0.54965657,0.0029770494,0.38811868,0.0004724345,0.00054071157,0.0001801565,0.012703312,0.00057738007,0.044773683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998017,0.000016012804,0.000010665097,0.00005984167,0.00006222864,0.000049639166],"domain_scores_gemma":[0.9998086,0.00003809697,0.000018813507,0.000042606734,0.000058512396,0.000033331347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966676,0.0009282301,0.0009044214,0.0015762922,0.00028359823,0.000962477,0.0008204941,0.0005346661,0.0066713104],"category_scores_gemma":[0.00046723493,0.00021942826,0.0008379583,0.0013446849,0.00023546921,0.00088207796,0.0009536225,0.0010630378,0.00536379],"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.00024336536,0.0001622787,0.0015644225,0.000112999835,0.00006634737,0.000083823754,0.000039533053,0.0047326204,0.078009844,0.0015172176,0.009107486,0.90436006],"study_design_scores_gemma":[0.00007799692,0.00045769732,0.015404573,0.00011203163,0.00019872357,0.0005864118,0.0002362878,0.9093078,0.04537944,0.009695688,0.018469082,0.00007418984],"about_ca_topic_score_codex":0.0023251504,"about_ca_topic_score_gemma":0.006167875,"teacher_disagreement_score":0.0066713104,"about_ca_system_score_codex":0.00026441854,"about_ca_system_score_gemma":0.00034176276,"threshold_uncertainty_score":0.022317767},"labels":[],"label_agreement":null},{"id":"W4362564064","doi":"10.1007/978-3-031-29956-8_19","title":"LyricJam Sonic: A Generative System for Real-Time Composition and Musical Improvisation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Electronic music; Improvisation; Studio; Lyrics; Computer music; Musical; Musical composition; Mode (computer interface); Multimedia; Workflow; Computational creativity; Generative grammar; Creativity; Human–computer interaction; Visual arts; Art; Artificial intelligence; Database; Telecommunications; Literature","score_opus":0.01959923214296752,"score_gpt":0.24754550086786242,"score_spread":0.2279462687248949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362564064","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.009584266,0.0003469991,0.81925434,0.00012868928,0.00024489735,0.00022549923,0.0010484144,0.13148896,0.037678022],"genre_scores_gemma":[0.1981777,0.0007251037,0.52470374,0.00054586615,0.00027584174,0.0008029765,0.0074993754,0.04428546,0.22298393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997024,0.00004056765,0.000019403264,0.00006578027,0.00014573698,0.000026062105],"domain_scores_gemma":[0.9997428,0.00009151259,0.000010722558,0.00007050535,0.000047077454,0.000037408277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043616348,0.0011741756,0.0006639915,0.0010343948,0.0006808576,0.0015486932,0.0020020467,0.0011966098,0.070570074],"category_scores_gemma":[0.0010403591,0.0007392439,0.00080819527,0.000532989,0.00059591146,0.0011854757,0.0025993353,0.0010491757,0.025839278],"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.00090897497,0.00023377806,0.0008121146,0.000896021,0.000093990035,0.0005424498,0.0019305,0.0068668453,0.23746672,0.028690249,0.08939097,0.63216746],"study_design_scores_gemma":[0.00052123185,0.00040785468,0.0022928289,0.00015394953,0.00020888173,0.0022560346,0.00041257183,0.136092,0.18335184,0.014011137,0.66008544,0.00020623232],"about_ca_topic_score_codex":0.00071703177,"about_ca_topic_score_gemma":0.0011287099,"teacher_disagreement_score":0.070570074,"about_ca_system_score_codex":0.0002982148,"about_ca_system_score_gemma":0.0003740252,"threshold_uncertainty_score":0.23608047},"labels":[],"label_agreement":null},{"id":"W4362653953","doi":"10.1007/978-3-031-29168-5_6","title":"Semantic-Based Classification of Relevant Case Law","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Law","field":"Social Sciences","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 Alberta","funders":"","keywords":"Computer science; Heuristics; Textual entailment; Task (project management); Artificial intelligence; Classifier (UML); Natural language processing; Domain (mathematical analysis); Information retrieval; Logical consequence","score_opus":0.07995960324170388,"score_gpt":0.343752496166066,"score_spread":0.26379289292436214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362653953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13278292,0.0030749785,0.73676676,0.0021946726,0.0005318442,0.0014004093,0.010449872,0.004075931,0.10872265],"genre_scores_gemma":[0.60362405,0.0011971416,0.36630127,0.0002268081,0.00024137013,0.00036717605,0.018834246,0.00027781187,0.00893016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975102,0.00046873675,0.00033279994,0.00039572548,0.0011051885,0.00018737555],"domain_scores_gemma":[0.9953383,0.002198911,0.00033247843,0.0006759713,0.0012725974,0.00018177842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021525454,0.0005541283,0.00063128525,0.0100043565,0.0011800475,0.0041656094,0.0016375827,0.0009713771,0.012570955],"category_scores_gemma":[0.013619285,0.00025154246,0.0012510294,0.0049943873,0.0012380453,0.0052287,0.0017829101,0.0012233398,0.0023161012],"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.00045118944,0.00042151927,0.015164412,0.00056241546,0.0001127195,0.00046574036,0.00084071537,0.009462487,0.0054897703,0.23323137,0.027423238,0.70637435],"study_design_scores_gemma":[0.000087465705,0.00012984058,0.014884852,0.0006121795,0.0002689851,0.001290817,0.0013738605,0.42425126,0.008711587,0.47164875,0.07666895,0.00007145977],"about_ca_topic_score_codex":0.003616063,"about_ca_topic_score_gemma":0.0052358354,"teacher_disagreement_score":0.012570955,"about_ca_system_score_codex":0.0015509186,"about_ca_system_score_gemma":0.0023119221,"threshold_uncertainty_score":0.042053998},"labels":[],"label_agreement":null},{"id":"W4362654035","doi":"10.1007/978-3-031-29168-5_4","title":"COLIEE 2022 Summary: Methods for Legal Document Retrieval and Entailment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Task (project management); Computer science; Statute; Component (thermodynamics); Logical consequence; Textual entailment; Competition (biology); Information retrieval; Natural language processing; Artificial intelligence; Law; Political science","score_opus":0.02988480079389599,"score_gpt":0.32232969507133435,"score_spread":0.29244489427743836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362654035","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016410605,0.03547264,0.66908324,0.022055896,0.024417276,0.0008314154,0.023144657,0.024201088,0.19915275],"genre_scores_gemma":[0.01675972,0.012969578,0.30007935,0.005007065,0.013883096,0.00077396334,0.05509336,0.012163871,0.58326995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975453,0.0003795037,0.00015211762,0.00038216388,0.0014061425,0.00013477336],"domain_scores_gemma":[0.99404645,0.0020845376,0.00008437519,0.0007267121,0.002812324,0.0002456108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032970933,0.0018313995,0.0012721102,0.0046819537,0.0014433352,0.004671743,0.0028066786,0.0021859154,0.11281858],"category_scores_gemma":[0.012248622,0.00076536776,0.001257719,0.004963053,0.00087584316,0.0046108896,0.0013032592,0.0028819484,0.06259366],"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.00006418715,0.00002275171,0.000056611858,0.00033227704,0.000020235751,0.000019565112,0.00003537275,0.000636453,0.00073451165,0.008901558,0.7923261,0.19685048],"study_design_scores_gemma":[0.000039694056,0.000035365854,0.0004536356,0.00014631294,0.000043541168,0.00011595928,0.00003153701,0.005491049,0.004816382,0.020880537,0.9678955,0.00005046877],"about_ca_topic_score_codex":0.025154853,"about_ca_topic_score_gemma":0.032748304,"teacher_disagreement_score":0.11281858,"about_ca_system_score_codex":0.0028877023,"about_ca_system_score_gemma":0.002793007,"threshold_uncertainty_score":0.37741572},"labels":[],"label_agreement":null},{"id":"W4362686060","doi":"10.1007/978-3-031-30731-7_5","title":"On Reducing Underutilization of Security Standards by Deriving Actionable Rules: An Application to IoT","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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 Ottawa; Concordia University","funders":"","keywords":"Computer science; Standardization; Audit; Computer security; Implementation; Bridging (networking); NIST; Intrusion detection system; Software engineering","score_opus":0.012882500678859878,"score_gpt":0.26275899422161225,"score_spread":0.24987649354275238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362686060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027213223,0.00075931876,0.9399135,0.0014153207,0.00016667695,0.0002027769,0.00030612675,0.0010954877,0.028927615],"genre_scores_gemma":[0.26510644,0.0015429091,0.7223403,0.0006138556,0.00016278744,0.0001710729,0.0006433262,0.0005448933,0.008874486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971091,0.0006991543,0.00018289198,0.0004566874,0.0013010402,0.00025106457],"domain_scores_gemma":[0.9861223,0.00991764,0.0005882542,0.0022199296,0.0009892196,0.00016267292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035412295,0.0008192678,0.00088947424,0.0013544229,0.00097074197,0.0023327633,0.0019454429,0.0017090972,0.0049150046],"category_scores_gemma":[0.014728433,0.0004398549,0.0018419842,0.0026561273,0.0027409496,0.004768804,0.0031945459,0.0028850273,0.00076238834],"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.00020155401,0.0005453692,0.0034216554,0.0004008365,0.00015433224,0.00061174267,0.0006337188,0.14467633,0.009713342,0.3234913,0.009588696,0.50656116],"study_design_scores_gemma":[0.000049457005,0.00009735129,0.0010882088,0.00014138508,0.00015758032,0.00039056814,0.00030750976,0.37641314,0.00853767,0.59942436,0.013348033,0.000044754845],"about_ca_topic_score_codex":0.004743088,"about_ca_topic_score_gemma":0.006638276,"teacher_disagreement_score":0.0049150046,"about_ca_system_score_codex":0.000985748,"about_ca_system_score_gemma":0.0021046954,"threshold_uncertainty_score":0.018728018},"labels":[],"label_agreement":null},{"id":"W4363609372","doi":"10.1007/978-3-031-27199-1_33","title":"Creating a Modular and Decentralized Smart Mailbox System Using LoRaWan Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT Networks and Protocols","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":"Portage College","funders":"","keywords":"Modular design; Computer science; Distributed computing; Computer network; Embedded system; Operating system","score_opus":0.017604675574944537,"score_gpt":0.23260701901607836,"score_spread":0.21500234344113384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4363609372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07637543,0.00013202296,0.8602591,0.00023629241,0.00020266479,0.0006870644,0.00015377336,0.044675533,0.01727815],"genre_scores_gemma":[0.42664117,0.00015165126,0.5394653,0.000212211,0.00009738529,0.00038579936,0.0006316073,0.002472218,0.029942594],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993799,0.00013132601,0.00004364093,0.000113201575,0.00023255072,0.00009947024],"domain_scores_gemma":[0.9991794,0.00012790036,0.000050931656,0.00034301172,0.00015584701,0.00014283428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008887898,0.0004907858,0.00064998306,0.00074506167,0.00091871514,0.0017149696,0.0017898679,0.0008091955,0.00887476],"category_scores_gemma":[0.0014250489,0.0005566433,0.0006238335,0.0004577791,0.0005556327,0.002423104,0.0022290843,0.00092044997,0.00365836],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010640931,0.0013806575,0.006630242,0.00048337178,0.00021870149,0.0013878047,0.0014585083,0.053024292,0.1960283,0.036219988,0.03426952,0.6678345],"study_design_scores_gemma":[0.00038905675,0.0006890095,0.0041341265,0.00010066526,0.00027949005,0.0010906128,0.0006116987,0.6502068,0.1566365,0.020994866,0.16463006,0.00023702928],"about_ca_topic_score_codex":0.0012514305,"about_ca_topic_score_gemma":0.0014558967,"teacher_disagreement_score":0.00887476,"about_ca_system_score_codex":0.0006504755,"about_ca_system_score_gemma":0.0007992355,"threshold_uncertainty_score":0.029689074},"labels":[],"label_agreement":null},{"id":"W4365393228","doi":"10.1007/978-3-031-30108-7_4","title":"Lagrange Programming Neural Networks for Sparse Portfolio Design","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Mathematical optimization; Portfolio; Weighting; Differentiable function; Project portfolio management; Norm (philosophy); Artificial intelligence; Mathematics; Project management","score_opus":0.046896514652502434,"score_gpt":0.26820468186828,"score_spread":0.22130816721577756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365393228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019394298,0.00052470603,0.9939569,0.00018361617,0.000047438356,0.00001790316,0.000028785937,0.00007772418,0.0032234464],"genre_scores_gemma":[0.29766956,0.0028388328,0.6522697,0.0004353057,0.00045732403,0.00052726775,0.00034515295,0.00030978562,0.04514707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00018680454,0.000013940342,0.000045555567,0.00008760949,0.000024894189],"domain_scores_gemma":[0.9988951,0.0008369657,0.00006181906,0.000059501126,0.000117212214,0.000029480823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013387034,0.00082320103,0.0009599952,0.00042657103,0.00022257291,0.0009029722,0.0009729883,0.001342066,0.007203684],"category_scores_gemma":[0.0049688322,0.00068947946,0.00042653547,0.0008738475,0.00055829796,0.0012608634,0.0013756604,0.0020596508,0.0011754144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060562754,0.000048924034,0.00019314376,0.00012518807,0.000046433346,0.000038549373,0.000029585313,0.7445427,0.0011482739,0.08793688,0.0058890586,0.1599407],"study_design_scores_gemma":[0.000005191955,0.0000110719775,0.000022735738,0.000009440481,0.0000033426077,0.0000087746575,0.0000018163636,0.97985214,0.00014908703,0.019075269,0.0008583496,0.000002872199],"about_ca_topic_score_codex":0.0009793255,"about_ca_topic_score_gemma":0.0014447991,"teacher_disagreement_score":0.007203684,"about_ca_system_score_codex":0.00052708917,"about_ca_system_score_gemma":0.00054512464,"threshold_uncertainty_score":0.024098754},"labels":[],"label_agreement":null},{"id":"W4365393262","doi":"10.1007/978-3-031-30111-7_40","title":"HPointLoc: Point-Based Indoor Place Recognition Using Synthetic RGB-D Images","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; RGB color model; Artificial intelligence; Computer vision; Modular design; Task (project management); Robot; Point (geometry); Pattern recognition (psychology)","score_opus":0.02260621180218195,"score_gpt":0.22418596909116162,"score_spread":0.20157975728897967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365393262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008837267,0.0003454404,0.9410579,0.00004806058,0.00013902521,0.0000852461,0.002646484,0.04043497,0.006405509],"genre_scores_gemma":[0.14582029,0.00070938916,0.8163608,0.00016478,0.000077443015,0.00024447334,0.011525536,0.0024242247,0.022673097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997582,0.000014674839,0.0000056813856,0.000054905235,0.00014432227,0.000022144002],"domain_scores_gemma":[0.9998673,0.000023341478,0.000009321115,0.00004160834,0.00004616463,0.000012319054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016628642,0.00091945735,0.00069690443,0.0007552861,0.00021285225,0.00077606185,0.0013894816,0.0005374595,0.014520375],"category_scores_gemma":[0.00035043745,0.0003941388,0.0005302459,0.0010418831,0.0002514662,0.0007931692,0.0010426154,0.00043951077,0.010851969],"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.0002922814,0.00009619491,0.0009833323,0.00027063023,0.0000695457,0.00015957534,0.000106827545,0.022139044,0.07801581,0.0028187803,0.046782974,0.848265],"study_design_scores_gemma":[0.000064372485,0.00018206885,0.005609327,0.000070855465,0.000045643097,0.0009294202,0.0001519663,0.75429225,0.1541949,0.0063381437,0.07800313,0.00011785005],"about_ca_topic_score_codex":0.0032622246,"about_ca_topic_score_gemma":0.00484912,"teacher_disagreement_score":0.014520375,"about_ca_system_score_codex":0.00023711426,"about_ca_system_score_gemma":0.0002488391,"threshold_uncertainty_score":0.04857552},"labels":[],"label_agreement":null},{"id":"W4365420502","doi":"10.1007/978-3-031-30105-6_10","title":"An Effective Ensemble Model Related to Incremental Learning in Neural Machine Translation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Forgetting; Machine translation; Artificial intelligence; Machine learning; Artificial neural network; Task (project management); Translation (biology); Incremental learning; Ensemble learning; Field (mathematics); Deep learning; Engineering","score_opus":0.021974915583850233,"score_gpt":0.27290528381608536,"score_spread":0.25093036823223513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365420502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01200498,0.0008995044,0.9839348,0.00023013118,0.00014824318,0.000030197783,0.00008309141,0.00041527604,0.0022538106],"genre_scores_gemma":[0.45284924,0.0016733819,0.52623004,0.00041860668,0.0006087689,0.00029119494,0.0011463431,0.00044260928,0.016339835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993655,0.00025002498,0.00004089779,0.00015028684,0.00013615536,0.000057179597],"domain_scores_gemma":[0.9981012,0.0011110505,0.00007493397,0.0002788926,0.00038043776,0.00005352067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013988288,0.00059350365,0.0012943649,0.00068393245,0.0005760358,0.0008795296,0.0016600768,0.0013159704,0.0034098981],"category_scores_gemma":[0.00418741,0.00037723366,0.0007810653,0.0014855915,0.00047563348,0.0027411517,0.0013955168,0.0019572666,0.0009947328],"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.00016519593,0.0002113663,0.0009883896,0.00014946406,0.00017571486,0.00012690926,0.00012980365,0.4286404,0.0055916198,0.08591365,0.0100858705,0.4678216],"study_design_scores_gemma":[0.000002610754,0.00002188755,0.00007602664,0.0000041093263,0.000013961352,0.000024434845,0.000004200194,0.982357,0.0005419466,0.016185472,0.0007637397,0.000004572103],"about_ca_topic_score_codex":0.0019690637,"about_ca_topic_score_gemma":0.002782126,"teacher_disagreement_score":0.0034098981,"about_ca_system_score_codex":0.00040376125,"about_ca_system_score_gemma":0.0006398851,"threshold_uncertainty_score":0.0114071965},"labels":[],"label_agreement":null},{"id":"W4365794688","doi":"10.1007/978-3-031-30933-5_22","title":"GardenQuest: Using Hexad Player Types to Design a Step-Based Multiplayer Persuasive Game for Motivating Physical Activity","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"USable; Usability; Computer science; Human–computer interaction; Plan (archaeology); Sample (material); Multimedia; Interface (matter); User interface; Field (mathematics); Simulation; Programming language; Operating system","score_opus":0.09750259468209756,"score_gpt":0.36759294268913856,"score_spread":0.270090348007041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365794688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063301474,0.0003539261,0.86016685,0.0002233406,0.00029066918,0.0005991926,0.0007486129,0.013654543,0.0606614],"genre_scores_gemma":[0.1772339,0.00048286328,0.67185825,0.00025517255,0.000025147918,0.0008835119,0.0012884092,0.0029528774,0.14501987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998714,0.00002132144,0.000007623681,0.000032151733,0.000046423444,0.000021180873],"domain_scores_gemma":[0.99988735,0.000050981547,0.0000051952948,0.000011603579,0.000022779777,0.000022054863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025779667,0.0009476597,0.00031544833,0.00038165975,0.00025336066,0.00087753474,0.0010431281,0.00062175124,0.023098389],"category_scores_gemma":[0.00045669838,0.00046986988,0.00042043088,0.00017340171,0.0002661115,0.0009248657,0.0012496373,0.0006239735,0.003893848],"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.0012049004,0.00071679143,0.003748998,0.0012297505,0.00014074378,0.00079376245,0.0022948266,0.018292787,0.15973021,0.043677624,0.047753148,0.72041655],"study_design_scores_gemma":[0.0005499193,0.0019636159,0.0071165487,0.00035055712,0.0003152742,0.0026823543,0.0012819828,0.19767018,0.14877355,0.028200302,0.6108724,0.0002233779],"about_ca_topic_score_codex":0.00079712336,"about_ca_topic_score_gemma":0.0022403756,"teacher_disagreement_score":0.023098389,"about_ca_system_score_codex":0.00018882519,"about_ca_system_score_gemma":0.0002772263,"threshold_uncertainty_score":0.07727176},"labels":[],"label_agreement":null},{"id":"W4365796043","doi":"10.1007/978-3-031-30678-5_34","title":"GIPA: A General Information Propagation Algorithm for Graph Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Engineering Link (Canada)","funders":"","keywords":"Computer science; Graph; Correlation; Algorithm; Node (physics); Computation; Perceptron; Benchmark (surveying); Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Data mining; Theoretical computer science; Mathematics","score_opus":0.01444329971809373,"score_gpt":0.24278507665615495,"score_spread":0.22834177693806124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365796043","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.00095003634,0.0002309467,0.9888784,0.00015252407,0.00012946512,0.00009170222,0.0004256135,0.0069708773,0.002170516],"genre_scores_gemma":[0.016934462,0.00030438366,0.97188866,0.0002247278,0.00009784841,0.0003123341,0.0015978739,0.0014165649,0.007223137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999273,0.00020137738,0.000033106233,0.00017614503,0.00026019217,0.000056227702],"domain_scores_gemma":[0.99879444,0.00051116606,0.000045553417,0.00030444385,0.000285324,0.000058990994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011646255,0.002078985,0.0014309748,0.0022589313,0.001011779,0.0017764651,0.0040216264,0.0026748588,0.018018289],"category_scores_gemma":[0.0049517974,0.0010028172,0.0015568273,0.0031990162,0.00089070405,0.002984883,0.0021539438,0.0040434506,0.011322446],"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.00015641963,0.00018487792,0.00028786933,0.00031694633,0.00017296003,0.00011770331,0.00007874182,0.15349421,0.0031314522,0.037318315,0.07237175,0.7323688],"study_design_scores_gemma":[0.0000486479,0.000031932563,0.00008985163,0.000027197233,0.000029577779,0.0000637011,0.000010171571,0.9313176,0.0023278152,0.052251633,0.013783592,0.000018263818],"about_ca_topic_score_codex":0.0067970934,"about_ca_topic_score_gemma":0.010374367,"teacher_disagreement_score":0.018018289,"about_ca_system_score_codex":0.00082146726,"about_ca_system_score_gemma":0.001621716,"threshold_uncertainty_score":0.060277164},"labels":[],"label_agreement":null},{"id":"W4365796204","doi":"10.1007/978-3-031-30678-5_8","title":"Meta Pseudo Labels for Anomaly Detection via Partially Observed Anomalies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Anomaly detection; Computer science; Anomaly (physics); Set (abstract data type); Data mining; Artificial intelligence; Pattern recognition (psychology); Machine learning","score_opus":0.06742611530413994,"score_gpt":0.2684141052730597,"score_spread":0.20098798996891976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365796204","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.0031129692,0.00012223561,0.9932902,0.00007933167,0.00005680029,0.00003386513,0.00023710934,0.00238031,0.0006871368],"genre_scores_gemma":[0.1413067,0.00020410282,0.8521176,0.00016261403,0.00014207653,0.00025694323,0.0013580233,0.00080156507,0.0036503242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997811,0.0005721048,0.00015740612,0.00045374202,0.00089543255,0.0001102916],"domain_scores_gemma":[0.9931496,0.0032650393,0.00045313788,0.0017781642,0.001209268,0.00014491503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018348353,0.00097376644,0.00097393384,0.0023239716,0.000629824,0.0019279125,0.0022481713,0.0013951183,0.004653175],"category_scores_gemma":[0.008672402,0.0005922017,0.0010537228,0.0014396323,0.0008870283,0.0035798298,0.0019624103,0.0023784179,0.0020574487],"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.0008465697,0.00027962256,0.0031916301,0.00046235157,0.00016157373,0.00035613458,0.0003344203,0.06996047,0.040645424,0.12710615,0.01354925,0.7431064],"study_design_scores_gemma":[0.000024245319,0.000077772886,0.0004276188,0.000043452368,0.000033886532,0.00017616461,0.000038746235,0.8690728,0.015157496,0.10891833,0.005995149,0.000034232],"about_ca_topic_score_codex":0.0011051559,"about_ca_topic_score_gemma":0.001680553,"teacher_disagreement_score":0.004653175,"about_ca_system_score_codex":0.0008997417,"about_ca_system_score_gemma":0.0010061321,"threshold_uncertainty_score":0.015566468},"labels":[],"label_agreement":null},{"id":"W4365934948","doi":"10.1007/978-3-031-30589-4","title":"Advances in Cryptology – EUROCRYPT 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Santa Barbara; University of Haifa; Institut Universitaire de France; Aalto-Yliopisto; KU Leuven; Technische Universiteit Eindhoven; University of Melbourne; University of California, San Diego; Bar-Ilan University; Durham University; Universiteit Leiden; Université du Luxembourg; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Edinburgh; Johns Hopkins University; Florida State University; Microsoft Research; Indian Institute of Science; York University; Intel Corporation","keywords":"Computer science; Cryptography; Key (lock); Public-key cryptography; Theoretical computer science; Computer security; Encryption","score_opus":0.012538791290674187,"score_gpt":0.2632252774280891,"score_spread":0.2506864861374149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365934948","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032053352,0.065651506,0.05285839,0.010633666,0.02240378,0.00020305827,0.0012598848,0.0027340404,0.8410503],"genre_scores_gemma":[0.020250885,0.025987789,0.01422626,0.0015838795,0.0049870834,0.000083415754,0.001461385,0.00097510073,0.93044424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991053,0.00012888324,0.0000365949,0.000110904955,0.00052618195,0.0000921485],"domain_scores_gemma":[0.999303,0.00013683097,0.000053908083,0.00017722383,0.00021516645,0.00011382722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001292383,0.0014274917,0.00083722675,0.0018264402,0.00059788814,0.003756554,0.0008625507,0.0017378762,0.085693724],"category_scores_gemma":[0.0017470737,0.00048327702,0.00041397777,0.0021861359,0.0007717531,0.0043756133,0.0015752967,0.0034308562,0.07492743],"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.00012893249,0.00006662736,0.0000807842,0.00031235555,0.000020823256,0.000052230225,0.00002040432,0.0012519539,0.0018852513,0.07470076,0.52689457,0.39458534],"study_design_scores_gemma":[0.00002610474,0.000052646443,0.00026579798,0.00014169187,0.000009496522,0.00022254237,0.000008578378,0.0022828123,0.0018257813,0.018617343,0.97653586,0.000011279667],"about_ca_topic_score_codex":0.0007597108,"about_ca_topic_score_gemma":0.00083941437,"teacher_disagreement_score":0.085693724,"about_ca_system_score_codex":0.0016120694,"about_ca_system_score_gemma":0.0013971638,"threshold_uncertainty_score":0.28667402},"labels":[],"label_agreement":null},{"id":"W4365934985","doi":"10.1007/978-3-031-30545-0","title":"Advances in Cryptology – EUROCRYPT 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Santa Barbara; University of Haifa; Institut Universitaire de France; Aalto-Yliopisto; KU Leuven; Technische Universiteit Eindhoven; University of Melbourne; University of California, San Diego; Bar-Ilan University; Durham University; Universiteit Leiden; Université du Luxembourg; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Edinburgh; Johns Hopkins University; Florida State University; Microsoft Research; Indian Institute of Science; York University; Intel Corporation","keywords":"Computer science; Cryptography; Theoretical computer science; Algorithm","score_opus":0.01673783775470455,"score_gpt":0.29470404848705056,"score_spread":0.277966210732346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365934985","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028913703,0.06530831,0.05097864,0.009665597,0.022026174,0.00016972252,0.00095767976,0.0021276637,0.8458749],"genre_scores_gemma":[0.017912712,0.023414645,0.012258566,0.0013413323,0.004357396,0.00006812442,0.0010197484,0.00078788097,0.9388395],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991628,0.000115754985,0.000032730404,0.00010008926,0.00050794287,0.00008063887],"domain_scores_gemma":[0.99941194,0.00011786318,0.000042723666,0.0001523241,0.00017860434,0.00009655531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011579401,0.0013185887,0.00076459354,0.001729626,0.0006123593,0.0037135403,0.00081045605,0.001718302,0.07975811],"category_scores_gemma":[0.001561396,0.0004849214,0.00039974757,0.0021665536,0.0007885213,0.0042414926,0.0016182368,0.0034733585,0.06765922],"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.0001050661,0.00006208266,0.00007336209,0.00030570512,0.000018069788,0.00004946419,0.000026015308,0.0011707001,0.0019756441,0.09496154,0.5056801,0.39557225],"study_design_scores_gemma":[0.000019074809,0.000043287124,0.00022453541,0.00012702594,0.0000073751203,0.00019433792,0.000008919642,0.0018081943,0.0015973025,0.02017895,0.9757809,0.000010043075],"about_ca_topic_score_codex":0.0006606555,"about_ca_topic_score_gemma":0.00079386076,"teacher_disagreement_score":0.07975811,"about_ca_system_score_codex":0.0015192298,"about_ca_system_score_gemma":0.0012857676,"threshold_uncertainty_score":0.26681745},"labels":[],"label_agreement":null},{"id":"W4366307844","doi":"10.1007/978-3-031-30872-7_8","title":"Unlinkable Policy-Based Sanitizable Signatures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"Computer science","score_opus":0.017185614919197244,"score_gpt":0.25173951234884917,"score_spread":0.23455389742965194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366307844","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.03277768,0.0007169416,0.88395125,0.0013278557,0.0007914212,0.00025742222,0.00035151004,0.007633602,0.07219234],"genre_scores_gemma":[0.69758457,0.00094016595,0.2058865,0.00082358153,0.0004337272,0.0004484068,0.0009931229,0.0016881448,0.09120174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995346,0.00092903967,0.00032326617,0.0006045962,0.0021879082,0.00060927623],"domain_scores_gemma":[0.9897254,0.0033124369,0.00057585957,0.0049532843,0.0011065782,0.0003263663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025848784,0.00080101506,0.0010062989,0.0012842091,0.0012348655,0.0042489646,0.0021230853,0.0019157213,0.010757091],"category_scores_gemma":[0.009017445,0.00079352566,0.00056912785,0.0015606268,0.0030926205,0.00901964,0.0056809783,0.0058751167,0.0074234805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089529617,0.0003483042,0.00039406843,0.0002614173,0.00003584745,0.00017572808,0.00062198227,0.022341508,0.016308278,0.72543114,0.012968277,0.22021814],"study_design_scores_gemma":[0.00013591399,0.00019183877,0.0001625491,0.00012018607,0.00004767991,0.0003287085,0.00011944927,0.14464942,0.042895414,0.7519031,0.0593727,0.00007299184],"about_ca_topic_score_codex":0.00030213804,"about_ca_topic_score_gemma":0.00030558917,"teacher_disagreement_score":0.010757091,"about_ca_system_score_codex":0.0016856117,"about_ca_system_score_gemma":0.0017309801,"threshold_uncertainty_score":0.035986066},"labels":[],"label_agreement":null},{"id":"W4366503778","doi":"10.1007/978-3-031-30829-1_14","title":"Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"University of Oxford","keywords":"Probabilistic logic; Markov chain; Probabilistic CTL; Sequence (biology); Computer science; Similarity (geometry); Algorithm; Discrete mathematics; Construct (python library); Markov process; Theoretical computer science; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Programming language; Statistics","score_opus":0.0411923936904238,"score_gpt":0.2994723685979013,"score_spread":0.25827997490747745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366503778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08662875,0.0004448129,0.9027931,0.0008223473,0.00006834118,0.00010309628,0.00019434068,0.0008349625,0.008110129],"genre_scores_gemma":[0.6973527,0.00036811334,0.29642767,0.0003298897,0.000078452125,0.0002116378,0.00046053066,0.0002202459,0.0045506917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973416,0.0007143223,0.00017716602,0.00066428294,0.00090084627,0.00020181945],"domain_scores_gemma":[0.98954904,0.007939549,0.0006954565,0.00088421797,0.00073719205,0.00019449272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001947391,0.0005652824,0.0005095818,0.0013449078,0.00073001516,0.0020923056,0.0015264374,0.001220332,0.003616929],"category_scores_gemma":[0.010636899,0.0004962769,0.0014597832,0.0012981663,0.0025409493,0.003980415,0.0020324606,0.0023315183,0.00038733118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010205977,0.000039920895,0.0010664077,0.00015836206,0.00004278413,0.00017977884,0.00040295825,0.043808777,0.0043115537,0.917027,0.0010842182,0.03177615],"study_design_scores_gemma":[0.000020547213,0.00004129977,0.00038829356,0.00004068034,0.000037591246,0.0001309271,0.00005883219,0.20289956,0.0050513954,0.78674996,0.004553867,0.000027107066],"about_ca_topic_score_codex":0.0013551932,"about_ca_topic_score_gemma":0.001125964,"teacher_disagreement_score":0.003616929,"about_ca_system_score_codex":0.0025373383,"about_ca_system_score_gemma":0.00093163684,"threshold_uncertainty_score":0.018409789},"labels":[],"label_agreement":null},{"id":"W4366547923","doi":"10.1007/978-3-031-30829-1_12","title":"Unboundedness Problems for Machines with Reversal-Bounded Counters","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Algorithm; Computer science; Artificial intelligence; Bounded function; Mathematics; Mathematical analysis","score_opus":0.017781245282572078,"score_gpt":0.23826780013101084,"score_spread":0.22048655484843876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366547923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44992593,0.0006123504,0.52763575,0.005559492,0.00026527152,0.0003920633,0.0010640491,0.0026264838,0.01191862],"genre_scores_gemma":[0.8904929,0.0001948011,0.10217416,0.00079652196,0.00014772062,0.00026571413,0.0011265604,0.00024840326,0.004553096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99120176,0.0028150303,0.0007460496,0.0021785346,0.0016549545,0.0014036901],"domain_scores_gemma":[0.9627295,0.0297605,0.0023132467,0.0020957713,0.0019273491,0.0011735639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047089625,0.0007984218,0.0011494856,0.0008750736,0.001556631,0.0048275245,0.002050722,0.0022147254,0.0049681063],"category_scores_gemma":[0.02286296,0.00083870674,0.002412702,0.0007832801,0.0045888317,0.009766941,0.0034011218,0.004365345,0.00064530317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013730066,0.00042683422,0.0036529787,0.0005872111,0.00012926199,0.0007957091,0.0011384048,0.084401384,0.020518674,0.83991843,0.0046730796,0.042384945],"study_design_scores_gemma":[0.0001586388,0.00013961931,0.00039192918,0.000056030407,0.000055606684,0.00022896353,0.00028171387,0.21406482,0.018803768,0.761625,0.0041145375,0.00007933017],"about_ca_topic_score_codex":0.0019791818,"about_ca_topic_score_gemma":0.0012008608,"teacher_disagreement_score":0.0049681063,"about_ca_system_score_codex":0.0025750592,"about_ca_system_score_gemma":0.0025302265,"threshold_uncertainty_score":0.024903655},"labels":[],"label_agreement":null},{"id":"W4366572462","doi":"10.1007/978-3-031-30933-5","title":"Persuasive Technology","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Salzburg; University of Ghana; Austrian Institute of Technology; Khalifa University of Science, Technology and Research; Technische Universiteit Eindhoven; RWTH Aachen University; University of Waterloo; University of Twente; University of Wollongong; Universität Duisburg-Essen; Tsinghua University; Hamad Bin Khalifa University; William Paterson University of New Jersey; University of Ottawa; Massey University; Bournemouth University","keywords":"Computer science","score_opus":0.016967862563580443,"score_gpt":0.279460381789345,"score_spread":0.26249251922576455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366572462","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016696795,0.01462894,0.021236766,0.0021617461,0.0015080514,0.000032622283,0.000086653345,0.000756991,0.95791847],"genre_scores_gemma":[0.031978223,0.007254897,0.006671683,0.0006954284,0.0005000947,0.000068682646,0.00017383779,0.00024888554,0.95240825],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.00006840167,0.000009950064,0.000043882235,0.00015747793,0.000020394176],"domain_scores_gemma":[0.99961096,0.00022005379,0.000013831888,0.00006211225,0.00006643334,0.000026629084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033369684,0.00069746224,0.00036262185,0.0011387202,0.00089100155,0.0031720991,0.0005659274,0.0015454767,0.09716459],"category_scores_gemma":[0.001395157,0.00031653923,0.0002597668,0.0008914851,0.0007367121,0.0032378663,0.0011790319,0.0015311241,0.037139572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050631836,0.00008531865,0.00009966183,0.00038699625,0.000011810628,0.00014232329,0.0011924623,0.00024151424,0.002818019,0.21208975,0.24205728,0.54082423],"study_design_scores_gemma":[0.000011432766,0.000038629034,0.00024940865,0.00021502706,0.0000094792895,0.00038226796,0.00030869487,0.00052047416,0.0014594638,0.071681544,0.9251147,0.000008819456],"about_ca_topic_score_codex":0.00026383632,"about_ca_topic_score_gemma":0.0005195007,"teacher_disagreement_score":0.09716459,"about_ca_system_score_codex":0.00038548053,"about_ca_system_score_gemma":0.00036229775,"threshold_uncertainty_score":0.32504797},"labels":[],"label_agreement":null},{"id":"W4366572515","doi":"10.1007/978-3-031-30933-5_14","title":"Persuasive Strategies and Emotional States: Towards Emotion-Adaptive Persuasive Technologies Design","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Persuasive technology; Psychology; Negative emotion; Computer science; Cognitive psychology; Affective computing; Empirical research; Social psychology; Persuasion; Human–computer interaction","score_opus":0.04267785220215346,"score_gpt":0.2784897387309084,"score_spread":0.2358118865287549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366572515","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037579898,0.00464768,0.9158982,0.0016826611,0.0001787627,0.0001768874,0.000049656708,0.0005619852,0.039224315],"genre_scores_gemma":[0.593775,0.0033078853,0.38267535,0.0005113431,0.00010390577,0.00059965247,0.00012608056,0.00019172605,0.018709052],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993012,0.00037683995,0.00003270842,0.000102847276,0.0001572187,0.0000290669],"domain_scores_gemma":[0.9983127,0.0013562322,0.000083218416,0.00008115666,0.00013084631,0.000035916877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013020426,0.00061244634,0.00031106867,0.00035502613,0.00022309048,0.0030881015,0.00092801696,0.0010878397,0.0040690843],"category_scores_gemma":[0.00464323,0.00030073817,0.0004171925,0.0003433149,0.0009452686,0.0023638885,0.0009002438,0.0013555946,0.0007493593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020761124,0.0002931163,0.001756641,0.0012718537,0.00012122903,0.00014741413,0.009360343,0.009805763,0.032432552,0.27230966,0.0043148547,0.66797894],"study_design_scores_gemma":[0.00021625453,0.0007678486,0.005801022,0.0012989112,0.00039175779,0.00075697806,0.004994753,0.2118775,0.044885647,0.6223981,0.10650757,0.000103714345],"about_ca_topic_score_codex":0.00015837068,"about_ca_topic_score_gemma":0.0001798506,"teacher_disagreement_score":0.0040690843,"about_ca_system_score_codex":0.00032408096,"about_ca_system_score_gemma":0.00032782392,"threshold_uncertainty_score":0.013612449},"labels":[],"label_agreement":null},{"id":"W4366958160","doi":"10.1007/978-3-031-30448-4_20","title":"Broadcasting in Split Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Network topology; Heuristic; Scope (computer science); Node (physics); Time complexity; Computer network; Distributed computing; Theoretical computer science; Algorithm","score_opus":0.026584700248262115,"score_gpt":0.24605594015525825,"score_spread":0.21947123990699613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366958160","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.17227241,0.00961061,0.3185078,0.0022134287,0.0006832248,0.0001596801,0.0009504852,0.0012858132,0.49431655],"genre_scores_gemma":[0.6714047,0.009948717,0.07050665,0.0006751154,0.00051602215,0.00023612489,0.0017028839,0.0007621921,0.24424765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987555,0.000025789237,0.0000048071424,0.000030299036,0.00004067402,0.000022959986],"domain_scores_gemma":[0.9995714,0.00021422839,0.00003246191,0.00008145388,0.000057432957,0.000043029246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015947825,0.00034197574,0.0004793557,0.00090436405,0.0006070605,0.001017949,0.00051104155,0.00043614602,0.010879264],"category_scores_gemma":[0.0010041981,0.00037615674,0.00028525048,0.0014687274,0.0006030992,0.0017663025,0.0008180669,0.0010818507,0.001907466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098687495,0.000027888485,0.00016216599,0.00022449424,0.000020090254,0.00009690931,0.0002779183,0.011013109,0.004771101,0.89063436,0.019742904,0.07293024],"study_design_scores_gemma":[0.000019535692,0.000025290059,0.0002766718,0.00004090296,0.00002110039,0.00017489992,0.000097174874,0.028731244,0.0018285253,0.94036776,0.028408581,0.000008356789],"about_ca_topic_score_codex":0.0010714164,"about_ca_topic_score_gemma":0.0013588488,"teacher_disagreement_score":0.010879264,"about_ca_system_score_codex":0.0007800845,"about_ca_system_score_gemma":0.00035279224,"threshold_uncertainty_score":0.036394835},"labels":[],"label_agreement":null},{"id":"W4366958223","doi":"10.1007/978-3-031-30448-4_4","title":"Independent Set Under a Change Constraint from an Initial Solution","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interval graph; Combinatorics; Mathematics; Bipartite graph; Chordal graph; Comparability; Vertex cover; Split graph; Independent set; Discrete mathematics; Maximal independent set; Vertex (graph theory); Bounded function; Time complexity; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.09432143081044465,"score_gpt":0.3439484019149341,"score_spread":0.24962697110448945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366958223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09973428,0.0005932244,0.8477851,0.0015805505,0.00029461988,0.00054832123,0.0012414746,0.00093982613,0.04728256],"genre_scores_gemma":[0.5123023,0.00053079,0.45623884,0.0005589814,0.0002238837,0.00077601627,0.0031414607,0.000487324,0.025740484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983348,0.00030505282,0.00006607632,0.0005766636,0.0004769929,0.00024046845],"domain_scores_gemma":[0.99655163,0.0018100387,0.00026204326,0.00080467376,0.0003660656,0.00020550817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017164366,0.0009518802,0.0009936624,0.00077818386,0.0010316372,0.001910698,0.0033081812,0.0016378999,0.0141594205],"category_scores_gemma":[0.008237021,0.0005124923,0.0013673538,0.001712458,0.0011647769,0.0044801105,0.0022187044,0.0032034984,0.0018326252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097017473,0.00066025596,0.0021970437,0.00080970966,0.00017106507,0.0009246663,0.00044116305,0.35346606,0.016815197,0.3343069,0.02198561,0.2672522],"study_design_scores_gemma":[0.00018369163,0.00042446586,0.0011999753,0.000100157944,0.000102189595,0.00059595896,0.00022665698,0.7178968,0.015545136,0.22287041,0.040796366,0.00005816499],"about_ca_topic_score_codex":0.0013741198,"about_ca_topic_score_gemma":0.0013690144,"teacher_disagreement_score":0.0141594205,"about_ca_system_score_codex":0.0014326662,"about_ca_system_score_gemma":0.0016715499,"threshold_uncertainty_score":0.04736793},"labels":[],"label_agreement":null},{"id":"W4367281628","doi":"10.1007/978-3-031-31414-8","title":"Reasoning Web. Causality, Explanations and Declarative Knowledge","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"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":"Brock University","keywords":"Computer science; Semantic Web; Causal reasoning; Causality (physics); Social Semantic Web; World Wide Web; Programming language; Cognitive science; Natural language processing; Cognition","score_opus":0.03494517916912287,"score_gpt":0.2998754125673112,"score_spread":0.26493023339818833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367281628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008670953,0.07750736,0.62967795,0.011973407,0.0021175107,0.00017099825,0.0023730376,0.003544457,0.26396433],"genre_scores_gemma":[0.23870228,0.06184346,0.4002549,0.0035806422,0.0025730452,0.00045498533,0.010081408,0.0012725733,0.28123674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966586,0.00007370924,0.000038924478,0.000062690895,0.00014099924,0.000017764216],"domain_scores_gemma":[0.9989999,0.0006693985,0.000069250316,0.00012924145,0.00010757352,0.000024740231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007461857,0.0011797734,0.0007111257,0.0019423226,0.0006447066,0.0036557086,0.0012102799,0.00148559,0.012370029],"category_scores_gemma":[0.0028522129,0.0010903411,0.0008733914,0.002959996,0.0015485066,0.008138343,0.0014925282,0.0024139795,0.0035516093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049197453,0.00009830584,0.00035680717,0.0006536299,0.00005803891,0.00025669596,0.0002910976,0.00881094,0.0006474439,0.67836124,0.061613113,0.24880342],"study_design_scores_gemma":[0.000015620299,0.0000047456115,0.00015327724,0.00012260074,0.000028216302,0.00023509245,0.00005054764,0.009422101,0.0006790971,0.9373003,0.051978692,0.000009768707],"about_ca_topic_score_codex":0.0034834293,"about_ca_topic_score_gemma":0.003537688,"teacher_disagreement_score":0.012370029,"about_ca_system_score_codex":0.0010006231,"about_ca_system_score_gemma":0.00076284254,"threshold_uncertainty_score":0.041381836},"labels":[],"label_agreement":null},{"id":"W4367591217","doi":"10.1007/978-981-99-2233-8","title":"Big Data Intelligence and Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","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":"Dr B R Ambedkar National Institute of Technology Jalandhar; Indian Institute of Technology Indore; Menofia University; Swami Rama Himalayan University; Nanjing University; Nanjing University of Information Science and Technology; Université de Tunis; Universidad de Chile; Guilin University of Electronic Technology; Universiti Putra Malaysia; Deakin University; Indian Institute of Technology Delhi; University of North Florida; Macquarie University; University of Macedonia; Università degli Studi di Salerno; Iowa State University; Middlesex University; Al-Balqa' Applied University","keywords":"Computer science; Big data; Autonomic computing; Computational intelligence; Analytics; Data science; Computation; Artificial intelligence; Cloud computing; Data mining; Operating system; Algorithm","score_opus":0.1406957120522474,"score_gpt":0.3078130284511683,"score_spread":0.1671173163989209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367591217","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014912101,0.2021039,0.08578322,0.033406157,0.019684194,0.00021047177,0.000997539,0.0021270656,0.65419626],"genre_scores_gemma":[0.029599583,0.12878188,0.053258054,0.01556716,0.016953155,0.00036879486,0.0016324989,0.0016539434,0.7521849],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901485,0.00017396608,0.000044391247,0.00012864354,0.0005826626,0.000055325418],"domain_scores_gemma":[0.9984124,0.0007246016,0.00006802622,0.00042126884,0.00022274749,0.0001508672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012481849,0.001482366,0.0014818825,0.002339893,0.0008107697,0.005358084,0.00079828594,0.0013666201,0.03410542],"category_scores_gemma":[0.002739106,0.0007449988,0.00050376204,0.0041311323,0.0026411996,0.009583601,0.0035653405,0.0036388745,0.02328345],"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.000032727425,0.000030169105,0.00017248816,0.0005081822,0.000033594784,0.000043350716,0.00015504425,0.00064526533,0.0006941945,0.23833698,0.4921988,0.26714918],"study_design_scores_gemma":[0.00000641808,0.000014882503,0.0003414139,0.0002002712,0.000008792416,0.00013849777,0.0000701025,0.0011543254,0.00021682648,0.24372265,0.7541156,0.00001028271],"about_ca_topic_score_codex":0.00068817765,"about_ca_topic_score_gemma":0.0010982434,"teacher_disagreement_score":0.03410542,"about_ca_system_score_codex":0.0012852527,"about_ca_system_score_gemma":0.0012518902,"threshold_uncertainty_score":0.11409402},"labels":[],"label_agreement":null},{"id":"W4367593108","doi":"10.1007/978-3-031-31371-4_6","title":"Credibility in Private Set Membership","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Communication source; Credibility; Computer science; Soundness; Password; Set (abstract data type); Logarithm; Protocol (science); Theoretical computer science; Private information retrieval; Computer security; Construct (python library); Discrete mathematics; Algorithm; Computer network; Mathematics; Programming language","score_opus":0.03978685205691578,"score_gpt":0.2708716261121927,"score_spread":0.2310847740552769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367593108","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044435013,0.006986575,0.4644716,0.029570563,0.0011377068,0.0001069445,0.00051369745,0.00040218496,0.45237577],"genre_scores_gemma":[0.88177514,0.0031852038,0.033414554,0.0010485261,0.002667335,0.00021729355,0.00028605742,0.00029071074,0.07711518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954091,0.0021214113,0.00016237961,0.00052091473,0.0015117031,0.00027444673],"domain_scores_gemma":[0.96330583,0.031002527,0.0008755466,0.0029741044,0.0013544846,0.00048749146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004989643,0.00061903015,0.0013465392,0.0016826462,0.0024383385,0.0059888423,0.0016292724,0.0033883194,0.014456757],"category_scores_gemma":[0.03985673,0.0008689413,0.0008006884,0.0030359887,0.008444728,0.016764522,0.0035901056,0.008623175,0.002286428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017866054,0.000005369025,0.000048294874,0.000023791174,0.0000025434504,0.0000151231525,0.000098524266,0.0012391664,0.000055150213,0.99033445,0.0019218602,0.0062379297],"study_design_scores_gemma":[0.0000029442328,0.0000020379134,0.0000174819,0.0000069965113,0.0000013534968,0.000015621761,0.000012347122,0.0024932052,0.000046620753,0.9958509,0.0015481829,0.0000023175385],"about_ca_topic_score_codex":0.0006510969,"about_ca_topic_score_gemma":0.00037657432,"teacher_disagreement_score":0.014456757,"about_ca_system_score_codex":0.003894164,"about_ca_system_score_gemma":0.0009841856,"threshold_uncertainty_score":0.048362672},"labels":[],"label_agreement":null},{"id":"W4367833740","doi":"10.1007/978-3-031-35302-4_25","title":"Extraction of Volumetric Indices from Echocardiography: Which Deep Learning Solution for Clinical Use?","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Grand Équipement National De Calcul Intensif; Agence Nationale de la Recherche","keywords":"Extraction (chemistry); Computer science; Artificial intelligence; Chromatography; Chemistry","score_opus":0.05970480299960167,"score_gpt":0.3505284822115734,"score_spread":0.2908236792119717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367833740","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.02179631,0.016748508,0.9424362,0.0072023063,0.00067232415,0.00010322137,0.001444118,0.003058293,0.0065387813],"genre_scores_gemma":[0.20390995,0.027912227,0.74458647,0.0019771077,0.0014836101,0.00015940488,0.0032182885,0.000890052,0.015862854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998293,0.000031040858,0.000016245296,0.000041950723,0.0000549127,0.000026502283],"domain_scores_gemma":[0.99946004,0.00018192518,0.00006306605,0.000085697626,0.00014086365,0.00006853253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082644855,0.0010112379,0.001043717,0.0006402322,0.00015394799,0.002074015,0.0011832741,0.0011521232,0.005315343],"category_scores_gemma":[0.00284103,0.00053316256,0.0007901332,0.0007915119,0.00033201437,0.0016057565,0.0009953072,0.002059857,0.0044536325],"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.000118577685,0.00007995518,0.0020970525,0.00023740168,0.000056844085,0.00009059176,0.0000434089,0.004707956,0.010604005,0.0029443814,0.016641462,0.9623784],"study_design_scores_gemma":[0.00013916407,0.00048257312,0.013039618,0.0020013854,0.00043488506,0.0042472165,0.00040964276,0.71199375,0.07384745,0.11067512,0.0825176,0.0002116223],"about_ca_topic_score_codex":0.0016137218,"about_ca_topic_score_gemma":0.0033433565,"teacher_disagreement_score":0.005315343,"about_ca_system_score_codex":0.00026489393,"about_ca_system_score_gemma":0.0007645003,"threshold_uncertainty_score":0.017781556},"labels":[],"label_agreement":null},{"id":"W4372050394","doi":"10.1007/978-3-031-31778-1_14","title":"Automated Segmentation of the Left Atrium and Scar Using Deep Convolutional Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Atrial Fibrillation Management and Outcomes","field":"Medicine","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":"Canadian VIGOUR Centre; University of Alberta","funders":"","keywords":"Hausdorff distance; Segmentation; Convolutional neural network; Computer science; Artificial intelligence; Magnetic resonance imaging; Pattern recognition (psychology); Scars; Atrial fibrillation; Left atrium; Medicine; Computer vision; Radiology; Cardiology; Pathology","score_opus":0.04264511688837171,"score_gpt":0.3047230589329777,"score_spread":0.262077942044606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372050394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06264612,0.0047538453,0.91487056,0.0007071317,0.00034828883,0.00018898468,0.0017245882,0.005497083,0.009263491],"genre_scores_gemma":[0.36098957,0.0038570226,0.60865974,0.0006673955,0.0003231502,0.00018688415,0.0043190573,0.0012508595,0.019746339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977785,0.000023813658,0.000014748352,0.00006598649,0.00006843218,0.000049174632],"domain_scores_gemma":[0.9996692,0.00014701794,0.000036903155,0.000048745955,0.00006983554,0.000028278877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052347075,0.00094740733,0.0008509633,0.0014585812,0.0003003972,0.0018184191,0.00094370596,0.0011382982,0.0026065253],"category_scores_gemma":[0.00091413583,0.0007121945,0.0010328774,0.00077670993,0.00027200676,0.0005909267,0.0008122706,0.00090784417,0.001736145],"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.00024215787,0.00010492413,0.0039094416,0.00028671906,0.00011169872,0.0005041108,0.00011697198,0.061637886,0.04017684,0.0034844722,0.016056811,0.8733679],"study_design_scores_gemma":[0.00002441291,0.000079533296,0.005155862,0.00016059948,0.00007326615,0.0012622788,0.000055499786,0.9395171,0.031060683,0.010153675,0.012411976,0.000045166642],"about_ca_topic_score_codex":0.0063355467,"about_ca_topic_score_gemma":0.015006238,"teacher_disagreement_score":0.0063355467,"about_ca_system_score_codex":0.0006384821,"about_ca_system_score_gemma":0.0012257355,"threshold_uncertainty_score":0.012597382},"labels":[],"label_agreement":null},{"id":"W4376456726","doi":"10.1007/978-3-031-31445-2_8","title":"Exploiting the New Power ISA™ Matrix Math Instructions Through Compiler Built-ins","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; IBM (Canada)","funders":"","keywords":"Compiler; Computer science; Programming language; Parallel computing; Computation; Linear algebra; IBM; Operating system","score_opus":0.031055526414875103,"score_gpt":0.2870764627653228,"score_spread":0.2560209363504477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376456726","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.030916154,0.0013126408,0.857098,0.0009391745,0.0008813834,0.00012395998,0.00039299953,0.024637908,0.08369782],"genre_scores_gemma":[0.20902975,0.00120156,0.7426229,0.0007764797,0.00040058076,0.00016338316,0.0008920609,0.00611922,0.03879403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969983,0.00003270337,0.000017651737,0.000047308382,0.00016566539,0.000036870377],"domain_scores_gemma":[0.9995109,0.00017287859,0.000030002911,0.00015222617,0.00011222293,0.000021802014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025729035,0.0011446336,0.00040910873,0.0006784698,0.00043081638,0.0017050236,0.0012750541,0.00045123792,0.017288547],"category_scores_gemma":[0.0012647894,0.0005873893,0.00067036395,0.0008188971,0.0006888782,0.0028666297,0.0011754457,0.0016460881,0.008072687],"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.00040788064,0.00021641912,0.00117238,0.0006309328,0.00008845829,0.0003959317,0.0003883274,0.016897207,0.09157667,0.22583148,0.05352817,0.60886616],"study_design_scores_gemma":[0.00032269704,0.00028761633,0.0009944373,0.00022224251,0.00016897066,0.00076195813,0.0001592515,0.22121924,0.20008513,0.27943504,0.29620925,0.00013412278],"about_ca_topic_score_codex":0.00091191364,"about_ca_topic_score_gemma":0.00248141,"teacher_disagreement_score":0.017288547,"about_ca_system_score_codex":0.00040203155,"about_ca_system_score_gemma":0.000715412,"threshold_uncertainty_score":0.057835937},"labels":[],"label_agreement":null},{"id":"W4376473171","doi":"10.1007/978-3-031-32180-1_10","title":"Evaluation of the Use of Low Precision Floating-Point Arithmetic for Applications in Radio Astronomy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Herzberg Institute of Astrophysics","funders":"","keywords":"Digital signal processing; Computer science; Upgrade; Radio astronomy; Bandwidth (computing); Electromagnetic interference; Millimeter; Signal processing; Computer hardware; Telecommunications; Physics; Astronomy","score_opus":0.07419582912512034,"score_gpt":0.3185929965358885,"score_spread":0.24439716741076817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376473171","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.4924853,0.0120620495,0.32174566,0.0007849765,0.0006702291,0.00023769548,0.0018752839,0.009000487,0.1611383],"genre_scores_gemma":[0.83583015,0.0019160981,0.14386365,0.00012233747,0.00006653631,0.0000903677,0.0012408904,0.0007982257,0.016071754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979723,0.0003791491,0.00007524932,0.00010490384,0.0013051142,0.00016329906],"domain_scores_gemma":[0.9946004,0.0029799333,0.000205635,0.0004865486,0.0016341353,0.000093342045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671915,0.00093107554,0.00057741493,0.0011563997,0.0004665073,0.0017692399,0.0013847742,0.0005954601,0.010330405],"category_scores_gemma":[0.010084734,0.00017913537,0.00036703542,0.001532377,0.00043245626,0.001271522,0.00055596436,0.00054420804,0.001822031],"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.0020035612,0.00031189324,0.004287966,0.001729714,0.0001225218,0.000380166,0.00025264474,0.1842957,0.05705787,0.050890915,0.020445405,0.67822164],"study_design_scores_gemma":[0.000120581055,0.0007644746,0.0045637614,0.00039632217,0.00019770401,0.0005081036,0.00026713937,0.78720546,0.13822688,0.021073503,0.046613116,0.00006298741],"about_ca_topic_score_codex":0.0019423678,"about_ca_topic_score_gemma":0.0020635328,"teacher_disagreement_score":0.010330405,"about_ca_system_score_codex":0.000915291,"about_ca_system_score_gemma":0.0009726533,"threshold_uncertainty_score":0.034558654},"labels":[],"label_agreement":null},{"id":"W4376473506","doi":"10.1007/978-3-031-32636-3_14","title":"Activity Detection from Encrypted Remote Desktop Protocol Traffic","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Computer science; Encryption; Protocol (science); Operating system; Computer network; Embedded system","score_opus":0.021408310607060985,"score_gpt":0.2595527672863681,"score_spread":0.23814445667930711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376473506","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.7982443,0.0002679598,0.19030862,0.00006659677,0.000051940162,0.0000756609,0.00032462756,0.0022169505,0.008443386],"genre_scores_gemma":[0.980415,0.00011246237,0.015543401,0.00001732675,0.000023543646,0.000017574113,0.00025499577,0.000045581346,0.003570124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996251,0.000053136984,0.000013164084,0.000053380074,0.0001833005,0.00007195388],"domain_scores_gemma":[0.9994011,0.0002322168,0.00006740438,0.00010044612,0.00016341265,0.000035404122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018675851,0.00036320311,0.00044539396,0.0011222878,0.00023624886,0.0005068905,0.00041649883,0.00040081659,0.001634405],"category_scores_gemma":[0.0010049447,0.0001453892,0.00013617585,0.0006511394,0.00018082022,0.00047278818,0.0004902294,0.00034162743,0.0010161351],"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.0015824485,0.00048629718,0.021378005,0.00010776023,0.000053319745,0.0008164899,0.00017683236,0.022860132,0.38519177,0.0033784101,0.00234748,0.561621],"study_design_scores_gemma":[0.000029227214,0.000422026,0.018334158,0.000019721014,0.00003818271,0.0017306167,0.00012650713,0.7169877,0.25766346,0.0024909892,0.0021300819,0.000027222242],"about_ca_topic_score_codex":0.00047610883,"about_ca_topic_score_gemma":0.00053448166,"teacher_disagreement_score":0.001634405,"about_ca_system_score_codex":0.00024209708,"about_ca_system_score_gemma":0.00014762125,"threshold_uncertainty_score":0.0054676533},"labels":[],"label_agreement":null},{"id":"W4376552431","doi":"10.1007/11766247","title":"Advances in Artificial Intelligence","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.0763632586833773,"score_gpt":0.39034311201913197,"score_spread":0.3139798533357547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376552431","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011895938,0.23601882,0.05130154,0.01015856,0.011557069,0.00008727062,0.00025573978,0.00073675223,0.68869466],"genre_scores_gemma":[0.019550318,0.17514934,0.029120171,0.0037001236,0.0069694538,0.0001717988,0.00052806194,0.0004341118,0.7643766],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992797,0.000111797075,0.00003325055,0.00008405024,0.00045064362,0.000040622963],"domain_scores_gemma":[0.9990859,0.0003997635,0.000041321142,0.00020564701,0.00018259897,0.000084813626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097620615,0.0014006984,0.0014539792,0.0020816233,0.0007003019,0.003699872,0.0010364011,0.0013190611,0.03908235],"category_scores_gemma":[0.0021142461,0.0005499091,0.00049487955,0.0024215782,0.0017766216,0.004717818,0.002207167,0.0034604394,0.024824822],"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.000022562983,0.000058876773,0.00013908494,0.00069072854,0.000032912958,0.000059827165,0.0002591789,0.0009295239,0.0006895505,0.22492766,0.3405167,0.43167335],"study_design_scores_gemma":[0.0000060316943,0.000017713197,0.00020997672,0.00031807966,0.000011384776,0.00012577506,0.000053151933,0.00092645537,0.00022195671,0.08654094,0.91156226,0.000006299755],"about_ca_topic_score_codex":0.000573802,"about_ca_topic_score_gemma":0.0013635597,"teacher_disagreement_score":0.03908235,"about_ca_system_score_codex":0.0010668833,"about_ca_system_score_gemma":0.0011663401,"threshold_uncertainty_score":0.1307435},"labels":[],"label_agreement":null},{"id":"W4376608015","doi":"10.1007/978-3-031-32296-9_12","title":"The Iterated Local Transitivity Model for Tournaments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"","keywords":"Transitive relation; Iterated function; Tournament; Computer science; Generative model; Generative grammar; Graph; Theoretical computer science; Artificial intelligence; Mathematical economics; Mathematics; Combinatorics","score_opus":0.0227167863133305,"score_gpt":0.2724438188482939,"score_spread":0.2497270325349634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2708677,0.0011070016,0.635158,0.0022998147,0.00019706141,0.00014405047,0.00070008205,0.00052753673,0.088998795],"genre_scores_gemma":[0.9535117,0.00060483004,0.012826577,0.00016056455,0.00019623348,0.00016909224,0.00028036517,0.00013210854,0.03211853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.00037097817,0.000032170137,0.0001812338,0.00013716849,0.0002058446],"domain_scores_gemma":[0.9951363,0.0029761582,0.0005839454,0.00045764344,0.00029535283,0.0005506237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018096209,0.0007007178,0.0016894459,0.0010339268,0.0013077353,0.00427386,0.0030585872,0.0019530663,0.013853789],"category_scores_gemma":[0.008048036,0.0006874114,0.0016506425,0.0012449732,0.0031217975,0.0048600505,0.0016134306,0.0032820504,0.0010025826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053360858,0.000040868497,0.0003277242,0.000059299262,0.000033463555,0.0001169384,0.00017896804,0.04000966,0.0004992253,0.9535938,0.0019247301,0.0031619696],"study_design_scores_gemma":[0.000030888183,0.00003035269,0.00019754593,0.000017844754,0.000018342262,0.00006432979,0.00005888441,0.21466246,0.00010223714,0.78363955,0.0011593126,0.000018266483],"about_ca_topic_score_codex":0.0033743412,"about_ca_topic_score_gemma":0.0031049158,"teacher_disagreement_score":0.013853789,"about_ca_system_score_codex":0.0024835924,"about_ca_system_score_gemma":0.001032176,"threshold_uncertainty_score":0.046345532},"labels":[],"label_agreement":null},{"id":"W4376608133","doi":"10.1007/978-3-031-32296-9","title":"Algorithms and Models for the Web Graph","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02140765485840043,"score_gpt":0.2480883015554551,"score_spread":0.22668064669705468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608133","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017534206,0.0065281736,0.86063004,0.006518565,0.000566421,0.0002619645,0.0026101277,0.0018828412,0.103467636],"genre_scores_gemma":[0.29840586,0.015000883,0.54503417,0.0020183935,0.0016726289,0.0014134863,0.007414139,0.0018156666,0.12722479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987496,0.00040844313,0.00006824962,0.00031367026,0.00033890328,0.00012123654],"domain_scores_gemma":[0.9966793,0.0021424645,0.000177558,0.0005930081,0.0002506803,0.0001570223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010825725,0.0018930986,0.0014614905,0.002371868,0.0018516734,0.0065373043,0.0033062194,0.0027569735,0.016931167],"category_scores_gemma":[0.0063655516,0.0011325463,0.002137436,0.0049369615,0.0020570662,0.010706367,0.002264586,0.0049958355,0.004619882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031858865,0.000059672908,0.00015431503,0.0001741409,0.000019141795,0.00005847873,0.00012481827,0.016640162,0.0002784423,0.92815495,0.020940501,0.03336356],"study_design_scores_gemma":[0.000009587112,0.000004007349,0.000034133554,0.000019380133,0.0000067004316,0.000042309202,0.000025190502,0.027570935,0.00008677874,0.96430725,0.007888306,0.0000053719314],"about_ca_topic_score_codex":0.0044670757,"about_ca_topic_score_gemma":0.0040751994,"teacher_disagreement_score":0.016931167,"about_ca_system_score_codex":0.003202279,"about_ca_system_score_gemma":0.0014144549,"threshold_uncertainty_score":0.056640446},"labels":[],"label_agreement":null},{"id":"W4376608266","doi":"10.1007/978-3-031-32296-9_4","title":"Modularity Based Community Detection in Hypergraphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Modularity (biology); Computer science; Hypergraph; Scalability; Graph; Obstacle; Theoretical computer science; Function (biology); Community structure; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.02156529488096081,"score_gpt":0.25681810889774537,"score_spread":0.23525281401678455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038448986,0.00087394635,0.95771974,0.00020125567,0.000063468964,0.000093663555,0.00018982026,0.00066187413,0.001747205],"genre_scores_gemma":[0.46294615,0.0007099492,0.5289591,0.00011889689,0.0002140836,0.00016263804,0.0008251954,0.00035274174,0.0057111937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983229,0.00059497135,0.0000667675,0.0004440209,0.00042043583,0.00015087124],"domain_scores_gemma":[0.990888,0.006069877,0.0007189271,0.00069052423,0.0012288127,0.0004039024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023563234,0.0009059358,0.0013737149,0.00446247,0.0009807821,0.0016068155,0.002384481,0.0015281484,0.0021263498],"category_scores_gemma":[0.012679494,0.00078780705,0.0011885364,0.0031621484,0.0011283541,0.0029941653,0.0020553048,0.00149348,0.0006422361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006401393,0.00034001333,0.010878419,0.0010251253,0.00051943085,0.00035467304,0.0007090279,0.28702444,0.026444942,0.077947006,0.013018037,0.58109885],"study_design_scores_gemma":[0.000019326546,0.00004636237,0.0015690404,0.00003493616,0.00004147862,0.00013184368,0.000045961144,0.952637,0.0024914104,0.041718367,0.0012455377,0.000018826993],"about_ca_topic_score_codex":0.002860353,"about_ca_topic_score_gemma":0.004068265,"teacher_disagreement_score":0.00446247,"about_ca_system_score_codex":0.0012189368,"about_ca_system_score_gemma":0.00063532987,"threshold_uncertainty_score":0.012461543},"labels":[],"label_agreement":null},{"id":"W4376608267","doi":"10.1007/978-3-031-32296-9_3","title":"Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Embedding; Node (physics); Graph; Theoretical computer science; Set (abstract data type); Data mining; Artificial intelligence","score_opus":0.03948828168851945,"score_gpt":0.3229867891242473,"score_spread":0.2834985074357278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032705534,0.00044364925,0.9605036,0.00010383457,0.00004566406,0.00011162997,0.0013815745,0.0032866246,0.0014179522],"genre_scores_gemma":[0.32594773,0.00043335801,0.6589122,0.000105739324,0.00008381758,0.0002773055,0.00907074,0.0007240899,0.0044449726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878603,0.00033869303,0.00006748308,0.00036097984,0.00035634157,0.00009041781],"domain_scores_gemma":[0.9973838,0.0010515945,0.00023036667,0.0005425761,0.0006558713,0.00013572942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379545,0.0013856442,0.0011651664,0.0031676183,0.0005149618,0.00189432,0.0021743474,0.0017596664,0.002494458],"category_scores_gemma":[0.0060344976,0.0005916232,0.0011128798,0.0025007722,0.0006798024,0.0036032074,0.0017463212,0.0017418906,0.0012934228],"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.0005581664,0.00052639906,0.0066811456,0.0003877964,0.00036318053,0.00017259705,0.00017131041,0.24612491,0.027739322,0.03849072,0.01541495,0.6633694],"study_design_scores_gemma":[0.000015319281,0.00007872552,0.00071336934,0.000020086565,0.00003246112,0.000066264525,0.000042074123,0.96481663,0.004121596,0.028758496,0.0013218654,0.0000130609815],"about_ca_topic_score_codex":0.0035427627,"about_ca_topic_score_gemma":0.011035796,"teacher_disagreement_score":0.0035427627,"about_ca_system_score_codex":0.0010125055,"about_ca_system_score_gemma":0.001098129,"threshold_uncertainty_score":0.0083447695},"labels":[],"label_agreement":null},{"id":"W4376622190","doi":"10.1007/978-3-031-31108-6","title":"Risks and Security of Internet and Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Economic and Technological Systems Analysis","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":"Polytechnique Montréal; Queen's University","funders":"","keywords":"Computer science; Computer security; The Internet; Intrusion detection system; Internet security; Information security; Security controls; Intrusion prevention system; Intrusion; Control (management); Internet privacy; Security service; World Wide Web; Artificial intelligence","score_opus":0.026654040263878763,"score_gpt":0.22929568064048572,"score_spread":0.20264164037660695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622190","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14578107,0.045551844,0.0745364,0.022286318,0.0006883026,0.000050291233,0.0002524909,0.00015292864,0.7107003],"genre_scores_gemma":[0.9293807,0.013687756,0.0053654243,0.00042882416,0.00084839633,0.000039838425,0.00007937512,0.000039068887,0.0501305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953425,0.00019136818,0.000018936635,0.00003553712,0.00018031153,0.000039610964],"domain_scores_gemma":[0.99788326,0.0015160728,0.00020982626,0.00015399049,0.00016504514,0.000071847746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071148324,0.0004153647,0.00024262624,0.0009603067,0.0005089741,0.0029959723,0.0002686165,0.0012568329,0.004601292],"category_scores_gemma":[0.0036289678,0.00021736736,0.00022955441,0.0007159966,0.0023748667,0.0041223257,0.0007949978,0.0015456642,0.00045753876],"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.000025108238,0.00001374011,0.0007345478,0.000031871794,0.000009518169,0.00006812291,0.00030641438,0.0032461332,0.00029205575,0.9725399,0.0036798527,0.019052671],"study_design_scores_gemma":[0.0000022769982,0.000014572907,0.00061662187,0.000043892655,0.000005341191,0.000098394376,0.00017910193,0.0028398482,0.00012963828,0.98191273,0.014153092,0.000004542864],"about_ca_topic_score_codex":0.0010432573,"about_ca_topic_score_gemma":0.0008096926,"teacher_disagreement_score":0.004601292,"about_ca_system_score_codex":0.0009981747,"about_ca_system_score_gemma":0.0005829089,"threshold_uncertainty_score":0.0153928995},"labels":[],"label_agreement":null},{"id":"W4376622261","doi":"10.1007/978-3-031-31108-6_18","title":"Benchmark Performance of the Multivariate Polynomial Public Key Encapsulation Mechanism","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Carleton University; Quantropi (Canada)","funders":"","keywords":"NTRU; Key encapsulation; Computer science; Benchmarking; Cryptosystem; Public-key cryptography; Post-quantum cryptography; Cryptography; Theoretical computer science; Encapsulation (networking); NIST; McEliece cryptosystem; Univariate; Key (lock); Multivariate statistics; Computer engineering; Algorithm; Computer network; Computer security; Encryption; Key exchange; Machine learning","score_opus":0.01907435105049574,"score_gpt":0.22042164869522385,"score_spread":0.2013472976447281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622261","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.92836577,0.003582139,0.026533967,0.0011637636,0.00044131608,0.0002186405,0.003380037,0.006906973,0.029407348],"genre_scores_gemma":[0.9882598,0.0003120756,0.0059124427,0.00007305339,0.000047395148,0.000048584563,0.0013889835,0.00017977243,0.0037780171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955124,0.000959096,0.00026447428,0.0005784555,0.0015566655,0.0011288428],"domain_scores_gemma":[0.9873054,0.0059251594,0.00093485584,0.0037863397,0.0016927599,0.00035547582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035876844,0.000938015,0.00097524724,0.0012718878,0.00090459205,0.0018630233,0.0019899446,0.0014179609,0.009860042],"category_scores_gemma":[0.01255985,0.00026775073,0.00043929173,0.0019093206,0.0010005569,0.0033651264,0.0015876823,0.00089970307,0.0015909759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03595099,0.0029179296,0.011885668,0.0024250564,0.0007589327,0.0007184862,0.0003816419,0.36823177,0.09311963,0.081800394,0.07660689,0.32520264],"study_design_scores_gemma":[0.0014738239,0.0052548912,0.007826622,0.00019614334,0.00035615827,0.0007842712,0.00035012848,0.7827093,0.15622567,0.027306316,0.017324243,0.00019240077],"about_ca_topic_score_codex":0.0020285135,"about_ca_topic_score_gemma":0.0012252668,"teacher_disagreement_score":0.009860042,"about_ca_system_score_codex":0.0019265017,"about_ca_system_score_gemma":0.0015106098,"threshold_uncertainty_score":0.03298509},"labels":[],"label_agreement":null},{"id":"W4376622306","doi":"10.1007/978-3-031-31108-6_8","title":"Blockchain Olive Oil Supply Chain","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Université de Moncton","funders":"","keywords":"Traceability; Supply chain; Computer science; Blockchain; Product (mathematics); Olive oil; Certification; Smart contract; Quality (philosophy); Process (computing); Supply chain management; Process management; Manufacturing engineering; Computer security; Business; Software engineering; Marketing; Operating system; Engineering","score_opus":0.012616169425779632,"score_gpt":0.23197506788091546,"score_spread":0.21935889845513581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622306","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15705693,0.0027339696,0.38154438,0.0015878511,0.0006319512,0.0003045685,0.000852653,0.0010467296,0.45424098],"genre_scores_gemma":[0.6629809,0.002881144,0.026808659,0.00010109606,0.00008785858,0.00011509815,0.0006909202,0.000095569165,0.30623874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997894,0.00003398168,0.000010383217,0.000030171921,0.00010758197,0.0000284671],"domain_scores_gemma":[0.9996625,0.0000884056,0.000027791935,0.000091016555,0.00009399497,0.00003625761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003171164,0.00025785592,0.00020805601,0.0004170855,0.00040192658,0.00097233313,0.0005420945,0.00057695754,0.0242349],"category_scores_gemma":[0.00086908124,0.00016215323,0.00018267517,0.0011060559,0.00042128225,0.0020164808,0.00095319614,0.00046873404,0.0042578424],"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.000709536,0.00016520091,0.0011333829,0.0003464649,0.00003630216,0.00054234354,0.00024782616,0.15042773,0.022832615,0.40695992,0.012223388,0.4043754],"study_design_scores_gemma":[0.000102660546,0.00040823768,0.00085913803,0.00022986376,0.00003211084,0.00026966567,0.00022936492,0.28392747,0.02829758,0.32759094,0.35800344,0.000049622664],"about_ca_topic_score_codex":0.0023491436,"about_ca_topic_score_gemma":0.0025145807,"teacher_disagreement_score":0.0242349,"about_ca_system_score_codex":0.00083087396,"about_ca_system_score_gemma":0.00089216745,"threshold_uncertainty_score":0.08107376},"labels":[],"label_agreement":null},{"id":"W4376622559","doi":"10.1007/978-3-031-33163-3","title":"Rigorous State-Based Methods","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semiconductor materials and devices","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Institute on Aging; Université de Franche-Comté; Institute of Software, Chinese Academy of Sciences; Universitetet i Agder; National Institute of Informatics; Sandia National Laboratories; Universität Ulm; Jet Propulsion Laboratory; Technische Universität Berlin; Universidade do Porto; Swansea University; Zhejiang University; East China Normal University; Simon Fraser University; Universität zu Lübeck; Agence Nationale de la Recherche; Université de Bordeaux; Université de Sherbrooke; University of Southampton; Università degli Studi di Milano; Università di Pisa; Université de Toulouse; University of Limerick; Queen's University; University of Surrey; Office National d'études et de Recherches Aérospatiales; Université de Lorraine; Universidade do Minho; Carnegie Mellon University; McMaster University; Chinese Academy of Sciences; Aarhus Universitet","keywords":"Abstract state machines; State (computer science); Computer science; Finite-state machine; Programming language","score_opus":0.021474913292035897,"score_gpt":0.28634897334432413,"score_spread":0.26487406005228825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622559","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016127173,0.0029006097,0.9319089,0.0007008124,0.000789027,0.00003549088,0.00021867226,0.00035204532,0.061481673],"genre_scores_gemma":[0.23209707,0.009104953,0.565067,0.0013603303,0.001955279,0.00054137193,0.0013983665,0.0023812077,0.18609448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910873,0.00033378624,0.000034408484,0.00009779841,0.00037711643,0.000048190774],"domain_scores_gemma":[0.9989196,0.0004955523,0.00005931194,0.00024230017,0.0002331434,0.000050051276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012144262,0.0012333832,0.00172312,0.0012340936,0.0006539716,0.0023789983,0.0018136244,0.0014849253,0.01445152],"category_scores_gemma":[0.0035259207,0.0006935413,0.0013299336,0.0009920917,0.002056013,0.0021435032,0.002652319,0.0037726434,0.0053656367],"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.000017921235,0.000024644709,0.00005003948,0.000100533194,0.00002749135,0.000014591358,0.000030670923,0.015370706,0.0006295696,0.9499694,0.008892302,0.024872057],"study_design_scores_gemma":[0.000015429288,0.000015377607,0.00009347396,0.00004681824,0.000012679771,0.00003110652,0.000012204163,0.2217956,0.00052310847,0.7559971,0.02143914,0.000017983442],"about_ca_topic_score_codex":0.001218668,"about_ca_topic_score_gemma":0.0013163377,"teacher_disagreement_score":0.01445152,"about_ca_system_score_codex":0.000926485,"about_ca_system_score_gemma":0.0008783554,"threshold_uncertainty_score":0.04834521},"labels":[],"label_agreement":null},{"id":"W4376622659","doi":"10.1007/978-3-031-33163-3_10","title":"Modelling an Automotive Software System with TASTD","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Programming language; Compiler; Abstraction; Modular design; Notation; Algebraic specification; Modularity (biology); Representation (politics); State (computer science); Formal specification; Theoretical computer science","score_opus":0.039509631027362935,"score_gpt":0.26659672237751314,"score_spread":0.2270870913501502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040177405,0.00027246616,0.93503016,0.00014866603,0.00007712008,0.000092047754,0.00032411562,0.0037539904,0.020123988],"genre_scores_gemma":[0.5969176,0.0007059616,0.37141255,0.000099815305,0.00003414074,0.0002209877,0.0007112126,0.0007231031,0.029174713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975663,0.00004892553,0.00002246893,0.0000440532,0.000093489834,0.0000343663],"domain_scores_gemma":[0.9997844,0.00008635611,0.000029238436,0.00003940676,0.000049910777,0.000010758999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030763834,0.0006091427,0.00034225755,0.0005145999,0.00032982585,0.0014074127,0.00095463346,0.00091721385,0.00761417],"category_scores_gemma":[0.000639686,0.00042908514,0.0010300311,0.0003681319,0.00058505766,0.0010159977,0.0009274746,0.00059325167,0.0015297374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024034205,0.000047627065,0.0018212047,0.0005806338,0.000069664595,0.0014502867,0.00083941716,0.6645808,0.03913578,0.21055865,0.0021804846,0.07849509],"study_design_scores_gemma":[0.000050112445,0.000119752134,0.0002657284,0.00008910154,0.00007498094,0.00042327546,0.00010595812,0.88625026,0.022402054,0.031974778,0.058214746,0.000029237412],"about_ca_topic_score_codex":0.005783451,"about_ca_topic_score_gemma":0.004943323,"teacher_disagreement_score":0.00761417,"about_ca_system_score_codex":0.00056924776,"about_ca_system_score_gemma":0.00088990026,"threshold_uncertainty_score":0.025471926},"labels":[],"label_agreement":null},{"id":"W4376622664","doi":"10.1007/978-3-031-33163-3_11","title":"TASTD: A Real-Time Extension for ASTD","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Interrupt; Computer science; Timeout; Programming language; Extension (predicate logic); Guard (computer science); Algebraic specification; Theoretical computer science; Real-time computing; Embedded system; Formal specification; Computer network; Microcontroller","score_opus":0.039336080156800464,"score_gpt":0.2994853823723836,"score_spread":0.26014930221558313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030457897,0.00022139635,0.94582254,0.00013513103,0.00041150686,0.000096275304,0.00086506666,0.0416671,0.007735201],"genre_scores_gemma":[0.15051799,0.0009264647,0.77441484,0.00074395974,0.000405648,0.00056030374,0.0049130386,0.028716244,0.038801562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838185,0.00024429057,0.00025669913,0.00032994812,0.00062993844,0.00015728107],"domain_scores_gemma":[0.9978987,0.0006751916,0.00016735258,0.0007189729,0.00042306562,0.0001167385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018534388,0.001456525,0.0006489396,0.0008815091,0.0004948034,0.0019671763,0.002285482,0.0011597151,0.024085654],"category_scores_gemma":[0.003335992,0.0011254397,0.0019534987,0.0007450013,0.0014375184,0.0034197546,0.0030784719,0.0029799999,0.011030677],"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.0017823208,0.00023504983,0.0013831446,0.002322135,0.00011800778,0.0008665157,0.0011004944,0.028063873,0.08238675,0.27100396,0.08997415,0.5207635],"study_design_scores_gemma":[0.0002832732,0.00031791485,0.00036148197,0.00036779334,0.00017491747,0.0010867675,0.00010575097,0.083762765,0.06916689,0.11265236,0.73157465,0.00014533773],"about_ca_topic_score_codex":0.00087520084,"about_ca_topic_score_gemma":0.0011836174,"teacher_disagreement_score":0.024085654,"about_ca_system_score_codex":0.0007215683,"about_ca_system_score_gemma":0.0010742008,"threshold_uncertainty_score":0.08057451},"labels":[],"label_agreement":null},{"id":"W4376624041","doi":"10.1007/978-3-031-32412-3","title":"Numerical Methods and Applications","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Soil, Finite Element Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Lawrence Livermore National Laboratory; National Academy of Sciences of Belarus; Aix-Marseille Université; Universidade do Porto; Universitetet i Oslo; Technische Universiteit Eindhoven; Universität Duisburg-Essen; Chalmers Tekniska Högskola; Eötvös Loránd Tudományegyetem; University of Alberta; Technical University of Sofia; University of Pittsburgh","keywords":"Computer science; Numerical analysis; Mathematics; Mathematical analysis","score_opus":0.02528826686186228,"score_gpt":0.3357052863993128,"score_spread":0.3104170195374505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376624041","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.0015561525,0.05238636,0.66151655,0.0015701067,0.006068283,0.00024162629,0.0012091158,0.0035366474,0.27191517],"genre_scores_gemma":[0.02833751,0.034667782,0.46381357,0.0010847934,0.0020787432,0.0011323028,0.0024303051,0.0018298514,0.4646251],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883443,0.00013832412,0.00007393274,0.00014936717,0.0007588943,0.000045169527],"domain_scores_gemma":[0.9991934,0.00020581414,0.000032114833,0.00020086343,0.0003336357,0.0000341741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000858204,0.0015362318,0.0019240289,0.0017672966,0.000759266,0.0029102778,0.0018298199,0.0023337633,0.04978291],"category_scores_gemma":[0.0022521238,0.00076834497,0.0010577469,0.0026928165,0.0011456192,0.001355534,0.0022502632,0.0026539895,0.04109772],"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.000042828593,0.00007776942,0.00027019993,0.0010576434,0.00007398297,0.00013013423,0.00019854611,0.0151466625,0.0072121127,0.18127741,0.18080714,0.6137056],"study_design_scores_gemma":[0.000025628642,0.000055993478,0.00055367005,0.0003837727,0.000031659827,0.0004592619,0.00006669955,0.057240464,0.0027506326,0.11592876,0.8224602,0.000043315802],"about_ca_topic_score_codex":0.0009892145,"about_ca_topic_score_gemma":0.0011099122,"teacher_disagreement_score":0.04978291,"about_ca_system_score_codex":0.000611324,"about_ca_system_score_gemma":0.00088521384,"threshold_uncertainty_score":0.16654038},"labels":[],"label_agreement":null},{"id":"W4376854014","doi":"10.1007/978-3-031-31476-6_6","title":"Grammar Induction for Under-Resourced Languages: The Case of Ch’ol","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Computer science; Programming language; Grammar; Natural language processing; Artificial intelligence; Linguistics; Philosophy","score_opus":0.02621857760473584,"score_gpt":0.29315493188021957,"score_spread":0.26693635427548373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376854014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043640167,0.00036694374,0.9023417,0.0017931013,0.000119297445,0.000099618126,0.0004272373,0.004164973,0.047046863],"genre_scores_gemma":[0.5660883,0.0003493432,0.40307948,0.0008299144,0.00016854529,0.00012431401,0.0012560216,0.0029748636,0.025129208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977652,0.00074136956,0.00012589233,0.00045056138,0.000566405,0.00035063297],"domain_scores_gemma":[0.9871903,0.008704921,0.00035423238,0.0024134086,0.0010550644,0.0002820919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026604407,0.00039456828,0.0008187063,0.001033877,0.001358099,0.0022588305,0.002246079,0.000924231,0.009391468],"category_scores_gemma":[0.0080940705,0.00071513874,0.0011573789,0.001346111,0.0039411834,0.0057372763,0.005175496,0.0044370964,0.002643103],"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.00015140328,0.0000824818,0.0016402464,0.00035524965,0.000039491013,0.0014084299,0.001962065,0.008954947,0.013401179,0.8369295,0.010642678,0.12443226],"study_design_scores_gemma":[0.000027647744,0.000018951887,0.0003939535,0.000048383106,0.00003839124,0.00050764915,0.00049241347,0.058615897,0.010616907,0.90948427,0.019723922,0.00003172957],"about_ca_topic_score_codex":0.002973774,"about_ca_topic_score_gemma":0.004654423,"teacher_disagreement_score":0.009391468,"about_ca_system_score_codex":0.0014004309,"about_ca_system_score_gemma":0.002096605,"threshold_uncertainty_score":0.03141755},"labels":[],"label_agreement":null},{"id":"W4377078055","doi":"10.1007/978-3-031-32808-4","title":"Design Science Research for a New Society: Society 5.0","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Innovative Approaches in Technology and Social Development","field":"Business, Management and Accounting","cited_by":3,"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":"HEC Montréal; Högskolan i Borås; Indian Institute of Management Calcutta; Universität Kassel; Universität Stuttgart; Stockholms Universitet; Copenhagen Business School; Ruhr-Universität Bochum; Ludwig-Maximilians-Universität München; Technische Universität Braunschweig; Cape Peninsula University of Technology; Indian Institute of Technology Madras; Universität Zürich; University of the Western Cape; Universität zu Köln; Dalhousie University; Turun Yliopisto; Uppsala Universitet; Aalto-Yliopisto; Universidade de Vigo; Technische Universiteit Delft; University of Southern Queensland; Queensland University of Technology; University of South Africa; Deakin University; University of Wollongong; Universität St. Gallen; University of Pretoria; Università degli Studi di Camerino; Nelson Mandela Metropolitan University; University of South Florida; University of Oxford; Bentley University; Oulun Yliopisto; Universität Passau; Abertay University; Missouri University of Science and Technology; Victoria University of Wellington; Jyväskylän Yliopisto; Polytechnique Montréal; Université de Sherbrooke; Universität Hamburg; Rhodes University; Georgia State University; Universitetet i Agder; Eidgenössische Technische Hochschule Zürich; University of Technology Sydney; Boise State University; Universität Paderborn; University of Missouri; Northwestern University; University of Cape Town; University of Dayton; Friedrich-Alexander-Universität Erlangen-Nürnberg; Université de Fribourg; Victoria University; Macquarie University","keywords":"Sociotechnical system; Computer science; Reuse; Design science research; Management science; Engineering management; Engineering ethics; Knowledge management; Software engineering; Information system; Engineering; Electrical engineering","score_opus":0.12902556652383382,"score_gpt":0.33772320129251177,"score_spread":0.20869763476867795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377078055","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.0034456544,0.04730839,0.08198679,0.04781922,0.0036831766,0.000117194744,0.00029159215,0.001517889,0.8138301],"genre_scores_gemma":[0.09587301,0.06426241,0.124255344,0.0124010155,0.0030238337,0.00033753092,0.000821018,0.0015577116,0.69746816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977481,0.0009647958,0.000114313836,0.00018439705,0.00083333836,0.0001550824],"domain_scores_gemma":[0.99621636,0.0014916481,0.0001742727,0.000684176,0.00094333617,0.0004903061],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0051921653,0.0006827624,0.0006168913,0.0019758644,0.0010356817,0.008526088,0.0010225519,0.0024094058,0.0455402],"category_scores_gemma":[0.0038543455,0.0005225315,0.00075853814,0.0016221058,0.0046960493,0.007891708,0.0025128305,0.002705641,0.01279627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022710492,0.000033646298,0.00025318153,0.0004804848,0.000019224395,0.000033890596,0.0004796223,0.0005120152,0.0009946956,0.7527497,0.120404296,0.12401656],"study_design_scores_gemma":[0.000007931083,0.000033467943,0.00027485055,0.00040752417,0.000009803523,0.00008037091,0.00024026794,0.00041988294,0.00041487737,0.20246527,0.7956377,0.000008047043],"about_ca_topic_score_codex":0.0017917968,"about_ca_topic_score_gemma":0.002058474,"teacher_disagreement_score":0.9989643,"about_ca_system_score_codex":0.003660241,"about_ca_system_score_gemma":0.0059181987,"threshold_uncertainty_score":0.15234709},"labels":[],"label_agreement":null},{"id":"W4377078405","doi":"10.1007/978-3-031-32808-4_4","title":"Neuro-Adaptive Interface System to Evaluate Product Recommendations in the Context of E-Commerce","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural and Behavioral Psychology Studies","field":"Neuroscience","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Personalization; Information overload; Quality (philosophy); Context (archaeology); Product (mathematics); Interface (matter); Cognition; Workload; Formative assessment; Human–computer interaction; Function (biology); Adaptive hypermedia; Adaptation (eye); Multimedia; World Wide Web; Hypermedia; Psychology","score_opus":0.17716765708153379,"score_gpt":0.38075858949759384,"score_spread":0.20359093241606005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377078405","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.61107725,0.0011280207,0.36376807,0.0003748143,0.00031958573,0.0007300142,0.0011061791,0.011213359,0.010282751],"genre_scores_gemma":[0.87222046,0.0001763628,0.122308254,0.00021955279,0.000065162945,0.00033238667,0.0003920274,0.00007315094,0.0042126602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997316,0.00007456296,0.000021827676,0.00007672359,0.00007445374,0.000020846794],"domain_scores_gemma":[0.99924505,0.00035413657,0.00004511326,0.00004166938,0.00026818484,0.00004589734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008246103,0.000561089,0.0005505108,0.000958716,0.00023694478,0.000715214,0.0007415819,0.0010830258,0.005048613],"category_scores_gemma":[0.0019873467,0.00015504638,0.0002367296,0.00056815334,0.00013998109,0.000593915,0.00035083405,0.00036264263,0.0009600949],"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.0025333292,0.0014928757,0.026957411,0.00026397605,0.00030381692,0.0003841067,0.00023112839,0.024202315,0.078875974,0.00094102067,0.008004819,0.8558093],"study_design_scores_gemma":[0.00016159934,0.0012742073,0.029443044,0.00003092368,0.00022759839,0.0003324247,0.00015691988,0.9351548,0.030165836,0.0012130421,0.0017817764,0.00005786452],"about_ca_topic_score_codex":0.0034363433,"about_ca_topic_score_gemma":0.0046236417,"teacher_disagreement_score":0.005048613,"about_ca_system_score_codex":0.00033035548,"about_ca_system_score_gemma":0.00026280948,"threshold_uncertainty_score":0.016889274},"labels":[],"label_agreement":null},{"id":"W4377081443","doi":"10.1007/978-3-031-33264-7_14","title":"On the Simon’s Congruence Neighborhood of Languages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Congruence (geometry); Computer science; Programming language; Theoretical computer science; Mathematics; Geometry","score_opus":0.013643250282226564,"score_gpt":0.2409676931564599,"score_spread":0.22732444287423334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377081443","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.3053439,0.003717517,0.14456034,0.006032178,0.00073614065,0.00009033729,0.00043851748,0.0004218513,0.5386592],"genre_scores_gemma":[0.93374735,0.0011945012,0.018758645,0.0004997645,0.000767002,0.00011277468,0.00039095787,0.00018823164,0.04434082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.00021980586,0.0000455109,0.00019449556,0.00022527113,0.00015576732],"domain_scores_gemma":[0.99854714,0.0008759268,0.00010752025,0.00012068138,0.00017421994,0.00017441712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008616635,0.00046274936,0.001315768,0.0016853446,0.003553907,0.002708226,0.0009866571,0.00083749887,0.007266863],"category_scores_gemma":[0.0034054774,0.0004745348,0.0008908012,0.0014750325,0.004169369,0.00632882,0.0027093377,0.0026301276,0.0008865323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025634197,0.000006141269,0.00004570701,0.000009758879,0.0000015218053,0.000026692946,0.00012894314,0.00026294967,0.00021471338,0.9974299,0.0005156707,0.0013323615],"study_design_scores_gemma":[0.0000137775005,0.0000093022345,0.00007874571,0.0000064764295,0.0000026064827,0.00004118014,0.00008408154,0.0012874288,0.00020553346,0.99445254,0.00381334,0.000005030225],"about_ca_topic_score_codex":0.003326947,"about_ca_topic_score_gemma":0.002568508,"teacher_disagreement_score":0.007266863,"about_ca_system_score_codex":0.0019333508,"about_ca_system_score_gemma":0.00081863144,"threshold_uncertainty_score":0.024310052},"labels":[],"label_agreement":null},{"id":"W4377199999","doi":"10.1007/978-3-031-32726-1_13","title":"Designing Optimization Problems with Diverse Solutions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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 British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Mathematics","score_opus":0.05251928756141984,"score_gpt":0.2676739807437541,"score_spread":0.21515469318233427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377199999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007385746,0.0008490158,0.98394394,0.00021697636,0.000080580954,0.00006918032,0.000027129485,0.000097321245,0.007330066],"genre_scores_gemma":[0.19506018,0.0023119783,0.7923222,0.0004378237,0.00038131385,0.00071698974,0.00022550112,0.00031496337,0.008229078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982135,0.00088935683,0.00008590648,0.00026691446,0.00043478754,0.000109490604],"domain_scores_gemma":[0.9973104,0.0019649744,0.00018297862,0.00023158497,0.00020543019,0.0001046281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031241577,0.0018588896,0.0016005262,0.0013859115,0.0007433461,0.0017406764,0.0018186476,0.00238966,0.004421259],"category_scores_gemma":[0.009865074,0.0011610786,0.001404748,0.001920949,0.001204299,0.0027472642,0.0037714753,0.0025618603,0.0011965311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009391583,0.0001257867,0.00044540002,0.0004754716,0.00018099537,0.00019618313,0.0001256021,0.7407353,0.0062094703,0.10281087,0.003465,0.14513604],"study_design_scores_gemma":[0.000040618237,0.00017720857,0.00011962024,0.00008681022,0.000040562187,0.00014047768,0.00006511099,0.9015025,0.0018124225,0.090148196,0.005848377,0.00001805558],"about_ca_topic_score_codex":0.0001279285,"about_ca_topic_score_gemma":0.00021274512,"teacher_disagreement_score":0.004421259,"about_ca_system_score_codex":0.0004909149,"about_ca_system_score_gemma":0.0003447513,"threshold_uncertainty_score":0.016522348},"labels":[],"label_agreement":null},{"id":"W4377200034","doi":"10.1007/978-3-031-32726-1_31","title":"A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interdiction; Knapsack problem; Bilevel optimization; Computer science; Algorithm; Mathematical optimization; Mathematics; Optimization problem; Engineering","score_opus":0.021792262505053398,"score_gpt":0.2494158704108485,"score_spread":0.2276236079057951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029575839,0.00029717418,0.9870826,0.00012959557,0.0001495319,0.00010902981,0.00016599175,0.0011616738,0.007946705],"genre_scores_gemma":[0.030011464,0.0003596067,0.9617837,0.00012427924,0.000091031354,0.000380297,0.0008012727,0.00057740894,0.0058710286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909294,0.00016736586,0.000046827692,0.00022769571,0.00032535504,0.00013985448],"domain_scores_gemma":[0.9988397,0.00061832677,0.00005330309,0.0001750435,0.00025131257,0.00006227504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007816342,0.0025870784,0.0022193484,0.001847856,0.0014244784,0.0031215067,0.003242779,0.0025708913,0.019130334],"category_scores_gemma":[0.003304564,0.0014666888,0.0017788901,0.0042667533,0.00085412135,0.003656162,0.003111368,0.0038892804,0.006104852],"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.00027765613,0.00036812748,0.00022689543,0.00036398772,0.000075884236,0.00014438774,0.00008213137,0.35967687,0.0041810097,0.066277266,0.023425763,0.5449],"study_design_scores_gemma":[0.00015064987,0.000081111786,0.00011560632,0.00004703747,0.000024353985,0.000101513084,0.00003953574,0.92609525,0.0013135723,0.06224327,0.009754685,0.00003342133],"about_ca_topic_score_codex":0.0056666937,"about_ca_topic_score_gemma":0.005809774,"teacher_disagreement_score":0.019130334,"about_ca_system_score_codex":0.0013370387,"about_ca_system_score_gemma":0.002228622,"threshold_uncertainty_score":0.06399727},"labels":[],"label_agreement":null},{"id":"W4377200035","doi":"10.1007/978-3-031-32726-1_12","title":"Stabilization of Capacitated Matching Games","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Combinatorics; Matching (statistics); Equivalence (formal languages); Mathematics; Time complexity; Computer science; Graph; Discrete mathematics","score_opus":0.03869181999386132,"score_gpt":0.2276370828592027,"score_spread":0.18894526286534138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18192227,0.0011038085,0.70456415,0.0019235552,0.00028325935,0.00022824935,0.00051347434,0.0006647616,0.10879655],"genre_scores_gemma":[0.9421022,0.0005742345,0.020346861,0.00021130891,0.00016795954,0.0003192654,0.00028300483,0.0001446214,0.03585054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.0004727267,0.000035580535,0.00018887574,0.00013733064,0.00021222164],"domain_scores_gemma":[0.99666506,0.0020266355,0.0003518956,0.00026808312,0.00031920173,0.00036902708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013876025,0.0010418682,0.0016510985,0.0010054503,0.0009193815,0.0026096,0.0025997802,0.0015237305,0.01259677],"category_scores_gemma":[0.007778619,0.0006811643,0.00090920716,0.0012381786,0.0020296131,0.0022045842,0.0022751442,0.0019340309,0.001108225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022725857,0.00009125578,0.00023030704,0.00013436687,0.00004507401,0.00006163509,0.00013492492,0.1732347,0.0022513885,0.80413085,0.0054313466,0.014026938],"study_design_scores_gemma":[0.000041063933,0.000037408645,0.00009221964,0.000019294574,0.000009538089,0.000013099786,0.0000363299,0.4206028,0.00037187326,0.5775578,0.0012072625,0.000011292828],"about_ca_topic_score_codex":0.0018927737,"about_ca_topic_score_gemma":0.0014797287,"teacher_disagreement_score":0.01259677,"about_ca_system_score_codex":0.0023481436,"about_ca_system_score_gemma":0.0013099164,"threshold_uncertainty_score":0.042140365},"labels":[],"label_agreement":null},{"id":"W4377200038","doi":"10.1007/978-3-031-32726-1_25","title":"Compressing Branch-and-Bound Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Branch and bound; Upper and lower bounds; Computer science; Branching (polymer chemistry); Search tree; Tree (set theory); Heuristic; Compression (physics); Node (physics); Branch and cut; Algorithm; Combinatorics; Integer programming; Mathematics; Artificial intelligence; Search algorithm","score_opus":0.042264135851868924,"score_gpt":0.29507209685717095,"score_spread":0.252807961005302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054807216,0.0023702912,0.88831997,0.0012814375,0.0006155022,0.00037833588,0.0028089096,0.009258919,0.040159486],"genre_scores_gemma":[0.21326992,0.0021046503,0.73566717,0.0005815697,0.00029979597,0.0005017839,0.007784007,0.0034703505,0.03632082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00022499019,0.00008932412,0.00021894964,0.0007702678,0.00019607735],"domain_scores_gemma":[0.993769,0.0034950287,0.00018697852,0.0017904198,0.00059770513,0.00016093612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010068138,0.0009826157,0.0014933413,0.0024914746,0.0007871523,0.0019039279,0.001924331,0.0009862651,0.020643163],"category_scores_gemma":[0.009808984,0.0008495439,0.0011123392,0.004900267,0.0010063512,0.004842835,0.002537512,0.002739614,0.0057511795],"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.0005113203,0.00022709716,0.0006975423,0.00061725226,0.0000581196,0.00014885925,0.00034932475,0.097902134,0.008755046,0.12423119,0.034930825,0.73157126],"study_design_scores_gemma":[0.00012831963,0.00016033178,0.00050022756,0.00022147392,0.00009842201,0.00016730146,0.00019314463,0.42354187,0.011033773,0.510086,0.05382882,0.000040336687],"about_ca_topic_score_codex":0.0035699578,"about_ca_topic_score_gemma":0.006473903,"teacher_disagreement_score":0.020643163,"about_ca_system_score_codex":0.001353635,"about_ca_system_score_gemma":0.0019166504,"threshold_uncertainty_score":0.0690583},"labels":[],"label_agreement":null},{"id":"W4377200039","doi":"10.1007/978-3-031-32726-1_29","title":"Cut-Sufficient Directed 2-Commodity Multiflow Topologies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Network topology; Path (computing); Computer science; Directed graph; Topology (electrical circuits); Graph; Path length; Mathematics; Mathematical optimization; Combinatorics; Computer network","score_opus":0.03793505711548806,"score_gpt":0.3009265805198412,"score_spread":0.26299152340435317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33216926,0.0011102523,0.51522315,0.0017120065,0.00023655841,0.00012920075,0.0021828862,0.0005769605,0.14665966],"genre_scores_gemma":[0.87199914,0.001120835,0.08072533,0.00042963785,0.00014139734,0.0002189986,0.0019613963,0.0002466293,0.043156672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996117,0.00008208993,0.000023285136,0.00007859311,0.0001119547,0.000092454145],"domain_scores_gemma":[0.9981275,0.00094053225,0.000173959,0.00016845287,0.0002977858,0.00029175525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065410696,0.0006864363,0.0007704473,0.0015622907,0.001212052,0.0018336463,0.001128151,0.000972923,0.013191314],"category_scores_gemma":[0.0030517422,0.00059756055,0.00065707037,0.0013023975,0.00073424185,0.003258439,0.0019538354,0.0019447478,0.001475704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020436308,0.00005410096,0.00044576637,0.0002491292,0.000020300384,0.00025594427,0.00022018328,0.013045516,0.006412868,0.9574581,0.004714416,0.016919382],"study_design_scores_gemma":[0.000032071846,0.00004763594,0.0004125739,0.000055796685,0.00001793613,0.00026184507,0.00015880147,0.028222302,0.0018242735,0.96189284,0.0070573348,0.000016576823],"about_ca_topic_score_codex":0.00072780414,"about_ca_topic_score_gemma":0.0015297579,"teacher_disagreement_score":0.013191314,"about_ca_system_score_codex":0.00085342897,"about_ca_system_score_gemma":0.0005796153,"threshold_uncertainty_score":0.044129312},"labels":[],"label_agreement":null},{"id":"W4377200468","doi":"10.1007/978-3-031-32883-1_30","title":"Personalized Study Guide: A Moodle Plug-in Generating Personal Learning Path for Students","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Athabasca University","funders":"","keywords":"Personalized learning; Computer science; Learning styles; Learning analytics; Plan (archaeology); Multimedia; Path (computing); Synchronous learning; Style (visual arts); Experiential learning; Educational technology; Mathematics education; Cooperative learning; Open learning; Teaching method; Machine learning; Psychology","score_opus":0.03004043735430581,"score_gpt":0.3298252610071398,"score_spread":0.299784823652834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200468","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027980378,0.0004243331,0.4147536,0.000605427,0.0005628391,0.0017443359,0.018216373,0.48598403,0.04972871],"genre_scores_gemma":[0.18079102,0.0007022695,0.4611319,0.001662474,0.00025899583,0.0040539373,0.034472354,0.07444185,0.24248527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978787,0.000041686137,0.000014236141,0.000051145937,0.000074776224,0.000030399875],"domain_scores_gemma":[0.99908483,0.00032670397,0.00003483214,0.00014822102,0.00015014122,0.00025527246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046645285,0.0012811128,0.00056502706,0.00092365616,0.00040176243,0.001286428,0.0016335525,0.001012087,0.11524004],"category_scores_gemma":[0.0021197442,0.00076098304,0.00070950435,0.0003919405,0.00012625166,0.0010823446,0.0020570415,0.0011167757,0.04385694],"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.0013992491,0.00079240237,0.0025538406,0.00062642357,0.00006714415,0.0004754684,0.00083077356,0.0027289784,0.014666878,0.0020888313,0.520021,0.45374906],"study_design_scores_gemma":[0.0016369367,0.0009919958,0.011680756,0.00039694342,0.00020136344,0.0010144907,0.0005284275,0.07359289,0.044674307,0.011211797,0.85375196,0.00031817923],"about_ca_topic_score_codex":0.00062875106,"about_ca_topic_score_gemma":0.0018296238,"teacher_disagreement_score":0.11524004,"about_ca_system_score_codex":0.00028589138,"about_ca_system_score_gemma":0.00048556965,"threshold_uncertainty_score":0.38551635},"labels":[],"label_agreement":null},{"id":"W4377200524","doi":"10.1007/978-3-031-32883-1_6","title":"Detecting Mental Fatigue in Intelligent Tutoring Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sleep and Work-Related Fatigue","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Computer science; Mental fatigue; Mood; Cognition; Artificial intelligence; Electroencephalography; Set (abstract data type); Human–computer interaction; Applied psychology; Psychology; Clinical psychology; Psychiatry","score_opus":0.056238528958897,"score_gpt":0.3129821845201414,"score_spread":0.25674365556124445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200524","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.8872895,0.0061226883,0.09553672,0.00037211526,0.00021192664,0.00020629485,0.0011747973,0.0015250352,0.0075609675],"genre_scores_gemma":[0.9650743,0.0009828601,0.028002717,0.000119103825,0.00011586943,0.000102460865,0.00079469936,0.00005716828,0.004750839],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99984574,0.000039936745,0.00001420535,0.000032675285,0.00004464538,0.000022767339],"domain_scores_gemma":[0.9991775,0.00059341994,0.000054909673,0.00002278226,0.000110441164,0.000040962263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003020914,0.00035463256,0.0003737479,0.00066164165,0.00013093912,0.00042031228,0.00035437284,0.00048504485,0.001983822],"category_scores_gemma":[0.0023646185,0.00011954066,0.00018503316,0.00027137678,0.00008046065,0.00029484186,0.00028974286,0.00023861905,0.000581666],"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.0009948745,0.00030250195,0.08521873,0.00032042756,0.000096616764,0.0003492218,0.00047933793,0.008013533,0.039996225,0.00020490981,0.0067865616,0.857237],"study_design_scores_gemma":[0.00008658224,0.0021401676,0.62986624,0.00023031284,0.00027107378,0.0024310963,0.001095595,0.30646455,0.0454775,0.0028428114,0.0090041375,0.00008991467],"about_ca_topic_score_codex":0.0012762083,"about_ca_topic_score_gemma":0.00240246,"teacher_disagreement_score":0.001983822,"about_ca_system_score_codex":0.00016339816,"about_ca_system_score_gemma":0.0000900997,"threshold_uncertainty_score":0.00663656},"labels":[],"label_agreement":null},{"id":"W4377200540","doi":"10.1007/978-3-031-32883-1_8","title":"An Approach to Generating Adaptive Feedback for Online Formative Assessment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Athabasca University","funders":"","keywords":"Computer science; Formative assessment; Domain (mathematical analysis); Domain model; Artificial intelligence; Domain knowledge; Identification (biology); Machine learning; Process (computing); Graph; Data mining; Theoretical computer science; Programming language","score_opus":0.05292303982074282,"score_gpt":0.304699464437414,"score_spread":0.2517764246166712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200540","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.0037864593,0.000035158344,0.98881173,0.00007619484,0.000035900466,0.00022048192,0.000037203343,0.0028851049,0.0041117133],"genre_scores_gemma":[0.068300724,0.00005933652,0.92287695,0.00007729728,0.000019605362,0.00037217888,0.00012456109,0.00022728601,0.00794211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764013,0.0008344307,0.000106250285,0.00038767807,0.0009595505,0.000072021074],"domain_scores_gemma":[0.99587905,0.0022841778,0.00012834692,0.00058514863,0.0010042032,0.00011901935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021849868,0.00077954325,0.00045287242,0.00087682134,0.0005703244,0.0017303622,0.0020406477,0.0012267961,0.008173796],"category_scores_gemma":[0.009251591,0.00043526487,0.00055208756,0.0006856805,0.0006562743,0.001452255,0.0018086091,0.0012539463,0.0020788508],"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.00020023245,0.00046299893,0.000846806,0.00015068483,0.000039823994,0.00012577325,0.0012648348,0.009656125,0.029345814,0.020050827,0.0055084727,0.9323476],"study_design_scores_gemma":[0.00013645839,0.00071957946,0.0020014832,0.00014227841,0.00014725543,0.0007875061,0.0008428725,0.81359035,0.074881576,0.050508756,0.056120366,0.00012147085],"about_ca_topic_score_codex":0.0020657936,"about_ca_topic_score_gemma":0.0033557154,"teacher_disagreement_score":0.008173796,"about_ca_system_score_codex":0.00056674983,"about_ca_system_score_gemma":0.00091157824,"threshold_uncertainty_score":0.027344048},"labels":[],"label_agreement":null},{"id":"W4377200541","doi":"10.1007/978-3-031-32883-1_27","title":"iQUIZ!: A Collaborative Online Learning System that Promotes Growth Mindset Using Persuasive Feedback","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Mindset; Praise; Computer science; Collaborative learning; Knowledge management; Active learning (machine learning); Multimedia; Human–computer interaction; Psychology; Artificial intelligence; Social psychology","score_opus":0.06566501009925604,"score_gpt":0.35540760602285776,"score_spread":0.28974259592360174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29775485,0.0021811158,0.44332585,0.0018445782,0.001419501,0.001150866,0.0020596862,0.11057108,0.13969256],"genre_scores_gemma":[0.38155562,0.0015379423,0.3729114,0.0011896931,0.00035504514,0.0016801283,0.003764662,0.0072797793,0.22972573],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99983656,0.00003560161,0.0000075516136,0.000030807983,0.00006826333,0.000021235188],"domain_scores_gemma":[0.999371,0.0004066716,0.000026519458,0.000039376795,0.00006514141,0.000091230264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045090402,0.00071505154,0.0003483908,0.0005889345,0.00036742925,0.00089911744,0.0010206875,0.00077172514,0.027476577],"category_scores_gemma":[0.001488335,0.00021323311,0.0003384663,0.00024197706,0.00013415674,0.0010726374,0.0012387536,0.0007222232,0.007293357],"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.0007859033,0.0017534167,0.0014098132,0.0004833381,0.000036252033,0.00019134012,0.0012174683,0.0008075742,0.03912919,0.0019452879,0.081731185,0.8705092],"study_design_scores_gemma":[0.0020987967,0.0071945456,0.057540484,0.00052624365,0.00077499123,0.0030818558,0.0021390053,0.07819817,0.18103534,0.017677527,0.6491699,0.00056314614],"about_ca_topic_score_codex":0.0005064783,"about_ca_topic_score_gemma":0.0011880168,"teacher_disagreement_score":0.027476577,"about_ca_system_score_codex":0.00014251038,"about_ca_system_score_gemma":0.00034331816,"threshold_uncertainty_score":0.09191829},"labels":[],"label_agreement":null},{"id":"W4377200548","doi":"10.1007/978-3-031-32883-1_18","title":"Attention Assessment of Aircraft Pilots Using Eye Tracking","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Aviation; Aeronautics; Air traffic control; Computer science; Variety (cybernetics); Tourism; Eye tracking; Airplane; Simulation; Engineering; Artificial intelligence; Political science; Aerospace engineering","score_opus":0.06662011867576621,"score_gpt":0.4048095671939042,"score_spread":0.338189448518138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200548","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.9688493,0.0017434728,0.023397593,0.000068084664,0.0001022534,0.0001259294,0.00037449942,0.00030804618,0.00503086],"genre_scores_gemma":[0.9921564,0.0005925026,0.0050271326,0.000054028627,0.00003240851,0.00004004959,0.00018591844,0.00002123159,0.0018902336],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99989796,0.000022698761,0.000007243345,0.000026881615,0.000027534898,0.000017687998],"domain_scores_gemma":[0.99965286,0.00014487575,0.000036064524,0.000014560119,0.00011918166,0.00003239207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019571817,0.0003145429,0.00030354963,0.0005296249,0.000139253,0.00029031665,0.000154461,0.00030436972,0.0016268549],"category_scores_gemma":[0.0009613347,0.00008992477,0.00015820494,0.00024147671,0.00006445893,0.0002263886,0.0002359553,0.00022767615,0.00040255007],"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.003290935,0.00039475007,0.05567333,0.00036375033,0.00014740805,0.00035976098,0.0006943015,0.0014483476,0.47436044,0.000121482924,0.0019761273,0.46116933],"study_design_scores_gemma":[0.00013468598,0.003420044,0.9032694,0.00011407215,0.00029000343,0.0013374609,0.0007009288,0.026911113,0.06085073,0.0003489915,0.0025636351,0.000058992493],"about_ca_topic_score_codex":0.0025838655,"about_ca_topic_score_gemma":0.002941502,"teacher_disagreement_score":0.0025838655,"about_ca_system_score_codex":0.000108423395,"about_ca_system_score_gemma":0.00014084844,"threshold_uncertainty_score":0.005442381},"labels":[],"label_agreement":null},{"id":"W4377200550","doi":"10.1007/978-3-031-32883-1_3","title":"Automatic Execution of the Ontological Piloting Procedures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Ontology; Semantic reasoner; Task (project management); Domain (mathematical analysis); Precondition; Software engineering; Domain knowledge; Human–computer interaction; Programming language; Artificial intelligence; Systems engineering","score_opus":0.0305981254710687,"score_gpt":0.2592375615015126,"score_spread":0.2286394360304439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200550","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.027340971,0.00011563057,0.9114765,0.00023235111,0.00013346682,0.00042015366,0.0005076019,0.051706925,0.00806632],"genre_scores_gemma":[0.28121203,0.00016237368,0.7025175,0.00019944836,0.00005488551,0.00038273347,0.002472617,0.005515873,0.007482514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971852,0.00072052825,0.00016876169,0.00045596366,0.0011482252,0.00032128496],"domain_scores_gemma":[0.9928509,0.0037440967,0.00032480608,0.0017829784,0.0010840177,0.00021327585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025433975,0.0012857701,0.0009393552,0.0017816392,0.001259005,0.0026110923,0.0015501974,0.0010177696,0.01601512],"category_scores_gemma":[0.014376092,0.0008491967,0.0011662019,0.0008626324,0.0010876837,0.0026558607,0.0031601351,0.0016193397,0.007338678],"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.0010805008,0.0003846806,0.004463161,0.00057197444,0.00007930449,0.0011018905,0.0016414097,0.016099716,0.07694921,0.041779134,0.027828762,0.8280203],"study_design_scores_gemma":[0.00016734438,0.00026329228,0.006391242,0.00031389642,0.00018838985,0.0010462506,0.0012591026,0.5188114,0.2903817,0.07573684,0.10519144,0.00024909497],"about_ca_topic_score_codex":0.0048607974,"about_ca_topic_score_gemma":0.0034517993,"teacher_disagreement_score":0.01601512,"about_ca_system_score_codex":0.0006855952,"about_ca_system_score_gemma":0.0026735947,"threshold_uncertainty_score":0.053575873},"labels":[],"label_agreement":null},{"id":"W4377200553","doi":"10.1007/978-3-031-32883-1","title":"Augmented Intelligence and Intelligent Tutoring Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Montréal","funders":"","keywords":"Computer science; Augmented reality; Human–computer interaction; Virtual reality; Multimedia; Artificial intelligence","score_opus":0.03236140845236309,"score_gpt":0.26281990300084845,"score_spread":0.23045849454848535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200553","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037083145,0.16957322,0.42987308,0.0023388313,0.003104664,0.00009407179,0.00029469855,0.001980188,0.35565805],"genre_scores_gemma":[0.55942875,0.061901454,0.10251832,0.0003585007,0.0017185622,0.0001752218,0.0005154278,0.00015574772,0.27322802],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997756,0.000079660786,0.000012171338,0.000033818073,0.0000823267,0.00001644635],"domain_scores_gemma":[0.99961686,0.000267081,0.00001793219,0.000042863077,0.0000463566,0.00000892384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021457285,0.0005984611,0.0005790253,0.0004452282,0.0002485067,0.0021159258,0.0005531357,0.0010199886,0.015555399],"category_scores_gemma":[0.0009110677,0.00028088555,0.00027159264,0.00082684006,0.0006687046,0.0018550706,0.0007095829,0.00075779686,0.00226209],"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.00023470107,0.00011834247,0.00041497507,0.00074485416,0.00008855642,0.000311127,0.0002700535,0.04138754,0.007380994,0.22221255,0.031128787,0.69570756],"study_design_scores_gemma":[0.00008856728,0.00035270795,0.0020496808,0.00032320866,0.0001162779,0.0014106851,0.0003226891,0.15275294,0.008535609,0.44665268,0.387324,0.00007098984],"about_ca_topic_score_codex":0.00067934353,"about_ca_topic_score_gemma":0.0008146367,"teacher_disagreement_score":0.015555399,"about_ca_system_score_codex":0.00027069612,"about_ca_system_score_gemma":0.00017633173,"threshold_uncertainty_score":0.052038014},"labels":[],"label_agreement":null},{"id":"W4377200554","doi":"10.1007/978-3-031-32883-1_29","title":"Learning Engagement and Peer Learning in MOOC: A Selective Systematic Review","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Université TÉLUQ","funders":"","keywords":"Computer science; Student engagement; Inclusion (mineral); Dropout (neural networks); Online learning; Collaborative learning; Multimedia; Mathematics education; Machine learning; Psychology; Knowledge management","score_opus":0.022069325650085656,"score_gpt":0.27814946508380445,"score_spread":0.25608013943371877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200554","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004778284,0.9886989,0.001024387,0.00093067175,0.00040156048,0.0027794016,0.00092041306,0.00003052028,0.00043583367],"genre_scores_gemma":[0.1188609,0.86131924,0.00555923,0.0035565621,0.0004404189,0.008671743,0.0009436164,0.000057260662,0.0005909829],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9518196,0.017859692,0.01916805,0.00333247,0.0067169033,0.0011032899],"domain_scores_gemma":[0.84875834,0.11437872,0.022665255,0.0035887994,0.009156772,0.0014520424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.040495913,0.0015587229,0.009422629,0.014601606,0.0012208942,0.0047523347,0.0023106106,0.0032788601,0.0032811519],"category_scores_gemma":[0.16120557,0.0016484634,0.013189701,0.011694122,0.0021793593,0.0040636463,0.0051643467,0.0022655225,0.00037507658],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006492522,0.000044040986,0.0023929258,0.91367656,0.029783338,0.00013708793,0.00094168447,0.00008685423,0.00031949952,0.00028623833,0.0016851831,0.049997453],"study_design_scores_gemma":[0.0008536734,0.00044049034,0.0073935143,0.8251713,0.15199822,0.0002884913,0.0010936805,0.00010429329,0.0003080331,0.00058109366,0.011691497,0.00007574687],"about_ca_topic_score_codex":0.01103009,"about_ca_topic_score_gemma":0.04783464,"teacher_disagreement_score":0.040495913,"about_ca_system_score_codex":0.0057937964,"about_ca_system_score_gemma":0.029984495,"threshold_uncertainty_score":0.21416545},"labels":[],"label_agreement":null},{"id":"W4377200557","doi":"10.1007/978-3-031-32883-1_16","title":"Integrating an Ontological Reference Model of Piloting Procedures in ACT-R Cognitive Architecture to Simulate Piloting Tasks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cognitive architecture; Cognition; Cognitive model; Architecture; Human–computer interaction; Function (biology); Key (lock); Replicate; Field (mathematics); Declarative memory; Artificial intelligence; Psychology","score_opus":0.07183298808177459,"score_gpt":0.3106141102076346,"score_spread":0.23878112212586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09774011,0.00006690995,0.86922187,0.00032902573,0.00007329849,0.00022618861,0.0004737173,0.0028157884,0.029053068],"genre_scores_gemma":[0.62526214,0.00010264046,0.36378753,0.00009511502,0.000008217366,0.00030095008,0.00081913744,0.00034580225,0.009278512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994361,0.0002526378,0.00004307762,0.00008623887,0.00013855126,0.000043327585],"domain_scores_gemma":[0.99909925,0.00034634626,0.0000530319,0.00024453187,0.00021409454,0.00004277442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019803,0.0004982575,0.00027744524,0.00066633074,0.00049675064,0.0020234596,0.0012215031,0.0010836563,0.0054979366],"category_scores_gemma":[0.0033020268,0.0003795526,0.00074950606,0.0004165465,0.00079632696,0.0021320102,0.00091719936,0.0008849655,0.0013910552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036481433,0.00050915376,0.0036796166,0.00029631105,0.000084700376,0.0004362539,0.004949848,0.42771813,0.031506833,0.41077524,0.004075935,0.11560322],"study_design_scores_gemma":[0.000043855387,0.00013004769,0.0011237771,0.000064037085,0.00007534957,0.00009953602,0.00036078156,0.92122537,0.010556754,0.04706635,0.0192029,0.000051231327],"about_ca_topic_score_codex":0.016158747,"about_ca_topic_score_gemma":0.0148191545,"teacher_disagreement_score":0.016158747,"about_ca_system_score_codex":0.0013950326,"about_ca_system_score_gemma":0.0017280573,"threshold_uncertainty_score":0.032129407},"labels":[],"label_agreement":null},{"id":"W4377200559","doi":"10.1007/978-3-031-32883-1_44","title":"Distraction Detection and Monitoring Using Eye Tracking in Virtual Reality","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","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":"Université de Montréal","funders":"","keywords":"Distraction; Computer science; Eye tracking; Relaxation (psychology); Process (computing); Virtual reality; Human–computer interaction; Cognitive load; Driving simulator; Cognition; Artificial intelligence; Computer vision; Cognitive psychology; Psychology","score_opus":0.04479556368736659,"score_gpt":0.30883080938326973,"score_spread":0.26403524569590314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35577354,0.010583564,0.6141169,0.0001843608,0.00038036858,0.00017019345,0.0013071212,0.0039747492,0.013509172],"genre_scores_gemma":[0.8748764,0.0026980215,0.11585042,0.00012510816,0.00012583472,0.000119359676,0.00044365524,0.0001786428,0.0055824947],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99969995,0.00006025831,0.000016443506,0.00009890871,0.00008266426,0.000041818683],"domain_scores_gemma":[0.9995209,0.00027343794,0.00005096957,0.00004237495,0.0000825576,0.000029733861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029429,0.00052727386,0.0005523049,0.00084787875,0.0001838021,0.00085559534,0.00070736726,0.0006899192,0.0022305388],"category_scores_gemma":[0.0010421011,0.00032323765,0.0003912566,0.0005939201,0.00012773884,0.000493637,0.00057762774,0.00038148026,0.0008622705],"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.0020080525,0.0002593811,0.0064521427,0.0005182076,0.0001747213,0.0002616025,0.00035334734,0.005396275,0.3981457,0.00087335985,0.003457404,0.58209985],"study_design_scores_gemma":[0.00039361537,0.0034203834,0.17591731,0.00038191973,0.00089983613,0.007095149,0.0006272704,0.38360175,0.39894387,0.0053328685,0.022956153,0.0004298052],"about_ca_topic_score_codex":0.0011619482,"about_ca_topic_score_gemma":0.0015388861,"teacher_disagreement_score":0.0022305388,"about_ca_system_score_codex":0.00017146213,"about_ca_system_score_gemma":0.0001868474,"threshold_uncertainty_score":0.007461846},"labels":[],"label_agreement":null},{"id":"W4377200560","doi":"10.1007/978-3-031-32883-1_48","title":"Automatic Learning of Piloting Behavior from Flight Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Aerospace and Aviation Technology","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Generalization; Computer science; Takeoff; Artificial intelligence; Artificial neural network; Machine learning; Task (project management); Engineering","score_opus":0.025274803049934125,"score_gpt":0.24450428240608024,"score_spread":0.21922947935614612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24230029,0.001155766,0.74007493,0.00019725841,0.00015220813,0.00007975618,0.0012860363,0.011581631,0.0031720994],"genre_scores_gemma":[0.8453748,0.00045529296,0.14295249,0.000109131804,0.00012499727,0.000088401066,0.004184154,0.0002641142,0.0064465683],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99985063,0.000021200036,0.000007098468,0.000062464045,0.000026199526,0.000032275737],"domain_scores_gemma":[0.9993187,0.00042778265,0.00005177933,0.00006864345,0.000099689125,0.000033277993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030442313,0.0008166023,0.0006863565,0.00081700657,0.00018005083,0.00038391637,0.0007849352,0.00059517246,0.0016183393],"category_scores_gemma":[0.0010511567,0.00029750427,0.00058345695,0.00057724986,0.00018839556,0.0004942015,0.00046315198,0.0008062492,0.0014002383],"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.00021756845,0.00019981069,0.0041467156,0.000078380675,0.000056273962,0.00008298704,0.000031396987,0.04680646,0.024576984,0.00020867755,0.003421277,0.92017347],"study_design_scores_gemma":[0.000011733059,0.00010193252,0.0049692015,0.000013799737,0.000028773742,0.00009921901,0.000017009683,0.98313206,0.010143515,0.000706957,0.0007658921,0.000009911029],"about_ca_topic_score_codex":0.0033878009,"about_ca_topic_score_gemma":0.005009709,"teacher_disagreement_score":0.0033878009,"about_ca_system_score_codex":0.0001889509,"about_ca_system_score_gemma":0.00034139448,"threshold_uncertainty_score":0.0067361593},"labels":[],"label_agreement":null},{"id":"W4377200562","doi":"10.1007/978-3-031-32883-1_47","title":"An Approach to Automatic Flight Deviation Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université de Montréal","funders":"","keywords":"Computer science; Sequence (biology); Data mining; Process (computing); Cockpit; Task (project management); Relation (database); Real-time computing; Artificial intelligence; Systems engineering","score_opus":0.021118191137649588,"score_gpt":0.24407242691018652,"score_spread":0.22295423577253692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200562","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.0018060075,0.00009607164,0.9944332,0.000033155753,0.00004335904,0.00003509213,0.000046094006,0.0014413928,0.0020655687],"genre_scores_gemma":[0.070947155,0.00023210477,0.9176697,0.000106751024,0.000059658,0.00008436571,0.00032625213,0.00022345109,0.010350637],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994991,0.000043733467,0.00001915295,0.00012812686,0.0002558158,0.000053999094],"domain_scores_gemma":[0.99964213,0.00009805016,0.00002050556,0.00007901456,0.0001431312,0.000017190385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032268747,0.0009704539,0.00091858953,0.0016208352,0.00073225243,0.0012938005,0.002041658,0.0011591684,0.006014162],"category_scores_gemma":[0.00077004876,0.0005592291,0.00084609515,0.0011637643,0.00059906574,0.0009637053,0.0018034085,0.0010852044,0.0022733274],"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.00014666813,0.00015577419,0.0007174604,0.00012312285,0.0000772757,0.00022059276,0.000103822225,0.052746627,0.067200705,0.018891558,0.00824488,0.8513715],"study_design_scores_gemma":[0.000018496905,0.000089496,0.0006422402,0.000020342153,0.00004180811,0.00035801507,0.00007943992,0.9384784,0.028713245,0.019092234,0.012435449,0.000030887517],"about_ca_topic_score_codex":0.0056769853,"about_ca_topic_score_gemma":0.006803809,"teacher_disagreement_score":0.006014162,"about_ca_system_score_codex":0.00044859154,"about_ca_system_score_gemma":0.0007992297,"threshold_uncertainty_score":0.020119369},"labels":[],"label_agreement":null},{"id":"W4377200563","doi":"10.1007/978-3-031-32883-1_31","title":"Learning by Building Chatbot: A System Usability Study and Teachers’ Views About the Educational Uses of Chatbots","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","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":"Athabasca University","funders":"","keywords":"Chatbot; Usability; Computer science; Service (business); World Wide Web; Multimedia; Human–computer interaction","score_opus":0.03395052606071468,"score_gpt":0.30760899672655084,"score_spread":0.27365847066583615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200563","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.9877878,0.00044006694,0.003316659,0.0004876705,0.000020347015,0.000118770775,0.000036040896,0.000085887776,0.0077067357],"genre_scores_gemma":[0.9932689,0.00030751122,0.0017767918,0.0001364647,0.000012113663,0.00010089133,0.000047249443,0.00007473499,0.004275334],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9909853,0.0061954795,0.0004863363,0.0005362684,0.0012880007,0.0005086265],"domain_scores_gemma":[0.92503023,0.064128146,0.0024367324,0.0013797091,0.005684008,0.0013412385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012854051,0.0004874246,0.00051568873,0.0018694628,0.0030387435,0.004312441,0.00092106406,0.0014151064,0.0028890977],"category_scores_gemma":[0.040579263,0.0006348998,0.00041364462,0.0012495304,0.0024403273,0.0054272213,0.0023870878,0.0017294843,0.00065243716],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088393677,0.0016651691,0.056383193,0.0012345464,0.000053352403,0.0012673744,0.8201173,0.00048171912,0.012723459,0.004446127,0.003200111,0.09754366],"study_design_scores_gemma":[0.00022625174,0.005471021,0.15605064,0.0012762073,0.00035457066,0.0029271627,0.7495382,0.006305919,0.023723219,0.002151663,0.05171873,0.0002563888],"about_ca_topic_score_codex":0.0031962057,"about_ca_topic_score_gemma":0.005027178,"teacher_disagreement_score":0.012854051,"about_ca_system_score_codex":0.0016876238,"about_ca_system_score_gemma":0.0013369058,"threshold_uncertainty_score":0.067979574},"labels":[],"label_agreement":null},{"id":"W4377200570","doi":"10.1007/978-3-031-32883-1_55","title":"Preliminary Performance Assessment on Ask4Summary’s Reading Methods for Summary Generation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Athabasca University","funders":"","keywords":"Python (programming language); Computer science; Reading (process); Syntax; Mathematics education; Artificial intelligence; World Wide Web; Natural language processing; Programming language; Linguistics; Psychology","score_opus":0.06385710022590928,"score_gpt":0.3447172890229146,"score_spread":0.2808601887970053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17097546,0.004038863,0.45072892,0.002963213,0.0023941728,0.0026555557,0.022081513,0.29849043,0.04567185],"genre_scores_gemma":[0.23646039,0.00067384186,0.66370356,0.0008129627,0.0003701969,0.0012116384,0.04937153,0.010279763,0.03711614],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9909253,0.004394506,0.0008528072,0.0015036629,0.001890909,0.00043284017],"domain_scores_gemma":[0.9463535,0.036603317,0.0007416216,0.006974732,0.007968231,0.0013584796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009082771,0.0023324813,0.0017731182,0.0042050164,0.0012587317,0.0037538316,0.0038235933,0.0024116405,0.08518436],"category_scores_gemma":[0.05591201,0.00078044744,0.0017751119,0.0026119843,0.0004935953,0.0048445635,0.003697166,0.0020725657,0.034462538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002318188,0.00071882876,0.0032022996,0.0010133572,0.00039201565,0.0001772423,0.0008154478,0.0072512673,0.007712344,0.0025388217,0.09796869,0.8758915],"study_design_scores_gemma":[0.002391766,0.0019155694,0.011412258,0.0004892268,0.000890512,0.0007747486,0.0034867732,0.73156375,0.071358,0.009728986,0.16566919,0.00031926687],"about_ca_topic_score_codex":0.0124666365,"about_ca_topic_score_gemma":0.015653852,"teacher_disagreement_score":0.08518436,"about_ca_system_score_codex":0.0014570486,"about_ca_system_score_gemma":0.0022200055,"threshold_uncertainty_score":0.2849701},"labels":[],"label_agreement":null},{"id":"W4377200573","doi":"10.1007/978-3-031-32883-1_40","title":"Emotional Impact of Cognitive Priming on Alzheimer’s Disease","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Priming (agriculture); Cognition; Disease; Cognitive psychology; Negative priming; Psychology; Computer science; Medicine; Neuroscience; Internal medicine","score_opus":0.1346414125861708,"score_gpt":0.3475160884960887,"score_spread":0.21287467590991793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200573","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.93464124,0.013581665,0.0005969305,0.0012537589,0.00051257317,0.000028783354,0.00024266243,0.00002687344,0.049115468],"genre_scores_gemma":[0.99091876,0.0038240277,0.00035509685,0.00028069023,0.0004051151,0.00001582764,0.00012763131,0.000012482232,0.0040603275],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99994457,0.000024654337,0.0000028040254,0.000008442935,0.000010403107,0.000009113662],"domain_scores_gemma":[0.9993338,0.0005233697,0.000049364702,0.000030145922,0.000019623847,0.00004370285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036791823,0.0002499812,0.00021095647,0.00010472778,0.00012007543,0.000379672,0.00016671253,0.00031418595,0.008339528],"category_scores_gemma":[0.0015722332,0.00007684595,0.00015158458,0.00012437957,0.00020411593,0.0002877163,0.00022779511,0.00048028026,0.00035650624],"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.06360516,0.0050338986,0.046495922,0.0023589677,0.0005203124,0.005671817,0.0023938934,0.0015301813,0.22333713,0.023011062,0.016486567,0.6095552],"study_design_scores_gemma":[0.001061201,0.008485439,0.89581263,0.0004154237,0.0008555466,0.0034896282,0.0007683192,0.0017876091,0.020102443,0.044575453,0.022584517,0.00006173556],"about_ca_topic_score_codex":0.0002226402,"about_ca_topic_score_gemma":0.00028049405,"teacher_disagreement_score":0.008339528,"about_ca_system_score_codex":0.00014702533,"about_ca_system_score_gemma":0.00013547091,"threshold_uncertainty_score":0.02789849},"labels":[],"label_agreement":null},{"id":"W4377200602","doi":"10.1007/978-3-031-32883-1_13","title":"Expert-Centered Design Recommendations to Promote Engagement in Authoring Activities of Adaptive Learning Technologies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"McGill University","funders":"","keywords":"Computer science; Mainstream; Context (archaeology); Domain (mathematical analysis); Knowledge management; Multimedia","score_opus":0.17305355131080247,"score_gpt":0.39818342764493836,"score_spread":0.2251298763341359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030742062,0.0024221628,0.8618096,0.009757723,0.0013546023,0.0010302741,0.0002666612,0.0063079265,0.08630901],"genre_scores_gemma":[0.15060146,0.0024657699,0.7609549,0.0023231371,0.00042082526,0.0012253777,0.00085088535,0.0009348155,0.08022279],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99705136,0.001303455,0.00020936562,0.0002475258,0.0010422161,0.0001460454],"domain_scores_gemma":[0.9890826,0.0066663367,0.00043109932,0.00070501294,0.002574402,0.0005406155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003979931,0.0010778973,0.00035502444,0.00091258326,0.0005648303,0.002504048,0.001581967,0.0023425783,0.01525107],"category_scores_gemma":[0.011076772,0.0005159353,0.00044744424,0.00040493035,0.0004334007,0.0035528704,0.0013085677,0.0018100974,0.0040438483],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002464955,0.0014343588,0.0018400326,0.001361656,0.000038969876,0.0004097649,0.0046041785,0.0056549953,0.018788962,0.025957562,0.09672869,0.84293437],"study_design_scores_gemma":[0.0004840588,0.0013774891,0.0072291614,0.0031086558,0.0002924067,0.0016078504,0.0065134596,0.082482964,0.05008763,0.11564341,0.73091024,0.000262573],"about_ca_topic_score_codex":0.0005871475,"about_ca_topic_score_gemma":0.0021837126,"teacher_disagreement_score":0.01525107,"about_ca_system_score_codex":0.0004280766,"about_ca_system_score_gemma":0.0008628392,"threshold_uncertainty_score":0.051019907},"labels":[],"label_agreement":null},{"id":"W4377200603","doi":"10.1007/978-3-031-32883-1_39","title":"The Relative Importance of Cognitive and Behavioral Engagement to Task Performance in Self-regulated Learning with an Intelligent Tutoring System","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Student engagement; Task (project management); Context (archaeology); Cognition; Psychology; Intelligent tutoring system; Think aloud protocol; Computer science; Protocol analysis; Self-regulated learning; Cognitive psychology; Mathematics education; Human–computer interaction; Cognitive science; Usability","score_opus":0.05161505624065156,"score_gpt":0.350663514400734,"score_spread":0.29904845816008246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200603","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.99015665,0.000788716,0.0042642956,0.000053414526,0.00002514735,0.000014193018,0.000051764615,0.000052998494,0.004592746],"genre_scores_gemma":[0.99788874,0.0002023369,0.0009127505,0.0000144606765,0.000014532539,0.000010513836,0.00004788433,0.000021891288,0.00088697945],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99963796,0.00013122633,0.000021383348,0.00006070017,0.00011347458,0.000035279434],"domain_scores_gemma":[0.99245024,0.0066382014,0.0002931765,0.00012914222,0.0002636002,0.00022563395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088121224,0.00022570818,0.00026771703,0.00031691726,0.00009902913,0.0006584787,0.00021600522,0.00032422345,0.0012024913],"category_scores_gemma":[0.0069725,0.00014479071,0.00015149571,0.0002624209,0.00024434135,0.0003571422,0.00036167091,0.00042043588,0.00021396443],"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.009816455,0.0013971135,0.16280381,0.000513276,0.00023483088,0.0004911489,0.0016630334,0.01064246,0.27968654,0.0014969319,0.00090562535,0.53034884],"study_design_scores_gemma":[0.00007353052,0.00286121,0.93302745,0.0000500628,0.00023006104,0.0004594847,0.00028615264,0.03429368,0.026651306,0.001318805,0.00071538537,0.00003282676],"about_ca_topic_score_codex":0.0004542683,"about_ca_topic_score_gemma":0.0006681523,"teacher_disagreement_score":0.0012024913,"about_ca_system_score_codex":0.00013290183,"about_ca_system_score_gemma":0.00014201606,"threshold_uncertainty_score":0.004660368},"labels":[],"label_agreement":null},{"id":"W4377200606","doi":"10.1007/978-3-031-32883-1_35","title":"Estimation of Piloting Attention Level Based on the Correlation of Pupil Dilation and EEG","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Pupillary response; Takeoff; Aircrew; Workload; Electroencephalography; Pupil size; Computer science; Pupillometry; Pupil; Pupil diameter; Situation awareness; Eye tracking; Simulation; Psychology; Aeronautics; Artificial intelligence; Engineering","score_opus":0.05793531136234827,"score_gpt":0.32832653020200725,"score_spread":0.270391218839659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200606","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.79419196,0.0016121082,0.19763005,0.00009000281,0.000096546035,0.00017664736,0.0005273857,0.0008908152,0.004784486],"genre_scores_gemma":[0.96678895,0.000534979,0.031415816,0.00002972257,0.00006416703,0.00005061185,0.000241975,0.000030124944,0.0008437525],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998723,0.000027208427,0.0000071644295,0.000041319487,0.000035704346,0.000016163964],"domain_scores_gemma":[0.9996581,0.00017633195,0.000038067705,0.000014304991,0.0000846677,0.000028616216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021961704,0.00032686305,0.00033983722,0.0008035463,0.00011599928,0.0003037427,0.00014501053,0.00030582235,0.0011834714],"category_scores_gemma":[0.0008243706,0.00016035626,0.00023610023,0.00049701775,0.00013053446,0.00031723012,0.00019854677,0.00021093112,0.00030442458],"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.0015073331,0.00021466288,0.055650946,0.00035385208,0.0001739481,0.00038963972,0.00022254771,0.0027646357,0.51914257,0.0002716032,0.0011711296,0.41813707],"study_design_scores_gemma":[0.00014164316,0.0021848478,0.7704048,0.00006130193,0.00038366433,0.0036359115,0.00028019762,0.108610466,0.11169219,0.00072194455,0.0017854926,0.00009760351],"about_ca_topic_score_codex":0.00053624547,"about_ca_topic_score_gemma":0.0008379598,"teacher_disagreement_score":0.0011834714,"about_ca_system_score_codex":0.000079751306,"about_ca_system_score_gemma":0.00011315601,"threshold_uncertainty_score":0.0039591193},"labels":[],"label_agreement":null},{"id":"W4377231228","doi":"10.1007/978-3-031-33271-5_24","title":"A Weighted Counting Algorithm for the Circuit Constraint","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint (computer-aided design); Probabilistic logic; Estimator; Algorithm; Constraint programming; Measure (data warehouse); Graph; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Stochastic programming; Data mining; Statistics","score_opus":0.02418396410470778,"score_gpt":0.24439470522688383,"score_spread":0.22021074112217606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002885806,0.00017498306,0.98825955,0.00015031952,0.00009705034,0.00014741826,0.00019437529,0.0012209929,0.006869405],"genre_scores_gemma":[0.022642104,0.0001934535,0.96507883,0.00013337543,0.00008365117,0.0002656173,0.00081867166,0.000810094,0.009974171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.0003484673,0.0001234229,0.0004676655,0.0007797756,0.00021062144],"domain_scores_gemma":[0.99727196,0.001239528,0.000117673524,0.0006211171,0.00064076844,0.00010888649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012782327,0.001995571,0.0018653541,0.0028351466,0.0015670798,0.003023027,0.0051815063,0.0017732844,0.029730218],"category_scores_gemma":[0.0068777925,0.0011048281,0.0017431107,0.005956702,0.0009233526,0.0054031317,0.00284483,0.0030742732,0.0059878156],"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.000187587,0.00020719442,0.0002570709,0.0002909239,0.00006698452,0.0000653591,0.00007008852,0.048446953,0.006624286,0.09590382,0.021284934,0.8265949],"study_design_scores_gemma":[0.00012743201,0.000082780396,0.0002563257,0.00007175307,0.00007679151,0.00017388248,0.000052557985,0.7941631,0.006762605,0.17386608,0.024319489,0.00004722446],"about_ca_topic_score_codex":0.0066429344,"about_ca_topic_score_gemma":0.009589251,"teacher_disagreement_score":0.029730218,"about_ca_system_score_codex":0.0019545048,"about_ca_system_score_gemma":0.003068041,"threshold_uncertainty_score":0.0994575},"labels":[],"label_agreement":null},{"id":"W4377231315","doi":"10.1007/978-3-031-33271-5_21","title":"Exploiting Entropy in Constraint Programming","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristics; Constraint programming; Mathematical optimization; Computation; Principle of maximum entropy; Entropy (arrow of time); Benchmark (surveying); Constraint (computer-aided design); Constraint satisfaction; Theoretical computer science; Algorithm; Artificial intelligence; Stochastic programming; Mathematics; Probabilistic logic","score_opus":0.022995697737497572,"score_gpt":0.24927258729502985,"score_spread":0.22627688955753228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044090697,0.0015718713,0.9595838,0.0007161849,0.00014505899,0.000026903552,0.00011039222,0.00020059706,0.03323606],"genre_scores_gemma":[0.34528932,0.0050916257,0.6124087,0.00069628365,0.0010354767,0.00022697833,0.00055605423,0.0006834962,0.034011997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.0005488935,0.000051304516,0.000116053525,0.0004890234,0.000058953843],"domain_scores_gemma":[0.99680567,0.0025705758,0.00009038753,0.00031184964,0.00016191666,0.000059499725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357327,0.0008339687,0.00083769194,0.0010360556,0.0005691162,0.0014912175,0.0009663086,0.0005098026,0.0074743135],"category_scores_gemma":[0.0059249103,0.00071147876,0.0009731891,0.0022968354,0.0017233544,0.0031796242,0.0022523648,0.0028215111,0.0009426483],"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.000037714453,0.000028657818,0.00016771391,0.00016697212,0.000053631218,0.000054032014,0.00009578769,0.06392916,0.0011335268,0.82242125,0.006088744,0.10582279],"study_design_scores_gemma":[0.000005180423,0.000010467058,0.000079354795,0.000029280965,0.000012029669,0.000024655352,0.000012979256,0.15516318,0.00074622396,0.83474445,0.009161305,0.000010914609],"about_ca_topic_score_codex":0.0011740542,"about_ca_topic_score_gemma":0.0017525969,"teacher_disagreement_score":0.0074743135,"about_ca_system_score_codex":0.0009928425,"about_ca_system_score_gemma":0.00070446,"threshold_uncertainty_score":0.02500403},"labels":[],"label_agreement":null},{"id":"W4377231357","doi":"10.1007/978-3-031-33271-5_15","title":"OAMIP: Optimizing ANN Architectures Using Mixed-Integer Programming","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Mila - Quebec Artificial Intelligence Institute; Université de Montréal","funders":"","keywords":"Computer science; Integer programming; Integer (computer science); Parallel computing; Theoretical computer science; Algorithm; Programming language","score_opus":0.03867590991141418,"score_gpt":0.28250803511291356,"score_spread":0.24383212520149938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010000766,0.0004923336,0.9642087,0.00014482133,0.00018469502,0.00003773929,0.00020651844,0.0066942293,0.018030174],"genre_scores_gemma":[0.13452268,0.0003170173,0.8453905,0.00015787782,0.00006846806,0.0001955838,0.0004940186,0.0022658808,0.016587993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998299,0.00004110021,0.00000794118,0.000028944483,0.00006955304,0.000022418755],"domain_scores_gemma":[0.9997489,0.00014910041,0.000021097541,0.000027270786,0.000042338605,0.000011361489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029333844,0.0012819006,0.00045270877,0.00029487896,0.00026341985,0.00081510417,0.0012132152,0.0005810684,0.012896455],"category_scores_gemma":[0.00092920917,0.00058983365,0.0005610759,0.000368437,0.00023289681,0.00075665023,0.0005565417,0.0012035833,0.0022071765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001697874,0.00007828382,0.00037526383,0.00025765604,0.000090109614,0.00009342151,0.000035523117,0.6967238,0.012082155,0.017321842,0.015601464,0.25717062],"study_design_scores_gemma":[0.000017835724,0.00002158203,0.000053542517,0.00001185408,0.000009463948,0.000019302734,0.000003827575,0.9877965,0.003210354,0.0040671555,0.004783682,0.0000049920372],"about_ca_topic_score_codex":0.0013906792,"about_ca_topic_score_gemma":0.00301422,"teacher_disagreement_score":0.012896455,"about_ca_system_score_codex":0.00028947063,"about_ca_system_score_gemma":0.00042376292,"threshold_uncertainty_score":0.043142915},"labels":[],"label_agreement":null},{"id":"W4377231387","doi":"10.1007/978-3-031-33271-5_2","title":"Objective-Based Counterfactual Explanations for Linear Discrete Optimization","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Counterfactual thinking; Computer science; Mathematical optimization; Linear programming; Quadratic equation; Optimization problem; Convex optimization; Quadratic programming; Regular polygon; Discrete optimization; Algorithm; Mathematics","score_opus":0.07926726354595628,"score_gpt":0.35992978588646607,"score_spread":0.2806625223405098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023968184,0.0017899354,0.9242406,0.007841084,0.00037130667,0.0000836946,0.0005218695,0.00028993384,0.040893413],"genre_scores_gemma":[0.7958672,0.0018554712,0.18892309,0.0007292788,0.0005773165,0.0002836765,0.00061824743,0.00014004848,0.011005645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977501,0.0016165769,0.00010674527,0.00013514291,0.0003065906,0.000084811196],"domain_scores_gemma":[0.979235,0.018414957,0.00077261735,0.0010395434,0.00038073884,0.00015702078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004319482,0.000895878,0.00075008447,0.0010231936,0.00048500326,0.0028031294,0.0022593515,0.0019064604,0.0135907335],"category_scores_gemma":[0.020634267,0.0006019085,0.001061499,0.0011438788,0.002120738,0.0044788835,0.0013372296,0.0036110035,0.0006178578],"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.000039255534,0.000031882762,0.00020091578,0.00009023164,0.000032453947,0.000056729517,0.00010946857,0.016882373,0.00007546567,0.9704024,0.0017828252,0.0102959275],"study_design_scores_gemma":[0.00001352555,0.000005235557,0.00006472654,0.000019719688,0.0000060889124,0.000016485106,0.000018406257,0.042099733,0.00005108049,0.95681906,0.00088021497,0.0000056159524],"about_ca_topic_score_codex":0.0008735125,"about_ca_topic_score_gemma":0.0010657767,"teacher_disagreement_score":0.0135907335,"about_ca_system_score_codex":0.0013470114,"about_ca_system_score_gemma":0.00072738604,"threshold_uncertainty_score":0.04546547},"labels":[],"label_agreement":null},{"id":"W4377249550","doi":"10.1007/978-3-031-33271-5_13","title":"Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Crossover; Computer science; Vehicle routing problem; Heuristic; Local search (optimization); Greedy algorithm; Task (project management); Artificial intelligence; Machine learning; Graph; Mathematical optimization; Routing (electronic design automation); Theoretical computer science; Algorithm; Mathematics","score_opus":0.025084770520473625,"score_gpt":0.2802680108674099,"score_spread":0.25518324034693624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020199927,0.028228845,0.8765271,0.01215507,0.0016002187,0.00004919886,0.00014318948,0.0015127374,0.059583776],"genre_scores_gemma":[0.47655857,0.01685749,0.36098674,0.0028373536,0.0015961294,0.00019315719,0.0002113531,0.00090367015,0.13985562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951434,0.00021478505,0.000022730987,0.00008779994,0.00011869162,0.000041644733],"domain_scores_gemma":[0.99865377,0.00092159095,0.00004859693,0.00017856028,0.00017064471,0.000026851802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016751313,0.0005033603,0.00072495115,0.00036016453,0.0002463688,0.001639592,0.0018450245,0.002070146,0.010513945],"category_scores_gemma":[0.0066556362,0.00040424385,0.00031684776,0.0007914086,0.0010767417,0.004285218,0.0008344778,0.0023592028,0.0017580816],"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.00021327731,0.000070632595,0.0004184781,0.00034014482,0.00009688318,0.00009405028,0.00017550474,0.17635956,0.0023342057,0.28588635,0.024893476,0.5091174],"study_design_scores_gemma":[0.000034215052,0.000075952055,0.00022480813,0.00016694408,0.000036244113,0.000116096475,0.000054270393,0.78741735,0.0024278145,0.18037064,0.029038737,0.000036896596],"about_ca_topic_score_codex":0.0025661367,"about_ca_topic_score_gemma":0.0040464955,"teacher_disagreement_score":0.010513945,"about_ca_system_score_codex":0.0009248366,"about_ca_system_score_gemma":0.0003932656,"threshold_uncertainty_score":0.03517258},"labels":[],"label_agreement":null},{"id":"W4377249639","doi":"10.1007/978-3-031-33271-5_28","title":"Multi-objective Optimization for the Design of Salary Structures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Université Laval","funders":"","keywords":"Salary; Pareto principle; Equity (law); Computer science; Context (archaeology); Economic shortage; Compensation (psychology); Operations research; Industrial organization; Business; Economics; Operations management; Engineering","score_opus":0.14739507411886008,"score_gpt":0.3646013228011721,"score_spread":0.217206248682312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009106884,0.000983868,0.98099375,0.00012799387,0.000059758328,0.000110207846,0.000100470446,0.00018749062,0.008329614],"genre_scores_gemma":[0.26595196,0.0013920575,0.72059023,0.00014681683,0.000085600266,0.00066404545,0.00026169987,0.00030752667,0.010599947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994771,0.0002065676,0.00002025072,0.000063185056,0.00017459069,0.00005841428],"domain_scores_gemma":[0.99935323,0.0004269784,0.00007765398,0.0000267826,0.000078755234,0.000036528592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013531329,0.0013220651,0.0010709771,0.0009468528,0.00047842012,0.001046002,0.0011941008,0.0010849294,0.0077788793],"category_scores_gemma":[0.0024090058,0.00083089137,0.0010764648,0.0011499171,0.00040237073,0.0007981836,0.00091205485,0.0014629588,0.000974268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028912798,0.000050814633,0.00009557084,0.00012833813,0.000021341217,0.00001980101,0.000025056903,0.94896054,0.0014140278,0.0075343577,0.0010704809,0.04065077],"study_design_scores_gemma":[0.000008926226,0.000045747736,0.00007009306,0.000021208614,0.0000070501437,0.000008213216,0.0000086021255,0.99492466,0.00037694117,0.0032647077,0.0012589565,0.000004872643],"about_ca_topic_score_codex":0.0024536406,"about_ca_topic_score_gemma":0.0037189445,"teacher_disagreement_score":0.0077788793,"about_ca_system_score_codex":0.00096382335,"about_ca_system_score_gemma":0.0012921909,"threshold_uncertainty_score":0.02602297},"labels":[],"label_agreement":null},{"id":"W4377249648","doi":"10.1007/978-3-031-33271-5","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Artificial intelligence; Constraint satisfaction; Inductive programming; Operations research; Programming language; Mathematical optimization; Programming paradigm; Stochastic programming; Mathematics","score_opus":0.07773791426702394,"score_gpt":0.3449096081727305,"score_spread":0.26717169390570655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249648","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021476657,0.07079376,0.74442273,0.008787543,0.001332739,0.00015743953,0.0004516452,0.0005591855,0.17134729],"genre_scores_gemma":[0.062456664,0.09152367,0.8085194,0.0017160785,0.0026708494,0.00034763024,0.0010840221,0.00041262864,0.031268973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967722,0.00096575083,0.00024843236,0.00028540695,0.0016119336,0.00011613815],"domain_scores_gemma":[0.99230665,0.0056195427,0.00028417926,0.0006920305,0.00087889965,0.00021871638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003169376,0.0015310344,0.0022476525,0.004657145,0.00074679573,0.0064393585,0.0021311864,0.0011186971,0.013567892],"category_scores_gemma":[0.006916116,0.00090415595,0.0012118507,0.013779389,0.0030271772,0.0073853824,0.0025557738,0.0044296356,0.002484118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027789212,0.00008549613,0.00031572362,0.0009864816,0.0001180817,0.00009192766,0.00008612314,0.009484128,0.0005392431,0.61910796,0.025836674,0.34332046],"study_design_scores_gemma":[0.0000122656875,0.000028891365,0.00039606608,0.0004390646,0.000045601773,0.00015972693,0.00010412997,0.031701565,0.0005522403,0.8502392,0.116289645,0.000031637228],"about_ca_topic_score_codex":0.0050063683,"about_ca_topic_score_gemma":0.008668496,"teacher_disagreement_score":0.013567892,"about_ca_system_score_codex":0.0020479173,"about_ca_system_score_gemma":0.0043083197,"threshold_uncertainty_score":0.045389116},"labels":[],"label_agreement":null},{"id":"W4377249682","doi":"10.1007/978-3-031-33271-5_25","title":"Boolean-Arithmetic Equations: Acquisition and Uses","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Boolean function; Computer science; Boolean data type; Simple (philosophy); Commutative property; Function (biology); Arithmetic; Boolean expression; Exclusive or; Discrete mathematics; Truth table; Mathematics; Algorithm; Logic gate","score_opus":0.019081374602415373,"score_gpt":0.2610932912542653,"score_spread":0.2420119166518499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249682","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054380145,0.03811694,0.4154137,0.0063194185,0.00072473293,0.0001169257,0.0008844873,0.000949262,0.4830943],"genre_scores_gemma":[0.6078616,0.03154232,0.2501439,0.0012901624,0.0014070619,0.00016721891,0.0013309622,0.00052844797,0.1057284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994609,0.0001470577,0.000054372806,0.00013440494,0.00016596352,0.000037327496],"domain_scores_gemma":[0.9977569,0.0016070806,0.00009593576,0.00025262884,0.00024529005,0.000042181488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089132885,0.0006339732,0.0004990615,0.0014375452,0.00068967167,0.0028764713,0.0012337497,0.00070873904,0.014516712],"category_scores_gemma":[0.006447388,0.00064489373,0.00068354374,0.0017961371,0.003259974,0.008299318,0.001386089,0.00330534,0.0031620823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017909362,0.000019447622,0.000281509,0.00013496932,0.0000047218173,0.000050597566,0.000430401,0.00044924818,0.0005585226,0.8985325,0.0050729304,0.094447225],"study_design_scores_gemma":[0.000007861839,0.000009289377,0.00035664148,0.000087695065,0.00000784545,0.00023509095,0.000108551474,0.0029451533,0.00094680506,0.9579289,0.037354816,0.000011387434],"about_ca_topic_score_codex":0.00076269824,"about_ca_topic_score_gemma":0.0010608622,"teacher_disagreement_score":0.014516712,"about_ca_system_score_codex":0.0010068959,"about_ca_system_score_gemma":0.00079144136,"threshold_uncertainty_score":0.048563242},"labels":[],"label_agreement":null},{"id":"W4377249775","doi":"10.1007/978-3-031-33271-5_19","title":"Interpretable Clustering via Soft Clustering Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms 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 Toronto","funders":"","keywords":"Cluster analysis; Computer science; Interpretability; Constrained clustering; Correlation clustering; Artificial intelligence; Data mining; CURE data clustering algorithm; Fuzzy clustering; Brown clustering; Conceptual clustering; Machine learning; Consensus clustering; Partition (number theory); Pattern recognition (psychology); Mathematics","score_opus":0.025300078755108986,"score_gpt":0.2867354810263392,"score_spread":0.26143540227123024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021251624,0.00021697978,0.9933739,0.00016571463,0.000056231213,0.00002194193,0.00015630959,0.000652561,0.003231143],"genre_scores_gemma":[0.11586852,0.0007149776,0.8716701,0.00027095698,0.00019283814,0.00016610659,0.0014234976,0.0008967495,0.00879622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985275,0.0005170314,0.000100792444,0.00030253036,0.00048613356,0.00006590409],"domain_scores_gemma":[0.9968323,0.0017410546,0.00018282273,0.00076764874,0.00039961108,0.000076482705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001378679,0.00085179805,0.0009009543,0.0017681733,0.00075216463,0.0025217612,0.0016795932,0.0011159026,0.008318464],"category_scores_gemma":[0.0071922457,0.0008123353,0.001288866,0.0022457542,0.0014751619,0.0037290973,0.0029643883,0.002834754,0.0027246303],"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.00017199814,0.00004901236,0.00038246074,0.00047650674,0.000089443696,0.0002322377,0.0005959786,0.06875112,0.0071509047,0.5723922,0.01579959,0.33390853],"study_design_scores_gemma":[0.000011343442,0.000015110064,0.00016124704,0.000056518074,0.000019231766,0.00010952972,0.0000788097,0.29876444,0.002064763,0.6895245,0.009176516,0.000017999122],"about_ca_topic_score_codex":0.0008100781,"about_ca_topic_score_gemma":0.0014353209,"teacher_disagreement_score":0.008318464,"about_ca_system_score_codex":0.0008479406,"about_ca_system_score_gemma":0.00049981324,"threshold_uncertainty_score":0.027827978},"labels":[],"label_agreement":null},{"id":"W4377249777","doi":"10.1007/978-3-031-33271-5_17","title":"Scalable and Near-Optimal $$\\varepsilon $$-Tube Clusterwise Regression","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Computer science; Benchmark (surveying); Disjoint sets; Data point; Scalability; Regression; Mathematical optimization; Constraint (computer-aided design); Data mining; Algorithm; Mathematics; Machine learning; Statistics; Database; Combinatorics","score_opus":0.020123878138711162,"score_gpt":0.25060303279962626,"score_spread":0.2304791546609151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249777","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.013346061,0.00060679554,0.9698732,0.0006451145,0.0003039115,0.00010241566,0.00045735438,0.009423117,0.0052420488],"genre_scores_gemma":[0.15728582,0.0002939714,0.81067514,0.0006929447,0.00031460932,0.00037275584,0.003513922,0.002968989,0.023881754],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982768,0.00051879504,0.00006526349,0.0004713976,0.0004132863,0.0002544501],"domain_scores_gemma":[0.99708396,0.0015088294,0.000103005594,0.0006161533,0.0005343399,0.00015376006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014808895,0.0026729337,0.00306842,0.0009257614,0.0010062783,0.0018825703,0.0055167796,0.002985702,0.01855898],"category_scores_gemma":[0.0073197386,0.0012110093,0.001307652,0.0014552535,0.0013572172,0.0028023457,0.0039575137,0.0042919437,0.0109552415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001055941,0.00040754201,0.0009613838,0.00031164198,0.00016674939,0.00022754174,0.0001521204,0.3021678,0.011225312,0.031499833,0.08342254,0.56840163],"study_design_scores_gemma":[0.00002412393,0.00003162581,0.000088053705,0.000009214691,0.000008569466,0.000025336114,0.000014151558,0.99162006,0.0013470302,0.0056724697,0.001150162,0.000009204487],"about_ca_topic_score_codex":0.01059117,"about_ca_topic_score_gemma":0.020067943,"teacher_disagreement_score":0.01855898,"about_ca_system_score_codex":0.0012358109,"about_ca_system_score_gemma":0.0030947968,"threshold_uncertainty_score":0.062085986},"labels":[],"label_agreement":null},{"id":"W4377249859","doi":"10.1007/978-3-031-33271-5_6","title":"A Mixed-Integer Linear Programming Reduction of Disjoint Bilinear Programs via Symbolic Variable Elimination","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Reduction (mathematics); Bilinear interpolation; Mathematical optimization; Integer programming; Leverage (statistics); Linear programming; Variable elimination; Algorithm; Mathematics; Artificial intelligence","score_opus":0.05602265575196789,"score_gpt":0.3241523219026889,"score_spread":0.268129666150721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249859","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.022150943,0.0003372276,0.9248139,0.000531373,0.00034025352,0.00011774423,0.0002152037,0.00052205083,0.050971303],"genre_scores_gemma":[0.2860237,0.00063369615,0.66685957,0.0004312186,0.0002753307,0.0002954576,0.00064163393,0.0007837778,0.04405557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992887,0.00014359703,0.00002327073,0.00009997956,0.0003397592,0.0001047629],"domain_scores_gemma":[0.99960786,0.00017905347,0.00001938802,0.000089164736,0.00007609765,0.000028321567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000499985,0.00072522345,0.00083396706,0.0005725621,0.0008244448,0.0016160551,0.001237681,0.0003920584,0.009777614],"category_scores_gemma":[0.0014844806,0.00042112765,0.0013920659,0.000907063,0.0010274237,0.001805456,0.002910891,0.0037273336,0.002239504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014136909,0.00033465523,0.0001721682,0.00025700688,0.00005946695,0.00017352516,0.00029822532,0.035426833,0.0108780395,0.75115955,0.010972124,0.19012706],"study_design_scores_gemma":[0.00006002485,0.00011915722,0.00016202213,0.00006333978,0.000056051853,0.00021819976,0.00012778354,0.18834612,0.009827515,0.77032745,0.030661944,0.000030357676],"about_ca_topic_score_codex":0.0007105881,"about_ca_topic_score_gemma":0.0011921716,"teacher_disagreement_score":0.009777614,"about_ca_system_score_codex":0.0006333979,"about_ca_system_score_gemma":0.001022509,"threshold_uncertainty_score":0.03270936},"labels":[],"label_agreement":null},{"id":"W4377834324","doi":"10.1007/978-3-031-34017-8_2","title":"Improving Search in Go Using Bounded Static Safety","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Bounded function; Static analysis; Set (abstract data type); Greedy algorithm; Algorithm; Mathematics; Programming language","score_opus":0.06005556605165404,"score_gpt":0.3133835597321598,"score_spread":0.2533279936805058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377834324","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.1125542,0.0012306622,0.83658385,0.00089325925,0.0002558418,0.00011886793,0.00032489697,0.010367312,0.03767112],"genre_scores_gemma":[0.79149073,0.00038297297,0.19039834,0.0004405426,0.00008115393,0.00010153001,0.00060986716,0.001179902,0.01531504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988663,0.00022375384,0.000052591087,0.00017590768,0.00039147603,0.00028988282],"domain_scores_gemma":[0.99673873,0.001756937,0.00013714778,0.00091431156,0.00029700043,0.00015581498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011512904,0.0011383579,0.0012789347,0.0011471497,0.0009462084,0.0013928933,0.0024418277,0.0013685648,0.010335339],"category_scores_gemma":[0.0063314354,0.00046499938,0.0011887165,0.0011351964,0.0019567301,0.0044337823,0.004025907,0.0028321757,0.0016957216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015724124,0.00052950927,0.0023593938,0.00070463435,0.00014485685,0.00025135276,0.0005403326,0.33664164,0.027132783,0.26504815,0.014929514,0.3501454],"study_design_scores_gemma":[0.00008788061,0.00020296032,0.00031903022,0.00007280842,0.000085217835,0.00007100891,0.00011314363,0.7565279,0.0073424033,0.23060146,0.0045543103,0.000021863556],"about_ca_topic_score_codex":0.0035740954,"about_ca_topic_score_gemma":0.0055518094,"teacher_disagreement_score":0.010335339,"about_ca_system_score_codex":0.00092607236,"about_ca_system_score_gemma":0.0016144596,"threshold_uncertainty_score":0.034575105},"labels":[],"label_agreement":null},{"id":"W4377834561","doi":"10.1007/978-3-031-34017-8_3","title":"An Efficient Chinese Checkers Implementation: Ranking, Bitboards, and BMI2 pext and pdep Instructions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Northern Alberta Institute of Technology; University of Alberta","funders":"","keywords":"Computer science; Rank (graph theory); Representation (politics); Ranking (information retrieval); Function (biology); Programming language; Theoretical computer science; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.02100920896837357,"score_gpt":0.30909100984213955,"score_spread":0.288081800873766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377834561","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.019806359,0.00054150284,0.7289085,0.00071383204,0.0007408309,0.0005257427,0.0034601276,0.18373819,0.061564993],"genre_scores_gemma":[0.20826758,0.0003071861,0.6794887,0.0008863373,0.00018472492,0.0007927351,0.0064456034,0.01633276,0.08729442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842167,0.00026196527,0.00013251479,0.00025152887,0.0006018893,0.0003305011],"domain_scores_gemma":[0.99801195,0.0005521035,0.000083906554,0.00067417626,0.00056259026,0.000115195166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092472247,0.0019645465,0.0013053244,0.0017880762,0.0013971825,0.0033005914,0.004245881,0.0015852691,0.09662348],"category_scores_gemma":[0.0046817046,0.0014551565,0.0013427027,0.0029074524,0.000882804,0.0039591608,0.002641629,0.0019600387,0.02708145],"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.0014877514,0.00038040004,0.0012036889,0.00048374367,0.00008974112,0.000301903,0.00029714478,0.0058972943,0.017810274,0.07908479,0.1934218,0.6995415],"study_design_scores_gemma":[0.0013947969,0.0006229021,0.0022867424,0.00039388117,0.00037629413,0.00076762243,0.00042214026,0.31021827,0.17765944,0.14381813,0.3616297,0.0004101106],"about_ca_topic_score_codex":0.011819272,"about_ca_topic_score_gemma":0.019735426,"teacher_disagreement_score":0.09662348,"about_ca_system_score_codex":0.0018880122,"about_ca_system_score_gemma":0.0033644424,"threshold_uncertainty_score":0.32323772},"labels":[],"label_agreement":null},{"id":"W4377834584","doi":"10.1007/978-3-031-34017-8","title":"Computers and Games","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"University of Alberta","keywords":"Computer science","score_opus":0.017407201112809446,"score_gpt":0.2764311831395874,"score_spread":0.25902398202677795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377834584","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005622986,0.01456176,0.0043521505,0.0010598828,0.0010942109,0.000033900043,0.00010168059,0.00019474278,0.97803944],"genre_scores_gemma":[0.005208436,0.0062380056,0.0014158307,0.00028485912,0.000211902,0.000038846927,0.00009938696,0.00009819301,0.98640454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977154,0.000037146594,0.0000069356465,0.000038114857,0.00012226509,0.000024045823],"domain_scores_gemma":[0.99986494,0.000036251953,0.000006285656,0.000026654478,0.000035116194,0.00003060568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020023769,0.0013982814,0.00066551927,0.0014566628,0.0009991975,0.004167734,0.0006471762,0.0009765504,0.13013706],"category_scores_gemma":[0.0007518536,0.0004078211,0.000287707,0.0016898465,0.0010367018,0.0027640723,0.0016912838,0.0015927872,0.058343943],"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.000020880743,0.000050360974,0.00013092,0.00019934626,0.00000885206,0.000047886377,0.0004243164,0.0005878932,0.00054007163,0.2151018,0.45188048,0.33100724],"study_design_scores_gemma":[0.0000033753597,0.000012096,0.00019674018,0.00009281603,0.000003163041,0.00006954948,0.000110189816,0.00032645004,0.00010792415,0.03384046,0.9652336,0.000003522148],"about_ca_topic_score_codex":0.0028844266,"about_ca_topic_score_gemma":0.008515928,"teacher_disagreement_score":0.13013706,"about_ca_system_score_codex":0.0010171497,"about_ca_system_score_gemma":0.000954332,"threshold_uncertainty_score":0.43535185},"labels":[],"label_agreement":null},{"id":"W4377971906","doi":"10.1007/978-3-031-32733-9_23","title":"Overcoming Probabilistic Faults in Disoriented Linear Search","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Probabilistic logic; Computer science; Randomized algorithm; Competitive analysis; Deterministic algorithm; Path (computing); Bernoulli's principle; Constant (computer programming); Algorithm; Leverage (statistics); Mathematics; Mathematical optimization; Combinatorics; Artificial intelligence; Upper and lower bounds","score_opus":0.03432631466397401,"score_gpt":0.2869286109457508,"score_spread":0.2526022962817768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377971906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07054213,0.0018416005,0.9104122,0.00078231154,0.00024903135,0.000058781512,0.00007725763,0.003180629,0.012856046],"genre_scores_gemma":[0.7743045,0.00070092274,0.21505149,0.00031972132,0.0001385584,0.00008180733,0.00014495946,0.00051945605,0.008738753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999236,0.00021521316,0.000047321257,0.00010223458,0.00029842026,0.000100948644],"domain_scores_gemma":[0.9955413,0.0029677677,0.00029108112,0.00066040235,0.00039564914,0.00014382007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012340388,0.0005806731,0.00086128345,0.0006046218,0.00043364207,0.0011614441,0.0018200687,0.0009578682,0.003704751],"category_scores_gemma":[0.0086779175,0.00044403592,0.0003503222,0.0011202913,0.001249303,0.0028752405,0.0017853115,0.0017262857,0.00054859684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056481606,0.00007845274,0.0011094338,0.00030797702,0.000045133365,0.00016771237,0.00018346688,0.5941389,0.004425224,0.1100201,0.0056312373,0.28332758],"study_design_scores_gemma":[0.000025925483,0.000074858865,0.00015049554,0.00002014461,0.000016365224,0.000084254425,0.000033956814,0.90276724,0.001526526,0.09316217,0.0021280926,0.000009937794],"about_ca_topic_score_codex":0.0016416532,"about_ca_topic_score_gemma":0.0022202083,"teacher_disagreement_score":0.003704751,"about_ca_system_score_codex":0.00091786037,"about_ca_system_score_gemma":0.0009585356,"threshold_uncertainty_score":0.012393653},"labels":[],"label_agreement":null},{"id":"W4377971988","doi":"10.1007/978-3-031-32733-9_17","title":"Cops &amp; Robber on Periodic Temporal Graphs: Characterization and Improved Bounds","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","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":"Carleton University; University of Ottawa","funders":"","keywords":"Characterization (materials science); Combinatorics; Upper and lower bounds; Graph; Discrete mathematics; Class (philosophy); Mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.02222898925234212,"score_gpt":0.2362001053712595,"score_spread":0.21397111611891736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377971988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12107907,0.004520454,0.7071939,0.004993728,0.00060164405,0.00050621777,0.002213976,0.002407312,0.15648377],"genre_scores_gemma":[0.67556965,0.005169889,0.20310123,0.0017255757,0.0015628544,0.001020885,0.0033342072,0.0025243082,0.10599139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773407,0.0003957822,0.000093910494,0.0006489014,0.0005558209,0.00057150447],"domain_scores_gemma":[0.9847408,0.010254184,0.0012483381,0.0016377642,0.0009109068,0.0012080106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018058273,0.0022150108,0.002677697,0.0042316117,0.002649044,0.0044878223,0.0055562286,0.0023556915,0.024406416],"category_scores_gemma":[0.017261056,0.0017114638,0.002111213,0.0052938233,0.0034728732,0.013204208,0.0054281917,0.005751583,0.0028157616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050527387,0.0003189208,0.0014913173,0.00075534853,0.00011775512,0.00040706166,0.00073328486,0.12493711,0.0054933624,0.75396574,0.041622903,0.06965193],"study_design_scores_gemma":[0.000042599848,0.000089710884,0.0007724065,0.00010435884,0.00008134788,0.00029912585,0.00021942529,0.4283735,0.002619832,0.5567839,0.010564034,0.000049762486],"about_ca_topic_score_codex":0.006476624,"about_ca_topic_score_gemma":0.007846704,"teacher_disagreement_score":0.024406416,"about_ca_system_score_codex":0.0036959173,"about_ca_system_score_gemma":0.002295828,"threshold_uncertainty_score":0.081647575},"labels":[],"label_agreement":null},{"id":"W4378228547","doi":"10.1007/978-3-031-33023-0_28","title":"Game-Based Co-creation for Children and Adolescents with Complex Health Conditions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adolescent and Pediatric Healthcare","field":"Health Professions","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Convalescence; Qualitative research; Tertiary care; Health care; Computer science; Work (physics); Medical education; Medicine; Family medicine; Engineering","score_opus":0.05878947915720972,"score_gpt":0.4064630926540773,"score_spread":0.3476736134968676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378228547","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.508227,0.0059647737,0.17829071,0.006349009,0.001668351,0.0017069703,0.0011790738,0.002575419,0.29403865],"genre_scores_gemma":[0.7894484,0.0028076647,0.1294805,0.00076046615,0.00012430843,0.00177934,0.0010091676,0.00015634668,0.07443378],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9997689,0.00011040741,0.000007536577,0.000025678142,0.000042980573,0.000044427805],"domain_scores_gemma":[0.9995396,0.00025134193,0.000015522111,0.00001620108,0.000027144488,0.00015025197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004524737,0.00063321233,0.00023646271,0.0002719015,0.0004993313,0.0010304423,0.0011906242,0.00064457854,0.012291867],"category_scores_gemma":[0.0013798474,0.00013435555,0.00044825237,0.0001491846,0.00033425726,0.00055650325,0.002097536,0.0007899514,0.0013093268],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007266889,0.0060113687,0.011240675,0.0009782627,0.00015774203,0.0017914978,0.0080134645,0.011984919,0.0052404148,0.035261106,0.14735599,0.7712379],"study_design_scores_gemma":[0.0010446823,0.0042623975,0.041255966,0.0022515664,0.00030941845,0.007992453,0.023346633,0.13373867,0.008541082,0.08959726,0.6873977,0.00026217938],"about_ca_topic_score_codex":0.0018705584,"about_ca_topic_score_gemma":0.006444221,"teacher_disagreement_score":0.012291867,"about_ca_system_score_codex":0.00033655856,"about_ca_system_score_gemma":0.0006394242,"threshold_uncertainty_score":0.04112041},"labels":[],"label_agreement":null},{"id":"W4378419434","doi":"10.1007/978-3-031-33380-4_19","title":"TCR: Short Video Title Generation and Cover Selection with Attention Refinement","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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 Alberta","funders":"","keywords":"Computer science; Closed captioning; Selection (genetic algorithm); Cover (algebra); Task (project management); Popularity; Information retrieval; Focus (optics); Quality (philosophy); Multimedia; Artificial intelligence; Image (mathematics)","score_opus":0.024619940049163257,"score_gpt":0.2689565636779841,"score_spread":0.24433662362882083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419434","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.016266486,0.0016775702,0.6562995,0.000850186,0.0032561137,0.0015172126,0.02974268,0.20791353,0.082476765],"genre_scores_gemma":[0.09777057,0.0011122351,0.6600516,0.00063121814,0.0010747556,0.001234955,0.07325686,0.016371258,0.14849661],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995177,0.000047040285,0.000026626753,0.00015359037,0.00016899567,0.00008620119],"domain_scores_gemma":[0.99912363,0.0001619206,0.000035813322,0.00014516088,0.00041005487,0.00012337233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035172165,0.0020257593,0.0009959969,0.002780272,0.0006786447,0.001386295,0.0015460205,0.0011083948,0.1689541],"category_scores_gemma":[0.002165177,0.00059427967,0.0010275798,0.0018407519,0.00022695807,0.0015391917,0.0016037195,0.0008776205,0.0838853],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006018125,0.00008674198,0.00029175862,0.00031675567,0.00003216326,0.00023722296,0.00005050056,0.0016029235,0.03465245,0.0015235356,0.33759204,0.62301207],"study_design_scores_gemma":[0.00045293325,0.0005920947,0.0038886277,0.00025185934,0.00020554749,0.001048507,0.00047573674,0.24224347,0.17205523,0.01009703,0.5684967,0.00019222144],"about_ca_topic_score_codex":0.0072518536,"about_ca_topic_score_gemma":0.010774016,"teacher_disagreement_score":0.1689541,"about_ca_system_score_codex":0.00064824376,"about_ca_system_score_gemma":0.00086993707,"threshold_uncertainty_score":0.5652078},"labels":[],"label_agreement":null},{"id":"W4378419570","doi":"10.1007/978-3-031-33380-4_2","title":"Online Volume Optimization for Notifications via Long Short-Term Value Modeling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Volume (thermodynamics); Key (lock); Term (time); Task (project management); Human–computer interaction; World Wide Web; Computer security","score_opus":0.22750452627612067,"score_gpt":0.3991392087833022,"score_spread":0.17163468250718156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419570","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.008675897,0.0003918759,0.9865558,0.00037361405,0.00007758347,0.000072684685,0.00012957843,0.00038203882,0.003341003],"genre_scores_gemma":[0.6748659,0.0010783023,0.2860048,0.00039697177,0.00044626434,0.0006549703,0.0008522561,0.001154871,0.034545712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981876,0.0007167838,0.00007165511,0.00030195358,0.00036186565,0.00036015353],"domain_scores_gemma":[0.9904288,0.007860794,0.00043267073,0.0003239556,0.00059812685,0.0003555882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609524,0.0019374599,0.003772681,0.0014340961,0.0009847071,0.0036329236,0.0040986133,0.003824467,0.008419218],"category_scores_gemma":[0.014391741,0.0019932068,0.002127791,0.0021511335,0.0015841457,0.0040779714,0.002281092,0.0035887295,0.0011120966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047314206,0.0000646914,0.00014232712,0.00004979935,0.000021082975,0.000023387232,0.000027022223,0.97204673,0.00020365596,0.013860583,0.0012509102,0.012262429],"study_design_scores_gemma":[0.0000027224241,0.000005500932,0.000019322826,0.0000044170806,0.0000030963024,0.0000025021493,0.000002659955,0.9958572,0.000041596835,0.003938633,0.000119629294,0.0000026952166],"about_ca_topic_score_codex":0.014178922,"about_ca_topic_score_gemma":0.009787545,"teacher_disagreement_score":0.014178922,"about_ca_system_score_codex":0.0031932918,"about_ca_system_score_gemma":0.0031018134,"threshold_uncertainty_score":0.028192818},"labels":[],"label_agreement":null},{"id":"W4378419649","doi":"10.1007/978-3-031-33380-4_31","title":"RLMixer: A Reinforcement Learning Approach for Integrated Ranking with Contrastive User Preference Modeling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Huawei Technologies (Canada)","funders":"","keywords":"Ranking (information retrieval); Computer science; Reinforcement learning; Preference; Recommender system; Metric (unit); Artificial intelligence; Revenue; Machine learning; Preference learning; Term (time); Information retrieval","score_opus":0.047517610298298804,"score_gpt":0.24905689898413255,"score_spread":0.20153928868583376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419649","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.0020488366,0.000081906495,0.99545276,0.000044986045,0.000031466327,0.000057705744,0.000062425024,0.0016807325,0.0005391197],"genre_scores_gemma":[0.10768606,0.00012221574,0.8856477,0.00018378417,0.00007677618,0.00028579973,0.0002957064,0.0004799496,0.005222003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984768,0.00067372853,0.000066251545,0.00029195505,0.00038724428,0.000104018996],"domain_scores_gemma":[0.99786466,0.0012120007,0.00011392232,0.00034080696,0.00035315784,0.000115419854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030091156,0.0010982775,0.002043289,0.00072582805,0.00050101214,0.0012428145,0.0034440267,0.0013841816,0.0075955647],"category_scores_gemma":[0.005854438,0.00084951153,0.0010888987,0.00096338073,0.0004985387,0.001978917,0.0021525596,0.0029272148,0.0026887397],"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.00046706447,0.0006748376,0.0010670875,0.00023095141,0.00035023506,0.00010361551,0.00016631775,0.39031985,0.0067667654,0.020374475,0.012124859,0.56735384],"study_design_scores_gemma":[0.00001711891,0.000030935018,0.000050919392,0.0000036519273,0.000009967816,0.000009812821,0.0000033324159,0.9957249,0.00069051475,0.0026832584,0.0007679941,0.000007504432],"about_ca_topic_score_codex":0.0068772445,"about_ca_topic_score_gemma":0.011936098,"teacher_disagreement_score":0.0075955647,"about_ca_system_score_codex":0.0008462141,"about_ca_system_score_gemma":0.0011734767,"threshold_uncertainty_score":0.025409698},"labels":[],"label_agreement":null},{"id":"W4378419882","doi":"10.1007/978-3-031-33374-3_2","title":"Fast and Attributed Change Detection on Dynamic Graphs with Density of States","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Université de Montréal; Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Snapshot (computer storage); Scalability; Embedding; Robustness (evolution); Graph embedding; Theoretical computer science; Graph; Data mining; Algorithm; Artificial intelligence; Database","score_opus":0.015272859584902012,"score_gpt":0.2403515029826993,"score_spread":0.2250786433977973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419882","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.07977019,0.00030531088,0.91530585,0.00030326124,0.00009499736,0.00009195324,0.00058374973,0.0018565651,0.0016880827],"genre_scores_gemma":[0.742138,0.00032110646,0.24901865,0.00014182988,0.0001758136,0.00011642877,0.0014291671,0.0002792073,0.006379795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987639,0.00022414801,0.000053479194,0.0004657242,0.0003305233,0.00016228923],"domain_scores_gemma":[0.98911554,0.007972042,0.0005339255,0.0013127171,0.0007340579,0.00033174167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958692,0.0008559769,0.001543872,0.0024687804,0.0007177052,0.0016317359,0.0026564556,0.0011394188,0.0023490954],"category_scores_gemma":[0.010358821,0.0006358884,0.0008774695,0.0024922867,0.0011459138,0.0037397386,0.0026551988,0.0017989769,0.00050201005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692259,0.00034247898,0.010845809,0.00036876925,0.00023798307,0.00048371905,0.0003990401,0.45775798,0.010047302,0.05853093,0.0077250926,0.45259172],"study_design_scores_gemma":[0.0000071866443,0.000019228497,0.0005730567,0.000005008357,0.000010869956,0.000049691283,0.00003076775,0.9630236,0.0009137047,0.03499991,0.00036079178,0.0000061831806],"about_ca_topic_score_codex":0.005474506,"about_ca_topic_score_gemma":0.006764143,"teacher_disagreement_score":0.005474506,"about_ca_system_score_codex":0.0009892983,"about_ca_system_score_gemma":0.00080571,"threshold_uncertainty_score":0.010885298},"labels":[],"label_agreement":null},{"id":"W4378419993","doi":"10.1007/978-3-031-33374-3_37","title":"Disentangled Representation with Causal Constraints for Counterfactual Fairness","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Counterfactual thinking; Computer science; Autoencoder; Representation (politics); Focus (optics); Benchmark (surveying); Artificial intelligence; Machine learning; Theoretical computer science; Artificial neural network; Social psychology; Psychology","score_opus":0.061075859940599074,"score_gpt":0.3599134219523881,"score_spread":0.29883756201178907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419993","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.005271735,0.0002759606,0.97725254,0.0015093307,0.00014162059,0.00007141798,0.00014183995,0.00009234439,0.015243154],"genre_scores_gemma":[0.55185777,0.00053556834,0.43089318,0.0009594999,0.00061907124,0.00072832813,0.0004709742,0.00030526583,0.013630359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9765187,0.015791157,0.0012228042,0.0021744308,0.00346481,0.0008280996],"domain_scores_gemma":[0.9070035,0.072178386,0.002414509,0.014696054,0.0029372354,0.0007702664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02666954,0.0011666907,0.0019647707,0.0015625405,0.0017320499,0.006431435,0.004475392,0.0036268958,0.015828602],"category_scores_gemma":[0.11553462,0.0013840365,0.0025145952,0.0022021176,0.006465775,0.016140942,0.006821968,0.008774798,0.001237414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028898834,0.0000123950595,0.000059259306,0.000031337484,0.000018702476,0.00001738743,0.000099499935,0.003927229,0.00006134692,0.9884963,0.00045167742,0.006795947],"study_design_scores_gemma":[0.000006953286,0.0000033103836,0.000019313726,0.0000109146185,0.0000075575813,0.000008392232,0.000008474969,0.016909625,0.000068002926,0.98215944,0.00079307234,0.0000049381706],"about_ca_topic_score_codex":0.0022368024,"about_ca_topic_score_gemma":0.0020679475,"teacher_disagreement_score":0.02666954,"about_ca_system_score_codex":0.0027628609,"about_ca_system_score_gemma":0.003401151,"threshold_uncertainty_score":0.14104372},"labels":[],"label_agreement":null},{"id":"W4378438662","doi":"10.1007/978-3-031-33377-4_30","title":"Transfer Reinforcement Learning Based Negotiating Agent Framework","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Negotiation; Transfer of learning; Artificial intelligence; Human–computer interaction","score_opus":0.030499790075982403,"score_gpt":0.25721527224570573,"score_spread":0.22671548216972331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378438662","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.011471162,0.0002578299,0.9705706,0.000291156,0.00007774099,0.00008657495,0.000044880835,0.0005556033,0.016644465],"genre_scores_gemma":[0.6894835,0.00044090042,0.27798197,0.00016020499,0.00009072324,0.00045707042,0.00012983018,0.00012039893,0.03113542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995913,0.00016208943,0.000015985817,0.000061801766,0.00012138536,0.000047423848],"domain_scores_gemma":[0.9996662,0.00017515996,0.000022969129,0.000042460568,0.000055225017,0.00003797099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094662,0.00038711983,0.0008658775,0.00031639315,0.00059215404,0.0008717506,0.0022746366,0.001216559,0.008447879],"category_scores_gemma":[0.0012525206,0.00024433737,0.00045386943,0.0003663595,0.0008195196,0.0012071191,0.0015753597,0.0015771864,0.001241468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012737146,0.00018490512,0.00022436681,0.000095166295,0.000056593773,0.00023787432,0.00012932708,0.6253253,0.0041842274,0.27791047,0.002997436,0.08852695],"study_design_scores_gemma":[0.000016295353,0.000024598963,0.000028650287,0.0000037580458,0.0000061068426,0.00002500367,0.0000075156013,0.96824205,0.00045485827,0.029736243,0.0014486451,0.000006277831],"about_ca_topic_score_codex":0.0016089198,"about_ca_topic_score_gemma":0.0008902577,"teacher_disagreement_score":0.008447879,"about_ca_system_score_codex":0.00067747507,"about_ca_system_score_gemma":0.0009192664,"threshold_uncertainty_score":0.028261006},"labels":[],"label_agreement":null},{"id":"W4378531216","doi":"10.1007/978-3-031-33377-4_26","title":"A Dynamic and Task-Independent Reward Shaping Approach for Discrete Partially Observable Markov Decision Processes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"York University","funders":"","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Bellman equation; Graph; Dimension (graph theory); Task (project management); State space; Reinforcement learning; Observable; Function (biology); Action (physics); Markov chain; Markov process; Artificial intelligence; Domain (mathematical analysis); Markov model; Machine learning; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.045878390466429775,"score_gpt":0.27651459018373165,"score_spread":0.23063619971730187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378531216","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.0035565584,0.00025613533,0.993238,0.00017371855,0.000044611636,0.000036996444,0.00005465025,0.00016705171,0.0024722053],"genre_scores_gemma":[0.6564354,0.0013818649,0.32010427,0.00035257434,0.00032102142,0.0005028362,0.00036247456,0.00033470299,0.02020487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855644,0.00044331356,0.00006270618,0.00031159134,0.00033921603,0.0002866178],"domain_scores_gemma":[0.9964663,0.0025801419,0.00018933747,0.00020890619,0.0003546616,0.00020062628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023874545,0.0012432229,0.0024848673,0.00070587633,0.0007848305,0.0017383785,0.0036041804,0.0017689933,0.005647069],"category_scores_gemma":[0.0058946945,0.001166728,0.0015866689,0.0013210317,0.0015550221,0.0020245365,0.0031428093,0.0030855648,0.0009624807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009469167,0.000091360984,0.00019923564,0.00009693583,0.00006470227,0.00008274362,0.000115555216,0.8660319,0.0011014023,0.09382779,0.0017611239,0.036532573],"study_design_scores_gemma":[0.0000056715458,0.000014174964,0.000035274705,0.0000055270243,0.000008311056,0.000008637508,0.0000050769054,0.96813834,0.00008881576,0.031413153,0.00026979708,0.000007133774],"about_ca_topic_score_codex":0.0087953815,"about_ca_topic_score_gemma":0.008935818,"teacher_disagreement_score":0.0087953815,"about_ca_system_score_codex":0.002339923,"about_ca_system_score_gemma":0.0032787104,"threshold_uncertainty_score":0.018891335},"labels":[],"label_agreement":null},{"id":"W4378551342","doi":"10.1007/978-3-031-33620-1_8","title":"Interval Traces with Mutex Relation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"McMaster University","funders":"","keywords":"Semaphore; Computer science; Soundness; Transitive relation; Interval (graph theory); Relation (database); Petri net; Simultaneity; Deadlock; Concurrency; Theoretical computer science; Programming language; Algorithm; Mathematics; Data mining; Combinatorics","score_opus":0.02881436037752893,"score_gpt":0.2508213099587526,"score_spread":0.2220069495812237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378551342","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.061184768,0.0011531272,0.818674,0.00039848327,0.00042801944,0.00007573582,0.00038019713,0.0017972058,0.11590839],"genre_scores_gemma":[0.7881704,0.0013804596,0.1251506,0.0001794152,0.000369031,0.00016937692,0.0006841942,0.0006343338,0.083262146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.000097434495,0.00005227303,0.00015170632,0.00026169664,0.00007197399],"domain_scores_gemma":[0.99900454,0.00047402905,0.00007682501,0.00025070147,0.00012853037,0.00006547683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045164718,0.00053456315,0.0004474929,0.0010057521,0.0006841237,0.0017617741,0.00090099295,0.0006517274,0.008733401],"category_scores_gemma":[0.002559619,0.00038850176,0.0004891752,0.0014859856,0.0010147281,0.003696286,0.0015103503,0.0017060239,0.0013132636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006837277,0.000027663453,0.00018728878,0.000054425447,0.0000066854454,0.00019322014,0.00025562476,0.0032569447,0.0026484847,0.9504895,0.0011644262,0.041647416],"study_design_scores_gemma":[0.000012977839,0.00004673927,0.00018488913,0.000032922497,0.000019288926,0.00029918912,0.000102544225,0.021711646,0.0058735046,0.9525443,0.01915667,0.000015270864],"about_ca_topic_score_codex":0.0006186317,"about_ca_topic_score_gemma":0.00040758555,"teacher_disagreement_score":0.008733401,"about_ca_system_score_codex":0.000555459,"about_ca_system_score_gemma":0.00040953426,"threshold_uncertainty_score":0.02921611},"labels":[],"label_agreement":null},{"id":"W4378603520","doi":"10.1007/978-3-031-34500-5","title":"Variable Neighborhood Search","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Variable (mathematics); Variable neighborhood search; Algorithm; Metaheuristic; Mathematics","score_opus":0.0202929384344353,"score_gpt":0.2562958123320804,"score_spread":0.23600287389764507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378603520","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.01138934,0.005493708,0.84395754,0.0004884779,0.00063635083,0.000097060096,0.00062018924,0.0016083885,0.13570899],"genre_scores_gemma":[0.1863513,0.0033104867,0.5526771,0.00042816432,0.00032465399,0.00022952314,0.0026946939,0.0011214254,0.25286263],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977356,0.000043971508,0.0000072469975,0.000056526424,0.000092912785,0.000025694626],"domain_scores_gemma":[0.99981004,0.00006800739,0.0000106479,0.000048551592,0.00004756428,0.000015302314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026175947,0.00048694093,0.00086503755,0.0008247882,0.0005846254,0.00085456873,0.0009468402,0.0006114123,0.02072874],"category_scores_gemma":[0.0011013331,0.00027542273,0.00042261643,0.0014922183,0.00039272947,0.0008787045,0.0010124809,0.000939707,0.0049272426],"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.00012780441,0.00007352724,0.000358582,0.0001396761,0.00004803473,0.000051728144,0.00004741186,0.07142488,0.0025305552,0.14546427,0.0765239,0.7032097],"study_design_scores_gemma":[0.000063208,0.00014715907,0.0008287133,0.000100965735,0.00005939564,0.00037925955,0.00006594693,0.6274149,0.004480706,0.19428422,0.17214392,0.000031633837],"about_ca_topic_score_codex":0.0021153472,"about_ca_topic_score_gemma":0.0040959693,"teacher_disagreement_score":0.02072874,"about_ca_system_score_codex":0.0004675,"about_ca_system_score_gemma":0.0005592699,"threshold_uncertainty_score":0.06934452},"labels":[],"label_agreement":null},{"id":"W4378879075","doi":"10.1007/978-3-031-34034-5","title":"Unconventional Computation and Natural Computation","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Paderborn; Academia Româna; Università degli Studi di Milano-Bicocca; Università degli Studi di Verona; National Taiwan University; University of Waterloo; Yonsei University; Universiteit Leiden; Université d'Orléans; Università degli Studi di Milano; Aalto-Yliopisto; Indian Institute of Technology Madras; University of South Florida; Universiteit Utrecht; Manchester Metropolitan University; Massachusetts Institute of Technology; Turun Yliopisto; Norges Teknisk-Naturvitenskapelige Universitet; Harvard University; University of North Florida","keywords":"Computer science; Computation; Natural computing; Natural (archaeology); Computational model; Computational resource; Computational complexity theory; Artificial intelligence; Algorithm; Geology","score_opus":0.01729666621388524,"score_gpt":0.2713882029666521,"score_spread":0.25409153675276686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378879075","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013639161,0.05728907,0.07260901,0.007978412,0.0020673082,0.000029756078,0.00012410127,0.000257329,0.8460059],"genre_scores_gemma":[0.48111624,0.036953412,0.04218143,0.00196724,0.0037954487,0.00019015078,0.0003184176,0.00030994363,0.43316776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981993,0.00005875322,0.0000061813985,0.00003126511,0.00006647898,0.000017334276],"domain_scores_gemma":[0.99955076,0.00029911558,0.00001735483,0.000078370445,0.00003729093,0.000017080343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612643,0.0004114994,0.00042354243,0.0006894663,0.0009145597,0.0023338876,0.0005985721,0.0006630502,0.011524999],"category_scores_gemma":[0.0011936448,0.00024294986,0.00033142488,0.0010780586,0.0040202015,0.0044518313,0.000964877,0.0021095031,0.0016165413],"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.000003988708,0.0000033025574,0.000020827867,0.000038010734,0.0000014046045,0.000010087241,0.00006996667,0.00027611724,0.00010112521,0.98527133,0.0052068103,0.008996965],"study_design_scores_gemma":[0.0000015887987,0.0000015897427,0.000041628984,0.000016415719,0.0000010095677,0.00002804578,0.000016787564,0.00059628836,0.000056596953,0.9654159,0.033822414,0.0000016346194],"about_ca_topic_score_codex":0.00083655806,"about_ca_topic_score_gemma":0.0012870872,"teacher_disagreement_score":0.011524999,"about_ca_system_score_codex":0.0013770125,"about_ca_system_score_gemma":0.0004901425,"threshold_uncertainty_score":0.038554966},"labels":[],"label_agreement":null},{"id":"W4379118138","doi":"10.1007/978-3-031-34347-6_8","title":"A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Regina; Western University","funders":"","keywords":"Knapsack problem; Orienteering; Polynomial-time approximation scheme; Combinatorics; Vertex (graph theory); Approximation algorithm; Mathematics; Directed graph; Discrete mathematics; Time complexity; Mathematical optimization; Computer science; Graph","score_opus":0.015675612767173698,"score_gpt":0.22347397035999694,"score_spread":0.20779835759282325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379118138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077341676,0.00075576006,0.8892789,0.00068824744,0.00019151879,0.0004253685,0.002086809,0.008353089,0.02087859],"genre_scores_gemma":[0.2736352,0.0007061624,0.7048435,0.00030565492,0.00011930114,0.00030876472,0.0047715954,0.0008505765,0.014459166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985569,0.0001585441,0.0000950178,0.00037924026,0.00039943334,0.0004108382],"domain_scores_gemma":[0.9973922,0.0010329471,0.00014725744,0.0010381582,0.0002069198,0.00018250562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094928226,0.0014942938,0.0022708208,0.001417163,0.0011878941,0.0034688076,0.00453436,0.0016351934,0.013842698],"category_scores_gemma":[0.0036391304,0.00085328065,0.0019352022,0.004151498,0.0010827612,0.0056132935,0.0036782657,0.0030322904,0.0027320955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013510166,0.0006517444,0.0010684837,0.00076842983,0.00011667741,0.00020327003,0.0004752878,0.22969815,0.018582087,0.110204265,0.037169535,0.59971106],"study_design_scores_gemma":[0.00020196359,0.00015362793,0.0003808568,0.000056377612,0.00008029696,0.0001633238,0.00018462428,0.8663737,0.006502966,0.11583034,0.010030686,0.000041225194],"about_ca_topic_score_codex":0.011540708,"about_ca_topic_score_gemma":0.013659335,"teacher_disagreement_score":0.013842698,"about_ca_system_score_codex":0.0033552453,"about_ca_system_score_gemma":0.0026651982,"threshold_uncertainty_score":0.046308458},"labels":[],"label_agreement":null},{"id":"W4379279963","doi":"10.1007/978-3-031-34344-5_44","title":"Decentralized Web-Based Clinical Decision Support Using Semantic GLEAN Workflows","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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":"Dalhousie University; University of Ottawa","funders":"","keywords":"Computer science; Workflow; World Wide Web; Clinical decision support system; Semantic Web; Point of care; Decision support system; Database; Data mining","score_opus":0.11950280203105434,"score_gpt":0.4557204236021348,"score_spread":0.3362176215710805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379279963","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.018019319,0.00037971744,0.95403856,0.0010963007,0.00012574981,0.00034802387,0.0009675856,0.017407501,0.007617244],"genre_scores_gemma":[0.41931203,0.00049611914,0.5671452,0.00062373444,0.00013300542,0.0002618866,0.004577697,0.0009902252,0.0064600115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973212,0.00082605274,0.0003492541,0.0005206924,0.0007327703,0.00025007143],"domain_scores_gemma":[0.9945627,0.002195354,0.00029936276,0.0018626587,0.00064869947,0.00043133282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051002637,0.00063828804,0.0012853121,0.0024656798,0.0011577962,0.00515364,0.0023773748,0.001277932,0.0050431765],"category_scores_gemma":[0.00668703,0.00079921266,0.0012606736,0.002827661,0.0009404253,0.0039171968,0.005116313,0.0017299332,0.0022699751],"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.002134387,0.0015443934,0.0056385472,0.0005326582,0.0005800133,0.0014607288,0.0013186767,0.14938924,0.021509986,0.12074447,0.040660184,0.6544867],"study_design_scores_gemma":[0.00025106408,0.00009262701,0.00094437116,0.00009643192,0.00010873601,0.00028083488,0.00024458414,0.8080136,0.010110562,0.15037934,0.029397571,0.000080336256],"about_ca_topic_score_codex":0.0054914122,"about_ca_topic_score_gemma":0.007951844,"teacher_disagreement_score":0.0054914122,"about_ca_system_score_codex":0.0011061254,"about_ca_system_score_gemma":0.003376237,"threshold_uncertainty_score":0.026973128},"labels":[],"label_agreement":null},{"id":"W4379280006","doi":"10.1007/978-3-031-34612-5_8","title":"A Novel GIS-Based Machine Learning Approach for the Classification of Multi-motorized Transportation Modes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Greenhouse gas; Geospatial analysis; Computer science; Transport engineering; Intelligent transportation system; Multimodality; Engineering; Remote sensing; Geography","score_opus":0.06747158521973849,"score_gpt":0.3089920569354032,"score_spread":0.2415204717156647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379280006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04286222,0.00086750276,0.9446458,0.0003928855,0.0002914612,0.00015524124,0.0018374913,0.004271603,0.004675787],"genre_scores_gemma":[0.32278705,0.00067037775,0.6575125,0.0003010647,0.0002731382,0.00040658348,0.0051000034,0.00018110161,0.012768292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.000058669688,0.000027806813,0.00015139619,0.00013848767,0.000052598993],"domain_scores_gemma":[0.99953675,0.00017188075,0.000028701726,0.00004155038,0.00019225421,0.000028896124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005832827,0.0012734788,0.0010775591,0.002917303,0.0005447294,0.0014024837,0.0017679493,0.0012532383,0.004223053],"category_scores_gemma":[0.0009592752,0.0003331158,0.0012442239,0.003251907,0.00033232977,0.0012308324,0.001003489,0.00091235194,0.00270988],"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.00020887058,0.0004298009,0.010251403,0.00014974702,0.00024192261,0.00027212413,0.00012515794,0.04997829,0.014235691,0.003388843,0.011501338,0.9092168],"study_design_scores_gemma":[0.000013888906,0.00008500744,0.004031583,0.00001954815,0.000050281207,0.0001689002,0.00014186313,0.9815654,0.0038881833,0.004626791,0.005382613,0.000025988706],"about_ca_topic_score_codex":0.007890275,"about_ca_topic_score_gemma":0.009784157,"teacher_disagreement_score":0.007890275,"about_ca_system_score_codex":0.00058516226,"about_ca_system_score_gemma":0.0008747631,"threshold_uncertainty_score":0.015688717},"labels":[],"label_agreement":null},{"id":"W4379280017","doi":"10.1007/978-3-031-34344-5_15","title":"Batch Integrated Gradients: Explanations for Temporal Electronic Health Records","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Université Laval","funders":"","keywords":"Computer science; Leverage (statistics); Usability; Sequence (biology); Temporal database; Point (geometry); Electronic health record; Health records; Data mining; Artificial intelligence; Information retrieval; Human–computer interaction; Mathematics","score_opus":0.02986729053671333,"score_gpt":0.30925720208059404,"score_spread":0.2793899115438807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379280017","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.01217534,0.0006205119,0.9752863,0.002134864,0.00021167497,0.00008868318,0.0021896067,0.0037618906,0.0035311661],"genre_scores_gemma":[0.3860213,0.0008053452,0.5995567,0.00040877747,0.0002655905,0.00019461718,0.0031881467,0.000659785,0.00889974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994479,0.0002570869,0.000043097934,0.00008682416,0.00013481655,0.000030235917],"domain_scores_gemma":[0.9933082,0.005369406,0.00028035807,0.00038011206,0.0005468449,0.00011506311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015683419,0.00066798605,0.00029202612,0.0007031725,0.0003284521,0.0010504839,0.001463324,0.0012048446,0.011437393],"category_scores_gemma":[0.016895149,0.0003359133,0.00044785687,0.0006296881,0.0004171016,0.0023384097,0.00092840387,0.0013104678,0.0012219545],"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.00096338545,0.00015482733,0.008755297,0.0006277932,0.0001191903,0.0011281,0.001425196,0.12940785,0.0033084243,0.27971634,0.1009288,0.47346476],"study_design_scores_gemma":[0.00005828412,0.0000318117,0.0009782024,0.000104426486,0.000033312634,0.00014767027,0.00013068483,0.79730177,0.002044793,0.18183552,0.017307246,0.000026257785],"about_ca_topic_score_codex":0.0070693325,"about_ca_topic_score_gemma":0.009479935,"teacher_disagreement_score":0.011437393,"about_ca_system_score_codex":0.0007487522,"about_ca_system_score_gemma":0.0008290831,"threshold_uncertainty_score":0.03826189},"labels":[],"label_agreement":null},{"id":"W4379280031","doi":"10.1007/978-3-031-34344-5_21","title":"BERT for Complex Systematic Review Screening to Support the Future of Medical Research","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Computer science; Workflow; Task (project management); Systematic review; Encoder; Data science; Transformer; Artificial intelligence; Data mining; Machine learning; Information retrieval; Database; MEDLINE","score_opus":0.13582562624998598,"score_gpt":0.3828264763855156,"score_spread":0.2470008501355296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379280031","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014675414,0.1477541,0.19789147,0.5356375,0.032954235,0.0043233065,0.013734608,0.007491906,0.05874536],"genre_scores_gemma":[0.044964608,0.08813015,0.6540045,0.12614799,0.029376445,0.007624656,0.009515191,0.0025328437,0.037703592],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9182888,0.05895473,0.009940826,0.0026868118,0.009528996,0.00059976784],"domain_scores_gemma":[0.4938555,0.40476102,0.02309066,0.024409166,0.046017706,0.007865977],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.11902428,0.001945192,0.0035802224,0.010839089,0.001160161,0.009309481,0.002852625,0.0061426433,0.066525795],"category_scores_gemma":[0.424285,0.0018151115,0.005271351,0.007088386,0.0017034238,0.013867978,0.005214955,0.0063386993,0.01945984],"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.0004473429,0.000049363698,0.00093008525,0.020001726,0.0019263104,0.00019650275,0.0002807888,0.0013064869,0.0004221232,0.08484508,0.58169156,0.30790263],"study_design_scores_gemma":[0.00058830425,0.00025467042,0.0016697395,0.035422616,0.0026900135,0.00048305627,0.00019884612,0.008968947,0.0005264174,0.41053462,0.5384411,0.00022159165],"about_ca_topic_score_codex":0.0025944565,"about_ca_topic_score_gemma":0.0077354545,"teacher_disagreement_score":0.8809757,"about_ca_system_score_codex":0.0037317222,"about_ca_system_score_gemma":0.018961636,"threshold_uncertainty_score":0.6294681},"labels":[],"label_agreement":null},{"id":"W4379280048","doi":"10.1007/978-3-031-34612-5","title":"Web and Wireless Geographical Information Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile and Web Applications","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":"Université Laval","funders":"","keywords":"Computer science; Wireless; Web application; World Wide Web; Information retrieval; Telecommunications","score_opus":0.008513330758374342,"score_gpt":0.22604446427724467,"score_spread":0.21753113351887032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379280048","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006829674,0.099840745,0.10341169,0.0048892586,0.0034903737,0.00006620625,0.0006980984,0.0011976605,0.7795762],"genre_scores_gemma":[0.09011154,0.11271698,0.025977286,0.0009816448,0.003105746,0.000093217255,0.0011348706,0.0004284997,0.7654503],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99987054,0.000029811623,0.0000052374967,0.000014975508,0.00006763403,0.000011845089],"domain_scores_gemma":[0.9998385,0.00007933032,0.000011090439,0.000027987977,0.00003091134,0.0000122257825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014833763,0.0005345856,0.00040026923,0.0013084612,0.00028343603,0.0021153993,0.00038725455,0.0006118267,0.033992987],"category_scores_gemma":[0.0005402453,0.00020955515,0.00020328621,0.0040137307,0.0005015798,0.0028952125,0.00070553774,0.0007090332,0.0112152975],"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.000030141104,0.000034981404,0.0003984829,0.00039813726,0.000027580854,0.0001891553,0.0001980626,0.005921175,0.0017276852,0.3318817,0.19899541,0.4601975],"study_design_scores_gemma":[0.000005663323,0.000019750942,0.0006118633,0.00012264382,0.00001794857,0.00032587827,0.00013558859,0.0057515725,0.00045005052,0.10767693,0.88487214,0.00001013116],"about_ca_topic_score_codex":0.0020252264,"about_ca_topic_score_gemma":0.0023147087,"teacher_disagreement_score":0.033992987,"about_ca_system_score_codex":0.00054217334,"about_ca_system_score_gemma":0.00028824483,"threshold_uncertainty_score":0.113717854},"labels":[],"label_agreement":null},{"id":"W4379280077","doi":"10.1007/978-3-031-34612-5_5","title":"A New Approach for Accessibility Assessment of Sidewalks for Wheelchair Users Considering the Sidewalk Traffic","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Transport and Accessibility","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Crowds; Wheelchair; Computer science; Mobility model; Transport engineering; Population; Personal mobility; Affect (linguistics); Human–computer interaction; Computer security; World Wide Web; Psychology; Engineering; Telecommunications","score_opus":0.06156738661054496,"score_gpt":0.33964101914783573,"score_spread":0.2780736325372908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379280077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07323473,0.000427449,0.9007447,0.00015093121,0.00012240559,0.00034381167,0.0005734262,0.000681282,0.02372137],"genre_scores_gemma":[0.5391676,0.00062692026,0.4436701,0.00008967826,0.00006888202,0.00057596824,0.0009227113,0.00008578673,0.014792334],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99928623,0.00015030401,0.00004050941,0.00018241731,0.0002931348,0.000047361562],"domain_scores_gemma":[0.99938715,0.00017236464,0.00003347016,0.000026874648,0.00034766458,0.000032426535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053552294,0.00090005173,0.00059511856,0.002502063,0.00055709603,0.0014743396,0.0008042331,0.0007305782,0.004190446],"category_scores_gemma":[0.0013047651,0.00026218308,0.00089091616,0.0013388869,0.0003372631,0.0013418909,0.0011418985,0.0004390937,0.0007676131],"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.0003577446,0.00059911347,0.03756195,0.00078367675,0.00031615398,0.0006122691,0.0021827235,0.048833955,0.052377433,0.02323978,0.0072466335,0.8258886],"study_design_scores_gemma":[0.000048522816,0.0009369869,0.055007692,0.00026130117,0.0006407031,0.00133871,0.004624332,0.8528521,0.021940593,0.03423093,0.027921803,0.00019638121],"about_ca_topic_score_codex":0.008031299,"about_ca_topic_score_gemma":0.009966039,"teacher_disagreement_score":0.008031299,"about_ca_system_score_codex":0.00066409085,"about_ca_system_score_gemma":0.0012523255,"threshold_uncertainty_score":0.015969098},"labels":[],"label_agreement":null},{"id":"W4379352312","doi":"10.1007/978-3-031-34344-5","title":"Artificial Intelligence in Medicine","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":6,"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":"Universidad Nacional de Educación a Distancia; Vrije Universiteit Amsterdam; Universidade da Coruña; Haute école Spécialisée de Suisse Occidentale; Univerza v Mariboru; University of Cyprus; Univerza v Ljubljani; Université Paris-Saclay; Trakya Üniversitesi; Berner Fachhochschule; Stockholms Universitet; Universidade do Porto; Università degli Studi di Verona; Universität Zürich; Université de Bordeaux; Université Charles-de-Gaulle - Lille 3; Universidade de Coimbra; Uniwersytet Łódzki; Università degli Studi di Pavia; Ben-Gurion University of the Negev; Umeå Universitet; Zhejiang University; Université Paris 13; Centre National de la Recherche Scientifique; Politechnika Warszawska; Dalhousie University; College of Engineering, Michigan State University; Università degli Studi di Padova; Kungliga Tekniska Högskolan; Universiteit van Amsterdam; Universiteit Leiden; University of Southern California; University of Aberdeen; Politechnika Poznańska; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Haifa; Norges Teknisk-Naturvitenskapelige Universitet; Universitat de Girona; University of Pittsburgh; Emory University; Michigan State University; University of Pennsylvania; Arizona State University; Leibniz-Gemeinschaft; Florida State University; Universidad de Murcia; Universidad Politécnica de Madrid","keywords":"Computer science; Artificial intelligence; Data science","score_opus":0.045712287816042474,"score_gpt":0.3387633634378838,"score_spread":0.29305107562184135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379352312","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047942775,0.20955195,0.015534208,0.015611455,0.013811513,0.00010103642,0.00023014838,0.00040510326,0.7442752],"genre_scores_gemma":[0.005174665,0.08531162,0.0070541743,0.0068892273,0.0072450065,0.00013029331,0.00024470687,0.00021875779,0.8877315],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952805,0.00010140053,0.000018930648,0.00005795348,0.0002665367,0.0000271644],"domain_scores_gemma":[0.9993499,0.00028967374,0.000037963964,0.000088747714,0.00012257164,0.00011111464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000877927,0.0014193908,0.0011866846,0.0023571118,0.00085972267,0.0034900664,0.0006879098,0.0014714194,0.07047243],"category_scores_gemma":[0.0016612975,0.00052278314,0.00043621918,0.0020332779,0.0018225315,0.0034468754,0.002251934,0.0038690567,0.052203696],"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.000017445464,0.000039453982,0.00009496162,0.000387475,0.000017968749,0.000041367493,0.00019725147,0.00037883755,0.000474599,0.07995458,0.6509555,0.26744053],"study_design_scores_gemma":[0.000005627549,0.000016823491,0.0002558659,0.00034648261,0.0000068299514,0.00011532361,0.000046207795,0.0002561066,0.00009554948,0.03958784,0.95926213,0.000005105445],"about_ca_topic_score_codex":0.0008343037,"about_ca_topic_score_gemma":0.0029137004,"teacher_disagreement_score":0.07047243,"about_ca_system_score_codex":0.001131916,"about_ca_system_score_gemma":0.0013666371,"threshold_uncertainty_score":0.23575372},"labels":[],"label_agreement":null},{"id":"W4379352395","doi":"10.1007/978-3-031-34612-5_4","title":"Investigating the Navigational Behavior of Wheelchair Users in Urban Environments Using Eye Movement Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","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":"Centre for Interdisciplinary Research in Rehabilitation; Université Laval","funders":"","keywords":"Computer science; Eye tracking; Eye movement; Human–computer interaction; Wheelchair; Task (project management); Fixation (population genetics); Phone; Population; Artificial intelligence; World Wide Web; Engineering","score_opus":0.05631291131843633,"score_gpt":0.2879213472531452,"score_spread":0.2316084359347089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379352395","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.9988912,0.0000580584,0.00045054042,0.000008667146,0.0000015744266,0.0000059282625,0.0001961019,0.000017558816,0.0003704094],"genre_scores_gemma":[0.9980292,0.000107644395,0.0008802482,0.000008011618,0.000001974899,0.000009993752,0.00027177043,0.000005903735,0.0006851775],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9999361,0.000016591666,0.0000048235856,0.000016309623,0.000012532028,0.000013657697],"domain_scores_gemma":[0.9997936,0.00008410646,0.00003090506,0.0000107892665,0.000055248493,0.000025310408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010214944,0.00020759313,0.00017395003,0.00047172754,0.0001904393,0.0003212919,0.00013007932,0.00022361967,0.0011174078],"category_scores_gemma":[0.00072692067,0.000095420546,0.000119297416,0.00053254113,0.000071475086,0.00024377032,0.00019980132,0.00013257451,0.0003658145],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013306169,0.00040678974,0.7902739,0.0002547716,0.00020579035,0.00051064923,0.0057723974,0.001429234,0.08765808,0.00015227536,0.0011037516,0.110901766],"study_design_scores_gemma":[0.000010792406,0.00038266616,0.9885605,0.000018335562,0.000054942488,0.00028219642,0.0027002448,0.0033973872,0.0038980776,0.00007239942,0.00060422445,0.000018280773],"about_ca_topic_score_codex":0.014615869,"about_ca_topic_score_gemma":0.027482701,"teacher_disagreement_score":0.014615869,"about_ca_system_score_codex":0.0001075748,"about_ca_system_score_gemma":0.0001606086,"threshold_uncertainty_score":0.029061556},"labels":[],"label_agreement":null},{"id":"W4379352774","doi":"10.1007/978-3-031-34612-5_10","title":"A Novel Feature Matching Method for Matching OpenStreetMap Buildings with Those of Reference Dataset","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geographic Information Systems Studies","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":"Université Laval","funders":"","keywords":"Polygon (computer graphics); Matching (statistics); Computer science; Centroid; Similarity (geometry); Intersection (aeronautics); Feature (linguistics); Position (finance); Pattern recognition (psychology); Polygon mesh; Blossom algorithm; Feature matching; Artificial intelligence; Data mining; Algorithm; Feature extraction; Mathematics; Image (mathematics); Cartography; Geography; Statistics; Frame (networking)","score_opus":0.05616923185155876,"score_gpt":0.3420109419931966,"score_spread":0.28584171014163784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379352774","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.028654618,0.0010612748,0.9283263,0.00018078485,0.00051278237,0.00056989025,0.008208239,0.028618876,0.00386722],"genre_scores_gemma":[0.08999808,0.00049437565,0.8728236,0.0001457998,0.00013827988,0.0004255508,0.028516108,0.0011819694,0.0062762643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787855,0.000086032414,0.00012878898,0.00073083665,0.0009572144,0.00021848506],"domain_scores_gemma":[0.99918085,0.000064628766,0.00006289691,0.00027143248,0.0003722764,0.000047959227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931552,0.0014414376,0.0017495047,0.0068413215,0.0011270774,0.001827836,0.0031470202,0.0015981878,0.0070290174],"category_scores_gemma":[0.0021996705,0.0006284884,0.0019582477,0.008569999,0.00048561502,0.0023191464,0.002576907,0.0011527801,0.00811743],"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.00030099077,0.00024379953,0.0031896632,0.00033666575,0.00021873314,0.00022858482,0.0001362283,0.0047804355,0.05882532,0.0025972913,0.04776237,0.88137996],"study_design_scores_gemma":[0.00018441705,0.00039535292,0.020204354,0.00011303311,0.0003457492,0.002756227,0.0008126447,0.7101415,0.1257255,0.012339453,0.12671958,0.0002622675],"about_ca_topic_score_codex":0.012781214,"about_ca_topic_score_gemma":0.021526251,"teacher_disagreement_score":0.012781214,"about_ca_system_score_codex":0.00061338855,"about_ca_system_score_gemma":0.0017139325,"threshold_uncertainty_score":0.025413632},"labels":[],"label_agreement":null},{"id":"W4379352850","doi":"10.1007/978-3-031-34612-5_2","title":"Towards Integration of Spatial Context in Building Energy Demand Assessment Supported by CityGML Energy Extension","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Modeling in Geospatial Applications","field":"Engineering","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":"McGill University; Université Laval","funders":"","keywords":"CityGML; Computer science; Workflow; Energy consumption; Software deployment; Wireless sensor network; Context (archaeology); Distributed computing; Real-time computing; Data mining; Database; Visualization; Computer network; Software engineering","score_opus":0.01585701792542811,"score_gpt":0.2508530144132535,"score_spread":0.23499599648782538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379352850","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.2757311,0.0007851536,0.68682426,0.00028811593,0.00007585684,0.00017081255,0.0033186383,0.0052880733,0.027517943],"genre_scores_gemma":[0.6944226,0.00034232636,0.29891497,0.000053608026,0.000021481987,0.00008621491,0.0030735333,0.00027498725,0.0028102004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995902,0.0000988263,0.000027522012,0.00007613179,0.0001708435,0.000036478516],"domain_scores_gemma":[0.99962914,0.000102638,0.00003723227,0.00007361479,0.00013679071,0.000020591086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062750076,0.0005304013,0.00043591368,0.0013838644,0.00024485184,0.0017929913,0.00053827337,0.00041934816,0.002173248],"category_scores_gemma":[0.0013455668,0.00034387602,0.0005642742,0.001459859,0.00017453951,0.0015572077,0.0017592484,0.00039726932,0.000994421],"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.00037566343,0.00038166463,0.05975836,0.00057026965,0.00023239022,0.0004716308,0.0010441158,0.21425447,0.049497347,0.01800531,0.005589658,0.6498192],"study_design_scores_gemma":[0.000021203414,0.000062631196,0.020335212,0.000111358466,0.00009566835,0.00012528252,0.0007247886,0.926812,0.016798407,0.009315313,0.025552742,0.0000454096],"about_ca_topic_score_codex":0.008172307,"about_ca_topic_score_gemma":0.020148337,"teacher_disagreement_score":0.008172307,"about_ca_system_score_codex":0.00038873404,"about_ca_system_score_gemma":0.00061080477,"threshold_uncertainty_score":0.016249478},"labels":[],"label_agreement":null},{"id":"W4379660281","doi":"10.1007/978-3-031-34048-2_55","title":"Mixup-Privacy: A Simple yet Effective Approach for Privacy-Preserving Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Université de Sherbrooke; École de Technologie Supérieure","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Image segmentation; Computer vision; Overhead (engineering); Scale-space segmentation; Segmentation-based object categorization; Pattern recognition (psychology)","score_opus":0.03011319231438692,"score_gpt":0.2927729024916699,"score_spread":0.26265971017728296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379660281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038087016,0.00019551592,0.9906188,0.00035839205,0.00007879438,0.00008299266,0.00019205052,0.0018008362,0.0028639173],"genre_scores_gemma":[0.23537606,0.00057875575,0.7457673,0.00095551915,0.00028661062,0.0003251801,0.0009559416,0.0014549092,0.014299747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99512166,0.0012362415,0.00027410284,0.0010072363,0.0018042622,0.00055645936],"domain_scores_gemma":[0.9943328,0.0016220382,0.00020039461,0.0032282255,0.00042519005,0.00019133242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003567226,0.0013714168,0.0020833605,0.0012108382,0.0019436484,0.005032041,0.004416227,0.0035166799,0.009796482],"category_scores_gemma":[0.009330275,0.0012425001,0.002044996,0.0021994358,0.0030058615,0.010080376,0.012400229,0.0055757626,0.003281208],"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.0012616278,0.0002777363,0.00085419597,0.00039681242,0.0002027429,0.00047166098,0.0006330199,0.058302958,0.036618453,0.41852427,0.026101466,0.45635504],"study_design_scores_gemma":[0.00007137602,0.00015523178,0.00023565377,0.000050359053,0.000078095734,0.00060776464,0.00015923826,0.4061618,0.050875906,0.51574737,0.025781248,0.000075941345],"about_ca_topic_score_codex":0.0008073882,"about_ca_topic_score_gemma":0.0010849905,"teacher_disagreement_score":0.009796482,"about_ca_system_score_codex":0.0015598305,"about_ca_system_score_gemma":0.0023552242,"threshold_uncertainty_score":0.03277248},"labels":[],"label_agreement":null},{"id":"W4379660313","doi":"10.1007/978-3-031-34048-2_30","title":"SADM: Sequence-Aware Diffusion Model for Longitudinal Medical Image Generation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Sequence (biology); Artificial intelligence; Autoregressive model; Inference; Image (mathematics); Algorithm; Computer vision; Data mining; Mathematics","score_opus":0.06108082821458336,"score_gpt":0.2881049663729653,"score_spread":0.22702413815838193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379660313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017633493,0.00017816194,0.9962702,0.00012374978,0.00004409998,0.000028757388,0.00019015187,0.001131731,0.00026980785],"genre_scores_gemma":[0.16947287,0.0006511254,0.8182649,0.0004144117,0.00013929934,0.00033404035,0.0015813862,0.0007396803,0.00840226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997936,0.000054147964,0.000009618986,0.000059968526,0.00006393883,0.000018791043],"domain_scores_gemma":[0.99949515,0.00028920433,0.00003565954,0.000056312652,0.00009246921,0.000031226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081820996,0.0006658454,0.00075865776,0.00047858825,0.00023835938,0.00055560225,0.001392445,0.0012535033,0.0039360444],"category_scores_gemma":[0.0022472527,0.00060951756,0.000853479,0.0004440725,0.00032000832,0.0006564798,0.0012236487,0.0016622039,0.0016009643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031311932,0.00009426457,0.00071780273,0.00015378988,0.00012082393,0.00014241086,0.00006792277,0.6025286,0.01731278,0.015338415,0.014935755,0.3482743],"study_design_scores_gemma":[0.000006350895,0.000010684771,0.000053941698,0.000003451154,0.000003473074,0.000029209326,0.0000015049121,0.9953099,0.001273519,0.002476434,0.00082722836,0.0000043939626],"about_ca_topic_score_codex":0.00373539,"about_ca_topic_score_gemma":0.0053050416,"teacher_disagreement_score":0.0039360444,"about_ca_system_score_codex":0.00064842857,"about_ca_system_score_gemma":0.00073218864,"threshold_uncertainty_score":0.013167381},"labels":[],"label_agreement":null},{"id":"W4379660374","doi":"10.1007/978-3-031-34048-2_27","title":"Harmonizing Flows: Unsupervised MR Harmonization Based on Normalizing Flows","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fetal and Pediatric Neurological Disorders","field":"Medicine","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":"Centre Hospitalier Universitaire Sainte-Justine; Canadian Apheresis Group; Université de Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Domain (mathematical analysis); Segmentation; Code (set theory); Source code; Artificial intelligence; Task (project management); Pattern recognition (psychology); Data mining; Image (mathematics); Programming language; Mathematics","score_opus":0.04431062258268287,"score_gpt":0.24962723368846276,"score_spread":0.2053166111057799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379660374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032025173,0.00017436285,0.9931914,0.000062975334,0.000071941016,0.00005213942,0.00009676115,0.0019496117,0.0011983025],"genre_scores_gemma":[0.053396575,0.00046097522,0.9378777,0.00017387657,0.00015743595,0.00013030878,0.0007396904,0.0017797959,0.0052835774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994573,0.000111399815,0.000035612484,0.00018383372,0.00014143091,0.0000703709],"domain_scores_gemma":[0.99931145,0.00020085995,0.000071667266,0.00018630178,0.00018466677,0.000045088385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015300462,0.0013057814,0.0011455374,0.0018438358,0.00070721185,0.0019072935,0.0020350486,0.0012447265,0.0068198587],"category_scores_gemma":[0.00234785,0.0008443338,0.0012862105,0.0018274984,0.0009120974,0.0019541003,0.0021773726,0.0016055409,0.0028267484],"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.0003176982,0.0001062888,0.0005103806,0.0001511092,0.00010245546,0.00012160182,0.0002071142,0.054938164,0.033617876,0.014296628,0.010824235,0.8848064],"study_design_scores_gemma":[0.000049647413,0.00018207195,0.0008941662,0.000060433835,0.000096312426,0.00058712484,0.00014239825,0.89672446,0.047044426,0.029664742,0.024480794,0.000073359704],"about_ca_topic_score_codex":0.0020170931,"about_ca_topic_score_gemma":0.0024775441,"teacher_disagreement_score":0.0068198587,"about_ca_system_score_codex":0.00040326256,"about_ca_system_score_gemma":0.0010861891,"threshold_uncertainty_score":0.022814631},"labels":[],"label_agreement":null},{"id":"W4379767400","doi":"10.1007/978-3-031-34048-2_13","title":"On Fairness of Medical Image Classification with Multiple Sensitive Attributes via Learning Orthogonal Representations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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 British Columbia","funders":"","keywords":"Orthogonality; Computer science; Representation (politics); Orthogonal complement; Space (punctuation); Artificial intelligence; Complement (music); Field (mathematics); Code (set theory); Independence (probability theory); Feature (linguistics); Feature learning; Machine learning; Feature vector; Rank (graph theory); Pattern recognition (psychology); Image (mathematics); Contextual image classification; Focus (optics); Mathematics","score_opus":0.10989357789295784,"score_gpt":0.3893378997809668,"score_spread":0.27944432188800894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379767400","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.029203035,0.0006104417,0.9650702,0.0015951036,0.00014081674,0.00008800715,0.0001175267,0.00014238944,0.0030323782],"genre_scores_gemma":[0.72108406,0.00087413436,0.26515538,0.00090495654,0.0009053833,0.00026956116,0.00036796206,0.00030332996,0.010135274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.978626,0.012761192,0.0008250599,0.0028760517,0.0035969631,0.0013146659],"domain_scores_gemma":[0.8957038,0.083936036,0.00353662,0.010199225,0.004656347,0.00196802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03167967,0.0012348102,0.004042364,0.0018234095,0.0017920671,0.004148077,0.0048500565,0.0029760965,0.004161088],"category_scores_gemma":[0.087673694,0.00097264635,0.0015949263,0.0023641628,0.007616083,0.009962525,0.009050888,0.005265371,0.0005024296],"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.0012755138,0.00021077425,0.0034018517,0.00021029096,0.00016044342,0.00013278793,0.00041839344,0.19309597,0.0018616033,0.68579894,0.0053358926,0.1080976],"study_design_scores_gemma":[0.0000302114,0.0000624784,0.00035453148,0.000026849622,0.00002284185,0.000044765315,0.00003799643,0.540865,0.0006466876,0.45729107,0.00059875764,0.000018889807],"about_ca_topic_score_codex":0.0036423458,"about_ca_topic_score_gemma":0.0019970187,"teacher_disagreement_score":0.03167967,"about_ca_system_score_codex":0.0046124216,"about_ca_system_score_gemma":0.0035432123,"threshold_uncertainty_score":0.16754013},"labels":[],"label_agreement":null},{"id":"W4379803911","doi":"10.1007/978-3-031-33783-3_29","title":"Machine-Learning Based Estimation of the Bending Magnitude Sensed by a Fiber Optic Device","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Fiber Optic Sensors","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":"Université Laval","funders":"","keywords":"Computer science; Bending; Random forest; Accelerometer; Artificial intelligence; Multi-mode optical fiber; Support vector machine; Optical fiber; Fiber optic sensor; Feature vector; Feature (linguistics); Machine learning; Algorithm; Pattern recognition (psychology); Telecommunications; Engineering; Structural engineering","score_opus":0.011798846251964442,"score_gpt":0.22760336461026684,"score_spread":0.2158045183583024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379803911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2617405,0.0008242588,0.73129237,0.00019192196,0.00015117637,0.000056276527,0.00023907615,0.0012696325,0.00423485],"genre_scores_gemma":[0.91065574,0.00031637994,0.08522927,0.000060214887,0.000047194877,0.000030974366,0.00021217644,0.000026242566,0.0034218847],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990606,0.000011796908,0.0000040097248,0.000031557673,0.000037576083,0.000008948344],"domain_scores_gemma":[0.9998667,0.000065607564,0.000022198805,0.000010027776,0.000029928988,0.000005513002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015815909,0.00039339458,0.00033086893,0.0003205711,0.00013912133,0.0003276521,0.00038346738,0.00055379147,0.001081702],"category_scores_gemma":[0.00047274493,0.00016954569,0.00024853062,0.0002851118,0.00017515438,0.00034079628,0.00017442387,0.00036898357,0.00053101394],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042351606,0.00024308078,0.0059007853,0.00020234662,0.00007275744,0.00012919023,0.0000559058,0.15237999,0.37115356,0.0010724735,0.0014691242,0.46689722],"study_design_scores_gemma":[0.0000059633676,0.00010898125,0.008082827,0.000015263702,0.000013199043,0.00010184476,0.000013929631,0.95376694,0.036827803,0.0004588866,0.00058739306,0.000017057097],"about_ca_topic_score_codex":0.0010994158,"about_ca_topic_score_gemma":0.0019064269,"teacher_disagreement_score":0.0010994158,"about_ca_system_score_codex":0.00021546856,"about_ca_system_score_gemma":0.00017428739,"threshold_uncertainty_score":0.0036186576},"labels":[],"label_agreement":null},{"id":"W4379876866","doi":"10.1007/978-3-031-34550-0_35","title":"Assessing the Impact of Using Python to Teach Computational Thinking for Remote Schools in a Blended Learning Environment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Lakehead University","funders":"","keywords":"Computational thinking; Python (programming language); Computer science; Curriculum; Popularity; Bridging (networking); Mathematics education; Artificial intelligence; Programming language; Pedagogy; Sociology; Mathematics; Psychology","score_opus":0.04048910426055992,"score_gpt":0.33571514867973656,"score_spread":0.29522604441917666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379876866","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.9941028,0.000017942059,0.0016259091,0.00004721791,0.000012837502,0.00011003356,0.000055582837,0.000105585474,0.0039222375],"genre_scores_gemma":[0.98867995,0.000051139054,0.0066667786,0.000049371392,0.0000060110942,0.00015917323,0.00016069389,0.00004049616,0.0041863895],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985655,0.0004390412,0.00008680668,0.0002282876,0.0004984781,0.00018186726],"domain_scores_gemma":[0.9895355,0.0062409895,0.00064399076,0.0007569927,0.0010604381,0.0017621022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021965557,0.00055599347,0.0002828535,0.00045630004,0.00043946865,0.0015486084,0.0009906641,0.00066725025,0.0063036806],"category_scores_gemma":[0.013639581,0.00022781118,0.0004173124,0.0004208375,0.00048045546,0.0016245216,0.0017266998,0.0010499031,0.0013536164],"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.03856889,0.119542256,0.08177423,0.0013272723,0.00040726853,0.00044910333,0.006370466,0.04151568,0.08022098,0.004113898,0.0044521485,0.6212578],"study_design_scores_gemma":[0.0057213544,0.19074483,0.4566681,0.000606507,0.0012416377,0.0006861642,0.012439283,0.14291967,0.15405178,0.011663301,0.022861168,0.00039618023],"about_ca_topic_score_codex":0.0016662024,"about_ca_topic_score_gemma":0.0020106903,"teacher_disagreement_score":0.0063036806,"about_ca_system_score_codex":0.0006448344,"about_ca_system_score_gemma":0.0011418919,"threshold_uncertainty_score":0.021087885},"labels":[],"label_agreement":null},{"id":"W4379912188","doi":"10.1007/978-3-031-34550-0_38","title":"Powergaming by Spamming in a Learning Game","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Cheating; Computer science; Spamming; Test (biology); Game programming; Game design; Multimedia; Mathematics education; Game Developer; Artificial intelligence; World Wide Web; Game design document; Psychology; The Internet; Social psychology","score_opus":0.023615284754668196,"score_gpt":0.30365319650795375,"score_spread":0.2800379117532856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379912188","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.46444786,0.0005627037,0.31173575,0.0015663973,0.00065841805,0.00033031774,0.00005868136,0.0025893827,0.21805051],"genre_scores_gemma":[0.84427744,0.00018392656,0.055231,0.00042721286,0.00008736382,0.00017697072,0.00003787689,0.00018106366,0.09939715],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999793,0.00008336519,0.000005003633,0.00003709801,0.000048757105,0.00003286682],"domain_scores_gemma":[0.9996432,0.00020077627,0.000018441695,0.000034375906,0.000030994528,0.00007213849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038359957,0.0010546865,0.00042412747,0.0002624314,0.00064028497,0.0009771758,0.00064826483,0.0010140617,0.009384213],"category_scores_gemma":[0.0012145622,0.00021015343,0.00028273297,0.00010996158,0.00079120684,0.0015146984,0.0012764964,0.0010089825,0.0016560773],"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.0023929612,0.0019744944,0.0076195085,0.00085817464,0.00019151861,0.0023335703,0.0069269943,0.042988338,0.078832135,0.35423052,0.040478162,0.46117362],"study_design_scores_gemma":[0.0003767861,0.0031664926,0.007345225,0.0002807387,0.00018471538,0.0034149578,0.0027425329,0.5403009,0.03298014,0.30667987,0.10239039,0.00013727346],"about_ca_topic_score_codex":0.00028125348,"about_ca_topic_score_gemma":0.0005602369,"teacher_disagreement_score":0.009384213,"about_ca_system_score_codex":0.0002158004,"about_ca_system_score_gemma":0.0002646667,"threshold_uncertainty_score":0.03139335},"labels":[],"label_agreement":null},{"id":"W4380031458","doi":"10.1007/978-3-031-35504-2_5","title":"Honey, I Chunked the Passwords: Generating Semantic Honeywords Resistant to Targeted Attacks Using Pre-trained Language Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security 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":"Ontario Tech University","funders":"","keywords":"Password; Computer science; Leverage (statistics); Metric (unit); Exploit; Computer security; Information retrieval; Artificial intelligence","score_opus":0.030798966644554428,"score_gpt":0.27732893098618805,"score_spread":0.24652996434163363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380031458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07693988,0.00081012334,0.89652485,0.0005386165,0.0007802197,0.00024553147,0.0010711183,0.016567994,0.0065217274],"genre_scores_gemma":[0.4871278,0.00049054844,0.48640835,0.0005181174,0.00016307097,0.00024136278,0.003072062,0.0020390395,0.019939587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973446,0.000053822994,0.000021001242,0.00009886375,0.00005824151,0.00003364045],"domain_scores_gemma":[0.99932265,0.00021272917,0.000043996297,0.00023222204,0.00015108022,0.000037344515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044868584,0.0009223326,0.0005978713,0.0004648438,0.0003644582,0.0006278202,0.0006419852,0.0008363401,0.0048864116],"category_scores_gemma":[0.0018471578,0.0003883087,0.00074673316,0.00024279933,0.00060621666,0.0018662207,0.0012308782,0.0013403964,0.004021533],"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.0010488789,0.00021063199,0.0011317618,0.0004613657,0.00015643348,0.00046284936,0.00040856143,0.039670654,0.14741144,0.015389093,0.030878516,0.7627699],"study_design_scores_gemma":[0.0001142368,0.000765155,0.001002464,0.00007211067,0.00015576201,0.0007829421,0.00026198602,0.77584755,0.16692771,0.031830426,0.022135945,0.000103599494],"about_ca_topic_score_codex":0.0007517894,"about_ca_topic_score_gemma":0.0012617655,"teacher_disagreement_score":0.0048864116,"about_ca_system_score_codex":0.00026420862,"about_ca_system_score_gemma":0.0004834549,"threshold_uncertainty_score":0.016346693},"labels":[],"label_agreement":null},{"id":"W4380352252","doi":"10.1007/978-3-031-42935-4_2","title":"Diversifying Top-k Answers in a Query by Example Setting","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Tuple; Query optimization; Information retrieval; Diversification (marketing strategy); Set (abstract data type); Constraint (computer-aided design); Measure (data warehouse); Web query classification; Result set; Query plan; Query language; Theoretical computer science; Data mining; Web search query; Sargable; Search engine; Mathematics; Discrete mathematics; Programming language","score_opus":0.024240341476337985,"score_gpt":0.23897511389018275,"score_spread":0.21473477241384475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380352252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21598516,0.0034100243,0.7489713,0.0051625785,0.00021197474,0.00046704814,0.0022076336,0.008204177,0.0153801115],"genre_scores_gemma":[0.5693526,0.00094614766,0.4158963,0.0009651428,0.00039348577,0.00020067037,0.003994832,0.0007612609,0.0074894708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9888784,0.0036378277,0.00096130103,0.0021709686,0.003179646,0.0011718356],"domain_scores_gemma":[0.9712361,0.018692149,0.00075471355,0.0061276588,0.002036501,0.001153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007823276,0.0011882302,0.0051103025,0.0030549474,0.0026685847,0.005499762,0.0054365285,0.0043380116,0.009824237],"category_scores_gemma":[0.03291247,0.0011699889,0.0019211702,0.005898429,0.0025562905,0.012887783,0.009555924,0.0040995926,0.0034111254],"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.008397421,0.0018209403,0.013780138,0.0017063381,0.0005334962,0.0015516264,0.0016969454,0.15776433,0.021390412,0.09592351,0.052788496,0.6426464],"study_design_scores_gemma":[0.0003080881,0.00047356894,0.0009562972,0.00008873598,0.00020415123,0.0015987497,0.00086260005,0.7752501,0.009562653,0.20078346,0.009826638,0.00008505413],"about_ca_topic_score_codex":0.00251257,"about_ca_topic_score_gemma":0.0038913852,"teacher_disagreement_score":0.009824237,"about_ca_system_score_codex":0.0014379437,"about_ca_system_score_gemma":0.0019015761,"threshold_uncertainty_score":0.04137391},"labels":[],"label_agreement":null},{"id":"W4380787184","doi":"10.1007/978-3-031-34444-2","title":"Web Engineering","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Université de Versailles Saint-Quentin-en-Yvelines; Universidad de Extremadura; Universitat Oberta de Catalunya; Universidade Federal do Rio Grande do Norte; Universidad de Castilla-La Mancha; Università degli Studi di Brescia; Indian Institute of Technology Indore; Universitatea din București; RWTH Aachen University; Technische Universität Berlin; Novosibirsk State Technical University; Università di Bologna; Tallinna Tehnikaülikool; University of Hertfordshire; Universitat Jaume I; Oracle; Orta Doğu Teknik Üniversitesi; Universidad de Málaga; Consejo Nacional de Investigaciones Científicas y Técnicas; Università di Pisa; Euskal Herriko Unibertsitatea; Technische Universiteit Delft; Erasmus Universiteit Rotterdam; Aalto-Yliopisto; Università degli Studi dell'Aquila; Technische Universiteit Eindhoven; Helsingin Yliopisto; Macquarie University; Universidad de Alicante; Sorbonne Université; Technische Universität Chemnitz; Universiteit Gent; Universität Leipzig; Universidad de Sevilla; State University of New York; Fachhochschule Bielefeld; Universität Bielefeld; Universidad Nacional de La Plata; Korea Advanced Institute of Science and Technology; CA Technologies; University of Ottawa; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; Semantic Web; Web modeling; World Wide Web; Data Web; Web standards; Web engineering; Social Semantic Web; Semantic Web Stack; Web development; Web intelligence; Web service; Software engineering","score_opus":0.015804919380065653,"score_gpt":0.23636066252280874,"score_spread":0.2205557431427431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380787184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017997526,0.004080667,0.118597016,0.002859508,0.0014160769,0.00013160014,0.00074705883,0.003101262,0.8672671],"genre_scores_gemma":[0.022927236,0.005945397,0.042666197,0.0010903907,0.000457327,0.00011739171,0.0020794987,0.0014033873,0.9233131],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992204,0.00010055101,0.000036837024,0.00010425025,0.00049050775,0.000047475653],"domain_scores_gemma":[0.9994591,0.00010181941,0.000014170178,0.00022290087,0.00016260055,0.000039334172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006828763,0.0006784701,0.00039967176,0.0018634018,0.0007874292,0.0039683664,0.0008350179,0.0010567427,0.087250136],"category_scores_gemma":[0.0017007096,0.00041622377,0.00043246037,0.0017817722,0.0005758278,0.0040384363,0.0019222128,0.0014785695,0.061799522],"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.000022286353,0.0000915278,0.00015760503,0.00023156875,0.000009940039,0.00012729038,0.00018370144,0.00089802494,0.00264561,0.26611573,0.21194252,0.51757425],"study_design_scores_gemma":[0.0000034093985,0.000007560403,0.00012460868,0.000083803636,0.000004125175,0.00019452213,0.000058910045,0.0014542481,0.0019633586,0.070118174,0.9259814,0.000005835661],"about_ca_topic_score_codex":0.0010221944,"about_ca_topic_score_gemma":0.0012713736,"teacher_disagreement_score":0.087250136,"about_ca_system_score_codex":0.00070934725,"about_ca_system_score_gemma":0.0007890257,"threshold_uncertainty_score":0.2918808},"labels":[],"label_agreement":null},{"id":"W4380789144","doi":"10.1007/978-3-031-35302-4_2","title":"Ultrastructure Analysis of Cardiomyocytes and Their Nuclei","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Mechanics and Interactions","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":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Myocyte; Nucleus; Orientation (vector space); Elongation; Biophysics; Artificial intelligence; Confocal microscopy; Computer science; Segmentation; Clearance; Syncytium; Ultrastructure; Long axis; Confocal; Anatomy; Chemistry; Physics; Cell biology; Biology; Cell; Materials science; Ultimate tensile strength; Geometry; Mathematics; Medicine; Optics; Biochemistry","score_opus":0.009258100222743567,"score_gpt":0.2265559413005263,"score_spread":0.21729784107778274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380789144","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.8317373,0.008760641,0.13106185,0.00019672963,0.00012878978,0.000032868415,0.0005379589,0.00025823098,0.027285628],"genre_scores_gemma":[0.9515026,0.0022839967,0.030893262,0.000044203505,0.000035364727,0.000021188613,0.0006472632,0.000076963355,0.014495086],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99995613,0.0000040618465,0.0000020297161,0.000012900868,0.000018023984,0.000006854167],"domain_scores_gemma":[0.9999385,0.00001558385,0.0000071365075,0.000007656092,0.000023214621,0.000007814148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072752075,0.000118268516,0.00011687219,0.00040746492,0.00018250647,0.00025452304,0.0002825543,0.0001850921,0.0012589217],"category_scores_gemma":[0.00008941932,0.00014029886,0.00011997505,0.00028314948,0.00019396147,0.00024275141,0.0001721303,0.00014934728,0.0003267001],"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.00008156717,0.000018927054,0.0023689175,0.000093142415,0.000012366455,0.00014103924,0.00012886117,0.0032836027,0.9395312,0.0038976793,0.0003977248,0.05004496],"study_design_scores_gemma":[0.000013830934,0.00031439908,0.1461341,0.00006490777,0.00007856477,0.0018666163,0.00067013747,0.092073396,0.7247045,0.010142329,0.023893453,0.000043876928],"about_ca_topic_score_codex":0.00077074475,"about_ca_topic_score_gemma":0.0010621232,"teacher_disagreement_score":0.0012589217,"about_ca_system_score_codex":0.00017757592,"about_ca_system_score_gemma":0.000119417164,"threshold_uncertainty_score":0.0042114854},"labels":[],"label_agreement":null},{"id":"W4380903031","doi":"10.1007/978-3-031-35254-6","title":"Prolog: The Next 50 Years","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Prolog; Computer science; Field (mathematics); Programming language; Software engineering; Mathematics","score_opus":0.035780636705362225,"score_gpt":0.26374530586658196,"score_spread":0.22796466916121974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380903031","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040564165,0.6378391,0.08917656,0.03083256,0.0242976,0.00018502286,0.0043903003,0.0053451536,0.20387737],"genre_scores_gemma":[0.032405145,0.4369033,0.15482451,0.012248076,0.008775957,0.00037925088,0.011540548,0.0055538067,0.33736938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986462,0.00037934072,0.000116374475,0.0001623382,0.00051263307,0.00018303056],"domain_scores_gemma":[0.9958631,0.0017662608,0.0001550277,0.00030461402,0.0012933669,0.0006176025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006133463,0.0013419318,0.001239976,0.0028906802,0.0009409689,0.007288277,0.0017397385,0.0018936098,0.04148853],"category_scores_gemma":[0.009343982,0.0013315356,0.0006915359,0.004976321,0.0016869138,0.010476677,0.0033557205,0.0036307012,0.026701834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000198164,0.00009477052,0.00013786109,0.0010223568,0.00002161893,0.00005824394,0.00012789147,0.0012934132,0.00047105056,0.049569167,0.3948324,0.5521731],"study_design_scores_gemma":[0.000019960824,0.000027255748,0.00011020434,0.00040543458,0.000009055566,0.00011007482,0.000053051535,0.00083860394,0.0002596379,0.015037771,0.9831165,0.000012377881],"about_ca_topic_score_codex":0.0023456663,"about_ca_topic_score_gemma":0.0026121878,"teacher_disagreement_score":0.04148853,"about_ca_system_score_codex":0.0023596212,"about_ca_system_score_gemma":0.00276535,"threshold_uncertainty_score":0.13879293},"labels":[],"label_agreement":null},{"id":"W4380905397","doi":"10.1007/978-3-031-35254-6_13","title":"Introducing Prolog in Language-Informed Ways","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"","keywords":"Prolog; Computer science; Grammar; Programming language; Subject (documents); Artificial intelligence; Position paper; Natural language processing; Cognitive science; Linguistics; World Wide Web; Psychology","score_opus":0.015853041232005247,"score_gpt":0.2721283126612512,"score_spread":0.25627527142924594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380905397","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.0010994249,0.0019935267,0.9381631,0.0030372995,0.0008035342,0.000077722456,0.00014587199,0.0014307064,0.053248826],"genre_scores_gemma":[0.050577722,0.00532038,0.88613033,0.0024261172,0.00069409364,0.0002465222,0.00048140835,0.0018047676,0.05231872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836177,0.0008281774,0.00012275923,0.00019255745,0.00037984218,0.00011494918],"domain_scores_gemma":[0.99849546,0.000960822,0.00007385565,0.00023233694,0.0001609182,0.00007663822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020293987,0.0010215738,0.00056925777,0.0010991519,0.0011218704,0.0066773896,0.0016421622,0.001250628,0.0155453775],"category_scores_gemma":[0.005138383,0.0011463845,0.0011091343,0.001322385,0.002991691,0.011083966,0.003854402,0.0062496285,0.00646345],"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.000031735362,0.00003214303,0.000074235126,0.00033425487,0.000017814169,0.00016193595,0.0012022399,0.0022048992,0.0013584617,0.9012966,0.014149249,0.079136476],"study_design_scores_gemma":[0.000013018746,0.000016811317,0.00002828105,0.00019365428,0.000015304428,0.00017089995,0.00023165194,0.004250454,0.0016087188,0.61292434,0.38052508,0.000021839567],"about_ca_topic_score_codex":0.0010126574,"about_ca_topic_score_gemma":0.0017844101,"teacher_disagreement_score":0.0155453775,"about_ca_system_score_codex":0.0011451844,"about_ca_system_score_gemma":0.0012358587,"threshold_uncertainty_score":0.052004457},"labels":[],"label_agreement":null},{"id":"W4380905498","doi":"10.1007/978-3-031-35254-6_11","title":"Logic Programming at Elementary School: Why, What and How Should We Teach Logic Programming to Children?","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Simon Fraser University","funders":"","keywords":"Computer science; Mathematics education; Logical reasoning; Logic programming; Computational thinking; Computer programming; Artificial intelligence; Programming language; Mathematics","score_opus":0.03801753468501129,"score_gpt":0.278903641103232,"score_spread":0.24088610641822072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380905498","genre_codex":"commentary","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.12028259,0.17137252,0.028859885,0.38284573,0.0054929196,0.00019623832,0.0007471567,0.0009616926,0.28924122],"genre_scores_gemma":[0.5478008,0.119613014,0.055751078,0.05899945,0.001411194,0.00047758681,0.0009193505,0.00059835205,0.21442911],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927765,0.00019464703,0.000021776732,0.00014009407,0.00015208895,0.00021364607],"domain_scores_gemma":[0.9986248,0.00030113288,0.00011239633,0.000044096207,0.00027422333,0.00064336555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436577,0.0003396602,0.0006869356,0.0006139782,0.0013390859,0.0034235923,0.00085869356,0.001801961,0.006322855],"category_scores_gemma":[0.0027533888,0.0003960946,0.00044130048,0.0007590819,0.0021569077,0.0048581827,0.0016280209,0.005428431,0.002850911],"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.0001392457,0.00080649427,0.014065578,0.0015964911,0.000052356212,0.00036375318,0.011652586,0.00044871113,0.0026578512,0.13200706,0.33392268,0.50228715],"study_design_scores_gemma":[0.000074144285,0.00025597337,0.02815983,0.0049126013,0.00007543424,0.00062796345,0.011751156,0.0005273423,0.0022102564,0.09673702,0.8546239,0.000044398395],"about_ca_topic_score_codex":0.00864388,"about_ca_topic_score_gemma":0.027265335,"teacher_disagreement_score":0.00864388,"about_ca_system_score_codex":0.0038104882,"about_ca_system_score_gemma":0.007065769,"threshold_uncertainty_score":0.027647197},"labels":[],"label_agreement":null},{"id":"W4380996758","doi":"10.1007/978-3-031-35302-4_71","title":"The Extent of LGE-Defined Fibrosis Predicts Ventricular Arrhythmia Severity: Insights from a Preclinical Model of Chronic Infarction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Arrhythmias and Treatments","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Sunnybrook Hospital; University of Toronto","funders":"","keywords":"Medicine; Fibrosis; Cardiology; Ventricular tachycardia; Ejection fraction; Internal medicine; Myocardial infarction; Infarction; Cardiac fibrosis; Sudden cardiac death; Heart failure","score_opus":0.021390031900027754,"score_gpt":0.26314203956012744,"score_spread":0.2417520076600997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380996758","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.90277475,0.019847829,0.044678863,0.0032179567,0.00035116784,0.000085629465,0.0030130148,0.00039346114,0.025637398],"genre_scores_gemma":[0.9488804,0.013029218,0.0136939185,0.0006073505,0.00031245916,0.00012366149,0.0018965155,0.000093114584,0.02136339],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999962,0.0000088193265,0.0000015933554,0.000010100537,0.000010873291,0.000006695634],"domain_scores_gemma":[0.9998673,0.00006999742,0.000024668845,0.000010121738,0.000009859163,0.000017963357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023774043,0.00046101815,0.00041892185,0.00023687906,0.000094336676,0.0006516675,0.0002336724,0.00042123385,0.0025741644],"category_scores_gemma":[0.00027716393,0.000186205,0.0002557015,0.00018378388,0.0002102877,0.00032190574,0.00017700672,0.00094546954,0.0006929084],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004540134,0.00210865,0.054377563,0.00048099455,0.00028693408,0.0017078731,0.00026305704,0.007451279,0.62555707,0.011950535,0.020773102,0.27050278],"study_design_scores_gemma":[0.00056927063,0.01307123,0.638136,0.00056415144,0.0009415845,0.008178058,0.0005191133,0.10039323,0.14284533,0.05865106,0.035841856,0.00028906792],"about_ca_topic_score_codex":0.00039369418,"about_ca_topic_score_gemma":0.0007334292,"teacher_disagreement_score":0.0025741644,"about_ca_system_score_codex":0.00017655212,"about_ca_system_score_gemma":0.00016167463,"threshold_uncertainty_score":0.0086115},"labels":[],"label_agreement":null},{"id":"W4381303311","doi":"10.1007/978-3-031-33180-0_3","title":"On the Number of Distinct Squares in Finite Sequences: Some Old and New Results","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Université du Québec à Montréal","funders":"","keywords":"Word (group theory); Bounded function; Square (algebra); Combinatorics; Mathematics; Finite set; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.03482014820222165,"score_gpt":0.26890963523137035,"score_spread":0.2340894870291487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381303311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07815468,0.048364155,0.7192092,0.008480932,0.0038961198,0.00010957575,0.00081077364,0.0005886177,0.14038593],"genre_scores_gemma":[0.53043294,0.050302062,0.31763345,0.004571806,0.016467836,0.00049667986,0.0014380626,0.0013263217,0.07733071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973801,0.0005464993,0.00023243911,0.00077864074,0.00081235217,0.00025001087],"domain_scores_gemma":[0.96809375,0.02640704,0.0010355171,0.0019716206,0.0014793733,0.001012638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004350345,0.0024232825,0.0028397632,0.0048449314,0.0024049948,0.0043185083,0.0042162407,0.0031391631,0.008300205],"category_scores_gemma":[0.021279847,0.0015088408,0.0021558446,0.0069825603,0.012093559,0.024077002,0.0050236755,0.009372871,0.0022583564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021439051,0.000101390644,0.00096867885,0.00057416083,0.000040494593,0.00017445591,0.00045063216,0.008692556,0.002589217,0.91325295,0.008873656,0.06406759],"study_design_scores_gemma":[0.000018780056,0.000039792274,0.0003819372,0.00006678356,0.000025639298,0.00026816753,0.000079233054,0.013239519,0.00082802016,0.9770626,0.007955269,0.000034293997],"about_ca_topic_score_codex":0.0010991949,"about_ca_topic_score_gemma":0.0009310109,"teacher_disagreement_score":0.008300205,"about_ca_system_score_codex":0.0019897372,"about_ca_system_score_gemma":0.0010916725,"threshold_uncertainty_score":0.027767003},"labels":[],"label_agreement":null},{"id":"W4381304074","doi":"10.1007/978-3-031-33180-0_17","title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Thompson Rivers University","funders":"","keywords":"Parenthesis; Binary number; Bounded function; Word (group theory); Combinatorics; Repetition (rhetorical device); Discrete mathematics; Morse code; Mathematics; Upper and lower bounds; Computer science; Arithmetic; Geometry; Linguistics; Telecommunications","score_opus":0.015110211002564853,"score_gpt":0.2345265728146961,"score_spread":0.21941636181213126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304074","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.21553369,0.01370267,0.33641312,0.00223823,0.0011018708,0.00011809021,0.0003940889,0.00048234224,0.4300159],"genre_scores_gemma":[0.7865934,0.0050238203,0.063791014,0.00044481677,0.0004591627,0.00020368828,0.0005524016,0.00019835393,0.14273332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997551,0.00004936621,0.000020815676,0.0000618753,0.000073781164,0.00003900807],"domain_scores_gemma":[0.99958676,0.00021379044,0.00004539995,0.000059713602,0.00005981819,0.00003449455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025045956,0.00047187804,0.0004632699,0.0012974308,0.0010799922,0.0018570253,0.000541632,0.000644863,0.008247198],"category_scores_gemma":[0.0013893857,0.00031411258,0.0003009616,0.0013116922,0.0019686138,0.0034765785,0.0012469805,0.001350778,0.0012859955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021975895,0.000009880216,0.00007333791,0.000047651487,0.0000020301743,0.000043158918,0.00015230075,0.0006389933,0.0010046503,0.9792962,0.0014884609,0.0172213],"study_design_scores_gemma":[0.0000048244456,0.0000119311235,0.000065343535,0.000012342149,0.0000024575752,0.00010783278,0.000096416516,0.0016020219,0.0005146676,0.9890426,0.00853423,0.0000053831513],"about_ca_topic_score_codex":0.0005820201,"about_ca_topic_score_gemma":0.00070230995,"teacher_disagreement_score":0.008247198,"about_ca_system_score_codex":0.0007021687,"about_ca_system_score_gemma":0.0003811591,"threshold_uncertainty_score":0.02758962},"labels":[],"label_agreement":null},{"id":"W4381304387","doi":"10.1007/978-3-031-33180-0_14","title":"Smallest and Largest Block Palindrome Factorizations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Factorization; Palindrome; Word (group theory); Prefix; Combinatorics; Mathematics; Suffix; Suffix array; Computer science; Arithmetic; Discrete mathematics; Algorithm; Linguistics","score_opus":0.018882904818249592,"score_gpt":0.23172284785981276,"score_spread":0.21283994304156317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1733155,0.0030300836,0.46680135,0.0010999923,0.0009134454,0.00015149088,0.0014486082,0.001462218,0.3517773],"genre_scores_gemma":[0.6642597,0.0014359842,0.1598033,0.00033233667,0.0005190018,0.00016510421,0.0013721008,0.0007742099,0.1713383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999729,0.000033642093,0.000017914956,0.00008830067,0.000060207785,0.00007096911],"domain_scores_gemma":[0.9995012,0.0002002575,0.00003526021,0.00011232088,0.00008180313,0.00006903009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002954905,0.000429391,0.0005815274,0.0005630082,0.0010366441,0.001423666,0.00048098352,0.00042345727,0.022688309],"category_scores_gemma":[0.00088824576,0.00043594485,0.0006307698,0.00051241834,0.0010289801,0.0032823556,0.0008349379,0.0012785645,0.0056837937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678466,0.000028976887,0.00014460973,0.00014349792,0.0000050113117,0.00011879424,0.00039746653,0.0006981588,0.014739786,0.92566484,0.0055972068,0.052193742],"study_design_scores_gemma":[0.00003297783,0.00010006462,0.00031956323,0.000042169235,0.000016653945,0.0003971611,0.0001664322,0.0028892818,0.007764624,0.9405664,0.047680017,0.000024736712],"about_ca_topic_score_codex":0.00036177228,"about_ca_topic_score_gemma":0.00072371354,"teacher_disagreement_score":0.022688309,"about_ca_system_score_codex":0.00036152112,"about_ca_system_score_gemma":0.00035681837,"threshold_uncertainty_score":0.0758999},"labels":[],"label_agreement":null},{"id":"W4381304603","doi":"10.1007/978-3-031-33180-0_18","title":"Rudin-Shapiro Sums via Automata Theory and Logic","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Computer science; Mathematical proof; Automaton; Automata theory; Proof theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.019670691568446357,"score_gpt":0.24566659605152943,"score_spread":0.22599590448308307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381304603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042864,0.015237902,0.47713697,0.00474083,0.0013789077,0.00008595363,0.0004053939,0.0007705991,0.45737946],"genre_scores_gemma":[0.70642126,0.009956166,0.13333614,0.0014754446,0.003166881,0.00035078218,0.00050440617,0.00045901616,0.14433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939525,0.00018222506,0.00004348104,0.00012089003,0.00020863673,0.00004956852],"domain_scores_gemma":[0.9994435,0.00036404983,0.000028291293,0.00006641468,0.00006891731,0.000028988316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006954561,0.00080423336,0.0012558384,0.0017779125,0.0018326106,0.003435429,0.0010378942,0.0010292052,0.0077587585],"category_scores_gemma":[0.0015370548,0.00065265415,0.0010338505,0.001908611,0.0036339315,0.008131279,0.0019544305,0.0035755462,0.0020584115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009095431,0.0000073422943,0.00002198058,0.000029387531,0.0000053756935,0.000012280807,0.00006448061,0.00044997132,0.00018986278,0.9911675,0.0013334326,0.006709372],"study_design_scores_gemma":[0.0000025432635,0.0000028067989,0.000018949788,0.000004558205,0.0000045213096,0.000017854369,0.000011301103,0.00072073116,0.00014927113,0.99361235,0.005451362,0.0000036347524],"about_ca_topic_score_codex":0.00049839955,"about_ca_topic_score_gemma":0.00059931475,"teacher_disagreement_score":0.0077587585,"about_ca_system_score_codex":0.0016433257,"about_ca_system_score_gemma":0.0006284464,"threshold_uncertainty_score":0.025955677},"labels":[],"label_agreement":null},{"id":"W4381516555","doi":"10.1007/978-3-031-35382-6_13","title":"Interaction Strategies in Composition for Karlax and Acoustic Instruments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Computer science; Composition (language); Musical composition; Context (archaeology); Musical; Adaptability; Metaphor; Musical instrument; Human–computer interaction; Process (computing); Guitar; Linguistics; Acoustics; Visual arts; Art; Literature; History","score_opus":0.022011393183401357,"score_gpt":0.2681940835793491,"score_spread":0.24618269039594773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381516555","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22521774,0.002475389,0.2643408,0.00082537637,0.0002541721,0.00015659047,0.00010080192,0.0008437901,0.5057853],"genre_scores_gemma":[0.7897246,0.00071793643,0.06325947,0.00008555333,0.000029404751,0.00014135483,0.00013343355,0.00031358397,0.14559467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956673,0.00016821061,0.000019578469,0.00006140042,0.00011015908,0.00007401482],"domain_scores_gemma":[0.9997476,0.00014680892,0.000014197321,0.000021680436,0.00003668127,0.000033060795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004694374,0.0007796123,0.0002930008,0.0005219683,0.0016713452,0.0031340432,0.0005787061,0.0007528081,0.015888406],"category_scores_gemma":[0.0012056098,0.00027605315,0.00031129562,0.0004380884,0.0011077721,0.002476915,0.0015778915,0.00069200597,0.0025766506],"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.00097139046,0.00013090756,0.001923465,0.00046866073,0.00003554002,0.00092426,0.046845745,0.0023806868,0.08166104,0.4925438,0.007045291,0.36506918],"study_design_scores_gemma":[0.00023143282,0.0010459003,0.015470745,0.0008216368,0.00018801006,0.0044618547,0.088971205,0.055229906,0.07315766,0.32570857,0.43449134,0.00022171534],"about_ca_topic_score_codex":0.001187272,"about_ca_topic_score_gemma":0.0020406884,"teacher_disagreement_score":0.015888406,"about_ca_system_score_codex":0.00051025423,"about_ca_system_score_gemma":0.00045050387,"threshold_uncertainty_score":0.053151965},"labels":[],"label_agreement":null},{"id":"W4381516738","doi":"10.1007/978-3-031-35382-6_9","title":"Networked and Collaborative Musical Play Amongst Humans and Virtual Biological Agents in Locus Diffuse","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Slime Mold and Myxomycetes Research","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":"York University","funders":"","keywords":"Human–computer interaction; Computer science; Perception; Focus (optics); Multimedia; Psychology","score_opus":0.03061828605063511,"score_gpt":0.2634690091905376,"score_spread":0.23285072313990252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381516738","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.5843605,0.0012870097,0.1571047,0.0010377122,0.0001554659,0.00006713828,0.000055568522,0.0006705644,0.25526133],"genre_scores_gemma":[0.9429439,0.00027680505,0.017684532,0.000054292293,0.000019126064,0.00003464026,0.000039020077,0.00006999922,0.03887776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999741,0.000074517666,0.0000074420473,0.000053525746,0.00008894278,0.000034628232],"domain_scores_gemma":[0.9996518,0.00017045042,0.000022955024,0.00004160437,0.000020823014,0.000092333976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034483479,0.000261206,0.0002381397,0.00035098608,0.001253978,0.00279922,0.0010286273,0.0007456626,0.010310806],"category_scores_gemma":[0.0009109284,0.0001873278,0.00023965852,0.00033577482,0.0020109506,0.0023182342,0.004066494,0.0007989918,0.0011860107],"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.00066482293,0.0004149684,0.0049239616,0.00029175452,0.00007362053,0.0034461874,0.049166206,0.031990558,0.1686732,0.4725656,0.0058234883,0.26196575],"study_design_scores_gemma":[0.00022660087,0.0015060133,0.019976247,0.00040289015,0.00013286508,0.0049635046,0.062427294,0.20436779,0.065331206,0.36363056,0.27680704,0.00022807959],"about_ca_topic_score_codex":0.000780456,"about_ca_topic_score_gemma":0.0010473278,"teacher_disagreement_score":0.010310806,"about_ca_system_score_codex":0.00043068803,"about_ca_system_score_gemma":0.0002967321,"threshold_uncertainty_score":0.03449303},"labels":[],"label_agreement":null},{"id":"W4381735246","doi":"10.1007/978-3-031-36402-0_55","title":"iSTIMULI: Prescriptive Stimulus Design for Eye Movement Analysis of Patients with Parkinson’s Disease","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","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":"Parkinson's Clinic of Eastern Toronto & Movement Disorders Centre","funders":"","keywords":"Eye movement; Eye tracking; Computer science; Stimulus (psychology); Gaze; Parkinson's disease; Visual analytics; Artificial intelligence; Gaze-contingency paradigm; Visualization; Computer vision; Cognitive psychology; Psychology; Visual perception; Disease; Medicine; Perception; Neuroscience","score_opus":0.022741933322939605,"score_gpt":0.2482664951965073,"score_spread":0.22552456187356767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381735246","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.022580784,0.00038921382,0.96682805,0.00011189908,0.00013280971,0.0005089277,0.0006607161,0.0055585657,0.0032290665],"genre_scores_gemma":[0.16257118,0.00039586905,0.82505465,0.00025428788,0.00004469363,0.0023265542,0.0009954292,0.0022685323,0.0060887416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939704,0.00030011873,0.000053226184,0.000098701144,0.00012254738,0.000028317969],"domain_scores_gemma":[0.99806875,0.0014803831,0.00007762632,0.000100135774,0.00021696553,0.00005612016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015867491,0.0009045971,0.000498191,0.00047503944,0.00020564336,0.0008316411,0.000886921,0.00055308326,0.015329349],"category_scores_gemma":[0.004860514,0.0003756201,0.00028603614,0.00033895666,0.0002587785,0.0005600501,0.00083052326,0.0005907307,0.0019441139],"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.0039281994,0.00018203833,0.0008906313,0.001062505,0.000095068,0.00016606296,0.00046868742,0.011640702,0.14909899,0.0070791463,0.008761225,0.8166267],"study_design_scores_gemma":[0.0018707736,0.0035217486,0.012911217,0.000520025,0.00032904706,0.0016347534,0.0006310909,0.60929865,0.26222908,0.034937598,0.071902096,0.0002139907],"about_ca_topic_score_codex":0.0003095433,"about_ca_topic_score_gemma":0.00083913,"teacher_disagreement_score":0.015329349,"about_ca_system_score_codex":0.000313022,"about_ca_system_score_gemma":0.00042877314,"threshold_uncertainty_score":0.05128181},"labels":[],"label_agreement":null},{"id":"W4381789422","doi":"10.1007/978-3-031-37679-5_5","title":"A Side-Channel Attack Against Classic McEliece When Loading the Goppa Polynomial","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche; Impact Fund; Silicon Valley Community Foundation","keywords":"McEliece cryptosystem; NIST; Computer science; Cryptography; Post-quantum cryptography; Polynomial; Cryptosystem; Theoretical computer science; Public-key cryptography; Discrete mathematics; Algorithm; Arithmetic; Mathematics; Computer security; Encryption; Speech recognition","score_opus":0.04166387649255496,"score_gpt":0.27992201413202233,"score_spread":0.23825813763946738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381789422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23479581,0.0024684574,0.48937175,0.006168411,0.0015417689,0.00032889374,0.00034472207,0.006423137,0.2585571],"genre_scores_gemma":[0.91634864,0.0005800034,0.043438174,0.00061789405,0.0002908469,0.000119906625,0.00013552752,0.0006676448,0.03780137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952264,0.0008582099,0.00013202395,0.0005830359,0.00208959,0.0011106994],"domain_scores_gemma":[0.99446636,0.002071451,0.00022495864,0.0025050053,0.0005033069,0.00022889032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018955745,0.0012049715,0.0014084734,0.0012263615,0.0025646908,0.0028926313,0.001359834,0.0033529114,0.00978462],"category_scores_gemma":[0.010249357,0.0008079019,0.0011738004,0.0014552126,0.0040275306,0.0065316674,0.005838378,0.0054582492,0.004790795],"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.003696751,0.00025176196,0.0017646954,0.00038315816,0.00025519053,0.0021553254,0.0014071371,0.01980894,0.06898819,0.6533604,0.035094995,0.21283348],"study_design_scores_gemma":[0.00032416996,0.0007257425,0.0013377757,0.00032353064,0.00025894103,0.0044250004,0.00049753126,0.18165244,0.18241149,0.55489266,0.07289705,0.00025370318],"about_ca_topic_score_codex":0.00067812554,"about_ca_topic_score_gemma":0.0006410729,"teacher_disagreement_score":0.00978462,"about_ca_system_score_codex":0.001678065,"about_ca_system_score_gemma":0.0014807803,"threshold_uncertainty_score":0.032732785},"labels":[],"label_agreement":null},{"id":"W4381856060","doi":"10.1007/978-3-031-34326-1_4","title":"Existential and Universal Width of Alternating Finite Automata","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Decidability; Bounded function; Computation; Automaton; Finite-state machine; String (physics); Nondeterministic finite automaton; Deterministic finite automaton; Integer (computer science); Existentialism; Nondeterministic algorithm; Discrete mathematics; Deterministic automaton; Computer science; Mathematics; Algorithm; Automata theory; Theoretical computer science; Mathematical analysis","score_opus":0.01791347460222524,"score_gpt":0.23648603760099757,"score_spread":0.2185725629987723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381856060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32963157,0.005737837,0.5289696,0.0016732785,0.0005441432,0.00008235533,0.0012099309,0.0016791885,0.13047212],"genre_scores_gemma":[0.9147517,0.0014953358,0.06321132,0.0002519335,0.00040873833,0.00015547007,0.00064616377,0.0006604839,0.018418882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984397,0.00032086525,0.00018086543,0.00046998993,0.00031378237,0.00027475858],"domain_scores_gemma":[0.9936785,0.0042231125,0.0003281283,0.00097537367,0.00040515268,0.00038975675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823906,0.00089356524,0.0011171013,0.0016089518,0.0014362555,0.0042884382,0.0023745697,0.0010258758,0.0073484485],"category_scores_gemma":[0.009123818,0.0013471898,0.0013350543,0.0018296698,0.0035183476,0.016303672,0.003920281,0.0049586766,0.0009789104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015269514,0.000032746284,0.0004903853,0.000117418465,0.00001701751,0.00006126055,0.0007436673,0.0016679921,0.0024530657,0.97318846,0.0010319806,0.020043442],"study_design_scores_gemma":[0.000010631627,0.000017236373,0.0003230315,0.000035275993,0.000026309766,0.00009281311,0.00014473131,0.0046659866,0.0014291977,0.98992693,0.0033119267,0.000015986225],"about_ca_topic_score_codex":0.00068684504,"about_ca_topic_score_gemma":0.00064924726,"teacher_disagreement_score":0.0073484485,"about_ca_system_score_codex":0.0011927175,"about_ca_system_score_gemma":0.00060045486,"threshold_uncertainty_score":0.024582982},"labels":[],"label_agreement":null},{"id":"W4381895020","doi":"10.1007/978-3-031-34326-1","title":"Descriptional Complexity of Formal Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Szegedi Tudományegyetem; Eötvös Loránd Tudományegyetem; Université de Bordeaux; Debreceni Egyetem; Universität Trier; Universidade do Porto; Univerzita Komenského v Bratislave; Slovenská Akadémia Vied; Universität Potsdam; Santa Clara University; Hebrew University of Jerusalem; Università degli Studi di Milano; Yonsei University; Queen's University","keywords":"Computer science; Automaton; Formal language; Rule-based machine translation; Programming language; Grammar systems theory; Formal system; Formal grammar; Formal methods; Theoretical computer science; Natural language processing; Artificial intelligence","score_opus":0.03960981579574425,"score_gpt":0.25225768808996296,"score_spread":0.21264787229421872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381895020","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14959791,0.013546647,0.4872979,0.016751079,0.0005942518,0.00015211328,0.0021497246,0.00068421644,0.32922614],"genre_scores_gemma":[0.9072059,0.0056535057,0.047121037,0.0006580698,0.00097203226,0.0002746037,0.0014608329,0.00024049438,0.036413584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759907,0.0005254097,0.0001527754,0.0003432695,0.0011836995,0.00019575038],"domain_scores_gemma":[0.9922586,0.006003327,0.00028057804,0.00074036414,0.0004760942,0.00024096052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635948,0.00067537185,0.001105594,0.0019589718,0.0012266536,0.0061787167,0.0013917126,0.0009885314,0.00934051],"category_scores_gemma":[0.0070561776,0.0008187012,0.0012028464,0.0024571666,0.0038178368,0.012273998,0.0029656233,0.004687261,0.0008753676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013073801,0.000012422182,0.00011605451,0.000065775544,0.000008928992,0.0000221187,0.00016240805,0.0022604556,0.0002632505,0.98752856,0.0018143059,0.007732542],"study_design_scores_gemma":[0.0000035439712,0.0000029757516,0.00007619141,0.000007800921,0.0000035390165,0.000029693605,0.000027717448,0.004070562,0.00012073278,0.99280655,0.0028463074,0.000004399159],"about_ca_topic_score_codex":0.00096199126,"about_ca_topic_score_gemma":0.0006495716,"teacher_disagreement_score":0.00934051,"about_ca_system_score_codex":0.003556794,"about_ca_system_score_gemma":0.00096377457,"threshold_uncertainty_score":0.03124708},"labels":[],"label_agreement":null},{"id":"W4381956096","doi":"10.1007/978-3-031-36272-9","title":"Artificial Intelligence in Education","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Data Processing Techniques","field":"Engineering","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 British Columbia","funders":"National Institute of Information and Communications Technology; University of California, Irvine; California State University, Fullerton; Universidade Federal de Alagoas; University of Colorado Boulder; U.S. Army; Singapore Management University; Stockholms Universitet; University of Massachusetts Amherst; Universidade Federal do Rio de Janeiro; Universidade Federal de Pernambuco; University of Tsukuba; Technion-Israel Institute of Technology; Ateneo de Manila University; Universidad de Chile; University of Pittsburgh; Hacettepe Üniversitesi; Iran Telecommunication Research Center; Universidad Autónoma de Madrid; University of Pennsylvania; Georgia Institute of Technology; Instituto Tecnológico y de Estudios Superiores de Monterrey; Simon Fraser University; Leibniz-Gemeinschaft; Sapienza Università di Roma; Gottfried Wilhelm Leibniz Universität Hannover; Sorbonne Université; Universidad Politécnica de Madrid; Universidade Federal de Uberlândia; Turun Yliopisto; U.S. Army Combat Capabilities Development Command; Athabasca University; University of Minnesota; Universiteit Utrecht; Trinity College Dublin; Universidad del Cauca; University of Sussex; Universidade Federal do Rio Grande do Sul; University of Alberta; Universidad Nacional de Educación a Distancia; Arizona State University; Universitat Pompeu Fabra; Université de Lorraine; North Carolina State University; Carnegie Mellon University; Université de Lyon; University of Technology Sydney; University of Central Florida; University of Southern California; University of Memphis; Università degli Studi di Cagliari; University of South Australia; McGill University; Beijing Normal University; Vanderbilt University; Euskal Herriko Unibertsitatea; Kanazawa University; Universiteit van Amsterdam; Georgia State University; University of Illinois at Urbana-Champaign; Colorado State University; Kindai University; École Polytechnique Fédérale de Lausanne; Valparaiso University; Northern Illinois University; Educational Testing Service; Northern Kentucky University; University College London","keywords":"Computer science; Artificial intelligence","score_opus":0.021356230240940632,"score_gpt":0.2953854935008512,"score_spread":0.27402926325991056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381956096","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.000673885,0.07003842,0.008891965,0.0109029,0.0034602028,0.000037585494,0.000111510075,0.00021582679,0.90566766],"genre_scores_gemma":[0.010770624,0.02587299,0.0035640714,0.0022335115,0.0012926697,0.000051958585,0.000118704804,0.00010597247,0.95598936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968255,0.00008176415,0.000012256934,0.000044743105,0.00015137294,0.000027294007],"domain_scores_gemma":[0.99957806,0.00017692437,0.00002290459,0.00006624194,0.00008381883,0.0000721276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006858991,0.00080286624,0.0006238251,0.001159797,0.0009925606,0.0037680315,0.00046646837,0.0013362386,0.067173555],"category_scores_gemma":[0.0012232758,0.00034915042,0.00022755221,0.0015438469,0.0018096269,0.0038909803,0.0015068658,0.0028351787,0.0276514],"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.000013798575,0.000053521308,0.00016419447,0.0002049368,0.000007714609,0.000039004106,0.00039902417,0.0003177843,0.00025804705,0.21748129,0.45619047,0.32487032],"study_design_scores_gemma":[0.0000039316456,0.000013402219,0.00035472712,0.00022451355,0.0000033823192,0.00007271739,0.00014863857,0.00022348134,0.00010204504,0.06407959,0.93477017,0.0000034007357],"about_ca_topic_score_codex":0.0016328782,"about_ca_topic_score_gemma":0.004744828,"teacher_disagreement_score":0.067173555,"about_ca_system_score_codex":0.0014097462,"about_ca_system_score_gemma":0.001684306,"threshold_uncertainty_score":0.22471792},"labels":[],"label_agreement":null},{"id":"W4381956191","doi":"10.1007/978-3-031-36272-9_6","title":"Investigating the Utility of Self-explanation Through Translation Activities with a Code-Tracing Tutor","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","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":"Carleton University","funders":"","keywords":"Tracing; Computer science; TUTOR; Code (set theory); TRACE (psycholinguistics); Programming language; Artificial intelligence; Linguistics","score_opus":0.040680946777781155,"score_gpt":0.2753006196332029,"score_spread":0.23461967285542173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381956191","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.9776088,0.000041198033,0.015727192,0.00014197422,0.000024130173,0.00032211296,0.000075218944,0.0009381727,0.0051212087],"genre_scores_gemma":[0.98275846,0.000032414107,0.013975241,0.0000557176,0.0000069547273,0.00020785557,0.00014741893,0.00013364949,0.0026823697],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.993804,0.004192724,0.00031281402,0.00074770226,0.00064145646,0.00030144144],"domain_scores_gemma":[0.8793665,0.10440748,0.0032604397,0.006306318,0.0050160964,0.0016431923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056013106,0.0008101406,0.00060596137,0.00075324485,0.00070734567,0.0025393544,0.0019696981,0.0022519405,0.0063333525],"category_scores_gemma":[0.09396121,0.00046471623,0.0003336832,0.0006147695,0.0007704103,0.0026674212,0.0025294323,0.0012452411,0.0017341346],"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.012815825,0.020320706,0.11377241,0.0019872251,0.00027981916,0.0032729856,0.13949205,0.019257441,0.14069597,0.0054573254,0.00469963,0.5379486],"study_design_scores_gemma":[0.0052956636,0.04181293,0.13110027,0.0009290625,0.0014723125,0.0031986975,0.058453076,0.435445,0.27858305,0.0146924285,0.028376853,0.00064067385],"about_ca_topic_score_codex":0.0016408844,"about_ca_topic_score_gemma":0.0010626798,"teacher_disagreement_score":0.0063333525,"about_ca_system_score_codex":0.0006324925,"about_ca_system_score_gemma":0.0011368396,"threshold_uncertainty_score":0.029622972},"labels":[],"label_agreement":null},{"id":"W4381956297","doi":"10.1007/978-3-031-36272-9_68","title":"How to Repeat Hints: Improving AI-Driven Help in Open-Ended Learning Environments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; Simon Fraser University","funders":"Mitacs","keywords":"Computer science; Focus (optics); Human–computer interaction; Artificial intelligence; Computational thinking; Term (time); Open research; Multimedia; World Wide Web","score_opus":0.02180637181018714,"score_gpt":0.2580973910480388,"score_spread":0.23629101923785167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381956297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12582868,0.0008619275,0.8292798,0.000595321,0.00022483715,0.00035590373,0.00035090226,0.026384061,0.016118484],"genre_scores_gemma":[0.32289803,0.00032694972,0.6600705,0.0002685855,0.000036941237,0.00023715499,0.0007046736,0.0011197726,0.014337391],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987571,0.00038469688,0.00007989133,0.00026883086,0.00041954062,0.00008994759],"domain_scores_gemma":[0.99452424,0.003406404,0.0002645789,0.00064773415,0.00083869166,0.00031840097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010740259,0.00095417205,0.0005333122,0.0004730354,0.0003772896,0.001399691,0.002766096,0.0013998275,0.007915203],"category_scores_gemma":[0.010521463,0.00043201455,0.0003839098,0.0004696252,0.0004260649,0.0032289908,0.0021826916,0.001762884,0.003320958],"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.00072760886,0.00089173194,0.0015407013,0.00037865387,0.000047167217,0.00014372129,0.0012865935,0.014906175,0.023367936,0.002659965,0.00857455,0.9454751],"study_design_scores_gemma":[0.0007418161,0.0025349203,0.009126279,0.0004963346,0.0003892724,0.0009138777,0.0018669623,0.73876536,0.12838575,0.056236375,0.060233116,0.0003100259],"about_ca_topic_score_codex":0.0014183498,"about_ca_topic_score_gemma":0.0022640699,"teacher_disagreement_score":0.007915203,"about_ca_system_score_codex":0.00027473297,"about_ca_system_score_gemma":0.0006043423,"threshold_uncertainty_score":0.026479006},"labels":[],"label_agreement":null},{"id":"W4381956525","doi":"10.1007/978-3-031-36272-9_64","title":"C$$^{2}$$Tutor: Helping People Learn to Avoid Present Bias During Decision Making","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Perfectionism, Procrastination, Anxiety Studies","field":"Psychology","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":"Northern Alberta Institute of Technology; University of Alberta","funders":"","keywords":"Procrastination; TUTOR; Harm; Computer science; Cognition; Term (time); Human–computer interaction; Cognitive bias; Applied psychology; Psychology; Social psychology; Psychiatry","score_opus":0.04256456804839616,"score_gpt":0.3230263116184591,"score_spread":0.280461743570063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381956525","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.012733206,0.0064078076,0.11290539,0.0139883,0.0066706697,0.00025179933,0.0005991814,0.009987181,0.8364566],"genre_scores_gemma":[0.03717312,0.0025360447,0.06238638,0.003905592,0.0007855993,0.00023431072,0.00053677696,0.0010082668,0.8914339],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9998965,0.000034887213,0.0000034594286,0.000014050184,0.00003645265,0.000014592502],"domain_scores_gemma":[0.999572,0.00021963574,0.000017382448,0.000024905643,0.00007081735,0.00009525018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034768574,0.00063324464,0.00028688525,0.00030324908,0.00042654906,0.001096237,0.00073763315,0.0008578978,0.10975119],"category_scores_gemma":[0.0014153059,0.0001565402,0.00021222829,0.00021375524,0.00028927668,0.0011952075,0.0007902243,0.0012745885,0.06511234],"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.00004796217,0.00016795582,0.00015856064,0.00011968728,0.000004973662,0.00006567541,0.0004107678,0.00015780788,0.0013752774,0.005404915,0.56827265,0.4238137],"study_design_scores_gemma":[0.000058305544,0.00021271504,0.0021091814,0.00022604519,0.000018571242,0.0005554359,0.00050027797,0.0029254614,0.0032930465,0.024918111,0.96515244,0.000030401101],"about_ca_topic_score_codex":0.00053984637,"about_ca_topic_score_gemma":0.0021646472,"teacher_disagreement_score":0.10975119,"about_ca_system_score_codex":0.00026079218,"about_ca_system_score_gemma":0.0004811232,"threshold_uncertainty_score":0.3671543},"labels":[],"label_agreement":null},{"id":"W4382243915","doi":"10.1007/978-3-031-36024-4_40","title":"Semi-supervised Learning Approach to Efficient Cut Selection in the Branch-and-Cut Framework","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Machine learning; Selection (genetic algorithm); Integer programming; Metric (unit); Generalizability theory; Mathematical optimization; Supervised learning; Scheduling (production processes); Algorithm; Artificial neural network; Mathematics","score_opus":0.014409711138479048,"score_gpt":0.2259970170748741,"score_spread":0.21158730593639505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382243915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021797065,0.00018912154,0.9962747,0.000095408854,0.000020829943,0.00004140277,0.000074662144,0.0005789713,0.0005451562],"genre_scores_gemma":[0.118522465,0.00032872104,0.8743608,0.00020804728,0.0001886036,0.00040850384,0.0009662824,0.00054864987,0.0044678827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761117,0.0010646066,0.000116807525,0.00044134102,0.00059447065,0.00017160851],"domain_scores_gemma":[0.99261206,0.004863706,0.00033478296,0.0006828715,0.0012860552,0.00022053518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036676428,0.0014554906,0.0035854145,0.0016225027,0.00081009045,0.002236295,0.004856023,0.0024675394,0.005494252],"category_scores_gemma":[0.0071502356,0.001430957,0.0015600786,0.002265929,0.0012938189,0.0027948231,0.0021067967,0.0038985093,0.0014614098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022553267,0.0002600893,0.0005591402,0.00026269804,0.0001457218,0.000071062495,0.00009270878,0.6851726,0.0023040802,0.028538207,0.010366818,0.27200142],"study_design_scores_gemma":[0.000006935803,0.000014246213,0.000032723743,0.0000054387797,0.000005272854,0.000008694064,0.00000417676,0.99027073,0.00025324972,0.009052316,0.0003431382,0.0000030841877],"about_ca_topic_score_codex":0.0049383575,"about_ca_topic_score_gemma":0.006892611,"teacher_disagreement_score":0.005494252,"about_ca_system_score_codex":0.0014948806,"about_ca_system_score_gemma":0.0028521207,"threshold_uncertainty_score":0.019396544},"labels":[],"label_agreement":null},{"id":"W4382338480","doi":"10.1007/978-3-031-36027-5_48","title":"Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"University of Toronto","keywords":"Computer science; Partition (number theory); Modularity (biology); Maximization; Heuristic; Algorithm; Partition problem; Artificial intelligence; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.04970978773629333,"score_gpt":0.29851895620924224,"score_spread":0.2488091684729489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382338480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112900905,0.0010973009,0.8794275,0.00043284247,0.00006941719,0.00013894438,0.00018411248,0.001248425,0.0045006284],"genre_scores_gemma":[0.5086641,0.0002867541,0.48898935,0.00023352419,0.000048698497,0.00016219479,0.00038731968,0.00030379306,0.00092426914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964316,0.0016342096,0.00015426087,0.0006938909,0.0008475343,0.00023843882],"domain_scores_gemma":[0.9850404,0.010695744,0.0011695148,0.0017290864,0.0011054566,0.00025979892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059939628,0.0011206745,0.001449941,0.0022330743,0.0009774771,0.0017705947,0.001987304,0.0013986443,0.0018966331],"category_scores_gemma":[0.025686521,0.0005828347,0.000843291,0.0020337435,0.0013607376,0.0029581476,0.001543101,0.0013297176,0.0007382358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000487137,0.00022645072,0.007682515,0.00044216856,0.0003189751,0.000110442874,0.00026778254,0.69310296,0.008655808,0.032403115,0.0063081766,0.24999441],"study_design_scores_gemma":[0.000028253937,0.00007807339,0.0007904348,0.000038418682,0.000027060632,0.00011270748,0.00005319362,0.9611907,0.004367446,0.032029755,0.0012649163,0.000019040312],"about_ca_topic_score_codex":0.0016144502,"about_ca_topic_score_gemma":0.0023849972,"teacher_disagreement_score":0.0059939628,"about_ca_system_score_codex":0.0015685174,"about_ca_system_score_gemma":0.0012929733,"threshold_uncertainty_score":0.03169948},"labels":[],"label_agreement":null},{"id":"W4382394539","doi":"10.1007/978-3-031-34953-9_34","title":"Modelling of Anti-amyloid-Beta Therapy for Alzheimer’s Disease","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Alzheimer's disease research and treatments","field":"Medicine","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":"Wilfrid Laurier University","funders":"","keywords":"Disease; Neuroscience; Amyloid (mycology); Microglia; Amyloid beta; BETA (programming language); Medicine; Central nervous system; Pathology; Biology; Computer science; Immunology; Inflammation","score_opus":0.09320767560286217,"score_gpt":0.3329071814309343,"score_spread":0.23969950582807212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382394539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07722609,0.009957119,0.80395764,0.0020224918,0.00048269826,0.00010136269,0.0016455309,0.00091836404,0.10368872],"genre_scores_gemma":[0.8305345,0.0072698365,0.07704154,0.00037068932,0.00020165872,0.0002642619,0.0010901525,0.00029638887,0.082930945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991715,0.000028307915,0.000004287058,0.000014653383,0.000025856558,0.000009765894],"domain_scores_gemma":[0.999845,0.00009680686,0.000015658261,0.000009353935,0.00002502949,0.0000082004735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017220665,0.00064100145,0.0007797442,0.0002215414,0.00018267639,0.0008497261,0.00079375674,0.0010422072,0.0042078285],"category_scores_gemma":[0.0005442636,0.0003362608,0.00084172265,0.0002657525,0.000287631,0.00061258435,0.0003906573,0.00051748205,0.00086447067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030502268,0.000013906374,0.00013400089,0.0000719378,0.00002338184,0.000048063754,0.000018797049,0.98089725,0.0019154924,0.0070128767,0.001239428,0.008594372],"study_design_scores_gemma":[0.000008784453,0.000022509654,0.00012438073,0.000014477424,0.000014589775,0.000047817048,0.0000070282044,0.9860388,0.0007261623,0.008919304,0.004068777,0.0000073428555],"about_ca_topic_score_codex":0.0047301804,"about_ca_topic_score_gemma":0.0031607857,"teacher_disagreement_score":0.0047301804,"about_ca_system_score_codex":0.00048616593,"about_ca_system_score_gemma":0.00046019597,"threshold_uncertainty_score":0.014076531},"labels":[],"label_agreement":null},{"id":"W4382394648","doi":"10.1007/978-3-031-34953-9","title":"Bioinformatics and Biomedical Engineering","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundación Pública Andaluza Progreso y Salud; Universidade da Coruña; Universidad de Granada; Karolinska Institutet; Euskal Herriko Unibertsitatea; Universidad Complutense de Madrid; Hong Kong Baptist University; Universitat Pompeu Fabra; York University; Politecnico di Torino; Universiteit Gent; Universidad de Málaga; Ulster University; Cardiff University; New York University Abu Dhabi; Jihočeská Univerzita v Českých Budějovicích; University of Birjand; Shimane University; Universidad de Sevilla; Massachusetts Institute of Technology","keywords":"Biomedicine; Multidisciplinary approach; Computer science; Focus (optics); Volume (thermodynamics); Data science; Bioinformatics; Biology","score_opus":0.007204018711899758,"score_gpt":0.20356881856515133,"score_spread":0.19636479985325156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382394648","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009818971,0.114396356,0.101353034,0.006808175,0.012618661,0.00016354225,0.001037804,0.002851435,0.7597891],"genre_scores_gemma":[0.002972164,0.02807424,0.01573243,0.0018777116,0.0024362784,0.00010258387,0.00069293455,0.00051972875,0.9475921],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999648,0.000045017878,0.000013355535,0.00007161077,0.00019840481,0.00002357265],"domain_scores_gemma":[0.9994535,0.0002092038,0.00002709526,0.00007813574,0.00012999661,0.000102116996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056072656,0.0022538474,0.0017148359,0.0024558054,0.000878812,0.0027480964,0.0010418086,0.0012139983,0.13390042],"category_scores_gemma":[0.0012079651,0.00078219746,0.0007697535,0.0026786267,0.0010080179,0.0026266475,0.0020069163,0.0034980376,0.14173386],"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.00003076019,0.00004559974,0.000090584945,0.0004221123,0.000020679207,0.00006026512,0.00009942569,0.0009980727,0.0027521048,0.040685996,0.5917016,0.36309275],"study_design_scores_gemma":[0.000006849413,0.00003212946,0.000338088,0.00018450424,0.000011048927,0.0002558997,0.000028510252,0.0011117097,0.000574692,0.032122884,0.96532327,0.000010380259],"about_ca_topic_score_codex":0.0007496779,"about_ca_topic_score_gemma":0.002514008,"teacher_disagreement_score":0.13390042,"about_ca_system_score_codex":0.00079511554,"about_ca_system_score_gemma":0.00086870615,"threshold_uncertainty_score":0.44794154},"labels":[],"label_agreement":null},{"id":"W4382407207","doi":"10.1007/978-3-031-34960-7","title":"Bioinformatics and Biomedical Engineering","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundación Pública Andaluza Progreso y Salud; Universidade da Coruña; Universidad de Granada; Karolinska Institutet; Euskal Herriko Unibertsitatea; Universidad Complutense de Madrid; Hong Kong Baptist University; Universitat Pompeu Fabra; York University; Politecnico di Torino; Universiteit Gent; Universidad de Málaga; Ulster University; Cardiff University; New York University Abu Dhabi; Jihočeská Univerzita v Českých Budějovicích; University of Birjand; Shimane University; Universidad de Sevilla; Massachusetts Institute of Technology","keywords":"Biomedicine; Multidisciplinary approach; Computer science; Focus (optics); Volume (thermodynamics); Data science; Bioinformatics; Biology","score_opus":0.007204018711899758,"score_gpt":0.20356881856515133,"score_spread":0.19636479985325156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382407207","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009818971,0.114396356,0.101353034,0.006808175,0.012618661,0.00016354225,0.001037804,0.002851435,0.7597891],"genre_scores_gemma":[0.002972164,0.02807424,0.01573243,0.0018777116,0.0024362784,0.00010258387,0.00069293455,0.00051972875,0.9475921],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999648,0.000045017878,0.000013355535,0.00007161077,0.00019840481,0.00002357265],"domain_scores_gemma":[0.9994535,0.0002092038,0.00002709526,0.00007813574,0.00012999661,0.000102116996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056072656,0.0022538474,0.0017148359,0.0024558054,0.000878812,0.0027480964,0.0010418086,0.0012139983,0.13390042],"category_scores_gemma":[0.0012079651,0.00078219746,0.0007697535,0.0026786267,0.0010080179,0.0026266475,0.0020069163,0.0034980376,0.14173386],"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.00003076019,0.00004559974,0.000090584945,0.0004221123,0.000020679207,0.00006026512,0.00009942569,0.0009980727,0.0027521048,0.040685996,0.5917016,0.36309275],"study_design_scores_gemma":[0.000006849413,0.00003212946,0.000338088,0.00018450424,0.000011048927,0.0002558997,0.000028510252,0.0011117097,0.000574692,0.032122884,0.96532327,0.000010380259],"about_ca_topic_score_codex":0.0007496779,"about_ca_topic_score_gemma":0.002514008,"teacher_disagreement_score":0.13390042,"about_ca_system_score_codex":0.00079511554,"about_ca_system_score_gemma":0.00086870615,"threshold_uncertainty_score":0.44794154},"labels":[],"label_agreement":null},{"id":"W4382703295","doi":"10.1007/978-3-031-36021-3_26","title":"Learning Shape-Preserving Autoencoder for the Reconstruction of Functional Data from Noisy Observations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Concordia University","funders":"","keywords":"Autoencoder; Computer science; Monotonic function; Akaike information criterion; Algorithm; Convexity; Artificial intelligence; A priori and a posteriori; Pattern recognition (psychology); Feature (linguistics); Computational complexity theory; Applied mathematics; Mathematics; Machine learning; Deep learning","score_opus":0.11454102913106962,"score_gpt":0.2810166620462866,"score_spread":0.166475632915217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382703295","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.008063567,0.00017716002,0.9912288,0.000051631632,0.000019307101,0.000006992168,0.000030228688,0.00017202964,0.00025029713],"genre_scores_gemma":[0.33092535,0.001089627,0.6620332,0.00017908763,0.00009863398,0.00010701441,0.0005804786,0.00019297752,0.0047936966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998288,0.00004182447,0.000011546933,0.000047503563,0.00004844395,0.000021868975],"domain_scores_gemma":[0.9994702,0.00031146567,0.00004273247,0.00007628822,0.000076357,0.000022904716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081335916,0.00063605484,0.0009221555,0.0003144862,0.0001704996,0.00052133703,0.00083546597,0.0011940838,0.0009605061],"category_scores_gemma":[0.0019436623,0.0005693335,0.0009211084,0.0005893779,0.0007224273,0.00078245095,0.0009040526,0.0013121857,0.0004897556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014884115,0.00006907895,0.0006618706,0.00016423056,0.00010070233,0.00012500271,0.00008983366,0.56527483,0.028554104,0.015725939,0.0020786235,0.38700697],"study_design_scores_gemma":[0.0000020480911,0.000012905459,0.00009929335,0.000004418088,0.0000052673154,0.000025226298,0.00000250785,0.9959495,0.001706166,0.0019659828,0.00022264433,0.000004024035],"about_ca_topic_score_codex":0.0024406128,"about_ca_topic_score_gemma":0.003153053,"teacher_disagreement_score":0.0024406128,"about_ca_system_score_codex":0.00036044227,"about_ca_system_score_gemma":0.0005631958,"threshold_uncertainty_score":0.0048528314},"labels":[],"label_agreement":null},{"id":"W4382703464","doi":"10.1007/978-3-031-36021-3_36","title":"DeBERTNeXT: A Multimodal Fake News Detection Framework","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","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 Windsor","funders":"","keywords":"Computer science; Misinformation; Benchmark (surveying); Social media; Information retrieval; Fake news; Modalities; Artificial intelligence; World Wide Web; Internet privacy; Computer security","score_opus":0.03034232182579638,"score_gpt":0.306711175244871,"score_spread":0.27636885341907463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382703464","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.011184818,0.0011025873,0.9393782,0.00041924213,0.0001919748,0.00041059486,0.003090397,0.03622773,0.007994439],"genre_scores_gemma":[0.19570976,0.0006917919,0.7677578,0.00049030816,0.00025124397,0.00047512076,0.006448434,0.0017694677,0.02640618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992077,0.00013054798,0.000030356458,0.00021799527,0.0003247336,0.00008870234],"domain_scores_gemma":[0.99923015,0.00032557105,0.000052535386,0.00015796903,0.00017567648,0.000058078935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013090089,0.0016084012,0.0015668299,0.002401404,0.0008092753,0.0021306705,0.0025327203,0.0018663158,0.012503039],"category_scores_gemma":[0.003444786,0.000640722,0.0012518776,0.0010439666,0.0005370685,0.0024596562,0.0028731946,0.00172456,0.0045433696],"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.0008886823,0.00056305627,0.002937248,0.0004178837,0.00036397442,0.000416581,0.00022902049,0.051027216,0.017611938,0.016901704,0.06672647,0.84191626],"study_design_scores_gemma":[0.00005123927,0.00009880857,0.0008614905,0.00004309326,0.000106004605,0.00021548088,0.00007025084,0.9523259,0.009741028,0.018211601,0.01821564,0.000059510676],"about_ca_topic_score_codex":0.012128993,"about_ca_topic_score_gemma":0.020479279,"teacher_disagreement_score":0.012503039,"about_ca_system_score_codex":0.000864909,"about_ca_system_score_gemma":0.001237662,"threshold_uncertainty_score":0.041826785},"labels":[],"label_agreement":null},{"id":"W4383212485","doi":"10.1007/978-3-031-35949-1","title":"Formal Concept Analysis","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Frankfurt University of Applied Sciences; Université de La Réunion; Université Paris 13; Université de Montpellier; Universidad Técnica Federico Santa María; Université de Strasbourg; Debreceni Egyetem; Technische Universität Dresden; Université du Québec à Montréal; Universidad de Málaga","keywords":"Computer science; Programming language; Software engineering","score_opus":0.01678793075763913,"score_gpt":0.2519678243140424,"score_spread":0.23517989355640329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383212485","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.004082732,0.009043035,0.69704384,0.0042858804,0.0012347997,0.00021176245,0.001171117,0.0008027382,0.2821241],"genre_scores_gemma":[0.25648448,0.01040777,0.4411299,0.0020613577,0.0018241677,0.0008953754,0.0041155773,0.00088367175,0.28219774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877554,0.00032688328,0.00008522293,0.00027991371,0.00046086902,0.000071498274],"domain_scores_gemma":[0.99920803,0.00037980653,0.00003117951,0.00015861708,0.00019856333,0.000023812525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013978851,0.0008850827,0.0007951955,0.0022913509,0.0013050914,0.0042942977,0.0010720815,0.000641838,0.032346245],"category_scores_gemma":[0.0026370601,0.00055042247,0.0011848367,0.002362724,0.0027798342,0.005600888,0.0016979058,0.0026244048,0.010656969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005434468,0.000010386063,0.000031337873,0.00007935906,0.000008268268,0.000024363426,0.00017968842,0.000356796,0.00025663516,0.9527423,0.010598944,0.035706468],"study_design_scores_gemma":[0.0000030862727,0.0000044477692,0.000045398923,0.000037317008,0.000007647126,0.00006125562,0.000062334344,0.0014369731,0.0002714206,0.9220367,0.076029114,0.0000043945547],"about_ca_topic_score_codex":0.00076454185,"about_ca_topic_score_gemma":0.00053304975,"teacher_disagreement_score":0.032346245,"about_ca_system_score_codex":0.0016828849,"about_ca_system_score_gemma":0.001005765,"threshold_uncertainty_score":0.108208954},"labels":[],"label_agreement":null},{"id":"W4383335034","doi":"10.1007/978-3-031-37765-5_5","title":"Comparing Causal Convergence Consistency Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Causal consistency; Computer science; Consistency (knowledge bases); Consistency model; Sequential consistency; Formalism (music); Sequence (biology); Data consistency; Partition (number theory); Theoretical computer science; Strong consistency; Weak consistency; Convergence (economics); Data mining; Distributed computing; Artificial intelligence; Mathematics; Statistics","score_opus":0.04546782967617297,"score_gpt":0.25517286107405673,"score_spread":0.20970503139788377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383335034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076789066,0.0011501455,0.8753215,0.0017927991,0.00030899027,0.00013683981,0.00040058832,0.0007733909,0.043326583],"genre_scores_gemma":[0.90511084,0.0009153896,0.08204811,0.00041301866,0.00027063108,0.00029817582,0.0010067993,0.000551058,0.009385996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902658,0.0063011236,0.0003168641,0.0009460943,0.0016264945,0.000543678],"domain_scores_gemma":[0.8613203,0.11406928,0.003818551,0.013075345,0.006688275,0.0010281471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01658207,0.0009613278,0.0014706854,0.002794147,0.0011226364,0.0038989072,0.0033932647,0.0023949698,0.016019404],"category_scores_gemma":[0.102250636,0.0009341145,0.0019402363,0.0029892568,0.0033277962,0.0076663024,0.0031552447,0.0031296322,0.0011125734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049354695,0.000116012976,0.0016026915,0.00014973557,0.0001247825,0.000050309296,0.00023177217,0.12704204,0.00027134924,0.8270952,0.002954058,0.039868418],"study_design_scores_gemma":[0.00004711992,0.000075317526,0.00042412902,0.000049571172,0.00005657297,0.00002665868,0.00012739802,0.21280695,0.0004218738,0.78439766,0.0015438818,0.00002292153],"about_ca_topic_score_codex":0.0023450481,"about_ca_topic_score_gemma":0.0014335102,"teacher_disagreement_score":0.01658207,"about_ca_system_score_codex":0.0024763707,"about_ca_system_score_gemma":0.0021319564,"threshold_uncertainty_score":0.08769542},"labels":[],"label_agreement":null},{"id":"W4383424622","doi":"10.1007/978-3-031-36183-8_10","title":"Deep Learning Based Camera Switching for Sports Broadcasting","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Broadcasting (networking); Artificial intelligence; Ice hockey; Scheme (mathematics); Computer vision; Tracking (education); Smart camera; Deep learning; Computer security","score_opus":0.016927834695568248,"score_gpt":0.24213651291329982,"score_spread":0.22520867821773158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383424622","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.107000746,0.003032471,0.860308,0.00043917916,0.00049231347,0.000117736236,0.0013051213,0.005977244,0.02132723],"genre_scores_gemma":[0.7305688,0.0013730129,0.22241688,0.0003063695,0.00026570263,0.000071160284,0.0025755544,0.00043409833,0.041988406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998565,0.000014221227,0.000004065034,0.000045130277,0.000036075824,0.000043938602],"domain_scores_gemma":[0.99987316,0.000038835762,0.000010510299,0.00002248409,0.00003569947,0.000019241585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020470569,0.00054262445,0.00067610276,0.0005012538,0.00025377359,0.0004821667,0.0008045884,0.0005442911,0.007955516],"category_scores_gemma":[0.0004471852,0.00025140218,0.0004272146,0.0006193308,0.00016208708,0.00056027726,0.00041133037,0.001235475,0.0016377377],"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.00051436323,0.0002487386,0.0008492516,0.00010397257,0.00007088596,0.00008255036,0.00004010901,0.081516415,0.028658498,0.0031243246,0.012004989,0.8727859],"study_design_scores_gemma":[0.000017450999,0.00007976878,0.00068862445,0.000011491224,0.00002857138,0.000038218514,0.00002080887,0.9842291,0.009543747,0.0020679096,0.0032653837,0.000009005477],"about_ca_topic_score_codex":0.011787455,"about_ca_topic_score_gemma":0.01961151,"teacher_disagreement_score":0.011787455,"about_ca_system_score_codex":0.00057156733,"about_ca_system_score_gemma":0.00059918396,"threshold_uncertainty_score":0.026613891},"labels":[],"label_agreement":null},{"id":"W4383424630","doi":"10.1007/978-3-031-36183-8_9","title":"Unified Emulation-Simulation Training Environment for Autonomous Cyber Agents","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Carleton University; Queen's University; Defence Research and Development Canada","funders":"","keywords":"Emulation; Computer science; Reinforcement learning; Fidelity; Process (computing); Artificial intelligence; Human–computer interaction; Intelligent agent; Simulation; Distributed computing; Operating system","score_opus":0.06123982952119357,"score_gpt":0.2813513022896291,"score_spread":0.22011147276843557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383424630","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.0049676783,0.00004319881,0.98217946,0.000038899827,0.000026529806,0.00004268376,0.00008316765,0.0073324256,0.0052859127],"genre_scores_gemma":[0.26058185,0.00017907142,0.7218504,0.000097711054,0.000032135267,0.00057147106,0.0008183271,0.0017189906,0.014150068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997775,0.000066080676,0.000012254089,0.00003905835,0.00007378077,0.000031369153],"domain_scores_gemma":[0.9997409,0.00009375961,0.000016267299,0.00006309929,0.000052555974,0.00003347409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048351276,0.00082087883,0.0007361879,0.0003964325,0.00043126877,0.00070243614,0.0020457122,0.00092494057,0.015636403],"category_scores_gemma":[0.00079379947,0.00042981262,0.0005620776,0.00025056012,0.00043777155,0.00089044264,0.0018070793,0.0010669271,0.0030567003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037538056,0.0002595047,0.0006481839,0.00014223266,0.000042056647,0.00021552017,0.00018865889,0.77677524,0.016529983,0.053004205,0.009306974,0.14251204],"study_design_scores_gemma":[0.00002669366,0.000036378824,0.00007245302,0.000009532661,0.000006378344,0.000036141948,0.000007637069,0.9837388,0.0040768846,0.005250803,0.0067303344,0.000008080888],"about_ca_topic_score_codex":0.0015163544,"about_ca_topic_score_gemma":0.0018151306,"teacher_disagreement_score":0.015636403,"about_ca_system_score_codex":0.00035668354,"about_ca_system_score_gemma":0.00071607844,"threshold_uncertainty_score":0.052309036},"labels":[],"label_agreement":null},{"id":"W4383427084","doi":"10.1007/978-3-031-36183-8_4","title":"iPerfOPS: A Tool for Machine Learning-Based Optimization Through Protocol Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","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":"Computer science; Throughput; Protocol (science); Network congestion; Transmission Control Protocol; Selection (genetic algorithm); Computer network; Distributed computing; Machine learning; Artificial intelligence; Operating system; Network packet","score_opus":0.017420031207495884,"score_gpt":0.25829255529611905,"score_spread":0.24087252408862317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383427084","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.0014167539,0.00021248814,0.94319123,0.000100644895,0.000143641,0.000061614235,0.00075961667,0.050198175,0.0039158734],"genre_scores_gemma":[0.06621114,0.0004961211,0.9051165,0.0003105277,0.00015236631,0.00070097053,0.0026182095,0.013121758,0.0112723345],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941814,0.00016514334,0.000041088068,0.00010043098,0.00021335499,0.000061783816],"domain_scores_gemma":[0.99869066,0.0009650182,0.00006202571,0.00014103444,0.000104943014,0.000036368092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012256696,0.001651111,0.0010245573,0.0010759486,0.00047195246,0.0011546132,0.002290221,0.0010908492,0.035084456],"category_scores_gemma":[0.0036116885,0.0009279334,0.0010933517,0.00096614606,0.00043453876,0.0015289794,0.0011215615,0.002449284,0.00826252],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048957614,0.00024170431,0.00082629884,0.0007390243,0.00024416472,0.00022324403,0.00011440475,0.2871752,0.005621104,0.038281247,0.14840785,0.51763606],"study_design_scores_gemma":[0.00008647032,0.000036011697,0.00012332905,0.00003791367,0.000022941435,0.00007003882,0.000007866064,0.94662195,0.00519286,0.0205993,0.027177341,0.000023908386],"about_ca_topic_score_codex":0.0016035006,"about_ca_topic_score_gemma":0.0023896121,"teacher_disagreement_score":0.035084456,"about_ca_system_score_codex":0.00048193816,"about_ca_system_score_gemma":0.0008225846,"threshold_uncertainty_score":0.117369175},"labels":[],"label_agreement":null},{"id":"W4383612918","doi":"10.1007/978-3-031-35389-5_19","title":"A Bridge Inspection Task Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","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":"National Research Council Canada","funders":"","keywords":"Bridge (graph theory); Computer science; Task (project management); Drone; Visual inspection; Set (abstract data type); Artificial intelligence; Systems engineering; Engineering","score_opus":0.010937255048155167,"score_gpt":0.22186015654835464,"score_spread":0.2109229015001995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383612918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061040424,0.00067333085,0.8985897,0.0007801637,0.00020634619,0.00078489503,0.006027778,0.009385627,0.022511696],"genre_scores_gemma":[0.31297752,0.00042697415,0.6293265,0.00023103377,0.00013821678,0.00058238796,0.013730018,0.0010370174,0.04155028],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9985441,0.00020606442,0.00007514294,0.00037591415,0.00060097355,0.00019784921],"domain_scores_gemma":[0.9983235,0.00070309744,0.00007184785,0.00029268404,0.0005386613,0.00007021751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012409454,0.0012872466,0.00090909284,0.0027489604,0.0011357026,0.0018834225,0.0014352027,0.0010194397,0.015079475],"category_scores_gemma":[0.0040035453,0.0005167639,0.0016477604,0.0021314349,0.0003335693,0.0020485013,0.0014980357,0.0013178883,0.0051175808],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058714196,0.0006391772,0.0069348793,0.00029263875,0.00010160283,0.00024183372,0.000256405,0.040184647,0.01363363,0.016051712,0.05154435,0.869532],"study_design_scores_gemma":[0.000039230777,0.00021798462,0.007858651,0.00006737166,0.00008603254,0.00024092324,0.00031176308,0.9261618,0.010898853,0.03192349,0.022145852,0.000048003472],"about_ca_topic_score_codex":0.009592159,"about_ca_topic_score_gemma":0.009679788,"teacher_disagreement_score":0.015079475,"about_ca_system_score_codex":0.00093788054,"about_ca_system_score_gemma":0.0023742307,"threshold_uncertainty_score":0.050445855},"labels":[],"label_agreement":null},{"id":"W4383616326","doi":"10.1007/978-3-031-35634-6_45","title":"Investigating the Role of Vection, Presence, and Stress on Visually Induced Motion Sickness","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Toronto Rehabilitation Institute; Toronto Metropolitan University; University Health Network","funders":"","keywords":"Motion sickness; Stimulus (psychology); Anxiety; Psychology; Audiology; Medicine; Cognitive psychology; Psychiatry","score_opus":0.02875784282808909,"score_gpt":0.27567420153662753,"score_spread":0.24691635870853845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616326","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.99275184,0.0029972144,0.0014135038,0.00011355997,0.000021229751,0.000030002398,0.00006730772,0.0000070398473,0.0025982303],"genre_scores_gemma":[0.99537367,0.0016518745,0.000765305,0.000048675465,0.000024061244,0.000029998753,0.00007947366,0.0000051268594,0.0020217581],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9999379,0.000025828973,0.0000023363737,0.0000073142596,0.0000139381245,0.000012674539],"domain_scores_gemma":[0.9997676,0.00016585746,0.000026417934,0.000005664948,0.000012147608,0.000022222637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021185081,0.00021578764,0.00018016074,0.000120265766,0.00007434338,0.00030239942,0.00018421598,0.00023484971,0.002528379],"category_scores_gemma":[0.00058047555,0.00008243472,0.0001778555,0.00010706883,0.00019867424,0.00024031063,0.00021579547,0.0002651092,0.00011542586],"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.01515117,0.0024391604,0.054810524,0.0010356174,0.00025882953,0.00057357945,0.0013231615,0.0024491085,0.70324945,0.003046506,0.0011179522,0.21454486],"study_design_scores_gemma":[0.0004552242,0.029565383,0.9061292,0.0002372072,0.0004323881,0.00073175423,0.0015804889,0.008105851,0.044774964,0.0044757547,0.0034656823,0.000046085075],"about_ca_topic_score_codex":0.0010715991,"about_ca_topic_score_gemma":0.0018797499,"teacher_disagreement_score":0.002528379,"about_ca_system_score_codex":0.00011581858,"about_ca_system_score_gemma":0.0002822942,"threshold_uncertainty_score":0.008458257},"labels":[],"label_agreement":null},{"id":"W4383616338","doi":"10.1007/978-3-031-35822-7_31","title":"Understanding Older Adults’ Safety Perceptions and Risk Mitigation Strategies when Accessing Online Services","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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; University of Toronto","funders":"","keywords":"Affect (linguistics); Perception; Vulnerability (computing); Risk perception; The Internet; Internet privacy; Business; Computer security; Psychology; Computer science; World Wide Web","score_opus":0.035639192559533135,"score_gpt":0.293479428120607,"score_spread":0.2578402355610739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616338","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.9949693,0.00047541526,0.00019282885,0.00044237913,0.000011345292,0.000009068109,0.000038455768,0.000002082586,0.003859055],"genre_scores_gemma":[0.9969687,0.00075014686,0.00030102424,0.0002444536,0.000010912648,0.000016005088,0.000062321014,0.0000013729433,0.0016451448],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9996867,0.000080195416,0.000024066541,0.000033867484,0.000090007874,0.00008520035],"domain_scores_gemma":[0.9979825,0.0009075132,0.0005268834,0.00003960193,0.0002768733,0.00026658634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011447464,0.00019021209,0.00019463767,0.00039568343,0.0005486675,0.0019345199,0.0002403936,0.00059993454,0.0031148721],"category_scores_gemma":[0.005137634,0.00016149867,0.0003842364,0.0003584076,0.00036205276,0.0018958171,0.00088519737,0.0009974089,0.0002912673],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016038727,0.0010571547,0.688793,0.00024770424,0.00010083752,0.00035351166,0.19367145,0.00018720565,0.0012478519,0.0017329558,0.0023132514,0.110134654],"study_design_scores_gemma":[0.0000128271495,0.0004322416,0.807585,0.0003442371,0.00009061737,0.00022293262,0.18298215,0.000471929,0.00035572387,0.001761568,0.0057133483,0.000027468202],"about_ca_topic_score_codex":0.015731357,"about_ca_topic_score_gemma":0.025895353,"teacher_disagreement_score":0.015731357,"about_ca_system_score_codex":0.00062128,"about_ca_system_score_gemma":0.0008608108,"threshold_uncertainty_score":0.031279624},"labels":[],"label_agreement":null},{"id":"W4383616412","doi":"10.1007/978-3-031-35017-7_30","title":"Raising Cybersecurity Awareness Through Electronic Word of Mouth: A Data-Driven Assessment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Social media; Raising (metalworking); Internet privacy; Computer security; Identity theft; World Wide Web; Engineering","score_opus":0.09551487473768498,"score_gpt":0.38079460447144764,"score_spread":0.28527972973376264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616412","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.9397922,0.0010660208,0.019482525,0.0010033974,0.00010392297,0.0026159151,0.0020682504,0.00024992763,0.033617776],"genre_scores_gemma":[0.96575004,0.0006477159,0.024478089,0.00032943877,0.000026616615,0.0011110556,0.0012625422,0.000061315885,0.0063332347],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9914253,0.0040304046,0.00047790428,0.00055859424,0.0031812936,0.00032648127],"domain_scores_gemma":[0.9250322,0.054134633,0.0039732317,0.002001211,0.013725746,0.0011330763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01159216,0.0007178625,0.00058325485,0.0025852728,0.0006187143,0.0037465345,0.0011787652,0.0016300698,0.0047908206],"category_scores_gemma":[0.053882003,0.00033864434,0.00078210654,0.0015190656,0.00090797606,0.00574869,0.0026352948,0.0010490833,0.0018544119],"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.008681099,0.0069964286,0.22484401,0.0043748636,0.0007306203,0.00032888763,0.013871555,0.007890557,0.0141643975,0.0138183,0.0068201884,0.6974791],"study_design_scores_gemma":[0.0012367462,0.04198451,0.49925372,0.0037728597,0.003810606,0.0013118235,0.04635675,0.1891704,0.10024849,0.039991163,0.072074816,0.0007880807],"about_ca_topic_score_codex":0.0018076443,"about_ca_topic_score_gemma":0.001333946,"teacher_disagreement_score":0.01159216,"about_ca_system_score_codex":0.0013097103,"about_ca_system_score_gemma":0.001611665,"threshold_uncertainty_score":0.06130594},"labels":[],"label_agreement":null},{"id":"W4383616533","doi":"10.1007/978-3-031-34917-1_11","title":"Privacy, Technology and Telehealth: Canadian Older Adults Voice Their Concerns","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":true,"ca_institutions":"Concordia University","funders":"","keywords":"Telehealth; Internet privacy; Context (archaeology); Realm; Health care; Information privacy; Relation (database); Information sharing; Exploratory research; Psychology; Computer science; Telemedicine; World Wide Web; Sociology; Political science","score_opus":0.025479543881394673,"score_gpt":0.2823136766353659,"score_spread":0.2568341327539712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616533","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.29339844,0.046709273,0.00044500516,0.52141994,0.0026036394,0.000050619357,0.0011739926,0.000044836263,0.13415426],"genre_scores_gemma":[0.79236525,0.0547759,0.00062106474,0.08036976,0.0006021207,0.00003983977,0.0004715059,0.000080608355,0.070673876],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9982318,0.00017195503,0.000048795733,0.00008273153,0.0007248537,0.0007399394],"domain_scores_gemma":[0.99552613,0.0008492125,0.00035696774,0.00006487012,0.0014109641,0.0017918987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025299545,0.00033506445,0.00037852494,0.001453851,0.016169636,0.0071035083,0.0009594991,0.004990164,0.009535204],"category_scores_gemma":[0.006079049,0.00032252935,0.0004590297,0.0067472328,0.0050193924,0.003468651,0.0029909073,0.007004024,0.0006204161],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012752338,0.00007597345,0.0483296,0.0002825331,0.00002477766,0.0013269897,0.54012257,0.00010482106,0.00043388366,0.0300127,0.26136434,0.11779429],"study_design_scores_gemma":[0.000021288199,0.000036802954,0.04687522,0.0005809544,0.000035201083,0.00067396974,0.50677675,0.00006239895,0.00007849904,0.0017514385,0.44303435,0.000073175215],"about_ca_topic_score_codex":0.98853046,"about_ca_topic_score_gemma":0.99413496,"teacher_disagreement_score":0.03771884,"about_ca_system_score_codex":0.03771884,"about_ca_system_score_gemma":0.0752807,"threshold_uncertainty_score":0.2736706},"labels":[],"label_agreement":null},{"id":"W4383616598","doi":"10.1007/978-3-031-35908-8_8","title":"Objective Metrics for Assessing Visual Complexity of Vehicle Dashboards: A Machine-Learning Based Study","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"McGill University","funders":"Institute of Psychology, Chinese Academy of Sciences; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Computer science; Dashboard; Animation; Visualization; Machine learning; Component (thermodynamics); Visual analytics; Human–computer interaction; Key (lock); Artificial intelligence; Data science","score_opus":0.0687990459284526,"score_gpt":0.35312753489081666,"score_spread":0.28432848896236407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616598","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.8740805,0.0011002187,0.11703034,0.0000796908,0.00004749764,0.00025353304,0.0018250298,0.00044043933,0.0051427186],"genre_scores_gemma":[0.9664769,0.00027918923,0.030688679,0.000010733173,0.000020324402,0.00010123886,0.001542681,0.00007401533,0.0008062626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996606,0.00083123345,0.00039160764,0.0004145837,0.0015890116,0.0001675715],"domain_scores_gemma":[0.9445924,0.040382203,0.006106277,0.0019318524,0.006037186,0.00095007435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002836488,0.0008954083,0.00049373746,0.006157989,0.0004577623,0.0025776448,0.0007386802,0.0007682472,0.0024904392],"category_scores_gemma":[0.02701607,0.00025650606,0.0006597693,0.0050061042,0.00060020824,0.003931508,0.0010178229,0.0007848301,0.00044216032],"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.0022025756,0.0016455299,0.43884766,0.0012609588,0.0007034804,0.00027304055,0.0023265309,0.07808492,0.018394377,0.006363771,0.0042025065,0.44569466],"study_design_scores_gemma":[0.00007694476,0.0026595795,0.4233393,0.00025207398,0.00031199155,0.0006051578,0.0041405116,0.5400004,0.016752597,0.008466091,0.0031899998,0.00020538952],"about_ca_topic_score_codex":0.0031236429,"about_ca_topic_score_gemma":0.0033818784,"teacher_disagreement_score":0.006157989,"about_ca_system_score_codex":0.0009509782,"about_ca_system_score_gemma":0.0005204404,"threshold_uncertainty_score":0.015000939},"labels":[],"label_agreement":null},{"id":"W4383616671","doi":"10.1007/978-3-031-34735-1_24","title":"Towards Application of Adaptive Instructional Systems in Simulation-Based Lifeboat Training Using Bayesian Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"National Research Council Canada; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Pace; Competence (human resources); Training system; Training (meteorology); Probabilistic logic; Simulation training; Strengths and weaknesses; Bayesian network; Simulation; Engineering management; Artificial intelligence; Engineering; Psychology","score_opus":0.062255540574385225,"score_gpt":0.3447166767574368,"score_spread":0.2824611361830516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007930562,0.00016169954,0.9891466,0.00009631288,0.000016769804,0.000038438855,0.000015901214,0.00038046337,0.0022131521],"genre_scores_gemma":[0.39321947,0.00045119712,0.6013826,0.000057191348,0.000025406745,0.00018076428,0.00008760968,0.00012351693,0.004472199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964654,0.00015767763,0.000018317134,0.000070502865,0.00008189184,0.000025001289],"domain_scores_gemma":[0.9989385,0.0007769245,0.00004499649,0.000060894527,0.00014712752,0.000031493902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011030597,0.0004062337,0.0004968366,0.0004279783,0.00025357815,0.00094459695,0.0010675407,0.0008709067,0.0033178646],"category_scores_gemma":[0.0036633464,0.00045877663,0.0004661306,0.00042237743,0.00034616268,0.00093219266,0.0010519826,0.0009607542,0.0005647606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015259098,0.00017597803,0.0009996684,0.000097654876,0.0000685317,0.000049562947,0.00017775752,0.6820948,0.007794567,0.021249559,0.0010223441,0.28611693],"study_design_scores_gemma":[0.000005433568,0.000013142546,0.00014234617,0.00001102975,0.000008419871,0.0000072818875,0.0000076044576,0.9951184,0.0009652184,0.0030111303,0.00070677086,0.000003373962],"about_ca_topic_score_codex":0.007288429,"about_ca_topic_score_gemma":0.0067068264,"teacher_disagreement_score":0.007288429,"about_ca_system_score_codex":0.00069309695,"about_ca_system_score_gemma":0.0008014494,"threshold_uncertainty_score":0.014492035},"labels":[],"label_agreement":null},{"id":"W4383616727","doi":"10.1007/978-3-031-35596-7_21","title":"Measurements of Complexity in Vehicle Dashboards: Revision and Validation of the Perceived Visual Complexity Scale","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color perception and design","field":"Psychology","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":"Cronbach's alpha; Reliability (semiconductor); Confirmatory factor analysis; Computer science; Scale (ratio); Cognitive complexity; Validity; Criterion validity; Applied psychology; Psychology; Cognition; Construct validity; Cognitive psychology; Psychometrics; Machine learning; Structural equation modeling; Clinical psychology","score_opus":0.15940278494110866,"score_gpt":0.3623975202881747,"score_spread":0.20299473534706602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616727","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.93134874,0.0006818913,0.057328064,0.00021641247,0.00029309103,0.00041930776,0.0007733229,0.00024920376,0.008689954],"genre_scores_gemma":[0.9703739,0.00025358328,0.026432246,0.00009064341,0.000044853645,0.0003217114,0.0005967667,0.00012206458,0.0017642098],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9933868,0.002038751,0.0006306691,0.0008283446,0.002955378,0.00015995695],"domain_scores_gemma":[0.9446866,0.027311267,0.0033146564,0.0068382886,0.017175846,0.0006733555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007665726,0.0006582512,0.00030035165,0.0018579254,0.0004546933,0.0017784348,0.0014573844,0.00081675634,0.0020362176],"category_scores_gemma":[0.048718598,0.00037027133,0.00070638506,0.0012876722,0.0010683144,0.0015352571,0.0016288225,0.0010887095,0.00076331594],"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.0014456717,0.00079442735,0.38733417,0.0005894325,0.00035139488,0.0001683608,0.0077008056,0.0043654856,0.055631712,0.0043010707,0.0045923307,0.5327251],"study_design_scores_gemma":[0.000084483014,0.0014810124,0.938426,0.00027691724,0.00020566263,0.00049551553,0.0036230106,0.013374442,0.027896639,0.0033288875,0.010615095,0.0001922983],"about_ca_topic_score_codex":0.0041303183,"about_ca_topic_score_gemma":0.0047630053,"teacher_disagreement_score":0.007665726,"about_ca_system_score_codex":0.0008343752,"about_ca_system_score_gemma":0.0006749427,"threshold_uncertainty_score":0.040540695},"labels":[],"label_agreement":null},{"id":"W4383616783","doi":"10.1007/978-3-031-35602-5_14","title":"Moral Dilemmas in Social Robots: An Exploratory Study for Future Research","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","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":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Harm; Exploratory research; Robot; Process (computing); Affect (linguistics); Computer science; Engineering ethics; Psychology; Public relations; Political science; Social psychology; Sociology; Artificial intelligence; Engineering; Social science","score_opus":0.25593934740646973,"score_gpt":0.45421537907709186,"score_spread":0.19827603167062213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616783","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.8861855,0.00069439306,0.009463017,0.0038515707,0.00007982535,0.0005434705,0.00008163907,0.000033783814,0.0990668],"genre_scores_gemma":[0.99114203,0.00026424852,0.0033340857,0.00020421726,0.000016941694,0.0002943189,0.000026383794,0.00001686892,0.0047008484],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404657,0.004763518,0.000072345385,0.0002773927,0.0005030549,0.00033706916],"domain_scores_gemma":[0.9828315,0.013946581,0.0010693637,0.0004928861,0.000868066,0.00079171493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006238075,0.00040491126,0.00045501455,0.0011550137,0.005932844,0.007195501,0.0015999577,0.002559971,0.0075529576],"category_scores_gemma":[0.024811592,0.0003102453,0.0004196491,0.0011883106,0.009259689,0.008112606,0.0027990087,0.0035740312,0.0005644264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032565094,0.0026084357,0.029790508,0.000671577,0.000033519977,0.002868712,0.568563,0.0012221098,0.0019840905,0.3368366,0.0055160555,0.049579624],"study_design_scores_gemma":[0.00006294039,0.00032775386,0.01703655,0.0003086757,0.000018792382,0.001637896,0.8425746,0.0052246335,0.000877416,0.098160945,0.033719953,0.00004983925],"about_ca_topic_score_codex":0.0016298278,"about_ca_topic_score_gemma":0.0026240891,"teacher_disagreement_score":0.0075529576,"about_ca_system_score_codex":0.0029273068,"about_ca_system_score_gemma":0.0023123382,"threshold_uncertainty_score":0.032990456},"labels":[],"label_agreement":null},{"id":"W4383616787","doi":"10.1007/978-3-031-34735-1_1","title":"Improving Students’ Self-awareness by Analyzing Course Discussion Forum Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Athabasca University","funders":"","keywords":"Computer science; Dashboard; Quality (philosophy); Sentiment analysis; Massive open online course; Multimedia; Mathematics education; World Wide Web; Data science; Psychology; Artificial intelligence","score_opus":0.0208006370551299,"score_gpt":0.3080538344367923,"score_spread":0.2872531973816624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616787","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.964295,0.00029729944,0.029282995,0.0002200609,0.00008709252,0.00006771539,0.00054186577,0.0014419901,0.0037658396],"genre_scores_gemma":[0.98155767,0.000085698404,0.016422631,0.000027888931,0.000055209024,0.00002982513,0.0005997898,0.00005481257,0.0011664947],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987978,0.00042909067,0.000064587664,0.00030010985,0.00030775843,0.00010069327],"domain_scores_gemma":[0.9861687,0.009594901,0.0013528751,0.00091428315,0.0013543902,0.0006149072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018777488,0.00047742677,0.00040559543,0.0020653945,0.00031057498,0.001969892,0.00039014095,0.0005495617,0.0016544824],"category_scores_gemma":[0.011762496,0.00021638762,0.00036257887,0.0010715328,0.00013462217,0.0017036647,0.0009448324,0.00074824545,0.0009222289],"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.0007226039,0.0017422196,0.2690497,0.0002626042,0.00026162007,0.000077634686,0.0023972765,0.0024960584,0.036964007,0.00048687786,0.0051557976,0.6803837],"study_design_scores_gemma":[0.00009900834,0.0020971631,0.71015584,0.00013940832,0.0006080741,0.0005179379,0.004200425,0.1802403,0.08583528,0.0047021606,0.011178776,0.00022548434],"about_ca_topic_score_codex":0.0004948883,"about_ca_topic_score_gemma":0.00088457984,"teacher_disagreement_score":0.0020653945,"about_ca_system_score_codex":0.0001936765,"about_ca_system_score_gemma":0.00029373472,"threshold_uncertainty_score":0.009930611},"labels":[],"label_agreement":null},{"id":"W4383616840","doi":"10.1007/978-3-031-34866-2_37","title":"Immersive VR for Training Cognition in Seniors with Neurological Disorders","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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 Manitoba","funders":"","keywords":"Neurocognitive; Headset; Virtual reality; Computer science; Cognition; Rehabilitation; Task (project management); Multimedia; Trainer; Human–computer interaction; Medicine; Physical therapy; Engineering; Psychiatry","score_opus":0.025308098695220316,"score_gpt":0.2713192328198085,"score_spread":0.2460111341245882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616840","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.1877114,0.21653718,0.15531063,0.0058441525,0.005450244,0.00031077056,0.0007945747,0.0023266862,0.4257143],"genre_scores_gemma":[0.34330308,0.13133138,0.08077885,0.002552587,0.0014145145,0.0004092034,0.00067638763,0.00023558676,0.43929836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99995065,0.000009950242,0.000002232143,0.000006809734,0.000019333134,0.000010976814],"domain_scores_gemma":[0.9999306,0.000046185258,0.0000025609743,0.000002731897,0.0000055646306,0.000012365293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001920302,0.00051027955,0.00020395406,0.0001959624,0.00010250256,0.0004766442,0.0005145908,0.0004730864,0.01872234],"category_scores_gemma":[0.00021637235,0.00008494556,0.00027902122,0.0001593878,0.00016405353,0.0003911511,0.0005923728,0.0007666218,0.0017758404],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012335129,0.0006925735,0.00022526422,0.00072986796,0.000031292664,0.00039824875,0.001053385,0.00060543674,0.0155782,0.004264013,0.03917695,0.93712133],"study_design_scores_gemma":[0.00035069464,0.006598331,0.025535524,0.0034340704,0.00022184283,0.012186785,0.0039232983,0.0063805394,0.016314058,0.024266507,0.9006714,0.000116825824],"about_ca_topic_score_codex":0.0004338676,"about_ca_topic_score_gemma":0.0016881782,"teacher_disagreement_score":0.01872234,"about_ca_system_score_codex":0.0000917478,"about_ca_system_score_gemma":0.00018238818,"threshold_uncertainty_score":0.06263244},"labels":[],"label_agreement":null},{"id":"W4383616940","doi":"10.1007/978-3-031-34735-1_9","title":"Cognitive Simulations for Adaptive Instructional Systems: Exploring Instruction Strategies with Simulated Tutors and Learners","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Memorial University of Newfoundland; National Research Council Canada","funders":"","keywords":"Computer science; Human–computer interaction; Procedural knowledge; Instructional design; Domain (mathematical analysis); Artificial intelligence; Knowledge base; Multimedia","score_opus":0.06221999829374296,"score_gpt":0.26745976724853565,"score_spread":0.20523976895479268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616940","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.78034663,0.0011587726,0.18167526,0.0010724829,0.00005690481,0.00032350168,0.00013928316,0.00025364952,0.03497342],"genre_scores_gemma":[0.9594515,0.00033732,0.036747135,0.000067982546,0.000007178927,0.00027137424,0.00008685844,0.000029954557,0.0030007614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993249,0.0005253982,0.000014541829,0.00004525256,0.000060149196,0.000029737246],"domain_scores_gemma":[0.99387866,0.005661175,0.00009185476,0.00012828643,0.00012159034,0.000118469055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084843155,0.00060543424,0.0003201264,0.00029546008,0.00042954143,0.0022735146,0.0014661875,0.0012882536,0.002965433],"category_scores_gemma":[0.0070550647,0.00027765005,0.0003460335,0.0002776903,0.0013057659,0.0017220426,0.001192993,0.00097261387,0.00026623943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016576728,0.002848359,0.012214607,0.0010089795,0.00022509832,0.00095030677,0.030396003,0.4904689,0.021152833,0.26677698,0.006315282,0.16598499],"study_design_scores_gemma":[0.00030755386,0.0009622399,0.0035902709,0.00022210678,0.000091147675,0.00036646347,0.0071438253,0.82272464,0.012643708,0.13598661,0.015875306,0.00008617187],"about_ca_topic_score_codex":0.0010663647,"about_ca_topic_score_gemma":0.0010502927,"teacher_disagreement_score":0.002965433,"about_ca_system_score_codex":0.0009391203,"about_ca_system_score_gemma":0.00070550473,"threshold_uncertainty_score":0.009920299},"labels":[],"label_agreement":null},{"id":"W4383616954","doi":"10.1007/978-3-031-35389-5_22","title":"A Framework for Supporting Adaptive Human-AI Teaming in Air Traffic Control","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"International Air Transport Association","funders":"","keywords":"Air traffic control; Computer science; Operationalization; Context (archaeology); Set (abstract data type); Control (management); Human-in-the-loop; Artificial intelligence; Human–computer interaction; Engineering","score_opus":0.041557419175705254,"score_gpt":0.3755777484041451,"score_spread":0.3340203292284398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383616954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040384308,0.0001772197,0.98666334,0.00016393974,0.00006953141,0.000088124645,0.000043582117,0.0015718391,0.0071838526],"genre_scores_gemma":[0.21102262,0.0003620493,0.77540565,0.00013468342,0.00006830958,0.0003504273,0.00021214454,0.00030596514,0.012138219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936527,0.00015776305,0.000043796557,0.00012471911,0.00019208781,0.000116432944],"domain_scores_gemma":[0.9996302,0.00013128015,0.000023510984,0.000074749114,0.00006442646,0.00007585596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010593816,0.00057035865,0.00051251723,0.0004865899,0.0013680297,0.0024984172,0.002783338,0.0015329869,0.006580071],"category_scores_gemma":[0.0015761108,0.00049534446,0.0008350565,0.00043117383,0.001592659,0.0020425897,0.0031430093,0.0017574898,0.0015628999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014370831,0.00022332523,0.0006461421,0.00023403413,0.000067040906,0.0004484514,0.0011957666,0.12181906,0.012600778,0.701026,0.009063635,0.15253204],"study_design_scores_gemma":[0.000052109765,0.00010482054,0.0002312036,0.00008715881,0.000055121563,0.00017718934,0.00026278163,0.6740253,0.00517795,0.2560583,0.06372409,0.00004394691],"about_ca_topic_score_codex":0.008350671,"about_ca_topic_score_gemma":0.008892591,"teacher_disagreement_score":0.008350671,"about_ca_system_score_codex":0.00073839654,"about_ca_system_score_gemma":0.0015404746,"threshold_uncertainty_score":0.022012591},"labels":[],"label_agreement":null},{"id":"W4383617168","doi":"10.1007/978-3-031-35915-6_42","title":"Customer Review Classification Using Machine Learning and Deep Learning Techniques","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Toronto Metropolitan University","funders":"","keywords":"Customer intelligence; Customer base; Computer science; Customer retention; Voice of the customer; Customer to customer; Customer advocacy; Context (archaeology); Competitive advantage; Marketing; Product (mathematics); Service (business); Confusion; Business; Service quality","score_opus":0.04088826005156904,"score_gpt":0.3050112540376721,"score_spread":0.26412299398610306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4045018,0.009019249,0.5430309,0.002275622,0.0011651558,0.0006429905,0.0034687018,0.0048337537,0.031061769],"genre_scores_gemma":[0.83991295,0.0020846298,0.120167255,0.00029097215,0.00097359606,0.00021483318,0.0042390195,0.00014435589,0.03197233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943393,0.00009728876,0.00005116988,0.000082387145,0.00024335031,0.00009190143],"domain_scores_gemma":[0.99822146,0.000512265,0.00015591855,0.00008793474,0.00095053576,0.00007186107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007421443,0.00076297927,0.0007806657,0.0023270117,0.0003098105,0.0012667074,0.0006699992,0.00066294626,0.0026774067],"category_scores_gemma":[0.002189694,0.00023266155,0.0006339134,0.0016940281,0.000111413785,0.00086511916,0.00041606533,0.00086895947,0.0021987506],"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.00024102275,0.00037952245,0.0099376915,0.0001922523,0.00012887023,0.00014642712,0.000053360167,0.016102053,0.010280975,0.001183544,0.03265299,0.9287012],"study_design_scores_gemma":[0.000012991273,0.000082288534,0.0057493956,0.000026035814,0.000059060927,0.0001059637,0.000045534623,0.9822667,0.0059347665,0.0013469114,0.004352661,0.000017805005],"about_ca_topic_score_codex":0.005254598,"about_ca_topic_score_gemma":0.009726854,"teacher_disagreement_score":0.005254598,"about_ca_system_score_codex":0.0006749771,"about_ca_system_score_gemma":0.0006271298,"threshold_uncertainty_score":0.010448039},"labels":[],"label_agreement":null},{"id":"W4383617202","doi":"10.1007/978-3-031-35702-2_7","title":"UX Calculator: An Online Tool to Support User Testing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sensory Analysis and Statistical Methods","field":"Agricultural and Biological 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":"HEC Montréal","funders":"","keywords":"Computer science; Usability; Calculator; User experience design; Software deployment; Process (computing); Software engineering; Human–computer interaction; Operating system","score_opus":0.12559028439537617,"score_gpt":0.3238550414641978,"score_spread":0.19826475706882163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617202","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011729353,0.00043374454,0.52293175,0.00024861327,0.0002572311,0.0008908751,0.0049247406,0.43645185,0.02213188],"genre_scores_gemma":[0.12704058,0.00072001235,0.6483243,0.000593281,0.00026937772,0.0031645908,0.015460248,0.105841555,0.09858597],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850523,0.00035213504,0.00014220475,0.00016766589,0.00074914197,0.000083528925],"domain_scores_gemma":[0.98615384,0.009760287,0.00041379398,0.0015016282,0.0017196472,0.00045080975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033188455,0.0023446688,0.001337198,0.0038250613,0.00060684537,0.002287762,0.002871344,0.0012826865,0.11605507],"category_scores_gemma":[0.016022274,0.0010765017,0.00075505226,0.0017049506,0.00042611282,0.0028310998,0.0028132428,0.0012904548,0.032308035],"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.0007132855,0.0004901942,0.0028578,0.00076555245,0.00006507046,0.00048082898,0.0008618854,0.0011168803,0.016582143,0.0036641848,0.19424748,0.7781546],"study_design_scores_gemma":[0.0011126845,0.0016652977,0.029490912,0.0014069643,0.0003834691,0.004306222,0.001000555,0.15487689,0.13413335,0.027197575,0.6436422,0.00078382046],"about_ca_topic_score_codex":0.0006911215,"about_ca_topic_score_gemma":0.0008376465,"teacher_disagreement_score":0.11605507,"about_ca_system_score_codex":0.00035480162,"about_ca_system_score_gemma":0.000687508,"threshold_uncertainty_score":0.3882429},"labels":[],"label_agreement":null},{"id":"W4383617219","doi":"10.1007/978-3-031-34917-1_3","title":"My Iliad: A Ludic Interface Using Ambient Assistive Technology to Promote Aging in Place","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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":"Centre for Interdisciplinary Research in Rehabilitation; HEC Montréal; Université du Québec à Chicoutimi; Institut Universitaire de Gériatrie de Montréal; Université de Montréal; Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; Université de Sherbrooke","funders":"","keywords":"Usability; Curiosity; Openness to experience; Computer science; Human–computer interaction; Interface (matter); Older people; User interface; Activities of daily living; Independent living; Applied psychology; Psychology; Gerontology; Medicine; Social psychology","score_opus":0.024291240174306165,"score_gpt":0.3171118441798969,"score_spread":0.29282060400559073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14181691,0.008365465,0.41545358,0.00345263,0.0032969615,0.00093280774,0.003771181,0.062776364,0.36013412],"genre_scores_gemma":[0.16356279,0.0045518284,0.18296908,0.0031316704,0.00039611795,0.001045372,0.0028751297,0.003026288,0.6384418],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999254,0.000014967534,0.0000040968393,0.000014451011,0.000030008914,0.000011102653],"domain_scores_gemma":[0.99988735,0.000046281315,0.0000054604143,0.000007773539,0.000021179756,0.000031908734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915957,0.00072239706,0.0003217542,0.0006061384,0.0003744881,0.0010556605,0.0010243586,0.0007999357,0.044596136],"category_scores_gemma":[0.0004778527,0.00017465538,0.00043729713,0.00024633337,0.00016486223,0.0010740581,0.0016246174,0.0006717959,0.009736789],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056234334,0.0007077427,0.0013638411,0.000940939,0.000037977203,0.00058295415,0.0028875186,0.00039048458,0.033765517,0.0050177956,0.24027193,0.713471],"study_design_scores_gemma":[0.00036388892,0.002024247,0.014322332,0.00075484504,0.00029710628,0.0027833108,0.0034219003,0.006630374,0.019961568,0.0058592223,0.9433878,0.00019341685],"about_ca_topic_score_codex":0.00042568427,"about_ca_topic_score_gemma":0.0016945798,"teacher_disagreement_score":0.044596136,"about_ca_system_score_codex":0.0001339245,"about_ca_system_score_gemma":0.00028686612,"threshold_uncertainty_score":0.14918894},"labels":[],"label_agreement":null},{"id":"W4383617284","doi":"10.1007/978-3-031-34917-1_10","title":"Aging in Place Virtual Care Technology from the User Experience Perspective","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","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; Communications Research Centre Canada; National Research Council Canada","funders":"","keywords":"Usability; USable; Computer science; Perspective (graphical); Assistive technology; Adaptation (eye); Telehealth; Population; Health care; Human–computer interaction; Telemedicine; Multimedia; Medicine; Psychology","score_opus":0.015120977816374937,"score_gpt":0.2840210664851096,"score_spread":0.26890008866873466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617284","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.2851498,0.03904704,0.035358857,0.0071721445,0.001014955,0.000048152644,0.00030620166,0.00030847284,0.63159436],"genre_scores_gemma":[0.87980306,0.012451922,0.0047482904,0.00060893863,0.00024370149,0.000035355653,0.00011939853,0.00004124843,0.10194804],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9998479,0.000056946137,0.0000069784205,0.00001868855,0.000041822397,0.000027555663],"domain_scores_gemma":[0.9997937,0.00008604091,0.00001871552,0.000013520311,0.000033830882,0.0000541675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032423084,0.0003454397,0.00018636059,0.00051671953,0.0003909859,0.0033463212,0.00046398144,0.0006332935,0.008629279],"category_scores_gemma":[0.0005333908,0.000101696816,0.00018475091,0.00059558556,0.00069746457,0.0027047843,0.0012374753,0.0005378046,0.0010080832],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001946706,0.0002747063,0.009696482,0.00094824174,0.00003564655,0.0024823437,0.07369879,0.0015987555,0.010162594,0.3387447,0.051080126,0.51108295],"study_design_scores_gemma":[0.000014458304,0.00078846444,0.02734587,0.0008909801,0.00009440883,0.008470731,0.07126954,0.005371661,0.0039808624,0.06616228,0.81554425,0.00006650731],"about_ca_topic_score_codex":0.0014483271,"about_ca_topic_score_gemma":0.002073944,"teacher_disagreement_score":0.008629279,"about_ca_system_score_codex":0.00050733786,"about_ca_system_score_gemma":0.0003304084,"threshold_uncertainty_score":0.02886784},"labels":[],"label_agreement":null},{"id":"W4383617526","doi":"10.1007/978-3-031-35702-2_6","title":"Detect and Interpret: Towards Operationalization of Automated User Experience Evaluation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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 Toronto; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Operationalization; User experience design; Field (mathematics); User interface; Human–computer interaction; Focus (optics); Software; Data collection; Usability; Data science; Software engineering","score_opus":0.03282352463158331,"score_gpt":0.3229194907992565,"score_spread":0.2900959661676732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617526","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.052064236,0.0004316657,0.92650235,0.00039550685,0.000075733005,0.00090384943,0.0010688253,0.014043061,0.0045147417],"genre_scores_gemma":[0.41080695,0.00016722338,0.5834714,0.00025100043,0.000067008456,0.00093215023,0.0018354995,0.0009598541,0.0015089944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9795257,0.008366433,0.0018887772,0.0023711382,0.0072308457,0.0006171306],"domain_scores_gemma":[0.96106017,0.021907382,0.0042209225,0.0051869433,0.00678341,0.0008411383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014436239,0.0016122881,0.001355995,0.0033119363,0.000635996,0.006967542,0.0023061705,0.0014315908,0.0030940718],"category_scores_gemma":[0.06629111,0.00076052925,0.001123474,0.0015369985,0.0017486671,0.0059217094,0.004664881,0.0019193268,0.0013019113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015653955,0.0008900895,0.0327348,0.0011889575,0.00047989006,0.00015480799,0.005015195,0.01559634,0.024082178,0.04743468,0.010855842,0.86000186],"study_design_scores_gemma":[0.00016773866,0.001267734,0.03011009,0.00047918328,0.00040999538,0.00031391968,0.0027338227,0.8072104,0.035010178,0.10398452,0.01807636,0.00023604036],"about_ca_topic_score_codex":0.0043718633,"about_ca_topic_score_gemma":0.0048313607,"teacher_disagreement_score":0.014436239,"about_ca_system_score_codex":0.0011926714,"about_ca_system_score_gemma":0.0022208465,"threshold_uncertainty_score":0.07634705},"labels":[],"label_agreement":null},{"id":"W4383617629","doi":"10.1007/978-3-031-35389-5_25","title":"An Emergency Centre Dispatcher Task Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evacuation and Crowd Dynamics","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":"Thales (Canada); National Research Council Canada","funders":"Public Safety Canada","keywords":"Call centre; Computer science; Task (project management); Context (archaeology); Work (physics); Emergency response; Task analysis; Operations research; Telecommunications; Medical emergency; Engineering; Systems engineering","score_opus":0.010160834913855308,"score_gpt":0.23696415756657152,"score_spread":0.22680332265271622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15419845,0.00080846413,0.79916155,0.0009188906,0.0004353748,0.0005243326,0.0060267574,0.0029354682,0.034990747],"genre_scores_gemma":[0.5506286,0.00062645966,0.36068392,0.00018182259,0.00021043008,0.0003509341,0.009327356,0.0009296723,0.07706091],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995751,0.0000927504,0.000019849547,0.00008716534,0.00015542979,0.000069743444],"domain_scores_gemma":[0.99920756,0.00041816346,0.000026866204,0.00006556637,0.00024444924,0.000037437345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085633906,0.00096771825,0.0007409503,0.0014208739,0.000850847,0.0010944819,0.0008379008,0.00057649746,0.011886101],"category_scores_gemma":[0.0022001653,0.00036258902,0.00090450875,0.0014624944,0.00016330331,0.0010671619,0.0006322637,0.00088297983,0.0022243983],"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.00078707794,0.0005617305,0.005996669,0.00029767462,0.00014868502,0.00028997345,0.00041644424,0.30490977,0.011845965,0.011158934,0.06544689,0.59814024],"study_design_scores_gemma":[0.00001594095,0.000090930065,0.00544646,0.000021137106,0.000031317846,0.00006803616,0.00022432083,0.975865,0.002728796,0.0060850317,0.009395793,0.000027186692],"about_ca_topic_score_codex":0.019355845,"about_ca_topic_score_gemma":0.017278075,"teacher_disagreement_score":0.019355845,"about_ca_system_score_codex":0.00085135543,"about_ca_system_score_gemma":0.0013509806,"threshold_uncertainty_score":0.039762914},"labels":[],"label_agreement":null},{"id":"W4383617709","doi":"10.1007/978-3-031-35017-7_26","title":"Changing Hearts and Minds: The Role of Cybersecurity Champion Programs in Cybersecurity Culture","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber 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":"Toronto Metropolitan University","funders":"","keywords":"Champion; Computer security; Computer science; Leverage (statistics); Element (criminal law); Transformational leadership; Information security; Organizational culture; Process (computing); Knowledge management; Business; Public relations; Political science; Law; Artificial intelligence","score_opus":0.015250674933473258,"score_gpt":0.2269247362632124,"score_spread":0.21167406132973915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383617709","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.29519504,0.0034676695,0.004666286,0.07226741,0.0014960964,0.00006646464,0.00002170043,0.000084182,0.6227352],"genre_scores_gemma":[0.96412283,0.00086015515,0.0016201088,0.0036242441,0.0001168078,0.00006487645,0.000013263168,0.000055172728,0.029522523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9981653,0.001205974,0.000015958474,0.00013807058,0.00017623391,0.0002984706],"domain_scores_gemma":[0.99594975,0.0019342602,0.00025776855,0.000118869095,0.0001997388,0.0015396615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003010793,0.00030345735,0.00017477515,0.0005053094,0.00519667,0.008279053,0.0012251957,0.001878,0.0107289655],"category_scores_gemma":[0.0060547492,0.00025380286,0.0001767839,0.0005650228,0.013836666,0.0068866373,0.003804716,0.0059987656,0.00068362645],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009540898,0.000435748,0.0058152615,0.00012806314,0.00001316082,0.0004667957,0.30764687,0.00025603542,0.001848378,0.48684815,0.032199286,0.16424681],"study_design_scores_gemma":[0.00010180131,0.00031815382,0.02227009,0.0007930109,0.000028688077,0.0006707881,0.38805866,0.0016332526,0.0018017897,0.30120876,0.2830276,0.000087414744],"about_ca_topic_score_codex":0.0023064022,"about_ca_topic_score_gemma":0.0047702123,"teacher_disagreement_score":0.0107289655,"about_ca_system_score_codex":0.0025017015,"about_ca_system_score_gemma":0.0044551445,"threshold_uncertainty_score":0.03589195},"labels":[],"label_agreement":null},{"id":"W4383648280","doi":"10.1007/978-3-031-35731-2_16","title":"Key Complexities Inhibiting Design and Implementation of Adaptive-Inclusive Learning Environments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","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":"Ontario Tech University","funders":"","keywords":"Computer science; Adaptation (eye); Diversity (politics); Adaptive learning; Learning sciences; Knowledge management; Data science; Cognitive science; Management science; Artificial intelligence; Mathematics education; Educational technology; Sociology; Psychology; Engineering","score_opus":0.03118162028492173,"score_gpt":0.29632469745655476,"score_spread":0.26514307717163305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383648280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23192504,0.005826896,0.5359094,0.01432079,0.00046844163,0.00087096536,0.00021190652,0.00087338244,0.2095932],"genre_scores_gemma":[0.89526623,0.0022820446,0.09027961,0.0003504169,0.00008527345,0.00042077687,0.000057297682,0.00019199835,0.011066353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9904944,0.0034995412,0.0007526668,0.0010156676,0.0032165963,0.0010212028],"domain_scores_gemma":[0.9540161,0.034975164,0.0034191515,0.0033344838,0.0033154725,0.00093965314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071169995,0.0007581731,0.0005455347,0.00086801656,0.0023658222,0.017690808,0.002176486,0.002475258,0.005859925],"category_scores_gemma":[0.04898755,0.0015166779,0.0004067322,0.0012591915,0.00696594,0.013009519,0.005255859,0.0043987115,0.0014780591],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028368615,0.00020992217,0.0069654174,0.0016165182,0.000071801864,0.00096241495,0.02658643,0.012078223,0.012857563,0.7716452,0.0042421278,0.16248079],"study_design_scores_gemma":[0.00009660466,0.0003799615,0.009961354,0.0020660285,0.0002904134,0.0020613484,0.0345926,0.047746323,0.030279376,0.7332683,0.13904281,0.0002147927],"about_ca_topic_score_codex":0.0023668038,"about_ca_topic_score_gemma":0.0032928777,"teacher_disagreement_score":0.017690808,"about_ca_system_score_codex":0.0030343682,"about_ca_system_score_gemma":0.004870044,"threshold_uncertainty_score":0.037638783},"labels":[],"label_agreement":null},{"id":"W4383648696","doi":"10.1007/978-3-031-34866-2_31","title":"From a Research Centre to a Mall: Bringing Virtual Reality and Digital Playing to a Living Lab for Community Dwelling Older Adults","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Approaches in Technology and Social Development","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Psychosocial; Psychology; Gerontology; Virtual reality; Sociology; Medicine; Computer science","score_opus":0.059027735619514736,"score_gpt":0.291612634893711,"score_spread":0.23258489927419623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383648696","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.70358115,0.017218694,0.033889867,0.04527007,0.0056596957,0.00096351636,0.0005834958,0.0038789902,0.18895449],"genre_scores_gemma":[0.7509965,0.011221295,0.06942863,0.014082747,0.001000372,0.0007844757,0.000584438,0.00080528704,0.15109631],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99926406,0.00029305255,0.000021868547,0.0000999039,0.0001259735,0.00019506973],"domain_scores_gemma":[0.99845576,0.00016801257,0.000037378148,0.000050977498,0.00009436649,0.0011934283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017184289,0.00062728487,0.00028707433,0.0005279912,0.0021037732,0.0032766338,0.0018216877,0.0020360693,0.013049095],"category_scores_gemma":[0.0019620415,0.00037828195,0.00056203693,0.00027531455,0.0010765797,0.0035826815,0.006528775,0.0023703442,0.0032565624],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004274516,0.004435818,0.007420943,0.00069077156,0.000046826426,0.003044167,0.07709337,0.00014350835,0.008120302,0.003345422,0.15175067,0.74348074],"study_design_scores_gemma":[0.0005657772,0.0078044906,0.045909066,0.001852431,0.00020475114,0.0076069925,0.23816358,0.0011528499,0.004599822,0.013197561,0.67861074,0.00033196408],"about_ca_topic_score_codex":0.002072978,"about_ca_topic_score_gemma":0.010648221,"teacher_disagreement_score":0.013049095,"about_ca_system_score_codex":0.0004739761,"about_ca_system_score_gemma":0.0022578056,"threshold_uncertainty_score":0.043653548},"labels":[],"label_agreement":null},{"id":"W4383648853","doi":"10.1007/978-3-031-35930-9_5","title":"Making the Digital Tangible Through Analog Games: Design Retrospective of Digital Literacy Games","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","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":"Concordia University","funders":"","keywords":"Affordance; Computer science; Key (lock); Digital literacy; Multimedia; Human–computer interaction; Space (punctuation); Literacy; World Wide Web; Sociology; Computer security; Pedagogy","score_opus":0.043639515250072716,"score_gpt":0.32666121968565665,"score_spread":0.28302170443558394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383648853","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.76510924,0.0010369725,0.06385229,0.0007057599,0.00019467347,0.0020943547,0.00025702608,0.000263352,0.16648637],"genre_scores_gemma":[0.8695311,0.00063827087,0.07783098,0.00022611764,0.00001699632,0.0009954311,0.00019104804,0.00020067905,0.05036939],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960614,0.0026397414,0.00015063545,0.0003007945,0.0006507423,0.00019673002],"domain_scores_gemma":[0.9932278,0.0052573336,0.00020169071,0.00040365887,0.0006280637,0.0002815072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040868893,0.0008015892,0.00026966934,0.0010071117,0.0010669765,0.004929333,0.0013045178,0.00063667557,0.008273261],"category_scores_gemma":[0.012598674,0.00053284987,0.00025679628,0.0005730942,0.0020793986,0.0017376456,0.0016936839,0.0010973613,0.0008541836],"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.0009811352,0.0023756714,0.012816403,0.0014937316,0.0000702634,0.00071389385,0.120244525,0.0048379647,0.027350448,0.15381502,0.007860367,0.6674406],"study_design_scores_gemma":[0.0008952957,0.011436383,0.04098155,0.002185746,0.0006063127,0.0026337637,0.14659424,0.022149393,0.07944114,0.07817327,0.61458504,0.00031790318],"about_ca_topic_score_codex":0.0013214377,"about_ca_topic_score_gemma":0.0032760422,"teacher_disagreement_score":0.008273261,"about_ca_system_score_codex":0.001740205,"about_ca_system_score_gemma":0.0018538542,"threshold_uncertainty_score":0.02767688},"labels":[],"label_agreement":null},{"id":"W4383649597","doi":"10.1007/978-3-031-35129-7_4","title":"Extensibility Challenges of Scientific Workflow Management Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Workflow; Computer science; Workflow management system; Workflow engine; Software engineering; Workflow technology; Extensibility; Usability; Software; Pipeline (software); Flexibility (engineering); Interface (matter); Windows Workflow Foundation; User interface; Domain (mathematical analysis); Data science; World Wide Web; Database; Human–computer interaction; Programming language; Operating system","score_opus":0.1388948497042357,"score_gpt":0.3402268468951482,"score_spread":0.2013319971909125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383649597","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.15182489,0.024271237,0.724166,0.044554953,0.0021030358,0.00028269214,0.00046716104,0.0024865514,0.049843594],"genre_scores_gemma":[0.6529962,0.021299075,0.298978,0.0029472217,0.0040228693,0.00042122114,0.0010611638,0.0011712846,0.017103044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914051,0.0023902545,0.0014167031,0.0010729386,0.0029170944,0.0007978506],"domain_scores_gemma":[0.9637078,0.020486094,0.0018024177,0.0105917,0.0022152131,0.0011967891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022329595,0.00096402486,0.0012774915,0.0020333088,0.0018275767,0.013433392,0.00465858,0.00324757,0.0026604382],"category_scores_gemma":[0.037388172,0.0019428291,0.0016472333,0.002987974,0.0038837553,0.027819838,0.006908796,0.0097450735,0.0010848561],"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.00016203788,0.00022953526,0.002092155,0.000511013,0.0001383576,0.00068175327,0.0020548438,0.03391706,0.0051208404,0.7738433,0.009108663,0.17214055],"study_design_scores_gemma":[0.00002968101,0.000057540718,0.0006913376,0.00035287903,0.000071798764,0.00064243464,0.0005423878,0.07354666,0.0023347116,0.88660175,0.03507592,0.00005303762],"about_ca_topic_score_codex":0.0014777383,"about_ca_topic_score_gemma":0.000728345,"teacher_disagreement_score":0.022329595,"about_ca_system_score_codex":0.0014594002,"about_ca_system_score_gemma":0.0021003035,"threshold_uncertainty_score":0.11809164},"labels":[],"label_agreement":null},{"id":"W4383649742","doi":"10.1007/978-3-031-35915-6_7","title":"Towards a Truly Collective Leadership: A Case for Symbiotic Relationships in Planetary Health and Artificial Intelligence","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Climate Change and Health Impacts","field":"Environmental Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Roads University","funders":"","keywords":"Conceptualization; Globe; Collective intelligence; Collective leadership; Sociology; Epistemology; Computer science; Knowledge management; Cognitive science; Artificial intelligence; Political science; Public relations; Management science; Psychology; Engineering; Law","score_opus":0.24531560309358433,"score_gpt":0.3327514947277367,"score_spread":0.08743589163415236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383649742","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.021328915,0.006121633,0.05594157,0.07458668,0.0012195581,0.000080040314,0.000027581798,0.00014814804,0.84054595],"genre_scores_gemma":[0.8653943,0.0032556423,0.03465006,0.0060633756,0.0006075653,0.00020402802,0.000044421224,0.00013811364,0.0896426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978903,0.0013014791,0.000043167845,0.00016674818,0.00032053978,0.00027766504],"domain_scores_gemma":[0.9982168,0.00075895793,0.00015016178,0.00024174,0.00016978392,0.00046249334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032497577,0.00047548246,0.00032190516,0.00062331255,0.0038679652,0.010072056,0.0011128039,0.003138823,0.007112304],"category_scores_gemma":[0.003384922,0.00029640834,0.00040034114,0.0008382509,0.021768354,0.008141611,0.0059633637,0.005943182,0.0015309745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007810823,0.000012551202,0.00009067893,0.0000308965,0.0000033240476,0.00009662273,0.005597911,0.00021756541,0.00019085615,0.97718734,0.006093541,0.010470909],"study_design_scores_gemma":[0.000009389131,0.000020064885,0.00018519214,0.00007371002,0.0000030479575,0.00015197677,0.0038151487,0.0007876031,0.00010260115,0.88100564,0.11383643,0.000009237081],"about_ca_topic_score_codex":0.00084392325,"about_ca_topic_score_gemma":0.0014954181,"teacher_disagreement_score":0.010072056,"about_ca_system_score_codex":0.0017828327,"about_ca_system_score_gemma":0.0027280254,"threshold_uncertainty_score":0.023792982},"labels":[],"label_agreement":null},{"id":"W4383649750","doi":"10.1007/978-3-031-35979-8_9","title":"Comparing Hedonic Consumption Experiences Between MOBA Games and Vrides","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Consumption (sociology); Battle; Test (biology); Applied psychology; Multimedia; Psychology; Human–computer interaction; Sociology","score_opus":0.054343976863968295,"score_gpt":0.30701236515305946,"score_spread":0.25266838828909116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383649750","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.994286,0.00004599971,0.00011460323,0.000015124908,0.000008572746,0.000007769673,0.00007492604,0.0000055748774,0.005441559],"genre_scores_gemma":[0.99477625,0.00006601274,0.00027313473,0.000014452396,0.000006416203,0.000016866054,0.00015452686,0.000011200007,0.0046812305],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998301,0.0000511482,0.000009890568,0.000018750738,0.000048579153,0.00004144067],"domain_scores_gemma":[0.9990227,0.0006523578,0.00007406454,0.00003742285,0.000092471695,0.000121061246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034519035,0.00020810701,0.0002008463,0.0005378989,0.0003013866,0.0013960367,0.00025003485,0.00026599382,0.010039223],"category_scores_gemma":[0.0029623006,0.00013294036,0.00023224752,0.00030378558,0.00020169378,0.00067337917,0.00072225905,0.0003168381,0.0005684385],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.032181635,0.0073648356,0.39409062,0.0015531497,0.0006589781,0.0010072659,0.08488855,0.0022420848,0.061077606,0.01337557,0.008263949,0.39329588],"study_design_scores_gemma":[0.00025161047,0.0044045174,0.91344285,0.00015295025,0.00023565511,0.00037205865,0.059096865,0.0030462162,0.004583205,0.0016056183,0.012725887,0.000082631974],"about_ca_topic_score_codex":0.0024122498,"about_ca_topic_score_gemma":0.004991699,"teacher_disagreement_score":0.010039223,"about_ca_system_score_codex":0.00023359977,"about_ca_system_score_gemma":0.000120296965,"threshold_uncertainty_score":0.033584476},"labels":[],"label_agreement":null},{"id":"W4383649767","doi":"10.1007/978-3-031-35822-7_28","title":"User Motivations of Secure Web Browsing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"York University; Carleton University","funders":"","keywords":"Computer science; Usability; Internet privacy; Anonymity; World Wide Web; Thematic analysis; Web navigation; Personally identifiable information; Perception; Computer security; The Internet; Human–computer interaction; Psychology; Qualitative research","score_opus":0.03455537224196031,"score_gpt":0.29159564223430934,"score_spread":0.257040269992349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383649767","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.6303477,0.00067655166,0.032635488,0.0035125709,0.00003765184,0.00007098857,0.00019557308,0.00013678746,0.33238664],"genre_scores_gemma":[0.99396837,0.00008521284,0.001471979,0.000054262557,0.0000121837475,0.000012477091,0.00002663844,0.000021381533,0.0043473584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99864846,0.0007364221,0.00004347412,0.00008680312,0.00031978235,0.00016511817],"domain_scores_gemma":[0.99170333,0.0064070737,0.0004580676,0.00051470794,0.0003990451,0.0005178773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015589144,0.00020334184,0.00021399281,0.0006711589,0.0010480923,0.003634125,0.00039195022,0.0014444758,0.010071548],"category_scores_gemma":[0.009711182,0.00032213386,0.00024281739,0.00047302822,0.0013625874,0.003761155,0.001430446,0.0015719561,0.00067239546],"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.00061936723,0.00023184887,0.0120480005,0.00008621681,0.000020977075,0.0004976983,0.0076645124,0.0017500829,0.005130484,0.9373361,0.0033551126,0.03125961],"study_design_scores_gemma":[0.0001439306,0.00026387163,0.025407055,0.0002003702,0.00007102774,0.002296238,0.017143622,0.08309447,0.0072889784,0.8276149,0.03637864,0.000096909695],"about_ca_topic_score_codex":0.0011753176,"about_ca_topic_score_gemma":0.0012939193,"teacher_disagreement_score":0.010071548,"about_ca_system_score_codex":0.00079430564,"about_ca_system_score_gemma":0.0006343346,"threshold_uncertainty_score":0.033692658},"labels":[],"label_agreement":null},{"id":"W4383650010","doi":"10.1007/978-3-031-35936-1_12","title":"As with Wine, Life Gets Better with Age. Redefining Mobile User Interface (UI) Components in the Age-Friendly Design Transformation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","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":"Carleton University","funders":"","keywords":"Computer science; User Friendly; Transformation (genetics); Process (computing); User interface; Human–computer interaction; Interface (matter); World Wide Web","score_opus":0.031267030597577884,"score_gpt":0.27002354869396616,"score_spread":0.2387565180963883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383650010","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0303184,0.01852649,0.42303002,0.018680602,0.007027833,0.00020634271,0.0005060991,0.0034141266,0.4982901],"genre_scores_gemma":[0.18333,0.01926265,0.28588927,0.00663599,0.00081000914,0.00029684167,0.0005500424,0.0020787842,0.50114644],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994722,0.00015509443,0.000027105434,0.00007273512,0.00021721283,0.000055785607],"domain_scores_gemma":[0.999537,0.00013733686,0.00003320109,0.000064220716,0.00014395526,0.00008434863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089018303,0.0007316069,0.00024121946,0.0006077668,0.0007142322,0.0034467948,0.00069662655,0.0011212165,0.01219392],"category_scores_gemma":[0.002080736,0.0002826354,0.0006323966,0.0006152733,0.0012332792,0.0042701135,0.002055436,0.001870084,0.007600807],"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.000103202474,0.00009648616,0.0020051524,0.0007675529,0.000035602545,0.0004569851,0.016559903,0.0006403335,0.018695582,0.25891557,0.13562007,0.5661036],"study_design_scores_gemma":[0.000006693707,0.00008011323,0.0011419853,0.0002473844,0.000028071636,0.0006649942,0.0017433742,0.000623821,0.0027129431,0.033344243,0.9593751,0.00003130029],"about_ca_topic_score_codex":0.0013147239,"about_ca_topic_score_gemma":0.0028265761,"teacher_disagreement_score":0.01219392,"about_ca_system_score_codex":0.0003887498,"about_ca_system_score_gemma":0.0005982025,"threshold_uncertainty_score":0.040792704},"labels":[],"label_agreement":null},{"id":"W4383650623","doi":"10.1007/978-3-031-34866-2_5","title":"Lessons from a COVID-Era Controlled Trial of Online Learning and Socializing with Older Participants","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Health disparities and outcomes","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":"Concordia University; McGill University","funders":"","keywords":"Consolidated Standards of Reporting Trials; Randomized controlled trial; Psychological intervention; Documentation; Population; Applied psychology; Computer science; Medical education; Psychology; Medicine; Nursing","score_opus":0.06957338558310773,"score_gpt":0.3840327521629419,"score_spread":0.3144593665798342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383650623","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.28511855,0.079650626,0.09027068,0.31355208,0.073807105,0.10409253,0.012450734,0.0016377523,0.039419923],"genre_scores_gemma":[0.5772641,0.028660292,0.10681009,0.12023453,0.022533469,0.12175247,0.0027472174,0.00046908366,0.019528821],"study_design_codex":"design_other","study_design_gemma":"randomized_trial","domain_scores_codex":[0.9283861,0.060143393,0.0047164937,0.0017323745,0.003547948,0.0014736828],"domain_scores_gemma":[0.7284992,0.24483441,0.0062708235,0.0076572383,0.008580297,0.0041581783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08854413,0.0029293573,0.0043801507,0.00073946937,0.0027768444,0.0024125895,0.0056615076,0.008365148,0.010018649],"category_scores_gemma":[0.23734044,0.0012064609,0.0052444236,0.001088343,0.0031260385,0.005409545,0.0028143963,0.009470367,0.0018635899],"study_design_candidate":"randomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.15483138,0.02673898,0.0049238997,0.028585335,0.019594071,0.002827589,0.009577346,0.0026307637,0.0022352969,0.019508852,0.22512327,0.5034233],"study_design_scores_gemma":[0.4360496,0.174569,0.023259347,0.024984391,0.03456881,0.00113186,0.008806276,0.005312325,0.005300547,0.071352616,0.2136422,0.0010230393],"about_ca_topic_score_codex":0.009601637,"about_ca_topic_score_gemma":0.018315978,"teacher_disagreement_score":0.08854413,"about_ca_system_score_codex":0.0026067907,"about_ca_system_score_gemma":0.0071558985,"threshold_uncertainty_score":0.46827173},"labels":[],"label_agreement":null},{"id":"W4383650740","doi":"10.1007/978-3-031-35822-7_40","title":"Human-Centric Machine Learning: The Role of Users in the Development of IoT Device Identification and Vulnerability Assessment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Transparency (behavior); Flexibility (engineering); Impartiality; Vulnerability (computing); Identification (biology); Computer security; Internet of Things; Data science","score_opus":0.030453501860932305,"score_gpt":0.29255488339865093,"score_spread":0.2621013815377186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383650740","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.03212139,0.0099659925,0.84704924,0.009812752,0.0006382381,0.00014612725,0.00020146607,0.0009053795,0.099159405],"genre_scores_gemma":[0.72589415,0.007894233,0.23505984,0.0014454013,0.0006665947,0.00015469766,0.00026049512,0.0002445982,0.028380059],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998643,0.00059336785,0.000043524164,0.00021053343,0.0004108348,0.00009871626],"domain_scores_gemma":[0.99552286,0.0032034018,0.00021270002,0.00039939035,0.0005099157,0.00015176173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033592097,0.0005560229,0.000405085,0.00089391915,0.00044605273,0.0032271561,0.0011832393,0.0011421443,0.0023378057],"category_scores_gemma":[0.005737951,0.00027358418,0.00029329088,0.0010707225,0.0017402023,0.0048768823,0.0013898424,0.0019557972,0.0008022705],"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.000053620857,0.00016238538,0.0063924347,0.0002395882,0.000047323945,0.00017634532,0.0011546952,0.022803884,0.0028155982,0.21999033,0.019370189,0.72679365],"study_design_scores_gemma":[0.00000494127,0.00012773856,0.004964626,0.00042198272,0.000031567346,0.00056810037,0.0010612267,0.37901077,0.009052933,0.52685887,0.07782862,0.0000685863],"about_ca_topic_score_codex":0.0011056851,"about_ca_topic_score_gemma":0.0015459689,"teacher_disagreement_score":0.0033592097,"about_ca_system_score_codex":0.0009139137,"about_ca_system_score_gemma":0.0012167118,"threshold_uncertainty_score":0.017765403},"labels":[],"label_agreement":null},{"id":"W4383650744","doi":"10.1007/978-3-031-35921-7_1","title":"Users’ Sophisticated Information Search Behaviour","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Scrolling; Computer science; Think aloud protocol; Process (computing); World Wide Web; Human–computer interaction; Everyday life; Protocol (science); Smartphone app; Multimedia; Usability; Artificial intelligence","score_opus":0.035124264915759304,"score_gpt":0.2866905688077832,"score_spread":0.2515663038920239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383650744","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.949323,0.00038522776,0.007837398,0.00047473153,0.000010900405,0.000022310067,0.00036380402,0.00031063723,0.041272074],"genre_scores_gemma":[0.9911315,0.0001182815,0.0013338617,0.000067005756,0.000011098571,0.000007309604,0.00018875895,0.00006055279,0.0070816213],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99930274,0.00027589867,0.00004095728,0.000107897555,0.00020626662,0.00006624662],"domain_scores_gemma":[0.9913394,0.0062127486,0.0006383258,0.00089663314,0.00064948795,0.00026346237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355209,0.00024360954,0.00025267625,0.0010751387,0.00042528333,0.0025963886,0.00023053992,0.00082700246,0.006484689],"category_scores_gemma":[0.011169454,0.00033916548,0.00028112184,0.0013875193,0.0004370935,0.0031606636,0.00051851326,0.0007176214,0.0020966958],"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.0018462779,0.00050115935,0.35558555,0.00077824394,0.00042477736,0.00088946003,0.037035532,0.008856908,0.13139307,0.063924775,0.015428202,0.38333616],"study_design_scores_gemma":[0.00008896302,0.00084300776,0.7614319,0.000114368006,0.0003145329,0.0032852641,0.009974946,0.1037755,0.03628009,0.03567094,0.047837418,0.00038311462],"about_ca_topic_score_codex":0.0025705916,"about_ca_topic_score_gemma":0.0023360038,"teacher_disagreement_score":0.006484689,"about_ca_system_score_codex":0.0003515693,"about_ca_system_score_gemma":0.0002175691,"threshold_uncertainty_score":0.021693468},"labels":[],"label_agreement":null},{"id":"W4383650816","doi":"10.1007/978-3-031-35017-7_25","title":"Cognitive Security: An Architecture Informed Approach from Cognitive Science","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","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":"Department of National Defence","funders":"","keywords":"Cognition; Computer science; LIDA; Cognitive architecture; Domain (mathematical analysis); Process (computing); Cognitive science; Dual (grammatical number); Function (biology); Computer security; Knowledge management; Data science; Psychology","score_opus":0.04164741900141676,"score_gpt":0.32072590263136835,"score_spread":0.2790784836299516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383650816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009857626,0.004466474,0.76044893,0.008982629,0.00035303412,0.00006144223,0.00009290187,0.00034085402,0.21539605],"genre_scores_gemma":[0.59649545,0.0074783033,0.34517133,0.000992272,0.00046375138,0.00025349928,0.00018414255,0.00032588246,0.048635293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945897,0.00019358686,0.000020817035,0.00007074171,0.00019768893,0.00005813701],"domain_scores_gemma":[0.9991097,0.0005361965,0.000045904475,0.00015248149,0.000109632274,0.000046176923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009216939,0.0009348299,0.0005242704,0.0014735949,0.00091937406,0.0056398786,0.0015064506,0.0019811983,0.0059523215],"category_scores_gemma":[0.002281408,0.0005812362,0.0007180698,0.0013596364,0.005855979,0.008857409,0.0028977396,0.0032533712,0.0010991791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047025987,0.000009081577,0.00007848332,0.00003902358,0.000007684191,0.000026566177,0.0003229695,0.0026398774,0.00024402185,0.977974,0.0015357805,0.017117787],"study_design_scores_gemma":[0.000002267107,0.000006417735,0.00006589583,0.000035993795,0.000006089584,0.000053578402,0.0001386681,0.008823256,0.000326488,0.97456044,0.015975175,0.0000056709328],"about_ca_topic_score_codex":0.0024152293,"about_ca_topic_score_gemma":0.0020956954,"teacher_disagreement_score":0.0059523215,"about_ca_system_score_codex":0.0023236943,"about_ca_system_score_gemma":0.0019298889,"threshold_uncertainty_score":0.01991254},"labels":[],"label_agreement":null},{"id":"W4383891108","doi":"10.1007/978-3-031-38100-3_12","title":"Improved Synthesis of Toffoli-Hadamard Circuits","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Dalhousie University; University of Waterloo; Photon Etc (Canada); Simon Fraser University","funders":"","keywords":"Toffoli gate; Hadamard transform; Complex Hadamard matrix; Electronic circuit; Hadamard matrix; Integer (computer science); Matrix (chemical analysis); Qubit; Mathematics; Computer science; Discrete mathematics; Combinatorics; Arithmetic; Algorithm; Topology (electrical circuits); Quantum gate; Physics; Quantum mechanics; Quantum","score_opus":0.014643321662646386,"score_gpt":0.22947315407114202,"score_spread":0.21482983240849562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383891108","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.059039544,0.0021845622,0.8768419,0.00046214048,0.0005993677,0.00008669073,0.00031207426,0.0021439092,0.058329802],"genre_scores_gemma":[0.44504708,0.0009472407,0.5355605,0.00017783839,0.00013055594,0.00008529964,0.000348025,0.0002530842,0.017450325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969625,0.000063500076,0.00002035318,0.000043796106,0.00013851769,0.000037661863],"domain_scores_gemma":[0.99970466,0.00013042422,0.000017626287,0.000056024346,0.000080058686,0.000011123229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003432985,0.00047299665,0.00061817287,0.0004536149,0.00033310056,0.0007527794,0.0006956165,0.0004934949,0.0068148025],"category_scores_gemma":[0.0008449406,0.00027062773,0.00046454946,0.0004718551,0.00031377794,0.0008088043,0.0003707634,0.00077885826,0.0010026691],"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.00037983822,0.00012781154,0.00025158646,0.00060352974,0.000064491345,0.0002052462,0.00017668768,0.0719272,0.15646271,0.27221438,0.00698083,0.4906057],"study_design_scores_gemma":[0.00016680472,0.00047372436,0.00043353564,0.0001479208,0.000111033376,0.0006252819,0.0000630137,0.49970275,0.28787336,0.13858707,0.07174542,0.00006998722],"about_ca_topic_score_codex":0.00041536844,"about_ca_topic_score_gemma":0.000835986,"teacher_disagreement_score":0.0068148025,"about_ca_system_score_codex":0.0008013842,"about_ca_system_score_gemma":0.0004494759,"threshold_uncertainty_score":0.022797823},"labels":[],"label_agreement":null},{"id":"W4383900280","doi":"10.1007/978-3-031-37616-0","title":"Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics. The PAAMS Collection","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":6,"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":"Office National d'études et de Recherches Aérospatiales; Institute of Automation, Chinese Academy of Sciences; Russian Academy of Sciences; Technische Universität Clausthal; Tokyo University of Agriculture and Technology; Université de Montpellier; Tokyo University of Agriculture; Qilu University of Technology; Universidad de Caldas; Universidade do Porto; Aristotle University of Thessaloniki; Universidade do Minho; Syddansk Universitet; Universidad Carlos III de Madrid; Università degli Studi di Napoli Federico II; Malmö Högskola; Università Politecnica delle Marche; Umeå Universitet; Université Laval; Universidad Nacional del Centro de la Provincia de Buenos Aires; Università degli Studi di Genova; Université de Toulouse; Agencia Estatal de Investigación; University of Crete; Centre de Coopération Internationale en Recherche Agronomique pour le Développement; Universidad Complutense de Madrid; Aalto-Yliopisto; Università di Bologna; Universität Bremen; Universidade de Lisboa; Universitat Politècnica de València; Università Degli Studi di Modena e Reggio Emila; Uniwersytet Morski w Gdyni; Purdue University; Université de Sherbrooke; RMIT University; Universidad de Sevilla; Centre National de la Recherche Scientifique; Chinese Academy of Sciences; Universidade Federal de Santa Catarina; Georgia Institute of Technology; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Technische Universiteit Delft","keywords":"Computer science; Key (lock); Management science; Data science; Computer security; Engineering","score_opus":0.03473062060871547,"score_gpt":0.31949638981893946,"score_spread":0.284765769210224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383900280","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001038125,0.7280037,0.032312013,0.006923566,0.0069205137,0.000045456047,0.00020006708,0.0005562592,0.22400029],"genre_scores_gemma":[0.023869643,0.55717665,0.035840962,0.0019853767,0.0075838254,0.00014791747,0.00062618376,0.0004606304,0.3723088],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995041,0.00013015776,0.000044135166,0.000075286516,0.00021530787,0.000031062384],"domain_scores_gemma":[0.99851006,0.0010099588,0.000042424163,0.000117738295,0.00022181428,0.00009808793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011301247,0.0010787006,0.0013129014,0.0026402588,0.0007243397,0.0033716979,0.0012338902,0.001283998,0.0404917],"category_scores_gemma":[0.002893758,0.0006740241,0.0006728554,0.0032174657,0.0014934551,0.005817047,0.0020908923,0.00252896,0.011899779],"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.00003507019,0.00006796011,0.00014258662,0.0012381071,0.000031296207,0.000114589166,0.0003468325,0.0012814411,0.0006597863,0.18785797,0.41845706,0.3897673],"study_design_scores_gemma":[0.000003818677,0.000020494357,0.00019330444,0.0003145189,0.0000076225583,0.00024373199,0.00008398711,0.00095889956,0.00021315037,0.0824213,0.9155297,0.000009344021],"about_ca_topic_score_codex":0.00088355213,"about_ca_topic_score_gemma":0.0019244207,"teacher_disagreement_score":0.0404917,"about_ca_system_score_codex":0.0011282337,"about_ca_system_score_gemma":0.0011501438,"threshold_uncertainty_score":0.13545823},"labels":[],"label_agreement":null},{"id":"W4383900289","doi":"10.1007/978-3-031-37586-6","title":"Data and Applications Security and Privacy XXXVII","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University at Albany; National Institute of Standards and Technology; Universitat Politècnica de Catalunya; Universität Regensburg; Ben-Gurion University of the Negev; Università degli Studi di Trento; Fondazione Bruno Kessler; Università degli Studi di Salerno; University of Pretoria; University of Southern California; University College London; Polytechnique Montréal; Université du Luxembourg; Newcastle University; Indian National Science Academy; Università degli Studi di Milano; Lahore University of Management Sciences; Norges Teknisk-Naturvitenskapelige Universitet; Universidad de Málaga; Indian Institute of Technology Kharagpur; Università degli Studi di Verona; State University of New York; University of South Carolina; University of Texas at San Antonio; Colorado State University; Stony Brook University; University of Pittsburgh; Santa Clara University; Vanderbilt University","keywords":"Computer science; Computer security; Information privacy; Internet privacy","score_opus":0.037022022348989936,"score_gpt":0.29564543333604876,"score_spread":0.2586234109870588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383900289","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024283035,0.107737996,0.06783999,0.006901369,0.011323437,0.00019237923,0.0016499427,0.0013193192,0.8006073],"genre_scores_gemma":[0.007082434,0.03630323,0.0063001844,0.0007876166,0.002546782,0.00008840193,0.00080952497,0.00037771196,0.945704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995586,0.00004641543,0.000020203144,0.00006740119,0.00026889116,0.00003831902],"domain_scores_gemma":[0.99950755,0.00019736605,0.000025672507,0.00008833543,0.00014301097,0.000038119328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035024254,0.0013748419,0.00094501243,0.0016342415,0.00087674125,0.003614979,0.00056831527,0.0010241928,0.05066471],"category_scores_gemma":[0.0010131911,0.00054435723,0.00051193504,0.0035691017,0.00093107024,0.0022410909,0.0009649327,0.0025970617,0.045126334],"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.000041170668,0.000059725277,0.00015872139,0.00044022515,0.000012772531,0.00012046993,0.00023151148,0.0011631247,0.0027680683,0.11719448,0.6028305,0.27497914],"study_design_scores_gemma":[0.000005228772,0.000020701464,0.00032208615,0.00023411872,0.00000742695,0.00016931763,0.000051530686,0.0014192931,0.0007654395,0.032931816,0.9640643,0.000008766354],"about_ca_topic_score_codex":0.0025850171,"about_ca_topic_score_gemma":0.0025559112,"teacher_disagreement_score":0.05066471,"about_ca_system_score_codex":0.0015844603,"about_ca_system_score_gemma":0.0011770267,"threshold_uncertainty_score":0.16949034},"labels":[],"label_agreement":null},{"id":"W4383900569","doi":"10.1007/978-3-031-37616-0_13","title":"A Decentralized Resource Allocation Protocol in Social Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Protocol (science); Resource allocation; Distributed computing; Resource (disambiguation); Negotiation; Resource management (computing); Controller (irrigation); Multi-agent system; Computer network; Artificial intelligence","score_opus":0.019882479830470173,"score_gpt":0.2940028339879764,"score_spread":0.27412035415750624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383900569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011424969,0.00020006156,0.980696,0.0005971253,0.00017196471,0.00020336891,0.00007047457,0.00046940212,0.0061665624],"genre_scores_gemma":[0.5556717,0.00041087557,0.42807433,0.00050628115,0.00028462146,0.0013436909,0.00023387754,0.00019594908,0.01327865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711084,0.001467821,0.00015735537,0.0003724593,0.00067885884,0.00021261693],"domain_scores_gemma":[0.99436015,0.004043886,0.00022517134,0.00069811236,0.0004030608,0.00026968017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040352116,0.000695902,0.0013673356,0.00092179276,0.0018478428,0.0020054174,0.0028642318,0.002030788,0.0044459263],"category_scores_gemma":[0.009726528,0.0005252215,0.00078188936,0.0017993777,0.0018478718,0.0031753413,0.0038789636,0.0018695117,0.00076872355],"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.0005804962,0.00029075355,0.00038271994,0.00022897284,0.00011665772,0.00020510027,0.0003520993,0.4117878,0.007861086,0.41512775,0.013358003,0.14970851],"study_design_scores_gemma":[0.000092413415,0.00006970158,0.00008136934,0.000014682822,0.000022185946,0.00006349482,0.000036571117,0.866407,0.0010278558,0.12785652,0.0043066535,0.000021446504],"about_ca_topic_score_codex":0.0012537434,"about_ca_topic_score_gemma":0.00155198,"teacher_disagreement_score":0.0044459263,"about_ca_system_score_codex":0.0014133608,"about_ca_system_score_gemma":0.002032269,"threshold_uncertainty_score":0.02134043},"labels":[],"label_agreement":null},{"id":"W4383900947","doi":"10.1007/978-3-031-37586-6_23","title":"VIET: A Tool for Extracting Essential Information from Vulnerability Descriptions for CVSS Evaluation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Carleton University","funders":"","keywords":"Vulnerability (computing); Computer science; Vulnerability assessment; Exploit; Process (computing); Artificial intelligence; Machine learning; Computer security; Data mining","score_opus":0.037780391439548755,"score_gpt":0.2976723096424599,"score_spread":0.25989191820291113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383900947","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.019109137,0.00046825895,0.707833,0.00019852779,0.00008824947,0.00074857974,0.03396494,0.22142558,0.01616376],"genre_scores_gemma":[0.11809724,0.00063765055,0.7792364,0.00019814869,0.000056880453,0.0008884221,0.07134624,0.016192785,0.013346246],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988815,0.00020193993,0.000165375,0.0001440415,0.00054439815,0.00006274629],"domain_scores_gemma":[0.9954336,0.0023133894,0.00047100522,0.0007377822,0.00093922147,0.00010491226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015166597,0.0016411132,0.0005808915,0.0075083487,0.00063009537,0.0022867087,0.0011672665,0.0008882047,0.020682223],"category_scores_gemma":[0.009013194,0.00082835107,0.0011312632,0.002605436,0.000445093,0.0030343668,0.0015452956,0.0009167329,0.007622393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004020025,0.00024668267,0.010690149,0.0026712478,0.00029079797,0.0011964551,0.0015366635,0.016419362,0.025110906,0.019937597,0.17609012,0.74540794],"study_design_scores_gemma":[0.00021093668,0.00042737147,0.013299976,0.001459807,0.00051995355,0.0032791765,0.0015234703,0.31835532,0.105172366,0.054815035,0.50055534,0.0003812677],"about_ca_topic_score_codex":0.004411705,"about_ca_topic_score_gemma":0.0057573332,"teacher_disagreement_score":0.020682223,"about_ca_system_score_codex":0.0008249588,"about_ca_system_score_gemma":0.0019766581,"threshold_uncertainty_score":0.06918889},"labels":[],"label_agreement":null},{"id":"W4384079579","doi":"10.1007/978-3-031-36911-7_2","title":"Inferring Clusters of Orthologous and Paralogous Transcripts","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Ensembl; Gene; Orthologous Gene; Transcriptome; Computational biology; Homology (biology); Biology; Genetics; Genomics; Genome; Gene expression","score_opus":0.01785421899683178,"score_gpt":0.23620122554128592,"score_spread":0.21834700654445413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384079579","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.28895625,0.002704022,0.67560476,0.00037806382,0.00017267345,0.00022340532,0.013583636,0.006011285,0.012365962],"genre_scores_gemma":[0.4215928,0.0010202818,0.5272462,0.00019370651,0.00009695375,0.00021266018,0.039175987,0.001432958,0.009028517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926656,0.00013874022,0.00003374173,0.00030987745,0.00019461033,0.000056475514],"domain_scores_gemma":[0.99834144,0.00097257656,0.00014326774,0.00020845013,0.00024307016,0.00009119148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431275,0.0005488508,0.00057725376,0.0029723295,0.0008637387,0.0015586428,0.0009800975,0.0010136646,0.0075073545],"category_scores_gemma":[0.0028045373,0.0004891008,0.00094159174,0.0023946294,0.0005029687,0.0010187834,0.0010062831,0.000798988,0.0041858023],"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.0016706089,0.0003609713,0.08360024,0.0024966318,0.0003349749,0.0036708857,0.002202257,0.04240574,0.34093082,0.053315803,0.02529092,0.44372022],"study_design_scores_gemma":[0.00014465413,0.00037169087,0.06342322,0.00037639157,0.0003410375,0.0049611176,0.0021283727,0.49509567,0.13845259,0.16200697,0.13255085,0.00014742081],"about_ca_topic_score_codex":0.0012278401,"about_ca_topic_score_gemma":0.0013766408,"teacher_disagreement_score":0.0075073545,"about_ca_system_score_codex":0.0005997782,"about_ca_system_score_gemma":0.000680981,"threshold_uncertainty_score":0.025114596},"labels":[],"label_agreement":null},{"id":"W4384079729","doi":"10.1007/978-3-031-36911-7_7","title":"Gene Order Phylogeny via Ancestral Genome Reconstruction Under Dollo","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Genome; Matching (statistics); Ancestor; Binary number; Computer science; Phylogenetics; Order (exchange); Gene; Algorithm; Biology; Mathematics; Genetics; Law; Statistics; Arithmetic","score_opus":0.01839111349479331,"score_gpt":0.23577880478392693,"score_spread":0.21738769128913363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384079729","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.02492889,0.000108646076,0.97150683,0.00009315289,0.000021205606,0.000029486924,0.00011076643,0.00048203545,0.0027190263],"genre_scores_gemma":[0.16301703,0.0001857039,0.8337103,0.000086882836,0.000018529727,0.00007574269,0.0004126497,0.00023076074,0.0022623688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949026,0.00018872046,0.000029082768,0.00011248838,0.00013207141,0.0000473762],"domain_scores_gemma":[0.9992343,0.00037013454,0.00007067652,0.00019420657,0.00009063749,0.000040076717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927867,0.00047828312,0.00060928205,0.0011865705,0.00069554726,0.00083453866,0.00113821,0.0006891408,0.002982314],"category_scores_gemma":[0.0035382612,0.0005150705,0.00109171,0.0008848879,0.000921791,0.00088549097,0.0020589228,0.0009192028,0.0010351075],"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.00034765172,0.000053380663,0.007303314,0.00053688703,0.00015520155,0.00088474026,0.001261666,0.14367725,0.057109717,0.5515216,0.003560137,0.2335884],"study_design_scores_gemma":[0.000045679306,0.000099775716,0.0020580648,0.000104867846,0.000052225696,0.0006078406,0.00019007377,0.68107885,0.02470768,0.26837724,0.022625247,0.000052501353],"about_ca_topic_score_codex":0.0013207173,"about_ca_topic_score_gemma":0.0012000204,"teacher_disagreement_score":0.002982314,"about_ca_system_score_codex":0.00053945545,"about_ca_system_score_gemma":0.0006110528,"threshold_uncertainty_score":0.009976864},"labels":[],"label_agreement":null},{"id":"W4384079946","doi":"10.1007/978-3-031-36911-7_5","title":"Two Strikes Against the Phage Recombination Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bacteriophages and microbial interactions","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Heuristics; Bacteriophage; Genome; Bounded function; Population; Transformation (genetics); Recombination; Constant (computer programming); Boolean satisfiability problem; Matching (statistics); Computer science; Combinatorics; Mathematics; Algorithm; Biology; Mathematical optimization; Genetics; Gene","score_opus":0.014487642446118838,"score_gpt":0.2428695577915874,"score_spread":0.22838191534546856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384079946","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05123846,0.0363662,0.2292262,0.17170186,0.010746074,0.00010963108,0.00047812535,0.0017197025,0.4984137],"genre_scores_gemma":[0.64716697,0.012481209,0.09713621,0.03374466,0.0079005705,0.00037028964,0.00060376484,0.0016993231,0.19889699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970047,0.001156969,0.0001122522,0.00056346203,0.0007596461,0.00040296628],"domain_scores_gemma":[0.98815596,0.008099933,0.00033139772,0.0020543647,0.00067243143,0.0006859563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038903004,0.00085607474,0.0020482945,0.00089767284,0.0027986744,0.0051047783,0.0027660367,0.006908502,0.027334647],"category_scores_gemma":[0.020258598,0.00066562905,0.0010712638,0.0009206697,0.005934596,0.015143893,0.0036814446,0.008828976,0.00614099],"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.00022460996,0.0000663237,0.0001292321,0.00012947585,0.000019875924,0.000093424605,0.0002227269,0.0009774334,0.00075524114,0.9207591,0.029955702,0.046666887],"study_design_scores_gemma":[0.00009158486,0.00003095061,0.000082215854,0.000073805844,0.000012416254,0.00020708801,0.00013892072,0.0022225163,0.00072505546,0.95701176,0.039377455,0.000026300706],"about_ca_topic_score_codex":0.00045736996,"about_ca_topic_score_gemma":0.00030745068,"teacher_disagreement_score":0.027334647,"about_ca_system_score_codex":0.001379224,"about_ca_system_score_gemma":0.0010536506,"threshold_uncertainty_score":0.09144354},"labels":[],"label_agreement":null},{"id":"W4384080054","doi":"10.1007/978-3-031-36911-7_8","title":"Prior Density Learning in Variational Bayesian Phylogenetic Parameters Inference","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Markov chain Monte Carlo; Initialization; Inference; Bayesian inference; Artificial intelligence; Markov chain; Artificial neural network; Algorithm; Posterior probability; Bayesian probability; Machine learning; Mathematical optimization; Mathematics","score_opus":0.015804555228478987,"score_gpt":0.2404855657267207,"score_spread":0.2246810104982417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384080054","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.0008284943,0.0008742886,0.99706846,0.00022473694,0.000045516743,0.000016021762,0.000043500488,0.0001135047,0.00078555883],"genre_scores_gemma":[0.11960727,0.0032549843,0.86218125,0.0006021741,0.0006971772,0.000612906,0.000695444,0.0008286775,0.011520167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996637,0.002207923,0.00015613479,0.0003674883,0.00049659255,0.00013488342],"domain_scores_gemma":[0.97344625,0.02437815,0.00034143435,0.0008447946,0.00074996555,0.00023935277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008692981,0.0012918107,0.0032330928,0.0015129246,0.0009207772,0.0026237995,0.005660982,0.0043010684,0.006129255],"category_scores_gemma":[0.036865987,0.0034991829,0.002031195,0.0033224896,0.004085799,0.0047101965,0.0049918476,0.006818047,0.0015511808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096287265,0.000058680766,0.00053478923,0.00029993893,0.00014763152,0.000082099454,0.00018990805,0.6171961,0.00047166727,0.28819984,0.0054032537,0.087319724],"study_design_scores_gemma":[0.000010624635,0.000008162646,0.000072517,0.000025890833,0.0000120081795,0.000016253187,0.000007755497,0.84014344,0.00013985338,0.15819758,0.0013509339,0.000014989553],"about_ca_topic_score_codex":0.015594587,"about_ca_topic_score_gemma":0.010964706,"teacher_disagreement_score":0.015594587,"about_ca_system_score_codex":0.0026228898,"about_ca_system_score_gemma":0.0019531446,"threshold_uncertainty_score":0.04597342},"labels":[],"label_agreement":null},{"id":"W4384080222","doi":"10.1007/978-3-031-36911-7_1","title":"Classifying the Post-duplication Fate of Paralogous Genes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Gene duplication; In silico; Biology; Gene; Evolutionary biology; Computational biology; Genetics","score_opus":0.022305994293501233,"score_gpt":0.24965225781103031,"score_spread":0.22734626351752907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384080222","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.9764206,0.0013178722,0.011366561,0.00013601968,0.00003492055,0.000022279608,0.00084335887,0.000106779364,0.009751642],"genre_scores_gemma":[0.9707908,0.0011523714,0.01203945,0.000113449954,0.000045500343,0.000027349313,0.0051115155,0.00015621804,0.010563325],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998549,0.0000114733375,0.0000082664255,0.000035782257,0.000047854017,0.000041746778],"domain_scores_gemma":[0.99904865,0.0003932273,0.00011077267,0.00011687848,0.00021489148,0.00011563242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003564527,0.00012065769,0.000263784,0.0010070081,0.00038227206,0.001263918,0.00060396636,0.00044967534,0.0022428723],"category_scores_gemma":[0.00079928,0.00013166705,0.00023825846,0.0011223091,0.0005704845,0.001041073,0.0002916683,0.00066124706,0.0014328832],"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.0012469605,0.00013670277,0.18446632,0.00020752905,0.000034307228,0.0015743128,0.00087804894,0.0027359403,0.6080682,0.018051505,0.0019465724,0.18065356],"study_design_scores_gemma":[0.00007107324,0.0008185471,0.6557411,0.0001391573,0.0001687562,0.006722653,0.0039372984,0.035041317,0.17955908,0.057400804,0.06032102,0.00007925452],"about_ca_topic_score_codex":0.00068199186,"about_ca_topic_score_gemma":0.0011654295,"teacher_disagreement_score":0.0022428723,"about_ca_system_score_codex":0.00036527612,"about_ca_system_score_gemma":0.00029081473,"threshold_uncertainty_score":0.007503152},"labels":[],"label_agreement":null},{"id":"W4384080303","doi":"10.1007/978-3-031-36911-7_12","title":"Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Plant and animal studies","field":"Agricultural and Biological Sciences","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":"Université de Sherbrooke; University of Manitoba","funders":"","keywords":"Reticulate; Subnetwork; Phylogenetic tree; Computer science; Enhanced Data Rates for GSM Evolution; Class (philosophy); Binary number; Simple (philosophy); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Biology; Botany; Arithmetic","score_opus":0.09282194694088584,"score_gpt":0.24056186726144974,"score_spread":0.14773992032056388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384080303","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.5991765,0.00063762936,0.38594297,0.0011696188,0.00006747658,0.00017715801,0.0014423801,0.0010714208,0.01031484],"genre_scores_gemma":[0.89543283,0.0002782082,0.09523868,0.00018920604,0.00009042467,0.00011459979,0.0027019014,0.00023825475,0.0057160095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.00033417213,0.000044177043,0.00034940173,0.00018292585,0.00018877034],"domain_scores_gemma":[0.98503834,0.010716571,0.0012632681,0.0015953982,0.00070744206,0.00067895267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014726158,0.00067596586,0.0013095544,0.0018759292,0.0012067708,0.001733542,0.0022975334,0.0016123051,0.0060549933],"category_scores_gemma":[0.012509646,0.0010266198,0.0012003587,0.0013373487,0.0015286665,0.0034785776,0.0022534688,0.0019340577,0.0009043192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018270134,0.0005204877,0.043278832,0.0014846794,0.00069524394,0.0019113934,0.003660572,0.30448863,0.045264307,0.3962173,0.025985679,0.17466572],"study_design_scores_gemma":[0.000099316865,0.00014880761,0.00634438,0.0000681597,0.00013844612,0.0005017437,0.00093553454,0.5951202,0.005653864,0.38755056,0.0034028522,0.000036186368],"about_ca_topic_score_codex":0.001423401,"about_ca_topic_score_gemma":0.0031721261,"teacher_disagreement_score":0.0060549933,"about_ca_system_score_codex":0.00091773306,"about_ca_system_score_gemma":0.0005201984,"threshold_uncertainty_score":0.020255983},"labels":[],"label_agreement":null},{"id":"W4384303168","doi":"10.1007/978-3-031-36822-6_5","title":"Deep Learning Based Solution for Appliance Operational State Detection and Power Estimation in Non-intrusive Load Monitoring","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Energy Management","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Benchmarking; Deep learning; State (computer science); Artificial intelligence; Power (physics); Power consumption; Architecture; Real-time computing; Machine learning; Data mining; Algorithm","score_opus":0.009046948901280718,"score_gpt":0.2191299090918681,"score_spread":0.2100829601905874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384303168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026679192,0.0006101627,0.9684664,0.00021857799,0.00008805674,0.00003157039,0.00013353673,0.0009909341,0.0027815802],"genre_scores_gemma":[0.75277156,0.00061556266,0.22911409,0.00024945807,0.0001418658,0.0001077555,0.0005753083,0.00009157737,0.016332744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998542,0.000019363026,0.0000090975545,0.00004212464,0.000037464928,0.000037821406],"domain_scores_gemma":[0.9998172,0.0000730053,0.000017175418,0.00001898024,0.000061224986,0.000012416933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029236375,0.000605053,0.0005658913,0.00030702393,0.00022546963,0.00053708104,0.0008858547,0.00086522504,0.0024116323],"category_scores_gemma":[0.00055791996,0.00030628833,0.00047678896,0.00039518508,0.00019013375,0.00058978784,0.00068071,0.00087932043,0.00056118367],"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.00016981423,0.00024696635,0.0013918214,0.000110898865,0.00008178838,0.00012953105,0.00005528846,0.3508455,0.0145189045,0.0042979703,0.005041559,0.62311],"study_design_scores_gemma":[0.0000017331037,0.000014114288,0.0001525252,0.0000029013645,0.000004633397,0.000010694386,0.000003476972,0.99769163,0.0009954674,0.000846609,0.00027435587,0.0000017995613],"about_ca_topic_score_codex":0.005502199,"about_ca_topic_score_gemma":0.0089692315,"teacher_disagreement_score":0.005502199,"about_ca_system_score_codex":0.000392287,"about_ca_system_score_gemma":0.00063025457,"threshold_uncertainty_score":0.010940313},"labels":[],"label_agreement":null},{"id":"W4384346286","doi":"10.1007/978-3-031-36822-6_21","title":"Return Forecasting for Cryptocurrency Using Labeled Sequences and Reinforced Seq2Class Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision 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":"York University","funders":"","keywords":"Cryptocurrency; Computer science; Categorization; Artificial intelligence; Machine learning; Sequence (biology); Data mining; Computer security","score_opus":0.24758013908437054,"score_gpt":0.39848608272785374,"score_spread":0.1509059436434832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384346286","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.23650554,0.00064920704,0.7575798,0.00043182942,0.00019167305,0.000052536845,0.0006573078,0.0009790346,0.002953002],"genre_scores_gemma":[0.9216806,0.0003639422,0.06967476,0.000086250904,0.00011936898,0.000051088526,0.0012540587,0.000096594405,0.006673337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.000059885802,0.000012930454,0.00007522057,0.000062786836,0.00004754982],"domain_scores_gemma":[0.9985386,0.000840073,0.000106311905,0.00013242268,0.00030970603,0.000072852235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010788327,0.00060233945,0.00076528755,0.00092781807,0.00036370446,0.00078245916,0.0010563949,0.000668566,0.00247923],"category_scores_gemma":[0.0030196514,0.0002554566,0.0006843761,0.001041636,0.00031034293,0.0014374548,0.00044797256,0.0011646643,0.000617238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027165754,0.000093487244,0.004518162,0.000050000523,0.00005163501,0.00006923202,0.0000462566,0.8377779,0.0020387094,0.010013866,0.002827972,0.14224115],"study_design_scores_gemma":[0.0000013472838,0.000005398266,0.000104629005,0.0000010415959,0.0000019863505,0.0000023359084,0.0000012825552,0.9986524,0.00014868524,0.001015472,0.0000635758,0.0000018280925],"about_ca_topic_score_codex":0.019205168,"about_ca_topic_score_gemma":0.01695652,"teacher_disagreement_score":0.019205168,"about_ca_system_score_codex":0.00093897403,"about_ca_system_score_gemma":0.00083892694,"threshold_uncertainty_score":0.03818673},"labels":[],"label_agreement":null},{"id":"W4384471360","doi":"10.1007/978-3-031-37706-8_7","title":"Fast Termination and Workflow Nets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Soundness; Petri net; Computer science; Workflow; Correctness; Theoretical computer science; Concurrency; Upper and lower bounds; Programming language; Time complexity; Algorithm; Mathematics; Database","score_opus":0.018871863156787475,"score_gpt":0.22659536587635823,"score_spread":0.20772350271957074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384471360","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.02630474,0.0004093362,0.96305925,0.000583813,0.00009973675,0.00018617914,0.00015571313,0.001519442,0.007681922],"genre_scores_gemma":[0.4598189,0.00082740874,0.52387494,0.000494511,0.00018646619,0.00058180396,0.0010331918,0.0009398146,0.012242951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98955965,0.0035492736,0.0008541913,0.0014104443,0.003649248,0.0009772312],"domain_scores_gemma":[0.9629902,0.02589024,0.002043332,0.0034766737,0.0047248863,0.00087468524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008339694,0.0010256189,0.0011722813,0.001686741,0.0016409266,0.0038277642,0.0018049148,0.0020610853,0.004086703],"category_scores_gemma":[0.029116787,0.00085661374,0.0026872784,0.0013772991,0.006110392,0.0046229768,0.0036272116,0.004992928,0.0010695384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034396054,0.000108566666,0.0018428394,0.00040621692,0.00006904775,0.00068193197,0.00069254934,0.18259779,0.00936957,0.7491634,0.0019018961,0.05282224],"study_design_scores_gemma":[0.000055812303,0.00009187188,0.00017459893,0.00010597184,0.000030402816,0.00015771203,0.00007422663,0.23762037,0.0073145092,0.7466654,0.0076787383,0.000030347457],"about_ca_topic_score_codex":0.003350581,"about_ca_topic_score_gemma":0.002174957,"teacher_disagreement_score":0.008339694,"about_ca_system_score_codex":0.0029998987,"about_ca_system_score_gemma":0.0030757748,"threshold_uncertainty_score":0.044104993},"labels":[],"label_agreement":null},{"id":"W4384471467","doi":"10.1007/978-3-031-37709-9_18","title":"Early Verification of Legal Compliance via Bounded Satisfiability Checking","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Satisfiability modulo theories; Counterexample; Computer science; Satisfiability; Model checking; Formalism (music); Bounded function; Boolean satisfiability problem; Formal verification; Theoretical computer science; Solver; Property (philosophy); Algorithm; Programming language; Mathematics; Discrete mathematics","score_opus":0.05357459175041632,"score_gpt":0.30324636415967793,"score_spread":0.2496717724092616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384471467","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.05947013,0.00017027638,0.9294631,0.000686043,0.00006743427,0.0003265933,0.00031830068,0.0054435283,0.004054635],"genre_scores_gemma":[0.45869446,0.00014372925,0.5380265,0.00030926755,0.00002732098,0.00026404814,0.00071837765,0.00046998012,0.001346262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875986,0.0055337423,0.0007167723,0.0012400303,0.003917176,0.0009938162],"domain_scores_gemma":[0.95774424,0.03416862,0.0022241536,0.0029278793,0.002571791,0.00036321144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008250213,0.0011173211,0.001067468,0.002288562,0.0008823731,0.0025568,0.0030205129,0.0017255693,0.005170941],"category_scores_gemma":[0.0382261,0.00089954707,0.002587215,0.0014497843,0.003078623,0.0035587568,0.0031283023,0.0027376425,0.00076452654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000889439,0.0008852248,0.008120127,0.0010842846,0.00029706626,0.0016354716,0.0007139942,0.5871564,0.056738548,0.1609168,0.005687575,0.17587505],"study_design_scores_gemma":[0.000102258105,0.00010150859,0.00027413538,0.000080616956,0.00004612819,0.00010811563,0.00007496875,0.9291105,0.025336431,0.04279326,0.0019480282,0.000024048904],"about_ca_topic_score_codex":0.007585051,"about_ca_topic_score_gemma":0.007983262,"teacher_disagreement_score":0.008250213,"about_ca_system_score_codex":0.002162176,"about_ca_system_score_gemma":0.0053519635,"threshold_uncertainty_score":0.043631792},"labels":[],"label_agreement":null},{"id":"W4384471589","doi":"10.1007/978-3-031-37706-8_6","title":"Commutativity for Concurrent Program Termination Proofs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Commutative property; Computer science; Equivalence (formal languages); Bounded function; Programming language; Normalization property; Soundness; Concurrency; Theoretical computer science; Model checking; Algorithm; Discrete mathematics; Mathematics","score_opus":0.04280681412913767,"score_gpt":0.3076641941170086,"score_spread":0.26485737998787096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384471589","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.012609886,0.00035615335,0.97755194,0.00044924128,0.000094497416,0.00011325273,0.000045734334,0.001623641,0.007155633],"genre_scores_gemma":[0.44736186,0.0005642564,0.5442307,0.00067156163,0.00020621245,0.00034479916,0.00017474224,0.0007465618,0.005699369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98805934,0.0048803915,0.0008674596,0.0013707428,0.0041197627,0.0007022507],"domain_scores_gemma":[0.94445854,0.044411227,0.0011900621,0.005479585,0.0037573157,0.0007032606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010106503,0.0006722381,0.0009691553,0.0015755458,0.0018358774,0.0032061127,0.0019980986,0.0010979954,0.005273209],"category_scores_gemma":[0.033359505,0.0009283008,0.0016306397,0.0010729174,0.005899259,0.0065344097,0.0046717674,0.0038885009,0.001086068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002458044,0.0001345667,0.0012039881,0.00035801285,0.000052384712,0.00039943756,0.0013754833,0.01495818,0.010721571,0.8633239,0.002956915,0.10426971],"study_design_scores_gemma":[0.000111297864,0.00009911789,0.00022630961,0.00018851866,0.00008466772,0.00025178923,0.00012199898,0.1181774,0.025666287,0.83577484,0.019232407,0.00006527389],"about_ca_topic_score_codex":0.0023859513,"about_ca_topic_score_gemma":0.0017595197,"teacher_disagreement_score":0.010106503,"about_ca_system_score_codex":0.0020397864,"about_ca_system_score_gemma":0.002577065,"threshold_uncertainty_score":0.053448915},"labels":[],"label_agreement":null},{"id":"W4384570012","doi":"10.1007/978-3-031-33842-7_5","title":"Temporally Adjustable Longitudinal Fluid-Attenuated Inversion Recovery MRI Estimation / Synthesis for Multiple Sclerosis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Inversion (geology); Multiple sclerosis; Artificial intelligence; Geology; Medicine; Seismology","score_opus":0.061858325959778665,"score_gpt":0.28945797768817205,"score_spread":0.2275996517283934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384570012","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.0035433355,0.00094110874,0.99363756,0.00010313548,0.000043498145,0.000008859801,0.000055874247,0.0004197362,0.0012469002],"genre_scores_gemma":[0.082283296,0.002605733,0.8992018,0.000118496006,0.00016025905,0.000062373074,0.0003741637,0.00051565055,0.014678056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999341,0.00001686079,0.00000410019,0.000013730504,0.000025791782,0.0000055475034],"domain_scores_gemma":[0.999814,0.00010177071,0.00002236561,0.000019684008,0.000034519373,0.000007621339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026752413,0.00043387795,0.00019707129,0.00021177932,0.000103785314,0.00032259146,0.0003343809,0.00046705792,0.0030867837],"category_scores_gemma":[0.00071228447,0.00020204601,0.0002473359,0.00024157276,0.00016193381,0.0004022027,0.000388894,0.00049406535,0.00148434],"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.0002569291,0.00004272906,0.00026000544,0.00026628148,0.000038655424,0.00015602254,0.00007632564,0.05240619,0.33312374,0.008343742,0.0047300686,0.60029936],"study_design_scores_gemma":[0.000022611823,0.00017407672,0.00092350866,0.00006663589,0.000054839646,0.0006801332,0.000045863173,0.7943727,0.16279341,0.008585288,0.032244105,0.000036889083],"about_ca_topic_score_codex":0.00049673434,"about_ca_topic_score_gemma":0.0010675148,"teacher_disagreement_score":0.0030867837,"about_ca_system_score_codex":0.00011156242,"about_ca_system_score_gemma":0.00023417624,"threshold_uncertainty_score":0.010326266},"labels":[],"label_agreement":null},{"id":"W4384570451","doi":"10.1007/978-3-031-33842-7_17","title":"Multi-modal Brain Tumour Segmentation Using Transformer with Optimal Patch Size","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Queen's University","funders":"","keywords":"Computer science; Transformer; Modal; Segmentation; Speech recognition; Artificial intelligence; Electrical engineering; Voltage; Materials science; Composite material","score_opus":0.04753385199735046,"score_gpt":0.2847275195661993,"score_spread":0.23719366756884883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384570451","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.010597428,0.00027036582,0.98704416,0.00005110754,0.00002954052,0.000023412844,0.000066740125,0.0006791308,0.0012381107],"genre_scores_gemma":[0.1786734,0.0006880635,0.81707823,0.000097222524,0.000084415406,0.000055852568,0.00033175462,0.00050142896,0.0024895493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998385,0.000021326108,0.000009934827,0.00004553776,0.00006178558,0.000023044313],"domain_scores_gemma":[0.9997603,0.00009147737,0.000020318314,0.000045348374,0.00006111627,0.000021451679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041748767,0.00053062633,0.0006554714,0.00076551404,0.00017494989,0.0007989587,0.00063725165,0.000694693,0.003326697],"category_scores_gemma":[0.00079464976,0.00039804398,0.0007639818,0.000887112,0.00030349262,0.0011281165,0.000751058,0.0007298034,0.001350266],"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.0004138996,0.00008254791,0.0007209229,0.00028393077,0.00009952365,0.00018450229,0.00009775378,0.029931515,0.27230245,0.005833019,0.003735652,0.6863143],"study_design_scores_gemma":[0.000037631522,0.0002190436,0.00171335,0.000030319985,0.00018173283,0.002287067,0.00008000512,0.82460743,0.15213001,0.010778939,0.007883796,0.00005057306],"about_ca_topic_score_codex":0.00059006474,"about_ca_topic_score_gemma":0.000877891,"teacher_disagreement_score":0.003326697,"about_ca_system_score_codex":0.00019181718,"about_ca_system_score_gemma":0.00034518377,"threshold_uncertainty_score":0.011128843},"labels":[],"label_agreement":null},{"id":"W4384573135","doi":"10.1007/978-3-031-37703-7_4","title":"Fast Approximations of Quantifier Elimination","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Israel Science Foundation; Microsoft Research","keywords":"Quantifier elimination; Computer science; Reduction (mathematics); Quantifier (linguistics); Projection (relational algebra); Solver; Equivalence (formal languages); Satisfiability modulo theories; Algorithm; Horn clause; Theoretical computer science; Programming language; Prolog; Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.045578936242325355,"score_gpt":0.2978557020979952,"score_spread":0.2522767658556699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384573135","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.023629956,0.000395067,0.95544714,0.00030814655,0.000097761236,0.0000880204,0.00035861446,0.012015827,0.007659461],"genre_scores_gemma":[0.33146176,0.00038586036,0.6551256,0.00036686196,0.00006421485,0.0001821267,0.0014509417,0.003078086,0.007884474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598014,0.0009903236,0.00014835544,0.00044701708,0.0019521042,0.00048191135],"domain_scores_gemma":[0.9944289,0.0033252423,0.00020931638,0.001287734,0.00065719354,0.00009165861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025881357,0.001090205,0.0011370671,0.0014268272,0.00067640154,0.0022519757,0.0024446074,0.00076947955,0.011860725],"category_scores_gemma":[0.010496101,0.0008448166,0.0020863535,0.0014102586,0.001870936,0.00432855,0.0037101265,0.0030321246,0.0024604544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007796432,0.00023200485,0.00262205,0.00089409976,0.00014999323,0.00031910115,0.0006130971,0.27119675,0.026302781,0.3528886,0.0209637,0.32303807],"study_design_scores_gemma":[0.00008172215,0.00008493976,0.00029995025,0.00008630222,0.000044808156,0.00010148492,0.0000815312,0.7729696,0.023967491,0.1824132,0.019837096,0.000031787044],"about_ca_topic_score_codex":0.005696927,"about_ca_topic_score_gemma":0.0072560906,"teacher_disagreement_score":0.011860725,"about_ca_system_score_codex":0.002364209,"about_ca_system_score_gemma":0.0020226885,"threshold_uncertainty_score":0.039678097},"labels":[],"label_agreement":null},{"id":"W4384788087","doi":"10.1007/978-3-031-36819-6_4","title":"A Selective Supervised Latent Beta-Liouville Allocation for Document Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Concordia University","funders":"","keywords":"Computer science; Latent Dirichlet allocation; Inference; Artificial intelligence; Bernoulli's principle; Dirichlet distribution; Machine learning; Simple (philosophy); Prior probability; Gibbs sampling; Topic model; Word (group theory); Pattern recognition (psychology); Bayesian probability; Mathematics","score_opus":0.041366077434778034,"score_gpt":0.2744832432710408,"score_spread":0.23311716583626274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384788087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036388081,0.00022497043,0.9942643,0.00008506833,0.000052800286,0.000043457312,0.00006741265,0.0008358881,0.0007872308],"genre_scores_gemma":[0.12869324,0.00035943257,0.8542087,0.00039474102,0.00031421115,0.00059243635,0.001324623,0.0005445735,0.013568104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974464,0.0012835605,0.0001248264,0.00041750647,0.000522174,0.00020546724],"domain_scores_gemma":[0.99731404,0.0012649084,0.00009423972,0.0006116931,0.0005716792,0.00014330345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034397217,0.00078845036,0.002072194,0.0014475252,0.0013315299,0.0017650216,0.003730559,0.0018571403,0.006599693],"category_scores_gemma":[0.00581146,0.00062428607,0.001426027,0.0022897501,0.0011816347,0.0024465898,0.0029454457,0.0026463494,0.003961762],"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.00056003814,0.00040033588,0.0007224342,0.0001694193,0.0001359239,0.00006042704,0.00016126683,0.07629637,0.012009195,0.056067113,0.016525354,0.836892],"study_design_scores_gemma":[0.00004347053,0.00007595666,0.00015873404,0.000014857042,0.000022729979,0.000049818387,0.000021836104,0.9624633,0.0029919627,0.031136652,0.0030024084,0.000018281653],"about_ca_topic_score_codex":0.0033836612,"about_ca_topic_score_gemma":0.005761694,"teacher_disagreement_score":0.006599693,"about_ca_system_score_codex":0.0011955805,"about_ca_system_score_gemma":0.0023370998,"threshold_uncertainty_score":0.022078156},"labels":[],"label_agreement":null},{"id":"W4385009000","doi":"10.1007/978-3-031-32415-4_29","title":"Fides: A System for Verifiable Computation Using Smart Contracts","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Computer science; Server; Verifiable secret sharing; Delegation; Computation; Smart contract; Cryptography; Theoretical computer science; Secret sharing; Cloud computing; Protocol (science); Computer security; Distributed computing; Database transaction; Computer network; Operating system; Algorithm; Database; Programming language","score_opus":0.03359754693691474,"score_gpt":0.2690848659029016,"score_spread":0.23548731896598685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385009000","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.009933753,0.00046231516,0.89907867,0.0006157061,0.0004955242,0.00028676115,0.0010614247,0.062500566,0.02556538],"genre_scores_gemma":[0.36357287,0.001013934,0.5131329,0.0015929152,0.0005308396,0.0010005715,0.0036549855,0.013333493,0.10216744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814475,0.00045883175,0.000129023,0.00028473296,0.0007379054,0.0002447364],"domain_scores_gemma":[0.9973871,0.00084830134,0.00012171599,0.0012740232,0.00020879437,0.00016006896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022513599,0.0009651502,0.0010823301,0.0013216812,0.0011257628,0.0032588353,0.0027906268,0.0018421182,0.029416706],"category_scores_gemma":[0.005479623,0.0011731258,0.0008872071,0.0011029462,0.0023020788,0.007904505,0.0052130064,0.0034882014,0.01125528],"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.0018418169,0.00023584397,0.000849972,0.0004717208,0.00010179466,0.00028052073,0.00065296586,0.009724568,0.019478772,0.5700305,0.12306627,0.2732653],"study_design_scores_gemma":[0.00054844044,0.00030404632,0.00048053978,0.000156892,0.00012703489,0.0005839185,0.00010386882,0.20996073,0.069929406,0.39452788,0.32307947,0.00019774081],"about_ca_topic_score_codex":0.00072146964,"about_ca_topic_score_gemma":0.00073741167,"teacher_disagreement_score":0.029416706,"about_ca_system_score_codex":0.00091463106,"about_ca_system_score_gemma":0.0014546743,"threshold_uncertainty_score":0.0984087},"labels":[],"label_agreement":null},{"id":"W4385009077","doi":"10.1007/978-3-031-32415-4","title":"Financial Cryptography and Data Security. FC 2022 International Workshops","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Western University","funders":"","keywords":"Computer science; Cryptography; Focus (optics); Information security; Data security; Financial cryptography; Computer security; Finance; Public-key cryptography; Encryption; Business","score_opus":0.013934815727684327,"score_gpt":0.2622094456945901,"score_spread":0.24827462996690577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385009077","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005030467,0.1879634,0.04819989,0.008296128,0.013310972,0.00010101568,0.0010035606,0.001193264,0.73490137],"genre_scores_gemma":[0.033943757,0.046478257,0.012237636,0.00063738454,0.003264291,0.00006664089,0.0010072513,0.00028415243,0.9020806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961,0.000058526555,0.000014248127,0.000051434992,0.0001928451,0.000072936455],"domain_scores_gemma":[0.99954045,0.0001739116,0.000027176473,0.00007368292,0.000116806834,0.00006800469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641384,0.0013504447,0.0007859834,0.0014017907,0.0005992705,0.002463137,0.0009287724,0.0012752825,0.0561228],"category_scores_gemma":[0.0008624314,0.00053427054,0.0006047662,0.0019936962,0.0006748896,0.0021793647,0.0010915966,0.0018959144,0.024197742],"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.00013786709,0.00011560573,0.00012670341,0.00037213432,0.000022037308,0.00009887057,0.00007211423,0.002025378,0.0022539694,0.06038793,0.5694199,0.36496744],"study_design_scores_gemma":[0.000031119205,0.000051824234,0.0007138045,0.00036034678,0.000016171043,0.00042607365,0.0000648387,0.005381832,0.003131125,0.061267894,0.9285317,0.000023167351],"about_ca_topic_score_codex":0.0015590903,"about_ca_topic_score_gemma":0.0024022462,"teacher_disagreement_score":0.0561228,"about_ca_system_score_codex":0.0016735316,"about_ca_system_score_gemma":0.0009711574,"threshold_uncertainty_score":0.18774945},"labels":[],"label_agreement":null},{"id":"W4385009902","doi":"10.1007/978-3-031-32415-4_10","title":"Privacy-Preserving Post-quantum Credentials for Digital Payments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Bank of Canada","funders":"","keywords":"Computer science; Credential; Homomorphic encryption; Commitment scheme; Computer security; Encryption; Random oracle; Zero-knowledge proof; Theoretical computer science; Quantum computer; Quantum; Learning with errors; Cryptography; Public-key cryptography","score_opus":0.026521137398159242,"score_gpt":0.26834902734974836,"score_spread":0.2418278899515891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385009902","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.049166787,0.0011849856,0.8780662,0.002636905,0.0007789932,0.00020166735,0.0003398552,0.0008979476,0.06672662],"genre_scores_gemma":[0.89036435,0.0009267523,0.07317004,0.00046188774,0.00046145386,0.00013166851,0.00019919194,0.00017867018,0.034105834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968058,0.0008470246,0.00019767098,0.00043727012,0.0011264805,0.0005857781],"domain_scores_gemma":[0.99531806,0.0018251429,0.00021488554,0.0020769117,0.0003671649,0.00019788124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025343674,0.0005651553,0.0010370249,0.00063969387,0.0020200557,0.004692166,0.0018332091,0.002075243,0.010676952],"category_scores_gemma":[0.009070582,0.0005550105,0.00084032904,0.001406294,0.004062666,0.008335991,0.0041993037,0.0047542094,0.003403793],"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.00011330785,0.000047677797,0.00006159659,0.00006033175,0.0000072581397,0.00006541096,0.00010051193,0.0038380055,0.0017485205,0.96619093,0.0022060073,0.02556042],"study_design_scores_gemma":[0.000024246243,0.000032878484,0.000060992446,0.000024044668,0.000007770279,0.0001327129,0.000029135588,0.023179155,0.00257228,0.9670746,0.0068434463,0.000018910114],"about_ca_topic_score_codex":0.00029083635,"about_ca_topic_score_gemma":0.00030316063,"teacher_disagreement_score":0.010676952,"about_ca_system_score_codex":0.0015276704,"about_ca_system_score_gemma":0.0017091752,"threshold_uncertainty_score":0.035717964},"labels":[],"label_agreement":null},{"id":"W4385012192","doi":"10.1007/978-3-031-32415-4_31","title":"Dispute-Free Scalable Open Vote Network Using zk-SNARKs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Concordia University","funders":"","keywords":"Computer science; Correctness; Scalability; Leader election; Implementation; Verifiable secret sharing; Computation; Smart contract; Zero-knowledge proof; Homomorphic encryption; Voting; Protocol (science); Distributed computing; Theoretical computer science; Computer security; Cryptography; Algorithm; Programming language; Encryption; Operating system; Blockchain","score_opus":0.03244561749592349,"score_gpt":0.2704134622859956,"score_spread":0.2379678447900721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385012192","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.15412006,0.0006228652,0.7845771,0.0020504168,0.0008459999,0.00068078976,0.0014940869,0.0098807,0.045727924],"genre_scores_gemma":[0.9255502,0.00019057839,0.059588205,0.00022175831,0.0001345276,0.00025579712,0.0010181672,0.00036129088,0.012679516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976502,0.0004163231,0.00015148704,0.00040004996,0.0008513093,0.00053063704],"domain_scores_gemma":[0.99447435,0.0015930855,0.00034875103,0.0024761327,0.0006712784,0.00043645958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814259,0.0005252395,0.0017786345,0.0009747326,0.0028614593,0.0036016104,0.0028962328,0.0013907301,0.011660225],"category_scores_gemma":[0.0059781647,0.0005047676,0.0007320707,0.0014552522,0.0017940225,0.008245974,0.0085449815,0.0028386617,0.0025331513],"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.0042201723,0.00096774974,0.0018426575,0.00048085788,0.00017824536,0.00062959467,0.00085162546,0.099008895,0.029259823,0.5566356,0.04919475,0.25673002],"study_design_scores_gemma":[0.00041386997,0.000248823,0.00041244677,0.000044668206,0.000088648674,0.00021785965,0.00032887748,0.6045005,0.0130175855,0.36590332,0.014735518,0.00008800462],"about_ca_topic_score_codex":0.0013327124,"about_ca_topic_score_gemma":0.0020980092,"teacher_disagreement_score":0.011660225,"about_ca_system_score_codex":0.0016107614,"about_ca_system_score_gemma":0.002466124,"threshold_uncertainty_score":0.039007306},"labels":[],"label_agreement":null},{"id":"W4385012499","doi":"10.1007/978-3-031-32415-4_33","title":"Not so Immutable: Upgradeability of Smart Contracts on Ethereum","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":31,"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; Upgrade; Proxy (statistics); Smart contract; Computer security; Transparency (behavior); Blockchain; Operating system","score_opus":0.018225715930225973,"score_gpt":0.24994836513153335,"score_spread":0.23172264920130736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385012499","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.23428282,0.0013950234,0.5961784,0.004478608,0.0006059842,0.00016566511,0.00035314664,0.0016642244,0.16087618],"genre_scores_gemma":[0.943106,0.00065184484,0.034774344,0.00028948896,0.00018773472,0.00009685835,0.0002131037,0.0003398814,0.02034087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782515,0.00060932705,0.00013797496,0.00036678338,0.0006582543,0.0004024705],"domain_scores_gemma":[0.98979783,0.005434597,0.00046884193,0.0032934407,0.0006549189,0.00035042432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003341587,0.00042148767,0.0007512151,0.0008734064,0.0014514081,0.0029190027,0.0015434243,0.0014987749,0.008308955],"category_scores_gemma":[0.016262686,0.00065527495,0.00089329155,0.0013676807,0.003799421,0.014639051,0.0043671834,0.004804303,0.0009231212],"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.00010787154,0.000026185326,0.00022422384,0.000039483723,0.000007982076,0.0001467964,0.0002865595,0.004478848,0.0010572985,0.96686226,0.0014960415,0.025266444],"study_design_scores_gemma":[0.000016954935,0.000017860533,0.000119692355,0.000018896857,0.000008294884,0.000083076266,0.000050580307,0.019047601,0.0013242711,0.97478354,0.0045177825,0.000011453219],"about_ca_topic_score_codex":0.0009447293,"about_ca_topic_score_gemma":0.00066493254,"teacher_disagreement_score":0.008308955,"about_ca_system_score_codex":0.0010501052,"about_ca_system_score_gemma":0.000955223,"threshold_uncertainty_score":0.027796209},"labels":[],"label_agreement":null},{"id":"W4385062874","doi":"10.1007/978-3-031-35969-9_13","title":"The Mediation Role of Compatible Advantage in Mobile Wallet Usage","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Mobile payment; Computer science; Payment; Mainstream; Compatibility (geochemistry); Mobile device; Mediation; Innovation diffusion; Internet privacy; Knowledge management; World Wide Web","score_opus":0.04221076614955403,"score_gpt":0.33708089952975256,"score_spread":0.2948701333801985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385062874","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.92239004,0.0011409646,0.0066534677,0.0018088155,0.00007081205,0.000081524064,0.0003420526,0.00011821242,0.06739415],"genre_scores_gemma":[0.9964406,0.00021820913,0.000794635,0.000043915123,0.000021642523,0.000018733313,0.000055127886,0.000016143427,0.0023909756],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99874735,0.0006227249,0.00004936995,0.00017875522,0.0002091597,0.00019258133],"domain_scores_gemma":[0.98476505,0.0126748765,0.0010925033,0.0006629797,0.00031466587,0.0004900091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011453638,0.00060498406,0.00046726456,0.00094408006,0.0006136134,0.0033440273,0.00077343907,0.0015283767,0.017623516],"category_scores_gemma":[0.013929888,0.00053040084,0.0007042143,0.00076982245,0.0010389923,0.0039679687,0.0015827179,0.0017222384,0.0010113611],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004158546,0.0028681958,0.43684915,0.0008368837,0.0011544501,0.005815255,0.01642344,0.005504812,0.05550038,0.31628862,0.0032238737,0.1513763],"study_design_scores_gemma":[0.0004823423,0.0021157193,0.6678806,0.0005896653,0.002088339,0.003303577,0.016067335,0.035087254,0.015409218,0.24255559,0.0142030455,0.00021730817],"about_ca_topic_score_codex":0.003348881,"about_ca_topic_score_gemma":0.0024112575,"teacher_disagreement_score":0.017623516,"about_ca_system_score_codex":0.0006176449,"about_ca_system_score_gemma":0.00084953255,"threshold_uncertainty_score":0.058956504},"labels":[],"label_agreement":null},{"id":"W4385063071","doi":"10.1007/978-3-031-35969-9_16","title":"Consumers’ Intentions to Use Mobile Food Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision 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":"Toronto Metropolitan University","funders":"","keywords":"Expectancy theory; Habit; Affect (linguistics); Unified theory of acceptance and use of technology; Consumption (sociology); Computer science; Social influence; Marketing; Advertising; Psychology; Business; Social psychology; Sociology","score_opus":0.12280037857839382,"score_gpt":0.3643602289238872,"score_spread":0.24155985034549338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385063071","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.99408406,0.000093512615,0.00012898774,0.00018072122,0.0000086992395,0.000010395087,0.00009419384,0.000004987518,0.005394542],"genre_scores_gemma":[0.9951019,0.00013184037,0.00016880872,0.000088543326,0.0000064332194,0.000016700464,0.000120233126,0.0000041965122,0.004361234],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99973613,0.000076361146,0.000016521093,0.00003179529,0.00010309635,0.000036021913],"domain_scores_gemma":[0.99569714,0.002916835,0.0006466028,0.000105077735,0.00045220682,0.0001820824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008526361,0.0001556451,0.000116032585,0.00037351725,0.0002465521,0.0011942766,0.00016439051,0.0006915718,0.007237264],"category_scores_gemma":[0.005818271,0.00029958063,0.00039958165,0.00037110338,0.00030652087,0.000743683,0.000310838,0.00084656174,0.0009649543],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007242309,0.0009330027,0.94186103,0.00015368866,0.00018615458,0.00025659509,0.011700066,0.00031565226,0.0041253767,0.0009189453,0.001432165,0.03739302],"study_design_scores_gemma":[0.000022453665,0.00047002197,0.98450315,0.0000673812,0.00012087762,0.00017081352,0.010506794,0.0010585585,0.0009342597,0.00038059638,0.0017416009,0.000023348473],"about_ca_topic_score_codex":0.004843102,"about_ca_topic_score_gemma":0.006036485,"teacher_disagreement_score":0.007237264,"about_ca_system_score_codex":0.0002716372,"about_ca_system_score_gemma":0.00013276465,"threshold_uncertainty_score":0.02421105},"labels":[],"label_agreement":null},{"id":"W4385317346","doi":"10.1007/978-3-031-38906-1_7","title":"A Parameterized Approximation Scheme for Generalized Partial Vertex Cover","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Alberta","funders":"","keywords":"Vertex cover; Parameterized complexity; Combinatorics; Cover (algebra); Mathematics; Vertex (graph theory); Partition (number theory); Discrete mathematics; Time complexity; Graph","score_opus":0.04523031406818988,"score_gpt":0.30699976659108835,"score_spread":0.26176945252289846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08417996,0.0006803163,0.8785941,0.0008974376,0.00019694825,0.0004629372,0.0019460836,0.0035195393,0.029522616],"genre_scores_gemma":[0.45452946,0.0008586468,0.5174813,0.0003088569,0.00019479834,0.00059055025,0.0040997122,0.0009035121,0.021033218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808204,0.00028876023,0.000105049534,0.00042350974,0.00075408356,0.00034657752],"domain_scores_gemma":[0.99733055,0.0007322225,0.000110542955,0.0014774834,0.00018110267,0.0001681467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864795,0.0011033845,0.0018393821,0.001326203,0.0013899112,0.004245351,0.00427512,0.0013812844,0.0128196385],"category_scores_gemma":[0.004300499,0.00073364703,0.0016753409,0.0049181567,0.0012250381,0.0074164355,0.005202646,0.0033833652,0.0019443108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009900295,0.0003908338,0.00093929056,0.00046054702,0.00010205782,0.00017435575,0.0005674452,0.124512196,0.010694518,0.49398893,0.02092735,0.34625235],"study_design_scores_gemma":[0.0001723951,0.00012218325,0.0004989155,0.00007401409,0.00010196145,0.0002561795,0.00017659512,0.45152342,0.0045660576,0.52027726,0.022182759,0.000048326277],"about_ca_topic_score_codex":0.003447126,"about_ca_topic_score_gemma":0.004218451,"teacher_disagreement_score":0.0128196385,"about_ca_system_score_codex":0.0043582274,"about_ca_system_score_gemma":0.0020774722,"threshold_uncertainty_score":0.04288602},"labels":[],"label_agreement":null},{"id":"W4385317379","doi":"10.1007/978-3-031-38906-1_16","title":"Hardness of Graph-Structured Algebraic and Symbolic Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Algebraic number; Combinatorics; Discrete mathematics; Laplacian matrix; Coefficient matrix; Diagonal; Polynomial; Polynomial ring; Matrix (chemical analysis); Graph; Field (mathematics); Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.022552788461934904,"score_gpt":0.23496622140103143,"score_spread":0.21241343293909654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317379","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21762542,0.0061999923,0.33719403,0.03157643,0.00094486435,0.00034291646,0.005155789,0.0015607856,0.3993998],"genre_scores_gemma":[0.8561659,0.0054349373,0.07245016,0.002336424,0.0022176309,0.00041791957,0.005718838,0.0006943834,0.05456386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975459,0.0005654635,0.000102682396,0.0005226718,0.00091924996,0.0003441147],"domain_scores_gemma":[0.9868461,0.010917562,0.00047198375,0.0009936752,0.0004150341,0.00035572477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011305856,0.0011579302,0.001783381,0.0016627738,0.0023533874,0.0051870104,0.0035465555,0.0024776938,0.017792094],"category_scores_gemma":[0.011270207,0.0011926135,0.0022973586,0.0035631033,0.0053511104,0.015851876,0.003885864,0.008534714,0.0019090625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022188222,0.00014383797,0.00051203027,0.00057881855,0.00005099506,0.0001310779,0.00052168313,0.019120324,0.00090764544,0.9255562,0.020529894,0.03172568],"study_design_scores_gemma":[0.000028622559,0.0000080340005,0.00016093781,0.000021722315,0.00001094184,0.00005234237,0.00007071718,0.007355457,0.00024612134,0.98837495,0.003662856,0.000007459715],"about_ca_topic_score_codex":0.0022351067,"about_ca_topic_score_gemma":0.0022008386,"teacher_disagreement_score":0.017792094,"about_ca_system_score_codex":0.0026824218,"about_ca_system_score_gemma":0.001719382,"threshold_uncertainty_score":0.059520543},"labels":[],"label_agreement":null},{"id":"W4385317406","doi":"10.1007/978-3-031-38906-1_21","title":"General Space-Time Tradeoffs via Relational Queries","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Relational database; Theoretical computer science; Data structure; Relational algebra; Query language; Data mining; Programming language","score_opus":0.020505409110681057,"score_gpt":0.22861862985513853,"score_spread":0.20811322074445748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1284103,0.028911151,0.66398776,0.012342041,0.0010074638,0.00033160872,0.0029998051,0.004142878,0.15786694],"genre_scores_gemma":[0.8222962,0.010676769,0.12761702,0.0017386876,0.0023445967,0.00038755097,0.0015193623,0.0032177235,0.030202083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876952,0.0037886563,0.00050800643,0.0016355348,0.003535986,0.002836466],"domain_scores_gemma":[0.9497289,0.037523832,0.0012808298,0.008843915,0.001614612,0.0010079317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009228542,0.003277846,0.0040010666,0.0031300264,0.0020389133,0.011014101,0.0058305915,0.004502836,0.04106142],"category_scores_gemma":[0.049209252,0.0016040563,0.0021221107,0.008291457,0.003453153,0.031555843,0.005437106,0.0049523474,0.005902632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002556474,0.0004246221,0.00097198726,0.0011568974,0.00017844001,0.00017916881,0.0005304401,0.15603706,0.012883308,0.67282194,0.03255432,0.11970533],"study_design_scores_gemma":[0.00013690648,0.00014802162,0.0004154821,0.00012765081,0.00015522329,0.00032438402,0.00023517435,0.26067254,0.004087078,0.72637594,0.0072535863,0.00006813102],"about_ca_topic_score_codex":0.001649919,"about_ca_topic_score_gemma":0.0016767117,"teacher_disagreement_score":0.04106142,"about_ca_system_score_codex":0.0053882077,"about_ca_system_score_gemma":0.0023433997,"threshold_uncertainty_score":0.13736415},"labels":[],"label_agreement":null},{"id":"W4385339495","doi":"10.1007/978-3-031-37745-7","title":"Pattern Recognition, Computer Vision, and Image Processing. ICPR 2022 International Workshops and Challenges","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Ontario Tech University; York University","funders":"","keywords":"Computer science; Biometrics; Image processing; Computer vision; Artificial intelligence; Image (mathematics)","score_opus":0.020919602689181638,"score_gpt":0.2614261664746392,"score_spread":0.24050656378545754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385339495","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045691347,0.32201776,0.40584797,0.009457324,0.022419497,0.00044830586,0.0031375212,0.012390134,0.21971242],"genre_scores_gemma":[0.018960804,0.17055348,0.22049588,0.0024639112,0.008148778,0.00036982237,0.007318222,0.0027218098,0.56896734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981329,0.00018473541,0.000099215846,0.00032176205,0.0011162603,0.00014523271],"domain_scores_gemma":[0.9983103,0.00040216517,0.00008458403,0.00029710386,0.0006952417,0.00021058599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002213972,0.0020853004,0.0022918426,0.0026303788,0.0006020815,0.0038342134,0.0025015313,0.0021826364,0.04581776],"category_scores_gemma":[0.0019265596,0.0012403907,0.0013350105,0.0039110747,0.001118987,0.00420846,0.0033572533,0.0026935914,0.05900038],"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.00006361788,0.000102955404,0.00014409419,0.00069837103,0.000031336716,0.00008333298,0.000042768817,0.0008866628,0.0041840845,0.0064510857,0.34731787,0.6399938],"study_design_scores_gemma":[0.000019382516,0.0001388741,0.0013856137,0.00031040164,0.00003307978,0.0017858687,0.00007744376,0.009463597,0.005057059,0.014861951,0.9668164,0.000050303584],"about_ca_topic_score_codex":0.0018753313,"about_ca_topic_score_gemma":0.002390565,"teacher_disagreement_score":0.04581776,"about_ca_system_score_codex":0.0007167373,"about_ca_system_score_gemma":0.0015146472,"threshold_uncertainty_score":0.15327567},"labels":[],"label_agreement":null},{"id":"W4385339577","doi":"10.1007/978-3-031-37745-7_8","title":"Sensorimotor System Design of Socially Intelligent Robots","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Automated Systems","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":"York University","funders":"","keywords":"Computer science; Robot; Human–computer interaction; Architecture; Social robot; Field (mathematics); Value (mathematics); Artificial intelligence; Mobile robot; Robot control; Machine learning","score_opus":0.029315095844766867,"score_gpt":0.2285017057596128,"score_spread":0.19918660991484594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385339577","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070187952,0.00032770648,0.97817516,0.00015191041,0.00003427854,0.00004533959,0.000021311285,0.00019898194,0.0140265105],"genre_scores_gemma":[0.68665165,0.0008347993,0.2874592,0.00013942026,0.00005608221,0.00048745918,0.00011778863,0.0001507491,0.024102835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970704,0.00010248841,0.000017258393,0.000055722412,0.000081590035,0.000035799938],"domain_scores_gemma":[0.99985754,0.000060735165,0.000016068432,0.000018711948,0.000036240934,0.000010613823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054610235,0.00043946112,0.00056755956,0.00024009719,0.00042406138,0.0008441769,0.0009481546,0.0008537735,0.006428712],"category_scores_gemma":[0.0008301649,0.00039397576,0.0004784628,0.00022605062,0.000680905,0.00062097574,0.0012462693,0.00049260055,0.0008840128],"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.00008594913,0.000063996966,0.00027445448,0.00030103826,0.000063372856,0.00017660322,0.0003737938,0.63658047,0.018059408,0.20624842,0.0028439676,0.1349285],"study_design_scores_gemma":[0.000023239356,0.00010587195,0.00016078766,0.000035467667,0.000022964074,0.00007200847,0.00007137407,0.91332996,0.0024852804,0.076308705,0.0073732315,0.000011019743],"about_ca_topic_score_codex":0.0014129545,"about_ca_topic_score_gemma":0.0021379192,"teacher_disagreement_score":0.006428712,"about_ca_system_score_codex":0.00047286303,"about_ca_system_score_gemma":0.0006711448,"threshold_uncertainty_score":0.02150619},"labels":[],"label_agreement":null},{"id":"W4385339581","doi":"10.1007/978-3-031-37745-7_7","title":"An Infrastructure for Studying the Role of Sentiment in Human-Robot Interaction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"York University","funders":"","keywords":"Robot; Software deployment; Computer science; Human–computer interaction; Artificial intelligence; Social robot; Robotics; Computer security; Mobile robot; Robot control; Software engineering","score_opus":0.047717024958402104,"score_gpt":0.3785912516065526,"score_spread":0.33087422664815047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385339581","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048744652,0.00056352065,0.8832387,0.00088521733,0.00015477565,0.0007033841,0.0075832377,0.011375595,0.046750944],"genre_scores_gemma":[0.35704607,0.00080119696,0.6057315,0.00026031022,0.000111436755,0.001777435,0.008655469,0.0010917134,0.024524894],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967575,0.000105614476,0.000019840947,0.00008744716,0.00007344025,0.00003806431],"domain_scores_gemma":[0.9990827,0.00037466397,0.00008913165,0.0002461178,0.00013143441,0.00007597038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640166,0.0004910792,0.00045822572,0.0012406862,0.000816661,0.001543872,0.0010083973,0.0006661494,0.020455275],"category_scores_gemma":[0.001966086,0.00050764525,0.0008709797,0.0015296441,0.00053371163,0.0033616165,0.0018691088,0.0009353929,0.006047823],"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.00070719764,0.0011212089,0.021934612,0.00071063277,0.00024130988,0.00044847117,0.0022965784,0.016978506,0.06531942,0.33729407,0.047857147,0.5050908],"study_design_scores_gemma":[0.00013341868,0.00062967854,0.04135833,0.00020539096,0.000280753,0.0004599208,0.0026399284,0.3988379,0.025726723,0.39006835,0.13947885,0.00018075664],"about_ca_topic_score_codex":0.0047400384,"about_ca_topic_score_gemma":0.0046389806,"teacher_disagreement_score":0.020455275,"about_ca_system_score_codex":0.0006217948,"about_ca_system_score_gemma":0.0008423529,"threshold_uncertainty_score":0.06842971},"labels":[],"label_agreement":null},{"id":"W4385339878","doi":"10.1007/978-3-031-39841-4_7","title":"Ontology-Driven Parliamentary Analytics: Analysing Political Debates on COVID-19 Impact in Canada","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université du Québec en Outaouais","funders":"","keywords":"Ontology; Computer science; Analytics; Context (archaeology); Vocabulary; World Wide Web; Data science; Linguistics","score_opus":0.03953028108057926,"score_gpt":0.2981980090836647,"score_spread":0.2586677280030854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385339878","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.90388125,0.0012123622,0.0065916693,0.0036961264,0.000065170076,0.000092202674,0.010873408,0.00026231376,0.07332556],"genre_scores_gemma":[0.98280257,0.0003440506,0.0030785035,0.00010838421,0.00001384377,0.000034158176,0.004726163,0.00013122834,0.008761139],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985663,0.00026210444,0.000048547372,0.00015409045,0.0005577607,0.00041111367],"domain_scores_gemma":[0.99371547,0.0030508013,0.00042331792,0.00024870227,0.002129822,0.00043191522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019457947,0.00021861547,0.0004025656,0.0037111365,0.00379921,0.0057374695,0.0011668135,0.0007032956,0.004447955],"category_scores_gemma":[0.011884392,0.00023014328,0.00038256063,0.01226623,0.0019223116,0.0023778477,0.0015194432,0.0012008192,0.00054738746],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005843319,0.00021745687,0.37200257,0.0005618019,0.00023599947,0.0006363848,0.07593468,0.034589417,0.002140607,0.24671255,0.088142015,0.17824212],"study_design_scores_gemma":[0.000038269925,0.00003066208,0.45942232,0.00039136526,0.00012900773,0.000084741565,0.1489446,0.10506971,0.0022635704,0.035297997,0.24814886,0.00017889305],"about_ca_topic_score_codex":0.98606616,"about_ca_topic_score_gemma":0.99073166,"teacher_disagreement_score":0.04551197,"about_ca_system_score_codex":0.04551197,"about_ca_system_score_gemma":0.050053507,"threshold_uncertainty_score":0.33021396},"labels":[],"label_agreement":null},{"id":"W4385357007","doi":"10.1007/978-3-031-38906-1_28","title":"Shortest Coordinated Motion for Square Robots","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Square (algebra); Obstacle; Computer science; Robot; Motion (physics); Euclidean geometry; Least-squares function approximation; Motion planning; Algorithm; Plane (geometry); Artificial intelligence; Mathematics; Geometry; Statistics; Geography","score_opus":0.03417938870758149,"score_gpt":0.2703383494041565,"score_spread":0.23615896069657502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385357007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014982378,0.0023322557,0.95124376,0.00019760609,0.00026674825,0.000045410623,0.0001940063,0.0012161846,0.029521575],"genre_scores_gemma":[0.34384403,0.0035548082,0.58571285,0.00012567267,0.00013862253,0.00028668795,0.0010851462,0.0006893604,0.064562835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987566,0.00001647547,0.000004655823,0.00003223895,0.000057914174,0.000013066522],"domain_scores_gemma":[0.9999218,0.000029521905,0.000009240018,0.000012095008,0.000016774586,0.000010495945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008585046,0.00063349906,0.0005138634,0.00047997685,0.0002780609,0.0004000884,0.00070221623,0.00041662238,0.00523201],"category_scores_gemma":[0.00054036453,0.0003718905,0.00032869642,0.0009296595,0.00042109034,0.00056132034,0.000869604,0.00071584614,0.0013196919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094029805,0.000037952545,0.00018407342,0.00030274785,0.000038440405,0.00009368947,0.00016871176,0.4498891,0.015115115,0.107746914,0.025613585,0.4007156],"study_design_scores_gemma":[0.000047080495,0.00013059632,0.00045399042,0.000048668986,0.000018074936,0.00014235979,0.00007758118,0.734213,0.0035485849,0.20916373,0.05213091,0.000025496262],"about_ca_topic_score_codex":0.002122461,"about_ca_topic_score_gemma":0.0025457744,"teacher_disagreement_score":0.00523201,"about_ca_system_score_codex":0.00042628872,"about_ca_system_score_gemma":0.0003703769,"threshold_uncertainty_score":0.017502785},"labels":[],"label_agreement":null},{"id":"W4385357590","doi":"10.1007/978-3-031-38906-1_22","title":"Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta; University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Computer science; Discrete mathematics; Graph; 1-planar graph","score_opus":0.023025434302450163,"score_gpt":0.2662281672661516,"score_spread":0.24320273296370146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385357590","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.47413683,0.0025932502,0.4706868,0.0015989493,0.00026533756,0.00020350111,0.0027543919,0.002014714,0.045746174],"genre_scores_gemma":[0.78753656,0.00091901404,0.19801581,0.0002527814,0.00017156977,0.00014051328,0.0029988177,0.00055294,0.00941192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992393,0.00017616445,0.0000395458,0.00019936592,0.00022143479,0.00012423155],"domain_scores_gemma":[0.9969529,0.0017514251,0.0002620363,0.0005861529,0.00027197436,0.00017551747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446476,0.0009988543,0.0011765183,0.001232948,0.0009626636,0.002672903,0.0028729213,0.0009882913,0.0067295805],"category_scores_gemma":[0.0067196116,0.00090097403,0.00092915964,0.0029578297,0.00093273947,0.0036111972,0.001789252,0.0015927508,0.0008474091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027017142,0.0003511872,0.0071889474,0.001448688,0.00025329122,0.00045187044,0.0011749552,0.38507763,0.02894637,0.24176317,0.028337155,0.30230507],"study_design_scores_gemma":[0.00010823934,0.000077045064,0.0020884632,0.00006376743,0.000082564,0.00045571683,0.0003922183,0.5450606,0.008867892,0.4360688,0.006705893,0.000028840392],"about_ca_topic_score_codex":0.0026074862,"about_ca_topic_score_gemma":0.0048414106,"teacher_disagreement_score":0.0067295805,"about_ca_system_score_codex":0.0020537574,"about_ca_system_score_gemma":0.0006634561,"threshold_uncertainty_score":0.022512674},"labels":[],"label_agreement":null},{"id":"W4385359901","doi":"10.1007/978-3-031-38906-1_14","title":"Online Interval Scheduling with Predictions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"York University","funders":"","keywords":"Computer science; Disjoint sets; Competitive analysis; Scheduling (production processes); Upper and lower bounds; Algorithm; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.03238855091904636,"score_gpt":0.2731777316503188,"score_spread":0.24078918073127242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385359901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021435244,0.0009755612,0.94049406,0.00054211775,0.00081548165,0.0001641335,0.00075462885,0.003207893,0.031610806],"genre_scores_gemma":[0.62822425,0.0008912586,0.33817562,0.0003739455,0.000953888,0.00033122377,0.0016295322,0.00069369667,0.028726568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989693,0.00020954442,0.000045269215,0.00029662228,0.0002765406,0.00020274057],"domain_scores_gemma":[0.997758,0.0012280808,0.00013830054,0.0005020131,0.00020740593,0.00016615546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015913441,0.0012799144,0.00178705,0.00057243963,0.00067703874,0.001802129,0.0025247964,0.0009094488,0.017077817],"category_scores_gemma":[0.004990948,0.0006410953,0.0007170072,0.0015659998,0.0005970323,0.0021033199,0.0012914514,0.0027680616,0.0035561942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012521109,0.0004750975,0.00034675805,0.0002405765,0.000051442672,0.0001070394,0.00006951245,0.58817613,0.00421675,0.06838645,0.030906135,0.305772],"study_design_scores_gemma":[0.000045206983,0.000100282305,0.00009015647,0.000015046413,0.000011826903,0.00002606127,0.000013703364,0.9532782,0.001183829,0.042285133,0.0029394606,0.00001113638],"about_ca_topic_score_codex":0.0017946435,"about_ca_topic_score_gemma":0.0016956999,"teacher_disagreement_score":0.017077817,"about_ca_system_score_codex":0.0008940477,"about_ca_system_score_gemma":0.0017163124,"threshold_uncertainty_score":0.057130933},"labels":[],"label_agreement":null},{"id":"W4385362959","doi":"10.1007/978-3-031-38906-1_13","title":"Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Manitoba; Carleton University","funders":"","keywords":"Geodesic; Computer science; Polygon (computer graphics); Simple (philosophy); Simple polygon; Computer graphics (images); Combinatorics; Algorithm; Geometry; Regular polygon; Mathematics; Computer network","score_opus":0.02836051449477484,"score_gpt":0.25727160308283387,"score_spread":0.22891108858805903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385362959","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.28932187,0.00048383177,0.6758803,0.00029118508,0.00014427441,0.0001347822,0.00042630383,0.00086065533,0.03245681],"genre_scores_gemma":[0.6387131,0.00034559495,0.35085997,0.000040626608,0.000028508566,0.000057654503,0.0005113843,0.00045533042,0.008987746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982244,0.00003349739,0.000013076722,0.00003615088,0.000072413924,0.000022341668],"domain_scores_gemma":[0.9995765,0.00021783504,0.00005022165,0.00006406067,0.00005589059,0.000035574227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027617082,0.00055902184,0.00075371657,0.00059271813,0.00036413086,0.0012613697,0.0010519259,0.0007937148,0.0028718247],"category_scores_gemma":[0.0024759278,0.00042161788,0.00043649186,0.00074063794,0.0009190728,0.00078780594,0.0014568439,0.00091415277,0.00110799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011255404,0.0001389189,0.00455539,0.00095934427,0.00006857696,0.0013333461,0.0013198799,0.53105915,0.039219096,0.1563505,0.010683418,0.2531869],"study_design_scores_gemma":[0.000046603796,0.00011590335,0.00061417796,0.00005640146,0.000019984489,0.00050490705,0.00024752188,0.9397059,0.0058246832,0.043311533,0.009530368,0.00002206014],"about_ca_topic_score_codex":0.0019780726,"about_ca_topic_score_gemma":0.0020003954,"teacher_disagreement_score":0.0028718247,"about_ca_system_score_codex":0.0004954802,"about_ca_system_score_gemma":0.00031537557,"threshold_uncertainty_score":0.009607196},"labels":[],"label_agreement":null},{"id":"W4385367617","doi":"10.1007/978-3-031-38906-1_30","title":"Adaptive Data Structures for 2D Dominance Colored Range Counting","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Colored; Computer science; Data structure; Range (aeronautics); Rank (graph theory); Algorithm; Combinatorics; Mathematics","score_opus":0.05003904904023604,"score_gpt":0.28370346675285135,"score_spread":0.2336644177126153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385367617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023378205,0.0005447913,0.95819473,0.00024807543,0.00018223717,0.00011050028,0.0007101718,0.002259553,0.014371747],"genre_scores_gemma":[0.30490857,0.000578268,0.67367107,0.00043692216,0.00022356315,0.00052809005,0.0018272405,0.0010595426,0.01676667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878424,0.00019451436,0.00010396195,0.0001940343,0.0005438486,0.0001793554],"domain_scores_gemma":[0.99768484,0.0008604497,0.00012451556,0.0008121108,0.00039808213,0.00012000049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866378,0.0007317477,0.0010696484,0.0016624279,0.0009531784,0.0024186682,0.0020770126,0.0007605517,0.009217292],"category_scores_gemma":[0.0040541743,0.00050604757,0.0007119376,0.003001081,0.0009258448,0.0033222258,0.003432446,0.0018134345,0.0019660522],"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.00031857472,0.00015160356,0.0006253138,0.00024565225,0.000031848158,0.000094680916,0.00020885606,0.05280617,0.016401269,0.6035852,0.018490192,0.30704066],"study_design_scores_gemma":[0.00005606522,0.00008064065,0.00026808024,0.000067542096,0.000020620188,0.00015389636,0.00007049612,0.3747696,0.01145109,0.5897795,0.02322997,0.000052611726],"about_ca_topic_score_codex":0.0012346468,"about_ca_topic_score_gemma":0.002355911,"teacher_disagreement_score":0.009217292,"about_ca_system_score_codex":0.0012728063,"about_ca_system_score_gemma":0.001011287,"threshold_uncertainty_score":0.030834913},"labels":[],"label_agreement":null},{"id":"W4385377001","doi":"10.1007/978-981-99-4742-3_35","title":"An Experimental Study on MRI Denoising with Existing Image Denoising Methods","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Noise reduction; Computer science; Non-local means; Video denoising; Artificial intelligence; Image denoising; Wavelet; Pattern recognition (psychology); Noise (video); Convolutional neural network; Block (permutation group theory); Image (mathematics); Computer vision; Mathematics","score_opus":0.06091557249705429,"score_gpt":0.37633912893697796,"score_spread":0.3154235564399237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385377001","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.7992612,0.004111337,0.18298031,0.00029374694,0.00037983622,0.00030244884,0.00096401427,0.0009050835,0.010801891],"genre_scores_gemma":[0.7900126,0.0034279057,0.18241073,0.0002379757,0.00016043044,0.00021476792,0.003001493,0.00084156444,0.019692479],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999283,0.0001915145,0.000060880335,0.00014108405,0.0002619918,0.00006160902],"domain_scores_gemma":[0.9969627,0.0013894084,0.00015491023,0.00044483904,0.00096859626,0.000079527694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014168479,0.0007801132,0.0008012948,0.00095958734,0.00048093655,0.0004908908,0.0005706531,0.0009775539,0.0045010457],"category_scores_gemma":[0.004177296,0.00029711085,0.00047645209,0.00079930894,0.000555319,0.00067859393,0.00045048582,0.00040599855,0.000919297],"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.0039493726,0.0018735712,0.0024602066,0.0016627462,0.00017632854,0.00051185035,0.0003942108,0.014017627,0.7815122,0.0015909075,0.003005851,0.18884513],"study_design_scores_gemma":[0.00025068858,0.006925834,0.015136027,0.00026367014,0.00064187776,0.0037515275,0.0006026497,0.14491147,0.8148259,0.0017211777,0.010842669,0.00012652022],"about_ca_topic_score_codex":0.0013437279,"about_ca_topic_score_gemma":0.0014338844,"teacher_disagreement_score":0.0045010457,"about_ca_system_score_codex":0.00019523618,"about_ca_system_score_gemma":0.00022959994,"threshold_uncertainty_score":0.015057504},"labels":[],"label_agreement":null},{"id":"W4385377051","doi":"10.1007/978-981-99-4742-3_21","title":"Improved Blind Image Denoising with DnCNN","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Concordia University","funders":"","keywords":"Computer science; Noise reduction; Gaussian noise; Additive white Gaussian noise; Artificial intelligence; Noise (video); Image denoising; Pattern recognition (psychology); White noise; Convolutional neural network; Image (mathematics); Video denoising; Computer vision; Video processing; Telecommunications","score_opus":0.024826584281343777,"score_gpt":0.275006093840272,"score_spread":0.25017950955892826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385377051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004757464,0.0008549135,0.98926455,0.00009338695,0.00022958897,0.00002426915,0.00010405139,0.0007328845,0.0039389473],"genre_scores_gemma":[0.105506115,0.0014160182,0.8673139,0.0003214026,0.00022077958,0.00006818279,0.00063525146,0.00036498872,0.024153324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996141,0.00006268466,0.000021839436,0.00008418042,0.00017462413,0.000042641444],"domain_scores_gemma":[0.9996063,0.0000973395,0.000018298344,0.00007886124,0.00018201134,0.000017213228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073435693,0.0010807279,0.00091967627,0.00070905965,0.00031971192,0.0007088046,0.0008937752,0.001310071,0.004939919],"category_scores_gemma":[0.001178003,0.00039722712,0.0008443515,0.0007738501,0.00052081805,0.0009862205,0.001015212,0.00142687,0.0026999563],"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.0004276868,0.00009872509,0.0003568895,0.00040570612,0.00011425867,0.00015927048,0.00005012094,0.07952135,0.13083023,0.014479743,0.008458486,0.7650976],"study_design_scores_gemma":[0.0000146895645,0.00005179344,0.00034211323,0.000035426725,0.000058694404,0.00021520155,0.0000106796415,0.92443347,0.06049998,0.0055042338,0.008806992,0.000026708869],"about_ca_topic_score_codex":0.0028091178,"about_ca_topic_score_gemma":0.005640793,"teacher_disagreement_score":0.004939919,"about_ca_system_score_codex":0.00037309303,"about_ca_system_score_gemma":0.00059602904,"threshold_uncertainty_score":0.016525686},"labels":[],"label_agreement":null},{"id":"W4385384926","doi":"10.1007/978-3-031-37660-3","title":"Pattern Recognition, Computer Vision, and Image Processing. ICPR 2022 International Workshops and Challenges","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Ontario Tech University; York University","funders":"Binghamton University; South China University of Technology; Deakin University; York University; Sapienza Università di Roma; University of Warwick; La Rochelle Université; University of South Florida; Auckland University of Technology, New Zealand; University of Pittsburgh","keywords":"Computer science; Computer vision; Image processing; Artificial intelligence; Image (mathematics); Computer graphics (images)","score_opus":0.020919602689181638,"score_gpt":0.2614261664746392,"score_spread":0.24050656378545754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385384926","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045691347,0.32201776,0.40584797,0.009457324,0.022419497,0.00044830586,0.0031375212,0.012390134,0.21971242],"genre_scores_gemma":[0.018960804,0.17055348,0.22049588,0.0024639112,0.008148778,0.00036982237,0.007318222,0.0027218098,0.56896734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981329,0.00018473541,0.000099215846,0.00032176205,0.0011162603,0.00014523271],"domain_scores_gemma":[0.9983103,0.00040216517,0.00008458403,0.00029710386,0.0006952417,0.00021058599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002213972,0.0020853004,0.0022918426,0.0026303788,0.0006020815,0.0038342134,0.0025015313,0.0021826364,0.04581776],"category_scores_gemma":[0.0019265596,0.0012403907,0.0013350105,0.0039110747,0.001118987,0.00420846,0.0033572533,0.0026935914,0.05900038],"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.00006361788,0.000102955404,0.00014409419,0.00069837103,0.000031336716,0.00008333298,0.000042768817,0.0008866628,0.0041840845,0.0064510857,0.34731787,0.6399938],"study_design_scores_gemma":[0.000019382516,0.0001388741,0.0013856137,0.00031040164,0.00003307978,0.0017858687,0.00007744376,0.009463597,0.005057059,0.014861951,0.9668164,0.000050303584],"about_ca_topic_score_codex":0.0018753313,"about_ca_topic_score_gemma":0.002390565,"teacher_disagreement_score":0.04581776,"about_ca_system_score_codex":0.0007167373,"about_ca_system_score_gemma":0.0015146472,"threshold_uncertainty_score":0.15327567},"labels":[],"label_agreement":null},{"id":"W4385385145","doi":"10.1007/978-3-031-37660-3_11","title":"MTGR: Improving Emotion and Sentiment Analysis with Gated Residual Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Modalities; Sentiment analysis; Residual; Transformer; Artificial intelligence; Emotion recognition; Machine learning; Speech recognition; Algorithm","score_opus":0.014127612112920388,"score_gpt":0.2332972907404317,"score_spread":0.21916967862751133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385385145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036832027,0.00068697496,0.94407886,0.00038262547,0.0004461526,0.00016840521,0.0010937513,0.011584857,0.0047263033],"genre_scores_gemma":[0.36734712,0.0005882876,0.59649235,0.0005740402,0.0004383587,0.00028475336,0.0061382614,0.002011556,0.026125235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00010339997,0.000017961387,0.00010433188,0.000106946885,0.000059457958],"domain_scores_gemma":[0.9995012,0.00017794072,0.00003665814,0.00009396072,0.00016147313,0.000028687737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007854264,0.0012711255,0.00074309646,0.000799866,0.0004036237,0.00077244214,0.0014600278,0.00080128835,0.0075422996],"category_scores_gemma":[0.0019892685,0.00033932217,0.0007876307,0.0007710805,0.0003010466,0.0014188903,0.0012083304,0.0014175719,0.004355437],"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.0005004698,0.0002610664,0.0009217694,0.00016055575,0.00017342376,0.00013947889,0.000121636265,0.0681677,0.0444166,0.0052990923,0.033860754,0.8459775],"study_design_scores_gemma":[0.000031731055,0.00009065944,0.00053561147,0.000013781521,0.000046915677,0.000034098503,0.000028241355,0.9793767,0.009219433,0.006389642,0.004219737,0.00001356716],"about_ca_topic_score_codex":0.004365593,"about_ca_topic_score_gemma":0.0068955556,"teacher_disagreement_score":0.0075422996,"about_ca_system_score_codex":0.00039340375,"about_ca_system_score_gemma":0.00040004568,"threshold_uncertainty_score":0.02523154},"labels":[],"label_agreement":null},{"id":"W4385417252","doi":"10.1007/978-3-031-38299-4_13","title":"The Momentum Mapping of the Affine Real Symplectic Group","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Moment map; Symplectic geometry; Symplectic group; Affine transformation; Group (periodic table); Symplectomorphism; Symplectic representation; Pure mathematics; Symplectic matrix; Action (physics); Algebra over a field; Mathematics; Mathematical physics; Computer science; Physics; Quantum mechanics","score_opus":0.03193353308564902,"score_gpt":0.2757441416009483,"score_spread":0.24381060851529926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385417252","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.26962748,0.005080065,0.15451051,0.004615566,0.002929693,0.00007383581,0.00037612172,0.00033152068,0.56245524],"genre_scores_gemma":[0.82045823,0.002576361,0.013765119,0.0004139026,0.0012851104,0.000047468533,0.00016164724,0.0002009351,0.16109128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986374,0.000032984266,0.0000059637623,0.000027222935,0.0000511995,0.000018830286],"domain_scores_gemma":[0.9998795,0.000032450404,0.000022018878,0.000023000577,0.00001762214,0.000025341351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025378133,0.0004691095,0.000303411,0.0008825303,0.0008053028,0.0017308984,0.00044139952,0.0005352331,0.0069394237],"category_scores_gemma":[0.00070370047,0.0002539556,0.0003442611,0.00069117977,0.0021913312,0.002607867,0.0010008509,0.0015532788,0.0009497373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008348953,0.0000052067835,0.00002524902,0.000012490116,0.000001771286,0.000033308785,0.00010137484,0.00042119707,0.0005191072,0.9921217,0.0007719266,0.0059783785],"study_design_scores_gemma":[0.0000060299344,0.000018890229,0.00013903229,0.0000065894938,0.000001572497,0.00013356724,0.000047836307,0.00157329,0.00022374642,0.98795927,0.009884741,0.0000054780166],"about_ca_topic_score_codex":0.0004803904,"about_ca_topic_score_gemma":0.00029106656,"teacher_disagreement_score":0.0069394237,"about_ca_system_score_codex":0.00059413497,"about_ca_system_score_gemma":0.00041172878,"threshold_uncertainty_score":0.023214638},"labels":[],"label_agreement":null},{"id":"W4385432804","doi":"10.1007/978-3-031-40113-8_25","title":"A Pilot Study of Preservice Teachers Accepting and Using Chatbots to Enhance CFL Education","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","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":"Athabasca University","funders":"","keywords":"Chatbot; Conversation; Computer science; Perception; Mathematics education; Psychology; Multimedia; World Wide Web; Communication","score_opus":0.047996560747338525,"score_gpt":0.344116185146409,"score_spread":0.29611962439907047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385432804","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.9975649,0.000021071157,0.0003096561,0.000053450713,0.0000160363,0.0011241854,0.000030711966,0.000023817258,0.00085617154],"genre_scores_gemma":[0.9878392,0.00012303074,0.003981664,0.0002919441,0.000020492298,0.0022648377,0.000108104345,0.000027162128,0.005343567],"study_design_codex":"nonrandomized_trial","study_design_gemma":"observational","domain_scores_codex":[0.99670464,0.0012119681,0.00025229985,0.00051750673,0.0004994513,0.000814166],"domain_scores_gemma":[0.9745507,0.013389794,0.0012349186,0.0016167093,0.00446016,0.004747633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075466763,0.000886883,0.0011881046,0.0010712775,0.00487434,0.0027226047,0.0017569796,0.0019475577,0.006831515],"category_scores_gemma":[0.016183143,0.0011746701,0.00059060875,0.000649726,0.0014147271,0.0016220255,0.001692462,0.0031465727,0.0014853015],"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.009820374,0.34870633,0.085679606,0.0015765289,0.00012541997,0.0034467708,0.33801845,0.00042171695,0.054041367,0.00055555004,0.00173725,0.1558706],"study_design_scores_gemma":[0.006576331,0.23596403,0.29227668,0.0005845301,0.00037440174,0.0012155891,0.423709,0.0018908918,0.022568466,0.0005938433,0.013957655,0.0002885323],"about_ca_topic_score_codex":0.0072901477,"about_ca_topic_score_gemma":0.020015461,"teacher_disagreement_score":0.0075466763,"about_ca_system_score_codex":0.0017472229,"about_ca_system_score_gemma":0.004889513,"threshold_uncertainty_score":0.03991115},"labels":[],"label_agreement":null},{"id":"W4385433140","doi":"10.1007/978-3-031-39504-8","title":"Biomimetic and Biohybrid Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Naval Research Laboratory; Office of Naval Research; University of Illinois at Urbana-Champaign; Università degli Studi di Messina; Tartu Ülikool; Waseda University; Universität Bielefeld; Technische Universität München; Université de Fribourg; Centre National de la Recherche Scientifique; Radboud Universiteit; University of Waterloo; Heriot-Watt University; KU Leuven; Universidad Carlos III de Madrid; Università degli Studi di Genova; Universität zu Köln; Università degli Studi di Padova; Eidgenössische Technische Hochschule Zürich; Hebrew University of Jerusalem; University College London; Albert-Ludwigs-Universität Freiburg; University of California, San Diego; Korea Aerospace University; Tallinna Tehnikaülikool; University of Bristol; University of Twente; Universiteit van Amsterdam; École Polytechnique Fédérale de Lausanne; Wageningen University and Research; National University of Singapore; Arizona State University; Technische Universiteit Eindhoven; University of the West of England; University of Bath; Universität Rostock; Westlake University; University of Cincinnati; Università degli Studi di Siena; Okinawa Institute of Science and Technology Graduate University; Euskal Herriko Unibertsitatea; Vidyasirimedhi Institute of Science and Technology; Università degli Studi di Milano; Istituto Italiano di Tecnologia; West Virginia University; University of Sussex; Friedrich-Schiller-Universität Jena; Imperial College London; Portland State University; Drexel University; Università di Catania; Università degli Studi di Napoli Federico II; Universität Stuttgart; Case Western Reserve University; Korea Institute of Science and Technology; Università degli Studi di Verona; Carnegie Mellon University; Scuola Superiore Sant'Anna; Brown University; Northwestern University; Yale University","keywords":"Biomimetics; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.015008600130689526,"score_gpt":0.22255886625288182,"score_spread":0.2075502661221923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385433140","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018654248,0.15178692,0.24753702,0.0037592,0.0074484143,0.00008350129,0.00029176992,0.00056780555,0.5698711],"genre_scores_gemma":[0.14330727,0.057499122,0.055772036,0.0014599048,0.0028881966,0.00025158023,0.00043336733,0.00023571923,0.7381529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999268,0.0000128091815,0.000003135474,0.000013469008,0.00003750304,0.000006229809],"domain_scores_gemma":[0.99993837,0.00003354021,0.0000047300605,0.000007524165,0.000010805483,0.0000049099835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001110664,0.00056410825,0.0005450394,0.0005527233,0.00028984042,0.00088208594,0.00045498073,0.0009088594,0.014339334],"category_scores_gemma":[0.00030582817,0.00026977222,0.00030297166,0.0008282847,0.00068832625,0.0010680128,0.00056924805,0.0007603224,0.0026630305],"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.00004627249,0.00008640462,0.00012590841,0.0007292981,0.00003849721,0.00019063598,0.0001804556,0.026569612,0.016167315,0.63925815,0.068536304,0.24807116],"study_design_scores_gemma":[0.00002012187,0.00008393329,0.00065087166,0.00010141798,0.000020251084,0.00044965497,0.00008148899,0.050150584,0.002531807,0.52266985,0.42320958,0.000030421823],"about_ca_topic_score_codex":0.00043245315,"about_ca_topic_score_gemma":0.00062860455,"teacher_disagreement_score":0.014339334,"about_ca_system_score_codex":0.00032462057,"about_ca_system_score_gemma":0.0002001302,"threshold_uncertainty_score":0.047969818},"labels":[],"label_agreement":null},{"id":"W4385433327","doi":"10.1007/978-3-031-38857-6","title":"Biomimetic and Biohybrid Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Naval Research Laboratory; Office of Naval Research; University of Illinois at Urbana-Champaign; Università degli Studi di Messina; Tartu Ülikool; Waseda University; Universität Bielefeld; Technische Universität München; Université de Fribourg; Centre National de la Recherche Scientifique; Radboud Universiteit; University of Waterloo; Heriot-Watt University; KU Leuven; Universidad Carlos III de Madrid; Università degli Studi di Genova; Universität zu Köln; Università degli Studi di Padova; Eidgenössische Technische Hochschule Zürich; Hebrew University of Jerusalem; University College London; Albert-Ludwigs-Universität Freiburg; University of California, San Diego; Korea Aerospace University; Tallinna Tehnikaülikool; University of Bristol; University of Twente; Universiteit van Amsterdam; École Polytechnique Fédérale de Lausanne; Wageningen University and Research; National University of Singapore; Arizona State University; Technische Universiteit Eindhoven; University of the West of England; University of Bath; Universität Rostock; Westlake University; University of Cincinnati; Università degli Studi di Siena; Okinawa Institute of Science and Technology Graduate University; Euskal Herriko Unibertsitatea; Vidyasirimedhi Institute of Science and Technology; Università degli Studi di Milano; Istituto Italiano di Tecnologia; West Virginia University; University of Sussex; Friedrich-Schiller-Universität Jena; Imperial College London; Portland State University; Drexel University; Università di Catania; Università degli Studi di Napoli Federico II; Universität Stuttgart; Case Western Reserve University; Korea Institute of Science and Technology; Università degli Studi di Verona; Carnegie Mellon University; Scuola Superiore Sant'Anna; Brown University; Northwestern University; Yale University","keywords":"Biomimetics; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.015008600130689526,"score_gpt":0.22255886625288182,"score_spread":0.2075502661221923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385433327","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018654248,0.15178692,0.24753702,0.0037592,0.0074484143,0.00008350129,0.00029176992,0.00056780555,0.5698711],"genre_scores_gemma":[0.14330727,0.057499122,0.055772036,0.0014599048,0.0028881966,0.00025158023,0.00043336733,0.00023571923,0.7381529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999268,0.0000128091815,0.000003135474,0.000013469008,0.00003750304,0.000006229809],"domain_scores_gemma":[0.99993837,0.00003354021,0.0000047300605,0.000007524165,0.000010805483,0.0000049099835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001110664,0.00056410825,0.0005450394,0.0005527233,0.00028984042,0.00088208594,0.00045498073,0.0009088594,0.014339334],"category_scores_gemma":[0.00030582817,0.00026977222,0.00030297166,0.0008282847,0.00068832625,0.0010680128,0.00056924805,0.0007603224,0.0026630305],"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.00004627249,0.00008640462,0.00012590841,0.0007292981,0.00003849721,0.00019063598,0.0001804556,0.026569612,0.016167315,0.63925815,0.068536304,0.24807116],"study_design_scores_gemma":[0.00002012187,0.00008393329,0.00065087166,0.00010141798,0.000020251084,0.00044965497,0.00008148899,0.050150584,0.002531807,0.52266985,0.42320958,0.000030421823],"about_ca_topic_score_codex":0.00043245315,"about_ca_topic_score_gemma":0.00062860455,"teacher_disagreement_score":0.014339334,"about_ca_system_score_codex":0.00032462057,"about_ca_system_score_gemma":0.0002001302,"threshold_uncertainty_score":0.047969818},"labels":[],"label_agreement":null},{"id":"W4385433414","doi":"10.1007/978-3-031-38857-6_11","title":"Wrinkle-Free Sewing with Robotics: The Future of Soft Material Manufacturing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"European Commission","keywords":"Computer science; Process (computing); Machine vision; Artificial intelligence; Wrinkle; Clothing; Segmentation; Soft robotics; Textile; Robotics; Adaptability; 3D printing; Robot; Computer vision; Mechanical engineering; Engineering; Materials science","score_opus":0.010419353423420064,"score_gpt":0.20135642727811778,"score_spread":0.19093707385469771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385433414","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065726444,0.3737182,0.5003457,0.006637317,0.0012977223,0.00009150622,0.00009585939,0.0018101818,0.050277077],"genre_scores_gemma":[0.5530856,0.15878595,0.2610196,0.0012834512,0.00123381,0.00012821601,0.0002066437,0.00019463775,0.024062118],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997025,0.00005637066,0.000010852239,0.00005766542,0.00013797116,0.00003457799],"domain_scores_gemma":[0.99961567,0.00014307638,0.000048647173,0.00005618581,0.00008832637,0.000048155118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005457755,0.00043809693,0.00044233864,0.00054130197,0.00022603574,0.0013080413,0.0008185172,0.0014249269,0.003859279],"category_scores_gemma":[0.00054086285,0.00025025022,0.00045861184,0.00048804714,0.001120475,0.0022229785,0.00086373085,0.00079004624,0.0014936258],"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.00015217859,0.00016427194,0.00073647243,0.001665868,0.0000667092,0.00020780065,0.00019264751,0.023617,0.071288615,0.060111184,0.0066124294,0.8351848],"study_design_scores_gemma":[0.00007546588,0.0017381596,0.0030397587,0.00088555465,0.00008042876,0.0010053087,0.00042126226,0.24063505,0.056201797,0.16780788,0.5278266,0.00028270128],"about_ca_topic_score_codex":0.00030488873,"about_ca_topic_score_gemma":0.00023851442,"teacher_disagreement_score":0.003859279,"about_ca_system_score_codex":0.0003609412,"about_ca_system_score_gemma":0.0003605763,"threshold_uncertainty_score":0.0129106045},"labels":[],"label_agreement":null},{"id":"W4385434403","doi":"10.1007/978-3-031-38299-4_49","title":"Gabor Frames and Contact Structures: Signal Encoding and Decoding in the Primary Visual Cortex","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual perception and processing mechanisms","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"SIGNAL (programming language); Computer science; Decoding methods; Gabor wavelet; Encoding (memory); Fourier transform; Visual cortex; Gabor transform; Orientation (vector space); Time–frequency analysis; Artificial intelligence; Computer vision; Algorithm; Mathematics; Neuroscience; Mathematical analysis; Geometry; Wavelet","score_opus":0.04351754845357631,"score_gpt":0.3095269528298845,"score_spread":0.2660094043763082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385434403","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20013174,0.067616574,0.4860607,0.002027503,0.00070705183,0.00006434591,0.00081032276,0.0014253408,0.2411564],"genre_scores_gemma":[0.81750345,0.022365343,0.0826234,0.00023593036,0.00071135635,0.000044728422,0.0006686986,0.00044320006,0.07540392],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999928,0.000008897678,0.0000035836972,0.000020862983,0.000023831979,0.0000147660485],"domain_scores_gemma":[0.999816,0.00010526977,0.000016463428,0.000022682338,0.000024814552,0.000014853114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013384472,0.000366076,0.00037740488,0.00038666322,0.000219652,0.0025745989,0.00050120224,0.00080201594,0.006573806],"category_scores_gemma":[0.00074930507,0.00038024233,0.0002812725,0.0010581425,0.00082434696,0.0018463467,0.00037459808,0.00065745035,0.0017012982],"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.00030421067,0.000043482698,0.001111134,0.00041839262,0.000043366374,0.000561015,0.0006955441,0.0036646393,0.14979696,0.3362581,0.0104197785,0.49668333],"study_design_scores_gemma":[0.00006029732,0.0002689396,0.03015944,0.00024092146,0.00006819535,0.0021326726,0.0004886753,0.06488833,0.07362012,0.77732116,0.050656136,0.00009521501],"about_ca_topic_score_codex":0.0010480663,"about_ca_topic_score_gemma":0.0012976669,"teacher_disagreement_score":0.006573806,"about_ca_system_score_codex":0.0003568398,"about_ca_system_score_gemma":0.0003280681,"threshold_uncertainty_score":0.02199155},"labels":[],"label_agreement":null},{"id":"W4385434633","doi":"10.1007/978-3-031-38299-4_60","title":"Using a Riemannian Elastic Metric for Statistical Analysis of Tumor Cell Shape Heterogeneity","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Morphological variations and asymmetry","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":"University of British Columbia","funders":"","keywords":"Metric (unit); Computer science; Representation (politics); Pattern recognition (psychology); Statistical analysis; Artificial intelligence; Information geometry; Mathematics; Statistics; Geometry","score_opus":0.08679973668701545,"score_gpt":0.3352811828866585,"score_spread":0.24848144619964302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385434633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014465264,0.00035453,0.9839453,0.00012169628,0.00003692318,0.000017322503,0.00009177011,0.00016548342,0.00080167415],"genre_scores_gemma":[0.4657441,0.0017141232,0.52127486,0.0003039286,0.000283115,0.00017833854,0.0009417429,0.0007555294,0.008804259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995683,0.00014128402,0.00003709529,0.00008248973,0.00013712117,0.000033724566],"domain_scores_gemma":[0.99847394,0.00080510916,0.00020248472,0.00023544797,0.00020816867,0.00007489807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153554,0.0006981861,0.0007704283,0.0014159692,0.00033228606,0.0012890318,0.0009097094,0.0009375392,0.0010976786],"category_scores_gemma":[0.0037263825,0.00045690284,0.0010730154,0.0014599854,0.00076802314,0.0013946672,0.0013522524,0.0009502477,0.0004586608],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010045009,0.0000846056,0.0038945551,0.00031280427,0.00030682166,0.0004179912,0.0002480042,0.43359324,0.07840967,0.24226846,0.005320658,0.2350427],"study_design_scores_gemma":[0.0000015845582,0.000021704938,0.0012951351,0.0000064743595,0.000015169059,0.000106451924,0.000014660589,0.9576369,0.0025361627,0.036730655,0.0016113621,0.00002379551],"about_ca_topic_score_codex":0.0018752131,"about_ca_topic_score_gemma":0.002173037,"teacher_disagreement_score":0.0018752131,"about_ca_system_score_codex":0.0006392895,"about_ca_system_score_gemma":0.00045552236,"threshold_uncertainty_score":0.008120775},"labels":[],"label_agreement":null},{"id":"W4385434637","doi":"10.1007/978-3-031-38299-4_62","title":"Generative OrnsteinUhlenbeck Markets via Geometric Deep Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Concordia University; McMaster University","funders":"","keywords":"Lipschitz continuity; Computer science; A priori and a posteriori; Stochastic game; Conditional probability distribution; Generative grammar; Generative model; Function (biology); Artificial intelligence; Mathematical optimization; Applied mathematics; Mathematical economics; Econometrics; Mathematics; Pure mathematics","score_opus":0.02347080694356061,"score_gpt":0.21991284921764917,"score_spread":0.19644204227408857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385434637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032626227,0.00040815986,0.95846814,0.00056487275,0.000106281484,0.000022318874,0.00013370103,0.0006932605,0.0069770236],"genre_scores_gemma":[0.81755704,0.00083699776,0.15489559,0.00047581393,0.00021309931,0.00009084567,0.00047371152,0.0005244706,0.024932299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.000086945794,0.000007208647,0.00005381059,0.000058233414,0.000034304678],"domain_scores_gemma":[0.999138,0.00049345783,0.00008321639,0.00012796349,0.00007460266,0.00008276179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007734292,0.0006321137,0.00092049694,0.00053482054,0.00034334845,0.0016124586,0.0013217006,0.0015751745,0.0052754353],"category_scores_gemma":[0.003737799,0.00077805226,0.00087924674,0.00047434715,0.0014256021,0.002542014,0.0023163413,0.0021111167,0.0009697561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056837736,0.0000435483,0.0004966697,0.000037695892,0.00003486852,0.00008691609,0.000056862733,0.5274696,0.0016154556,0.43522176,0.0025082687,0.03237159],"study_design_scores_gemma":[0.0000061099263,0.00000805508,0.0000471848,0.00000441836,0.0000034680434,0.00002152192,0.000004022003,0.8272572,0.0002270075,0.1719017,0.00051222986,0.0000070729866],"about_ca_topic_score_codex":0.0015646406,"about_ca_topic_score_gemma":0.001988905,"teacher_disagreement_score":0.0052754353,"about_ca_system_score_codex":0.00089737953,"about_ca_system_score_gemma":0.0005686084,"threshold_uncertainty_score":0.017648041},"labels":[],"label_agreement":null},{"id":"W4385435093","doi":"10.1007/978-3-031-38271-0_51","title":"Coherent States and Entropy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geometry and complex manifolds","field":"Mathematics","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; Western University","funders":"","keywords":"Quantum entanglement; Hilbert space; Combinatorics; Physics; Entropy (arrow of time); Mathematics; Quantization (signal processing); Mathematical physics; Discrete mathematics; Pure mathematics; Quantum mechanics; Quantum; Algorithm","score_opus":0.04041237029736588,"score_gpt":0.27848058614733956,"score_spread":0.23806821584997367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385435093","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030982355,0.026002906,0.06783426,0.006804848,0.0015796995,0.000035186145,0.00026202004,0.00017830527,0.8663205],"genre_scores_gemma":[0.6186634,0.016625673,0.012843325,0.0014499443,0.004409241,0.00013121129,0.00038751363,0.00023405891,0.34525567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982566,0.000048671263,0.0000069691678,0.000026891055,0.000076041535,0.000015890299],"domain_scores_gemma":[0.999813,0.00009052813,0.000015887492,0.00003933325,0.000026124218,0.000015219836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003572636,0.00051297445,0.00055245915,0.0010197675,0.0006585358,0.001833338,0.00036628006,0.00079645554,0.010594633],"category_scores_gemma":[0.0008781571,0.00024206475,0.00023646565,0.0008833084,0.002350929,0.0030862277,0.0011287464,0.00151153,0.0015219583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021010314,0.0000035849018,0.000012157941,0.000016642152,0.0000019288443,0.000004567009,0.000038827533,0.0002397342,0.00014807789,0.99281317,0.0024496492,0.004269522],"study_design_scores_gemma":[9.770172e-7,0.000002576981,0.000042433647,0.000006970548,0.0000011080996,0.000012444288,0.000011489948,0.0004486939,0.00007626403,0.99156415,0.007830941,0.0000018790806],"about_ca_topic_score_codex":0.0002009892,"about_ca_topic_score_gemma":0.00023918759,"teacher_disagreement_score":0.010594633,"about_ca_system_score_codex":0.00065415964,"about_ca_system_score_gemma":0.00026115496,"threshold_uncertainty_score":0.03544259},"labels":[],"label_agreement":null},{"id":"W4385466031","doi":"10.1007/978-3-031-37742-6_19","title":"Wildfires Detection and Segmentation Using Deep CNNs and Vision Transformers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fire Detection and Safety Systems","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":"Université de Moncton","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Convolutional neural network; Fire detection; Transformer; Deep learning; Aerial imagery; Computer vision; Image segmentation; Pixel; Deep neural networks; Firefighting; Pattern recognition (psychology); Cartography; Geography; Engineering","score_opus":0.01175150991333566,"score_gpt":0.23497606220175607,"score_spread":0.22322455228842042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385466031","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.04241428,0.0011761136,0.93752676,0.00025709782,0.00029397948,0.00011280605,0.0008899518,0.0059080417,0.01142096],"genre_scores_gemma":[0.5149167,0.0019075142,0.45109296,0.00036998553,0.00020640592,0.00012924094,0.0036511316,0.00067723484,0.027048746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997929,0.0000085740185,0.000008513009,0.000077457626,0.00005615993,0.00005653167],"domain_scores_gemma":[0.9998228,0.000033183704,0.000018967825,0.00003405386,0.000073997915,0.000017040667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029629507,0.001037907,0.00076015864,0.0011976435,0.00032464904,0.0013552185,0.0012659583,0.0007787565,0.0053094397],"category_scores_gemma":[0.00056499016,0.0006982886,0.001088763,0.0010662351,0.00033027423,0.0012052171,0.0008123074,0.0009447077,0.0026848582],"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.00026777285,0.00015011386,0.0016293066,0.00015908133,0.00011331934,0.00014155924,0.00004487857,0.06314127,0.067816734,0.006335007,0.010108364,0.85009265],"study_design_scores_gemma":[0.0000088489005,0.000063374304,0.0016919601,0.000031099928,0.00005287557,0.00013978528,0.000024449475,0.9489527,0.037481945,0.0060469997,0.005487048,0.000018869807],"about_ca_topic_score_codex":0.009657238,"about_ca_topic_score_gemma":0.016266676,"teacher_disagreement_score":0.009657238,"about_ca_system_score_codex":0.0008672791,"about_ca_system_score_gemma":0.00089060044,"threshold_uncertainty_score":0.019202054},"labels":[],"label_agreement":null},{"id":"W4385466175","doi":"10.1007/978-3-031-37742-6_47","title":"Weakly Supervised Medical Image Segmentation with Soft Labels and Noise Robust Loss","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Alberta Bone and Joint Health Institute; University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Cross entropy; Deep learning; Probabilistic logic; Ground truth; Pattern recognition (psychology); Medical diagnosis; Noise (video); Image segmentation; Binary classification; Machine learning; Image (mathematics); Support vector machine","score_opus":0.01713412965787675,"score_gpt":0.2517878722043876,"score_spread":0.23465374254651084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385466175","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.008472894,0.00029364368,0.98856086,0.00023501847,0.00004488611,0.000038047114,0.00012630432,0.00080916844,0.0014191498],"genre_scores_gemma":[0.28250867,0.00069811166,0.6970922,0.0005101752,0.00032582929,0.00023867516,0.0016237543,0.0009306535,0.016071841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998847,0.00031986274,0.00007217094,0.0002777214,0.0003966458,0.00008663239],"domain_scores_gemma":[0.9983998,0.0006352793,0.00017205451,0.00039748376,0.0003147045,0.00008068686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021160427,0.001107196,0.001770272,0.0010404246,0.00042196288,0.0018382549,0.0020279768,0.002128994,0.0026122762],"category_scores_gemma":[0.004030695,0.0007454178,0.0012649345,0.00093443715,0.0013806216,0.00183297,0.0029909401,0.00171452,0.0022329756],"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.0010008904,0.0002776903,0.0014546143,0.00054295437,0.00020702777,0.00031654097,0.00017046978,0.25276405,0.08448452,0.04234064,0.013054828,0.60338575],"study_design_scores_gemma":[0.0000124029675,0.00009681414,0.00037450722,0.000025793808,0.000028133709,0.00024564564,0.000013658627,0.9588099,0.013789622,0.02436456,0.0022228796,0.000016092537],"about_ca_topic_score_codex":0.0008479903,"about_ca_topic_score_gemma":0.0013592059,"teacher_disagreement_score":0.0026122762,"about_ca_system_score_codex":0.0008107546,"about_ca_system_score_gemma":0.001088949,"threshold_uncertainty_score":0.011190832},"labels":[],"label_agreement":null},{"id":"W4385466248","doi":"10.1007/978-3-031-37742-6","title":"Pattern Recognition, Computer Vision, and Image Processing. ICPR 2022 International Workshops and Challenges","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Ontario Tech University; York University","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Image processing; Computer graphics (images); Image (mathematics); Pattern recognition (psychology)","score_opus":0.020919602689181638,"score_gpt":0.2614261664746392,"score_spread":0.24050656378545754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385466248","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045691347,0.32201776,0.40584797,0.009457324,0.022419497,0.00044830586,0.0031375212,0.012390134,0.21971242],"genre_scores_gemma":[0.018960804,0.17055348,0.22049588,0.0024639112,0.008148778,0.00036982237,0.007318222,0.0027218098,0.56896734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981329,0.00018473541,0.000099215846,0.00032176205,0.0011162603,0.00014523271],"domain_scores_gemma":[0.9983103,0.00040216517,0.00008458403,0.00029710386,0.0006952417,0.00021058599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002213972,0.0020853004,0.0022918426,0.0026303788,0.0006020815,0.0038342134,0.0025015313,0.0021826364,0.04581776],"category_scores_gemma":[0.0019265596,0.0012403907,0.0013350105,0.0039110747,0.001118987,0.00420846,0.0033572533,0.0026935914,0.05900038],"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.00006361788,0.000102955404,0.00014409419,0.00069837103,0.000031336716,0.00008333298,0.000042768817,0.0008866628,0.0041840845,0.0064510857,0.34731787,0.6399938],"study_design_scores_gemma":[0.000019382516,0.0001388741,0.0013856137,0.00031040164,0.00003307978,0.0017858687,0.00007744376,0.009463597,0.005057059,0.014861951,0.9668164,0.000050303584],"about_ca_topic_score_codex":0.0018753313,"about_ca_topic_score_gemma":0.002390565,"teacher_disagreement_score":0.04581776,"about_ca_system_score_codex":0.0007167373,"about_ca_system_score_gemma":0.0015146472,"threshold_uncertainty_score":0.15327567},"labels":[],"label_agreement":null},{"id":"W4385489795","doi":"10.1007/978-3-031-39764-6","title":"Mobile Web and Intelligent Information Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Yeditepe Üniversitesi; Universidad de Zaragoza; Khalifa University of Science, Technology and Research; Concordia University; Université Mohammed VI Polytechnique","keywords":"Computer science; World Wide Web; Mobile computing; Human–computer interaction; Multimedia; Telecommunications","score_opus":0.011796449613283504,"score_gpt":0.2296632481946353,"score_spread":0.2178667985813518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385489795","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046356,0.20455457,0.045189932,0.004391253,0.0033997092,0.000061057246,0.00021533653,0.00058224436,0.7369703],"genre_scores_gemma":[0.05160085,0.10404007,0.020058202,0.0016107584,0.0032862038,0.000117942334,0.00044075766,0.00028975986,0.8185554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998696,0.00002439811,0.000004657798,0.000017229491,0.00007169075,0.000012450288],"domain_scores_gemma":[0.9998505,0.00007906616,0.000010647631,0.000019114606,0.00002616664,0.000014502792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016496835,0.00066721207,0.00055728754,0.001598105,0.0003620131,0.0026861632,0.00038960477,0.000996244,0.028776104],"category_scores_gemma":[0.00040578184,0.00026704022,0.0002351468,0.0026820684,0.0006276745,0.0039564744,0.0006779178,0.0010812269,0.011130517],"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.000045333916,0.00009979385,0.00019590025,0.00057093526,0.000027827857,0.00019054268,0.00024582708,0.0018036775,0.002352705,0.36398843,0.16891561,0.46156344],"study_design_scores_gemma":[0.00001428144,0.000041735428,0.00045137882,0.00030528792,0.000017230517,0.00037146945,0.000106032974,0.0032850336,0.0005979097,0.15648198,0.8383166,0.00001097256],"about_ca_topic_score_codex":0.0006876493,"about_ca_topic_score_gemma":0.0011394133,"teacher_disagreement_score":0.028776104,"about_ca_system_score_codex":0.00051002717,"about_ca_system_score_gemma":0.00026276917,"threshold_uncertainty_score":0.09626567},"labels":[],"label_agreement":null},{"id":"W4385489881","doi":"10.1007/978-3-031-39764-6_14","title":"Granular Traceability Between Requirements and Test Cases for Safety-Critical Software Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Traceability; Computer science; Requirements traceability; Test case; Software engineering; Software; Requirements engineering; Programming language; Requirement","score_opus":0.05911583272759753,"score_gpt":0.3129168050163533,"score_spread":0.2538009722887558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385489881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033824556,0.00052869547,0.9532902,0.00026632566,0.00007007982,0.00020467234,0.00017525327,0.0029341634,0.008705964],"genre_scores_gemma":[0.5432642,0.00063080975,0.4470681,0.00016088341,0.000073908086,0.0002597961,0.0011645611,0.00073581515,0.0066420007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952539,0.0010735278,0.00036293283,0.00051801937,0.0025205219,0.0002711946],"domain_scores_gemma":[0.9820271,0.010373335,0.0011905865,0.0051482706,0.0009481666,0.00031265023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004231919,0.00084005727,0.00065463583,0.002824745,0.0005152971,0.0023643337,0.0020530166,0.0010398958,0.004855869],"category_scores_gemma":[0.021004269,0.00086714816,0.0010211329,0.002002688,0.0018148533,0.004678453,0.0023454954,0.002879135,0.000723316],"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.0007543844,0.00058669626,0.0032073553,0.0006924439,0.00013081337,0.00053297763,0.001630868,0.11210674,0.02710811,0.18950483,0.004076037,0.6596688],"study_design_scores_gemma":[0.00013070319,0.0005606005,0.0040163756,0.00043124775,0.000121337835,0.0004146389,0.00028581722,0.3935222,0.019353779,0.5679587,0.013132576,0.000072009745],"about_ca_topic_score_codex":0.0023227646,"about_ca_topic_score_gemma":0.0021228357,"teacher_disagreement_score":0.004855869,"about_ca_system_score_codex":0.0009811999,"about_ca_system_score_gemma":0.001117468,"threshold_uncertainty_score":0.02238077},"labels":[],"label_agreement":null},{"id":"W4385654123","doi":"10.1007/978-3-031-38554-4_17","title":"LaBRADOR: Compact Proofs for R1CS from Module-SIS","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":50,"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":"Mathematical proof; Hash function; Computer science; Cryptography; Combinatorial proof; Lattice (music); Proof of concept; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Physics","score_opus":0.02655264426282843,"score_gpt":0.25747748549641464,"score_spread":0.2309248412335862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654123","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.01798469,0.0030293916,0.76108307,0.0027232252,0.0008531442,0.00017445818,0.0013661435,0.0047223037,0.2080635],"genre_scores_gemma":[0.57990485,0.0044818493,0.22057709,0.0024910965,0.0015843618,0.0007082353,0.003071657,0.004724733,0.18245605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846953,0.00052187435,0.00006475798,0.0002203833,0.00058194087,0.0001415085],"domain_scores_gemma":[0.9971528,0.0017398173,0.00012724618,0.00054474187,0.00033715452,0.00009833367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016348728,0.0021603876,0.0010454884,0.0020116675,0.001150414,0.0030007001,0.0017929068,0.0010997453,0.03778248],"category_scores_gemma":[0.004892992,0.0010078081,0.0018035218,0.0017242834,0.0021345385,0.007102337,0.0037980927,0.0048036007,0.01274175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009549347,0.000047981976,0.00010552598,0.00037291663,0.000037111913,0.00010833425,0.00024828126,0.0021089523,0.002912192,0.9156968,0.02275015,0.055516247],"study_design_scores_gemma":[0.000037288755,0.000053989,0.0001457168,0.00009467452,0.000039879407,0.00019647741,0.000040281746,0.0068627046,0.0056223483,0.9367602,0.050104488,0.000042049727],"about_ca_topic_score_codex":0.00045138618,"about_ca_topic_score_gemma":0.0005208225,"teacher_disagreement_score":0.03778248,"about_ca_system_score_codex":0.0018297998,"about_ca_system_score_gemma":0.0008841605,"threshold_uncertainty_score":0.12639505},"labels":[],"label_agreement":null},{"id":"W4385654206","doi":"10.1007/978-3-031-38557-5_23","title":"Snowblind: A Threshold Blind Signature in Pairing-Free Groups","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pairing; Random oracle; Blind signature; Schnorr signature; Discrete logarithm; Ring signature; Signature (topology); Theoretical computer science; Mathematical proof; Algorithm; Public-key cryptography; Computer security; Mathematics; Encryption","score_opus":0.024402712206333707,"score_gpt":0.24855270673121407,"score_spread":0.22414999452488038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654206","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.017800039,0.0005661788,0.95308995,0.00053715776,0.000782637,0.00023813624,0.00039431604,0.006041055,0.02055052],"genre_scores_gemma":[0.41869476,0.0011777631,0.50039357,0.00087913463,0.0006897088,0.0004918556,0.001285487,0.0020725331,0.074315205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981901,0.00033960067,0.000111413494,0.00027143216,0.0008361768,0.0002513257],"domain_scores_gemma":[0.998946,0.00028865784,0.00006373188,0.0004186291,0.00014941762,0.00013355559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012640421,0.0008615079,0.0011827743,0.0012163103,0.0011689088,0.0028375997,0.001385383,0.0012807784,0.011910335],"category_scores_gemma":[0.0026727456,0.0005856507,0.0009536221,0.001819148,0.0022086545,0.0052560233,0.0049982136,0.002795287,0.0060088877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016997644,0.0002879476,0.0004399363,0.0004391426,0.000083851606,0.00030208396,0.00078235514,0.016120365,0.044297673,0.513957,0.037973013,0.38361678],"study_design_scores_gemma":[0.0003310697,0.00063140737,0.00034660948,0.000118093034,0.00006803019,0.00062587886,0.0001570897,0.09961095,0.051031146,0.73324394,0.11370745,0.00012828466],"about_ca_topic_score_codex":0.00029118426,"about_ca_topic_score_gemma":0.00027238278,"teacher_disagreement_score":0.011910335,"about_ca_system_score_codex":0.0008268802,"about_ca_system_score_gemma":0.0014183263,"threshold_uncertainty_score":0.039844096},"labels":[],"label_agreement":null},{"id":"W4385654366","doi":"10.1007/978-3-031-38545-2_25","title":"Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication!","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Secrecy; Dictator; Computer science; Authentication (law); Computer security; Law; Political science","score_opus":0.01628950245837511,"score_gpt":0.24092188075640647,"score_spread":0.22463237829803137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654366","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011363449,0.004063565,0.31297114,0.021810777,0.005595841,0.000114877024,0.0006095298,0.0018958498,0.641575],"genre_scores_gemma":[0.29682812,0.0039632395,0.061568283,0.0033846532,0.002281447,0.00024635045,0.0005016063,0.0013657394,0.6298605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00028064204,0.000042034422,0.00018784755,0.00033059766,0.00016823024],"domain_scores_gemma":[0.998872,0.00040459345,0.00005110527,0.00045679265,0.00015657478,0.000058950358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159909,0.0010565012,0.00056773354,0.00048967905,0.0021544727,0.0037248465,0.0011323866,0.0026218938,0.018367544],"category_scores_gemma":[0.0030423023,0.0010034327,0.0006702144,0.0007837502,0.0050983015,0.013099555,0.0030718793,0.006390337,0.019321091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056324938,0.000023268762,0.00003368368,0.000055441706,0.0000045872775,0.000052180207,0.00028386436,0.00042036574,0.0009640492,0.9324058,0.0401823,0.025518203],"study_design_scores_gemma":[0.000014722296,0.000023585739,0.000039664843,0.000052752494,0.00000572852,0.00021196256,0.00008556216,0.0022402327,0.002382409,0.87025535,0.12466473,0.000023328168],"about_ca_topic_score_codex":0.00043684503,"about_ca_topic_score_gemma":0.00036089338,"teacher_disagreement_score":0.018367544,"about_ca_system_score_codex":0.0011812403,"about_ca_system_score_gemma":0.0013667452,"threshold_uncertainty_score":0.061445594},"labels":[],"label_agreement":null},{"id":"W4385654399","doi":"10.1007/978-3-031-38554-4_23","title":"$$ \\textsf{DualMS}$$: Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free Simulation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Lattice (music); Signature (topology); Theoretical computer science; Algorithm; Physics; Mathematics; Geometry","score_opus":0.025721801543019982,"score_gpt":0.2691981119559343,"score_spread":0.24347631041291432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654399","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.017148454,0.00031713466,0.9384091,0.00072665676,0.00029027625,0.00021292752,0.00055023504,0.011801644,0.03054349],"genre_scores_gemma":[0.5103838,0.00031094972,0.45087442,0.00044620867,0.00012434981,0.0005431993,0.0012294723,0.002367392,0.03372017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794453,0.00048616886,0.00008895883,0.00027331407,0.00083686406,0.00037008323],"domain_scores_gemma":[0.998439,0.0005017931,0.000069217305,0.00066969806,0.00019782441,0.0001224187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578628,0.0009245384,0.0014927385,0.0008172939,0.0013842402,0.0028355871,0.0023620191,0.0012068058,0.020239674],"category_scores_gemma":[0.0026344114,0.00069717015,0.0010167733,0.0011057836,0.0015794984,0.0036427819,0.0048606014,0.0029847568,0.0111831445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012673006,0.00046828703,0.00033375603,0.00033213175,0.000078045385,0.00015451587,0.00022366081,0.07030228,0.025788903,0.58920974,0.034041166,0.2778002],"study_design_scores_gemma":[0.00019197437,0.00015564033,0.000109809924,0.000053883872,0.000024279467,0.00019895029,0.000048349906,0.5947572,0.024251895,0.35634556,0.023762027,0.000100468824],"about_ca_topic_score_codex":0.0010507565,"about_ca_topic_score_gemma":0.001285617,"teacher_disagreement_score":0.020239674,"about_ca_system_score_codex":0.0015856299,"about_ca_system_score_gemma":0.0028149423,"threshold_uncertainty_score":0.06770849},"labels":[],"label_agreement":null},{"id":"W4385654497","doi":"10.1007/978-3-031-38557-5_22","title":"Fully Adaptive Schnorr Threshold Signatures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":74,"is_retracted":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":"Random oracle; Discrete logarithm; Computer science; Schnorr signature; Signature (topology); Logarithm; Theoretical computer science; Simple (philosophy); Concrete security; Adversary; Scheme (mathematics); Discrete mathematics; Algorithm; Mathematics; Cryptography; Digital signature; Public-key cryptography; Computer security; Hash function","score_opus":0.021734287114679614,"score_gpt":0.2415970008238664,"score_spread":0.21986271370918678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654497","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.03333488,0.0016370544,0.8264542,0.001217156,0.0005753955,0.00011477833,0.0005871287,0.00423161,0.13184778],"genre_scores_gemma":[0.6049845,0.0019175934,0.21019742,0.000831115,0.00047675922,0.00015227201,0.00089959794,0.0009466256,0.17959408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990189,0.00010121453,0.000042382722,0.00016541997,0.00053951767,0.00013260354],"domain_scores_gemma":[0.99881697,0.00024619926,0.000070695125,0.00059798267,0.00021798382,0.000050128336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198702,0.00056615594,0.00045076865,0.0006092765,0.00046108582,0.0014204951,0.00093051814,0.00067612116,0.012867842],"category_scores_gemma":[0.0016031609,0.00041216286,0.0003395257,0.0010678642,0.0008745956,0.0032593883,0.002065415,0.0018108815,0.0060745934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003621214,0.00007180991,0.00026688853,0.00023632568,0.0000345985,0.00006833166,0.00016386538,0.011900542,0.062475216,0.5930167,0.018646868,0.31275663],"study_design_scores_gemma":[0.000049107864,0.00018982441,0.0006046745,0.00008045417,0.000046344587,0.00072883605,0.00007694003,0.09358608,0.101670854,0.66189027,0.14098367,0.000092942275],"about_ca_topic_score_codex":0.00016791752,"about_ca_topic_score_gemma":0.00023118794,"teacher_disagreement_score":0.012867842,"about_ca_system_score_codex":0.0007365349,"about_ca_system_score_gemma":0.0005630756,"threshold_uncertainty_score":0.04304719},"labels":[],"label_agreement":null},{"id":"W4385697923","doi":"10.1007/978-3-031-37731-0_34","title":"Automated Blue Whale Photo-Identification Using Local Feature Matching","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Marine animal studies overview","field":"Environmental 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":"Computer Research Institute of Montréal","funders":"","keywords":"Whale; Scale-invariant feature transform; Artificial intelligence; Computer science; Pattern recognition (psychology); Computer vision; Matching (statistics); Identification (biology); Humpback whale; Feature (linguistics); Feature extraction; Mathematics; Fishery; Statistics; Biology; Ecology","score_opus":0.022279952894220533,"score_gpt":0.25596724830465867,"score_spread":0.23368729541043815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385697923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13486667,0.0018930081,0.83616614,0.00013042199,0.00026575683,0.00015775631,0.0011953675,0.007835839,0.017489027],"genre_scores_gemma":[0.47395074,0.0011016433,0.47857,0.00016696533,0.000100014855,0.00014071104,0.003928261,0.00044654612,0.041595187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979347,0.000015914478,0.0000066077537,0.0000599807,0.00008545921,0.000038613416],"domain_scores_gemma":[0.9998567,0.000024032903,0.000011196649,0.000040779596,0.00005951213,0.000007827494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021492134,0.00036840347,0.00048251337,0.001186128,0.00030561074,0.0006035279,0.0006685711,0.0005372656,0.0045747436],"category_scores_gemma":[0.0002639128,0.00021610885,0.0004490003,0.0010928015,0.00013990316,0.000620015,0.00068128284,0.00021138934,0.004451956],"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.000105802654,0.00005632963,0.002261712,0.00009979169,0.000041767995,0.00009407869,0.000051216182,0.0028655438,0.1484708,0.00056645076,0.005951548,0.839435],"study_design_scores_gemma":[0.000042826076,0.00043557544,0.08095208,0.00011726809,0.00022702184,0.0023651405,0.0005154991,0.5312315,0.31603068,0.004457252,0.06350367,0.00012144733],"about_ca_topic_score_codex":0.0034652045,"about_ca_topic_score_gemma":0.00561361,"teacher_disagreement_score":0.0045747436,"about_ca_system_score_codex":0.00014940868,"about_ca_system_score_gemma":0.00020747873,"threshold_uncertainty_score":0.015304029},"labels":[],"label_agreement":null},{"id":"W4385698149","doi":"10.1007/978-3-031-37731-0_28","title":"YUTO Tree5000: A Large-Scale Airborne LiDAR Dataset for Single Tree Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Lidar; Computer science; Benchmark (surveying); Tree (set theory); Point cloud; Minimum bounding box; Artificial intelligence; Object detection; Segmentation; Bounding overwatch; Field (mathematics); Convolutional neural network; Context (archaeology); Remote sensing; Data mining; Cartography; Geography; Image (mathematics)","score_opus":0.017528192979707313,"score_gpt":0.24003393284874752,"score_spread":0.2225057398690402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385698149","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028067203,0.0010020797,0.014467283,0.00022305141,0.0002791474,0.0003637603,0.90956056,0.04130653,0.004730366],"genre_scores_gemma":[0.016254017,0.0001714814,0.022881307,0.00010862787,0.00003230692,0.00019281091,0.95754504,0.0012575472,0.0015567045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993031,0.000045535824,0.00003837599,0.0001929115,0.0003163768,0.00010372572],"domain_scores_gemma":[0.9992755,0.00007661738,0.000041863517,0.0002250665,0.00028892412,0.0000920889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053982326,0.0023983219,0.0015163515,0.0026545033,0.0007577372,0.0011117407,0.0028563086,0.0015572106,0.011321378],"category_scores_gemma":[0.0019874196,0.0008938229,0.0011732755,0.0037562805,0.00033250125,0.0014915457,0.0013746768,0.0012402146,0.021560814],"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.0004149574,0.00043947078,0.0040699136,0.00075922743,0.00025093387,0.00015460163,0.00009077785,0.007798835,0.01410147,0.00064922514,0.8817174,0.08955312],"study_design_scores_gemma":[0.0015195719,0.0005321123,0.06555192,0.00036484105,0.00040302507,0.0010721895,0.0004885476,0.20739402,0.038536575,0.010440429,0.6731688,0.0005279321],"about_ca_topic_score_codex":0.027680626,"about_ca_topic_score_gemma":0.06664392,"teacher_disagreement_score":0.027680626,"about_ca_system_score_codex":0.00061948964,"about_ca_system_score_gemma":0.0015805418,"threshold_uncertainty_score":0.05503905},"labels":[],"label_agreement":null},{"id":"W4385698308","doi":"10.1007/978-3-031-37731-0_44","title":"Brief Audit of Post-pandemic Biometrics","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","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 Calgary","funders":"","keywords":"Biometrics; Computer science; Audit; Computer security; Realm; Business; Political science; Accounting","score_opus":0.05857811775612816,"score_gpt":0.3446231220084294,"score_spread":0.2860450042523012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385698308","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.21234716,0.033102956,0.026585162,0.15074052,0.03387364,0.0026412054,0.038308438,0.005589678,0.4968113],"genre_scores_gemma":[0.47849151,0.022171086,0.017804053,0.022079132,0.007929037,0.00046904307,0.019853232,0.0010659586,0.4301369],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99358904,0.0013493433,0.0006857741,0.0003026617,0.0034311244,0.000642075],"domain_scores_gemma":[0.9627863,0.0077253263,0.0024451052,0.0030741123,0.022697568,0.0012715682],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005194782,0.00041704357,0.00029938048,0.004568444,0.0015981483,0.0022140048,0.0010846427,0.00178179,0.018085396],"category_scores_gemma":[0.023210239,0.0004432685,0.00033806177,0.002595598,0.0006141918,0.0016692224,0.0015858979,0.002094211,0.007614354],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005453782,0.00022048608,0.03676339,0.0014943277,0.000038751168,0.0033156555,0.002349362,0.0010227265,0.007110987,0.011896937,0.563708,0.37153414],"study_design_scores_gemma":[0.00001091659,0.00022534793,0.08563246,0.00074735377,0.000022425123,0.0016708989,0.0020502282,0.00070267235,0.0036741393,0.0016082936,0.90359485,0.000060405382],"about_ca_topic_score_codex":0.01842315,"about_ca_topic_score_gemma":0.026551796,"teacher_disagreement_score":0.9984019,"about_ca_system_score_codex":0.0025422026,"about_ca_system_score_gemma":0.004055746,"threshold_uncertainty_score":0.060501635},"labels":[],"label_agreement":null},{"id":"W4385701337","doi":"10.1007/978-3-031-39831-5_22","title":"Exploring Dialog Act Recognition in Open Domain Conversational Agents","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dialog box; Computer science; Classifier (UML); Open domain; Dialog system; Artificial intelligence; Support vector machine; Domain (mathematical analysis); Baseline (sea); Natural language processing; Machine learning; Speech recognition; World Wide Web; Question answering","score_opus":0.1822798249837222,"score_gpt":0.2925068874468192,"score_spread":0.11022706246309699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385701337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15483809,0.0013857639,0.8321066,0.0005082978,0.00010865731,0.00013507785,0.0005036707,0.003635698,0.0067781513],"genre_scores_gemma":[0.78517956,0.00029581253,0.20776697,0.00011948124,0.000064234446,0.00010714531,0.0011617488,0.00028065816,0.0050244075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907804,0.0004156596,0.0000361891,0.00025179697,0.000112570204,0.000105789055],"domain_scores_gemma":[0.9977016,0.0018768212,0.00008045079,0.00012627363,0.00012971023,0.000085127554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011500848,0.0007458907,0.0009039686,0.000580387,0.0007256005,0.0026821245,0.0012460201,0.00125687,0.0037378077],"category_scores_gemma":[0.004148556,0.00051531085,0.00087832025,0.0005098347,0.00050528604,0.002728734,0.001978709,0.0018262768,0.0011264973],"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.0016540776,0.0007759254,0.0079343375,0.0005856426,0.00030130445,0.0007071377,0.0046655196,0.096789256,0.060414866,0.030486647,0.0095273545,0.78615797],"study_design_scores_gemma":[0.000016967244,0.00007936852,0.0015323893,0.00003082408,0.00004141936,0.00011132693,0.00082804833,0.96004343,0.00902204,0.024756525,0.0035134393,0.000024203584],"about_ca_topic_score_codex":0.0034844277,"about_ca_topic_score_gemma":0.0037049023,"teacher_disagreement_score":0.0037378077,"about_ca_system_score_codex":0.0005084242,"about_ca_system_score_gemma":0.00053363765,"threshold_uncertainty_score":0.01250422},"labels":[],"label_agreement":null},{"id":"W4385701495","doi":"10.1007/978-3-031-39831-5_13","title":"Bitwise Vertical Mining of Minimal Rare Patterns","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Computer science; Data mining; Association rule learning; Bitwise operation; Rare events; Efficient algorithm; VIPeR; Interpretation (philosophy); Algorithm; Mathematics; Statistics","score_opus":0.027823421920793158,"score_gpt":0.2630863891843442,"score_spread":0.23526296726355103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385701495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3004337,0.0025131695,0.67525077,0.000963729,0.0003510135,0.00024220314,0.0068641626,0.0023104057,0.011070862],"genre_scores_gemma":[0.56826705,0.0011733121,0.40024182,0.00029305724,0.0003315571,0.0002563128,0.018195273,0.00032341978,0.0109182615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897206,0.0001544054,0.00012013206,0.00020164742,0.00040814315,0.0001435907],"domain_scores_gemma":[0.99696976,0.00132382,0.00036430123,0.00058107957,0.0006046869,0.00015645048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006807438,0.00051480444,0.00095772865,0.0026783338,0.0006576615,0.0013477774,0.0014164074,0.0006160793,0.004494596],"category_scores_gemma":[0.0053145387,0.0003832903,0.0007138232,0.0032502662,0.000520854,0.0020848182,0.0014989603,0.00086818525,0.0015540244],"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.0014934068,0.00033112036,0.018727366,0.00096726173,0.00019641613,0.0007700971,0.00025661287,0.013977471,0.042060707,0.05259737,0.018918825,0.8497034],"study_design_scores_gemma":[0.00019821277,0.000941781,0.014169111,0.00051015255,0.00031375978,0.004570124,0.0006128332,0.64480144,0.04364335,0.2615797,0.028567307,0.00009231465],"about_ca_topic_score_codex":0.0006603902,"about_ca_topic_score_gemma":0.0016631577,"teacher_disagreement_score":0.004494596,"about_ca_system_score_codex":0.00029116124,"about_ca_system_score_gemma":0.0009940137,"threshold_uncertainty_score":0.015035987},"labels":[],"label_agreement":null},{"id":"W4385705493","doi":"10.1007/978-3-031-39831-5_31","title":"Data-driven and On-Demand Conceptual Modeling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Schema (genetic algorithms); Novelty; Conceptual schema; Data modeling; Data mining; A priori and a posteriori; Graph; Data science; Theoretical computer science; Information retrieval; Software engineering","score_opus":0.060756966184347255,"score_gpt":0.2838812804370962,"score_spread":0.22312431425274895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385705493","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.006176662,0.000091736336,0.98672396,0.00025629863,0.000026820664,0.000111748624,0.00089612463,0.0009358435,0.0047808792],"genre_scores_gemma":[0.23746112,0.000617401,0.7459067,0.00016212167,0.000045934077,0.0003782153,0.0046799215,0.00078704406,0.0099615585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780005,0.00060691545,0.00016152732,0.00031519524,0.00096206024,0.00015426632],"domain_scores_gemma":[0.9954848,0.0022334734,0.00015106486,0.0012202639,0.0007861691,0.00012415713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019861346,0.0008436815,0.00083940517,0.0012160932,0.00064566283,0.004480446,0.0040358976,0.0011660075,0.009810938],"category_scores_gemma":[0.009769884,0.0010291178,0.0023390972,0.0018871829,0.00097626017,0.0055837263,0.0030039244,0.0018937051,0.002020774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018556128,0.00017451715,0.0017410289,0.00037355386,0.0000953698,0.0003886324,0.0007550703,0.39344507,0.004411418,0.45728013,0.009160786,0.13198887],"study_design_scores_gemma":[0.0000110278925,0.000014745048,0.00011625387,0.00002450194,0.000021565429,0.000076584736,0.00010385847,0.86331606,0.0024144158,0.12065219,0.013234677,0.00001422197],"about_ca_topic_score_codex":0.008283807,"about_ca_topic_score_gemma":0.011244852,"teacher_disagreement_score":0.009810938,"about_ca_system_score_codex":0.0016332476,"about_ca_system_score_gemma":0.0017414239,"threshold_uncertainty_score":0.03282082},"labels":[],"label_agreement":null},{"id":"W4385710887","doi":"10.1007/978-3-031-40247-0_20","title":"Transduction of Automatic Sequences and Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Fibonacci number; Computer science; Transduction (biophysics); Software; Theoretical computer science; Artificial intelligence; Algebra over a field; Combinatorics; Mathematics; Programming language; Pure mathematics","score_opus":0.015946788389805955,"score_gpt":0.24140513683281806,"score_spread":0.2254583484430121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385710887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041997224,0.007175204,0.49800995,0.0015060038,0.0016097195,0.00012231563,0.0005273611,0.001500802,0.4475515],"genre_scores_gemma":[0.57670957,0.009151607,0.13110648,0.0009701116,0.0016969318,0.00040747513,0.0013295929,0.0009205092,0.27770776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959046,0.00007491685,0.000029836774,0.00010142805,0.00015969583,0.00004379632],"domain_scores_gemma":[0.99972934,0.00011880821,0.000014886697,0.0000493231,0.00006184497,0.00002572875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036560412,0.0006054839,0.00054469565,0.0012925129,0.0007548687,0.0024616776,0.000589135,0.00063347246,0.015036978],"category_scores_gemma":[0.0009195887,0.00039674572,0.00082458503,0.0016061539,0.0016475768,0.0027559157,0.0019478246,0.0015863146,0.004221206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010020104,0.000018109457,0.000042160234,0.00006127857,0.0000039620777,0.00005522464,0.00017363149,0.00051250117,0.0018331009,0.9606701,0.003126604,0.033493303],"study_design_scores_gemma":[0.000004303852,0.000019622945,0.000109892404,0.000025443675,0.0000056732024,0.00019084611,0.00007581893,0.0038386155,0.0013553365,0.95717883,0.03718633,0.000009255003],"about_ca_topic_score_codex":0.0002608986,"about_ca_topic_score_gemma":0.00017723742,"teacher_disagreement_score":0.015036978,"about_ca_system_score_codex":0.0006936851,"about_ca_system_score_gemma":0.00040934555,"threshold_uncertainty_score":0.050303698},"labels":[],"label_agreement":null},{"id":"W4385711238","doi":"10.1007/978-3-031-37731-0","title":"Pattern Recognition, Computer Vision, and Image Processing. ICPR 2022 International Workshops and Challenges","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Ontario Tech University; York University","funders":"","keywords":"Computer science; Biometrics; Image processing; Computer vision; Artificial intelligence; Image (mathematics)","score_opus":0.020919602689181638,"score_gpt":0.2614261664746392,"score_spread":0.24050656378545754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385711238","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045691347,0.32201776,0.40584797,0.009457324,0.022419497,0.00044830586,0.0031375212,0.012390134,0.21971242],"genre_scores_gemma":[0.018960804,0.17055348,0.22049588,0.0024639112,0.008148778,0.00036982237,0.007318222,0.0027218098,0.56896734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981329,0.00018473541,0.000099215846,0.00032176205,0.0011162603,0.00014523271],"domain_scores_gemma":[0.9983103,0.00040216517,0.00008458403,0.00029710386,0.0006952417,0.00021058599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002213972,0.0020853004,0.0022918426,0.0026303788,0.0006020815,0.0038342134,0.0025015313,0.0021826364,0.04581776],"category_scores_gemma":[0.0019265596,0.0012403907,0.0013350105,0.0039110747,0.001118987,0.00420846,0.0033572533,0.0026935914,0.05900038],"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.00006361788,0.000102955404,0.00014409419,0.00069837103,0.000031336716,0.00008333298,0.000042768817,0.0008866628,0.0041840845,0.0064510857,0.34731787,0.6399938],"study_design_scores_gemma":[0.000019382516,0.0001388741,0.0013856137,0.00031040164,0.00003307978,0.0017858687,0.00007744376,0.009463597,0.005057059,0.014861951,0.9668164,0.000050303584],"about_ca_topic_score_codex":0.0018753313,"about_ca_topic_score_gemma":0.002390565,"teacher_disagreement_score":0.04581776,"about_ca_system_score_codex":0.0007167373,"about_ca_system_score_gemma":0.0015146472,"threshold_uncertainty_score":0.15327567},"labels":[],"label_agreement":null},{"id":"W4385711308","doi":"10.1007/978-3-031-37731-0_35","title":"Toward Data-Driven Glare Classification and Prediction for Marine Megafauna Survey","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Marine animal studies overview","field":"Environmental 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":"National Research Council Canada; University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science; GLARE; Artificial intelligence; Machine learning; Classifier (UML); Artificial neural network; Leverage (statistics); Population; Multilayer perceptron; Data mining","score_opus":0.09996349811289351,"score_gpt":0.2816914780558977,"score_spread":0.18172797994300421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385711308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012787981,0.00052840373,0.9806402,0.00019162717,0.00007288735,0.000047282014,0.0010306857,0.0039479467,0.00075305504],"genre_scores_gemma":[0.21784516,0.00077152194,0.76891774,0.000381112,0.00020530375,0.00022726007,0.006700523,0.00029021787,0.0046612043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973243,0.000041074418,0.000019771842,0.000086574335,0.00008674507,0.000033416713],"domain_scores_gemma":[0.999323,0.000245543,0.00003990711,0.00009997937,0.0002579893,0.000033521646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087923,0.0007531683,0.0009552498,0.0010484483,0.00029691376,0.0010148054,0.0016231292,0.0010109199,0.0019900193],"category_scores_gemma":[0.0021264872,0.0005545832,0.0009722715,0.0012730494,0.0002039782,0.0009905098,0.0011858789,0.0009838571,0.0024587451],"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.00009241687,0.00015182006,0.0053586345,0.00011875006,0.00010651947,0.00006364397,0.000049878556,0.19347444,0.01073646,0.0021522236,0.012574975,0.77512026],"study_design_scores_gemma":[0.0000035721514,0.000012866473,0.00091633765,0.000009003919,0.000009421378,0.000017408569,0.00001750206,0.99312466,0.0018451549,0.0026533476,0.0013851885,0.000005516245],"about_ca_topic_score_codex":0.0132832965,"about_ca_topic_score_gemma":0.015333337,"teacher_disagreement_score":0.0132832965,"about_ca_system_score_codex":0.0004840624,"about_ca_system_score_gemma":0.00070216577,"threshold_uncertainty_score":0.02641195},"labels":[],"label_agreement":null},{"id":"W4385711338","doi":"10.1007/978-3-031-37731-0_26","title":"Uncertainty Analysis of Sea Ice and Open Water Classification on SAR Imagery Using a Bayesian CNN","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Arctic and Antarctic ice dynamics","field":"Earth and Planetary Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Synthetic aperture radar; Artificial intelligence; Convolutional neural network; Pixel; Sea ice; Bayesian inference; Segmentation; Pattern recognition (psychology); Bayesian probability; Contextual image classification; Remote sensing; Image (mathematics); Geology","score_opus":0.03248573430877123,"score_gpt":0.25709766994117295,"score_spread":0.22461193563240173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385711338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111409105,0.0008860432,0.8839347,0.000457921,0.00007544428,0.00003475685,0.00028016948,0.0004092213,0.0025126173],"genre_scores_gemma":[0.91552186,0.0006482874,0.076952904,0.00014235484,0.00016631147,0.00005786454,0.0008015506,0.00009771997,0.0056111547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997651,0.000038718335,0.000013555945,0.00007464152,0.00006379278,0.000044172713],"domain_scores_gemma":[0.9993011,0.0004328888,0.00006928282,0.00004613514,0.00012345557,0.000027178312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009991932,0.00057503715,0.00074524985,0.00064663024,0.00024180573,0.00088644703,0.00094154297,0.0008688999,0.0011822297],"category_scores_gemma":[0.0022356098,0.00061772706,0.00087654777,0.0006274165,0.00051002717,0.0013113617,0.00079541,0.0008434601,0.00021474785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017232004,0.000036323636,0.0016472292,0.00005733813,0.00007707791,0.00007622469,0.00003813072,0.8470522,0.0046298904,0.007025755,0.0012772096,0.13791032],"study_design_scores_gemma":[7.138807e-7,0.0000048589413,0.00022000907,0.0000018448337,0.0000037534278,0.0000043862315,0.0000017931818,0.9983247,0.0002574775,0.001125371,0.000052888954,0.0000022066738],"about_ca_topic_score_codex":0.016110407,"about_ca_topic_score_gemma":0.014134867,"teacher_disagreement_score":0.016110407,"about_ca_system_score_codex":0.0011518943,"about_ca_system_score_gemma":0.0007518217,"threshold_uncertainty_score":0.032033265},"labels":[],"label_agreement":null},{"id":"W4385711340","doi":"10.1007/978-3-031-37731-0_29","title":"Spatial Layout Consistency for 3D Semantic Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"York University","funders":"","keywords":"Computer science; Point cloud; Segmentation; Consistency (knowledge bases); Context (archaeology); Artificial intelligence; Convolutional neural network; Ranging; Spatial contextual awareness; Data mining; Geography","score_opus":0.01782298134074281,"score_gpt":0.24905999439859255,"score_spread":0.23123701305784974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385711340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007917351,0.0004972644,0.98545396,0.00006956875,0.00006023533,0.00006724558,0.000613904,0.0038533797,0.0014670677],"genre_scores_gemma":[0.1825456,0.0005472169,0.80641496,0.00014680032,0.00012076753,0.00018765805,0.004436678,0.0021507698,0.0034494887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820805,0.00026980904,0.00013255115,0.0005868676,0.0006472586,0.00015551341],"domain_scores_gemma":[0.997038,0.00091234857,0.00024117791,0.0011157357,0.00061925146,0.000073507705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013944276,0.0012602077,0.0021120594,0.0027356187,0.0007131661,0.00250295,0.0042446153,0.0017047437,0.007720714],"category_scores_gemma":[0.0049414565,0.001799567,0.0017054204,0.0046360884,0.0013105683,0.003670831,0.0032064677,0.001629827,0.002686682],"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.00075790903,0.00015319647,0.0014538827,0.00054105814,0.0001788986,0.00016456582,0.00023435513,0.18327901,0.028593596,0.032986622,0.013263417,0.73839337],"study_design_scores_gemma":[0.00004893558,0.00008806396,0.0010256218,0.00005227554,0.00005699811,0.00018335319,0.000106554864,0.9322209,0.016756687,0.042186968,0.007235853,0.000037798476],"about_ca_topic_score_codex":0.008476743,"about_ca_topic_score_gemma":0.010832297,"teacher_disagreement_score":0.008476743,"about_ca_system_score_codex":0.0012357867,"about_ca_system_score_gemma":0.0015221222,"threshold_uncertainty_score":0.025828362},"labels":[],"label_agreement":null},{"id":"W4385711891","doi":"10.1007/978-3-031-40003-2_20","title":"Post-Quantum Signatures in DNSSEC via Request-Based Fragmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Network packet; Digital signature; Computer network; Public-key cryptography; Byte; Computer security; Hash function; Encryption; Computer hardware","score_opus":0.0138422749043201,"score_gpt":0.2523390335573309,"score_spread":0.2384967586530108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385711891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13579196,0.0010107594,0.8157532,0.0016094442,0.00056582375,0.00050813414,0.0003372012,0.005164736,0.03925866],"genre_scores_gemma":[0.9066749,0.00022848559,0.07989052,0.00028992072,0.00014715912,0.00014395818,0.00025625975,0.0002532136,0.012115421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498653,0.0013161661,0.00032909116,0.0004664895,0.0019060881,0.000995637],"domain_scores_gemma":[0.989837,0.0027240666,0.00045767758,0.0058754184,0.000860678,0.00024516386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041283634,0.00052427745,0.0016656456,0.0011064311,0.002130199,0.003722743,0.0016891074,0.0021110384,0.009089361],"category_scores_gemma":[0.008481252,0.0006640545,0.00068300136,0.0018289448,0.0033462371,0.008058826,0.006503197,0.0027539912,0.0036463768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018893051,0.00052336854,0.0021236762,0.00030128538,0.0000826139,0.0005547252,0.00083216286,0.038637344,0.022595305,0.6496777,0.012582764,0.2701996],"study_design_scores_gemma":[0.00016827401,0.00037858874,0.00075784745,0.00011043723,0.00007099808,0.0009868861,0.00046075057,0.32591704,0.050654598,0.60373276,0.016630536,0.00013134771],"about_ca_topic_score_codex":0.0005954459,"about_ca_topic_score_gemma":0.00070941815,"teacher_disagreement_score":0.009089361,"about_ca_system_score_codex":0.0018400326,"about_ca_system_score_gemma":0.0025960119,"threshold_uncertainty_score":0.030406892},"labels":[],"label_agreement":null},{"id":"W4385774984","doi":"10.1007/978-3-031-39828-5","title":"Network and System Security","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"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":"Royal Holloway, University of London; National Research Council Canada; Fujian Normal University; Universität Paderborn; Wuhan University of Technology; University of Aizu; Norges Teknisk-Naturvitenskapelige Universitet; Danmarks Tekniske Universitet; Florida Atlantic University; Politechnika Warszawska; Jinan University; University of Surrey; University of Twente; Universidad del Atlántico; University of Aberdeen; Cardiff University; Universität Passau; Universidad de Málaga; Meiji University; University of Fukui; Wuhan University; Bowling Green State University; University of Oregon; Shandong University; Guangzhou University; King Abdullah University of Science and Technology; National Dong Hwa University; Murdoch University; University of Ottawa; King's College London; Advanced Digital Sciences Center","keywords":"Computer science; Computer security; Blockchain; Network security; Security system","score_opus":0.011144669540533964,"score_gpt":0.22103513136194083,"score_spread":0.20989046182140686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385774984","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008698686,0.039072845,0.01843025,0.0028949257,0.003766194,0.00007069773,0.00021764019,0.000627657,0.9340499],"genre_scores_gemma":[0.00701744,0.016863192,0.0030533054,0.00072682643,0.001317163,0.000051828945,0.00017403698,0.00019802238,0.97059816],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960095,0.00005180739,0.00000957246,0.000059288577,0.00024747718,0.00003092658],"domain_scores_gemma":[0.9996667,0.00008420444,0.000020034098,0.0001077243,0.0000847686,0.00003663265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003550901,0.0017106225,0.00095058687,0.001475402,0.00090767245,0.0029168911,0.0006103791,0.001144886,0.09952576],"category_scores_gemma":[0.0010285911,0.0005071435,0.00035761442,0.0018099879,0.0014649141,0.0034544477,0.0014848899,0.0026707202,0.06297562],"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.000021780717,0.00004059604,0.00011202813,0.00022002446,0.000014919201,0.00005992089,0.0002273447,0.001080066,0.0010637873,0.15509412,0.5261993,0.31586608],"study_design_scores_gemma":[0.0000039377155,0.00002655474,0.0002445695,0.00012815422,0.000007938771,0.00016484087,0.000049726223,0.00088974525,0.00022172797,0.04511454,0.95314294,0.0000052979367],"about_ca_topic_score_codex":0.0016682524,"about_ca_topic_score_gemma":0.0037272857,"teacher_disagreement_score":0.09952576,"about_ca_system_score_codex":0.0013593173,"about_ca_system_score_gemma":0.0011434125,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4385832543","doi":"10.1007/978-3-031-39821-6_28","title":"Subspace Clustering Technique Using Multi-objective Functions for Multi-class Categorical Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms 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":"Concordia University","funders":"","keywords":"Cluster analysis; Computer science; Categorical variable; Data mining; CURE data clustering algorithm; Correlation clustering; Fuzzy clustering; Clustering high-dimensional data; Entropy (arrow of time); Artificial intelligence; Class (philosophy); Pattern recognition (psychology); Subspace topology; Data stream clustering; Machine learning","score_opus":0.1494450529088616,"score_gpt":0.3744778443600943,"score_spread":0.2250327914512327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385832543","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.0045847693,0.00022227825,0.9942152,0.00004872841,0.000042589152,0.00002436217,0.0000697134,0.0003168341,0.0004756767],"genre_scores_gemma":[0.09400249,0.00039234594,0.90138173,0.000055607117,0.00006580362,0.00014615554,0.000727758,0.00015034326,0.003077775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867463,0.0003493342,0.00008553691,0.00025284357,0.0005445892,0.00009315613],"domain_scores_gemma":[0.999102,0.00021506839,0.000054961,0.00014171378,0.00044182627,0.000044490742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014274612,0.0007176114,0.0016652293,0.0016174543,0.0010262429,0.001216275,0.0015097787,0.0008621669,0.0022753999],"category_scores_gemma":[0.0017691549,0.0002890385,0.0019701454,0.0034413827,0.0004409155,0.0014127984,0.0013281419,0.0014776539,0.0011342095],"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.00016383034,0.00016343022,0.0013058712,0.00022758024,0.00019094578,0.000080576574,0.00019849086,0.112164676,0.021718789,0.014864025,0.0068490226,0.8420728],"study_design_scores_gemma":[0.0000061482497,0.000070745846,0.0009767313,0.000013166333,0.0000361147,0.00013354549,0.00009563116,0.98237014,0.0052302354,0.007742299,0.0032888318,0.000036393092],"about_ca_topic_score_codex":0.0031996015,"about_ca_topic_score_gemma":0.0038915293,"teacher_disagreement_score":0.0031996015,"about_ca_system_score_codex":0.0005658665,"about_ca_system_score_gemma":0.0009771278,"threshold_uncertainty_score":0.00761199},"labels":[],"label_agreement":null},{"id":"W4385832544","doi":"10.1007/978-3-031-39821-6_6","title":"Explaining Decisions of Black-Box Models Using BARBE","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Debugging; Black box; Artificial intelligence; Inference; Machine learning; Classifier (UML); Programming language","score_opus":0.09758068534050314,"score_gpt":0.3086712252729021,"score_spread":0.21109053993239896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385832544","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.021209039,0.00020272635,0.9524022,0.0010535807,0.000085750886,0.000078476296,0.00018310329,0.00082874054,0.02395639],"genre_scores_gemma":[0.5503294,0.00044002855,0.43121997,0.00028540238,0.00006667048,0.00017216703,0.0004747627,0.0005942213,0.01641734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987244,0.0006285334,0.000077317825,0.000197243,0.00024468827,0.00012788844],"domain_scores_gemma":[0.99488455,0.003972674,0.0002174412,0.00060138665,0.00021427352,0.000109629276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018477935,0.0011431773,0.0008408433,0.00085602945,0.0010687251,0.0027199076,0.0015037684,0.0020096381,0.016260015],"category_scores_gemma":[0.010919927,0.0010648958,0.0023538263,0.00069607474,0.002251663,0.005871311,0.0022821114,0.0031208168,0.0019082743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000642536,0.00003209812,0.00038758217,0.00007614022,0.000032444874,0.00016423059,0.0005016973,0.083566435,0.0006036592,0.89912635,0.0020091934,0.013436011],"study_design_scores_gemma":[0.000018716064,0.000009840162,0.00006523204,0.000033346256,0.000020875816,0.000019922387,0.000051507945,0.23587458,0.0006683718,0.7596385,0.0035855172,0.000013544309],"about_ca_topic_score_codex":0.0059375865,"about_ca_topic_score_gemma":0.007293409,"teacher_disagreement_score":0.016260015,"about_ca_system_score_codex":0.0015046299,"about_ca_system_score_gemma":0.0010671864,"threshold_uncertainty_score":0.0543952},"labels":[],"label_agreement":null},{"id":"W4385832586","doi":"10.1007/978-3-031-39821-6_31","title":"Toward Healthy Aging: Temporal Regression for Disability Prediction and Warning Decision-Making","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Insurance, Mortality, Demography, Risk Management","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":"Université de Sherbrooke","funders":"","keywords":"Warning system; Computer science; Population ageing; Regression; Regression analysis; Population; Healthy aging; Artificial intelligence; Machine learning; Gerontology; Demography; Medicine; Statistics; Mathematics; Telecommunications","score_opus":0.04238820405075316,"score_gpt":0.3434833588677106,"score_spread":0.3010951548169574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385832586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007614569,0.0029520763,0.98370475,0.0013272517,0.00020253916,0.000017695515,0.000263319,0.0005388429,0.0033790073],"genre_scores_gemma":[0.30823383,0.008105645,0.65859425,0.0006670234,0.0010275379,0.00016228762,0.0013683718,0.00044826893,0.021392835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995017,0.00025714343,0.0000246351,0.00010309075,0.000085090076,0.000028364886],"domain_scores_gemma":[0.9968816,0.0025774315,0.00012785217,0.000118190816,0.00024183812,0.00005312585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031609146,0.0008413711,0.0008174867,0.0006027073,0.00017748128,0.0012067127,0.0009665235,0.0006900971,0.003933615],"category_scores_gemma":[0.00906028,0.00043432545,0.000694019,0.0009637443,0.00036962295,0.0015377839,0.0006810007,0.0018293704,0.0013436595],"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.00018097121,0.00016672087,0.0047780504,0.00024216542,0.00024556203,0.000107454776,0.00016586513,0.35358438,0.0014675753,0.07203472,0.025750127,0.54127645],"study_design_scores_gemma":[0.000005291916,0.000022857708,0.0004829554,0.000023155904,0.000025386205,0.000020619007,0.000014531558,0.9637463,0.0002296183,0.03278696,0.0026332622,0.000008984896],"about_ca_topic_score_codex":0.0062979003,"about_ca_topic_score_gemma":0.006484266,"teacher_disagreement_score":0.0062979003,"about_ca_system_score_codex":0.00038841343,"about_ca_system_score_gemma":0.00088207755,"threshold_uncertainty_score":0.01671666},"labels":[],"label_agreement":null},{"id":"W4385832609","doi":"10.1007/978-3-031-39821-6_37","title":"A Machine-Learning Framework for Supporting Content Recommendation via User Feedback Data and Content Profiles in Content Managements Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Content (measure theory); Recommender system; Collaborative filtering; Content management system; Content management; Information retrieval; Matrix decomposition; Multimedia; World Wide Web","score_opus":0.12602808196771637,"score_gpt":0.31055624886037125,"score_spread":0.1845281668926549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385832609","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.0022251068,0.00021685135,0.99509865,0.00016196234,0.000027892167,0.00006644645,0.00013775394,0.0014497415,0.00061557896],"genre_scores_gemma":[0.1206119,0.00029263718,0.87404466,0.00015351638,0.000095950345,0.00018405526,0.00059785036,0.00014348791,0.0038758626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979559,0.00074466626,0.00016415799,0.00040834068,0.0005938526,0.00013296404],"domain_scores_gemma":[0.99613875,0.002308751,0.00016292631,0.0004945021,0.000764821,0.00013016528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722241,0.0007386031,0.0016064163,0.0014659809,0.0012722053,0.0022622182,0.0028708212,0.0018657349,0.0035851623],"category_scores_gemma":[0.0075257663,0.00080807856,0.0012459542,0.002098744,0.00073762255,0.003265931,0.0016194654,0.0024825954,0.0020637126],"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.0002913059,0.00071241363,0.0025417288,0.00028922313,0.00026291204,0.00022484684,0.0002761183,0.33896965,0.0078078373,0.08292697,0.0142102465,0.55148673],"study_design_scores_gemma":[0.000007391323,0.000019601564,0.000119110184,0.000008610549,0.000012883751,0.000019842118,0.000008041958,0.9860119,0.0008720235,0.011262573,0.001648015,0.000009965366],"about_ca_topic_score_codex":0.022510622,"about_ca_topic_score_gemma":0.029226327,"teacher_disagreement_score":0.022510622,"about_ca_system_score_codex":0.0014624477,"about_ca_system_score_gemma":0.0020679168,"threshold_uncertainty_score":0.044759154},"labels":[],"label_agreement":null},{"id":"W4385832667","doi":"10.1007/978-3-031-39821-6_7","title":"Efficient Video Captioning with Frame Similarity-Based Filtering","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Queen's University","funders":"","keywords":"Closed captioning; Computer science; Artificial intelligence; Frame (networking); Similarity (geometry); Task (project management); Feature (linguistics); Convolutional neural network; Convolution (computer science); Computer vision; Pattern recognition (psychology); Speech recognition; Artificial neural network; Natural language processing; Image (mathematics)","score_opus":0.017219776979267562,"score_gpt":0.2568358270065685,"score_spread":0.2396160500273009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385832667","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.0066147847,0.0009193467,0.9845095,0.00009365958,0.00026497923,0.00014930933,0.0003382465,0.004280647,0.002829575],"genre_scores_gemma":[0.064526424,0.0012862558,0.92172074,0.00014883187,0.00036506003,0.00018832853,0.0023783676,0.0008329319,0.008553027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991442,0.00011876676,0.000048691974,0.00017982465,0.00040458154,0.00010384184],"domain_scores_gemma":[0.9989662,0.0002895026,0.00005590816,0.00019531758,0.00043765985,0.00005553141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068111235,0.0018959119,0.002003502,0.003133684,0.00067409,0.0018615571,0.0015901385,0.0013772314,0.0114855245],"category_scores_gemma":[0.0024457008,0.0006151139,0.0013640176,0.0031868704,0.00042437963,0.0017316319,0.001271697,0.0013372946,0.008118578],"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.00044220244,0.00011829771,0.00016694856,0.00021677812,0.000055104436,0.00011703964,0.00004436896,0.008951407,0.093264885,0.0024861237,0.01266802,0.8814689],"study_design_scores_gemma":[0.00004566961,0.00021240195,0.0009877086,0.00004106204,0.00011217792,0.00054702576,0.000067447436,0.83294827,0.14444992,0.004010279,0.016527312,0.000050667826],"about_ca_topic_score_codex":0.004569843,"about_ca_topic_score_gemma":0.0048341355,"teacher_disagreement_score":0.0114855245,"about_ca_system_score_codex":0.00059260626,"about_ca_system_score_gemma":0.0006911607,"threshold_uncertainty_score":0.038422883},"labels":[],"label_agreement":null},{"id":"W4385958742","doi":"10.1007/978-3-031-39847-6_8","title":"Streaming Data Analytics for Feature Importance Measures in Concept Drift Detection and Adaptation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"Concordia University","funders":"","keywords":"Concept drift; Computer science; Data mining; Data stream mining; Classifier (UML); Feature (linguistics); Predictability; Artificial intelligence; A priori and a posteriori; Machine learning; Permutation (music); Pattern recognition (psychology); Statistics; Mathematics","score_opus":0.06995471329157738,"score_gpt":0.2908272228295843,"score_spread":0.2208725095380069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385958742","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.005856574,0.0009781761,0.99201196,0.00009800058,0.00008852178,0.000036552243,0.000105955,0.00050003035,0.0003241864],"genre_scores_gemma":[0.23926128,0.0019440532,0.7544783,0.00010077255,0.00042575705,0.00021327265,0.0006962384,0.0002740616,0.002606226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990121,0.00022435984,0.00008865099,0.00029126537,0.0003236234,0.000060095397],"domain_scores_gemma":[0.9955048,0.0030069724,0.00022935188,0.0004682608,0.00068613933,0.00010437725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028087504,0.0009960192,0.0015838185,0.0015857681,0.0003472435,0.0016917702,0.0014115861,0.0007647561,0.0019019318],"category_scores_gemma":[0.012192192,0.00051681435,0.00085024396,0.002541405,0.00048366137,0.002534354,0.0011041658,0.0026909795,0.00090076035],"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.00027897325,0.00022159009,0.002080506,0.00028324025,0.00013667923,0.000092528375,0.00017258771,0.09118825,0.01368497,0.023441866,0.007284346,0.8611346],"study_design_scores_gemma":[0.000004898469,0.000039922434,0.00055189774,0.00001471916,0.000017229115,0.00005333655,0.000017193515,0.98289365,0.0023042026,0.013044602,0.0010481522,0.000010280001],"about_ca_topic_score_codex":0.0014706664,"about_ca_topic_score_gemma":0.0011052719,"teacher_disagreement_score":0.0028087504,"about_ca_system_score_codex":0.000604833,"about_ca_system_score_gemma":0.0005879533,"threshold_uncertainty_score":0.014854252},"labels":[],"label_agreement":null},{"id":"W4385982296","doi":"10.1007/978-3-031-41682-8_7","title":"QuOTeS: Query-Oriented Technical Summarization","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Automatic summarization; Computer science; Information retrieval; Multi-document summarization; Usability; Upload; Query expansion; Query language; Web search query; World Wide Web; Search engine; Human–computer interaction","score_opus":0.02214431214374753,"score_gpt":0.25359150128722574,"score_spread":0.2314471891434782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385982296","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.0033039155,0.0019280503,0.90775895,0.0032945266,0.0013945973,0.00075346226,0.0077793263,0.0318636,0.041923538],"genre_scores_gemma":[0.058446832,0.0024801015,0.8015348,0.0013245284,0.0015591161,0.0007666762,0.033416122,0.010978721,0.08949311],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962734,0.0010700073,0.0004859251,0.0005001838,0.0014959377,0.00017452819],"domain_scores_gemma":[0.9930327,0.0025087257,0.0003192859,0.0013629433,0.0025891007,0.00018729421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029483205,0.0017752141,0.0011904286,0.004165807,0.0015329578,0.005038812,0.0025643276,0.0012579892,0.06925625],"category_scores_gemma":[0.013598035,0.0009043653,0.0014107098,0.004842704,0.0007549986,0.006184822,0.003808814,0.001824784,0.046686914],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002316735,0.0000933168,0.0003870217,0.0013684937,0.00008510507,0.0002936699,0.0014262038,0.0026311825,0.013329621,0.08097877,0.36300403,0.5361709],"study_design_scores_gemma":[0.00006671443,0.00009434397,0.00048277536,0.00033379984,0.00013777814,0.00041400295,0.0010338675,0.039066862,0.019258142,0.10670081,0.8323121,0.00009872399],"about_ca_topic_score_codex":0.0015120346,"about_ca_topic_score_gemma":0.0018655699,"teacher_disagreement_score":0.06925625,"about_ca_system_score_codex":0.0007963409,"about_ca_system_score_gemma":0.0013069871,"threshold_uncertainty_score":0.23168522},"labels":[],"label_agreement":null},{"id":"W4385992070","doi":"10.1007/978-3-031-41685-9_5","title":"Modeling Cross-layer Interaction for Chinese Calligraphy Style Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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":"Concordia University","funders":"","keywords":"Calligraphy; Computer science; Convolutional neural network; Image (mathematics); Artificial intelligence; Layer (electronics); Pattern recognition (psychology); Artificial neural network; Feature (linguistics); Scale (ratio)","score_opus":0.042676079196253214,"score_gpt":0.33497435149894855,"score_spread":0.29229827230269534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385992070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30153298,0.00047959102,0.67793435,0.0003982186,0.00020327624,0.00013823737,0.0017166768,0.00472464,0.012872],"genre_scores_gemma":[0.90285295,0.00011757903,0.08070536,0.00010411651,0.0000615974,0.00010502841,0.0017942655,0.0003725689,0.013886604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996252,0.00006439014,0.000013420498,0.00013679576,0.00006164322,0.0000985522],"domain_scores_gemma":[0.999127,0.0003883714,0.00006443112,0.00014322124,0.00019870652,0.000078355675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201899,0.0006505982,0.00052084035,0.0008701535,0.0005325251,0.001433231,0.0010573238,0.0006458594,0.0052245157],"category_scores_gemma":[0.0021667692,0.0002529759,0.0009382908,0.0008715857,0.00036095068,0.0012746467,0.00090305816,0.0012511029,0.0014443933],"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.00133176,0.0005156912,0.038786545,0.00016314739,0.00028805944,0.00043077415,0.0007398921,0.42047796,0.020435777,0.056133766,0.022055114,0.43864155],"study_design_scores_gemma":[0.000004123145,0.000012845917,0.001569389,0.0000036457905,0.000013361284,0.000013019845,0.000020065505,0.9935143,0.00064080703,0.003585727,0.0006172974,0.0000053707577],"about_ca_topic_score_codex":0.024820033,"about_ca_topic_score_gemma":0.028138086,"teacher_disagreement_score":0.024820033,"about_ca_system_score_codex":0.0009710824,"about_ca_system_score_gemma":0.000807574,"threshold_uncertainty_score":0.049351096},"labels":[],"label_agreement":null},{"id":"W4386004804","doi":"10.1007/978-3-031-41138-0","title":"Electronic Government","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Smart Cities and Technologies","field":"Engineering","cited_by":6,"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":"Université de Namur; Högskolan i Skövde; Ariel University; Universitetet i Agder; Tartu Ülikool; Univerzita Pardubice; University of the Aegean; Universität Zürich; Politechnika Gdańska; Göteborgs Universitet; Université de Lausanne; Universidad de Granada; Westfälische Wilhelms-Universität Münster; Universiteit Utrecht; KU Leuven; Universidad Politécnica de Madrid; Korea University; Technische Universiteit Delft; Linköpings Universitet; Universiteit Gent; University of Oxford; University of Macedonia; University at Albany; Mittuniversitetet; University of Rwanda; Donau-Universität Krems; Queen Mary University of London; Universidade Federal do Rio de Janeiro; Université Laval; State University of New York","keywords":"Computer science; Open government; Government (linguistics); Digital government; E-Government; Open data; World Wide Web; Digital transformation; Information and Communications Technology","score_opus":0.007157942394513638,"score_gpt":0.19504939052674217,"score_spread":0.18789144813222852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386004804","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038912075,0.00069531804,0.00040994334,0.0007349172,0.00023803879,0.00001083439,0.00022772512,0.0001492178,0.9971449],"genre_scores_gemma":[0.003548094,0.0005871185,0.00017862592,0.00018532222,0.000061407234,0.000007946514,0.00021330497,0.00004918635,0.99516886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997825,0.00002281489,0.000006617595,0.000040092236,0.00011321619,0.000034715442],"domain_scores_gemma":[0.9998005,0.000027974826,0.00000965381,0.000073192656,0.00006054272,0.000028181037],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022663978,0.00046348415,0.00035807103,0.0013633539,0.0015008907,0.0035144144,0.00041651257,0.0012390191,0.35946563],"category_scores_gemma":[0.00074799376,0.0002665,0.00024846094,0.0020736083,0.0007189268,0.002749334,0.0012646622,0.0012062197,0.21110782],"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.000024569566,0.000046519006,0.00022778039,0.00006037174,0.000003344756,0.00005496338,0.00014984002,0.00014873098,0.00037819092,0.1867273,0.609802,0.2023765],"study_design_scores_gemma":[0.000002204507,0.0000049881814,0.0002635696,0.000031076157,0.0000013406571,0.000035861067,0.000051408795,0.000050268318,0.00013325782,0.010415923,0.9890085,0.0000015723756],"about_ca_topic_score_codex":0.003509033,"about_ca_topic_score_gemma":0.008342241,"teacher_disagreement_score":0.35946563,"about_ca_system_score_codex":0.0012076418,"about_ca_system_score_gemma":0.0011384799,"threshold_uncertainty_score":0.91364455},"labels":[],"label_agreement":null},{"id":"W4386014738","doi":"10.1007/978-3-662-67868-8","title":"Transactions on Computational Science XL","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"3D Modeling in Geospatial Applications","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 Toronto; McGill University; Concordia University; University of Calgary","funders":"","keywords":"Computer science; Volume (thermodynamics); Object (grammar); Computational geometry; Artificial intelligence; Computer graphics (images); Theoretical computer science; Computational science","score_opus":0.014558231244954534,"score_gpt":0.2427303762897514,"score_spread":0.22817214504479685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014738","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051746597,0.058502812,0.36448222,0.019624373,0.03643199,0.0002966971,0.0069815316,0.0059330934,0.50257254],"genre_scores_gemma":[0.04587943,0.039158612,0.13384634,0.0027339456,0.00708832,0.00047659603,0.010209527,0.0031074975,0.75749964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861765,0.00029388643,0.00009788981,0.0002386069,0.0006721379,0.00007982062],"domain_scores_gemma":[0.9974891,0.00069965085,0.00006291468,0.0010394757,0.0005846482,0.00012413973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016529165,0.0013096761,0.001818994,0.0015670484,0.0007649124,0.0037366962,0.0013256636,0.0010915223,0.1816285],"category_scores_gemma":[0.005261908,0.0005676208,0.0010026911,0.003354958,0.0012155708,0.0026261841,0.0025638847,0.0024730111,0.080605105],"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.00007164553,0.00006285027,0.0004928963,0.0004483461,0.00005977412,0.000065379994,0.000062537685,0.0026938622,0.00073911675,0.07047921,0.51685524,0.40796912],"study_design_scores_gemma":[0.000037745704,0.000039472707,0.0008006888,0.00028440304,0.00003913454,0.00019931767,0.0000857805,0.016160991,0.0007091762,0.09635485,0.8852745,0.000013948182],"about_ca_topic_score_codex":0.0030129794,"about_ca_topic_score_gemma":0.0033810267,"teacher_disagreement_score":0.1816285,"about_ca_system_score_codex":0.0011686538,"about_ca_system_score_gemma":0.0016512257,"threshold_uncertainty_score":0.60760784},"labels":[],"label_agreement":null},{"id":"W4386014759","doi":"10.1007/978-3-662-67868-8_3","title":"AVCA: Autonomous Virtual Cognitive Assessment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurobiology of Language and Bilingualism","field":"Neuroscience","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Cognition; Natural language processing; Transformer; Cognitive architecture; Encoder; Machine learning","score_opus":0.03483601461778957,"score_gpt":0.30469258687482365,"score_spread":0.2698565722570341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014759","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.0063188137,0.00072689675,0.9163761,0.00027745432,0.00061830285,0.00021807692,0.00063891866,0.013532224,0.06129307],"genre_scores_gemma":[0.20043775,0.0012129496,0.6906453,0.00047179774,0.0002698525,0.00082293607,0.0019426898,0.0022680655,0.10192868],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959,0.00008323499,0.000018069437,0.00008741339,0.00018806712,0.00003322765],"domain_scores_gemma":[0.99949086,0.00018425184,0.000013661436,0.000093498325,0.00014504745,0.00007267518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051537866,0.00091116276,0.0005071718,0.00055902236,0.00031409372,0.0019249538,0.0019272254,0.0009215298,0.032567456],"category_scores_gemma":[0.0017940497,0.00034512847,0.00038912502,0.00035738898,0.00054921606,0.001454925,0.0023723636,0.00091120135,0.009164563],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029959832,0.00010888568,0.0004218616,0.00017216861,0.000032035452,0.00019822268,0.00018591913,0.010252103,0.017843382,0.029072976,0.05763935,0.88377357],"study_design_scores_gemma":[0.00011194616,0.0003268308,0.0025004023,0.00022483991,0.00005106904,0.0020923393,0.00021738968,0.28619677,0.033728804,0.15091631,0.5234757,0.00015756195],"about_ca_topic_score_codex":0.001434596,"about_ca_topic_score_gemma":0.0016042335,"teacher_disagreement_score":0.032567456,"about_ca_system_score_codex":0.0003529145,"about_ca_system_score_gemma":0.00071804516,"threshold_uncertainty_score":0.108949065},"labels":[],"label_agreement":null},{"id":"W4386014783","doi":"10.1007/978-3-662-67868-8_6","title":"An Autonomous Fake News Recognition System by Semantic Learning and Cognitive Computing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","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 Calgary","funders":"","keywords":"Computer science; Python (programming language); Artificial intelligence; Cognitive computing; Natural language processing; Natural language understanding; Parsing; Knowledge representation and reasoning; Semantics (computer science); Natural language; Cognition; Programming language","score_opus":0.018708692142443795,"score_gpt":0.25153899851177347,"score_spread":0.23283030636932966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014783","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.21574098,0.00093374494,0.7055114,0.0013408727,0.0010059736,0.00044162484,0.0008816259,0.05240553,0.021738222],"genre_scores_gemma":[0.74041593,0.00022488424,0.2391767,0.0006549322,0.0003017359,0.00014182665,0.000998699,0.00045826272,0.017626973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999539,0.000060337505,0.00003235837,0.00015028098,0.00015517877,0.00006288029],"domain_scores_gemma":[0.9990615,0.00028512225,0.00008267688,0.00020423713,0.0002773916,0.000089128924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061733444,0.00061978283,0.0010965138,0.001088304,0.00071265345,0.0018295732,0.0014028102,0.0012937562,0.004387922],"category_scores_gemma":[0.0016267186,0.00036671732,0.00046485424,0.0005740706,0.0004523648,0.0023806093,0.0010221156,0.0007945642,0.0030286915],"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.0018045418,0.0011585376,0.004172595,0.00022920828,0.00021660476,0.0009431473,0.00029185327,0.01031548,0.11422594,0.00876041,0.03466909,0.8232125],"study_design_scores_gemma":[0.00011638414,0.00038769233,0.0031848864,0.000025351454,0.00019755663,0.00087771897,0.00015569686,0.87475836,0.094042525,0.010997629,0.015158645,0.00009760522],"about_ca_topic_score_codex":0.0018418394,"about_ca_topic_score_gemma":0.001956488,"teacher_disagreement_score":0.004387922,"about_ca_system_score_codex":0.0005526775,"about_ca_system_score_gemma":0.0005308401,"threshold_uncertainty_score":0.014679015},"labels":[],"label_agreement":null},{"id":"W4386014811","doi":"10.1007/978-3-662-67868-8_4","title":"Light-Weight CNN-Attention Based Architecture Trained with a Hybrid Objective Function for EMG-Based Human Machine Interfaces","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Muscle activation and electromyography studies","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":"Calgary Laboratory Services; University of Calgary; Concordia University","funders":"","keywords":"Computer science; Convolutional neural network; Cross entropy; Gesture; Artificial intelligence; Wearable computer; Pattern recognition (psychology); Gesture recognition; Decoding methods; Deep neural networks; Cosine similarity; Artificial neural network; Architecture; Speech recognition; Algorithm; Embedded system","score_opus":0.010609552905578324,"score_gpt":0.21185271257879923,"score_spread":0.2012431596732209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014811","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.04876921,0.0044355323,0.92464584,0.0006595845,0.0010072826,0.00014871928,0.00063335936,0.0075933468,0.0121070845],"genre_scores_gemma":[0.68422633,0.0023312597,0.2505669,0.0011073033,0.00039105024,0.00024153743,0.002279446,0.0005444018,0.058311876],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998217,0.000013597396,0.0000079866995,0.000062198495,0.00004407914,0.00005048337],"domain_scores_gemma":[0.99982554,0.000032823853,0.000010964215,0.000023664013,0.00008855554,0.000018446679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000463243,0.0011722523,0.0006437798,0.0003794155,0.00029110655,0.0006774486,0.0016209933,0.0013427429,0.006622168],"category_scores_gemma":[0.0007163962,0.00042583628,0.00074253825,0.000512985,0.00025295466,0.00073333556,0.0007731318,0.001514012,0.0025685397],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024846583,0.00024309281,0.0010386336,0.00020813978,0.0002424205,0.00012310513,0.00004499347,0.123119034,0.057605352,0.0030959856,0.015542194,0.79848856],"study_design_scores_gemma":[0.000010038152,0.00010154964,0.0008843538,0.000027813934,0.00007173523,0.000060189985,0.000008487124,0.98014563,0.014464587,0.001347335,0.0028638928,0.000014419829],"about_ca_topic_score_codex":0.013938437,"about_ca_topic_score_gemma":0.024594154,"teacher_disagreement_score":0.013938437,"about_ca_system_score_codex":0.00086615264,"about_ca_system_score_gemma":0.00094531593,"threshold_uncertainty_score":0.02771461},"labels":[],"label_agreement":null},{"id":"W4386014829","doi":"10.1007/978-3-662-67868-8_2","title":"Stress Contagion Protocols for Human and Autonomous Robot Teams","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmarking; Computer science; Protocol (science); Process (computing); Robot; Stress (linguistics); Artificial intelligence; Human–computer interaction; Distributed computing; Programming language","score_opus":0.057252146862002064,"score_gpt":0.3333516711510579,"score_spread":0.2760995242890558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014829","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.11898466,0.001361607,0.85660416,0.001327698,0.0004012539,0.0003285011,0.0000967722,0.00037647807,0.020518852],"genre_scores_gemma":[0.94560546,0.00045000968,0.042907357,0.00013865484,0.00013055651,0.0003811536,0.00006964096,0.000048919814,0.01026837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879104,0.00050725834,0.00008685792,0.00016879682,0.00028845624,0.0001576315],"domain_scores_gemma":[0.99312264,0.0046293424,0.00045740983,0.0008186774,0.00058137556,0.00039047285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024783693,0.00075514935,0.0010234022,0.00052266626,0.001312734,0.0017511769,0.0015517015,0.0013579004,0.0046366625],"category_scores_gemma":[0.01019897,0.00036287174,0.00045390404,0.0005732846,0.0018821672,0.0028242103,0.0033251273,0.0016867387,0.0004377129],"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.0011669709,0.00021857889,0.00088950206,0.00023689232,0.000085846186,0.00028647535,0.0013819968,0.228179,0.006995288,0.6338619,0.007594009,0.119103506],"study_design_scores_gemma":[0.000064343054,0.00018678176,0.0003265635,0.000037123165,0.00003403489,0.0000712638,0.00020488528,0.66048694,0.0010941172,0.3348401,0.0026219734,0.00003195651],"about_ca_topic_score_codex":0.0014607621,"about_ca_topic_score_gemma":0.0014059693,"teacher_disagreement_score":0.0046366625,"about_ca_system_score_codex":0.0013366694,"about_ca_system_score_gemma":0.0010597925,"threshold_uncertainty_score":0.015511215},"labels":[],"label_agreement":null},{"id":"W4386014858","doi":"10.1007/978-3-662-67868-8_7","title":"Addressing Dataset Shift for Trustworthy Deep Learning Diagnostic Ultrasound Decision Support","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Vector Institute; McMaster University; St. Joseph’s Healthcare Hamilton","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Modality (human–computer interaction); Leverage (statistics); Cluster analysis; Medical imaging; Medical diagnosis; Software portability; Software deployment; Machine learning; Pattern recognition (psychology); Data mining","score_opus":0.029851445197041387,"score_gpt":0.3275378091721294,"score_spread":0.29768636397508796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014858","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.023111517,0.00080888736,0.9716916,0.0019264176,0.00022771477,0.000072162606,0.00030734972,0.000940604,0.00091374415],"genre_scores_gemma":[0.6974006,0.0006502394,0.29326418,0.0011260551,0.0006016992,0.00022992925,0.0016379515,0.00032416888,0.0047652517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709475,0.00075429777,0.0002224249,0.00070293364,0.00093247014,0.0002930968],"domain_scores_gemma":[0.9856338,0.009077222,0.0006918915,0.002243685,0.0020109627,0.00034241067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057879575,0.0012203378,0.0021328086,0.00082534563,0.0007366286,0.0018772957,0.0030723496,0.0034268068,0.0031563982],"category_scores_gemma":[0.023230502,0.00089622557,0.0009898961,0.0010068733,0.0015337958,0.0031516217,0.0058849086,0.004787802,0.001004994],"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.0012612062,0.00026609228,0.0033904153,0.00051226176,0.0002398603,0.00042709714,0.00035692484,0.333636,0.01493615,0.03375589,0.016757285,0.59446084],"study_design_scores_gemma":[0.000017746937,0.000065582906,0.00016219965,0.000023025477,0.000015554819,0.000042296615,0.000031502634,0.9720224,0.003120985,0.023477351,0.0010140167,0.000007303235],"about_ca_topic_score_codex":0.002729453,"about_ca_topic_score_gemma":0.0027644983,"teacher_disagreement_score":0.0057879575,"about_ca_system_score_codex":0.0015035155,"about_ca_system_score_gemma":0.0027507714,"threshold_uncertainty_score":0.030609965},"labels":[],"label_agreement":null},{"id":"W4386014861","doi":"10.1007/978-3-662-67868-8_1","title":"Challenges in Understanding Trust and Trust Modeling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Data science","score_opus":0.144329065122287,"score_gpt":0.31450105970925407,"score_spread":0.17017199458696708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014861","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019809503,0.022379365,0.79467815,0.09551123,0.0011513865,0.00007202593,0.0004704763,0.0002141636,0.0657137],"genre_scores_gemma":[0.7133868,0.03251975,0.22373489,0.004279167,0.0030310315,0.00035055162,0.0005569683,0.0001934522,0.02194739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974865,0.0015571661,0.00013261611,0.00023699935,0.00044805344,0.00013876516],"domain_scores_gemma":[0.9832773,0.014182551,0.00058365485,0.0008983471,0.0007385445,0.00031962348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006405447,0.0007323051,0.0014526658,0.0011554462,0.0013038235,0.0074671474,0.0022511757,0.003161681,0.00479582],"category_scores_gemma":[0.024418613,0.0008735953,0.0009273315,0.0024859891,0.0046064775,0.017141439,0.0020604304,0.007831339,0.00083311484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045175016,0.000017905342,0.0002249418,0.00006253727,0.000021533428,0.000040510247,0.00031064625,0.0072262455,0.000057747853,0.9716821,0.0037499974,0.01660133],"study_design_scores_gemma":[0.0000011338141,0.0000027906417,0.000059326674,0.000033037402,0.0000043314153,0.00002036284,0.00012959237,0.019324597,0.000022455506,0.97677636,0.0036204178,0.000005546499],"about_ca_topic_score_codex":0.0076278704,"about_ca_topic_score_gemma":0.006448998,"teacher_disagreement_score":0.0076278704,"about_ca_system_score_codex":0.003122219,"about_ca_system_score_gemma":0.0021769674,"threshold_uncertainty_score":0.033875644},"labels":[],"label_agreement":null},{"id":"W4386014867","doi":"10.1007/978-3-662-67868-8_5","title":"Fairness, Bias and Trust in the Context of Biometric-Enabled Autonomous Decision Support","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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 Calgary","funders":"","keywords":"Biometrics; Computer science; Context (archaeology); Identification (biology); Artificial intelligence; Facial recognition system; Machine learning; Convolutional neural network; Pattern recognition (psychology)","score_opus":0.03550521650450279,"score_gpt":0.26263333377560355,"score_spread":0.22712811727110077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386014867","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3640987,0.0058475165,0.44498315,0.028240023,0.0007445593,0.00019049176,0.00026699275,0.00013267876,0.15549594],"genre_scores_gemma":[0.9907795,0.00031557726,0.0068018064,0.00016786928,0.000109519395,0.00003802392,0.000015682295,0.0000119426195,0.0017601982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9805166,0.013097376,0.0007549006,0.0015386548,0.0025009143,0.0015915277],"domain_scores_gemma":[0.93717086,0.047451533,0.0059344177,0.0050124973,0.0026215299,0.0018091912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019175904,0.0005612661,0.0013046724,0.0007929349,0.0022298566,0.008305518,0.0016857337,0.0037575853,0.0037028173],"category_scores_gemma":[0.06343761,0.0005509284,0.00073954515,0.0011438695,0.009416223,0.008696384,0.004948068,0.003942541,0.00033790708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038943486,0.00010064771,0.0044337185,0.0001095796,0.00010706416,0.00031158296,0.002649089,0.020274464,0.0005102833,0.94745666,0.0011800394,0.02247732],"study_design_scores_gemma":[0.000025311383,0.000051425577,0.0011127105,0.000040601604,0.000021527308,0.00007521146,0.0006351168,0.025590379,0.00020611154,0.97040504,0.0018061736,0.00003038183],"about_ca_topic_score_codex":0.004780918,"about_ca_topic_score_gemma":0.0032266637,"teacher_disagreement_score":0.019175904,"about_ca_system_score_codex":0.0042071734,"about_ca_system_score_gemma":0.0034864314,"threshold_uncertainty_score":0.10141307},"labels":[],"label_agreement":null},{"id":"W4386021122","doi":"10.1007/978-3-031-42141-9_6","title":"Fairness in Socio-Technical Systems: A Case Study of Wikipedia","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Harm; Normative; Context (archaeology); Sociotechnical system; Data science; Artificial intelligence; Epistemology; Social psychology; Psychology","score_opus":0.0356786992312622,"score_gpt":0.3369474742957146,"score_spread":0.3012687750644524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386021122","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.9261055,0.0004554935,0.013484504,0.002511642,0.00006847806,0.000156654,0.0000619583,0.00006485908,0.057090927],"genre_scores_gemma":[0.99400526,0.000078553494,0.0025376696,0.00007017223,0.000013935444,0.00003989243,0.000020745245,0.000024168909,0.0032095127],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9887673,0.0086340485,0.00023368599,0.00049459416,0.001067732,0.00080249243],"domain_scores_gemma":[0.94063103,0.050056744,0.0018983415,0.0022955996,0.0025098436,0.0026083884],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.014403535,0.00032555405,0.0005061262,0.0016446766,0.010633677,0.007322113,0.0021814196,0.0032830408,0.0032751192],"category_scores_gemma":[0.035533953,0.00026831625,0.00036209455,0.0021437204,0.006301321,0.006831175,0.004871519,0.0016746585,0.00032748654],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078244583,0.0019876675,0.07580276,0.00059456576,0.00012734764,0.011333374,0.40676758,0.011647069,0.0026088294,0.3710355,0.0104258675,0.10688718],"study_design_scores_gemma":[0.00024041628,0.00077656633,0.050798297,0.0005320908,0.00012811969,0.0035115078,0.5138181,0.049049642,0.004866151,0.24277256,0.13332564,0.0001809777],"about_ca_topic_score_codex":0.01426716,"about_ca_topic_score_gemma":0.016238118,"teacher_disagreement_score":0.9893663,"about_ca_system_score_codex":0.004057323,"about_ca_system_score_gemma":0.0037743195,"threshold_uncertainty_score":0.07617408},"labels":[],"label_agreement":null},{"id":"W4386093749","doi":"10.1007/978-3-031-41724-5_13","title":"Solving Parametric Linear Systems Using Sparse Rational Function Interpolation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Kronecker delta; Rational function; Interpolation (computer graphics); Gaussian elimination; Computer science; Rank (graph theory); Algorithm; Parametric statistics; Function (biology); Integer (computer science); Matrix (chemical analysis); Applied mathematics; Gaussian; Algebra over a field; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Artificial intelligence","score_opus":0.03922910040964225,"score_gpt":0.25706807340348864,"score_spread":0.21783897299384639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093749","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.009280229,0.0001215692,0.98270506,0.00007119101,0.00003775237,0.000020817544,0.000041519328,0.00044227813,0.0072795767],"genre_scores_gemma":[0.34722254,0.00038879225,0.64077455,0.00007546208,0.00008605852,0.00010540834,0.00026421223,0.00033340615,0.0107495375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970573,0.0000793039,0.000011822824,0.000038217207,0.00013309458,0.000031751173],"domain_scores_gemma":[0.99957985,0.00025627334,0.000023404413,0.000077532306,0.00005116281,0.000011829071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539744,0.00068318984,0.0008991684,0.00041263565,0.0003427911,0.00079590885,0.00081655366,0.0006545347,0.006956594],"category_scores_gemma":[0.0019020017,0.0004900348,0.0006020078,0.00077019085,0.00065905845,0.0011836793,0.0013276429,0.0015742006,0.0014328879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011939237,0.00007139382,0.0004436553,0.000330014,0.00005350119,0.00012045472,0.00023794422,0.51135105,0.011875122,0.1565745,0.0054787067,0.3133442],"study_design_scores_gemma":[0.000014300554,0.000035213947,0.000047351576,0.000012001092,0.000006428072,0.000051653402,0.00005256594,0.9630656,0.0022188337,0.030743966,0.0037431398,0.000008888261],"about_ca_topic_score_codex":0.001025846,"about_ca_topic_score_gemma":0.0021126934,"teacher_disagreement_score":0.006956594,"about_ca_system_score_codex":0.00027595813,"about_ca_system_score_gemma":0.00042233412,"threshold_uncertainty_score":0.023272157},"labels":[],"label_agreement":null},{"id":"W4386093775","doi":"10.1007/978-3-031-41724-5_11","title":"Non-principal Branches of Lambert W. A Tale of 2 Circles","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Dynamics and Biomechanics","field":"Engineering","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":"Domain (mathematical analysis); Convergence (economics); Lambert W function; Function (biology); Asymptotic expansion; Principal (computer security); Mathematics; Series (stratigraphy); Mathematical analysis; Range (aeronautics); Computer science","score_opus":0.009536441439214094,"score_gpt":0.20836041702442296,"score_spread":0.19882397558520887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093775","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023274198,0.034153298,0.09125901,0.02877961,0.0048380843,0.000045218272,0.00017022774,0.00030249258,0.81717783],"genre_scores_gemma":[0.47658652,0.01473804,0.050343297,0.0052252808,0.004075262,0.000093079296,0.00020910133,0.00060974737,0.44811976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999668,0.00008931512,0.000010619707,0.00008907711,0.00009211496,0.000050932606],"domain_scores_gemma":[0.9993967,0.00027250382,0.00003495984,0.00007724815,0.00015123573,0.0000674973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052044285,0.00042531456,0.00038596534,0.0010572814,0.0019066083,0.0021496948,0.0004790942,0.0016206994,0.01282591],"category_scores_gemma":[0.0028868127,0.00040898632,0.00035959878,0.0009176876,0.0026272922,0.0050685974,0.0012849988,0.0025638787,0.004912074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031056687,0.0000041848543,0.000051477266,0.00001829737,0.0000028328188,0.00006106813,0.00030165847,0.00022800491,0.00021355727,0.9445132,0.031170405,0.02340431],"study_design_scores_gemma":[0.0000061563587,0.000008583707,0.000071080336,0.000028751445,0.0000026833143,0.00015684281,0.00010021736,0.0006084644,0.00020416519,0.846249,0.15255697,0.0000070994606],"about_ca_topic_score_codex":0.001063405,"about_ca_topic_score_gemma":0.0010376065,"teacher_disagreement_score":0.01282591,"about_ca_system_score_codex":0.0009703786,"about_ca_system_score_gemma":0.00044851992,"threshold_uncertainty_score":0.04290694},"labels":[],"label_agreement":null},{"id":"W4386093787","doi":"10.1007/978-3-031-41724-5_20","title":"Efficient Quotients of Non-commutative Polynomials","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Mathematics; Polynomial; Commutative property; Variable (mathematics); Polynomial ring; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01665563499840427,"score_gpt":0.25544604547043165,"score_spread":0.23879041047202737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093787","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.34164867,0.0047211447,0.35858226,0.0011883709,0.00088753365,0.00011493631,0.0003218884,0.0007375727,0.29179758],"genre_scores_gemma":[0.9031434,0.001156408,0.029251875,0.00010445717,0.0003009731,0.000048426165,0.0002238296,0.0002880164,0.065482594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.00016703694,0.000037973987,0.00010845962,0.00032809208,0.00013185287],"domain_scores_gemma":[0.9991227,0.00042869127,0.00005616876,0.00017384804,0.000118636395,0.00009993111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078966503,0.00059570704,0.0006905681,0.000768043,0.0008160811,0.00235207,0.0008159547,0.00035866429,0.010252549],"category_scores_gemma":[0.0025643762,0.00040828923,0.0005981056,0.0007205108,0.0021354458,0.004631582,0.0020834,0.0015536427,0.0012879297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432646,0.000016547154,0.000076422686,0.000036334735,0.0000046229957,0.000038300568,0.00017391094,0.0007916404,0.001941506,0.98591334,0.0009222065,0.010040813],"study_design_scores_gemma":[0.000022699354,0.000030078583,0.00014901294,0.000012595356,0.00000786405,0.000095520285,0.000063382155,0.004205868,0.0035194552,0.9790756,0.012809594,0.000008341997],"about_ca_topic_score_codex":0.00039441822,"about_ca_topic_score_gemma":0.0006723403,"teacher_disagreement_score":0.010252549,"about_ca_system_score_codex":0.0010735865,"about_ca_system_score_gemma":0.00037527666,"threshold_uncertainty_score":0.034298122},"labels":[],"label_agreement":null},{"id":"W4386093834","doi":"10.1007/978-3-031-41724-5","title":"Computer Algebra in Scientific Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","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":"Wilfrid Laurier University","funders":"Universität Kassel; Gebze Teknik Üniversitesi; China Aerospace Science and Technology Corporation; Universidad de Buenos Aires; Universidad de La Habana; Isfahan University of Technology; King Abdullah University of Science and Technology; Jiangsu University; Université de Lille; University of Stirling; Wilfrid Laurier University","keywords":"Symbolic computation; Computer science; Algebra over a field; Focus (optics); Computation; Theoretical computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.021234845241806508,"score_gpt":0.2602723338933104,"score_spread":0.23903748865150387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093834","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018311738,0.07894617,0.11386408,0.0071847825,0.0059044636,0.000082430124,0.0003046184,0.0007830891,0.7910992],"genre_scores_gemma":[0.07457176,0.070678696,0.07745312,0.0034326478,0.01052649,0.00036917746,0.0007841696,0.00076071767,0.7614233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996051,0.00011527391,0.000016584972,0.000055913886,0.00018432387,0.000022773585],"domain_scores_gemma":[0.9995449,0.00022293619,0.000021295096,0.000102386904,0.000073219315,0.000035215173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235825,0.00079037645,0.0010483384,0.0015833051,0.0010502597,0.0035279316,0.0007086155,0.00070219114,0.03320654],"category_scores_gemma":[0.0012946819,0.0004792561,0.0004977588,0.0028348863,0.0026278046,0.004332304,0.0012450017,0.0030431356,0.015729534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004925849,0.000011954807,0.000032995093,0.00014336134,0.000007791994,0.000014116275,0.00009245067,0.00058344007,0.00024327746,0.88403356,0.06954246,0.045289613],"study_design_scores_gemma":[0.000004166889,0.00000543945,0.00008129609,0.00005622603,0.000004080605,0.00005170018,0.000027990878,0.0013662529,0.00012897814,0.72762114,0.27064776,0.000004885918],"about_ca_topic_score_codex":0.00078241405,"about_ca_topic_score_gemma":0.00105874,"teacher_disagreement_score":0.03320654,"about_ca_system_score_codex":0.0013906778,"about_ca_system_score_gemma":0.0010749825,"threshold_uncertainty_score":0.111086965},"labels":[],"label_agreement":null},{"id":"W4386106337","doi":"10.1007/978-3-031-41724-5_1","title":"Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Monic polynomial; Euclidean algorithm; Mathematics; Algebraic number; Combinatorics; Separable space; Order (exchange); Discrete mathematics; Algebra over a field; Polynomial; Pure mathematics","score_opus":0.018340927989460153,"score_gpt":0.26145603365378994,"score_spread":0.24311510566432978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386106337","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.77415663,0.0015018546,0.19560222,0.00082256866,0.00048076466,0.00013954591,0.0012965349,0.0029621131,0.023037752],"genre_scores_gemma":[0.8808335,0.000473013,0.10818443,0.000080663165,0.0002575949,0.00004005795,0.0015595583,0.00031675483,0.008254424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866235,0.00018524351,0.00011608295,0.00036389954,0.00039396732,0.0002784975],"domain_scores_gemma":[0.99596596,0.0018666943,0.0005420312,0.00060705363,0.00060364546,0.00041465106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013665173,0.0010372215,0.001329978,0.0018252487,0.0010086548,0.0033419267,0.0010564564,0.0005721702,0.010019547],"category_scores_gemma":[0.009527051,0.0005331582,0.000924734,0.0026840025,0.0011506797,0.0065884357,0.0026442886,0.0012515271,0.0021162522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003752707,0.00056355546,0.043561265,0.001106265,0.00024965516,0.0019916275,0.0015284637,0.043730907,0.035492666,0.20884687,0.02643179,0.63274425],"study_design_scores_gemma":[0.00040033748,0.0010725455,0.012558817,0.00042402017,0.0002938346,0.0032282777,0.0027840282,0.22634317,0.045100585,0.66423005,0.04336798,0.00019635711],"about_ca_topic_score_codex":0.00066911866,"about_ca_topic_score_gemma":0.001639685,"teacher_disagreement_score":0.010019547,"about_ca_system_score_codex":0.0010890175,"about_ca_system_score_gemma":0.0011477679,"threshold_uncertainty_score":0.03351873},"labels":[],"label_agreement":null},{"id":"W4386106544","doi":"10.1007/978-3-031-42795-4_6","title":"GNN-DES: A New End-to-End Dynamic Ensemble Selection Method Based on Multi-label Graph Neural Network","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; ENCODE; Artificial intelligence; Artificial neural network; Graph; Pattern recognition (psychology); Machine learning; Context (archaeology); Selection (genetic algorithm); Data mining; Theoretical computer science","score_opus":0.04133797308664411,"score_gpt":0.30452895542362235,"score_spread":0.26319098233697824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386106544","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.011558868,0.0005451391,0.9749537,0.00015131803,0.00028823267,0.00013572704,0.0006175986,0.009665356,0.0020840436],"genre_scores_gemma":[0.104401335,0.00038444335,0.8698242,0.00047825632,0.00020398908,0.00029933796,0.0052791364,0.0012334869,0.017895808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.00019703741,0.000035156463,0.00034235968,0.0003495229,0.00009488254],"domain_scores_gemma":[0.99934417,0.00016972928,0.000027002403,0.00013056333,0.00028733016,0.000041154355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424034,0.0020550692,0.0020932346,0.0016754773,0.0012848648,0.0010141496,0.0024675427,0.0015410644,0.004989108],"category_scores_gemma":[0.0016324111,0.00063075783,0.0011584244,0.0015799926,0.00038920052,0.00172456,0.0017034165,0.0022141973,0.0034759042],"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.00030974502,0.00033147342,0.0011659806,0.00007858582,0.0003211317,0.00012205808,0.000060972758,0.088790365,0.013002603,0.0025807791,0.029162882,0.86407334],"study_design_scores_gemma":[0.000021167347,0.00004851714,0.00035157902,0.000007211924,0.000039386377,0.000051164374,0.00001672196,0.9871104,0.0049075657,0.0027552089,0.0046725473,0.000018557654],"about_ca_topic_score_codex":0.010261752,"about_ca_topic_score_gemma":0.029044973,"teacher_disagreement_score":0.010261752,"about_ca_system_score_codex":0.0007045718,"about_ca_system_score_gemma":0.0010782614,"threshold_uncertainty_score":0.02040404},"labels":[],"label_agreement":null},{"id":"W4386107019","doi":"10.1007/978-3-031-41724-5_4","title":"A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Solver; Polynomial; Modular design; Computer science; Hypersurface; Component (thermodynamics); Intersection (aeronautics); Speedup; Computation; Dimension (graph theory); Algorithm; Theoretical computer science; Parallel computing; Mathematics; Combinatorics; Pure mathematics","score_opus":0.021373869070245927,"score_gpt":0.24182094808107402,"score_spread":0.22044707901082808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386107019","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.047740128,0.00023703376,0.9360427,0.000207922,0.00014527592,0.00015437324,0.00025288312,0.00407653,0.011143159],"genre_scores_gemma":[0.19393164,0.00018885742,0.7941537,0.0000998001,0.00013830683,0.00019918957,0.0014087035,0.00080633163,0.009073511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920815,0.000078265395,0.000063937114,0.00022407903,0.0002806282,0.00014488299],"domain_scores_gemma":[0.9989116,0.00039574516,0.000082148385,0.0002889801,0.00022294391,0.0000986169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039251,0.0016626146,0.0013763196,0.0021563445,0.0012277107,0.003154231,0.0030030124,0.001056008,0.01738894],"category_scores_gemma":[0.0028391667,0.0007341358,0.0017363789,0.0022500043,0.0013475887,0.0048648636,0.0045863274,0.0017877998,0.005665899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071608985,0.00027113946,0.003083398,0.00042843723,0.00013690216,0.0002853052,0.00046605832,0.016525917,0.026102144,0.19837187,0.014906867,0.73870593],"study_design_scores_gemma":[0.0004090887,0.00058753806,0.0024810806,0.0001304171,0.00027535646,0.00089834916,0.00061255513,0.41958207,0.040157333,0.5078562,0.02688495,0.00012504135],"about_ca_topic_score_codex":0.0013312566,"about_ca_topic_score_gemma":0.0022837317,"teacher_disagreement_score":0.01738894,"about_ca_system_score_codex":0.0013442617,"about_ca_system_score_gemma":0.0014076098,"threshold_uncertainty_score":0.05817181},"labels":[],"label_agreement":null},{"id":"W4386128650","doi":"10.1007/978-3-031-42286-7_12","title":"“A Solution to a Problem that Didn’t Exist?”: Exploring Attitudes Towards Smart Streetlight Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Light on Environment and Health","field":"Environmental 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":"Context (archaeology); Computer science; Data collection; Internet privacy; Focus (optics); Smart city; Computer security; Data science; Internet of Things; Sociology; Geography","score_opus":0.07538667975175511,"score_gpt":0.27113036931142864,"score_spread":0.19574368955967353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386128650","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.6480229,0.006393313,0.00723183,0.12503493,0.0019100681,0.00012516818,0.00014103105,0.00008361625,0.21105708],"genre_scores_gemma":[0.8910565,0.004197487,0.0063619283,0.021538604,0.00014260523,0.00011751146,0.00013718987,0.00009493833,0.07635331],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99904615,0.0005396538,0.000021497935,0.000060107475,0.00019434562,0.00013814947],"domain_scores_gemma":[0.998971,0.00045779243,0.00013681059,0.000027303648,0.00017955153,0.00022748517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019643286,0.00025722166,0.00015032296,0.00033928495,0.0025375711,0.0042598303,0.0008633923,0.002495359,0.007116157],"category_scores_gemma":[0.003585907,0.00024124267,0.00033973748,0.00056019606,0.0025152327,0.006337642,0.0019863208,0.0041537676,0.001248833],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005763982,0.00047079954,0.034971267,0.00040082526,0.000045557386,0.0005438468,0.5679862,0.00030293525,0.0018696287,0.0707821,0.119934596,0.20263462],"study_design_scores_gemma":[0.000011442225,0.00010490774,0.023941908,0.00048865855,0.000018722338,0.0004531882,0.7751674,0.00040702036,0.0008093397,0.009758079,0.18879554,0.00004384158],"about_ca_topic_score_codex":0.006470358,"about_ca_topic_score_gemma":0.013885831,"teacher_disagreement_score":0.007116157,"about_ca_system_score_codex":0.0013727008,"about_ca_system_score_gemma":0.0021994978,"threshold_uncertainty_score":0.023805976},"labels":[],"label_agreement":null},{"id":"W4386128653","doi":"10.1007/978-3-031-42280-5_5","title":"Mapping Virtual Reality Controls to Inform Design of Accessible User Experiences","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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 Prince Edward Island","funders":"","keywords":"Virtual reality; Computer science; Software walkthrough; Human–computer interaction; Embodied cognition; Set (abstract data type); Domain (mathematical analysis); Space (punctuation); Mixed reality; Software; Artificial intelligence; Software development","score_opus":0.0712604227276786,"score_gpt":0.31492617555478464,"score_spread":0.24366575282710604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386128653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027661227,0.0005101438,0.93283385,0.00018892053,0.00008521603,0.00012872626,0.00007023752,0.0013503248,0.0371713],"genre_scores_gemma":[0.69247776,0.0007342056,0.28548083,0.00006746744,0.00002017921,0.00023428876,0.00016026289,0.00046807702,0.020356981],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99912935,0.0003739329,0.000041488034,0.000120896475,0.00027391326,0.000060450053],"domain_scores_gemma":[0.99892396,0.0006173351,0.000057740428,0.00022342814,0.00013892497,0.000038567956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008611181,0.00078053144,0.00028395778,0.00064744457,0.00034315832,0.0031226792,0.0010670521,0.00068882894,0.015385222],"category_scores_gemma":[0.0040338263,0.00054883095,0.0003725338,0.00028164955,0.0010284147,0.0026828886,0.0018874615,0.0006981156,0.0015779246],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042384455,0.00018945786,0.0014386916,0.0008974843,0.000052527448,0.0004885472,0.010342372,0.09643588,0.09884457,0.30617967,0.00617429,0.4785326],"study_design_scores_gemma":[0.00014515776,0.0008700084,0.0039149635,0.0008570775,0.00016434227,0.0008229509,0.005615893,0.43108943,0.12630157,0.21341778,0.21659592,0.00020486352],"about_ca_topic_score_codex":0.000981717,"about_ca_topic_score_gemma":0.0008930486,"teacher_disagreement_score":0.015385222,"about_ca_system_score_codex":0.00043791512,"about_ca_system_score_gemma":0.0004179402,"threshold_uncertainty_score":0.05146867},"labels":[],"label_agreement":null},{"id":"W4386155733","doi":"10.1007/978-3-031-39344-0_18","title":"Constrained Graph Searching on Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Path graph; Computer science; Distance; Wheel graph; Graph; Time complexity; Mathematics; Discrete mathematics; Graph power; Line graph","score_opus":0.03391685590947484,"score_gpt":0.2761777690574971,"score_spread":0.24226091314802223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386155733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018830413,0.004391434,0.8635879,0.0008910362,0.0002760536,0.00011702551,0.00062526297,0.0010857051,0.11019515],"genre_scores_gemma":[0.22003244,0.0048113856,0.6854718,0.0005407651,0.00023307934,0.00030686505,0.0017930487,0.0013085162,0.085502096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997094,0.00007895374,0.000009900992,0.00006452896,0.00010560101,0.000031619787],"domain_scores_gemma":[0.99940836,0.00037677615,0.000030081024,0.00010112341,0.00005124617,0.000032448883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022927027,0.0006729449,0.0010137768,0.0010128582,0.0004969716,0.0010173726,0.0013325905,0.0010039131,0.019446388],"category_scores_gemma":[0.0024239628,0.0005646771,0.0005091769,0.0031002155,0.0007247715,0.0021276828,0.0014356675,0.0014741984,0.0028302774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014251054,0.00010481715,0.0002130478,0.0005422625,0.00004733264,0.00010621425,0.000121647674,0.24821065,0.0050528618,0.32044953,0.053504717,0.37150443],"study_design_scores_gemma":[0.000036434405,0.00005316039,0.00022957876,0.000112812515,0.000016693506,0.00013953289,0.0000580852,0.5056088,0.0022123891,0.4512865,0.040224142,0.000021812424],"about_ca_topic_score_codex":0.002522235,"about_ca_topic_score_gemma":0.0033229063,"teacher_disagreement_score":0.019446388,"about_ca_system_score_codex":0.0007461748,"about_ca_system_score_gemma":0.0005896706,"threshold_uncertainty_score":0.065054715},"labels":[],"label_agreement":null},{"id":"W4386163748","doi":"10.1007/978-3-031-42293-5_91","title":"Re-contextualizing Built Environments: Critical and Inclusive HCI Approaches for Cultural Heritage","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Viewpoints; Contextualization; Cultural heritage; Computer science; Perspective (graphical); Narrative; Relevance (law); Human–computer interaction; Visual arts; Linguistics; Artificial intelligence; History; Political science; Art","score_opus":0.0691701781993801,"score_gpt":0.27468789932135385,"score_spread":0.20551772112197375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386163748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07178185,0.01937731,0.57274914,0.02155512,0.0012959228,0.00036325594,0.00026257435,0.0021910253,0.3104238],"genre_scores_gemma":[0.7001104,0.013176027,0.23207073,0.0034648685,0.00032266832,0.0005609448,0.00035303758,0.00092560396,0.049015656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99657935,0.0021295014,0.00010290812,0.0003445562,0.00056982756,0.0002739225],"domain_scores_gemma":[0.99538225,0.00331483,0.00011887015,0.00068388024,0.00028171588,0.00021842934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004555891,0.001269417,0.00077737,0.0018224221,0.0029518397,0.017647315,0.0026902067,0.0035718323,0.009928161],"category_scores_gemma":[0.0068908585,0.00070656784,0.0006680233,0.0019107187,0.014166059,0.017367817,0.011705718,0.004104162,0.0014062605],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009088953,0.00012978105,0.0011408454,0.0017967806,0.000049660877,0.00068768783,0.34848312,0.0013401861,0.007569434,0.3833904,0.018449008,0.23687218],"study_design_scores_gemma":[0.000027945203,0.000082953266,0.0012748403,0.0016875584,0.00008882467,0.001047152,0.20607331,0.0031555954,0.0037347062,0.31449163,0.4682491,0.00008625322],"about_ca_topic_score_codex":0.0030960536,"about_ca_topic_score_gemma":0.006963595,"teacher_disagreement_score":0.017647315,"about_ca_system_score_codex":0.0017328942,"about_ca_system_score_gemma":0.002437463,"threshold_uncertainty_score":0.03321302},"labels":[],"label_agreement":null},{"id":"W4386163808","doi":"10.1007/978-3-031-42293-5_65","title":"Lessons Learned from Designing and Implementing Interaction Mechanics for Viewer Participation in Game Streaming","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Ontario Tech University","funders":"","keywords":"Computer science; Entertainment; Multimedia; Game mechanics; Live streaming; Human–computer interaction; Outcome (game theory); Broadcasting (networking); Visual arts; Computer security; Art","score_opus":0.10841015512630729,"score_gpt":0.37984851381256757,"score_spread":0.27143835868626026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386163808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08254179,0.000561144,0.8691912,0.0020187243,0.000114379465,0.0006477326,0.00007634044,0.0014260042,0.04342266],"genre_scores_gemma":[0.32763752,0.0008015386,0.64622045,0.0002894303,0.000037874586,0.00044349252,0.0001277106,0.0007528056,0.023689166],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.997361,0.0013708678,0.00012664411,0.0003113997,0.0005868214,0.00024328833],"domain_scores_gemma":[0.99446976,0.0038549972,0.00010649481,0.000480056,0.000853688,0.00023505882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036562732,0.0012325018,0.00041684048,0.000553397,0.0012464973,0.003928277,0.0023861444,0.0013567384,0.0071146754],"category_scores_gemma":[0.010432909,0.0006480396,0.00048491426,0.0003831588,0.0018019619,0.004582511,0.0016124124,0.001962006,0.0012405579],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002336655,0.0016420333,0.0064528836,0.0015327147,0.000063333915,0.0009307366,0.035373263,0.02249619,0.042371545,0.120250925,0.008826799,0.759826],"study_design_scores_gemma":[0.00023754331,0.0022542253,0.010327104,0.0020805313,0.0003493922,0.0030767121,0.036042493,0.2750185,0.15380225,0.19417876,0.32229868,0.0003338432],"about_ca_topic_score_codex":0.004393052,"about_ca_topic_score_gemma":0.006315792,"teacher_disagreement_score":0.0071146754,"about_ca_system_score_codex":0.0010934231,"about_ca_system_score_gemma":0.0014852236,"threshold_uncertainty_score":0.02380097},"labels":[],"label_agreement":null},{"id":"W4386177494","doi":"10.1007/978-3-031-42293-5_21","title":"Whose Responsibility is Accessibility in Games Anyway? Everyone","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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 Prince Edward Island","funders":"","keywords":"Studio; Computer science; Video game development; Game Developer; Video game; Core (optical fiber); Component (thermodynamics); Multimedia; Game design; Human–computer interaction; Telecommunications","score_opus":0.04054884515482712,"score_gpt":0.3301871135403077,"score_spread":0.28963826838548057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386177494","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02418553,0.007024168,0.015284486,0.073942356,0.0052162856,0.000027036247,0.000049885963,0.0001949614,0.8740753],"genre_scores_gemma":[0.6753142,0.0051864414,0.002553718,0.012662388,0.000843414,0.000055836896,0.00004394683,0.00020782558,0.30313212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982755,0.000671318,0.000062321946,0.00022289503,0.00039805655,0.00036982878],"domain_scores_gemma":[0.9985189,0.0003615645,0.00008852276,0.00015582405,0.00035141304,0.0005237565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017952133,0.00056310906,0.0005260156,0.00052095955,0.0041794786,0.0056877434,0.00080536655,0.001965461,0.010948547],"category_scores_gemma":[0.003342351,0.00035527092,0.00043681837,0.0003916251,0.007141815,0.009844793,0.0044532246,0.004903837,0.0024415802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023992801,0.0000769283,0.0017276753,0.00011610744,0.000040153333,0.0002755053,0.041711908,0.00032774275,0.00067149557,0.7647174,0.09373073,0.096580364],"study_design_scores_gemma":[0.00001081273,0.000050735674,0.0018813772,0.0004419487,0.00005378974,0.0005870857,0.029105373,0.00022231278,0.0006390374,0.3695864,0.59737873,0.000042406566],"about_ca_topic_score_codex":0.005775532,"about_ca_topic_score_gemma":0.008199407,"teacher_disagreement_score":0.010948547,"about_ca_system_score_codex":0.001699782,"about_ca_system_score_gemma":0.002364696,"threshold_uncertainty_score":0.036626518},"labels":[],"label_agreement":null},{"id":"W4386206471","doi":"10.1007/978-3-031-38938-2_6","title":"Alternative Methods for Retaining Explicit and Finding Implicit Sharing in Embedded DSLs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Memory footprint; Domain (mathematical analysis); Theoretical computer science; Interface (matter); Hash function; Programming language; Parallel computing","score_opus":0.09291485620620997,"score_gpt":0.3912667999303437,"score_spread":0.2983519437241337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386206471","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.005570732,0.00008522797,0.99206585,0.000053671618,0.0000394029,0.00002831969,0.00002210134,0.00041069128,0.0017240092],"genre_scores_gemma":[0.22280103,0.0002385895,0.76720935,0.00007353144,0.000040860185,0.00014049876,0.00010167515,0.0005423769,0.008852063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997623,0.0006328617,0.0002260475,0.00037322444,0.0009808068,0.00016400481],"domain_scores_gemma":[0.992281,0.0041242214,0.00035663188,0.0023882173,0.0006855581,0.00016427046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028789202,0.00082277786,0.0009483682,0.0010465432,0.0007409059,0.002390806,0.002451627,0.0015203492,0.005841223],"category_scores_gemma":[0.009561639,0.00087318046,0.0013224417,0.0011252637,0.0029388755,0.0058032777,0.003978094,0.002647942,0.0010447656],"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.00024161415,0.0000926476,0.0005870953,0.0003925407,0.000077985416,0.00023857584,0.0010765488,0.064937204,0.014548528,0.7050693,0.0015790941,0.21115892],"study_design_scores_gemma":[0.000083838226,0.00010498035,0.00015888171,0.00013775541,0.0001002082,0.00029567792,0.00024723305,0.518451,0.024306009,0.43377006,0.022266367,0.000078060984],"about_ca_topic_score_codex":0.00067353,"about_ca_topic_score_gemma":0.0014451005,"teacher_disagreement_score":0.005841223,"about_ca_system_score_codex":0.00088305096,"about_ca_system_score_gemma":0.0010146328,"threshold_uncertainty_score":0.019540846},"labels":[],"label_agreement":null},{"id":"W4386229959","doi":"10.1007/978-3-031-39784-4_15","title":"Towards an Induction Principle for Nested Data Types","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Dalhousie University","funders":"","keywords":"Computer science; Data type; Type (biology); Programming language; Theoretical computer science; Type theory; Algorithm","score_opus":0.08757239986656361,"score_gpt":0.3145236410380468,"score_spread":0.2269512411714832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386229959","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.0030859534,0.00060870923,0.95601684,0.0017724665,0.00047422602,0.000067136636,0.00024304184,0.0011170009,0.036614608],"genre_scores_gemma":[0.11187009,0.0015535468,0.84062403,0.0033026754,0.00153413,0.00045837258,0.0009881293,0.002105339,0.037563644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965676,0.00078992447,0.00024170593,0.00073295436,0.0013624119,0.00030538876],"domain_scores_gemma":[0.9940843,0.003416203,0.00012259833,0.0011556508,0.0009900399,0.00023118836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005358224,0.00094549876,0.0014280315,0.0018482483,0.0021308458,0.003947549,0.0034690963,0.0019708646,0.008300551],"category_scores_gemma":[0.0072132875,0.0022134495,0.00318797,0.0016110621,0.007193185,0.01505813,0.0067300014,0.012983018,0.005686624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001650001,0.000021516704,0.00009577806,0.00006541121,0.0000061592323,0.000036966503,0.00020296144,0.00038635757,0.001051832,0.9789859,0.004992513,0.014138156],"study_design_scores_gemma":[0.00001614828,0.000010788161,0.00006994813,0.000035963865,0.000011792517,0.00007189237,0.000029973315,0.002774639,0.0013385045,0.96937203,0.026255937,0.0000125159895],"about_ca_topic_score_codex":0.0010569486,"about_ca_topic_score_gemma":0.0012429127,"teacher_disagreement_score":0.008300551,"about_ca_system_score_codex":0.0019202965,"about_ca_system_score_gemma":0.001754611,"threshold_uncertainty_score":0.0283373},"labels":[],"label_agreement":null},{"id":"W4386230049","doi":"10.1007/978-3-031-40725-3_65","title":"Intent Recognition Using Recurrent Neural Networks on Vital Sign Data: A Machine Learning Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Athabasca University","funders":"","keywords":"Computer science; Robot; Artificial intelligence; Context (archaeology); Process (computing); Human–computer interaction; Perception; Deep learning; Action (physics); Task (project management); Machine learning; Psychology","score_opus":0.12266508413400276,"score_gpt":0.29854711413303014,"score_spread":0.17588202999902738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386230049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07576858,0.0011586773,0.91692024,0.00023624134,0.00025395566,0.00008740505,0.000501674,0.0018924586,0.0031807353],"genre_scores_gemma":[0.7116128,0.0011099413,0.27424163,0.0001445553,0.00019502194,0.00010214507,0.0015993087,0.00018713664,0.010807433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998411,0.000024596036,0.000012935713,0.000044078522,0.00004303257,0.000034167722],"domain_scores_gemma":[0.999632,0.00015098538,0.000039849616,0.00004917693,0.000110145476,0.000017946542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046725076,0.00076308724,0.00079068384,0.0005948466,0.00019791472,0.0007002051,0.00072777015,0.00062024023,0.0017184345],"category_scores_gemma":[0.000991564,0.0002614225,0.0007091654,0.0006933312,0.00018481647,0.0007124545,0.0005389528,0.00089889206,0.001073364],"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.0002078244,0.00019747949,0.0031628706,0.0001295349,0.00009175858,0.00021322019,0.00007291643,0.04195832,0.05555119,0.0022705682,0.005088259,0.8910561],"study_design_scores_gemma":[0.0000056350505,0.00009299409,0.0019028739,0.0000185021,0.000039653452,0.00009955556,0.000025877982,0.9836674,0.010978122,0.0022954713,0.00085720833,0.000016725904],"about_ca_topic_score_codex":0.0018937583,"about_ca_topic_score_gemma":0.0042113746,"teacher_disagreement_score":0.0018937583,"about_ca_system_score_codex":0.00021690155,"about_ca_system_score_gemma":0.00029013096,"threshold_uncertainty_score":0.005748749},"labels":[],"label_agreement":null},{"id":"W4386231691","doi":"10.1007/978-3-031-39784-4_9","title":"An Evidence Logic Perspective on Schotch-Jennings Forcing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Doxastic logic; Forcing (mathematics); Epistemic modal logic; Modal logic; Modal operator; Operator (biology); Perspective (graphical); Semantics (computer science); Hypergraph; Computer science; Epistemology; Mathematics; Modal; Algorithm; Theoretical computer science; Discrete mathematics; Multimodal logic; Artificial intelligence; Description logic; Philosophy; Programming language","score_opus":0.04238636107239058,"score_gpt":0.3013732260256221,"score_spread":0.25898686495323153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386231691","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.01896888,0.0062093567,0.34794652,0.037317514,0.0012504304,0.00010918523,0.00068407843,0.00016689664,0.58734715],"genre_scores_gemma":[0.8019554,0.004916087,0.090512365,0.0054447884,0.0027987398,0.00035557084,0.00045873725,0.00017379122,0.09338457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975914,0.00096438354,0.00016050656,0.0004092289,0.00067162607,0.00020278829],"domain_scores_gemma":[0.99387157,0.004740498,0.00023656874,0.00054526614,0.00044290273,0.00016322035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00413879,0.000680484,0.0012818486,0.0031419187,0.003234349,0.004416474,0.002186607,0.0038345992,0.017879149],"category_scores_gemma":[0.008888805,0.0007511421,0.0018431137,0.0029959634,0.012076144,0.011564857,0.0032232073,0.005838004,0.0011779362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023988032,0.0000017765058,0.000013035508,0.000007405165,0.0000014913242,0.000013028026,0.000025526206,0.00015545328,0.0000135988585,0.9986694,0.00040832406,0.00068854966],"study_design_scores_gemma":[0.0000030166805,0.0000013098457,0.000012005152,0.000005651591,0.0000012411475,0.0000091973425,0.000012073847,0.00022534416,0.000015502223,0.99793065,0.0017820761,0.0000019666415],"about_ca_topic_score_codex":0.0027222396,"about_ca_topic_score_gemma":0.0030140523,"teacher_disagreement_score":0.017879149,"about_ca_system_score_codex":0.0043965443,"about_ca_system_score_gemma":0.00170278,"threshold_uncertainty_score":0.05981177},"labels":[],"label_agreement":null},{"id":"W4386231745","doi":"10.1007/978-3-031-39784-4","title":"Logic, Language, Information, and Computation","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; Serbian Academy of Sciences and Arts; Libera Università di Bolzano; Université de Montpellier; Göteborgs Universitet; Centre National de la Recherche Scientifique; University of Nottingham; Technische Universität Wien; Universiteit van Amsterdam; Sveučilište u Zagrebu; European Association for Theoretical Computer Science; Université du Luxembourg; Sun Yat-sen University; Universidad de Buenos Aires; Akademie Věd České Republiky; Dalhousie University; Ruhr-Universität Bochum; Vrije Universiteit Amsterdam; University of Bath; University of Glasgow; Università di Bologna; Universidade de Lisboa; Portland State University; Arizona State University; Carnegie Mellon University; Division of Mathematical Sciences; Helsingin Yliopisto","keywords":"Computer science; Rule-based machine translation; Logic program; Context-free grammar; Computation; Programming language; Context (archaeology); Theoretical computer science; Artificial intelligence; Natural language processing; Logic programming","score_opus":0.016474098510423425,"score_gpt":0.2712628525454947,"score_spread":0.2547887540350713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386231745","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031848266,0.17848395,0.14834179,0.015797438,0.0031384851,0.00009256933,0.001075406,0.00094033865,0.64894515],"genre_scores_gemma":[0.16538624,0.17259581,0.1398394,0.0077129295,0.0087629445,0.00060108496,0.0036195533,0.0010880013,0.50039405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994856,0.000117686766,0.00003873469,0.00009900045,0.0002178304,0.00004109425],"domain_scores_gemma":[0.9995415,0.0002814244,0.000023207771,0.00006870978,0.000055679244,0.00002951977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062109914,0.0010604328,0.001348065,0.002445916,0.0012826236,0.007826571,0.0011960622,0.0013917238,0.020111006],"category_scores_gemma":[0.0014547055,0.00068317185,0.00071879826,0.005599956,0.005856112,0.010412088,0.0017219081,0.0035682027,0.006894945],"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.00000841428,0.0000113781925,0.000049761737,0.00020910811,0.000009254049,0.000025045289,0.00012249708,0.00050575245,0.00021209546,0.9188838,0.041844584,0.038118165],"study_design_scores_gemma":[0.000004204666,0.000003510052,0.00006338556,0.00007756909,0.0000056133977,0.00006081202,0.00005197234,0.0006356593,0.00006643567,0.8772162,0.12180932,0.0000051828083],"about_ca_topic_score_codex":0.0031176081,"about_ca_topic_score_gemma":0.0031692567,"teacher_disagreement_score":0.020111006,"about_ca_system_score_codex":0.0030839618,"about_ca_system_score_gemma":0.0018083957,"threshold_uncertainty_score":0.06727797},"labels":[],"label_agreement":null},{"id":"W4386297689","doi":"10.1007/978-3-031-42753-4_8","title":"Teaching Linear Algebra in a Mechanized Mathematical Environment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods 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":"Ontario Tech University; Western University","funders":"","keywords":"Python (programming language); Linear algebra; Computer science; Algebra over a field; Maple; MATLAB; Symbolic computation; Mathematics education; Programming language; Software engineering; Mathematics; Pure mathematics; Geometry","score_opus":0.02543426211771828,"score_gpt":0.27545338647031814,"score_spread":0.2500191243525999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297689","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072836163,0.0016013011,0.48402667,0.0051799025,0.001335438,0.0000619381,0.00016136878,0.0022151114,0.49813455],"genre_scores_gemma":[0.10993736,0.005000242,0.39193514,0.0020299756,0.0018809224,0.00019518632,0.00042617286,0.0013578386,0.48723722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994974,0.00010099152,0.000015948654,0.000071332135,0.00027552297,0.00003881184],"domain_scores_gemma":[0.99938977,0.0002870431,0.000034664426,0.000095593154,0.00010702372,0.00008597088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948079,0.0006813396,0.0003821385,0.00069884746,0.00080016785,0.002492526,0.0010595124,0.00072083634,0.062871926],"category_scores_gemma":[0.0013495621,0.0004764112,0.0004465741,0.00082617067,0.0012812659,0.004113817,0.002080252,0.0027207835,0.018126048],"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.000018811841,0.00012739931,0.00013539863,0.00021748104,0.0000067926376,0.00006230722,0.00036100415,0.0032503887,0.0063112513,0.73760724,0.08647553,0.16542633],"study_design_scores_gemma":[0.000012509701,0.000038459242,0.0002411185,0.000156319,0.000006308126,0.0002207864,0.00023465513,0.008840347,0.004219718,0.5490738,0.43693915,0.000016835744],"about_ca_topic_score_codex":0.00031514443,"about_ca_topic_score_gemma":0.001183056,"teacher_disagreement_score":0.062871926,"about_ca_system_score_codex":0.0008366322,"about_ca_system_score_gemma":0.0012794008,"threshold_uncertainty_score":0.21032757},"labels":[],"label_agreement":null},{"id":"W4386297699","doi":"10.1007/978-3-031-42753-4_18","title":"Proving Results About OEIS Sequences with Walnut","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encyclopedia; Computer science; Integer sequence; Line (geometry); Software; Algorithm; Discrete mathematics; Mathematics; Programming language; Geometry; Library science","score_opus":0.016788354721212297,"score_gpt":0.232384581580104,"score_spread":0.2155962268588917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06415454,0.0020992116,0.6505875,0.0024770026,0.0014427409,0.00017800501,0.0005547762,0.0019524212,0.27655384],"genre_scores_gemma":[0.6916613,0.0030509417,0.1640715,0.0019166429,0.0011528907,0.00039266897,0.0017747766,0.0015790627,0.13440034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984901,0.0002807005,0.00011071158,0.00030332067,0.00056658813,0.00024854866],"domain_scores_gemma":[0.9977302,0.0014867651,0.00008684232,0.0002664648,0.0002745958,0.00015510846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014269467,0.0021767085,0.0014483526,0.0034489117,0.0032401863,0.003925763,0.0020113545,0.0017261262,0.013034169],"category_scores_gemma":[0.0040208586,0.0016550685,0.0027213877,0.0032657029,0.0034688571,0.01246288,0.0054365955,0.0062886146,0.0032554946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052457854,0.00005112478,0.00020664251,0.00012981734,0.00002924359,0.00019797008,0.00043065823,0.0015231583,0.002201753,0.9723317,0.0030412467,0.01980429],"study_design_scores_gemma":[0.000011971067,0.000024363795,0.0001239904,0.000041559626,0.000037645492,0.00010389347,0.00012790259,0.0039122645,0.0026082909,0.9812509,0.01174036,0.000016827515],"about_ca_topic_score_codex":0.0014660968,"about_ca_topic_score_gemma":0.0017213328,"teacher_disagreement_score":0.013034169,"about_ca_system_score_codex":0.0015102624,"about_ca_system_score_gemma":0.0007419865,"threshold_uncertainty_score":0.0436036},"labels":[],"label_agreement":null},{"id":"W4386297954","doi":"10.1007/978-3-031-42753-4_24","title":"Extracting Theory Graphs from Aldor Libraries","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 Waterloo","funders":"","keywords":"Computer science; Morphism; Programming language; Set (abstract data type); Algebraic expression; Algebraic number; Theoretical computer science; Expression (computer science); Algebra over a field; Discrete mathematics; Mathematics","score_opus":0.02806533489442932,"score_gpt":0.2408855022661612,"score_spread":0.21282016737173187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297954","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.017025307,0.0022364256,0.767666,0.0011140988,0.0003829591,0.00036065606,0.029383725,0.11124728,0.07058361],"genre_scores_gemma":[0.09958263,0.0026457703,0.7298926,0.0005061863,0.0002293396,0.00039284446,0.09121768,0.023493333,0.052039582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991437,0.00013713706,0.000070684066,0.0001716299,0.0003790797,0.000097797456],"domain_scores_gemma":[0.9977869,0.00089316955,0.00009493303,0.00059405103,0.00056975294,0.00006122297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779188,0.0013967947,0.0010943573,0.010635258,0.0013748084,0.0036832164,0.0021597184,0.0007506026,0.034549806],"category_scores_gemma":[0.004421981,0.0012941327,0.0018747662,0.008217116,0.000769087,0.0072922874,0.0027606967,0.0018227111,0.02596408],"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.000248697,0.00019376341,0.0018973834,0.0013115626,0.00011765083,0.00043099778,0.00060284056,0.0053632506,0.0074092657,0.106930405,0.15348111,0.7220131],"study_design_scores_gemma":[0.00011493409,0.00009134029,0.0017227838,0.00057288224,0.000298575,0.000566826,0.00087726535,0.0662229,0.03742686,0.25792328,0.6340471,0.0001352191],"about_ca_topic_score_codex":0.004078194,"about_ca_topic_score_gemma":0.011514395,"teacher_disagreement_score":0.034549806,"about_ca_system_score_codex":0.0013335389,"about_ca_system_score_gemma":0.0019030338,"threshold_uncertainty_score":0.11558062},"labels":[],"label_agreement":null},{"id":"W4386315391","doi":"10.1007/978-3-031-41620-0","title":"Business Process Management","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Camerino; Universiteit Hasselt; Univerza v Mariboru; Libera Università di Bolzano; Universität Duisburg-Essen; Universität Paderborn; Tartu Ülikool; Univerza v Ljubljani; National Research University Higher School of Economics; University of New South Wales; KU Leuven; Universidade do Estado do Rio de Janeiro; Technion-Israel Institute of Technology; Technische Universität München; Humboldt-Universität zu Berlin; Universiteit Gent; Universität des Saarlandes; Uniwersytet Warszawski; Pontificia Universidad Católica de Chile; Università degli Studi di Trento; Università della Calabria; Università degli Studi di Padova; Einstein Stiftung Berlin; Technische Universiteit Eindhoven; Julius-Maximilians-Universität Würzburg; Khalifa University of Science, Technology and Research; Bundesministerium für Bildung und Forschung; Universiteit Utrecht; Westfälische Wilhelms-Universität Münster; Sapienza Università di Roma; University of Queensland; Universitat Politècnica de Catalunya; Philipps-Universität Marburg; Instituto Tecnológico y de Estudios Superiores de Monterrey; University of Adelaide; Rijksuniversiteit Groningen; Memorial University of Newfoundland; York University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Universidad de Sevilla; Queensland University of Technology; Commonwealth Scientific and Industrial Research Organisation; Ulsan National Institute of Science and Technology; Indian Council of Agricultural Research; Pohang University of Science and Technology; Ministry of Education, India; Universität St. Gallen; Pennsylvania State University; University of Sydney; Universität Regensburg; Universität Rostock; University of South Australia; University of Haifa; Universität Mannheim; Universität Hamburg; RWTH Aachen University; Danmarks Tekniske Universitet; Norges Teknisk-Naturvitenskapelige Universitet; Sveučilište u Zagrebu; University of Melbourne; Friedrich-Alexander-Universität Erlangen-Nürnberg; University of Twente","keywords":"Computer science; Business process; Process (computing); Business process management; Process management; Programming language; Work in process; Operations management","score_opus":0.01621569591718478,"score_gpt":0.2724274812230078,"score_spread":0.256211785305823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386315391","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001967895,0.007845177,0.13213569,0.0029747516,0.0010016719,0.00017011743,0.0006695783,0.0028954984,0.8503396],"genre_scores_gemma":[0.025831461,0.006921822,0.036517866,0.00063191523,0.00038660082,0.00013920986,0.0017516359,0.0005400415,0.9272795],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994436,0.00006639556,0.000025521182,0.000089545276,0.00033483404,0.000040149112],"domain_scores_gemma":[0.9995937,0.00010736731,0.000026553256,0.000099256205,0.00012587538,0.000047298126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071327103,0.0007661529,0.0004824706,0.0011225331,0.0005489311,0.0033094832,0.0006618624,0.0007803262,0.071163476],"category_scores_gemma":[0.0015044234,0.00043016675,0.00039136925,0.0024835807,0.00035174142,0.0026258805,0.001041251,0.0011604517,0.059537224],"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.000024669756,0.000063977925,0.00012435784,0.00011973254,0.000010058668,0.000041114126,0.00012494891,0.0015307068,0.0017876995,0.07837709,0.17436202,0.7434336],"study_design_scores_gemma":[0.000008694109,0.000028896051,0.00044757497,0.00011492569,0.000009373313,0.000110695655,0.000076103664,0.0056117284,0.0012557297,0.058596853,0.9337294,0.000009985627],"about_ca_topic_score_codex":0.0015084586,"about_ca_topic_score_gemma":0.0015072377,"teacher_disagreement_score":0.071163476,"about_ca_system_score_codex":0.00095453346,"about_ca_system_score_gemma":0.0011125263,"threshold_uncertainty_score":0.23806554},"labels":[],"label_agreement":null},{"id":"W4386315421","doi":"10.1007/978-3-031-41620-0_2","title":"Can I Trust My Simulation Model? Measuring the Quality of Business Process Simulation Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Replicate; Process (computing); Quality (philosophy); Process modeling; Business process modeling; Business process; Strengths and weaknesses; Business process discovery; Key (lock); Data mining; Point (geometry); Data science; Work in process","score_opus":0.08831645309431176,"score_gpt":0.29534109484884347,"score_spread":0.20702464175453172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386315421","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.6743914,0.0016240497,0.2948731,0.005952822,0.00029994934,0.00039724744,0.001382154,0.002590963,0.018488267],"genre_scores_gemma":[0.9410617,0.00039417107,0.056225553,0.00025805025,0.00004201028,0.00006744385,0.0011229574,0.0003015414,0.00052653346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9593165,0.020164987,0.0034143652,0.0026785452,0.013191022,0.0012346156],"domain_scores_gemma":[0.52505857,0.3594284,0.04016586,0.039094016,0.031728998,0.004524091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04484996,0.00087371015,0.0011007525,0.0036152487,0.0009323468,0.007441396,0.0021881452,0.0023164924,0.0022267543],"category_scores_gemma":[0.3787288,0.0009849365,0.00088772713,0.0037735272,0.0022993574,0.007942963,0.002773932,0.0030438413,0.0006770435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023292953,0.0006697917,0.28890663,0.001113545,0.0013433755,0.00048497444,0.0050380933,0.48515308,0.007166651,0.0394615,0.007956005,0.16037709],"study_design_scores_gemma":[0.00008937759,0.0007001362,0.038750764,0.0006912792,0.00034778038,0.00036207435,0.0020000385,0.90019864,0.009050224,0.04009681,0.007488998,0.00022390633],"about_ca_topic_score_codex":0.008565216,"about_ca_topic_score_gemma":0.0065650395,"teacher_disagreement_score":0.04484996,"about_ca_system_score_codex":0.0034760893,"about_ca_system_score_gemma":0.0025475211,"threshold_uncertainty_score":0.2371921},"labels":[],"label_agreement":null},{"id":"W4386315726","doi":"10.1007/978-3-031-41620-0_17","title":"Agent Miner: An Algorithm for Discovering Agent Systems from Event Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Construct (python library); Business process discovery; Business process; Event (particle physics); Process mining; Process (computing); Data mining; Process modeling; Artificial intelligence; Business process management; Business process modeling; Data science; Work in process; Programming language","score_opus":0.06130431648666373,"score_gpt":0.27404563536208154,"score_spread":0.2127413188754178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386315726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038927402,0.00024361613,0.9871617,0.00011534265,0.00002647904,0.00014856888,0.0004997071,0.0070274947,0.0008844218],"genre_scores_gemma":[0.032173757,0.0001600223,0.96383256,0.00006957966,0.00001896478,0.00018335627,0.0010220922,0.00039346342,0.002146034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990538,0.00020741163,0.00007641564,0.00025999174,0.00034415172,0.000058162346],"domain_scores_gemma":[0.998052,0.0013629319,0.00011470494,0.00021471824,0.00020806721,0.00004762177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018133561,0.00163152,0.0014110712,0.002748269,0.0009947313,0.0017419014,0.0037020044,0.0018685716,0.00492018],"category_scores_gemma":[0.0055991462,0.0013239647,0.0013755582,0.0020030444,0.0007597006,0.0031753774,0.0022003455,0.0015997727,0.0028676372],"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.00051938,0.00035559197,0.0042448835,0.00073343085,0.000532563,0.0004198609,0.00037317036,0.15440759,0.005908767,0.01739181,0.028477311,0.78663564],"study_design_scores_gemma":[0.00008907983,0.000040241783,0.0003366689,0.000040936004,0.00006464345,0.00020874862,0.00005566054,0.958804,0.0045287944,0.026226623,0.009580543,0.000024138635],"about_ca_topic_score_codex":0.0034570259,"about_ca_topic_score_gemma":0.007957225,"teacher_disagreement_score":0.00492018,"about_ca_system_score_codex":0.00054473977,"about_ca_system_score_gemma":0.001570588,"threshold_uncertainty_score":0.016459644},"labels":[],"label_agreement":null},{"id":"W4386398223","doi":"10.1007/978-3-031-43254-5_14","title":"Fair Algorithm Design: Fair and Efficacious Machine Scheduling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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":"McGill University","funders":"","keywords":"Computer science; Scheduling (production processes); Pareto principle; Fairness measure; Exploit; Social Welfare; Algorithm; Constant (computer programming); Mathematical optimization; Mathematics; Law; Computer security","score_opus":0.07093175565883071,"score_gpt":0.3335112191381101,"score_spread":0.2625794634792794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386398223","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.0017290536,0.00025552537,0.9940509,0.00017442091,0.00008546988,0.000043446744,0.000013789219,0.00010284634,0.0035445797],"genre_scores_gemma":[0.26705188,0.0006784294,0.7187151,0.0002485894,0.00029480632,0.0003331615,0.000074248965,0.00016232303,0.0124414675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755055,0.0010795295,0.00008246065,0.00030711832,0.0007920598,0.00018823855],"domain_scores_gemma":[0.9971077,0.001671325,0.00012639901,0.00057628105,0.00041787207,0.0001004695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004417611,0.0008537084,0.0010755524,0.0007079749,0.0009331008,0.0023140504,0.0023979612,0.001599401,0.004858155],"category_scores_gemma":[0.0103399055,0.0007217223,0.00054691493,0.0009999188,0.0020256592,0.00227806,0.0013668804,0.0019870582,0.00068467885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012881792,0.00007458303,0.00017784518,0.00012418522,0.0000413535,0.00002586839,0.000071384326,0.2374119,0.0020267633,0.642245,0.0055793803,0.112092964],"study_design_scores_gemma":[0.000030139072,0.000047448437,0.000053676056,0.000017137452,0.000016526272,0.000026642572,0.000010668127,0.59689265,0.0014198292,0.39675924,0.0047162594,0.000009896825],"about_ca_topic_score_codex":0.00071878906,"about_ca_topic_score_gemma":0.0010603055,"teacher_disagreement_score":0.004858155,"about_ca_system_score_codex":0.0016279317,"about_ca_system_score_gemma":0.0023875227,"threshold_uncertainty_score":0.023362875},"labels":[],"label_agreement":null},{"id":"W4386398401","doi":"10.1007/978-3-031-43254-5_12","title":"Diversity-Seeking Jump Games in Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Nash equilibrium; Jump; Computer science; Mathematical economics; Best response; Fraction (chemistry); Type (biology); Diversity (politics); Symmetric game; Game theory; Node (physics); Normal-form game; Repeated game; Mathematical optimization; Mathematics; Sociology","score_opus":0.07781634396175041,"score_gpt":0.3243671318265744,"score_spread":0.24655078786482398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386398401","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.15379567,0.0032938428,0.5947411,0.0044761095,0.00054075016,0.0001693387,0.00035810392,0.00018629283,0.24243884],"genre_scores_gemma":[0.8925727,0.0020386355,0.028706228,0.00034656122,0.00034154332,0.00019235544,0.00012388644,0.000058078916,0.07562007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995944,0.00016374944,0.000011490503,0.00004351082,0.00010439375,0.000082573744],"domain_scores_gemma":[0.99870574,0.0010018646,0.000064678236,0.00003765581,0.00007199713,0.00011807917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007626641,0.00051631435,0.0007449683,0.00049849023,0.0006957819,0.0017469415,0.0012027165,0.001589156,0.0071607446],"category_scores_gemma":[0.0031439236,0.00024257766,0.0004438167,0.0007683848,0.0012862079,0.0022576659,0.001174434,0.0018915955,0.00046632037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056882083,0.00003071709,0.00014257191,0.00009239884,0.000019915913,0.000055019074,0.00011149979,0.059546407,0.0011165583,0.9204987,0.0045287404,0.013800627],"study_design_scores_gemma":[0.00002100107,0.000035466608,0.0001506287,0.000024774046,0.0000073113306,0.000038082246,0.000059892187,0.14435168,0.0002543968,0.8514566,0.0035882096,0.000012004501],"about_ca_topic_score_codex":0.0009007324,"about_ca_topic_score_gemma":0.0008944205,"teacher_disagreement_score":0.0071607446,"about_ca_system_score_codex":0.0011978305,"about_ca_system_score_gemma":0.00050083594,"threshold_uncertainty_score":0.023955107},"labels":[],"label_agreement":null},{"id":"W4386407152","doi":"10.1007/978-3-031-43898-1_44","title":"Temporal Uncertainty Localization to Enable Human-in-the-Loop Analysis of Dynamic Contrast-Enhanced Cardiac MRI Datasets","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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 Calgary","funders":"National Heart, Lung, and Blood Institute; National Institutes of Health; Lilly Endowment; Eli Lilly and Company","keywords":"Computer science; Segmentation; Artificial intelligence; Metric (unit); Dynamic contrast; Contrast (vision); Magnetic resonance imaging; Dynamic contrast-enhanced MRI; Pattern recognition (psychology); Computer vision; Cardiac magnetic resonance imaging; Medicine; Radiology","score_opus":0.015427397472486601,"score_gpt":0.34162314346087375,"score_spread":0.32619574598838713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386407152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064261085,0.00009362504,0.9915011,0.000049465176,0.00002299811,0.000023401375,0.00008765625,0.0015374157,0.00025819213],"genre_scores_gemma":[0.3393858,0.00024582577,0.6570818,0.00013984293,0.000094200725,0.00017597887,0.0007081771,0.0008770774,0.0012913829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994814,0.00012454447,0.000034886165,0.00012007737,0.00018353999,0.00005562945],"domain_scores_gemma":[0.9985051,0.0008853792,0.00012940555,0.00016958968,0.00024367614,0.0000668439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011284971,0.0008006075,0.00070569874,0.0007223289,0.0003563868,0.0010677151,0.0009336335,0.0008815675,0.0025869482],"category_scores_gemma":[0.0064499504,0.0003702851,0.0005400837,0.0005868596,0.00040614427,0.0008357256,0.0018694308,0.001052715,0.0006909029],"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.001100851,0.00019936223,0.0017768453,0.00035453023,0.00018849657,0.00042090146,0.00052660546,0.27099714,0.10162127,0.011449745,0.009515463,0.60184884],"study_design_scores_gemma":[0.000011017332,0.000055494314,0.0005101106,0.000011525383,0.000012667939,0.00009002627,0.0000395865,0.97812676,0.014141148,0.0050693825,0.0019183847,0.000013911351],"about_ca_topic_score_codex":0.0028436086,"about_ca_topic_score_gemma":0.005132964,"teacher_disagreement_score":0.0028436086,"about_ca_system_score_codex":0.0002972338,"about_ca_system_score_gemma":0.0008436494,"threshold_uncertainty_score":0.008654237},"labels":[],"label_agreement":null},{"id":"W4386411825","doi":"10.1007/978-981-99-5834-4_30","title":"Finite Libby-Novick Beta Mixture Model: An MML-Based Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; BETA (programming language); Artificial intelligence; Programming language","score_opus":0.03682749563201243,"score_gpt":0.2707176941050701,"score_spread":0.23389019847305764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386411825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063659647,0.0001420176,0.9966169,0.000086499495,0.000027738672,0.000013094601,0.00008881311,0.00030639954,0.0020818417],"genre_scores_gemma":[0.08009992,0.0007898124,0.89427316,0.00044666723,0.00023940318,0.00038031783,0.001291681,0.0018372675,0.020641826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897444,0.00044927653,0.00004694062,0.00016091636,0.00029622603,0.0000722823],"domain_scores_gemma":[0.9972676,0.0016561378,0.00011739368,0.00037720488,0.00043402478,0.00014768161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022072333,0.0012073099,0.0021297256,0.0015170468,0.0010394225,0.0032521852,0.0054086545,0.0023659945,0.013033887],"category_scores_gemma":[0.008569367,0.0013925789,0.001998109,0.0017163483,0.0012844187,0.0037401435,0.0039247135,0.00449435,0.0069580935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015399096,0.000107825515,0.00066401536,0.00023922455,0.00012695855,0.00023402314,0.000202367,0.33376378,0.0028598465,0.499854,0.012535848,0.1492581],"study_design_scores_gemma":[0.000006440729,0.0000066034977,0.000050782834,0.000018096542,0.000016134463,0.000040679926,0.000010492511,0.8964051,0.00049093063,0.098902866,0.004035629,0.000016289196],"about_ca_topic_score_codex":0.005124361,"about_ca_topic_score_gemma":0.0061667794,"teacher_disagreement_score":0.013033887,"about_ca_system_score_codex":0.0015037246,"about_ca_system_score_gemma":0.0014218044,"threshold_uncertainty_score":0.043602705},"labels":[],"label_agreement":null},{"id":"W4386429868","doi":"10.1007/978-981-99-5837-5_25","title":"Novel Topic Models for Parallel Topics Extraction from Multilingual Text","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Jaccard index; Topic model; Flexibility (engineering); Inference; Latent Dirichlet allocation; Prior probability; Artificial intelligence; Dirichlet distribution; Information retrieval; Natural language processing; Machine learning; Data mining; Pattern recognition (psychology); Mathematics; Boundary value problem; Statistics","score_opus":0.06478765766729977,"score_gpt":0.2963527200690191,"score_spread":0.2315650624017193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386429868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011208198,0.0020933151,0.9744105,0.0003885935,0.00034223535,0.0001795109,0.0026007318,0.0070463675,0.0017307277],"genre_scores_gemma":[0.16954379,0.0025755398,0.7915421,0.00028116148,0.0009387488,0.0010556772,0.021530926,0.0023737634,0.0101583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982686,0.00046155127,0.00018569251,0.0006161798,0.00032215,0.00014582959],"domain_scores_gemma":[0.99772114,0.0013069197,0.00014179581,0.000294787,0.0004322357,0.000103124716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020578867,0.0019800598,0.0014711308,0.003328155,0.0011810435,0.0027584422,0.0015179348,0.0015087884,0.005253593],"category_scores_gemma":[0.0050676353,0.0009126415,0.0026156837,0.0043064957,0.00042982612,0.005098628,0.00211137,0.0028133218,0.0065300427],"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.0009868513,0.00032289562,0.0024386344,0.0008275178,0.0005111322,0.00036119096,0.000997421,0.02456812,0.032758582,0.016941834,0.04903371,0.8702521],"study_design_scores_gemma":[0.0001340453,0.0001348451,0.0024421779,0.00011945134,0.000382198,0.00047768187,0.00045045197,0.89924455,0.019055927,0.03718197,0.04026871,0.000108048545],"about_ca_topic_score_codex":0.0049553066,"about_ca_topic_score_gemma":0.008145944,"teacher_disagreement_score":0.005253593,"about_ca_system_score_codex":0.00096700346,"about_ca_system_score_gemma":0.0016874494,"threshold_uncertainty_score":0.017574966},"labels":[],"label_agreement":null},{"id":"W4386429874","doi":"10.1007/978-981-99-5837-5","title":"Intelligent Information and Database Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Sfax; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; Prince Sultan University; Universidade Federal do Rio Grande do Norte; Addis Ababa University; National Cheng Kung University; Universitatea Politehnica Timisoara; Technische Universität Berlin; Politechnika Krakowska; National Taiwan University; Sungkyunkwan University; Universidad de Chile; Univerzita Hradec Králové; Yeungnam University; Universiti Teknologi Malaysia; Ben-Gurion University of the Negev; Instituto Tecnológico y de Estudios Superiores de Monterrey; Euskal Herriko Unibertsitatea; Universidade de Macau; Politechnika Warszawska; Silesian University of Technology; Waseda University; Universidad Complutense de Madrid; Sharif University of Technology; Swinburne University of Technology; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Deakin University; Université de Technologie de Troyes; King Saud University; University of Jordan; University of Wollongong; Budapesti Műszaki és Gazdaságtudományi Egyetem; Eötvös Loránd Tudományegyetem; Uniwersytet Morski w Gdyni; National University of Singapore; Gazi Üniversitesi; Bournemouth University; Uniwersytet Śląski w Katowicach; University of Carthage; University of Ulsan; Universiteit Leiden; Rīgas Tehniskā Universitāte; University of the West of England; Birmingham City University; Posts and Telecommunications Institute of Technology; Universiti Teknologi Petronas; University of Cyprus; Université du Québec à Trois-Rivières; Fujian University of Technology; National Taiwan University of Science and Technology; Universidad de Granada; Indian National Science Academy; Charles Sturt University; Universidad Autónoma de Madrid; Chaoyang University of Technology; King Fahd University of Petroleum and Minerals; Nanyang Technological University; Instituto de Telecomunicações; Nanjing University; Yildiz Teknik Üniversitesi; South Asian University; Auckland University of Technology, New Zealand; Virginia Commonwealth University; Concordia University; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; University of Notre Dame; Université de Lorraine; Universität Passau","keywords":"Computer science; Focus (optics); Intelligent database; Database; Database design; Database schema; Database testing","score_opus":0.045783480469607604,"score_gpt":0.26900766066764514,"score_spread":0.22322418019803753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386429874","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047483356,0.044810794,0.52100265,0.006164413,0.004400238,0.00029995496,0.0012523847,0.008199183,0.4091221],"genre_scores_gemma":[0.063493274,0.023981322,0.22430646,0.002236106,0.00336327,0.00025658385,0.0032386107,0.0011398839,0.6779845],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999129,0.0001400854,0.00006748211,0.00015066969,0.00046772946,0.00004502095],"domain_scores_gemma":[0.9992623,0.00019642897,0.000026498827,0.0003146989,0.00015805654,0.00004205648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009703374,0.00084324356,0.0009478529,0.0013408189,0.00061308616,0.0046301247,0.0010953023,0.00095467217,0.041092664],"category_scores_gemma":[0.0019524866,0.00072117365,0.00046121638,0.0018783235,0.0009973614,0.0052922675,0.0016283683,0.0013817917,0.026218152],"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.00007934569,0.00007027152,0.00023197642,0.00031679217,0.000049512444,0.0000731203,0.00017198923,0.0016863042,0.004678912,0.18875934,0.20234339,0.6015391],"study_design_scores_gemma":[0.000015803267,0.000037469155,0.00038142366,0.000090862035,0.000033325407,0.0002283742,0.000044639168,0.009311289,0.0026393486,0.13898048,0.8482232,0.000013776786],"about_ca_topic_score_codex":0.00071411784,"about_ca_topic_score_gemma":0.00092795375,"teacher_disagreement_score":0.041092664,"about_ca_system_score_codex":0.0005905781,"about_ca_system_score_gemma":0.0007097898,"threshold_uncertainty_score":0.13746864},"labels":[],"label_agreement":null},{"id":"W4386429979","doi":"10.1007/978-981-99-5834-4","title":"Intelligent Information and Database Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Sfax; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; Prince Sultan University; Universidade Federal do Rio Grande do Norte; Addis Ababa University; National Cheng Kung University; Universitatea Politehnica Timisoara; Technische Universität Berlin; Politechnika Krakowska; National Taiwan University; Sungkyunkwan University; Universidad de Chile; Univerzita Hradec Králové; Yeungnam University; Universiti Teknologi Malaysia; Ben-Gurion University of the Negev; Instituto Tecnológico y de Estudios Superiores de Monterrey; Euskal Herriko Unibertsitatea; Universidade de Macau; Politechnika Warszawska; Silesian University of Technology; Waseda University; Universidad Complutense de Madrid; Sharif University of Technology; Swinburne University of Technology; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Deakin University; Université de Technologie de Troyes; King Saud University; University of Jordan; University of Wollongong; Budapesti Műszaki és Gazdaságtudományi Egyetem; Eötvös Loránd Tudományegyetem; Uniwersytet Morski w Gdyni; National University of Singapore; Gazi Üniversitesi; Bournemouth University; Uniwersytet Śląski w Katowicach; University of Carthage; University of Ulsan; Universiteit Leiden; Rīgas Tehniskā Universitāte; University of the West of England; Birmingham City University; Posts and Telecommunications Institute of Technology; Universiti Teknologi Petronas; University of Cyprus; Université du Québec à Trois-Rivières; Fujian University of Technology; National Taiwan University of Science and Technology; Universidad de Granada; Indian National Science Academy; Charles Sturt University; Universidad Autónoma de Madrid; Chaoyang University of Technology; King Fahd University of Petroleum and Minerals; Nanyang Technological University; Instituto de Telecomunicações; Nanjing University; Yildiz Teknik Üniversitesi; South Asian University; Auckland University of Technology, New Zealand; Virginia Commonwealth University; Concordia University; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; University of Notre Dame; Université de Lorraine; Universität Passau","keywords":"Computer science; Database; Information system; Information retrieval","score_opus":0.045783480469607604,"score_gpt":0.26900766066764514,"score_spread":0.22322418019803753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386429979","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047483356,0.044810794,0.52100265,0.006164413,0.004400238,0.00029995496,0.0012523847,0.008199183,0.4091221],"genre_scores_gemma":[0.063493274,0.023981322,0.22430646,0.002236106,0.00336327,0.00025658385,0.0032386107,0.0011398839,0.6779845],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999129,0.0001400854,0.00006748211,0.00015066969,0.00046772946,0.00004502095],"domain_scores_gemma":[0.9992623,0.00019642897,0.000026498827,0.0003146989,0.00015805654,0.00004205648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009703374,0.00084324356,0.0009478529,0.0013408189,0.00061308616,0.0046301247,0.0010953023,0.00095467217,0.041092664],"category_scores_gemma":[0.0019524866,0.00072117365,0.00046121638,0.0018783235,0.0009973614,0.0052922675,0.0016283683,0.0013817917,0.026218152],"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.00007934569,0.00007027152,0.00023197642,0.00031679217,0.000049512444,0.0000731203,0.00017198923,0.0016863042,0.004678912,0.18875934,0.20234339,0.6015391],"study_design_scores_gemma":[0.000015803267,0.000037469155,0.00038142366,0.000090862035,0.000033325407,0.0002283742,0.000044639168,0.009311289,0.0026393486,0.13898048,0.8482232,0.000013776786],"about_ca_topic_score_codex":0.00071411784,"about_ca_topic_score_gemma":0.00092795375,"teacher_disagreement_score":0.041092664,"about_ca_system_score_codex":0.0005905781,"about_ca_system_score_gemma":0.0007097898,"threshold_uncertainty_score":0.13746864},"labels":[],"label_agreement":null},{"id":"W4386430032","doi":"10.1007/978-981-99-5837-5_14","title":"A Cluster-Constrained Graph Convolutional Network for Protein-Protein Association Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Graph; Metis; Community structure; Cluster analysis; Data mining; Theoretical computer science; Artificial intelligence; World Wide Web","score_opus":0.012294366123686583,"score_gpt":0.2435560661772338,"score_spread":0.2312617000535472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386430032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013611841,0.0007614557,0.9784226,0.00042695607,0.00010453882,0.00007437002,0.000822638,0.00338554,0.0023900496],"genre_scores_gemma":[0.3015332,0.0013814061,0.66638994,0.0006315151,0.00024302259,0.0003545654,0.0055704555,0.00090309646,0.022992697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996493,0.00006336728,0.000014303281,0.00012422979,0.00009194351,0.000056784836],"domain_scores_gemma":[0.9991998,0.00032365302,0.0000563873,0.00014768762,0.00021005662,0.00006250673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535898,0.0010553156,0.0012316123,0.001061983,0.00073519966,0.0009527285,0.0033765465,0.0015875915,0.004931656],"category_scores_gemma":[0.002072481,0.0007908835,0.0011881912,0.0018285443,0.000673308,0.0014336584,0.0019121469,0.001930124,0.0018159385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024629454,0.00013212384,0.00071288826,0.00014095554,0.00020897781,0.00012152054,0.000045112076,0.6191458,0.008589316,0.023673637,0.018067319,0.32891607],"study_design_scores_gemma":[0.000004269993,0.0000083335335,0.00009078413,0.0000034790096,0.000011987809,0.000011463233,0.0000023207049,0.99288905,0.00079165923,0.005472518,0.00070931093,0.00000485152],"about_ca_topic_score_codex":0.032930005,"about_ca_topic_score_gemma":0.051284842,"teacher_disagreement_score":0.032930005,"about_ca_system_score_codex":0.0018801678,"about_ca_system_score_gemma":0.0019011345,"threshold_uncertainty_score":0.065476656},"labels":[],"label_agreement":null},{"id":"W4386431062","doi":"10.1007/978-3-031-43111-1_23","title":"Model-Based Policy Optimization with Neural Differential Equations for Robotic Arm Control","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Reinforcement learning; Robotic arm; Artificial intelligence; Trajectory; Process (computing); Artificial neural network; Task (project management); Node (physics); Robot; Sample (material); System dynamics; Machine learning; Engineering","score_opus":0.028591916689053084,"score_gpt":0.26111853006638336,"score_spread":0.23252661337733027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386431062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038601193,0.0012646322,0.98583037,0.00031414913,0.00013318466,0.000026135454,0.000048255744,0.00021447847,0.008308584],"genre_scores_gemma":[0.78454834,0.0017451405,0.17648402,0.0003012501,0.00023930232,0.0004347606,0.0002193839,0.00032918068,0.035698567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976426,0.0000844682,0.00001139288,0.000040530333,0.00007459114,0.000024656427],"domain_scores_gemma":[0.9995926,0.0002625275,0.00004368441,0.000019875088,0.000065183194,0.00001604972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062122877,0.00088473485,0.0015322281,0.00037180842,0.0004066411,0.001055289,0.0011762426,0.0017251093,0.004027697],"category_scores_gemma":[0.001996515,0.00085532386,0.0007877132,0.00067481986,0.00091268413,0.00083953154,0.0014176767,0.001850595,0.00073219836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013639681,0.000016230813,0.00004254256,0.000041537965,0.00001788184,0.000012952174,0.000013264511,0.97539663,0.00032955312,0.013620737,0.0008026741,0.009692375],"study_design_scores_gemma":[0.0000024052697,0.0000039377314,0.00001297821,0.0000030294282,0.0000016452645,0.0000020996786,0.0000011080801,0.9955568,0.000044311986,0.00407883,0.00029099963,0.0000019205306],"about_ca_topic_score_codex":0.009506062,"about_ca_topic_score_gemma":0.007377015,"teacher_disagreement_score":0.009506062,"about_ca_system_score_codex":0.0012375795,"about_ca_system_score_gemma":0.0008933115,"threshold_uncertainty_score":0.018901408},"labels":[],"label_agreement":null},{"id":"W4386469341","doi":"10.1007/978-3-031-42935-4","title":"Flexible Query Answering Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Universidad de Alcalá; University of North Carolina at Charlotte; Danmarks Tekniske Universitet; Universidad de Zaragoza; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Otto von Guericke University Magdeburg; Università della Calabria; Universidad de Jaén; Università degli Studi di Milano; Sorbonne Université; Universidad de Granada; University of Bristol; Orta Doğu Teknik Üniversitesi; Universiteit Gent; Università degli Studi di Milano-Bicocca; University College London; Imperial College London; European Commission; University of Alberta; Univerzita Karlova v Praze; Centre National de la Recherche Scientifique; Universidad de Castilla-La Mancha; Louisiana State University","keywords":"Computer science; Question answering; Information retrieval; Query language; Query expansion; Database","score_opus":0.02693667206491216,"score_gpt":0.26336653870652016,"score_spread":0.236429866641608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386469341","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016628014,0.0017992042,0.92106694,0.0012410908,0.00033486998,0.00031672302,0.0020010008,0.022384362,0.034227863],"genre_scores_gemma":[0.2961148,0.001431499,0.6391367,0.0007734309,0.00037334478,0.00042001688,0.012441261,0.0025503011,0.046758693],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996756,0.0005893557,0.0002862929,0.0007308598,0.001272575,0.00036489486],"domain_scores_gemma":[0.9960813,0.0011244467,0.0000982029,0.0021358966,0.00044269022,0.00011746647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028976668,0.00095869723,0.001505436,0.0016827857,0.0016305262,0.004268583,0.0037376103,0.0016795923,0.01888631],"category_scores_gemma":[0.006581888,0.001117928,0.0012972467,0.003229186,0.0014644391,0.0074523427,0.0045819758,0.0020780405,0.008841465],"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.0007779341,0.00025759576,0.00101891,0.00047863915,0.00013880103,0.000380939,0.0006024575,0.02268315,0.025329847,0.22946522,0.0813014,0.63756514],"study_design_scores_gemma":[0.0001529184,0.00018200964,0.0008333124,0.00011766531,0.00016134976,0.0006304459,0.00031393487,0.33300012,0.027459268,0.4670621,0.16998187,0.00010498838],"about_ca_topic_score_codex":0.0025830017,"about_ca_topic_score_gemma":0.0029216935,"teacher_disagreement_score":0.01888631,"about_ca_system_score_codex":0.0010785701,"about_ca_system_score_gemma":0.0009577953,"threshold_uncertainty_score":0.06318098},"labels":[],"label_agreement":null},{"id":"W4386473763","doi":"10.1007/978-3-031-43264-4_3","title":"Qualitative Uncertainty Reasoning in AgentSpeak","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Computer science; Extension (predicate logic); Scalability; Observability; Syntax; Artificial intelligence; Modalities; Programming language; Theoretical computer science; Mathematics; Applied mathematics; Database","score_opus":0.043678243237320995,"score_gpt":0.31757894549339355,"score_spread":0.27390070225607255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386473763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005388409,0.001690923,0.9541038,0.0017678674,0.0001346611,0.00005987483,0.00022296025,0.000813679,0.035817698],"genre_scores_gemma":[0.5029806,0.0023341842,0.46842253,0.00065463374,0.00032181034,0.000290405,0.0007841866,0.00044313623,0.023768524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838245,0.0006990671,0.000096105825,0.00018049151,0.0005237117,0.00011814377],"domain_scores_gemma":[0.99720144,0.0020818482,0.000096045245,0.00032105797,0.0002085762,0.00009103438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026455794,0.0006786932,0.00079498714,0.0012085963,0.0012697309,0.0040562465,0.0022781596,0.001281075,0.008329639],"category_scores_gemma":[0.0067556906,0.0007948652,0.0011447181,0.0014777087,0.0032335864,0.0061706407,0.0028625573,0.002534148,0.001266155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038077877,0.000018645522,0.000078914396,0.00008680567,0.000021129677,0.00005125268,0.00019288254,0.015810456,0.00025614514,0.9567413,0.0029885075,0.023716051],"study_design_scores_gemma":[0.0000046767173,0.000002482365,0.00002032989,0.00002079454,0.000006416446,0.000012543194,0.000036785583,0.03373179,0.00039254964,0.9604632,0.0053028557,0.00000542637],"about_ca_topic_score_codex":0.0052684336,"about_ca_topic_score_gemma":0.004272691,"teacher_disagreement_score":0.008329639,"about_ca_system_score_codex":0.0023429675,"about_ca_system_score_gemma":0.0011396805,"threshold_uncertainty_score":0.02786541},"labels":[],"label_agreement":null},{"id":"W4386473849","doi":"10.1007/978-3-031-43264-4_6","title":"Exploiting Reward Machines with Deep Reinforcement Learning in Continuous Action Domains","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"York University","funders":"York University","keywords":"Counterfactual thinking; Reinforcement learning; Computer science; Task (project management); Artificial intelligence; Action (physics); Machine learning","score_opus":0.022827126539405374,"score_gpt":0.2547727152913582,"score_spread":0.2319455887519528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386473849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015629109,0.0005232247,0.9802185,0.00025044003,0.00006719021,0.000017801698,0.00004003755,0.0006124904,0.002641175],"genre_scores_gemma":[0.80303293,0.000491132,0.19046871,0.00014018622,0.00008473906,0.000101892474,0.00012044504,0.0001528995,0.005407115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969506,0.00012215946,0.000014178769,0.00006143571,0.0000621781,0.000045013992],"domain_scores_gemma":[0.99867463,0.0009770527,0.00009475651,0.00010537728,0.000088904795,0.000059270482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091552566,0.0007405702,0.0010259692,0.00032160085,0.0002553188,0.0009049239,0.0013088275,0.0010851589,0.0031593917],"category_scores_gemma":[0.002806462,0.00054212764,0.00042984827,0.00043796375,0.0009273403,0.0013567287,0.0013960141,0.0019710935,0.0004883003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000783004,0.000059136437,0.00035267157,0.00007553603,0.000037090376,0.000046952093,0.00002881074,0.8754249,0.0015460376,0.034950558,0.0016670602,0.08573295],"study_design_scores_gemma":[0.0000036875795,0.000009214962,0.000021436304,0.0000032478379,0.0000017320215,0.000004477718,0.0000012025978,0.9874893,0.0001689766,0.012143197,0.0001515091,0.0000019991264],"about_ca_topic_score_codex":0.0023960173,"about_ca_topic_score_gemma":0.002726761,"teacher_disagreement_score":0.0031593917,"about_ca_system_score_codex":0.00073288666,"about_ca_system_score_gemma":0.00063470233,"threshold_uncertainty_score":0.010569274},"labels":[],"label_agreement":null},{"id":"W4386515768","doi":"10.1007/978-3-031-40436-8_13","title":"Applying Formal Verification to an Open-Source Real-Time Operating System","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Promela; Computer science; Rotation formalisms in three dimensions; Programming language; Variety (cybernetics); Model checking; Semantics (computer science); Formal methods; Formal specification; Code (set theory); Formal verification; Specification language; Software engineering; Artificial intelligence","score_opus":0.034057987013124694,"score_gpt":0.28208893732041257,"score_spread":0.2480309503072879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386515768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019432902,0.0001283809,0.96880764,0.00024452517,0.0001221384,0.000073311814,0.000040656563,0.0048739333,0.0062764804],"genre_scores_gemma":[0.44170937,0.00034153857,0.54698056,0.00019624583,0.00006746402,0.000082641614,0.00017555851,0.0012486029,0.0091980025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842834,0.00048284448,0.00010649905,0.00019159666,0.00062539533,0.00016543212],"domain_scores_gemma":[0.9940532,0.0042172056,0.00016978216,0.00081584277,0.0006821245,0.00006190655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020735078,0.0005539308,0.00032671256,0.00046545945,0.00067554857,0.0019008559,0.0012703557,0.00078742654,0.0048008203],"category_scores_gemma":[0.009085616,0.00048404993,0.00098815,0.00025787952,0.0019194924,0.0020858075,0.001421001,0.0015697634,0.0007612232],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034230505,0.00038745915,0.0018892257,0.0008352708,0.00009934882,0.0010118022,0.0015149616,0.13258275,0.070534095,0.2640587,0.0072696796,0.51947427],"study_design_scores_gemma":[0.00013219737,0.00021092348,0.00061681296,0.00020857035,0.00010282755,0.00039348967,0.00021538284,0.6533694,0.10478309,0.20698968,0.03290429,0.00007326851],"about_ca_topic_score_codex":0.005490079,"about_ca_topic_score_gemma":0.0059196856,"teacher_disagreement_score":0.005490079,"about_ca_system_score_codex":0.0009506932,"about_ca_system_score_gemma":0.0020897246,"threshold_uncertainty_score":0.016060352},"labels":[],"label_agreement":null},{"id":"W4386585627","doi":"10.1007/978-3-031-40923-3_3","title":"Redesigning Medical Device Assurance: Separating Technological and Clinical Assurance Cases","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"McMaster University","funders":"","keywords":"Quality assurance; Computer science; Construct (python library); Argument (complex analysis); Medical physics; Risk analysis (engineering); Medicine; Operations management; Engineering","score_opus":0.031992371808583726,"score_gpt":0.28678194276834496,"score_spread":0.25478957095976124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386585627","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.034278795,0.0067479247,0.7627233,0.018727092,0.0013470853,0.0006551453,0.000096034935,0.002038652,0.17338602],"genre_scores_gemma":[0.49281695,0.0037618245,0.45687023,0.003925034,0.0007536884,0.0002492921,0.0002862563,0.0006573718,0.040679492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862982,0.0043009305,0.000679589,0.0010002705,0.0066991714,0.0010219279],"domain_scores_gemma":[0.96882665,0.020131972,0.0021663795,0.005142071,0.002833957,0.00089895335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013251991,0.0010794973,0.00059153663,0.0034565707,0.0012483448,0.008501647,0.00270019,0.0038189776,0.0070109623],"category_scores_gemma":[0.027017962,0.0011218933,0.0011231862,0.00092916586,0.0059224307,0.00931219,0.0050645927,0.005934472,0.0023017577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000129143,0.0003675582,0.0028706493,0.00033390618,0.000031414897,0.0009858343,0.0015700081,0.0073788906,0.008143856,0.4524352,0.013805024,0.5119485],"study_design_scores_gemma":[0.0001060199,0.000495821,0.0047684917,0.0019280021,0.00014429407,0.007230295,0.0023829467,0.10003683,0.026162298,0.6278496,0.2287097,0.00018566992],"about_ca_topic_score_codex":0.001073988,"about_ca_topic_score_gemma":0.0017230404,"teacher_disagreement_score":0.013251991,"about_ca_system_score_codex":0.0023914704,"about_ca_system_score_gemma":0.004968997,"threshold_uncertainty_score":0.070084035},"labels":[],"label_agreement":null},{"id":"W4386585696","doi":"10.1007/978-3-031-40923-3_1","title":"Assurance Case Arguments in the Large: The CERN LHC Machine Protection System","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"McMaster University; University of Toronto; Critical Systems Labs","funders":"Natural Sciences and Engineering Research Council of Canada; CERN","keywords":"Large Hadron Collider; Argumentation theory; Argument (complex analysis); Computer science; Particle physics; Physics; Epistemology; Philosophy","score_opus":0.013236724710835977,"score_gpt":0.20749410515983505,"score_spread":0.19425738044899907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386585696","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.05372517,0.0031354257,0.03742667,0.06509275,0.0009239192,0.000065220745,0.0001757655,0.0005107972,0.8389444],"genre_scores_gemma":[0.8966011,0.00075523515,0.0067609027,0.011224595,0.00082766503,0.000058374928,0.00008602108,0.0003580331,0.083327994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954059,0.0019063106,0.000082711915,0.0004582042,0.0015671614,0.0005797665],"domain_scores_gemma":[0.9889882,0.008856376,0.0003520759,0.00091222307,0.0006189906,0.00027223965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077757635,0.00059957244,0.0005880032,0.00095027173,0.0042116786,0.007895775,0.0019074652,0.009009881,0.022184782],"category_scores_gemma":[0.01972382,0.0005856982,0.00078054593,0.0010467023,0.006785316,0.010453315,0.0042607165,0.009575281,0.0022342105],"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.00009131517,0.000020120053,0.00019284412,0.000037476315,0.000008516815,0.0003100959,0.0006675802,0.0011543594,0.00043932116,0.96886694,0.020639915,0.007571413],"study_design_scores_gemma":[0.00007312341,0.00005993495,0.0008109759,0.00011955999,0.000038078742,0.00036116285,0.00080747454,0.0066112997,0.001680269,0.8835237,0.105858326,0.000056137953],"about_ca_topic_score_codex":0.0073664743,"about_ca_topic_score_gemma":0.007116545,"teacher_disagreement_score":0.022184782,"about_ca_system_score_codex":0.0057365205,"about_ca_system_score_gemma":0.0026299485,"threshold_uncertainty_score":0.07421553},"labels":[],"label_agreement":null},{"id":"W4386585729","doi":"10.1007/978-3-031-40923-3_7","title":"A Low-Cost Strategic Monitoring Approach for Scalable and Interpretable Error Detection in Deep Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Anomaly detection; Inference; Scalability; Overhead (engineering); Artificial intelligence; Categorization; Artificial neural network; Precision and recall; Recall; Component (thermodynamics); Fault detection and isolation; Detector; Pattern recognition (psychology); Machine learning; Data mining; Programming language","score_opus":0.02756579282268076,"score_gpt":0.26612443447366696,"score_spread":0.2385586416509862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386585729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044384045,0.00018581799,0.99313074,0.00014625888,0.000067134526,0.000034172903,0.00005615272,0.0010481054,0.00089315715],"genre_scores_gemma":[0.3817094,0.00029521863,0.6085647,0.00037464823,0.00020028303,0.00019074323,0.00044088013,0.0003533908,0.007870812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988808,0.0002325368,0.00006817064,0.00027328994,0.0004159465,0.00012929064],"domain_scores_gemma":[0.9980141,0.0008617813,0.0001727732,0.00044346973,0.00039751272,0.000110364555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927418,0.0012933121,0.0012800778,0.0006018681,0.00046256807,0.0012731908,0.0029474795,0.0015591104,0.0036704454],"category_scores_gemma":[0.0056238915,0.0006877548,0.0006612738,0.0006590698,0.00090056687,0.0022234959,0.0037131913,0.0028082978,0.0010724565],"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.00038775493,0.00020718499,0.0008869461,0.00013032249,0.000101778474,0.00015710329,0.00010818692,0.2763551,0.021422274,0.044561617,0.010457379,0.6452244],"study_design_scores_gemma":[0.000006008555,0.000027728405,0.000070974565,0.000005651528,0.000007116118,0.000021280452,0.000005147164,0.98408186,0.0028283608,0.012402751,0.00053623994,0.00000673235],"about_ca_topic_score_codex":0.0026833096,"about_ca_topic_score_gemma":0.004895897,"teacher_disagreement_score":0.0036704454,"about_ca_system_score_codex":0.0008530689,"about_ca_system_score_gemma":0.001557132,"threshold_uncertainty_score":0.012278914},"labels":[],"label_agreement":null},{"id":"W4386587212","doi":"10.1007/978-3-031-42448-9_18","title":"Answer Retrieval for Math Questions Using Structural and Dense Retrieval","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Similarity (geometry); Computer science; Relevance (law); Information retrieval; Matching (statistics); Task (project management); Domain (mathematical analysis); Artificial intelligence; Theoretical computer science; Mathematics; Image (mathematics); Statistics","score_opus":0.032724989764032104,"score_gpt":0.28394339965579257,"score_spread":0.2512184098917605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386587212","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.12710442,0.0029008205,0.8433421,0.0010115515,0.0002025497,0.00055962894,0.0021626079,0.0067292186,0.015987057],"genre_scores_gemma":[0.4840267,0.001361914,0.4906067,0.00031274397,0.00041747437,0.0003734024,0.0077288393,0.00043384725,0.014738426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892443,0.00027954727,0.000097364624,0.00019823795,0.00037381417,0.0001265483],"domain_scores_gemma":[0.99646133,0.0021037937,0.00015764598,0.00053486065,0.0006190263,0.0001233967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011843042,0.00074201095,0.0013739328,0.004044396,0.0008171219,0.0021152121,0.0012717758,0.0012399011,0.012256876],"category_scores_gemma":[0.007352937,0.00046843255,0.0010616806,0.002432862,0.00070700434,0.006222475,0.0025515615,0.0011129089,0.003762526],"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.0007428955,0.00044919903,0.002674341,0.00060979096,0.00010069168,0.0001337196,0.0006264882,0.009056356,0.042940535,0.039710786,0.024485411,0.87846977],"study_design_scores_gemma":[0.00032349597,0.0008202623,0.0062009217,0.00012544938,0.00035797275,0.000678347,0.0010219117,0.77168566,0.049792845,0.14040373,0.028465759,0.00012369071],"about_ca_topic_score_codex":0.003283147,"about_ca_topic_score_gemma":0.0062173815,"teacher_disagreement_score":0.012256876,"about_ca_system_score_codex":0.00094962324,"about_ca_system_score_gemma":0.001307556,"threshold_uncertainty_score":0.041003406},"labels":[],"label_agreement":null},{"id":"W4386609685","doi":"10.1007/978-3-031-40923-3","title":"Computer Safety, Reliability, and Security","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":3,"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":"Austrian Institute of Technology; Österreichische Forschungsförderungsgesellschaft; Centre National de la Recherche Scientifique; KU Leuven; Mälardalens högskola; Politechnika Gdańska; Ames Research Center; Università degli Studi di Firenze; European Research Consortium for Informatics and Mathematics; Universidade de Lisboa; Bundesministerium für Verkehr, Innovation und Technologie; European Commission; University of Toronto; National Aeronautics and Space Administration","keywords":"Computer science; Reliability (semiconductor); Computer security; Reliability engineering; Engineering","score_opus":0.015329498636984667,"score_gpt":0.2790020788586862,"score_spread":0.26367258022170154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386609685","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039498652,0.12568145,0.03604046,0.0056819664,0.003094486,0.00004720053,0.0003381885,0.000572667,0.8245938],"genre_scores_gemma":[0.06825413,0.07748837,0.01778981,0.0014739236,0.0042196997,0.000116555915,0.0005077431,0.00033509987,0.8298147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997899,0.000025461699,0.000006797726,0.000035598525,0.00012684228,0.000015472991],"domain_scores_gemma":[0.99953234,0.00024124025,0.00003164936,0.000052002226,0.00011201448,0.000030792882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020344055,0.0009314522,0.0004701546,0.0012956971,0.0005698767,0.0017491091,0.0005329349,0.0007103413,0.036161643],"category_scores_gemma":[0.0013070076,0.00034408784,0.00028579382,0.001911207,0.0014020617,0.0025084335,0.00060265185,0.001433823,0.010425676],"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.000040592775,0.000040100727,0.00019607568,0.0002852796,0.000012139509,0.000049909064,0.00018028848,0.002144414,0.0012436875,0.45740783,0.2783739,0.26002586],"study_design_scores_gemma":[0.0000100631,0.00005575333,0.0005959762,0.00018905806,0.00001640191,0.00027529252,0.000104749866,0.0024495476,0.00047261003,0.39992005,0.5958982,0.000012215758],"about_ca_topic_score_codex":0.0015816462,"about_ca_topic_score_gemma":0.0019080307,"teacher_disagreement_score":0.036161643,"about_ca_system_score_codex":0.0007133346,"about_ca_system_score_gemma":0.0007867365,"threshold_uncertainty_score":0.12097269},"labels":[],"label_agreement":null},{"id":"W4386645575","doi":"10.1007/978-3-031-41456-5_16","title":"An Abstractive Automatic Summarization Approach Based on a Text Comprehension Model of Cognitive Psychology","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Université du Québec à Montréal; Université du Québec à Trois-Rivières","funders":"","keywords":"Automatic summarization; Computer science; Natural language processing; Comprehension; Cognition; Artificial intelligence; Cognitive model; Cognitive science; Information retrieval; Programming language; Psychology","score_opus":0.035853468901795464,"score_gpt":0.31732284320819737,"score_spread":0.2814693743064019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386645575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051810676,0.00015888386,0.98902136,0.00025798817,0.00007829579,0.00015353858,0.00019283763,0.0026157412,0.002340243],"genre_scores_gemma":[0.10312505,0.0002497388,0.8867172,0.00018471923,0.0002058659,0.00040310028,0.0012525913,0.00048137084,0.0073803933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990108,0.00042779138,0.00007946507,0.00024860617,0.00019159951,0.000041682706],"domain_scores_gemma":[0.99725854,0.0013536714,0.00018003849,0.0003219275,0.0008077681,0.00007807471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012291735,0.0011716188,0.00089456025,0.0014661456,0.0006153358,0.0025192366,0.0017522691,0.0009211733,0.009583782],"category_scores_gemma":[0.0052452693,0.00044211012,0.0012072553,0.0012079196,0.00061800913,0.0042008413,0.0012379552,0.0014695452,0.0034664827],"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.0003617926,0.00039760408,0.00071389315,0.00094342884,0.0001740319,0.00023198774,0.0018905195,0.012519469,0.07969574,0.0795317,0.018564584,0.8049753],"study_design_scores_gemma":[0.00011501017,0.00050182303,0.001907434,0.00011188576,0.00030575835,0.0002786525,0.0007194987,0.74408853,0.045418356,0.17795923,0.028485386,0.00010837289],"about_ca_topic_score_codex":0.000915401,"about_ca_topic_score_gemma":0.0012155015,"teacher_disagreement_score":0.009583782,"about_ca_system_score_codex":0.00045906493,"about_ca_system_score_gemma":0.0007741591,"threshold_uncertainty_score":0.03206092},"labels":[],"label_agreement":null},{"id":"W4386645899","doi":"10.1007/978-3-031-41456-5_19","title":"Efficient Association Rules Minimization Using a Double-Stage Quine-McCluskey-Based Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Minification; Algorithm; Association (psychology); Artificial intelligence; Natural language processing; Programming language; Philosophy; Epistemology","score_opus":0.03742393488549111,"score_gpt":0.2713333279970946,"score_spread":0.23390939311160347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386645899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037238393,0.00027575102,0.9936957,0.00017825165,0.00007532966,0.00013612628,0.00021925662,0.00091542426,0.000780315],"genre_scores_gemma":[0.05706042,0.00021413223,0.93438506,0.00025868596,0.00012723969,0.0003272115,0.0017828491,0.00032374688,0.0055207023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962196,0.001138243,0.0004172123,0.00064246025,0.001260265,0.00032232289],"domain_scores_gemma":[0.9927872,0.004232753,0.0002164923,0.00087374134,0.0017139416,0.00017591318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003041212,0.001385214,0.003598927,0.0032021834,0.0011358996,0.0023018245,0.0045591895,0.0016056952,0.010364635],"category_scores_gemma":[0.009999678,0.0011227331,0.0028456335,0.0035599929,0.0008180049,0.0022326622,0.002273118,0.0027858496,0.0048428746],"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.0005248437,0.00057376013,0.0012209174,0.0005364554,0.00042696457,0.00030693877,0.0001327352,0.062204737,0.011167021,0.0172208,0.01928573,0.886399],"study_design_scores_gemma":[0.00009525466,0.00022901238,0.0007760059,0.000047063455,0.00016877973,0.0004079664,0.00009910965,0.9650039,0.0046829353,0.02362426,0.004819693,0.000045976085],"about_ca_topic_score_codex":0.004568097,"about_ca_topic_score_gemma":0.009923152,"teacher_disagreement_score":0.010364635,"about_ca_system_score_codex":0.0005830217,"about_ca_system_score_gemma":0.002671452,"threshold_uncertainty_score":0.034673095},"labels":[],"label_agreement":null},{"id":"W4386648721","doi":"10.1007/978-3-031-41456-5","title":"Computational Collective Intelligence","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National University of Computer and Emerging Sciences; Université de Technologie de Troyes; University of Carthage; Uniwersytet Śląski w Katowicach; Université Laval; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Uniwersytet Morski w Gdyni; Eötvös Loránd Tudományegyetem; Universidad Complutense de Madrid; Silesian University of Technology; Universidad de Granada; National Taiwan University of Science and Technology; Université de Tunis; Univerzita Pardubice; Universitatea Politehnica Timisoara; Trakya Üniversitesi; Birmingham City University; Aristotle University of Thessaloniki; Yeungnam University; Universiti Teknologi Malaysia; Université de Pau et des Pays de l'Adour; Westfälische Wilhelms-Universität Münster; Euskal Herriko Unibertsitatea; Academia Româna; Università di Bologna; University of Jordan; University of Wollongong; Inha University; University of Ulsan; Cardiff University; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Vrije Universiteit Amsterdam; Bournemouth University; Universidad de Almería; Université Mohammed V de Rabat; Bharathiar University; Høgskulen på Vestlandet; University of Cyprus; Inyuvesi Yakwazulu-Natali; Universidad Autónoma de Madrid; Slovenská technická univerzita v Bratislave; Nanyang Technological University; South Asian University; Budapesti Műszaki és Gazdaságtudományi Egyetem; Slovenská Akadémia Vied; Politechnika Koszalińska; Swinburne University of Technology; University of Cape Town; National Taiwan University; Oklahoma State University; Université de Lorraine; University of Ottawa; Virginia Commonwealth University","keywords":"Computer science; Collective intelligence; Computational intelligence; Artificial intelligence","score_opus":0.025059630814040765,"score_gpt":0.27509105048764504,"score_spread":0.25003141967360426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386648721","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075347973,0.025106324,0.13550892,0.008417539,0.0028469812,0.00005434266,0.000395287,0.0007989099,0.819337],"genre_scores_gemma":[0.22545141,0.017598165,0.053484827,0.0013873271,0.0025878598,0.00027323797,0.001195905,0.00062109577,0.6974001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999859,0.000036399662,0.000005383511,0.000027304213,0.000060208553,0.000011741929],"domain_scores_gemma":[0.99971527,0.00011431638,0.000011434379,0.00009660792,0.00003897406,0.000023404928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029773015,0.0005535959,0.0004854017,0.0007148894,0.0007069575,0.002091766,0.00047602694,0.0006045405,0.025205728],"category_scores_gemma":[0.0009867238,0.0002315632,0.0003030725,0.00096575177,0.0013503813,0.0025385453,0.0011493487,0.0013597122,0.0072547956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011927344,0.000018080758,0.000135964,0.00012447807,0.000017440225,0.00003098353,0.00028345035,0.00188727,0.0004247119,0.71831024,0.12430405,0.15445141],"study_design_scores_gemma":[0.0000050274753,0.000009112024,0.00023569126,0.000055358032,0.0000075696953,0.000060080198,0.000090167836,0.0037348932,0.00027600885,0.748895,0.24662548,0.0000055141813],"about_ca_topic_score_codex":0.00045041236,"about_ca_topic_score_gemma":0.0009616114,"teacher_disagreement_score":0.025205728,"about_ca_system_score_codex":0.000637419,"about_ca_system_score_gemma":0.00042568205,"threshold_uncertainty_score":0.08432156},"labels":[],"label_agreement":null},{"id":"W4386712148","doi":"10.1007/978-3-031-40953-0_34","title":"Safety Integrity Levels for Artificial Intelligence","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Critical Systems Labs","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.06908601725453448,"score_gpt":0.3164454676170098,"score_spread":0.24735945036247534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386712148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005725247,0.002607867,0.9287404,0.0030535595,0.0005025975,0.00009027449,0.00024172537,0.0009787338,0.058059637],"genre_scores_gemma":[0.53329146,0.0043240413,0.40094844,0.0016811801,0.0017041945,0.0005336773,0.0010928323,0.0007566555,0.055667505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976253,0.0006485899,0.00020809947,0.00034855155,0.0010101793,0.00015927931],"domain_scores_gemma":[0.99542797,0.002120208,0.0002851558,0.0013800042,0.0006560038,0.0001306444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029573403,0.0010353418,0.00093222334,0.0014044779,0.0008079015,0.003922257,0.0017637619,0.0017882591,0.013942738],"category_scores_gemma":[0.007828398,0.000523591,0.00094817637,0.00094262493,0.0036288078,0.0073363474,0.0028624837,0.0057363296,0.0034414514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041915067,0.000025545265,0.00006612498,0.00014547822,0.000016158636,0.00002743758,0.00006743677,0.010072726,0.0009788179,0.9172854,0.005563693,0.06570924],"study_design_scores_gemma":[0.000004783223,0.00001855577,0.000023888946,0.00004187997,0.0000066470066,0.000020025263,0.000015948533,0.018426217,0.0010290124,0.9714328,0.008974444,0.0000058445867],"about_ca_topic_score_codex":0.00028131864,"about_ca_topic_score_gemma":0.00018100014,"teacher_disagreement_score":0.013942738,"about_ca_system_score_codex":0.0014664375,"about_ca_system_score_gemma":0.0007747551,"threshold_uncertainty_score":0.046643138},"labels":[],"label_agreement":null},{"id":"W4386712150","doi":"10.1007/978-3-031-40953-0_2","title":"Constructing Security Cases Based on Formal Verification of Security Requirements in Alloy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"Carleton University","funders":"","keywords":"Computer science; Computer security model; Software security assurance; Formal methods; Security testing; Notation; Security engineering; Construct (python library); Formal verification; Security service; Software deployment; Formal specification; Formal description; Security information and event management; Computer security; Software engineering; Cloud computing security; Information security; Programming language","score_opus":0.020428290296645515,"score_gpt":0.2349573631595979,"score_spread":0.21452907286295236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386712150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061466523,0.000092428585,0.92185026,0.00024462413,0.000070699774,0.00045169063,0.0002574348,0.0034376236,0.01212863],"genre_scores_gemma":[0.24937932,0.00017535244,0.7447883,0.0000951705,0.000020367472,0.00022616287,0.00084315066,0.0008502904,0.0036218858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963413,0.00087567006,0.00033763048,0.00034838077,0.0016463335,0.0004506282],"domain_scores_gemma":[0.99395484,0.00419978,0.00028669453,0.00082758215,0.00064073846,0.00009033228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024826461,0.001172594,0.00079735764,0.0026857008,0.0011920308,0.0033076953,0.0021221298,0.0015487478,0.0064388956],"category_scores_gemma":[0.011524184,0.0018526281,0.0032681483,0.00083732174,0.0029157072,0.0032937324,0.00263967,0.0021808562,0.0017800971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005684035,0.0005877563,0.0049088765,0.0009713259,0.00014637192,0.0025969152,0.0026945123,0.17651312,0.056894198,0.5670417,0.0049966997,0.18208009],"study_design_scores_gemma":[0.00022181135,0.00020404153,0.0008628365,0.00030857854,0.00020387192,0.0008387851,0.00071733556,0.63529,0.08172636,0.25509173,0.024427753,0.000106806314],"about_ca_topic_score_codex":0.0049228864,"about_ca_topic_score_gemma":0.0048970496,"teacher_disagreement_score":0.0064388956,"about_ca_system_score_codex":0.0012829658,"about_ca_system_score_gemma":0.0019032999,"threshold_uncertainty_score":0.021540225},"labels":[],"label_agreement":null},{"id":"W4386712238","doi":"10.1007/978-3-031-40953-0_3","title":"Assurance Cases for Timing Properties of Automotive TSN Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","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":"McMaster University","funders":"","keywords":"Automotive industry; Computer science; Argument (complex analysis); Ethernet; FlexRay; Work (physics); Computer network; Distributed computing; Engineering","score_opus":0.035949516268219225,"score_gpt":0.2470765451194782,"score_spread":0.211127028851259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386712238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19439425,0.0007715305,0.7441156,0.0012321242,0.00020226576,0.00020156907,0.00034704586,0.0009830743,0.05775249],"genre_scores_gemma":[0.95178276,0.00042243977,0.04116523,0.00013771388,0.00014055493,0.000116068506,0.00024702953,0.000114175135,0.005874061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969567,0.0007424472,0.00021394144,0.00030898253,0.0013253475,0.00045262734],"domain_scores_gemma":[0.98710424,0.009173775,0.0010502223,0.0011974126,0.0011029841,0.00037143548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030387607,0.00076393737,0.00050320773,0.001388042,0.0009644708,0.0029927506,0.0010996137,0.0018294549,0.0038730022],"category_scores_gemma":[0.016120918,0.000644914,0.0010183409,0.0009517904,0.0019105505,0.0038691869,0.0014251106,0.0023624708,0.00044281263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055427366,0.00009448932,0.0020647265,0.00017347204,0.000053326727,0.0025269357,0.0006664669,0.07312407,0.014750707,0.8756296,0.0034134672,0.026948506],"study_design_scores_gemma":[0.00006376437,0.00009164091,0.0005190084,0.000070904076,0.000056544864,0.0010963442,0.00022784137,0.36914498,0.009581226,0.61238384,0.0067334147,0.000030470579],"about_ca_topic_score_codex":0.0013842586,"about_ca_topic_score_gemma":0.001001221,"teacher_disagreement_score":0.0038730022,"about_ca_system_score_codex":0.0013188042,"about_ca_system_score_gemma":0.00056563114,"threshold_uncertainty_score":0.016070724},"labels":[],"label_agreement":null},{"id":"W4386712325","doi":"10.1007/978-3-031-40953-0_14","title":"Patterns for Integrating NIST 800-53 Controls into Security Assurance Cases","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Critical Systems Labs; University of Toronto","funders":"","keywords":"NIST; Argument (complex analysis); Computer science; Computer security; Argumentation theory; Software security assurance; Information systems security; Information security; Security service; Information system; Epistemology; Law; Political science; Natural language processing","score_opus":0.01703731185328174,"score_gpt":0.2628120376287509,"score_spread":0.24577472577546913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386712325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07656382,0.00024113854,0.7861041,0.002469083,0.00024825626,0.0028807037,0.0040213857,0.015283063,0.11218837],"genre_scores_gemma":[0.21084249,0.00018888932,0.7642606,0.00032425404,0.000034395554,0.00082325237,0.003957483,0.00094277994,0.018625926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945363,0.0011761677,0.0009495511,0.00063739205,0.002265508,0.0004351302],"domain_scores_gemma":[0.98962563,0.0042620227,0.0011794236,0.0026713149,0.0019271795,0.0003345045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036344463,0.0006812234,0.00037719554,0.003739255,0.0011660075,0.0038745278,0.0015497222,0.0017699989,0.011777493],"category_scores_gemma":[0.01771185,0.0007626303,0.0008643104,0.0024130691,0.0012794427,0.004613727,0.0022772916,0.0015684263,0.0032464617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042462812,0.0008234403,0.025949623,0.00067085185,0.000065053784,0.0021270541,0.004512513,0.01055603,0.018136157,0.32917637,0.05562397,0.55193436],"study_design_scores_gemma":[0.0001585041,0.0005052492,0.015195683,0.0016810251,0.000206616,0.004617997,0.004723571,0.15442838,0.05554157,0.36810672,0.3946086,0.00022619728],"about_ca_topic_score_codex":0.0043814485,"about_ca_topic_score_gemma":0.008746021,"teacher_disagreement_score":0.011777493,"about_ca_system_score_codex":0.0013163083,"about_ca_system_score_gemma":0.0025788269,"threshold_uncertainty_score":0.039399624},"labels":[],"label_agreement":null},{"id":"W4386712343","doi":"10.1007/978-3-031-40953-0_35","title":"Can Large Language Models Assist in Hazard Analysis?","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Hazard; Context (archaeology); Session (web analytics); Hazard analysis; Variety (cybernetics); Risk analysis (engineering); Computer security; Artificial intelligence; World Wide Web; Reliability engineering; Engineering; Ecology; Medicine","score_opus":0.02489166734725026,"score_gpt":0.2631933300556764,"score_spread":0.23830166270842615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386712343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013475918,0.00054474716,0.97240746,0.0020854848,0.00023633362,0.00005225083,0.0011356473,0.003689128,0.006372981],"genre_scores_gemma":[0.55638415,0.0012744816,0.41641667,0.0009307772,0.00056994375,0.00033434914,0.0029540204,0.0021289696,0.01900667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998353,0.001005583,0.0000539237,0.00019963505,0.00024607457,0.00014181188],"domain_scores_gemma":[0.9819381,0.015396121,0.00061628193,0.0010720353,0.0007172179,0.00026021307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004276797,0.0012264753,0.0011562317,0.0011958111,0.00072613277,0.0030067335,0.0022318105,0.0019783012,0.017668266],"category_scores_gemma":[0.035180308,0.0010767654,0.0018305376,0.0014258812,0.0007738427,0.007144297,0.0015671871,0.0032622819,0.005993525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010083523,0.00036636402,0.008836082,0.00058224285,0.00042537347,0.00036594932,0.0007042771,0.35971457,0.005108636,0.23227546,0.042786427,0.34782627],"study_design_scores_gemma":[0.000057205307,0.00004610383,0.0006086564,0.000043309337,0.00007268356,0.000063966596,0.00012054237,0.7620501,0.0011347869,0.2277716,0.007998166,0.00003282159],"about_ca_topic_score_codex":0.006231613,"about_ca_topic_score_gemma":0.008914337,"teacher_disagreement_score":0.017668266,"about_ca_system_score_codex":0.00086813193,"about_ca_system_score_gemma":0.0017842922,"threshold_uncertainty_score":0.05910629},"labels":[],"label_agreement":null},{"id":"W4386712346","doi":"10.1007/978-3-031-40953-0_1","title":"Using Assurance Cases to Prevent Malicious Behaviour from Targeting Safety Vulnerabilities","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Safety assurance; Computer security; Information assurance; Order (exchange); Risk analysis (engineering); Information security; Business","score_opus":0.021976018309932895,"score_gpt":0.2423535448768934,"score_spread":0.2203775265669605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386712346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040369283,0.00039536477,0.9101937,0.0016662853,0.00030267364,0.00022230553,0.00011393097,0.010981312,0.035755143],"genre_scores_gemma":[0.6809239,0.00043001428,0.2974843,0.00061504805,0.00013826214,0.00011869746,0.00033633196,0.0012334828,0.01871996],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955533,0.0010222755,0.00024435628,0.00044420338,0.002348196,0.00038767583],"domain_scores_gemma":[0.9802381,0.011273843,0.0019061987,0.004379616,0.0017825227,0.00041978425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003556169,0.0012100743,0.00041073243,0.0020068581,0.0007293066,0.0027386893,0.0016306372,0.0022146483,0.005036013],"category_scores_gemma":[0.026518766,0.00081300864,0.0008097975,0.00050997734,0.0019978543,0.005299743,0.0024287896,0.003620163,0.0017545325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005473748,0.0007713986,0.007884922,0.00044045344,0.000109178174,0.0028880613,0.0018034321,0.06181818,0.050833605,0.29682305,0.02728319,0.54879713],"study_design_scores_gemma":[0.00010594529,0.00042829104,0.0017092035,0.0002901762,0.00020013709,0.0027547514,0.00037405404,0.5879197,0.07660828,0.28228134,0.04722155,0.0001065434],"about_ca_topic_score_codex":0.0008923142,"about_ca_topic_score_gemma":0.0009649314,"teacher_disagreement_score":0.005036013,"about_ca_system_score_codex":0.00058166345,"about_ca_system_score_gemma":0.00097284326,"threshold_uncertainty_score":0.018806994},"labels":[],"label_agreement":null},{"id":"W4386716531","doi":"10.1007/978-3-031-42508-0","title":"Artificial Intelligence and Soft Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"RIKEN Brain Science Institute; RIKEN; Umeå Universitet; KU Leuven; National University of Singapore; University of Toronto; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Oklahoma State University; Nanyang Technological University; Rensselaer Polytechnic Institute; Missouri University of Science and Technology; Middlesex University; Auburn University; City University of Hong Kong; Arizona State University; Univerza v Ljubljani; Ohio State University","keywords":"Computer science; Soft computing; Artificial intelligence; Artificial neural network","score_opus":0.02971843992739635,"score_gpt":0.25443124020410984,"score_spread":0.2247128002767135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716531","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00235046,0.095748626,0.088009715,0.0060988017,0.006773164,0.00009395575,0.0002633529,0.0004738165,0.800188],"genre_scores_gemma":[0.03993399,0.061445314,0.03680928,0.00226735,0.00413411,0.00024014326,0.00031653413,0.0003596262,0.8544936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996221,0.0000765701,0.00001604242,0.000041161013,0.00022667485,0.000017415561],"domain_scores_gemma":[0.99951696,0.0002857396,0.000026184092,0.00007037484,0.00006666158,0.00003404861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041155863,0.001034318,0.0012941689,0.0015030175,0.0006248281,0.0029764345,0.00053570187,0.00081915304,0.048341006],"category_scores_gemma":[0.0012760971,0.00036970328,0.0003705683,0.0028512892,0.0015701558,0.0028022085,0.0013978985,0.0022375602,0.019558642],"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.000022161328,0.00006344016,0.00011564296,0.0006831983,0.000037082038,0.00005998723,0.0001732358,0.0031292015,0.0010029711,0.4486594,0.17124769,0.37480602],"study_design_scores_gemma":[0.0000095835,0.000033564294,0.0003366924,0.00039424532,0.000014037897,0.00014644407,0.00008056787,0.0056318464,0.0004910474,0.47789818,0.51495135,0.000012453266],"about_ca_topic_score_codex":0.0004379794,"about_ca_topic_score_gemma":0.0009198902,"teacher_disagreement_score":0.048341006,"about_ca_system_score_codex":0.0007795168,"about_ca_system_score_gemma":0.00077192264,"threshold_uncertainty_score":0.16171676},"labels":[],"label_agreement":null},{"id":"W4386716596","doi":"10.1007/978-3-031-42505-9","title":"Artificial Intelligence and Soft Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Soft computing; Computer science; Artificial intelligence; Natural computing; Applications of artificial intelligence; Artificial neural network","score_opus":0.02971843992739635,"score_gpt":0.25443124020410984,"score_spread":0.2247128002767135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716596","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00235046,0.095748626,0.088009715,0.0060988017,0.006773164,0.00009395575,0.0002633529,0.0004738165,0.800188],"genre_scores_gemma":[0.03993399,0.061445314,0.03680928,0.00226735,0.00413411,0.00024014326,0.00031653413,0.0003596262,0.8544936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996221,0.0000765701,0.00001604242,0.000041161013,0.00022667485,0.000017415561],"domain_scores_gemma":[0.99951696,0.0002857396,0.000026184092,0.00007037484,0.00006666158,0.00003404861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041155863,0.001034318,0.0012941689,0.0015030175,0.0006248281,0.0029764345,0.00053570187,0.00081915304,0.048341006],"category_scores_gemma":[0.0012760971,0.00036970328,0.0003705683,0.0028512892,0.0015701558,0.0028022085,0.0013978985,0.0022375602,0.019558642],"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.000022161328,0.00006344016,0.00011564296,0.0006831983,0.000037082038,0.00005998723,0.0001732358,0.0031292015,0.0010029711,0.4486594,0.17124769,0.37480602],"study_design_scores_gemma":[0.0000095835,0.000033564294,0.0003366924,0.00039424532,0.000014037897,0.00014644407,0.00008056787,0.0056318464,0.0004910474,0.47789818,0.51495135,0.000012453266],"about_ca_topic_score_codex":0.0004379794,"about_ca_topic_score_gemma":0.0009198902,"teacher_disagreement_score":0.048341006,"about_ca_system_score_codex":0.0007795168,"about_ca_system_score_gemma":0.00077192264,"threshold_uncertainty_score":0.16171676},"labels":[],"label_agreement":null},{"id":"W4386716599","doi":"10.1007/978-3-031-42505-9_17","title":"Decentralized Federated Learning Loop with Constrained Trust Mechanism","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Brandon University","funders":"","keywords":"Computer science; Federated learning; Generalization; Mechanism (biology); Process (computing); Artificial intelligence; Distributed computing; Machine learning; Computer security; Operating system","score_opus":0.025714661362230076,"score_gpt":0.25176669370742727,"score_spread":0.2260520323451972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036141966,0.00016085482,0.9597931,0.00023870946,0.000060325565,0.000077711644,0.00005855246,0.00080956233,0.0026591923],"genre_scores_gemma":[0.91813284,0.00006683629,0.07714458,0.00009447872,0.000045035442,0.000104487786,0.00007661985,0.00004029443,0.0042948066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979298,0.0005622379,0.000121842175,0.0005708509,0.00046779134,0.00034748914],"domain_scores_gemma":[0.9954774,0.0019753184,0.00037216663,0.0012228411,0.00070551975,0.00024684533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002448407,0.00045145865,0.0012111604,0.00055285083,0.0010316402,0.0021768224,0.0025509633,0.0016620156,0.0031385259],"category_scores_gemma":[0.006713965,0.00034236297,0.0005376777,0.0008400497,0.0011796902,0.0033766928,0.0029311073,0.0012938738,0.0005008195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019725405,0.0006190617,0.0022013318,0.0002350007,0.00017482748,0.00052358693,0.0003478603,0.56042075,0.008657685,0.14761055,0.005828398,0.27140838],"study_design_scores_gemma":[0.0000400133,0.000072358336,0.00009679246,0.00000706171,0.000013668337,0.00008842435,0.000016634514,0.9588219,0.001957056,0.038066983,0.0008060898,0.000013024544],"about_ca_topic_score_codex":0.0011487576,"about_ca_topic_score_gemma":0.0008879022,"teacher_disagreement_score":0.0031385259,"about_ca_system_score_codex":0.0010975656,"about_ca_system_score_gemma":0.0019686194,"threshold_uncertainty_score":0.012948573},"labels":[],"label_agreement":null},{"id":"W4386716613","doi":"10.1007/978-3-031-42508-0_29","title":"Bayesian Inference in Infinite Multivariate McDonald’s Beta Mixture Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mixture model; Dirichlet process; Computer science; Cluster analysis; Dirichlet distribution; Bayesian inference; Posterior probability; Inference; Markov chain Monte Carlo; Bayesian probability; Gaussian process; Artificial intelligence; Beta distribution; Machine learning; Multivariate statistics; Data mining; Pattern recognition (psychology); Gaussian; Mathematics; Statistics","score_opus":0.035021127345776434,"score_gpt":0.29140524731902884,"score_spread":0.2563841199732524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005290031,0.0007227141,0.9903768,0.00044967298,0.00005643259,0.0000069762777,0.000074908196,0.00014252747,0.0028800445],"genre_scores_gemma":[0.36903816,0.0038073724,0.60306746,0.00066131644,0.0007110076,0.00021164183,0.000946775,0.00065499777,0.020901203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781823,0.0012936519,0.00009391672,0.00032087168,0.0003606818,0.0001126313],"domain_scores_gemma":[0.98282987,0.015113464,0.00049273425,0.0007102945,0.0006426708,0.00021093265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056495755,0.0008844993,0.0019448142,0.0018188882,0.00075219676,0.002392153,0.003318084,0.0021012232,0.0055390117],"category_scores_gemma":[0.031921756,0.0016945298,0.0014588097,0.002220823,0.002221754,0.00504366,0.0023607735,0.0036304975,0.0010041384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008024454,0.000033546356,0.00073244487,0.00015927818,0.000084596446,0.000091535054,0.00015017683,0.19998655,0.0005128346,0.75776476,0.002927097,0.03747703],"study_design_scores_gemma":[0.000008823176,0.0000055453343,0.00023476215,0.000034836525,0.000013289505,0.00004466048,0.000014837934,0.5266348,0.00015631955,0.47136268,0.0014649902,0.000024458575],"about_ca_topic_score_codex":0.0063819983,"about_ca_topic_score_gemma":0.0064048893,"teacher_disagreement_score":0.0063819983,"about_ca_system_score_codex":0.0019385142,"about_ca_system_score_gemma":0.0009785215,"threshold_uncertainty_score":0.0298782},"labels":[],"label_agreement":null},{"id":"W4386716634","doi":"10.1007/978-3-031-42505-9_45","title":"Learning Bezier-Durrmeyer Type Descriptors for Classifying Curves – Preliminary Studies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Numerical Analysis Techniques","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":"Concordia University","funders":"","keywords":"Bézier curve; Computer science; Artificial intelligence; Algorithm; Data point; Mathematics; Differential geometry of curves; Pattern recognition (psychology); Family of curves; Curve fitting; Classifier (UML); Lissajous curve; Noise (video); Machine learning; Geometry; Mathematical analysis; Differential equation; Image (mathematics)","score_opus":0.048120156709018584,"score_gpt":0.30215318189932183,"score_spread":0.25403302519030324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23920584,0.0046551544,0.7401857,0.0007795273,0.00029752371,0.00015578404,0.0008556829,0.0012364988,0.012628259],"genre_scores_gemma":[0.6100183,0.0037922831,0.35485327,0.0001834611,0.0003175403,0.00013956251,0.00410053,0.00032371678,0.02627122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.00013603209,0.000055969846,0.00025044865,0.00025005577,0.00007898171],"domain_scores_gemma":[0.9949805,0.002854377,0.0002811203,0.0007608903,0.00087469764,0.00024830652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014174917,0.00073784793,0.0013618675,0.0014981349,0.00055032334,0.0022678184,0.0017555191,0.0011490664,0.007040592],"category_scores_gemma":[0.00806708,0.0003585144,0.0010226893,0.00232058,0.00077616464,0.0047186646,0.0011993371,0.0018314335,0.002162223],"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.00038873267,0.00038411238,0.0050422824,0.00027956514,0.00007309303,0.0000674813,0.00027347472,0.061259292,0.008592562,0.035944406,0.01176548,0.8759296],"study_design_scores_gemma":[0.000024653229,0.00026821496,0.0024214871,0.00007771185,0.00004559591,0.0001469104,0.00032000762,0.9374663,0.0045585698,0.04763043,0.007001782,0.00003833253],"about_ca_topic_score_codex":0.0056116963,"about_ca_topic_score_gemma":0.0040785293,"teacher_disagreement_score":0.007040592,"about_ca_system_score_codex":0.0011185324,"about_ca_system_score_gemma":0.00095992105,"threshold_uncertainty_score":0.023553133},"labels":[],"label_agreement":null},{"id":"W4386716640","doi":"10.1007/978-3-031-42505-9_47","title":"Child Tracking and Prediction of Violence on Children In Social Media Using Natural Language Processing and Machine Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI and Multimedia in Education","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":"Brandon University","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Social media; Decision tree; Harm; Sentiment analysis; The Internet; Harassment; Data science; World Wide Web; Psychology; Social psychology","score_opus":0.018411982838953223,"score_gpt":0.26148287770054657,"score_spread":0.24307089486159333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716640","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.98028266,0.0006125051,0.013413123,0.00020816147,0.000029752322,0.000037773832,0.0023513031,0.0001751211,0.0028895328],"genre_scores_gemma":[0.98134,0.0003635242,0.014346199,0.000025809442,0.000025164009,0.000035692312,0.0019379056,0.000015581103,0.0019102352],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972206,0.00008186312,0.00001874467,0.00008002658,0.000056105255,0.00004113232],"domain_scores_gemma":[0.99825054,0.0012777726,0.00022765998,0.000058493242,0.00011717078,0.00006832894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048572218,0.0004611896,0.0002886411,0.0015898598,0.00029051764,0.00063891127,0.00046294433,0.00056020566,0.0017721368],"category_scores_gemma":[0.0020778736,0.00023072242,0.00056880247,0.0008357896,0.00016152438,0.0007460461,0.000359449,0.00060556555,0.00057737343],"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.0002941464,0.00034031057,0.8422889,0.000073721625,0.00017118214,0.0002611259,0.00042741472,0.007487293,0.004583829,0.0005133276,0.0021447751,0.141414],"study_design_scores_gemma":[0.000010318104,0.0003080245,0.79664385,0.00005303442,0.000118586184,0.0004208233,0.0007709217,0.19411705,0.0051013185,0.0013321724,0.001087006,0.000036889003],"about_ca_topic_score_codex":0.022791244,"about_ca_topic_score_gemma":0.042995177,"teacher_disagreement_score":0.022791244,"about_ca_system_score_codex":0.00051782274,"about_ca_system_score_gemma":0.0003172401,"threshold_uncertainty_score":0.045317173},"labels":[],"label_agreement":null},{"id":"W4386716721","doi":"10.1007/978-3-031-42505-9_3","title":"Reinforcement Learning with Brain-Inspired Modulation Improves Adaptation to Environmental Changes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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 Lethbridge; Mount Royal University","funders":"","keywords":"Reinforcement learning; Computer science; Adaptation (eye); Artificial intelligence; Machine learning; Contrast (vision); Neuroscience","score_opus":0.023954010679723112,"score_gpt":0.22358995839151494,"score_spread":0.19963594771179183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40336257,0.0011257103,0.5723335,0.000434503,0.0006864966,0.00007241226,0.00008067224,0.0019813222,0.019922862],"genre_scores_gemma":[0.9757504,0.000113818445,0.021257518,0.000070659815,0.00003719103,0.000023104642,0.000024534229,0.00005912684,0.0026635667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994624,0.000009207432,0.000002858113,0.00001905906,0.000011776059,0.00001087422],"domain_scores_gemma":[0.99986804,0.0000666714,0.000019520914,0.000015231536,0.000016277687,0.00001416295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015700616,0.0003566961,0.00035502884,0.00009109953,0.000101893966,0.00031151946,0.00046306947,0.00038883951,0.003148702],"category_scores_gemma":[0.0007396184,0.000098515804,0.000220277,0.00010205062,0.0001816691,0.00026584044,0.0003796143,0.00054489815,0.00031317485],"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.0005105766,0.00048084726,0.0010071405,0.00018295167,0.00012546043,0.00017332257,0.000071656235,0.26436657,0.22185247,0.007899153,0.0037164795,0.4996134],"study_design_scores_gemma":[0.000031900836,0.0001855506,0.000964803,0.000007570886,0.000027459537,0.000063413165,0.0000065405247,0.98221314,0.011806581,0.0035822736,0.0011003601,0.000010353494],"about_ca_topic_score_codex":0.0005329893,"about_ca_topic_score_gemma":0.00063106173,"teacher_disagreement_score":0.003148702,"about_ca_system_score_codex":0.00013057828,"about_ca_system_score_gemma":0.00014247776,"threshold_uncertainty_score":0.010533452},"labels":[],"label_agreement":null},{"id":"W4386716749","doi":"10.1007/978-3-031-42508-0_30","title":"Cannabis Use Estimators Within Canadian Population Using Social Media Based on Deep Learning Tools","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"HIV, Drug Use, Sexual Risk","field":"Medicine","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":"University of Ottawa","funders":"","keywords":"Cannabis; Computer science; Sample (material); Population; Classifier (UML); Estimator; Social media; Artificial intelligence; Statistics; World Wide Web; Demography; Psychology","score_opus":0.07534237704909082,"score_gpt":0.32202883098876023,"score_spread":0.24668645393966943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386716749","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.9559292,0.0013072314,0.01202263,0.0010690236,0.000119800694,0.0000509963,0.023470253,0.0003151407,0.0057157995],"genre_scores_gemma":[0.9772724,0.0004366257,0.0058940654,0.000081701975,0.000048140217,0.000026390337,0.0105734505,0.000032592536,0.0056348024],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997563,0.000039980652,0.000009840399,0.000053333137,0.000060076993,0.00008046653],"domain_scores_gemma":[0.9984458,0.000466632,0.000081790975,0.00009157989,0.0007970021,0.00011725372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066311855,0.00035659937,0.00028174996,0.0011916375,0.0006356015,0.00074903975,0.00092072977,0.0004840677,0.0031515455],"category_scores_gemma":[0.0035427238,0.00018657162,0.00055842934,0.0014607448,0.00026291976,0.00043334637,0.00044148983,0.00065380806,0.0007494204],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004218874,0.00015219722,0.8507078,0.00006799543,0.0002308726,0.00017256338,0.000424081,0.019808631,0.0010227655,0.0021170902,0.02070879,0.104165204],"study_design_scores_gemma":[0.000027487044,0.000060509137,0.67899394,0.000087774526,0.00023688049,0.00023443041,0.0013862521,0.3051264,0.0017174915,0.0020394821,0.009992125,0.00009730293],"about_ca_topic_score_codex":0.93145984,"about_ca_topic_score_gemma":0.9377088,"teacher_disagreement_score":0.068540156,"about_ca_system_score_codex":0.003705749,"about_ca_system_score_gemma":0.004724029,"threshold_uncertainty_score":0.13788754},"labels":[],"label_agreement":null},{"id":"W4386719223","doi":"10.1007/978-3-031-43075-6_24","title":"MMDF-ESI: Multi-Modal Deep Fusion of EEG and MEG for Brain Source Imaging","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Western University","funders":"","keywords":"Computer science; Electroencephalography; Modal; Magnetoencephalography; Artificial intelligence; Speech recognition; Computer vision; Neuroscience; Psychology; Materials science","score_opus":0.03360124244529334,"score_gpt":0.2705080776452222,"score_spread":0.2369068351999289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386719223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083674554,0.0018815349,0.9883364,0.00021565497,0.0002511957,0.00003023834,0.0010399944,0.0042808466,0.0031273619],"genre_scores_gemma":[0.025389722,0.004617191,0.9372619,0.0004088588,0.000430279,0.00020096617,0.004270126,0.0017151836,0.0257058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983144,0.000022165976,0.000010929297,0.000042289677,0.00007887366,0.000014190159],"domain_scores_gemma":[0.9997806,0.00009833551,0.000013431023,0.000042230582,0.0000487658,0.000016609285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049683446,0.0011479947,0.00058725604,0.00078342535,0.00015532234,0.0010469975,0.0012960037,0.0011377498,0.021160176],"category_scores_gemma":[0.00091575953,0.00051398075,0.000791968,0.001188973,0.0002921428,0.0012498338,0.001478687,0.0013135382,0.011342919],"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.00010785846,0.000055649063,0.00019391911,0.00032398052,0.00011101323,0.000143222,0.000051170533,0.015361617,0.03232809,0.013403133,0.08027927,0.8576411],"study_design_scores_gemma":[0.000045424542,0.00017486828,0.0017563333,0.00015971316,0.00010130034,0.001632113,0.000045509572,0.5984187,0.0695271,0.07990419,0.24810712,0.00012772462],"about_ca_topic_score_codex":0.0009456375,"about_ca_topic_score_gemma":0.0025230472,"teacher_disagreement_score":0.021160176,"about_ca_system_score_codex":0.00023863543,"about_ca_system_score_gemma":0.0003335305,"threshold_uncertainty_score":0.07078785},"labels":[],"label_agreement":null},{"id":"W4386729029","doi":"10.1007/978-3-031-42823-4_20","title":"A Novel Self-supervised Representation Learning Model for an Open-Set Speaker Recognition","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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 Calgary","funders":"","keywords":"Computer science; Speaker recognition; Speech recognition; Artificial intelligence; Cluster analysis; Biometrics; Feature learning; Pattern recognition (psychology); Generalization; Cosine similarity; Representation (politics)","score_opus":0.1366916856664875,"score_gpt":0.32034331849955155,"score_spread":0.18365163283306404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386729029","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.005266764,0.00026736147,0.9917419,0.00015117785,0.000092198374,0.000039855342,0.00011858686,0.0015927921,0.00072938815],"genre_scores_gemma":[0.30922157,0.00051304686,0.6667799,0.0006983418,0.00045735412,0.00049346057,0.0019617018,0.0005180811,0.019356597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989164,0.0002500571,0.00005106501,0.00040034915,0.00026431223,0.000117795535],"domain_scores_gemma":[0.9990146,0.00036896075,0.00006268562,0.00016046966,0.0003440601,0.000049207152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306197,0.00089171325,0.0014375199,0.00062733365,0.00053239823,0.00095710147,0.0033566293,0.0017973155,0.0035805593],"category_scores_gemma":[0.002314719,0.00055901625,0.0013429079,0.00070865423,0.0005617033,0.0020023326,0.0019238245,0.0027953014,0.0030860151],"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.00036213754,0.00032060314,0.0006691314,0.000104037405,0.0001949965,0.00009183038,0.00010455223,0.16769257,0.01847189,0.009694515,0.0117314095,0.7905623],"study_design_scores_gemma":[0.0000056532426,0.000024908213,0.00008935939,0.0000031190234,0.00001213956,0.00002693762,0.000003393063,0.99620336,0.0016506535,0.0014187003,0.00055452774,0.000007245103],"about_ca_topic_score_codex":0.006096799,"about_ca_topic_score_gemma":0.008325799,"teacher_disagreement_score":0.006096799,"about_ca_system_score_codex":0.0007396227,"about_ca_system_score_gemma":0.00095343776,"threshold_uncertainty_score":0.012122631},"labels":[],"label_agreement":null},{"id":"W4386798086","doi":"10.1007/978-3-031-43412-9","title":"Machine Learning and Knowledge Discovery in Databases: Research Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":3,"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":"Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Rheinische Friedrich-Wilhelms-Universität Bonn; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Tsinghua University; Universidad Carlos III de Madrid; Universitat Politècnica de València; Humboldt-Universität zu Berlin; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Zhejiang University; Keele University; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; Shanghai Jiao Tong University; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; China University of Petroleum, Beijing; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Griffith University; University of South Australia; RMIT University; University of Electronic Science and Technology of China; Technische Universität Kaiserslautern; Monash University; Univerzita Karlova v Praze; University College Dublin; Jilin University; National University of Singapore; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Universität Heidelberg; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; University of Bath; University of Oxford; Indian National Science Academy; University of Exeter; Sorbonne Université; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Uniwersytet Warszawski; Universität Bielefeld; Amazon Web Services; Itä-Suomen Yliopisto; Universidad Complutense de Madrid; Universidad de Castilla-La Mancha; Alibaba DAMO Academy; Amherst College; Indian Institute of Technology Jodhpur; Department for Enterprise, Trade and Investment, UK Government; University of Waikato; University of Ottawa; West Virginia University; Technische Universität Darmstadt; Università degli Studi di Trento; Michigan State University; Università degli Studi di Firenze; Université du Luxembourg; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Eidgenössische Technische Hochschule Zürich; Università Degli Studi di Modena e Reggio Emila; Université de Caen Normandie; Umeå Universitet; Helsingin Yliopisto; Carnegie Mellon University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Malmö Högskola; University of Notre Dame; Xidian University; Università degli Studi di Cagliari; Florida Atlantic University; Aarhus Universitet; Universiteit Leiden; George Mason University; Universitetet i Oslo; Philipps-Universität Marburg; Universidad del Atlántico; Università di Macerata; University of Minnesota","keywords":"Computer science; Knowledge extraction; Track (disk drive); Database; Artificial intelligence; Information retrieval; Data science; Machine learning","score_opus":0.06204229511465486,"score_gpt":0.36040188294869824,"score_spread":0.29835958783404337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386798086","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030632922,0.7174802,0.10543935,0.02007493,0.032861445,0.0008188813,0.0061515667,0.004652287,0.10945813],"genre_scores_gemma":[0.01125019,0.5616077,0.10684257,0.0040239384,0.01848259,0.00043708002,0.01221977,0.0015632358,0.28357294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982408,0.00019777723,0.00015239841,0.00036164242,0.00093144004,0.000115956296],"domain_scores_gemma":[0.99293077,0.0023004755,0.00032519453,0.000645149,0.0028825854,0.00091584603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040297844,0.0015631581,0.0031662951,0.005964602,0.00089550635,0.006882764,0.0026292447,0.0017132033,0.04284674],"category_scores_gemma":[0.0055873413,0.0014616284,0.0016265234,0.018633913,0.0008850637,0.0104907835,0.002585043,0.0036037862,0.03508946],"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.000078591125,0.00012110657,0.00026487664,0.0014409571,0.000060390914,0.000025975443,0.000034208842,0.0006985192,0.0008769226,0.011335281,0.5715463,0.4135169],"study_design_scores_gemma":[0.00006558955,0.00027014324,0.001736551,0.0013317362,0.000102520826,0.0004292582,0.0000742401,0.0062328973,0.0020015945,0.02025156,0.9674448,0.000059248385],"about_ca_topic_score_codex":0.0036977457,"about_ca_topic_score_gemma":0.0050701727,"teacher_disagreement_score":0.04284674,"about_ca_system_score_codex":0.0023942832,"about_ca_system_score_gemma":0.004813984,"threshold_uncertainty_score":0.1433366},"labels":[],"label_agreement":null},{"id":"W4386798147","doi":"10.1007/978-3-031-43412-9_1","title":"Learning Objective-Specific Active Learning Strategies with Attentive Neural Processes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Canadian Institute for Advanced Research","funders":"","keywords":"Computer science; Machine learning; Oracle; Artificial intelligence; Scalability; Active learning (machine learning); Classifier (UML); Exploit; Artificial neural network; Learning classifier system; Stability (learning theory); Process (computing); Database","score_opus":0.015418009766857836,"score_gpt":0.24466715370042816,"score_spread":0.22924914393357032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386798147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016915461,0.00044839145,0.97722614,0.00014976208,0.00008721519,0.000040191037,0.000019168026,0.00037420745,0.0047393353],"genre_scores_gemma":[0.74405783,0.00062570337,0.24318112,0.00038727565,0.00018318495,0.00026052597,0.00011736118,0.00022613203,0.010960878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995455,0.00014208272,0.000035859925,0.00012216053,0.00010098184,0.000053389977],"domain_scores_gemma":[0.99732816,0.0019755505,0.00014896042,0.00023626516,0.00021925246,0.00009185984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017158918,0.0012085807,0.00080986624,0.00044084617,0.00027664332,0.0016577289,0.0021710848,0.0014878609,0.003902678],"category_scores_gemma":[0.006646296,0.0006518271,0.0005427012,0.0005062227,0.0008669734,0.0029930382,0.0019534633,0.0025120836,0.0006933358],"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.00028512877,0.0004108647,0.001058746,0.00026022273,0.00020452385,0.00011458074,0.00034838586,0.367279,0.01138382,0.10874966,0.004229735,0.5056753],"study_design_scores_gemma":[0.000021360804,0.000080349186,0.00009253322,0.00001993413,0.000028389019,0.000023036328,0.000014554361,0.9514507,0.0021663061,0.04541839,0.00067441026,0.000010007779],"about_ca_topic_score_codex":0.000667498,"about_ca_topic_score_gemma":0.0012401609,"teacher_disagreement_score":0.003902678,"about_ca_system_score_codex":0.00041125316,"about_ca_system_score_gemma":0.00044675253,"threshold_uncertainty_score":0.013055742},"labels":[],"label_agreement":null},{"id":"W4386798317","doi":"10.1007/978-3-031-43427-3","title":"Machine Learning and Knowledge Discovery in Databases: Applied Data Science and Demo Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Rheinische Friedrich-Wilhelms-Universität Bonn; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Tsinghua University; Universidad Carlos III de Madrid; Universitat Politècnica de València; Humboldt-Universität zu Berlin; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Zhejiang University; Keele University; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; Shanghai Jiao Tong University; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; China University of Petroleum, Beijing; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Griffith University; University of South Australia; RMIT University; University of Electronic Science and Technology of China; Technische Universität Kaiserslautern; Monash University; Univerzita Karlova v Praze; University College Dublin; Jilin University; National University of Singapore; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Universität Heidelberg; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; University of Bath; University of Oxford; Indian National Science Academy; University of Exeter; Sorbonne Université; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Uniwersytet Warszawski; Universität Bielefeld; Amazon Web Services; Itä-Suomen Yliopisto; Universidad Complutense de Madrid; Universidad de Castilla-La Mancha; Alibaba DAMO Academy; Amherst College; Indian Institute of Technology Jodhpur; Department for Enterprise, Trade and Investment, UK Government; University of Waikato; University of Ottawa; West Virginia University; Technische Universität Darmstadt; Università degli Studi di Trento; Michigan State University; Università degli Studi di Firenze; Université du Luxembourg; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Eidgenössische Technische Hochschule Zürich; Università Degli Studi di Modena e Reggio Emila; Université de Caen Normandie; Umeå Universitet; Helsingin Yliopisto; Carnegie Mellon University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Malmö Högskola; University of Notre Dame; Xidian University; Università degli Studi di Cagliari; Florida Atlantic University; Aarhus Universitet; Universiteit Leiden; George Mason University; Universitetet i Oslo; Philipps-Universität Marburg; Universidad del Atlántico; Università di Macerata; University of Minnesota","keywords":"Computer science; Track (disk drive); Database; Knowledge extraction; Information retrieval; Artificial intelligence; Data science; Operating system","score_opus":0.036909266588763645,"score_gpt":0.3015205930331806,"score_spread":0.2646113264444169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386798317","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004237314,0.5392557,0.22475652,0.0428114,0.02524987,0.0006024951,0.0049669314,0.0053551546,0.15276468],"genre_scores_gemma":[0.02322544,0.42111227,0.18462595,0.005090329,0.017161988,0.00041824748,0.0076499106,0.0025236185,0.33819216],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982584,0.00020637023,0.00011043348,0.00027001236,0.0010668661,0.000087882],"domain_scores_gemma":[0.9920385,0.0031757443,0.00021777241,0.0010238751,0.0025384848,0.001005671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059064277,0.0013474347,0.0024530792,0.0052483454,0.00088518055,0.007171706,0.0025038705,0.0014584673,0.036743633],"category_scores_gemma":[0.006069629,0.0015037339,0.0015304994,0.014145229,0.0015187141,0.014427958,0.0028756738,0.005218133,0.020267218],"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.00007570576,0.00012788836,0.00033736875,0.00079184945,0.000046999783,0.00003263749,0.000073720235,0.0013122965,0.0008303071,0.034348972,0.54219663,0.4198256],"study_design_scores_gemma":[0.00003926453,0.00012993944,0.001243289,0.0006347008,0.000045489654,0.00037633372,0.000096372896,0.019045984,0.0019066473,0.056838926,0.9195898,0.00005320603],"about_ca_topic_score_codex":0.0043827114,"about_ca_topic_score_gemma":0.0047141723,"teacher_disagreement_score":0.036743633,"about_ca_system_score_codex":0.002810859,"about_ca_system_score_gemma":0.0032679152,"threshold_uncertainty_score":0.12291974},"labels":[],"label_agreement":null},{"id":"W4386798597","doi":"10.1007/978-3-031-43427-3_34","title":"OptMSM: Optimizing Multi-Scenario Modeling for Click-Through Rate Prediction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Embedding; Set (abstract data type); Orthogonality; Machine learning; Focus (optics); Theoretical computer science; Artificial intelligence; Human–computer interaction; Programming language","score_opus":0.07643077492810861,"score_gpt":0.29558436704522845,"score_spread":0.21915359211711982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386798597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115189785,0.0004694258,0.9808189,0.00026325908,0.00009772157,0.00009511971,0.0009578939,0.0047919275,0.0009866697],"genre_scores_gemma":[0.35839498,0.00050409214,0.6286232,0.00036668064,0.00022968302,0.00051492057,0.0037481212,0.0008315142,0.006786864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990816,0.00034298078,0.00004880035,0.00025328822,0.00017969853,0.000093513896],"domain_scores_gemma":[0.99775875,0.001582411,0.00009913874,0.00023785666,0.00023285869,0.00008892242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019581395,0.0013711812,0.0022493664,0.0012619729,0.0005968661,0.0014497677,0.0030937865,0.0022669835,0.0044603017],"category_scores_gemma":[0.005963086,0.0013327701,0.0019311889,0.001788094,0.00043321875,0.0017623503,0.0012915769,0.002387216,0.0020567696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011124054,0.00010737556,0.00087398884,0.00005850945,0.00013269535,0.0000476568,0.000025866062,0.91723114,0.00059422257,0.0031494326,0.005399551,0.07226836],"study_design_scores_gemma":[0.0000025964591,0.0000040235154,0.000037123227,0.0000014496084,0.0000026852383,0.000004018852,0.0000010153644,0.9988073,0.0000612576,0.00096231163,0.00011415038,0.000002031809],"about_ca_topic_score_codex":0.026834494,"about_ca_topic_score_gemma":0.029787362,"teacher_disagreement_score":0.026834494,"about_ca_system_score_codex":0.0012613666,"about_ca_system_score_gemma":0.001588467,"threshold_uncertainty_score":0.053356588},"labels":[],"label_agreement":null},{"id":"W4386803989","doi":"10.1007/978-3-031-43418-1_35","title":"Exploring Word-Sememe Graph-Centric Chinese Antonym Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Ambiguity; Leverage (statistics); Transitive relation; Inference; Graph; Word (group theory); Information retrieval; Theoretical computer science; Linguistics; Mathematics","score_opus":0.035016672826055646,"score_gpt":0.26338349275181117,"score_spread":0.22836681992575553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386803989","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.7413822,0.0037953367,0.2179618,0.00058903947,0.00054496754,0.0003902716,0.006203178,0.007542067,0.021591231],"genre_scores_gemma":[0.8490093,0.001024864,0.13076249,0.00020927461,0.00017810026,0.00012891168,0.010475419,0.00065697095,0.007554597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936885,0.00009685131,0.000047515274,0.00024286847,0.00014162408,0.00010220966],"domain_scores_gemma":[0.9990396,0.00038181472,0.00010237263,0.000111060865,0.00029812386,0.000067011206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047304106,0.0010956972,0.00082852633,0.004318594,0.0008914711,0.0012453893,0.0010069947,0.000612813,0.0049420283],"category_scores_gemma":[0.0019390086,0.00028133288,0.00077553914,0.0044883336,0.00041833005,0.0018978574,0.0016704306,0.00064412376,0.002619908],"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.0012569614,0.00029902082,0.020880016,0.0013996045,0.000267415,0.002691616,0.0011057152,0.0034309053,0.18758683,0.0077341204,0.016987344,0.7563605],"study_design_scores_gemma":[0.00019546687,0.00087143463,0.09945017,0.00021284993,0.0008397987,0.0061503155,0.004859283,0.64635736,0.15238681,0.03277716,0.055722468,0.00017684289],"about_ca_topic_score_codex":0.0054479414,"about_ca_topic_score_gemma":0.010066857,"teacher_disagreement_score":0.0054479414,"about_ca_system_score_codex":0.00041064472,"about_ca_system_score_gemma":0.0011716807,"threshold_uncertainty_score":0.01653272},"labels":[],"label_agreement":null},{"id":"W4386804175","doi":"10.1007/978-3-031-43418-1_3","title":"ChiENN: Embracing Molecular Chirality with Graph Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Chirality (physics); Cheminformatics; Enantiomer; Graph; Artificial neural network; Artificial intelligence; Context (archaeology); Node (physics); Theoretical computer science; Chemistry; Computational chemistry; Stereochemistry; Physics","score_opus":0.018622404001528883,"score_gpt":0.26897128176663965,"score_spread":0.2503488777651108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386804175","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.00819682,0.008931834,0.8599194,0.0034133631,0.001910294,0.00006765475,0.0005708923,0.008330102,0.108659536],"genre_scores_gemma":[0.15784116,0.013906611,0.72673565,0.0017076022,0.0010596269,0.00018984887,0.0011858089,0.002878007,0.09449559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987006,0.000023778248,0.000003783559,0.000024016794,0.000066407236,0.000011919498],"domain_scores_gemma":[0.9996879,0.00016959687,0.000011340802,0.000050327075,0.000049451613,0.000031461008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033319712,0.00053073815,0.00037883085,0.00061666174,0.00033425726,0.00094232504,0.0011320615,0.00083815434,0.0146503365],"category_scores_gemma":[0.0012422842,0.00034969754,0.0003306898,0.00091262243,0.00065128657,0.0019177509,0.001142721,0.001747068,0.003854902],"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.00004964246,0.00007458558,0.00022137568,0.0002757812,0.00004623203,0.00008152578,0.00007261273,0.09715239,0.0051736576,0.27095237,0.113340706,0.5125592],"study_design_scores_gemma":[0.00001786058,0.000028114238,0.00015132289,0.000082838196,0.000015284777,0.00009039341,0.000025072326,0.4506057,0.0059116096,0.38595974,0.15708147,0.000030637042],"about_ca_topic_score_codex":0.0017972044,"about_ca_topic_score_gemma":0.003715291,"teacher_disagreement_score":0.0146503365,"about_ca_system_score_codex":0.0004698898,"about_ca_system_score_gemma":0.00041406776,"threshold_uncertainty_score":0.049010277},"labels":[],"label_agreement":null},{"id":"W4386804220","doi":"10.1007/978-3-031-43418-1_19","title":"GDM: Dual Mixup for Graph Classification with Limited Supervision","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural 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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.03549631398267874,"score_gpt":0.2598367178325238,"score_spread":0.22434040384984508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386804220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111569455,0.00087887864,0.94646025,0.00065506814,0.00034515304,0.00035416565,0.0029048438,0.033661872,0.0035828424],"genre_scores_gemma":[0.09786911,0.00031740408,0.8716494,0.0007110249,0.0002271946,0.0007021671,0.010116151,0.0032431548,0.015164352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873954,0.00026451482,0.000062565225,0.00046822272,0.00033296234,0.00013220425],"domain_scores_gemma":[0.99852175,0.00052146334,0.00006765871,0.00056688424,0.00019536386,0.00012692797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012849682,0.00259847,0.0023940792,0.0027210163,0.0010330506,0.0022144672,0.0050796564,0.0028632446,0.022858784],"category_scores_gemma":[0.0050938097,0.0014996171,0.0022726723,0.0025793642,0.0010421809,0.0041947737,0.0054588164,0.0050261095,0.012491735],"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.0005655071,0.00037607955,0.0006748551,0.0003670054,0.0001898056,0.00012050716,0.000084268475,0.039634433,0.005742245,0.012073752,0.071772724,0.8683988],"study_design_scores_gemma":[0.00010308954,0.000106746986,0.00023408009,0.000048544014,0.000041779444,0.00007364941,0.000044013486,0.93101954,0.0052578575,0.052079774,0.010965267,0.000025693756],"about_ca_topic_score_codex":0.004941189,"about_ca_topic_score_gemma":0.010371831,"teacher_disagreement_score":0.022858784,"about_ca_system_score_codex":0.0012728542,"about_ca_system_score_gemma":0.00180292,"threshold_uncertainty_score":0.076470196},"labels":[],"label_agreement":null},{"id":"W4386804229","doi":"10.1007/978-3-031-43418-1","title":"Machine Learning and Knowledge Discovery in Databases: Research Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Rheinische Friedrich-Wilhelms-Universität Bonn; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Tsinghua University; Universidad Carlos III de Madrid; Universitat Politècnica de València; Humboldt-Universität zu Berlin; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Zhejiang University; Keele University; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; Shanghai Jiao Tong University; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; China University of Petroleum, Beijing; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Griffith University; University of South Australia; RMIT University; University of Electronic Science and Technology of China; Technische Universität Kaiserslautern; Monash University; Univerzita Karlova v Praze; University College Dublin; Jilin University; National University of Singapore; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Universität Heidelberg; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; University of Bath; University of Oxford; Indian National Science Academy; University of Exeter; Sorbonne Université; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Uniwersytet Warszawski; Universität Bielefeld; Amazon Web Services; Itä-Suomen Yliopisto; Universidad Complutense de Madrid; Universidad de Castilla-La Mancha; Alibaba DAMO Academy; Amherst College; Indian Institute of Technology Jodhpur; Department for Enterprise, Trade and Investment, UK Government; University of Waikato; University of Ottawa; West Virginia University; Technische Universität Darmstadt; Università degli Studi di Trento; Michigan State University; Università degli Studi di Firenze; Université du Luxembourg; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Eidgenössische Technische Hochschule Zürich; Università Degli Studi di Modena e Reggio Emila; Université de Caen Normandie; Umeå Universitet; Helsingin Yliopisto; Carnegie Mellon University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Malmö Högskola; University of Notre Dame; Xidian University; Università degli Studi di Cagliari; Florida Atlantic University; Aarhus Universitet; Universiteit Leiden; George Mason University; Universitetet i Oslo; Philipps-Universität Marburg; Universidad del Atlántico; Università di Macerata; University of Minnesota","keywords":"Computer science; Track (disk drive); Database; Knowledge extraction; Artificial intelligence; Information retrieval; Operating system","score_opus":0.06204229511465486,"score_gpt":0.36040188294869824,"score_spread":0.29835958783404337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386804229","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030632922,0.7174802,0.10543935,0.02007493,0.032861445,0.0008188813,0.0061515667,0.004652287,0.10945813],"genre_scores_gemma":[0.01125019,0.5616077,0.10684257,0.0040239384,0.01848259,0.00043708002,0.01221977,0.0015632358,0.28357294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982408,0.00019777723,0.00015239841,0.00036164242,0.00093144004,0.000115956296],"domain_scores_gemma":[0.99293077,0.0023004755,0.00032519453,0.000645149,0.0028825854,0.00091584603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040297844,0.0015631581,0.0031662951,0.005964602,0.00089550635,0.006882764,0.0026292447,0.0017132033,0.04284674],"category_scores_gemma":[0.0055873413,0.0014616284,0.0016265234,0.018633913,0.0008850637,0.0104907835,0.002585043,0.0036037862,0.03508946],"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.000078591125,0.00012110657,0.00026487664,0.0014409571,0.000060390914,0.000025975443,0.000034208842,0.0006985192,0.0008769226,0.011335281,0.5715463,0.4135169],"study_design_scores_gemma":[0.00006558955,0.00027014324,0.001736551,0.0013317362,0.000102520826,0.0004292582,0.0000742401,0.0062328973,0.0020015945,0.02025156,0.9674448,0.000059248385],"about_ca_topic_score_codex":0.0036977457,"about_ca_topic_score_gemma":0.0050701727,"teacher_disagreement_score":0.04284674,"about_ca_system_score_codex":0.0023942832,"about_ca_system_score_gemma":0.004813984,"threshold_uncertainty_score":0.1433366},"labels":[],"label_agreement":null},{"id":"W4386804666","doi":"10.1007/978-3-031-43415-0","title":"Machine Learning and Knowledge Discovery in Databases: Research Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Rheinische Friedrich-Wilhelms-Universität Bonn; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Tsinghua University; Universidad Carlos III de Madrid; Universitat Politècnica de València; Humboldt-Universität zu Berlin; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Zhejiang University; Keele University; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; Shanghai Jiao Tong University; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; China University of Petroleum, Beijing; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Griffith University; University of South Australia; RMIT University; University of Electronic Science and Technology of China; Technische Universität Kaiserslautern; Monash University; Univerzita Karlova v Praze; University College Dublin; Jilin University; National University of Singapore; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Universität Heidelberg; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; University of Bath; University of Oxford; Indian National Science Academy; University of Exeter; Sorbonne Université; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Uniwersytet Warszawski; Universität Bielefeld; Amazon Web Services; Itä-Suomen Yliopisto; Universidad Complutense de Madrid; Universidad de Castilla-La Mancha; Alibaba DAMO Academy; Amherst College; Indian Institute of Technology Jodhpur; Department for Enterprise, Trade and Investment, UK Government; University of Waikato; University of Ottawa; West Virginia University; Technische Universität Darmstadt; Università degli Studi di Trento; Michigan State University; Università degli Studi di Firenze; Université du Luxembourg; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Eidgenössische Technische Hochschule Zürich; Università Degli Studi di Modena e Reggio Emila; Université de Caen Normandie; Umeå Universitet; Helsingin Yliopisto; Carnegie Mellon University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Malmö Högskola; University of Notre Dame; Xidian University; Università degli Studi di Cagliari; Florida Atlantic University; Aarhus Universitet; Universiteit Leiden; George Mason University; Universitetet i Oslo; Philipps-Universität Marburg; Universidad del Atlántico; Università di Macerata; University of Minnesota","keywords":"Computer science; Track (disk drive); Database; Knowledge extraction; Information retrieval; Artificial intelligence; Operating system","score_opus":0.06204229511465486,"score_gpt":0.36040188294869824,"score_spread":0.29835958783404337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386804666","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030632922,0.7174802,0.10543935,0.02007493,0.032861445,0.0008188813,0.0061515667,0.004652287,0.10945813],"genre_scores_gemma":[0.01125019,0.5616077,0.10684257,0.0040239384,0.01848259,0.00043708002,0.01221977,0.0015632358,0.28357294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982408,0.00019777723,0.00015239841,0.00036164242,0.00093144004,0.000115956296],"domain_scores_gemma":[0.99293077,0.0023004755,0.00032519453,0.000645149,0.0028825854,0.00091584603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040297844,0.0015631581,0.0031662951,0.005964602,0.00089550635,0.006882764,0.0026292447,0.0017132033,0.04284674],"category_scores_gemma":[0.0055873413,0.0014616284,0.0016265234,0.018633913,0.0008850637,0.0104907835,0.002585043,0.0036037862,0.03508946],"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.000078591125,0.00012110657,0.00026487664,0.0014409571,0.000060390914,0.000025975443,0.000034208842,0.0006985192,0.0008769226,0.011335281,0.5715463,0.4135169],"study_design_scores_gemma":[0.00006558955,0.00027014324,0.001736551,0.0013317362,0.000102520826,0.0004292582,0.0000742401,0.0062328973,0.0020015945,0.02025156,0.9674448,0.000059248385],"about_ca_topic_score_codex":0.0036977457,"about_ca_topic_score_gemma":0.0050701727,"teacher_disagreement_score":0.04284674,"about_ca_system_score_codex":0.0023942832,"about_ca_system_score_gemma":0.004813984,"threshold_uncertainty_score":0.1433366},"labels":[],"label_agreement":null},{"id":"W4386804672","doi":"10.1007/978-3-031-43415-0_18","title":"Fairness in Multi-Task Learning via Wasserstein Barycenters","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Computer science; Task (project management); Artificial intelligence; Machine learning; Bridge (graph theory); Multi-task learning; Binary number; Univariate; Representation (politics); Field (mathematics); Mathematics; Multivariate statistics","score_opus":0.051126648676571546,"score_gpt":0.33557050462475396,"score_spread":0.28444385594818244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386804672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01362972,0.00061146845,0.98217183,0.0006258064,0.000093048955,0.000063029824,0.000062487336,0.00019640145,0.0025462196],"genre_scores_gemma":[0.7023234,0.0010539748,0.28120828,0.0006268748,0.00057022943,0.0007520754,0.00029561835,0.00058929436,0.0125801945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.988242,0.007534362,0.00047136328,0.0016257637,0.0013054207,0.00082112296],"domain_scores_gemma":[0.9164612,0.07256137,0.0020905277,0.0043754987,0.0025302165,0.0019811545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022625541,0.0019033336,0.005687174,0.0018992833,0.002116376,0.0044037574,0.0054006856,0.0050054872,0.0062431106],"category_scores_gemma":[0.07791876,0.0019216769,0.0015919026,0.002518029,0.0065712654,0.011753282,0.008683708,0.0062493207,0.00087719207],"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.00044925904,0.00014740677,0.00064127747,0.00019075799,0.00010192988,0.00005060222,0.00027819385,0.4131873,0.00051415537,0.5361865,0.0025710552,0.04568159],"study_design_scores_gemma":[0.00002520743,0.000036502577,0.00007289534,0.000021033877,0.000009881176,0.000008848361,0.000013172646,0.65145665,0.00013692089,0.347956,0.00024515542,0.000017718146],"about_ca_topic_score_codex":0.00456153,"about_ca_topic_score_gemma":0.0033985644,"teacher_disagreement_score":0.022625541,"about_ca_system_score_codex":0.0042451816,"about_ca_system_score_gemma":0.0030290142,"threshold_uncertainty_score":0.11965668},"labels":[],"label_agreement":null},{"id":"W4386806325","doi":"10.1007/978-3-031-43430-3_15","title":"Multivariate Time-Series Anomaly Detection with Temporal Self-supervision and Graphs: Application to Vehicle Failure Prediction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Autoencoder; Anomaly detection; Artificial intelligence; Data mining; Key (lock); Graph; Adjacency list; Heuristic; Time series; Task (project management); Machine learning; Pattern recognition (psychology); Deep learning; Algorithm; Theoretical computer science","score_opus":0.006529374539151251,"score_gpt":0.21132515350623113,"score_spread":0.20479577896707987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386806325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037308957,0.00052310165,0.9596979,0.0001629219,0.00008946015,0.000017603135,0.00015066276,0.0013060566,0.00074338267],"genre_scores_gemma":[0.7100321,0.00073412305,0.28555727,0.00006278189,0.00017597844,0.000040600335,0.00042736673,0.00022700209,0.0027427115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998024,0.00005071029,0.000012443017,0.0000598529,0.00005939686,0.00001534838],"domain_scores_gemma":[0.99899584,0.0006365801,0.00010049296,0.00008283655,0.00014764648,0.000036537822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057484256,0.00057588867,0.0007712212,0.00068991655,0.00020561786,0.00047794927,0.0006577721,0.00048062674,0.0007869386],"category_scores_gemma":[0.0021146808,0.00027699803,0.0005969498,0.0012534173,0.00028979313,0.00066217344,0.0004701335,0.001030753,0.00019115533],"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.00017560473,0.00018087267,0.0024629529,0.000102554404,0.00008862808,0.00013326849,0.00007478694,0.48106897,0.0081528695,0.008756384,0.0049447487,0.4938583],"study_design_scores_gemma":[0.0000013454923,0.000009835062,0.000304036,9.1635576e-7,0.0000037217642,0.000014545526,0.0000025913903,0.99675757,0.00035362627,0.0023911982,0.00015834281,0.0000023476923],"about_ca_topic_score_codex":0.0042336415,"about_ca_topic_score_gemma":0.004455326,"teacher_disagreement_score":0.0042336415,"about_ca_system_score_codex":0.0003440747,"about_ca_system_score_gemma":0.000305491,"threshold_uncertainty_score":0.008417964},"labels":[],"label_agreement":null},{"id":"W4386806337","doi":"10.1007/978-3-031-43430-3","title":"Machine Learning and Knowledge Discovery in Databases: Applied Data Science and Demo Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences; Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidad de Castilla-La Mancha; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Universität zu Köln; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Universitat Politècnica de València; Humboldt-Universität zu Berlin; Malmö Högskola; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Uniwersytet Warszawski; Universität Bielefeld; Technische Universität Darmstadt; University of Electronic Science and Technology of China; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Rheinische Friedrich-Wilhelms-Universität Bonn; Westfälische Wilhelms-Universität Münster; Centre National de la Recherche Scientifique; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Zhejiang University; Keele University; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; University College Cork; Shanghai Jiao Tong University; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; Itä-Suomen Yliopisto; Amazon Web Services; Universidad Complutense de Madrid; China University of Petroleum, Beijing; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Queensland University of Technology; University of South Australia; RMIT University; Technische Universität Kaiserslautern; Monash University; Jilin University; National University of Singapore; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; University of Bath; University of Oxford; Universidad Carlos III de Madrid; Tsinghua University; Indian National Science Academy; University of Exeter; Sorbonne Université; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Amherst College; Department for Enterprise, Trade and Investment, UK Government; Universiteit van Amsterdam; Universität Heidelberg; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Indian Institute of Technology Jodhpur; University of Waikato; University of Ottawa; West Virginia University; Università degli Studi di Firenze; Université du Luxembourg; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Eidgenössische Technische Hochschule Zürich; Università Degli Studi di Modena e Reggio Emila; Nara Institute of Science and Technology; University of Notre Dame; Université de Caen Normandie; Umeå Universitet; Helsingin Yliopisto; Università di Pisa; Universidad Autónoma de Madrid; Scuola IMT Alti Studi Lucca; Carnegie Mellon University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Università degli Studi di Trento; Michigan State University; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Griffith University; Università degli Studi di Cagliari; Arizona State University; Xidian University; Florida Atlantic University; University College Dublin; Univerzita Karlova v Praze; Tongji University; Aarhus Universitet; Universiteit Leiden; George Mason University; Carl von Ossietzky Universität Oldenburg; Universitetet i Oslo; Philipps-Universität Marburg; Universidad del Atlántico; Università di Macerata; University of Minnesota","keywords":"Computer science; Track (disk drive); Knowledge extraction; Database; Information retrieval; Data science; World Wide Web; Artificial intelligence; Operating system","score_opus":0.036909266588763645,"score_gpt":0.3015205930331806,"score_spread":0.2646113264444169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386806337","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004237314,0.5392557,0.22475652,0.0428114,0.02524987,0.0006024951,0.0049669314,0.0053551546,0.15276468],"genre_scores_gemma":[0.02322544,0.42111227,0.18462595,0.005090329,0.017161988,0.00041824748,0.0076499106,0.0025236185,0.33819216],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982584,0.00020637023,0.00011043348,0.00027001236,0.0010668661,0.000087882],"domain_scores_gemma":[0.9920385,0.0031757443,0.00021777241,0.0010238751,0.0025384848,0.001005671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059064277,0.0013474347,0.0024530792,0.0052483454,0.00088518055,0.007171706,0.0025038705,0.0014584673,0.036743633],"category_scores_gemma":[0.006069629,0.0015037339,0.0015304994,0.014145229,0.0015187141,0.014427958,0.0028756738,0.005218133,0.020267218],"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.00007570576,0.00012788836,0.00033736875,0.00079184945,0.000046999783,0.00003263749,0.000073720235,0.0013122965,0.0008303071,0.034348972,0.54219663,0.4198256],"study_design_scores_gemma":[0.00003926453,0.00012993944,0.001243289,0.0006347008,0.000045489654,0.00037633372,0.000096372896,0.019045984,0.0019066473,0.056838926,0.9195898,0.00005320603],"about_ca_topic_score_codex":0.0043827114,"about_ca_topic_score_gemma":0.0047141723,"teacher_disagreement_score":0.036743633,"about_ca_system_score_codex":0.002810859,"about_ca_system_score_gemma":0.0032679152,"threshold_uncertainty_score":0.12291974},"labels":[],"label_agreement":null},{"id":"W4386811498","doi":"10.1007/978-3-031-42608-7_3","title":"$$\\textbf{CHA}_2$$: CHemistry Aware Convex Hull Autoencoder Towards Inverse Molecular Design","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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":"Defence Research and Development Canada; National Research Council Canada","funders":"","keywords":"Autoencoder; Computer science; Representation (politics); Chemical space; Subspace topology; Convex hull; Space (punctuation); Inverse; Theoretical computer science; Artificial intelligence; Algorithm; Regular polygon; Mathematics; Deep learning; Drug discovery; Chemistry","score_opus":0.0380096339275969,"score_gpt":0.2894601118650777,"score_spread":0.25145047793748077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811498","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.001178672,0.00049332686,0.9734169,0.00034134366,0.00031306758,0.000025611835,0.00034255316,0.0028682444,0.021020308],"genre_scores_gemma":[0.05960931,0.0018217186,0.78265464,0.00078168284,0.00037481493,0.00015533209,0.002718078,0.00290725,0.14897716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986124,0.00001834119,0.0000047609306,0.000027801916,0.000076893746,0.000010958722],"domain_scores_gemma":[0.999874,0.00004658962,0.000005669064,0.000027590017,0.000039635845,0.0000063987736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019113492,0.0006326905,0.00044939233,0.00033852234,0.0001846199,0.00079605146,0.0008049484,0.0008299066,0.027536433],"category_scores_gemma":[0.0005778612,0.0003340231,0.00033483963,0.0004619866,0.00035309946,0.0008015995,0.0007951735,0.0010972186,0.015547903],"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.00007426463,0.000072420626,0.000072811345,0.00025107086,0.000031141306,0.00006977867,0.00003072161,0.10891752,0.023932405,0.059885014,0.111467816,0.695195],"study_design_scores_gemma":[0.000011680483,0.000036471432,0.00013204072,0.000048446265,0.000011586381,0.00011655453,0.000008075117,0.83242196,0.025379553,0.034557022,0.10725001,0.000026672662],"about_ca_topic_score_codex":0.001634429,"about_ca_topic_score_gemma":0.0026107535,"teacher_disagreement_score":0.027536433,"about_ca_system_score_codex":0.000293306,"about_ca_system_score_gemma":0.00041676892,"threshold_uncertainty_score":0.0921185},"labels":[],"label_agreement":null},{"id":"W4386811795","doi":"10.1007/978-3-031-43421-1_16","title":"Exact Combinatorial Optimization with Temporo-Attentional Graph Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Combinatorial optimization; Solver; Bipartite graph; Heuristic; Quadratic assignment problem; Artificial intelligence; Graph; Theoretical computer science; Set (abstract data type); Optimization problem; Deep learning; Machine learning; Mathematical optimization; Algorithm; Mathematics","score_opus":0.009691492511790648,"score_gpt":0.22722486161378336,"score_spread":0.21753336910199272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811795","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.019133065,0.0012439097,0.94969666,0.0010922536,0.00036308085,0.00008542473,0.0003145096,0.00077617634,0.027294839],"genre_scores_gemma":[0.5229132,0.0010066518,0.44584182,0.0007979483,0.00044685582,0.0004590938,0.0007547545,0.0008933623,0.026886377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00018245637,0.000021403579,0.000120403914,0.00010051215,0.000097807344],"domain_scores_gemma":[0.99801815,0.0015043238,0.000086893895,0.00018276373,0.0001258138,0.000082139275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433437,0.0015338799,0.0019196311,0.00096587825,0.00071680086,0.002060895,0.0035207658,0.003081424,0.011367924],"category_scores_gemma":[0.006017353,0.0013031252,0.0012402484,0.0020967107,0.0015056954,0.0034803832,0.0020193397,0.0026899714,0.0011741057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009822904,0.00008999298,0.00013938293,0.00016450738,0.000047348854,0.00005380259,0.0000218477,0.868583,0.0003477003,0.08145921,0.008386076,0.040608913],"study_design_scores_gemma":[0.0000098646515,0.000008205661,0.000022834189,0.000007076259,0.000005390326,0.0000075615867,0.0000045379275,0.9583466,0.000059191294,0.04126129,0.00026376266,0.00000361462],"about_ca_topic_score_codex":0.0076966593,"about_ca_topic_score_gemma":0.011192888,"teacher_disagreement_score":0.011367924,"about_ca_system_score_codex":0.0020192887,"about_ca_system_score_gemma":0.0016652461,"threshold_uncertainty_score":0.038029492},"labels":[],"label_agreement":null},{"id":"W4386811880","doi":"10.1007/978-3-031-43421-1_18","title":"Fast Convergence of Random Reshuffling Under Over-Parameterization and the Polyak-Łojasiewicz Condition","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","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":"Canadian Institute for Advanced Research; University of British Columbia","funders":"","keywords":"Parameterized complexity; Convergence (economics); Permutation (music); Computer science; Stochastic gradient descent; Algorithm; Mathematics; Applied mathematics; Artificial intelligence; Artificial neural network","score_opus":0.01717722583237915,"score_gpt":0.2518321152477164,"score_spread":0.23465488941533727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811880","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.028628273,0.0012350522,0.9495226,0.0008163259,0.0002769329,0.00008607205,0.00013576477,0.000766947,0.018532109],"genre_scores_gemma":[0.69379604,0.0022532667,0.24322416,0.00085697323,0.00059550354,0.00062582653,0.00061858795,0.0021359895,0.055893667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971359,0.0011963318,0.00013551515,0.00045618037,0.0006268961,0.00044916596],"domain_scores_gemma":[0.9823398,0.013290516,0.00092528795,0.0017620797,0.0010519335,0.00063041534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005297177,0.0025500015,0.0029599383,0.0022054927,0.0014143122,0.0027676155,0.0030273108,0.0024756254,0.011332962],"category_scores_gemma":[0.031346075,0.0013633845,0.0020498333,0.0021716582,0.005015867,0.0077191982,0.0065851007,0.0046757646,0.0017556788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039754435,0.00006782069,0.0004723805,0.00026627275,0.00012256029,0.00015037037,0.00017588145,0.14972638,0.003912935,0.80609465,0.0053039747,0.03330915],"study_design_scores_gemma":[0.000030431967,0.000034259887,0.00014294639,0.00003048623,0.000018607921,0.000057848505,0.000023605495,0.658725,0.0011894173,0.3385186,0.0011909433,0.00003789216],"about_ca_topic_score_codex":0.004022203,"about_ca_topic_score_gemma":0.0024734195,"teacher_disagreement_score":0.011332962,"about_ca_system_score_codex":0.002513495,"about_ca_system_score_gemma":0.0015827992,"threshold_uncertainty_score":0.037912548},"labels":[],"label_agreement":null},{"id":"W4386811899","doi":"10.1007/978-3-031-43424-2_3","title":"Exploring the Training Robustness of Distributional Reinforcement Learning Against Noisy State Observations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Robustness (evolution); Bounded function; Mathematical optimization; Artificial intelligence; Markov decision process; Suite; Algorithm; Markov process; Mathematics; Statistics","score_opus":0.10254552285347575,"score_gpt":0.2689238549056029,"score_spread":0.16637833205212715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811899","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.08213944,0.0005928885,0.91210234,0.00069593923,0.00005609168,0.00004244805,0.00007240771,0.00063049246,0.0036679858],"genre_scores_gemma":[0.9552046,0.000261672,0.040597018,0.00017608065,0.00007718606,0.00007764053,0.0001645945,0.00022521251,0.0032158867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808633,0.00094045623,0.00007469205,0.00037742226,0.0003108716,0.00021024658],"domain_scores_gemma":[0.96922565,0.027677266,0.0009925758,0.0011313496,0.0006524355,0.00032065943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061583365,0.0010424411,0.001336949,0.0006787491,0.00041759992,0.0012432656,0.0021479249,0.0017918599,0.0021517507],"category_scores_gemma":[0.038170833,0.00084163685,0.0007174442,0.0005663529,0.0025567706,0.0027835446,0.0033368578,0.0028832133,0.0003122697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012711914,0.0000367906,0.0005426401,0.000050716142,0.0000443325,0.000040372594,0.000051328116,0.96541756,0.0012370141,0.014462188,0.00035966444,0.017630132],"study_design_scores_gemma":[0.0000042578336,0.00002568706,0.000088432294,0.000005389725,0.0000038556486,0.000007729501,0.0000042860747,0.98968875,0.00030545407,0.00981105,0.00005154778,0.000003471353],"about_ca_topic_score_codex":0.0031582953,"about_ca_topic_score_gemma":0.0014024636,"teacher_disagreement_score":0.0061583365,"about_ca_system_score_codex":0.0014286,"about_ca_system_score_gemma":0.0010377478,"threshold_uncertainty_score":0.032568812},"labels":[],"label_agreement":null},{"id":"W4386811929","doi":"10.1007/978-3-031-43424-2","title":"Machine Learning and Knowledge Discovery in Databases: Research Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences; Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Universität zu Köln; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Universitat Politècnica de València; Humboldt-Universität zu Berlin; Malmö Högskola; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Uniwersytet Warszawski; Universität Bielefeld; Technische Universität Darmstadt; University of Electronic Science and Technology of China; Xidian University; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Université de Caen Normandie; Umeå Universitet; Rheinische Friedrich-Wilhelms-Universität Bonn; Westfälische Wilhelms-Universität Münster; Centre National de la Recherche Scientifique; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; Leibniz-Gemeinschaft; Pennsylvania State University; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; China University of Petroleum, Beijing; Keele University; Zhejiang University; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Queensland University of Technology; University of South Australia; RMIT University; Technische Universität Kaiserslautern; Monash University; Shanghai Jiao Tong University; University College Cork; Université de La Réunion; Jilin University; National University of Singapore; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; Kunming University of Science and Technology; University of Bath; University of Oxford; Universidad Carlos III de Madrid; Tsinghua University; Indian National Science Academy; University of Exeter; Sorbonne Université; University of Texas Rio Grande Valley; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Eberhard Karls Universität Tübingen; Itä-Suomen Yliopisto; Amazon Web Services; Universidad Complutense de Madrid; Universidad de Castilla-La Mancha; Alibaba DAMO Academy; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Universität Passau; Università degli Studi di Firenze; Université du Luxembourg; Amherst College; Department for Enterprise, Trade and Investment, UK Government; Universiteit van Amsterdam; Huazhong University of Science and Technology; Universität Heidelberg; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Indian Institute of Technology Jodhpur; University of Waikato; University of Ottawa; West Virginia University; Eidgenössische Technische Hochschule Zürich; Nara Institute of Science and Technology; Università Degli Studi di Modena e Reggio Emila; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Philipps-Universität Marburg; Florida Atlantic University; University of Pennsylvania; University of Notre Dame; Helsingin Yliopisto; Carnegie Mellon University; Università degli Studi di Trento; Michigan State University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Griffith University; Arizona State University; Università degli Studi di Cagliari; University College Dublin; Univerzita Karlova v Praze; Universiteit Leiden; George Mason University; Universidad del Atlántico; Università di Macerata; University of Minnesota; Tongji University; Aarhus Universitet; Universitetet i Oslo; Carl von Ossietzky Universität Oldenburg","keywords":"Computer science; Knowledge extraction; Track (disk drive); Artificial intelligence; Database; Information retrieval; Machine learning; Data science","score_opus":0.06204229511465486,"score_gpt":0.36040188294869824,"score_spread":0.29835958783404337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811929","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030632922,0.7174802,0.10543935,0.02007493,0.032861445,0.0008188813,0.0061515667,0.004652287,0.10945813],"genre_scores_gemma":[0.01125019,0.5616077,0.10684257,0.0040239384,0.01848259,0.00043708002,0.01221977,0.0015632358,0.28357294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982408,0.00019777723,0.00015239841,0.00036164242,0.00093144004,0.000115956296],"domain_scores_gemma":[0.99293077,0.0023004755,0.00032519453,0.000645149,0.0028825854,0.00091584603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040297844,0.0015631581,0.0031662951,0.005964602,0.00089550635,0.006882764,0.0026292447,0.0017132033,0.04284674],"category_scores_gemma":[0.0055873413,0.0014616284,0.0016265234,0.018633913,0.0008850637,0.0104907835,0.002585043,0.0036037862,0.03508946],"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.000078591125,0.00012110657,0.00026487664,0.0014409571,0.000060390914,0.000025975443,0.000034208842,0.0006985192,0.0008769226,0.011335281,0.5715463,0.4135169],"study_design_scores_gemma":[0.00006558955,0.00027014324,0.001736551,0.0013317362,0.000102520826,0.0004292582,0.0000742401,0.0062328973,0.0020015945,0.02025156,0.9674448,0.000059248385],"about_ca_topic_score_codex":0.0036977457,"about_ca_topic_score_gemma":0.0050701727,"teacher_disagreement_score":0.04284674,"about_ca_system_score_codex":0.0023942832,"about_ca_system_score_gemma":0.004813984,"threshold_uncertainty_score":0.1433366},"labels":[],"label_agreement":null},{"id":"W4386811934","doi":"10.1007/978-3-031-43421-1","title":"Machine Learning and Knowledge Discovery in Databases: Research Track","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":5,"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":"Télécom Paris; University of Illinois at Urbana-Champaign; Malaviya National Institute of Technology, Jaipur; Région Normandie; Instituto Superior Técnico; Shanghai University of Electric Power; Université de Lyon; University of Thessaly; Stockholms Universitet; University of Science and Technology of China; Julius-Maximilians-Universität Würzburg; Instituto Federal Goiás; Universidade Federal de Pernambuco; Rheinische Friedrich-Wilhelms-Universität Bonn; Shandong Academy of Sciences; Southeast University; Nanjing University; Univerza v Ljubljani; Université de Rennes 1; Universidade Federal de Minas Gerais; Università della Calabria; Wuhan University; Università degli Studi di Torino; Aristotle University of Thessaloniki; Anschutz Medical Campus, University of Colorado; Syddansk Universitet; Tsinghua University; Universidad Carlos III de Madrid; Universitat Politècnica de València; Humboldt-Universität zu Berlin; International Institute of Information Technology, Hyderabad; Ludwig-Maximilians-Universität München; Université de Versailles Saint-Quentin-en-Yvelines; Universität Paderborn; National Central University; Shandong University; Politechnika Warszawska; Universiteit Gent; Sapienza Università di Roma; Renmin University of China; Zhejiang University; Keele University; Università degli Studi di Verona; Universität Potsdam; AstraZeneca; Gottfried Wilhelm Leibniz Universität Hannover; Shanghai Jiao Tong University; Leibniz-Gemeinschaft; Simon Fraser University; Università degli Studi di Padova; Université de Namur; Universität Wien; China University of Petroleum, Beijing; Université Paris-Saclay; Aalto-Yliopisto; KU Leuven; Kyungpook National University; Universiteit Maastricht; University of Technology Sydney; Technische Universiteit Delft; Griffith University; University of South Australia; RMIT University; University of Electronic Science and Technology of China; Technische Universität Kaiserslautern; Monash University; Univerzita Karlova v Praze; University College Dublin; Jilin University; National University of Singapore; Politecnico di Torino; Indian Institute of Technology Gandhinagar; Universität Heidelberg; Université de Strasbourg; Conservatoire National des Arts et Métiers; Blekinge Tekniska Högskola; Beihang University; Chongqing University; University of Twente; University of Bristol; University of Bath; University of Oxford; Indian National Science Academy; University of Exeter; Sorbonne Université; Kungliga Tekniska Högskolan; Iowa State University; Universidade do Porto; Indian Institute of Technology, Patna; Boise State University; Institut \"Jožef Stefan\"; Uniwersytet Warszawski; Universität Bielefeld; Amazon Web Services; Itä-Suomen Yliopisto; Universidad Complutense de Madrid; Universidad de Castilla-La Mancha; Alibaba DAMO Academy; Amherst College; Indian Institute of Technology Jodhpur; Department for Enterprise, Trade and Investment, UK Government; University of Waikato; University of Ottawa; West Virginia University; Technische Universität Darmstadt; Università degli Studi di Trento; Michigan State University; Università degli Studi di Firenze; Université du Luxembourg; Università di Pisa; Scuola IMT Alti Studi Lucca; Universidad Autónoma de Madrid; Universiteit Utrecht; Temple University; Zhengzhou University; Indian Council of Agricultural Research; Heilongjiang University; College of Engineering, Michigan State University; University of Wyoming; Eidgenössische Technische Hochschule Zürich; Università Degli Studi di Modena e Reggio Emila; Université de Caen Normandie; Umeå Universitet; Helsingin Yliopisto; Carnegie Mellon University; Högskolan i Halmstad; Universität Osnabrück; Korea Advanced Institute of Science and Technology; Università degli Studi di Napoli Federico II; Malmö Högskola; University of Notre Dame; Xidian University; Università degli Studi di Cagliari; Florida Atlantic University; Aarhus Universitet; Universiteit Leiden; George Mason University; Universitetet i Oslo; Philipps-Universität Marburg; Universidad del Atlántico; Università di Macerata; University of Minnesota","keywords":"Computer science; Knowledge extraction; Track (disk drive); Artificial intelligence; Database; Information retrieval; Data science; Machine learning; Operating system","score_opus":0.06204229511465486,"score_gpt":0.36040188294869824,"score_spread":0.29835958783404337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811934","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030632922,0.7174802,0.10543935,0.02007493,0.032861445,0.0008188813,0.0061515667,0.004652287,0.10945813],"genre_scores_gemma":[0.01125019,0.5616077,0.10684257,0.0040239384,0.01848259,0.00043708002,0.01221977,0.0015632358,0.28357294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982408,0.00019777723,0.00015239841,0.00036164242,0.00093144004,0.000115956296],"domain_scores_gemma":[0.99293077,0.0023004755,0.00032519453,0.000645149,0.0028825854,0.00091584603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040297844,0.0015631581,0.0031662951,0.005964602,0.00089550635,0.006882764,0.0026292447,0.0017132033,0.04284674],"category_scores_gemma":[0.0055873413,0.0014616284,0.0016265234,0.018633913,0.0008850637,0.0104907835,0.002585043,0.0036037862,0.03508946],"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.000078591125,0.00012110657,0.00026487664,0.0014409571,0.000060390914,0.000025975443,0.000034208842,0.0006985192,0.0008769226,0.011335281,0.5715463,0.4135169],"study_design_scores_gemma":[0.00006558955,0.00027014324,0.001736551,0.0013317362,0.000102520826,0.0004292582,0.0000742401,0.0062328973,0.0020015945,0.02025156,0.9674448,0.000059248385],"about_ca_topic_score_codex":0.0036977457,"about_ca_topic_score_gemma":0.0050701727,"teacher_disagreement_score":0.04284674,"about_ca_system_score_codex":0.0023942832,"about_ca_system_score_gemma":0.004813984,"threshold_uncertainty_score":0.1433366},"labels":[],"label_agreement":null},{"id":"W4386855168","doi":"10.1007/978-3-031-44237-7_26","title":"Fast Context Adaptation for Video Object Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Adaptation (eye); Segmentation; Artificial intelligence; Matching (statistics); Frame (networking); Computer vision; Jaccard index; Reference frame; Feature (linguistics); Context (archaeology); Object (grammar); Pattern recognition (psychology); Inference; Set (abstract data type); Image segmentation; Mathematics","score_opus":0.03504986155510286,"score_gpt":0.29649015754554503,"score_spread":0.26144029599044216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386855168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017307281,0.0035227423,0.97365767,0.00007404667,0.00021712424,0.00006584742,0.0002399119,0.0033487424,0.0015666705],"genre_scores_gemma":[0.2522215,0.002310702,0.7353682,0.0002556781,0.00030374303,0.0001594729,0.0011493447,0.00075103744,0.0074804337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.000058741603,0.000015092999,0.00012342213,0.00010452756,0.00006163869],"domain_scores_gemma":[0.9996799,0.00014234164,0.000016671722,0.000059720023,0.00008088438,0.00002040647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090803,0.0010084064,0.0013626432,0.0010260082,0.00041224406,0.0007249902,0.0011202066,0.00091377884,0.0032818974],"category_scores_gemma":[0.001103663,0.00051676313,0.00069848326,0.001532855,0.00028312358,0.00081707945,0.0010643901,0.0010639507,0.0016543124],"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.0004928972,0.00008709914,0.00030432205,0.00014060111,0.00006657241,0.00010942908,0.000044964454,0.026179213,0.07914338,0.001746449,0.0066752005,0.8850098],"study_design_scores_gemma":[0.000026550428,0.00008931803,0.0013532754,0.000023072318,0.000060140028,0.0002257572,0.000029801897,0.9523994,0.03641382,0.0036441674,0.005708872,0.000025905305],"about_ca_topic_score_codex":0.0071726153,"about_ca_topic_score_gemma":0.012020657,"teacher_disagreement_score":0.0071726153,"about_ca_system_score_codex":0.00044765326,"about_ca_system_score_gemma":0.0006014795,"threshold_uncertainty_score":0.014261723},"labels":[],"label_agreement":null},{"id":"W4386870537","doi":"10.1007/978-981-99-6207-5_21","title":"Adder Encoder for Pre-trained Language Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Adder; Benchmark (surveying); Transformer; Encoder; Efficient energy use; Energy consumption; Language model; Computer engineering; Artificial intelligence; Electrical engineering","score_opus":0.029698172063888126,"score_gpt":0.283785682589629,"score_spread":0.25408751052574086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386870537","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.017958717,0.0026371656,0.84191436,0.0014568041,0.002880151,0.0003890793,0.018973373,0.07118147,0.042608906],"genre_scores_gemma":[0.22891921,0.002476334,0.5589752,0.0014700295,0.0006285766,0.00075206667,0.038166534,0.0041500703,0.16446199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980503,0.000018903633,0.000014223981,0.0000686783,0.00005380914,0.000039460378],"domain_scores_gemma":[0.99968183,0.00008186521,0.000009311674,0.00007947136,0.00012824174,0.000019281966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023321345,0.0010790759,0.00063280447,0.0005934867,0.0004609272,0.0009885022,0.0011314626,0.0008548252,0.05866915],"category_scores_gemma":[0.00091307337,0.0005132946,0.00063958904,0.0005487752,0.00020228347,0.0014516914,0.0009832582,0.0016040305,0.034218118],"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.00045830067,0.0001276703,0.0004466206,0.00057387265,0.00007728817,0.0003492854,0.00007632336,0.013741702,0.064317934,0.024787651,0.16553435,0.729509],"study_design_scores_gemma":[0.00016474504,0.0002887159,0.0012456254,0.00022916755,0.00023963016,0.00096067536,0.00011646531,0.5087266,0.2164261,0.04473505,0.22674885,0.00011837183],"about_ca_topic_score_codex":0.007206737,"about_ca_topic_score_gemma":0.0142177865,"teacher_disagreement_score":0.05866915,"about_ca_system_score_codex":0.00069454144,"about_ca_system_score_gemma":0.0017540891,"threshold_uncertainty_score":0.19626784},"labels":[],"label_agreement":null},{"id":"W4386870585","doi":"10.1007/978-3-031-43980-3_18","title":"Dynamic Compact Planar Embeddings","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Planar; Vertex (graph theory); Computer science; Planar graph; Combinatorics; Polygon (computer graphics); Simple (philosophy); Enhanced Data Rates for GSM Evolution; Face (sociological concept); Planar straight-line graph; Graph; Set (abstract data type); Mathematics; 1-planar graph; Artificial intelligence; Computer graphics (images); Chordal graph; Telecommunications","score_opus":0.01652075080171293,"score_gpt":0.26229441082069027,"score_spread":0.24577366001897735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386870585","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068971485,0.0047115143,0.2810504,0.0022124837,0.0010940895,0.00009203142,0.0019204434,0.0015834075,0.6383641],"genre_scores_gemma":[0.47583655,0.008446029,0.08882142,0.00069684035,0.0007953262,0.000199706,0.005170861,0.0021295655,0.41790378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976414,0.000022414119,0.000008440349,0.00006052031,0.00010718437,0.000037359518],"domain_scores_gemma":[0.999762,0.00005206281,0.000027123793,0.000071569644,0.0000509825,0.000036184876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001437884,0.0009969501,0.00051584136,0.0011903316,0.00070115697,0.0018958405,0.0007630687,0.0006358854,0.031129258],"category_scores_gemma":[0.00095586665,0.0005054674,0.00035177177,0.0014840184,0.0008399976,0.00408726,0.0027755573,0.002271359,0.008988032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101071746,0.00003103584,0.00011285221,0.00014434928,0.000011048096,0.000106188476,0.00022270577,0.0042226017,0.0056432486,0.8234711,0.03302859,0.13290519],"study_design_scores_gemma":[0.000022140692,0.00005255704,0.0002699159,0.00007312531,0.00001756166,0.00060786126,0.00034171512,0.012979393,0.004837554,0.7555098,0.22526531,0.000023028231],"about_ca_topic_score_codex":0.0005041502,"about_ca_topic_score_gemma":0.0005690926,"teacher_disagreement_score":0.031129258,"about_ca_system_score_codex":0.0006854923,"about_ca_system_score_gemma":0.00025062723,"threshold_uncertainty_score":0.10413778},"labels":[],"label_agreement":null},{"id":"W4386870722","doi":"10.1007/978-3-031-43980-3_8","title":"Data Structures for SMEM-Finding in the PBWT","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Human Genome Research Institute; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Israel Institute for Biological Research; National Institutes of Health; National Science Foundation","keywords":"Computer science; Divergence (linguistics); Data structure; Set (abstract data type); Encoding (memory); Computation; Algorithm; Data set; Theoretical computer science; Auxiliary memory; Data mining; Artificial intelligence","score_opus":0.05422789153240863,"score_gpt":0.30670185235135405,"score_spread":0.2524739608189454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386870722","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.011675536,0.00060968084,0.75691545,0.0010343118,0.0004232276,0.00052682805,0.037163775,0.18137605,0.010275089],"genre_scores_gemma":[0.14926732,0.0007377326,0.7004021,0.0007283303,0.0002396646,0.0019871916,0.09954787,0.03458648,0.0125033045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761164,0.00042995354,0.00043736995,0.00044911896,0.00080356386,0.00026830193],"domain_scores_gemma":[0.99162126,0.002872679,0.00045537134,0.0036248218,0.0011968005,0.00022911129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002957716,0.00198661,0.0014972698,0.0029999043,0.0012888495,0.003391369,0.0037494989,0.0022716215,0.049051657],"category_scores_gemma":[0.015147352,0.0018063921,0.0025036072,0.0040335963,0.00134015,0.0063546794,0.004623826,0.0028013906,0.023011914],"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.003682321,0.0005746101,0.008207382,0.0020465495,0.0003009247,0.00065602065,0.0008153564,0.017116293,0.017989226,0.12383427,0.3261069,0.49867013],"study_design_scores_gemma":[0.0012574015,0.00043771675,0.0029093295,0.00072479044,0.00024780363,0.0008818643,0.0005391381,0.22007106,0.09267046,0.33590913,0.34397423,0.00037710808],"about_ca_topic_score_codex":0.0031945307,"about_ca_topic_score_gemma":0.0039283666,"teacher_disagreement_score":0.049051657,"about_ca_system_score_codex":0.001378419,"about_ca_system_score_gemma":0.0024764554,"threshold_uncertainty_score":0.16409415},"labels":[],"label_agreement":null},{"id":"W4386870861","doi":"10.1007/978-3-031-43980-3_12","title":"Space-Time Trade-Offs for the LCP Array of Wheeler DFAs","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Human Genome Research Institute","keywords":"De Bruijn sequence; Computer science; Logarithm; De Bruijn graph; Time complexity; Alphabet; Matching (statistics); Algorithm; Graph; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.017885274966969542,"score_gpt":0.2613994950617137,"score_spread":0.2435142200947442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386870861","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.3058998,0.0037214903,0.57945025,0.0020844117,0.0003218285,0.00010626723,0.00065009843,0.002529449,0.10523646],"genre_scores_gemma":[0.91915536,0.0004239872,0.0686243,0.00015218437,0.0000738631,0.00006194135,0.00017817982,0.00021883869,0.011111304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897075,0.00029404,0.000041741892,0.00013121968,0.0003229354,0.00023928455],"domain_scores_gemma":[0.9945334,0.0037091523,0.0002225985,0.0006083441,0.0007120081,0.0002143634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012488723,0.00044747622,0.00061663706,0.0008345819,0.0009485382,0.0020369396,0.0010140998,0.0011476704,0.020794846],"category_scores_gemma":[0.00924561,0.00021569179,0.00028879472,0.0013183741,0.00066237827,0.0026243948,0.0010440144,0.00070537336,0.002436445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025591105,0.00019333322,0.0024211789,0.00038335766,0.00007020085,0.00022617563,0.00026103682,0.29737264,0.04736881,0.36711955,0.014596775,0.2674279],"study_design_scores_gemma":[0.00006088926,0.00031652817,0.00060837803,0.00005967159,0.000044400866,0.0003855505,0.00020833271,0.8823804,0.017113525,0.0908344,0.007942499,0.000045402205],"about_ca_topic_score_codex":0.0014943179,"about_ca_topic_score_gemma":0.0022501873,"teacher_disagreement_score":0.020794846,"about_ca_system_score_codex":0.0012924728,"about_ca_system_score_gemma":0.0007194054,"threshold_uncertainty_score":0.069565654},"labels":[],"label_agreement":null},{"id":"W4386870921","doi":"10.1007/978-3-031-43980-3_19","title":"A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"National Human Genome Research Institute; Natural Sciences and Engineering Research Council of Canada; Directorate for Biological Sciences; Agencia Nacional de Investigación y Desarrollo; National Institutes of Health; National Science Foundation","keywords":"Substring; Combinatorics; Correctness; Grammar; Computer science; Simple (philosophy); Mathematics; Algorithm; Data structure; Programming language; Linguistics","score_opus":0.030039597999010327,"score_gpt":0.2919689418882067,"score_spread":0.26192934388919636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386870921","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.11495471,0.0015381157,0.8617038,0.00032348945,0.00032766524,0.00059421954,0.0059534973,0.009509221,0.005095233],"genre_scores_gemma":[0.18002044,0.0004990074,0.8037736,0.00020916964,0.00020985317,0.0003696187,0.010449564,0.00084485544,0.003623891],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853384,0.00014819822,0.00021579457,0.00034749266,0.0006518843,0.0001028594],"domain_scores_gemma":[0.9958444,0.0015690154,0.0003182823,0.001003094,0.0010318456,0.0002333932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077573804,0.0007537966,0.0019960809,0.006608822,0.0010229718,0.0017955131,0.0019442638,0.0009955055,0.0051366864],"category_scores_gemma":[0.0061799767,0.0005114653,0.00087924465,0.0069479262,0.00079312874,0.0032022928,0.0021382223,0.0008884807,0.00291249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008995932,0.0004219243,0.0055555156,0.0006663097,0.00015483405,0.0006169552,0.00051020505,0.011523455,0.095663086,0.017123964,0.01841738,0.8484467],"study_design_scores_gemma":[0.00069345953,0.0017201438,0.011299821,0.00023740734,0.00063393806,0.003912911,0.0009929581,0.6508189,0.08248269,0.18438093,0.062494513,0.00033240332],"about_ca_topic_score_codex":0.002040235,"about_ca_topic_score_gemma":0.0045100236,"teacher_disagreement_score":0.006608822,"about_ca_system_score_codex":0.00064911676,"about_ca_system_score_gemma":0.0025004845,"threshold_uncertainty_score":0.01718396},"labels":[],"label_agreement":null},{"id":"W4386870944","doi":"10.1007/978-3-031-43980-3_2","title":"On Suffix Tree Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; String (physics); Time complexity; K-ary tree; Combinatorics; Tree (set theory); Data structure; Computer science; Mathematics; Binary tree; Algorithm; Discrete mathematics; Tree structure","score_opus":0.018697022966807312,"score_gpt":0.24320110693476188,"score_spread":0.22450408396795457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386870944","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.008092179,0.0029762888,0.9660045,0.00060017966,0.0007560896,0.00014124723,0.00062400295,0.0059657,0.014839786],"genre_scores_gemma":[0.074969865,0.0029631483,0.8769959,0.0007126794,0.0009468845,0.00021275693,0.003940787,0.0010218782,0.03823615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980975,0.0002913755,0.00014210657,0.00044570823,0.0008874142,0.00013603736],"domain_scores_gemma":[0.9967843,0.0012975056,0.00009889535,0.0009993117,0.00072954147,0.000090447335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747833,0.0014512014,0.0019463125,0.0033125454,0.0013374055,0.0026845566,0.00259901,0.0018779874,0.018408135],"category_scores_gemma":[0.0063608694,0.00088500214,0.0010351287,0.005167562,0.0009930922,0.004520016,0.003296396,0.0015385477,0.012316159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001887469,0.00008270368,0.00051822327,0.00016446695,0.000050907518,0.00012176076,0.00006376228,0.0064687445,0.013865234,0.02058422,0.023483412,0.93440783],"study_design_scores_gemma":[0.00006193137,0.00026616864,0.001955384,0.00017898506,0.00014879067,0.002460477,0.00019534976,0.58886456,0.054835074,0.22830382,0.122618355,0.00011109239],"about_ca_topic_score_codex":0.0021558714,"about_ca_topic_score_gemma":0.003013922,"teacher_disagreement_score":0.018408135,"about_ca_system_score_codex":0.00066408585,"about_ca_system_score_gemma":0.0011620794,"threshold_uncertainty_score":0.061581373},"labels":[],"label_agreement":null},{"id":"W4386879920","doi":"10.1007/978-3-031-43587-4_21","title":"Cordial Forests","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.025610925871880984,"score_gpt":0.2579276593432336,"score_spread":0.2323167334713526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386879920","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017376225,0.0044137165,0.13369407,0.0014100367,0.0012288932,0.00009715761,0.0013539417,0.0013982452,0.8390277],"genre_scores_gemma":[0.2812368,0.00572905,0.11456785,0.0012695753,0.0010595394,0.00014709917,0.003500215,0.001237531,0.5912523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979156,0.000024416433,0.0000115853945,0.000061177016,0.000075642296,0.00003560673],"domain_scores_gemma":[0.99966955,0.00009697567,0.00002031552,0.00008807458,0.00007587168,0.000049213962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026837588,0.00040756224,0.00047627636,0.0011861642,0.0012891496,0.002018062,0.00064371474,0.0004436399,0.049493026],"category_scores_gemma":[0.001167747,0.00032497512,0.0004640894,0.0016411351,0.00082856184,0.002908268,0.0011247076,0.0017254231,0.011101159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004178177,0.000022877932,0.0001668608,0.00009695134,0.000009132005,0.00005815891,0.000105736064,0.000997323,0.0013982946,0.8382459,0.037853595,0.12100335],"study_design_scores_gemma":[0.000009159401,0.000012206615,0.0002489488,0.000049560706,0.0000118640255,0.00025133215,0.000042598567,0.00273947,0.0010020526,0.7930663,0.20255835,0.000008110022],"about_ca_topic_score_codex":0.0011987534,"about_ca_topic_score_gemma":0.0024099273,"teacher_disagreement_score":0.049493026,"about_ca_system_score_codex":0.0008468533,"about_ca_system_score_gemma":0.0005095005,"threshold_uncertainty_score":0.16557068},"labels":[],"label_agreement":null},{"id":"W4386880161","doi":"10.1007/978-3-031-43587-4_12","title":"Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bounded function; Intersection (aeronautics); Exploit; Reciprocal; Graph; Query optimization; Upper and lower bounds; Mathematical optimization; Theoretical computer science; Data mining; Mathematics","score_opus":0.020696146411820125,"score_gpt":0.2513531505849658,"score_spread":0.2306570041731457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386880161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063624546,0.00092334836,0.92781854,0.00037910318,0.00011318733,0.00012269062,0.00011837272,0.0005699105,0.0063303285],"genre_scores_gemma":[0.90660065,0.0004925941,0.08723928,0.00010207424,0.00015958138,0.00010404937,0.000119194134,0.00018960792,0.0049928245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988965,0.00021477454,0.000042552518,0.00022995405,0.0002723635,0.00034387087],"domain_scores_gemma":[0.9976647,0.0014617455,0.00015909158,0.0002006225,0.00035835637,0.00015545485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014119047,0.0010385335,0.0015923361,0.00086268794,0.00071029563,0.0015341355,0.0025271657,0.0013478827,0.0037447924],"category_scores_gemma":[0.0080824485,0.00043161365,0.00047012212,0.0015992922,0.0006905991,0.002331473,0.0014036782,0.0009623161,0.0005290953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038249427,0.00013127556,0.00082455506,0.00022040127,0.00006529119,0.00008716278,0.0000841266,0.8887355,0.015922777,0.02427293,0.0036546534,0.06561891],"study_design_scores_gemma":[0.000007673256,0.0000833739,0.00017270104,0.000005223651,0.000020378704,0.000045751094,0.000024960558,0.9926643,0.001252286,0.0052247597,0.0004922432,0.000006211456],"about_ca_topic_score_codex":0.0037950687,"about_ca_topic_score_gemma":0.0034612927,"teacher_disagreement_score":0.0037950687,"about_ca_system_score_codex":0.0013791589,"about_ca_system_score_gemma":0.0012794945,"threshold_uncertainty_score":0.012527525},"labels":[],"label_agreement":null},{"id":"W4386901263","doi":"10.1007/978-3-031-44137-0_1","title":"Tracking and Identification of Ice Hockey Players","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Identification (biology); Ice hockey; Robustness (evolution); Computer vision; Tracking (education); Video tracking; Deep learning; Object (grammar)","score_opus":0.020896336221615564,"score_gpt":0.24764566623789225,"score_spread":0.22674933001627667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386901263","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.66742414,0.0024171378,0.27542043,0.0002214079,0.00041224834,0.0002936789,0.0021411409,0.001330162,0.05033972],"genre_scores_gemma":[0.827399,0.0017834019,0.10357475,0.00011789129,0.00010991055,0.00010452102,0.0033231303,0.0002222044,0.063365236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982315,0.000009636965,0.0000053528124,0.000071109534,0.000047846657,0.000043014075],"domain_scores_gemma":[0.9998099,0.000046110235,0.000021002988,0.00001921904,0.00008013205,0.000023721306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020861242,0.00053245993,0.00043716416,0.0020347212,0.0004392442,0.00096852344,0.00069927954,0.0006402755,0.003662593],"category_scores_gemma":[0.00042837462,0.00028662337,0.00023742217,0.001228638,0.00024271324,0.0006554914,0.00056552625,0.0003068846,0.002668907],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011539011,0.00018827202,0.023990752,0.00029619687,0.00008477551,0.00060247217,0.0006423909,0.011169721,0.22944903,0.0028584725,0.011485977,0.7180781],"study_design_scores_gemma":[0.00009502521,0.000968427,0.18829085,0.00035358747,0.00031098493,0.003106673,0.00322807,0.49501774,0.24455439,0.004946338,0.058983847,0.00014418115],"about_ca_topic_score_codex":0.0063736457,"about_ca_topic_score_gemma":0.011971245,"teacher_disagreement_score":0.0063736457,"about_ca_system_score_codex":0.00034975738,"about_ca_system_score_gemma":0.00029860713,"threshold_uncertainty_score":0.01267308},"labels":[],"label_agreement":null},{"id":"W4386919255","doi":"10.1007/978-3-031-43849-3_28","title":"Detection of Redacted Text in Legal Documents","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":3,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute of Steel Construction","keywords":"Computer science; Redaction; Optical character recognition; Artificial intelligence; Discriminator; Segmentation; Character (mathematics); Grayscale; Task (project management); Pattern recognition (psychology); Image (mathematics); Natural language processing; Detector; Mathematics","score_opus":0.015662233439057552,"score_gpt":0.25739749116169647,"score_spread":0.24173525772263893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919255","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.7538788,0.0075871935,0.19486421,0.0006365509,0.00080426066,0.00035072205,0.0032255736,0.009315374,0.029337406],"genre_scores_gemma":[0.76553863,0.0023588727,0.1872385,0.0002251702,0.0002443302,0.00008391886,0.004877884,0.00049059564,0.03894208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942505,0.00004738206,0.0000385346,0.00014133856,0.0002715931,0.00007610638],"domain_scores_gemma":[0.9984713,0.0005657766,0.00023374724,0.00017595873,0.00045091767,0.00010230844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004483282,0.00049736135,0.0005330957,0.0031155993,0.00046636793,0.0014174816,0.00086416595,0.0010685297,0.0035636027],"category_scores_gemma":[0.0018533928,0.00027854595,0.0003140392,0.0011268846,0.00038972404,0.00087840937,0.00054722757,0.0006896651,0.0032986528],"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.00093310646,0.00021244897,0.009412014,0.0006178766,0.000049499868,0.00251846,0.00046784998,0.0030596636,0.27837908,0.0024450782,0.012378598,0.6895263],"study_design_scores_gemma":[0.00006749714,0.0005193556,0.047025677,0.00029708914,0.00018574153,0.008297122,0.000836737,0.25582004,0.6267036,0.0030268775,0.057125002,0.00009525043],"about_ca_topic_score_codex":0.0015590288,"about_ca_topic_score_gemma":0.0024464815,"teacher_disagreement_score":0.0035636027,"about_ca_system_score_codex":0.00040512596,"about_ca_system_score_gemma":0.0003943667,"threshold_uncertainty_score":0.011921465},"labels":[],"label_agreement":null},{"id":"W4386919261","doi":"10.1007/978-3-031-43849-3_21","title":"Making PDFs Accessible for Visually Impaired Users (and Findable for Everybody Else)","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital and Traditional Archives Management","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute of Steel Construction","keywords":"Computer science; Markup language; Information retrieval; Heuristic; Software; Redaction; World Wide Web; Artificial intelligence; Programming language; XML","score_opus":0.07609734288231466,"score_gpt":0.2830407406647133,"score_spread":0.20694339778239862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919261","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010360234,0.00948659,0.033841055,0.0044276486,0.0048676133,0.00011597356,0.0013918675,0.0052812053,0.9302279],"genre_scores_gemma":[0.024512613,0.010755682,0.010145161,0.00086628075,0.0006893438,0.00003756358,0.0010491068,0.00078251795,0.9511617],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978477,0.000014435963,0.000009265593,0.000022204673,0.00013591947,0.0000334316],"domain_scores_gemma":[0.99935097,0.00020328007,0.00003858746,0.00009107682,0.00023189952,0.00008414125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035321037,0.00042184125,0.00021089493,0.0018299713,0.0007889576,0.004569581,0.00059369,0.0011662923,0.10072817],"category_scores_gemma":[0.0019514905,0.0002791689,0.0003978615,0.0016741228,0.000592213,0.0053522065,0.001995494,0.00081811094,0.06634541],"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.000022972887,0.00006800303,0.00026420623,0.00024958854,0.0000051159273,0.00022615938,0.0006838185,0.00017968343,0.003483909,0.014006682,0.40302417,0.5777858],"study_design_scores_gemma":[0.000005603885,0.000020253303,0.00137696,0.0001781379,0.000010485714,0.00063247833,0.0004781902,0.00017793907,0.0033501126,0.0062104147,0.9875443,0.000015238823],"about_ca_topic_score_codex":0.0022369982,"about_ca_topic_score_gemma":0.0026278307,"teacher_disagreement_score":0.10072817,"about_ca_system_score_codex":0.00040855908,"about_ca_system_score_gemma":0.0006204001,"threshold_uncertainty_score":0.33696932},"labels":[],"label_agreement":null},{"id":"W4386919265","doi":"10.1007/978-3-031-43849-3_5","title":"PreprintResolver: Improving Citation Quality by Resolving Published Versions of ArXiv Preprints Using Literature Databases","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Academic Publishing and Open Access","field":"Decision Sciences","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Preprint; Computer science; Field (mathematics); Citation; Information retrieval; Quality (philosophy); World Wide Web; Sample (material); Mathematics","score_opus":0.14020336356762306,"score_gpt":0.3910124678096511,"score_spread":0.25080910424202807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919265","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031471718,0.027968068,0.6491241,0.011908061,0.011187436,0.0009530923,0.05514165,0.1305418,0.081704035],"genre_scores_gemma":[0.09518348,0.015018738,0.71153146,0.0011442594,0.0041416865,0.00048431908,0.08509804,0.02116005,0.06623802],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98580164,0.0026646901,0.0017746331,0.0016420101,0.007739796,0.00037730933],"domain_scores_gemma":[0.94932663,0.01925762,0.0034464167,0.0133128,0.012950232,0.0017062546],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017214818,0.0020267025,0.0031886827,0.031335413,0.0025397239,0.018822692,0.005075894,0.0024341352,0.03615616],"category_scores_gemma":[0.064884745,0.0017918309,0.0019748462,0.030239007,0.00096646784,0.012924291,0.0051762126,0.0018878343,0.03932146],"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.00027173723,0.00022422653,0.003832177,0.0011152016,0.0003481706,0.000092774826,0.0002194281,0.0035810648,0.0037117058,0.023173368,0.24168351,0.72174674],"study_design_scores_gemma":[0.00039688827,0.00020663175,0.0069334893,0.0009519739,0.0008302828,0.0007881369,0.000739684,0.11060498,0.03788729,0.16156735,0.6787435,0.00034974152],"about_ca_topic_score_codex":0.0030833054,"about_ca_topic_score_gemma":0.0038853383,"teacher_disagreement_score":0.98278517,"about_ca_system_score_codex":0.001406039,"about_ca_system_score_gemma":0.0050113495,"threshold_uncertainty_score":0.120954335},"labels":[],"label_agreement":null},{"id":"W4386919282","doi":"10.1007/978-3-031-43756-4","title":"Electronic Voting","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Narodowe Centrum Badań i Rozwoju; Norges Forskningsråd; National Science Foundation; Université du Luxembourg; Eesti Teadusagentuur; Fonds National de la Recherche Luxembourg; Villum Fonden","keywords":"Computer science; Electronic voting; Voting; Political science","score_opus":0.011146879136308132,"score_gpt":0.24045726795492206,"score_spread":0.22931038881861393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919282","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058309484,0.002441193,0.004609951,0.0008514327,0.0016652072,0.000046243735,0.0002933333,0.00038665123,0.9891229],"genre_scores_gemma":[0.0032523288,0.0009310666,0.0011157147,0.00019244463,0.0002246201,0.000015296422,0.00025111338,0.000085056716,0.9939323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944764,0.00006431617,0.000022188444,0.00009151167,0.00032191287,0.000052401443],"domain_scores_gemma":[0.99961025,0.00010431937,0.00001775818,0.00008731135,0.00012697428,0.000053367927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004570673,0.00053593377,0.0004558548,0.00090165896,0.0012465204,0.003007508,0.0007246165,0.0009954955,0.35668707],"category_scores_gemma":[0.0014865736,0.0003023259,0.00037632027,0.0013440396,0.0005084366,0.0024432903,0.001213626,0.0012417181,0.21029134],"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.000039943814,0.000044935536,0.00012199924,0.00011120781,0.0000048642646,0.000038820323,0.00007559042,0.0003267791,0.00067481515,0.06458199,0.6499421,0.28403682],"study_design_scores_gemma":[0.000003419049,0.000014679612,0.00014899886,0.000034959347,0.0000012155842,0.000059887418,0.00002784418,0.00016027743,0.00028503768,0.008514171,0.990746,0.0000033226725],"about_ca_topic_score_codex":0.00051569904,"about_ca_topic_score_gemma":0.0015981292,"teacher_disagreement_score":0.35668707,"about_ca_system_score_codex":0.0006455302,"about_ca_system_score_gemma":0.00052566174,"threshold_uncertainty_score":0.9176078},"labels":[],"label_agreement":null},{"id":"W4386919298","doi":"10.1007/978-3-031-43756-4_4","title":"Online Voting in Ontario Municipalities: A Standards-Based Review","year":2023,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Voting; Ballot; Computer science; Electronic voting; Baseline (sea); Secret ballot; Computer security; Political science; Internet privacy; Law","score_opus":0.059292747191177206,"score_gpt":0.3439728844336977,"score_spread":0.2846801372425205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919298","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038023333,0.98353726,0.00027566173,0.0022611206,0.00030395522,0.00047272063,0.002671186,0.000026935324,0.00664876],"genre_scores_gemma":[0.03923458,0.9562588,0.00061431905,0.0008115951,0.00010475777,0.0002809255,0.0018454908,0.000016780932,0.0008328463],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99170727,0.0011663144,0.0016760166,0.00045198423,0.004580915,0.00041750554],"domain_scores_gemma":[0.9528624,0.009692915,0.007076821,0.0008571018,0.028152524,0.0013583655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011308832,0.00045284413,0.0018743308,0.012344922,0.0009639211,0.0021163386,0.0021304535,0.0008360616,0.0030639074],"category_scores_gemma":[0.032108665,0.00057096046,0.001184602,0.021441214,0.0010982188,0.0012390057,0.0010747408,0.00082126143,0.00042409246],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003415559,0.0000741052,0.010019576,0.21511635,0.0011272039,0.000161773,0.0013006544,0.000396072,0.0007511557,0.0029054838,0.048212692,0.71959347],"study_design_scores_gemma":[0.00017144645,0.00036312942,0.069494225,0.2492275,0.005193163,0.00030416157,0.0011861455,0.00022836964,0.0006990563,0.0005376397,0.672506,0.0000891313],"about_ca_topic_score_codex":0.46332315,"about_ca_topic_score_gemma":0.7205833,"teacher_disagreement_score":0.5366769,"about_ca_system_score_codex":0.02308115,"about_ca_system_score_gemma":0.08131125,"threshold_uncertainty_score":0.9212526},"labels":[],"label_agreement":null},{"id":"W4386919487","doi":"10.1007/978-3-031-43756-4_6","title":"Verifiability Experiences in Ontario’s 2022 Online Elections","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University; Brock University","funders":"","keywords":"Voting; Verifiable secret sharing; Electronic voting; Computer science; Democracy; Ranked voting system; Spoilt vote; Political science; Local election; Internet privacy; Computer security; Public administration; Group voting ticket; Law","score_opus":0.02251807489189088,"score_gpt":0.24990232716251362,"score_spread":0.22738425227062276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919487","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.89637846,0.00024426647,0.00052288425,0.0084758205,0.00008614403,0.00010930182,0.000287381,0.000064482054,0.09383122],"genre_scores_gemma":[0.9680452,0.00021040752,0.0002080701,0.00058567146,0.00001536042,0.000029134919,0.00011862375,0.000026902744,0.030760696],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9941315,0.0012882467,0.00014582838,0.0003644043,0.0020680397,0.0020020097],"domain_scores_gemma":[0.9888998,0.003453018,0.0007389418,0.00073084736,0.0032974607,0.0028798333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048333877,0.00016284724,0.0003664996,0.0007179466,0.023130005,0.005025883,0.0014185504,0.0015369297,0.008504481],"category_scores_gemma":[0.01123446,0.0003454758,0.00026302508,0.0022902493,0.006195861,0.0016354714,0.0034288624,0.0019440951,0.00070746563],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028177229,0.00026817425,0.06100223,0.00020083753,0.000019354691,0.0049200063,0.78265435,0.00090721826,0.003479243,0.037750725,0.044294313,0.064221755],"study_design_scores_gemma":[0.00003349335,0.0001764712,0.06661198,0.00010867173,0.000015310847,0.00035427263,0.46380275,0.0012108355,0.0013334913,0.0012135538,0.46503848,0.00010069939],"about_ca_topic_score_codex":0.95997995,"about_ca_topic_score_gemma":0.9888383,"teacher_disagreement_score":0.066959806,"about_ca_system_score_codex":0.066959806,"about_ca_system_score_gemma":0.04822482,"threshold_uncertainty_score":0.48582965},"labels":[],"label_agreement":null},{"id":"W4386932173","doi":"10.1007/978-3-031-44216-2_19","title":"A Graph Convolutional Siamese Network for the Assessment and Recognition of Physical Rehabilitation Exercises","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"McGill University","funders":"","keywords":"Computer science; Hidden Markov model; Correctness; Graph; Artificial intelligence; Dynamic time warping; Machine learning; Action recognition; Power graph analysis; Pattern recognition (psychology); Class (philosophy); Theoretical computer science; Algorithm","score_opus":0.028133110872582016,"score_gpt":0.28659926383080175,"score_spread":0.25846615295821973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386932173","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.030869698,0.0012646159,0.9598446,0.00039262357,0.0001849062,0.000115058145,0.00088086195,0.0035048143,0.0029428112],"genre_scores_gemma":[0.55103433,0.0013042282,0.41688535,0.0005780544,0.00017127131,0.00028034952,0.0032617918,0.0003110632,0.026173603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977237,0.000039029288,0.000010317843,0.00009812037,0.000043487697,0.000036614514],"domain_scores_gemma":[0.9997098,0.00009297883,0.000016874137,0.00003539946,0.000120839766,0.000024041356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007093678,0.0008910418,0.0008113018,0.00075762457,0.0003009464,0.00067163043,0.0013579581,0.0011918345,0.004305484],"category_scores_gemma":[0.0008860037,0.0004151052,0.0008116087,0.00071361917,0.0003078543,0.0006700695,0.00077126676,0.0011071069,0.0017374692],"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.00023628885,0.00022805155,0.001496302,0.000070658534,0.00013976093,0.000101090096,0.0000347215,0.22464564,0.01406358,0.0036502867,0.0119111715,0.74342245],"study_design_scores_gemma":[0.00000389452,0.000028428418,0.0005827059,0.000006225824,0.000014758838,0.000022843507,0.000004486466,0.99561924,0.0017975635,0.0012801308,0.00063325546,0.0000064828164],"about_ca_topic_score_codex":0.027001202,"about_ca_topic_score_gemma":0.038287006,"teacher_disagreement_score":0.027001202,"about_ca_system_score_codex":0.0009520126,"about_ca_system_score_gemma":0.0010977392,"threshold_uncertainty_score":0.05368805},"labels":[],"label_agreement":null},{"id":"W4386932598","doi":"10.1007/978-3-031-44223-0","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai University of Electric Power; Université de Franche-Comté; Hefei University of Technology; Consejo Superior de Investigaciones Científicas; Southern University of Science and Technology; Universidad Autónoma de Tamaulipas; University of Chinese Academy of Sciences; Hefei University; Harokopio University; Shenzhen University; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Soochow University; National University of Defense Technology; University of Tsukuba; Moscow Institute of Physics and Technology; Aristotle University of Thessaloniki; Universidade da Coruña; Bulgarian Academy of Sciences; Universität Hamburg; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; National and Kapodistrian University of Athens; Chinese Academy of Sciences; University of North Carolina Wilmington; Université de Toulouse; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; Technische Universität Berlin; University of Bristol; Université de Strasbourg; Nanjing Normal University; École Polytechnique Fédérale de Lausanne; Ulster University; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; Indian Institute of Technology Kanpur; University of the West of England; Hamad Bin Khalifa University; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; Friedrich-Schiller-Universität Jena; University of Cyprus; Edinburgh Napier University; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; Universitat Politècnica de Catalunya; Universidade de Aveiro; Technische Universität Dresden; Northwestern Polytechnical University; King's College London; University of Dundee; Northwestern University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; KU Leuven; Kyungpook National University; Université de Bordeaux; Northwest Normal University; Ritsumeikan University; Baylor University; Arizona State University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386932598","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386932794","doi":"10.1007/978-3-031-44192-9","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"University of North Carolina Wilmington; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; Harokopio University; Shenzhen University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; University of Bristol; Université de Strasbourg; Technische Universität Berlin; Northwest Normal University; Université de Bordeaux; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; National and Kapodistrian University of Athens; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; University of the West of England; Hamad Bin Khalifa University; Aristotle University of Thessaloniki; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; University of Cyprus; Friedrich-Schiller-Universität Jena; Ritsumeikan University; Baylor University; Kyungpook National University; KU Leuven; Nanjing Normal University; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Tsukuba; University of Dundee; Soochow University; Arizona State University; Northwestern University; Universität Hamburg; Ulster University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Focus (optics); Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386932794","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386932912","doi":"10.1007/978-3-031-44192-9_4","title":"DaCon: Multi-Domain Text Classification Using Domain Adversarial Contrastive Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Computer science; Domain (mathematical analysis); Artificial intelligence; Embedding; Feature (linguistics); Encoder; Adversarial system; Class (philosophy); Pattern recognition (psychology); Machine learning; Training set; Natural language processing; Mathematics","score_opus":0.048631711654022206,"score_gpt":0.27815126678308966,"score_spread":0.22951955512906747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386932912","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.012332564,0.0010007403,0.96415275,0.00043288563,0.00049465266,0.0002438728,0.0011051086,0.015810918,0.0044264942],"genre_scores_gemma":[0.22379513,0.00079763756,0.72889376,0.0010082002,0.00046445057,0.0005952544,0.008525524,0.0014601331,0.03445986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.00023540099,0.000038275964,0.0003263482,0.00030713997,0.00011045404],"domain_scores_gemma":[0.9985234,0.0007437139,0.00006420224,0.00030333715,0.0002761013,0.000089234476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001657451,0.0014604387,0.0013177363,0.0017704539,0.0007687891,0.0014809881,0.002391153,0.0018886512,0.008495005],"category_scores_gemma":[0.0031858783,0.000502072,0.0011077669,0.0013919445,0.00065776147,0.0024046206,0.0030013637,0.003028866,0.005669989],"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.00051253784,0.00040516126,0.00074720243,0.0002022622,0.00015945495,0.00020224079,0.000086776214,0.073327884,0.017492067,0.011512053,0.06933266,0.82601964],"study_design_scores_gemma":[0.00002548983,0.000059078055,0.00019115003,0.000012152223,0.000016116668,0.00007156842,0.0000211527,0.9768942,0.0075339973,0.008571004,0.006589446,0.00001462647],"about_ca_topic_score_codex":0.002976201,"about_ca_topic_score_gemma":0.005311341,"teacher_disagreement_score":0.008495005,"about_ca_system_score_codex":0.0008705184,"about_ca_system_score_gemma":0.0010693372,"threshold_uncertainty_score":0.0284186},"labels":[],"label_agreement":null},{"id":"W4386937809","doi":"10.1007/978-3-031-43950-6","title":"Digital Health Transformation, Smart Ageing, and Managing Disability","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Institute for Information and Communications Technology Promotion; European Commission; Ministry of Science and ICT, South Korea; Korea Health Industry Development Institute; National Rehabilitation Center; Ministry of Trade, Industry and Energy","keywords":"Computer science; Transformation (genetics); Digital transformation; Ageing; Human–computer interaction; World Wide Web; Medicine","score_opus":0.014520337438567454,"score_gpt":0.2821765444852087,"score_spread":0.2676562070466412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937809","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009115403,0.09992226,0.003433845,0.008593132,0.024077578,0.00009559901,0.00036949103,0.00036829137,0.86222833],"genre_scores_gemma":[0.004150447,0.06600609,0.0013555392,0.0032188406,0.006062202,0.000053962838,0.00036773374,0.00015272193,0.91863257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996381,0.00003875316,0.000015181327,0.000033015083,0.00022701618,0.000047972208],"domain_scores_gemma":[0.999617,0.00016323003,0.000017782737,0.000027118076,0.000070255395,0.00010463274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164703,0.0006781029,0.0005364929,0.0014320387,0.001035655,0.0062978053,0.00043574083,0.001569336,0.11467068],"category_scores_gemma":[0.0012361711,0.0001716375,0.00043404673,0.0023059754,0.0009433693,0.003627825,0.0024910492,0.001836914,0.034552805],"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.000013409343,0.000034668166,0.00007593861,0.0003810421,0.0000041282988,0.000053071817,0.00018378712,0.00007109146,0.00033792327,0.018927692,0.7554618,0.22445539],"study_design_scores_gemma":[0.0000019458305,0.000017265898,0.00030918434,0.00026164844,0.0000026157932,0.00011296865,0.00018341729,0.00004552617,0.00010534617,0.004452093,0.9945017,0.000006307017],"about_ca_topic_score_codex":0.0022470593,"about_ca_topic_score_gemma":0.0071949153,"teacher_disagreement_score":0.11467068,"about_ca_system_score_codex":0.0010109079,"about_ca_system_score_gemma":0.0014798886,"threshold_uncertainty_score":0.38361162},"labels":[],"label_agreement":null},{"id":"W4386937827","doi":"10.1007/978-3-031-43950-6_6","title":"Drug Intervention Follow up with Internet of Things: A Case Study","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medication Adherence and Compliance","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Intégré Universitaire de Santé et de Services Sociaux du Saguenay–Lac-Saint-Jean; Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; Centre Hospitalier Universitaire de Sherbrooke; Université de Sherbrooke","funders":"","keywords":"Timestamp; Computer science; Internet of Things; Subject (documents); The Internet; Intervention (counseling); Real-time computing; World Wide Web; Medicine; Psychiatry","score_opus":0.03965164768310865,"score_gpt":0.30776017920313964,"score_spread":0.268108531520031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937827","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.977187,0.0019328041,0.003942589,0.0037900943,0.00015175491,0.00030370426,0.00016294222,0.000066734254,0.012462364],"genre_scores_gemma":[0.98785746,0.0015114266,0.0029479682,0.0010544065,0.00013251972,0.00008997237,0.00009007445,0.000030433703,0.0062857396],"study_design_codex":"case_report","study_design_gemma":"case_report","domain_scores_codex":[0.99904424,0.00033823214,0.00009480506,0.00010859362,0.00023792747,0.00017617122],"domain_scores_gemma":[0.99815387,0.00085963996,0.00031400798,0.000104318686,0.00012543974,0.0004427268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070268085,0.00048205708,0.00041623137,0.0013388393,0.0022080054,0.0009834344,0.00092189724,0.0027208987,0.0028558522],"category_scores_gemma":[0.0031746905,0.0003281576,0.00067139365,0.0012191916,0.0008346186,0.0007046168,0.0009157281,0.0015797864,0.00048872776],"study_design_candidate":"case_report","study_design_consensus":"case_report","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016017075,0.002119417,0.062453154,0.00028346156,0.00005446392,0.88655114,0.010040518,0.00038439533,0.0017170684,0.0013074471,0.0026081284,0.03232072],"study_design_scores_gemma":[0.00006441676,0.001782104,0.07153124,0.00041405,0.00012774835,0.86127025,0.023285497,0.004414546,0.005492079,0.0015929008,0.029931622,0.00009347215],"about_ca_topic_score_codex":0.0041387253,"about_ca_topic_score_gemma":0.00894057,"teacher_disagreement_score":0.0041387253,"about_ca_system_score_codex":0.000993874,"about_ca_system_score_gemma":0.0007077128,"threshold_uncertainty_score":0.00955385},"labels":[],"label_agreement":null},{"id":"W4386937846","doi":"10.1007/978-3-031-43950-6_5","title":"Adaptive Dashboard for IoT Environments: Application for Senior Residences","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Intégré Universitaire de Santé et de Services Sociaux du Saguenay–Lac-Saint-Jean; Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; Centre Hospitalier Universitaire de Sherbrooke; Université de Sherbrooke","funders":"","keywords":"Computer science; Dashboard; Dash; Health professionals; Data science; Population; Visualization; Internet of Things; Health care; Knowledge management; World Wide Web; Medicine; Data mining","score_opus":0.04014470158052275,"score_gpt":0.2736347966459989,"score_spread":0.23349009506547613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33374214,0.00237151,0.5630562,0.0020138398,0.0013826538,0.0008604469,0.0029517577,0.050955784,0.04266569],"genre_scores_gemma":[0.7641882,0.0016554006,0.20111573,0.0003709317,0.00020994288,0.0004315878,0.0021478906,0.00090872333,0.028971635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977165,0.00007744675,0.000016323793,0.00003662399,0.00007180429,0.000026189167],"domain_scores_gemma":[0.9994091,0.00023617022,0.00002824398,0.000078775105,0.00013968449,0.0001081034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569936,0.0007836818,0.00038632995,0.00042980668,0.00033491306,0.0012244857,0.0008213664,0.0007199761,0.009616239],"category_scores_gemma":[0.0010792532,0.00011890085,0.0002942903,0.00072885054,0.00017354249,0.000873642,0.0010297161,0.0005973584,0.0015928608],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012146714,0.0015354067,0.010604899,0.001434942,0.00013412548,0.0028746803,0.0020299673,0.03165451,0.093565114,0.008798488,0.080807246,0.76534593],"study_design_scores_gemma":[0.0004374631,0.0025011846,0.026184382,0.0006497172,0.0003226878,0.0019845914,0.0031453324,0.5565267,0.076244466,0.011081674,0.3206753,0.0002465402],"about_ca_topic_score_codex":0.00113463,"about_ca_topic_score_gemma":0.0012175315,"teacher_disagreement_score":0.009616239,"about_ca_system_score_codex":0.00019302646,"about_ca_system_score_gemma":0.00022797244,"threshold_uncertainty_score":0.03216946},"labels":[],"label_agreement":null},{"id":"W4386937850","doi":"10.1007/978-3-031-43950-6_3","title":"Deriving Physiological Information from PET Images Using Machine Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Université TÉLUQ; Université de Sherbrooke","funders":"","keywords":"Artificial intelligence; Algorithm; Computer science; Machine learning","score_opus":0.03618224470361048,"score_gpt":0.30428259430595994,"score_spread":0.26810034960234946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08672974,0.0015588561,0.9031145,0.0005527431,0.00016148391,0.00015433978,0.0013190741,0.002235563,0.0041738125],"genre_scores_gemma":[0.74150485,0.0014044353,0.2520196,0.00035979677,0.0001907363,0.00014884397,0.001494809,0.00022237429,0.0026545809],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997327,0.00008427355,0.000019983707,0.0000821149,0.00005071019,0.000030089639],"domain_scores_gemma":[0.9991879,0.0005171109,0.00008465355,0.000079026424,0.00011006505,0.000021178306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008381036,0.00078592275,0.00056902156,0.0013049316,0.00021323004,0.0014834299,0.00057639496,0.0010282015,0.003441211],"category_scores_gemma":[0.003896884,0.00035690275,0.00068936154,0.0012189704,0.0003701231,0.0009475897,0.00042506165,0.0008121925,0.001385431],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085055974,0.00035551956,0.015404946,0.00072687946,0.0002672077,0.0011519779,0.00010932496,0.3090535,0.121904165,0.00663338,0.0050988346,0.5384437],"study_design_scores_gemma":[0.000026110542,0.00011052288,0.0066026547,0.000045654604,0.000059020855,0.00050187367,0.000037697482,0.94280726,0.038220078,0.009227213,0.0023185357,0.00004335173],"about_ca_topic_score_codex":0.0015679245,"about_ca_topic_score_gemma":0.0016800177,"teacher_disagreement_score":0.003441211,"about_ca_system_score_codex":0.00044739112,"about_ca_system_score_gemma":0.0004985468,"threshold_uncertainty_score":0.0115119815},"labels":[],"label_agreement":null},{"id":"W4386937859","doi":"10.1007/978-3-031-43950-6_8","title":"Agitated Behaviors Detection in Children with ASD Using Wearable Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université de Sherbrooke","funders":"","keywords":"Support vector machine; Autism spectrum disorder; Wearable computer; Computer science; Random forest; Recall; Autism; Artificial intelligence; Boosting (machine learning); Machine learning; Algorithm; Psychology; Developmental psychology; Cognitive psychology","score_opus":0.053358054040155645,"score_gpt":0.2878522718185206,"score_spread":0.23449421777836493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937859","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.9616763,0.0013629209,0.029430784,0.00017486862,0.000080970436,0.000061002705,0.0029671981,0.00088249875,0.0033635444],"genre_scores_gemma":[0.9634695,0.0006974751,0.031920332,0.00005660758,0.00004035327,0.00008616672,0.002017097,0.000034462464,0.0016780616],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998179,0.000041189694,0.000018369681,0.00005969353,0.000045841087,0.00001699161],"domain_scores_gemma":[0.9995789,0.00018987058,0.00009449716,0.000030060919,0.00008208097,0.000024603565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026178194,0.00045545545,0.00030113957,0.0010911105,0.00009971092,0.000400336,0.0002847068,0.00041658146,0.001539136],"category_scores_gemma":[0.0009061909,0.00013031582,0.00022567247,0.0006638289,0.000110950066,0.000360801,0.00038574942,0.00023323657,0.00059223647],"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.00070666475,0.00030190087,0.39906752,0.00081724493,0.0002090981,0.0020805767,0.00089204847,0.0050285994,0.10130451,0.00053691235,0.005832821,0.4832221],"study_design_scores_gemma":[0.000030312767,0.00067113776,0.89539427,0.00022276127,0.00011330073,0.0041585225,0.0012869945,0.056320794,0.032836426,0.0013150393,0.007589518,0.00006099329],"about_ca_topic_score_codex":0.001072198,"about_ca_topic_score_gemma":0.0018514876,"teacher_disagreement_score":0.001539136,"about_ca_system_score_codex":0.00013020317,"about_ca_system_score_gemma":0.00007450555,"threshold_uncertainty_score":0.0051489472},"labels":[],"label_agreement":null},{"id":"W4386937860","doi":"10.1007/978-3-031-43950-6_16","title":"Effectiveness of a Korean Smart Home Modification Program: Focused on People with Physical Disabilities","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Assistive Technology in Communication and Mobility","field":"Health Professions","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Activities of daily living; Quality of life (healthcare); Intervention (counseling); Occupational therapy; Gerontology; Independent living; Home automation; Psychology; Medicine; Physical therapy; Computer science; Nursing; Telecommunications","score_opus":0.05805942843620489,"score_gpt":0.3806186892300546,"score_spread":0.3225592607938497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937860","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.99830306,0.00044961539,0.00014154064,0.00005285826,0.000021049658,0.00027787263,0.00006140566,0.000010266771,0.0006823408],"genre_scores_gemma":[0.9963321,0.00075069745,0.001436619,0.00011736771,0.000020370142,0.0004370763,0.000101195335,0.0000030158144,0.0008014472],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998454,0.000054791697,0.000015996988,0.000029161658,0.000020307063,0.000034436973],"domain_scores_gemma":[0.99988616,0.000024558845,0.000021561695,0.000010692723,0.000012084569,0.00004496647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028366368,0.00030489804,0.0004354691,0.00020532911,0.00024971418,0.00015475186,0.00023953586,0.00023913514,0.0025548136],"category_scores_gemma":[0.00033249045,0.00009574019,0.00056667824,0.00017389929,0.00014819426,0.00020876841,0.00041160456,0.00023482395,0.0001412821],"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.017059423,0.058596943,0.027098287,0.0037945185,0.00042393236,0.00048057645,0.0016244851,0.0009256544,0.025241217,0.00019714628,0.00112972,0.8634281],"study_design_scores_gemma":[0.017525386,0.24874781,0.6978335,0.0008367239,0.0018238374,0.00062847545,0.0037632773,0.0024122687,0.017200142,0.00023714422,0.008907543,0.00008398385],"about_ca_topic_score_codex":0.0017671115,"about_ca_topic_score_gemma":0.0028918502,"teacher_disagreement_score":0.0025548136,"about_ca_system_score_codex":0.00019686922,"about_ca_system_score_gemma":0.0004762886,"threshold_uncertainty_score":0.00854665},"labels":[],"label_agreement":null},{"id":"W4386937866","doi":"10.1007/978-3-031-43950-6_17","title":"Real-Time Multiple Object Tracking for Safe Cooking Activities","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Stove; Computer vision; Frame (networking); Context (archaeology); Video tracking; Real-time computing; Frame rate; Artificial intelligence; Segmentation; Object (grammar); Telecommunications; Engineering","score_opus":0.03878915059857371,"score_gpt":0.2957166060063782,"score_spread":0.2569274554078045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386937866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054663766,0.001096002,0.9362341,0.00005545516,0.00016465489,0.000080874524,0.00015105201,0.004024375,0.0035297333],"genre_scores_gemma":[0.45246792,0.0010303789,0.53394145,0.000101894344,0.00005617601,0.00012723438,0.0006088789,0.00032480463,0.011341245],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997106,0.000037383357,0.0000113063315,0.00011157022,0.00010153219,0.00002751205],"domain_scores_gemma":[0.9998122,0.00005376362,0.000024561969,0.000031864554,0.000057371624,0.000020348438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039764767,0.00047018105,0.00053844706,0.00070265133,0.00023843028,0.000609752,0.00066179334,0.00066248776,0.0032229193],"category_scores_gemma":[0.00042137885,0.0002654557,0.00030163466,0.00052179716,0.00017594478,0.00048294154,0.00039704842,0.0003570246,0.0013743836],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055533147,0.00013175418,0.001269256,0.00025900474,0.000049140624,0.00016193108,0.00016598473,0.014579926,0.33447433,0.00096730504,0.0038536652,0.6435324],"study_design_scores_gemma":[0.00010237172,0.0004903777,0.015606876,0.00010516683,0.00012416462,0.0008717468,0.00013795946,0.7228915,0.22375876,0.0013883135,0.03441211,0.000110604735],"about_ca_topic_score_codex":0.0020381254,"about_ca_topic_score_gemma":0.0024392444,"teacher_disagreement_score":0.0032229193,"about_ca_system_score_codex":0.0002691392,"about_ca_system_score_gemma":0.000305399,"threshold_uncertainty_score":0.010781705},"labels":[],"label_agreement":null},{"id":"W4386938035","doi":"10.1007/978-3-031-44204-9","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of North Carolina Wilmington; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; Harokopio University; Shenzhen University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; University of Bristol; Université de Strasbourg; Technische Universität Berlin; Northwest Normal University; Université de Bordeaux; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; National and Kapodistrian University of Athens; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; University of the West of England; Hamad Bin Khalifa University; Aristotle University of Thessaloniki; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; University of Cyprus; Friedrich-Schiller-Universität Jena; Ritsumeikan University; Baylor University; Kyungpook National University; KU Leuven; Nanjing Normal University; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Tsukuba; University of Dundee; Soochow University; Arizona State University; Northwestern University; Universität Hamburg; Ulster University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386938035","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386938142","doi":"10.1007/978-3-031-44213-1","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of North Carolina Wilmington; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; Harokopio University; Shenzhen University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; University of Bristol; Université de Strasbourg; Technische Universität Berlin; Northwest Normal University; Université de Bordeaux; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; National and Kapodistrian University of Athens; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; University of the West of England; Hamad Bin Khalifa University; Aristotle University of Thessaloniki; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; University of Cyprus; Friedrich-Schiller-Universität Jena; Ritsumeikan University; Baylor University; Kyungpook National University; KU Leuven; Nanjing Normal University; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Tsukuba; University of Dundee; Soochow University; Arizona State University; Northwestern University; Universität Hamburg; Ulster University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Focus (optics); Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386938142","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386938211","doi":"10.1007/978-3-031-44216-2","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"University of North Carolina Wilmington; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; Harokopio University; Shenzhen University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; University of Bristol; Université de Strasbourg; Technische Universität Berlin; Northwest Normal University; Université de Bordeaux; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; National and Kapodistrian University of Athens; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; University of the West of England; Hamad Bin Khalifa University; Aristotle University of Thessaloniki; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; University of Cyprus; Friedrich-Schiller-Universität Jena; Ritsumeikan University; Baylor University; Kyungpook National University; KU Leuven; Nanjing Normal University; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Tsukuba; University of Dundee; Soochow University; Arizona State University; Northwestern University; Universität Hamburg; Ulster University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Focus (optics); Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386938211","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386938279","doi":"10.1007/978-3-031-44210-0","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Shanghai University of Electric Power; Université de Franche-Comté; Hefei University of Technology; Consejo Superior de Investigaciones Científicas; Southern University of Science and Technology; Universidad Autónoma de Tamaulipas; University of Chinese Academy of Sciences; Hefei University; Harokopio University; Shenzhen University; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Soochow University; National University of Defense Technology; University of Tsukuba; Moscow Institute of Physics and Technology; Aristotle University of Thessaloniki; Universidade da Coruña; Bulgarian Academy of Sciences; Universität Hamburg; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; National and Kapodistrian University of Athens; Chinese Academy of Sciences; University of North Carolina Wilmington; Université de Toulouse; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; Technische Universität Berlin; University of Bristol; Université de Strasbourg; Nanjing Normal University; École Polytechnique Fédérale de Lausanne; Ulster University; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; Indian Institute of Technology Kanpur; University of the West of England; Hamad Bin Khalifa University; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; Friedrich-Schiller-Universität Jena; University of Cyprus; Edinburgh Napier University; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; Universitat Politècnica de Catalunya; Universidade de Aveiro; Technische Universität Dresden; Northwestern Polytechnical University; King's College London; University of Dundee; Northwestern University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; KU Leuven; Kyungpook National University; Université de Bordeaux; Northwest Normal University; Ritsumeikan University; Baylor University; Arizona State University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386938279","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386938613","doi":"10.1007/978-3-031-44198-1","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of North Carolina Wilmington; Télécom Paris; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; University of Moratuwa; Istituto Italiano di Tecnologia; Handong Global University; Harokopio University; Mount Kenya University; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Soochow University; Istanbul Teknik Üniversitesi; University of Tsukuba; Aristotle University of Thessaloniki; Università Cattolica del Sacro Cuore; Universität Hamburg; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; Shanghai Jiao Tong University; Akademie Věd České Republiky; Technische Universität Berlin; University of Bristol; Université de Strasbourg; National and Kapodistrian University of Athens; Chinese Academy of Sciences; York University; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; Iowa State University; Ulster University; Arizona State University; Technische Universiteit Eindhoven; University of the West of England; Shenzhen University; University of Leicester; Northwestern University; Hamad Bin Khalifa University; Universitat Jaume I; Tongji University; Politechnika Poznańska; Baidu; Université du Littoral Côte d'Opale; Khalifa University of Science, Technology and Research; Univerzita Komenského v Bratislave; Friedrich-Schiller-Universität Jena; University of Cyprus; Università degli Studi di Siena; Deutsches Forschungszentrum für Künstliche Intelligenz; Central South University; Kyungpook National University; KU Leuven; Nanjing Normal University; University of Nevada, Reno; University of Southern California; University of Essex; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Dundee; Université de Bordeaux; Northwest Normal University; Ritsumeikan University; Baylor University; Guilin University of Electronic Technology","keywords":"Computer science; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386938613","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386939360","doi":"10.1007/978-3-031-44195-0","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"University of North Carolina Wilmington; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; Harokopio University; Shenzhen University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; University of Bristol; Université de Strasbourg; Technische Universität Berlin; Northwest Normal University; Université de Bordeaux; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; National and Kapodistrian University of Athens; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; University of the West of England; Hamad Bin Khalifa University; Aristotle University of Thessaloniki; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; University of Cyprus; Friedrich-Schiller-Universität Jena; Ritsumeikan University; Baylor University; Kyungpook National University; KU Leuven; Nanjing Normal University; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Tsukuba; University of Dundee; Soochow University; Arizona State University; Northwestern University; Universität Hamburg; Ulster University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Focus (optics); Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386939360","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386939472","doi":"10.1007/978-3-031-44207-0","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai University of Electric Power; Université de Franche-Comté; Hefei University of Technology; Consejo Superior de Investigaciones Científicas; Southern University of Science and Technology; Universidad Autónoma de Tamaulipas; University of Chinese Academy of Sciences; Hefei University; Harokopio University; Shenzhen University; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Soochow University; National University of Defense Technology; University of Tsukuba; Moscow Institute of Physics and Technology; Aristotle University of Thessaloniki; Universidade da Coruña; Bulgarian Academy of Sciences; Universität Hamburg; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; Shanghai Jiao Tong University; Akademie Věd České Republiky; Univerzita Komenského v Bratislave; Khalifa University of Science, Technology and Research; National and Kapodistrian University of Athens; Chinese Academy of Sciences; University of North Carolina Wilmington; Université de Toulouse; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; Technische Universität Berlin; University of Bristol; Université de Strasbourg; Nanjing Normal University; École Polytechnique Fédérale de Lausanne; Ulster University; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; Indian Institute of Technology Kanpur; University of the West of England; Hamad Bin Khalifa University; Politechnika Poznańska; Universitat Jaume I; Tongji University; Baidu; Friedrich-Schiller-Universität Jena; University of Cyprus; Edinburgh Napier University; University of Nevada, Reno; Deutsches Forschungszentrum für Künstliche Intelligenz; Université du Littoral Côte d'Opale; Universitat Politècnica de Catalunya; Universidade de Aveiro; Technische Universität Dresden; Northwestern Polytechnical University; King's College London; University of Dundee; Northwestern University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; KU Leuven; Kyungpook National University; Université de Bordeaux; Northwest Normal University; Ritsumeikan University; Baylor University; Arizona State University; University of Southern California","keywords":"Computer science; Artificial neural network; Artificial intelligence; Focus (optics); Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386939472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386972918","doi":"10.1007/978-3-031-44201-8","title":"Artificial Neural Networks and Machine Learning – ICANN 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of North Carolina Wilmington; Télécom Paris; Universidad Autónoma de Tamaulipas; Shanghai University of Electric Power; Université de Franche-Comté; Universitat Politècnica de Catalunya; Hefei University of Technology; Southern University of Science and Technology; Hefei University; University of Moratuwa; Istituto Italiano di Tecnologia; Handong Global University; Harokopio University; Mount Kenya University; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Soochow University; Istanbul Teknik Üniversitesi; University of Tsukuba; Aristotle University of Thessaloniki; Università Cattolica del Sacro Cuore; Universität Hamburg; University of Electronic Science and Technology of China; Universitetet i Oslo; Leibniz-Gemeinschaft; Nanjing University of Science and Technology; Shanghai Jiao Tong University; Akademie Věd České Republiky; Technische Universität Berlin; University of Bristol; Université de Strasbourg; National and Kapodistrian University of Athens; Chinese Academy of Sciences; York University; University of Brighton; Universiteit Leiden; Eberhard Karls Universität Tübingen; Iowa State University; Ulster University; Arizona State University; Technische Universiteit Eindhoven; University of the West of England; Shenzhen University; University of Leicester; Northwestern University; Hamad Bin Khalifa University; Universitat Jaume I; Tongji University; Politechnika Poznańska; Baidu; Université du Littoral Côte d'Opale; Khalifa University of Science, Technology and Research; Univerzita Komenského v Bratislave; Friedrich-Schiller-Universität Jena; University of Cyprus; Università degli Studi di Siena; Deutsches Forschungszentrum für Künstliche Intelligenz; Central South University; Kyungpook National University; KU Leuven; Nanjing Normal University; University of Nevada, Reno; University of Southern California; University of Essex; Northwestern Polytechnical University; King's College London; Eidgenössisches Nuklearsicherheitsinspektorat; České Vysoké Učení Technické v Praze; Acadia University; University of Dundee; Université de Bordeaux; Northwest Normal University; Ritsumeikan University; Baylor University; Guilin University of Electronic Technology","keywords":"Computer science; Artificial neural network; Artificial intelligence; Focus (optics); Machine learning","score_opus":0.025498889734462703,"score_gpt":0.27861200520874996,"score_spread":0.2531131154742873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386972918","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021706368,0.19595625,0.30036575,0.0038766523,0.021448154,0.00011583858,0.001183768,0.0024201307,0.47246283],"genre_scores_gemma":[0.013990243,0.07862879,0.0817089,0.0012700427,0.0066108773,0.00011051484,0.0014751712,0.0011459314,0.81505954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978095,0.000024665564,0.000013908375,0.000039493912,0.00012950902,0.0000114436625],"domain_scores_gemma":[0.99967265,0.00013720704,0.000020054462,0.000037357593,0.00011076747,0.000022102593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032692007,0.0013092777,0.00094648753,0.0014759895,0.00029867832,0.0016017488,0.0006760216,0.001273172,0.03865356],"category_scores_gemma":[0.000877159,0.0005506048,0.00047559492,0.002684679,0.0005519928,0.0020605745,0.00073432224,0.0017703536,0.033331078],"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.00005779659,0.000049682712,0.00013130561,0.0005528721,0.000046705405,0.00008284066,0.000025393992,0.009428366,0.002985055,0.04229933,0.32017344,0.6241673],"study_design_scores_gemma":[0.000008480823,0.00006442331,0.00084483443,0.00035871114,0.000034866775,0.0006640402,0.000021122734,0.040614784,0.0025937674,0.058361568,0.8963865,0.000046898556],"about_ca_topic_score_codex":0.0014076601,"about_ca_topic_score_gemma":0.0025588267,"teacher_disagreement_score":0.03865356,"about_ca_system_score_codex":0.0005257758,"about_ca_system_score_gemma":0.00046703877,"threshold_uncertainty_score":0.129309},"labels":[],"label_agreement":null},{"id":"W4386974086","doi":"10.1007/978-3-031-43380-1","title":"Graph-Theoretic Concepts in Computer Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sorbonne Université; Masarykova Univerzita; Université de Fribourg; Universidad de Chile; Université d'Orléans; Ben-Gurion University of the Negev; Massachusetts Institute of Technology; Università degli Studi di Parma; Victoria University of Wellington; Durham University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University of California, Irvine; American University of Beirut; McGill University; Victoria University; Univerzita Karlova v Praze; Iowa State University; Università Bocconi; National Science Foundation","keywords":"Computer science; Theoretical computer science; Graph","score_opus":0.011466161515425214,"score_gpt":0.25704008768664466,"score_spread":0.24557392617121945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386974086","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003491066,0.07006422,0.20510675,0.008020054,0.007822033,0.00012517734,0.00094037945,0.0010733721,0.703357],"genre_scores_gemma":[0.07583113,0.098430954,0.14485301,0.005258043,0.008996167,0.0005018563,0.0021536644,0.0015951449,0.66238004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974805,0.000049589897,0.0000097052825,0.000054661996,0.00011720696,0.000020907106],"domain_scores_gemma":[0.999622,0.00021175174,0.000018089533,0.0000473473,0.00006417169,0.000036542457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025945815,0.0013017816,0.00089384714,0.002818084,0.0010073171,0.0027443026,0.00119181,0.00081392366,0.02969552],"category_scores_gemma":[0.0009562306,0.00045228263,0.0005192984,0.006034455,0.001997106,0.005776597,0.0010549874,0.0026323225,0.012994015],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004928069,0.000017075781,0.000034173798,0.0002696525,0.000007975158,0.000025277412,0.00010220993,0.00076315127,0.00041699022,0.8231117,0.11174931,0.06349754],"study_design_scores_gemma":[0.0000036963067,0.000006248023,0.00008720427,0.000092439586,0.000008319309,0.00010607736,0.000056343066,0.0014147208,0.00020194534,0.67469597,0.3233209,0.000006044679],"about_ca_topic_score_codex":0.000875313,"about_ca_topic_score_gemma":0.0013669365,"teacher_disagreement_score":0.02969552,"about_ca_system_score_codex":0.0015341004,"about_ca_system_score_gemma":0.0007344812,"threshold_uncertainty_score":0.09934139},"labels":[],"label_agreement":null},{"id":"W4386974107","doi":"10.1007/978-3-031-43380-1_7","title":"Nonplanar Graph Drawings with k Vertices per Face","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council","keywords":"Planar graph; Combinatorics; Book embedding; Outerplanar graph; Symmetric graph; Wheel graph; Mathematics; Path graph; Discrete mathematics; Polyhedral graph; Multiple edges; Graph; Computer science; Graph power; 1-planar graph; Pathwidth; Line graph; Voltage graph","score_opus":0.015204831075908814,"score_gpt":0.2343688975154989,"score_spread":0.21916406643959008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386974107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0305546,0.0012466614,0.730569,0.0006709094,0.0006526198,0.000324499,0.0019103611,0.0027280054,0.23134336],"genre_scores_gemma":[0.22126868,0.0030828742,0.52974737,0.00032581209,0.00019451827,0.00036532347,0.003897793,0.0015697712,0.23954791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950564,0.00009146306,0.000024344517,0.0001387128,0.0001787315,0.0000610877],"domain_scores_gemma":[0.9992361,0.00020854086,0.00006109441,0.00027584418,0.00017113319,0.0000472283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900665,0.0010611189,0.00067516946,0.00065484265,0.0006511975,0.0012169704,0.0022674634,0.0010615546,0.06830495],"category_scores_gemma":[0.0015135767,0.0009221955,0.0005014873,0.0012249396,0.00048631313,0.0019453837,0.0011857828,0.0015070962,0.017849416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027202247,0.00015757114,0.00033203448,0.0013200849,0.000048088947,0.0006041621,0.00031435315,0.054233633,0.03620771,0.19420315,0.10075544,0.6115519],"study_design_scores_gemma":[0.00016871176,0.00024831068,0.002274095,0.00037479887,0.00008590066,0.0027154353,0.00036264517,0.17358395,0.02916892,0.29054365,0.50036424,0.00010935119],"about_ca_topic_score_codex":0.0010841251,"about_ca_topic_score_gemma":0.002990684,"teacher_disagreement_score":0.06830495,"about_ca_system_score_codex":0.0005603173,"about_ca_system_score_gemma":0.00032323797,"threshold_uncertainty_score":0.22850287},"labels":[],"label_agreement":null},{"id":"W4387068942","doi":"10.1007/978-3-031-43366-5_2","title":"TrainSec: A Simulation Framework for Security Modeling and Evaluation in CBTC Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Transport Canada; Queen's University","funders":"","keywords":"Computer science; Train; Wireless; Computer network; Computer security; Embedded system; Distributed computing; Real-time computing; Telecommunications","score_opus":0.02880496708335694,"score_gpt":0.275067708380914,"score_spread":0.24626274129755704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387068942","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.012624512,0.00023570748,0.9496012,0.00033806264,0.00019003624,0.0003600165,0.0023216312,0.016796507,0.017532302],"genre_scores_gemma":[0.3178094,0.00087245106,0.64368904,0.00041527927,0.00010308451,0.0016705282,0.0071050585,0.0056650676,0.022670113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923956,0.0002898999,0.00005501729,0.00007757261,0.0002565788,0.00008139579],"domain_scores_gemma":[0.9988845,0.0005690765,0.000056589597,0.00014822296,0.000269654,0.00007195915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014397393,0.0013235422,0.0007989514,0.0007806739,0.00066595426,0.0015704661,0.0025308551,0.0014336195,0.013697953],"category_scores_gemma":[0.0030015693,0.00065994187,0.0008138299,0.0007327812,0.0005105622,0.0014474647,0.0011774859,0.0015848095,0.0021675413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118180375,0.00010758918,0.0006697527,0.00010242389,0.00005113998,0.00006655144,0.0000722511,0.9279369,0.0022184167,0.021884631,0.01701979,0.02975234],"study_design_scores_gemma":[0.000021272263,0.000016770391,0.00006958178,0.000014007629,0.000009438627,0.000014812907,0.0000083371015,0.98670226,0.00096953334,0.0034481534,0.008716427,0.000009436117],"about_ca_topic_score_codex":0.024083447,"about_ca_topic_score_gemma":0.018658139,"teacher_disagreement_score":0.024083447,"about_ca_system_score_codex":0.0013616269,"about_ca_system_score_gemma":0.00207994,"threshold_uncertainty_score":0.04788649},"labels":[],"label_agreement":null},{"id":"W4387195735","doi":"10.1007/978-3-031-43085-5_2","title":"Low-Dimensional Space Modeling-Based Differential Evolution: A Scalability Perspective on bbob-largescale suite","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"Polytechnique Montréal","funders":"","keywords":"Scalability; Computer science; Curse of dimensionality; Differential evolution; Dimensionality reduction; Mathematical optimization; Suite; Global optimization; Artificial intelligence; Algorithm; Mathematics; Database","score_opus":0.024141184410859277,"score_gpt":0.28105012722075134,"score_spread":0.25690894280989207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387195735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020888047,0.0009788617,0.94250995,0.00088355574,0.00016476757,0.00007311112,0.00010885446,0.0017097706,0.03268308],"genre_scores_gemma":[0.4479458,0.0010163803,0.53182125,0.0003662647,0.00009958105,0.00021465859,0.00049923826,0.0005834552,0.017453326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994764,0.00016215474,0.000016448703,0.000048786867,0.00024192042,0.000054358094],"domain_scores_gemma":[0.999308,0.0002989257,0.000027482327,0.00015409008,0.00016237314,0.00004912125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991579,0.00059506245,0.00097120134,0.00034093863,0.00043146696,0.001495434,0.001552062,0.0007529484,0.0066961925],"category_scores_gemma":[0.002925996,0.00023263403,0.00048141403,0.0008769338,0.0005580992,0.0013645887,0.0015911919,0.0016954996,0.001285486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014944683,0.00015235665,0.00090511714,0.00018185901,0.000060457238,0.00008921087,0.00008769245,0.62061113,0.0069929464,0.13496281,0.011770194,0.22403672],"study_design_scores_gemma":[0.0000056328868,0.000015261172,0.00006165128,0.0000070113574,0.0000047595204,0.000015014057,0.000008856781,0.984934,0.0008458716,0.011442765,0.002656357,0.000002858073],"about_ca_topic_score_codex":0.0035732465,"about_ca_topic_score_gemma":0.0036295883,"teacher_disagreement_score":0.0066961925,"about_ca_system_score_codex":0.00095855107,"about_ca_system_score_gemma":0.00083342125,"threshold_uncertainty_score":0.022400975},"labels":[],"label_agreement":null},{"id":"W4387197967","doi":"10.1007/978-3-031-44274-2_31","title":"Dispersion of Mobile Robots in Spite of Faults","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Robot; Algorithm; Combinatorics; Binary logarithm; A priori and a posteriori; Computer science; Node (physics); Discrete mathematics; Topology (electrical circuits); Physics; Mathematics; Artificial intelligence","score_opus":0.020573518830420332,"score_gpt":0.2671426386499722,"score_spread":0.24656911981955185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387197967","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.7571499,0.0021324386,0.21281026,0.0015638429,0.00039605278,0.000044113724,0.00016478036,0.00037673587,0.02536194],"genre_scores_gemma":[0.9925788,0.00025067438,0.0026538866,0.000039792925,0.00007348211,0.000013253111,0.000044864722,0.00004186992,0.004303308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978024,0.000031337127,0.000011406239,0.000048087866,0.00008302304,0.000045813442],"domain_scores_gemma":[0.99853706,0.0006327804,0.00031579225,0.00015023645,0.00019584216,0.00016829521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028831355,0.00043879036,0.00081967935,0.0011755442,0.0007137861,0.0011093414,0.0010661483,0.0015384473,0.0017300928],"category_scores_gemma":[0.0035885726,0.0003820329,0.00039286693,0.00071794493,0.0013366237,0.0012573051,0.0011580636,0.0007853946,0.0003327048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006006745,0.00008055428,0.0045701135,0.00022729668,0.00009990964,0.001192,0.00080784777,0.8374165,0.029393615,0.0844755,0.0032874013,0.037848584],"study_design_scores_gemma":[0.000035255485,0.0001737689,0.0021836676,0.00002613948,0.000022933766,0.0003589638,0.00029717738,0.94413126,0.002512908,0.04847954,0.00174786,0.000030570816],"about_ca_topic_score_codex":0.0013153915,"about_ca_topic_score_gemma":0.00069206004,"teacher_disagreement_score":0.0017300928,"about_ca_system_score_codex":0.0006443169,"about_ca_system_score_gemma":0.0002468494,"threshold_uncertainty_score":0.00578773},"labels":[],"label_agreement":null},{"id":"W4387198129","doi":"10.1007/978-3-031-44274-2","title":"Stabilization, Safety, and Security of Distributed Systems","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Indian Statistical Institute; Nanjing Institute of Technology; Università di Pisa; Université Paris-Saclay; Universidad Nacional Autónoma de México; National Taiwan University; Université Paris Diderot; Universität Salzburg; Centre National de la Recherche Scientifique; Sapienza Università di Roma; Microsoft Research; University of Waterloo; Indian Institute of Technology Madras; University of Thessaly; Universidad de Chile; Technische Universiteit Delft; Università degli Studi di Perugia; Universidad Politécnica de Madrid; Agence Nationale de la Recherche; University of Cyprus; Augusta University; Banaras Hindu University; Institut national de recherche en informatique et en automatique (INRIA); Kent State University; Sorbonne Université; Università degli Studi di Milano; University of Texas at Austin; University of Nevada, Reno; Arizona State University; Universidad de Concepción; Indian Institute of Technology Jodhpur; Boston College; University of Ottawa; Indian Institute of Technology Bhilai; Johns Hopkins University; Aix-Marseille Université; Université de Strasbourg","keywords":"Computer science; Computer security; Distributed computing","score_opus":0.009840999956465538,"score_gpt":0.22648309954637966,"score_spread":0.21664209958991412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387198129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06155896,0.020801648,0.6936657,0.005086071,0.0015742005,0.00006963593,0.00024070157,0.0016338027,0.21536928],"genre_scores_gemma":[0.829865,0.008494206,0.04810725,0.00034360515,0.0016766712,0.00015007061,0.0002933027,0.00026693012,0.11080303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997199,0.000045474382,0.000013288307,0.00005497386,0.00013692764,0.000029360972],"domain_scores_gemma":[0.99924445,0.00039037727,0.00005825117,0.00014347734,0.00012018682,0.00004333568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033600282,0.00051342574,0.00040855145,0.00052579126,0.00049500813,0.0012474576,0.00045100597,0.00044724214,0.0038927733],"category_scores_gemma":[0.0014635985,0.00022406637,0.00025666802,0.0005807376,0.0016375037,0.0015913078,0.00079327804,0.0015077054,0.0009222456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015371732,0.000060855054,0.000333417,0.00017094555,0.000019432608,0.000070730704,0.00036146626,0.049907707,0.010151736,0.7317066,0.02194727,0.18511608],"study_design_scores_gemma":[0.000025759884,0.00007607745,0.0002872568,0.000034398126,0.000010750256,0.000063856794,0.00005934729,0.062142704,0.0024851484,0.89312035,0.04168505,0.00000924241],"about_ca_topic_score_codex":0.00084648345,"about_ca_topic_score_gemma":0.00034406324,"teacher_disagreement_score":0.0038927733,"about_ca_system_score_codex":0.00066491484,"about_ca_system_score_gemma":0.0006601593,"threshold_uncertainty_score":0.013022661},"labels":[],"label_agreement":null},{"id":"W4387198151","doi":"10.1007/978-3-031-44274-2_13","title":"The Fagnano Triangle Patrolling Problem (Extended Abstract)","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Patrolling; Dynamical billiards; Optimization problem; Computer science; Trajectory; Inscribed figure; Enhanced Data Rates for GSM Evolution; Mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Geometry; Physics","score_opus":0.02806134879993998,"score_gpt":0.2626317303766687,"score_spread":0.23457038157672871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387198151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06791516,0.0057050716,0.5424234,0.0034547218,0.0019615653,0.0003737841,0.001819286,0.0011393094,0.3752077],"genre_scores_gemma":[0.41718042,0.0048570205,0.32631904,0.00090276316,0.00092643197,0.00043927965,0.0032988908,0.00066773075,0.24540846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979526,0.000029272538,0.000005925372,0.000072147675,0.00005842658,0.000038985505],"domain_scores_gemma":[0.9998311,0.00007750528,0.000018752433,0.000032744992,0.000019931922,0.000019998162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016375941,0.0008014189,0.000801033,0.00053259544,0.0008268262,0.0012272572,0.0012066598,0.0014832279,0.038704567],"category_scores_gemma":[0.0010398097,0.00030160736,0.0006159883,0.0011120468,0.00073786365,0.0014628266,0.0011922069,0.0016546092,0.004336875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003100265,0.00016433159,0.00054695195,0.0007344229,0.000034078774,0.000520494,0.00017465219,0.17992164,0.008097755,0.22777434,0.09445192,0.48726946],"study_design_scores_gemma":[0.00009248208,0.00016929003,0.0011225017,0.00022196026,0.000029734225,0.0006988384,0.00022022057,0.33955243,0.004391807,0.47182018,0.18163443,0.0000461108],"about_ca_topic_score_codex":0.00371426,"about_ca_topic_score_gemma":0.003675363,"teacher_disagreement_score":0.038704567,"about_ca_system_score_codex":0.00062033214,"about_ca_system_score_gemma":0.00043835072,"threshold_uncertainty_score":0.1294797},"labels":[],"label_agreement":null},{"id":"W4387211026","doi":"10.1007/978-3-031-43993-3_20","title":"BrainUSL: Unsupervised Graph Structure Learning for Functional Brain Network Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Graph; Unsupervised learning; Machine learning; Functional magnetic resonance imaging; Pattern recognition (psychology); Theoretical computer science; Neuroscience","score_opus":0.03610939992566316,"score_gpt":0.2540565635664003,"score_spread":0.21794716364073713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009963531,0.0003010418,0.9605711,0.00013848403,0.000112033405,0.000068165755,0.0020337088,0.034022544,0.001756673],"genre_scores_gemma":[0.019550633,0.00054970634,0.95031726,0.00020552686,0.00011877707,0.0006289802,0.009593479,0.009010301,0.010025433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995937,0.000092014874,0.000019569326,0.000102921644,0.00016397389,0.000027846052],"domain_scores_gemma":[0.9992218,0.0004481665,0.000034237575,0.00015146284,0.000106945445,0.000037410144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007690826,0.0020095205,0.0012404835,0.0017742612,0.0006407147,0.0014009993,0.0026285644,0.0012526929,0.030308707],"category_scores_gemma":[0.002870154,0.0011993827,0.0017583242,0.0015895352,0.000597844,0.0017053807,0.0019484551,0.0027383298,0.016491523],"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.00013233795,0.00011679786,0.0003610031,0.00063056266,0.00019499187,0.0001838256,0.0001354428,0.08724495,0.008415636,0.02957448,0.21440776,0.65860224],"study_design_scores_gemma":[0.00005618708,0.00004077072,0.00030686043,0.000060165927,0.00003545899,0.00013411595,0.000024098512,0.88931453,0.0054097055,0.06247197,0.04210971,0.00003645662],"about_ca_topic_score_codex":0.0036790594,"about_ca_topic_score_gemma":0.009685714,"teacher_disagreement_score":0.030308707,"about_ca_system_score_codex":0.00061928004,"about_ca_system_score_gemma":0.00084691384,"threshold_uncertainty_score":0.10139269},"labels":[],"label_agreement":null},{"id":"W4387211034","doi":"10.1007/978-3-031-43895-0_46","title":"A Flexible Framework for Simulating and Evaluating Biases in Deep Learning-Based Medical Image Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Computer science; Flexibility (engineering); Deep learning; Artificial intelligence; Machine learning; Modular design; Convolutional neural network; Generalization; Inductive bias; Data science; Multi-task learning","score_opus":0.07095669370079277,"score_gpt":0.37068318070971723,"score_spread":0.29972648700892446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211034","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.007833405,0.0001164732,0.9903024,0.00011872219,0.000032468233,0.000042565847,0.00006646761,0.0007426374,0.0007448089],"genre_scores_gemma":[0.361907,0.00016911772,0.634574,0.00023444722,0.0000626684,0.00024058827,0.00018002266,0.00038509944,0.0022470332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994628,0.00018467855,0.000037049904,0.0000900649,0.00016817143,0.00005730729],"domain_scores_gemma":[0.99725926,0.0017839827,0.00019721358,0.00030330956,0.00031797486,0.0001381493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027311943,0.000722544,0.00088927004,0.0006158715,0.00052687014,0.0014906575,0.0033748527,0.0022175107,0.0028033466],"category_scores_gemma":[0.009985809,0.0008298797,0.0008886492,0.0006050143,0.0011564322,0.0014764689,0.0026149647,0.0020412684,0.00036750565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051717867,0.000029866482,0.00034096086,0.000030120369,0.000039000886,0.0000341582,0.000023693841,0.96378577,0.0018879266,0.011668103,0.00051758427,0.0215911],"study_design_scores_gemma":[0.0000042416073,0.000004236554,0.000015927164,0.0000022064219,0.0000024297203,0.000004667913,8.878072e-7,0.99600166,0.0003918953,0.003488582,0.00008128724,0.000001970887],"about_ca_topic_score_codex":0.00822154,"about_ca_topic_score_gemma":0.0085067125,"teacher_disagreement_score":0.00822154,"about_ca_system_score_codex":0.0013340851,"about_ca_system_score_gemma":0.0015134455,"threshold_uncertainty_score":0.016347349},"labels":[],"label_agreement":null},{"id":"W4387211047","doi":"10.1007/978-3-031-43895-0_30","title":"FedSoup: Improving Generalization and Personalization in Federated Learning via Selective Model Interpolation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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 British Columbia","funders":"","keywords":"Overfitting; Computer science; Generalization; Interpolation (computer graphics); Personalization; Code (set theory); Artificial intelligence; Machine learning; Maxima and minima; Data mining; Image (mathematics); Artificial neural network","score_opus":0.018088572857526065,"score_gpt":0.24132751816574685,"score_spread":0.22323894530822078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01288542,0.0005251577,0.98039687,0.00010813591,0.00008601571,0.000045514393,0.00015369606,0.0049506132,0.0008485662],"genre_scores_gemma":[0.29174027,0.00050712173,0.69341916,0.00046585104,0.00014093005,0.00018142913,0.0018669708,0.0010426278,0.01063564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897325,0.00026666504,0.000058361624,0.00040250132,0.00020580726,0.000093429946],"domain_scores_gemma":[0.9981529,0.000791392,0.000055781034,0.0006921764,0.00022413697,0.00008357314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019988338,0.0013719498,0.0022497803,0.0010645422,0.00074757833,0.001226362,0.002914662,0.0024075531,0.0045643887],"category_scores_gemma":[0.0045752297,0.0008524354,0.0018038292,0.0011771119,0.0009118887,0.0037192446,0.0038457192,0.003532781,0.001718703],"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.00044057937,0.00037920725,0.0007996005,0.00011825882,0.0002012176,0.00017927088,0.0001743733,0.27471277,0.0077631427,0.0078380555,0.011085548,0.69630796],"study_design_scores_gemma":[0.000011526608,0.000036257057,0.000067508234,0.000007081562,0.000014047835,0.00003358322,0.00001200654,0.98981464,0.002203222,0.007063847,0.0007279044,0.000008397942],"about_ca_topic_score_codex":0.0076957853,"about_ca_topic_score_gemma":0.008744938,"teacher_disagreement_score":0.0076957853,"about_ca_system_score_codex":0.00081156817,"about_ca_system_score_gemma":0.0011031532,"threshold_uncertainty_score":0.015302002},"labels":[],"label_agreement":null},{"id":"W4387211064","doi":"10.1007/978-3-031-43895-0_47","title":"Client-Level Differential Privacy via Adaptive Intermediary in Federated Medical Imaging","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Differential privacy; Computer science; Context (archaeology); Federated learning; Intermediary; Segmentation; Internet privacy; Computer security; Artificial intelligence; Data mining; Business","score_opus":0.03504116705338925,"score_gpt":0.2757032282418008,"score_spread":0.24066206118841157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020275041,0.0004569988,0.9753145,0.000423233,0.000036022986,0.000058608355,0.000071720926,0.000978222,0.0023855108],"genre_scores_gemma":[0.77385557,0.0003528905,0.21883823,0.00023225328,0.000085503896,0.00008513148,0.00018350351,0.00015294658,0.0062139393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959525,0.0015924724,0.00023749059,0.0006009558,0.0011117916,0.0005048832],"domain_scores_gemma":[0.9952443,0.0017113453,0.0002212681,0.0024009254,0.00029060993,0.00013156343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004379822,0.00044879963,0.0015729055,0.0006811714,0.0012147964,0.0039850553,0.003377399,0.0025416925,0.0026868428],"category_scores_gemma":[0.006981925,0.00060121535,0.0009902319,0.0016675163,0.002031309,0.0051626447,0.0066520083,0.0027960765,0.0007740094],"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.002236586,0.0006519102,0.00323703,0.0003005515,0.00020924637,0.0022368014,0.0011205792,0.16760433,0.027655771,0.4336594,0.010144599,0.35094324],"study_design_scores_gemma":[0.00003744275,0.00008927036,0.000477862,0.000035388373,0.000052234675,0.0014525832,0.00012273915,0.8112286,0.02038866,0.16086741,0.005203687,0.000044142416],"about_ca_topic_score_codex":0.00083247403,"about_ca_topic_score_gemma":0.0005652522,"teacher_disagreement_score":0.004379822,"about_ca_system_score_codex":0.0013931062,"about_ca_system_score_gemma":0.001271714,"threshold_uncertainty_score":0.02316302},"labels":[],"label_agreement":null},{"id":"W4387211069","doi":"10.1007/978-3-031-43993-3_28","title":"Community-Aware Transformer for Autism Prediction in fMRI Connectome","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interpretability; Computer science; Connectome; Autism; Transformer; Functional magnetic resonance imaging; Autism spectrum disorder; Machine learning; Artificial intelligence; Human Connectome Project; Functional connectivity; Neuroscience; Psychology","score_opus":0.057967923581533756,"score_gpt":0.2778567136053711,"score_spread":0.21988879002383738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12984331,0.0015880538,0.84106016,0.00044819052,0.00020097764,0.00018268391,0.0052446104,0.011408288,0.010023656],"genre_scores_gemma":[0.77231526,0.00068354816,0.21195842,0.0001391589,0.00016555675,0.00019305309,0.0060991994,0.00046609706,0.007979763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985373,0.000021813612,0.0000068358413,0.000057738034,0.000029167742,0.00003071469],"domain_scores_gemma":[0.9997248,0.00010982916,0.000021537584,0.00003673081,0.00008222561,0.000024808718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934456,0.0006592507,0.0005022531,0.0015626602,0.00043987838,0.00047363597,0.0008139396,0.00070511556,0.0067141494],"category_scores_gemma":[0.0012856085,0.00021199528,0.0006402822,0.0010312309,0.00015895312,0.00072476774,0.00077430333,0.00043660382,0.002191248],"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.00071359234,0.00027996436,0.018702043,0.00020286732,0.00019561763,0.00080706173,0.000118107,0.043357205,0.026821973,0.004622733,0.026430048,0.8777487],"study_design_scores_gemma":[0.00002884077,0.00008457386,0.011164708,0.00004802055,0.00009804808,0.0010214362,0.000102444916,0.95769525,0.012216389,0.013434384,0.004072446,0.000033424945],"about_ca_topic_score_codex":0.006787154,"about_ca_topic_score_gemma":0.01578611,"teacher_disagreement_score":0.006787154,"about_ca_system_score_codex":0.00024647807,"about_ca_system_score_gemma":0.00048673627,"threshold_uncertainty_score":0.022460997},"labels":[],"label_agreement":null},{"id":"W4387211173","doi":"10.1007/978-3-031-43901-8_65","title":"Learning Reliability of Multi-modality Medical Images for Tumor Segmentation via Evidence-Identified Denoising Diffusion Probabilistic Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Western University","funders":"","keywords":"Modality (human–computer interaction); Computer science; Segmentation; Reliability (semiconductor); Probabilistic logic; Artificial intelligence; Image segmentation; Medical imaging; Task (project management); Noise (video); Pattern recognition (psychology); Image (mathematics); Physics","score_opus":0.035843787594029966,"score_gpt":0.3299367687172087,"score_spread":0.2940929811231787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01686605,0.0007088883,0.98128545,0.00026495056,0.000020780299,0.000022890614,0.00008532679,0.0002732643,0.00047242816],"genre_scores_gemma":[0.5751062,0.0016386693,0.41847196,0.00018057202,0.0001899401,0.00013513595,0.00070673955,0.0003301793,0.0032406026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992021,0.00022459906,0.00006796053,0.00022549939,0.00022518606,0.00005456846],"domain_scores_gemma":[0.99363846,0.004604966,0.0005943176,0.00037970106,0.0006874154,0.000095230294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034951116,0.0008941819,0.001609945,0.0017282533,0.0002682945,0.0014737163,0.0015812351,0.002380563,0.0009219109],"category_scores_gemma":[0.014095147,0.0010053349,0.0017655737,0.000957133,0.0010091609,0.0017479156,0.0014659453,0.0020145013,0.00054176553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037450375,0.00008491406,0.003061894,0.00047752983,0.00025783858,0.00020508218,0.00019418087,0.6830734,0.0220802,0.018464515,0.0017985337,0.2699274],"study_design_scores_gemma":[0.0000040824366,0.00002759278,0.00049530424,0.00002194746,0.000029771045,0.00007157459,0.000006696636,0.9900883,0.0025805032,0.0063649444,0.00029811202,0.000011256265],"about_ca_topic_score_codex":0.0022105174,"about_ca_topic_score_gemma":0.0027207707,"teacher_disagreement_score":0.0034951116,"about_ca_system_score_codex":0.0009052434,"about_ca_system_score_gemma":0.0008376265,"threshold_uncertainty_score":0.018484116},"labels":[],"label_agreement":null},{"id":"W4387211178","doi":"10.1007/978-3-031-43901-8_62","title":"Edge-Aware Multi-task Network for Integrating Quantification Segmentation and Uncertainty Prediction of Liver Tumor on Multi-modality Non-contrast MRI","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Modality (human–computer interaction); Artificial intelligence; Segmentation; Margin (machine learning); Pattern recognition (psychology); Feature (linguistics); Contrast (vision); Enhanced Data Rates for GSM Evolution; Image segmentation; Computer vision; Machine learning","score_opus":0.028352295192021097,"score_gpt":0.30098119613052887,"score_spread":0.2726289009385078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023597943,0.0007627497,0.9733829,0.00019496182,0.00006656982,0.000048033384,0.00017847809,0.0006833105,0.0010850604],"genre_scores_gemma":[0.6072249,0.00089696865,0.38302314,0.00042114593,0.00021441748,0.00023852148,0.00097307755,0.0002676202,0.0067404048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996642,0.000064527645,0.000017502995,0.00013453206,0.00006681768,0.000052351756],"domain_scores_gemma":[0.9994351,0.00027964695,0.000057501962,0.00004417283,0.0001484606,0.000035072022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711061,0.0012760212,0.0012849633,0.0009129012,0.0005037964,0.00093490025,0.0020267689,0.0019191196,0.0017605409],"category_scores_gemma":[0.0017966587,0.00065683125,0.0009915039,0.0010225729,0.00044463627,0.0013844629,0.0014494986,0.0011429888,0.00046625055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002595753,0.00018334306,0.0012405866,0.00012852262,0.00014203599,0.00017495168,0.00008599166,0.6885859,0.012317708,0.0032311569,0.0031389014,0.29051128],"study_design_scores_gemma":[0.0000018298542,0.000013274105,0.00010109318,0.0000030986537,0.000008303728,0.000011988164,0.0000031689976,0.99802303,0.0006823511,0.001021416,0.00012688019,0.0000036096267],"about_ca_topic_score_codex":0.0071137925,"about_ca_topic_score_gemma":0.008646119,"teacher_disagreement_score":0.0071137925,"about_ca_system_score_codex":0.0007200773,"about_ca_system_score_gemma":0.0006758387,"threshold_uncertainty_score":0.014144778},"labels":[],"label_agreement":null},{"id":"W4387211202","doi":"10.1007/978-3-031-43999-5_42","title":"InverseSR: 3D Brain MRI Super-Resolution Using a Latent Diffusion Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Nova Scotia Health Authority; St. Francis Xavier University","funders":"","keywords":"Computer science; Generative model; Real-time MRI; Diffusion MRI; Artificial intelligence; Superresolution; Resolution (logic); Image resolution; Generative grammar; Pattern recognition (psychology); Computer vision; Magnetic resonance imaging; Image (mathematics); Radiology","score_opus":0.09815763616661491,"score_gpt":0.33739609649054025,"score_spread":0.23923846032392534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010217463,0.0004822602,0.99596465,0.00012990122,0.000050928396,0.000012051326,0.00013366005,0.001175877,0.001028964],"genre_scores_gemma":[0.040742673,0.0021002954,0.9433848,0.00016077659,0.00013677138,0.000076781376,0.0009186894,0.0010184066,0.011460846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982494,0.00003436065,0.000008749328,0.00004446527,0.000074449046,0.00001302037],"domain_scores_gemma":[0.99975985,0.00009986961,0.00002137032,0.00006244099,0.000039207345,0.000017252689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045805107,0.00082806655,0.00073275715,0.0005419718,0.00018585396,0.0011059237,0.001027636,0.00119136,0.0053892657],"category_scores_gemma":[0.000929718,0.0006340707,0.00097526633,0.00080736505,0.0004651417,0.0014640953,0.0012233427,0.0013925014,0.004223841],"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.00019141227,0.00007676909,0.00025471076,0.00049521675,0.0001316038,0.00034141794,0.00016493959,0.16122891,0.06447831,0.10132114,0.032777395,0.6385381],"study_design_scores_gemma":[0.00001715745,0.000039637805,0.00018585885,0.00002889115,0.000023095978,0.0005141123,0.000014799562,0.91809434,0.0147246625,0.04189963,0.024421,0.00003681158],"about_ca_topic_score_codex":0.0011136715,"about_ca_topic_score_gemma":0.0015011515,"teacher_disagreement_score":0.0053892657,"about_ca_system_score_codex":0.00029406033,"about_ca_system_score_gemma":0.00043993813,"threshold_uncertainty_score":0.018028915},"labels":[],"label_agreement":null},{"id":"W4387211254","doi":"10.1007/978-3-031-43901-8_22","title":"EchoGLAD: Hierarchical Graph Neural Networks for Left Ventricle Landmark Detection on Echocardiograms","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Landmark; Computer science; Smoothing; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Graph; Machine learning; Computer vision; Theoretical computer science","score_opus":0.017633118464651192,"score_gpt":0.25526072146045226,"score_spread":0.23762760299580107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019953692,0.001838782,0.9318118,0.00039350978,0.0003670119,0.00014547857,0.0044272174,0.037511226,0.0035513001],"genre_scores_gemma":[0.16642703,0.0012565174,0.79945284,0.00049364346,0.00019421152,0.00033384055,0.009373811,0.0022163403,0.020251844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984276,0.00002194765,0.0000070835413,0.000058505077,0.000049429473,0.000020214475],"domain_scores_gemma":[0.9997805,0.00010010816,0.000012427945,0.00003793453,0.000052617936,0.000016545318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036329785,0.00112195,0.00067204464,0.00071267417,0.00024127535,0.00069219363,0.0016987273,0.0009888686,0.007921152],"category_scores_gemma":[0.0010324253,0.0005435515,0.0006078207,0.00072658755,0.00022259647,0.00091593625,0.001075718,0.0011851494,0.002700696],"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.00027061036,0.000108655615,0.0006931332,0.0001573702,0.00012460444,0.00012270366,0.000033121283,0.1228136,0.0071899425,0.0025392051,0.05868092,0.8072661],"study_design_scores_gemma":[0.00003019011,0.000041842486,0.00039159643,0.000016163624,0.00001771677,0.00004395153,0.000008753916,0.98798406,0.0036100524,0.0034085363,0.0044344603,0.000012633463],"about_ca_topic_score_codex":0.0132924365,"about_ca_topic_score_gemma":0.023315035,"teacher_disagreement_score":0.0132924365,"about_ca_system_score_codex":0.0004964475,"about_ca_system_score_gemma":0.0005607757,"threshold_uncertainty_score":0.026498914},"labels":[],"label_agreement":null},{"id":"W4387211282","doi":"10.1007/978-3-031-43990-2_53","title":"Bridging Ex-Vivo Training and Intra-operative Deployment for Surgical Margin Assessment with Evidential Graph Transformer","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nutritional Studies and Diet","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"","keywords":"Interpretability; Computer science; Ex vivo; Software deployment; Artificial intelligence; Transformer; Machine learning; Data mining; In vivo; Voltage","score_opus":0.0349493775551887,"score_gpt":0.31190104339494285,"score_spread":0.27695166583975417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021484483,0.00024407089,0.973444,0.00012866405,0.00007004569,0.000054434084,0.00016387535,0.0013969874,0.003013444],"genre_scores_gemma":[0.44663262,0.0006256074,0.5429544,0.00016469877,0.00005292389,0.000079094665,0.00051201537,0.0008234276,0.008155257],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996487,0.00008098728,0.000022709859,0.000088206136,0.00013281715,0.00002651226],"domain_scores_gemma":[0.9989095,0.0005851106,0.00006594219,0.00024542544,0.00016001193,0.00003401951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084828364,0.0004441523,0.00028916996,0.0005193682,0.00014315608,0.0008514366,0.00092273345,0.0007057754,0.005380195],"category_scores_gemma":[0.0024300653,0.0003060484,0.00029553246,0.0003393309,0.00046337195,0.0011809726,0.0011671091,0.00069535105,0.0019112962],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004792739,0.000130759,0.0013969418,0.00032214713,0.000029111103,0.00022860596,0.00021110469,0.024883145,0.30105755,0.007616036,0.0045303497,0.65911496],"study_design_scores_gemma":[0.00003389741,0.0005704423,0.0052015805,0.00012772842,0.00007001063,0.0025157123,0.0002592211,0.526464,0.4073189,0.026750548,0.030598348,0.00008968708],"about_ca_topic_score_codex":0.00038445383,"about_ca_topic_score_gemma":0.00077421963,"teacher_disagreement_score":0.005380195,"about_ca_system_score_codex":0.00021376298,"about_ca_system_score_gemma":0.00036111914,"threshold_uncertainty_score":0.017998517},"labels":[],"label_agreement":null},{"id":"W4387211376","doi":"10.1007/978-3-031-43990-2","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Intervention (counseling); Multimedia; Human–computer interaction; Data science; Medicine; Nursing","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211376","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387211377","doi":"10.1007/978-3-031-43907-0_45","title":"Infusing Physically Inspired Known Operators in Deep Models of Ultrasound Elastography","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Optical flow; Convolutional neural network; Displacement (psychology); Regularization (linguistics); Artificial intelligence; Elastography; Algorithm; Mathematical optimization; Mathematics; Image (mathematics); Ultrasound; Physics; Acoustics","score_opus":0.014378249925310118,"score_gpt":0.24522071773373172,"score_spread":0.2308424678084216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038089468,0.00038440299,0.9930606,0.000332355,0.00012840817,0.000007989717,0.000032211858,0.00022124505,0.0020238745],"genre_scores_gemma":[0.36413056,0.0023208992,0.60144323,0.0008731468,0.00055188837,0.00009726505,0.0002703619,0.0007029393,0.02960964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996101,0.00014905825,0.000019489153,0.00006698563,0.0001240239,0.000030258076],"domain_scores_gemma":[0.9985031,0.0009286182,0.00009858174,0.0002458427,0.00013008583,0.000093761395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221823,0.0010130961,0.0007738512,0.0004423319,0.0003559206,0.0014354624,0.0012097411,0.0019168119,0.0028862953],"category_scores_gemma":[0.00443462,0.0007052281,0.0009985414,0.00047078895,0.0019969218,0.003064751,0.0028290395,0.0033353707,0.0009304238],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102056816,0.000068898335,0.0003953747,0.00023142771,0.00007288241,0.00013123002,0.0001776987,0.44223052,0.010125542,0.41896966,0.005385584,0.12210908],"study_design_scores_gemma":[0.0000037777736,0.00002486224,0.00004436445,0.000015802663,0.0000057733964,0.00005296559,0.000009091806,0.8463226,0.0010022474,0.15049736,0.0020103129,0.000010810654],"about_ca_topic_score_codex":0.0012896709,"about_ca_topic_score_gemma":0.0018385453,"teacher_disagreement_score":0.0028862953,"about_ca_system_score_codex":0.0006645417,"about_ca_system_score_gemma":0.0004961615,"threshold_uncertainty_score":0.009655595},"labels":[],"label_agreement":null},{"id":"W4387211411","doi":"10.1007/978-3-031-43987-2_74","title":"ALL-IN: A Local GLobal Graph-Based DIstillatioN Model for Representation Learning of Gigapixel Histopathology Images With Application In Cancer Risk Assessment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"BC Cancer Agency; University of British Columbia","funders":"","keywords":"Histopathology; Computer science; Risk stratification; Artificial intelligence; Machine learning; Directed acyclic graph; Stratification (seeds); Artificial neural network; Pattern recognition (psychology); Pathology; Algorithm; Medicine; Internal medicine","score_opus":0.026802682470984152,"score_gpt":0.3208773817570254,"score_spread":0.29407469928604124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013286883,0.0006822713,0.9768563,0.00047489424,0.00015219249,0.00008053052,0.0009540189,0.005534842,0.001978098],"genre_scores_gemma":[0.31205487,0.0008604539,0.65382373,0.0008467584,0.00023879544,0.00044224688,0.0063841776,0.0019934059,0.02335564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995654,0.000121289995,0.00001986276,0.00012543502,0.0001074664,0.000060502854],"domain_scores_gemma":[0.99926394,0.0002998622,0.000044590604,0.00016019132,0.0001712738,0.00006010321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011409259,0.0015469667,0.0015735765,0.0010301818,0.0007466933,0.0013880203,0.004496565,0.0022425458,0.006961191],"category_scores_gemma":[0.0022869208,0.00072153046,0.0015624877,0.0014554419,0.00091796526,0.0025597068,0.0028795127,0.0032225363,0.0024057878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042022488,0.0002712318,0.0006306876,0.00021956247,0.00017656277,0.00013012107,0.000099255856,0.53884983,0.006683368,0.017457226,0.019557852,0.41550398],"study_design_scores_gemma":[0.000008105551,0.000025925498,0.000049362676,0.0000058155706,0.000011412045,0.000012877477,0.0000067435235,0.99165994,0.001228187,0.005991426,0.0009936809,0.000006436562],"about_ca_topic_score_codex":0.012749952,"about_ca_topic_score_gemma":0.020096954,"teacher_disagreement_score":0.012749952,"about_ca_system_score_codex":0.001147654,"about_ca_system_score_gemma":0.0013591044,"threshold_uncertainty_score":0.025351465},"labels":[],"label_agreement":null},{"id":"W4387211423","doi":"10.1007/978-3-031-43990-2_63","title":"Lesion-Aware Contrastive Learning for Diabetic Retinopathy Diagnosis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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 Alberta","funders":"","keywords":"Computer science; False positive paradox; Artificial intelligence; Discriminative model; False positives and false negatives; Diabetic retinopathy; Lesion; Deep learning; Pattern recognition (psychology); Grading (engineering); Machine learning; Supervised learning; Fundus (uterus); Feature learning; Medicine; Radiology; Pathology","score_opus":0.026698117866850737,"score_gpt":0.28922432240985047,"score_spread":0.26252620454299974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04122721,0.008363578,0.93428636,0.0003989214,0.00028003508,0.00007920621,0.00047078944,0.0022932852,0.012600607],"genre_scores_gemma":[0.39651304,0.008978789,0.5654603,0.0005139542,0.00035397665,0.000074282,0.001204512,0.00029828565,0.026602823],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999286,0.000008750152,0.000002989354,0.000020295412,0.000027840031,0.00001148833],"domain_scores_gemma":[0.999871,0.00006762045,0.000009326164,0.00001310105,0.000030427755,0.000008525861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018356128,0.00050022354,0.00032262315,0.0004170223,0.00009308378,0.00046315845,0.0006783077,0.0004835897,0.0043637594],"category_scores_gemma":[0.00048387283,0.00013518496,0.00035909042,0.000345203,0.00011388061,0.00042139489,0.00038454897,0.0005868801,0.0011999574],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012663448,0.00010367768,0.0005167211,0.00013140128,0.00003271607,0.00013116565,0.0000191804,0.015806546,0.04423946,0.0024677706,0.006146916,0.9302778],"study_design_scores_gemma":[0.00002151125,0.00028152353,0.0031307568,0.00008490948,0.00011739084,0.0017376455,0.000041338146,0.86456376,0.100264266,0.010373097,0.019347448,0.000036280664],"about_ca_topic_score_codex":0.0012567258,"about_ca_topic_score_gemma":0.0023238312,"teacher_disagreement_score":0.0043637594,"about_ca_system_score_codex":0.00019236906,"about_ca_system_score_gemma":0.00024530632,"threshold_uncertainty_score":0.014598191},"labels":[],"label_agreement":null},{"id":"W4387211438","doi":"10.1007/978-3-031-43999-5","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":169,"is_retracted":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; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Multimedia; Intervention (counseling); Human–computer interaction; Medical physics; Medicine","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211438","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387211475","doi":"10.1007/978-3-031-43898-1_55","title":"Trust Your Neighbours: Penalty-Based Constraints for Model Calibration","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Constraint (computer-aided design); Smoothing; Pixel; Mathematical optimization; Flexibility (engineering); Artificial intelligence; Segmentation; Perspective (graphical); Code (set theory); Data mining; Machine learning; Algorithm; Computer vision; Mathematics","score_opus":0.0470612905123171,"score_gpt":0.2920188113869439,"score_spread":0.2449575208746268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025687546,0.0001390066,0.99434173,0.0002020849,0.000053984855,0.000018137358,0.000058642938,0.00013697216,0.0024806012],"genre_scores_gemma":[0.3738057,0.0006070194,0.6089956,0.00039768533,0.00022598893,0.0003333745,0.00069028145,0.001079601,0.013864713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785054,0.0011249651,0.000098155404,0.00031439817,0.00049084256,0.00012122933],"domain_scores_gemma":[0.9928067,0.0048049567,0.00049978896,0.0008744612,0.0007369343,0.0002771588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040986678,0.0015976545,0.0019432895,0.00089061784,0.00089964917,0.0022370205,0.004085242,0.0036369804,0.008251997],"category_scores_gemma":[0.02637533,0.0014448713,0.0011115025,0.0014095575,0.002026656,0.004984464,0.0049669114,0.0048676115,0.0016999713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001469002,0.000042669464,0.0002671793,0.00012979584,0.000046596295,0.00010045956,0.00007654056,0.83548987,0.0012676929,0.107510895,0.0041217515,0.050799575],"study_design_scores_gemma":[0.000008503765,0.000011864708,0.000033063236,0.000013149315,0.0000036257027,0.000014494819,0.00000605376,0.9566994,0.00024953956,0.042133965,0.00081739837,0.000008854854],"about_ca_topic_score_codex":0.0037244358,"about_ca_topic_score_gemma":0.003952962,"teacher_disagreement_score":0.008251997,"about_ca_system_score_codex":0.00090201857,"about_ca_system_score_gemma":0.0010853166,"threshold_uncertainty_score":0.027605653},"labels":[],"label_agreement":null},{"id":"W4387211509","doi":"10.1007/978-3-031-43907-0_30","title":"Modeling Alzheimers’ Disease Progression from Multi-task and Self-supervised Learning Perspective with Brain Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cognition; Graph; Correlation; Artificial intelligence; Concordance; Task (project management); Perspective (graphical); Encoder; Machine learning; Pearson product-moment correlation coefficient; Cognitive psychology; Psychology; Theoretical computer science; Neuroscience; Statistics; Medicine; Mathematics","score_opus":0.023894745621040162,"score_gpt":0.30513963396192584,"score_spread":0.2812448883408857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0847636,0.0048756804,0.90535057,0.001141379,0.0001790325,0.000030045114,0.0005703902,0.00039783673,0.0026914575],"genre_scores_gemma":[0.8834923,0.0025929774,0.10409057,0.00016145421,0.0003639305,0.00007787569,0.0006699365,0.000066592314,0.008484421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998766,0.000036961184,0.000006071857,0.00004758133,0.000017036124,0.000015752834],"domain_scores_gemma":[0.9996344,0.00023354442,0.000043209242,0.00001988904,0.000053012864,0.000015916772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065597857,0.0006520561,0.00054634886,0.000400052,0.00014534028,0.0007349191,0.0007113524,0.0008119193,0.000745707],"category_scores_gemma":[0.0013682109,0.0002765315,0.0006097598,0.000394507,0.00023153402,0.0008260963,0.00040485626,0.0010030312,0.00020898448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012800383,0.000109018925,0.004967296,0.00012929933,0.00022012452,0.00019680549,0.00010773382,0.82685626,0.0031776507,0.00967068,0.003267491,0.15116964],"study_design_scores_gemma":[0.0000012190607,0.000018002971,0.00074457953,0.0000063785947,0.000015490756,0.00003314425,0.0000056013987,0.9930641,0.00023661177,0.00559237,0.00027863652,0.0000039158585],"about_ca_topic_score_codex":0.0049286573,"about_ca_topic_score_gemma":0.0066958317,"teacher_disagreement_score":0.0049286573,"about_ca_system_score_codex":0.0003795676,"about_ca_system_score_gemma":0.00030670853,"threshold_uncertainty_score":0.009799898},"labels":[],"label_agreement":null},{"id":"W4387211538","doi":"10.1007/978-3-031-43901-8_14","title":"M-GenSeg: Domain Adaptation for Target Modality Tumor Segmentation with Annotation-Efficient Supervision","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier de l’Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Modality (human–computer interaction); Leverage (statistics); Annotation; Modalities; Pattern recognition (psychology); Deep learning; Image segmentation; Machine learning","score_opus":0.025157437015896456,"score_gpt":0.26593736050759653,"score_spread":0.24077992349170008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076724235,0.00094197085,0.9493712,0.00022364872,0.00020945216,0.000115753995,0.0015933422,0.037768647,0.0021034393],"genre_scores_gemma":[0.077503204,0.00052654673,0.9004581,0.0004161313,0.00015047897,0.00028294648,0.008074952,0.0043245503,0.008263098],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909675,0.00015351047,0.000037128142,0.00039717974,0.00022157132,0.000093833965],"domain_scores_gemma":[0.99939275,0.00020175254,0.000033914075,0.00019709324,0.00013768776,0.00003669743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013927221,0.0020943985,0.0020561276,0.0013081073,0.00066495663,0.0013724595,0.002947467,0.0027116886,0.0077409274],"category_scores_gemma":[0.0023008008,0.00095200766,0.0019741068,0.0016375133,0.00062633323,0.0013113267,0.0032259321,0.0028125513,0.007730964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005960768,0.00015701125,0.00057622645,0.0002395161,0.0002303832,0.00020195472,0.000110972454,0.054350488,0.032122187,0.002816555,0.05239679,0.85620177],"study_design_scores_gemma":[0.00007162137,0.0001362192,0.0010432089,0.000046550987,0.00010105541,0.00043540203,0.000077599885,0.9189906,0.044215582,0.013522806,0.021295805,0.000063514344],"about_ca_topic_score_codex":0.0067677316,"about_ca_topic_score_gemma":0.012502633,"teacher_disagreement_score":0.0077409274,"about_ca_system_score_codex":0.00069782423,"about_ca_system_score_gemma":0.0015300098,"threshold_uncertainty_score":0.025895953},"labels":[],"label_agreement":null},{"id":"W4387211564","doi":"10.1007/978-3-031-43901-8_43","title":"MDViT: Multi-domain Vision Transformer for Small Medical Image Segmentation Datasets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Inference; Convolutional neural network; Machine learning; Transfer of learning; Transformer; Domain (mathematical analysis); Pattern recognition (psychology); Image segmentation; Data mining","score_opus":0.026439110046927145,"score_gpt":0.3025782687703767,"score_spread":0.2761391587234495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008835803,0.00055730005,0.8944431,0.00029864477,0.0001847877,0.000323928,0.0076643634,0.08377618,0.003915931],"genre_scores_gemma":[0.10734668,0.0005006365,0.8515921,0.00040975198,0.000083850115,0.0004914356,0.025609007,0.005598622,0.008367841],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994992,0.000058964033,0.000033108805,0.00016029018,0.0001868459,0.00006162141],"domain_scores_gemma":[0.99939096,0.00018582276,0.000035569257,0.00019619048,0.00014633058,0.00004504328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010942155,0.001266825,0.0009047212,0.0017796279,0.0004659047,0.0016757589,0.0019428837,0.0010318604,0.019418186],"category_scores_gemma":[0.0031601964,0.0007374542,0.0011311538,0.0018342433,0.0003559999,0.0014561483,0.001621783,0.0012836979,0.008728494],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008151831,0.00017848953,0.00093428855,0.00059472915,0.00018846321,0.00016511945,0.00007575647,0.020239612,0.05705413,0.0077153235,0.14781852,0.7642205],"study_design_scores_gemma":[0.00020064277,0.00022408777,0.0021029587,0.000060117905,0.00007193278,0.00095189136,0.00009124663,0.7832365,0.12005883,0.024079747,0.068848416,0.000073601965],"about_ca_topic_score_codex":0.0029562889,"about_ca_topic_score_gemma":0.0060724868,"teacher_disagreement_score":0.019418186,"about_ca_system_score_codex":0.0008654148,"about_ca_system_score_gemma":0.0011667957,"threshold_uncertainty_score":0.0649603},"labels":[],"label_agreement":null},{"id":"W4387211573","doi":"10.1007/978-3-031-43901-8","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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 British Columbia; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Computer graphics (images); Multimedia; Human–computer interaction","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211573","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387211585","doi":"10.1007/978-3-031-43990-2_41","title":"Speech Audio Synthesis from Tagged MRI and Non-negative Matrix Factorization via Plastic Transformer","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute on Deafness and Other Communication Disorders; National Cancer Institute; National Institutes of Health","keywords":"Computer science; Spectrogram; Weighting; Speech recognition; Mean opinion score; Artificial intelligence; Pattern recognition (psychology); Metric (unit); Acoustics","score_opus":0.008987442967171032,"score_gpt":0.24452536139601755,"score_spread":0.23553791842884653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007802097,0.0001758997,0.9884156,0.0001304024,0.000099665136,0.000027855936,0.00017067378,0.00080461934,0.0023732458],"genre_scores_gemma":[0.19229212,0.00058196695,0.7935979,0.0002225445,0.00013376371,0.000080704114,0.0009109847,0.0004556555,0.011724527],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984586,0.000032201973,0.000007722559,0.000030708714,0.00006432946,0.000019107372],"domain_scores_gemma":[0.99972016,0.00013054433,0.000019908699,0.000043239128,0.00006504173,0.00002112857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033548428,0.000832449,0.0003857292,0.0003269927,0.000188624,0.0006427811,0.00041595942,0.00071280455,0.006457674],"category_scores_gemma":[0.0009013364,0.00029728087,0.0005443816,0.0003465789,0.0002741461,0.0007166523,0.00073212193,0.00078672194,0.0036265359],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010124842,0.00007165405,0.00026984006,0.00035305406,0.000053355012,0.0006363676,0.00009887646,0.029191906,0.5866758,0.012292482,0.004027736,0.36531645],"study_design_scores_gemma":[0.000110247056,0.00037321178,0.0007223985,0.00007229399,0.00008173675,0.0014222133,0.00011920651,0.62751085,0.33753628,0.011634133,0.020356765,0.00006064539],"about_ca_topic_score_codex":0.0005263002,"about_ca_topic_score_gemma":0.0012965192,"teacher_disagreement_score":0.006457674,"about_ca_system_score_codex":0.00013503719,"about_ca_system_score_gemma":0.00039462958,"threshold_uncertainty_score":0.021603107},"labels":[],"label_agreement":null},{"id":"W4387211695","doi":"10.1007/978-3-031-43898-1_19","title":"Mitigating Calibration Bias Without Fixed Attribute Grouping for Improved Fairness in Medical Imaging Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"NeuroRx Research (Canada); McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Flexibility (engineering); Context (archaeology); Calibration; Artificial intelligence; Trustworthiness; Machine learning; Medical imaging; Software deployment; Cluster (spacecraft); Image (mathematics); Population; Cluster analysis; Baseline (sea); Data mining; Pattern recognition (psychology); Statistics; Medicine; Mathematics; Computer security","score_opus":0.027991825504495742,"score_gpt":0.2850634058637841,"score_spread":0.25707158035928834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073612817,0.00029693436,0.99127346,0.00012900066,0.00008209812,0.000030401263,0.000052422674,0.0003151627,0.00045912506],"genre_scores_gemma":[0.2712064,0.0004579601,0.7233513,0.00036350344,0.00045341012,0.00010467451,0.0003623469,0.0004869788,0.0032134047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9898964,0.0050306716,0.000396873,0.0020937487,0.0019322456,0.0006500593],"domain_scores_gemma":[0.97002745,0.017892916,0.0011866256,0.007616758,0.002739563,0.00053668994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013801517,0.0012650597,0.0022675195,0.001077053,0.0016853107,0.002759724,0.0039007992,0.0020906308,0.0034315963],"category_scores_gemma":[0.04183613,0.00087401824,0.0013413547,0.0022960345,0.0020130666,0.0035827258,0.0045667225,0.0032425558,0.0015102344],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001536355,0.00049541885,0.008407856,0.0003746822,0.00048121292,0.000274839,0.000973338,0.24466158,0.03701764,0.09353641,0.011629722,0.6006109],"study_design_scores_gemma":[0.00004121312,0.00010124827,0.0015671712,0.000036307756,0.00009564972,0.00017985897,0.000088600835,0.89302063,0.014520472,0.08712278,0.0031675578,0.000058584257],"about_ca_topic_score_codex":0.0019899188,"about_ca_topic_score_gemma":0.0023342285,"teacher_disagreement_score":0.013801517,"about_ca_system_score_codex":0.0010986887,"about_ca_system_score_gemma":0.0021853133,"threshold_uncertainty_score":0.07299024},"labels":[],"label_agreement":null},{"id":"W4387211699","doi":"10.1007/978-3-031-43898-1_1","title":"Pre-trained Diffusion Models for Plug-and-Play Medical Image Enhancement","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University Health Network; Vector Institute","funders":"","keywords":"Computer science; Scalability; Artificial intelligence; Noise reduction; Image (mathematics); Task (project management); Image enhancement; Deep learning; Image denoising; Diffusion; Plug and play; Resolution (logic); Computer vision; Pattern recognition (psychology); Database","score_opus":0.025333402626460062,"score_gpt":0.29729729627996937,"score_spread":0.2719638936535093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054959375,0.0005752,0.9883278,0.00013359147,0.00010218587,0.00004754278,0.00018357007,0.0036230234,0.0015110803],"genre_scores_gemma":[0.17848411,0.0015452208,0.7900881,0.00027729778,0.00008720957,0.00018184616,0.0013562767,0.0014578401,0.026522094],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986446,0.000019609344,0.000008154909,0.000033185086,0.00005184705,0.000022754524],"domain_scores_gemma":[0.99965596,0.0001373282,0.000021834874,0.000050226936,0.00011371061,0.00002095884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005612987,0.0011266748,0.0006611976,0.00043287055,0.00022849556,0.0009989267,0.001104424,0.001262633,0.006173434],"category_scores_gemma":[0.0015502601,0.00073083694,0.0008312675,0.00037302385,0.00023875126,0.0009890161,0.000740506,0.002262487,0.004449987],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035702102,0.00021894617,0.00061138015,0.00026950403,0.00013172215,0.00017127051,0.00009206113,0.21185766,0.08940857,0.007009014,0.014532344,0.6753405],"study_design_scores_gemma":[0.000010639976,0.000036021185,0.00020222699,0.0000192693,0.0000271077,0.000093692295,0.000009184591,0.9614972,0.030863944,0.0017156965,0.005509457,0.000015604812],"about_ca_topic_score_codex":0.004188405,"about_ca_topic_score_gemma":0.0087211,"teacher_disagreement_score":0.006173434,"about_ca_system_score_codex":0.0005141581,"about_ca_system_score_gemma":0.00072092627,"threshold_uncertainty_score":0.020652175},"labels":[],"label_agreement":null},{"id":"W4387211816","doi":"10.1007/978-3-031-43987-2_36","title":"ProtoASNet: Dynamic Prototypes for Inherently Interpretable and Uncertainty-Aware Aortic Stenosis Classification in Echocardiography","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Interpretability; Computer science; Ambiguity; Artificial intelligence; Data mining; Stenosis; Set (abstract data type); Machine learning; Radiology; Medicine","score_opus":0.020894932543710852,"score_gpt":0.32021184106326506,"score_spread":0.2993169085195542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011632199,0.00096784893,0.9570993,0.00033848628,0.00038418046,0.00014637117,0.0018873677,0.024208404,0.003335751],"genre_scores_gemma":[0.14502136,0.0007370161,0.8406192,0.0003099508,0.00016849306,0.00030197605,0.0048051216,0.0020740929,0.0059626787],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902153,0.00019170996,0.0000826832,0.00030101588,0.00033452094,0.00006859687],"domain_scores_gemma":[0.9985442,0.00074503984,0.00006954613,0.0002623872,0.00029271693,0.00008615838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016709571,0.0011253945,0.0011873421,0.0009849825,0.00045893106,0.0025716312,0.0033010053,0.0018886009,0.009488675],"category_scores_gemma":[0.005763945,0.0008624734,0.0010891929,0.0007708942,0.0007301985,0.002573966,0.0023510186,0.001765452,0.004053348],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010470499,0.00016148364,0.001175686,0.0004634904,0.00012418714,0.00040832398,0.0003853213,0.06270705,0.013625119,0.020558016,0.05463282,0.8447114],"study_design_scores_gemma":[0.00006217526,0.00013161372,0.00054147927,0.00014994352,0.000048996946,0.0004530757,0.00011438868,0.91531205,0.014363258,0.03534965,0.033426844,0.00004651794],"about_ca_topic_score_codex":0.0030491524,"about_ca_topic_score_gemma":0.004453795,"teacher_disagreement_score":0.009488675,"about_ca_system_score_codex":0.00064536073,"about_ca_system_score_gemma":0.0007868051,"threshold_uncertainty_score":0.03174275},"labels":[],"label_agreement":null},{"id":"W4387211861","doi":"10.1007/978-3-031-43907-0","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Multimedia; Human–computer interaction; Data science","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211861","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387211862","doi":"10.1007/978-3-031-43904-9","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Intervention (counseling); Multimedia; Human–computer interaction; Medicine","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211862","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387211866","doi":"10.1007/978-3-031-43898-1_21","title":"Asymmetric Contour Uncertainty Estimation for Medical Image Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Artificial intelligence; Image segmentation; Segmentation; Multivariate normal distribution; Pattern recognition (psychology); Contouring; Multivariate statistics; Machine learning","score_opus":0.020768812109621206,"score_gpt":0.31235797915945945,"score_spread":0.2915891670498382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017873903,0.0004839596,0.9968689,0.000046953184,0.000020184474,0.000010212628,0.000027052138,0.00017570666,0.0005796134],"genre_scores_gemma":[0.20526347,0.0020523048,0.78495204,0.00014825305,0.00021531068,0.00010529883,0.00043932194,0.0005661229,0.006257988],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994578,0.00013026288,0.000030562012,0.00009701811,0.00024941482,0.000034952347],"domain_scores_gemma":[0.9988943,0.0006447383,0.000107847176,0.00015796037,0.00016864738,0.000026535641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009445552,0.00072011194,0.0011671281,0.0009929097,0.00031299994,0.0012087782,0.0012751567,0.0012489865,0.0026598815],"category_scores_gemma":[0.0039403467,0.00074013637,0.0007923372,0.0011610421,0.0006568982,0.0013192866,0.0015082081,0.0014807464,0.0009508627],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002442956,0.00004206416,0.00041050048,0.0003495582,0.0000993487,0.00014921803,0.000101262,0.3044616,0.0470951,0.03884057,0.004185985,0.60402054],"study_design_scores_gemma":[0.0000035279606,0.000020889513,0.00021865472,0.000021143374,0.000020615038,0.00011942822,0.000008432056,0.97371924,0.008188964,0.015318854,0.0023476523,0.000012647856],"about_ca_topic_score_codex":0.000945365,"about_ca_topic_score_gemma":0.00090051745,"teacher_disagreement_score":0.0026598815,"about_ca_system_score_codex":0.0005842856,"about_ca_system_score_gemma":0.00048774853,"threshold_uncertainty_score":0.008898199},"labels":[],"label_agreement":null},{"id":"W4387211869","doi":"10.1007/978-3-031-43987-2","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Multimedia; Intervention (counseling); Human–computer interaction; Medical physics; Medicine; Nursing","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211869","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387211908","doi":"10.1007/978-3-031-43898-1_27","title":"Maximum Entropy on Erroneous Predictions: Improving Model Calibration for Medical Image Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Image segmentation; Benchmark (surveying); Artificial neural network; Principle of maximum entropy; Pixel; Entropy (arrow of time); Calibration; Scale-space segmentation; Pattern recognition (psychology); Computer vision; Mathematics; Statistics","score_opus":0.019186803281780327,"score_gpt":0.2736180290045879,"score_spread":0.2544312257228076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024207952,0.00048313112,0.9724302,0.00029479887,0.000057951154,0.000027195038,0.00010481877,0.0016320485,0.0007618746],"genre_scores_gemma":[0.6147688,0.00069121754,0.37867886,0.00040098178,0.00019832414,0.000081233164,0.00073605374,0.001185905,0.0032587312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984682,0.00055619696,0.00009622395,0.0003520515,0.00040763317,0.00011965287],"domain_scores_gemma":[0.993558,0.0044713193,0.0003833344,0.000772613,0.0007070382,0.00010772612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036884996,0.0014964632,0.0018899657,0.0014615301,0.00064447935,0.0018331329,0.0019465411,0.0024564422,0.0019534067],"category_scores_gemma":[0.013640941,0.0010845993,0.0010590295,0.0010715434,0.001153303,0.0022643555,0.0026991447,0.0022901567,0.0008951246],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043951228,0.000082140716,0.0014766003,0.00013337917,0.0001385553,0.00015315744,0.00012223453,0.6344651,0.015754895,0.003645054,0.002922366,0.34066704],"study_design_scores_gemma":[0.0000027848796,0.000011858973,0.00018781505,0.0000059107447,0.000008555614,0.000024211853,0.0000043795385,0.99434704,0.0029068373,0.002359354,0.0001362563,0.0000049038913],"about_ca_topic_score_codex":0.0037368878,"about_ca_topic_score_gemma":0.0036157044,"teacher_disagreement_score":0.0037368878,"about_ca_system_score_codex":0.0009296803,"about_ca_system_score_gemma":0.000930219,"threshold_uncertainty_score":0.019506872},"labels":[],"label_agreement":null},{"id":"W4387211919","doi":"10.1007/978-3-031-43996-4_64","title":"Towards Multi-modal Anatomical Landmark Detection for Ultrasound-Guided Brain Tumor Resection with Contrastive Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"Landmark; Computer science; Artificial intelligence; Convolutional neural network; Computer vision; Image registration; Pattern recognition (psychology); Image (mathematics)","score_opus":0.02369054555861806,"score_gpt":0.29713503758273374,"score_spread":0.2734444920241157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027033498,0.00018368852,0.9962365,0.00004039618,0.000013081293,0.000012091457,0.000022209626,0.00034199332,0.00044670107],"genre_scores_gemma":[0.06687146,0.0004348384,0.92843294,0.00012694504,0.00004942436,0.00005975212,0.0001816615,0.00017912606,0.003663853],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960643,0.00007701835,0.000017310917,0.0000940844,0.00016428606,0.000040906867],"domain_scores_gemma":[0.9994956,0.00023807037,0.000047731322,0.00005536292,0.00013480897,0.000028407594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007579608,0.0008459972,0.0007374047,0.00084858155,0.0002384453,0.0009679617,0.0015271825,0.0012835939,0.0023394923],"category_scores_gemma":[0.001603996,0.00053140655,0.0008503368,0.00069749914,0.00050408125,0.00089125114,0.0016087205,0.0013142751,0.0015738665],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023654103,0.00010636878,0.00048709562,0.00023769478,0.00009319266,0.00012276141,0.000110148976,0.0907222,0.19156206,0.010052011,0.00499438,0.70127565],"study_design_scores_gemma":[0.000006087697,0.00007030695,0.00040029033,0.000016859289,0.00002325426,0.00021481125,0.000017199318,0.9659275,0.026970055,0.0038475196,0.002489663,0.000016426957],"about_ca_topic_score_codex":0.002181396,"about_ca_topic_score_gemma":0.0040330123,"teacher_disagreement_score":0.0023394923,"about_ca_system_score_codex":0.00037172972,"about_ca_system_score_gemma":0.0005975221,"threshold_uncertainty_score":0.007826328},"labels":[],"label_agreement":null},{"id":"W4387211930","doi":"10.1007/978-3-031-43987-2_29","title":"Interpretable Deep Biomarker for Serial Monitoring of Carotid Atherosclerosis Based on Three-Dimensional Ultrasound Imaging","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cerebrovascular and Carotid Artery Diseases","field":"Medicine","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":"Wilfrid Laurier University","funders":"","keywords":"Interpretability; Biomarker; Computer science; Imaging biomarker; Artificial intelligence; Medicine; Radiology; Magnetic resonance imaging","score_opus":0.01959377139219018,"score_gpt":0.25463738700991895,"score_spread":0.23504361561772877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037291355,0.008810618,0.9437484,0.0007701595,0.00050821516,0.00006385074,0.0015674534,0.0017732844,0.005466725],"genre_scores_gemma":[0.37884888,0.012663036,0.5789486,0.0011032295,0.00087958795,0.00022410987,0.00347085,0.00043564776,0.02342607],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988854,0.000018886616,0.0000068134877,0.000032725893,0.00003976606,0.000013180707],"domain_scores_gemma":[0.99987507,0.000057830857,0.000015395104,0.000013425851,0.000030170737,0.000008182759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034371408,0.0007329803,0.00048013724,0.00047338524,0.000079528334,0.0007938766,0.0004643166,0.0005998645,0.0023162994],"category_scores_gemma":[0.0006327107,0.00020256778,0.00047003655,0.00036903034,0.00018182697,0.0005293341,0.00048671168,0.0004882302,0.0013066399],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026227636,0.0001022516,0.003902143,0.0003155897,0.0001322018,0.00035209363,0.000081411454,0.019006763,0.12757762,0.0061385906,0.015586525,0.8265425],"study_design_scores_gemma":[0.00003855157,0.0005516099,0.0155098615,0.00024349385,0.00041504076,0.0021821433,0.000100609075,0.7371713,0.16101523,0.036125164,0.046509136,0.00013792847],"about_ca_topic_score_codex":0.00052264385,"about_ca_topic_score_gemma":0.0012973456,"teacher_disagreement_score":0.0023162994,"about_ca_system_score_codex":0.00015983768,"about_ca_system_score_gemma":0.00023329396,"threshold_uncertainty_score":0.0077487826},"labels":[],"label_agreement":null},{"id":"W4387211932","doi":"10.1007/978-3-031-43987-2_27","title":"SCOL: Supervised Contrastive Ordinal Loss for Abdominal Aortic Calcification Scoring on Vertebral Fracture Assessment Scans","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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 Manitoba","funders":"","keywords":"Ordinal regression; Computer science; Artificial intelligence; Pattern recognition (psychology); Medicine; Machine learning","score_opus":0.01983861619427967,"score_gpt":0.27690066143365255,"score_spread":0.25706204523937287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04574807,0.0010064217,0.8938016,0.00034230755,0.00027235798,0.0004996719,0.005188932,0.044038378,0.009102145],"genre_scores_gemma":[0.21859185,0.0007646436,0.73943925,0.0003824421,0.0002693371,0.0010408687,0.0094674565,0.0044913176,0.025552794],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994791,0.0000759927,0.000034254263,0.000083247665,0.00028611845,0.00004137811],"domain_scores_gemma":[0.99883336,0.0005162341,0.00009488661,0.00013774383,0.00034225438,0.000075552074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096589024,0.00068842404,0.0005240169,0.0010104409,0.00016908557,0.0009059751,0.0014726958,0.00041496594,0.013524055],"category_scores_gemma":[0.0039877812,0.00032234183,0.00037005977,0.0006055889,0.00026060676,0.0005511288,0.00094292004,0.0006285324,0.005639697],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006234523,0.00012707744,0.0058680587,0.00016785969,0.00006533973,0.00014652115,0.0000531919,0.0062496974,0.011238448,0.0015588115,0.0550416,0.91885996],"study_design_scores_gemma":[0.00029356562,0.0006374718,0.031570043,0.00020778623,0.00014312923,0.0031612916,0.00012422873,0.805958,0.059083316,0.011810603,0.086865924,0.00014473368],"about_ca_topic_score_codex":0.0018931734,"about_ca_topic_score_gemma":0.0046610595,"teacher_disagreement_score":0.013524055,"about_ca_system_score_codex":0.0003798447,"about_ca_system_score_gemma":0.00068145455,"threshold_uncertainty_score":0.04524249},"labels":[],"label_agreement":null},{"id":"W4387211949","doi":"10.1007/978-3-031-43987-2_11","title":"Whole-Heart Reconstruction with Explicit Topology Integrated Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Point cloud; Polygon mesh; Topology (electrical circuits); Pipeline (software); Metric (unit); Surface reconstruction; Visualization; Topology optimization; Artificial intelligence; Surface (topology); Theoretical computer science; Computer graphics (images); Mathematics","score_opus":0.02043677063833633,"score_gpt":0.26858751972035566,"score_spread":0.24815074908201934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028000944,0.00011445479,0.9951749,0.000058108286,0.000018970612,0.000011869831,0.000046797057,0.00090142,0.0008733988],"genre_scores_gemma":[0.121199556,0.0003990669,0.8719288,0.00014353903,0.00007133598,0.00006401233,0.00038074257,0.0006832773,0.0051297015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998035,0.00003854831,0.000010547742,0.000054873064,0.00007051326,0.000022035438],"domain_scores_gemma":[0.99945325,0.00023367406,0.000036526148,0.00018190383,0.000056861594,0.000037743448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066710403,0.00078967254,0.0009920639,0.00046137802,0.0002438668,0.0013700227,0.0015834083,0.0017522282,0.0059702303],"category_scores_gemma":[0.0014955436,0.00086017215,0.00085301726,0.0005737383,0.0004392084,0.0012999931,0.0018598834,0.0018182159,0.002199891],"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.00036253635,0.000112223934,0.0008478875,0.0002659576,0.00017961525,0.00030197273,0.00013525887,0.36281618,0.034935728,0.016311858,0.008145443,0.57558537],"study_design_scores_gemma":[0.000015341218,0.0000406041,0.00012550877,0.000013485578,0.000020960844,0.00028542557,0.000011119785,0.9835744,0.005902,0.0076641687,0.0023337298,0.00001319938],"about_ca_topic_score_codex":0.0011469928,"about_ca_topic_score_gemma":0.002212725,"teacher_disagreement_score":0.0059702303,"about_ca_system_score_codex":0.00025937776,"about_ca_system_score_gemma":0.00059646775,"threshold_uncertainty_score":0.019972444},"labels":[],"label_agreement":null},{"id":"W4387211955","doi":"10.1007/978-3-031-43996-4_53","title":"From Mesh Completion to AI Designed Crown","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Artificial Intelligence in Medicine (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Point cloud; Artificial intelligence; Feature (linguistics); Algorithm","score_opus":0.021445930634495885,"score_gpt":0.23789180879774072,"score_spread":0.21644587816324484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387211955","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.004942264,0.00038717908,0.9682692,0.000118743454,0.00012244341,0.000040258816,0.000117687,0.0011501297,0.024851998],"genre_scores_gemma":[0.13620394,0.0010190966,0.80053806,0.00016834114,0.00016293155,0.00007322703,0.0008268486,0.0017935575,0.059213974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961424,0.000055226257,0.0000149065745,0.00010070036,0.0001860638,0.000028917935],"domain_scores_gemma":[0.99951124,0.00018544942,0.00002525095,0.00016554049,0.000083280276,0.000029206121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004356312,0.0006451507,0.00075684354,0.00093601743,0.00048028943,0.0014807541,0.0014042698,0.0008211992,0.017274238],"category_scores_gemma":[0.0016432867,0.0005796076,0.0008440969,0.00065475685,0.0012607018,0.001529072,0.00219537,0.0019480147,0.003848007],"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.00010763179,0.00007470054,0.0002818016,0.00033017516,0.000027610275,0.00017585217,0.00032187923,0.095544346,0.0126804765,0.43967623,0.017293023,0.4334863],"study_design_scores_gemma":[0.0000174598,0.000069113754,0.0002241728,0.00009123286,0.000015851369,0.0002588909,0.0001002931,0.4540195,0.0061472226,0.48329136,0.055740103,0.000024726134],"about_ca_topic_score_codex":0.002098904,"about_ca_topic_score_gemma":0.0024245877,"teacher_disagreement_score":0.017274238,"about_ca_system_score_codex":0.0005362843,"about_ca_system_score_gemma":0.00049684633,"threshold_uncertainty_score":0.057788074},"labels":[],"label_agreement":null},{"id":"W4387214769","doi":"10.1007/978-3-031-44521-7_8","title":"Self-Supervised Learning to More Efficiently Generate Segmentation Masks for Wrist Ultrasound","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Jaccard index; Test set; Deep learning; Computer vision; Pattern recognition (psychology); Masking (illustration); Image segmentation; Noise (video); Medical imaging; Speckle noise; Image (mathematics)","score_opus":0.08434503389500371,"score_gpt":0.3746508314601626,"score_spread":0.2903057975651589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387214769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016113928,0.0002023635,0.9786669,0.000108614455,0.00007143519,0.00006272337,0.00014394417,0.0036889894,0.00094109064],"genre_scores_gemma":[0.16616896,0.00019360437,0.8237672,0.00030764466,0.00010224988,0.00013517105,0.0012163444,0.0009014162,0.0072075073],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965835,0.00005373623,0.000022183407,0.00012303487,0.00010376517,0.000038868176],"domain_scores_gemma":[0.99909854,0.00038553568,0.00006147674,0.0001305965,0.00028545223,0.000038454735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862087,0.00076892355,0.0007573131,0.000694023,0.00030053643,0.00079903525,0.0011917248,0.0011645084,0.00365718],"category_scores_gemma":[0.0016089106,0.00061581953,0.0009951404,0.0006399692,0.00031564236,0.00080799544,0.0008966825,0.0012652827,0.0022479992],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023526003,0.00021212762,0.0009790156,0.00013461745,0.00009373914,0.0000978044,0.000098363205,0.124031045,0.04624217,0.001826097,0.010908815,0.815141],"study_design_scores_gemma":[0.0000071882164,0.000028403552,0.00026096666,0.000006211931,0.000011717091,0.000055697066,0.0000075506273,0.98823917,0.0094659375,0.0009460689,0.0009657815,0.000005239523],"about_ca_topic_score_codex":0.004741384,"about_ca_topic_score_gemma":0.00903878,"teacher_disagreement_score":0.004741384,"about_ca_system_score_codex":0.00044456997,"about_ca_system_score_gemma":0.00083976676,"threshold_uncertainty_score":0.012234509},"labels":[],"label_agreement":null},{"id":"W4387225163","doi":"10.1007/978-3-031-44521-7_15","title":"The Open Kidney Ultrasound Data Set","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal and Vascular Pathologies","field":"Medicine","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 British Columbia","funders":"","keywords":"Data set; Computer science; Medical diagnosis; Segmentation; Benchmarking; Contrast-enhanced ultrasound; Artificial intelligence; Population; Ultrasound; Medicine; Medical physics; Radiology","score_opus":0.09417110598902564,"score_gpt":0.33721876155451075,"score_spread":0.2430476555654851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225163","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14194632,0.010459797,0.064191684,0.0026863788,0.0014252726,0.00040571598,0.72858423,0.009562619,0.04073791],"genre_scores_gemma":[0.09776647,0.0025799447,0.053562336,0.00034369619,0.00029295485,0.00025965454,0.8305789,0.0007168293,0.013899241],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992836,0.00008288483,0.000065250606,0.00012624009,0.0003594956,0.00008253706],"domain_scores_gemma":[0.99838614,0.0006389652,0.000059350747,0.00039164993,0.00037448385,0.00014948122],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007649489,0.00064979796,0.00077692687,0.0027566247,0.0005679593,0.0012909127,0.0011822849,0.00072752644,0.009126388],"category_scores_gemma":[0.0027805099,0.00029244737,0.00094411883,0.0037402324,0.00037072695,0.0009985351,0.0014427053,0.0009355369,0.0065703564],"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.0006120615,0.0004592747,0.009307536,0.0009455826,0.00012738294,0.00065184967,0.00020329411,0.011721939,0.0065100263,0.005041165,0.47258592,0.49183396],"study_design_scores_gemma":[0.00017928985,0.0002662819,0.050963875,0.00041043555,0.00015206776,0.0031845677,0.0008233321,0.055591885,0.018676793,0.023492103,0.84609175,0.00016767223],"about_ca_topic_score_codex":0.0072709713,"about_ca_topic_score_gemma":0.013982514,"teacher_disagreement_score":0.99881774,"about_ca_system_score_codex":0.00043312213,"about_ca_system_score_gemma":0.0012017728,"threshold_uncertainty_score":0.03053081},"labels":[],"label_agreement":null},{"id":"W4387225479","doi":"10.1007/978-3-031-43993-3","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"NIH Clinical Center; National Institutes of Health; ShanghaiTech University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Université de Rouen; University of North Carolina at Chapel Hill; Nanjing University of Science and Technology; Beijing Institute of Technology; Technische Universität München; Ben-Gurion University of the Negev; Fudan University; Chinese Academy of Sciences; University of Twente; Northwestern Polytechnical University; King's College London; Daegu Gyeongbuk Institute of Science and Technology; Washington University in St. Louis; Imperial College London; Northwestern University; York University; Baidu; Technische Universiteit Delft; Tencent; École de technologie supérieure; University of Pittsburgh; National University of Singapore; Rensselaer Polytechnic Institute; Région Normandie; Memorial Sloan-Kettering Cancer Center; Johns Hopkins University; University College London; Peking University; Auris Health; Beihang University; Massachusetts General Hospital; Case Western Reserve University; Hong Kong University of Science and Technology; University of New South Wales; Arizona State University; Sorbonne Université; Concordia University; Nvidia; Central South University; University of Texas at Arlington; Colorado School of Mines; University of California, Santa Cruz","keywords":"Computer science; Intervention (counseling); Multimedia; Human–computer interaction; Artificial intelligence; Medical physics; Medicine","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225479","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387225562","doi":"10.1007/978-3-031-43996-4_55","title":"Analysis of Suture Force Simulations for Optimal Orientation of Rhomboid Skin Flaps","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Sutures and Adhesives","field":"Medicine","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":"Sinai Health System; Hospital for Sick Children; University of Toronto","funders":"","keywords":"Fibrous joint; Orientation (vector space); Computer science; Finite element method; Focus (optics); Tension (geology); Resection; Haptic technology; Surgery; Simulation; Materials science; Physics; Medicine; Mathematics; Structural engineering; Optics; Geometry; Engineering; Composite material","score_opus":0.022419180458923625,"score_gpt":0.30311156250845694,"score_spread":0.28069238204953334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225562","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.5182526,0.001228185,0.38445053,0.0006899106,0.000258577,0.00019635505,0.0008122674,0.0010516064,0.093060076],"genre_scores_gemma":[0.9661934,0.00026883325,0.024327941,0.00007335354,0.000032868364,0.00012128073,0.00023297571,0.0002895724,0.008459832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998808,0.00003141218,0.00000477115,0.0000146609855,0.00003978308,0.000028590315],"domain_scores_gemma":[0.9993155,0.00047835638,0.000057399535,0.000031801555,0.000085916145,0.00003107412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027264206,0.0006269965,0.0007777387,0.0005468756,0.0004892817,0.0007351538,0.0009340806,0.0014629302,0.005203241],"category_scores_gemma":[0.0013867987,0.00047328757,0.0007251785,0.00037977393,0.00058161916,0.00038101393,0.0004717602,0.00055181526,0.00044027416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021519225,0.000017463666,0.00018396198,0.000019483503,0.000005615435,0.000037516635,0.000019754872,0.9945609,0.0010204796,0.0019913223,0.00021875463,0.0019031625],"study_design_scores_gemma":[0.000002576648,0.000004812784,0.000060680322,0.0000030584038,0.0000011330814,0.0000047742237,0.0000058172077,0.9993205,0.00017141699,0.00031149358,0.00011218904,0.0000016459907],"about_ca_topic_score_codex":0.007622285,"about_ca_topic_score_gemma":0.004927846,"teacher_disagreement_score":0.007622285,"about_ca_system_score_codex":0.00081507425,"about_ca_system_score_gemma":0.0007542957,"threshold_uncertainty_score":0.017406583},"labels":[],"label_agreement":null},{"id":"W4387225568","doi":"10.1007/978-3-031-43996-4_23","title":"SENDD: Sparse Efficient Neural Depth and Deformation for Tissue Tracking","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Point cloud; Tracking (education); Motion estimation; Benchmark (surveying); Optical flow; Artificial neural network; Image (mathematics); Geology; Geodesy","score_opus":0.032267158758340804,"score_gpt":0.29407630235370996,"score_spread":0.26180914359536916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021350763,0.00021817522,0.9918358,0.0001278607,0.000084342566,0.000030124076,0.0003703945,0.0038237977,0.0013743916],"genre_scores_gemma":[0.052873336,0.0004879749,0.9318399,0.00022881459,0.00009104498,0.0001286784,0.0011900625,0.0008628084,0.012297429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997569,0.000020173724,0.000009296765,0.00004409827,0.00014704894,0.000022522807],"domain_scores_gemma":[0.99977607,0.00007584706,0.000020275485,0.00006087582,0.00004864022,0.000018358964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003453587,0.0010016265,0.0007505221,0.0005985507,0.0002593681,0.00094462093,0.0017430143,0.001223147,0.009471342],"category_scores_gemma":[0.0009797366,0.0006554068,0.0007071013,0.00079745677,0.00040794394,0.0011142561,0.0017914557,0.001487671,0.00343634],"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.00017876094,0.00006173748,0.00029923365,0.0001649476,0.00006341153,0.00007245713,0.000073051546,0.09915684,0.03905645,0.013024088,0.03314251,0.81470656],"study_design_scores_gemma":[0.000019180392,0.0000430944,0.00022100288,0.00001644753,0.000013095343,0.00016082106,0.000012839435,0.9589119,0.018500432,0.009351553,0.012728438,0.000021122307],"about_ca_topic_score_codex":0.0032182885,"about_ca_topic_score_gemma":0.006827417,"teacher_disagreement_score":0.009471342,"about_ca_system_score_codex":0.0005587858,"about_ca_system_score_gemma":0.0006677891,"threshold_uncertainty_score":0.031684756},"labels":[],"label_agreement":null},{"id":"W4387225571","doi":"10.1007/978-3-031-43898-1","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"NIH Clinical Center; National Institutes of Health; ShanghaiTech University; Rheinische Friedrich-Wilhelms-Universität Bonn; Nanjing University; Université de Rouen; University of North Carolina at Chapel Hill; Nanjing University of Science and Technology; Beijing Institute of Technology; Technische Universität München; Ben-Gurion University of the Negev; Fudan University; Chinese Academy of Sciences; University of Twente; Northwestern Polytechnical University; King's College London; Daegu Gyeongbuk Institute of Science and Technology; Washington University in St. Louis; Imperial College London; Northwestern University; York University; Baidu; Technische Universiteit Delft; Tencent; École de technologie supérieure; University of Pittsburgh; National University of Singapore; Rensselaer Polytechnic Institute; Région Normandie; Memorial Sloan-Kettering Cancer Center; Johns Hopkins University; University College London; Peking University; Auris Health; Beihang University; Massachusetts General Hospital; Case Western Reserve University; Hong Kong University of Science and Technology; University of New South Wales; Arizona State University; Sorbonne Université; Concordia University; Nvidia; Central South University; University of Texas at Arlington; Colorado School of Mines; University of California, Santa Cruz","keywords":"Computer science; Multimedia; Intervention (counseling); Human–computer interaction; Medicine; Nursing","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225571","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387225662","doi":"10.1007/978-3-031-43904-9_46","title":"Improving Image-Based Precision Medicine with Uncertainty-Aware Causal Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","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":"Montreal Neurological Institute and Hospital; Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"","keywords":"Counterfactual thinking; Computer science; Precision medicine; Artificial intelligence; Machine learning; SAFER; Ground truth; Uncertainty quantification; Bayesian probability; Measurement uncertainty; Statistics; Medicine; Mathematics","score_opus":0.20639838165084706,"score_gpt":0.3717760026182358,"score_spread":0.16537762096738873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004003372,0.0016791516,0.991495,0.0005339695,0.00008786285,0.000028688306,0.0001995755,0.0006501055,0.001322275],"genre_scores_gemma":[0.2803054,0.0030018168,0.7101647,0.0009238469,0.00042076543,0.00011140612,0.00085796893,0.00039040938,0.0038236047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914324,0.00026566527,0.000046164474,0.00018948817,0.0002987294,0.000056607438],"domain_scores_gemma":[0.99745446,0.0019404108,0.00013035932,0.0002266119,0.00019909827,0.000049165832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683151,0.0011124351,0.0018873017,0.00097080576,0.0002939392,0.0018684043,0.0015553464,0.0018209084,0.005079302],"category_scores_gemma":[0.0075544952,0.0008488504,0.0015375328,0.0010271226,0.00063829776,0.0018934852,0.0020322595,0.0020588082,0.0009851692],"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.0004388924,0.00017485267,0.00090817106,0.00034739432,0.0003227258,0.00015525059,0.00008781259,0.4599515,0.013259958,0.027729683,0.009235927,0.48738793],"study_design_scores_gemma":[0.000022010872,0.000054361906,0.00021434015,0.000025166588,0.000053034793,0.00008735925,0.000008044922,0.9734456,0.002325949,0.022275584,0.0014743344,0.000014125526],"about_ca_topic_score_codex":0.0030412378,"about_ca_topic_score_gemma":0.003066574,"teacher_disagreement_score":0.005079302,"about_ca_system_score_codex":0.0007038403,"about_ca_system_score_gemma":0.000814466,"threshold_uncertainty_score":0.016991973},"labels":[],"label_agreement":null},{"id":"W4387225681","doi":"10.1007/978-3-031-43996-4","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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 British Columbia; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Intervention (counseling); Multimedia; Human–computer interaction; Data science; Medicine; Nursing","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225681","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387225738","doi":"10.1007/978-3-031-43895-0","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"National Institutes of Health; ShanghaiTech University; Technische Universität München; Nanjing University of Science and Technology; Hong Kong University of Science and Technology; University of Texas at Arlington; Central South University; Chinese Academy of Sciences; Imperial College London; Tencent; University of Pittsburgh; Nanjing University; Baidu; University of Twente; Rensselaer Polytechnic Institute; Massachusetts General Hospital; Beihang University; Nvidia; Arizona State University; Fudan University; Northwestern University; Beijing Institute of Technology; Northwestern Polytechnical University; University of California, Santa Cruz","keywords":"Computer science; Intervention (counseling); Multimedia; Data science; Medical physics; Medicine","score_opus":0.01164392047456572,"score_gpt":0.31198643814244326,"score_spread":0.30034251766787756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225738","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037306105,0.12972553,0.27298847,0.0069242236,0.033990435,0.00034494494,0.002740291,0.0052925064,0.544263],"genre_scores_gemma":[0.018713268,0.05392069,0.09856946,0.0010728734,0.009338227,0.00024348675,0.0033225466,0.0024226992,0.8123967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993544,0.00005484518,0.00003547222,0.0001354811,0.00038195233,0.000037840808],"domain_scores_gemma":[0.99915016,0.00016150449,0.000037988175,0.0001187498,0.00039513566,0.00013652124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735233,0.0016809952,0.0010581828,0.0025984577,0.00046406104,0.0022255606,0.0011048018,0.0011111203,0.055804268],"category_scores_gemma":[0.0016190112,0.00065781723,0.0006572261,0.0027118511,0.0006453223,0.0019022912,0.0017153503,0.0026314575,0.036797628],"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.00004802958,0.000027780587,0.000085906206,0.00028642613,0.000028189797,0.000032976546,0.00001753972,0.002494637,0.0026484139,0.016964965,0.46075633,0.51660883],"study_design_scores_gemma":[0.000008798852,0.00005765745,0.0011417939,0.00017096457,0.000021127651,0.0005059708,0.000012653346,0.016279582,0.0032377094,0.015349353,0.9631785,0.000035887835],"about_ca_topic_score_codex":0.0027285602,"about_ca_topic_score_gemma":0.0036326854,"teacher_disagreement_score":0.055804268,"about_ca_system_score_codex":0.00087407953,"about_ca_system_score_gemma":0.001156981,"threshold_uncertainty_score":0.1866839},"labels":[],"label_agreement":null},{"id":"W4387225797","doi":"10.1007/978-3-031-43996-4_66","title":"FocalErrorNet: Uncertainty-Aware Focal Modulation Network for Inter-modal Registration Error Estimation in Ultrasound-Guided Neurosurgery","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Modal; Visualization; Ultrasound; Plan (archaeology); Computer vision; Medicine; Radiology","score_opus":0.0285322622232297,"score_gpt":0.26852543995026207,"score_spread":0.23999317772703238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038043945,0.0006442341,0.9927226,0.00008273152,0.000049010723,0.000022372486,0.00008011298,0.0010312834,0.0015632787],"genre_scores_gemma":[0.31238008,0.0015013613,0.6678712,0.00029089162,0.00018421281,0.00018736767,0.00077236,0.0005162027,0.01629641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997702,0.00004680477,0.0000109656485,0.000043948894,0.00010841425,0.000019556417],"domain_scores_gemma":[0.9998292,0.00007877366,0.000016435502,0.00002525814,0.000043063832,0.000007338196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004899279,0.0005946774,0.00047610927,0.0004736037,0.00022110248,0.0004900652,0.0009516684,0.0007004905,0.0036848302],"category_scores_gemma":[0.0010495576,0.00024423885,0.00028778188,0.00046076422,0.000268532,0.0009459015,0.0012486712,0.0006273238,0.00076059013],"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.00022197899,0.000044237524,0.0003732472,0.00012184089,0.000066054294,0.00011006965,0.00008000753,0.14183955,0.022674087,0.012627019,0.010505234,0.8113367],"study_design_scores_gemma":[0.000010945917,0.00007667378,0.00040915952,0.00002131045,0.000022985336,0.00016444694,0.000019678633,0.9704861,0.012792573,0.00817571,0.007803006,0.00001744483],"about_ca_topic_score_codex":0.0023869083,"about_ca_topic_score_gemma":0.004113024,"teacher_disagreement_score":0.0036848302,"about_ca_system_score_codex":0.0003739865,"about_ca_system_score_gemma":0.00038702408,"threshold_uncertainty_score":0.012326956},"labels":[],"label_agreement":null},{"id":"W4387225892","doi":"10.1007/978-3-031-43996-4_8","title":"Intra-operative Forecasting of Standing Spine Shape with Articulated Neural Kernel Fields","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scoliosis diagnosis and treatment","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier Universitaire Sainte-Justine; Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; SPINE (molecular biology); Scoliosis; Medicine; Surgery","score_opus":0.04934964028356099,"score_gpt":0.2922760730140343,"score_spread":0.24292643273047332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0569422,0.00055633293,0.93946314,0.00012497803,0.000118059346,0.000025216912,0.0001519032,0.0014138601,0.0012044109],"genre_scores_gemma":[0.7822166,0.00057848153,0.21141067,0.000086671615,0.00008369323,0.00003704399,0.00039112408,0.00017171998,0.0050239605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992955,0.00000767566,0.0000042390393,0.00002001931,0.000023070073,0.000015350593],"domain_scores_gemma":[0.99978226,0.000090064044,0.000017569519,0.00003648751,0.000053452095,0.000020331532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024595714,0.0004378308,0.00051599235,0.00032428774,0.00014680863,0.00048982794,0.0005280197,0.00067212444,0.001700601],"category_scores_gemma":[0.00071980077,0.0002848021,0.0004572876,0.00045142294,0.00016876117,0.0005309301,0.0005328074,0.0008303686,0.0006495942],"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.00048073623,0.00009870984,0.002265123,0.00007040152,0.000055344277,0.00017196727,0.000060041337,0.20516373,0.039193105,0.00092954835,0.002888748,0.74862254],"study_design_scores_gemma":[0.0000039900747,0.000030156187,0.00097407436,0.00000556643,0.000009008844,0.00007169983,0.000008106171,0.99454486,0.0034882384,0.0005881114,0.0002693355,0.000006763509],"about_ca_topic_score_codex":0.0031958579,"about_ca_topic_score_gemma":0.004349044,"teacher_disagreement_score":0.0031958579,"about_ca_system_score_codex":0.00019790472,"about_ca_system_score_gemma":0.0004700392,"threshold_uncertainty_score":0.006354511},"labels":[],"label_agreement":null},{"id":"W4387225996","doi":"10.1007/978-3-031-43904-9_66","title":"Hierarchical Vision Transformers for Disease Progression Detection in Chest X-Ray Images","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"McMaster University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Encoder; Transformer; Disease; Computer vision; Machine learning; Medicine; Pathology","score_opus":0.0222304351526438,"score_gpt":0.3284882310100881,"score_spread":0.30625779585744434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387225996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013887628,0.00056816626,0.97790456,0.00008588316,0.00005042743,0.00008700847,0.00042724554,0.0032156177,0.0037734595],"genre_scores_gemma":[0.46018842,0.0009940586,0.5303085,0.00012650373,0.00007156061,0.00009979629,0.001287054,0.00027935658,0.0066447672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997267,0.00003900935,0.000022064993,0.00006794993,0.00009918151,0.000045121153],"domain_scores_gemma":[0.9994709,0.00022362979,0.000036003083,0.00009189124,0.00014425797,0.00003331545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005769644,0.00041532013,0.0004082379,0.0012878642,0.00022301538,0.001087011,0.0007842148,0.0003633082,0.005437088],"category_scores_gemma":[0.001613804,0.00028073243,0.0006727211,0.0008945211,0.00031623815,0.0010821482,0.0006326899,0.0006094754,0.0017072968],"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.00027448704,0.000098992765,0.0016863463,0.00023417234,0.000053449363,0.00012738857,0.0001236231,0.027874237,0.03806712,0.032274496,0.010114195,0.8890716],"study_design_scores_gemma":[0.000036369758,0.00018936244,0.004517152,0.000053253236,0.000095337266,0.00052823575,0.00012637473,0.888898,0.042368647,0.052669074,0.010483351,0.000034812598],"about_ca_topic_score_codex":0.005032753,"about_ca_topic_score_gemma":0.0058459053,"teacher_disagreement_score":0.005437088,"about_ca_system_score_codex":0.00069189514,"about_ca_system_score_gemma":0.0007196646,"threshold_uncertainty_score":0.018188834},"labels":[],"label_agreement":null},{"id":"W4387319360","doi":"10.1007/978-3-031-41181-6","title":"Applied Cryptography and Network Security Workshops","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Concordia University","funders":"","keywords":"Computer science; Cryptography; Network security; Computer security; Financial cryptography; Volume (thermodynamics); Public-key cryptography; Encryption","score_opus":0.009061149872512778,"score_gpt":0.22051377808076977,"score_spread":0.211452628208257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319360","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009564737,0.049518436,0.107194215,0.014114542,0.031845726,0.00027403992,0.0006295369,0.0020803807,0.78477836],"genre_scores_gemma":[0.01936196,0.01400084,0.013859993,0.0006699049,0.0032680833,0.00009770303,0.0005837988,0.00029642743,0.94786125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990915,0.00020185395,0.00003276505,0.000128858,0.0004157909,0.00012930793],"domain_scores_gemma":[0.99909997,0.000176863,0.00003352724,0.00014654797,0.00030278432,0.00024026382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016221165,0.001384937,0.00077262986,0.0012284882,0.0011073801,0.0032062635,0.001379111,0.0011806565,0.08032734],"category_scores_gemma":[0.0013146732,0.0005970542,0.00079142256,0.0021794403,0.00056039396,0.0026979719,0.0020872462,0.002588036,0.047633126],"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.00015271372,0.00025830415,0.00021638961,0.0003395517,0.000024804043,0.00015503017,0.00021193495,0.0030881162,0.004379373,0.041973416,0.54063684,0.4085636],"study_design_scores_gemma":[0.000018738143,0.00010263098,0.00052431884,0.0002216119,0.00001972252,0.0003397082,0.00012787648,0.006466815,0.0024750761,0.029262455,0.96042156,0.000019470115],"about_ca_topic_score_codex":0.0010278162,"about_ca_topic_score_gemma":0.0024953138,"teacher_disagreement_score":0.08032734,"about_ca_system_score_codex":0.0011448506,"about_ca_system_score_gemma":0.0019200753,"threshold_uncertainty_score":0.2687217},"labels":[],"label_agreement":null},{"id":"W4387319585","doi":"10.1007/978-3-031-41181-6_34","title":"Forensic Identification of Android Trojans Using Stacked Ensemble of Deep Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Seneca Polytechnic; Toronto Metropolitan University","funders":"","keywords":"Android (operating system); Computer science; Malware; Trojan; Artificial neural network; Computer security; Operating system; Artificial intelligence; Embedded system","score_opus":0.0218550243836432,"score_gpt":0.2667636707039636,"score_spread":0.24490864632032042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319585","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.6171735,0.0032712363,0.36218968,0.000638716,0.00058518315,0.00012478235,0.0006432612,0.0042073885,0.01116625],"genre_scores_gemma":[0.94183755,0.0006525849,0.050613433,0.00014311429,0.00008631484,0.000028999799,0.0006557504,0.00007057589,0.005911608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997384,0.000026461033,0.000010062786,0.000051904233,0.00009211188,0.00008113277],"domain_scores_gemma":[0.99953973,0.0000958178,0.00007037899,0.00007181097,0.00018960728,0.000032657586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037600487,0.00087034836,0.00059128075,0.0013717826,0.00033561816,0.00057054544,0.00071662705,0.0008129896,0.0012177838],"category_scores_gemma":[0.0009286671,0.00029593904,0.0006095341,0.0004949532,0.00025263315,0.0011617545,0.0009798864,0.000905979,0.0007887175],"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.00051828916,0.00032360622,0.0144698685,0.00015050631,0.00019316566,0.00082034,0.00016637587,0.06765838,0.07214251,0.0024527563,0.008294811,0.83280945],"study_design_scores_gemma":[0.0000062358577,0.00014730715,0.005799505,0.000037343918,0.000072770454,0.00057006004,0.00008149586,0.9605694,0.028432148,0.0024836555,0.0017758944,0.000024275298],"about_ca_topic_score_codex":0.0016909305,"about_ca_topic_score_gemma":0.004484519,"teacher_disagreement_score":0.0016909305,"about_ca_system_score_codex":0.00034073097,"about_ca_system_score_gemma":0.00047201838,"threshold_uncertainty_score":0.004073918},"labels":[],"label_agreement":null},{"id":"W4387319649","doi":"10.1007/978-3-031-41181-6_21","title":"Trust Management Framework for Containerized Workloads Applications to 5G Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Ericsson (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Trust management (information system); Computer security; Adversary; Context (archaeology); Software deployment; Service (business); Computational trust; Service provider; Business; Software engineering","score_opus":0.02573846858734566,"score_gpt":0.28431667463186017,"score_spread":0.25857820604451454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04408346,0.0008172911,0.9204765,0.0009900286,0.00035408634,0.00058152655,0.00023930184,0.020847153,0.011610644],"genre_scores_gemma":[0.7475677,0.00050241296,0.23554987,0.0003073615,0.00016509384,0.0003112914,0.0007736056,0.00086537236,0.0139573105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869907,0.00026213302,0.00013700846,0.00016638832,0.0004611322,0.00027429915],"domain_scores_gemma":[0.9984995,0.00022833653,0.0001363993,0.0004010004,0.00048549657,0.00024921057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022544542,0.0005653148,0.00066415797,0.0006166009,0.001109779,0.0026738618,0.0020209558,0.0007918103,0.0036857282],"category_scores_gemma":[0.003347142,0.00041917033,0.0007514718,0.00041629304,0.00053098204,0.0025542122,0.002428429,0.0019433905,0.0009303985],"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.0014939397,0.0010408558,0.009611296,0.00064886065,0.0005203137,0.0021785877,0.0023548794,0.13050717,0.054106887,0.20064256,0.099995874,0.4968988],"study_design_scores_gemma":[0.00006012527,0.00014601437,0.000913363,0.000073823576,0.00012726069,0.00025889897,0.00024126399,0.93005997,0.012053201,0.020056248,0.035935428,0.00007437903],"about_ca_topic_score_codex":0.008080698,"about_ca_topic_score_gemma":0.009035932,"teacher_disagreement_score":0.008080698,"about_ca_system_score_codex":0.0014036201,"about_ca_system_score_gemma":0.0020582548,"threshold_uncertainty_score":0.016067326},"labels":[],"label_agreement":null},{"id":"W4387384656","doi":"10.1007/978-981-99-6480-2_6","title":"A Rigid-Flexible Coupling Recursive Formulation for Dynamic Modeling of Biped Robots","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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":"Dalhousie University","funders":"","keywords":"Computer science; Coupling (piping); Robot; Kinematics; Control theory (sociology); Coulomb friction; Multibody system; Contact force; Torsion (gastropod); Control engineering; Mechanical engineering; Classical mechanics; Physics; Engineering; Nonlinear system; Artificial intelligence","score_opus":0.02175263319667149,"score_gpt":0.25112990815052333,"score_spread":0.22937727495385185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387384656","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.001477661,0.00018687287,0.99598557,0.000038462425,0.000018676072,0.0000109860075,0.000029034734,0.00007872823,0.0021739358],"genre_scores_gemma":[0.33388966,0.001823886,0.63452953,0.00019347966,0.0001618431,0.0002921999,0.000410544,0.000499949,0.028198997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998652,0.000036197307,0.000008608043,0.000026272019,0.000049940947,0.000013866091],"domain_scores_gemma":[0.99988437,0.00004241831,0.000017096883,0.000021131655,0.00002602435,0.000009046913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025663525,0.00072606566,0.0006319538,0.00034596343,0.00038906626,0.0007180369,0.0012521263,0.0009975111,0.0031675748],"category_scores_gemma":[0.00065396196,0.00048205114,0.00089221087,0.00053761166,0.000477901,0.0009344705,0.0010078907,0.0011191079,0.0013294916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013081718,0.00003088372,0.000100811325,0.00012617362,0.00003035925,0.00014143475,0.00015775584,0.7169487,0.009972801,0.2208472,0.0019663894,0.04966448],"study_design_scores_gemma":[0.0000015700508,0.0000109572875,0.000040530933,0.000007189687,0.0000053144486,0.000018887662,0.000010108497,0.9752157,0.00028087207,0.021860028,0.002543617,0.000005408285],"about_ca_topic_score_codex":0.0041792383,"about_ca_topic_score_gemma":0.0062306,"teacher_disagreement_score":0.0041792383,"about_ca_system_score_codex":0.0004012423,"about_ca_system_score_gemma":0.00040107573,"threshold_uncertainty_score":0.010596573},"labels":[],"label_agreement":null},{"id":"W4387384771","doi":"10.1007/978-981-99-6480-2_1","title":"Leg Mass Influences the Jumping Performance of Compliant One-legged Robots","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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":"Dalhousie University","funders":"","keywords":"Jumping; Inverted pendulum; Robot; Legged robot; Control theory (sociology); Computer science; Pendulum; Mass ratio; Simulation; Offset (computer science); Jump; Physics; Artificial intelligence; Engineering; Mechanical engineering; Geology; Aerospace engineering; Control (management)","score_opus":0.023854491275434136,"score_gpt":0.22268258597618273,"score_spread":0.1988280947007486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387384771","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.99053484,0.00024348091,0.005618701,0.000049908296,0.000013697258,0.0000064209753,0.000033165088,0.000081787446,0.0034179897],"genre_scores_gemma":[0.9988901,0.0000613182,0.0002862371,0.000006330445,0.0000039939246,0.0000019354495,0.000023794122,0.000014028362,0.00071221485],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992704,0.000015163097,0.00000286957,0.00001331665,0.000023362203,0.00001822649],"domain_scores_gemma":[0.999613,0.00024894017,0.000053084426,0.000018388226,0.000031493288,0.000035224726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015289425,0.00033077525,0.00026889346,0.00021345909,0.00020211498,0.00047436205,0.00026528037,0.00043819053,0.0024957922],"category_scores_gemma":[0.0007070128,0.0001788901,0.000116387644,0.00013840829,0.00030060147,0.0004080196,0.00027052918,0.00020147004,0.00040209846],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090775837,0.00014681043,0.0035684619,0.00025586743,0.000036898477,0.00045033635,0.000134818,0.060439453,0.90026665,0.0013937782,0.00033963603,0.032059476],"study_design_scores_gemma":[0.000068914844,0.0019328615,0.07457949,0.000070600334,0.00013189047,0.00068073004,0.0002607547,0.71709746,0.19913389,0.0048847166,0.0010733348,0.00008539757],"about_ca_topic_score_codex":0.00023886783,"about_ca_topic_score_gemma":0.00031360178,"teacher_disagreement_score":0.0024957922,"about_ca_system_score_codex":0.000097625525,"about_ca_system_score_gemma":0.00006924309,"threshold_uncertainty_score":0.00834924},"labels":[],"label_agreement":null},{"id":"W4387401722","doi":"10.1007/978-3-031-43185-2_23","title":"Execution Time Prediction Model that Considers Dynamic Allocation of Spark Executors","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Computer science; Tree traversal; SPARK (programming language); Idle; Process (computing); Graph; Execution time; Algorithm; Theoretical computer science; Parallel computing; Programming language; Operating system","score_opus":0.017302564198480634,"score_gpt":0.22698726428620916,"score_spread":0.20968470008772852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387401722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27165133,0.0013295218,0.71317804,0.0009110639,0.00034896997,0.00010317186,0.0010989904,0.0039307037,0.007448282],"genre_scores_gemma":[0.9540703,0.00039899378,0.039723534,0.00009932555,0.000117516705,0.00007794086,0.00067877246,0.00007697788,0.0047565927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981636,0.000021903306,0.0000102270205,0.00007319451,0.000040829706,0.00003743305],"domain_scores_gemma":[0.9995328,0.0002329015,0.000058816506,0.00003449558,0.0001062016,0.000034822344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050157856,0.0006800156,0.00089908484,0.0004464781,0.0003211045,0.0006542416,0.0012928488,0.00061328744,0.0014839317],"category_scores_gemma":[0.0009504923,0.0002961674,0.00045467922,0.00066171883,0.00019395705,0.00066653267,0.00025109964,0.00066806475,0.0003424186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012377783,0.00009475969,0.0013285415,0.00003055765,0.000030352654,0.000046934016,0.0000109637185,0.9685287,0.0014257036,0.0008178567,0.001555561,0.026006298],"study_design_scores_gemma":[0.0000013736189,0.0000058039427,0.00009509102,5.560783e-7,0.000003078881,0.0000025788438,7.043836e-7,0.99961334,0.00009920999,0.0001377979,0.000039511473,9.945855e-7],"about_ca_topic_score_codex":0.01943852,"about_ca_topic_score_gemma":0.015765246,"teacher_disagreement_score":0.01943852,"about_ca_system_score_codex":0.0006163477,"about_ca_system_score_gemma":0.0016135842,"threshold_uncertainty_score":0.03865069},"labels":[],"label_agreement":null},{"id":"W4387404185","doi":"10.1007/978-3-031-45350-2_2","title":"Towards Real-Time Confirmation of Breast Cancer in the OR Using CNN-Based Raman Spectroscopy Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy Techniques in Biomedical and Chemical Research","field":"Biochemistry, Genetics and Molecular Biology","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":"Polytechnique Montréal; Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Breast cancer; Pattern recognition (psychology); Support vector machine; Pipeline (software); Feature extraction; Feature (linguistics); Raman spectroscopy; Cancer; Medicine; Physics; Internal medicine; Optics","score_opus":0.03279047278352123,"score_gpt":0.3502367530804613,"score_spread":0.3174462802969401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387404185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26411226,0.0071888273,0.693208,0.0016309989,0.0010869058,0.00039515068,0.00368072,0.009849821,0.018847378],"genre_scores_gemma":[0.7338728,0.002201094,0.24117702,0.0010318726,0.00031100155,0.00012963379,0.0037440478,0.00030204694,0.017230576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996159,0.0000513531,0.000019690322,0.0001160931,0.00009807639,0.00009883223],"domain_scores_gemma":[0.99966156,0.00009697259,0.000033513148,0.000042618667,0.00014007186,0.00002528697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007758582,0.0011779963,0.00067309715,0.00082443614,0.00020307193,0.0009792569,0.0012847842,0.0012528433,0.002581447],"category_scores_gemma":[0.0011684402,0.00030981522,0.00080140325,0.00040428276,0.0002024004,0.00066440995,0.0008248684,0.0005902363,0.0022643371],"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.00071735965,0.0002083004,0.011808514,0.0002649711,0.00019113076,0.0005121802,0.000049103204,0.012244462,0.12248522,0.0007839022,0.010004299,0.8407306],"study_design_scores_gemma":[0.00003861318,0.0003005645,0.014667397,0.00013257081,0.0004407537,0.0012328245,0.000123159,0.86013794,0.11348249,0.0021289801,0.007262554,0.000052142437],"about_ca_topic_score_codex":0.0040082023,"about_ca_topic_score_gemma":0.007750471,"teacher_disagreement_score":0.0040082023,"about_ca_system_score_codex":0.000317596,"about_ca_system_score_gemma":0.000499254,"threshold_uncertainty_score":0.008635819},"labels":[],"label_agreement":null},{"id":"W4387404244","doi":"10.1007/978-3-031-44689-4_9","title":"Unsupervised Liver Tumor Segmentation with Pseudo Anomaly Synthesis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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 Alberta","funders":"","keywords":"Segmentation; Computer science; Generalizability theory; Artificial intelligence; Benchmark (surveying); Anomaly (physics); Anomaly detection; Pattern recognition (psychology); Ground truth; Image segmentation; Machine learning; Mathematics","score_opus":0.01683446196139263,"score_gpt":0.22993120982515758,"score_spread":0.21309674786376495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387404244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01128162,0.00018550662,0.9855445,0.00006161681,0.000031821633,0.0000299695,0.000099931494,0.0014637791,0.0013011822],"genre_scores_gemma":[0.1736853,0.0003152976,0.81983185,0.00007313553,0.00006635402,0.00007505161,0.00056833297,0.00064057694,0.00474408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978155,0.000026386877,0.000009558407,0.000063082785,0.00009452352,0.000024977353],"domain_scores_gemma":[0.99976486,0.000072336596,0.000025033618,0.00005742627,0.00006666401,0.0000137846055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028646545,0.0006187724,0.00056212855,0.0009632821,0.00019294549,0.0008241138,0.0007335705,0.00067120715,0.0020719445],"category_scores_gemma":[0.0005851438,0.00042675834,0.00065151625,0.00085551786,0.00033951245,0.0005502578,0.00079937105,0.0006125108,0.0013004972],"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.00023110108,0.000047466794,0.0010094426,0.00014123356,0.00006661273,0.00015102435,0.00006298976,0.0481745,0.21104753,0.005411893,0.0026692932,0.73098695],"study_design_scores_gemma":[0.000010818293,0.0000733729,0.0012456329,0.000012972582,0.00004055268,0.0006069746,0.000023224016,0.88560694,0.100746825,0.0059397095,0.0056718765,0.000021094991],"about_ca_topic_score_codex":0.00082010473,"about_ca_topic_score_gemma":0.0015497834,"teacher_disagreement_score":0.0020719445,"about_ca_system_score_codex":0.00027472433,"about_ca_system_score_gemma":0.00044369086,"threshold_uncertainty_score":0.0069313645},"labels":[],"label_agreement":null},{"id":"W4387414769","doi":"10.1007/978-3-031-44336-7_5","title":"Examining the Effects of Slice Thickness on the Reproducibility of CT Radiomics for Patients with Colorectal Liver Metastases","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Resampling; Reproducibility; Medicine; Radiomics; Proportional hazards model; Colorectal cancer; Artificial intelligence; Robustness (evolution); Radiology; Feature (linguistics); Data set; Computer science; Pattern recognition (psychology); Statistics; Internal medicine; Cancer; Mathematics","score_opus":0.018867077488351553,"score_gpt":0.26122338305349035,"score_spread":0.2423563055651388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387414769","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.995333,0.0018925954,0.0015628223,0.000094341965,0.00004361402,0.000016614957,0.00020090729,0.000031407384,0.00082454435],"genre_scores_gemma":[0.99867874,0.00016803616,0.000660192,0.00002949277,0.000038523864,0.0000081463095,0.00014430043,0.000028528642,0.00024396689],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9969022,0.0017123058,0.00031339534,0.0005240518,0.00044016307,0.00010785394],"domain_scores_gemma":[0.95692855,0.03572314,0.003366363,0.0020267477,0.0015990246,0.0003562356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055164737,0.00043267477,0.00036658693,0.00040335907,0.00017679537,0.0006528691,0.0005500116,0.00061164104,0.0009927507],"category_scores_gemma":[0.026099224,0.00041659398,0.0010696555,0.00052265683,0.0004124681,0.0005271723,0.0003902534,0.0006747559,0.0002901379],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.032937136,0.00023589356,0.86721426,0.00019777524,0.0025285804,0.00055730034,0.0007680355,0.002751935,0.023067137,0.00008887214,0.0005125381,0.06914054],"study_design_scores_gemma":[0.00008705027,0.0034634846,0.98338366,0.000020343685,0.0012865681,0.00070540985,0.00022552266,0.0018758603,0.008369109,0.000071405324,0.000477096,0.000034355304],"about_ca_topic_score_codex":0.0015291286,"about_ca_topic_score_gemma":0.0033573075,"teacher_disagreement_score":0.0055164737,"about_ca_system_score_codex":0.00049458013,"about_ca_system_score_gemma":0.000308878,"threshold_uncertainty_score":0.029174209},"labels":[],"label_agreement":null},{"id":"W4387414813","doi":"10.1007/978-3-031-44336-7_7","title":"Numerical Uncertainty of Convolutional Neural Networks Inference for Structural Brain MRI Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Convolutional neural network; Rounding; Segmentation; Artificial intelligence; Inference; Pipeline (software); Pattern recognition (psychology); Dice; Convolution (computer science); Artificial neural network; Algorithm; Statistics; Mathematics","score_opus":0.022077396594155196,"score_gpt":0.2923303012268479,"score_spread":0.2702529046326927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387414813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009796171,0.0007410959,0.98718566,0.0006546722,0.00007597913,0.000015419058,0.000092157374,0.00021314829,0.0012256874],"genre_scores_gemma":[0.70738703,0.0015531664,0.28398976,0.00040752342,0.0004814657,0.00015980206,0.0005465988,0.0003736659,0.005100951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985442,0.0005864517,0.00010363192,0.00023945695,0.0004364361,0.00008988392],"domain_scores_gemma":[0.9793005,0.017894773,0.0008297184,0.0007914338,0.0009339444,0.00024964727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051643956,0.0007039594,0.0013155518,0.001015928,0.0005485728,0.0022219836,0.00201338,0.0018797141,0.0025682454],"category_scores_gemma":[0.04049241,0.0010442054,0.000923746,0.0008713113,0.0022957996,0.0031602234,0.0033939953,0.0036941587,0.0002935438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015465384,0.00002666203,0.0009855108,0.00014473771,0.00007414438,0.00006719135,0.000060715865,0.8563349,0.0014964769,0.09062771,0.001598691,0.048428606],"study_design_scores_gemma":[0.000002082751,0.0000058119363,0.000095083145,0.000011305178,0.0000036363579,0.000010813577,0.0000026232524,0.9682398,0.00034443566,0.031112231,0.00016729346,0.000004904607],"about_ca_topic_score_codex":0.005044969,"about_ca_topic_score_gemma":0.004717111,"teacher_disagreement_score":0.0051643956,"about_ca_system_score_codex":0.0024304825,"about_ca_system_score_gemma":0.0014618121,"threshold_uncertainty_score":0.027312279},"labels":[],"label_agreement":null},{"id":"W4387414818","doi":"10.1007/978-3-031-44336-7_8","title":"How Inter-rater Variability Relates to Aleatoric and Epistemic Uncertainty: A Case Study with Deep Learning-Based Paraspinal Muscle Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Western University; Concordia University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Machine learning; Deep learning; Ground truth; Transformer; Uncertainty quantification","score_opus":0.06319000894847941,"score_gpt":0.3493490479373006,"score_spread":0.28615903898882117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387414818","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.8657481,0.0015093253,0.122411735,0.0010018979,0.00012001988,0.00008623719,0.0005617871,0.00037311303,0.00818776],"genre_scores_gemma":[0.98754483,0.00015676756,0.011017719,0.00005992069,0.00003021957,0.00001841421,0.00018519146,0.00009888829,0.00088799035],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974406,0.0010768042,0.00016309785,0.00061945035,0.0005407473,0.00015930117],"domain_scores_gemma":[0.9740689,0.022062695,0.0013900866,0.0009783872,0.0012792472,0.00022070456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005456112,0.0004956278,0.00044342893,0.0006179921,0.00049620616,0.0025827375,0.0009477133,0.0012572171,0.0010966136],"category_scores_gemma":[0.030274808,0.00029442107,0.0004843876,0.0008574292,0.00091314694,0.0016498805,0.0011795452,0.0011877165,0.0003504007],"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.002597949,0.0004599762,0.20625874,0.00066116476,0.0008559641,0.0057941657,0.012968269,0.11518969,0.050809104,0.009648119,0.006578743,0.5881781],"study_design_scores_gemma":[0.00007224439,0.00090852677,0.20021644,0.0003652123,0.00067233323,0.00816016,0.007663382,0.68460315,0.042771414,0.044770077,0.009466715,0.00033042327],"about_ca_topic_score_codex":0.0035983333,"about_ca_topic_score_gemma":0.0050225724,"teacher_disagreement_score":0.005456112,"about_ca_system_score_codex":0.00077766605,"about_ca_system_score_gemma":0.0005310493,"threshold_uncertainty_score":0.028854966},"labels":[],"label_agreement":null},{"id":"W4387414869","doi":"10.1007/978-3-031-44336-7","title":"Uncertainty for Safe Utilization of Machine Learning in Medical Imaging","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Computer science; Medical imaging; Artificial intelligence; Machine learning","score_opus":0.030120091820987543,"score_gpt":0.34626255858412486,"score_spread":0.3161424667631373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387414869","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00212246,0.0038705082,0.9854768,0.0009334933,0.00022766709,0.000013797314,0.000051326882,0.00027699277,0.0070269234],"genre_scores_gemma":[0.38037896,0.009911599,0.5810526,0.0009999225,0.0019209071,0.00018287089,0.00033811072,0.0006335324,0.024581559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982535,0.00039355186,0.0000920092,0.00015027403,0.0009951941,0.00011544633],"domain_scores_gemma":[0.99478275,0.0040402664,0.0002224639,0.00046261353,0.00040629125,0.00008562731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016677561,0.00074028765,0.0009977453,0.0008550342,0.00053326524,0.0019067443,0.001194335,0.0012841161,0.004273026],"category_scores_gemma":[0.008045257,0.0005550914,0.0008623904,0.0008305902,0.0019356672,0.002773775,0.002402219,0.0032327506,0.001204529],"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.0001645192,0.000037178343,0.00036582313,0.00044573928,0.00006159147,0.00019161557,0.00016727041,0.11810632,0.0055893813,0.5338713,0.014027184,0.3269721],"study_design_scores_gemma":[0.000007371815,0.00004157236,0.0001835578,0.000104073886,0.000020968966,0.00021442713,0.00002539993,0.34632424,0.004064739,0.6343069,0.014683337,0.000023303663],"about_ca_topic_score_codex":0.0006891717,"about_ca_topic_score_gemma":0.00049583265,"teacher_disagreement_score":0.004273026,"about_ca_system_score_codex":0.00077452516,"about_ca_system_score_gemma":0.0007521588,"threshold_uncertainty_score":0.014294684},"labels":[],"label_agreement":null},{"id":"W4387422461","doi":"10.1007/978-3-031-44917-8_16","title":"Combining Weakly Supervised Segmentation with Multitask Learning for Improved 3D MRI Brain Tumour Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Vector Institute; University of Toronto; Hospital for Sick Children","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Leverage (statistics); Pipeline (software); Focus (optics); Pattern recognition (psychology); Machine learning; Multi-task learning; Image segmentation; Contextual image classification; Pixel; Region of interest; Deep learning; Task (project management); Medical imaging; Computer vision; Image (mathematics)","score_opus":0.0275006106379515,"score_gpt":0.27299376287097765,"score_spread":0.24549315223302615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387422461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018279752,0.0007354716,0.97613347,0.00022083071,0.00012484766,0.00007162366,0.00032346047,0.0028923599,0.0012181139],"genre_scores_gemma":[0.28280777,0.00079530885,0.70272374,0.00060060405,0.00045561162,0.0002979067,0.0035991115,0.001250993,0.007468885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988481,0.0002725171,0.00008005389,0.000312384,0.00032251567,0.00016437117],"domain_scores_gemma":[0.9980975,0.0007618242,0.00013816459,0.00036739645,0.00051030476,0.00012482583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020875023,0.0019291312,0.0026324524,0.0023297055,0.0007234218,0.0022326398,0.0026283618,0.0026150097,0.0030869613],"category_scores_gemma":[0.003206838,0.000883048,0.002400407,0.0024110281,0.00067048887,0.0016948784,0.0029619967,0.0016390902,0.003344752],"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.00049741677,0.000308778,0.0018739463,0.00034426313,0.00029904337,0.00017678812,0.00013793177,0.08503418,0.06549351,0.0021756648,0.009116656,0.834542],"study_design_scores_gemma":[0.000012039332,0.000071350514,0.0007040455,0.000014989265,0.000053596366,0.00010889796,0.000023493634,0.9846148,0.008947697,0.00394828,0.0014799661,0.000020804997],"about_ca_topic_score_codex":0.003873558,"about_ca_topic_score_gemma":0.006879127,"teacher_disagreement_score":0.003873558,"about_ca_system_score_codex":0.00053739315,"about_ca_system_score_gemma":0.0011180668,"threshold_uncertainty_score":0.011039913},"labels":[],"label_agreement":null},{"id":"W4387422630","doi":"10.1007/978-3-031-44917-8_11","title":"Masked Image Modeling for Label-Efficient Segmentation in Two-Photon Excitation Microscopy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","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 Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Pipeline (software); Pattern recognition (psychology); Masking (illustration); Channel (broadcasting); Initialization; Image segmentation; Computer vision","score_opus":0.016286030896151566,"score_gpt":0.3155123538835404,"score_spread":0.2992263229873888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387422630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026343444,0.000073283394,0.9955694,0.000036122456,0.00001597074,0.000023351453,0.00010419714,0.001082142,0.00046114315],"genre_scores_gemma":[0.09127943,0.00030045057,0.9023126,0.00007720817,0.000029720564,0.00019964339,0.00074078183,0.0013350119,0.0037252048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999713,0.000060821785,0.000014104254,0.00005946319,0.000117519594,0.00003517142],"domain_scores_gemma":[0.9992824,0.00039369683,0.000057346093,0.000118928045,0.00012356539,0.000024099128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006693361,0.00094662776,0.0008068356,0.00047550266,0.00051559927,0.001378591,0.0020759928,0.0013779156,0.0042340313],"category_scores_gemma":[0.0018601932,0.00093224196,0.0012335012,0.0007246824,0.00045784173,0.0010558331,0.0010065684,0.0011094676,0.0019206611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029202283,0.00011705205,0.00043817254,0.00038208245,0.00009893009,0.00018268153,0.0002050061,0.6360177,0.10432444,0.039692506,0.006929697,0.2113198],"study_design_scores_gemma":[0.000002463955,0.000007137834,0.000055314125,0.0000049531955,0.000005940582,0.0000253254,0.000003870686,0.98591274,0.009308902,0.0035496338,0.0011163711,0.0000073641113],"about_ca_topic_score_codex":0.005297712,"about_ca_topic_score_gemma":0.007420832,"teacher_disagreement_score":0.005297712,"about_ca_system_score_codex":0.0012467562,"about_ca_system_score_gemma":0.0014458094,"threshold_uncertainty_score":0.014164269},"labels":[],"label_agreement":null},{"id":"W4387425112","doi":"10.1007/978-981-99-7074-2_22","title":"NeoMS: Identification of Novel MHC-I Peptides with Tandem Mass Spectrometry","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"vaccines and immunoinformatics approaches","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 Waterloo","funders":"","keywords":"Computer science; Identification (biology); Sequence database; Database search engine; Tandem mass spectrometry; False discovery rate; Workflow; Computational biology; Sequence (biology); Mass spectrometry; Data mining; Artificial intelligence; Database; Information retrieval; Search engine; Biology; Chemistry; Genetics; Chromatography","score_opus":0.016434082804092406,"score_gpt":0.23133739788131708,"score_spread":0.21490331507722465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387425112","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.1591935,0.05579745,0.66292596,0.0040436327,0.0042469394,0.0008179724,0.008565719,0.018035641,0.08637318],"genre_scores_gemma":[0.18671037,0.02358749,0.541144,0.0034313197,0.0010720277,0.00092373416,0.010669725,0.0017978408,0.23066342],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999658,0.000026274141,0.00001159395,0.00007016749,0.0002084044,0.000025586027],"domain_scores_gemma":[0.9998919,0.000030921597,0.00001935818,0.000012615205,0.000026434172,0.000018853656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045004673,0.0008741441,0.00045166397,0.0011744134,0.00028639362,0.0009461585,0.0012427156,0.0008648917,0.0057988525],"category_scores_gemma":[0.00038817563,0.00044098552,0.0003603335,0.00068887917,0.00034281547,0.0010124949,0.00093000813,0.0010008409,0.006981472],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023992528,0.00008522455,0.00041836652,0.00026863848,0.000050019673,0.0002468473,0.000042719716,0.00043964537,0.7877303,0.003366066,0.01696095,0.19015129],"study_design_scores_gemma":[0.000046861827,0.0002757989,0.0025496176,0.000060557133,0.000044372962,0.0031405098,0.00006266161,0.011414624,0.79129785,0.007525185,0.18350714,0.00007481974],"about_ca_topic_score_codex":0.00021601512,"about_ca_topic_score_gemma":0.0004887152,"teacher_disagreement_score":0.0057988525,"about_ca_system_score_codex":0.00032275758,"about_ca_system_score_gemma":0.00028642832,"threshold_uncertainty_score":0.019399047},"labels":[],"label_agreement":null},{"id":"W4387426875","doi":"10.1007/978-3-031-44696-2","title":"Natural Language Processing and Chinese Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Computational Techniques and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Microsoft Research Asia; University of California, San Diego; University of Chinese Academy of Sciences; National Laboratory of Pattern Recognition; Beijing Language and Culture University; Beijing Institute of Technology; Sichuan University; Institute of Automation, Chinese Academy of Sciences; Fudan University; University of Essex; University of Southern California; University of South China; Chongqing University; Chinese Academy of Sciences; University of Melbourne; Eidgenössische Technische Hochschule Zürich; Emory University; University of Texas at Austin; National University of Singapore; Harbin Institute of Technology; University of Alberta; Soochow University; Chongqing University of Posts and Telecommunications; Microsoft Research; Beijing University of Posts and Telecommunications; Tencent","keywords":"Computer science; Programming language; Natural language processing","score_opus":0.00925837318026936,"score_gpt":0.30331807618717505,"score_spread":0.2940597030069057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387426875","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065416746,0.040204052,0.1665625,0.010806532,0.0026492788,0.00019752406,0.0024030905,0.0017902735,0.70997006],"genre_scores_gemma":[0.5249848,0.020681087,0.071225695,0.0012205766,0.0017519135,0.00023882062,0.002687542,0.0006323704,0.37657723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998654,0.00003602547,0.000010670376,0.000028706401,0.000036720736,0.000022442699],"domain_scores_gemma":[0.99982953,0.00008353624,0.00001151403,0.000028663844,0.000033895456,0.000012861278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017356616,0.00052843353,0.00040662114,0.0011017171,0.0010366406,0.0014615649,0.00040450195,0.00022056683,0.018976811],"category_scores_gemma":[0.0006716112,0.0001701248,0.00036680824,0.0025398193,0.0015370307,0.0028616958,0.0005378028,0.000598578,0.0024014865],"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.00004361293,0.000010061967,0.0003308675,0.00025298333,0.000011995866,0.00019539864,0.0006091525,0.001561877,0.001731775,0.84131265,0.038165323,0.11577432],"study_design_scores_gemma":[0.000014123886,0.000027608565,0.0019511831,0.000079244564,0.000023520772,0.00033899752,0.0003882851,0.009966818,0.003495122,0.69798905,0.28569776,0.000028402814],"about_ca_topic_score_codex":0.011051732,"about_ca_topic_score_gemma":0.009248872,"teacher_disagreement_score":0.018976811,"about_ca_system_score_codex":0.0017337309,"about_ca_system_score_gemma":0.0013515874,"threshold_uncertainty_score":0.063483775},"labels":[],"label_agreement":null},{"id":"W4387430130","doi":"10.1007/978-3-031-44858-4","title":"Machine Learning in Clinical Neuroimaging","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Concordia University","funders":"","keywords":"Neuroimaging; Computer science; Artificial intelligence; Machine learning; Cognitive science; Neuroscience; Psychology","score_opus":0.15909758411656386,"score_gpt":0.44562137339282376,"score_spread":0.2865237892762599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430130","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030291902,0.40345666,0.32269222,0.03496049,0.0108266,0.00011070213,0.00063953735,0.0014444746,0.22284012],"genre_scores_gemma":[0.054304566,0.26472,0.17875725,0.010593811,0.017885407,0.000290453,0.001269365,0.0007859257,0.4713932],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997553,0.00009714478,0.000013766358,0.000028391842,0.00009106547,0.0000142669505],"domain_scores_gemma":[0.99906296,0.00072147115,0.000029380542,0.00006806158,0.00008270461,0.00003541767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009641489,0.0005639604,0.00072059664,0.0011133278,0.00018561841,0.0010576048,0.0005651068,0.0010022736,0.01463965],"category_scores_gemma":[0.0021634991,0.00042502338,0.0003200385,0.0009451494,0.00068669807,0.0016857882,0.00091465155,0.0022218693,0.007298438],"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.000016919763,0.00003304295,0.00021026154,0.0004227989,0.000028817933,0.0001280981,0.00006352749,0.0027845607,0.0005013048,0.06946971,0.3017887,0.62455225],"study_design_scores_gemma":[0.0000149597845,0.000054707212,0.0014716013,0.0007865913,0.000026776881,0.0018645971,0.00006869102,0.0157045,0.00090815854,0.2766415,0.7024238,0.000034166078],"about_ca_topic_score_codex":0.0006117395,"about_ca_topic_score_gemma":0.0018904479,"teacher_disagreement_score":0.01463965,"about_ca_system_score_codex":0.0004402985,"about_ca_system_score_gemma":0.00044799477,"threshold_uncertainty_score":0.048974514},"labels":[],"label_agreement":null},{"id":"W4387430212","doi":"10.1007/978-3-031-46005-0_23","title":"Pose2Gait: Extracting Gait Features from Monocular Video of Individuals with Dementia","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Balance, Gait, and Falls Prevention","field":"Health Professions","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":"Ontario Brain Institute; Toronto Western Hospital; Hospital for Sick Children; University of Toronto; University Health Network; Toronto Rehabilitation Institute","funders":"","keywords":"Computer science; Artificial intelligence; Gait; Monocular; Computer vision; Dementia; Physical medicine and rehabilitation; Medicine","score_opus":0.02781559003690092,"score_gpt":0.32087669647668515,"score_spread":0.2930611064397842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430212","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.5013162,0.0104645565,0.3828971,0.00058604026,0.0013034604,0.00079972344,0.05538013,0.020717466,0.026535384],"genre_scores_gemma":[0.49526832,0.0059259734,0.40075257,0.00043245917,0.00046674602,0.0005158877,0.054335635,0.0007936256,0.04150878],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99991536,0.0000072729035,0.000004310574,0.000024044559,0.00003140874,0.000017632929],"domain_scores_gemma":[0.99994123,0.000019079478,0.0000042221513,0.0000050643885,0.000020772053,0.000009679673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016979176,0.0007736931,0.000443841,0.0011539782,0.00014982368,0.00039904512,0.00033527883,0.00041628847,0.006131071],"category_scores_gemma":[0.00041173736,0.0001742741,0.0003553353,0.0008129753,0.00006823566,0.00029423446,0.0004203469,0.00014645292,0.0029864926],"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.0003814755,0.00009479028,0.0061876466,0.00023365498,0.000060899787,0.00040767915,0.00008270547,0.0021964568,0.043764476,0.00017656878,0.039856147,0.90655756],"study_design_scores_gemma":[0.00019263725,0.0013270653,0.40470028,0.0003683374,0.00035825383,0.009971369,0.001102721,0.37095773,0.115592666,0.003250233,0.09198356,0.00019519463],"about_ca_topic_score_codex":0.00725987,"about_ca_topic_score_gemma":0.022535533,"teacher_disagreement_score":0.00725987,"about_ca_system_score_codex":0.0001505427,"about_ca_system_score_gemma":0.00024290955,"threshold_uncertainty_score":0.020510495},"labels":[],"label_agreement":null},{"id":"W4387430255","doi":"10.1007/978-3-031-45275-8","title":"Discovery Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Instituto Superior Técnico; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Högskolan i Halmstad; Université de Caen Normandie; National Institute of Informatics; University of Bristol; Université François-Rabelais; Universidade Estadual Paulista; Universidad de Cádiz; Universiteit van Tilburg; Instituto Politécnico do Porto; Universidade do Minho; Rheinische Friedrich-Wilhelms-Universität Bonn; Institut \"Jožef Stefan\"; Universidad de Córdoba; University of Cyprus; Univerza v Ljubljani; Università di Pisa; Centre de Coopération Internationale en Recherche Agronomique pour le Développement; Università della Calabria; Aalto-Yliopisto; Uppsala Universitet; Masarykova Univerzita; Stockholms Universitet; Universidade do Porto; Universidad de Granada; Universidade de Coimbra; Birmingham City University; Aristotle University of Thessaloniki; King Abdullah University of Science and Technology; Johannes Gutenberg-Universität Mainz; Universidad Politécnica de Madrid; Région Normandie; Universiteit Utrecht; University of Regina; Institut National de la Recherche Agronomique; Politechnika Poznańska; Université de Montpellier; Helsingin Yliopisto; Universidade Federal do ABC; Università degli Studi di Milano; Universidade de São Paulo; Universidade Federal de Uberlândia; Universiteit Leiden; Universidad Pública de Navarra; University of South Florida; Universidade de Lisboa; University of Waikato; Universität Bielefeld; Universidad Politécnica de Cartagena; University of Ottawa; Università degli Studi di Napoli Federico II","keywords":"Computer science; Focus (optics); Artificial intelligence; Natural language processing","score_opus":0.0453543580411192,"score_gpt":0.28045018134919836,"score_spread":0.23509582330807915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430255","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018196207,0.024815157,0.09433476,0.023041584,0.0042437487,0.00011048631,0.0009881199,0.0015821786,0.8490644],"genre_scores_gemma":[0.06127153,0.026034953,0.04047133,0.0057902876,0.0039990973,0.000286151,0.0023031791,0.00087194255,0.85897154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988926,0.00020326397,0.000037871687,0.00022859032,0.0005679315,0.00006981231],"domain_scores_gemma":[0.9984524,0.0005830847,0.00004975699,0.0005373096,0.0002682378,0.00010917997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013714234,0.00071488525,0.0009413837,0.0021610372,0.0012690218,0.0052105347,0.0014096188,0.0018839757,0.05449663],"category_scores_gemma":[0.0032074768,0.0006033539,0.00054406386,0.0018071807,0.0027740377,0.0062236306,0.002580093,0.002877241,0.026745193],"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.000011712747,0.00002335591,0.000092778326,0.00014389548,0.000011663724,0.000031695312,0.00010134455,0.00037253276,0.00033064085,0.7702084,0.14898463,0.079687424],"study_design_scores_gemma":[0.0000056131453,0.000006580293,0.000066331464,0.00006155097,0.0000049066794,0.000078048884,0.00004101743,0.00090916234,0.0003918656,0.46721697,0.5312123,0.0000057292395],"about_ca_topic_score_codex":0.00125461,"about_ca_topic_score_gemma":0.0013387391,"teacher_disagreement_score":0.05449663,"about_ca_system_score_codex":0.0022959865,"about_ca_system_score_gemma":0.0019020867,"threshold_uncertainty_score":0.18230939},"labels":[],"label_agreement":null},{"id":"W4387430259","doi":"10.1007/978-3-031-44858-4_5","title":"VesselShot: Few-shot Learning for Cerebral Blood Vessel Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acute Ischemic Stroke Management","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Segmentation; Annotation; Artificial intelligence; Modalities; Task (project management); Deep learning; Sørensen–Dice coefficient; Labeled data; Machine learning; Image segmentation; Pattern recognition (psychology)","score_opus":0.02787085007116944,"score_gpt":0.2807065626317025,"score_spread":0.25283571256053305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002031125,0.0013696548,0.95555073,0.00013645011,0.00027001204,0.00008616065,0.0020277922,0.034674317,0.003853727],"genre_scores_gemma":[0.019335363,0.0016906584,0.94257855,0.00027192236,0.00020382676,0.00018899963,0.008120386,0.0065166117,0.021093696],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959165,0.00003909271,0.000018928533,0.00014170483,0.0001613572,0.000047244786],"domain_scores_gemma":[0.99953413,0.00023091289,0.000018827921,0.000071432034,0.00010268816,0.000041963063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006136578,0.0018114548,0.0012119187,0.0015224853,0.00040407645,0.0015288834,0.0026751782,0.0021529438,0.040589638],"category_scores_gemma":[0.001436843,0.0013409716,0.0011805687,0.0014991888,0.00035277745,0.0014422361,0.0014775363,0.0019131064,0.018873286],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001905188,0.00008339582,0.00016937387,0.0003691717,0.000107067644,0.000103771934,0.000060345596,0.017300462,0.024745587,0.0037066664,0.10504097,0.8481227],"study_design_scores_gemma":[0.0000828443,0.00016126274,0.0012460968,0.00014085748,0.00009729464,0.0007658271,0.000061925275,0.80810946,0.06008335,0.02380565,0.105321996,0.00012338882],"about_ca_topic_score_codex":0.0046971412,"about_ca_topic_score_gemma":0.00892554,"teacher_disagreement_score":0.040589638,"about_ca_system_score_codex":0.00047892798,"about_ca_system_score_gemma":0.00075325446,"threshold_uncertainty_score":0.13578582},"labels":[],"label_agreement":null},{"id":"W4387430304","doi":"10.1007/978-3-031-45275-8_47","title":"Toward Streamlining the Evaluation of Novelty Detection in Data Streams","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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 Ottawa","funders":"","keywords":"Computer science; Novelty; Novelty detection; Data stream mining; Field (mathematics); Domain (mathematical analysis); Task (project management); Complement (music); Artificial intelligence; Machine learning; Data mining; Concept drift","score_opus":0.14455213321944124,"score_gpt":0.34408807025928945,"score_spread":0.1995359370398482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430304","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.032074764,0.001975596,0.9598212,0.0006035458,0.00029946776,0.00023680138,0.0003282057,0.0033603695,0.0013001515],"genre_scores_gemma":[0.22452074,0.0011754532,0.7685579,0.00036115464,0.0005261775,0.00021890436,0.0010746926,0.00044355134,0.0031214687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573296,0.001353336,0.00041490406,0.0006718726,0.0016663582,0.00016061157],"domain_scores_gemma":[0.97481936,0.01589809,0.0012742085,0.0020099655,0.0054435697,0.0005547293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008902751,0.0015187314,0.0017943045,0.003441226,0.0004014793,0.0039317473,0.0020677438,0.001743846,0.0017886057],"category_scores_gemma":[0.03665494,0.0005480938,0.0007971951,0.0026068464,0.00056209776,0.003927311,0.0017373818,0.0022275555,0.0013484398],"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.0010408888,0.0004255143,0.009182037,0.00030847962,0.00016699589,0.00007651551,0.00010615866,0.0376547,0.025500242,0.0064420826,0.0069459667,0.9121503],"study_design_scores_gemma":[0.0000483709,0.00025812516,0.0012181087,0.000040218118,0.00005565471,0.00011590249,0.00003162904,0.969801,0.016492141,0.009973461,0.001947466,0.000017924189],"about_ca_topic_score_codex":0.0013466657,"about_ca_topic_score_gemma":0.001486469,"teacher_disagreement_score":0.008902751,"about_ca_system_score_codex":0.0008000664,"about_ca_system_score_gemma":0.0012095857,"threshold_uncertainty_score":0.04708278},"labels":[],"label_agreement":null},{"id":"W4387430331","doi":"10.1007/978-3-031-45275-8_36","title":"Unsupervised Graph Neural Networks for Source Code Similarity Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Ottawa; IBM (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Source code; Inference; Similarity (geometry); Artificial intelligence; Graph; Unsupervised learning; Encoder; Artificial neural network; Code (set theory); Pattern recognition (psychology); Context (archaeology); Data mining; Theoretical computer science; Programming language","score_opus":0.027613856604873862,"score_gpt":0.2597452961992475,"score_spread":0.23213143959437366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04038147,0.0018134747,0.94737077,0.0002751992,0.00013095938,0.00008394791,0.0007744154,0.005522432,0.0036472962],"genre_scores_gemma":[0.4454909,0.0011437968,0.5327174,0.00019939773,0.00016812715,0.00015901709,0.0032466429,0.0007222469,0.01615247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00007181372,0.00001814489,0.00012904583,0.000114814604,0.000036788617],"domain_scores_gemma":[0.9990777,0.00043351782,0.00009804583,0.00014776367,0.00021443279,0.00002867361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037079392,0.00070483604,0.00064813695,0.0019435142,0.00035377906,0.0008090945,0.0014576967,0.0011040196,0.0026586233],"category_scores_gemma":[0.001989046,0.00039996637,0.000646719,0.0019476839,0.00033890494,0.0012553643,0.00083332683,0.0010946409,0.0014916088],"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.00016685418,0.00015159321,0.0016682651,0.0001407439,0.00009527968,0.000071843555,0.000043638658,0.13516144,0.016522387,0.0057996577,0.009300351,0.83087796],"study_design_scores_gemma":[0.00000386132,0.000018366805,0.00056708173,0.000009451366,0.000012452944,0.00003276549,0.000011997289,0.989286,0.0034188398,0.0056450814,0.0009882919,0.000005722192],"about_ca_topic_score_codex":0.006426096,"about_ca_topic_score_gemma":0.01346526,"teacher_disagreement_score":0.006426096,"about_ca_system_score_codex":0.00068757817,"about_ca_system_score_gemma":0.0005260665,"threshold_uncertainty_score":0.012777388},"labels":[],"label_agreement":null},{"id":"W4387430347","doi":"10.1007/978-3-031-45275-8_45","title":"HEART: Heterogeneous Log Anomaly Detection Using Robust Transformers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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 Ottawa","funders":"","keywords":"Anomaly detection; Computer science; Parsing; Transformer; Data mining; Artificial intelligence; Voltage; Engineering","score_opus":0.02768107247194464,"score_gpt":0.24537042933779288,"score_spread":0.21768935686584823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009399435,0.00017824372,0.9479708,0.000092555005,0.00011221693,0.00006826791,0.0005021928,0.040303644,0.0013725733],"genre_scores_gemma":[0.42612013,0.00025970946,0.5595043,0.00020779678,0.00019222402,0.00011651264,0.0021408463,0.0036225352,0.007835952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991136,0.00008216641,0.000048695547,0.00026642391,0.00041186676,0.000077248806],"domain_scores_gemma":[0.99849975,0.00048334387,0.00015015752,0.0005261134,0.00025914868,0.00008150883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093051954,0.001147101,0.0009481496,0.0018599462,0.00034960138,0.0016168777,0.0020499902,0.00072753755,0.006541679],"category_scores_gemma":[0.0036520092,0.0005527815,0.00059811986,0.0010987452,0.00047879564,0.002592636,0.0018837937,0.0011964588,0.0029492583],"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.00097271905,0.0002218861,0.0054569016,0.00017376123,0.00015760813,0.0003728932,0.000120469536,0.025897771,0.040387157,0.009372992,0.026657464,0.8902085],"study_design_scores_gemma":[0.00010034832,0.00022012896,0.0020743546,0.000026518395,0.00008441476,0.0008044584,0.00006941094,0.9024966,0.050021894,0.03199296,0.012052707,0.000056312638],"about_ca_topic_score_codex":0.0014456614,"about_ca_topic_score_gemma":0.0015817349,"teacher_disagreement_score":0.006541679,"about_ca_system_score_codex":0.00036861107,"about_ca_system_score_gemma":0.000636478,"threshold_uncertainty_score":0.021884084},"labels":[],"label_agreement":null},{"id":"W4387435243","doi":"10.1007/978-3-031-45249-9_27","title":"Debiasing Counterfactuals in the Presence of Spurious Correlations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Engineering and Physical Sciences Research Council","keywords":"Spurious relationship; Counterfactual thinking; Debiasing; Computer science; Artificial intelligence; Machine learning; Correlation; Population; Classifier (UML); Metric (unit); A priori and a posteriori; Pattern recognition (psychology); Mathematics; Psychology; Medicine","score_opus":0.045505429439986214,"score_gpt":0.3192125921469094,"score_spread":0.2737071627069232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387435243","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.06297426,0.002902475,0.9195349,0.0038225427,0.00043242172,0.00010113021,0.0001576974,0.0004821911,0.009592278],"genre_scores_gemma":[0.7972738,0.0012651266,0.19478852,0.0008718096,0.0006792873,0.00019302388,0.00023538085,0.00021225946,0.0044808686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97057176,0.020910366,0.0015860822,0.0026790125,0.0035338793,0.0007190269],"domain_scores_gemma":[0.5196558,0.4322404,0.016710974,0.026149046,0.004131167,0.0011125049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.059414126,0.0012940149,0.0027291751,0.0029553839,0.0012888543,0.006557347,0.0030778765,0.0038999987,0.0059681935],"category_scores_gemma":[0.33649728,0.0015384569,0.0013782864,0.0027974118,0.0073072664,0.011662109,0.0063374112,0.0064427527,0.0006719602],"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.0007029661,0.000100401485,0.0065608695,0.00036723376,0.00040574514,0.0010486948,0.0009870356,0.0662714,0.00093366206,0.8285736,0.0034786689,0.09056983],"study_design_scores_gemma":[0.000065448265,0.00006770321,0.0006208718,0.00013454187,0.00007399651,0.00030609412,0.00011313516,0.30782112,0.0009691635,0.6881788,0.001612712,0.000036488327],"about_ca_topic_score_codex":0.0010277849,"about_ca_topic_score_gemma":0.0008929052,"teacher_disagreement_score":0.059414126,"about_ca_system_score_codex":0.0014927833,"about_ca_system_score_gemma":0.0017638593,"threshold_uncertainty_score":0.31421572},"labels":[],"label_agreement":null},{"id":"W4387435262","doi":"10.1007/978-3-031-45249-9_20","title":"Studying the Effects of Sex-Related Differences on Brain Age Prediction Using Brain MR Imaging","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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 Calgary","funders":"","keywords":"Interpretability; Generalizability theory; Machine learning; Artificial intelligence; Computer science; Neuroimaging; Demographics; Generalization; Context (archaeology); Affect (linguistics); Psychology; Developmental psychology; Demography; Neuroscience","score_opus":0.031474972007579836,"score_gpt":0.2700527544772534,"score_spread":0.23857778246967357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387435262","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.99404365,0.0016247344,0.0014523622,0.0001507649,0.00004966784,0.000012964009,0.0003304812,0.000019585808,0.0023158514],"genre_scores_gemma":[0.9922152,0.0009897295,0.0015476276,0.00010362943,0.00006107738,0.000017136117,0.00040049505,0.000046620607,0.004618561],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998173,0.00006992994,0.000008432446,0.00006139098,0.000026157113,0.00001684378],"domain_scores_gemma":[0.99575555,0.0035310457,0.00030891647,0.00017068874,0.00010567522,0.000128239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084075873,0.00030338153,0.00022361265,0.00022559353,0.000104098326,0.0004054294,0.00030072557,0.0002992706,0.0053417254],"category_scores_gemma":[0.0045303516,0.00016175635,0.00033003849,0.00025359,0.0001685595,0.00042940368,0.00018053647,0.0004324377,0.0006713431],"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.015108873,0.0013626023,0.57709354,0.00029912943,0.001145004,0.0012110872,0.0009508308,0.0022584482,0.17812547,0.0010585153,0.002172504,0.21921405],"study_design_scores_gemma":[0.00006954896,0.0025285115,0.97578764,0.000020928837,0.00041336968,0.00044763705,0.00025074914,0.0033237797,0.014658115,0.0012366953,0.0012403545,0.000022685952],"about_ca_topic_score_codex":0.0012937258,"about_ca_topic_score_gemma":0.0021582649,"teacher_disagreement_score":0.0053417254,"about_ca_system_score_codex":0.000106465515,"about_ca_system_score_gemma":0.00013228698,"threshold_uncertainty_score":0.01786989},"labels":[],"label_agreement":null},{"id":"W4387435284","doi":"10.1007/978-3-031-45249-9_28","title":"On the Relationship Between Open Science in Artificial Intelligence for Medical Imaging and Global Health Equity","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Computer science; Equity (law); Data science; Open data; Health care; Context (archaeology); Open science; Data sharing; Scarcity; Knowledge management; Public domain; Artificial intelligence; Political science; Medicine; World Wide Web","score_opus":0.32242150330605235,"score_gpt":0.5050720618089694,"score_spread":0.182650558502917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387435284","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.012459781,0.039342817,0.040630963,0.08251316,0.0018272803,0.000043899207,0.00009676887,0.000040986946,0.82304436],"genre_scores_gemma":[0.8212019,0.04798097,0.023579163,0.010922085,0.005318549,0.00018246473,0.0001346092,0.000116702504,0.09056359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912375,0.00047719872,0.000032491622,0.00009552142,0.00019375628,0.00007728887],"domain_scores_gemma":[0.9915336,0.0075411387,0.00023087593,0.0002883498,0.00026136832,0.00014480484],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0026682445,0.00042489637,0.0004465009,0.0010500916,0.0013630099,0.0046481844,0.0006637369,0.0025721204,0.012466643],"category_scores_gemma":[0.0077539887,0.00023479667,0.00034381897,0.0016773256,0.013191537,0.009284763,0.0029869499,0.0053401347,0.00071122934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024760645,0.0000046836144,0.000054202348,0.000015281974,0.0000015076928,0.0000112619255,0.00010585701,0.00016620404,0.000016728642,0.99165803,0.0022597618,0.005703939],"study_design_scores_gemma":[0.000001526399,0.0000027264728,0.00010897682,0.000041951887,0.0000011378404,0.000014109192,0.00006422401,0.00025886818,0.000018446943,0.9903481,0.00913788,0.0000019747836],"about_ca_topic_score_codex":0.0016019524,"about_ca_topic_score_gemma":0.0024451646,"teacher_disagreement_score":0.99933624,"about_ca_system_score_codex":0.0023920632,"about_ca_system_score_gemma":0.0015742112,"threshold_uncertainty_score":0.041705072},"labels":[],"label_agreement":null},{"id":"W4387438781","doi":"10.1007/978-3-031-45249-9","title":"Clinical Image-Based Procedures, Fairness of AI in Medical Imaging, and Ethical and Philosophical Issues in Medical Imaging","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Western University","funders":"","keywords":"Computer science; Medical imaging; Image (mathematics); Artificial intelligence; Medical physics; Computer vision; Medicine","score_opus":0.06618123590461258,"score_gpt":0.4543220523405456,"score_spread":0.388140816435933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387438781","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008288862,0.041031033,0.31228814,0.25080827,0.0040307236,0.00026211402,0.00014218637,0.00015399867,0.3829947],"genre_scores_gemma":[0.6357765,0.017979955,0.2220159,0.036053702,0.008829795,0.0009905254,0.00015391418,0.0003787272,0.07782094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9742493,0.017858349,0.0012997783,0.0011327649,0.0047007427,0.00075902144],"domain_scores_gemma":[0.9277815,0.06123365,0.002293109,0.0046549872,0.0029961732,0.0010406361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03974737,0.00060235383,0.0009229928,0.0017705517,0.003038748,0.008926123,0.002513684,0.009025485,0.0054572946],"category_scores_gemma":[0.080682345,0.00071825634,0.0008228014,0.0015227833,0.054728333,0.009780809,0.0036203454,0.009840267,0.00083662703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062930344,0.000007699424,0.000048033136,0.000032633525,0.000003967173,0.000021965183,0.0004736071,0.00017511813,0.000055020602,0.9891676,0.0032078824,0.006800257],"study_design_scores_gemma":[0.000006248305,0.000006774855,0.000108451975,0.00006237032,0.000003462568,0.00011993256,0.00013889102,0.0004111043,0.00009624572,0.98655266,0.012485162,0.000008607625],"about_ca_topic_score_codex":0.0023104367,"about_ca_topic_score_gemma":0.0024839363,"teacher_disagreement_score":0.03974737,"about_ca_system_score_codex":0.0033264158,"about_ca_system_score_gemma":0.006814573,"threshold_uncertainty_score":0.21020669},"labels":[],"label_agreement":null},{"id":"W4387455784","doi":"10.1007/978-3-031-45461-5","title":"Graphonomics in Human Body Movement. Bridging Research and Practice from Motor Control to Handwriting Analysis and Recognition","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Writing and Handwriting Education","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitat Autònoma de Barcelona; Haute école Spécialisée de Suisse Occidentale; Trakya Üniversitesi; Università degli Studi di Salerno; Vysoké Učení Technické v Brně; Centre National de la Recherche Scientifique; Southern Cross University; Institut Polytechnique de Paris; Bahria University; Universitat Pompeu Fabra; University of Haifa; Indian National Science Academy; Polytechnique Montréal; University of West Attica; Universidad de Alicante; Universidad de Las Palmas de Gran Canaria; Universidade de Lisboa; Louisiana State University","keywords":"Handwriting; Computer science; Bridging (networking); Movement (music); Motor control; Speech recognition; Movement control; Artificial intelligence; Human–computer interaction; Physical medicine and rehabilitation; Neuroscience; Psychology; Computer security; Medicine","score_opus":0.05426305328618853,"score_gpt":0.37796303258875874,"score_spread":0.3236999793025702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387455784","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03412484,0.29801437,0.54812455,0.011933373,0.009495765,0.000092331415,0.00073341874,0.0013091146,0.09617226],"genre_scores_gemma":[0.58923703,0.17059371,0.14683615,0.0015772257,0.007953003,0.00015855806,0.0008398704,0.0004894984,0.082315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998227,0.00005322276,0.00001441175,0.000050842355,0.000047967707,0.000011010719],"domain_scores_gemma":[0.99956566,0.00024536147,0.000042971016,0.00004637921,0.00006652498,0.000033032662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229869,0.0006100508,0.00048443006,0.0015264193,0.00037521496,0.0012773114,0.00036131576,0.00069582934,0.004559575],"category_scores_gemma":[0.0010699374,0.00029866863,0.00037396813,0.0014684965,0.0019943852,0.0014819518,0.0004780083,0.00072652707,0.0011310024],"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.00010782701,0.00006804042,0.0023705775,0.0015000933,0.0000673747,0.00040771256,0.0012078028,0.015128527,0.008309717,0.49472198,0.048212353,0.42789802],"study_design_scores_gemma":[0.000024079944,0.00019162949,0.01297819,0.00055148697,0.000053810258,0.0013019401,0.00075417047,0.030164354,0.0019070744,0.7837072,0.16829729,0.00006882804],"about_ca_topic_score_codex":0.0026979526,"about_ca_topic_score_gemma":0.0037421605,"teacher_disagreement_score":0.004559575,"about_ca_system_score_codex":0.00045467113,"about_ca_system_score_gemma":0.0004726672,"threshold_uncertainty_score":0.015253305},"labels":[],"label_agreement":null},{"id":"W4387455785","doi":"10.1007/978-3-031-45461-5_15","title":"Lognormality: An Open Window on Neuromotor Control","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Motor Control and Adaptation","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke; Polytechnique Montréal","funders":"","keywords":"Session (web analytics); Window (computing); Computer science; World Wide Web","score_opus":0.05850866075884096,"score_gpt":0.28292721943052346,"score_spread":0.2244185586716825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387455785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005349336,0.06676397,0.8133973,0.0075163906,0.004326599,0.000022022492,0.00027540314,0.0008783817,0.10147063],"genre_scores_gemma":[0.39314076,0.11308749,0.23180138,0.00647397,0.03826716,0.0002550312,0.0005399144,0.002923696,0.21351062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945015,0.00012394732,0.00003266002,0.00012408203,0.00023726604,0.000032014974],"domain_scores_gemma":[0.99662495,0.0026347428,0.00008579145,0.00033155718,0.00023672082,0.00008637531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389027,0.0011043714,0.0011518521,0.001037054,0.00039554277,0.002746777,0.0015214861,0.0015829636,0.014273955],"category_scores_gemma":[0.005980954,0.0005149657,0.0006250881,0.0016050289,0.0033346654,0.009602666,0.0021983301,0.0036428908,0.0035785865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041815758,0.000029509858,0.00018905834,0.0001816922,0.000023010567,0.00008230026,0.00009902514,0.008351049,0.00083098566,0.8202987,0.024667205,0.1452056],"study_design_scores_gemma":[0.000005161341,0.000012393545,0.00014476242,0.00006738681,0.000007351285,0.000108847555,0.000021359365,0.025284829,0.00033864257,0.93247724,0.04151361,0.000018521108],"about_ca_topic_score_codex":0.00095014996,"about_ca_topic_score_gemma":0.0007830966,"teacher_disagreement_score":0.014273955,"about_ca_system_score_codex":0.0011387673,"about_ca_system_score_gemma":0.00047706263,"threshold_uncertainty_score":0.04775107},"labels":[],"label_agreement":null},{"id":"W4387477964","doi":"10.1007/978-3-031-45513-1_6","title":"Linicrypt in the Ideal Cipher Model","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Computer science; Block cipher; Ideal (ethics); Cipher; Theoretical computer science; Cryptographic hash function; Cryptography; Algorithm; Programming language; Encryption; Computer security","score_opus":0.04341923448835318,"score_gpt":0.302954283408371,"score_spread":0.25953504892001783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387477964","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.04601378,0.0060813436,0.44629523,0.0062592984,0.0014248231,0.00011163254,0.000485576,0.00094749883,0.49238086],"genre_scores_gemma":[0.7072018,0.006348556,0.08782331,0.0012413213,0.0010872006,0.00016050454,0.0003892489,0.00045111738,0.19529693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992508,0.00019279143,0.00003629373,0.00010470399,0.0002997882,0.000115519586],"domain_scores_gemma":[0.9993857,0.00023451463,0.000052556694,0.00021127352,0.00008078203,0.000035209767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080616155,0.0006452445,0.0006064019,0.00072776875,0.0008447338,0.0030121615,0.0006650872,0.0012880684,0.00842735],"category_scores_gemma":[0.0017373825,0.00035208312,0.0005975398,0.0007513883,0.0026271546,0.006782855,0.001382717,0.0029689344,0.0038958702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016272314,0.000005580703,0.000018871842,0.000017422071,0.0000018648002,0.000030286235,0.00003958513,0.000985173,0.00028881518,0.99352795,0.001999873,0.0030682487],"study_design_scores_gemma":[0.000014475241,0.000017886747,0.000023825478,0.000022175322,0.000004407694,0.0001517168,0.000019588511,0.011223967,0.0009189553,0.9694416,0.01815191,0.000009469232],"about_ca_topic_score_codex":0.00033757175,"about_ca_topic_score_gemma":0.00027598286,"teacher_disagreement_score":0.00842735,"about_ca_system_score_codex":0.0011443016,"about_ca_system_score_gemma":0.0008268132,"threshold_uncertainty_score":0.028192282},"labels":[],"label_agreement":null},{"id":"W4387518658","doi":"10.1007/978-3-031-45544-5","title":"Perinatal, Preterm and Paediatric Image Analysis","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Hip and Femur Fractures","field":"Medicine","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":"Hospital for Sick Children","funders":"Universitätsklinikum Erlangen; Universität Zürich; Centre Hospitalier Universitaire Vaudois; Technion-Israel Institute of Technology; Medizinische Universität Wien; Massachusetts Institute of Technology; Universität Wien; Worcester Polytechnic Institute; King's College London; Universidad Nacional Autónoma de México; Imperial College London; Technische Universität München; University of Toronto; Massachusetts General Hospital","keywords":"Computer science; Focus (optics); Image (mathematics); Artificial intelligence; Computer vision","score_opus":0.010163518378385144,"score_gpt":0.26961861047203395,"score_spread":0.2594550920936488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387518658","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016232157,0.29499823,0.22287476,0.007881557,0.007829438,0.0001693985,0.0036825377,0.0028292974,0.44350258],"genre_scores_gemma":[0.042696614,0.14882271,0.12927583,0.0014177003,0.0030242328,0.00011314562,0.0022455521,0.0011038709,0.6713005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999879,0.000013164816,0.000008975545,0.000019347077,0.00007028802,0.000009194907],"domain_scores_gemma":[0.9997383,0.00013774444,0.000011947823,0.000018482504,0.00006208722,0.000031486485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027426946,0.00056693726,0.00039120606,0.0016385807,0.00020365695,0.0011264317,0.00057594164,0.0005334271,0.030139102],"category_scores_gemma":[0.0010653462,0.00023186806,0.000436151,0.0011837217,0.00028664796,0.00059257186,0.00050742173,0.0006832093,0.008342588],"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.00003944603,0.000021461943,0.0011080157,0.00038132683,0.000015682512,0.0009147564,0.00010485159,0.0008066995,0.00404824,0.0114976335,0.14936237,0.8316996],"study_design_scores_gemma":[0.0000077467,0.00010687587,0.017855652,0.00067498465,0.000052697105,0.026609816,0.0002858685,0.0041747713,0.0051474003,0.031968754,0.9130741,0.000041332307],"about_ca_topic_score_codex":0.0017086855,"about_ca_topic_score_gemma":0.005023342,"teacher_disagreement_score":0.030139102,"about_ca_system_score_codex":0.00029555615,"about_ca_system_score_gemma":0.00041077667,"threshold_uncertainty_score":0.10082531},"labels":[],"label_agreement":null},{"id":"W4387602764","doi":"10.1007/978-3-031-45857-6_1","title":"Domain Adaptation of MRI Scanners as an Alternative to MRI Harmonization","year":2023,"lang":"gl","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Health Sciences Centre; Sunnybrook Health Science Centre; University of Toronto; University of Calgary; University of Alberta","funders":"","keywords":"Computer science; Domain adaptation; Domain (mathematical analysis); Artificial intelligence; Pairwise comparison; Pattern recognition (psychology); Feature (linguistics); Data mining; Source code; Machine learning; Classifier (UML)","score_opus":0.033374550575928856,"score_gpt":0.2831805343203113,"score_spread":0.24980598374438245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387602764","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.008049837,0.00047934902,0.9881981,0.00010802961,0.00008176104,0.00004306836,0.000106226136,0.00121906,0.0017145738],"genre_scores_gemma":[0.2590079,0.0012202138,0.7287374,0.0004024863,0.00024309945,0.00016634702,0.0010576559,0.0011409179,0.008024015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936706,0.0002333929,0.000029534242,0.00019823067,0.00011532584,0.000056424447],"domain_scores_gemma":[0.9985077,0.0005670157,0.00008543717,0.00046587473,0.0003112218,0.000062696665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015568407,0.00076266524,0.0011289024,0.0008831254,0.00033257194,0.0010323756,0.0013086892,0.0013211834,0.0040014847],"category_scores_gemma":[0.0037956762,0.0005052696,0.0009321092,0.0013662714,0.0005667736,0.0012334432,0.0017699257,0.0014408729,0.002009006],"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.0005945622,0.00023965165,0.00078583544,0.00027107677,0.00021470601,0.00014423026,0.0001482788,0.12942795,0.0729459,0.009786902,0.007037586,0.7784033],"study_design_scores_gemma":[0.000039235827,0.00021109243,0.0017507899,0.000036474004,0.00011639536,0.0006033138,0.000078335834,0.9273505,0.03764734,0.02053917,0.011576816,0.0000503983],"about_ca_topic_score_codex":0.0011423847,"about_ca_topic_score_gemma":0.0012560477,"teacher_disagreement_score":0.0040014847,"about_ca_system_score_codex":0.00026023953,"about_ca_system_score_gemma":0.00058659905,"threshold_uncertainty_score":0.013386369},"labels":[],"label_agreement":null},{"id":"W4387640435","doi":"10.1007/978-3-031-45676-3_31","title":"CCMix: Curriculum of Class-Wise Mixup for Long-Tailed Medical Image Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Overfitting; Class (philosophy); Weighting; Machine learning; Artificial intelligence; Ambiguity; Contextual image classification; Matching (statistics); Source code; Variance (accounting); Code (set theory); Image (mathematics); Pattern recognition (psychology); Artificial neural network; Set (abstract data type); Statistics","score_opus":0.035299967856400064,"score_gpt":0.33178551493657743,"score_spread":0.2964855470801774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387640435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059061754,0.00076343876,0.81369823,0.002846915,0.001511988,0.0007296037,0.0033691728,0.04239248,0.12878194],"genre_scores_gemma":[0.030988507,0.00090735505,0.75298005,0.0014030075,0.00078404264,0.00078971544,0.008509217,0.0101446165,0.19349356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987324,0.0001537309,0.00007033958,0.00036580843,0.0005276435,0.00015005606],"domain_scores_gemma":[0.9965389,0.000724386,0.00009770849,0.00051630096,0.0014589998,0.00066386984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018405609,0.0014419662,0.0007695327,0.0013488027,0.000717447,0.0029473384,0.0030094679,0.001444815,0.12098726],"category_scores_gemma":[0.0060479464,0.00083598157,0.0010251654,0.0011911069,0.000535325,0.0029091437,0.0039123828,0.0028013785,0.082293086],"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.00012779597,0.000244388,0.0006534578,0.00023446004,0.000011281359,0.00009641947,0.00024718625,0.0031211246,0.008542374,0.02806878,0.36367866,0.59497404],"study_design_scores_gemma":[0.00006182877,0.00017724182,0.0025642738,0.00031546626,0.000018741357,0.00077964395,0.00018708724,0.056645602,0.024301996,0.072424404,0.8424566,0.00006718615],"about_ca_topic_score_codex":0.001493224,"about_ca_topic_score_gemma":0.0028118854,"teacher_disagreement_score":0.12098726,"about_ca_system_score_codex":0.001617553,"about_ca_system_score_gemma":0.0026021865,"threshold_uncertainty_score":0.40474272},"labels":[],"label_agreement":null},{"id":"W4387640457","doi":"10.1007/978-3-031-45676-3_32","title":"MEDKD: Enhancing Medical Image Classification with Multiple Expert Decoupled Knowledge Distillation for Long-Tail Data","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Contextual image classification; Class (philosophy); Machine learning; Artificial intelligence; Distillation; Image (mathematics); Task (project management); Data mining; Noise (video); Pattern recognition (psychology)","score_opus":0.05536565858843196,"score_gpt":0.325771751090763,"score_spread":0.27040609250233105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387640457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013999403,0.0016015342,0.95686775,0.00075218186,0.00046994784,0.0001401451,0.0024977778,0.020640723,0.0030305502],"genre_scores_gemma":[0.10310357,0.00075955904,0.8762618,0.0007102882,0.00030113882,0.00016448813,0.007570456,0.0009184057,0.010210369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988959,0.00016451204,0.00007093263,0.00027747342,0.00050266954,0.00008856463],"domain_scores_gemma":[0.998461,0.0006345983,0.00007733968,0.0004191691,0.00034100952,0.00006690295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017726608,0.0014332728,0.0015403792,0.0020474927,0.0006029377,0.0020268296,0.0025335466,0.0018388378,0.008634969],"category_scores_gemma":[0.0038671475,0.00066878134,0.0014380689,0.0022429032,0.000497727,0.0032283098,0.002822225,0.0023625237,0.0052771247],"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.00028523713,0.00026317328,0.00071614096,0.00017434965,0.00014068204,0.00009108844,0.000057477362,0.022931015,0.010921178,0.003095628,0.045089923,0.916234],"study_design_scores_gemma":[0.000070359456,0.000116983,0.0007675288,0.000031205956,0.00006079002,0.00024894092,0.000055777033,0.9476872,0.019478805,0.016128689,0.015315862,0.00003784205],"about_ca_topic_score_codex":0.0040555703,"about_ca_topic_score_gemma":0.009410878,"teacher_disagreement_score":0.008634969,"about_ca_system_score_codex":0.0006612224,"about_ca_system_score_gemma":0.0011363362,"threshold_uncertainty_score":0.028886795},"labels":[],"label_agreement":null},{"id":"W4387640470","doi":"10.1007/978-3-031-45676-3_29","title":"A Multitask Deep Learning Model for Voxel-Level Brain Age Estimation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Voxel; Computer science; Artificial intelligence; Brain activity and meditation; Correlation; Set (abstract data type); Deep learning; Estimation; Machine learning; Pattern recognition (psychology); Neuroscience; Electroencephalography; Psychology; Mathematics","score_opus":0.08291675264729433,"score_gpt":0.2945849498883783,"score_spread":0.211668197241084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387640470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005685746,0.00055580947,0.991653,0.00025684797,0.00007465413,0.000020788353,0.00033654657,0.00086093706,0.00055572385],"genre_scores_gemma":[0.3699467,0.001623601,0.60029584,0.00069007906,0.00035937355,0.00038696977,0.0029127211,0.00066265155,0.023122119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998084,0.00004402188,0.000010922522,0.00006853858,0.000034937504,0.00003318389],"domain_scores_gemma":[0.9995443,0.00022482945,0.00003537274,0.00006043319,0.00010856459,0.00002650211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010793158,0.0007558463,0.0010645702,0.00046911422,0.00032471743,0.00073783554,0.0021683532,0.0016618313,0.0035939338],"category_scores_gemma":[0.0016995976,0.00068233575,0.0011944199,0.0008625507,0.00033391835,0.0011077959,0.001270156,0.0023027414,0.0017627975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018715144,0.00013168149,0.0008880041,0.000111707406,0.00019413412,0.00007191273,0.000052456762,0.5360558,0.008405546,0.010482,0.010368302,0.43305132],"study_design_scores_gemma":[0.0000033466624,0.000014467078,0.00017532824,0.00000541541,0.000012583248,0.000021320544,0.0000020289322,0.9938022,0.0006866608,0.0046685673,0.0006019359,0.0000062468043],"about_ca_topic_score_codex":0.007975475,"about_ca_topic_score_gemma":0.013392334,"teacher_disagreement_score":0.007975475,"about_ca_system_score_codex":0.000692513,"about_ca_system_score_gemma":0.00084012205,"threshold_uncertainty_score":0.015858114},"labels":[],"label_agreement":null},{"id":"W4387640553","doi":"10.1007/978-3-031-45676-3_23","title":"Is Visual Explanation with Grad-CAM More Reliable for Deeper Neural Networks? A Case Study with Automatic Pneumothorax Diagnosis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Concordia University","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Machine learning; Robustness (evolution); SAFER; Artificial neural network; Popularity; Convolutional neural network; Flexibility (engineering)","score_opus":0.034408357935175236,"score_gpt":0.302627817131459,"score_spread":0.26821945919628376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387640553","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.5870518,0.0026811482,0.35814765,0.014246267,0.00054204935,0.0004492149,0.0012962335,0.004188801,0.031396817],"genre_scores_gemma":[0.8947387,0.0005457061,0.094659045,0.0006105594,0.00008425177,0.000055945504,0.0005050355,0.0002889342,0.0085118795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00012328675,0.000027903528,0.000047548227,0.00010997333,0.00004032546],"domain_scores_gemma":[0.99649966,0.0028445732,0.00011407524,0.00027659643,0.00019063933,0.00007441105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088761246,0.00048463096,0.00027441516,0.00036971597,0.000280137,0.00095260644,0.00091908115,0.0018626932,0.008888612],"category_scores_gemma":[0.0077565126,0.00019182212,0.00045956322,0.00027141147,0.00056311046,0.001076089,0.0007456065,0.0011559019,0.0009512175],"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.0013232692,0.00055183214,0.017784659,0.0010511888,0.00011163961,0.04328591,0.0020981033,0.034193818,0.031387474,0.012425476,0.021400873,0.83438575],"study_design_scores_gemma":[0.0003155011,0.0011372732,0.019689243,0.0007383145,0.00025447775,0.05895014,0.002510753,0.7106359,0.08689153,0.057526488,0.061184574,0.0001657609],"about_ca_topic_score_codex":0.0014991424,"about_ca_topic_score_gemma":0.0022174001,"teacher_disagreement_score":0.008888612,"about_ca_system_score_codex":0.00041951035,"about_ca_system_score_gemma":0.0003243672,"threshold_uncertainty_score":0.029735327},"labels":[],"label_agreement":null},{"id":"W4387640641","doi":"10.1007/978-3-031-45676-3_1","title":"GEMTrans: A General, Echocardiography-Based, Multi-level Transformer Framework for Cardiovascular Diagnosis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Echo (communications protocol); Computer vision","score_opus":0.049789994432823316,"score_gpt":0.3287241342791136,"score_spread":0.2789341398462903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387640641","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.001798963,0.00033650265,0.974008,0.000057871737,0.000050344996,0.00005446983,0.0006753299,0.021801688,0.0012168604],"genre_scores_gemma":[0.094560236,0.00079478463,0.8901163,0.0003640023,0.00007864241,0.00015905654,0.0037908864,0.0032889103,0.0068471576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997092,0.000037835944,0.00002266575,0.00007721264,0.000115156254,0.000037962338],"domain_scores_gemma":[0.9997644,0.00007862775,0.000019039206,0.00005026962,0.000056540677,0.000031173702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874705,0.001106185,0.00073465094,0.0007971674,0.00019736786,0.001352056,0.0019153393,0.0009903989,0.0075884084],"category_scores_gemma":[0.0010709276,0.0006176617,0.0015605541,0.0004446579,0.0002686823,0.0012475514,0.0015826968,0.0014579305,0.0040979087],"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.00084900274,0.0002034486,0.0026016238,0.0007998829,0.00029099704,0.0009034889,0.00016707175,0.07048368,0.048684593,0.023880849,0.05576729,0.7953681],"study_design_scores_gemma":[0.00015869844,0.00020308004,0.0015723086,0.0001394062,0.00019810064,0.0020968935,0.000059566428,0.825734,0.0509144,0.042838868,0.07598371,0.000100941455],"about_ca_topic_score_codex":0.0024315186,"about_ca_topic_score_gemma":0.0042191944,"teacher_disagreement_score":0.0075884084,"about_ca_system_score_codex":0.0003923727,"about_ca_system_score_gemma":0.00093486503,"threshold_uncertainty_score":0.025385797},"labels":[],"label_agreement":null},{"id":"W4387640692","doi":"10.1007/978-3-031-45673-2_32","title":"RelationalUNet for Image Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Canadian Institute for International Peace and Security; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Convolutional neural network; Image segmentation; Deep learning; Robustness (evolution); Pattern recognition (psychology); Medical imaging; Feature (linguistics); Computer vision","score_opus":0.023157825732713633,"score_gpt":0.27361904617680255,"score_spread":0.2504612204440889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387640692","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.0015365987,0.0015566053,0.9284406,0.00015556697,0.0002310997,0.000080647835,0.0025425297,0.05353398,0.0119224405],"genre_scores_gemma":[0.030385511,0.0016531607,0.9102537,0.00032401364,0.00018628554,0.0002167867,0.010202668,0.013502738,0.033275068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929035,0.000060910283,0.00005953051,0.00021242247,0.00030762728,0.00006913911],"domain_scores_gemma":[0.99946994,0.0001513624,0.00003150056,0.00022906647,0.00009376496,0.000024438415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581569,0.0015205026,0.0012854254,0.0019903982,0.00051754224,0.00268339,0.0026516116,0.0011969894,0.06998779],"category_scores_gemma":[0.0019740777,0.0010194222,0.0017450416,0.0024923638,0.00055076805,0.0026685821,0.002351372,0.0013846265,0.034670543],"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.0001924596,0.000042121977,0.0002107206,0.00055398216,0.00008805822,0.00020480088,0.00012703177,0.0057792948,0.017291473,0.040764093,0.112724565,0.8220214],"study_design_scores_gemma":[0.0000773783,0.0000981364,0.0007979844,0.00030807612,0.00012328738,0.0014703756,0.00012724816,0.2588642,0.07438536,0.19100322,0.47265068,0.00009403706],"about_ca_topic_score_codex":0.0021353057,"about_ca_topic_score_gemma":0.0038853306,"teacher_disagreement_score":0.06998779,"about_ca_system_score_codex":0.0007501674,"about_ca_system_score_gemma":0.00056834373,"threshold_uncertainty_score":0.23413247},"labels":[],"label_agreement":null},{"id":"W4387642557","doi":"10.1007/978-3-031-45673-2_25","title":"Leveraging Self-attention Mechanism in Vision Transformers for Unsupervised Segmentation of Optical Coherence Microscopy White Matter Images","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Ground truth; Deep learning; Unsupervised learning; Pattern recognition (psychology); Image segmentation; Computer vision","score_opus":0.00845448943267093,"score_gpt":0.27084899342438074,"score_spread":0.2623945039917098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387642557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020202901,0.00029475565,0.97454447,0.0001006415,0.000060861206,0.00004278883,0.00005464644,0.0022659092,0.0024331182],"genre_scores_gemma":[0.5780321,0.00052608276,0.4133001,0.00027113062,0.00010128382,0.000074612944,0.00029697892,0.000624804,0.0067729894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985516,0.000017188146,0.000008938412,0.000048605398,0.00004089816,0.000029183311],"domain_scores_gemma":[0.9997384,0.00009452864,0.000021728547,0.000047627273,0.000071334165,0.000026344956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030509286,0.00046456544,0.0004362512,0.00053311395,0.00030686005,0.0008126922,0.0010597586,0.0005821097,0.0043027163],"category_scores_gemma":[0.0007698705,0.00023478232,0.0005200568,0.0005157288,0.00039821403,0.0012250959,0.00082273595,0.00079866336,0.0012522294],"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.00027148658,0.00019185117,0.00043438823,0.00017780405,0.000053911106,0.00014975836,0.00010894696,0.023270272,0.45359573,0.022923166,0.004271163,0.4945516],"study_design_scores_gemma":[0.000014142715,0.00010168839,0.00078595075,0.000011897066,0.000033042237,0.00020863628,0.000025831034,0.796077,0.18299736,0.016120542,0.0036050787,0.000018884732],"about_ca_topic_score_codex":0.0021331515,"about_ca_topic_score_gemma":0.0028118226,"teacher_disagreement_score":0.0043027163,"about_ca_system_score_codex":0.0005390394,"about_ca_system_score_gemma":0.0004618673,"threshold_uncertainty_score":0.014393985},"labels":[],"label_agreement":null},{"id":"W4387648761","doi":"10.1007/978-3-031-45673-2_8","title":"An Investigation of Different Deep Learning Pipelines for GABA-Edited MRS Reconstruction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Computer science; Pipeline (software); Pipeline transport; In vivo; Artificial neural network; Artificial intelligence; Algorithm; Chemistry","score_opus":0.02975909350206839,"score_gpt":0.3033567153431628,"score_spread":0.2735976218410944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387648761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10650572,0.003282588,0.87116915,0.00085130415,0.00026365873,0.00017652154,0.000717529,0.003921246,0.013112239],"genre_scores_gemma":[0.4273647,0.0022567168,0.54988974,0.0002659378,0.00006019317,0.00009826869,0.0011928271,0.000822022,0.018049482],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998223,0.000032339027,0.000009355301,0.000040139053,0.000059146783,0.000036784135],"domain_scores_gemma":[0.9990707,0.00044289304,0.00004421357,0.00013843022,0.00026160813,0.00004219029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012566873,0.00085683377,0.0003850453,0.00045353814,0.00031670672,0.0014475356,0.0013465091,0.0010330392,0.005188773],"category_scores_gemma":[0.0031138714,0.0003748948,0.0006223877,0.00065095205,0.00030461125,0.0014008677,0.0006285156,0.0012479168,0.0013557173],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013065503,0.00031934836,0.0021926682,0.0006363414,0.00035522273,0.00028332495,0.00016900673,0.11278712,0.08282937,0.023625776,0.0070317173,0.76846355],"study_design_scores_gemma":[0.00004274396,0.00040229957,0.0014527792,0.00010751037,0.00015127119,0.00030562375,0.00006127982,0.88774484,0.095578246,0.006817938,0.0072935396,0.00004200285],"about_ca_topic_score_codex":0.004381026,"about_ca_topic_score_gemma":0.0064848154,"teacher_disagreement_score":0.005188773,"about_ca_system_score_codex":0.0006839767,"about_ca_system_score_gemma":0.0009305834,"threshold_uncertainty_score":0.017358124},"labels":[],"label_agreement":null},{"id":"W4387652966","doi":"10.1007/978-981-99-6492-5_35","title":"Design and Control of the Biped Robot HTY","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Modular design; Computer science; Robot; Scalability; Robot control; Simulation; Control (management); Control engineering; Robot kinematics; Degrees of freedom (physics and chemistry); Mobile robot; Artificial intelligence; Engineering; Operating system","score_opus":0.014662128867355743,"score_gpt":0.20111732102119806,"score_spread":0.18645519215384232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387652966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008458787,0.00076672144,0.9802288,0.00012077399,0.000105780164,0.00007454526,0.00006403788,0.00045614195,0.009724321],"genre_scores_gemma":[0.66019785,0.0016530715,0.3022623,0.00024244389,0.00015932531,0.00051278237,0.00023212301,0.00015138487,0.034588706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985874,0.000018548619,0.000005804709,0.000025859386,0.00007403855,0.00001699052],"domain_scores_gemma":[0.99994266,0.000010790154,0.000011099531,0.000007168337,0.000021141555,0.000007208152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019542074,0.00034881703,0.00040329967,0.00020934548,0.00026946963,0.0007135886,0.0006466025,0.00047634874,0.0036355858],"category_scores_gemma":[0.0002767694,0.0002668203,0.00025626138,0.00022798308,0.00036645817,0.00028977933,0.0006930927,0.00043027254,0.00085251837],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015651886,0.00005567105,0.00029655814,0.0005499978,0.00005734717,0.0002856964,0.00019073676,0.47651422,0.121012166,0.05367299,0.004982114,0.34222606],"study_design_scores_gemma":[0.000056758086,0.00043072362,0.00073914614,0.00006440495,0.000028312583,0.00019101892,0.00003158813,0.94788414,0.010786407,0.01464313,0.025119325,0.000025066556],"about_ca_topic_score_codex":0.0016104969,"about_ca_topic_score_gemma":0.0014699888,"teacher_disagreement_score":0.0036355858,"about_ca_system_score_codex":0.00023810747,"about_ca_system_score_gemma":0.00047972184,"threshold_uncertainty_score":0.012162268},"labels":[],"label_agreement":null},{"id":"W4387652982","doi":"10.1007/978-981-99-6492-5_23","title":"Omnidirectional Walking Realization of a Biped Robot","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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":"Dalhousie University","funders":"","keywords":"Computer science; Inverse kinematics; Omnidirectional antenna; Kinematics; Generator (circuit theory); Robot; Realization (probability); Gait; Modular design; Humanoid robot; Trajectory; Robot kinematics; Simulation; Mobile robot; Artificial intelligence; Physical medicine and rehabilitation; Mathematics","score_opus":0.013902016457680064,"score_gpt":0.2177926726845941,"score_spread":0.20389065622691405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387652982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08508115,0.0004305623,0.82004666,0.00018387423,0.00015971978,0.00006160384,0.00019135601,0.0013643902,0.09248083],"genre_scores_gemma":[0.73152506,0.00044947828,0.2373353,0.00007222932,0.0000324528,0.000053115575,0.00029618482,0.00008083432,0.030155325],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994767,0.0000053099693,0.000002849979,0.000011322436,0.000025680309,0.000007177156],"domain_scores_gemma":[0.9999715,0.000003879603,0.0000027168899,0.000006400362,0.000008928113,0.0000065330555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049957194,0.00025905893,0.00016614806,0.00013523898,0.00019203899,0.00033090648,0.00030739736,0.00025192526,0.00413115],"category_scores_gemma":[0.00006455058,0.00015380389,0.00018806315,0.00012183499,0.00015574234,0.0001712703,0.00029029118,0.0002953297,0.00092460884],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022536173,0.00010462288,0.00053102424,0.00034964844,0.000030317273,0.001191961,0.0003354879,0.023618957,0.59978205,0.12505847,0.004747608,0.24402441],"study_design_scores_gemma":[0.00020727149,0.0015224216,0.009459614,0.0001692421,0.00013235747,0.0057903407,0.000479651,0.51904064,0.21597382,0.06966352,0.177443,0.00011811984],"about_ca_topic_score_codex":0.0003969782,"about_ca_topic_score_gemma":0.00062987773,"teacher_disagreement_score":0.00413115,"about_ca_system_score_codex":0.0001021923,"about_ca_system_score_gemma":0.00015494808,"threshold_uncertainty_score":0.013820052},"labels":[],"label_agreement":null},{"id":"W4387652983","doi":"10.1007/978-981-99-6495-6_36","title":"Decision-Making in Robotic Grasping with Large Language Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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":"Dalhousie University","funders":"","keywords":"Computer science; Robot; Human–computer interaction; Focus (optics); Artificial intelligence; Perception; Action (physics); ENCODE; Task (project management); Systems engineering","score_opus":0.01886303579593853,"score_gpt":0.25105094258871025,"score_spread":0.2321879067927717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387652983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039514136,0.0011806042,0.94993466,0.0011780894,0.00009611338,0.00003696839,0.00011837852,0.00053301716,0.007408066],"genre_scores_gemma":[0.7587125,0.0011649954,0.22429705,0.00033535997,0.00018297796,0.00017919722,0.00033856014,0.0002634733,0.014525963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910104,0.00038294154,0.00006396105,0.0001818699,0.0001514685,0.00011870173],"domain_scores_gemma":[0.99312663,0.0061996486,0.0001707099,0.00024584288,0.00012821626,0.0001288785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019537618,0.00057497603,0.0014753888,0.00038092316,0.0007456814,0.0019727787,0.0016865444,0.0016280009,0.005069535],"category_scores_gemma":[0.007250412,0.0010060056,0.0011236079,0.00082467345,0.0018241337,0.004898788,0.0021646784,0.0028556553,0.0007620738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024260777,0.00012411962,0.0004913963,0.00021169892,0.000085444335,0.00018781652,0.00027497817,0.7247088,0.0026492642,0.16582105,0.0037592873,0.101443574],"study_design_scores_gemma":[0.000009252014,0.000014742648,0.000054279033,0.000007519869,0.0000061440205,0.000015065498,0.00002040513,0.86115205,0.00037227987,0.1380361,0.00030313182,0.000009005788],"about_ca_topic_score_codex":0.0044428674,"about_ca_topic_score_gemma":0.004219605,"teacher_disagreement_score":0.005069535,"about_ca_system_score_codex":0.001224957,"about_ca_system_score_gemma":0.0011371147,"threshold_uncertainty_score":0.01695925},"labels":[],"label_agreement":null},{"id":"W4387653007","doi":"10.1007/978-981-99-6492-5_31","title":"Whole Body Balance Control for Bipedal Robots Based on Virtual Model Control","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Computer science; Decoupling (probability); Inverted pendulum; Kinematics; Robot; Controller (irrigation); Feed forward; Torque; Control system; Control engineering; Simulation; Control (management); Artificial intelligence; Engineering; Nonlinear system","score_opus":0.011650951953526957,"score_gpt":0.2184523134469609,"score_spread":0.20680136149343395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387653007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03704749,0.00057784154,0.9467984,0.00009386116,0.0001866218,0.000054426488,0.00006349208,0.0010182002,0.014159576],"genre_scores_gemma":[0.9616907,0.00028021203,0.029083418,0.00005634723,0.000046129608,0.000111257905,0.000101100246,0.00008426017,0.008546539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999083,0.000012990237,0.0000045301117,0.000017984508,0.000041685907,0.0000143883335],"domain_scores_gemma":[0.99992955,0.0000140841885,0.000012191244,0.000010017825,0.000027043845,0.000007125318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016924414,0.0005524076,0.00061590347,0.000297603,0.00036754488,0.0006740511,0.0006399848,0.0003033963,0.002934921],"category_scores_gemma":[0.00025766276,0.00020181804,0.00027800657,0.00021122777,0.00033765833,0.00050386117,0.00071760186,0.00036222144,0.0004926318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005442722,0.00020585487,0.0003945153,0.0004433483,0.00010808662,0.00014778634,0.00019139353,0.471103,0.124519356,0.015258968,0.0054899687,0.38159344],"study_design_scores_gemma":[0.00005071191,0.00024677222,0.0008236813,0.00002195898,0.000025066869,0.00005120761,0.000023930563,0.98461306,0.004957181,0.006288762,0.0028820026,0.000015764159],"about_ca_topic_score_codex":0.0016098055,"about_ca_topic_score_gemma":0.0019801399,"teacher_disagreement_score":0.002934921,"about_ca_system_score_codex":0.00017375442,"about_ca_system_score_gemma":0.00019077462,"threshold_uncertainty_score":0.0098183155},"labels":[],"label_agreement":null},{"id":"W4387653008","doi":"10.1007/978-981-99-6492-5_26","title":"Nonsmooth Dynamic Modeling of a Humanoid Robot with Parallel Mechanisms","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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":"Dalhousie University","funders":"","keywords":"Computer science; Kinematics; Humanoid robot; Robot; Constraint (computer-aided design); Dynamic simulation; Robot kinematics; Aggregate (composite); Tree (set theory); Control theory (sociology); Topology (electrical circuits); Simulation; Mobile robot; Artificial intelligence; Control (management); Mathematics","score_opus":0.01206309993908471,"score_gpt":0.20734440004678592,"score_spread":0.1952813001077012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387653008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0641034,0.0007260227,0.91056585,0.00024950746,0.00009191938,0.00008277427,0.00015863805,0.00041403165,0.023607906],"genre_scores_gemma":[0.9108405,0.0009443808,0.0613708,0.00006658501,0.000046438458,0.00019435855,0.00017886974,0.000104643994,0.026253412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993026,0.000017886772,0.0000038076053,0.000013880489,0.000027639182,0.000006505065],"domain_scores_gemma":[0.9999143,0.000027308197,0.000023067676,0.000010258676,0.000017699964,0.0000073691886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015071651,0.0004938325,0.00046140503,0.00032350278,0.00031607147,0.0004824651,0.0007377684,0.0007879993,0.003183792],"category_scores_gemma":[0.00027212218,0.00041330507,0.0004981618,0.00027963665,0.00040839455,0.00054074737,0.00056940864,0.00035419516,0.0007676226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040805993,0.000014985124,0.00015273446,0.00007180242,0.000016442,0.00021061921,0.000060156108,0.9701,0.0066503985,0.009200281,0.000417074,0.013064713],"study_design_scores_gemma":[0.0000039836086,0.00004187676,0.00015623994,0.0000054485577,0.000004556571,0.0000495568,0.00001219053,0.9962882,0.0002989635,0.0021508627,0.0009839938,0.00000413055],"about_ca_topic_score_codex":0.004195579,"about_ca_topic_score_gemma":0.0029156737,"teacher_disagreement_score":0.004195579,"about_ca_system_score_codex":0.00019574727,"about_ca_system_score_gemma":0.00038624785,"threshold_uncertainty_score":0.010650814},"labels":[],"label_agreement":null},{"id":"W4387653012","doi":"10.1007/978-981-99-6495-6_44","title":"Lightweight Design and Property Analysis of Humanoid Robot Thigh Integrated Structure with Appearance","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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":"Dalhousie University","funders":"","keywords":"Fixture; Computer science; Humanoid robot; Robot; Stiffness; Simulation; Materials science; Mechanical engineering; Artificial intelligence; Composite material; Engineering","score_opus":0.011811921692686845,"score_gpt":0.19513555447165964,"score_spread":0.1833236327789728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387653012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09405767,0.0006264845,0.8914265,0.00009777004,0.0000383896,0.00006477939,0.00009037181,0.0005169081,0.013081206],"genre_scores_gemma":[0.89250004,0.00027170678,0.09479175,0.00003947371,0.000017031562,0.000083567196,0.0001295071,0.00012063643,0.012046273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999897,0.000013241446,0.0000034636457,0.000019900906,0.00005473634,0.000011734023],"domain_scores_gemma":[0.99986875,0.00002592125,0.000029278208,0.000024064679,0.00004495051,0.000007003608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018234226,0.00030375432,0.00028947723,0.00031262776,0.00020078561,0.00030707076,0.00058251846,0.00048162698,0.003014836],"category_scores_gemma":[0.000287209,0.00019714743,0.00049314176,0.00017907527,0.00024799095,0.00035068256,0.00028980116,0.00021186293,0.00059173116],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026662665,0.0001035244,0.001428512,0.00038046765,0.0000459573,0.00047726659,0.00014554727,0.34096977,0.4733717,0.02775752,0.0023670364,0.15268607],"study_design_scores_gemma":[0.000010692105,0.00038644098,0.0027544422,0.000025044908,0.000029147152,0.00037579314,0.00003988916,0.9621815,0.02556808,0.0037921455,0.0048194136,0.000017426133],"about_ca_topic_score_codex":0.00060786644,"about_ca_topic_score_gemma":0.0005882975,"teacher_disagreement_score":0.003014836,"about_ca_system_score_codex":0.0003174053,"about_ca_system_score_gemma":0.00026070295,"threshold_uncertainty_score":0.010085642},"labels":[],"label_agreement":null},{"id":"W4387656405","doi":"10.1007/978-981-99-6495-6_16","title":"Integrated Direct/Indirect Adaptive Robust Control for Electrical Driven Injection Machine Mold Closing with Accurate Parameter Estimations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Iterative Learning Control Systems","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":"Dalhousie University","funders":"","keywords":"Closing (real estate); Computer science; Control theory (sociology); Nonlinear system; Servomotor; Control engineering; Controller (irrigation); Adaptive control; Mold; Robust control; DC motor; Servo; Control (management); Artificial intelligence; Engineering","score_opus":0.02086677264808847,"score_gpt":0.2327710201689762,"score_spread":0.2119042475208877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387656405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018369114,0.00045643916,0.9739265,0.000056160483,0.000099326404,0.000029638104,0.000020226433,0.0006705412,0.0063720644],"genre_scores_gemma":[0.8510757,0.00027255437,0.13709967,0.000081496786,0.00008224171,0.000097338176,0.00006693241,0.000111593436,0.01111251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997913,0.000026085636,0.000010866326,0.000050015948,0.000103153376,0.0000186564],"domain_scores_gemma":[0.99981266,0.00006434745,0.00003679146,0.00003157857,0.00004840553,0.000006232342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003432789,0.0004602752,0.00045418387,0.0002026468,0.0002043533,0.0006419405,0.00080071855,0.00051500543,0.0024477118],"category_scores_gemma":[0.00046236068,0.00032388358,0.00035578664,0.00016599668,0.00033371436,0.0004660086,0.00076409464,0.0006273384,0.0004470213],"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.00045410029,0.00014853005,0.00044255683,0.00036585404,0.00007703624,0.00014066714,0.00015386609,0.28933847,0.19244127,0.0110973315,0.0022953898,0.5030449],"study_design_scores_gemma":[0.00001768592,0.0002443092,0.00049366185,0.000017058937,0.00001856575,0.0000622342,0.000008683768,0.9699894,0.024626192,0.0014567493,0.0030518165,0.000013664978],"about_ca_topic_score_codex":0.0006135824,"about_ca_topic_score_gemma":0.0012565851,"teacher_disagreement_score":0.0024477118,"about_ca_system_score_codex":0.00020073718,"about_ca_system_score_gemma":0.00025813485,"threshold_uncertainty_score":0.0081884265},"labels":[],"label_agreement":null},{"id":"W4387656440","doi":"10.1007/978-981-99-6492-5_30","title":"Fast Walking of Position-Controlled Biped Robot Based on Whole-Body Compliance Control","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Zero moment point; Control theory (sociology); Inverted pendulum; Controller (irrigation); Robot; Computer science; Trajectory; Gait; Simulation; Position (finance); Humanoid robot; Control (management); Artificial intelligence; Physical medicine and rehabilitation; Physics","score_opus":0.013550668186359777,"score_gpt":0.22518658916627338,"score_spread":0.2116359209799136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387656440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100562036,0.0005813555,0.8892085,0.00007599435,0.00011294007,0.000058740075,0.000052935862,0.0009683544,0.008379183],"genre_scores_gemma":[0.91927826,0.00026229085,0.07499746,0.000040816143,0.00003032394,0.000083719344,0.00012536554,0.000060733288,0.0051209372],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999918,0.000012539655,0.0000042351558,0.00001819307,0.00003764468,0.000009357],"domain_scores_gemma":[0.99992144,0.000019801302,0.00000954495,0.000014935677,0.00002539501,0.000008904665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013637441,0.00033426553,0.0004493146,0.00026870947,0.00024760372,0.00027413692,0.00036311155,0.0002886857,0.0017041147],"category_scores_gemma":[0.00018944066,0.00016693205,0.0002525036,0.00024031843,0.00017832928,0.00024027353,0.00031837117,0.00022387289,0.0002632634],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046981804,0.00016047561,0.0011333519,0.00050019595,0.00012215223,0.0005043003,0.00021619986,0.19365591,0.3893098,0.0151753705,0.00349768,0.39525485],"study_design_scores_gemma":[0.00003782553,0.00035662693,0.0024704814,0.000022763503,0.000031151016,0.00024602926,0.0000190495,0.9833062,0.008978635,0.0023708958,0.0021413814,0.000019013782],"about_ca_topic_score_codex":0.0008468243,"about_ca_topic_score_gemma":0.0009491267,"teacher_disagreement_score":0.0017041147,"about_ca_system_score_codex":0.00007787579,"about_ca_system_score_gemma":0.00016869763,"threshold_uncertainty_score":0.0057008862},"labels":[],"label_agreement":null},{"id":"W4387776497","doi":"10.1007/978-981-99-7356-9_15","title":"PiXi: Password Inspiration by Exploring Information","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Ontario Tech University","funders":"","keywords":"Password; Cognitive password; Password policy; Computer science; Password strength; Computer security; One-time password; S/KEY; Password cracking; Nudge theory; Internet privacy; Psychology","score_opus":0.04130093692702784,"score_gpt":0.2383833620012039,"score_spread":0.19708242507417606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387776497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007080223,0.0039186133,0.6149385,0.0027430893,0.0006347149,0.000094278636,0.0006036065,0.008387571,0.3615994],"genre_scores_gemma":[0.17758583,0.008051016,0.46492025,0.0010167626,0.00044891515,0.00026908758,0.002281847,0.0070842323,0.3383421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972385,0.00007731531,0.000010272385,0.000055421417,0.00010716124,0.000026012085],"domain_scores_gemma":[0.99959916,0.00017971912,0.0000139847625,0.00012050774,0.000047830556,0.000038930495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003930306,0.00082135573,0.00034420873,0.0007076683,0.000825427,0.0026847916,0.0011837803,0.0008324173,0.04051552],"category_scores_gemma":[0.0019519103,0.00049610354,0.0004438296,0.0010641422,0.0011849023,0.0070163584,0.003106249,0.0021826355,0.013928618],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006853514,0.000032282816,0.00026930185,0.00028871547,0.000010282883,0.00018029743,0.0016589332,0.001048562,0.0028548846,0.5314321,0.101650424,0.36050567],"study_design_scores_gemma":[0.000014737884,0.000033167835,0.00021235603,0.00025561996,0.000015296413,0.0009760461,0.00047655078,0.013471097,0.006003637,0.25009623,0.7284177,0.000027602402],"about_ca_topic_score_codex":0.00031733813,"about_ca_topic_score_gemma":0.0007091684,"teacher_disagreement_score":0.04051552,"about_ca_system_score_codex":0.0004925141,"about_ca_system_score_gemma":0.0004530708,"threshold_uncertainty_score":0.13553786},"labels":[],"label_agreement":null},{"id":"W4387788383","doi":"10.1007/978-981-99-7356-9","title":"Information and Communications Security","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Royal Holloway, University of London; University of Chinese Academy of Sciences; University of Science and Technology of China; Southeast University; National University of Defense Technology; University at Buffalo; Wuhan University; Peking University; University of Aizu; Beijing Institute of Technology; Univerza v Mariboru; National Tsing Hua University; Nankai University; Shanghai Jiao Tong University; Zhejiang University; Tsinghua University; Jinan University; Queen's University; Danmarks Tekniske Universitet; Norges Teknisk-Naturvitenskapelige Universitet; Sungkyunkwan University; University of Minnesota; Beijing University of Posts and Telecommunications; Advanced Digital Sciences Center; Technische Universiteit Delft; Hamad Bin Khalifa University; University of Wollongong; University of Surrey; University of Electronic Science and Technology of China; Fudan University; University of Warwick; Institut Polytechnique de Paris; Universität Passau; Fuzhou University; Chinese Academy of Sciences; Shandong University; University College Dublin; University of Central Florida; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Khalifa University of Science, Technology and Research; Iowa State University; Singapore Management University; Fujian Normal University; Università degli Studi di Milano; George Mason University","keywords":"Computer science; Information security; Computer security","score_opus":0.015348857413720883,"score_gpt":0.25832436146795684,"score_spread":0.24297550405423596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387788383","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010461343,0.030287623,0.012703291,0.002097823,0.0037426979,0.00008699236,0.00034165036,0.0004253826,0.9492684],"genre_scores_gemma":[0.008615901,0.018054293,0.004683638,0.0008085932,0.001327251,0.00007742255,0.00035622643,0.00012667332,0.96594995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997433,0.000029748646,0.0000063627426,0.000047655038,0.0001508538,0.000022160004],"domain_scores_gemma":[0.9997931,0.00004925597,0.000013557799,0.000052055988,0.000066588436,0.000025354293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011169,0.0012702462,0.00085453736,0.0013711499,0.0008372384,0.0021273184,0.0004751889,0.0011722053,0.08495374],"category_scores_gemma":[0.00058521493,0.00035500346,0.00031423056,0.0011764001,0.0009662368,0.0019368285,0.0010497345,0.0026678832,0.06449943],"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.00003780051,0.000053573192,0.000118149066,0.00024079617,0.000017863973,0.000094206276,0.00018208215,0.00057726225,0.00325475,0.1526496,0.52814305,0.3146308],"study_design_scores_gemma":[0.0000050663116,0.000037107682,0.00029069837,0.00016439594,0.0000067063656,0.00020090837,0.00003877771,0.00067525863,0.00063048594,0.029826213,0.96811765,0.0000066697294],"about_ca_topic_score_codex":0.00071725016,"about_ca_topic_score_gemma":0.0015108342,"teacher_disagreement_score":0.08495374,"about_ca_system_score_codex":0.000731979,"about_ca_system_score_gemma":0.00073279516,"threshold_uncertainty_score":0.28419858},"labels":[],"label_agreement":null},{"id":"W4387830588","doi":"10.1007/978-981-99-6483-3_13","title":"Vision-Based Categorical Object Pose Estimation and Manipulation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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":"Dalhousie University","funders":"","keywords":"Computer science; GRASP; Interpretability; Artificial intelligence; Object (grammar); Categorical variable; Robot; Task (project management); Pose; Service robot; Computer vision; Perception; Abstraction; Reliability (semiconductor); Human–computer interaction; Machine learning; Software engineering","score_opus":0.020780403927250068,"score_gpt":0.25218734848276997,"score_spread":0.2314069445555199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387830588","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.004201948,0.000953342,0.98973256,0.000071169954,0.000096447715,0.000033427383,0.00014771418,0.0019280147,0.0028353955],"genre_scores_gemma":[0.22226772,0.0021720445,0.75492454,0.0002061139,0.00016225438,0.00012183332,0.0017733247,0.00035305155,0.018019091],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944407,0.000045452125,0.000024447478,0.00017999359,0.00024367883,0.0000624602],"domain_scores_gemma":[0.99962616,0.00009058384,0.000029627783,0.0001100538,0.00012180497,0.000021675982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037769444,0.000602297,0.0013539619,0.0008653764,0.00035395214,0.0011462086,0.0024565847,0.0009466143,0.0077860267],"category_scores_gemma":[0.0010920506,0.0004897614,0.00075964734,0.001683772,0.0006491975,0.0014330135,0.001297264,0.0010121057,0.003416219],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011917917,0.000060808437,0.0002979958,0.00014258859,0.000027064636,0.000028950017,0.00002959288,0.028796328,0.0414685,0.00950859,0.006091298,0.91342914],"study_design_scores_gemma":[0.000009961452,0.000112872505,0.0016369665,0.000028720151,0.000023147028,0.0002237949,0.0000491041,0.9295893,0.0322561,0.023443302,0.012590265,0.000036502377],"about_ca_topic_score_codex":0.0053683934,"about_ca_topic_score_gemma":0.0069721434,"teacher_disagreement_score":0.0077860267,"about_ca_system_score_codex":0.00070424523,"about_ca_system_score_gemma":0.0007345536,"threshold_uncertainty_score":0.026046872},"labels":[],"label_agreement":null},{"id":"W4387842564","doi":"10.1007/978-3-031-43345-0","title":"Recent Trends in Algebraic Development Techniques","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitat Politècnica de Catalunya; Universidade do Minho; Université Paris-Saclay; Universitetet i Oslo; University of Oxford; Universidad Complutense de Madrid; Universidade de Aveiro; Swansea University; University of Ottawa","keywords":"Computer science; Algebraic number; Development (topology); Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.03700882443920046,"score_gpt":0.3105604988519152,"score_spread":0.2735516744127148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387842564","genre_codex":"review","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.0077001383,0.4378195,0.30915192,0.010952893,0.0029722485,0.00013292888,0.0002460848,0.0015857904,0.22943848],"genre_scores_gemma":[0.061551563,0.5298857,0.28052518,0.0022236744,0.0056419102,0.0002531424,0.00074120815,0.0008390135,0.11833862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978848,0.00047782302,0.00015743622,0.0002598389,0.0011409309,0.00007915991],"domain_scores_gemma":[0.99180835,0.005746447,0.00026738908,0.0006664819,0.001250068,0.00026114422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026999975,0.0006128676,0.0006573839,0.0040594935,0.0005284809,0.003173283,0.0015033917,0.0007465431,0.025239678],"category_scores_gemma":[0.0067701135,0.0006392725,0.00063655054,0.0058526373,0.0019737387,0.0064741573,0.0019021854,0.002515959,0.008602077],"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.00004172669,0.00006749272,0.0002768875,0.0020486102,0.000018928196,0.00005751192,0.0002415157,0.00091704045,0.001954491,0.29289454,0.026999164,0.6744821],"study_design_scores_gemma":[0.00002216173,0.00008251761,0.00045681268,0.00049098505,0.000023575743,0.00082808116,0.00013198303,0.003125843,0.0019262498,0.1253705,0.8675139,0.00002744114],"about_ca_topic_score_codex":0.0003578811,"about_ca_topic_score_gemma":0.0006284246,"teacher_disagreement_score":0.025239678,"about_ca_system_score_codex":0.001081536,"about_ca_system_score_gemma":0.0011995467,"threshold_uncertainty_score":0.084435105},"labels":[],"label_agreement":null},{"id":"W4387844104","doi":"10.1007/978-3-031-45329-8_4","title":"On the Containment Problem for Deterministic Multicounter Machine Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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 Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Decidability; Computer science; Bounded function; Finite-state machine; Reachability; Petri net; Reachability problem; Turing machine; Deterministic algorithm; Containment (computer programming); Theoretical computer science; Algorithm; Computation; Mathematics; Programming language","score_opus":0.04122514988229355,"score_gpt":0.26579518513181166,"score_spread":0.2245700352495181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387844104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03173239,0.0026640224,0.9000188,0.0030407847,0.0003187566,0.00008647284,0.00022344015,0.00045095666,0.0614643],"genre_scores_gemma":[0.6593364,0.0036382244,0.2921251,0.0013234576,0.001152363,0.00046434425,0.0015635284,0.00073468155,0.039662004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683076,0.0011868217,0.00017232625,0.0006164185,0.0008456688,0.00034801266],"domain_scores_gemma":[0.9842939,0.013716729,0.00041885593,0.00090625254,0.0004658868,0.00019831862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029476283,0.0011094259,0.0016921037,0.0011766774,0.0018458861,0.0031514228,0.0032631552,0.002892018,0.008746844],"category_scores_gemma":[0.013219929,0.0013426617,0.002420862,0.0020222785,0.0035505046,0.012373664,0.004199906,0.0068103177,0.00087139016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053861848,0.0000470924,0.00018079636,0.00018865059,0.00002213914,0.00017238174,0.00032145024,0.034203354,0.00081389525,0.9374112,0.0036569077,0.02292834],"study_design_scores_gemma":[0.000009487448,0.00001160261,0.00007199627,0.000038171605,0.000012636624,0.00007538312,0.000056982644,0.070424095,0.0006523467,0.9248739,0.0037616633,0.000011743265],"about_ca_topic_score_codex":0.002994988,"about_ca_topic_score_gemma":0.002515417,"teacher_disagreement_score":0.008746844,"about_ca_system_score_codex":0.0026384036,"about_ca_system_score_gemma":0.0014169397,"threshold_uncertainty_score":0.029261053},"labels":[],"label_agreement":null},{"id":"W4387850546","doi":"10.1007/978-981-99-7254-8_37","title":"Federated Learning Performance on Early ICU Mortality Prediction with Extreme Data Distributions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.07017280620014966,"score_gpt":0.2938508283941687,"score_spread":0.22367802219401905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387850546","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.8501623,0.0020704432,0.13605466,0.0011548689,0.000604673,0.00007523771,0.0016656047,0.0046638744,0.0035482899],"genre_scores_gemma":[0.9725978,0.00022696666,0.022645447,0.00013228701,0.0000983777,0.000038035923,0.0021277233,0.00006740855,0.0020659894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987607,0.000482479,0.00010035745,0.00027657306,0.00019234656,0.00018744414],"domain_scores_gemma":[0.9927827,0.004806949,0.0002286748,0.0007471056,0.0010946227,0.0003399854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005446035,0.0010415715,0.0012896556,0.00097483065,0.0004574853,0.0010534187,0.001210777,0.0016317997,0.0017771848],"category_scores_gemma":[0.009973046,0.0002203564,0.0007447578,0.00070183753,0.0004893431,0.0013799709,0.0013263386,0.0016772912,0.0008397627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053346464,0.0010830562,0.026096446,0.00014112849,0.00024468984,0.00024800614,0.000082879604,0.63241243,0.0024410798,0.0013496288,0.010650658,0.31991538],"study_design_scores_gemma":[0.000029157713,0.00016460831,0.0021635217,0.000011305074,0.000022331531,0.00003804094,0.000022752749,0.99441755,0.0017694597,0.0011675828,0.00018268693,0.000010952009],"about_ca_topic_score_codex":0.004527785,"about_ca_topic_score_gemma":0.00178549,"teacher_disagreement_score":0.005446035,"about_ca_system_score_codex":0.0007744742,"about_ca_system_score_gemma":0.0012682158,"threshold_uncertainty_score":0.02880174},"labels":[],"label_agreement":null},{"id":"W4387850646","doi":"10.1007/978-3-031-43033-6_25","title":"Blind Auditing and Probabilistic Access Controls","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Audit; Computer science; Information security audit; Audit trail; Identifier; Overhead (engineering); Probabilistic logic; Access control; Control (management); Computer security; Accounting; Information security; Artificial intelligence; Computer network; Security service; Business","score_opus":0.042907615645600534,"score_gpt":0.29321715575314133,"score_spread":0.2503095401075408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387850646","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.012075819,0.0020815267,0.9445097,0.0016562563,0.00041326263,0.00010280742,0.00012795103,0.0009914486,0.038041364],"genre_scores_gemma":[0.7628655,0.0034456071,0.16557668,0.00056864176,0.00068872125,0.00026424142,0.00020645901,0.00037839432,0.066005684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922316,0.0024898006,0.00049517595,0.0010023657,0.0030407833,0.00074019225],"domain_scores_gemma":[0.97599864,0.012159925,0.0014089114,0.008621202,0.0014829942,0.0003284258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050175656,0.00095074176,0.0011555798,0.001457419,0.001289017,0.004802744,0.0021286812,0.0017613366,0.008649009],"category_scores_gemma":[0.028670311,0.0008653702,0.0011391606,0.002252742,0.005645805,0.011531845,0.0037767156,0.0055232923,0.0014484809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012814894,0.000038099224,0.00027633723,0.00009714763,0.000020015132,0.000057543857,0.00012955607,0.016760673,0.00095562,0.90012336,0.0037488507,0.07766466],"study_design_scores_gemma":[0.000014735418,0.00002039236,0.00012698756,0.000046275407,0.000015042263,0.00014612528,0.000023147933,0.05695428,0.0016887129,0.933825,0.0071168556,0.000022397351],"about_ca_topic_score_codex":0.0012054954,"about_ca_topic_score_gemma":0.0006357821,"teacher_disagreement_score":0.008649009,"about_ca_system_score_codex":0.0021269135,"about_ca_system_score_gemma":0.0022528342,"threshold_uncertainty_score":0.028933883},"labels":[],"label_agreement":null},{"id":"W4387917757","doi":"10.1007/978-3-031-44505-7_21","title":"Repositioning Fleet Vehicles: A Learning Pipeline","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","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":"Polytechnique Montréal","funders":"","keywords":"TRIPS architecture; Fleet management; Computer science; Pipeline (software); Adaptability; Operations research; Process (computing); Operator (biology); Transport engineering; Engineering; Telecommunications","score_opus":0.015106268247248084,"score_gpt":0.23312413632032833,"score_spread":0.21801786807308024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387917757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03303683,0.00094355893,0.8403157,0.0010877006,0.00013769869,0.0003625928,0.0005899311,0.00695612,0.116569854],"genre_scores_gemma":[0.18118902,0.0022215163,0.70907074,0.00018367107,0.0000930324,0.00017877892,0.002227466,0.0010168477,0.10381897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996729,0.000055164328,0.000013111164,0.00010645237,0.00011233128,0.000040019426],"domain_scores_gemma":[0.99931777,0.00027196074,0.00003587792,0.00016674786,0.00013523705,0.000072457355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978914,0.001134383,0.0005607861,0.00080728665,0.00062319526,0.0020972507,0.0025222339,0.0013273066,0.04509058],"category_scores_gemma":[0.002147595,0.0005508465,0.0007458865,0.00091494835,0.0005499049,0.0038565139,0.0025967157,0.0014201088,0.0094586145],"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.00013105395,0.0002623476,0.0011048849,0.00019674504,0.000023227209,0.00012440736,0.0003829324,0.09550874,0.005139325,0.036711037,0.017699504,0.84271586],"study_design_scores_gemma":[0.000047815553,0.0005204091,0.0017168219,0.000283128,0.00003737245,0.0004863118,0.000947998,0.56464756,0.01876546,0.18643801,0.22603391,0.00007525937],"about_ca_topic_score_codex":0.004069678,"about_ca_topic_score_gemma":0.0076564783,"teacher_disagreement_score":0.04509058,"about_ca_system_score_codex":0.0010663363,"about_ca_system_score_gemma":0.0013879674,"threshold_uncertainty_score":0.15084302},"labels":[],"label_agreement":null},{"id":"W4387917828","doi":"10.1007/978-3-031-44505-7","title":"Learning and Intelligent Optimization","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ioannina; Università degli Studi di Ferrara; Consejo Superior de Investigaciones Científicas; Università di Bologna; Università degli Studi di Cagliari; Centre National de la Recherche Scientifique; Universite Angers; Sapienza Università di Roma; Khalifa University of Science, Technology and Research; Brown University; Università degli Studi di Trento; Universität Bielefeld; Università degli Studi di Milano-Bicocca; Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Universitat Pompeu Fabra; University of Crete; University of Toronto; Indian Council of Agricultural Research; Wilfrid Laurier University; Università degli Studi di Milano; Université de Lorraine; University of Pittsburgh; Università degli Studi di Udine; Università della Calabria; Università degli Studi di Camerino; KU Leuven; Technische Universiteit Eindhoven; Université de Lille; University of Patras; University of Southern California","keywords":"Computer science; Artificial intelligence; Optimization problem; Mathematical optimization; Algorithm; Mathematics","score_opus":0.023102495083191107,"score_gpt":0.2945752562375587,"score_spread":0.2714727611543676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387917828","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045605707,0.0711614,0.4725364,0.004981981,0.002159645,0.000060816972,0.00026417838,0.00078783854,0.4434871],"genre_scores_gemma":[0.15725176,0.053380482,0.17107037,0.0018147408,0.0031863512,0.00030245289,0.00068239064,0.0008348929,0.61147654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979633,0.000050495953,0.000008013123,0.00003502439,0.00009629894,0.0000138424375],"domain_scores_gemma":[0.9997626,0.00013605082,0.000013859248,0.00004689476,0.000029810906,0.000010876931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031891704,0.00092227553,0.0011191842,0.000605055,0.00032972716,0.0013703221,0.00056472287,0.000685971,0.016731339],"category_scores_gemma":[0.00106021,0.00034471316,0.00048292798,0.00107972,0.0011615526,0.0017478832,0.00093787786,0.001694588,0.0054914667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002624735,0.0000519824,0.00018009776,0.00037758483,0.000058259284,0.000039733928,0.000102841455,0.041630402,0.0010388768,0.457539,0.09826066,0.4006943],"study_design_scores_gemma":[0.000011464082,0.00003759376,0.00037196427,0.00015710056,0.000021398942,0.000101674836,0.00003703984,0.060898717,0.0009618489,0.7092872,0.22809829,0.000015754698],"about_ca_topic_score_codex":0.0006258553,"about_ca_topic_score_gemma":0.0008829575,"teacher_disagreement_score":0.016731339,"about_ca_system_score_codex":0.0006237232,"about_ca_system_score_gemma":0.00036743857,"threshold_uncertainty_score":0.05597192},"labels":[],"label_agreement":null},{"id":"W4387918059","doi":"10.1007/978-3-031-44505-7_37","title":"Learn, Compare, Search: One Sawmill’s Search for the Best Cutting Patterns Across and/or Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"FPInnovations; Université Laval","funders":"","keywords":"Computer science; Monte Carlo tree search; Process (computing); Metric (unit); Tree (set theory); Set (abstract data type); Depth-first search; Computation; Search algorithm; Search tree; Monte Carlo method; Breadth-first search; Algorithm; Mathematics; Statistics; Engineering; Combinatorics; Operations management","score_opus":0.15892187178744166,"score_gpt":0.3648855646293663,"score_spread":0.20596369284192462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387918059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043767758,0.0042354297,0.8752887,0.0073382305,0.0007093226,0.00015384825,0.00079382234,0.0052685793,0.06244428],"genre_scores_gemma":[0.16597728,0.0013667735,0.7912766,0.0012848077,0.0002473648,0.0001366752,0.0010687949,0.0014457491,0.037195895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952173,0.00011929826,0.000031239397,0.00018015201,0.000100252386,0.00004744081],"domain_scores_gemma":[0.9988952,0.00072182727,0.000043599804,0.00017493326,0.0000874952,0.0000769394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009536967,0.0012484607,0.0012030756,0.0010184359,0.0013321679,0.0026631157,0.0030660422,0.0021383893,0.031520523],"category_scores_gemma":[0.0056552114,0.00088646053,0.0012335341,0.0017428899,0.0020827616,0.00802738,0.0022912975,0.0026539112,0.0054876423],"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.00047453176,0.00021869499,0.0021569193,0.00050963165,0.00021529067,0.00021213693,0.0009505994,0.02851329,0.0038157182,0.14531173,0.10472555,0.71289593],"study_design_scores_gemma":[0.00021713783,0.00027475823,0.0008915081,0.0002122654,0.00017878535,0.0006422774,0.0010315528,0.29644412,0.004836822,0.61757064,0.077605255,0.000094895244],"about_ca_topic_score_codex":0.002828628,"about_ca_topic_score_gemma":0.0055115656,"teacher_disagreement_score":0.031520523,"about_ca_system_score_codex":0.0007690456,"about_ca_system_score_gemma":0.0011858993,"threshold_uncertainty_score":0.10544664},"labels":[],"label_agreement":null},{"id":"W4387918169","doi":"10.1007/978-3-031-44505-7_34","title":"Multi-task Predict-then-Optimize","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Task (project management); Machine learning; Set (abstract data type); Artificial intelligence; Variety (cybernetics); Shortest path problem; Routing (electronic design automation); Data mining; Theoretical computer science","score_opus":0.02840036120188826,"score_gpt":0.2640486945455982,"score_spread":0.23564833334370994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387918169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039040945,0.002187569,0.8256571,0.0027316865,0.0016114161,0.0009301694,0.005087671,0.097559005,0.025194436],"genre_scores_gemma":[0.22744179,0.00049689563,0.6947211,0.0018006078,0.000626542,0.0007891094,0.011627971,0.0071123517,0.055383682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998895,0.00015702342,0.000049882357,0.00044350594,0.00017206828,0.0002825166],"domain_scores_gemma":[0.9986142,0.0006223412,0.000056388606,0.00034978526,0.00024080038,0.000116358984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013618221,0.0042679342,0.0022356426,0.0012066397,0.0011420426,0.0017659251,0.0032053872,0.002818856,0.04271848],"category_scores_gemma":[0.0030924543,0.0015036794,0.0022602763,0.0012169454,0.000664226,0.002416629,0.0021048037,0.003035922,0.018462326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014081663,0.00078716566,0.001815991,0.00040718264,0.00033266796,0.00021572266,0.00006671588,0.107602514,0.006806918,0.005076968,0.14569925,0.72978085],"study_design_scores_gemma":[0.00023337324,0.00018952946,0.000626768,0.000024096518,0.000093481365,0.00010338201,0.000060164275,0.97230756,0.0055640712,0.009305788,0.011461357,0.000030348925],"about_ca_topic_score_codex":0.016005022,"about_ca_topic_score_gemma":0.04607844,"teacher_disagreement_score":0.04271848,"about_ca_system_score_codex":0.0013591057,"about_ca_system_score_gemma":0.004038003,"threshold_uncertainty_score":0.1429075},"labels":[],"label_agreement":null},{"id":"W4387918213","doi":"10.1007/978-3-031-44505-7_8","title":"Explaining the Behavior of Reinforcement Learning Agents Using Association Rules","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Association rule learning; Lift (data mining); Artificial intelligence; Learning classifier system; Process (computing); Machine learning; Association (psychology); Reinforcement","score_opus":0.061392412825267466,"score_gpt":0.3017173438229634,"score_spread":0.24032493099769592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387918213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049675677,0.0005917323,0.93453765,0.0010244041,0.000115874725,0.000055178585,0.00011650821,0.00090577226,0.012977256],"genre_scores_gemma":[0.7351566,0.0009584742,0.2524867,0.00014181556,0.00006592822,0.00012056743,0.0002142679,0.00015363927,0.01070203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998079,0.00008727691,0.000013412816,0.000030101288,0.000038375867,0.000022929004],"domain_scores_gemma":[0.99886835,0.0008967901,0.000069749185,0.000076539436,0.000059199207,0.000029412551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046505698,0.00056825136,0.00040889825,0.00032508853,0.0002810101,0.00087859813,0.0011027965,0.0009780113,0.0046243356],"category_scores_gemma":[0.0023153091,0.00038427266,0.00074895134,0.00038055275,0.0006253672,0.001088514,0.0006066317,0.0012607661,0.0005822934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044009346,0.000050971663,0.001131794,0.00007490699,0.000054995686,0.0002103268,0.00016091198,0.823567,0.0017907433,0.14045525,0.0014966774,0.030962415],"study_design_scores_gemma":[0.000012224347,0.000009631002,0.00012101965,0.000010245726,0.000010405107,0.00002614073,0.000010957384,0.93957835,0.0004533909,0.05858464,0.0011768289,0.0000061832693],"about_ca_topic_score_codex":0.0052072927,"about_ca_topic_score_gemma":0.004524373,"teacher_disagreement_score":0.0052072927,"about_ca_system_score_codex":0.0004534424,"about_ca_system_score_gemma":0.00051811256,"threshold_uncertainty_score":0.015469968},"labels":[],"label_agreement":null},{"id":"W4387938583","doi":"10.1007/978-3-031-47076-9_9","title":"Enhancing Clinical Support for Breast Cancer with Deep Learning Models Using Synthetic Correlated Diffusion Imaging","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Niagara Health System; University of Waterloo","funders":"","keywords":"Breast cancer; Deep learning; Leverage (statistics); Artificial intelligence; Convolutional neural network; Computer science; Modality (human–computer interaction); Magnetic resonance imaging; Machine learning; Modalities; Medical physics; Medicine; Cancer; Radiology; Internal medicine","score_opus":0.023853654937925677,"score_gpt":0.3151720809462578,"score_spread":0.29131842600833213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387938583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07663037,0.0030401414,0.9075538,0.0025034065,0.00020806407,0.0000645013,0.0005271826,0.0021884707,0.007284009],"genre_scores_gemma":[0.7771068,0.0023987931,0.21106435,0.00065282895,0.0001908317,0.000060075523,0.0008036499,0.00032900987,0.0073936274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999386,0.000015410566,0.0000032397015,0.00001150058,0.00002292472,0.000008397947],"domain_scores_gemma":[0.9996207,0.0002257568,0.00002715829,0.000029093111,0.00006985241,0.000027406193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494103,0.0004478827,0.0002774177,0.00029671285,0.00010830156,0.00064630585,0.00046995765,0.0006607714,0.0023341142],"category_scores_gemma":[0.001985643,0.00023903257,0.0003838873,0.00020369519,0.00015200056,0.0005171093,0.00053850835,0.0007247415,0.00062883017],"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.00037528228,0.00015961289,0.0030978527,0.00023704674,0.000084709725,0.000499699,0.00010198336,0.3083814,0.044850048,0.0049389335,0.016542394,0.620731],"study_design_scores_gemma":[0.000012095648,0.0000579921,0.0003969479,0.000022735474,0.000021286585,0.00025448602,0.000017161112,0.9841055,0.008775951,0.0035645724,0.002760575,0.000010720884],"about_ca_topic_score_codex":0.0017081952,"about_ca_topic_score_gemma":0.0033982317,"teacher_disagreement_score":0.0023341142,"about_ca_system_score_codex":0.00025475735,"about_ca_system_score_gemma":0.00040693875,"threshold_uncertainty_score":0.0078083873},"labels":[],"label_agreement":null},{"id":"W4387999418","doi":"10.1007/978-3-031-47262-6","title":"Conceptual Modeling","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Instituto Superior Técnico; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Technische Universität Clausthal; Högskolan i Skövde; Universitat Politècnica de Catalunya; Alpen-Adria-Universität Klagenfurt; Universidade Federal do Espírito Santo; Universidade Federal de Minas Gerais; Università degli Studi di Brescia; Universität Duisburg-Essen; Université de Fribourg; King Mongkut's Institute of Technology Ladkrabang; Anglia Ruskin University; Victoria University; Rīgas Tehniskā Universitāte; Vrije Universiteit Amsterdam; Université de Genève; Università di Bologna; University of Haifa; Universitat Politècnica de València; Ben-Gurion University of the Negev; Universidade Federal do Rio Grande do Sul; Universidad Autónoma de Madrid; Technische Universität Braunschweig; King Abdullah University of Science and Technology; Memorial University of Newfoundland; University of Toronto; Libera Università di Bolzano; Beijing University of Technology; LOEWE Zentrum AdRIA; Technische Universiteit Eindhoven; Aston University; University of Twente; Nanzan University; Pontifícia Universidade Católica do Rio de Janeiro; Victoria University of Wellington; Stockholms Universitet; Chalmers Tekniska Högskola; Universidade Nova de Lisboa; Kungliga Tekniska Högskolan; Christian-Albrechts-Universität zu Kiel; Universiteit Utrecht; Technische Universität Wien; Sapienza Università di Roma; Universidad de Alicante; University of South Australia; University of Technology Sydney; Universiteit Gent; Université de Sfax; International Science and Technology Center; University of Miami; University of Texas at Arlington; Institució Catalana de Recerca i Estudis Avançats; Universidade Federal do Rio de Janeiro; University of Ottawa; RWTH Aachen University; Conservatoire National des Arts et Métiers; University of Essex; Tata Consultancy Services","keywords":"Computer science; Focus (optics); Conceptual model; Management science; Data science; Software engineering; Database; Engineering","score_opus":0.03999401625708956,"score_gpt":0.27027731867173105,"score_spread":0.23028330241464148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387999418","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.002092232,0.0025693132,0.7114832,0.0029040384,0.00052621163,0.00028739235,0.0029046203,0.0036465174,0.27358654],"genre_scores_gemma":[0.096431226,0.0073519987,0.5665149,0.001423922,0.0003988814,0.0006850444,0.022294234,0.0019714825,0.3029284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985493,0.00036088444,0.00013231781,0.00034604175,0.00053290604,0.00007852567],"domain_scores_gemma":[0.99887675,0.00030404993,0.00003850329,0.00044131384,0.00028993643,0.000049491755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014194491,0.0011219318,0.0006649671,0.0023203702,0.0012955299,0.0064247656,0.0021796199,0.0012126802,0.04825618],"category_scores_gemma":[0.003964348,0.0006985116,0.0015254841,0.003033637,0.0011168747,0.0074668885,0.0023289088,0.0020074656,0.02282611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012302754,0.00003157441,0.000112894544,0.00013191889,0.000016342316,0.000055918466,0.00030199715,0.0015848067,0.0005092078,0.8627255,0.03035717,0.10416031],"study_design_scores_gemma":[0.0000080194095,0.000008671463,0.00009832715,0.0001252583,0.000025644422,0.00015119903,0.00017770378,0.009297929,0.0010583027,0.37972853,0.6093081,0.000012273061],"about_ca_topic_score_codex":0.005897685,"about_ca_topic_score_gemma":0.0047943657,"teacher_disagreement_score":0.04825618,"about_ca_system_score_codex":0.0019772376,"about_ca_system_score_gemma":0.002350854,"threshold_uncertainty_score":0.16143304},"labels":[],"label_agreement":null},{"id":"W4388016997","doi":"10.1007/978-3-031-47658-7_3","title":"The Ethical Colonizer? Grand Strategy Games, Colonization, and New Ways of Engaging Moral Choices","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","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":"Concordia University","funders":"","keywords":"Narrative; Construct (python library); Interpretation (philosophy); Perspective (graphical); Politics; Geopolitics; Computer science; Game design; Political science; Law; Artificial intelligence","score_opus":0.05734406371903754,"score_gpt":0.2972169121667394,"score_spread":0.23987284844770185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388016997","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.05800029,0.0022160802,0.052895766,0.040301003,0.0007903516,0.00004571158,0.000019734769,0.00009805753,0.84563303],"genre_scores_gemma":[0.94016814,0.00050691055,0.007957267,0.0017156709,0.000108836124,0.00007819066,0.000013778114,0.00009267685,0.049358636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958411,0.003290286,0.000033519795,0.00021682693,0.0002741279,0.00034414633],"domain_scores_gemma":[0.9965491,0.0021579915,0.00019713593,0.000351583,0.00020644386,0.0005377229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043677664,0.00070766895,0.00046053037,0.0005228671,0.0051520974,0.009881781,0.0012395378,0.003460193,0.008685801],"category_scores_gemma":[0.007923959,0.0003001564,0.0003911923,0.0005435473,0.02796285,0.010750538,0.005088713,0.00665193,0.00094807823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009198479,0.000013204039,0.00006690674,0.00001005556,0.0000021673402,0.00002782807,0.0072330404,0.00014688472,0.00008100952,0.9859401,0.0025590353,0.003910676],"study_design_scores_gemma":[0.000009852818,0.000013880067,0.00008479477,0.000059918017,0.0000031274574,0.00005171382,0.009243478,0.0008972129,0.00015408036,0.94159704,0.047875423,0.00000940149],"about_ca_topic_score_codex":0.0016739953,"about_ca_topic_score_gemma":0.003683633,"teacher_disagreement_score":0.009881781,"about_ca_system_score_codex":0.0024022486,"about_ca_system_score_gemma":0.0024680758,"threshold_uncertainty_score":0.029056907},"labels":[],"label_agreement":null},{"id":"W4388019285","doi":"10.1007/978-981-99-7563-1_3","title":"Traceable Policy-Based Signatures with Delegation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"Computer science; Public-key cryptography; Digital signature; Merkle signature scheme; Scheme (mathematics); Computer security; Delegation; Ring signature; Signature (topology); Blind signature; Traceability; Theoretical computer science; Key (lock); Hash function; Encryption; Mathematics; Law; Political science","score_opus":0.013656848037047335,"score_gpt":0.23817411134878097,"score_spread":0.22451726331173363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388019285","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.0038733727,0.00015510386,0.98147625,0.00025428628,0.0002127766,0.00013527084,0.00012742153,0.0049174274,0.008848036],"genre_scores_gemma":[0.40838555,0.0005340038,0.5468786,0.00050218287,0.0002993318,0.0005202914,0.0008769896,0.0018839583,0.040119134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99070615,0.0020430605,0.000854781,0.0014712097,0.0038867374,0.0010381019],"domain_scores_gemma":[0.9881272,0.0032565803,0.0004863933,0.0068720886,0.0009408478,0.00031693757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043181125,0.0012256784,0.0017750394,0.001242092,0.0014896876,0.0050454237,0.0035583375,0.0021391057,0.010228148],"category_scores_gemma":[0.011823685,0.001239273,0.0015764995,0.0020162016,0.0035730954,0.010244888,0.0077817696,0.0067224386,0.0056334264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000774349,0.00042378777,0.0003496161,0.00032254713,0.00009600443,0.00022102012,0.0004839252,0.038262337,0.010555569,0.64115006,0.012173083,0.29518765],"study_design_scores_gemma":[0.00013466137,0.00018219091,0.000100612975,0.00008504195,0.00007085302,0.00033418316,0.00007604798,0.18672828,0.035683773,0.7428465,0.033674456,0.000083445775],"about_ca_topic_score_codex":0.00080186623,"about_ca_topic_score_gemma":0.000618187,"teacher_disagreement_score":0.010228148,"about_ca_system_score_codex":0.0018832136,"about_ca_system_score_gemma":0.0032452785,"threshold_uncertainty_score":0.034216583},"labels":[],"label_agreement":null},{"id":"W4388019309","doi":"10.1007/978-3-031-47655-6_4","title":"IDNs in Education: Skills for Future Generations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Storytelling and Education","field":"Health Professions","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":"Toronto Metropolitan University","funders":"","keywords":"Curriculum; Narrative; Computer science; Literacy; Mathematics education; Pedagogy; Multimedia; Psychology; Literature; Art","score_opus":0.04332445233405215,"score_gpt":0.3739494787042706,"score_spread":0.33062502637021846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388019309","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005004081,0.0134621,0.0054490264,0.055889685,0.0051216385,0.00003984677,0.00012818561,0.00019730239,0.91470814],"genre_scores_gemma":[0.058708917,0.009124196,0.00492684,0.009336588,0.0006607982,0.00005696564,0.00018040442,0.00011076819,0.9168945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999246,0.00022649969,0.000031965177,0.00008464426,0.00022017912,0.00019088016],"domain_scores_gemma":[0.99827766,0.00024841045,0.00005415917,0.00011391611,0.0003422599,0.00096361374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049684,0.00031199236,0.00028257802,0.0006464207,0.0030775343,0.006180612,0.0008765336,0.0015667239,0.06586876],"category_scores_gemma":[0.0029188348,0.00019798533,0.00021750294,0.000694022,0.0020003011,0.0068332264,0.0054412438,0.0032119604,0.013185135],"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.000019914485,0.000102147606,0.0012904801,0.0001773052,0.0000027006383,0.00012727486,0.010390688,0.00011285703,0.0003004491,0.3410467,0.3520996,0.2943299],"study_design_scores_gemma":[0.0000010755414,0.000005373964,0.00022231479,0.00013716612,9.0361914e-7,0.00007423043,0.0023162265,0.000027234302,0.000050780614,0.013649242,0.98351383,0.0000016116328],"about_ca_topic_score_codex":0.0044631055,"about_ca_topic_score_gemma":0.013664629,"teacher_disagreement_score":0.06586876,"about_ca_system_score_codex":0.003481879,"about_ca_system_score_gemma":0.006390703,"threshold_uncertainty_score":0.22035295},"labels":[],"label_agreement":null},{"id":"W4388019479","doi":"10.1007/978-3-031-47658-7_25","title":"A Design-Oriented Framework for Interactive Digital Narrative in Virtual Reality - Focus on Branching Narrative and Agency","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Narrative; Agency (philosophy); Computer science; Virtual reality; Branching (polymer chemistry); Focus (optics); Interactor; Human–computer interaction; Multimedia; Computer graphics (images); Sociology; Art","score_opus":0.03877663725106731,"score_gpt":0.31193812719773,"score_spread":0.2731614899466627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388019479","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.0018072408,0.00049543165,0.92054653,0.0010340386,0.000080227874,0.00018019229,0.00006903351,0.00043527654,0.07535207],"genre_scores_gemma":[0.14277835,0.0008462207,0.8119023,0.000299202,0.00006764451,0.0010338054,0.00021131642,0.0004325066,0.042428583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983223,0.0009770304,0.000091807444,0.00019246776,0.0002738612,0.00014261271],"domain_scores_gemma":[0.9990368,0.0004758475,0.00005715463,0.00015508127,0.00014490802,0.00013015176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002478781,0.0016502724,0.00056708214,0.0018032858,0.002936653,0.008953059,0.0028744447,0.002346462,0.013235264],"category_scores_gemma":[0.0020298006,0.0010365325,0.0013782898,0.0011736243,0.008761155,0.0061072796,0.0035765944,0.0029241866,0.002483552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035803253,0.0000112244325,0.000029077417,0.000047835467,0.0000029270432,0.000048980506,0.0012847979,0.001283045,0.00036659156,0.9884433,0.0008775911,0.0076009682],"study_design_scores_gemma":[0.000024880303,0.00003702674,0.00008790919,0.00018252351,0.000027403068,0.00036769386,0.0019547462,0.019541483,0.0016595405,0.7777132,0.19837579,0.000027881177],"about_ca_topic_score_codex":0.0053793555,"about_ca_topic_score_gemma":0.0053748926,"teacher_disagreement_score":0.013235264,"about_ca_system_score_codex":0.0034294068,"about_ca_system_score_gemma":0.0026800768,"threshold_uncertainty_score":0.044276416},"labels":[],"label_agreement":null},{"id":"W4388044333","doi":"10.1007/978-3-662-68191-6_5","title":"A Validated Learning Approach to Healthcare Process Analysis Through Contextual and Temporal Filtering","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Abstraction; Event (particle physics); Process (computing); Temporal logic; Data mining; Filter (signal processing); Linear temporal logic; Data science; Ontology; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.046714994756705555,"score_gpt":0.27611246446438664,"score_spread":0.2293974697076811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388044333","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.002589399,0.00004785512,0.9964149,0.00006951242,0.000008595299,0.000033578857,0.00006308688,0.00025618626,0.0005167828],"genre_scores_gemma":[0.15426938,0.00017622745,0.84305984,0.00012108308,0.000036125137,0.00022060973,0.00062777876,0.0001228089,0.0013661911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954288,0.0018148116,0.0004956822,0.00096785475,0.001060163,0.00023273315],"domain_scores_gemma":[0.9845154,0.010890957,0.0007939723,0.0014918278,0.0021072843,0.00020055093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069591575,0.00075477705,0.0010294267,0.0024764568,0.0008948667,0.0030923455,0.0022655483,0.0014795307,0.0037040382],"category_scores_gemma":[0.02112756,0.0006191986,0.0016771076,0.0019558894,0.0015511365,0.0033180853,0.0031054013,0.0019966005,0.0008619156],"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.0002901391,0.0004952496,0.007798744,0.0003296862,0.00029768483,0.00034720963,0.0008240136,0.35781467,0.00504329,0.17636688,0.002484745,0.4479077],"study_design_scores_gemma":[0.000015501664,0.00006169516,0.00052961014,0.000057446465,0.00003441393,0.000047826787,0.00007123914,0.94557273,0.001899551,0.049604136,0.0020908916,0.000014940941],"about_ca_topic_score_codex":0.007856428,"about_ca_topic_score_gemma":0.0069050775,"teacher_disagreement_score":0.007856428,"about_ca_system_score_codex":0.0019724201,"about_ca_system_score_gemma":0.0042673387,"threshold_uncertainty_score":0.03680396},"labels":[],"label_agreement":null},{"id":"W4388093787","doi":"10.1007/978-981-99-7563-1_8","title":"Exploiting Android Browser","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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 Saskatchewan","funders":"","keywords":"Computer science; Android (operating system); Android application; Operating system; World Wide Web","score_opus":0.02349917896511172,"score_gpt":0.25938479343707893,"score_spread":0.2358856144719672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388093787","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19908184,0.009525551,0.26237047,0.0017348587,0.0012743067,0.0004207176,0.0008673247,0.044239067,0.4804859],"genre_scores_gemma":[0.68652445,0.0031634544,0.059390757,0.000528155,0.00015550603,0.00008924306,0.0008403081,0.0025518509,0.24675629],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997274,0.000019992312,0.000009109284,0.00004274188,0.00014708807,0.000053687178],"domain_scores_gemma":[0.9997106,0.00007191853,0.000016368143,0.00011247049,0.00006285438,0.000025786829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016066081,0.0009019966,0.00031681304,0.0007051935,0.00044495647,0.0012435355,0.00068086607,0.0007272308,0.011018922],"category_scores_gemma":[0.00087911694,0.00040678456,0.0004192696,0.00027307,0.00028215133,0.0020108665,0.0013590752,0.0009389763,0.0059340727],"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.00035680502,0.00019163894,0.0033817464,0.0004121581,0.00006711127,0.0016018898,0.00081837754,0.0018322634,0.14437601,0.034875784,0.055986434,0.75609976],"study_design_scores_gemma":[0.00006581004,0.00047125522,0.009210329,0.0005080003,0.00043807342,0.013399324,0.000698279,0.122432634,0.28676888,0.033503525,0.532304,0.00019988361],"about_ca_topic_score_codex":0.0016405868,"about_ca_topic_score_gemma":0.003357692,"teacher_disagreement_score":0.011018922,"about_ca_system_score_codex":0.00031162612,"about_ca_system_score_gemma":0.00040070026,"threshold_uncertainty_score":0.036862016},"labels":[],"label_agreement":null},{"id":"W4388093981","doi":"10.1007/978-981-99-7563-1_21","title":"Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Windsor; University of Calgary","funders":"","keywords":"Cheating; Computer science; Secret sharing; Leakage (economics); Computer security; Information leakage; Theoretical computer science; Algorithm; Cryptography","score_opus":0.02254604923057493,"score_gpt":0.24370310518250954,"score_spread":0.2211570559519346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388093981","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.16492237,0.00719512,0.71279037,0.014864608,0.0012910257,0.0008738053,0.0034727992,0.0044488613,0.09014105],"genre_scores_gemma":[0.904552,0.003391741,0.07422748,0.0017704801,0.0015433525,0.00089108327,0.0012883528,0.0010940146,0.011241387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881279,0.002583041,0.0004006775,0.0019688755,0.004238579,0.00268089],"domain_scores_gemma":[0.8560066,0.119738095,0.0043401276,0.013277245,0.004304866,0.0023331142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010255695,0.004532918,0.0050603054,0.0029693365,0.0025960342,0.007809006,0.007933411,0.005248333,0.016391173],"category_scores_gemma":[0.06219262,0.0021209356,0.0031780303,0.0040168446,0.006415865,0.016813127,0.009897993,0.009677617,0.0023355237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055454387,0.00085145805,0.0027243786,0.001929169,0.0005970417,0.00076420535,0.0009465821,0.3926944,0.03824236,0.4059828,0.027529914,0.12219228],"study_design_scores_gemma":[0.0002034677,0.00037573813,0.0008196309,0.0002449458,0.00025093014,0.0005002227,0.0001341509,0.59301895,0.009667274,0.39172184,0.0029560935,0.00010678829],"about_ca_topic_score_codex":0.0010767084,"about_ca_topic_score_gemma":0.0012704259,"teacher_disagreement_score":0.016391173,"about_ca_system_score_codex":0.0077570193,"about_ca_system_score_gemma":0.0050523677,"threshold_uncertainty_score":0.056281388},"labels":[],"label_agreement":null},{"id":"W4388099570","doi":"10.1007/978-3-031-46914-5","title":"Shape in Medical Imaging","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"York University","keywords":"Computer science; Medical imaging; Artificial intelligence; Geometric modeling; Computer vision; Shape analysis (program analysis); Geometric analysis; Computer graphics (images); Geometry; Mathematics; Static analysis","score_opus":0.01524131705399677,"score_gpt":0.3024412454106108,"score_spread":0.287199928356614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388099570","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029609834,0.08398251,0.552145,0.0018660047,0.0054364484,0.00008611022,0.00066580594,0.003378305,0.3494789],"genre_scores_gemma":[0.026675047,0.05012826,0.15160972,0.00091011624,0.0022900095,0.00008684783,0.0010133617,0.0014752807,0.76581144],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982566,0.00001688073,0.000007104508,0.000029388844,0.0001121257,0.0000087806975],"domain_scores_gemma":[0.99970526,0.00009995916,0.000012251521,0.00006114432,0.00008743823,0.00003382047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022847792,0.00087640167,0.0009328613,0.0018089517,0.0003992036,0.0015062913,0.0008900894,0.00079071015,0.038600303],"category_scores_gemma":[0.0006648356,0.00058672344,0.00052826,0.0023579707,0.00073812355,0.0013866165,0.0010451518,0.0011284165,0.031757552],"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.000037885948,0.000025012587,0.000117564545,0.0004814835,0.000024795034,0.00011207361,0.000111650734,0.005337548,0.013353876,0.086654246,0.16186509,0.7318787],"study_design_scores_gemma":[0.000008374507,0.00005988516,0.00074478233,0.0002127686,0.000032990138,0.0016527681,0.00006960083,0.01928152,0.007924803,0.08601618,0.883959,0.000037486614],"about_ca_topic_score_codex":0.0005939317,"about_ca_topic_score_gemma":0.0012528157,"teacher_disagreement_score":0.038600303,"about_ca_system_score_codex":0.00038706558,"about_ca_system_score_gemma":0.0003167475,"threshold_uncertainty_score":0.12913084},"labels":[],"label_agreement":null},{"id":"W4388132066","doi":"10.1007/978-3-031-47240-4_28","title":"Neural Multi-hop Logical Query Answering with Concept-Level Answers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Axiom; Question answering; Description logic; Theoretical computer science; Inference; Fuzzy logic; Knowledge representation and reasoning; Set (abstract data type); Information retrieval; Artificial intelligence; Mathematics","score_opus":0.05907292893981171,"score_gpt":0.27097374612819314,"score_spread":0.21190081718838144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388132066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11749855,0.0021356572,0.86418414,0.0014970286,0.0003131799,0.0001725248,0.0012102365,0.0037001637,0.009288523],"genre_scores_gemma":[0.789465,0.0005968131,0.19519353,0.00048673828,0.00025910157,0.00016365317,0.003078238,0.00017546875,0.010581413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.00015103315,0.00006682468,0.00027814796,0.00015381811,0.00009215607],"domain_scores_gemma":[0.9978968,0.0014993923,0.00010151018,0.00021415522,0.0002217068,0.000066383895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010316239,0.00068100233,0.0011539789,0.0009073802,0.00066099025,0.0018563918,0.0026304228,0.0023092972,0.008640109],"category_scores_gemma":[0.005523282,0.0005790866,0.00080631295,0.0013959145,0.000771222,0.004495639,0.0022477617,0.001906298,0.0016599827],"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.0012024792,0.00069161854,0.002744945,0.0007019352,0.00020165881,0.0003373818,0.00042370302,0.23509152,0.017011415,0.042817518,0.021985274,0.6767906],"study_design_scores_gemma":[0.000025798377,0.00007096913,0.00024105248,0.000017765022,0.00003262726,0.00006921659,0.0000737495,0.9605037,0.0028148477,0.035009146,0.0011292199,0.000011949277],"about_ca_topic_score_codex":0.003656772,"about_ca_topic_score_gemma":0.005111937,"teacher_disagreement_score":0.008640109,"about_ca_system_score_codex":0.00095706416,"about_ca_system_score_gemma":0.0008571119,"threshold_uncertainty_score":0.02890402},"labels":[],"label_agreement":null},{"id":"W4388132093","doi":"10.1007/978-3-031-47240-4_26","title":"Assessing the Generalization Capabilities of Neural Machine Translation Models for SPARQL Query Generation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; SPARQL; Machine translation; Machine learning; Generalization; Training set; Natural language processing; Information retrieval; RDF; Semantic Web","score_opus":0.0573266660516145,"score_gpt":0.30834279112851026,"score_spread":0.25101612507689575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388132093","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.93836564,0.0028951983,0.048029356,0.0013314844,0.00018875086,0.00012343547,0.0013481249,0.0024130403,0.005304911],"genre_scores_gemma":[0.98122233,0.00045629696,0.014961559,0.0001383365,0.000066157874,0.000056137447,0.0020100565,0.00010926695,0.0009797089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99763155,0.0012888358,0.00020941754,0.0004359796,0.00030942322,0.00012472925],"domain_scores_gemma":[0.9663684,0.029139316,0.0007182751,0.002044989,0.0014608329,0.00026819992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075466656,0.000976923,0.0006809592,0.0010739968,0.0004399182,0.0012647297,0.0011360954,0.0018825729,0.0022863355],"category_scores_gemma":[0.032099787,0.00040477116,0.00073970546,0.001317018,0.000601189,0.0029691362,0.0010687103,0.0016284356,0.0007642585],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025371248,0.0007161058,0.015121796,0.00045995708,0.0005695599,0.00017242915,0.0003399924,0.68378204,0.0064523504,0.002967747,0.006454572,0.28042632],"study_design_scores_gemma":[0.000047329577,0.00024410986,0.0019809713,0.000017554432,0.00006436933,0.00003515485,0.00006791485,0.99253017,0.00247271,0.0022829073,0.00024120446,0.000015598665],"about_ca_topic_score_codex":0.014137924,"about_ca_topic_score_gemma":0.0106770685,"teacher_disagreement_score":0.014137924,"about_ca_system_score_codex":0.0013268668,"about_ca_system_score_gemma":0.0008729031,"threshold_uncertainty_score":0.03991103},"labels":[],"label_agreement":null},{"id":"W4388144292","doi":"10.1007/978-3-031-47240-4_30","title":"SORBET: A Siamese Network for Ontology Embeddings Using a Distance-Based Regression Loss and BERT","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"","keywords":"Ontology; Computer science; Embedding; Benchmark (surveying); Construct (python library); Representation (politics); Artificial intelligence; Focus (optics); Ontology learning; Natural language processing; Theoretical computer science; Upper ontology; Machine learning; Semantic Web; Suggested Upper Merged Ontology; Programming language","score_opus":0.025513991730159537,"score_gpt":0.2850380362882183,"score_spread":0.2595240445580587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388144292","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.0073380475,0.00034699062,0.9821684,0.00029877023,0.00025139572,0.00010247851,0.00063813734,0.0061204247,0.002735334],"genre_scores_gemma":[0.12318743,0.0005364151,0.8425433,0.0005414372,0.00016031717,0.00032146391,0.0052400376,0.0015496134,0.025920045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921906,0.00018871693,0.00004157875,0.00022290196,0.00026597394,0.000061775805],"domain_scores_gemma":[0.9992367,0.00018339552,0.00004428929,0.00019208985,0.00028552682,0.000057947967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978958,0.0014313523,0.001097587,0.0013410245,0.0006696057,0.0016903493,0.002558582,0.0018002874,0.010372267],"category_scores_gemma":[0.0040844004,0.0007166683,0.0010044446,0.0013556205,0.0005669762,0.003085324,0.0026692192,0.0026145955,0.0053139264],"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.00039449643,0.0003348963,0.0007195,0.00017558842,0.00020733914,0.000107197266,0.00006752444,0.16449074,0.006326325,0.023958798,0.047240593,0.755977],"study_design_scores_gemma":[0.000023472781,0.00006105529,0.000110869485,0.000015587126,0.000015050687,0.00004677514,0.00001784285,0.9762399,0.0028580886,0.014656423,0.0059413705,0.0000134701095],"about_ca_topic_score_codex":0.005456515,"about_ca_topic_score_gemma":0.014767095,"teacher_disagreement_score":0.010372267,"about_ca_system_score_codex":0.0009857932,"about_ca_system_score_gemma":0.0014914754,"threshold_uncertainty_score":0.034698725},"labels":[],"label_agreement":null},{"id":"W4388334131","doi":"10.1007/978-3-031-47634-1_1","title":"Towards Explainable Computer Vision Methods via Uncertainty Activation Map","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Focus (optics); Artificial intelligence; Class (philosophy); Noise (video); Uncertainty quantification; Image (mathematics); Measurement uncertainty; Machine learning; Data mining; Mathematics","score_opus":0.024719767348718013,"score_gpt":0.3171863637576421,"score_spread":0.2924665964089241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388334131","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.0017256975,0.00018155333,0.99701107,0.00013235712,0.000019129997,0.000010835736,0.000020852058,0.00028124626,0.0006172586],"genre_scores_gemma":[0.22586752,0.00083904515,0.765106,0.000279716,0.00015550436,0.00018413298,0.00030267524,0.00048268895,0.0067826076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995184,0.0001817563,0.000021259428,0.000103322105,0.00014020201,0.000035046625],"domain_scores_gemma":[0.9982224,0.001220771,0.000109527195,0.00023024969,0.00017199671,0.000045133114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010866869,0.0010613924,0.0010378798,0.0008021959,0.00037647688,0.0013985097,0.0019364828,0.0018074808,0.0034704085],"category_scores_gemma":[0.0047524795,0.000903668,0.0011673493,0.0008587186,0.0012532127,0.0022903483,0.0025216413,0.0030846407,0.00090929633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009936803,0.00005306577,0.00030547232,0.00024981907,0.00014133124,0.00011469303,0.0001918925,0.5366704,0.0076842913,0.20182842,0.003974219,0.24868707],"study_design_scores_gemma":[0.0000037254952,0.000008817098,0.000045655972,0.000009819529,0.0000073323854,0.000013230695,0.0000071745285,0.91205573,0.0007594442,0.085976,0.0011077101,0.0000052578503],"about_ca_topic_score_codex":0.0024998102,"about_ca_topic_score_gemma":0.002080234,"teacher_disagreement_score":0.0034704085,"about_ca_system_score_codex":0.0007235632,"about_ca_system_score_gemma":0.0005859886,"threshold_uncertainty_score":0.011609733},"labels":[],"label_agreement":null},{"id":"W4388340544","doi":"10.1007/978-3-031-46674-8_33","title":"Towards Time-Variant-Aware Link Prediction in Dynamic Graph Through Self-supervised Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Computer science; Interpretability; Theoretical computer science; Graph; Embedding; Graph embedding; Feature learning; Artificial intelligence; Machine learning","score_opus":0.012310496478237,"score_gpt":0.23905250241036094,"score_spread":0.22674200593212393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388340544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02035647,0.0004377245,0.975679,0.0001454431,0.00007157872,0.000026494887,0.0002430625,0.0020379242,0.001002314],"genre_scores_gemma":[0.59585273,0.0005881337,0.39240235,0.00030515727,0.00030680012,0.00010581304,0.0021254637,0.00061227713,0.007701268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999461,0.00010469665,0.000022857022,0.00023319991,0.00012070777,0.000057589557],"domain_scores_gemma":[0.998061,0.0010584734,0.0001655996,0.00035590908,0.0002659478,0.000093092596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078196084,0.0008899694,0.0014811363,0.0013472313,0.00043632192,0.0010245421,0.0024899135,0.001391865,0.0015617723],"category_scores_gemma":[0.0030159086,0.0005679471,0.0008053048,0.001837129,0.0006348339,0.0022504013,0.0014525668,0.0016065745,0.0011132265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018506692,0.00027951537,0.0016710565,0.00013563035,0.00016336507,0.00014107765,0.00009987488,0.61862636,0.007597812,0.009720794,0.00942054,0.3519589],"study_design_scores_gemma":[0.0000017086056,0.000005461284,0.00005824043,0.0000018844522,0.0000036168562,0.000007923565,0.0000027237902,0.9967913,0.00028201137,0.0027135457,0.00012938317,0.0000021423195],"about_ca_topic_score_codex":0.0059717754,"about_ca_topic_score_gemma":0.009521492,"teacher_disagreement_score":0.0059717754,"about_ca_system_score_codex":0.0005336242,"about_ca_system_score_gemma":0.0006605752,"threshold_uncertainty_score":0.01187408},"labels":[],"label_agreement":null},{"id":"W4388341218","doi":"10.1007/978-3-031-46671-7_8","title":"Drugs Resistance Analysis from Scarce Health Records via Multi-task Graph Representation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Computer science; Heuristics; Categorical variable; Machine learning; Graph; Medical record; Artificial intelligence; Task (project management); Encoder; Data mining; Theoretical computer science; Medicine","score_opus":0.028323685816521022,"score_gpt":0.31523613999219735,"score_spread":0.28691245417567635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388341218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116021544,0.0048953993,0.8478893,0.0021287329,0.0002902103,0.00027651896,0.017823642,0.006617782,0.004056838],"genre_scores_gemma":[0.7239776,0.002185662,0.23504643,0.00057801796,0.00047105373,0.00039362593,0.03149716,0.00040346387,0.005446965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950063,0.00012667252,0.00003663194,0.0001849471,0.00007541704,0.00007575179],"domain_scores_gemma":[0.99814117,0.0012647386,0.0001503288,0.00020136329,0.00018294969,0.000059462338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006440716,0.0011312115,0.0013309942,0.0033931793,0.00043657282,0.001001468,0.0013449903,0.0013090688,0.0020451],"category_scores_gemma":[0.0031404838,0.000385597,0.0017150727,0.003160832,0.00029814683,0.0013104854,0.0010844758,0.0012376845,0.001201644],"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.00080265896,0.00072801305,0.010595625,0.0008840029,0.00063792564,0.00084912125,0.00020787626,0.30160135,0.01080104,0.0056442856,0.043709,0.6235391],"study_design_scores_gemma":[0.000016532498,0.00006844426,0.0018022386,0.00003863009,0.0001244464,0.0001195205,0.00006819406,0.9774966,0.001194955,0.016415095,0.002637264,0.000018171846],"about_ca_topic_score_codex":0.012872033,"about_ca_topic_score_gemma":0.017217359,"teacher_disagreement_score":0.012872033,"about_ca_system_score_codex":0.0005448434,"about_ca_system_score_gemma":0.0010440393,"threshold_uncertainty_score":0.025594234},"labels":[],"label_agreement":null},{"id":"W4388341476","doi":"10.1007/978-3-031-46671-7_4","title":"csl-MTFL: Multi-task Feature Learning with Joint Correlation Structure Learning for Alzheimer’s Disease Cognitive Performance Prediction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Correlation; Multi-task learning; Regularization (linguistics); Artificial intelligence; ENCODE; Feature learning; Machine learning; Graph; Feature (linguistics); Cognition; Task (project management); Joint (building); Pattern recognition (psychology); Theoretical computer science; Mathematics","score_opus":0.030546560918730984,"score_gpt":0.28859765641147883,"score_spread":0.25805109549274785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388341476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116041815,0.005157532,0.93164104,0.00075896276,0.0007044594,0.00019846819,0.0078058476,0.037576668,0.004552765],"genre_scores_gemma":[0.13393584,0.0023393978,0.8110758,0.00080926303,0.00050009013,0.0008042184,0.0189484,0.0018314339,0.029755628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958664,0.000078585894,0.00002356999,0.00012126967,0.00014007046,0.00004990138],"domain_scores_gemma":[0.99929273,0.00036973035,0.0000330277,0.00011055148,0.00016164989,0.000032316846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012304748,0.0018228882,0.001149386,0.00084345206,0.00031473787,0.00075286365,0.0021012942,0.0016802257,0.010384364],"category_scores_gemma":[0.002331322,0.0006028133,0.0013007511,0.0009940696,0.00023511473,0.0011077304,0.0010837183,0.0019424647,0.007107151],"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.00018683914,0.00014371458,0.00054015766,0.00012173413,0.00012796205,0.00006250013,0.000020880168,0.028232723,0.004058795,0.001225758,0.07118325,0.8940957],"study_design_scores_gemma":[0.00007045866,0.0002300208,0.0022745505,0.00006313988,0.00008335951,0.00016094714,0.000015954445,0.9568252,0.008994717,0.010324781,0.020883245,0.00007367024],"about_ca_topic_score_codex":0.009961824,"about_ca_topic_score_gemma":0.016064495,"teacher_disagreement_score":0.010384364,"about_ca_system_score_codex":0.00048627652,"about_ca_system_score_gemma":0.0008883638,"threshold_uncertainty_score":0.034739137},"labels":[],"label_agreement":null},{"id":"W4388348910","doi":"10.1007/978-3-031-46661-8_4","title":"Modeling of Repeated Measures for Time-to-event Prediction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical Methods and Inference","field":"Mathematics","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Event (particle physics); Logistic regression; Artificial intelligence; Machine learning; Data mining; Trajectory","score_opus":0.09921906418813631,"score_gpt":0.34567177800013066,"score_spread":0.24645271381199435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388348910","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.0042454954,0.0008447642,0.9928343,0.00034237865,0.00016983859,0.00008265275,0.00045107072,0.00041804582,0.0006114877],"genre_scores_gemma":[0.40935272,0.004955851,0.5419186,0.0007794444,0.0013284641,0.0028521605,0.0044163,0.0007030504,0.03369339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99131435,0.0050813886,0.00039734767,0.002006684,0.0006984957,0.00050175114],"domain_scores_gemma":[0.9506216,0.043511707,0.0017512866,0.002519672,0.0012281552,0.00036754744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015209083,0.0026414583,0.004383627,0.0017595282,0.0009700458,0.0027092013,0.0077577317,0.0043287002,0.009736187],"category_scores_gemma":[0.04446811,0.0021959005,0.0048051667,0.0030797762,0.0019100342,0.0034893088,0.002404543,0.0052770143,0.003463455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048844435,0.00032328535,0.005336053,0.00063599704,0.0013628759,0.00040982972,0.00057349534,0.5934144,0.0014393507,0.2866799,0.007020443,0.10231595],"study_design_scores_gemma":[0.000027668613,0.000079996156,0.00046548402,0.0000495141,0.0001280309,0.00007370722,0.00002371163,0.91305184,0.00028563617,0.0843237,0.0014534341,0.000037183858],"about_ca_topic_score_codex":0.013841021,"about_ca_topic_score_gemma":0.011482136,"teacher_disagreement_score":0.015209083,"about_ca_system_score_codex":0.0021343222,"about_ca_system_score_gemma":0.0023256317,"threshold_uncertainty_score":0.08043426},"labels":[],"label_agreement":null},{"id":"W4388348936","doi":"10.1007/978-3-031-46674-8_27","title":"Label Correlation Guided Feature Selection for Multi-label Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Feature selection; Minimum redundancy feature selection; Redundancy (engineering); Artificial intelligence; Discriminative model; Pattern recognition (psychology); Feature (linguistics); Curse of dimensionality; Correlation; Dimensionality reduction; Exploit; Machine learning; Feature learning; Multi-label classification; Mathematics","score_opus":0.06536076908770279,"score_gpt":0.3104444183153377,"score_spread":0.24508364922763493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388348936","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.016490027,0.000788793,0.97700614,0.00020638645,0.00014957495,0.000109249304,0.00038597762,0.0037021798,0.0011615994],"genre_scores_gemma":[0.3447541,0.00047638698,0.6376867,0.00043599127,0.00031373728,0.0004826271,0.0037757154,0.0007164936,0.011358273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870634,0.000354455,0.00007678933,0.00034439197,0.00032979707,0.00018821564],"domain_scores_gemma":[0.9979011,0.0010604961,0.00013043136,0.00038068573,0.0004436657,0.00008364263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017526255,0.0013826914,0.00220895,0.0017071726,0.0011329547,0.0014812421,0.0030092616,0.0021250937,0.004720963],"category_scores_gemma":[0.0031076772,0.0005301751,0.0015065911,0.0023490977,0.000700457,0.0016419081,0.0019090336,0.0024050705,0.0027403752],"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.00046650518,0.00045055326,0.001172975,0.00016229246,0.00012636879,0.00014542462,0.000071029324,0.03357489,0.023696665,0.0025388894,0.018742092,0.9188522],"study_design_scores_gemma":[0.000037735692,0.0001434911,0.00082347373,0.000022448523,0.00005375177,0.00010530662,0.000042727694,0.97495687,0.012923828,0.007987238,0.0028742768,0.000028789227],"about_ca_topic_score_codex":0.003341449,"about_ca_topic_score_gemma":0.0064505315,"teacher_disagreement_score":0.004720963,"about_ca_system_score_codex":0.0007045943,"about_ca_system_score_gemma":0.0010948501,"threshold_uncertainty_score":0.015793145},"labels":[],"label_agreement":null},{"id":"W4388429207","doi":"10.1007/978-3-031-46077-7","title":"Embedded Computer Systems: Architectures, Modeling, and Simulation","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ioannina; National Technical University of Athens; University of California, Irvine; Universidade de Lisboa; Universität Rostock; Trakya Üniversitesi; Universidad Politécnica de Madrid; Shanghai Jiao Tong University; University of Cyprus; Technische Universität Dresden; Eidgenössische Technische Hochschule Zürich; Leibniz-Gemeinschaft; Chalmers Tekniska Högskola; Technische Universiteit Delft; Universiteit van Amsterdam; University of California, San Diego; Universiteit Leiden; Queen's University Belfast; Indian National Science Academy; Università degli Studi di Cagliari; Universidade Federal do Rio Grande do Sul; Queen's University; University of Patras; Aristotle University of Thessaloniki; Universidad de Málaga","keywords":"Computer science; Computer architecture; Software engineering","score_opus":0.021853891879584794,"score_gpt":0.27724444796093745,"score_spread":0.25539055608135264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388429207","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008328763,0.13723767,0.6639836,0.0024026178,0.0033232912,0.00019285972,0.0010753701,0.003942332,0.17951354],"genre_scores_gemma":[0.15451701,0.13875982,0.2686798,0.000965623,0.0026857674,0.0005289959,0.0024129401,0.0017849493,0.42966506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977726,0.00003597104,0.000010351917,0.00002631936,0.00013595916,0.000014052127],"domain_scores_gemma":[0.99965227,0.0001440856,0.000022458938,0.000073720126,0.00009008111,0.000017416602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023887034,0.0012092354,0.0010621698,0.0006559901,0.00023132199,0.0013984859,0.0010125532,0.00090744765,0.01544727],"category_scores_gemma":[0.0009349991,0.00075827,0.00041790516,0.001758371,0.00052512815,0.0015594712,0.0006644359,0.0013145136,0.008299542],"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.00006185348,0.000104966755,0.0005166891,0.0011625927,0.00007179612,0.00012020871,0.000103624596,0.27252278,0.006205564,0.13696,0.1712282,0.41094175],"study_design_scores_gemma":[0.000030513494,0.00010390712,0.0010070404,0.0003158383,0.000053032065,0.00055619574,0.000053527016,0.3933851,0.0034576932,0.13779996,0.46319804,0.000039144325],"about_ca_topic_score_codex":0.0013635285,"about_ca_topic_score_gemma":0.0019518149,"teacher_disagreement_score":0.01544727,"about_ca_system_score_codex":0.00049248035,"about_ca_system_score_gemma":0.00075327454,"threshold_uncertainty_score":0.051676214},"labels":[],"label_agreement":null},{"id":"W4388448100","doi":"10.1007/978-981-99-7032-2_11","title":"QR-SACP: Quantitative Risk-Based Situational Awareness Calculation and Projection Through Threat Information Sharing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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 Saskatchewan; Queen's University","funders":"","keywords":"Situation awareness; Situational ethics; Computer science; Dependency (UML); Service (business); Situation analysis; Risk analysis (engineering); Order (exchange); Computer security; Information sharing; Operations research; Engineering; Artificial intelligence; Business; World Wide Web","score_opus":0.03502598899926332,"score_gpt":0.28682321746120937,"score_spread":0.2517972284619461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388448100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038239844,0.000092792456,0.9832829,0.00006213717,0.000055469078,0.00010739637,0.00042455658,0.0076568574,0.0044938526],"genre_scores_gemma":[0.13082586,0.00019278275,0.8603661,0.000067974404,0.00004112144,0.00022705726,0.001420726,0.00072104984,0.0061374516],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909055,0.00018437803,0.000045649173,0.00013068302,0.00049327017,0.000055514705],"domain_scores_gemma":[0.998808,0.0004804166,0.00007062091,0.0002672408,0.00031497524,0.000058753067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011793374,0.0009389723,0.0011228342,0.0012145257,0.00046804175,0.0017238386,0.0016078079,0.0006121257,0.016214786],"category_scores_gemma":[0.003994687,0.0005286625,0.0006838728,0.001415665,0.0004589558,0.0019682231,0.0025038728,0.0011632484,0.0041524447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023337835,0.00017162073,0.0012113949,0.00040289765,0.000106828425,0.00013606959,0.00033575314,0.11920359,0.010168944,0.04282448,0.032588292,0.7926168],"study_design_scores_gemma":[0.000022581049,0.00006898798,0.00070348923,0.000034680077,0.000022700779,0.00015619205,0.00007203121,0.95015866,0.0073083322,0.029363526,0.012049598,0.000039171915],"about_ca_topic_score_codex":0.002493406,"about_ca_topic_score_gemma":0.0024207076,"teacher_disagreement_score":0.016214786,"about_ca_system_score_codex":0.00047615444,"about_ca_system_score_gemma":0.0011147822,"threshold_uncertainty_score":0.054243863},"labels":[],"label_agreement":null},{"id":"W4388458564","doi":"10.1007/978-3-031-47994-6","title":"Artificial Intelligence XL","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Khalifa University of Science, Technology and Research; University College Cork; Aix-Marseille Université; University of Portsmouth; University of Hertfordshire; Nottingham Trent University; University of Brighton; Universitat Politècnica de València; University of Reading; University of Southern California; University of Southampton; Anglia Ruskin University; Swansea University; University of the West of Scotland; University of Leicester; Deutsches Forschungszentrum für Künstliche Intelligenz; Universidad Complutense de Madrid; Technological University Dublin; University of Exeter; Middlesex University; Office National d'études et de Recherches Aérospatiales; Robert Gordon University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Aston University; University of Greenwich; Brown University; Trent University; AstraZeneca","keywords":"Computer science; Artificial intelligence","score_opus":0.0578154905152717,"score_gpt":0.33862012932904734,"score_spread":0.28080463881377565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388458564","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034361015,0.008523181,0.00806992,0.0018313034,0.0016124648,0.00007698062,0.0034655358,0.0014125395,0.9746645],"genre_scores_gemma":[0.0026897367,0.0061467923,0.004295286,0.0005959778,0.00065251056,0.00008067428,0.003375166,0.0006088851,0.9815548],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996871,0.00005320321,0.000017696533,0.00004404875,0.00018139767,0.000016656095],"domain_scores_gemma":[0.9994319,0.00021071281,0.00002458147,0.00012740694,0.00015698545,0.00004840016],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040672236,0.0010949726,0.0008703948,0.002646766,0.0006561311,0.0043216627,0.00085191376,0.00079605484,0.5046039],"category_scores_gemma":[0.0017892665,0.00052154827,0.00042230415,0.003911939,0.0004595518,0.002732796,0.0011595847,0.0012749832,0.32175025],"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.000013418191,0.00002329244,0.00009160448,0.00027049106,0.000007347193,0.000029876668,0.000045337256,0.00031978198,0.00022260113,0.022389919,0.77386373,0.20272261],"study_design_scores_gemma":[0.000006215362,0.000010635538,0.00025891876,0.00020699656,0.0000047081403,0.00006227493,0.000033685985,0.00035305266,0.00014341871,0.017632175,0.98128396,0.0000041000408],"about_ca_topic_score_codex":0.0018522218,"about_ca_topic_score_gemma":0.0033855797,"teacher_disagreement_score":0.5046039,"about_ca_system_score_codex":0.001043475,"about_ca_system_score_gemma":0.0006915208,"threshold_uncertainty_score":0.70662236},"labels":[],"label_agreement":null},{"id":"W4388468390","doi":"10.1007/978-3-031-47994-6_21","title":"A Neural Network Approach to Dragon Boat Partition Problem(Abstract)","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Statistical Modeling Techniques","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 Lethbridge","funders":"","keywords":"Partition (number theory); Computer science; Partition problem; Artificial neural network; Artificial intelligence; Convolutional neural network; Integer (computer science); Reinforcement learning; Mathematical optimization; Mathematics; Combinatorics; Programming language","score_opus":0.03703491749285175,"score_gpt":0.2804707881163828,"score_spread":0.24343587062353106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388468390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030355621,0.0012386991,0.94086653,0.0008705804,0.00023354431,0.00006499228,0.0002008926,0.0002182108,0.02595091],"genre_scores_gemma":[0.6575803,0.0018278218,0.26866925,0.0003052116,0.0005059105,0.0001957171,0.0007361501,0.00022184613,0.06995781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998903,0.000022434226,0.0000040182863,0.00003920289,0.000022017057,0.000021871821],"domain_scores_gemma":[0.9998592,0.00007033089,0.000014088222,0.000010008163,0.000031498526,0.000014899268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022952881,0.00037764493,0.0006541574,0.00053152966,0.00062336575,0.00089024927,0.0011248924,0.001348944,0.009475459],"category_scores_gemma":[0.0010308218,0.00033234057,0.00042870778,0.0008465693,0.0005746857,0.0013586876,0.0008775607,0.0009850538,0.0005908914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004975676,0.000043670145,0.00044899562,0.00007618657,0.000020172592,0.00009265058,0.00004588811,0.8551163,0.0012077919,0.06766041,0.005652989,0.06958529],"study_design_scores_gemma":[0.000002142667,0.0000058039345,0.00011458397,0.00000568379,0.000003162516,0.000012509031,0.00001170827,0.9779424,0.0001347406,0.020879561,0.000884002,0.0000038067058],"about_ca_topic_score_codex":0.017750485,"about_ca_topic_score_gemma":0.013885179,"teacher_disagreement_score":0.017750485,"about_ca_system_score_codex":0.0008510866,"about_ca_system_score_gemma":0.00054624496,"threshold_uncertainty_score":0.035294294},"labels":[],"label_agreement":null},{"id":"W4388479556","doi":"10.1007/978-3-031-47748-5_2","title":"No Place to Hide: Privacy Exposure in Anti-stalkerware Apps and Support Websites","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sexuality, Behavior, and Technology","field":"Psychology","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":"Concordia University","funders":"","keywords":"Session (web analytics); Internet privacy; Computer science; Stalking; Computer security; BitTorrent tracker; Mobile apps; Phishing; Authentication (law); World Wide Web; Personally identifiable information; Information sensitivity; The Internet","score_opus":0.037415769896983024,"score_gpt":0.3191546714082355,"score_spread":0.28173890151125247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388479556","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.28934,0.011062518,0.016202297,0.027092008,0.00078786764,0.00006850302,0.00015170516,0.00020683356,0.6550883],"genre_scores_gemma":[0.9085216,0.0045756795,0.004527226,0.0030742078,0.00033776404,0.000041058312,0.00009758656,0.00011803673,0.07870685],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992798,0.0002808604,0.00002086203,0.000065286455,0.000245252,0.000107907224],"domain_scores_gemma":[0.9982406,0.0012705014,0.0001389767,0.0001359269,0.00009681019,0.00011707109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008414207,0.00026086703,0.0001691304,0.00047565319,0.0015979458,0.004576118,0.00058955065,0.002140688,0.009008642],"category_scores_gemma":[0.003589473,0.00021521887,0.00029212356,0.00056435534,0.0026461657,0.0068046176,0.002378394,0.0025690931,0.0011142652],"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.00029567943,0.0003870827,0.010117203,0.00040668296,0.000035936446,0.0029749095,0.048611995,0.0003668105,0.002857012,0.4265479,0.066177346,0.4412215],"study_design_scores_gemma":[0.00004865472,0.0004294995,0.025011206,0.0019630035,0.00016638225,0.018010918,0.09784165,0.0039115082,0.008621218,0.4607838,0.38310552,0.00010668619],"about_ca_topic_score_codex":0.0010157765,"about_ca_topic_score_gemma":0.001882408,"teacher_disagreement_score":0.009008642,"about_ca_system_score_codex":0.00060751726,"about_ca_system_score_gemma":0.00085690647,"threshold_uncertainty_score":0.030136943},"labels":[],"label_agreement":null},{"id":"W4388511218","doi":"10.1007/978-981-99-7584-6_14","title":"Proving Local Invariants in ASTDs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Guard (computer science); Modular design; Invariant (physics); Process calculus; Theoretical computer science; Programming language; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.03633262221751391,"score_gpt":0.2815690185027539,"score_spread":0.24523639628524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388511218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023835847,0.00044253335,0.9333399,0.0005747184,0.00027131665,0.00015524961,0.0004880515,0.01179866,0.029093862],"genre_scores_gemma":[0.50279427,0.0010451261,0.45703727,0.00074288493,0.00033342885,0.00028519385,0.0034090485,0.0058197803,0.028533041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517196,0.000990501,0.00038750737,0.00063917105,0.0020630283,0.0007478951],"domain_scores_gemma":[0.98859626,0.007812668,0.00046202872,0.0017917226,0.0010801035,0.00025731788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034432935,0.001656369,0.0015561768,0.0018661808,0.0012133174,0.0045358925,0.0034183152,0.0014628745,0.014660762],"category_scores_gemma":[0.0118460525,0.0020261875,0.0038783394,0.0019553246,0.0049726297,0.009346949,0.006006029,0.005681137,0.005062001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004984078,0.00032185117,0.0028705301,0.0013796961,0.00019716816,0.0010990764,0.0011761936,0.038424283,0.019404273,0.7281192,0.024191745,0.18231763],"study_design_scores_gemma":[0.00016930563,0.00018282418,0.00077755324,0.0003039044,0.00032666087,0.00053876924,0.00046541516,0.12256789,0.04979091,0.78452325,0.040259365,0.000094176714],"about_ca_topic_score_codex":0.00303869,"about_ca_topic_score_gemma":0.0049308864,"teacher_disagreement_score":0.014660762,"about_ca_system_score_codex":0.0021923992,"about_ca_system_score_gemma":0.0018513113,"threshold_uncertainty_score":0.049045205},"labels":[],"label_agreement":null},{"id":"W4388511321","doi":"10.1007/978-981-99-7584-6","title":"Formal Methods and Software Engineering","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Universitat Politècnica de València; Japan Aerospace Exploration Agency; University of Science and Technology Beijing; National Cheng Kung University; Academia Româna; Syddansk Universitet; Universitetet i Oslo; Shanghai Jiao Tong University; Zhejiang University; East China Normal University; Tongji University; Università degli Studi di Trento; Universidad Complutense de Madrid; Chinese Academy of Sciences; Fondazione Bruno Kessler; Peking University; Academia Sinica; University of New South Wales; National Institute of Informatics; Aston University; Victoria University of Wellington; National University of Singapore; Griffith University; Nanyang Technological University; Indian Institute of Technology Kanpur; Université de Sherbrooke; National Aeronautics and Space Administration; Singapore Management University; Università degli Studi di Milano; Concordia University; McMaster University; Technische Universität Darmstadt; Teesside University; Langley Research Center; Eidgenössische Technische Hochschule Zürich; Universidade de São Paulo; RMIT University; Carnegie Mellon University; Southwest University; Université de Lorraine; Florida International University; Victoria University; Université du Luxembourg","keywords":"Computer science; Software engineering; Formal methods; Formal verification; Programming language","score_opus":0.024763554960233098,"score_gpt":0.31415459819574465,"score_spread":0.28939104323551157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388511321","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012284796,0.08836255,0.3377018,0.0043428023,0.0041157487,0.00013222813,0.0003553293,0.0016559007,0.56210524],"genre_scores_gemma":[0.026665198,0.048573904,0.1008369,0.0015496735,0.0021620109,0.00035407912,0.0007760388,0.0014379631,0.8176443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990625,0.00019314447,0.000040461615,0.000115436145,0.00054066,0.00004781463],"domain_scores_gemma":[0.9991178,0.00058544,0.000027217366,0.00012482457,0.00011467794,0.000029964865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096499163,0.0017892614,0.0015259272,0.002186245,0.0008283988,0.0029726913,0.0012206598,0.0012783982,0.051670842],"category_scores_gemma":[0.0021828744,0.0009836348,0.0008431102,0.0024177718,0.002274221,0.0041992837,0.0014505687,0.003186348,0.027393917],"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.000020916856,0.000057022226,0.00006528297,0.0005961781,0.00001990591,0.00004712603,0.00033453602,0.0018190123,0.0009545088,0.55784357,0.14153156,0.2967104],"study_design_scores_gemma":[0.000013609224,0.00001869408,0.00009864423,0.00031921925,0.000011111624,0.0001319827,0.000051037587,0.0018884394,0.0004373792,0.3971087,0.5999086,0.000012575939],"about_ca_topic_score_codex":0.0010565328,"about_ca_topic_score_gemma":0.001304721,"teacher_disagreement_score":0.051670842,"about_ca_system_score_codex":0.0014025378,"about_ca_system_score_gemma":0.0011635603,"threshold_uncertainty_score":0.17285621},"labels":[],"label_agreement":null},{"id":"W4388557093","doi":"10.1007/978-3-031-47705-8_20","title":"Scalable and Precise Refinement Types for Imperative Languages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 Waterloo","funders":"","keywords":"Computer science; Programming language; Scalability; Type (biology); Theoretical computer science; Database","score_opus":0.02240080602861241,"score_gpt":0.26956453772602024,"score_spread":0.24716373169740782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388557093","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.0037304752,0.00050475495,0.9835644,0.00034588174,0.00018764359,0.00005643692,0.00020750571,0.0029370412,0.008465861],"genre_scores_gemma":[0.14480029,0.0013376852,0.82531285,0.00041290355,0.0003450442,0.0002778474,0.00095350744,0.002872692,0.02368709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969614,0.0004211632,0.00028301714,0.00038550777,0.0016749369,0.00027402543],"domain_scores_gemma":[0.9935226,0.002780833,0.0002648072,0.002584907,0.00070364703,0.00014328404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033295173,0.00089127454,0.0010668366,0.0010322429,0.0009886642,0.0027294285,0.0026943793,0.0011769762,0.011613761],"category_scores_gemma":[0.011612398,0.0017790638,0.0016124647,0.0019366589,0.0027909335,0.009702326,0.0042113787,0.0060350583,0.0028869691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096246156,0.000035517503,0.00026896567,0.00023390951,0.000019301842,0.00006599382,0.00028826523,0.011306229,0.005271016,0.847709,0.008804162,0.12590149],"study_design_scores_gemma":[0.000039304927,0.000029130215,0.00017179167,0.00008987888,0.00002896594,0.00011428982,0.00006788796,0.043084748,0.0055980976,0.91541976,0.035322588,0.00003359858],"about_ca_topic_score_codex":0.0013520528,"about_ca_topic_score_gemma":0.0026233143,"teacher_disagreement_score":0.011613761,"about_ca_system_score_codex":0.0013332937,"about_ca_system_score_gemma":0.0014798816,"threshold_uncertainty_score":0.038851857},"labels":[],"label_agreement":null},{"id":"W4388580387","doi":"10.1007/978-3-031-47705-8","title":"Integrated Formal Methods","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Data Processing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Torino; Universitetet i Oslo; University of Surrey; Carl von Ossietzky Universität Oldenburg; University of Twente; McMaster University","keywords":"Computer science","score_opus":0.02320127823493744,"score_gpt":0.31977253110185283,"score_spread":0.2965712528669154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388580387","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.0013787166,0.0023616173,0.8731993,0.00073752523,0.00048178848,0.00009985741,0.000351258,0.0035128666,0.11787712],"genre_scores_gemma":[0.063337184,0.0035617212,0.64131045,0.00053429353,0.00044509096,0.00038394053,0.0023470342,0.0032816275,0.28479865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826753,0.000339697,0.00009953232,0.00029558313,0.00089631305,0.00010130183],"domain_scores_gemma":[0.99867,0.0005243968,0.000035536475,0.0004847064,0.00023787099,0.000047553694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018378246,0.0010733794,0.00077164173,0.001763662,0.0008347466,0.0029548176,0.001716595,0.0008846363,0.053137332],"category_scores_gemma":[0.0032145358,0.0010314343,0.0013675289,0.0013063113,0.0015056136,0.0041387565,0.0027349098,0.0027581102,0.018186385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042415675,0.00005959874,0.0001254698,0.000222664,0.000025748745,0.000038079008,0.00030697434,0.002741869,0.002112557,0.5935542,0.035509065,0.36526126],"study_design_scores_gemma":[0.000022020884,0.000026973605,0.00013802473,0.00017019935,0.000024809633,0.00014011582,0.00006975727,0.011567789,0.0029669665,0.5863809,0.39847475,0.000017654143],"about_ca_topic_score_codex":0.00083777343,"about_ca_topic_score_gemma":0.0010484367,"teacher_disagreement_score":0.053137332,"about_ca_system_score_codex":0.0011632396,"about_ca_system_score_gemma":0.0013985131,"threshold_uncertainty_score":0.17776209},"labels":[],"label_agreement":null},{"id":"W4388621497","doi":"10.1007/978-981-99-8248-6_22","title":"Visualising Game Engine Subsystem Coupling Patterns","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"École de Technologie Supérieure; Concordia University","funders":"","keywords":"Computer science; Rendering (computer graphics); Maintainability; Game development tool; Game engine; Game programming; Architecture; Graphics; Game design; Video game development; Video game; Game Developer; Loose coupling; Human–computer interaction; Software engineering; Multimedia; Game design document; Operating system; Game art design; Programming language; Computer graphics (images)","score_opus":0.11197649912553322,"score_gpt":0.35922110438769206,"score_spread":0.24724460526215886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388621497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19170159,0.0005235054,0.6974237,0.000559658,0.0003293907,0.00025728878,0.004453064,0.040113818,0.06463799],"genre_scores_gemma":[0.66256243,0.00045980062,0.28468624,0.00026135115,0.000039337137,0.00020797145,0.0034046737,0.0061357464,0.042242505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989104,0.000012422801,0.0000070251444,0.00001948422,0.000044846776,0.000025139758],"domain_scores_gemma":[0.99930024,0.00035929578,0.00006833051,0.00006663837,0.00013148735,0.0000738867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023756482,0.000867888,0.00021896783,0.0015982516,0.00024498446,0.0012662979,0.0005728801,0.0005273178,0.024497207],"category_scores_gemma":[0.0012190738,0.0004201549,0.0003535262,0.0007685207,0.00021051764,0.000978681,0.0009983896,0.00095967425,0.002400584],"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.0019466031,0.0003863364,0.01802505,0.001509663,0.00013295445,0.0018611791,0.005443072,0.08153276,0.20782389,0.039101318,0.06452227,0.5777149],"study_design_scores_gemma":[0.0001952179,0.0004235159,0.03954399,0.0006165112,0.00015354191,0.0015277216,0.0023032848,0.6963273,0.07576899,0.033188075,0.14976077,0.00019103207],"about_ca_topic_score_codex":0.007139348,"about_ca_topic_score_gemma":0.010136463,"teacher_disagreement_score":0.024497207,"about_ca_system_score_codex":0.00031150135,"about_ca_system_score_gemma":0.0003546018,"threshold_uncertainty_score":0.08195132},"labels":[],"label_agreement":null},{"id":"W4388621503","doi":"10.1007/978-981-99-8248-6_24","title":"Combating Computer Vision-Based Aim Assist Tools in Competitive Online Games","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Western University","funders":"","keywords":"Computer science; Adversarial system; Domain (mathematical analysis); Set (abstract data type); Human–computer interaction; Artificial intelligence; Object (grammar); Cheating; Black box; Computer game; Competitor analysis; Computer vision; Computer security; Multimedia; Programming language","score_opus":0.024851314607340833,"score_gpt":0.2910374366453593,"score_spread":0.26618612203801845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388621503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060638037,0.0006948068,0.8952402,0.0004364023,0.0002805337,0.00016463407,0.0000539081,0.0012265883,0.041264936],"genre_scores_gemma":[0.8896881,0.00036016697,0.089591734,0.0002411412,0.000067427914,0.00013644983,0.000067380664,0.000117368705,0.019730214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995926,0.00010279764,0.000010711442,0.000054952972,0.0001506426,0.0000883491],"domain_scores_gemma":[0.9994816,0.00026989292,0.000050048548,0.000046197812,0.000089834626,0.000062460174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007829779,0.0010547512,0.000535779,0.00035801984,0.00034791883,0.0009697293,0.0011214515,0.001088189,0.0063750953],"category_scores_gemma":[0.001824824,0.0003225158,0.00034447957,0.00016277411,0.00075137545,0.0010571032,0.0025862653,0.0013591562,0.0013080804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009958126,0.00067900715,0.0011322394,0.00041418677,0.00011784267,0.0004614106,0.00043655318,0.4668409,0.06331794,0.0593547,0.013430848,0.39281857],"study_design_scores_gemma":[0.000022265933,0.00042336993,0.00070098095,0.000046169225,0.000015689424,0.0001728033,0.00009175002,0.9674004,0.008959357,0.017281532,0.0048627863,0.000022901002],"about_ca_topic_score_codex":0.0007753515,"about_ca_topic_score_gemma":0.0012359557,"teacher_disagreement_score":0.0063750953,"about_ca_system_score_codex":0.00031760507,"about_ca_system_score_gemma":0.00042106182,"threshold_uncertainty_score":0.02132684},"labels":[],"label_agreement":null},{"id":"W4388621738","doi":"10.1007/978-981-99-8248-6_10","title":"Reasoning of Intelligent Virtual Agents with Exceptional Behavior in Rare Scenarios","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":"York University; University of New Brunswick","funders":"","keywords":"Nondeterministic algorithm; Computer science; Ambiguity; Credibility; Process (computing); Artificial intelligence; Machine learning; Human–computer interaction; Theoretical computer science","score_opus":0.024848138173786668,"score_gpt":0.2450244193176588,"score_spread":0.22017628114387214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388621738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103036374,0.00026420574,0.8797999,0.00068281987,0.00007788678,0.00017889949,0.0005593233,0.0027043018,0.012696282],"genre_scores_gemma":[0.7749802,0.00012770973,0.22103368,0.00012590809,0.000047100944,0.00009298661,0.00088365114,0.00014852473,0.0025602528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998064,0.00061872957,0.00019469859,0.00042106482,0.00045899945,0.0002425694],"domain_scores_gemma":[0.99430895,0.004166298,0.0003999379,0.0005098668,0.0003200794,0.00029484593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018861037,0.0009780602,0.0009101593,0.0012071134,0.00093939545,0.0031990618,0.003599127,0.0020373818,0.004658525],"category_scores_gemma":[0.0110042,0.00094525825,0.0019360007,0.0005718139,0.0018070026,0.0042984695,0.003585101,0.001381001,0.00050050684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059799704,0.00026219414,0.008586867,0.00056021556,0.00036137496,0.0045733666,0.001942868,0.68286514,0.0055144215,0.22156945,0.0062719295,0.06689417],"study_design_scores_gemma":[0.00002886249,0.00002488228,0.00029538115,0.00003961922,0.00005296311,0.00031197394,0.00027825523,0.89275306,0.0019306869,0.102307566,0.0019570636,0.000019546424],"about_ca_topic_score_codex":0.0044337274,"about_ca_topic_score_gemma":0.0049839746,"teacher_disagreement_score":0.004658525,"about_ca_system_score_codex":0.0008958486,"about_ca_system_score_gemma":0.0008197032,"threshold_uncertainty_score":0.01558429},"labels":[],"label_agreement":null},{"id":"W4388621756","doi":"10.1007/978-3-031-45382-3_29","title":"Texture-Based Data Augmentation for Small Datasets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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","funders":"","keywords":"Computer science; Artificial intelligence; Regularization (linguistics); Generalization; Robustness (evolution); Pattern recognition (psychology); Training set; Machine learning; Data mining; Mathematics","score_opus":0.07709191171857734,"score_gpt":0.31888997629896015,"score_spread":0.24179806458038283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388621756","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.017163014,0.0012423423,0.9688711,0.00037649428,0.0003743038,0.0001774522,0.0022062277,0.006239861,0.0033492052],"genre_scores_gemma":[0.13467535,0.0012290508,0.8478762,0.00031023732,0.00023217329,0.00046352428,0.0076489393,0.0008963391,0.0066682664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00009626556,0.00003873814,0.00015069636,0.00020921159,0.000059139464],"domain_scores_gemma":[0.9981812,0.0006813177,0.00008775343,0.0007226188,0.00025258496,0.0000746002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085604057,0.0010401437,0.0010126738,0.00093187654,0.00038604648,0.0011582866,0.0013236854,0.00073718757,0.00831478],"category_scores_gemma":[0.003968323,0.00055638497,0.0008552232,0.0019192512,0.000558042,0.0014366105,0.0021096317,0.0015002877,0.0032557764],"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.00060765963,0.00019200308,0.0008876389,0.0005056264,0.00009761091,0.00012823725,0.000087643915,0.040009145,0.09657267,0.005165511,0.032371677,0.8233747],"study_design_scores_gemma":[0.00007285761,0.00020671445,0.0017389724,0.00008393076,0.000066314205,0.0003613177,0.00009175138,0.8679727,0.07934154,0.017599318,0.032424178,0.00004044091],"about_ca_topic_score_codex":0.0016240538,"about_ca_topic_score_gemma":0.0033303497,"teacher_disagreement_score":0.00831478,"about_ca_system_score_codex":0.00032868327,"about_ca_system_score_gemma":0.0006828998,"threshold_uncertainty_score":0.02781576},"labels":[],"label_agreement":null},{"id":"W4388621796","doi":"10.1007/978-981-99-8248-6_9","title":"Persuasive System Design for Climate Change Awareness","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Climate Change Communication and Perception","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Personalization; Computer science; Climate change; Narrative; Persuasive technology; Behavior change; Behaviour change; Intervention (counseling); Applied psychology; Persuasion; Psychology; Social psychology; World Wide Web","score_opus":0.4691546284292302,"score_gpt":0.42432789817934985,"score_spread":0.044826730249880375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388621796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02004817,0.0012933193,0.945552,0.0005895508,0.000338629,0.00032580807,0.00008991424,0.003156094,0.02860652],"genre_scores_gemma":[0.42786333,0.00080691447,0.53556764,0.00034362022,0.0001434975,0.0008233019,0.00020444999,0.0004300688,0.03381716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914885,0.0004061201,0.000055303502,0.00011644548,0.00022407706,0.000049266215],"domain_scores_gemma":[0.9960991,0.0030668082,0.0001031129,0.00023258424,0.00041841535,0.00008000918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013743208,0.0007363331,0.00040011207,0.00064293144,0.0005496688,0.0018257918,0.0014215789,0.0016263523,0.024657588],"category_scores_gemma":[0.006866278,0.00043042883,0.00031208812,0.00032793675,0.0004702969,0.001866585,0.00097254943,0.0010821372,0.0025566006],"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.0007480254,0.00078659254,0.0010674183,0.0018779639,0.000120155804,0.00049815973,0.0032212469,0.030929172,0.06357646,0.11649367,0.01908875,0.7615924],"study_design_scores_gemma":[0.00051295565,0.0021142117,0.0015702134,0.00050155167,0.00037913266,0.0016597012,0.0012166902,0.5957776,0.08292363,0.15377025,0.15944088,0.00013333988],"about_ca_topic_score_codex":0.00038692929,"about_ca_topic_score_gemma":0.00046613638,"teacher_disagreement_score":0.024657588,"about_ca_system_score_codex":0.00041143686,"about_ca_system_score_gemma":0.00048219753,"threshold_uncertainty_score":0.08248782},"labels":[],"label_agreement":null},{"id":"W4388653900","doi":"10.1007/978-981-99-8082-6_12","title":"Time-Series Forecasting Through Contrastive Learning with a Two-Dimensional Self-attention Mechanism","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Artificial intelligence; Representation (politics); Time series; Dimension (graph theory); Timestamp; Feature learning; Context (archaeology); Series (stratigraphy); Pruning; Sequence (biology); Machine learning; Pattern recognition (psychology); Data mining","score_opus":0.015635742356713517,"score_gpt":0.21644581571092092,"score_spread":0.2008100733542074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388653900","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.08753446,0.00074193237,0.90595025,0.0004442711,0.0002501468,0.00006009979,0.00005149935,0.0006864158,0.004280889],"genre_scores_gemma":[0.8851612,0.00026697296,0.110267214,0.00024936072,0.00017097434,0.00006936758,0.0000684419,0.00005518469,0.003691255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997044,0.000072305535,0.000022520764,0.00009937566,0.000059184327,0.000042080108],"domain_scores_gemma":[0.9986418,0.0008460167,0.00009769251,0.00014024948,0.00019495607,0.0000791985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978208,0.00052217155,0.0008336803,0.00047337732,0.00032801586,0.0009672675,0.0016511801,0.0011891956,0.0023036792],"category_scores_gemma":[0.003567021,0.00038277855,0.00068736065,0.00058754213,0.00055794977,0.00189399,0.001541316,0.0016009193,0.00035852962],"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.0006731428,0.00061479723,0.0028158142,0.00021281694,0.00033790013,0.00033306665,0.00025102103,0.3333901,0.044414226,0.07056249,0.0045107906,0.54188377],"study_design_scores_gemma":[0.0000099860135,0.000031897573,0.00020954374,0.0000036865188,0.000015509682,0.000018403367,0.0000026796781,0.9937494,0.0013125003,0.0044638016,0.0001765089,0.0000061272144],"about_ca_topic_score_codex":0.0026126935,"about_ca_topic_score_gemma":0.0024296772,"teacher_disagreement_score":0.0026126935,"about_ca_system_score_codex":0.0007137692,"about_ca_system_score_gemma":0.00047046234,"threshold_uncertainty_score":0.0077065825},"labels":[],"label_agreement":null},{"id":"W4388655764","doi":"10.1007/978-3-031-48232-8_34","title":"A Machine Learning Approach to Predict Cyclists’ Functional Threshold Power","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Performance and Training","field":"Medicine","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":"Oakville Public Library","funders":"","keywords":"File Transfer Protocol; Computer science; Logistic regression; Power (physics); Statistics; Machine learning; Data mining; Mathematics; World Wide Web","score_opus":0.03181030045212483,"score_gpt":0.25345004075597277,"score_spread":0.22163974030384795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388655764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057009157,0.0017205983,0.93183285,0.00052823994,0.00024815858,0.000060158764,0.0004145673,0.00096838584,0.0072178817],"genre_scores_gemma":[0.7292769,0.0010525318,0.24571945,0.00026734895,0.00033603853,0.00018906944,0.00090947066,0.00011029438,0.022138912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986863,0.000022386488,0.000008694089,0.000051136365,0.000030997384,0.000018191791],"domain_scores_gemma":[0.9996069,0.00026819066,0.000022160593,0.000019242903,0.00007290278,0.000010617995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048644596,0.0005338068,0.00057081657,0.0008494767,0.00030544645,0.00072286086,0.00084954716,0.0008114749,0.0031561],"category_scores_gemma":[0.001079775,0.00024368153,0.0006010532,0.0008635638,0.00022645446,0.00052197673,0.0003193424,0.00084839,0.0011283003],"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.00014272511,0.00022278797,0.004771706,0.0000769669,0.00013247409,0.000106281695,0.00007165529,0.3528296,0.005242323,0.0065641506,0.0057755876,0.62406373],"study_design_scores_gemma":[0.00000311064,0.000028679975,0.0015716508,0.000008802127,0.000013697407,0.000028115976,0.000010208115,0.99417406,0.00051837723,0.002938425,0.0006981131,0.0000067768547],"about_ca_topic_score_codex":0.006494771,"about_ca_topic_score_gemma":0.0061167656,"teacher_disagreement_score":0.006494771,"about_ca_system_score_codex":0.00050051144,"about_ca_system_score_gemma":0.00041097408,"threshold_uncertainty_score":0.012913942},"labels":[],"label_agreement":null},{"id":"W4388655765","doi":"10.1007/978-3-031-48232-8_21","title":"Hebbian Learning-Guided Random Walks for Enhanced Community Detection in Correlation-Based Brain Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Neurotypical; Computer science; Hebbian theory; Artificial intelligence; Correlation; Machine learning; Random walk; Process (computing); Preprocessor; Artificial neural network; Autism spectrum disorder; Autism; Mathematics; Statistics; Psychology","score_opus":0.03980718222255819,"score_gpt":0.2726456854297022,"score_spread":0.232838503207144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388655765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021576105,0.00045241864,0.97622776,0.00014784183,0.00004413121,0.00002722062,0.00004904625,0.0005864699,0.0008890942],"genre_scores_gemma":[0.5220176,0.0006256651,0.4696065,0.00018024594,0.00012668928,0.00012021944,0.00029189113,0.00041383944,0.0066173594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996581,0.00011501077,0.000017251394,0.00009794929,0.00006745754,0.00004425725],"domain_scores_gemma":[0.9972773,0.0019771648,0.00015070086,0.00019708535,0.00026247476,0.00013523691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662666,0.00066493603,0.0012599203,0.00104663,0.000611743,0.0009470671,0.002190017,0.0017382586,0.002445696],"category_scores_gemma":[0.00490212,0.0006150321,0.0007680052,0.0011342462,0.00089340174,0.0019605649,0.0014242491,0.0017469724,0.00064310397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018810638,0.00011936556,0.0007941008,0.00017181726,0.00011420724,0.00011250141,0.00013213976,0.7725867,0.011617719,0.037736803,0.0037226474,0.17270389],"study_design_scores_gemma":[0.0000027407355,0.000007673501,0.00004811134,0.0000022877305,0.0000026017249,0.000010337677,0.0000022426495,0.9935674,0.00041693076,0.0058363373,0.00010009388,0.0000032482913],"about_ca_topic_score_codex":0.005927621,"about_ca_topic_score_gemma":0.009403049,"teacher_disagreement_score":0.005927621,"about_ca_system_score_codex":0.000912802,"about_ca_system_score_gemma":0.0006983898,"threshold_uncertainty_score":0.011786222},"labels":[],"label_agreement":null},{"id":"W4388678018","doi":"10.1007/978-3-031-48232-8_43","title":"Machine Learning for Time Series Forecasting Using State Space Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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 Calgary","funders":"","keywords":"Computer science; Autoregressive model; Time series; Series (stratigraphy); State space; Artificial intelligence; Model selection; Machine learning; Flexibility (engineering); State-space representation; Selection (genetic algorithm); Strengths and weaknesses; Data mining; Algorithm; Econometrics; Mathematics; Statistics","score_opus":0.04094344013326841,"score_gpt":0.24005634683816485,"score_spread":0.19911290670489645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388678018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027123273,0.0064030946,0.98411405,0.000273138,0.00028808182,0.00001649174,0.000114191644,0.00082630204,0.0052523627],"genre_scores_gemma":[0.2888408,0.015170885,0.6398958,0.00024660944,0.000998893,0.00023842898,0.001539856,0.00057543616,0.05249338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979573,0.000060035316,0.000018060837,0.00004732032,0.00006632009,0.000012544293],"domain_scores_gemma":[0.99952257,0.00034929454,0.000021686432,0.000049377653,0.00005025392,0.00000683329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017335,0.00079347804,0.0009615642,0.0004376683,0.00020017812,0.0008788765,0.0007854425,0.0008579682,0.0056143133],"category_scores_gemma":[0.001510435,0.0004234613,0.00084901706,0.0010360078,0.00031324622,0.0011794594,0.0004740375,0.0019163387,0.0027820533],"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.0000752923,0.000079050194,0.00035813794,0.00042683136,0.00013930126,0.00008908447,0.00007679884,0.45868763,0.0041753375,0.0625938,0.013790765,0.459508],"study_design_scores_gemma":[0.0000036074457,0.000013301113,0.00012384323,0.000022228867,0.000012066002,0.000019415505,0.000003495143,0.9713433,0.00066243415,0.022758525,0.0050304965,0.0000073194888],"about_ca_topic_score_codex":0.0022725437,"about_ca_topic_score_gemma":0.0020411566,"teacher_disagreement_score":0.0056143133,"about_ca_system_score_codex":0.00041388822,"about_ca_system_score_gemma":0.0002614781,"threshold_uncertainty_score":0.018781722},"labels":[],"label_agreement":null},{"id":"W4388795452","doi":"10.1007/978-3-031-45608-4_14","title":"A Comparison of Different Marginalization Operations in Simple Propagation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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 Regina","funders":"","keywords":"Simple (philosophy); Computer science; Belief propagation; Algorithm; Bayesian network; Variable elimination; Inference; Probabilistic logic; SIMPLE algorithm; Variable (mathematics); Graphical model; Tree (set theory); Set (abstract data type); Clique; Propagation of uncertainty; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.046381581917479604,"score_gpt":0.3092171933386444,"score_spread":0.2628356114211648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388795452","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.026335126,0.0009828205,0.96028036,0.00030362792,0.00016048482,0.0001141989,0.00019451247,0.0014532836,0.010175614],"genre_scores_gemma":[0.26540643,0.0015031719,0.7243459,0.00019431066,0.00014830979,0.00018480701,0.0005783084,0.0016476054,0.0059910715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741447,0.0012692412,0.00016442196,0.0002490875,0.0006880245,0.0002146695],"domain_scores_gemma":[0.9761379,0.019494127,0.0003399196,0.0025116384,0.0011468154,0.00036962147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061148005,0.0009361214,0.0015033516,0.0017381997,0.0010629487,0.0035328516,0.0028944432,0.0016317173,0.012975453],"category_scores_gemma":[0.02493899,0.0005973439,0.0015064204,0.003510109,0.002304964,0.008893663,0.0024074444,0.0019415525,0.0014516189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011496897,0.0003016574,0.0005530895,0.0005727055,0.00011303072,0.00007096572,0.000570656,0.051706705,0.0054732263,0.57934743,0.0054754554,0.3546653],"study_design_scores_gemma":[0.000151341,0.00025853654,0.0011119619,0.00009534694,0.00020293289,0.00018675505,0.0002075541,0.49187717,0.009206829,0.4888368,0.007741443,0.00012329378],"about_ca_topic_score_codex":0.0027729494,"about_ca_topic_score_gemma":0.0030262736,"teacher_disagreement_score":0.012975453,"about_ca_system_score_codex":0.0009987777,"about_ca_system_score_gemma":0.0014764336,"threshold_uncertainty_score":0.0434072},"labels":[],"label_agreement":null},{"id":"W4388853931","doi":"10.1007/978-3-031-48424-7","title":"Service-Oriented Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Michigan-Dearborn; Fachhochschule Bielefeld; Universidad de Extremadura; Rijksuniversiteit Groningen; National Institute of Informatics; Zayed University; Université de Paris; Gran Sasso Science Institute; Ahmedabad University; Högskolan i Skövde; Technische Universität Berlin; Université François-Rabelais; Università di Pisa; Peking University; Universidad de la República Uruguay; Robert Bosch; Universität Bielefeld; Hainan University; Zhejiang University; Université de Toulouse; Technische Universität Wien; Sapienza Università di Roma; University of South Australia; Universität Potsdam; Fudan University; Aix-Marseille Université; Swinburne University of Technology; University of Jeddah; Tianjin University; Deakin University; Universität Ulm; Technische Universiteit Eindhoven; Centre National de la Recherche Scientifique; Ulsan National Institute of Science and Technology; Macquarie University; University of Cyprus; University of Wollongong; Augusta University; Universidad de Málaga; Universidad de Castilla-La Mancha; Universidade de São Paulo; RMIT University; City University of Hong Kong; Universität Stuttgart; Cyprus University of Technology; Polytechnique Montréal; Université Claude Bernard Lyon 1; Norges Teknisk-Naturvitenskapelige Universitet; Università degli Studi di Urbino Carlo Bo; Universidad de Sevilla; Université de Lorraine","keywords":"Computer science; Big data; Focus (optics); Analytics; Service (business); Data science; Internet of Things; Blockchain; World Wide Web; Computer security; Operating system","score_opus":0.04419662938800491,"score_gpt":0.2776134602626281,"score_spread":0.23341683087462323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388853931","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053563975,0.010377394,0.44777176,0.004185458,0.0027103464,0.00021843087,0.00065625535,0.004403706,0.5243202],"genre_scores_gemma":[0.14642426,0.017446991,0.28490406,0.0020682858,0.0020262033,0.00037289,0.003690689,0.0023291493,0.54073745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946946,0.000080305086,0.000025501697,0.00008508749,0.0002833168,0.000056286506],"domain_scores_gemma":[0.9996001,0.000102840575,0.000013166178,0.0001472338,0.00009173754,0.000044996414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049594685,0.00095731945,0.000706648,0.00085720856,0.00079136225,0.0033131815,0.0008406002,0.00070805213,0.025955798],"category_scores_gemma":[0.0011114934,0.00042396618,0.00050345674,0.002143228,0.0009498965,0.003291629,0.0012526326,0.0016676957,0.016167777],"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.000059089052,0.000059618178,0.000120770186,0.00017786874,0.00002132737,0.00007624409,0.00018415673,0.002315052,0.0028341047,0.57211035,0.12384388,0.29819754],"study_design_scores_gemma":[0.000015134661,0.0000307845,0.00018017415,0.00008714679,0.000013937956,0.00021087466,0.00006882876,0.01482829,0.0017637033,0.43762475,0.54516315,0.000013279717],"about_ca_topic_score_codex":0.0013662246,"about_ca_topic_score_gemma":0.0017125208,"teacher_disagreement_score":0.025955798,"about_ca_system_score_codex":0.0009043812,"about_ca_system_score_gemma":0.0009978918,"threshold_uncertainty_score":0.086830795},"labels":[],"label_agreement":null},{"id":"W4388854325","doi":"10.1007/978-3-031-48312-7_44","title":"Self-supervised Speaker Verification Employing Augmentation Mix and Self-augmented Training-Based Clustering","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Cluster analysis; Embedding; Artificial intelligence; Dependency (UML); Noise (video); Speaker recognition; Representation (politics); Pattern recognition (psychology); Data mining; Machine learning; Speech recognition; Image (mathematics)","score_opus":0.0421863035107793,"score_gpt":0.25844806115425595,"score_spread":0.21626175764347666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388854325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02861932,0.0003521745,0.96406156,0.00007436642,0.00015531476,0.00008932417,0.00016942246,0.0039812615,0.002497327],"genre_scores_gemma":[0.29571462,0.0002534228,0.68939424,0.00014596882,0.00011644331,0.00015352132,0.0011933522,0.00062274706,0.012405652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986064,0.00026645858,0.00006551006,0.0004871357,0.00042900332,0.00014548493],"domain_scores_gemma":[0.99875534,0.00026925787,0.00007442276,0.00045710077,0.00039395367,0.000049972983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012025486,0.0010001485,0.0013998775,0.00074424455,0.00068321906,0.0009587343,0.0016126267,0.0011595843,0.003208265],"category_scores_gemma":[0.0015681104,0.0005906617,0.001378614,0.0006848812,0.00058891013,0.0014900309,0.0021142773,0.0012414639,0.0044123414],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000686304,0.00025484458,0.001161453,0.00014484958,0.00017461865,0.00009349061,0.00015796903,0.031710826,0.21473,0.0020245952,0.004262501,0.74459857],"study_design_scores_gemma":[0.000018763076,0.00017084471,0.0020993608,0.000015469228,0.00007890515,0.0003525392,0.00005017181,0.8674537,0.12503123,0.0013249838,0.0033557308,0.000048349943],"about_ca_topic_score_codex":0.0017016813,"about_ca_topic_score_gemma":0.0045147943,"teacher_disagreement_score":0.003208265,"about_ca_system_score_codex":0.0003127002,"about_ca_system_score_gemma":0.0009530322,"threshold_uncertainty_score":0.01073277},"labels":[],"label_agreement":null},{"id":"W4388878319","doi":"10.1007/978-3-031-48421-6","title":"Service-Oriented Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Michigan-Dearborn; Fachhochschule Bielefeld; Universidad de Extremadura; Rijksuniversiteit Groningen; National Institute of Informatics; Zayed University; Université de Paris; Gran Sasso Science Institute; Ahmedabad University; Högskolan i Skövde; Technische Universität Berlin; Université François-Rabelais; Università di Pisa; Peking University; Universidad de la República Uruguay; Robert Bosch; Universität Bielefeld; Hainan University; Zhejiang University; Université de Toulouse; Technische Universität Wien; Sapienza Università di Roma; University of South Australia; Universität Potsdam; Fudan University; Aix-Marseille Université; Swinburne University of Technology; University of Jeddah; Tianjin University; Deakin University; Universität Ulm; Technische Universiteit Eindhoven; Centre National de la Recherche Scientifique; Ulsan National Institute of Science and Technology; Macquarie University; University of Cyprus; University of Wollongong; Augusta University; Universidad de Málaga; Universidad de Castilla-La Mancha; Universidade de São Paulo; RMIT University; City University of Hong Kong; Universität Stuttgart; Cyprus University of Technology; Polytechnique Montréal; Université Claude Bernard Lyon 1; Norges Teknisk-Naturvitenskapelige Universitet; Università degli Studi di Urbino Carlo Bo; Universidad de Sevilla; Université de Lorraine","keywords":"Computer science; Big data; Focus (optics); Analytics; Data science; Service (business); Internet of Things; Blockchain; World Wide Web; Computer security; Operating system","score_opus":0.04419662938800491,"score_gpt":0.2776134602626281,"score_spread":0.23341683087462323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878319","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053563975,0.010377394,0.44777176,0.004185458,0.0027103464,0.00021843087,0.00065625535,0.004403706,0.5243202],"genre_scores_gemma":[0.14642426,0.017446991,0.28490406,0.0020682858,0.0020262033,0.00037289,0.003690689,0.0023291493,0.54073745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946946,0.000080305086,0.000025501697,0.00008508749,0.0002833168,0.000056286506],"domain_scores_gemma":[0.9996001,0.000102840575,0.000013166178,0.0001472338,0.00009173754,0.000044996414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049594685,0.00095731945,0.000706648,0.00085720856,0.00079136225,0.0033131815,0.0008406002,0.00070805213,0.025955798],"category_scores_gemma":[0.0011114934,0.00042396618,0.00050345674,0.002143228,0.0009498965,0.003291629,0.0012526326,0.0016676957,0.016167777],"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.000059089052,0.000059618178,0.000120770186,0.00017786874,0.00002132737,0.00007624409,0.00018415673,0.002315052,0.0028341047,0.57211035,0.12384388,0.29819754],"study_design_scores_gemma":[0.000015134661,0.0000307845,0.00018017415,0.00008714679,0.000013937956,0.00021087466,0.00006882876,0.01482829,0.0017637033,0.43762475,0.54516315,0.000013279717],"about_ca_topic_score_codex":0.0013662246,"about_ca_topic_score_gemma":0.0017125208,"teacher_disagreement_score":0.025955798,"about_ca_system_score_codex":0.0009043812,"about_ca_system_score_gemma":0.0009978918,"threshold_uncertainty_score":0.086830795},"labels":[],"label_agreement":null},{"id":"W4388878572","doi":"10.1007/978-3-031-48312-7_36","title":"Multi-task Learning over Mixup Variants for the Speaker Verification Task","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Speech recognition; Robustness (evolution); Artificial intelligence; Regularization (linguistics); Machine learning","score_opus":0.041228708833597756,"score_gpt":0.2696667201367999,"score_spread":0.22843801130320213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025888545,0.0017028162,0.9677839,0.00016881055,0.000188928,0.000065980195,0.00024968886,0.0018423664,0.002108932],"genre_scores_gemma":[0.48999137,0.0013059751,0.48478147,0.00041862062,0.00054635195,0.0002572282,0.0025370086,0.00093278213,0.019229313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880326,0.00037609547,0.00007903941,0.0003609776,0.00021748581,0.00016302423],"domain_scores_gemma":[0.99790466,0.0012885524,0.00007313131,0.00032410055,0.00029234844,0.00011714559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022660615,0.0016322263,0.001396526,0.00065334555,0.00049442647,0.0009692158,0.0015093992,0.0012845852,0.006585743],"category_scores_gemma":[0.0032849354,0.0005056011,0.0011487117,0.0008238099,0.0004438114,0.0020025917,0.0022133926,0.0023263588,0.0033389295],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009976128,0.00020324958,0.0006299962,0.00020408712,0.00017511054,0.000111091744,0.00006147087,0.04047851,0.040901743,0.002763397,0.0058555817,0.9076182],"study_design_scores_gemma":[0.000040179006,0.00029756554,0.0009996892,0.000023393803,0.00010938642,0.00023378828,0.000041501422,0.9639511,0.022648351,0.007851917,0.0037685125,0.00003459705],"about_ca_topic_score_codex":0.0019882983,"about_ca_topic_score_gemma":0.00314878,"teacher_disagreement_score":0.006585743,"about_ca_system_score_codex":0.00027137858,"about_ca_system_score_gemma":0.00073043094,"threshold_uncertainty_score":0.022031546},"labels":[],"label_agreement":null},{"id":"W4388878581","doi":"10.1007/978-3-031-48312-7_2","title":"Audio-Visual Speaker Verification via Joint Cross-Attention","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Leverage (statistics); Modal; Speech recognition; Audio visual; Concatenation (mathematics); Feature (linguistics); Artificial intelligence; Joint (building); Modalities; Pattern recognition (psychology); Multimedia","score_opus":0.02622826901695002,"score_gpt":0.28138639927008885,"score_spread":0.2551581302531388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020357681,0.0017717641,0.9633743,0.00016221544,0.00041994505,0.00010911765,0.00032517908,0.0051992177,0.008280398],"genre_scores_gemma":[0.37290174,0.0016141216,0.59340715,0.0005720419,0.00041901282,0.00018412218,0.0018277945,0.00093090965,0.028143112],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988141,0.00020873647,0.00006181163,0.00031564318,0.00040353287,0.0001962675],"domain_scores_gemma":[0.9989667,0.00041925046,0.000053399122,0.0001983144,0.00030568373,0.000056748555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013195776,0.0015637632,0.0015485133,0.0010420112,0.00057190435,0.0014035191,0.0013431982,0.0016324959,0.01198305],"category_scores_gemma":[0.0020591158,0.0006013082,0.001141146,0.00084677985,0.0003722702,0.0016019234,0.0028990034,0.001212291,0.010297953],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008042855,0.00011559867,0.00035544267,0.00016875018,0.00012606953,0.00017714711,0.00004761443,0.0040653865,0.23739909,0.001232068,0.0041064415,0.751402],"study_design_scores_gemma":[0.00010650167,0.0003367918,0.005974334,0.000059615675,0.00034934212,0.0015764128,0.000109723864,0.59510034,0.38172188,0.004368343,0.010211148,0.00008562337],"about_ca_topic_score_codex":0.0022023576,"about_ca_topic_score_gemma":0.005119693,"teacher_disagreement_score":0.01198305,"about_ca_system_score_codex":0.00030964043,"about_ca_system_score_gemma":0.00080535887,"threshold_uncertainty_score":0.040087223},"labels":[],"label_agreement":null},{"id":"W4388878632","doi":"10.1007/978-3-031-48312-7_6","title":"Improvements in Language Modeling, Voice Activity Detection, and Lexicon in OpenASR21 Low Resource Languages","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Lexicon; Word error rate; Artificial intelligence; Natural language processing; Vocabulary; Speech recognition; Phone; Resource (disambiguation); Linguistics","score_opus":0.013351292275710512,"score_gpt":0.27445992424551624,"score_spread":0.2611086319698057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029463766,0.0004847472,0.8693701,0.0005991597,0.00034256728,0.00015618066,0.0032419967,0.08295804,0.0133834565],"genre_scores_gemma":[0.24580348,0.00038273845,0.7045876,0.00058738806,0.00029278724,0.00029898837,0.015374265,0.013448707,0.019224105],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965842,0.0008848679,0.000426389,0.00085349515,0.0010112652,0.00023975233],"domain_scores_gemma":[0.9950275,0.0017453291,0.00019917662,0.0016082053,0.0013186703,0.000101152786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021791977,0.0014389922,0.0013045968,0.0014068118,0.0007869978,0.0034666706,0.003309246,0.00082728383,0.01829352],"category_scores_gemma":[0.0065988363,0.0010735804,0.0020630695,0.0011627593,0.00074191234,0.0070891315,0.002547617,0.002290032,0.015516695],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008010167,0.00038021174,0.0031502692,0.00061197503,0.00015541751,0.0003700116,0.0006863204,0.029257085,0.08236356,0.053000305,0.030904662,0.7983191],"study_design_scores_gemma":[0.0001537323,0.00036787044,0.0019370017,0.0001158369,0.0002918988,0.0007968863,0.00035019487,0.6795689,0.1279314,0.05611392,0.13211928,0.00025304945],"about_ca_topic_score_codex":0.0066830404,"about_ca_topic_score_gemma":0.011746079,"teacher_disagreement_score":0.01829352,"about_ca_system_score_codex":0.0010494316,"about_ca_system_score_gemma":0.001784936,"threshold_uncertainty_score":0.061197937},"labels":[],"label_agreement":null},{"id":"W4388878685","doi":"10.1007/978-3-031-48312-7_25","title":"Audio DeepFake Detection Employing Multiple Parametric Exponential Linear Units","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Activation function; Parametric statistics; Process (computing); Residual; Exponential function; Artificial intelligence; Speech recognition; Function (biology); Deep learning; Task (project management); Parametric model; Sign (mathematics); Pattern recognition (psychology); Artificial neural network; Algorithm; Mathematics","score_opus":0.052630643896907775,"score_gpt":0.2539528112894271,"score_spread":0.20132216739251932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018962033,0.00052431773,0.9759907,0.00009209911,0.00010379026,0.000037142232,0.000105565865,0.001253762,0.0029306954],"genre_scores_gemma":[0.3805337,0.00071512704,0.592814,0.00027741605,0.0001332706,0.00009084842,0.00056866487,0.00021257967,0.024654418],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975795,0.000030475365,0.000012944731,0.00005034424,0.000104390514,0.000043843447],"domain_scores_gemma":[0.99959356,0.00017162989,0.000024212386,0.000059682523,0.00012278487,0.00002825485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044453522,0.00088076864,0.00047654883,0.0006528778,0.00028947587,0.00076959433,0.00070904545,0.0008451581,0.006756983],"category_scores_gemma":[0.0008715982,0.00032058943,0.00044420373,0.00046313214,0.00028244226,0.0010920266,0.0012791242,0.00089231157,0.0031065575],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045420154,0.00007285565,0.0006036093,0.00014730023,0.000040612238,0.00011907061,0.00003787434,0.008332494,0.16777568,0.0035295698,0.0017810204,0.81710577],"study_design_scores_gemma":[0.00004416575,0.00043180786,0.002668362,0.0000865158,0.00008720001,0.00072905986,0.00006967563,0.6933302,0.28324872,0.005241507,0.01401072,0.000052052128],"about_ca_topic_score_codex":0.0008379502,"about_ca_topic_score_gemma":0.003255334,"teacher_disagreement_score":0.006756983,"about_ca_system_score_codex":0.00026270328,"about_ca_system_score_gemma":0.00041917994,"threshold_uncertainty_score":0.022604406},"labels":[],"label_agreement":null},{"id":"W4388880985","doi":"10.1007/978-3-031-48316-5_35","title":"Using Derived Sequential Pattern Mining for E-Commerce Recommendations in Multiple Sources","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Windsor; University of Guelph","funders":"","keywords":"Computer science; Collaborative filtering; Recommender system; Extension (predicate logic); Information retrieval; Precision and recall; Process (computing); Quality (philosophy); Data mining; Recall; Programming language","score_opus":0.10781450405901374,"score_gpt":0.31614639619028356,"score_spread":0.20833189213126982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388880985","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.07765259,0.0024355045,0.91010815,0.0003755157,0.00023034286,0.00039650674,0.002736117,0.0033236865,0.0027416456],"genre_scores_gemma":[0.26066646,0.0011678862,0.72651315,0.00012344915,0.00021408254,0.00026588378,0.0062888702,0.00019494967,0.0045652324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779665,0.00040547378,0.00029842494,0.00058617414,0.0007913876,0.00012190482],"domain_scores_gemma":[0.9938334,0.0038111876,0.00033895788,0.000656082,0.001231976,0.00012840152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016575507,0.0011941702,0.001533961,0.006712273,0.00096841034,0.0018580465,0.0016359136,0.0013323424,0.0023192908],"category_scores_gemma":[0.0078209005,0.0006997142,0.0019978695,0.0073665404,0.00030739824,0.0026554049,0.0010386291,0.0014107649,0.00225396],"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.00071325,0.0007624687,0.029432613,0.0006537767,0.00088252075,0.0010177104,0.00032312094,0.024263795,0.013767667,0.003445608,0.008476903,0.9162607],"study_design_scores_gemma":[0.00007451397,0.00023956956,0.0056366515,0.000097288954,0.0004726242,0.0010612566,0.00020350395,0.96585,0.008765419,0.011786073,0.0057567772,0.00005645875],"about_ca_topic_score_codex":0.0064722076,"about_ca_topic_score_gemma":0.013688326,"teacher_disagreement_score":0.006712273,"about_ca_system_score_codex":0.00043438096,"about_ca_system_score_gemma":0.0010431564,"threshold_uncertainty_score":0.01286906},"labels":[],"label_agreement":null},{"id":"W4388917353","doi":"10.1007/978-981-99-8311-7_15","title":"TorchProbe: Fuzzing Dynamic Deep Learning Compilers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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; Mila - Quebec Artificial Intelligence Institute; Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Python (programming language); Compiler; Deep learning; Programming language; Artificial intelligence","score_opus":0.019919948858547153,"score_gpt":0.260890147370234,"score_spread":0.24097019851168688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388917353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08318569,0.0009333366,0.8202026,0.00067700364,0.00047267904,0.00013453352,0.000570624,0.08369989,0.010123687],"genre_scores_gemma":[0.5985882,0.0003232371,0.37709495,0.00073228724,0.00008331022,0.00014643934,0.0010382467,0.0100002065,0.011993089],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986331,0.00027681186,0.00008828442,0.00029152798,0.000500622,0.00020968616],"domain_scores_gemma":[0.9966074,0.0015631996,0.00019833837,0.0012019721,0.0003567145,0.0000723854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010961012,0.0013933225,0.0006310639,0.0009700735,0.00055112015,0.0010900659,0.002634662,0.0012473803,0.009072074],"category_scores_gemma":[0.00567614,0.0012870186,0.0009388305,0.00068495685,0.0013628172,0.0042091073,0.0025174732,0.0025773947,0.0015740149],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010789289,0.0002449774,0.0037632205,0.00057048915,0.0001915342,0.00038748278,0.000321067,0.17290442,0.052435275,0.051525816,0.030361725,0.68621504],"study_design_scores_gemma":[0.00009919237,0.0002030958,0.00069246977,0.0001534696,0.000096226766,0.0002924854,0.000068923284,0.81646216,0.096318595,0.067483306,0.018066904,0.00006323067],"about_ca_topic_score_codex":0.0022953704,"about_ca_topic_score_gemma":0.0045968955,"teacher_disagreement_score":0.009072074,"about_ca_system_score_codex":0.0013593672,"about_ca_system_score_gemma":0.001577178,"threshold_uncertainty_score":0.030349076},"labels":[],"label_agreement":null},{"id":"W4388982268","doi":"10.1007/978-3-031-48495-7","title":"Virtual Reality and Mixed Reality","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Universität Rostock; École Centrale de Lyon; Tartu Ülikool; Université Paris-Saclay; Aix-Marseille Université; Tallinna Tehnikaülikool; Centre National de la Recherche Scientifique; Zürcher Hochschule für Angewandte Wissenschaften; Universität Bremen; Heriot-Watt University; Deutsche Gesetzliche Unfallversicherung; Université de Lille; Hochschule Darmstadt; University of Central Florida; RWTH Aachen University; University of Minnesota; Technische Universität Chemnitz; Universidad de Cantabria; Chuo University","keywords":"Virtual reality; Mixed reality; Augmented reality; Computer science; Artificial reality; Computer-mediated reality; Human–computer interaction; Immersion (mathematics); Computer graphics (images); Mathematics","score_opus":0.03057138972891595,"score_gpt":0.2862319445362256,"score_spread":0.25566055480730965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388982268","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004161538,0.14997777,0.16420622,0.0010078478,0.0038624827,0.0000557003,0.0002313485,0.00095306657,0.67554396],"genre_scores_gemma":[0.03760735,0.046015605,0.03041865,0.00044184172,0.0010577026,0.00006736565,0.00024778928,0.00032271972,0.88382095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999767,0.00004795607,0.000008100446,0.00003197654,0.00012437944,0.000020480074],"domain_scores_gemma":[0.9998312,0.0000790188,0.000008046883,0.000028446795,0.000034104785,0.000019099823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002345219,0.0009727682,0.0007141253,0.0010508818,0.00042756175,0.0023978907,0.0008030679,0.00097589754,0.06289746],"category_scores_gemma":[0.0006351407,0.00044076695,0.0004360564,0.0011921785,0.0006602404,0.0024462373,0.0016414266,0.0009705201,0.017209962],"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.00012204797,0.00006531692,0.00011425156,0.0006609949,0.00003196782,0.00024981183,0.00035410654,0.002348724,0.009363862,0.23875745,0.09836628,0.64956516],"study_design_scores_gemma":[0.000010231022,0.00010639762,0.00066001166,0.000316666,0.000025900823,0.0016646079,0.00023979454,0.0043829083,0.0023721915,0.058508582,0.9316809,0.00003178396],"about_ca_topic_score_codex":0.00057351956,"about_ca_topic_score_gemma":0.001103149,"teacher_disagreement_score":0.06289746,"about_ca_system_score_codex":0.00025146283,"about_ca_system_score_gemma":0.00021531782,"threshold_uncertainty_score":0.21041298},"labels":[],"label_agreement":null},{"id":"W4389009069","doi":"10.1007/978-981-99-8388-9_14","title":"3RE-Net: Joint Loss-REcovery and Super-REsolution Neural Network for REal-Time Video","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Packet loss; Feature (linguistics); Artificial intelligence; Benchmark (surveying); Frame (networking); Real-time computing; Joint (building); Computer vision; Network packet; Telecommunications; Computer network","score_opus":0.02047339269934187,"score_gpt":0.26040401186756545,"score_spread":0.23993061916822359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389009069","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.0042963694,0.0009399311,0.9829707,0.00016707949,0.0002190771,0.00005826074,0.0005775776,0.0072521605,0.0035188792],"genre_scores_gemma":[0.081240036,0.0009206527,0.88187385,0.00036562307,0.00018883299,0.0001602643,0.003084499,0.0013248489,0.03084136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.000025933898,0.000010035915,0.000054013428,0.00010522529,0.000029044728],"domain_scores_gemma":[0.9997907,0.000053751337,0.000014899683,0.00005693642,0.000069439695,0.0000142433655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061481143,0.0010109498,0.0006711668,0.0005417513,0.00024287967,0.00077056815,0.001742929,0.0012020384,0.010093021],"category_scores_gemma":[0.0009890491,0.00041731758,0.0005682305,0.0005636157,0.00028544854,0.0013097379,0.0010200333,0.001512555,0.0040936144],"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.00030028605,0.00011745351,0.0002483713,0.0001698969,0.00012169528,0.00011982262,0.000026634627,0.093579054,0.029925318,0.01028681,0.039503627,0.82560104],"study_design_scores_gemma":[0.000015437236,0.000053004325,0.00020085841,0.000015134206,0.000018709326,0.000094836,0.000004939441,0.9675281,0.016640661,0.00443636,0.0109763285,0.000015535195],"about_ca_topic_score_codex":0.003967978,"about_ca_topic_score_gemma":0.0077030896,"teacher_disagreement_score":0.010093021,"about_ca_system_score_codex":0.0004941433,"about_ca_system_score_gemma":0.0005120326,"threshold_uncertainty_score":0.03376454},"labels":[],"label_agreement":null},{"id":"W4389009937","doi":"10.1007/978-981-99-8391-9_5","title":"Reports, Observations, and Belief Change","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Computer science; Honesty; Set (abstract data type); Context (archaeology); Class (philosophy); Process (computing); Representation (politics); Key (lock); Operator (biology); Order (exchange); Artificial intelligence; Computer security; Psychology; Social psychology; Programming language","score_opus":0.05794831357193754,"score_gpt":0.2563156510575475,"score_spread":0.19836733748560997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389009937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16598901,0.019162925,0.47684357,0.03510599,0.0011579306,0.00017204559,0.0012560181,0.00079073303,0.2995217],"genre_scores_gemma":[0.95098215,0.0032971893,0.02807883,0.0006396222,0.00061511516,0.00010530628,0.00046977078,0.00007371874,0.015738195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966738,0.0013656857,0.00025524263,0.00063683174,0.00082436006,0.00024405574],"domain_scores_gemma":[0.9695561,0.022467356,0.002963141,0.0028164661,0.0017512453,0.0004456458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005406572,0.00047584617,0.00050288433,0.0016184888,0.0010115987,0.005772092,0.0015587088,0.0019973333,0.009341047],"category_scores_gemma":[0.039495233,0.00061116816,0.0007336456,0.001974194,0.006549775,0.011511746,0.0018206682,0.0034344902,0.00092394446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015538726,0.00004623193,0.002087144,0.00010138607,0.000035456073,0.00015530238,0.0019653977,0.0023095703,0.0002368345,0.95271033,0.0031780032,0.037018955],"study_design_scores_gemma":[0.000026891445,0.000025226978,0.0011102798,0.00004080549,0.00003052698,0.000110408015,0.0005832674,0.0046356567,0.00022866124,0.9877037,0.00548557,0.000018983284],"about_ca_topic_score_codex":0.0040286495,"about_ca_topic_score_gemma":0.0021019692,"teacher_disagreement_score":0.009341047,"about_ca_system_score_codex":0.0018566295,"about_ca_system_score_gemma":0.0007557062,"threshold_uncertainty_score":0.031248987},"labels":[],"label_agreement":null},{"id":"W4389010994","doi":"10.1007/978-3-031-48615-9_10","title":"Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Università Bocconi; Chinese University of Hong Kong; European Commission; National Science Foundation","keywords":"Computer science; Degree (music); Encryption; Pseudorandom number generator; Public-key cryptography; Theoretical computer science; Key (lock); Cryptography; Pseudorandom function family; Scheme (mathematics); Context (archaeology); Symmetric-key algorithm; Generator (circuit theory); Algorithm; Computer security; Mathematics","score_opus":0.03330693155059561,"score_gpt":0.253333217140938,"score_spread":0.22002628559034237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389010994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041543197,0.020648187,0.7026116,0.005481371,0.00078413787,0.00012120382,0.00024738646,0.0007424861,0.22782041],"genre_scores_gemma":[0.71288735,0.012359118,0.13680652,0.0010638164,0.0012975585,0.00022216082,0.0002866209,0.0002875153,0.1347894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993488,0.00021539579,0.00002384149,0.00010048687,0.00023591354,0.000075593794],"domain_scores_gemma":[0.9991874,0.00047753414,0.00004877872,0.00020107593,0.000059784204,0.000025388907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582299,0.00058145315,0.000645024,0.00071234955,0.0006374573,0.0018264967,0.00071337476,0.0007833111,0.005480917],"category_scores_gemma":[0.0020057696,0.00027812322,0.00039398568,0.0010300325,0.0025618307,0.0036335483,0.0012029507,0.0027870475,0.0023694716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003917051,0.000018257475,0.000053379295,0.00007076,0.0000043215937,0.000028178987,0.000054136402,0.002238199,0.00092224823,0.9576842,0.00331079,0.035576247],"study_design_scores_gemma":[0.000023325985,0.00002701674,0.00008007048,0.000024568753,0.000005822366,0.00018407512,0.0000138808045,0.006516853,0.001451627,0.96562463,0.026035957,0.000012265185],"about_ca_topic_score_codex":0.00020572965,"about_ca_topic_score_gemma":0.00024520766,"teacher_disagreement_score":0.005480917,"about_ca_system_score_codex":0.0009939636,"about_ca_system_score_gemma":0.0004941923,"threshold_uncertainty_score":0.018335462},"labels":[],"label_agreement":null},{"id":"W4389027105","doi":"10.1007/978-3-031-48618-0_11","title":"Lower Bounds on Assumptions Behind Registration-Based Encryption","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Obfuscation; Black box; Theoretical computer science; Cryptography; Public-key cryptography; Key (lock); Computer security; Artificial intelligence","score_opus":0.02521222336775681,"score_gpt":0.26161020030616955,"score_spread":0.23639797693841275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389027105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03769048,0.009287303,0.7687883,0.020007066,0.0018982152,0.0005477526,0.0029783847,0.001871397,0.1569311],"genre_scores_gemma":[0.7738826,0.017063782,0.13382731,0.0062529542,0.006540924,0.0021007566,0.00533257,0.0029377637,0.052061353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97214985,0.008773256,0.0013188461,0.003341725,0.008795565,0.0056207823],"domain_scores_gemma":[0.7228554,0.2297818,0.00645527,0.026701916,0.010409295,0.0037964014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022114558,0.0072554275,0.0072503397,0.0062516215,0.0064652506,0.015413816,0.013292368,0.008208805,0.03280148],"category_scores_gemma":[0.12233285,0.004668332,0.0062943827,0.008956009,0.012308968,0.051212702,0.018176613,0.030684851,0.010436829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018939753,0.00040593266,0.0012790614,0.00092290505,0.0002305482,0.00041145508,0.0005751892,0.06418299,0.0031256184,0.85581213,0.027022706,0.044137493],"study_design_scores_gemma":[0.00008960651,0.00010093513,0.00027727758,0.00023149076,0.00016644914,0.0002491737,0.00013430727,0.11736276,0.002027928,0.87486655,0.0044203796,0.00007313296],"about_ca_topic_score_codex":0.0018991261,"about_ca_topic_score_gemma":0.0015419929,"teacher_disagreement_score":0.03280148,"about_ca_system_score_codex":0.012361556,"about_ca_system_score_gemma":0.0055098566,"threshold_uncertainty_score":0.116954386},"labels":[],"label_agreement":null},{"id":"W4389095557","doi":"10.1007/978-3-031-49252-5_6","title":"IDPP: Imbalanced Datasets Pipelines in Pyrus","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Python (programming language); Pipeline transport; Pipeline (software); Preprocessor; Code reuse; Code (set theory); Data mining; Analytics; Machine learning; Programming language; Database; Software engineering; Software","score_opus":0.09353235581372939,"score_gpt":0.35940797300763094,"score_spread":0.26587561719390157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389095557","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018347297,0.0010938769,0.17182985,0.0007061906,0.0009155866,0.0008488434,0.08862152,0.7042615,0.013375256],"genre_scores_gemma":[0.10025413,0.0007660445,0.49460006,0.0011798429,0.00026487943,0.0018785961,0.2928594,0.070201814,0.03799524],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858177,0.00015763109,0.00010441637,0.0005065372,0.00051506096,0.00013459942],"domain_scores_gemma":[0.99894494,0.00022599072,0.00004668103,0.00045922215,0.00020249235,0.00012072727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019360284,0.002251992,0.0012813532,0.0024500915,0.0013308934,0.0025828665,0.002930437,0.00073840254,0.034494594],"category_scores_gemma":[0.004824865,0.0018090438,0.0020624746,0.0024199616,0.0005869175,0.0030726485,0.0032295252,0.0019275178,0.022851372],"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.0014791975,0.0003448481,0.0022522698,0.0005720607,0.00038042152,0.00022642879,0.0003614439,0.0100622745,0.012690258,0.0063572945,0.716971,0.24830247],"study_design_scores_gemma":[0.001082754,0.0004863236,0.0076719876,0.00019457834,0.00019167388,0.00043635778,0.00031700474,0.3548444,0.071088,0.050547767,0.5128279,0.00031126165],"about_ca_topic_score_codex":0.010009123,"about_ca_topic_score_gemma":0.012737486,"teacher_disagreement_score":0.034494594,"about_ca_system_score_codex":0.0010945044,"about_ca_system_score_gemma":0.0019326819,"threshold_uncertainty_score":0.11539596},"labels":[],"label_agreement":null},{"id":"W4389161392","doi":"10.1007/978-3-031-47969-4","title":"Advances in Visual Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Brookhaven National Laboratory; Peking University; Universidade do Porto; National Taiwan University; Simon Fraser University; Pacific Northwest National Laboratory; Inyuvesi Yakwazulu-Natali; Dartmouth College; École Polytechnique Fédérale de Lausanne; Meijo University; Nanyang Technological University; University of Louisiana at Lafayette; University of Wisconsin-Milwaukee; Los Alamos National Laboratory; Bournemouth University; University of Notre Dame; Tulane University; České Vysoké Učení Technické v Praze; Georgia State University; University of Oklahoma","keywords":"Computer science; Computer graphics (images); Visualization; Graphics; Computer graphics; Virtual reality; Human–computer interaction; Artificial intelligence","score_opus":0.018632008758280617,"score_gpt":0.31386025469316325,"score_spread":0.2952282459348826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389161392","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035421017,0.21483259,0.12357012,0.0045006904,0.010388699,0.00008782107,0.00047311105,0.002755614,0.63984925],"genre_scores_gemma":[0.03497366,0.10915308,0.036390126,0.0011748889,0.0027619982,0.000084119216,0.00072302646,0.0010649858,0.81367415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965453,0.000038820417,0.000014833546,0.000051966785,0.00020277286,0.000037059348],"domain_scores_gemma":[0.9995285,0.00013075204,0.000016618216,0.000090991685,0.00016304119,0.00007019333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043994212,0.00096824573,0.00071922754,0.0016095771,0.0005000493,0.0031330122,0.0010189028,0.0008143651,0.067912266],"category_scores_gemma":[0.0010907484,0.00042423807,0.00041728574,0.002088323,0.0007786219,0.0027871032,0.0018139724,0.001655799,0.027400434],"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.000042655844,0.000037952428,0.0000840758,0.0005249431,0.000017618391,0.000051268205,0.0001467311,0.0007584667,0.004740829,0.09638715,0.22721826,0.66999006],"study_design_scores_gemma":[0.0000071067284,0.000020842705,0.00024783486,0.00020907735,0.000010814229,0.00018423777,0.00007079795,0.002074975,0.0015623848,0.03465328,0.9609469,0.000011833702],"about_ca_topic_score_codex":0.001558605,"about_ca_topic_score_gemma":0.0025117514,"teacher_disagreement_score":0.067912266,"about_ca_system_score_codex":0.0007649431,"about_ca_system_score_gemma":0.0006710367,"threshold_uncertainty_score":0.22718918},"labels":[],"label_agreement":null},{"id":"W4389164040","doi":"10.1007/978-3-031-47969-4_20","title":"Domain Generalization for Foreground Segmentation Using Federated Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Forgetting; Generalization; Regularization (linguistics); Domain (mathematical analysis); Machine learning; Encoder; Object (grammar); Domain knowledge; Pattern recognition (psychology)","score_opus":0.05214545926654969,"score_gpt":0.31980614416135816,"score_spread":0.2676606848948085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389164040","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.00884259,0.00023515694,0.98722935,0.000059532114,0.000030700052,0.00003653476,0.00011831237,0.0027593395,0.00068847934],"genre_scores_gemma":[0.27931163,0.0003773183,0.7122833,0.00025371494,0.00008865692,0.00014058745,0.001886684,0.00060438435,0.0050536916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898726,0.00017521736,0.00005991291,0.00044365585,0.00017183015,0.00016213491],"domain_scores_gemma":[0.99842346,0.0005412494,0.00008120569,0.0005748045,0.000302474,0.000076934906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016582261,0.0013419572,0.0021398673,0.0017524384,0.0007459334,0.0013220268,0.003046524,0.0021616523,0.004521196],"category_scores_gemma":[0.002694833,0.0006882715,0.0022767587,0.0017228354,0.00094984355,0.0024099937,0.0032180913,0.002543653,0.0022800537],"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.0004472271,0.00025635844,0.0011048244,0.00012588793,0.00012902982,0.00013314877,0.00012404549,0.18235964,0.015833095,0.007779963,0.0060621533,0.7856447],"study_design_scores_gemma":[0.000010037244,0.000028217424,0.00015032919,0.000009566067,0.000015532296,0.000041577397,0.000021136615,0.9854732,0.0041893204,0.009240903,0.00081281835,0.0000073308724],"about_ca_topic_score_codex":0.0076631615,"about_ca_topic_score_gemma":0.0076669483,"teacher_disagreement_score":0.0076631615,"about_ca_system_score_codex":0.0011810501,"about_ca_system_score_gemma":0.0012900789,"threshold_uncertainty_score":0.015237093},"labels":[],"label_agreement":null},{"id":"W4389170220","doi":"10.1007/978-3-031-47969-4_40","title":"Strategic Incorporation of Synthetic Data for Performance Enhancement in Deep Learning A Case Study on Object Tracking Tasks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Task (project management); Variation (astronomy); Object (grammar); Tracking (education); Similarity (geometry); Machine learning; Synthetic data; Process (computing); Artificial neural network; Deep learning; Video tracking; Data mining; Pattern recognition (psychology); Image (mathematics)","score_opus":0.11178065121880408,"score_gpt":0.34066914054762276,"score_spread":0.22888848932881867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389170220","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.7946143,0.0014762677,0.1902936,0.0009787494,0.00017772909,0.00015754877,0.00042377843,0.001582459,0.010295632],"genre_scores_gemma":[0.93629044,0.00022088087,0.059961308,0.00007709635,0.000021525126,0.00004539831,0.00045931962,0.00011109066,0.0028129239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.00037011845,0.00003703545,0.000090817586,0.00014443572,0.00007621586],"domain_scores_gemma":[0.996209,0.0026484267,0.00009769991,0.00040798308,0.0005270399,0.00010983638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002121291,0.00063899223,0.00041014122,0.00028414358,0.00029801528,0.0010090782,0.0008592043,0.0009968005,0.001302694],"category_scores_gemma":[0.00604268,0.00020521421,0.00027153155,0.00065743463,0.0004888843,0.0009896655,0.000803035,0.0010633325,0.0004484028],"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.0022550276,0.0016168128,0.0065762345,0.00066920347,0.00015130382,0.00071566115,0.0006591621,0.3906376,0.057849623,0.007343138,0.008434552,0.5230916],"study_design_scores_gemma":[0.00008628314,0.0010212626,0.002162968,0.000044226792,0.00006358129,0.00022738738,0.00023115354,0.9355459,0.049496662,0.0057589174,0.005329674,0.000031941574],"about_ca_topic_score_codex":0.0026357472,"about_ca_topic_score_gemma":0.0039237794,"teacher_disagreement_score":0.0026357472,"about_ca_system_score_codex":0.0004351201,"about_ca_system_score_gemma":0.0005259569,"threshold_uncertainty_score":0.011218548},"labels":[],"label_agreement":null},{"id":"W4389170530","doi":"10.1007/978-3-031-47969-4_37","title":"Future Video Prediction from a Single Frame for Video Anomaly Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Université Laval","funders":"","keywords":"Computer science; Anomaly detection; Artificial intelligence; Benchmark (surveying); Task (project management); Computer vision; Frame (networking); Segmentation; Focus (optics); Motion (physics); Proxy (statistics); Pattern recognition (psychology); Machine learning","score_opus":0.01737283556606868,"score_gpt":0.23732635515744022,"score_spread":0.21995351959137155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389170530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060743622,0.0010382648,0.92944634,0.00021427829,0.00026833802,0.00009822227,0.001158921,0.0028665578,0.004165471],"genre_scores_gemma":[0.5849521,0.0012371028,0.40523675,0.000081713246,0.0002769585,0.00009216357,0.0024126535,0.00022168455,0.0054887203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982846,0.000010882773,0.000007548521,0.00005654851,0.00007633849,0.000020309642],"domain_scores_gemma":[0.9995803,0.00010655047,0.000050368137,0.00006882992,0.00016634022,0.000027521923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173726,0.00072506757,0.00059773686,0.0011978534,0.00027302577,0.00052344304,0.00074228115,0.00048114496,0.002422462],"category_scores_gemma":[0.001220401,0.00022518456,0.00031753967,0.0010193931,0.00013383603,0.00072879426,0.0003705948,0.00077185786,0.0015751468],"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.0003794263,0.00016976139,0.007771817,0.00010368155,0.000038620714,0.00023803575,0.000048293532,0.04074741,0.06549244,0.0024452927,0.008178855,0.8743863],"study_design_scores_gemma":[0.0000056342615,0.000075976626,0.003451198,0.000019262861,0.000029850959,0.00020210625,0.000021734002,0.97102326,0.019826869,0.0023585232,0.0029730995,0.000012614751],"about_ca_topic_score_codex":0.0039382344,"about_ca_topic_score_gemma":0.0050608558,"teacher_disagreement_score":0.0039382344,"about_ca_system_score_codex":0.00029721568,"about_ca_system_score_gemma":0.0003370561,"threshold_uncertainty_score":0.008103907},"labels":[],"label_agreement":null},{"id":"W4389170666","doi":"10.1007/978-3-031-47969-4_33","title":"I Got Your Emotion: Emotion Preserving Face De-identification Using Injection-Based Generative Adversarial Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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 Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Face (sociological concept); Identification (biology); Adversarial system; Expression (computer science); Image (mathematics); Generative grammar; Generative adversarial network; Pattern recognition (psychology); Facial expression; Facial recognition system; Computer vision","score_opus":0.03998592489892649,"score_gpt":0.27449350130762146,"score_spread":0.23450757640869496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389170666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018094448,0.00021196608,0.97793245,0.00018441856,0.0001210918,0.00003044246,0.0000335396,0.00054738374,0.002844126],"genre_scores_gemma":[0.6709974,0.00059493765,0.30770224,0.0004288683,0.00013281008,0.000082769904,0.00026561777,0.0003044132,0.019490954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997099,0.00007490165,0.000008143157,0.00006858629,0.000101391226,0.000037003796],"domain_scores_gemma":[0.9997013,0.00014568388,0.000025011674,0.00006239459,0.00005033102,0.00001520102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057350105,0.0004919307,0.0004965267,0.00018218759,0.00017919159,0.00044995383,0.00070387655,0.00068547437,0.0023400947],"category_scores_gemma":[0.0010258674,0.00027935018,0.0005320054,0.00017552385,0.0005397697,0.0006740598,0.0011978563,0.0013212237,0.001072271],"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.0004270494,0.00015433862,0.0008113578,0.00009781501,0.000099979,0.00024670415,0.00013885766,0.41035092,0.08214871,0.016848803,0.0058333813,0.48284215],"study_design_scores_gemma":[0.0000031772142,0.000032260585,0.0001848783,0.0000053500694,0.000009967697,0.00008370042,0.000008385858,0.9861974,0.009507149,0.0033103086,0.00065031217,0.000007146285],"about_ca_topic_score_codex":0.00068750937,"about_ca_topic_score_gemma":0.0009006182,"teacher_disagreement_score":0.0023400947,"about_ca_system_score_codex":0.00023907884,"about_ca_system_score_gemma":0.00019456327,"threshold_uncertainty_score":0.007828414},"labels":[],"label_agreement":null},{"id":"W4389195527","doi":"10.1007/978-3-031-49187-0_12","title":"Certificate Reuse in Android Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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 Saskatchewan","funders":"","keywords":"Android (operating system); Computer science; Certificate; Reuse; Computer security; Malware; Cryptography; World Wide Web; Operating system; Engineering","score_opus":0.04443402436859101,"score_gpt":0.28244748815211723,"score_spread":0.23801346378352622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389195527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31551546,0.023056379,0.34364453,0.002203884,0.0007456055,0.0003063682,0.00042496185,0.011006433,0.3030965],"genre_scores_gemma":[0.86354434,0.004823245,0.02788708,0.00023203494,0.00015503762,0.000044125376,0.00034950202,0.0012993279,0.1016653],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99848926,0.00016813909,0.00007431018,0.00020118758,0.0008226807,0.0002444082],"domain_scores_gemma":[0.99730194,0.0010038151,0.00018870026,0.0011321432,0.00031083415,0.000062485655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007618255,0.0006071381,0.00046392818,0.0014758193,0.0006963418,0.0023674187,0.0010079425,0.000880181,0.0069318893],"category_scores_gemma":[0.0054650796,0.0005226994,0.00075118255,0.0014352083,0.0009796045,0.0048465366,0.00195151,0.0013878728,0.0026996634],"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.0003132085,0.00012844469,0.004526834,0.0005356836,0.000050584833,0.0012170088,0.0018184475,0.008093459,0.02189353,0.12964107,0.016364677,0.8154172],"study_design_scores_gemma":[0.00006884452,0.00073318736,0.014049329,0.0013099947,0.00046268874,0.019010633,0.0017870176,0.15366246,0.19320439,0.17698726,0.43842128,0.00030293516],"about_ca_topic_score_codex":0.0023671393,"about_ca_topic_score_gemma":0.0032090568,"teacher_disagreement_score":0.0069318893,"about_ca_system_score_codex":0.00096939586,"about_ca_system_score_gemma":0.00084439653,"threshold_uncertainty_score":0.023189545},"labels":[],"label_agreement":null},{"id":"W4389196652","doi":"10.1007/978-3-031-47401-9_1","title":"Continual-GEN: Continual Group Ensembling for Domain-agnostic Skin Lesion Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Subnetwork; Computer science; Artificial intelligence; Inference; Forgetting; Machine learning; Domain (mathematical analysis); Metric (unit); Deep learning; Similarity (geometry); Field (mathematics); Pattern recognition (psychology); Image (mathematics)","score_opus":0.04670565894918269,"score_gpt":0.28449793403996226,"score_spread":0.23779227509077958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389196652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013324189,0.0009191213,0.9752143,0.0001559464,0.00022139988,0.00009143203,0.00026360905,0.0075611314,0.002248874],"genre_scores_gemma":[0.21525039,0.00039341263,0.76860815,0.00036297124,0.00016571925,0.00018221888,0.0018507038,0.0010478065,0.01213848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.0001522034,0.000021985714,0.0001673141,0.000109175606,0.000045885045],"domain_scores_gemma":[0.9993212,0.00028975552,0.000024650037,0.00017725902,0.0001450826,0.00004200745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018930085,0.00087127025,0.0010301931,0.00076536735,0.00044002995,0.00069546804,0.0014758285,0.0014910805,0.0051569683],"category_scores_gemma":[0.0024001924,0.00042878705,0.00074484374,0.00050346775,0.0005394719,0.0010167651,0.0014234667,0.0015704616,0.0024620031],"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.00035188918,0.00015572172,0.0009316406,0.00014956786,0.00013659606,0.00011449571,0.000119382545,0.06964776,0.018589996,0.008252731,0.022903653,0.87864655],"study_design_scores_gemma":[0.00001766691,0.00009336317,0.00047940432,0.00002377229,0.0000226443,0.00011128368,0.000020226722,0.9783846,0.0062950826,0.010365131,0.0041703475,0.000016434078],"about_ca_topic_score_codex":0.0019850838,"about_ca_topic_score_gemma":0.0050574616,"teacher_disagreement_score":0.0051569683,"about_ca_system_score_codex":0.0004135297,"about_ca_system_score_gemma":0.00049788126,"threshold_uncertainty_score":0.01725179},"labels":[],"label_agreement":null},{"id":"W4389196663","doi":"10.1007/978-3-031-47401-9_3","title":"AViT: Adapting Vision Transformers for Small Skin Lesion Segmentation Datasets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Convolutional neural network; Transformer; Skin lesion; Embedding; Pattern recognition (psychology); Feature learning; Leverage (statistics); Deep learning; Machine learning","score_opus":0.03836199742462318,"score_gpt":0.2984985128641001,"score_spread":0.2601365154394769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389196663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03096586,0.0007774164,0.64390224,0.000273729,0.0007360507,0.00058102654,0.015206065,0.30099255,0.00656504],"genre_scores_gemma":[0.14454937,0.00056939176,0.76561725,0.0005035894,0.00017330261,0.00047305724,0.05662509,0.020758953,0.010730031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991647,0.000088444445,0.00004653939,0.00032169957,0.00029273934,0.00008577154],"domain_scores_gemma":[0.9987619,0.00034644222,0.000034208955,0.00043988286,0.00035268808,0.00006500293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013051454,0.0019432959,0.0010199021,0.002530854,0.0004457981,0.0017962338,0.0030866943,0.0011931304,0.01476274],"category_scores_gemma":[0.0047878474,0.00087159406,0.0017943453,0.0023513485,0.0003345818,0.0019035456,0.0016272484,0.0012941043,0.008960652],"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.000817328,0.00024532774,0.001472326,0.00036150523,0.00032548443,0.00014378788,0.0000721373,0.028597523,0.04040265,0.0019139709,0.16842584,0.7572221],"study_design_scores_gemma":[0.00021538514,0.00024639544,0.0024356819,0.00004247876,0.00010737563,0.0004167318,0.000084251325,0.88454956,0.058651518,0.009609411,0.043572392,0.00006892525],"about_ca_topic_score_codex":0.00942913,"about_ca_topic_score_gemma":0.015417116,"teacher_disagreement_score":0.01476274,"about_ca_system_score_codex":0.0008549942,"about_ca_system_score_gemma":0.000764748,"threshold_uncertainty_score":0.049386263},"labels":[],"label_agreement":null},{"id":"W4389196682","doi":"10.1007/978-3-031-47401-9_21","title":"Towards Foundation Models and Few-Shot Parameter-Efficient Fine-Tuning for Volumetric Organ Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Inference; Segmentation; Artificial intelligence; Task (project management); Machine learning; Image segmentation; Computer vision","score_opus":0.07896725567641384,"score_gpt":0.33650953182771315,"score_spread":0.2575422761512993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389196682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018333514,0.00014072942,0.996071,0.000046611538,0.000012368356,0.000015353375,0.000064297295,0.0012746874,0.00054167205],"genre_scores_gemma":[0.11177355,0.0004052346,0.8818747,0.00020993523,0.000060772465,0.00012024747,0.0008669046,0.0013985494,0.0032901664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.000110117144,0.000031086754,0.00014607167,0.00018812745,0.00007159052],"domain_scores_gemma":[0.99894625,0.0004935528,0.000082692415,0.00024905233,0.00016830527,0.000060210925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097633275,0.0012407706,0.0017981841,0.0011019192,0.0004649659,0.0022567324,0.003319628,0.0024873433,0.004173384],"category_scores_gemma":[0.0035014432,0.0013504145,0.0014835148,0.0014010646,0.0009029412,0.0020393147,0.00285609,0.0025925597,0.002261752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018480603,0.00009526472,0.00039881686,0.00023583396,0.000114081326,0.000074746116,0.00013940263,0.5124817,0.032875814,0.020391652,0.0061809537,0.4268269],"study_design_scores_gemma":[0.000003362167,0.000009290751,0.00005738446,0.000009388281,0.000005768929,0.000024407494,0.000007965626,0.9896263,0.0021802962,0.0070452075,0.0010236492,0.0000068824215],"about_ca_topic_score_codex":0.006538912,"about_ca_topic_score_gemma":0.010019353,"teacher_disagreement_score":0.006538912,"about_ca_system_score_codex":0.0010293208,"about_ca_system_score_gemma":0.0012392027,"threshold_uncertainty_score":0.013961434},"labels":[],"label_agreement":null},{"id":"W4389196995","doi":"10.1007/978-3-031-47401-9","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023 Workshops","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multimedia; Medical physics; Human–computer interaction; Medicine","score_opus":0.01215078078573951,"score_gpt":0.3109308536036566,"score_spread":0.2987800728179171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389196995","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017401787,0.05981932,0.45297155,0.008102247,0.030725839,0.0005797133,0.00311484,0.00831204,0.41897276],"genre_scores_gemma":[0.045013085,0.027572654,0.15093707,0.0009314274,0.0059657563,0.00033331625,0.005927581,0.0020149113,0.7613042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928147,0.000106151005,0.000030165796,0.0001212167,0.00037532437,0.00008570732],"domain_scores_gemma":[0.9990976,0.00013068905,0.00002685938,0.00012682991,0.00040233726,0.00021569352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015922056,0.0014299449,0.00083625247,0.0015886817,0.0005161756,0.0017069092,0.0015518218,0.0013152249,0.049736183],"category_scores_gemma":[0.0014017212,0.00056100346,0.0010305896,0.0014512679,0.0003964654,0.0010899298,0.0017757582,0.0016022926,0.030467484],"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.00014923413,0.00013304206,0.00017203957,0.0002681093,0.000051201383,0.00010645944,0.000050976963,0.0035654788,0.007470917,0.0072090416,0.42777854,0.5530449],"study_design_scores_gemma":[0.000035421333,0.00022662357,0.0030812295,0.00029624166,0.000047058293,0.0012130176,0.000064572436,0.036026094,0.01379178,0.018473146,0.9266776,0.000067124354],"about_ca_topic_score_codex":0.0023751322,"about_ca_topic_score_gemma":0.0047530676,"teacher_disagreement_score":0.049736183,"about_ca_system_score_codex":0.0007016149,"about_ca_system_score_gemma":0.0014731172,"threshold_uncertainty_score":0.1663841},"labels":[],"label_agreement":null},{"id":"W4389213052","doi":"10.1007/978-3-031-47401-9_11","title":"Multimodal Learning for Improving Performance and Explainability of Chest X-Ray Classification","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Vector Institute; Hospital for Sick Children; University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Ground truth; Convolutional neural network; Gaze; Deep learning; Medical imaging; Machine learning; Computer vision; Pattern recognition (psychology); Radiology; Medicine","score_opus":0.0379181957775318,"score_gpt":0.2987316984802209,"score_spread":0.2608135027026891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389213052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2340769,0.0032303354,0.7450026,0.0007195422,0.00024570376,0.0001457437,0.0014304245,0.0095811505,0.005567644],"genre_scores_gemma":[0.7895278,0.0006007117,0.19951259,0.00022925883,0.00021538167,0.00015515076,0.0023954075,0.00031295916,0.0070508556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993629,0.00019068015,0.000039993894,0.00019936948,0.00011636562,0.00009059435],"domain_scores_gemma":[0.9967899,0.0024146065,0.00013629452,0.000224702,0.00035372272,0.000080700476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012491536,0.0012906042,0.00072455505,0.0010705766,0.00037931497,0.00082866923,0.00095160224,0.0013503361,0.005129554],"category_scores_gemma":[0.004945359,0.00024193947,0.000861964,0.00083387445,0.00026961125,0.0012384829,0.0014597762,0.0012889311,0.0012382865],"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.00051636563,0.00022377394,0.0041976967,0.00010268084,0.00012255686,0.000101745354,0.00010471312,0.05069523,0.012356592,0.0009471381,0.005068326,0.9255632],"study_design_scores_gemma":[0.000018367411,0.00013338098,0.0019889143,0.000015855532,0.00005433641,0.00005325106,0.000034151602,0.98739004,0.007700735,0.0018914281,0.00070636265,0.000013130702],"about_ca_topic_score_codex":0.003866606,"about_ca_topic_score_gemma":0.0040227706,"teacher_disagreement_score":0.005129554,"about_ca_system_score_codex":0.0005432731,"about_ca_system_score_gemma":0.0004124956,"threshold_uncertainty_score":0.017160058},"labels":[],"label_agreement":null},{"id":"W4389213189","doi":"10.1007/978-3-031-47401-9_35","title":"SplitFed Resilience to Packet Loss: Where to Split, that is the Question","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Simon Fraser University","funders":"","keywords":"Computer science; Robustness (evolution); Network packet; Segmentation; Packet loss; Artificial intelligence; Scope (computer science); Resilience (materials science); Machine learning; Computer network","score_opus":0.03200206843349319,"score_gpt":0.289901662027358,"score_spread":0.25789959359386483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389213189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054572754,0.04310044,0.6186582,0.17886724,0.0101597905,0.00018062476,0.001279518,0.0032928549,0.089888535],"genre_scores_gemma":[0.8233308,0.02312205,0.079463676,0.01696552,0.006025466,0.00017699934,0.0004886721,0.0016748367,0.048752025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831945,0.00040735502,0.00009040022,0.00042854133,0.00039621178,0.00035799667],"domain_scores_gemma":[0.98924214,0.004086582,0.0005891643,0.0036349427,0.0018464269,0.0006008218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039033883,0.00085102615,0.0014867774,0.0006973739,0.0010000718,0.005360763,0.0030760162,0.0037394222,0.010846417],"category_scores_gemma":[0.017870761,0.0005495923,0.0006359472,0.0008064704,0.0049277805,0.034812186,0.003300855,0.007298607,0.004929911],"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.0004177815,0.0002508551,0.0013344501,0.00069273385,0.00012497198,0.00027593586,0.0006848457,0.01265557,0.008240049,0.56606686,0.08497869,0.32427734],"study_design_scores_gemma":[0.00003203474,0.00016937814,0.00063882355,0.00069838006,0.000072453004,0.00090425287,0.0013671191,0.03528582,0.0071516405,0.8811324,0.072458476,0.000089087625],"about_ca_topic_score_codex":0.0010023129,"about_ca_topic_score_gemma":0.0007325892,"teacher_disagreement_score":0.010846417,"about_ca_system_score_codex":0.0013504699,"about_ca_system_score_gemma":0.0015299895,"threshold_uncertainty_score":0.036284864},"labels":[],"label_agreement":null},{"id":"W4389213238","doi":"10.1007/978-3-031-47401-9_12","title":"Cross-Task Attention Network: Improving Multi-task Learning for Medical Imaging Applications","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Princess Margaret Cancer Centre; University Health Network; University of Toronto","funders":"","keywords":"Computer science; Leverage (statistics); Multi-task learning; Artificial intelligence; Task (project management); Medical imaging; Machine learning; Deep learning; Segmentation","score_opus":0.013188025284169506,"score_gpt":0.31213184252784076,"score_spread":0.29894381724367125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389213238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016230159,0.0034953202,0.9706692,0.00039511884,0.00053329044,0.000068249,0.0003678239,0.005118897,0.0031219504],"genre_scores_gemma":[0.3382053,0.0027643328,0.624228,0.0015403042,0.0008551339,0.00030726203,0.0027243476,0.0015195764,0.027855773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992893,0.00015143104,0.000030892796,0.00024498175,0.00017466529,0.000108788394],"domain_scores_gemma":[0.998836,0.00055460905,0.000058132257,0.00015056648,0.0003193922,0.00008145258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020534613,0.0021189929,0.0016001741,0.0009767374,0.0004722522,0.000999663,0.00287637,0.0025704145,0.0069284537],"category_scores_gemma":[0.003428447,0.0006671854,0.0011302776,0.0014007017,0.00040033908,0.001763845,0.0020010541,0.0028483043,0.002918087],"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.00033764835,0.00026879038,0.0006406389,0.00012954652,0.00020881633,0.00010374887,0.000042637002,0.10840102,0.016025523,0.0016857531,0.01882384,0.85333204],"study_design_scores_gemma":[0.0000141613045,0.000063035084,0.0003482362,0.0000107053065,0.000048359405,0.000044478387,0.00000753849,0.99072003,0.004767852,0.0023326946,0.0016318546,0.000011035548],"about_ca_topic_score_codex":0.010353167,"about_ca_topic_score_gemma":0.010819066,"teacher_disagreement_score":0.010353167,"about_ca_system_score_codex":0.0007228526,"about_ca_system_score_gemma":0.0009266303,"threshold_uncertainty_score":0.023177981},"labels":[],"label_agreement":null},{"id":"W4389213272","doi":"10.1007/978-3-031-47401-9_10","title":"Cellular Features Based Interpretable Network for Classifying Cell-Of-Origin from Whole Slide Images for Diffuse Large B-cell Lymphoma Patients","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Convolutional neural network; Computer science; Diffuse large B-cell lymphoma; Artificial intelligence; Pattern recognition (psychology); Feature (linguistics); Lymphoma; Image (mathematics); Deep learning; Germinal center; Contextual image classification; Artificial neural network; Machine learning; Pathology; B cell; Medicine","score_opus":0.011577374087686498,"score_gpt":0.25899881969495986,"score_spread":0.24742144560727336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389213272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36417404,0.0020021964,0.6141446,0.00063859887,0.00021407138,0.00021753316,0.007432574,0.003988418,0.0071879146],"genre_scores_gemma":[0.8426564,0.00063778413,0.14426282,0.000098212084,0.00010386676,0.00018587147,0.00563407,0.00010524307,0.006315743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990547,0.000014748631,0.0000059828676,0.00003338319,0.000026458643,0.000014012681],"domain_scores_gemma":[0.9998468,0.00006734974,0.000019355093,0.000014465966,0.00004330172,0.000008825276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023918327,0.00052770047,0.00025362748,0.0008427419,0.00016300772,0.00047368745,0.0004412931,0.00045318573,0.0022601837],"category_scores_gemma":[0.0006176196,0.000112528054,0.00032427692,0.0004894221,0.000091825874,0.0003473768,0.0002916669,0.00028921932,0.0005944406],"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.00068638055,0.00018420674,0.029005298,0.00018389747,0.00015151857,0.00081491243,0.00015264114,0.09472332,0.06547077,0.0027362662,0.010600776,0.79529005],"study_design_scores_gemma":[0.000015717462,0.000137864,0.016830174,0.000027205762,0.00011565388,0.0004055977,0.0000929969,0.9559696,0.018563809,0.0041278824,0.0036949061,0.00001855661],"about_ca_topic_score_codex":0.0029513135,"about_ca_topic_score_gemma":0.005181969,"teacher_disagreement_score":0.0029513135,"about_ca_system_score_codex":0.00037262685,"about_ca_system_score_gemma":0.00020018384,"threshold_uncertainty_score":0.007561028},"labels":[],"label_agreement":null},{"id":"W4389228278","doi":"10.1007/978-3-031-48652-4_21","title":"Field Implementation of a Predictive Control Strategy in District Heating Systems: A Tale of Two Demonstration Sites","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Integrated Energy Systems Optimization","field":"Engineering","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":"École de Technologie Supérieure; Natural Resources Canada","funders":"","keywords":"Leverage (statistics); Computer science; Scalability; Boiler (water heating); Model predictive control; Heating system; Operations research; Control (management); Engineering; Artificial intelligence; Database","score_opus":0.0100329783206308,"score_gpt":0.24483882604758506,"score_spread":0.23480584772695426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389228278","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.60038817,0.00094196625,0.3172477,0.0034320478,0.0002624196,0.0004064244,0.00013489871,0.0014577956,0.07572859],"genre_scores_gemma":[0.95397604,0.0002258611,0.03639401,0.00007816576,0.000021877067,0.000053504213,0.000045369692,0.000042811655,0.009162466],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99967754,0.00014337125,0.0000073639603,0.000033740027,0.0000892505,0.000048673894],"domain_scores_gemma":[0.9996476,0.0001227042,0.000013107144,0.00006852932,0.000107554195,0.00004048512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085487496,0.00035302102,0.00035766198,0.00014470181,0.00064578035,0.0008252737,0.00081842317,0.0007603198,0.0018045426],"category_scores_gemma":[0.0007933393,0.00018094458,0.00016419955,0.00026025664,0.0005753439,0.0008787082,0.000440769,0.001447863,0.00021956828],"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.0010390054,0.0028099467,0.0031406768,0.00026475728,0.000042263633,0.00032434994,0.0005743114,0.24056931,0.075125664,0.020550845,0.012900016,0.6426588],"study_design_scores_gemma":[0.0005451803,0.006887579,0.008831925,0.00005855005,0.00004379036,0.00022905941,0.0012097106,0.81281424,0.11603848,0.014480564,0.03876038,0.00010055251],"about_ca_topic_score_codex":0.004424604,"about_ca_topic_score_gemma":0.0044379914,"teacher_disagreement_score":0.004424604,"about_ca_system_score_codex":0.0006145858,"about_ca_system_score_gemma":0.0007356177,"threshold_uncertainty_score":0.008797705},"labels":[],"label_agreement":null},{"id":"W4389228409","doi":"10.1007/978-3-031-48593-0_16","title":"Baseline Models for Action Recognition of Unscripted Casualty Care Dataset","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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 Calgary","funders":"","keywords":"Computer science; Thoracostomy; Inference; Baseline (sea); Artificial intelligence; Machine learning","score_opus":0.09630755291242803,"score_gpt":0.3063130881359807,"score_spread":0.21000553522355264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389228409","genre_codex":"dataset","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.22351092,0.014874343,0.09573503,0.0019898023,0.0046805376,0.001990665,0.55774564,0.06182884,0.037644252],"genre_scores_gemma":[0.11328731,0.0013081633,0.035799794,0.0005906929,0.0002325456,0.00073117914,0.82103866,0.0007043729,0.026307315],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986761,0.00015957137,0.00006494493,0.00048452034,0.00032700106,0.000287714],"domain_scores_gemma":[0.9993622,0.000067229645,0.000031831627,0.00020918428,0.000256763,0.000072911556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009854096,0.003325194,0.0015146176,0.0016303291,0.00077410124,0.0013000347,0.002374886,0.0017794686,0.011335814],"category_scores_gemma":[0.0019161779,0.00039394043,0.0022803566,0.0012147779,0.0003716419,0.00084785616,0.0011793071,0.0021354284,0.020127283],"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.0014337128,0.0013386646,0.010448127,0.0006929981,0.00054947386,0.0003372077,0.000075370684,0.01601105,0.013982489,0.0006993462,0.56950986,0.38492173],"study_design_scores_gemma":[0.00076374674,0.0022126348,0.08962317,0.0007727558,0.0008819074,0.0026299376,0.00088161096,0.49893373,0.059360053,0.006537864,0.33698887,0.00041366817],"about_ca_topic_score_codex":0.057764266,"about_ca_topic_score_gemma":0.09101635,"teacher_disagreement_score":0.057764266,"about_ca_system_score_codex":0.0012942422,"about_ca_system_score_gemma":0.0020071294,"threshold_uncertainty_score":0.114856064},"labels":[],"label_agreement":null},{"id":"W4389228711","doi":"10.1007/978-3-031-48649-4_15","title":"Business Models for Digitalization Enabled Energy Efficiency and Flexibility in Industry: A Survey with Nine Case Studies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Transformation in Industry","field":"Engineering","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":"Natural Resources Canada","funders":"Energiteknologisk udviklings- og demonstrationsprogram","keywords":"Flexibility (engineering); Computer science; Adaptability; Business model; Digital transformation; Industry 4.0; Business value; Knowledge management; Engineering management; Data science; Industrial engineering; Process management; Manufacturing engineering; World Wide Web; Engineering; Marketing; Business; Data mining","score_opus":0.05399785100243597,"score_gpt":0.26301635151918396,"score_spread":0.20901850051674797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389228711","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.51674783,0.24512988,0.029363574,0.012919481,0.00021964134,0.00026058452,0.0004088677,0.00016286115,0.19478728],"genre_scores_gemma":[0.9153495,0.07256574,0.00618609,0.00060435245,0.000031792162,0.000079642516,0.00036289028,0.00004647062,0.0047735614],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99734515,0.0010255208,0.00020030956,0.00022014498,0.00093953474,0.00026941005],"domain_scores_gemma":[0.9898567,0.008150856,0.00082347,0.00030088937,0.0005909539,0.00027705354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042239814,0.00050886685,0.00037893167,0.0038616608,0.0009782782,0.005981385,0.001030114,0.0014783011,0.0035654588],"category_scores_gemma":[0.007606629,0.00028704724,0.00064129813,0.009614781,0.0018223433,0.00618659,0.0012786674,0.001530439,0.0004983665],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002084777,0.0012736011,0.048611585,0.0028915529,0.00010791046,0.0010633898,0.011704364,0.006296235,0.0018152414,0.41004443,0.010627754,0.5053555],"study_design_scores_gemma":[0.00006090888,0.000826573,0.09431904,0.01431477,0.00029183418,0.007471942,0.0892014,0.021343157,0.0050944453,0.15583414,0.61103565,0.00020610093],"about_ca_topic_score_codex":0.0023682094,"about_ca_topic_score_gemma":0.0023830486,"teacher_disagreement_score":0.005981385,"about_ca_system_score_codex":0.0037262621,"about_ca_system_score_gemma":0.00240039,"threshold_uncertainty_score":0.027036011},"labels":[],"label_agreement":null},{"id":"W4389241679","doi":"10.1007/978-3-031-48593-0_1","title":"Segmentation of White Matter Hyperintensities and Ischaemic Stroke Lesions in Structural MRI","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acute Ischemic Stroke Management","field":"Medicine","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":"McMaster University","funders":"Medical Research Council","keywords":"Hyperintensity; Stroke (engine); Medicine; Percentile; Magnetic resonance imaging; Segmentation; White matter; Cardiology; Radiology; Internal medicine; Artificial intelligence; Computer science; Mathematics","score_opus":0.01580253238171859,"score_gpt":0.25590529394844674,"score_spread":0.24010276156672816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389241679","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.06596057,0.060329553,0.73619646,0.0031932571,0.0015934167,0.00061209174,0.003259964,0.0054669906,0.123387724],"genre_scores_gemma":[0.13618794,0.05692221,0.5876461,0.0014805563,0.0015727603,0.00022482025,0.0059160185,0.0026118485,0.2074377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999255,0.0000089029945,0.0000067764067,0.000022536362,0.000026147472,0.000010210944],"domain_scores_gemma":[0.99985063,0.00008121845,0.000011736725,0.0000129053515,0.000032463424,0.000011136636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027123425,0.00064188696,0.0004687946,0.0011913572,0.0001673228,0.0010407423,0.0005625855,0.0007123472,0.009860916],"category_scores_gemma":[0.00051085994,0.00037331664,0.0005111105,0.0010143255,0.00026120202,0.0006275522,0.00028036462,0.00046096015,0.0062802914],"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.00017699506,0.00005383403,0.0009790546,0.00077678193,0.000053659758,0.0007046399,0.00017464763,0.0054051615,0.0704625,0.0059799906,0.036499552,0.8787332],"study_design_scores_gemma":[0.00009910567,0.0007984441,0.053303197,0.00181078,0.0005071537,0.024232741,0.00066211325,0.14883186,0.15294738,0.09231262,0.5243058,0.00018884936],"about_ca_topic_score_codex":0.0017299018,"about_ca_topic_score_gemma":0.0031925559,"teacher_disagreement_score":0.009860916,"about_ca_system_score_codex":0.00025739265,"about_ca_system_score_gemma":0.0003254445,"threshold_uncertainty_score":0.03298801},"labels":[],"label_agreement":null},{"id":"W4389241905","doi":"10.1007/978-3-031-48649-4_13","title":"Impact of Setpoint Control on Indoor Greenhouse Climate Modeling","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"Université Laval","funders":"","keywords":"Setpoint; Greenhouse; Environmental science; Energy consumption; Agricultural engineering; Computer science; Engineering; Agronomy","score_opus":0.02383165777685243,"score_gpt":0.24323418478328723,"score_spread":0.2194025270064348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389241905","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.25065824,0.0019938347,0.6865053,0.0008945134,0.00056295004,0.000120877754,0.0006154565,0.0019630159,0.05668586],"genre_scores_gemma":[0.9833229,0.00027787875,0.012279209,0.000045260007,0.000039167928,0.000034766177,0.000076626544,0.00012654587,0.0037976583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999587,0.00017321555,0.000010969851,0.00006578886,0.000115406685,0.000047592275],"domain_scores_gemma":[0.9989133,0.00085977407,0.000032456595,0.00006369954,0.000099408164,0.000031363506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518308,0.0008539163,0.0010593594,0.00020848773,0.0004558507,0.0013990953,0.0013059779,0.00082015357,0.0047461907],"category_scores_gemma":[0.0021953855,0.0004049404,0.00072288496,0.00037517436,0.0005346702,0.0012982758,0.00090319844,0.0014343925,0.0002995732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004051614,0.00001511254,0.000115999625,0.000019143488,0.000007937946,0.000008455276,0.0000070854758,0.9918948,0.00051827997,0.001315783,0.00018475199,0.005872238],"study_design_scores_gemma":[0.000004272581,0.00002080151,0.000056029054,0.0000016696885,0.0000044126236,0.0000013074401,0.0000031805312,0.9985936,0.00040901895,0.0007368867,0.00016584783,0.0000030284657],"about_ca_topic_score_codex":0.028318593,"about_ca_topic_score_gemma":0.014218862,"teacher_disagreement_score":0.028318593,"about_ca_system_score_codex":0.00079302787,"about_ca_system_score_gemma":0.00078311784,"threshold_uncertainty_score":0.056307495},"labels":[],"label_agreement":null},{"id":"W4389241970","doi":"10.1007/978-3-031-48593-0_12","title":"TON-ViT: A Neuro-Symbolic AI Based on Task Oriented Network with a Vision Transformer","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Calgary","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Graph; Task (project management); Natural language processing; Theoretical computer science","score_opus":0.012252591426379182,"score_gpt":0.23904105022122601,"score_spread":0.22678845879484683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389241970","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.007576914,0.00029188197,0.9745871,0.0001499402,0.00023301263,0.00008474854,0.0002387129,0.006258935,0.010578808],"genre_scores_gemma":[0.43707967,0.00050020864,0.53874165,0.00039081206,0.00010686877,0.0001909918,0.0008121294,0.00063835713,0.021539431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999866,0.000014964419,0.000007662534,0.00004756009,0.00004226344,0.000021516338],"domain_scores_gemma":[0.9998375,0.000050551615,0.000009943662,0.00003107924,0.0000490367,0.000021960663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024540717,0.0005435919,0.000532365,0.0003323697,0.0003279449,0.0008970534,0.0016347037,0.00069045497,0.00975271],"category_scores_gemma":[0.00067261525,0.00030551723,0.000505538,0.00046486442,0.00041070662,0.0010490932,0.000911227,0.0011623817,0.0017622329],"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.00039978928,0.00020881879,0.00050454575,0.00033747748,0.00020773824,0.0002907077,0.00013335222,0.18181065,0.056980513,0.043917593,0.0197674,0.69544137],"study_design_scores_gemma":[0.000027065542,0.00009289413,0.00016861541,0.000015861015,0.00004403397,0.000092585025,0.00001731405,0.9642188,0.01169503,0.015800048,0.0078124837,0.000015183059],"about_ca_topic_score_codex":0.0067798938,"about_ca_topic_score_gemma":0.007867423,"teacher_disagreement_score":0.00975271,"about_ca_system_score_codex":0.00050835294,"about_ca_system_score_gemma":0.00086111686,"threshold_uncertainty_score":0.032626092},"labels":[],"label_agreement":null},{"id":"W4389264231","doi":"10.1007/978-981-99-8718-4_18","title":"RoboSync: Efficient Real-Time Operating System for Social Robots with Customizable Behaviour","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Adaptability; Modular design; Plug-in; Embedded system; Real-time operating system; Implementation; Robot; Abstraction layer; Personalization; Robotics; Layer (electronics); Debugging; Microcontroller; Human–computer interaction; Distributed computing; Artificial intelligence; Operating system; Software engineering; Software","score_opus":0.035229700528524414,"score_gpt":0.32376564316431194,"score_spread":0.2885359426357875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389264231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037876427,0.0010669393,0.7323306,0.0001681419,0.00029573578,0.0004722641,0.0017514474,0.20261931,0.02341914],"genre_scores_gemma":[0.4126448,0.0011272436,0.43915772,0.00062820636,0.00017311439,0.0015148215,0.007047205,0.03369934,0.10400753],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996886,0.000026957181,0.000018875027,0.00006110897,0.0001370208,0.00006742513],"domain_scores_gemma":[0.9997087,0.000083133804,0.000031764353,0.000068202746,0.000055493878,0.000052523465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038421608,0.0012573393,0.00067871745,0.00048825348,0.00040286448,0.0007515796,0.0026567818,0.00069426745,0.021807207],"category_scores_gemma":[0.0007873249,0.0006370585,0.0004908478,0.0003003104,0.00047082192,0.0011833586,0.0014543696,0.0010608895,0.005492024],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022021108,0.00037220397,0.0018932043,0.0012205619,0.00015120328,0.0008312224,0.0009932338,0.0268155,0.19118737,0.024490256,0.19611658,0.55372655],"study_design_scores_gemma":[0.0005024449,0.0006579073,0.00485797,0.00022595526,0.00019550508,0.0012216634,0.00017904132,0.47923204,0.18817022,0.016121903,0.30833492,0.00030030712],"about_ca_topic_score_codex":0.002676285,"about_ca_topic_score_gemma":0.0033002994,"teacher_disagreement_score":0.021807207,"about_ca_system_score_codex":0.0004446024,"about_ca_system_score_gemma":0.0007028908,"threshold_uncertainty_score":0.07295233},"labels":[],"label_agreement":null},{"id":"W4389264682","doi":"10.1007/978-3-031-48882-5_1","title":"Segment Visibility for k-Transmitters","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Toronto Metropolitan University","funders":"","keywords":"Visible spectrum; Disjoint sets; Combinatorics; Polygon (computer graphics); Visibility; Boundary (topology); Physics; Mathematics; Computer science; Optics; Mathematical analysis; Telecommunications","score_opus":0.025203102241937916,"score_gpt":0.2684939364107193,"score_spread":0.24329083416878136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389264682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058877338,0.0007761483,0.880446,0.00020888673,0.00016429798,0.000058584537,0.00030960882,0.0011078366,0.05805127],"genre_scores_gemma":[0.6201008,0.0018591422,0.30463693,0.0001387021,0.00016461358,0.00010286285,0.0011366984,0.0013181632,0.070542105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997422,0.000032026834,0.000014167407,0.000067804554,0.00007056538,0.0000732636],"domain_scores_gemma":[0.99937844,0.00024201508,0.00007276368,0.00015697362,0.0000899199,0.000059748152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020593789,0.00053433544,0.0007235808,0.00050299143,0.0006960857,0.0015864598,0.0008942752,0.0006931429,0.010694852],"category_scores_gemma":[0.0015257783,0.00046255862,0.0006002065,0.00082560006,0.0009323495,0.002225997,0.0024512375,0.0017003663,0.0025393122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060557824,0.00008739616,0.0010181671,0.0005140255,0.000051714927,0.00052999536,0.0010021998,0.05951796,0.037897214,0.6421259,0.013894708,0.24275516],"study_design_scores_gemma":[0.000051687726,0.00015056776,0.0010309959,0.00012619869,0.00005110538,0.0007975593,0.0004233489,0.2789239,0.020112572,0.65372956,0.04455048,0.000052138344],"about_ca_topic_score_codex":0.0016405728,"about_ca_topic_score_gemma":0.001557519,"teacher_disagreement_score":0.010694852,"about_ca_system_score_codex":0.0005935378,"about_ca_system_score_gemma":0.0005086016,"threshold_uncertainty_score":0.035777867},"labels":[],"label_agreement":null},{"id":"W4389264857","doi":"10.1007/978-3-031-48882-5","title":"Algorithmics of Wireless Networks","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Wireless Communication Networks 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":"Carleton University; Toronto Metropolitan University","funders":"University of Illinois at Urbana-Champaign; National Technical University of Athens; National and Kapodistrian University of Athens; Università degli Studi di Perugia; University of Crete; Kent State University","keywords":"Computer science; Algorithmics; Wireless; Wireless network; Theoretical computer science; Telecommunications; Algorithm","score_opus":0.02364547732975149,"score_gpt":0.28408546761943754,"score_spread":0.26043999028968606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389264857","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02009973,0.010615911,0.6804079,0.00747213,0.0013186528,0.00009001139,0.00054796925,0.000533327,0.27891436],"genre_scores_gemma":[0.57247263,0.016046986,0.19808872,0.0019765727,0.0036173202,0.00066999666,0.0011415597,0.0005701251,0.20541614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936086,0.000212524,0.000027156722,0.000098540884,0.00024224498,0.0000587635],"domain_scores_gemma":[0.99892956,0.0006181265,0.00007045149,0.00018349972,0.000114954135,0.00008336391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000743547,0.0008223907,0.0007955661,0.0012863544,0.00089461525,0.0034211918,0.0012505037,0.0011213223,0.013374389],"category_scores_gemma":[0.0040283664,0.00051548897,0.0008552122,0.0014705202,0.002184939,0.0041565816,0.0018309368,0.0028486443,0.0019528563],"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.0000038243043,0.0000053593553,0.000041343472,0.000021374854,0.000004387895,0.000007101983,0.000027490436,0.002907737,0.000051897638,0.9846697,0.0038948855,0.0083647305],"study_design_scores_gemma":[0.0000034705115,0.0000025875497,0.000040466017,0.000007883506,0.0000028608072,0.000018056113,0.000012750391,0.007880865,0.000022467746,0.9841458,0.007860569,0.0000020906193],"about_ca_topic_score_codex":0.00092484587,"about_ca_topic_score_gemma":0.0007818606,"teacher_disagreement_score":0.013374389,"about_ca_system_score_codex":0.001457676,"about_ca_system_score_gemma":0.00080515054,"threshold_uncertainty_score":0.04474181},"labels":[],"label_agreement":null},{"id":"W4389272132","doi":"10.1007/978-3-031-47966-3_36","title":"Multisensory Modeling of Tabular Data for Enhanced Perception and Immersive Experience","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Human–computer interaction; Visualization; Perception; Haptic technology; Virtual reality; Sonification; Multimedia; User experience design; Multimodal interaction; Sight; Artificial intelligence","score_opus":0.10335714499252784,"score_gpt":0.3311228116107354,"score_spread":0.22776566661820757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074683432,0.00026540674,0.98924583,0.00006614264,0.000051560346,0.000016074728,0.0001585811,0.0010613,0.0016667234],"genre_scores_gemma":[0.4047344,0.0015040776,0.5803237,0.00010325358,0.0000656289,0.00012215598,0.0007847125,0.00075857237,0.011603537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983656,0.00003480626,0.000011854246,0.000029902638,0.00007459355,0.00001226288],"domain_scores_gemma":[0.9994728,0.00026769706,0.000028977998,0.000087476685,0.00012478096,0.000018367246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031782922,0.0005890606,0.00051921036,0.00030339079,0.00015729626,0.0013285341,0.00074759184,0.00041548407,0.011678977],"category_scores_gemma":[0.0014048076,0.00030980134,0.0006969503,0.00054137525,0.0002792349,0.0015060825,0.0008412957,0.00056963175,0.0016990104],"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.0003693907,0.000113589806,0.00064742786,0.000595189,0.000076485136,0.00034197938,0.00033901143,0.4030537,0.13362785,0.02974135,0.007677699,0.42341635],"study_design_scores_gemma":[0.000004958874,0.000040692965,0.00016278026,0.000018810484,0.000009267879,0.00010441678,0.000029790952,0.98265314,0.009247012,0.0046913493,0.0030267092,0.000011169892],"about_ca_topic_score_codex":0.0015123981,"about_ca_topic_score_gemma":0.0016077628,"teacher_disagreement_score":0.011678977,"about_ca_system_score_codex":0.00025148058,"about_ca_system_score_gemma":0.0002442908,"threshold_uncertainty_score":0.03907001},"labels":[],"label_agreement":null},{"id":"W4389272161","doi":"10.1007/978-3-031-47966-3_14","title":"Regularized Meta-Training with Embedding Mixup for Improved Few-Shot Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Embedding; Computer science; Generalization; Artificial intelligence; Regularization (linguistics); Machine learning; Metric (unit); Shot (pellet); Set (abstract data type); Training set; Domain (mathematical analysis); GRASP; One shot; Range (aeronautics); Mathematics","score_opus":0.07115953134820122,"score_gpt":0.2897249329974847,"score_spread":0.21856540164928348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011121423,0.0017856859,0.980631,0.00020545468,0.00021646947,0.00007385224,0.00030580908,0.0044114524,0.0012488659],"genre_scores_gemma":[0.313459,0.00094938197,0.6618625,0.00095914304,0.0003662718,0.00045369277,0.0042231125,0.0016884339,0.016038409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886453,0.00030095997,0.00006562236,0.00043571612,0.00019609068,0.00013712201],"domain_scores_gemma":[0.9973598,0.001573573,0.00008653599,0.0005196038,0.00031593777,0.00014449836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019340679,0.0021070384,0.0031834396,0.001263684,0.00075303344,0.001385129,0.004441912,0.003815529,0.006877049],"category_scores_gemma":[0.0056739068,0.0011351375,0.0017315875,0.0015119265,0.00090935745,0.0035790321,0.0033992575,0.004647787,0.0036527815],"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.00048861705,0.0004436285,0.0005827579,0.00033145852,0.00030559045,0.00017462639,0.00014530262,0.23150627,0.016280493,0.0060996804,0.016139971,0.7275016],"study_design_scores_gemma":[0.000012921834,0.000056505527,0.00008767937,0.000016624623,0.000024947425,0.000039043567,0.0000139268695,0.99172956,0.0026736339,0.004547091,0.0007855729,0.000012426179],"about_ca_topic_score_codex":0.0053119683,"about_ca_topic_score_gemma":0.009118018,"teacher_disagreement_score":0.006877049,"about_ca_system_score_codex":0.0008081875,"about_ca_system_score_gemma":0.0013137319,"threshold_uncertainty_score":0.023005962},"labels":[],"label_agreement":null},{"id":"W4389272182","doi":"10.1007/978-3-031-47966-3_1","title":"A Pilot Study Comparing User Interactions Between Augmented and Virtual Reality","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"Concordia University","funders":"","keywords":"Computer science; Virtual reality; Stereoscopy; Augmented reality; Human–computer interaction; Virtual machine; Analytics; Optical head-mounted display; Computer-mediated reality; Sense of presence; Object (grammar); Virtual image; Mixed reality; Computer graphics (images); Multimedia; Computer vision; Artificial intelligence; Data science","score_opus":0.0962016483053511,"score_gpt":0.3305172125290264,"score_spread":0.23431556422367528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272182","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.99738246,0.00004322289,0.00095626095,0.000023101527,0.000034517132,0.00060306967,0.0001196998,0.00004029677,0.000797414],"genre_scores_gemma":[0.987905,0.00010872634,0.0056857127,0.000109737215,0.0000418332,0.001826239,0.00023614161,0.00003061878,0.0040560085],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988422,0.00052684086,0.000114289556,0.00016950816,0.00017136811,0.00017589403],"domain_scores_gemma":[0.98466706,0.012059308,0.00034067346,0.0008218891,0.0012242574,0.00088685163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023493324,0.0008141153,0.0007761876,0.00054664235,0.00082657736,0.0007383374,0.0010342543,0.0011433803,0.01454926],"category_scores_gemma":[0.010014591,0.0006973775,0.0005793971,0.00029983837,0.0005703608,0.0012012429,0.0009260098,0.0008331486,0.0014858043],"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.12678304,0.17002173,0.052356698,0.006087552,0.00048994145,0.005018364,0.10493877,0.0017969543,0.33631742,0.0010467601,0.0043503116,0.1907925],"study_design_scores_gemma":[0.013895833,0.69041693,0.20359075,0.0002547656,0.00075586344,0.0021372659,0.035813898,0.004172294,0.040078174,0.00052166934,0.008073488,0.00028913055],"about_ca_topic_score_codex":0.0012689963,"about_ca_topic_score_gemma":0.0019890943,"teacher_disagreement_score":0.01454926,"about_ca_system_score_codex":0.0002203396,"about_ca_system_score_gemma":0.0006453069,"threshold_uncertainty_score":0.04867208},"labels":[],"label_agreement":null},{"id":"W4389272190","doi":"10.1007/978-3-031-47966-3","title":"Advances in Visual Computing","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Brookhaven National Laboratory; Peking University; Universidade do Porto; National Taiwan University; Simon Fraser University; Pacific Northwest National Laboratory; Inyuvesi Yakwazulu-Natali; Dartmouth College; École Polytechnique Fédérale de Lausanne; Meijo University; Nanyang Technological University; University of Louisiana at Lafayette; University of Wisconsin-Milwaukee; Los Alamos National Laboratory; Bournemouth University; University of Notre Dame; Tulane University; České Vysoké Učení Technické v Praze; Georgia State University; University of Oklahoma","keywords":"Computer science; Computer graphics (images)","score_opus":0.018632008758280617,"score_gpt":0.31386025469316325,"score_spread":0.2952282459348826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272190","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035421017,0.21483259,0.12357012,0.0045006904,0.010388699,0.00008782107,0.00047311105,0.002755614,0.63984925],"genre_scores_gemma":[0.03497366,0.10915308,0.036390126,0.0011748889,0.0027619982,0.000084119216,0.00072302646,0.0010649858,0.81367415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965453,0.000038820417,0.000014833546,0.000051966785,0.00020277286,0.000037059348],"domain_scores_gemma":[0.9995285,0.00013075204,0.000016618216,0.000090991685,0.00016304119,0.00007019333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043994212,0.00096824573,0.00071922754,0.0016095771,0.0005000493,0.0031330122,0.0010189028,0.0008143651,0.067912266],"category_scores_gemma":[0.0010907484,0.00042423807,0.00041728574,0.002088323,0.0007786219,0.0027871032,0.0018139724,0.001655799,0.027400434],"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.000042655844,0.000037952428,0.0000840758,0.0005249431,0.000017618391,0.000051268205,0.0001467311,0.0007584667,0.004740829,0.09638715,0.22721826,0.66999006],"study_design_scores_gemma":[0.0000071067284,0.000020842705,0.00024783486,0.00020907735,0.000010814229,0.00018423777,0.00007079795,0.002074975,0.0015623848,0.03465328,0.9609469,0.000011833702],"about_ca_topic_score_codex":0.001558605,"about_ca_topic_score_gemma":0.0025117514,"teacher_disagreement_score":0.067912266,"about_ca_system_score_codex":0.0007649431,"about_ca_system_score_gemma":0.0006710367,"threshold_uncertainty_score":0.22718918},"labels":[],"label_agreement":null},{"id":"W4389272191","doi":"10.1007/978-3-031-47966-3_18","title":"Unsupervised Deep-Learning Approach for Underwater Image Enhancement","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Underwater; Computer science; Artificial intelligence; Deep learning; Image (mathematics); Similarity (geometry); Ground truth; Inference; Computer vision; Image quality; Pattern recognition (psychology); Geology","score_opus":0.022051903179661915,"score_gpt":0.258757274960943,"score_spread":0.23670537178128107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074394094,0.0004716388,0.9894521,0.00006477812,0.000034512464,0.00001971044,0.00007331919,0.0006581306,0.0017862347],"genre_scores_gemma":[0.21885622,0.0010979312,0.756172,0.00018212562,0.00008113345,0.00007856579,0.000572262,0.00027193088,0.022687813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989915,0.000014753349,0.000004833432,0.00002432184,0.000036893525,0.000019894422],"domain_scores_gemma":[0.99984944,0.00004484431,0.000013388592,0.000024749277,0.000058622754,0.000008937713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030616863,0.0006314682,0.00052305177,0.000390786,0.00017460743,0.0004215628,0.0008487097,0.0006276219,0.0027573628],"category_scores_gemma":[0.00039553313,0.00029963147,0.00059587625,0.00047284202,0.00025707728,0.00055529707,0.0008215166,0.0009985314,0.0009462941],"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.00012232616,0.00012517917,0.0004975844,0.00015737441,0.00007939998,0.00007572137,0.00005030732,0.17613894,0.08125704,0.008006548,0.00486443,0.72862506],"study_design_scores_gemma":[0.0000034259351,0.000029012092,0.00025125008,0.000009671761,0.000015169424,0.000047189773,0.000007459759,0.9796011,0.015371067,0.0023543136,0.002304475,0.000005988074],"about_ca_topic_score_codex":0.002690299,"about_ca_topic_score_gemma":0.0053801667,"teacher_disagreement_score":0.0027573628,"about_ca_system_score_codex":0.0003366343,"about_ca_system_score_gemma":0.0005086503,"threshold_uncertainty_score":0.009224296},"labels":[],"label_agreement":null},{"id":"W4389272194","doi":"10.1007/978-3-031-47966-3_3","title":"Emergent Individual Factors for AR Education and Training","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Concordia University","funders":"","keywords":"Modalities; Augmented reality; Computer science; Task (project management); Point (geometry); Multimedia; Knowledge retention; Training (meteorology); Human–computer interaction; Medical education; Medicine","score_opus":0.06311930640750635,"score_gpt":0.3012751492735442,"score_spread":0.23815584286603786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272194","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.46227735,0.011216441,0.143213,0.0045950115,0.0004908053,0.0002555638,0.0005073141,0.0005482482,0.3768962],"genre_scores_gemma":[0.97014856,0.0013676444,0.012437182,0.0000866902,0.000061034265,0.000053814696,0.0000973004,0.000045900655,0.015701901],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995154,0.00017215217,0.000018850926,0.00009362857,0.00012597216,0.000074081494],"domain_scores_gemma":[0.99867743,0.0008090856,0.000102673555,0.00007199406,0.00016110172,0.00017776065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948654,0.00043646002,0.00030085433,0.0004981647,0.0007549447,0.0032312756,0.00051610474,0.0005643519,0.017168218],"category_scores_gemma":[0.0022302098,0.00017218728,0.00033734832,0.0007085652,0.0013002284,0.001778898,0.0013915416,0.0009620943,0.0009022678],"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.00031693844,0.00037018713,0.050062023,0.0007628396,0.00010687929,0.00060853077,0.010698331,0.007890193,0.01326404,0.25278425,0.010564737,0.6525711],"study_design_scores_gemma":[0.00007402854,0.0012910382,0.32212144,0.0011972346,0.0002468096,0.0016882805,0.04858711,0.03843334,0.00926615,0.44041625,0.136474,0.00020437752],"about_ca_topic_score_codex":0.0030059603,"about_ca_topic_score_gemma":0.0061302343,"teacher_disagreement_score":0.017168218,"about_ca_system_score_codex":0.0012525277,"about_ca_system_score_gemma":0.0014903175,"threshold_uncertainty_score":0.057433426},"labels":[],"label_agreement":null},{"id":"W4389272544","doi":"10.1007/978-981-99-8715-3_19","title":"The Impact of Robots’ Facial Emotional Expressions on Light Physical Exercises","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facial expression; Robot; Human–robot interaction; Human–computer interaction; Cognition; Computer science; Task (project management); Cognitive psychology; Nonverbal communication; Psychology; Applied psychology; Artificial intelligence; Developmental psychology; Engineering","score_opus":0.04846683407131957,"score_gpt":0.3779339909811928,"score_spread":0.3294671569098732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272544","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.9788754,0.00022065415,0.001831595,0.00010423889,0.000060588987,0.00002485339,0.00012497792,0.000043792996,0.01871401],"genre_scores_gemma":[0.9956091,0.00012525913,0.0005545805,0.000046167574,0.000014549233,0.000022815146,0.000061255145,0.0000268619,0.0035393417],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9998073,0.0000631655,0.000004541683,0.000022782602,0.0000606538,0.00004154197],"domain_scores_gemma":[0.9991273,0.0006705558,0.000058917423,0.00004014089,0.000050376,0.00005266165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024112611,0.0002963315,0.00018050842,0.00012692946,0.00023917848,0.0004862524,0.00021109689,0.00030758264,0.009415556],"category_scores_gemma":[0.0033569406,0.00014091359,0.00022740582,0.00008782752,0.00035572355,0.0002708709,0.00053128833,0.0003803868,0.00067539443],"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.014316529,0.00094667805,0.018739572,0.0005401762,0.00012887493,0.00066969544,0.0028652025,0.010379715,0.7641525,0.003175352,0.0039352793,0.18015039],"study_design_scores_gemma":[0.00027598705,0.0039080516,0.9002799,0.00017222078,0.00024039992,0.00073152344,0.0032060659,0.017137244,0.06378256,0.0030325286,0.007163073,0.00007051909],"about_ca_topic_score_codex":0.0007193691,"about_ca_topic_score_gemma":0.00064419163,"teacher_disagreement_score":0.009415556,"about_ca_system_score_codex":0.00019519244,"about_ca_system_score_gemma":0.00011598313,"threshold_uncertainty_score":0.031498194},"labels":[],"label_agreement":null},{"id":"W4389272697","doi":"10.1007/978-981-99-8715-3_12","title":"Human-Robot Interaction Studies with Adults in Health and Wellbeing Contexts - Outcomes and Challenges","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Computer science; Field (mathematics); Applied psychology; Replication (statistics); Data science; Human–robot interaction; Psychology; Management science; Artificial intelligence; Medicine; Engineering","score_opus":0.10409956771743895,"score_gpt":0.3996132253754548,"score_spread":0.29551365765801585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389272697","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.9279683,0.04880492,0.0018178266,0.0031449604,0.00030223827,0.00024092902,0.0006512651,0.000017879951,0.017051693],"genre_scores_gemma":[0.9597755,0.028153054,0.0024966386,0.0010919338,0.00020034554,0.00068853196,0.0005860782,0.000026384081,0.0069815153],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979175,0.001195338,0.00015170692,0.00023802838,0.00025965297,0.00023777994],"domain_scores_gemma":[0.9941444,0.0033321897,0.000625962,0.00023279733,0.0009623816,0.00070224865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056462465,0.0003135471,0.0006811899,0.0008088875,0.0014770537,0.0026497154,0.00070141297,0.00073762186,0.0049051917],"category_scores_gemma":[0.008657939,0.00023940182,0.0005328905,0.0015541628,0.0009492718,0.002211844,0.0018915569,0.0009855006,0.0007155811],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010868218,0.0023319712,0.41644388,0.0042659035,0.0006805777,0.001391666,0.18112588,0.00017405706,0.0025223452,0.004461831,0.011643504,0.37387165],"study_design_scores_gemma":[0.000045511904,0.002213609,0.7387144,0.0018979806,0.00028560442,0.0012499195,0.2254402,0.00012047851,0.0009248854,0.002650684,0.026387213,0.00006943782],"about_ca_topic_score_codex":0.0043188855,"about_ca_topic_score_gemma":0.012501591,"teacher_disagreement_score":0.0056462465,"about_ca_system_score_codex":0.00069669564,"about_ca_system_score_gemma":0.0013936376,"threshold_uncertainty_score":0.029860556},"labels":[],"label_agreement":null},{"id":"W4389285856","doi":"10.1007/978-3-031-48796-5_10","title":"StableYolo: Optimizing Image Generation for Large Language Models","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Image (mathematics); Inference; Process (computing); Artificial intelligence; Computation; Bounded function; Approx; Baseline (sea); Image quality; Computer vision; Algorithm; Programming language; Operating system; Mathematics","score_opus":0.02895945149165552,"score_gpt":0.2932319525451203,"score_spread":0.2642725010534648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389285856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016175117,0.0004878992,0.8654434,0.00019628736,0.00026819835,0.00015414634,0.0014551567,0.103719175,0.012100481],"genre_scores_gemma":[0.12575205,0.00019351562,0.83472496,0.00028188745,0.00009576202,0.00033674476,0.0050645065,0.015139713,0.018410863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966323,0.000046570385,0.000017799443,0.00009035751,0.00012629454,0.000055724908],"domain_scores_gemma":[0.9996551,0.00015221839,0.000018469866,0.000067438305,0.00008475372,0.000021985152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032031906,0.0013657251,0.0007063716,0.0006588208,0.0004909421,0.0009459286,0.0018290291,0.0009651304,0.035540875],"category_scores_gemma":[0.0014029104,0.000787979,0.0010512713,0.0007229983,0.00039209204,0.0013141657,0.0012620414,0.0014561136,0.010189919],"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.0006257081,0.000200216,0.0006878911,0.00038479757,0.00012226032,0.00023595325,0.000114668626,0.058943722,0.04910698,0.013269281,0.15332778,0.7229807],"study_design_scores_gemma":[0.00021163841,0.00008546424,0.00026285605,0.000021024262,0.000042384436,0.000105476494,0.000037963247,0.92381054,0.04618504,0.009154135,0.020056983,0.000026554228],"about_ca_topic_score_codex":0.0071111936,"about_ca_topic_score_gemma":0.015781917,"teacher_disagreement_score":0.035540875,"about_ca_system_score_codex":0.00074941077,"about_ca_system_score_gemma":0.00084315514,"threshold_uncertainty_score":0.11889607},"labels":[],"label_agreement":null},{"id":"W4389321706","doi":"10.1007/978-3-031-48806-1","title":"Financial Cryptography and Data Security. FC 2023 International Workshops","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Banking stability, regulation, efficiency","field":"Economics, Econometrics and Finance","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":"Western University","funders":"","keywords":"Computer science; Cryptography; Computer security; Financial cryptography; Voting; Finance; Data security; Encryption; Public-key cryptography; Business; Political science; Politics","score_opus":0.0254113344817353,"score_gpt":0.2534857802687905,"score_spread":0.22807444578705519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389321706","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00384862,0.1568265,0.047673527,0.009351277,0.01954482,0.0001461675,0.0021979336,0.0023180628,0.7580931],"genre_scores_gemma":[0.025391452,0.04455687,0.014525304,0.00085134944,0.0050133164,0.000091623784,0.0022539257,0.0005712812,0.9067449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994748,0.00008742499,0.000021533964,0.00007387692,0.00025952474,0.00008287975],"domain_scores_gemma":[0.9992834,0.0002575985,0.000038013426,0.000119662196,0.00018956789,0.000111827554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008764535,0.0016533203,0.0009718141,0.0017431563,0.00055465463,0.0032676277,0.0011941589,0.0014852406,0.078140624],"category_scores_gemma":[0.0012327959,0.0006015784,0.0007187736,0.0023619595,0.0005800997,0.00258545,0.001307969,0.0020577621,0.039297383],"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.00009017768,0.00008279857,0.000100585974,0.0002636264,0.000017577833,0.000052441996,0.000031471514,0.0013005111,0.0011416384,0.029444985,0.67286026,0.29461402],"study_design_scores_gemma":[0.000031355645,0.000053794953,0.00075634156,0.0003518816,0.000017092307,0.00030404603,0.00004234177,0.0050226934,0.0019170183,0.03997899,0.9515033,0.000021136679],"about_ca_topic_score_codex":0.001946169,"about_ca_topic_score_gemma":0.002637223,"teacher_disagreement_score":0.078140624,"about_ca_system_score_codex":0.0016940709,"about_ca_system_score_gemma":0.0011219595,"threshold_uncertainty_score":0.26140642},"labels":[],"label_agreement":null},{"id":"W4389478371","doi":"10.1007/978-3-031-49614-1_7","title":"Improved Approximation for Broadcasting in k-Path Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Network topology; Heuristic; Node (physics); Path (computing); Scope (computer science); Time complexity; Computer network; Theoretical computer science; Distributed computing; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics","score_opus":0.025553468096681287,"score_gpt":0.24762101083544982,"score_spread":0.22206754273876853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389478371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09821414,0.0041487315,0.8296281,0.0037476625,0.0009914244,0.0005034682,0.0021280271,0.008519808,0.052118637],"genre_scores_gemma":[0.41338044,0.0024758696,0.53956914,0.0010522014,0.0008393859,0.00076078984,0.0036964517,0.0019473843,0.036278415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970181,0.0006870847,0.0001204542,0.00053253555,0.0009355676,0.0007063153],"domain_scores_gemma":[0.98907137,0.006530557,0.0003778016,0.0027963615,0.0007084247,0.0005155216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024931047,0.0026429459,0.0034333004,0.002166436,0.0018324624,0.0034230147,0.0076458957,0.0027469466,0.022028115],"category_scores_gemma":[0.014093193,0.0011607175,0.0023003325,0.0055514174,0.0020983857,0.008352772,0.0046739965,0.0054876064,0.0043727164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028675636,0.0010130735,0.0016190846,0.001338665,0.000262378,0.00028409166,0.0007234947,0.4069905,0.010445496,0.1398989,0.07820868,0.35634813],"study_design_scores_gemma":[0.00025964493,0.0001585382,0.00048486737,0.00008279573,0.00013953543,0.00018712584,0.00014252492,0.8585339,0.0025879787,0.12992908,0.0074589034,0.000035095214],"about_ca_topic_score_codex":0.012129554,"about_ca_topic_score_gemma":0.018373314,"teacher_disagreement_score":0.022028115,"about_ca_system_score_codex":0.007192671,"about_ca_system_score_gemma":0.0044522267,"threshold_uncertainty_score":0.07369137},"labels":[],"label_agreement":null},{"id":"W4389478400","doi":"10.1007/978-3-031-49611-0_26","title":"Algorithms for the Ridesharing with Profit Constraint Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","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":"","keywords":"Computer science; Mathematical optimization; Constraint (computer-aided design); Profit (economics); Operations research; Algorithm; Mathematics; Microeconomics","score_opus":0.028683295076837,"score_gpt":0.24469970345708508,"score_spread":0.21601640838024808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389478400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014760677,0.00096017035,0.9609937,0.00097335724,0.0001978884,0.00034901054,0.00050185795,0.0013683772,0.019895028],"genre_scores_gemma":[0.17506939,0.0008911633,0.80374163,0.0004223678,0.00029455728,0.00061739975,0.0015364579,0.00082445826,0.016602611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828666,0.0005370004,0.0000841576,0.00042674973,0.00029871278,0.0003667575],"domain_scores_gemma":[0.9955989,0.003094086,0.00020290814,0.00060772937,0.00029904433,0.00019726715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290602,0.0021047115,0.0032750724,0.0014406919,0.0015490899,0.0039107036,0.006562552,0.0035073182,0.02276331],"category_scores_gemma":[0.0090816375,0.0014246596,0.0019919323,0.0035753574,0.0014621768,0.0063681947,0.003990881,0.004422888,0.0035244133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049406436,0.0004927952,0.00055891444,0.00051966275,0.00012682675,0.000115058145,0.00019626573,0.56528366,0.0010711664,0.12068938,0.03440524,0.27604687],"study_design_scores_gemma":[0.00016440432,0.0000589786,0.000114252245,0.000035691806,0.00002940232,0.000053807664,0.00007389374,0.8706048,0.00041611574,0.12391099,0.004519048,0.000018669547],"about_ca_topic_score_codex":0.0074104033,"about_ca_topic_score_gemma":0.006690027,"teacher_disagreement_score":0.02276331,"about_ca_system_score_codex":0.0022672454,"about_ca_system_score_gemma":0.0028413855,"threshold_uncertainty_score":0.076150894},"labels":[],"label_agreement":null},{"id":"W4389478499","doi":"10.1007/978-3-031-49614-1_22","title":"Zero-Visibility Cops and Robber Game on Cage Graph","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Monotonic function; Visibility; Cage; Computer science; Zero (linguistics); Graph; Zero-sum game; Visibility graph; Discrete mathematics; Theoretical computer science; Game theory; Combinatorics; Mathematics; Mathematical economics; Physics; Geometry","score_opus":0.035069599507588305,"score_gpt":0.2793457527815197,"score_spread":0.24427615327393137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389478499","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.45520964,0.0005228286,0.35817227,0.0016741641,0.00034306652,0.00029172277,0.0006977776,0.0005368001,0.18255176],"genre_scores_gemma":[0.91189444,0.00027367228,0.03742851,0.00013250962,0.000054455377,0.00014232432,0.00044869087,0.000132632,0.049492728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970716,0.00006789432,0.000008399303,0.0000682795,0.000057036057,0.000091252245],"domain_scores_gemma":[0.99960893,0.00014662501,0.00003507511,0.000045786463,0.000042274016,0.00012134225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020571396,0.00070600887,0.0009701396,0.0005430715,0.0013666637,0.0012603501,0.0015876937,0.0015825363,0.011090574],"category_scores_gemma":[0.0010966711,0.00032412607,0.0007076581,0.0004097899,0.001153158,0.002198374,0.0016364566,0.0013187691,0.0005055893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036858887,0.00016830419,0.0005637282,0.00018766559,0.00004379817,0.00043873882,0.0003316098,0.09269735,0.0041094306,0.86648065,0.013710074,0.020900067],"study_design_scores_gemma":[0.000068637295,0.00011825558,0.00061610277,0.000035284313,0.000030384506,0.00017173887,0.00024591957,0.41987586,0.0009903666,0.57183254,0.005981535,0.00003345651],"about_ca_topic_score_codex":0.0052409167,"about_ca_topic_score_gemma":0.0053986674,"teacher_disagreement_score":0.011090574,"about_ca_system_score_codex":0.0008897823,"about_ca_system_score_gemma":0.00085738994,"threshold_uncertainty_score":0.037101686},"labels":[],"label_agreement":null},{"id":"W4389478736","doi":"10.1007/978-3-031-49611-0_34","title":"V-Words, Lyndon Words and Substring circ-UMFFs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"","keywords":"Substring; Lexicographical order; Combinatorics; Order (exchange); Factorization; Generalization; String (physics); Mathematics; Discrete mathematics; Computer science; Algorithm; Data structure","score_opus":0.02012152762160887,"score_gpt":0.24442877931744555,"score_spread":0.22430725169583668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389478736","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.19891678,0.02083188,0.33119953,0.0014231852,0.0032529193,0.00012473209,0.00050185795,0.0014053073,0.4423439],"genre_scores_gemma":[0.76655734,0.0051307254,0.07354768,0.0009605172,0.0013201848,0.00018638899,0.00075844495,0.0006116739,0.15092704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996039,0.00008157291,0.000030469157,0.00008039958,0.00012555189,0.00007798274],"domain_scores_gemma":[0.99925536,0.00035632175,0.0000836522,0.00011230953,0.00012455409,0.00006774917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046504082,0.0005781314,0.0006916875,0.0020538883,0.0016738366,0.0022378147,0.00073810143,0.0009573943,0.008904762],"category_scores_gemma":[0.0026684236,0.0003213094,0.00047732846,0.0023950883,0.0024330379,0.0026247045,0.0013192308,0.0013024868,0.0025407935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005782478,0.00001298335,0.00019992107,0.0000821761,0.0000056049735,0.00019437574,0.00026047236,0.00052494736,0.0019646918,0.9473245,0.004219425,0.045153048],"study_design_scores_gemma":[0.00000623444,0.000030645457,0.00018583008,0.00004802718,0.000008327817,0.00043648315,0.000119537544,0.0021951613,0.0014044866,0.9685979,0.026952773,0.000014592167],"about_ca_topic_score_codex":0.0007566026,"about_ca_topic_score_gemma":0.0009787855,"teacher_disagreement_score":0.008904762,"about_ca_system_score_codex":0.0008378401,"about_ca_system_score_gemma":0.00045506767,"threshold_uncertainty_score":0.029789388},"labels":[],"label_agreement":null},{"id":"W4389482197","doi":"10.1007/978-3-031-49190-0_9","title":"Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Oracle; Turing machine; Combinatorics; Time complexity; Computer science; Discrete mathematics; Polynomial; Mathematics; Algorithm","score_opus":0.033529423076539416,"score_gpt":0.28663770938035055,"score_spread":0.2531082863038111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3694569,0.0055404846,0.43407923,0.025318226,0.0008349534,0.00091123796,0.0037577888,0.008137508,0.15196365],"genre_scores_gemma":[0.806249,0.001971669,0.14682883,0.0018049855,0.0014423601,0.0010366159,0.0030126658,0.0024230639,0.03523083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959596,0.0009416434,0.00023051692,0.00090419315,0.0011109136,0.0008530221],"domain_scores_gemma":[0.9698396,0.023294143,0.0011260192,0.0039199856,0.00073226413,0.0010880815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034425033,0.0020235654,0.0027922394,0.0023862545,0.003111328,0.0067326543,0.005276914,0.003463794,0.022705428],"category_scores_gemma":[0.027964443,0.0015687654,0.00415963,0.005385881,0.004704245,0.020105919,0.0055159424,0.012180161,0.002719424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001700282,0.0007509985,0.0018757315,0.00086358277,0.00016651448,0.0002301266,0.0011160771,0.06218412,0.006918915,0.7695247,0.035354346,0.1193145],"study_design_scores_gemma":[0.00018027614,0.00009656318,0.00068972434,0.000084583866,0.00011016004,0.0001870404,0.00018509204,0.11712216,0.0035447483,0.8733964,0.0043495684,0.000053876258],"about_ca_topic_score_codex":0.0016817125,"about_ca_topic_score_gemma":0.003613298,"teacher_disagreement_score":0.022705428,"about_ca_system_score_codex":0.0066693393,"about_ca_system_score_gemma":0.003393231,"threshold_uncertainty_score":0.07595724},"labels":[],"label_agreement":null},{"id":"W4389482199","doi":"10.1007/978-3-031-49190-0_13","title":"Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","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":"Parameterized complexity; Combinatorics; Vertex (graph theory); Feedback vertex set; Computer science; Degree (music); Neighbourhood (mathematics); Discrete mathematics; Graph; Pathwidth; Mathematics; Algorithm; Line graph; Physics","score_opus":0.05257799256211758,"score_gpt":0.30604118313786904,"score_spread":0.25346319057575145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08474698,0.0007541917,0.8870751,0.000929889,0.00019136896,0.0004987059,0.0014068921,0.0048220004,0.019574836],"genre_scores_gemma":[0.22237316,0.00071719935,0.7463583,0.00032756885,0.00015504609,0.00054861646,0.0047683627,0.0021029755,0.022648863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792284,0.00040340587,0.000114430724,0.00066574634,0.0004796666,0.0004139994],"domain_scores_gemma":[0.9925774,0.0029208597,0.00046463317,0.0031333263,0.0005261415,0.00037753413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016407438,0.0018566498,0.0024108745,0.0014205315,0.0022102303,0.0038072239,0.007908365,0.0020587877,0.015332357],"category_scores_gemma":[0.007928447,0.0015271091,0.0022651982,0.005200361,0.001735964,0.0092651155,0.005501841,0.0037937742,0.003403793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012789037,0.00061492436,0.0022676785,0.0009786618,0.00022622039,0.00020606582,0.00078991667,0.3011041,0.013378088,0.22561468,0.047282398,0.4062583],"study_design_scores_gemma":[0.00025380106,0.00009448473,0.000754317,0.00007086433,0.00011871378,0.0002535277,0.0003726459,0.57936054,0.009159933,0.39312688,0.016377997,0.00005635837],"about_ca_topic_score_codex":0.0040746303,"about_ca_topic_score_gemma":0.008442309,"teacher_disagreement_score":0.015332357,"about_ca_system_score_codex":0.004728367,"about_ca_system_score_gemma":0.0035629224,"threshold_uncertainty_score":0.051291883},"labels":[],"label_agreement":null},{"id":"W4389482327","doi":"10.1007/978-3-031-49190-0_14","title":"Sum-of-Local-Effects Data Structures for Separable Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Graph; Separable space; Distance; Mathematics; Computer science; Discrete mathematics; Shortest path problem","score_opus":0.04905899834068726,"score_gpt":0.33177045157629137,"score_spread":0.2827114532356041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028808672,0.0013184056,0.9167527,0.0009705455,0.00039440976,0.00020028872,0.0036947473,0.016474154,0.031386055],"genre_scores_gemma":[0.38080466,0.0015459555,0.5204834,0.0008647026,0.00042213418,0.00063344714,0.010884306,0.008639716,0.07572161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985759,0.00026171407,0.00018936774,0.00027295572,0.0004938427,0.00020616988],"domain_scores_gemma":[0.9955491,0.0011087514,0.00016096447,0.002470711,0.00050823006,0.00020230655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398257,0.0011195276,0.0016178956,0.00154941,0.0017575343,0.003493119,0.0032160454,0.0010066346,0.019867033],"category_scores_gemma":[0.0046600215,0.0011256406,0.0018163534,0.0034117056,0.001785745,0.010198093,0.0063707326,0.0037829033,0.007097961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006343684,0.0002285321,0.0009817216,0.000790352,0.00009205668,0.00017422519,0.0007151425,0.010016119,0.0069303913,0.68707305,0.042535778,0.24982834],"study_design_scores_gemma":[0.0000694485,0.000095911426,0.00021538048,0.000114535076,0.00010645931,0.00019047562,0.00015823713,0.021082716,0.015925797,0.9024116,0.05955826,0.000071129674],"about_ca_topic_score_codex":0.001686681,"about_ca_topic_score_gemma":0.0039013156,"teacher_disagreement_score":0.019867033,"about_ca_system_score_codex":0.0016136949,"about_ca_system_score_gemma":0.0016547668,"threshold_uncertainty_score":0.06646186},"labels":[],"label_agreement":null},{"id":"W4389482877","doi":"10.1007/978-3-031-49193-1_6","title":"A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning 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":"Simon Fraser University","funders":"","keywords":"Kernel (algebra); Simple (philosophy); Quadratic equation; Algorithm; Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.02193965446037178,"score_gpt":0.26314301259475426,"score_spread":0.24120335813438248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01942084,0.00012210502,0.97194135,0.000083465166,0.00004807733,0.00009167659,0.00016206289,0.0037110224,0.004419387],"genre_scores_gemma":[0.16138467,0.00010274954,0.83044785,0.000056945297,0.00002722228,0.00015891183,0.0010031097,0.0007996767,0.006018796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.000058145506,0.00002645513,0.0001386709,0.00018216617,0.00009817872],"domain_scores_gemma":[0.99892646,0.00049760466,0.000060283048,0.00026879902,0.00016994415,0.000076887525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043226933,0.0009875435,0.0011056372,0.0009454465,0.000622977,0.0014833206,0.0023164074,0.0008132941,0.0133567825],"category_scores_gemma":[0.002861938,0.00063677144,0.00092445035,0.0014095736,0.00073072274,0.0023265402,0.0023248175,0.0018168326,0.0034815343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072504673,0.00029580208,0.0009987026,0.00033471413,0.000060332888,0.00012976964,0.00022379518,0.15137538,0.022601971,0.04659338,0.015302858,0.7613582],"study_design_scores_gemma":[0.00013041883,0.00009038848,0.0003668695,0.000014209264,0.000018838315,0.000071699076,0.00008959,0.94957334,0.0049154637,0.040955458,0.003754226,0.000019417077],"about_ca_topic_score_codex":0.0069327164,"about_ca_topic_score_gemma":0.008729109,"teacher_disagreement_score":0.0133567825,"about_ca_system_score_codex":0.0011034876,"about_ca_system_score_gemma":0.0012979561,"threshold_uncertainty_score":0.04468286},"labels":[],"label_agreement":null},{"id":"W4389486639","doi":"10.1007/978-3-031-49190-0_27","title":"Delaying Decisions and Reservation Costs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"York University","funders":"","keywords":"Reservation; Upper and lower bounds; Vertex cover; Competitive analysis; Vertex (graph theory); Edge cover; Computer science; Graph; Set (abstract data type); Online algorithm; Mathematical optimization; Combinatorics; Mathematics; Algorithm; Theoretical computer science","score_opus":0.0560672355227835,"score_gpt":0.29522076528910074,"score_spread":0.23915352976631724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389486639","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.121778175,0.018420642,0.33325484,0.0077133398,0.002297695,0.00010507167,0.0004287621,0.00030508378,0.5156963],"genre_scores_gemma":[0.8154564,0.008285309,0.01981263,0.0003556573,0.0008981211,0.0000724408,0.00016125166,0.00012974533,0.15482841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955696,0.0001406381,0.000021988611,0.00006938904,0.00011895029,0.00009205819],"domain_scores_gemma":[0.99593806,0.003326258,0.00021340145,0.00021089656,0.00016744243,0.00014403157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010938648,0.0006485927,0.00061753165,0.00041699485,0.00051931676,0.002640157,0.001334399,0.0012184572,0.025324741],"category_scores_gemma":[0.0069414517,0.00053942,0.00037229416,0.0010632438,0.0009648239,0.0029810015,0.00045814496,0.0025592148,0.0016059292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023905627,0.00008468489,0.00031914047,0.00012982634,0.000017809196,0.00015220838,0.00010010793,0.055272073,0.0011645551,0.8707389,0.009585561,0.062196106],"study_design_scores_gemma":[0.0000417421,0.0000769175,0.00044073965,0.000048857062,0.000029019357,0.00018474793,0.00011634784,0.08213698,0.0005216831,0.8969872,0.019390156,0.000025638788],"about_ca_topic_score_codex":0.0011545484,"about_ca_topic_score_gemma":0.0009799368,"teacher_disagreement_score":0.025324741,"about_ca_system_score_codex":0.0017404103,"about_ca_system_score_gemma":0.0007815902,"threshold_uncertainty_score":0.08471966},"labels":[],"label_agreement":null},{"id":"W4389488492","doi":"10.1007/978-3-031-49611-0_33","title":"An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Approximation algorithm; Vertex cover; Vertex (graph theory); Algorithm; Combinatorics; Computer science; Graph; Matching (statistics); Running time; Path (computing); Mathematics","score_opus":0.02366334272043781,"score_gpt":0.2625619495429864,"score_spread":0.2388986068225486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389488492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08778123,0.0012561239,0.84862524,0.0020258492,0.0005794709,0.0010082329,0.0034947644,0.009493013,0.045736026],"genre_scores_gemma":[0.10937342,0.00048694984,0.8682087,0.000427591,0.00013565474,0.00053705886,0.0051080007,0.00083367416,0.014888987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984061,0.00022143294,0.0000949625,0.00044089727,0.00044673943,0.00038974633],"domain_scores_gemma":[0.99757975,0.0011202133,0.00013570832,0.0007097563,0.0002596827,0.00019484664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998304,0.0028712826,0.002337142,0.0018843154,0.0015993599,0.0030320308,0.0057081906,0.0030176654,0.028308848],"category_scores_gemma":[0.0042443653,0.0014278372,0.0030070853,0.005353664,0.0010952986,0.0053179883,0.0038906515,0.0029813275,0.005835082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014713331,0.0009103771,0.0017318464,0.00084689324,0.000224191,0.00019924942,0.00038357012,0.14291166,0.012000377,0.050825533,0.057769727,0.7307253],"study_design_scores_gemma":[0.00059043354,0.00034142728,0.0011175743,0.00012068392,0.0002493166,0.0005510202,0.00031230462,0.86323804,0.008919872,0.1015428,0.022952303,0.00006408765],"about_ca_topic_score_codex":0.009633489,"about_ca_topic_score_gemma":0.012886698,"teacher_disagreement_score":0.028308848,"about_ca_system_score_codex":0.003668786,"about_ca_system_score_gemma":0.004319644,"threshold_uncertainty_score":0.09470248},"labels":[],"label_agreement":null},{"id":"W4389489622","doi":"10.1007/978-3-031-49611-0_25","title":"Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","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":"Thales (Canada); Université Laval","funders":"","keywords":"Computer science; Heuristics; Dynamic programming; Mathematical optimization; Scheduling (production processes); Greedy algorithm; Algorithm; Mathematics","score_opus":0.007735479143347628,"score_gpt":0.21027130711482567,"score_spread":0.20253582797147804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389489622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020297367,0.001129529,0.9198157,0.0016080597,0.00021679325,0.00011257902,0.0003589399,0.0001679968,0.05629311],"genre_scores_gemma":[0.7432854,0.0023326983,0.16763288,0.0006409087,0.00044102562,0.0006338897,0.0008510206,0.00031293207,0.08386924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996014,0.00015790525,0.0000094956995,0.00008106721,0.00006901318,0.00008110998],"domain_scores_gemma":[0.9991861,0.00062651344,0.000046214293,0.000020417467,0.00006769295,0.00005308256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008135716,0.0011329185,0.0012524651,0.00052527833,0.00045012205,0.0017713147,0.0015407064,0.0016692224,0.012159765],"category_scores_gemma":[0.0025756974,0.00067305355,0.00078454445,0.0009307581,0.0009710172,0.001538049,0.0012435225,0.0022657877,0.00084437046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108520566,0.00010988138,0.00022262154,0.00020293404,0.000044178243,0.0001241041,0.00006573392,0.8028369,0.00064307806,0.1548725,0.010040883,0.030728698],"study_design_scores_gemma":[0.000029570698,0.00003432738,0.00009529893,0.000025251005,0.000008748078,0.000033453423,0.000040320756,0.9109921,0.00013410907,0.085475534,0.0031198708,0.000011418855],"about_ca_topic_score_codex":0.0057035596,"about_ca_topic_score_gemma":0.0036836101,"teacher_disagreement_score":0.012159765,"about_ca_system_score_codex":0.0016374462,"about_ca_system_score_gemma":0.0013929867,"threshold_uncertainty_score":0.04067844},"labels":[],"label_agreement":null},{"id":"W4389489786","doi":"10.1007/978-3-031-49611-0_32","title":"The Longest Subsequence-Repeated Subsequence Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Université de Sherbrooke","funders":"","keywords":"Subsequence; Longest increasing subsequence; Longest common subsequence problem; Substring; Combinatorics; Sequence (biology); Algorithm; Mathematics; Discrete mathematics; Computer science; Data structure; Bounded function","score_opus":0.023278613772194513,"score_gpt":0.24747296539501,"score_spread":0.22419435162281548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389489786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037494797,0.0063775466,0.92016923,0.003825059,0.0012254321,0.00016066837,0.0018082986,0.0012665829,0.02767243],"genre_scores_gemma":[0.3369946,0.009019367,0.5915171,0.0014603949,0.0039570937,0.00045264018,0.009471278,0.0011080905,0.046019476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839056,0.00039053222,0.00015262813,0.00051538803,0.00042563933,0.00012541289],"domain_scores_gemma":[0.9946977,0.00362643,0.00040788722,0.00073864573,0.0003885313,0.00014077793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014760308,0.0008774791,0.0020175166,0.0013925531,0.00096405245,0.0020275589,0.0024230902,0.0026835788,0.009183075],"category_scores_gemma":[0.010108359,0.0006372292,0.0012905195,0.0037017653,0.001391517,0.0050141555,0.0019797091,0.002074319,0.003082845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070502906,0.0003054226,0.0012582989,0.0014681041,0.0003023067,0.0013380504,0.00032306067,0.11774706,0.007849457,0.3021649,0.068531916,0.4980064],"study_design_scores_gemma":[0.00010552474,0.0001204046,0.00045922305,0.00009635023,0.00006557062,0.0009893455,0.0001709381,0.22129326,0.0036130047,0.75206363,0.020981705,0.00004109598],"about_ca_topic_score_codex":0.0006342693,"about_ca_topic_score_gemma":0.00044242907,"teacher_disagreement_score":0.009183075,"about_ca_system_score_codex":0.0005224202,"about_ca_system_score_gemma":0.0010860689,"threshold_uncertainty_score":0.030720472},"labels":[],"label_agreement":null},{"id":"W4389492900","doi":"10.1007/978-3-031-49099-6","title":"Information Systems Security","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Standards and Technology; Indraprastha Institute of Information Technology, Delhi; Indian Institute of Technology Indore; Indian Institute of Technology Mandi; Indian Institute of Technology Delhi; Indian Institute of Technology Bombay; Sapienza Università di Roma; Università degli Studi di Padova; University of New South Wales; Australian Catholic University; Hamad Bin Khalifa University; Indian Institute of Technology Jodhpur; University of Waterloo; Microsoft Research; Indian Institute of Technology Kanpur; University of Denver; Indian Institute of Technology Gandhinagar; International Institute of Information Technology, Hyderabad; Università degli Studi di Milano; Santa Clara University; Indian Institute of Technology Kharagpur; Indian Institute of Technology Bhilai; Khalifa University of Science, Technology and Research; University of Bristol; University of Dayton; University of Texas at San Antonio; Sungkyunkwan University; Indian Institute of Science; Southern Cross University; Purdue University; National Institute of Technology, Raipur; Stony Brook University; University of Pittsburgh","keywords":"Computer science; Information security; Computer security","score_opus":0.01000676084172822,"score_gpt":0.2240388040288823,"score_spread":0.21403204318715408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389492900","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070113444,0.010190648,0.01267147,0.0030260482,0.001571349,0.000079972735,0.0003616659,0.0010158399,0.9703818],"genre_scores_gemma":[0.011603883,0.011170662,0.0039925487,0.0010847285,0.00097564934,0.000072214105,0.0006514945,0.00033707972,0.9701119],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941325,0.00009156116,0.000017360588,0.00007939797,0.0003519996,0.000046305628],"domain_scores_gemma":[0.9992906,0.00015658619,0.000041683008,0.00027250164,0.00018657527,0.000052043222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005671805,0.0011742092,0.00077226403,0.0016196674,0.0010568575,0.0037504397,0.0005086642,0.001322567,0.13002346],"category_scores_gemma":[0.0017003614,0.0004925139,0.00039043298,0.001722113,0.0009987706,0.0031539747,0.0016249579,0.0023917663,0.11789234],"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.00002125974,0.000036435027,0.00012394154,0.00018133743,0.000011880898,0.00004717688,0.00014895525,0.0004012636,0.0009019911,0.08451737,0.60093796,0.3126705],"study_design_scores_gemma":[0.0000045358806,0.000023301298,0.00030689195,0.0001730421,0.000008566707,0.00015595957,0.00004267192,0.0007242993,0.00049547595,0.032827105,0.9652321,0.0000060566917],"about_ca_topic_score_codex":0.0011371614,"about_ca_topic_score_gemma":0.0017283938,"teacher_disagreement_score":0.13002346,"about_ca_system_score_codex":0.0010933961,"about_ca_system_score_gemma":0.0014047152,"threshold_uncertainty_score":0.4349718},"labels":[],"label_agreement":null},{"id":"W4389747543","doi":"10.1007/978-3-031-49011-8_2","title":"A Path to Generative Artificial Selves","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Origins and Evolution of Life","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Generative grammar; Artificial life; Cognitive science; Constructive; Self-organization; Artificial intelligence; Agency (philosophy); Transformation (genetics); Creativity; Epistemology; Psychology; Process (computing); Social psychology","score_opus":0.023948858057835483,"score_gpt":0.26286372889260856,"score_spread":0.23891487083477309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389747543","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014214539,0.005852349,0.6232335,0.021175213,0.00085383584,0.00007702336,0.00029711486,0.0007060546,0.33359045],"genre_scores_gemma":[0.6378888,0.004594908,0.27729565,0.0034379072,0.0008189032,0.00043748535,0.0004548139,0.00083468994,0.07423685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992379,0.00038724794,0.000030513704,0.00012701198,0.0001734969,0.000043754033],"domain_scores_gemma":[0.9969981,0.0019548011,0.00007538068,0.0005765959,0.0002576214,0.00013755448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012934918,0.0006326522,0.0005641795,0.0007697263,0.0013894731,0.003822005,0.0016680348,0.0017829302,0.0140529135],"category_scores_gemma":[0.0065110456,0.0006380201,0.0007595613,0.00065569574,0.010824467,0.0066258674,0.0028651566,0.0046094363,0.0030212482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021316168,0.0000043651635,0.000027501626,0.000015859097,0.0000024683175,0.000007933933,0.00020176392,0.00040857587,0.000041870797,0.99306446,0.0008761438,0.005346987],"study_design_scores_gemma":[0.0000026888279,0.000001788527,0.00001240724,0.000009268626,9.1632427e-7,0.000013892747,0.00002495408,0.000772014,0.000037265425,0.990289,0.008833231,0.0000025517445],"about_ca_topic_score_codex":0.0010646345,"about_ca_topic_score_gemma":0.0011752151,"teacher_disagreement_score":0.0140529135,"about_ca_system_score_codex":0.0014992673,"about_ca_system_score_gemma":0.0008605172,"threshold_uncertainty_score":0.047011733},"labels":[],"label_agreement":null},{"id":"W4389894494","doi":"10.1007/978-3-031-49737-7_5","title":"An Enhanced Interface-Based Probabilistic Compositional Verification Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Soundness; Model checking; Probabilistic logic; Nondeterministic algorithm; Runtime verification; Probabilistic automaton; Formal verification; Theoretical computer science; Abstraction; Scalability; Automaton; Programming language; Artificial intelligence","score_opus":0.03582711177144161,"score_gpt":0.2956694696132953,"score_spread":0.2598423578418537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389894494","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.0011398002,0.000030170231,0.9958748,0.000026088454,0.00002001313,0.00004446277,0.000019890651,0.00051923114,0.0023254785],"genre_scores_gemma":[0.17081276,0.00014450445,0.81938714,0.00011557215,0.00007052613,0.00025266397,0.00015897992,0.0005362503,0.008521512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644023,0.0008098625,0.00016196509,0.00047291216,0.0018893075,0.00022571492],"domain_scores_gemma":[0.9972019,0.0010679747,0.0001221733,0.00092009886,0.00061203685,0.00007568707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002583003,0.0009327026,0.000947871,0.0011693225,0.00086176407,0.001924853,0.0030450905,0.0013795793,0.0093720835],"category_scores_gemma":[0.005261277,0.00083985715,0.0017037733,0.000704729,0.0017864242,0.003478234,0.003620772,0.0023930247,0.0030551662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036412163,0.00018543303,0.00042240138,0.00040149948,0.000099899386,0.00048350383,0.00039054398,0.09061235,0.055240624,0.6526805,0.0026459876,0.19647314],"study_design_scores_gemma":[0.00006509757,0.00012369273,0.00014698741,0.000046670266,0.00009501378,0.0003580733,0.000028786822,0.7184867,0.029781898,0.23665544,0.01416295,0.000048620383],"about_ca_topic_score_codex":0.0009779633,"about_ca_topic_score_gemma":0.0012147808,"teacher_disagreement_score":0.0093720835,"about_ca_system_score_codex":0.0006877155,"about_ca_system_score_gemma":0.001392845,"threshold_uncertainty_score":0.03135276},"labels":[],"label_agreement":null},{"id":"W4389948068","doi":"10.1007/978-3-031-49552-6_38","title":"A Robust Preprocessing Method for Measuring Image Visual Quality Using Log-Polar FFT Features","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Affine transformation; Artificial intelligence; Computer science; Fast Fourier transform; Pattern recognition (psychology); Image quality; Computer vision; Metric (unit); Preprocessor; Inverse; Fourier transform; Mathematics; Algorithm; Image (mathematics)","score_opus":0.13275953686247277,"score_gpt":0.3974322218454869,"score_spread":0.2646726849830141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389948068","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.00444477,0.00022006975,0.99281526,0.00005152386,0.00007659481,0.00007699249,0.00012927293,0.0012692566,0.00091617764],"genre_scores_gemma":[0.041158777,0.0004439178,0.95411426,0.00005565829,0.00006978238,0.00012890647,0.0005507368,0.00030984575,0.003168108],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936944,0.000052112,0.000038921993,0.000092816255,0.00041398456,0.00003269727],"domain_scores_gemma":[0.9987741,0.00027692964,0.000110388995,0.00017967938,0.000618756,0.000040176707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052085274,0.0008982355,0.000694334,0.0016319201,0.00038875593,0.0010056386,0.00088500424,0.000718,0.0054986486],"category_scores_gemma":[0.0021360088,0.00040785645,0.00069104804,0.001663975,0.00041259648,0.0011141899,0.0007183881,0.0009423273,0.003434371],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000193292,0.00009256862,0.0005970971,0.0002574344,0.000046083576,0.000095813404,0.00006471323,0.0030197646,0.36676213,0.0023855008,0.00342877,0.62305677],"study_design_scores_gemma":[0.00006278955,0.00051016663,0.013899385,0.00010068441,0.0002117303,0.002090638,0.00014089516,0.34027162,0.6078024,0.0044206795,0.030290507,0.00019848722],"about_ca_topic_score_codex":0.0012557996,"about_ca_topic_score_gemma":0.0019767776,"teacher_disagreement_score":0.0054986486,"about_ca_system_score_codex":0.0003196287,"about_ca_system_score_gemma":0.0005431445,"threshold_uncertainty_score":0.018394828},"labels":[],"label_agreement":null},{"id":"W4390058581","doi":"10.1007/978-3-031-49333-1_2","title":"A Formal Metamodel for Software Architectures with Composite Components","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Metamodeling; Computer science; Software engineering; Component (thermodynamics); Reuse; Formal specification; Programming language; Formal methods; Component-based software engineering; Software system; Software; Systems engineering; Engineering","score_opus":0.04568068054494155,"score_gpt":0.2767772827570157,"score_spread":0.23109660221207412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390058581","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.0016791638,0.00011230546,0.99373204,0.00016296664,0.000053797048,0.00009917522,0.00018063241,0.0012781607,0.0027017132],"genre_scores_gemma":[0.04518428,0.00038147467,0.9457375,0.00019983185,0.000071393304,0.00039699257,0.0008524381,0.00071856944,0.006457612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984201,0.00044741575,0.000266705,0.00025173728,0.00048478294,0.00012925861],"domain_scores_gemma":[0.9980405,0.0007481549,0.00016133374,0.00057816127,0.00039096494,0.000080900885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026425587,0.0010570992,0.00073473144,0.001389481,0.0010187721,0.0034382853,0.0021836369,0.0018737832,0.003879085],"category_scores_gemma":[0.0036576698,0.0012257338,0.0018848042,0.0012766455,0.0020046292,0.0043353657,0.0016965348,0.0034561781,0.0018309357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006722049,0.00010442707,0.00038643822,0.00036495028,0.00003505991,0.00029696006,0.00086036447,0.023702245,0.013120099,0.88902426,0.005603645,0.066434436],"study_design_scores_gemma":[0.000090510744,0.00010584826,0.00023706637,0.0004310316,0.00011408627,0.0006252625,0.00022802722,0.15941873,0.015699487,0.5911002,0.2318632,0.00008652234],"about_ca_topic_score_codex":0.0034609507,"about_ca_topic_score_gemma":0.005524964,"teacher_disagreement_score":0.003879085,"about_ca_system_score_codex":0.0015385001,"about_ca_system_score_gemma":0.003061837,"threshold_uncertainty_score":0.013975322},"labels":[],"label_agreement":null},{"id":"W4390072523","doi":"10.1007/978-3-031-49815-2_15","title":"Independent Set in k-Claw-Free Graphs: Conditional $$\\chi $$-Boundedness and the Power of LP/SDP Relaxations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Discrete mathematics; Regular polygon; Treewidth; Chordal graph; Bounding overwatch; Upper and lower bounds; Convex set; Graph; Pathwidth; Line graph; Convex optimization; Computer science; Artificial intelligence","score_opus":0.022599768777134616,"score_gpt":0.2502445444154464,"score_spread":0.22764477563831179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08921077,0.0027633603,0.7919049,0.006274808,0.00043137977,0.00016498055,0.0015440761,0.0009076934,0.10679792],"genre_scores_gemma":[0.77380013,0.0027095615,0.17657319,0.0014813667,0.0010472939,0.0005702578,0.0022695092,0.001097421,0.04045124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998264,0.00049649156,0.00007085531,0.0004251852,0.00045267184,0.00029080643],"domain_scores_gemma":[0.98176783,0.014563868,0.00069301453,0.0012673971,0.0008107188,0.00089725637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029183284,0.0016264685,0.0017869278,0.00164443,0.0018254564,0.004310601,0.004726982,0.0017209043,0.010849329],"category_scores_gemma":[0.016859861,0.0014521831,0.0020599656,0.0031716588,0.004222072,0.008197105,0.0037368862,0.0091107655,0.0012398219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011323213,0.00008434187,0.0002825801,0.00026021848,0.000044394885,0.00009732867,0.00024289265,0.07163717,0.0010052788,0.8970154,0.010766492,0.01845065],"study_design_scores_gemma":[0.000015204605,0.000010769039,0.0001274418,0.0000362044,0.000015473615,0.000036866782,0.000041386727,0.12786992,0.00046877717,0.8695047,0.0018584692,0.000014769999],"about_ca_topic_score_codex":0.0041859653,"about_ca_topic_score_gemma":0.0048426352,"teacher_disagreement_score":0.010849329,"about_ca_system_score_codex":0.0032766263,"about_ca_system_score_gemma":0.0021441153,"threshold_uncertainty_score":0.03629464},"labels":[],"label_agreement":null},{"id":"W4390072545","doi":"10.1007/978-3-031-49815-2_2","title":"A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Intersection (aeronautics); Granularity; Graph; Bounded function; Collision; Upper and lower bounds; Query optimization; Theoretical computer science; Data mining; Mathematics","score_opus":0.021075625155129417,"score_gpt":0.2584254129373303,"score_spread":0.23734978778220087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072545","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.053551026,0.0007757273,0.9371281,0.00032592786,0.00016268816,0.00024176652,0.00014790127,0.00084059266,0.0068262215],"genre_scores_gemma":[0.7753745,0.0004704922,0.21601447,0.00025364646,0.00023624691,0.00022553673,0.0002754076,0.00012350795,0.007026176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884063,0.00015787057,0.000054782904,0.00021838163,0.00050419144,0.00022418403],"domain_scores_gemma":[0.99759585,0.0008858523,0.00017388309,0.00041363272,0.00070832175,0.00022252226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823379,0.0009213849,0.001903975,0.0017311531,0.0017391267,0.0015579973,0.004955022,0.0019279014,0.0034291933],"category_scores_gemma":[0.0049834116,0.0004355212,0.0005360824,0.002396049,0.0009172497,0.0022833017,0.0018809662,0.00085335993,0.0010775329],"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.001206366,0.0008650244,0.00304882,0.0004977418,0.0002006023,0.0008030871,0.00066049147,0.24601282,0.115300074,0.11996168,0.024092078,0.48735118],"study_design_scores_gemma":[0.00006076378,0.00033076244,0.000419749,0.000009072079,0.000055592354,0.0006991145,0.00012703828,0.9748989,0.006857111,0.013817368,0.0026753093,0.000049201957],"about_ca_topic_score_codex":0.0057721897,"about_ca_topic_score_gemma":0.0051975423,"teacher_disagreement_score":0.0057721897,"about_ca_system_score_codex":0.0010527911,"about_ca_system_score_gemma":0.0017811346,"threshold_uncertainty_score":0.011477232},"labels":[],"label_agreement":null},{"id":"W4390072547","doi":"10.1007/978-3-031-49815-2_13","title":"Any-Order Online Interval Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Computer science; Bounded function; Scheduling (production processes); Interval (graph theory); Algorithm; Randomized algorithm; Selection (genetic algorithm); Deterministic algorithm; Order (exchange); Mathematical optimization; Mathematics; Upper and lower bounds; Artificial intelligence; Combinatorics","score_opus":0.03156848898930621,"score_gpt":0.28337998220595023,"score_spread":0.25181149321664403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072547","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.013298373,0.0015978705,0.8522152,0.00065556896,0.00075820525,0.00014301167,0.0008447733,0.002348966,0.12813805],"genre_scores_gemma":[0.34727532,0.0027561372,0.50026524,0.0006982949,0.0011806332,0.00029814008,0.00229467,0.0013604641,0.1438711],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991623,0.00014489346,0.000045269757,0.00015054531,0.00037797345,0.00011904197],"domain_scores_gemma":[0.99846435,0.000707954,0.000056514084,0.00053424085,0.00015282615,0.00008413991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800354,0.0008149636,0.001191251,0.0005692426,0.00052157737,0.0018444029,0.0016295997,0.0005752561,0.039256744],"category_scores_gemma":[0.0038723806,0.00041823095,0.00086771516,0.0016387266,0.00051078346,0.002460644,0.0013266078,0.0021840306,0.008071713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062771334,0.0002451241,0.00036930127,0.00038224194,0.000044358156,0.00015236903,0.00007521236,0.034861658,0.00564393,0.21597433,0.054755393,0.6868683],"study_design_scores_gemma":[0.00018892044,0.0003648926,0.00067369535,0.000117158044,0.000074030155,0.0005629419,0.000071831295,0.33956987,0.0076148855,0.55055654,0.100149125,0.000056133485],"about_ca_topic_score_codex":0.00047086322,"about_ca_topic_score_gemma":0.0008899172,"teacher_disagreement_score":0.039256744,"about_ca_system_score_codex":0.00060982694,"about_ca_system_score_gemma":0.0008883571,"threshold_uncertainty_score":0.13132691},"labels":[],"label_agreement":null},{"id":"W4390077597","doi":"10.1007/978-3-031-49333-1","title":"Model and Data Engineering","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Universidad de Almería; Université de Sfax; Université de Nantes; Shenzhen University; Università degli Studi di Salerno; Eidgenössisches Nuklearsicherheitsinspektorat; Université de Bordeaux; Tartu Ülikool; Università di Bologna; Nile University; Orta Doğu Teknik Üniversitesi; Hunan University; Université de Lorraine; University of Macedonia; Univerzita Karlova v Praze; Universitat Politècnica de Catalunya; University of Cyprus; Université Grenoble Alpes; Universidade do Minho; Université de Moncton; University of Ioannina; University of Ontario Institute of Technology; Università degli Studi di Milano; Iowa State University; Indian Institute of Technology, Patna; University College Dublin; Universidad de Oviedo","keywords":"Computer science","score_opus":0.03537076435315042,"score_gpt":0.2713369866540428,"score_spread":0.2359662223008924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390077597","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.0023032008,0.011808526,0.8744505,0.0058975886,0.0016132707,0.00007607978,0.00086675247,0.0014484011,0.10153565],"genre_scores_gemma":[0.1865448,0.027972262,0.4714721,0.0038945163,0.0029758888,0.0005434666,0.0042674863,0.0024774373,0.29985216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987029,0.0002762015,0.000104673316,0.00026632403,0.0005980282,0.00005194411],"domain_scores_gemma":[0.9986117,0.0004974211,0.000045001543,0.00058345596,0.00022570319,0.000036727124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013627951,0.0011244885,0.0013889737,0.0015353741,0.0008034,0.0045476155,0.0014107514,0.0010581521,0.018759912],"category_scores_gemma":[0.004609441,0.00077612104,0.0011293165,0.0024413574,0.0018426279,0.0064460104,0.0025014551,0.003100889,0.010023776],"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.000013249312,0.00002465974,0.00013969121,0.00015497707,0.000022704817,0.000047992806,0.00010846737,0.0028413357,0.0004893581,0.83153176,0.043390695,0.121235095],"study_design_scores_gemma":[0.000004982982,0.000009437227,0.00005396201,0.000050199164,0.000016023347,0.000111900314,0.000036410427,0.009286157,0.00057401217,0.8494827,0.14036676,0.0000075247026],"about_ca_topic_score_codex":0.0019934676,"about_ca_topic_score_gemma":0.0011212565,"teacher_disagreement_score":0.018759912,"about_ca_system_score_codex":0.0016492382,"about_ca_system_score_gemma":0.0011481013,"threshold_uncertainty_score":0.06275815},"labels":[],"label_agreement":null},{"id":"W4390265114","doi":"10.1007/978-3-031-50628-4_1","title":"Conversational Reasoning in the Absence of Quantity","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Decision-Making and Behavioral Economics","field":"Decision 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":"Carleton University","funders":"","keywords":"Maxim; Grice; Implicature; Computer science; Numeral system; Meaning (existential); Scalar (mathematics); Context (archaeology); Utterance; Linguistics; Cooperative principle; Pragmatics; Artificial intelligence; Natural language processing; Epistemology; Mathematics; Philosophy","score_opus":0.12369875095763073,"score_gpt":0.3700944025334291,"score_spread":0.2463956515757984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390265114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034230012,0.0020999417,0.79262584,0.012821058,0.0006829893,0.00016638859,0.00045225315,0.0006134316,0.15630807],"genre_scores_gemma":[0.7863201,0.001047216,0.19194278,0.0014545727,0.0008861226,0.0004089398,0.0007022584,0.00034901738,0.01688902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9823712,0.011113456,0.0010841368,0.002144992,0.0022796234,0.0010065506],"domain_scores_gemma":[0.90039265,0.08892659,0.001800864,0.005756953,0.0021930009,0.00092999736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015421055,0.0010727987,0.0017847576,0.001861023,0.0031223986,0.010206612,0.003249795,0.0045376928,0.01418775],"category_scores_gemma":[0.08600119,0.0018200835,0.00196208,0.0015451559,0.007883902,0.034270734,0.0065944307,0.006308574,0.002214132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074079835,0.000034618286,0.00019069025,0.000105822495,0.000029472656,0.00013443915,0.00083244895,0.0026243464,0.0004522212,0.985358,0.0017333874,0.008430475],"study_design_scores_gemma":[0.000013578286,0.0000054901748,0.000032746004,0.00001951017,0.000009614747,0.000041084368,0.00010502593,0.014370067,0.00021569578,0.9833557,0.0018214934,0.000010020855],"about_ca_topic_score_codex":0.002245704,"about_ca_topic_score_gemma":0.0012350684,"teacher_disagreement_score":0.015421055,"about_ca_system_score_codex":0.0023173862,"about_ca_system_score_gemma":0.0020440628,"threshold_uncertainty_score":0.08155525},"labels":[],"label_agreement":null},{"id":"W4390344759","doi":"10.1007/978-3-031-50072-5_34","title":"Seeing is No Longer Believing: A Survey on the State of Deepfakes, AI-Generated Humans, and Other Nonveridical Media","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Carleton University; University of Waterloo","funders":"","keywords":"Field (mathematics); Computer science; Power (physics); Key (lock); Data science; Artificial intelligence; Computer security","score_opus":0.03258205287803422,"score_gpt":0.2454872367028475,"score_spread":0.21290518382481327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390344759","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014344631,0.48543894,0.3069537,0.018257098,0.0015127404,0.000067385394,0.0005165462,0.0007635245,0.1721455],"genre_scores_gemma":[0.42712763,0.40014428,0.11620955,0.0047031506,0.0034944115,0.00017203868,0.00092481053,0.0006277659,0.04659631],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995185,0.00014221064,0.000027040876,0.000105170024,0.00017279123,0.000034291334],"domain_scores_gemma":[0.99559647,0.0037287376,0.000104624756,0.00027608176,0.00021733092,0.000076765005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116273,0.0005698446,0.00060199,0.00089346175,0.000492325,0.00324929,0.0014019267,0.0013626186,0.008386308],"category_scores_gemma":[0.005267949,0.0004304159,0.00031529108,0.0013707848,0.003105676,0.006468783,0.001715628,0.0022995698,0.0016320188],"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.000058509388,0.000051540974,0.00046156178,0.0013410065,0.000031815493,0.00004963128,0.00034501287,0.0079893805,0.00071941706,0.45310348,0.019728491,0.51612014],"study_design_scores_gemma":[0.000009305253,0.000054370343,0.0004908514,0.0010909416,0.000022435703,0.000352525,0.00023044708,0.04089633,0.0021812716,0.7323032,0.22233206,0.00003620851],"about_ca_topic_score_codex":0.0016014345,"about_ca_topic_score_gemma":0.0017973876,"teacher_disagreement_score":0.008386308,"about_ca_system_score_codex":0.0010791236,"about_ca_system_score_gemma":0.0008618733,"threshold_uncertainty_score":0.028055012},"labels":[],"label_agreement":null},{"id":"W4390439559","doi":"10.1007/978-3-031-48974-7","title":"Web and Internet Economics","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Boulder; University of Illinois at Urbana-Champaign; Peking University; Suzhou University; Shanghai University of Finance and Economics; University of California, Irvine; Universität Bremen; Technion-Israel Institute of Technology; Technische Universität München; Shanghai Jiao Tong University; Royal Holloway, University of London; Universidade de Macau; Suzhou University of Science and Technology; Tel Aviv University; Sapienza Università di Roma; Tsinghua University; Eidgenössische Technische Hochschule Zürich; University of Bristol; Imperial College London; North Carolina State University; Carnegie Mellon University; Iowa State University; Drexel University; Renmin University of China; National University of Singapore; University of Pittsburgh; Uniwersytet Warszawski; University of Pennsylvania; Singapore Management University; George Mason University; Massachusetts Institute of Technology; Georgia Institute of Technology; Beijing Normal University; Microsoft Research; University of Minnesota; Princeton University; Harvard University; Xiamen University; Northwestern University; Chinese Academy of Sciences; University of Oxford; Purdue University; King's College London; University of Toronto; Yale University","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.053369201748827214,"score_gpt":0.32875209993826915,"score_spread":0.27538289818944195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390439559","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039905757,0.057835,0.010816509,0.00961082,0.0014054298,0.000022422855,0.00014577986,0.00013926193,0.9160343],"genre_scores_gemma":[0.07794373,0.04872079,0.003316558,0.002316572,0.0032483474,0.000055057808,0.00020263069,0.00017919295,0.86401707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998963,0.000026677844,0.000002424538,0.000014120071,0.00004904664,0.000011495235],"domain_scores_gemma":[0.9998367,0.00008299504,0.000011519637,0.000021803568,0.000025426734,0.000021499009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019000942,0.00056045054,0.00041295026,0.0016546549,0.000549595,0.0022688543,0.0003386251,0.0011766148,0.04559592],"category_scores_gemma":[0.00070347986,0.00026270127,0.00018911256,0.0023651505,0.00096541183,0.0036942111,0.0006556201,0.0014842545,0.012800161],"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.000013926724,0.000067190216,0.00022405326,0.00010127034,0.000011964885,0.000053876112,0.000083604034,0.0014187936,0.0002066569,0.63913375,0.23576082,0.12292411],"study_design_scores_gemma":[0.000005318259,0.0000095057,0.0006008427,0.00015252332,0.0000064225924,0.00012933604,0.000078985264,0.0015661196,0.000109867135,0.6478732,0.3494624,0.000005402483],"about_ca_topic_score_codex":0.0014590451,"about_ca_topic_score_gemma":0.0024814007,"teacher_disagreement_score":0.04559592,"about_ca_system_score_codex":0.0010779477,"about_ca_system_score_gemma":0.0004906069,"threshold_uncertainty_score":0.15253353},"labels":[],"label_agreement":null},{"id":"W4390439601","doi":"10.1007/978-3-031-48974-7_8","title":"Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Organ Donation and Transplantation","field":"Medicine","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; Université de Montréal","funders":"","keywords":"Computer science; Equity (law); Key (lock); Kidney transplant; Organ donation; Kidney transplantation; Transplantation; Medicine; Computer security; Law; Surgery","score_opus":0.03302701665497236,"score_gpt":0.273066892497244,"score_spread":0.2400398758422716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390439601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17311935,0.0018656021,0.5664963,0.009358994,0.0013473429,0.00028616172,0.0002696287,0.00054777693,0.24670878],"genre_scores_gemma":[0.9122041,0.00042321775,0.027409391,0.00030545227,0.00032097113,0.00018540688,0.000063205924,0.00011037204,0.058977902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943733,0.0028731886,0.00020339993,0.0004653407,0.0011294303,0.0009553263],"domain_scores_gemma":[0.9691402,0.025247086,0.0012613758,0.0015201203,0.0011388585,0.0016922916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008018552,0.00083952275,0.0012313625,0.0007002331,0.0019079745,0.004234001,0.0019952992,0.0025910102,0.0162298],"category_scores_gemma":[0.04438831,0.00051626563,0.0006880049,0.00073906465,0.003558011,0.0059027923,0.0028769537,0.0055402564,0.0008433303],"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.0003727362,0.00018468134,0.00096950895,0.000057563622,0.0000137828565,0.00006927024,0.00020343719,0.042616524,0.00021493789,0.8904058,0.0058481945,0.059043594],"study_design_scores_gemma":[0.00003272843,0.00009876167,0.00081431464,0.000048130438,0.000012209024,0.000055760396,0.00015453013,0.0878119,0.00021160374,0.9079423,0.0027944539,0.000023345161],"about_ca_topic_score_codex":0.0013848811,"about_ca_topic_score_gemma":0.0022570824,"teacher_disagreement_score":0.0162298,"about_ca_system_score_codex":0.0029785566,"about_ca_system_score_gemma":0.00278081,"threshold_uncertainty_score":0.05429411},"labels":[],"label_agreement":null},{"id":"W4390439628","doi":"10.1007/978-3-031-48974-7_24","title":"The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Probabilistic logic; Price of anarchy; Unit (ring theory); Mathematical economics; Unit of time; Upper and lower bounds; Computer science; Incentive compatibility; Binary logarithm; Combinatorics; Mathematical optimization; Discrete mathematics; Mathematics; Incentive; Economics; Microeconomics; Price of stability; Artificial intelligence","score_opus":0.05048305999129288,"score_gpt":0.22947470423670743,"score_spread":0.17899164424541456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390439628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06931216,0.0032345834,0.52505136,0.04389068,0.0011290673,0.00012519614,0.00038416192,0.00050432497,0.3563684],"genre_scores_gemma":[0.83578485,0.0019387736,0.071764626,0.00429209,0.0031215567,0.00044732256,0.00018184114,0.00052708236,0.08194187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932499,0.0038348958,0.00030012228,0.0006021946,0.0016248258,0.00038800243],"domain_scores_gemma":[0.93722856,0.052228,0.0022137593,0.005948972,0.0014249947,0.0009557969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011307584,0.0007384384,0.0026653593,0.000957216,0.0021558162,0.006112506,0.0030187673,0.006727417,0.019544007],"category_scores_gemma":[0.0639275,0.0016421245,0.0011824026,0.0019040512,0.008508962,0.014098786,0.0031770049,0.011485941,0.0016883075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053700067,0.000021485528,0.00008274965,0.00004024063,0.000010353719,0.000030836472,0.00005740456,0.0064239255,0.000068017325,0.9834247,0.0032790792,0.006507461],"study_design_scores_gemma":[0.00002767649,0.000009687438,0.000034217286,0.000011983789,0.000003635843,0.000028009033,0.000009015316,0.01343411,0.000035821267,0.9852415,0.0011589113,0.0000055853125],"about_ca_topic_score_codex":0.0007317045,"about_ca_topic_score_gemma":0.0009462184,"teacher_disagreement_score":0.019544007,"about_ca_system_score_codex":0.0028095667,"about_ca_system_score_gemma":0.0017832053,"threshold_uncertainty_score":0.06538123},"labels":[],"label_agreement":null},{"id":"W4390443667","doi":"10.1007/978-3-031-48974-7_33","title":"One Quarter Each (on Average) Ensures Proportionality","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":7,"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":"Subsidy; Computer science; Liberian dollar; Quarter (Canadian coin); Mathematical optimization; Proportionality (law); Mathematical economics; Mathematics; Economics; Finance; Law","score_opus":0.05214071166547784,"score_gpt":0.23934374166527297,"score_spread":0.18720302999979513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390443667","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2406043,0.00075494975,0.29851347,0.004960423,0.0021647934,0.0015392179,0.004782828,0.0081105055,0.43856943],"genre_scores_gemma":[0.7914096,0.00028014026,0.042256333,0.0010405505,0.0005340906,0.0006886368,0.0012492931,0.0013533146,0.16118802],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99285156,0.0016790469,0.00046630562,0.001619313,0.0017165431,0.0016672171],"domain_scores_gemma":[0.98101276,0.0036963283,0.0013575616,0.008996806,0.0037811054,0.001155448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040894486,0.00060703186,0.0019713533,0.0012652604,0.0021117798,0.0037086778,0.0026682622,0.0019199006,0.0791576],"category_scores_gemma":[0.034648146,0.0006745318,0.00095623924,0.0019532067,0.0010162973,0.003208602,0.0034861218,0.0019991647,0.032621674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002306456,0.0011814699,0.017237257,0.00029613974,0.00019288971,0.00030625725,0.0010082126,0.008604229,0.020781137,0.25164694,0.120304376,0.57613456],"study_design_scores_gemma":[0.0007419663,0.0012756129,0.033455864,0.00013620507,0.00024770424,0.0019605535,0.0015567068,0.04470192,0.027815316,0.49422085,0.3936975,0.00018978798],"about_ca_topic_score_codex":0.0021267696,"about_ca_topic_score_gemma":0.0028347245,"teacher_disagreement_score":0.0791576,"about_ca_system_score_codex":0.0009634753,"about_ca_system_score_gemma":0.0025744666,"threshold_uncertainty_score":0.26480854},"labels":[],"label_agreement":null},{"id":"W4390447397","doi":"10.1007/978-3-031-50959-9_42","title":"Preventing Text Data Poisoning Attacks in Federated Machine Learning by an Encrypted Verification Key","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"McMaster University","funders":"","keywords":"Backdoor; Computer science; Encryption; Scheme (mathematics); Computer security; Vulnerability (computing); Server; Federated learning; Key (lock); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer network","score_opus":0.04871231188539649,"score_gpt":0.29435374658239316,"score_spread":0.24564143469699667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390447397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082507655,0.00057026563,0.9078579,0.00063913607,0.00018489659,0.00015970627,0.00015230458,0.0020837102,0.0058444724],"genre_scores_gemma":[0.8921227,0.00022264036,0.100004256,0.00017876113,0.00006836677,0.00007332928,0.00015407146,0.000091311485,0.007084642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976513,0.0005733702,0.00021358271,0.00039770256,0.0007879837,0.00037599323],"domain_scores_gemma":[0.99567187,0.0014600108,0.00034600432,0.0019936634,0.00043814487,0.000090421214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019558019,0.00041964688,0.0010173415,0.0007010935,0.00082433486,0.0020617014,0.0013592946,0.0015648172,0.0025322095],"category_scores_gemma":[0.0061297757,0.0004231439,0.0008162242,0.0008713188,0.0012530198,0.0052283136,0.0030935484,0.0016938065,0.0012417259],"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.002706726,0.00053539494,0.0027266417,0.0004906753,0.0002560078,0.0010327195,0.00066568854,0.14661084,0.058454815,0.31383872,0.013508908,0.45917276],"study_design_scores_gemma":[0.00006724894,0.0002220641,0.00051873195,0.000068587215,0.000077680364,0.0010443535,0.00009873195,0.7903938,0.05799393,0.14290464,0.0065636886,0.000046541747],"about_ca_topic_score_codex":0.0003201197,"about_ca_topic_score_gemma":0.00023988326,"teacher_disagreement_score":0.0025322095,"about_ca_system_score_codex":0.0009780863,"about_ca_system_score_gemma":0.0012732557,"threshold_uncertainty_score":0.010343432},"labels":[],"label_agreement":null},{"id":"W4390451048","doi":"10.1007/978-3-031-50959-9_4","title":"Reduction of Binary Attributes: Rough Set Theory Versus Formal Concept Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Unary operation; Formal concept analysis; Rough set; Reduction (mathematics); Binary number; Binary relation; Computer science; Theoretical computer science; Independence (probability theory); Context (archaeology); Mathematics; Set (abstract data type); Discrete mathematics; Algorithm; Data mining; Arithmetic; Programming language; Statistics","score_opus":0.03926247313286341,"score_gpt":0.2711555927927546,"score_spread":0.23189311965989118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390451048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072420486,0.024529373,0.9436208,0.0025697034,0.0009307972,0.00006594749,0.00015316358,0.00014702554,0.0207411],"genre_scores_gemma":[0.26643607,0.02900235,0.68840706,0.0008276011,0.0023567306,0.00035992046,0.0006610865,0.00018741649,0.011761738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954543,0.0016181477,0.00035495378,0.00050769973,0.0019026643,0.00016217529],"domain_scores_gemma":[0.9952749,0.0031471408,0.00034315418,0.00073295436,0.00041261094,0.00008917433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045553376,0.001052149,0.0028619436,0.0028238397,0.00071592425,0.0065579773,0.0021863128,0.0012390587,0.0033445216],"category_scores_gemma":[0.009855052,0.00071079464,0.0027800722,0.0048947707,0.00476763,0.008262665,0.002280351,0.004551099,0.0010547865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034588345,0.000053828513,0.00016634402,0.0005500285,0.00007528437,0.00007421806,0.0003679676,0.008548917,0.0009837613,0.90848935,0.0033046808,0.07735105],"study_design_scores_gemma":[0.000009015284,0.000029868857,0.00018138652,0.000095640884,0.000034353183,0.00011109603,0.000116946096,0.016632034,0.0005111173,0.97291666,0.009338555,0.000023283996],"about_ca_topic_score_codex":0.00067580224,"about_ca_topic_score_gemma":0.000494254,"teacher_disagreement_score":0.0065579773,"about_ca_system_score_codex":0.0015774679,"about_ca_system_score_gemma":0.0011219976,"threshold_uncertainty_score":0.024091244},"labels":[],"label_agreement":null},{"id":"W4390451063","doi":"10.1007/978-3-031-50959-9_17","title":"Three-Way Social Network Analysis: Triadic Measures at Three Levels","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Set (abstract data type); Social network analysis; Value (mathematics); Node (physics); Social network (sociolinguistics); Artificial intelligence; Data science; Cognitive psychology; Machine learning; Psychology; World Wide Web","score_opus":0.043719339478051684,"score_gpt":0.27896878094413546,"score_spread":0.2352494414660838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390451063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05000904,0.0031732537,0.9242445,0.0010497033,0.00023593732,0.0001846953,0.0013811808,0.0004006496,0.019320963],"genre_scores_gemma":[0.5402592,0.0029869906,0.4449712,0.0003701661,0.0005355721,0.0006708297,0.0018129285,0.00023148589,0.008161645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974825,0.001094778,0.00014927985,0.0005392621,0.00054480345,0.00018948338],"domain_scores_gemma":[0.9931398,0.003909929,0.0008647403,0.00087473047,0.0007397662,0.0004711015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348796,0.0008066657,0.0009742597,0.004858146,0.0014620424,0.0049343104,0.0012462906,0.0012176654,0.0048378576],"category_scores_gemma":[0.010346719,0.00042501403,0.0013938792,0.006829658,0.0018822567,0.006658355,0.0028949014,0.0018938025,0.0010395374],"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.0001265604,0.00017802606,0.010455244,0.00044898622,0.0002526181,0.00016841896,0.0019392432,0.025693322,0.0036959853,0.7783365,0.010949563,0.16775551],"study_design_scores_gemma":[0.000011465465,0.00007812436,0.0071087,0.000131525,0.00010981163,0.00028291237,0.0012960283,0.30246225,0.0012774414,0.670587,0.016583579,0.00007114112],"about_ca_topic_score_codex":0.0020063356,"about_ca_topic_score_gemma":0.0023193029,"teacher_disagreement_score":0.0049343104,"about_ca_system_score_codex":0.001248116,"about_ca_system_score_gemma":0.0008324593,"threshold_uncertainty_score":0.01618427},"labels":[],"label_agreement":null},{"id":"W4390454128","doi":"10.1007/978-3-031-50959-9","title":"Rough Sets","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Computer science; Set (abstract data type); Data mining; Programming language","score_opus":0.0234116609055202,"score_gpt":0.2607759585242777,"score_spread":0.2373642976187575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390454128","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.0048597544,0.020376015,0.6764375,0.0022660992,0.0019883923,0.00018828403,0.0014006012,0.0011040189,0.29137942],"genre_scores_gemma":[0.21855944,0.025950596,0.5147162,0.0010493986,0.0019725848,0.0004951263,0.0029923664,0.0006194331,0.23364486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846834,0.00030410272,0.00011010669,0.00019098716,0.0008723495,0.00005408434],"domain_scores_gemma":[0.9989644,0.00041020504,0.000055282857,0.00031361324,0.00022529447,0.00003120686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011788522,0.0011341317,0.0015769438,0.0024481416,0.00077468937,0.0037466644,0.0008091053,0.00076958956,0.018007763],"category_scores_gemma":[0.004755597,0.000547982,0.0011173179,0.0026565618,0.001135702,0.0025100664,0.0012502373,0.0017800024,0.008181163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023092924,0.000023383214,0.00012073132,0.000240741,0.000054712553,0.000059725655,0.00013181494,0.0074818046,0.00051607075,0.72405964,0.03676837,0.23051985],"study_design_scores_gemma":[0.000011595485,0.000034881916,0.00026494244,0.00012570209,0.00004710521,0.00020140232,0.00006711218,0.013139294,0.000820296,0.7873938,0.1978713,0.000022464441],"about_ca_topic_score_codex":0.00066418457,"about_ca_topic_score_gemma":0.0005877009,"teacher_disagreement_score":0.018007763,"about_ca_system_score_codex":0.00080109714,"about_ca_system_score_gemma":0.00069853815,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4390454196","doi":"10.1007/978-3-031-50959-9_3","title":"Algebraic Formulations and Geometric Interpretations of Decision-Theoretic Rough Sets","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Computer science; Generalization; Probabilistic logic; Complement (music); Artificial intelligence; Algebraic number; Set (abstract data type); Visualization; Machine learning; Theoretical computer science; Mathematics","score_opus":0.018406374378308787,"score_gpt":0.2623319977050657,"score_spread":0.24392562332675694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390454196","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.022650534,0.009309632,0.7995307,0.0064085783,0.0009888926,0.00012085844,0.000559702,0.00017072468,0.16026047],"genre_scores_gemma":[0.5858959,0.00802026,0.37642354,0.0009766205,0.0021075197,0.0003754927,0.00090411055,0.000105315004,0.025191221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981345,0.00072154513,0.00018362509,0.00019443789,0.0006692468,0.00009658043],"domain_scores_gemma":[0.9982224,0.0009185821,0.00026013836,0.00020739049,0.00031419282,0.00007729967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095863,0.0010056079,0.0009472697,0.0031492782,0.001386697,0.0065772664,0.0014185789,0.001022774,0.005326081],"category_scores_gemma":[0.004361991,0.00077231706,0.0016667236,0.0034839194,0.0053501916,0.008365144,0.0020350039,0.0040147905,0.000871359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022141055,0.0000025893166,0.000011203415,0.00001882334,0.0000031738953,0.000009946799,0.00006463755,0.0005662639,0.000046902864,0.9970444,0.00036838235,0.0018615162],"study_design_scores_gemma":[0.0000031945335,0.0000044368167,0.00002889922,0.000012475131,0.0000035695762,0.00002840238,0.00004948718,0.0019029472,0.000045423727,0.9934588,0.0044584763,0.000003921534],"about_ca_topic_score_codex":0.0006210361,"about_ca_topic_score_gemma":0.00066311343,"teacher_disagreement_score":0.0065772664,"about_ca_system_score_codex":0.002207857,"about_ca_system_score_gemma":0.00067491055,"threshold_uncertainty_score":0.017817557},"labels":[],"label_agreement":null},{"id":"W4390454271","doi":"10.1007/978-3-031-50959-9_16","title":"Three-Way Conflict Analysis for Three-Valued Situation Tables with Rankings and Reference Tuples","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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","funders":"","keywords":"Tuple; Computer science; Bundle; Alliance; Ranking (information retrieval); Conflict analysis; Opposition (politics); Set (abstract data type); Operations research; Management science; Information retrieval; Mathematics; Political science; Conflict resolution; Discrete mathematics; Law; Politics","score_opus":0.04714683785175815,"score_gpt":0.2581519658570607,"score_spread":0.21100512800530252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390454271","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.032521494,0.00050620013,0.96215874,0.00019441941,0.00003620348,0.0001551595,0.0006384924,0.0002841217,0.0035051755],"genre_scores_gemma":[0.42052686,0.00030507817,0.5747048,0.0000683096,0.000039324364,0.00030494045,0.0015809882,0.00008987909,0.0023798607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99087054,0.0049675214,0.0007856515,0.0009406115,0.0018677701,0.00056799996],"domain_scores_gemma":[0.9826089,0.013816315,0.0009392312,0.00097422116,0.0013331025,0.00032824386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00778977,0.0009965104,0.0013884063,0.0045864997,0.0014135076,0.006413525,0.0027082646,0.0009886594,0.005954091],"category_scores_gemma":[0.019314583,0.0007458452,0.0028881181,0.0063583264,0.001787655,0.008883737,0.0029507522,0.0018005318,0.00061421347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012166742,0.00026599318,0.009770748,0.0008029487,0.0007478754,0.0010427987,0.0036908106,0.1684442,0.0041148216,0.56830597,0.0053616725,0.2362356],"study_design_scores_gemma":[0.00003571185,0.00011201823,0.0016854042,0.000091487665,0.00017841611,0.00039985633,0.0012615591,0.63278,0.0027008548,0.35607153,0.0045826035,0.00010053178],"about_ca_topic_score_codex":0.003735241,"about_ca_topic_score_gemma":0.0026829767,"teacher_disagreement_score":0.00778977,"about_ca_system_score_codex":0.0017337054,"about_ca_system_score_gemma":0.0014080073,"threshold_uncertainty_score":0.041196764},"labels":[],"label_agreement":null},{"id":"W4390454298","doi":"10.1007/978-3-031-50959-9_14","title":"Aggregation Operators on Shadowed Sets Deriving from Conditional Events and Consensus Operators","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision 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 Regina","funders":"","keywords":"Computer science; Operator (biology); Fuzzy set; Fuzzy logic; Theoretical computer science; Algorithm; Data mining; Artificial intelligence","score_opus":0.09816449090264046,"score_gpt":0.36883687494591155,"score_spread":0.2706723840432711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390454298","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.010422033,0.00014413422,0.9804929,0.00010113313,0.00008923682,0.000035651712,0.000051087423,0.0000814931,0.008582243],"genre_scores_gemma":[0.46025363,0.00082095974,0.5158861,0.0003135673,0.00043441856,0.00031275733,0.0004422501,0.00034540365,0.021190854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835473,0.0004762515,0.00012398894,0.0002651783,0.00062111916,0.00015867474],"domain_scores_gemma":[0.99661356,0.0020018164,0.00023973906,0.0004077947,0.0005572782,0.00017971764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029968554,0.000813226,0.0009817699,0.0017279554,0.0009443748,0.0024334835,0.0012135815,0.00086989405,0.0035012683],"category_scores_gemma":[0.0063718697,0.00049999857,0.0018274968,0.0021129055,0.002189098,0.0039977785,0.0027153122,0.0028731658,0.0005419036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026664657,0.000018917342,0.00009081173,0.000042414416,0.000014680345,0.00008206136,0.00021923803,0.014956062,0.0018449848,0.9633242,0.001014065,0.01836581],"study_design_scores_gemma":[0.000005474037,0.0000201792,0.00009088979,0.000012814185,0.00000958859,0.000057416324,0.00003958854,0.11903641,0.0007959765,0.8779921,0.0019266178,0.000012889513],"about_ca_topic_score_codex":0.00080143847,"about_ca_topic_score_gemma":0.0005779791,"teacher_disagreement_score":0.0035012683,"about_ca_system_score_codex":0.0011006555,"about_ca_system_score_gemma":0.000748749,"threshold_uncertainty_score":0.015849113},"labels":[],"label_agreement":null},{"id":"W4390454302","doi":"10.1007/978-3-031-50959-9_18","title":"Cognitive and Social Decision Making: Three-Way Decision Perspectives","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Knowledge Management and Technology","field":"Decision 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 Regina","funders":"","keywords":"Computer science; Human intelligence; Scope (computer science); Hierarchy; Perspective (graphical); Artificial intelligence; Management science; Cognitive science; Knowledge management; Data science; Psychology; Political science","score_opus":0.072860174409551,"score_gpt":0.35820681200180426,"score_spread":0.28534663759225326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390454302","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.03188791,0.009197376,0.5762637,0.022971967,0.000878331,0.0002255021,0.0003464632,0.00014216611,0.35808662],"genre_scores_gemma":[0.81703234,0.006745198,0.15812816,0.0011844813,0.00066519936,0.00051974674,0.00020487072,0.000090443165,0.015429581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903949,0.0060896752,0.00031486177,0.0005532778,0.0018305223,0.000816794],"domain_scores_gemma":[0.98603594,0.011390504,0.00061179325,0.00046555116,0.00079129956,0.0007048785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009931616,0.00230926,0.0017993228,0.003864856,0.0028535435,0.023265325,0.004096393,0.0052348226,0.0118847955],"category_scores_gemma":[0.009517809,0.0010028143,0.0028717797,0.005889106,0.01711717,0.017574545,0.003935377,0.0048063346,0.0010937877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018581393,0.000030223347,0.0001414764,0.00006750861,0.00001955571,0.000059601032,0.0008477181,0.0024891417,0.000066487155,0.99158317,0.00054258795,0.004133894],"study_design_scores_gemma":[0.000010677717,0.00001817233,0.00013929296,0.00006821734,0.000018004432,0.00003884769,0.0012345022,0.008353442,0.00009441478,0.98574775,0.0042598997,0.000016586004],"about_ca_topic_score_codex":0.0033961604,"about_ca_topic_score_gemma":0.00327028,"teacher_disagreement_score":0.023265325,"about_ca_system_score_codex":0.0054929745,"about_ca_system_score_gemma":0.0038859802,"threshold_uncertainty_score":0.05252397},"labels":[],"label_agreement":null},{"id":"W4390590513","doi":"10.1007/978-3-031-51583-5_3","title":"Zero-Knowledge Proofs for SIDH Variants with Masked Degree or Torsion","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Mathematical proof; Computer science; Zero-knowledge proof; Mathematics; Elliptic curve; Pure mathematics","score_opus":0.03247622963168733,"score_gpt":0.26681730639192397,"score_spread":0.23434107676023663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390590513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081065394,0.00347928,0.7527684,0.008192227,0.001719867,0.0002757619,0.0014262284,0.0029796648,0.14809324],"genre_scores_gemma":[0.8776797,0.0017023571,0.08110311,0.0016516955,0.0010807227,0.00019907477,0.0009137497,0.0009345189,0.034735046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485683,0.0011639692,0.0003037536,0.00076003425,0.0020439208,0.00087155396],"domain_scores_gemma":[0.98357415,0.009518163,0.00055704766,0.0048493356,0.0010596554,0.00044166588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039285105,0.0011499325,0.0012553462,0.0014675076,0.0024486738,0.004951215,0.00232552,0.0019728641,0.015346796],"category_scores_gemma":[0.014930989,0.0010139351,0.0017058793,0.0020340898,0.006147623,0.01416753,0.0077171866,0.0063874163,0.0043257065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013236167,0.000047880374,0.00026775635,0.00019913907,0.000026564843,0.00019024576,0.00043800968,0.0014088006,0.0017351414,0.9644324,0.007830496,0.023291145],"study_design_scores_gemma":[0.000023795896,0.00001898593,0.0000612732,0.000043126005,0.000023282933,0.00019965257,0.000049733582,0.0033338354,0.0023565646,0.98724616,0.006621909,0.000021791426],"about_ca_topic_score_codex":0.00047098016,"about_ca_topic_score_gemma":0.0004947744,"teacher_disagreement_score":0.015346796,"about_ca_system_score_codex":0.0024506266,"about_ca_system_score_gemma":0.0023404162,"threshold_uncertainty_score":0.051340163},"labels":[],"label_agreement":null},{"id":"W4390681211","doi":"10.1007/978-3-031-49275-4_15","title":"On Minimizing the Energy of a Spherical Graph Representation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Adjacency matrix; Graph energy; Distance-regular graph; Eigenvalues and eigenvectors; Graph; Mathematics; Lambda; Regular graph; Geometric graph theory; Discrete mathematics; Graph power; Line graph; Physics; Quantum mechanics","score_opus":0.027743593379815256,"score_gpt":0.26531944868097446,"score_spread":0.2375758553011592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390681211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028941477,0.00042331498,0.9481247,0.0005059618,0.00013364413,0.00004598405,0.00013795984,0.0002553743,0.02143153],"genre_scores_gemma":[0.43999457,0.0016759869,0.49684384,0.00053501996,0.00024003476,0.0003026769,0.0009913513,0.0021908076,0.057225745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976295,0.000081111946,0.000008810947,0.000036196783,0.00008424854,0.000026648226],"domain_scores_gemma":[0.99957484,0.00022984066,0.000027124432,0.00006308809,0.00006822204,0.00003684208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052305526,0.0009784782,0.0009136217,0.0007978194,0.0004306626,0.0011349947,0.0012264403,0.0014173303,0.0056921486],"category_scores_gemma":[0.002105575,0.00047125184,0.00056096044,0.0010307486,0.001045135,0.0015525025,0.0019702325,0.0012548431,0.001253483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009454135,0.00006602996,0.00029020867,0.00021151603,0.000040365,0.00006433249,0.00014030363,0.36326316,0.009320616,0.505243,0.011106966,0.11015897],"study_design_scores_gemma":[0.00001129717,0.0000434941,0.00014717961,0.000026116511,0.000011062858,0.00006367862,0.00006373325,0.7166727,0.00123107,0.27768174,0.004036219,0.000011634069],"about_ca_topic_score_codex":0.0015612667,"about_ca_topic_score_gemma":0.0022426408,"teacher_disagreement_score":0.0056921486,"about_ca_system_score_codex":0.00078561617,"about_ca_system_score_gemma":0.00045930326,"threshold_uncertainty_score":0.019042134},"labels":[],"label_agreement":null},{"id":"W4390681216","doi":"10.1007/978-3-031-49275-4_1","title":"Cops and Robbers on 1-Planar Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"York University; University of Manitoba","funders":"","keywords":"Planar graph; Planar; Pathwidth; Combinatorics; 1-planar graph; Outerplanar graph; Chordal graph; Planar straight-line graph; Computer science; Indifference graph; Mathematics; Book embedding; Graph; Discrete mathematics; Line graph; Computer graphics (images)","score_opus":0.024908045172357517,"score_gpt":0.2772720050297431,"score_spread":0.2523639598573856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390681216","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.12646778,0.0093023125,0.16815361,0.003316089,0.0012950039,0.00015096436,0.00062091846,0.00058581703,0.6901076],"genre_scores_gemma":[0.5457892,0.0107456595,0.06475083,0.00079482415,0.0015207059,0.00033996042,0.0010378866,0.0007351728,0.3742857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.00008676656,0.000014824683,0.00008815664,0.000112907175,0.00008635694],"domain_scores_gemma":[0.99947923,0.0002939067,0.000059964423,0.00006048109,0.0000526699,0.000053846317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023831279,0.0012211156,0.0010878154,0.0019817576,0.0018952886,0.0023056737,0.0014336844,0.0011970418,0.020105626],"category_scores_gemma":[0.0016694074,0.00096430327,0.0010322625,0.002454634,0.0020832305,0.004833484,0.002248273,0.002831229,0.0033535697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020174033,0.0000151433815,0.000048896716,0.00011350628,0.0000057725097,0.00006681394,0.00021402372,0.0027353955,0.0005094052,0.9708458,0.007935526,0.017489478],"study_design_scores_gemma":[0.0000064806504,0.000010296549,0.00014860899,0.000028017952,0.000006638284,0.000107677,0.000082782644,0.0028990812,0.00022197966,0.9806003,0.015880005,0.0000081296885],"about_ca_topic_score_codex":0.0015007221,"about_ca_topic_score_gemma":0.0020875658,"teacher_disagreement_score":0.020105626,"about_ca_system_score_codex":0.0011474447,"about_ca_system_score_gemma":0.00037579436,"threshold_uncertainty_score":0.06726003},"labels":[],"label_agreement":null},{"id":"W4390681285","doi":"10.1007/978-3-031-49275-4","title":"Graph Drawing and Network Visualization","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Universitat Politècnica de Catalunya; Masarykova Univerzita; Università degli Studi di Perugia; Universität Konstanz; University of South Carolina; University of Waterloo; Brown University; University of Crete; Linköpings Universitet; Julius-Maximilians-Universität Würzburg; Technische Universität Berlin; Universität Wien; University of Ioannina; Universiteit Maastricht; Technische Universität Wien; Universiteit Utrecht; Swansea University; Università degli Studi Roma Tre; Universität Osnabrück; Univerzita Karlova v Praze","keywords":"Graph drawing; Computer science; Visualization; Graph; Computer graphics (images); Information visualization; Theoretical computer science; Artificial intelligence","score_opus":0.018498061630371487,"score_gpt":0.2911656766106998,"score_spread":0.2726676149803283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390681285","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014267182,0.0028169346,0.94576776,0.0005605938,0.00046965055,0.00006369433,0.00053412764,0.006097527,0.04226295],"genre_scores_gemma":[0.040722992,0.009758388,0.833291,0.00038793555,0.0007365666,0.0003375953,0.002701069,0.0052104997,0.106854066],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996712,0.000072402356,0.0000150879105,0.00008327073,0.00013378097,0.000024169854],"domain_scores_gemma":[0.99929523,0.00034955112,0.000026348953,0.00015869206,0.00013281377,0.000037319674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003729552,0.0021128252,0.0010778306,0.002695147,0.0006192582,0.0027701424,0.0015396754,0.0008337815,0.051714033],"category_scores_gemma":[0.0018146503,0.00109543,0.0010369305,0.0042551425,0.00080606324,0.0031149078,0.0015931354,0.002207376,0.014987882],"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.000057927995,0.000051215655,0.00022301362,0.00047848793,0.000051497223,0.0001389374,0.00024623968,0.027082575,0.005939081,0.17603928,0.15941824,0.6302735],"study_design_scores_gemma":[0.000024356928,0.000030334319,0.0004113161,0.00015867413,0.000055091194,0.0003938728,0.00012256365,0.16953306,0.007253133,0.4597199,0.36224803,0.000049628317],"about_ca_topic_score_codex":0.0017432957,"about_ca_topic_score_gemma":0.002277363,"teacher_disagreement_score":0.051714033,"about_ca_system_score_codex":0.0006220351,"about_ca_system_score_gemma":0.000426738,"threshold_uncertainty_score":0.1730007},"labels":[],"label_agreement":null},{"id":"W4390700576","doi":"10.1007/978-3-031-51476-0_7","title":"Evaluating the Security Posture of 5G Networks by Combining State Auditing and Event Monitoring","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software-Defined Networks and 5G","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Scalability; Audit; Event (particle physics); Network security; Latency (audio); Computer security; Computer network; Telecommunications; Database","score_opus":0.02076315290114931,"score_gpt":0.28833506511284723,"score_spread":0.2675719122116979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390700576","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.9476567,0.00027754376,0.044979963,0.00020591162,0.000049573096,0.00008239486,0.0002900949,0.00042123307,0.0060365503],"genre_scores_gemma":[0.9950519,0.000059619604,0.004355257,0.000011986274,0.000008058155,0.0000068942536,0.00013343457,0.000007764032,0.00036508933],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982791,0.0007363842,0.000099845216,0.00019283092,0.000517101,0.00017476217],"domain_scores_gemma":[0.9930912,0.0037864405,0.0013386812,0.00042094957,0.0010654941,0.0002971888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027352832,0.0007954778,0.0003719717,0.0011139053,0.00026342235,0.0011591729,0.0004728206,0.000758145,0.000979542],"category_scores_gemma":[0.008668648,0.00019238006,0.00022393481,0.0006373598,0.00039105152,0.0016905965,0.0006642067,0.0004707432,0.00025248577],"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.0032955355,0.0006771322,0.3330493,0.00020433418,0.0003718061,0.00041161466,0.00038904493,0.32860786,0.03221817,0.0057179257,0.0022965446,0.29276073],"study_design_scores_gemma":[0.00002980081,0.0013490806,0.10097779,0.000041300642,0.00013199403,0.00014980909,0.00037369644,0.88119066,0.011187237,0.0038736882,0.0006566647,0.000038363247],"about_ca_topic_score_codex":0.0020132612,"about_ca_topic_score_gemma":0.0033319043,"teacher_disagreement_score":0.0027352832,"about_ca_system_score_codex":0.0006351092,"about_ca_system_score_gemma":0.00048168207,"threshold_uncertainty_score":0.014465749},"labels":[],"label_agreement":null},{"id":"W4390741694","doi":"10.1007/978-3-031-50594-2_20","title":"Committed Private Information Retrieval","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Verifiable secret sharing; Server; Correctness; Scheme (mathematics); Computer science; Private information retrieval; Theoretical computer science; Algorithm; Computer network; Computer security; Mathematics; Programming language","score_opus":0.01072638707777102,"score_gpt":0.2302576960657688,"score_spread":0.21953130898799778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390741694","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018765712,0.007759467,0.6053203,0.0037327423,0.0011389666,0.0002798773,0.0012467416,0.00370172,0.35805443],"genre_scores_gemma":[0.39130697,0.006471017,0.15760489,0.0017202077,0.0013201616,0.00024154747,0.004721233,0.0019160764,0.43469787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981975,0.00030205306,0.00009547264,0.00024740517,0.0009897829,0.00016782309],"domain_scores_gemma":[0.99733424,0.00064994453,0.000084137144,0.0015836878,0.00028532612,0.0000626611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011025822,0.0006755946,0.00090419815,0.0016286246,0.0011359748,0.0041132327,0.0018086144,0.0010573448,0.03277258],"category_scores_gemma":[0.005238173,0.00051107985,0.0005196017,0.0027507688,0.0017468452,0.007812754,0.0032776573,0.0023809853,0.015410837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010878598,0.00006271252,0.00012406308,0.00020734298,0.000020850983,0.00007134481,0.00022232118,0.0024748666,0.003072883,0.69574183,0.042399894,0.25549316],"study_design_scores_gemma":[0.000022208382,0.00003524732,0.0001270671,0.00007513973,0.000021691443,0.00036864183,0.00008041114,0.016320348,0.008367344,0.84545076,0.12910827,0.00002285992],"about_ca_topic_score_codex":0.00042034758,"about_ca_topic_score_gemma":0.00048479086,"teacher_disagreement_score":0.03277258,"about_ca_system_score_codex":0.0015268917,"about_ca_system_score_gemma":0.0012582415,"threshold_uncertainty_score":0.109635174},"labels":[],"label_agreement":null},{"id":"W4390747554","doi":"10.1007/978-3-031-50594-2_9","title":"Making an Asymmetric PAKE Quantum-Annoying by Hiding Group Elements","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"","keywords":"Discrete logarithm; Computer science; Random oracle; Theoretical computer science; Password; Logarithm; Protocol (science); Quantum; Key exchange; Encryption; Computer security; Mathematics; Public-key cryptography; Quantum mechanics; Physics","score_opus":0.03144301422876767,"score_gpt":0.28756138028667794,"score_spread":0.2561183660579103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390747554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26914394,0.00058282685,0.45347515,0.009895386,0.0015047609,0.00022466504,0.00029944928,0.001800731,0.26307312],"genre_scores_gemma":[0.8803879,0.00046602054,0.03707101,0.000544044,0.00023870831,0.00006914909,0.00008150661,0.0003290873,0.08081258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874806,0.00017057442,0.0000373851,0.00014028353,0.00057664205,0.00032705546],"domain_scores_gemma":[0.99832743,0.0004460895,0.00012404445,0.00079891353,0.0001736936,0.00012992187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506382,0.0006676749,0.0006273432,0.00045242257,0.0017433588,0.002573196,0.00092016894,0.0019473558,0.01584235],"category_scores_gemma":[0.0032062437,0.00056184246,0.00077525026,0.000589293,0.0044051353,0.0067100804,0.0035461192,0.0038149778,0.004042842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002764465,0.000099985846,0.00021554183,0.000092306494,0.000027073795,0.00021678327,0.0005430304,0.0041976646,0.022590756,0.94204146,0.004627564,0.0250715],"study_design_scores_gemma":[0.000055497232,0.00016481611,0.00030721305,0.00006033488,0.000054826407,0.00048865937,0.00040709073,0.025249634,0.048392687,0.89566094,0.029080706,0.00007751424],"about_ca_topic_score_codex":0.00024449025,"about_ca_topic_score_gemma":0.00031290358,"teacher_disagreement_score":0.01584235,"about_ca_system_score_codex":0.00054619135,"about_ca_system_score_gemma":0.0007406817,"threshold_uncertainty_score":0.052997947},"labels":[],"label_agreement":null},{"id":"W4390761416","doi":"10.1007/978-3-031-49272-3_3","title":"Min-k-planar Drawings of Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planar graph; Planar; Combinatorics; Book embedding; Graph drawing; Outerplanar graph; Planar straight-line graph; Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Upper and lower bounds; Crossing number (knot theory); Computer science; 1-planar graph; Pathwidth; Discrete mathematics; Geometry; Computer graphics (images); Chordal graph; Line graph; Artificial intelligence; Materials science","score_opus":0.018247476838354103,"score_gpt":0.24332454901570885,"score_spread":0.22507707217735476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390761416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06544693,0.004588208,0.5544447,0.0013548314,0.0006416179,0.00022481919,0.004063041,0.002278976,0.36695695],"genre_scores_gemma":[0.3455704,0.008655611,0.44194865,0.00054788287,0.00036282744,0.00027296194,0.0062068794,0.0023561532,0.19407858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962914,0.000063981315,0.000023267738,0.00010402866,0.0001205409,0.00005900641],"domain_scores_gemma":[0.99937767,0.00018937416,0.000063116684,0.00018293,0.00012521262,0.0000616927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002037972,0.0009959271,0.00070769864,0.00095280254,0.00061468105,0.0023978702,0.0016118191,0.0008034801,0.027819162],"category_scores_gemma":[0.0016733086,0.0012456723,0.00069325714,0.0021498196,0.00070288545,0.0030473727,0.0015120569,0.0024337834,0.0075828945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017041287,0.000059211012,0.0004354102,0.00080292096,0.000048355298,0.00017382202,0.0004093155,0.022230342,0.010382967,0.5576149,0.06130214,0.34637016],"study_design_scores_gemma":[0.000032757547,0.00005398788,0.0010286273,0.0001480536,0.00004531371,0.00074099906,0.00022381006,0.025967123,0.00686665,0.8062959,0.15855968,0.000037053025],"about_ca_topic_score_codex":0.0011100321,"about_ca_topic_score_gemma":0.0025119223,"teacher_disagreement_score":0.027819162,"about_ca_system_score_codex":0.00091826275,"about_ca_system_score_gemma":0.00037486243,"threshold_uncertainty_score":0.09306437},"labels":[],"label_agreement":null},{"id":"W4390761431","doi":"10.1007/978-3-031-49272-3_19","title":"Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Combinatorics; Interval graph; Mathematics; Conjecture; Line graph; Intersection graph; Pathwidth; Discrete mathematics; Block graph; Graph; Complement (music); Interval (graph theory)","score_opus":0.03456102144668092,"score_gpt":0.3022580983892588,"score_spread":0.2676970769425779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390761431","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.2561194,0.006764137,0.16026306,0.002459076,0.0006320672,0.000069798785,0.0005039923,0.0002567552,0.5729317],"genre_scores_gemma":[0.9058899,0.004383501,0.031046454,0.00026852044,0.00032448678,0.000057344896,0.00035778817,0.00010404397,0.05756781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981946,0.00005012518,0.000008689061,0.00004006574,0.000053755546,0.000027877428],"domain_scores_gemma":[0.99937195,0.00038545846,0.000057806003,0.000059341397,0.000077942714,0.000047537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003181457,0.00027798963,0.00040402287,0.00097383925,0.0010210226,0.0027209476,0.00042985912,0.0005320038,0.007255785],"category_scores_gemma":[0.001509267,0.00029742488,0.00037251995,0.0019037294,0.0018850862,0.0043662586,0.0007148812,0.0014411693,0.00070661295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021092661,0.000006718712,0.00006380314,0.000020057507,0.0000019373745,0.00002394275,0.00012774406,0.0009144536,0.00016928795,0.98723805,0.0013667784,0.010046225],"study_design_scores_gemma":[0.00000576915,0.000008075495,0.00008715757,0.0000114927525,0.0000033739332,0.000042844953,0.00011921914,0.0014999106,0.00019787136,0.98799974,0.010020277,0.0000041518533],"about_ca_topic_score_codex":0.0014028436,"about_ca_topic_score_gemma":0.001616129,"teacher_disagreement_score":0.007255785,"about_ca_system_score_codex":0.00076081813,"about_ca_system_score_gemma":0.00046495858,"threshold_uncertainty_score":0.024273038},"labels":[],"label_agreement":null},{"id":"W4390841972","doi":"10.1007/978-3-031-51709-9_2","title":"Dialectical Relationship Analysis of Data Governance Elements in the Financial Format—Based on the “Voyage Chart” Architecture","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Chart; Dialectic; Corporate governance; Computer science; Data governance; Architecture; Digital transformation; Value (mathematics); Accounting; Finance; Knowledge management; Operations research; Business; Engineering; World Wide Web; Marketing","score_opus":0.08589473261632817,"score_gpt":0.2983791304485916,"score_spread":0.21248439783226342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390841972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032913413,0.00034182568,0.8820916,0.0017399244,0.00010795578,0.00027593935,0.00033605666,0.0006121807,0.0815811],"genre_scores_gemma":[0.5333976,0.000264979,0.44541904,0.00019265794,0.000048169106,0.00032515236,0.00089415145,0.00026945217,0.019188743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952211,0.002752366,0.00026775038,0.00070325064,0.00071996753,0.00033552785],"domain_scores_gemma":[0.99693525,0.0015797244,0.00021698239,0.00055919285,0.00055352406,0.00015527927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004403793,0.0004365455,0.00041791194,0.0031075443,0.0023060949,0.007906873,0.0016549622,0.0013210978,0.010192449],"category_scores_gemma":[0.008783209,0.0004935688,0.0013634065,0.0033138636,0.0058965,0.012892704,0.0031347107,0.0022984082,0.0013733879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022484708,0.000014128174,0.0006721698,0.000022397646,0.000008320747,0.000048428265,0.0018232105,0.00075870595,0.00032720223,0.9812718,0.0008394205,0.014191651],"study_design_scores_gemma":[0.000020252462,0.000034252793,0.0013531033,0.000106713065,0.000041733358,0.00016894855,0.003471001,0.036512166,0.002166883,0.90877515,0.04732223,0.000027559034],"about_ca_topic_score_codex":0.0063324044,"about_ca_topic_score_gemma":0.004750123,"teacher_disagreement_score":0.010192449,"about_ca_system_score_codex":0.003377948,"about_ca_system_score_gemma":0.0033706373,"threshold_uncertainty_score":0.034097135},"labels":[],"label_agreement":null},{"id":"W4390843280","doi":"10.1007/978-3-031-52213-0_10","title":"An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Lethbridge","funders":"","keywords":"Interior point method; Computer science; Point (geometry); Convergence (economics); Mathematical optimization; Newton's method in optimization; Algorithm; Linear programming; Newton's method; Iterative method; Local convergence; Mathematics; Nonlinear system","score_opus":0.0780736977256255,"score_gpt":0.4255588921074055,"score_spread":0.34748519438178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390843280","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.0008495454,0.00016532386,0.99546057,0.000029583296,0.00009623612,0.000020636186,0.00001928055,0.00023419471,0.00312468],"genre_scores_gemma":[0.025851576,0.00034130688,0.96145904,0.00005879578,0.00008933997,0.00016331898,0.00009283528,0.0005079057,0.01143592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995821,0.00012429158,0.000013372893,0.00003781912,0.00022170942,0.000020628306],"domain_scores_gemma":[0.99967015,0.00016159116,0.000020637284,0.000043574997,0.0000898102,0.000014235319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046498387,0.0010453928,0.0013539734,0.00057987723,0.00043409158,0.00067158527,0.0012404314,0.0010115779,0.009612034],"category_scores_gemma":[0.0013268327,0.00059200707,0.0010526081,0.00084795384,0.0005750311,0.00081001595,0.001139128,0.0020485139,0.0033767247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017717484,0.0001745127,0.00019251122,0.00061462953,0.00010226041,0.00017924281,0.0001665828,0.40976694,0.024134392,0.11992693,0.019111194,0.42545354],"study_design_scores_gemma":[0.000018918303,0.000042744316,0.0000790877,0.000020922047,0.00001592133,0.000057671023,0.000008302651,0.96867406,0.0021384717,0.013080872,0.015847793,0.000015195746],"about_ca_topic_score_codex":0.0014348617,"about_ca_topic_score_gemma":0.0018302283,"teacher_disagreement_score":0.009612034,"about_ca_system_score_codex":0.00036897443,"about_ca_system_score_gemma":0.00063651084,"threshold_uncertainty_score":0.032155395},"labels":[],"label_agreement":null},{"id":"W4390843319","doi":"10.1007/978-3-031-52213-0","title":"Algorithms and Discrete Applied Mathematics","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Image Processing Techniques","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":"Carleton University","funders":"Indian Institute of Technology Guwahati; Indian Institute of Technology Kharagpur; Univerza v Ljubljani; Freie Universität Berlin; Université de Bordeaux; Indian Institute of Technology Delhi; Ben-Gurion University of the Negev; Technische Universiteit Eindhoven; Indian Institute of Technology Bhilai; Indian Institute of Technology Palakkad; University of Ottawa; Indian Institute of Technology Gandhinagar; Institute of Mathematical Sciences; University of Lethbridge; Indian Institute of Technology Kanpur; Indian Institute of Science","keywords":"Computer science; Theoretical computer science; Algorithm; Calculus (dental); Algebra over a field; Mathematics; Pure mathematics","score_opus":0.013166751723277479,"score_gpt":0.2623623419255963,"score_spread":0.24919559020231885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390843319","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060500554,0.06749788,0.3057248,0.0048638275,0.0075395177,0.00009307887,0.0007337191,0.0010109124,0.6064862],"genre_scores_gemma":[0.13729769,0.07622014,0.14366595,0.0022242283,0.010739989,0.0004439095,0.0014547987,0.0012445345,0.62670875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959904,0.000075536045,0.00001994981,0.000071314484,0.00020325938,0.000030886495],"domain_scores_gemma":[0.99961793,0.000174097,0.000022308399,0.00008427441,0.000072276736,0.000029054212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035129808,0.0013416519,0.0018449067,0.0019469934,0.0008651216,0.0032381804,0.0008681841,0.000747652,0.027993783],"category_scores_gemma":[0.0012682091,0.000439267,0.00063504593,0.0039951596,0.001660449,0.0026142846,0.0011695911,0.0033982254,0.012483661],"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.000020873307,0.000031974327,0.00009671198,0.000338027,0.00002226039,0.000033867156,0.000101786456,0.0019543222,0.0008866982,0.74086064,0.07415821,0.18149462],"study_design_scores_gemma":[0.000015132876,0.000026179778,0.00034366577,0.000090606525,0.00001604684,0.00020631109,0.000045232835,0.006650806,0.00040469939,0.72204643,0.2701431,0.000011753888],"about_ca_topic_score_codex":0.00047270663,"about_ca_topic_score_gemma":0.0005572992,"teacher_disagreement_score":0.027993783,"about_ca_system_score_codex":0.0011514807,"about_ca_system_score_gemma":0.00073022844,"threshold_uncertainty_score":0.09364849},"labels":[],"label_agreement":null},{"id":"W4390866293","doi":"10.1007/978-981-96-0891-1_10","title":"An Algorithmic Approach to (2, 2)-Isogenies in the Theta Model and Applications to Isogeny-Based Cryptography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Capital Commission","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Isogeny; Subroutine; Cryptography; Computer science; Rust (programming language); Algorithm; Elliptic curve cryptography; Mathematics; Elliptic curve; Public-key cryptography; Encryption; Pure mathematics; Operating system; Programming language","score_opus":0.016589218436355874,"score_gpt":0.2520204255616119,"score_spread":0.23543120712525603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390866293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031304862,0.008551492,0.5334967,0.0053844233,0.0030639172,0.000120265555,0.00020213697,0.0004827733,0.41739354],"genre_scores_gemma":[0.5106341,0.011274806,0.25193864,0.0029844786,0.0048393467,0.00036552653,0.00040106144,0.000676979,0.21688505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993736,0.00019115867,0.000034493343,0.00010458003,0.00020125767,0.00009486688],"domain_scores_gemma":[0.99950624,0.0002268207,0.000040828912,0.00011098756,0.000077845616,0.000037310296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009244103,0.0012242461,0.0010609844,0.0020641633,0.0019211601,0.00441538,0.0017640163,0.0019318784,0.012499501],"category_scores_gemma":[0.0018517122,0.0006803883,0.0015382702,0.0024913242,0.0053639216,0.007840073,0.0026429307,0.0066662626,0.0034108285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003532122,0.000007940654,0.00001612166,0.000013010648,0.0000012826973,0.00001600183,0.000052427567,0.0003589111,0.00012929944,0.99457896,0.0011020675,0.0037204376],"study_design_scores_gemma":[0.0000028065658,0.000006219754,0.00001516288,0.000007378016,0.0000011991146,0.00004527296,0.000023334302,0.0010307784,0.00007811061,0.9918532,0.0069324304,0.000004170146],"about_ca_topic_score_codex":0.00048183155,"about_ca_topic_score_gemma":0.00063860934,"teacher_disagreement_score":0.012499501,"about_ca_system_score_codex":0.0017740856,"about_ca_system_score_gemma":0.00084251433,"threshold_uncertainty_score":0.041815042},"labels":[],"label_agreement":null},{"id":"W4390897515","doi":"10.1007/978-3-031-59933-0_8","title":"Toward A Digital Twin IoT for the Validation of AI Algorithms in Smart-City Applications","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Transformation in Industry","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":"École de Technologie Supérieure","funders":"","keywords":"Internet of Things; Computer science; Embedded system","score_opus":0.027620280868917987,"score_gpt":0.25275217012611556,"score_spread":0.22513188925719757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390897515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01843088,0.0009857002,0.92529786,0.0018041845,0.00056316523,0.00021064407,0.00021404368,0.0019572354,0.050536312],"genre_scores_gemma":[0.24235915,0.001281775,0.73553425,0.00074379606,0.00019810467,0.0003407094,0.00072438,0.00070703257,0.018110849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971308,0.0008709632,0.00015943496,0.0003183283,0.0013626607,0.00015788389],"domain_scores_gemma":[0.99350184,0.0025142222,0.00017501469,0.0021105285,0.0014429422,0.00025548943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047542905,0.00074770086,0.0005997419,0.0012530539,0.00084834226,0.0059290426,0.0027600967,0.002250109,0.010214776],"category_scores_gemma":[0.012341585,0.0005057358,0.0005775069,0.0010171608,0.0027117352,0.008619283,0.0038062423,0.0033765275,0.003216943],"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.00038471678,0.0003295602,0.0026932624,0.00048196255,0.00008030464,0.00024536852,0.0007591032,0.028450446,0.036132082,0.6331489,0.011919644,0.2853747],"study_design_scores_gemma":[0.00006165068,0.00030160343,0.0010709849,0.00040008145,0.000060644823,0.00034608482,0.0006978855,0.5148009,0.05326304,0.3118986,0.117035516,0.00006307514],"about_ca_topic_score_codex":0.0013997749,"about_ca_topic_score_gemma":0.0017871514,"teacher_disagreement_score":0.010214776,"about_ca_system_score_codex":0.001056314,"about_ca_system_score_gemma":0.0019505686,"threshold_uncertainty_score":0.03417182},"labels":[],"label_agreement":null},{"id":"W4390963261","doi":"10.1007/978-3-031-56992-0_15","title":"Co-creative Orchestration of Angeles with Layer Scores and Orchestration Plans","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","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; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Orchestration; Layer (electronics); Business; Psychology; Computer science; Art; Visual arts; Materials science; Nanotechnology","score_opus":0.021799061700995322,"score_gpt":0.2578983206331686,"score_spread":0.23609925893217326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390963261","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.15204057,0.00025147878,0.44194475,0.00044179743,0.00038302844,0.00017551612,0.00024192574,0.0060092723,0.39851162],"genre_scores_gemma":[0.7697686,0.00016470598,0.12754805,0.000057660138,0.00008261994,0.00014691365,0.00036322174,0.0012037645,0.10066453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961627,0.00008476725,0.0000206735,0.00007487093,0.0001196272,0.000083800136],"domain_scores_gemma":[0.999506,0.00013133595,0.000029851386,0.00014548286,0.00006458023,0.00012266844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046565625,0.00061244227,0.0003531382,0.0008174077,0.0013176774,0.0035231388,0.00089356996,0.0005065152,0.02422779],"category_scores_gemma":[0.0016659041,0.00035840404,0.00050277816,0.0007237607,0.001151941,0.002234878,0.0037719642,0.0010833049,0.004427848],"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.0011006062,0.00028768327,0.0048312666,0.00026884174,0.00010024942,0.0010447426,0.012633751,0.020753799,0.045228124,0.47725755,0.022095485,0.4143979],"study_design_scores_gemma":[0.00028521943,0.0006217627,0.008036977,0.0003450255,0.00030663479,0.0012296956,0.02131792,0.22352588,0.06277218,0.21815546,0.46317792,0.00022531717],"about_ca_topic_score_codex":0.0013291478,"about_ca_topic_score_gemma":0.0038604122,"teacher_disagreement_score":0.02422779,"about_ca_system_score_codex":0.00049063563,"about_ca_system_score_gemma":0.0005348608,"threshold_uncertainty_score":0.08105004},"labels":[],"label_agreement":null},{"id":"W4391036464","doi":"10.1007/978-3-031-50069-5_21","title":"MRI-GAN: Generative Adversarial Network for Brain Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Image segmentation; Deep learning; Generative adversarial network; Pattern recognition (psychology); Sørensen–Dice coefficient; Generative grammar; White matter; Metric (unit); Computer vision; Generative model; Magnetic resonance imaging; Radiology; Medicine","score_opus":0.017448868451000063,"score_gpt":0.2890999962991844,"score_spread":0.27165112784818435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391036464","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.0015535982,0.0003954081,0.9884375,0.0001527573,0.00010844353,0.000046976587,0.00052667985,0.0065405965,0.0022380028],"genre_scores_gemma":[0.118328296,0.0011321671,0.8436553,0.00081840425,0.00020415706,0.00037982353,0.0045369444,0.004575381,0.02636956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997793,0.000050963787,0.000007846334,0.000068254216,0.000067509165,0.000026147865],"domain_scores_gemma":[0.99975044,0.00011464007,0.000015239943,0.000054116877,0.000048002494,0.000017566112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052314,0.0012686248,0.0007923892,0.00048527837,0.00020372336,0.0007020898,0.0017866463,0.0013736928,0.009892435],"category_scores_gemma":[0.0011733824,0.0008070559,0.00092688715,0.00055493694,0.0003502297,0.0007107903,0.0013175098,0.002592392,0.005894306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018331694,0.00007791944,0.0003194733,0.00018049011,0.00013585271,0.0001427041,0.000043460117,0.52243793,0.013025897,0.012195351,0.056065585,0.39519197],"study_design_scores_gemma":[0.0000062839576,0.000012740637,0.0000775606,0.000010286548,0.000007347623,0.00006246076,0.0000030743347,0.9881527,0.0027303328,0.005006758,0.003922548,0.000007884149],"about_ca_topic_score_codex":0.0036989371,"about_ca_topic_score_gemma":0.0073888055,"teacher_disagreement_score":0.009892435,"about_ca_system_score_codex":0.0005226752,"about_ca_system_score_gemma":0.00052770297,"threshold_uncertainty_score":0.033093512},"labels":[],"label_agreement":null},{"id":"W4391069929","doi":"10.1007/978-3-031-50075-6_33","title":"Exploring the Transferability of a Foundation Model for Fundus Images: Application to Hypertensive Retinopathy","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"DiagnoCure (Canada); École de Technologie Supérieure","funders":"","keywords":"Computer science; Initialization; Artificial intelligence; Deep learning; Transferability; Fundus (uterus); Machine learning; Transfer of learning; Fluid-attenuated inversion recovery; Contextual image classification; Classifier (UML); Pattern recognition (psychology); Image (mathematics); Magnetic resonance imaging; Ophthalmology","score_opus":0.06709629298375425,"score_gpt":0.2957001497692471,"score_spread":0.22860385678549283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391069929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24748029,0.00023700268,0.74609226,0.00052505377,0.000025376276,0.000046437068,0.0001824574,0.00032285906,0.005088273],"genre_scores_gemma":[0.9097935,0.0002931493,0.08600494,0.000054599754,0.00003143355,0.000038514696,0.00025583475,0.00013431557,0.003393731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976796,0.00009108816,0.000009429117,0.000044626755,0.000050707964,0.00003629451],"domain_scores_gemma":[0.9961229,0.0029907573,0.00024038985,0.00027180547,0.00024544998,0.00012875746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750827,0.00043612169,0.00056402036,0.00060278975,0.00040863248,0.0013131935,0.0008385046,0.0010896205,0.0030165839],"category_scores_gemma":[0.007620409,0.00039841433,0.00095475395,0.0005487357,0.00079220795,0.0018690118,0.0012969447,0.001315753,0.00021397648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003811725,0.000193738,0.0040362794,0.00014889495,0.00006282306,0.00040252623,0.00040867252,0.7368053,0.012410884,0.15343149,0.0020909032,0.08962731],"study_design_scores_gemma":[0.0000058436494,0.000029074876,0.00040225242,0.000005928738,0.000006099379,0.000031706673,0.00003056025,0.9752273,0.00046046704,0.02358738,0.00020882189,0.000004525318],"about_ca_topic_score_codex":0.009166405,"about_ca_topic_score_gemma":0.004192693,"teacher_disagreement_score":0.009166405,"about_ca_system_score_codex":0.0010808407,"about_ca_system_score_gemma":0.00083194626,"threshold_uncertainty_score":0.018226147},"labels":[],"label_agreement":null},{"id":"W4391274453","doi":"10.1007/978-3-031-53311-2_30","title":"Multi-modal Video Topic Segmentation with Dual-Contrastive Domain Adaptation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Domain adaptation; Segmentation; Artificial intelligence; Modal; Domain (mathematical analysis); Adaptation (eye); Semantics (computer science); Computer vision; Dual (grammatical number); Adaptability; Natural language processing; Linguistics","score_opus":0.01309883878653341,"score_gpt":0.23572622984253436,"score_spread":0.22262739105600093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391274453","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.02335659,0.0016385936,0.9652918,0.00022700119,0.0003423395,0.00013275773,0.0006193963,0.0039575086,0.0044339835],"genre_scores_gemma":[0.24405412,0.0014097943,0.73497033,0.0003669276,0.0005321533,0.00031901212,0.003903282,0.0011718615,0.013272564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946254,0.00010985995,0.000025274558,0.00021843571,0.00010339459,0.00008044136],"domain_scores_gemma":[0.9993673,0.00021558288,0.000032984273,0.00010954943,0.00022197443,0.000052586962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087731227,0.00097476,0.0009270691,0.0013894989,0.0003846122,0.00093454885,0.0009857978,0.0010017467,0.0028979299],"category_scores_gemma":[0.0016709404,0.00031946055,0.0010178365,0.0017135891,0.00036145217,0.0011003154,0.001357157,0.0014203597,0.0027101377],"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.00079937617,0.00024579925,0.00057868083,0.00025556787,0.00013075481,0.00010089697,0.00012091967,0.01566585,0.15752332,0.0018084676,0.008572187,0.81419826],"study_design_scores_gemma":[0.00006142246,0.00022282379,0.004029406,0.000042276966,0.00018240856,0.00029771856,0.0001354828,0.89212835,0.084299155,0.0043619173,0.014181423,0.000057739268],"about_ca_topic_score_codex":0.0026003702,"about_ca_topic_score_gemma":0.0045702425,"teacher_disagreement_score":0.0028979299,"about_ca_system_score_codex":0.00036005792,"about_ca_system_score_gemma":0.0005827986,"threshold_uncertainty_score":0.009694517},"labels":[],"label_agreement":null},{"id":"W4391452832","doi":"10.1007/978-3-031-52448-6_23","title":"Automatic Landing Zone Plane Detection in Contrast-Enhanced Cardiac CT Volumes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","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":"Circle Cardiovascular Imaging","funders":"","keywords":"Contrast (vision); Computer science; Plane (geometry); Computer vision; Computer graphics (images); Artificial intelligence; Geometry; Mathematics","score_opus":0.005585515749341598,"score_gpt":0.21022653396311258,"score_spread":0.20464101821377098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391452832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05517995,0.0023893532,0.9348054,0.00015729028,0.0001311146,0.00010408078,0.00044642933,0.004175022,0.0026113742],"genre_scores_gemma":[0.3286228,0.0036855647,0.65857506,0.00014566019,0.00021509407,0.00007703958,0.0014977963,0.00091155036,0.006269393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979764,0.00002986528,0.000012219385,0.000035832796,0.000092743896,0.00003163856],"domain_scores_gemma":[0.9995012,0.00029667973,0.000036898295,0.00004341073,0.00009072146,0.000031032978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966338,0.00073762925,0.0005160762,0.001037051,0.00014977455,0.0014957478,0.0008854344,0.0007856412,0.0028166494],"category_scores_gemma":[0.0012222263,0.00050242146,0.000363718,0.00044925572,0.00023038719,0.0005368801,0.000689742,0.000612058,0.0017398678],"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.00064026273,0.000056818797,0.0031270378,0.00034329772,0.000052514333,0.00043308295,0.00009539345,0.008150366,0.23919182,0.0012870836,0.0063903662,0.740232],"study_design_scores_gemma":[0.00009935892,0.00039939093,0.024493255,0.00024268497,0.00019424946,0.008679039,0.00016811641,0.580419,0.36265498,0.00507787,0.017476002,0.00009609665],"about_ca_topic_score_codex":0.000711766,"about_ca_topic_score_gemma":0.0013538065,"teacher_disagreement_score":0.0028166494,"about_ca_system_score_codex":0.00015729642,"about_ca_system_score_gemma":0.00031488374,"threshold_uncertainty_score":0.0094226},"labels":[],"label_agreement":null},{"id":"W4391452861","doi":"10.1007/978-3-031-52448-6_35","title":"Accelerated Cardiac Parametric Mapping Using Deep Learning-Refined Subspace Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Subspace topology; Artificial intelligence; Parametric statistics; Deep learning; Parametric model; Mathematics","score_opus":0.05763208324203346,"score_gpt":0.31728178447461536,"score_spread":0.2596497012325819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391452861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027758514,0.00020300662,0.99549145,0.000067630324,0.000036429654,0.000009593886,0.000057291287,0.0003562892,0.0010024133],"genre_scores_gemma":[0.22572345,0.0014030432,0.75797987,0.00017370179,0.00012583965,0.000120351964,0.000621444,0.0005998121,0.013252481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998474,0.00003388259,0.0000059871777,0.000027251323,0.00007053399,0.000014909412],"domain_scores_gemma":[0.9996592,0.00015502168,0.000025192143,0.00006912348,0.000069877424,0.000021712533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041507636,0.0005478374,0.0005594341,0.0003095932,0.00012821611,0.0007832783,0.0007830458,0.00062799285,0.0034526442],"category_scores_gemma":[0.0015123305,0.00036535223,0.00058946526,0.0005226336,0.00029698142,0.00079148664,0.0011410557,0.0018914462,0.0013233874],"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.00014629767,0.00005480865,0.0003856877,0.00011460444,0.000055843248,0.0000971154,0.00007137523,0.4442471,0.020688888,0.030809427,0.008503385,0.49482548],"study_design_scores_gemma":[0.0000041115013,0.000020467853,0.00008760331,0.000007497007,0.000004507641,0.00009956593,0.000004206266,0.98676527,0.0027831872,0.0073504425,0.0028652106,0.000007992091],"about_ca_topic_score_codex":0.0016951198,"about_ca_topic_score_gemma":0.0025539924,"teacher_disagreement_score":0.0034526442,"about_ca_system_score_codex":0.00027093987,"about_ca_system_score_gemma":0.0005941469,"threshold_uncertainty_score":0.011550307},"labels":[],"label_agreement":null},{"id":"W4391465159","doi":"10.1007/978-3-031-47425-5_23","title":"Hessian-Based Similarity Metric for Multimodal Medical Image Registration","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Image registration; Computer science; Hessian matrix; Similarity (geometry); Metric (unit); Artificial intelligence; Computer vision; Image (mathematics); Mathematics","score_opus":0.0290223093919264,"score_gpt":0.3173664020879044,"score_spread":0.288344092695978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391465159","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.0057548997,0.00057594315,0.99147147,0.00008458347,0.0000546448,0.000047522113,0.00009934693,0.00038709946,0.0015243987],"genre_scores_gemma":[0.23211943,0.0011246376,0.7555182,0.0001231049,0.00012217858,0.00014507599,0.0008035429,0.00043441833,0.009609384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00020529026,0.00006606295,0.0001321101,0.00048681814,0.000036653197],"domain_scores_gemma":[0.999366,0.00016167008,0.00006778421,0.00010335759,0.00026706283,0.000034155433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007507768,0.00046995273,0.00094528974,0.0011380402,0.000273219,0.0009964852,0.0009913056,0.0007186075,0.0032856022],"category_scores_gemma":[0.0023327933,0.00023575764,0.00057666865,0.0016955732,0.00042279897,0.0012865119,0.001061452,0.00074106397,0.0012982911],"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.00020006369,0.00012619953,0.00055487093,0.00035142456,0.0001045808,0.00012345354,0.00009544319,0.06184754,0.06966145,0.04112223,0.010567128,0.81524557],"study_design_scores_gemma":[0.0000157498,0.00022355847,0.001908891,0.000028482615,0.000042802065,0.0006032695,0.000052616415,0.9473026,0.020745035,0.018642358,0.010379648,0.000054993172],"about_ca_topic_score_codex":0.0021306989,"about_ca_topic_score_gemma":0.0029346265,"teacher_disagreement_score":0.0032856022,"about_ca_system_score_codex":0.00060045085,"about_ca_system_score_gemma":0.0007341428,"threshold_uncertainty_score":0.010991454},"labels":[],"label_agreement":null},{"id":"W4391465172","doi":"10.1007/978-3-031-47425-5_28","title":"Leveraging Contrastive Learning with SimSiam for the Classification of Primary and Secondary Liver Cancers","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Primary (astronomy); Information retrieval","score_opus":0.03668729404504609,"score_gpt":0.2779101917228206,"score_spread":0.24122289767777452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391465172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2156411,0.009047355,0.7530259,0.0015576065,0.00087870075,0.00025037455,0.0020344197,0.0061594606,0.011405113],"genre_scores_gemma":[0.60779965,0.0014107706,0.3751801,0.0007904033,0.0005442699,0.00012841397,0.004370099,0.0002852833,0.009490984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994931,0.00013995734,0.000036553985,0.0001379533,0.00012220563,0.00007008208],"domain_scores_gemma":[0.9991198,0.0004682545,0.00004365871,0.00009844621,0.00022094362,0.000048878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017376058,0.0009226921,0.0010045804,0.001531652,0.00034483362,0.0011380396,0.0012958841,0.001071224,0.0023193571],"category_scores_gemma":[0.0023891726,0.00027446853,0.0012373585,0.00085185777,0.0003521805,0.00090534944,0.00127693,0.0011637243,0.0016423849],"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.0006325423,0.000267506,0.006764572,0.00018295043,0.00021135164,0.0001906219,0.00007684389,0.031626787,0.027099025,0.00233038,0.01145116,0.91916627],"study_design_scores_gemma":[0.000026056116,0.00024821403,0.0023301332,0.000029980454,0.000102997445,0.00026091462,0.000046710407,0.9717097,0.017117877,0.0041840724,0.003919247,0.000023950328],"about_ca_topic_score_codex":0.0022052936,"about_ca_topic_score_gemma":0.005226823,"teacher_disagreement_score":0.0023193571,"about_ca_system_score_codex":0.00039096916,"about_ca_system_score_gemma":0.00060780736,"threshold_uncertainty_score":0.0091894865},"labels":[],"label_agreement":null},{"id":"W4391465176","doi":"10.1007/978-3-031-47425-5","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2023 Workshops","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Eberhard Karls Universität Tübingen; University of Bern","keywords":"Computer science; Computer graphics (images); Multimedia; Human–computer interaction","score_opus":0.01215078078573951,"score_gpt":0.3109308536036566,"score_spread":0.2987800728179171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391465176","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017401809,0.05981935,0.45297128,0.008102245,0.030725807,0.00057971245,0.0031148382,0.008312035,0.41897294],"genre_scores_gemma":[0.04501313,0.027572673,0.15093692,0.00093142653,0.0059657563,0.0003333161,0.0059275776,0.0020149085,0.7613042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928147,0.0001061507,0.000030165682,0.000121216224,0.00037532346,0.00008570708],"domain_scores_gemma":[0.9990976,0.00013068855,0.00002685928,0.00012682943,0.00040233572,0.00021569247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015922035,0.0014299436,0.00083625165,0.0015886796,0.0005161748,0.0017069067,0.0015518189,0.0013152242,0.049736127],"category_scores_gemma":[0.0014017179,0.00056100264,0.0010305886,0.0014512665,0.00039646518,0.0010899294,0.0017757566,0.0016022911,0.030467428],"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.00014923405,0.00013304212,0.00017203964,0.00026810967,0.000051201405,0.00010645948,0.00005097699,0.0035654851,0.0074709235,0.007209048,0.4277783,0.55304515],"study_design_scores_gemma":[0.000035421333,0.00022662357,0.0030812328,0.00029624166,0.000047058293,0.0012130181,0.000064572436,0.036026128,0.013791786,0.018473146,0.9266776,0.000067124354],"about_ca_topic_score_codex":0.002375129,"about_ca_topic_score_gemma":0.0047530676,"teacher_disagreement_score":0.049736127,"about_ca_system_score_codex":0.0007016135,"about_ca_system_score_gemma":0.0014731159,"threshold_uncertainty_score":0.16638392},"labels":[],"label_agreement":null},{"id":"W4391466006","doi":"10.1007/978-3-031-34031-4_1","title":"Line–Cyclide Intersection and Colinear Point Quadruples in the Double Conformal Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algebraic and Geometric Analysis","field":"Mathematics","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":"Intersection (aeronautics); Computer science; Point (geometry); Conformal map; Line (geometry); Geometry; Mathematics; Cartography; Geography","score_opus":0.03914311780823482,"score_gpt":0.29421952838662774,"score_spread":0.2550764105783929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391466006","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.45791984,0.0015679685,0.069105685,0.0026950808,0.0013510688,0.00010610685,0.00046637532,0.0005154851,0.46627244],"genre_scores_gemma":[0.91210574,0.0008507757,0.0121381525,0.00055901293,0.0007596431,0.00009133799,0.00039642243,0.0002637461,0.072835274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960583,0.00007045819,0.00001767027,0.00007868609,0.00014025372,0.00008711127],"domain_scores_gemma":[0.9995541,0.00008072571,0.00007049029,0.00007259264,0.00008753455,0.00013441901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004042477,0.00082494266,0.0010269231,0.0027853742,0.0032625098,0.0037960652,0.0011842032,0.0018959732,0.011050566],"category_scores_gemma":[0.0010493177,0.00044254403,0.0009138418,0.0015958804,0.0032301345,0.0042269686,0.002209626,0.0030268666,0.0018553998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010514439,0.000010458795,0.000044800534,0.000010351528,0.0000022213528,0.00006641972,0.000060995582,0.0002813071,0.0002759677,0.99672854,0.0006167175,0.001891587],"study_design_scores_gemma":[0.000011259101,0.000015598325,0.00012929228,0.000008848484,0.0000033542453,0.00014629094,0.000116056784,0.0021287776,0.0002536524,0.9932509,0.003923955,0.000011951944],"about_ca_topic_score_codex":0.001989383,"about_ca_topic_score_gemma":0.0017322551,"teacher_disagreement_score":0.011050566,"about_ca_system_score_codex":0.0015894293,"about_ca_system_score_gemma":0.0007033009,"threshold_uncertainty_score":0.036967754},"labels":[],"label_agreement":null},{"id":"W4391508058","doi":"10.1007/978-981-99-9785-5_17","title":"Protecting Bilateral Privacy in Machine Learning-as-a-Service: A Differential Privacy Based Defense","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"National Research Council Canada; University of Guelph","funders":"","keywords":"Computer science; Differential privacy; Privacy protection; Computer security; Information privacy; Privacy software; Service (business); Internet privacy; Data mining","score_opus":0.023838399166764807,"score_gpt":0.26305497839462444,"score_spread":0.23921657922785963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391508058","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.016554853,0.0006929864,0.95770913,0.003502043,0.0002777761,0.0001132785,0.000106016196,0.00045042855,0.02059346],"genre_scores_gemma":[0.86778593,0.00092777243,0.11099288,0.0013543793,0.0004680043,0.00023157777,0.00015250812,0.00011414185,0.017972758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398404,0.0022097642,0.00020191802,0.0005822778,0.0022909667,0.0007311365],"domain_scores_gemma":[0.99362093,0.0029360002,0.000338994,0.0024375967,0.00047985054,0.00018662469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045097093,0.000733121,0.0010285816,0.0006913273,0.0015746212,0.0041680904,0.002198145,0.0037781422,0.003933847],"category_scores_gemma":[0.011391818,0.0005666763,0.001030086,0.001821685,0.003018575,0.0076824185,0.0061545,0.006442087,0.0010976237],"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.00018528555,0.00009495879,0.00035359757,0.00007874178,0.000035397523,0.000118779004,0.00017089861,0.02240999,0.0037195904,0.8977206,0.0057679606,0.06934424],"study_design_scores_gemma":[0.000031501233,0.00006496305,0.0001053378,0.000020739988,0.000024807774,0.00030025482,0.000057254958,0.23352805,0.004901619,0.75133514,0.009612297,0.000018046387],"about_ca_topic_score_codex":0.0005377167,"about_ca_topic_score_gemma":0.0004630926,"teacher_disagreement_score":0.0045097093,"about_ca_system_score_codex":0.0022291427,"about_ca_system_score_gemma":0.0021882828,"threshold_uncertainty_score":0.023849845},"labels":[],"label_agreement":null},{"id":"W4391508096","doi":"10.1007/978-981-99-9785-5_30","title":"Multi-agent Reinforcement Learning Based User-Centric Demand Response with Non-intrusive Load Monitoring","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Energy Management","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":"Carleton University","funders":"","keywords":"Computer science; Reinforcement learning; Demand response; On demand; Reinforcement; Human–computer interaction; Artificial intelligence; Real-time computing; Multimedia; Electrical engineering","score_opus":0.009654344786332087,"score_gpt":0.21503461895704865,"score_spread":0.20538027417071655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391508096","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.08596811,0.00031712124,0.9055514,0.00025274165,0.00012934956,0.0001088272,0.000062777406,0.0015654007,0.006044287],"genre_scores_gemma":[0.97740984,0.00003561996,0.020787502,0.000051122446,0.000020622112,0.00004288473,0.000028476432,0.000030544867,0.0015933232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995223,0.00013722018,0.000025103158,0.00012355357,0.00011138412,0.00008031846],"domain_scores_gemma":[0.998949,0.0005452533,0.0001558167,0.000089999114,0.00017879524,0.00008127401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086425117,0.0006440523,0.0010823053,0.0002574118,0.00033965844,0.0007625271,0.0014598721,0.00063665584,0.0016014439],"category_scores_gemma":[0.0014678346,0.00035769452,0.00030200672,0.00028827865,0.0004112163,0.00059638906,0.00093789876,0.00091981515,0.0003314097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003740509,0.000318524,0.0007642917,0.00007399081,0.00006342231,0.00015043066,0.00007004962,0.91067225,0.007383243,0.0022033073,0.0018455782,0.076080956],"study_design_scores_gemma":[0.0000069384714,0.000022689683,0.00007190384,8.745512e-7,0.000002470911,0.0000090743615,0.0000022811257,0.99929595,0.00030117438,0.00021974079,0.00006493729,0.0000019632753],"about_ca_topic_score_codex":0.003084906,"about_ca_topic_score_gemma":0.003498355,"teacher_disagreement_score":0.003084906,"about_ca_system_score_codex":0.00052903354,"about_ca_system_score_gemma":0.00053458253,"threshold_uncertainty_score":0.0061338544},"labels":[],"label_agreement":null},{"id":"W4391508133","doi":"10.1007/978-981-99-9785-5_28","title":"Practical and Privacy-Preserving Decision Tree Evaluation with One Round Communication","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"National Research Council Canada; University of Guelph","funders":"","keywords":"Computer science; Decision tree; Tree (set theory); Computer security; Theoretical computer science; Data mining; Mathematics","score_opus":0.06466194245914729,"score_gpt":0.32949297783950915,"score_spread":0.26483103538036185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391508133","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.016255597,0.00032640636,0.9744133,0.0007742954,0.00011265314,0.00024647656,0.00027705313,0.0012166767,0.006377587],"genre_scores_gemma":[0.43744934,0.00033769218,0.5471663,0.00046309957,0.00023924332,0.00048792025,0.00079912564,0.00040049077,0.012656838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9828681,0.0076620546,0.0008792639,0.0017603971,0.005190792,0.0016394275],"domain_scores_gemma":[0.97464335,0.015439635,0.0007181228,0.006547727,0.0019608573,0.0006903169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008013506,0.0011874695,0.0024634793,0.0010805206,0.0017026657,0.0042838757,0.0036860032,0.0024553172,0.008272146],"category_scores_gemma":[0.026556406,0.0008653414,0.0018437972,0.0020669627,0.0019858463,0.0062711267,0.005288717,0.0045637344,0.0027783094],"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.0030812651,0.0006420245,0.001587039,0.00044776488,0.00024036503,0.0004032104,0.0004381769,0.16025323,0.011647636,0.3369091,0.022444125,0.46190608],"study_design_scores_gemma":[0.00015059319,0.00024988604,0.00026982406,0.000038797956,0.00006632893,0.0003524926,0.0000753283,0.69286585,0.007672382,0.29415092,0.0040666405,0.00004090938],"about_ca_topic_score_codex":0.0012356567,"about_ca_topic_score_gemma":0.0017003848,"teacher_disagreement_score":0.008272146,"about_ca_system_score_codex":0.0022716862,"about_ca_system_score_gemma":0.004769273,"threshold_uncertainty_score":0.042379975},"labels":[],"label_agreement":null},{"id":"W4391516313","doi":"10.1007/978-981-99-8850-1_25","title":"PointerNet with Local and Global Contexts for Natural Language Moment Localization","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Moment (physics); Natural (archaeology); Natural language; Natural language processing; Artificial intelligence; Physics; Geography; Archaeology","score_opus":0.005756129519541871,"score_gpt":0.26191497201004543,"score_spread":0.2561588424905036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391516313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006792826,0.00047169748,0.9725929,0.00013303861,0.00017422142,0.00004646217,0.0005276281,0.014769542,0.0044916724],"genre_scores_gemma":[0.24079995,0.0006454692,0.7390246,0.00026267118,0.0002283191,0.00021993971,0.0028503889,0.001953322,0.014015338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928015,0.00010443162,0.00005742559,0.00029383413,0.00017753341,0.00008673669],"domain_scores_gemma":[0.9991702,0.0002595622,0.000045453107,0.00030616412,0.00016462094,0.000053966345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008209895,0.0011776985,0.0011916902,0.001999379,0.000993619,0.0019908538,0.0019624357,0.0017296349,0.014371895],"category_scores_gemma":[0.002895503,0.0007018011,0.0009047152,0.0017728363,0.0011746096,0.0066234134,0.0034915328,0.001727314,0.005252477],"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.0004978059,0.00013358037,0.0009780814,0.00041230122,0.000072248506,0.000270626,0.00029792608,0.034050774,0.017931791,0.2005751,0.024145678,0.72063416],"study_design_scores_gemma":[0.000052108884,0.00015199684,0.00043712746,0.0001273474,0.000082280574,0.00033521862,0.0001587042,0.6151909,0.019475488,0.32553995,0.038383793,0.00006508122],"about_ca_topic_score_codex":0.0054827626,"about_ca_topic_score_gemma":0.010121172,"teacher_disagreement_score":0.014371895,"about_ca_system_score_codex":0.0008049173,"about_ca_system_score_gemma":0.0013179459,"threshold_uncertainty_score":0.048078775},"labels":[],"label_agreement":null},{"id":"W4391516317","doi":"10.1007/978-981-99-8850-1_1","title":"MARS: An Instance-Aware, Modular and Realistic Simulator for Autonomous Driving","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":89,"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":"Computer science; Modular design; Mars Exploration Program; Simulation; Human–computer interaction; Computer graphics (images); Programming language; Astrobiology","score_opus":0.009681250064464578,"score_gpt":0.226166072874737,"score_spread":0.21648482281027243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391516317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08137906,0.0005761523,0.80874443,0.00042169404,0.00038623417,0.00040593272,0.007266066,0.07276369,0.028056772],"genre_scores_gemma":[0.6040906,0.00074041856,0.35813212,0.0002329304,0.000054657165,0.00052258366,0.010681058,0.0070352606,0.018510452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.000045527308,0.000012800666,0.000036663805,0.000075210955,0.00002452945],"domain_scores_gemma":[0.9997789,0.00006955712,0.0000134736965,0.000056834033,0.000040995983,0.000040191702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002457387,0.0010647852,0.0004881963,0.0002590204,0.00024472442,0.0008774085,0.0026570268,0.0008423995,0.007637214],"category_scores_gemma":[0.0008616417,0.0006546302,0.00068982056,0.00022314748,0.00030739355,0.001013085,0.0013840892,0.0012697768,0.002073352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006142148,0.00025866771,0.0023505662,0.00035899135,0.00020454965,0.00028411095,0.0002505535,0.84400094,0.02159001,0.01775571,0.044760395,0.067571305],"study_design_scores_gemma":[0.00006741958,0.00006273812,0.0003105337,0.000014088675,0.00002904875,0.000083698826,0.000029227986,0.959364,0.0058265883,0.005245845,0.028941574,0.000025131472],"about_ca_topic_score_codex":0.0053054364,"about_ca_topic_score_gemma":0.007314284,"teacher_disagreement_score":0.007637214,"about_ca_system_score_codex":0.00040778064,"about_ca_system_score_gemma":0.0007068312,"threshold_uncertainty_score":0.025548995},"labels":[],"label_agreement":null},{"id":"W4391585419","doi":"10.1007/978-3-031-47292-3","title":"Computational Diffusion MRI","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Diffusion; Thermodynamics; Physics","score_opus":0.03998252665559456,"score_gpt":0.34057089504401056,"score_spread":0.300588368388416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391585419","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.0020936027,0.020247355,0.7174979,0.0019952906,0.0028428768,0.00008116517,0.0015037168,0.006990499,0.24674758],"genre_scores_gemma":[0.018129999,0.018520642,0.2542658,0.0006838377,0.001254045,0.00011974303,0.0030514025,0.0024406773,0.7015339],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999089,0.000007863151,0.0000033471176,0.000027255259,0.000046540266,0.000006163781],"domain_scores_gemma":[0.99978906,0.000058514655,0.000008765801,0.000050153973,0.00006594829,0.000027551336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002200975,0.0012463487,0.0006926051,0.0011358502,0.00034177743,0.0012853985,0.00086219853,0.0007659124,0.066683546],"category_scores_gemma":[0.000576509,0.00059933186,0.00051286496,0.0010112292,0.00041017914,0.0011255565,0.0010825725,0.0013105477,0.048568863],"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.0000374617,0.000026487827,0.00007892759,0.00026628358,0.000031299707,0.0000992972,0.000041230676,0.007720559,0.009558426,0.041921914,0.36319703,0.5770211],"study_design_scores_gemma":[0.000010982416,0.0000403971,0.0004836115,0.00014286669,0.000034102708,0.0010829405,0.000029378085,0.036644094,0.01146867,0.086973466,0.8630469,0.0000425244],"about_ca_topic_score_codex":0.00067432027,"about_ca_topic_score_gemma":0.0021177772,"teacher_disagreement_score":0.066683546,"about_ca_system_score_codex":0.00031596815,"about_ca_system_score_gemma":0.0003824204,"threshold_uncertainty_score":0.22307867},"labels":[],"label_agreement":null},{"id":"W4391585483","doi":"10.1007/978-3-031-47292-3_4","title":"Improving Multi-Tensor Fitting with Global Information from Track Orientation Density Imaging","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Orientation (vector space); Track (disk drive); Tensor (intrinsic definition); Computer vision; Artificial intelligence; Geometry; Mathematics","score_opus":0.032347199288199166,"score_gpt":0.3066180835841583,"score_spread":0.27427088429595914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391585483","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.0021687513,0.00018420923,0.99552345,0.0000875657,0.000047937632,0.000014781927,0.00009796807,0.0014951382,0.00038016788],"genre_scores_gemma":[0.023359153,0.00038289317,0.97178733,0.00009133798,0.000057803263,0.00003390963,0.00073409034,0.0011337488,0.0024197472],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999213,0.00018907752,0.00005566009,0.00018416443,0.00029544122,0.00006266877],"domain_scores_gemma":[0.9974367,0.0009081728,0.00024422063,0.00062831776,0.0006541704,0.0001284397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022544865,0.0032965748,0.0018329255,0.0013495917,0.00063766754,0.0019220007,0.0020402914,0.0026048461,0.004307786],"category_scores_gemma":[0.006770928,0.0015188891,0.0019519206,0.0023236433,0.00070145144,0.0031789383,0.002034328,0.0030172507,0.0046218424],"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.00022161583,0.00015412859,0.0010286216,0.0003008241,0.00034271923,0.0001330194,0.0001448994,0.2028755,0.05284425,0.007700905,0.016749628,0.71750396],"study_design_scores_gemma":[0.000008751354,0.000044875716,0.00032922687,0.000019286876,0.000061463674,0.00016805051,0.000021846892,0.97531885,0.012042678,0.0074374313,0.0045187543,0.000028704602],"about_ca_topic_score_codex":0.005578597,"about_ca_topic_score_gemma":0.0089950515,"teacher_disagreement_score":0.005578597,"about_ca_system_score_codex":0.0005428621,"about_ca_system_score_gemma":0.0012972752,"threshold_uncertainty_score":0.014410973},"labels":[],"label_agreement":null},{"id":"W4391585496","doi":"10.1007/978-3-031-47292-3_5","title":"BundleSeg: A Versatile, Reliable and Reproducible Approach to White Matter Bundle Segmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Segmentation; Bundle; Artificial intelligence; Computer vision; Materials science","score_opus":0.05548664248652436,"score_gpt":0.3148966712500903,"score_spread":0.25941002876356595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391585496","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.0011526628,0.00023927147,0.97112805,0.0000782617,0.00012968064,0.00006654005,0.00070604344,0.025404854,0.0010946041],"genre_scores_gemma":[0.01039048,0.00034804546,0.9652569,0.00011562563,0.00011353542,0.00021485158,0.0023138032,0.01672907,0.004517773],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982461,0.00026980517,0.000120567245,0.0003806583,0.00086091156,0.000122004276],"domain_scores_gemma":[0.99820614,0.0005852515,0.00015262002,0.00051145954,0.00042984312,0.000114659866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002346327,0.0026983826,0.0017963569,0.0035757073,0.0009579667,0.0042034253,0.0042177024,0.0025776424,0.02357466],"category_scores_gemma":[0.0056035705,0.0021393378,0.001743557,0.0030706907,0.0009293438,0.0028894162,0.005232494,0.0026276708,0.014439429],"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.00040329326,0.00009682584,0.0009314959,0.0005836311,0.0003333363,0.00044845184,0.0003476387,0.0201896,0.04664259,0.016679466,0.11208539,0.8012583],"study_design_scores_gemma":[0.00022515506,0.00021060865,0.0025403537,0.00029246695,0.00016533038,0.0026920643,0.00014560595,0.5813315,0.12044008,0.079552755,0.2120841,0.00031995203],"about_ca_topic_score_codex":0.0018399417,"about_ca_topic_score_gemma":0.0040184646,"teacher_disagreement_score":0.02357466,"about_ca_system_score_codex":0.0005110956,"about_ca_system_score_gemma":0.0014452093,"threshold_uncertainty_score":0.07886505},"labels":[],"label_agreement":null},{"id":"W4391734459","doi":"10.1007/978-981-97-0376-0","title":"Image and Video Technology","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Indian Statistical Institute; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; Pontificia Universidad Católica de Chile; Changzhou Institute of Technology; Universität des Saarlandes; VIT University; RIKEN; Hebrew University of Jerusalem; Dalian University of Technology; Xiamen University; Yonsei University; University of Otago; University of Waikato; Inyuvesi Yakwazulu-Natali; University of Canberra; Lincoln Agritech; University of New England; University of Technology Sydney; University of New South Wales; National Tsing Hua University; Victoria University of Wellington; Wuhan University; University of Alberta; Charles Sturt University; Iqra University; Università degli Studi di Napoli Federico II; National Institute of Technology Rourkela; Victoria University; Trường Đại học Bách Khoa Hà Nội; University of Canterbury; Massey University","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence","score_opus":0.007771441461459126,"score_gpt":0.26849371304983083,"score_spread":0.2607222715883717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391734459","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013498176,0.026381906,0.066136025,0.001478018,0.004959445,0.00010428259,0.00049397233,0.0019091928,0.8971874],"genre_scores_gemma":[0.0040476164,0.0064968937,0.006161025,0.00025305417,0.00058326236,0.000025518379,0.0002516972,0.00023371636,0.9819472],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997485,0.000017107755,0.000006492926,0.00004465407,0.00016500836,0.000018165909],"domain_scores_gemma":[0.99976796,0.00004857567,0.000008533165,0.000044803724,0.00009169748,0.00003843693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022348092,0.00096982636,0.0006232012,0.0015648089,0.00055137894,0.0021147884,0.0008346054,0.0009190632,0.14645094],"category_scores_gemma":[0.00053995627,0.0003593884,0.0003810036,0.0014335548,0.00054221903,0.0020033924,0.0011629188,0.0012169454,0.09559805],"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.000049419425,0.00003513052,0.00007079343,0.00024731306,0.000011846666,0.000116593146,0.00009056475,0.0003998248,0.011688729,0.048374888,0.4443528,0.4945621],"study_design_scores_gemma":[0.000003865451,0.000028608458,0.00024128964,0.00006354525,0.0000078651055,0.0002798277,0.00003084198,0.00088447315,0.0025640568,0.007999409,0.987889,0.000007234655],"about_ca_topic_score_codex":0.0011533173,"about_ca_topic_score_gemma":0.002258665,"teacher_disagreement_score":0.14645094,"about_ca_system_score_codex":0.0005380312,"about_ca_system_score_gemma":0.00050442945,"threshold_uncertainty_score":0.48992717},"labels":[],"label_agreement":null},{"id":"W4391767333","doi":"10.1007/978-3-031-70543-4_11","title":"CATMuS Medieval: A Multilingual Large-Scale Cross-Century Dataset in Latin Script for Handwritten Text Recognition and Beyond","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Canada Research Chairs; University of Toronto; Université de Montréal","funders":"","keywords":"Computer science; Natural language processing; Scale (ratio); Artificial intelligence; Speech recognition; Linguistics; Geography; Cartography; Philosophy","score_opus":0.02611180828481044,"score_gpt":0.294718516514478,"score_spread":0.2686067082296676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391767333","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10593796,0.0021563566,0.005588813,0.00052650453,0.00067789934,0.0002498703,0.8488967,0.009532093,0.026433796],"genre_scores_gemma":[0.031435102,0.0002730014,0.006546628,0.00013946608,0.0000737133,0.00017118502,0.9533864,0.00065395306,0.0073205293],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995253,0.000064952816,0.00004890763,0.00016631662,0.00011376019,0.000080849124],"domain_scores_gemma":[0.99934274,0.0000619275,0.000048961323,0.00020094059,0.0002113908,0.00013404373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042738125,0.0013985743,0.0005734152,0.002934646,0.0010760367,0.001265082,0.0012132152,0.0009480037,0.014343904],"category_scores_gemma":[0.0011844633,0.00027615528,0.0007689221,0.0030679125,0.00048496836,0.0009830049,0.001733957,0.0008404127,0.018309357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088590244,0.00034039066,0.015679792,0.0011172774,0.00019055228,0.00083902315,0.0007741768,0.0020835644,0.017596936,0.0019046454,0.81573296,0.1428549],"study_design_scores_gemma":[0.00019418995,0.00014859611,0.099654175,0.00033666482,0.00010852505,0.0011836145,0.0019451792,0.006377988,0.0129193505,0.0016892897,0.8752954,0.00014703267],"about_ca_topic_score_codex":0.027210848,"about_ca_topic_score_gemma":0.072133,"teacher_disagreement_score":0.027210848,"about_ca_system_score_codex":0.0006264607,"about_ca_system_score_gemma":0.0010606707,"threshold_uncertainty_score":0.054104924},"labels":[],"label_agreement":null},{"id":"W4391808625","doi":"10.1007/978-3-031-53966-4_1","title":"Integrated Human-AI Forecasting for Preventive Maintenance Task Duration Estimation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Occupational Health and Safety Research","field":"Health Professions","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":"Royal Canadian Navy; Dalhousie University; Thales (Canada)","funders":"","keywords":"Duration (music); Computer science; Task (project management); Shipyard; Artificial intelligence; Machine learning; Operations research; Estimation; Engineering; Systems engineering; Shipbuilding","score_opus":0.08597393287494211,"score_gpt":0.4381453865523913,"score_spread":0.35217145367744923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391808625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21591426,0.003012657,0.77009445,0.0003012989,0.0003478976,0.00006339971,0.0021924423,0.0030292731,0.0050443704],"genre_scores_gemma":[0.9456091,0.0004898487,0.049660183,0.000048738668,0.00015088898,0.000050473176,0.0011459325,0.000043114927,0.002801708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000029205798,0.0000115863495,0.0000630307,0.000051191528,0.000032068463],"domain_scores_gemma":[0.99949193,0.00030640702,0.0000410214,0.000040546274,0.00009600072,0.00002403488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049060246,0.00061387045,0.0007723424,0.0010699934,0.00019210932,0.0004902091,0.000714141,0.0005048578,0.0017242727],"category_scores_gemma":[0.0011956522,0.00024943316,0.00043904682,0.0011251271,0.00007195235,0.0005304071,0.0003265911,0.00056842394,0.00066193746],"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.00041282212,0.0002834126,0.009075356,0.000101595004,0.00014092632,0.000061745784,0.000034347173,0.46602505,0.007242646,0.0005248092,0.00286428,0.51323295],"study_design_scores_gemma":[0.0000030383485,0.0000359187,0.0032594223,0.00000446757,0.000017885352,0.000013090445,0.000005018504,0.9952246,0.00072439376,0.00041654683,0.00029013478,0.000005540285],"about_ca_topic_score_codex":0.012258907,"about_ca_topic_score_gemma":0.013431066,"teacher_disagreement_score":0.012258907,"about_ca_system_score_codex":0.00028004032,"about_ca_system_score_gemma":0.00039213354,"threshold_uncertainty_score":0.02437514},"labels":[],"label_agreement":null},{"id":"W4391809045","doi":"10.1007/978-3-031-53966-4","title":"Machine Learning, Optimization, and Data Science","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":3,"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":"Leibniz-Rechenzentrum; Leibniz-Gemeinschaft; University of California, Irvine; National Technical University of Athens; Saab; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Università di Pisa; RWTH Aachen University; Université de Limoges; Università di Bologna; National and Kapodistrian University of Athens; Università degli Studi di Parma; Technische Universität Wien; University of Oxford; Kungliga Tekniska Högskolan; Universidade de Coimbra; Universität Passau; University of Crete; University of Washington; Università degli Studi di Padova; Università degli Studi di Milano-Bicocca; Universidade Federal do Rio de Janeiro; Keio University; University College Cork; Cardiff University; Universidade de Trás-os-Montes e Alto Douro; Università Degli Studi di Modena e Reggio Emila; University of Southern California; University College London; Università degli Studi di Camerino; Université Paris-Saclay; Université de Neuchâtel; Middlesex University; Harvey Mudd College; McMaster University; Università degli Studi di Urbino Carlo Bo; York University; Politecnico di Torino; Université de Lorraine","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.04578942393295004,"score_gpt":0.28998068340972644,"score_spread":0.2441912594767764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391809045","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028461637,0.38749456,0.37920243,0.020747531,0.00625831,0.00009724892,0.0012675544,0.0013772196,0.20070904],"genre_scores_gemma":[0.08863704,0.24794924,0.2610682,0.006241131,0.013469106,0.000399092,0.0024695187,0.0017363307,0.37803048],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992091,0.00018989976,0.00004495085,0.00013369414,0.0003911371,0.00003122287],"domain_scores_gemma":[0.9976968,0.0018172993,0.000086174725,0.00016930541,0.00017329276,0.000057019046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012055282,0.001589794,0.0023473585,0.0016741587,0.0004303224,0.003465534,0.0008925489,0.0010443864,0.017490037],"category_scores_gemma":[0.0038927235,0.0007280456,0.00055734196,0.0040849997,0.0020984146,0.0040092384,0.0010674009,0.003604036,0.0070107034],"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.000057958223,0.00006699295,0.00041149108,0.00094756385,0.00010442404,0.00004486684,0.00007833749,0.01330113,0.0006002287,0.31482396,0.31179294,0.35777012],"study_design_scores_gemma":[0.000019545558,0.000028954808,0.00054529944,0.00027158807,0.000029143719,0.00010380603,0.00004597482,0.02797827,0.0003762265,0.657133,0.31344497,0.000023211547],"about_ca_topic_score_codex":0.0019197928,"about_ca_topic_score_gemma":0.0025941,"teacher_disagreement_score":0.017490037,"about_ca_system_score_codex":0.0011805367,"about_ca_system_score_gemma":0.0012558223,"threshold_uncertainty_score":0.058510005},"labels":[],"label_agreement":null},{"id":"W4391852071","doi":"10.1007/978-3-031-53969-5","title":"Machine Learning, Optimization, and Data Science","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Rechenzentrum; Leibniz-Gemeinschaft; University of California, Irvine; National Technical University of Athens; Saab; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Università di Pisa; RWTH Aachen University; Université de Limoges; Università di Bologna; National and Kapodistrian University of Athens; Università degli Studi di Parma; Technische Universität Wien; University of Oxford; Kungliga Tekniska Högskolan; Universidade de Coimbra; Universität Passau; University of Crete; University of Washington; Università degli Studi di Padova; Università degli Studi di Milano-Bicocca; Universidade Federal do Rio de Janeiro; Keio University; University College Cork; Cardiff University; Universidade de Trás-os-Montes e Alto Douro; Università Degli Studi di Modena e Reggio Emila; University of Southern California; University College London; Università degli Studi di Camerino; Université Paris-Saclay; Université de Neuchâtel; Middlesex University; Harvey Mudd College; McMaster University; Università degli Studi di Urbino Carlo Bo; York University; Politecnico di Torino; Université de Lorraine","keywords":"Computer science; Artificial intelligence; Machine learning; Data science","score_opus":0.04578942393295004,"score_gpt":0.28998068340972644,"score_spread":0.2441912594767764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391852071","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028461637,0.38749456,0.37920243,0.020747531,0.00625831,0.00009724892,0.0012675544,0.0013772196,0.20070904],"genre_scores_gemma":[0.08863704,0.24794924,0.2610682,0.006241131,0.013469106,0.000399092,0.0024695187,0.0017363307,0.37803048],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992091,0.00018989976,0.00004495085,0.00013369414,0.0003911371,0.00003122287],"domain_scores_gemma":[0.9976968,0.0018172993,0.000086174725,0.00016930541,0.00017329276,0.000057019046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012055282,0.001589794,0.0023473585,0.0016741587,0.0004303224,0.003465534,0.0008925489,0.0010443864,0.017490037],"category_scores_gemma":[0.0038927235,0.0007280456,0.00055734196,0.0040849997,0.0020984146,0.0040092384,0.0010674009,0.003604036,0.0070107034],"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.000057958223,0.00006699295,0.00041149108,0.00094756385,0.00010442404,0.00004486684,0.00007833749,0.01330113,0.0006002287,0.31482396,0.31179294,0.35777012],"study_design_scores_gemma":[0.000019545558,0.000028954808,0.00054529944,0.00027158807,0.000029143719,0.00010380603,0.00004597482,0.02797827,0.0003762265,0.657133,0.31344497,0.000023211547],"about_ca_topic_score_codex":0.0019197928,"about_ca_topic_score_gemma":0.0025941,"teacher_disagreement_score":0.017490037,"about_ca_system_score_codex":0.0011805367,"about_ca_system_score_gemma":0.0012558223,"threshold_uncertainty_score":0.058510005},"labels":[],"label_agreement":null},{"id":"W4391852472","doi":"10.1007/978-3-031-53969-5_21","title":"ProVolOne – Protein Volume Prediction Using a Multi-attention, Multi-resolution Deep Neural Network and Finite Element Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Artificial neural network; Volume (thermodynamics); Finite element method; Artificial intelligence; Physics; Thermodynamics","score_opus":0.011549174236569142,"score_gpt":0.25023006386637403,"score_spread":0.23868088962980488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391852472","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.046559315,0.0035316644,0.921953,0.0010327598,0.0005400885,0.00012251969,0.0019576014,0.011471608,0.0128314225],"genre_scores_gemma":[0.43728912,0.0022746115,0.51785237,0.00073447987,0.0003809007,0.00024959468,0.005653442,0.0017941329,0.033771332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997402,0.000026176205,0.000010829014,0.00007938555,0.00012211432,0.000021270493],"domain_scores_gemma":[0.9996501,0.00012756741,0.000053716773,0.000041293726,0.00009522538,0.00003206826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005281221,0.0008718374,0.0011010986,0.0006086062,0.00036080374,0.0011531096,0.0015712283,0.0014619721,0.005498362],"category_scores_gemma":[0.0010894508,0.0004964231,0.0010918628,0.000681212,0.00040475323,0.001090056,0.0008299296,0.0013606624,0.003085739],"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.0005328504,0.00020720888,0.0024151322,0.00042294603,0.0001496489,0.0002411366,0.000034344055,0.37878472,0.07178394,0.008336427,0.02258034,0.5145114],"study_design_scores_gemma":[0.000013824698,0.00003870132,0.0003597148,0.000010140645,0.000010818973,0.00008186798,0.0000054808547,0.97634584,0.015518591,0.0036167349,0.003979533,0.000018816385],"about_ca_topic_score_codex":0.0030835336,"about_ca_topic_score_gemma":0.0040254137,"teacher_disagreement_score":0.005498362,"about_ca_system_score_codex":0.0006776443,"about_ca_system_score_gemma":0.0006584122,"threshold_uncertainty_score":0.018393815},"labels":[],"label_agreement":null},{"id":"W4391920153","doi":"10.1007/978-3-031-53368-6_17","title":"Secure Function Extensions to Additively Homomorphic Cryptosystems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Western University","funders":"","keywords":"Homomorphic encryption; Cryptosystem; Computer science; Theoretical computer science; Function (biology); Computer security; Programming language; Cryptography; Arithmetic; Algebra over a field; Encryption; Mathematics; Pure mathematics","score_opus":0.015022319798282622,"score_gpt":0.23233770174614768,"score_spread":0.21731538194786507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391920153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19299151,0.0052411724,0.4847778,0.0023693284,0.0011930263,0.00020589882,0.00022927806,0.002432662,0.3105592],"genre_scores_gemma":[0.8560098,0.003193249,0.04180085,0.00027363273,0.0006110899,0.000107771644,0.00018798737,0.00024702228,0.09756872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993911,0.00011503411,0.000032829306,0.000061540515,0.00031012035,0.000089342255],"domain_scores_gemma":[0.9993861,0.00023877867,0.00003415928,0.00023515255,0.00006704672,0.0000387295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045531418,0.0006962977,0.00045953886,0.0005806083,0.0005517569,0.0019279077,0.0005387176,0.0006248027,0.0058273394],"category_scores_gemma":[0.0011785267,0.0004176332,0.0003952904,0.0006783159,0.0012641215,0.0033754413,0.0017248121,0.0024555882,0.0022348259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011575393,0.000085238775,0.00008490119,0.00010362468,0.000011359578,0.00014393669,0.00028421814,0.005311049,0.011875724,0.9099055,0.0036644891,0.06841427],"study_design_scores_gemma":[0.000051380164,0.00018082232,0.00031872792,0.000082997554,0.000026541682,0.0006985,0.00008993642,0.024506075,0.027869638,0.8755546,0.07058931,0.00003155879],"about_ca_topic_score_codex":0.000080909675,"about_ca_topic_score_gemma":0.00010111402,"teacher_disagreement_score":0.0058273394,"about_ca_system_score_codex":0.00062520156,"about_ca_system_score_gemma":0.00034265115,"threshold_uncertainty_score":0.019494414},"labels":[],"label_agreement":null},{"id":"W4392154832","doi":"10.1007/978-981-97-0859-8","title":"Algorithms and Architectures for Parallel Processing","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Institute of Computing Technology, Chinese Academy of Sciences; Dalian Maritime University; University of Science and Technology of China; University of Shanghai for Science and Technology; Nanjing University; Nanjing University of Information Science and Technology; Peking University; National University of Defense Technology; Università della Calabria; Xidian University; Danmarks Tekniske Universitet; Shanghai Jiao Tong University; Tianjin University; Shaanxi Normal University; Guangdong University of Technology; Ocean University of China; Huazhong University of Science and Technology; Dalian University of Technology; Hubei University of Technology; Lomonosov Moscow State University; Tsinghua University; Trent University; Tianjin University of Technology; Chinese Academy of Sciences; University of Electronic Science and Technology of China; Beijing Jiaotong University; Kanazawa University; Kungliga Tekniska Högskolan; Beihang University; Nottingham Trent University; Kalinga Institute of Industrial Technology; Hunan University; University of West Attica; South China Agricultural University; Université du Luxembourg; University of Louisiana at Lafayette; Tulane University; China Agricultural University; Hubei University; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Ohio State University","keywords":"Computer science; Parallel computing; Parallel processing; Computer architecture","score_opus":0.016565827323833427,"score_gpt":0.2796502157388184,"score_spread":0.26308438841498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392154832","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772985,0.026148116,0.8327606,0.0016602715,0.004383846,0.0001576827,0.00045623997,0.0040412648,0.12881471],"genre_scores_gemma":[0.024479546,0.027309675,0.71549094,0.0008492949,0.0033392208,0.00064614986,0.0013445034,0.0021753751,0.22436534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.0000995032,0.000033787943,0.00008302442,0.00034981297,0.00004028898],"domain_scores_gemma":[0.9994399,0.00020126451,0.00002519868,0.00018082764,0.00012922344,0.000023453395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049538765,0.0018993746,0.0014159523,0.0011863224,0.0006391783,0.002434088,0.001668227,0.0010447024,0.03714444],"category_scores_gemma":[0.0017842266,0.0009769738,0.00065728714,0.003352131,0.00096767995,0.0030888298,0.0014777523,0.0028599792,0.024220996],"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.000085838554,0.00005697493,0.000095908894,0.0007051933,0.00007000722,0.00006945427,0.00006831094,0.022624237,0.0045409678,0.34718606,0.17450142,0.44999555],"study_design_scores_gemma":[0.00004793803,0.00005398763,0.00018599987,0.0001314806,0.000043559412,0.00022150492,0.00002397378,0.07018781,0.0029070447,0.43304214,0.49312994,0.000024617759],"about_ca_topic_score_codex":0.000498467,"about_ca_topic_score_gemma":0.0006005701,"teacher_disagreement_score":0.03714444,"about_ca_system_score_codex":0.00067434116,"about_ca_system_score_gemma":0.0007575427,"threshold_uncertainty_score":0.124260545},"labels":[],"label_agreement":null},{"id":"W4392172245","doi":"10.1007/978-981-97-0811-6","title":"Algorithms and Architectures for Parallel Processing","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Institute of Computing Technology, Chinese Academy of Sciences; Dalian Maritime University; University of Science and Technology of China; University of Shanghai for Science and Technology; Nanjing University; Nanjing University of Information Science and Technology; Peking University; National University of Defense Technology; Università della Calabria; Xidian University; Danmarks Tekniske Universitet; Shanghai Jiao Tong University; Tianjin University; Shaanxi Normal University; Guangdong University of Technology; Ocean University of China; Huazhong University of Science and Technology; Dalian University of Technology; Hubei University of Technology; Lomonosov Moscow State University; Tsinghua University; Trent University; Tianjin University of Technology; Chinese Academy of Sciences; University of Electronic Science and Technology of China; Beijing Jiaotong University; Kanazawa University; Kungliga Tekniska Högskolan; Beihang University; Nottingham Trent University; Kalinga Institute of Industrial Technology; Hunan University; University of West Attica; South China Agricultural University; Université du Luxembourg; University of Louisiana at Lafayette; Tulane University; China Agricultural University; Hubei University; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Ohio State University","keywords":"Computer science; Parallel computing; Parallel processing","score_opus":0.016565827323833427,"score_gpt":0.2796502157388184,"score_spread":0.26308438841498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172245","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772985,0.026148116,0.8327606,0.0016602715,0.004383846,0.0001576827,0.00045623997,0.0040412648,0.12881471],"genre_scores_gemma":[0.024479546,0.027309675,0.71549094,0.0008492949,0.0033392208,0.00064614986,0.0013445034,0.0021753751,0.22436534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.0000995032,0.000033787943,0.00008302442,0.00034981297,0.00004028898],"domain_scores_gemma":[0.9994399,0.00020126451,0.00002519868,0.00018082764,0.00012922344,0.000023453395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049538765,0.0018993746,0.0014159523,0.0011863224,0.0006391783,0.002434088,0.001668227,0.0010447024,0.03714444],"category_scores_gemma":[0.0017842266,0.0009769738,0.00065728714,0.003352131,0.00096767995,0.0030888298,0.0014777523,0.0028599792,0.024220996],"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.000085838554,0.00005697493,0.000095908894,0.0007051933,0.00007000722,0.00006945427,0.00006831094,0.022624237,0.0045409678,0.34718606,0.17450142,0.44999555],"study_design_scores_gemma":[0.00004793803,0.00005398763,0.00018599987,0.0001314806,0.000043559412,0.00022150492,0.00002397378,0.07018781,0.0029070447,0.43304214,0.49312994,0.000024617759],"about_ca_topic_score_codex":0.000498467,"about_ca_topic_score_gemma":0.0006005701,"teacher_disagreement_score":0.03714444,"about_ca_system_score_codex":0.00067434116,"about_ca_system_score_gemma":0.0007575427,"threshold_uncertainty_score":0.124260545},"labels":[],"label_agreement":null},{"id":"W4392172319","doi":"10.1007/978-3-031-54968-7","title":"Advances in Computer Games","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Computer science","score_opus":0.01126588475561189,"score_gpt":0.28499748483561665,"score_spread":0.27373160008000474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172319","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019751093,0.15948762,0.015470562,0.0074779717,0.006571948,0.000048314712,0.00018235052,0.00039787067,0.8083882],"genre_scores_gemma":[0.024528084,0.13245624,0.010677121,0.0021028519,0.002912524,0.00007785855,0.00043773826,0.00032408658,0.82648355],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993748,0.00011425401,0.000024575893,0.000072810755,0.00034884547,0.00006481595],"domain_scores_gemma":[0.99947447,0.00018689419,0.000021805046,0.00006942091,0.00013835983,0.00010909793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073006836,0.0012317759,0.00075762824,0.0019376313,0.0006020935,0.0036467996,0.0010246822,0.0012440692,0.06015976],"category_scores_gemma":[0.0017270771,0.0004136545,0.0003921399,0.002027345,0.0010153793,0.0036827088,0.0021093234,0.002204471,0.0241514],"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.000024896977,0.000094496965,0.0001377537,0.00045465556,0.000016610305,0.000036759116,0.0001556519,0.0008398536,0.0006246068,0.17316607,0.37894833,0.4455003],"study_design_scores_gemma":[0.0000046665577,0.000017718312,0.00023331912,0.0002066537,0.0000048954194,0.00007156658,0.000056215427,0.0007849198,0.00017883671,0.031487066,0.96694964,0.000004515294],"about_ca_topic_score_codex":0.0015349713,"about_ca_topic_score_gemma":0.0042851306,"teacher_disagreement_score":0.06015976,"about_ca_system_score_codex":0.0011151258,"about_ca_system_score_gemma":0.0010353773,"threshold_uncertainty_score":0.20125443},"labels":[],"label_agreement":null},{"id":"W4392172381","doi":"10.1007/978-3-031-54968-7_4","title":"Solving NoGo on Small Rectangular Boards","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Computer science","score_opus":0.030673470356791653,"score_gpt":0.26922307152750885,"score_spread":0.2385496011707172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31637767,0.0004816831,0.46026683,0.0009953596,0.0006223754,0.00037173624,0.00059284153,0.0024973059,0.21779418],"genre_scores_gemma":[0.6177923,0.00044139766,0.28428337,0.00023859557,0.000077154386,0.00034322226,0.0009642482,0.00081231224,0.0950473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975735,0.000054719614,0.000012020144,0.00006548631,0.00003630171,0.00007411094],"domain_scores_gemma":[0.9991584,0.0006350085,0.000034520464,0.000065434724,0.00003337034,0.00007323353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032664623,0.0011139032,0.0010318451,0.00021321094,0.0010963723,0.001100059,0.0017079267,0.0012612976,0.03905235],"category_scores_gemma":[0.0018019257,0.0006003713,0.0009353769,0.00038653627,0.0007463518,0.0022566197,0.0018433663,0.0018797133,0.0028936656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022920955,0.0005298379,0.0016827089,0.0011886399,0.00016716677,0.0010019026,0.0009396448,0.36593774,0.02536715,0.26424995,0.03383578,0.30280742],"study_design_scores_gemma":[0.0005765584,0.0005183224,0.0008248428,0.00016161276,0.000110168716,0.00019207207,0.0009673094,0.56363535,0.0085177235,0.38898596,0.035458628,0.000051458068],"about_ca_topic_score_codex":0.0038110747,"about_ca_topic_score_gemma":0.009918529,"teacher_disagreement_score":0.03905235,"about_ca_system_score_codex":0.00041793825,"about_ca_system_score_gemma":0.0007511976,"threshold_uncertainty_score":0.13064307},"labels":[],"label_agreement":null},{"id":"W4392172476","doi":"10.1007/978-3-031-54968-7_3","title":"Stockfish or Leela Chess Zero? A Comparison Against Endgame Tablebases","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chess endgame; Computer science; Zero (linguistics); Artificial intelligence; Philosophy; Linguistics","score_opus":0.04637551862151267,"score_gpt":0.30243635468588426,"score_spread":0.2560608360643716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172476","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.362641,0.016811745,0.039613716,0.0037062922,0.002087973,0.0007345926,0.009835083,0.0071480656,0.5574214],"genre_scores_gemma":[0.838999,0.0047243265,0.040401727,0.0008804703,0.000198197,0.00032839063,0.011381068,0.0021100566,0.1009767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979978,0.00049953826,0.00010594966,0.00024631518,0.0009728975,0.00017738879],"domain_scores_gemma":[0.99256235,0.004666783,0.00024125117,0.001195396,0.00079164753,0.0005425664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021962298,0.00068410026,0.0013583985,0.0022306312,0.0010124539,0.0039476915,0.0025797824,0.0012136162,0.09782733],"category_scores_gemma":[0.016426235,0.00027281942,0.0005446281,0.0018529191,0.0009472142,0.0074471748,0.0026703568,0.0012645484,0.010095541],"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.015757596,0.0015432084,0.004776,0.002169421,0.00021597558,0.00008155907,0.0006490149,0.015621314,0.0015484493,0.11226193,0.086101055,0.75927454],"study_design_scores_gemma":[0.006478232,0.016149372,0.032895822,0.0025109947,0.0010996554,0.00094124326,0.0069222073,0.18193877,0.010997726,0.21573138,0.52398854,0.000346097],"about_ca_topic_score_codex":0.0074518775,"about_ca_topic_score_gemma":0.011389428,"teacher_disagreement_score":0.09782733,"about_ca_system_score_codex":0.0014022293,"about_ca_system_score_gemma":0.0015462177,"threshold_uncertainty_score":0.32726502},"labels":[],"label_agreement":null},{"id":"W4392172926","doi":"10.1007/978-3-031-52670-1_17","title":"Passive Radio Frequency-Based 3D Indoor Positioning System via Ensemble Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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 Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Real-time computing","score_opus":0.00565790231840996,"score_gpt":0.1944399280937139,"score_spread":0.18878202577530395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011956898,0.00022276792,0.98433685,0.000049770562,0.00010659958,0.000016295338,0.00014935878,0.0014726736,0.0016887112],"genre_scores_gemma":[0.4294897,0.00060438627,0.56047696,0.00028347556,0.00019807692,0.00013596714,0.001393592,0.00018311269,0.007234751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.00007321333,0.000021596872,0.00019521058,0.00017832908,0.00006948357],"domain_scores_gemma":[0.9996543,0.00006183343,0.000030463081,0.00009867374,0.00012922946,0.000025524954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040166324,0.00094182504,0.0015457739,0.00066329836,0.00043707437,0.0006485043,0.0012690381,0.00090417877,0.0021967357],"category_scores_gemma":[0.0006870859,0.0005481889,0.0008589182,0.0015218889,0.00022962666,0.0010287625,0.0014288232,0.0010921364,0.0024735772],"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.00031196603,0.00012950464,0.002209339,0.00007725727,0.00017503022,0.000107639615,0.000093539704,0.09159031,0.03848936,0.0015967664,0.004884468,0.8603349],"study_design_scores_gemma":[0.000018443734,0.0001294715,0.0018732832,0.000012569522,0.00007502474,0.00021017905,0.000023613076,0.98369455,0.0098282425,0.0016250287,0.0024746577,0.00003492763],"about_ca_topic_score_codex":0.0028835232,"about_ca_topic_score_gemma":0.004672122,"teacher_disagreement_score":0.0028835232,"about_ca_system_score_codex":0.00026690555,"about_ca_system_score_gemma":0.00058105815,"threshold_uncertainty_score":0.007348776},"labels":[],"label_agreement":null},{"id":"W4392173095","doi":"10.1007/978-3-031-52670-1_34","title":"DDDAS for Systems Analytics in Applied Mechanics","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Analytics; Data science","score_opus":0.021605877922282694,"score_gpt":0.25208824509511085,"score_spread":0.23048236717282816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392173095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007478732,0.004728093,0.9622277,0.00087619876,0.0008987994,0.000037675658,0.0010604695,0.0030587313,0.026364444],"genre_scores_gemma":[0.06947378,0.012652715,0.8063653,0.0012708724,0.0023428004,0.00055281125,0.0042962977,0.0034213827,0.09962408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956733,0.00009390037,0.000038584625,0.00009000348,0.000186355,0.000023746192],"domain_scores_gemma":[0.9994399,0.00026986803,0.000026852957,0.00016575425,0.00007347966,0.000024179246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125319,0.0012027869,0.0014530518,0.0012213687,0.00043684777,0.0023413273,0.0013763582,0.0008069666,0.038934868],"category_scores_gemma":[0.0017675884,0.0005336153,0.00090976944,0.0017773905,0.0009840135,0.0024506988,0.0021209528,0.0026594112,0.019139051],"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.00001852407,0.00003268544,0.00019997849,0.00058123324,0.0000356831,0.000066434426,0.000088418325,0.0069703767,0.0014245844,0.6934941,0.06286053,0.23422734],"study_design_scores_gemma":[0.000010041846,0.000012571953,0.0001381247,0.000096959026,0.000016189453,0.00010167878,0.00003093215,0.07157837,0.0014476747,0.69937354,0.22718047,0.000013471592],"about_ca_topic_score_codex":0.00047562167,"about_ca_topic_score_gemma":0.00068860775,"teacher_disagreement_score":0.038934868,"about_ca_system_score_codex":0.00058940204,"about_ca_system_score_gemma":0.00060798577,"threshold_uncertainty_score":0.1302501},"labels":[],"label_agreement":null},{"id":"W4392249554","doi":"10.1007/978-3-031-54776-8_4","title":"Fair Private Set Intersection Using Smart Contracts","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Computer science; Intersection (aeronautics); Set (abstract data type); Programming language; Transport engineering; Engineering","score_opus":0.023351956413623007,"score_gpt":0.26079645800884615,"score_spread":0.23744450159522315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392249554","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.03429709,0.00035677387,0.91316223,0.0008656989,0.00018494503,0.00015075224,0.00019491345,0.0009257197,0.049861737],"genre_scores_gemma":[0.6770975,0.00050850975,0.27484682,0.00025713362,0.00019564548,0.0003315475,0.0003907083,0.0004966432,0.045875452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957937,0.0010668588,0.00018744277,0.0006217813,0.0016928118,0.0006373969],"domain_scores_gemma":[0.9953518,0.0020525772,0.00016626866,0.0018130849,0.0003747926,0.00024141082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035553072,0.0006676067,0.001808424,0.0014154136,0.003099439,0.0057831793,0.0028938982,0.0015891115,0.013538713],"category_scores_gemma":[0.0076175146,0.00094500795,0.0016490158,0.0028388763,0.004081368,0.0127052665,0.0087041035,0.0050474466,0.002520911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001283316,0.00004967533,0.000083103136,0.000029272216,0.000012172418,0.000022442118,0.00012268317,0.007201552,0.00075217505,0.96332973,0.001651995,0.026616774],"study_design_scores_gemma":[0.00002366398,0.000022028413,0.000034050532,0.000014593046,0.000013300077,0.000035000692,0.00003428112,0.044813115,0.0016588125,0.94873565,0.0046018204,0.0000136998415],"about_ca_topic_score_codex":0.00091431744,"about_ca_topic_score_gemma":0.000785273,"teacher_disagreement_score":0.013538713,"about_ca_system_score_codex":0.0031132882,"about_ca_system_score_gemma":0.0029158043,"threshold_uncertainty_score":0.045291543},"labels":[],"label_agreement":null},{"id":"W4392250624","doi":"10.1007/978-981-97-0566-5_16","title":"Reconfiguration of Multisets with Applications to Bin Packing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","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 Manitoba; York University; University of Waterloo","funders":"","keywords":"Control reconfiguration; Multiset; Computer science; Bin packing problem; Focus (optics); Bin; Theoretical computer science; Term (time); Algorithm; Mathematics; Discrete mathematics","score_opus":0.01452839291504815,"score_gpt":0.2341289741037177,"score_spread":0.21960058118866954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392250624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034250014,0.0127181355,0.87181705,0.00043719533,0.0012406708,0.00010501717,0.00016550932,0.0013339561,0.077932455],"genre_scores_gemma":[0.5214509,0.0132356305,0.41359508,0.0003413178,0.001080173,0.00026101372,0.0004912951,0.00062159094,0.048923016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997546,0.000051446656,0.000017150724,0.00005936378,0.00008530704,0.000032048312],"domain_scores_gemma":[0.9997507,0.00011815899,0.000026250027,0.0000551853,0.000027834016,0.000021858319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017643717,0.00093498436,0.0010116835,0.00084477116,0.0006259367,0.001283803,0.00089781097,0.0008003882,0.0070990496],"category_scores_gemma":[0.0007955142,0.00054293324,0.00085168815,0.0032228916,0.00059883116,0.001120403,0.0011550686,0.0013740073,0.0013556469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023378024,0.0001430452,0.000322966,0.0006328775,0.000055795612,0.00061537523,0.00025665882,0.35124794,0.040315866,0.15839094,0.010565225,0.4372196],"study_design_scores_gemma":[0.000031377385,0.00025176266,0.00093786727,0.00012988497,0.000047818157,0.0010834029,0.00014394474,0.5794105,0.012983264,0.35263216,0.05228934,0.000058617934],"about_ca_topic_score_codex":0.00040779836,"about_ca_topic_score_gemma":0.0005338712,"teacher_disagreement_score":0.0070990496,"about_ca_system_score_codex":0.00047378388,"about_ca_system_score_gemma":0.00016645475,"threshold_uncertainty_score":0.023748755},"labels":[],"label_agreement":null},{"id":"W4392250648","doi":"10.1007/978-981-97-0566-5_2","title":"Reasons to Fall (More) in Love with Combinatorial Reconfiguration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","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 Waterloo","funders":"","keywords":"Control reconfiguration; Computer science; Presentation (obstetrics); Field (mathematics); Operations research; Mathematics; Embedded system","score_opus":0.008346411241869746,"score_gpt":0.23288005987219013,"score_spread":0.22453364863032038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392250648","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.007395703,0.032500204,0.02863202,0.350886,0.017747952,0.000051058825,0.00022824142,0.00088054844,0.5616783],"genre_scores_gemma":[0.21228194,0.023505555,0.037265707,0.16620035,0.012234296,0.00018681491,0.00036523084,0.00245547,0.5455047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981219,0.0005660604,0.0000675917,0.00027648636,0.00072457694,0.00024330728],"domain_scores_gemma":[0.995047,0.0021868723,0.0002608996,0.0009917315,0.00084063277,0.00067299156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029750082,0.0004736782,0.00058677123,0.00051031046,0.0030150397,0.005718593,0.0014416394,0.0036032742,0.05899692],"category_scores_gemma":[0.013126305,0.0003808912,0.0005671746,0.0012960562,0.008411836,0.012982626,0.002764343,0.007561645,0.02222876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082457744,0.00004827585,0.00033245975,0.0001245708,0.000015888441,0.00015527738,0.0006052888,0.0005880423,0.00043862013,0.52301,0.3916032,0.08299593],"study_design_scores_gemma":[0.000011953963,0.00002620285,0.00015781677,0.00011765048,0.0000048405445,0.00034805204,0.00048279358,0.00029484925,0.00028292762,0.25149927,0.7467503,0.000023367698],"about_ca_topic_score_codex":0.0010981974,"about_ca_topic_score_gemma":0.0020974781,"teacher_disagreement_score":0.05899692,"about_ca_system_score_codex":0.0013562901,"about_ca_system_score_gemma":0.00094161514,"threshold_uncertainty_score":0.19736433},"labels":[],"label_agreement":null},{"id":"W4392306709","doi":"10.1007/978-3-031-54770-6_7","title":"Upgrading Fuzzy Extractors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"National Research Council Canada","funders":"","keywords":"Computer science; Robustness (evolution); Reuse; Reusability; Fuzzy logic; Upgrade; Extractor; Information leakage; Computer security; Data mining; Theoretical computer science; Artificial intelligence; Software; Programming language; Operating system","score_opus":0.020550856691294514,"score_gpt":0.2554930745638308,"score_spread":0.23494221787253627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392306709","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.029017689,0.00050850195,0.94976723,0.00015579586,0.0002292776,0.000084536245,0.0003028035,0.006948154,0.012986098],"genre_scores_gemma":[0.32917795,0.0009628777,0.6152192,0.0001916059,0.00015007542,0.00007358294,0.0013180301,0.0016167035,0.051289998],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881625,0.00009929182,0.00010029797,0.000280436,0.00059482444,0.000108908345],"domain_scores_gemma":[0.99833846,0.00037397916,0.000060914273,0.00081298075,0.0003720482,0.000041598796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007461559,0.0008935788,0.0006505982,0.001345877,0.00058639445,0.0015921141,0.001251508,0.0008105178,0.016993862],"category_scores_gemma":[0.002926327,0.00067898724,0.00083706406,0.0011947772,0.00081267674,0.004104657,0.0018379977,0.0014210321,0.007444344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004832187,0.00009105857,0.00058548304,0.0003051659,0.000062953106,0.0003061059,0.00022552653,0.00976834,0.095182836,0.037034217,0.0043772943,0.85157776],"study_design_scores_gemma":[0.00009069564,0.0003313267,0.0016869968,0.0002134797,0.00022108058,0.0014841545,0.00029909945,0.20195185,0.5244804,0.118450776,0.15067,0.000120196],"about_ca_topic_score_codex":0.00081018347,"about_ca_topic_score_gemma":0.0010059793,"teacher_disagreement_score":0.016993862,"about_ca_system_score_codex":0.00040728357,"about_ca_system_score_gemma":0.00042829357,"threshold_uncertainty_score":0.056850076},"labels":[],"label_agreement":null},{"id":"W4392309326","doi":"10.1007/978-3-031-54204-6_13","title":"Try On, Spied On?: Privacy Analysis of Virtual Try-On Websites and Android Apps","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":"Concordia University","funders":"","keywords":"Android (operating system); Computer science; Internet privacy; World Wide Web; Privacy protection; Computer security; Operating system","score_opus":0.02077265054315592,"score_gpt":0.2859932686961423,"score_spread":0.26522061815298636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392309326","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.93620557,0.0042454563,0.019230241,0.001658482,0.00008313532,0.00008280363,0.00224706,0.00037592778,0.035871316],"genre_scores_gemma":[0.9852594,0.0006881325,0.004674659,0.00011028825,0.00003244176,0.000027967744,0.0012134259,0.00006552584,0.007928147],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992342,0.00022306186,0.000026310785,0.00009553216,0.00029548444,0.00012538917],"domain_scores_gemma":[0.9955238,0.0034399882,0.00026469433,0.00031701764,0.0003612614,0.00009333288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007830066,0.00033344753,0.00022398711,0.0016562231,0.0005771374,0.0025661953,0.00055897015,0.00063475064,0.0038053126],"category_scores_gemma":[0.004531186,0.00016771398,0.00045697385,0.0018286192,0.0006725608,0.002065088,0.00080112653,0.0009100917,0.00066646823],"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.0015853073,0.0009799203,0.24109177,0.0008964913,0.00036327174,0.0020870722,0.0078005604,0.03241767,0.013180214,0.24449146,0.045129918,0.4099764],"study_design_scores_gemma":[0.000028660783,0.0004639834,0.34869036,0.00043264715,0.00038561877,0.003979346,0.010627991,0.44984868,0.031057041,0.10711795,0.047144283,0.00022354053],"about_ca_topic_score_codex":0.0075318236,"about_ca_topic_score_gemma":0.007953303,"teacher_disagreement_score":0.0075318236,"about_ca_system_score_codex":0.0008387639,"about_ca_system_score_gemma":0.0006580746,"threshold_uncertainty_score":0.014975965},"labels":[],"label_agreement":null},{"id":"W4392309419","doi":"10.1007/978-3-031-54204-6_18","title":"AddShare: A Privacy-Preserving Approach for Federated Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Ottawa","funders":"","keywords":"Computer science; Federated learning; Information privacy; Safeguard; Private information retrieval; Machine learning; Artificial intelligence; Computation; Information sensitivity; Simple (philosophy); Training set; Data mining; Computer security; Algorithm","score_opus":0.034904415504610646,"score_gpt":0.27145051236819834,"score_spread":0.23654609686358768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392309419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032896062,0.0001857271,0.9866058,0.00042748838,0.00012401234,0.00008402426,0.00021865268,0.0043037226,0.0047609024],"genre_scores_gemma":[0.23352587,0.0005551671,0.7291459,0.0010260323,0.00024029877,0.00035905387,0.0012479081,0.00097315066,0.032926656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587446,0.0010489163,0.0002186245,0.00071856735,0.0016801838,0.00045917637],"domain_scores_gemma":[0.9954875,0.0008908343,0.0001411926,0.0029392052,0.0003551082,0.00018612576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034844095,0.00073138135,0.0012221257,0.0012401248,0.0021442734,0.0048351036,0.0040444476,0.0023078695,0.009446158],"category_scores_gemma":[0.007076801,0.0006207636,0.0016790696,0.0018677419,0.0022405654,0.009597107,0.009799997,0.004891056,0.0029244884],"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.0008789315,0.00046239732,0.0006714864,0.00024496616,0.00015629972,0.00020945593,0.00038066358,0.03599391,0.0051604346,0.4417127,0.03175937,0.48236936],"study_design_scores_gemma":[0.000059637972,0.000111156565,0.0002526995,0.00007528736,0.000061143786,0.00046137575,0.00012947967,0.28089443,0.024519576,0.6261396,0.06723045,0.000065240216],"about_ca_topic_score_codex":0.00109911,"about_ca_topic_score_gemma":0.0015722727,"teacher_disagreement_score":0.009446158,"about_ca_system_score_codex":0.0015237442,"about_ca_system_score_gemma":0.0023253197,"threshold_uncertainty_score":0.031600475},"labels":[],"label_agreement":null},{"id":"W4392309462","doi":"10.1007/978-3-031-54204-6","title":"Computer Security. ESORICS 2023 International Workshops","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Computer science; Computer security; Software engineering","score_opus":0.01062831943882628,"score_gpt":0.24210596953266403,"score_spread":0.23147765009383775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392309462","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005364269,0.037086986,0.054081876,0.006117194,0.020880457,0.00030783817,0.003035045,0.0056473264,0.867479],"genre_scores_gemma":[0.009374729,0.011140382,0.014532099,0.0006062856,0.0020339403,0.00011704902,0.0045644646,0.0009177489,0.95671326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990934,0.00017491158,0.00003711269,0.00012512879,0.00041541396,0.00015393173],"domain_scores_gemma":[0.9989411,0.00015995458,0.00003752096,0.00019975037,0.00039915548,0.000262475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016310496,0.0017396258,0.0009536857,0.0024807823,0.00113547,0.0038400276,0.0015018657,0.0014460462,0.19346687],"category_scores_gemma":[0.0012611883,0.00068822654,0.0009735785,0.0024202333,0.00043893466,0.0023397708,0.002231924,0.0018943046,0.14049968],"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.00009872837,0.00015849511,0.0001287193,0.00024749094,0.000014252227,0.000058987316,0.000041716845,0.00083102315,0.001708796,0.007291663,0.648508,0.34091207],"study_design_scores_gemma":[0.000017063361,0.000058115016,0.00051153486,0.00019819052,0.000013830064,0.00017217614,0.000046955203,0.0017832011,0.0013486353,0.00522911,0.99060845,0.000012674223],"about_ca_topic_score_codex":0.002486986,"about_ca_topic_score_gemma":0.0056337365,"teacher_disagreement_score":0.19346687,"about_ca_system_score_codex":0.0012318509,"about_ca_system_score_gemma":0.0019295865,"threshold_uncertainty_score":0.6472112},"labels":[],"label_agreement":null},{"id":"W4392450535","doi":"10.1007/978-3-031-55601-2_3","title":"Bi-arc Digraphs: Recognition Algorithm and Applications","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Arc (geometry); Algorithm; Mathematics","score_opus":0.021695642205586597,"score_gpt":0.2808262074283002,"score_spread":0.2591305652227136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392450535","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.016334152,0.0013656404,0.9555769,0.00036000978,0.000245683,0.00015472513,0.0024493146,0.0053535406,0.01815994],"genre_scores_gemma":[0.12825511,0.0017250922,0.8371358,0.00021314448,0.000116202165,0.00017103188,0.0054301824,0.000618371,0.026335036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997243,0.000033061224,0.00002133299,0.00011386044,0.00007676805,0.00003064509],"domain_scores_gemma":[0.99936324,0.00016551993,0.00005435915,0.00014498178,0.00020650073,0.00006548354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025125267,0.0007807152,0.0006258654,0.0023102653,0.00070123054,0.0016345886,0.0015116624,0.00095517345,0.01149212],"category_scores_gemma":[0.0014356859,0.00058091304,0.0005592907,0.0041352347,0.00039333667,0.0018768721,0.0007945498,0.001111215,0.00653336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017240834,0.00015169199,0.002306116,0.0005202156,0.00003907035,0.00022553572,0.0001623892,0.028199503,0.010975106,0.08678795,0.045715325,0.82474464],"study_design_scores_gemma":[0.00004440126,0.000083379724,0.002761629,0.00017333617,0.000083094594,0.0013109912,0.00027806315,0.7017958,0.01952978,0.16167684,0.11218664,0.00007601446],"about_ca_topic_score_codex":0.003757912,"about_ca_topic_score_gemma":0.0055024726,"teacher_disagreement_score":0.01149212,"about_ca_system_score_codex":0.0007413318,"about_ca_system_score_gemma":0.00081833935,"threshold_uncertainty_score":0.038444996},"labels":[],"label_agreement":null},{"id":"W4392452252","doi":"10.1007/978-3-031-55598-5_10","title":"Space-Efficient Conversions from SLPs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Dalhousie University","funders":"","keywords":"Computer science; Space (punctuation); Programming language; Theoretical computer science; Operating system","score_opus":0.013574039413714422,"score_gpt":0.23569562362226765,"score_spread":0.2221215842085532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392452252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07114472,0.0018062427,0.7550056,0.00051986985,0.0009900471,0.00024238341,0.0016114811,0.014454174,0.15422548],"genre_scores_gemma":[0.5510517,0.0017168153,0.36548918,0.0004725098,0.0003201677,0.0003104942,0.0035175565,0.0041468055,0.07297482],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999537,0.00005592928,0.000039685336,0.000077868215,0.00019976357,0.00008967766],"domain_scores_gemma":[0.99936694,0.00021561487,0.000022535782,0.0002726129,0.00010475711,0.000017616368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022203878,0.0008193619,0.0004986915,0.0011484661,0.00060227374,0.0015944487,0.00091791764,0.0005506329,0.022442512],"category_scores_gemma":[0.0013479437,0.00038323697,0.000642462,0.0019229449,0.0007543758,0.0022634207,0.0020455362,0.0011274026,0.00771016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028296327,0.00011490786,0.00022295778,0.0005213495,0.000033272197,0.0005385015,0.00040281078,0.014978324,0.038946833,0.272822,0.03241977,0.63871634],"study_design_scores_gemma":[0.00008350484,0.00021396994,0.0004996248,0.0002034412,0.000074667456,0.001502974,0.00041772594,0.07837744,0.16951483,0.53959954,0.2094328,0.00007954847],"about_ca_topic_score_codex":0.00053335645,"about_ca_topic_score_gemma":0.0009484139,"teacher_disagreement_score":0.022442512,"about_ca_system_score_codex":0.0004198344,"about_ca_system_score_gemma":0.0003991408,"threshold_uncertainty_score":0.07507771},"labels":[],"label_agreement":null},{"id":"W4392452257","doi":"10.1007/978-3-031-55598-5_14","title":"On Approximate Colored Path Counting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Colored; Path (computing); Artificial intelligence; Algorithm; Computer network","score_opus":0.014044541462618677,"score_gpt":0.2327552379191174,"score_spread":0.2187106964564987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392452257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01848191,0.0018759096,0.88592064,0.0016555617,0.00087926973,0.0001769601,0.00083925953,0.002239678,0.08793088],"genre_scores_gemma":[0.28444764,0.0029836223,0.6262187,0.0019840961,0.0011833627,0.00074834516,0.0030938059,0.0026389777,0.07670147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968976,0.00082796736,0.00012476188,0.0005735794,0.0011691637,0.00040700397],"domain_scores_gemma":[0.9930831,0.0034546645,0.00023793508,0.0021929466,0.00068760023,0.00034376746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368659,0.0021338814,0.002886608,0.0035294606,0.002374059,0.004208166,0.0053589,0.0019701584,0.022973388],"category_scores_gemma":[0.015053455,0.0010741384,0.0019744742,0.008648265,0.0027186584,0.009028048,0.0063421694,0.005667983,0.004427592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001739518,0.00009202291,0.0004714573,0.00018911035,0.000045335473,0.00005553077,0.000113308495,0.03815714,0.0010818903,0.80961263,0.025020747,0.12498692],"study_design_scores_gemma":[0.000014904363,0.00001818554,0.00016168454,0.00004309518,0.000026695701,0.00006458398,0.000029175288,0.12715383,0.0005862006,0.86078537,0.011101137,0.000015221433],"about_ca_topic_score_codex":0.0054642763,"about_ca_topic_score_gemma":0.0067276363,"teacher_disagreement_score":0.022973388,"about_ca_system_score_codex":0.004118972,"about_ca_system_score_gemma":0.0024954835,"threshold_uncertainty_score":0.07685363},"labels":[],"label_agreement":null},{"id":"W4392452275","doi":"10.1007/978-3-031-55598-5_12","title":"Wheeler Maps","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.014642321592585715,"score_gpt":0.24242317495175786,"score_spread":0.22778085335917214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392452275","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.0060492163,0.0021699117,0.08184999,0.0009699536,0.0011599258,0.0000774132,0.0014022359,0.0014771948,0.9048442],"genre_scores_gemma":[0.06386706,0.0024604788,0.02667911,0.00038271348,0.00030502118,0.00010400329,0.002018933,0.0010834179,0.90309936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999645,0.000032708314,0.000014675963,0.00009185529,0.00016163055,0.000054210184],"domain_scores_gemma":[0.99975497,0.00004037811,0.000010952825,0.00006433373,0.00009374484,0.00003551698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018647932,0.0007190751,0.00059721747,0.002247965,0.001417298,0.0026141342,0.00086773786,0.00080607284,0.09502953],"category_scores_gemma":[0.0011248314,0.0004275059,0.0005119975,0.0018759159,0.0008509892,0.0028611228,0.0017764363,0.0015965862,0.049275193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004173048,0.000025192046,0.000106475054,0.00008842486,0.000008683484,0.00007658812,0.00021874951,0.00080987625,0.0018540693,0.7318665,0.08647212,0.17843156],"study_design_scores_gemma":[0.0000069293883,0.000013715597,0.00018240033,0.000041896423,0.000009215359,0.0001929376,0.00011412591,0.001446032,0.0020907158,0.3164525,0.67943555,0.000014012788],"about_ca_topic_score_codex":0.0031863872,"about_ca_topic_score_gemma":0.003259517,"teacher_disagreement_score":0.09502953,"about_ca_system_score_codex":0.0010090802,"about_ca_system_score_gemma":0.00079182687,"threshold_uncertainty_score":0.3179055},"labels":[],"label_agreement":null},{"id":"W4392453829","doi":"10.1007/978-3-031-55598-5_18","title":"Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.01916650100272064,"score_gpt":0.2392212954782524,"score_spread":0.22005479447553178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392453829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019694686,0.0003937736,0.9769652,0.00025982084,0.000042204443,0.00008532234,0.00017626237,0.0003897985,0.0019929677],"genre_scores_gemma":[0.39128712,0.0006164642,0.6019546,0.00013508167,0.0001580235,0.00030246863,0.0005853604,0.0007578064,0.004203091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851733,0.00058111636,0.00006821332,0.00028772338,0.00037400835,0.00017165238],"domain_scores_gemma":[0.992615,0.0055274474,0.00037997944,0.0005369916,0.0007453498,0.00019529171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002623016,0.001557548,0.0017423226,0.0011857721,0.0005775556,0.0017367797,0.0024675087,0.0018587188,0.0033560265],"category_scores_gemma":[0.018286834,0.00095437287,0.0011519366,0.00127895,0.00088326086,0.0026614,0.0026025095,0.0017438718,0.0006301023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004943768,0.0000679805,0.0007858905,0.00032030774,0.000088750596,0.00008478904,0.0001676516,0.8414255,0.007692145,0.024621343,0.004049583,0.12020177],"study_design_scores_gemma":[0.000020348474,0.00008173795,0.0003031522,0.000020959094,0.00002488121,0.000057036657,0.000044838616,0.9807751,0.003363429,0.014334271,0.00095940987,0.000014711378],"about_ca_topic_score_codex":0.003725857,"about_ca_topic_score_gemma":0.0031414304,"teacher_disagreement_score":0.003725857,"about_ca_system_score_codex":0.0012617487,"about_ca_system_score_gemma":0.001590455,"threshold_uncertainty_score":0.013872027},"labels":[],"label_agreement":null},{"id":"W4392509384","doi":"10.1007/978-3-031-54806-2_14","title":"Deep Learning-Based Hierarchical Delineation of Kidneys, Tumors, and Cysts in CT Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal cell carcinoma treatment","field":"Medicine","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; University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Computer vision; Pattern recognition (psychology)","score_opus":0.011961726882665757,"score_gpt":0.25302077844346693,"score_spread":0.24105905156080118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392509384","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.032833733,0.0020020271,0.9582589,0.00046918003,0.000081634076,0.00008818536,0.00074021355,0.0019371255,0.0035889153],"genre_scores_gemma":[0.25904748,0.0024711154,0.72415936,0.00035627882,0.00012778922,0.00011143815,0.001987378,0.0006175792,0.011121552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982005,0.000023174402,0.0000141639985,0.00004414162,0.00006358885,0.000034843182],"domain_scores_gemma":[0.999627,0.00016642748,0.000038920254,0.000039377643,0.00009774021,0.000030480265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000549503,0.0006875693,0.0007148256,0.0008914906,0.00021066118,0.0010119159,0.0010494216,0.0009298995,0.0024792182],"category_scores_gemma":[0.0009973353,0.0005670416,0.00093453773,0.0007583755,0.0003085592,0.0008295034,0.0010349079,0.0012326033,0.00089693593],"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.00016680837,0.00008517082,0.001900822,0.00024511668,0.0000737998,0.00015605129,0.00010091604,0.20926875,0.030198248,0.007204194,0.010367655,0.7402325],"study_design_scores_gemma":[0.000006970127,0.000034484157,0.0010916806,0.00005394901,0.000027643577,0.00024463364,0.000018067449,0.97695947,0.012465547,0.00605745,0.003025052,0.000015045269],"about_ca_topic_score_codex":0.009315032,"about_ca_topic_score_gemma":0.017888412,"teacher_disagreement_score":0.009315032,"about_ca_system_score_codex":0.000669029,"about_ca_system_score_gemma":0.0010789005,"threshold_uncertainty_score":0.018521667},"labels":[],"label_agreement":null},{"id":"W4392509442","doi":"10.1007/978-3-031-54806-2_13","title":"3d U-Net with ROI Segmentation of Kidneys and Masses in CT Scans","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Computer science; Segmentation; Artificial intelligence; Computer vision; Computer graphics (images)","score_opus":0.008007707190731995,"score_gpt":0.2659208682364771,"score_spread":0.2579131610457451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392509442","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.023754466,0.001959309,0.9483953,0.0003761665,0.0002597987,0.000279831,0.002181525,0.014137564,0.0086559765],"genre_scores_gemma":[0.1062768,0.0011396444,0.87806994,0.00033383613,0.00011888795,0.00020526936,0.0027515413,0.0015294069,0.009574582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.000044617394,0.000032413813,0.0001233515,0.00011797367,0.00005284095],"domain_scores_gemma":[0.99972945,0.00009609086,0.000023142378,0.000050392227,0.000077388475,0.00002359612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504411,0.0013943133,0.001032003,0.0017297323,0.00049303554,0.0021695772,0.0017325415,0.0022414569,0.0069624637],"category_scores_gemma":[0.0011489585,0.001127805,0.0015153101,0.0013017091,0.00042715232,0.0009530793,0.001270979,0.00073750794,0.0036222036],"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.0005202996,0.00013918303,0.0023117978,0.00044247508,0.00014530291,0.0005451045,0.00013038391,0.14034723,0.026379222,0.0059829773,0.0206706,0.8023855],"study_design_scores_gemma":[0.000022359998,0.00009916254,0.0013918069,0.00011072301,0.00007103819,0.000854936,0.0000363908,0.9544368,0.025347678,0.0052362047,0.012349956,0.000043026474],"about_ca_topic_score_codex":0.007680361,"about_ca_topic_score_gemma":0.012117606,"teacher_disagreement_score":0.007680361,"about_ca_system_score_codex":0.0007488186,"about_ca_system_score_gemma":0.0013603431,"threshold_uncertainty_score":0.023291826},"labels":[],"label_agreement":null},{"id":"W4392509753","doi":"10.1007/978-3-031-54806-2_17","title":"A Deep Learning Approach for the Segmentation of Kidney, Tumor and Cyst in Computed Tomography Scans","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal cell carcinoma treatment","field":"Medicine","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 Alberta","funders":"","keywords":"Computer science; Computed tomography; Segmentation; Artificial intelligence; Cyst; Computer vision; Tomography; Radiology; Medicine","score_opus":0.016658574136938657,"score_gpt":0.24783308433222914,"score_spread":0.23117451019529048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392509753","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.013620016,0.0022058494,0.9774826,0.0005608418,0.0001827892,0.00006415868,0.0005160025,0.0022860344,0.0030817778],"genre_scores_gemma":[0.16823377,0.002544043,0.80420613,0.00067747,0.00027166968,0.00014520713,0.0018447129,0.0006048151,0.021472175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974865,0.000034393634,0.000018231724,0.000066152665,0.000088677436,0.000043956912],"domain_scores_gemma":[0.99961406,0.00016650073,0.000023846704,0.00003931859,0.00012627979,0.000030026333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070439896,0.00090964336,0.0008797098,0.00082845485,0.0003639223,0.000986918,0.001648822,0.0018472492,0.0033687202],"category_scores_gemma":[0.0010419392,0.0007603705,0.0010830293,0.0009561687,0.0003826091,0.00075435,0.0014386825,0.0016049937,0.001272761],"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.00014211654,0.00009742742,0.0007890693,0.00014327503,0.00009663753,0.00014333379,0.000061235,0.2120165,0.014979988,0.0068199285,0.015072158,0.7496384],"study_design_scores_gemma":[0.0000052817177,0.000027254478,0.00035104982,0.000021686808,0.000019886551,0.00010731536,0.000008928013,0.98818886,0.0036046866,0.00505667,0.0025989262,0.000009450278],"about_ca_topic_score_codex":0.014001079,"about_ca_topic_score_gemma":0.022940483,"teacher_disagreement_score":0.014001079,"about_ca_system_score_codex":0.000919321,"about_ca_system_score_gemma":0.0010328566,"threshold_uncertainty_score":0.027839124},"labels":[],"label_agreement":null},{"id":"W4392552251","doi":"10.1007/978-3-031-54605-1_11","title":"GenLayNeRF: Generalizable Layered Representations with 3D Model Alignment for Human View Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.038158726545587135,"score_gpt":0.28347322908090183,"score_spread":0.2453145025353147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392552251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007956857,0.00009434671,0.9916169,0.000018783896,0.000037302696,0.000022081185,0.00027059737,0.0062424648,0.00090189965],"genre_scores_gemma":[0.03836288,0.00025441515,0.95185494,0.000103000355,0.000038408853,0.00012643744,0.0022793189,0.0021889152,0.0047917413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953055,0.000059069105,0.000019047322,0.0001307144,0.00020634846,0.000054270393],"domain_scores_gemma":[0.999749,0.000068629146,0.00001581659,0.000106263375,0.00004260102,0.000017748453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322468,0.0017801643,0.0012206552,0.00096374337,0.00027867506,0.0014396214,0.0022179107,0.0016265893,0.017333558],"category_scores_gemma":[0.0011541063,0.0010654503,0.0016186021,0.0009785468,0.0004188771,0.0016056104,0.0025185274,0.0018925987,0.008481662],"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.00027324297,0.00007037619,0.00022509946,0.00023119852,0.00016281792,0.0001838884,0.00012276717,0.07209075,0.044332657,0.01853887,0.030257124,0.83351105],"study_design_scores_gemma":[0.000057813537,0.00007796499,0.0002743724,0.00006387943,0.000047474423,0.0003185536,0.00005166753,0.89890844,0.03440293,0.031345643,0.034400996,0.00005026881],"about_ca_topic_score_codex":0.0031157178,"about_ca_topic_score_gemma":0.0055895033,"teacher_disagreement_score":0.017333558,"about_ca_system_score_codex":0.0004377085,"about_ca_system_score_gemma":0.00056838465,"threshold_uncertainty_score":0.057986557},"labels":[],"label_agreement":null},{"id":"W4392605832","doi":"10.1007/978-3-031-52113-3_28","title":"Positive Characteristic Sets for Relational Pattern Languages","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Regina","funders":"","keywords":"Computer science; Programming language; Relational database; Natural language processing; Artificial intelligence; Theoretical computer science; Information retrieval","score_opus":0.011955958014900176,"score_gpt":0.27143595651556973,"score_spread":0.25947999850066955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392605832","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.03945147,0.0047752,0.8041734,0.0027299589,0.0005227822,0.00012842125,0.00093247934,0.0012320183,0.14605431],"genre_scores_gemma":[0.6191002,0.004646394,0.28888616,0.0010829312,0.0010647245,0.000652393,0.0019795443,0.0009827765,0.08160484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998841,0.00020603038,0.00008755723,0.00023076044,0.0005215863,0.000113222995],"domain_scores_gemma":[0.9971758,0.0019668143,0.00016468232,0.0003692845,0.00022344697,0.00009997743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010551754,0.00064829696,0.0007501971,0.0021481314,0.0012034423,0.0036586141,0.0010228583,0.0008046205,0.008779071],"category_scores_gemma":[0.004188763,0.00086091954,0.0010030522,0.0033671279,0.002692312,0.008556709,0.0020112752,0.0037347584,0.0019641004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017490029,0.000011474389,0.00010612515,0.00008827239,0.000005796356,0.00003168304,0.00016268404,0.00074818777,0.00073107943,0.95968866,0.004247691,0.03416098],"study_design_scores_gemma":[0.0000046495343,0.0000053487647,0.000077369215,0.00001861686,0.000004759677,0.00009057964,0.000032928678,0.0022705817,0.00042907646,0.98764145,0.009417132,0.000007606711],"about_ca_topic_score_codex":0.0005082137,"about_ca_topic_score_gemma":0.0005254453,"teacher_disagreement_score":0.008779071,"about_ca_system_score_codex":0.001928507,"about_ca_system_score_gemma":0.0006478248,"threshold_uncertainty_score":0.029368937},"labels":[],"label_agreement":null},{"id":"W4392605842","doi":"10.1007/978-3-031-52113-3_14","title":"Visualization of Bipartite Graphs in Limited Window Size","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bipartite graph; Window (computing); Graph drawing; Visualization; Theoretical computer science; Algorithm; Artificial intelligence; Graph; World Wide Web","score_opus":0.019977074303522805,"score_gpt":0.28626083946068087,"score_spread":0.26628376515715807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392605842","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.19177465,0.0014926018,0.7477601,0.0016026878,0.0002929171,0.00015297819,0.0068318085,0.024503462,0.025588717],"genre_scores_gemma":[0.5912241,0.0018485223,0.38406163,0.00027746338,0.00013746985,0.00022146301,0.005326111,0.0037942275,0.0131090125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998754,0.000034860936,0.000006286232,0.00002168778,0.0000316794,0.00002993587],"domain_scores_gemma":[0.999073,0.00047378923,0.000069625305,0.000090085334,0.00016888748,0.00012450133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033866303,0.0006795838,0.00045375523,0.0014299852,0.00039809122,0.0015097598,0.000573104,0.0004586326,0.01366346],"category_scores_gemma":[0.0012654038,0.000417423,0.00045149264,0.0014917693,0.0001833844,0.0012196365,0.0009114736,0.000854508,0.0011452411],"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.0028253063,0.0004678482,0.007609804,0.002115871,0.00032952047,0.0020087608,0.0026580459,0.21287024,0.19173285,0.10886515,0.12877457,0.3397421],"study_design_scores_gemma":[0.0001438265,0.000096097545,0.006200919,0.00022517302,0.000077722485,0.000619119,0.0005736991,0.8612011,0.027967796,0.07027626,0.032525275,0.000092951756],"about_ca_topic_score_codex":0.0035361568,"about_ca_topic_score_gemma":0.004197013,"teacher_disagreement_score":0.01366346,"about_ca_system_score_codex":0.0003654379,"about_ca_system_score_gemma":0.0004980094,"threshold_uncertainty_score":0.045708835},"labels":[],"label_agreement":null},{"id":"W4392605854","doi":"10.1007/978-3-031-52113-3_5","title":"Fractional Bamboo Trimming and Distributed Windows Scheduling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Computer science; Trimming; Bamboo; Scheduling (production processes); Parallel computing; Distributed computing; Operating system; Mathematical optimization; Mathematics; Composite material","score_opus":0.011523361404668742,"score_gpt":0.22604654121482046,"score_spread":0.2145231798101517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392605854","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.056897614,0.0009925868,0.9245645,0.00011730579,0.000261042,0.000037744707,0.000051340634,0.0010279386,0.016049895],"genre_scores_gemma":[0.6827748,0.00052758725,0.29675192,0.00009355074,0.00010360358,0.00005836573,0.00011622887,0.00026368923,0.019310178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990785,0.000012448627,0.0000034378827,0.000024654371,0.000028301902,0.0000232989],"domain_scores_gemma":[0.99985695,0.000046577097,0.00001773685,0.0000403771,0.000022231638,0.000016076241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015236362,0.0004141688,0.00044100103,0.00041439608,0.00047924105,0.0005047647,0.0007366781,0.00030762897,0.005347099],"category_scores_gemma":[0.00054086535,0.0001949971,0.00022953561,0.0007502786,0.00031278425,0.0006968165,0.00040696704,0.00063742656,0.0005698264],"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.0012699239,0.0001502623,0.00032622585,0.0001979343,0.000041741023,0.00018654756,0.00012063211,0.22857814,0.14171816,0.099665105,0.005387989,0.52235734],"study_design_scores_gemma":[0.00006354138,0.00020425013,0.00052435993,0.000030031257,0.000027200698,0.00018551183,0.000046108547,0.8788646,0.043808404,0.0627217,0.013499725,0.000024516667],"about_ca_topic_score_codex":0.0011627964,"about_ca_topic_score_gemma":0.0022687777,"teacher_disagreement_score":0.005347099,"about_ca_system_score_codex":0.00058302336,"about_ca_system_score_gemma":0.0004639434,"threshold_uncertainty_score":0.01788783},"labels":[],"label_agreement":null},{"id":"W4392639862","doi":"10.1007/978-3-031-55673-9","title":"Applied Reconfigurable Computing. Architectures, Tools, and Applications","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Los Alamos National Laboratory; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universität Paderborn; Universidade do Porto; Tallinna Tehnikaülikool; Technische Universität Darmstadt; Universität zu Lübeck; Universidad Politécnica de Madrid; Aristotle University of Thessaloniki; Ulster University; Technische Universität Dresden; Imperial College London; Università degli Studi di Cagliari; Università degli Studi di Siena; Universidade de Aveiro; City University of Hong Kong; Universiteit van Amsterdam; Queen's University; Keio University; University of Patras; University of Wisconsin-Madison","keywords":"Computer science; Computer architecture; Parallel computing; Software engineering","score_opus":0.017193108206820056,"score_gpt":0.2538550982265131,"score_spread":0.23666199001969304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392639862","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034794526,0.3617355,0.1557096,0.0019262352,0.009064718,0.0001941464,0.0012284335,0.0065644,0.46009755],"genre_scores_gemma":[0.026781641,0.1271104,0.076828696,0.001289842,0.0027235188,0.00023783481,0.0013545139,0.0013929649,0.7622806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997111,0.00001826863,0.000013636276,0.00004828075,0.00018838396,0.00002030846],"domain_scores_gemma":[0.99976486,0.00007793002,0.00002107614,0.00005774579,0.00005589174,0.00002246721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020059006,0.0016512249,0.001089167,0.0016998823,0.0003017969,0.0020079548,0.0013617371,0.00084337016,0.054400593],"category_scores_gemma":[0.0005206262,0.00078597217,0.00060812925,0.0025522718,0.0006076721,0.0016396638,0.00087154296,0.0019111935,0.03803208],"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.00006831864,0.000056245528,0.00012096384,0.0012540951,0.000044255954,0.000112071786,0.0000690004,0.0038326557,0.015785582,0.05390811,0.20274694,0.7220018],"study_design_scores_gemma":[0.00002362214,0.00008900537,0.00045860087,0.00037596087,0.000034521352,0.0009773347,0.000028441644,0.008222249,0.0042049563,0.04468548,0.94087183,0.000027873344],"about_ca_topic_score_codex":0.00042782698,"about_ca_topic_score_gemma":0.001002395,"teacher_disagreement_score":0.054400593,"about_ca_system_score_codex":0.00040939805,"about_ca_system_score_gemma":0.00040857831,"threshold_uncertainty_score":0.18198812},"labels":[],"label_agreement":null},{"id":"W4392667554","doi":"10.1007/978-3-031-55088-1_7","title":"Self Supervised Multi-view Graph Representation Learning in Digital Pathology","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Digital pathology; Graph; Economic shortage; Artificial intelligence; Representation (politics); Machine learning; External Data Representation; Deep learning; Labeled data; Theoretical computer science; Pattern recognition (psychology)","score_opus":0.02083813577045536,"score_gpt":0.26638915533550206,"score_spread":0.2455510195650467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392667554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020941416,0.0016144598,0.9736867,0.00029488292,0.00008196229,0.000036135134,0.00032679984,0.0016106336,0.0014070608],"genre_scores_gemma":[0.4496146,0.0023846647,0.5316147,0.0003606613,0.000276218,0.00011178613,0.0027880676,0.0006249982,0.012224239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996061,0.00009928527,0.00001530942,0.00014281298,0.000095606185,0.000041043542],"domain_scores_gemma":[0.99922764,0.0003420796,0.00007611921,0.00017962474,0.00013222297,0.00004232674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064195093,0.00056456897,0.00097204087,0.001549408,0.00025676764,0.0009843286,0.0014910245,0.0012726731,0.0017387517],"category_scores_gemma":[0.0015359144,0.00045391053,0.0012769355,0.0016049157,0.00046657247,0.0012892945,0.00109845,0.0011478027,0.0010140935],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013571496,0.00015712895,0.0013421527,0.0002691837,0.00017690929,0.00011599827,0.00009280569,0.16056475,0.020434221,0.0077455,0.01455503,0.79441065],"study_design_scores_gemma":[0.0000039955507,0.000040453433,0.0005394712,0.000014184574,0.000025447978,0.00014180415,0.000020535674,0.98610085,0.0038417042,0.007259653,0.002002618,0.000009354354],"about_ca_topic_score_codex":0.0026767727,"about_ca_topic_score_gemma":0.0047539636,"teacher_disagreement_score":0.0026767727,"about_ca_system_score_codex":0.0004991136,"about_ca_system_score_gemma":0.0004062399,"threshold_uncertainty_score":0.005816698},"labels":[],"label_agreement":null},{"id":"W4392718840","doi":"10.1007/978-981-97-0834-5","title":"Algorithms and Architectures for Parallel Processing","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"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":"Institute of Computing Technology, Chinese Academy of Sciences; Dalian Maritime University; University of Science and Technology of China; University of Shanghai for Science and Technology; Nanjing University; Nanjing University of Information Science and Technology; Peking University; National University of Defense Technology; Università della Calabria; Xidian University; Danmarks Tekniske Universitet; Shanghai Jiao Tong University; Tianjin University; Shaanxi Normal University; Guangdong University of Technology; Ocean University of China; Huazhong University of Science and Technology; Dalian University of Technology; Hubei University of Technology; Lomonosov Moscow State University; Tsinghua University; Trent University; Tianjin University of Technology; Chinese Academy of Sciences; University of Electronic Science and Technology of China; Beijing Jiaotong University; Kanazawa University; Kungliga Tekniska Högskolan; Beihang University; Nottingham Trent University; Kalinga Institute of Industrial Technology; Hunan University; University of West Attica; South China Agricultural University; Université du Luxembourg; University of Louisiana at Lafayette; Tulane University; China Agricultural University; Hubei University; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Ohio State University","keywords":"Computer science; Parallel processing; Parallel computing","score_opus":0.016565827323833427,"score_gpt":0.2796502157388184,"score_spread":0.26308438841498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392718840","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.0015772985,0.026148116,0.8327606,0.0016602715,0.004383846,0.0001576827,0.00045623997,0.0040412648,0.12881471],"genre_scores_gemma":[0.024479546,0.027309675,0.71549094,0.0008492949,0.0033392208,0.00064614986,0.0013445034,0.0021753751,0.22436534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.0000995032,0.000033787943,0.00008302442,0.00034981297,0.00004028898],"domain_scores_gemma":[0.9994399,0.00020126451,0.00002519868,0.00018082764,0.00012922344,0.000023453395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049538765,0.0018993746,0.0014159523,0.0011863224,0.0006391783,0.002434088,0.001668227,0.0010447024,0.03714444],"category_scores_gemma":[0.0017842266,0.0009769738,0.00065728714,0.003352131,0.00096767995,0.0030888298,0.0014777523,0.0028599792,0.024220996],"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.000085838554,0.00005697493,0.000095908894,0.0007051933,0.00007000722,0.00006945427,0.00006831094,0.022624237,0.0045409678,0.34718606,0.17450142,0.44999555],"study_design_scores_gemma":[0.00004793803,0.00005398763,0.00018599987,0.0001314806,0.000043559412,0.00022150492,0.00002397378,0.07018781,0.0029070447,0.43304214,0.49312994,0.000024617759],"about_ca_topic_score_codex":0.000498467,"about_ca_topic_score_gemma":0.0006005701,"teacher_disagreement_score":0.03714444,"about_ca_system_score_codex":0.00067434116,"about_ca_system_score_gemma":0.0007575427,"threshold_uncertainty_score":0.124260545},"labels":[],"label_agreement":null},{"id":"W4392738738","doi":"10.1007/978-3-031-55015-7","title":"RoboCup 2023: Robot World Cup XXVI","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Instituto Superior Técnico; Frankfurt University of Applied Sciences; Universidade do Estado da Bahia; Universitat Pompeu Fabra; Rheinische Friedrich-Wilhelms-Universität Bonn; Polytechnique Montréal; Universidade de Aveiro","keywords":"Computer science; Robot; Artificial intelligence; Computer vision; Human–computer interaction","score_opus":0.014257690361608481,"score_gpt":0.23622908919455307,"score_spread":0.2219713988329446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392738738","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024932618,0.014269263,0.055438563,0.0016850259,0.0056436453,0.00036213972,0.022143941,0.030761085,0.86720306],"genre_scores_gemma":[0.0028634542,0.0024720053,0.0071322056,0.00027958554,0.00031778147,0.00010317699,0.01049826,0.0033121845,0.97302127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968207,0.000016082782,0.000009403863,0.000049460617,0.0002031592,0.000039815633],"domain_scores_gemma":[0.9997068,0.000028828807,0.000013093914,0.000035078814,0.00013326516,0.00008289076],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003504551,0.0023146935,0.0009957644,0.0018349296,0.000807599,0.0027849467,0.0017492741,0.0011188436,0.34324476],"category_scores_gemma":[0.0007217134,0.00087724795,0.0007194863,0.0018150504,0.00025172287,0.0020637577,0.0012862931,0.001440991,0.2509173],"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.000039752675,0.000018469793,0.000023304005,0.00012999157,0.0000053699696,0.000014619479,0.0000102774,0.00037061644,0.00070641673,0.0019052582,0.9039971,0.092778794],"study_design_scores_gemma":[0.000010665143,0.000036684953,0.0002000219,0.00005368177,0.000005306048,0.00007678054,0.000009292107,0.0017101024,0.0011007419,0.0018063496,0.9949778,0.000012722613],"about_ca_topic_score_codex":0.0049948497,"about_ca_topic_score_gemma":0.013004145,"teacher_disagreement_score":0.34324476,"about_ca_system_score_codex":0.00072161714,"about_ca_system_score_gemma":0.0009457006,"threshold_uncertainty_score":0.93678164},"labels":[],"label_agreement":null},{"id":"W4392799878","doi":"10.1007/978-3-031-56066-8_27","title":"Fairness Through Domain Awareness: Mitigating Popularity Bias for Music Discovery","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Computer science; Popularity; Domain (mathematical analysis); Data science; Human–computer interaction; Psychology","score_opus":0.05199363965902713,"score_gpt":0.28607011394623433,"score_spread":0.23407647428720718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392799878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12785329,0.001640791,0.85214627,0.0023805515,0.00039939114,0.00021650582,0.0003431955,0.0013462981,0.01367371],"genre_scores_gemma":[0.92639154,0.00036074335,0.067953646,0.00041832236,0.0005637029,0.000092998525,0.00018973254,0.00018874247,0.003840604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9873754,0.005549726,0.0005438799,0.002510744,0.003037111,0.0009831451],"domain_scores_gemma":[0.87513167,0.08463241,0.0067549283,0.022389423,0.007955233,0.003136339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014558246,0.00071882363,0.0020946765,0.002206256,0.0028114645,0.0047123875,0.0030071335,0.0020995862,0.0034131033],"category_scores_gemma":[0.09977879,0.00079160964,0.0006208846,0.002858258,0.0026208563,0.010940815,0.006630768,0.003352217,0.00095579337],"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.002392453,0.0010065857,0.030096829,0.00043005584,0.00035031477,0.00044203395,0.0026634855,0.07025262,0.018850848,0.34782916,0.01725599,0.5084295],"study_design_scores_gemma":[0.00012436982,0.00019813454,0.0030354953,0.00005768558,0.00015638853,0.00034486142,0.00051287585,0.5311114,0.0076840203,0.44838434,0.008301005,0.00008943426],"about_ca_topic_score_codex":0.002000104,"about_ca_topic_score_gemma":0.0025566395,"teacher_disagreement_score":0.014558246,"about_ca_system_score_codex":0.0014342982,"about_ca_system_score_gemma":0.004181734,"threshold_uncertainty_score":0.07699227},"labels":[],"label_agreement":null},{"id":"W4392800005","doi":"10.1007/978-3-031-56066-8_4","title":"Context-Aware Query Term Difficulty Estimation for Performance Prediction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Term (time); Context (archaeology); Estimation; Data mining; Artificial intelligence; Machine learning; Information retrieval","score_opus":0.0182349759966648,"score_gpt":0.2578237780317062,"score_spread":0.2395888020350414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392800005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15107068,0.007992142,0.827373,0.00038052653,0.00027865468,0.00022322052,0.0027709412,0.00745227,0.0024584592],"genre_scores_gemma":[0.7593539,0.0018105132,0.23095858,0.00010676015,0.00052054756,0.0001768845,0.0043222937,0.00030597023,0.0024445064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.00013204226,0.000090566726,0.00024804482,0.0003885554,0.00009991551],"domain_scores_gemma":[0.99723816,0.0014273839,0.00033248428,0.0002856155,0.0005885368,0.00012772568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079903065,0.0011703706,0.001488286,0.0027962907,0.0003419888,0.0011454407,0.0009768258,0.00078933436,0.0017606459],"category_scores_gemma":[0.007143644,0.00028625823,0.00074156316,0.0029205645,0.00018375515,0.001514684,0.0007315337,0.0012389083,0.0016332997],"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.00084322196,0.0005239725,0.028304182,0.00046354157,0.00019330124,0.00019490653,0.0001221582,0.061179847,0.07065668,0.0016879091,0.012948204,0.82288224],"study_design_scores_gemma":[0.000016830603,0.00015565683,0.009747465,0.000026254118,0.0000677462,0.00023917518,0.000033919023,0.9754971,0.010190172,0.0021738212,0.0018162748,0.000035551577],"about_ca_topic_score_codex":0.0032977187,"about_ca_topic_score_gemma":0.00434732,"teacher_disagreement_score":0.0032977187,"about_ca_system_score_codex":0.00044983035,"about_ca_system_score_gemma":0.0005485558,"threshold_uncertainty_score":0.0065570474},"labels":[],"label_agreement":null},{"id":"W4392800119","doi":"10.1007/978-3-031-56066-8_6","title":"Estimating Query Performance Through Rich Contextualized Query Representations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Toronto Metropolitan University; University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Query optimization; Sargable; Query expansion; Query language; Information retrieval; Web search query; Query by Example; RDF query language; Web query classification; Search engine","score_opus":0.025940496674701653,"score_gpt":0.29490498782356644,"score_spread":0.2689644911488648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392800119","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.3118572,0.004091743,0.6733056,0.00046164988,0.00012359206,0.00013249266,0.0021181668,0.005852184,0.0020574173],"genre_scores_gemma":[0.85029066,0.0010601865,0.14282061,0.00013337571,0.0002642356,0.000088066816,0.0039902627,0.00029622094,0.0010564042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814665,0.00045877355,0.00010408103,0.0004072175,0.0006766233,0.00020674798],"domain_scores_gemma":[0.99645305,0.0022653656,0.00028382914,0.0004760173,0.0004397638,0.00008199952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015072046,0.0010513428,0.0014710958,0.0016005368,0.00030801576,0.0018528196,0.00093746645,0.0011508026,0.0010174221],"category_scores_gemma":[0.008389334,0.00047270302,0.0006353783,0.0022226973,0.0004699041,0.002844731,0.00088090333,0.0011677904,0.00083646324],"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.0026696373,0.00080613646,0.016907807,0.00037337793,0.0003745018,0.0002322304,0.00018708901,0.35688236,0.09464466,0.0046215197,0.0098014595,0.51249933],"study_design_scores_gemma":[0.00001835182,0.00020523713,0.0026470055,0.000007598762,0.000056660738,0.000102588085,0.00002974071,0.98604685,0.007882692,0.002357596,0.000623715,0.000021914477],"about_ca_topic_score_codex":0.0035435809,"about_ca_topic_score_gemma":0.004210273,"teacher_disagreement_score":0.0035435809,"about_ca_system_score_codex":0.0006763197,"about_ca_system_score_gemma":0.0007576531,"threshold_uncertainty_score":0.007970989},"labels":[],"label_agreement":null},{"id":"W4392800278","doi":"10.1007/978-3-031-56066-8","title":"Advances in Information Retrieval","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitat Politècnica de València; National Institute of Standards and Technology; Haute école Spécialisée de Suisse Occidentale; Institut National des Sciences Appliquées de Lyon; University of North Carolina at Chapel Hill; Universität Duisburg-Essen; Universidade Federal de Minas Gerais; University of Cape Town; Instituto Superior Técnico; Tsinghua University; Chinese Academy of Sciences; Université de Bretagne Occidentale; University of Massachusetts Amherst; Università degli Studi di Torino; Università di Bologna; Renmin University of China; Universidade de Lisboa; Aix-Marseille Université; Universidade Nova de Lisboa; Universität Regensburg; University of Waterloo; Radboud Universiteit; Universität Innsbruck; Technische Universiteit Delft; Universiteit van Amsterdam; Technische Universität Wien; University of Queensland; York University; University of Glasgow; Universiteit Leiden; Eberhard Karls Universität Tübingen; Università degli Studi di Padova; University of Melbourne; Universitetet i Stavanger; Université Grenoble Alpes; Dublin City University; Qatar University; Università Ca' Foscari Venezia; Philipps-Universität Marburg; University of Chinese Academy of Sciences; Centre National de la Recherche Scientifique; Univerzita Karlova v Praze; Università degli Studi di Cagliari; Sorbonne Université; Indian National Science Academy; Universidad Nacional de Educación a Distancia; Universidade da Coruña; RMIT University; Carnegie Mellon University; University of Southern Maine","keywords":"Computer science; Information retrieval","score_opus":0.010432945801344552,"score_gpt":0.2657554651842439,"score_spread":0.25532251938289935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392800278","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015660082,0.65013725,0.046363726,0.006695068,0.011142356,0.0000927876,0.00063834473,0.0017505473,0.28161392],"genre_scores_gemma":[0.017668437,0.37005538,0.039723594,0.0029356799,0.012148605,0.00013571519,0.0014735083,0.0007790704,0.55508006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00017597894,0.000076764205,0.00016839145,0.00070256914,0.00008153307],"domain_scores_gemma":[0.99843925,0.00061792444,0.000077024735,0.0003302388,0.00041240777,0.0001231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016063933,0.0017337269,0.0024586702,0.005700051,0.00086083834,0.0045785997,0.0015718641,0.0015720362,0.060626484],"category_scores_gemma":[0.0035578217,0.00077340624,0.00072595844,0.009571334,0.0014658518,0.007842832,0.0020870625,0.0026566782,0.0668954],"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.00003095825,0.000060293853,0.0001051695,0.0011652048,0.000038722843,0.00003100375,0.000091728274,0.00043375653,0.001201974,0.0593276,0.35012984,0.5873836],"study_design_scores_gemma":[0.000009666759,0.0000441639,0.00035141676,0.00036593716,0.000034128647,0.00020796226,0.00004924077,0.00142965,0.0006833418,0.042706832,0.95410144,0.00001614043],"about_ca_topic_score_codex":0.0010669449,"about_ca_topic_score_gemma":0.0018124277,"teacher_disagreement_score":0.060626484,"about_ca_system_score_codex":0.0013658024,"about_ca_system_score_gemma":0.0013583732,"threshold_uncertainty_score":0.20281577},"labels":[],"label_agreement":null},{"id":"W4392800531","doi":"10.1007/978-3-031-56066-8_5","title":"Learning to Jointly Transform and Rank Difficult Queries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning 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":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Rank (graph theory); Learning to rank; Artificial intelligence; Information retrieval; Ranking (information retrieval); Mathematics; Combinatorics","score_opus":0.007478165551158179,"score_gpt":0.23302899334275923,"score_spread":0.22555082779160104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392800531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04050781,0.0009647905,0.9460885,0.0017495217,0.00027154668,0.00019256608,0.0009382823,0.005574075,0.0037130478],"genre_scores_gemma":[0.33563995,0.00091150944,0.64033246,0.00088340626,0.0012943924,0.00035188466,0.0056718723,0.000659281,0.014255211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588424,0.0011383927,0.0002832965,0.0007175766,0.0014632231,0.0005133405],"domain_scores_gemma":[0.98900837,0.006877538,0.0006351072,0.001960231,0.0010703803,0.00044831957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038492025,0.0020923344,0.0028476678,0.002522192,0.0006888719,0.0031405736,0.0027280333,0.003234461,0.007802514],"category_scores_gemma":[0.02046439,0.00078770495,0.0014277732,0.0032385252,0.0017096172,0.0057924236,0.0041089184,0.0038538969,0.0049721175],"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.0011047794,0.00050232955,0.0034862629,0.0002740651,0.00020951666,0.00019731511,0.00019546169,0.09732171,0.009703931,0.025548315,0.03844106,0.8230153],"study_design_scores_gemma":[0.00009268749,0.00024334998,0.0003600574,0.00002008051,0.000053837437,0.0002558996,0.0001198434,0.93668354,0.005108782,0.05298961,0.0040457193,0.000026612783],"about_ca_topic_score_codex":0.00299003,"about_ca_topic_score_gemma":0.00527918,"teacher_disagreement_score":0.007802514,"about_ca_system_score_codex":0.0010480578,"about_ca_system_score_gemma":0.0025398678,"threshold_uncertainty_score":0.026102006},"labels":[],"label_agreement":null},{"id":"W4392812054","doi":"10.1007/978-3-031-55326-4_7","title":"Effects of Feature Types on Donor Journey","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision 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":"Acadia University","funders":"","keywords":"Computer science; Feature (linguistics); Linguistics","score_opus":0.0413857005508389,"score_gpt":0.33234577036396007,"score_spread":0.29096006981312117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392812054","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.96345454,0.0003393763,0.0004904846,0.00069115247,0.000057653182,0.000043283104,0.00041317617,0.000043314038,0.034466915],"genre_scores_gemma":[0.99022245,0.000095772186,0.00017760065,0.00005827804,0.000009753292,0.000018786466,0.00011597303,0.000023832014,0.009277555],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9965919,0.00194646,0.00011868184,0.00024755244,0.00029348952,0.00080200104],"domain_scores_gemma":[0.9336639,0.04928184,0.0045224833,0.0018085835,0.0021563629,0.008566815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051822616,0.00024903205,0.0005042172,0.00065302313,0.0013538852,0.004166931,0.001058578,0.001036606,0.053923402],"category_scores_gemma":[0.036030903,0.00017049715,0.00061816786,0.00095830095,0.0009522307,0.0035079012,0.0033180884,0.0017094493,0.0025384838],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.045819513,0.010495382,0.6303055,0.00077985425,0.0006245608,0.0018616297,0.009098424,0.008707556,0.009865128,0.059281938,0.013355979,0.20980443],"study_design_scores_gemma":[0.0008930039,0.006124178,0.8812575,0.0004661762,0.0010318527,0.00073388853,0.045202073,0.0055652764,0.005148787,0.032865748,0.020570347,0.00014131839],"about_ca_topic_score_codex":0.004187283,"about_ca_topic_score_gemma":0.006753992,"teacher_disagreement_score":0.053923402,"about_ca_system_score_codex":0.0020342835,"about_ca_system_score_gemma":0.0018720449,"threshold_uncertainty_score":0.18039173},"labels":[],"label_agreement":null},{"id":"W4392827844","doi":"10.1007/978-3-031-56066-8_9","title":"Towards Automated End-to-End Health Misinformation Free Search with a Large Language Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Misinformation; Computer science; Artificial intelligence; Computer security","score_opus":0.020958864599865398,"score_gpt":0.28650093249714126,"score_spread":0.26554206789727586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392827844","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.013642707,0.0005395857,0.95827377,0.001075467,0.000083887,0.00021203047,0.002830159,0.02081716,0.0025251901],"genre_scores_gemma":[0.31950057,0.000398263,0.66004115,0.00081226666,0.00021698703,0.00031033013,0.008159254,0.001410424,0.009150751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712974,0.0011476639,0.00021007854,0.00060021627,0.0006624573,0.00024988517],"domain_scores_gemma":[0.9896199,0.0073371157,0.00027762965,0.0015685993,0.0008762768,0.00032049525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030347838,0.0013238966,0.002672115,0.0023506093,0.0011343078,0.0036139044,0.002649514,0.0028490615,0.008106446],"category_scores_gemma":[0.012420462,0.0008812156,0.0019356912,0.0019139715,0.0008710739,0.0059258873,0.0048465338,0.002498366,0.0061510033],"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.0026034983,0.0012355628,0.0043962263,0.00090432743,0.00058512826,0.00091429264,0.0007814864,0.16779138,0.022257544,0.034495752,0.074906245,0.6891286],"study_design_scores_gemma":[0.000046535995,0.00005151743,0.00017651108,0.000013482618,0.00004225569,0.00010005351,0.000081249585,0.96852934,0.0029287087,0.026005328,0.002004642,0.000020390515],"about_ca_topic_score_codex":0.0066625793,"about_ca_topic_score_gemma":0.012131747,"teacher_disagreement_score":0.008106446,"about_ca_system_score_codex":0.0011782718,"about_ca_system_score_gemma":0.002827868,"threshold_uncertainty_score":0.027118742},"labels":[],"label_agreement":null},{"id":"W4392846357","doi":"10.1007/978-3-031-56060-6_26","title":"Adapting Standard Retrieval Benchmarks to Evaluate Generated Answers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Artificial intelligence","score_opus":0.026618923285977928,"score_gpt":0.2743444726809662,"score_spread":0.24772554939498825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392846357","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.39845017,0.009690199,0.38400134,0.0013323713,0.0022641812,0.0027197758,0.019343736,0.13753748,0.04466077],"genre_scores_gemma":[0.5506876,0.0014417217,0.35230342,0.00068563817,0.00047286364,0.0012299211,0.06919033,0.0058931815,0.018095288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907488,0.0027707496,0.0010891694,0.0012390082,0.0037190442,0.00043322518],"domain_scores_gemma":[0.9716196,0.014349187,0.0008237833,0.0041526235,0.008336349,0.0007184905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007389854,0.0020624413,0.0016570458,0.0065827584,0.00073254283,0.0036956102,0.0042531085,0.0025167896,0.007951305],"category_scores_gemma":[0.044285823,0.0005740457,0.00089836767,0.004596435,0.00051880715,0.003910356,0.002480269,0.00145234,0.0076988484],"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.0026223876,0.0016655626,0.0073630055,0.0020779415,0.00045350782,0.00031948832,0.00038554377,0.04328428,0.03042448,0.0045526414,0.08880453,0.8180467],"study_design_scores_gemma":[0.0006173987,0.0016594493,0.0058002286,0.00023462836,0.00032289381,0.00043752405,0.0004651037,0.8896874,0.061570466,0.009607523,0.02946205,0.0001354057],"about_ca_topic_score_codex":0.0057744454,"about_ca_topic_score_gemma":0.006376032,"teacher_disagreement_score":0.007951305,"about_ca_system_score_codex":0.0016796077,"about_ca_system_score_gemma":0.0012166145,"threshold_uncertainty_score":0.039081752},"labels":[],"label_agreement":null},{"id":"W4392869771","doi":"10.1007/978-3-031-56060-6_18","title":"LaQuE: Enabling Entity Search at Scale","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Scale (ratio); Information retrieval; Data science; Cartography","score_opus":0.11652703004926346,"score_gpt":0.38104999362034464,"score_spread":0.2645229635710812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392869771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009716553,0.005384049,0.785458,0.00437776,0.001565084,0.0004766381,0.0092936335,0.08785965,0.0958686],"genre_scores_gemma":[0.15172449,0.006256936,0.6811534,0.0031611144,0.00088902237,0.0007169943,0.03133543,0.012936319,0.11182627],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790573,0.0005483063,0.00014557762,0.00028700443,0.0009167804,0.00019655745],"domain_scores_gemma":[0.99578816,0.0015545742,0.00011726963,0.0017654586,0.00055175053,0.00022281727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031558897,0.0009992127,0.0011477892,0.002598742,0.0012754824,0.0067337826,0.0032122948,0.0018230174,0.029888967],"category_scores_gemma":[0.013420689,0.0009300046,0.0012405248,0.004005894,0.0012731756,0.016092248,0.007937326,0.0032762073,0.018456895],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039197865,0.00014374696,0.001286752,0.00071878487,0.00010871543,0.0002814528,0.00070454227,0.0066511203,0.0049972134,0.26464677,0.37820548,0.3418635],"study_design_scores_gemma":[0.000109849636,0.00006285752,0.0006741535,0.0002608395,0.00008667467,0.00038589895,0.00037154404,0.10430416,0.008598569,0.2628073,0.622246,0.00009214792],"about_ca_topic_score_codex":0.008584033,"about_ca_topic_score_gemma":0.009027512,"teacher_disagreement_score":0.029888967,"about_ca_system_score_codex":0.0012357961,"about_ca_system_score_gemma":0.0016904017,"threshold_uncertainty_score":0.09998852},"labels":[],"label_agreement":null},{"id":"W4392873242","doi":"10.1007/978-981-97-0989-2","title":"Service-Oriented Computing – ICSOC 2023 Workshops","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Service (business); Software engineering","score_opus":0.011273883667891098,"score_gpt":0.25229873493665966,"score_spread":0.24102485126876858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392873242","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031819765,0.01682701,0.26106903,0.00844521,0.036608674,0.00069537037,0.003192669,0.0095340945,0.6318081],"genre_scores_gemma":[0.049703166,0.00761804,0.05757827,0.0011133912,0.0028331971,0.00026638873,0.0073082116,0.0018122579,0.8717671],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919707,0.00013857135,0.000028138656,0.00010685217,0.00036550322,0.00016387038],"domain_scores_gemma":[0.9989214,0.00010944229,0.000023260312,0.0001444407,0.0004417698,0.00035974797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017223271,0.0013561357,0.00063994114,0.0010107231,0.00071525766,0.0026200225,0.0012460408,0.0010926662,0.055868097],"category_scores_gemma":[0.0009517954,0.00042042352,0.00082341913,0.0014452436,0.00030158146,0.0013788063,0.0013642989,0.0014198648,0.039930176],"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.0003861299,0.0003164787,0.00023297862,0.00023739751,0.00002911304,0.00012882054,0.00012771132,0.0031414917,0.011496023,0.012319728,0.6155396,0.35604462],"study_design_scores_gemma":[0.0000453109,0.00021860337,0.0009583443,0.0001468989,0.000025196716,0.00022900414,0.000120866396,0.01402573,0.008296508,0.009332406,0.96657825,0.000022837874],"about_ca_topic_score_codex":0.0034408842,"about_ca_topic_score_gemma":0.006117441,"teacher_disagreement_score":0.055868097,"about_ca_system_score_codex":0.0008624952,"about_ca_system_score_gemma":0.0020674092,"threshold_uncertainty_score":0.1868974},"labels":[],"label_agreement":null},{"id":"W4392887246","doi":"10.1007/978-3-031-56060-6","title":"Advances in Information Retrieval","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of North Carolina at Chapel Hill; National Institute of Standards and Technology; University of Chinese Academy of Sciences; Institut National des Sciences Appliquées de Lyon; Universität Duisburg-Essen; University of Massachusetts Amherst; Università degli Studi di Torino; Università di Bologna; Aix-Marseille Université; Universidade Nova de Lisboa; Universität Regensburg; Universitetet i Bergen; Universidade de Santiago de Compostela; Università degli Studi di Cagliari; Technische Universität Braunschweig; Universidade Federal de Minas Gerais; Radboud Universiteit; University of Waterloo; Instituto Superior Técnico; Université de Bretagne Occidentale; Tsinghua University; Chinese Academy of Sciences; Universidade de Lisboa; Renmin University of China; Universität Innsbruck; Technische Universiteit Delft; Technische Universität Wien; University of Queensland; University of Melbourne; Universiteit van Amsterdam; Univerzita Karlova v Praze; University College Dublin; Haute école Spécialisée de Suisse Occidentale; University of Southampton; Universidade da Coruña; Universidad Nacional de Educación a Distancia; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Glasgow; Eberhard Karls Universität Tübingen; York University; University of Cyprus; Universitetet i Stavanger; Université Grenoble Alpes; Seoul National University; Universidade do Porto; Dublin City University; Centre National de la Recherche Scientifique; University of Roehampton; Università degli Studi di Padova; Johns Hopkins University; Università Ca' Foscari Venezia; Qatar University; Technische Universität Berlin; Georgetown University; Indian National Science Academy; Carnegie Mellon University; University of Southern Maine","keywords":"Computer science; Information retrieval","score_opus":0.010432945801344552,"score_gpt":0.2657554651842439,"score_spread":0.25532251938289935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392887246","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015660082,0.65013725,0.046363726,0.006695068,0.011142356,0.0000927876,0.00063834473,0.0017505473,0.28161392],"genre_scores_gemma":[0.017668437,0.37005538,0.039723594,0.0029356799,0.012148605,0.00013571519,0.0014735083,0.0007790704,0.55508006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00017597894,0.000076764205,0.00016839145,0.00070256914,0.00008153307],"domain_scores_gemma":[0.99843925,0.00061792444,0.000077024735,0.0003302388,0.00041240777,0.0001231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016063933,0.0017337269,0.0024586702,0.005700051,0.00086083834,0.0045785997,0.0015718641,0.0015720362,0.060626484],"category_scores_gemma":[0.0035578217,0.00077340624,0.00072595844,0.009571334,0.0014658518,0.007842832,0.0020870625,0.0026566782,0.0668954],"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.00003095825,0.000060293853,0.0001051695,0.0011652048,0.000038722843,0.00003100375,0.000091728274,0.00043375653,0.001201974,0.0593276,0.35012984,0.5873836],"study_design_scores_gemma":[0.000009666759,0.0000441639,0.00035141676,0.00036593716,0.000034128647,0.00020796226,0.00004924077,0.00142965,0.0006833418,0.042706832,0.95410144,0.00001614043],"about_ca_topic_score_codex":0.0010669449,"about_ca_topic_score_gemma":0.0018124277,"teacher_disagreement_score":0.060626484,"about_ca_system_score_codex":0.0013658024,"about_ca_system_score_gemma":0.0013583732,"threshold_uncertainty_score":0.20281577},"labels":[],"label_agreement":null},{"id":"W4392964050","doi":"10.1007/978-3-031-56252-5_3","title":"On the Dark Side of the Coin: Characterizing Bitcoin Use for Illicit Activities","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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 Calgary","funders":"","keywords":"Great Rift; Computer science; Side channel attack; Computer security; Internet privacy; Cryptography; Astronomy; Physics","score_opus":0.018727921148236872,"score_gpt":0.2343238264461648,"score_spread":0.21559590529792794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392964050","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.88097703,0.0015961035,0.02653316,0.0013011137,0.000035427587,0.00012829412,0.0011521899,0.00015816503,0.08811849],"genre_scores_gemma":[0.9938806,0.00023724712,0.001869128,0.000059600956,0.000015750116,0.00004034126,0.00030513023,0.000053752934,0.0035383867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.996894,0.0010651818,0.00015282533,0.00036428345,0.0010953003,0.00042830728],"domain_scores_gemma":[0.95915693,0.028356692,0.005148544,0.0031860538,0.002494036,0.0016578054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034552454,0.00033348153,0.00051541155,0.0035932406,0.0016370565,0.005894535,0.00084156706,0.0016494752,0.008753303],"category_scores_gemma":[0.030228715,0.00025409847,0.0002511772,0.0041919006,0.0031748656,0.010868847,0.0029495207,0.001892233,0.0014385332],"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.0018281166,0.00056146376,0.291067,0.00036743752,0.000119112825,0.0006599874,0.010463333,0.011107865,0.0085895285,0.5103713,0.0066744946,0.1581903],"study_design_scores_gemma":[0.00006946123,0.0006548617,0.19427362,0.001033042,0.00015286842,0.0021020656,0.018580293,0.13638532,0.019581856,0.5730567,0.05387295,0.00023689443],"about_ca_topic_score_codex":0.0017869344,"about_ca_topic_score_gemma":0.0024366942,"teacher_disagreement_score":0.008753303,"about_ca_system_score_codex":0.0013959543,"about_ca_system_score_gemma":0.0011152572,"threshold_uncertainty_score":0.02928269},"labels":[],"label_agreement":null},{"id":"W4392964111","doi":"10.1007/978-3-031-56027-9","title":"Advances in Information Retrieval","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":17,"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":"Universitat Politècnica de València; National Institute of Standards and Technology; Haute école Spécialisée de Suisse Occidentale; Institut National des Sciences Appliquées de Lyon; University of North Carolina at Chapel Hill; Universität Duisburg-Essen; Universidade Federal de Minas Gerais; University of Cape Town; Instituto Superior Técnico; Tsinghua University; Chinese Academy of Sciences; Université de Bretagne Occidentale; University of Massachusetts Amherst; Università degli Studi di Torino; Università di Bologna; Renmin University of China; Universidade de Lisboa; Aix-Marseille Université; Universidade Nova de Lisboa; Universität Regensburg; University of Waterloo; Radboud Universiteit; Universität Innsbruck; Technische Universiteit Delft; Universiteit van Amsterdam; Technische Universität Wien; University of Queensland; York University; University of Glasgow; Universiteit Leiden; Eberhard Karls Universität Tübingen; Università degli Studi di Padova; University of Melbourne; Universitetet i Stavanger; Université Grenoble Alpes; Dublin City University; Qatar University; Università Ca' Foscari Venezia; Philipps-Universität Marburg; University of Chinese Academy of Sciences; Centre National de la Recherche Scientifique; Univerzita Karlova v Praze; Università degli Studi di Cagliari; Sorbonne Université; Indian National Science Academy; Universidad Nacional de Educación a Distancia; Universidade da Coruña; RMIT University; Carnegie Mellon University; University of Southern Maine","keywords":"Computer science; Information retrieval","score_opus":0.010432945801344552,"score_gpt":0.2657554651842439,"score_spread":0.25532251938289935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392964111","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015660082,0.65013725,0.046363726,0.006695068,0.011142356,0.0000927876,0.00063834473,0.0017505473,0.28161392],"genre_scores_gemma":[0.017668437,0.37005538,0.039723594,0.0029356799,0.012148605,0.00013571519,0.0014735083,0.0007790704,0.55508006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00017597894,0.000076764205,0.00016839145,0.00070256914,0.00008153307],"domain_scores_gemma":[0.99843925,0.00061792444,0.000077024735,0.0003302388,0.00041240777,0.0001231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016063933,0.0017337269,0.0024586702,0.005700051,0.00086083834,0.0045785997,0.0015718641,0.0015720362,0.060626484],"category_scores_gemma":[0.0035578217,0.00077340624,0.00072595844,0.009571334,0.0014658518,0.007842832,0.0020870625,0.0026566782,0.0668954],"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.00003095825,0.000060293853,0.0001051695,0.0011652048,0.000038722843,0.00003100375,0.000091728274,0.00043375653,0.001201974,0.0593276,0.35012984,0.5873836],"study_design_scores_gemma":[0.000009666759,0.0000441639,0.00035141676,0.00036593716,0.000034128647,0.00020796226,0.00004924077,0.00142965,0.0006833418,0.042706832,0.95410144,0.00001614043],"about_ca_topic_score_codex":0.0010669449,"about_ca_topic_score_gemma":0.0018124277,"teacher_disagreement_score":0.060626484,"about_ca_system_score_codex":0.0013658024,"about_ca_system_score_gemma":0.0013583732,"threshold_uncertainty_score":0.20281577},"labels":[],"label_agreement":null},{"id":"W4392964137","doi":"10.1007/978-3-031-56072-9","title":"Advances in Information Retrieval","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":21,"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":"Leibniz-Gemeinschaft; University of North Carolina at Chapel Hill; National Institute of Standards and Technology; Société d'Accélération du Transfert de Technologies; National Institute of Informatics; University of Chinese Academy of Sciences; Université de Lyon; Libera Università di Bolzano; Universität Duisburg-Essen; Instituto Superior Técnico; Chinese Academy of Sciences; Tsinghua University; Université de Bretagne Occidentale; University of Massachusetts Amherst; Università degli Studi di Torino; Universidad Nacional del Centro de la Provincia de Buenos Aires; Università di Bologna; Universitatea Politehnica din București; Renmin University of China; Universidade de Lisboa; Aix-Marseille Université; Universidade Nova de Lisboa; Universität Regensburg; Universidade Federal de Minas Gerais; Radboud Universiteit; University of Waterloo; Universiteit van Amsterdam; Università degli Studi di Milano-Bicocca; Universität Innsbruck; Technische Universiteit Delft; Technische Universität Wien; University of Queensland; Universitetet i Stavanger; Université Grenoble Alpes; Universidade do Porto; Dublin City University; Haute école Spécialisée de Suisse Occidentale; University of Southampton; Universidade da Coruña; Universidad Nacional de Educación a Distancia; Consejo Nacional de Investigaciones Científicas y Técnicas; Eberhard Karls Universität Tübingen; University of Glasgow; York University; Universität Passau; Indian National Science Academy; Centre National de la Recherche Scientifique; Univerzita Karlova v Praze; Università degli Studi di Cagliari; Commonwealth Scientific and Industrial Research Organisation; Qatar University; Aalborg Universitet; Carnegie Mellon University; Kaiser Permanente; Università Ca' Foscari Venezia; Università degli Studi di Padova; Universitatea din București; University of Melbourne; Friedrich-Schiller-Universität Jena; Institut National des Sciences Appliquées de Lyon; Universität Zürich; National Institute of Advanced Industrial Science and Technology","keywords":"Computer science; Information retrieval","score_opus":0.010432945801344552,"score_gpt":0.2657554651842439,"score_spread":0.25532251938289935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392964137","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015660082,0.65013725,0.046363726,0.006695068,0.011142356,0.0000927876,0.00063834473,0.0017505473,0.28161392],"genre_scores_gemma":[0.017668437,0.37005538,0.039723594,0.0029356799,0.012148605,0.00013571519,0.0014735083,0.0007790704,0.55508006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00017597894,0.000076764205,0.00016839145,0.00070256914,0.00008153307],"domain_scores_gemma":[0.99843925,0.00061792444,0.000077024735,0.0003302388,0.00041240777,0.0001231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016063933,0.0017337269,0.0024586702,0.005700051,0.00086083834,0.0045785997,0.0015718641,0.0015720362,0.060626484],"category_scores_gemma":[0.0035578217,0.00077340624,0.00072595844,0.009571334,0.0014658518,0.007842832,0.0020870625,0.0026566782,0.0668954],"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.00003095825,0.000060293853,0.0001051695,0.0011652048,0.000038722843,0.00003100375,0.000091728274,0.00043375653,0.001201974,0.0593276,0.35012984,0.5873836],"study_design_scores_gemma":[0.000009666759,0.0000441639,0.00035141676,0.00036593716,0.000034128647,0.00020796226,0.00004924077,0.00142965,0.0006833418,0.042706832,0.95410144,0.00001614043],"about_ca_topic_score_codex":0.0010669449,"about_ca_topic_score_gemma":0.0018124277,"teacher_disagreement_score":0.060626484,"about_ca_system_score_codex":0.0013658024,"about_ca_system_score_gemma":0.0013583732,"threshold_uncertainty_score":0.20281577},"labels":[],"label_agreement":null},{"id":"W4392964218","doi":"10.1007/978-3-031-56072-9_5","title":"CLEF 2024 JOKER Lab: Automatic Humour Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Humor Studies and Applications","field":"Psychology","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 Manitoba","funders":"Agence Nationale de la Recherche","keywords":"Clef; Computer science; Sentiment analysis; Task (project management); Natural language processing; Focus (optics); Machine translation; Artificial intelligence; Information retrieval","score_opus":0.021258928592433144,"score_gpt":0.31930823095458366,"score_spread":0.2980493023621505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392964218","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.009969467,0.010398618,0.31035185,0.00425029,0.004907446,0.0010203148,0.08401969,0.21872866,0.3563537],"genre_scores_gemma":[0.045916006,0.0023910247,0.26581565,0.0017830103,0.0022400543,0.0008751156,0.19547218,0.031998172,0.45350882],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998317,0.00035815308,0.000060867435,0.00034201122,0.0007798621,0.00014221157],"domain_scores_gemma":[0.998694,0.00048092304,0.000032600095,0.0002476869,0.00039337686,0.00015148307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015165508,0.0023889167,0.001584956,0.00347955,0.0012815339,0.003243225,0.0020863335,0.0023547492,0.24126746],"category_scores_gemma":[0.0038606669,0.0007509216,0.0010508302,0.002006478,0.0004255433,0.0023904773,0.0016860259,0.0016911398,0.19682123],"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.00007258308,0.000035660625,0.00009703857,0.00016847048,0.000013432297,0.000055663964,0.000026036805,0.00037085268,0.002986541,0.0020863342,0.8042588,0.1898285],"study_design_scores_gemma":[0.00015406356,0.00007233068,0.0022803256,0.00015352615,0.0000265904,0.0005383001,0.00008757623,0.023689305,0.021614388,0.01249855,0.9387875,0.000097555894],"about_ca_topic_score_codex":0.005192225,"about_ca_topic_score_gemma":0.009214475,"teacher_disagreement_score":0.24126746,"about_ca_system_score_codex":0.0011049528,"about_ca_system_score_gemma":0.0010110986,"threshold_uncertainty_score":0.8071201},"labels":[],"label_agreement":null},{"id":"W4392964256","doi":"10.1007/978-3-031-56027-9_20","title":"A Streaming Approach to Neural Team Formation Training","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Windsor","funders":"","keywords":"Computer science; Training (meteorology); Artificial intelligence; Artificial neural network; Multimedia","score_opus":0.03235137083435407,"score_gpt":0.2533138865639717,"score_spread":0.22096251572961761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392964256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034949153,0.0002784097,0.99248946,0.00009891188,0.00006909147,0.000025745703,0.00005841798,0.00034288003,0.0031421229],"genre_scores_gemma":[0.2919327,0.0009440021,0.6868552,0.00026880324,0.00046757035,0.0003716915,0.0005731909,0.00041986207,0.018167004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997466,0.00007326938,0.000015664755,0.000058554655,0.00007873245,0.000027105456],"domain_scores_gemma":[0.9989243,0.00065093697,0.000044341406,0.00016566669,0.00014512957,0.00006959569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007511095,0.00066741527,0.00092721666,0.00038178838,0.00042397084,0.0006218585,0.0025714575,0.0011209532,0.01087198],"category_scores_gemma":[0.0025056314,0.0005281996,0.0004917437,0.0008504862,0.0006059475,0.0015915653,0.0017583115,0.001953612,0.0012895807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001189607,0.00010477359,0.00022810619,0.00011746,0.000041335097,0.00005815734,0.00007738285,0.69886065,0.0026446113,0.06318925,0.009099218,0.22546016],"study_design_scores_gemma":[0.0000056045255,0.000014364576,0.00002222653,0.000003761481,0.0000024777887,0.00000880855,0.0000033707663,0.97850215,0.00017173703,0.020593964,0.0006695615,0.0000019363642],"about_ca_topic_score_codex":0.0026505901,"about_ca_topic_score_gemma":0.0033463482,"teacher_disagreement_score":0.01087198,"about_ca_system_score_codex":0.00062224537,"about_ca_system_score_gemma":0.0005195633,"threshold_uncertainty_score":0.036370397},"labels":[],"label_agreement":null},{"id":"W4392964577","doi":"10.1007/978-3-031-56252-5_14","title":"Trust Issue(r)s: Certificate Revocation and Replacement Practices in the Wild","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Revocation; Revocation list; Certificate; Computer security; Root certificate; Certificate authority; Programming language; Theoretical computer science; Public-key cryptography; Overhead (engineering)","score_opus":0.0776890535773832,"score_gpt":0.31715026513839933,"score_spread":0.23946121156101613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392964577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047570825,0.0031001524,0.8295189,0.006409187,0.00091772643,0.00032149183,0.00044008443,0.009528923,0.10219265],"genre_scores_gemma":[0.77377725,0.0020842303,0.17115818,0.0008800069,0.0003275855,0.00013310638,0.0004953602,0.0020330094,0.049111243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98907334,0.0040702615,0.0008327298,0.0016260735,0.0033472874,0.0010503186],"domain_scores_gemma":[0.96175015,0.0121161,0.0017849182,0.021703547,0.0017107702,0.00093454064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00988488,0.0006184743,0.0007789614,0.0015295488,0.001953706,0.0068457355,0.003306086,0.0034942217,0.012122636],"category_scores_gemma":[0.03577626,0.00095209107,0.0010160161,0.002329946,0.004889295,0.021422027,0.0054086824,0.0044700983,0.004618023],"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.00049331906,0.0002000767,0.00217581,0.0002696741,0.000035916823,0.00087215734,0.002302143,0.010762293,0.0062661446,0.61391073,0.037996948,0.32471475],"study_design_scores_gemma":[0.00015401599,0.0003975219,0.0012919075,0.00042569367,0.00010443459,0.0049381587,0.0017739191,0.16804777,0.026035972,0.45462793,0.34201625,0.00018643153],"about_ca_topic_score_codex":0.002159103,"about_ca_topic_score_gemma":0.0016872399,"teacher_disagreement_score":0.012122636,"about_ca_system_score_codex":0.0021331324,"about_ca_system_score_gemma":0.0026133112,"threshold_uncertainty_score":0.05227685},"labels":[],"label_agreement":null},{"id":"W4392978356","doi":"10.1007/978-3-031-56852-7_23","title":"Simple Efficient Evolutionary Ensemble Learning on Network Intrusion Detection Benchmarks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Dalhousie University","funders":"","keywords":"Computer science; Intrusion detection system; Simple (philosophy); Ensemble learning; Artificial intelligence; Machine learning","score_opus":0.008367048234909741,"score_gpt":0.2203093720352774,"score_spread":0.21194232380036765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392978356","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.5353616,0.0019219647,0.4220821,0.0006663136,0.00052234053,0.00024245266,0.0015535522,0.009201759,0.028447881],"genre_scores_gemma":[0.723886,0.00028753086,0.2617234,0.00014913768,0.00010046412,0.00022711369,0.003364049,0.00056178914,0.009700535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938107,0.00017434116,0.00004190821,0.00011781459,0.00020682489,0.00007796067],"domain_scores_gemma":[0.9979905,0.0010533145,0.0000542571,0.00038016817,0.000468192,0.000053683932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011930146,0.00080842245,0.00081445044,0.00075079105,0.00042338236,0.0006568281,0.0015009021,0.0008149477,0.0038315135],"category_scores_gemma":[0.004520024,0.00025863864,0.00050179067,0.000990936,0.00021316664,0.0010483544,0.00083911885,0.0009407099,0.0007017449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043953044,0.00036089684,0.0027697785,0.00015959355,0.00013442329,0.00012262068,0.000035365916,0.5366853,0.0064822435,0.0051224194,0.013463279,0.4342246],"study_design_scores_gemma":[0.000017846103,0.00008074685,0.0005819526,0.0000054121324,0.0000145261265,0.000028204138,0.000009532365,0.9937417,0.002252138,0.0022789573,0.0009838258,0.0000052309565],"about_ca_topic_score_codex":0.0027010876,"about_ca_topic_score_gemma":0.0051532215,"teacher_disagreement_score":0.0038315135,"about_ca_system_score_codex":0.0005206329,"about_ca_system_score_gemma":0.0006551613,"threshold_uncertainty_score":0.012817681},"labels":[],"label_agreement":null},{"id":"W4392978796","doi":"10.1007/978-3-031-56852-7","title":"Applications of Evolutionary Computation","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Information and Communications Technology; Universitat Politècnica de València; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; College of Engineering, Michigan State University; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Région Normandie; Technische Universität Dortmund; Universidade da Coruña; Universitat Oberta de Catalunya; Eötvös Loránd Tudományegyetem; University of South Africa; University of Tsukuba; Universidad de Granada; Syddansk Universitet; ITMO University; Universidade Nova de Lisboa; Universidade de Coimbra; Silesian University of Technology; Universidad Complutense de Madrid; Universität Bielefeld; Michigan State University; Newcastle University; Università degli Studi di Trento; Technische Universität Darmstadt; Hakim Sabzevari University; King's College London; Centre National de la Recherche Scientifique; Johannes Gutenberg-Universität Mainz; Université du Luxembourg; Università degli Studi di Milano; Università degli Studi di Firenze; Universitetet i Oslo; Universität zu Lübeck; Sorbonne Université; Università degli Studi di Salerno; Queensland University of Technology; Universidad Politécnica de Madrid; Universidad de Extremadura; Universidad de Guadalajara; Euskal Herriko Unibertsitatea; University of Twente; Hong Kong Baptist University; York University; Universiteit Leiden; Indian Council of Agricultural Research; Swansea University; Radboud Universiteit; Universidad Rey Juan Carlos; Edinburgh Napier University; Carl von Ossietzky Universität Oldenburg; University of Southampton; Iran Telecommunication Research Center; De Montfort University; Università per Stranieri di Perugia; University of Exeter; Universidad de Cádiz; Universidad de Málaga; University of Cape Town; Institut \"Jožef Stefan\"; Università degli Studi di Perugia; Heriot-Watt University; Pomona College; Ostravská Univerzita v Ostravě; Technische Universität Dresden; Politecnico di Torino; University of Central Florida; Yeditepe Üniversitesi; Tecnológico Nacional de México; České Vysoké Učení Technické v Praze; Università degli Studi di Parma; Universidad de Sevilla; Sveučilište u Zagrebu; Queen Mary University of London; Universität Basel","keywords":"Computer science; Evolutionary computation; Computation; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.009796253796092282,"score_gpt":0.258472270848703,"score_spread":0.24867601705261072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392978796","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00599059,0.10447847,0.44436958,0.0029114978,0.0029622994,0.00007215512,0.00021387318,0.0008799301,0.43812177],"genre_scores_gemma":[0.28010464,0.09409874,0.3662197,0.0012466176,0.0031864597,0.0002339626,0.0006532161,0.000682452,0.25357422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996315,0.00009597311,0.000016041164,0.00006049497,0.00017415534,0.000021794478],"domain_scores_gemma":[0.99952376,0.00028197496,0.000017852171,0.00008491936,0.00006893979,0.000022524557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552582,0.0008104997,0.0009048816,0.0013001999,0.0004906188,0.0019055397,0.00086668105,0.0011449766,0.018441008],"category_scores_gemma":[0.0018033723,0.00039772879,0.0007272526,0.0015381603,0.0011145062,0.0014490921,0.0014485016,0.0014792855,0.004086653],"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.000036847963,0.00003902606,0.00044339066,0.00049143453,0.00007723926,0.0001864186,0.00014410252,0.023987474,0.0028564455,0.5259972,0.033907823,0.4118326],"study_design_scores_gemma":[0.000016434635,0.000037633894,0.00068174204,0.00019575712,0.000026894322,0.0005459673,0.000060632432,0.065636806,0.0016175689,0.6466169,0.28453764,0.000025970865],"about_ca_topic_score_codex":0.0005193272,"about_ca_topic_score_gemma":0.0005725965,"teacher_disagreement_score":0.018441008,"about_ca_system_score_codex":0.0006003873,"about_ca_system_score_gemma":0.00036582377,"threshold_uncertainty_score":0.061691344},"labels":[],"label_agreement":null},{"id":"W4392978797","doi":"10.1007/978-3-031-56852-7_8","title":"Nature-Inspired Portfolio Diversification Using Ant Brood Clustering","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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 Manitoba","funders":"","keywords":"Computer science; Diversification (marketing strategy); ANT; Brood; Cluster analysis; Portfolio; Ant colony; Artificial intelligence; Ant colony optimization algorithms; Ecology; Biology; Financial economics; Computer network","score_opus":0.09732104860517503,"score_gpt":0.37671152075421926,"score_spread":0.2793904721490442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392978797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14150482,0.0012208129,0.8370765,0.00026422107,0.00022594769,0.00009663353,0.00006196772,0.00056355767,0.018985566],"genre_scores_gemma":[0.75448143,0.00030908163,0.2365873,0.00010961777,0.00006624427,0.000085271386,0.000105708736,0.00012886515,0.008126452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998242,0.000041549567,0.0000070812216,0.000041925152,0.000060151076,0.000025116797],"domain_scores_gemma":[0.99963355,0.00014713386,0.000041952833,0.000051824994,0.000089408684,0.000036107704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004231883,0.0004284387,0.00078644796,0.0007885138,0.00051736616,0.00071583356,0.0010450687,0.0008552554,0.0018072934],"category_scores_gemma":[0.0011125363,0.00033079705,0.00063486357,0.00073410716,0.000365848,0.0006265362,0.00079763087,0.00060873205,0.00036131954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012010934,0.000100566365,0.0014902282,0.00006894899,0.00012648155,0.00009494131,0.0000959589,0.7884714,0.011754334,0.017520832,0.002897487,0.17725874],"study_design_scores_gemma":[0.0000090032145,0.000026051643,0.00021292856,0.0000040037,0.000008034766,0.000031472264,0.0000072096227,0.99525034,0.0005520192,0.0032712342,0.00062291237,0.0000047916096],"about_ca_topic_score_codex":0.0015281847,"about_ca_topic_score_gemma":0.0017217424,"teacher_disagreement_score":0.0018072934,"about_ca_system_score_codex":0.00044499585,"about_ca_system_score_gemma":0.00033768217,"threshold_uncertainty_score":0.0060460567},"labels":[],"label_agreement":null},{"id":"W4393073548","doi":"10.1007/978-3-031-56063-7_13","title":"Interactive Topic Tagging in Community Question Answering Platforms","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Question answering; Information retrieval; World Wide Web; Natural language processing; Artificial intelligence","score_opus":0.02227528228155629,"score_gpt":0.27430850949419955,"score_spread":0.25203322721264326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393073548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038870245,0.003811599,0.8627839,0.0029143859,0.0010390325,0.0005269946,0.0054371804,0.031916313,0.052700378],"genre_scores_gemma":[0.25876185,0.0019958902,0.6305527,0.0008692767,0.0011386499,0.0009275132,0.020628903,0.006092845,0.07903235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842393,0.0007322378,0.00006547548,0.00028021415,0.00036579452,0.000132409],"domain_scores_gemma":[0.995379,0.0034261309,0.000089497706,0.0005403166,0.00031450842,0.00025054434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027041247,0.00082393317,0.000679737,0.0021848546,0.0014070998,0.0031396912,0.0016491705,0.0016332935,0.021713702],"category_scores_gemma":[0.0072501847,0.0006070377,0.00077851355,0.002706393,0.00043900037,0.009115385,0.0039265086,0.0018099146,0.011365475],"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.00052486773,0.0004753421,0.0020710377,0.0010197419,0.00012470983,0.0004063351,0.0051327646,0.0069791856,0.026849445,0.07013828,0.22552642,0.6607518],"study_design_scores_gemma":[0.000097362376,0.00019494085,0.0027642206,0.0003337576,0.00012446237,0.0005661034,0.002346345,0.23866661,0.024554793,0.1557299,0.5744716,0.00014986162],"about_ca_topic_score_codex":0.0019104524,"about_ca_topic_score_gemma":0.0035956078,"teacher_disagreement_score":0.021713702,"about_ca_system_score_codex":0.00074119464,"about_ca_system_score_gemma":0.00063246384,"threshold_uncertainty_score":0.072639585},"labels":[],"label_agreement":null},{"id":"W4393074478","doi":"10.1007/978-3-031-56069-9_51","title":"Query Performance Prediction: From Fundamentals to Advanced Techniques","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Data mining","score_opus":0.01214727380455557,"score_gpt":0.24604263346519262,"score_spread":0.23389535966063704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393074478","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017779095,0.033964403,0.9311739,0.0022993523,0.00034736918,0.00008130188,0.0008950225,0.003529443,0.009930024],"genre_scores_gemma":[0.540013,0.04031794,0.39688504,0.0007410107,0.004050068,0.00025351628,0.0026504924,0.0006579193,0.014430975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979207,0.00033167118,0.00010693328,0.00042747418,0.0010770257,0.00013620952],"domain_scores_gemma":[0.9949856,0.003275052,0.00035600347,0.0006036656,0.0006699503,0.00010988012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023480186,0.0016627715,0.0019535301,0.0019344451,0.00032039845,0.0026570738,0.0022742439,0.00095580565,0.0028404912],"category_scores_gemma":[0.008214742,0.0006895485,0.0006119979,0.0038147965,0.000653363,0.003089645,0.0010670446,0.0023852661,0.0022547687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011968428,0.00019436312,0.009024246,0.0003956703,0.00008771149,0.000051284616,0.00010268506,0.064008795,0.003680251,0.024703408,0.029686589,0.8679453],"study_design_scores_gemma":[0.00001656958,0.00011494396,0.0065903426,0.0001891379,0.00006019851,0.00021529377,0.000060702427,0.914969,0.0041447743,0.059207473,0.014377819,0.000053733896],"about_ca_topic_score_codex":0.0024288325,"about_ca_topic_score_gemma":0.0018847298,"teacher_disagreement_score":0.0028404912,"about_ca_system_score_codex":0.0008124007,"about_ca_system_score_gemma":0.0006100188,"threshold_uncertainty_score":0.012417674},"labels":[],"label_agreement":null},{"id":"W4393074695","doi":"10.1007/978-3-031-56069-9_57","title":"The Search Futures Workshop","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"Microsoft (Canada); University of Waterloo","funders":"","keywords":"Futures contract; Computer science; Financial economics","score_opus":0.025612161163337366,"score_gpt":0.3069360487792825,"score_spread":0.2813238876159451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393074695","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026134066,0.026619079,0.0052340035,0.07386799,0.02397911,0.00010463376,0.0027954872,0.0009773958,0.8638089],"genre_scores_gemma":[0.011650718,0.006705269,0.002139053,0.0031491665,0.0013666896,0.00010287827,0.002181493,0.000499014,0.9722057],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986545,0.00027572858,0.000034703335,0.00016086528,0.00061057956,0.0002635081],"domain_scores_gemma":[0.99864095,0.00028518165,0.000035096364,0.00014437344,0.0002870086,0.0006072937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003193905,0.000942497,0.00072230375,0.0015223911,0.0025635238,0.009061346,0.0015901013,0.0037411633,0.21165842],"category_scores_gemma":[0.003523879,0.00042267807,0.00078393164,0.0016428401,0.0011237202,0.006209029,0.0046702623,0.003661304,0.075428486],"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.000055587065,0.000029557228,0.00007651244,0.00006360502,0.000003580176,0.000041048672,0.00015252709,0.00010825244,0.00015175073,0.027642176,0.9256004,0.046075046],"study_design_scores_gemma":[0.000005458719,0.0000052336227,0.000058985213,0.0000587217,0.0000013005546,0.00001482934,0.00015685454,0.000067340174,0.00006843351,0.00437368,0.99518543,0.000003819955],"about_ca_topic_score_codex":0.010758096,"about_ca_topic_score_gemma":0.022419069,"teacher_disagreement_score":0.21165842,"about_ca_system_score_codex":0.0028836727,"about_ca_system_score_gemma":0.005334684,"threshold_uncertainty_score":0.70806795},"labels":[],"label_agreement":null},{"id":"W4393074830","doi":"10.1007/978-3-031-56069-9","title":"Advances in Information Retrieval","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Informatics; Université de Lyon; Ural Federal University; Libera Università di Bolzano; Universität Duisburg-Essen; Masarykova Univerzita; Indian Institute of Technology Delhi; Technische Universität Berlin; Universität Zürich; Universidad Nacional del Centro de la Provincia de Buenos Aires; Università di Bologna; Universität Regensburg; Universitetet i Bergen; Radboud Universiteit; University of Waterloo; Qatar University; Tsinghua University; Universitatea Politehnica din București; Renmin University of China; Technische Universiteit Delft; University of Chittagong; Università degli Studi di Milano-Bicocca; Universiteit van Amsterdam; University of Windsor; Technische Universität Wien; Leibniz-Gemeinschaft; Sapienza Università di Roma; University of Queensland; École Polytechnique Fédérale de Lausanne; Universität Passau; University College London; University College Dublin; University of Southampton; Universidade do Porto; Dublin City University; Seoul National University; Eberhard Karls Universität Tübingen; Universiteit Leiden; University of Glasgow; University of Roehampton; Centre National de la Recherche Scientifique; Universidade de Santiago de Compostela; Technische Universität Braunschweig; Università degli Studi di Cagliari; Friedrich-Schiller-Universität Jena; University of Cyprus; Commonwealth Scientific and Industrial Research Organisation; Universidad Autónoma de Madrid; Georgetown University; Universidade da Coruña; Universidade da Beira Interior; Tel Aviv University; National Institute of Advanced Industrial Science and Technology; Consejo Nacional de Investigaciones Científicas y Técnicas; Région Normandie; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Drexel University; Aalborg Universitet; Kaiser Permanente; Carnegie Mellon University; Universitetet i Stavanger; Universitatea din București; Università degli Studi di Padova; University of California, San Diego; Johns Hopkins University; Société d'Accélération du Transfert de Technologies; Brown University","keywords":"Computer science; Information retrieval","score_opus":0.010432945801344552,"score_gpt":0.2657554651842439,"score_spread":0.25532251938289935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393074830","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015660082,0.65013725,0.046363726,0.006695068,0.011142356,0.0000927876,0.00063834473,0.0017505473,0.28161392],"genre_scores_gemma":[0.017668437,0.37005538,0.039723594,0.0029356799,0.012148605,0.00013571519,0.0014735083,0.0007790704,0.55508006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00017597894,0.000076764205,0.00016839145,0.00070256914,0.00008153307],"domain_scores_gemma":[0.99843925,0.00061792444,0.000077024735,0.0003302388,0.00041240777,0.0001231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016063933,0.0017337269,0.0024586702,0.005700051,0.00086083834,0.0045785997,0.0015718641,0.0015720362,0.060626484],"category_scores_gemma":[0.0035578217,0.00077340624,0.00072595844,0.009571334,0.0014658518,0.007842832,0.0020870625,0.0026566782,0.0668954],"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.00003095825,0.000060293853,0.0001051695,0.0011652048,0.000038722843,0.00003100375,0.000091728274,0.00043375653,0.001201974,0.0593276,0.35012984,0.5873836],"study_design_scores_gemma":[0.000009666759,0.0000441639,0.00035141676,0.00036593716,0.000034128647,0.00020796226,0.00004924077,0.00142965,0.0006833418,0.042706832,0.95410144,0.00001614043],"about_ca_topic_score_codex":0.0010669449,"about_ca_topic_score_gemma":0.0018124277,"teacher_disagreement_score":0.060626484,"about_ca_system_score_codex":0.0013658024,"about_ca_system_score_gemma":0.0013583732,"threshold_uncertainty_score":0.20281577},"labels":[],"label_agreement":null},{"id":"W4393089651","doi":"10.1007/978-3-031-56063-7_27","title":"BertPE: A BERT-Based Pre-retrieval Estimator for Query Performance Prediction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Estimator; Information retrieval; Data mining; Artificial intelligence; Statistics; Mathematics","score_opus":0.013603147393727807,"score_gpt":0.24540206133341977,"score_spread":0.23179891393969196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393089651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061698165,0.00068257673,0.98565394,0.00009618684,0.00009943141,0.000070483366,0.00049249845,0.0057952767,0.0009396204],"genre_scores_gemma":[0.35080323,0.0009079114,0.62736416,0.0003861701,0.0006020647,0.0004261011,0.0045369775,0.0011858473,0.013787512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998483,0.00034954926,0.00005937813,0.000256308,0.00069857365,0.00015319277],"domain_scores_gemma":[0.9972166,0.0014459194,0.000185776,0.0004434421,0.0006008138,0.00010745012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025092056,0.0013110165,0.001816586,0.001724657,0.00045646142,0.0010828504,0.00238361,0.0016001071,0.0047584595],"category_scores_gemma":[0.009416263,0.0006103491,0.00059502834,0.0016306163,0.0005054079,0.0020904616,0.0011784812,0.0015845613,0.0044726436],"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.0013418221,0.00045787144,0.0044280575,0.00028091125,0.00024028757,0.00011951201,0.00006172119,0.22904298,0.030794332,0.010132305,0.027435778,0.6956644],"study_design_scores_gemma":[0.000023749859,0.000066576504,0.0009916428,0.000010028769,0.000017219008,0.000062663974,0.00000539074,0.9888391,0.004887134,0.0026419305,0.0024258092,0.000028717004],"about_ca_topic_score_codex":0.0059888195,"about_ca_topic_score_gemma":0.0068264143,"teacher_disagreement_score":0.0059888195,"about_ca_system_score_codex":0.00085149263,"about_ca_system_score_gemma":0.0011104468,"threshold_uncertainty_score":0.015918612},"labels":[],"label_agreement":null},{"id":"W4393090052","doi":"10.1007/978-3-031-56069-9_50","title":"Affective Computing for Social Good Applications: Current Advances, Gaps and Opportunities in Conversational Setting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Current (fluid); Social computing; Human–computer interaction; Data science; World Wide Web; Social media; Electrical engineering; Engineering","score_opus":0.04939319479269185,"score_gpt":0.34140621912328667,"score_spread":0.29201302433059484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393090052","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03489999,0.46688217,0.24386828,0.013266075,0.004936415,0.00020336639,0.00032629762,0.0018338565,0.2337837],"genre_scores_gemma":[0.49558243,0.23901862,0.15423192,0.003924831,0.0072577912,0.00029097966,0.0006379554,0.00070223835,0.0983532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994417,0.00024718634,0.000024891378,0.00007195206,0.00015460694,0.000059636815],"domain_scores_gemma":[0.9988236,0.0008867201,0.000030630916,0.000053271895,0.00012069086,0.00008509157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013234251,0.0005154673,0.0005072129,0.00047817302,0.0003644358,0.004689421,0.0007737719,0.00076930324,0.011292215],"category_scores_gemma":[0.0018454549,0.00021308962,0.00030149752,0.0011488233,0.0006826362,0.0029850802,0.0013768682,0.0012878102,0.0030653907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014588455,0.00012988724,0.0006543519,0.0013976224,0.00003763654,0.00006508967,0.0010588771,0.00070015906,0.007910567,0.052064266,0.03362311,0.90221256],"study_design_scores_gemma":[0.000023793224,0.00028074507,0.006274799,0.001691144,0.00012177721,0.00079273764,0.0032031422,0.022278091,0.0073088636,0.14753458,0.81037545,0.00011481039],"about_ca_topic_score_codex":0.0003178159,"about_ca_topic_score_gemma":0.0005803884,"teacher_disagreement_score":0.011292215,"about_ca_system_score_codex":0.00038005118,"about_ca_system_score_gemma":0.00029522608,"threshold_uncertainty_score":0.03777623},"labels":[],"label_agreement":null},{"id":"W4393090168","doi":"10.1007/978-3-031-56069-9_15","title":"KnowFIRES: A Knowledge-Graph Framework for Interpreting Retrieved Entities from Search","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph; Knowledge graph; Information retrieval; Theoretical computer science","score_opus":0.019236535897772425,"score_gpt":0.30452563723685183,"score_spread":0.2852891013390794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393090168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014501009,0.00039308646,0.96841675,0.00037949425,0.00006096437,0.00015967342,0.0054329336,0.018578744,0.005128259],"genre_scores_gemma":[0.042241532,0.0009677422,0.9307394,0.00037804455,0.000061652776,0.00022137766,0.013767909,0.0033427428,0.00827961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884135,0.00025269415,0.000120141776,0.00031367005,0.00039899937,0.00007322524],"domain_scores_gemma":[0.9980969,0.00093592494,0.00011656542,0.00051607896,0.00024175706,0.00009277979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016753298,0.00139649,0.00114379,0.0056442097,0.0011945833,0.0053996914,0.0043659704,0.0019955775,0.01830457],"category_scores_gemma":[0.006388054,0.0011628906,0.00309505,0.0049557113,0.0016906607,0.010788637,0.0033102902,0.0023686464,0.0050596744],"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.00032197713,0.00018409955,0.0014637515,0.0016185759,0.00032214393,0.0006143345,0.001326693,0.02988415,0.0055762697,0.41332468,0.06815927,0.4772041],"study_design_scores_gemma":[0.000049974027,0.00005307637,0.0005520511,0.00037324338,0.00026028362,0.0003189728,0.00034043365,0.18426287,0.012725446,0.60594434,0.1950196,0.00009967604],"about_ca_topic_score_codex":0.023026912,"about_ca_topic_score_gemma":0.043025587,"teacher_disagreement_score":0.023026912,"about_ca_system_score_codex":0.0015555716,"about_ca_system_score_gemma":0.0020131099,"threshold_uncertainty_score":0.06123483},"labels":[],"label_agreement":null},{"id":"W4393090174","doi":"10.1007/978-3-031-56069-9_20","title":"eval-rationales: An End-to-End Toolkit to Explain and Evaluate Transformers-Based Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de Recherche du Québec - Santé","keywords":"Interpretability; Computer science; Transformer; Artificial intelligence; End-to-end principle; Machine learning; Data science; Software engineering; Engineering","score_opus":0.04916689337903857,"score_gpt":0.30262714349460706,"score_spread":0.2534602501155685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393090174","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.0012726642,0.0001687671,0.88114536,0.00028417198,0.00010733435,0.00026333518,0.0036521354,0.10166965,0.01143659],"genre_scores_gemma":[0.03029707,0.00061160076,0.89867914,0.00033890342,0.000052805022,0.00056850124,0.014926612,0.03850737,0.016017936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752945,0.0008517747,0.0002450698,0.0003033417,0.00091220567,0.00015817855],"domain_scores_gemma":[0.9928758,0.0048657916,0.0002111328,0.0012825413,0.0006101458,0.00015453613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00423993,0.0030829094,0.0011615338,0.002924655,0.0009240527,0.007432473,0.004673728,0.0027737103,0.0767362],"category_scores_gemma":[0.01487173,0.0023703082,0.0036334137,0.0012770371,0.0013489178,0.008004232,0.0058995164,0.0045199343,0.021758473],"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.0005513139,0.0004593396,0.0019344517,0.0024604013,0.00034855347,0.0010441816,0.0015423141,0.037067216,0.006538526,0.3676246,0.18702924,0.39339983],"study_design_scores_gemma":[0.0003091649,0.000098244236,0.00041433156,0.0007370406,0.00013892539,0.0007262715,0.00036612788,0.24893093,0.017479036,0.31115678,0.41947982,0.00016332579],"about_ca_topic_score_codex":0.0022957537,"about_ca_topic_score_gemma":0.0061539016,"teacher_disagreement_score":0.0767362,"about_ca_system_score_codex":0.0014162456,"about_ca_system_score_gemma":0.0020079135,"threshold_uncertainty_score":0.25670815},"labels":[],"label_agreement":null},{"id":"W4393106207","doi":"10.1007/978-3-031-56063-7","title":"Advances in Information Retrieval","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitat Politècnica de València; National Institute of Standards and Technology; Haute école Spécialisée de Suisse Occidentale; Institut National des Sciences Appliquées de Lyon; University of North Carolina at Chapel Hill; Universität Duisburg-Essen; Universidade Federal de Minas Gerais; University of Cape Town; Instituto Superior Técnico; Tsinghua University; Chinese Academy of Sciences; Université de Bretagne Occidentale; University of Massachusetts Amherst; Università degli Studi di Torino; Università di Bologna; Renmin University of China; Universidade de Lisboa; Aix-Marseille Université; Universidade Nova de Lisboa; Universität Regensburg; University of Waterloo; Radboud Universiteit; Universität Innsbruck; Technische Universiteit Delft; Universiteit van Amsterdam; Technische Universität Wien; University of Queensland; York University; University of Glasgow; Universiteit Leiden; Eberhard Karls Universität Tübingen; Università degli Studi di Padova; University of Melbourne; Universitetet i Stavanger; Université Grenoble Alpes; Dublin City University; Qatar University; Università Ca' Foscari Venezia; Philipps-Universität Marburg; University of Chinese Academy of Sciences; Centre National de la Recherche Scientifique; Univerzita Karlova v Praze; Università degli Studi di Cagliari; Sorbonne Université; Indian National Science Academy; Universidad Nacional de Educación a Distancia; Universidade da Coruña; RMIT University; Carnegie Mellon University; University of Southern Maine","keywords":"Computer science; Information retrieval","score_opus":0.010432945801344552,"score_gpt":0.2657554651842439,"score_spread":0.25532251938289935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393106207","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015660082,0.65013725,0.046363726,0.006695068,0.011142356,0.0000927876,0.00063834473,0.0017505473,0.28161392],"genre_scores_gemma":[0.017668437,0.37005538,0.039723594,0.0029356799,0.012148605,0.00013571519,0.0014735083,0.0007790704,0.55508006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00017597894,0.000076764205,0.00016839145,0.00070256914,0.00008153307],"domain_scores_gemma":[0.99843925,0.00061792444,0.000077024735,0.0003302388,0.00041240777,0.0001231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016063933,0.0017337269,0.0024586702,0.005700051,0.00086083834,0.0045785997,0.0015718641,0.0015720362,0.060626484],"category_scores_gemma":[0.0035578217,0.00077340624,0.00072595844,0.009571334,0.0014658518,0.007842832,0.0020870625,0.0026566782,0.0668954],"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.00003095825,0.000060293853,0.0001051695,0.0011652048,0.000038722843,0.00003100375,0.000091728274,0.00043375653,0.001201974,0.0593276,0.35012984,0.5873836],"study_design_scores_gemma":[0.000009666759,0.0000441639,0.00035141676,0.00036593716,0.000034128647,0.00020796226,0.00004924077,0.00142965,0.0006833418,0.042706832,0.95410144,0.00001614043],"about_ca_topic_score_codex":0.0010669449,"about_ca_topic_score_gemma":0.0018124277,"teacher_disagreement_score":0.060626484,"about_ca_system_score_codex":0.0013658024,"about_ca_system_score_gemma":0.0013583732,"threshold_uncertainty_score":0.20281577},"labels":[],"label_agreement":null},{"id":"W4393121770","doi":"10.1007/978-3-031-56855-8_21","title":"Strategies for Evolving Diverse and Effective Behaviours in Pursuit Domains","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.012782275775669616,"score_gpt":0.2618745035610549,"score_spread":0.24909222778538528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11150878,0.00064056483,0.85769516,0.0004178312,0.0000571584,0.00014694949,0.00005691667,0.0003710449,0.029105555],"genre_scores_gemma":[0.71566117,0.00069366064,0.26863718,0.0001663013,0.000034414043,0.00047746144,0.00014622377,0.00015373273,0.014029857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997249,0.00008044107,0.000019643401,0.000048243677,0.00007891002,0.000047816775],"domain_scores_gemma":[0.9990245,0.0005617337,0.0000853649,0.000112353744,0.000106408996,0.00010970984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082138507,0.0007239611,0.000516414,0.0008139442,0.00060482667,0.0014463608,0.0012395876,0.0011741577,0.0044456203],"category_scores_gemma":[0.0038579023,0.00037044944,0.00052312354,0.00052264065,0.0010946342,0.0015291717,0.0026398783,0.0012872196,0.000876013],"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.00012721305,0.00017727578,0.0019188063,0.00031194038,0.00009943824,0.00028106378,0.0010020529,0.28760123,0.023504632,0.42981794,0.003272312,0.25188616],"study_design_scores_gemma":[0.00005480759,0.00021902472,0.00049124635,0.000071061695,0.000046069195,0.00023466034,0.00046663356,0.7719571,0.0038954425,0.21644217,0.0060938774,0.000027877117],"about_ca_topic_score_codex":0.00050374115,"about_ca_topic_score_gemma":0.000755438,"teacher_disagreement_score":0.0044456203,"about_ca_system_score_codex":0.00045560964,"about_ca_system_score_gemma":0.00042745497,"threshold_uncertainty_score":0.014872074},"labels":[],"label_agreement":null},{"id":"W4393121851","doi":"10.1007/978-3-031-56855-8","title":"Applications of Evolutionary Computation","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Information and Communications Technology; Universitat Politècnica de València; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; College of Engineering, Michigan State University; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Région Normandie; Technische Universität Dortmund; Universidade da Coruña; Universitat Oberta de Catalunya; Eötvös Loránd Tudományegyetem; University of South Africa; University of Tsukuba; Universidad de Granada; Syddansk Universitet; ITMO University; Universidade Nova de Lisboa; Universidade de Coimbra; Silesian University of Technology; Universidad Complutense de Madrid; Universität Bielefeld; Michigan State University; Newcastle University; Università degli Studi di Trento; Technische Universität Darmstadt; Hakim Sabzevari University; King's College London; Centre National de la Recherche Scientifique; Johannes Gutenberg-Universität Mainz; Université du Luxembourg; Università degli Studi di Milano; Università degli Studi di Firenze; Universitetet i Oslo; Universität zu Lübeck; Sorbonne Université; Università degli Studi di Salerno; Queensland University of Technology; Universidad Politécnica de Madrid; Universidad de Extremadura; Universidad de Guadalajara; Euskal Herriko Unibertsitatea; University of Twente; Hong Kong Baptist University; York University; Universiteit Leiden; Indian Council of Agricultural Research; Swansea University; Radboud Universiteit; Universidad Rey Juan Carlos; Edinburgh Napier University; Carl von Ossietzky Universität Oldenburg; University of Southampton; Iran Telecommunication Research Center; De Montfort University; Università per Stranieri di Perugia; University of Exeter; Universidad de Cádiz; Universidad de Málaga; University of Cape Town; Institut \"Jožef Stefan\"; Università degli Studi di Perugia; Heriot-Watt University; Pomona College; Ostravská Univerzita v Ostravě; Technische Universität Dresden; Politecnico di Torino; University of Central Florida; Yeditepe Üniversitesi; Tecnológico Nacional de México; České Vysoké Učení Technické v Praze; Università degli Studi di Parma; Universidad de Sevilla; Sveučilište u Zagrebu; Queen Mary University of London; Universität Basel","keywords":"Computer science; Evolutionary computation; Computation; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.009796253796092282,"score_gpt":0.258472270848703,"score_spread":0.24867601705261072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121851","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00599059,0.10447847,0.44436958,0.0029114978,0.0029622994,0.00007215512,0.00021387318,0.0008799301,0.43812177],"genre_scores_gemma":[0.28010464,0.09409874,0.3662197,0.0012466176,0.0031864597,0.0002339626,0.0006532161,0.000682452,0.25357422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996315,0.00009597311,0.000016041164,0.00006049497,0.00017415534,0.000021794478],"domain_scores_gemma":[0.99952376,0.00028197496,0.000017852171,0.00008491936,0.00006893979,0.000022524557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552582,0.0008104997,0.0009048816,0.0013001999,0.0004906188,0.0019055397,0.00086668105,0.0011449766,0.018441008],"category_scores_gemma":[0.0018033723,0.00039772879,0.0007272526,0.0015381603,0.0011145062,0.0014490921,0.0014485016,0.0014792855,0.004086653],"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.000036847963,0.00003902606,0.00044339066,0.00049143453,0.00007723926,0.0001864186,0.00014410252,0.023987474,0.0028564455,0.5259972,0.033907823,0.4118326],"study_design_scores_gemma":[0.000016434635,0.000037633894,0.00068174204,0.00019575712,0.000026894322,0.0005459673,0.000060632432,0.065636806,0.0016175689,0.6466169,0.28453764,0.000025970865],"about_ca_topic_score_codex":0.0005193272,"about_ca_topic_score_gemma":0.0005725965,"teacher_disagreement_score":0.018441008,"about_ca_system_score_codex":0.0006003873,"about_ca_system_score_gemma":0.00036582377,"threshold_uncertainty_score":0.061691344},"labels":[],"label_agreement":null},{"id":"W4393121880","doi":"10.1007/978-3-031-56855-8_22","title":"Using Evolution and Deep Learning to Generate Diverse Intelligent Agents","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning","score_opus":0.04096502972223453,"score_gpt":0.2808853062363742,"score_spread":0.23992027651413966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12689073,0.0004914448,0.85599315,0.00053761125,0.00018457894,0.00012974582,0.00007177049,0.0008577462,0.014843236],"genre_scores_gemma":[0.71867555,0.00021338249,0.27298924,0.00021217087,0.00004231286,0.00018159483,0.00013580502,0.00018673707,0.00736334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980766,0.00004396068,0.000010898957,0.00004403327,0.000059587295,0.000033885146],"domain_scores_gemma":[0.9993735,0.00031314834,0.000051268675,0.00009314739,0.00011536058,0.00005368363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081084267,0.0006138854,0.00059315015,0.00056323764,0.0005569774,0.0007811684,0.0012478473,0.0011077324,0.002160265],"category_scores_gemma":[0.0020739944,0.00053527136,0.0005492737,0.00040542087,0.0011417989,0.0009330528,0.0016280814,0.001430662,0.0003584553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065120454,0.00009534905,0.0008146705,0.000060170307,0.000057378562,0.00009652361,0.00013266037,0.85001814,0.008005943,0.03862252,0.0013843303,0.1006472],"study_design_scores_gemma":[0.000013314378,0.000028351991,0.00006544335,0.0000070849223,0.000008036495,0.000017350756,0.000011907396,0.98447347,0.0013371041,0.01328268,0.00074991334,0.000005345374],"about_ca_topic_score_codex":0.0021571962,"about_ca_topic_score_gemma":0.003244068,"teacher_disagreement_score":0.002160265,"about_ca_system_score_codex":0.0010369384,"about_ca_system_score_gemma":0.0005046338,"threshold_uncertainty_score":0.0075235963},"labels":[],"label_agreement":null},{"id":"W4393258258","doi":"10.1007/978-3-031-56232-7_8","title":"Generating Supersingular Elliptic Curves over $$\\mathbb {F}_p$$ with Unknown Endomorphism Ring","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supersingular elliptic curve; Endomorphism ring; Endomorphism; Elliptic curve; Computer science; Ring (chemistry); Elliptic curve point multiplication; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.010076143823301693,"score_gpt":0.21812646846719425,"score_spread":0.20805032464389256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393258258","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.50991553,0.0006046215,0.24265455,0.001713983,0.00070710643,0.00024379205,0.00059102365,0.00093954714,0.24262983],"genre_scores_gemma":[0.8586864,0.0005636622,0.034301437,0.00026218148,0.00040669437,0.00010887301,0.00063683285,0.0006151611,0.10441878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995963,0.000076838995,0.00001486969,0.00006845558,0.00015842136,0.00008517234],"domain_scores_gemma":[0.9996437,0.00008740374,0.00004672009,0.000102141785,0.0000574673,0.000062584615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044292028,0.00084817864,0.0006777356,0.00091866043,0.0010124501,0.0020264583,0.00074233173,0.0009535372,0.012242906],"category_scores_gemma":[0.0010057617,0.0004118805,0.00090324704,0.00065497967,0.0012661386,0.0024180147,0.0022364045,0.0015610141,0.003284397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087915054,0.0000528903,0.00031881058,0.000070993396,0.0000109580005,0.00029516697,0.00028730152,0.0024637738,0.0058029997,0.9679359,0.0027872892,0.019886017],"study_design_scores_gemma":[0.000055013166,0.00010194446,0.00042032302,0.000039889295,0.000023270235,0.00059094775,0.00016829613,0.019075615,0.01247232,0.9476912,0.019330487,0.0000307401],"about_ca_topic_score_codex":0.00015087165,"about_ca_topic_score_gemma":0.00019622082,"teacher_disagreement_score":0.012242906,"about_ca_system_score_codex":0.0007501978,"about_ca_system_score_gemma":0.00041677055,"threshold_uncertainty_score":0.040956616},"labels":[],"label_agreement":null},{"id":"W4393261931","doi":"10.1007/978-3-031-56940-1","title":"Foundations of Information and Knowledge Systems","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Computational Techniques and Applications","field":"Computer Science","cited_by":3,"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":"Indiana University Bloomington; Technische Universität Dortmund; Université de Montpellier; University of Cape Town; Universiteit Hasselt; Université de Bordeaux; Zhejiang University; Universiteit Utrecht; Universidade de São Paulo; University of Waterloo; University of Oxford; Centre National de la Recherche Scientifique; LOEWE Zentrum AdRIA; University of Bristol; Aix-Marseille Université; Hokkaido University; Technische Universität Dresden; Helsingin Yliopisto","keywords":"Computer science; Information system; Information retrieval; Data science","score_opus":0.014547313020935758,"score_gpt":0.2922740989026282,"score_spread":0.2777267858816924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393261931","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006315192,0.040105395,0.48039013,0.017746283,0.0013399035,0.00012628728,0.0010748955,0.0006469372,0.45225498],"genre_scores_gemma":[0.4715605,0.06689728,0.32838663,0.0028759157,0.0044462867,0.00065318664,0.0022391507,0.00028661478,0.12265444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990584,0.00029607015,0.00007787086,0.00013056946,0.00035403442,0.00008297964],"domain_scores_gemma":[0.9977623,0.0013907137,0.00011514571,0.0003713838,0.00026614754,0.00009421808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010653558,0.0006596159,0.00085752225,0.0018190762,0.0013741239,0.0071017933,0.0012945074,0.0016691453,0.013895661],"category_scores_gemma":[0.0034842123,0.0006230331,0.0008199875,0.0031647515,0.004896255,0.008388803,0.0018572649,0.0027080958,0.0038239695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002710651,0.0000051181046,0.000028946279,0.00005718991,0.000004606956,0.00001994867,0.000082627,0.0003746511,0.00005007816,0.9865318,0.0035518017,0.009290425],"study_design_scores_gemma":[0.0000030555686,0.0000016170225,0.0000314372,0.000025861062,0.0000035131602,0.000030519328,0.000027676053,0.0008653074,0.000043101667,0.9731276,0.0258377,0.0000026468567],"about_ca_topic_score_codex":0.002770619,"about_ca_topic_score_gemma":0.0016206739,"teacher_disagreement_score":0.013895661,"about_ca_system_score_codex":0.0023564098,"about_ca_system_score_gemma":0.001964941,"threshold_uncertainty_score":0.046485603},"labels":[],"label_agreement":null},{"id":"W4393315183","doi":"10.1007/978-3-031-57327-9_13","title":"Natural2CTL: A Dataset for Natural Language Requirements and Their CTL Formal Equivalents","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Equivalent; Programming language; CTL*; Natural language; Natural language processing; Artificial intelligence","score_opus":0.020645002648048975,"score_gpt":0.3020611085821761,"score_spread":0.28141610593412714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393315183","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012804048,0.0005684423,0.0028186801,0.0003380149,0.000063928164,0.0001544334,0.97167724,0.005147117,0.0064281872],"genre_scores_gemma":[0.008505577,0.00020000138,0.003944814,0.00015663564,0.000014070263,0.0003102619,0.9850815,0.0003836631,0.0014035247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973206,0.0005062843,0.00037255147,0.00047588002,0.0010655985,0.00025910125],"domain_scores_gemma":[0.98694706,0.007245763,0.0009935248,0.002054289,0.0019084583,0.00085084885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014183755,0.0019060713,0.0008153337,0.0069285845,0.00075943384,0.001529157,0.0019126412,0.0024806173,0.018066147],"category_scores_gemma":[0.014210711,0.0005988985,0.0015529187,0.0053640516,0.0005197473,0.0018927518,0.0020056732,0.0018717501,0.015369532],"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.00072238635,0.0003696557,0.01042725,0.00358981,0.00011194393,0.00076661125,0.00030326005,0.004860875,0.004307513,0.0068974094,0.93251586,0.035127457],"study_design_scores_gemma":[0.0005811965,0.00019107044,0.025614332,0.00060901843,0.00009686831,0.0011480858,0.0006433438,0.015472362,0.0064429976,0.0066788225,0.94238573,0.00013605664],"about_ca_topic_score_codex":0.020532511,"about_ca_topic_score_gemma":0.031447366,"teacher_disagreement_score":0.020532511,"about_ca_system_score_codex":0.0019014549,"about_ca_system_score_gemma":0.0026195652,"threshold_uncertainty_score":0.060437262},"labels":[],"label_agreement":null},{"id":"W4393322267","doi":"10.1007/978-3-031-57327-9","title":"Requirements Engineering: Foundation for Software Quality","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":13,"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":"Pontifícia Universidade Católica do Rio de Janeiro; Ames Research Center; Universitat Politècnica de Catalunya; NOVA Laboratory for Computer Science and Informatics; Universität Zürich; Blekinge Tekniska Högskola; Universidade de Lisboa; Göteborgs Universitet; Lunds Universitet; Università di Pisa; Fondazione Bruno Kessler; Universiteit Utrecht; Universität Heidelberg; National Aeronautics and Space Administration; University College London; Politechnika Poznańska; University College Dublin; Università degli Studi di Trento; Commonwealth Scientific and Industrial Research Organisation; Northwestern University; York University; Durham University; Universität Hamburg; Universität zu Köln; University of Ottawa; Universidad Politécnica de Madrid; Leibniz-Gemeinschaft; Chalmers Tekniska Högskola; Kennesaw State University; Universitat Politècnica de València; University of Canterbury; University of Cincinnati; Universidade Nova de Lisboa","keywords":"Computer science; Software engineering; Foundation (evidence); Software quality; Quality (philosophy); Software; Software development; Programming language","score_opus":0.039391134362251445,"score_gpt":0.32493238567128757,"score_spread":0.2855412513090361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393322267","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.002281002,0.010696267,0.8626822,0.0070671146,0.0006552223,0.00009719461,0.00021650255,0.0012348401,0.11506971],"genre_scores_gemma":[0.15900159,0.023728507,0.7276981,0.0022126583,0.0020933573,0.0005237025,0.00088498485,0.0015010311,0.08235605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974347,0.00058456726,0.00015222759,0.00025594074,0.0014446091,0.00012802792],"domain_scores_gemma":[0.99572134,0.002624413,0.00020361469,0.00065667136,0.00071257586,0.00008139684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027158416,0.0009703486,0.00071712263,0.0015605667,0.00058302085,0.0030222996,0.0011894975,0.0014672477,0.012161826],"category_scores_gemma":[0.009276783,0.00084502756,0.0009606723,0.001601068,0.0025610828,0.005707355,0.0016743348,0.0027206568,0.0048072287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014183289,0.000023672328,0.00012125289,0.0003663375,0.000018017254,0.000050439063,0.00019691781,0.0045562577,0.0011314895,0.7901576,0.024626674,0.17873725],"study_design_scores_gemma":[0.000018104463,0.000023624745,0.00017206975,0.00025474877,0.000019975605,0.00014269423,0.00005774728,0.013217565,0.0011552431,0.8482355,0.13668801,0.000014747824],"about_ca_topic_score_codex":0.0013404468,"about_ca_topic_score_gemma":0.0008580421,"teacher_disagreement_score":0.012161826,"about_ca_system_score_codex":0.0012384275,"about_ca_system_score_gemma":0.0016310961,"threshold_uncertainty_score":0.040685356},"labels":[],"label_agreement":null},{"id":"W4393323735","doi":"10.1007/978-3-031-56255-6_5","title":"Deliberation and Voting in Approval-Based Multi-winner Elections","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Deliberation; Voting; Approval voting; Operations research; Artificial intelligence; Condorcet method; Political science; Mathematics; Law","score_opus":0.032312067663126304,"score_gpt":0.23181488155606175,"score_spread":0.19950281389293545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393323735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23498233,0.002050599,0.6398661,0.005183587,0.00060082827,0.00022978972,0.00024445154,0.00023173903,0.116610534],"genre_scores_gemma":[0.95017815,0.0004101382,0.020950336,0.00017685539,0.00023330157,0.00016048734,0.00012409581,0.000066760345,0.027699873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98960495,0.007180322,0.00035214698,0.00087939453,0.00088480406,0.0010984028],"domain_scores_gemma":[0.9650954,0.029944053,0.0014756573,0.0015646401,0.0011752076,0.00074507785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008773753,0.00064921664,0.00187731,0.0007701923,0.0019273967,0.005017066,0.0023359582,0.0028180613,0.01195347],"category_scores_gemma":[0.042925257,0.0009437581,0.0014469058,0.0012829688,0.0030540396,0.005815566,0.0023925751,0.0041418434,0.001250085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056329626,0.00014079036,0.0013576903,0.00013185678,0.00007959671,0.00016116927,0.0005838693,0.06126308,0.0007076353,0.9006976,0.0039055601,0.030407956],"study_design_scores_gemma":[0.00006085985,0.000075667165,0.0005479811,0.000014130076,0.000022619693,0.00004133774,0.00013668418,0.16376507,0.0002968087,0.83352655,0.0014876797,0.000024459587],"about_ca_topic_score_codex":0.002164978,"about_ca_topic_score_gemma":0.0024038614,"teacher_disagreement_score":0.01195347,"about_ca_system_score_codex":0.0016748458,"about_ca_system_score_gemma":0.0016242424,"threshold_uncertainty_score":0.046400607},"labels":[],"label_agreement":null},{"id":"W4393854863","doi":"10.1007/978-3-031-57246-3_4","title":"Speculative SAT Modulo SAT","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; European Commission; Israel Science Foundation; Microsoft Research","keywords":"Modulo; Computer science; Algorithm; Arithmetic; Theoretical computer science; Programming language; Parallel computing; Discrete mathematics; Mathematics","score_opus":0.032075521649222914,"score_gpt":0.28335002353344,"score_spread":0.2512745018842171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393854863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07198867,0.0014788446,0.8748744,0.0035313377,0.00043233958,0.0004065791,0.0017591418,0.01143162,0.034097113],"genre_scores_gemma":[0.61136234,0.0007644327,0.37311837,0.0011174016,0.00029120917,0.00034935525,0.002863545,0.0011252535,0.009008126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648094,0.0014697532,0.00019500268,0.000590263,0.0009113172,0.00035256922],"domain_scores_gemma":[0.98784745,0.008064958,0.0005498127,0.002562629,0.0007930482,0.00018207695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032342228,0.0009979107,0.0006615373,0.0010851811,0.0009223493,0.002467044,0.0022938333,0.0008163288,0.014908884],"category_scores_gemma":[0.011441664,0.00082667347,0.0019200898,0.0013892171,0.0030826852,0.0047106054,0.0038646813,0.0031256478,0.0017695399],"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.0005183218,0.00017914208,0.0034605428,0.0009852129,0.000120794124,0.0004139731,0.00048348118,0.16954373,0.008938251,0.67969656,0.019839521,0.11582054],"study_design_scores_gemma":[0.00014287738,0.00009253405,0.00032997763,0.00010793964,0.00007455471,0.00011828086,0.00008052788,0.46311712,0.010835174,0.50123036,0.023840128,0.000030498404],"about_ca_topic_score_codex":0.0045534717,"about_ca_topic_score_gemma":0.0075684367,"teacher_disagreement_score":0.014908884,"about_ca_system_score_codex":0.0021039846,"about_ca_system_score_gemma":0.0029433512,"threshold_uncertainty_score":0.0498752},"labels":[],"label_agreement":null},{"id":"W4393870941","doi":"10.1007/978-3-031-57246-3_1","title":"DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Amazon Web Services","keywords":"Mathematical proof; Modulo; Monotonic function; Computer science; Discrete mathematics; Calculus (dental); Arithmetic; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01924433394267295,"score_gpt":0.2850667452238818,"score_spread":0.26582241128120887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393870941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059985135,0.0011799174,0.90097237,0.00201942,0.00018597179,0.00040929715,0.0015324308,0.0134254005,0.020290026],"genre_scores_gemma":[0.3712089,0.0006795581,0.61221457,0.00090994785,0.00012394843,0.0003190929,0.003920116,0.0025960074,0.008027839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953435,0.0020337338,0.00022348415,0.00046015496,0.0016906956,0.00024845867],"domain_scores_gemma":[0.96475273,0.028398158,0.0010445314,0.0038648257,0.0016798215,0.00025997346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034777662,0.00083755393,0.00057873206,0.0012658964,0.0008983364,0.0022762106,0.0019676874,0.00073558616,0.016901722],"category_scores_gemma":[0.019113753,0.00084707566,0.0013005405,0.0014582889,0.0014669711,0.0036488113,0.002492863,0.0031468556,0.002959875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069312105,0.0005133904,0.0025890598,0.0022114017,0.00020085782,0.0008136402,0.0007198969,0.10212826,0.04556682,0.31007484,0.05618404,0.47830468],"study_design_scores_gemma":[0.00024564008,0.00019626682,0.0005583017,0.00022943584,0.00012216784,0.0006998886,0.0001880815,0.5969406,0.07450481,0.28880882,0.037451394,0.000054615066],"about_ca_topic_score_codex":0.0010430609,"about_ca_topic_score_gemma":0.0022847175,"teacher_disagreement_score":0.016901722,"about_ca_system_score_codex":0.001585491,"about_ca_system_score_gemma":0.0016859905,"threshold_uncertainty_score":0.05654192},"labels":[],"label_agreement":null},{"id":"W4393870960","doi":"10.1007/978-3-031-57246-3_3","title":"TaSSAT: Transfer and Share SAT","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Transfer (computing); Theoretical computer science; Parallel computing","score_opus":0.015569451711534812,"score_gpt":0.2382465355388882,"score_spread":0.22267708382735338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393870960","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.03586481,0.0014781284,0.8827025,0.001202004,0.00039147667,0.00026504023,0.0010175565,0.010817602,0.06626087],"genre_scores_gemma":[0.48207375,0.0013518299,0.4605427,0.00071074005,0.0003905871,0.0005760553,0.0041217157,0.0030458525,0.047186684],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917954,0.0002014838,0.00003836832,0.00014340729,0.00034542423,0.00009175668],"domain_scores_gemma":[0.9993911,0.00025027373,0.000040814044,0.00020280239,0.000074542746,0.0000403946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008533408,0.000711611,0.00061595807,0.000711411,0.0004617183,0.0018789737,0.0023153257,0.0007933321,0.030949248],"category_scores_gemma":[0.00257389,0.00045908088,0.00084344525,0.0019443829,0.0009479126,0.0029581052,0.0029047485,0.0018438183,0.0055574887],"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.00047624577,0.0003209023,0.0007896044,0.0006316257,0.00015966877,0.00030715473,0.00022086654,0.17781802,0.0135275675,0.22218484,0.08305293,0.5005106],"study_design_scores_gemma":[0.00026058516,0.0001718789,0.00045038477,0.00008185737,0.00008220401,0.00026986861,0.00009638341,0.6948823,0.018410841,0.1988418,0.08642066,0.00003121797],"about_ca_topic_score_codex":0.0010148654,"about_ca_topic_score_gemma":0.0016656155,"teacher_disagreement_score":0.030949248,"about_ca_system_score_codex":0.00083388836,"about_ca_system_score_gemma":0.0011583918,"threshold_uncertainty_score":0.10353553},"labels":[],"label_agreement":null},{"id":"W4393943394","doi":"10.1007/978-3-031-57262-3_3","title":"Layered Modal Type Theory","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Modal; Type (biology); Type theory; Algorithm; Geology; Materials science","score_opus":0.02120570423818826,"score_gpt":0.24894126117312199,"score_spread":0.22773555693493372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393943394","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.019434845,0.00033696866,0.95715415,0.00075134,0.00019462024,0.000066267625,0.00022804027,0.001100505,0.020733193],"genre_scores_gemma":[0.479617,0.00059288234,0.5014485,0.0009023236,0.0003305891,0.00028300766,0.00042356807,0.00057031814,0.015831783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968166,0.00090425985,0.00025468267,0.0004919145,0.0010460503,0.00048659847],"domain_scores_gemma":[0.9973711,0.00073293765,0.00021617817,0.00081002055,0.0006895109,0.00018031329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037941255,0.00065355265,0.00072302413,0.002150143,0.0015243937,0.0042776177,0.0018894523,0.0012861437,0.0062523684],"category_scores_gemma":[0.003908525,0.00092821644,0.0027420851,0.0015212862,0.004248,0.010463569,0.0045232284,0.002874945,0.0011736416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018521021,0.00000812846,0.00036003182,0.000032194643,0.000013702872,0.000057168472,0.00031974624,0.0028902676,0.0010695461,0.98787796,0.00070041505,0.006652385],"study_design_scores_gemma":[0.000012248864,0.000019695564,0.00023134977,0.000055617114,0.00003360101,0.00011804455,0.00010257364,0.04024063,0.0021711164,0.93768775,0.019295812,0.000031567935],"about_ca_topic_score_codex":0.0039049531,"about_ca_topic_score_gemma":0.0033954794,"teacher_disagreement_score":0.0062523684,"about_ca_system_score_codex":0.003117067,"about_ca_system_score_gemma":0.0016364347,"threshold_uncertainty_score":0.022616029},"labels":[],"label_agreement":null},{"id":"W4393978605","doi":"10.1007/978-3-031-57259-3_19","title":"TracerX: Pruning Dynamic Symbolic Execution with Deletion and Weakest Precondition Interpolation (Competition Contribution)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Precondition; Computer science; Pruning; Interpolation (computer graphics); Competition (biology); Algorithm; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.007317886509596298,"score_gpt":0.2327990402987306,"score_spread":0.2254811537891343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393978605","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.038584463,0.00036339133,0.9476842,0.00030474178,0.000109638226,0.00011951047,0.0002633151,0.0089678,0.0036029255],"genre_scores_gemma":[0.43067926,0.0001807775,0.5600697,0.00020561076,0.00005202411,0.00021434443,0.0009886113,0.0012735659,0.0063360664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987698,0.0003267873,0.00005676638,0.00017559923,0.00053596817,0.0001349033],"domain_scores_gemma":[0.9973061,0.0016216667,0.00013835503,0.00046116454,0.00034198991,0.00013057159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015087568,0.0008431588,0.00088900997,0.0008760214,0.00048156202,0.0008509569,0.0021664784,0.0009309239,0.008253421],"category_scores_gemma":[0.0054991255,0.0004509277,0.00080984033,0.0007221196,0.0015259824,0.0012998409,0.0022397235,0.0016769327,0.0009227735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011067706,0.0002623301,0.0036832434,0.00063140364,0.00009098982,0.00055062183,0.0003017967,0.48723885,0.020233769,0.0812505,0.016589763,0.3880599],"study_design_scores_gemma":[0.000056024688,0.0001250834,0.00016760819,0.000028934906,0.000016033044,0.00006922349,0.000020864978,0.96602803,0.009451067,0.020121811,0.0039042912,0.000011018541],"about_ca_topic_score_codex":0.004379687,"about_ca_topic_score_gemma":0.0049258354,"teacher_disagreement_score":0.008253421,"about_ca_system_score_codex":0.0009014266,"about_ca_system_score_gemma":0.0023280568,"threshold_uncertainty_score":0.02761048},"labels":[],"label_agreement":null},{"id":"W4394596122","doi":"10.1007/978-3-031-58226-4_17","title":"Exploring the Influence of Persuasive Strategies on Student Motivation: Self-determination Theory Perspective","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Motivation and Self-Concept in Sports","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Perspective (graphical); Computer science; Human–computer interaction; Self-determination theory; Cognitive science; Artificial intelligence; Psychology","score_opus":0.043056429682556296,"score_gpt":0.3156579484495939,"score_spread":0.2726015187670376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394596122","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.95114166,0.0016186599,0.010068447,0.0010973264,0.000036499438,0.00006591607,0.000041688596,0.000024212217,0.03590555],"genre_scores_gemma":[0.99733835,0.00031781997,0.001249757,0.000051277402,0.000013595378,0.000025354058,0.000011429343,0.000005426564,0.0009869991],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99792945,0.0013280584,0.00003662609,0.00018239248,0.00034746053,0.00017600972],"domain_scores_gemma":[0.95864403,0.038054407,0.0014424247,0.0004521926,0.0007889388,0.00061790925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004377743,0.00044462614,0.00042176002,0.0010643647,0.00045150061,0.0035987918,0.00069384644,0.0010044819,0.0029784092],"category_scores_gemma":[0.0204837,0.0002917534,0.000595171,0.000892096,0.0012375902,0.0015819886,0.001031825,0.0016799403,0.00023434708],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001303406,0.0045761666,0.37441012,0.0010142905,0.0009768598,0.00079946534,0.026074301,0.01130275,0.010300938,0.22311541,0.001968809,0.34415746],"study_design_scores_gemma":[0.0002498919,0.0036827805,0.6936966,0.0006789301,0.0012353281,0.00064634625,0.022299185,0.06974454,0.0119948285,0.18498571,0.010625887,0.00015998176],"about_ca_topic_score_codex":0.0010019429,"about_ca_topic_score_gemma":0.0009800429,"teacher_disagreement_score":0.004377743,"about_ca_system_score_codex":0.0005913842,"about_ca_system_score_gemma":0.0011062188,"threshold_uncertainty_score":0.023151994},"labels":[],"label_agreement":null},{"id":"W4394605182","doi":"10.1007/978-3-031-57867-0_12","title":"Automated Compliance Analysis on Clinical Notes to Improve Cancer Lifestyle Management","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical practice guidelines implementation","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compliance (psychology); Cancer; Medicine","score_opus":0.16368672707667614,"score_gpt":0.49246695973054483,"score_spread":0.3287802326538687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394605182","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.12674215,0.0015520904,0.7543686,0.0032415355,0.00068577443,0.0015439419,0.012755008,0.07379129,0.025319645],"genre_scores_gemma":[0.3113023,0.00060870143,0.6524765,0.00077350927,0.00025396238,0.0006471521,0.011839021,0.0019228084,0.020176155],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99641573,0.0012152864,0.00036546472,0.00041482566,0.0014428388,0.00014579704],"domain_scores_gemma":[0.9754318,0.016941467,0.0015521453,0.001936119,0.0037846235,0.00035391643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892172,0.0007621515,0.0006425532,0.0028536264,0.0004818545,0.0020588601,0.0012684864,0.0007702422,0.008134556],"category_scores_gemma":[0.018624844,0.00041897557,0.0005704796,0.0018817487,0.00020150309,0.0011950004,0.0011045781,0.0009446757,0.0037935888],"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.0003696556,0.00044352197,0.0146228345,0.00026553404,0.000079080026,0.0002949994,0.0004880887,0.00479574,0.008841319,0.0025618058,0.050336365,0.9169011],"study_design_scores_gemma":[0.0004374037,0.00074285944,0.048383076,0.0010025303,0.00035669087,0.001695273,0.0018066253,0.73288596,0.06744749,0.03327348,0.11170912,0.0002595526],"about_ca_topic_score_codex":0.0062848674,"about_ca_topic_score_gemma":0.0108142095,"teacher_disagreement_score":0.008134556,"about_ca_system_score_codex":0.0007233636,"about_ca_system_score_gemma":0.0020204461,"threshold_uncertainty_score":0.027212739},"labels":[],"label_agreement":null},{"id":"W4394605195","doi":"10.1007/978-3-031-57867-0_15","title":"Understandability: The Hidden Barrier and the Last Yard to Information Accessibility","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Yard; Human–computer interaction","score_opus":0.020345879419972273,"score_gpt":0.28662687436487494,"score_spread":0.26628099494490265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394605195","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02296291,0.046408627,0.049377568,0.15640375,0.003912952,0.000049325896,0.0002015365,0.00029322156,0.7203902],"genre_scores_gemma":[0.77247214,0.028435625,0.011606612,0.017472075,0.0045010825,0.0001770153,0.00024164592,0.00078839826,0.16430552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997757,0.0011437478,0.000103685605,0.00023484537,0.00052789686,0.00023287936],"domain_scores_gemma":[0.99025154,0.0075028054,0.00033406643,0.0007889474,0.00068003667,0.0004425157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003143879,0.0005307414,0.0007672233,0.0015408114,0.0024241195,0.010750168,0.0011244531,0.004448327,0.024876876],"category_scores_gemma":[0.013219277,0.00038639034,0.00049615535,0.0011538705,0.016066441,0.028795132,0.005476726,0.007058349,0.0021416966],"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.000024698349,0.000028372699,0.0002610277,0.00013310331,0.00000540602,0.00009816557,0.007677788,0.000113469796,0.00018171823,0.9314344,0.017996471,0.042045314],"study_design_scores_gemma":[0.000014776059,0.00004060133,0.00061498844,0.00085629115,0.0000144287615,0.0004227733,0.0048917606,0.00059720007,0.00030480378,0.7939515,0.19826834,0.000022537331],"about_ca_topic_score_codex":0.003389049,"about_ca_topic_score_gemma":0.0029588607,"teacher_disagreement_score":0.024876876,"about_ca_system_score_codex":0.0019752758,"about_ca_system_score_gemma":0.002301197,"threshold_uncertainty_score":0.083221376},"labels":[],"label_agreement":null},{"id":"W4394627564","doi":"10.1007/978-3-031-58226-4_15","title":"The Effect of Dark Patterns and User Knowledge on User Experience and Decision-Making","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color perception and design","field":"Psychology","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Human–computer interaction; User interface; Programming language","score_opus":0.018800744383419655,"score_gpt":0.3337894901329919,"score_spread":0.31498874574957225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394627564","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.9967817,0.000071357514,0.0015067698,0.000058464855,0.0000049688206,0.000047551857,0.000015952002,0.000017349439,0.0014958249],"genre_scores_gemma":[0.99855286,0.000036501944,0.001097721,0.000029174164,0.000004541603,0.000026000182,0.000017172242,0.0000045946076,0.00023143274],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9912703,0.0051180855,0.00085410173,0.00078671006,0.001568952,0.00040183787],"domain_scores_gemma":[0.79870456,0.16900532,0.016120926,0.010667429,0.0029930614,0.0025087306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007874091,0.00048248837,0.00041356773,0.0006079673,0.00057458406,0.0021757786,0.00042197254,0.0010116445,0.0031368257],"category_scores_gemma":[0.067749865,0.00043052118,0.00044983055,0.00025352184,0.0011503597,0.0021294493,0.0012576921,0.0010033036,0.00028865985],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007048885,0.0056723435,0.756013,0.0009097574,0.0005653353,0.0006843164,0.024663448,0.0030627402,0.040389873,0.0013659147,0.0004646451,0.15915972],"study_design_scores_gemma":[0.00021040751,0.0091737,0.95069486,0.00018540246,0.00038259212,0.0007238014,0.008800273,0.0102582835,0.01395652,0.0030342478,0.0023596266,0.00022017464],"about_ca_topic_score_codex":0.00094559113,"about_ca_topic_score_gemma":0.00092288025,"teacher_disagreement_score":0.007874091,"about_ca_system_score_codex":0.0004682649,"about_ca_system_score_gemma":0.0004420166,"threshold_uncertainty_score":0.041642666},"labels":[],"label_agreement":null},{"id":"W4394627603","doi":"10.1007/978-3-031-58226-4_5","title":"DROP DASH: A Persuasive Mobile Game to Promote Healthy Hydration Choices Using Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Dalhousie University","funders":"","keywords":"Dash; Computer science; Human–computer interaction; Drop out; Multimedia; Artificial intelligence; Operating system","score_opus":0.02304350877311853,"score_gpt":0.3057828412863445,"score_spread":0.28273933251322597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394627603","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.47563198,0.00321601,0.38192308,0.0037638857,0.0019744593,0.0024010933,0.005157692,0.029966718,0.09596515],"genre_scores_gemma":[0.5398719,0.0025445232,0.31498507,0.0028057077,0.00040549354,0.0029809247,0.004230549,0.0010029473,0.13117288],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998965,0.000025012836,0.000005608613,0.000020221154,0.000039424187,0.000013113535],"domain_scores_gemma":[0.99967384,0.00024580702,0.000012400291,0.000005790384,0.000021103384,0.000041076557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026988206,0.0010397176,0.00036557313,0.00032418882,0.00017460393,0.00049179053,0.0008088975,0.00066108507,0.02054444],"category_scores_gemma":[0.00096825825,0.00015563337,0.00028916003,0.000103496335,0.00010786776,0.00055221224,0.0008235698,0.00081276847,0.0033463864],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038794326,0.005568856,0.0033904214,0.0014281615,0.00023236172,0.00050930266,0.00065511675,0.006559948,0.046967022,0.0027393254,0.09463171,0.8334383],"study_design_scores_gemma":[0.0068990556,0.02065507,0.05315749,0.0014531845,0.0012221768,0.0023791303,0.0016675699,0.3312827,0.08821049,0.023746343,0.46869245,0.00063431344],"about_ca_topic_score_codex":0.0007134495,"about_ca_topic_score_gemma":0.0020494587,"teacher_disagreement_score":0.02054444,"about_ca_system_score_codex":0.00014843355,"about_ca_system_score_gemma":0.00022022576,"threshold_uncertainty_score":0.06872797},"labels":[],"label_agreement":null},{"id":"W4394627614","doi":"10.1007/978-3-031-58226-4_16","title":"Exploring the Influence of Game Framing and Gamer Types on the Effectiveness of Persuasive Games","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"","keywords":"Computer science; Framing (construction); Video game design; Game mechanics; Human–computer interaction; Multimedia; Engineering","score_opus":0.08444155740644108,"score_gpt":0.32858995538382274,"score_spread":0.24414839797738166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394627614","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.99159414,0.00029176995,0.001095305,0.000076399265,0.0000130707585,0.000055039767,0.000039918556,0.000015460791,0.006818841],"genre_scores_gemma":[0.9980039,0.00009693548,0.00082744396,0.000018993469,0.00001072333,0.000051949653,0.000041740128,0.000017937882,0.000930314],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99462163,0.0037495566,0.00018882519,0.00047796633,0.00064338994,0.00031862053],"domain_scores_gemma":[0.6988333,0.2936355,0.0038029521,0.0013423047,0.0012273,0.0011587193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008086525,0.00082866993,0.0005907183,0.0008772334,0.00039821328,0.0034680858,0.0009575429,0.0010103182,0.0072610513],"category_scores_gemma":[0.08962313,0.0005775884,0.0005588197,0.00066533574,0.0006199155,0.0023996467,0.0009565673,0.0018008283,0.0006673339],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04481899,0.021740133,0.3966106,0.0029140036,0.003121814,0.0009856955,0.030609539,0.042894203,0.07096965,0.028150905,0.0027908017,0.35439372],"study_design_scores_gemma":[0.002597359,0.025775755,0.72181016,0.0006011754,0.0070296437,0.00067654205,0.014188392,0.15143459,0.038543254,0.031814624,0.0051384494,0.00038998653],"about_ca_topic_score_codex":0.0014781844,"about_ca_topic_score_gemma":0.0013717696,"teacher_disagreement_score":0.008086525,"about_ca_system_score_codex":0.0006463696,"about_ca_system_score_gemma":0.00051882886,"threshold_uncertainty_score":0.042766094},"labels":[],"label_agreement":null},{"id":"W4394627635","doi":"10.1007/978-3-031-58226-4_18","title":"SmileApp: The Design and Evaluation of an mHealth App for Stress Reduction Through Artificial Intelligence and Persuasive Technology","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Computer science; Persuasive technology; mHealth; Reduction (mathematics); Stress reduction; Human–computer interaction; Artificial intelligence; Applied psychology; Persuasion; Psychology","score_opus":0.1342528298031183,"score_gpt":0.4281692126517329,"score_spread":0.2939163828486146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394627635","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.81886005,0.0030560733,0.11763344,0.0015183644,0.0011043055,0.016277079,0.003595523,0.009599462,0.028355675],"genre_scores_gemma":[0.54200757,0.00282368,0.38776466,0.0020798254,0.00020462582,0.019805377,0.0027069815,0.001759779,0.040847544],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992212,0.00029099974,0.000052671017,0.00008504064,0.00026134876,0.00008869458],"domain_scores_gemma":[0.9989385,0.00068482966,0.00004295757,0.000038231316,0.0001785691,0.00011686014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017358012,0.0010507046,0.00042480358,0.0004246524,0.00043304285,0.0013782345,0.0012191852,0.0011517106,0.0072824485],"category_scores_gemma":[0.0030341072,0.00040048469,0.00045094578,0.00017307351,0.000367334,0.00088843453,0.0009359274,0.0008669412,0.0014243631],"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.0072015477,0.0109421555,0.0047180145,0.0051305275,0.00036796695,0.00065733783,0.00428116,0.0029138315,0.073523976,0.0022008517,0.030593695,0.8574689],"study_design_scores_gemma":[0.015553657,0.18413438,0.08733974,0.003132423,0.004608183,0.004095013,0.010025508,0.09081575,0.25840867,0.010471278,0.33018652,0.0012288108],"about_ca_topic_score_codex":0.0014629853,"about_ca_topic_score_gemma":0.0027311982,"teacher_disagreement_score":0.0072824485,"about_ca_system_score_codex":0.0003051298,"about_ca_system_score_gemma":0.0014860895,"threshold_uncertainty_score":0.024362147},"labels":[],"label_agreement":null},{"id":"W4394627656","doi":"10.1007/978-3-031-58226-4_3","title":"Exploring the Effect of Using a Single Versus Multiple Behaviour Change Strategies on Motivation to Use Gratitude App and Possible Gender Differences","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Gratitude; Computer science; Human–computer interaction; Artificial intelligence; Psychology; Social psychology","score_opus":0.36930254456813066,"score_gpt":0.39009926526260896,"score_spread":0.0207967206944783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394627656","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.99613035,0.0001814348,0.00030960533,0.00018709565,0.00007411751,0.00007214997,0.00017086016,0.00002021828,0.0028542615],"genre_scores_gemma":[0.98898226,0.0002458239,0.0018508425,0.00017728115,0.000032627257,0.00040473888,0.00015946016,0.000029165249,0.00811777],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991493,0.00024140805,0.000057486177,0.00017143144,0.00020819568,0.00017214756],"domain_scores_gemma":[0.9887927,0.009351273,0.00061521155,0.00018732266,0.00039229164,0.0006612246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019056104,0.00032234922,0.0005174147,0.00019778928,0.00028447618,0.00082291313,0.00046027696,0.0004625348,0.014305837],"category_scores_gemma":[0.012263319,0.00023143605,0.0006885017,0.00016390016,0.0003158058,0.00079815317,0.00061638706,0.0015088107,0.0010783471],"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.090812676,0.054877363,0.20114861,0.003043565,0.0018506303,0.00061109045,0.025727514,0.001411472,0.057886716,0.0023084867,0.0053552953,0.55496657],"study_design_scores_gemma":[0.0015296068,0.061641242,0.9085697,0.000424832,0.0016848347,0.00015807802,0.008369473,0.0020383887,0.009107561,0.0010235006,0.005352668,0.00010019],"about_ca_topic_score_codex":0.0016521377,"about_ca_topic_score_gemma":0.0027116397,"teacher_disagreement_score":0.014305837,"about_ca_system_score_codex":0.0004049873,"about_ca_system_score_gemma":0.0007972395,"threshold_uncertainty_score":0.04785776},"labels":[],"label_agreement":null},{"id":"W4394697389","doi":"10.1007/978-3-031-57793-2","title":"Discrete Geometry and Mathematical Morphology","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; National Technical University of Athens; Università di Pisa; Université Paris-Saclay; Uppsala Universitet; Centre National de la Recherche Scientifique; Technische Universität Wien; Università degli Studi di Firenze; Università degli Studi di Siena; National and Kapodistrian University of Athens; Rijksuniversiteit Groningen; Université de Strasbourg; Université de Lorraine; Université Savoie Mont Blanc; Universidad de Sevilla; Université du Québec à Montréal","keywords":"Mathematical morphology; Computer science; Morphology (biology); Discrete geometry; Geometry; Computer graphics (images); Artificial intelligence; Mathematics; Image processing; Geology","score_opus":0.0053799860656843215,"score_gpt":0.22882078838378755,"score_spread":0.22344080231810323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394697389","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013990114,0.044301067,0.10217842,0.0067205243,0.0024320867,0.000035339166,0.0004405627,0.000250975,0.82965094],"genre_scores_gemma":[0.46832833,0.031075696,0.034676913,0.0014264215,0.0064072306,0.00013086041,0.00064665085,0.00042134087,0.45688662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998565,0.00003663108,0.000007786379,0.000032207416,0.00005513548,0.000011748967],"domain_scores_gemma":[0.9998286,0.00008107211,0.000013597567,0.00002842096,0.000029981951,0.000018267188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019751603,0.0005668546,0.0007803965,0.0011550809,0.00094278716,0.0028340023,0.0005064399,0.0006325937,0.016489644],"category_scores_gemma":[0.00057903276,0.00027996852,0.0004136831,0.001429887,0.0033259857,0.0026705284,0.0010209531,0.0018758025,0.0040880563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003135018,0.0000027752005,0.000016964841,0.000029096711,0.000002619883,0.000012411814,0.00006833663,0.00023394127,0.0001790617,0.985759,0.005126208,0.008566357],"study_design_scores_gemma":[0.000003421866,0.0000061066953,0.00011312228,0.000010997326,0.000003223104,0.00008920004,0.000046707286,0.00044020108,0.00011837252,0.9312067,0.06795891,0.0000030590766],"about_ca_topic_score_codex":0.0005410593,"about_ca_topic_score_gemma":0.00059564284,"teacher_disagreement_score":0.016489644,"about_ca_system_score_codex":0.0011697459,"about_ca_system_score_gemma":0.00040801475,"threshold_uncertainty_score":0.055163383},"labels":[],"label_agreement":null},{"id":"W4394792568","doi":"10.1007/978-3-031-58072-7_2","title":"Galled Perfect Transfer Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Sherbrooke","funders":"","keywords":"Character (mathematics); Computer science; Tree (set theory); Set (abstract data type); Transfer (computing); Theoretical computer science; Artificial intelligence; Sequence (biology); Task (project management); Base (topology); Mathematics; Combinatorics; Biology","score_opus":0.009343551511291431,"score_gpt":0.21996897257088532,"score_spread":0.2106254210595939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792568","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.045609497,0.003403131,0.69202834,0.0045140604,0.00071465806,0.00015153461,0.0033898733,0.0022303278,0.24795856],"genre_scores_gemma":[0.62850565,0.0034063002,0.10806608,0.0016303374,0.0007817451,0.00044028516,0.004668426,0.0014218278,0.25107935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945575,0.0001423222,0.000024317964,0.0001798284,0.00011498102,0.00008280998],"domain_scores_gemma":[0.9976471,0.0010291159,0.0001518935,0.0007781276,0.00021446765,0.00017933274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007739581,0.0007978148,0.00095001014,0.0019492147,0.0014011774,0.00241947,0.0015084745,0.0019225441,0.0353425],"category_scores_gemma":[0.0056645717,0.0006136131,0.0008049426,0.0015824754,0.0018379819,0.0051515596,0.0030665277,0.0027934627,0.0062663206],"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.000048160848,0.000014476238,0.0001504284,0.00007328988,0.00002592682,0.000063168736,0.00010414366,0.01178524,0.0006718198,0.9262431,0.018771643,0.042048596],"study_design_scores_gemma":[0.0000042513525,0.000004495572,0.00009185589,0.00001382472,0.000006973191,0.000042986467,0.000016362957,0.017957933,0.00027151548,0.97161204,0.009971404,0.0000062874487],"about_ca_topic_score_codex":0.0011384906,"about_ca_topic_score_gemma":0.0011160285,"teacher_disagreement_score":0.0353425,"about_ca_system_score_codex":0.0010998364,"about_ca_system_score_gemma":0.000502111,"threshold_uncertainty_score":0.11823237},"labels":[],"label_agreement":null},{"id":"W4394792578","doi":"10.1007/978-3-031-58072-7_3","title":"Inferring Transcript Phylogenies from Transcript Ortholog Clusters","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Sherbrooke","funders":"","keywords":"Supertree; Biology; Gene; Ensembl; Computational biology; Alternative splicing; Phylogenetics; Genetics; Phylogenetic tree; RNA splicing; Orthologous Gene; Genome; Genomics; Gene isoform; RNA","score_opus":0.013757975500044569,"score_gpt":0.2275288210276399,"score_spread":0.21377084552759534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792578","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.07666239,0.0019050359,0.900227,0.0003691609,0.00013690657,0.000092844886,0.008252702,0.006168822,0.0061851894],"genre_scores_gemma":[0.24017209,0.0028740074,0.710763,0.00019658059,0.00015529981,0.00015920325,0.0366381,0.0018150978,0.007226722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997253,0.00005006399,0.000014323125,0.00012418072,0.000055132823,0.00003099752],"domain_scores_gemma":[0.9991603,0.000598765,0.00004720198,0.0000956011,0.000060611368,0.00003759987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005565574,0.00074927113,0.0007588049,0.0023501944,0.0007008534,0.0015493192,0.001243725,0.0007771956,0.0066468343],"category_scores_gemma":[0.0021559217,0.00073730905,0.0017900441,0.0030542691,0.00047533883,0.0014148651,0.0011418082,0.0012541572,0.0040697725],"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.0010976464,0.00015317227,0.00954664,0.0011102993,0.00025303342,0.0011857606,0.00058632105,0.06170244,0.22099258,0.031030111,0.0133828,0.65895927],"study_design_scores_gemma":[0.00012622614,0.00019856832,0.013560562,0.00023291705,0.00043181502,0.0019028967,0.0008632504,0.59860665,0.08062821,0.2521734,0.05117977,0.000095671276],"about_ca_topic_score_codex":0.0012894615,"about_ca_topic_score_gemma":0.002145401,"teacher_disagreement_score":0.0066468343,"about_ca_system_score_codex":0.0005072479,"about_ca_system_score_gemma":0.00050745223,"threshold_uncertainty_score":0.02223593},"labels":[],"label_agreement":null},{"id":"W4394792604","doi":"10.1007/978-3-031-58072-7_11","title":"Transcription Factors Across the Escherichia coli Pangenome: A 3D Perspective","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"Wilfrid Laurier University","funders":"","keywords":"Structural similarity; Inference; Computational biology; Similarity (geometry); Biology; Genetics; Computer science; Artificial intelligence; Image (mathematics)","score_opus":0.015223733560788452,"score_gpt":0.25459863979255953,"score_spread":0.23937490623177107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792604","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.10921487,0.061149146,0.67660725,0.006816099,0.0019494408,0.000095150106,0.004185543,0.00612832,0.13385412],"genre_scores_gemma":[0.4378279,0.07757672,0.42452872,0.0014143987,0.0004506483,0.00026357977,0.0027456332,0.0014402795,0.05375216],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998764,0.000010953361,0.0000047372746,0.000026132204,0.00006241378,0.000019239702],"domain_scores_gemma":[0.99993074,0.000022976148,0.000008123149,0.000010486834,0.000013582781,0.000014114755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014258773,0.00081028155,0.0006775787,0.00058207446,0.000669657,0.003297026,0.0010127838,0.0014079155,0.0073809647],"category_scores_gemma":[0.00022258905,0.0009907593,0.0006767055,0.0009069131,0.00080138765,0.0018716591,0.0012127842,0.0014062867,0.0024320371],"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.00025099516,0.000075312906,0.0008274342,0.001352719,0.00010176736,0.00071270263,0.000766673,0.14182365,0.43043047,0.18962371,0.018477771,0.21555686],"study_design_scores_gemma":[0.00006560686,0.00015545878,0.0031174745,0.0004377582,0.00011600709,0.0013052316,0.0010644358,0.16548365,0.09937968,0.11312741,0.61543673,0.0003105399],"about_ca_topic_score_codex":0.0031130915,"about_ca_topic_score_gemma":0.004583529,"teacher_disagreement_score":0.0073809647,"about_ca_system_score_codex":0.00077678135,"about_ca_system_score_gemma":0.00052099774,"threshold_uncertainty_score":0.02469176},"labels":[],"label_agreement":null},{"id":"W4394792605","doi":"10.1007/978-3-031-58072-7_10","title":"Sampling Gene Adjacencies and Geodesic Points of Random Genomes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Genome; Geodesic; Set (abstract data type); Combinatorics; Breakpoint; Construct (python library); Mathematics; Gene; Biology; Computer science; Genetics; Geometry","score_opus":0.015875031682795904,"score_gpt":0.24092682373111507,"score_spread":0.22505179204831915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792605","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.4740371,0.00072100264,0.5169532,0.00040368093,0.000063844374,0.000104809216,0.0004323335,0.0005898015,0.006694236],"genre_scores_gemma":[0.7876879,0.0004597319,0.20531797,0.00009985978,0.000084969455,0.00014353858,0.0013536087,0.0003075478,0.00454492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00034910673,0.00002540325,0.00015748714,0.00015820579,0.00006121216],"domain_scores_gemma":[0.99408096,0.0048353374,0.0002888051,0.00033629205,0.00021061876,0.00024806734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439367,0.00055254897,0.0009612857,0.0024629296,0.0007202231,0.0011170965,0.0024288564,0.0013094996,0.0030737212],"category_scores_gemma":[0.012535106,0.0010216283,0.00089275255,0.0021387374,0.0017412613,0.001947719,0.0019328422,0.0010955966,0.00032602428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043404452,0.00007154134,0.005606724,0.00016962354,0.00009759108,0.00020330382,0.0004203399,0.75064844,0.0038118032,0.18869445,0.0022493552,0.047592796],"study_design_scores_gemma":[0.000033284414,0.000037462414,0.00079859135,0.000016271992,0.00001040248,0.00007066209,0.00007019409,0.86331326,0.0007194245,0.13425164,0.00066305633,0.000015625417],"about_ca_topic_score_codex":0.0034863902,"about_ca_topic_score_gemma":0.004024494,"teacher_disagreement_score":0.0034863902,"about_ca_system_score_codex":0.0013984911,"about_ca_system_score_gemma":0.00045603022,"threshold_uncertainty_score":0.010282636},"labels":[],"label_agreement":null},{"id":"W4394792608","doi":"10.1007/978-3-031-58072-7_5","title":"REvolutionH-tl: Reconstruction of Evolutionary Histories tool","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Similarity (geometry); Tree (set theory); Graph; Sequence (biology); Theoretical computer science; Gene; Event (particle physics); Algorithm; Artificial intelligence; Combinatorics; Biology; Genetics; Mathematics; Physics; Astrophysics","score_opus":0.009145637294253679,"score_gpt":0.2134006332808126,"score_spread":0.2042549959865589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792608","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00959565,0.0006507123,0.7959063,0.0003283539,0.00036711272,0.00008811239,0.019224925,0.16442637,0.009412447],"genre_scores_gemma":[0.07995697,0.00074349047,0.84595,0.00022668908,0.00015198386,0.0004563411,0.034597225,0.032053407,0.00586381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00009624443,0.000023376337,0.00012874408,0.00007405994,0.0000364857],"domain_scores_gemma":[0.9988224,0.0007946281,0.000048482358,0.00024293644,0.000045771994,0.000045838042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009055815,0.001110295,0.0010325286,0.002787908,0.0007921831,0.0021326218,0.0025196164,0.0008627179,0.044449337],"category_scores_gemma":[0.0035819428,0.0010692013,0.0021530543,0.0020337377,0.00077700644,0.0016755785,0.0019879502,0.0022970398,0.014378997],"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.0009595772,0.00015414252,0.0053234426,0.0023974574,0.000592006,0.00094695715,0.0011284155,0.046082884,0.01633851,0.11195742,0.3130976,0.5010216],"study_design_scores_gemma":[0.0005007185,0.000121389,0.0029965807,0.0003167094,0.0003466064,0.001149305,0.00034090196,0.3181824,0.018246686,0.2309434,0.4267284,0.00012690692],"about_ca_topic_score_codex":0.0012651911,"about_ca_topic_score_gemma":0.0017905349,"teacher_disagreement_score":0.044449337,"about_ca_system_score_codex":0.00038693205,"about_ca_system_score_gemma":0.0007566578,"threshold_uncertainty_score":0.1486978},"labels":[],"label_agreement":null},{"id":"W4394828285","doi":"10.1007/978-3-031-58547-0","title":"Advances in Intelligent Data Analysis XXII","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Data Processing Techniques","field":"Engineering","cited_by":5,"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":"Université de Namur; Högskolan i Halmstad; Région Normandie; Université François-Rabelais; Eötvös Loránd Tudományegyetem; Instituto Politécnico do Porto; Universität Mannheim; Masarykova Univerzita; Stockholms Universitet; Universidade do Porto; Université de Caen Normandie; Universidade de Coimbra; Universität Bielefeld; Centre National de la Recherche Scientifique; Université de Strasbourg; Universiteit Gent; Universidade do Minho; Université d'Orléans; Universidad Pública de Navarra; Kungliga Tekniska Högskolan; Télécom Paris; Universiteit Utrecht; KU Leuven; Philipps-Universität Marburg; Forschungszentrum Jülich; Università degli Studi di Torino; Università degli Studi di Trento; Dalhousie University; Deutsches Elektronen-Synchrotron; Technische Universiteit Delft; Institut National des Sciences Appliquées de Lyon; Politechnika Poznańska; University of Bristol; Universidad de Granada; Institut \"Jožef Stefan\"; Universiteit Leiden; Canterbury Christ Church University; Indian National Science Academy; Itä-Suomen Yliopisto; Università degli Studi di Napoli Federico II","keywords":"Computer science","score_opus":0.020390650210017208,"score_gpt":0.30237315192621195,"score_spread":0.28198250171619477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394828285","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024081988,0.1758725,0.72153264,0.0052332436,0.009298403,0.00011906411,0.001709306,0.004878001,0.07894859],"genre_scores_gemma":[0.026094984,0.15834112,0.50811404,0.0023193727,0.009000075,0.00022619343,0.0050259386,0.0021633613,0.2887148],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990256,0.00011965368,0.000078304845,0.00018230782,0.00055721856,0.000036816073],"domain_scores_gemma":[0.9977969,0.0011259173,0.00007412478,0.0004070795,0.00052766374,0.000068395915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267309,0.0011308118,0.0016204594,0.0023261607,0.00036869227,0.0035811004,0.0010700689,0.000686159,0.025896762],"category_scores_gemma":[0.003530593,0.0006308026,0.00087008305,0.0038704185,0.00093694223,0.0035219307,0.0014418152,0.002335536,0.02332903],"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.000046523935,0.000047153757,0.00032784272,0.00057295454,0.00005747997,0.000054274416,0.00008080597,0.0021210948,0.0024461146,0.032435145,0.18373255,0.778078],"study_design_scores_gemma":[0.000010444154,0.000050368435,0.001392763,0.00041144286,0.000060191207,0.00036792096,0.00008065919,0.027166203,0.0038790384,0.09276582,0.87377656,0.00003862821],"about_ca_topic_score_codex":0.00073844154,"about_ca_topic_score_gemma":0.0007457635,"teacher_disagreement_score":0.025896762,"about_ca_system_score_codex":0.0006162405,"about_ca_system_score_gemma":0.00076830137,"threshold_uncertainty_score":0.086633265},"labels":[],"label_agreement":null},{"id":"W4394828659","doi":"10.1007/978-3-031-58553-1","title":"Advances in Intelligent Data Analysis XXII","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Data Processing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Namur; Högskolan i Halmstad; Région Normandie; Université François-Rabelais; Eötvös Loránd Tudományegyetem; Instituto Politécnico do Porto; Universität Mannheim; Masarykova Univerzita; Stockholms Universitet; Universidade do Porto; Université de Caen Normandie; Universidade de Coimbra; Universität Bielefeld; Centre National de la Recherche Scientifique; Université de Strasbourg; Universiteit Gent; Universidade do Minho; Université d'Orléans; Universidad Pública de Navarra; Kungliga Tekniska Högskolan; Télécom Paris; Universiteit Utrecht; KU Leuven; Philipps-Universität Marburg; Forschungszentrum Jülich; Università degli Studi di Torino; Università degli Studi di Trento; Dalhousie University; Deutsches Elektronen-Synchrotron; Technische Universiteit Delft; Institut National des Sciences Appliquées de Lyon; Politechnika Poznańska; University of Bristol; Universidad de Granada; Institut \"Jožef Stefan\"; Universiteit Leiden; Canterbury Christ Church University; Indian National Science Academy; Itä-Suomen Yliopisto; Università degli Studi di Napoli Federico II","keywords":"Computer science","score_opus":0.020390650210017208,"score_gpt":0.30237315192621195,"score_spread":0.28198250171619477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394828659","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024081988,0.1758725,0.72153264,0.0052332436,0.009298403,0.00011906411,0.001709306,0.004878001,0.07894859],"genre_scores_gemma":[0.026094984,0.15834112,0.50811404,0.0023193727,0.009000075,0.00022619343,0.0050259386,0.0021633613,0.2887148],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990256,0.00011965368,0.000078304845,0.00018230782,0.00055721856,0.000036816073],"domain_scores_gemma":[0.9977969,0.0011259173,0.00007412478,0.0004070795,0.00052766374,0.000068395915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267309,0.0011308118,0.0016204594,0.0023261607,0.00036869227,0.0035811004,0.0010700689,0.000686159,0.025896762],"category_scores_gemma":[0.003530593,0.0006308026,0.00087008305,0.0038704185,0.00093694223,0.0035219307,0.0014418152,0.002335536,0.02332903],"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.000046523935,0.000047153757,0.00032784272,0.00057295454,0.00005747997,0.000054274416,0.00008080597,0.0021210948,0.0024461146,0.032435145,0.18373255,0.778078],"study_design_scores_gemma":[0.000010444154,0.000050368435,0.001392763,0.00041144286,0.000060191207,0.00036792096,0.00008065919,0.027166203,0.0038790384,0.09276582,0.87377656,0.00003862821],"about_ca_topic_score_codex":0.00073844154,"about_ca_topic_score_gemma":0.0007457635,"teacher_disagreement_score":0.025896762,"about_ca_system_score_codex":0.0006162405,"about_ca_system_score_gemma":0.00076830137,"threshold_uncertainty_score":0.086633265},"labels":[],"label_agreement":null},{"id":"W4395075562","doi":"10.1007/978-981-97-2262-4","title":"Advances in Knowledge Discovery and Data Mining","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China University of Geosciences; National Cheng Kung University; National Taiwan University of Science and Technology; Università di Pisa; Uppsala Universitet; Universidad de Zaragoza; University of Dhaka; University of Illinois at Urbana-Champaign; National Taiwan University; Syddansk Universitet; Hokkaido University; National Tsing Hua University; Shanghai Jiao Tong University; Pontificia Universidade Católica do Paraná; Università degli Studi di Pavia; Shanxi University; Nanjing University of Aeronautics and Astronautics; University of Massachusetts Boston; East China Normal University; Chang Gung University; Chinese Academy of Sciences; University of Science and Technology of China; South Asian University; Nanyang Technological University; Macquarie University; University of Pittsburgh; Massey University; Indian Institute of Technology Delhi; Chang Gung Medical Foundation; National Kaohsiung University of Science and Technology; Université Paris-Est Créteil Val-de-Marne; University of Minnesota; Politecnico di Torino; Swinburne University of Technology; McMaster University; Santa Clara University; Nanjing University; New Mexico State University; University of Texas at Arlington; Deakin University; University of Maryland, Baltimore County; Georgia State University; Arizona State University; Budapesti Műszaki és Gazdaságtudományi Egyetem; Ohio State University","keywords":"Computer science; Knowledge extraction; Data science; Data mining; Information retrieval","score_opus":0.02452480294645317,"score_gpt":0.3100417151756988,"score_spread":0.28551691222924563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395075562","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013746329,0.75534815,0.16363874,0.0074196286,0.0057490324,0.00011334662,0.0009717233,0.0013111399,0.06407352],"genre_scores_gemma":[0.016895127,0.660654,0.20566444,0.0040626726,0.009392346,0.00021166583,0.0024782156,0.0005764241,0.100065015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986527,0.00018751396,0.00010196503,0.0001838624,0.0008220495,0.000051911593],"domain_scores_gemma":[0.99456316,0.0040767845,0.00019191006,0.00044190258,0.00057613367,0.00015010165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020198412,0.0014110995,0.0023757832,0.004549782,0.00044280125,0.0040989756,0.0019823536,0.001144747,0.01582803],"category_scores_gemma":[0.006946946,0.0006919393,0.0009797189,0.009675236,0.0014767747,0.0067283823,0.0018805249,0.003052839,0.015311595],"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.000052151554,0.00008581511,0.00031620642,0.003266896,0.00012972891,0.00008435489,0.00009736895,0.0019086027,0.0010540782,0.07533087,0.1814598,0.7362142],"study_design_scores_gemma":[0.00001885285,0.000044175624,0.00053625274,0.0007956305,0.00007882926,0.00041764477,0.0000658564,0.007056772,0.0008804963,0.21195361,0.77812284,0.000029056308],"about_ca_topic_score_codex":0.000798642,"about_ca_topic_score_gemma":0.0010219121,"teacher_disagreement_score":0.01582803,"about_ca_system_score_codex":0.0008985213,"about_ca_system_score_gemma":0.0015317344,"threshold_uncertainty_score":0.052950084},"labels":[],"label_agreement":null},{"id":"W4395093887","doi":"10.1007/978-3-031-56957-9","title":"Genetic Programming","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Université de Lausanne; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Universidade de Coimbra; Ben-Gurion University of the Negev; Vysoké Učení Technické v Brně; Queen's University; Radboud Universiteit; Universidade de Lisboa; Victoria University; University of Galway; Politechnika Poznańska; Lingnan University; Victoria University of Wellington; Universidade Nova de Lisboa; Indian Council of Agricultural Research; University College London; Universidade Federal de Juiz de Fora; Dalhousie University; University of Exeter; Sveučilište u Zagrebu","keywords":"Computer science; Genetic programming; Programming language; Artificial intelligence","score_opus":0.011434735953502157,"score_gpt":0.24961093494173464,"score_spread":0.23817619898823247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395093887","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.0043338053,0.0034630885,0.55413944,0.0009540502,0.0006949569,0.00009427217,0.0003385653,0.0015280518,0.43445373],"genre_scores_gemma":[0.1040425,0.0056997244,0.33922338,0.00086978695,0.00028175602,0.00028526926,0.0012136421,0.0008971249,0.5474868],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984443,0.000028747056,0.0000046021214,0.00003584131,0.00007558075,0.000010695306],"domain_scores_gemma":[0.9998826,0.000042997555,0.0000054922357,0.000031781754,0.000029033707,0.000008015541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017401623,0.0005651232,0.0004377901,0.0005330043,0.00038778764,0.0010656075,0.0007238932,0.0007887318,0.027666276],"category_scores_gemma":[0.000705336,0.00023748171,0.0004018831,0.00080619694,0.0004749109,0.0006353072,0.0006999389,0.0010652437,0.010216473],"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.000028440973,0.000057613765,0.00019858559,0.0001961011,0.000033589728,0.00010094303,0.00009432212,0.03707563,0.0042622485,0.34406233,0.058786277,0.55510396],"study_design_scores_gemma":[0.000025882166,0.00006378283,0.00037343628,0.00021594446,0.000036196012,0.0004391171,0.000062454856,0.090844035,0.0061608176,0.3975553,0.5041944,0.000028657716],"about_ca_topic_score_codex":0.0008187637,"about_ca_topic_score_gemma":0.0011385183,"teacher_disagreement_score":0.027666276,"about_ca_system_score_codex":0.0004717294,"about_ca_system_score_gemma":0.0005309633,"threshold_uncertainty_score":0.0925529},"labels":[],"label_agreement":null},{"id":"W4395093918","doi":"10.1007/978-3-031-57725-3_11","title":"Laconic Branching Programs from the Diffie-Hellman Assumption","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Computer science; Branching (polymer chemistry); Diffie–Hellman key exchange; Theoretical computer science; Programming language; Parallel computing; Computer security; Public-key cryptography; Key exchange; Encryption","score_opus":0.016875847602112942,"score_gpt":0.24036655782663377,"score_spread":0.22349071022452083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395093918","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065632306,0.0026474092,0.3141104,0.008308632,0.0007724055,0.000075219774,0.00048691547,0.0005643914,0.6074024],"genre_scores_gemma":[0.81128633,0.0031702549,0.056712467,0.002112495,0.0011527331,0.00021751845,0.0006971227,0.0005902767,0.124060705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993686,0.00016567083,0.000023466844,0.00009273514,0.0002466559,0.00010288493],"domain_scores_gemma":[0.9983034,0.0010700169,0.000072787654,0.0002427975,0.00019570281,0.000115311916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884909,0.0006522155,0.00060443225,0.00086998224,0.0012798213,0.002925829,0.0010151762,0.0013154604,0.01184957],"category_scores_gemma":[0.0040283375,0.00039642304,0.0007298802,0.0012355484,0.003340628,0.00767792,0.0024547684,0.0064953184,0.001824763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005368452,0.0000037647958,0.000011181113,0.0000071182594,6.422644e-7,0.000010030249,0.00003825288,0.00023085596,0.00007903122,0.9970573,0.00067654357,0.0018800228],"study_design_scores_gemma":[0.0000025322695,0.0000014335172,0.000009406145,0.0000036583667,6.7253245e-7,0.00000908041,0.0000065058907,0.00072234444,0.00008457704,0.9970613,0.0020965044,0.000001960778],"about_ca_topic_score_codex":0.0010491767,"about_ca_topic_score_gemma":0.0006743248,"teacher_disagreement_score":0.01184957,"about_ca_system_score_codex":0.0021728291,"about_ca_system_score_gemma":0.0011425818,"threshold_uncertainty_score":0.039640784},"labels":[],"label_agreement":null},{"id":"W4395093967","doi":"10.1007/978-3-031-57725-3_12","title":"Rate-1 Fully Local Somewhere Extractable Hashing from DDH","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hash function; Computer security","score_opus":0.01355304379525028,"score_gpt":0.23344386112954613,"score_spread":0.21989081733429586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395093967","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.031683348,0.003045029,0.9211716,0.000879697,0.0007662517,0.00043652774,0.0018890607,0.010460648,0.029667718],"genre_scores_gemma":[0.54288054,0.0015402016,0.38740224,0.0010425402,0.0007794642,0.0006748268,0.004491851,0.0014777785,0.059710573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982533,0.00023562007,0.00011555007,0.00024320661,0.0009287507,0.00022353507],"domain_scores_gemma":[0.99816006,0.00033179438,0.00008233386,0.0011920842,0.00017436096,0.000059386108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007397178,0.0008597964,0.0016168178,0.0008565345,0.00073438673,0.0015582289,0.0017903041,0.0010332922,0.014945414],"category_scores_gemma":[0.0034560876,0.0005314383,0.00071159506,0.0014194173,0.0009884222,0.0034745766,0.006080781,0.0018083474,0.008213344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010298259,0.00020387393,0.0008017914,0.00090951787,0.00009719887,0.00022500406,0.00033178733,0.026056247,0.03378355,0.23024204,0.047881063,0.6584381],"study_design_scores_gemma":[0.00034919876,0.0007501717,0.0012138436,0.00027899185,0.00016339167,0.0015755157,0.00019820395,0.23971574,0.08132636,0.57186574,0.10232254,0.00024026175],"about_ca_topic_score_codex":0.0003618575,"about_ca_topic_score_gemma":0.0005717185,"teacher_disagreement_score":0.014945414,"about_ca_system_score_codex":0.0008200981,"about_ca_system_score_gemma":0.0011814254,"threshold_uncertainty_score":0.04999739},"labels":[],"label_agreement":null},{"id":"W4395097828","doi":"10.1007/978-3-031-57537-2","title":"Foundations and Practice of Security","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Polytechnique Montréal; Université Laval","funders":"University at Albany; Technische Universiteit Eindhoven; Fondazione Bruno Kessler; Concordia University; Agence Nationale de la Recherche; Mount Royal University; Université du Québec en Outaouais; Università degli Studi di Trento; University of Ottawa; Université Laval","keywords":"Computer science; Computer security","score_opus":0.020307509812417603,"score_gpt":0.3264609024012929,"score_spread":0.3061533925888753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395097828","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061714686,0.026292885,0.13775183,0.057265468,0.0017430932,0.000106765794,0.0001860218,0.00017279547,0.7703096],"genre_scores_gemma":[0.8020834,0.017076304,0.07249166,0.0050995573,0.002309438,0.0006728774,0.0002051994,0.00020945503,0.09985215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950654,0.002802193,0.00020820189,0.0006146298,0.0009469274,0.00036273673],"domain_scores_gemma":[0.99412835,0.0034384292,0.00031530927,0.0012376178,0.0005836483,0.00029662205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005636312,0.00079245795,0.0007561993,0.0017647292,0.0033124574,0.009134248,0.0018627394,0.004303364,0.016310057],"category_scores_gemma":[0.008876681,0.00061183254,0.0005960714,0.0020601244,0.034338,0.009813134,0.0036323573,0.0051942472,0.0028057364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011683542,0.000003619063,0.00002507692,0.000011642882,9.888383e-7,0.0000041997923,0.00027474624,0.00009625351,0.000009610222,0.99586356,0.0017557141,0.001953468],"study_design_scores_gemma":[0.000003071099,0.0000029124537,0.000039777806,0.00004631827,0.0000013278553,0.000015481186,0.00026807713,0.00024788588,0.000021651147,0.9583825,0.04096893,0.000002085184],"about_ca_topic_score_codex":0.003974376,"about_ca_topic_score_gemma":0.002743105,"teacher_disagreement_score":0.016310057,"about_ca_system_score_codex":0.004784209,"about_ca_system_score_gemma":0.005610087,"threshold_uncertainty_score":0.05456263},"labels":[],"label_agreement":null},{"id":"W4395097865","doi":"10.1007/978-3-031-57537-2_17","title":"Unmasking of Maskware: Detection and Prevention of Next-Generation Mobile Crypto-Ransomware","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Queen's University","funders":"","keywords":"Ransomware; Computer science; Mobile malware; Malware; Computer security; Android (operating system); Encryption; Cryptography; Mobile device; Embedded system; Operating system","score_opus":0.022583546951156143,"score_gpt":0.26504359709099545,"score_spread":0.24246005013983932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395097865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45008844,0.013745395,0.46241528,0.0021670794,0.0010554997,0.0003848482,0.00033727498,0.0053476733,0.06445858],"genre_scores_gemma":[0.86498845,0.0026794095,0.10334806,0.00046508719,0.0001571125,0.000039298284,0.00022022413,0.0001727847,0.027929502],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993285,0.000054341035,0.000019063422,0.00009368108,0.0004110725,0.00009332467],"domain_scores_gemma":[0.9990171,0.0002996955,0.00021578003,0.00020324044,0.00021711101,0.000047084308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034012116,0.0008239488,0.00048913347,0.0009456947,0.0004413133,0.00090535515,0.00092826807,0.0016539461,0.0027753029],"category_scores_gemma":[0.0017756916,0.00038696022,0.0003774306,0.00031259764,0.0005847305,0.0016366052,0.0008090829,0.0011731632,0.0020169301],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027537343,0.00022461313,0.0060568936,0.00031440915,0.000054498967,0.0010149488,0.00032586654,0.008390959,0.14279388,0.013197439,0.010570097,0.816781],"study_design_scores_gemma":[0.000033178578,0.0012409032,0.012601459,0.00039029794,0.00017617222,0.014749296,0.00035081466,0.44795388,0.44938943,0.01731829,0.055672195,0.00012406263],"about_ca_topic_score_codex":0.00055789977,"about_ca_topic_score_gemma":0.000994134,"teacher_disagreement_score":0.0027753029,"about_ca_system_score_codex":0.00030655361,"about_ca_system_score_gemma":0.00050163403,"threshold_uncertainty_score":0.0092843175},"labels":[],"label_agreement":null},{"id":"W4395097896","doi":"10.1007/978-3-031-57537-2_14","title":"A BERT-Based Framework for Automated Extraction of Behavioral Indicators of Compromise from Security Incident Reports","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Compromise; Computer security; Behavioral modeling; Artificial intelligence; Task (project management); Field (mathematics); Machine learning","score_opus":0.013380744125604293,"score_gpt":0.2911895890264998,"score_spread":0.27780884490089547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395097896","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.0039283875,0.00021593978,0.94821846,0.00013148546,0.000047079095,0.00026053865,0.004083786,0.04149685,0.0016174816],"genre_scores_gemma":[0.07134322,0.00021340625,0.9107185,0.00012226209,0.00005755755,0.0003705039,0.011389772,0.0010137691,0.004771034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898034,0.00014355232,0.000098668555,0.00023321918,0.00045952824,0.00008455884],"domain_scores_gemma":[0.997983,0.00081262225,0.00024950155,0.00030597657,0.00051473634,0.0001341348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013313377,0.0016239354,0.0012236853,0.004977407,0.0007510379,0.0021534695,0.0020389985,0.0011289396,0.0087203365],"category_scores_gemma":[0.004314448,0.0007022116,0.0014132244,0.0035681517,0.00043334326,0.0020111746,0.0017783906,0.0009991223,0.006704905],"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.00096680236,0.0005115148,0.010704676,0.0008698835,0.0003536097,0.00096130813,0.00039012538,0.078229375,0.028846823,0.024747428,0.061595842,0.79182255],"study_design_scores_gemma":[0.00004115327,0.00010136306,0.0033662303,0.00007052164,0.000075154916,0.00038252416,0.00012559463,0.928029,0.013192504,0.021969238,0.032576457,0.000070244096],"about_ca_topic_score_codex":0.012797408,"about_ca_topic_score_gemma":0.023851482,"teacher_disagreement_score":0.012797408,"about_ca_system_score_codex":0.0009575941,"about_ca_system_score_gemma":0.0017751795,"threshold_uncertainty_score":0.02917242},"labels":[],"label_agreement":null},{"id":"W4395097906","doi":"10.1007/978-3-031-57537-2_18","title":"Automated Attacker Behaviour Classification Using Threat Intelligence Insights","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Thales (Canada); Polytechnique Montréal","funders":"","keywords":"Honeypot; Computer science; Computer security; Sophistication; Leverage (statistics); Cyber threats; Process (computing); The Internet; Data science; Artificial intelligence; World Wide Web","score_opus":0.041577456951100766,"score_gpt":0.2898681802866881,"score_spread":0.24829072333558733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395097906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3492071,0.0029007623,0.6027407,0.0010239786,0.00026504975,0.00041122452,0.002261045,0.005796016,0.03539411],"genre_scores_gemma":[0.8813005,0.00095297507,0.10508998,0.000117475945,0.00011200262,0.000077132005,0.0028407637,0.0001315874,0.0093774535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945813,0.00009073486,0.000024460673,0.00009943289,0.00024432127,0.00008286343],"domain_scores_gemma":[0.9990742,0.00038565096,0.00013460098,0.00011178262,0.00024426144,0.000049470582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004942295,0.0010411856,0.0006416781,0.0029547166,0.0003223234,0.001659541,0.0006189482,0.000634007,0.002020221],"category_scores_gemma":[0.0021694687,0.00024308216,0.0006779443,0.0012457062,0.00022183034,0.0013262433,0.00070875423,0.0008736673,0.002252846],"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.0002585292,0.0004939368,0.045511544,0.00021049088,0.00013909693,0.0004888688,0.0002726392,0.04586264,0.023310231,0.006307871,0.013937459,0.86320657],"study_design_scores_gemma":[0.000010183951,0.00015792713,0.020338701,0.00007330166,0.00008852076,0.0007567616,0.0002509932,0.951058,0.009851454,0.011227181,0.0061518624,0.00003512379],"about_ca_topic_score_codex":0.0012013717,"about_ca_topic_score_gemma":0.0020671997,"teacher_disagreement_score":0.0029547166,"about_ca_system_score_codex":0.00041157415,"about_ca_system_score_gemma":0.0003595858,"threshold_uncertainty_score":0.0067582726},"labels":[],"label_agreement":null},{"id":"W4395097921","doi":"10.1007/978-3-031-57537-2_15","title":"Enhancing Code Security Through Open-Source Large Language Models: A Comparative Study","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"University of Saskatchewan","funders":"","keywords":"Computer science; Strengths and weaknesses; Code (set theory); Vulnerability (computing); Code review; Source code; Static program analysis; Computer security; Data science; Software engineering; Programming language; Software; Software development","score_opus":0.03903566815580141,"score_gpt":0.3290575166046351,"score_spread":0.2900218484488337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395097921","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.9520855,0.0018976543,0.020128535,0.0009789994,0.000033755045,0.000107432614,0.00011243454,0.00039752477,0.024258116],"genre_scores_gemma":[0.98842454,0.00080015016,0.007948113,0.00007997072,0.000009683931,0.000042686454,0.00013526248,0.0001629641,0.0023966678],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9934604,0.0035036015,0.00024028547,0.00032906962,0.002204807,0.00026175287],"domain_scores_gemma":[0.92840046,0.055233143,0.004353084,0.005900087,0.005323053,0.0007900597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007424914,0.00038882912,0.0003527603,0.0014401363,0.00063847756,0.003292751,0.0012162935,0.0009181332,0.0037177538],"category_scores_gemma":[0.045717593,0.00024991212,0.00046665184,0.0013740322,0.0020888478,0.0077310014,0.0023230552,0.0015247558,0.00068462593],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008548188,0.005580978,0.052181523,0.0025042004,0.00036962962,0.0006867093,0.030617377,0.02685591,0.037225027,0.09169578,0.006148459,0.7375862],"study_design_scores_gemma":[0.0014910455,0.02356984,0.1653396,0.003142987,0.0028373348,0.0044177393,0.07253101,0.32064873,0.13300034,0.14732093,0.12505823,0.0006423404],"about_ca_topic_score_codex":0.001969281,"about_ca_topic_score_gemma":0.0021320619,"teacher_disagreement_score":0.007424914,"about_ca_system_score_codex":0.0019321083,"about_ca_system_score_gemma":0.0017120065,"threshold_uncertainty_score":0.039267182},"labels":[],"label_agreement":null},{"id":"W4395097934","doi":"10.1007/978-3-031-57537-2_11","title":"Web Scams Detection System","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"IBM (Canada); University of Ottawa","funders":"","keywords":"Computer science; Blacklist; Web crawler; World Wide Web; Web page; Sample (material); Information retrieval; Search engine; Web search engine; Focus (optics); Web application; Web search query","score_opus":0.011326027148509804,"score_gpt":0.21693271448504564,"score_spread":0.20560668733653584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395097934","genre_codex":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20279928,0.0021690545,0.26958522,0.0007729753,0.00060182996,0.0017801361,0.011232839,0.39390126,0.1171574],"genre_scores_gemma":[0.7554111,0.0006050175,0.08410783,0.0009447177,0.00038660612,0.00043518725,0.014669938,0.0017674209,0.1416722],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996592,0.000030194531,0.000021514288,0.00008763162,0.00017180067,0.000029573404],"domain_scores_gemma":[0.9992004,0.00009058792,0.0000840928,0.0001683174,0.00037863947,0.000077949335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000313398,0.00061205507,0.00065926515,0.0023870028,0.00047073848,0.0008135895,0.0005462801,0.0005682687,0.014504943],"category_scores_gemma":[0.000689038,0.00021971526,0.00024341242,0.0005013107,0.00010664566,0.0007425277,0.00043504356,0.00039795425,0.013538585],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010488345,0.00090360973,0.027094677,0.00032590685,0.00013147299,0.0006756761,0.000112278416,0.0041026426,0.054573793,0.0017711418,0.21792427,0.6913357],"study_design_scores_gemma":[0.00027645248,0.0009241265,0.083778255,0.00016566984,0.0003716564,0.0030693794,0.00014820384,0.5504323,0.17157318,0.0040278817,0.18504715,0.00018582758],"about_ca_topic_score_codex":0.0017345374,"about_ca_topic_score_gemma":0.0019005953,"teacher_disagreement_score":0.014504943,"about_ca_system_score_codex":0.00029344417,"about_ca_system_score_gemma":0.0003330961,"threshold_uncertainty_score":0.048523843},"labels":[],"label_agreement":null},{"id":"W4395098119","doi":"10.1007/978-981-97-2242-6","title":"Advances in Knowledge Discovery and Data Mining","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"China University of Geosciences; National Cheng Kung University; National Taiwan University of Science and Technology; Università di Pisa; Uppsala Universitet; Universidad de Zaragoza; University of Dhaka; University of Illinois at Urbana-Champaign; National Taiwan University; Syddansk Universitet; Hokkaido University; National Tsing Hua University; Shanghai Jiao Tong University; Pontificia Universidade Católica do Paraná; Università degli Studi di Pavia; Shanxi University; Nanjing University of Aeronautics and Astronautics; University of Massachusetts Boston; East China Normal University; Chang Gung University; Chinese Academy of Sciences; University of Science and Technology of China; South Asian University; Nanyang Technological University; Macquarie University; University of Pittsburgh; Massey University; Indian Institute of Technology Delhi; Chang Gung Medical Foundation; National Kaohsiung University of Science and Technology; Université Paris-Est Créteil Val-de-Marne; University of Minnesota; Politecnico di Torino; Swinburne University of Technology; McMaster University; Santa Clara University; Nanjing University; New Mexico State University; University of Texas at Arlington; Deakin University; University of Maryland, Baltimore County; Georgia State University; Arizona State University; Budapesti Műszaki és Gazdaságtudományi Egyetem; Ohio State University","keywords":"Computer science; Knowledge extraction; Data science; Data mining; Information retrieval","score_opus":0.02452480294645317,"score_gpt":0.3100417151756988,"score_spread":0.28551691222924563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098119","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013746329,0.75534815,0.16363874,0.0074196286,0.0057490324,0.00011334662,0.0009717233,0.0013111399,0.06407352],"genre_scores_gemma":[0.016895127,0.660654,0.20566444,0.0040626726,0.009392346,0.00021166583,0.0024782156,0.0005764241,0.100065015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986527,0.00018751396,0.00010196503,0.0001838624,0.0008220495,0.000051911593],"domain_scores_gemma":[0.99456316,0.0040767845,0.00019191006,0.00044190258,0.00057613367,0.00015010165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020198412,0.0014110995,0.0023757832,0.004549782,0.00044280125,0.0040989756,0.0019823536,0.001144747,0.01582803],"category_scores_gemma":[0.006946946,0.0006919393,0.0009797189,0.009675236,0.0014767747,0.0067283823,0.0018805249,0.003052839,0.015311595],"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.000052151554,0.00008581511,0.00031620642,0.003266896,0.00012972891,0.00008435489,0.00009736895,0.0019086027,0.0010540782,0.07533087,0.1814598,0.7362142],"study_design_scores_gemma":[0.00001885285,0.000044175624,0.00053625274,0.0007956305,0.00007882926,0.00041764477,0.0000658564,0.007056772,0.0008804963,0.21195361,0.77812284,0.000029056308],"about_ca_topic_score_codex":0.000798642,"about_ca_topic_score_gemma":0.0010219121,"teacher_disagreement_score":0.01582803,"about_ca_system_score_codex":0.0008985213,"about_ca_system_score_gemma":0.0015317344,"threshold_uncertainty_score":0.052950084},"labels":[],"label_agreement":null},{"id":"W4395098143","doi":"10.1007/978-981-97-2266-2_10","title":"Graph Neural Network Approach to Semantic Type Detection in Tables","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Table (database); Graph; Security token; Artificial intelligence; Focus (optics); Key (lock); Artificial neural network; Data mining; Natural language processing; Machine learning; Theoretical computer science","score_opus":0.015491846873628225,"score_gpt":0.23586226254703144,"score_spread":0.2203704156734032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024145579,0.0008778765,0.953221,0.0005482698,0.0002481921,0.00012044395,0.004358427,0.005383043,0.011097155],"genre_scores_gemma":[0.31808636,0.00092431344,0.6528161,0.0002204352,0.00012990748,0.00009927909,0.00688129,0.0006265002,0.020215796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966526,0.000045699137,0.000023625722,0.0001131223,0.000116183684,0.000036192767],"domain_scores_gemma":[0.99929345,0.00030472234,0.000050947234,0.000109497465,0.00021454641,0.000026812995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039921707,0.00041675384,0.00055825803,0.0025749137,0.0005298869,0.0017464901,0.0013876976,0.00072490174,0.008599093],"category_scores_gemma":[0.0024873635,0.00038500546,0.00091074046,0.0027017337,0.0003610515,0.002756302,0.0006252364,0.0007802745,0.002001516],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037030314,0.00014454556,0.005296677,0.00039291554,0.00012296354,0.00028011695,0.00017676901,0.13949174,0.010711644,0.097811714,0.03427416,0.71092653],"study_design_scores_gemma":[0.000007721683,0.00002104499,0.00095384254,0.000047038244,0.000048313246,0.000106004845,0.00007644846,0.8968034,0.006421697,0.08408616,0.011411337,0.000017005023],"about_ca_topic_score_codex":0.013120629,"about_ca_topic_score_gemma":0.019999642,"teacher_disagreement_score":0.013120629,"about_ca_system_score_codex":0.0011456367,"about_ca_system_score_gemma":0.000750516,"threshold_uncertainty_score":0.02876687},"labels":[],"label_agreement":null},{"id":"W4395098146","doi":"10.1007/978-981-97-2242-6_16","title":"Class Ratio and Its Implications for Reproducibility and Performance in Record Linkage","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision 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 Guelph","funders":"","keywords":"Computer science; Record linkage; Pairwise comparison; Matching (statistics); Linkage (software); Classifier (UML); Data mining; Class (philosophy); Test data; Artificial intelligence; Information retrieval; Statistics; Mathematics","score_opus":0.13093958025310867,"score_gpt":0.3785712184593527,"score_spread":0.24763163820624404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101354115,0.008004916,0.85156775,0.009026157,0.0013188091,0.00026337913,0.0012429244,0.0034101077,0.023811858],"genre_scores_gemma":[0.6854679,0.0022598854,0.29867795,0.00079491886,0.0016771611,0.00042702275,0.00087015156,0.0016322642,0.008192775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.896337,0.056456894,0.0058617163,0.010744406,0.028997976,0.0016021435],"domain_scores_gemma":[0.22371614,0.6977351,0.012439395,0.046804458,0.017905314,0.0013995762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.10575862,0.00079631666,0.002278552,0.0057924455,0.00218289,0.009570444,0.0059206313,0.0039361045,0.0057589416],"category_scores_gemma":[0.5551079,0.0010189891,0.0014076688,0.010496583,0.0057876282,0.016218621,0.003937359,0.00409094,0.0020145243],"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.0017868102,0.00045851176,0.090132214,0.00060828327,0.00051320234,0.0003526149,0.0025831203,0.038529515,0.0042297747,0.29695553,0.019271854,0.5445786],"study_design_scores_gemma":[0.00023827703,0.00061109924,0.0278029,0.0002477101,0.00046714663,0.002568934,0.0011358307,0.3090359,0.018058773,0.6271628,0.012334697,0.00033594485],"about_ca_topic_score_codex":0.0018729379,"about_ca_topic_score_gemma":0.001041824,"teacher_disagreement_score":0.10575862,"about_ca_system_score_codex":0.00300211,"about_ca_system_score_gemma":0.0027767746,"threshold_uncertainty_score":0.55931175},"labels":[],"label_agreement":null},{"id":"W4395098215","doi":"10.1007/978-981-97-2253-2","title":"Advances in Knowledge Discovery and Data Mining","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"China University of Geosciences; National Cheng Kung University; National Taiwan University of Science and Technology; Università di Pisa; Uppsala Universitet; Universidad de Zaragoza; University of Dhaka; University of Illinois at Urbana-Champaign; National Taiwan University; Syddansk Universitet; Hokkaido University; National Tsing Hua University; Shanghai Jiao Tong University; Pontificia Universidade Católica do Paraná; Università degli Studi di Pavia; Shanxi University; Nanjing University of Aeronautics and Astronautics; University of Massachusetts Boston; East China Normal University; Chang Gung University; Chinese Academy of Sciences; University of Science and Technology of China; South Asian University; Nanyang Technological University; Macquarie University; University of Pittsburgh; Massey University; Indian Institute of Technology Delhi; Chang Gung Medical Foundation; National Kaohsiung University of Science and Technology; Université Paris-Est Créteil Val-de-Marne; University of Minnesota; Politecnico di Torino; Swinburne University of Technology; McMaster University; Santa Clara University; Nanjing University; New Mexico State University; University of Texas at Arlington; Deakin University; University of Maryland, Baltimore County; Georgia State University; Arizona State University; Budapesti Műszaki és Gazdaságtudományi Egyetem; Ohio State University","keywords":"Computer science; Knowledge extraction; Data science; Data mining; Information retrieval","score_opus":0.02452480294645317,"score_gpt":0.3100417151756988,"score_spread":0.28551691222924563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098215","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013746329,0.75534815,0.16363874,0.0074196286,0.0057490324,0.00011334662,0.0009717233,0.0013111399,0.06407352],"genre_scores_gemma":[0.016895127,0.660654,0.20566444,0.0040626726,0.009392346,0.00021166583,0.0024782156,0.0005764241,0.100065015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986527,0.00018751396,0.00010196503,0.0001838624,0.0008220495,0.000051911593],"domain_scores_gemma":[0.99456316,0.0040767845,0.00019191006,0.00044190258,0.00057613367,0.00015010165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020198412,0.0014110995,0.0023757832,0.004549782,0.00044280125,0.0040989756,0.0019823536,0.001144747,0.01582803],"category_scores_gemma":[0.006946946,0.0006919393,0.0009797189,0.009675236,0.0014767747,0.0067283823,0.0018805249,0.003052839,0.015311595],"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.000052151554,0.00008581511,0.00031620642,0.003266896,0.00012972891,0.00008435489,0.00009736895,0.0019086027,0.0010540782,0.07533087,0.1814598,0.7362142],"study_design_scores_gemma":[0.00001885285,0.000044175624,0.00053625274,0.0007956305,0.00007882926,0.00041764477,0.0000658564,0.007056772,0.0008804963,0.21195361,0.77812284,0.000029056308],"about_ca_topic_score_codex":0.000798642,"about_ca_topic_score_gemma":0.0010219121,"teacher_disagreement_score":0.01582803,"about_ca_system_score_codex":0.0008985213,"about_ca_system_score_gemma":0.0015317344,"threshold_uncertainty_score":0.052950084},"labels":[],"label_agreement":null},{"id":"W4395098224","doi":"10.1007/978-981-97-2266-2_20","title":"Kernel Representation Learning with Dynamic Regime Discovery for Time Series Forecasting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Université de Sherbrooke","funders":"","keywords":"Interpretability; Computer science; Representation (politics); Kernel (algebra); Time series; Series (stratigraphy); Machine learning; Artificial intelligence; AKA; Regression; Data mining; Kernel regression; Statistics; Mathematics","score_opus":0.014281873746429393,"score_gpt":0.23422209670531374,"score_spread":0.21994022295888435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059423638,0.00084459985,0.9917991,0.00015890309,0.00007190267,0.000011764943,0.00004267375,0.0005493469,0.00057942665],"genre_scores_gemma":[0.4880076,0.0020456186,0.49425608,0.00019858769,0.00033063104,0.00016141338,0.00076857896,0.00046313944,0.013768354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00027546094,0.00004177613,0.00012368053,0.00010508148,0.000060483453],"domain_scores_gemma":[0.9977277,0.0015278645,0.00012360916,0.00034483647,0.000218595,0.000057447152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018695492,0.00061232434,0.0013690575,0.0007112303,0.00036870124,0.001205936,0.0014877681,0.0015194569,0.0032236944],"category_scores_gemma":[0.0065459535,0.00060686644,0.0010169089,0.001395475,0.00064325234,0.0024712721,0.0018880203,0.0030443901,0.0014651931],"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.00028818857,0.00020887377,0.00075752515,0.00022237867,0.00018626954,0.00008479358,0.000116096315,0.3108813,0.0057610213,0.07028365,0.00891408,0.6022959],"study_design_scores_gemma":[0.0000034074778,0.000011256442,0.000074531745,0.0000037984785,0.0000072359267,0.000008441982,0.0000032235766,0.98409516,0.0003411972,0.014949999,0.00049558235,0.0000062701565],"about_ca_topic_score_codex":0.0022188493,"about_ca_topic_score_gemma":0.0016418126,"teacher_disagreement_score":0.0032236944,"about_ca_system_score_codex":0.00062742,"about_ca_system_score_gemma":0.0006929084,"threshold_uncertainty_score":0.010784328},"labels":[],"label_agreement":null},{"id":"W4395098232","doi":"10.1007/978-981-97-2266-2_1","title":"FR$$^3$$LS: A Forecasting Model with Robust and Reduced Redundancy Latent Series","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Scalability; Robustness (evolution); Factorization; Autoencoder; Matrix decomposition; Redundancy (engineering); Series (stratigraphy); Artificial intelligence; Algorithm; Machine learning; Data mining; Deep learning","score_opus":0.031549578552882124,"score_gpt":0.21785058020930922,"score_spread":0.1863010016564271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010464384,0.00022699262,0.9843739,0.00047539413,0.0001508096,0.000022069542,0.0004299957,0.0013913206,0.0024651992],"genre_scores_gemma":[0.50081307,0.000649759,0.44896692,0.00047015428,0.0005309044,0.00022436619,0.0022736813,0.0009373973,0.045133743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997875,0.00006075912,0.000010324347,0.00006845333,0.00004842029,0.00002448211],"domain_scores_gemma":[0.9997167,0.00012790399,0.000030204215,0.000045672157,0.00006331005,0.000016316655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300253,0.000669346,0.0006162035,0.0003770983,0.00024024396,0.0010384385,0.0011113748,0.0010774272,0.006397901],"category_scores_gemma":[0.0018817236,0.00035579526,0.0006938815,0.0006089868,0.0003727011,0.0014844949,0.0007903388,0.0013034497,0.0030580491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678938,0.00008491498,0.0007486582,0.00013447173,0.00012371846,0.00016030436,0.00007302001,0.60287935,0.009561186,0.060501643,0.020570561,0.30489433],"study_design_scores_gemma":[0.0000049383198,0.000015007295,0.00009717009,0.000003951006,0.0000068937134,0.000013486866,0.0000020418884,0.98884135,0.000742019,0.008762552,0.0015020935,0.000008561343],"about_ca_topic_score_codex":0.005224835,"about_ca_topic_score_gemma":0.0049177944,"teacher_disagreement_score":0.006397901,"about_ca_system_score_codex":0.0004757266,"about_ca_system_score_gemma":0.0005566152,"threshold_uncertainty_score":0.021403134},"labels":[],"label_agreement":null},{"id":"W4395109839","doi":"10.1007/978-3-031-57540-2_4","title":"Evaluating Deep Learning for Cross-Domains Fake News Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Fake news; Internet privacy","score_opus":0.05394209375717456,"score_gpt":0.38166805887658684,"score_spread":0.32772596511941227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395109839","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.87583524,0.011760909,0.089922056,0.002232653,0.0010643137,0.0002394755,0.0031838436,0.005334317,0.010427168],"genre_scores_gemma":[0.9587222,0.00091560744,0.027664052,0.0002653182,0.00022239609,0.000064685104,0.0055768355,0.0001217868,0.006447285],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778,0.00073634955,0.0001415214,0.00054205424,0.0004487948,0.0003512483],"domain_scores_gemma":[0.9876036,0.009168835,0.0005261396,0.00094603276,0.0012574639,0.0004979066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053731184,0.0021503342,0.0014610856,0.0019863113,0.0006049045,0.0015728133,0.0017065647,0.0033614552,0.0032890332],"category_scores_gemma":[0.010879372,0.00055308983,0.00085939385,0.0011324703,0.0007295829,0.0028168424,0.0020017656,0.0023212535,0.0018745502],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038671575,0.003011475,0.021250699,0.00056246074,0.000986458,0.0002518113,0.000110328336,0.26555297,0.006805464,0.0014054903,0.022032961,0.6741627],"study_design_scores_gemma":[0.00004500404,0.00031093415,0.0015439234,0.00002433769,0.00006997516,0.000047351128,0.000046661764,0.99364716,0.0030545844,0.00076660275,0.00043157363,0.000011756621],"about_ca_topic_score_codex":0.011218423,"about_ca_topic_score_gemma":0.012712075,"teacher_disagreement_score":0.011218423,"about_ca_system_score_codex":0.0016346679,"about_ca_system_score_gemma":0.0011336635,"threshold_uncertainty_score":0.028416097},"labels":[],"label_agreement":null},{"id":"W4395113230","doi":"10.1007/978-3-031-57537-2_10","title":"IntelliTweet: A Multifaceted Feature Approach to Detect Malicious Tweets","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Computer security; Pattern recognition (psychology)","score_opus":0.018278282810301756,"score_gpt":0.2424689587548898,"score_spread":0.22419067594458805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395113230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20103388,0.002098898,0.72896904,0.0006782718,0.0006693903,0.0006688001,0.017162262,0.041787263,0.0069321888],"genre_scores_gemma":[0.5612557,0.0006052024,0.400418,0.0003268841,0.00039228785,0.0004203516,0.017447058,0.0010376206,0.018096978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995024,0.00006171894,0.000030476176,0.00012171988,0.00020787159,0.00007567178],"domain_scores_gemma":[0.9992786,0.00032875626,0.000081066086,0.0001068288,0.00014486047,0.0000598026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006884571,0.001302918,0.00091651233,0.003955971,0.0005795355,0.0009491308,0.00093107024,0.00087410444,0.003348555],"category_scores_gemma":[0.0016341943,0.00031987138,0.00088011223,0.001674652,0.00023342433,0.0016256813,0.0014509473,0.000997782,0.0020884464],"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.0009800029,0.0007072368,0.01959309,0.00028499617,0.00039197312,0.0005078557,0.0002128717,0.015076687,0.040972203,0.0030535983,0.043933902,0.87428564],"study_design_scores_gemma":[0.00007821375,0.000506618,0.014825351,0.000040717394,0.00019181633,0.0005600578,0.00016930023,0.93075156,0.025683068,0.009614113,0.017488623,0.00009055846],"about_ca_topic_score_codex":0.004257469,"about_ca_topic_score_gemma":0.008632968,"teacher_disagreement_score":0.004257469,"about_ca_system_score_codex":0.00037010512,"about_ca_system_score_gemma":0.00047389363,"threshold_uncertainty_score":0.011202037},"labels":[],"label_agreement":null},{"id":"W4395113238","doi":"10.1007/978-3-031-57537-2_13","title":"Analysis of Cryptographic CVEs: Lessons Learned and Perspectives","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security","score_opus":0.028717667130575643,"score_gpt":0.29773475945744005,"score_spread":0.2690170923268644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395113238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05495362,0.044274904,0.82525265,0.010553545,0.0007944308,0.00015014704,0.0004643008,0.0014097107,0.062146753],"genre_scores_gemma":[0.69358945,0.036939654,0.23482698,0.0013113256,0.0024408887,0.00013808595,0.0012383116,0.0009310208,0.028584236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9959667,0.0010416663,0.00017737658,0.0006380392,0.0017121277,0.00046400455],"domain_scores_gemma":[0.98535013,0.008306156,0.00062962965,0.0030099775,0.0024594173,0.00024468364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035513802,0.0017708577,0.0016871096,0.0039021203,0.0009177606,0.0085876575,0.0030837478,0.0022264938,0.008419639],"category_scores_gemma":[0.017860152,0.000810436,0.0014240118,0.0033273532,0.0031534997,0.012423832,0.0016611418,0.0039558434,0.0024247076],"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.000116168456,0.00027493466,0.0063243965,0.0005958933,0.00013016915,0.0003737646,0.00037191992,0.047630664,0.003881335,0.62966114,0.014462573,0.29617706],"study_design_scores_gemma":[0.000013107233,0.00008809902,0.0023315372,0.00040724006,0.00003964868,0.0008196623,0.00041486148,0.19926874,0.005160539,0.7626634,0.028713794,0.00007936178],"about_ca_topic_score_codex":0.0020956066,"about_ca_topic_score_gemma":0.001316512,"teacher_disagreement_score":0.0085876575,"about_ca_system_score_codex":0.0025130766,"about_ca_system_score_gemma":0.001768388,"threshold_uncertainty_score":0.028166473},"labels":[],"label_agreement":null},{"id":"W4395113782","doi":"10.1007/978-3-031-57540-2_5","title":"Accurify: Automated New Testflows Generation for Attack Variants in Threat Hunting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Concordia University; Ericsson (Canada)","funders":"","keywords":"Computer science; Computer security; Artificial intelligence","score_opus":0.056137756697451434,"score_gpt":0.3139452280827616,"score_spread":0.2578074713853102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395113782","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.0303039,0.00040074086,0.8404602,0.00021324855,0.00019295613,0.00019963789,0.0013081321,0.1204309,0.006490352],"genre_scores_gemma":[0.33824602,0.00021394451,0.6375742,0.00025989872,0.00009660725,0.00026385736,0.0039038775,0.010856698,0.008584989],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881434,0.00024821097,0.00008175487,0.00030664058,0.00042720343,0.00012181649],"domain_scores_gemma":[0.9971615,0.001532458,0.00018335217,0.00068180135,0.00034005175,0.00010092995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011597117,0.0017958867,0.00075215276,0.0015878282,0.0004768326,0.0013551151,0.0025343783,0.0013723968,0.014965926],"category_scores_gemma":[0.005068708,0.0007924972,0.0012338338,0.0007165133,0.00082154834,0.0025094373,0.0015727549,0.0013567661,0.0037078585],"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.0010387308,0.00034359712,0.006393948,0.0005638497,0.0002250852,0.0007981524,0.00050407194,0.06623258,0.050415833,0.016640192,0.06214319,0.7947008],"study_design_scores_gemma":[0.00025278484,0.00034258718,0.0021076477,0.00013196682,0.00015422453,0.0010014066,0.000103641025,0.8319029,0.09336865,0.032805257,0.037720867,0.000108036555],"about_ca_topic_score_codex":0.0018342129,"about_ca_topic_score_gemma":0.0024245866,"teacher_disagreement_score":0.014965926,"about_ca_system_score_codex":0.00068171404,"about_ca_system_score_gemma":0.00071341655,"threshold_uncertainty_score":0.050065994},"labels":[],"label_agreement":null},{"id":"W4395114117","doi":"10.1007/978-3-031-57540-2","title":"Foundations and Practice of Security","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Computer science; Computer security; Software engineering; Programming language","score_opus":0.020307509812417603,"score_gpt":0.3264609024012929,"score_spread":0.3061533925888753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395114117","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061714686,0.026292885,0.13775183,0.057265468,0.0017430932,0.000106765794,0.0001860218,0.00017279547,0.7703096],"genre_scores_gemma":[0.8020834,0.017076304,0.07249166,0.0050995573,0.002309438,0.0006728774,0.0002051994,0.00020945503,0.09985215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950654,0.002802193,0.00020820189,0.0006146298,0.0009469274,0.00036273673],"domain_scores_gemma":[0.99412835,0.0034384292,0.00031530927,0.0012376178,0.0005836483,0.00029662205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005636312,0.00079245795,0.0007561993,0.0017647292,0.0033124574,0.009134248,0.0018627394,0.004303364,0.016310057],"category_scores_gemma":[0.008876681,0.00061183254,0.0005960714,0.0020601244,0.034338,0.009813134,0.0036323573,0.0051942472,0.0028057364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011683542,0.000003619063,0.00002507692,0.000011642882,9.888383e-7,0.0000041997923,0.00027474624,0.00009625351,0.000009610222,0.99586356,0.0017557141,0.001953468],"study_design_scores_gemma":[0.000003071099,0.0000029124537,0.000039777806,0.00004631827,0.0000013278553,0.000015481186,0.00026807713,0.00024788588,0.000021651147,0.9583825,0.04096893,0.000002085184],"about_ca_topic_score_codex":0.003974376,"about_ca_topic_score_gemma":0.002743105,"teacher_disagreement_score":0.016310057,"about_ca_system_score_codex":0.004784209,"about_ca_system_score_gemma":0.005610087,"threshold_uncertainty_score":0.05456263},"labels":[],"label_agreement":null},{"id":"W4395114155","doi":"10.1007/978-3-031-57537-2_4","title":"Unsupervised Clustering of Honeypot Attacks by Deep HTTP Packet Inspection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Thales (Canada); Polytechnique Montréal","funders":"","keywords":"Honeypot; Computer science; Cluster analysis; Deep packet inspection; Network packet; Artificial intelligence; Computer network","score_opus":0.01243853818763235,"score_gpt":0.23080130615105662,"score_spread":0.21836276796342427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395114155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38111132,0.0005129452,0.61205465,0.00015593851,0.00008365411,0.00015042482,0.0006391781,0.0028578767,0.0024341298],"genre_scores_gemma":[0.880416,0.00015918235,0.11246491,0.00004267404,0.00006367249,0.000079100646,0.0022328328,0.0002571881,0.0042844317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994802,0.0000943812,0.0000252324,0.00015427222,0.00013709326,0.00010877079],"domain_scores_gemma":[0.99892503,0.00035067298,0.00013988819,0.0002303546,0.00028477405,0.00006931026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046192852,0.00067394413,0.00091214647,0.0016820768,0.00036828284,0.00080125243,0.0013717636,0.0007589495,0.00075138296],"category_scores_gemma":[0.0016031044,0.00037730398,0.00077311264,0.0013243279,0.00042036318,0.00069920655,0.00097117445,0.0007432551,0.0006950357],"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.0007000233,0.0005201013,0.018920442,0.0001914535,0.0002567608,0.00026822035,0.00028233937,0.33671784,0.06410312,0.0034932455,0.008672366,0.56587404],"study_design_scores_gemma":[0.000004123965,0.000031116222,0.004301896,0.000004714003,0.00001332969,0.000052138796,0.000030756728,0.9892235,0.004217179,0.0016582772,0.00045409956,0.0000089134155],"about_ca_topic_score_codex":0.0026767012,"about_ca_topic_score_gemma":0.0041096015,"teacher_disagreement_score":0.0026767012,"about_ca_system_score_codex":0.00046381983,"about_ca_system_score_gemma":0.00041363243,"threshold_uncertainty_score":0.0053222775},"labels":[],"label_agreement":null},{"id":"W4395116903","doi":"10.1007/978-3-031-57537-2_24","title":"Hardening Systems Against Data Corruption Attacks at Design Time","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hardening (computing); Computer security; Composite material; Materials science","score_opus":0.06717173230116774,"score_gpt":0.2851707081747515,"score_spread":0.21799897587358374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395116903","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.098271064,0.0010021057,0.87291396,0.0008636788,0.0003420765,0.00030854237,0.00015074816,0.01073347,0.015414217],"genre_scores_gemma":[0.76733726,0.00059059454,0.19994484,0.0006612176,0.00018103112,0.00022947571,0.00025012737,0.0017563767,0.029049141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717534,0.0006504681,0.00021278708,0.0004170902,0.001056176,0.00048812732],"domain_scores_gemma":[0.9915978,0.0025678284,0.0008820579,0.0039638267,0.0008460422,0.00014246114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00188852,0.0009004772,0.0007017944,0.00094575336,0.0006069726,0.0020597577,0.0015004664,0.0014261664,0.008959848],"category_scores_gemma":[0.0075691133,0.000976736,0.0006270031,0.00051669613,0.0014905552,0.0038814077,0.002655141,0.0030320033,0.0030947602],"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.0009581443,0.00028372987,0.0015471963,0.001017688,0.0001654412,0.0005283869,0.0011903631,0.08342014,0.25482243,0.16667251,0.0120098265,0.47738406],"study_design_scores_gemma":[0.0002099448,0.0009658294,0.0008599433,0.00027392778,0.0002968825,0.000708178,0.00023903754,0.28381032,0.4861413,0.1546407,0.07174665,0.00010728046],"about_ca_topic_score_codex":0.00030647236,"about_ca_topic_score_gemma":0.0005074934,"teacher_disagreement_score":0.008959848,"about_ca_system_score_codex":0.00067564455,"about_ca_system_score_gemma":0.00092706113,"threshold_uncertainty_score":0.029973745},"labels":[],"label_agreement":null},{"id":"W4395117296","doi":"10.1007/978-3-031-57537-2_20","title":"Following the Obfuscation Trail: Identifying and Exploiting Obfuscation Signatures in Malicious Code","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; IBM (Canada); Polytechnique Montréal","funders":"","keywords":"Obfuscation; Computer science; Code (set theory); Computer security; Malware; Programming language","score_opus":0.021371371137490353,"score_gpt":0.2811721798111387,"score_spread":0.2598008086736483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395117296","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.17039019,0.004268021,0.7790786,0.0013485657,0.0004991223,0.00020675412,0.00057140185,0.00929092,0.03434652],"genre_scores_gemma":[0.555375,0.003979831,0.38894665,0.0003724197,0.00014809868,0.00007499259,0.0012408835,0.0019750108,0.047887165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994753,0.000057395682,0.000025476273,0.000088683795,0.00028218454,0.00007103756],"domain_scores_gemma":[0.99768424,0.0010176862,0.0002938784,0.0006004349,0.00034059767,0.00006316448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755413,0.00080545584,0.0005231767,0.0014868142,0.00069697987,0.0019678392,0.0007606797,0.0012440243,0.00345506],"category_scores_gemma":[0.0041119577,0.0006710207,0.0004889337,0.0011057899,0.0011622974,0.0040840646,0.0015770317,0.0015972554,0.0034817313],"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.00033429667,0.00012646678,0.0045099137,0.00036758222,0.000031061638,0.00060251524,0.0009214592,0.01363232,0.07528114,0.04860209,0.012456696,0.84313446],"study_design_scores_gemma":[0.000028623634,0.0005253492,0.0054263333,0.0006298353,0.00013271697,0.004702159,0.0006649209,0.38368872,0.34188408,0.17286131,0.08928152,0.00017440342],"about_ca_topic_score_codex":0.0008162822,"about_ca_topic_score_gemma":0.0012921158,"teacher_disagreement_score":0.00345506,"about_ca_system_score_codex":0.00042488155,"about_ca_system_score_gemma":0.00088210823,"threshold_uncertainty_score":0.011558354},"labels":[],"label_agreement":null},{"id":"W4395688995","doi":"10.1007/978-981-97-2387-4_26","title":"DYGL: A Unified Benchmark and Library for Dynamic Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Graph; Theoretical computer science; Cartography","score_opus":0.007923577022929977,"score_gpt":0.22022107733300206,"score_spread":0.21229750031007208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395688995","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019639019,0.002810786,0.24605739,0.0012343886,0.00090096286,0.0007039175,0.14461884,0.49559397,0.08844073],"genre_scores_gemma":[0.098919146,0.0032059725,0.30830824,0.0012815063,0.00020698435,0.0020894753,0.42964777,0.11158112,0.044759847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793917,0.00034249647,0.00019906416,0.0003553427,0.00085735694,0.00030661127],"domain_scores_gemma":[0.9966574,0.0011263359,0.00014104371,0.0010814336,0.0007535158,0.00024032188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016496661,0.003132643,0.0012445683,0.0049846293,0.0011236415,0.0027480363,0.0068097375,0.0018954247,0.047488857],"category_scores_gemma":[0.008014715,0.0015945171,0.0016751081,0.0068176524,0.0007303339,0.006075005,0.0032846984,0.0025521575,0.022610119],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061341986,0.00039163922,0.0015199861,0.0019962506,0.00011374711,0.00016577863,0.00013544297,0.028826986,0.00502618,0.028488966,0.7715543,0.16116737],"study_design_scores_gemma":[0.00089236075,0.000336182,0.0018373041,0.00043416696,0.00018646994,0.00046515456,0.00025696386,0.20496538,0.03670019,0.0728853,0.6808262,0.00021433411],"about_ca_topic_score_codex":0.010631445,"about_ca_topic_score_gemma":0.012780606,"teacher_disagreement_score":0.047488857,"about_ca_system_score_codex":0.0019321571,"about_ca_system_score_gemma":0.0025769656,"threshold_uncertainty_score":0.15886611},"labels":[],"label_agreement":null},{"id":"W4395957779","doi":"10.1007/978-3-031-59205-8_12","title":"Clique Counts for Network Similarity","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"","keywords":"Clique; Similarity (geometry); Computer science; Cluster analysis; Graph; Similarity measure; Theoretical computer science; Data mining; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.015670880399434445,"score_gpt":0.27634787012281387,"score_spread":0.26067698972337944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395957779","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.01624743,0.0031741406,0.96128726,0.0011047246,0.00034032372,0.00018189699,0.0017854506,0.0012698693,0.014608825],"genre_scores_gemma":[0.43356627,0.0039738873,0.51258695,0.0008689939,0.002934641,0.0017553807,0.008072908,0.0016392746,0.03460176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626994,0.0011989627,0.00017798968,0.0011189857,0.0010455509,0.0001884561],"domain_scores_gemma":[0.980194,0.013902927,0.0010180778,0.0030225054,0.0012812845,0.00058120966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027686448,0.0012920888,0.002764944,0.009870997,0.0017872978,0.0034255923,0.00460172,0.0024992991,0.015037677],"category_scores_gemma":[0.028024802,0.0011826673,0.0016014408,0.009444673,0.0028733723,0.0105133,0.0034738125,0.0047514304,0.0027318227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014025065,0.00013816833,0.0020843993,0.00040925006,0.00015985446,0.000104000836,0.00024892864,0.039853882,0.0012414734,0.75833726,0.023627432,0.1736551],"study_design_scores_gemma":[0.000013169238,0.000022349006,0.00077744544,0.000054063432,0.00003612839,0.00013093393,0.000053170617,0.204585,0.00042653826,0.7872766,0.0066026472,0.000021931332],"about_ca_topic_score_codex":0.0022705626,"about_ca_topic_score_gemma":0.0023653395,"teacher_disagreement_score":0.015037677,"about_ca_system_score_codex":0.0022283357,"about_ca_system_score_gemma":0.0008472145,"threshold_uncertainty_score":0.05030608},"labels":[],"label_agreement":null},{"id":"W4395957784","doi":"10.1007/978-3-031-59205-8_6","title":"Efficient Computation of K-Edge Connected Components: An Empirical Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computation; Enhanced Data Rates for GSM Evolution; Identification (biology); Key (lock); Theoretical computer science; Strengths and weaknesses; Algorithm; Artificial intelligence","score_opus":0.022347296513214317,"score_gpt":0.30400866079465416,"score_spread":0.28166136428143984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395957784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22937293,0.0016758132,0.7578351,0.0015233225,0.00012887924,0.00018155536,0.0017242224,0.001980962,0.0055772234],"genre_scores_gemma":[0.66452515,0.0006642579,0.3262016,0.0001809958,0.00016247011,0.00020186555,0.0028539875,0.0005309426,0.004678709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984444,0.0005308554,0.000079870275,0.0004344551,0.00036210014,0.00014842396],"domain_scores_gemma":[0.9657675,0.026050989,0.0008968189,0.004934647,0.0017622081,0.00058786693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022320386,0.0010996577,0.0013151867,0.0017423567,0.0011649072,0.002763326,0.0038848198,0.0019117902,0.011203766],"category_scores_gemma":[0.040919654,0.00080837315,0.0010730333,0.002690538,0.0013579717,0.006617665,0.0021704559,0.002314404,0.0019722728],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012638948,0.00060962245,0.02240851,0.000735012,0.00023754357,0.00020723198,0.00055721425,0.45388818,0.0072340076,0.11405366,0.023166971,0.37563816],"study_design_scores_gemma":[0.0000378599,0.000040907904,0.0020886422,0.000026591724,0.000033244887,0.000089299625,0.000096083495,0.93495387,0.0011221525,0.060425065,0.001073414,0.000012866217],"about_ca_topic_score_codex":0.004342347,"about_ca_topic_score_gemma":0.007693918,"teacher_disagreement_score":0.011203766,"about_ca_system_score_codex":0.0016039014,"about_ca_system_score_gemma":0.002202543,"threshold_uncertainty_score":0.037480354},"labels":[],"label_agreement":null},{"id":"W4395957817","doi":"10.1007/978-3-031-59205-8_8","title":"How to Cool a Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Iterated function; Graph; Transitive relation; Cartesian coordinate system; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Geometry","score_opus":0.011798039455449862,"score_gpt":0.24820539178769419,"score_spread":0.23640735233224433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395957817","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01227724,0.0010479395,0.91988784,0.005414348,0.0019552573,0.00023073498,0.00099175,0.008266473,0.04992839],"genre_scores_gemma":[0.1297713,0.0016830501,0.7572426,0.0027054646,0.00055413437,0.0004677654,0.0023374066,0.011520831,0.09371743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993048,0.00016504087,0.00003284244,0.00018753963,0.00021528853,0.00009452955],"domain_scores_gemma":[0.9972887,0.0009851787,0.000074338,0.0009283402,0.0005056956,0.00021774808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008861966,0.00093822373,0.00074843905,0.001051433,0.0015879989,0.0022563878,0.0012719696,0.0010061058,0.03965983],"category_scores_gemma":[0.0077243056,0.0008631809,0.0012175617,0.00080432306,0.0014220793,0.0060886447,0.003056346,0.00337394,0.011132712],"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.00016347854,0.00008478955,0.0006381817,0.0006174448,0.00011589136,0.00025646787,0.0007477113,0.024114283,0.011270856,0.46892816,0.17357086,0.31949183],"study_design_scores_gemma":[0.000034300527,0.000049464597,0.0003130415,0.00017820839,0.00007765971,0.00027847424,0.00034330128,0.055612363,0.0046740808,0.72570896,0.21269186,0.00003826263],"about_ca_topic_score_codex":0.002214584,"about_ca_topic_score_gemma":0.004494399,"teacher_disagreement_score":0.03965983,"about_ca_system_score_codex":0.00079286547,"about_ca_system_score_gemma":0.00074560713,"threshold_uncertainty_score":0.13267535},"labels":[],"label_agreement":null},{"id":"W4395959011","doi":"10.1007/978-3-031-59205-8_4","title":"Impact of Market Design and Trading Network Structure on Market Efficiency","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Computer science; Industrial organization; Business","score_opus":0.01148023501637361,"score_gpt":0.2587345699247131,"score_spread":0.2472543349083395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395959011","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.9197069,0.0011781792,0.040194113,0.0015844362,0.00009361521,0.000056875546,0.00023700722,0.00020787769,0.036740985],"genre_scores_gemma":[0.9963432,0.00013144755,0.0018929143,0.00003815505,0.000029837856,0.0000072468592,0.00003341095,0.000030737778,0.0014931012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.0005446903,0.000045095363,0.00014744309,0.0001921235,0.00018490438],"domain_scores_gemma":[0.9654291,0.029544184,0.001758238,0.0015361833,0.0009343629,0.00079787965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026270146,0.0003924131,0.00061802915,0.00048627722,0.0004034377,0.002410677,0.00073673844,0.0011176096,0.008962698],"category_scores_gemma":[0.03482236,0.00038199866,0.00037182277,0.0005741844,0.0010521986,0.00451169,0.00073689397,0.0009423596,0.00066316593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032953823,0.001279271,0.027173739,0.00043297178,0.00035042263,0.000604806,0.00015679793,0.69866055,0.024625223,0.12074804,0.005438522,0.11723434],"study_design_scores_gemma":[0.00042261137,0.000859842,0.01824449,0.00004572851,0.0002677164,0.00038541452,0.00022162529,0.82843304,0.007313273,0.14167564,0.00207933,0.000051276056],"about_ca_topic_score_codex":0.0005722034,"about_ca_topic_score_gemma":0.0007611068,"teacher_disagreement_score":0.008962698,"about_ca_system_score_codex":0.0010290326,"about_ca_system_score_gemma":0.00080572115,"threshold_uncertainty_score":0.029983163},"labels":[],"label_agreement":null},{"id":"W4395959428","doi":"10.1007/978-3-031-58751-1_15","title":"Evaluating the Security of CRYSTALS-Dilithium in the Quantum Random Oracle Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 British Columbia","funders":"","keywords":"Dilithium; Random oracle; Computer science; Oracle; Quantum; Theoretical computer science; Computer security; Quantum mechanics; Software engineering; Physics; Encryption; Public-key cryptography","score_opus":0.040601552413976255,"score_gpt":0.31294021067523736,"score_spread":0.27233865826126114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395959428","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.6513947,0.0025835994,0.2461469,0.0112903835,0.00037869514,0.00018702581,0.00051668717,0.0006048548,0.08689702],"genre_scores_gemma":[0.9862866,0.00035100162,0.009286092,0.00015453434,0.00011247341,0.00003730363,0.000115956755,0.000068289664,0.003587707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936614,0.0034249355,0.0001625394,0.00037749344,0.0014058211,0.0009678068],"domain_scores_gemma":[0.97333413,0.021249626,0.0011399417,0.0023540582,0.00094520085,0.0009769873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008429155,0.000819148,0.0018023092,0.00119842,0.0013649741,0.005456254,0.0021489114,0.0028461516,0.005969806],"category_scores_gemma":[0.028499257,0.00042834095,0.0007884289,0.00094888033,0.0064481786,0.010904776,0.0045218286,0.0034429382,0.0006821582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007157676,0.00008562684,0.0008676,0.00010514699,0.00004305358,0.00010277651,0.00011795371,0.078997225,0.0010121829,0.909144,0.001739245,0.0070695058],"study_design_scores_gemma":[0.000050640272,0.00008364136,0.00022008925,0.0000310079,0.00001607319,0.00004637295,0.00009896651,0.35252908,0.0011558569,0.6450386,0.0007007932,0.000028971226],"about_ca_topic_score_codex":0.0024610606,"about_ca_topic_score_gemma":0.0015544705,"teacher_disagreement_score":0.008429155,"about_ca_system_score_codex":0.0036792972,"about_ca_system_score_gemma":0.0023489995,"threshold_uncertainty_score":0.044578135},"labels":[],"label_agreement":null},{"id":"W4395960800","doi":"10.1007/978-3-031-58751-1_10","title":"Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Computer science; Oblivious transfer; Transfer (computing); Theoretical computer science; Parallel computing; Algorithm; Cryptography","score_opus":0.011098575829499536,"score_gpt":0.23300852091148277,"score_spread":0.22190994508198325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395960800","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.039738175,0.0006065305,0.9227287,0.0013472809,0.00028723796,0.00021697537,0.0002719058,0.0023095708,0.032493576],"genre_scores_gemma":[0.8548142,0.00044922493,0.11352946,0.00036351342,0.0002063524,0.0003275178,0.00021941373,0.0004981178,0.029592175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996958,0.00076626876,0.00014388403,0.00047041042,0.0009733577,0.0006880098],"domain_scores_gemma":[0.99625105,0.0016648982,0.00019745134,0.0015070661,0.00022877075,0.00015076474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018430225,0.0013117921,0.0017531192,0.0008978157,0.0014124674,0.0026296845,0.0022823014,0.0022794944,0.006285764],"category_scores_gemma":[0.005699283,0.00076837785,0.001042166,0.0010398404,0.0030885863,0.0062052542,0.0055195745,0.0033490416,0.0028323156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012610399,0.00016717546,0.0002914747,0.00029605033,0.00009709796,0.00023005906,0.0003481602,0.07858425,0.0160086,0.83594567,0.00864721,0.05812314],"study_design_scores_gemma":[0.0001519094,0.00017361107,0.00015117867,0.00006382283,0.000059683767,0.00033874804,0.000047888883,0.4228478,0.02263351,0.5474364,0.00601932,0.00007612021],"about_ca_topic_score_codex":0.00038827056,"about_ca_topic_score_gemma":0.0003565637,"teacher_disagreement_score":0.006285764,"about_ca_system_score_codex":0.0017470737,"about_ca_system_score_gemma":0.0021778375,"threshold_uncertainty_score":0.021027923},"labels":[],"label_agreement":null},{"id":"W4395960895","doi":"10.1007/978-3-031-59205-8_2","title":"Self-similarity of Communities of the ABCD Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Similarity (geometry); Information retrieval; Artificial intelligence","score_opus":0.016320085181717788,"score_gpt":0.25590646693156627,"score_spread":0.23958638174984848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395960895","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.6473367,0.0035016935,0.2788953,0.004653844,0.0003812352,0.0001922674,0.00063362834,0.00026611713,0.06413916],"genre_scores_gemma":[0.97556573,0.0007619964,0.00955584,0.00019629835,0.00022818093,0.000100669655,0.0001901671,0.000065737295,0.013335392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.00042439532,0.000026692465,0.00012034078,0.00012857172,0.00012867917],"domain_scores_gemma":[0.9930657,0.0042955,0.00062598684,0.00036997563,0.00072255876,0.00092012616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670546,0.0005238341,0.0018882755,0.0019080625,0.0016490535,0.0030089896,0.0026862207,0.003095159,0.006722967],"category_scores_gemma":[0.013333827,0.0006219032,0.0011832849,0.0011341246,0.0025517824,0.0041006417,0.0018197154,0.0013596766,0.00060613634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103618455,0.00008243672,0.0011157232,0.00010154628,0.00005086743,0.0001306706,0.00023188094,0.11872077,0.00052747806,0.8703842,0.0037311043,0.0048197308],"study_design_scores_gemma":[0.00003759304,0.00002111016,0.00031069265,0.000015645845,0.000015181967,0.000059580096,0.00006966908,0.6388015,0.00006702489,0.35982665,0.0007555835,0.000019771636],"about_ca_topic_score_codex":0.00880107,"about_ca_topic_score_gemma":0.0041977665,"teacher_disagreement_score":0.00880107,"about_ca_system_score_codex":0.0015723768,"about_ca_system_score_gemma":0.0009333832,"threshold_uncertainty_score":0.022490561},"labels":[],"label_agreement":null},{"id":"W4395961398","doi":"10.1007/978-3-031-59205-8_5","title":"Network Embedding Exploration Tool (NEExT)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Embedding; Artificial intelligence","score_opus":0.019126833493558117,"score_gpt":0.27229839481899004,"score_spread":0.25317156132543195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395961398","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055194334,0.00049505197,0.82980716,0.000278732,0.00025968824,0.00013799427,0.014821271,0.12676807,0.021912573],"genre_scores_gemma":[0.07997547,0.0014118821,0.81753075,0.00027854618,0.00012076375,0.0009842064,0.03234648,0.02641403,0.04093784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972993,0.000048323767,0.000021768103,0.000058518173,0.00011815147,0.000023280518],"domain_scores_gemma":[0.99891806,0.0007276436,0.0000478422,0.00016416494,0.00009988245,0.000042322383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073735235,0.0014098046,0.00050720415,0.0021635888,0.00039619466,0.0013833605,0.0011574785,0.00052086095,0.07192563],"category_scores_gemma":[0.004124668,0.0006553855,0.00090185186,0.0013324122,0.00023187557,0.0024197865,0.0021214543,0.00118928,0.01292164],"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.00029835702,0.00018425859,0.0023042113,0.0015596242,0.00015299703,0.0006543227,0.0005698775,0.027734736,0.009722562,0.05314845,0.3034544,0.60021627],"study_design_scores_gemma":[0.00018754666,0.000114926195,0.0016410587,0.00041092883,0.00010482667,0.0014309051,0.00022270039,0.3183707,0.02794723,0.11848189,0.530977,0.00011027118],"about_ca_topic_score_codex":0.000948249,"about_ca_topic_score_gemma":0.0032738894,"teacher_disagreement_score":0.07192563,"about_ca_system_score_codex":0.00026204987,"about_ca_system_score_gemma":0.00047136325,"threshold_uncertainty_score":0.24061525},"labels":[],"label_agreement":null},{"id":"W4395961664","doi":"10.1007/978-3-031-58751-1_3","title":"Lower-Bounds on Public-Key Operations in PIR","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Key (lock); Computer security","score_opus":0.020453317320518742,"score_gpt":0.2557224155052344,"score_spread":0.23526909818471564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395961664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026760114,0.019680837,0.6343614,0.017493377,0.002272785,0.0005334443,0.0023588685,0.0027835565,0.2937556],"genre_scores_gemma":[0.6523254,0.026676787,0.19902179,0.006264694,0.009224082,0.0024187814,0.003968078,0.0038256468,0.096274815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9743171,0.0067025763,0.0012613961,0.0028333913,0.008744635,0.0061409916],"domain_scores_gemma":[0.9033282,0.07576334,0.0025426208,0.011176026,0.004969669,0.0022201608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0143676335,0.0066085556,0.0066032363,0.006838623,0.0060710735,0.020293752,0.011346764,0.0065752007,0.040636342],"category_scores_gemma":[0.06329077,0.0034180114,0.0048575234,0.011136665,0.009929244,0.04594501,0.014180783,0.022715377,0.013714049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00098492,0.00040201005,0.00048371276,0.000954761,0.000106143445,0.00012720717,0.00039950685,0.028821556,0.001617773,0.8729684,0.025746059,0.06738802],"study_design_scores_gemma":[0.000058211546,0.000069052934,0.00017464953,0.00021411166,0.00010617647,0.00015476589,0.00009129725,0.053293318,0.001186324,0.9377892,0.0068107354,0.00005212011],"about_ca_topic_score_codex":0.002010326,"about_ca_topic_score_gemma":0.0032484762,"teacher_disagreement_score":0.040636342,"about_ca_system_score_codex":0.011263481,"about_ca_system_score_gemma":0.007307294,"threshold_uncertainty_score":0.13594204},"labels":[],"label_agreement":null},{"id":"W4396571105","doi":"10.1007/978-981-97-2340-9_13","title":"On the 3-Tree Core of Plane Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Saskatchewan","funders":"","keywords":"Computer science; Core (optical fiber); Tree (set theory); Plane (geometry); Theoretical computer science; Combinatorics; Mathematics; Geometry; Telecommunications","score_opus":0.03032448685657374,"score_gpt":0.28373159396970354,"score_spread":0.2534071071131298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396571105","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37815017,0.0052535194,0.23124926,0.0023582538,0.00034678585,0.00012597286,0.0011471605,0.0005783715,0.38079044],"genre_scores_gemma":[0.81232727,0.005866945,0.10108731,0.0010304893,0.00044962193,0.00014714479,0.0019384188,0.00065569946,0.07649717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983275,0.000034063232,0.0000065002137,0.00003205008,0.000053837633,0.000040674953],"domain_scores_gemma":[0.9995536,0.0002151492,0.000046324763,0.000055946693,0.000069898764,0.000058906877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021040645,0.000437315,0.0007094094,0.0011847216,0.0008704707,0.0017885988,0.00078131654,0.00080662034,0.0081426045],"category_scores_gemma":[0.0011796785,0.00054987473,0.00056641205,0.0019117267,0.0010931909,0.0031263253,0.0012634775,0.0020783925,0.0018925122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007223624,0.000024821264,0.00020260274,0.00009530665,0.000008729053,0.00008421128,0.00027798774,0.0032568881,0.0024265458,0.95925003,0.008118292,0.026182432],"study_design_scores_gemma":[0.000009831618,0.000013504931,0.0003585153,0.000036407964,0.000008421692,0.00011410985,0.00009262107,0.008375474,0.0006281072,0.98058367,0.009772917,0.000006406616],"about_ca_topic_score_codex":0.0023589781,"about_ca_topic_score_gemma":0.0030655304,"teacher_disagreement_score":0.0081426045,"about_ca_system_score_codex":0.0008541185,"about_ca_system_score_gemma":0.00034952088,"threshold_uncertainty_score":0.02723968},"labels":[],"label_agreement":null},{"id":"W4396571137","doi":"10.1007/978-981-97-2340-9_12","title":"Source-Oblivious Broadcast","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Computer science","score_opus":0.012301778475517689,"score_gpt":0.23433099984004296,"score_spread":0.22202922136452527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396571137","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0225395,0.0015466135,0.6185069,0.002707979,0.00060459727,0.0002072682,0.0015449654,0.0045389296,0.3478033],"genre_scores_gemma":[0.5686543,0.00279418,0.07452094,0.0010606968,0.0005646991,0.00048462488,0.0017523526,0.0018820477,0.34828618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934024,0.00011479867,0.00002434945,0.00009906671,0.0002931677,0.00012843398],"domain_scores_gemma":[0.9986731,0.00061679294,0.000049744736,0.00049429195,0.00012749562,0.000038558635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049761246,0.00066249695,0.00076621247,0.0007480825,0.0008148615,0.0015619186,0.0009963608,0.0008333002,0.016501218],"category_scores_gemma":[0.0020746782,0.0005998159,0.00046438279,0.0013473756,0.0012510236,0.0030627977,0.001935916,0.002257714,0.005402571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022053365,0.00006395733,0.000081762046,0.0003131399,0.000026059652,0.00006023836,0.0002529931,0.01790079,0.0062273587,0.8504375,0.03757128,0.08684429],"study_design_scores_gemma":[0.000056625297,0.000035174842,0.00011026392,0.00006647511,0.000028141647,0.00015256437,0.00003545309,0.04999336,0.009565021,0.8861639,0.053773224,0.000019841233],"about_ca_topic_score_codex":0.0005867497,"about_ca_topic_score_gemma":0.00069538853,"teacher_disagreement_score":0.016501218,"about_ca_system_score_codex":0.0015265399,"about_ca_system_score_gemma":0.0010917548,"threshold_uncertainty_score":0.055202067},"labels":[],"label_agreement":null},{"id":"W4396838286","doi":"10.1007/978-3-031-58411-4","title":"Selected Areas in Cryptography","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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 Windsor","funders":"","keywords":"Computer science; Cryptography; Neural cryptography; Computer security; Encryption; Public-key cryptography","score_opus":0.009053222724294497,"score_gpt":0.2351046138730104,"score_spread":0.22605139114871592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396838286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000995416,0.09911331,0.011608867,0.0018068257,0.010569292,0.00015791677,0.00074074516,0.0005413075,0.87446636],"genre_scores_gemma":[0.006744498,0.06770984,0.008098262,0.0010463396,0.0072874385,0.00021105105,0.00086207065,0.00028634784,0.9077542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995745,0.000052275016,0.000015523126,0.00008902479,0.00022847623,0.000040274987],"domain_scores_gemma":[0.99951327,0.00013439008,0.000028175897,0.000065933615,0.00015855132,0.00009970777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004071188,0.0029082005,0.0020712959,0.002813647,0.0012325317,0.0027179786,0.0010306883,0.0010107091,0.14634855],"category_scores_gemma":[0.00096517726,0.00049053674,0.000748255,0.004462165,0.0010250171,0.0027078679,0.0012380889,0.0030681666,0.13902688],"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.0000862924,0.00011068218,0.00026405673,0.0008246388,0.000037887323,0.00009652859,0.000137338,0.001027834,0.0023847125,0.052205585,0.6044951,0.3383294],"study_design_scores_gemma":[0.000013689238,0.000062374005,0.0005742049,0.00035736628,0.000014412516,0.00016910347,0.000033531585,0.0004961399,0.00035592722,0.018141422,0.97976995,0.000011905775],"about_ca_topic_score_codex":0.0010336599,"about_ca_topic_score_gemma":0.002237259,"teacher_disagreement_score":0.14634855,"about_ca_system_score_codex":0.0010390709,"about_ca_system_score_gemma":0.0011433113,"threshold_uncertainty_score":0.48958468},"labels":[],"label_agreement":null},{"id":"W4396965857","doi":"10.1007/978-1-0716-3989-4_4","title":"Secure Federated Boolean Count Queries Using Fully-Homomorphic Cryptography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Cryptography; Theoretical computer science; Computer security; Encryption","score_opus":0.01711794278039755,"score_gpt":0.24309337968092218,"score_spread":0.22597543690052463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396965857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13734633,0.0013509695,0.8132005,0.001844629,0.00042040934,0.00039689423,0.0019206569,0.008092682,0.03542695],"genre_scores_gemma":[0.8586436,0.00041383534,0.12226804,0.00058172154,0.00025017242,0.00035571557,0.0014102992,0.00038600247,0.015690718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518824,0.00085697725,0.0003367156,0.00067227875,0.0020880317,0.00085779856],"domain_scores_gemma":[0.99524873,0.001561248,0.00030312102,0.0021881391,0.0005618338,0.0001369228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109693,0.00090199703,0.0021205551,0.0013958631,0.001299039,0.004580893,0.0019772714,0.0015956106,0.0065224837],"category_scores_gemma":[0.0055211163,0.0005844223,0.0009740192,0.0023494777,0.0018118444,0.010897839,0.0063864174,0.0024935235,0.002528077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022531315,0.00052443333,0.0013695348,0.00043900282,0.00015795346,0.00044022343,0.00047360308,0.023565566,0.027064357,0.6689505,0.021530205,0.25323153],"study_design_scores_gemma":[0.00029849343,0.0002702341,0.000560156,0.000108870125,0.0001046375,0.000980914,0.00018349869,0.23250917,0.049056105,0.70010334,0.015727285,0.00009739587],"about_ca_topic_score_codex":0.00039898558,"about_ca_topic_score_gemma":0.00039877035,"teacher_disagreement_score":0.0065224837,"about_ca_system_score_codex":0.0024207998,"about_ca_system_score_gemma":0.0019352933,"threshold_uncertainty_score":0.02181983},"labels":[],"label_agreement":null},{"id":"W4396966056","doi":"10.1007/978-1-0716-3989-4_20","title":"GFETM: Genome Foundation-Based Embedded Topic Model for scATAC-seq Modeling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Single-cell and spatial transcriptomics","field":"Biochemistry, Genetics and Molecular Biology","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":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"","keywords":"Computer science; Foundation (evidence); Political science; Law","score_opus":0.027810977203609817,"score_gpt":0.25784525040133005,"score_spread":0.23003427319772024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396966056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007212313,0.0004240029,0.94458383,0.00038589118,0.00019971907,0.00015274619,0.024395866,0.020626714,0.0020189704],"genre_scores_gemma":[0.1295171,0.00074352825,0.7734883,0.00052646647,0.00018162702,0.0014396637,0.07870431,0.0052518975,0.010147191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952686,0.00012392066,0.00003839707,0.00017483767,0.00008322616,0.000052883657],"domain_scores_gemma":[0.9987748,0.0008007582,0.000043487253,0.00013805651,0.00017408907,0.00006879662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013280907,0.0010353792,0.0010768304,0.0013299304,0.00074445095,0.0016724007,0.0026916885,0.0016207735,0.013859112],"category_scores_gemma":[0.004542632,0.00073605526,0.0032048589,0.00207765,0.000358217,0.0014258621,0.0013398986,0.00209003,0.0060020164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051060336,0.00014617371,0.005954885,0.0008162018,0.00058720505,0.00033870392,0.0006529611,0.67167276,0.006841701,0.042775143,0.077804014,0.19189964],"study_design_scores_gemma":[0.000030112193,0.00001727945,0.00037102267,0.000024443341,0.000042879114,0.000044274093,0.000050669132,0.95927733,0.000834698,0.0243984,0.014889583,0.00001934284],"about_ca_topic_score_codex":0.0326365,"about_ca_topic_score_gemma":0.049272645,"teacher_disagreement_score":0.0326365,"about_ca_system_score_codex":0.0012972499,"about_ca_system_score_gemma":0.0021594628,"threshold_uncertainty_score":0.06489307},"labels":[],"label_agreement":null},{"id":"W4396966282","doi":"10.1007/978-1-0716-3989-4","title":"Research in Computational Molecular Biology","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of California, Los Angeles; Stockholms Universitet; Freie Universität Berlin; Universität Bielefeld; Genome Institute of Singapore; Centre National de la Recherche Scientifique; Tel Aviv University; Tsinghua University; National Science Foundation; Bar-Ilan University; Rice University; National University of Singapore; Carnegie Mellon University; University of Texas Health Science Center at San Antonio; University of Texas Southwestern Medical Center; University of Central Florida; Università degli Studi di Padova; University of Washington; Princeton University; Johns Hopkins University; McGill University; University of Wisconsin-Madison; Brown University; Helsingin Yliopisto; University of California, San Diego; University of Toronto; Yale University; Seoul National University; Broad Institute; Indiana University Bloomington; National Institutes of Health; Georgia Institute of Technology; University of Haifa; California Institute of Technology; University of Pennsylvania; ShanghaiTech University; Westlake University; University of Connecticut; University of Southern California","keywords":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.02715916047367009,"score_gpt":0.3564700361174179,"score_spread":0.32931087564374784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396966282","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022021483,0.3176389,0.21571046,0.0449743,0.016594416,0.00014054214,0.0012814332,0.0028302448,0.39862758],"genre_scores_gemma":[0.03395131,0.21614298,0.18418689,0.012690788,0.015856786,0.00039720276,0.0044880128,0.0030159797,0.52927005],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980281,0.0005013977,0.000083403225,0.0004538561,0.00083539943,0.00009781924],"domain_scores_gemma":[0.9940501,0.003133503,0.00012664149,0.0012012483,0.001014457,0.00047394328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036570395,0.0018404663,0.0019396971,0.002737585,0.0010463523,0.004692788,0.0016258607,0.0015363283,0.039406728],"category_scores_gemma":[0.0068462705,0.0011746096,0.0009489607,0.0042354935,0.0030101486,0.007792642,0.0023616785,0.007304437,0.026663397],"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.00003319798,0.000056802495,0.0002590888,0.0004959796,0.000042020845,0.000027955688,0.00023828803,0.00095970026,0.0007186315,0.22610034,0.4577693,0.31329867],"study_design_scores_gemma":[0.000016437036,0.000028521381,0.00043594014,0.00039590427,0.00001818269,0.00017356376,0.000065718115,0.002253985,0.0006332402,0.1855022,0.81046027,0.00001609328],"about_ca_topic_score_codex":0.0015019566,"about_ca_topic_score_gemma":0.0019715484,"teacher_disagreement_score":0.039406728,"about_ca_system_score_codex":0.0017122901,"about_ca_system_score_gemma":0.0020737092,"threshold_uncertainty_score":0.1318286},"labels":[],"label_agreement":null},{"id":"W43978825","doi":"10.1007/978-3-642-31155-0_21","title":"New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Approximation algorithm; Generalization; Facility location problem; Euclidean geometry; Constant (computer programming); Computer science; Hardness of approximation; Reduction (mathematics); Polynomial-time approximation scheme; Time complexity; Function (biology); Packing problems; Euclidean distance; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.03992794652014285,"score_gpt":0.2411881084348769,"score_spread":0.20126016191473406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43978825","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.009384035,0.0015950963,0.97735137,0.00073742436,0.00033770734,0.00012401766,0.0003128177,0.00074002123,0.009417533],"genre_scores_gemma":[0.11582589,0.0014924338,0.8670183,0.00040631127,0.00042924707,0.00047799188,0.0014700512,0.0004964822,0.0123834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785054,0.00058080803,0.00010927963,0.00043884214,0.0006508924,0.00036960575],"domain_scores_gemma":[0.99515605,0.0030435207,0.00031028016,0.0005904631,0.0006407717,0.00025901225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026058473,0.0026606724,0.0026148169,0.0017226426,0.0012412919,0.004005677,0.0066337497,0.0031059831,0.011172598],"category_scores_gemma":[0.012408817,0.0014481768,0.0020471956,0.005274377,0.0012779137,0.006228174,0.003037535,0.0058031483,0.0020432023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051181676,0.00053231255,0.00067153777,0.00041631126,0.00011204833,0.00010889157,0.00020677835,0.605262,0.0013030843,0.10163792,0.027537005,0.26170027],"study_design_scores_gemma":[0.000071965995,0.00003661693,0.00008581569,0.000027245693,0.00002306953,0.00004585553,0.00003193292,0.9561391,0.0002918464,0.039917465,0.0033166246,0.000012548776],"about_ca_topic_score_codex":0.008924115,"about_ca_topic_score_gemma":0.011046147,"teacher_disagreement_score":0.011172598,"about_ca_system_score_codex":0.0041287574,"about_ca_system_score_gemma":0.0030869215,"threshold_uncertainty_score":0.037376046},"labels":[],"label_agreement":null},{"id":"W4398172566","doi":"10.1007/978-3-031-59835-7_31","title":"Fast Combinatorial Algorithms for Efficient Sortation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm","score_opus":0.018851492111999157,"score_gpt":0.2653402375234525,"score_spread":0.24648874541145332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398172566","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.01064122,0.0012481083,0.9276443,0.0009422924,0.00038742847,0.0002125388,0.0006905994,0.0051105283,0.053122927],"genre_scores_gemma":[0.14712372,0.0012502014,0.8120974,0.00052395446,0.0003490186,0.00063949963,0.0020355727,0.0021392473,0.03384142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983783,0.00034276335,0.00009881931,0.000305423,0.0006523643,0.0002223725],"domain_scores_gemma":[0.99665916,0.0018398319,0.00011791139,0.00092128123,0.00036538133,0.000096485885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012973888,0.0017824899,0.0016881775,0.0020695166,0.0019749864,0.004682971,0.0035610907,0.0017511044,0.041772544],"category_scores_gemma":[0.0071207206,0.0011070775,0.0021234723,0.004345346,0.002356856,0.008316903,0.0039631454,0.004704662,0.008550582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039653317,0.00017755452,0.00023665301,0.0005381553,0.00005410616,0.000045551136,0.00013125152,0.03265958,0.0040711025,0.58601665,0.03721683,0.3384561],"study_design_scores_gemma":[0.0001381682,0.00005250213,0.00017317715,0.000067394845,0.000038647864,0.000095827316,0.00007716025,0.14239985,0.0034112541,0.82563436,0.027875232,0.0000363775],"about_ca_topic_score_codex":0.0024994821,"about_ca_topic_score_gemma":0.0042581903,"teacher_disagreement_score":0.041772544,"about_ca_system_score_codex":0.003149874,"about_ca_system_score_gemma":0.0023640548,"threshold_uncertainty_score":0.13974309},"labels":[],"label_agreement":null},{"id":"W4398180128","doi":"10.1007/978-3-031-59835-7_30","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hypergraph; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.040178526043008166,"score_gpt":0.27858003125385694,"score_spread":0.23840150521084877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398180128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011174537,0.00060184853,0.964822,0.00089032017,0.00028177773,0.00019792515,0.00067601434,0.0034428546,0.017912783],"genre_scores_gemma":[0.18882419,0.0009476353,0.78029615,0.00069842197,0.000653613,0.00082163967,0.0033579387,0.0017871845,0.022613276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.0004257152,0.00009271021,0.00048690077,0.0005671178,0.00023800043],"domain_scores_gemma":[0.9916536,0.004458279,0.00033425257,0.0026657581,0.0005614703,0.00032650604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015579693,0.0022026792,0.002183031,0.0014936735,0.0011754659,0.0034138693,0.0048228214,0.0025670705,0.031937562],"category_scores_gemma":[0.011833026,0.0013281311,0.0016514496,0.0032475048,0.0018302394,0.008057753,0.0060256915,0.0066365693,0.008333677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075658865,0.00074715784,0.0006823241,0.0006303841,0.00012078427,0.00014796654,0.00029829462,0.14716478,0.005657103,0.2174398,0.06406136,0.5622935],"study_design_scores_gemma":[0.00015389036,0.00005892543,0.00016457551,0.000056757053,0.000032498323,0.000119073855,0.00012205931,0.5791101,0.0023957153,0.41056928,0.0071926042,0.000024520217],"about_ca_topic_score_codex":0.0020043058,"about_ca_topic_score_gemma":0.0040280237,"teacher_disagreement_score":0.031937562,"about_ca_system_score_codex":0.0016825717,"about_ca_system_score_gemma":0.0021463751,"threshold_uncertainty_score":0.1068418},"labels":[],"label_agreement":null},{"id":"W4398219966","doi":"10.1007/978-3-031-60924-4_19","title":"The Thief Orienteering Problem on Series-Parallel Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Computer science; Orienteering; Series (stratigraphy); Computer graphics (images); Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.009687467281718402,"score_gpt":0.20899019347120282,"score_spread":0.1993027261894844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398219966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34088275,0.0026441277,0.3955076,0.0037788684,0.0008759681,0.00023985005,0.0016770047,0.0007768274,0.25361693],"genre_scores_gemma":[0.6974824,0.0053951796,0.15536961,0.00061419874,0.0007008692,0.00021524755,0.0030396632,0.0007063601,0.13647658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997404,0.0000423039,0.000012970924,0.00007231296,0.000059901722,0.00007198304],"domain_scores_gemma":[0.99934095,0.00028679238,0.00007848989,0.00013901172,0.00006594023,0.00008876106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041830074,0.00093339913,0.0010186736,0.0007430115,0.0010692267,0.0019925276,0.0013888658,0.0014484995,0.011854829],"category_scores_gemma":[0.001726403,0.00050303823,0.0007494118,0.0023404565,0.0009398852,0.00330781,0.0012700326,0.0022128904,0.0012334138],"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.00035193906,0.0002110808,0.0006554846,0.00052158313,0.00005187513,0.0005137789,0.000305751,0.09397505,0.009869062,0.6446731,0.0525578,0.19631343],"study_design_scores_gemma":[0.00006455451,0.00009450697,0.00063617394,0.000066328525,0.000035347424,0.0005155019,0.00032005124,0.13305661,0.0044442536,0.8232205,0.037518196,0.000027946333],"about_ca_topic_score_codex":0.001979713,"about_ca_topic_score_gemma":0.0017669677,"teacher_disagreement_score":0.011854829,"about_ca_system_score_codex":0.0008411826,"about_ca_system_score_gemma":0.0005511627,"threshold_uncertainty_score":0.039658368},"labels":[],"label_agreement":null},{"id":"W4398220220","doi":"10.1007/978-3-031-60924-4_24","title":"Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; University of Waterloo; Concordia University","funders":"","keywords":"Counterfactual thinking; Computer science; Constraint programming; Constraint (computer-aided design); Mathematical optimization; k-nearest neighbors algorithm; Algorithm; Artificial intelligence; Stochastic programming; Mathematics","score_opus":0.038512162122617925,"score_gpt":0.2848608348532083,"score_spread":0.24634867273059036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398220220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022227671,0.0008011364,0.9643289,0.0034477815,0.00017189575,0.00011830084,0.00060631405,0.00023285991,0.008065122],"genre_scores_gemma":[0.5130488,0.0011857732,0.47556648,0.00049909705,0.00049660396,0.0005888264,0.0013460466,0.0002997907,0.006968598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929517,0.0047120126,0.00036197947,0.00095079973,0.00070378615,0.00031962513],"domain_scores_gemma":[0.92272985,0.070241906,0.0019814586,0.003160557,0.0013680855,0.00051811506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008326465,0.0010881274,0.0031638816,0.0021483644,0.0018395275,0.004983064,0.005793319,0.0042313808,0.0153020425],"category_scores_gemma":[0.067691505,0.0019066961,0.002296089,0.0036372996,0.003254514,0.011847788,0.002982171,0.0058508925,0.0008968611],"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.00016904116,0.00009612625,0.0005522691,0.00018557132,0.00010168052,0.00011754743,0.00024645333,0.14818728,0.00009637556,0.82028645,0.00439579,0.025565451],"study_design_scores_gemma":[0.00003466915,0.0000061445676,0.00007335659,0.000028474093,0.000015445423,0.000022789856,0.000043391567,0.35902327,0.00007039869,0.64010906,0.00055727427,0.000015673086],"about_ca_topic_score_codex":0.008832356,"about_ca_topic_score_gemma":0.010343531,"teacher_disagreement_score":0.0153020425,"about_ca_system_score_codex":0.0038449226,"about_ca_system_score_gemma":0.0029458266,"threshold_uncertainty_score":0.051190376},"labels":[],"label_agreement":null},{"id":"W4398229163","doi":"10.1007/978-3-031-60638-0_1","title":"Quarter-Tone Music: A Tuning System Rooted in Natural Harmonic Series","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Tone (literature); Computer science; Series (stratigraphy); Natural (archaeology); Harmonic; Speech recognition; Harmonic analysis; Acoustics; Art; Electronic engineering; History; Engineering; Physics; Literature","score_opus":0.013879859980930201,"score_gpt":0.23390847078760793,"score_spread":0.22002861080667774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398229163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03740502,0.001907549,0.66948223,0.000779076,0.0010307721,0.00011017386,0.00025948443,0.006659829,0.28236595],"genre_scores_gemma":[0.4835771,0.0017356934,0.31997603,0.0005384235,0.0007852782,0.00012615131,0.00047196317,0.0019666594,0.19082274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998845,0.00001627401,0.000006446869,0.000033968125,0.00004617194,0.000012675906],"domain_scores_gemma":[0.9998387,0.000043139546,0.000007835128,0.000048951246,0.000030403857,0.00003086557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017435903,0.00030928638,0.00020139705,0.00062068936,0.0005818046,0.0016598413,0.0007479118,0.00045964975,0.017752456],"category_scores_gemma":[0.00073517556,0.0001837173,0.00021086537,0.00051412237,0.00093929074,0.001064843,0.000875829,0.00065108086,0.0048345486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024268388,0.00004923487,0.0004582951,0.00015651107,0.000016306542,0.00012660121,0.0006610164,0.0025912363,0.07138404,0.50006735,0.017852368,0.4063943],"study_design_scores_gemma":[0.000099167664,0.0003348215,0.002265386,0.00011604351,0.00005405281,0.0012321983,0.00046204485,0.057205476,0.032465048,0.27003154,0.6356648,0.000069400805],"about_ca_topic_score_codex":0.00046425065,"about_ca_topic_score_gemma":0.0006669299,"teacher_disagreement_score":0.017752456,"about_ca_system_score_codex":0.0003494541,"about_ca_system_score_gemma":0.00027017994,"threshold_uncertainty_score":0.059387922},"labels":[],"label_agreement":null},{"id":"W4398250805","doi":"10.1007/978-3-031-56208-2_36","title":"Two Approaches for Identifying Epidemiological Parameters Illustrated with COVID-19 Data for Bulgaria","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","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":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Coronavirus disease 2019 (COVID-19); Epidemiology; Data science; Data mining; Medicine","score_opus":0.5969787640538748,"score_gpt":0.46087038080850806,"score_spread":0.13610838324536678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398250805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055205733,0.013674343,0.87590283,0.0070673674,0.00080483506,0.00048079662,0.005736963,0.00083390885,0.040293332],"genre_scores_gemma":[0.22390608,0.0045008636,0.75553524,0.00067834195,0.00015379116,0.00032456307,0.0036415004,0.00018093828,0.011078661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973284,0.0015791458,0.00014347016,0.00034324656,0.0004064057,0.00019938186],"domain_scores_gemma":[0.99611425,0.0025563962,0.00018651703,0.00042703946,0.00061510166,0.00010058778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062890644,0.0014427862,0.001033627,0.00707177,0.0009438661,0.0039444454,0.0016668187,0.0021598078,0.004486951],"category_scores_gemma":[0.014641597,0.0007492251,0.0013318134,0.006323164,0.0016866302,0.0019516151,0.0043192157,0.003136878,0.0010914365],"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.00050738297,0.00014985095,0.05232551,0.00087409915,0.00045086347,0.0011875373,0.0033762043,0.07845035,0.0030334548,0.2900724,0.031524867,0.5380475],"study_design_scores_gemma":[0.00018486711,0.00039510182,0.08910508,0.0015761807,0.0003601011,0.0018793001,0.007956312,0.26909813,0.0069390824,0.48719317,0.1347971,0.0005155709],"about_ca_topic_score_codex":0.0445107,"about_ca_topic_score_gemma":0.06738411,"teacher_disagreement_score":0.0445107,"about_ca_system_score_codex":0.0027716167,"about_ca_system_score_gemma":0.002103258,"threshold_uncertainty_score":0.08850324},"labels":[],"label_agreement":null},{"id":"W4399031155","doi":"10.1007/978-3-031-61175-9_7","title":"A Design-Principle-Friendly Conceptual Model of Observational Crowdsourcing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Source Software Innovations","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":"Memorial University of Newfoundland","funders":"","keywords":"Crowdsourcing; Computer science; Observational study; Artificial intelligence; Data science; World Wide Web; Mathematics; Statistics","score_opus":0.07024770655579259,"score_gpt":0.29205301201224493,"score_spread":0.22180530545645233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399031155","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.001506554,0.000045366935,0.9845281,0.0013462544,0.000059147183,0.00024651314,0.00014347587,0.0001364942,0.011988025],"genre_scores_gemma":[0.21586955,0.00022162954,0.7677743,0.000811668,0.00014575935,0.002372313,0.00034286315,0.00022608982,0.012235782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9889882,0.006004832,0.00045257437,0.0015541555,0.0025559834,0.00044414465],"domain_scores_gemma":[0.9841421,0.008896177,0.00068690255,0.0037480495,0.001947973,0.00057883613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012924505,0.001113576,0.0008737302,0.001508509,0.002355484,0.0058841775,0.0065182424,0.004237718,0.014564513],"category_scores_gemma":[0.029292585,0.001301468,0.0017680294,0.0017455651,0.0075267213,0.008512518,0.006357146,0.004886472,0.0028871228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010317081,0.000025991763,0.00014781195,0.00005097465,0.000008494819,0.00002846579,0.0003780413,0.005185967,0.00025730205,0.98833734,0.00092680426,0.0046423753],"study_design_scores_gemma":[0.000027130523,0.000025244455,0.00011950097,0.00004100429,0.000011886022,0.000058191818,0.00014731092,0.04509697,0.00032098975,0.94273514,0.011397047,0.000019532887],"about_ca_topic_score_codex":0.0037611944,"about_ca_topic_score_gemma":0.0030384143,"teacher_disagreement_score":0.014564513,"about_ca_system_score_codex":0.0030059402,"about_ca_system_score_gemma":0.004793081,"threshold_uncertainty_score":0.06835216},"labels":[],"label_agreement":null},{"id":"W4399031176","doi":"10.1007/978-3-031-61175-9_1","title":"Disentangling the Problem Space: A Validated Problem Statement for Sustainability Support Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Environmental Education and Sustainability","field":"Environmental 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":"Problem statement; Computer science; Statement (logic); Sustainability; Space (punctuation); Operations research; Management science; Mathematics; Operating system; Political science; Engineering","score_opus":0.010644630090291863,"score_gpt":0.2642985159534877,"score_spread":0.2536538858631958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399031176","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.017307376,0.00015908631,0.9692199,0.0026256754,0.00007125481,0.00028469245,0.00033784038,0.00020343918,0.009790742],"genre_scores_gemma":[0.22430417,0.00019025969,0.7700733,0.00028594583,0.000053016116,0.0006676613,0.0007039441,0.00016938096,0.0035522687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934344,0.003871393,0.00043167305,0.00082414644,0.0011593447,0.0002789372],"domain_scores_gemma":[0.97249323,0.022276666,0.0008477961,0.0021176809,0.0019138763,0.00035075535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059832474,0.001108351,0.0006889251,0.0009397155,0.0017273156,0.00436911,0.0019911835,0.0021265522,0.007895144],"category_scores_gemma":[0.03720882,0.00053877226,0.0014679639,0.0011984172,0.004817368,0.010614156,0.005799906,0.004102064,0.00074358983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017272554,0.00019663014,0.0016799037,0.0005561066,0.000042249732,0.0001696997,0.0019659835,0.062835686,0.0014996355,0.81158,0.0051693483,0.11413204],"study_design_scores_gemma":[0.000038381564,0.00008133681,0.00028413007,0.0001746811,0.00002243415,0.000082037935,0.0011292908,0.27589256,0.0020317195,0.7092559,0.010981292,0.000026288279],"about_ca_topic_score_codex":0.0028331224,"about_ca_topic_score_gemma":0.0028277861,"teacher_disagreement_score":0.007895144,"about_ca_system_score_codex":0.0011428904,"about_ca_system_score_gemma":0.0036889308,"threshold_uncertainty_score":0.031642795},"labels":[],"label_agreement":null},{"id":"W4399036020","doi":"10.1007/978-981-97-3076-6_8","title":"Overview of Benchmark Datasets and Methods for the Legal Information Extraction/Entailment Competition (COLIEE) 2024","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Law","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Benchmark (surveying); Information extraction; Extraction (chemistry); Artificial intelligence; Competition (biology); Information retrieval; Logical consequence; Data mining; Cartography; Chromatography; Geography","score_opus":0.06111280792826501,"score_gpt":0.41964015626099155,"score_spread":0.35852734833272654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399036020","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022882627,0.01717671,0.045737255,0.0037065374,0.0015290553,0.0039001044,0.8164091,0.042567883,0.046090677],"genre_scores_gemma":[0.0055049644,0.0014327269,0.050740354,0.000460608,0.00010372267,0.0010455662,0.93495333,0.0012599367,0.0044986787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98982775,0.002368029,0.0015957665,0.0017493103,0.0037296414,0.00072948326],"domain_scores_gemma":[0.9827071,0.005650888,0.0006611801,0.005566657,0.0044328365,0.0009812998],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010493398,0.0048182,0.0028739749,0.018952578,0.0040812786,0.0057207514,0.007305077,0.0041767485,0.032951467],"category_scores_gemma":[0.028222622,0.0015609219,0.0041694744,0.020027792,0.0013857591,0.0063167973,0.0059964973,0.004074009,0.029129934],"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.0005783308,0.0007611797,0.001460859,0.0029751286,0.0002845242,0.00013422295,0.00008940639,0.0036565596,0.0022888922,0.0044757184,0.8437571,0.13953796],"study_design_scores_gemma":[0.0014830697,0.00062489964,0.008917121,0.0012294143,0.00046916082,0.00089587166,0.0005093125,0.04589673,0.017020008,0.021490226,0.9012044,0.00025965588],"about_ca_topic_score_codex":0.029914184,"about_ca_topic_score_gemma":0.048482463,"teacher_disagreement_score":0.9895066,"about_ca_system_score_codex":0.0035221411,"about_ca_system_score_gemma":0.007344457,"threshold_uncertainty_score":0.110233665},"labels":[],"label_agreement":null},{"id":"W4399046466","doi":"10.1007/978-3-031-59933-0_4","title":"A Deep Learning Based Automatic Outdoor Home Video Surveillance Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Deep learning; Computer graphics (images); Multimedia; Real-time computing","score_opus":0.01161768496567485,"score_gpt":0.23478361515416657,"score_spread":0.2231659301884917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399046466","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.06566171,0.0006215129,0.92530787,0.00014950488,0.00012297982,0.00007705384,0.00042199722,0.0025740315,0.0050632446],"genre_scores_gemma":[0.63677174,0.000541116,0.3413248,0.00023438323,0.00012682546,0.00007495637,0.0015663527,0.00016004803,0.019199738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.000017603501,0.0000053512317,0.000065163746,0.000049220598,0.00005552333],"domain_scores_gemma":[0.9999013,0.00001641003,0.000009618674,0.000016488844,0.000044477696,0.000011688104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020674986,0.0006625544,0.0007839884,0.00080592994,0.0002514149,0.00046074178,0.0007960098,0.0005776412,0.0014616319],"category_scores_gemma":[0.0002245326,0.00029058746,0.0005927738,0.0006509186,0.00014593214,0.00045655327,0.0005835726,0.00059103227,0.00074888277],"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.00025291293,0.00033046395,0.0023002361,0.00006320165,0.000093153256,0.00016861361,0.000038411614,0.05182056,0.06277593,0.0017104705,0.006610461,0.87383556],"study_design_scores_gemma":[0.000005858508,0.000047662477,0.0013035518,0.0000063047846,0.00002482931,0.000071271796,0.000013768631,0.9878818,0.008595384,0.00082332216,0.0012190179,0.0000072718094],"about_ca_topic_score_codex":0.007377479,"about_ca_topic_score_gemma":0.011831787,"teacher_disagreement_score":0.007377479,"about_ca_system_score_codex":0.0004347401,"about_ca_system_score_gemma":0.00045132745,"threshold_uncertainty_score":0.014669061},"labels":[],"label_agreement":null},{"id":"W4399048750","doi":"10.1007/978-3-031-60599-4","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pontificia Universidad Católica de Chile; Consejo Superior de Investigaciones Científicas; Università di Bologna; Université de Liège; AgroParisTech; Centre National de la Recherche Scientifique; Linköpings Universitet; Technische Universität Wien; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Technische Universiteit Delft; Université Laval; Monash University; University College Cork; University of Southern California; Polytechnique Montréal; University College Dublin; University of Glasgow; University of Toronto; Université Grenoble Alpes; Albert-Ludwigs-Universität Freiburg; Carnegie Mellon University; Uppsala Universitet; Université de Toulouse; Università degli Studi di Padova; Brown University; Helsingin Yliopisto; University of Cincinnati; Bucknell University; University of Connecticut; Universität Bielefeld; Université Catholique de Louvain","keywords":"Computer science; Artificial intelligence; Constraint programming; Constraint (computer-aided design); Artificial Intelligence System; Programming language; Mathematical optimization; Stochastic programming; Engineering; Mathematics","score_opus":0.061539773790371975,"score_gpt":0.33996193799417457,"score_spread":0.2784221642038026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399048750","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.00218839,0.07114074,0.74374586,0.009203534,0.0013422766,0.00015616177,0.00045406487,0.00055589277,0.17121314],"genre_scores_gemma":[0.06436933,0.08992614,0.80837536,0.0018095092,0.0027382537,0.0003515275,0.0010826952,0.00041647753,0.030930758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667114,0.0010182004,0.00025246225,0.00029590545,0.0016416108,0.000120667704],"domain_scores_gemma":[0.9920201,0.0058465297,0.00029404997,0.0007228808,0.0008920345,0.00022435369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032686917,0.001524559,0.0022492036,0.0046074726,0.00075910613,0.006497174,0.0021631843,0.00113834,0.0134211],"category_scores_gemma":[0.007222144,0.00089651,0.001203388,0.01371125,0.003128435,0.0075156232,0.0025701283,0.0045358385,0.0024253398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027392314,0.000084106745,0.0003129941,0.00096598273,0.00011665613,0.00008936704,0.000087819244,0.009053977,0.0005169349,0.6364959,0.0253271,0.32692173],"study_design_scores_gemma":[0.0000118799935,0.000027724842,0.00038313027,0.00041808267,0.00004443679,0.00015060655,0.000103702834,0.029752817,0.0005259683,0.85717094,0.111380376,0.00003046579],"about_ca_topic_score_codex":0.00505979,"about_ca_topic_score_gemma":0.008854508,"teacher_disagreement_score":0.0134211,"about_ca_system_score_codex":0.0020983985,"about_ca_system_score_gemma":0.0044334014,"threshold_uncertainty_score":0.044898033},"labels":[],"label_agreement":null},{"id":"W4399048835","doi":"10.1007/978-3-031-60599-4_12","title":"CaVE: A Cone-Aligned Approach for Fast Predict-then-optimize with Binary Linear Programs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Toronto","funders":"","keywords":"Computer science; Cave; Binary number; Cone (formal languages); Algorithm; Computer graphics (images); Mathematics; Arithmetic","score_opus":0.01343312036061641,"score_gpt":0.2419434773370101,"score_spread":0.22851035697639369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399048835","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.002235397,0.00025722012,0.9691362,0.0001513631,0.00017370938,0.000109162065,0.0004372554,0.021730386,0.005769405],"genre_scores_gemma":[0.036527295,0.00012597717,0.947889,0.00035520602,0.000101208316,0.00029609905,0.0014208836,0.005457601,0.007826772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987342,0.00027011015,0.00006301778,0.00022960182,0.0005548472,0.00014836612],"domain_scores_gemma":[0.9982633,0.00085003255,0.000075727745,0.0003212718,0.0003760994,0.00011365893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016521685,0.002318791,0.0017612475,0.0011908392,0.0010584681,0.0019389772,0.0039897724,0.0020487665,0.045737952],"category_scores_gemma":[0.00614952,0.0017118867,0.0016767267,0.0016452334,0.00084573566,0.0024936742,0.003189248,0.0050501246,0.013462258],"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.000634915,0.0004909782,0.0010354602,0.00039093173,0.00015079086,0.0002554989,0.00011978995,0.12850128,0.0040716603,0.05788857,0.12451337,0.68194675],"study_design_scores_gemma":[0.00007840585,0.000048629754,0.000113050206,0.000029937415,0.000011569696,0.000041148014,0.000018082927,0.9652442,0.0016334188,0.02442684,0.008335677,0.000018911638],"about_ca_topic_score_codex":0.007873085,"about_ca_topic_score_gemma":0.020499859,"teacher_disagreement_score":0.045737952,"about_ca_system_score_codex":0.0007866424,"about_ca_system_score_gemma":0.0024928213,"threshold_uncertainty_score":0.1530087},"labels":[],"label_agreement":null},{"id":"W4399049510","doi":"10.1007/978-3-031-60599-4_19","title":"An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Architecture; Generative grammar; Artificial intelligence; Programming language","score_opus":0.012939693142665845,"score_gpt":0.24888185622129066,"score_spread":0.2359421630786248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399049510","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.018248742,0.00018289963,0.9698603,0.0001336314,0.00007258889,0.00004523674,0.00006896569,0.003808998,0.0075786053],"genre_scores_gemma":[0.55421305,0.00015019522,0.43798426,0.00013252141,0.000038020127,0.00012973681,0.00020340201,0.00036825618,0.0067805876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998603,0.000024722089,0.000009220753,0.000040343864,0.000045016623,0.00002035485],"domain_scores_gemma":[0.9997296,0.0001093824,0.000013899651,0.00006439951,0.0000640458,0.000018716408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870634,0.00048568586,0.000426845,0.000341122,0.00036889457,0.0007735153,0.0014572096,0.0007763854,0.006690604],"category_scores_gemma":[0.0011103294,0.00037431484,0.00040538923,0.0004015377,0.00057272916,0.00081969815,0.0010259632,0.0011365872,0.0011656715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011698152,0.0000890514,0.0004217052,0.00009481099,0.00007127448,0.0001109267,0.00013475513,0.57976156,0.034400873,0.024272481,0.0031993263,0.35732618],"study_design_scores_gemma":[0.000007928808,0.000021032476,0.00006151056,0.000004138457,0.000011610087,0.000016321277,0.0000064457504,0.99024117,0.003358611,0.0050085103,0.0012586638,0.0000040665127],"about_ca_topic_score_codex":0.005135341,"about_ca_topic_score_gemma":0.009314821,"teacher_disagreement_score":0.006690604,"about_ca_system_score_codex":0.00057122036,"about_ca_system_score_gemma":0.0007649762,"threshold_uncertainty_score":0.02238226},"labels":[],"label_agreement":null},{"id":"W4399058103","doi":"10.1007/978-3-031-60599-4_6","title":"LEO: Learning Efficient Orderings for Multiobjective Binary Decision Diagrams","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary decision diagram; Computer science; Binary number; Influence diagram; Artificial intelligence; Operations research; Theoretical computer science; Decision tree; Mathematics; Arithmetic","score_opus":0.013037306246668113,"score_gpt":0.254650362214452,"score_spread":0.24161305596778387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006618558,0.00024395136,0.9874084,0.0001502058,0.000067782916,0.00011183126,0.0008214473,0.002233364,0.002344523],"genre_scores_gemma":[0.102690436,0.000266822,0.88831204,0.0001608531,0.00005626962,0.0004947594,0.0027746593,0.00063709286,0.0046070605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909544,0.00032551755,0.00006214181,0.0001683625,0.00027283223,0.00007561299],"domain_scores_gemma":[0.9962792,0.002809834,0.00013411361,0.00028622526,0.0003460104,0.00014465475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001922341,0.001189447,0.0012298973,0.0016416126,0.00048518865,0.001318271,0.0012909631,0.00089251774,0.013463177],"category_scores_gemma":[0.008254178,0.0008433283,0.0015465904,0.0014956809,0.0005188746,0.002220845,0.0019146112,0.0027407086,0.00225183],"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.00025808142,0.0002362581,0.0011296425,0.0004852595,0.00006747735,0.000058336107,0.00013041614,0.21224743,0.0020148032,0.030437581,0.017854165,0.73508054],"study_design_scores_gemma":[0.000074773336,0.000095258256,0.00023307237,0.00008674587,0.000017498807,0.000023545334,0.000034367655,0.9182355,0.0012795061,0.0719783,0.007926237,0.000015284042],"about_ca_topic_score_codex":0.003400435,"about_ca_topic_score_gemma":0.0060101924,"teacher_disagreement_score":0.013463177,"about_ca_system_score_codex":0.001289146,"about_ca_system_score_gemma":0.0017728606,"threshold_uncertainty_score":0.04503876},"labels":[],"label_agreement":null},{"id":"W4399058324","doi":"10.1007/978-3-031-60597-0_5","title":"Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue Constraint","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Université Laval","funders":"","keywords":"Computer science; Constraint algorithm; Lagrange multiplier; Constraint (computer-aided design); Mathematical optimization; Algorithm; Mathematics; Geometry","score_opus":0.03826571048057999,"score_gpt":0.3209499019446277,"score_spread":0.2826841914640477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015566378,0.0002531757,0.9805532,0.000081931554,0.00009519757,0.000016581884,0.000024765062,0.00013264756,0.0032761295],"genre_scores_gemma":[0.5055187,0.00075135916,0.47789982,0.00019501869,0.00025034137,0.00011508726,0.00014327622,0.00034678422,0.0147795975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974376,0.00009370751,0.000013573559,0.0000542842,0.00006779412,0.00002689416],"domain_scores_gemma":[0.99952006,0.0002468733,0.000055608845,0.000078485165,0.00006861546,0.000030291441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006577527,0.00091388804,0.0007238352,0.00036117595,0.00030022825,0.0009484049,0.0007646275,0.0008810083,0.0059114834],"category_scores_gemma":[0.00220594,0.0002878115,0.00054856314,0.00053127366,0.00066007714,0.0011429078,0.0009977862,0.0013507832,0.0008046412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005954618,0.00025429155,0.0004666211,0.00050156086,0.00011655286,0.00022459692,0.00021163447,0.34886324,0.14503354,0.20060395,0.004743141,0.29838535],"study_design_scores_gemma":[0.000021823766,0.00014370443,0.00016644919,0.000023045586,0.000019551151,0.0000794801,0.000020926373,0.9686193,0.009311659,0.018791722,0.0027811453,0.000021290321],"about_ca_topic_score_codex":0.0006843347,"about_ca_topic_score_gemma":0.0015001341,"teacher_disagreement_score":0.0059114834,"about_ca_system_score_codex":0.0003584462,"about_ca_system_score_gemma":0.00036591498,"threshold_uncertainty_score":0.019775808},"labels":[],"label_agreement":null},{"id":"W4399058346","doi":"10.1007/978-3-031-60597-0_12","title":"UNSAT Solver Synthesis via Monte Carlo Forest Search","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Solver; Monte Carlo method; Monte Carlo tree search; Problem solver; Algorithm; Computational science; Theoretical computer science; Programming language; Mathematics; Statistics","score_opus":0.018782529223145362,"score_gpt":0.24286993870912385,"score_spread":0.2240874094859785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007937906,0.0002564426,0.95451576,0.00027774027,0.00018137982,0.00012005762,0.00036555092,0.004430855,0.031914264],"genre_scores_gemma":[0.13822995,0.0001402458,0.8444475,0.00032109107,0.000079596524,0.0002870636,0.0009562488,0.0015116633,0.014026661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995346,0.00012877665,0.00002118309,0.000092307215,0.00014493696,0.00007819009],"domain_scores_gemma":[0.9987431,0.0008537061,0.00005504038,0.00014970804,0.00016440234,0.000034115856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345672,0.0013500815,0.0009865735,0.00093778456,0.0008200927,0.0013440626,0.0014028277,0.001588157,0.038261734],"category_scores_gemma":[0.0030638885,0.0008225639,0.0011593302,0.0009751641,0.00081561966,0.0011677926,0.0010753251,0.0017196431,0.006390869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029352927,0.00012441514,0.00037697994,0.00027765785,0.00007260116,0.00013694947,0.000065030996,0.68575555,0.0046100602,0.054276664,0.021320341,0.23269019],"study_design_scores_gemma":[0.000047948713,0.000027635677,0.0000338591,0.000019833718,0.000014992135,0.00002171316,0.000014575539,0.97812134,0.0015574265,0.016675208,0.0034591032,0.00000641898],"about_ca_topic_score_codex":0.0040082633,"about_ca_topic_score_gemma":0.011071508,"teacher_disagreement_score":0.038261734,"about_ca_system_score_codex":0.00071362226,"about_ca_system_score_gemma":0.00222069,"threshold_uncertainty_score":0.12799829},"labels":[],"label_agreement":null},{"id":"W4399058371","doi":"10.1007/978-3-031-60597-0_18","title":"A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Benders' decomposition; Computer science; Decomposition; Operations research; Mathematical optimization; Engineering; Mathematics","score_opus":0.02216477098698155,"score_gpt":0.2545022546696616,"score_spread":0.23233748368268003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00394806,0.00039257618,0.9852791,0.00017434407,0.00008533841,0.00008536853,0.00019668881,0.00014868133,0.009689825],"genre_scores_gemma":[0.108025186,0.0017385934,0.8644202,0.00020112786,0.0002557094,0.00044381103,0.00087189756,0.00043402083,0.023609607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942845,0.00018975187,0.00001933954,0.00010188214,0.00016872051,0.00009194047],"domain_scores_gemma":[0.9996427,0.00018196121,0.000034350196,0.00003282079,0.0000699436,0.000038182377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007135451,0.002021449,0.0014251221,0.0012014341,0.0006986714,0.0017714022,0.0019496749,0.0015984898,0.010882251],"category_scores_gemma":[0.0012915147,0.0013626842,0.0027300268,0.0020219474,0.00058166654,0.0018693997,0.001404086,0.0034108027,0.0018114754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006707293,0.00014993887,0.00017463921,0.0002369087,0.000075270866,0.00011519545,0.000088865505,0.8585161,0.0029789149,0.0604829,0.009049836,0.06806442],"study_design_scores_gemma":[0.000010541451,0.000039023893,0.000096490236,0.000033033033,0.00001968561,0.00004071985,0.000037067603,0.96076685,0.00043731477,0.034639385,0.003867463,0.000012399799],"about_ca_topic_score_codex":0.0065040076,"about_ca_topic_score_gemma":0.0068129436,"teacher_disagreement_score":0.010882251,"about_ca_system_score_codex":0.0013860698,"about_ca_system_score_gemma":0.0012842452,"threshold_uncertainty_score":0.03640479},"labels":[],"label_agreement":null},{"id":"W4399058434","doi":"10.1007/978-3-031-60597-0","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pontificia Universidad Católica de Chile; Consejo Superior de Investigaciones Científicas; Università di Bologna; Université de Liège; AgroParisTech; Centre National de la Recherche Scientifique; Linköpings Universitet; Technische Universität Wien; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Technische Universiteit Delft; Université Laval; Monash University; University College Cork; University of Southern California; Polytechnique Montréal; University College Dublin; University of Glasgow; University of Toronto; Université Grenoble Alpes; Albert-Ludwigs-Universität Freiburg; Carnegie Mellon University; Uppsala Universitet; Université de Toulouse; Università degli Studi di Padova; Brown University; Helsingin Yliopisto; University of Cincinnati; Bucknell University; University of Connecticut; Universität Bielefeld; Université Catholique de Louvain","keywords":"Computer science; Constraint programming; Artificial intelligence; Constraint (computer-aided design); Constraint satisfaction; Mathematical optimization; Stochastic programming; Mathematics","score_opus":0.061539773790371975,"score_gpt":0.33996193799417457,"score_spread":0.2784221642038026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058434","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00218839,0.07114074,0.74374586,0.009203534,0.0013422766,0.00015616177,0.00045406487,0.00055589277,0.17121314],"genre_scores_gemma":[0.06436933,0.08992614,0.80837536,0.0018095092,0.0027382537,0.0003515275,0.0010826952,0.00041647753,0.030930758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667114,0.0010182004,0.00025246225,0.00029590545,0.0016416108,0.000120667704],"domain_scores_gemma":[0.9920201,0.0058465297,0.00029404997,0.0007228808,0.0008920345,0.00022435369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032686917,0.001524559,0.0022492036,0.0046074726,0.00075910613,0.006497174,0.0021631843,0.00113834,0.0134211],"category_scores_gemma":[0.007222144,0.00089651,0.001203388,0.01371125,0.003128435,0.0075156232,0.0025701283,0.0045358385,0.0024253398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027392314,0.000084106745,0.0003129941,0.00096598273,0.00011665613,0.00008936704,0.000087819244,0.009053977,0.0005169349,0.6364959,0.0253271,0.32692173],"study_design_scores_gemma":[0.0000118799935,0.000027724842,0.00038313027,0.00041808267,0.00004443679,0.00015060655,0.000103702834,0.029752817,0.0005259683,0.85717094,0.111380376,0.00003046579],"about_ca_topic_score_codex":0.00505979,"about_ca_topic_score_gemma":0.008854508,"teacher_disagreement_score":0.0134211,"about_ca_system_score_codex":0.0020983985,"about_ca_system_score_gemma":0.0044334014,"threshold_uncertainty_score":0.044898033},"labels":[],"label_agreement":null},{"id":"W4399058464","doi":"10.1007/978-3-031-60597-0_7","title":"Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Representation (politics); Theoretical computer science; Artificial intelligence; Combinatorial optimization; Algorithm","score_opus":0.04101629006837488,"score_gpt":0.25875006444453313,"score_spread":0.21773377437615826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058464","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.0007187863,0.00034917,0.99477684,0.00023617933,0.000054437674,0.00005696685,0.00015454419,0.000254682,0.0033983646],"genre_scores_gemma":[0.027353292,0.0010857123,0.965953,0.00025529342,0.00013058874,0.00030744882,0.0008949076,0.00029487204,0.003724897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789774,0.0007636432,0.00028531178,0.00037131767,0.00056026306,0.00012166431],"domain_scores_gemma":[0.9978315,0.00067423214,0.00014536607,0.00078283454,0.00041058552,0.00015538775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023666,0.0014331446,0.0014448239,0.0019241303,0.0007766134,0.004556371,0.0040624402,0.0018330056,0.007045478],"category_scores_gemma":[0.006491774,0.0008816238,0.0028771919,0.005083738,0.0023786747,0.006008819,0.0038773224,0.0059799845,0.002657564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022602573,0.000049387156,0.00023920099,0.0003131099,0.000041607593,0.00008733265,0.00016450333,0.045305274,0.0012229368,0.85400945,0.0073754075,0.09116922],"study_design_scores_gemma":[0.000011928126,0.000027170316,0.00012655565,0.00011770526,0.00003037996,0.00012177703,0.00006338034,0.2882266,0.0005543979,0.6769129,0.033789266,0.000017940542],"about_ca_topic_score_codex":0.0023444458,"about_ca_topic_score_gemma":0.004089753,"teacher_disagreement_score":0.007045478,"about_ca_system_score_codex":0.0016842545,"about_ca_system_score_gemma":0.0014721033,"threshold_uncertainty_score":0.023569465},"labels":[],"label_agreement":null},{"id":"W4399058486","doi":"10.1007/978-3-031-60597-0_2","title":"A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Mathematical optimization; Operations research; Stochastic programming; Mathematics","score_opus":0.017509549209417007,"score_gpt":0.23010401161395375,"score_spread":0.21259446240453675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058486","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.0073356205,0.0007513028,0.9533936,0.0013043727,0.00015395173,0.00018745422,0.0019144999,0.000321491,0.034637786],"genre_scores_gemma":[0.26575708,0.0029164904,0.66779745,0.0008803125,0.00032216604,0.0010973255,0.0038926725,0.00038108026,0.056955364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990859,0.00029232513,0.000051614745,0.00020612119,0.00023502093,0.00012907939],"domain_scores_gemma":[0.99908483,0.000592215,0.00007909835,0.0000477123,0.00014132522,0.000054745844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008814596,0.0012246531,0.0010388087,0.000789977,0.0008522816,0.0030161622,0.0027260156,0.0020982977,0.013243905],"category_scores_gemma":[0.002251993,0.0009853475,0.0016849731,0.0031018208,0.0008226309,0.0024239132,0.0012506685,0.0025725537,0.0019831907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006668201,0.00011285719,0.00018263249,0.00017798887,0.000037226575,0.00039013915,0.00009378504,0.7457045,0.0013500792,0.21621604,0.010733632,0.024934502],"study_design_scores_gemma":[0.000049900136,0.000035642977,0.000103953906,0.00004555269,0.000023657138,0.00013855241,0.000053136857,0.8953385,0.0004071439,0.08759145,0.016185217,0.000027332044],"about_ca_topic_score_codex":0.019283492,"about_ca_topic_score_gemma":0.020617416,"teacher_disagreement_score":0.019283492,"about_ca_system_score_codex":0.0017200747,"about_ca_system_score_gemma":0.0026817152,"threshold_uncertainty_score":0.044305325},"labels":[],"label_agreement":null},{"id":"W4399058518","doi":"10.1007/978-3-031-60597-0_3","title":"Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power System Reliability and Maintenance","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":"Hydro-Québec; Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Linear programming; Distributed computing; Operations research; Algorithm; Mathematics","score_opus":0.011692792838895273,"score_gpt":0.23198650169496624,"score_spread":0.22029370885607097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058518","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.091976844,0.00082117267,0.8581219,0.0018835913,0.00014902813,0.00041980937,0.0015193666,0.00033687492,0.044771336],"genre_scores_gemma":[0.69594496,0.0012036191,0.2659756,0.00036666967,0.0003384686,0.0006540425,0.0022905187,0.00039137193,0.03283469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915063,0.00033062004,0.000047333822,0.00014638834,0.0002028683,0.00012226633],"domain_scores_gemma":[0.99533254,0.003947612,0.0002500233,0.00014142209,0.00016534593,0.00016299517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016242646,0.0011862693,0.0016359454,0.00064366596,0.00062267965,0.0023723918,0.0025194054,0.001991464,0.01584032],"category_scores_gemma":[0.006167767,0.0011131734,0.000941756,0.0018943894,0.00088099187,0.0033204327,0.0015588306,0.0028592884,0.0009608187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026618002,0.00033555474,0.0005737132,0.0005670706,0.000061856226,0.0006100902,0.00018915445,0.8563027,0.0029756243,0.08223528,0.0074019255,0.048480887],"study_design_scores_gemma":[0.00007748643,0.00012214265,0.00043989264,0.00003930208,0.000019794317,0.00011024056,0.000054562934,0.93664235,0.00071718724,0.059537757,0.0022213175,0.000017971099],"about_ca_topic_score_codex":0.0036738284,"about_ca_topic_score_gemma":0.0035025848,"teacher_disagreement_score":0.01584032,"about_ca_system_score_codex":0.0012814025,"about_ca_system_score_gemma":0.0012725112,"threshold_uncertainty_score":0.05299115},"labels":[],"label_agreement":null},{"id":"W4399058545","doi":"10.1007/978-3-031-60597-0_19","title":"Don’t Explain Noise: Robust Counterfactuals for Randomized Ensembles","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Polytechnique Montréal","funders":"","keywords":"Counterfactual conditional; Computer science; Noise (video); Artificial intelligence; Algorithm; Counterfactual thinking; Epistemology; Philosophy","score_opus":0.018528492080288474,"score_gpt":0.2576441696403247,"score_spread":0.23911567756003624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058545","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.012377845,0.00036020862,0.98287934,0.0008923556,0.00017243208,0.00008416958,0.00011580274,0.00019906141,0.0029187547],"genre_scores_gemma":[0.53296316,0.0008374077,0.45439535,0.0010889058,0.00092142756,0.00096791255,0.000543921,0.000481064,0.007800807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97694314,0.016716577,0.00077964226,0.0024612856,0.0023773494,0.0007221275],"domain_scores_gemma":[0.8417818,0.13525268,0.00505207,0.014215216,0.0026785042,0.001019743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04396657,0.0023841804,0.003660375,0.0017331303,0.0014012707,0.005037311,0.0044536833,0.0044207447,0.0068924963],"category_scores_gemma":[0.1298604,0.0019365815,0.003170203,0.0017571579,0.007285076,0.010715694,0.005968184,0.007450717,0.0007716755],"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.00044789872,0.000117629475,0.00068084593,0.00015998386,0.00034507178,0.00010617679,0.00014631827,0.1220127,0.0005223957,0.8413595,0.0024500545,0.031651463],"study_design_scores_gemma":[0.000050905634,0.000043068205,0.00011408059,0.000036123878,0.000040724433,0.000030187872,0.000013059456,0.45861945,0.00036527033,0.5401377,0.00052411406,0.000025259716],"about_ca_topic_score_codex":0.0011008007,"about_ca_topic_score_gemma":0.0010052143,"teacher_disagreement_score":0.04396657,"about_ca_system_score_codex":0.001656679,"about_ca_system_score_gemma":0.0015898304,"threshold_uncertainty_score":0.23252028},"labels":[],"label_agreement":null},{"id":"W4399058564","doi":"10.1007/978-3-031-60597-0_1","title":"Online Optimization of a Dial-a-Ride Problem with the Integral Primal Simplex","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Simplex; Simplex algorithm; Dial; Mathematical optimization; Algorithm; Linear programming; Mathematics; Electrical engineering; Combinatorics; Engineering","score_opus":0.01076557083709737,"score_gpt":0.22360696648500933,"score_spread":0.21284139564791196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058564","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.01919891,0.0008270659,0.95534265,0.00066856353,0.00024171769,0.00010900993,0.00022314161,0.0003628868,0.02302605],"genre_scores_gemma":[0.55334014,0.0008620321,0.41539025,0.00036831034,0.00027102523,0.00046365467,0.0005052636,0.00065005216,0.028149145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990804,0.00040101603,0.00003128552,0.0001868189,0.00016163805,0.00013874122],"domain_scores_gemma":[0.9972958,0.0020517951,0.00010392331,0.00018676624,0.00017652882,0.00018521934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021084775,0.0013709976,0.0035469986,0.0007781097,0.00080590544,0.0032542075,0.002478683,0.0031873188,0.015260462],"category_scores_gemma":[0.007314381,0.0013219486,0.0012098409,0.0011880996,0.0016218201,0.0034802791,0.0032139625,0.0037235445,0.001439156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031490956,0.00024596293,0.0003269332,0.0002580279,0.0000593724,0.0001228629,0.000077125114,0.8685233,0.00060499005,0.079949774,0.008667388,0.040849272],"study_design_scores_gemma":[0.0000250475,0.00003550129,0.000035648292,0.00001828684,0.0000074231443,0.00001610659,0.000015099201,0.98034656,0.0001110896,0.01848298,0.00090002106,0.0000062276436],"about_ca_topic_score_codex":0.0043345755,"about_ca_topic_score_gemma":0.0037065132,"teacher_disagreement_score":0.015260462,"about_ca_system_score_codex":0.0013608516,"about_ca_system_score_gemma":0.0020520212,"threshold_uncertainty_score":0.05105132},"labels":[],"label_agreement":null},{"id":"W4399089407","doi":"10.1007/978-3-031-62076-8_15","title":"Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Computer science; Electronic circuit; Theoretical computer science; Algebra over a field; Algorithm; Arithmetic; Parallel computing; Electrical engineering; Mathematics; Pure mathematics; Engineering","score_opus":0.012273433612952033,"score_gpt":0.2397102863917149,"score_spread":0.22743685277876288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399089407","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.19036911,0.0034289374,0.5538814,0.0017086089,0.001476795,0.00021612862,0.00056604884,0.0016443013,0.24670872],"genre_scores_gemma":[0.85863316,0.0007912606,0.117383525,0.00044108336,0.00012511051,0.00015590806,0.00026880397,0.00020700486,0.021994177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967134,0.00005816706,0.000020938385,0.00005487199,0.00012644863,0.00006817347],"domain_scores_gemma":[0.999759,0.00008808867,0.000017944853,0.00006832792,0.000046573914,0.000019997484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000352158,0.0005308798,0.00056508847,0.0005841311,0.0006079157,0.0012720732,0.0007935737,0.0008044396,0.014149427],"category_scores_gemma":[0.00094759284,0.00031523217,0.00037128117,0.0007480376,0.00063861324,0.0013173254,0.0008784282,0.0009109436,0.0014197018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018457693,0.000062951985,0.00017744616,0.0002930753,0.00003428432,0.00008476182,0.00014014501,0.01571224,0.022206249,0.8545662,0.0044807373,0.10205733],"study_design_scores_gemma":[0.00014636257,0.00021767046,0.0004064111,0.00022337386,0.000058870562,0.0002745133,0.00011346376,0.18753728,0.072345786,0.6902289,0.048377898,0.00006961327],"about_ca_topic_score_codex":0.00034962187,"about_ca_topic_score_gemma":0.0009247102,"teacher_disagreement_score":0.014149427,"about_ca_system_score_codex":0.0011001492,"about_ca_system_score_gemma":0.00064276357,"threshold_uncertainty_score":0.04733455},"labels":[],"label_agreement":null},{"id":"W4399089855","doi":"10.1007/978-3-031-62076-8_2","title":"Compositional Reversible Computation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","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":"McMaster University","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Algorithm","score_opus":0.015140598516267534,"score_gpt":0.24318721270008817,"score_spread":0.22804661418382063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399089855","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013860672,0.0027935253,0.41596437,0.0010753475,0.00093530066,0.00014634847,0.00056238455,0.0018560612,0.56280607],"genre_scores_gemma":[0.4923355,0.0038279693,0.1582422,0.0006256794,0.00074609433,0.00030830724,0.0015550534,0.0019399001,0.34041938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997545,0.000042265136,0.000011079317,0.00006484119,0.000096988086,0.000030255982],"domain_scores_gemma":[0.99976903,0.00006599723,0.000008758573,0.00011336463,0.000031410975,0.000011398924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025209825,0.00062568503,0.00058196485,0.0005649011,0.0009148142,0.0015539705,0.00093543844,0.0007058847,0.046516977],"category_scores_gemma":[0.0010214673,0.00039431805,0.00077309087,0.000717271,0.0017469566,0.00238656,0.0015132857,0.0014637768,0.0076527507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019105455,0.000009722386,0.000021074726,0.00007364696,0.0000072677785,0.000023124016,0.000037930706,0.0024527747,0.0020553193,0.9543696,0.005028723,0.03590176],"study_design_scores_gemma":[0.000008039729,0.00001563103,0.000055344564,0.000028049399,0.000012620245,0.00007715149,0.000022406097,0.014794663,0.0065684137,0.91552776,0.062876545,0.000013330525],"about_ca_topic_score_codex":0.00058861915,"about_ca_topic_score_gemma":0.0009810508,"teacher_disagreement_score":0.046516977,"about_ca_system_score_codex":0.0008483519,"about_ca_system_score_gemma":0.0005907718,"threshold_uncertainty_score":0.1556148},"labels":[],"label_agreement":null},{"id":"W4399092568","doi":"10.1007/978-981-97-2303-4_8","title":"Graph-Enforced Neural Network for Attributed Graph Clustering","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute; HEC Montréal","funders":"","keywords":"Computer science; Cluster analysis; Graph; Clustering coefficient; Theoretical computer science; Artificial intelligence","score_opus":0.020977182215086345,"score_gpt":0.256839506924215,"score_spread":0.23586232470912863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399092568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070476015,0.00034894046,0.98895055,0.00022403052,0.00009217011,0.000061122366,0.00029020858,0.0016806986,0.0013046254],"genre_scores_gemma":[0.26773632,0.0006534593,0.7104002,0.0003808798,0.00016352693,0.00024978127,0.0028866052,0.0008475025,0.016681692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991898,0.00021392372,0.000046570265,0.00026509858,0.00020722357,0.00007735702],"domain_scores_gemma":[0.998073,0.0007873938,0.000129575,0.00041316292,0.00051750673,0.0000792735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375234,0.0009960961,0.0014860888,0.0014959465,0.0008067821,0.0012388133,0.00408435,0.0019883306,0.005417511],"category_scores_gemma":[0.0053098975,0.0007164764,0.001045343,0.0025151,0.00094131415,0.0023218875,0.0023610855,0.003119734,0.0016966979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018537033,0.00013739525,0.0005721206,0.00015205688,0.00009998768,0.00004950462,0.000061248626,0.6487581,0.002159358,0.025016597,0.011569603,0.31123862],"study_design_scores_gemma":[0.0000027867816,0.0000044962285,0.000043780663,0.0000040455425,0.000004645613,0.000004973142,0.0000040536797,0.99137574,0.00035225353,0.007855804,0.00034465332,0.0000026624848],"about_ca_topic_score_codex":0.015010283,"about_ca_topic_score_gemma":0.022405384,"teacher_disagreement_score":0.015010283,"about_ca_system_score_codex":0.002013932,"about_ca_system_score_gemma":0.0017958131,"threshold_uncertainty_score":0.029845834},"labels":[],"label_agreement":null},{"id":"W4399109444","doi":"10.1007/978-3-031-62076-8_10","title":"LinguaQuanta: Towards a Quantum Transpiler Between OpenQASM and Quipper","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Dalhousie University","funders":"","keywords":"Computer science; Quantum; Quantum mechanics; Physics","score_opus":0.017833268101129018,"score_gpt":0.2596659320885891,"score_spread":0.24183266398746012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399109444","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.03081984,0.0006068152,0.8568537,0.0013819594,0.0015973567,0.000173551,0.00037625554,0.038535547,0.069654934],"genre_scores_gemma":[0.36625782,0.0005745141,0.47387344,0.0021140263,0.0005222786,0.00045059778,0.00112059,0.022548415,0.13253833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993087,0.00015897819,0.000032212803,0.000117654155,0.00027050584,0.00011191809],"domain_scores_gemma":[0.9993299,0.00022314239,0.000022326361,0.00021778463,0.00013363558,0.000073185765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014362303,0.00050437753,0.00060038955,0.0005297693,0.001342195,0.0020004495,0.0021478992,0.0013444889,0.032296527],"category_scores_gemma":[0.002061404,0.0007777839,0.0007633174,0.0005822551,0.0015453075,0.0048933914,0.0032808697,0.003255399,0.010652852],"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.00061981584,0.00025527726,0.0006085168,0.0003035935,0.00006526403,0.0002040681,0.0010089375,0.004135405,0.024314076,0.63753724,0.085857294,0.24509045],"study_design_scores_gemma":[0.00015818335,0.00019438838,0.00047361417,0.00016588336,0.00007210818,0.00033121492,0.00028285827,0.073345974,0.06222912,0.529708,0.33289826,0.00014049208],"about_ca_topic_score_codex":0.0006453767,"about_ca_topic_score_gemma":0.0010658934,"teacher_disagreement_score":0.032296527,"about_ca_system_score_codex":0.00071447453,"about_ca_system_score_gemma":0.0009310285,"threshold_uncertainty_score":0.10804266},"labels":[],"label_agreement":null},{"id":"W4399134897","doi":"10.1007/978-3-031-60695-3_11","title":"Which Exergame Is Better for Older Adults? an Exploratory Study on User Perspectives of Virtual Reality, Exercube, and 2D Exergames","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Virtual reality; Computer science; Human–computer interaction; Exploratory research; Multimedia","score_opus":0.02035365982455784,"score_gpt":0.297793343759314,"score_spread":0.27743968393475615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399134897","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.99867815,0.00023118581,0.0000685523,0.00006422211,0.0000043744394,0.000014100839,0.000024224542,0.000001322332,0.0009138485],"genre_scores_gemma":[0.9971986,0.00063045433,0.00028537604,0.0001678726,0.000007199513,0.00003060909,0.000033563854,0.000004266783,0.001642022],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99960095,0.0002037671,0.000029059149,0.000045567336,0.00006472177,0.000055916535],"domain_scores_gemma":[0.9981034,0.0012016939,0.00025564115,0.000028242339,0.00015237699,0.00025848515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012699153,0.00027650513,0.00034896302,0.00052628317,0.0008494407,0.0012344203,0.00020473829,0.00053782796,0.0016870335],"category_scores_gemma":[0.0037822435,0.00024419554,0.00029426336,0.00032461408,0.00050175097,0.0012176515,0.001103753,0.0006114318,0.00020621139],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006773795,0.0011209346,0.15599404,0.0005483875,0.00007988772,0.0015230214,0.7834511,0.00005195697,0.006915474,0.0005946965,0.0011029638,0.04794022],"study_design_scores_gemma":[0.000042836302,0.0025460555,0.29434064,0.0002371757,0.00012082148,0.001771131,0.69206697,0.00021792752,0.0009951891,0.00017815418,0.0074334447,0.000049680697],"about_ca_topic_score_codex":0.0019737105,"about_ca_topic_score_gemma":0.0054679024,"teacher_disagreement_score":0.0019737105,"about_ca_system_score_codex":0.00027084636,"about_ca_system_score_gemma":0.00031021688,"threshold_uncertainty_score":0.0067160726},"labels":[],"label_agreement":null},{"id":"W4399176346","doi":"10.1007/978-3-031-60878-0_1","title":"Putting the Argumentative Perspective Under Discussion – QUD vs. Argumentative Goals","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language, Metaphor, and Cognition","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Argumentative; Perspective (graphical); Computer science; Artificial intelligence; Epistemology; Philosophy","score_opus":0.021434262024291075,"score_gpt":0.32313305931320535,"score_spread":0.3016987972889143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399176346","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.008430861,0.012012148,0.13990778,0.13008842,0.003981851,0.00004932315,0.00014481085,0.00012816091,0.7052567],"genre_scores_gemma":[0.8637792,0.007284443,0.051185697,0.017705113,0.004836534,0.00034592737,0.0002166933,0.000662391,0.053984005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99097973,0.006150187,0.00029489465,0.00072976167,0.001382901,0.0004625534],"domain_scores_gemma":[0.989325,0.007536816,0.00052096456,0.0011396053,0.0011477841,0.0003299341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011199899,0.0009248018,0.0012318246,0.0022954512,0.003979434,0.00934453,0.0025179342,0.0071188533,0.008607528],"category_scores_gemma":[0.0150818555,0.00062578724,0.000987671,0.0019955775,0.026785772,0.026044812,0.004285513,0.009632929,0.0025969837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006587213,0.0000028749423,0.000013587021,0.000023371054,0.000002195651,0.000016745682,0.0005889814,0.00003335044,0.000041623734,0.99598145,0.0014794195,0.001809796],"study_design_scores_gemma":[0.0000048358543,0.0000031968718,0.000020845566,0.00004739131,0.0000029616742,0.000021909622,0.00031429567,0.00013984264,0.00008590596,0.9834208,0.015934445,0.0000035851644],"about_ca_topic_score_codex":0.0011988453,"about_ca_topic_score_gemma":0.0010690984,"teacher_disagreement_score":0.011199899,"about_ca_system_score_codex":0.004032367,"about_ca_system_score_gemma":0.0021246264,"threshold_uncertainty_score":0.05923146},"labels":[],"label_agreement":null},{"id":"W4399208764","doi":"10.1007/978-3-031-63028-6_21","title":"An AI-Learner Shared Control Model Design for Adaptive Practicing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Athabasca University","funders":"","keywords":"Computer science; Control (management); Software engineering; Artificial intelligence; Human–computer interaction","score_opus":0.047364394762514514,"score_gpt":0.29057089143215864,"score_spread":0.2432064966696441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399208764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006921783,0.000051047664,0.9903639,0.00005785181,0.000024110634,0.00006279354,0.000014273366,0.00027806286,0.0022261115],"genre_scores_gemma":[0.78477716,0.0001049615,0.20697299,0.000089990404,0.000026267991,0.0005081167,0.0000769576,0.00008950459,0.007354037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991505,0.00024061077,0.000056484354,0.00020152483,0.00026904145,0.000081764294],"domain_scores_gemma":[0.99883324,0.00041043837,0.000084442756,0.00015624026,0.00044466453,0.00007108434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015721539,0.00040972308,0.00069512345,0.000251846,0.0005812384,0.0012018438,0.0019490562,0.0009250565,0.005801231],"category_scores_gemma":[0.0030007202,0.00035534342,0.00050563295,0.00025308735,0.00055207545,0.0013819679,0.0015039116,0.0011072003,0.0007745702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075426814,0.00047085102,0.000749638,0.0002465541,0.00013203347,0.000104739636,0.0005678231,0.64736503,0.0201812,0.041487344,0.0021595496,0.28578094],"study_design_scores_gemma":[0.00003628231,0.00014252565,0.00009515157,0.0000069231605,0.000021878559,0.00001679384,0.000022141037,0.9931277,0.002636505,0.0026544465,0.00123274,0.0000069745915],"about_ca_topic_score_codex":0.0043377974,"about_ca_topic_score_gemma":0.004380903,"teacher_disagreement_score":0.005801231,"about_ca_system_score_codex":0.0008096641,"about_ca_system_score_gemma":0.0013332233,"threshold_uncertainty_score":0.019407034},"labels":[],"label_agreement":null},{"id":"W4399208806","doi":"10.1007/978-3-031-63031-6_21","title":"Exploring Inclusivity in AI Education: Perceptions and Pathways for Diverse Learners","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Mount Saint Vincent University","funders":"","keywords":"Computer science; Perception; Mathematics education; Cognitive science; Data science; World Wide Web; Psychology; Neuroscience","score_opus":0.12009141763140896,"score_gpt":0.3648933250262288,"score_spread":0.24480190739481983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399208806","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.9804016,0.00036939286,0.0008923813,0.0013262079,0.000029384395,0.000035866397,0.000010783196,0.0000135058235,0.016920822],"genre_scores_gemma":[0.9961212,0.00025213917,0.00041890214,0.00021878569,0.000006358673,0.000023599418,0.000013138562,0.000008225416,0.0029375416],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9939346,0.0034002375,0.00027632416,0.00044158203,0.0010780431,0.00086926005],"domain_scores_gemma":[0.97843605,0.009178034,0.0020542506,0.0006103421,0.002822045,0.0068992665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009740335,0.00030785633,0.00035744568,0.0014610321,0.0063259536,0.013847575,0.0013705231,0.0018380685,0.005710034],"category_scores_gemma":[0.025325047,0.00038098742,0.0004027324,0.00097574224,0.005047916,0.009240408,0.012303974,0.0047069737,0.00057786755],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008490897,0.0004447012,0.06830185,0.00007905689,0.000013036483,0.000401368,0.89901584,0.000054454056,0.00102139,0.0067980094,0.0005782241,0.023207162],"study_design_scores_gemma":[0.000006036963,0.00016366178,0.016126806,0.0001285709,0.0000089319365,0.00030163335,0.97086346,0.00015908123,0.00037878388,0.0028840639,0.008955145,0.000023887722],"about_ca_topic_score_codex":0.0039238823,"about_ca_topic_score_gemma":0.0060181282,"teacher_disagreement_score":0.013847575,"about_ca_system_score_codex":0.0018966782,"about_ca_system_score_gemma":0.0042043393,"threshold_uncertainty_score":0.05151242},"labels":[],"label_agreement":null},{"id":"W4399209008","doi":"10.1007/978-3-031-63028-6_4","title":"Fast Weakness Identification for Adaptive Feedback","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control Systems and Identification","field":"Engineering","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; Athabasca University","funders":"","keywords":"Computer science; Identification (biology); Weakness; Artificial intelligence; Medicine","score_opus":0.012807521143650274,"score_gpt":0.22011649499609526,"score_spread":0.20730897385244498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019193384,0.0010498818,0.9908467,0.00006456526,0.00015780587,0.000020288866,0.000033703174,0.00046337917,0.005444415],"genre_scores_gemma":[0.25735053,0.003894397,0.6158213,0.00022191646,0.00023152989,0.00021018262,0.0003623243,0.00040242306,0.12150546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999877,0.000021006701,0.00000541696,0.000028589579,0.00005643924,0.000011600759],"domain_scores_gemma":[0.9998147,0.00008701778,0.000011708076,0.000033846503,0.0000479918,0.0000047328144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025397594,0.00080545247,0.00060312304,0.0004442834,0.00028476492,0.0005532733,0.00053200306,0.0007819579,0.007875149],"category_scores_gemma":[0.00072118465,0.0003156201,0.00037670988,0.00034621367,0.0003089457,0.00085969234,0.0008724332,0.001102618,0.0029071565],"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.0001348941,0.000036347203,0.00023500789,0.0004282766,0.00006053233,0.00013906493,0.00010861894,0.079991356,0.06109565,0.08540558,0.012643061,0.7597215],"study_design_scores_gemma":[0.000017551034,0.00013013047,0.000620436,0.00007530835,0.000029567067,0.00037136325,0.000034997098,0.88221663,0.017629536,0.0656859,0.03315391,0.00003456536],"about_ca_topic_score_codex":0.0005163668,"about_ca_topic_score_gemma":0.0008708365,"teacher_disagreement_score":0.007875149,"about_ca_system_score_codex":0.0002760726,"about_ca_system_score_gemma":0.00024912728,"threshold_uncertainty_score":0.026344955},"labels":[],"label_agreement":null},{"id":"W4399209075","doi":"10.1007/978-3-031-63031-6_25","title":"Educational Knowledge Graph Creation and Augmentation via LLMs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Mount Saint Vincent University; Athabasca University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.015725868230720124,"score_gpt":0.27838647963134794,"score_spread":0.2626606114006278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209075","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.017602874,0.00020466084,0.92527634,0.00043623397,0.0001541269,0.0002417933,0.0023315798,0.03630232,0.017450178],"genre_scores_gemma":[0.19175205,0.00023425074,0.78253454,0.00015921616,0.00005461647,0.00016890527,0.0059340945,0.0021139141,0.017048486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931026,0.00014895613,0.000052754032,0.00022549972,0.00020550437,0.000057031248],"domain_scores_gemma":[0.99828017,0.0006344894,0.00006740961,0.00061034656,0.0003226368,0.00008501121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006390465,0.00054909877,0.00044081104,0.003136599,0.00066375424,0.0020077932,0.0011876345,0.00060864066,0.022805313],"category_scores_gemma":[0.003662852,0.00048095259,0.0012236165,0.0021047795,0.00047511057,0.0026122984,0.0025781903,0.0011174515,0.006668233],"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.0001993145,0.00027462255,0.0018770769,0.00041357943,0.00007749262,0.00022910807,0.00037211252,0.01671529,0.01592912,0.029991334,0.024208736,0.9097123],"study_design_scores_gemma":[0.000060465056,0.0001005158,0.0022272528,0.00019717234,0.00018770283,0.0003863152,0.00059425674,0.5965984,0.10619479,0.09001399,0.20337524,0.0000638779],"about_ca_topic_score_codex":0.0047797044,"about_ca_topic_score_gemma":0.013284535,"teacher_disagreement_score":0.022805313,"about_ca_system_score_codex":0.0008157515,"about_ca_system_score_gemma":0.0013143196,"threshold_uncertainty_score":0.07629132},"labels":[],"label_agreement":null},{"id":"W4399209301","doi":"10.1007/978-3-031-63028-6_5","title":"QuizMaster: An Adaptive Formative Assessment System","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Athabasca University","funders":"","keywords":"Computer science; Formative assessment; Software engineering; Mathematics education; Mathematics","score_opus":0.02418958211476413,"score_gpt":0.2704531470724384,"score_spread":0.24626356495767426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209301","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0660221,0.0013071148,0.516284,0.00039041962,0.00035018424,0.0017765634,0.012363515,0.36789668,0.033609368],"genre_scores_gemma":[0.27070913,0.0014292612,0.550527,0.0014149734,0.00022423771,0.00327154,0.025487125,0.013838703,0.13309808],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996412,0.00008051345,0.000042413732,0.000059709168,0.00015077698,0.000025369498],"domain_scores_gemma":[0.99883646,0.0005401007,0.0000475628,0.00010913638,0.00034178203,0.00012503624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078000355,0.0010349295,0.00072999985,0.0013279079,0.0002991083,0.001047636,0.0015723963,0.0005994918,0.031437464],"category_scores_gemma":[0.0035808433,0.00046077915,0.0003029867,0.0007429021,0.00015640682,0.0016215306,0.0015213094,0.0005118074,0.011091877],"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.0014258882,0.00033797504,0.0028702328,0.00035663592,0.00006297333,0.00016542569,0.0003357321,0.0012456065,0.021182317,0.0010048203,0.10296512,0.86804736],"study_design_scores_gemma":[0.0021986237,0.002716062,0.07277287,0.0006408436,0.0009461512,0.004226125,0.00073761557,0.19076656,0.15547489,0.019228926,0.54952,0.0007713068],"about_ca_topic_score_codex":0.0031714283,"about_ca_topic_score_gemma":0.005336461,"teacher_disagreement_score":0.031437464,"about_ca_system_score_codex":0.00032556555,"about_ca_system_score_gemma":0.0006704224,"threshold_uncertainty_score":0.10516876},"labels":[],"label_agreement":null},{"id":"W4399209307","doi":"10.1007/978-3-031-63028-6","title":"Generative Intelligence and Intelligent Tutoring Systems","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Central University; Xiamen University; East China Normal University; Università degli Studi di Cagliari; Beijing Normal University; University of South Australia; Durham University; Universidade Federal de Alagoas; Mount Saint Vincent University; Waseda University; Athabasca University; University of Macedonia; Northern Illinois University; University of Portsmouth; Università degli Studi Roma Tre; Educational Testing Service","keywords":"Computer science; Generative grammar; Artificial intelligence; Intelligent decision support system; Natural language processing; Machine learning","score_opus":0.028111139147693254,"score_gpt":0.2627661690542819,"score_spread":0.23465502990658865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209307","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023998795,0.22377652,0.3190608,0.008137955,0.0020148242,0.00008442699,0.00017859282,0.0009815184,0.42176664],"genre_scores_gemma":[0.562385,0.10012586,0.08184093,0.001358092,0.0032081753,0.00030469577,0.00052637426,0.0003005984,0.24995026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977666,0.00009753554,0.000009308012,0.000032068772,0.000067048684,0.00001733498],"domain_scores_gemma":[0.9987925,0.0010312235,0.00003233553,0.000062682266,0.00006348843,0.000017650354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039061744,0.00061650627,0.0006242694,0.0006688553,0.00034002343,0.0020185576,0.00063614576,0.001393,0.00955531],"category_scores_gemma":[0.001863713,0.0003646596,0.00033226388,0.0010212974,0.0015095528,0.002476313,0.00058482407,0.0014374042,0.002284397],"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.000036444813,0.00006823862,0.00025061428,0.00040788064,0.00003160401,0.000100192134,0.0004694935,0.01781605,0.0014572615,0.770947,0.02272605,0.1856893],"study_design_scores_gemma":[0.000018878321,0.000027413726,0.0003147131,0.00008374444,0.000014540699,0.00014745594,0.000101739206,0.016384175,0.0007688872,0.90376115,0.07836372,0.000013532859],"about_ca_topic_score_codex":0.0006531404,"about_ca_topic_score_gemma":0.00073943735,"teacher_disagreement_score":0.00955531,"about_ca_system_score_codex":0.0006020663,"about_ca_system_score_gemma":0.00030453198,"threshold_uncertainty_score":0.031965673},"labels":[],"label_agreement":null},{"id":"W4399209336","doi":"10.1007/978-3-031-63031-6_2","title":"Cognitive Engagement Detection of Online Learners Using GloVe Embedding and Hybrid LSTM","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Athabasca University","funders":"","keywords":"Computer science; Embedding; Cognition; Human–computer interaction; Multimedia; Artificial intelligence; Speech recognition; Psychology","score_opus":0.02571476235785965,"score_gpt":0.3039014943563106,"score_spread":0.27818673199845095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209336","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.89587766,0.00042372348,0.097104475,0.00014218305,0.00011278562,0.000063359024,0.0006004982,0.00076348975,0.004911818],"genre_scores_gemma":[0.98003376,0.00011177252,0.017532242,0.00003692569,0.000029823163,0.000043123717,0.0002559699,0.00004017135,0.0019161995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997296,0.00006162826,0.000011641803,0.00007457809,0.00006607965,0.000056522967],"domain_scores_gemma":[0.9994966,0.0002705918,0.00004098382,0.000031579064,0.00010044787,0.00005982341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032261887,0.00045986535,0.00033960905,0.0005243399,0.000117938886,0.000679027,0.00027215434,0.00048891344,0.002301323],"category_scores_gemma":[0.001730036,0.00009249078,0.00024119004,0.00040955734,0.00013635347,0.0008452539,0.00090380927,0.0005372175,0.0008546346],"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.0017537574,0.00061248586,0.028724011,0.00030232384,0.000099508026,0.00026886986,0.0012560912,0.005213928,0.19936839,0.0011562553,0.0028547866,0.7583896],"study_design_scores_gemma":[0.000095441486,0.0015043556,0.17535166,0.00014284406,0.00018122428,0.00078981323,0.0020948534,0.69750893,0.11096611,0.0062980005,0.00493662,0.0001301491],"about_ca_topic_score_codex":0.000681729,"about_ca_topic_score_gemma":0.001062398,"teacher_disagreement_score":0.002301323,"about_ca_system_score_codex":0.00012062894,"about_ca_system_score_gemma":0.0001658021,"threshold_uncertainty_score":0.0076987147},"labels":[],"label_agreement":null},{"id":"W4399209363","doi":"10.1007/978-3-031-63028-6_27","title":"A Generative Artificial Intelligence Empowered Chatbot: System Usability and Student Teachers’ Experience","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","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":"McGill University; Athabasca University","funders":"","keywords":"Chatbot; Computer science; Usability; Generative grammar; Human–computer interaction; Multimedia; Artificial intelligence; World Wide Web","score_opus":0.03480264034954751,"score_gpt":0.31677330278731863,"score_spread":0.28197066243777114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209363","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.911294,0.00023739386,0.05959495,0.00063833734,0.00010819219,0.00031967738,0.00011944371,0.004896779,0.022791116],"genre_scores_gemma":[0.95480466,0.000067166526,0.028226256,0.00019649601,0.000017926357,0.00021060069,0.00020724547,0.0006098098,0.015659966],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9967638,0.0023448062,0.000072167626,0.00027915044,0.0003538292,0.00018617077],"domain_scores_gemma":[0.98845917,0.008692419,0.00025245998,0.000913197,0.00057516893,0.0011076176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043803793,0.0005324036,0.0004373605,0.0006800554,0.0015146134,0.0030608212,0.0016996404,0.0020789257,0.0081930775],"category_scores_gemma":[0.011681388,0.00039895115,0.000283492,0.00044699365,0.0011929475,0.002374207,0.0031836196,0.0013996104,0.0024994677],"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.0033265662,0.00955951,0.035226375,0.0011309376,0.000092648734,0.0030670455,0.27146327,0.0057253824,0.06722922,0.022991689,0.027246503,0.55294085],"study_design_scores_gemma":[0.0021135332,0.026207848,0.11316215,0.0013160764,0.0007652612,0.011362856,0.16234545,0.18439713,0.1374713,0.041118015,0.31883347,0.0009069665],"about_ca_topic_score_codex":0.0007606144,"about_ca_topic_score_gemma":0.0016252765,"teacher_disagreement_score":0.0081930775,"about_ca_system_score_codex":0.0007070208,"about_ca_system_score_gemma":0.0010118753,"threshold_uncertainty_score":0.02740854},"labels":[],"label_agreement":null},{"id":"W4399209577","doi":"10.1007/978-3-031-63031-6_3","title":"Assessing Cognitive Workload of Aircraft Pilots Through Face Temperature","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology and Human Factors in Education and Health","field":"Medicine","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":"Université du Québec à Chicoutimi; Université de Montréal","funders":"","keywords":"Workload; Computer science; Aeronautics; Face (sociological concept); Cognition; Simulation; Human–computer interaction; Operating system; Engineering; Psychology","score_opus":0.04067718859045202,"score_gpt":0.3550237774663058,"score_spread":0.3143465888758538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209577","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.99314684,0.00035396457,0.0032185656,0.000037639304,0.000036104728,0.00003864395,0.00023408864,0.00004006656,0.0028940279],"genre_scores_gemma":[0.99520713,0.00038636307,0.0020648795,0.000041598672,0.000027974038,0.00004209284,0.000214325,0.000009506329,0.002006156],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99990857,0.00001692104,0.0000055834316,0.000019481105,0.00003059429,0.000018827363],"domain_scores_gemma":[0.99979705,0.000096081596,0.000031135827,0.0000075450594,0.00003684542,0.00003140437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012922677,0.00040038812,0.00019828929,0.00027598784,0.00010608912,0.00032746783,0.0001549596,0.00025019224,0.001648246],"category_scores_gemma":[0.00071676326,0.0001066177,0.0001450729,0.00014724562,0.000079613616,0.00018149508,0.0002492304,0.0002518424,0.0004324212],"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.0029091048,0.0009973675,0.32463217,0.0003957939,0.0002363293,0.0006075244,0.0028231933,0.0017600765,0.3651408,0.00011888558,0.0023559097,0.29802287],"study_design_scores_gemma":[0.000022588547,0.0019979004,0.98379,0.00003693461,0.00005580822,0.0005239171,0.0008083556,0.0018226871,0.010060566,0.00009003954,0.00077104376,0.00002010424],"about_ca_topic_score_codex":0.0015596902,"about_ca_topic_score_gemma":0.0019689128,"teacher_disagreement_score":0.001648246,"about_ca_system_score_codex":0.00008666874,"about_ca_system_score_gemma":0.000090298556,"threshold_uncertainty_score":0.005513966},"labels":[],"label_agreement":null},{"id":"W4399209580","doi":"10.1007/978-3-031-63031-6_11","title":"Detection of Pre-error States in Aircraft Pilots Through Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Université du Québec à Chicoutimi; Université de Montréal","funders":"","keywords":"Computer science; Aeronautics; Artificial intelligence; Speech recognition; Engineering","score_opus":0.025696766025667173,"score_gpt":0.33406063206530395,"score_spread":0.3083638660396368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209580","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.6192747,0.0010033415,0.37315318,0.00014720237,0.00013096072,0.00005274846,0.00022673701,0.0014915639,0.004519623],"genre_scores_gemma":[0.962661,0.00014570539,0.034820504,0.00002992788,0.000026039565,0.000016278182,0.000154515,0.000042409967,0.002103534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987984,0.00001703163,0.0000071913655,0.00003613796,0.00003461323,0.000025272984],"domain_scores_gemma":[0.99918073,0.00055756106,0.0000770582,0.000047819653,0.00010840087,0.000028359482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025283822,0.00040758302,0.0003460678,0.00052197423,0.00018540227,0.00038388252,0.00032639253,0.0004060862,0.0011664897],"category_scores_gemma":[0.001264086,0.00017822236,0.00017594041,0.00027057537,0.00017544237,0.00044212467,0.00028879332,0.0006043605,0.00039902265],"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.0005773886,0.00027721774,0.02774314,0.000082236955,0.000051170846,0.00021470425,0.00016270639,0.03994573,0.06238956,0.00065175263,0.0017317504,0.8661727],"study_design_scores_gemma":[0.000015040736,0.0003649156,0.048028056,0.000027351787,0.000036760073,0.00029558645,0.00007343918,0.92190987,0.025724763,0.002527676,0.0009715815,0.000024990402],"about_ca_topic_score_codex":0.0014138483,"about_ca_topic_score_gemma":0.0022001027,"teacher_disagreement_score":0.0014138483,"about_ca_system_score_codex":0.00012190298,"about_ca_system_score_gemma":0.00019209375,"threshold_uncertainty_score":0.003902316},"labels":[],"label_agreement":null},{"id":"W4399209596","doi":"10.1007/978-3-031-63028-6_26","title":"Generating Learning Sequences Using Contextual Bandit Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Athabasca University","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm; Machine learning","score_opus":0.035103588103043044,"score_gpt":0.2734337686053945,"score_spread":0.23833018050235144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025692657,0.0001790448,0.969151,0.00010358792,0.0000436803,0.00013232125,0.00010600611,0.0023468083,0.0022448013],"genre_scores_gemma":[0.40325996,0.00020354046,0.58974296,0.00014239048,0.00006930933,0.0005919367,0.0008814004,0.000489215,0.0046192915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989644,0.00032807485,0.000072647774,0.0003259181,0.00019129229,0.00011763785],"domain_scores_gemma":[0.9940737,0.004261222,0.0002131914,0.0005444817,0.000731921,0.00017561516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016016528,0.0010805818,0.0014484415,0.0014170908,0.001017865,0.001306508,0.002049808,0.001946066,0.008229604],"category_scores_gemma":[0.008746042,0.000992773,0.00092290406,0.0014477754,0.0009938722,0.0023005393,0.002402469,0.0018935006,0.0021406868],"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.0007246111,0.00032279902,0.001656977,0.00021725982,0.000075568954,0.00014687388,0.00026597988,0.46446875,0.004434736,0.025318267,0.003645619,0.4987226],"study_design_scores_gemma":[0.00001874992,0.00003701935,0.000058853893,0.000012225545,0.000009492298,0.000014714385,0.000012109957,0.9915986,0.0012597012,0.0065979557,0.00037611948,0.0000044878648],"about_ca_topic_score_codex":0.006397271,"about_ca_topic_score_gemma":0.008457043,"teacher_disagreement_score":0.008229604,"about_ca_system_score_codex":0.0010609415,"about_ca_system_score_gemma":0.0015396094,"threshold_uncertainty_score":0.02753079},"labels":[],"label_agreement":null},{"id":"W4399209598","doi":"10.1007/978-3-031-63031-6_6","title":"From Novice to Expert: Unraveling the Impact of Experience on Cognitive Load and Physiological Responses in Aviation Pilots","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Université du Québec à Chicoutimi; Université de Montréal","funders":"","keywords":"Aviation; Computer science; Cognition; Aeronautics; Cognitive load; Human–computer interaction; Cognitive psychology; Psychology; Aerospace engineering; Engineering","score_opus":0.061032076612721066,"score_gpt":0.4032948508258788,"score_spread":0.3422627742131577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399209598","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.9731082,0.005409312,0.0097169755,0.00066996436,0.00009005375,0.000020828995,0.00012904526,0.00006659178,0.010789038],"genre_scores_gemma":[0.98713684,0.0022792516,0.0048424606,0.00027187727,0.00007056449,0.00002318391,0.0001254852,0.000033224118,0.0052170274],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99989605,0.000020726493,0.000004206817,0.000030497136,0.000035113844,0.000013432882],"domain_scores_gemma":[0.998898,0.0008567333,0.000052695676,0.00004200072,0.000056355384,0.00009414415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043035296,0.00028296164,0.00026357084,0.00030931027,0.00016987645,0.0010357018,0.00038808404,0.00050545245,0.0027838978],"category_scores_gemma":[0.0018010066,0.00015843139,0.00014052259,0.00022250354,0.0005328526,0.0013579477,0.00071037,0.0007452974,0.0002444047],"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.00077657873,0.0009140862,0.09743908,0.00080565637,0.0001141248,0.0015578227,0.014008664,0.002246355,0.092019826,0.0026841501,0.0062864134,0.7811473],"study_design_scores_gemma":[0.000032126427,0.0021290747,0.9557854,0.00024796242,0.00007750541,0.0020230028,0.0064832126,0.007631362,0.00859672,0.010271663,0.0066441456,0.000077826706],"about_ca_topic_score_codex":0.001057498,"about_ca_topic_score_gemma":0.0026024326,"teacher_disagreement_score":0.0027838978,"about_ca_system_score_codex":0.0001304807,"about_ca_system_score_gemma":0.00022000728,"threshold_uncertainty_score":0.009313047},"labels":[],"label_agreement":null},{"id":"W4399210979","doi":"10.1007/978-3-031-63028-6_6","title":"Preliminary Systematic Review of Open-Source Large Language Models in Education","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Athabasca University; Simon Fraser University; Mount Saint Vincent University","funders":"","keywords":"Computer science; Open source; Programming language; Natural language processing; Artificial intelligence; Software engineering; Software","score_opus":0.020518801951125328,"score_gpt":0.28580495849316945,"score_spread":0.2652861565420441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399210979","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007965246,0.9605225,0.013477551,0.0052321996,0.0005862566,0.0020715569,0.0076793656,0.00039533997,0.002069967],"genre_scores_gemma":[0.12748449,0.8062744,0.039587375,0.007510892,0.00047709324,0.00782313,0.009325153,0.00034742005,0.00117001],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9532169,0.029002469,0.009648959,0.0023968895,0.005308664,0.00042613578],"domain_scores_gemma":[0.65867597,0.29963478,0.016701045,0.009185742,0.014450852,0.0013515835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.065157704,0.0013810648,0.0042889677,0.009919971,0.00075872213,0.0041137994,0.003217247,0.0016772338,0.006242803],"category_scores_gemma":[0.25043842,0.0012475384,0.0073107537,0.008323619,0.0015637021,0.0055001015,0.004338572,0.002568414,0.0010033236],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010519264,0.00019848261,0.004685705,0.57558507,0.01773513,0.000109932436,0.0021492804,0.0011518046,0.0005850677,0.0024841912,0.015882723,0.37838075],"study_design_scores_gemma":[0.000870386,0.0006294632,0.011013293,0.7787098,0.092606895,0.00021486638,0.0011746247,0.0011289405,0.00089853466,0.006567883,0.10602805,0.00015728177],"about_ca_topic_score_codex":0.00885132,"about_ca_topic_score_gemma":0.044629883,"teacher_disagreement_score":0.065157704,"about_ca_system_score_codex":0.0040783123,"about_ca_system_score_gemma":0.023288101,"threshold_uncertainty_score":0.34459102},"labels":[],"label_agreement":null},{"id":"W4399245031","doi":"10.1007/978-3-031-60692-2_3","title":"Long-Term Gamification: A Survey","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Computer science; Term (time); Human–computer interaction; Astronomy","score_opus":0.04591368113220293,"score_gpt":0.33576381525734367,"score_spread":0.2898501341251407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399245031","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79007024,0.16251543,0.0033952212,0.002350913,0.0001567593,0.0001162713,0.0010656562,0.0001004392,0.04022903],"genre_scores_gemma":[0.8612444,0.12028773,0.0025921375,0.0009839025,0.00012629961,0.00015035199,0.0022442231,0.00008457025,0.012286419],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999064,0.00023262028,0.00010379905,0.00009524283,0.00038769102,0.00011658015],"domain_scores_gemma":[0.9939778,0.0031337652,0.0009823538,0.00017171772,0.00081131083,0.00092299795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024166359,0.00032077837,0.0005707967,0.0026109335,0.0003872959,0.001448923,0.000794674,0.0008620002,0.00598413],"category_scores_gemma":[0.008588436,0.00024372431,0.0005862516,0.002597584,0.00045883152,0.0028927042,0.0011798633,0.001216015,0.0017694532],"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.000515794,0.0019864524,0.41084006,0.0007913703,0.00014342627,0.00020251535,0.0014924153,0.00030088794,0.00025667224,0.0027121669,0.0064686886,0.57428956],"study_design_scores_gemma":[0.0000539962,0.0013116635,0.90263194,0.0026982955,0.00018809554,0.0037226889,0.005573924,0.0015398473,0.00053315726,0.0054466794,0.076220915,0.000078802856],"about_ca_topic_score_codex":0.0013599576,"about_ca_topic_score_gemma":0.0021403623,"teacher_disagreement_score":0.00598413,"about_ca_system_score_codex":0.00044423534,"about_ca_system_score_gemma":0.0007874393,"threshold_uncertainty_score":0.020018876},"labels":[],"label_agreement":null},{"id":"W4399245138","doi":"10.1007/978-3-031-60692-2_12","title":"Making Learning Engaging and Productive: $$\\mathsf \\small {SimLab}$$, a VR Lab to Bridge Between Classroom Theory and Industrial Practice in Chemical Engineering Education","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bridge (graph theory); Computer science; Mathematics education; Human–computer interaction; Multimedia; Mathematics","score_opus":0.037611845278104884,"score_gpt":0.3049978347848316,"score_spread":0.2673859895067267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399245138","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.021271855,0.0036879599,0.08001187,0.011276723,0.0017388456,0.00019089562,0.0002969297,0.004060033,0.87746495],"genre_scores_gemma":[0.09790614,0.004529993,0.14209974,0.004170178,0.00038910238,0.00038580917,0.0006015947,0.0018259659,0.7480916],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997882,0.00005807857,0.0000053136914,0.000036733487,0.000077198485,0.000034392306],"domain_scores_gemma":[0.99967825,0.00009989538,0.000014550161,0.000033641285,0.000043355445,0.00013035053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506003,0.00065108977,0.00020051147,0.00042936028,0.0009363283,0.00336387,0.001250013,0.0009878291,0.055816066],"category_scores_gemma":[0.0007164386,0.0003056976,0.0003181448,0.00023421351,0.0011665018,0.0027386372,0.0026043109,0.0018425592,0.020170769],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006752699,0.0005116484,0.00022831935,0.00034117018,0.000008065735,0.00018038737,0.0032249708,0.00060317223,0.018873075,0.11037989,0.37453112,0.4910507],"study_design_scores_gemma":[0.00003419849,0.00017505127,0.00085749157,0.00022541663,0.000007869382,0.00029174698,0.0018489267,0.0010712274,0.0081296,0.0371513,0.9501803,0.000026946529],"about_ca_topic_score_codex":0.0006940005,"about_ca_topic_score_gemma":0.0027862128,"teacher_disagreement_score":0.055816066,"about_ca_system_score_codex":0.00044514457,"about_ca_system_score_gemma":0.0012709076,"threshold_uncertainty_score":0.18672335},"labels":[],"label_agreement":null},{"id":"W4399259717","doi":"10.1007/978-3-031-61356-2_1","title":"Using the Technology Acceptance Model to Explore the User Experience of Smart Kitchen Use Among Older Adult Women","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia","score_opus":0.04628964283644104,"score_gpt":0.3061812271872813,"score_spread":0.25989158435084025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399259717","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.98628753,0.00019865665,0.002438573,0.0004639051,0.000014790113,0.00007798671,0.00004087936,0.000010436496,0.010467317],"genre_scores_gemma":[0.99653566,0.0002068782,0.0013934334,0.00008911962,0.0000039410734,0.00013760992,0.000033552962,0.000005529746,0.0015942027],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9987525,0.00082221004,0.000045776564,0.00005685945,0.00018891416,0.0001338297],"domain_scores_gemma":[0.9948456,0.0041634473,0.00032783332,0.00007263155,0.00036534484,0.00022504723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033361318,0.00042916817,0.000297752,0.0009259886,0.0010107403,0.0032277592,0.00050822046,0.0009745326,0.003783189],"category_scores_gemma":[0.0059155063,0.00024084325,0.00087155536,0.00084888685,0.0011684563,0.0029966289,0.0016065906,0.0015283739,0.00036326336],"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.00021072052,0.0011064851,0.3705223,0.0003464064,0.00010202157,0.0008891621,0.5052873,0.00087566336,0.0021293734,0.021595297,0.0017852547,0.09515007],"study_design_scores_gemma":[0.000043801538,0.0014571975,0.24788547,0.00043754213,0.00010722442,0.0006708765,0.7266185,0.008556963,0.0008793873,0.0048546647,0.008416579,0.00007171408],"about_ca_topic_score_codex":0.005090582,"about_ca_topic_score_gemma":0.008559819,"teacher_disagreement_score":0.005090582,"about_ca_system_score_codex":0.0012423997,"about_ca_system_score_gemma":0.0015343823,"threshold_uncertainty_score":0.017643332},"labels":[],"label_agreement":null},{"id":"W4399265526","doi":"10.1007/978-3-031-61066-0_22","title":"Annotating Virtual Tai Chi Instruction to Improve Learning Outcomes for Older Adults","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Multimedia; Human–computer interaction; Artificial intelligence","score_opus":0.007911310188572425,"score_gpt":0.2683946467762067,"score_spread":0.2604833365876343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399265526","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.8221724,0.0042654593,0.09571195,0.0010575493,0.0011021077,0.00036359185,0.0038179997,0.0066744834,0.064834446],"genre_scores_gemma":[0.80184907,0.0029992552,0.13286193,0.00067053334,0.0003368346,0.0006665326,0.005960262,0.00073770207,0.053917997],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998211,0.00005098508,0.000012344604,0.00004682863,0.000048639165,0.00002010131],"domain_scores_gemma":[0.99851876,0.0010440606,0.000083258936,0.000058397025,0.0002251641,0.00007033849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052320934,0.00044655858,0.0003188289,0.0005456364,0.00027769216,0.0009182474,0.00044086424,0.00044952473,0.0074176644],"category_scores_gemma":[0.0032982186,0.00010447323,0.00030752778,0.00043526446,0.00013891057,0.00083255727,0.00061076635,0.00044081087,0.0019423797],"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.0011434515,0.00068801665,0.010322011,0.0009931931,0.000056874887,0.00019805203,0.0028208622,0.002347831,0.027338548,0.0008152245,0.033690255,0.9195857],"study_design_scores_gemma":[0.00045678523,0.006636974,0.4152564,0.0036287082,0.0014816506,0.0019634552,0.012885836,0.17935553,0.13032313,0.03165659,0.21576224,0.00059272104],"about_ca_topic_score_codex":0.00137188,"about_ca_topic_score_gemma":0.0040515605,"teacher_disagreement_score":0.0074176644,"about_ca_system_score_codex":0.00024613965,"about_ca_system_score_gemma":0.00032244914,"threshold_uncertainty_score":0.024814606},"labels":[],"label_agreement":null},{"id":"W4399266487","doi":"10.1007/978-3-031-61379-1_5","title":"“I’m not planning on dying anytime soon!”: A Survey of Digital Legacy Planning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Grief, Bereavement, and Mental Health","field":"Psychology","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":"Computer science; Operations research; Engineering","score_opus":0.07379200925499445,"score_gpt":0.3551545977918132,"score_spread":0.2813625885368187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399266487","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.10312129,0.33927354,0.0061154715,0.12970008,0.0021801612,0.0001178549,0.0016661943,0.00030827895,0.41751713],"genre_scores_gemma":[0.3997315,0.5019292,0.007305976,0.02476897,0.00075585156,0.00014614557,0.0023883176,0.00020511604,0.06276897],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999041,0.00034905152,0.00006822138,0.0000625405,0.00030852287,0.00017048881],"domain_scores_gemma":[0.9967302,0.0018364133,0.00039773536,0.00010306907,0.00036825804,0.0005644087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002048273,0.0001864043,0.00017729134,0.0023016897,0.001301931,0.0032865799,0.00093875313,0.0008025469,0.011854473],"category_scores_gemma":[0.006974627,0.00022857334,0.00021354746,0.0071409424,0.0014129013,0.006291306,0.0020929577,0.0022848588,0.0019055987],"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.00003854196,0.00010156643,0.017236967,0.0006076877,0.00000899564,0.00011309847,0.011179406,0.00018686129,0.00006875764,0.033805817,0.17605917,0.7605931],"study_design_scores_gemma":[0.0000054959614,0.00005218691,0.031704392,0.0025335622,0.0000132962,0.00095703796,0.031997066,0.00019191124,0.00012404661,0.008595376,0.92380595,0.000019699557],"about_ca_topic_score_codex":0.015590723,"about_ca_topic_score_gemma":0.028642459,"teacher_disagreement_score":0.015590723,"about_ca_system_score_codex":0.0022698012,"about_ca_system_score_gemma":0.0061969003,"threshold_uncertainty_score":0.039657176},"labels":[],"label_agreement":null},{"id":"W4399266505","doi":"10.1007/978-3-031-60449-2_21","title":"A Proposal of AI-Powered HCI System to Enhance Spatial Design Creativity: InSpace","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Human–computer interaction; Creativity; Artificial intelligence","score_opus":0.011992560088127328,"score_gpt":0.25307026511043124,"score_spread":0.2410777050223039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399266505","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.031063518,0.0016660375,0.87384427,0.0038080555,0.0010457757,0.0006805164,0.00020488145,0.0051246015,0.082562275],"genre_scores_gemma":[0.24830918,0.0017759405,0.5769522,0.0013734836,0.00033101172,0.0010793476,0.00058987277,0.00043981662,0.16914913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00010107705,0.000018430615,0.0000940142,0.0001247415,0.00003395225],"domain_scores_gemma":[0.9996829,0.00006433401,0.000010596011,0.00004712656,0.00012624465,0.00006889773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006879518,0.0005791081,0.00026425903,0.00084146846,0.0009333498,0.0024372938,0.0016196534,0.0017628545,0.012844579],"category_scores_gemma":[0.0007917914,0.00028482624,0.00059643196,0.0005977061,0.0007977377,0.002037536,0.001552725,0.0007117046,0.0031622357],"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.00043000863,0.00053104846,0.0023275993,0.0012986775,0.00009650759,0.0020591517,0.0055861874,0.0057305726,0.13541049,0.24038783,0.045272484,0.5608694],"study_design_scores_gemma":[0.00039158526,0.001503688,0.003766248,0.00031588238,0.00024189535,0.004446727,0.0035805858,0.16011336,0.07147598,0.09592774,0.6580182,0.00021822996],"about_ca_topic_score_codex":0.00088633003,"about_ca_topic_score_gemma":0.0006431873,"teacher_disagreement_score":0.012844579,"about_ca_system_score_codex":0.00045380712,"about_ca_system_score_gemma":0.000972366,"threshold_uncertainty_score":0.042969465},"labels":[],"label_agreement":null},{"id":"W4399266555","doi":"10.1007/978-3-031-61379-1_13","title":"Privacy-Conscious Design Requirements to Support Older Adults’ Health Information Seeking","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Internet privacy; Computer security; Human–computer interaction","score_opus":0.026248150981412366,"score_gpt":0.30327731646089545,"score_spread":0.2770291654794831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399266555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08639572,0.00048326587,0.8430961,0.0042807227,0.00027794729,0.0014287792,0.0002977103,0.0020171222,0.06172272],"genre_scores_gemma":[0.56342083,0.00032973968,0.41720352,0.0013403363,0.00008902576,0.0010533882,0.0005251846,0.00036909268,0.015668945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9933397,0.0027237989,0.0007169326,0.00037445952,0.002296466,0.0005487089],"domain_scores_gemma":[0.9809441,0.009663821,0.0014647285,0.0028614996,0.0044974615,0.0005684286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076867635,0.0005773123,0.0002961036,0.0007126263,0.000719294,0.0029591308,0.0013041588,0.0020123809,0.003705189],"category_scores_gemma":[0.024214527,0.0006151672,0.0005587632,0.0003126942,0.00095614133,0.003337865,0.0018930483,0.0016437608,0.0010291905],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068144716,0.0010472863,0.00938615,0.0015625235,0.000101412385,0.0018466242,0.015851285,0.016708711,0.09966679,0.53449243,0.030641893,0.28801343],"study_design_scores_gemma":[0.00029019182,0.0013321672,0.008762421,0.0017501157,0.00037075768,0.004352659,0.00723586,0.15553647,0.112823844,0.26571244,0.44160298,0.00023013733],"about_ca_topic_score_codex":0.0009932696,"about_ca_topic_score_gemma":0.001473374,"teacher_disagreement_score":0.0076867635,"about_ca_system_score_codex":0.0006481817,"about_ca_system_score_gemma":0.0020756875,"threshold_uncertainty_score":0.040651977},"labels":[],"label_agreement":null},{"id":"W4399266679","doi":"10.1007/978-3-031-60898-8_1","title":"Persuasive Determinants of Physical Activity in Adults: Cultural Differences and the Moderating Effect of Gender and Age","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Physical activity; Medicine","score_opus":0.04622698891457211,"score_gpt":0.3750707616022059,"score_spread":0.3288437726876338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399266679","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.97487086,0.012769815,0.00044700882,0.0014702628,0.00019587514,0.000029995828,0.00034181404,0.000012056375,0.009862389],"genre_scores_gemma":[0.99094313,0.005066462,0.00063481496,0.00018818893,0.000111067166,0.000043914402,0.00021508007,0.000009051851,0.0027883833],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99921834,0.00037778093,0.00004385423,0.000108852175,0.00016190369,0.00008929377],"domain_scores_gemma":[0.9918589,0.006294422,0.0006811431,0.0002999027,0.00028210942,0.00058343046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018122827,0.0004296774,0.0005654279,0.0005771255,0.00038694678,0.0014959346,0.0005837824,0.001005975,0.0058467947],"category_scores_gemma":[0.007922389,0.00059832796,0.0008335428,0.00081952434,0.00048539334,0.00077160314,0.0007380279,0.0018094055,0.00034306018],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010833829,0.0013865739,0.8791934,0.0003124183,0.00096989784,0.00042818618,0.0059309676,0.00037918045,0.0021019217,0.002676262,0.0015845239,0.10395321],"study_design_scores_gemma":[0.000018914076,0.00025010254,0.9960146,0.00009753042,0.00024062747,0.0001007366,0.0013664776,0.00018823285,0.00020518656,0.00080490153,0.0007018608,0.000010888104],"about_ca_topic_score_codex":0.008497142,"about_ca_topic_score_gemma":0.015043852,"teacher_disagreement_score":0.008497142,"about_ca_system_score_codex":0.0004123378,"about_ca_system_score_gemma":0.0007044291,"threshold_uncertainty_score":0.019559503},"labels":[],"label_agreement":null},{"id":"W4399266906","doi":"10.1007/978-3-031-60441-6_13","title":"Reproducibility Challenges of External Computational Experiments in Scientific Workflow Management Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Saskatchewan","funders":"","keywords":"Computer science; Workflow; Reproducibility; Workflow management system; Software engineering; Data science; Database; Mathematics","score_opus":0.12367059093486894,"score_gpt":0.36389297976099794,"score_spread":0.240222388826129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399266906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077832684,0.0050343,0.88649124,0.010259653,0.0011484148,0.00030694774,0.00056196545,0.0042407694,0.0141240135],"genre_scores_gemma":[0.7581255,0.0017884371,0.22757058,0.0016677683,0.0021639834,0.00056478585,0.0010402679,0.0029088354,0.004169861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.8765347,0.071791634,0.008027253,0.012926883,0.028282983,0.00243653],"domain_scores_gemma":[0.37857223,0.44421214,0.01744444,0.13075186,0.02571463,0.003304641],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.14462344,0.0010677924,0.0030322182,0.0016633683,0.0027969969,0.013245321,0.008760638,0.004358267,0.0027847174],"category_scores_gemma":[0.37225083,0.0016734137,0.002088666,0.0032520955,0.009482251,0.014828619,0.007262974,0.006960113,0.0014291417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023455087,0.00086265366,0.027378911,0.0019401956,0.0014358358,0.0014532835,0.004358992,0.18092322,0.025442138,0.37801653,0.02183743,0.35400528],"study_design_scores_gemma":[0.0002073901,0.00038649712,0.0057534683,0.00037648127,0.00031601702,0.000706096,0.0007675107,0.43643317,0.032441497,0.50627196,0.016195495,0.00014440152],"about_ca_topic_score_codex":0.0020427045,"about_ca_topic_score_gemma":0.001439276,"teacher_disagreement_score":0.85537654,"about_ca_system_score_codex":0.003153086,"about_ca_system_score_gemma":0.006517804,"threshold_uncertainty_score":0.76485103},"labels":[],"label_agreement":null},{"id":"W4399266930","doi":"10.1007/978-3-031-60881-0_14","title":"“Mum Helps Me When the Internet Messes Up…”","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gender, Feminism, and Media","field":"Social Sciences","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.03158380472708189,"score_gpt":0.28781703796635133,"score_spread":0.25623323323926944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399266930","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.008538116,0.012211959,0.0039156643,0.09119426,0.014778887,0.00007671757,0.00018196207,0.00046283164,0.8686396],"genre_scores_gemma":[0.06983467,0.0044721877,0.001632707,0.03415188,0.0025142482,0.00009307684,0.00009783781,0.00030366302,0.8868997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922204,0.00034534885,0.000014705991,0.00009158783,0.00019926211,0.00012712266],"domain_scores_gemma":[0.99939823,0.00019734126,0.000042348624,0.00003753548,0.00017064104,0.00015397635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008602951,0.0006711147,0.0002844599,0.0006465575,0.004741791,0.0033942498,0.0006262276,0.0020730025,0.03648738],"category_scores_gemma":[0.0028949277,0.0003387386,0.00026830958,0.00045192149,0.0036807882,0.0064137317,0.002004923,0.0044354177,0.016211722],"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.000039638177,0.000027337837,0.00057763397,0.00011189726,0.000008185777,0.00027213254,0.02716025,0.000029825824,0.0006237635,0.069170535,0.8332631,0.06871577],"study_design_scores_gemma":[0.000002737129,0.000013993128,0.00035820747,0.00009163917,0.0000030839594,0.00040795168,0.011298879,0.000028618213,0.00017624353,0.0025387153,0.9850718,0.000008316024],"about_ca_topic_score_codex":0.004786448,"about_ca_topic_score_gemma":0.010632508,"teacher_disagreement_score":0.03648738,"about_ca_system_score_codex":0.0009898975,"about_ca_system_score_gemma":0.0010308169,"threshold_uncertainty_score":0.122062445},"labels":[],"label_agreement":null},{"id":"W4399267110","doi":"10.1007/978-3-031-60428-7_9","title":"iCare: Findings from the Design and Initial Evaluation of a Mental Health App Prototype for Working-Class Women in India","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Computer science; Class (philosophy); Mental health; Human–computer interaction; Artificial intelligence; Psychology; Psychiatry","score_opus":0.0782006144495276,"score_gpt":0.3891193416510762,"score_spread":0.3109187272015486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399267110","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.9836128,0.00010759482,0.0025156396,0.0005786092,0.000062871884,0.0031186282,0.00035433852,0.00026165906,0.0093878675],"genre_scores_gemma":[0.929459,0.0006744905,0.028653255,0.001785373,0.00003985379,0.0048811478,0.000844424,0.00024987324,0.033412512],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973693,0.0010054298,0.00018289259,0.00024463164,0.00058863265,0.00060907303],"domain_scores_gemma":[0.992687,0.0044811713,0.00029135367,0.0004231061,0.0014104128,0.0007069474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004671748,0.0009575343,0.0005627946,0.00064306596,0.0022562633,0.002941088,0.002227548,0.0014254827,0.0042957235],"category_scores_gemma":[0.012171455,0.000528883,0.00063622126,0.00041110712,0.0016374118,0.0015980629,0.002892824,0.0017071587,0.0012889206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003103708,0.03642311,0.07693907,0.0061562816,0.00026708035,0.0054058125,0.3798614,0.0013096189,0.03899082,0.0020604753,0.021272162,0.42821044],"study_design_scores_gemma":[0.0013178182,0.044429313,0.31281608,0.0020279018,0.0014934539,0.0029877522,0.5012607,0.0029379677,0.0376887,0.0013762482,0.09114177,0.0005222989],"about_ca_topic_score_codex":0.009994822,"about_ca_topic_score_gemma":0.03067025,"teacher_disagreement_score":0.009994822,"about_ca_system_score_codex":0.0017308383,"about_ca_system_score_gemma":0.0051479,"threshold_uncertainty_score":0.0247069},"labels":[],"label_agreement":null},{"id":"W4399267329","doi":"10.1007/978-3-031-61147-6_5","title":"ContentRank: Towards a Scoring and Ranking System for Screen Media Products Using Critical Reception Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Ranking (information retrieval); Scoring system; Information retrieval","score_opus":0.10481690206359777,"score_gpt":0.32124945586493325,"score_spread":0.21643255380133547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399267329","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.074811265,0.00095741113,0.7768348,0.00051953876,0.0003475585,0.0012065201,0.031927664,0.099276215,0.01411904],"genre_scores_gemma":[0.17973068,0.0004751803,0.7405311,0.0001605847,0.00027739353,0.00087684765,0.050601486,0.0017957916,0.025550945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820995,0.00028170744,0.00013405096,0.00025137913,0.000982928,0.0001399827],"domain_scores_gemma":[0.9969741,0.0008776044,0.0002430034,0.00025583478,0.0014667725,0.00018255234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018308138,0.0017935289,0.0010512978,0.008091583,0.000699082,0.0027111499,0.0014096334,0.0010865404,0.0085640615],"category_scores_gemma":[0.0056281486,0.0004732032,0.00071859075,0.0046479283,0.00030489222,0.0028246052,0.0015612883,0.0009069982,0.012766981],"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.0005323531,0.00038370298,0.013415267,0.00043232564,0.00014810826,0.00016070009,0.00021013604,0.006019841,0.025494803,0.0033882977,0.09960176,0.8502127],"study_design_scores_gemma":[0.00019080495,0.00067223836,0.026250701,0.00018812467,0.00024992754,0.0005144144,0.0006222153,0.8081257,0.06553174,0.015766691,0.081664115,0.00022344278],"about_ca_topic_score_codex":0.005587349,"about_ca_topic_score_gemma":0.01130453,"teacher_disagreement_score":0.0085640615,"about_ca_system_score_codex":0.00085286726,"about_ca_system_score_gemma":0.0010892054,"threshold_uncertainty_score":0.028649628},"labels":[],"label_agreement":null},{"id":"W4399267341","doi":"10.1007/978-3-031-60884-1_13","title":"Bridging the Digital Divide: Using Free Open-Source Tools to Expand Access to Shared-Use Computers in Schools and Libraries","year":2024,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","field":"Social Sciences","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":"Ontario Ministry of Research and Innovation; Administration for Community Living","keywords":"Disadvantage; Computer science; Bridging (networking); Hobby; The Internet; World Wide Web; Set (abstract data type); Government (linguistics); Computer users; Digital divide; Internet access; Service (business); Internet privacy; Multimedia; Computer security; Artificial intelligence","score_opus":0.0696492690209814,"score_gpt":0.34516725267955406,"score_spread":0.27551798365857266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399267341","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.48325872,0.0028643773,0.17444398,0.052722204,0.0013362848,0.00091896794,0.0007025855,0.013004849,0.27074802],"genre_scores_gemma":[0.8272399,0.0016017492,0.124157816,0.0044314796,0.0006657592,0.0006876714,0.0008363475,0.0032950072,0.037084233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98725986,0.005815796,0.0009979818,0.001021712,0.0034416546,0.0014629633],"domain_scores_gemma":[0.9175548,0.04838181,0.0039047315,0.013919105,0.006360906,0.009878646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015768383,0.0005334032,0.00040790314,0.005750849,0.00502368,0.014291529,0.0039774217,0.003568684,0.023105731],"category_scores_gemma":[0.067145415,0.0006572564,0.0009618637,0.004371463,0.006348158,0.04774078,0.039491635,0.0034307188,0.0060772137],"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.00044649153,0.0020168815,0.013341411,0.0005587111,0.00004199723,0.00064576004,0.06302608,0.00072584813,0.005639092,0.08136754,0.03750702,0.7946831],"study_design_scores_gemma":[0.0003076394,0.0007914068,0.027189782,0.0018095521,0.00019256714,0.0009043719,0.0805966,0.0069173463,0.010063749,0.20333321,0.667522,0.00037188016],"about_ca_topic_score_codex":0.002723344,"about_ca_topic_score_gemma":0.0050466205,"teacher_disagreement_score":0.023105731,"about_ca_system_score_codex":0.002282754,"about_ca_system_score_gemma":0.008456435,"threshold_uncertainty_score":0.08339214},"labels":[],"label_agreement":null},{"id":"W4399267351","doi":"10.1007/978-3-031-61147-6_15","title":"Data Shed: Interactive Art in the Service of Data Fluency","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Ontario College of Art and Design","funders":"","keywords":"Computer science; Fluency; Human–computer interaction; Service (business); Computer graphics (images); Mathematics education","score_opus":0.06400274263153828,"score_gpt":0.3321290032210698,"score_spread":0.26812626058953154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399267351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008046699,0.00936368,0.65873563,0.017278424,0.003133869,0.00012540819,0.0010404412,0.006707415,0.29556844],"genre_scores_gemma":[0.3199992,0.0101924585,0.34801677,0.006763946,0.0059747156,0.0005837197,0.0024653391,0.00807699,0.29792687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983152,0.0006362656,0.00009532041,0.00028135697,0.00056044554,0.000111473266],"domain_scores_gemma":[0.9929004,0.0047891713,0.0001230557,0.0014787011,0.00043305318,0.00027563705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033639944,0.00080974237,0.0007188319,0.0023280936,0.0022886829,0.012493264,0.0028427544,0.001953375,0.038802017],"category_scores_gemma":[0.012195786,0.0006361158,0.0008641919,0.0029987164,0.007138682,0.020044092,0.006650213,0.004112395,0.0074924426],"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.00011688892,0.00002615113,0.00020166801,0.0002379046,0.00001633334,0.0001628535,0.005358779,0.00079315185,0.0015259736,0.825681,0.07374951,0.09212976],"study_design_scores_gemma":[0.000022217857,0.00002431471,0.00016735264,0.00013860427,0.000012397391,0.00040145163,0.0015807933,0.005545933,0.0017161936,0.40346077,0.5868999,0.000030172716],"about_ca_topic_score_codex":0.0009957298,"about_ca_topic_score_gemma":0.0009922457,"teacher_disagreement_score":0.038802017,"about_ca_system_score_codex":0.0010950435,"about_ca_system_score_gemma":0.001061456,"threshold_uncertainty_score":0.12980574},"labels":[],"label_agreement":null},{"id":"W4399267439","doi":"10.1007/978-3-031-60405-8_1","title":"Through the Waves: An Auto-ethnographic Perspective on HCI Design and Research","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Computer science; Perspective (graphical); Ethnography; Human–computer interaction; Artificial intelligence; Sociology; Anthropology","score_opus":0.08449005280122102,"score_gpt":0.3720970898145369,"score_spread":0.28760703701331586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399267439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23798792,0.011805018,0.46743068,0.027369851,0.0007421966,0.0010620124,0.0005562415,0.0005860294,0.25246018],"genre_scores_gemma":[0.9098328,0.004558379,0.061857644,0.0019405328,0.00014629461,0.0008237914,0.0001507098,0.00045484866,0.020234967],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9790323,0.01862866,0.00030507156,0.0006033667,0.00081326824,0.00061737857],"domain_scores_gemma":[0.9531333,0.042717937,0.000668237,0.001987999,0.0009831811,0.00050935114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014501952,0.0010150215,0.00047769694,0.0038911595,0.006604018,0.014563126,0.0021010463,0.0028579403,0.0042967964],"category_scores_gemma":[0.018298818,0.0012094734,0.00043442298,0.0045687263,0.027693508,0.026417503,0.0067315153,0.0036177593,0.0006007451],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035522404,0.00003410622,0.0011868653,0.00023281915,0.000009012599,0.0004119144,0.7947288,0.00022758708,0.0010692637,0.17427677,0.0019165954,0.025870824],"study_design_scores_gemma":[0.000019192994,0.0000653889,0.0016871187,0.00071622,0.00002106246,0.00070401875,0.7889079,0.0012644747,0.0015534235,0.09944434,0.10558144,0.000035490386],"about_ca_topic_score_codex":0.0061274166,"about_ca_topic_score_gemma":0.008543656,"teacher_disagreement_score":0.014563126,"about_ca_system_score_codex":0.0028925475,"about_ca_system_score_gemma":0.0028089469,"threshold_uncertainty_score":0.07669455},"labels":[],"label_agreement":null},{"id":"W4399267655","doi":"10.1007/978-3-031-60611-3_15","title":"Emotion Detection from Facial Expression in Online Learning Through Using Synthetic Image Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"Athabasca University","funders":"","keywords":"Computer science; Facial expression; Artificial intelligence; Facial expression recognition; Computer vision; Image (mathematics); Expression (computer science); Speech recognition; Pattern recognition (psychology); Facial recognition system; Programming language","score_opus":0.02889878024060676,"score_gpt":0.26887190059306637,"score_spread":0.2399731203524596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399267655","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.19152525,0.00020088025,0.80113655,0.00013402622,0.00015501713,0.00010831024,0.00029069898,0.0019398378,0.0045094085],"genre_scores_gemma":[0.7538356,0.00012918127,0.24019103,0.00008517183,0.000040696945,0.00009140305,0.00060368376,0.00016863267,0.004854651],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982244,0.00004445918,0.000006675714,0.00005442911,0.000048134403,0.000023862802],"domain_scores_gemma":[0.9996779,0.00014896959,0.000019348205,0.000044312226,0.000091255664,0.000018195433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041259173,0.0003825245,0.00033120823,0.00025183475,0.00011189835,0.00035396797,0.00039283565,0.00031623183,0.002791285],"category_scores_gemma":[0.0008525248,0.0001333938,0.00035001172,0.00020005695,0.00017561844,0.00039899643,0.00038440092,0.0003682848,0.00073489035],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005340369,0.00030418482,0.0031490203,0.000082378254,0.000058656817,0.00014871791,0.00010873879,0.06944311,0.13495918,0.00215485,0.00393096,0.7851262],"study_design_scores_gemma":[0.000009631166,0.00013175013,0.0018881588,0.0000050397307,0.000015586138,0.0000860761,0.000023439417,0.9681814,0.027958462,0.0009843217,0.0007080974,0.00000794833],"about_ca_topic_score_codex":0.00080495834,"about_ca_topic_score_gemma":0.0008785722,"teacher_disagreement_score":0.002791285,"about_ca_system_score_codex":0.00017802177,"about_ca_system_score_gemma":0.00014196636,"threshold_uncertainty_score":0.009337783},"labels":[],"label_agreement":null},{"id":"W4399268060","doi":"10.1007/978-3-031-60609-0_3","title":"Verification and Validation of Adaptive Instructional Systems: A Text Mining Review","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"National Research Council Canada","funders":"","keywords":"Computer science; Data mining; Artificial intelligence; Software engineering","score_opus":0.028325563660772334,"score_gpt":0.2557631202006797,"score_spread":0.22743755653990738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399268060","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018492656,0.7986539,0.15985838,0.008650116,0.0013128847,0.00084181904,0.0021694459,0.0021349888,0.007885772],"genre_scores_gemma":[0.18401006,0.5132598,0.2819238,0.004738351,0.0030340978,0.0010829134,0.0072727953,0.00086536095,0.003812759],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.97299755,0.0069166613,0.00484952,0.0041653533,0.010695728,0.00037511406],"domain_scores_gemma":[0.60735375,0.33189392,0.013185637,0.014822112,0.031841498,0.000903105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04343792,0.0017422796,0.003335965,0.012190629,0.0009105053,0.006397195,0.007207676,0.0028338297,0.0024154475],"category_scores_gemma":[0.16930084,0.0009727942,0.0020944641,0.0066114394,0.004413033,0.0121580865,0.0026271835,0.0023982818,0.0021189877],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016678794,0.00027129473,0.0062022572,0.008223252,0.00034566055,0.00010618665,0.0003306684,0.0021712855,0.0019661917,0.0047264043,0.0072487085,0.9682414],"study_design_scores_gemma":[0.0005383126,0.0020628734,0.06896038,0.0621306,0.004624861,0.004314587,0.003586344,0.10215077,0.10310758,0.12367795,0.5238973,0.0009485408],"about_ca_topic_score_codex":0.002902389,"about_ca_topic_score_gemma":0.0022268381,"teacher_disagreement_score":0.04343792,"about_ca_system_score_codex":0.0017396582,"about_ca_system_score_gemma":0.0064788642,"threshold_uncertainty_score":0.2297244},"labels":[],"label_agreement":null},{"id":"W4399268073","doi":"10.1007/978-3-031-60609-0_4","title":"Constructing Compelling Persuasive Messages: A Pilot Study Among University Students Assessing Three Persuasive Technology Strategies","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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 Saskatchewan","funders":"","keywords":"Persuasive technology; Computer science; Persuasive communication; Multimedia; Persuasion; Human–computer interaction; World Wide Web; Mathematics education; Psychology; Social psychology","score_opus":0.02908533171843231,"score_gpt":0.2965188204753135,"score_spread":0.2674334887568812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399268073","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.9987225,0.00001710352,0.00043100613,0.000019867126,0.000008218348,0.00019212581,0.000010874157,0.000028052831,0.0005701592],"genre_scores_gemma":[0.99257326,0.00007047531,0.0040692855,0.00007685906,0.000017635739,0.00054120057,0.000052724812,0.000028718958,0.0025698105],"study_design_codex":"qualitative","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.9968418,0.0013594474,0.00027068166,0.00046422562,0.00061756506,0.00044621306],"domain_scores_gemma":[0.95614654,0.030848349,0.0019564151,0.0018783,0.005358551,0.0038119443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072760573,0.0014285975,0.0013567151,0.0016769951,0.0027619163,0.004345841,0.0014866904,0.0023349503,0.0052694255],"category_scores_gemma":[0.03206477,0.0011281284,0.0007115429,0.0007391308,0.0009949205,0.0019301524,0.0015426802,0.0027116488,0.0020393934],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063375696,0.09033798,0.19763407,0.0009299486,0.00031765288,0.0024798773,0.42156792,0.0009084701,0.098842226,0.00079577137,0.0013188188,0.17852975],"study_design_scores_gemma":[0.0039133667,0.13634819,0.47528467,0.0002598838,0.0016666788,0.0028652998,0.2813344,0.008169033,0.07459005,0.002636204,0.012345,0.00058728305],"about_ca_topic_score_codex":0.00097518595,"about_ca_topic_score_gemma":0.0013382661,"teacher_disagreement_score":0.0072760573,"about_ca_system_score_codex":0.0005514126,"about_ca_system_score_gemma":0.0015604314,"threshold_uncertainty_score":0.038479924},"labels":[],"label_agreement":null},{"id":"W4399268122","doi":"10.1007/978-3-031-61685-3_5","title":"How Hexad Player Types Affect Student Behaviour in Three Versions of a Peer-Quizzing Game","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Computer science; Affect (linguistics); Multimedia; Mathematics education; Psychology","score_opus":0.03323600867658441,"score_gpt":0.3355041598697418,"score_spread":0.3022681511931574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399268122","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.9982223,0.000010790817,0.00012716503,0.00001232162,0.0000044396384,0.000007328038,0.000030449308,0.000009507036,0.0015756278],"genre_scores_gemma":[0.99337053,0.000019542833,0.0004073115,0.00002113189,0.0000019000952,0.00002387529,0.00009711135,0.000017396149,0.0060411603],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999522,0.0001434466,0.000028268136,0.00008549982,0.00014680029,0.00007408261],"domain_scores_gemma":[0.9961831,0.0027323985,0.00025537837,0.000105147265,0.0002434561,0.000480594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596112,0.00026910738,0.00029548514,0.00027142128,0.00025674218,0.0016698138,0.0004586667,0.0005292151,0.0048917476],"category_scores_gemma":[0.0052452763,0.00021529729,0.00021216231,0.00017744151,0.00026800536,0.0004179978,0.00059046864,0.000692374,0.00088208175],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.023444105,0.018568072,0.6294396,0.0004233006,0.00068414205,0.0006071272,0.017830806,0.009086552,0.13938412,0.0026425915,0.0049842573,0.15290534],"study_design_scores_gemma":[0.00017104257,0.00388096,0.9659245,0.000033028813,0.000255846,0.00013222666,0.004767254,0.013057969,0.009086897,0.00088427245,0.0017362058,0.000069818576],"about_ca_topic_score_codex":0.0037199482,"about_ca_topic_score_gemma":0.006120617,"teacher_disagreement_score":0.0048917476,"about_ca_system_score_codex":0.00032202914,"about_ca_system_score_gemma":0.00014477054,"threshold_uncertainty_score":0.016364574},"labels":[],"label_agreement":null},{"id":"W4399268169","doi":"10.1007/978-3-031-61041-7_15","title":"Affecting Audience Valence and Arousal in 360 Immersive Environments: How Powerful Neural Style Transfer Is?","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Valence (chemistry); Arousal; Style (visual arts); Human–computer interaction; Multimedia; Transfer (computing); Psychology; Visual arts; Art; Social psychology; Chemistry; Operating system","score_opus":0.01140488542038161,"score_gpt":0.22253140109579653,"score_spread":0.2111265156754149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399268169","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.95271057,0.001512074,0.0241008,0.0004328243,0.00020751993,0.00005848798,0.00014880081,0.0002243483,0.020604655],"genre_scores_gemma":[0.99046624,0.00061098847,0.0053297,0.00012046748,0.00007026537,0.000033551336,0.00006633168,0.000061113555,0.003241329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999006,0.00002555107,0.0000035759278,0.000029348585,0.000018187671,0.000022688],"domain_scores_gemma":[0.9997774,0.00011890891,0.000021133123,0.00002502541,0.000022559792,0.000035070683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029315616,0.00039605246,0.0002433639,0.000080453276,0.00008968584,0.0008108775,0.00024848583,0.00030440398,0.0041047917],"category_scores_gemma":[0.001751887,0.00016840191,0.00024297278,0.00009255687,0.00019499395,0.00085482403,0.0004886127,0.000563778,0.0005830456],"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.0013529386,0.00069628557,0.009270214,0.00030068352,0.00017744517,0.00006377073,0.000611653,0.0035065492,0.45929885,0.0015726123,0.0014021466,0.5217469],"study_design_scores_gemma":[0.00046371564,0.006023382,0.6712575,0.00038569554,0.0010646663,0.000660721,0.0019074704,0.08669256,0.19613352,0.024833355,0.010422453,0.00015507854],"about_ca_topic_score_codex":0.00023348645,"about_ca_topic_score_gemma":0.0004447323,"teacher_disagreement_score":0.0041047917,"about_ca_system_score_codex":0.00008187816,"about_ca_system_score_gemma":0.00007542134,"threshold_uncertainty_score":0.013731897},"labels":[],"label_agreement":null},{"id":"W4399272979","doi":"10.1007/978-3-031-61057-8_33","title":"Infonomics of Autonomous Digital Twins","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Transformation in Industry","field":"Engineering","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":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.012340271229794832,"score_gpt":0.20827334164054334,"score_spread":0.1959330704107485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399272979","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16907641,0.0064686555,0.1623194,0.0042203325,0.0013061268,0.00005208831,0.00032680246,0.00017902942,0.65605116],"genre_scores_gemma":[0.8913546,0.0022798257,0.019999675,0.0004769523,0.00054047554,0.000073490504,0.00015454176,0.00008007159,0.08504038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999863,0.00003240036,0.0000067220467,0.00002691089,0.00004549885,0.000025420713],"domain_scores_gemma":[0.99971956,0.000117792806,0.000028822795,0.000044196575,0.00005123085,0.00003833842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018919283,0.00016867464,0.00022225757,0.0006758071,0.00085399847,0.0018228813,0.0003974739,0.000627455,0.0072588525],"category_scores_gemma":[0.0013956379,0.00014906815,0.00021480295,0.00053417555,0.0013272642,0.0022018275,0.0008190009,0.0007930755,0.00084038073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055274927,0.0000025091813,0.000035685982,0.000007996163,6.8396656e-7,0.000015812784,0.000052590134,0.00041295955,0.00027849275,0.99504143,0.0007939469,0.0033524246],"study_design_scores_gemma":[0.0000048747156,0.000008396535,0.00012886726,0.000011258363,0.000001979985,0.00009095914,0.00010236266,0.0045981826,0.00052836735,0.977732,0.016787618,0.0000051838792],"about_ca_topic_score_codex":0.0005465791,"about_ca_topic_score_gemma":0.00050202344,"teacher_disagreement_score":0.0072588525,"about_ca_system_score_codex":0.0007304146,"about_ca_system_score_gemma":0.00040330735,"threshold_uncertainty_score":0.02428329},"labels":[],"label_agreement":null},{"id":"W4399408681","doi":"10.1007/978-3-031-62488-9_14","title":"Q-Learning-Augmented Grant-Free NOMA for URLLC","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Noma; Computer science; Artificial intelligence; Telecommunications","score_opus":0.013593592780344069,"score_gpt":0.23460920314925354,"score_spread":0.2210156103689095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399408681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063042296,0.00024142717,0.96185446,0.0009708512,0.0005800995,0.00031922408,0.00050012657,0.008080195,0.021149347],"genre_scores_gemma":[0.3437161,0.0002913235,0.6116746,0.0007210783,0.0005022791,0.0010875509,0.0011603519,0.0013786749,0.039468143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992669,0.0033390473,0.00044678853,0.00084058713,0.0017523984,0.0009520686],"domain_scores_gemma":[0.9839797,0.0077682156,0.00046282733,0.0047085728,0.0023112167,0.00076941686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007896966,0.0007898171,0.0017552159,0.001189834,0.0026247755,0.004059752,0.003686928,0.0026067088,0.04256193],"category_scores_gemma":[0.03159464,0.00061613624,0.0014590931,0.0016671863,0.0024876783,0.005818086,0.009053754,0.0035244816,0.014411281],"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.0009286359,0.0005428522,0.0010191958,0.0004333282,0.00006714466,0.00025111303,0.00047484413,0.049135208,0.0023727564,0.41002044,0.056968585,0.47778594],"study_design_scores_gemma":[0.00015736179,0.0001414996,0.00023739405,0.00014994547,0.000034035216,0.00014607358,0.00017028446,0.496458,0.0030081314,0.4569886,0.0424456,0.0000631207],"about_ca_topic_score_codex":0.0035985028,"about_ca_topic_score_gemma":0.005977697,"teacher_disagreement_score":0.04256193,"about_ca_system_score_codex":0.00200281,"about_ca_system_score_gemma":0.0066990955,"threshold_uncertainty_score":0.14238381},"labels":[],"label_agreement":null},{"id":"W4399430425","doi":"10.1007/978-3-031-62687-6_3","title":"A Logic of Isolation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Isolation (microbiology)","score_opus":0.01892786101398725,"score_gpt":0.2493618175634031,"score_spread":0.23043395654941584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399430425","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.0073459526,0.00413213,0.20300284,0.008598578,0.00079055363,0.000056829605,0.0003232828,0.0005543642,0.7751955],"genre_scores_gemma":[0.6794052,0.0038695703,0.079905614,0.0059638848,0.001754861,0.00037948313,0.0010295097,0.0009922569,0.22669964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982128,0.00062178413,0.00008903435,0.00052522233,0.00030695813,0.00024412668],"domain_scores_gemma":[0.99859875,0.0006689454,0.00008267028,0.0003502625,0.00018733315,0.00011201428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017060392,0.0009588493,0.0008414095,0.0016142649,0.0038724872,0.0066480213,0.0015704534,0.0018660936,0.02267993],"category_scores_gemma":[0.003653575,0.00084492774,0.0012624586,0.0013011885,0.011848206,0.015736092,0.005618819,0.0063908817,0.0049577854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007272794,0.0000024933302,0.000019137738,0.000010622256,0.000001751263,0.000010560077,0.00014389734,0.00005672807,0.000054902357,0.99557185,0.0016934081,0.002427315],"study_design_scores_gemma":[0.000006260316,0.000005128384,0.000026620388,0.000015335047,0.000004691864,0.000038346378,0.000098098964,0.00032312836,0.00014278175,0.9690313,0.030304547,0.0000038307394],"about_ca_topic_score_codex":0.0014284219,"about_ca_topic_score_gemma":0.001184935,"teacher_disagreement_score":0.02267993,"about_ca_system_score_codex":0.0021934249,"about_ca_system_score_gemma":0.0011993776,"threshold_uncertainty_score":0.075871885},"labels":[],"label_agreement":null},{"id":"W4399477061","doi":"10.1007/978-3-031-62743-9","title":"Post-Quantum Cryptography","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Standards and Technology; University of Waterloo; KU Leuven; Indian Statistical Institute; Lunds Universitet; Sogang University; Ewha Womans University; Shanghai Jiao Tong University; Tsinghua University; National Institute of Advanced Industrial Science and Technology","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Theoretical computer science; Quantum; Computer security; Public-key cryptography; Encryption; Quantum information; Quantum mechanics; Physics","score_opus":0.007546158104078718,"score_gpt":0.23331539585552466,"score_spread":0.22576923775144594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399477061","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008998028,0.0043737823,0.033205874,0.0024063364,0.0017107081,0.00004334248,0.00020995736,0.00032863047,0.94872326],"genre_scores_gemma":[0.10302347,0.0036562723,0.0084209945,0.00072438363,0.0009065691,0.000058610894,0.00022071814,0.0002858886,0.88270307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999739,0.000041646665,0.0000066935477,0.00004149324,0.00013845573,0.000032707896],"domain_scores_gemma":[0.9996691,0.00008083537,0.000020412106,0.00016003773,0.0000498546,0.000019890014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031273448,0.0006005012,0.00043243315,0.00059457764,0.0008886623,0.0019784556,0.0006132284,0.0007508551,0.05902542],"category_scores_gemma":[0.0009754972,0.00028869067,0.0003097423,0.00061834115,0.0015104789,0.003045965,0.0013130696,0.0021995187,0.021296414],"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.00003153673,0.000021223746,0.0000622916,0.000075243486,0.0000053475005,0.000031041407,0.000059059348,0.00041645623,0.0023129564,0.9276981,0.023277093,0.046009634],"study_design_scores_gemma":[0.000011221875,0.000051957515,0.00035132468,0.00008750485,0.000009155081,0.00032365732,0.000038800503,0.0018121814,0.0065079397,0.6320231,0.35876736,0.000015726506],"about_ca_topic_score_codex":0.00014923753,"about_ca_topic_score_gemma":0.0002658075,"teacher_disagreement_score":0.05902542,"about_ca_system_score_codex":0.00094873155,"about_ca_system_score_gemma":0.0005673273,"threshold_uncertainty_score":0.1974597},"labels":[],"label_agreement":null},{"id":"W4399479580","doi":"10.1007/978-3-031-62697-5_9","title":"The Concurrent Calculi Formalisation Benchmark","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Benchmark (surveying); Programming language; Parallel computing; Geology","score_opus":0.021515533045127634,"score_gpt":0.25567309727188947,"score_spread":0.23415756422676184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399479580","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.28229338,0.0042740074,0.34291846,0.0052916403,0.0017757489,0.0008789279,0.008295936,0.024278369,0.32999364],"genre_scores_gemma":[0.74207103,0.0008112263,0.2049366,0.00064980285,0.00033937223,0.00047967222,0.007109668,0.0032767428,0.04032579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9955284,0.0011218947,0.00024195547,0.00058064464,0.0019978068,0.0005292765],"domain_scores_gemma":[0.98619926,0.00725593,0.00033731433,0.0031887447,0.0026341577,0.00038468224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030695274,0.00081933616,0.0007859426,0.0016049952,0.0016858493,0.003418031,0.0028081136,0.001462465,0.014635847],"category_scores_gemma":[0.017195757,0.00047675916,0.00076842174,0.002407639,0.001588355,0.0038293279,0.0022346058,0.0024358924,0.002263733],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010361506,0.0011256515,0.0012907517,0.0009842933,0.000080139056,0.0002975866,0.0005404975,0.07357802,0.008395634,0.6556717,0.054317806,0.20268184],"study_design_scores_gemma":[0.0006447893,0.0002617846,0.0006600001,0.0003042127,0.0000884181,0.00028352917,0.00038705586,0.28218037,0.03901418,0.5329343,0.14314999,0.00009135049],"about_ca_topic_score_codex":0.008353546,"about_ca_topic_score_gemma":0.013664013,"teacher_disagreement_score":0.014635847,"about_ca_system_score_codex":0.0021220592,"about_ca_system_score_gemma":0.0044278144,"threshold_uncertainty_score":0.04896182},"labels":[],"label_agreement":null},{"id":"W4399500535","doi":"10.1007/978-3-031-62746-0","title":"Post-Quantum Cryptography","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Standards and Technology; University of Waterloo; KU Leuven; Indian Statistical Institute; Lunds Universitet; Sogang University; Ewha Womans University; Shanghai Jiao Tong University; Tsinghua University; National Institute of Advanced Industrial Science and Technology","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Quantum; Theoretical computer science; Computer security; Public-key cryptography; Encryption; Quantum information; Physics; Quantum mechanics","score_opus":0.007546158104078718,"score_gpt":0.23331539585552466,"score_spread":0.22576923775144594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399500535","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008998028,0.0043737823,0.033205874,0.0024063364,0.0017107081,0.00004334248,0.00020995736,0.00032863047,0.94872326],"genre_scores_gemma":[0.10302347,0.0036562723,0.0084209945,0.00072438363,0.0009065691,0.000058610894,0.00022071814,0.0002858886,0.88270307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999739,0.000041646665,0.0000066935477,0.00004149324,0.00013845573,0.000032707896],"domain_scores_gemma":[0.9996691,0.00008083537,0.000020412106,0.00016003773,0.0000498546,0.000019890014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031273448,0.0006005012,0.00043243315,0.00059457764,0.0008886623,0.0019784556,0.0006132284,0.0007508551,0.05902542],"category_scores_gemma":[0.0009754972,0.00028869067,0.0003097423,0.00061834115,0.0015104789,0.003045965,0.0013130696,0.0021995187,0.021296414],"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.00003153673,0.000021223746,0.0000622916,0.000075243486,0.0000053475005,0.000031041407,0.000059059348,0.00041645623,0.0023129564,0.9276981,0.023277093,0.046009634],"study_design_scores_gemma":[0.000011221875,0.000051957515,0.00035132468,0.00008750485,0.000009155081,0.00032365732,0.000038800503,0.0018121814,0.0065079397,0.6320231,0.35876736,0.000015726506],"about_ca_topic_score_codex":0.00014923753,"about_ca_topic_score_gemma":0.0002658075,"teacher_disagreement_score":0.05902542,"about_ca_system_score_codex":0.00094873155,"about_ca_system_score_gemma":0.0005673273,"threshold_uncertainty_score":0.1974597},"labels":[],"label_agreement":null},{"id":"W4399505164","doi":"10.1007/978-3-031-61362-3_6","title":"Influences of ICT Tools on the Empathizing Phase of the Design Thinking Process of Design Students","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","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":"George Brown College","funders":"","keywords":"Computer science; Process (computing); Design process; Information and Communications Technology; Design thinking; Multimedia; Human–computer interaction; Work in process; World Wide Web; Engineering; Programming language; Operations management","score_opus":0.06832782790241423,"score_gpt":0.33517330514814275,"score_spread":0.2668454772457285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399505164","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.9871464,0.00007717506,0.00078319066,0.00007704174,0.000009159221,0.000026826212,0.00001513696,0.000026015812,0.011839024],"genre_scores_gemma":[0.9976928,0.00006426076,0.000556593,0.000021091513,0.0000030984322,0.000029328723,0.000021290087,0.000027047194,0.0015844816],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9945521,0.0036655292,0.00018063534,0.0003694023,0.0007096908,0.0005225845],"domain_scores_gemma":[0.90308195,0.08557277,0.0036390515,0.0014193901,0.0025832625,0.0037035549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045895614,0.00034880056,0.00025900017,0.000898925,0.0008328148,0.005414313,0.0004810468,0.00058181793,0.006520713],"category_scores_gemma":[0.05885255,0.00032701294,0.0003056064,0.0006695419,0.0014330723,0.0017091223,0.0017008787,0.0018075695,0.0006718091],"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.015080973,0.009956945,0.23885414,0.0010095283,0.00029004193,0.0016643775,0.28359416,0.0047933296,0.0936978,0.017704995,0.0024640355,0.33088964],"study_design_scores_gemma":[0.00053143495,0.0054895314,0.79900634,0.0006795401,0.00070342625,0.00067197555,0.12633727,0.0071510626,0.039120078,0.008875663,0.011247009,0.00018670411],"about_ca_topic_score_codex":0.0015508602,"about_ca_topic_score_gemma":0.0015875938,"teacher_disagreement_score":0.006520713,"about_ca_system_score_codex":0.001057685,"about_ca_system_score_gemma":0.0018503653,"threshold_uncertainty_score":0.024272203},"labels":[],"label_agreement":null},{"id":"W4399567210","doi":"10.1007/978-3-031-61433-0_8","title":"Relational Structures for Interval Order Semantics of Concurrent Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Interval (graph theory); Operational semantics; Theoretical computer science; Order (exchange); Algorithm; Mathematics; Combinatorics","score_opus":0.0521159731185842,"score_gpt":0.31178800946567387,"score_spread":0.2596720363470897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399567210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008700169,0.0039763707,0.92566997,0.0009310083,0.00056705065,0.00014854276,0.00050291064,0.0012171749,0.058286864],"genre_scores_gemma":[0.32793784,0.0062330905,0.62283254,0.00059202657,0.0016444094,0.0006588118,0.001715404,0.0008312823,0.037554555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869424,0.00028787347,0.00015450649,0.00020929224,0.00053780305,0.00011635998],"domain_scores_gemma":[0.9985952,0.0007472019,0.000108487264,0.0002860781,0.0002017531,0.000061293256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016075133,0.0008804196,0.0007490245,0.0014206859,0.001021456,0.004244446,0.0017154163,0.00094939576,0.010192743],"category_scores_gemma":[0.0034063337,0.0007786263,0.0011796519,0.0021811842,0.0021153723,0.008448958,0.0014954766,0.0034221918,0.0024256618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015231884,0.000011865081,0.00001933626,0.000060313465,0.0000041587086,0.000028979977,0.00023515089,0.0008715436,0.00081862585,0.9838757,0.0013141643,0.0127449725],"study_design_scores_gemma":[0.00002051871,0.000020973268,0.00005183355,0.00004812628,0.000012872366,0.0000657118,0.00008446789,0.005502871,0.0010240464,0.96062624,0.03252915,0.000013195798],"about_ca_topic_score_codex":0.0012585362,"about_ca_topic_score_gemma":0.0010076531,"teacher_disagreement_score":0.010192743,"about_ca_system_score_codex":0.001714187,"about_ca_system_score_gemma":0.0008736852,"threshold_uncertainty_score":0.03409815},"labels":[],"label_agreement":null},{"id":"W4399684666","doi":"10.1007/978-3-031-61353-1_19","title":"Guided Fantasy: A Research Method for Innovative Products","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Strategies and Innovation","field":"Business, Management and Accounting","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":"Polar Mobile (Canada)","funders":"","keywords":"Computer science; Fantasy; Computer graphics (images); Human–computer interaction; Artificial intelligence","score_opus":0.10473381770057112,"score_gpt":0.3607381700703356,"score_spread":0.2560043523697645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399684666","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.08916082,0.0024931238,0.50111276,0.0015386879,0.00069204706,0.002469903,0.0010671868,0.0005695339,0.40089592],"genre_scores_gemma":[0.5297149,0.001719137,0.3631848,0.0008373683,0.00015989489,0.009878761,0.0006731627,0.0006409296,0.09319112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512815,0.003264885,0.00012843816,0.0005223833,0.000838194,0.000117893745],"domain_scores_gemma":[0.9852411,0.011854205,0.00033921964,0.0015921862,0.00071979035,0.0002535382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042123925,0.0011804119,0.0006317933,0.0033249205,0.0014608246,0.005755407,0.0024362504,0.0014566268,0.033394955],"category_scores_gemma":[0.01858695,0.00043001628,0.0007380423,0.0033346573,0.00543165,0.00780583,0.0043574558,0.0020492189,0.0027745294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031341874,0.00035738933,0.0013398848,0.0012644321,0.00004780949,0.00025644855,0.035127558,0.0005136987,0.0042202463,0.7199673,0.008058464,0.22853345],"study_design_scores_gemma":[0.0006010339,0.0011265614,0.0065878746,0.0014645986,0.00018708389,0.0022864612,0.052423224,0.010277272,0.011096301,0.6753558,0.2384316,0.0001621131],"about_ca_topic_score_codex":0.0005164842,"about_ca_topic_score_gemma":0.0008475149,"teacher_disagreement_score":0.033394955,"about_ca_system_score_codex":0.0016055882,"about_ca_system_score_gemma":0.0014584318,"threshold_uncertainty_score":0.111717284},"labels":[],"label_agreement":null},{"id":"W4399698994","doi":"10.1007/978-3-031-62362-2","title":"Web Engineering","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Web Applications and Data Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitat Politècnica de València; Universidad de Extremadura; Universitat Oberta de Catalunya; Novosibirsk State Technical University; Universidad de Castilla-La Mancha; Università degli Studi di Brescia; Korea Advanced Institute of Science and Technology; Technische Universität Berlin; Universidade de Lisboa; Leibniz-Gemeinschaft; Tallinna Tehnikaülikool; University of Hertfordshire; Universitat Jaume I; Technische Universität Dresden; Aalto-Yliopisto; Universidad de Alicante; Technische Universität Wien; Università di Pisa; Euskal Herriko Unibertsitatea; Universidad Nacional de La Plata; University of Ottawa; Sorbonne Université; Technische Universität Chemnitz; Indian Institute of Technology Indore; Universitatea din București; Universidad de Cádiz; RWTH Aachen University; Université Claude Bernard Lyon 1; Gottfried Wilhelm Leibniz Universität Hannover; State University of New York; University of Missouri; Universidad de Málaga; Universidad de Sevilla","keywords":"Computer science; Web application; World Wide Web; Programming language","score_opus":0.009344670481381594,"score_gpt":0.22615327448530917,"score_spread":0.21680860400392757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399698994","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002021619,0.0026288528,0.050073713,0.0016974381,0.0012184872,0.00010080124,0.00035390453,0.002747936,0.9391571],"genre_scores_gemma":[0.009771477,0.0023382236,0.00931434,0.00047011173,0.0002654584,0.00003715506,0.00056226837,0.00061807333,0.97662294],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994305,0.0000479147,0.000017773214,0.0000675654,0.00039783018,0.00003843143],"domain_scores_gemma":[0.9995291,0.000075480355,0.0000134247,0.00016868186,0.00015787892,0.000055394506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512031,0.0006320293,0.00031693085,0.0015779006,0.0006270108,0.0030776835,0.0007084115,0.0008786383,0.13729948],"category_scores_gemma":[0.0012162176,0.0003648265,0.0003286852,0.0012198251,0.00037219728,0.0027444204,0.0015008128,0.0013293404,0.10374351],"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.0000257446,0.0001422672,0.00018777429,0.00017317591,0.0000056434687,0.00013316423,0.00015785391,0.0006064987,0.0048069004,0.07225125,0.2807678,0.64074194],"study_design_scores_gemma":[0.0000036262218,0.000014917928,0.00024979006,0.00007290279,0.0000033248389,0.00023269853,0.00005630504,0.0013250844,0.0029630014,0.019161984,0.9759102,0.000006145248],"about_ca_topic_score_codex":0.0007372231,"about_ca_topic_score_gemma":0.0013250604,"teacher_disagreement_score":0.13729948,"about_ca_system_score_codex":0.00049724546,"about_ca_system_score_gemma":0.00054834486,"threshold_uncertainty_score":0.4593125},"labels":[],"label_agreement":null},{"id":"W4399699011","doi":"10.1007/978-3-031-62362-2_40","title":"Dynamic Hybrid Recommendation System for E-Commerce: Overcoming Challenges of Sparse Data and Anonymity","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Fredericton; University of New Brunswick","funders":"","keywords":"Computer science; Anonymity; Recommender system; E-commerce; Data mining; Theoretical computer science; Computer security; Information retrieval; World Wide Web","score_opus":0.046508381928154305,"score_gpt":0.2893807841379523,"score_spread":0.242872402209798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399699011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031944286,0.0018037887,0.9578801,0.0006534189,0.00028445452,0.00009511528,0.0003022561,0.0018015959,0.005235069],"genre_scores_gemma":[0.5863471,0.0015294477,0.3921544,0.0005290371,0.0006190723,0.00014705841,0.00088443054,0.00021521955,0.017574187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982128,0.00052142434,0.00009829664,0.0003776564,0.00061733054,0.00017251616],"domain_scores_gemma":[0.99651164,0.0013980526,0.0001245049,0.0010786346,0.00071154564,0.0001756586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024144,0.0005412403,0.0020394488,0.0011157591,0.0013152016,0.002692002,0.0025695697,0.001556147,0.0038509048],"category_scores_gemma":[0.0037024692,0.00053515454,0.00074050674,0.0024784189,0.00060146145,0.0043882285,0.0021000558,0.001769827,0.0020342332],"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.0009879419,0.00054312096,0.0036563824,0.00032134965,0.00047073132,0.0003459617,0.00034339773,0.095698275,0.019959128,0.05737153,0.035107583,0.78519464],"study_design_scores_gemma":[0.000039181294,0.00015141179,0.00059056067,0.000012333904,0.00007645025,0.0003145561,0.000073330535,0.96607643,0.0029460136,0.021747246,0.007914816,0.00005767984],"about_ca_topic_score_codex":0.004392839,"about_ca_topic_score_gemma":0.006697201,"teacher_disagreement_score":0.004392839,"about_ca_system_score_codex":0.00069340685,"about_ca_system_score_gemma":0.0011089488,"threshold_uncertainty_score":0.01288259},"labels":[],"label_agreement":null},{"id":"W4399714851","doi":"10.1007/978-3-031-62836-8_25","title":"Ultrasound Bone Surface Segmentation for Hip Joint Arthroscopy: Evaluating a Local Phase-Based and a Rigid Object Filtering in a Simulated Environment","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hip disorders and treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Segmentation; Joint (building); Ultrasound; Computer vision; Artificial intelligence; Object (grammar); Hip arthroscopy; Arthroscopy; Radiology; Medicine; Engineering","score_opus":0.033274194546977616,"score_gpt":0.32214472916776776,"score_spread":0.28887053462079015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399714851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2605152,0.0011789437,0.7325372,0.00020816021,0.00013028097,0.00019894482,0.00034470198,0.0022529103,0.0026336198],"genre_scores_gemma":[0.54680675,0.001145403,0.44578168,0.0001660999,0.000060130435,0.000095378324,0.00085291965,0.0009048725,0.0041867564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995347,0.00012589882,0.000026888614,0.00007486075,0.00019349191,0.00004407636],"domain_scores_gemma":[0.9985166,0.0010238322,0.00007127797,0.00007041438,0.00026483537,0.000053040112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011831112,0.0008019178,0.0007207848,0.00093089027,0.00027664463,0.0012103734,0.0007618571,0.0016914208,0.002383763],"category_scores_gemma":[0.0031654013,0.00048669433,0.00075065834,0.00057552324,0.00038907386,0.00056029245,0.0005409182,0.00033052813,0.000608178],"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.0032813977,0.0005942112,0.00526099,0.0004679451,0.0002873081,0.0002923412,0.00018096757,0.26271588,0.23496605,0.0010369883,0.0015907076,0.48932528],"study_design_scores_gemma":[0.00006912012,0.00064261415,0.0064294827,0.000025429592,0.00018788743,0.0005115309,0.00007569441,0.91736597,0.07332662,0.0005316386,0.00079448614,0.000039507897],"about_ca_topic_score_codex":0.006670151,"about_ca_topic_score_gemma":0.007494248,"teacher_disagreement_score":0.006670151,"about_ca_system_score_codex":0.00043611272,"about_ca_system_score_gemma":0.00087791355,"threshold_uncertainty_score":0.0132626295},"labels":[],"label_agreement":null},{"id":"W4399714937","doi":"10.1007/978-3-031-62700-2_16","title":"Shapley-Based Data Valuation Method for the Machine Learning Data Markets (MLDM)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Valuation (finance); Artificial intelligence; Machine learning; Data mining; Finance","score_opus":0.09770049559368323,"score_gpt":0.35377676369661865,"score_spread":0.25607626810293543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399714937","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.0040362612,0.0006036626,0.98045117,0.0006274838,0.00022991092,0.0001252007,0.00014592469,0.00011003298,0.013670242],"genre_scores_gemma":[0.3380079,0.0021042093,0.6258255,0.0008050465,0.0011522162,0.0007234841,0.0006413355,0.00042677036,0.030313497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673444,0.002002885,0.00011558031,0.00038809003,0.00060758,0.00015144904],"domain_scores_gemma":[0.99389535,0.0040751523,0.00021193676,0.00077291887,0.00066390773,0.0003808104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007928863,0.0014861957,0.0022717381,0.0017333208,0.0013190919,0.0046505565,0.0036818953,0.0025588071,0.02095048],"category_scores_gemma":[0.018029103,0.0007680287,0.0021659064,0.002628598,0.0026835736,0.009569924,0.0034792705,0.007057788,0.0018373608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048656206,0.00008483244,0.00014337615,0.00016351724,0.00005302824,0.000033093555,0.00008057452,0.015840689,0.00046488707,0.9347701,0.006624233,0.04169303],"study_design_scores_gemma":[0.000024591323,0.000039046867,0.00007572307,0.000040584586,0.000016351947,0.000044028828,0.000021816124,0.14223012,0.00019078032,0.85418165,0.003116278,0.00001909728],"about_ca_topic_score_codex":0.0007439205,"about_ca_topic_score_gemma":0.0009083105,"teacher_disagreement_score":0.02095048,"about_ca_system_score_codex":0.0027459306,"about_ca_system_score_gemma":0.002617777,"threshold_uncertainty_score":0.0700863},"labels":[],"label_agreement":null},{"id":"W4399715009","doi":"10.1007/978-3-031-62700-2_14","title":"Enhancing Temporal Transformers for Financial Time Series via Local Surrogate Interpretability","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision 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 Ottawa","funders":"","keywords":"Interpretability; Computer science; Transformer; Series (stratigraphy); Finance; Artificial intelligence; Electrical engineering; Business; Engineering","score_opus":0.034285779473284976,"score_gpt":0.3330686163089388,"score_spread":0.2987828368356538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399715009","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.0069570523,0.00007596745,0.9915569,0.000056477806,0.000026716009,0.000010968307,0.000049200436,0.00033181155,0.0009349705],"genre_scores_gemma":[0.55211365,0.000621083,0.4407109,0.00013481446,0.00015795126,0.00008090969,0.000627751,0.0006496352,0.004903388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.00017970863,0.00004596754,0.000088080036,0.00018279298,0.000036921305],"domain_scores_gemma":[0.997841,0.0012653716,0.00014749634,0.000410618,0.00028018252,0.000055395118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015452162,0.0006171268,0.0005046348,0.00064035086,0.00018434285,0.0014273906,0.0007043342,0.00056436996,0.0046021724],"category_scores_gemma":[0.00817014,0.00028223204,0.0006702592,0.00074297434,0.0005940478,0.0029180993,0.0012972491,0.0016074536,0.0009582553],"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.00067501434,0.00016945551,0.0008029161,0.00028266016,0.000054567263,0.00029979245,0.00023992785,0.27614215,0.053123113,0.24131897,0.0033863885,0.42350498],"study_design_scores_gemma":[0.000013009533,0.00005024755,0.00009969055,0.000012146311,0.000009915109,0.00005576912,0.000018772143,0.9361312,0.0065920097,0.055489667,0.0015199835,0.0000075790713],"about_ca_topic_score_codex":0.00062196783,"about_ca_topic_score_gemma":0.00078291784,"teacher_disagreement_score":0.0046021724,"about_ca_system_score_codex":0.00035990728,"about_ca_system_score_gemma":0.00040654518,"threshold_uncertainty_score":0.015395761},"labels":[],"label_agreement":null},{"id":"W4399715246","doi":"10.1007/978-3-031-62912-9_8","title":"A Memetic Algorithm for Large-Scale Real-World Vehicle Routing Problems with Simultaneous Pickup and Delivery with Time Windows","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Brock University","funders":"","keywords":"Pickup; Vehicle routing problem; Computer science; Memetic algorithm; Routing (electronic design automation); Scale (ratio); Algorithm; Local search (optimization); Embedded system; Artificial intelligence","score_opus":0.00935294862045187,"score_gpt":0.22789409507101396,"score_spread":0.2185411464505621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399715246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011011463,0.0008321474,0.9794622,0.0003899564,0.00032128618,0.00009288477,0.00006426986,0.0004479194,0.007377967],"genre_scores_gemma":[0.22952151,0.0007631486,0.7558606,0.0003985446,0.0002816309,0.00051711133,0.00014835417,0.00020814681,0.012300893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973243,0.000096643766,0.000016038714,0.000045608896,0.0000737975,0.00003538757],"domain_scores_gemma":[0.9991874,0.00056146743,0.000048348695,0.00006165731,0.00010844461,0.00003272235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012309157,0.0009489938,0.0010960783,0.00078799366,0.0007713039,0.0010134348,0.0020988209,0.0019720795,0.0036939026],"category_scores_gemma":[0.002252801,0.0006390939,0.0010466479,0.001107213,0.00085826044,0.00097438676,0.0012286257,0.0014740209,0.0004670034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006453799,0.000065990316,0.00017147318,0.00008038342,0.0000801433,0.0000623567,0.000039351144,0.9195446,0.00092295726,0.012290357,0.0035500026,0.063127965],"study_design_scores_gemma":[0.000012670117,0.00001615704,0.000025287449,0.000005416774,0.000007231101,0.0000135414775,0.000005169723,0.99506736,0.00014168068,0.003942808,0.0007594212,0.0000032697453],"about_ca_topic_score_codex":0.0029731817,"about_ca_topic_score_gemma":0.0031126754,"teacher_disagreement_score":0.0036939026,"about_ca_system_score_codex":0.0007701904,"about_ca_system_score_gemma":0.0010635529,"threshold_uncertainty_score":0.012357354},"labels":[],"label_agreement":null},{"id":"W4399739232","doi":"10.1007/978-3-031-62922-8_24","title":"A Large Neighborhood Search Metaheuristic for the Stochastic Mixed Model Assembly Line Balancing Problem with Walking Workers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Assembly Line Balancing Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Metaheuristic; Computer science; Assembly line; Mathematical optimization; Line (geometry); Algorithm; Mathematics; Engineering","score_opus":0.012254514245968896,"score_gpt":0.23528693988693278,"score_spread":0.22303242564096387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399739232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03967748,0.0006534106,0.94991356,0.0002995717,0.00018635098,0.00012777996,0.000084264786,0.00059898145,0.008458508],"genre_scores_gemma":[0.44505373,0.00029834366,0.54120296,0.00034532888,0.00014666143,0.00061886606,0.0002668983,0.00026351205,0.0118036885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996629,0.00012724474,0.000012548178,0.000054226664,0.000092055656,0.00005113057],"domain_scores_gemma":[0.9994266,0.00036734127,0.00005025767,0.000034969424,0.000066746274,0.000054083408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085748796,0.0008159808,0.0014100075,0.0007005859,0.00055389036,0.0007396801,0.0020485432,0.0018553134,0.0042732614],"category_scores_gemma":[0.0014954631,0.0006601866,0.00085020997,0.00080300664,0.0005521162,0.00073899917,0.0011592656,0.0013044918,0.00048448594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010592131,0.00011201441,0.00019257088,0.00004354408,0.00003715919,0.00004069219,0.000031319894,0.94402915,0.000943116,0.0061240527,0.001655139,0.046685327],"study_design_scores_gemma":[0.000022072605,0.000031238967,0.000028934423,0.000004345545,0.000004522183,0.0000052163855,0.0000043579585,0.9986534,0.00007083713,0.00088703335,0.0002859726,0.0000021398694],"about_ca_topic_score_codex":0.0055451454,"about_ca_topic_score_gemma":0.0059610656,"teacher_disagreement_score":0.0055451454,"about_ca_system_score_codex":0.0007532082,"about_ca_system_score_gemma":0.0011437645,"threshold_uncertainty_score":0.014295518},"labels":[],"label_agreement":null},{"id":"W4399739630","doi":"10.1007/978-3-031-62922-8_2","title":"Deep Reinforcement Learning for Smart Restarts in Exploration-Only Exploitation-Only Hybrid Metaheuristics","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and 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 Prince Edward Island","funders":"","keywords":"Reinforcement learning; Computer science; Metaheuristic; Artificial intelligence; Human–computer interaction","score_opus":0.01985558558276632,"score_gpt":0.25380811935372327,"score_spread":0.23395253377095696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399739630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0454848,0.00078490726,0.9403043,0.00040785354,0.00014491325,0.000083418585,0.0000549223,0.0006441925,0.012090699],"genre_scores_gemma":[0.8425637,0.00022875635,0.14754897,0.00035083955,0.000078494224,0.00026479448,0.0001136053,0.0002449757,0.008605871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999566,0.0001454959,0.000022735521,0.0000749599,0.000082922095,0.00010782588],"domain_scores_gemma":[0.9985678,0.0009871067,0.00009766664,0.00010173909,0.00015655562,0.00008920287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013650539,0.0010212414,0.0013434445,0.0005221693,0.00052149955,0.0010679287,0.0017398669,0.0016426007,0.004499151],"category_scores_gemma":[0.0032818192,0.0006418928,0.00068161206,0.00044809366,0.0011699203,0.001235522,0.0017362656,0.0021405842,0.0005458687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010169925,0.00007082413,0.0003007863,0.000050536953,0.000046338355,0.00003198055,0.000039536313,0.9449205,0.0009728525,0.013162348,0.001297545,0.0390052],"study_design_scores_gemma":[0.000007465374,0.000017537099,0.000023917166,0.0000050430745,0.0000035559901,0.000003221958,0.0000029330556,0.99794024,0.0001031328,0.0017652459,0.00012582763,0.0000018487862],"about_ca_topic_score_codex":0.0046544364,"about_ca_topic_score_gemma":0.005339656,"teacher_disagreement_score":0.0046544364,"about_ca_system_score_codex":0.0012937414,"about_ca_system_score_gemma":0.001495547,"threshold_uncertainty_score":0.0150511265},"labels":[],"label_agreement":null},{"id":"W4399753093","doi":"10.1007/978-3-031-60391-4_3","title":"Combining Cryptography and Discrete-Event Systems to Study Sensor and Actuator Cyberattacks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Cryptography; Event (particle physics); Actuator; Wireless sensor network; Computer security; Real-time computing; Embedded system; Computer network; Artificial intelligence","score_opus":0.017953340029292848,"score_gpt":0.2711417716279541,"score_spread":0.2531884315986613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399753093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015643245,0.0033742778,0.95767164,0.001027948,0.00041847563,0.000063407635,0.000043745447,0.00007697154,0.02168034],"genre_scores_gemma":[0.7556682,0.0066992617,0.21196397,0.00054559746,0.0008718415,0.00015772217,0.000094773604,0.0001099351,0.023888681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.00028147444,0.000044555945,0.00008909205,0.00022861481,0.00007553619],"domain_scores_gemma":[0.9965462,0.0026137184,0.0002650541,0.00033940194,0.00015805685,0.00007766935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506287,0.0008465125,0.00088700256,0.00096118543,0.00044819256,0.0020608117,0.0008614185,0.0013251461,0.0024485525],"category_scores_gemma":[0.004170825,0.00041866754,0.0010508527,0.0011195744,0.0019910433,0.0043669096,0.0012119337,0.003452667,0.00041982796],"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.000034744447,0.0000621556,0.00046127284,0.00014269385,0.00005023827,0.0001176243,0.00008155814,0.100396425,0.0025027115,0.87870246,0.00093837496,0.016509736],"study_design_scores_gemma":[0.000017234523,0.000045101016,0.00021728473,0.00003516882,0.000027171227,0.00012983031,0.000043313623,0.485392,0.0019370422,0.50762254,0.0045109154,0.000022486845],"about_ca_topic_score_codex":0.0005753562,"about_ca_topic_score_gemma":0.00045693942,"teacher_disagreement_score":0.0024485525,"about_ca_system_score_codex":0.0010304782,"about_ca_system_score_gemma":0.0006104818,"threshold_uncertainty_score":0.008191228},"labels":[],"label_agreement":null},{"id":"W4399876957","doi":"10.1007/978-3-031-63790-2_26","title":"Modelling a Mechanical Lung Ventilation System Using TASTD","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.04497275327196975,"score_gpt":0.2930414644173879,"score_spread":0.24806871114541812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399876957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040046513,0.00037368617,0.9295003,0.000250202,0.00015251004,0.00012160227,0.00050266704,0.0031347245,0.02591787],"genre_scores_gemma":[0.8858139,0.00050053897,0.08514544,0.00009536423,0.0000419602,0.00021230221,0.0003742971,0.000316614,0.027499638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998287,0.000033883858,0.00001403841,0.00003504196,0.000061316314,0.000026992808],"domain_scores_gemma":[0.9998332,0.000077772675,0.000023740462,0.000022023423,0.000032694545,0.000010553448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022195939,0.000454534,0.00050065527,0.00025687634,0.0003894945,0.0011632956,0.0010521434,0.0010690484,0.0108613605],"category_scores_gemma":[0.00040472948,0.00031415,0.0008736403,0.00017038615,0.0005377285,0.0006742673,0.0007902194,0.0005428396,0.0014165767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001435227,0.000027642507,0.00070405524,0.0002647711,0.00003914002,0.00054743316,0.00020808399,0.906052,0.02382414,0.048227843,0.0010307033,0.01893066],"study_design_scores_gemma":[0.000026926331,0.00006198028,0.00017533242,0.000025270305,0.000027564081,0.00013937692,0.000024405756,0.9747838,0.0069899834,0.007919835,0.009809801,0.000015739186],"about_ca_topic_score_codex":0.0037048196,"about_ca_topic_score_gemma":0.0022349046,"teacher_disagreement_score":0.0108613605,"about_ca_system_score_codex":0.00044284514,"about_ca_system_score_gemma":0.00077247375,"threshold_uncertainty_score":0.036334872},"labels":[],"label_agreement":null},{"id":"W4399888593","doi":"10.1007/978-3-031-63021-7_30","title":"Linear Search for an Escaping Target with Unknown Speed","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.03745006556088688,"score_gpt":0.29406948813272427,"score_spread":0.2566194225718374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055161647,0.0005726722,0.9110833,0.00048040663,0.00013200886,0.000064466,0.00010814737,0.001165383,0.03123193],"genre_scores_gemma":[0.5817238,0.0006344585,0.32865003,0.00040726262,0.00014235856,0.00034733245,0.00035712632,0.0006336875,0.087103985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997708,0.00004121616,0.000009089078,0.00004994176,0.00008414402,0.000044846685],"domain_scores_gemma":[0.9993524,0.00040725747,0.00004166579,0.000058433292,0.00010647427,0.00003369298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041254653,0.00074388715,0.000820812,0.00061578286,0.00060960645,0.0010048293,0.0011895626,0.0016500759,0.0072460026],"category_scores_gemma":[0.002785928,0.0005228362,0.0005692594,0.00095465215,0.0007874975,0.0013961046,0.0017316188,0.001490016,0.0021123358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033059475,0.0001090597,0.0004693018,0.0003050059,0.00007021173,0.00019970466,0.00017869755,0.7394849,0.012936834,0.10117762,0.008448105,0.13628994],"study_design_scores_gemma":[0.000015739077,0.000068601774,0.0000647525,0.000014929965,0.000007969318,0.0000462734,0.000018424955,0.9830567,0.0017544493,0.013260783,0.0016818437,0.000009490651],"about_ca_topic_score_codex":0.001788942,"about_ca_topic_score_gemma":0.001247615,"teacher_disagreement_score":0.0072460026,"about_ca_system_score_codex":0.00082018407,"about_ca_system_score_gemma":0.00053036795,"threshold_uncertainty_score":0.024240255},"labels":[],"label_agreement":null},{"id":"W4399888599","doi":"10.1007/978-3-031-63021-7_24","title":"Directed Path Partition Problem on Directed Acyclic Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta","funders":"","keywords":"Directed acyclic graph; Computer science; Partition (number theory); Directed graph; Path (computing); Longest path problem; Theoretical computer science; Algorithm; Graph; Combinatorics; Chordal graph; Mathematics; Programming language","score_opus":0.018878436264308907,"score_gpt":0.2743530151173555,"score_spread":0.2554745788530466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15811583,0.003697199,0.7547633,0.0045124018,0.00036018505,0.00081740285,0.0056106574,0.0013211061,0.070801914],"genre_scores_gemma":[0.46093532,0.004399439,0.47095188,0.0007272424,0.0005161914,0.0009880465,0.010616915,0.00080553535,0.05005944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904984,0.00030133405,0.000043402837,0.00027779897,0.00019439546,0.00013330542],"domain_scores_gemma":[0.9961706,0.0029835692,0.00018197519,0.00029006792,0.00017407302,0.00019982063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009814126,0.001144784,0.0018710251,0.0013581353,0.0009883172,0.0027177434,0.0025836478,0.0021976607,0.013311437],"category_scores_gemma":[0.006183462,0.0009956212,0.000849501,0.003330323,0.001189446,0.0065385746,0.0024985692,0.0022992184,0.0014407954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007406579,0.00048651348,0.0011189234,0.0018560719,0.00019438984,0.00036701647,0.0005356149,0.3621076,0.0044377493,0.2971286,0.055355687,0.27567124],"study_design_scores_gemma":[0.00018839526,0.00011737095,0.00062348414,0.00016721422,0.000078289704,0.0002962062,0.0003952864,0.38396695,0.002645066,0.5948974,0.016592441,0.00003190058],"about_ca_topic_score_codex":0.0027130884,"about_ca_topic_score_gemma":0.002516197,"teacher_disagreement_score":0.013311437,"about_ca_system_score_codex":0.0015303699,"about_ca_system_score_gemma":0.0012422061,"threshold_uncertainty_score":0.044531226},"labels":[],"label_agreement":null},{"id":"W4399888636","doi":"10.1007/978-3-031-63021-7_23","title":"On the Finiteness of k-Vertex-Critical $$2P_2$$-Free Graphs with Forbidden Induced Squids or Bulls","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Prince Edward Island; The King's University","funders":"","keywords":"Vertex (graph theory); Computer science; Combinatorics; Discrete mathematics; Graph; Mathematics; Theoretical computer science","score_opus":0.03512476857951113,"score_gpt":0.30017009480869183,"score_spread":0.2650453262291807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888636","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76582664,0.0012359271,0.08941373,0.0019611917,0.00020683094,0.00011445503,0.0009164209,0.0007193941,0.13960539],"genre_scores_gemma":[0.96254814,0.00045397767,0.0163945,0.0004283704,0.000097584,0.00012803648,0.00088323693,0.0002799365,0.018786196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995136,0.00009892329,0.000025166028,0.00014913856,0.00009249561,0.000120760764],"domain_scores_gemma":[0.99488187,0.0035656518,0.0003760797,0.0004123593,0.000330965,0.000433048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153734,0.00065388065,0.0007359196,0.0015363569,0.0026395456,0.0028656528,0.0017439646,0.0010979259,0.008438123],"category_scores_gemma":[0.0045926077,0.0009364211,0.0009420723,0.0012069639,0.0035068027,0.004819387,0.0019517748,0.0022393856,0.00074032956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019406965,0.000046057263,0.001098873,0.00017197421,0.00002073437,0.0002514822,0.00095360266,0.005860832,0.0041037556,0.9749748,0.003686444,0.008637307],"study_design_scores_gemma":[0.00003008002,0.00002176716,0.0005006557,0.00004656273,0.0000200658,0.00017835229,0.00021745158,0.007969611,0.001972886,0.9857407,0.0032811943,0.000020678446],"about_ca_topic_score_codex":0.0024473567,"about_ca_topic_score_gemma":0.0034237956,"teacher_disagreement_score":0.008438123,"about_ca_system_score_codex":0.0016227848,"about_ca_system_score_gemma":0.0007976005,"threshold_uncertainty_score":0.028228283},"labels":[],"label_agreement":null},{"id":"W4399889184","doi":"10.1007/978-3-031-63021-7_3","title":"Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Computer science; Group (periodic table)","score_opus":0.021702256398009257,"score_gpt":0.27178199063311365,"score_spread":0.2500797342351044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399889184","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016147578,0.0019928638,0.9479976,0.0011349908,0.00037354298,0.00017344544,0.0003855082,0.0005502788,0.031244162],"genre_scores_gemma":[0.39689016,0.002895999,0.5526896,0.001178261,0.0009952411,0.0009921934,0.0012979883,0.0015602711,0.04150026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971986,0.0011126138,0.0000928993,0.00033088226,0.00070402195,0.0005611496],"domain_scores_gemma":[0.98823404,0.008974147,0.00041989464,0.00093813293,0.000899023,0.0005348285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041861837,0.0029397951,0.0033311318,0.0024056537,0.0012516553,0.0038096136,0.0055654235,0.0028061033,0.018167462],"category_scores_gemma":[0.02047326,0.0009751818,0.0018755854,0.0040745996,0.0020710742,0.0074757496,0.0040616593,0.007071422,0.002466605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060055254,0.00034214862,0.0003784424,0.00052790495,0.00009272388,0.00009394617,0.00021330755,0.6879427,0.0024711974,0.2144732,0.01968761,0.07317638],"study_design_scores_gemma":[0.000031057432,0.00007523117,0.00009527358,0.000050783994,0.00002270943,0.000022406617,0.000044299657,0.90045005,0.0005572786,0.096302606,0.0023351808,0.00001321117],"about_ca_topic_score_codex":0.0043388004,"about_ca_topic_score_gemma":0.0045694117,"teacher_disagreement_score":0.018167462,"about_ca_system_score_codex":0.0032993553,"about_ca_system_score_gemma":0.002490746,"threshold_uncertainty_score":0.060776234},"labels":[],"label_agreement":null},{"id":"W4399909327","doi":"10.1007/978-3-031-63021-7_37","title":"Broadcasting in Stars of Cliques","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Stars; Telecommunications; Astronomy; Computer security; Computer vision; Physics","score_opus":0.02653955470938015,"score_gpt":0.30489880643104855,"score_spread":0.2783592517216684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399909327","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.328911,0.0062612705,0.26100627,0.0044028126,0.00076261954,0.00024611285,0.0010741386,0.00077548577,0.39656037],"genre_scores_gemma":[0.7682127,0.004476741,0.07749971,0.00059178733,0.00076643616,0.00022881023,0.00096495124,0.00048063905,0.14677835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941397,0.00020459971,0.000024004878,0.00012233424,0.00012118179,0.00011399337],"domain_scores_gemma":[0.9957711,0.0030452998,0.00022069359,0.00025297963,0.00029032902,0.0004195708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490518,0.00029366752,0.00095871004,0.0009646303,0.0017984094,0.0022246914,0.0010059567,0.0009479829,0.008881407],"category_scores_gemma":[0.004581247,0.00062232924,0.00073994655,0.0021619978,0.0014673176,0.0030701025,0.0015132336,0.002009006,0.0012818102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016386763,0.000033960652,0.00036696313,0.00025318522,0.000020930753,0.000101483165,0.00062528823,0.0055186045,0.002116487,0.9574464,0.011350206,0.022002622],"study_design_scores_gemma":[0.000042517073,0.000030200483,0.00037860466,0.000032111388,0.000018164817,0.00014543424,0.00016056215,0.014044377,0.0006941443,0.9710035,0.013440873,0.000009604584],"about_ca_topic_score_codex":0.0018532075,"about_ca_topic_score_gemma":0.0024039324,"teacher_disagreement_score":0.008881407,"about_ca_system_score_codex":0.0014219648,"about_ca_system_score_gemma":0.0006703668,"threshold_uncertainty_score":0.029711306},"labels":[],"label_agreement":null},{"id":"W4399910498","doi":"10.1007/978-3-031-63021-7_36","title":"The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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; University of Ottawa","funders":"","keywords":"Computer science; Algorithm; Robot; Artificial intelligence","score_opus":0.012286328378413605,"score_gpt":0.2474559018471405,"score_spread":0.2351695734687269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399910498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28547415,0.0022167345,0.65321875,0.004795138,0.00050059776,0.00042467398,0.0019869902,0.0037956855,0.047587294],"genre_scores_gemma":[0.725253,0.00083774154,0.25804192,0.0004696616,0.00025756695,0.0005561998,0.0010451976,0.0018424472,0.011696329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974981,0.0008318466,0.00014452128,0.0005924335,0.0004723094,0.00046077714],"domain_scores_gemma":[0.9835535,0.011203315,0.00084452576,0.0029548586,0.0006868713,0.0007569218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662186,0.001231461,0.002587519,0.0007004547,0.0016605945,0.00300439,0.004891873,0.0026103572,0.011666315],"category_scores_gemma":[0.0190257,0.0011445197,0.0013062982,0.0015915995,0.0024113469,0.008882913,0.0032993334,0.0024314346,0.0017821142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006020157,0.00032548493,0.002320037,0.0017844428,0.00029820815,0.00024507605,0.0012878226,0.4797977,0.031078873,0.21815595,0.035683066,0.2230032],"study_design_scores_gemma":[0.00037311614,0.00039897312,0.0011686671,0.00012542267,0.00014844055,0.000262206,0.00029284044,0.63847214,0.009689931,0.344511,0.0044885334,0.00006875604],"about_ca_topic_score_codex":0.0012911642,"about_ca_topic_score_gemma":0.0018188243,"teacher_disagreement_score":0.011666315,"about_ca_system_score_codex":0.0025091148,"about_ca_system_score_gemma":0.003512191,"threshold_uncertainty_score":0.03902775},"labels":[],"label_agreement":null},{"id":"W4399917866","doi":"10.1007/978-3-031-63115-3_3","title":"Eliciting Spatial Reasoning Actions Through Projective Geometry in the Elementary Classroom","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","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 Victoria; University of Alberta","funders":"","keywords":"Computer science; Projective test; Projective geometry; Spatial intelligence; Mathematics education; Algebra over a field; Computer graphics (images); Geometry; Calculus (dental); Artificial intelligence; Algebraic geometry; Mathematics; Pure mathematics","score_opus":0.021163586600075893,"score_gpt":0.26951261917749225,"score_spread":0.24834903257741636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399917866","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.74099106,0.00020574935,0.19248036,0.00058970926,0.000053651176,0.0005373342,0.0006579755,0.0027422498,0.06174186],"genre_scores_gemma":[0.846032,0.00025039358,0.14208874,0.00016299388,0.0000124119815,0.00039642712,0.00072382437,0.00016367958,0.010169647],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983564,0.0007732712,0.00008373188,0.000359822,0.00030057802,0.00012611574],"domain_scores_gemma":[0.99409604,0.004590804,0.00036609388,0.0005024027,0.00025989622,0.00018481268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444107,0.00090484624,0.00057934766,0.00026792666,0.0003647326,0.0019133913,0.001076092,0.0010673577,0.008554582],"category_scores_gemma":[0.009563942,0.0005190666,0.00031459867,0.00027947352,0.0008879293,0.0016683382,0.0021132315,0.0010601544,0.0017989248],"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.0023945435,0.004211335,0.0228583,0.0016535637,0.00012402752,0.000696921,0.020563642,0.025131898,0.17891866,0.06335563,0.016378121,0.66371334],"study_design_scores_gemma":[0.0016186895,0.0059229727,0.0729406,0.0007724228,0.00036331534,0.0011924466,0.02347184,0.2932423,0.29291198,0.21666308,0.09050006,0.0004003033],"about_ca_topic_score_codex":0.0015774741,"about_ca_topic_score_gemma":0.0038305945,"teacher_disagreement_score":0.008554582,"about_ca_system_score_codex":0.0006859998,"about_ca_system_score_gemma":0.0011290197,"threshold_uncertainty_score":0.028617918},"labels":[],"label_agreement":null},{"id":"W4400041302","doi":"10.1007/978-3-031-62139-0_14","title":"Climate Change Risk Framework Using Complex Interdependent Critical Systems (Short Paper)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Global Energy and Sustainability Research","field":"Energy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interdependence; Climate change; Geology","score_opus":0.05059502461425052,"score_gpt":0.3367867620305921,"score_spread":0.2861917374163416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400041302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018207122,0.003457842,0.8966348,0.0048695956,0.0008465422,0.00007736265,0.00028428977,0.00015872924,0.07546372],"genre_scores_gemma":[0.82325023,0.005646148,0.1051383,0.0006558006,0.0015415587,0.00022331333,0.000293695,0.00024164404,0.063009344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996056,0.00016463504,0.000015532733,0.000073040756,0.00009940583,0.00004187723],"domain_scores_gemma":[0.998995,0.00062510284,0.00008355874,0.00005795379,0.00016822072,0.00007005364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011165019,0.0010397295,0.000634328,0.00083759066,0.0005410046,0.0023504705,0.0013871389,0.0014433366,0.00915036],"category_scores_gemma":[0.0028490264,0.00047848237,0.000998099,0.00094572135,0.0014673517,0.0031572476,0.0014285519,0.0022685272,0.00053077657],"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.000011534733,0.000027538255,0.0002553698,0.000056989415,0.000050736566,0.00013960096,0.000074103555,0.1899928,0.00027870963,0.79009926,0.0067092427,0.012304144],"study_design_scores_gemma":[0.00000488512,0.000016446733,0.00025757792,0.000027197037,0.000023876035,0.000045860023,0.000043034077,0.26327965,0.0001323359,0.7265892,0.009566545,0.000013488558],"about_ca_topic_score_codex":0.0052297744,"about_ca_topic_score_gemma":0.0037133605,"teacher_disagreement_score":0.00915036,"about_ca_system_score_codex":0.0021301412,"about_ca_system_score_gemma":0.0009396256,"threshold_uncertainty_score":0.030610979},"labels":[],"label_agreement":null},{"id":"W4400097902","doi":"10.1007/978-3-031-63772-8_4","title":"Neural Dynamics in Parkinson’s Disease: Integrating Machine Learning and Stochastic Modelling with Connectomic Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Wilfrid Laurier University; University of Manitoba","funders":"","keywords":"Computer science; Parkinson's disease; Dynamics (music); Artificial neural network; Machine learning; Artificial intelligence; Disease; Medicine","score_opus":0.024928101919823104,"score_gpt":0.2644410122356037,"score_spread":0.23951291031578056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400097902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032434966,0.0055551366,0.9513881,0.0022222549,0.00020563956,0.000013936307,0.0004241648,0.0003146947,0.007441071],"genre_scores_gemma":[0.6848982,0.01109554,0.28235212,0.0004327789,0.00060396263,0.0000811091,0.00086539483,0.0003195515,0.01935133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990904,0.000031120315,0.0000061021356,0.000021742706,0.000026431777,0.000005527508],"domain_scores_gemma":[0.9992268,0.0006286121,0.000053103253,0.00003340096,0.000039113784,0.000018963117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057186023,0.00037290243,0.0005037546,0.00037135498,0.00013137997,0.0007637285,0.00054726977,0.00069402397,0.0014964011],"category_scores_gemma":[0.0020260543,0.00032482983,0.00057659193,0.0006964138,0.00038235149,0.0010695094,0.00048552797,0.0010149552,0.0003699933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003680233,0.00003099179,0.0020486761,0.00015904632,0.000107453074,0.00016647561,0.00008668286,0.8057372,0.0031930034,0.08008331,0.0045132497,0.1038371],"study_design_scores_gemma":[0.000001384222,0.000010444446,0.0004974164,0.00001633544,0.000007340608,0.00004861519,0.0000050430626,0.93560916,0.000209257,0.062173557,0.0014132091,0.000008349281],"about_ca_topic_score_codex":0.0029509936,"about_ca_topic_score_gemma":0.004926553,"teacher_disagreement_score":0.0029509936,"about_ca_system_score_codex":0.00044327867,"about_ca_system_score_gemma":0.00036137085,"threshold_uncertainty_score":0.00586766},"labels":[],"label_agreement":null},{"id":"W4400097967","doi":"10.1007/978-3-031-63772-8","title":"Computational Science – ICCS 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Lawrence Berkeley National Laboratory; Universitat Politècnica de València; Houston Methodist Research Institute; NOVA Laboratory for Computer Science and Informatics; Pázmány Péter Katolikus Egyetem; King's College London; Basque Center for Applied Mathematics; Politechnika Koszalińska; Universidade Federal de Minas Gerais; Universidade de Santiago de Compostela; National University of Defense Technology; Université de Genève; Bulgarian Academy of Sciences; Universidade Nova de Lisboa; Central Michigan University; Durham University; Universidade de São Paulo; Instituto Politécnico de Bragança; Houston Methodist Hospital; Universitetet i Oslo; Universidad de Murcia; Universität Hamburg; Danmarks Tekniske Universitet; Consiglio Nazionale delle Ricerche; Euskal Herriko Unibertsitatea; Queen's University; King Abdullah University of Science and Technology; Forschungszentrum Jülich; Universiteit van Amsterdam; Università degli Studi di Milano-Bicocca; Politechnika Warszawska; Fundação para a Ciência e a Tecnologia; Università degli Studi di Milano; Curtin University of Technology; Nanyang Technological University; Universidade de Trás-os-Montes e Alto Douro; Science and Technology Facilities Council; University of Glasgow; Universiteit Leiden; Universidade de Aveiro; University of Westminster; Universidad de Málaga; University of Southern California; University College London; Scuola Internazionale Superiore di Studi Avanzati; Imperial College London; RTI International; UK Research and Innovation; University of Twente; Wilfrid Laurier University; Universidad de Sevilla; Universitat Autònoma de Barcelona; Institut de Ciències Fotòniques","keywords":"Computer science; Theoretical computer science","score_opus":0.06386910071344261,"score_gpt":0.3647214760327171,"score_spread":0.3008523753192745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400097967","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016702785,0.015314414,0.050943423,0.0038138772,0.013279729,0.00018310336,0.0038391682,0.0067962967,0.90415955],"genre_scores_gemma":[0.005321247,0.006448449,0.012253542,0.00061198685,0.0024449213,0.000099968915,0.0032544842,0.0024831605,0.96708214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895513,0.00014636877,0.000046921097,0.00020071617,0.00057435414,0.000076472614],"domain_scores_gemma":[0.9977012,0.0004497409,0.00008846495,0.00061173097,0.000708942,0.0004397972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014329281,0.0017673024,0.0013341074,0.0031024667,0.0009646707,0.0050800783,0.0014848864,0.0013053252,0.28966045],"category_scores_gemma":[0.0028412193,0.00090638397,0.0007445311,0.0043578222,0.0007557163,0.0035275093,0.0022215713,0.0030505513,0.18763338],"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.000037422502,0.000030480012,0.000062200874,0.00020138096,0.000015502788,0.000023729574,0.000012277993,0.0010759416,0.0008580994,0.017478518,0.811418,0.16878645],"study_design_scores_gemma":[0.0000074916798,0.000026130283,0.0002243202,0.00010580374,0.000008103969,0.00009323337,0.000011261799,0.0026050615,0.0006150613,0.009537606,0.98675644,0.000009541771],"about_ca_topic_score_codex":0.0025463304,"about_ca_topic_score_gemma":0.005277325,"teacher_disagreement_score":0.28966045,"about_ca_system_score_codex":0.0017507835,"about_ca_system_score_gemma":0.0018761685,"threshold_uncertainty_score":0.9690108},"labels":[],"label_agreement":null},{"id":"W4400104382","doi":"10.1007/978-3-031-72114-4_23","title":"Domain Adaptation of Echocardiography Segmentation Via Reinforcement Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche","keywords":"Computer science; Segmentation; Domain adaptation; Artificial intelligence; Reinforcement learning; Domain (mathematical analysis); Adaptation (eye); Machine learning; Prior probability; Transferability; Pattern recognition (psychology); Bayesian probability; Mathematics","score_opus":0.014707857006786555,"score_gpt":0.24052773144765485,"score_spread":0.2258198744408683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400104382","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.019754207,0.00043725755,0.9778707,0.000127633,0.000049815542,0.000030829924,0.0000362992,0.00053742167,0.0011558664],"genre_scores_gemma":[0.7954052,0.00041111623,0.1997815,0.00023351092,0.00008279206,0.00013665226,0.00022735671,0.00015356271,0.0035683108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.000098770455,0.000013129015,0.00010019497,0.00004200067,0.000040986662],"domain_scores_gemma":[0.99868244,0.0009271319,0.000065433494,0.0000903064,0.00017364768,0.000060971306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011335382,0.00061948545,0.0011193617,0.00043560858,0.00023846621,0.00066152844,0.0010936663,0.0012924481,0.0013968858],"category_scores_gemma":[0.0030783475,0.00045332414,0.0005988922,0.00041435362,0.00065475993,0.00070374337,0.0013626699,0.0013026802,0.00043650705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017372036,0.00009218998,0.0006271944,0.0000725628,0.00005592127,0.000065712135,0.00007105203,0.823698,0.0066719716,0.0029920628,0.0016034561,0.16387615],"study_design_scores_gemma":[0.0000039655292,0.000012625861,0.00007565568,0.0000031472161,0.0000032581625,0.00001000438,0.0000026538687,0.99831235,0.00051577954,0.0009639983,0.00009374796,0.0000028627894],"about_ca_topic_score_codex":0.00495121,"about_ca_topic_score_gemma":0.0030010229,"teacher_disagreement_score":0.00495121,"about_ca_system_score_codex":0.0005563733,"about_ca_system_score_gemma":0.0006754852,"threshold_uncertainty_score":0.00984478},"labels":[],"label_agreement":null},{"id":"W4400129865","doi":"10.1007/978-3-031-61489-7_18","title":"Applying Self-recognition Biometrics to Live Deepfake Detection in Video Conferences","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Media Forensic Detection","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":"Nexen (Canada)","funders":"","keywords":"Biometrics; Computer science; Artificial intelligence; Computer vision","score_opus":0.022230981941597727,"score_gpt":0.23921912825366648,"score_spread":0.21698814631206875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400129865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44680977,0.0027715266,0.51785636,0.00031388443,0.00046641388,0.00012660846,0.00080921024,0.0028210538,0.02802509],"genre_scores_gemma":[0.87122715,0.0011312658,0.10678687,0.000110775334,0.00010088287,0.000032452273,0.0003972971,0.00014386697,0.020069333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998091,0.000024717332,0.000008067205,0.000041893665,0.00007757287,0.000038582035],"domain_scores_gemma":[0.9997782,0.00005266561,0.000027122707,0.000039150156,0.000086948,0.000015791353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028163666,0.00032313014,0.00034104817,0.0011114987,0.00024996954,0.0007790004,0.00046297876,0.0007304066,0.0027570638],"category_scores_gemma":[0.00061273796,0.00014785849,0.0002581491,0.0006927067,0.00021075783,0.0007593912,0.0005006204,0.00037575027,0.0018727052],"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.000215636,0.00012660398,0.005534749,0.00014324018,0.000028821416,0.0002234386,0.000107690634,0.0045694,0.36820602,0.0018427595,0.0028826422,0.61611897],"study_design_scores_gemma":[0.00001544591,0.00048396914,0.031887304,0.00010943994,0.00008388723,0.002028515,0.0004126039,0.41819656,0.5269945,0.0038984169,0.015810192,0.00007919215],"about_ca_topic_score_codex":0.0009952722,"about_ca_topic_score_gemma":0.0021847768,"teacher_disagreement_score":0.0027570638,"about_ca_system_score_codex":0.0002829223,"about_ca_system_score_gemma":0.00016583785,"threshold_uncertainty_score":0.009223342},"labels":[],"label_agreement":null},{"id":"W4400134989","doi":"10.1007/978-3-031-63759-9_18","title":"Computational Modelling of Complex Multiphase Behavior of Environmentally-Friendly Materials for Sustainable Technological Solutions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ferroelectric and Piezoelectric Materials","field":"Materials 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":"Wilfrid Laurier University","funders":"","keywords":"Environmentally friendly; Computer science; User Friendly; Industrial engineering; Programming language; Engineering","score_opus":0.0339097407902479,"score_gpt":0.2608304460200218,"score_spread":0.22692070522977392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400134989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27331498,0.003737806,0.61384296,0.0025065767,0.00043668406,0.00015740443,0.001369267,0.00058756996,0.10404665],"genre_scores_gemma":[0.8804908,0.0016609139,0.09659837,0.0002840432,0.00012617378,0.0003047923,0.00060832815,0.00022986071,0.01969674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999162,0.00002262962,0.0000032018709,0.000012961976,0.000030355044,0.000014612216],"domain_scores_gemma":[0.9997162,0.00019979576,0.000019973184,0.000019442357,0.000027117456,0.000017273502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020487013,0.0004930299,0.00073124445,0.00028667552,0.00040955847,0.0011854781,0.0012068155,0.0015872937,0.0048117866],"category_scores_gemma":[0.0008995132,0.0004946282,0.00067931635,0.00043070634,0.000667194,0.0008984734,0.000620028,0.00085872953,0.00049650355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015868587,0.000024025881,0.00012344551,0.000041890213,0.000009695028,0.000030717496,0.00001321578,0.9853554,0.0012445003,0.010212436,0.00046561554,0.0024632085],"study_design_scores_gemma":[0.0000028557633,0.0000032006371,0.000029853869,0.0000024213768,0.0000013083629,0.000004531128,0.0000033003694,0.9970433,0.0001566899,0.0023448823,0.00040612646,0.0000014917939],"about_ca_topic_score_codex":0.0035724265,"about_ca_topic_score_gemma":0.0039362093,"teacher_disagreement_score":0.0048117866,"about_ca_system_score_codex":0.00054175954,"about_ca_system_score_gemma":0.0007819143,"threshold_uncertainty_score":0.016097069},"labels":[],"label_agreement":null},{"id":"W4400135004","doi":"10.1007/978-3-031-63759-9_15","title":"A Dictionary-Based with Stacked Ensemble Learning to Time Series Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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 Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Series (stratigraphy); Dictionary learning; Ensemble learning; Pattern recognition (psychology); Time series; Machine learning; Sparse approximation","score_opus":0.013134495911161843,"score_gpt":0.2184533535749572,"score_spread":0.20531885766379537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400135004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008467373,0.0010433577,0.9883195,0.00011954479,0.00028582808,0.000027424125,0.00009939443,0.000687637,0.0009498952],"genre_scores_gemma":[0.22866385,0.0017670323,0.7574945,0.00035953248,0.00066902186,0.0001553212,0.001175695,0.00025877886,0.009456231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936396,0.00019764356,0.00005019551,0.00016219945,0.00015566559,0.000070389164],"domain_scores_gemma":[0.9991611,0.00027771917,0.000030425903,0.00017287447,0.00031237854,0.00004549571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010722965,0.00087638246,0.0014799281,0.00086842274,0.0005620297,0.00085031125,0.0017625617,0.0012155795,0.0029232984],"category_scores_gemma":[0.0019795313,0.000489954,0.0013570136,0.0019598932,0.00034150304,0.0014608608,0.0017170575,0.001958942,0.0015012387],"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.00014735996,0.00020174553,0.00064571993,0.00008241797,0.00026728088,0.00006494962,0.00007642266,0.119749464,0.010440451,0.007614287,0.009538517,0.8511714],"study_design_scores_gemma":[0.000004480877,0.00003427003,0.00012731101,0.0000059335653,0.000025903975,0.000019856152,0.000007735154,0.993958,0.0013706915,0.003283557,0.0011544751,0.000007723191],"about_ca_topic_score_codex":0.004716285,"about_ca_topic_score_gemma":0.00585825,"teacher_disagreement_score":0.004716285,"about_ca_system_score_codex":0.00032785957,"about_ca_system_score_gemma":0.0006620633,"threshold_uncertainty_score":0.009779453},"labels":[],"label_agreement":null},{"id":"W4400135259","doi":"10.1007/978-981-97-4442-8_6","title":"Complexities of Using Large Language Model Generative AI in Health Education and Robots","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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 Ontario Institute of Technology","funders":"","keywords":"Computer science; Generative grammar; Robot; Artificial intelligence; Generative model; Natural language processing","score_opus":0.12829523448190835,"score_gpt":0.43335138204873364,"score_spread":0.3050561475668253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400135259","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048023924,0.0017358232,0.86759806,0.02049819,0.00033604572,0.00013176241,0.00026351743,0.0021832979,0.059229385],"genre_scores_gemma":[0.6605106,0.0011572486,0.31393185,0.0017128114,0.0002803035,0.00028637087,0.0003656227,0.00094778027,0.020807423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967828,0.0019316695,0.00013295854,0.00022976352,0.00080749445,0.000115258874],"domain_scores_gemma":[0.94789404,0.04704644,0.0003470419,0.0032817998,0.0010490232,0.00038164874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004847643,0.00040758846,0.000811852,0.0006411857,0.0011320054,0.004435422,0.0017109482,0.0018733034,0.010702877],"category_scores_gemma":[0.036810964,0.0011243289,0.0011115755,0.00068627315,0.003493325,0.009209784,0.0031776843,0.0044579473,0.0019509642],"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.00019110605,0.0001672586,0.0011127866,0.0002616109,0.000099406585,0.00032919203,0.0012380903,0.14330222,0.0028918043,0.70876086,0.008980285,0.13266532],"study_design_scores_gemma":[0.000020892812,0.000023353363,0.0001416139,0.00002748635,0.000026548087,0.00014032892,0.0002276938,0.417258,0.0011633117,0.57595885,0.0049916147,0.000020282421],"about_ca_topic_score_codex":0.005739355,"about_ca_topic_score_gemma":0.007172972,"teacher_disagreement_score":0.010702877,"about_ca_system_score_codex":0.0017590264,"about_ca_system_score_gemma":0.0016680626,"threshold_uncertainty_score":0.03580469},"labels":[],"label_agreement":null},{"id":"W4400169040","doi":"10.1007/978-3-031-63498-7_25","title":"A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Programming language; Completeness (order theory); Satisfiability modulo theories; Quantifier elimination; Matching (statistics); Theoretical computer science; Automated theorem proving; Solver; Quantifier (linguistics); Set (abstract data type); Proof assistant; Semantics (computer science); Satisfiability; Boolean satisfiability problem; Algorithm; Artificial intelligence; Mathematical proof; Mathematics","score_opus":0.023730446450636045,"score_gpt":0.26907780134041503,"score_spread":0.245347354889779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400169040","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.003547271,0.00007590444,0.9886486,0.00070802256,0.000110058754,0.00013737338,0.00011737959,0.0014148945,0.0052406094],"genre_scores_gemma":[0.15404877,0.00028189222,0.83335465,0.0009881452,0.00019795311,0.0006288075,0.0005691394,0.0008391376,0.009091452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947849,0.0014871018,0.00051608554,0.00080892665,0.0019408955,0.00046206228],"domain_scores_gemma":[0.98670316,0.009282583,0.0005327269,0.0019520788,0.0012285381,0.00030082653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061823837,0.0009984119,0.0008696636,0.0020497406,0.0015468333,0.003939295,0.0040764594,0.0032267987,0.011824654],"category_scores_gemma":[0.015355281,0.0013985996,0.0036551945,0.001352302,0.007213543,0.007573868,0.0061021587,0.0073299287,0.00263582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048829887,0.00011011963,0.00024361892,0.0001391793,0.000026713022,0.00020404509,0.00029544675,0.019905796,0.0035951273,0.9613018,0.0021574313,0.011971741],"study_design_scores_gemma":[0.00014580127,0.00009203116,0.000112665635,0.00013232583,0.000057005847,0.0002418463,0.00008024919,0.26926368,0.012930839,0.689892,0.026990611,0.000060899234],"about_ca_topic_score_codex":0.0040141786,"about_ca_topic_score_gemma":0.0035143162,"teacher_disagreement_score":0.011824654,"about_ca_system_score_codex":0.0031087364,"about_ca_system_score_gemma":0.0036218625,"threshold_uncertainty_score":0.039557457},"labels":[],"label_agreement":null},{"id":"W4400184706","doi":"10.1007/978-3-031-64573-0_7","title":"GreenStableYolo: Optimizing Inference Time and Image Quality of Text-to-Image Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Inference; Image (mathematics); Image quality; Artificial intelligence; Quality (philosophy); Computer vision","score_opus":0.024207800828140755,"score_gpt":0.2774683416743956,"score_spread":0.2532605408462548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400184706","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.014470473,0.00045204745,0.9114885,0.0002222677,0.00020791992,0.00012867058,0.00072350184,0.06414285,0.008163803],"genre_scores_gemma":[0.120232664,0.00016106604,0.84786135,0.00022461466,0.00009282541,0.00015210398,0.0021246176,0.009517104,0.019633522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994252,0.000096807,0.000027081449,0.00017328333,0.00018928495,0.00008841015],"domain_scores_gemma":[0.99876,0.00062313076,0.000052133786,0.00027695054,0.00023084872,0.000056944205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007812574,0.0012005549,0.0007123635,0.00097529835,0.0005251041,0.0011408341,0.0023317223,0.00125473,0.03357546],"category_scores_gemma":[0.0032259538,0.0007722173,0.0007662873,0.00087262696,0.00049944146,0.0016722119,0.0014473225,0.0013885524,0.0076091522],"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.0012595782,0.00019400628,0.0007082453,0.0002174772,0.00009214678,0.00014555156,0.00010369009,0.03430046,0.04422101,0.010155067,0.060806904,0.8477958],"study_design_scores_gemma":[0.00023760567,0.00011335958,0.0005115731,0.000022220194,0.00004636106,0.00009017848,0.000027791486,0.9068526,0.069350824,0.010039444,0.012681658,0.000026370984],"about_ca_topic_score_codex":0.008335747,"about_ca_topic_score_gemma":0.015711922,"teacher_disagreement_score":0.03357546,"about_ca_system_score_codex":0.00084839965,"about_ca_system_score_gemma":0.00092805363,"threshold_uncertainty_score":0.11232108},"labels":[],"label_agreement":null},{"id":"W4400208339","doi":"10.1007/978-3-031-64302-6_11","title":"Evaluating the Effectiveness of Comparison Activities in a CTAT Tutor for Algorithmic Thinking","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Computer science; TUTOR; Artificial intelligence; Operations research; Human–computer interaction; Software engineering; Programming language; Mathematics","score_opus":0.04014915320833006,"score_gpt":0.34578877303916417,"score_spread":0.3056396198308341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400208339","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.987912,0.00021719132,0.0056247856,0.000098396464,0.00009270701,0.0005628203,0.00023973187,0.00057703187,0.0046753073],"genre_scores_gemma":[0.97981995,0.00018527776,0.015127499,0.000079481295,0.00004600765,0.0006373256,0.00070044963,0.00009350487,0.0033104196],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9954529,0.0022229163,0.0005357514,0.0008103056,0.00074377534,0.00023433856],"domain_scores_gemma":[0.90263736,0.0805969,0.003439327,0.0032304418,0.0045008697,0.0055950717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046216757,0.0011682248,0.0010277863,0.0012262833,0.0005424757,0.0021370344,0.00231076,0.0017775766,0.009334158],"category_scores_gemma":[0.07011808,0.00037528938,0.00045328613,0.0007687826,0.00044521014,0.0021831943,0.0017038771,0.0012047602,0.0028406007],"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.08018408,0.06026069,0.037627388,0.0029097523,0.00052092894,0.0005273596,0.006750045,0.027989201,0.047147702,0.0013696733,0.006553796,0.72815937],"study_design_scores_gemma":[0.026200643,0.2720634,0.1839923,0.001398432,0.0029338514,0.0015684947,0.008468587,0.32130033,0.14988382,0.0085544055,0.022873865,0.0007619348],"about_ca_topic_score_codex":0.0013177952,"about_ca_topic_score_gemma":0.0010940634,"teacher_disagreement_score":0.009334158,"about_ca_system_score_codex":0.0007179945,"about_ca_system_score_gemma":0.0010834886,"threshold_uncertainty_score":0.03122586},"labels":[],"label_agreement":null},{"id":"W4400218182","doi":"10.1007/978-3-031-64605-8_21","title":"Form-Based Semantic Caching on Time Series","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Series (stratigraphy); Information retrieval","score_opus":0.010841743498921823,"score_gpt":0.21871774376289424,"score_spread":0.2078760002639724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400218182","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.037982564,0.0011053975,0.9398864,0.00037026248,0.00033249246,0.000102520906,0.0012825471,0.013166965,0.005770906],"genre_scores_gemma":[0.47949094,0.001295662,0.49814078,0.00032758384,0.00031508075,0.00019972895,0.004556754,0.0019223854,0.013751099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986884,0.0002510491,0.00012772565,0.00024256589,0.0005093953,0.00018078733],"domain_scores_gemma":[0.99465394,0.0014167741,0.00018202663,0.0028843593,0.0007308015,0.00013218731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015775595,0.0012019915,0.0023006126,0.0018897238,0.0011407428,0.002828121,0.0023282631,0.0011136428,0.007088114],"category_scores_gemma":[0.00794,0.0006847744,0.0012104927,0.004435498,0.0012534364,0.0077303248,0.003319418,0.0014501839,0.0020786054],"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.0013755107,0.0003524018,0.0025527976,0.00029992298,0.0001214178,0.00031706985,0.00040307737,0.14189225,0.011843501,0.18873207,0.039235324,0.6128746],"study_design_scores_gemma":[0.00006308349,0.00008549346,0.0003438369,0.000029912106,0.00006293453,0.00012867116,0.00008600916,0.79993486,0.007837204,0.17986053,0.011534658,0.00003281551],"about_ca_topic_score_codex":0.00674437,"about_ca_topic_score_gemma":0.008143232,"teacher_disagreement_score":0.007088114,"about_ca_system_score_codex":0.0014674796,"about_ca_system_score_gemma":0.001841608,"threshold_uncertainty_score":0.023712158},"labels":[],"label_agreement":null},{"id":"W4400224674","doi":"10.1007/978-3-031-64381-1_6","title":"Efficient Oblivious Transfer for One-Sided Active Adaptive Adversaries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Oblivious transfer; Transfer (computing); Theoretical computer science; Algorithm; Cryptography; Parallel computing","score_opus":0.021218451101663625,"score_gpt":0.24139921630755481,"score_spread":0.2201807652058912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400224674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0365612,0.00044777946,0.939058,0.00060906884,0.00014350007,0.00014489214,0.00014006498,0.0012596722,0.021635804],"genre_scores_gemma":[0.885037,0.00044572045,0.08178426,0.00024156975,0.00014085547,0.00026155513,0.00020132119,0.0002826837,0.031604968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838614,0.00039066494,0.000071066475,0.0002378424,0.0005527997,0.00036145025],"domain_scores_gemma":[0.99659663,0.0018759186,0.00015190673,0.0011331383,0.00016734748,0.00007496864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011442221,0.0008322785,0.0010739511,0.00054677034,0.0008421314,0.0019551672,0.0017984419,0.0013758248,0.0058555063],"category_scores_gemma":[0.0038144684,0.00059015135,0.00072151946,0.00072975014,0.0021455768,0.0049304254,0.0042133424,0.0034264666,0.0016854063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008659026,0.00020970244,0.00027319606,0.0002533001,0.00007438792,0.00017820652,0.00032338858,0.14813931,0.028550485,0.6861086,0.008737703,0.1262858],"study_design_scores_gemma":[0.000059279355,0.000090433496,0.00011794955,0.000029963288,0.000025120285,0.0001413874,0.000033233748,0.5676428,0.012289603,0.41624698,0.0032976111,0.000025594447],"about_ca_topic_score_codex":0.00031719444,"about_ca_topic_score_gemma":0.00032117893,"teacher_disagreement_score":0.0058555063,"about_ca_system_score_codex":0.0012218759,"about_ca_system_score_gemma":0.0010132036,"threshold_uncertainty_score":0.01958859},"labels":[],"label_agreement":null},{"id":"W4400315783","doi":"10.1007/978-3-031-62846-7_14","title":"TARGET: Tactile-Audio DaRts for Guiding Enabled Throwing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Throwing; Human–computer interaction; Computer graphics (images); Computer vision; Artificial intelligence; Multimedia; Speech recognition; Simulation; Aeronautics; Engineering","score_opus":0.054514824030898475,"score_gpt":0.2924615553200046,"score_spread":0.23794673128910615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400315783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051842857,0.013493813,0.7356971,0.00051496614,0.0023820526,0.00024378265,0.00080161385,0.012605933,0.18241788],"genre_scores_gemma":[0.29958516,0.009279562,0.26305667,0.00061696535,0.00034766214,0.00030491245,0.0011242928,0.0018135417,0.42387122],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999058,0.00000582328,0.0000031212546,0.000020244497,0.000051936146,0.000013076441],"domain_scores_gemma":[0.9999455,0.0000151761515,0.000004139487,0.0000073976694,0.000013569853,0.000014089114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012420167,0.00093554845,0.00035535934,0.0003638673,0.00026175097,0.00086725346,0.0009084884,0.00074349414,0.019667277],"category_scores_gemma":[0.0001822133,0.00024162965,0.00032456053,0.00026158657,0.00038279808,0.00091147964,0.0011116528,0.00070379605,0.0055011366],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032906304,0.0001276455,0.0001715677,0.00083141075,0.000029177956,0.00055831374,0.0002989062,0.003390052,0.49554068,0.02589375,0.026044669,0.4467848],"study_design_scores_gemma":[0.00016845758,0.0016352424,0.002575688,0.0003546756,0.000107356274,0.005528984,0.000416491,0.04374669,0.31643924,0.023154104,0.60572314,0.00014993019],"about_ca_topic_score_codex":0.0001966218,"about_ca_topic_score_gemma":0.0004250274,"teacher_disagreement_score":0.019667277,"about_ca_system_score_codex":0.00016079722,"about_ca_system_score_gemma":0.00020104327,"threshold_uncertainty_score":0.065793574},"labels":[],"label_agreement":null},{"id":"W4400315860","doi":"10.1007/978-3-031-62846-7_13","title":"Making Entertainment Content More Inclusive Introduction to Special Thematic Session","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Session (web analytics); Thematic map; Entertainment; Multimedia; Content (measure theory); World Wide Web; Visual arts; Cartography","score_opus":0.04544852165436875,"score_gpt":0.34549960311817357,"score_spread":0.3000510814638048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400315860","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006978918,0.011874167,0.026750917,0.009976633,0.041849475,0.0002539444,0.0008249327,0.0021577496,0.8993334],"genre_scores_gemma":[0.0113039985,0.0056277765,0.0037552498,0.0016624907,0.0067514,0.00011702667,0.0006894822,0.00073020055,0.96936226],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999846,0.000022603617,0.000004288756,0.00003004874,0.00006629206,0.000030782634],"domain_scores_gemma":[0.9996927,0.00003792277,0.000010226398,0.000020228063,0.00011702869,0.00012190234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029050687,0.0007175516,0.00035806012,0.00091523473,0.0009907164,0.0030561946,0.0006267103,0.0009320764,0.16890407],"category_scores_gemma":[0.0005293036,0.00022164387,0.00047299505,0.00077149906,0.00031470758,0.0028547281,0.0022983176,0.0015502039,0.060053863],"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.0000729929,0.00011748029,0.00012931955,0.00031442233,0.000008491112,0.00009163748,0.00053897843,0.00016426758,0.008037859,0.013327969,0.7562924,0.2209042],"study_design_scores_gemma":[0.0000039936135,0.00003434268,0.0003940103,0.00009779102,0.000005864871,0.00007391121,0.00021663406,0.00015031197,0.0010285907,0.0022916854,0.99569654,0.0000063465923],"about_ca_topic_score_codex":0.0005027228,"about_ca_topic_score_gemma":0.0013993498,"teacher_disagreement_score":0.16890407,"about_ca_system_score_codex":0.0005463749,"about_ca_system_score_gemma":0.00053419435,"threshold_uncertainty_score":0.56504035},"labels":[],"label_agreement":null},{"id":"W4400315932","doi":"10.1007/978-3-031-62846-7_18","title":"Towards Improving the Correct Lyric Detection by Deaf and Hard of Hearing People","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tactile and Sensory Interactions","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Lyrics; Computer science; Syllable; Speech recognition; Acoustics","score_opus":0.023673701826599048,"score_gpt":0.253067147088668,"score_spread":0.22939344526206895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400315932","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.9114969,0.002285761,0.061896548,0.0008936822,0.00016772922,0.00032498076,0.0004700571,0.0022428164,0.020221524],"genre_scores_gemma":[0.92250144,0.0008304863,0.06520673,0.0004039562,0.000052028005,0.000192077,0.00040076196,0.00013767058,0.010274898],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994161,0.00021135612,0.000025479187,0.00010304192,0.00016550563,0.00007847633],"domain_scores_gemma":[0.9979481,0.0011843343,0.00011974998,0.00010603322,0.0004946161,0.0001470509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226407,0.0007393355,0.00042881502,0.0004892635,0.00028463788,0.0013706138,0.0005147571,0.00096348993,0.010099312],"category_scores_gemma":[0.006851259,0.00016324042,0.0002889831,0.00012356484,0.00032401207,0.0010689028,0.0013748208,0.00070880185,0.0037535161],"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.0018467483,0.000788633,0.030326238,0.0013911547,0.000051407307,0.0006286955,0.0071510253,0.0010783643,0.23086327,0.0011157527,0.008698847,0.7160598],"study_design_scores_gemma":[0.0005312589,0.0073663937,0.40372792,0.0016043953,0.00056216033,0.0066099307,0.035516452,0.069369614,0.36279085,0.009488404,0.10194857,0.00048403977],"about_ca_topic_score_codex":0.00122708,"about_ca_topic_score_gemma":0.0013244653,"teacher_disagreement_score":0.010099312,"about_ca_system_score_codex":0.00025693074,"about_ca_system_score_gemma":0.0004021368,"threshold_uncertainty_score":0.03378558},"labels":[],"label_agreement":null},{"id":"W4400315957","doi":"10.1007/978-3-031-62846-7_54","title":"Designing an Inclusive Audiovisual Tool for Museum Exploration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia","score_opus":0.02494771912055283,"score_gpt":0.2750043627782086,"score_spread":0.2500566436576558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400315957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0772007,0.0005705958,0.87751913,0.00014454575,0.00016754189,0.00025240908,0.00016267873,0.003418521,0.04056392],"genre_scores_gemma":[0.29669806,0.0005212684,0.6547266,0.00014363811,0.00004127926,0.00042542923,0.0002590615,0.0007806651,0.04640398],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972683,0.00004397566,0.000012184471,0.000045235156,0.00011702867,0.000054709755],"domain_scores_gemma":[0.9997148,0.00013242778,0.000010412289,0.000036858484,0.00004610981,0.00005946426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035855523,0.000859095,0.00036324552,0.0008205176,0.0009925852,0.002267032,0.0016419323,0.0012467591,0.01385188],"category_scores_gemma":[0.0010159556,0.000547623,0.000637498,0.00050029246,0.00057994993,0.0018874337,0.004098664,0.0007191772,0.002637519],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048694553,0.00045380826,0.0014379655,0.0013191594,0.00007869432,0.0023770235,0.011111045,0.006980969,0.375942,0.027258921,0.011983358,0.5605701],"study_design_scores_gemma":[0.000270338,0.002210943,0.0075443788,0.0010023084,0.000564362,0.010195175,0.014589594,0.12080742,0.268608,0.03144582,0.5423653,0.0003963269],"about_ca_topic_score_codex":0.0007260961,"about_ca_topic_score_gemma":0.0014660193,"teacher_disagreement_score":0.01385188,"about_ca_system_score_codex":0.00026373423,"about_ca_system_score_gemma":0.0004929723,"threshold_uncertainty_score":0.046339154},"labels":[],"label_agreement":null},{"id":"W4400316578","doi":"10.1007/978-3-031-62849-8_10","title":"Automatic Bars with Single-Switch Scanning for Target Selection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"York University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence","score_opus":0.014038103205960167,"score_gpt":0.24749913203690005,"score_spread":0.2334610288309399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400316578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044178516,0.0012849241,0.91682744,0.000093817456,0.0004882166,0.00015966117,0.00039782305,0.018986933,0.017582644],"genre_scores_gemma":[0.3537657,0.00060938764,0.62072396,0.00031572688,0.00024540856,0.00024154996,0.0008082986,0.0016957788,0.021594137],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950254,0.00007524053,0.000018996392,0.00014783879,0.00018525355,0.000070166476],"domain_scores_gemma":[0.99933124,0.00030170134,0.000034679397,0.00017207875,0.00012359241,0.000036818208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033647707,0.0011788107,0.0009573153,0.00088168634,0.00046091864,0.0007593336,0.0027887975,0.0010806487,0.022867348],"category_scores_gemma":[0.0006905859,0.00075865054,0.00039183794,0.00097216316,0.0002728132,0.0011362658,0.001079266,0.00085203274,0.007622306],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001202684,0.0001975017,0.00045384685,0.00035049618,0.000049381735,0.00015379541,0.000077937184,0.0018069901,0.53790957,0.004248068,0.011240319,0.44230944],"study_design_scores_gemma":[0.0001632581,0.0009753938,0.004021992,0.000083411906,0.00016233015,0.0022895178,0.00006157111,0.19106016,0.75095975,0.00519217,0.04486512,0.00016534564],"about_ca_topic_score_codex":0.00045990857,"about_ca_topic_score_gemma":0.0010707383,"teacher_disagreement_score":0.022867348,"about_ca_system_score_codex":0.00027408308,"about_ca_system_score_gemma":0.00035762516,"threshold_uncertainty_score":0.076498926},"labels":[],"label_agreement":null},{"id":"W4400316641","doi":"10.1007/978-3-031-62849-8_4","title":"Using a Novel Conversational Method for Measuring Comprehension of D/HoH Viewers Consuming Captioning Content for Entertainment Purposes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Toronto Metropolitan University; York University; University of Toronto","funders":"","keywords":"Closed captioning; Computer science; Comprehension; Entertainment; Multimedia; Content (measure theory); Human–computer interaction; Natural language processing; Artificial intelligence; Programming language; Visual arts; Image (mathematics); Art","score_opus":0.20875198886353008,"score_gpt":0.32214966996345284,"score_spread":0.11339768109992276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400316641","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.93579483,0.00025336357,0.045383934,0.00016741153,0.0001556084,0.0022128797,0.0012813291,0.000626252,0.014124332],"genre_scores_gemma":[0.8889405,0.00035488876,0.09177052,0.00041454824,0.00015797673,0.006573271,0.0010709438,0.00016504804,0.010552316],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9982231,0.0008760047,0.00010665908,0.00037669126,0.00031047335,0.000107135056],"domain_scores_gemma":[0.9951231,0.003100137,0.0004095507,0.00021266064,0.0009213169,0.00023337855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015234635,0.0008372579,0.0003682788,0.0013575152,0.00065056316,0.001102931,0.00055280526,0.001086822,0.0051002465],"category_scores_gemma":[0.008059441,0.00034144655,0.0003967336,0.0006185241,0.0003014561,0.0010243854,0.0010969673,0.00091824215,0.0014784681],"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.0024430456,0.004788657,0.105169386,0.0016837855,0.0002558015,0.00094909774,0.07967731,0.00041297954,0.49670804,0.0014910592,0.0045392867,0.30188158],"study_design_scores_gemma":[0.00060312037,0.009191862,0.76423675,0.0003543111,0.00066744,0.0029593403,0.058420256,0.009789708,0.12965663,0.0021116347,0.021347893,0.0006610344],"about_ca_topic_score_codex":0.001301734,"about_ca_topic_score_gemma":0.0025080242,"teacher_disagreement_score":0.0051002465,"about_ca_system_score_codex":0.0002450896,"about_ca_system_score_gemma":0.00045485393,"threshold_uncertainty_score":0.017062008},"labels":[],"label_agreement":null},{"id":"W4400316777","doi":"10.1007/978-3-031-62849-8_9","title":"Interaction Techniques for Motor-Disabled Users Introduction to the Special Thematic Session","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Session (web analytics); Computer science; Thematic map; Human–computer interaction; Multimedia; World Wide Web; Cartography","score_opus":0.016125838168131748,"score_gpt":0.2842680514334841,"score_spread":0.26814221326535237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400316777","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04696187,0.12258838,0.48967564,0.0032814073,0.008267149,0.0007156655,0.001315114,0.006891532,0.32030332],"genre_scores_gemma":[0.07405558,0.05053168,0.08214961,0.0008409373,0.0016592734,0.0006711936,0.0014127468,0.0013707549,0.7873083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985886,0.000026952695,0.000008482158,0.000025118554,0.00005989551,0.000020665033],"domain_scores_gemma":[0.99984705,0.00007191229,0.0000051109105,0.000010934785,0.00004205843,0.000022843578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002888897,0.000944068,0.00056925206,0.00051524676,0.00047368882,0.0011328215,0.00090914994,0.0007474586,0.07765868],"category_scores_gemma":[0.00043192212,0.00026038868,0.0007038769,0.0005236209,0.00017504784,0.0011457518,0.0012996248,0.0009401552,0.01251684],"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.00025045522,0.00032807354,0.00033656988,0.0013042778,0.00004080522,0.00049144716,0.0018529644,0.0006750127,0.07843319,0.0066610086,0.1685216,0.74110454],"study_design_scores_gemma":[0.000047094956,0.0008754304,0.006596853,0.0009685604,0.000068721514,0.0027790584,0.0014539681,0.0041770805,0.018751225,0.0055623455,0.9586423,0.0000773388],"about_ca_topic_score_codex":0.00047437,"about_ca_topic_score_gemma":0.00085618405,"teacher_disagreement_score":0.07765868,"about_ca_system_score_codex":0.00014917039,"about_ca_system_score_gemma":0.0001939513,"threshold_uncertainty_score":0.25979418},"labels":[],"label_agreement":null},{"id":"W4400316866","doi":"10.1007/978-3-031-62849-8_5","title":"NERWEB: User-Friendly Software for Caption Quality Assessment Using the NER Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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; York University","funders":"","keywords":"Computer science; User Friendly; Software; Software engineering; Software quality; Quality (philosophy); World Wide Web; Software development; Programming language","score_opus":0.10080059301388933,"score_gpt":0.33565759298013365,"score_spread":0.23485699996624432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400316866","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001961998,0.00021187417,0.2119757,0.00009748438,0.00015159664,0.00029849738,0.03020938,0.74399245,0.011100941],"genre_scores_gemma":[0.04486713,0.0006658216,0.50519824,0.00046915567,0.00019211942,0.0017647346,0.18796131,0.2010052,0.057876214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900216,0.00012341417,0.00010331306,0.00020396944,0.0004991184,0.0000679595],"domain_scores_gemma":[0.99781775,0.00084467634,0.00013398143,0.00042291434,0.00067734893,0.00010341017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015396425,0.0028024872,0.0013085259,0.0043581612,0.00069420296,0.002765633,0.0025614968,0.0017509358,0.19094224],"category_scores_gemma":[0.006690556,0.0013543037,0.0018255432,0.0023699775,0.00032230344,0.003862956,0.0018795711,0.0014951348,0.10839164],"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.00047337962,0.0002219163,0.0011641007,0.0015697775,0.0001876661,0.0002831272,0.00023512823,0.0069986,0.013775172,0.0030659735,0.63473046,0.33729476],"study_design_scores_gemma":[0.0003519539,0.00022748265,0.007847914,0.00048769687,0.00025822755,0.0012431479,0.00035200745,0.27233702,0.11164562,0.016363237,0.5883127,0.00057300506],"about_ca_topic_score_codex":0.0046707476,"about_ca_topic_score_gemma":0.0071631307,"teacher_disagreement_score":0.19094224,"about_ca_system_score_codex":0.0007295284,"about_ca_system_score_gemma":0.0007695657,"threshold_uncertainty_score":0.63876545},"labels":[],"label_agreement":null},{"id":"W4400381755","doi":"10.1007/978-981-97-4399-5_32","title":"3W-SLP: A Conceptual Model of Three-Way Single Layer Perceptrons","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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":"Saint Mary's University","funders":"","keywords":"Computer science; Perceptron; Layer (electronics); Artificial intelligence; Artificial neural network","score_opus":0.04712098352897267,"score_gpt":0.2567260298617731,"score_spread":0.20960504633280044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400381755","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.00311124,0.00017584568,0.9914904,0.00019913426,0.00007702332,0.00002244668,0.000390076,0.0014228701,0.0031108868],"genre_scores_gemma":[0.21326926,0.00074347696,0.7679911,0.00043542316,0.00010158366,0.00028402245,0.0014991623,0.00075327174,0.014922696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997688,0.00005004746,0.000018874845,0.000063669264,0.000070313,0.000028374523],"domain_scores_gemma":[0.99965155,0.00012097212,0.0000233892,0.00007525082,0.00009422828,0.000034626515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005026756,0.0006024813,0.0006114793,0.00046255506,0.0003025142,0.0016678324,0.0024687517,0.0013152764,0.008601829],"category_scores_gemma":[0.0015251217,0.00043160745,0.0011362204,0.000846721,0.0008458134,0.0030197748,0.0011193452,0.0021022884,0.0032267973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021042528,0.00008589564,0.00037260356,0.00037123394,0.000085716434,0.00021985876,0.00018329287,0.3302395,0.010466961,0.38279822,0.013655633,0.26131073],"study_design_scores_gemma":[0.000009985998,0.000023768813,0.000061836676,0.000017970118,0.000011085469,0.000038730006,0.000010783547,0.8158568,0.0020371457,0.17576483,0.0061546224,0.000012503694],"about_ca_topic_score_codex":0.0029227843,"about_ca_topic_score_gemma":0.0037122897,"teacher_disagreement_score":0.008601829,"about_ca_system_score_codex":0.00060858123,"about_ca_system_score_gemma":0.00092804345,"threshold_uncertainty_score":0.02877593},"labels":[],"label_agreement":null},{"id":"W4400431046","doi":"10.1007/978-3-031-61698-3_32","title":"Rediscovering West Chinatown: Immersive Game Design Revives Toronto’s Chinese Cultural Heritage","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cultural Industries and Urban Development","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; Toronto Zoo","funders":"","keywords":"Chinatown; Computer science; Cultural heritage; Computer graphics (images); Visual arts; Art history; Media studies; Art; History; Archaeology; Sociology","score_opus":0.030438017054527904,"score_gpt":0.291232105299304,"score_spread":0.26079408824477607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400431046","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.58756644,0.0017550718,0.02252281,0.0035552667,0.00033260733,0.00012418014,0.00025897793,0.0006398436,0.38324475],"genre_scores_gemma":[0.8732675,0.0007578339,0.0082262205,0.00028384643,0.000015861528,0.00005071049,0.00012589556,0.00014089565,0.11713134],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998454,0.00004073354,0.0000031685047,0.000016594908,0.000039198698,0.000054874214],"domain_scores_gemma":[0.99982965,0.00003430682,0.0000075871562,0.000018502024,0.000020592623,0.000089235815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033527822,0.0005664838,0.00015476395,0.0004685136,0.0033125342,0.002665409,0.0005125546,0.0003815744,0.011016574],"category_scores_gemma":[0.000342423,0.00017837978,0.00023935482,0.0007199795,0.0025349848,0.00095155777,0.00246028,0.0006999713,0.00057877257],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033201787,0.0001724567,0.016853036,0.00049127074,0.00006302707,0.001656859,0.29871392,0.0039902776,0.02234822,0.17095484,0.09799802,0.38642603],"study_design_scores_gemma":[0.000039386956,0.00024983124,0.029675348,0.00029410826,0.00009672263,0.0004699747,0.14607483,0.003911008,0.0052582594,0.0058622793,0.80797225,0.00009606259],"about_ca_topic_score_codex":0.38703382,"about_ca_topic_score_gemma":0.78177744,"teacher_disagreement_score":0.6129662,"about_ca_system_score_codex":0.004766164,"about_ca_system_score_gemma":0.005266862,"threshold_uncertainty_score":0.76956207},"labels":[],"label_agreement":null},{"id":"W4400431052","doi":"10.1007/978-3-031-61698-3_30","title":"Re-contextualizing Built Environments: Critical and Inclusive HCI Approaches for Cultural Heritage","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary 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":"Simon Fraser University","funders":"","keywords":"Computer science; Cultural heritage; Human–computer interaction; Architectural engineering; Geography; Archaeology; Engineering","score_opus":0.052074767766872185,"score_gpt":0.2707981569515788,"score_spread":0.21872338918470657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400431052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071566805,0.019306704,0.57088965,0.022067878,0.001302962,0.00035898323,0.00026261006,0.0021749327,0.31206948],"genre_scores_gemma":[0.69960034,0.0131012965,0.2326818,0.0035073108,0.00032604084,0.00055934663,0.00035255385,0.0009317481,0.048939656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99654204,0.0021615354,0.000102777354,0.0003487435,0.0005692034,0.00027580583],"domain_scores_gemma":[0.99537355,0.0033236498,0.00011889372,0.00068502966,0.00027929383,0.00021951878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045885877,0.0012690224,0.00077396515,0.0018229601,0.0029862172,0.017715095,0.0027094292,0.0036193754,0.00990219],"category_scores_gemma":[0.006925226,0.0007069555,0.0006673301,0.0019132684,0.014470079,0.01762652,0.011696928,0.0041556223,0.0014028497],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008961627,0.00012791781,0.0011188207,0.0017591402,0.000048635357,0.00067549886,0.34739232,0.0013165736,0.007388206,0.39034212,0.018322226,0.23141897],"study_design_scores_gemma":[0.000027415897,0.00008124403,0.001250169,0.0016537025,0.00008701087,0.0010198626,0.20429015,0.0030922673,0.0036860546,0.3192217,0.46550575,0.00008469023],"about_ca_topic_score_codex":0.0031109434,"about_ca_topic_score_gemma":0.0069896723,"teacher_disagreement_score":0.017715095,"about_ca_system_score_codex":0.0017571404,"about_ca_system_score_gemma":0.0024641391,"threshold_uncertainty_score":0.033126116},"labels":[],"label_agreement":null},{"id":"W4400431173","doi":"10.1007/978-3-031-61688-4_31","title":"Workshop on Sustainable Human-Work Interaction Designs: Introduction and Summary","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"McGill University","funders":"","keywords":"Computer science; Work (physics); Human–computer interaction; Software engineering; Engineering; Mechanical engineering","score_opus":0.025893404671116924,"score_gpt":0.288510878859636,"score_spread":0.26261747418851905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400431173","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01212985,0.07334104,0.3606567,0.015977703,0.017066423,0.00096574693,0.0012359221,0.0013304615,0.5172961],"genre_scores_gemma":[0.063816,0.054655105,0.10693257,0.0026259585,0.0022744662,0.0011134947,0.0020541195,0.00066237815,0.76586586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990097,0.00023694446,0.0000528314,0.00017851697,0.0004329756,0.00008888155],"domain_scores_gemma":[0.9993573,0.00013268428,0.00001895498,0.00008491663,0.000278295,0.0001278891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021495516,0.0010597076,0.0005371942,0.0009971025,0.0009238863,0.0029488392,0.0017796126,0.0015512428,0.035453215],"category_scores_gemma":[0.0012928162,0.0005128292,0.0007030991,0.0015693435,0.00061556575,0.0023227923,0.002869027,0.0016198979,0.011266956],"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.00016449856,0.0003232184,0.00033151123,0.0020416405,0.000038841492,0.0001863803,0.0018130477,0.0036801856,0.009358653,0.073354684,0.21162626,0.6970811],"study_design_scores_gemma":[0.000016191007,0.00020966183,0.00044501203,0.0009708366,0.000015932374,0.00015852887,0.0007263267,0.0011871294,0.0041026976,0.01998838,0.972152,0.000027357199],"about_ca_topic_score_codex":0.0010326372,"about_ca_topic_score_gemma":0.0025380298,"teacher_disagreement_score":0.035453215,"about_ca_system_score_codex":0.0008839133,"about_ca_system_score_gemma":0.0021774708,"threshold_uncertainty_score":0.11860287},"labels":[],"label_agreement":null},{"id":"W4400473992","doi":"10.1007/978-981-97-4677-4_10","title":"Work in Progress Prediction for Business Processes Using Temporal Convolutional Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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 Calgary","funders":"","keywords":"Computer science; Work (physics); Convolutional neural network; Artificial intelligence","score_opus":0.0258044153391027,"score_gpt":0.24277330597645666,"score_spread":0.21696889063735397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400473992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27628547,0.0045623365,0.69929516,0.0008748205,0.0003742316,0.00009436473,0.004273466,0.0035921573,0.0106479265],"genre_scores_gemma":[0.9224361,0.0012941452,0.062916726,0.000050239716,0.000115991934,0.00006745192,0.0043671443,0.00010420669,0.0086479075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960214,0.00003792719,0.00002678097,0.00013880746,0.00011568634,0.00007863052],"domain_scores_gemma":[0.9989882,0.00051637937,0.00013807468,0.00009873777,0.00019668775,0.00006185691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009604901,0.0009433095,0.00045612364,0.0018050934,0.00033175934,0.0010639542,0.00087436853,0.0006601593,0.0021257459],"category_scores_gemma":[0.0025225182,0.00031020123,0.0006397125,0.0014210464,0.00023092379,0.0015757205,0.0007722067,0.00089240767,0.0010558642],"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.00058614754,0.00037780614,0.021196896,0.00021731987,0.00019040582,0.0002082606,0.00012199489,0.38459137,0.008564194,0.009024877,0.007827467,0.5670932],"study_design_scores_gemma":[0.0000028915379,0.000019638246,0.0014604967,0.0000127703215,0.000025538051,0.000016953865,0.000008513914,0.99261475,0.0017070743,0.0033791824,0.00074738753,0.0000047921917],"about_ca_topic_score_codex":0.01492085,"about_ca_topic_score_gemma":0.021411913,"teacher_disagreement_score":0.01492085,"about_ca_system_score_codex":0.0009547836,"about_ca_system_score_gemma":0.0007363794,"threshold_uncertainty_score":0.029668033},"labels":[],"label_agreement":null},{"id":"W4400474090","doi":"10.1007/978-981-97-4677-4_41","title":"Exploring Simpson’s Paradox Through the Lens of Fuzzy Causal Inference","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Université du Québec à Trois-Rivières; Innovation and Economic Development Trois Rivières","funders":"","keywords":"Computer science; Fuzzy inference; Fuzzy inference system; Inference; Artificial intelligence; Causal inference; Lens (geology); Fuzzy logic; Adaptive neuro fuzzy inference system; Fuzzy control system; Mathematics; Optics; Econometrics; Physics","score_opus":0.10388349838742578,"score_gpt":0.29015518057543155,"score_spread":0.18627168218800577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400474090","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.039604742,0.010336006,0.5820545,0.05582557,0.0012174487,0.000045804678,0.00023738205,0.00011973292,0.3105588],"genre_scores_gemma":[0.8725121,0.0042581437,0.10315853,0.0027420502,0.0011481675,0.00008252052,0.00008519069,0.00009116558,0.015922101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962058,0.002212694,0.00014368829,0.00036503232,0.0008923515,0.00018043547],"domain_scores_gemma":[0.9825889,0.015050111,0.0005646674,0.00081103784,0.0006589416,0.0003263096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008386261,0.00061064184,0.0012075687,0.002187474,0.0030778954,0.0062825475,0.0020122286,0.0037754246,0.006099137],"category_scores_gemma":[0.022896228,0.00058529753,0.0010649713,0.0020817865,0.01325655,0.011572453,0.0033333646,0.0064926352,0.0004136216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022098875,0.0000023387322,0.00002342021,0.00000903163,0.000003241866,0.000023190467,0.00011725897,0.00045289067,0.000015673313,0.9977889,0.0002999723,0.0012618578],"study_design_scores_gemma":[0.0000012517181,6.1676184e-7,0.000009227175,0.000005381517,9.927946e-7,0.000011375051,0.000027269329,0.0010168448,0.000007389537,0.99820733,0.0007106903,0.0000016270243],"about_ca_topic_score_codex":0.0036769644,"about_ca_topic_score_gemma":0.0042172396,"teacher_disagreement_score":0.008386261,"about_ca_system_score_codex":0.0037521024,"about_ca_system_score_gemma":0.0021626789,"threshold_uncertainty_score":0.04435128},"labels":[],"label_agreement":null},{"id":"W4400474393","doi":"10.1007/978-981-97-4677-4_31","title":"Simulation Optimization of Operating Room Schedules for Elective Surgeries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Sunnybrook Health Science Centre; University of Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Operations research; Simulation; Mathematics","score_opus":0.05816873805406093,"score_gpt":0.39387201950090484,"score_spread":0.3357032814468439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400474393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32308298,0.0011368003,0.6016382,0.0014426361,0.00040759312,0.00022587876,0.0014282577,0.0010851884,0.06955256],"genre_scores_gemma":[0.94387394,0.00033575593,0.044790283,0.00010560949,0.00006558018,0.00015405973,0.00061451347,0.00014916978,0.009910976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997056,0.00013432457,0.000008956512,0.000034214776,0.000048946786,0.000067881396],"domain_scores_gemma":[0.99841297,0.0012183641,0.00009024872,0.000044844244,0.00014324754,0.00009031735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000539164,0.0008024635,0.0009321177,0.0005174179,0.00035685019,0.0007120551,0.0009565732,0.0009293305,0.007325119],"category_scores_gemma":[0.0024481588,0.00075132,0.00079994486,0.0006683491,0.00034385503,0.00045861775,0.0005429527,0.00074824935,0.00039363015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029642291,0.000011648464,0.000079131336,0.0000051440675,0.0000036731205,0.0000039877277,0.0000024338815,0.9978587,0.000054957614,0.0003728958,0.0002075335,0.0013703307],"study_design_scores_gemma":[0.000006474627,0.000009796947,0.00004016545,0.0000012562666,0.0000015800528,0.0000013151983,0.000002417998,0.99948895,0.000051422292,0.00029302543,0.00010245472,0.0000010882103],"about_ca_topic_score_codex":0.020851027,"about_ca_topic_score_gemma":0.014512825,"teacher_disagreement_score":0.020851027,"about_ca_system_score_codex":0.0011714402,"about_ca_system_score_gemma":0.00183584,"threshold_uncertainty_score":0.041459322},"labels":[],"label_agreement":null},{"id":"W4400474456","doi":"10.1007/978-981-97-4677-4_21","title":"Causal Deep Q Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.01792250885620761,"score_gpt":0.2470463341454796,"score_spread":0.229123825289272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400474456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010577177,0.0019247083,0.915327,0.0032839393,0.000334386,0.00003863058,0.00065239554,0.0006238895,0.067237794],"genre_scores_gemma":[0.5974346,0.005810481,0.22920923,0.0015262347,0.00078587135,0.0002335894,0.0016921272,0.0006524721,0.16265535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.000107047024,0.000011823114,0.00008436148,0.00006856827,0.000029406927],"domain_scores_gemma":[0.9981706,0.0012205505,0.00009422643,0.00022677526,0.00018983251,0.00009803027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165766,0.0005064346,0.00053610414,0.0008550659,0.0006267205,0.0013474681,0.0009781097,0.0012653045,0.026843075],"category_scores_gemma":[0.0060204677,0.0005432053,0.00052173424,0.0009667479,0.0012762995,0.0029330617,0.0014277188,0.002060196,0.0028619135],"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.000024040059,0.000015053456,0.00022129672,0.000056817436,0.000016565342,0.000032222913,0.00004448828,0.024190115,0.00038133364,0.9183064,0.008727445,0.047984205],"study_design_scores_gemma":[0.0000043105015,0.0000056936296,0.0001239501,0.000019509453,0.000007173308,0.00002892818,0.000010140385,0.07594971,0.00023266612,0.9136572,0.0099552255,0.0000055164974],"about_ca_topic_score_codex":0.0020522743,"about_ca_topic_score_gemma":0.0023109985,"teacher_disagreement_score":0.026843075,"about_ca_system_score_codex":0.0010724585,"about_ca_system_score_gemma":0.000599489,"threshold_uncertainty_score":0.08979905},"labels":[],"label_agreement":null},{"id":"W4400498987","doi":"10.1007/978-3-031-64171-8_21","title":"Seum Spread: Discerning Security Flaws in IoT Firmware via Call Sequence Semantics","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Firmware; Computer science; Programming language; Semantics (computer science); Sequence (biology); Operating system","score_opus":0.015660434100871257,"score_gpt":0.2691251331974724,"score_spread":0.25346469909660113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400498987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37299725,0.0009974799,0.59867734,0.00053980114,0.00019029187,0.00016433279,0.0011897895,0.014098371,0.011145332],"genre_scores_gemma":[0.85619515,0.0002523784,0.1378542,0.00012590809,0.000054339103,0.000051492727,0.0010252009,0.00055501965,0.0038863192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993125,0.000083405976,0.00004417833,0.0001340044,0.00035463582,0.000071241244],"domain_scores_gemma":[0.9979674,0.0010687299,0.00029390046,0.0003234447,0.00027582626,0.00007064564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720037,0.00065827195,0.0004571675,0.002746909,0.00040736666,0.0015595818,0.0006588321,0.0009722113,0.0015490575],"category_scores_gemma":[0.0045029987,0.0002417299,0.00051467493,0.00096956396,0.00089530845,0.0035607119,0.0013194681,0.0010579359,0.00062876364],"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.0010115973,0.00046901396,0.04477861,0.00057489786,0.00015460319,0.0017582196,0.0017712619,0.04635059,0.07988144,0.09547025,0.011491238,0.71628827],"study_design_scores_gemma":[0.000030500887,0.00029489462,0.01004315,0.00017106177,0.00012216155,0.0015223162,0.0007857488,0.79886705,0.053694382,0.11993536,0.014468308,0.00006505019],"about_ca_topic_score_codex":0.0010305566,"about_ca_topic_score_gemma":0.0019528125,"teacher_disagreement_score":0.002746909,"about_ca_system_score_codex":0.0004031782,"about_ca_system_score_gemma":0.0006497654,"threshold_uncertainty_score":0.005182147},"labels":[],"label_agreement":null},{"id":"W4400499032","doi":"10.1007/978-3-031-64171-8_23","title":"SmmPack: Obfuscation for SMM Modules with TPM Sealed Key","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Obfuscation; Key (lock); Programming language; Computer security","score_opus":0.013910048823303605,"score_gpt":0.23443216042550555,"score_spread":0.22052211160220195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499032","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061322488,0.0021506206,0.8532625,0.0012562069,0.00091120426,0.00031989938,0.0010157678,0.01486134,0.0649],"genre_scores_gemma":[0.71345437,0.0015960649,0.20949157,0.0006843307,0.00043675076,0.00042174067,0.0017484882,0.002931427,0.06923525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906725,0.00016983006,0.00005267546,0.00013344435,0.00037204157,0.00020480256],"domain_scores_gemma":[0.9988943,0.00033386072,0.00007196473,0.0005818954,0.000078548386,0.00003952909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009090612,0.0010151356,0.00066309003,0.00079016224,0.0007843625,0.0013820509,0.0010069376,0.0012751439,0.01601993],"category_scores_gemma":[0.002737986,0.00064027944,0.0009156334,0.00085797184,0.0011267838,0.0035681773,0.0039881677,0.002860953,0.0076855267],"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.0009851924,0.00018235415,0.0009160702,0.0010187046,0.000106720334,0.0006468028,0.00057531125,0.011079375,0.046943117,0.43891147,0.059362546,0.43927243],"study_design_scores_gemma":[0.00014676443,0.0004710578,0.001287995,0.00043203036,0.00015707385,0.0021766145,0.00014684607,0.08047437,0.1859792,0.57127714,0.15732028,0.00013063499],"about_ca_topic_score_codex":0.00016096796,"about_ca_topic_score_gemma":0.0001829204,"teacher_disagreement_score":0.01601993,"about_ca_system_score_codex":0.000663439,"about_ca_system_score_gemma":0.0006750781,"threshold_uncertainty_score":0.053592026},"labels":[],"label_agreement":null},{"id":"W4400499041","doi":"10.1007/978-3-031-64171-8_18","title":"Pairing Security Advisories with Vulnerable Functions Using Open-Source LLMs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Merck Canada Inc. (Canada)","funders":"","keywords":"Computer science; Pairing; Open source; Computer security; Programming language; Physics; Software","score_opus":0.026368676353523822,"score_gpt":0.26663719090995813,"score_spread":0.2402685145564343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03927064,0.00024846077,0.8686582,0.0004842544,0.0002649476,0.0002807043,0.0003435216,0.057451684,0.03299763],"genre_scores_gemma":[0.58890474,0.00028777317,0.35683846,0.00035447275,0.00019033438,0.0003921477,0.0010441133,0.009570796,0.04241718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960681,0.0012744636,0.00032162695,0.00052025146,0.0013338838,0.0004815097],"domain_scores_gemma":[0.98850095,0.004130258,0.00071688613,0.0051543494,0.0010033188,0.000494216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003724151,0.0010141038,0.0008803688,0.0019371408,0.001155609,0.0031942893,0.001900949,0.0017184942,0.038846117],"category_scores_gemma":[0.019821258,0.0009829327,0.00086317223,0.0009339009,0.0014379716,0.0073447064,0.0061171455,0.0029816763,0.013264867],"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.0015414059,0.0005648826,0.0050151674,0.0004259844,0.00008032847,0.00084475084,0.001914901,0.012158148,0.030232925,0.26395616,0.04407615,0.6391892],"study_design_scores_gemma":[0.00017981292,0.00066504994,0.0022025444,0.0005675912,0.00013835217,0.0016493731,0.0006419886,0.22783634,0.15430865,0.32654,0.28502604,0.0002442528],"about_ca_topic_score_codex":0.0003417489,"about_ca_topic_score_gemma":0.00054486725,"teacher_disagreement_score":0.038846117,"about_ca_system_score_codex":0.0011467268,"about_ca_system_score_gemma":0.001144705,"threshold_uncertainty_score":0.12995315},"labels":[],"label_agreement":null},{"id":"W4400499064","doi":"10.1007/978-3-031-64171-8_5","title":"Modularizing Directed Greybox Fuzzing for Binaries over Multiple CPU Architectures","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fuzz testing; Computer science; Programming language; Operating system; Parallel computing; Software","score_opus":0.022033722642859514,"score_gpt":0.26275811713292646,"score_spread":0.24072439449006694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10054844,0.00037353742,0.8859154,0.00015936395,0.0001207107,0.00014012062,0.000074897805,0.008457253,0.004210341],"genre_scores_gemma":[0.6800153,0.0002516168,0.3131516,0.00021943895,0.000048426202,0.000096440264,0.00019784711,0.0011541856,0.0048650294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989556,0.00018226098,0.000071239105,0.00022239331,0.00041151047,0.00015700208],"domain_scores_gemma":[0.9974988,0.0009790714,0.00019609954,0.0009500745,0.0003121659,0.000063807165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011026043,0.0011695509,0.0006910639,0.0010401253,0.00043998382,0.0011403445,0.0017393007,0.0008164182,0.0035842855],"category_scores_gemma":[0.0038145918,0.0006886261,0.0010742326,0.00062095415,0.0013020892,0.0022574004,0.0020566648,0.0016400261,0.0007284602],"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.0008165738,0.0002567713,0.00305113,0.0005610325,0.00021983245,0.00068132783,0.0005085915,0.2290272,0.13984266,0.102056354,0.0047461465,0.51823235],"study_design_scores_gemma":[0.000059914913,0.0002741036,0.0006890724,0.00013802058,0.00016908137,0.00031371563,0.00006269491,0.7210872,0.14720993,0.12323778,0.0066990657,0.0000593759],"about_ca_topic_score_codex":0.0014363957,"about_ca_topic_score_gemma":0.0026375705,"teacher_disagreement_score":0.0035842855,"about_ca_system_score_codex":0.0009439749,"about_ca_system_score_gemma":0.0008762639,"threshold_uncertainty_score":0.011990666},"labels":[],"label_agreement":null},{"id":"W4400499291","doi":"10.1007/978-3-031-64171-8_2","title":"S2malloc: Statistically Secure Allocator for Use-After-Free Protection and More","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Allocator; Computer security; Parallel computing; Programming language; Operating system; Theoretical computer science","score_opus":0.017271699023899016,"score_gpt":0.25613888559090386,"score_spread":0.23886718656700484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024629755,0.0015670651,0.8357754,0.0012151456,0.0012779009,0.0002587794,0.0015268683,0.086726904,0.047022257],"genre_scores_gemma":[0.5188324,0.0010381293,0.24763522,0.0026289432,0.0012443843,0.00078397803,0.0038621186,0.019311104,0.20466371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985884,0.00024339314,0.00009007874,0.00023311988,0.0005924567,0.00025251674],"domain_scores_gemma":[0.9973859,0.00038323304,0.00018795601,0.0016079752,0.00030831769,0.00012658787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434669,0.0014491576,0.0009968076,0.00094989745,0.0008541645,0.0021476399,0.0022999463,0.0012139804,0.045982353],"category_scores_gemma":[0.0027778125,0.00067636254,0.0006614345,0.0009045541,0.0015796904,0.0036794734,0.003661871,0.0022699903,0.021189308],"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.0031460118,0.00030380266,0.0016292051,0.0006529853,0.0001243199,0.00043591033,0.0005269774,0.01716441,0.071941406,0.20727687,0.22392562,0.47287247],"study_design_scores_gemma":[0.00034611786,0.00084983266,0.0011492079,0.00019929449,0.00013403363,0.0013200737,0.00013441728,0.13858384,0.20085552,0.18512787,0.47105062,0.00024915836],"about_ca_topic_score_codex":0.00041779203,"about_ca_topic_score_gemma":0.00067566126,"teacher_disagreement_score":0.045982353,"about_ca_system_score_codex":0.0009629471,"about_ca_system_score_gemma":0.0013525422,"threshold_uncertainty_score":0.1538263},"labels":[],"label_agreement":null},{"id":"W4400499364","doi":"10.1007/978-3-031-64171-8_25","title":"SecMonS: A Security Monitoring Framework for IEC 61850 Substations Based on Configuration Files and Logs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"IEC 61850; Computer science; Database; Operating system; Software engineering; Embedded system; Automation; Engineering","score_opus":0.017413855492747505,"score_gpt":0.26815934772065053,"score_spread":0.25074549222790304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01099719,0.00018314218,0.7729773,0.00016075466,0.00006489855,0.00024052245,0.0015273541,0.20697826,0.0068706884],"genre_scores_gemma":[0.40155405,0.00064663327,0.5410912,0.0004767177,0.00014980508,0.00063835725,0.009778562,0.017122136,0.028542522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928325,0.00012676846,0.000068578345,0.00013005183,0.00032875876,0.000062504616],"domain_scores_gemma":[0.9990451,0.0003062712,0.00013504372,0.0002874294,0.00015540856,0.000070745264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013806991,0.0014571879,0.0006939446,0.0015527006,0.00046832114,0.002047061,0.001820755,0.00073062594,0.00946189],"category_scores_gemma":[0.002502987,0.0009705094,0.00067695195,0.0006491282,0.0007092962,0.0028416004,0.0013633118,0.0013491189,0.0031492035],"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.0011876109,0.00048596386,0.0100808535,0.00071735575,0.00028080592,0.0010734226,0.0012022738,0.08593567,0.055549458,0.082561724,0.1641764,0.59674853],"study_design_scores_gemma":[0.00018438113,0.00025124245,0.005137999,0.00024029355,0.00017692806,0.00077485264,0.0001579546,0.7344395,0.06370872,0.040883947,0.15385818,0.00018602051],"about_ca_topic_score_codex":0.0044359737,"about_ca_topic_score_gemma":0.0060462668,"teacher_disagreement_score":0.00946189,"about_ca_system_score_codex":0.0007441098,"about_ca_system_score_gemma":0.0011046308,"threshold_uncertainty_score":0.031653166},"labels":[],"label_agreement":null},{"id":"W4400499505","doi":"10.1007/978-3-031-64171-8_19","title":"Extended Abstract: Assessing Language Models for Semantic Textual Similarity in Cybersecurity","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Semantic similarity; Similarity (geometry); Natural language processing; Artificial intelligence; Information retrieval; Image (mathematics)","score_opus":0.021623443886029766,"score_gpt":0.27689572374477867,"score_spread":0.2552722798587489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29651025,0.0022330235,0.6301408,0.0028023124,0.0020131653,0.0012318422,0.016425865,0.008892618,0.03975013],"genre_scores_gemma":[0.8228187,0.0006126549,0.13547437,0.0004743753,0.0007249222,0.00091413036,0.023667464,0.0009892659,0.014324013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968976,0.0010976424,0.0002532866,0.0005490271,0.0010895847,0.000112892834],"domain_scores_gemma":[0.97058487,0.020998495,0.0010038532,0.0024637142,0.0043846797,0.000564363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032379432,0.00093922595,0.0007450517,0.002443482,0.00075710565,0.0037563397,0.0015300768,0.0015009299,0.03271544],"category_scores_gemma":[0.041593116,0.00027805933,0.0013092696,0.0022185862,0.0006409013,0.005621073,0.001736597,0.0011547947,0.008514442],"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.002171725,0.001834535,0.029321939,0.001979834,0.0004564999,0.00040631724,0.0016471536,0.05380389,0.021582631,0.029875819,0.10481902,0.7521006],"study_design_scores_gemma":[0.0002523661,0.0014771312,0.03389451,0.0005165104,0.00039463124,0.0012629983,0.0018835263,0.785948,0.036519572,0.11043779,0.027167361,0.00024562265],"about_ca_topic_score_codex":0.003273813,"about_ca_topic_score_gemma":0.0018883097,"teacher_disagreement_score":0.03271544,"about_ca_system_score_codex":0.00097336655,"about_ca_system_score_gemma":0.0009999046,"threshold_uncertainty_score":0.10944402},"labels":[],"label_agreement":null},{"id":"W4400519459","doi":"10.1007/978-981-97-5128-0_37","title":"An Ensemble Learning Model for Predicting Unseen TCR-Epitope Interactions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"vaccines and immunoinformatics approaches","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 Saskatchewan","funders":"","keywords":"Computer science; Ensemble learning; Artificial intelligence; Epitope; Machine learning; Biology; Antigen","score_opus":0.01965049808074815,"score_gpt":0.26588423630288854,"score_spread":0.2462337382221404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400519459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12765136,0.0027223525,0.8628482,0.0004992815,0.00033035112,0.00006531412,0.00084808795,0.0018746157,0.0031603868],"genre_scores_gemma":[0.798296,0.0013748046,0.18538742,0.00040807913,0.00034561826,0.00019904679,0.0027480756,0.00019169763,0.011049268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996562,0.00009969892,0.000021223177,0.000089594054,0.00008435161,0.00004896743],"domain_scores_gemma":[0.999003,0.00061369804,0.00004183514,0.000081488346,0.00023138522,0.000028647743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013576199,0.00092768716,0.0013019361,0.00081599393,0.00035838608,0.00059884484,0.0014535326,0.0011252391,0.0016918869],"category_scores_gemma":[0.0017327196,0.00041220436,0.00095094915,0.00094535464,0.00019961756,0.0011623207,0.00069022866,0.0014883858,0.00066969055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001711179,0.00015096969,0.0022573685,0.000035455283,0.00019147927,0.00006791265,0.000023343951,0.698239,0.0024188207,0.0013196404,0.0038648406,0.29126],"study_design_scores_gemma":[0.000001439059,0.000014092528,0.00012537735,0.0000016416711,0.000010596459,0.000008589036,0.0000012760279,0.99901044,0.00024136322,0.00048638514,0.00009664666,0.0000020590267],"about_ca_topic_score_codex":0.0061111446,"about_ca_topic_score_gemma":0.0070483102,"teacher_disagreement_score":0.0061111446,"about_ca_system_score_codex":0.0004689331,"about_ca_system_score_gemma":0.00047028394,"threshold_uncertainty_score":0.012151122},"labels":[],"label_agreement":null},{"id":"W4400519468","doi":"10.1007/978-981-97-5128-0_30","title":"Novel Fine-Tuning Strategy on Pre-trained Protein Model Enhances ACP Functional Type Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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 Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.026989205554936,"score_gpt":0.27514997047628315,"score_spread":0.24816076492134714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400519468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119709775,0.0018002314,0.84795797,0.0006274858,0.0006052948,0.00016498352,0.0009570617,0.017551813,0.010625377],"genre_scores_gemma":[0.6395553,0.00090564124,0.33765915,0.00073606626,0.00028995267,0.00017963866,0.003643335,0.0011297882,0.01590122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997178,0.000023425126,0.00001218994,0.00012834987,0.00007772135,0.000040551025],"domain_scores_gemma":[0.9996866,0.000060848375,0.000023227107,0.00007774258,0.000119341385,0.000032354474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689938,0.0007737022,0.00075905723,0.0005896877,0.00034803012,0.0007096214,0.001323049,0.00080007064,0.003823808],"category_scores_gemma":[0.00080935395,0.00024222062,0.00051776104,0.000580165,0.00025894534,0.0010021634,0.00069108035,0.0009520067,0.0030543385],"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.0002607848,0.00039911014,0.0029017269,0.00013539768,0.00008082798,0.0001365812,0.000046296813,0.042717908,0.16777727,0.0017430447,0.02344801,0.76035297],"study_design_scores_gemma":[0.00002071531,0.000074258416,0.0019171716,0.0000106222915,0.000047324298,0.00015185948,0.000026874053,0.95808566,0.033064194,0.0017240548,0.0048580044,0.00001928404],"about_ca_topic_score_codex":0.0038336795,"about_ca_topic_score_gemma":0.005226709,"teacher_disagreement_score":0.0038336795,"about_ca_system_score_codex":0.00036105994,"about_ca_system_score_gemma":0.00065048627,"threshold_uncertainty_score":0.012791932},"labels":[],"label_agreement":null},{"id":"W4400519559","doi":"10.1007/978-981-97-5087-0_6","title":"PmmNDD: Predicting the Pathogenicity of Missense Mutations in Neurodegenerative Diseases via Ensemble Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Rare Diseases","field":"Biochemistry, Genetics and Molecular Biology","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":"Occupational Cancer Research Centre; University of Toronto","funders":"","keywords":"Missense mutation; Pathogenicity; Computer science; Ensemble learning; Artificial intelligence; Machine learning; Mutation; Genetics; Biology; Gene","score_opus":0.007606240487349208,"score_gpt":0.22946628625349944,"score_spread":0.22186004576615023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400519559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056261364,0.005057427,0.898988,0.0010197914,0.00087118306,0.00013025734,0.005671003,0.024798563,0.0072023324],"genre_scores_gemma":[0.3326668,0.003675613,0.62084216,0.00071835576,0.0008046907,0.00038288586,0.017731836,0.0014928129,0.021684837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997533,0.000042350217,0.000016573169,0.00007310285,0.00009088742,0.000023793686],"domain_scores_gemma":[0.9997261,0.00016089852,0.000013152728,0.00004211623,0.00003926829,0.000018545577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006472854,0.0008860307,0.00069975515,0.0006131063,0.0001721812,0.0004976497,0.000984458,0.00059369655,0.0029916523],"category_scores_gemma":[0.0010804592,0.0003488907,0.000591301,0.00058857905,0.00013873544,0.00074700394,0.00084989285,0.0010554548,0.0015584454],"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.00024000769,0.00013653516,0.0031652704,0.00015211984,0.00026073266,0.00021377488,0.000032737076,0.13488539,0.009190145,0.0029103328,0.06352715,0.78528583],"study_design_scores_gemma":[0.000037073212,0.00008274365,0.002032553,0.00002575651,0.00006679182,0.0002334089,0.0000095770865,0.96801937,0.006477858,0.012397837,0.010591466,0.000025584384],"about_ca_topic_score_codex":0.0012061886,"about_ca_topic_score_gemma":0.0018520073,"teacher_disagreement_score":0.0029916523,"about_ca_system_score_codex":0.00018170929,"about_ca_system_score_gemma":0.0002441725,"threshold_uncertainty_score":0.010008037},"labels":[],"label_agreement":null},{"id":"W4400519584","doi":"10.1007/978-981-97-5087-0_10","title":"PrSMBooster: Improving the Accuracy of Top-Down Proteoform Characterization Using Deep Learning Rescoring Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Machine learning","score_opus":0.020356036881010037,"score_gpt":0.2679438041019609,"score_spread":0.24758776722095086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400519584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063364506,0.003842287,0.852872,0.0011058492,0.0005863763,0.0002092698,0.004126135,0.068462506,0.0054310104],"genre_scores_gemma":[0.28842083,0.0013030358,0.67408484,0.0011172646,0.00025382038,0.00027601662,0.014700901,0.004390503,0.015452809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918634,0.00017784769,0.000042384043,0.00023528656,0.0002557487,0.000102328406],"domain_scores_gemma":[0.9988379,0.00044676728,0.000079117264,0.00031257127,0.00026605738,0.0000577169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022016042,0.0018149327,0.0016711855,0.0011679216,0.0007295864,0.0015323916,0.0026052648,0.0017159187,0.0044212043],"category_scores_gemma":[0.0035242727,0.00075292867,0.001544741,0.0011188718,0.00049035257,0.0015694764,0.0015000227,0.0024355217,0.003992441],"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.00085251965,0.00052902155,0.002654367,0.00042723923,0.00038726602,0.00024395675,0.00007389791,0.09949686,0.038476158,0.0044145044,0.06610939,0.7863348],"study_design_scores_gemma":[0.000036952453,0.00005725699,0.00053992594,0.000018050678,0.000032385946,0.00006982767,0.000012639691,0.9754608,0.0146778915,0.005492644,0.0035784633,0.000023066394],"about_ca_topic_score_codex":0.006873338,"about_ca_topic_score_gemma":0.01063737,"teacher_disagreement_score":0.006873338,"about_ca_system_score_codex":0.00075779,"about_ca_system_score_gemma":0.001596568,"threshold_uncertainty_score":0.014790416},"labels":[],"label_agreement":null},{"id":"W4400585973","doi":"10.1007/978-3-031-65172-4_11","title":"Enhancing EV Charging Station Security Using a Multi-dimensional Dataset: CICEVSE2024","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.014471241260348053,"score_gpt":0.2493842731970783,"score_spread":0.23491303193673024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400585973","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3584746,0.0061866716,0.090898715,0.0043385504,0.0042612012,0.0009912272,0.4537287,0.041638687,0.039481632],"genre_scores_gemma":[0.19412862,0.00089996285,0.08000978,0.0005138755,0.00020137477,0.00021206851,0.71137923,0.00072287157,0.0119322],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918514,0.00017666635,0.0000445626,0.00019427924,0.0002878126,0.00011157796],"domain_scores_gemma":[0.9991849,0.00013110909,0.000033860266,0.00026662642,0.0003042499,0.0000793569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092818006,0.0018454065,0.0009084438,0.0013217957,0.00050868816,0.0012122558,0.0014531901,0.0014788377,0.0037176618],"category_scores_gemma":[0.0020271353,0.00033693368,0.0010978548,0.0012884027,0.00023429707,0.0013348903,0.0012286736,0.0011504978,0.0037881033],"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.0010604303,0.0013729885,0.01601069,0.00087596575,0.0006105477,0.0004682491,0.0001089164,0.08796102,0.008621257,0.0019369316,0.62170786,0.25926507],"study_design_scores_gemma":[0.0003564388,0.00056163414,0.03527199,0.00031367093,0.0002395177,0.0006436008,0.00073109893,0.72377807,0.02116093,0.006202206,0.2105278,0.00021310664],"about_ca_topic_score_codex":0.017282829,"about_ca_topic_score_gemma":0.044638038,"teacher_disagreement_score":0.017282829,"about_ca_system_score_codex":0.00065652735,"about_ca_system_score_gemma":0.0009623643,"threshold_uncertainty_score":0.03436452},"labels":[],"label_agreement":null},{"id":"W4400586154","doi":"10.1007/978-3-031-65172-4_12","title":"Optimal Automated Generation of Playbooks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Polytechnique Montréal","funders":"","keywords":"Soar; Computer science; Automation; Orchestration; Front and back ends; Software engineering; Artificial intelligence; Operating system","score_opus":0.018659786334357865,"score_gpt":0.24753334026942012,"score_spread":0.22887355393506226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400586154","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.0520542,0.000389129,0.9158459,0.00025114606,0.0001901292,0.00025339503,0.0008446581,0.010157414,0.020014038],"genre_scores_gemma":[0.47675678,0.000270147,0.49735197,0.00009489489,0.000056748362,0.00022442796,0.0025812578,0.0012428238,0.021420982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.00010041411,0.000027136679,0.00016285905,0.00018621451,0.00011117033],"domain_scores_gemma":[0.9989951,0.0005018588,0.000039514387,0.00018122735,0.00022681932,0.00005534902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043733462,0.0009909327,0.0010484663,0.00081240566,0.0006925403,0.0016790639,0.001568247,0.00084794825,0.027116796],"category_scores_gemma":[0.002518296,0.00063152413,0.0007160846,0.0007489884,0.0005775146,0.0012831893,0.0018816333,0.00087232556,0.0047448734],"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.0009721367,0.00025690565,0.0010931507,0.00035680793,0.000046980756,0.00040794685,0.00023170146,0.1708422,0.02670137,0.034341794,0.024002042,0.74074686],"study_design_scores_gemma":[0.000095383824,0.00011088475,0.0004129856,0.00003978116,0.000032989305,0.00014860182,0.00017570796,0.94766927,0.016568312,0.02326869,0.011456162,0.000021388447],"about_ca_topic_score_codex":0.0038217597,"about_ca_topic_score_gemma":0.005431537,"teacher_disagreement_score":0.027116796,"about_ca_system_score_codex":0.00072598684,"about_ca_system_score_gemma":0.001403199,"threshold_uncertainty_score":0.09071475},"labels":[],"label_agreement":null},{"id":"W4400586239","doi":"10.1007/978-3-031-65172-4","title":"Data and Applications Security and Privacy XXXVIII","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University at Albany; National Institute of Standards and Technology; University of Pretoria; Università degli Studi di Salerno; Universitat Politècnica de Catalunya; Universität Regensburg; Università degli Studi di Trento; Universität Wien; Ben-Gurion University of the Negev; Technische Universiteit Eindhoven; Newcastle University; Concordia University; Università degli Studi di Milano; Norges Teknisk-Naturvitenskapelige Universitet; Kent State University; University of Texas at San Antonio; Fondazione Bruno Kessler; European Commission; Colorado State University; University of Pittsburgh; Stony Brook University; University of California, Santa Barbara; Indian Institute of Technology Kharagpur; Università degli Studi di Verona; State University of New York; Vanderbilt University","keywords":"Computer science; Computer security; Information privacy; Data security; Internet privacy; Encryption","score_opus":0.028573224109086293,"score_gpt":0.290356654502481,"score_spread":0.2617834303933947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400586239","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028550664,0.13449231,0.06785003,0.0063056345,0.012519781,0.00015196859,0.001230654,0.0011671862,0.77342737],"genre_scores_gemma":[0.008876037,0.041481547,0.006786549,0.0007431453,0.0029845284,0.00007866155,0.00063376693,0.000355022,0.9380608],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999608,0.000037699825,0.000016607652,0.00005876514,0.00024263184,0.00003639788],"domain_scores_gemma":[0.99964035,0.00013845963,0.000021417625,0.000072752075,0.00009157899,0.000035420333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034655462,0.0013919146,0.00096096063,0.0014552943,0.00079763884,0.0036178401,0.0006253154,0.00094387773,0.047842648],"category_scores_gemma":[0.00086415856,0.00055175717,0.00051182474,0.0027716402,0.0010000693,0.002563571,0.000995625,0.002616882,0.033941135],"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.000045229317,0.00006626252,0.00015254725,0.00043753206,0.00001513293,0.00012005792,0.0002392453,0.0014328137,0.00284466,0.15845494,0.5113852,0.32480645],"study_design_scores_gemma":[0.000005807483,0.000025887,0.00037415742,0.00025500671,0.000007998712,0.0002012166,0.000053431522,0.0015528951,0.0007643508,0.0517277,0.94502276,0.000008907632],"about_ca_topic_score_codex":0.002002262,"about_ca_topic_score_gemma":0.0019466543,"teacher_disagreement_score":0.047842648,"about_ca_system_score_codex":0.001374796,"about_ca_system_score_gemma":0.0011447427,"threshold_uncertainty_score":0.16004962},"labels":[],"label_agreement":null},{"id":"W4400676355","doi":"10.1007/978-3-031-65112-0_2","title":"Error Analysis of Shapley Value-Based Model Explanations: An Informative Perspective","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Oralys (Canada); Concordia University","funders":"","keywords":"Computer science; Shapley value; Perspective (graphical); Value (mathematics); Algorithm; Theoretical computer science; Mathematical economics; Artificial intelligence; Machine learning; Game theory; Mathematics","score_opus":0.04241876940155365,"score_gpt":0.3149556739187277,"score_spread":0.27253690451717405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400676355","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.03474255,0.0021543906,0.92765564,0.006809668,0.00027681392,0.000095870106,0.00026071855,0.00022387037,0.02778035],"genre_scores_gemma":[0.8724308,0.0018010219,0.11204561,0.0009309966,0.0013416812,0.0002404972,0.0004621544,0.0002362244,0.0105109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.983836,0.00988578,0.00065758754,0.0012223285,0.003602092,0.00079621834],"domain_scores_gemma":[0.77457136,0.20150147,0.004909572,0.01098176,0.0068712733,0.0011644509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022142231,0.0017348216,0.0026426155,0.0048372173,0.0017622724,0.0058091707,0.006257374,0.004453182,0.009895765],"category_scores_gemma":[0.12878215,0.0011560577,0.0023876557,0.0053903065,0.0054762065,0.016486265,0.0045274347,0.00613364,0.00053087703],"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.00005459142,0.00005006505,0.0004967636,0.00010664157,0.000055789205,0.00004083814,0.00018223867,0.034550272,0.00006849989,0.9534353,0.0015957908,0.009363303],"study_design_scores_gemma":[0.000007236594,0.000010023511,0.000077605386,0.000026420123,0.000014908405,0.00001735333,0.000027307755,0.06318642,0.0000880617,0.93615156,0.0003830782,0.000010035611],"about_ca_topic_score_codex":0.0016372965,"about_ca_topic_score_gemma":0.0011293128,"teacher_disagreement_score":0.022142231,"about_ca_system_score_codex":0.0047381837,"about_ca_system_score_gemma":0.0022794292,"threshold_uncertainty_score":0.117100716},"labels":[],"label_agreement":null},{"id":"W4400676369","doi":"10.1007/978-3-031-65112-0_3","title":"Concept-Based Analysis of Neural Networks via Vision-Language Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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 Toronto","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Natural language processing; Computer vision","score_opus":0.01025510262428448,"score_gpt":0.278116982880562,"score_spread":0.26786188025627755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400676369","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.014676695,0.0007978211,0.9818494,0.00021150256,0.000056319222,0.000024969753,0.000097789445,0.00040831338,0.0018772226],"genre_scores_gemma":[0.67393064,0.0014780717,0.31395406,0.00015962808,0.0001826363,0.00015168238,0.00065318117,0.00032644597,0.009163776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.00008290781,0.000013728374,0.00006972182,0.00010697242,0.00003539097],"domain_scores_gemma":[0.9990835,0.0005924526,0.00007264058,0.000050809955,0.00017573379,0.000024827017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079869153,0.00052010984,0.0005351923,0.0009870826,0.0002915115,0.0011540514,0.0011758202,0.0006426169,0.002880347],"category_scores_gemma":[0.0032314567,0.0003558421,0.00090087444,0.0008459799,0.00052416074,0.0017127066,0.0006414956,0.0012462029,0.0005593339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013063257,0.000090951995,0.00090422924,0.00018776536,0.00011244641,0.00013422735,0.00013712978,0.57412523,0.01189974,0.14270306,0.0043954514,0.26517916],"study_design_scores_gemma":[0.0000016617562,0.000006239528,0.0001351265,0.000005282899,0.0000057196053,0.00001428125,0.0000067993415,0.9723985,0.00060360687,0.026502453,0.00031627872,0.0000040261416],"about_ca_topic_score_codex":0.005246643,"about_ca_topic_score_gemma":0.0046500554,"teacher_disagreement_score":0.005246643,"about_ca_system_score_codex":0.0011233744,"about_ca_system_score_gemma":0.00067788514,"threshold_uncertainty_score":0.010432184},"labels":[],"label_agreement":null},{"id":"W4400676397","doi":"10.1007/978-3-031-65112-0_1","title":"Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Toronto; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Inductive reasoning; Artificial intelligence; Inductive method; Inductive bias; Theoretical computer science; Mathematics education; Multi-task learning; Teaching method; Mathematics; Task (project management)","score_opus":0.006533803507163764,"score_gpt":0.2260423456541138,"score_spread":0.21950854214695004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400676397","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.009201641,0.00029726455,0.95474714,0.0003292412,0.0001398856,0.00010975726,0.00040572856,0.0044444846,0.030324867],"genre_scores_gemma":[0.12944567,0.0002660924,0.8487033,0.00017315689,0.00013321081,0.00018977524,0.0012193554,0.0009004173,0.018969027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941385,0.00013101374,0.000037569767,0.00016776756,0.00018556952,0.00006419689],"domain_scores_gemma":[0.99871457,0.00075814966,0.000053667423,0.00022869564,0.00018328309,0.00006171989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577671,0.0010248369,0.0007031213,0.00095913623,0.0011598372,0.0019893649,0.002902316,0.0010497216,0.03438015],"category_scores_gemma":[0.003974208,0.0005117979,0.0008266325,0.0020193271,0.0012617757,0.0033516947,0.0025630924,0.002191274,0.0052778632],"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.00025982154,0.00015705604,0.0004370601,0.0004020297,0.000034996952,0.00014771833,0.00024356702,0.047747336,0.0039936625,0.23824967,0.028649317,0.6796778],"study_design_scores_gemma":[0.000094171395,0.000045584457,0.00016534043,0.00005701759,0.00002561425,0.00011872872,0.00014453176,0.56297356,0.010407867,0.39236632,0.033578664,0.000022558757],"about_ca_topic_score_codex":0.004463324,"about_ca_topic_score_gemma":0.010278231,"teacher_disagreement_score":0.03438015,"about_ca_system_score_codex":0.0011575756,"about_ca_system_score_gemma":0.0021578695,"threshold_uncertainty_score":0.115013},"labels":[],"label_agreement":null},{"id":"W4400676406","doi":"10.1007/978-3-031-65112-0_6","title":"A Preliminary Study to Examining Per-class Performance Bias via Robustness Distributions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Robustness (evolution); Computer science; Class (philosophy); Algorithm; Artificial intelligence","score_opus":0.04316998529932985,"score_gpt":0.2785133695285633,"score_spread":0.23534338422923345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400676406","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.5307684,0.0036161202,0.44639075,0.0025141805,0.0003635364,0.0006833745,0.0021674272,0.002728379,0.010767818],"genre_scores_gemma":[0.9355993,0.00031323155,0.06039902,0.00046630675,0.00017651347,0.00027559724,0.0013133471,0.00039402422,0.0010626161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.982363,0.007653955,0.00092753005,0.0035994682,0.004645698,0.00081031484],"domain_scores_gemma":[0.74417365,0.1856203,0.013294843,0.03548084,0.019744491,0.0016859021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028568717,0.001566909,0.0009948626,0.002391129,0.0009207087,0.0027598576,0.0018453846,0.0017170142,0.0030419887],"category_scores_gemma":[0.17111707,0.00040821335,0.0011094534,0.0016843821,0.0019961607,0.004922242,0.001887625,0.003560558,0.0007970336],"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.00352377,0.0016383139,0.19613121,0.0011928465,0.0014474507,0.0008187344,0.0020097913,0.34578046,0.03541915,0.03923052,0.016221885,0.35658586],"study_design_scores_gemma":[0.0001414975,0.0022137691,0.082230635,0.00034552853,0.0002865211,0.0012015365,0.0009044779,0.81259227,0.041593567,0.047459178,0.010793644,0.00023733846],"about_ca_topic_score_codex":0.0020752936,"about_ca_topic_score_gemma":0.0019222128,"teacher_disagreement_score":0.028568717,"about_ca_system_score_codex":0.0018107935,"about_ca_system_score_gemma":0.0010618197,"threshold_uncertainty_score":0.15108758},"labels":[],"label_agreement":null},{"id":"W4400683603","doi":"10.1007/978-3-031-64529-7_28","title":"Monodromy Coordinates","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Monodromy; Computer graphics (images); Computer vision; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.0360138632230829,"score_gpt":0.3002738544832221,"score_spread":0.26425999126013916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400683603","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005829603,0.0014082186,0.022455748,0.00088796526,0.0011166891,0.000025744259,0.00028404687,0.0002788583,0.96771306],"genre_scores_gemma":[0.07341434,0.0026707964,0.009724934,0.0002636728,0.00084465137,0.00005669939,0.0005357152,0.00052732223,0.91196185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998841,0.000019597575,0.0000041842886,0.00002817826,0.000045245553,0.000018562858],"domain_scores_gemma":[0.9999193,0.00000969097,0.0000064601413,0.000019283274,0.000029975095,0.00001537058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001551388,0.0008605644,0.00045040445,0.001061134,0.0010960099,0.0021245214,0.0005771674,0.0003893269,0.052316386],"category_scores_gemma":[0.00036724575,0.00023248944,0.0003020597,0.00080279046,0.00087597006,0.0020510617,0.0009560976,0.0015319895,0.023791777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008122711,0.00000668562,0.00001839492,0.000031538846,0.0000017022817,0.000020089952,0.000120425495,0.00008437899,0.0008641227,0.9569896,0.021546997,0.020308016],"study_design_scores_gemma":[0.000008643669,0.000022790677,0.00015887388,0.000033395405,0.000006089393,0.00020637503,0.00016335341,0.00054450514,0.0016308833,0.5591527,0.43806398,0.000008462996],"about_ca_topic_score_codex":0.00075912493,"about_ca_topic_score_gemma":0.0007825125,"teacher_disagreement_score":0.052316386,"about_ca_system_score_codex":0.0008545406,"about_ca_system_score_gemma":0.00051900645,"threshold_uncertainty_score":0.17501575},"labels":[],"label_agreement":null},{"id":"W4400691846","doi":"10.1007/978-981-97-4243-1_6","title":"Engagement at a Distance: Online Instructor Behaviors to Encourage Student Success","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online and Blended Learning","field":"Social Sciences","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":"Athabasca University","funders":"","keywords":"Computer science; Distance education; Student engagement; Multimedia; Mathematics education; Human–computer interaction; World Wide Web; Psychology","score_opus":0.021410013449503662,"score_gpt":0.34078727373462214,"score_spread":0.3193772602851185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400691846","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.90667313,0.00055934594,0.007798367,0.0019129994,0.00017938999,0.00013442071,0.000064171145,0.000421547,0.08225654],"genre_scores_gemma":[0.96852434,0.00032512625,0.007331782,0.00034729828,0.000083153805,0.00014200396,0.000080298065,0.00009904714,0.023066988],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928504,0.00025069749,0.000022586497,0.00008830187,0.00026017276,0.00009316571],"domain_scores_gemma":[0.9966487,0.0012170217,0.0005183344,0.0001433888,0.00026459136,0.0012078945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083788036,0.0002979596,0.00020526178,0.00037342485,0.0007674284,0.0022035702,0.0005307718,0.00068655476,0.007393489],"category_scores_gemma":[0.0053499937,0.0001343717,0.00020073795,0.0002965791,0.00023735722,0.0010741123,0.0017964784,0.001193986,0.0020376376],"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.00037749184,0.008678575,0.09624772,0.0002848666,0.00006548227,0.00019202566,0.016147733,0.00039190217,0.023954956,0.0026644936,0.019497674,0.8314971],"study_design_scores_gemma":[0.0002539859,0.008204354,0.8023379,0.00086223165,0.0003323882,0.00087821734,0.042425252,0.010698744,0.023885937,0.008929861,0.1010264,0.00016470076],"about_ca_topic_score_codex":0.0004012551,"about_ca_topic_score_gemma":0.0018354275,"teacher_disagreement_score":0.007393489,"about_ca_system_score_codex":0.00031995858,"about_ca_system_score_gemma":0.00055077777,"threshold_uncertainty_score":0.024733663},"labels":[],"label_agreement":null},{"id":"W4400700781","doi":"10.1007/978-3-031-65572-2_23","title":"AGI from the Perspectives of Categorical Logic and Algebraic Geometry","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Discovery Centre","funders":"","keywords":"Categorical variable; Computer science; Algebra over a field; Algebraic number; Geometry; Calculus (dental); Mathematics; Pure mathematics; Mathematical analysis; Machine learning","score_opus":0.012348743049535644,"score_gpt":0.2350069216905359,"score_spread":0.22265817864100027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400700781","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.007127996,0.012292622,0.3293682,0.016638976,0.0013334312,0.00003923033,0.0004969336,0.00058540463,0.63211715],"genre_scores_gemma":[0.60433704,0.01827739,0.19976519,0.005389852,0.004816912,0.00027461373,0.0012447897,0.00076604326,0.16512819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992937,0.00022679172,0.0000331794,0.00009585836,0.00028492752,0.00006544751],"domain_scores_gemma":[0.9992398,0.00042066065,0.000040738967,0.00011489721,0.00012752149,0.000056314533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084311375,0.0004480469,0.00076454255,0.0016813193,0.0016290792,0.0055729365,0.0014345912,0.001176947,0.009965771],"category_scores_gemma":[0.0016313741,0.00038027245,0.0008540518,0.0020753103,0.007108073,0.008065935,0.0019744008,0.005176839,0.0023084418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010533205,9.4489303e-7,0.0000075825847,0.000009171034,6.4914485e-7,0.0000036523788,0.000026299458,0.00008364649,0.00002325419,0.9971148,0.000928211,0.0018007377],"study_design_scores_gemma":[0.0000010642226,0.0000016427917,0.0000142344425,0.0000062993986,7.6302405e-7,0.00001129426,0.000021095566,0.00038075258,0.00003166179,0.9861384,0.013391082,0.0000016988413],"about_ca_topic_score_codex":0.0018457815,"about_ca_topic_score_gemma":0.0018785604,"teacher_disagreement_score":0.009965771,"about_ca_system_score_codex":0.0028613461,"about_ca_system_score_gemma":0.0012337585,"threshold_uncertainty_score":0.033338845},"labels":[],"label_agreement":null},{"id":"W4400870837","doi":"10.1007/978-3-031-66708-4_1","title":"Methodological Resilience Assessment of Smart Cyber Infrastructures","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; European Commission","keywords":"Resilience (materials science); Cyber threats; Computer science; Computer security; Physics","score_opus":0.031534666021723105,"score_gpt":0.30161699730559616,"score_spread":0.27008233128387305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400870837","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.01999366,0.008429072,0.8514568,0.0029802355,0.00035555635,0.00031646676,0.00027871394,0.00036086192,0.11582865],"genre_scores_gemma":[0.46994027,0.010121142,0.48793483,0.00041248786,0.00024789415,0.00084240775,0.00049424224,0.0002452484,0.029761452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962471,0.0021979488,0.00016610014,0.00031636396,0.0009839658,0.0000884623],"domain_scores_gemma":[0.9931203,0.004384142,0.0005576733,0.00054641766,0.0012557252,0.00013565102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047844746,0.0008253849,0.00042517186,0.0034714162,0.0007338941,0.004113745,0.001377747,0.00090185093,0.005360527],"category_scores_gemma":[0.012106492,0.00029698823,0.00051323563,0.0023593116,0.0036501084,0.0031416682,0.002457682,0.0013672913,0.000638452],"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.000010950203,0.000026304922,0.0006065731,0.000613965,0.00002194499,0.00008475928,0.0012021126,0.02813286,0.0012155273,0.9166397,0.0026518088,0.04879346],"study_design_scores_gemma":[0.000006580522,0.00004565958,0.00073475187,0.0011060949,0.000020940715,0.00010570204,0.0017294192,0.081919655,0.002710213,0.84882826,0.06275882,0.000033925626],"about_ca_topic_score_codex":0.0015331695,"about_ca_topic_score_gemma":0.0013726457,"teacher_disagreement_score":0.005360527,"about_ca_system_score_codex":0.0035256506,"about_ca_system_score_gemma":0.002273481,"threshold_uncertainty_score":0.025580466},"labels":[],"label_agreement":null},{"id":"W4400904304","doi":"10.1007/978-3-031-66958-3_32","title":"Prediction of Incident Atrial Fibrillation in Population with Ischemic Heart Disease Using Machine Learning with Radiomics and ECG Markers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Atrial fibrillation; Computer science; Heart disease; Population; Disease; Artificial intelligence; Internal medicine; Cardiology; Machine learning; Radiomics; Medicine","score_opus":0.010977004478984224,"score_gpt":0.25239828534339787,"score_spread":0.24142128086441364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400904304","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.7294559,0.030135728,0.172312,0.0035449965,0.0012139158,0.00009572306,0.008792902,0.0009890794,0.053459726],"genre_scores_gemma":[0.9154583,0.008559774,0.04539624,0.00032142238,0.00069775415,0.000053710974,0.004240009,0.00006502419,0.025207767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993634,0.000018625718,0.000005523728,0.000017779703,0.000016859703,0.0000049115843],"domain_scores_gemma":[0.99975985,0.00018253754,0.000021561667,0.000010462049,0.000018115197,0.0000075051794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029640892,0.0002551752,0.0002379359,0.0004544216,0.000053774525,0.0004707611,0.00029182655,0.00030003252,0.0023132148],"category_scores_gemma":[0.0008215091,0.000113032205,0.00041881244,0.00031170723,0.000078905796,0.0003145699,0.00014285663,0.00036980727,0.0010315581],"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.00039119387,0.00023709546,0.31017298,0.00019609153,0.0002895009,0.0004124101,0.000102274425,0.019308405,0.0052190884,0.002463029,0.01578088,0.645427],"study_design_scores_gemma":[0.000062846586,0.0010197094,0.611611,0.00035635623,0.00047485466,0.0043608267,0.00026376764,0.3253514,0.007279754,0.018693665,0.030423464,0.000102300306],"about_ca_topic_score_codex":0.00069451134,"about_ca_topic_score_gemma":0.001232506,"teacher_disagreement_score":0.0023132148,"about_ca_system_score_codex":0.000086018124,"about_ca_system_score_gemma":0.000096882504,"threshold_uncertainty_score":0.0077385306},"labels":[],"label_agreement":null},{"id":"W4400904851","doi":"10.1007/978-3-031-66958-3_17","title":"Confounder-Aware Image Synthesis for Pathology Segmentation in New Magnetic Resonance Imaging Sequences","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"McMaster University","funders":"","keywords":"Computer science; Magnetic resonance imaging; Segmentation; Image segmentation; Artificial intelligence; Computer vision; Pattern recognition (psychology); Radiology; Medicine","score_opus":0.019033459825611426,"score_gpt":0.29038706250437063,"score_spread":0.2713536026787592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400904851","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.005704514,0.00048473204,0.9912389,0.000084763065,0.000050859315,0.000025232956,0.00007016839,0.0010024015,0.001338402],"genre_scores_gemma":[0.07024619,0.0008383336,0.92147315,0.00016040089,0.00013331947,0.000058249963,0.00038207433,0.00075102394,0.005957289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977344,0.00004184777,0.000014307841,0.000053881697,0.000095657946,0.000020789632],"domain_scores_gemma":[0.99935704,0.00035581092,0.000048208818,0.00009510373,0.00011297466,0.00003089192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161336,0.0007330564,0.00057388376,0.0007608189,0.00026167164,0.0011459542,0.0007531088,0.0011254621,0.006288135],"category_scores_gemma":[0.0018442818,0.00050567556,0.00067666004,0.00070198637,0.00036321642,0.0008704861,0.0010034096,0.0009701808,0.0023607565],"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.0005276607,0.00007578923,0.0004960872,0.0004296013,0.00011484765,0.0002865388,0.00020285729,0.04054396,0.33388984,0.009349804,0.0037435363,0.6103395],"study_design_scores_gemma":[0.00004602494,0.00022207668,0.0014502113,0.00008532612,0.00020211209,0.0015667736,0.00006754958,0.7051928,0.25400323,0.015447089,0.021664675,0.000052118583],"about_ca_topic_score_codex":0.00053205277,"about_ca_topic_score_gemma":0.0014037845,"teacher_disagreement_score":0.006288135,"about_ca_system_score_codex":0.00032023413,"about_ca_system_score_gemma":0.00047803496,"threshold_uncertainty_score":0.02103591},"labels":[],"label_agreement":null},{"id":"W4400907182","doi":"10.1007/978-3-031-66955-2_4","title":"Learning-Based MRI Response Predictions from OCT Microvascular Models to Replace Simulation-Based Frameworks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical Coherence Tomography Applications","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.011562946748254593,"score_gpt":0.23761359749537622,"score_spread":0.22605065074712163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400907182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035691574,0.0005257466,0.9579162,0.00036274665,0.000116195595,0.000043250588,0.0002547339,0.0018861297,0.0032034116],"genre_scores_gemma":[0.79180914,0.0009773271,0.19950539,0.0003026583,0.00010268271,0.00010368505,0.00064288796,0.0005815264,0.0059746653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986196,0.000038039245,0.000007741951,0.000035116864,0.000040987037,0.000016166387],"domain_scores_gemma":[0.9993999,0.00032664282,0.00005794439,0.00007409024,0.00011252563,0.000028850698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192456,0.000663006,0.00057739957,0.00031029794,0.000153069,0.0008337581,0.00096271967,0.0008553117,0.002010788],"category_scores_gemma":[0.0020221313,0.00040687955,0.0006174145,0.000311918,0.00033237512,0.0009765546,0.00052165444,0.0010416836,0.00079405104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010048963,0.00006586858,0.00041380088,0.00006746754,0.000040136154,0.000065931876,0.00002237888,0.9127263,0.009325503,0.0047623697,0.0015263647,0.0708834],"study_design_scores_gemma":[0.0000014815989,0.0000074436516,0.000028774719,0.0000032523992,0.0000032010626,0.0000085187385,0.0000013350212,0.9977342,0.0010931566,0.00089213916,0.00022402841,0.0000024630692],"about_ca_topic_score_codex":0.004443175,"about_ca_topic_score_gemma":0.0042582187,"teacher_disagreement_score":0.004443175,"about_ca_system_score_codex":0.000542445,"about_ca_system_score_gemma":0.0006088777,"threshold_uncertainty_score":0.0088346},"labels":[],"label_agreement":null},{"id":"W4400907183","doi":"10.1007/978-3-031-66955-2_6","title":"DeepDSMRI: Deep Domain Shift Analyzer for MRI","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Women and Children’s Health Research Institute; University of Alberta","funders":"","keywords":"Computer science; Spectrum analyzer; Domain (mathematical analysis); Artificial intelligence; Algorithm; Telecommunications; Mathematics","score_opus":0.015374687269940304,"score_gpt":0.30646215383071623,"score_spread":0.29108746656077594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400907183","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.0015560741,0.0009553364,0.9742555,0.00021597325,0.00017742228,0.00003917805,0.0015436466,0.017304113,0.0039527207],"genre_scores_gemma":[0.033571832,0.0018070004,0.9217667,0.0005911349,0.00017883554,0.00014382125,0.0052955695,0.0041761748,0.032468833],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983454,0.000017210034,0.000009264393,0.000040205632,0.00008203028,0.000016671836],"domain_scores_gemma":[0.9997801,0.00007538591,0.000016597829,0.000044050073,0.00006402644,0.000019858542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032152544,0.0013940146,0.00048565527,0.0007584923,0.00021265629,0.0009907509,0.0012257975,0.0008207412,0.028905245],"category_scores_gemma":[0.00086802815,0.00067614083,0.00052096846,0.0007353107,0.0002971199,0.0010127346,0.001222355,0.00119883,0.015569871],"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.00022907663,0.000047380458,0.00035383645,0.00032489526,0.00006218174,0.00015163481,0.000052884756,0.013867871,0.05910482,0.013782952,0.12823959,0.7837829],"study_design_scores_gemma":[0.0000641741,0.00017494509,0.0012199301,0.00012881831,0.00006633383,0.0015472997,0.000079212106,0.48351994,0.18245009,0.07349673,0.25713772,0.00011481148],"about_ca_topic_score_codex":0.0009921012,"about_ca_topic_score_gemma":0.0028150775,"teacher_disagreement_score":0.028905245,"about_ca_system_score_codex":0.0003755714,"about_ca_system_score_gemma":0.0005723987,"threshold_uncertainty_score":0.09669769},"labels":[],"label_agreement":null},{"id":"W4400960929","doi":"10.1007/978-3-031-65665-1_2","title":"On Tolerance-Based Rough Set Operators and Their Covering Generalizations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Rough set; Set (abstract data type); Theoretical computer science; Algebra over a field; Algorithm; Artificial intelligence; Programming language; Mathematics; Pure mathematics","score_opus":0.01947287335458734,"score_gpt":0.23494996702959084,"score_spread":0.2154770936750035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400960929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03582249,0.0063288636,0.93185,0.00090757775,0.00033056503,0.00003612111,0.00012413335,0.00014299453,0.024457242],"genre_scores_gemma":[0.6271131,0.010120825,0.34292492,0.0005925544,0.0013693391,0.00017261098,0.00042998925,0.00019157674,0.017085075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985567,0.00050078775,0.000102998296,0.0001961952,0.0005409374,0.00010246913],"domain_scores_gemma":[0.9968092,0.0020829036,0.0002831937,0.00039814186,0.00029659347,0.0001299903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709294,0.00069872895,0.000986299,0.0018358635,0.0008307042,0.0022248523,0.0009969344,0.0007513447,0.0019346441],"category_scores_gemma":[0.0070633036,0.00042795687,0.0018540113,0.0038569719,0.0021510515,0.0062062456,0.0018837552,0.0026272046,0.0003342082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004100969,0.000021973065,0.00016906008,0.00010839643,0.000029222621,0.000088329376,0.00034242615,0.015468898,0.001168121,0.94287723,0.001775701,0.03790967],"study_design_scores_gemma":[0.000004184975,0.00003877158,0.00023510716,0.000030876246,0.000018030683,0.00011416976,0.000059958296,0.04033849,0.00033101617,0.9547379,0.004075055,0.00001632529],"about_ca_topic_score_codex":0.0008807623,"about_ca_topic_score_gemma":0.00046106052,"teacher_disagreement_score":0.002709294,"about_ca_system_score_codex":0.0010083666,"about_ca_system_score_gemma":0.00042982242,"threshold_uncertainty_score":0.014328301},"labels":[],"label_agreement":null},{"id":"W4400961159","doi":"10.1007/978-3-031-65665-1_22","title":"Multimodal Propaganda Detection in Memes with Tolerance-Based Soft Computing Method","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","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 Winnipeg","funders":"","keywords":"Computer science; Soft computing; Artificial intelligence; Human–computer interaction; Artificial neural network","score_opus":0.018780598594060723,"score_gpt":0.3003433226942859,"score_spread":0.28156272410022515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400961159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03293081,0.00023292,0.9635885,0.00015176585,0.00010480041,0.000058148646,0.000051159488,0.0004153246,0.002466667],"genre_scores_gemma":[0.67849493,0.00024121233,0.3142439,0.00016393937,0.00014677769,0.00022392902,0.00020245915,0.00013516263,0.006147677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919087,0.00021273237,0.000057477933,0.00019941444,0.00023453913,0.00010495683],"domain_scores_gemma":[0.99762255,0.0013931883,0.00018251975,0.00017922898,0.0005144135,0.000108151144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013413024,0.00056957663,0.0009998812,0.0014947683,0.0006847685,0.0012905722,0.0015397868,0.0009935015,0.0026602775],"category_scores_gemma":[0.004708013,0.00027907788,0.0008584396,0.0011109234,0.0009360513,0.0015046699,0.0016394397,0.001068885,0.0004737028],"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.0005382588,0.00031029736,0.005733761,0.0005341844,0.00021612416,0.00024498763,0.00077131984,0.27529663,0.021715505,0.03709655,0.0049452656,0.6525971],"study_design_scores_gemma":[0.0000055910236,0.00003651536,0.0004903725,0.000013878305,0.000021069598,0.000035137957,0.00006126865,0.99174386,0.0020785094,0.0050976523,0.0004017305,0.000014511225],"about_ca_topic_score_codex":0.0020423622,"about_ca_topic_score_gemma":0.0016893632,"teacher_disagreement_score":0.0026602775,"about_ca_system_score_codex":0.00047195356,"about_ca_system_score_gemma":0.00073717633,"threshold_uncertainty_score":0.00889951},"labels":[],"label_agreement":null},{"id":"W4400961934","doi":"10.1007/978-3-031-65668-2_12","title":"Approximate Criterion Reduction in Multi-criteria Trilevel Ranking Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University; University of Regina","funders":"","keywords":"Computer science; Ranking (information retrieval); Reduction (mathematics); Data mining; Artificial intelligence; Mathematics","score_opus":0.03862040814727203,"score_gpt":0.2904845084362955,"score_spread":0.25186410028902345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400961934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004058693,0.00047369878,0.99414814,0.000060523616,0.000026440404,0.000025748845,0.00003676973,0.000055911758,0.0011140339],"genre_scores_gemma":[0.30148414,0.0010084128,0.6927027,0.00011083035,0.00012280175,0.00033531923,0.0003175435,0.00015725137,0.0037610081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607927,0.0018810224,0.00018140665,0.0002968427,0.0013843058,0.00017713696],"domain_scores_gemma":[0.9965495,0.0022685467,0.0001516814,0.0003639855,0.00058751344,0.00007878514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521574,0.0007087789,0.0026983724,0.0020212058,0.0006282344,0.002179264,0.0017696484,0.00092014135,0.0027114619],"category_scores_gemma":[0.008284599,0.0006138395,0.0019958538,0.0032948127,0.0011384424,0.0019909116,0.0019180677,0.0022730022,0.0006054178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015558938,0.00013123447,0.00062730204,0.0007163649,0.00026975092,0.000133763,0.0002249227,0.5461327,0.003639492,0.20950012,0.004055435,0.2344133],"study_design_scores_gemma":[0.0000050515723,0.00004113797,0.0001958884,0.000020369936,0.000023629293,0.00002969818,0.000016892312,0.93040925,0.0003992495,0.06793597,0.0009112919,0.000011591883],"about_ca_topic_score_codex":0.0024895333,"about_ca_topic_score_gemma":0.001914275,"teacher_disagreement_score":0.003521574,"about_ca_system_score_codex":0.0015285064,"about_ca_system_score_gemma":0.0010083119,"threshold_uncertainty_score":0.018624127},"labels":[],"label_agreement":null},{"id":"W4400962047","doi":"10.1007/978-3-031-65668-2_17","title":"A Novel Approach to Rental Market Analysis for Property Management Firms Using Large Language Models and Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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","funders":"","keywords":"Renting; Computer science; Property (philosophy); Artificial intelligence; Natural language processing; Programming language","score_opus":0.11934787287532048,"score_gpt":0.3612891496457182,"score_spread":0.2419412767703977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011081982,0.00021598545,0.98612356,0.00036911943,0.000050032384,0.000042950458,0.00018869009,0.00048863154,0.0014390821],"genre_scores_gemma":[0.253057,0.0006091409,0.7272974,0.0004105941,0.0004522742,0.00030476906,0.0012974363,0.00039193442,0.016179373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.00012524232,0.000024594852,0.00008015378,0.00009072536,0.00003887808],"domain_scores_gemma":[0.99884015,0.000801747,0.0000752551,0.00008847881,0.00014782847,0.000046472793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077859074,0.0007383385,0.0007840624,0.00096956163,0.0005422589,0.0015085888,0.0012939626,0.0007994297,0.004361225],"category_scores_gemma":[0.0027761436,0.00037926703,0.0012830079,0.00088682934,0.00046786692,0.0025363849,0.0013174389,0.0016255188,0.0010650068],"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.00017463972,0.0006735597,0.0037770236,0.00033659284,0.0003143575,0.0009028849,0.0004558233,0.25497144,0.023300126,0.21031922,0.015992725,0.48878163],"study_design_scores_gemma":[0.000006764032,0.0000151133445,0.0002414805,0.000004123331,0.000011507938,0.00003681518,0.000025958603,0.966683,0.00060068426,0.031131292,0.0012334941,0.000009830091],"about_ca_topic_score_codex":0.0052934466,"about_ca_topic_score_gemma":0.010846275,"teacher_disagreement_score":0.0052934466,"about_ca_system_score_codex":0.0006172198,"about_ca_system_score_gemma":0.0011319596,"threshold_uncertainty_score":0.014589727},"labels":[],"label_agreement":null},{"id":"W4400962088","doi":"10.1007/978-3-031-65668-2_11","title":"Three-Way Bibliometrics Analytics for Supporting Literature Review","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision 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 Regina","funders":"","keywords":"Computer science; Bibliometrics; Analytics; Data science; Information retrieval; World Wide Web","score_opus":0.17167197655905858,"score_gpt":0.44044411854205945,"score_spread":0.26877214198300087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962088","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.09607655,0.004734564,0.6483639,0.0030160372,0.00077727373,0.0013336836,0.12604555,0.07812322,0.041529234],"genre_scores_gemma":[0.25857463,0.0018797717,0.69077706,0.00019383927,0.00036606382,0.001133617,0.040605653,0.0011829619,0.005286465],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9915418,0.0019468237,0.0015078058,0.0008031483,0.003909825,0.00029057995],"domain_scores_gemma":[0.9614244,0.022824867,0.0045279367,0.0036790979,0.006233146,0.0013105293],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0062352614,0.0015774235,0.0019272491,0.044459764,0.0013430921,0.011217703,0.0013652329,0.00092099915,0.013728187],"category_scores_gemma":[0.04138002,0.0006702691,0.0019457011,0.05255503,0.00046059888,0.00627651,0.0057617025,0.001100808,0.007540779],"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.0005147469,0.0003978373,0.040943224,0.0026197433,0.0008919908,0.0003368319,0.0017837528,0.0062431004,0.008055887,0.034262307,0.06268135,0.84126925],"study_design_scores_gemma":[0.0002812836,0.00052652176,0.07279406,0.0017816165,0.0012260388,0.0015763788,0.004825695,0.3463524,0.03224329,0.29127324,0.24644232,0.0006771543],"about_ca_topic_score_codex":0.0023478712,"about_ca_topic_score_gemma":0.0056086797,"teacher_disagreement_score":0.95554024,"about_ca_system_score_codex":0.0009617025,"about_ca_system_score_gemma":0.0035183246,"threshold_uncertainty_score":0.04592544},"labels":[],"label_agreement":null},{"id":"W4400962111","doi":"10.1007/978-3-031-65668-2_10","title":"A Machine-People-Government Triangular Model of Smart Agriculture","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological 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 Regina","funders":"","keywords":"Computer science; Government (linguistics); Agriculture; Computer security; Operations research; Engineering; History","score_opus":0.013213296081872257,"score_gpt":0.19825141268499782,"score_spread":0.18503811660312558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096918456,0.0004998953,0.7073148,0.0057848743,0.0002944394,0.00011429014,0.0010160218,0.00046865523,0.1875885],"genre_scores_gemma":[0.9156377,0.00028669188,0.026216848,0.00027531112,0.00009298633,0.00011057111,0.00025990323,0.00009091602,0.057029076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961567,0.0001520277,0.000014022668,0.00007574635,0.00005951708,0.000083035025],"domain_scores_gemma":[0.9993205,0.00031020137,0.000057819234,0.00009167218,0.00010979386,0.00011003011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052782666,0.00038163102,0.0008646647,0.0004658465,0.0012099261,0.0023360949,0.0019745748,0.0028180466,0.028306557],"category_scores_gemma":[0.002097598,0.0004282768,0.0008557494,0.00092814566,0.0018756221,0.003247192,0.0016790503,0.0016783719,0.0019544156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045409368,0.000037486978,0.00027108475,0.000026468462,0.000009689886,0.000114652736,0.00017665133,0.23739195,0.0003746895,0.7539216,0.0026289702,0.005001349],"study_design_scores_gemma":[0.00001547547,0.000015655143,0.000069537324,0.0000048621114,0.0000039346087,0.000021008018,0.00006555968,0.73322195,0.00005975958,0.26457807,0.0019366916,0.0000074358063],"about_ca_topic_score_codex":0.021993112,"about_ca_topic_score_gemma":0.012514396,"teacher_disagreement_score":0.028306557,"about_ca_system_score_codex":0.0019427226,"about_ca_system_score_gemma":0.001374347,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4400962171","doi":"10.1007/978-3-031-65668-2_15","title":"Estate 360: AI-Driven Centralized Real Estate Platform","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Modeling in Geospatial Applications","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":"Saint Mary's University","funders":"","keywords":"Computer science; Real estate; Estate; Real-time computing; Finance; Business","score_opus":0.013900379421283315,"score_gpt":0.24106403802134913,"score_spread":0.22716365860006582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962171","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032894515,0.00047532178,0.6533592,0.00054795516,0.00043841347,0.00043976936,0.0035980064,0.17774233,0.1305045],"genre_scores_gemma":[0.5070225,0.0006371229,0.32678133,0.0006231227,0.00013537382,0.00057687,0.01197406,0.0084325215,0.14381705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973196,0.000022809778,0.000013045769,0.00005718131,0.00014373598,0.00003131243],"domain_scores_gemma":[0.9997634,0.00003450084,0.000010020345,0.00007461036,0.000067355744,0.00005016335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033467752,0.000588629,0.00043311037,0.00044746746,0.00045900105,0.0019281106,0.0020678155,0.000567644,0.037425537],"category_scores_gemma":[0.0008476155,0.00044878208,0.00030310804,0.00061275985,0.0003320964,0.0017855063,0.001545746,0.0010868013,0.013970738],"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.001601952,0.0005714072,0.0019426277,0.0004423172,0.0001156944,0.0006856079,0.0007541273,0.08564778,0.08659062,0.08769745,0.32042018,0.41353032],"study_design_scores_gemma":[0.00028712014,0.00017007178,0.00096409855,0.000035639496,0.00004296067,0.00025951193,0.00013522926,0.63733214,0.03224673,0.042144123,0.28629205,0.000090301524],"about_ca_topic_score_codex":0.0041495725,"about_ca_topic_score_gemma":0.0040594493,"teacher_disagreement_score":0.037425537,"about_ca_system_score_codex":0.00052033446,"about_ca_system_score_gemma":0.00087711343,"threshold_uncertainty_score":0.12520093},"labels":[],"label_agreement":null},{"id":"W4400962240","doi":"10.1007/978-3-031-65668-2_16","title":"Housing Rental Information Management and Prediction System Based on CatBoost Algorithm - a Case Study of Halifax Region","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","field":"Engineering","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":"Computer science; Renting; Operations research; Artificial intelligence; Algorithm; Data mining; Engineering; Civil engineering","score_opus":0.008661845853340608,"score_gpt":0.20239929637971485,"score_spread":0.19373745052637426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962240","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.9817727,0.00022955959,0.012051233,0.00023015495,0.000022422675,0.000064530795,0.00031108322,0.00032510955,0.004993104],"genre_scores_gemma":[0.98671836,0.0000898005,0.008484913,0.000013421919,0.000005464879,0.000017036957,0.00023835887,0.000014530114,0.004418161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986064,0.000031967516,0.0000062405275,0.000033234617,0.000031887044,0.000035950277],"domain_scores_gemma":[0.9998115,0.000070004266,0.000013646687,0.000015039599,0.000057788533,0.00003210526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029994186,0.00033249808,0.00039351423,0.00048688432,0.0007622597,0.000652443,0.00078479864,0.0005275234,0.0014629554],"category_scores_gemma":[0.00033301895,0.00013859449,0.00026461654,0.0006994742,0.00026914844,0.00045812334,0.0002651069,0.0002138227,0.0002307891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014369751,0.0014084773,0.15340514,0.00026093973,0.00013881407,0.008412453,0.0014056629,0.53885573,0.021683145,0.004557939,0.013759308,0.25467545],"study_design_scores_gemma":[0.000026322783,0.00015745516,0.03236575,0.000010048881,0.000041310966,0.00033912505,0.0013345357,0.9581486,0.0041426155,0.00045421967,0.002955234,0.000024775178],"about_ca_topic_score_codex":0.1506017,"about_ca_topic_score_gemma":0.15040468,"teacher_disagreement_score":0.8493983,"about_ca_system_score_codex":0.0015525972,"about_ca_system_score_gemma":0.0008712532,"threshold_uncertainty_score":0.29945016},"labels":[],"label_agreement":null},{"id":"W4400962373","doi":"10.1007/978-3-031-65668-2_4","title":"Three-Way Cost-Performance Approximate Attribute Reduction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Reduction (mathematics); Cost reduction; Mathematics","score_opus":0.026661272840207677,"score_gpt":0.24154323631853172,"score_spread":0.21488196347832406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013503063,0.00028656813,0.98178345,0.00011914432,0.00006334161,0.00006284036,0.00011322682,0.00054736156,0.0035211104],"genre_scores_gemma":[0.30836338,0.00035210515,0.68233263,0.00009929072,0.00006952815,0.00019212632,0.00058994413,0.00017689617,0.007824148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977525,0.00042920833,0.00014268527,0.00026943473,0.0011778991,0.0002282876],"domain_scores_gemma":[0.9985273,0.00043946508,0.00004828207,0.0006107775,0.00032150204,0.00005261968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475234,0.00081865216,0.0022459188,0.0012317924,0.00080693746,0.0021610805,0.002246841,0.00087382674,0.0048595658],"category_scores_gemma":[0.0037273108,0.00042235103,0.001938538,0.0028210536,0.0008231555,0.0021924628,0.002777683,0.0017961629,0.0011662841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005348139,0.00029082125,0.0006725948,0.0002563492,0.0001601134,0.00013124052,0.00027651555,0.1951731,0.00985856,0.11537146,0.007261125,0.6700133],"study_design_scores_gemma":[0.000031235442,0.00014479697,0.00048737545,0.000018126906,0.00007713591,0.00017646638,0.00009786499,0.9079356,0.0075541316,0.07834001,0.0051025124,0.000034713314],"about_ca_topic_score_codex":0.0021612304,"about_ca_topic_score_gemma":0.0017253507,"teacher_disagreement_score":0.0048595658,"about_ca_system_score_codex":0.0010926208,"about_ca_system_score_gemma":0.0012599918,"threshold_uncertainty_score":0.016256869},"labels":[],"label_agreement":null},{"id":"W4400962627","doi":"10.1007/978-3-031-65668-2_5","title":"Granular Approximations of Partially-Known Concepts","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Approximations of π; Algorithm; Applied mathematics; Mathematics","score_opus":0.020243405429515037,"score_gpt":0.26204955059554214,"score_spread":0.2418061451660271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400962627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048149355,0.0015450474,0.9371224,0.0002771813,0.0001432349,0.000039401846,0.00022961828,0.00029345864,0.012200392],"genre_scores_gemma":[0.626991,0.002324608,0.36147195,0.0000740266,0.00017267435,0.00009942603,0.00068789575,0.00008504149,0.008093432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887663,0.00022567052,0.00009736665,0.00016184537,0.000546397,0.000091952905],"domain_scores_gemma":[0.997692,0.0012855335,0.00019679966,0.00050866825,0.00022025766,0.00009669241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012729306,0.0006086276,0.00095479947,0.0015955984,0.00048145783,0.0035367298,0.0011845654,0.0006193925,0.0037041332],"category_scores_gemma":[0.006909709,0.0005568216,0.0010200216,0.0023703994,0.0013281096,0.0046149446,0.0019988092,0.0018165429,0.00040380438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027355884,0.000054917113,0.0007214344,0.00036941754,0.00009540901,0.00022333632,0.0004446655,0.1268612,0.0034120455,0.7437439,0.0021469332,0.12165316],"study_design_scores_gemma":[0.000014926305,0.000046568683,0.00050012267,0.0000934882,0.000046226374,0.0001466911,0.00014913765,0.5874675,0.0015358647,0.4046015,0.0053750947,0.000022933265],"about_ca_topic_score_codex":0.0017682103,"about_ca_topic_score_gemma":0.0018662963,"teacher_disagreement_score":0.0037041332,"about_ca_system_score_codex":0.0011228273,"about_ca_system_score_gemma":0.00043895305,"threshold_uncertainty_score":0.012391567},"labels":[],"label_agreement":null},{"id":"W4400973174","doi":"10.1007/978-3-031-65627-9_8","title":"Formally Certified Approximate Model Counting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Supercomputing Centre Singapore; Ministry of Education, India; Vetenskapsrådet; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Algorithm; Correctness; True quantified Boolean formula; HOL; Proof assistant; Automated theorem proving; Maximum satisfiability problem; Discrete mathematics; Boolean function; Programming language; Mathematics; Mathematical proof","score_opus":0.039997819473361014,"score_gpt":0.2814009612170026,"score_spread":0.24140314174364158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400973174","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.01760765,0.00010539713,0.9697804,0.000722377,0.00010814986,0.0001484114,0.0002380297,0.0057340297,0.005555569],"genre_scores_gemma":[0.5868103,0.00022182109,0.40463278,0.0005878332,0.00012838226,0.0003973043,0.0009312922,0.0016370629,0.004653318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98613936,0.0040292917,0.0006706654,0.0019145788,0.005801453,0.0014446591],"domain_scores_gemma":[0.96484095,0.015643924,0.001715836,0.011898728,0.005277713,0.00062282383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052152276,0.0011080411,0.0012178841,0.0014138194,0.0012037595,0.0046064816,0.0041278186,0.0017819589,0.008617804],"category_scores_gemma":[0.04411899,0.00085360184,0.001911894,0.0011221092,0.0038386995,0.00715664,0.005017899,0.004456953,0.0016884941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035789743,0.00028466052,0.003016355,0.00046232934,0.000099208904,0.0004297713,0.00052588974,0.19862324,0.016901659,0.6848893,0.008365062,0.08604464],"study_design_scores_gemma":[0.00007598308,0.00010837238,0.00032461536,0.000110902685,0.000057805213,0.00021223987,0.00012588163,0.69746226,0.030835416,0.2570743,0.01355244,0.00005982973],"about_ca_topic_score_codex":0.0044259652,"about_ca_topic_score_gemma":0.004362815,"teacher_disagreement_score":0.008617804,"about_ca_system_score_codex":0.0040332917,"about_ca_system_score_gemma":0.0064441236,"threshold_uncertainty_score":0.029263735},"labels":[],"label_agreement":null},{"id":"W4400976922","doi":"10.1007/978-3-031-66538-7","title":"Artificial Intelligence in Medicine","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Univerza v Mariboru; Univerza v Ljubljani; Libera Università di Bolzano; Trakya Üniversitesi; Università degli Studi di Verona; Nazarbayev University; Universidade do Porto; Università di Pisa; Syddansk Universitet; Université de Bordeaux; Universidade de Coimbra; Université de Lille; Uniwersytet Łódzki; Università degli Studi di Pavia; Ben-Gurion University of the Negev; Universidad Politécnica de Madrid; Taipei Medical University; Universidad de Murcia; Politechnika Warszawska; Università degli Studi di Padova; University of Pittsburgh; Konkuk University; Università di Bologna; Politechnika Poznańska; Universitat Jaume I; Qatar University; University of St Andrews; Pusan National University; Gachon University; Université Paris-Saclay; Thompson Rivers University; University of Twente; University of Texas Health Science Center at Houston; Kungliga Tekniska Högskolan; Universidade da Coruña; Vrije Universiteit Amsterdam; Harvard University; Institut \"Jožef Stefan\"; Duke-NUS Medical School; Technion-Israel Institute of Technology; İstanbul Medipol Üniversitesi; Dalhousie University; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Western Washington University; University of Haifa; Universitat de Girona; Yonsei University; Universidade de São Paulo; University of Cincinnati; Bharathiar University; Case Western Reserve University; Stockholms Universitet; Brigham and Women's Hospital; Universität Wien; Emory University; Soongsil University; Ohio State University; University of Central Arkansas; Florida State University; Purdue University; George Mason University; Universitat Politècnica de Catalunya; University of Pennsylvania; Medizinische Universität Wien; Vanderbilt University","keywords":"Computer science; Artificial intelligence","score_opus":0.03465206292027404,"score_gpt":0.33312411635591,"score_spread":0.29847205343563593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400976922","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048380202,0.22066571,0.015081883,0.017585032,0.014288991,0.000099624376,0.00022390937,0.0003898104,0.7311812],"genre_scores_gemma":[0.005537199,0.09103203,0.0070615546,0.0076667736,0.007961079,0.00013357503,0.00024133375,0.00021564052,0.88015085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995072,0.00011006715,0.000019658422,0.000059523223,0.0002754823,0.000028076345],"domain_scores_gemma":[0.9993311,0.00029981715,0.000039347335,0.000091831884,0.0001242862,0.00011372647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093113375,0.0013927673,0.0011836117,0.0023435114,0.00086327374,0.0034927772,0.00069741905,0.0015017099,0.06844119],"category_scores_gemma":[0.0017204916,0.00052167533,0.0004273458,0.0019667007,0.0019275161,0.0035004318,0.0023093477,0.003920346,0.049180422],"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.000017632183,0.00003915357,0.00009751909,0.00038986272,0.000018353305,0.000040672443,0.00020304846,0.00036776342,0.00046587558,0.083581775,0.6501919,0.26458648],"study_design_scores_gemma":[0.0000056507624,0.000016675142,0.00025292218,0.00034583802,0.0000068707463,0.000110397676,0.00004721229,0.00024098817,0.000092089445,0.04084074,0.95803565,0.000005012308],"about_ca_topic_score_codex":0.0008187149,"about_ca_topic_score_gemma":0.0028462477,"teacher_disagreement_score":0.06844119,"about_ca_system_score_codex":0.0011567345,"about_ca_system_score_gemma":0.001384198,"threshold_uncertainty_score":0.22895855},"labels":[],"label_agreement":null},{"id":"W4400978123","doi":"10.1007/978-3-031-66538-7_12","title":"Patient-Centric Approach for Utilising Machine Learning to Predict Health-Related Quality of Life Changes During Chemotherapy","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cancer survivorship and care","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Quality (philosophy); Artificial intelligence; Machine learning","score_opus":0.03106625621485939,"score_gpt":0.286027756964194,"score_spread":0.25496150074933466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400978123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04442194,0.0007854366,0.93995464,0.001419184,0.000218194,0.00016494434,0.0012979885,0.0011690322,0.010568671],"genre_scores_gemma":[0.53037834,0.0009249454,0.45145023,0.0006913068,0.0002750526,0.00024493446,0.0016766,0.00012194739,0.014236666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972016,0.00008810104,0.000018215214,0.000066687535,0.00008403534,0.00002280642],"domain_scores_gemma":[0.99955016,0.00025160384,0.000025548206,0.0000415786,0.000106493106,0.000024551997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151868,0.00042994512,0.00038327335,0.00058428786,0.00016431465,0.0008541543,0.00066981727,0.00064829784,0.0025690882],"category_scores_gemma":[0.0011181905,0.0001875485,0.0005728126,0.0006944183,0.00016014387,0.00059753325,0.000554212,0.00081892323,0.00083478197],"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.00040946546,0.0005728165,0.02594728,0.00020584583,0.00035346672,0.00035823713,0.00020348141,0.1742803,0.014979064,0.02386742,0.01669816,0.7421244],"study_design_scores_gemma":[0.000017751036,0.0002411397,0.00859186,0.000025265741,0.00008054046,0.00029318235,0.0000678308,0.9599857,0.005949778,0.016331578,0.008391157,0.000024254323],"about_ca_topic_score_codex":0.0012464485,"about_ca_topic_score_gemma":0.0027823204,"teacher_disagreement_score":0.0025690882,"about_ca_system_score_codex":0.00037797325,"about_ca_system_score_gemma":0.0006874465,"threshold_uncertainty_score":0.008594453},"labels":[],"label_agreement":null},{"id":"W4400995520","doi":"10.1007/978-3-031-65633-0_3","title":"Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Automaton; Theoretical computer science; Tree (set theory); Programming language; Constraint (computer-aided design); Algorithm; Mathematics","score_opus":0.02602210189523775,"score_gpt":0.24124915025361596,"score_spread":0.2152270483583782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400995520","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.013594942,0.00009200289,0.98160166,0.000049316615,0.000026812415,0.000055022378,0.00006315154,0.0011371041,0.0033799545],"genre_scores_gemma":[0.27527034,0.00019697484,0.72053134,0.00006453025,0.000019129357,0.00019431535,0.00026215392,0.00037981695,0.0030814256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906784,0.0002574319,0.00008598911,0.0001958648,0.00032897358,0.00006395539],"domain_scores_gemma":[0.99859124,0.0008775508,0.00009205394,0.00024143618,0.00016740964,0.000030353385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092228386,0.00039976588,0.00037182882,0.00047078962,0.00038271217,0.00089787005,0.00095345906,0.0005029167,0.003159154],"category_scores_gemma":[0.0025072335,0.00031218692,0.0009522221,0.0005092346,0.000957486,0.0012975945,0.00093281193,0.00073842047,0.00044500543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013978897,0.00009291232,0.0006863419,0.00037664312,0.00007486112,0.00053454237,0.00047951227,0.27153894,0.07650362,0.4725266,0.0017016934,0.17534457],"study_design_scores_gemma":[0.00004054775,0.00008837535,0.00011473381,0.00005124455,0.00006113117,0.00013020412,0.000055769913,0.8239384,0.059446212,0.09775118,0.018294085,0.000028010423],"about_ca_topic_score_codex":0.0015764965,"about_ca_topic_score_gemma":0.0021512061,"teacher_disagreement_score":0.003159154,"about_ca_system_score_codex":0.0006039635,"about_ca_system_score_gemma":0.0008498621,"threshold_uncertainty_score":0.01056844},"labels":[],"label_agreement":null},{"id":"W4400999406","doi":"10.1007/978-3-031-65285-1_12","title":"Territorial Dynamics and Community Resilience: Transient Housing in Post-earthquake in Al Haouz Rural Regions in Morocco","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Regional resilience and development","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Computer science; Transient (computer programming); Dynamics (music); Sociology; Programming language; Physics","score_opus":0.020228215793850788,"score_gpt":0.23709778990242197,"score_spread":0.2168695741085712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400999406","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.9958553,0.00079439965,0.000057358866,0.0008597249,0.000011222264,0.0000040914088,0.0003015162,0.0000024964434,0.002113831],"genre_scores_gemma":[0.9989925,0.00020119168,0.000023253519,0.000018089095,0.0000054361085,0.0000026240039,0.00006156791,6.525947e-7,0.00069460995],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998753,0.000021981356,0.0000035108071,0.000011220941,0.0000069978196,0.000080974045],"domain_scores_gemma":[0.99985385,0.000025326399,0.000050235587,0.000003928782,0.000021067424,0.00004564568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001381002,0.0001171365,0.00012508535,0.0005624166,0.0008717182,0.0008192561,0.0005867237,0.000349331,0.0025760822],"category_scores_gemma":[0.0003955946,0.00008536319,0.00014599574,0.0011615361,0.0006833773,0.0004938452,0.0010413602,0.00021909292,0.00014233601],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017397254,0.000094843585,0.89679897,0.00021826498,0.00010063478,0.003941005,0.035829347,0.0033867436,0.0012457108,0.0120579405,0.006262474,0.039890077],"study_design_scores_gemma":[0.0000023227744,0.000033719953,0.9453498,0.000053665965,0.000015779677,0.00020197233,0.04851531,0.0007880536,0.00006945971,0.00050632906,0.004455402,0.000008163358],"about_ca_topic_score_codex":0.23620819,"about_ca_topic_score_gemma":0.49024102,"teacher_disagreement_score":0.23620819,"about_ca_system_score_codex":0.0031513732,"about_ca_system_score_gemma":0.0013004198,"threshold_uncertainty_score":0.46966666},"labels":[],"label_agreement":null},{"id":"W4401028347","doi":"10.1007/978-3-031-66535-6_33","title":"Manually-Curated Versus LLM-Generated Explanations for Complex Patient Cases: An Exploratory Study with Physicians","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical practice guidelines implementation","field":"Medicine","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 Ottawa; Ottawa Hospital","funders":"","keywords":"Computer science; Exploratory research; Information retrieval; World Wide Web; Data science","score_opus":0.2282105092543523,"score_gpt":0.4355079741253901,"score_spread":0.2072974648710378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401028347","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.98972696,0.00040294736,0.0043299985,0.00044010702,0.000027644333,0.0004371696,0.00047716318,0.0002712414,0.0038867232],"genre_scores_gemma":[0.9758386,0.0004461674,0.018329665,0.00044310585,0.000037393067,0.00054167275,0.000862068,0.00020748138,0.0032939685],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.98550224,0.010851602,0.000665894,0.0010796752,0.0015734775,0.00032712796],"domain_scores_gemma":[0.6934864,0.2865438,0.00694147,0.0040263687,0.007189695,0.0018122062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014056064,0.00047888415,0.0006149925,0.0012411092,0.0013008985,0.0025637152,0.0018086787,0.0016511006,0.0055135004],"category_scores_gemma":[0.15678266,0.0004404788,0.0005103963,0.0010109156,0.00079989946,0.0021335455,0.0024892136,0.001474664,0.0014800809],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044272053,0.009314213,0.13714074,0.004462501,0.00032160536,0.0044652657,0.40990654,0.0051897,0.00933052,0.0015481862,0.015655315,0.39823827],"study_design_scores_gemma":[0.0024119166,0.020634364,0.41699514,0.0049317633,0.001376727,0.012716328,0.32845488,0.07359892,0.025318263,0.006559171,0.106231704,0.0007707651],"about_ca_topic_score_codex":0.0030365803,"about_ca_topic_score_gemma":0.0041997223,"teacher_disagreement_score":0.014056064,"about_ca_system_score_codex":0.0014780817,"about_ca_system_score_gemma":0.0017496411,"threshold_uncertainty_score":0.07433653},"labels":[],"label_agreement":null},{"id":"W4401028442","doi":"10.1007/978-3-031-66535-6","title":"Artificial Intelligence in Medicine","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Univerza v Mariboru; Univerza v Ljubljani; Libera Università di Bolzano; Trakya Üniversitesi; Università degli Studi di Verona; Nazarbayev University; Universidade do Porto; Università di Pisa; Syddansk Universitet; Université de Bordeaux; Universidade de Coimbra; Université de Lille; Uniwersytet Łódzki; Università degli Studi di Pavia; Ben-Gurion University of the Negev; Universidad Politécnica de Madrid; Taipei Medical University; Universidad de Murcia; Politechnika Warszawska; Università degli Studi di Padova; University of Pittsburgh; Konkuk University; Università di Bologna; Politechnika Poznańska; Universitat Jaume I; Qatar University; University of St Andrews; Pusan National University; Gachon University; Université Paris-Saclay; Thompson Rivers University; University of Twente; University of Texas Health Science Center at Houston; Kungliga Tekniska Högskolan; Universidade da Coruña; Vrije Universiteit Amsterdam; Harvard University; Institut \"Jožef Stefan\"; Duke-NUS Medical School; Technion-Israel Institute of Technology; İstanbul Medipol Üniversitesi; Dalhousie University; University of Minnesota; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Western Washington University; University of Haifa; Universitat de Girona; Yonsei University; Universidade de São Paulo; University of Cincinnati; Bharathiar University; Case Western Reserve University; Stockholms Universitet; Brigham and Women's Hospital; Universität Wien; Emory University; Soongsil University; Ohio State University; University of Central Arkansas; Florida State University; Purdue University; George Mason University; Universitat Politècnica de Catalunya; University of Pennsylvania; Medizinische Universität Wien; Vanderbilt University","keywords":"Computer science; Artificial intelligence","score_opus":0.03465206292027404,"score_gpt":0.33312411635591,"score_spread":0.29847205343563593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401028442","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048380202,0.22066571,0.015081883,0.017585032,0.014288991,0.000099624376,0.00022390937,0.0003898104,0.7311812],"genre_scores_gemma":[0.005537199,0.09103203,0.0070615546,0.0076667736,0.007961079,0.00013357503,0.00024133375,0.00021564052,0.88015085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995072,0.00011006715,0.000019658422,0.000059523223,0.0002754823,0.000028076345],"domain_scores_gemma":[0.9993311,0.00029981715,0.000039347335,0.000091831884,0.0001242862,0.00011372647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093113375,0.0013927673,0.0011836117,0.0023435114,0.00086327374,0.0034927772,0.00069741905,0.0015017099,0.06844119],"category_scores_gemma":[0.0017204916,0.00052167533,0.0004273458,0.0019667007,0.0019275161,0.0035004318,0.0023093477,0.003920346,0.049180422],"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.000017632183,0.00003915357,0.00009751909,0.00038986272,0.000018353305,0.000040672443,0.00020304846,0.00036776342,0.00046587558,0.083581775,0.6501919,0.26458648],"study_design_scores_gemma":[0.0000056507624,0.000016675142,0.00025292218,0.00034583802,0.0000068707463,0.000110397676,0.00004721229,0.00024098817,0.000092089445,0.04084074,0.95803565,0.000005012308],"about_ca_topic_score_codex":0.0008187149,"about_ca_topic_score_gemma":0.0028462477,"teacher_disagreement_score":0.06844119,"about_ca_system_score_codex":0.0011567345,"about_ca_system_score_gemma":0.001384198,"threshold_uncertainty_score":0.22895855},"labels":[],"label_agreement":null},{"id":"W4401028888","doi":"10.1007/978-3-031-66535-6_8","title":"Harnessing the Power of Graph Propagation in Lung Nodule Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Lung Cancer Diagnosis and Treatment","field":"Medicine","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 Windsor","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Theoretical computer science","score_opus":0.010735491538151933,"score_gpt":0.2633943922675245,"score_spread":0.2526589007293725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401028888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018318461,0.0019104049,0.9704198,0.0006331794,0.00021597317,0.000038824204,0.00021782862,0.0022785277,0.005967053],"genre_scores_gemma":[0.404202,0.0042210966,0.5733366,0.00058655336,0.00048223772,0.00007673889,0.0008761455,0.0011781986,0.01504046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964166,0.0000913012,0.000011818526,0.00008366268,0.00013458524,0.00003704389],"domain_scores_gemma":[0.9967104,0.002595142,0.00010981707,0.00025168277,0.0002638445,0.000069024565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070040737,0.0012657022,0.00073231244,0.0016274902,0.00040584375,0.0011376186,0.0012084449,0.001073719,0.0033189117],"category_scores_gemma":[0.0037281462,0.00060757773,0.000718385,0.0012856245,0.00074260234,0.00216286,0.0012237885,0.0015598603,0.0015640612],"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.0002411924,0.00013388472,0.0015618659,0.00032986543,0.00013739563,0.00016612464,0.0001287871,0.2050348,0.054858718,0.02064187,0.00994132,0.7068241],"study_design_scores_gemma":[0.0000119387,0.00007171928,0.00056086294,0.00002498437,0.00004778801,0.00015248386,0.00002340484,0.94135964,0.010978437,0.043255236,0.0034938776,0.000019716692],"about_ca_topic_score_codex":0.003076472,"about_ca_topic_score_gemma":0.005808763,"teacher_disagreement_score":0.0033189117,"about_ca_system_score_codex":0.00037990228,"about_ca_system_score_gemma":0.00047199544,"threshold_uncertainty_score":0.011102855},"labels":[],"label_agreement":null},{"id":"W4401032320","doi":"10.1007/978-3-031-66064-1_3","title":"Pierce: A Testing Tool for Neural Network Verification Solvers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Artificial neural network; Programming language; Software engineering; Artificial intelligence","score_opus":0.025490686614710076,"score_gpt":0.2695432457109795,"score_spread":0.2440525590962694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401032320","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028352276,0.00017168609,0.895996,0.00031430056,0.00013650596,0.00014285116,0.0012289434,0.09087916,0.008295359],"genre_scores_gemma":[0.17746659,0.00052254694,0.7508534,0.0010632022,0.00018412237,0.0010233861,0.0076083923,0.04254099,0.018737296],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960443,0.0011832407,0.00036845377,0.0005909805,0.0015151842,0.00029785428],"domain_scores_gemma":[0.98725617,0.008760191,0.0004589291,0.0022940526,0.001070015,0.00016068284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004050108,0.0027362849,0.0011168852,0.0023035684,0.00068181084,0.002186758,0.005116879,0.0019664248,0.067558825],"category_scores_gemma":[0.022551551,0.0018177701,0.0021449681,0.0011769,0.0016645066,0.005795258,0.0045973863,0.0037001919,0.01487504],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094302645,0.00038072636,0.002489688,0.001610617,0.0003368672,0.0008972936,0.0002802115,0.08901452,0.018048663,0.1422149,0.20502292,0.5387604],"study_design_scores_gemma":[0.00035865992,0.00023748039,0.00047759886,0.00027291354,0.00009899556,0.0007485077,0.000087093744,0.69327104,0.059822097,0.15775663,0.086763754,0.00010524184],"about_ca_topic_score_codex":0.0014370797,"about_ca_topic_score_gemma":0.0021684046,"teacher_disagreement_score":0.067558825,"about_ca_system_score_codex":0.00083137886,"about_ca_system_score_gemma":0.0016414204,"threshold_uncertainty_score":0.2260068},"labels":[],"label_agreement":null},{"id":"W4401033940","doi":"10.1007/978-3-031-66159-4_12","title":"Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Computer science; Programming language; Algorithm; Theoretical computer science","score_opus":0.013464643293944919,"score_gpt":0.25891717032706923,"score_spread":0.2454525270331243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401033940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015503368,0.00102563,0.94489676,0.00315598,0.00036466916,0.00015448678,0.00039556006,0.002368289,0.032135233],"genre_scores_gemma":[0.4196459,0.0027950383,0.5392297,0.0027303158,0.0015064677,0.0012216477,0.0025433877,0.002417275,0.027910251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189913,0.0026042485,0.0005606541,0.0017231829,0.0022743118,0.0009384239],"domain_scores_gemma":[0.9483032,0.0442338,0.0007703457,0.004888746,0.0012107283,0.00059319666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082256505,0.0023165538,0.002076224,0.0023185993,0.003480605,0.0070719705,0.009576733,0.0038916108,0.014053251],"category_scores_gemma":[0.031299576,0.0032820124,0.0073567834,0.0031669468,0.008821367,0.02564188,0.012703483,0.025963929,0.0026406166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015860738,0.00016890238,0.00033052612,0.00041769427,0.000072912546,0.00025359503,0.00084166403,0.006161879,0.0056453273,0.94757235,0.0065102773,0.031866305],"study_design_scores_gemma":[0.000040313585,0.000020380541,0.000084232284,0.0000361571,0.000044198267,0.00010294473,0.00006913715,0.017068285,0.0035776335,0.97446805,0.0044630095,0.000025659549],"about_ca_topic_score_codex":0.0017901848,"about_ca_topic_score_gemma":0.0019213677,"teacher_disagreement_score":0.014053251,"about_ca_system_score_codex":0.0030874251,"about_ca_system_score_gemma":0.002089627,"threshold_uncertainty_score":0.047012806},"labels":[],"label_agreement":null},{"id":"W4401033946","doi":"10.1007/978-3-031-66159-4_6","title":"Universal Rewriting Rules for the Parikh Matrix Injectivity Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Rewriting; Computer science; Matrix (chemical analysis); Programming language; Theoretical computer science; Algorithm","score_opus":0.01327607138326478,"score_gpt":0.24817184624092264,"score_spread":0.23489577485765786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401033946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055529434,0.002270227,0.78069633,0.0034951407,0.0008084931,0.00013659243,0.0004468552,0.0010327011,0.15558426],"genre_scores_gemma":[0.81047976,0.001585318,0.14906912,0.0011438956,0.0011889404,0.00036368202,0.00081037875,0.0008361404,0.034522817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833715,0.00045661145,0.00013695528,0.0003665257,0.00047834107,0.00022441684],"domain_scores_gemma":[0.99629384,0.0026120362,0.00012727972,0.0005215491,0.00032311145,0.00012201445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018752713,0.0006038023,0.00091973506,0.0010788143,0.0014344055,0.0034991247,0.0014793229,0.0014702945,0.008184434],"category_scores_gemma":[0.005530429,0.0006604154,0.0013716473,0.0013179535,0.0030844104,0.007298697,0.002464349,0.0050282106,0.0019580193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017376498,0.000020687163,0.00005473406,0.00004454093,0.000006535337,0.00005263573,0.00019680778,0.00089070486,0.0007783932,0.9867018,0.001423512,0.00981229],"study_design_scores_gemma":[0.000006288598,0.0000040008954,0.00002248263,0.000008406051,0.0000051704974,0.000030575036,0.000021032722,0.003006828,0.0006813273,0.99389136,0.0023163327,0.0000061645956],"about_ca_topic_score_codex":0.0004992349,"about_ca_topic_score_gemma":0.00048287646,"teacher_disagreement_score":0.008184434,"about_ca_system_score_codex":0.0013630528,"about_ca_system_score_gemma":0.0006940346,"threshold_uncertainty_score":0.027379632},"labels":[],"label_agreement":null},{"id":"W4401034109","doi":"10.1007/978-3-031-66159-4_10","title":"How to Find Long Maximal Exact Matches and Ignore Short Ones","year":2024,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Human Genome Research Institute; Università degli Studi di Milano-Bicocca","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.01619052697209217,"score_gpt":0.2570697544311087,"score_spread":0.24087922745901652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401034109","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.12942442,0.0030688324,0.8345103,0.0035824163,0.0013750725,0.00089113956,0.003534364,0.011699308,0.011914115],"genre_scores_gemma":[0.13431987,0.000816752,0.84373254,0.0007385252,0.0003768618,0.00020696764,0.004615972,0.002134835,0.013057699],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996167,0.0003255846,0.00037037404,0.0010365704,0.0015867961,0.0005136958],"domain_scores_gemma":[0.9914675,0.003061833,0.0005018006,0.0021147034,0.0023038941,0.0005501867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024097369,0.0013729942,0.0029788099,0.0044107665,0.0021123285,0.0037674445,0.0029443437,0.0025995085,0.016074063],"category_scores_gemma":[0.016789975,0.0012671236,0.0017701463,0.004360419,0.0011932645,0.009182259,0.003527147,0.0023680665,0.0097458875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014303376,0.00042866566,0.008025685,0.0007797939,0.00026425297,0.00044516058,0.0002795887,0.011251522,0.026018212,0.0126680285,0.04226068,0.896148],"study_design_scores_gemma":[0.0005321234,0.000741058,0.006550313,0.00044791,0.00081826455,0.0038938334,0.0023634925,0.49514273,0.13400231,0.2569482,0.098246105,0.0003136356],"about_ca_topic_score_codex":0.003657203,"about_ca_topic_score_gemma":0.007776981,"teacher_disagreement_score":0.016074063,"about_ca_system_score_codex":0.00075500546,"about_ca_system_score_gemma":0.0037587956,"threshold_uncertainty_score":0.053773105},"labels":[],"label_agreement":null},{"id":"W4401075221","doi":"10.1007/978-3-031-65154-0_14","title":"Integration of PBFT and Raft Algorithms with Recurrent Neural Networks to Improve the Reliability of Distributed Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","field":"Engineering","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":"Lachine Hospital","funders":"","keywords":"Computer science; Raft; Reliability (semiconductor); Distributed algorithm; Artificial neural network; Distributed computing; Consensus algorithm; Algorithm; Artificial intelligence","score_opus":0.006435596482738591,"score_gpt":0.20925404589528412,"score_spread":0.20281844941254554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401075221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034023944,0.0007466674,0.9614435,0.00017966887,0.00010688731,0.00002453384,0.000041765084,0.0012820784,0.0021509158],"genre_scores_gemma":[0.68047965,0.00038646045,0.31443346,0.000101417834,0.00011565724,0.00006615989,0.00018202502,0.00024026868,0.0039948793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981123,0.000051791216,0.0000121032235,0.000039751456,0.000059941623,0.000025085015],"domain_scores_gemma":[0.9992112,0.00039973258,0.00005546462,0.00009210274,0.00021660324,0.000024846582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082882866,0.0006517212,0.0008338587,0.00042269722,0.00031492187,0.0005969899,0.0010310782,0.0007921635,0.0021589827],"category_scores_gemma":[0.0027949084,0.00029199242,0.00042027442,0.00044846904,0.0003362694,0.0014388545,0.0006989844,0.0012013105,0.0004721813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001298661,0.00007544893,0.00038028756,0.000060777165,0.000051269682,0.0000419054,0.000039448558,0.69809616,0.0033502937,0.0051758653,0.0020880213,0.29051077],"study_design_scores_gemma":[0.000003685628,0.000018450457,0.000042274132,0.0000022825564,0.0000048132224,0.0000061267797,0.0000017191625,0.99815804,0.0004971192,0.0011165896,0.00014719664,0.000001722144],"about_ca_topic_score_codex":0.0045895963,"about_ca_topic_score_gemma":0.0065332986,"teacher_disagreement_score":0.0045895963,"about_ca_system_score_codex":0.00045851522,"about_ca_system_score_gemma":0.0006035842,"threshold_uncertainty_score":0.009125769},"labels":[],"label_agreement":null},{"id":"W4401077477","doi":"10.1007/978-981-97-5600-1_39","title":"Harmonizing Stable Diffusion and GPT-4 for Mural Expansion with ArtExtend","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mural; Computer science; Diffusion; Computer graphics (images); Art history; History; Thermodynamics; Physics","score_opus":0.020916618015842697,"score_gpt":0.22536291085428753,"score_spread":0.20444629283844484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401077477","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.013605032,0.00023649092,0.97028303,0.0002736113,0.0001614353,0.00006555364,0.000096042655,0.0017686492,0.0135101685],"genre_scores_gemma":[0.504071,0.00026813804,0.4576347,0.00038127962,0.00014626185,0.00023134272,0.00041979278,0.0013445826,0.035502944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995741,0.0001123189,0.000016165803,0.00009485444,0.0001376706,0.00006490001],"domain_scores_gemma":[0.99936587,0.00031775102,0.000028425748,0.00015639351,0.00009092172,0.000040582436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008894675,0.00069215073,0.00068054785,0.00051620905,0.0004521139,0.0008438331,0.0011318334,0.0013759335,0.009405017],"category_scores_gemma":[0.0036564786,0.0002908638,0.00065456185,0.0003597627,0.001067713,0.0011737042,0.002679489,0.0015955832,0.002193255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030206973,0.000121980636,0.00034792957,0.00015462827,0.0000630297,0.00018841884,0.00020662998,0.42231685,0.016979897,0.22486883,0.013111245,0.32133853],"study_design_scores_gemma":[0.00001813896,0.00003567894,0.00004617255,0.000013950729,0.000009069658,0.000048144775,0.000017175931,0.94716996,0.0039892476,0.044405777,0.0042371363,0.000009582647],"about_ca_topic_score_codex":0.0013439839,"about_ca_topic_score_gemma":0.002751996,"teacher_disagreement_score":0.009405017,"about_ca_system_score_codex":0.00048076766,"about_ca_system_score_gemma":0.0006101397,"threshold_uncertainty_score":0.031462908},"labels":[],"label_agreement":null},{"id":"W4401084683","doi":"10.1007/978-3-031-66326-0_9","title":"Declarative Representation of UML State Machines for Querying and Simulation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Unified Modeling Language; Programming language; Finite-state machine; Representation (politics); Applications of UML; State (computer science); Abstract state machines; Theoretical computer science; Software engineering; Software","score_opus":0.025121335198872947,"score_gpt":0.3006093016593292,"score_spread":0.27548796646045626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401084683","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.0022152415,0.00011938536,0.982117,0.00017674174,0.000046979476,0.00011284771,0.0010179372,0.009723222,0.004470577],"genre_scores_gemma":[0.106521554,0.0005103525,0.8753172,0.0002961357,0.000055990695,0.0005317977,0.0062723234,0.0023887767,0.008105827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985373,0.00042159267,0.000221555,0.00016569319,0.0005478273,0.000106080755],"domain_scores_gemma":[0.99781054,0.0010526231,0.00014969397,0.0005601612,0.00036943165,0.000057643294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020739054,0.0008981156,0.00066662254,0.0014007745,0.0005353221,0.0048641455,0.0023483771,0.0013758189,0.0084412275],"category_scores_gemma":[0.0051765544,0.0010268722,0.0011281269,0.0010762336,0.0008028085,0.0029056119,0.0015941095,0.0020094784,0.003292166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003100816,0.00023381578,0.000985465,0.0006898497,0.00007500182,0.00043653598,0.0015888126,0.071980886,0.0242575,0.6849293,0.029631505,0.18488121],"study_design_scores_gemma":[0.00010087665,0.00007748036,0.0003667808,0.0003272811,0.00009046493,0.0003863212,0.0002139389,0.5520089,0.04515681,0.20107709,0.20011526,0.000078758916],"about_ca_topic_score_codex":0.002960131,"about_ca_topic_score_gemma":0.0048789997,"teacher_disagreement_score":0.0084412275,"about_ca_system_score_codex":0.0010506115,"about_ca_system_score_gemma":0.0015092511,"threshold_uncertainty_score":0.028238773},"labels":[],"label_agreement":null},{"id":"W4401093862","doi":"10.1007/978-981-97-5606-3_3","title":"Network Traffic Intrusion Detection Strategy Based on E-GraphSAGE and LSTM","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Intrusion detection system; Intrusion prevention system; Intrusion; Computer security; Artificial intelligence","score_opus":0.011457171235556673,"score_gpt":0.21868873406407136,"score_spread":0.20723156282851468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401093862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13142197,0.0011888387,0.8544438,0.0005014971,0.0003521212,0.00011754608,0.00016992366,0.0032592951,0.00854497],"genre_scores_gemma":[0.881779,0.0005151276,0.11250435,0.00028858476,0.0001652793,0.00007008111,0.00024109446,0.00005767601,0.0043788645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996991,0.000034609282,0.000021513997,0.000110097106,0.00007427446,0.000060435057],"domain_scores_gemma":[0.9997708,0.00006800363,0.000022707045,0.000020169253,0.00009463002,0.000023640703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003652018,0.0007101592,0.0008349379,0.00089757884,0.00042412445,0.0007382115,0.0007979855,0.0007395285,0.0013717285],"category_scores_gemma":[0.0007998043,0.0002042744,0.00043999706,0.0006316412,0.0002831592,0.0014882357,0.00060080574,0.00066764845,0.00036062478],"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.00061411335,0.00045209628,0.0041611763,0.000120573495,0.00011045995,0.00031805353,0.00008077246,0.096111014,0.062432665,0.0044589695,0.0048771366,0.826263],"study_design_scores_gemma":[0.00001111602,0.00011093109,0.001056858,0.0000061441087,0.000040433148,0.000110135334,0.000018881956,0.98647237,0.010187015,0.0013295135,0.0006447137,0.000011886735],"about_ca_topic_score_codex":0.0027694798,"about_ca_topic_score_gemma":0.0029496748,"teacher_disagreement_score":0.0027694798,"about_ca_system_score_codex":0.00042339208,"about_ca_system_score_gemma":0.00066588155,"threshold_uncertainty_score":0.0055066943},"labels":[],"label_agreement":null},{"id":"W4401119796","doi":"10.1007/978-981-97-5612-4_16","title":"IOCSegFormer: Enhancing Wheat Ears Counting in Field Conditions Through Augmented Local Features","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Food Supply Chain Traceability","field":"Agricultural and Biological Sciences","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":"Ministry of Agriculture","funders":"","keywords":"Computer science; Field (mathematics); Artificial intelligence; Computer graphics (images); Computer vision; Mathematics","score_opus":0.012289453648853484,"score_gpt":0.24050349395298026,"score_spread":0.2282140403041268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401119796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04418858,0.0007448532,0.9058496,0.00015447919,0.00051581266,0.00009965066,0.00229959,0.031213531,0.014933943],"genre_scores_gemma":[0.26474515,0.0005267508,0.6849448,0.00030018683,0.00013074848,0.00013853057,0.006027683,0.0029732177,0.04021291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997391,0.000028745399,0.0000071970285,0.000073154944,0.0001215698,0.000030231982],"domain_scores_gemma":[0.99969435,0.00007208627,0.00001828,0.00007174671,0.00011869669,0.000024974268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029723835,0.0010153281,0.00061134,0.0006628841,0.0001939034,0.00076476985,0.0011693109,0.0008083462,0.015207761],"category_scores_gemma":[0.00056913303,0.0003335429,0.0004209898,0.00078266574,0.00019450892,0.00090932107,0.00090949563,0.0004917962,0.0066435602],"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.0006155382,0.0001377736,0.0009914985,0.00017676821,0.000049740745,0.00012986426,0.00008338957,0.008566028,0.22177935,0.0006212899,0.026346816,0.74050206],"study_design_scores_gemma":[0.00015798218,0.00059929834,0.013719084,0.000075403565,0.00020734507,0.00093632605,0.000221219,0.6021601,0.28236747,0.0025020172,0.096897714,0.00015602166],"about_ca_topic_score_codex":0.003963503,"about_ca_topic_score_gemma":0.009293438,"teacher_disagreement_score":0.015207761,"about_ca_system_score_codex":0.00023090793,"about_ca_system_score_gemma":0.00033058578,"threshold_uncertainty_score":0.050875068},"labels":[],"label_agreement":null},{"id":"W4401159343","doi":"10.1007/978-981-96-0944-4_11","title":"On the Semidirect Discrete Logarithm Problem in Finite Groups","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Wilfrid Laurier University; University of Ottawa; University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Computer science; Algebra over a field; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012888119266516262,"score_gpt":0.22533632136950263,"score_spread":0.21244820210298637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401159343","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.13232404,0.02178829,0.1958088,0.033595838,0.004561644,0.000113641356,0.00060322566,0.00041658487,0.6107879],"genre_scores_gemma":[0.84557235,0.014208929,0.03164005,0.0029808185,0.0064452463,0.0001897502,0.0007419561,0.0002668552,0.097954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988788,0.00042195973,0.000054101103,0.00013483234,0.00037489663,0.00013550214],"domain_scores_gemma":[0.9976174,0.0017629407,0.00011209667,0.00024779962,0.00012078009,0.00013885724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669118,0.0009168337,0.0014839486,0.001393925,0.0017985567,0.003956948,0.00126444,0.0017001607,0.00844417],"category_scores_gemma":[0.0048631737,0.00055428204,0.000837779,0.002651547,0.0056896852,0.011670988,0.0037570356,0.00623597,0.0016813187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042149277,0.00003054723,0.00007244338,0.000067084344,0.000005407459,0.000054833217,0.00016378982,0.0009871856,0.00020220985,0.98341745,0.004999757,0.009957005],"study_design_scores_gemma":[0.000008622589,0.000007135218,0.000034489665,0.000016909506,0.00000168046,0.00005203296,0.00003220617,0.0010630237,0.00009503141,0.9951462,0.0035380642,0.000004610623],"about_ca_topic_score_codex":0.0005129143,"about_ca_topic_score_gemma":0.00040554383,"teacher_disagreement_score":0.00844417,"about_ca_system_score_codex":0.0021029105,"about_ca_system_score_gemma":0.001079051,"threshold_uncertainty_score":0.028248549},"labels":[],"label_agreement":null},{"id":"W4401209461","doi":"10.1007/978-3-031-67751-9_13","title":"RF-Lung-DR: Integrating Biological and Drug SMILES Features in a Random Forest-Based Drug Response Predictor for Lung Cancer Cell Lines","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Drug; Drug response; Random forest; Computer science; Lung cancer; Oncology; Artificial intelligence; Medicine; Pharmacology","score_opus":0.016028569168083862,"score_gpt":0.3053678572216946,"score_spread":0.28933928805361075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401209461","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.113429524,0.0066038487,0.751977,0.0009306221,0.00049179624,0.0003768022,0.020419365,0.09844821,0.007322919],"genre_scores_gemma":[0.35107055,0.0018789774,0.5935324,0.0006649728,0.00032515582,0.0005176883,0.034961596,0.003008146,0.014040599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.00007705569,0.00002087317,0.00009326406,0.00012135122,0.000047468737],"domain_scores_gemma":[0.9995956,0.00023493057,0.000031305055,0.000039154726,0.00007282503,0.000026186652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012955614,0.001205759,0.0009522648,0.0010172437,0.00026106808,0.00065549795,0.0011222285,0.0007701379,0.004622187],"category_scores_gemma":[0.0013878378,0.00037217277,0.0010520777,0.0007443073,0.00011836013,0.0006456714,0.0005279117,0.000930825,0.0041932105],"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.00069811416,0.00028779663,0.006568826,0.00028326185,0.00031481805,0.00011234501,0.00002960646,0.048573773,0.026242329,0.00071599666,0.05671067,0.85946244],"study_design_scores_gemma":[0.00020081189,0.00062657293,0.0072203125,0.000059319595,0.00026899678,0.00036272424,0.000028572238,0.9314749,0.03234365,0.0032412782,0.02409038,0.000082428436],"about_ca_topic_score_codex":0.0034914545,"about_ca_topic_score_gemma":0.0073056584,"teacher_disagreement_score":0.004622187,"about_ca_system_score_codex":0.0003086875,"about_ca_system_score_gemma":0.0005201036,"threshold_uncertainty_score":0.015462756},"labels":[],"label_agreement":null},{"id":"W4401209463","doi":"10.1007/978-3-031-67751-9_9","title":"SnapSeg: Training-Free Few-Shot Medical Image Segmentation with Segment Anything Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Shot (pellet); Artificial intelligence; Computer vision; Segmentation; Image segmentation; Training (meteorology); Image (mathematics); Computer graphics (images)","score_opus":0.028926196218898727,"score_gpt":0.2819824265583252,"score_spread":0.2530562303394265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401209463","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.004394741,0.0005788792,0.95060045,0.00018780289,0.000119899036,0.0001370143,0.0015610106,0.041328184,0.0010920253],"genre_scores_gemma":[0.049593013,0.0004228251,0.9325942,0.0004033925,0.000095847754,0.00028892548,0.0067698774,0.0043809544,0.005451078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996063,0.000044715896,0.000021204316,0.0001502597,0.00013632915,0.000041147094],"domain_scores_gemma":[0.9995074,0.00020721156,0.000026805797,0.00012891999,0.000085314095,0.00004435371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009147327,0.001858142,0.0016663792,0.0012735322,0.00051594636,0.001418566,0.0032215253,0.0025539256,0.012758791],"category_scores_gemma":[0.0024061254,0.0014205526,0.001649893,0.0010630818,0.00046890698,0.0012247406,0.0023213914,0.0019063144,0.0075801862],"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.0006997888,0.0001384407,0.00061628333,0.0003843564,0.0004157126,0.00031637662,0.0000959376,0.09042866,0.031545587,0.0032276297,0.057634156,0.81449705],"study_design_scores_gemma":[0.000059807826,0.000105732375,0.00050205895,0.000036445257,0.000063855594,0.0004060336,0.000028833432,0.95841175,0.021685567,0.0071665226,0.011490486,0.000043004977],"about_ca_topic_score_codex":0.008478029,"about_ca_topic_score_gemma":0.019336104,"teacher_disagreement_score":0.012758791,"about_ca_system_score_codex":0.00083360996,"about_ca_system_score_gemma":0.001488266,"threshold_uncertainty_score":0.04268241},"labels":[],"label_agreement":null},{"id":"W4401282669","doi":"10.1007/978-3-031-66997-2_17","title":"A Framework for Formal Probabilistic Risk Assessment Using HOL Theorem Proving","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis 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":"Concordia University","funders":"","keywords":"HOL; Computer science; Probabilistic logic; Automated theorem proving; Formal verification; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.03149742351460235,"score_gpt":0.3305850709995267,"score_spread":0.2990876474849244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401282669","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.0003081132,0.000121015524,0.9964336,0.00011655231,0.000030010544,0.000017798235,0.000029997609,0.00024197208,0.0027008462],"genre_scores_gemma":[0.07771298,0.0006672043,0.9149134,0.0002528622,0.00030623333,0.00021890101,0.00020272082,0.00035735,0.0053683436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645656,0.0012426501,0.0002765093,0.0004604361,0.0013219578,0.00024185146],"domain_scores_gemma":[0.99308676,0.0044306335,0.0003412653,0.0013385641,0.0006611961,0.00014155963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005647601,0.0016149883,0.0012625128,0.002686793,0.001243946,0.0043026083,0.00385085,0.0015456451,0.008595346],"category_scores_gemma":[0.010137223,0.0011861218,0.0027599484,0.0018914255,0.0045834067,0.006341824,0.0034230046,0.004774676,0.002318865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014709384,0.000026987183,0.000099286124,0.00012032369,0.00002539538,0.00009494598,0.000100569305,0.018499335,0.00080099376,0.9461734,0.0019060718,0.032137986],"study_design_scores_gemma":[0.000009750488,0.000014482354,0.000042061394,0.000052370717,0.000019465904,0.00007844565,0.000018417122,0.06080667,0.0008194503,0.9280769,0.0100442,0.000017731785],"about_ca_topic_score_codex":0.001527498,"about_ca_topic_score_gemma":0.0013312274,"teacher_disagreement_score":0.008595346,"about_ca_system_score_codex":0.0016659581,"about_ca_system_score_gemma":0.0016444456,"threshold_uncertainty_score":0.029867709},"labels":[],"label_agreement":null},{"id":"W4401282670","doi":"10.1007/978-3-031-66997-2_21","title":"HOL4PRS: Proof Recommendation System for the HOL4 Theorem Prover","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Concordia University","funders":"","keywords":"Automated theorem proving; Computer science; Gas meter prover; Proof theory; Calculus (dental); Theoretical computer science; Mathematics; Mathematical proof","score_opus":0.02423129806204132,"score_gpt":0.2551002190755893,"score_spread":0.23086892101354795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401282670","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.0012089877,0.00052645477,0.5295898,0.0005384394,0.0003390526,0.00027612102,0.018025396,0.42424643,0.025249345],"genre_scores_gemma":[0.034306433,0.0018175349,0.6235986,0.0014935388,0.00061057747,0.0008119075,0.08830233,0.14915049,0.099908635],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978289,0.0005121905,0.0002173646,0.00030804423,0.0009662064,0.00016733802],"domain_scores_gemma":[0.9953258,0.002091005,0.00024000538,0.0012261147,0.00094439404,0.00017266575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033621453,0.0017389405,0.001343021,0.004579117,0.00088500173,0.0029761528,0.004695739,0.0018074817,0.19565122],"category_scores_gemma":[0.0077738543,0.0018875252,0.0016250042,0.0032361355,0.0005793154,0.004855887,0.0027640723,0.0025959415,0.11229787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005284953,0.00010473547,0.00042309632,0.001067029,0.00010393091,0.00018753312,0.000097094955,0.0021393774,0.0069181705,0.028668463,0.6732349,0.28652722],"study_design_scores_gemma":[0.0005984547,0.00010178265,0.00073259475,0.00025084743,0.00010798674,0.00074913993,0.00006421488,0.047760487,0.034737438,0.06149738,0.8532328,0.00016676036],"about_ca_topic_score_codex":0.0020938483,"about_ca_topic_score_gemma":0.0028576073,"teacher_disagreement_score":0.19565122,"about_ca_system_score_codex":0.0012323386,"about_ca_system_score_gemma":0.0019889295,"threshold_uncertainty_score":0.6545185},"labels":[],"label_agreement":null},{"id":"W4401282765","doi":"10.1007/978-3-031-66997-2_3","title":"Using General Large Language Models to Classify Mathematical Documents","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Information retrieval; Programming language","score_opus":0.03733455946854739,"score_gpt":0.302462580135229,"score_spread":0.26512802066668156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401282765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06254454,0.0024223852,0.9202989,0.0018026662,0.00021489734,0.00022310206,0.003016696,0.003869499,0.005607408],"genre_scores_gemma":[0.59392536,0.0015848863,0.37651497,0.00085507496,0.00070293224,0.00049212005,0.013069261,0.0006613357,0.012194083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978592,0.0007954613,0.00024154465,0.00045664865,0.00049693557,0.00015006462],"domain_scores_gemma":[0.992382,0.0050353636,0.00056077354,0.0010542909,0.00072787754,0.00023969798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027233944,0.0009359033,0.00094387773,0.003926865,0.001111142,0.0045140954,0.0015889654,0.0013392257,0.0033109337],"category_scores_gemma":[0.009263982,0.00046535386,0.0019788747,0.0023563704,0.0011775964,0.007419915,0.0018144507,0.002529648,0.0026732462],"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.00085302675,0.00072708045,0.012236728,0.0008249302,0.00036275596,0.00053900946,0.0012196841,0.060691465,0.016300853,0.18672848,0.034666937,0.6848491],"study_design_scores_gemma":[0.000048725436,0.00013585316,0.0014806155,0.00009814839,0.00011905337,0.00031606562,0.00027600155,0.6789276,0.0041995584,0.30332434,0.0110182995,0.00005581542],"about_ca_topic_score_codex":0.0024964404,"about_ca_topic_score_gemma":0.003649302,"teacher_disagreement_score":0.0045140954,"about_ca_system_score_codex":0.0014969056,"about_ca_system_score_gemma":0.001394369,"threshold_uncertainty_score":0.014402866},"labels":[],"label_agreement":null},{"id":"W4401490254","doi":"10.1007/978-3-031-68279-7_14","title":"L-Fuzzy Weak Preference, Preference, and Choice Relations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision 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":"Brock University","funders":"","keywords":"Preference; Computer science; Fuzzy logic; Artificial intelligence; Statistics; Mathematics","score_opus":0.16235713176861188,"score_gpt":0.36834039253437545,"score_spread":0.20598326076576357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401490254","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.049017552,0.013866066,0.6393952,0.0073965257,0.00089387165,0.00009429212,0.0006319685,0.00018661242,0.28851795],"genre_scores_gemma":[0.7169368,0.007956181,0.19368736,0.0013943923,0.0011889132,0.00030901228,0.00055300305,0.000095613206,0.07787879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990061,0.00050520105,0.000065862274,0.000104921004,0.00026212985,0.000055875003],"domain_scores_gemma":[0.99849916,0.0010430906,0.00009074476,0.00011492871,0.00018211185,0.00007005153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016144663,0.0005748656,0.00047269627,0.0011114808,0.0008236588,0.0027078823,0.00049972004,0.0008848306,0.007591267],"category_scores_gemma":[0.0040278346,0.0002979011,0.00058942114,0.001924135,0.0025155402,0.004221056,0.0010336436,0.0023634331,0.001374025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002506268,0.000013133364,0.000100111996,0.000087922126,0.000007844757,0.000039315953,0.00021395754,0.0009967847,0.00090366136,0.9654434,0.0036176338,0.028551102],"study_design_scores_gemma":[0.0000049904625,0.0000148793015,0.000102019105,0.000023034287,0.000004178174,0.000064891334,0.00005114124,0.004167275,0.00019432668,0.9865427,0.008823521,0.0000070419032],"about_ca_topic_score_codex":0.00096368464,"about_ca_topic_score_gemma":0.0009121569,"teacher_disagreement_score":0.007591267,"about_ca_system_score_codex":0.0013105284,"about_ca_system_score_gemma":0.00060082524,"threshold_uncertainty_score":0.025395334},"labels":[],"label_agreement":null},{"id":"W4401506550","doi":"10.1007/978-981-97-5588-2_3","title":"CNN-SENet: A Convolutional Neural Network Model for Audio Snoring Detection Based on Channel Attention Mechanism","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Convolutional neural network; Channel (broadcasting); Mechanism (biology); Speech recognition; Artificial intelligence; Pattern recognition (psychology); Computer network","score_opus":0.02287353936705258,"score_gpt":0.23967756622048406,"score_spread":0.21680402685343148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401506550","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.039624628,0.0025716298,0.9093081,0.00033367038,0.0007634442,0.00025225358,0.006867234,0.030714206,0.009564878],"genre_scores_gemma":[0.3969367,0.0029754066,0.50957495,0.0008353855,0.00032118443,0.00038310236,0.023358267,0.002231866,0.06338317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984634,0.000012516332,0.0000060125876,0.000055695476,0.000044701686,0.0000347422],"domain_scores_gemma":[0.99986255,0.000027221553,0.000011555761,0.000025111365,0.00005913326,0.000014373685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000299905,0.0014913958,0.0008582498,0.00078736723,0.00033099073,0.0005983821,0.0018108693,0.00089283887,0.0062657953],"category_scores_gemma":[0.00059646263,0.0006529652,0.0010036678,0.00079701695,0.00022511651,0.0008904273,0.00087916176,0.0013489608,0.0028387348],"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.0006744143,0.00030212614,0.0025655434,0.00035197704,0.00042967818,0.00034123537,0.000037453916,0.13037486,0.0527147,0.0034935137,0.055163167,0.7535513],"study_design_scores_gemma":[0.0000209806,0.00009151059,0.0012174109,0.000025050214,0.00007578063,0.00014516416,0.000008965383,0.96563804,0.023105932,0.0018065127,0.007835172,0.000029564259],"about_ca_topic_score_codex":0.01869775,"about_ca_topic_score_gemma":0.03466081,"teacher_disagreement_score":0.01869775,"about_ca_system_score_codex":0.000652231,"about_ca_system_score_gemma":0.00093684456,"threshold_uncertainty_score":0.0371778},"labels":[],"label_agreement":null},{"id":"W4401542741","doi":"10.1007/978-981-97-5594-3_19","title":"DSDANet: Infrared Dim Small Target Detection via Attention Enhanced Feature Fusion Network","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrared Target Detection Methodologies","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Feature (linguistics); Infrared; Artificial intelligence; Fusion; Pattern recognition (psychology); Optics; Physics","score_opus":0.014717138112066139,"score_gpt":0.22537145642378598,"score_spread":0.21065431831171982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401542741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020359982,0.0013219143,0.96574855,0.00016956557,0.0004663109,0.00009482168,0.00070509623,0.0047807647,0.0063528786],"genre_scores_gemma":[0.35457715,0.0011898627,0.61063284,0.0005838039,0.00029346996,0.00022304554,0.0037578577,0.00034168872,0.028400304],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981993,0.000019736946,0.00000642757,0.000053781318,0.00007210964,0.00002803025],"domain_scores_gemma":[0.99987614,0.0000372284,0.0000087464805,0.000024549185,0.000042447904,0.000010936479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003440926,0.00068414334,0.0007174412,0.0005916373,0.00030650452,0.00053456874,0.0011867451,0.00055857253,0.0032550057],"category_scores_gemma":[0.00049701135,0.00021681718,0.00046223283,0.0006978894,0.00023570281,0.0008845979,0.0011691488,0.0007595157,0.0013392429],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003825549,0.0001732545,0.00070785923,0.00009901605,0.000110218665,0.00014625058,0.000040121642,0.03605245,0.042222623,0.00485706,0.02530008,0.88990855],"study_design_scores_gemma":[0.00002046749,0.00015308674,0.0009877814,0.000014341746,0.00004773466,0.00020553585,0.00002465601,0.9576373,0.024736715,0.0057296944,0.010421968,0.000020713871],"about_ca_topic_score_codex":0.0033453703,"about_ca_topic_score_gemma":0.0049661645,"teacher_disagreement_score":0.0033453703,"about_ca_system_score_codex":0.00038547686,"about_ca_system_score_gemma":0.00037121182,"threshold_uncertainty_score":0.010889113},"labels":[],"label_agreement":null},{"id":"W4401543053","doi":"10.1007/978-981-97-5594-3_2","title":"Hyperspectral Face Recognition via Existing 2D Face Recognition Methods","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Hyperspectral imaging; Facial recognition system; Computer science; Face (sociological concept); Three-dimensional face recognition; Artificial intelligence; Pattern recognition (psychology); Face Recognition Grand Challenge; Face detection; Computer vision; Speech recognition","score_opus":0.06131487703917009,"score_gpt":0.32125570511951734,"score_spread":0.25994082808034724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401543053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044015422,0.00044641143,0.9856775,0.00008282286,0.00012232442,0.00006971757,0.0002572886,0.0017817137,0.0071606534],"genre_scores_gemma":[0.049937513,0.0014702766,0.92599297,0.00024811263,0.00015211494,0.00018675071,0.0011434524,0.00032790212,0.020540923],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995933,0.000031324606,0.00001289925,0.00009409043,0.00023714891,0.00003128099],"domain_scores_gemma":[0.9997899,0.000042338965,0.000013112661,0.00007688291,0.00006950259,0.000008264287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027362382,0.00093410106,0.0007410043,0.0011972522,0.00033517275,0.001068176,0.0009926358,0.0007387745,0.0141294],"category_scores_gemma":[0.00048233932,0.00050008437,0.00092153414,0.0010163084,0.00031302113,0.0013523999,0.0009833295,0.0006751045,0.010631922],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005410879,0.00008260446,0.00033176108,0.0001408095,0.000048090118,0.00004350866,0.00002720844,0.006378153,0.10988938,0.0032603424,0.007145389,0.8725987],"study_design_scores_gemma":[0.000018974753,0.00015194727,0.0047593242,0.000082255625,0.00009366344,0.0014946464,0.000088172965,0.6878769,0.22804677,0.010858255,0.06643687,0.000092174225],"about_ca_topic_score_codex":0.0010836197,"about_ca_topic_score_gemma":0.0029185528,"teacher_disagreement_score":0.0141294,"about_ca_system_score_codex":0.0002214164,"about_ca_system_score_gemma":0.00033014454,"threshold_uncertainty_score":0.047267556},"labels":[],"label_agreement":null},{"id":"W4401543542","doi":"10.1007/978-981-97-5594-3_1","title":"Automatic Correction Method of Industrial Instrument Images Based on YOLOv8 Keypoint Detection and Perspective Transformation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Perspective (graphical); Computer science; Transformation (genetics); Computer vision; Artificial intelligence","score_opus":0.015156951466010867,"score_gpt":0.262003492982668,"score_spread":0.24684654151665714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401543542","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.042324625,0.0016780854,0.94811803,0.00010971258,0.00023509687,0.00007804131,0.00013787432,0.003384252,0.0039342213],"genre_scores_gemma":[0.3052025,0.002440707,0.67808557,0.00009746659,0.00012632039,0.00008804526,0.0007494974,0.00047555185,0.012734374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958664,0.000030581145,0.00001647677,0.00009960389,0.00022329297,0.00004345044],"domain_scores_gemma":[0.99970067,0.000046463796,0.0000287141,0.000040752937,0.00016899293,0.000014485137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002712684,0.0007726136,0.0006337497,0.0015455738,0.00038565198,0.00067582383,0.00083453034,0.0005385633,0.004358865],"category_scores_gemma":[0.0006328003,0.00042784325,0.00058446743,0.0009709848,0.0002537218,0.00078380574,0.00050172635,0.00062405376,0.0019014657],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028595774,0.00003283016,0.0014039754,0.00032869403,0.000049300128,0.0001418955,0.000114389586,0.0023013745,0.31905162,0.001900085,0.0032350984,0.67115486],"study_design_scores_gemma":[0.00011185949,0.0004741382,0.019243581,0.00010559602,0.0003689345,0.0024474836,0.00023377148,0.19064215,0.7274569,0.0020747688,0.05668254,0.00015827005],"about_ca_topic_score_codex":0.0015329169,"about_ca_topic_score_gemma":0.001886883,"teacher_disagreement_score":0.004358865,"about_ca_system_score_codex":0.00030744512,"about_ca_system_score_gemma":0.0007100651,"threshold_uncertainty_score":0.014581859},"labels":[],"label_agreement":null},{"id":"W4401558709","doi":"10.1007/978-981-96-2417-1_7","title":"Matching Knowledge Graphs for Cybersecurity Countermeasures Selection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","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":"Polytechnique Montréal","funders":"","keywords":"Selection (genetic algorithm); Computer science; Matching (statistics); Computer security; Artificial intelligence; Mathematics; Statistics","score_opus":0.013770929141943526,"score_gpt":0.25267999260978885,"score_spread":0.23890906346784532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401558709","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.02176039,0.0011554646,0.96193874,0.00071559893,0.0001353612,0.00034474075,0.0019822482,0.0021135702,0.009853957],"genre_scores_gemma":[0.4514447,0.0013554895,0.52758515,0.00047414214,0.0001757557,0.0002866371,0.005782261,0.00038487368,0.0125109805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859565,0.00035748325,0.00008124317,0.0003815044,0.00045975138,0.0001243647],"domain_scores_gemma":[0.99564964,0.0028172939,0.00025777542,0.0007099315,0.000439457,0.00012582348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012082406,0.0007504459,0.0012537899,0.0038776556,0.00081144134,0.0020765539,0.0024205844,0.0018939142,0.009138719],"category_scores_gemma":[0.0077126236,0.00052966323,0.0014536357,0.003690766,0.0007265959,0.004289373,0.0014993743,0.0014859501,0.0016504436],"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.00038230006,0.00035899147,0.0017321948,0.00050425436,0.00018815287,0.00020602607,0.00012457774,0.24543463,0.0041230586,0.11185355,0.020029224,0.615063],"study_design_scores_gemma":[0.000022285867,0.000063855536,0.00066969154,0.00006726291,0.00008109224,0.00012007732,0.00006219604,0.80413866,0.0023974413,0.18660247,0.0057539768,0.000020991474],"about_ca_topic_score_codex":0.006313479,"about_ca_topic_score_gemma":0.0057378234,"teacher_disagreement_score":0.009138719,"about_ca_system_score_codex":0.0018172538,"about_ca_system_score_gemma":0.0016028899,"threshold_uncertainty_score":0.030572116},"labels":[],"label_agreement":null},{"id":"W4401592835","doi":"10.1007/978-3-031-67285-9_5","title":"CVD_Net: Head and Neck Tumor Segmentation and Generalization in PET/CT Scans Across Data from Multiple Medical Centers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Computer science; Generalization; Head and neck; Segmentation; Artificial intelligence; Medical imaging; Computer vision; Medical physics; Medicine; Mathematics; Surgery","score_opus":0.02131529928321184,"score_gpt":0.3211768443246457,"score_spread":0.29986154504143386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401592835","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.02622307,0.0066647637,0.79123324,0.0020169488,0.0017560862,0.00030137564,0.037346203,0.10187267,0.03258569],"genre_scores_gemma":[0.09774412,0.003057832,0.7612179,0.0008290405,0.00054176437,0.00029083274,0.0535823,0.0058005573,0.07693572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958307,0.00002984714,0.00002407047,0.00017877501,0.0001511314,0.000033138906],"domain_scores_gemma":[0.9995932,0.00017261012,0.000017444861,0.00009315579,0.0000964103,0.000027305156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011558738,0.0012561136,0.0009665092,0.0009314061,0.00038063168,0.0012231068,0.00263158,0.0010800693,0.016159626],"category_scores_gemma":[0.0014357317,0.0010169457,0.0010058499,0.001252459,0.00037818518,0.0014144644,0.001154573,0.00116797,0.007595249],"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.00021975955,0.000052255997,0.0008911746,0.00027520553,0.000107233376,0.0001368904,0.00003638078,0.032606207,0.005344297,0.0036153735,0.20991956,0.7467958],"study_design_scores_gemma":[0.00011478336,0.00010877518,0.003778633,0.00012294052,0.00012748873,0.00071663427,0.00006531751,0.7853081,0.031114751,0.03380434,0.14466716,0.00007105798],"about_ca_topic_score_codex":0.011123545,"about_ca_topic_score_gemma":0.023094174,"teacher_disagreement_score":0.016159626,"about_ca_system_score_codex":0.0009880263,"about_ca_system_score_gemma":0.00097639963,"threshold_uncertainty_score":0.054059327},"labels":[],"label_agreement":null},{"id":"W4401598437","doi":"10.1007/978-3-031-68403-6","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"Institute of Software, Chinese Academy of Sciences; University of Illinois at Urbana-Champaign; Université de Versailles Saint-Quentin-en-Yvelines; Sorbonne Université; RWTH Aachen University; Université de Bordeaux; Technische Universität Darmstadt; Danmarks Tekniske Universitet; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Università di Catania; Tel Aviv University; Sapienza Università di Roma; Tartu Ülikool; Tsinghua University; Eidgenössische Technische Hochschule Zürich; National University of Singapore; Radboud Universiteit; Institut Polytechnique de Paris; University of Warwick; University of Wollongong; Xiamen University; York University; University of California, Irvine; Nanyang Technological University; University of Glasgow; Universität Passau; Jinan University; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; Oregon State University; New York University Shanghai; Indian Institute of Science; Academia Sinica; George Washington University; Georgia Institute of Technology; Télécom Paris; KU Leuven; Aarhus Universitet; Johns Hopkins University; Chinese Academy of Sciences; Purdue University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Computer security","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401598437","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401598533","doi":"10.1007/978-3-031-68400-5_12","title":"CDS Composition of Multi-round Protocols","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Composition (language)","score_opus":0.03271625657244092,"score_gpt":0.3067580909927956,"score_spread":0.2740418344203547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401598533","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.03515403,0.00045257495,0.89708275,0.00043595344,0.00029282126,0.00029384933,0.0003928754,0.0023714101,0.063523814],"genre_scores_gemma":[0.39151135,0.00065502117,0.51144147,0.00027125157,0.00018867658,0.00051891187,0.001047025,0.0012212079,0.093145095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00065589405,0.00016886837,0.0004483041,0.0007157866,0.00027935868],"domain_scores_gemma":[0.9960277,0.0017540219,0.00016158044,0.001289411,0.0004939229,0.00027332478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022761468,0.000694147,0.00095189194,0.0010236874,0.0017552768,0.0025233403,0.0014078893,0.00091947656,0.015854793],"category_scores_gemma":[0.005298916,0.00090019923,0.0008407507,0.0014048946,0.0012091502,0.0045204856,0.0038836258,0.002614169,0.003582363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005200178,0.000098117736,0.00031813773,0.00019865914,0.000028218965,0.00019650112,0.00039650314,0.010900817,0.01330729,0.87664455,0.0060815504,0.09130971],"study_design_scores_gemma":[0.00012982324,0.00009438971,0.00036044064,0.000101071935,0.00007286203,0.00032693695,0.00019562179,0.1488575,0.04278231,0.7410367,0.06599466,0.00004766266],"about_ca_topic_score_codex":0.0010424455,"about_ca_topic_score_gemma":0.0012883843,"teacher_disagreement_score":0.015854793,"about_ca_system_score_codex":0.0015751821,"about_ca_system_score_gemma":0.0014897585,"threshold_uncertainty_score":0.05303961},"labels":[],"label_agreement":null},{"id":"W4401599276","doi":"10.1007/978-3-031-68397-8","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"University of Illinois at Urbana-Champaign; Ben-Gurion University of the Negev; Ruhr-Universität Bochum; Technische Universität Darmstadt; Université de Bordeaux; Tsinghua University; Radboud Universiteit; Universität Passau; University of California, Irvine; Nanyang Technological University; Université de Versailles Saint-Quentin-en-Yvelines; KU Leuven; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; York University; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; New York University Shanghai; Tel Aviv University; Georgia Institute of Technology; Università di Catania; Johns Hopkins University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401599276","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401602366","doi":"10.1007/978-3-031-68376-3_3","title":"Aggregating Falcon Signatures with LaBRADOR","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"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":"Falcon; Computer science; Programming language","score_opus":0.00974100736351193,"score_gpt":0.22804665023501147,"score_spread":0.21830564287149953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401602366","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.068802975,0.0010943826,0.84823644,0.0015022104,0.0010492291,0.00042491,0.0011842215,0.028552294,0.04915338],"genre_scores_gemma":[0.6391509,0.00039758757,0.31640616,0.0010642532,0.00055539305,0.0003318153,0.0029805903,0.0021788713,0.036934353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912737,0.0021969106,0.0005559827,0.0012031208,0.0033283394,0.0014419485],"domain_scores_gemma":[0.98904735,0.0013100515,0.00044204417,0.007535915,0.0014707885,0.00019398723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036171027,0.0014000136,0.002652493,0.0023350604,0.0017928317,0.0043833246,0.0020140968,0.0016022582,0.014363388],"category_scores_gemma":[0.009170416,0.00081242004,0.0013795596,0.003262563,0.0015285537,0.0070138276,0.007369449,0.0017959954,0.008645048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025415188,0.000434338,0.0027711885,0.0003330109,0.00030975146,0.0004412039,0.00044668064,0.025528796,0.019775415,0.16234435,0.053219866,0.73185384],"study_design_scores_gemma":[0.00023544212,0.00056576636,0.0009858402,0.00014940284,0.00023582368,0.00095471804,0.0005010053,0.31063414,0.10456241,0.4874961,0.09348091,0.00019842348],"about_ca_topic_score_codex":0.000925862,"about_ca_topic_score_gemma":0.0016928586,"teacher_disagreement_score":0.014363388,"about_ca_system_score_codex":0.0015210487,"about_ca_system_score_gemma":0.0021502594,"threshold_uncertainty_score":0.048050284},"labels":[],"label_agreement":null},{"id":"W4401602406","doi":"10.1007/978-3-031-68376-3","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"Institute of Software, Chinese Academy of Sciences; University of Illinois at Urbana-Champaign; Université de Versailles Saint-Quentin-en-Yvelines; Sorbonne Université; RWTH Aachen University; Université de Bordeaux; Technische Universität Darmstadt; Danmarks Tekniske Universitet; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Università di Catania; Tel Aviv University; Sapienza Università di Roma; Tartu Ülikool; Tsinghua University; Eidgenössische Technische Hochschule Zürich; National University of Singapore; Radboud Universiteit; Institut Polytechnique de Paris; University of Warwick; University of Wollongong; Xiamen University; York University; University of California, Irvine; Nanyang Technological University; University of Glasgow; Universität Passau; Jinan University; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; Oregon State University; New York University Shanghai; Indian Institute of Science; Academia Sinica; George Washington University; Georgia Institute of Technology; Télécom Paris; KU Leuven; Aarhus Universitet; Johns Hopkins University; Chinese Academy of Sciences; Purdue University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401602406","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401604117","doi":"10.1007/978-3-031-68379-4","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; University of Illinois at Urbana-Champaign; Université de Versailles Saint-Quentin-en-Yvelines; Sorbonne Université; RWTH Aachen University; Université de Bordeaux; Technische Universität Darmstadt; Danmarks Tekniske Universitet; Ruhr-Universität Bochum; Ben-Gurion University of the Negev; Università di Catania; Tel Aviv University; Sapienza Università di Roma; Tartu Ülikool; Tsinghua University; Eidgenössische Technische Hochschule Zürich; National University of Singapore; Radboud Universiteit; Institut Polytechnique de Paris; University of Warwick; University of Wollongong; Xiamen University; York University; University of California, Irvine; Nanyang Technological University; University of Glasgow; Universität Passau; Jinan University; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; Oregon State University; New York University Shanghai; Indian Institute of Science; Academia Sinica; George Washington University; Georgia Institute of Technology; Télécom Paris; KU Leuven; Aarhus Universitet; Johns Hopkins University; Chinese Academy of Sciences; Purdue University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Computer security; Theoretical computer science","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401604117","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401616508","doi":"10.1007/978-3-031-68382-4","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Ben-Gurion University of the Negev; Ruhr-Universität Bochum; Technische Universität Darmstadt; Université de Bordeaux; Tsinghua University; Radboud Universiteit; Universität Passau; University of California, Irvine; Nanyang Technological University; Université de Versailles Saint-Quentin-en-Yvelines; KU Leuven; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; York University; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; New York University Shanghai; Tel Aviv University; Georgia Institute of Technology; Università di Catania; Johns Hopkins University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401616508","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401628819","doi":"10.1007/978-3-031-68391-6_3","title":"Quantum Lattice Enumeration in Limited Depth","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"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":"Zurich Information Security and Privacy Center; Fundação para a Ciência e a Tecnologia; NOVA Laboratory for Computer Science and Informatics; Agence Nationale de la Recherche; Government of Canada","keywords":"Enumeration; Computer science; Lattice (music); Quantum; Theoretical computer science; Discrete mathematics; Quantum mechanics; Physics; Mathematics","score_opus":0.016066985763121218,"score_gpt":0.24822265255740783,"score_spread":0.23215566679428662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401628819","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.060402833,0.0034177385,0.40322763,0.0043729465,0.00075826887,0.000116486415,0.0006940737,0.0009872663,0.52602285],"genre_scores_gemma":[0.63512844,0.0031739054,0.17271118,0.0010509107,0.0005565898,0.00031456084,0.00076208886,0.0007874433,0.18551497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934083,0.00018983206,0.000024209936,0.000052307474,0.00028469542,0.00010805346],"domain_scores_gemma":[0.99930954,0.00040240554,0.00003000877,0.00012372948,0.000070871036,0.00006339227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005628386,0.0005340671,0.0010693647,0.0010852593,0.0014253217,0.0023128276,0.0013164086,0.0009740866,0.017866202],"category_scores_gemma":[0.002211215,0.00060242676,0.00068287953,0.0018300907,0.0022175456,0.005003148,0.0026478008,0.0032759348,0.0030574126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017049228,0.0000122752745,0.000020956015,0.000044551707,0.000002687737,0.000012564314,0.000036795613,0.0021768003,0.0003764405,0.9847151,0.0027647172,0.009819949],"study_design_scores_gemma":[0.000006527411,0.0000038077171,0.000019332429,0.0000145969325,0.0000018694855,0.000019202444,0.000013781995,0.008488417,0.0003106856,0.98651785,0.0045988816,0.000005117461],"about_ca_topic_score_codex":0.0008812169,"about_ca_topic_score_gemma":0.001674279,"teacher_disagreement_score":0.017866202,"about_ca_system_score_codex":0.0015346959,"about_ca_system_score_gemma":0.0008439236,"threshold_uncertainty_score":0.05976838},"labels":[],"label_agreement":null},{"id":"W4401632038","doi":"10.1007/978-3-031-68391-6","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"University of Illinois at Urbana-Champaign; Ben-Gurion University of the Negev; Ruhr-Universität Bochum; Technische Universität Darmstadt; Université de Bordeaux; Tsinghua University; Radboud Universiteit; Universität Passau; University of California, Irvine; Nanyang Technological University; Université de Versailles Saint-Quentin-en-Yvelines; KU Leuven; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; York University; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; New York University Shanghai; Tel Aviv University; Georgia Institute of Technology; Università di Catania; Johns Hopkins University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security; Programming language","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401632038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401650676","doi":"10.1007/978-3-031-68385-5","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Ben-Gurion University of the Negev; Ruhr-Universität Bochum; Technische Universität Darmstadt; Université de Bordeaux; Tsinghua University; Radboud Universiteit; Universität Passau; University of California, Irvine; Nanyang Technological University; Université de Versailles Saint-Quentin-en-Yvelines; KU Leuven; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; York University; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; New York University Shanghai; Tel Aviv University; Georgia Institute of Technology; Università di Catania; Johns Hopkins University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Computer security","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401650676","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401655847","doi":"10.1007/978-3-031-68388-6","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Ben-Gurion University of the Negev; Ruhr-Universität Bochum; Technische Universität Darmstadt; Université de Bordeaux; Tsinghua University; Radboud Universiteit; Universität Passau; University of California, Irvine; Nanyang Technological University; Université de Versailles Saint-Quentin-en-Yvelines; KU Leuven; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; York University; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; New York University Shanghai; Tel Aviv University; Georgia Institute of Technology; Università di Catania; Johns Hopkins University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Theoretical computer science; Computer security; Programming language","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401655847","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401667022","doi":"10.1007/978-3-031-68394-7","title":"Advances in Cryptology – CRYPTO 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Ben-Gurion University of the Negev; Ruhr-Universität Bochum; Technische Universität Darmstadt; Université de Bordeaux; Tsinghua University; Radboud Universiteit; Universität Passau; University of California, Irvine; Nanyang Technological University; Université de Versailles Saint-Quentin-en-Yvelines; KU Leuven; Technische Universiteit Eindhoven; Brown University; Bergische Universität Wuppertal; York University; Eidgenössische Technische Hochschule Zürich; Indian Institute of Science; New York University Shanghai; Tel Aviv University; Georgia Institute of Technology; Università di Catania; Johns Hopkins University; University of Waterloo; Microsoft Research","keywords":"Computer science; Cryptography; Computer security; Theoretical computer science","score_opus":0.009168751873664244,"score_gpt":0.2636073660787002,"score_spread":0.254438614205036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401667022","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020051317,0.055088144,0.034867793,0.008144941,0.013949647,0.00011632574,0.00096604775,0.0014503457,0.8834116],"genre_scores_gemma":[0.018609384,0.031118548,0.016226375,0.0019901553,0.0056545218,0.000096772936,0.00142,0.00091434794,0.92396986],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.000069661946,0.00001981586,0.00007102364,0.00033472638,0.0000566069],"domain_scores_gemma":[0.9994727,0.00014364842,0.000038502094,0.000110994835,0.00015494134,0.00007929736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448384,0.0014344895,0.0006820003,0.0020614325,0.00082371105,0.0036454068,0.00069198816,0.0012416585,0.07948537],"category_scores_gemma":[0.0014795103,0.00052909,0.00035603024,0.002668836,0.001003688,0.0048325784,0.0013668154,0.0041015474,0.064115904],"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.000079695674,0.000056153338,0.00008693443,0.00029704152,0.0000150405685,0.000051877658,0.000032451673,0.00080581097,0.0018374731,0.10104204,0.5822665,0.31342888],"study_design_scores_gemma":[0.000017968818,0.0000358261,0.00019851494,0.00013715406,0.000006472298,0.00022646504,0.000012174578,0.0016210137,0.001305842,0.033999395,0.9624261,0.000013087624],"about_ca_topic_score_codex":0.0005921772,"about_ca_topic_score_gemma":0.0008192921,"teacher_disagreement_score":0.07948537,"about_ca_system_score_codex":0.0014064688,"about_ca_system_score_gemma":0.0011926919,"threshold_uncertainty_score":0.26590508},"labels":[],"label_agreement":null},{"id":"W4401667831","doi":"10.1007/978-3-031-68323-7_25","title":"A Novel Technique for Query Plan Representation Based on Graph Neural Nets","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Graph; Representation (politics); Artificial neural network; Theoretical computer science; Artificial intelligence; Information retrieval","score_opus":0.031953712129237866,"score_gpt":0.27810816285875806,"score_spread":0.2461544507295202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401667831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003292109,0.00016505383,0.9912685,0.00012181047,0.000046330875,0.00012709144,0.00031439232,0.0034960795,0.0011685326],"genre_scores_gemma":[0.10071317,0.00031091596,0.8929463,0.00015982435,0.000052028787,0.00018563957,0.0014435746,0.00029620482,0.003892355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925536,0.000092855415,0.00005514597,0.00018604135,0.00034524527,0.00006538355],"domain_scores_gemma":[0.99934965,0.0002304031,0.00005069714,0.00016818017,0.00017050163,0.000030475878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057387614,0.0007790835,0.00088334334,0.0019158856,0.0006043363,0.0013128533,0.0018148766,0.00075269013,0.004749575],"category_scores_gemma":[0.0022405016,0.00043201042,0.00086295593,0.0022272037,0.0005211706,0.0023617088,0.0012575095,0.0016424874,0.0010119645],"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.00027546159,0.00023634912,0.0008109697,0.00022984989,0.0000837906,0.00011968136,0.000155553,0.08147185,0.015285978,0.035586197,0.0146722505,0.8510721],"study_design_scores_gemma":[0.000017813862,0.00003632122,0.00020725022,0.000016854892,0.00003199369,0.000058813708,0.000040856292,0.9716988,0.006559829,0.01634,0.0049761455,0.000015338626],"about_ca_topic_score_codex":0.015000854,"about_ca_topic_score_gemma":0.022057332,"teacher_disagreement_score":0.015000854,"about_ca_system_score_codex":0.001116464,"about_ca_system_score_gemma":0.0016960948,"threshold_uncertainty_score":0.029827058},"labels":[],"label_agreement":null},{"id":"W4401762479","doi":"10.1007/978-3-031-69070-9_16","title":"Computing Clipped Products","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.024198788103117697,"score_gpt":0.2873780727970872,"score_spread":0.2631792846939695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401762479","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.02253168,0.0021652025,0.8783309,0.0004756498,0.0008699717,0.000054723103,0.0008812132,0.0029337795,0.09175694],"genre_scores_gemma":[0.25114614,0.0027770763,0.5960718,0.0006050085,0.0009011746,0.00019722538,0.005701882,0.0035607326,0.13903901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992918,0.00010168651,0.000034709854,0.00018752503,0.000313623,0.00007064373],"domain_scores_gemma":[0.9989452,0.00032744088,0.000052326373,0.00036082068,0.0002208275,0.000093559815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045336,0.0010693499,0.0009610266,0.0018695776,0.0007519069,0.0027054518,0.0013208846,0.0006413137,0.045571268],"category_scores_gemma":[0.0037359863,0.00062633323,0.00079591415,0.0025189058,0.0010317704,0.00425159,0.0027854552,0.0018862931,0.011498888],"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.000226847,0.00006843496,0.0005975967,0.0003134744,0.00007356374,0.00015687493,0.00019501887,0.0116330115,0.0073081963,0.5023425,0.056051403,0.42103302],"study_design_scores_gemma":[0.000026442305,0.00007781007,0.00039771583,0.00008646903,0.000038042726,0.00031416965,0.000085963125,0.08980626,0.008511612,0.79130673,0.1093165,0.000032269392],"about_ca_topic_score_codex":0.0006177539,"about_ca_topic_score_gemma":0.0009781776,"teacher_disagreement_score":0.045571268,"about_ca_system_score_codex":0.00069360645,"about_ca_system_score_gemma":0.00044230744,"threshold_uncertainty_score":0.1524511},"labels":[],"label_agreement":null},{"id":"W4401767940","doi":"10.1007/978-3-031-69070-9_3","title":"A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Algebraic number; Computer science; Algebra over a field; Algorithm; Multivariate statistics; Mathematics; Pure mathematics; Programming language; Machine learning","score_opus":0.012349575831576287,"score_gpt":0.25140765378230645,"score_spread":0.23905807795073017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401767940","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.06102092,0.00024621724,0.9199994,0.00020605403,0.00018205357,0.00015001977,0.00025421262,0.0046242294,0.013316841],"genre_scores_gemma":[0.25913903,0.00022664237,0.72608656,0.00009273971,0.00021331018,0.00014358165,0.0011398821,0.00060564675,0.012352606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948114,0.000061087834,0.00003883316,0.00012431163,0.00019682907,0.00009775559],"domain_scores_gemma":[0.9991258,0.00028063048,0.000084346095,0.00020554836,0.00022320448,0.00008056785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066892477,0.001233506,0.0008464306,0.0015389646,0.0007196365,0.0016029647,0.0013837426,0.00057551445,0.011239695],"category_scores_gemma":[0.0025724738,0.00039598925,0.0011384262,0.0014628858,0.0006090344,0.0026318943,0.0022791019,0.0011990914,0.0039777975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006461043,0.0002577949,0.0023775715,0.00030060983,0.00010216158,0.00037286547,0.00029081164,0.022197895,0.04047295,0.13131477,0.014875223,0.78679127],"study_design_scores_gemma":[0.0005060266,0.00085312023,0.0024945766,0.00012339701,0.00026787462,0.0013792141,0.0003450384,0.59645194,0.07745807,0.27891865,0.041081365,0.00012073583],"about_ca_topic_score_codex":0.0006768942,"about_ca_topic_score_gemma":0.001805443,"teacher_disagreement_score":0.011239695,"about_ca_system_score_codex":0.00079523266,"about_ca_system_score_gemma":0.0011061196,"threshold_uncertainty_score":0.037600577},"labels":[],"label_agreement":null},{"id":"W4401768400","doi":"10.1007/978-3-031-69070-9_9","title":"Counting the Integer Points of Parametric Polytopes: A Maple Implementation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Maple; Computer science; Polytope; Integer (computer science); Parametric statistics; Algorithm; Discrete mathematics; Programming language; Mathematics; Statistics; Botany","score_opus":0.015499528736504868,"score_gpt":0.2683730491502423,"score_spread":0.25287352041373745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401768400","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.02839015,0.00020471265,0.93520916,0.0002717631,0.00010898253,0.00013500957,0.00060805806,0.013080911,0.021991251],"genre_scores_gemma":[0.2900196,0.0001906724,0.6887165,0.00020620733,0.000107071835,0.00037560132,0.0014409237,0.0018080784,0.017135357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795234,0.00029206587,0.0001660012,0.00046114286,0.0007807924,0.0003476654],"domain_scores_gemma":[0.9969561,0.0010641947,0.00012749995,0.0012276148,0.00048068585,0.00014382722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012464973,0.0011879525,0.001725829,0.001884018,0.00159634,0.0047801896,0.0041549294,0.001653347,0.032336507],"category_scores_gemma":[0.0065832417,0.0009475487,0.0016921125,0.003131875,0.0013281223,0.008814833,0.006213382,0.0018510531,0.0070547108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091782527,0.00029228322,0.0023552668,0.0004911488,0.0001067952,0.00022096133,0.0006114635,0.02487665,0.01355558,0.29556498,0.032519363,0.6284877],"study_design_scores_gemma":[0.00023386316,0.00025999002,0.0009029859,0.00013895944,0.00011465843,0.00036793962,0.00052658975,0.49174136,0.035682753,0.41510674,0.054798122,0.00012609157],"about_ca_topic_score_codex":0.0016897571,"about_ca_topic_score_gemma":0.0030767107,"teacher_disagreement_score":0.032336507,"about_ca_system_score_codex":0.0013637403,"about_ca_system_score_gemma":0.0011493553,"threshold_uncertainty_score":0.10817635},"labels":[],"label_agreement":null},{"id":"W4401812426","doi":"10.1007/978-3-031-64629-4_20","title":"Machine Learning Model for Anxiety Disorder Diagnosis Based on Sensory Time-Series Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health Research Topics","field":"Psychology","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":"Confederation College; Lakehead University","funders":"","keywords":"Computer science; Sensory system; Time series; Series (stratigraphy); Machine learning; Artificial intelligence; Anxiety; Cognitive psychology; Psychiatry; Psychology","score_opus":0.08603739380645745,"score_gpt":0.3834903086009429,"score_spread":0.29745291479448543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401812426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20311323,0.0035691718,0.78163695,0.0018863713,0.00051870366,0.0001279053,0.00226872,0.00175989,0.0051191254],"genre_scores_gemma":[0.9474923,0.00090575684,0.042563826,0.00017564249,0.00020238047,0.00020765749,0.0017461892,0.000033875724,0.006672291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998778,0.000023616596,0.000009596797,0.000045031535,0.000018806719,0.00002507365],"domain_scores_gemma":[0.9995838,0.0002804118,0.00002356053,0.000017007502,0.00008049678,0.000014641794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005292809,0.00047942836,0.00064591423,0.0005895748,0.00024974562,0.00051211973,0.0009019661,0.0006963909,0.0028489626],"category_scores_gemma":[0.0011554268,0.00017209665,0.0007445634,0.0004998127,0.00014276226,0.0003956521,0.00028972243,0.0010834716,0.00092252117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041752745,0.00038104894,0.009950712,0.00013263119,0.00022633595,0.00021692866,0.00007860619,0.57416475,0.003688909,0.004143691,0.0068979375,0.399701],"study_design_scores_gemma":[0.0000039743227,0.000022077918,0.0009735551,0.000006712317,0.000015368809,0.00002549418,0.0000055123837,0.9975363,0.00020804878,0.0010296602,0.0001692462,0.000003981903],"about_ca_topic_score_codex":0.008054361,"about_ca_topic_score_gemma":0.0074007614,"teacher_disagreement_score":0.008054361,"about_ca_system_score_codex":0.00052619766,"about_ca_system_score_gemma":0.00049094466,"threshold_uncertainty_score":0.016014993},"labels":[],"label_agreement":null},{"id":"W4401861707","doi":"10.1007/978-3-031-69766-1_11","title":"(re)Assessing PiM Effectiveness for Sequence Alignment","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 British Columbia","funders":"","keywords":"Computer science; Sequence (biology)","score_opus":0.023526181028634185,"score_gpt":0.28673556516207555,"score_spread":0.26320938413344136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401861707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34802228,0.0050329277,0.47669584,0.0015354262,0.0013896751,0.0009719647,0.016058598,0.10041411,0.049879152],"genre_scores_gemma":[0.4612501,0.0010085175,0.5097819,0.0004481554,0.00025507936,0.00033332102,0.01727633,0.0027195106,0.0069271573],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9890164,0.0033355688,0.0012469371,0.00144066,0.0044009713,0.000559478],"domain_scores_gemma":[0.95174587,0.027319567,0.0016499838,0.009779691,0.008530507,0.0009743422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010377447,0.0018706645,0.0011872788,0.0053872704,0.00097082753,0.0031129715,0.0021583748,0.002075729,0.009508869],"category_scores_gemma":[0.053785242,0.0004780338,0.0011758258,0.0046956325,0.0006807217,0.0057306974,0.001843347,0.0010392566,0.009610337],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032795926,0.00038975407,0.02611684,0.0015139887,0.0005272865,0.0005213934,0.00032197044,0.0093244435,0.051042877,0.0028731455,0.03651534,0.8675732],"study_design_scores_gemma":[0.0002951872,0.003068042,0.044718023,0.0003547165,0.0014047076,0.004673583,0.0015982419,0.5049052,0.38175684,0.013358262,0.043640282,0.00022702396],"about_ca_topic_score_codex":0.0011509708,"about_ca_topic_score_gemma":0.0013714078,"teacher_disagreement_score":0.010377447,"about_ca_system_score_codex":0.00052466185,"about_ca_system_score_gemma":0.000835035,"threshold_uncertainty_score":0.05488187},"labels":[],"label_agreement":null},{"id":"W4401862227","doi":"10.1007/978-3-031-69766-1_14","title":"PCTC: Hardware and Software Co-design for Pruned Capsule Networks on Tensor Cores","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Lakehead University","funders":"","keywords":"Computer science; Software; Tensor (intrinsic definition); Capsule; Computer hardware; Embedded system; Computer architecture; Parallel computing; Operating system; Geometry; Geology; Mathematics","score_opus":0.02590293987086669,"score_gpt":0.2683755111308871,"score_spread":0.2424725712600204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401862227","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.06676971,0.00054115144,0.90518975,0.0003312167,0.00029309298,0.00020399733,0.00017293623,0.007575139,0.01892286],"genre_scores_gemma":[0.61397207,0.00020915088,0.37453797,0.00025378822,0.000055196193,0.00028388368,0.0003372858,0.0007701341,0.009580577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995333,0.00008402669,0.000017437094,0.00008146647,0.00015517551,0.00012865287],"domain_scores_gemma":[0.9992138,0.00015367553,0.00008269438,0.00020781595,0.00025864984,0.00008339018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005965906,0.0008764426,0.00045048216,0.00041436314,0.0004986661,0.00096905883,0.0021622747,0.0004800281,0.007854024],"category_scores_gemma":[0.0013304283,0.00033966365,0.0005457836,0.00037480635,0.0005032144,0.0009826636,0.0010071574,0.0009885206,0.0012996064],"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.0008124796,0.0003201462,0.0015782228,0.0005436885,0.00017189239,0.00033644467,0.00019039078,0.49011722,0.08938457,0.03809068,0.029712718,0.34874153],"study_design_scores_gemma":[0.00005986634,0.00045092733,0.0003190901,0.000028653487,0.00004707059,0.000104133505,0.000044679244,0.95735985,0.025157599,0.006561646,0.009841492,0.000024943323],"about_ca_topic_score_codex":0.0034886159,"about_ca_topic_score_gemma":0.009023404,"teacher_disagreement_score":0.007854024,"about_ca_system_score_codex":0.00094909273,"about_ca_system_score_gemma":0.001769272,"threshold_uncertainty_score":0.026274323},"labels":[],"label_agreement":null},{"id":"W4401910536","doi":"10.1007/978-3-031-69042-6_7","title":"Riemann Surfaces, Branch Cuts and Charisma","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Charisma; Computer science; Computer graphics (images); Philosophy; Theology","score_opus":0.0279585740072952,"score_gpt":0.26844847151712176,"score_spread":0.24048989750982655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401910536","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045410667,0.019598063,0.019716933,0.0047688824,0.0010900199,0.00002366879,0.00018511852,0.00016880185,0.90903777],"genre_scores_gemma":[0.6275247,0.013233933,0.01502858,0.0012968426,0.0022523971,0.00006510764,0.00041278373,0.00026518092,0.33992046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983215,0.000036679405,0.000005380462,0.000028202468,0.000074066316,0.00002361617],"domain_scores_gemma":[0.99980325,0.000083160696,0.000018842942,0.000026979638,0.000031247004,0.000036563095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003134622,0.00055772084,0.0005416659,0.0016212233,0.0019156365,0.0035903582,0.0005421658,0.0010515016,0.009943603],"category_scores_gemma":[0.0010163322,0.00034866427,0.00029756187,0.0015129966,0.0035754526,0.003211759,0.0015001027,0.0035945042,0.0017401676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010016221,0.000008326354,0.000056566103,0.000031576936,0.00000196759,0.000030244697,0.00010994285,0.0002437926,0.00020608153,0.9847446,0.0058751553,0.008681683],"study_design_scores_gemma":[0.0000027608048,0.0000034816042,0.00015307382,0.000013447489,0.0000014172319,0.000086017775,0.00005325513,0.0002472854,0.000054500262,0.98187447,0.017507683,0.0000026681123],"about_ca_topic_score_codex":0.0009396161,"about_ca_topic_score_gemma":0.00106771,"teacher_disagreement_score":0.009943603,"about_ca_system_score_codex":0.0013876997,"about_ca_system_score_gemma":0.00047888028,"threshold_uncertainty_score":0.033264697},"labels":[],"label_agreement":null},{"id":"W4401911926","doi":"10.1007/978-3-031-69042-6_1","title":"Formal Analysis of Vehicular Crash Severity Using KeYmaera X","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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":"Western University; Concordia University","funders":"","keywords":"Computer science; Crash; Computer security; Programming language","score_opus":0.009913959001156842,"score_gpt":0.22179564892951867,"score_spread":0.21188168992836182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401911926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023138562,0.00028794236,0.96650463,0.00014774894,0.00008096869,0.00012420179,0.0002312859,0.001142163,0.008342484],"genre_scores_gemma":[0.6891594,0.0005025095,0.2936916,0.00016100495,0.00018276207,0.00033711307,0.00057317445,0.0004500479,0.014942374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985575,0.0003235347,0.00011738287,0.0003180571,0.00048970163,0.00019383567],"domain_scores_gemma":[0.99791616,0.0012765864,0.0002339845,0.00026004066,0.00026343737,0.000049787446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015635354,0.0007140777,0.00053024717,0.0011958765,0.00066367583,0.0018443107,0.001222996,0.0004912489,0.007999039],"category_scores_gemma":[0.0041519986,0.0005769111,0.001572216,0.0005980953,0.001694575,0.0028718805,0.0015168902,0.0014995664,0.0013183422],"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.00014824954,0.00011713956,0.003773273,0.0004166275,0.000073928895,0.0004664694,0.0009214627,0.1098159,0.015296946,0.7780804,0.003156442,0.08773309],"study_design_scores_gemma":[0.000045944696,0.00023737898,0.0026207273,0.00017168072,0.00011498673,0.00043063622,0.00036146573,0.52834845,0.013614888,0.42640516,0.027568106,0.000080649676],"about_ca_topic_score_codex":0.0019053201,"about_ca_topic_score_gemma":0.0017725873,"teacher_disagreement_score":0.007999039,"about_ca_system_score_codex":0.00086722913,"about_ca_system_score_gemma":0.0009936937,"threshold_uncertainty_score":0.026759446},"labels":[],"label_agreement":null},{"id":"W4401912643","doi":"10.1007/978-3-031-69042-6_2","title":"Formal Verification of ABCD Parameters Based Models for Transmission Lines","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power Line Communications and Noise","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":"Concordia University","funders":"","keywords":"Computer science; Formal verification; Programming language; Algorithm","score_opus":0.026810392752031124,"score_gpt":0.24839370454680643,"score_spread":0.2215833117947753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401912643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013450576,0.00010695202,0.97742134,0.00021683009,0.000073630115,0.0001579205,0.0003514777,0.0020292704,0.0061919396],"genre_scores_gemma":[0.6214248,0.00032248296,0.36867514,0.00025702492,0.00008063304,0.00044410035,0.0011414374,0.00079452136,0.006859832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960711,0.0012236193,0.00030137916,0.00045364077,0.0015729124,0.0003773568],"domain_scores_gemma":[0.99262273,0.004586073,0.00041454026,0.001302551,0.0009837297,0.00009045502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023312378,0.00094524253,0.000682131,0.00083595136,0.00063548185,0.002927745,0.0024738465,0.0012999207,0.007126889],"category_scores_gemma":[0.009779317,0.001007717,0.002186683,0.00042298724,0.002528427,0.0032937278,0.0022815056,0.0021498248,0.0012020647],"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.00026844724,0.0001777841,0.0009943794,0.0005297923,0.000099770645,0.00058850285,0.00067540805,0.26228145,0.018089995,0.6600793,0.003524544,0.05269069],"study_design_scores_gemma":[0.0001316082,0.00009038323,0.00021938415,0.00019271442,0.000078067016,0.00019779883,0.00012385503,0.63724726,0.026257677,0.31753218,0.01787833,0.000050707407],"about_ca_topic_score_codex":0.004393031,"about_ca_topic_score_gemma":0.0045024366,"teacher_disagreement_score":0.007126889,"about_ca_system_score_codex":0.0015908122,"about_ca_system_score_gemma":0.001962741,"threshold_uncertainty_score":0.023841858},"labels":[],"label_agreement":null},{"id":"W4401927532","doi":"10.1007/978-3-031-64636-2_5","title":"Divergent Expression of PD-1 as Challenges and Chances of Immunotherapy Targeting PD-1 or PD-L1 in Cancer","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cancer Immunotherapy and Biomarkers","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Immunotherapy; Cancer immunotherapy; PD-L1; Cancer; Expression (computer science); Computer science; Cancer research; Medicine; Internal medicine; Programming language","score_opus":0.030861637491737374,"score_gpt":0.30400736867853073,"score_spread":0.27314573118679336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401927532","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10608347,0.3777175,0.037364494,0.040769447,0.0066136904,0.00006746767,0.00032265382,0.00021663863,0.43084463],"genre_scores_gemma":[0.41858757,0.15780549,0.030832227,0.010473236,0.0026082299,0.00015089707,0.00048393,0.00027627408,0.37878215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998411,0.000024600213,0.000005943494,0.000035647976,0.000071465285,0.0000211198],"domain_scores_gemma":[0.9998621,0.00007081148,0.000012024717,0.000011086513,0.000023119548,0.000020837311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005016687,0.00022464716,0.00031107548,0.0002982583,0.0003681796,0.0019245242,0.00045726035,0.00058342307,0.003351806],"category_scores_gemma":[0.00049830927,0.00015203911,0.00025521172,0.00039120234,0.0008068983,0.0022878174,0.00091074704,0.0026026159,0.0010338796],"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.00025520276,0.00011816965,0.0012300779,0.0005425562,0.000018839017,0.00046120133,0.0015319535,0.0015607323,0.07176641,0.49424112,0.03884581,0.389428],"study_design_scores_gemma":[0.000017997789,0.00026799846,0.0016232737,0.00034707747,0.00002752718,0.0019267348,0.00093666336,0.0019917234,0.02571769,0.19482313,0.77229434,0.000025830897],"about_ca_topic_score_codex":0.00020566082,"about_ca_topic_score_gemma":0.0004237076,"teacher_disagreement_score":0.003351806,"about_ca_system_score_codex":0.0010851807,"about_ca_system_score_gemma":0.0005572665,"threshold_uncertainty_score":0.011212885},"labels":[],"label_agreement":null},{"id":"W4401928058","doi":"10.1007/978-3-031-64636-2_4","title":"Parkinson’s Disease Progression and Treatment Dynamics Accounting for Nonlocality of Bioneurological Processes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neurological disorders and treatments","field":"Medicine","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":"Wilfrid Laurier University","funders":"","keywords":"Quantum nonlocality; Computer science; Dynamics (music); Disease; Medicine; Physics; Quantum mechanics; Pathology","score_opus":0.023793742326180447,"score_gpt":0.29616607013227714,"score_spread":0.2723723278060967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401928058","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.856574,0.0028338197,0.11908117,0.0011528094,0.00013730895,0.000031167823,0.00097626646,0.0003228558,0.018890562],"genre_scores_gemma":[0.9853373,0.0005481594,0.006104166,0.000037996717,0.000030238005,0.000015014648,0.00033284858,0.0000377249,0.0075566075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991405,0.000017263234,0.0000048205684,0.000030199348,0.000013949016,0.000019807141],"domain_scores_gemma":[0.9992125,0.0005105062,0.00011497265,0.000055300698,0.00007552333,0.000031230924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037352953,0.00037041891,0.00051451917,0.00026963823,0.00017581346,0.0009786843,0.00044175755,0.00057547167,0.0036866388],"category_scores_gemma":[0.00226878,0.0002198146,0.00051078736,0.00035767458,0.00028109775,0.0011912583,0.0002460348,0.0005840757,0.0003008067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048493312,0.00017262813,0.02581458,0.00025961627,0.00021453148,0.0010077187,0.00027800348,0.7841988,0.01304587,0.046298612,0.0046460154,0.12357869],"study_design_scores_gemma":[0.0000074630907,0.00004537985,0.010258127,0.000011915492,0.00004398261,0.00017414067,0.000052600095,0.97769827,0.00070293434,0.010484524,0.0005053413,0.00001535824],"about_ca_topic_score_codex":0.0058776494,"about_ca_topic_score_gemma":0.0066315443,"teacher_disagreement_score":0.0058776494,"about_ca_system_score_codex":0.00043217643,"about_ca_system_score_gemma":0.0006089912,"threshold_uncertainty_score":0.0123330355},"labels":[],"label_agreement":null},{"id":"W4401965198","doi":"10.1007/978-3-031-68416-6_4","title":"QuADTool: Attack-Defense-Tree Synthesis, Analysis and Bridge to Verification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Library of Parliament","funders":"","keywords":"Computer science; Tree (set theory); Bridge (graph theory); Computer security; Mathematics; Combinatorics","score_opus":0.020449108701667308,"score_gpt":0.2770430110868795,"score_spread":0.2565939023852122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401965198","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003336808,0.00048333858,0.9676292,0.00014524044,0.00015532575,0.00010346324,0.0003482983,0.017694533,0.010103834],"genre_scores_gemma":[0.1695838,0.000890925,0.79458123,0.00060365436,0.00016510817,0.00031734267,0.002063251,0.008713054,0.023081636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999121,0.00015692045,0.000058230864,0.00019806926,0.0003654503,0.00010029002],"domain_scores_gemma":[0.9988726,0.00046956073,0.00006678738,0.00037354065,0.00018990641,0.000027525553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007179528,0.0014875181,0.0007949088,0.0012649725,0.00049870106,0.0017407442,0.0023635535,0.0011036467,0.024120515],"category_scores_gemma":[0.0024898066,0.0010399825,0.001399647,0.00079173787,0.0009301131,0.0026530495,0.002029816,0.0019108197,0.00803811],"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.0003270304,0.00014460605,0.0006793993,0.0008555757,0.00008624394,0.00025509702,0.0001976762,0.047127996,0.03691793,0.14646485,0.05521613,0.7117275],"study_design_scores_gemma":[0.00009699678,0.00027383765,0.00044411438,0.00035151103,0.00011421332,0.0007839813,0.000085849526,0.4998089,0.0933805,0.27873218,0.12584263,0.00008525401],"about_ca_topic_score_codex":0.0010565761,"about_ca_topic_score_gemma":0.0016919111,"teacher_disagreement_score":0.024120515,"about_ca_system_score_codex":0.0007826698,"about_ca_system_score_gemma":0.0013313111,"threshold_uncertainty_score":0.08069116},"labels":[],"label_agreement":null},{"id":"W4402003903","doi":"10.1007/978-3-031-70893-0_31","title":"Star-Shaped Denoising Diffusion Probabilistic Models (Extended Abstract)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Probabilistic logic; Noise reduction; Diffusion; Star (game theory); Algorithm; Artificial intelligence; Mathematics; Physics; Mathematical analysis","score_opus":0.030203272364552055,"score_gpt":0.2757212454938415,"score_spread":0.24551797312928947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402003903","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.0059173764,0.0024995045,0.9693694,0.0008347154,0.00046839236,0.000020833177,0.0002661885,0.0002601083,0.020363426],"genre_scores_gemma":[0.36180702,0.012837652,0.36629188,0.0014855063,0.00175752,0.0001697267,0.0019208001,0.0008452467,0.25288457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998204,0.00003410097,0.000008756618,0.00006693183,0.000055857705,0.000013933737],"domain_scores_gemma":[0.9993973,0.00025647762,0.000056005145,0.000068063644,0.00017707667,0.000045139455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940883,0.00081739476,0.00083291717,0.00063000654,0.00020977286,0.0012601772,0.0010086688,0.0016641716,0.007783552],"category_scores_gemma":[0.0020205383,0.00060379336,0.0012334542,0.00087030936,0.0009346303,0.0017367641,0.0010572935,0.0018365593,0.00407765],"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.0000691611,0.000050329785,0.000272128,0.00035264713,0.00006724248,0.00020933221,0.00014554006,0.17121336,0.008923253,0.73229283,0.0224437,0.063960396],"study_design_scores_gemma":[0.000009295116,0.000043176307,0.00024990164,0.00003951971,0.000022760063,0.00028361307,0.000016694104,0.58615273,0.0022462746,0.3907047,0.020200541,0.000030766714],"about_ca_topic_score_codex":0.0012523284,"about_ca_topic_score_gemma":0.0010639034,"teacher_disagreement_score":0.007783552,"about_ca_system_score_codex":0.00052567956,"about_ca_system_score_gemma":0.00039680133,"threshold_uncertainty_score":0.026038587},"labels":[],"label_agreement":null},{"id":"W4402007577","doi":"10.1007/978-3-031-70893-0_2","title":"Efficiently Training Neural Networks for Imperfect Information Games by Sampling Information Sets","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Perfect information; Artificial neural network; Training (meteorology); Imperfect; Artificial intelligence; Sampling (signal processing); Machine learning; Computer vision; Mathematics; Mathematical economics","score_opus":0.02881157661154738,"score_gpt":0.2810092525429389,"score_spread":0.25219767593139153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402007577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101734914,0.0008994798,0.88682115,0.0011140457,0.00014372988,0.00018483182,0.00025123873,0.0010537098,0.0077968645],"genre_scores_gemma":[0.8166174,0.00040128283,0.17317525,0.0003700914,0.000140649,0.00044168587,0.00048687862,0.0002082094,0.008158436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925345,0.00027210018,0.000047752306,0.0001683824,0.00012378367,0.0001345553],"domain_scores_gemma":[0.99185354,0.0071374937,0.00027669367,0.00030199418,0.00028137089,0.00014888219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018778131,0.0015699756,0.002008638,0.0008177201,0.00056804856,0.0013810121,0.002348042,0.0025853822,0.003974993],"category_scores_gemma":[0.012358749,0.0014636172,0.00084538275,0.0007897471,0.0013815765,0.0031784773,0.0023183036,0.003355647,0.00055974344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013024641,0.000078664874,0.0004315979,0.000068377885,0.00004211896,0.0000307997,0.00003686101,0.95365244,0.00046651662,0.0122639425,0.0011370688,0.03166148],"study_design_scores_gemma":[0.00000781569,0.000010033439,0.000019474886,0.0000045551797,0.0000028297486,0.000002859841,0.000003030569,0.9926536,0.0000923474,0.0071551963,0.000046694706,0.0000016272055],"about_ca_topic_score_codex":0.0073733805,"about_ca_topic_score_gemma":0.012623308,"teacher_disagreement_score":0.0073733805,"about_ca_system_score_codex":0.002041171,"about_ca_system_score_gemma":0.0016061906,"threshold_uncertainty_score":0.014809847},"labels":[],"label_agreement":null},{"id":"W4402012699","doi":"10.1007/978-3-031-70344-7_1","title":"Landscape Analysis of Stochastic Policy Gradient Methods","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Operations research; Mathematics","score_opus":0.049154703808018674,"score_gpt":0.3831261730068113,"score_spread":0.3339714691987926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402012699","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.009643456,0.0025224986,0.9610768,0.0011706284,0.00017787585,0.00005249948,0.000120321245,0.00021357095,0.025022397],"genre_scores_gemma":[0.62414724,0.004983006,0.29500306,0.0008265531,0.0006579827,0.00055549573,0.0005753813,0.001373332,0.071877964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928254,0.00041961903,0.00002106589,0.00007207369,0.00014189519,0.00006285366],"domain_scores_gemma":[0.99716717,0.0020554455,0.00015411642,0.00015202341,0.00032540775,0.00014598173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019010783,0.00089495233,0.0013307609,0.0013876297,0.0006238983,0.002160961,0.0016384434,0.0017900263,0.010076217],"category_scores_gemma":[0.009791607,0.00076204474,0.0010637039,0.0011243953,0.0015179015,0.0025487402,0.0018822656,0.002142347,0.0008729896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040288927,0.000039661354,0.00034544835,0.00016011218,0.00005185183,0.00004001201,0.00006891246,0.20120376,0.0007665785,0.7646955,0.005792948,0.026794925],"study_design_scores_gemma":[0.0000061610244,0.000011209797,0.00015812126,0.000027912374,0.000008633815,0.00001751673,0.000012134108,0.7266039,0.00013214764,0.27036956,0.0026446546,0.0000081607],"about_ca_topic_score_codex":0.0030486393,"about_ca_topic_score_gemma":0.0021026933,"teacher_disagreement_score":0.010076217,"about_ca_system_score_codex":0.001560543,"about_ca_system_score_gemma":0.00095889275,"threshold_uncertainty_score":0.033708334},"labels":[],"label_agreement":null},{"id":"W4402014004","doi":"10.1007/978-3-031-70362-1_15","title":"Graphical Model-Based Lasso for Weakly Dependent Time Series of Tensors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition 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":"University of Alberta","funders":"","keywords":"Computer science; Series (stratigraphy); Lasso (programming language); Graphical model; Algorithm; Time series; Artificial intelligence; Theoretical computer science; Applied mathematics; Machine learning; Mathematics; Programming language; Geology","score_opus":0.02534541485026531,"score_gpt":0.28632744140858646,"score_spread":0.26098202655832115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402014004","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.001510586,0.00022258355,0.99718285,0.00016458411,0.00005992189,0.000014495581,0.00012875344,0.00035244224,0.00036383932],"genre_scores_gemma":[0.20043756,0.0020467138,0.7763626,0.0008280244,0.0011633699,0.000664529,0.0037314154,0.001833237,0.012932546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731463,0.001525603,0.00011020057,0.00052291685,0.00033832944,0.00018823822],"domain_scores_gemma":[0.99275726,0.00510744,0.00057692616,0.0007569194,0.00053483486,0.0002666991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039346707,0.002631938,0.0027355005,0.00094898464,0.00064808753,0.002110507,0.0026729424,0.0021198662,0.00457823],"category_scores_gemma":[0.011035058,0.0012597243,0.0027784482,0.0016562035,0.0017790503,0.00217582,0.002438502,0.0052368566,0.0020635563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002666654,0.00018033409,0.00082071807,0.0005042684,0.0004159885,0.00017422663,0.00016853737,0.70301753,0.0063089845,0.11935774,0.016135946,0.15264897],"study_design_scores_gemma":[0.000008196868,0.000021836187,0.000074018826,0.000013784105,0.000018520472,0.000022594799,0.00000720305,0.9669301,0.00030529316,0.031781152,0.0008049262,0.000012409735],"about_ca_topic_score_codex":0.0024851405,"about_ca_topic_score_gemma":0.003635831,"teacher_disagreement_score":0.00457823,"about_ca_system_score_codex":0.00091995194,"about_ca_system_score_gemma":0.0014592778,"threshold_uncertainty_score":0.020808756},"labels":[],"label_agreement":null},{"id":"W4402029539","doi":"10.1007/978-3-031-70368-3_16","title":"Simultaneous Linear Connectivity of Neural Networks Modulo Permutation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","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; Google (Canada); Mila - Quebec Artificial Intelligence Institute; Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Modulo; Permutation (music); Artificial neural network; Algorithm; Theoretical computer science; Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.013001490242660235,"score_gpt":0.25164923161420083,"score_spread":0.2386477413715406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402029539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09499207,0.0014960837,0.78934795,0.00065229594,0.0003164418,0.00009685828,0.00027307175,0.001147044,0.111678146],"genre_scores_gemma":[0.8738705,0.0013797658,0.08565393,0.00023465896,0.00032571994,0.00019979049,0.00031491555,0.00028801235,0.037732646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997795,0.000061982115,0.000010759603,0.00006593144,0.000045856992,0.000035932484],"domain_scores_gemma":[0.99951684,0.0002491357,0.00005553458,0.00010093465,0.000044071454,0.00003350427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021698841,0.0004085674,0.00038125136,0.00045533458,0.0003817309,0.0007387615,0.0008740845,0.0005094711,0.010716094],"category_scores_gemma":[0.0013314532,0.0003330034,0.00043604584,0.0007221579,0.0007342492,0.0018227092,0.0012720888,0.0009785934,0.001314699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119864235,0.00004090835,0.00018697217,0.0002301649,0.000044015593,0.00026280817,0.0001584482,0.043609355,0.014023275,0.80702084,0.00698338,0.12731996],"study_design_scores_gemma":[0.000030882624,0.000085637126,0.00031918188,0.000027225324,0.000024125362,0.00023037283,0.000044851797,0.18856715,0.0051559084,0.79755783,0.007941249,0.000015564328],"about_ca_topic_score_codex":0.0005085148,"about_ca_topic_score_gemma":0.00092571165,"teacher_disagreement_score":0.010716094,"about_ca_system_score_codex":0.00036629557,"about_ca_system_score_gemma":0.0002878247,"threshold_uncertainty_score":0.035848856},"labels":[],"label_agreement":null},{"id":"W4402029541","doi":"10.1007/978-3-031-70368-3_12","title":"MEGA: Multi-encoder GNN Architecture for Stronger Task Collaboration and Generalization","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Generalization; Task (project management); Mega-; Architecture; Encoder; Artificial intelligence; Computer architecture; Operating system; Systems engineering; Mathematics; Engineering; Geography","score_opus":0.018507009773168,"score_gpt":0.2667492491617782,"score_spread":0.24824223938861023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402029541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0223875,0.0013136107,0.9459505,0.00042137547,0.0007492441,0.00009916169,0.0008333422,0.01903089,0.00921434],"genre_scores_gemma":[0.36023325,0.00079742965,0.5962997,0.0012185812,0.00024408981,0.00029667516,0.003950902,0.0017258278,0.03523348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972814,0.00004241382,0.000012594232,0.00012367204,0.000042442065,0.00005075219],"domain_scores_gemma":[0.9995529,0.00011800095,0.000016138963,0.00014901304,0.00010917894,0.000054842367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000804652,0.001178621,0.00077576685,0.00045323776,0.00038471306,0.0008324499,0.0022087533,0.0017452212,0.01147475],"category_scores_gemma":[0.00161875,0.0006270688,0.00059039553,0.00057696056,0.00041154315,0.0016851914,0.0018995843,0.002736398,0.0056025614],"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.000513469,0.00031632473,0.0006082743,0.00022323291,0.00018229455,0.00015460252,0.00010020995,0.075728394,0.040544346,0.013516268,0.041982736,0.8261298],"study_design_scores_gemma":[0.000049790724,0.0001334067,0.00046770537,0.00004932011,0.000059176,0.00013275475,0.00002541798,0.94994706,0.021096155,0.01664781,0.011361539,0.000029820392],"about_ca_topic_score_codex":0.0071594794,"about_ca_topic_score_gemma":0.015282138,"teacher_disagreement_score":0.01147475,"about_ca_system_score_codex":0.0006565749,"about_ca_system_score_gemma":0.0009315441,"threshold_uncertainty_score":0.03838688},"labels":[],"label_agreement":null},{"id":"W4402073827","doi":"10.1007/978-3-031-71210-4_4","title":"To Share or Not to Share: Randomized Controlled Study of Misinformation Warning Labels on Social Media","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ted Rogers Centre for Heart Research","funders":"","keywords":"Misinformation; Computer science; Social media; Internet privacy; Computer security; World Wide Web","score_opus":0.04682045657459773,"score_gpt":0.3370707553202112,"score_spread":0.2902502987456135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402073827","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.94379973,0.0020905775,0.0030244964,0.0007953962,0.0013977216,0.04310312,0.00063086493,0.0002611756,0.004897021],"genre_scores_gemma":[0.90175176,0.0009859864,0.009197458,0.0010256803,0.0005339052,0.081924275,0.00020459329,0.000034072647,0.004342192],"study_design_codex":"randomized_trial","study_design_gemma":"randomized_trial","domain_scores_codex":[0.9934635,0.004409268,0.0004898532,0.00073406094,0.00048062447,0.00042281664],"domain_scores_gemma":[0.9864674,0.009671281,0.0016772749,0.0007311577,0.00040442415,0.0010484263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006849822,0.0012027004,0.0018786757,0.00065124466,0.0010489878,0.001332279,0.0014779599,0.0027820533,0.016078573],"category_scores_gemma":[0.015407615,0.0008330378,0.0012956026,0.0005160243,0.001860163,0.0015138116,0.0009162373,0.0041129733,0.0014422897],"study_design_candidate":"randomized_trial","study_design_consensus":"randomized_trial","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.7707564,0.16627075,0.0014495188,0.00368739,0.0015861889,0.00006550019,0.0007413185,0.0006272862,0.0022006612,0.0012240211,0.0016524963,0.04973848],"study_design_scores_gemma":[0.6438082,0.34269583,0.003919392,0.00051247905,0.0010976519,0.00001755644,0.0003198545,0.0020724053,0.0016078141,0.0016616249,0.0022298864,0.000057344485],"about_ca_topic_score_codex":0.0010562934,"about_ca_topic_score_gemma":0.0013604285,"teacher_disagreement_score":0.016078573,"about_ca_system_score_codex":0.0010825152,"about_ca_system_score_gemma":0.0019732334,"threshold_uncertainty_score":0.053788126},"labels":[],"label_agreement":null},{"id":"W4402074987","doi":"10.1007/978-3-031-70352-2_3","title":"Direct-Effect Risk Minimization for Domain Generalization","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Generalization; Minification; Domain (mathematical analysis); Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.013472994446978713,"score_gpt":0.25342637749075975,"score_spread":0.23995338304378103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402074987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020211905,0.00060251035,0.9959681,0.00013682693,0.0000358572,0.000017048038,0.000049277474,0.00026492562,0.0009042669],"genre_scores_gemma":[0.27634415,0.0026924005,0.6864902,0.0005804331,0.00037776027,0.00047048635,0.0012079517,0.0010883034,0.030748304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928695,0.0002656422,0.000031391697,0.00020000541,0.00015771788,0.00005824709],"domain_scores_gemma":[0.99823964,0.0012013493,0.000053437358,0.0002650575,0.0001736717,0.00006687886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020525975,0.001332383,0.0022361288,0.0006442797,0.000420378,0.0009968275,0.0023529842,0.0021331566,0.0048389393],"category_scores_gemma":[0.0048025614,0.000728655,0.0013867451,0.0007553056,0.0012830066,0.0021540471,0.0030922869,0.00342067,0.0012720429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017089443,0.00016319788,0.000409207,0.00042672362,0.00022026978,0.00011447253,0.00010346566,0.57364124,0.0057291375,0.0891049,0.015457508,0.314459],"study_design_scores_gemma":[0.000007680212,0.000033627402,0.00011466189,0.000018336614,0.000017511307,0.00003869918,0.000009664135,0.9515548,0.000934619,0.04584633,0.0014143394,0.000009743575],"about_ca_topic_score_codex":0.0033170984,"about_ca_topic_score_gemma":0.0029910624,"teacher_disagreement_score":0.0048389393,"about_ca_system_score_codex":0.0010332513,"about_ca_system_score_gemma":0.0009881557,"threshold_uncertainty_score":0.016187906},"labels":[],"label_agreement":null},{"id":"W4402076595","doi":"10.1007/978-3-031-70352-2_16","title":"AKGNet: Attribute Knowledge Guided Unsupervised Lung-Infected Area Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.0405987766577663,"score_gpt":0.32676568660924926,"score_spread":0.286166909951483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402076595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012138338,0.0011044921,0.9556238,0.00027231622,0.0003042035,0.00021442659,0.0017374286,0.025083898,0.0035211751],"genre_scores_gemma":[0.12030659,0.0005632751,0.86153007,0.0004380888,0.00019816462,0.0002185627,0.005310724,0.0020070935,0.009427467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939907,0.00007193583,0.000032355503,0.00020438312,0.00021002619,0.000082106766],"domain_scores_gemma":[0.99948764,0.00019310875,0.000034643763,0.00012371023,0.00012561896,0.000035322737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008606969,0.0013652425,0.0015633568,0.0018187895,0.00070665777,0.0019625279,0.0031198543,0.0025502816,0.0060188416],"category_scores_gemma":[0.001473341,0.0007765194,0.0015480188,0.0019119622,0.00065658963,0.0011957216,0.0020050176,0.0013999715,0.0034042236],"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.0005746758,0.00020201047,0.0016607115,0.00028546542,0.00022474771,0.00029475213,0.00011259962,0.08426561,0.023854658,0.0031767483,0.044276644,0.84107137],"study_design_scores_gemma":[0.000035282912,0.00006128079,0.00092364516,0.000040583436,0.000050452647,0.0003751678,0.000044710418,0.96843374,0.014348778,0.0062967134,0.009362295,0.000027335935],"about_ca_topic_score_codex":0.007653533,"about_ca_topic_score_gemma":0.013905426,"teacher_disagreement_score":0.007653533,"about_ca_system_score_codex":0.0007848701,"about_ca_system_score_gemma":0.001303669,"threshold_uncertainty_score":0.020135045},"labels":[],"label_agreement":null},{"id":"W4402081416","doi":"10.1007/978-3-031-70563-2_10","title":"Analyzing Biases in Popular Answer Selection Datasets on Neural-Based QA Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence; Machine learning; Artificial neural network; Natural language processing","score_opus":0.044718066341635436,"score_gpt":0.2792266015176221,"score_spread":0.23450853517598663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402081416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960194,0.0038426202,0.018311387,0.0015046926,0.00023637878,0.000100890065,0.0111846775,0.001333796,0.0032916653],"genre_scores_gemma":[0.9638591,0.00038344832,0.009891319,0.00024927885,0.00015313707,0.000083220046,0.0235007,0.00016896272,0.0017107454],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9947488,0.003201865,0.0003356417,0.0006830801,0.0007980915,0.00023256794],"domain_scores_gemma":[0.930404,0.05882964,0.0016606478,0.004300749,0.004187864,0.0006170205],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011654527,0.00069385866,0.0008511336,0.002140737,0.0007148873,0.0015707151,0.0013219089,0.0016315231,0.0027706851],"category_scores_gemma":[0.0589851,0.00029453394,0.00085653784,0.00249227,0.0006724803,0.002750251,0.0012828802,0.0018748555,0.0012636731],"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.011198372,0.002361983,0.2389833,0.0027888392,0.0019969281,0.0005033033,0.0023179667,0.18864284,0.01447738,0.017580068,0.14337277,0.3757763],"study_design_scores_gemma":[0.0003466256,0.0005794082,0.049929623,0.00022697925,0.00032218813,0.00028341715,0.00067183364,0.9118737,0.0073059956,0.019355131,0.009024906,0.00008021158],"about_ca_topic_score_codex":0.0056727235,"about_ca_topic_score_gemma":0.00857961,"teacher_disagreement_score":0.98834544,"about_ca_system_score_codex":0.0015257855,"about_ca_system_score_gemma":0.0007543629,"threshold_uncertainty_score":0.061635733},"labels":[],"label_agreement":null},{"id":"W4402081998","doi":"10.1007/978-3-031-70563-2_6","title":"Continual Learning Under Language Shift","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EFL/ESL Teaching and Learning","field":"Arts and Humanities","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":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Programming language","score_opus":0.019829794984089728,"score_gpt":0.25082735751223867,"score_spread":0.23099756252814893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402081998","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.58476084,0.00027179654,0.11452444,0.0018816422,0.00014979827,0.000055805922,0.00011812356,0.00075594283,0.2974816],"genre_scores_gemma":[0.98039067,0.000057081,0.0046575363,0.000043153905,0.000022113665,0.000028561479,0.00006056744,0.000033130505,0.014707149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995289,0.0001069114,0.000017617711,0.00014692779,0.000113208196,0.00008641081],"domain_scores_gemma":[0.9986493,0.00059443805,0.00009909891,0.0002850315,0.0001576977,0.00021445553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063811865,0.0002470083,0.00027402272,0.00025702678,0.0005092356,0.0015778067,0.00055999,0.00054313673,0.010544736],"category_scores_gemma":[0.0033150967,0.00017153066,0.00024114749,0.0002923785,0.0016945298,0.0040496388,0.0031735834,0.0012433312,0.0012122673],"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.00051631447,0.000450093,0.0031189062,0.000093030736,0.000018935341,0.00040720493,0.004806987,0.0065225433,0.010131841,0.7705228,0.0030984867,0.20031293],"study_design_scores_gemma":[0.00004856493,0.00018544824,0.0017088309,0.000026293277,0.000009552828,0.00018708892,0.0022436671,0.01824493,0.00368877,0.9643528,0.009289629,0.0000144601645],"about_ca_topic_score_codex":0.0004378018,"about_ca_topic_score_gemma":0.00033134874,"teacher_disagreement_score":0.010544736,"about_ca_system_score_codex":0.0004996672,"about_ca_system_score_gemma":0.0006738806,"threshold_uncertainty_score":0.035275698},"labels":[],"label_agreement":null},{"id":"W4402100576","doi":"10.1007/978-3-031-70378-2_1","title":"VulEXplaineR: XAI for Vulnerability Detection on Assembly Code","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Blackberry (Canada); Defence Research and Development Canada; McGill University","funders":"","keywords":"Computer science; Vulnerability (computing); Code (set theory); Programming language; Computer security","score_opus":0.02503805183696138,"score_gpt":0.29059986459214643,"score_spread":0.26556181275518503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402100576","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021317024,0.000906731,0.35533577,0.00023460771,0.00026382608,0.00014583762,0.0038611297,0.6040236,0.0139115155],"genre_scores_gemma":[0.2777,0.0012349553,0.56606424,0.000702935,0.00029817896,0.00057105825,0.021228986,0.08131468,0.050884906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991321,0.00009955063,0.00005258988,0.0002150876,0.00039733457,0.00010324652],"domain_scores_gemma":[0.9986578,0.0005672049,0.00015279847,0.0004157924,0.00014884383,0.000057597303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007233701,0.0023389661,0.00080236833,0.0019917835,0.0004568417,0.0012613974,0.002018399,0.0010527375,0.022482343],"category_scores_gemma":[0.0026919881,0.0011155196,0.0012820123,0.0011341836,0.0005110937,0.002226591,0.0016594849,0.0017385556,0.010990612],"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.00069160154,0.00020268191,0.0048439414,0.0008509294,0.00022324966,0.00042480853,0.00036586175,0.009431654,0.049476687,0.008570997,0.22314832,0.7017693],"study_design_scores_gemma":[0.00029075635,0.0007652673,0.009922107,0.00044081034,0.00033689363,0.0018157347,0.00020396152,0.45162708,0.27805388,0.029601946,0.22662288,0.0003186574],"about_ca_topic_score_codex":0.0010651102,"about_ca_topic_score_gemma":0.0014681708,"teacher_disagreement_score":0.022482343,"about_ca_system_score_codex":0.00044787372,"about_ca_system_score_gemma":0.00059234764,"threshold_uncertainty_score":0.07521093},"labels":[],"label_agreement":null},{"id":"W4402100993","doi":"10.1007/978-3-031-70381-2_2","title":"Machine Learning Based Tool for Automated Sperm Cell Tracking and Sperm Bundle Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Micro and Nano Robotics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sperm; Sperm cell; Bundle; Artificial intelligence; Tracking (education); Computer vision; Biology","score_opus":0.009920342538911935,"score_gpt":0.23029518013969894,"score_spread":0.220374837600787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402100993","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.004604821,0.00027600734,0.97717756,0.00008103928,0.00009975686,0.00008028893,0.00040472756,0.014489768,0.002786087],"genre_scores_gemma":[0.06891692,0.00029084296,0.9132862,0.0002466931,0.00005926509,0.00027697405,0.0013786618,0.00066148065,0.014882974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964845,0.000023718516,0.000019204797,0.00009748185,0.00018105384,0.00003012621],"domain_scores_gemma":[0.9994956,0.00017870312,0.00004350714,0.00006980358,0.00018687712,0.000025590658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038255402,0.0006817449,0.0007140294,0.0013443052,0.0003720786,0.00083115784,0.0019100277,0.0013860937,0.015167437],"category_scores_gemma":[0.0008492804,0.00055204175,0.0007161092,0.0009940114,0.0002471624,0.00082921574,0.00081560336,0.000750648,0.0070725065],"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.00019532241,0.00012732108,0.00093621534,0.00021686962,0.000055726105,0.00022684065,0.000045028853,0.014368635,0.09963692,0.0036571247,0.017658208,0.8628758],"study_design_scores_gemma":[0.00004149693,0.00023927774,0.0030718644,0.00007972088,0.00007173712,0.0011859016,0.0000415208,0.783871,0.1551126,0.0066949218,0.049502555,0.00008743811],"about_ca_topic_score_codex":0.0009922307,"about_ca_topic_score_gemma":0.0014090099,"teacher_disagreement_score":0.015167437,"about_ca_system_score_codex":0.00040524334,"about_ca_system_score_gemma":0.00057654444,"threshold_uncertainty_score":0.050740182},"labels":[],"label_agreement":null},{"id":"W4402112538","doi":"10.1007/978-3-031-70626-4_9","title":"GXJoin: Generalized Cell Transformations for Explainable Joinability","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.0933103195086047,"score_gpt":0.35450553264650664,"score_spread":0.26119521313790195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402112538","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.0034841544,0.000077778655,0.9853999,0.00015208642,0.000078376426,0.000057558602,0.0003223043,0.004677137,0.005750585],"genre_scores_gemma":[0.20092414,0.00051923364,0.7555401,0.0004374857,0.00019928582,0.0005524552,0.0037608854,0.007182361,0.03088419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989214,0.00020430647,0.00007221095,0.00025013016,0.00043357053,0.00011842645],"domain_scores_gemma":[0.998689,0.0006366401,0.000047773334,0.00044256257,0.00013550119,0.000048562877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009900338,0.0008652634,0.00055660243,0.00078088115,0.0006772798,0.0017162054,0.001824039,0.0009508922,0.022419589],"category_scores_gemma":[0.0033267874,0.00048282972,0.0016721953,0.0010222854,0.0015294745,0.0038865914,0.0035330816,0.0034962443,0.0054300763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001714822,0.00007659247,0.00033036948,0.00029631445,0.000043656477,0.00021833235,0.0007034646,0.012884664,0.012088626,0.7448547,0.01777913,0.21055262],"study_design_scores_gemma":[0.000051861556,0.000046006993,0.0001907328,0.000060133614,0.00004355535,0.00014928501,0.00011674639,0.07178327,0.013920575,0.8295584,0.08404289,0.00003653913],"about_ca_topic_score_codex":0.0011940632,"about_ca_topic_score_gemma":0.0013233193,"teacher_disagreement_score":0.022419589,"about_ca_system_score_codex":0.0006764157,"about_ca_system_score_gemma":0.0006187724,"threshold_uncertainty_score":0.07500106},"labels":[],"label_agreement":null},{"id":"W4402135519","doi":"10.1007/978-3-031-70536-6_14","title":"Robust Handwritten Signature Representation with Continual Learning of Synthetic Data over Predefined Real Feature Space","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Representation (politics); Pattern recognition (psychology); Signature (topology); Feature vector; Feature (linguistics); Feature learning; Space (punctuation); Speech recognition; Machine learning","score_opus":0.024408456933704168,"score_gpt":0.2628783702655003,"score_spread":0.23846991333179615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402135519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022601482,0.00016470093,0.97468716,0.00007153985,0.00004874418,0.00002823861,0.00008759338,0.0013772753,0.00093325187],"genre_scores_gemma":[0.53675705,0.00029566474,0.45299426,0.00009958009,0.00007347815,0.00009059765,0.00093440415,0.0003576358,0.008397317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.000070560716,0.000027754571,0.00011884268,0.0001863856,0.000045208195],"domain_scores_gemma":[0.99918705,0.0001970397,0.00009744968,0.0002600381,0.00022611188,0.000032304368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067815103,0.0005089207,0.00056849164,0.00046980722,0.0001610174,0.00067504204,0.0008192221,0.00054956955,0.0020947014],"category_scores_gemma":[0.0014989838,0.00026770044,0.000550434,0.00073692837,0.00044460365,0.0009800247,0.0008726876,0.0009364479,0.0011351039],"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.00030093425,0.000110261826,0.00048526216,0.000109391345,0.000047166377,0.000074368276,0.000049116283,0.20149726,0.074823946,0.004459206,0.0028938798,0.71514916],"study_design_scores_gemma":[0.0000033209049,0.000055116183,0.0002469912,0.000005196585,0.0000048332017,0.00007838401,0.0000071399036,0.98061556,0.016794499,0.0011302475,0.0010510073,0.00000760835],"about_ca_topic_score_codex":0.0010736173,"about_ca_topic_score_gemma":0.0012236194,"teacher_disagreement_score":0.0020947014,"about_ca_system_score_codex":0.0003520788,"about_ca_system_score_gemma":0.00062159187,"threshold_uncertainty_score":0.0070075393},"labels":[],"label_agreement":null},{"id":"W4402145822","doi":"10.1007/978-3-031-71112-1_10","title":"From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Emulation; Lemma (botany); Computer science; Algebra over a field; Relation (database); Interpretation (philosophy); Transformation (genetics); Theoretical computer science; Programming language; Mathematics; Pure mathematics; Data mining","score_opus":0.010909739660623159,"score_gpt":0.2545275003182736,"score_spread":0.24361776065765042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402145822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019743683,0.000580081,0.8832818,0.0012339688,0.00028908352,0.000053927695,0.000115263836,0.0025139016,0.09218826],"genre_scores_gemma":[0.7268845,0.00073334354,0.25077513,0.0005079412,0.0003252138,0.00013630564,0.00035741736,0.0015783099,0.018701863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876606,0.00048648537,0.000074474534,0.00023245664,0.00030084164,0.00013966532],"domain_scores_gemma":[0.99793684,0.0011934196,0.000049168033,0.0005953888,0.00016686606,0.000058297457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179594,0.0004158871,0.0005714774,0.00065950525,0.0010042221,0.004578154,0.0015167183,0.0009654767,0.010508836],"category_scores_gemma":[0.0038005637,0.00067129766,0.0011692747,0.0008567346,0.0037858333,0.01130566,0.0029423917,0.0028699902,0.001983084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020554178,0.000011301074,0.000041213065,0.000023775032,0.0000036473825,0.000037446454,0.00030630265,0.00059831823,0.0010710219,0.9856227,0.0011381735,0.011125524],"study_design_scores_gemma":[0.000011586813,0.000013625535,0.00004713174,0.00002190204,0.000011335991,0.000109124776,0.00010604481,0.014549222,0.004209202,0.9642434,0.01666511,0.000012286927],"about_ca_topic_score_codex":0.00088296336,"about_ca_topic_score_gemma":0.00087419647,"teacher_disagreement_score":0.010508836,"about_ca_system_score_codex":0.0012815936,"about_ca_system_score_gemma":0.0008647207,"threshold_uncertainty_score":0.035155535},"labels":[],"label_agreement":null},{"id":"W4402159308","doi":"10.1007/978-981-97-5578-3_18","title":"FedSAR for Heterogeneous Federated learning：A Client Selection Algorithm Based on SARSA","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence; Federated learning; Machine learning; Distributed computing","score_opus":0.02127819542283003,"score_gpt":0.2649645968226507,"score_spread":0.2436864013998207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402159308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025023608,0.00019593399,0.9648447,0.00010399577,0.000072744835,0.000101641264,0.000116767565,0.008073754,0.001466823],"genre_scores_gemma":[0.4469546,0.00011685675,0.54597986,0.00017766043,0.0000690374,0.00019017623,0.000668897,0.00033702742,0.0055058952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988003,0.00032179366,0.00008637895,0.00029840166,0.00032370506,0.00016940087],"domain_scores_gemma":[0.99872774,0.00029914416,0.000053043488,0.0005482012,0.00027355805,0.0000982254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020373352,0.0005989185,0.0013286441,0.0011756048,0.0010360162,0.0017111468,0.0019573746,0.0009661075,0.004417447],"category_scores_gemma":[0.0029071758,0.0003102796,0.0010086284,0.0011703852,0.00060533214,0.0020979063,0.0022582298,0.0013567506,0.0017329693],"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.001644988,0.00070499326,0.0032101995,0.000121869074,0.00018904763,0.00022336838,0.00014684076,0.09772913,0.017610526,0.024007306,0.01140759,0.8430041],"study_design_scores_gemma":[0.00003466305,0.00007382904,0.00032127788,0.000007898692,0.000021906188,0.00011406591,0.00003372338,0.97904944,0.0082789315,0.009864274,0.0021848627,0.000015230528],"about_ca_topic_score_codex":0.0023207655,"about_ca_topic_score_gemma":0.0024943787,"teacher_disagreement_score":0.004417447,"about_ca_system_score_codex":0.0008527739,"about_ca_system_score_gemma":0.0016095823,"threshold_uncertainty_score":0.014777839},"labels":[],"label_agreement":null},{"id":"W4402177478","doi":"10.1007/978-3-031-71033-9_26","title":"Matrix Rationalization via Partial Orders","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Rationalization (economics); Computer science; Matrix (chemical analysis); Algorithm; Management; Materials science","score_opus":0.010578561950957502,"score_gpt":0.25027931553513566,"score_spread":0.23970075358417817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402177478","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.022248138,0.0013913697,0.6262428,0.0017887979,0.00040865995,0.00008247819,0.00034102672,0.00073203497,0.34676477],"genre_scores_gemma":[0.60191435,0.0031159357,0.18761916,0.0006309701,0.000681803,0.00020032605,0.00078107615,0.00093151344,0.20412484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945444,0.00012359538,0.000025221381,0.00009252366,0.00023936821,0.00006487961],"domain_scores_gemma":[0.9996074,0.00017738098,0.00002779968,0.00008438965,0.00007949357,0.00002359038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005404395,0.00073351304,0.000692288,0.00090681884,0.0007678534,0.0026189724,0.0007446802,0.00048095259,0.020163074],"category_scores_gemma":[0.0014090261,0.0004726068,0.00084800395,0.0013176993,0.001953943,0.003704186,0.0011840758,0.0024628243,0.004016345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011503286,0.000009010813,0.000011480074,0.000023315413,0.0000034501268,0.000012092809,0.00004345789,0.001415797,0.00048403905,0.9843381,0.0021993364,0.011448309],"study_design_scores_gemma":[0.000007177093,0.000008299603,0.000022942639,0.000008700282,0.0000044713775,0.000026133312,0.000022409547,0.0060660136,0.00064255553,0.9809481,0.012237655,0.000005567378],"about_ca_topic_score_codex":0.0011132444,"about_ca_topic_score_gemma":0.0013924245,"teacher_disagreement_score":0.020163074,"about_ca_system_score_codex":0.0013561182,"about_ca_system_score_gemma":0.000556455,"threshold_uncertainty_score":0.06745225},"labels":[],"label_agreement":null},{"id":"W4402177679","doi":"10.1007/978-3-031-71033-9_23","title":"Matroid Bayesian Online Selection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Matroid; Selection (genetic algorithm); Bayesian probability; Artificial intelligence; Machine learning; Mathematics; Discrete mathematics","score_opus":0.055674133154967324,"score_gpt":0.3871011574410021,"score_spread":0.33142702428603477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402177679","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.009849796,0.002367652,0.8768477,0.0017758085,0.0004985297,0.000091236776,0.0006073146,0.0009922808,0.106969796],"genre_scores_gemma":[0.39311758,0.0036680219,0.35318953,0.0015624879,0.0019889271,0.00039058793,0.0020969266,0.0009938084,0.24299209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898785,0.00035764682,0.000031715335,0.00016608521,0.00037504593,0.00008167282],"domain_scores_gemma":[0.99822754,0.0009934626,0.000078899444,0.00037226526,0.00022127388,0.000106691696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012663713,0.0006947651,0.0010833787,0.0006589649,0.000452916,0.0015177968,0.0013664607,0.0009841907,0.02407725],"category_scores_gemma":[0.004937526,0.00041943812,0.00043086358,0.0015509578,0.00061998965,0.0017323912,0.0012447372,0.0019040385,0.00662781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033708758,0.00015928753,0.0003880711,0.00021815815,0.000055725508,0.00010936286,0.00005666479,0.060214795,0.0029146124,0.33738667,0.10198703,0.49617264],"study_design_scores_gemma":[0.00006472185,0.00012708157,0.0004612294,0.000062165935,0.000030097308,0.0003343983,0.00002609598,0.50020623,0.0023004229,0.44977298,0.046586618,0.000027938597],"about_ca_topic_score_codex":0.00054061133,"about_ca_topic_score_gemma":0.0009531157,"teacher_disagreement_score":0.02407725,"about_ca_system_score_codex":0.000812887,"about_ca_system_score_gemma":0.000749199,"threshold_uncertainty_score":0.08054638},"labels":[],"label_agreement":null},{"id":"W4402205374","doi":"10.1007/978-3-031-71112-1_3","title":"Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Golden ratio; Computer science; Representation (politics); Quadratic equation; Automaton; Base (topology); Finite-state machine; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.05898430741353069,"score_gpt":0.3065921163709754,"score_spread":0.2476078089574447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402205374","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.24148458,0.00045209008,0.6856766,0.0006942437,0.00048984116,0.000103187966,0.0004955486,0.0068932977,0.063710675],"genre_scores_gemma":[0.8076814,0.00011753587,0.18130392,0.00016345948,0.000084498846,0.000081446626,0.0005433585,0.0009324487,0.009091949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.00010609091,0.0000348924,0.00012915258,0.00013534623,0.00008126542],"domain_scores_gemma":[0.9983033,0.0010429989,0.00009387191,0.0002832187,0.00018857923,0.00008788394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355946,0.0007639927,0.000907778,0.0013042246,0.0010241712,0.0031857858,0.0012444651,0.0009453768,0.011350125],"category_scores_gemma":[0.005765899,0.00044558058,0.0010209593,0.0013422027,0.0015354275,0.0047189826,0.0016798403,0.0018288376,0.002083858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054058986,0.0001711537,0.0022558242,0.00021992358,0.00005119151,0.00026551614,0.000501435,0.06807197,0.0087835975,0.7896371,0.009826567,0.11967506],"study_design_scores_gemma":[0.000039408213,0.000042818556,0.00021468468,0.00003247191,0.000018929648,0.000046495767,0.00009940471,0.24560519,0.0048379297,0.7457591,0.003275865,0.000027610062],"about_ca_topic_score_codex":0.0025854276,"about_ca_topic_score_gemma":0.0034201562,"teacher_disagreement_score":0.011350125,"about_ca_system_score_codex":0.001557485,"about_ca_system_score_gemma":0.000732459,"threshold_uncertainty_score":0.037969947},"labels":[],"label_agreement":null},{"id":"W4402205433","doi":"10.1007/978-3-031-71112-1_14","title":"State Complexity of the Minimal Star Basis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Basis (linear algebra); Star (game theory); Theoretical computer science; Algorithm; Mathematics; Geometry","score_opus":0.02902338772168808,"score_gpt":0.25449557590671984,"score_spread":0.22547218818503176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402205433","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.4676944,0.0011244775,0.3492663,0.004743351,0.00023883618,0.00015318822,0.0026920587,0.0007254884,0.1733619],"genre_scores_gemma":[0.93907714,0.00070887647,0.02977845,0.00031688757,0.00023054292,0.00015927384,0.001541382,0.00024800512,0.02793958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990663,0.00020332859,0.000054758297,0.00014364779,0.00033969202,0.00019231845],"domain_scores_gemma":[0.99613476,0.0027142717,0.00015843428,0.00048391463,0.0003538056,0.00015493724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008557127,0.0004503218,0.0010893283,0.00089013815,0.0011678927,0.0037747212,0.0013474007,0.0010691972,0.016540458],"category_scores_gemma":[0.004731833,0.0005010627,0.0011891475,0.0016171634,0.001751391,0.0058808564,0.0019927248,0.0030938175,0.0015034891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010453185,0.000042187145,0.00022760742,0.00007674315,0.000011770538,0.000028967519,0.00013600227,0.008364818,0.00091100944,0.9757027,0.003053185,0.011340513],"study_design_scores_gemma":[0.000010579988,0.000011188792,0.000089896115,0.0000068691115,0.0000067741958,0.000017604303,0.000021824184,0.021953613,0.00046238693,0.97646683,0.00094556145,0.0000069555326],"about_ca_topic_score_codex":0.0018595603,"about_ca_topic_score_gemma":0.0016888268,"teacher_disagreement_score":0.016540458,"about_ca_system_score_codex":0.00171606,"about_ca_system_score_gemma":0.0014680059,"threshold_uncertainty_score":0.055333376},"labels":[],"label_agreement":null},{"id":"W4402210774","doi":"10.1007/978-3-031-70903-6_16","title":"How to Better Fit Reinforcement Learning for Pentesting: A New Hierarchical Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Machine learning","score_opus":0.03748018830220856,"score_gpt":0.26538449634167427,"score_spread":0.2279043080394657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402210774","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.004678296,0.00023407848,0.9903931,0.00032358422,0.00008000049,0.00004026554,0.00004070655,0.00090889324,0.0033010517],"genre_scores_gemma":[0.1875816,0.0002729496,0.8032508,0.00039493857,0.0000835305,0.00014556534,0.00015122491,0.00066478236,0.0074546197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991721,0.00025840016,0.000053169562,0.00020275312,0.00019343258,0.00012027133],"domain_scores_gemma":[0.9985228,0.0006218316,0.00008942576,0.0004160154,0.0002414848,0.0001083853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011632611,0.0008940043,0.0012985275,0.00046913183,0.00054970704,0.0011652707,0.0022693726,0.0014610487,0.011104683],"category_scores_gemma":[0.005796945,0.0005665017,0.0010460274,0.00057970756,0.00084973744,0.0033046706,0.0020907829,0.0029506946,0.0018156845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016067251,0.00021787983,0.0008426856,0.00024366629,0.00011117473,0.00011033976,0.0001701271,0.519734,0.005465424,0.072175324,0.0093315225,0.39143717],"study_design_scores_gemma":[0.000016366474,0.000038103706,0.00007766568,0.000017091927,0.00001633211,0.000021550368,0.000017376587,0.9588696,0.00092970586,0.037638288,0.002347161,0.000010786591],"about_ca_topic_score_codex":0.0062777414,"about_ca_topic_score_gemma":0.009621477,"teacher_disagreement_score":0.011104683,"about_ca_system_score_codex":0.0009387751,"about_ca_system_score_gemma":0.0015742307,"threshold_uncertainty_score":0.037148833},"labels":[],"label_agreement":null},{"id":"W4402210793","doi":"10.1007/978-3-031-70903-6_14","title":"Leveraging Transformer Architecture for Effective Trajectory-User Linking (TUL) Attack and Its Mitigation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"Université du Québec à Montréal; Université Laval","funders":"","keywords":"Computer science; Architecture; Transformer; Trajectory; Real-time computing; Human–computer interaction; Electrical engineering; Engineering","score_opus":0.018719779828186435,"score_gpt":0.2899277800446436,"score_spread":0.27120800021645713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402210793","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.019895598,0.00019747764,0.96786636,0.0001463324,0.00011675006,0.00010800211,0.00008170064,0.0056480365,0.0059397537],"genre_scores_gemma":[0.8341241,0.00029609905,0.15598148,0.00023564338,0.000053317886,0.00008216354,0.00041438226,0.00030194904,0.008510835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936277,0.00009981243,0.000041243406,0.0001109602,0.00023048215,0.00015474917],"domain_scores_gemma":[0.9991621,0.00012310265,0.00005670009,0.00026254158,0.0003240985,0.00007147828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007149047,0.0006428267,0.00050221774,0.0007913573,0.00051767146,0.0012776684,0.0014782028,0.00077716005,0.005412077],"category_scores_gemma":[0.0016253493,0.00026974236,0.00044040027,0.0005632202,0.0005370588,0.0026204265,0.0023452044,0.0010869338,0.0027556338],"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.0010112656,0.0004785612,0.0054303566,0.00031797643,0.00017972608,0.0006608813,0.00046682,0.09813174,0.10172644,0.06332196,0.017893359,0.710381],"study_design_scores_gemma":[0.000025757192,0.00028812772,0.00064696727,0.000032272023,0.00011892595,0.00057825627,0.00016068688,0.90009373,0.055372663,0.026778327,0.015871894,0.000032322136],"about_ca_topic_score_codex":0.0024930064,"about_ca_topic_score_gemma":0.0034641363,"teacher_disagreement_score":0.005412077,"about_ca_system_score_codex":0.000555351,"about_ca_system_score_gemma":0.001202524,"threshold_uncertainty_score":0.018105209},"labels":[],"label_agreement":null},{"id":"W4402216230","doi":"10.1007/978-3-031-70879-4_1","title":"Attesting Distributional Properties of Training Data for Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Training (meteorology); Artificial intelligence; Training set; Machine learning","score_opus":0.10503845981096196,"score_gpt":0.29123131509256234,"score_spread":0.18619285528160037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402216230","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.015393698,0.0005467495,0.9766922,0.0020497974,0.0001809907,0.000045184504,0.00022522596,0.0007376731,0.004128501],"genre_scores_gemma":[0.6928844,0.0016874712,0.29010662,0.0016369912,0.001003833,0.00032310036,0.0017072803,0.0008851933,0.009765086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9889853,0.0049274256,0.0008250732,0.0014596841,0.003319871,0.00048266718],"domain_scores_gemma":[0.91779923,0.047962297,0.002444742,0.028819453,0.0024098265,0.00056432147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010857903,0.0006589266,0.0012674116,0.0013216169,0.001306478,0.0035100838,0.0021734983,0.0022343295,0.0026187745],"category_scores_gemma":[0.060294993,0.0009262308,0.0012985565,0.0018446759,0.0051846122,0.008627868,0.0060098334,0.007632528,0.0015549088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045659006,0.00016205534,0.004320431,0.00031081037,0.00012262678,0.0002820245,0.0009608418,0.037162643,0.010533885,0.6902404,0.012714617,0.24273324],"study_design_scores_gemma":[0.000015147949,0.00006913903,0.00050592434,0.00005240383,0.000020700427,0.00034356638,0.00008533281,0.14095645,0.008808151,0.8437101,0.005412953,0.000020147485],"about_ca_topic_score_codex":0.00028885886,"about_ca_topic_score_gemma":0.00034149145,"teacher_disagreement_score":0.010857903,"about_ca_system_score_codex":0.0012178139,"about_ca_system_score_gemma":0.0015245185,"threshold_uncertainty_score":0.057422817},"labels":[],"label_agreement":null},{"id":"W4402268687","doi":"10.1007/978-3-031-70819-0_25","title":"GCC Aware Glaucoma Detection Using Macula OCT Image Analysis Based on Deep CNN","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Glaucoma and retinal disorders","field":"Medicine","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":"Trent University","funders":"","keywords":"Computer science; Glaucoma; Artificial intelligence; Computer vision; Computer graphics (images); Ophthalmology; Medicine","score_opus":0.010789123016365018,"score_gpt":0.26242549288517947,"score_spread":0.25163636986881444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402268687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28097722,0.008581262,0.6764033,0.001082038,0.00074860256,0.00033409538,0.002958256,0.0066383393,0.022276806],"genre_scores_gemma":[0.749866,0.0037602098,0.22553985,0.0006656219,0.00029951672,0.00008927777,0.002083081,0.00027807968,0.017418355],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999273,0.0000054331063,0.000003665658,0.000017292577,0.000025745283,0.000020597856],"domain_scores_gemma":[0.9999095,0.000021654767,0.000010018999,0.000010759094,0.000039435457,0.00000857147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015006533,0.0006036878,0.00038252815,0.0009877444,0.00016094325,0.0005496324,0.00036166623,0.0004152683,0.002073195],"category_scores_gemma":[0.0003093613,0.00023154552,0.0005675404,0.00039927568,0.00011114956,0.0003774889,0.000362069,0.00034337727,0.00068417785],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003403327,0.0001517815,0.009274684,0.00022831367,0.00017908245,0.000687143,0.000051127106,0.020046545,0.11695553,0.0014312346,0.012205993,0.8384483],"study_design_scores_gemma":[0.000025159155,0.00016905699,0.021355925,0.00009818536,0.0002722444,0.0014867889,0.00006092393,0.90571123,0.060843784,0.0030716609,0.006858278,0.000046743015],"about_ca_topic_score_codex":0.005681552,"about_ca_topic_score_gemma":0.012868338,"teacher_disagreement_score":0.005681552,"about_ca_system_score_codex":0.0002724737,"about_ca_system_score_gemma":0.0004219315,"threshold_uncertainty_score":0.011296928},"labels":[],"label_agreement":null},{"id":"W4402269314","doi":"10.1007/978-3-031-70816-9_9","title":"COVID-19 Detection Based on Deep Features and SVM","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Support vector machine; Coronavirus disease 2019 (COVID-19); Artificial intelligence; Pattern recognition (psychology); Medicine","score_opus":0.020805698676062273,"score_gpt":0.3016055703525714,"score_spread":0.2807998716765091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402269314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079811744,0.0029537808,0.8862008,0.0009940298,0.0013765023,0.0004921767,0.0025065162,0.0055364594,0.020128122],"genre_scores_gemma":[0.54514176,0.0012999548,0.4162395,0.0006737076,0.00047481194,0.00026568363,0.007858961,0.0004037551,0.027641919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906117,0.00008206876,0.00006004616,0.0002265993,0.0003710562,0.00019908645],"domain_scores_gemma":[0.9992379,0.00017181574,0.0000622362,0.0000958991,0.00035847438,0.00007385124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997063,0.0011525293,0.0012545222,0.0022671376,0.0006544365,0.0017282137,0.0012439401,0.0015247784,0.0038026406],"category_scores_gemma":[0.0018920475,0.00037864712,0.00086920796,0.0012409313,0.00034352607,0.0011878251,0.0016384037,0.0011984783,0.003013588],"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.00054948113,0.0003021675,0.012563872,0.00014464154,0.0000965592,0.00041727477,0.000037009748,0.013282729,0.029200928,0.004362978,0.041702658,0.8973397],"study_design_scores_gemma":[0.000031069198,0.0002143415,0.006985396,0.00005782176,0.00008182101,0.0008613741,0.000055915283,0.93713844,0.036012046,0.005594404,0.012923828,0.000043635624],"about_ca_topic_score_codex":0.0033913187,"about_ca_topic_score_gemma":0.0043068756,"teacher_disagreement_score":0.0038026406,"about_ca_system_score_codex":0.00067379867,"about_ca_system_score_gemma":0.0011660219,"threshold_uncertainty_score":0.012721062},"labels":[],"label_agreement":null},{"id":"W4402269634","doi":"10.1007/978-3-031-70816-9_15","title":"BABot: A Framework for the LLM-Based Chatbot Supporting Business Analytics in e-Commerce","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Chatbot; Analytics; World Wide Web; E-commerce; Data science","score_opus":0.02724328856509615,"score_gpt":0.28204057339450045,"score_spread":0.2547972848294043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402269634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004797218,0.00029117637,0.8358391,0.00040807916,0.00024389467,0.0005773389,0.0012684024,0.14518137,0.0113935005],"genre_scores_gemma":[0.14292666,0.00045510806,0.78066146,0.0012421013,0.0002358902,0.0019544873,0.007382693,0.020554813,0.044586815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982084,0.0005969633,0.00015801187,0.00030743107,0.00053900335,0.00019010746],"domain_scores_gemma":[0.99758244,0.001116492,0.000119039774,0.0004933516,0.0002957526,0.00039290288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002427503,0.0012565701,0.0010810611,0.001601854,0.0014337464,0.0040969085,0.0042430554,0.0031808335,0.023487013],"category_scores_gemma":[0.0064093485,0.0014646762,0.0012254221,0.00095461577,0.0012367052,0.0051067667,0.0070094685,0.0028987373,0.014834338],"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.0023355456,0.0013172623,0.0039496524,0.0022752068,0.00026868164,0.0014398325,0.0044710846,0.019305041,0.050686512,0.18208125,0.23969452,0.49217552],"study_design_scores_gemma":[0.00028057158,0.00031641955,0.0012897224,0.0004453654,0.00012665988,0.00077892485,0.0006115437,0.44041613,0.027051084,0.09542644,0.43301663,0.00024047447],"about_ca_topic_score_codex":0.0040369844,"about_ca_topic_score_gemma":0.004870058,"teacher_disagreement_score":0.023487013,"about_ca_system_score_codex":0.001177275,"about_ca_system_score_gemma":0.001482632,"threshold_uncertainty_score":0.078571856},"labels":[],"label_agreement":null},{"id":"W4402273641","doi":"10.1007/978-3-031-70896-1_9","title":"SerdeSniffer: Enhancing Java Deserialization Vulnerability Detection with Function Summaries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Java; Vulnerability (computing); Function (biology); Programming language; Computer security","score_opus":0.010127307794849234,"score_gpt":0.23673702789905238,"score_spread":0.22660972010420313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402273641","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.109730594,0.0013971245,0.5058285,0.0005449532,0.00056935934,0.00024945854,0.0012526581,0.33440426,0.04602316],"genre_scores_gemma":[0.63395923,0.00068873086,0.2715574,0.00081908284,0.00016817053,0.0001283747,0.0032985217,0.013911626,0.075468965],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999387,0.00007362736,0.000030998974,0.00010918383,0.0003358288,0.00006333888],"domain_scores_gemma":[0.9991173,0.00028250937,0.000075516924,0.00022604286,0.00024827797,0.00005022856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054051855,0.0012190987,0.00040734475,0.0011866863,0.00028104254,0.0010102441,0.0010341647,0.0005393593,0.007210873],"category_scores_gemma":[0.0020251318,0.00042011522,0.00045924415,0.0003944739,0.00027899485,0.0016624865,0.0009823528,0.00076056155,0.0037257914],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006467109,0.0003597426,0.0051539987,0.00034179128,0.00008246507,0.00030025674,0.00019477465,0.011355728,0.07402658,0.005832192,0.06923207,0.83247364],"study_design_scores_gemma":[0.00012449839,0.0006476893,0.0052362443,0.00014098088,0.00019167866,0.0012204059,0.00009414621,0.52518237,0.3316414,0.011857322,0.12353334,0.0001299893],"about_ca_topic_score_codex":0.0012217438,"about_ca_topic_score_gemma":0.0029197133,"teacher_disagreement_score":0.007210873,"about_ca_system_score_codex":0.00037787846,"about_ca_system_score_gemma":0.00053419237,"threshold_uncertainty_score":0.024122775},"labels":[],"label_agreement":null},{"id":"W4402278421","doi":"10.1007/978-3-031-70890-9_2","title":"TurboTLS: TLS Connection Establishment with 1 Less Round Trip","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power Line Communications and Noise","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":"University of Waterloo","funders":"","keywords":"Computer science; Connection (principal bundle); Mathematics; Geometry","score_opus":0.018338702843183414,"score_gpt":0.23236955379927746,"score_spread":0.21403085095609403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402278421","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.05022572,0.000537087,0.7183751,0.00068139186,0.0019220869,0.0010854703,0.0016699524,0.15190905,0.07359415],"genre_scores_gemma":[0.7059135,0.00027738756,0.18467785,0.0008312586,0.0006447843,0.0005336149,0.0034658425,0.0049515916,0.09870419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.0002654038,0.00009553553,0.00022873894,0.00045684722,0.0003545705],"domain_scores_gemma":[0.99676216,0.00037746702,0.00017556391,0.0017065968,0.00069222716,0.00028582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413601,0.0010389225,0.00084707607,0.0021111348,0.001780899,0.002929168,0.0028431586,0.0012457406,0.05006337],"category_scores_gemma":[0.003151938,0.0006859256,0.000707007,0.0012331653,0.00093903753,0.00296918,0.0037695747,0.0015216592,0.021530306],"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.0030732928,0.000501367,0.0032228546,0.00057276036,0.00015270892,0.000977827,0.0005262234,0.021732729,0.047318686,0.030290917,0.1873627,0.7042679],"study_design_scores_gemma":[0.0004907329,0.001313952,0.0033688068,0.00025544164,0.00026344383,0.0030326725,0.00050088007,0.5845368,0.12605762,0.031214412,0.24857071,0.0003945288],"about_ca_topic_score_codex":0.0029820746,"about_ca_topic_score_gemma":0.0050746365,"teacher_disagreement_score":0.05006337,"about_ca_system_score_codex":0.0011505065,"about_ca_system_score_gemma":0.0022373525,"threshold_uncertainty_score":0.16747868},"labels":[],"label_agreement":null},{"id":"W4402278449","doi":"10.1007/978-3-031-70890-9_6","title":"Social Control and Interactivity in Anonymous Public Events","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Interactivity; Computer science; Control (management); Computer security; Human–computer interaction; World Wide Web; Artificial intelligence","score_opus":0.014680393380321384,"score_gpt":0.25366800323464894,"score_spread":0.23898760985432757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402278449","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.55405873,0.0010707999,0.12130299,0.0027454768,0.00015057757,0.00006295844,0.00012813034,0.00013056955,0.32034975],"genre_scores_gemma":[0.99262106,0.00008084401,0.0010686681,0.000019693867,0.000040743682,0.000018521825,0.000014592147,0.000008832169,0.006127021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99871254,0.00068506727,0.000041200383,0.00017110111,0.00020721981,0.00018289003],"domain_scores_gemma":[0.99318683,0.0053168093,0.0005841737,0.0003961406,0.00018702947,0.00032898528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013045135,0.0002885107,0.00026206137,0.0007251153,0.0016012691,0.003937729,0.00067011704,0.00095112226,0.0066388515],"category_scores_gemma":[0.0066135563,0.00026185781,0.00038290466,0.000759317,0.0037496968,0.0043507516,0.0015782387,0.001062523,0.0003047379],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012576515,0.00007286632,0.0025698012,0.00003593863,0.00002275043,0.0001832116,0.0054283855,0.005505576,0.0006760549,0.96806204,0.00088474766,0.01643283],"study_design_scores_gemma":[0.000027445722,0.00005276908,0.0046216883,0.000020704518,0.000023674203,0.00010745045,0.003910297,0.024315117,0.0005115216,0.9592134,0.0071701026,0.000025825244],"about_ca_topic_score_codex":0.0020407778,"about_ca_topic_score_gemma":0.0015667896,"teacher_disagreement_score":0.0066388515,"about_ca_system_score_codex":0.00096883305,"about_ca_system_score_gemma":0.0003857511,"threshold_uncertainty_score":0.022209167},"labels":[],"label_agreement":null},{"id":"W4402309980","doi":"10.1007/978-3-031-71294-4","title":"Logic-Based Program Synthesis and Transformation","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"University of Toronto","keywords":"Computer science; Logic program; Programming language; Transformation (genetics); Program transformation; Program synthesis; Theoretical computer science; Logic programming","score_opus":0.018928654299866874,"score_gpt":0.25401728933596335,"score_spread":0.23508863503609648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402309980","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029393437,0.00038376817,0.9706938,0.00013418587,0.000098648205,0.00009255165,0.00012707867,0.0032771039,0.022253511],"genre_scores_gemma":[0.1377313,0.0011023154,0.8312359,0.0002595627,0.00008327734,0.00036676365,0.0007239233,0.0015267542,0.026970137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993703,0.00011876961,0.000045470184,0.00013186604,0.0002624621,0.000071113325],"domain_scores_gemma":[0.99957484,0.00019608272,0.000018813036,0.000119040706,0.00008176946,0.000009413676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005114341,0.0008504798,0.0006254847,0.0008653917,0.000530504,0.0014610814,0.0012149891,0.0005687561,0.013378642],"category_scores_gemma":[0.0011617834,0.00055702013,0.0012288855,0.0010373534,0.0011208775,0.0016578363,0.0011651341,0.0015565094,0.0034870992],"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.00015920741,0.000109321314,0.00012963868,0.0004979891,0.000049920047,0.00010374269,0.0001649664,0.03297436,0.029331276,0.41380748,0.010730512,0.5119417],"study_design_scores_gemma":[0.000121271165,0.00011730431,0.00014580935,0.00015112518,0.0001106303,0.00025745126,0.000078061305,0.23381266,0.09252432,0.57010645,0.10253402,0.00004094321],"about_ca_topic_score_codex":0.0010617352,"about_ca_topic_score_gemma":0.0013013466,"teacher_disagreement_score":0.013378642,"about_ca_system_score_codex":0.0008440523,"about_ca_system_score_gemma":0.00096581987,"threshold_uncertainty_score":0.044756055},"labels":[],"label_agreement":null},{"id":"W4402309991","doi":"10.1007/978-3-031-71294-4_1","title":"Parallel Assembly Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Computer graphics (images); Engineering drawing; Engineering","score_opus":0.011242479700179803,"score_gpt":0.2119298350103463,"score_spread":0.2006873553101665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402309991","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076052053,0.0019488895,0.71554834,0.0002412289,0.0006192568,0.00013828272,0.00046158288,0.0047913217,0.26864588],"genre_scores_gemma":[0.19965224,0.0028745318,0.5073902,0.00031530176,0.00033381107,0.00033416142,0.002669609,0.0017918855,0.2846382],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975866,0.000023114686,0.000009016759,0.00006344768,0.0001221627,0.000023547802],"domain_scores_gemma":[0.9998779,0.000020914847,0.0000074503528,0.000053452262,0.000033313892,0.0000069615803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017784092,0.0010791344,0.0006529839,0.00073044177,0.00063478004,0.00085455686,0.00085707015,0.0004771636,0.038068287],"category_scores_gemma":[0.00032039447,0.0006624632,0.00074059877,0.00092041004,0.0004002551,0.00083291595,0.00094961014,0.00084889325,0.014224378],"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.00024500658,0.00011472587,0.00018684233,0.0005241375,0.00006632534,0.00016879509,0.00008712366,0.08071501,0.09219598,0.09683752,0.037120856,0.6917376],"study_design_scores_gemma":[0.0000774826,0.00035953085,0.0007687706,0.00014020923,0.000098818346,0.0006850475,0.00007023052,0.25511014,0.14806363,0.12482985,0.46973982,0.0000564247],"about_ca_topic_score_codex":0.0007095845,"about_ca_topic_score_gemma":0.0013323867,"teacher_disagreement_score":0.038068287,"about_ca_system_score_codex":0.00056451117,"about_ca_system_score_gemma":0.00064374483,"threshold_uncertainty_score":0.1273511},"labels":[],"label_agreement":null},{"id":"W4402323267","doi":"10.1007/978-3-031-71533-4_11","title":"Behavioural Contagion in Human and Artificial Multi-agent Systems: A Computational Modeling Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent 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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Artificial life","score_opus":0.05682188397281785,"score_gpt":0.2752262199812551,"score_spread":0.21840433600843728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402323267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07169839,0.0035726398,0.8275168,0.005521615,0.0003624945,0.000082195584,0.00012492698,0.00019901495,0.09092199],"genre_scores_gemma":[0.9047925,0.0029279578,0.06607474,0.00041184854,0.00033596437,0.0001926156,0.00008693638,0.0000785981,0.025098875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996582,0.00017520468,0.000015844196,0.000039427614,0.000077800745,0.000033460692],"domain_scores_gemma":[0.99853575,0.0011829378,0.000098514014,0.000069085705,0.00007336721,0.000040358642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160021,0.0005691078,0.00050652586,0.00060728623,0.000582479,0.0016944709,0.0013559368,0.0016849522,0.0029907795],"category_scores_gemma":[0.0023300669,0.00038879394,0.0008221952,0.0006688601,0.002032622,0.0026099365,0.0010740171,0.0015317183,0.00028683766],"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.00001148708,0.000038409828,0.0005084641,0.00008455132,0.00003333516,0.00014781761,0.00048737152,0.10276558,0.0006935642,0.8867853,0.0009589599,0.007485251],"study_design_scores_gemma":[0.00000723009,0.00003189092,0.00039608785,0.000030185569,0.000030110039,0.00011132437,0.00016750555,0.52845985,0.0002846362,0.46617472,0.0042889216,0.000017556935],"about_ca_topic_score_codex":0.0043317447,"about_ca_topic_score_gemma":0.0034042655,"teacher_disagreement_score":0.0043317447,"about_ca_system_score_codex":0.0011320754,"about_ca_system_score_gemma":0.0009191603,"threshold_uncertainty_score":0.010005176},"labels":[],"label_agreement":null},{"id":"W4402323711","doi":"10.1007/978-3-031-71533-4_24","title":"“Value” Emerges from Imperfect Memory","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"Université de Montréal","funders":"","keywords":"Computer science; Imperfect; Value (mathematics); Machine learning","score_opus":0.01914579287497921,"score_gpt":0.2465225574670319,"score_spread":0.2273767645920527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402323711","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.46730438,0.0013500624,0.15505543,0.018680116,0.0007375411,0.00003129733,0.0004292896,0.0004765176,0.3559354],"genre_scores_gemma":[0.9843137,0.00028252378,0.0041558715,0.00036581903,0.00016310975,0.000015835296,0.000061678475,0.00006315728,0.010578312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968517,0.00006589322,0.000014930397,0.000047733778,0.00011877419,0.00006752045],"domain_scores_gemma":[0.9976223,0.0013559556,0.00021853502,0.00040855954,0.00021660907,0.00017798043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081977,0.00026749788,0.0006325512,0.0004609841,0.00066220056,0.0025760368,0.0010638625,0.001740992,0.0073709665],"category_scores_gemma":[0.006512051,0.00032769394,0.0003785289,0.0005223299,0.0035695557,0.0071500633,0.0014761862,0.0023975736,0.00057137175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018030716,0.0000050377325,0.00008262566,0.000013987723,0.0000045080315,0.000067116875,0.00006737249,0.0012181174,0.00031031983,0.9946913,0.0010016044,0.0025200641],"study_design_scores_gemma":[0.0000021910314,0.0000022307943,0.000049494814,0.0000021492328,9.1717396e-7,0.000020062487,0.0000145335025,0.0024208638,0.00008734434,0.9970987,0.00029915167,0.000002355027],"about_ca_topic_score_codex":0.00045646686,"about_ca_topic_score_gemma":0.0003469571,"teacher_disagreement_score":0.0073709665,"about_ca_system_score_codex":0.00062802935,"about_ca_system_score_gemma":0.0004896592,"threshold_uncertainty_score":0.024658382},"labels":[],"label_agreement":null},{"id":"W4402339755","doi":"10.1007/978-3-031-68606-1_9","title":"Comprehensive Change Impact Analysis Applied to Advanced Automotive Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"General Motors (Canada); McMaster University","funders":"","keywords":"Computer science; Automotive industry; Engineering; Aerospace engineering","score_opus":0.01532485053739794,"score_gpt":0.2420495129281669,"score_spread":0.22672466239076897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402339755","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.044688907,0.0015249166,0.90497386,0.00020232546,0.00013556144,0.000112309586,0.00046745533,0.0008506782,0.04704399],"genre_scores_gemma":[0.9042807,0.0012080766,0.068197586,0.00007924113,0.00011569123,0.00012949799,0.0006630325,0.00034810512,0.024978165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997186,0.000041398882,0.000009972212,0.0000354863,0.00014741594,0.00004700848],"domain_scores_gemma":[0.9996183,0.00019344201,0.000024186238,0.000045594817,0.000103334794,0.000015159354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128283,0.00068479334,0.00085094385,0.0017159618,0.0005291745,0.0009982417,0.0007739058,0.00054058654,0.0076251314],"category_scores_gemma":[0.0013372393,0.00032315755,0.00089888874,0.0014982925,0.00046680958,0.0010920329,0.00075344334,0.0009579038,0.00057301065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042106672,0.000059864484,0.0010076693,0.00014089954,0.00006296071,0.0001567719,0.0000802115,0.81930953,0.0030138134,0.06696696,0.0038538536,0.10530533],"study_design_scores_gemma":[0.0000016130073,0.000020287918,0.0008495045,0.000008697014,0.000012839411,0.000021126458,0.000021248867,0.9741742,0.00054118223,0.022613268,0.0017307149,0.0000053001577],"about_ca_topic_score_codex":0.008472311,"about_ca_topic_score_gemma":0.008317933,"teacher_disagreement_score":0.008472311,"about_ca_system_score_codex":0.0007127054,"about_ca_system_score_gemma":0.0008343446,"threshold_uncertainty_score":0.025508583},"labels":[],"label_agreement":null},{"id":"W4402340046","doi":"10.1007/978-3-031-68738-9_18","title":"Including Defeaters in Quantitative Confidence Assessments for Assurance Cases","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"Critical Systems Labs; University of Victoria","funders":"","keywords":"Computer science","score_opus":0.04285683935036599,"score_gpt":0.305904843520238,"score_spread":0.263048004169872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402340046","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.030590223,0.0006910036,0.9250748,0.000944117,0.00024888417,0.00024280205,0.0007647451,0.0009477843,0.040495526],"genre_scores_gemma":[0.66945696,0.00024521575,0.32352236,0.00021731688,0.00013551932,0.00034241047,0.0008808556,0.00033615966,0.004863222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97094256,0.012452971,0.0018834895,0.002260763,0.01143314,0.0010271047],"domain_scores_gemma":[0.8133184,0.15526146,0.008082358,0.0103451675,0.011894895,0.0010976656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018290065,0.0013512791,0.0010034833,0.004689626,0.0013099207,0.006191244,0.0025681085,0.0028295158,0.013378328],"category_scores_gemma":[0.19292524,0.0010259394,0.0010212079,0.002899155,0.003030162,0.011845713,0.0036975772,0.004210223,0.0018752624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070407643,0.00027343485,0.008427387,0.00083022093,0.00013296926,0.0004774695,0.002338365,0.08842566,0.004333933,0.43445903,0.013658316,0.44593915],"study_design_scores_gemma":[0.00005354601,0.0003924443,0.0037538046,0.000718288,0.00009356794,0.0005864657,0.0009288438,0.37720168,0.008021117,0.5895885,0.018543463,0.00011823314],"about_ca_topic_score_codex":0.00087311724,"about_ca_topic_score_gemma":0.0012446672,"teacher_disagreement_score":0.018290065,"about_ca_system_score_codex":0.0015976758,"about_ca_system_score_gemma":0.0012321603,"threshold_uncertainty_score":0.096728206},"labels":[],"label_agreement":null},{"id":"W4402340062","doi":"10.1007/978-3-031-68738-9_32","title":"Dual-Process System: An Architectural Pattern for Assurable Autonomous Robots Inspired by Dual-Process Theory","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Flexible and Reconfigurable Manufacturing Systems","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":"Dual (grammatical number); Computer science; Process (computing); Robot; Artificial intelligence; Human–computer interaction; Programming language","score_opus":0.011588892809528682,"score_gpt":0.23326456846896512,"score_spread":0.22167567565943644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402340062","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.010399847,0.000520988,0.9630881,0.0002717596,0.00024277321,0.0000831465,0.00007978783,0.0012874273,0.024026118],"genre_scores_gemma":[0.20216276,0.0008075113,0.76532096,0.00029622682,0.00009031117,0.00022200777,0.00023399973,0.00046898486,0.030397242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977916,0.000030977644,0.000017165416,0.00006451592,0.00007768352,0.000030488047],"domain_scores_gemma":[0.9998685,0.000020815874,0.00001367236,0.000050106944,0.000026208743,0.000020592519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730953,0.00058956805,0.00039093505,0.00054566294,0.00058769336,0.0017104726,0.0011139001,0.0008726103,0.005651665],"category_scores_gemma":[0.00035064714,0.0003832231,0.00070482097,0.0005457324,0.001223042,0.0017377597,0.0014590812,0.0017982346,0.0023771431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012491886,0.000060895403,0.00021613191,0.00023973227,0.000025634436,0.000254518,0.00027042293,0.015116864,0.06676038,0.82206106,0.0038166344,0.09105278],"study_design_scores_gemma":[0.00007522076,0.00032489712,0.00044648018,0.000098775075,0.00008189116,0.0011312253,0.00012460086,0.2279053,0.06310743,0.48529884,0.22132203,0.00008325036],"about_ca_topic_score_codex":0.00048705586,"about_ca_topic_score_gemma":0.00066918845,"teacher_disagreement_score":0.005651665,"about_ca_system_score_codex":0.00047393612,"about_ca_system_score_gemma":0.0006557788,"threshold_uncertainty_score":0.018906653},"labels":[],"label_agreement":null},{"id":"W4402340081","doi":"10.1007/978-3-031-68606-1_10","title":"A Case Study of Continuous Assurance Argument for Level 4 Automated Driving","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"Bombardier (Canada)","funders":"","keywords":"Computer science; Argument (complex analysis); Programming language; Software engineering","score_opus":0.019616143990381966,"score_gpt":0.24329154892822852,"score_spread":0.22367540493784654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402340081","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.7933388,0.00057673885,0.029453458,0.006006408,0.0001626126,0.00020644467,0.00023412374,0.000280693,0.1697407],"genre_scores_gemma":[0.9760779,0.000151297,0.007412879,0.00017951104,0.000019470459,0.000026349411,0.00007236555,0.000035934027,0.016024292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"case_report","domain_scores_codex":[0.99887913,0.00048184226,0.000033503016,0.00009165354,0.0002918079,0.00022208384],"domain_scores_gemma":[0.99496484,0.003784305,0.00018681688,0.00032399775,0.00039495915,0.000345095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017144212,0.00037325863,0.00025508643,0.0008790448,0.0036395313,0.0026245385,0.0014386259,0.0049668076,0.009181401],"category_scores_gemma":[0.006272773,0.00023121416,0.00052589626,0.00080151897,0.002072488,0.0021745472,0.0014535845,0.0022984366,0.0007941062],"study_design_candidate":"case_report","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013141865,0.0018727808,0.019843716,0.0005612664,0.00009305922,0.08160725,0.042739112,0.029866759,0.009716258,0.6867428,0.029567352,0.09607544],"study_design_scores_gemma":[0.00054599217,0.0017426469,0.022200856,0.0006631876,0.00023893021,0.029228132,0.09031167,0.15584096,0.022160355,0.2869562,0.38984954,0.00026155624],"about_ca_topic_score_codex":0.009778786,"about_ca_topic_score_gemma":0.011196778,"teacher_disagreement_score":0.009778786,"about_ca_system_score_codex":0.0018403163,"about_ca_system_score_gemma":0.0011263727,"threshold_uncertainty_score":0.03071487},"labels":[],"label_agreement":null},{"id":"W4402340220","doi":"10.1007/978-3-031-68606-1_3","title":"Strategic Resilience Evaluation of Neural Networks Within Autonomous Vehicle Software","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Resilience (materials science); Artificial neural network; Software; Artificial intelligence; Operating system","score_opus":0.02792294607070531,"score_gpt":0.28173622142855326,"score_spread":0.2538132753578479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402340220","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.31605372,0.0010544686,0.66269463,0.0007649702,0.00017843742,0.0000943022,0.000083791136,0.00065175863,0.018423848],"genre_scores_gemma":[0.989578,0.00009882895,0.008673157,0.000026986141,0.000013727159,0.000019487949,0.000024016581,0.000037455935,0.001528399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999479,0.0001994436,0.000015534451,0.000074175994,0.00014464624,0.00008729239],"domain_scores_gemma":[0.9974503,0.0017356225,0.00017328696,0.00014313425,0.00037881418,0.00011889695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016221073,0.0006991329,0.00064955145,0.0005119528,0.00031025446,0.00082245923,0.00084319897,0.0009212805,0.0021518634],"category_scores_gemma":[0.005564888,0.00023759768,0.00035548912,0.0003027961,0.000973094,0.0010654153,0.0012594392,0.00091482024,0.00015843593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007671019,0.000011567564,0.00016757777,0.000021766598,0.000014781036,0.000021303884,0.000011052172,0.9843052,0.0011128626,0.0071308604,0.00019934583,0.0069269836],"study_design_scores_gemma":[0.0000012937248,0.000025168776,0.000045330722,0.000003179258,0.0000028786205,0.000003423046,0.000003883083,0.99739647,0.00037512026,0.0020931438,0.0000480166,0.000001993829],"about_ca_topic_score_codex":0.002885893,"about_ca_topic_score_gemma":0.0019099198,"teacher_disagreement_score":0.002885893,"about_ca_system_score_codex":0.0015844179,"about_ca_system_score_gemma":0.0007349121,"threshold_uncertainty_score":0.011495769},"labels":[],"label_agreement":null},{"id":"W4402364429","doi":"10.1007/978-3-031-71167-1_2","title":"Assessing Logical Reasoning Capabilities of Encoder-Only Transformer Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Computer science; Encoder; Transformer; Programming language; Electrical engineering; Operating system; Engineering","score_opus":0.05022977370404413,"score_gpt":0.31128250951734276,"score_spread":0.26105273581329863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402364429","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.5853966,0.00039096933,0.39114994,0.00071176526,0.000083608225,0.00017994134,0.001011284,0.0028635396,0.018212445],"genre_scores_gemma":[0.9540342,0.00011794395,0.043747433,0.00004516063,0.000014900109,0.000028352151,0.00062933826,0.00013569582,0.0012468768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959274,0.0015464366,0.00022053633,0.00053865666,0.0014019987,0.00036491046],"domain_scores_gemma":[0.946393,0.0442967,0.0012139317,0.0055522826,0.0017967749,0.0007473743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005744002,0.00070086174,0.0006425458,0.0010653863,0.00044617566,0.0032298397,0.0022353183,0.0016488965,0.007745976],"category_scores_gemma":[0.04183219,0.0006155848,0.001214918,0.0006531202,0.0014960885,0.008475284,0.0025252937,0.001601318,0.00094805245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004657588,0.001185784,0.012960548,0.0007699303,0.00042409904,0.0005179297,0.0009024553,0.5771709,0.021639278,0.2304316,0.0034761361,0.14586371],"study_design_scores_gemma":[0.000111042384,0.00024533606,0.00041826387,0.000032060394,0.00012741445,0.000100450256,0.00014950626,0.90965456,0.012912851,0.07542057,0.0008060709,0.000021875512],"about_ca_topic_score_codex":0.002437914,"about_ca_topic_score_gemma":0.0030627802,"teacher_disagreement_score":0.007745976,"about_ca_system_score_codex":0.0011778387,"about_ca_system_score_gemma":0.0016417532,"threshold_uncertainty_score":0.030377507},"labels":[],"label_agreement":null},{"id":"W4402423652","doi":"10.1007/978-3-031-70645-5_7","title":"Οpen Parliamentary Data as a Tool for Linguistic Research: Exploring the ‘Greek Language Question’ in the Journal of Parliamentary Debates","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Library of Parliament","funders":"","keywords":"Computer science; Linguistics; Artificial intelligence; Natural language processing; Philosophy","score_opus":0.09835994509403702,"score_gpt":0.36892924929544874,"score_spread":0.27056930420141173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402423652","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.22149535,0.030270765,0.058201596,0.20121235,0.0025754871,0.00010460443,0.0036469488,0.00027305097,0.48221982],"genre_scores_gemma":[0.94888526,0.004636316,0.01818761,0.0040455596,0.0012322768,0.000119310265,0.0014657547,0.0003879258,0.021039994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9935516,0.0049330625,0.00024417727,0.00037691058,0.00072394754,0.00017029178],"domain_scores_gemma":[0.9536521,0.041298617,0.0017077535,0.0013557338,0.0014684515,0.00051735033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007842937,0.00028682617,0.00044348746,0.0040641194,0.0031340355,0.016251627,0.0011806851,0.0025142913,0.009673523],"category_scores_gemma":[0.038600188,0.0004608422,0.00034613494,0.0122846505,0.009303427,0.026605317,0.0035363736,0.0036456524,0.0015750043],"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.000078898986,0.00004028352,0.0038516726,0.00025534426,0.000019117608,0.00014962119,0.04475434,0.0002106529,0.0004632106,0.87585634,0.024561435,0.04975903],"study_design_scores_gemma":[0.000021140979,0.00002383536,0.007421858,0.0007584657,0.000024264315,0.00024664376,0.05391978,0.0023780665,0.0009942446,0.64050937,0.29365876,0.00004363501],"about_ca_topic_score_codex":0.0043344684,"about_ca_topic_score_gemma":0.0062267426,"teacher_disagreement_score":0.016251627,"about_ca_system_score_codex":0.002888666,"about_ca_system_score_gemma":0.0018581013,"threshold_uncertainty_score":0.04147792},"labels":[],"label_agreement":null},{"id":"W4402442329","doi":"10.1007/978-3-031-71710-9_14","title":"Exploring Acoustics Perception Through XR Spatial Audio Experiences: Experiments and Data Collection for the ‘Listen To the Theatre’ Project","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multisensory perception and integration","field":"Psychology","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":"Université de Montréal","funders":"","keywords":"Computer science; Perception; Data collection; Multimedia; Human–computer interaction; Speech recognition; Computer graphics (images); Acoustics; Psychology","score_opus":0.2765810710335729,"score_gpt":0.40773943770428117,"score_spread":0.1311583666707083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402442329","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.9366087,0.00035990158,0.04801357,0.0001621789,0.00004433188,0.00041310958,0.0006980462,0.00018798232,0.013512209],"genre_scores_gemma":[0.9168435,0.00047871954,0.07128861,0.00010943539,0.000034927387,0.00097106694,0.0013252472,0.000283244,0.008665193],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919945,0.0003272245,0.000044658154,0.0001676756,0.00017108221,0.00008992111],"domain_scores_gemma":[0.99885726,0.0006025594,0.00005737737,0.00022876498,0.00012287042,0.00013115625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012675729,0.0006237479,0.00046015455,0.00031858822,0.0010496415,0.0015471169,0.00089640025,0.00078732456,0.00765551],"category_scores_gemma":[0.0027531309,0.00052768434,0.00045550734,0.0006189906,0.0022759594,0.0012127951,0.00260894,0.001096845,0.0013903673],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039483295,0.0057773353,0.011577967,0.0015947848,0.00015609057,0.0012595488,0.06915083,0.004386447,0.603113,0.009119753,0.0058552176,0.28406075],"study_design_scores_gemma":[0.0014796312,0.021436121,0.3359107,0.0005654653,0.00063746667,0.0064225835,0.09064111,0.016464625,0.35182425,0.031282105,0.14253505,0.0008009604],"about_ca_topic_score_codex":0.0014113272,"about_ca_topic_score_gemma":0.0023391552,"teacher_disagreement_score":0.00765551,"about_ca_system_score_codex":0.00026428798,"about_ca_system_score_gemma":0.00037902503,"threshold_uncertainty_score":0.025610209},"labels":[],"label_agreement":null},{"id":"W4402457353","doi":"10.1007/978-3-031-71993-6_10","title":"An Enterprise-Wide Optimization System for Sustainable Regional Planning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Planning and Valuation","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Enterprise resource planning; Engineering management; Operations research; Knowledge management; Engineering","score_opus":0.019927638814006964,"score_gpt":0.2550165543840411,"score_spread":0.2350889155700341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402457353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028190399,0.00020229741,0.9460617,0.00026141581,0.000050691204,0.00009654397,0.0006556837,0.014885752,0.009595472],"genre_scores_gemma":[0.4124081,0.0002496975,0.57521945,0.00015533988,0.000049916573,0.00026349377,0.002023333,0.0008055255,0.008825053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996264,0.00012689958,0.000032284777,0.00009308996,0.00008281915,0.000038420858],"domain_scores_gemma":[0.99966025,0.00015793518,0.000017953795,0.00006814632,0.000066122026,0.00002951649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008860801,0.00060392777,0.00070573203,0.00055984565,0.00053221104,0.0012598112,0.0009791949,0.00064778124,0.010164149],"category_scores_gemma":[0.0014119792,0.00036942353,0.0005308674,0.0011787282,0.00023940776,0.0014457082,0.0014215918,0.0007730099,0.0014194476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003414518,0.00022040833,0.0011626479,0.00007906321,0.00008775669,0.00013581917,0.00011151593,0.6904085,0.00534052,0.015550665,0.016370406,0.27019116],"study_design_scores_gemma":[0.00001535011,0.0000150422475,0.0001211101,0.000002848166,0.000007513213,0.000012210789,0.00001242285,0.99136657,0.00067609147,0.0046752417,0.0030910051,0.0000045413794],"about_ca_topic_score_codex":0.006740889,"about_ca_topic_score_gemma":0.009244116,"teacher_disagreement_score":0.010164149,"about_ca_system_score_codex":0.00067815586,"about_ca_system_score_gemma":0.0008908308,"threshold_uncertainty_score":0.034002423},"labels":[],"label_agreement":null},{"id":"W4402457368","doi":"10.1007/978-3-031-71993-6_19","title":"Two-Dimensional Assortment and Shelf-Space Allocation Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","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":"Concordia University","funders":"","keywords":"Computer science; Space (punctuation); Operations research; Operating system; Mathematics","score_opus":0.008675698183451881,"score_gpt":0.21963870661188284,"score_spread":0.21096300842843096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402457368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2112677,0.004016755,0.7054041,0.0037771566,0.0006539914,0.0003925631,0.0036061096,0.00044644976,0.070435114],"genre_scores_gemma":[0.7997797,0.0026226225,0.12153119,0.00039959283,0.00046310233,0.00053105725,0.0016514933,0.00021220391,0.07280895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897707,0.00039604557,0.000047083762,0.00020652077,0.00017978341,0.00019353283],"domain_scores_gemma":[0.99888724,0.0006270546,0.00009975409,0.00007926255,0.000101277845,0.00020530594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444071,0.001965213,0.0037235725,0.0014178718,0.0010222216,0.0036945676,0.0035433185,0.004299774,0.014268078],"category_scores_gemma":[0.0035637415,0.001095523,0.0015602509,0.003409258,0.001434527,0.0034134877,0.0023687244,0.0021069811,0.0012823567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007060937,0.00032925713,0.00082380924,0.00047371403,0.00018208902,0.00042642048,0.000108509776,0.8666127,0.0020341212,0.07719416,0.00949825,0.041610893],"study_design_scores_gemma":[0.00010064198,0.0001388049,0.00059243955,0.000032184693,0.000052457228,0.00018593199,0.000082668594,0.9302282,0.0007241739,0.06387361,0.0039476934,0.000041100044],"about_ca_topic_score_codex":0.0033167752,"about_ca_topic_score_gemma":0.002179629,"teacher_disagreement_score":0.014268078,"about_ca_system_score_codex":0.0019984315,"about_ca_system_score_gemma":0.001458,"threshold_uncertainty_score":0.04773146},"labels":[],"label_agreement":null},{"id":"W4402521785","doi":"10.1007/978-3-031-72241-7_8","title":"User-Donated Screenshots Analysis: Feasibility of a New Approach to Collect Objective Social Media App Usage in Adolescents","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Impact of Technology on Adolescents","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 Saskatchewan","funders":"","keywords":"Computer science; Social media; World Wide Web; Information retrieval; Data science","score_opus":0.04015994751645573,"score_gpt":0.3191678263316357,"score_spread":0.27900787881517997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402521785","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.9596577,0.00006810483,0.027439453,0.00010632373,0.00006282039,0.0018934987,0.0019384313,0.00037346658,0.008460271],"genre_scores_gemma":[0.9032982,0.000121869365,0.079728924,0.00019668316,0.00005101449,0.005473448,0.0012056426,0.00019536747,0.009728718],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99615943,0.002279082,0.00025356677,0.0004816211,0.0006756405,0.00015059985],"domain_scores_gemma":[0.9844046,0.01031402,0.0005489923,0.0008149959,0.0033536365,0.0005637925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045977836,0.00043867633,0.00030942942,0.0012743408,0.00062043295,0.0010704064,0.00065967214,0.0005309,0.0050306376],"category_scores_gemma":[0.011573828,0.00040360872,0.000313464,0.0005028659,0.00035355333,0.00081281725,0.0012721149,0.00053159933,0.0017300574],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002728106,0.0042064926,0.47470608,0.0009806316,0.0001876251,0.00059052516,0.04475982,0.00053700747,0.10739823,0.0011770395,0.007777887,0.35495064],"study_design_scores_gemma":[0.00023320952,0.005588966,0.8838039,0.00026673192,0.00027625414,0.00083777343,0.026761232,0.0090797115,0.05841375,0.0008055813,0.0137283895,0.00020436873],"about_ca_topic_score_codex":0.0017174607,"about_ca_topic_score_gemma":0.0066907974,"teacher_disagreement_score":0.0050306376,"about_ca_system_score_codex":0.00025382172,"about_ca_system_score_gemma":0.0006424626,"threshold_uncertainty_score":0.024315715},"labels":[],"label_agreement":null},{"id":"W4402527095","doi":"10.1007/978-3-031-71736-9_3","title":"Knowledge Acquisition Passage Retrieval: Corpus, Ranking Models, and Evaluation Resources","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Universiteit van Amsterdam; Canadian Institute of Steel Construction","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Knowledge acquisition; Artificial intelligence; Natural language processing","score_opus":0.04013300437566199,"score_gpt":0.2820423754897383,"score_spread":0.24190937111407634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402527095","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.06992168,0.04152049,0.78815824,0.004974718,0.0010372432,0.0010182617,0.013027574,0.014669875,0.06567193],"genre_scores_gemma":[0.34784713,0.014387498,0.54524606,0.0010959441,0.0019173549,0.0018628801,0.042580713,0.0028311752,0.042231146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959246,0.0027645566,0.00020669417,0.00031761837,0.00068919675,0.00009738991],"domain_scores_gemma":[0.99076426,0.006298845,0.00023863312,0.00102482,0.001460413,0.00021300814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067872154,0.0009630036,0.001477993,0.0051076463,0.00080044696,0.0046475623,0.002014695,0.0012817517,0.011461036],"category_scores_gemma":[0.021552583,0.000626716,0.0007943882,0.007191401,0.000731349,0.005910929,0.0011676642,0.0014081629,0.009548597],"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.0007373217,0.0005472432,0.002745532,0.0013456604,0.00023313107,0.00013914666,0.00030953702,0.0173808,0.0066759232,0.019910553,0.14251564,0.80745953],"study_design_scores_gemma":[0.00031666987,0.0011381144,0.014940784,0.0011149108,0.00092459854,0.0009800681,0.0005803603,0.7038818,0.028915271,0.070257924,0.1766045,0.00034505536],"about_ca_topic_score_codex":0.008024684,"about_ca_topic_score_gemma":0.00944288,"teacher_disagreement_score":0.011461036,"about_ca_system_score_codex":0.001664337,"about_ca_system_score_gemma":0.0022837122,"threshold_uncertainty_score":0.038341045},"labels":[],"label_agreement":null},{"id":"W4402543135","doi":"10.1007/978-3-031-70932-6_15","title":"BittyBuzz: A Swarm Robotics Runtime for Tiny Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Swarm robotics; Robotics; Artificial intelligence; Swarm behaviour; Robot","score_opus":0.018002829462314712,"score_gpt":0.231267146665399,"score_spread":0.21326431720308428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402543135","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.012719185,0.0009614557,0.54915833,0.00028464277,0.00042014668,0.00020326463,0.0032477786,0.38442656,0.048578635],"genre_scores_gemma":[0.20256469,0.0012989566,0.50390166,0.0008484903,0.00018362053,0.00067629607,0.016798707,0.16583733,0.107890256],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999607,0.0000458923,0.00002591716,0.00007650916,0.0001949689,0.0000498323],"domain_scores_gemma":[0.99949086,0.00016761896,0.0000240418,0.0001593647,0.00008354801,0.00007458988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005618128,0.0013315813,0.0010384796,0.00061519566,0.00073704467,0.0016499284,0.0022968373,0.000831573,0.042221457],"category_scores_gemma":[0.0015255662,0.0010740376,0.0009246062,0.00064183195,0.00057876186,0.0029246677,0.0023872126,0.0022236842,0.01617032],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002040396,0.00025273138,0.0016384078,0.0018086883,0.00033524857,0.00042612545,0.0007981585,0.0295078,0.066065684,0.05544272,0.43053573,0.4111483],"study_design_scores_gemma":[0.00067706953,0.00023208171,0.0019026081,0.00027780148,0.00017848982,0.0005910627,0.00012723797,0.2571332,0.07179974,0.055283315,0.6115505,0.000246933],"about_ca_topic_score_codex":0.0016325745,"about_ca_topic_score_gemma":0.0027640094,"teacher_disagreement_score":0.042221457,"about_ca_system_score_codex":0.00072075595,"about_ca_system_score_gemma":0.0007092657,"threshold_uncertainty_score":0.14124483},"labels":[],"label_agreement":null},{"id":"W4402543171","doi":"10.1007/978-3-031-70932-6_4","title":"Byzantine Fault Detection in Swarm-SLAM Using Blockchain and Geometric Constraints","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Byzantine architecture; Blockchain; Byzantine fault tolerance; Computer science; Swarm behaviour; Fault (geology); Artificial intelligence; Distributed computing; Fault tolerance; Geology; Computer security; Seismology; Archaeology; Geography","score_opus":0.012475580843000824,"score_gpt":0.21974693107469215,"score_spread":0.20727135023169133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402543171","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.026808057,0.00023053966,0.9692676,0.00012955397,0.000053849475,0.000059494054,0.00011507503,0.00075191073,0.002583885],"genre_scores_gemma":[0.8054757,0.0002567838,0.18869741,0.000046558165,0.000042071028,0.00013493332,0.00031783798,0.00014342977,0.004885312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993383,0.00016365896,0.000045218007,0.00013930294,0.00021166178,0.00010168524],"domain_scores_gemma":[0.9983171,0.00081133767,0.00019178812,0.00038255713,0.00023828614,0.00005890536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084966613,0.0006728484,0.0015309667,0.00073042995,0.0008358534,0.0011032688,0.0012602018,0.000968569,0.0032398044],"category_scores_gemma":[0.0033929488,0.00046554444,0.0003927265,0.0011416908,0.0009580554,0.0025196944,0.0017421145,0.0013474199,0.0006804415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003485136,0.00006782759,0.00089407974,0.00019258335,0.000041065505,0.00018678461,0.00014288818,0.7783596,0.008442657,0.04303729,0.00228772,0.165999],"study_design_scores_gemma":[0.000012159515,0.00004255659,0.00010323244,0.0000095343885,0.0000041261756,0.00003234569,0.0000131595625,0.9798838,0.001885336,0.017166948,0.0008405787,0.0000061929773],"about_ca_topic_score_codex":0.0038487655,"about_ca_topic_score_gemma":0.005932984,"teacher_disagreement_score":0.0038487655,"about_ca_system_score_codex":0.0006424182,"about_ca_system_score_gemma":0.0013139879,"threshold_uncertainty_score":0.01083827},"labels":[],"label_agreement":null},{"id":"W4402543174","doi":"10.1007/978-3-031-70932-6_14","title":"Swarming Out of the Lab: Comparing Relative Localization Methods for Collective Behavior","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","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":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Swarming (honey bee); Computer science; Collective behavior; Artificial intelligence; Simulation; Ecology; Biology","score_opus":0.0445345771555564,"score_gpt":0.33026805337479515,"score_spread":0.2857334762192387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402543174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1789107,0.0082333265,0.80045044,0.00054711016,0.00041801,0.000153117,0.00020426321,0.0016675253,0.009415407],"genre_scores_gemma":[0.7634443,0.0030426325,0.22804163,0.00013690312,0.0001502109,0.00021374719,0.0005036704,0.0004958575,0.003971086],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981852,0.00093088247,0.00006463071,0.00025771573,0.00047865885,0.00008281639],"domain_scores_gemma":[0.99019706,0.0076794354,0.00046538192,0.00079773687,0.00070554286,0.00015481185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036245238,0.0010177405,0.001429868,0.0015517857,0.00052722404,0.0014576834,0.0019323861,0.0014935959,0.0025920689],"category_scores_gemma":[0.015533591,0.00040447665,0.00081744546,0.0015863373,0.0010618651,0.0035259072,0.0020017675,0.0010489129,0.0006530315],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021758114,0.00043266537,0.004375787,0.0012069182,0.00062334415,0.000046430676,0.00078139186,0.36758175,0.006827531,0.024173224,0.004790304,0.5869848],"study_design_scores_gemma":[0.00011222709,0.0006235597,0.0018070524,0.000061054,0.00011646135,0.00007883221,0.0002828836,0.9811334,0.0027130484,0.011541595,0.0014864258,0.000043533288],"about_ca_topic_score_codex":0.0030458374,"about_ca_topic_score_gemma":0.0022067565,"teacher_disagreement_score":0.0036245238,"about_ca_system_score_codex":0.0007938751,"about_ca_system_score_gemma":0.0007216357,"threshold_uncertainty_score":0.019168556},"labels":[],"label_agreement":null},{"id":"W4402584319","doi":"10.1007/978-3-031-71704-8_12","title":"Surgical Simulation in Extended Reality for OR 2.0 Using Unreal Engine 5 to Improve Patient Outcomes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"Victoria Hospital; London Health Sciences Centre; Western University","funders":"","keywords":"Computer science; Simulation","score_opus":0.06171954430927164,"score_gpt":0.3647292945224567,"score_spread":0.3030097502131851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402584319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06850482,0.0048878943,0.70016736,0.0024245502,0.0019332588,0.00037547245,0.0018188508,0.015753053,0.20413476],"genre_scores_gemma":[0.44381893,0.005460359,0.4329256,0.0012076074,0.0002989879,0.00045032907,0.0036223317,0.003523878,0.10869192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997508,0.00006579305,0.000013012205,0.000021414784,0.00012278966,0.000026246174],"domain_scores_gemma":[0.99967206,0.00017756018,0.000017679045,0.000024253322,0.00005725651,0.00005133655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006911413,0.00052629923,0.00025975294,0.00035304425,0.00012519525,0.0009532715,0.00068624236,0.00042665462,0.0307709],"category_scores_gemma":[0.0015935063,0.00025502976,0.0006143405,0.0002114075,0.0001812599,0.0005171628,0.0012045399,0.0007815351,0.0037526477],"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.0007809309,0.00045889607,0.001870421,0.0006556557,0.00009193164,0.000604855,0.00053697353,0.101627044,0.020228054,0.021942047,0.112984866,0.73821837],"study_design_scores_gemma":[0.00040858457,0.0019605532,0.009097092,0.00096569804,0.00023313753,0.003410141,0.0004152049,0.55062383,0.03154362,0.030181319,0.37090588,0.000255026],"about_ca_topic_score_codex":0.001022929,"about_ca_topic_score_gemma":0.0014618551,"teacher_disagreement_score":0.0307709,"about_ca_system_score_codex":0.00024394119,"about_ca_system_score_gemma":0.00060731225,"threshold_uncertainty_score":0.10293889},"labels":[],"label_agreement":null},{"id":"W4402586402","doi":"10.1007/978-3-031-72200-4_10","title":"Simultaneously Building and Reconciling a Synteny Tree","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tree (set theory); Synteny; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.014818269479631068,"score_gpt":0.2471356584624695,"score_spread":0.2323173889828384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402586402","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.23909414,0.0011678566,0.74429464,0.0009888004,0.00015171073,0.00022583995,0.0027669303,0.0067524062,0.0045576156],"genre_scores_gemma":[0.47167903,0.00022359414,0.5162429,0.00034381333,0.000059585673,0.0001364618,0.0081167035,0.00090919505,0.00228869],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826044,0.0005584693,0.000099963785,0.00055348634,0.0003772662,0.00015043624],"domain_scores_gemma":[0.99595165,0.0020857172,0.0002472106,0.000996887,0.00057677896,0.00014178765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002726625,0.001165873,0.0016215267,0.0027459892,0.0013393468,0.0016030198,0.0020679613,0.0016989473,0.0039208787],"category_scores_gemma":[0.0077173356,0.00083841383,0.0017979754,0.002240188,0.0010222952,0.0035175052,0.0024706023,0.0013432192,0.0011604306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001222652,0.0003064911,0.015024911,0.0007709251,0.00053977995,0.0013692713,0.0009758379,0.43317783,0.019699031,0.034116365,0.015809406,0.47698748],"study_design_scores_gemma":[0.00006731332,0.00016257705,0.0018913142,0.00005793492,0.000121568024,0.00032891118,0.00022767588,0.9167761,0.009331943,0.063412115,0.00758271,0.000039845327],"about_ca_topic_score_codex":0.0013662396,"about_ca_topic_score_gemma":0.0023444614,"teacher_disagreement_score":0.0039208787,"about_ca_system_score_codex":0.00065075076,"about_ca_system_score_gemma":0.0013002651,"threshold_uncertainty_score":0.014419973},"labels":[],"label_agreement":null},{"id":"W4402586538","doi":"10.1007/978-3-031-72200-4_14","title":"Another Virtue of Wavelet Forests","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Wavelet; Virtue; Artificial intelligence; Epistemology; Philosophy","score_opus":0.013386263150824718,"score_gpt":0.24323989722368372,"score_spread":0.229853634072859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402586538","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.010609404,0.0037756027,0.81974727,0.0057378435,0.0019559837,0.00002706812,0.0002288317,0.0008312016,0.15708685],"genre_scores_gemma":[0.3511296,0.007020615,0.5051805,0.0048197987,0.005028693,0.00014973982,0.00059471227,0.0016559503,0.12442047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.0001638483,0.00003743137,0.00017628435,0.00032266,0.00005913025],"domain_scores_gemma":[0.9979081,0.00088830583,0.00009919189,0.0006865533,0.00030533157,0.00011251905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020602,0.00038519452,0.0005368796,0.0007687247,0.00089234556,0.0022554575,0.00070527924,0.0011377198,0.007590778],"category_scores_gemma":[0.005165653,0.00035719207,0.00041163125,0.0011214451,0.0025464138,0.0038544757,0.0017271865,0.0028356817,0.004069832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034698463,0.000014998558,0.00018556416,0.00006777303,0.000012195882,0.000045872483,0.000075122145,0.0010628281,0.0036916814,0.902616,0.011280171,0.080913186],"study_design_scores_gemma":[0.000016631466,0.00002281603,0.0003011103,0.000033239736,0.000014072859,0.0005774449,0.000041080606,0.007180003,0.0029606582,0.88034946,0.108489096,0.000014494855],"about_ca_topic_score_codex":0.00035124432,"about_ca_topic_score_gemma":0.00049907813,"teacher_disagreement_score":0.007590778,"about_ca_system_score_codex":0.0001888974,"about_ca_system_score_gemma":0.00046859376,"threshold_uncertainty_score":0.025393665},"labels":[],"label_agreement":null},{"id":"W4402605100","doi":"10.1007/978-3-031-72350-6_2","title":"Developmental Predictive Coding Model for Early Infancy Mono and Bilingual Vocal Continual Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language Development and Disorders","field":"Psychology","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":"Artificial Intelligence in Medicine (Canada)","funders":"Centre National de la Recherche Scientifique","keywords":"Computer science; Predictive coding; Coding (social sciences); Speech recognition; Artificial intelligence; Natural language processing; Mathematics; Statistics","score_opus":0.017736691472761242,"score_gpt":0.281814435479882,"score_spread":0.26407774400712075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402605100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20791638,0.0005447566,0.73364997,0.0012379078,0.00007023184,0.00006978519,0.0009478361,0.00060908607,0.054954074],"genre_scores_gemma":[0.9209968,0.0002467497,0.057714894,0.000057469617,0.000018768298,0.0001012651,0.00061093655,0.00010538694,0.02014786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981946,0.000034957757,0.000008387294,0.000050207327,0.000047124053,0.00003998352],"domain_scores_gemma":[0.9986904,0.00065157877,0.00009275293,0.00015114831,0.00029688072,0.0001171587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058211415,0.00031778496,0.00026017328,0.00069202314,0.00037466612,0.0012185478,0.0012513578,0.0005168767,0.00901468],"category_scores_gemma":[0.002731954,0.00032054662,0.00044423217,0.0004217387,0.00083741307,0.0017043842,0.00078604184,0.001463243,0.0010952178],"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.0001174924,0.00009079091,0.007184582,0.000052626943,0.000027191805,0.0004275167,0.00082592905,0.03128432,0.0068084453,0.85707337,0.002905434,0.093202256],"study_design_scores_gemma":[0.000014421177,0.0000566951,0.0080817025,0.000043237524,0.000024288658,0.00045743492,0.00042747348,0.5587834,0.0028048211,0.4257893,0.0034829462,0.00003426828],"about_ca_topic_score_codex":0.009515513,"about_ca_topic_score_gemma":0.006254211,"teacher_disagreement_score":0.009515513,"about_ca_system_score_codex":0.0014125494,"about_ca_system_score_gemma":0.0011654949,"threshold_uncertainty_score":0.03015709},"labels":[],"label_agreement":null},{"id":"W4402619319","doi":"10.1007/978-3-031-70242-6_32","title":"Intelligent Conversational Agent for Medical Information","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Pfizer (Canada)","funders":"","keywords":"Computer science; Intelligent agent; Human–computer interaction; Artificial intelligence; World Wide Web","score_opus":0.024133042930073012,"score_gpt":0.2646927494440479,"score_spread":0.2405597065139749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402619319","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.010542729,0.00698416,0.90419084,0.0025743344,0.0007787627,0.0002023533,0.00067821547,0.005545171,0.068503425],"genre_scores_gemma":[0.2410439,0.0041202363,0.6509607,0.00093558314,0.00058947713,0.00040907288,0.0020190922,0.00054331,0.099378705],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971205,0.00012682141,0.000016303886,0.000041670457,0.000078573794,0.000024523373],"domain_scores_gemma":[0.9996563,0.00021288464,0.000015920186,0.000030184394,0.000050519953,0.000034121917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006900606,0.0004990372,0.0004465554,0.00047201882,0.00049663347,0.0012776192,0.00086090923,0.0010200236,0.010736145],"category_scores_gemma":[0.0014445927,0.00022511951,0.0004363691,0.0003491231,0.00022712564,0.0011875355,0.001072621,0.0009358801,0.004544776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004216989,0.00035442604,0.00085532136,0.0007834445,0.00011736104,0.0008616312,0.0013213586,0.019973423,0.02814552,0.120306924,0.12700687,0.69985193],"study_design_scores_gemma":[0.00007388566,0.00021386807,0.0008262588,0.0002251681,0.00017266114,0.0015709953,0.00043980282,0.51035917,0.02025965,0.09442575,0.3713586,0.000074204494],"about_ca_topic_score_codex":0.0006446,"about_ca_topic_score_gemma":0.0009236222,"teacher_disagreement_score":0.010736145,"about_ca_system_score_codex":0.0003694769,"about_ca_system_score_gemma":0.0004929702,"threshold_uncertainty_score":0.03591597},"labels":[],"label_agreement":null},{"id":"W4402625841","doi":"10.1007/978-981-97-7798-3_11","title":"A Distributed Approximation Algorithm for the Total Dominating Set Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Approximation algorithm; Dominating set; Set (abstract data type); Algorithm; Distributed algorithm; Theoretical computer science; Distributed computing; Programming language","score_opus":0.01999182747992082,"score_gpt":0.2666103806226894,"score_spread":0.24661855314276857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402625841","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.009019837,0.00053804356,0.9830232,0.00039546148,0.00026783385,0.000123731,0.00015245148,0.0007275217,0.0057519716],"genre_scores_gemma":[0.20565626,0.00069009815,0.7804963,0.0003514196,0.00026883755,0.00049424206,0.00066721183,0.00031953436,0.011056138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871147,0.00034379849,0.00005659798,0.00028720824,0.00042826767,0.00017269616],"domain_scores_gemma":[0.9984787,0.0008343416,0.000066261404,0.00029677362,0.00021305485,0.00011085919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014948886,0.001366667,0.0021369755,0.00096911745,0.0010065085,0.0017735554,0.0031701983,0.0014234708,0.005333341],"category_scores_gemma":[0.0040676645,0.00057001435,0.0011009146,0.0023866133,0.00074908085,0.0023549665,0.0025174133,0.0021959823,0.0011841237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007149336,0.0004042373,0.00037157463,0.00033077196,0.00013542605,0.00009086683,0.00016762532,0.5180855,0.0051590838,0.065970555,0.022045214,0.38652423],"study_design_scores_gemma":[0.00016567974,0.00011874816,0.000110507,0.00001710183,0.00003827187,0.00008896422,0.00003617838,0.94913155,0.001083617,0.04417308,0.005023556,0.000012794895],"about_ca_topic_score_codex":0.002116674,"about_ca_topic_score_gemma":0.0031524263,"teacher_disagreement_score":0.005333341,"about_ca_system_score_codex":0.001780038,"about_ca_system_score_gemma":0.0020917552,"threshold_uncertainty_score":0.017841756},"labels":[],"label_agreement":null},{"id":"W4402631940","doi":"10.1007/978-3-031-71602-7_19","title":"Deep Multi-label Classification of Personality with Handwriting Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Handwriting; Artificial intelligence; Personality; Pattern recognition (psychology); Speech recognition; Natural language processing; Psychology","score_opus":0.034074935504077274,"score_gpt":0.28350340663452234,"score_spread":0.24942847113044506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402631940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34313497,0.003911162,0.6315412,0.0007432266,0.0007849064,0.00015332586,0.0026908836,0.00552232,0.011518068],"genre_scores_gemma":[0.8167938,0.00089414994,0.14915036,0.00020721824,0.00022335915,0.000085524654,0.0030614927,0.00020114644,0.029382972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.000053721073,0.000015384272,0.00009906803,0.00006306553,0.00007681844],"domain_scores_gemma":[0.9994721,0.00016451762,0.00006436855,0.00008840308,0.00013857514,0.00007207581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004113541,0.00081330846,0.00061101845,0.00085933815,0.00028793473,0.00084840815,0.0006227336,0.00057368743,0.0030752616],"category_scores_gemma":[0.0007718605,0.0002628902,0.000767687,0.00080821844,0.0001603321,0.00065861864,0.00080954103,0.000927305,0.0025854008],"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.00023843235,0.00026985243,0.0076799397,0.00009514115,0.000113671784,0.000121872625,0.000088028195,0.012429543,0.028404687,0.00056179415,0.0091673,0.9408297],"study_design_scores_gemma":[0.000008455639,0.00014852446,0.012818737,0.000045401852,0.00005817056,0.00019703899,0.00010123477,0.9643654,0.016438264,0.0025927494,0.0032001303,0.000025819236],"about_ca_topic_score_codex":0.0030584957,"about_ca_topic_score_gemma":0.0058506345,"teacher_disagreement_score":0.0030752616,"about_ca_system_score_codex":0.00035726375,"about_ca_system_score_gemma":0.00033634558,"threshold_uncertainty_score":0.010287821},"labels":[],"label_agreement":null},{"id":"W4402631950","doi":"10.1007/978-3-031-71602-7_8","title":"A Hybrid Neuroevolutionary Approach to the Design of Convolutional Neural Networks for 2D and 3D Medical Image Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Concordia University","funders":"","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Segmentation; Image segmentation; Image (mathematics); Computer vision; Artificial neural network; Pattern recognition (psychology)","score_opus":0.019795462325467934,"score_gpt":0.27200512249171177,"score_spread":0.25220966016624385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402631950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011275371,0.0003401983,0.98533165,0.00013474743,0.000032320884,0.000030643143,0.000022973516,0.00037874596,0.0024532888],"genre_scores_gemma":[0.3220623,0.00044534635,0.6693751,0.0002110115,0.000057915215,0.00020467272,0.00011812945,0.0002833408,0.00724224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998128,0.000044630884,0.000011495349,0.000052557847,0.000052773164,0.000025835669],"domain_scores_gemma":[0.9995865,0.00022103946,0.000029293877,0.00002916145,0.00010956406,0.000024413914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007453521,0.000703138,0.0005812977,0.0006234985,0.0004135098,0.00074805826,0.0017719496,0.0014054927,0.0027422144],"category_scores_gemma":[0.0013872703,0.00070836063,0.0008804812,0.000437181,0.0007107567,0.000625108,0.0011655416,0.0011155747,0.00037887908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021400723,0.000017319997,0.00024379532,0.000025839767,0.000037454778,0.000038885457,0.00005098554,0.92879355,0.004821562,0.006750021,0.0005958677,0.058603298],"study_design_scores_gemma":[0.0000010545992,0.000007207448,0.000026380827,0.0000026792547,0.0000034019026,0.0000071168247,0.0000020316768,0.9983224,0.00037996456,0.00097198406,0.0002739299,0.0000017473542],"about_ca_topic_score_codex":0.0074048955,"about_ca_topic_score_gemma":0.0100936545,"teacher_disagreement_score":0.0074048955,"about_ca_system_score_codex":0.0011853465,"about_ca_system_score_gemma":0.00078937877,"threshold_uncertainty_score":0.014723599},"labels":[],"label_agreement":null},{"id":"W4402632135","doi":"10.1007/978-3-031-71602-7_18","title":"Palmprint Classification via Filter Faces and Feature Extraction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Feature extraction; Pattern recognition (psychology); Computer vision; Filter (signal processing)","score_opus":0.027984307750574915,"score_gpt":0.27302305516569564,"score_spread":0.24503874741512072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024574338,0.00073214865,0.9680502,0.0000773853,0.00009164788,0.00007099276,0.00019431354,0.0017878577,0.0044210865],"genre_scores_gemma":[0.24504812,0.0020707983,0.7094944,0.00013494404,0.00013342482,0.00015046717,0.0008306941,0.00028741124,0.04184979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.000022153374,0.000011592465,0.000078691075,0.00015392236,0.0000453247],"domain_scores_gemma":[0.99981755,0.00005578499,0.000011236977,0.000043410975,0.00006444652,0.000007639981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030768235,0.0005071007,0.00086443144,0.001053219,0.0002631633,0.0008121515,0.0006165231,0.0007362233,0.007969128],"category_scores_gemma":[0.0005535864,0.0002914431,0.00075473246,0.0010411895,0.00026407768,0.0010408211,0.00047431953,0.00043612707,0.0057607437],"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.00012544893,0.000048479207,0.00033795094,0.00006858365,0.00001945161,0.000046315818,0.000016740327,0.0030767985,0.114068724,0.0012008548,0.0020404167,0.8789502],"study_design_scores_gemma":[0.00003231071,0.00044281656,0.014434155,0.00005947288,0.00018121893,0.0024873419,0.00013024657,0.60335475,0.34376565,0.008888511,0.026121678,0.00010184305],"about_ca_topic_score_codex":0.0015290166,"about_ca_topic_score_gemma":0.0016674893,"teacher_disagreement_score":0.007969128,"about_ca_system_score_codex":0.0002423881,"about_ca_system_score_gemma":0.00029665968,"threshold_uncertainty_score":0.02665943},"labels":[],"label_agreement":null},{"id":"W4402632146","doi":"10.1007/978-3-031-71602-7_10","title":"Vision Transformer Features-Based Leukemia Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Concordia University","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Electrical engineering; Engineering; Voltage","score_opus":0.014549615765865439,"score_gpt":0.26245804426193997,"score_spread":0.24790842849607453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10382772,0.0045871814,0.86979795,0.0006023046,0.00051333266,0.00021367466,0.0013575713,0.004858336,0.014241941],"genre_scores_gemma":[0.7960623,0.0028931499,0.17635608,0.00024165507,0.0002738953,0.00009258459,0.0035709247,0.00024438917,0.020265115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975425,0.000022489521,0.0000126846535,0.00005343811,0.00010372327,0.000053464417],"domain_scores_gemma":[0.9998062,0.000048951806,0.000014940822,0.000024495366,0.000087678614,0.00001777681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004172507,0.00054635614,0.000716429,0.0012517871,0.00019514759,0.0008761591,0.0009264011,0.0005311101,0.004291823],"category_scores_gemma":[0.0006066042,0.00017626146,0.0006766636,0.0009652753,0.00020903032,0.0007241319,0.00056223467,0.0005446785,0.0022941106],"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.0002624825,0.000109740955,0.0015248604,0.00007100683,0.000036156474,0.00006905057,0.000018428125,0.008337362,0.0271121,0.0013727933,0.007985382,0.9531007],"study_design_scores_gemma":[0.000039892308,0.0003128758,0.004698536,0.000039063085,0.00014463595,0.00079643226,0.000071019625,0.9056563,0.07146918,0.0055813626,0.011160757,0.000029914541],"about_ca_topic_score_codex":0.0024417078,"about_ca_topic_score_gemma":0.0025653385,"teacher_disagreement_score":0.004291823,"about_ca_system_score_codex":0.00044084195,"about_ca_system_score_gemma":0.0005075161,"threshold_uncertainty_score":0.014357626},"labels":[],"label_agreement":null},{"id":"W4402632374","doi":"10.1007/978-3-031-71602-7_17","title":"Leveraging Transformers for Weakly Supervised Object Localization in Unconstrained Videos","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Ericsson (Canada); École de Technologie Supérieure; Concordia University","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Computer vision; Object (grammar); Electrical engineering; Voltage","score_opus":0.02028710733145838,"score_gpt":0.2601601459871975,"score_spread":0.2398730386557391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632374","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.008473962,0.00016920846,0.9892027,0.000061907194,0.00003487022,0.00003146185,0.00011333143,0.0011848517,0.00072781835],"genre_scores_gemma":[0.5749498,0.00091577444,0.41508964,0.00023016549,0.00019962562,0.00012042564,0.0015945222,0.00068006816,0.0062198555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931645,0.00014981412,0.000042399104,0.00021461498,0.00019122944,0.000085489744],"domain_scores_gemma":[0.9984041,0.000791747,0.00012176297,0.00035174328,0.0002482977,0.00008246449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009383511,0.0010890726,0.0012243289,0.0010040351,0.00035331785,0.001263012,0.0013806879,0.0010563149,0.004475209],"category_scores_gemma":[0.0051400964,0.00050106464,0.00065574853,0.0011644035,0.00095583755,0.003186231,0.0024663308,0.001518871,0.0026549997],"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.0007828072,0.00017129278,0.0012318956,0.00036140086,0.00008140726,0.00025558987,0.00013549264,0.10728096,0.079019345,0.028044527,0.0062488914,0.7763863],"study_design_scores_gemma":[0.000018180383,0.0001072684,0.00026871182,0.000018261777,0.00001828408,0.00012696402,0.000036632337,0.9515926,0.015299734,0.030834509,0.0016646228,0.000014171703],"about_ca_topic_score_codex":0.0026450746,"about_ca_topic_score_gemma":0.004558493,"teacher_disagreement_score":0.004475209,"about_ca_system_score_codex":0.0004098143,"about_ca_system_score_gemma":0.00074430445,"threshold_uncertainty_score":0.014971077},"labels":[],"label_agreement":null},{"id":"W4402632532","doi":"10.1007/978-3-031-71602-7_22","title":"Deep Multiresolution Wavelet Transform for Speech Emotion Assessment of High-Risk Suicide Callers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University; Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Wavelet transform; Wavelet; Speech recognition; Artificial intelligence; Natural language processing","score_opus":0.029460904598612298,"score_gpt":0.3211634948478091,"score_spread":0.2917025902491968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632532","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.6677247,0.0027880813,0.32042134,0.0006251235,0.00025251711,0.00008421821,0.0017333734,0.0006738952,0.0056967535],"genre_scores_gemma":[0.9353474,0.0013895485,0.055635102,0.0001021022,0.00010093145,0.00004800903,0.0015518114,0.000087497545,0.005737647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993885,0.0000132560135,0.0000038799276,0.000011944284,0.000018103206,0.000013915877],"domain_scores_gemma":[0.999882,0.000052686,0.000011288227,0.0000068946915,0.000036711193,0.000010434599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025328604,0.00032666177,0.00022447201,0.0003403346,0.00008734435,0.00036444466,0.00020834347,0.0003275615,0.0018777023],"category_scores_gemma":[0.0006360645,0.000086053646,0.00036798982,0.0002648033,0.00006607054,0.00024725244,0.00026076037,0.000409911,0.00083327043],"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.0007777733,0.00017733517,0.014000761,0.00013934748,0.00009004813,0.0003150302,0.0001911026,0.014776732,0.07459606,0.00074486225,0.007840854,0.8863501],"study_design_scores_gemma":[0.000030052548,0.00031241972,0.10173829,0.00010144622,0.00019340578,0.00074721506,0.00055133714,0.8590832,0.029138902,0.003023299,0.0050254785,0.00005499075],"about_ca_topic_score_codex":0.0012816241,"about_ca_topic_score_gemma":0.00217209,"teacher_disagreement_score":0.0018777023,"about_ca_system_score_codex":0.00010250481,"about_ca_system_score_gemma":0.00013535575,"threshold_uncertainty_score":0.006281495},"labels":[],"label_agreement":null},{"id":"W4402632559","doi":"10.1007/978-3-031-71602-7_21","title":"Experiments in Modeling Disagreement","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.02277986602355848,"score_gpt":0.2599190047508667,"score_spread":0.23713913872730824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632559","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.83594775,0.0018735699,0.09825183,0.005422921,0.0009541929,0.0010978724,0.007137968,0.0022841315,0.04702976],"genre_scores_gemma":[0.96415794,0.00013204529,0.025152788,0.00048751896,0.00014069382,0.0006994504,0.004673692,0.00055415067,0.004001736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9489252,0.041845184,0.0019581504,0.0038328208,0.0024306383,0.0010080116],"domain_scores_gemma":[0.33372405,0.61634046,0.007222894,0.034688875,0.005582418,0.0024412526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.050972965,0.0020238592,0.0017984299,0.001304785,0.0028406032,0.0038348944,0.003977021,0.0039126747,0.02618955],"category_scores_gemma":[0.33026165,0.0012318575,0.001828136,0.0021174164,0.004700384,0.013426739,0.004424169,0.008468795,0.0036826618],"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.038126864,0.014892984,0.08604606,0.003686431,0.0024598837,0.0009056576,0.014907368,0.25041822,0.0058290223,0.29985973,0.09162888,0.19123898],"study_design_scores_gemma":[0.003372736,0.0027444637,0.012889654,0.00041282523,0.0005320137,0.00055234245,0.0027139932,0.71133596,0.006314548,0.24432418,0.014556669,0.0002505187],"about_ca_topic_score_codex":0.0035340034,"about_ca_topic_score_gemma":0.0019389432,"teacher_disagreement_score":0.050972965,"about_ca_system_score_codex":0.002653761,"about_ca_system_score_gemma":0.0014056326,"threshold_uncertainty_score":0.26957405},"labels":[],"label_agreement":null},{"id":"W4402632568","doi":"10.1007/978-3-031-71602-7_15","title":"Multi-modal Decoding of Reach-to-Grasping from EEG and EMG via Neural Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Concordia University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Neural decoding; Decoding methods; Electroencephalography; Modal; Artificial neural network; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Neuroscience; Telecommunications; Psychology","score_opus":0.02954715782613378,"score_gpt":0.2754148170381356,"score_spread":0.2458676592120018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632568","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.066850096,0.0021525533,0.91780335,0.00029455477,0.00018513312,0.0001025353,0.0007182116,0.0017656272,0.010127963],"genre_scores_gemma":[0.7179951,0.0023647887,0.26348075,0.00013056339,0.00019798838,0.00013153059,0.00089067116,0.00028108765,0.014527558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991775,0.000012616146,0.0000052936302,0.000024549458,0.000027801523,0.000012116155],"domain_scores_gemma":[0.9998933,0.00006241622,0.0000094969855,0.000008281262,0.000021173177,0.0000051828947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024130456,0.0006178313,0.00024694946,0.00034711754,0.00013940592,0.0007868827,0.00037964465,0.0005547043,0.0037096736],"category_scores_gemma":[0.0008260561,0.00021451576,0.00036292,0.0005703529,0.00017156026,0.00059605093,0.00033664695,0.0004698495,0.0011875225],"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.00019100637,0.0000641658,0.00063415244,0.00024210608,0.000076070544,0.00010295583,0.00008662486,0.027804155,0.2058685,0.0023797383,0.002075515,0.7604749],"study_design_scores_gemma":[0.000020417632,0.0001377681,0.017791783,0.00011076927,0.0000821931,0.00048540597,0.000072001305,0.86436856,0.101751745,0.011259242,0.003874187,0.00004585393],"about_ca_topic_score_codex":0.0014505929,"about_ca_topic_score_gemma":0.0036640724,"teacher_disagreement_score":0.0037096736,"about_ca_system_score_codex":0.00015585673,"about_ca_system_score_gemma":0.00022031776,"threshold_uncertainty_score":0.012410104},"labels":[],"label_agreement":null},{"id":"W4402632804","doi":"10.1007/978-3-031-71602-7_23","title":"Dynamic HumTrans: Humming Transcription Using CNNs and Dynamic Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological 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":"Concordia University; Université Laval; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Hum; Dynamic programming; Transcription (linguistics); Real-time computing; Speech recognition; Algorithm; Art history; Art","score_opus":0.01618765774970498,"score_gpt":0.22965628834651639,"score_spread":0.2134686305968114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632804","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.021895284,0.000850393,0.9236134,0.00023161028,0.0007071934,0.00027168906,0.0035659762,0.037373908,0.011490499],"genre_scores_gemma":[0.17600335,0.0008411632,0.7742397,0.0005217504,0.00047039206,0.00046726764,0.01086217,0.004029317,0.032564756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973804,0.000034983157,0.0000072790654,0.00010574633,0.000070383954,0.000043532265],"domain_scores_gemma":[0.99975103,0.00009624748,0.000014761352,0.000049398128,0.000056901645,0.00003166033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036662785,0.0012013905,0.0007565983,0.0008643759,0.0004388399,0.0010134957,0.0011606839,0.0008678892,0.016320312],"category_scores_gemma":[0.0010335378,0.0004397771,0.00062202715,0.0008599595,0.00034846435,0.0011459423,0.0015180302,0.0009258232,0.007765755],"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.00043675245,0.0000847943,0.00041693196,0.00016709356,0.000067861125,0.00015673129,0.000083997336,0.015789198,0.055157218,0.002367957,0.03692948,0.88834196],"study_design_scores_gemma":[0.00005928666,0.00017971447,0.0017326233,0.000062966035,0.000052298892,0.00028391724,0.00015483463,0.8907362,0.06609477,0.011097961,0.02948163,0.00006372211],"about_ca_topic_score_codex":0.004257319,"about_ca_topic_score_gemma":0.009580809,"teacher_disagreement_score":0.016320312,"about_ca_system_score_codex":0.00045590373,"about_ca_system_score_gemma":0.0003868061,"threshold_uncertainty_score":0.0545969},"labels":[],"label_agreement":null},{"id":"W4402632818","doi":"10.1007/978-3-031-71602-7_20","title":"License Plate Detection and Character Recognition Using Deep Learning and Font Evaluation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle License Plate Recognition","field":"Engineering","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":"Font; Computer science; Character recognition; License; Character (mathematics); Artificial intelligence; Speech recognition; Optical character recognition; Deep learning; Pattern recognition (psychology); Computer vision; Natural language processing; Image (mathematics); Operating system","score_opus":0.022558393087848908,"score_gpt":0.24144000488537815,"score_spread":0.21888161179752924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402632818","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.39395815,0.0028227328,0.5540451,0.0004753489,0.00065477204,0.00028322212,0.0037761044,0.016763978,0.027220493],"genre_scores_gemma":[0.7432091,0.000983395,0.2091645,0.00021364822,0.00016807996,0.00011338572,0.007566088,0.00054580014,0.038036056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.00009077471,0.000033114375,0.00014747883,0.00022665378,0.0001034657],"domain_scores_gemma":[0.99875784,0.00025739035,0.00006695347,0.00014449365,0.00068516465,0.00008817579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007295902,0.0011202125,0.00075198006,0.0015946932,0.00025931717,0.0012789292,0.0010799103,0.0008176589,0.007446254],"category_scores_gemma":[0.0015321464,0.000276541,0.0007331682,0.00083243556,0.00023141177,0.0014210917,0.0008716472,0.00075948815,0.0058555733],"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.0005577233,0.00031817646,0.0040191766,0.00014509419,0.00009675686,0.00012393744,0.000025183454,0.021661919,0.05936846,0.0006859855,0.011538697,0.9014588],"study_design_scores_gemma":[0.000015038378,0.00014899926,0.004396336,0.000024056044,0.00005746192,0.0001483554,0.000046726454,0.9184475,0.0735664,0.00066667516,0.002455252,0.000027226752],"about_ca_topic_score_codex":0.004512088,"about_ca_topic_score_gemma":0.008037544,"teacher_disagreement_score":0.007446254,"about_ca_system_score_codex":0.0005187987,"about_ca_system_score_gemma":0.00045731766,"threshold_uncertainty_score":0.024910212},"labels":[],"label_agreement":null},{"id":"W4402633401","doi":"10.1007/978-3-031-71602-7_26","title":"Generative Plant Growth Simulation from Sequence-Informed Environmental Conditions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"McGill University","funders":"","keywords":"Computer science; Generative grammar; Sequence (biology); Artificial intelligence","score_opus":0.023009114106956913,"score_gpt":0.23503036589199397,"score_spread":0.21202125178503706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402633401","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.24288704,0.00039317625,0.7263181,0.000733181,0.0001557722,0.00009074024,0.0011477103,0.002141381,0.026132913],"genre_scores_gemma":[0.95948637,0.00015491637,0.033998083,0.00009730895,0.000037616825,0.00009745773,0.00042146127,0.00023577857,0.0054709204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998914,0.00003368448,0.0000045577945,0.000027814263,0.000026564208,0.000016009446],"domain_scores_gemma":[0.9985862,0.0011502014,0.000061386774,0.00007385573,0.00007232674,0.00005596583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036209385,0.00050464657,0.0007695965,0.00041763452,0.00036598774,0.0007982616,0.0014364592,0.001821902,0.0056664255],"category_scores_gemma":[0.002335858,0.00083765533,0.0009084382,0.0005794518,0.0010103481,0.00072792,0.0010388048,0.001049826,0.00059639785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008284153,0.0000032658068,0.00009156314,0.0000061043224,0.000003913247,0.000019109739,0.000012395943,0.9973354,0.00014379538,0.0016952433,0.000056118566,0.00062488235],"study_design_scores_gemma":[0.0000032107162,0.0000019633637,0.000023067892,0.0000010325708,0.0000013759899,0.000004168959,0.0000017732052,0.9985066,0.00006090455,0.0013323402,0.00006191288,0.0000016125506],"about_ca_topic_score_codex":0.0135486,"about_ca_topic_score_gemma":0.009942186,"teacher_disagreement_score":0.0135486,"about_ca_system_score_codex":0.0008483819,"about_ca_system_score_gemma":0.00065757846,"threshold_uncertainty_score":0.026939511},"labels":[],"label_agreement":null},{"id":"W4402634849","doi":"10.1007/978-3-031-72567-8_14","title":"Detrimental Task Execution Patterns in Mainstream OpenMP® Runtimes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Advanced Micro Devices (Canada)","funders":"Engineering and Physical Sciences Research Council; Durham University; Advanced Micro Devices","keywords":"Computer science; Parallel computing; Task (project management); Mainstream; Programming language; Operating system","score_opus":0.011791359499760987,"score_gpt":0.2529430034522362,"score_spread":0.2411516439524752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402634849","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.8488814,0.0007536067,0.124119,0.0007354394,0.00023425983,0.00009633801,0.00057972537,0.008432429,0.01616772],"genre_scores_gemma":[0.9161597,0.00031106794,0.0644218,0.00035877837,0.00010853351,0.00012890653,0.0011106515,0.004146512,0.013254124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953923,0.00069307134,0.00034078528,0.00080083596,0.0020279726,0.00074495317],"domain_scores_gemma":[0.9843717,0.0068363445,0.001384598,0.004635514,0.0019544826,0.0008173045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022690066,0.00057684426,0.00042294996,0.00096906105,0.0013915376,0.0020253998,0.0018670968,0.000995084,0.0032426915],"category_scores_gemma":[0.019895209,0.0009973258,0.0005011922,0.001746042,0.0013531839,0.0029982817,0.0018349121,0.0022633958,0.0012121542],"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.004605124,0.0011657799,0.08425268,0.00091971696,0.00017380333,0.0025041923,0.0046927375,0.092080675,0.12090718,0.120964594,0.04154286,0.52619064],"study_design_scores_gemma":[0.0003254909,0.0007668637,0.04184405,0.00029384042,0.0003123765,0.00468607,0.002181086,0.56899124,0.13964045,0.18864773,0.05205267,0.00025821457],"about_ca_topic_score_codex":0.0019826358,"about_ca_topic_score_gemma":0.0055602137,"teacher_disagreement_score":0.0032426915,"about_ca_system_score_codex":0.00090827496,"about_ca_system_score_gemma":0.0019411839,"threshold_uncertainty_score":0.011999786},"labels":[],"label_agreement":null},{"id":"W4402634902","doi":"10.1007/978-3-031-72567-8_4","title":"Integrating Multi-FPGA Acceleration to OpenMP Distributed Computing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Field-programmable gate array; Parallel computing; Acceleration; Computational science; Distributed computing; Embedded system; Physics","score_opus":0.029502028297544673,"score_gpt":0.2952120802992664,"score_spread":0.2657100520017217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402634902","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.09239813,0.0033437442,0.80822223,0.00078312826,0.0011901039,0.000088915534,0.00014683943,0.012137081,0.081689864],"genre_scores_gemma":[0.62507254,0.0009834942,0.33043346,0.00020462992,0.00022471265,0.000062045714,0.00027649407,0.00072511914,0.042017512],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977845,0.00003371185,0.000009207854,0.00003212965,0.00010017567,0.000046328692],"domain_scores_gemma":[0.9997106,0.00006042832,0.000013325073,0.0000821109,0.000101284706,0.00003222195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021365703,0.0005123197,0.00033275047,0.0003874266,0.00033923192,0.0010846133,0.00111638,0.00044690588,0.009267243],"category_scores_gemma":[0.0006718968,0.00026618864,0.00020773766,0.00059332774,0.00018491446,0.00091691763,0.00073845143,0.0008187848,0.0020451564],"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.0007124038,0.00028407667,0.0019045797,0.00028259135,0.00008154289,0.00036639505,0.00014868379,0.08104791,0.07644177,0.03844881,0.02268297,0.77759826],"study_design_scores_gemma":[0.00014530403,0.00052409316,0.0018830217,0.00008788459,0.000077818004,0.00053810835,0.00011184632,0.77967185,0.09217837,0.031864222,0.092868045,0.000049480223],"about_ca_topic_score_codex":0.0011135356,"about_ca_topic_score_gemma":0.0022864062,"teacher_disagreement_score":0.009267243,"about_ca_system_score_codex":0.00047225802,"about_ca_system_score_gemma":0.00036683097,"threshold_uncertainty_score":0.031001985},"labels":[],"label_agreement":null},{"id":"W4402635148","doi":"10.1007/978-3-031-71908-0_8","title":"Overview of the CLEF 2024 JOKER Track","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Manitoba","funders":"Agence Nationale de la Recherche","keywords":"Clef; Computer science; Track (disk drive); Information retrieval; Artificial intelligence; Computer graphics (images); Operating system; Engineering; Systems engineering","score_opus":0.02276968012044491,"score_gpt":0.2862518246063643,"score_spread":0.2634821444859194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402635148","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010977546,0.07313871,0.08250938,0.027558036,0.021619162,0.0022655125,0.1564515,0.08845566,0.5370245],"genre_scores_gemma":[0.020631975,0.014725987,0.0752553,0.009472917,0.008041978,0.0017465259,0.42020193,0.02206037,0.42786303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959174,0.00095206476,0.00020898735,0.00066389696,0.001849606,0.00040812418],"domain_scores_gemma":[0.9952892,0.0010544799,0.00014701733,0.0009366917,0.0016588625,0.00091375236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066117244,0.0022214297,0.002352943,0.0094085885,0.0029275154,0.00610333,0.0037434816,0.003144834,0.24146652],"category_scores_gemma":[0.008819288,0.0013580266,0.001423315,0.0076402463,0.0006196408,0.0068264436,0.004034687,0.0029100897,0.21402052],"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.00013119189,0.00006473031,0.00010394199,0.00023756395,0.000018148967,0.000028823293,0.000011887297,0.00024212015,0.0009564235,0.0013849228,0.9228735,0.073946804],"study_design_scores_gemma":[0.00011624843,0.00009389007,0.00088507554,0.000098469354,0.000017300998,0.00016992705,0.000020628453,0.0019312075,0.0014498525,0.0028598667,0.99231464,0.000042971253],"about_ca_topic_score_codex":0.008885126,"about_ca_topic_score_gemma":0.016812574,"teacher_disagreement_score":0.24146652,"about_ca_system_score_codex":0.0030642587,"about_ca_system_score_gemma":0.0032784408,"threshold_uncertainty_score":0.807786},"labels":[],"label_agreement":null},{"id":"W4402646777","doi":"10.1007/978-3-031-70242-6_14","title":"Coherence Graphs: Bridging the Gap in Text Segmentation with Unsupervised Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Ontario Tech University","funders":"","keywords":"Bridging (networking); Computer science; Coherence (philosophical gambling strategy); Segmentation; Artificial intelligence; Natural language processing; Physics","score_opus":0.021355864718021943,"score_gpt":0.24323039815055045,"score_spread":0.2218745334325285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402646777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009790624,0.0018937528,0.978119,0.00059309445,0.00014542161,0.0000916063,0.00092094205,0.0055016093,0.0029439384],"genre_scores_gemma":[0.17694849,0.002346912,0.79836994,0.0005325255,0.00071934256,0.00033291892,0.007976179,0.0042058113,0.0085679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789953,0.0007940719,0.00011841773,0.0006890807,0.0003804311,0.00011854032],"domain_scores_gemma":[0.9877995,0.009096676,0.0006528846,0.0013557711,0.00080493116,0.00029019086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021482888,0.0012777336,0.0014280119,0.0054716044,0.0012630522,0.002688181,0.002251782,0.0019211557,0.0074380157],"category_scores_gemma":[0.011048273,0.00093075755,0.001255039,0.0070442837,0.0016362414,0.0074739354,0.00334012,0.0021739346,0.004177483],"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.0005229225,0.00018447089,0.0013594839,0.0007677986,0.00015718704,0.00015993394,0.0010778372,0.028381513,0.012399776,0.05429134,0.038537994,0.8621598],"study_design_scores_gemma":[0.000097424454,0.00014688645,0.0017972086,0.00016435838,0.00015725226,0.0001683045,0.0004696721,0.6199442,0.012929836,0.3244867,0.039563656,0.00007450547],"about_ca_topic_score_codex":0.0037127694,"about_ca_topic_score_gemma":0.0070299865,"teacher_disagreement_score":0.0074380157,"about_ca_system_score_codex":0.0008699359,"about_ca_system_score_gemma":0.0014906626,"threshold_uncertainty_score":0.024882615},"labels":[],"label_agreement":null},{"id":"W4402647202","doi":"10.1007/978-3-031-70242-6_37","title":"CoURAGE: A Framework to Evaluate RAG Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Courage; Computer science; Theology; Philosophy","score_opus":0.02741885497644407,"score_gpt":0.2844265836925258,"score_spread":0.25700772871608174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402647202","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.009306331,0.00043367327,0.9636032,0.00034234882,0.00013618078,0.00017981094,0.00034617365,0.0034342534,0.022218004],"genre_scores_gemma":[0.38247687,0.0004553948,0.5914787,0.00018844697,0.00024063965,0.000681665,0.0007711065,0.0011604662,0.022546805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731123,0.0013395026,0.00010913748,0.000269986,0.00077324297,0.00019695847],"domain_scores_gemma":[0.99518675,0.0030565849,0.0004007358,0.00044536177,0.0006340059,0.00027654064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043092747,0.0014661351,0.00081729237,0.0020539712,0.0008229339,0.004077836,0.0023301255,0.0015693421,0.0151819885],"category_scores_gemma":[0.015766481,0.0003723875,0.00082799036,0.0011502873,0.0018889011,0.0050218883,0.0024177397,0.0017800167,0.0024238417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024935443,0.00012085012,0.0015788991,0.00022476053,0.000099877645,0.00014229036,0.00028562083,0.21048847,0.00195211,0.6441998,0.01376514,0.12689285],"study_design_scores_gemma":[0.00003893808,0.00010020714,0.00031945854,0.000042206266,0.000038558388,0.000039163875,0.00009081401,0.75254023,0.0015476355,0.23254041,0.012669907,0.00003246496],"about_ca_topic_score_codex":0.0033674573,"about_ca_topic_score_gemma":0.0032234706,"teacher_disagreement_score":0.0151819885,"about_ca_system_score_codex":0.0013516118,"about_ca_system_score_gemma":0.0014761166,"threshold_uncertainty_score":0.05078882},"labels":[],"label_agreement":null},{"id":"W4402654931","doi":"10.1007/978-3-031-70239-6_27","title":"SERIEMA: A Framework to Enhance Clustering Stability, Compactness, and Separation by Fusing Multimodal Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Compact space; Cluster analysis; Stability (learning theory); Separation (statistics); Artificial intelligence; Data mining; Machine learning; Mathematics","score_opus":0.03724753028036763,"score_gpt":0.3658450307763174,"score_spread":0.32859750049594977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402654931","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.001785464,0.00015828096,0.9961583,0.000047027897,0.000037340935,0.000023727443,0.00006488915,0.0012845462,0.00044043968],"genre_scores_gemma":[0.05125758,0.00027973688,0.9430624,0.00017403762,0.00009535656,0.00014256855,0.00058751623,0.0008457236,0.0035551006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840945,0.0004284921,0.00006360696,0.00040552166,0.00057220884,0.00012081455],"domain_scores_gemma":[0.9982395,0.00054794864,0.00013936225,0.00046079652,0.0004798852,0.00013241381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035388714,0.001817502,0.0017722744,0.001960161,0.0010200513,0.0025905455,0.0037156385,0.0018096467,0.0048478474],"category_scores_gemma":[0.005709068,0.0008756925,0.002078439,0.0017258773,0.001294106,0.0038440973,0.005090983,0.0026911497,0.0024131956],"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.0007430439,0.00022712229,0.0011989394,0.00044828138,0.00046213815,0.0002626048,0.0005979688,0.17565958,0.059640054,0.062001,0.017986586,0.6807727],"study_design_scores_gemma":[0.000041007308,0.00012184841,0.0004905178,0.000030756113,0.000070175076,0.00016983025,0.000083163635,0.9330352,0.016770815,0.0349229,0.014201641,0.00006208422],"about_ca_topic_score_codex":0.0029288325,"about_ca_topic_score_gemma":0.007604114,"teacher_disagreement_score":0.0048478474,"about_ca_system_score_codex":0.0008181644,"about_ca_system_score_gemma":0.0013945292,"threshold_uncertainty_score":0.01871562},"labels":[],"label_agreement":null},{"id":"W4402710970","doi":"10.1007/978-3-031-68031-1_2","title":"A Comprehensive Study on Benchmarking Permissioned Blockchains","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmarking; Computer science; Business","score_opus":0.02045608250688015,"score_gpt":0.26952859401060175,"score_spread":0.24907251150372162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402710970","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.5581626,0.025846245,0.28221798,0.0023338713,0.0005122708,0.0006047857,0.0024078533,0.0021994514,0.12571487],"genre_scores_gemma":[0.9364878,0.0039696954,0.045319643,0.00012355002,0.0001161851,0.00013741027,0.0020630944,0.00033529973,0.011447297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892323,0.0046609077,0.00060060446,0.0007678409,0.0041449843,0.00059337064],"domain_scores_gemma":[0.9694419,0.020510212,0.00076764333,0.0055296477,0.0032532131,0.0004973831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007468267,0.0007496468,0.0013682455,0.002454564,0.0012628692,0.0034267157,0.0018387972,0.0013904811,0.0071843336],"category_scores_gemma":[0.041141987,0.00044709866,0.00052388577,0.0082513755,0.0011836152,0.007873763,0.0015973914,0.001586101,0.0007134199],"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.0004958694,0.00075008115,0.008170126,0.0016279962,0.00019493929,0.0003527637,0.0007771092,0.25271025,0.005740778,0.2697478,0.012145019,0.44728723],"study_design_scores_gemma":[0.00008311634,0.001279396,0.007814227,0.0010071716,0.00012166026,0.00068749,0.0012352776,0.7372134,0.018092016,0.17650013,0.055852033,0.00011416679],"about_ca_topic_score_codex":0.0031722514,"about_ca_topic_score_gemma":0.0035206603,"teacher_disagreement_score":0.007468267,"about_ca_system_score_codex":0.0022181324,"about_ca_system_score_gemma":0.0020643312,"threshold_uncertainty_score":0.03949642},"labels":[],"label_agreement":null},{"id":"W4402716930","doi":"10.1007/978-3-031-72244-8_6","title":"Absentee Online Voters in the Northwest Territories:Attitudes and Impacts on Participation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Industry, Tourism and Investment; Government of Northwest Territories; McGill University; Brock University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Computer science; Operations research; Engineering","score_opus":0.017415107416022094,"score_gpt":0.27544093271862674,"score_spread":0.25802582530260465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402716930","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.99427646,0.00007866242,0.00004063446,0.00029089826,0.0000067241554,0.000007147185,0.00038180625,0.000002362513,0.0049153594],"genre_scores_gemma":[0.99554586,0.000113534734,0.000048306592,0.000041297822,0.0000053726535,0.000009134556,0.0003210524,0.000003695417,0.003911754],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988649,0.00025608737,0.000038071288,0.00010571163,0.000364618,0.00037063303],"domain_scores_gemma":[0.9949646,0.0007107358,0.0014160094,0.00017291117,0.0009783509,0.0017574019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011460426,0.00011804756,0.00025757507,0.0007204709,0.002168184,0.0019106752,0.00067310006,0.000364847,0.007028262],"category_scores_gemma":[0.003995533,0.0001234021,0.00033011433,0.0014959531,0.0009218573,0.00054832606,0.0014097871,0.0008986836,0.00084148365],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583675,0.000066785564,0.9833401,0.000017771503,0.000012606631,0.000066500135,0.00622147,0.00008576434,0.00017178185,0.0002346605,0.0011761099,0.008530554],"study_design_scores_gemma":[0.0000016143775,0.000019589086,0.98360693,0.00002136103,0.0000048230895,0.000022252983,0.014443241,0.00010394171,0.00005660614,0.000036709684,0.0016758519,0.000007070489],"about_ca_topic_score_codex":0.84020144,"about_ca_topic_score_gemma":0.9314013,"teacher_disagreement_score":0.15979856,"about_ca_system_score_codex":0.0045103794,"about_ca_system_score_gemma":0.004518683,"threshold_uncertainty_score":0.32147926},"labels":[],"label_agreement":null},{"id":"W4402716944","doi":"10.1007/978-3-031-72244-8_8","title":"Direct and Transparent Voter Verification with Everlasting Receipt-Freeness","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fonds National de la Recherche Luxembourg","keywords":"Computer science; Receipt; Theoretical computer science; Programming language; Computer security; World Wide Web","score_opus":0.017540018527792918,"score_gpt":0.23218890137076803,"score_spread":0.21464888284297512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402716944","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.06427826,0.0009989716,0.858955,0.0019248431,0.00077301334,0.0003786635,0.00023936802,0.0016584174,0.07079349],"genre_scores_gemma":[0.7616202,0.0009910485,0.16728722,0.0007134042,0.0003936771,0.00045118257,0.00027540902,0.00034682208,0.06792105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957496,0.001301269,0.00026354266,0.00061882846,0.001584302,0.0004824702],"domain_scores_gemma":[0.99387264,0.0017533692,0.00042690578,0.0031268932,0.000621197,0.0001989929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029228176,0.0004150977,0.0007240867,0.00073948805,0.00095437525,0.0029960973,0.0014888778,0.0013106108,0.007236291],"category_scores_gemma":[0.0060440237,0.00043274675,0.0008328545,0.00076241745,0.0030834428,0.0057704034,0.0069694035,0.0038411461,0.0023256715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046053395,0.0000984832,0.00056637294,0.00021805448,0.000062051,0.0003725918,0.00073391746,0.008180031,0.025338778,0.8391772,0.0052142497,0.119577795],"study_design_scores_gemma":[0.0003233361,0.00045704533,0.0009079612,0.00022900711,0.00011608305,0.0011080933,0.00029035643,0.09122236,0.110146984,0.6678078,0.12719157,0.00019942608],"about_ca_topic_score_codex":0.00027259192,"about_ca_topic_score_gemma":0.00018788734,"teacher_disagreement_score":0.007236291,"about_ca_system_score_codex":0.0006764131,"about_ca_system_score_gemma":0.001147101,"threshold_uncertainty_score":0.02420783},"labels":[],"label_agreement":null},{"id":"W4402716981","doi":"10.1007/978-3-031-72244-8","title":"Electronic Voting","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds National de la Recherche Luxembourg; Fonds De La Recherche Scientifique - FNRS; Social Sciences and Humanities Research Council of Canada; Deutsche Forschungsgemeinschaft; Narodowe Centrum Badań i Rozwoju; Agence Nationale de la Recherche; National Science Foundation","keywords":"Computer science; Electronic voting; Voting; Artificial intelligence; Political science; Law; Politics","score_opus":0.008531195906449483,"score_gpt":0.23614323625329692,"score_spread":0.22761204034684743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402716981","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014346757,0.005708866,0.009698817,0.008701262,0.019840783,0.0003718848,0.004362399,0.0019209308,0.94796044],"genre_scores_gemma":[0.018897556,0.006152347,0.006153914,0.003391584,0.004429648,0.0003406547,0.008863715,0.0012214098,0.95054907],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99324197,0.0012783401,0.0006158953,0.00082702015,0.0033901567,0.0006465616],"domain_scores_gemma":[0.99344265,0.0015772555,0.00028968297,0.0014944196,0.0026228207,0.0005732196],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038113152,0.00087255915,0.0010350661,0.003571001,0.0029418224,0.009392101,0.0021977979,0.002488837,0.40158615],"category_scores_gemma":[0.017418606,0.00040725368,0.00085323636,0.0049566207,0.0010159861,0.007875335,0.0046023666,0.0019092743,0.27049398],"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.000058530317,0.000029336374,0.00037057974,0.0003000683,0.000010642514,0.00005253638,0.00017199096,0.00021908998,0.0001967817,0.040724803,0.75641584,0.20144978],"study_design_scores_gemma":[0.0000046114383,0.000008833638,0.0001484371,0.00008951966,0.0000018767499,0.000033417287,0.000075874865,0.000072371375,0.000098735974,0.0032005452,0.9962604,0.000005332635],"about_ca_topic_score_codex":0.0013219462,"about_ca_topic_score_gemma":0.0021152142,"teacher_disagreement_score":0.40158615,"about_ca_system_score_codex":0.0018747795,"about_ca_system_score_gemma":0.0022795766,"threshold_uncertainty_score":0.85356474},"labels":[],"label_agreement":null},{"id":"W4402760558","doi":"10.1007/978-3-031-69073-0_14","title":"The Velodrome - ProCyclists Data Analytics","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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":"McGill University","funders":"","keywords":"Computer science; Analytics; Data analysis; Data science; Data mining","score_opus":0.02475716181696552,"score_gpt":0.24887649416719917,"score_spread":0.22411933235023365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402760558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059611886,0.004280765,0.5989611,0.0023223145,0.0015240978,0.00052351604,0.03847448,0.18929422,0.15865834],"genre_scores_gemma":[0.046812028,0.0046973866,0.65298295,0.0015489644,0.0007844946,0.0006571133,0.08644196,0.035848744,0.17022645],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998933,0.000100797806,0.00005685888,0.0002602558,0.00058409217,0.00006502833],"domain_scores_gemma":[0.9984963,0.0003764262,0.00005581816,0.0005700439,0.00034745157,0.00015397873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011446086,0.0014595948,0.0008923928,0.0030702206,0.00068538944,0.004376945,0.0022604514,0.0006430476,0.03756396],"category_scores_gemma":[0.0030357635,0.0010267989,0.001131246,0.003224067,0.00038868512,0.0040477044,0.0029057069,0.002249315,0.024137639],"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.00011904912,0.000068202,0.0011433996,0.00023126721,0.000058409918,0.00009603085,0.00017318348,0.0025296393,0.0032027827,0.026391732,0.51213825,0.453848],"study_design_scores_gemma":[0.00004218239,0.00005379355,0.0015915794,0.00022290576,0.000031260148,0.0002754273,0.00013720652,0.044049364,0.0068014227,0.038436975,0.9082933,0.00006463937],"about_ca_topic_score_codex":0.004859271,"about_ca_topic_score_gemma":0.005953396,"teacher_disagreement_score":0.03756396,"about_ca_system_score_codex":0.00065307197,"about_ca_system_score_gemma":0.0012763821,"threshold_uncertainty_score":0.12566394},"labels":[],"label_agreement":null},{"id":"W4402760773","doi":"10.1007/978-3-031-69073-0_8","title":"Mechanomyography as a Promising Tool for Managing Physical Activity and Preventing Injuries in the Field","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Performance and Training","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Thomas Hospital","funders":"","keywords":"Computer science; Field (mathematics); Human–computer interaction; Computer security; Simulation","score_opus":0.014396711820726622,"score_gpt":0.29551878896156175,"score_spread":0.28112207714083515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402760773","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017187644,0.5986645,0.058582712,0.01433408,0.00718742,0.00014236006,0.0004350426,0.0007243512,0.3027419],"genre_scores_gemma":[0.07421518,0.51591325,0.07373036,0.006331115,0.007529191,0.00022816763,0.00039151366,0.00021943776,0.32144177],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999219,0.000015387295,0.0000035077578,0.000012641033,0.000040106203,0.0000065213526],"domain_scores_gemma":[0.99985576,0.00010175477,0.000006899266,0.0000055896744,0.000012004613,0.00001789141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170324,0.0005721481,0.00040402656,0.0010458974,0.00017554846,0.0009944135,0.00054854876,0.0008993273,0.02293677],"category_scores_gemma":[0.000292898,0.00016869152,0.0002752114,0.00052048947,0.0005019629,0.0011672294,0.00046862505,0.0011922324,0.00434667],"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.00016603958,0.00022563191,0.0010302104,0.0012740712,0.00003003927,0.00084048527,0.00016213482,0.0005885144,0.016321413,0.01505096,0.0584814,0.90582913],"study_design_scores_gemma":[0.00013394844,0.001857813,0.013901464,0.003165146,0.00009528479,0.013244057,0.00043681823,0.0025017504,0.00804038,0.03345429,0.92306894,0.0001000349],"about_ca_topic_score_codex":0.00034529105,"about_ca_topic_score_gemma":0.001519773,"teacher_disagreement_score":0.02293677,"about_ca_system_score_codex":0.00013036504,"about_ca_system_score_gemma":0.00030766387,"threshold_uncertainty_score":0.076731086},"labels":[],"label_agreement":null},{"id":"W4402782556","doi":"10.1007/978-3-031-71602-7_16","title":"VAeViT: Fusing Multi-views for Complete 3D Object Recognition","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Object (grammar); Computer vision; Cognitive neuroscience of visual object recognition","score_opus":0.0657369932955668,"score_gpt":0.2700905481321496,"score_spread":0.2043535548365828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402782556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002091022,0.0007713627,0.9844147,0.000050300794,0.00011017678,0.000043737527,0.00049071776,0.01046075,0.0015672223],"genre_scores_gemma":[0.041398957,0.0008970121,0.9465898,0.00024287272,0.000067581546,0.00014030654,0.0026479936,0.0018668025,0.0061486806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991062,0.00008230069,0.000042181375,0.00022106413,0.00045803894,0.00009017068],"domain_scores_gemma":[0.99955195,0.00013335346,0.000027700595,0.00015619711,0.000100289646,0.00003047606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630381,0.001987443,0.0018241995,0.0016710662,0.00037748244,0.0016977547,0.002570554,0.0018111864,0.013665156],"category_scores_gemma":[0.0011833834,0.0013725536,0.001851025,0.001798482,0.00051435886,0.0024582644,0.0040543918,0.0016025878,0.0074984343],"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.00019555069,0.000052880598,0.00023053569,0.00022126276,0.00015440283,0.00015134133,0.00008404124,0.012602371,0.047274906,0.004652599,0.025488552,0.9088916],"study_design_scores_gemma":[0.00004430244,0.00019396127,0.001236177,0.00013545135,0.00012513495,0.0013055842,0.00011125041,0.8019735,0.09543599,0.027581243,0.07175521,0.00010215963],"about_ca_topic_score_codex":0.0024770033,"about_ca_topic_score_gemma":0.0039727134,"teacher_disagreement_score":0.013665156,"about_ca_system_score_codex":0.00040987367,"about_ca_system_score_gemma":0.0005003399,"threshold_uncertainty_score":0.045714557},"labels":[],"label_agreement":null},{"id":"W4402782565","doi":"10.1007/978-3-031-71602-7_14","title":"Explaining Network Decision Provides Insights on the Causal Interaction Between Brain Regions in a Motor Imagery Task","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Motor imagery; Task (project management); Artificial intelligence; Human–computer interaction; Cognitive science; Neuroscience; Brain–computer interface; Electroencephalography; Psychology","score_opus":0.04178329398698661,"score_gpt":0.290067897650129,"score_spread":0.24828460366314242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402782565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23248291,0.0008445972,0.7427518,0.0024414407,0.00017986224,0.00003532721,0.0005490961,0.0004184751,0.020296486],"genre_scores_gemma":[0.9334648,0.0005536513,0.06021369,0.00007943001,0.000097012955,0.00003209887,0.00027048073,0.00011476119,0.0051739602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9999188,0.00002491849,0.0000040402156,0.00003168153,0.000010219878,0.0000102921],"domain_scores_gemma":[0.9991381,0.00071921875,0.000049304934,0.000044031654,0.000024284978,0.000024977231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003606325,0.00048427496,0.0002880259,0.00027257347,0.00024749633,0.0008405737,0.00065942446,0.00084280816,0.0060070194],"category_scores_gemma":[0.0025618977,0.0003413253,0.0004263891,0.00033203652,0.00035210277,0.0018532198,0.00032821734,0.0010065794,0.0004963105],"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.0003335157,0.00014716279,0.0069414554,0.00028417193,0.00020343639,0.0006703248,0.0005803344,0.40903598,0.04238299,0.38200352,0.0066558863,0.15076122],"study_design_scores_gemma":[0.000010911186,0.000018855697,0.0020426328,0.000011077803,0.000024033667,0.00007445641,0.000027697108,0.66693574,0.001804632,0.32817644,0.0008606861,0.000012812821],"about_ca_topic_score_codex":0.0013545571,"about_ca_topic_score_gemma":0.0017427987,"teacher_disagreement_score":0.0060070194,"about_ca_system_score_codex":0.00026934274,"about_ca_system_score_gemma":0.00019145194,"threshold_uncertainty_score":0.020095468},"labels":[],"label_agreement":null},{"id":"W4402782644","doi":"10.1007/978-3-031-71602-7_11","title":"Comparative Study of Deep Learning Models in Melanoma Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Machine learning","score_opus":0.03130110894724508,"score_gpt":0.27035391171462075,"score_spread":0.23905280276737567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402782644","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.82367843,0.020346727,0.132362,0.0016887633,0.0006060503,0.0001103255,0.0019066272,0.0019277927,0.01737341],"genre_scores_gemma":[0.9645974,0.002253612,0.02332207,0.00012238458,0.00007847663,0.000027363816,0.0015719909,0.00012687845,0.007899806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994605,0.00017890248,0.000032267846,0.0001082977,0.00014347032,0.00007649641],"domain_scores_gemma":[0.99437875,0.004111483,0.00014455461,0.00028287794,0.0009657017,0.00011658994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022401656,0.00083635567,0.0006073282,0.0010489979,0.0002698445,0.0010612807,0.0009080431,0.0009831205,0.0025364573],"category_scores_gemma":[0.00628896,0.00024760392,0.00056713057,0.000761266,0.00022151924,0.0014518808,0.00048211412,0.0007726906,0.00068313867],"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.0023009095,0.0006329305,0.016794927,0.0004934404,0.00044915604,0.00014161244,0.00012555382,0.38643876,0.0065635913,0.003959634,0.011424431,0.5706751],"study_design_scores_gemma":[0.00001527551,0.00023960363,0.003386253,0.000031649237,0.00009049866,0.00004515447,0.000057093723,0.9904883,0.0034871316,0.001147259,0.000999007,0.000012722491],"about_ca_topic_score_codex":0.0137451915,"about_ca_topic_score_gemma":0.012866394,"teacher_disagreement_score":0.0137451915,"about_ca_system_score_codex":0.0013382176,"about_ca_system_score_gemma":0.0007251909,"threshold_uncertainty_score":0.027330339},"labels":[],"label_agreement":null},{"id":"W4402782652","doi":"10.1007/978-3-031-71602-7_13","title":"Machine Learning for Clinical Score Prediction from Longitudinal Dataset: A Case Study on Parkinson’s Disease","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","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 Windsor","funders":"","keywords":"Computer science; Parkinson's disease; Artificial intelligence; Machine learning; Disease; Medicine; Internal medicine","score_opus":0.07861082904992761,"score_gpt":0.3547165038461319,"score_spread":0.2761056747962043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402782652","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.73635775,0.017434455,0.18837768,0.014382957,0.001117591,0.00026114398,0.018650042,0.00393767,0.019480653],"genre_scores_gemma":[0.86501086,0.0030315514,0.10017152,0.0006477664,0.00038272163,0.0001723445,0.015675401,0.00022328107,0.014684376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993593,0.00029726035,0.000045797253,0.00010335493,0.0001399362,0.000054379154],"domain_scores_gemma":[0.99671173,0.002533518,0.00010084759,0.0002465471,0.00032565143,0.00008166653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025182324,0.0004908899,0.0005271291,0.000638271,0.00028261062,0.0008443153,0.00081396237,0.00090434327,0.002158687],"category_scores_gemma":[0.0051136855,0.00015953895,0.0006535296,0.0012309884,0.00019248464,0.00064973725,0.0004976113,0.0011539129,0.0010502812],"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.000641153,0.000590387,0.08054813,0.00022516804,0.00020442823,0.0016813844,0.00026592685,0.0275849,0.0026294065,0.0025358733,0.09409929,0.788994],"study_design_scores_gemma":[0.00013491258,0.0009750804,0.08886379,0.00017777036,0.0002294654,0.004101653,0.00071689504,0.83414876,0.008311886,0.019876143,0.04234172,0.00012191626],"about_ca_topic_score_codex":0.0048895106,"about_ca_topic_score_gemma":0.0077164704,"teacher_disagreement_score":0.0048895106,"about_ca_system_score_codex":0.00050481834,"about_ca_system_score_gemma":0.0005360607,"threshold_uncertainty_score":0.013317883},"labels":[],"label_agreement":null},{"id":"W4402782664","doi":"10.1007/978-3-031-71602-7_5","title":"Robust Clustering with McDonald’s Beta-Liouville Mixture Models for Proportional Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; BETA (programming language); Artificial intelligence; Programming language","score_opus":0.06588708816020786,"score_gpt":0.2805819087748913,"score_spread":0.21469482061468345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402782664","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.0007873041,0.0002044128,0.9983353,0.00006721535,0.000022627328,0.000016255011,0.000032999553,0.00017838505,0.00035558903],"genre_scores_gemma":[0.045739714,0.0005292623,0.94659686,0.00021723265,0.00014954178,0.00028515613,0.00080183265,0.00080784486,0.0048725326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99129933,0.0051502576,0.00045809173,0.0014880133,0.0013250672,0.00027934182],"domain_scores_gemma":[0.98243594,0.011617816,0.00085864915,0.0030223397,0.0017178725,0.00034731656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01379347,0.0018831177,0.003349419,0.0034905174,0.0019372588,0.004636885,0.0083128065,0.0048959996,0.0041234004],"category_scores_gemma":[0.04794553,0.002714344,0.00442813,0.004990666,0.0033086154,0.0053331363,0.0064434814,0.005476692,0.0031209546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028664805,0.00010795162,0.0011483595,0.0004167947,0.00042239722,0.00014146362,0.00053740264,0.39912957,0.0038322175,0.41639313,0.008827366,0.1687567],"study_design_scores_gemma":[0.000012573589,0.000014906151,0.00020311603,0.00002926783,0.000025177906,0.0000708209,0.000021987928,0.8400252,0.00076094526,0.15570831,0.0030822563,0.000045417408],"about_ca_topic_score_codex":0.006952143,"about_ca_topic_score_gemma":0.008189881,"teacher_disagreement_score":0.01379347,"about_ca_system_score_codex":0.0033691397,"about_ca_system_score_gemma":0.0021174266,"threshold_uncertainty_score":0.07294768},"labels":[],"label_agreement":null},{"id":"W4402791308","doi":"10.1007/978-3-031-73370-3_5","title":"Improved MPI Collectives for 3D-FFT","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Fast Fourier transform; Parallel computing; Programming language; Algorithm","score_opus":0.015659025965667983,"score_gpt":0.2656998293147867,"score_spread":0.2500408033491187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402791308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016099216,0.0006598289,0.9084836,0.00063856156,0.0011856436,0.00008494364,0.0014634171,0.036309462,0.035075184],"genre_scores_gemma":[0.14777045,0.00045254565,0.8013147,0.00041131038,0.0004480006,0.00043701608,0.0036580714,0.011306216,0.034201603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991109,0.00012396931,0.0000527252,0.000101739584,0.00050479505,0.00010587146],"domain_scores_gemma":[0.99780136,0.00042274166,0.000071037175,0.0008879491,0.0006813725,0.00013561414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410552,0.0013280186,0.0014350804,0.0013001553,0.0018110952,0.0016725472,0.0037911911,0.0011045103,0.033121586],"category_scores_gemma":[0.0036224907,0.00076684396,0.0014067173,0.0027103196,0.0006581791,0.0023017589,0.002862153,0.0024588376,0.014144326],"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.0009740166,0.00033081588,0.0016526722,0.00046610888,0.00020719744,0.0004260572,0.00050176925,0.13759196,0.02809385,0.096857004,0.16506004,0.5678386],"study_design_scores_gemma":[0.00022223454,0.00009905097,0.0008773831,0.000056260204,0.00006528053,0.00019049179,0.00008550658,0.82146704,0.020543324,0.077992186,0.07829316,0.00010803849],"about_ca_topic_score_codex":0.0052145324,"about_ca_topic_score_gemma":0.0105944285,"teacher_disagreement_score":0.033121586,"about_ca_system_score_codex":0.0008367594,"about_ca_system_score_gemma":0.0010587086,"threshold_uncertainty_score":0.11080277},"labels":[],"label_agreement":null},{"id":"W4402791353","doi":"10.1007/978-3-031-73370-3","title":"Recent Advances in the Message Passing Interface","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Los Alamos National Laboratory; Sandia National Laboratories; Lawrence Livermore National Laboratory; University of Illinois at Urbana-Champaign; Technische Universität München; Universität Stuttgart; Technische Universität Wien; Stony Brook University; RWTH Aachen University; Ohio State University; Queen's University; Universidad Carlos III de Madrid; RIKEN; Nvidia; Kungliga Tekniska Högskolan; Université Grenoble Alpes; Cisco Systems","keywords":"Computer science; Message passing; Interface (matter); Message Passing Interface; Programming language; Operating system","score_opus":0.018516657241617343,"score_gpt":0.29474764947546117,"score_spread":0.27623099223384384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402791353","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006770551,0.41738647,0.41521397,0.008181852,0.009529787,0.00011212829,0.00021833515,0.0048740786,0.13771285],"genre_scores_gemma":[0.07188666,0.40475678,0.26945627,0.0032384736,0.012492534,0.00020670671,0.0008972409,0.0017202528,0.23534516],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992397,0.00013660004,0.000045677803,0.000099648634,0.0003938813,0.00008453667],"domain_scores_gemma":[0.9980615,0.0011089253,0.000080221944,0.00021149438,0.00043672108,0.000101123886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018776103,0.0010145082,0.0007526467,0.001581518,0.0003937863,0.0028373622,0.0017505635,0.0012190284,0.024413466],"category_scores_gemma":[0.0032807915,0.00055313413,0.0004983081,0.003072421,0.0010386469,0.005314453,0.0014871306,0.0028738792,0.011431874],"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.0001836773,0.00011928606,0.00018747442,0.0017715215,0.000023525943,0.00007900149,0.00015626148,0.0026626184,0.007757656,0.13431305,0.043928348,0.80881757],"study_design_scores_gemma":[0.000031388234,0.00014706214,0.00022811539,0.00025942555,0.00004942392,0.00032919098,0.000048863025,0.010706618,0.007041297,0.04907615,0.93205214,0.000030338524],"about_ca_topic_score_codex":0.00049500674,"about_ca_topic_score_gemma":0.0003844121,"teacher_disagreement_score":0.024413466,"about_ca_system_score_codex":0.0006500993,"about_ca_system_score_gemma":0.0007649252,"threshold_uncertainty_score":0.08167118},"labels":[],"label_agreement":null},{"id":"W4402796181","doi":"10.1007/978-3-031-72341-4_7","title":"Biologically-Plausible Markov Chain Monte Carlo Sampling from Vector Symbolic Algebra-Encoded Distributions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","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":"National Research Council Canada; University of Waterloo","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Markov chain; Monte Carlo method; Rejection sampling; Sampling (signal processing); Algebra over a field; Algorithm; Hybrid Monte Carlo; Theoretical computer science; Artificial intelligence; Mathematics; Machine learning; Statistics; Pure mathematics; Bayesian probability","score_opus":0.05858435400856313,"score_gpt":0.32045753521067605,"score_spread":0.2618731812021129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402796181","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.03691679,0.00047728408,0.9491156,0.0005714861,0.0001051065,0.000064742504,0.00026188677,0.00033807268,0.012149018],"genre_scores_gemma":[0.69853354,0.00070577,0.28994873,0.00032260883,0.00015850094,0.00029097148,0.0007763399,0.0004538446,0.008809762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994112,0.00028405318,0.000021070473,0.000075073905,0.00015717995,0.000051405645],"domain_scores_gemma":[0.99523574,0.0039436854,0.00013896555,0.00030834766,0.0002484645,0.00012486121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014722814,0.00043299704,0.0010270752,0.0008810629,0.00074843585,0.0015823622,0.0016512021,0.0012366594,0.0052664545],"category_scores_gemma":[0.008869242,0.00057395105,0.0008778676,0.0010649367,0.0019588582,0.0022221052,0.0012952627,0.0018201935,0.0007348523],"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.00006461663,0.000031014875,0.0004629105,0.0000831114,0.000024647825,0.0000867989,0.00009652572,0.40501502,0.0008415764,0.57643706,0.0015869935,0.01526977],"study_design_scores_gemma":[0.000008474868,0.000006764427,0.00006943294,0.000012845786,0.000003440651,0.000020669064,0.000011205865,0.7557432,0.00027354198,0.24326791,0.0005731863,0.000009342451],"about_ca_topic_score_codex":0.0029601185,"about_ca_topic_score_gemma":0.0036202043,"teacher_disagreement_score":0.0052664545,"about_ca_system_score_codex":0.0015764019,"about_ca_system_score_gemma":0.0012783009,"threshold_uncertainty_score":0.01761806},"labels":[],"label_agreement":null},{"id":"W4402796770","doi":"10.1007/978-3-031-72356-8_30","title":"Ch4os: Discretized Generative Adversarial Network for Functionality-Preserving Evasive Modification on Malware","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Queen's University","funders":"","keywords":"Computer science; Adversarial system; Malware; Generative adversarial network; Generative grammar; Discretization; Theoretical computer science; Artificial intelligence; Computer security; Distributed computing; Computer network; Deep learning; Mathematics","score_opus":0.028880853594862508,"score_gpt":0.28962250681974633,"score_spread":0.2607416532248838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402796770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020943757,0.00027774714,0.9695249,0.00016508519,0.00011473274,0.00007355602,0.00013565314,0.003152522,0.0056119952],"genre_scores_gemma":[0.8251035,0.00030188207,0.15926537,0.00025381253,0.000075346215,0.00017649353,0.00045598162,0.00042726065,0.013940294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.00008104862,0.000010897088,0.000079400845,0.00015142641,0.00006589879],"domain_scores_gemma":[0.99936694,0.00032433012,0.000041552197,0.00016667623,0.00006555907,0.00003497224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049164734,0.0008002193,0.0006249457,0.0004058507,0.00032797834,0.0005663103,0.0012497689,0.00096647616,0.0038690104],"category_scores_gemma":[0.0017131952,0.00026218157,0.0005446235,0.00027631118,0.0009390501,0.0009741362,0.0018958991,0.001462559,0.00088510005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001973651,0.00006425369,0.00037305287,0.000096520256,0.000044222612,0.0001529292,0.000060454084,0.8174822,0.01251939,0.036674425,0.0057780035,0.12655717],"study_design_scores_gemma":[0.0000051513184,0.00002732086,0.000044984772,0.000004160393,0.000004013534,0.000032527012,0.0000035356206,0.98584586,0.0018178014,0.011514915,0.000695496,0.0000041834455],"about_ca_topic_score_codex":0.0011574748,"about_ca_topic_score_gemma":0.0016578606,"teacher_disagreement_score":0.0038690104,"about_ca_system_score_codex":0.0005996213,"about_ca_system_score_gemma":0.0005504545,"threshold_uncertainty_score":0.012943089},"labels":[],"label_agreement":null},{"id":"W4402937086","doi":"10.1007/978-3-031-66456-4_9","title":"Modeling and Verification of Solidity Smart Contracts with the B Method","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Université de Sherbrooke","funders":"","keywords":"Solidity; Computer science; Engineering drawing; Programming language; Engineering","score_opus":0.016307290946948074,"score_gpt":0.2550118919287621,"score_spread":0.23870460098181404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402937086","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.008883789,0.000104879065,0.9852056,0.00014893303,0.00002650777,0.000077804565,0.00007915638,0.00056453806,0.004908807],"genre_scores_gemma":[0.44702777,0.00041433223,0.5407941,0.00012020761,0.000041443636,0.00033537584,0.00029771766,0.00044374543,0.010525264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818265,0.0007094958,0.00010980321,0.00025845022,0.0005760508,0.00016359414],"domain_scores_gemma":[0.9971181,0.0016317292,0.00022232493,0.0006373201,0.000294929,0.00009561767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025532418,0.000733919,0.0008615831,0.0008246829,0.0009261885,0.0023600503,0.001867781,0.0015796451,0.0061561386],"category_scores_gemma":[0.005376904,0.0011096864,0.0014991574,0.0007915029,0.002636671,0.003962539,0.0023008173,0.0022373716,0.0010202592],"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.00017353479,0.00007042964,0.0005122207,0.00018513882,0.000048543207,0.00017069846,0.00022571384,0.35691127,0.0058748857,0.59907097,0.0015598126,0.03519681],"study_design_scores_gemma":[0.00004722159,0.00002879691,0.00006845285,0.000033009273,0.000012336029,0.000035823676,0.00002348422,0.80801934,0.0032569745,0.18380307,0.004655964,0.000015524933],"about_ca_topic_score_codex":0.00689046,"about_ca_topic_score_gemma":0.004354668,"teacher_disagreement_score":0.00689046,"about_ca_system_score_codex":0.0011394781,"about_ca_system_score_gemma":0.0025292977,"threshold_uncertainty_score":0.020594358},"labels":[],"label_agreement":null},{"id":"W4402943948","doi":"10.1007/978-3-031-72667-5_1","title":"ScaleDreamer: Scalable Text-to-3D Synthesis with Asynchronous Score Distillation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Scalability; Asynchronous communication; Distillation; Artificial intelligence; Database; Computer network; Chemistry; Chromatography","score_opus":0.012615142243401312,"score_gpt":0.2504131863334977,"score_spread":0.23779804409009636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402943948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072940364,0.00024421024,0.9214928,0.00010416398,0.00035283397,0.00016882637,0.001214712,0.05623852,0.012889912],"genre_scores_gemma":[0.16394994,0.00025151213,0.7965064,0.00031955694,0.00015242358,0.00042830865,0.003774525,0.0092463335,0.025371043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993247,0.00006491953,0.000042931002,0.0001302664,0.0003798503,0.0000573132],"domain_scores_gemma":[0.999483,0.00021143619,0.00002485033,0.00013695122,0.000104907245,0.00003881831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043983076,0.0020664807,0.0013355623,0.0009984733,0.00055269036,0.0015060274,0.002614675,0.0011624525,0.060932107],"category_scores_gemma":[0.0014460421,0.0008727576,0.0012350996,0.0010691737,0.0006427492,0.0014819143,0.003768776,0.001293214,0.013878004],"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.0009480733,0.00019752543,0.00041206036,0.00050353183,0.00014153657,0.00044222613,0.0002931181,0.07688286,0.12177434,0.024043877,0.05036692,0.7239939],"study_design_scores_gemma":[0.00028941713,0.00029661477,0.00028933104,0.00005781849,0.000058237852,0.0003320607,0.00011041962,0.77611285,0.13459784,0.028124051,0.059618145,0.00011320192],"about_ca_topic_score_codex":0.0016646651,"about_ca_topic_score_gemma":0.0039404347,"teacher_disagreement_score":0.060932107,"about_ca_system_score_codex":0.0005208056,"about_ca_system_score_gemma":0.0006645604,"threshold_uncertainty_score":0.20383817},"labels":[],"label_agreement":null},{"id":"W4402951594","doi":"10.1007/978-3-031-73235-5_14","title":"Generating Human Interaction Motions in Scenes with Text Control","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","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":"","keywords":"Computer science; Computer vision; Artificial intelligence; Control (management); Human–computer interaction; Computer graphics (images)","score_opus":0.01413488161610087,"score_gpt":0.23911668079261364,"score_spread":0.22498179917651276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402951594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02894117,0.00023003963,0.9517105,0.00009146209,0.00011911376,0.0002003573,0.0002746144,0.0041187294,0.014313991],"genre_scores_gemma":[0.47459102,0.00040936467,0.49672803,0.00014845959,0.0000908907,0.00025235527,0.0012960797,0.0015686387,0.024915189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999856,0.00002333071,0.000005417973,0.0000483047,0.000047201876,0.00001975683],"domain_scores_gemma":[0.99985945,0.00007167819,0.000010697426,0.000021992288,0.000022160759,0.000013924038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002032484,0.00096924754,0.00050784467,0.00042100943,0.00033807548,0.0005369966,0.00092526583,0.00063477305,0.014113481],"category_scores_gemma":[0.00080075476,0.00040501394,0.0006292309,0.00038519583,0.00047482533,0.0005955836,0.0008463693,0.00044024453,0.0017224147],"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.00079019176,0.0002124039,0.0006016024,0.0005001229,0.000087669934,0.0005233935,0.00049650786,0.22355905,0.22004265,0.023990143,0.018220795,0.51097554],"study_design_scores_gemma":[0.000121207486,0.0002293002,0.00075227144,0.000043714743,0.000039711274,0.00024022872,0.000114118484,0.9212885,0.047539365,0.015281711,0.014324515,0.000025390698],"about_ca_topic_score_codex":0.0018012569,"about_ca_topic_score_gemma":0.002368794,"teacher_disagreement_score":0.014113481,"about_ca_system_score_codex":0.00031328294,"about_ca_system_score_gemma":0.0001837229,"threshold_uncertainty_score":0.04721433},"labels":[],"label_agreement":null},{"id":"W4402951630","doi":"10.1007/978-3-031-73235-5_5","title":"AFreeCA: Annotation-Free Counting for All","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Annotation; Artificial intelligence","score_opus":0.018501839513415053,"score_gpt":0.24661791583381779,"score_spread":0.22811607632040273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402951630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010586587,0.00029505815,0.9845057,0.0002500227,0.00025866233,0.00010743102,0.0007408207,0.008488919,0.004294717],"genre_scores_gemma":[0.05795097,0.00038181746,0.9034234,0.00073684857,0.0004410256,0.00064702326,0.0045318757,0.006531264,0.02535577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449146,0.0012745156,0.00028262928,0.001830007,0.001568138,0.00055325177],"domain_scores_gemma":[0.99218386,0.0026422427,0.0002747251,0.0035715685,0.0010721098,0.0002554707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031438938,0.0036902768,0.003577823,0.0030951984,0.0023610338,0.004098306,0.006833424,0.0036927706,0.041070122],"category_scores_gemma":[0.020719966,0.0017057176,0.0028315736,0.003265018,0.001997666,0.006566598,0.007158717,0.0065969424,0.01905909],"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.0004046834,0.00017740532,0.0004334966,0.00038328176,0.00014451369,0.00015213898,0.0001282755,0.05343852,0.0065838536,0.14933185,0.11356877,0.67525315],"study_design_scores_gemma":[0.00006252167,0.00006278457,0.0001758276,0.000085953274,0.00004827229,0.00022052113,0.000034844976,0.57485944,0.008140661,0.3835897,0.032660183,0.000059345923],"about_ca_topic_score_codex":0.005060414,"about_ca_topic_score_gemma":0.0113763455,"teacher_disagreement_score":0.041070122,"about_ca_system_score_codex":0.0017267566,"about_ca_system_score_gemma":0.0037896407,"threshold_uncertainty_score":0.1373933},"labels":[],"label_agreement":null},{"id":"W4402952315","doi":"10.1007/978-3-031-72649-1_12","title":"MagDiff: Multi-alignment Diffusion for High-Fidelity Video Generation and Editing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Fidelity; Computer graphics (images); Diffusion; Multimedia; Telecommunications","score_opus":0.021244858952395137,"score_gpt":0.25142125625659617,"score_spread":0.23017639730420103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402952315","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.0009854503,0.00011065485,0.99120796,0.000039743496,0.00006394795,0.000039712962,0.00011879337,0.00686312,0.0005705383],"genre_scores_gemma":[0.024898622,0.00015845333,0.9681322,0.00008025033,0.00005619472,0.0001291864,0.00060402346,0.0021290577,0.003812063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992429,0.00012263123,0.00004435978,0.00018139128,0.0003533071,0.000055470668],"domain_scores_gemma":[0.9985656,0.00060702086,0.000082025144,0.00031336612,0.0003367591,0.00009526097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151285,0.0014857838,0.0010065329,0.0010854458,0.00057903497,0.0013491131,0.0024308437,0.0016736351,0.01537486],"category_scores_gemma":[0.0037579585,0.0007021105,0.0008465004,0.0011892681,0.0005593717,0.0014442592,0.0020326811,0.0022096827,0.006279934],"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.00027332202,0.00013196685,0.0003379015,0.00027238965,0.00009720034,0.00015276135,0.00019009192,0.027263347,0.07357297,0.017569821,0.027722131,0.8524161],"study_design_scores_gemma":[0.000055606135,0.00009435559,0.00032787147,0.000031280837,0.000023258604,0.00026430195,0.000038367372,0.8835389,0.07469366,0.015160574,0.025712216,0.000059566333],"about_ca_topic_score_codex":0.0020101059,"about_ca_topic_score_gemma":0.0035702207,"teacher_disagreement_score":0.01537486,"about_ca_system_score_codex":0.0005789213,"about_ca_system_score_gemma":0.00060263724,"threshold_uncertainty_score":0.05143404},"labels":[],"label_agreement":null},{"id":"W4402959357","doi":"10.1007/978-3-031-72998-0_12","title":"Agglomerative Token Clustering","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Vector Institute","funders":"","keywords":"Computer science; Cluster analysis; Hierarchical clustering; Security token; Artificial intelligence; Computer network","score_opus":0.015540423641621136,"score_gpt":0.2594737992649406,"score_spread":0.24393337562331943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402959357","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.0029417516,0.00037548272,0.9840732,0.000087801986,0.00019247379,0.00017023116,0.00074917823,0.0054521505,0.005957877],"genre_scores_gemma":[0.041017838,0.00043525634,0.91213655,0.000107857486,0.00010761316,0.00024053213,0.0053425548,0.0024550755,0.038156718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787354,0.00034075344,0.00014383813,0.00072502805,0.0006965229,0.00022035658],"domain_scores_gemma":[0.99803644,0.0003492047,0.000072942865,0.00084900175,0.00061400654,0.00007842437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012358273,0.001587426,0.0021897033,0.0039728587,0.0026610203,0.0028236557,0.004132702,0.0016581338,0.022821886],"category_scores_gemma":[0.0030744344,0.001253581,0.0024290748,0.007142718,0.0010690158,0.0027008858,0.0028204704,0.001724867,0.026352026],"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.00041039396,0.00016778246,0.00067495124,0.00043488672,0.00023137161,0.00022180534,0.00026953593,0.04629378,0.019597568,0.03111554,0.04721667,0.8533657],"study_design_scores_gemma":[0.00004805558,0.00017280149,0.0013192557,0.000086253174,0.00023205065,0.0008483638,0.00034203357,0.7259798,0.0571539,0.09346197,0.12021237,0.00014316158],"about_ca_topic_score_codex":0.0059070243,"about_ca_topic_score_gemma":0.013063492,"teacher_disagreement_score":0.022821886,"about_ca_system_score_codex":0.0011015334,"about_ca_system_score_gemma":0.002626049,"threshold_uncertainty_score":0.076346755},"labels":[],"label_agreement":null},{"id":"W4402961721","doi":"10.1007/978-3-031-72761-0_1","title":"Visual Prompting via Partial Optimal Transport","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer graphics (images); Human–computer interaction; Computer vision","score_opus":0.01668040845139171,"score_gpt":0.2760984819515691,"score_spread":0.2594180735001774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402961721","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.016461529,0.00047890499,0.9673784,0.00021965528,0.0002266964,0.000059932896,0.00016737606,0.0055156047,0.009491982],"genre_scores_gemma":[0.6475068,0.0005887106,0.32706717,0.00016796484,0.00017009475,0.00012386606,0.000367589,0.0010797214,0.022927979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979943,0.000034006403,0.000011926854,0.00006623513,0.000043876717,0.000044523582],"domain_scores_gemma":[0.9995497,0.00019793818,0.000025286261,0.00012346545,0.00006549232,0.00003806699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036481066,0.00087837677,0.0011521264,0.0005322547,0.0005171189,0.0010060808,0.0010784479,0.00094127696,0.013541012],"category_scores_gemma":[0.0016151421,0.0004378287,0.0005016845,0.00060050236,0.0005468576,0.0017860084,0.0013990446,0.001152711,0.0019417957],"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.0014625394,0.00020698777,0.0003202479,0.00032328366,0.000045052693,0.0003485191,0.00023439249,0.1692053,0.07062088,0.09140938,0.02164408,0.6441794],"study_design_scores_gemma":[0.000048516416,0.00007688203,0.00013085036,0.000021051037,0.000015253255,0.00008740553,0.00003450785,0.91481507,0.0106941275,0.06820836,0.0058492236,0.00001875728],"about_ca_topic_score_codex":0.003501543,"about_ca_topic_score_gemma":0.0030191403,"teacher_disagreement_score":0.013541012,"about_ca_system_score_codex":0.0007163539,"about_ca_system_score_gemma":0.0007971989,"threshold_uncertainty_score":0.045299172},"labels":[],"label_agreement":null},{"id":"W4402961730","doi":"10.1007/978-3-031-72784-9_27","title":"SafaRi: Adaptive Sequence Transformer for Weakly Supervised Referring Expression Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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 Toronto","funders":"","keywords":"Computer science; Segmentation; Transformer; Artificial intelligence; Sequence (biology); Computer vision; Pattern recognition (psychology); Electrical engineering; Voltage; Biology","score_opus":0.039102226118176285,"score_gpt":0.3031783288866046,"score_spread":0.26407610276842836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402961730","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.004279163,0.00029122684,0.9488826,0.000079760626,0.000119021504,0.00012509013,0.0012743383,0.042956054,0.0019927705],"genre_scores_gemma":[0.07103743,0.00038623333,0.8997331,0.0002852471,0.00013461738,0.00031322768,0.009225508,0.005969573,0.012915006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989975,0.00017168434,0.000056885823,0.0003955756,0.00027445023,0.000103806786],"domain_scores_gemma":[0.9992797,0.00023773583,0.000039831542,0.0002113567,0.00018219427,0.000049336613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619746,0.0018446082,0.0018359806,0.0016159727,0.0006558088,0.0017371072,0.0029248402,0.0014934893,0.022097291],"category_scores_gemma":[0.0023470034,0.00087034336,0.0015923816,0.0018807556,0.000692039,0.0025751328,0.0025866823,0.0022830355,0.01750138],"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.00075060857,0.00013851917,0.0002661632,0.0003184015,0.00009347601,0.00020704925,0.00015973242,0.007872971,0.079108894,0.01121648,0.04827654,0.8515912],"study_design_scores_gemma":[0.000089135734,0.0002732516,0.00083816645,0.00005895075,0.000105093386,0.0007130719,0.00012681905,0.7844941,0.1381306,0.033815764,0.04126449,0.000090554786],"about_ca_topic_score_codex":0.0032553168,"about_ca_topic_score_gemma":0.006178863,"teacher_disagreement_score":0.022097291,"about_ca_system_score_codex":0.000722247,"about_ca_system_score_gemma":0.0010996289,"threshold_uncertainty_score":0.07392281},"labels":[],"label_agreement":null},{"id":"W4402961810","doi":"10.1007/978-3-031-72775-7_22","title":"EgoLifter: Open-World 3D Segmentation for Egocentric Perception","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Segmentation; Computer vision; Perception; Artificial intelligence; Image segmentation; Human–computer interaction; Psychology; Neuroscience","score_opus":0.018340788963459836,"score_gpt":0.26054409892579894,"score_spread":0.2422033099623391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402961810","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.0030773866,0.00026597446,0.95130616,0.00008623002,0.000091222566,0.00010412899,0.0014883114,0.03948363,0.0040970356],"genre_scores_gemma":[0.049028363,0.00065132696,0.92368317,0.00021427766,0.000062824845,0.00024378824,0.006354253,0.010160722,0.009601289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.000022719634,0.000013425323,0.00011083944,0.00015453094,0.000056129997],"domain_scores_gemma":[0.99972206,0.00007856762,0.000018216639,0.00008256429,0.00006313706,0.000035423123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036480266,0.0018881498,0.0014585583,0.0014924265,0.0006478732,0.0024721164,0.0030979337,0.0016536588,0.038698535],"category_scores_gemma":[0.0009076937,0.0014024876,0.0015084208,0.0015756831,0.0005740093,0.002079182,0.0035767236,0.0014616568,0.01647251],"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.00030350033,0.000102226375,0.00043056562,0.00037462922,0.00012228574,0.00018721486,0.00033843864,0.016765997,0.05193363,0.01485467,0.07481582,0.83977103],"study_design_scores_gemma":[0.000087176304,0.00014055024,0.001549923,0.00015061336,0.00008449392,0.0008028947,0.00026200936,0.73869395,0.08656464,0.05384711,0.117674135,0.0001424152],"about_ca_topic_score_codex":0.0046913647,"about_ca_topic_score_gemma":0.00950678,"teacher_disagreement_score":0.038698535,"about_ca_system_score_codex":0.0007121018,"about_ca_system_score_gemma":0.00096177665,"threshold_uncertainty_score":0.12945944},"labels":[],"label_agreement":null},{"id":"W4402961816","doi":"10.1007/978-3-031-72775-7_25","title":"Data-to-Model Distillation: Data-Efficient Learning Framework","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Bank of Canada; University of Toronto","funders":"","keywords":"Computer science; Distillation; Artificial intelligence; Machine learning","score_opus":0.04576043651424889,"score_gpt":0.3127651815191225,"score_spread":0.26700474500487364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402961816","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.0018868021,0.00026622173,0.99390864,0.00025412312,0.00006385709,0.000057137007,0.00031631562,0.0018844204,0.0013623411],"genre_scores_gemma":[0.106567025,0.0004688492,0.8805893,0.00040972116,0.00019568217,0.00036141838,0.0025703192,0.0009976332,0.007840047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983662,0.0005773364,0.000092985196,0.00032634073,0.00046935465,0.00016784923],"domain_scores_gemma":[0.99760395,0.0010866643,0.00007897929,0.0006927939,0.00041467955,0.00012295943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026828824,0.001734053,0.002218677,0.0013684859,0.0010650073,0.0023372155,0.005412642,0.0024797597,0.011128466],"category_scores_gemma":[0.00826152,0.0010341214,0.0015522187,0.0023424046,0.001352275,0.004281027,0.006318968,0.0053561605,0.0046256087],"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.00039729147,0.00035404004,0.00045622184,0.00028410228,0.00011703439,0.00015114484,0.0001051708,0.28677106,0.0033146054,0.1429177,0.029347796,0.53578377],"study_design_scores_gemma":[0.000019447796,0.000025196181,0.000028410672,0.0000098433475,0.000009602213,0.000027833194,0.000010729926,0.9343939,0.0017329697,0.06068294,0.0030486453,0.0000104640685],"about_ca_topic_score_codex":0.0043047275,"about_ca_topic_score_gemma":0.0070985355,"teacher_disagreement_score":0.011128466,"about_ca_system_score_codex":0.0012617428,"about_ca_system_score_gemma":0.0027537697,"threshold_uncertainty_score":0.037228405},"labels":[],"label_agreement":null},{"id":"W4402996394","doi":"10.1007/978-3-031-72920-1_13","title":"PointNeRF++: A Multi-scale, Point-Based Neural Radiance Field","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University; Google (Canada); University of British Columbia","funders":"","keywords":"Radiance; Computer science; Scale (ratio); Artificial neural network; Point (geometry); Field (mathematics); Artificial intelligence; Computer vision; Computer graphics (images); Remote sensing; Geology; Cartography; Geography; Geometry; Mathematics","score_opus":0.016486218253450577,"score_gpt":0.2765039877077457,"score_spread":0.2600177694542951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402996394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035958,0.00025216956,0.9750993,0.00009199578,0.00010293797,0.00004863071,0.00062785915,0.016112478,0.0040688673],"genre_scores_gemma":[0.061752874,0.0004118001,0.91629344,0.00019968918,0.0000784703,0.00015326933,0.002025838,0.0026388403,0.016445743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985886,0.000013930167,0.00000446905,0.000030827126,0.00007837561,0.000013470366],"domain_scores_gemma":[0.99986565,0.000037181955,0.000009984414,0.000027161475,0.000044782682,0.000015116715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003176187,0.00088287547,0.0006762262,0.0005044992,0.00028603806,0.00069474627,0.0025709586,0.0010237669,0.01847252],"category_scores_gemma":[0.0006789248,0.00048349175,0.00079107267,0.000674346,0.0002919621,0.0012177686,0.0009185479,0.0011660713,0.006219765],"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.0002783682,0.00009199205,0.0003013293,0.00033731092,0.000093722105,0.000121482095,0.0000657662,0.11927956,0.04979894,0.0139816385,0.042638905,0.7730111],"study_design_scores_gemma":[0.000075907454,0.00008914228,0.00033166524,0.000027986138,0.000030843177,0.00019959928,0.000013163191,0.92477447,0.02675538,0.007973673,0.039677747,0.000050440234],"about_ca_topic_score_codex":0.0044231317,"about_ca_topic_score_gemma":0.0064989193,"teacher_disagreement_score":0.01847252,"about_ca_system_score_codex":0.0003873692,"about_ca_system_score_gemma":0.0003990556,"threshold_uncertainty_score":0.061796725},"labels":[],"label_agreement":null},{"id":"W4402996526","doi":"10.1007/978-3-031-72920-1_20","title":"TexGen: Text-Guided 3D Texture Generation with Multi-view Sampling and Resampling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Toronto; Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Computer science; Resampling; Artificial intelligence; Texture (cosmology); Computer vision; Sampling (signal processing); Texture synthesis; Computer graphics (images); Pattern recognition (psychology); Image texture; Image (mathematics); Image processing","score_opus":0.048450876575010855,"score_gpt":0.2751053607190412,"score_spread":0.22665448414403033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402996526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035245246,0.00012525918,0.98643446,0.00007109533,0.00011504068,0.00009522612,0.00024540655,0.0068981773,0.0024909219],"genre_scores_gemma":[0.12731268,0.00017423237,0.86092687,0.00027752042,0.000071019036,0.0002267857,0.0012156161,0.002924288,0.006870944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.000059773556,0.000013907413,0.00009949569,0.00022285905,0.000045546716],"domain_scores_gemma":[0.9995209,0.00019809676,0.000025756943,0.00015254975,0.00007032654,0.00003247693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606512,0.0009861134,0.000954192,0.0006563935,0.00030428966,0.0010835361,0.0017140125,0.0013244471,0.014006227],"category_scores_gemma":[0.0018493218,0.00058652245,0.0011514473,0.0005455904,0.0005743691,0.0007436759,0.0020979592,0.0014032084,0.0046993177],"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.0004974025,0.00017582493,0.00064470404,0.00021732942,0.00013964972,0.00030878844,0.00014546153,0.26331902,0.054695405,0.025073372,0.03620524,0.61857784],"study_design_scores_gemma":[0.000032688306,0.000031626714,0.00008743383,0.000008247506,0.000008380079,0.00009734257,0.0000110521805,0.9805536,0.009362326,0.005719259,0.0040755933,0.000012413662],"about_ca_topic_score_codex":0.0021037313,"about_ca_topic_score_gemma":0.003478834,"teacher_disagreement_score":0.014006227,"about_ca_system_score_codex":0.00050969113,"about_ca_system_score_gemma":0.0005112014,"threshold_uncertainty_score":0.04685551},"labels":[],"label_agreement":null},{"id":"W4402997546","doi":"10.1007/978-3-031-72920-1_7","title":"Watch Your Steps: Local Image and Scene Editing by Text Instructions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Centre for Social Innovation; York University; University of Toronto","funders":"","keywords":"Computer science; Image editing; Image (mathematics); Computer graphics (images); Computer vision; Artificial intelligence; Information retrieval; Natural language processing","score_opus":0.011414363076182816,"score_gpt":0.26480743940664836,"score_spread":0.25339307633046554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402997546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008502858,0.0007156247,0.7169176,0.00090433424,0.0017755285,0.00044833586,0.0020524168,0.09390585,0.17477743],"genre_scores_gemma":[0.056961194,0.0010716638,0.5717419,0.0007356114,0.0006320609,0.00024253866,0.0032963983,0.04043463,0.32488397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998684,0.000012391236,0.0000068563118,0.000032969383,0.000059584265,0.00001976861],"domain_scores_gemma":[0.99933237,0.00019032734,0.000022774148,0.00018871567,0.00016970315,0.00009605416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594156,0.0012899694,0.0005064901,0.0010055462,0.0005279719,0.0013305405,0.0012164668,0.0007336445,0.23858438],"category_scores_gemma":[0.0012736212,0.00056600105,0.0005430151,0.000646956,0.0002886345,0.0013494112,0.0011306459,0.0010281649,0.10380492],"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.00034926392,0.00008550277,0.00019998304,0.00027798253,0.00002483119,0.00029577897,0.00023819593,0.0018457965,0.06754285,0.0055281953,0.31394297,0.60966855],"study_design_scores_gemma":[0.000096075906,0.00019360911,0.0018778936,0.00013880075,0.00008028545,0.0011405201,0.000299493,0.034731206,0.09651484,0.010911337,0.85389787,0.00011810823],"about_ca_topic_score_codex":0.0011917079,"about_ca_topic_score_gemma":0.0025562432,"teacher_disagreement_score":0.23858438,"about_ca_system_score_codex":0.00024835675,"about_ca_system_score_gemma":0.00023156409,"threshold_uncertainty_score":0.7981443},"labels":[],"label_agreement":null},{"id":"W4403002917","doi":"10.1007/978-3-031-72952-2_4","title":"TC4D: Trajectory-Conditioned Text-to-4D Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Trajectory; Text generation; Artificial intelligence; Natural language processing; Speech recognition; Physics","score_opus":0.016197048865719384,"score_gpt":0.26595608770256446,"score_spread":0.24975903883684508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403002917","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.0045284913,0.00019622155,0.90510654,0.000193292,0.00080107455,0.00035034673,0.00292074,0.0731063,0.012796986],"genre_scores_gemma":[0.12972733,0.00023721877,0.8143183,0.00038073058,0.00016421199,0.00069282285,0.012172067,0.015536415,0.026770959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933594,0.0000824421,0.000037419737,0.00015728881,0.00032294382,0.00006392151],"domain_scores_gemma":[0.99911493,0.00030817368,0.00003439423,0.00026804177,0.00022349301,0.000050931285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049880013,0.0020485774,0.0009880451,0.0011405422,0.0006770261,0.001384556,0.0032191055,0.0020344462,0.084455624],"category_scores_gemma":[0.0029603252,0.0008602041,0.0013286017,0.0009741556,0.0008021971,0.0012454529,0.003190317,0.0015318737,0.02385565],"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.0006893439,0.00014038435,0.00055547396,0.00064971595,0.00010070836,0.0008185467,0.0003098417,0.062192887,0.055585064,0.03207685,0.17906556,0.6678157],"study_design_scores_gemma":[0.00016906655,0.00015089699,0.00035816594,0.00006112788,0.000038395392,0.00063542783,0.00010708008,0.81198686,0.07018746,0.034840807,0.08137971,0.00008495892],"about_ca_topic_score_codex":0.0031106863,"about_ca_topic_score_gemma":0.004476507,"teacher_disagreement_score":0.084455624,"about_ca_system_score_codex":0.0006844811,"about_ca_system_score_gemma":0.0008275562,"threshold_uncertainty_score":0.28253222},"labels":[],"label_agreement":null},{"id":"W4403048090","doi":"10.1007/978-3-031-73471-7_7","title":"Automating MedSAM by Learning Prompts with Weak Few-Shot Supervision","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Shot (pellet); Human–computer interaction; Artificial intelligence; Computer graphics (images); Programming language; Natural language processing; Engineering drawing; Engineering","score_opus":0.015769344148611794,"score_gpt":0.2590442351092754,"score_spread":0.24327489096066357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403048090","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.015534685,0.0009432794,0.9111988,0.0006033783,0.0005372897,0.00021682252,0.0012885211,0.066014,0.0036632353],"genre_scores_gemma":[0.3349899,0.00043571743,0.6450628,0.0011050614,0.00030587573,0.0002659104,0.0038218007,0.0022965951,0.011716367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985292,0.00038710487,0.00007504973,0.0006547367,0.00023325795,0.00012064354],"domain_scores_gemma":[0.9957553,0.0026348047,0.00020811311,0.0005391314,0.00064926,0.00021338917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019701659,0.0020548424,0.001679319,0.0011493887,0.0009112422,0.0015128332,0.0024735664,0.0019279987,0.010590736],"category_scores_gemma":[0.009192747,0.0008508279,0.0009999402,0.00087262323,0.0007458726,0.0033100715,0.0026721582,0.0038613784,0.0072402996],"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.0009533363,0.00036045816,0.0013868681,0.0004318528,0.00007841623,0.0001944867,0.00014707533,0.034845863,0.013764487,0.0033811731,0.032648955,0.9118071],"study_design_scores_gemma":[0.00007480977,0.00019793343,0.00061517325,0.000071132534,0.00005620353,0.00019437607,0.00011047049,0.9363064,0.027396316,0.023965804,0.0109654665,0.00004581244],"about_ca_topic_score_codex":0.0045677894,"about_ca_topic_score_gemma":0.009480607,"teacher_disagreement_score":0.010590736,"about_ca_system_score_codex":0.0008481854,"about_ca_system_score_gemma":0.002346424,"threshold_uncertainty_score":0.035429537},"labels":[],"label_agreement":null},{"id":"W4403048309","doi":"10.1007/978-981-96-0576-7_15","title":"Synthetic Data: Generate Avatar Data on Demand","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Avatar; Computer science; Human–computer interaction","score_opus":0.05958938339946626,"score_gpt":0.32242921382823897,"score_spread":0.2628398304287727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403048309","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.28132978,0.00043606467,0.526582,0.0015748487,0.0017321941,0.0009326751,0.12063325,0.052361064,0.014418042],"genre_scores_gemma":[0.5296084,0.0001739957,0.2699373,0.00022534847,0.00015910668,0.000543669,0.19071952,0.0021808108,0.006451883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952376,0.00012158117,0.00002454629,0.00011938262,0.00016475272,0.00004590454],"domain_scores_gemma":[0.9985245,0.00058471644,0.000037042384,0.0003528555,0.00040802758,0.00009288011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332037,0.0010411171,0.0005150975,0.0011691048,0.000269756,0.0006578724,0.0014125286,0.0009596285,0.007690183],"category_scores_gemma":[0.005034776,0.00038693057,0.00059003796,0.0011245662,0.00029433772,0.000722109,0.0010327268,0.00078516523,0.004312161],"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.003615048,0.0015960293,0.023861174,0.0006290321,0.00031941806,0.001046946,0.00060849934,0.32458267,0.025120063,0.0067159105,0.2536114,0.35829383],"study_design_scores_gemma":[0.00011973708,0.00013786978,0.0020437925,0.00002272877,0.000018491668,0.00017382807,0.000235313,0.9719669,0.0076775,0.0051593473,0.012417277,0.000027235066],"about_ca_topic_score_codex":0.0051602228,"about_ca_topic_score_gemma":0.0053922497,"teacher_disagreement_score":0.007690183,"about_ca_system_score_codex":0.0003174955,"about_ca_system_score_gemma":0.00035789204,"threshold_uncertainty_score":0.025726259},"labels":[],"label_agreement":null},{"id":"W4403048615","doi":"10.1007/978-3-031-72378-0_1","title":"A New Benchmark In Vivo Paired Dataset for Laparoscopic Image De-smoking","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"Western University","funders":"","keywords":"Benchmark (surveying); Computer science; Image (mathematics); Artificial intelligence; Computer vision; Cartography","score_opus":0.01583438203735291,"score_gpt":0.27684375427300506,"score_spread":0.2610093722356521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403048615","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3190454,0.017626032,0.33914995,0.0016012518,0.0020909868,0.0029612172,0.25389618,0.031948127,0.031680834],"genre_scores_gemma":[0.2298324,0.003707674,0.20016907,0.001208378,0.00033213667,0.001355499,0.5326698,0.002835989,0.027889049],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998855,0.00019559145,0.000086749904,0.00032335127,0.00040614235,0.00013314806],"domain_scores_gemma":[0.9987846,0.00020609931,0.000082997096,0.00041376875,0.00040048498,0.000111975736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014077077,0.0017597483,0.0012811475,0.0021401423,0.00073717494,0.001492767,0.0021292788,0.0023212668,0.0064562946],"category_scores_gemma":[0.0026814598,0.0006051274,0.0012017362,0.0018171195,0.00046923943,0.0007649132,0.0015476629,0.0010429611,0.0061847284],"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.0031573786,0.002149856,0.012319668,0.0029879294,0.0012693165,0.0011499792,0.00016701258,0.025534643,0.087992206,0.0015363836,0.24956131,0.61217433],"study_design_scores_gemma":[0.0009486352,0.0033550588,0.10028218,0.0010527237,0.0015511571,0.020535495,0.0009948588,0.32417813,0.21621291,0.007836956,0.32247385,0.0005779708],"about_ca_topic_score_codex":0.0068561207,"about_ca_topic_score_gemma":0.019595131,"teacher_disagreement_score":0.0068561207,"about_ca_system_score_codex":0.00054788153,"about_ca_system_score_gemma":0.00128541,"threshold_uncertainty_score":0.021598399},"labels":[],"label_agreement":null},{"id":"W4403052388","doi":"10.1007/978-3-031-72117-5_12","title":"Confidence Intervals Uncovered: Are We Ready for Real-World Medical Imaging AI?","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Queen's University","funders":"European Commission; Agence Nationale de la Recherche; Nvidia","keywords":"Computer science; Confidence interval; Medical imaging; Artificial intelligence; Statistics; Mathematics","score_opus":0.1296929749811029,"score_gpt":0.4330544743597912,"score_spread":0.3033614993786883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403052388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014636768,0.07694013,0.68314356,0.18527731,0.0042905905,0.000088944515,0.0010005926,0.0017713327,0.032850817],"genre_scores_gemma":[0.5177313,0.037413415,0.39801064,0.02236598,0.00942699,0.00021761365,0.0014502797,0.001574083,0.011809744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99359655,0.0029257445,0.00045221415,0.0008879122,0.0019014967,0.0002360283],"domain_scores_gemma":[0.854196,0.12584457,0.003506686,0.0070268055,0.007424748,0.0020011358],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.017058529,0.0010288601,0.0016293925,0.002078443,0.00086119934,0.007838163,0.004033037,0.003409417,0.011683954],"category_scores_gemma":[0.18132727,0.0008269094,0.0012300248,0.002138725,0.0069257575,0.016587654,0.003055306,0.011455798,0.0017958028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030130756,0.00011353365,0.0030593723,0.0010459255,0.00024025634,0.00040949034,0.0008451524,0.0071699116,0.0007535661,0.34800178,0.06276437,0.5752954],"study_design_scores_gemma":[0.00003325344,0.000046313173,0.00092913007,0.00054235413,0.0000638769,0.000414604,0.0003270737,0.022886904,0.00049541716,0.9410589,0.03314526,0.00005688735],"about_ca_topic_score_codex":0.0029928987,"about_ca_topic_score_gemma":0.0016885286,"teacher_disagreement_score":0.98294145,"about_ca_system_score_codex":0.0019862868,"about_ca_system_score_gemma":0.001972896,"threshold_uncertainty_score":0.090215266},"labels":[],"label_agreement":null},{"id":"W4403052954","doi":"10.1007/978-3-031-71874-8_4","title":"A Brief History of Per-Flow QoS in the Internet","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Quality of service; Flow (mathematics); Data flow diagram; Computer network; Database; World Wide Web; Mathematics","score_opus":0.012848805701871137,"score_gpt":0.21139354811238875,"score_spread":0.19854474241051762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403052954","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018597448,0.5174459,0.07049221,0.011469139,0.011801427,0.000109963315,0.00034173418,0.00062751875,0.3858523],"genre_scores_gemma":[0.04213941,0.5981195,0.038850635,0.009870627,0.023264792,0.0001937151,0.0004416651,0.00064569735,0.286474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994727,0.00009191788,0.000038337726,0.0001065523,0.0002323852,0.000058137037],"domain_scores_gemma":[0.9992478,0.0003982919,0.000025871575,0.00008191376,0.00019378569,0.000052430252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010256296,0.0010573454,0.00070651196,0.002500476,0.0010811507,0.0035307808,0.001293495,0.0022121693,0.022526298],"category_scores_gemma":[0.001967871,0.00083790155,0.0005394197,0.00497393,0.0016792086,0.0056523774,0.0012369191,0.00518769,0.008043024],"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.00007695454,0.00015803304,0.00016955107,0.0009770405,0.000021205693,0.00015374266,0.00023994446,0.0052331607,0.002005994,0.3843032,0.122048415,0.48461276],"study_design_scores_gemma":[0.000006164319,0.000059373197,0.00021229414,0.00061593694,0.000013355015,0.00024914273,0.000041257583,0.002299244,0.00069841463,0.073084064,0.9226948,0.000025984033],"about_ca_topic_score_codex":0.002139337,"about_ca_topic_score_gemma":0.0017721495,"teacher_disagreement_score":0.022526298,"about_ca_system_score_codex":0.0025776678,"about_ca_system_score_gemma":0.0013653245,"threshold_uncertainty_score":0.07535797},"labels":[],"label_agreement":null},{"id":"W4403062945","doi":"10.1007/978-3-031-72089-5_9","title":"Conditional 4D Motion Diffusion Models with Masked Observations to Forecast Deformations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary 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":"Hôpital Notre-Dame; Polytechnique Montréal","funders":"","keywords":"Computer science; Diffusion; Motion (physics); Artificial intelligence; Algorithm; Statistical physics; Physics","score_opus":0.02719407386791293,"score_gpt":0.2113814964541705,"score_spread":0.1841874225862576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403062945","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.028985374,0.00041316205,0.96873033,0.00017621348,0.00009344072,0.000017237355,0.0003787702,0.00055836036,0.0006470975],"genre_scores_gemma":[0.627473,0.0011489767,0.35832626,0.00015410878,0.00018768036,0.00015459013,0.002852401,0.00030994456,0.009393075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983525,0.00004418466,0.000013673157,0.000041079897,0.00004039606,0.000025314963],"domain_scores_gemma":[0.99928683,0.0004251164,0.00008571334,0.0000866184,0.00008690758,0.00002876672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720812,0.0008706129,0.0008557115,0.00044192222,0.00019528123,0.00055339513,0.00095255923,0.00091670844,0.002002568],"category_scores_gemma":[0.0020910595,0.0009367709,0.00082364114,0.0008310834,0.0004042868,0.001047693,0.00090902223,0.0013140216,0.00071345834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012413556,0.000026316124,0.0003997423,0.000036843358,0.000048156933,0.000018847668,0.000020280888,0.94050175,0.0035328614,0.007537231,0.0010727983,0.046681017],"study_design_scores_gemma":[0.0000016703437,0.000003796393,0.00006515317,0.0000011681803,0.000002710977,0.0000018444955,6.48788e-7,0.9986197,0.00024799438,0.00095268764,0.00010021226,0.0000024152594],"about_ca_topic_score_codex":0.0110308435,"about_ca_topic_score_gemma":0.0120856995,"teacher_disagreement_score":0.0110308435,"about_ca_system_score_codex":0.0005238321,"about_ca_system_score_gemma":0.0009714165,"threshold_uncertainty_score":0.021933317},"labels":[],"label_agreement":null},{"id":"W4403063141","doi":"10.1007/978-3-031-72089-5_47","title":"ProstNFound: Integrating Foundation Models with Ultrasound Domain Knowledge and Clinical Context for Robust Prostate Cancer Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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 British Columbia; Queen's University","funders":"","keywords":"Computer science; Context (archaeology); Foundation (evidence); Prostate cancer; Domain (mathematical analysis); Cancer detection; Artificial intelligence; Cancer; Medical physics; Medicine; Geology; Internal medicine; Mathematics","score_opus":0.03506962528190714,"score_gpt":0.3198276958427286,"score_spread":0.2847580705608214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403063141","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.0033220032,0.00039236533,0.9857816,0.00020098858,0.00005454494,0.00004353914,0.0008568527,0.0074466914,0.001901512],"genre_scores_gemma":[0.08247067,0.0011215614,0.90444386,0.00021714091,0.000073508105,0.00014682573,0.004347675,0.0016164983,0.005562273],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995763,0.00007059627,0.000027372247,0.00010314575,0.000191364,0.000031262145],"domain_scores_gemma":[0.9993587,0.0003718741,0.00003922108,0.00010302579,0.00010071217,0.000026483747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009473338,0.0008487178,0.00069178175,0.0008920956,0.00029305133,0.0013612093,0.0015465579,0.00087942526,0.005493522],"category_scores_gemma":[0.0025234015,0.00073079235,0.0012507365,0.00072671083,0.0004123266,0.0018183871,0.0017268857,0.0012976193,0.0024834045],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018993263,0.00010163763,0.0017515302,0.0003125822,0.00012330966,0.0002533574,0.00015710898,0.1304251,0.010088992,0.021939151,0.032452524,0.8022048],"study_design_scores_gemma":[0.00002678932,0.00004328951,0.00075575185,0.000093538605,0.000062736595,0.00030950768,0.000043489785,0.91429687,0.006056038,0.04038985,0.03788524,0.000036819234],"about_ca_topic_score_codex":0.008889326,"about_ca_topic_score_gemma":0.01357517,"teacher_disagreement_score":0.008889326,"about_ca_system_score_codex":0.00057439355,"about_ca_system_score_gemma":0.0012735529,"threshold_uncertainty_score":0.018377662},"labels":[],"label_agreement":null},{"id":"W4403066950","doi":"10.1007/978-3-031-72114-4_1","title":"3D-SAutoMed: Automatic Segment Anything Model for 3D Medical Image Segmentation from Local-Global Perspective","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Perspective (graphical); Artificial intelligence; Computer vision; Image segmentation; Segmentation; Image (mathematics); Computer graphics (images)","score_opus":0.017267585698856384,"score_gpt":0.3117010159272551,"score_spread":0.2944334302283987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403066950","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.0022937965,0.0005534654,0.9754547,0.000101758014,0.00009899533,0.00008066205,0.0009518178,0.018507335,0.001957459],"genre_scores_gemma":[0.035524454,0.00074359094,0.9455787,0.00028466422,0.00008300365,0.00019325245,0.003810985,0.005903056,0.007878265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959964,0.000032898093,0.000020052174,0.000103568666,0.0002080884,0.000035884306],"domain_scores_gemma":[0.99976164,0.00007173648,0.000019188921,0.000063167376,0.00006388656,0.000020414307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005243711,0.0017082699,0.0012518282,0.0015545423,0.00051380805,0.0022993837,0.0020743317,0.0021051352,0.014133817],"category_scores_gemma":[0.0009250838,0.0013279123,0.0020978176,0.001196774,0.0006169028,0.0012043408,0.0016440636,0.0012962093,0.0073337117],"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.00033996152,0.00008471003,0.00090906,0.0006336951,0.0001852061,0.00036797553,0.00022921078,0.05162476,0.08584994,0.011499236,0.060514893,0.78776133],"study_design_scores_gemma":[0.000048750757,0.00016191656,0.0016532217,0.0001292408,0.000107181084,0.0014833641,0.00006939693,0.81954134,0.071555816,0.0150822755,0.0900495,0.00011795091],"about_ca_topic_score_codex":0.003368911,"about_ca_topic_score_gemma":0.00704446,"teacher_disagreement_score":0.014133817,"about_ca_system_score_codex":0.0007855877,"about_ca_system_score_gemma":0.0011651232,"threshold_uncertainty_score":0.04728228},"labels":[],"label_agreement":null},{"id":"W4403067046","doi":"10.1007/978-3-031-72114-4_50","title":"Progressively Correcting Soft Labels via Teacher Team for Knowledge Distillation in Medical Image Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Distillation; Segmentation; Image segmentation; Artificial intelligence; Computer vision; Image (mathematics); Soft computing; Artificial neural network; Chromatography","score_opus":0.030433889493849373,"score_gpt":0.311989133413732,"score_spread":0.2815552439198826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403067046","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.018305948,0.00058425986,0.974442,0.0003060627,0.00009950397,0.00005978423,0.00018744063,0.004814716,0.0012002478],"genre_scores_gemma":[0.22693524,0.000294047,0.76212955,0.00039440006,0.00013506405,0.00014028243,0.001164159,0.0010380945,0.0077691507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998899,0.00026482687,0.000063988125,0.0003884939,0.00023128105,0.00015243565],"domain_scores_gemma":[0.9971457,0.0016690488,0.00013982704,0.00043064344,0.0004969748,0.00011779672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017139676,0.0015839896,0.00218546,0.001243336,0.0009980501,0.0019052831,0.0035140037,0.0032068673,0.0059553892],"category_scores_gemma":[0.004861425,0.0011218666,0.0015089809,0.0012608046,0.0013368598,0.002481271,0.0036930058,0.0033822816,0.0024794543],"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.0005152137,0.00015491068,0.00062866905,0.00025038,0.0001284524,0.00016962932,0.00032737938,0.1479267,0.020302258,0.0071433196,0.008146483,0.8143067],"study_design_scores_gemma":[0.000021184209,0.00006532262,0.00015689927,0.000022158176,0.00003521392,0.00006229801,0.00004543966,0.97850615,0.010589808,0.008941062,0.0015379922,0.000016421236],"about_ca_topic_score_codex":0.010692674,"about_ca_topic_score_gemma":0.019088278,"teacher_disagreement_score":0.010692674,"about_ca_system_score_codex":0.0008525805,"about_ca_system_score_gemma":0.0021144212,"threshold_uncertainty_score":0.021260917},"labels":[],"label_agreement":null},{"id":"W4403067294","doi":"10.1007/978-3-031-72114-4_4","title":"A Task-Conditional Mixture-of-Experts Model for Missing Modality Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Roche (Canada)","funders":"","keywords":"Computer science; Modality (human–computer interaction); Task (project management); Artificial intelligence; Segmentation; Natural language processing","score_opus":0.030554325349422425,"score_gpt":0.2882219134609802,"score_spread":0.25766758811155777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403067294","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.0042489455,0.0008282908,0.9921673,0.00024604896,0.00010810004,0.000046321613,0.0002934719,0.0012793107,0.00078222237],"genre_scores_gemma":[0.31083784,0.0015982313,0.6621997,0.0010408879,0.00053623103,0.0005654494,0.003700319,0.0012934813,0.018227851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889463,0.00035215143,0.00005367121,0.00040351573,0.00013415149,0.00016185339],"domain_scores_gemma":[0.9979103,0.0013149728,0.00008738076,0.00022510481,0.0003429572,0.00011912639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037130427,0.001269775,0.0028802236,0.0011697175,0.00067318603,0.0017734886,0.005384708,0.004288377,0.005278126],"category_scores_gemma":[0.00607487,0.0015994878,0.0026228838,0.0018320986,0.0010466255,0.0024352067,0.002444583,0.0048749777,0.0036050621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010463204,0.00025905104,0.0006175844,0.00035437162,0.0004089808,0.00018833534,0.0003078248,0.536215,0.008802104,0.023312772,0.014873042,0.41361448],"study_design_scores_gemma":[0.000012623122,0.000022414239,0.00010452612,0.000017002005,0.000030027484,0.00004039977,0.000008380647,0.9896337,0.00071438245,0.008662827,0.0007389755,0.000014776021],"about_ca_topic_score_codex":0.01507706,"about_ca_topic_score_gemma":0.02050618,"teacher_disagreement_score":0.01507706,"about_ca_system_score_codex":0.0013882278,"about_ca_system_score_gemma":0.0020163427,"threshold_uncertainty_score":0.029978573},"labels":[],"label_agreement":null},{"id":"W4403067380","doi":"10.1007/978-3-031-72114-4_56","title":"Self-paced Sample Selection for Barely-Supervised Medical Image Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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 Alberta","funders":"","keywords":"Computer science; Sample (material); Selection (genetic algorithm); Artificial intelligence; Image segmentation; Segmentation; Computer vision; Image (mathematics); Pattern recognition (psychology)","score_opus":0.01564007421340646,"score_gpt":0.28166476889811914,"score_spread":0.2660246946847127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403067380","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.014950462,0.00025530602,0.98158824,0.00007317033,0.00006586708,0.00008339119,0.000114725124,0.0023640937,0.00050483196],"genre_scores_gemma":[0.22261368,0.0002559209,0.769027,0.00027659937,0.00018785584,0.00028856567,0.0014956449,0.0010114082,0.004843277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991831,0.00018412837,0.000054861823,0.00027228816,0.00021891219,0.00008666542],"domain_scores_gemma":[0.99757904,0.0013957612,0.00013105676,0.00030743625,0.00046386925,0.00012283941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024251796,0.0008352936,0.0015215925,0.0010044919,0.0004624032,0.0008718781,0.0020853044,0.0014233916,0.0037237527],"category_scores_gemma":[0.0041116728,0.00068725384,0.00090399233,0.0010947051,0.00059093395,0.0009087814,0.0015534821,0.0012458509,0.0018843074],"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.0010151525,0.00025461748,0.0013418735,0.00021625988,0.00011524634,0.00015070775,0.0001492349,0.06343971,0.054662704,0.0022346491,0.007131525,0.8692883],"study_design_scores_gemma":[0.000022212796,0.00007596881,0.000578081,0.000007971404,0.000020720463,0.00009668243,0.000014035137,0.98553246,0.010855816,0.0013380058,0.0014487153,0.000009457135],"about_ca_topic_score_codex":0.0017927496,"about_ca_topic_score_gemma":0.0033168066,"teacher_disagreement_score":0.0037237527,"about_ca_system_score_codex":0.00036798557,"about_ca_system_score_gemma":0.0008868669,"threshold_uncertainty_score":0.012825727},"labels":[],"label_agreement":null},{"id":"W4403067538","doi":"10.1007/978-3-031-72114-4_65","title":"Unsupervised Domain Adaptation Using Soft-Labeled Contrastive Learning with Reversed Monte Carlo Method for Cardiac Image Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Domain adaptation; Monte Carlo method; Segmentation; Artificial intelligence; Adaptation (eye); Domain (mathematical analysis); Image segmentation; Unsupervised learning; Image (mathematics); Pattern recognition (psychology); Computer vision; Mathematics; Optics; Statistics","score_opus":0.02146121407947744,"score_gpt":0.2756469047573688,"score_spread":0.2541856906778914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403067538","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.004340738,0.00017810363,0.9944378,0.000045653887,0.000018170847,0.000023741486,0.000031441712,0.0005422356,0.00038205946],"genre_scores_gemma":[0.1432272,0.0003066195,0.8529358,0.00020779348,0.00005646072,0.00013610753,0.00043710493,0.00043156897,0.002261332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955076,0.00014161284,0.000023239392,0.00013567608,0.00009504082,0.00005363102],"domain_scores_gemma":[0.9990507,0.000528342,0.00005574863,0.00014099298,0.0001726109,0.000051678137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013207066,0.0006977454,0.0012616033,0.00092301564,0.0004769367,0.001027132,0.0019290377,0.0015018936,0.0017993716],"category_scores_gemma":[0.002151376,0.00067629997,0.0013136399,0.00085510133,0.0008353883,0.0010301218,0.0017458575,0.0017833961,0.00079677964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003569727,0.00021340263,0.0009852757,0.00021096268,0.00017935538,0.00013912136,0.00015780971,0.4764526,0.037414722,0.014871553,0.004516644,0.46450168],"study_design_scores_gemma":[0.0000040765085,0.000010593935,0.00008634517,0.000004444679,0.000007848479,0.000029614652,0.0000040052864,0.99464816,0.0024665324,0.002373263,0.00035791434,0.000007134538],"about_ca_topic_score_codex":0.0043408195,"about_ca_topic_score_gemma":0.006370273,"teacher_disagreement_score":0.0043408195,"about_ca_system_score_codex":0.000730996,"about_ca_system_score_gemma":0.0013339828,"threshold_uncertainty_score":0.00863111},"labels":[],"label_agreement":null},{"id":"W4403068682","doi":"10.1007/978-3-031-72933-1_24","title":"Surf-D: Generating High-Quality Surfaces of Arbitrary Topologies Using Diffusion Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Lakeridge Health","funders":"","keywords":"Computer science; Network topology; Diffusion; Quality (philosophy); Topology (electrical circuits); Computational science; Electrical engineering; Thermodynamics; Physics; Computer network; Engineering","score_opus":0.03801358000458188,"score_gpt":0.26442437853253326,"score_spread":0.22641079852795137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403068682","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.0117268795,0.00015883954,0.9782799,0.000114449074,0.00009164531,0.00008243167,0.00031367046,0.0044281376,0.0048039733],"genre_scores_gemma":[0.274247,0.0004432746,0.70467377,0.00015799355,0.000054014567,0.0002665006,0.0018966033,0.0051652985,0.013095532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00005045769,0.000014280825,0.000060701692,0.0002807455,0.00003369195],"domain_scores_gemma":[0.99935216,0.00028606324,0.000038373848,0.00015924626,0.000121001416,0.000043102682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063472136,0.0012497754,0.0009832648,0.0011237528,0.00038244118,0.0013311635,0.0016472231,0.0013720015,0.009504387],"category_scores_gemma":[0.0018684932,0.0008759663,0.001438564,0.00076418277,0.00073813414,0.00096439506,0.0020185565,0.0013163596,0.0029611688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017284467,0.00014124508,0.00078207755,0.0005349172,0.000114085036,0.00032948478,0.00028354838,0.57437724,0.058460888,0.07250455,0.030153316,0.26214585],"study_design_scores_gemma":[0.00003478999,0.000039763338,0.000080801416,0.000016269767,0.000010539211,0.00013164952,0.000032435015,0.9625929,0.009869625,0.019919405,0.007255164,0.000016740725],"about_ca_topic_score_codex":0.0010753594,"about_ca_topic_score_gemma":0.0015069031,"teacher_disagreement_score":0.009504387,"about_ca_system_score_codex":0.0005626608,"about_ca_system_score_gemma":0.0004682886,"threshold_uncertainty_score":0.031795323},"labels":[],"label_agreement":null},{"id":"W4403069155","doi":"10.1007/978-3-031-72933-1_7","title":"DECOLLAGE: 3D Detailization by Controllable, Localized, and Learned Geometry Enhancement","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Université de Montréal; Simon Fraser University","funders":"","keywords":"Computer science; Geometry; Computer graphics (images); Artificial intelligence; Computer vision; Mathematics","score_opus":0.008033600236805468,"score_gpt":0.2203986760267682,"score_spread":0.21236507578996272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069155","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.029210784,0.0005367542,0.95432127,0.0001453787,0.00008473252,0.00004392362,0.0002412346,0.0044473517,0.0109686395],"genre_scores_gemma":[0.3926782,0.0012832981,0.5541647,0.00026840926,0.0000904118,0.00009308582,0.0013559598,0.002583021,0.04748295],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998343,0.000008368873,0.0000036566446,0.000038869228,0.00009322181,0.000021571375],"domain_scores_gemma":[0.99986374,0.000031922587,0.000012521851,0.00005625665,0.00002025332,0.000015308302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013136194,0.0008059082,0.0005524028,0.00043319707,0.00019131653,0.00068087614,0.000993416,0.0004138298,0.0077854265],"category_scores_gemma":[0.00031566375,0.0004076487,0.0004125269,0.00036767244,0.0005705922,0.0009929674,0.0014618378,0.0009536303,0.0017755048],"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.00022919952,0.00009424979,0.00034935394,0.00028135566,0.00002978621,0.00021624616,0.00017484078,0.05755428,0.4607857,0.03913558,0.013235169,0.42791426],"study_design_scores_gemma":[0.000053141626,0.00023606553,0.0010592818,0.000036049096,0.000034109384,0.0007886047,0.00006277476,0.6165055,0.29058242,0.022156326,0.068407364,0.000078403384],"about_ca_topic_score_codex":0.00064420665,"about_ca_topic_score_gemma":0.0015180846,"teacher_disagreement_score":0.0077854265,"about_ca_system_score_codex":0.00033016404,"about_ca_system_score_gemma":0.00024288592,"threshold_uncertainty_score":0.026044905},"labels":[],"label_agreement":null},{"id":"W4403069259","doi":"10.1007/978-3-031-72120-5_34","title":"Latent Spaces Enable Transformer-Based Dose Prediction in Complex Radiotherapy Plans","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"London Health Sciences Centre; Western University","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Software engineering; Electrical engineering; Voltage; Engineering","score_opus":0.015320264637330388,"score_gpt":0.26382110566149247,"score_spread":0.2485008410241621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069259","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.0066499626,0.0001914528,0.9895135,0.00009145212,0.000037151647,0.000022890605,0.00028033147,0.002227314,0.0009858682],"genre_scores_gemma":[0.52702826,0.000690533,0.46356973,0.00016093245,0.00009474743,0.000098574936,0.0015053176,0.0013139303,0.0055380343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965644,0.00008148132,0.000018630879,0.00007284107,0.00013203757,0.000038645296],"domain_scores_gemma":[0.99895394,0.0006353428,0.00008915426,0.0001568761,0.00011362838,0.000051059338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064696214,0.0007886242,0.00087791355,0.00056591234,0.00028929708,0.0016672069,0.0012885892,0.0008836115,0.0062580057],"category_scores_gemma":[0.0033026012,0.00064650545,0.0009704835,0.0009983496,0.00052531064,0.0015926174,0.0017592023,0.0017775766,0.0019748753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033163148,0.00008972162,0.0010023772,0.00014968337,0.00008165143,0.00008636653,0.00009732227,0.6921465,0.010836489,0.018198974,0.005321507,0.2716578],"study_design_scores_gemma":[0.000004421569,0.000010979667,0.00007743686,0.0000052200066,0.0000053140707,0.00001845616,0.0000064495744,0.99178255,0.001797578,0.0057091666,0.0005772013,0.00000517273],"about_ca_topic_score_codex":0.005433075,"about_ca_topic_score_gemma":0.007738899,"teacher_disagreement_score":0.0062580057,"about_ca_system_score_codex":0.0007249691,"about_ca_system_score_gemma":0.0007589806,"threshold_uncertainty_score":0.020935118},"labels":[],"label_agreement":null},{"id":"W4403069449","doi":"10.1007/978-3-031-72120-5_2","title":"A Hybrid CNN-Transformer Feature Pyramid Network for Granular Abdominal Aortic Calcification Detection from DXA Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electrical and Bioimpedance Tomography","field":"Engineering","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 Manitoba","funders":"","keywords":"Computer science; Artificial intelligence; Transformer; Feature (linguistics); Pattern recognition (psychology); Pyramid (geometry); Calcification; Computer vision; Radiology; Medicine; Electrical engineering; Physics; Engineering; Voltage","score_opus":0.006499355738533365,"score_gpt":0.20925126140400085,"score_spread":0.2027519056654675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06285942,0.0015170857,0.91525984,0.00043333534,0.0004497517,0.00024740282,0.0022382918,0.008691086,0.008303741],"genre_scores_gemma":[0.58447784,0.0015041024,0.38196418,0.0007772951,0.00024012815,0.00022985062,0.005942382,0.00034713955,0.024517154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998286,0.000009125267,0.00000691138,0.00005870965,0.000057848356,0.0000388517],"domain_scores_gemma":[0.9998683,0.000022519065,0.000008567259,0.000022310496,0.00006334261,0.000015058537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002903482,0.0008127186,0.0007074,0.00071416656,0.00023557158,0.00056649355,0.00128235,0.0006243771,0.004175896],"category_scores_gemma":[0.00046673394,0.00041073226,0.000693778,0.00075698306,0.00014567368,0.00056402787,0.0008303963,0.00057742954,0.0018446022],"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.00024947737,0.00016325913,0.0018562411,0.00010944468,0.00014929015,0.00020724058,0.000021923574,0.03321788,0.038421612,0.001224829,0.012544706,0.91183394],"study_design_scores_gemma":[0.000022014556,0.00011577287,0.0024741422,0.000019052173,0.00008807115,0.00025688836,0.0000159092,0.9757017,0.016293919,0.0015520019,0.0034392448,0.000021259586],"about_ca_topic_score_codex":0.015899653,"about_ca_topic_score_gemma":0.024500392,"teacher_disagreement_score":0.015899653,"about_ca_system_score_codex":0.00056751934,"about_ca_system_score_gemma":0.0008525053,"threshold_uncertainty_score":0.031614244},"labels":[],"label_agreement":null},{"id":"W4403069564","doi":"10.1007/978-3-031-72117-5_16","title":"Debiased Noise Editing on Foundation Models for Fair Medical Image Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reservoir Engineering and Simulation Methods","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":"Vector Institute; University of British Columbia","funders":"","keywords":"Computer science; Foundation (evidence); Noise (video); Artificial intelligence; Image (mathematics); Computer vision; Speech recognition","score_opus":0.036789711059310205,"score_gpt":0.29947858267642496,"score_spread":0.26268887161711474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004873263,0.00008600315,0.99351174,0.0000820968,0.000028014783,0.000012646848,0.000026117554,0.00044005146,0.0009399303],"genre_scores_gemma":[0.25156072,0.00034053228,0.7352683,0.00017993887,0.00009403272,0.00005148128,0.0002253107,0.0007087704,0.01157085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997218,0.00006411038,0.000016347236,0.00005317645,0.00011342924,0.000031109146],"domain_scores_gemma":[0.9987257,0.0005699319,0.00008268441,0.00033308793,0.00023244505,0.000056281646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017499,0.00043219066,0.0006357012,0.00044533447,0.00033008915,0.0010548056,0.0012375454,0.00086062425,0.0034028618],"category_scores_gemma":[0.003920059,0.00042101127,0.0007205386,0.0003987715,0.0007697638,0.0011706973,0.0013165346,0.0013744242,0.00086941756],"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.00028172857,0.000066557055,0.00062573934,0.00013922324,0.000059311846,0.00015581827,0.00016373013,0.40258792,0.039106924,0.10059719,0.006706673,0.44950926],"study_design_scores_gemma":[0.0000029591304,0.000012972667,0.00006027603,0.0000056721615,0.000005534355,0.000038874212,0.000006984094,0.98186976,0.004340789,0.012137624,0.0015127576,0.0000057522834],"about_ca_topic_score_codex":0.0031574247,"about_ca_topic_score_gemma":0.0048462767,"teacher_disagreement_score":0.0034028618,"about_ca_system_score_codex":0.0006106747,"about_ca_system_score_gemma":0.0006512195,"threshold_uncertainty_score":0.011383712},"labels":[],"label_agreement":null},{"id":"W4403069597","doi":"10.1007/978-3-031-72117-5_63","title":"Sparse Bayesian Networks: Efficient Uncertainty Quantification in Medical Image Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Hôpital Notre-Dame; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Bayesian probability; Bayesian network; Artificial intelligence; Image (mathematics); Uncertainty quantification; Pattern recognition (psychology); Data mining; Machine learning","score_opus":0.012559819493931356,"score_gpt":0.26304059310897415,"score_spread":0.2504807736150428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005064836,0.00051186874,0.9981939,0.00008434003,0.000018277718,0.000010053412,0.000045110697,0.0001319532,0.0004980271],"genre_scores_gemma":[0.056395005,0.0031634888,0.9343996,0.00015505576,0.00020170808,0.0001423268,0.00037530868,0.00032715767,0.00484044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896944,0.00034469945,0.000049967686,0.00012920202,0.00046440877,0.000042249427],"domain_scores_gemma":[0.99794465,0.0014911427,0.00011811168,0.0001461102,0.0002491486,0.00005084306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017764771,0.0010291351,0.0014702681,0.0013166254,0.00029867573,0.001770121,0.001872946,0.0014515063,0.004132292],"category_scores_gemma":[0.0065668584,0.0012810852,0.0009488844,0.0022476932,0.0010021052,0.0023537658,0.002511682,0.0024655645,0.0014133845],"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.000090501526,0.000047567628,0.00024581634,0.00036221553,0.00008967512,0.000054167394,0.00010847161,0.40374306,0.005608516,0.0817264,0.012193423,0.49573022],"study_design_scores_gemma":[0.000004596087,0.000011428204,0.000076261415,0.000024266761,0.000013109938,0.00003752535,0.00000761674,0.9475785,0.0012018034,0.047734477,0.0032992724,0.000011146662],"about_ca_topic_score_codex":0.0029223673,"about_ca_topic_score_gemma":0.003482347,"teacher_disagreement_score":0.004132292,"about_ca_system_score_codex":0.0007975606,"about_ca_system_score_gemma":0.0007915168,"threshold_uncertainty_score":0.013823926},"labels":[],"label_agreement":null},{"id":"W4403069645","doi":"10.1007/978-3-031-72104-5_51","title":"PASTA: Pathology-Aware MRI to PET CroSs-modal TrAnslation with Diffusion Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Translation (biology); Modal; Diffusion; Artificial intelligence; Natural language processing; Materials science; Physics","score_opus":0.024775788934731074,"score_gpt":0.3103859657433916,"score_spread":0.2856101768086605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026905115,0.0014913164,0.97711986,0.00029975176,0.0003691677,0.00005721332,0.000862012,0.014395847,0.0027143857],"genre_scores_gemma":[0.057771746,0.003321481,0.9019187,0.00061962154,0.0004188487,0.00027866144,0.0043901643,0.0056453054,0.025635507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978,0.00003961088,0.000011263215,0.000076071854,0.00007234321,0.0000206517],"domain_scores_gemma":[0.99967384,0.00010691651,0.000023954419,0.000103447324,0.000067598994,0.000024283985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075398665,0.0015543906,0.00095560215,0.00075557875,0.00035815945,0.0016669354,0.0017494913,0.0015942613,0.0125767505],"category_scores_gemma":[0.0015085636,0.0009497391,0.0014803637,0.0009759839,0.00039809503,0.0014834173,0.0016251047,0.0015437389,0.008313336],"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.00039744063,0.00014397022,0.0002791854,0.0005188588,0.00027752217,0.00035563545,0.00008061316,0.06816542,0.05062745,0.014547132,0.07331573,0.791291],"study_design_scores_gemma":[0.00005559646,0.00013940406,0.0005853903,0.00008733464,0.00012327111,0.0011315511,0.000038078364,0.8456326,0.04499994,0.032598447,0.074529596,0.00007877712],"about_ca_topic_score_codex":0.0018005591,"about_ca_topic_score_gemma":0.0027476444,"teacher_disagreement_score":0.0125767505,"about_ca_system_score_codex":0.0003836248,"about_ca_system_score_gemma":0.0006581358,"threshold_uncertainty_score":0.04207343},"labels":[],"label_agreement":null},{"id":"W4403069763","doi":"10.1007/978-3-031-72117-5_9","title":"BiasPruner: Debiased Continual Learning for Medical Image Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Simon Fraser University; University of Victoria; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Image (mathematics); Computer vision","score_opus":0.034615204737609595,"score_gpt":0.3316896118540296,"score_spread":0.29707440711642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005587611,0.001844347,0.9647717,0.00044934385,0.00033606525,0.000091222326,0.00054261234,0.019731808,0.006645246],"genre_scores_gemma":[0.08971637,0.0010522337,0.867149,0.0006718285,0.000253628,0.00028754896,0.0022103197,0.002638641,0.036020353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991147,0.00016262793,0.000054216784,0.00021865351,0.00038285475,0.000066978995],"domain_scores_gemma":[0.99858826,0.00063034927,0.00005667606,0.00034436423,0.0003215379,0.000058855487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018561815,0.00095543324,0.0008445993,0.00090612494,0.00039583564,0.0010888864,0.0030154611,0.0015589539,0.019154351],"category_scores_gemma":[0.0050264983,0.0005640983,0.00079889357,0.0010508557,0.00077972264,0.0017533847,0.0026460788,0.0025075222,0.008897795],"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.0001740352,0.00007216954,0.00031373996,0.00015851027,0.00004812505,0.00006259068,0.000062509316,0.018913932,0.0038074574,0.009524937,0.041773252,0.92508876],"study_design_scores_gemma":[0.00004598603,0.00011341734,0.00037382386,0.000078264726,0.000031404285,0.00024630272,0.00004077569,0.8972943,0.01239478,0.04563634,0.043717656,0.000026966767],"about_ca_topic_score_codex":0.0023952764,"about_ca_topic_score_gemma":0.004645749,"teacher_disagreement_score":0.019154351,"about_ca_system_score_codex":0.00048698642,"about_ca_system_score_gemma":0.0007064527,"threshold_uncertainty_score":0.064077675},"labels":[],"label_agreement":null},{"id":"W4403069814","doi":"10.1007/978-3-031-72117-5_19","title":"Detecting Noisy Labels with Repeated Cross-Validations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Sunnybrook Hospital; University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Speech recognition; Computer vision","score_opus":0.019106172318709445,"score_gpt":0.2828571323118246,"score_spread":0.26375095999311515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069814","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.044714455,0.0007478567,0.94906384,0.00017872549,0.00018953063,0.00015230943,0.00017643301,0.0039011205,0.0008758728],"genre_scores_gemma":[0.40455836,0.00020236048,0.5841198,0.00048085896,0.00019199948,0.00038827708,0.0024594525,0.0018389409,0.005760012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9704735,0.012639,0.0026191527,0.0071051745,0.0058281934,0.0013349006],"domain_scores_gemma":[0.9276101,0.04160589,0.0029481295,0.01681592,0.010148777,0.0008711667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027652694,0.0029223242,0.0045321803,0.0035789723,0.002232267,0.003279669,0.0065781074,0.006013082,0.0031560685],"category_scores_gemma":[0.05186299,0.0016201471,0.0028163267,0.0022131063,0.0030715563,0.0035702274,0.0048325527,0.004884321,0.0032290064],"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.0013831856,0.0008628018,0.012846897,0.0004607672,0.0011942738,0.00049565063,0.00050285814,0.17839609,0.029807521,0.0070300163,0.009703412,0.75731647],"study_design_scores_gemma":[0.00003534272,0.00016984629,0.001605462,0.000058783742,0.00011708742,0.00019099574,0.0000621149,0.97696894,0.011158585,0.0082588885,0.0013340336,0.00003994602],"about_ca_topic_score_codex":0.0039980314,"about_ca_topic_score_gemma":0.006715288,"teacher_disagreement_score":0.027652694,"about_ca_system_score_codex":0.0015459204,"about_ca_system_score_gemma":0.0015848994,"threshold_uncertainty_score":0.14624316},"labels":[],"label_agreement":null},{"id":"W4403069853","doi":"10.1007/978-3-031-72104-5_17","title":"Center-to-Edge Denoising Diffusion Probabilistic Models with Cross-domain Attention for Undersampled MRI Reconstruction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Western University","funders":"","keywords":"Computer science; Probabilistic logic; Noise reduction; Domain (mathematical analysis); Enhanced Data Rates for GSM Evolution; Diffusion; Center (category theory); Artificial intelligence; Computer vision; Mathematics; Physics","score_opus":0.028006805490451602,"score_gpt":0.3080245363260735,"score_spread":0.2800177308356219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403069853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001993201,0.000536614,0.99650663,0.00011448878,0.000032120795,0.000009320809,0.00003289045,0.00023318453,0.00054149854],"genre_scores_gemma":[0.16875392,0.0031566145,0.80988795,0.0004067336,0.00027527937,0.00010774992,0.0005857491,0.0006495522,0.0161765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973315,0.00007803367,0.000014872875,0.00007763662,0.000069913185,0.000026372722],"domain_scores_gemma":[0.99912566,0.0005000394,0.00006752959,0.00010387309,0.00016737342,0.000035569377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245236,0.0009788554,0.001389399,0.00061587384,0.0002444215,0.0010914707,0.001589583,0.002174009,0.0023204829],"category_scores_gemma":[0.0031767858,0.00088943145,0.0012758523,0.00097306987,0.0007820402,0.0015105732,0.0015546704,0.0025232548,0.0011097166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018296042,0.00008706792,0.00037555135,0.000297995,0.00022410111,0.00012952919,0.00013707404,0.55453587,0.02055849,0.05565323,0.0070712077,0.360747],"study_design_scores_gemma":[0.0000021583276,0.000013312863,0.00005760134,0.0000074979116,0.000014395667,0.000044949385,0.0000035173753,0.9886326,0.0017612232,0.008600363,0.0008546351,0.000007705203],"about_ca_topic_score_codex":0.0041728495,"about_ca_topic_score_gemma":0.0049515767,"teacher_disagreement_score":0.0041728495,"about_ca_system_score_codex":0.0006956865,"about_ca_system_score_gemma":0.0007643215,"threshold_uncertainty_score":0.008297145},"labels":[],"label_agreement":null},{"id":"W4403071170","doi":"10.1007/978-3-031-72384-1_67","title":"Patch-Slide Discriminative Joint Learning for Weakly-Supervised Whole Slide Image Representation and Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Joint (building); Pattern recognition (psychology); Representation (politics); Contextual image classification; Computer vision; Machine learning; Image (mathematics); Engineering","score_opus":0.04120469690530641,"score_gpt":0.31381213763949795,"score_spread":0.2726074407341915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071170","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.013579616,0.00067497377,0.980358,0.00015017028,0.00007400242,0.00007696194,0.000311239,0.0037029488,0.001072098],"genre_scores_gemma":[0.3805859,0.0010007814,0.589225,0.00044595296,0.00034718646,0.00036700568,0.0053511923,0.0011041479,0.021572918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990709,0.00016048743,0.000039629544,0.00036067478,0.00020869338,0.00015959],"domain_scores_gemma":[0.9987915,0.00035404722,0.000100021156,0.00045846554,0.00020302256,0.000092920716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011819601,0.0014277895,0.002387233,0.0010728096,0.0005145864,0.001256488,0.0033160914,0.0020804142,0.006646633],"category_scores_gemma":[0.0028232543,0.00075399707,0.0013006075,0.0021782273,0.0010643263,0.0022472858,0.0028680204,0.0021040938,0.0041093635],"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.00055248255,0.00023264346,0.0009877323,0.00023016233,0.0001506558,0.00012051049,0.000079341735,0.07956994,0.036246467,0.004944463,0.015233128,0.86165243],"study_design_scores_gemma":[0.000017216771,0.00012542855,0.00056799693,0.00001172617,0.000033559805,0.00011099336,0.000027738657,0.98228306,0.00890773,0.0059592165,0.0019400156,0.000015345762],"about_ca_topic_score_codex":0.005187896,"about_ca_topic_score_gemma":0.009963446,"teacher_disagreement_score":0.006646633,"about_ca_system_score_codex":0.0007501846,"about_ca_system_score_gemma":0.0010910555,"threshold_uncertainty_score":0.022235215},"labels":[],"label_agreement":null},{"id":"W4403071398","doi":"10.1007/978-3-031-72384-1_38","title":"Probabilistic Temporal Prediction of Continuous Disease Trajectories and Treatment Effects Using Neural SDEs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Montreal Neurological Institute and Hospital; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Probabilistic logic; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.020620477497878768,"score_gpt":0.26986518920298863,"score_spread":0.24924471170510987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071398","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.14196269,0.0019648469,0.8491867,0.0011781589,0.00017225038,0.00007326654,0.0019231786,0.000556569,0.002982293],"genre_scores_gemma":[0.9376475,0.001082697,0.050908368,0.00019853421,0.00017503898,0.00016155238,0.0015968372,0.000053315234,0.008176048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995697,0.00015482196,0.000034026743,0.00013941174,0.000051618616,0.000050339273],"domain_scores_gemma":[0.99354845,0.0056193466,0.000274474,0.00020594671,0.0002564163,0.00009536144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027151261,0.00057621265,0.0013301071,0.0008738551,0.00022481513,0.00093806785,0.0012889109,0.0011324061,0.0029535831],"category_scores_gemma":[0.008323741,0.0006688301,0.001179261,0.00088895747,0.0005841358,0.0012683608,0.000682888,0.0016850294,0.00046079693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015700034,0.00005467867,0.004272332,0.000056279692,0.00010902666,0.000050765295,0.000028822757,0.94914466,0.00027311817,0.01063213,0.0008724425,0.034348734],"study_design_scores_gemma":[0.000004358218,0.000009126339,0.00030095648,0.0000052368737,0.000008041509,0.000008382718,0.0000019341724,0.99526054,0.000050156927,0.004263637,0.000084628475,0.0000030912029],"about_ca_topic_score_codex":0.010200443,"about_ca_topic_score_gemma":0.010516982,"teacher_disagreement_score":0.010200443,"about_ca_system_score_codex":0.00079987664,"about_ca_system_score_gemma":0.00071199157,"threshold_uncertainty_score":0.02028215},"labels":[],"label_agreement":null},{"id":"W4403071505","doi":"10.1007/978-3-031-72378-0_53","title":"Position-Guided Prompt Learning for Anomaly Detection in Chest X-Rays","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Anomaly detection; Position (finance); Anomaly (physics); Artificial intelligence; Computer vision; Medical physics; Physics","score_opus":0.016797487598930388,"score_gpt":0.2616671714768769,"score_spread":0.24486968387794653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071505","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.03531353,0.0011002104,0.9550517,0.00023780379,0.00021584102,0.00006815507,0.00032232914,0.006775392,0.0009150155],"genre_scores_gemma":[0.46742952,0.0009837993,0.5236895,0.00030850433,0.00022454766,0.0001160477,0.0012174611,0.00042417043,0.005606442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950504,0.00007902257,0.000035791032,0.00016451803,0.00014312236,0.00007254354],"domain_scores_gemma":[0.998544,0.00081594073,0.00010182053,0.00013133774,0.0003158827,0.000091042864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008096521,0.0010685209,0.001140166,0.00077600376,0.0003255851,0.0007882456,0.0016668235,0.001262734,0.003331415],"category_scores_gemma":[0.0037012924,0.0004584407,0.0006914661,0.0008060491,0.00030839746,0.0009923152,0.0014498588,0.0019144561,0.0014687373],"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.00042777188,0.00021126802,0.0034376848,0.00011987763,0.00003631223,0.00018039615,0.000061271254,0.044069406,0.018725181,0.00095150346,0.0054823584,0.92629683],"study_design_scores_gemma":[0.000027434355,0.00018660966,0.001782618,0.000023506747,0.000031093663,0.00031146593,0.000032939566,0.9774139,0.014692371,0.003797721,0.0016844732,0.000015885755],"about_ca_topic_score_codex":0.0023233858,"about_ca_topic_score_gemma":0.0033772367,"teacher_disagreement_score":0.003331415,"about_ca_system_score_codex":0.00041951888,"about_ca_system_score_gemma":0.0009549987,"threshold_uncertainty_score":0.011144698},"labels":[],"label_agreement":null},{"id":"W4403071580","doi":"10.1007/978-3-031-72384-1_1","title":"A Clinical-Oriented Lightweight Network for High-Resolution Medical Image Enhancement","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Resolution (logic); Image (mathematics); High resolution; Computer vision; Artificial intelligence; Computer graphics (images); Remote sensing; Geology","score_opus":0.01499314472784809,"score_gpt":0.298016404245675,"score_spread":0.2830232595178269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071580","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.017990729,0.0009845457,0.9381456,0.00061518827,0.0004078652,0.0004317288,0.0005496624,0.020065608,0.020809056],"genre_scores_gemma":[0.32970107,0.001794863,0.57891923,0.001454697,0.00051972206,0.00080240204,0.0030555169,0.0022579785,0.08149445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997459,0.00005300528,0.000019875253,0.000044012497,0.00009858017,0.000038611764],"domain_scores_gemma":[0.9993635,0.00017935829,0.000055863125,0.00016695344,0.00014189545,0.00009247916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008442767,0.000498041,0.0003979867,0.0008520518,0.0002991414,0.0009709015,0.0014627806,0.00067638414,0.016843602],"category_scores_gemma":[0.0013408253,0.0002805997,0.00026150676,0.0005530582,0.00017939486,0.0011366339,0.0015851846,0.00060228154,0.0060286573],"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.0010345799,0.00039006805,0.0022907215,0.00028825522,0.000073811665,0.0006384794,0.00013956644,0.009723903,0.055039153,0.011551424,0.071136266,0.8476937],"study_design_scores_gemma":[0.00033360734,0.0012494383,0.007219762,0.00028150185,0.00032892547,0.0053509944,0.00025323348,0.49920732,0.089370616,0.034243744,0.3619739,0.00018687976],"about_ca_topic_score_codex":0.00058049546,"about_ca_topic_score_gemma":0.0011971656,"teacher_disagreement_score":0.016843602,"about_ca_system_score_codex":0.00037944296,"about_ca_system_score_gemma":0.00050885254,"threshold_uncertainty_score":0.05634743},"labels":[],"label_agreement":null},{"id":"W4403071629","doi":"10.1007/978-3-031-72384-1_51","title":"A Deep Learning Approach for Placing Magnetic Resonance Spectroscopy Voxels in Brain Tumors","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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 Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Voxel; Computer science; Spectroscopy; Nuclear magnetic resonance; Magnetic resonance imaging; Artificial intelligence; Physics; Astronomy; Radiology; Medicine","score_opus":0.022750517214734013,"score_gpt":0.2561602723876128,"score_spread":0.2334097551728788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071629","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.0062785195,0.0005228964,0.9892875,0.0002526865,0.000101366364,0.000024599958,0.00020479693,0.00107002,0.002257559],"genre_scores_gemma":[0.14963692,0.00094713835,0.82400763,0.0004489167,0.00019816704,0.00008572384,0.000794086,0.000362245,0.023519116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999808,0.000023353741,0.00001121272,0.000055979504,0.00006728813,0.00003414865],"domain_scores_gemma":[0.99964917,0.00013516081,0.000024279196,0.00004870878,0.00011910463,0.000023591005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000591043,0.00088810537,0.00071744836,0.00069527124,0.00041461975,0.0009086572,0.0016486996,0.0013560033,0.004260777],"category_scores_gemma":[0.0010079133,0.00058806397,0.00080172025,0.000942642,0.00039516715,0.0008098952,0.0014414933,0.0015787774,0.0013081883],"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.00009294779,0.00007947813,0.000607451,0.0000851604,0.000051940766,0.00007874216,0.000049617556,0.19026044,0.015733197,0.010420482,0.00988614,0.7726543],"study_design_scores_gemma":[0.0000060951934,0.000028965782,0.00026762427,0.000015224425,0.000018805697,0.00006795644,0.000012943851,0.97971684,0.005581536,0.011252503,0.0030227327,0.000008753446],"about_ca_topic_score_codex":0.008318335,"about_ca_topic_score_gemma":0.01487681,"teacher_disagreement_score":0.008318335,"about_ca_system_score_codex":0.0007859947,"about_ca_system_score_gemma":0.0008380113,"threshold_uncertainty_score":0.016539812},"labels":[],"label_agreement":null},{"id":"W4403071704","doi":"10.1007/978-3-031-72378-0_54","title":"Representation Learning with a Transformer-Based Detection Model for Localized Chest X-Ray Disease and Progression Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"McMaster University","funders":"","keywords":"Computer science; Transformer; Representation (politics); Artificial intelligence; Pattern recognition (psychology); Electrical engineering; Engineering; Voltage","score_opus":0.026458035613122818,"score_gpt":0.3158270010729809,"score_spread":0.2893689654598581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009689111,0.00031145182,0.98800534,0.00018095894,0.000048014324,0.000024936671,0.00013877449,0.0008610633,0.00074036955],"genre_scores_gemma":[0.71710616,0.0007100839,0.2708204,0.00034990194,0.00014515175,0.00017223475,0.0009931825,0.00019550826,0.00950748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996612,0.00006374577,0.000022915214,0.0001264869,0.00007311696,0.00005247356],"domain_scores_gemma":[0.99936527,0.00034530528,0.000050152892,0.0000635555,0.00014799648,0.000027732449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091533415,0.0006206719,0.0009774393,0.00063951436,0.00025348485,0.0010348714,0.0015186152,0.0010463215,0.0025467253],"category_scores_gemma":[0.0019214164,0.0004320835,0.0012407847,0.0007472802,0.0003636828,0.0010958889,0.000985973,0.0016737538,0.0011385856],"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.00030963463,0.0001867392,0.0016879372,0.00013417342,0.00017007093,0.00013962317,0.0000773112,0.37853074,0.012621029,0.012048255,0.0050469423,0.5890475],"study_design_scores_gemma":[0.000004529308,0.000028103339,0.00015210368,0.0000048607076,0.000020813644,0.00004244186,0.0000036587812,0.99529123,0.001162677,0.0029996159,0.00028454402,0.0000054414395],"about_ca_topic_score_codex":0.0063611767,"about_ca_topic_score_gemma":0.006422742,"teacher_disagreement_score":0.0063611767,"about_ca_system_score_codex":0.00070888834,"about_ca_system_score_gemma":0.00082670647,"threshold_uncertainty_score":0.012648344},"labels":[],"label_agreement":null},{"id":"W4403071714","doi":"10.1007/978-3-031-72384-1_11","title":"Cross-Modality Cardiac Insight Transfer: A Contrastive Learning Approach to Enrich ECG with CMR Features","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ECG Monitoring and Analysis","field":"Medicine","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":"Intertek (Canada)","funders":"","keywords":"Modality (human–computer interaction); Computer science; Transfer of learning; Artificial intelligence; Contrastive analysis; Natural language processing; Linguistics; Philosophy","score_opus":0.012460389800017221,"score_gpt":0.2652970066770484,"score_spread":0.2528366168770312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022862071,0.00075599365,0.9701002,0.00017281373,0.00011249408,0.00007928803,0.00029675066,0.0016900646,0.0039303103],"genre_scores_gemma":[0.2914538,0.0014144658,0.687544,0.00041350728,0.00022800385,0.0001604388,0.0012417079,0.00049539405,0.017048748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997904,0.000037969803,0.000008764525,0.00007448383,0.000062969855,0.000025427958],"domain_scores_gemma":[0.99956673,0.0002153189,0.000025610005,0.0000674988,0.000096031436,0.000028829825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008523847,0.0007663428,0.0005022666,0.00069474964,0.00017242732,0.00080104556,0.0010066868,0.0009887118,0.005133563],"category_scores_gemma":[0.001517684,0.00027762834,0.00079372764,0.0007864929,0.00026916538,0.0009583954,0.0014473619,0.0012223754,0.0017831493],"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.00025780709,0.00030894158,0.00081019773,0.00011236162,0.000080716214,0.00016337002,0.000073505005,0.017134793,0.08233488,0.002819215,0.0046320115,0.89127207],"study_design_scores_gemma":[0.000029982508,0.00032807988,0.0030591683,0.000038748258,0.00014506359,0.00063111563,0.00006530116,0.89677614,0.08086958,0.008459775,0.009555153,0.00004183868],"about_ca_topic_score_codex":0.00087622425,"about_ca_topic_score_gemma":0.0014428865,"teacher_disagreement_score":0.005133563,"about_ca_system_score_codex":0.00018674748,"about_ca_system_score_gemma":0.00026528467,"threshold_uncertainty_score":0.017173529},"labels":[],"label_agreement":null},{"id":"W4403071856","doi":"10.1007/978-3-031-72378-0_31","title":"Reliable Multi-view Learning with Conformal Prediction for Aortic Stenosis Classification in Echocardiography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Stenosis; Cardiology; Conformal map; Artificial intelligence; Internal medicine; Radiology; Medicine; Mathematics; Geometry","score_opus":0.020783392616453244,"score_gpt":0.29927751824781074,"score_spread":0.2784941256313575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015655188,0.0022206393,0.9797524,0.00025288187,0.00015018792,0.000028234952,0.00028318187,0.00083920016,0.0008180202],"genre_scores_gemma":[0.48961565,0.0026484318,0.49939734,0.00040362627,0.00046720414,0.00011743085,0.0019128807,0.00034556247,0.0050918334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920326,0.00019849931,0.000052536026,0.00023350916,0.000225161,0.000087065644],"domain_scores_gemma":[0.9982439,0.0009747424,0.00009389391,0.00031361997,0.0003035746,0.00007023549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445965,0.0008526752,0.0015762361,0.0008346929,0.00028502595,0.0011316173,0.0016669387,0.0014586159,0.0019224259],"category_scores_gemma":[0.0039226203,0.0005924428,0.0015146198,0.0010842021,0.00042662857,0.0009361307,0.0016722941,0.0016067305,0.0013026623],"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.00017956962,0.00008984309,0.002635752,0.00015515991,0.00018287187,0.00015925973,0.00007228754,0.14019774,0.011442051,0.003257076,0.0098845465,0.83174384],"study_design_scores_gemma":[0.0000057116936,0.000044155684,0.0007183519,0.000014909673,0.000025295973,0.00012179016,0.000011370147,0.992417,0.002250631,0.0035224336,0.00085564196,0.000012677772],"about_ca_topic_score_codex":0.0038257737,"about_ca_topic_score_gemma":0.005104986,"teacher_disagreement_score":0.0038257737,"about_ca_system_score_codex":0.00040436737,"about_ca_system_score_gemma":0.0005670724,"threshold_uncertainty_score":0.007647097},"labels":[],"label_agreement":null},{"id":"W4403071917","doi":"10.1007/978-3-031-72384-1_2","title":"A Clinical-Oriented Multi-level Contrastive Learning Method for Disease Diagnosis in Low-Quality Medical Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Quality (philosophy); Artificial intelligence; Contrastive analysis; Natural language processing; Linguistics","score_opus":0.08241337606324936,"score_gpt":0.4430579512729389,"score_spread":0.3606445752096895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403071917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005383983,0.0004191523,0.9918819,0.00012812238,0.000060666345,0.00006547665,0.000081449245,0.00070566643,0.0012735892],"genre_scores_gemma":[0.06186022,0.00057315023,0.9305397,0.0002421126,0.00009988298,0.000091375434,0.00026574923,0.00015286621,0.0061749523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997478,0.000036300775,0.000017072147,0.000060451486,0.0001131802,0.00002517173],"domain_scores_gemma":[0.9995229,0.00018364095,0.000028188046,0.000049797607,0.0001815515,0.000033850243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922888,0.0006077344,0.00047197563,0.0009763714,0.00024868254,0.0007961619,0.0011750651,0.0010291806,0.004394933],"category_scores_gemma":[0.001156316,0.00028454725,0.00076981145,0.0006568835,0.00031830074,0.0005857498,0.0007912815,0.00092120277,0.0015807194],"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.00015448824,0.0001338182,0.0007104091,0.0001328465,0.00007862222,0.00010931532,0.000041371768,0.025644125,0.06804506,0.0046156254,0.004383596,0.8959507],"study_design_scores_gemma":[0.000021121403,0.0001502207,0.0017987819,0.00002799204,0.00006841312,0.0006599523,0.000020061332,0.9451417,0.04201305,0.0034529513,0.0066199307,0.000025838237],"about_ca_topic_score_codex":0.0017626473,"about_ca_topic_score_gemma":0.0038274678,"teacher_disagreement_score":0.004394933,"about_ca_system_score_codex":0.00039114174,"about_ca_system_score_gemma":0.0006768029,"threshold_uncertainty_score":0.014702439},"labels":[],"label_agreement":null},{"id":"W4403075145","doi":"10.1007/978-3-031-73471-7_16","title":"Boosting Vision-Language Models for Histopathology Classification: Predict All at Once","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"École de Technologie Supérieure; Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Boosting (machine learning); Computer science; Artificial intelligence; Natural language processing; Machine learning","score_opus":0.03131464875024249,"score_gpt":0.28710032805145835,"score_spread":0.2557856793012159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403075145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046745263,0.0037322019,0.93784,0.0014427786,0.00048738852,0.00010494296,0.0007199207,0.0039707986,0.004956829],"genre_scores_gemma":[0.6441966,0.0017857277,0.33443698,0.00095112185,0.00056612655,0.00016025359,0.0019093074,0.00048589162,0.0155078685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.00013415974,0.000021877804,0.000108474414,0.00014048668,0.000089039226],"domain_scores_gemma":[0.99911636,0.00033414905,0.000056047367,0.00011508928,0.00032010005,0.000058165657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016985607,0.0009012832,0.0012263282,0.0007571335,0.0003437287,0.0008631928,0.0018538481,0.0012441042,0.0021878611],"category_scores_gemma":[0.002565523,0.0005742465,0.0011752807,0.00087035826,0.0002932523,0.0009918696,0.0006929923,0.0016454253,0.0032188608],"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.00023180265,0.00033335775,0.0039231637,0.00013277783,0.0001683389,0.0000861227,0.00006404218,0.127412,0.019889643,0.0049413987,0.024274565,0.8185428],"study_design_scores_gemma":[0.00000764708,0.00006606876,0.00070072105,0.000014753733,0.00005599728,0.00008096944,0.000010650172,0.9843627,0.005489127,0.0069166315,0.0022821531,0.00001261506],"about_ca_topic_score_codex":0.0037876086,"about_ca_topic_score_gemma":0.0057336246,"teacher_disagreement_score":0.0037876086,"about_ca_system_score_codex":0.0005858883,"about_ca_system_score_gemma":0.0007973231,"threshold_uncertainty_score":0.008982897},"labels":[],"label_agreement":null},{"id":"W4403081400","doi":"10.1007/978-3-031-72658-3_6","title":"MapTracker: Tracking with Strided Memory Fusion for Consistent Vector HD Mapping","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Fusion; Tracking (education); Artificial intelligence; Pattern recognition (psychology)","score_opus":0.01994960876209137,"score_gpt":0.21483226193504185,"score_spread":0.19488265317295048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403081400","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.0026491433,0.00021433622,0.9909244,0.000038960818,0.00008078345,0.000024617995,0.00016746974,0.004836754,0.0010635318],"genre_scores_gemma":[0.11008741,0.00032458932,0.8779281,0.00014876317,0.00007409721,0.00014005172,0.00090956135,0.0007052731,0.009682162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996896,0.000033789376,0.000017424312,0.00008667703,0.0001373209,0.000035296533],"domain_scores_gemma":[0.99973446,0.000068440175,0.000018527666,0.00010033753,0.00006456444,0.000013692878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051744876,0.0006603449,0.00086569105,0.0005537679,0.00037774036,0.0009989338,0.0018691542,0.0009903385,0.007678243],"category_scores_gemma":[0.0010680386,0.00048815183,0.00040336308,0.00095519115,0.00039072955,0.001768032,0.002081146,0.0009621703,0.0029238556],"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.00035749807,0.00006738465,0.0002919167,0.00015181066,0.000087298824,0.00009985787,0.000120658195,0.0361404,0.032864973,0.009985788,0.020104172,0.89972824],"study_design_scores_gemma":[0.00007463029,0.00013951406,0.00058251695,0.000037946516,0.000043868866,0.0002640094,0.000054717082,0.90654206,0.052026745,0.014195194,0.025983088,0.000055786382],"about_ca_topic_score_codex":0.0029196648,"about_ca_topic_score_gemma":0.0034745422,"teacher_disagreement_score":0.007678243,"about_ca_system_score_codex":0.00030832397,"about_ca_system_score_gemma":0.0005900431,"threshold_uncertainty_score":0.025686264},"labels":[],"label_agreement":null},{"id":"W4403081519","doi":"10.1007/978-3-031-72658-3_18","title":"G3R: Gradient Guided Generalizable Reconstruction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Toronto","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.024203898349290067,"score_gpt":0.27811868445973337,"score_spread":0.2539147861104433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403081519","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.00083890895,0.00033755467,0.9862373,0.00011989091,0.00010535307,0.000023875566,0.00020880651,0.0070185973,0.005109741],"genre_scores_gemma":[0.025413163,0.000709567,0.9405622,0.0002675339,0.00009671812,0.000070529066,0.0011350879,0.004344167,0.027400991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997949,0.000032617896,0.00000677038,0.000045628625,0.000103331964,0.000016756068],"domain_scores_gemma":[0.99985194,0.000039038277,0.000011107207,0.00005367441,0.000030393418,0.000013804066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027588764,0.001028373,0.00062558573,0.0006975028,0.00017403165,0.0008647355,0.0010430898,0.0010737808,0.019496892],"category_scores_gemma":[0.0005759746,0.0004420419,0.0005250989,0.000795907,0.00042650112,0.00074349734,0.00101101,0.0013848084,0.011834057],"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.0001592866,0.000053718155,0.00014353175,0.0002469624,0.00004584327,0.00020479897,0.00006388089,0.037104,0.038695395,0.046804387,0.10329509,0.77318317],"study_design_scores_gemma":[0.00005658182,0.00007979179,0.00044492914,0.00007492736,0.00002804446,0.0011456247,0.0000319623,0.70920265,0.047880523,0.07019965,0.1707889,0.000066314315],"about_ca_topic_score_codex":0.0010423447,"about_ca_topic_score_gemma":0.0016417142,"teacher_disagreement_score":0.019496892,"about_ca_system_score_codex":0.00023524123,"about_ca_system_score_gemma":0.00035531074,"threshold_uncertainty_score":0.065223575},"labels":[],"label_agreement":null},{"id":"W4403088751","doi":"10.1007/978-3-031-72086-4_25","title":"Ensemble of Prior-guided Expert Graph Models for Survival Prediction in Digital Pathology","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Sunnybrook Hospital; University of Toronto","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Digital pathology; Theoretical computer science","score_opus":0.023183980015146426,"score_gpt":0.2921533473873863,"score_spread":0.26896936737223986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403088751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10402491,0.0038396278,0.8839344,0.00071859953,0.00022774635,0.00010190363,0.0011415343,0.002773004,0.0032383054],"genre_scores_gemma":[0.8311722,0.0013582585,0.1555462,0.00047993768,0.00026874864,0.00015932416,0.0030593828,0.00030184645,0.007654174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.00018266258,0.00003121509,0.00016851867,0.00009945191,0.0000650975],"domain_scores_gemma":[0.99724245,0.0019729615,0.00010010289,0.00019710309,0.0003928047,0.000094616844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00202847,0.0010831502,0.0019879946,0.0017043345,0.0004630816,0.0009762504,0.0020925335,0.0020105601,0.002189088],"category_scores_gemma":[0.0040907674,0.0006865564,0.0015079798,0.001176724,0.00045049653,0.0013787374,0.0008341784,0.0019700797,0.0009760323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021772056,0.00014180838,0.0017698718,0.00006563494,0.00018034028,0.00006310473,0.000048666832,0.82297355,0.0007723518,0.0016483918,0.004382031,0.1677365],"study_design_scores_gemma":[0.0000036993172,0.000020895153,0.00014847939,0.0000075795906,0.00001718592,0.000011844172,0.0000032265584,0.9980261,0.00016538044,0.0014290732,0.00016307224,0.0000034583024],"about_ca_topic_score_codex":0.014436451,"about_ca_topic_score_gemma":0.021184642,"teacher_disagreement_score":0.014436451,"about_ca_system_score_codex":0.0008064693,"about_ca_system_score_gemma":0.0010165399,"threshold_uncertainty_score":0.028704822},"labels":[],"label_agreement":null},{"id":"W4403089293","doi":"10.1007/978-3-031-72086-4_4","title":"A Region-Based Approach to Diabetic Retinopathy Classification with Superpixel Tokenization","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Polytechnique Montréal; Hôpital Maisonneuve-Rosemont","funders":"","keywords":"Lexical analysis; Computer science; Diabetic retinopathy; Artificial intelligence; Pattern recognition (psychology); Medicine; Diabetes mellitus","score_opus":0.02104517074159092,"score_gpt":0.24820418866477317,"score_spread":0.22715901792318224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403089293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016712643,0.0012506255,0.9766713,0.00016143915,0.0001439371,0.00014099973,0.0004274272,0.0027679687,0.0017237987],"genre_scores_gemma":[0.14870119,0.001070322,0.83968705,0.00020810693,0.0001727852,0.00017050175,0.001623184,0.00037306716,0.007993787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.000060606617,0.000032660257,0.00016122709,0.00014839497,0.000099721015],"domain_scores_gemma":[0.9996451,0.000085803775,0.000030095927,0.00007310972,0.00013712714,0.00002863558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082292844,0.0007615816,0.0015645162,0.0016679285,0.0005672722,0.0013729824,0.002369447,0.0011029998,0.0045727333],"category_scores_gemma":[0.0008082534,0.0005302444,0.0015111637,0.0021965024,0.00039344185,0.0011826915,0.001174284,0.0011284541,0.0027100837],"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.00037707802,0.00022061949,0.00114631,0.00012962738,0.00014306919,0.00014390651,0.00006414102,0.030088805,0.04926146,0.003552678,0.0057934155,0.90907896],"study_design_scores_gemma":[0.00001605304,0.000117506774,0.0021077087,0.000022079837,0.00010818027,0.00027647047,0.000059630343,0.96137935,0.026297044,0.004340611,0.005242744,0.00003262715],"about_ca_topic_score_codex":0.010554631,"about_ca_topic_score_gemma":0.013557425,"teacher_disagreement_score":0.010554631,"about_ca_system_score_codex":0.0007976077,"about_ca_system_score_gemma":0.0012705402,"threshold_uncertainty_score":0.020986438},"labels":[],"label_agreement":null},{"id":"W4403090217","doi":"10.1007/978-3-031-72069-7_45","title":"TractOracle: Towards an Anatomically-Informed Reward Function for RL-Based Tractography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Tractography; Function (biology); Artificial intelligence; Diffusion MRI; Magnetic resonance imaging; Medicine; Radiology","score_opus":0.05447009360161693,"score_gpt":0.35388631582252805,"score_spread":0.29941622222091113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403090217","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.0007808566,0.000089344605,0.9964737,0.00006430674,0.000024857374,0.000009612992,0.0000531448,0.001762103,0.0007421285],"genre_scores_gemma":[0.049845427,0.00030426524,0.94202983,0.000112898546,0.000089141104,0.000086043954,0.0003166893,0.0018269917,0.0053887498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996314,0.00010037245,0.000022487016,0.000083355524,0.00012745571,0.00003485854],"domain_scores_gemma":[0.9993036,0.00031740146,0.000056465862,0.00012481363,0.00013315996,0.00006450548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300752,0.001022525,0.0009933383,0.00055505784,0.0004221407,0.0019394617,0.0018829106,0.0021637494,0.008364341],"category_scores_gemma":[0.003025209,0.0005718327,0.0009399869,0.00073105353,0.0008872705,0.0015807728,0.002090742,0.0023390527,0.005454001],"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.00023692341,0.000073700845,0.0003966786,0.0003173995,0.000104113315,0.00022723422,0.0001471912,0.22505349,0.035781886,0.10857848,0.02253952,0.6065434],"study_design_scores_gemma":[0.000011456163,0.00002809512,0.00011757891,0.000025770592,0.000010493494,0.00011413921,0.00000895271,0.94899035,0.0066678263,0.036052797,0.007953875,0.000018679133],"about_ca_topic_score_codex":0.0024612446,"about_ca_topic_score_gemma":0.0039056116,"teacher_disagreement_score":0.008364341,"about_ca_system_score_codex":0.0005875172,"about_ca_system_score_gemma":0.0009849548,"threshold_uncertainty_score":0.02798152},"labels":[],"label_agreement":null},{"id":"W4403090243","doi":"10.1007/978-3-031-72069-7_19","title":"Exploring Spatio-temporal Interpretable Dynamic Brain Function with Transformer for Brain Disorder Diagnosis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Brain function; Artificial intelligence; Transformer; Neuroscience; Psychology; Electrical engineering","score_opus":0.042543773988151456,"score_gpt":0.25700550763616764,"score_spread":0.21446173364801618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403090243","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.042699926,0.00089190126,0.9490842,0.00022952254,0.000054287895,0.00003138798,0.00091003475,0.0015869774,0.0045117512],"genre_scores_gemma":[0.6029153,0.001919432,0.38806465,0.000078909005,0.00007139231,0.00004509532,0.0013879691,0.0003337622,0.005183594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999609,0.0000074450472,0.0000022690806,0.000013204523,0.000010232266,0.000005932551],"domain_scores_gemma":[0.99987817,0.00008045815,0.000011038773,0.000011872774,0.000011416618,0.0000069885086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019599812,0.00044768228,0.00020333602,0.0004777926,0.00011954909,0.0006838451,0.00035414976,0.0003286842,0.0053864196],"category_scores_gemma":[0.0007501227,0.00014596205,0.00047896523,0.00051866745,0.00026425524,0.00062117697,0.00038647823,0.0003844725,0.00084207684],"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.00045247065,0.000049134385,0.0037705835,0.00033936434,0.000100748206,0.001126931,0.0002953721,0.045362372,0.13544539,0.038844895,0.0066604917,0.7675522],"study_design_scores_gemma":[0.000021141968,0.00018272219,0.010285253,0.000073084375,0.00017297463,0.0034054231,0.00039026074,0.8083381,0.05255587,0.11152431,0.013004072,0.00004674742],"about_ca_topic_score_codex":0.001086587,"about_ca_topic_score_gemma":0.0017848051,"teacher_disagreement_score":0.0053864196,"about_ca_system_score_codex":0.00016405244,"about_ca_system_score_gemma":0.00019249051,"threshold_uncertainty_score":0.018019319},"labels":[],"label_agreement":null},{"id":"W4403090316","doi":"10.1007/978-3-031-72069-7_41","title":"Synchronous Image-Label Diffusion with Anisotropic Noise for Stroke Lesion Segmentation on Non-Contrast CT","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Calgary","funders":"","keywords":"Computer science; Anisotropic diffusion; Contrast (vision); Noise (video); Artificial intelligence; Diffusion; Segmentation; Computer vision; Lesion; Image (mathematics); Image noise; Image segmentation; Stroke (engine); Medicine; Physics; Pathology","score_opus":0.01305184304516936,"score_gpt":0.2723251604414096,"score_spread":0.2592733173962402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403090316","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.019429196,0.0006671847,0.9781673,0.00008597246,0.0000404999,0.000033173703,0.00007057389,0.0005887766,0.00091732654],"genre_scores_gemma":[0.17909397,0.0012887524,0.813887,0.00007894286,0.00009377953,0.00006848727,0.00035766105,0.0006094492,0.0045219515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000040253813,0.000018243149,0.000053275082,0.00009093337,0.000021183705],"domain_scores_gemma":[0.99958974,0.00015940449,0.00004879389,0.000073121766,0.00009786202,0.000031123644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007256465,0.0008356977,0.000709732,0.00088854035,0.00036328347,0.0011214003,0.0008882593,0.0010276013,0.0015139371],"category_scores_gemma":[0.0013379061,0.00050644786,0.0007646129,0.0011441502,0.0004210175,0.0010895857,0.00082706625,0.0006198836,0.0008683355],"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.0005714119,0.00013425203,0.0016402958,0.0006066251,0.00017269647,0.00041079047,0.00025179054,0.08187046,0.2345448,0.01276066,0.0037420504,0.6632941],"study_design_scores_gemma":[0.000016242398,0.000091524955,0.0010240299,0.000022667587,0.00009381853,0.0005311726,0.000037395923,0.9297143,0.06046403,0.0044255313,0.0035489502,0.000030305464],"about_ca_topic_score_codex":0.0024898683,"about_ca_topic_score_gemma":0.0058363215,"teacher_disagreement_score":0.0024898683,"about_ca_system_score_codex":0.00046248696,"about_ca_system_score_gemma":0.0010039748,"threshold_uncertainty_score":0.0050646067},"labels":[],"label_agreement":null},{"id":"W4403090349","doi":"10.1007/978-3-031-72069-7_26","title":"Masked Residual Diffusion Probabilistic Model with Regional Asymmetry Prior for Generating Perfusion Maps from Multi-phase CTA","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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 Calgary","funders":"","keywords":"Computer science; Residual; Diffusion; Asymmetry; Probabilistic logic; Perfusion; Algorithm; Artificial intelligence; Radiology; Thermodynamics; Physics; Medicine","score_opus":0.028880539993555727,"score_gpt":0.26267657411804013,"score_spread":0.2337960341244844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403090349","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.002774034,0.00017370406,0.9959436,0.00008505523,0.000017470742,0.000020405509,0.00012302143,0.00036195008,0.0005007472],"genre_scores_gemma":[0.27665147,0.0012081263,0.71222216,0.00025461736,0.00010793017,0.00024312192,0.0011725429,0.0006363243,0.0075038266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998952,0.000027443592,0.0000047615918,0.000025772411,0.000035665005,0.0000111079735],"domain_scores_gemma":[0.9996662,0.0001872155,0.000035277168,0.000040428386,0.00005289355,0.000017924527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060222927,0.00060477277,0.00048532532,0.00046758604,0.00015283449,0.0006731754,0.0009951494,0.0011268862,0.0024262918],"category_scores_gemma":[0.0016722821,0.0005866144,0.0008455144,0.00055866974,0.000328552,0.00072064844,0.00090102,0.0012712592,0.0010359584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023163162,0.000043338478,0.00036145689,0.00018351726,0.00008748921,0.0002024213,0.000057878697,0.75175846,0.029072588,0.023610715,0.0038052232,0.19058526],"study_design_scores_gemma":[0.0000050228546,0.000015406138,0.00007199152,0.0000072036264,0.00001087154,0.00006407004,0.0000019120068,0.99203557,0.0031126938,0.003908736,0.00075850764,0.0000080492655],"about_ca_topic_score_codex":0.0021752,"about_ca_topic_score_gemma":0.0026734294,"teacher_disagreement_score":0.0024262918,"about_ca_system_score_codex":0.00040448803,"about_ca_system_score_gemma":0.00078694645,"threshold_uncertainty_score":0.008116782},"labels":[],"label_agreement":null},{"id":"W4403090575","doi":"10.1007/978-3-031-72069-7_61","title":"Heteroscedastic Uncertainty Estimation Framework for Unsupervised Registration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Vector Institute; University of British Columbia","funders":"National Institute of Neurological Disorders and Stroke; National Cancer Institute; National Heart, Lung, and Blood Institute; National Institutes of Health","keywords":"Heteroscedasticity; Computer science; Estimation; Artificial intelligence; Data mining; Machine learning; Systems engineering; Engineering","score_opus":0.021520903006297266,"score_gpt":0.2852284728215373,"score_spread":0.26370756981524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403090575","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.0005866739,0.00007870464,0.99896646,0.000023869514,0.0000084245785,0.0000047918884,0.00002211674,0.00007749109,0.00023152486],"genre_scores_gemma":[0.19936268,0.00093118474,0.785573,0.0001621787,0.00020979998,0.00020968837,0.00089591934,0.0004981483,0.01215735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894387,0.00036419954,0.000054866214,0.0002545861,0.0002991661,0.00008336447],"domain_scores_gemma":[0.99857175,0.00075246533,0.00014870019,0.00018933191,0.0002937205,0.00004411237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022523,0.0008977323,0.0016012982,0.0007474145,0.0004390985,0.0013989767,0.0026513797,0.0013064911,0.0029346978],"category_scores_gemma":[0.004367283,0.0009777038,0.0014484257,0.0013210551,0.0011407112,0.002124765,0.0024678186,0.0021722028,0.001163935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016092099,0.00005851194,0.00058307766,0.00018558775,0.00018255583,0.000118838696,0.00012766248,0.63512677,0.007398025,0.15980153,0.0035794594,0.19267708],"study_design_scores_gemma":[0.0000034384987,0.000017524682,0.00012314541,0.000007250846,0.000012788115,0.00003224869,0.0000060867083,0.97591156,0.001026596,0.021587053,0.0012577146,0.0000145855],"about_ca_topic_score_codex":0.00512599,"about_ca_topic_score_gemma":0.005271628,"teacher_disagreement_score":0.00512599,"about_ca_system_score_codex":0.00089128385,"about_ca_system_score_gemma":0.0014691799,"threshold_uncertainty_score":0.010696232},"labels":[],"label_agreement":null},{"id":"W4403129843","doi":"10.1007/978-3-031-73360-4_11","title":"Beyond Conventional Parametric Modeling: Data-Driven Framework for Estimation and Prediction of Time Activity Curves in Dynamic PET Imaging","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Okanagan College","funders":"","keywords":"Computer science; Parametric statistics; Parametric model; Estimation; Estimation theory; Artificial intelligence; Data mining; Algorithm; Statistics; Mathematics","score_opus":0.0327280960039105,"score_gpt":0.335228529184614,"score_spread":0.30250043318070347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403129843","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.0023746456,0.0008979943,0.99582195,0.00018296219,0.00002685317,0.000009813703,0.00010247669,0.0002125889,0.0003707747],"genre_scores_gemma":[0.371303,0.005869322,0.60881233,0.00047898936,0.00037520478,0.00022021988,0.0012165484,0.00060682563,0.01111763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995958,0.0001405997,0.000024131848,0.000117610754,0.00008695941,0.00003485205],"domain_scores_gemma":[0.99838006,0.0012018775,0.00010775558,0.00014408129,0.00012093768,0.000045343542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016785149,0.0008820447,0.00146661,0.0004803391,0.0002494039,0.0020427522,0.0020593628,0.0018629222,0.0016873634],"category_scores_gemma":[0.0042207595,0.0010560362,0.0012942497,0.0012371476,0.00077801745,0.0018779052,0.001063173,0.0024829155,0.00081313174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009588714,0.00007190743,0.00074605265,0.00023960917,0.00011582356,0.00014969599,0.000096239026,0.8060106,0.0050687836,0.042667545,0.0028049292,0.14193283],"study_design_scores_gemma":[0.0000017395955,0.00001107324,0.00010114075,0.000008492763,0.000008539364,0.00003378347,0.0000033657554,0.98542655,0.00040229884,0.01299917,0.0009960801,0.000007872715],"about_ca_topic_score_codex":0.005028502,"about_ca_topic_score_gemma":0.004669551,"teacher_disagreement_score":0.005028502,"about_ca_system_score_codex":0.0006838112,"about_ca_system_score_gemma":0.0010872823,"threshold_uncertainty_score":0.0099985},"labels":[],"label_agreement":null},{"id":"W4403138900","doi":"10.1007/978-3-031-73647-6_5","title":"PIPsUS: Self-supervised Point Tracking in Ultrasound","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Flow Measurement and Analysis","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":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Tracking (education); Point (geometry); Computer vision; Mathematics","score_opus":0.014370583088270232,"score_gpt":0.21521562428765736,"score_spread":0.20084504119938712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403138900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013562699,0.0001720803,0.99387324,0.00002241004,0.00004372814,0.000022182778,0.00010898095,0.0036668545,0.00073424954],"genre_scores_gemma":[0.044094235,0.0005641648,0.9431468,0.00012483181,0.00010389148,0.00014216838,0.0011075407,0.0011280976,0.009588244],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928063,0.00009359257,0.000027438837,0.00021177295,0.00034262473,0.000044010394],"domain_scores_gemma":[0.99936885,0.00027718654,0.00003847827,0.00015981017,0.00012735942,0.000028298193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080514594,0.0008488141,0.0011309577,0.0006084777,0.00027864423,0.0009191822,0.001981103,0.0011089134,0.00630133],"category_scores_gemma":[0.0015497803,0.00070665404,0.0005863433,0.0011512339,0.0004890735,0.001278215,0.0018502497,0.0011874704,0.0053843376],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017939886,0.000063581945,0.00035720688,0.00020053393,0.000066006214,0.00005627088,0.00008626043,0.047040395,0.0400083,0.006255813,0.018709503,0.8869767],"study_design_scores_gemma":[0.000020148795,0.000078561985,0.00058640644,0.000027398857,0.000021720922,0.00022157536,0.000019265484,0.9551968,0.02411218,0.0057317703,0.013958554,0.000025532308],"about_ca_topic_score_codex":0.0020912944,"about_ca_topic_score_gemma":0.0026073721,"teacher_disagreement_score":0.00630133,"about_ca_system_score_codex":0.000312203,"about_ca_system_score_gemma":0.00060432823,"threshold_uncertainty_score":0.021080077},"labels":[],"label_agreement":null},{"id":"W4403138908","doi":"10.1007/978-3-031-73647-6_7","title":"An Evaluation of Low-Cost Hardware on 3D Ultrasound Reconstruction Accuracy","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université TÉLUQ; NeuroRx Research (Canada); Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Computer hardware; Computer graphics (images); Computer vision; Artificial intelligence","score_opus":0.022727177897913554,"score_gpt":0.32497876496449407,"score_spread":0.3022515870665805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403138908","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.7743256,0.007815508,0.20093165,0.0006020144,0.0004375761,0.00026278663,0.0019239757,0.005068165,0.008632748],"genre_scores_gemma":[0.88642925,0.001379349,0.106246084,0.0001192236,0.00008386493,0.00007481728,0.0015886441,0.00061451644,0.0034642208],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99671566,0.0008093149,0.00023576702,0.00037494197,0.0016265628,0.00023771406],"domain_scores_gemma":[0.97209847,0.021284882,0.0009143208,0.0016850566,0.0038229197,0.00019437897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019964287,0.00089551235,0.0005771206,0.0011190329,0.00022510707,0.0010140834,0.0015644341,0.0014668201,0.008799776],"category_scores_gemma":[0.02167658,0.0003955552,0.0004456199,0.0016998152,0.00038118396,0.0013609553,0.0008731917,0.00033721502,0.0015502025],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01059176,0.00053936173,0.018068187,0.0013634316,0.00032555484,0.00037912937,0.00015810538,0.09465033,0.17918581,0.0021892097,0.005248004,0.68730116],"study_design_scores_gemma":[0.0003904222,0.0046854126,0.08355906,0.00028791526,0.00094688113,0.0016543891,0.00025210148,0.5774959,0.3228637,0.0012391753,0.006445713,0.00017933568],"about_ca_topic_score_codex":0.0024628548,"about_ca_topic_score_gemma":0.0022929497,"teacher_disagreement_score":0.008799776,"about_ca_system_score_codex":0.0005937809,"about_ca_system_score_gemma":0.0004944658,"threshold_uncertainty_score":0.029438138},"labels":[],"label_agreement":null},{"id":"W4403139160","doi":"10.1007/978-3-031-73647-6_3","title":"Do High-Performance Image-to-Image Translation Networks Enable the Discovery of Radiomic Features? Application to MRI Synthesis from Ultrasound in Prostate Cancer","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Translation (biology); Artificial intelligence; Ultrasound; Prostate cancer; Image translation; Image synthesis; Computer vision; Image (mathematics); Cancer; Radiology; Medicine","score_opus":0.0054691497750264766,"score_gpt":0.25092055958636805,"score_spread":0.2454514098113416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403139160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09091538,0.004609237,0.88681626,0.0014371463,0.00045128498,0.00005811208,0.0002938719,0.003167429,0.01225127],"genre_scores_gemma":[0.69705874,0.0029838004,0.28151572,0.00034495041,0.00026325413,0.00007207154,0.00061689893,0.00033727987,0.01680729],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992573,0.00001795721,0.0000027619178,0.000019041898,0.000021311012,0.000013224576],"domain_scores_gemma":[0.9997081,0.00017988721,0.000025592482,0.00003131515,0.000043576234,0.000011453845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003464491,0.00053354434,0.0003539258,0.00022738501,0.0002505348,0.0008525975,0.0006701372,0.0008366526,0.005035884],"category_scores_gemma":[0.0012910923,0.00025418572,0.00022813246,0.0005658686,0.00037697374,0.0012304204,0.00046800228,0.0006480449,0.0014296835],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070491276,0.00017213041,0.0009012322,0.00025638728,0.00006230828,0.00033686752,0.00010822606,0.122576445,0.14699878,0.02519502,0.010917481,0.69177026],"study_design_scores_gemma":[0.000022749566,0.00013888488,0.00080111285,0.000015086401,0.00002761035,0.00019922742,0.00005977028,0.9104152,0.06438298,0.016643314,0.007272562,0.000021436008],"about_ca_topic_score_codex":0.0011210201,"about_ca_topic_score_gemma":0.0019644755,"teacher_disagreement_score":0.005035884,"about_ca_system_score_codex":0.0002950381,"about_ca_system_score_gemma":0.00019684521,"threshold_uncertainty_score":0.016846716},"labels":[],"label_agreement":null},{"id":"W4403139332","doi":"10.1007/978-3-031-73647-6_2","title":"Simplifying Prostate Elastography Using Micro-ultrasound and Transfer Function Imaging","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Elastography; Ultrasound elastography; Ultrasound; Ultrasound imaging; Computer vision; Radiology; Artificial intelligence; Medical physics; Medicine","score_opus":0.014787630831681376,"score_gpt":0.25596486259215423,"score_spread":0.24117723176047284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403139332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038126234,0.00047743766,0.99093115,0.00011368362,0.000061264116,0.000023684246,0.000055964803,0.00088907033,0.003635048],"genre_scores_gemma":[0.08998653,0.0017200427,0.88800806,0.00017345708,0.00018660464,0.00006292902,0.00030489123,0.0009391589,0.018618397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997477,0.00004389663,0.000012762581,0.000040230905,0.00013292955,0.000022509115],"domain_scores_gemma":[0.9994399,0.0002992259,0.00003276691,0.00014166575,0.00007220579,0.000014234838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030280187,0.0008827863,0.0006840315,0.000619898,0.00023034107,0.0009389794,0.0007605347,0.00067587406,0.008878879],"category_scores_gemma":[0.0014418421,0.00062120246,0.0008089295,0.0005857339,0.00043039088,0.0013044024,0.0011406428,0.0010184563,0.004117748],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001289277,0.00006671054,0.0005605777,0.00035302984,0.0000707971,0.00040569736,0.00012034197,0.1609348,0.15622264,0.026954321,0.007268778,0.64691335],"study_design_scores_gemma":[0.000022641056,0.00015792511,0.001759226,0.000050757615,0.00009683349,0.0020665328,0.00006467255,0.8319484,0.08952337,0.032967336,0.04128302,0.000059292786],"about_ca_topic_score_codex":0.001012154,"about_ca_topic_score_gemma":0.0020158947,"teacher_disagreement_score":0.008878879,"about_ca_system_score_codex":0.00030308665,"about_ca_system_score_gemma":0.00040365444,"threshold_uncertainty_score":0.029702842},"labels":[],"label_agreement":null},{"id":"W4403139416","doi":"10.1007/978-3-031-73647-6_1","title":"Unsupervised Physics-Inspired Shear Wave Speed Estimation in Ultrasound Elastography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Elastography; Wave speed; Shear (geology); Artificial intelligence; Ultrasound; Acoustics; Physics; Geology","score_opus":0.014562208574864047,"score_gpt":0.2471687251027204,"score_spread":0.23260651652785636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403139416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006015613,0.00036182196,0.9925938,0.000083260646,0.000033644512,0.000012895001,0.000041299834,0.00034209702,0.0005154463],"genre_scores_gemma":[0.22268684,0.0016225916,0.76461697,0.00013464259,0.00025157235,0.000092885,0.0005578343,0.0005109564,0.009525757],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976844,0.000059146474,0.000012161367,0.00006382585,0.00007771077,0.000018752475],"domain_scores_gemma":[0.99939954,0.00034999457,0.000063834195,0.00007554712,0.000085828775,0.000025301279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004850423,0.0005888579,0.00095658505,0.0006028728,0.00022710593,0.0008250118,0.001067973,0.0010232491,0.0014480809],"category_scores_gemma":[0.0018028377,0.00068596617,0.0007748957,0.00075649016,0.00057619286,0.0010366485,0.0010294375,0.0010268781,0.0009386333],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016823968,0.00010240147,0.00082045374,0.00023449164,0.00010841878,0.00007104164,0.00008161682,0.43162084,0.05703984,0.014083887,0.0040067923,0.49166194],"study_design_scores_gemma":[0.0000032008265,0.00001587627,0.00031473613,0.000006401247,0.000006910852,0.000048608083,0.00000439363,0.98828566,0.004249503,0.0060715596,0.0009852122,0.00000792404],"about_ca_topic_score_codex":0.00101975,"about_ca_topic_score_gemma":0.0018560984,"teacher_disagreement_score":0.0014480809,"about_ca_system_score_codex":0.00031668379,"about_ca_system_score_gemma":0.00047923945,"threshold_uncertainty_score":0.0048443675},"labels":[],"label_agreement":null},{"id":"W4403150254","doi":"10.1007/978-3-031-72111-3_25","title":"Enhancing New Multiple Sclerosis Lesion Segmentation via Self-supervised Pre-training and Synthetic Lesion Integration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Computer science; Lesion; Segmentation; Artificial intelligence; Multiple sclerosis; Pattern recognition (psychology); Computer vision; Medicine; Pathology","score_opus":0.06337716415477536,"score_gpt":0.26866620853334816,"score_spread":0.20528904437857282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403150254","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.1023168,0.0005757904,0.8905342,0.00019399736,0.000088221204,0.00009027877,0.0002740716,0.003623586,0.0023029805],"genre_scores_gemma":[0.5202994,0.00041916908,0.47119164,0.0002008803,0.00008168075,0.00009716781,0.0012805014,0.0007275101,0.005702037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997868,0.00003252934,0.000012869256,0.00006296502,0.00007362092,0.000031246906],"domain_scores_gemma":[0.99947053,0.00018601361,0.00005613583,0.00007957225,0.00017760922,0.000030121539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006368831,0.0008409078,0.0005427496,0.0008188328,0.00021052746,0.00088060665,0.00067457673,0.0009750331,0.001431096],"category_scores_gemma":[0.0011888563,0.00036878945,0.000740909,0.00060127035,0.00034122722,0.0005710394,0.0006838262,0.000594165,0.0009231476],"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.00048093553,0.00023822513,0.0026601877,0.00031789273,0.00016668426,0.0003545809,0.00022922606,0.18422179,0.23247708,0.0019815976,0.0050637135,0.57180804],"study_design_scores_gemma":[0.000008144066,0.000108723805,0.001705587,0.00001576955,0.000050393355,0.0004384002,0.000028166955,0.9322765,0.0617348,0.0012537799,0.002362957,0.000016679092],"about_ca_topic_score_codex":0.0018968767,"about_ca_topic_score_gemma":0.003392731,"teacher_disagreement_score":0.0018968767,"about_ca_system_score_codex":0.00032826271,"about_ca_system_score_gemma":0.00052748097,"threshold_uncertainty_score":0.0047875047},"labels":[],"label_agreement":null},{"id":"W4403150376","doi":"10.1007/978-3-031-72111-3_13","title":"CT-Based Brain Ventricle Segmentation via Diffusion Schrödinger Bridge without target domain ground truths","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Concordia University","funders":"","keywords":"Computer science; Segmentation; Bridge (graph theory); Diffusion; Domain (mathematical analysis); Ground truth; Artificial intelligence; Diffusion MRI; Computer vision; Algorithm; Physics; Anatomy; Mathematics; Medicine; Mathematical analysis; Radiology; Magnetic resonance imaging; Quantum mechanics","score_opus":0.013519843877144808,"score_gpt":0.27549865087030145,"score_spread":0.2619788069931566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403150376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018081184,0.00030540704,0.97570974,0.00019312747,0.00004737539,0.000044556447,0.0002516598,0.0009198023,0.0044471542],"genre_scores_gemma":[0.2283527,0.00065140706,0.7593396,0.00016667966,0.000059072594,0.000110964,0.0009922878,0.0009502484,0.0093770465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998815,0.00001952032,0.000010285633,0.000029339686,0.00004980298,0.000009537617],"domain_scores_gemma":[0.99972016,0.0001211624,0.000029296789,0.00005667568,0.000055339824,0.000017354776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036031325,0.0005683253,0.00063726807,0.0006586805,0.00024481077,0.0012728772,0.0007844379,0.0014858574,0.004674032],"category_scores_gemma":[0.001277848,0.00045071694,0.0007267268,0.0006296965,0.00037905702,0.0012912836,0.0009744058,0.00087959954,0.002037822],"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.00062563154,0.00011582481,0.0011688335,0.00079597265,0.0002113242,0.0012043266,0.00034279653,0.16640657,0.37018004,0.057788227,0.009646248,0.39151418],"study_design_scores_gemma":[0.00003199732,0.0000859713,0.0008308866,0.000053966058,0.00005230011,0.0012234325,0.000051532108,0.8925104,0.07903234,0.020562343,0.0055198562,0.00004498785],"about_ca_topic_score_codex":0.00080836314,"about_ca_topic_score_gemma":0.0012291571,"teacher_disagreement_score":0.004674032,"about_ca_system_score_codex":0.0002696223,"about_ca_system_score_gemma":0.0005970138,"threshold_uncertainty_score":0.015636146},"labels":[],"label_agreement":null},{"id":"W4403150381","doi":"10.1007/978-3-031-72111-3_6","title":"Class and Region-Adaptive Constraints for Network Calibration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Class (philosophy); Calibration; Artificial intelligence; Real-time computing; Mathematics; Statistics","score_opus":0.021275321304055086,"score_gpt":0.22840229397426504,"score_spread":0.20712697267020996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403150381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064682186,0.00037021562,0.99197245,0.00010040118,0.00005955896,0.00001253158,0.000077848024,0.00009542333,0.0066647143],"genre_scores_gemma":[0.1597078,0.003941427,0.7817554,0.00047450524,0.0006817365,0.00030810037,0.00078692206,0.0007311541,0.051612955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992933,0.00021825153,0.00002207799,0.00016784015,0.0002578616,0.000040666113],"domain_scores_gemma":[0.9987286,0.000643453,0.00011851464,0.0002490501,0.00021945858,0.000041036226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784625,0.0010222651,0.0008368495,0.00067342503,0.0003631065,0.0013141694,0.0016094913,0.0012496213,0.009513315],"category_scores_gemma":[0.004572601,0.0005515855,0.0005676099,0.0014686798,0.0010969213,0.0022890368,0.0020124824,0.0030973726,0.002387341],"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.00009257485,0.00003398228,0.0001594241,0.00019657865,0.000038466304,0.00005988944,0.0000808713,0.18919452,0.008045222,0.52105606,0.019132892,0.26190948],"study_design_scores_gemma":[0.000013765365,0.00003709563,0.0002304622,0.000052114145,0.000014013282,0.00015012044,0.000030279805,0.67546546,0.0040614554,0.2856607,0.03425145,0.00003311496],"about_ca_topic_score_codex":0.0016131089,"about_ca_topic_score_gemma":0.0018403927,"teacher_disagreement_score":0.009513315,"about_ca_system_score_codex":0.0008007865,"about_ca_system_score_gemma":0.00052680087,"threshold_uncertainty_score":0.031825244},"labels":[],"label_agreement":null},{"id":"W4403152097","doi":"10.1007/978-3-031-72111-3_61","title":"Simulation-Based Segmentation of Blood Vessels in Cerebral 3D OCTA Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Western Hospital","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Computer vision; Image segmentation; Computer graphics (images); Pattern recognition (psychology)","score_opus":0.015244089347269087,"score_gpt":0.2876389065978036,"score_spread":0.27239481725053455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403152097","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.086889945,0.0007582265,0.9014152,0.00024458734,0.00007544926,0.0001295069,0.00045647196,0.003501957,0.006528637],"genre_scores_gemma":[0.5344339,0.0014628762,0.45364696,0.000118153475,0.000050639675,0.00013875305,0.0009807937,0.00092825823,0.0082397545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998864,0.000021742295,0.0000074159925,0.000019971347,0.00004951486,0.000015075249],"domain_scores_gemma":[0.9997526,0.00013232902,0.00002300729,0.000028249673,0.00004785405,0.000015984751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027953964,0.000599389,0.000514829,0.00073222944,0.00027958574,0.0012401444,0.00071571826,0.0009825077,0.0032254036],"category_scores_gemma":[0.00075269834,0.00058578135,0.00080566696,0.000675284,0.0003134589,0.0003504152,0.00043100468,0.00042014907,0.0007436373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037172996,0.00007368881,0.0021336244,0.00021176819,0.00010788153,0.00045773957,0.00020021814,0.8226818,0.06194374,0.004943592,0.003564286,0.103309914],"study_design_scores_gemma":[0.000011391936,0.000029492465,0.0005971234,0.000017429105,0.000021604534,0.00023145026,0.000017496403,0.9808096,0.014998137,0.0012959552,0.001955957,0.000014223416],"about_ca_topic_score_codex":0.0089174,"about_ca_topic_score_gemma":0.009008596,"teacher_disagreement_score":0.0089174,"about_ca_system_score_codex":0.0007125818,"about_ca_system_score_gemma":0.0011130049,"threshold_uncertainty_score":0.017730951},"labels":[],"label_agreement":null},{"id":"W4403152519","doi":"10.1007/978-3-031-72111-3_50","title":"Prompting Segment Anything Model with Domain-Adaptive Prototype for Generalizable Medical Image Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Computer vision; Domain (mathematical analysis); Segmentation; Artificial intelligence; Image segmentation; Image (mathematics); Computer graphics (images)","score_opus":0.021140401815408966,"score_gpt":0.2802780704294546,"score_spread":0.25913766861404564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403152519","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.017552283,0.0001764766,0.97261333,0.00018589743,0.00007991697,0.000086859734,0.0001544615,0.0077152424,0.0014355558],"genre_scores_gemma":[0.38647556,0.0002943803,0.6046725,0.0004028188,0.00007071798,0.00017313889,0.001112265,0.0013431085,0.0054555777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997161,0.000041285028,0.0000130938,0.00012530807,0.000065835455,0.000038414924],"domain_scores_gemma":[0.9996151,0.00012245528,0.00002131565,0.000102974795,0.000108908585,0.00002917113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061863055,0.0007375256,0.0007077526,0.00046632282,0.0002948579,0.000956606,0.0015652119,0.0015169032,0.0071681687],"category_scores_gemma":[0.0015141835,0.00043203615,0.00083193474,0.00044312153,0.0004864819,0.0011337067,0.0012374718,0.0011460449,0.0019456067],"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.0010127779,0.00023744056,0.0012305521,0.000317554,0.00009042359,0.00057404506,0.00035820773,0.13538256,0.20941228,0.009022668,0.016924486,0.62543696],"study_design_scores_gemma":[0.000016929078,0.000049736267,0.0002154856,0.000010548509,0.000016622364,0.00012469663,0.000036073543,0.9698316,0.02270139,0.003868678,0.0031165846,0.0000116630135],"about_ca_topic_score_codex":0.0042357487,"about_ca_topic_score_gemma":0.0045905528,"teacher_disagreement_score":0.0071681687,"about_ca_system_score_codex":0.0005827895,"about_ca_system_score_gemma":0.00064835226,"threshold_uncertainty_score":0.023979902},"labels":[],"label_agreement":null},{"id":"W4403204441","doi":"10.1007/978-3-031-72744-3_21","title":"How to Segment in 3D Using 2D Models: Automated 3D Segmentation of Prostate Cancer Metastatic Lesions on PET Volumes Using Multi-angle Maximum Intensity Projections and Diffusion Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Prostate cancer; Segmentation; Computer science; Intensity (physics); Diffusion; Image segmentation; Artificial intelligence; Cancer; Medicine; Optics; Physics; Internal medicine","score_opus":0.07432931767318937,"score_gpt":0.3444978140958455,"score_spread":0.27016849642265617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403204441","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.0021611047,0.0024144575,0.9828569,0.00068564975,0.00019375232,0.00008706964,0.00067705667,0.0068754936,0.0040485063],"genre_scores_gemma":[0.010960985,0.0034837793,0.97454596,0.0002614776,0.00008007837,0.00009151065,0.0010595814,0.00260848,0.006908074],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996737,0.00003544331,0.000026418704,0.000078383375,0.00015804383,0.000028013112],"domain_scores_gemma":[0.9994837,0.00023456402,0.000040809966,0.00008750302,0.00012028246,0.00003295431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066704804,0.0015035212,0.001121591,0.0015242355,0.0004976082,0.0035413138,0.0015622579,0.002410786,0.011961064],"category_scores_gemma":[0.0015580991,0.0018101378,0.0020289912,0.0016994204,0.0005589225,0.0024371974,0.00096984114,0.0015384884,0.012908832],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008098009,0.000056400524,0.00049160514,0.00070008443,0.00011644108,0.0002326443,0.00018858121,0.037436202,0.035259847,0.00873152,0.055961803,0.86074394],"study_design_scores_gemma":[0.00004504615,0.00012787849,0.0021834986,0.00034611594,0.00018930189,0.003636564,0.00022457184,0.6506168,0.076632954,0.058116123,0.20763007,0.00025111478],"about_ca_topic_score_codex":0.0041028387,"about_ca_topic_score_gemma":0.0072869216,"teacher_disagreement_score":0.011961064,"about_ca_system_score_codex":0.000545515,"about_ca_system_score_gemma":0.0008886805,"threshold_uncertainty_score":0.04001379},"labels":[],"label_agreement":null},{"id":"W4403204511","doi":"10.1007/978-3-031-72744-3_6","title":"Unpaired Modality Translation for Pseudo Labeling of Histology Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Translation (biology); Modality (human–computer interaction); Artificial intelligence; Natural language processing; Computer vision","score_opus":0.028538653747653374,"score_gpt":0.2719103739428772,"score_spread":0.24337172019522382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403204511","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.005118872,0.00027952797,0.98798895,0.00010215249,0.00019695536,0.000043974975,0.00029526965,0.0016090542,0.004365243],"genre_scores_gemma":[0.070512526,0.0006169436,0.90988874,0.00014305263,0.00018829826,0.00014335514,0.0016874063,0.0011219461,0.01569772],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995888,0.00008044415,0.000024924524,0.00012672838,0.00013654641,0.000042624022],"domain_scores_gemma":[0.99929845,0.00019831727,0.000045556328,0.00024407917,0.00018242997,0.000031300522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862839,0.00074190885,0.0005193962,0.00096497685,0.0005330518,0.0016044092,0.001003764,0.0011043698,0.01893536],"category_scores_gemma":[0.0019061257,0.00042511514,0.00083340384,0.0011424974,0.0006117153,0.0013379111,0.0012495641,0.0012840286,0.009068466],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043849938,0.000074718795,0.00035368674,0.0004378043,0.000044186883,0.0002760532,0.00019166085,0.01236697,0.10517944,0.04342715,0.013827885,0.82338196],"study_design_scores_gemma":[0.00005289769,0.0004484574,0.0016378128,0.00015100799,0.00010377281,0.0024331787,0.00022503,0.5882903,0.23683745,0.08824412,0.08148474,0.00009131136],"about_ca_topic_score_codex":0.0006888148,"about_ca_topic_score_gemma":0.0015038527,"teacher_disagreement_score":0.01893536,"about_ca_system_score_codex":0.00035798244,"about_ca_system_score_gemma":0.0007502661,"threshold_uncertainty_score":0.063345075},"labels":[],"label_agreement":null},{"id":"W4403228757","doi":"10.1007/978-3-031-73376-5_14","title":"UltraWeak: Enhancing Breast Ultrasound Cancer Detection with Deformable DETR and Weak Supervision","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Breast cancer; Ultrasound; Computer vision; Artificial intelligence; Cancer; Radiology; Medicine; Internal medicine","score_opus":0.006969525455863386,"score_gpt":0.2194938775062529,"score_spread":0.21252435205038953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403228757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028992146,0.0013100336,0.96163195,0.00044708967,0.00019168793,0.00012229454,0.00042218307,0.0038105033,0.003072096],"genre_scores_gemma":[0.21728998,0.001112972,0.7616331,0.000459949,0.00024660202,0.00011624442,0.0014811384,0.0008764181,0.016783578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996654,0.000055092518,0.000015568588,0.000074117765,0.00015222211,0.00003765901],"domain_scores_gemma":[0.9996191,0.00013522043,0.000028908758,0.00009272884,0.000080661695,0.00004323381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000932309,0.0008237557,0.0006096849,0.000678537,0.00022662985,0.00079230237,0.001073202,0.00090225146,0.003548737],"category_scores_gemma":[0.0015262491,0.00053374725,0.0005772408,0.00045860506,0.00043687713,0.0008512865,0.001906074,0.0008206923,0.0017226607],"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.0003730259,0.00012071646,0.0013792347,0.00018355068,0.00008660445,0.00014251722,0.00007804185,0.022708807,0.07787957,0.002997067,0.010665567,0.8833853],"study_design_scores_gemma":[0.000023560235,0.00021291123,0.0034866426,0.000035204288,0.00006942963,0.0005744307,0.000039808532,0.9213736,0.055047415,0.006344228,0.01275457,0.00003832773],"about_ca_topic_score_codex":0.001771742,"about_ca_topic_score_gemma":0.0035759453,"teacher_disagreement_score":0.003548737,"about_ca_system_score_codex":0.0001986371,"about_ca_system_score_gemma":0.00038489557,"threshold_uncertainty_score":0.0118716955},"labels":[],"label_agreement":null},{"id":"W4403228877","doi":"10.1007/978-3-031-73376-5_6","title":"Performance Evaluation of Deep Learning and Transformer Models Using Multimodal Data for Breast Cancer Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Instituto Tecnológico y de Estudios Superiores de Monterrey","keywords":"Computer science; Transformer; Artificial intelligence; Deep learning; Machine learning; Breast cancer; Cancer; Electrical engineering; Medicine","score_opus":0.08320250091894528,"score_gpt":0.3309169773386779,"score_spread":0.24771447641973265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403228877","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.84407735,0.013545176,0.114632525,0.0020415394,0.0010595499,0.00021172798,0.0056910696,0.00851836,0.010222695],"genre_scores_gemma":[0.9485151,0.0015710156,0.033528667,0.00024175417,0.0001233339,0.00007855205,0.008726733,0.00021212836,0.0070026503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999049,0.00032589876,0.000071236514,0.00020566511,0.00018902485,0.00015922787],"domain_scores_gemma":[0.9972339,0.0015972197,0.00008640402,0.00020751712,0.00072459405,0.00015038178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032196748,0.0018018065,0.0011124526,0.0011415733,0.0004345002,0.0009809022,0.001501504,0.0016640852,0.0031770954],"category_scores_gemma":[0.005281835,0.00035256732,0.00092898344,0.001074119,0.00035188667,0.0013374182,0.0013247196,0.0012165785,0.0017274792],"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.00529429,0.0009780981,0.013536166,0.0005587484,0.0007768217,0.00022953656,0.000117014075,0.27698964,0.008852656,0.00096251915,0.020631485,0.67107296],"study_design_scores_gemma":[0.000048603004,0.00030343613,0.0016214241,0.00002330557,0.00009906714,0.0000632026,0.000071450304,0.9919403,0.0046406225,0.00055373827,0.0006191177,0.000015802518],"about_ca_topic_score_codex":0.02425859,"about_ca_topic_score_gemma":0.020628838,"teacher_disagreement_score":0.02425859,"about_ca_system_score_codex":0.0011272256,"about_ca_system_score_gemma":0.0012843211,"threshold_uncertainty_score":0.04823476},"labels":[],"label_agreement":null},{"id":"W4403228960","doi":"10.1007/978-3-031-73709-1_25","title":"Preventing Out-of-Gas Exceptions by Typing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Typing; Programming language; Speech recognition","score_opus":0.02754851199876612,"score_gpt":0.2765610006695691,"score_spread":0.249012488670803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403228960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062268835,0.00085160567,0.8580784,0.0008879069,0.0018418627,0.00017517654,0.00028373743,0.029309742,0.04630277],"genre_scores_gemma":[0.67384905,0.00097267726,0.22004661,0.0012943693,0.00061375654,0.00014238768,0.00054366403,0.011728655,0.090808816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945603,0.0010803413,0.00055524695,0.0007926735,0.002092294,0.00091919425],"domain_scores_gemma":[0.97873116,0.0064045377,0.0011415727,0.011077562,0.0021608027,0.00048433882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031240243,0.0012575609,0.0015013624,0.0011692401,0.0013072193,0.004241257,0.0037346485,0.0021963927,0.010687181],"category_scores_gemma":[0.017886031,0.0012804429,0.0009831936,0.0010533651,0.0018746975,0.0068743494,0.0069573023,0.00420669,0.0064403014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014011931,0.0004748208,0.008603271,0.0010835038,0.00013283188,0.0017906089,0.003588286,0.017513879,0.036226988,0.27341706,0.046282813,0.60948473],"study_design_scores_gemma":[0.00012516833,0.00037232047,0.001590428,0.00078255165,0.00041416942,0.0027661584,0.0009230993,0.17565578,0.17937356,0.4056145,0.23209986,0.00028235582],"about_ca_topic_score_codex":0.0007244394,"about_ca_topic_score_gemma":0.00090834167,"teacher_disagreement_score":0.010687181,"about_ca_system_score_codex":0.0006052009,"about_ca_system_score_gemma":0.0014665847,"threshold_uncertainty_score":0.035752177},"labels":[],"label_agreement":null},{"id":"W4403232958","doi":"10.1007/978-3-031-74186-9_17","title":"Enhancing RAG-Retrieval to Improve LLMs Robustness and Resilience to Hallucinations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Robustness (evolution); Resilience (materials science); Computer security; Artificial intelligence","score_opus":0.038327581259980245,"score_gpt":0.33085321318392724,"score_spread":0.292525631923947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403232958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17123942,0.002779187,0.80404526,0.00062999426,0.00069847924,0.00019151467,0.00037747438,0.00852703,0.011511677],"genre_scores_gemma":[0.72232383,0.0009157455,0.25876722,0.0006636366,0.00059814675,0.00008028165,0.00082858745,0.00077395164,0.01504871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.0000581339,0.00002536119,0.00005756966,0.00012314742,0.00007023886],"domain_scores_gemma":[0.998497,0.0005445806,0.00010101512,0.00034110702,0.0004283648,0.000087899316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059758476,0.0009269702,0.000775775,0.00077003555,0.0005210052,0.0011797622,0.0010241478,0.0014127399,0.0094867125],"category_scores_gemma":[0.004726877,0.00021453091,0.00053688424,0.0005948373,0.0005236579,0.001714502,0.0012646749,0.00080051366,0.0034773434],"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.0014253556,0.00027830774,0.001126975,0.0003288711,0.00013510525,0.0004059074,0.00014739428,0.05810112,0.34855995,0.0033304186,0.006049572,0.580111],"study_design_scores_gemma":[0.0001237623,0.0005326833,0.0025479232,0.00004985341,0.00019882838,0.0008415211,0.00014704581,0.7624936,0.22012742,0.0052480907,0.0076207616,0.0000685336],"about_ca_topic_score_codex":0.001264658,"about_ca_topic_score_gemma":0.0019107751,"teacher_disagreement_score":0.0094867125,"about_ca_system_score_codex":0.0003382544,"about_ca_system_score_gemma":0.0004909582,"threshold_uncertainty_score":0.031736195},"labels":[],"label_agreement":null},{"id":"W4403241495","doi":"10.1007/978-3-032-06754-8_10","title":"The Role of Piracy in Quantum Proofs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of Ottawa; U.S. Department of Energy; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematical proof; Quantum; Theoretical physics; Mathematics; Quantum mechanics; Physics; Geometry","score_opus":0.008345677766497773,"score_gpt":0.2343428065097155,"score_spread":0.22599712874321773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403241495","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02273342,0.021547822,0.26045313,0.02806098,0.0041099237,0.00012496884,0.00024423428,0.00054650503,0.66217905],"genre_scores_gemma":[0.8253587,0.011827886,0.05354146,0.00428668,0.0067582005,0.0002778419,0.00012931993,0.00052060647,0.09729929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993425,0.003373762,0.00024314957,0.0006160958,0.0017692511,0.0005726964],"domain_scores_gemma":[0.97362196,0.01965385,0.0008039308,0.004385071,0.0010533031,0.00048179505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005662488,0.0009038097,0.0017986277,0.0020371093,0.0044613983,0.007744012,0.0028690011,0.0061123674,0.015310602],"category_scores_gemma":[0.029363632,0.0013880824,0.0011640138,0.0023740896,0.023825029,0.026874568,0.0052481266,0.009317074,0.0030131268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072630464,0.0000048956,0.000011227619,0.000025735471,0.0000016038274,0.000012916357,0.000074007585,0.00020777014,0.00004410614,0.9958688,0.0012463913,0.0024953478],"study_design_scores_gemma":[0.0000044354865,0.0000037112115,0.0000074331656,0.000016055776,0.0000014991576,0.000024628847,0.000012171588,0.00070497993,0.00006342115,0.9952603,0.0038967715,0.000004636777],"about_ca_topic_score_codex":0.000648107,"about_ca_topic_score_gemma":0.00039938325,"teacher_disagreement_score":0.015310602,"about_ca_system_score_codex":0.0030181748,"about_ca_system_score_gemma":0.0014603169,"threshold_uncertainty_score":0.051219106},"labels":[],"label_agreement":null},{"id":"W4403317805","doi":"10.1007/978-3-031-74234-7_11","title":"The Complexity of Data-Free Nfer","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Queen's University","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.057302141622705166,"score_gpt":0.28140351492068055,"score_spread":0.2241013732979754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403317805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18103398,0.0031457348,0.6418429,0.010448261,0.00047553523,0.00030023654,0.0039643566,0.0038857812,0.15490326],"genre_scores_gemma":[0.80154073,0.0019486365,0.14180067,0.0015169181,0.0005487423,0.0004418512,0.0032358742,0.0016195218,0.04734705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927301,0.0013004234,0.00051274436,0.0011877642,0.003088407,0.0011805334],"domain_scores_gemma":[0.96733487,0.024565032,0.0011116919,0.0052543394,0.0012742341,0.00045985414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035821213,0.0010883259,0.0018636155,0.001628152,0.0027178635,0.007864773,0.0048876964,0.0025241624,0.024753314],"category_scores_gemma":[0.025853347,0.0015265784,0.002753894,0.0036818325,0.005030943,0.026049783,0.0066239215,0.005475389,0.0028955995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002872341,0.00009347127,0.0012393169,0.0004258625,0.00006265814,0.0002035154,0.00054302876,0.039266344,0.0013311344,0.8803538,0.012131369,0.06406229],"study_design_scores_gemma":[0.00002611618,0.00000963505,0.00015167498,0.000026970598,0.000028240318,0.00011553777,0.00006500053,0.034203123,0.0008195505,0.9595636,0.004968716,0.000021847914],"about_ca_topic_score_codex":0.0060090646,"about_ca_topic_score_gemma":0.005934132,"teacher_disagreement_score":0.024753314,"about_ca_system_score_codex":0.0049301772,"about_ca_system_score_gemma":0.0028313894,"threshold_uncertainty_score":0.08280802},"labels":[],"label_agreement":null},{"id":"W4403351809","doi":"10.1007/978-3-031-72787-0_13","title":"Cycle-GANs Generated Difference Maps to Interpret Race Prediction from Medical Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Race (biology); Artificial intelligence; Pattern recognition (psychology); Computer vision; Geology","score_opus":0.009194023668238571,"score_gpt":0.23954633746550333,"score_spread":0.23035231379726476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403351809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06704383,0.0007026739,0.91564333,0.00057545997,0.00045506007,0.0002359468,0.0026106073,0.0079256715,0.004807325],"genre_scores_gemma":[0.628931,0.0005223494,0.3550109,0.00060916634,0.00024324814,0.00023341646,0.005795757,0.0012818001,0.0073723686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998691,0.000017281598,0.0000049300343,0.00004938413,0.000031972726,0.000027436383],"domain_scores_gemma":[0.9996828,0.00011694174,0.00001828502,0.000051100193,0.00010857538,0.000022400369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004076345,0.0006120798,0.00057879026,0.0011508327,0.00017693128,0.0006178039,0.0010213626,0.0007943306,0.0033121898],"category_scores_gemma":[0.0013248042,0.000329347,0.0007385563,0.0007901369,0.00029977894,0.0004733584,0.0005866421,0.0011481139,0.0012438998],"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.00085235416,0.00028586277,0.004660651,0.00021869462,0.00014714169,0.0002571026,0.00012216893,0.24203838,0.04081672,0.007080599,0.03322478,0.6702956],"study_design_scores_gemma":[0.000011057504,0.000030581305,0.0007236551,0.000012264089,0.000012615415,0.00007927468,0.000012329221,0.9885466,0.004588511,0.0042774477,0.0016965336,0.000009045938],"about_ca_topic_score_codex":0.0059477305,"about_ca_topic_score_gemma":0.011714322,"teacher_disagreement_score":0.0059477305,"about_ca_system_score_codex":0.00046673638,"about_ca_system_score_gemma":0.0007290763,"threshold_uncertainty_score":0.011826217},"labels":[],"label_agreement":null},{"id":"W4403351859","doi":"10.1007/978-3-031-72787-0_16","title":"Assessing the Impact of Sociotechnical Harms in AI-Based Medical Image Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Sociotechnical system; Computer science; Artificial intelligence; Data science; Software engineering","score_opus":0.09471095769033198,"score_gpt":0.4776881503970561,"score_spread":0.3829771927067241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403351859","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.8639815,0.0019443483,0.09914177,0.0032154205,0.00021692045,0.00044961754,0.00041664398,0.00039227988,0.030241499],"genre_scores_gemma":[0.9606831,0.00028755053,0.03621785,0.0001475618,0.00004570061,0.000080504644,0.00022300916,0.00003538134,0.002279356],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99081004,0.0043558623,0.00032119753,0.0004483954,0.0038064665,0.00025815523],"domain_scores_gemma":[0.8769045,0.10877124,0.004672483,0.0030934885,0.005597395,0.0009608081],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008396727,0.0006399387,0.00043709372,0.0022734595,0.0009098835,0.00292515,0.0010396458,0.0016943314,0.0032992754],"category_scores_gemma":[0.06468804,0.00025062845,0.0006188104,0.0013638779,0.0021499628,0.002452887,0.0022597064,0.0013981475,0.00045180047],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025186157,0.0027417606,0.13676828,0.001157031,0.0006423608,0.0007004913,0.0026732017,0.2762749,0.019404298,0.042244576,0.004848422,0.5100261],"study_design_scores_gemma":[0.000074017946,0.0019672094,0.09253793,0.0002624044,0.00034582656,0.0006345365,0.0036017299,0.80365664,0.016344827,0.07560558,0.004845373,0.00012400238],"about_ca_topic_score_codex":0.0047913296,"about_ca_topic_score_gemma":0.0056939274,"teacher_disagreement_score":0.99909014,"about_ca_system_score_codex":0.0019257125,"about_ca_system_score_gemma":0.0015224933,"threshold_uncertainty_score":0.044406712},"labels":[],"label_agreement":null},{"id":"W4403352027","doi":"10.1007/978-3-031-72787-0_12","title":"Do Sites Benefit Equally from Distributed Learning in Medical Image Analysis?","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Institut Universitaire de Gériatrie de Montréal; Hotchkiss Brain Institute; Alberta Children's Hospital; Women and Children’s Health Research Institute; Université de Montréal; University of Alberta; University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Image (mathematics); Computer vision","score_opus":0.010602241721144256,"score_gpt":0.2892868563020302,"score_spread":0.27868461458088595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403352027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3243512,0.017800322,0.44445783,0.06740804,0.002264684,0.00021195957,0.00092522276,0.0035523232,0.13902846],"genre_scores_gemma":[0.90741706,0.004201128,0.06134397,0.003498719,0.0015564015,0.00008536685,0.00046913096,0.0006897334,0.020738441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984511,0.0005836888,0.00005468994,0.0003018283,0.0003378241,0.00027090567],"domain_scores_gemma":[0.9847453,0.008460867,0.00075442967,0.0028617026,0.0021776871,0.0009999961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036504327,0.0005662445,0.00093235256,0.00064026116,0.0006357524,0.0031897482,0.0015888852,0.002570006,0.015782554],"category_scores_gemma":[0.019339027,0.00035414286,0.0005257294,0.0014823024,0.0015602197,0.012770754,0.0018077837,0.0011384642,0.0073664496],"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.001123599,0.00033651182,0.013614479,0.00021071732,0.000107381,0.0001599722,0.00023973116,0.009612527,0.004846801,0.045521367,0.027379088,0.89684784],"study_design_scores_gemma":[0.00048067543,0.00051797304,0.024997784,0.00019665156,0.0003827987,0.0014036621,0.0018884898,0.1548921,0.009139115,0.7488095,0.057222866,0.00006835409],"about_ca_topic_score_codex":0.0010728197,"about_ca_topic_score_gemma":0.0017489301,"teacher_disagreement_score":0.015782554,"about_ca_system_score_codex":0.00068030466,"about_ca_system_score_gemma":0.0008335309,"threshold_uncertainty_score":0.052797914},"labels":[],"label_agreement":null},{"id":"W4403352755","doi":"10.1007/978-3-031-72787-0_8","title":"Exploring Fairness in State-of-the-Art Pulmonary Nodule Detection Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Lung Cancer Diagnosis and Treatment","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; State (computer science); Algorithm","score_opus":0.034884349619771916,"score_gpt":0.2646272295123241,"score_spread":0.22974287989255218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403352755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06829728,0.012614426,0.89572614,0.0059389924,0.0010970442,0.00020151759,0.00037829636,0.0010232454,0.014722947],"genre_scores_gemma":[0.712207,0.002834371,0.27267262,0.0018571287,0.0019258455,0.0001934401,0.0004807282,0.00073941675,0.0070893625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9735318,0.015385883,0.0008621603,0.0034471452,0.004281989,0.002491024],"domain_scores_gemma":[0.8257648,0.15729193,0.002073929,0.0073953504,0.00575873,0.0017152645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.039753392,0.0018124982,0.0043230723,0.001455207,0.002479836,0.007381954,0.007363894,0.0041906466,0.0063430257],"category_scores_gemma":[0.11422467,0.0011492907,0.0017488617,0.0018564854,0.00472981,0.011683145,0.006526734,0.006694354,0.001083836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002730039,0.00054939167,0.008003492,0.0007080433,0.00030862226,0.00012895318,0.0009485578,0.35964337,0.0023480568,0.3276408,0.018801631,0.27818906],"study_design_scores_gemma":[0.000071948176,0.0001581192,0.0005065429,0.000082541635,0.000051610885,0.00006732985,0.000103324644,0.812116,0.000992632,0.1841616,0.0016638463,0.000024576091],"about_ca_topic_score_codex":0.0050242073,"about_ca_topic_score_gemma":0.003945146,"teacher_disagreement_score":0.039753392,"about_ca_system_score_codex":0.0050183944,"about_ca_system_score_gemma":0.007235733,"threshold_uncertainty_score":0.21023852},"labels":[],"label_agreement":null},{"id":"W4403365555","doi":"10.1007/978-3-031-72083-3_54","title":"Can Crowdsourced Annotations Improve AI-Based Congestion Scoring for Bedside Lung Ultrasound?","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound in Clinical Applications","field":"Medicine","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":"Computer science; Lung ultrasound; Artificial intelligence; Machine learning; Data science; Ultrasound; Radiology; Medicine","score_opus":0.023168161951920667,"score_gpt":0.3226865911463722,"score_spread":0.29951842919445154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403365555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09728139,0.0076090717,0.79622746,0.0040673325,0.0051521724,0.0008699616,0.009986276,0.03523881,0.043567512],"genre_scores_gemma":[0.62154156,0.0021868737,0.3358877,0.0017595214,0.0018102997,0.0006334555,0.011538921,0.0029251366,0.021716503],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99789006,0.0007016471,0.000090287,0.00054248876,0.0005935904,0.00018190064],"domain_scores_gemma":[0.99331677,0.003784295,0.00026795134,0.00073482585,0.0016124005,0.00028365097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002776731,0.0017566929,0.0012320757,0.0020240278,0.0008570489,0.00252563,0.002216686,0.0025031453,0.009390119],"category_scores_gemma":[0.020060124,0.0005704573,0.0007311347,0.0015167283,0.0005143929,0.0030449776,0.0025291534,0.0018447399,0.008969371],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020878124,0.0005825146,0.010826538,0.0012129883,0.00031990538,0.00032700875,0.00074397895,0.033686996,0.0252201,0.0026650662,0.09743511,0.824892],"study_design_scores_gemma":[0.00033424748,0.000593826,0.015267449,0.0005377584,0.00034098348,0.0004739404,0.0013824044,0.8620654,0.027227404,0.032658037,0.058801003,0.00031752736],"about_ca_topic_score_codex":0.0088406205,"about_ca_topic_score_gemma":0.017666668,"teacher_disagreement_score":0.009390119,"about_ca_system_score_codex":0.0005678794,"about_ca_system_score_gemma":0.00095357304,"threshold_uncertainty_score":0.03141308},"labels":[],"label_agreement":null},{"id":"W4403414379","doi":"10.1007/978-3-031-73903-3_5","title":"Simple Stochastic Stopping Games: A Generator and Benchmark Library","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Simple (philosophy); Generator (circuit theory); Benchmark (surveying); Mathematical optimization; Algorithm; Mathematics; Power (physics)","score_opus":0.037831767502799526,"score_gpt":0.3103496470461418,"score_spread":0.2725178795433423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403414379","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.116098925,0.0019482285,0.70294636,0.0017458445,0.00043389716,0.00090153713,0.00949859,0.0034227385,0.16300392],"genre_scores_gemma":[0.6107408,0.002145145,0.27156317,0.0006957335,0.00033752387,0.0014218914,0.011236015,0.0014505644,0.10040927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992912,0.00030885305,0.000048735375,0.00009019373,0.00020576401,0.000055316552],"domain_scores_gemma":[0.99644655,0.002431543,0.00015591465,0.0004586211,0.00035384815,0.00015344605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013486634,0.00084546406,0.0007935608,0.0013772051,0.0005057093,0.0016135974,0.0020261537,0.0012625572,0.016297134],"category_scores_gemma":[0.007540904,0.00039823927,0.00094357075,0.0023524505,0.00057635375,0.0013470221,0.000853645,0.0013567107,0.0030107554],"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.0005240956,0.0007276268,0.0008909081,0.000551596,0.00009426702,0.00022379484,0.00011349203,0.24757786,0.0022687933,0.5255199,0.069534644,0.15197296],"study_design_scores_gemma":[0.00023466605,0.00013121597,0.0004440194,0.000049563925,0.0000360258,0.00015991497,0.000027379267,0.5553238,0.001679156,0.42491278,0.016966773,0.00003484332],"about_ca_topic_score_codex":0.0016127342,"about_ca_topic_score_gemma":0.0020017666,"teacher_disagreement_score":0.016297134,"about_ca_system_score_codex":0.00090450497,"about_ca_system_score_gemma":0.0010994425,"threshold_uncertainty_score":0.054519355},"labels":[],"label_agreement":null},{"id":"W4403458627","doi":"10.1007/978-3-031-75540-8_18","title":"Smartphone-Based Fuel Identification Model for Wildfire Risk Assessment Using YOLOv8","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fire Detection and Safety Systems","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 Alberta","funders":"","keywords":"Computer science; Identification (biology)","score_opus":0.021258766809355414,"score_gpt":0.2577889068896057,"score_spread":0.2365301400802503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403458627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15635478,0.00092637015,0.82625806,0.00019584522,0.00022435313,0.00009600494,0.0012759987,0.0036908058,0.010977742],"genre_scores_gemma":[0.94265395,0.0003440608,0.04736319,0.000061824925,0.00003280577,0.00014801596,0.0011168076,0.00007180153,0.008207547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999502,0.000005935351,0.000003056918,0.000019248704,0.000013508699,0.0000081020235],"domain_scores_gemma":[0.99994123,0.000017319226,0.000004846213,0.000004736222,0.000027597922,0.000004177621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011206086,0.00042802704,0.00058625365,0.00024818536,0.0001996265,0.00034756146,0.00058242795,0.0003884512,0.0042478936],"category_scores_gemma":[0.0002898661,0.00013977835,0.0004201713,0.0001603922,0.000076901146,0.00034357305,0.00028971827,0.00036608195,0.0011162264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036546087,0.00012557412,0.005064106,0.00018864035,0.000081722304,0.00018904809,0.00007043069,0.761255,0.009892196,0.001922018,0.004559126,0.2162866],"study_design_scores_gemma":[0.000004091674,0.000023714276,0.0005279342,0.000004780154,0.000008852568,0.000020090798,0.0000066639473,0.99786216,0.0007335199,0.0002866497,0.0005167436,0.000004838651],"about_ca_topic_score_codex":0.012591385,"about_ca_topic_score_gemma":0.012489758,"teacher_disagreement_score":0.012591385,"about_ca_system_score_codex":0.00024534282,"about_ca_system_score_gemma":0.0003376506,"threshold_uncertainty_score":0.025036216},"labels":[],"label_agreement":null},{"id":"W4403499910","doi":"10.1007/978-3-031-72845-7","title":"Computational Color Imaging","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Universität Greifswald; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Universidade do Minho; National Taiwan University of Science and Technology; National Taiwan University; Chiba University; Chulalongkorn University; Universidad de Granada; Università degli Studi di Pavia; York University; Université de Bourgogne; Ministerio de Ciencia e Innovación; Università degli Studi di Milano; Conselleria d'Educació, Investigació, Cultura i Esport; University of East Anglia; University of Dayton","keywords":"Computer science; Artificial intelligence; Computer vision; Computer graphics (images)","score_opus":0.012221779047253698,"score_gpt":0.26662349372618477,"score_spread":0.2544017146789311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403499910","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051389053,0.015244716,0.72780097,0.0011134949,0.0013440627,0.00004481867,0.0007203779,0.0034659982,0.24512665],"genre_scores_gemma":[0.09330136,0.017045362,0.43720916,0.00054897537,0.00081852655,0.00009790828,0.002292686,0.001561378,0.44712463],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99992836,0.0000060524103,0.0000019660545,0.00002374888,0.000032765736,0.0000071817485],"domain_scores_gemma":[0.9998783,0.000024890214,0.0000053466024,0.00004094852,0.000037808688,0.0000126623545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011142219,0.000644922,0.00047284746,0.00079325837,0.00028832786,0.001018878,0.0006846935,0.00038255093,0.030019157],"category_scores_gemma":[0.0002830048,0.0003270142,0.0003675706,0.00097004854,0.0005019933,0.0009021178,0.0007737207,0.00093911943,0.011296034],"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.000041984782,0.000032748238,0.000148485,0.00023290614,0.000027233782,0.000055454642,0.000032566884,0.00964013,0.01986217,0.14801852,0.15236764,0.6695401],"study_design_scores_gemma":[0.000010747561,0.000056972756,0.0010626838,0.00011316897,0.000046747824,0.0010805628,0.000053190004,0.118554875,0.029722182,0.21808614,0.63117015,0.000042554235],"about_ca_topic_score_codex":0.0006754037,"about_ca_topic_score_gemma":0.0014292125,"teacher_disagreement_score":0.030019157,"about_ca_system_score_codex":0.00034418414,"about_ca_system_score_gemma":0.0002901794,"threshold_uncertainty_score":0.10042411},"labels":[],"label_agreement":null},{"id":"W4403552145","doi":"10.1007/978-3-031-74738-0_20","title":"Occupants Experiencing Energy Poverty: Where are They in Energy Datasets and Time Use Surveys?","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy and Environment Impacts","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Energy (signal processing); Energy poverty; Poverty; Statistics; Mathematics; Economic growth","score_opus":0.01397549231273463,"score_gpt":0.21859365362225308,"score_spread":0.20461816130951846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403552145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reporting","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"reporting","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8542458,0.028069835,0.00771243,0.04256358,0.00096714514,0.000048248494,0.022339331,0.00011323069,0.043940455],"genre_scores_gemma":[0.9516056,0.018029476,0.0043895817,0.0026457962,0.000542724,0.00009880694,0.011172272,0.000088558394,0.011427224],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99895644,0.00041528596,0.00006453647,0.00011516286,0.00022862999,0.00021986377],"domain_scores_gemma":[0.9967045,0.0016529894,0.00062353484,0.00016536303,0.00056075933,0.00029277953],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0022965895,0.00024115945,0.00043181877,0.0010504269,0.00056119036,0.0024656316,0.00064359023,0.000872582,0.0044953036],"category_scores_gemma":[0.008983747,0.00036818368,0.00038095145,0.0044269864,0.00052918633,0.0043076286,0.0014614982,0.0009774659,0.0015305869],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011517943,0.00007052538,0.7576827,0.00025144644,0.00010570366,0.00017466105,0.008485092,0.00045526098,0.00021468152,0.0072313095,0.044481073,0.18073235],"study_design_scores_gemma":[0.0000057781212,0.00006778505,0.8213625,0.001373955,0.00010379181,0.00054906606,0.07539902,0.0022868763,0.0005124441,0.01552995,0.08274385,0.00006502606],"about_ca_topic_score_codex":0.030985687,"about_ca_topic_score_gemma":0.071928896,"teacher_disagreement_score":0.9989496,"about_ca_system_score_codex":0.0005117362,"about_ca_system_score_gemma":0.0006971057,"threshold_uncertainty_score":0.06161064},"labels":[],"label_agreement":null},{"id":"W4403557064","doi":"10.1007/978-3-031-74498-3_2","title":"Invited Paper: A Survey of the Impact of Knowledge on the Competitive Ratio in Linear Search","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Computer science; Competitive analysis; Operations research; Information retrieval; Mathematics","score_opus":0.04304661691225021,"score_gpt":0.3129956036367817,"score_spread":0.2699489867245315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403557064","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016650261,0.72740984,0.037442256,0.020015052,0.002767046,0.00003750789,0.00085261464,0.00024285707,0.19458264],"genre_scores_gemma":[0.32645446,0.5863375,0.02720445,0.006971401,0.017911065,0.00009045888,0.0016136655,0.0005771758,0.032839846],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973328,0.00092029024,0.00011384335,0.00041467758,0.0010085396,0.00020977974],"domain_scores_gemma":[0.9645653,0.031332538,0.0006677621,0.00077532674,0.0021111593,0.0005479815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037967544,0.00087344804,0.00165392,0.0032539556,0.00065036764,0.005469534,0.0018906757,0.001989081,0.020348508],"category_scores_gemma":[0.026171291,0.00048393235,0.0005979417,0.011225915,0.0020936222,0.008930557,0.001273474,0.002380548,0.00512626],"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.00035053672,0.00019686416,0.0021666752,0.0028816017,0.00014662191,0.0001005925,0.00011217999,0.012731844,0.00045890125,0.26958367,0.08964027,0.62163025],"study_design_scores_gemma":[0.00011584331,0.00025758307,0.004185061,0.0014257446,0.00019586414,0.00066450017,0.00021870194,0.039359853,0.0019378886,0.6776442,0.2738776,0.00011710794],"about_ca_topic_score_codex":0.0024249118,"about_ca_topic_score_gemma":0.0017059662,"teacher_disagreement_score":0.020348508,"about_ca_system_score_codex":0.0026066564,"about_ca_system_score_gemma":0.0013052106,"threshold_uncertainty_score":0.06807256},"labels":[],"label_agreement":null},{"id":"W4403562099","doi":"10.1007/978-3-031-72627-9_26","title":"HeadGaS: Real-Time Animatable Head Avatars via 3D Gaussian Splatting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Gaussian; Head (geology); Artificial intelligence","score_opus":0.01531746866072269,"score_gpt":0.2538038716100356,"score_spread":0.2384864029493129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403562099","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.027876506,0.0002745454,0.9415727,0.00015718854,0.00023557022,0.00014450082,0.00035072138,0.009389403,0.019998789],"genre_scores_gemma":[0.38537496,0.0006856429,0.54711163,0.0002855259,0.000104272425,0.00033831227,0.00083646853,0.0036351485,0.06162795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999851,0.000025330577,0.0000039050956,0.000027337082,0.00007108236,0.000021341471],"domain_scores_gemma":[0.99984,0.0000655676,0.000011072311,0.000028625955,0.000026126094,0.00002852379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030052438,0.0008613819,0.00039288113,0.000246001,0.00018066597,0.0005673679,0.0009141084,0.0006788242,0.030958422],"category_scores_gemma":[0.00064554065,0.00041686944,0.00041871626,0.00015140488,0.00034794636,0.0006624392,0.0017315381,0.0007098185,0.006446407],"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.000964707,0.000213473,0.0005072327,0.00041422938,0.000073391835,0.0007769965,0.00072547694,0.03883956,0.4494493,0.017504893,0.033451967,0.45707884],"study_design_scores_gemma":[0.00020876704,0.0009391029,0.0015882092,0.00016246983,0.000080402475,0.0026648992,0.00038906603,0.566605,0.25356367,0.016573207,0.1570512,0.00017395611],"about_ca_topic_score_codex":0.00031679703,"about_ca_topic_score_gemma":0.0005685182,"teacher_disagreement_score":0.030958422,"about_ca_system_score_codex":0.0001506112,"about_ca_system_score_gemma":0.00013391109,"threshold_uncertainty_score":0.10356623},"labels":[],"label_agreement":null},{"id":"W4403619348","doi":"10.1007/978-3-031-72390-2_21","title":"MEDBind: Unifying Language and Multimodal Medical Data Embeddings","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Toronto General Hospital; University of Toronto; Vector Institute; Ted Rogers Centre for Heart Research; University Health Network","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Programming language","score_opus":0.023597722666881475,"score_gpt":0.32557275581992834,"score_spread":0.30197503315304686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619348","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.010612386,0.0010455251,0.8988048,0.0005874983,0.0007251886,0.00022112668,0.010202211,0.072708465,0.0050928667],"genre_scores_gemma":[0.13498215,0.0011250513,0.7879088,0.00090723933,0.000376063,0.00061286154,0.04573075,0.009183841,0.019173302],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985794,0.00021855345,0.00015339791,0.00047170775,0.00044278457,0.00013405237],"domain_scores_gemma":[0.9985801,0.0004885083,0.00008702869,0.00048198292,0.00026056584,0.000101855585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017640507,0.0020466577,0.0013948227,0.0024809712,0.00048583662,0.0023897442,0.0018714863,0.0015912373,0.018097991],"category_scores_gemma":[0.00613167,0.0009515392,0.002088814,0.0017099394,0.0006212507,0.0046816044,0.006369042,0.0025723334,0.0139208],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007615237,0.0003095829,0.0017378725,0.0007171234,0.00027332085,0.00033141745,0.00019625807,0.018139753,0.015023576,0.027447771,0.11351558,0.8215462],"study_design_scores_gemma":[0.00023930059,0.0003943265,0.0018861323,0.0003526311,0.00021535193,0.0013313133,0.0003145778,0.6262828,0.045424715,0.18360849,0.13976796,0.00018242325],"about_ca_topic_score_codex":0.0018777462,"about_ca_topic_score_gemma":0.0036932372,"teacher_disagreement_score":0.018097991,"about_ca_system_score_codex":0.00081363285,"about_ca_system_score_gemma":0.001323347,"threshold_uncertainty_score":0.060543835},"labels":[],"label_agreement":null},{"id":"W4403619652","doi":"10.1007/978-3-031-72390-2_12","title":"Fine-Grained Prompt Tuning: A Parameter and Memory Efficient Transfer Learning Method for High-Resolution Medical Image Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transfer of learning; Resolution (logic); Artificial intelligence; Image (mathematics); Transfer (computing); Computer vision; Machine learning; Pattern recognition (psychology); Parallel computing","score_opus":0.021951299179329142,"score_gpt":0.3058320243631449,"score_spread":0.28388072518381574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619652","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.008612993,0.0002212005,0.9856792,0.00009423892,0.000055630615,0.00004811624,0.000081873775,0.0042550624,0.0009516278],"genre_scores_gemma":[0.21018232,0.0002656876,0.77835363,0.00037053856,0.000105143925,0.00021224411,0.00051841384,0.00079864013,0.009193392],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996424,0.000064880674,0.000022534921,0.00010951482,0.000106426676,0.00005425121],"domain_scores_gemma":[0.99924016,0.00025976961,0.000057695448,0.00019099285,0.00020011318,0.00005131202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007142,0.0008616569,0.000889782,0.0005974706,0.00048630915,0.00084499543,0.0026660895,0.0016541627,0.0074506076],"category_scores_gemma":[0.0022756963,0.00042748288,0.0006943141,0.0010365305,0.00053453003,0.001393645,0.0019539997,0.0019104041,0.003126545],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025234986,0.00014149227,0.0003191326,0.00007407421,0.000046149395,0.00006179059,0.00006696114,0.063796826,0.035606403,0.003466343,0.008120791,0.88804764],"study_design_scores_gemma":[0.000016123362,0.000046892834,0.0002484822,0.0000071278796,0.000011034465,0.00004741506,0.000014365684,0.9826664,0.009953136,0.004957539,0.0020195697,0.000011934845],"about_ca_topic_score_codex":0.0038003111,"about_ca_topic_score_gemma":0.004698921,"teacher_disagreement_score":0.0074506076,"about_ca_system_score_codex":0.0006402703,"about_ca_system_score_gemma":0.0009791529,"threshold_uncertainty_score":0.024924755},"labels":[],"label_agreement":null},{"id":"W4403619954","doi":"10.1007/978-3-031-75764-8_9","title":"Adversarial Analysis of Software Composition Analysis Tools","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"University of Saskatchewan","funders":"","keywords":"Computer science; Composition (language); Adversarial system; Software; Software engineering; Programming language; Artificial intelligence","score_opus":0.017081283697743654,"score_gpt":0.2664037143505869,"score_spread":0.24932243065284326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008285964,0.00015211699,0.9860042,0.0002648804,0.000036909794,0.00003587434,0.000036545523,0.0006835633,0.0044999784],"genre_scores_gemma":[0.6293469,0.00052360335,0.34754148,0.00028290317,0.00020319708,0.0001955436,0.00034946122,0.0006970421,0.020859985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961928,0.0013622346,0.00010775458,0.0004147471,0.0016053848,0.00031718772],"domain_scores_gemma":[0.9897921,0.0074160066,0.0004632609,0.0014609279,0.00068836473,0.00017939661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031989813,0.00101438,0.00076756335,0.0012874459,0.0006561877,0.0014593182,0.0017659595,0.0010190333,0.005313566],"category_scores_gemma":[0.0130847925,0.00058227894,0.001087534,0.00092871656,0.0021289617,0.0023082045,0.0030377312,0.0026213299,0.0010756805],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022998704,0.000092251656,0.0008149939,0.00011320191,0.000089912406,0.0001150752,0.0001313804,0.54063517,0.006564521,0.28525048,0.00528405,0.16067898],"study_design_scores_gemma":[0.0000048238576,0.000020866559,0.00007987497,0.000013106678,0.000008479806,0.00003115026,0.000007629464,0.9119357,0.0019076619,0.08476642,0.0012188827,0.000005488226],"about_ca_topic_score_codex":0.0009937709,"about_ca_topic_score_gemma":0.0011912805,"teacher_disagreement_score":0.005313566,"about_ca_system_score_codex":0.0015372033,"about_ca_system_score_gemma":0.0010939523,"threshold_uncertainty_score":0.017775655},"labels":[],"label_agreement":null},{"id":"W4403619972","doi":"10.1007/978-3-031-75764-8_6","title":"Streamlining CSIDH: Cost-Effective Strategies for Group Actions Evaluation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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 Waterloo","funders":"","keywords":"Computer science; Group (periodic table)","score_opus":0.1904533958968292,"score_gpt":0.4305645567984444,"score_spread":0.24011116090161522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619972","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.013864223,0.00030680222,0.9728836,0.00045799016,0.00008332472,0.0005821259,0.00019613278,0.0012994485,0.010326432],"genre_scores_gemma":[0.28862524,0.00027676197,0.7034907,0.00016933914,0.000062563355,0.00052569027,0.00032105242,0.00017114093,0.0063574812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704534,0.0014740383,0.00014621815,0.00026035897,0.0009048005,0.00016922115],"domain_scores_gemma":[0.9914732,0.005875536,0.00043119036,0.00077016064,0.0012321625,0.00021779636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004696346,0.001208894,0.0012335695,0.0016650598,0.000551525,0.0020240652,0.0018665557,0.0009412572,0.01119615],"category_scores_gemma":[0.014516131,0.00041119588,0.00047447628,0.0015553167,0.0009021372,0.0029386044,0.0023442004,0.0013897172,0.0013893355],"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.00034992257,0.00026097763,0.0012937294,0.00024069594,0.000052534557,0.000053023345,0.00022070992,0.099593185,0.00246496,0.04550347,0.007357103,0.84260976],"study_design_scores_gemma":[0.00009143868,0.00023539911,0.00058908376,0.00006408543,0.000048916627,0.0000530907,0.00020012006,0.9174337,0.00462343,0.07057081,0.0060678744,0.000022112086],"about_ca_topic_score_codex":0.0063155494,"about_ca_topic_score_gemma":0.008399694,"teacher_disagreement_score":0.01119615,"about_ca_system_score_codex":0.001907267,"about_ca_system_score_gemma":0.0038131913,"threshold_uncertainty_score":0.037454784},"labels":[],"label_agreement":null},{"id":"W4403619985","doi":"10.1007/978-3-031-75757-0_12","title":"ChronoCloak: An Integrated Solution for Mitigating Premature Disclosure in Oblivious Digital Dissemination","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Computer network; Internet privacy","score_opus":0.010763875765774448,"score_gpt":0.25785332497138225,"score_spread":0.2470894492056078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619985","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.038204912,0.0036728848,0.8976418,0.0018642577,0.0013747374,0.0006091855,0.0005531578,0.034195278,0.021883858],"genre_scores_gemma":[0.5655923,0.0016812184,0.3819435,0.0015713741,0.00060854515,0.00040417098,0.00090890966,0.0014599701,0.04583001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.000315208,0.00013587705,0.00032576348,0.0008228194,0.00031149056],"domain_scores_gemma":[0.9956994,0.0008049746,0.00043529627,0.0019990932,0.0007388172,0.00032249396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022466818,0.000900197,0.0009792625,0.0014003456,0.0015597437,0.0034500854,0.003145571,0.0018885595,0.010865414],"category_scores_gemma":[0.0067341244,0.0004967315,0.00045748925,0.0011072224,0.001415357,0.0057490063,0.005598368,0.0024642914,0.003096308],"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.0020579763,0.0005835895,0.0017375571,0.0007278264,0.00017473382,0.00035751713,0.0007348539,0.011732444,0.036056533,0.06695866,0.05678793,0.8220903],"study_design_scores_gemma":[0.0010734737,0.001771382,0.0015045005,0.00041772734,0.00057560863,0.0016605646,0.00085400156,0.44698378,0.14743836,0.14718571,0.25021622,0.0003187077],"about_ca_topic_score_codex":0.0012762368,"about_ca_topic_score_gemma":0.0025617834,"teacher_disagreement_score":0.010865414,"about_ca_system_score_codex":0.0010258524,"about_ca_system_score_gemma":0.003537128,"threshold_uncertainty_score":0.036348462},"labels":[],"label_agreement":null},{"id":"W4403619987","doi":"10.1007/978-3-031-75757-0_8","title":"Emulating Android Device Drivers via Borrowed Execution Context","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Computer science; Android (operating system); Android application; Operating system; Human–computer interaction; Embedded system","score_opus":0.013013336565946112,"score_gpt":0.2549984587143785,"score_spread":0.24198512214843237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619987","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.2964952,0.0017610709,0.5661308,0.00047539666,0.001163398,0.0003724001,0.0007134814,0.10227268,0.030615533],"genre_scores_gemma":[0.9321768,0.00028762696,0.05527161,0.00031764098,0.00008511022,0.000110797366,0.00025967316,0.0037789338,0.007711793],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999358,0.00009538831,0.000045682646,0.00013573053,0.00024441097,0.00012081118],"domain_scores_gemma":[0.9982718,0.00066050567,0.00015612936,0.000632163,0.00018889637,0.000090468704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037093976,0.0016020257,0.00037184934,0.0006831045,0.00029914,0.0011997957,0.0012282652,0.0006966813,0.0056531015],"category_scores_gemma":[0.0040284353,0.0005830992,0.000439687,0.00026544937,0.00042000788,0.0019704527,0.0015937559,0.0013256448,0.001877318],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003137353,0.00068983104,0.015730329,0.000924182,0.0002516039,0.0025787011,0.0014363979,0.050905645,0.26005757,0.034181535,0.028617358,0.60148954],"study_design_scores_gemma":[0.00015487804,0.0007063084,0.004038552,0.00024661922,0.00024369734,0.0016963864,0.00021224748,0.5531319,0.3688694,0.018711725,0.051790684,0.00019761559],"about_ca_topic_score_codex":0.00084075716,"about_ca_topic_score_gemma":0.002040104,"teacher_disagreement_score":0.0056531015,"about_ca_system_score_codex":0.00030735484,"about_ca_system_score_gemma":0.0005474829,"threshold_uncertainty_score":0.01891154},"labels":[],"label_agreement":null},{"id":"W4403621512","doi":"10.1007/978-981-96-0567-5_24","title":"On the Alignment of Group Fairness with Attribute Privacy","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Internet privacy; Group (periodic table); Computer science; Computer security; Business; Chemistry","score_opus":0.025553168317854067,"score_gpt":0.2484792805474136,"score_spread":0.22292611222955955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403621512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019845977,0.00081741886,0.8950812,0.005168321,0.00062130525,0.00014024656,0.00014141704,0.00022994896,0.07795419],"genre_scores_gemma":[0.67675936,0.0014798538,0.2899693,0.002008106,0.0017816777,0.00056306936,0.00025076477,0.00041323426,0.026774641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9861379,0.0074063456,0.00053903175,0.0015905896,0.0030714467,0.0012547167],"domain_scores_gemma":[0.9777346,0.014032921,0.0011027331,0.005069842,0.0013637613,0.00069609255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013393877,0.0007711484,0.0019703694,0.0012382452,0.0034954655,0.005536902,0.0030812786,0.0027633207,0.010169404],"category_scores_gemma":[0.030972619,0.0008117549,0.0015419289,0.0035250594,0.009648978,0.016708918,0.007384823,0.009282859,0.0015789528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037096688,0.000014216431,0.00006896342,0.000013706744,0.0000057969964,0.000012569166,0.000108798384,0.0022396173,0.00013220227,0.9913589,0.0008563077,0.0051518683],"study_design_scores_gemma":[0.000010973543,0.000013584494,0.00005174459,0.000012545033,0.0000057181323,0.000015771053,0.00003171124,0.009993864,0.00019016983,0.9871803,0.0024867302,0.000006969849],"about_ca_topic_score_codex":0.0017007694,"about_ca_topic_score_gemma":0.0010944892,"teacher_disagreement_score":0.013393877,"about_ca_system_score_codex":0.0038733222,"about_ca_system_score_gemma":0.003064582,"threshold_uncertainty_score":0.07083446},"labels":[],"label_agreement":null},{"id":"W4403649753","doi":"10.1007/978-3-031-72390-2_60","title":"MedCLIP-SAM: Bridging Text and Image Towards Universal Medical Image Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bridging (networking); Computer science; Image segmentation; Computer vision; Artificial intelligence; Image (mathematics); Segmentation; Computer security","score_opus":0.009981602077675383,"score_gpt":0.2561293308092154,"score_spread":0.24614772873154003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403649753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036510502,0.0012367072,0.9057092,0.00053524174,0.00040651145,0.0002680688,0.0030381333,0.06956214,0.01559293],"genre_scores_gemma":[0.03231343,0.0011621981,0.9159391,0.0009039337,0.00029060215,0.00031663862,0.008865871,0.015140323,0.02506785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992866,0.000082455634,0.00006238328,0.00023252591,0.00026447777,0.00007154516],"domain_scores_gemma":[0.9988613,0.00045990487,0.000060664464,0.0002527891,0.0002770936,0.00008835758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009920511,0.0014812774,0.000990064,0.0028536317,0.00054658507,0.0024383096,0.0025189968,0.0018558581,0.04353736],"category_scores_gemma":[0.0027437392,0.00091003143,0.0011537211,0.002074388,0.00087249145,0.002359003,0.003454766,0.0013177245,0.029164772],"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.00021958534,0.000058677477,0.00028073034,0.0007870346,0.000058328773,0.00024849293,0.00020664757,0.002616455,0.066618,0.011564716,0.112538464,0.8048029],"study_design_scores_gemma":[0.000094499424,0.0002089075,0.0019404907,0.0004084262,0.00014130078,0.0026616345,0.0002581675,0.15317313,0.24825831,0.066780314,0.5259561,0.000118699536],"about_ca_topic_score_codex":0.0010524968,"about_ca_topic_score_gemma":0.0018102083,"teacher_disagreement_score":0.04353736,"about_ca_system_score_codex":0.0005197674,"about_ca_system_score_gemma":0.00085475756,"threshold_uncertainty_score":0.14564693},"labels":[],"label_agreement":null},{"id":"W4403649759","doi":"10.1007/978-3-031-72390-2_52","title":"Few-Shot Adaptation of Medical Vision-Language Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Université de Montréal; Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Computer science; Adaptation (eye); Shot (pellet); Artificial intelligence; Computer vision; Computer graphics (images); Neuroscience; Psychology","score_opus":0.026128904070784647,"score_gpt":0.28997014136125493,"score_spread":0.26384123729047027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403649759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025624946,0.0018499981,0.9646019,0.0004877839,0.00036115188,0.00008813566,0.0005888397,0.0040267105,0.0023705708],"genre_scores_gemma":[0.57041216,0.0023267607,0.3929053,0.0014041547,0.0005932159,0.00023476567,0.0049321707,0.0013633176,0.025828267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952555,0.00013380242,0.00001907955,0.00015515921,0.0001063701,0.000060092058],"domain_scores_gemma":[0.9992348,0.00039608293,0.000037082456,0.00011814623,0.00016398382,0.000049971568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011197072,0.0007997429,0.0009981608,0.0006284039,0.00020184364,0.00080154644,0.001381414,0.0013795766,0.0026086508],"category_scores_gemma":[0.0026807052,0.00057719764,0.0012067098,0.0006592928,0.00034547035,0.00080035924,0.0009589873,0.0017779379,0.0026705055],"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.0005227657,0.00025684194,0.00076417165,0.0002943652,0.0003381308,0.00023015261,0.00008737007,0.2649379,0.06706289,0.0032963643,0.0112419315,0.65096706],"study_design_scores_gemma":[0.000008625306,0.00005197218,0.00055286393,0.0000125507995,0.000037003363,0.00014959817,0.000008826372,0.9862881,0.009388626,0.0019727584,0.0015127806,0.00001635413],"about_ca_topic_score_codex":0.0045341384,"about_ca_topic_score_gemma":0.006321663,"teacher_disagreement_score":0.0045341384,"about_ca_system_score_codex":0.0005132628,"about_ca_system_score_gemma":0.0006402322,"threshold_uncertainty_score":0.009015441},"labels":[],"label_agreement":null},{"id":"W4403649873","doi":"10.1007/978-3-031-72390-2_50","title":"FACMIC: Federated Adaptative CLIP Model for Medical Image Classification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Image (mathematics); Artificial intelligence; Computer vision; Information retrieval; Computer graphics (images)","score_opus":0.04088328140346871,"score_gpt":0.30107180040890424,"score_spread":0.26018851900543555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403649873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004364108,0.00040266057,0.98357177,0.00012250917,0.00016236393,0.000109379725,0.00086563546,0.008776059,0.0016255582],"genre_scores_gemma":[0.15407097,0.0009991215,0.81917375,0.0006254191,0.00034826566,0.00045643278,0.006094526,0.0012353273,0.016996147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996785,0.00003602966,0.000011570792,0.00008213724,0.00014987841,0.000041857682],"domain_scores_gemma":[0.9996811,0.0000719066,0.00001478613,0.000080604405,0.00012656437,0.000025112387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611952,0.00094429514,0.000826312,0.00094220915,0.00031014535,0.0009995045,0.0019384816,0.0009486073,0.008158062],"category_scores_gemma":[0.0011441921,0.00030953507,0.0011872154,0.0010638842,0.0002596826,0.0010278965,0.0012159848,0.0015017313,0.0038567171],"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.00036285937,0.00019301719,0.0005307728,0.00011019667,0.0001084783,0.00009823151,0.000034555716,0.052908584,0.021720845,0.0030391247,0.029164467,0.8917288],"study_design_scores_gemma":[0.00001441313,0.00007084811,0.00044860432,0.000012902239,0.00003344251,0.00012506943,0.00001237721,0.9752921,0.011913615,0.0036194318,0.0084383115,0.000018934537],"about_ca_topic_score_codex":0.0065268674,"about_ca_topic_score_gemma":0.008321431,"teacher_disagreement_score":0.008158062,"about_ca_system_score_codex":0.0005844025,"about_ca_system_score_gemma":0.00079235,"threshold_uncertainty_score":0.027291417},"labels":[],"label_agreement":null},{"id":"W4403650529","doi":"10.1007/978-3-031-72390-2_33","title":"TrIND: Representing Anatomical Trees by Denoising Diffusion of Implicit Neural Fields","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Computer science; Artificial intelligence; Noise reduction; Diffusion; Artificial neural network; Pattern recognition (psychology); Physics; Thermodynamics","score_opus":0.009768033818951017,"score_gpt":0.23310373900229273,"score_spread":0.2233357051833417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403650529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023524947,0.00024572434,0.99495846,0.00007640856,0.000067237874,0.00001738288,0.00017710173,0.001284258,0.0008209518],"genre_scores_gemma":[0.07907522,0.0008451529,0.9099493,0.00017222932,0.00009004232,0.000114963426,0.0010393547,0.0010524645,0.0076612723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999796,0.000032499778,0.000012203736,0.00004464243,0.00009453048,0.000020183326],"domain_scores_gemma":[0.99958545,0.00016791068,0.000036040736,0.00007431631,0.00010774215,0.000028612227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871609,0.00082566147,0.0009854598,0.00086044474,0.00030247206,0.001381501,0.0021067134,0.0015933902,0.003933813],"category_scores_gemma":[0.0018033038,0.0007107307,0.0009895774,0.0011288583,0.0005832079,0.0014584048,0.0013080108,0.0019352232,0.0019219943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116140036,0.000048900438,0.00033505622,0.00022124394,0.00007707131,0.00008031117,0.000106719504,0.52037185,0.0134529555,0.03540148,0.01599778,0.41379055],"study_design_scores_gemma":[0.0000043388,0.000007237899,0.00003360959,0.000010850037,0.0000054745046,0.0000275668,0.0000036135366,0.9882811,0.0016927742,0.00748091,0.0024462251,0.0000063636317],"about_ca_topic_score_codex":0.006921898,"about_ca_topic_score_gemma":0.0109695215,"teacher_disagreement_score":0.006921898,"about_ca_system_score_codex":0.0007566805,"about_ca_system_score_gemma":0.0010008318,"threshold_uncertainty_score":0.013763189},"labels":[],"label_agreement":null},{"id":"W4403654807","doi":"10.1007/978-3-031-73284-3_36","title":"Calibrated Diverse Ensemble Entropy Minimization for Robust Test-Time Adaptation in Prostate Cancer Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy Techniques in Biomedical and Chemical Research","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 British Columbia; Queen's University","funders":"","keywords":"Computer science; Minification; Prostate cancer; Entropy (arrow of time); Artificial intelligence; Algorithm; Cancer; Medicine","score_opus":0.014626466854918313,"score_gpt":0.2804752769361161,"score_spread":0.2658488100811978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403654807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010350214,0.0004547049,0.98809844,0.00009993938,0.00003085758,0.00001898048,0.00008122915,0.0004306667,0.0004349237],"genre_scores_gemma":[0.45921183,0.00065742683,0.53085935,0.000309571,0.00017844872,0.0002572625,0.0010855673,0.00071106665,0.0067294897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.00023673142,0.00003901078,0.00014752775,0.00016904368,0.0000722825],"domain_scores_gemma":[0.9980526,0.0013785915,0.00008461302,0.00017047288,0.0002468934,0.00006685606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018025785,0.0009337567,0.001217706,0.0005039246,0.0003493167,0.00069186883,0.0015749361,0.0012952733,0.0020243535],"category_scores_gemma":[0.0052996273,0.0005802123,0.0009294469,0.000687588,0.000595736,0.001064814,0.001959729,0.0017849351,0.0006851569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018298234,0.00006517807,0.00057087565,0.000086445136,0.00009847445,0.0000656537,0.0000604211,0.6926496,0.011982819,0.005238732,0.002387889,0.28661096],"study_design_scores_gemma":[0.0000017322742,0.000014179466,0.00017339998,0.0000035431833,0.000005670934,0.000017422206,0.0000026757648,0.99641657,0.0017024216,0.0014700998,0.00018715781,0.000005121113],"about_ca_topic_score_codex":0.002449459,"about_ca_topic_score_gemma":0.0035451893,"teacher_disagreement_score":0.002449459,"about_ca_system_score_codex":0.0007513482,"about_ca_system_score_gemma":0.0008616331,"threshold_uncertainty_score":0.009533048},"labels":[],"label_agreement":null},{"id":"W4403681240","doi":"10.1007/978-3-031-71626-3_7","title":"Overview of the Trauma THOMPSON Challenge at MICCAI 2023","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Arrest and Resuscitation","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Alberta Health Services","funders":"","keywords":"Computer science","score_opus":0.034368177130611806,"score_gpt":0.2952906090216389,"score_spread":0.2609224318910271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403681240","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009996288,0.110067695,0.0073964745,0.047755253,0.022298705,0.00013721132,0.0010248588,0.000763074,0.809557],"genre_scores_gemma":[0.004522956,0.08631836,0.0065723322,0.007930967,0.008659728,0.00010782628,0.001213328,0.0005597356,0.88411486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994966,0.00006637635,0.000016421202,0.000045349167,0.00030758922,0.000067536304],"domain_scores_gemma":[0.999342,0.00009096074,0.000019466652,0.000024234358,0.0002568193,0.00026652415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012858124,0.0006707528,0.00029440393,0.0021400638,0.0010616351,0.003990767,0.0011195153,0.0019221882,0.116937175],"category_scores_gemma":[0.0014554281,0.0003734998,0.00039754002,0.0022772287,0.00043616703,0.0027524868,0.0022185356,0.0028396714,0.044948313],"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.000008266396,0.000023374652,0.00005175834,0.00014303438,0.000001694611,0.00005973465,0.000061931794,0.00022199769,0.00016092142,0.012219595,0.866695,0.12035277],"study_design_scores_gemma":[7.239603e-7,0.0000057910993,0.00006686981,0.00007976318,4.8854133e-7,0.00007218982,0.00002050108,0.00004031333,0.000031337157,0.0011131521,0.9985663,0.0000026453122],"about_ca_topic_score_codex":0.00535124,"about_ca_topic_score_gemma":0.021120578,"teacher_disagreement_score":0.116937175,"about_ca_system_score_codex":0.0021613324,"about_ca_system_score_gemma":0.0035801458,"threshold_uncertainty_score":0.3911938},"labels":[],"label_agreement":null},{"id":"W4403681492","doi":"10.1007/978-3-031-71626-3_8","title":"The Trauma THOMPSON Challenge Report MICCAI 2023","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Trauma and Emergency Care Studies","field":"Medicine","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 Calgary; Alberta Health Services","funders":"","keywords":"Computer science","score_opus":0.0324385887937356,"score_gpt":0.2971091332238052,"score_spread":0.2646705444300696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403681492","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002500391,0.023645813,0.0025186203,0.34181276,0.14611892,0.0002653982,0.0045182672,0.0010291308,0.47759074],"genre_scores_gemma":[0.015289326,0.019976782,0.0033718161,0.036162443,0.02958569,0.00028327043,0.0053735916,0.0008881409,0.889069],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807894,0.00015910255,0.000058431455,0.0001413845,0.0012623728,0.00029972402],"domain_scores_gemma":[0.99673235,0.00045567122,0.00008555426,0.00013825066,0.0012707093,0.0013175857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033801943,0.00085416366,0.00052907283,0.0016978525,0.0018248047,0.0056154523,0.0017764643,0.00529109,0.07053985],"category_scores_gemma":[0.0055612396,0.00040495064,0.0007234718,0.0012961063,0.0008889591,0.0023008054,0.0033615255,0.0054501845,0.031075876],"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.000007413564,0.000005628744,0.000033268254,0.000016320304,0.000001013593,0.000045113404,0.0000105600175,0.000046811798,0.000027483411,0.0012471651,0.98912233,0.009436838],"study_design_scores_gemma":[0.0000033145313,0.000008656352,0.00013431569,0.000044383054,0.000001357496,0.000065786044,0.00002898778,0.000054560343,0.000048836962,0.00084810256,0.9987581,0.0000037931916],"about_ca_topic_score_codex":0.018704303,"about_ca_topic_score_gemma":0.04613797,"teacher_disagreement_score":0.07053985,"about_ca_system_score_codex":0.0038539057,"about_ca_system_score_gemma":0.008293975,"threshold_uncertainty_score":0.23597932},"labels":[],"label_agreement":null},{"id":"W4403681882","doi":"10.1007/978-3-031-71626-3_5","title":"A Deep Neural Network Approach for the Lesion Segmentation from Neonatal Brain Magnetic Resonance Imaging","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neonatal and fetal brain pathology","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Magnetic resonance imaging; Segmentation; Artificial neural network; Artificial intelligence; Image segmentation; Radiology; Medicine","score_opus":0.01619557184712873,"score_gpt":0.25546166147287125,"score_spread":0.23926608962574253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403681882","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.010770178,0.002604152,0.9803355,0.00044001162,0.00016692356,0.000039952043,0.00042861328,0.001547025,0.003667594],"genre_scores_gemma":[0.23715584,0.004540726,0.7207549,0.00052118674,0.00033075875,0.00015806065,0.0019802204,0.000562898,0.033995345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999,0.000012493247,0.000006580303,0.000028361199,0.000033278808,0.000019325134],"domain_scores_gemma":[0.99984753,0.00006082562,0.000011596855,0.000015380372,0.000053696032,0.00001097043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034397308,0.00079968455,0.0006301215,0.0005400921,0.00025603938,0.000672497,0.0011210628,0.0011721775,0.003438751],"category_scores_gemma":[0.0005906221,0.00044823866,0.0006756661,0.00070671435,0.00022004609,0.00058332493,0.00095723826,0.0011286105,0.0012134359],"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.00008855727,0.000059406248,0.0005604496,0.00011726037,0.0000773958,0.00019611984,0.00004169035,0.2101954,0.021040654,0.0063985223,0.011855778,0.7493687],"study_design_scores_gemma":[0.0000033356118,0.000030095209,0.0004498031,0.000018291832,0.000022438395,0.00011945052,0.000009377715,0.9859601,0.0053012776,0.005551576,0.002524834,0.000009420121],"about_ca_topic_score_codex":0.008546226,"about_ca_topic_score_gemma":0.014953996,"teacher_disagreement_score":0.008546226,"about_ca_system_score_codex":0.00054164056,"about_ca_system_score_gemma":0.0007203481,"threshold_uncertainty_score":0.016992986},"labels":[],"label_agreement":null},{"id":"W4403705842","doi":"10.1007/978-3-031-72764-1_14","title":"Rawformer: Unpaired Raw-to-Raw Translation for Learnable Camera ISPs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"York University","funders":"","keywords":"Computer science; Translation (biology); Computer vision; Artificial intelligence; Computer graphics (images); Raw material; Raw data; Programming language; Chemistry","score_opus":0.02306121499774085,"score_gpt":0.2842518888597519,"score_spread":0.26119067386201106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403705842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009242085,0.00016433702,0.9904495,0.00007235524,0.00014159024,0.00003404049,0.0003275758,0.0059509506,0.0019354586],"genre_scores_gemma":[0.0410132,0.0004819881,0.933422,0.00032472852,0.00032330063,0.00019509064,0.0031502987,0.0024545307,0.018634802],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908555,0.00014180243,0.00004040421,0.0002559908,0.00038331008,0.00009299418],"domain_scores_gemma":[0.9991252,0.00022159413,0.000057497837,0.00033701278,0.00019901112,0.000059629416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010427405,0.0027176298,0.0013134461,0.0008057327,0.00041586903,0.0014224694,0.0024256157,0.00223902,0.038198203],"category_scores_gemma":[0.0028600474,0.00094967167,0.0011788746,0.0010873377,0.0010131887,0.0025871533,0.0032545712,0.0026859064,0.024633545],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034536162,0.000103714665,0.0002292794,0.00026946445,0.00009026694,0.00022675109,0.000081947466,0.028758008,0.030576475,0.015154528,0.0450348,0.8791295],"study_design_scores_gemma":[0.00010387168,0.00034298372,0.0007156976,0.00014104242,0.00007134715,0.00095766084,0.0001051801,0.80161947,0.07367656,0.06357769,0.058591694,0.000096841584],"about_ca_topic_score_codex":0.0014951918,"about_ca_topic_score_gemma":0.003880086,"teacher_disagreement_score":0.038198203,"about_ca_system_score_codex":0.0004048885,"about_ca_system_score_gemma":0.0011280043,"threshold_uncertainty_score":0.12778574},"labels":[],"label_agreement":null},{"id":"W4403706727","doi":"10.1007/978-3-031-73229-4_20","title":"Salience-Based Adaptive Masking: Revisiting Token Dynamics for Enhanced Pre-training","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Salience (neuroscience); Security token; Masking (illustration); Artificial intelligence; Speech recognition; Computer security","score_opus":0.023276721237876063,"score_gpt":0.25412994406511824,"score_spread":0.2308532228272422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403706727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009127879,0.00028686048,0.98803747,0.00009594732,0.000094337454,0.00003502948,0.000055906956,0.0006251518,0.0016414309],"genre_scores_gemma":[0.44909397,0.0006357392,0.537455,0.00031730367,0.00012849519,0.00012899564,0.00033021858,0.0006891472,0.011221118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997526,0.000049768973,0.000012742735,0.000072031784,0.00007041056,0.000042405394],"domain_scores_gemma":[0.99930775,0.00039855787,0.00004145605,0.000106984735,0.00009044434,0.00005488615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063824723,0.0006732887,0.00071246707,0.00028488468,0.00030300027,0.0007209937,0.0015772532,0.0009554592,0.0072574886],"category_scores_gemma":[0.0025090864,0.0004267502,0.00037226433,0.00039604987,0.00057415897,0.0014361357,0.0017955216,0.0016023673,0.0018556551],"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.000745825,0.00020441784,0.0004550538,0.00026064503,0.000062817846,0.00016346223,0.00017432055,0.19086748,0.19270517,0.029403482,0.004669326,0.58028805],"study_design_scores_gemma":[0.000013694711,0.00007776331,0.00011936831,0.000016315471,0.000015517222,0.000059592843,0.000012350837,0.97170514,0.019682175,0.0063462364,0.0019409002,0.000010961276],"about_ca_topic_score_codex":0.001974757,"about_ca_topic_score_gemma":0.0040627974,"teacher_disagreement_score":0.0072574886,"about_ca_system_score_codex":0.000348023,"about_ca_system_score_gemma":0.00094825844,"threshold_uncertainty_score":0.0242787},"labels":[],"label_agreement":null},{"id":"W4403730128","doi":"10.1007/978-3-031-72764-1_19","title":"UniCal: Unified Neural Sensor Calibration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Calibration; Artificial neural network; Artificial intelligence; Mathematics; Statistics","score_opus":0.02205961744064119,"score_gpt":0.27985065419040955,"score_spread":0.2577910367497684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403730128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010075624,0.0009861324,0.965145,0.00013237081,0.0003016154,0.000032493946,0.0005117247,0.018422445,0.01346056],"genre_scores_gemma":[0.06424441,0.0015839832,0.8699306,0.00045889814,0.00021880919,0.00019778039,0.0032536362,0.004723203,0.05538873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993605,0.00007035657,0.000028941658,0.00014691033,0.00034829977,0.000044962206],"domain_scores_gemma":[0.9996207,0.000064018364,0.000024661302,0.00013973472,0.00013428317,0.000016623299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006008996,0.0012426198,0.0007734645,0.0011502409,0.00040081964,0.0013755033,0.002377246,0.0012663582,0.028348362],"category_scores_gemma":[0.0015627079,0.000722405,0.0005803342,0.0013245038,0.0005544421,0.0023636536,0.0022130231,0.0012331852,0.014973794],"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.000098617835,0.00003269766,0.00017701914,0.00023676733,0.000042412412,0.00006988891,0.000039422932,0.020300377,0.015206354,0.026862917,0.06777698,0.86915654],"study_design_scores_gemma":[0.00002448787,0.00005883507,0.0006472395,0.00011196945,0.000043373122,0.00054757483,0.00004194404,0.6055735,0.070406094,0.04998633,0.27247316,0.00008549259],"about_ca_topic_score_codex":0.002577136,"about_ca_topic_score_gemma":0.005671427,"teacher_disagreement_score":0.028348362,"about_ca_system_score_codex":0.0007046688,"about_ca_system_score_gemma":0.00074343005,"threshold_uncertainty_score":0.094834685},"labels":[],"label_agreement":null},{"id":"W4403756802","doi":"10.1007/978-3-031-75599-6_2","title":"A Methodological Framework for Designing Human-Centered Artificial Intelligence Services","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction; Data science","score_opus":0.300633916053009,"score_gpt":0.3872733602038244,"score_spread":0.08663944415081543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403756802","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.0016723016,0.00014082793,0.9828452,0.0022051677,0.000054172157,0.00035474557,0.00008937545,0.00028485298,0.012353342],"genre_scores_gemma":[0.08095702,0.00019272363,0.91187835,0.0004965108,0.000055008684,0.0008662359,0.00027790046,0.00014090806,0.0051353816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9841526,0.009175987,0.0013291723,0.0017141725,0.0026133982,0.0010146276],"domain_scores_gemma":[0.99047464,0.004679945,0.0005354827,0.0017890367,0.0018528135,0.00066809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018634433,0.0013059692,0.00088964804,0.0029459822,0.0042240475,0.01446589,0.0060782307,0.0043340507,0.008309293],"category_scores_gemma":[0.016231325,0.0014706587,0.0022474783,0.0027999936,0.013139493,0.0120190205,0.007176097,0.004785819,0.0025406193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012896825,0.000046101344,0.00020468247,0.00010193141,0.000017778788,0.00006908221,0.0016921883,0.0027993938,0.0003855585,0.9846395,0.0013919828,0.008638786],"study_design_scores_gemma":[0.000045882633,0.000036364163,0.0001450963,0.00016599397,0.00004003191,0.00011984237,0.0021044319,0.035387736,0.0016532483,0.89066786,0.06960175,0.000031912146],"about_ca_topic_score_codex":0.013863545,"about_ca_topic_score_gemma":0.0101499725,"teacher_disagreement_score":0.018634433,"about_ca_system_score_codex":0.0063724527,"about_ca_system_score_gemma":0.013291867,"threshold_uncertainty_score":0.098549485},"labels":[],"label_agreement":null},{"id":"W4403759712","doi":"10.1007/978-3-031-72664-4_25","title":"Rejection Sampling IMLE: Designing Priors for Better Few-Shot Image Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Prior probability; Shot (pellet); One shot; Image (mathematics); Sampling (signal processing); Artificial intelligence; Computer vision; Computer graphics (images); Algorithm; Bayesian probability","score_opus":0.034253625639089263,"score_gpt":0.3043514396817086,"score_spread":0.27009781404261934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403759712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009924758,0.0000592399,0.99824786,0.000025320756,0.000013194316,0.00000883127,0.000018126222,0.00023397656,0.00040107677],"genre_scores_gemma":[0.042737458,0.00021432272,0.9531126,0.00016982043,0.00006274817,0.00007840313,0.00021766832,0.00050520117,0.0029018458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.000274513,0.000033811895,0.0001521674,0.00030159042,0.00006246628],"domain_scores_gemma":[0.9983675,0.0008987611,0.00008894171,0.000296894,0.0002581768,0.00008984041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014105473,0.0011559944,0.0009595522,0.0005546977,0.0003161649,0.001154748,0.0013562145,0.0017224475,0.007555178],"category_scores_gemma":[0.0053839753,0.0008747281,0.00065764616,0.0005127452,0.00068505184,0.0016022223,0.0018293713,0.0019741068,0.0034732642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097588595,0.00025848715,0.0006880856,0.00047578732,0.0001386878,0.00016968207,0.0002402965,0.1629517,0.19400792,0.041921113,0.008793433,0.58937883],"study_design_scores_gemma":[0.00003970506,0.00008573455,0.00018322057,0.00003251316,0.000021540402,0.00013935575,0.000024047293,0.9321438,0.049625393,0.010851578,0.0068289638,0.000024164261],"about_ca_topic_score_codex":0.00088779983,"about_ca_topic_score_gemma":0.0018612649,"teacher_disagreement_score":0.007555178,"about_ca_system_score_codex":0.00040247466,"about_ca_system_score_gemma":0.00057551,"threshold_uncertainty_score":0.025274634},"labels":[],"label_agreement":null},{"id":"W4403759847","doi":"10.1007/978-3-031-72989-8_26","title":"DPA-Net: Structured 3D Abstraction from Sparse Views via Differentiable Primitive Assembly","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Simon Fraser University","funders":"","keywords":"Computer science; Abstraction; Differentiable function; Theoretical computer science; Programming language; Net (polyhedron); Algorithm; Mathematics; Geometry; Epistemology; Philosophy","score_opus":0.017563744432388798,"score_gpt":0.22862869244714543,"score_spread":0.21106494801475661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403759847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024265854,0.000087444256,0.9872909,0.00003303057,0.000038872862,0.000031193755,0.0003604703,0.0060756025,0.0036557834],"genre_scores_gemma":[0.08449738,0.00033581525,0.9017787,0.00009979341,0.000037160673,0.00013236667,0.0021839165,0.0028598055,0.008075146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996499,0.000026455362,0.00001676692,0.00007713203,0.00019778687,0.000031882362],"domain_scores_gemma":[0.9996867,0.000087013286,0.00001773202,0.0001390003,0.00004206845,0.000027415741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030193964,0.0011067014,0.0013834863,0.000930774,0.00045949247,0.0017695196,0.0023191385,0.0008821565,0.01621764],"category_scores_gemma":[0.000983446,0.0009560939,0.0015099283,0.0011497681,0.0007890133,0.0019880277,0.003766451,0.0023743077,0.005954734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002382507,0.00008960863,0.00048125623,0.00042356446,0.00009785578,0.0003617418,0.00027069502,0.14662312,0.037322145,0.13206416,0.031469084,0.6505585],"study_design_scores_gemma":[0.000028703515,0.000048747504,0.00016513889,0.000043120443,0.000024500285,0.00025833826,0.000041442865,0.8894247,0.01171858,0.06675373,0.031460546,0.00003252925],"about_ca_topic_score_codex":0.0022399013,"about_ca_topic_score_gemma":0.0047183423,"teacher_disagreement_score":0.01621764,"about_ca_system_score_codex":0.00051166647,"about_ca_system_score_gemma":0.0006569533,"threshold_uncertainty_score":0.05425346},"labels":[],"label_agreement":null},{"id":"W4403761006","doi":"10.1007/978-3-031-72664-4_19","title":"Flying with Photons: Rendering Novel Views of Propagating Light","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Vector Institute; University of Toronto","funders":"","keywords":"Rendering (computer graphics); Computer science; Photon; Computer graphics (images); Optics; Physics","score_opus":0.033851633340190194,"score_gpt":0.2851369849248462,"score_spread":0.251285351584656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403761006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1024999,0.0015790387,0.87196493,0.00053004356,0.00039302738,0.00010370037,0.00036144277,0.0023310864,0.020236852],"genre_scores_gemma":[0.433441,0.0023614112,0.5469537,0.0002720413,0.00017290092,0.00007558295,0.00034968808,0.0013655282,0.01500829],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998872,0.000017353275,0.000003086399,0.000015308837,0.000057467543,0.000019507572],"domain_scores_gemma":[0.9997615,0.0001366552,0.000014284466,0.000027607071,0.000022756893,0.00003719454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002205174,0.0007610353,0.00047315023,0.0003597596,0.00033842825,0.001856587,0.0007379752,0.00081977074,0.0078898305],"category_scores_gemma":[0.0005714352,0.00062708353,0.00069795264,0.0004283634,0.00056105637,0.0010667996,0.0010503703,0.0016187122,0.0006556235],"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.00090104376,0.00020179834,0.00081008225,0.00074750645,0.00022130032,0.001668602,0.0019008623,0.10536499,0.47886315,0.1372179,0.01869842,0.25340435],"study_design_scores_gemma":[0.0003688704,0.00033360915,0.0015032212,0.0001990328,0.00016185544,0.0026169345,0.0007668735,0.73653185,0.12562601,0.0660453,0.06565051,0.00019587329],"about_ca_topic_score_codex":0.0012434509,"about_ca_topic_score_gemma":0.0026362424,"teacher_disagreement_score":0.0078898305,"about_ca_system_score_codex":0.0003534981,"about_ca_system_score_gemma":0.00035472368,"threshold_uncertainty_score":0.026394129},"labels":[],"label_agreement":null},{"id":"W4403779027","doi":"10.1007/978-3-031-72698-9_22","title":"Learning Exhaustive Correlation for Spectral Super-Resolution: Where Spatial-Spectral Attention Meets Linear Dependence","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","field":"Engineering","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":"Huawei Technologies (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Correlation; Spatial correlation; Algorithm; Linear correlation; Artificial intelligence; Statistical physics; Pattern recognition (psychology); Physics; Statistics; Mathematics; Telecommunications; Geometry","score_opus":0.01011856243330203,"score_gpt":0.24370538579066742,"score_spread":0.2335868233573654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403779027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012910087,0.0008738004,0.9827801,0.00041753153,0.00006634163,0.000028123462,0.00010147757,0.0005301783,0.002292313],"genre_scores_gemma":[0.4639039,0.0020439345,0.51664054,0.0009252276,0.00050047034,0.00016242021,0.0006352968,0.00045649745,0.014731732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.0001438058,0.00003052615,0.00016397846,0.00012186519,0.00009837164],"domain_scores_gemma":[0.9978781,0.0014354711,0.000088738285,0.00029639914,0.00020888042,0.00009242637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016424685,0.0011647791,0.0017185869,0.00062205025,0.00047963866,0.0014866812,0.0018474745,0.0019417154,0.0044364263],"category_scores_gemma":[0.0064024837,0.0008264887,0.0007343325,0.0013103879,0.0010922779,0.0030997512,0.0027018276,0.0024105292,0.0011101206],"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.0005201612,0.00031191655,0.00093364064,0.0004185496,0.00020862985,0.00026636315,0.00021517716,0.24746808,0.032896042,0.079733945,0.01557649,0.6214509],"study_design_scores_gemma":[0.000008548071,0.000043915865,0.00017312817,0.000014132175,0.000020981148,0.000079543206,0.000014507819,0.96930784,0.0039857337,0.025227332,0.0011139334,0.0000104956325],"about_ca_topic_score_codex":0.004272697,"about_ca_topic_score_gemma":0.0079740975,"teacher_disagreement_score":0.0044364263,"about_ca_system_score_codex":0.0006433918,"about_ca_system_score_gemma":0.0018904859,"threshold_uncertainty_score":0.014841378},"labels":[],"label_agreement":null},{"id":"W4403779070","doi":"10.1007/978-3-031-72698-9_15","title":"FOREST2SEQ: Revitalizing Order Prior for Sequential Indoor Scene Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Simon Fraser University","funders":"","keywords":"Computer science; Order (exchange); Computer graphics (images); Artificial intelligence","score_opus":0.024574177721435726,"score_gpt":0.293781988624863,"score_spread":0.26920781090342727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403779070","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.001477373,0.00015199505,0.9937935,0.00004737649,0.00006309355,0.00002630785,0.00029562847,0.0027893293,0.0013553621],"genre_scores_gemma":[0.042468954,0.00030695094,0.94448036,0.00027066458,0.00012228008,0.00013191401,0.0027452905,0.0019393545,0.007534172],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923885,0.0001509892,0.000032755135,0.0001918669,0.00030503972,0.00008050983],"domain_scores_gemma":[0.9992213,0.00035250827,0.000030257848,0.00019735262,0.00014985687,0.00004865516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010145487,0.0017011798,0.0015191277,0.0010385247,0.0005469697,0.0012488336,0.002043675,0.0015070273,0.016897652],"category_scores_gemma":[0.002314647,0.0010638112,0.0015903148,0.0012700604,0.0006189187,0.0013763149,0.002225959,0.0028189458,0.008405915],"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.0005348834,0.00015312817,0.00055014517,0.00023864474,0.00014664234,0.00017530366,0.0001322198,0.16181378,0.032343965,0.021427302,0.027617127,0.75486684],"study_design_scores_gemma":[0.00004527392,0.000066401466,0.0001954024,0.000023168928,0.000031246196,0.00009828964,0.000027986696,0.95951086,0.010321931,0.017217794,0.012434209,0.000027371463],"about_ca_topic_score_codex":0.012553405,"about_ca_topic_score_gemma":0.037537232,"teacher_disagreement_score":0.016897652,"about_ca_system_score_codex":0.00067814876,"about_ca_system_score_gemma":0.0018795934,"threshold_uncertainty_score":0.05652827},"labels":[],"label_agreement":null},{"id":"W4403781551","doi":"10.1007/978-3-031-75390-9_3","title":"Interoperability of Digital Twins: Challenges, Success Factors, and Future Research Directions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Transformation in Industry","field":"Engineering","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":"McMaster University","funders":"","keywords":"Computer science; Interoperability; Software engineering; Data science; World Wide Web","score_opus":0.05233815101206532,"score_gpt":0.2868668076241404,"score_spread":0.2345286566120751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403781551","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5027164,0.019628264,0.18324018,0.045572866,0.0011708029,0.0003560958,0.0003198371,0.0007180824,0.2462774],"genre_scores_gemma":[0.90205365,0.00979925,0.07006621,0.0013213927,0.00036206262,0.00018471693,0.0005749162,0.00023409113,0.0154036805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937202,0.0028944258,0.00040399862,0.0006281812,0.0015960059,0.0007572389],"domain_scores_gemma":[0.97925836,0.010929063,0.001201897,0.0035592325,0.0033108597,0.0017405141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016547682,0.00038728502,0.0007827664,0.002188484,0.0024836666,0.015587847,0.0027599747,0.0021508203,0.0101035405],"category_scores_gemma":[0.029229522,0.0002944424,0.0007604662,0.0049461364,0.0036299217,0.03295232,0.006918949,0.0026464008,0.001426974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014139706,0.0003499504,0.016693959,0.00042989576,0.000048934067,0.00033809888,0.005395481,0.0012973325,0.0014961797,0.53332454,0.0052808486,0.43520343],"study_design_scores_gemma":[0.000035939443,0.00035434813,0.008476383,0.0015248341,0.00011603507,0.0014864547,0.05442881,0.014578609,0.007118464,0.77609813,0.13569547,0.00008651494],"about_ca_topic_score_codex":0.0021209305,"about_ca_topic_score_gemma":0.0019926338,"teacher_disagreement_score":0.016547682,"about_ca_system_score_codex":0.0019714236,"about_ca_system_score_gemma":0.0047395844,"threshold_uncertainty_score":0.087513566},"labels":[],"label_agreement":null},{"id":"W4403793598","doi":"10.1007/978-3-031-75872-0_10","title":"Model-Driven Design and Generation of Training Simulators for Reinforcement Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Regina; University of Toronto; York University","funders":"","keywords":"Computer science; Reinforcement learning; Training (meteorology); Artificial intelligence; Human–computer interaction; Simulation","score_opus":0.07555659613702641,"score_gpt":0.27975780820531954,"score_spread":0.20420121206829311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403793598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072666127,0.00008466026,0.98981386,0.000063773776,0.000024277184,0.000080148304,0.000035395195,0.0004863761,0.0021448971],"genre_scores_gemma":[0.6295735,0.00014940799,0.36592135,0.000081451486,0.00001840557,0.00048850133,0.00014626647,0.00022402141,0.0033970599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997199,0.00008696117,0.000012960842,0.000056346595,0.0000876179,0.000036143625],"domain_scores_gemma":[0.99902666,0.0005940907,0.000075707496,0.00008182062,0.00018506171,0.000036655238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007550944,0.00066429854,0.0006562005,0.00037235982,0.00029282013,0.00061003654,0.001388641,0.0010360408,0.003732745],"category_scores_gemma":[0.0027002965,0.00060793303,0.0006312576,0.00024011414,0.0005884831,0.0004447541,0.0008528323,0.0010677218,0.00056082086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030287552,0.000028872128,0.00012621487,0.000042002044,0.000010041795,0.000025567972,0.000026108359,0.96942836,0.0021322805,0.0069750915,0.00045915076,0.020715946],"study_design_scores_gemma":[0.00000455688,0.000010037845,0.000015445614,0.000002649526,0.0000020175648,0.000005531163,0.0000015394914,0.99765635,0.0005073812,0.0015527019,0.00024037196,0.0000013507699],"about_ca_topic_score_codex":0.0027057426,"about_ca_topic_score_gemma":0.003282384,"teacher_disagreement_score":0.003732745,"about_ca_system_score_codex":0.0008121212,"about_ca_system_score_gemma":0.0011244601,"threshold_uncertainty_score":0.012487233},"labels":[],"label_agreement":null},{"id":"W4403793604","doi":"10.1007/978-3-031-75872-0_12","title":"Modeling and Reasoning About Explanation Requirements Using Goal Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Regina; University of Toronto; York University","funders":"","keywords":"Computer science; Software engineering; Management science; Artificial intelligence","score_opus":0.07446143258414237,"score_gpt":0.3154475937369708,"score_spread":0.24098616115282842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403793604","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.0107143745,0.00011545355,0.98010343,0.00064638717,0.000019618185,0.0001695357,0.00032769836,0.0012203464,0.0066832365],"genre_scores_gemma":[0.18145202,0.00029104584,0.8108232,0.00020904472,0.00002809402,0.0002931774,0.0018866824,0.00036969595,0.004647054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962838,0.0016150835,0.00035980757,0.0004357884,0.0010690221,0.00023648232],"domain_scores_gemma":[0.9914942,0.006460015,0.0004288729,0.0008216885,0.0006563323,0.00013880376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033212863,0.0011558987,0.00068041525,0.0018595603,0.00069706317,0.0033606964,0.0024613603,0.0018320673,0.0070065623],"category_scores_gemma":[0.0140988175,0.0012907186,0.0025896302,0.0012502827,0.0014871625,0.005804948,0.0027600545,0.0026883958,0.0011560059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001975956,0.00025710568,0.0025904053,0.0008472363,0.00020314714,0.0012774392,0.0031363342,0.16431433,0.008031443,0.659528,0.009497909,0.15011904],"study_design_scores_gemma":[0.000070651826,0.00005636068,0.00056292326,0.000215259,0.0001308714,0.00027089528,0.00055158144,0.5745718,0.006598639,0.39608774,0.020832794,0.00005040944],"about_ca_topic_score_codex":0.0068089534,"about_ca_topic_score_gemma":0.009128125,"teacher_disagreement_score":0.0070065623,"about_ca_system_score_codex":0.0015136387,"about_ca_system_score_gemma":0.0017126789,"threshold_uncertainty_score":0.023439288},"labels":[],"label_agreement":null},{"id":"W4403793655","doi":"10.1007/978-3-031-75872-0_11","title":"Generating Secure Workflow Designs from Requirements Goal Models Using Patterns","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; York University","funders":"","keywords":"Computer science; Workflow; Software engineering; Workflow management system; Database","score_opus":0.08167502105696985,"score_gpt":0.29414893852014123,"score_spread":0.2124739174631714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403793655","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.02209713,0.00004222653,0.9696348,0.00020092445,0.00003155806,0.0003843184,0.00045253724,0.003299642,0.0038568997],"genre_scores_gemma":[0.17374022,0.0001764965,0.8180485,0.00010941332,0.000014022758,0.0005755922,0.0017499169,0.0010367114,0.0045491643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985299,0.00037994276,0.000116020296,0.0002143657,0.0006463765,0.00011337615],"domain_scores_gemma":[0.99634093,0.0021058384,0.00030949924,0.0007644056,0.00041563893,0.00006366785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017283378,0.0011144201,0.00043810383,0.0011039044,0.000431285,0.0012332816,0.0011009119,0.00097303616,0.0047515724],"category_scores_gemma":[0.008077813,0.0011653916,0.0024112368,0.00079664227,0.0007968886,0.0017405446,0.0018579556,0.0015126099,0.0018085857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054291636,0.00044017096,0.0043976144,0.0011299454,0.00021043656,0.0019394989,0.0011290254,0.34729522,0.04013487,0.18952434,0.01070269,0.40255326],"study_design_scores_gemma":[0.00015380261,0.00019621234,0.0004303709,0.00016742949,0.00013746209,0.00048318642,0.00026170217,0.7691368,0.046274308,0.16438317,0.018331898,0.000043620978],"about_ca_topic_score_codex":0.0013570827,"about_ca_topic_score_gemma":0.0026427598,"teacher_disagreement_score":0.0047515724,"about_ca_system_score_codex":0.0007263754,"about_ca_system_score_gemma":0.0018279562,"threshold_uncertainty_score":0.015895545},"labels":[],"label_agreement":null},{"id":"W4403842152","doi":"10.1007/978-3-031-73347-5_25","title":"JointDreamer: Ensuring Geometry Consistency and Text Congruence in Text-to-3D Generation via Joint Score Distillation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing and 3D Reconstruction","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":"Huawei Technologies (Canada)","funders":"","keywords":"Congruence (geometry); Computer science; Consistency (knowledge bases); Distillation; Joint (building); Artificial intelligence; Engineering drawing; Algorithm; Geometry; Mathematics; Engineering; Structural engineering; Chemistry","score_opus":0.018920030591673402,"score_gpt":0.23152700750911037,"score_spread":0.21260697691743696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403842152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011095882,0.00012896808,0.9686109,0.00014632531,0.00020223112,0.0001768692,0.00043133096,0.0152897565,0.0039177216],"genre_scores_gemma":[0.16769585,0.00011056839,0.8121089,0.00025214773,0.00018778385,0.00034139212,0.0025810695,0.0069427816,0.009779558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99406415,0.0014082766,0.00040321436,0.0012182547,0.0023725235,0.0005335579],"domain_scores_gemma":[0.99252534,0.0029899052,0.00033347658,0.0024825663,0.0013925942,0.00027608793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030734714,0.0027334185,0.0025430105,0.0019092434,0.001465632,0.0034314478,0.005337805,0.0028498445,0.028138164],"category_scores_gemma":[0.014744975,0.0012747766,0.001930079,0.0020026728,0.0025082915,0.0037962892,0.011626372,0.003046469,0.01462552],"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.0008604187,0.0002697652,0.0009213998,0.000423741,0.00009093082,0.00043904333,0.00056370895,0.05624763,0.043155044,0.046110846,0.025086662,0.8258308],"study_design_scores_gemma":[0.00021119181,0.0002564784,0.00041745373,0.000061938226,0.00005412497,0.00034246093,0.00021091204,0.8387143,0.08014923,0.063360795,0.01612488,0.000096225376],"about_ca_topic_score_codex":0.0025809065,"about_ca_topic_score_gemma":0.0047463146,"teacher_disagreement_score":0.028138164,"about_ca_system_score_codex":0.0007525861,"about_ca_system_score_gemma":0.0019169927,"threshold_uncertainty_score":0.09413153},"labels":[],"label_agreement":null},{"id":"W4403842289","doi":"10.1007/978-3-031-73347-5_17","title":"Reason2Drive: Towards Interpretable and Chain-Based Reasoning for Autonomous Driving","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Chain (unit)","score_opus":0.00964357850915667,"score_gpt":0.26815169255353205,"score_spread":0.2585081140443754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403842289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020745653,0.0002324316,0.9771185,0.00014387879,0.000075709184,0.00008810841,0.000737594,0.016054392,0.0034748395],"genre_scores_gemma":[0.06188791,0.00047232787,0.9253162,0.00020636444,0.000052125677,0.00015508753,0.003084787,0.0021291801,0.006695933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990029,0.000155025,0.00008239151,0.00023473374,0.00045523662,0.00006967063],"domain_scores_gemma":[0.9989423,0.00050454,0.00005008106,0.0002872505,0.00017502427,0.000040717172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011272045,0.0017091403,0.0010370121,0.001139121,0.000736123,0.00316639,0.004492673,0.0021015343,0.022400945],"category_scores_gemma":[0.0035822287,0.0013389718,0.0031390316,0.0007784193,0.0013640397,0.004400188,0.003771405,0.0030515334,0.00595734],"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.0004816608,0.00030546577,0.0012085594,0.0015662877,0.00034862373,0.0004167775,0.0009916185,0.21037433,0.012490839,0.17270228,0.055334393,0.54377925],"study_design_scores_gemma":[0.00007856118,0.000041811123,0.0001712865,0.00013945563,0.00009278432,0.00011526566,0.000097427794,0.73639363,0.010376587,0.20140758,0.051041856,0.00004385204],"about_ca_topic_score_codex":0.008642176,"about_ca_topic_score_gemma":0.013464165,"teacher_disagreement_score":0.022400945,"about_ca_system_score_codex":0.0007459152,"about_ca_system_score_gemma":0.0014044457,"threshold_uncertainty_score":0.074938655},"labels":[],"label_agreement":null},{"id":"W4403842396","doi":"10.1007/978-3-031-72640-8_10","title":"MVDiffusion++: A Dense High-Resolution Multi-view Diffusion Model for Single or Sparse-View 3D Object Reconstruction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Object (grammar); Computer vision; Artificial intelligence; Resolution (logic); Diffusion; High resolution; Computer graphics (images); Algorithm; Physics; Remote sensing; Geology","score_opus":0.03401394770613962,"score_gpt":0.24197403480970875,"score_spread":0.2079600871035691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403842396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004656134,0.0001208256,0.99783725,0.00004155488,0.00002733724,0.000011249952,0.00011324176,0.0008342856,0.00054872816],"genre_scores_gemma":[0.032388564,0.0007713131,0.9554109,0.00014724012,0.00005915151,0.000103014696,0.0009779002,0.0012250688,0.008916821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979216,0.000032416483,0.000009517486,0.000035023375,0.00011689688,0.000013950814],"domain_scores_gemma":[0.99972755,0.000093435774,0.000020943995,0.000058505084,0.00007635823,0.000023170225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039369546,0.00095743674,0.0008865332,0.00041590174,0.000245925,0.0010492312,0.0022628768,0.0012415306,0.005967554],"category_scores_gemma":[0.0012380842,0.00082459336,0.0011023916,0.000678558,0.00038082892,0.0011134115,0.0013841117,0.0015054588,0.00384248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013951542,0.00007653496,0.00030801728,0.00032777234,0.00013307946,0.0001845917,0.0001142828,0.4743186,0.045042146,0.04651899,0.029691556,0.40314493],"study_design_scores_gemma":[0.000006293934,0.000011001664,0.000035118777,0.0000070253423,0.0000071087925,0.00008089973,0.0000034654872,0.98298913,0.004229725,0.005064174,0.007554879,0.000011090014],"about_ca_topic_score_codex":0.0037277334,"about_ca_topic_score_gemma":0.005667731,"teacher_disagreement_score":0.005967554,"about_ca_system_score_codex":0.0004628914,"about_ca_system_score_gemma":0.0006329245,"threshold_uncertainty_score":0.019963443},"labels":[],"label_agreement":null},{"id":"W4403842812","doi":"10.1007/978-3-031-66708-4_5","title":"Intrusion Detection at the IoT Edge Using Federated Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Internet of Things; Intrusion detection system; Enhanced Data Rates for GSM Evolution; Intrusion; Artificial intelligence; Computer security; Geology","score_opus":0.016966311487333654,"score_gpt":0.23989749114837863,"score_spread":0.22293117966104498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403842812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12057652,0.00056237204,0.8669421,0.00027302688,0.00015900614,0.000089890316,0.00014306903,0.0046484317,0.00660555],"genre_scores_gemma":[0.8102636,0.00022751179,0.18327652,0.00018026264,0.00005832898,0.000050568902,0.00023193823,0.0000917361,0.005619504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959344,0.00006186063,0.000023648572,0.00011785368,0.00011500925,0.0000882196],"domain_scores_gemma":[0.99946684,0.00020536024,0.00004233336,0.00012351431,0.00012491415,0.00003715465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053281756,0.0006457536,0.00084383873,0.0007621043,0.0004428447,0.001175158,0.0012743383,0.0008535868,0.0020592816],"category_scores_gemma":[0.001135973,0.00021570905,0.00064802053,0.00057843456,0.00034517373,0.0018539593,0.0010974355,0.0009519841,0.0005416354],"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.00086261006,0.0006196625,0.006510636,0.000088208435,0.00017040932,0.0003423861,0.000115145594,0.16909452,0.027824461,0.008260272,0.0057587298,0.78035307],"study_design_scores_gemma":[0.00000948423,0.00011841903,0.00083541335,0.000009284181,0.000024920364,0.00014252085,0.000027118731,0.97762877,0.012865732,0.0071578408,0.0011700208,0.000010522061],"about_ca_topic_score_codex":0.0012398922,"about_ca_topic_score_gemma":0.001340579,"teacher_disagreement_score":0.0020592816,"about_ca_system_score_codex":0.00054075225,"about_ca_system_score_gemma":0.00042672642,"threshold_uncertainty_score":0.0068889856},"labels":[],"label_agreement":null},{"id":"W4403843329","doi":"10.1007/978-3-031-72640-8_2","title":"UPose3D: Uncertainty-Aware 3D Human Pose Estimation with Cross-view and Temporal Cues","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Ubisoft (Canada); Queen's University","funders":"","keywords":"Computer science; Pose; Estimation; Artificial intelligence; Computer vision","score_opus":0.01836764806563447,"score_gpt":0.28384137120790887,"score_spread":0.2654737231422744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403843329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028785306,0.0006515069,0.9762866,0.00006005189,0.00012566768,0.00007279033,0.0015389749,0.016606953,0.0017790115],"genre_scores_gemma":[0.06932473,0.00095367787,0.911589,0.00023568633,0.00011831018,0.0002256204,0.007693409,0.0038511923,0.0060083647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990029,0.00009253161,0.00003133917,0.00022729595,0.00056201057,0.000084004685],"domain_scores_gemma":[0.99950385,0.00016714814,0.00003167533,0.00014984036,0.000109532855,0.00003790737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005947588,0.002367974,0.0023972725,0.0011439938,0.00043405127,0.0019396417,0.0032498906,0.0014622359,0.0122306645],"category_scores_gemma":[0.0017550839,0.0016749232,0.0020666579,0.0013859827,0.0005694686,0.001813363,0.004439393,0.0016961851,0.0072192075],"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.00043445957,0.00014979223,0.0009888089,0.00043988027,0.00038305763,0.00031210482,0.00022505228,0.06697832,0.038758326,0.005577409,0.06381991,0.82193285],"study_design_scores_gemma":[0.000051425377,0.00012135927,0.0016814579,0.000072363066,0.00009265356,0.00088202173,0.00009613648,0.91581297,0.03332837,0.011413246,0.036315154,0.00013279163],"about_ca_topic_score_codex":0.0063036145,"about_ca_topic_score_gemma":0.012806346,"teacher_disagreement_score":0.0122306645,"about_ca_system_score_codex":0.00031653797,"about_ca_system_score_gemma":0.00084190554,"threshold_uncertainty_score":0.040915668},"labels":[],"label_agreement":null},{"id":"W4403844452","doi":"10.1007/978-3-031-72646-0_19","title":"DySeT: A Dynamic Masked Self-distillation Approach for Robust Trajectory Prediction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Trajectory; Distillation; Artificial intelligence; Chromatography","score_opus":0.008857785650474308,"score_gpt":0.19841353749304497,"score_spread":0.18955575184257065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403844452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007131906,0.00012890808,0.9878263,0.00005153003,0.00010112999,0.000026771646,0.00015462068,0.0028902048,0.0016886485],"genre_scores_gemma":[0.31058076,0.00023714463,0.67349255,0.00017580438,0.000107528365,0.00012491069,0.0010791834,0.0008012698,0.013400827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974436,0.00003425639,0.000010374296,0.00006366856,0.000114318835,0.000033004177],"domain_scores_gemma":[0.99975854,0.00008174752,0.000019432613,0.000060789294,0.00006200097,0.00001746851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003670739,0.0008682958,0.00096606655,0.00040785395,0.0005162536,0.00074887316,0.0018662454,0.0007887347,0.004768804],"category_scores_gemma":[0.00080370443,0.00047610502,0.00053190853,0.00055541453,0.0004690923,0.0012572914,0.0018814408,0.0012167587,0.0012227917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006365007,0.00014496998,0.00049408793,0.00013318568,0.00011498581,0.00013936071,0.000064810476,0.474713,0.029339353,0.02267583,0.010260231,0.4612837],"study_design_scores_gemma":[0.000006961587,0.000020037645,0.000034991994,0.000002041722,0.00000378317,0.00000973596,0.0000022163886,0.9941303,0.003258564,0.0016419793,0.000883683,0.0000057555894],"about_ca_topic_score_codex":0.0062475144,"about_ca_topic_score_gemma":0.007549813,"teacher_disagreement_score":0.0062475144,"about_ca_system_score_codex":0.00039414817,"about_ca_system_score_gemma":0.0011223124,"threshold_uncertainty_score":0.015953302},"labels":[],"label_agreement":null},{"id":"W4403844617","doi":"10.1007/978-3-031-72646-0_2","title":"Motion-Prior Contrast Maximization for Dense Continuous-Time Motion Estimation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Contrast (vision); Motion (physics); Motion estimation; Computer vision; Maximization; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.01075960469370327,"score_gpt":0.25728470372783435,"score_spread":0.24652509903413108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403844617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013409466,0.00014901276,0.99784803,0.000040936717,0.000013682143,0.0000074505238,0.000023444103,0.00008807572,0.0004884002],"genre_scores_gemma":[0.13060084,0.000901736,0.8617152,0.00013023612,0.00011448806,0.000106011365,0.00034806458,0.00033451105,0.0057489984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983275,0.00004266562,0.000008391662,0.000037269627,0.0000598844,0.000019078643],"domain_scores_gemma":[0.9992944,0.0004844499,0.00005148981,0.00006273206,0.00007746199,0.00002945643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004821295,0.00076818716,0.00076963875,0.00047160932,0.00018849417,0.0007267766,0.0009415698,0.0010086505,0.0027499644],"category_scores_gemma":[0.0030221646,0.0006745424,0.0006586302,0.0007341554,0.0005812623,0.0011034586,0.0014378964,0.0013567416,0.0008421908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002463806,0.00008869811,0.0003931879,0.0004078059,0.00012581021,0.00013553859,0.00009782844,0.52762467,0.057934828,0.048232958,0.005184374,0.35952792],"study_design_scores_gemma":[0.0000070300775,0.000019272566,0.00014479215,0.00001544395,0.000009630232,0.00008770229,0.000005116934,0.9815834,0.005405841,0.011104206,0.0016088947,0.000008670685],"about_ca_topic_score_codex":0.0021117015,"about_ca_topic_score_gemma":0.002655953,"teacher_disagreement_score":0.0027499644,"about_ca_system_score_codex":0.00042389892,"about_ca_system_score_gemma":0.0006997368,"threshold_uncertainty_score":0.0091995},"labels":[],"label_agreement":null},{"id":"W4403845528","doi":"10.1007/978-3-031-72980-5_18","title":"LATTE3D: Large-scale Amortized Text-To-Enhanced3D Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Scale (ratio); Amortized analysis; Programming language; Data structure; Cartography; Geography","score_opus":0.013318360696722313,"score_gpt":0.2753323516197688,"score_spread":0.2620139909230465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403845528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048217145,0.00044577642,0.90423286,0.00016603651,0.00046562182,0.00018770833,0.0016728379,0.05417296,0.03383453],"genre_scores_gemma":[0.117147885,0.00047733125,0.8130764,0.00042627184,0.00014448195,0.00042554518,0.006467548,0.021000873,0.040833697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929297,0.000060477716,0.00003319048,0.00010677451,0.00044028423,0.00006620732],"domain_scores_gemma":[0.99952877,0.00014620973,0.000019222049,0.00015015695,0.000120961304,0.000034812016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044797937,0.0019053855,0.0010607226,0.0010884207,0.00074200035,0.0021528353,0.0033268267,0.0010459283,0.09465959],"category_scores_gemma":[0.0012156431,0.00089986774,0.0015001984,0.00096292834,0.0006141809,0.0013078507,0.0032170927,0.0017333175,0.02209588],"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.0006979243,0.00019031629,0.00064238487,0.00088821497,0.00016618104,0.000574254,0.0003718711,0.06220623,0.112107754,0.04493845,0.14438856,0.6328279],"study_design_scores_gemma":[0.0002532113,0.0002772487,0.0004026481,0.000099702316,0.00007672078,0.0006234141,0.00018066018,0.5552595,0.12750283,0.045053825,0.27014184,0.00012849097],"about_ca_topic_score_codex":0.001809439,"about_ca_topic_score_gemma":0.0044049784,"teacher_disagreement_score":0.09465959,"about_ca_system_score_codex":0.00072629406,"about_ca_system_score_gemma":0.00083616923,"threshold_uncertainty_score":0.3166679},"labels":[],"label_agreement":null},{"id":"W4403852319","doi":"10.1007/978-3-031-73404-5","title":"Computer Vision – ECCV 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","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":"University of California, Los Angeles; University at Buffalo; Wuhan University; Tsinghua University; DeepMind; Harbin Institute of Technology; Universiteit van Amsterdam; Sun Yat-sen University; University of Science and Technology of China; National University of Singapore; University of Bristol; Northwestern University; York University; Korea Advanced Institute of Science and Technology; Shanghai Jiao Tong University; Zhejiang University; Hong Kong Baptist University; Microsoft Research; Nanjing University; Peking University; Baidu; California Institute of Technology; University of Illinois at Urbana-Champaign; National Taiwan University; University of Minnesota; University of Oxford","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence","score_opus":0.011947100520395092,"score_gpt":0.24193132055468078,"score_spread":0.22998422003428567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403852319","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00275671,0.047111265,0.30455694,0.003395942,0.016081486,0.0004120488,0.008252293,0.018503254,0.59893006],"genre_scores_gemma":[0.01391466,0.018616755,0.06808652,0.00078504725,0.001962959,0.00030586714,0.012095562,0.0040103677,0.8802224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990414,0.00009349301,0.000041175328,0.00018815599,0.0005627179,0.00007295964],"domain_scores_gemma":[0.99895406,0.00015398352,0.000038383885,0.0003317861,0.00042651204,0.00009525505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010722704,0.0027900245,0.001988829,0.0031640592,0.000571237,0.0035587738,0.002794612,0.0022614873,0.16191855],"category_scores_gemma":[0.0020547113,0.0009092011,0.0009818615,0.0034432379,0.0005848422,0.0025640554,0.0019495293,0.0025426757,0.14452736],"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.000033812998,0.000021069282,0.000036482616,0.00028293516,0.00003673199,0.000022435494,0.0000065677013,0.0018522262,0.0017503693,0.010675882,0.57611406,0.4091674],"study_design_scores_gemma":[0.000014514462,0.00004187333,0.00041819774,0.00017565391,0.000026714699,0.0002104043,0.000008455334,0.010244259,0.0030855914,0.017430076,0.9683211,0.000023206434],"about_ca_topic_score_codex":0.0031179222,"about_ca_topic_score_gemma":0.0037772001,"teacher_disagreement_score":0.16191855,"about_ca_system_score_codex":0.001540446,"about_ca_system_score_gemma":0.0011304962,"threshold_uncertainty_score":0.5416715},"labels":[],"label_agreement":null},{"id":"W4403866157","doi":"10.1007/978-3-031-73404-5_6","title":"Efficient Depth-Guided Urban View Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.014953167022950851,"score_gpt":0.23894923272115567,"score_spread":0.22399606569820482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403866157","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.0067877285,0.00016641128,0.9853077,0.000033052234,0.000026982985,0.000018263574,0.00017410604,0.001122091,0.0063636657],"genre_scores_gemma":[0.1965891,0.000521851,0.7881884,0.00010717264,0.000045514542,0.000067115296,0.00096857274,0.0005818244,0.012930523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998282,0.000017178374,0.000004076842,0.00002736591,0.00009586575,0.000027308815],"domain_scores_gemma":[0.9998902,0.000042254673,0.00000673392,0.000025757441,0.00002627839,0.000008921897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011055803,0.0008052395,0.0005626099,0.00043092252,0.00016890462,0.0007251363,0.0006846439,0.0005135488,0.008791167],"category_scores_gemma":[0.0003043825,0.00048902177,0.0005437943,0.0006105225,0.00020224182,0.00059901323,0.0013412429,0.00067196554,0.0027773122],"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.00030190518,0.000065047636,0.00040923842,0.00022106295,0.000075434196,0.00013340442,0.00015634518,0.18382375,0.22018084,0.01643547,0.00984545,0.5683521],"study_design_scores_gemma":[0.00003315005,0.000065230735,0.00039150013,0.000023792823,0.000023543611,0.0002839721,0.00007152916,0.9189251,0.05481958,0.009228691,0.016108913,0.000025008274],"about_ca_topic_score_codex":0.0011850958,"about_ca_topic_score_gemma":0.0028474687,"teacher_disagreement_score":0.008791167,"about_ca_system_score_codex":0.00027432753,"about_ca_system_score_gemma":0.00034631946,"threshold_uncertainty_score":0.029409409},"labels":[],"label_agreement":null},{"id":"W4403887899","doi":"10.1007/978-3-031-72949-2_7","title":"Adapt Without Forgetting: Distill Proximity from Dual Teachers in Vision-Language Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Forgetting; Dual (grammatical number); Artificial intelligence; Human–computer interaction; Computer vision; Natural language processing; Computer graphics (images); Cognitive science; Cognitive psychology; Linguistics; Psychology","score_opus":0.019252993986826096,"score_gpt":0.2673125237435382,"score_spread":0.2480595297567121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403887899","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.065316446,0.0014680141,0.9263698,0.00040832438,0.00019495853,0.000074102,0.0003446231,0.0034821471,0.0023416283],"genre_scores_gemma":[0.742251,0.00062657497,0.24519522,0.0005460202,0.00018203842,0.00013600363,0.0015581097,0.0005876771,0.008917452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991179,0.00018018643,0.000030404313,0.0004427138,0.00010841069,0.00012040838],"domain_scores_gemma":[0.99875915,0.0006833407,0.0000661131,0.00022674563,0.00014560309,0.000119038654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010779266,0.0011972369,0.0015434758,0.0009029231,0.0005633571,0.0012635624,0.002578453,0.0022845382,0.002989102],"category_scores_gemma":[0.004306933,0.0008170553,0.0011270478,0.0010225544,0.000671179,0.0034470602,0.0032687539,0.0034533232,0.0016574741],"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.0010016833,0.0004371642,0.0026021674,0.00021343985,0.00019306495,0.00023736118,0.00045697752,0.1649893,0.011463991,0.006075841,0.0077968487,0.80453223],"study_design_scores_gemma":[0.000024862864,0.000107033484,0.00040516682,0.000019548708,0.000037803282,0.00006605578,0.00006126378,0.985113,0.0037225399,0.009553115,0.00087256724,0.000016964688],"about_ca_topic_score_codex":0.009232092,"about_ca_topic_score_gemma":0.013592068,"teacher_disagreement_score":0.009232092,"about_ca_system_score_codex":0.00071339105,"about_ca_system_score_gemma":0.0010633082,"threshold_uncertainty_score":0.01835674},"labels":[],"label_agreement":null},{"id":"W4403888028","doi":"10.1007/978-3-031-72907-2_26","title":"Preventing Catastrophic Forgetting Through Memory Networks in Continuous Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Vector Institute; University of British Columbia","funders":"","keywords":"Forgetting; Computer science; Artificial intelligence; Cognitive psychology","score_opus":0.01371415293937284,"score_gpt":0.24015338899674418,"score_spread":0.22643923605737135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403888028","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.05943124,0.0016989768,0.93530226,0.00028165107,0.00019724034,0.000040437317,0.00006379703,0.0016377933,0.0013466005],"genre_scores_gemma":[0.8756933,0.0006541676,0.11729147,0.00033475974,0.00018728063,0.000064107786,0.00014920766,0.00017102812,0.005454621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950004,0.00008169,0.000027080869,0.00018977633,0.00010323383,0.0000982634],"domain_scores_gemma":[0.9953667,0.0031602243,0.00029797884,0.0005360617,0.00044146442,0.00019757957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012404952,0.0008986309,0.0015195415,0.00063322316,0.00046448573,0.00093952386,0.0024399466,0.0017799032,0.0019160003],"category_scores_gemma":[0.006830894,0.000589158,0.00046312844,0.00050300703,0.00095571514,0.0023904457,0.0019429374,0.0022244935,0.00052120734],"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.0007855153,0.0003146296,0.0019753256,0.00028836538,0.00016143317,0.0002545561,0.0001569259,0.3178259,0.018021675,0.012538568,0.0063774358,0.64129966],"study_design_scores_gemma":[0.00001052848,0.0000727793,0.00020988553,0.000012161923,0.000025467567,0.00008210226,0.000009881069,0.9866067,0.0049916296,0.0076735686,0.00029582324,0.000009467236],"about_ca_topic_score_codex":0.0030280466,"about_ca_topic_score_gemma":0.0036540749,"teacher_disagreement_score":0.0030280466,"about_ca_system_score_codex":0.00062917906,"about_ca_system_score_gemma":0.0007776094,"threshold_uncertainty_score":0.006560445},"labels":[],"label_agreement":null},{"id":"W4403888124","doi":"10.1007/978-3-031-72907-2_21","title":"Fast Training of Diffusion Transformer with Extreme Masking for 3D Point Clouds Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical measurement and interference techniques","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Electrical engineering; Voltage","score_opus":0.06855035676778706,"score_gpt":0.2634444789608153,"score_spread":0.19489412219302824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403888124","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.0124927815,0.00015280819,0.98545307,0.000049983202,0.00004220117,0.000024342637,0.000046868707,0.0008516579,0.00088628486],"genre_scores_gemma":[0.39480954,0.0002734667,0.6006144,0.000121707766,0.00004153048,0.000093284376,0.00045381996,0.00016672867,0.0034255767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997905,0.00003522601,0.00001113775,0.000044297863,0.00008522488,0.00003364278],"domain_scores_gemma":[0.99967444,0.00015488722,0.00001993241,0.000050246264,0.00007730463,0.000023245371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035324052,0.00059223734,0.00047251696,0.00036396948,0.00022278397,0.00035673744,0.0008188562,0.00074195827,0.0043872246],"category_scores_gemma":[0.0009932294,0.00035195108,0.00051152334,0.00040264777,0.00023558844,0.0006572483,0.0010270395,0.0008544958,0.0013860031],"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.0005343643,0.000089417736,0.00074293074,0.000118389224,0.00004933875,0.00009395749,0.000069639864,0.09644949,0.099233136,0.004961502,0.0034006373,0.7942573],"study_design_scores_gemma":[0.0000120873265,0.000057182067,0.00025190486,0.0000073630185,0.000010230439,0.0000846855,0.000008686958,0.975392,0.021814715,0.0011713406,0.0011817857,0.000007984269],"about_ca_topic_score_codex":0.0021648812,"about_ca_topic_score_gemma":0.002882118,"teacher_disagreement_score":0.0043872246,"about_ca_system_score_codex":0.00024142445,"about_ca_system_score_gemma":0.0005853611,"threshold_uncertainty_score":0.01467675},"labels":[],"label_agreement":null},{"id":"W4403888359","doi":"10.1007/978-3-031-73116-7_13","title":"SIMBA: Split Inference—Mechanisms, Benchmarks and Attacks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Inference; Artificial intelligence","score_opus":0.021815219714284996,"score_gpt":0.2706025872241652,"score_spread":0.2487873675098802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403888359","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.08820268,0.005238746,0.7690907,0.0048578293,0.0011212924,0.0007205454,0.004448664,0.07551119,0.05080839],"genre_scores_gemma":[0.5468999,0.0013779743,0.42117238,0.0018173397,0.0004023538,0.00057279615,0.004863736,0.0086090965,0.0142844645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97811836,0.0088651115,0.0011585084,0.0020868152,0.0076130275,0.0021582209],"domain_scores_gemma":[0.95991194,0.018575996,0.0009677944,0.016004244,0.0036410834,0.00089898746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01617148,0.00193615,0.0021322619,0.0021907256,0.002719265,0.0054911855,0.0067716176,0.003490551,0.016842403],"category_scores_gemma":[0.040534936,0.0016824235,0.0017726945,0.003976934,0.004256539,0.01574324,0.006941908,0.0062142177,0.005310883],"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.006279089,0.0017443743,0.0057135858,0.001341127,0.00044241914,0.00019166472,0.00060612493,0.10752022,0.009441035,0.32477123,0.17445673,0.36749235],"study_design_scores_gemma":[0.00045308264,0.00047451965,0.0007344662,0.00021144317,0.00018126253,0.00031039523,0.00032205693,0.6853325,0.03157355,0.24091147,0.039383374,0.000111938636],"about_ca_topic_score_codex":0.0049392977,"about_ca_topic_score_gemma":0.0058720205,"teacher_disagreement_score":0.016842403,"about_ca_system_score_codex":0.0038157876,"about_ca_system_score_gemma":0.0070825825,"threshold_uncertainty_score":0.08552402},"labels":[],"label_agreement":null},{"id":"W4403888467","doi":"10.1007/978-3-031-73039-9_26","title":"Domain Generalization of 3D Object Detection by Density-Resampling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Generalization; Resampling; Domain (mathematical analysis); Artificial intelligence; Object (grammar); Computer vision; Pattern recognition (psychology); Mathematics","score_opus":0.013477136404197699,"score_gpt":0.25189822309172627,"score_spread":0.23842108668752857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403888467","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.010189115,0.00023911058,0.98762566,0.0000782958,0.000038289156,0.00002680685,0.0000742404,0.00047457858,0.0012538175],"genre_scores_gemma":[0.31914583,0.0008589769,0.6731369,0.0002592968,0.00014329415,0.000100371144,0.00073343446,0.00029543036,0.0053265654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995602,0.00011247898,0.0000181708,0.00010921212,0.00015820698,0.00004172464],"domain_scores_gemma":[0.9990808,0.00037031772,0.000064615575,0.00025875802,0.00018697814,0.00003850906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009810667,0.0006095942,0.0010831496,0.0010900736,0.00024960705,0.0006709117,0.0011841807,0.000823795,0.002259127],"category_scores_gemma":[0.0025227654,0.0005174305,0.0013581979,0.0008784613,0.00062002684,0.0008225071,0.0013438424,0.00095995225,0.00088599185],"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.0002659144,0.00014393433,0.001286433,0.00035796734,0.00017501686,0.00018604791,0.00016544004,0.3200899,0.06332711,0.040916964,0.006301052,0.56678414],"study_design_scores_gemma":[0.000003849521,0.000020232641,0.0005085353,0.0000061984156,0.000009519382,0.00011011227,0.000008107096,0.98605144,0.003749527,0.008250624,0.0012699665,0.000011846226],"about_ca_topic_score_codex":0.0041867765,"about_ca_topic_score_gemma":0.0036257694,"teacher_disagreement_score":0.0041867765,"about_ca_system_score_codex":0.0006245667,"about_ca_system_score_gemma":0.00053329085,"threshold_uncertainty_score":0.008324802},"labels":[],"label_agreement":null},{"id":"W4403888851","doi":"10.1007/978-3-031-73039-9_4","title":"MEERKAT: Audio-Visual Large Language Model for Grounding in Space and Time","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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 Toronto","funders":"","keywords":"Computer science; Audio visual; Ground; Space (punctuation); Speech recognition; Computer graphics (images); Electrical engineering; Multimedia; Operating system; Engineering","score_opus":0.014323516536008996,"score_gpt":0.2710715640374734,"score_spread":0.2567480475014644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403888851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025713744,0.00034015713,0.898835,0.00023730246,0.00019999935,0.00008462861,0.008244393,0.08727784,0.0022092196],"genre_scores_gemma":[0.107641354,0.00043363933,0.8269971,0.00048725927,0.00013159007,0.0004647118,0.032016337,0.017174836,0.01465317],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993237,0.00012064724,0.000058318714,0.00021329414,0.00021868694,0.00006520849],"domain_scores_gemma":[0.99903905,0.00039202382,0.00004904101,0.00024325209,0.00022578752,0.000050870673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007980711,0.0017940531,0.0011062009,0.0008020947,0.0005083491,0.0020369561,0.0028565177,0.0015187141,0.02602671],"category_scores_gemma":[0.003719029,0.0010692603,0.0019454678,0.0010574864,0.00054891803,0.0032640223,0.0016037761,0.002589538,0.015770217],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016796169,0.00022797314,0.0009873934,0.00080747757,0.00024495387,0.0003226907,0.00031085731,0.12072529,0.027933398,0.048733022,0.21756919,0.5804582],"study_design_scores_gemma":[0.00016660479,0.000072543364,0.00020212814,0.000049643822,0.00006071222,0.00009885327,0.00004728994,0.89615524,0.015591675,0.0439365,0.04356364,0.00005514284],"about_ca_topic_score_codex":0.013563183,"about_ca_topic_score_gemma":0.016516455,"teacher_disagreement_score":0.02602671,"about_ca_system_score_codex":0.0010693703,"about_ca_system_score_gemma":0.0013841189,"threshold_uncertainty_score":0.08706796},"labels":[],"label_agreement":null},{"id":"W4403889650","doi":"10.1007/978-3-031-73741-1_21","title":"AI and Democratic Equality: How Surveillance Capitalism and Computational Propaganda Threaten Democracy","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Democracy; Capitalism; Computer science; Political science; Law; Politics","score_opus":0.029832028400276732,"score_gpt":0.3201069484158391,"score_spread":0.2902749200155624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403889650","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.06320216,0.0033187487,0.056935836,0.05783123,0.00069258065,0.00005120903,0.000041317995,0.00017429319,0.81775254],"genre_scores_gemma":[0.9668232,0.0007428256,0.0056824186,0.0028426403,0.00026670896,0.00006556461,0.000023077124,0.00008568436,0.023467803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99067545,0.0061969575,0.0001784071,0.00073721027,0.001441367,0.00077053165],"domain_scores_gemma":[0.98146504,0.013911427,0.000989164,0.001876579,0.0009052467,0.0008526891],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.009098337,0.00040443076,0.0004566486,0.0012755339,0.005368913,0.013693451,0.0015194786,0.003378007,0.012831672],"category_scores_gemma":[0.016371405,0.00032788457,0.00053743616,0.001130927,0.027241947,0.014194754,0.009313923,0.0062818862,0.0013119209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075516577,0.000011405023,0.0001754612,0.000014225192,0.0000029690132,0.00004586198,0.0020927484,0.0004000309,0.00008343342,0.9909071,0.0013132162,0.004946035],"study_design_scores_gemma":[0.0000130541175,0.000012548695,0.00031249312,0.000097450466,0.0000059251424,0.00006770628,0.0019708583,0.0021942325,0.00038247736,0.95413446,0.040794183,0.000014646308],"about_ca_topic_score_codex":0.001843369,"about_ca_topic_score_gemma":0.0019320319,"teacher_disagreement_score":0.9946311,"about_ca_system_score_codex":0.0039966945,"about_ca_system_score_gemma":0.0024463069,"threshold_uncertainty_score":0.04811716},"labels":[],"label_agreement":null},{"id":"W4403889654","doi":"10.1007/978-3-031-72754-2_7","title":"Active Coarse-to-Fine Segmentation of Moveable Parts from Real Images","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","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":"","keywords":"Computer science; Computer vision; Artificial intelligence; Segmentation; Image segmentation; Computer graphics (images); Pattern recognition (psychology)","score_opus":0.016770745282669752,"score_gpt":0.2439766510671669,"score_spread":0.22720590578449715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403889654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018162474,0.00082736,0.97652155,0.00008816845,0.00005219341,0.00005559839,0.00014605373,0.0014119543,0.0027347156],"genre_scores_gemma":[0.24634513,0.0013369357,0.73870575,0.000149487,0.00011442169,0.000096961565,0.000941318,0.00077251403,0.011537556],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979097,0.000019008909,0.000010118273,0.00006269188,0.00008136703,0.00003584589],"domain_scores_gemma":[0.9996853,0.00012775684,0.000031723557,0.00008975924,0.000047150457,0.000018318822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035321544,0.0008117402,0.0011429192,0.0010880257,0.00028540092,0.0012604125,0.0012435693,0.0011208423,0.0035413424],"category_scores_gemma":[0.0006846994,0.0008172671,0.0008610282,0.0010689915,0.00068205554,0.000929114,0.0010626526,0.00080532045,0.00141867],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033387865,0.00010046049,0.0003727498,0.00042666317,0.00008165557,0.00017357386,0.00018054094,0.07109591,0.27436316,0.0070556947,0.0040440024,0.6417717],"study_design_scores_gemma":[0.00001958437,0.00012633247,0.0022879334,0.00005491551,0.000055410965,0.00046498503,0.00004986181,0.8761109,0.0984554,0.0123599265,0.009979536,0.000035181267],"about_ca_topic_score_codex":0.0017746378,"about_ca_topic_score_gemma":0.0037968378,"teacher_disagreement_score":0.0035413424,"about_ca_system_score_codex":0.00042901377,"about_ca_system_score_gemma":0.0004990715,"threshold_uncertainty_score":0.011847019},"labels":[],"label_agreement":null},{"id":"W4403889664","doi":"10.1007/978-3-031-73741-1_15","title":"Model Driven Development for AI-Based Healthcare Systems: A Review","year":2024,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"University of Limerick; Science Foundation Ireland","keywords":"Computer science; Health care; Healthcare system; Development (topology); Artificial intelligence; Software engineering","score_opus":0.3259531644663474,"score_gpt":0.5411854786226167,"score_spread":0.21523231415626926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403889664","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011870038,0.996567,0.0015834924,0.00031952607,0.00011786845,0.00002246493,0.000022527123,0.000017654615,0.0012308072],"genre_scores_gemma":[0.0016677908,0.9957995,0.0019419987,0.00019308657,0.00006613688,0.00003320656,0.000048344387,0.000008274978,0.00024166018],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834204,0.0004799015,0.00028570325,0.00019511086,0.00062553,0.000071673785],"domain_scores_gemma":[0.99306786,0.00546355,0.00037311972,0.00015734242,0.00084737,0.00009078507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028958127,0.0010558099,0.0014466096,0.0037763226,0.00035128655,0.0019533136,0.0015367944,0.0017605367,0.0031997368],"category_scores_gemma":[0.006348152,0.0006655196,0.0012210028,0.0051961867,0.0008483289,0.0019363969,0.0011400996,0.0016258268,0.0014978203],"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.000043989286,0.00008414079,0.00027456414,0.06994424,0.00024732592,0.00017943872,0.00027301474,0.0025081534,0.00070009276,0.01904781,0.015921135,0.8907761],"study_design_scores_gemma":[0.000026891226,0.00011937003,0.0007012548,0.041328095,0.0003250026,0.0008636455,0.00019045228,0.0010352697,0.00076057325,0.008944802,0.9456529,0.000051732022],"about_ca_topic_score_codex":0.0031588927,"about_ca_topic_score_gemma":0.0022833245,"teacher_disagreement_score":0.0037763226,"about_ca_system_score_codex":0.001584808,"about_ca_system_score_gemma":0.0039436887,"threshold_uncertainty_score":0.015314698},"labels":[],"label_agreement":null},{"id":"W4403889819","doi":"10.1007/978-3-031-72754-2_3","title":"Federated Learning with Local Openset Noisy Labels","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","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":"Vector Institute; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.014118104488706065,"score_gpt":0.25032610768997604,"score_spread":0.23620800320126997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403889819","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.031944193,0.00055583654,0.94175464,0.0009456095,0.0006140846,0.00014655688,0.0019441441,0.017338734,0.0047561885],"genre_scores_gemma":[0.38374624,0.00030039359,0.5842248,0.0007196343,0.00048965844,0.00038973877,0.010469504,0.001973688,0.017686276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627364,0.0009287188,0.00020053067,0.0011944791,0.0010391749,0.0003635466],"domain_scores_gemma":[0.9916524,0.002477754,0.0002287962,0.0042152996,0.0011835413,0.00024223798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004178901,0.0013734414,0.002334827,0.0016276885,0.0014750719,0.003489168,0.0040715933,0.003408053,0.009027371],"category_scores_gemma":[0.017988872,0.00081469334,0.0016964589,0.002338877,0.0018137824,0.008717464,0.007281849,0.0036507675,0.0050738254],"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.0016153526,0.00069576496,0.0029767475,0.00030090028,0.00021756264,0.00031005894,0.00023222144,0.14020471,0.0062050065,0.030265369,0.051736534,0.76523983],"study_design_scores_gemma":[0.000054703214,0.00009169518,0.00027205123,0.000040523315,0.000033673597,0.0001391061,0.00008941794,0.8922162,0.00714038,0.09342881,0.0064666504,0.000026648375],"about_ca_topic_score_codex":0.003006202,"about_ca_topic_score_gemma":0.004686053,"teacher_disagreement_score":0.009027371,"about_ca_system_score_codex":0.0014793862,"about_ca_system_score_gemma":0.0024587181,"threshold_uncertainty_score":0.030199528},"labels":[],"label_agreement":null},{"id":"W4403890080","doi":"10.1007/978-3-031-73741-1_6","title":"From Data Science to Modular Workflows Changing Perspectives from Data to Platform: DBDIrl 1864-1922 Case Study","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Science Foundation Ireland","keywords":"Computer science; Workflow; Modular design; Data science; Software engineering; Database; Programming language","score_opus":0.23131866648440286,"score_gpt":0.4065631542752794,"score_spread":0.17524448779087654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403890080","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.523228,0.0012089219,0.26073387,0.0284646,0.00063541,0.0023800556,0.026593037,0.023890212,0.13286583],"genre_scores_gemma":[0.5116968,0.0005468417,0.41346648,0.002431873,0.000105827516,0.0010437204,0.027555559,0.0059823724,0.03717053],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9898363,0.0037020538,0.00072021,0.0016956611,0.0030988124,0.0009469375],"domain_scores_gemma":[0.9859509,0.005296301,0.0005839885,0.0037250523,0.0027942543,0.001649464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01650179,0.000552854,0.00040649596,0.0029592363,0.003813778,0.00677317,0.0033753724,0.0018687476,0.006641122],"category_scores_gemma":[0.01945154,0.0006058926,0.00082917546,0.004497609,0.004198199,0.005727742,0.0070202337,0.0027531872,0.0035765944],"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.0011508919,0.0016253751,0.078826904,0.0017844206,0.00014242163,0.026904285,0.111401156,0.018864011,0.021439519,0.16846773,0.21205297,0.35734037],"study_design_scores_gemma":[0.00010691341,0.00014897119,0.01571115,0.000536317,0.00004234518,0.0032988368,0.039172344,0.019878337,0.017059386,0.021132095,0.8826994,0.00021392686],"about_ca_topic_score_codex":0.042634092,"about_ca_topic_score_gemma":0.045905635,"teacher_disagreement_score":0.042634092,"about_ca_system_score_codex":0.006659449,"about_ca_system_score_gemma":0.0067485753,"threshold_uncertainty_score":0.0872708},"labels":[],"label_agreement":null},{"id":"W4403905747","doi":"10.1007/978-3-031-74138-8_14","title":"Understanding Player Experience in Museum-Based Learning Games: A Mixed-Methods Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia; Artificial intelligence","score_opus":0.09414835152439507,"score_gpt":0.39484145926857495,"score_spread":0.3006931077441799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403905747","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.96014595,0.0004564034,0.033465233,0.000076987955,0.000021924165,0.0014437811,0.00059556,0.00006575797,0.0037284198],"genre_scores_gemma":[0.95395607,0.00027520777,0.038412742,0.000101368496,0.000014520385,0.0033060054,0.0007369248,0.000105034065,0.0030921719],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99172896,0.005359474,0.00041074958,0.00094278087,0.0011661435,0.00039186524],"domain_scores_gemma":[0.9395017,0.053772796,0.0013619472,0.0012685255,0.0036430843,0.000451854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0140460115,0.0007723954,0.0011087148,0.0021020041,0.0011332484,0.0043518203,0.0017597316,0.00094679237,0.004156992],"category_scores_gemma":[0.036277995,0.0005083561,0.001589029,0.001557783,0.0010099688,0.0024453795,0.002288808,0.0011232359,0.0005043621],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006777788,0.0066640335,0.27281255,0.0043848893,0.0027163506,0.0003615885,0.2939788,0.0037078713,0.010428125,0.008045445,0.0032477549,0.3868748],"study_design_scores_gemma":[0.00059585884,0.0070828353,0.6891309,0.0016706017,0.002967334,0.00059179554,0.22832231,0.033468775,0.01142333,0.011473498,0.012919641,0.00035312897],"about_ca_topic_score_codex":0.0041685714,"about_ca_topic_score_gemma":0.006563895,"teacher_disagreement_score":0.0140460115,"about_ca_system_score_codex":0.0012684858,"about_ca_system_score_gemma":0.0014608352,"threshold_uncertainty_score":0.0742833},"labels":[],"label_agreement":null},{"id":"W4403905949","doi":"10.1007/978-3-031-73033-7_26","title":"Image-to-Lidar Relational Distillation for Autonomous Driving Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Mila - Quebec Artificial Intelligence Institute; University of Toronto","funders":"","keywords":"Computer science; Distillation; Lidar; Relational database; Computer vision; Artificial intelligence; Image (mathematics); Data mining; Remote sensing; Geology","score_opus":0.021682504429758314,"score_gpt":0.2635158679159067,"score_spread":0.2418333634861484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403905949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024289036,0.00078930776,0.9449189,0.00027692382,0.0003037051,0.00013864168,0.0023887367,0.01826184,0.0086329365],"genre_scores_gemma":[0.35781956,0.0007410579,0.6062262,0.0003200724,0.00017896073,0.00019127293,0.009595284,0.001208391,0.023719195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968207,0.000023681432,0.00002093186,0.00009400111,0.00013358062,0.00004569332],"domain_scores_gemma":[0.9996934,0.00006229189,0.000012450801,0.00014434419,0.000073385614,0.0000141849405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032374068,0.00083362625,0.00060868246,0.00064928253,0.0007039665,0.0013724648,0.0017981387,0.0006120285,0.01358723],"category_scores_gemma":[0.0010399548,0.00044951035,0.0006319956,0.00142056,0.00043870544,0.0023549506,0.0024820864,0.0013029018,0.0048156357],"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.00025658947,0.00025690728,0.0010057935,0.00027218973,0.00010543364,0.00021161276,0.00018082945,0.05608668,0.032786883,0.03164128,0.027289335,0.8499063],"study_design_scores_gemma":[0.000041242532,0.000116080606,0.0010413256,0.00004005056,0.000058943595,0.0002708255,0.00018995606,0.8371187,0.07448868,0.046670534,0.039903753,0.000059961305],"about_ca_topic_score_codex":0.0073398342,"about_ca_topic_score_gemma":0.015197374,"teacher_disagreement_score":0.01358723,"about_ca_system_score_codex":0.0005049805,"about_ca_system_score_gemma":0.0011777843,"threshold_uncertainty_score":0.045453846},"labels":[],"label_agreement":null},{"id":"W4403906320","doi":"10.1007/978-3-031-74138-8","title":"Serious Games","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universiteit Hasselt; Aristotle University of Thessaloniki; Bauhaus-Universität Weimar; Universidad de Costa Rica; Universidad Politécnica de Madrid; Iowa State University; Universität Wien; Universidad Complutense de Madrid; Universität Potsdam; Griffith University; York University; Technische Universität Darmstadt; Staffordshire University; Trinity College Dublin; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Carnegie Mellon University; Brown University","keywords":"Computer science","score_opus":0.017933485494074225,"score_gpt":0.3153160663400234,"score_spread":0.29738258084594915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403906320","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015625699,0.0010082938,0.030103574,0.0005429134,0.0005679881,0.00014473125,0.0006422445,0.0029951471,0.9624325],"genre_scores_gemma":[0.006579944,0.0008214006,0.007398086,0.00020308573,0.00005405163,0.00007217879,0.00089142635,0.00036809864,0.98361176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998115,0.000020604133,0.00000670966,0.000033041346,0.000104827996,0.000023344448],"domain_scores_gemma":[0.99984276,0.000027152257,0.000005902276,0.000027732127,0.0000461118,0.000050182694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018815303,0.001270029,0.00040673435,0.0008379814,0.00066643395,0.0019912184,0.00095669896,0.0007795198,0.22358732],"category_scores_gemma":[0.00081134046,0.0003748787,0.0004031067,0.00056523393,0.00025687928,0.001722773,0.0016751328,0.0010571269,0.11931038],"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.00006532627,0.00013797612,0.000115430455,0.00013475357,0.000008490105,0.00006151144,0.00017997007,0.00074460445,0.001831877,0.07451511,0.5319729,0.39023212],"study_design_scores_gemma":[0.000012666912,0.000037326536,0.00032575344,0.00006597595,0.000004388816,0.0001372912,0.0000699575,0.0012544818,0.0006205843,0.026033118,0.97143066,0.000007838055],"about_ca_topic_score_codex":0.0016258175,"about_ca_topic_score_gemma":0.0057268054,"teacher_disagreement_score":0.22358732,"about_ca_system_score_codex":0.0004706568,"about_ca_system_score_gemma":0.0006829704,"threshold_uncertainty_score":0.7479741},"labels":[],"label_agreement":null},{"id":"W4403906474","doi":"10.1007/978-3-031-73033-7_5","title":"Improving Adversarial Transferability via Model Alignment","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Vector Institute; University of Toronto","funders":"","keywords":"Transferability; Computer science; Adversarial system; Artificial intelligence; Machine learning","score_opus":0.012804128661244363,"score_gpt":0.2440903831401785,"score_spread":0.23128625447893414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403906474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004877605,0.00020798604,0.9897968,0.00018393692,0.000071943956,0.000026001937,0.000044982582,0.0010722313,0.0037185722],"genre_scores_gemma":[0.62520695,0.0008546677,0.34796336,0.0007109642,0.00032648243,0.00027063146,0.00082295417,0.0016724598,0.022171374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845755,0.0005163394,0.000064345906,0.00033662992,0.00048050113,0.0001445552],"domain_scores_gemma":[0.9967163,0.001944037,0.00018862667,0.0008683342,0.00019012006,0.00009242791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018990528,0.0017235383,0.001395325,0.00081552257,0.00052815204,0.0012063023,0.002062451,0.0021121055,0.0068777655],"category_scores_gemma":[0.008163786,0.00078694645,0.0012149805,0.00090914307,0.0015923529,0.003491717,0.005466472,0.0043945806,0.002637173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016132699,0.00010438925,0.00025251083,0.00010496785,0.00009565966,0.00011350921,0.000062656574,0.7586004,0.011267353,0.074229665,0.0052465885,0.14976089],"study_design_scores_gemma":[0.0000060940597,0.000031720712,0.000059339796,0.000008941634,0.000010273548,0.000043314463,0.0000056940053,0.95140064,0.0031084702,0.04427881,0.001037781,0.000008861209],"about_ca_topic_score_codex":0.0008949494,"about_ca_topic_score_gemma":0.00070373766,"teacher_disagreement_score":0.0068777655,"about_ca_system_score_codex":0.0007689034,"about_ca_system_score_gemma":0.00060943764,"threshold_uncertainty_score":0.023008466},"labels":[],"label_agreement":null},{"id":"W4403906488","doi":"10.1007/978-3-031-73033-7_9","title":"Learning to Drive via Asymmetric Self-Play","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.00983572967448916,"score_gpt":0.23941293751926895,"score_spread":0.2295772078447798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403906488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09600129,0.00028959784,0.8482579,0.00041992863,0.00013710496,0.00006911166,0.000061196435,0.00048951386,0.054274414],"genre_scores_gemma":[0.9515278,0.00016409485,0.024391761,0.00007283984,0.000034164423,0.000086642365,0.000046723646,0.00004884889,0.023627246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988854,0.000025539897,0.000006692755,0.000027261905,0.000030865576,0.000021101212],"domain_scores_gemma":[0.999622,0.00022321015,0.000035509005,0.0000425217,0.000035403642,0.000041348518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027479872,0.00045713724,0.00029833138,0.00016352395,0.0002444222,0.00050241215,0.00062191155,0.00043313595,0.006726088],"category_scores_gemma":[0.0013710792,0.00020150174,0.00023755779,0.00012974534,0.00061814935,0.0008396079,0.0011316264,0.00089267426,0.00074389216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003331632,0.00019898277,0.0009251895,0.00018538401,0.00005751421,0.00015986474,0.00023855592,0.45947403,0.018076487,0.27201095,0.005116833,0.24322301],"study_design_scores_gemma":[0.000015300227,0.000089895526,0.00015219365,0.000011173183,0.000005669367,0.000058212037,0.000018855224,0.9288342,0.0017346427,0.0672896,0.0017834251,0.000006897885],"about_ca_topic_score_codex":0.00055080664,"about_ca_topic_score_gemma":0.00066400075,"teacher_disagreement_score":0.006726088,"about_ca_system_score_codex":0.0002637297,"about_ca_system_score_gemma":0.00027696314,"threshold_uncertainty_score":0.022500992},"labels":[],"label_agreement":null},{"id":"W4403922494","doi":"10.1007/978-3-031-73390-1_13","title":"MagicEraser: Erasing Any Objects via Semantics-Aware Control","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Semantics (computer science); Programming language","score_opus":0.008293065014605588,"score_gpt":0.24347012843863436,"score_spread":0.23517706342402878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403922494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017752828,0.0017111126,0.93280613,0.00033315222,0.0006679509,0.000106546846,0.00025393078,0.022346852,0.024021544],"genre_scores_gemma":[0.46812326,0.0019506275,0.4754092,0.0009067464,0.0003486922,0.00023341639,0.0009370216,0.005170414,0.046920512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990854,0.00007022675,0.000054529995,0.00020615883,0.00045468303,0.00012893218],"domain_scores_gemma":[0.99858034,0.00043215044,0.00009140383,0.00069254806,0.00015753288,0.00004607919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971811,0.0012172392,0.0008089688,0.0008965062,0.0006976225,0.0023813352,0.0022084771,0.0009491795,0.008579513],"category_scores_gemma":[0.002344805,0.00073376275,0.00072223763,0.000687683,0.0020805052,0.0061388835,0.0030034676,0.0021783777,0.0020321598],"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.0007392266,0.00020908969,0.000713675,0.000602629,0.0000849491,0.0004488432,0.00060228567,0.015490282,0.07862365,0.22987792,0.029844772,0.64276266],"study_design_scores_gemma":[0.0001219721,0.0002911018,0.00041433572,0.00020498218,0.00020047299,0.0009940023,0.00019651686,0.23308833,0.24015334,0.3787789,0.14537248,0.00018354422],"about_ca_topic_score_codex":0.0010252065,"about_ca_topic_score_gemma":0.0015094423,"teacher_disagreement_score":0.008579513,"about_ca_system_score_codex":0.00039297834,"about_ca_system_score_gemma":0.00071066635,"threshold_uncertainty_score":0.028701365},"labels":[],"label_agreement":null},{"id":"W4403939347","doi":"10.1007/978-3-031-73004-7_24","title":"Accelerating Online Mapping and Behavior Prediction via Direct BEV Feature Attention","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Machine learning","score_opus":0.03279462464547239,"score_gpt":0.2853607720970689,"score_spread":0.2525661474515965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403939347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037961714,0.00047412104,0.9512925,0.00019402438,0.00025607433,0.00006573699,0.0002585148,0.0063737994,0.0031234093],"genre_scores_gemma":[0.71244866,0.0004042837,0.2729065,0.0002970181,0.00014347113,0.000116409494,0.0010669676,0.00041499824,0.012201741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996301,0.000031739935,0.000009050462,0.00013583289,0.00010473015,0.00008847729],"domain_scores_gemma":[0.99941516,0.00024062906,0.000035410427,0.0001187626,0.00014664525,0.00004344634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039878275,0.0011101913,0.0015974005,0.0009417815,0.00039705524,0.00078639324,0.0015018486,0.00092079694,0.0042307237],"category_scores_gemma":[0.0019896708,0.000539885,0.0005839407,0.0010347215,0.00026853173,0.0013878563,0.0016377955,0.001318288,0.0024015424],"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.00027629963,0.0002931307,0.0024351391,0.00005474446,0.00006218458,0.00010224239,0.00004980482,0.053516783,0.020770703,0.0020363338,0.009199573,0.91120315],"study_design_scores_gemma":[0.000006929351,0.00004293693,0.0010008473,0.0000053117474,0.00001166048,0.000073233816,0.0000181604,0.98988557,0.005024321,0.0029643506,0.0009601273,0.000006555918],"about_ca_topic_score_codex":0.014804382,"about_ca_topic_score_gemma":0.014869111,"teacher_disagreement_score":0.014804382,"about_ca_system_score_codex":0.00046424623,"about_ca_system_score_gemma":0.0007773001,"threshold_uncertainty_score":0.02943647},"labels":[],"label_agreement":null},{"id":"W4403940973","doi":"10.1007/978-3-031-73226-3_16","title":"Model Breadcrumbs: Scaling Multi-task Model Merging with Sparse Masks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Scaling; Task (project management); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Geometry","score_opus":0.03907107415938375,"score_gpt":0.2588326428358412,"score_spread":0.21976156867645744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403940973","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.008108763,0.00037362453,0.9815756,0.0001872631,0.00018689413,0.0000932839,0.00023680039,0.007454699,0.001783074],"genre_scores_gemma":[0.16653103,0.00038901897,0.8213387,0.000464925,0.00020755334,0.00025801305,0.0018610511,0.0029663637,0.0059833317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.00017782122,0.0000491928,0.00026707136,0.00025559872,0.00011554319],"domain_scores_gemma":[0.99839824,0.00053743605,0.00007509822,0.00062524737,0.00024752828,0.00011645659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280567,0.0020031703,0.0021502862,0.0010046685,0.00090345106,0.002010611,0.0031222086,0.002045725,0.011145952],"category_scores_gemma":[0.005032686,0.0014319903,0.0021007403,0.0016921969,0.0006345602,0.003264433,0.0043128976,0.0030687952,0.0043853396],"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.0008443292,0.00029101365,0.0006942491,0.00025857636,0.0004090092,0.0002226862,0.00030744763,0.19259119,0.02995463,0.008459045,0.026133873,0.739834],"study_design_scores_gemma":[0.00003251174,0.000061146246,0.00015669882,0.0000121322755,0.00004185301,0.000059555856,0.000038730086,0.9783508,0.0061740945,0.011008718,0.0040425165,0.000021262449],"about_ca_topic_score_codex":0.013423682,"about_ca_topic_score_gemma":0.019925417,"teacher_disagreement_score":0.013423682,"about_ca_system_score_codex":0.00080948626,"about_ca_system_score_gemma":0.0016304478,"threshold_uncertainty_score":0.037286937},"labels":[],"label_agreement":null},{"id":"W4403940995","doi":"10.1007/978-3-031-73209-6_24","title":"Learning Equilibrium Transformation for Gamut Expansion and Color Restoration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Color Science and Applications","field":"Physics and Astronomy","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":"Vector Institute","funders":"","keywords":"Gamut; Computer science; Transformation (genetics); Artificial intelligence; Computer graphics (images); Computer vision","score_opus":0.014743404623522768,"score_gpt":0.2650789665681824,"score_spread":0.25033556194465967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403940995","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.01550398,0.00034974326,0.95142883,0.0004907531,0.00011432484,0.00004724079,0.00007201499,0.00038967223,0.031603407],"genre_scores_gemma":[0.5793229,0.0008511466,0.2885174,0.0005317343,0.00025041247,0.0002747096,0.00024398215,0.00083405257,0.12917371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975413,0.000078653415,0.000006787792,0.00005507398,0.00006575113,0.000039525254],"domain_scores_gemma":[0.99967384,0.00016175148,0.000022109913,0.00003734724,0.00006290424,0.000041925003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006127832,0.00058712816,0.000829042,0.00057171634,0.0005350681,0.0010362619,0.0011851839,0.0008909803,0.014875125],"category_scores_gemma":[0.002270081,0.00029583974,0.00064108026,0.0005356264,0.0015314645,0.0018758237,0.0015615439,0.0019448234,0.0016908088],"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.000058807578,0.00006505657,0.00009888122,0.00006960028,0.000014391172,0.000039826995,0.00009278468,0.034082886,0.0028505044,0.88472307,0.005193355,0.07271075],"study_design_scores_gemma":[0.000016456333,0.000024604333,0.00008467986,0.000013442892,0.000005848697,0.000041692714,0.000027349479,0.3493848,0.0009818677,0.6450294,0.004373074,0.000016723887],"about_ca_topic_score_codex":0.002136875,"about_ca_topic_score_gemma":0.0021843559,"teacher_disagreement_score":0.014875125,"about_ca_system_score_codex":0.00092388724,"about_ca_system_score_gemma":0.0006582789,"threshold_uncertainty_score":0.04976219},"labels":[],"label_agreement":null},{"id":"W4403941104","doi":"10.1007/978-981-97-9443-0_15","title":"Overview of the NLPCC 2024 Shared Task on Chinese Metaphor Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Language, Metaphor, and Cognition","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Metaphor; Task (project management); Linguistics; Systems engineering; Philosophy; Engineering","score_opus":0.03720169001192833,"score_gpt":0.310405091491613,"score_spread":0.2732034014796847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403941104","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039232425,0.007916669,0.55894136,0.0024271556,0.0015257895,0.007862898,0.050722305,0.05531969,0.27605167],"genre_scores_gemma":[0.16882649,0.0027711205,0.57304573,0.0013138254,0.000621353,0.013998204,0.14646484,0.008465327,0.08449316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856985,0.00040706588,0.00013028251,0.0003909545,0.0003358888,0.00016594655],"domain_scores_gemma":[0.9984888,0.00051544973,0.000036941048,0.0003781876,0.0003781548,0.00020250319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020280231,0.0027638634,0.0018250619,0.0018304329,0.0018269097,0.002942635,0.0029514972,0.0020290262,0.09396508],"category_scores_gemma":[0.004278168,0.0009969842,0.00095172593,0.0031239144,0.000722553,0.004694349,0.004475708,0.0020446205,0.043718733],"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.00086854753,0.00052332313,0.000878722,0.0019269862,0.00007685558,0.000376798,0.0010820114,0.0031989964,0.042360097,0.01677927,0.18452723,0.7474012],"study_design_scores_gemma":[0.0007155648,0.0008320149,0.010648415,0.00045889337,0.00015254685,0.0017238248,0.0012976242,0.0737545,0.07187489,0.073395275,0.7647465,0.00039998713],"about_ca_topic_score_codex":0.012494717,"about_ca_topic_score_gemma":0.01067737,"teacher_disagreement_score":0.09396508,"about_ca_system_score_codex":0.0014684015,"about_ca_system_score_gemma":0.0040901396,"threshold_uncertainty_score":0.31434453},"labels":[],"label_agreement":null},{"id":"W4403942480","doi":"10.1007/978-3-031-73209-6_6","title":"NamedCurves: Learned Image Enhancement via Color Naming","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"York University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Image (mathematics); Color image; Computer graphics (images); Image processing","score_opus":0.017165966679777826,"score_gpt":0.2915407921727593,"score_spread":0.2743748254929815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403942480","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.0059446367,0.00047811956,0.9531256,0.000103119855,0.0002705911,0.00008908676,0.00031843677,0.027228778,0.01244166],"genre_scores_gemma":[0.07700048,0.00090615585,0.8727633,0.00019094339,0.00015011821,0.00013767822,0.0016634592,0.005015376,0.042172506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996574,0.000037385893,0.000015007226,0.000111386,0.000134079,0.000044808512],"domain_scores_gemma":[0.99949515,0.000113062066,0.000030848816,0.00019596296,0.00011080685,0.00005409888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039256664,0.0012788073,0.00076363387,0.00086644647,0.00038321668,0.0012023832,0.0027043717,0.0007230847,0.03264945],"category_scores_gemma":[0.0010054987,0.0004819969,0.00085526437,0.001005891,0.0006872323,0.0024768678,0.0018032171,0.0012432236,0.01091082],"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.00030344602,0.00014121339,0.00017115392,0.00023644483,0.000026708636,0.00013321069,0.000071303766,0.006054509,0.069751024,0.019281304,0.031720757,0.8721089],"study_design_scores_gemma":[0.00011503008,0.00037091502,0.00086657086,0.000106234584,0.000080425576,0.0012378328,0.00012266453,0.3552683,0.3417006,0.06376602,0.2362325,0.00013295632],"about_ca_topic_score_codex":0.0015383111,"about_ca_topic_score_gemma":0.002122652,"teacher_disagreement_score":0.03264945,"about_ca_system_score_codex":0.00051119167,"about_ca_system_score_gemma":0.0005214849,"threshold_uncertainty_score":0.109223306},"labels":[],"label_agreement":null},{"id":"W4403943163","doi":"10.1007/978-981-97-8692-3_21","title":"Multi-prototype Co-saliency Model for Plant Disease Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological 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":"Carleton University","funders":"","keywords":"Computer science; Plant disease; Artificial intelligence; Computer graphics (images)","score_opus":0.030149157187459988,"score_gpt":0.242194044499459,"score_spread":0.212044887311999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403943163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09647801,0.0024866785,0.8934164,0.00038235378,0.00036831075,0.00010895331,0.0003020832,0.0018747805,0.004582524],"genre_scores_gemma":[0.9027299,0.00058533193,0.0893727,0.00016163374,0.00016684041,0.000083188424,0.00036729773,0.000105421095,0.006427632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998654,0.000013697886,0.0000060831953,0.000049827973,0.000034874654,0.000030010176],"domain_scores_gemma":[0.99975353,0.00006796432,0.000021522146,0.000024325256,0.00011008955,0.000022430046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034736632,0.0006424589,0.0008907659,0.00079496484,0.0002894596,0.00055624155,0.0013640026,0.00097015256,0.002196834],"category_scores_gemma":[0.0006683558,0.00030857802,0.0007867065,0.000663704,0.00022937109,0.0007583086,0.00054282666,0.0005984583,0.00064312294],"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.0006626308,0.0003403298,0.0021973294,0.00032400934,0.0002234585,0.000348175,0.00013199488,0.27244407,0.06574551,0.00480906,0.0068985377,0.64587486],"study_design_scores_gemma":[0.000004790085,0.00005141617,0.0005538128,0.0000031569025,0.000019084786,0.00005950903,0.000004559499,0.9959799,0.0022442972,0.00066434336,0.00040887322,0.000006194186],"about_ca_topic_score_codex":0.00850691,"about_ca_topic_score_gemma":0.009516087,"teacher_disagreement_score":0.00850691,"about_ca_system_score_codex":0.0006320074,"about_ca_system_score_gemma":0.0005492077,"threshold_uncertainty_score":0.016914845},"labels":[],"label_agreement":null},{"id":"W4403943301","doi":"10.1007/978-3-031-72973-7_3","title":"WeConvene: Learned Image Compression with Wavelet-Domain Convolution and Entropy Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Image compression; Wavelet; Convolution (computer science); Compression (physics); Entropy (arrow of time); Artificial intelligence; Algorithm; Image (mathematics); Image processing; Artificial neural network","score_opus":0.013091635755962167,"score_gpt":0.2565812821685409,"score_spread":0.24348964641257875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403943301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008164137,0.0006689035,0.9871454,0.0001429169,0.00009238557,0.000033620825,0.0001309541,0.0017576322,0.0018639658],"genre_scores_gemma":[0.23466216,0.0011241003,0.7471781,0.00026682997,0.0001925657,0.00013254299,0.0010523045,0.0007096657,0.014681732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997863,0.00003273107,0.000010275958,0.000039770108,0.000110321336,0.000020610787],"domain_scores_gemma":[0.9997211,0.000118693526,0.000018948793,0.0000688913,0.00005600406,0.000016304843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055917504,0.0005834333,0.00076786254,0.00057205564,0.00019014209,0.00071287114,0.0010409976,0.00079470687,0.0035903633],"category_scores_gemma":[0.0013693986,0.00025656307,0.00048302076,0.0006849859,0.0005237572,0.0013126814,0.0009858819,0.0012766516,0.0009818962],"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.00024668928,0.00009520528,0.00027297682,0.00011558048,0.00007398265,0.00012139142,0.000034823235,0.18844502,0.01870551,0.039101288,0.010549653,0.7422379],"study_design_scores_gemma":[0.0000074739346,0.00002381976,0.000076142656,0.0000067086066,0.0000062979716,0.000057136327,0.0000023714374,0.98286855,0.007615559,0.0074862405,0.0018435286,0.000006128836],"about_ca_topic_score_codex":0.0020513663,"about_ca_topic_score_gemma":0.0022024717,"teacher_disagreement_score":0.0035903633,"about_ca_system_score_codex":0.0004761168,"about_ca_system_score_gemma":0.00049379276,"threshold_uncertainty_score":0.012010992},"labels":[],"label_agreement":null},{"id":"W4403943776","doi":"10.1007/978-3-031-67695-6_1","title":"The ARCH-COMP Friendly Verification Competition for Continuous and Hybrid Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Arch; Engineering; Structural engineering","score_opus":0.017324553294924317,"score_gpt":0.2649090069582571,"score_spread":0.24758445366333276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403943776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007924654,0.0044655083,0.6248156,0.008334802,0.0038198137,0.00011512935,0.00064039754,0.0072318506,0.34265223],"genre_scores_gemma":[0.22876158,0.0031257328,0.26421836,0.0031044579,0.0023157883,0.00025196135,0.0017855348,0.0065904963,0.4898461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99639326,0.00079903356,0.00013273786,0.0003971615,0.0019630005,0.0003148397],"domain_scores_gemma":[0.9940777,0.0026279537,0.00009324166,0.0017191564,0.0010993612,0.00038262125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057607573,0.0009810219,0.0009364152,0.00092052104,0.0016710343,0.005909058,0.0022450052,0.0024817323,0.06099211],"category_scores_gemma":[0.007205335,0.0013839706,0.0015203056,0.0012880623,0.0023652362,0.0065426794,0.0039752065,0.006242442,0.020069182],"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.00029532544,0.000062429805,0.0001680696,0.00020052379,0.000023676503,0.00016352857,0.00021902709,0.0072531574,0.0027740218,0.7030381,0.13353893,0.15226322],"study_design_scores_gemma":[0.00007368328,0.00008848557,0.00029966727,0.00013828192,0.000018139435,0.00035818547,0.00009711716,0.054270048,0.0062722424,0.40191194,0.53641486,0.00005738361],"about_ca_topic_score_codex":0.0029251573,"about_ca_topic_score_gemma":0.0049128877,"teacher_disagreement_score":0.06099211,"about_ca_system_score_codex":0.0027452374,"about_ca_system_score_gemma":0.0025800266,"threshold_uncertainty_score":0.20403892},"labels":[],"label_agreement":null},{"id":"W4403944057","doi":"10.1007/978-3-031-67695-6_2","title":"Competition of Solvers for Constrained Horn Clauses (CHC-COMP 2023)","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Horn clause; Competition (biology); French horn; Programming language; Prolog","score_opus":0.02271042992580054,"score_gpt":0.25253397451806636,"score_spread":0.2298235445922658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403944057","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.022973197,0.0036809845,0.38713458,0.006663882,0.0038892406,0.0006120005,0.013254715,0.013545396,0.548246],"genre_scores_gemma":[0.22808205,0.0013149083,0.4122924,0.004356168,0.0011309594,0.0010477166,0.042799316,0.014005384,0.29497114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951391,0.0015088117,0.00023035865,0.0010404513,0.0014159451,0.000665282],"domain_scores_gemma":[0.99322903,0.0035218191,0.00014648178,0.0013081677,0.001229231,0.00056523195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044005304,0.0019296895,0.0017600409,0.0021190261,0.00205359,0.004580045,0.00447392,0.0031268646,0.18174265],"category_scores_gemma":[0.010781719,0.0016912831,0.0028800864,0.003695073,0.0015199714,0.005304936,0.0058002523,0.0051246136,0.036384188],"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.00072040095,0.0002241407,0.00037851694,0.0005404509,0.00012288845,0.00017973682,0.00018192195,0.009952843,0.0023325523,0.3388082,0.48019478,0.16636357],"study_design_scores_gemma":[0.0005355509,0.00018106734,0.00067067577,0.00026724263,0.00007739964,0.0004592635,0.00016732098,0.124731444,0.006798751,0.47149685,0.39450705,0.00010733586],"about_ca_topic_score_codex":0.005812653,"about_ca_topic_score_gemma":0.012940258,"teacher_disagreement_score":0.18174265,"about_ca_system_score_codex":0.0025997309,"about_ca_system_score_gemma":0.0037413,"threshold_uncertainty_score":0.6079898},"labels":[],"label_agreement":null},{"id":"W4403947296","doi":"10.1007/978-3-031-73247-8_10","title":"Intrinsic Single-Image HDR Reconstruction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer vision; Computer graphics (images); Artificial intelligence; Image (mathematics)","score_opus":0.014960113985878121,"score_gpt":0.24218485180645954,"score_spread":0.22722473782058142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403947296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004934355,0.00089936773,0.96121037,0.00008396626,0.00014121454,0.00003477334,0.00024283797,0.0013592116,0.031093916],"genre_scores_gemma":[0.09483926,0.0035366656,0.77132833,0.00018452291,0.0001734269,0.000046203906,0.0011299475,0.0011345134,0.12762713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998697,0.00000972967,0.0000051523452,0.00002603668,0.000077642704,0.000011836824],"domain_scores_gemma":[0.9997719,0.000045854234,0.000014780142,0.0000892368,0.00006670314,0.000011495099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022115857,0.0005536785,0.0004035673,0.00047589486,0.00015394548,0.00094031426,0.0006229877,0.00050577224,0.02396485],"category_scores_gemma":[0.00040773925,0.0003403515,0.0003481222,0.00047999102,0.00027102203,0.0011547541,0.0007042211,0.000733819,0.013407154],"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.00013928826,0.00006939937,0.00036704005,0.0005640792,0.00003993687,0.0002134235,0.00011082946,0.010964917,0.26357988,0.036909588,0.018717771,0.66832393],"study_design_scores_gemma":[0.00001803289,0.00015893033,0.0024238804,0.00016688733,0.000074432835,0.0053662043,0.00009276825,0.20061901,0.56635195,0.01875007,0.20591922,0.000058661284],"about_ca_topic_score_codex":0.0001311912,"about_ca_topic_score_gemma":0.0003438529,"teacher_disagreement_score":0.02396485,"about_ca_system_score_codex":0.00017310701,"about_ca_system_score_gemma":0.000219558,"threshold_uncertainty_score":0.08017039},"labels":[],"label_agreement":null},{"id":"W4403990638","doi":"10.1007/978-3-031-72986-7_4","title":"GSD: View-Guided Gaussian Splatting Diffusion for 3D Reconstruction","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Computer science; Computer graphics (images); Gaussian; Computer vision; Artificial intelligence; Physics","score_opus":0.016899877307910812,"score_gpt":0.23856084108667325,"score_spread":0.22166096377876243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403990638","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.0016662573,0.00020634642,0.9939797,0.00006838841,0.000051221534,0.000018546025,0.00012523757,0.0020914273,0.0017928345],"genre_scores_gemma":[0.04785069,0.0006256108,0.93603843,0.0001446781,0.00004395817,0.0000665531,0.00065192475,0.0016293821,0.012948743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975985,0.000022216382,0.000009392135,0.00003774668,0.00015366451,0.000017117432],"domain_scores_gemma":[0.99979717,0.000057497786,0.000013945403,0.00005393433,0.0000585105,0.000018904604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026973517,0.0008376265,0.000581768,0.0005487907,0.0002231592,0.0007941278,0.0011522049,0.00097227015,0.0079513015],"category_scores_gemma":[0.0006465427,0.0004618154,0.0006698961,0.00067031255,0.0005792627,0.0007839332,0.001355625,0.0012846434,0.0040148497],"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.00019681656,0.00008900462,0.00030778776,0.00027877055,0.00006371826,0.00014310477,0.00018742704,0.08467175,0.14494653,0.06234806,0.033700623,0.6730665],"study_design_scores_gemma":[0.000019085623,0.000037745307,0.00020243097,0.00002480483,0.000012846175,0.00029008457,0.00002117233,0.9044145,0.04611742,0.016524449,0.032300577,0.000034934845],"about_ca_topic_score_codex":0.0017647645,"about_ca_topic_score_gemma":0.0028216802,"teacher_disagreement_score":0.0079513015,"about_ca_system_score_codex":0.00051827607,"about_ca_system_score_gemma":0.0005343642,"threshold_uncertainty_score":0.026599705},"labels":[],"label_agreement":null},{"id":"W4403990800","doi":"10.1007/978-3-031-72986-7_25","title":"TIBET: Identifying and Evaluating Biases in Text-to-Image Generative Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of British Columbia","funders":"","keywords":"Computer science; Generative grammar; Image (mathematics); Artificial intelligence; Generative model; Natural language processing; Information retrieval","score_opus":0.0669570626640727,"score_gpt":0.353602100343215,"score_spread":0.2866450376791423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403990800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12512922,0.0026467822,0.8421901,0.00096079306,0.00041388604,0.0003661617,0.0030028035,0.019099602,0.00619074],"genre_scores_gemma":[0.63341546,0.00073165284,0.34505346,0.00078134757,0.00027362184,0.0005308156,0.009638886,0.0036599082,0.005914828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9965848,0.0021099758,0.00013659004,0.0004849465,0.0005227335,0.00016092752],"domain_scores_gemma":[0.96485627,0.031085199,0.00056191126,0.0019680322,0.0011615627,0.00036708088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009232542,0.001692334,0.0015775529,0.0018938619,0.00092288514,0.0029064382,0.0028991783,0.0027947568,0.005619152],"category_scores_gemma":[0.042192973,0.0009311536,0.0018080188,0.001774871,0.0013957289,0.003929481,0.0033614298,0.0039088926,0.0020756302],"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.00204642,0.00043159636,0.010704232,0.0006910111,0.00076733547,0.00023455912,0.00047313972,0.49469966,0.00428992,0.036004942,0.032462023,0.41719523],"study_design_scores_gemma":[0.000059830803,0.000052933152,0.00034870423,0.000028348884,0.000039027702,0.00003157246,0.000026777723,0.9706454,0.0013445201,0.026496587,0.00091385737,0.000012376163],"about_ca_topic_score_codex":0.008169123,"about_ca_topic_score_gemma":0.011053693,"teacher_disagreement_score":0.009232542,"about_ca_system_score_codex":0.0018742309,"about_ca_system_score_gemma":0.001540997,"threshold_uncertainty_score":0.048826873},"labels":[],"label_agreement":null},{"id":"W4403991999","doi":"10.1007/978-3-031-70058-3_15","title":"The Visual and Haptic Contributions to Hand and Foot Representation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Action Observation and Synchronization","field":"Psychology","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 Lethbridge","funders":"","keywords":"Computer science; Haptic technology; Foot (prosody); Representation (politics); Computer vision; Artificial intelligence; Computer graphics (images); Human–computer interaction; Art","score_opus":0.02533519149332886,"score_gpt":0.3468862607652435,"score_spread":0.3215510692719146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403991999","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.038512122,0.11702539,0.29873738,0.0047330987,0.004090659,0.000037248305,0.00042701254,0.00065590034,0.5357811],"genre_scores_gemma":[0.66018325,0.060934033,0.06449743,0.0009844879,0.004354922,0.000072977826,0.0004046295,0.00035032065,0.20821798],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998691,0.000023418466,0.000006727,0.000036197725,0.000049110502,0.000015521098],"domain_scores_gemma":[0.9993813,0.0004412328,0.000029644236,0.00005660203,0.00006191407,0.000029256626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003085801,0.00040767473,0.00027144456,0.0007248645,0.000304469,0.0026555476,0.00064767257,0.0009233843,0.012392979],"category_scores_gemma":[0.0021157528,0.00032790552,0.0002673393,0.00094934826,0.0018791157,0.0026745116,0.0008884485,0.0009759422,0.0011520123],"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.00022592823,0.000037608803,0.00040409606,0.0007212253,0.000035719604,0.0004006662,0.0010292653,0.00362864,0.03895304,0.45148197,0.011770869,0.491311],"study_design_scores_gemma":[0.000041084513,0.000117469404,0.007727264,0.00062001485,0.00007060498,0.0014985014,0.00073837367,0.018219855,0.016942125,0.77174294,0.18219005,0.00009176041],"about_ca_topic_score_codex":0.0010560649,"about_ca_topic_score_gemma":0.0015333805,"teacher_disagreement_score":0.012392979,"about_ca_system_score_codex":0.00029742118,"about_ca_system_score_gemma":0.00026850562,"threshold_uncertainty_score":0.041458607},"labels":[],"label_agreement":null},{"id":"W4403998237","doi":"10.1007/978-3-031-72691-0_19","title":"Distribution Alignment for Fully Test-Time Adaptation with Dynamic Online Data Streams","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Computer science; STREAMS; Adaptation (eye); Data stream mining; Test (biology); Data mining; Real-time computing; Operating system","score_opus":0.023398947009851134,"score_gpt":0.2651782063399808,"score_spread":0.24177925933012967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403998237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035576872,0.0002933858,0.9928878,0.000087186745,0.00007150492,0.000029125966,0.00013221386,0.0023207497,0.00062034803],"genre_scores_gemma":[0.3365031,0.00067099504,0.6459501,0.0004400495,0.00035911083,0.00037450372,0.00263753,0.0022157298,0.010848869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988053,0.00030600242,0.00007780289,0.0004135211,0.0002613466,0.00013605361],"domain_scores_gemma":[0.9967648,0.0020134402,0.000118728916,0.0005461108,0.00040701107,0.00014999342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021925734,0.0012807205,0.001661235,0.0008488459,0.00052885327,0.0010132128,0.0023058106,0.0015641811,0.0056731296],"category_scores_gemma":[0.008006084,0.00078012806,0.00083168864,0.0014617027,0.0008090983,0.0023658876,0.0026334517,0.0029878062,0.003936073],"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.0005676935,0.00018482831,0.000787127,0.00016162313,0.000113443224,0.00015940856,0.00011541193,0.15901342,0.016183576,0.0089360215,0.010373102,0.8034042],"study_design_scores_gemma":[0.000018403112,0.00003676737,0.00034975802,0.000010185482,0.000014421178,0.00007027286,0.000019715773,0.9809779,0.0047874786,0.011969364,0.0017301552,0.000015546831],"about_ca_topic_score_codex":0.0051371804,"about_ca_topic_score_gemma":0.0060305977,"teacher_disagreement_score":0.0056731296,"about_ca_system_score_codex":0.00072676275,"about_ca_system_score_gemma":0.0012986771,"threshold_uncertainty_score":0.018978536},"labels":[],"label_agreement":null},{"id":"W4403998266","doi":"10.1007/978-3-031-72691-0_5","title":"Non-parametric Sensor Noise Modeling and Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acoustic Wave Phenomena Research","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":"York University","funders":"","keywords":"Computer science; Noise (video); Parametric statistics; Parametric model; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.018724870475945923,"score_gpt":0.2402151826009717,"score_spread":0.22149031212502576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403998266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051370845,0.00030717612,0.99572504,0.000035790927,0.000055948396,0.0000086202435,0.00003668202,0.00019985718,0.0031171914],"genre_scores_gemma":[0.18644927,0.004642013,0.66745687,0.00021889717,0.00030922634,0.00022509207,0.0011201353,0.0010190727,0.13855939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965954,0.000048555485,0.000013392894,0.000058449023,0.00020623993,0.000013806966],"domain_scores_gemma":[0.99974924,0.00010127973,0.0000182245,0.00005231393,0.0000733057,0.0000056644067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002914887,0.00081322284,0.0005452878,0.00028515965,0.00019353085,0.0009151982,0.0008392224,0.00076852104,0.005090184],"category_scores_gemma":[0.0007396783,0.00051567424,0.00056955026,0.00037891016,0.0003318612,0.0010201043,0.00065076316,0.00080262223,0.004427983],"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.00010532917,0.000067018496,0.00024834299,0.00048210542,0.000057684312,0.000113140166,0.00011374721,0.31291533,0.07062732,0.06528378,0.008753227,0.541233],"study_design_scores_gemma":[0.0000048029474,0.000051716735,0.0002767457,0.00003618507,0.000018070332,0.00019269269,0.00002278986,0.9118285,0.025763618,0.022514796,0.039268512,0.000021608615],"about_ca_topic_score_codex":0.00048252605,"about_ca_topic_score_gemma":0.00081161875,"teacher_disagreement_score":0.005090184,"about_ca_system_score_codex":0.00026405376,"about_ca_system_score_gemma":0.00035707784,"threshold_uncertainty_score":0.017028332},"labels":[],"label_agreement":null},{"id":"W4403998337","doi":"10.1007/978-3-031-72691-0_9","title":"Robust Calibration of Large Vision-Language Adapters","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Calibration; Artificial intelligence; Computer vision","score_opus":0.016690817146020633,"score_gpt":0.283576001799943,"score_spread":0.2668851846539224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403998337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02134631,0.00038065328,0.96775025,0.00019544316,0.00014514619,0.000081088976,0.00011971769,0.0052649793,0.0047164755],"genre_scores_gemma":[0.37944567,0.000297571,0.6095252,0.0003784891,0.00009185665,0.00020085966,0.000610409,0.001195288,0.008254558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808925,0.00034489928,0.000070705755,0.0005526061,0.0007607707,0.00018172314],"domain_scores_gemma":[0.99749964,0.0004870861,0.00029024307,0.000983893,0.00062990625,0.0001091732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002159067,0.0014157082,0.0009249851,0.0012538622,0.00082326337,0.0022155505,0.002603413,0.0022252358,0.008264571],"category_scores_gemma":[0.0064637195,0.0010143719,0.00067456195,0.0016470271,0.0007994704,0.0032548835,0.0041020755,0.0018735984,0.0047164685],"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.0010542804,0.00017251006,0.0027009263,0.0002837986,0.00013158387,0.00026765832,0.00045912873,0.05232738,0.33152208,0.02541568,0.011406502,0.57425845],"study_design_scores_gemma":[0.00018039189,0.00044847542,0.0051756217,0.000099885045,0.00014100537,0.0011361864,0.0003492239,0.4502987,0.46856192,0.022294296,0.051141888,0.00017224904],"about_ca_topic_score_codex":0.0012006464,"about_ca_topic_score_gemma":0.0015749157,"teacher_disagreement_score":0.008264571,"about_ca_system_score_codex":0.0014380162,"about_ca_system_score_gemma":0.0011096257,"threshold_uncertainty_score":0.027647734},"labels":[],"label_agreement":null},{"id":"W4404002437","doi":"10.1007/978-3-031-73220-1_22","title":"MirrorGaussian: Reflecting 3D Gaussians for Reconstructing Mirror Reflections","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Computer graphics (images)","score_opus":0.058798108040123497,"score_gpt":0.3591868535035141,"score_spread":0.3003887454633906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404002437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039097164,0.0002037445,0.98995346,0.00006926929,0.00007541172,0.00003164002,0.00015853993,0.0025413437,0.0030569371],"genre_scores_gemma":[0.052628506,0.00065657805,0.93537533,0.00014524421,0.000052058887,0.00006907279,0.00057864556,0.0022867091,0.008207853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993493,0.00009040541,0.000024200168,0.000065710716,0.00041455854,0.000055843473],"domain_scores_gemma":[0.9991911,0.00024731984,0.000059256927,0.00020930832,0.0002088061,0.000084249834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825967,0.0011377747,0.0007491241,0.0008727929,0.00037903388,0.0018641452,0.0017235653,0.0010807032,0.010854124],"category_scores_gemma":[0.002244008,0.0007977057,0.0010197078,0.0012771446,0.0008586972,0.0017712564,0.0021136578,0.0018373696,0.0057530603],"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.00050958234,0.00011912459,0.00071813987,0.00042554343,0.000095197385,0.00032101525,0.00060294085,0.04763409,0.09491321,0.15362649,0.03226743,0.6687672],"study_design_scores_gemma":[0.00008390463,0.00011876077,0.00048388197,0.00009590621,0.00004449496,0.0008576386,0.00018922941,0.74913067,0.11209772,0.05782915,0.07894227,0.0001263704],"about_ca_topic_score_codex":0.0012648333,"about_ca_topic_score_gemma":0.0017832494,"teacher_disagreement_score":0.010854124,"about_ca_system_score_codex":0.00047896474,"about_ca_system_score_gemma":0.0008626287,"threshold_uncertainty_score":0.036310673},"labels":[],"label_agreement":null},{"id":"W4404004949","doi":"10.1007/978-3-031-73383-3_11","title":"Lagrangian Hashing for Compressed Neural Field Representations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto; Simon Fraser University","funders":"","keywords":"Computer science; Hash function; Field (mathematics); Artificial intelligence; Theoretical computer science; Mathematics; Programming language","score_opus":0.029818390909951847,"score_gpt":0.31897312005779266,"score_spread":0.2891547291478408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404004949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011963394,0.001015027,0.98098147,0.00034694595,0.0001509584,0.00004723419,0.00047616122,0.0012671901,0.0037514896],"genre_scores_gemma":[0.368993,0.0018994298,0.6022984,0.00038078584,0.00046575483,0.00029249903,0.0028282641,0.0006151415,0.022226797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960166,0.00012521894,0.000023481833,0.000059418755,0.00014753244,0.00004267224],"domain_scores_gemma":[0.9991192,0.00041860307,0.00005600425,0.00025715903,0.00011152539,0.00003754483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006564498,0.0005190354,0.0009425513,0.000813717,0.00030521155,0.0009997326,0.0012991522,0.0009555957,0.010450696],"category_scores_gemma":[0.0038216107,0.0003686761,0.00037127038,0.0014160844,0.00065641035,0.002658972,0.0016157166,0.0015398837,0.0023585933],"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.0003583169,0.00010359723,0.00031127,0.00024586433,0.0000401975,0.00010109101,0.00008995663,0.17305243,0.007700169,0.16239263,0.02811343,0.627491],"study_design_scores_gemma":[0.000029906438,0.00006405627,0.00012628877,0.000027674683,0.000007094924,0.00009171709,0.000022429838,0.9004424,0.0026161291,0.09235557,0.004197673,0.000019014054],"about_ca_topic_score_codex":0.0018859997,"about_ca_topic_score_gemma":0.0022916987,"teacher_disagreement_score":0.010450696,"about_ca_system_score_codex":0.0006853992,"about_ca_system_score_gemma":0.0006153255,"threshold_uncertainty_score":0.034961045},"labels":[],"label_agreement":null},{"id":"W4404004998","doi":"10.1007/978-3-031-73383-3_25","title":"Multi-label Cluster Discrimination for Visual Representation Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Cluster (spacecraft); Representation (politics); Artificial intelligence; Pattern recognition (psychology); Programming language","score_opus":0.04112993891542685,"score_gpt":0.35839350637065687,"score_spread":0.31726356745523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404004998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012275452,0.0009332199,0.98010284,0.00021967551,0.00021147112,0.000107443215,0.0004635595,0.00350196,0.002184389],"genre_scores_gemma":[0.21734081,0.00066835026,0.76243186,0.00038735988,0.0002750431,0.00033791637,0.0036951315,0.0008543975,0.014009108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987907,0.00027778256,0.00005762931,0.000412098,0.0002975134,0.00016433133],"domain_scores_gemma":[0.9980459,0.00066691166,0.000082236795,0.0006020858,0.0004947685,0.0001080127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016614975,0.0012109759,0.001677665,0.0016498412,0.0011566696,0.0016304858,0.003730205,0.002115352,0.009455426],"category_scores_gemma":[0.00346267,0.0004839113,0.0013553095,0.0028962905,0.00073840003,0.0020391897,0.002029251,0.00271664,0.0052913935],"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.00036225747,0.00020639472,0.0005073735,0.000167771,0.00008836063,0.00003932296,0.000052916188,0.017058667,0.019344207,0.004904631,0.016140882,0.94112724],"study_design_scores_gemma":[0.000029149629,0.00012570017,0.0006869813,0.000036307305,0.000057892175,0.00010902735,0.00007573771,0.9535055,0.020360997,0.019292949,0.0056844824,0.000035161902],"about_ca_topic_score_codex":0.0061099543,"about_ca_topic_score_gemma":0.009214387,"teacher_disagreement_score":0.009455426,"about_ca_system_score_codex":0.0010498266,"about_ca_system_score_gemma":0.001227778,"threshold_uncertainty_score":0.03163153},"labels":[],"label_agreement":null},{"id":"W4404008124","doi":"10.1007/978-3-031-70061-3_37","title":"Investigating Haptic Co-creation with Reinforcement Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Computer science; Haptic technology; Reinforcement learning; Human–computer interaction; Artificial intelligence; Computer graphics (images)","score_opus":0.020853999525170117,"score_gpt":0.2815592950453775,"score_spread":0.2607052955202074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404008124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33083868,0.00077336223,0.61280334,0.000608267,0.00013652438,0.000084160536,0.000020642492,0.00025817097,0.054476753],"genre_scores_gemma":[0.98128384,0.00008180445,0.01513996,0.000017149565,0.0000121932035,0.000016056121,0.000005439986,0.000019317904,0.0034243453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961,0.0001426664,0.000011861488,0.00007289126,0.00010475821,0.000057769394],"domain_scores_gemma":[0.99650586,0.0028437607,0.00018757484,0.00022890916,0.00012833368,0.00010565395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066895824,0.0003416857,0.0003464707,0.0001569207,0.0002669646,0.0014747812,0.0009969937,0.00093287276,0.0060184393],"category_scores_gemma":[0.0052514006,0.00027192768,0.0003143654,0.00021065657,0.0010435173,0.0018153863,0.0013566698,0.00090929243,0.0003006278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013795231,0.0008102261,0.0046988423,0.00052942825,0.00013537293,0.0011283418,0.0014707784,0.35789177,0.13098937,0.2804487,0.0014263773,0.2190913],"study_design_scores_gemma":[0.00005454979,0.00021783801,0.0011486693,0.000022764125,0.000017483848,0.00028196356,0.00020449785,0.9341458,0.011827948,0.05062622,0.00143205,0.000020209734],"about_ca_topic_score_codex":0.0005838803,"about_ca_topic_score_gemma":0.00030136676,"teacher_disagreement_score":0.0060184393,"about_ca_system_score_codex":0.0003960225,"about_ca_system_score_gemma":0.00033273685,"threshold_uncertainty_score":0.020133674},"labels":[],"label_agreement":null},{"id":"W4404008231","doi":"10.1007/978-3-031-70061-3_15","title":"Towards a Model for Haptics as a Co-regulation Adjunct in Cognitive Reappraisal","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural and Behavioral Psychology Studies","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Adjunct; Computer science; Haptic technology; Cognition; Human–computer interaction; Cognitive science; Artificial intelligence; Psychology; Linguistics; Neuroscience","score_opus":0.1535507772975979,"score_gpt":0.4049843580535048,"score_spread":0.25143358075590694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404008231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013099423,0.0007673317,0.82831186,0.0046679466,0.00042929055,0.00008559641,0.00017728546,0.00058404694,0.15187722],"genre_scores_gemma":[0.6557592,0.000919212,0.27592677,0.00088279025,0.00044749965,0.00040395735,0.00018879063,0.0003555191,0.06511614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.00027650368,0.000047604113,0.00017929642,0.00019272753,0.000080284335],"domain_scores_gemma":[0.9987337,0.00057880586,0.000108014174,0.00027287885,0.00019446132,0.00011226289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010203269,0.00084131974,0.00056336814,0.0007736517,0.00096373283,0.004595024,0.0023940122,0.0024214436,0.016005661],"category_scores_gemma":[0.002625124,0.0006002491,0.0013960805,0.0008210513,0.0038444554,0.007905825,0.0022514947,0.0027661775,0.0037695568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020438305,0.000026926386,0.00008819321,0.000043719425,0.000013937953,0.00008578939,0.0004813177,0.0029306412,0.0018238523,0.9825791,0.0009367812,0.010969293],"study_design_scores_gemma":[0.000012758377,0.000037758044,0.00016297925,0.000024980785,0.000015721862,0.00010702996,0.00017025549,0.039356332,0.0008154238,0.9522422,0.007033845,0.000020688243],"about_ca_topic_score_codex":0.0013287473,"about_ca_topic_score_gemma":0.0010138811,"teacher_disagreement_score":0.016005661,"about_ca_system_score_codex":0.0011954284,"about_ca_system_score_gemma":0.0011145826,"threshold_uncertainty_score":0.053544283},"labels":[],"label_agreement":null},{"id":"W4404008801","doi":"10.1007/978-981-97-8487-5_23","title":"AtomTool: Empowering Large Language Models with Tool Utilization Skills","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Geomechanica (Canada)","funders":"","keywords":"Computer science; Software engineering; Programming language; Human–computer interaction","score_opus":0.017409433068775453,"score_gpt":0.2632349959110514,"score_spread":0.2458255628422759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404008801","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.0074336343,0.00016014265,0.88796425,0.0002931001,0.00009131878,0.00012287736,0.0016754526,0.094465755,0.007793391],"genre_scores_gemma":[0.15173928,0.000747862,0.7785426,0.00047388647,0.000083925595,0.0005482426,0.012015031,0.033328537,0.022520617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991947,0.00018267111,0.0000626971,0.00016301611,0.00033447333,0.0000625144],"domain_scores_gemma":[0.997615,0.0014784102,0.0000787389,0.0005466858,0.00019518475,0.00008607066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010878863,0.0014547312,0.00060361385,0.0009423268,0.0004939898,0.002569581,0.0022969544,0.0009474904,0.020019634],"category_scores_gemma":[0.0054916646,0.0014542416,0.0016781393,0.0008131833,0.0005717703,0.005423681,0.0036578197,0.002318137,0.0100583825],"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.00066890137,0.00042329438,0.0041471543,0.0013135816,0.00025111108,0.0008446911,0.0018633463,0.047364652,0.035826977,0.08290894,0.1680979,0.6562894],"study_design_scores_gemma":[0.00013904016,0.000122049416,0.00052132184,0.00018691119,0.00018863675,0.0005772234,0.00037251046,0.59647965,0.04202912,0.08951729,0.26975948,0.00010679913],"about_ca_topic_score_codex":0.0021816844,"about_ca_topic_score_gemma":0.00493336,"teacher_disagreement_score":0.020019634,"about_ca_system_score_codex":0.0004904914,"about_ca_system_score_gemma":0.0010914109,"threshold_uncertainty_score":0.066972315},"labels":[],"label_agreement":null},{"id":"W4404024888","doi":"10.1007/978-3-031-73636-0_11","title":"Quantization-Friendly Winograd Transformations for Convolutional Neural Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Quantization (signal processing); Convolutional neural network; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.015985938457318626,"score_gpt":0.27441935576043025,"score_spread":0.25843341730311165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404024888","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.008079263,0.0004828472,0.9814083,0.00015543963,0.00011985149,0.000032259097,0.00021938948,0.0021893103,0.007313373],"genre_scores_gemma":[0.20617744,0.0008860313,0.765141,0.00021118057,0.00011839447,0.0001659122,0.0011596847,0.0017611403,0.02437932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.00006413085,0.000025510999,0.000056124652,0.00015965417,0.00003973523],"domain_scores_gemma":[0.99960333,0.000099074176,0.000026182484,0.00014093626,0.00010940438,0.000021109705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039177915,0.0006665683,0.0005489039,0.00065507327,0.00039100752,0.0008685266,0.0011398243,0.0005845819,0.011049701],"category_scores_gemma":[0.0022325327,0.0003778585,0.00046248848,0.0009074009,0.00056623283,0.0017995927,0.0014973525,0.001615399,0.004640388],"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.00026132952,0.00008104997,0.00026065786,0.00017808689,0.000033299628,0.000094610834,0.000081134815,0.05437772,0.025518235,0.26449478,0.024204295,0.63041484],"study_design_scores_gemma":[0.000072009556,0.00011767906,0.00027093003,0.00006601814,0.000022240905,0.00025445392,0.00006389917,0.5858218,0.041681778,0.3402427,0.0313431,0.000043325494],"about_ca_topic_score_codex":0.0020223584,"about_ca_topic_score_gemma":0.0055535156,"teacher_disagreement_score":0.011049701,"about_ca_system_score_codex":0.00057727436,"about_ca_system_score_gemma":0.00071065954,"threshold_uncertainty_score":0.036964893},"labels":[],"label_agreement":null},{"id":"W4404024991","doi":"10.1007/978-3-031-73636-0_6","title":"Temporal Residual Jacobians for Rig-Free Motion Transfer","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":"Université de Montréal","funders":"","keywords":"Computer science; Residual; Motion (physics); Transfer (computing); Artificial intelligence; Engineering drawing; Computer vision; Algorithm; Parallel computing; Engineering","score_opus":0.017693494804664495,"score_gpt":0.22811689924363035,"score_spread":0.21042340443896584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404024991","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.003953141,0.00016892773,0.9916801,0.00003561967,0.00006272258,0.000018052291,0.00007279418,0.00053146266,0.0034770612],"genre_scores_gemma":[0.2515332,0.00096066593,0.6960901,0.00010454532,0.00013772464,0.000127873,0.000734913,0.0012007111,0.049110282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984837,0.000024685489,0.000008155516,0.000019972244,0.000085808046,0.000013022575],"domain_scores_gemma":[0.9997942,0.00006666743,0.000021151282,0.00006327785,0.000044376422,0.000010482083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003383205,0.00054531224,0.0003699707,0.00039519262,0.00018267361,0.00042677586,0.0006137371,0.0005569548,0.010864542],"category_scores_gemma":[0.0012445315,0.0002581905,0.0003813148,0.00042474328,0.0004297581,0.00080161134,0.00085907086,0.0008050059,0.0027695324],"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.00022089832,0.00012557978,0.00019244672,0.00029718768,0.0000383466,0.0001304872,0.00012592385,0.1692527,0.07025673,0.13998945,0.009379686,0.6099906],"study_design_scores_gemma":[0.00002166735,0.00011686424,0.00028711295,0.000028997132,0.000012920806,0.00015741498,0.000033225566,0.93333733,0.012431893,0.03756204,0.01599084,0.000019650346],"about_ca_topic_score_codex":0.0012158701,"about_ca_topic_score_gemma":0.0023605274,"teacher_disagreement_score":0.010864542,"about_ca_system_score_codex":0.00018459879,"about_ca_system_score_gemma":0.0003268755,"threshold_uncertainty_score":0.03634554},"labels":[],"label_agreement":null},{"id":"W4404124946","doi":"10.1007/978-3-031-73223-2_19","title":"DeTra: A Unified Model for Object Detection and Trajectory Forecasting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Trajectory; Artificial intelligence; Object (grammar); Computer vision","score_opus":0.01965067332503872,"score_gpt":0.21273862180612285,"score_spread":0.19308794848108413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404124946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027303502,0.0004076144,0.9913282,0.00010194618,0.00013534595,0.000032259482,0.0007163239,0.0038508242,0.00069706875],"genre_scores_gemma":[0.1744115,0.0012117479,0.8018402,0.00031293544,0.00037932562,0.0004997173,0.006089281,0.0013003977,0.013954915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995197,0.0000817248,0.00003876846,0.00016347867,0.00015249402,0.000043831573],"domain_scores_gemma":[0.99922216,0.00026161308,0.000049409435,0.00014248244,0.0002830555,0.00004132733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011399313,0.0012928039,0.0020658467,0.0011191485,0.0006504621,0.0019061465,0.0038710453,0.0014660207,0.0054070796],"category_scores_gemma":[0.0025643872,0.0010935888,0.0016551298,0.0016489499,0.0003874586,0.0019958767,0.0016285023,0.0022183997,0.005109066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002821665,0.00011187319,0.0012438607,0.00012729676,0.0002155493,0.000085869775,0.000036242367,0.6465432,0.004074612,0.008560724,0.01398246,0.32473612],"study_design_scores_gemma":[0.0000030004323,0.0000061288083,0.000058096077,0.000002130986,0.0000068545396,0.0000073510923,0.0000011095345,0.9973028,0.00033401966,0.001204891,0.0010689374,0.0000046346217],"about_ca_topic_score_codex":0.02136016,"about_ca_topic_score_gemma":0.02004423,"teacher_disagreement_score":0.02136016,"about_ca_system_score_codex":0.00083776185,"about_ca_system_score_gemma":0.0013622593,"threshold_uncertainty_score":0.042471647},"labels":[],"label_agreement":null},{"id":"W4404166222","doi":"10.1007/978-3-031-72855-6_7","title":"Sparse Refinement for Efficient High-Resolution Semantic Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Resolution (logic); Natural language processing; Pattern recognition (psychology); Computer vision; Information retrieval","score_opus":0.021684827526355067,"score_gpt":0.2712635171816526,"score_spread":0.24957868965529753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404166222","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.0025579466,0.0002393471,0.9945468,0.000077130884,0.000027862743,0.000024125846,0.00016559384,0.0013239001,0.0010373084],"genre_scores_gemma":[0.0649059,0.00063136505,0.92780375,0.00016788981,0.00006523837,0.00008516619,0.001394363,0.00076900015,0.0041773543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996364,0.00006286578,0.00002045825,0.00007801414,0.0001461566,0.00005615896],"domain_scores_gemma":[0.99945396,0.00023712826,0.000041230454,0.00013495861,0.000109784334,0.00002302335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754223,0.0011950276,0.00142418,0.0013867221,0.0004087016,0.0013819634,0.0016496157,0.001584971,0.0061354893],"category_scores_gemma":[0.0017959465,0.0010449324,0.0012107786,0.0024588585,0.00066922547,0.0016676268,0.0018670764,0.0018818743,0.0034464167],"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.00031004273,0.000097194505,0.0002991725,0.0003888609,0.00014961665,0.00018707362,0.0001558266,0.13119958,0.09191533,0.028122004,0.017843938,0.7293313],"study_design_scores_gemma":[0.000016959431,0.000026721365,0.00019601062,0.000018941799,0.000026061076,0.00015694463,0.000029766628,0.9580998,0.018193346,0.017729668,0.0054893745,0.000016357078],"about_ca_topic_score_codex":0.0062160203,"about_ca_topic_score_gemma":0.011150664,"teacher_disagreement_score":0.0062160203,"about_ca_system_score_codex":0.0006119227,"about_ca_system_score_gemma":0.0010886866,"threshold_uncertainty_score":0.020525277},"labels":[],"label_agreement":null},{"id":"W4404195045","doi":"10.1007/978-981-97-8792-0_22","title":"Motion Trajectory Reconstruction Based on Feature Matching and Gradient Graph Laplacian Regularizer","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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 Manitoba","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Laplace operator; Trajectory; Graph; Matching (statistics); Feature (linguistics); Pattern recognition (psychology); Mathematics; Theoretical computer science; Physics","score_opus":0.011226202143458371,"score_gpt":0.21538286122275832,"score_spread":0.20415665907929995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404195045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005253853,0.000059491893,0.9934186,0.000051809693,0.000023836063,0.000021593849,0.000050754334,0.0006014568,0.0005185611],"genre_scores_gemma":[0.1664792,0.00023326729,0.8269063,0.000082064325,0.00004377482,0.00008876164,0.0007215696,0.00038349052,0.005061513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997454,0.000024551922,0.00001322349,0.00009422544,0.000092788236,0.000029750496],"domain_scores_gemma":[0.9997501,0.000055313252,0.000035109148,0.000067857356,0.0000703646,0.000021215861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027451827,0.0006541032,0.0010918832,0.0011627781,0.0004185632,0.00066138,0.0011871476,0.00090661633,0.002867757],"category_scores_gemma":[0.0010949966,0.000518037,0.00087964104,0.0015756058,0.0004137803,0.0012524907,0.000939072,0.0010935002,0.0013750055],"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.00030015002,0.00012177141,0.00094795803,0.0001238576,0.000084976586,0.00017689222,0.00010687553,0.20467542,0.05468699,0.017519122,0.0071325684,0.71412337],"study_design_scores_gemma":[0.000006221784,0.000024190918,0.00016716603,0.0000036742713,0.000008579997,0.00009025949,0.000010988309,0.99117166,0.005037808,0.0025413027,0.0009277256,0.000010391911],"about_ca_topic_score_codex":0.0057393275,"about_ca_topic_score_gemma":0.0056893504,"teacher_disagreement_score":0.0057393275,"about_ca_system_score_codex":0.00042174774,"about_ca_system_score_gemma":0.0010733202,"threshold_uncertainty_score":0.011411846},"labels":[],"label_agreement":null},{"id":"W4404199495","doi":"10.1007/978-3-031-73010-8_5","title":"Local and Global Flatness for Federated Domain Generalization","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Flatness (cosmology); Computer science; Generalization; Domain (mathematical analysis); Theoretical computer science; Artificial intelligence; Mathematics; Mathematical analysis","score_opus":0.01593425425367483,"score_gpt":0.25953670311870664,"score_spread":0.2436024488650318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404199495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025999727,0.0005147872,0.9684123,0.00023215273,0.00003820074,0.00005496365,0.00019717847,0.0013273619,0.0032233966],"genre_scores_gemma":[0.6197952,0.0007319556,0.36446998,0.00047776446,0.00014385484,0.00017734352,0.0015811854,0.0006338315,0.011988927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986998,0.00031491855,0.00009433773,0.00048625687,0.00025766692,0.00014708114],"domain_scores_gemma":[0.9955166,0.001834263,0.00012123703,0.00195834,0.000368099,0.00020144093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002913954,0.0007283138,0.0014858957,0.0011140386,0.0007594592,0.0012897704,0.002179689,0.0012675612,0.004832748],"category_scores_gemma":[0.007598671,0.00062054355,0.0014492653,0.00096906343,0.0019590727,0.0050627813,0.005214404,0.0035672178,0.00081186707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005649991,0.000255765,0.002259209,0.0003447084,0.00017546728,0.0003228393,0.0005876648,0.17916523,0.016731696,0.27464056,0.010940581,0.51401126],"study_design_scores_gemma":[0.000015839209,0.00007122382,0.00070979545,0.00003408269,0.000030728163,0.00013680471,0.00007744762,0.69444007,0.004287118,0.29807806,0.0020989068,0.000019936873],"about_ca_topic_score_codex":0.0044405228,"about_ca_topic_score_gemma":0.0044413554,"teacher_disagreement_score":0.004832748,"about_ca_system_score_codex":0.001222868,"about_ca_system_score_gemma":0.00094775896,"threshold_uncertainty_score":0.016167164},"labels":[],"label_agreement":null},{"id":"W4404199498","doi":"10.1007/978-3-031-73010-8_19","title":"Generalized Coverage for More Robust Low-Budget Active Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Operations research; Mathematics","score_opus":0.012573944020081282,"score_gpt":0.25789861381640344,"score_spread":0.24532466979632217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404199498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050669205,0.0008293986,0.98876053,0.00049185904,0.00016459698,0.00006925164,0.00027238549,0.0007983394,0.0035467118],"genre_scores_gemma":[0.33150396,0.00091557315,0.6387722,0.0015323207,0.0013497235,0.0008796659,0.0023310783,0.0019231038,0.020792408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525034,0.0020854655,0.00023064688,0.0010308666,0.0010775356,0.00032514325],"domain_scores_gemma":[0.98035413,0.0148473615,0.00048397394,0.0028834231,0.00097208173,0.0004589823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065560364,0.0025171547,0.0040256446,0.0019320695,0.0007011617,0.003141898,0.0055134925,0.0045552594,0.018116605],"category_scores_gemma":[0.03622302,0.0012104622,0.0017813474,0.002085382,0.0024383906,0.0069670016,0.0060527637,0.0063837613,0.0030467948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000978319,0.00032618453,0.0008890064,0.0008504838,0.00033174403,0.00018649938,0.00022502706,0.44884828,0.009139914,0.24243456,0.023620084,0.27216995],"study_design_scores_gemma":[0.00003967244,0.000050626342,0.000113532624,0.00003782622,0.000024539013,0.000040005678,0.000009015215,0.89488024,0.0010823554,0.10133766,0.0023703924,0.000014136986],"about_ca_topic_score_codex":0.0022394857,"about_ca_topic_score_gemma":0.002697424,"teacher_disagreement_score":0.018116605,"about_ca_system_score_codex":0.0019117931,"about_ca_system_score_gemma":0.0011769526,"threshold_uncertainty_score":0.060606062},"labels":[],"label_agreement":null},{"id":"W4404199597","doi":"10.1007/978-3-031-73010-8_22","title":"FedTSA: A Cluster-Based Two-Stage Aggregation Method for Model-Heterogeneous Federated Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster (spacecraft); Stage (stratigraphy); Artificial intelligence; Computer network","score_opus":0.036158402303667396,"score_gpt":0.3077873965043107,"score_spread":0.2716289942006433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404199597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029818972,0.00004604463,0.993386,0.00004414909,0.000034868528,0.000050556297,0.000100290854,0.0028635361,0.0004926159],"genre_scores_gemma":[0.119496845,0.000049647737,0.8750767,0.00009597655,0.000043102176,0.00018857396,0.00077430095,0.00060236035,0.0036724284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858,0.0003876843,0.000095665564,0.00028440164,0.00048401006,0.00016819414],"domain_scores_gemma":[0.99808395,0.00052383106,0.00008857343,0.00075617817,0.00042317464,0.00012436253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002058917,0.0009161815,0.0015502563,0.0013615977,0.001604989,0.0016657987,0.0027937803,0.0012578795,0.0059405905],"category_scores_gemma":[0.0043613818,0.0005733671,0.0020808834,0.001621702,0.0006566281,0.002387082,0.0038371065,0.0022111044,0.001723929],"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.0006443713,0.00040191505,0.0023327626,0.00016197926,0.00039729584,0.00018850049,0.0004292696,0.27120078,0.0087713,0.03560692,0.017480804,0.6623841],"study_design_scores_gemma":[0.000015225953,0.000025126394,0.0001497046,0.000006391933,0.000016315415,0.000028513645,0.000029284294,0.98183006,0.0018507882,0.0140105635,0.002027457,0.000010538756],"about_ca_topic_score_codex":0.010008755,"about_ca_topic_score_gemma":0.014627115,"teacher_disagreement_score":0.010008755,"about_ca_system_score_codex":0.0013278174,"about_ca_system_score_gemma":0.0027857732,"threshold_uncertainty_score":0.019900978},"labels":[],"label_agreement":null},{"id":"W4404278173","doi":"10.1007/978-3-031-76554-4_6","title":"PLACIDUS: Engineering Product Lines of Rigorous Assurance Cases","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"University of Toronto","funders":"","keywords":"Computer science; Product (mathematics); Software engineering; Engineering drawing; Engineering; Mathematics","score_opus":0.009877653156459854,"score_gpt":0.20473910539971593,"score_spread":0.19486145224325607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404278173","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.010749765,0.00069237803,0.9116567,0.00054527074,0.00009184369,0.00013378965,0.00011727377,0.0013993158,0.07461367],"genre_scores_gemma":[0.20685321,0.0013165504,0.75221395,0.00017588901,0.00008261318,0.0003126322,0.0007076615,0.0009994123,0.03733808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768746,0.0005881364,0.00009525729,0.0001726055,0.0013436878,0.0001128324],"domain_scores_gemma":[0.99787784,0.001223622,0.00011672247,0.00038501725,0.00033504455,0.00006175387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019238126,0.0008908873,0.00033895634,0.0013928111,0.0007261816,0.0024587286,0.0012405242,0.00084067427,0.011716066],"category_scores_gemma":[0.0061552287,0.0010139366,0.000577311,0.0009963604,0.0015493362,0.0026879534,0.0020597775,0.0022940254,0.0021480098],"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.00006314784,0.00006462821,0.00025830264,0.00024030346,0.000018870764,0.00022105157,0.0005566932,0.019643158,0.0043206965,0.7274556,0.012357246,0.23480026],"study_design_scores_gemma":[0.000060137227,0.00010395024,0.00039508095,0.0002796945,0.000031752472,0.0005083793,0.00025946734,0.14566393,0.010810227,0.6899373,0.15190664,0.00004348438],"about_ca_topic_score_codex":0.0009732322,"about_ca_topic_score_gemma":0.0009757594,"teacher_disagreement_score":0.011716066,"about_ca_system_score_codex":0.0009851416,"about_ca_system_score_gemma":0.0011206842,"threshold_uncertainty_score":0.039194167},"labels":[],"label_agreement":null},{"id":"W4404287396","doi":"10.1007/978-3-031-75775-4_4","title":"A Probabilistic Analysis of Simplified Cluedo with Storm: The Birthday Cake Case","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Storm; Probabilistic logic; Operations research; Artificial intelligence; Meteorology; Mathematics; Geography","score_opus":0.025192186358100718,"score_gpt":0.278831299248363,"score_spread":0.25363911289026225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404287396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16946599,0.00039966093,0.7784648,0.0018931979,0.00014542525,0.00032520836,0.0010722224,0.0012950973,0.046938397],"genre_scores_gemma":[0.9087211,0.0002131115,0.079907775,0.00032210376,0.000036612844,0.0002997188,0.00043845398,0.0003515388,0.009709528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966953,0.0010026392,0.0001236026,0.00044749488,0.0010099823,0.00072107936],"domain_scores_gemma":[0.99023813,0.0064010588,0.0007011349,0.0014385423,0.00061327475,0.00060785847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031008227,0.00096350105,0.0012190348,0.0010857959,0.0017350914,0.0033996191,0.003189163,0.0018559659,0.009334052],"category_scores_gemma":[0.019132532,0.0008708104,0.0024660842,0.0008036657,0.0048261085,0.00488329,0.003864228,0.003645571,0.00062994706],"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.00021561261,0.00007827932,0.0013245133,0.00008935339,0.000050652056,0.0005173037,0.00038619994,0.36737752,0.0010194435,0.6230495,0.0018688024,0.004022842],"study_design_scores_gemma":[0.000055573328,0.000030732564,0.0001500344,0.000026173711,0.00001829619,0.00008254501,0.00007983739,0.78135073,0.0006443998,0.21558441,0.0019511906,0.000026063566],"about_ca_topic_score_codex":0.021378359,"about_ca_topic_score_gemma":0.013010745,"teacher_disagreement_score":0.021378359,"about_ca_system_score_codex":0.0030087924,"about_ca_system_score_gemma":0.004159944,"threshold_uncertainty_score":0.042507887},"labels":[],"label_agreement":null},{"id":"W4404296058","doi":"10.1007/978-3-031-71464-1_29","title":"REHG: A Recommender Engine Based on Heterogeneous Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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":"Computer science; Recommender system; Graph; World Wide Web; Information retrieval; Theoretical computer science","score_opus":0.01918755295177225,"score_gpt":0.24714003165263315,"score_spread":0.2279524787008609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404296058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023692664,0.0014686617,0.9330101,0.00034246076,0.00026445682,0.00039705008,0.0037157403,0.031016966,0.006091865],"genre_scores_gemma":[0.14197147,0.0007904297,0.83001494,0.0002562672,0.00011085417,0.00019030673,0.009071717,0.0011178256,0.016476242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966013,0.00006982638,0.000020202111,0.00009635407,0.0001286633,0.000024672205],"domain_scores_gemma":[0.99938834,0.00018168346,0.000024900639,0.00024905402,0.000107297965,0.00004871028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054359145,0.0010033867,0.0011777017,0.0017882455,0.00055734115,0.0010133451,0.0016950842,0.0010790331,0.007309629],"category_scores_gemma":[0.0020593745,0.0005903921,0.00096819917,0.002082176,0.0001685187,0.0021223712,0.0011191767,0.00092575,0.00476549],"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.00089307374,0.0004902111,0.0032289063,0.00057540543,0.0006084597,0.0004880339,0.00016442103,0.06759825,0.017496996,0.013697447,0.10442273,0.79033613],"study_design_scores_gemma":[0.0001600986,0.0001514656,0.0013580282,0.00003022643,0.00018087614,0.00035015037,0.00005202719,0.939636,0.008374675,0.016174885,0.033462152,0.0000693111],"about_ca_topic_score_codex":0.007946086,"about_ca_topic_score_gemma":0.018562198,"teacher_disagreement_score":0.007946086,"about_ca_system_score_codex":0.00033300943,"about_ca_system_score_gemma":0.00047337147,"threshold_uncertainty_score":0.024453104},"labels":[],"label_agreement":null},{"id":"W4404296390","doi":"10.1007/978-3-031-71464-1_34","title":"Sophon IDS: Mitigating the Effectiveness of GAN-Based Adversarial Attacks via Tailored Misinformation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Dalhousie University","funders":"","keywords":"Computer science; Misinformation; Adversarial system; Computer security; Artificial intelligence","score_opus":0.008853468510542944,"score_gpt":0.24774145202888892,"score_spread":0.23888798351834598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404296390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059569232,0.0012871174,0.91170996,0.0010122305,0.00065044494,0.00013523592,0.00018047827,0.0054844595,0.019970773],"genre_scores_gemma":[0.8316775,0.00053865276,0.15220065,0.0007875676,0.00017524557,0.00008447324,0.0002809793,0.0003282286,0.013926699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999014,0.00028629773,0.000028249486,0.00016212193,0.00037369123,0.00013563375],"domain_scores_gemma":[0.99843067,0.0007789244,0.00012318534,0.0004033318,0.00018782499,0.00007599861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346883,0.0009767067,0.0008895056,0.00045252484,0.00035427487,0.00091390416,0.0011112896,0.0012785784,0.003035186],"category_scores_gemma":[0.0037195948,0.00036133674,0.00037787846,0.00020664187,0.001062935,0.0016261595,0.002283319,0.0022187626,0.0010394066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013736762,0.00032244902,0.002694197,0.0002907163,0.00023981681,0.0005298161,0.00022176883,0.44274828,0.062983856,0.09336448,0.045161888,0.35006914],"study_design_scores_gemma":[0.000017719007,0.000112098365,0.00025721142,0.000017845789,0.000020320056,0.00021905912,0.000014397731,0.97000957,0.013698516,0.012331933,0.0032835924,0.00001773703],"about_ca_topic_score_codex":0.00049932156,"about_ca_topic_score_gemma":0.0008910138,"teacher_disagreement_score":0.003035186,"about_ca_system_score_codex":0.0006281203,"about_ca_system_score_gemma":0.0006050362,"threshold_uncertainty_score":0.010153711},"labels":[],"label_agreement":null},{"id":"W4404310199","doi":"10.1007/978-981-96-0808-9_10","title":"BOAM: A Business Oriented Identification Approach of Microservices Within Legacy Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Microservices; Identification (biology); Computer science; Operating system; Biology","score_opus":0.01217305077776652,"score_gpt":0.23471986060693606,"score_spread":0.22254680982916955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404310199","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.0048364378,0.00015776024,0.9851075,0.00019209446,0.000055710232,0.00006612839,0.00006267422,0.0022401095,0.007281585],"genre_scores_gemma":[0.13005306,0.00034475292,0.84801537,0.00023939757,0.000062038096,0.00013766982,0.00037006696,0.00064857857,0.020128975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990721,0.00021616388,0.00003760964,0.00018078041,0.00038436797,0.00010894892],"domain_scores_gemma":[0.99924064,0.00028533983,0.00007374896,0.00017597325,0.00016645029,0.000057932448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013188462,0.00060089276,0.00048588036,0.001477993,0.0010787895,0.0027862021,0.0016381704,0.0012538986,0.005779115],"category_scores_gemma":[0.0024409334,0.0005587552,0.0006431564,0.0012907506,0.00075576454,0.0035836825,0.0023804996,0.0017698017,0.0020073329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020546424,0.00021186187,0.0024044123,0.00029677962,0.00007209021,0.0005447364,0.0012449119,0.0247692,0.018337041,0.41415662,0.0122960815,0.52546084],"study_design_scores_gemma":[0.000041105224,0.00012250122,0.0021604302,0.00021288809,0.00009079864,0.00096567447,0.0009157177,0.5890715,0.027430972,0.24073833,0.13817404,0.000076002696],"about_ca_topic_score_codex":0.0026599956,"about_ca_topic_score_gemma":0.0047494443,"teacher_disagreement_score":0.005779115,"about_ca_system_score_codex":0.00063762255,"about_ca_system_score_gemma":0.001199722,"threshold_uncertainty_score":0.019333065},"labels":[],"label_agreement":null},{"id":"W4404338236","doi":"10.1007/978-3-031-71467-2_3","title":"A Lightweight Method to Survey with Protecting Privacy yet Maintaining Accuracy","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer security; Privacy protection; Internet privacy","score_opus":0.04224779574416998,"score_gpt":0.31134906647338684,"score_spread":0.26910127072921686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404338236","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.0035608902,0.0003262917,0.984917,0.000726775,0.00026241087,0.00013918936,0.00041197857,0.003404723,0.006250722],"genre_scores_gemma":[0.106073536,0.00071110565,0.8491741,0.0011145996,0.0006625971,0.0006651917,0.0015683,0.0015892369,0.038441285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99384284,0.0012316409,0.00033943757,0.0012513861,0.0029139114,0.0004207775],"domain_scores_gemma":[0.9873569,0.0028726761,0.000542303,0.0069999825,0.00184552,0.00038260597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030752716,0.0013109616,0.001658996,0.003562756,0.001949186,0.0036723013,0.0030200204,0.0017758176,0.013862552],"category_scores_gemma":[0.019783255,0.0010718176,0.0018645737,0.0048132185,0.0020823316,0.009969196,0.006551125,0.0033411377,0.008201397],"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.00040868454,0.00017870968,0.0019213331,0.00035366672,0.00011039771,0.00013831981,0.0006001077,0.0074595963,0.0146489395,0.3586837,0.050325453,0.5651711],"study_design_scores_gemma":[0.000081368955,0.00017743382,0.0008785727,0.00013118096,0.00015936738,0.0006742205,0.000290745,0.15635881,0.020328995,0.6913279,0.12947905,0.00011236339],"about_ca_topic_score_codex":0.0015799272,"about_ca_topic_score_gemma":0.002671166,"teacher_disagreement_score":0.013862552,"about_ca_system_score_codex":0.0015978895,"about_ca_system_score_gemma":0.0026572756,"threshold_uncertainty_score":0.046374857},"labels":[],"label_agreement":null},{"id":"W4404356575","doi":"10.1007/978-3-031-73503-5_5","title":"AIMSM - A Mechanism to Optimize Systems with Multiple AI Models: A Case Study in Computer Vision for Autonomous Mobile Robots","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Mobile robot; Mechanism (biology); Robot; Artificial intelligence; Human–computer interaction; Computer vision","score_opus":0.024680469177435754,"score_gpt":0.2870836643168783,"score_spread":0.26240319513944255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404356575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01491401,0.00028509347,0.97455966,0.00024784874,0.000073812516,0.0001029552,0.00007038915,0.0025747358,0.007171506],"genre_scores_gemma":[0.41232798,0.00017864593,0.57793236,0.00022778974,0.000058606227,0.00035117136,0.00015113557,0.00056849467,0.008203799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961615,0.0001323675,0.000022057755,0.00006225595,0.00011959866,0.00004747743],"domain_scores_gemma":[0.99933356,0.00036970526,0.000058781123,0.00010207446,0.00009652122,0.000039402817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017641867,0.0010561615,0.00086307194,0.00041084777,0.00058297836,0.0010997734,0.0022286812,0.0017648343,0.0059417533],"category_scores_gemma":[0.0025527172,0.0006871,0.0011418842,0.00046884932,0.00089445163,0.0010601399,0.0021986878,0.0019240039,0.0010148016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001195622,0.000071034985,0.00051921245,0.00019539178,0.00013470356,0.0001176438,0.000118048505,0.85530263,0.0030707782,0.03754521,0.0033784185,0.09942737],"study_design_scores_gemma":[0.000022154181,0.00005302903,0.000072382,0.000010207657,0.000015191304,0.000026744512,0.000010494708,0.98884016,0.0011433441,0.008078477,0.0017215506,0.0000061841884],"about_ca_topic_score_codex":0.002259215,"about_ca_topic_score_gemma":0.0035272078,"teacher_disagreement_score":0.0059417533,"about_ca_system_score_codex":0.0007035928,"about_ca_system_score_gemma":0.001016693,"threshold_uncertainty_score":0.019877136},"labels":[],"label_agreement":null},{"id":"W4404356684","doi":"10.1007/978-3-031-73503-5_4","title":"AICIS: A System for Identifying AI Contribution in Textual Content","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Computer science; Content (measure theory); Information retrieval; Natural language processing; Artificial intelligence; Mathematics","score_opus":0.04707489017599698,"score_gpt":0.28308892216841497,"score_spread":0.236014031992418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404356684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05044241,0.0015086007,0.448405,0.00051357516,0.00050223974,0.0012852666,0.07228595,0.38988438,0.035172656],"genre_scores_gemma":[0.15073885,0.00072936463,0.7198607,0.00028545476,0.0004384562,0.0018411408,0.091277644,0.0077735675,0.027054796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861956,0.00020353735,0.00013205934,0.00039785515,0.0005686851,0.00007840563],"domain_scores_gemma":[0.993436,0.0033683563,0.0005081627,0.0006914629,0.0016140925,0.00038204473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173827,0.0015798256,0.00083244266,0.01301538,0.0010089691,0.0025504017,0.001304062,0.0010033203,0.022305094],"category_scores_gemma":[0.010602213,0.00048669727,0.00071624224,0.006763393,0.0003981286,0.0036481665,0.0023772924,0.0009766737,0.016354106],"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.0011524914,0.00021803667,0.020742511,0.0013276422,0.00021235306,0.00029716443,0.0013227897,0.0014372043,0.021432037,0.0058827396,0.17236048,0.7736146],"study_design_scores_gemma":[0.00026018507,0.00057522947,0.055024084,0.0005068353,0.0008730336,0.0011801564,0.0023907674,0.39925516,0.08973622,0.023149418,0.42676336,0.00028558055],"about_ca_topic_score_codex":0.006051014,"about_ca_topic_score_gemma":0.010734519,"teacher_disagreement_score":0.022305094,"about_ca_system_score_codex":0.0010076247,"about_ca_system_score_gemma":0.0014928351,"threshold_uncertainty_score":0.07461798},"labels":[],"label_agreement":null},{"id":"W4404399962","doi":"10.1007/978-981-96-0026-7_10","title":"EBcGAN: An Edge-Based Conditional Generative Adversarial Network for Image Fusion","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image Fusion Techniques","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 Toronto","funders":"","keywords":"Computer science; Adversarial system; Generative grammar; Image (mathematics); Artificial intelligence; Enhanced Data Rates for GSM Evolution; Generative adversarial network; Image fusion; Computer vision; Fusion; Theoretical computer science; Linguistics","score_opus":0.010686385399949863,"score_gpt":0.2520217452880604,"score_spread":0.2413353598881105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404399962","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.0014764136,0.000149648,0.99611807,0.000057066776,0.00004149136,0.000026442718,0.00008291203,0.0011312349,0.0009167986],"genre_scores_gemma":[0.17862806,0.00067263085,0.8025583,0.00051859097,0.00011874078,0.00024927917,0.0012638101,0.00097360334,0.015017041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999532,0.00011324958,0.000016760723,0.000107211614,0.00017691182,0.000053852244],"domain_scores_gemma":[0.9995648,0.00020633134,0.000025322408,0.00008276256,0.000095107716,0.000025611544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010555122,0.0010620635,0.0011149691,0.00064950873,0.0004383925,0.0008199203,0.0027339815,0.0016700323,0.0052777734],"category_scores_gemma":[0.0016951745,0.0006365724,0.0011308786,0.00083472,0.00073021796,0.0014231502,0.0028041904,0.0028744203,0.0020978134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021406634,0.00008977449,0.00025927115,0.000080005855,0.00012688976,0.00008924779,0.000041120264,0.6516483,0.009384347,0.018626107,0.009467217,0.3099737],"study_design_scores_gemma":[0.0000029163152,0.00000808655,0.000032139997,0.000003417383,0.000005307519,0.000014771777,0.0000015058348,0.9939911,0.0014284764,0.0037252947,0.00078236096,0.000004607098],"about_ca_topic_score_codex":0.0053048558,"about_ca_topic_score_gemma":0.0068775117,"teacher_disagreement_score":0.0053048558,"about_ca_system_score_codex":0.00076494704,"about_ca_system_score_gemma":0.0007044217,"threshold_uncertainty_score":0.017655969},"labels":[],"label_agreement":null},{"id":"W4404439315","doi":"10.1007/978-981-96-0116-5_12","title":"Enhancing Music Genre Classification Using Augmented Features Ensemble Learning Technique","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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 Lethbridge","funders":"","keywords":"Computer science; Ensemble learning; Artificial intelligence; Pattern recognition (psychology); Speech recognition","score_opus":0.029300583273157207,"score_gpt":0.2681657072788157,"score_spread":0.2388651240056585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404439315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11112735,0.0012212275,0.87799895,0.00016462636,0.0006907105,0.00006704441,0.0003955198,0.002832619,0.0055019474],"genre_scores_gemma":[0.5723029,0.0008509905,0.4088437,0.00017572944,0.00047246937,0.00007889151,0.0017600548,0.00034183456,0.01517344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995907,0.0000551131,0.00002115333,0.00009591631,0.00018081612,0.00005625856],"domain_scores_gemma":[0.9996233,0.00008125251,0.000017821014,0.000067119654,0.00018359092,0.000026747666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552204,0.0007072941,0.0009245392,0.0011981564,0.00035097188,0.00070236315,0.00064691075,0.0005097895,0.0028544676],"category_scores_gemma":[0.000849656,0.00016414712,0.0010080636,0.0010969792,0.00013484713,0.0008805966,0.0007455738,0.00083589595,0.0017319584],"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.00022893563,0.00026074302,0.0019994732,0.00005429091,0.00012749176,0.0000739629,0.000035123856,0.0134531325,0.09441489,0.00063854974,0.0048638335,0.88384956],"study_design_scores_gemma":[0.000019415183,0.00022029522,0.0065479428,0.000013929633,0.00018642585,0.00023682218,0.000057641326,0.9464919,0.03962204,0.001172163,0.005401631,0.00002983405],"about_ca_topic_score_codex":0.0021068808,"about_ca_topic_score_gemma":0.0038065424,"teacher_disagreement_score":0.0028544676,"about_ca_system_score_codex":0.00013740783,"about_ca_system_score_gemma":0.00027006198,"threshold_uncertainty_score":0.009549141},"labels":[],"label_agreement":null},{"id":"W4404445560","doi":"10.1007/978-3-031-76604-6_5","title":"Rethinking the Quality of Synthetic Palm Vein Images from Spectral Analysis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Spectral analysis; Computer vision; Vein; Quality (philosophy); Artificial intelligence; Palm; Pattern recognition (psychology); Medicine; Surgery","score_opus":0.018515001232070574,"score_gpt":0.2639152156464259,"score_spread":0.24540021441435533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404445560","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.23302956,0.0014029637,0.75481427,0.00077624415,0.00032552957,0.000059356204,0.0008885136,0.003938582,0.0047650137],"genre_scores_gemma":[0.6534893,0.0013059904,0.33740503,0.0002391999,0.00016135834,0.00002725034,0.0020311468,0.0018947579,0.0034460216],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999595,0.00010173658,0.000021565203,0.0000675559,0.0001801592,0.000034022603],"domain_scores_gemma":[0.99738973,0.0010565319,0.00017522802,0.00041365018,0.00089449645,0.000070368864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177167,0.0005637887,0.0003667876,0.0010109291,0.0002167932,0.0018666907,0.00053964293,0.00078284804,0.0030535995],"category_scores_gemma":[0.005229782,0.00033255861,0.0004927518,0.00067328964,0.00045489983,0.0016133055,0.0007748116,0.0009500685,0.0015368931],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011445897,0.00010511623,0.0038695794,0.00037793908,0.00013318424,0.0001850161,0.00016852241,0.025183018,0.346589,0.0029791382,0.0042320997,0.6150328],"study_design_scores_gemma":[0.00010307779,0.00023549536,0.017051965,0.000085160646,0.00017070837,0.0015122042,0.00022532088,0.68838185,0.2740627,0.006300362,0.011762198,0.000108912456],"about_ca_topic_score_codex":0.0009233077,"about_ca_topic_score_gemma":0.001370743,"teacher_disagreement_score":0.0030535995,"about_ca_system_score_codex":0.0002042002,"about_ca_system_score_gemma":0.00024550848,"threshold_uncertainty_score":0.010215342},"labels":[],"label_agreement":null},{"id":"W4404524972","doi":"10.1007/978-3-031-77731-8_5","title":"Association Rules Mining with Auto-encoders","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Université Laval","funders":"","keywords":"Computer science; Association rule learning; Association (psychology); Data mining; Encoder; Artificial intelligence; Operating system","score_opus":0.013171627316337012,"score_gpt":0.23903915366069597,"score_spread":0.22586752634435897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404524972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01961875,0.0021118324,0.96452177,0.00030219488,0.00024504203,0.00018194648,0.001872938,0.008878965,0.0022666561],"genre_scores_gemma":[0.23525055,0.0013005725,0.74906313,0.0003633263,0.00024316023,0.00032002857,0.0069083534,0.00039715134,0.006153782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976222,0.0005932606,0.0002809614,0.0007424331,0.0006317775,0.00012952612],"domain_scores_gemma":[0.9930692,0.004452509,0.00024718934,0.0011581307,0.00097114936,0.00010190758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028969285,0.0009417928,0.0015516719,0.002885904,0.00056101574,0.0018661363,0.0020410537,0.0010478502,0.005040945],"category_scores_gemma":[0.009455421,0.0010061465,0.0017329166,0.0029135258,0.00046468232,0.0025465628,0.0016467449,0.0017584515,0.004306287],"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.00040548263,0.00024512512,0.0023079822,0.00027785188,0.0002844393,0.00034594862,0.000077141165,0.026544377,0.00493286,0.0055494676,0.008985111,0.9500443],"study_design_scores_gemma":[0.00007587331,0.00016439117,0.0014585559,0.00013452861,0.00025289317,0.00088302745,0.000060913782,0.94637465,0.012805943,0.029824294,0.007913826,0.00005114654],"about_ca_topic_score_codex":0.0027525038,"about_ca_topic_score_gemma":0.0040674075,"teacher_disagreement_score":0.005040945,"about_ca_system_score_codex":0.00046910884,"about_ca_system_score_gemma":0.0013224517,"threshold_uncertainty_score":0.016863644},"labels":[],"label_agreement":null},{"id":"W4404530596","doi":"10.1007/978-3-031-70415-4","title":"Advances in Practical Applications of Agents, Multi-Agent Systems, and Digital Twins: The PAAMS Collection","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"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":"Russian Academy of Sciences; Région Normandie; Université Polytechnique Hauts-de-France; Agencia Estatal de Investigación; Université de Caen Normandie; Eidgenössische Technische Hochschule Zürich; Tokyo University of Agriculture and Technology; RMIT University; Universidad de Castilla-La Mancha; Syddansk Universitet; Université Laval; Universidad Nacional del Centro de la Provincia de Buenos Aires; Libera Università di Bolzano; Universidade de Lisboa; Universität Bremen; Malmö Högskola; Universidad de Caldas; Università di Bologna; Universidad Carlos III de Madrid; Université de Sherbrooke; Purdue University; Centre National de la Recherche Scientifique; Shizuoka University; Universidad Complutense de Madrid; Vrije Universiteit Amsterdam; Georgia Institute of Technology; Universidad de Sevilla; Tokyo University of Agriculture","keywords":"Computer science; Multi-agent system; Artificial intelligence","score_opus":0.015617587192555208,"score_gpt":0.2718861418266573,"score_spread":0.25626855463410214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404530596","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028563351,0.50332314,0.08941208,0.0111337425,0.032710824,0.00011064309,0.0006384076,0.0013048963,0.35850993],"genre_scores_gemma":[0.019538168,0.338774,0.052255668,0.0019590012,0.017494265,0.00013212374,0.0009397151,0.0008681417,0.5680389],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995498,0.000069591864,0.00003441359,0.00006021278,0.0002578562,0.000028125809],"domain_scores_gemma":[0.9989944,0.00044945674,0.000033709064,0.00010377954,0.00028808057,0.0001305459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000984761,0.0009366865,0.0009575315,0.0032423,0.00066528755,0.0032269643,0.0008505385,0.0007921182,0.048725832],"category_scores_gemma":[0.0022131957,0.00049823895,0.0005942936,0.004246593,0.0007003316,0.004735845,0.0021838788,0.0017990909,0.014660045],"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.000027464315,0.00004877816,0.0001339125,0.0005757377,0.00001809647,0.0000608173,0.00008447899,0.0011569775,0.00078733946,0.06952717,0.4748655,0.4527138],"study_design_scores_gemma":[0.000003078892,0.000025711113,0.00021398618,0.00018025578,0.000009489717,0.0001656638,0.000048947153,0.0014885503,0.0003808284,0.020903412,0.9765697,0.000010479045],"about_ca_topic_score_codex":0.00077837857,"about_ca_topic_score_gemma":0.002202018,"teacher_disagreement_score":0.048725832,"about_ca_system_score_codex":0.0008122203,"about_ca_system_score_gemma":0.00092962134,"threshold_uncertainty_score":0.16300416},"labels":[],"label_agreement":null},{"id":"W4404544772","doi":"10.1007/978-3-031-73113-6_16","title":"Fast Point Cloud Geometry Compression with Context-Based Residual Coding and INR-Based Refinement","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"McMaster University","funders":"","keywords":"Computer science; Point cloud; Coding (social sciences); Residual; Context (archaeology); Cloud computing; Data compression; Compression (physics); Algorithm; Geometry; Computer vision; Mathematics; Geology","score_opus":0.014624191441187883,"score_gpt":0.2572755459678934,"score_spread":0.24265135452670555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404544772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006471145,0.0003499676,0.98967606,0.000070460854,0.000063093394,0.00004435603,0.0001709925,0.0012127486,0.0019412045],"genre_scores_gemma":[0.0820936,0.0005621064,0.9127035,0.00008410567,0.00007471879,0.00006312297,0.0009153825,0.00036062728,0.0031428714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.00006121373,0.00002843653,0.000077371515,0.0004606916,0.000048716694],"domain_scores_gemma":[0.9993025,0.00020221104,0.00004692313,0.00023795945,0.00018792646,0.000022356428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037239637,0.0009891909,0.00091426773,0.001421883,0.00024616806,0.0008746456,0.0014338141,0.0007556594,0.004624393],"category_scores_gemma":[0.0018103127,0.00047171206,0.00068946666,0.0019371657,0.00048657044,0.0014475728,0.0012641167,0.0014213232,0.0023494845],"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.00041031162,0.00010040209,0.00042881325,0.00018073946,0.000047518224,0.00014195172,0.00008094593,0.07268559,0.10688791,0.017052282,0.007366196,0.79461735],"study_design_scores_gemma":[0.00003208349,0.000102368984,0.00050945894,0.00003232116,0.000026757722,0.00049125846,0.00003067428,0.92134607,0.06447746,0.005314384,0.0076012593,0.000035840363],"about_ca_topic_score_codex":0.0036068077,"about_ca_topic_score_gemma":0.0049921866,"teacher_disagreement_score":0.004624393,"about_ca_system_score_codex":0.00040590952,"about_ca_system_score_gemma":0.00073763623,"threshold_uncertainty_score":0.015470147},"labels":[],"label_agreement":null},{"id":"W4404545119","doi":"10.1007/978-3-031-73036-8_26","title":"R3DS: Reality-Linked 3D Scenes for Panoramic Scene Understanding","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Artificial intelligence; Virtual reality; Human–computer interaction","score_opus":0.049632443392890496,"score_gpt":0.2638423628076719,"score_spread":0.21420991941478143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404545119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001198753,0.00051450357,0.9399225,0.000112487214,0.00011951691,0.00010626497,0.0029338868,0.039844163,0.015247929],"genre_scores_gemma":[0.04526435,0.0025287687,0.86854315,0.00036654557,0.00011135924,0.00042144337,0.018301127,0.03006286,0.034400318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953437,0.000049860522,0.000024997053,0.000091213245,0.00025269855,0.000046884677],"domain_scores_gemma":[0.99967563,0.00010952368,0.000014185025,0.00010182671,0.000066855806,0.000032053023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054095,0.00204847,0.0010382526,0.001753429,0.00044469754,0.0027482219,0.0030292142,0.0013148205,0.086341925],"category_scores_gemma":[0.001194573,0.0014466977,0.0019081878,0.0015959882,0.00066698034,0.0028084007,0.0030428981,0.0018167953,0.03279265],"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.00026773344,0.000096934265,0.00031940895,0.0012026756,0.00014558775,0.00048349783,0.00089184754,0.022217846,0.053476676,0.07316493,0.21172565,0.63600713],"study_design_scores_gemma":[0.00011958097,0.00009481545,0.00073728035,0.00027935678,0.00009037694,0.0014534259,0.00031759698,0.16666856,0.05543342,0.07574525,0.6988761,0.00018429372],"about_ca_topic_score_codex":0.0023521918,"about_ca_topic_score_gemma":0.004023481,"teacher_disagreement_score":0.086341925,"about_ca_system_score_codex":0.00048570993,"about_ca_system_score_gemma":0.0004982378,"threshold_uncertainty_score":0.2888425},"labels":[],"label_agreement":null},{"id":"W4404545360","doi":"10.1007/978-3-031-73021-4_23","title":"UniIR: Training and Benchmarking Universal Multimodal Information Retrievers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmarking; Computer science; Training (meteorology); Artificial intelligence; Human–computer interaction; Geography","score_opus":0.011900803562801286,"score_gpt":0.2410022629830654,"score_spread":0.2291014594202641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404545360","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.43406305,0.015322413,0.36657917,0.00078026863,0.0017606791,0.0015709599,0.013276558,0.14550894,0.021137826],"genre_scores_gemma":[0.49370286,0.0017345422,0.41965795,0.0008500927,0.000358782,0.0015706617,0.047739882,0.0051200013,0.029265266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955918,0.0013503912,0.00036056546,0.0015094277,0.00074934104,0.00043839298],"domain_scores_gemma":[0.9953511,0.0022967793,0.00016932216,0.00107401,0.0008527973,0.0002559899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006528571,0.0028814084,0.0018566207,0.0031379843,0.0013674631,0.0021916546,0.0041543082,0.002933038,0.0122441],"category_scores_gemma":[0.012086986,0.0010823028,0.0014066986,0.0022218546,0.0009597282,0.0049869665,0.003682235,0.0021557678,0.009733526],"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.0018372694,0.0012837674,0.004070815,0.0010084192,0.00054643484,0.00020839104,0.00031373382,0.031752218,0.02002373,0.0017221463,0.0667436,0.87048954],"study_design_scores_gemma":[0.000575398,0.002485386,0.007268573,0.00026918302,0.00053180323,0.00066349143,0.0008742216,0.8594416,0.08982854,0.005244032,0.032629237,0.0001885755],"about_ca_topic_score_codex":0.008926051,"about_ca_topic_score_gemma":0.012020742,"teacher_disagreement_score":0.0122441,"about_ca_system_score_codex":0.0016004461,"about_ca_system_score_gemma":0.0017346366,"threshold_uncertainty_score":0.04096061},"labels":[],"label_agreement":null},{"id":"W4404545431","doi":"10.1007/978-3-031-73036-8_25","title":"PolyOculus: Simultaneous Multi-view Image-Based Novel View Synthesis","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Centre for Social Innovation; Vector Institute; York University","funders":"","keywords":"Computer science; Image (mathematics); Computer vision; Artificial intelligence; Image synthesis; Computer graphics (images)","score_opus":0.019415332123978026,"score_gpt":0.2813003627141269,"score_spread":0.2618850305901489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404545431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018119497,0.00022235335,0.9936609,0.000031823824,0.00009445728,0.00003477243,0.00009809908,0.0011569756,0.0028886294],"genre_scores_gemma":[0.05470392,0.00040727857,0.93716353,0.0001309113,0.000099757286,0.000099097146,0.00054666365,0.0005228042,0.006326088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995906,0.00004697105,0.000014658911,0.00009430362,0.00021902967,0.000034475866],"domain_scores_gemma":[0.9997652,0.000078841214,0.00001609351,0.000060396644,0.00005165058,0.000027853115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646158,0.0009608672,0.0008249277,0.0006356282,0.00025279194,0.0011591944,0.0011861104,0.00083776185,0.011407239],"category_scores_gemma":[0.0005461718,0.0005375184,0.0007649776,0.00068218494,0.00037001693,0.00094691594,0.0016304012,0.0009971205,0.0030157147],"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.00047567018,0.00008001186,0.00023747505,0.00033319363,0.00012806947,0.00030391253,0.000116983945,0.024632,0.29090956,0.015306614,0.01175634,0.6557201],"study_design_scores_gemma":[0.000110092864,0.00028268807,0.00061423844,0.00006316304,0.00006773924,0.0012292721,0.0000677855,0.7554755,0.16448808,0.013140263,0.064388044,0.00007305913],"about_ca_topic_score_codex":0.0006918451,"about_ca_topic_score_gemma":0.0014046102,"teacher_disagreement_score":0.011407239,"about_ca_system_score_codex":0.0003238981,"about_ca_system_score_gemma":0.00041585162,"threshold_uncertainty_score":0.03816098},"labels":[],"label_agreement":null},{"id":"W4404545529","doi":"10.1007/978-3-031-73036-8_16","title":"Volumetric Rendering with Baked Quadrature Fields","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Rendering (computer graphics); Computer graphics (images); Quadrature (astronomy); Optics; Physics","score_opus":0.01616379138164427,"score_gpt":0.26092615787081347,"score_spread":0.24476236648916921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404545529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040505053,0.00020989717,0.9792381,0.00007893049,0.000107626634,0.00002801211,0.000065220236,0.0014904841,0.014731173],"genre_scores_gemma":[0.18424354,0.0009408034,0.77842164,0.00013158262,0.00012346693,0.00006774772,0.0003708168,0.0029314407,0.032768942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969363,0.000036167705,0.0000111135105,0.000026897198,0.00020562636,0.000026642516],"domain_scores_gemma":[0.99974567,0.000094675306,0.000014933579,0.0000713768,0.00005614089,0.00001722494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043582934,0.00091767014,0.00073516776,0.00085368886,0.00035866207,0.0023616473,0.0009410891,0.00056791265,0.016574437],"category_scores_gemma":[0.0010875993,0.0006880829,0.0006754011,0.00081733556,0.0006919786,0.0016917815,0.001548809,0.0017143959,0.0032123195],"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.00019763231,0.00008002129,0.00021063296,0.00038235847,0.0000477403,0.00023628295,0.00038841326,0.066051975,0.118244916,0.4745113,0.014675814,0.3249729],"study_design_scores_gemma":[0.000114087336,0.000096323645,0.00025485683,0.00014626909,0.00003618308,0.0010187868,0.000113069815,0.60357076,0.09173413,0.19899996,0.103846096,0.000069538364],"about_ca_topic_score_codex":0.00057476264,"about_ca_topic_score_gemma":0.0006659381,"teacher_disagreement_score":0.016574437,"about_ca_system_score_codex":0.00042633386,"about_ca_system_score_gemma":0.00032789956,"threshold_uncertainty_score":0.055447042},"labels":[],"label_agreement":null},{"id":"W4404546650","doi":"10.1007/978-3-031-73021-4_13","title":"Improving Geo-Diversity of Generated Images with Contextualized Vendi Score Guidance","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute; Interface Biologics (Canada)","funders":"","keywords":"Computer science; Diversity (politics); Artificial intelligence; Computer graphics (images); Computer vision; Information retrieval","score_opus":0.01997581636985518,"score_gpt":0.2585912853276656,"score_spread":0.23861546895781044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404546650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08132509,0.000915444,0.8957124,0.00023715988,0.00023528401,0.00012726012,0.00061943574,0.01436194,0.006466049],"genre_scores_gemma":[0.5242373,0.00034784037,0.46626037,0.00017870913,0.00021032474,0.00008822806,0.0020657217,0.0015418573,0.005069719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990177,0.00013436328,0.000030773237,0.00021678073,0.0004765905,0.00012384975],"domain_scores_gemma":[0.99840933,0.00042372843,0.00009271161,0.00035548603,0.0005918383,0.0001268481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063711836,0.001215557,0.0013078052,0.0017088979,0.0005490057,0.0011268749,0.0014944331,0.0010340613,0.0051500886],"category_scores_gemma":[0.0041497736,0.0003734042,0.00064644567,0.0016221723,0.0004102687,0.001062896,0.0020003314,0.0012122443,0.002551541],"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.0010812595,0.0003101118,0.0030304943,0.00017168533,0.00011910093,0.00018437742,0.00019673086,0.07100637,0.09318356,0.0033740385,0.012629222,0.81471294],"study_design_scores_gemma":[0.0000858086,0.0002397751,0.0026856472,0.000020272773,0.00006782881,0.00026921259,0.00011714046,0.9459152,0.040176995,0.0030035556,0.0073757116,0.000042853],"about_ca_topic_score_codex":0.0066299834,"about_ca_topic_score_gemma":0.01117764,"teacher_disagreement_score":0.0066299834,"about_ca_system_score_codex":0.000513728,"about_ca_system_score_gemma":0.0009356782,"threshold_uncertainty_score":0.017228723},"labels":[],"label_agreement":null},{"id":"W4404563191","doi":"10.1007/978-3-031-73650-6_23","title":"Cocktail Universal Adversarial Attack on Deep Neural Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Computer science; Adversarial system; Artificial neural network; Artificial intelligence; Deep neural networks; Computer security","score_opus":0.017317118369238847,"score_gpt":0.2599931781544103,"score_spread":0.24267605978517146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404563191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01681843,0.0007880256,0.9678422,0.00037222452,0.000130297,0.000026964472,0.000100663456,0.0005472212,0.013373956],"genre_scores_gemma":[0.8431308,0.0015690412,0.1155227,0.00051552744,0.00020327113,0.00013216527,0.00032522684,0.00035768867,0.03824359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897575,0.00029842622,0.000038800463,0.00015590101,0.0003547947,0.00017641032],"domain_scores_gemma":[0.9982748,0.001058572,0.000110764064,0.00034855705,0.00013343277,0.00007381764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013058305,0.001083357,0.0011688147,0.0005378828,0.00048397106,0.0010924513,0.0011417826,0.0015767779,0.004307254],"category_scores_gemma":[0.0040018116,0.0006993525,0.0010138042,0.0006621706,0.001714973,0.0021168555,0.004251826,0.0032947892,0.0010121473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038044224,0.00004603402,0.00036780522,0.00013895967,0.00017862253,0.00016812887,0.00007549547,0.7069414,0.014693094,0.17183845,0.0063128327,0.09885866],"study_design_scores_gemma":[0.00000676239,0.00003614843,0.00012796154,0.000018292736,0.000014804037,0.00006787327,0.0000072043367,0.92861086,0.0037076988,0.06573518,0.0016522148,0.000014911469],"about_ca_topic_score_codex":0.0006593934,"about_ca_topic_score_gemma":0.0006773162,"teacher_disagreement_score":0.004307254,"about_ca_system_score_codex":0.00084518216,"about_ca_system_score_gemma":0.0005072119,"threshold_uncertainty_score":0.014409125},"labels":[],"label_agreement":null},{"id":"W4404563527","doi":"10.1007/978-3-031-73650-6_15","title":"Visual Relationship Transformation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transformation (genetics); Computer graphics (images); Artificial intelligence; Computer vision","score_opus":0.03189432167681258,"score_gpt":0.30936090393403537,"score_spread":0.27746658225722276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404563527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062406324,0.0009582384,0.80575234,0.00037788606,0.00048395252,0.0003108139,0.0018497021,0.013381755,0.17064467],"genre_scores_gemma":[0.16890644,0.0023819534,0.5503333,0.0006081777,0.00019805344,0.00035162544,0.012028047,0.0053169252,0.2598755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963987,0.000033257715,0.000012745745,0.00015253999,0.00012229971,0.000039294646],"domain_scores_gemma":[0.9997987,0.00002009419,0.000010261386,0.00009332728,0.00005959216,0.000018094992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023315498,0.0008964975,0.00039327348,0.0013876957,0.00049946696,0.002026091,0.0010487839,0.0005649129,0.077905074],"category_scores_gemma":[0.0008260963,0.00036835394,0.0006823429,0.0013325003,0.00041009547,0.0014453366,0.001591275,0.0010857551,0.036050245],"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.00011850584,0.000070143244,0.00018372547,0.0001550466,0.000021199563,0.00008849409,0.00009648828,0.0023562463,0.043771073,0.044976678,0.048408955,0.85975343],"study_design_scores_gemma":[0.00004767686,0.00015812523,0.0016791085,0.00014024504,0.00006947164,0.0010446981,0.00036167342,0.08138917,0.121037215,0.064505905,0.72951204,0.00005460385],"about_ca_topic_score_codex":0.0027025188,"about_ca_topic_score_gemma":0.0026728522,"teacher_disagreement_score":0.077905074,"about_ca_system_score_codex":0.00046328426,"about_ca_system_score_gemma":0.00052021444,"threshold_uncertainty_score":0.26061845},"labels":[],"label_agreement":null},{"id":"W4404582517","doi":"10.1007/978-3-031-72643-9_26","title":"Efficient and Versatile Robust Fine-Tuning of Zero-Shot Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Shot (pellet); Zero (linguistics); Algorithm; Artificial intelligence; Materials science","score_opus":0.02636609983055857,"score_gpt":0.2511047402448113,"score_spread":0.2247386404142527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404582517","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.007725041,0.0002183876,0.9890505,0.00007380588,0.00003263368,0.000027691964,0.000035133784,0.00068738475,0.0021493877],"genre_scores_gemma":[0.71044,0.00031596233,0.27769756,0.00023756699,0.00007801806,0.00017657931,0.0003490893,0.0005245921,0.0101806875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916446,0.00020378304,0.000032686545,0.00022705799,0.00024545554,0.0001266427],"domain_scores_gemma":[0.9984816,0.0008851983,0.00008609491,0.00032768367,0.00013437367,0.00008510738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014731621,0.001075552,0.0016578378,0.000452921,0.00044246178,0.0012903387,0.002599114,0.0019521102,0.0037967109],"category_scores_gemma":[0.005833406,0.00077394856,0.0009195835,0.00041753208,0.0010908045,0.0017484773,0.0036886046,0.0025877492,0.0009907858],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016283822,0.00008159537,0.00024350725,0.000099840385,0.00006783182,0.00006463595,0.00007144865,0.82265306,0.012384683,0.03992938,0.00286207,0.12137908],"study_design_scores_gemma":[0.0000033872877,0.000014137032,0.000028308692,0.0000046968,0.000003506784,0.000015310345,0.0000035104144,0.98866826,0.00093901024,0.010044078,0.0002709001,0.000004959891],"about_ca_topic_score_codex":0.0019143524,"about_ca_topic_score_gemma":0.0027970804,"teacher_disagreement_score":0.0037967109,"about_ca_system_score_codex":0.00083414663,"about_ca_system_score_gemma":0.0009592125,"threshold_uncertainty_score":0.012701213},"labels":[],"label_agreement":null},{"id":"W4404582541","doi":"10.1007/978-3-031-77019-7_7","title":"On Concurrent Program Algebra and Demonic Automata","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"McMaster University","funders":"","keywords":"Computer science; Automaton; Programming language; Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.012291815710185047,"score_gpt":0.257131009493719,"score_spread":0.24483919378353391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404582541","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.017465034,0.02233016,0.57960767,0.0041773054,0.0026897637,0.00010859002,0.0003004985,0.0005625091,0.37275842],"genre_scores_gemma":[0.6064393,0.021272251,0.1756885,0.002611623,0.0050388565,0.0004833606,0.00081242016,0.00049469393,0.187159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928975,0.00022639579,0.000050987583,0.00014044813,0.0002148298,0.000077661345],"domain_scores_gemma":[0.9990808,0.00053959846,0.000047660626,0.00014978166,0.00013943075,0.000042688214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095358666,0.0010338288,0.000834969,0.001512692,0.00181181,0.002794778,0.0012176422,0.0010564986,0.009763395],"category_scores_gemma":[0.0023122644,0.0007501742,0.0012949298,0.0028523863,0.004175075,0.008104099,0.0016406439,0.0035106293,0.001992338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050373387,0.0000053905683,0.00001860398,0.000027044762,0.000002308764,0.000017718012,0.00008989766,0.00047083717,0.00017715537,0.9927893,0.0010577446,0.005338888],"study_design_scores_gemma":[0.0000019865208,0.000003167324,0.000019819636,0.0000100692205,0.0000023266905,0.000027979262,0.0000144906635,0.00093211833,0.0001150002,0.98888236,0.009986932,0.0000037203145],"about_ca_topic_score_codex":0.0023109973,"about_ca_topic_score_gemma":0.0019796302,"teacher_disagreement_score":0.009763395,"about_ca_system_score_codex":0.0022883008,"about_ca_system_score_gemma":0.0009320812,"threshold_uncertainty_score":0.032661796},"labels":[],"label_agreement":null},{"id":"W4404589970","doi":"10.1007/978-3-031-77961-9_5","title":"Advances in OpenASR21 Evaluation with Increased Temporal Resolution for Speech Self-supervised Learning Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Resolution (logic); Artificial intelligence; Speech recognition; Machine learning","score_opus":0.038711057289161604,"score_gpt":0.27545460294724594,"score_spread":0.23674354565808434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404589970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10451028,0.016187713,0.76409674,0.0022183887,0.0046761683,0.00076280173,0.009086107,0.07190656,0.026555194],"genre_scores_gemma":[0.33612958,0.003495212,0.54462695,0.001260146,0.0011886304,0.0010284021,0.067381084,0.009069296,0.03582068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9818557,0.0073000942,0.0013604253,0.003170061,0.00567025,0.00064350985],"domain_scores_gemma":[0.98322994,0.0063222954,0.000395822,0.0029760865,0.0065067923,0.0005690402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018445099,0.0031555146,0.0026411265,0.0025977804,0.0014130943,0.0040983525,0.0035636805,0.0038100483,0.012705398],"category_scores_gemma":[0.026703494,0.0008431166,0.0023418851,0.0016880713,0.00088941073,0.0045157545,0.0034961149,0.004215648,0.012842916],"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.0017868325,0.0007690191,0.0027780891,0.0007927248,0.0008078528,0.00017349486,0.00015791133,0.057099257,0.02154908,0.0030623577,0.05023848,0.8607849],"study_design_scores_gemma":[0.00022335885,0.0012059573,0.0044368077,0.00021864196,0.00040523632,0.00048400124,0.00020065397,0.8745901,0.06465128,0.0055033304,0.047901005,0.00017975806],"about_ca_topic_score_codex":0.0107286675,"about_ca_topic_score_gemma":0.011891164,"teacher_disagreement_score":0.018445099,"about_ca_system_score_codex":0.0013732747,"about_ca_system_score_gemma":0.0019027239,"threshold_uncertainty_score":0.09754819},"labels":[],"label_agreement":null},{"id":"W4404591500","doi":"10.1007/978-3-031-78014-1_12","title":"On the Influence of CNN-Based Feature Learning Modules in Neural Speaker Verification Framework","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Speaker verification; Feature (linguistics); Speech recognition; Artificial intelligence; Artificial neural network; Speaker recognition; Pattern recognition (psychology)","score_opus":0.016975000110396377,"score_gpt":0.24203839625826967,"score_spread":0.2250633961478733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404591500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06819785,0.0074082515,0.90774345,0.0006869803,0.00026158555,0.000046667254,0.00012565887,0.0007334774,0.014796072],"genre_scores_gemma":[0.867798,0.0034521606,0.116110474,0.00028733775,0.0003407789,0.000040604962,0.00025202878,0.0002306196,0.011488107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995161,0.00016188907,0.000018880535,0.00011918081,0.000118758966,0.00006518915],"domain_scores_gemma":[0.99909425,0.00051813934,0.00004107185,0.00010363177,0.00020722627,0.000035643778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013258057,0.0007469182,0.00065341097,0.00028999217,0.00024359721,0.0007683925,0.0009811663,0.0008667599,0.0030746125],"category_scores_gemma":[0.003010036,0.00027415104,0.00052973843,0.00029622868,0.0005166462,0.0015974606,0.00090401556,0.0009973191,0.00064179127],"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.0006401426,0.00014028567,0.0019734055,0.0002589709,0.00024025286,0.00023293337,0.000092809525,0.28235978,0.061002202,0.05155812,0.0051367027,0.5963644],"study_design_scores_gemma":[0.0000061610713,0.00006127697,0.0005872668,0.000013672715,0.00005304188,0.000059833925,0.000010536656,0.98258233,0.009423752,0.005734555,0.0014594031,0.00000806885],"about_ca_topic_score_codex":0.0074774204,"about_ca_topic_score_gemma":0.007844265,"teacher_disagreement_score":0.0074774204,"about_ca_system_score_codex":0.00059337326,"about_ca_system_score_gemma":0.0005996736,"threshold_uncertainty_score":0.014867842},"labels":[],"label_agreement":null},{"id":"W4404610709","doi":"10.1007/978-3-031-77792-9_23","title":"Ontology-Constrained Generation of Domain-Specific Clinical Summaries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Polytechnique Montréal; Héma-Québec","funders":"","keywords":"Computer science; Ontology; Domain (mathematical analysis); Information retrieval; Natural language processing; Artificial intelligence","score_opus":0.04570157674357549,"score_gpt":0.3071494366296804,"score_spread":0.2614478598861049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404610709","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.05462617,0.0008666705,0.8788453,0.0011378423,0.00032838993,0.0010844555,0.026568891,0.029205505,0.0073368135],"genre_scores_gemma":[0.23082612,0.00055365363,0.71057916,0.0002945674,0.0000990104,0.00050547725,0.05271621,0.0010857022,0.0033400818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932384,0.00015457014,0.00008758903,0.00018709678,0.00019386293,0.000053151787],"domain_scores_gemma":[0.99741673,0.0014168505,0.00016460984,0.00030476297,0.0005958224,0.00010121211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010406283,0.000809617,0.0006717181,0.0032841552,0.0004833604,0.0013093918,0.0011479044,0.0008172141,0.0068011703],"category_scores_gemma":[0.006452267,0.00042091694,0.0013825268,0.0022481156,0.00026907993,0.000954081,0.0017254378,0.0007661066,0.0018149578],"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.00078234926,0.00040898085,0.005396846,0.0012804319,0.00030415578,0.0015267959,0.000610445,0.06876522,0.024969172,0.018014476,0.08051915,0.797422],"study_design_scores_gemma":[0.00029115935,0.00017597975,0.0039324043,0.00022071225,0.00031930336,0.0009166735,0.0005744882,0.84817195,0.040592935,0.043756455,0.06096713,0.000080787446],"about_ca_topic_score_codex":0.0054163393,"about_ca_topic_score_gemma":0.011009494,"teacher_disagreement_score":0.0068011703,"about_ca_system_score_codex":0.00087070005,"about_ca_system_score_gemma":0.0026221517,"threshold_uncertainty_score":0.022752166},"labels":[],"label_agreement":null},{"id":"W4404624946","doi":"10.1007/978-3-031-73411-3_12","title":"HumanRefiner: Benchmarking Abnormal Human Generation and Refining with Coarse-to-Fine Pose-Reversible Guidance","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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":"Huawei Technologies (Canada)","funders":"","keywords":"Benchmarking; Computer science; Refining (metallurgy); Artificial intelligence; Computer vision; Chemistry; Management","score_opus":0.02346539595968715,"score_gpt":0.23886744538457033,"score_spread":0.21540204942488317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404624946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33776453,0.0064248354,0.47688264,0.0007677141,0.0022689,0.0010870303,0.013857997,0.1355951,0.025351219],"genre_scores_gemma":[0.68415225,0.0006341705,0.26731095,0.0004526256,0.00013694509,0.00035769897,0.028383726,0.006639794,0.011931803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977457,0.0006098561,0.00012229891,0.00064435333,0.0006650353,0.00021282333],"domain_scores_gemma":[0.9967583,0.0019279671,0.00010243902,0.00065807026,0.00038032522,0.00017291986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024868478,0.0023593777,0.0014024944,0.0015000192,0.00057210197,0.0017162199,0.0031530603,0.0029108038,0.011543488],"category_scores_gemma":[0.006979407,0.000701432,0.001091214,0.0008920425,0.0011839799,0.0010409422,0.0019962597,0.001456873,0.003993376],"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.0035867095,0.00074300775,0.004060698,0.0012538824,0.0006593766,0.00061736646,0.00036888797,0.42254487,0.015556914,0.0032025145,0.069495544,0.47791022],"study_design_scores_gemma":[0.00023842542,0.0006865667,0.002582652,0.000055907803,0.00005820959,0.0005095231,0.00013664163,0.9673556,0.018334476,0.002600939,0.007374624,0.0000663676],"about_ca_topic_score_codex":0.011656509,"about_ca_topic_score_gemma":0.015912924,"teacher_disagreement_score":0.011656509,"about_ca_system_score_codex":0.0008302242,"about_ca_system_score_gemma":0.00086663564,"threshold_uncertainty_score":0.038616776},"labels":[],"label_agreement":null},{"id":"W4404625217","doi":"10.1007/978-3-031-73411-3_5","title":"PIXART-$$\\Sigma $$: Weak-to-Strong Training of Diffusion Transformer for 4K Text-to-Image Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Transformer; Sigma; Artificial intelligence; Computer vision; Electrical engineering; Physics; Quantum mechanics; Voltage","score_opus":0.03174797090960109,"score_gpt":0.2780515632484664,"score_spread":0.24630359233886534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404625217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018711602,0.00052490406,0.9444055,0.00022860026,0.00031232933,0.00010754592,0.0004783027,0.025441535,0.009789704],"genre_scores_gemma":[0.25593024,0.00034109247,0.7034806,0.00042214768,0.00009343648,0.00017422452,0.003195378,0.0035057936,0.032857124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976104,0.0000403164,0.000013257525,0.0000658592,0.000077175486,0.00004232156],"domain_scores_gemma":[0.9997458,0.000082772814,0.000011719948,0.00006725084,0.000065507666,0.000027015883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050386484,0.0010790285,0.00052590127,0.00049654185,0.00038161772,0.0006752303,0.0012398219,0.0010012863,0.024522249],"category_scores_gemma":[0.001056335,0.00046273237,0.0005236339,0.00041635992,0.0004150981,0.0009567869,0.0012127733,0.0015410497,0.009434743],"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.0004061155,0.00012539224,0.0004419122,0.0001484923,0.00005710057,0.000113374415,0.00006772149,0.038307082,0.054873407,0.008164566,0.031865254,0.86542976],"study_design_scores_gemma":[0.00005070508,0.00016073078,0.0003987621,0.000027066342,0.000025612924,0.00022045686,0.000029752115,0.88483214,0.090165436,0.005849741,0.018212194,0.000027353834],"about_ca_topic_score_codex":0.003786425,"about_ca_topic_score_gemma":0.008935104,"teacher_disagreement_score":0.024522249,"about_ca_system_score_codex":0.00048570416,"about_ca_system_score_gemma":0.00080451084,"threshold_uncertainty_score":0.082035065},"labels":[],"label_agreement":null},{"id":"W4404646304","doi":"10.1007/978-981-96-0348-0_2","title":"Combined Change Operators for Trust and Belief","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","field":"Social Sciences","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Belief revision; Artificial intelligence; Theoretical computer science","score_opus":0.028327022194083937,"score_gpt":0.29089951464604746,"score_spread":0.2625724924519635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404646304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009745534,0.00066884997,0.96332276,0.001160367,0.00026793792,0.00005486973,0.0001485213,0.00024389023,0.02438736],"genre_scores_gemma":[0.6152887,0.0009201429,0.33898163,0.0004807813,0.00066980364,0.00040623706,0.00035560384,0.0003562649,0.042540897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657506,0.0013970899,0.00022573168,0.0005429708,0.0010024443,0.0002566535],"domain_scores_gemma":[0.99158597,0.0058560558,0.00030260597,0.001190706,0.0008370628,0.00022760483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042315735,0.00091471523,0.0010962756,0.0014423961,0.0010253378,0.0037664282,0.0018006191,0.0019069285,0.014042348],"category_scores_gemma":[0.013073344,0.0005199007,0.0019766723,0.0017676422,0.004366862,0.012628843,0.0030350953,0.005334439,0.0013866025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039720184,0.000020366524,0.00008307937,0.000044661625,0.00001673516,0.000040184404,0.00021011394,0.002303006,0.00041722515,0.97712266,0.0013009273,0.018401278],"study_design_scores_gemma":[0.000012666644,0.000023148164,0.000080607475,0.000013547672,0.000016171418,0.000057512927,0.00006994422,0.039955422,0.00033608606,0.956369,0.0030524344,0.000013586332],"about_ca_topic_score_codex":0.0018155557,"about_ca_topic_score_gemma":0.0013632716,"teacher_disagreement_score":0.014042348,"about_ca_system_score_codex":0.0022957625,"about_ca_system_score_gemma":0.0007623688,"threshold_uncertainty_score":0.046976328},"labels":[],"label_agreement":null},{"id":"W4404646327","doi":"10.1007/978-981-96-0351-0_16","title":"Equality Generating Dependencies in Description Logics via Path Agreements","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Path (computing); Theoretical computer science; Algorithm; Programming language","score_opus":0.049490198762420556,"score_gpt":0.2719232667920199,"score_spread":0.22243306802959933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404646327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007943596,0.00022586498,0.9806363,0.00040518172,0.000057707697,0.000094022005,0.00020510553,0.00091159454,0.009520577],"genre_scores_gemma":[0.30084717,0.0006408761,0.68322,0.0003610223,0.00012309362,0.00032111508,0.0013748913,0.00091556896,0.012196299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99202347,0.003046272,0.00066454476,0.0012995041,0.002439388,0.0005267762],"domain_scores_gemma":[0.97783935,0.017780997,0.0005204983,0.0025782308,0.0009565586,0.00032441906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074097826,0.00080450554,0.0010686889,0.0025862309,0.0020656686,0.0042185313,0.003648101,0.0017456689,0.010345376],"category_scores_gemma":[0.021464124,0.00177192,0.0027812344,0.0039079147,0.0043148724,0.016909974,0.0074713007,0.005684387,0.0020459138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005483393,0.000051688123,0.00017720828,0.00010892889,0.000019250025,0.00007930839,0.00031053837,0.010800728,0.000645166,0.92763376,0.002066253,0.058052417],"study_design_scores_gemma":[0.000010484592,0.000008279303,0.00003492082,0.000026024805,0.000017150207,0.000032353877,0.000048476977,0.032321334,0.001667192,0.9621319,0.0036889191,0.000012957193],"about_ca_topic_score_codex":0.0023802456,"about_ca_topic_score_gemma":0.0022580493,"teacher_disagreement_score":0.010345376,"about_ca_system_score_codex":0.002817591,"about_ca_system_score_gemma":0.0019416572,"threshold_uncertainty_score":0.039187133},"labels":[],"label_agreement":null},{"id":"W4404654733","doi":"10.1007/978-3-031-72995-9_5","title":"Relightable 3D Gaussians: Realistic Point Cloud Relighting with BRDF Decomposition and Ray Tracing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Ray tracing (physics); Bidirectional reflectance distribution function; Distributed ray tracing; Decomposition; Computer graphics (images); Point cloud; Cloud computing; Tracing; Reflectivity; Artificial intelligence; Optics; Rendering (computer graphics); Physics","score_opus":0.010263806786278423,"score_gpt":0.26358664613200716,"score_spread":0.25332283934572875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404654733","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.006701539,0.00013441368,0.98697424,0.000068346,0.000027904269,0.0000385432,0.00022762739,0.003571491,0.0022558721],"genre_scores_gemma":[0.13246888,0.000415582,0.858332,0.0000843844,0.000028076207,0.000066257504,0.00082049024,0.0031565682,0.0046278257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995472,0.000060670936,0.000016481243,0.0000463876,0.0002948956,0.000034376404],"domain_scores_gemma":[0.9993782,0.0002414477,0.000045348163,0.00020253132,0.00010377507,0.000028646507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046045578,0.0009202084,0.0010016265,0.00070101867,0.0003458818,0.0014678492,0.0016263971,0.0012169274,0.008473929],"category_scores_gemma":[0.0017323227,0.0010596118,0.0010591943,0.0010402828,0.0005747086,0.0013454811,0.0018573437,0.0017729332,0.0023962555],"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.0002539299,0.000143726,0.0007900078,0.00041124487,0.00010560423,0.00035077165,0.00065846165,0.46969432,0.058599487,0.056202415,0.014761757,0.39802834],"study_design_scores_gemma":[0.000017190809,0.000018193496,0.00012990933,0.000016843042,0.0000074943036,0.00013970611,0.000023411849,0.97701716,0.008167215,0.007534816,0.0069079194,0.000020114063],"about_ca_topic_score_codex":0.0028093848,"about_ca_topic_score_gemma":0.003593157,"teacher_disagreement_score":0.008473929,"about_ca_system_score_codex":0.0005642282,"about_ca_system_score_gemma":0.00049239513,"threshold_uncertainty_score":0.028348148},"labels":[],"label_agreement":null},{"id":"W4404654748","doi":"10.1007/978-3-031-72995-9_10","title":"PanGu-Draw: Advancing Resource-Efficient Text-to-Image Synthesis with Time-Decoupled Training and Reusable Coop-Diffusion","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Diffusion; Image (mathematics); Resource (disambiguation); Training (meteorology); Multimedia; Computer graphics (images); Artificial intelligence; Computer vision; Computer network","score_opus":0.008880837916798421,"score_gpt":0.21454081047762943,"score_spread":0.20565997256083102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404654748","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.003454582,0.00040023436,0.97953886,0.000114295995,0.00015517593,0.000053981163,0.00013516808,0.009991852,0.0061558336],"genre_scores_gemma":[0.13906895,0.00049256993,0.83443505,0.00046943253,0.00013663076,0.00021339765,0.0009157333,0.0036103083,0.020657863],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947196,0.00007912364,0.000021400096,0.00014331048,0.00023142077,0.000052778974],"domain_scores_gemma":[0.9993668,0.00032497902,0.000026918398,0.00016908026,0.00007536151,0.000036837955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053626567,0.0014880748,0.0010700602,0.0005421139,0.00039079608,0.0012753463,0.002355082,0.0015907843,0.0177695],"category_scores_gemma":[0.0023915102,0.0005510739,0.00079947384,0.00056880387,0.00080188987,0.001393568,0.0031769911,0.0023108302,0.0071476093],"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.00039897938,0.00018215175,0.00027389772,0.00027283147,0.00011868257,0.00021705758,0.00015614,0.20299837,0.057294395,0.03570359,0.028178625,0.6742053],"study_design_scores_gemma":[0.00003649826,0.000059046743,0.00004802078,0.000016214473,0.000014598544,0.00007497525,0.00002017766,0.95263875,0.019196222,0.018366322,0.0095152445,0.000013896207],"about_ca_topic_score_codex":0.002408299,"about_ca_topic_score_gemma":0.004557732,"teacher_disagreement_score":0.0177695,"about_ca_system_score_codex":0.00053638505,"about_ca_system_score_gemma":0.0007712395,"threshold_uncertainty_score":0.059444845},"labels":[],"label_agreement":null},{"id":"W4404657409","doi":"10.1007/978-981-96-0602-3","title":"Dependable Software Engineering. Theories, Tools, and Applications","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; Singapore Management University; Shenzhen University; Peking University; Uppsala Universitet; National University of Defense Technology; Universität des Saarlandes; Macquarie University; University of Chinese Academy of Sciences; Shanghai Jiao Tong University; Zhejiang University; University of Waterloo; University of Tehran; University of New South Wales; University College London; Purdue University; University of Oxford; California Institute of Technology; Aarhus Universitet; East China Normal University; Capital Normal University; Beihang University; Institute of Science and Technology Austria; Université du Luxembourg","keywords":"Computer science; Software engineering; Software; Programming language; Software development","score_opus":0.006946825628973734,"score_gpt":0.21828661540254987,"score_spread":0.21133978977357615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404657409","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.0035522676,0.35479358,0.43024358,0.006862498,0.0037379367,0.00011339147,0.00094884395,0.0025735667,0.19717436],"genre_scores_gemma":[0.16730703,0.28207552,0.20154963,0.002541221,0.005602457,0.00045343998,0.0021608297,0.0017340259,0.3365759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992532,0.00007334707,0.000042289652,0.00008867712,0.0005108387,0.000031657964],"domain_scores_gemma":[0.9979253,0.0012640106,0.00014596584,0.00030499772,0.0002962555,0.0000635506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006496227,0.0015010042,0.0010434218,0.0023127857,0.00053852686,0.0026734637,0.0017106314,0.0013358275,0.012654895],"category_scores_gemma":[0.002609167,0.000998606,0.0006657807,0.0031176275,0.002158305,0.0043184957,0.0011313839,0.003043684,0.005710619],"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.000017952038,0.000053615644,0.00021419318,0.00076832186,0.000026749605,0.00008951306,0.00026254536,0.006453718,0.0015662662,0.554424,0.10507397,0.3310491],"study_design_scores_gemma":[0.000011581311,0.00003461553,0.0003761605,0.00039049465,0.000027291966,0.00037456964,0.00006252551,0.013606966,0.0009135006,0.7145231,0.2696597,0.000019483105],"about_ca_topic_score_codex":0.0013370106,"about_ca_topic_score_gemma":0.0016505553,"teacher_disagreement_score":0.012654895,"about_ca_system_score_codex":0.0011077584,"about_ca_system_score_gemma":0.0010877107,"threshold_uncertainty_score":0.042334855},"labels":[],"label_agreement":null},{"id":"W4404668737","doi":"10.1007/978-3-031-74353-5_11","title":"Towards Game Design Elements on the Perception of a Fun Game: An Exergame Case Study","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Perception; Human–computer interaction; Game design; Video game design; Multimedia; Simulation; Psychology","score_opus":0.053243045384154794,"score_gpt":0.32472844081594815,"score_spread":0.27148539543179334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404668737","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.9670698,0.00017990178,0.007102112,0.0005771303,0.000016899634,0.00019080678,0.0000375512,0.000013389102,0.02481235],"genre_scores_gemma":[0.9929636,0.00012250895,0.0029978293,0.00006570176,0.0000026749176,0.00004550403,0.000021405393,0.000010998143,0.0037697663],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99786633,0.0012377386,0.000052874406,0.00016961136,0.00042000617,0.000253539],"domain_scores_gemma":[0.9971679,0.0019289627,0.00018603377,0.000091557966,0.00035251226,0.0002730519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002567824,0.0005330904,0.0002840634,0.0012245651,0.0019678767,0.0035684928,0.0009283278,0.0015074379,0.0034671286],"category_scores_gemma":[0.005285043,0.00033336933,0.00043646042,0.00074462587,0.002498689,0.001958848,0.0027634297,0.0013727288,0.0003980385],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005837246,0.003992489,0.10748194,0.0008054442,0.00007793251,0.007977085,0.7360504,0.0015214803,0.020577757,0.031625595,0.002213637,0.08709241],"study_design_scores_gemma":[0.000056428642,0.0010289601,0.11670435,0.00068662135,0.00013119879,0.00511037,0.8216839,0.0060118358,0.0075753387,0.009770973,0.031154864,0.00008520967],"about_ca_topic_score_codex":0.005342093,"about_ca_topic_score_gemma":0.008252508,"teacher_disagreement_score":0.005342093,"about_ca_system_score_codex":0.0018755068,"about_ca_system_score_gemma":0.00108159,"threshold_uncertainty_score":0.0136078},"labels":[],"label_agreement":null},{"id":"W4404672046","doi":"10.1007/978-3-031-73024-5_1","title":"How to Train the Teacher Model for Effective Knowledge Distillation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology-Enhanced Education Studies","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distillation; Artificial intelligence","score_opus":0.03277099080217485,"score_gpt":0.338730442324303,"score_spread":0.30595945152212817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404672046","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.033952862,0.0006724981,0.87145424,0.015689092,0.0003470705,0.00037594902,0.00030182247,0.0028759658,0.07433061],"genre_scores_gemma":[0.3437329,0.0007821783,0.60409766,0.001223412,0.00007549599,0.00050072273,0.00041858864,0.00038551565,0.048783585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993344,0.00028565852,0.00003529382,0.00010327126,0.00018611197,0.0000553438],"domain_scores_gemma":[0.99762684,0.0011691942,0.00010341474,0.00038938236,0.00050501525,0.0002061502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014451143,0.00040962076,0.00039406327,0.00047932233,0.00060359633,0.0022745782,0.0009349359,0.001487686,0.017447462],"category_scores_gemma":[0.00667332,0.00035210108,0.00046494484,0.00042649318,0.00078261533,0.006876411,0.0019690224,0.002241718,0.0054675085],"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.00021023037,0.0007149135,0.0036802522,0.0005846397,0.00006998419,0.0002479979,0.0024313757,0.02419363,0.010857189,0.18608393,0.037267487,0.7336583],"study_design_scores_gemma":[0.00021068561,0.0004854055,0.0022896738,0.00048025808,0.00012640818,0.0005914546,0.0034214829,0.34163815,0.033837434,0.43077844,0.18604773,0.000092972645],"about_ca_topic_score_codex":0.003262254,"about_ca_topic_score_gemma":0.005308158,"teacher_disagreement_score":0.017447462,"about_ca_system_score_codex":0.000825258,"about_ca_system_score_gemma":0.0026154772,"threshold_uncertainty_score":0.05836761},"labels":[],"label_agreement":null},{"id":"W4404672157","doi":"10.1007/978-3-031-73024-5_8","title":"LaWa: Using Latent Space for In-Generation Image Watermarking","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of British Columbia","funders":"","keywords":"Computer science; Digital watermarking; Computer vision; Image (mathematics); Artificial intelligence; Space (punctuation); Computer graphics (images); Operating system","score_opus":0.029498251619627894,"score_gpt":0.27520539849435577,"score_spread":0.2457071468747279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404672157","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.0039121266,0.00033860345,0.98671746,0.000093206756,0.0000924242,0.000036676993,0.000115502924,0.0053923903,0.003301619],"genre_scores_gemma":[0.2528097,0.0007907695,0.7120417,0.00020080597,0.00013848234,0.00016186103,0.00094789785,0.0014279209,0.031480946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956745,0.00010546073,0.000020609225,0.00006994935,0.00019220346,0.00004432969],"domain_scores_gemma":[0.99960035,0.00011140864,0.000035150155,0.00016051982,0.00006935758,0.000023206925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004955891,0.0005874089,0.00044012038,0.0007516222,0.0003823437,0.0014327548,0.0006977142,0.0007379327,0.009245496],"category_scores_gemma":[0.0013227169,0.00029769752,0.00055095076,0.00076293014,0.0007115236,0.0022987395,0.0018907782,0.0010712557,0.0042815474],"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.00048210277,0.00019771999,0.00045857666,0.00026272322,0.000063771215,0.00024523155,0.00021237256,0.023390196,0.10925056,0.10578573,0.017109012,0.74254197],"study_design_scores_gemma":[0.000081199476,0.00019056971,0.0004520502,0.000055551955,0.000035527693,0.0006997052,0.00006771922,0.7483423,0.11961289,0.068163395,0.062238388,0.00006067546],"about_ca_topic_score_codex":0.0004769383,"about_ca_topic_score_gemma":0.0006026955,"teacher_disagreement_score":0.009245496,"about_ca_system_score_codex":0.00032227853,"about_ca_system_score_gemma":0.00034096965,"threshold_uncertainty_score":0.030929208},"labels":[],"label_agreement":null},{"id":"W4404672160","doi":"10.1007/978-3-031-73024-5_10","title":"Markov Knowledge Distillation: Make Nasty Teachers Trained by Self-undermining Knowledge Distillation Fully Distillable","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Distillation; Computer science; Markov chain; Markov process; Artificial intelligence; Machine learning; Chromatography; Chemistry; Mathematics; Statistics","score_opus":0.014151228164921693,"score_gpt":0.2643206319185038,"score_spread":0.2501694037535821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404672160","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.02786698,0.0005048056,0.941713,0.0020470768,0.0004154322,0.00007760345,0.00064488995,0.007602195,0.019127924],"genre_scores_gemma":[0.5046471,0.00039194693,0.44805875,0.0009877263,0.00019352384,0.00017574428,0.0014714523,0.00096843444,0.043105263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.00017079888,0.00002979287,0.00022865077,0.0001841525,0.00008602325],"domain_scores_gemma":[0.9983352,0.000697265,0.00008058106,0.00051455083,0.0002535544,0.000118885015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010660178,0.0007084068,0.0006007451,0.0003287563,0.00057285116,0.0010778736,0.0017880081,0.0013003306,0.011189148],"category_scores_gemma":[0.004853563,0.0005063933,0.00056227914,0.00036756397,0.0013427314,0.004128642,0.003844813,0.003399915,0.0038063219],"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.0006747669,0.00022962071,0.001346796,0.0002573854,0.00007622729,0.00010822516,0.00050255226,0.1005172,0.017246187,0.17757562,0.03605099,0.66541445],"study_design_scores_gemma":[0.00007338514,0.00012188432,0.00031926553,0.00007050787,0.00004039955,0.000069633155,0.000100875615,0.7296533,0.01861057,0.22922578,0.02167656,0.000037787035],"about_ca_topic_score_codex":0.002573628,"about_ca_topic_score_gemma":0.00678945,"teacher_disagreement_score":0.011189148,"about_ca_system_score_codex":0.0006604283,"about_ca_system_score_gemma":0.0021031199,"threshold_uncertainty_score":0.03743136},"labels":[],"label_agreement":null},{"id":"W4404672886","doi":"10.1007/978-3-031-73027-6_3","title":"Pseudo-Keypoint RKHS Learning for Self-supervised 6DoF Pose Estimation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","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":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence; Pose; Reproducing kernel Hilbert space; Pattern recognition (psychology); Machine learning; Computer vision; Mathematics; Hilbert space","score_opus":0.015779172881438618,"score_gpt":0.23821169419086127,"score_spread":0.22243252130942265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404672886","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.0020803062,0.00027409766,0.99619776,0.00004245229,0.000047392205,0.000027943888,0.00007410437,0.00078206987,0.00047383684],"genre_scores_gemma":[0.13097678,0.0006956654,0.85708106,0.00016883902,0.00018122284,0.00027533775,0.0012056822,0.0003821578,0.009033236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918693,0.00019037878,0.000043449716,0.00022626652,0.00028569755,0.000067209905],"domain_scores_gemma":[0.99890065,0.00038907368,0.00009456164,0.00031608806,0.00025171292,0.000047893318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009718715,0.0010694987,0.001847199,0.00064308685,0.00039367971,0.00081552606,0.0021123698,0.0018119075,0.006952632],"category_scores_gemma":[0.003351962,0.0006862738,0.0008104804,0.0010299104,0.00068623753,0.0016778159,0.0019452012,0.0019940804,0.0045051132],"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.00024149152,0.000103026556,0.0003208836,0.0002679254,0.00008924823,0.000054598302,0.0001044176,0.14216451,0.01964647,0.0074930876,0.009985773,0.81952864],"study_design_scores_gemma":[0.000010509267,0.000057333767,0.00024011567,0.000016877475,0.000008395003,0.00007122127,0.0000123035325,0.98791236,0.0044565634,0.004508834,0.0026913653,0.000014135778],"about_ca_topic_score_codex":0.0028229083,"about_ca_topic_score_gemma":0.0037434476,"teacher_disagreement_score":0.006952632,"about_ca_system_score_codex":0.00040076423,"about_ca_system_score_gemma":0.00091785204,"threshold_uncertainty_score":0.023258924},"labels":[],"label_agreement":null},{"id":"W4404673562","doi":"10.1007/978-3-031-73024-5_4","title":"Modality Translation for Object Detection Adaptation Without Forgetting Prior Knowledge","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Forgetting; Modality (human–computer interaction); Adaptation (eye); Translation (biology); Artificial intelligence; Object (grammar); Computer vision; Natural language processing; Cognitive psychology; Neuroscience; Psychology","score_opus":0.03939968520406524,"score_gpt":0.289039440942685,"score_spread":0.2496397557386198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404673562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046317205,0.0006351242,0.9887311,0.0000796042,0.00019618082,0.000045561304,0.00017269282,0.002920177,0.002587891],"genre_scores_gemma":[0.2193916,0.0017430285,0.75077814,0.00074677943,0.0003811678,0.00030179726,0.0019812866,0.0012859986,0.023390163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999508,0.000089512796,0.00002115981,0.00022084553,0.00010829552,0.0000520612],"domain_scores_gemma":[0.9994516,0.00019803617,0.000017399989,0.0001935044,0.000110171604,0.000029252878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081650267,0.0010316082,0.0010789894,0.0006896309,0.00036745274,0.0007536505,0.0015528869,0.0013623436,0.009123525],"category_scores_gemma":[0.0017420723,0.0004130073,0.0013105477,0.00084281457,0.0005593062,0.0016837087,0.0018137288,0.0019609334,0.005821993],"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.00028146582,0.00017666657,0.00026713277,0.00023657602,0.00013491746,0.00016934081,0.000092523274,0.017652791,0.075285956,0.00639309,0.011047838,0.88826174],"study_design_scores_gemma":[0.000038183305,0.00023324153,0.0015495411,0.0000576105,0.00018554664,0.0008773965,0.00007445923,0.82830036,0.09992912,0.04741041,0.021267312,0.00007673327],"about_ca_topic_score_codex":0.001411709,"about_ca_topic_score_gemma":0.0018788403,"teacher_disagreement_score":0.009123525,"about_ca_system_score_codex":0.00031643055,"about_ca_system_score_gemma":0.0004291334,"threshold_uncertainty_score":0.030521274},"labels":[],"label_agreement":null},{"id":"W4404690192","doi":"10.1007/978-3-031-73030-6_25","title":"Photorealistic Object Insertion with Diffusion-Guided Inverse Rendering","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Rendering (computer graphics); Computer graphics (images); Computer vision; Inverse; Artificial intelligence; Geometry; Mathematics","score_opus":0.024089174426957988,"score_gpt":0.27255958743458,"score_spread":0.248470413007622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404690192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021163143,0.00035945204,0.95302206,0.0001620987,0.00017604612,0.00006176635,0.000071694456,0.0031196827,0.021864021],"genre_scores_gemma":[0.2781918,0.00045253546,0.6923133,0.00013375314,0.000061327126,0.00005120917,0.00017998177,0.0014927512,0.027123347],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996296,0.000030720985,0.000011651179,0.00006374254,0.00022581866,0.000038413436],"domain_scores_gemma":[0.9997292,0.00009004029,0.000022980896,0.000101317404,0.000039210034,0.000017247208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027171825,0.0009969762,0.0007527816,0.00047027427,0.00030874606,0.0015292539,0.0011810615,0.0010466743,0.007525143],"category_scores_gemma":[0.00075163215,0.0006364617,0.00085956097,0.00052562467,0.0007027368,0.0013654473,0.0015673215,0.0018710839,0.002184172],"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.00034679135,0.0001207932,0.00019328158,0.00033602855,0.00004045174,0.00042166398,0.0004510844,0.030705366,0.7016283,0.06573784,0.004943334,0.19507499],"study_design_scores_gemma":[0.00011119489,0.00023365782,0.00047100734,0.000062617015,0.000046929206,0.002456517,0.00012991138,0.46767303,0.45775512,0.025588065,0.045343738,0.00012817286],"about_ca_topic_score_codex":0.00082998775,"about_ca_topic_score_gemma":0.001163142,"teacher_disagreement_score":0.007525143,"about_ca_system_score_codex":0.000524101,"about_ca_system_score_gemma":0.00036696997,"threshold_uncertainty_score":0.02517414},"labels":[],"label_agreement":null},{"id":"W4404690790","doi":"10.1007/978-3-031-73030-6_14","title":"SceneScript: Reconstructing Scenes with an Autoregressive Structured Language Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Autoregressive model; Computer science; STAR model; Artificial intelligence; Natural language processing; Computer graphics (images); Autoregressive integrated moving average; Machine learning; Econometrics; Time series; Mathematics","score_opus":0.012495416775772861,"score_gpt":0.2258881926025903,"score_spread":0.21339277582681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404690790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033413398,0.00013567349,0.9869413,0.000068685455,0.000087742694,0.00004201365,0.0007315466,0.007726381,0.00092539366],"genre_scores_gemma":[0.05737037,0.0004007373,0.9287256,0.00015010517,0.000063701984,0.00014035858,0.0047773374,0.0030287053,0.005342986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999726,0.000043576307,0.000011212944,0.00006269975,0.00012672148,0.000029803703],"domain_scores_gemma":[0.99964213,0.00018197828,0.000026856418,0.000058403206,0.000068281304,0.000022413713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004863585,0.0013601001,0.00086987,0.00091615965,0.0002739595,0.0011678326,0.0015625145,0.0011597362,0.010061721],"category_scores_gemma":[0.0014562551,0.0012340255,0.001554057,0.0010487465,0.00043123052,0.0011592944,0.0009240228,0.0016528575,0.0052061984],"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.0004550587,0.00017266316,0.0007535506,0.0003499153,0.00029247528,0.00046930823,0.00016690286,0.34310246,0.035782278,0.015768506,0.041236445,0.5614504],"study_design_scores_gemma":[0.000024025241,0.000022316151,0.000121241916,0.000011983609,0.00002112051,0.00006973541,0.000025650117,0.9841815,0.005091672,0.0055866013,0.004826363,0.000017757422],"about_ca_topic_score_codex":0.0064565516,"about_ca_topic_score_gemma":0.013770236,"teacher_disagreement_score":0.010061721,"about_ca_system_score_codex":0.00034278558,"about_ca_system_score_gemma":0.0010234446,"threshold_uncertainty_score":0.033659756},"labels":[],"label_agreement":null},{"id":"W4404693164","doi":"10.1007/978-3-031-73024-5_17","title":"Exploring Active Learning in Meta-learning: Enhancing Context Set Labeling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Active learning (machine learning); Context (archaeology); Set (abstract data type); Artificial intelligence; Machine learning; Programming language","score_opus":0.0663894235555258,"score_gpt":0.2792490876966843,"score_spread":0.21285966414115848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404693164","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.009633622,0.001037396,0.9863542,0.00021431572,0.000084486404,0.000031231488,0.00008386891,0.0008058659,0.0017550566],"genre_scores_gemma":[0.29385954,0.0009138171,0.69983995,0.00026482527,0.00018634545,0.000107457716,0.0005522075,0.00047965668,0.0037962317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881953,0.00046938422,0.0000600274,0.00036177342,0.00022533999,0.000063936015],"domain_scores_gemma":[0.9959752,0.0026180244,0.00015394807,0.00078838953,0.00031676903,0.00014758365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021528904,0.0009760811,0.001183424,0.001068147,0.000711666,0.002747647,0.0031377382,0.0018865758,0.003697816],"category_scores_gemma":[0.0063995477,0.00073413097,0.0011264908,0.0016881895,0.00093040825,0.0059424774,0.0029578255,0.003034279,0.0010806709],"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.0004147574,0.00045088562,0.001728025,0.00045779868,0.00017475165,0.00012378271,0.0005478127,0.11068059,0.014663747,0.043428667,0.00737087,0.8199583],"study_design_scores_gemma":[0.000025175746,0.00010377397,0.00022220412,0.00006264686,0.00006818702,0.00009685167,0.00007614382,0.90773314,0.010039374,0.07583361,0.005718692,0.000020271922],"about_ca_topic_score_codex":0.0011046971,"about_ca_topic_score_gemma":0.00247482,"teacher_disagreement_score":0.003697816,"about_ca_system_score_codex":0.00062903995,"about_ca_system_score_gemma":0.00070864893,"threshold_uncertainty_score":0.012370408},"labels":[],"label_agreement":null},{"id":"W4404706376","doi":"10.1007/978-3-031-77382-2_21","title":"Unlocking the Power of Environment Assumptions for Unit Proofs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Unit (ring theory); Power (physics); Calculus (dental); Theoretical computer science; Mathematics; Mathematics education; Geometry","score_opus":0.030378301159395583,"score_gpt":0.25531304463464727,"score_spread":0.2249347434752517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404706376","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.017296314,0.0029872386,0.90807813,0.0032773996,0.0006507171,0.000065653316,0.00020778738,0.0038852144,0.06355159],"genre_scores_gemma":[0.661679,0.0034767583,0.30397627,0.0017390881,0.0013472611,0.00028191262,0.00041283647,0.0040988834,0.022988005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901592,0.0048986073,0.000574859,0.0013106359,0.0022583043,0.0007984229],"domain_scores_gemma":[0.91401035,0.057373036,0.0018889137,0.022670953,0.0028158287,0.0012409354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010060321,0.0010585241,0.0014365222,0.0016924845,0.0024305058,0.0059743747,0.0055728494,0.0024357522,0.015211083],"category_scores_gemma":[0.048932083,0.0024830385,0.0014602789,0.0018515721,0.012022248,0.04393992,0.013507149,0.011718893,0.004663504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017420169,0.000024445797,0.0002108265,0.00016927983,0.000019218602,0.000058748774,0.00056272617,0.002049772,0.0010196391,0.94625986,0.0033402594,0.04611098],"study_design_scores_gemma":[0.00002928398,0.000026175345,0.000049408638,0.00008188276,0.000025626803,0.000048143782,0.00006152243,0.007428127,0.0024430912,0.9753745,0.014410411,0.000021833768],"about_ca_topic_score_codex":0.0008418013,"about_ca_topic_score_gemma":0.0010638493,"teacher_disagreement_score":0.015211083,"about_ca_system_score_codex":0.001934876,"about_ca_system_score_gemma":0.0021955182,"threshold_uncertainty_score":0.053204715},"labels":[],"label_agreement":null},{"id":"W4404707788","doi":"10.1007/978-3-031-73030-6_24","title":"Unsupervised, Online and On-The-Fly Anomaly Detection for Non-stationary Image Distributions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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 Victoria","funders":"","keywords":"Computer science; Anomaly detection; On the fly; Artificial intelligence; Image (mathematics); Pattern recognition (psychology); Computer vision; Operating system","score_opus":0.014335652502067125,"score_gpt":0.2571626024609905,"score_spread":0.24282694995892337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404707788","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.0101722535,0.00013430328,0.98590106,0.00006998302,0.000052237807,0.000032015694,0.00010194557,0.0031019982,0.00043428733],"genre_scores_gemma":[0.2231944,0.00023930405,0.7697808,0.00009134278,0.00014128732,0.00009224638,0.0008684555,0.0006546197,0.0049375105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990663,0.00011697209,0.00004743249,0.0003127784,0.00033796066,0.00011859407],"domain_scores_gemma":[0.998357,0.0006872769,0.0001385534,0.00037944395,0.00034161014,0.000096185984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070121983,0.0011175415,0.001500244,0.0011012276,0.00040202355,0.0012359557,0.002330568,0.0011887347,0.0025431653],"category_scores_gemma":[0.002858371,0.00060902047,0.0009074684,0.0012380724,0.0006260548,0.0018579005,0.0018297622,0.0016160043,0.0021225126],"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.00027000965,0.00022440589,0.0016736885,0.0000945887,0.000095046875,0.00012295524,0.00006100225,0.04235386,0.043476082,0.0031939386,0.0058488045,0.9025856],"study_design_scores_gemma":[0.0000087476865,0.00003923785,0.0007970475,0.0000033785986,0.000011098438,0.00013517469,0.000016077845,0.9833898,0.0100635,0.0045109116,0.0010150607,0.000009997672],"about_ca_topic_score_codex":0.0028843337,"about_ca_topic_score_gemma":0.0064868894,"teacher_disagreement_score":0.0028843337,"about_ca_system_score_codex":0.0005321664,"about_ca_system_score_gemma":0.0010030407,"threshold_uncertainty_score":0.008507669},"labels":[],"label_agreement":null},{"id":"W4404722489","doi":"10.1007/978-3-031-73195-2_3","title":"GLARE: Low Light Image Enhancement via Generative Latent Feature Based Codebook Retrieval","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Codebook; Computer science; Artificial intelligence; Feature (linguistics); GLARE; Computer vision; Pattern recognition (psychology); Materials science","score_opus":0.008879571686920685,"score_gpt":0.23993863958591338,"score_spread":0.2310590678989927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404722489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007226661,0.0006362225,0.9830088,0.00010609029,0.00010286742,0.000086479675,0.00026013536,0.0048007537,0.0037719568],"genre_scores_gemma":[0.14173324,0.00088441937,0.81523067,0.00036461503,0.000114701346,0.00013829199,0.0021678966,0.0011589221,0.03820721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974483,0.000026943608,0.000007938914,0.000043553817,0.00014867652,0.000027949374],"domain_scores_gemma":[0.99979967,0.00004615138,0.000012962925,0.000072884446,0.000052070085,0.000016213582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002652614,0.00054948573,0.0006904313,0.0005813354,0.00024006057,0.00074595964,0.0011145959,0.00055212755,0.011113588],"category_scores_gemma":[0.0005543676,0.00027805535,0.0005609537,0.0007421202,0.00039684784,0.0008687724,0.0012360087,0.0008163728,0.0052349763],"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.00037021053,0.00015869709,0.00022612997,0.0001758759,0.00005014939,0.00014086519,0.00006229977,0.018958874,0.14050375,0.009154597,0.02459887,0.8055997],"study_design_scores_gemma":[0.00015560021,0.0003086345,0.0011611318,0.000038939805,0.00006176871,0.0008565361,0.000056475765,0.79925066,0.14335573,0.014270511,0.04040533,0.000078621415],"about_ca_topic_score_codex":0.002093696,"about_ca_topic_score_gemma":0.0039839954,"teacher_disagreement_score":0.011113588,"about_ca_system_score_codex":0.00035881292,"about_ca_system_score_gemma":0.0003812868,"threshold_uncertainty_score":0.037178636},"labels":[],"label_agreement":null},{"id":"W4404724706","doi":"10.1007/978-981-96-0573-6_17","title":"“Is this Site Legit?”: LLMs for Scam Website Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"Université de Montréal","funders":"","keywords":"Computer science; World Wide Web","score_opus":0.01671108114218429,"score_gpt":0.24377911579038672,"score_spread":0.22706803464820244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404724706","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.023047699,0.031852026,0.358031,0.049517598,0.00795984,0.00030376908,0.001996917,0.05806637,0.4692248],"genre_scores_gemma":[0.21587928,0.009136055,0.15274362,0.009169251,0.0047962707,0.00017185032,0.0028762422,0.004522005,0.60070544],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944097,0.0001296252,0.00001560247,0.000085938234,0.00027922034,0.000048616406],"domain_scores_gemma":[0.99897265,0.00037276934,0.0000604596,0.00017340403,0.00030430307,0.00011638787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007684668,0.00075804966,0.0003829609,0.0014879267,0.000735902,0.002492602,0.0009354932,0.0017611344,0.02796832],"category_scores_gemma":[0.0030055072,0.00040210728,0.00028335338,0.0009230407,0.000693544,0.0043543847,0.0011182517,0.0016779669,0.022666955],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053731605,0.000047054888,0.0009305964,0.000086825865,0.0000066764887,0.000065348555,0.00020452903,0.00063987507,0.0017522163,0.009505027,0.48693946,0.4997688],"study_design_scores_gemma":[0.000016975118,0.000113546404,0.0030767971,0.00037273066,0.000027178494,0.0008064577,0.00039101607,0.038292985,0.007693714,0.035114847,0.9140312,0.00006248279],"about_ca_topic_score_codex":0.0029500213,"about_ca_topic_score_gemma":0.005830843,"teacher_disagreement_score":0.02796832,"about_ca_system_score_codex":0.0010534031,"about_ca_system_score_gemma":0.00064193655,"threshold_uncertainty_score":0.09356332},"labels":[],"label_agreement":null},{"id":"W4404724994","doi":"10.1007/978-981-96-0576-7","title":"Web Information Systems Engineering – WISE 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Université de Pau et des Pays de l'Adour; Singapore Management University; University of Science and Technology of China; Yunnan University; University of the Aegean; Sorbonne Université; Università degli Studi di Salerno; Sohar University; Australian Catholic University; Waseda University; Universidad Nacional de La Plata; University of New South Wales; Jinan University; University of Crete; Griffith University; Technische Universiteit Eindhoven; Università degli Studi di Padova; University of Thessaly; Erasmus Universiteit Rotterdam; Università degli Studi di Brescia; Indian Institute of Technology Roorkee; Aix-Marseille Université; Lebanese American University; Swinburne University of Technology; Delhi Technological University; Universitat de València; Université de Fribourg; Macquarie University; Université de Bordeaux; Universidad de Alicante; Cardiff University; Deakin University; University of Macedonia; University of Technology Sydney; University of Cyprus; Charles Sturt University; Indian National Science Academy; University of Hertfordshire; University of Miami; Universidad de Málaga; Norges Teknisk-Naturvitenskapelige Universitet; Université de Sfax; Universidad Carlos III de Madrid; University of Bern; University of Southampton; Université du Luxembourg; University of Southern Queensland; Anglia Ruskin University; Universität Basel; University of Ottawa; Ocean University of China; Vanderbilt University; Universidade de Macau; Universidad de Sevilla; La Trobe University; Commonwealth Scientific and Industrial Research Organisation; Harbin Institute of Technology; Universität Duisburg-Essen; San Diego State University; University of Waikato","keywords":"Computer science; Web application; Information engineering; World Wide Web; Software engineering; Information retrieval; Information system; Electrical engineering","score_opus":0.005874555535227587,"score_gpt":0.21008637461595342,"score_spread":0.20421181908072583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404724994","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020176708,0.020674258,0.06695581,0.0050513525,0.0086367,0.00016807936,0.0013569611,0.003923274,0.891216],"genre_scores_gemma":[0.003469797,0.009194626,0.013433204,0.0007664615,0.0013807376,0.000047659596,0.001516278,0.0015253441,0.9686659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994388,0.000056447876,0.000019771765,0.000060052243,0.0003869035,0.00003805983],"domain_scores_gemma":[0.99925965,0.00014136989,0.000035403333,0.00013521554,0.00031423505,0.00011413773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115768,0.001275152,0.0006394952,0.0023125657,0.00041526018,0.002824314,0.00071005843,0.0011334195,0.080311425],"category_scores_gemma":[0.0012790475,0.0007591882,0.00048755706,0.0027731643,0.00037703197,0.0028118198,0.0011777377,0.0019476422,0.10211167],"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.000017032022,0.00003913476,0.00006950917,0.00014078488,0.000011613755,0.000028933513,0.000016570653,0.00088788057,0.0017865758,0.011551127,0.7034041,0.28204668],"study_design_scores_gemma":[0.000003627796,0.000026958245,0.00029617234,0.00011777629,0.000006498517,0.00013741358,0.000008919907,0.0018785917,0.0012014185,0.0070790127,0.9892369,0.0000066403027],"about_ca_topic_score_codex":0.0012379015,"about_ca_topic_score_gemma":0.0029252768,"teacher_disagreement_score":0.080311425,"about_ca_system_score_codex":0.0008013769,"about_ca_system_score_gemma":0.0010149325,"threshold_uncertainty_score":0.26866847},"labels":[],"label_agreement":null},{"id":"W4404725261","doi":"10.1007/978-981-96-0573-6","title":"Web Information Systems Engineering – WISE 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"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":"Université de Pau et des Pays de l'Adour; Singapore Management University; University of Science and Technology of China; Yunnan University; University of the Aegean; Sorbonne Université; Università degli Studi di Salerno; Sohar University; Australian Catholic University; Waseda University; Universidad Nacional de La Plata; University of New South Wales; Jinan University; University of Crete; Griffith University; Technische Universiteit Eindhoven; Università degli Studi di Padova; University of Thessaly; Erasmus Universiteit Rotterdam; Università degli Studi di Brescia; Indian Institute of Technology Roorkee; Aix-Marseille Université; Lebanese American University; Swinburne University of Technology; Delhi Technological University; Universitat de València; Université de Fribourg; Macquarie University; Université de Bordeaux; Universidad de Alicante; Cardiff University; Deakin University; University of Macedonia; University of Technology Sydney; University of Cyprus; Charles Sturt University; Indian National Science Academy; University of Hertfordshire; University of Miami; Universidad de Málaga; Norges Teknisk-Naturvitenskapelige Universitet; Université de Sfax; Universidad Carlos III de Madrid; University of Bern; University of Southampton; Université du Luxembourg; University of Southern Queensland; Anglia Ruskin University; Universität Basel; University of Ottawa; Ocean University of China; Vanderbilt University; Universidade de Macau; Universidad de Sevilla; La Trobe University; Commonwealth Scientific and Industrial Research Organisation; Harbin Institute of Technology; Universität Duisburg-Essen; San Diego State University; University of Waikato","keywords":"Computer science; Web application; Information engineering; World Wide Web; Software engineering; Information system; Engineering; Electrical engineering","score_opus":0.005874555535227587,"score_gpt":0.21008637461595342,"score_spread":0.20421181908072583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404725261","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020176708,0.020674258,0.06695581,0.0050513525,0.0086367,0.00016807936,0.0013569611,0.003923274,0.891216],"genre_scores_gemma":[0.003469797,0.009194626,0.013433204,0.0007664615,0.0013807376,0.000047659596,0.001516278,0.0015253441,0.9686659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994388,0.000056447876,0.000019771765,0.000060052243,0.0003869035,0.00003805983],"domain_scores_gemma":[0.99925965,0.00014136989,0.000035403333,0.00013521554,0.00031423505,0.00011413773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115768,0.001275152,0.0006394952,0.0023125657,0.00041526018,0.002824314,0.00071005843,0.0011334195,0.080311425],"category_scores_gemma":[0.0012790475,0.0007591882,0.00048755706,0.0027731643,0.00037703197,0.0028118198,0.0011777377,0.0019476422,0.10211167],"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.000017032022,0.00003913476,0.00006950917,0.00014078488,0.000011613755,0.000028933513,0.000016570653,0.00088788057,0.0017865758,0.011551127,0.7034041,0.28204668],"study_design_scores_gemma":[0.000003627796,0.000026958245,0.00029617234,0.00011777629,0.000006498517,0.00013741358,0.000008919907,0.0018785917,0.0012014185,0.0070790127,0.9892369,0.0000066403027],"about_ca_topic_score_codex":0.0012379015,"about_ca_topic_score_gemma":0.0029252768,"teacher_disagreement_score":0.080311425,"about_ca_system_score_codex":0.0008013769,"about_ca_system_score_gemma":0.0010149325,"threshold_uncertainty_score":0.26866847},"labels":[],"label_agreement":null},{"id":"W4404770149","doi":"10.1007/978-3-031-73254-6_4","title":"RoGUENeRF: A Robust Geometry-Consistent Universal Enhancer for NeRF","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Enhancer; Geometry; Algorithm; Mathematics","score_opus":0.02938949692083152,"score_gpt":0.29240152704468203,"score_spread":0.2630120301238505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404770149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009170242,0.00013265463,0.99525684,0.0000494509,0.00004148309,0.000020677386,0.00007117664,0.0012463926,0.002264265],"genre_scores_gemma":[0.036917854,0.00034119457,0.9427436,0.00034212304,0.0000732806,0.00011451144,0.0005709043,0.001871533,0.017025022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992397,0.00013776886,0.000022706156,0.00013927018,0.00039300628,0.000067581954],"domain_scores_gemma":[0.99937975,0.000247044,0.00004723806,0.00015849281,0.000125787,0.000041565647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012242775,0.0011557032,0.0012831063,0.0007859928,0.0004445922,0.00104663,0.002042961,0.0017772805,0.010752646],"category_scores_gemma":[0.0027699973,0.00051073526,0.001001532,0.00050932856,0.0012327138,0.0015604463,0.0023710085,0.0022956652,0.00505923],"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.0003813956,0.00014201112,0.00029025576,0.000463815,0.00013387152,0.00029322217,0.00021737204,0.086395316,0.122932866,0.14927046,0.02724722,0.61223215],"study_design_scores_gemma":[0.00008411158,0.00019680365,0.00035026678,0.000119929886,0.000063665735,0.0011126742,0.0000787764,0.7043998,0.112494,0.07444442,0.10653068,0.00012493019],"about_ca_topic_score_codex":0.0011574037,"about_ca_topic_score_gemma":0.002627736,"teacher_disagreement_score":0.010752646,"about_ca_system_score_codex":0.00048710828,"about_ca_system_score_gemma":0.0007728493,"threshold_uncertainty_score":0.035971165},"labels":[],"label_agreement":null},{"id":"W4404778166","doi":"10.1007/978-3-031-78017-2_9","title":"Low-Degree Security of the Planted Random Subgraph Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Degree (music); Computer science; Theoretical computer science; Physics","score_opus":0.012135042290964519,"score_gpt":0.22152508906843252,"score_spread":0.209390046777468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404778166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3850406,0.0030797524,0.47485623,0.0172334,0.0005371835,0.00019378147,0.0023619172,0.0015428596,0.11515419],"genre_scores_gemma":[0.95763415,0.0013466947,0.026788468,0.0008678156,0.00042417517,0.00017135708,0.0007828021,0.00023249155,0.011751947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971643,0.001077863,0.00008256239,0.0005890395,0.00063491875,0.00045123472],"domain_scores_gemma":[0.98701406,0.009162216,0.0006871611,0.002283886,0.0004212755,0.00043148053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019796113,0.0009670044,0.0014326492,0.0009864321,0.0014200724,0.003623773,0.0026807792,0.0022077006,0.0058399774],"category_scores_gemma":[0.009813407,0.0006741834,0.0010618793,0.0014268081,0.0034730595,0.007911617,0.0035742112,0.0043994593,0.0015761384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075859844,0.0001117103,0.00059402245,0.0002664153,0.00007784719,0.0001520669,0.00028831977,0.07259442,0.0069723795,0.8760505,0.0105717955,0.031561974],"study_design_scores_gemma":[0.00006197899,0.000026905826,0.00015220295,0.000026908006,0.00001809206,0.00010262585,0.000033863074,0.059676316,0.0019402906,0.93562657,0.002317098,0.000017166012],"about_ca_topic_score_codex":0.0007498565,"about_ca_topic_score_gemma":0.0007671344,"teacher_disagreement_score":0.0058399774,"about_ca_system_score_codex":0.002556609,"about_ca_system_score_gemma":0.0012171153,"threshold_uncertainty_score":0.019536674},"labels":[],"label_agreement":null},{"id":"W4404792627","doi":"10.1007/978-3-031-72848-8_10","title":"JDT3D: Addressing the Gaps in LiDAR-Based Tracking-by-Attention","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lidar; Tracking (education); Artificial intelligence; Computer vision; Remote sensing; Geography","score_opus":0.033986658081650606,"score_gpt":0.2916625514560327,"score_spread":0.2576758933743821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404792627","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.00950783,0.006466409,0.9436788,0.0010085045,0.001420905,0.00009507471,0.0012634423,0.026930118,0.009628988],"genre_scores_gemma":[0.22707781,0.0045291223,0.73463374,0.0023093289,0.0008806524,0.00024662729,0.0061121467,0.0053162863,0.018894276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894685,0.00013421992,0.00003899044,0.0003689243,0.00038783043,0.0001232676],"domain_scores_gemma":[0.99901426,0.0004628615,0.00003349279,0.000251281,0.00017651658,0.00006161424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015599583,0.0016544209,0.0020941442,0.00095371524,0.000661758,0.0026490844,0.005179644,0.0027797127,0.012007961],"category_scores_gemma":[0.004218209,0.00086357695,0.0012091697,0.0015407439,0.00075323513,0.0034382935,0.0040479293,0.0028396607,0.0066868276],"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.00032706928,0.0001527568,0.0006554552,0.000494731,0.0002023008,0.00015124113,0.0002076082,0.045952097,0.011756513,0.012794422,0.06869982,0.858606],"study_design_scores_gemma":[0.00005902658,0.00010193715,0.0004502749,0.00007928394,0.000090177826,0.00024048133,0.00006395779,0.92144746,0.0127551425,0.027463678,0.037203245,0.000045405315],"about_ca_topic_score_codex":0.019678742,"about_ca_topic_score_gemma":0.026538413,"teacher_disagreement_score":0.019678742,"about_ca_system_score_codex":0.0009600853,"about_ca_system_score_gemma":0.0018296717,"threshold_uncertainty_score":0.04017061},"labels":[],"label_agreement":null},{"id":"W4404792697","doi":"10.1007/978-3-031-72848-8_4","title":"Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.019971569456082423,"score_gpt":0.23798182176176683,"score_spread":0.2180102523056844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404792697","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.013707066,0.0005732595,0.9749981,0.00016901908,0.00014662773,0.00009461402,0.00047078382,0.008000463,0.0018400967],"genre_scores_gemma":[0.1613763,0.0006201447,0.82078034,0.0006154727,0.00020489926,0.00029222772,0.0051243417,0.0014866584,0.009499649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978694,0.00041520904,0.000112110654,0.0006886653,0.0007617413,0.00015287832],"domain_scores_gemma":[0.99550205,0.0017787957,0.00027258456,0.0012599953,0.0010364379,0.00015006564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017754455,0.0028559582,0.0025680878,0.0017185139,0.0009695247,0.0022830323,0.0042635617,0.003330913,0.0045320163],"category_scores_gemma":[0.0044568344,0.0015196211,0.0024353017,0.0020203528,0.0012315765,0.0031538277,0.0040205643,0.002648574,0.00725255],"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.0003546376,0.0003116149,0.0015768504,0.0003949285,0.00018597611,0.00013413776,0.00013728053,0.11402353,0.032074854,0.001984605,0.0185669,0.8302548],"study_design_scores_gemma":[0.000015840016,0.00006444395,0.0004371753,0.00002617971,0.000034213164,0.00014188999,0.00003395932,0.981899,0.0105524575,0.004270925,0.0025053157,0.000018596016],"about_ca_topic_score_codex":0.0059975833,"about_ca_topic_score_gemma":0.014649564,"teacher_disagreement_score":0.0059975833,"about_ca_system_score_codex":0.0007271019,"about_ca_system_score_gemma":0.0015236717,"threshold_uncertainty_score":0.015161097},"labels":[],"label_agreement":null},{"id":"W4404817872","doi":"10.1007/978-981-96-0617-7_17","title":"Formalizing Potential Flows Using the HOL Light Theorem Prover","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Computer science; Gas meter prover; Programming language; Calculus (dental); Algorithm; Theoretical computer science; Mathematics; Mathematical proof","score_opus":0.019014583944511936,"score_gpt":0.2735598452041234,"score_spread":0.25454526125961147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404817872","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.0026478076,0.00034053114,0.96658003,0.00045174357,0.00018035715,0.000102699545,0.00041403866,0.004462767,0.024820013],"genre_scores_gemma":[0.15144569,0.001942466,0.80354977,0.00090373744,0.00030906487,0.0003966595,0.001751746,0.005407639,0.034293294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823403,0.00046677468,0.00013708201,0.00023194695,0.0007106002,0.0002195726],"domain_scores_gemma":[0.9973852,0.0018304952,0.00008483316,0.0003647987,0.0002775131,0.000057202236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024049617,0.0011399742,0.0008980668,0.0020454777,0.0014693561,0.00464022,0.002981122,0.00094383815,0.024136256],"category_scores_gemma":[0.0062295585,0.001387292,0.001833694,0.0015784026,0.0031212545,0.008492122,0.0044239424,0.004524429,0.00629634],"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.000062115665,0.00005323452,0.00013051758,0.00040923333,0.000023603621,0.00009959687,0.00029205641,0.005605965,0.002314551,0.90068877,0.010763498,0.07955676],"study_design_scores_gemma":[0.00004889686,0.000016499347,0.000052580188,0.00013619769,0.000031932977,0.00010807125,0.000085967884,0.023962347,0.009150702,0.9040481,0.06233003,0.00002868244],"about_ca_topic_score_codex":0.0016295322,"about_ca_topic_score_gemma":0.0019481722,"teacher_disagreement_score":0.024136256,"about_ca_system_score_codex":0.0012473809,"about_ca_system_score_gemma":0.0019084412,"threshold_uncertainty_score":0.08074379},"labels":[],"label_agreement":null},{"id":"W4404818075","doi":"10.1007/978-981-96-0617-7_10","title":"Formal Kinematic Analysis of Epicyclic Bevel Gear Trains","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Mechanisms and Dynamics","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":"Concordia University","funders":"","keywords":"Gear train; Kinematics; Computer science; Bevel gear; Train; Bevel; Simulation; Artificial intelligence; Mechanical engineering; Physics; Classical mechanics; Engineering; Cartography","score_opus":0.012172564243616804,"score_gpt":0.22312863645747427,"score_spread":0.21095607221385748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404818075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700299,0.0006692597,0.9012495,0.0003018682,0.00016767785,0.00004333708,0.00019799058,0.00015981829,0.05020755],"genre_scores_gemma":[0.8734642,0.0011217757,0.086243175,0.00015282418,0.00027618496,0.00008798355,0.00048410383,0.00020953034,0.03796021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995803,0.00009962321,0.000028233466,0.000080770944,0.00015832353,0.000052690048],"domain_scores_gemma":[0.9994574,0.00022828982,0.00008432679,0.00007071887,0.00013475203,0.000024431954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630165,0.0005811501,0.0004140208,0.0011146863,0.0005521049,0.0014600542,0.0011561232,0.0005314433,0.0073612663],"category_scores_gemma":[0.0018715825,0.0003639584,0.00085229415,0.0007954115,0.0019162428,0.0017942282,0.0013499183,0.0013087403,0.0007057139],"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.0000150144,0.000018060528,0.0001317786,0.00003875,0.0000066338657,0.00006716843,0.00013370161,0.017980108,0.0007944341,0.9706243,0.0004385046,0.009751556],"study_design_scores_gemma":[0.000009218751,0.000026722242,0.00029157446,0.0000362199,0.000010368727,0.00006454759,0.00010228064,0.0755008,0.0006452626,0.91481686,0.00848426,0.000011930509],"about_ca_topic_score_codex":0.0018092834,"about_ca_topic_score_gemma":0.0014786384,"teacher_disagreement_score":0.0073612663,"about_ca_system_score_codex":0.0008501346,"about_ca_system_score_gemma":0.00039995246,"threshold_uncertainty_score":0.024625897},"labels":[],"label_agreement":null},{"id":"W4404818094","doi":"10.1007/978-981-96-0579-8","title":"Web Information Systems Engineering – WISE 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Sorbonne Université; Université de Pau et des Pays de l'Adour; University of Science and Technology of China; University of the Aegean; Indian Institute of Technology Roorkee; Università degli Studi di Brescia; University of Bern; Universidad Carlos III de Madrid; Waseda University; Universidad Nacional de La Plata; University of New South Wales; Jinan University; University of Crete; Griffith University; Technische Universiteit Eindhoven; Università degli Studi di Padova; University of Thessaly; Erasmus Universiteit Rotterdam; Universitat de València; Université de Bordeaux; Universidad de Alicante; Cardiff University; Deakin University; University of Macedonia; University of Technology Sydney; University of Cyprus; Université de Fribourg; Macquarie University; Sohar University; Charles Sturt University; Indian National Science Academy; Aix-Marseille Université; Lebanese American University; University of Hertfordshire; University of Miami; Universidad de Málaga; Norges Teknisk-Naturvitenskapelige Universitet; University of Southampton; Université du Luxembourg; University of Southern Queensland; Anglia Ruskin University; Universität Basel; University of Ottawa; Ocean University of China; Vanderbilt University; Universidad de Sevilla; La Trobe University; Commonwealth Scientific and Industrial Research Organisation; Harbin Institute of Technology; San Diego State University; University of Waikato","keywords":"Computer science; Web application; World Wide Web; Information engineering; Information retrieval; Information system; Software engineering; Engineering; Electrical engineering","score_opus":0.005874555535227587,"score_gpt":0.21008637461595342,"score_spread":0.20421181908072583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404818094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020176708,0.020674258,0.06695581,0.0050513525,0.0086367,0.00016807936,0.0013569611,0.003923274,0.891216],"genre_scores_gemma":[0.003469797,0.009194626,0.013433204,0.0007664615,0.0013807376,0.000047659596,0.001516278,0.0015253441,0.9686659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994388,0.000056447876,0.000019771765,0.000060052243,0.0003869035,0.00003805983],"domain_scores_gemma":[0.99925965,0.00014136989,0.000035403333,0.00013521554,0.00031423505,0.00011413773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115768,0.001275152,0.0006394952,0.0023125657,0.00041526018,0.002824314,0.00071005843,0.0011334195,0.080311425],"category_scores_gemma":[0.0012790475,0.0007591882,0.00048755706,0.0027731643,0.00037703197,0.0028118198,0.0011777377,0.0019476422,0.10211167],"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.000017032022,0.00003913476,0.00006950917,0.00014078488,0.000011613755,0.000028933513,0.000016570653,0.00088788057,0.0017865758,0.011551127,0.7034041,0.28204668],"study_design_scores_gemma":[0.000003627796,0.000026958245,0.00029617234,0.00011777629,0.000006498517,0.00013741358,0.000008919907,0.0018785917,0.0012014185,0.0070790127,0.9892369,0.0000066403027],"about_ca_topic_score_codex":0.0012379015,"about_ca_topic_score_gemma":0.0029252768,"teacher_disagreement_score":0.080311425,"about_ca_system_score_codex":0.0008013769,"about_ca_system_score_gemma":0.0010149325,"threshold_uncertainty_score":0.26866847},"labels":[],"label_agreement":null},{"id":"W4404818373","doi":"10.1007/978-981-96-0579-8_20","title":"Enhancing RAG’s Retrieval via Query Backtranslations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Windsor","funders":"","keywords":"Computer science; Information retrieval; Query expansion; Query optimization; Database","score_opus":0.01386813357093654,"score_gpt":0.2496014352438606,"score_spread":0.23573330167292406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404818373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12622517,0.0069109797,0.752584,0.0022798253,0.0017230375,0.0006331746,0.0036321536,0.06159307,0.044418674],"genre_scores_gemma":[0.4675839,0.0023892985,0.46986407,0.0015331183,0.0012606276,0.00018841875,0.0093080485,0.0039493307,0.043923203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857247,0.0003741724,0.00010880464,0.00021054265,0.0005602805,0.00017372395],"domain_scores_gemma":[0.99745065,0.0008748815,0.00009328523,0.0009452758,0.000576487,0.000059402333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010415799,0.0012604989,0.0013434445,0.0024315685,0.00071864587,0.0024321896,0.0013709592,0.001288677,0.020847771],"category_scores_gemma":[0.004780991,0.0003709778,0.0009361454,0.002415866,0.0009392939,0.0035272161,0.0019078727,0.0009490539,0.015383092],"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.0012404581,0.0004142512,0.00072977593,0.00077251764,0.00012272468,0.0006851539,0.0004915771,0.010718806,0.153775,0.017774329,0.07828082,0.7349946],"study_design_scores_gemma":[0.00028343376,0.00082085293,0.0017265714,0.00010948167,0.0003941994,0.0030695978,0.0007907768,0.46129504,0.31959403,0.03563466,0.17608102,0.00020043243],"about_ca_topic_score_codex":0.0026736902,"about_ca_topic_score_gemma":0.002777543,"teacher_disagreement_score":0.020847771,"about_ca_system_score_codex":0.00061122724,"about_ca_system_score_gemma":0.0007413663,"threshold_uncertainty_score":0.06974274},"labels":[],"label_agreement":null},{"id":"W4404818404","doi":"10.1007/978-981-96-0579-8_16","title":"RePair My Queries: Personalized Query Reformulation via Conditional Transformers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision 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 Windsor","funders":"","keywords":"Computer science; Query optimization; Information retrieval; Transformer; Sargable; Web search query; Database; Search engine","score_opus":0.06617546119587851,"score_gpt":0.35038473437706585,"score_spread":0.2842092731811873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404818404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009946094,0.00023108706,0.9729868,0.00070939184,0.00009834725,0.0001229119,0.00058565004,0.012625581,0.0026940724],"genre_scores_gemma":[0.33220384,0.0003830172,0.6524263,0.00079354085,0.000255775,0.00020973745,0.0029662396,0.003688244,0.007073238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941554,0.0018647026,0.0004648959,0.0010055513,0.001985043,0.00052434264],"domain_scores_gemma":[0.9862918,0.007905413,0.0003569202,0.00417444,0.0010907736,0.0001805962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004915124,0.0012354885,0.0015465631,0.0015502586,0.00081362703,0.003202331,0.0036973152,0.0014443019,0.014833774],"category_scores_gemma":[0.023711791,0.0010519786,0.0021167698,0.0019392938,0.0019172938,0.009091819,0.005090017,0.0036103996,0.0035013983],"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.0014479865,0.00042741536,0.0013832827,0.0006308028,0.00017924338,0.0004731639,0.001211652,0.06263567,0.019364553,0.1965523,0.063478485,0.6522154],"study_design_scores_gemma":[0.00018894635,0.00010975338,0.00028709887,0.00006264226,0.00017725406,0.0003417644,0.000283692,0.6529302,0.026794357,0.29890805,0.019836167,0.000080088816],"about_ca_topic_score_codex":0.0030396986,"about_ca_topic_score_gemma":0.0036655278,"teacher_disagreement_score":0.014833774,"about_ca_system_score_codex":0.0012448089,"about_ca_system_score_gemma":0.0018078458,"threshold_uncertainty_score":0.049623907},"labels":[],"label_agreement":null},{"id":"W4404820184","doi":"10.1007/978-3-031-72848-8_19","title":"VQA-Diff: Exploiting VQA and Diffusion for Zero-Shot Image-to-3D Vehicle Asset Generation in Autonomous Driving","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Toronto; York University","funders":"","keywords":"Computer science; Shot (pellet); Zero (linguistics); Asset (computer security); Image (mathematics); Computer vision; Diffusion; Artificial intelligence; Computer security; Physics","score_opus":0.027226868663055057,"score_gpt":0.29198741081212204,"score_spread":0.26476054214906697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404820184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005572465,0.00020236509,0.98897654,0.000059270344,0.00007918325,0.000041010677,0.00013801733,0.0036817205,0.001249402],"genre_scores_gemma":[0.22674237,0.0003236327,0.7649225,0.00015240366,0.00007890478,0.00007008887,0.0009059571,0.0011945753,0.0056096045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998048,0.000023156572,0.000008602804,0.00004725536,0.0000917796,0.000024445484],"domain_scores_gemma":[0.9997135,0.00009486766,0.000016167623,0.000065157445,0.00008847901,0.000021808306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044039506,0.00071677146,0.0006334507,0.0007494329,0.00030572322,0.0008846396,0.0015316673,0.00090943545,0.0043058842],"category_scores_gemma":[0.0010883668,0.00045743186,0.0006864043,0.0005455446,0.00038522226,0.0009084594,0.0013836042,0.00086172303,0.0013424258],"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.00019908602,0.00011233942,0.00074192474,0.00014532421,0.000082095896,0.00014256137,0.00012898463,0.15994135,0.040355295,0.01259296,0.013380135,0.77217793],"study_design_scores_gemma":[0.000009218015,0.000028016751,0.00017736353,0.000007715305,0.000005906071,0.00007319477,0.000014069555,0.9795853,0.009398647,0.0074139764,0.0032758433,0.000010716095],"about_ca_topic_score_codex":0.0048950124,"about_ca_topic_score_gemma":0.0067963987,"teacher_disagreement_score":0.0048950124,"about_ca_system_score_codex":0.0003985279,"about_ca_system_score_gemma":0.0005830542,"threshold_uncertainty_score":0.014404595},"labels":[],"label_agreement":null},{"id":"W4404820294","doi":"10.1007/978-3-031-72848-8_26","title":"CIC-BART-SSA: Controllable Image Captioning with Structured Semantic Augmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Centre for Social Innovation","funders":"","keywords":"Closed captioning; Computer science; Image (mathematics); Natural language processing; Artificial intelligence; Information retrieval","score_opus":0.008056717923322488,"score_gpt":0.2529892578538221,"score_spread":0.2449325399304996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404820294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004112376,0.0005060121,0.93304724,0.00010597207,0.00043708875,0.00023172003,0.0017227231,0.047902305,0.011934589],"genre_scores_gemma":[0.07848524,0.00045199203,0.8942213,0.00030093268,0.00023872517,0.000441712,0.0077365227,0.0057578273,0.012365692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935,0.000101145866,0.000034773373,0.00019733231,0.00025415752,0.000062595704],"domain_scores_gemma":[0.9992223,0.0002241848,0.000032312226,0.00030615233,0.00016242023,0.000052642095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005721565,0.002134628,0.0012365845,0.0010272416,0.0005049194,0.001672399,0.0022659579,0.0014071628,0.02914339],"category_scores_gemma":[0.0017063876,0.0007826903,0.00145964,0.0012299041,0.00079169864,0.0020994751,0.002875094,0.0019390205,0.015900802],"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.0007418647,0.00023295727,0.00015758062,0.00079417555,0.00010471147,0.00041791343,0.00016353898,0.018332992,0.13841946,0.021223992,0.10805663,0.71135426],"study_design_scores_gemma":[0.00014737608,0.00029612475,0.0004843298,0.00010638127,0.00008722439,0.0007441643,0.000087845314,0.6878115,0.16178185,0.048069526,0.10025893,0.0001246504],"about_ca_topic_score_codex":0.0018961473,"about_ca_topic_score_gemma":0.0028085609,"teacher_disagreement_score":0.02914339,"about_ca_system_score_codex":0.00038925785,"about_ca_system_score_gemma":0.0006882397,"threshold_uncertainty_score":0.097494364},"labels":[],"label_agreement":null},{"id":"W4404821142","doi":"10.1007/978-3-031-72848-8_14","title":"SPARO: Selective Attention for Robust and Compositional Transformer Encodings for Vision","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Canadian Institute for International Peace and Security; Université de Montréal","funders":"","keywords":"Computer science; Selective attention; Computer vision; Artificial intelligence; Transformer; Neuroscience; Electrical engineering; Cognition; Psychology; Voltage","score_opus":0.01851481912246042,"score_gpt":0.2735095589935203,"score_spread":0.2549947398710599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404821142","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.012144605,0.0006761131,0.95824826,0.00017691767,0.0002840712,0.00008575013,0.0007931952,0.017551059,0.01003996],"genre_scores_gemma":[0.29789624,0.0009776137,0.66893727,0.00057033927,0.00027311966,0.00023834249,0.004056696,0.004246678,0.022803642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997378,0.000033221728,0.0000138885025,0.000090633446,0.00007313441,0.00005119784],"domain_scores_gemma":[0.999765,0.00007588529,0.000012255222,0.0000867853,0.000037305323,0.000022793089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004665638,0.0012240129,0.0009137279,0.0006235122,0.0003440572,0.0013715697,0.002035246,0.0010637966,0.017539466],"category_scores_gemma":[0.0011139474,0.00050521287,0.0008878798,0.0007070535,0.00059072505,0.0027365778,0.0019837588,0.001429932,0.0051076487],"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.0005102004,0.000117252006,0.00017943757,0.00032523848,0.000073091374,0.0001435769,0.000091001944,0.01564559,0.0747144,0.059865855,0.0463232,0.80201113],"study_design_scores_gemma":[0.00009830359,0.00018898219,0.0003773638,0.000058109683,0.00008197656,0.0003044039,0.00006556142,0.66786206,0.09506991,0.20213075,0.03371432,0.000048261445],"about_ca_topic_score_codex":0.0023284114,"about_ca_topic_score_gemma":0.004617819,"teacher_disagreement_score":0.017539466,"about_ca_system_score_codex":0.0006174036,"about_ca_system_score_gemma":0.00065113633,"threshold_uncertainty_score":0.05867535},"labels":[],"label_agreement":null},{"id":"W4404822922","doi":"10.1007/978-3-031-77915-2_9","title":"TRAPL: Transformer-Based Patch Learning for Enhancing Semantic Representations Using Aggregated Features to Estimate Patch-Class Distribution","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Transformer; Class (philosophy); Artificial intelligence; Natural language processing; Electrical engineering; Engineering; Voltage","score_opus":0.02167470190889631,"score_gpt":0.3072406585293771,"score_spread":0.2855659566204808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404822922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005871331,0.0003927403,0.98268837,0.00008308402,0.00011243895,0.000069593036,0.0005719926,0.009361499,0.00084894785],"genre_scores_gemma":[0.12972258,0.0008055507,0.8516264,0.000449009,0.00019275556,0.0002506334,0.005552824,0.0020591833,0.009341131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943596,0.00008180949,0.000020021605,0.00022264736,0.00017870235,0.00006086457],"domain_scores_gemma":[0.99941874,0.00016606292,0.00003462512,0.00018840504,0.00014150976,0.00005060915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945197,0.0013572449,0.001794704,0.0012619596,0.00036831424,0.0011652141,0.0025112699,0.0014370873,0.0079756975],"category_scores_gemma":[0.0019448394,0.0005632618,0.0012263795,0.0015885956,0.0006531379,0.0025679793,0.0025425437,0.0022928198,0.004775646],"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.0003400991,0.00019197685,0.00037094785,0.00020622663,0.00012493198,0.000109825385,0.00006347501,0.024210585,0.03667871,0.0043611117,0.028910091,0.90443194],"study_design_scores_gemma":[0.000041150433,0.00014208881,0.0005467988,0.000018348917,0.000058385023,0.00017606639,0.00003165632,0.9564882,0.022779595,0.012208324,0.007480168,0.000029240813],"about_ca_topic_score_codex":0.0048130085,"about_ca_topic_score_gemma":0.006423992,"teacher_disagreement_score":0.0079756975,"about_ca_system_score_codex":0.00063059194,"about_ca_system_score_gemma":0.0006635572,"threshold_uncertainty_score":0.026681364},"labels":[],"label_agreement":null},{"id":"W4404824419","doi":"10.1007/978-3-031-77918-3_10","title":"Digit Detection: Localizing and Convoluting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","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 Lethbridge","funders":"","keywords":"Computer science; Numerical digit; Arithmetic; Mathematics","score_opus":0.015343448701535874,"score_gpt":0.21817310466759737,"score_spread":0.2028296559660615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404824419","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.010768084,0.0010873139,0.97711766,0.00014142923,0.00014226117,0.0000534556,0.00017979278,0.00465122,0.0058587254],"genre_scores_gemma":[0.061264604,0.0017751389,0.9132019,0.00022663064,0.00015959711,0.0000668775,0.0006444185,0.0012064585,0.021454247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933845,0.00007001273,0.000032649987,0.00017870161,0.00030195565,0.00007823858],"domain_scores_gemma":[0.99915004,0.00028815898,0.000046406898,0.00021949677,0.00024626704,0.00004955442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007532666,0.0012385744,0.0013165909,0.0018106591,0.00043952191,0.0022779265,0.0017692593,0.0013596113,0.01567357],"category_scores_gemma":[0.0020513956,0.000899479,0.0010079637,0.0027211236,0.0007992949,0.0013575559,0.0013216496,0.0010900877,0.013034524],"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.00017728236,0.000057453042,0.00039400364,0.000204899,0.000037509548,0.00009786215,0.00007348223,0.0047731996,0.10199372,0.005019354,0.006008795,0.88116235],"study_design_scores_gemma":[0.000044023334,0.00036942953,0.0049484754,0.000099756675,0.00021934908,0.0023254843,0.00024111413,0.43938166,0.46618244,0.021698453,0.064364865,0.00012500196],"about_ca_topic_score_codex":0.0017637896,"about_ca_topic_score_gemma":0.0036873466,"teacher_disagreement_score":0.01567357,"about_ca_system_score_codex":0.0005578168,"about_ca_system_score_gemma":0.00070315244,"threshold_uncertainty_score":0.052433312},"labels":[],"label_agreement":null},{"id":"W4404853673","doi":"10.1007/978-3-031-78169-8_23","title":"SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Institute on Governance","funders":"","keywords":"Computer science; Gradient boosting; Boosting (machine learning); Decision tree; Artificial intelligence; Machine learning; Random forest","score_opus":0.016213604744850646,"score_gpt":0.2490794080675904,"score_spread":0.23286580332273976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404853673","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.005219625,0.00041534664,0.98811114,0.00013397985,0.00014221566,0.00006708707,0.00016316913,0.004119692,0.001627777],"genre_scores_gemma":[0.18559241,0.0003847697,0.802948,0.00031089253,0.0001674052,0.00023492813,0.0011379928,0.00089264126,0.00833094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989366,0.00027391946,0.00005296545,0.00018874816,0.0004298694,0.00011788197],"domain_scores_gemma":[0.9992316,0.00031757233,0.000036003523,0.00021775345,0.00015103219,0.000046037003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015890987,0.000825048,0.0014088182,0.00067867123,0.0004998618,0.0013035013,0.002326684,0.0015375688,0.0055758813],"category_scores_gemma":[0.00380289,0.0007245243,0.00085869804,0.0009170819,0.0005783364,0.0017728354,0.0021125185,0.0023583116,0.0026057307],"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.0005301767,0.0002758568,0.00046106495,0.00014792336,0.00010944268,0.00012744959,0.00005864277,0.19716792,0.005753194,0.03687785,0.026967645,0.73152286],"study_design_scores_gemma":[0.000026122896,0.00003379832,0.000061009592,0.000009205477,0.000009530672,0.00003843609,0.000003485638,0.9736058,0.0018214466,0.021761345,0.0026229755,0.000006795109],"about_ca_topic_score_codex":0.002009133,"about_ca_topic_score_gemma":0.0030106697,"teacher_disagreement_score":0.0055758813,"about_ca_system_score_codex":0.00060569664,"about_ca_system_score_gemma":0.0013572695,"threshold_uncertainty_score":0.018653214},"labels":[],"label_agreement":null},{"id":"W4404876079","doi":"10.1007/978-981-96-0570-5","title":"Web Information Systems Engineering – WISE 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Sorbonne Université; Université de Pau et des Pays de l'Adour; University of Science and Technology of China; University of the Aegean; Indian Institute of Technology Roorkee; Università degli Studi di Brescia; University of Bern; Universidad Carlos III de Madrid; Waseda University; Universidad Nacional de La Plata; University of New South Wales; Jinan University; University of Crete; Griffith University; Technische Universiteit Eindhoven; Università degli Studi di Padova; University of Thessaly; Erasmus Universiteit Rotterdam; Universitat de València; Université de Bordeaux; Universidad de Alicante; Cardiff University; Deakin University; University of Macedonia; University of Technology Sydney; University of Cyprus; Université de Fribourg; Macquarie University; Sohar University; Charles Sturt University; Indian National Science Academy; Aix-Marseille Université; Lebanese American University; University of Hertfordshire; University of Miami; Universidad de Málaga; Norges Teknisk-Naturvitenskapelige Universitet; University of Southampton; Université du Luxembourg; University of Southern Queensland; Anglia Ruskin University; Universität Basel; University of Ottawa; Ocean University of China; Vanderbilt University; Universidad de Sevilla; La Trobe University; Commonwealth Scientific and Industrial Research Organisation; Harbin Institute of Technology; San Diego State University; University of Waikato","keywords":"Computer science; Information engineering; Software engineering; Information retrieval; World Wide Web; Information system","score_opus":0.005874555535227587,"score_gpt":0.21008637461595342,"score_spread":0.20421181908072583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404876079","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020176708,0.020674258,0.06695581,0.0050513525,0.0086367,0.00016807936,0.0013569611,0.003923274,0.891216],"genre_scores_gemma":[0.003469797,0.009194626,0.013433204,0.0007664615,0.0013807376,0.000047659596,0.001516278,0.0015253441,0.9686659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994388,0.000056447876,0.000019771765,0.000060052243,0.0003869035,0.00003805983],"domain_scores_gemma":[0.99925965,0.00014136989,0.000035403333,0.00013521554,0.00031423505,0.00011413773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115768,0.001275152,0.0006394952,0.0023125657,0.00041526018,0.002824314,0.00071005843,0.0011334195,0.080311425],"category_scores_gemma":[0.0012790475,0.0007591882,0.00048755706,0.0027731643,0.00037703197,0.0028118198,0.0011777377,0.0019476422,0.10211167],"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.000017032022,0.00003913476,0.00006950917,0.00014078488,0.000011613755,0.000028933513,0.000016570653,0.00088788057,0.0017865758,0.011551127,0.7034041,0.28204668],"study_design_scores_gemma":[0.000003627796,0.000026958245,0.00029617234,0.00011777629,0.000006498517,0.00013741358,0.000008919907,0.0018785917,0.0012014185,0.0070790127,0.9892369,0.0000066403027],"about_ca_topic_score_codex":0.0012379015,"about_ca_topic_score_gemma":0.0029252768,"teacher_disagreement_score":0.080311425,"about_ca_system_score_codex":0.0008013769,"about_ca_system_score_gemma":0.0010149325,"threshold_uncertainty_score":0.26866847},"labels":[],"label_agreement":null},{"id":"W4404883959","doi":"10.1007/978-3-031-78020-2_11","title":"On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Functional encryption; Black box; Encryption; Key (lock); Theoretical computer science; Computer security; Artificial intelligence; Ciphertext","score_opus":0.034951451313318234,"score_gpt":0.242765956206546,"score_spread":0.20781450489322778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404883959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15147671,0.006641049,0.59011656,0.016663007,0.0012302707,0.00019819118,0.0012676017,0.000594875,0.23181166],"genre_scores_gemma":[0.8824414,0.0044732825,0.06919214,0.0014376582,0.0017763225,0.0003760143,0.0008312588,0.00040973898,0.039062165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973074,0.00076885667,0.0001060068,0.0003609743,0.0010278098,0.00042887617],"domain_scores_gemma":[0.98377985,0.013407989,0.0004575007,0.0013372329,0.0007026965,0.00031474102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029591054,0.001259975,0.0018693348,0.0012161459,0.0014816519,0.004773822,0.002143947,0.002007586,0.010832097],"category_scores_gemma":[0.016523728,0.0007115771,0.0014213943,0.0018496291,0.0048371507,0.01731049,0.0033794749,0.0077446313,0.0016399333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011205429,0.0000406607,0.00015871269,0.00007445754,0.000013732706,0.000040927265,0.000098309545,0.008433702,0.00055283704,0.97709036,0.0037643032,0.009620079],"study_design_scores_gemma":[0.000012807015,0.000012225609,0.0000788243,0.000014332975,0.000005841956,0.00002629476,0.000012898836,0.020591343,0.00022714966,0.9778937,0.0011158265,0.000008747955],"about_ca_topic_score_codex":0.0014290818,"about_ca_topic_score_gemma":0.0010251148,"teacher_disagreement_score":0.010832097,"about_ca_system_score_codex":0.004110597,"about_ca_system_score_gemma":0.0022754634,"threshold_uncertainty_score":0.036237},"labels":[],"label_agreement":null},{"id":"W4404884731","doi":"10.1007/978-3-031-78128-5_13","title":"Label-Expanded Feature Debiasing for Single Domain Generalization","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Debiasing; Computer science; Generalization; Feature (linguistics); Domain (mathematical analysis); Artificial intelligence; Pattern recognition (psychology); Mathematics; Cognitive science","score_opus":0.028908520223616504,"score_gpt":0.26736242401646265,"score_spread":0.23845390379284614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404884731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012326049,0.0006018895,0.98138946,0.00018612594,0.00012029026,0.00005742245,0.00019788454,0.0034307975,0.001690093],"genre_scores_gemma":[0.3434995,0.0006149193,0.6382054,0.000608609,0.0001952234,0.0001824553,0.0021249827,0.0009901912,0.013578712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00013173839,0.000039701175,0.00028015344,0.00015174017,0.00009370264],"domain_scores_gemma":[0.9985012,0.00048980775,0.000052623425,0.00068097987,0.00021426594,0.00006121173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015116703,0.0008873275,0.001627618,0.0008509719,0.0006961381,0.00068470166,0.0022995828,0.0016247026,0.0065658786],"category_scores_gemma":[0.0032868674,0.00042289327,0.0011401061,0.000983424,0.00088146585,0.0022841806,0.0027557178,0.002984273,0.002274062],"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.0003200295,0.00015747109,0.0004460162,0.00014562793,0.0000829789,0.00011895885,0.000109896784,0.060222194,0.021713987,0.012783551,0.015407514,0.8884917],"study_design_scores_gemma":[0.000020493604,0.00006432614,0.00038673944,0.000020878702,0.000031705204,0.00011382964,0.000038589926,0.95591736,0.010983486,0.028562328,0.0038398604,0.00002035432],"about_ca_topic_score_codex":0.0040341443,"about_ca_topic_score_gemma":0.0058699055,"teacher_disagreement_score":0.0065658786,"about_ca_system_score_codex":0.0006025433,"about_ca_system_score_gemma":0.0007709897,"threshold_uncertainty_score":0.021965027},"labels":[],"label_agreement":null},{"id":"W4404884737","doi":"10.1007/978-3-031-78128-5_8","title":"Interpretable Deep Graph-Level Clustering: A Prototype-Based Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"McMaster University","funders":"","keywords":"Computer science; Cluster analysis; Graph; Clustering coefficient; Artificial intelligence; Data mining; Theoretical computer science","score_opus":0.023210733518045895,"score_gpt":0.24756078590858913,"score_spread":0.22435005239054323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404884737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005811672,0.00016715299,0.9885466,0.00017344483,0.000033128326,0.000064015425,0.0004221663,0.0026855953,0.0020962683],"genre_scores_gemma":[0.2065289,0.00032172026,0.78461194,0.00020048609,0.000060583283,0.00014550536,0.0023443648,0.001036432,0.004750006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991478,0.00018245135,0.000041535557,0.00034215205,0.00021374566,0.00007225873],"domain_scores_gemma":[0.9983211,0.0005728145,0.00011238498,0.0005418687,0.00038843637,0.00006333464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000885189,0.0011990515,0.001341344,0.0020672362,0.0007336267,0.0024087767,0.004668088,0.002210547,0.008026438],"category_scores_gemma":[0.0042636143,0.0009783189,0.0015522134,0.002271144,0.0011563177,0.0037601672,0.0020652981,0.0026701323,0.002615446],"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.0003257914,0.00022522532,0.0010716725,0.00053263234,0.00017799278,0.00023496864,0.0004044625,0.2286611,0.02008288,0.08255973,0.018546948,0.64717656],"study_design_scores_gemma":[0.000009132778,0.000024053455,0.00018696146,0.000026351325,0.000022429846,0.000053676118,0.0000514938,0.9206136,0.0030884044,0.0736855,0.0022261578,0.0000121469],"about_ca_topic_score_codex":0.0049726837,"about_ca_topic_score_gemma":0.009509811,"teacher_disagreement_score":0.008026438,"about_ca_system_score_codex":0.001334924,"about_ca_system_score_gemma":0.00086931157,"threshold_uncertainty_score":0.026851177},"labels":[],"label_agreement":null},{"id":"W4404889959","doi":"10.1007/978-3-031-78347-0_10","title":"Task Consistent Prototype Learning for Incremental Few-Shot Semantic Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"Concordia University","funders":"","keywords":"Computer science; Shot (pellet); Task (project management); Segmentation; Artificial intelligence; Natural language processing","score_opus":0.030534175458269763,"score_gpt":0.2784786636380164,"score_spread":0.24794448817974662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404889959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018465558,0.0011903105,0.9723709,0.00016314798,0.00014694393,0.00015708203,0.00048139857,0.005372774,0.0016518743],"genre_scores_gemma":[0.33424369,0.00083297736,0.64925677,0.00046328537,0.00018200935,0.0003900594,0.0055654934,0.0011953587,0.007870291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988986,0.0002058325,0.000063819905,0.00052686234,0.0001765251,0.0001283929],"domain_scores_gemma":[0.9979844,0.0010706378,0.000068475805,0.00050179573,0.00026845973,0.000106137646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654243,0.0015089163,0.00299791,0.0012663793,0.0007344983,0.0016106082,0.0050521526,0.0027495604,0.0063158846],"category_scores_gemma":[0.004105632,0.0011623175,0.0015650376,0.0016913725,0.00088339974,0.0035454351,0.002768737,0.0029487312,0.0028062821],"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.00061807607,0.00038946694,0.00048508463,0.00043519153,0.00020899215,0.00018217078,0.0001912981,0.062306628,0.028040932,0.005765131,0.014809577,0.88656735],"study_design_scores_gemma":[0.00002865459,0.00011227245,0.00038326986,0.000024798243,0.000049237868,0.00014255646,0.00006884257,0.9686923,0.009506321,0.018980546,0.0019870852,0.000024185565],"about_ca_topic_score_codex":0.0054465905,"about_ca_topic_score_gemma":0.009130627,"teacher_disagreement_score":0.0063158846,"about_ca_system_score_codex":0.0009876809,"about_ca_system_score_gemma":0.0014679129,"threshold_uncertainty_score":0.021128774},"labels":[],"label_agreement":null},{"id":"W4404891168","doi":"10.1007/978-3-031-78201-5_21","title":"Engagement Measurement Based on Facial Landmarks and Spatial-Temporal Graph Convolutional Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University Health Network","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science","score_opus":0.044021815758822636,"score_gpt":0.27614388090990266,"score_spread":0.23212206515108003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404891168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46958628,0.00092833454,0.5166266,0.00013947346,0.00014336646,0.00011275339,0.0018578435,0.0014073952,0.009197953],"genre_scores_gemma":[0.96371,0.00025769067,0.03216618,0.000038402737,0.000037240563,0.00006247055,0.0009669002,0.00006182394,0.0026992918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973875,0.000048068818,0.0000070119204,0.000087906126,0.00006881005,0.00004944597],"domain_scores_gemma":[0.99981266,0.000052393993,0.000027056212,0.000022430815,0.00006308433,0.000022387261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023861224,0.00046558862,0.00042950746,0.0007394056,0.00014824742,0.00045037913,0.00034326923,0.00036648457,0.0022902722],"category_scores_gemma":[0.00071921456,0.00013502057,0.00027993915,0.0009277738,0.00020623283,0.00055289245,0.00048688802,0.000321691,0.0010106032],"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.0015506583,0.00035189372,0.035647225,0.00019312641,0.0001995747,0.00016242276,0.00014513056,0.048524156,0.14396024,0.0026078955,0.007047923,0.75960976],"study_design_scores_gemma":[0.000022905606,0.0003067511,0.075249895,0.000027228123,0.00008364263,0.0002632664,0.00011476321,0.89528096,0.024491752,0.002466297,0.0016514204,0.00004104566],"about_ca_topic_score_codex":0.0028874069,"about_ca_topic_score_gemma":0.0068725594,"teacher_disagreement_score":0.0028874069,"about_ca_system_score_codex":0.00032646564,"about_ca_system_score_gemma":0.00024678893,"threshold_uncertainty_score":0.00766176},"labels":[],"label_agreement":null},{"id":"W4404892931","doi":"10.1007/978-3-031-78110-0_14","title":"Hybrid Human Action Anomaly Detection Based on Lightweight GNNs and Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Anomaly detection; Artificial intelligence; Action (physics); Machine learning","score_opus":0.017354435674233323,"score_gpt":0.25116807917056494,"score_spread":0.2338136434963316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404892931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04829625,0.00035011765,0.9414866,0.00013322722,0.00022778423,0.00006577563,0.0002694022,0.006988111,0.00218285],"genre_scores_gemma":[0.6722243,0.0002881181,0.32000044,0.00021042625,0.00014292284,0.000093839946,0.00086251803,0.00031975014,0.005857772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991755,0.00008648048,0.0000336209,0.00026271443,0.00032154296,0.00012007623],"domain_scores_gemma":[0.9992316,0.00021755187,0.000085217944,0.00015883804,0.00025613006,0.000050762843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000657685,0.00086086616,0.0014027948,0.0018949078,0.00036981187,0.00079886545,0.0015007427,0.0008972761,0.0016835862],"category_scores_gemma":[0.0014776706,0.00030166746,0.00069294404,0.0014518,0.00047212705,0.0014186612,0.0012794202,0.00084811996,0.0009463693],"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.0006636611,0.00031159417,0.008885478,0.00011482384,0.00021572097,0.00031142408,0.000068599235,0.077062145,0.03518133,0.0046327617,0.0052840454,0.86726844],"study_design_scores_gemma":[0.000011519497,0.00008495254,0.0026259406,0.0000107145315,0.000036379428,0.00026609452,0.000019221578,0.97732055,0.012087705,0.005880291,0.0016356418,0.000021121245],"about_ca_topic_score_codex":0.0044598654,"about_ca_topic_score_gemma":0.00528583,"teacher_disagreement_score":0.0044598654,"about_ca_system_score_codex":0.0006496239,"about_ca_system_score_gemma":0.0007062097,"threshold_uncertainty_score":0.0088678},"labels":[],"label_agreement":null},{"id":"W4404892934","doi":"10.1007/978-3-031-72913-3_4","title":"Insect Identification in the Wild: The AMI Dataset","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Species Distribution and Climate Change","field":"Environmental 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":"McGill University; Espace pour la vie; Université de Sherbrooke; Canadian Heritage; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Environment Research Council; Sight Research UK","keywords":"Computer science; Identification (biology); Artificial intelligence; Biology; Ecology","score_opus":0.034063554987572076,"score_gpt":0.2615347412478275,"score_spread":0.22747118626025542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404892934","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04437582,0.0014824136,0.0023305677,0.0004771657,0.00041808473,0.00014383873,0.940803,0.0054066014,0.0045624664],"genre_scores_gemma":[0.017895918,0.00020744785,0.0037925406,0.00014289904,0.0000630085,0.0001009779,0.9760774,0.00010414732,0.0016156603],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940085,0.00005990525,0.000053659707,0.00019321393,0.0001808235,0.000111516296],"domain_scores_gemma":[0.9993461,0.00008706372,0.000053123676,0.00023789496,0.00016680473,0.00010898171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005555308,0.0022003339,0.0012520571,0.0019578806,0.00059415225,0.0009636213,0.0019070366,0.0021085648,0.0064148656],"category_scores_gemma":[0.0012086142,0.0003890045,0.0015698794,0.0018729853,0.00036964493,0.0008971983,0.0011533508,0.00106636,0.015057106],"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.00076806,0.0006080254,0.018666249,0.0010845709,0.0004602924,0.0005607766,0.000105923704,0.0038911619,0.005986154,0.00037062456,0.8974742,0.070024],"study_design_scores_gemma":[0.00086429215,0.0007371713,0.2518554,0.000625551,0.0005401393,0.0026602554,0.0012676291,0.049724795,0.017055294,0.0043046437,0.6699935,0.0003713842],"about_ca_topic_score_codex":0.0142155215,"about_ca_topic_score_gemma":0.03832244,"teacher_disagreement_score":0.0142155215,"about_ca_system_score_codex":0.00050919846,"about_ca_system_score_gemma":0.0006601193,"threshold_uncertainty_score":0.028265595},"labels":[],"label_agreement":null},{"id":"W4404892943","doi":"10.1007/978-3-031-78383-8_12","title":"Phase-Encoded Cascaded Autoencoders based Correlation Filters and Adaptive Thresholding for Illumination Invariant Face Recognition","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","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":"Future Earth","funders":"","keywords":"Thresholding; Computer science; Invariant (physics); Artificial intelligence; Facial recognition system; Pattern recognition (psychology); Correlation; Computer vision; Face (sociological concept); Speech recognition; Image (mathematics); Mathematics","score_opus":0.037154759088158906,"score_gpt":0.2688037469459082,"score_spread":0.2316489878577493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404892943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009167082,0.00057860604,0.9878598,0.000044151635,0.00008657274,0.000020676984,0.000053885535,0.000395186,0.0017939146],"genre_scores_gemma":[0.1395334,0.0012147883,0.84570926,0.00011005896,0.00010455889,0.000070324895,0.00033977948,0.00017723114,0.0127406195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982786,0.000026722235,0.00000866702,0.000041408613,0.000076799064,0.000018460836],"domain_scores_gemma":[0.9997918,0.00008235528,0.000018635517,0.000043774362,0.000057038487,0.000006401281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002642988,0.00043914389,0.00048482692,0.0002870319,0.00015948221,0.00046910907,0.0007843206,0.0006782832,0.0034749135],"category_scores_gemma":[0.0006123351,0.00035254244,0.000566672,0.00055114063,0.00025100724,0.0006141751,0.00043850933,0.00072085316,0.0014986591],"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.00015992904,0.00013033784,0.0002719211,0.00014601434,0.00007250126,0.00010808715,0.000051176095,0.08564262,0.1716471,0.01796498,0.0054136124,0.71839166],"study_design_scores_gemma":[0.0000053369913,0.000058306272,0.0006366859,0.000012501014,0.000027622633,0.0001820413,0.000008923462,0.95371974,0.038850345,0.0032381592,0.0032461057,0.000014254104],"about_ca_topic_score_codex":0.0014686008,"about_ca_topic_score_gemma":0.003562643,"teacher_disagreement_score":0.0034749135,"about_ca_system_score_codex":0.00029271154,"about_ca_system_score_gemma":0.00034543642,"threshold_uncertainty_score":0.0116247535},"labels":[],"label_agreement":null},{"id":"W4404892969","doi":"10.1007/978-3-031-72913-3_17","title":"SweepNet: Unsupervised Learning Shape Abstraction via Neural Sweepers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"","keywords":"Computer science; Abstraction; Artificial intelligence; Unsupervised learning; Artificial neural network; Machine learning","score_opus":0.011858015764417845,"score_gpt":0.21690174761490127,"score_spread":0.20504373185048344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404892969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014061955,0.00052344345,0.9644795,0.00014516653,0.00015198125,0.00008592127,0.0008568335,0.016276341,0.0034188626],"genre_scores_gemma":[0.19417377,0.0009212832,0.77585167,0.00040450387,0.00016755835,0.00029925507,0.0058389073,0.002069118,0.02027396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974364,0.000023202063,0.00001186149,0.000105665975,0.00007902764,0.00003654178],"domain_scores_gemma":[0.9996946,0.00010671061,0.000021397065,0.00009198837,0.000056109442,0.000029145529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004400587,0.0014717409,0.001420953,0.0008768439,0.00042606672,0.0011636069,0.0028321242,0.0015883249,0.011131168],"category_scores_gemma":[0.0008923898,0.0010896578,0.0014241583,0.0014842227,0.0006594487,0.0022780967,0.002027314,0.0020234596,0.0042561507],"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.00024033959,0.00013309241,0.0005726481,0.00015208605,0.00012954843,0.000119806755,0.000050263887,0.20853242,0.019230533,0.008753991,0.019942475,0.7421428],"study_design_scores_gemma":[0.00001642544,0.000033319757,0.00014377185,0.000010647573,0.000012539316,0.000032983367,0.000011238133,0.98587626,0.0042174244,0.007022375,0.0026130155,0.000010002851],"about_ca_topic_score_codex":0.0063331756,"about_ca_topic_score_gemma":0.01151459,"teacher_disagreement_score":0.011131168,"about_ca_system_score_codex":0.00073358935,"about_ca_system_score_gemma":0.0008691077,"threshold_uncertainty_score":0.037237465},"labels":[],"label_agreement":null},{"id":"W4404893039","doi":"10.1007/978-3-031-78110-0_29","title":"Transformer-Based RGB and LiDAR Fusion for Enhanced Object Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Lidar; Computer vision; Transformer; RGB color model; Artificial intelligence; Fusion; Remote sensing; Electrical engineering; Geography; Engineering; Voltage","score_opus":0.013514235089094852,"score_gpt":0.2570924376651464,"score_spread":0.24357820257605153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404893039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027001966,0.0009161898,0.9645982,0.000111060974,0.000150907,0.000046559715,0.00035274948,0.0022981467,0.0045241937],"genre_scores_gemma":[0.48897085,0.0016347092,0.49705496,0.0002629474,0.0001138862,0.000055854693,0.0011927406,0.00029761737,0.010416368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968207,0.000029970184,0.000012870975,0.000052735228,0.00018254839,0.00003975796],"domain_scores_gemma":[0.99986494,0.00002534724,0.000013180309,0.000026110456,0.00006286397,0.000007515295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030581185,0.0005271595,0.00062702666,0.0007584604,0.00016308311,0.0008164867,0.00081872585,0.00046714075,0.0051888246],"category_scores_gemma":[0.00045012246,0.0003522792,0.000547982,0.0012265483,0.00020643174,0.0012430045,0.0009812387,0.000503933,0.0026791657],"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.00033576868,0.00009763787,0.0006967228,0.00021882312,0.000065613385,0.00006921278,0.000041252013,0.011349785,0.31940007,0.0034297758,0.0043860185,0.65990925],"study_design_scores_gemma":[0.000034975,0.00021544566,0.002875003,0.000046738565,0.00014871331,0.0008210235,0.00006148915,0.6538219,0.32280022,0.005100521,0.014014642,0.000059330734],"about_ca_topic_score_codex":0.0012674375,"about_ca_topic_score_gemma":0.0023391128,"teacher_disagreement_score":0.0051888246,"about_ca_system_score_codex":0.00029578674,"about_ca_system_score_gemma":0.0005006863,"threshold_uncertainty_score":0.017358363},"labels":[],"label_agreement":null},{"id":"W4404893151","doi":"10.1007/978-3-031-72897-6_19","title":"VITATECS: A Diagnostic Dataset for Temporal Concept Understanding of Video-Language Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence","score_opus":0.03741656571281926,"score_gpt":0.3051162996673086,"score_spread":0.2676997339544893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404893151","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0646027,0.0023719585,0.043967616,0.00084336865,0.0006596195,0.0014053785,0.8329862,0.045019228,0.008143941],"genre_scores_gemma":[0.03810112,0.00040310982,0.036447987,0.00022269228,0.00005353072,0.00070840004,0.9197385,0.00076472363,0.003559928],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990029,0.0001909557,0.000094852316,0.0003288474,0.00027692653,0.00010567885],"domain_scores_gemma":[0.9974146,0.0011087239,0.00014898682,0.0006234108,0.00045906557,0.00024524753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012543094,0.0029898495,0.0010160839,0.003380964,0.0008282922,0.0016133876,0.0034305267,0.0031212545,0.01483277],"category_scores_gemma":[0.007533285,0.0006145686,0.0018594743,0.0024865652,0.00063222967,0.0018969056,0.0017090889,0.0026931828,0.012200166],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014659916,0.0012187057,0.0058359625,0.0022613297,0.0004642171,0.0009404557,0.00028439605,0.017987473,0.014179532,0.0040466725,0.7580483,0.19326705],"study_design_scores_gemma":[0.0019795627,0.0013295854,0.024643097,0.0007771599,0.00063811085,0.0024955533,0.0013356023,0.364022,0.0537208,0.019772636,0.528804,0.00048196543],"about_ca_topic_score_codex":0.030348476,"about_ca_topic_score_gemma":0.043138083,"teacher_disagreement_score":0.030348476,"about_ca_system_score_codex":0.0018368941,"about_ca_system_score_gemma":0.0024537423,"threshold_uncertainty_score":0.060343683},"labels":[],"label_agreement":null},{"id":"W4404893155","doi":"10.1007/978-3-031-72897-6_21","title":"CadVLM: Bridging Language and Vision in the Generation of Parametric CAD Sketches","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Autodesk (Canada); Université de Montréal","funders":"","keywords":"Computer science; Bridging (networking); CAD; Parametric statistics; Artificial intelligence; Engineering drawing; Natural language processing; Computer vision; Computer graphics (images); Programming language; Mathematics; Engineering","score_opus":0.015841093255852833,"score_gpt":0.2515433380222569,"score_spread":0.23570224476640408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404893155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012270383,0.00023872081,0.97413343,0.00007411939,0.00007349947,0.000054958437,0.00031805277,0.017502047,0.0063780574],"genre_scores_gemma":[0.03781222,0.00062763575,0.92758167,0.00018224386,0.000048783895,0.00024131696,0.0031998039,0.009982322,0.020323932],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992424,0.000106921034,0.00004997286,0.00014399616,0.00038740688,0.000069234826],"domain_scores_gemma":[0.9994893,0.00022028692,0.000018187404,0.00012141962,0.00012256441,0.000028153196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070893054,0.0012609684,0.00088950177,0.0014773182,0.0005768008,0.0033850006,0.003398327,0.0016690157,0.040418427],"category_scores_gemma":[0.0022829117,0.0014920734,0.0016786125,0.0012694327,0.0009493007,0.0026703177,0.0031405645,0.0020173274,0.014630587],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012824297,0.000085060856,0.00027405136,0.0007535935,0.00004382535,0.00037325727,0.00049966446,0.023688016,0.034667946,0.10963827,0.07886619,0.7509818],"study_design_scores_gemma":[0.00012529622,0.00009874301,0.0003674392,0.0003514306,0.00004635001,0.0009922684,0.00016604419,0.45702246,0.07029999,0.090757154,0.37966177,0.000111078836],"about_ca_topic_score_codex":0.0016522912,"about_ca_topic_score_gemma":0.002038301,"teacher_disagreement_score":0.040418427,"about_ca_system_score_codex":0.0006701755,"about_ca_system_score_gemma":0.00078421785,"threshold_uncertainty_score":0.13521308},"labels":[],"label_agreement":null},{"id":"W4404902755","doi":"10.1007/978-981-96-0567-5","title":"Web Information Systems Engineering – WISE 2024","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":5,"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":"Université de Pau et des Pays de l'Adour; Singapore Management University; University of Science and Technology of China; Yunnan University; University of the Aegean; Sorbonne Université; Università degli Studi di Salerno; Sohar University; Australian Catholic University; Waseda University; Universidad Nacional de La Plata; University of New South Wales; Jinan University; University of Crete; Griffith University; Technische Universiteit Eindhoven; Università degli Studi di Padova; University of Thessaly; Erasmus Universiteit Rotterdam; Università degli Studi di Brescia; Indian Institute of Technology Roorkee; Aix-Marseille Université; Lebanese American University; Swinburne University of Technology; Delhi Technological University; Universitat de València; Université de Fribourg; Macquarie University; Université de Bordeaux; Universidad de Alicante; Cardiff University; Deakin University; University of Macedonia; University of Technology Sydney; University of Cyprus; Charles Sturt University; Indian National Science Academy; University of Hertfordshire; University of Miami; Universidad de Málaga; Norges Teknisk-Naturvitenskapelige Universitet; Université de Sfax; Universidad Carlos III de Madrid; University of Bern; University of Southampton; Université du Luxembourg; University of Southern Queensland; Anglia Ruskin University; Universität Basel; University of Ottawa; Ocean University of China; Vanderbilt University; Universidade de Macau; Universidad de Sevilla; La Trobe University; Commonwealth Scientific and Industrial Research Organisation; Harbin Institute of Technology; Universität Duisburg-Essen; San Diego State University; University of Waikato","keywords":"Computer science; Information engineering; Software engineering; World Wide Web; Information system; Information retrieval; Electrical engineering","score_opus":0.005874555535227587,"score_gpt":0.21008637461595342,"score_spread":0.20421181908072583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404902755","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020176708,0.020674258,0.06695581,0.0050513525,0.0086367,0.00016807936,0.0013569611,0.003923274,0.891216],"genre_scores_gemma":[0.003469797,0.009194626,0.013433204,0.0007664615,0.0013807376,0.000047659596,0.001516278,0.0015253441,0.9686659],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994388,0.000056447876,0.000019771765,0.000060052243,0.0003869035,0.00003805983],"domain_scores_gemma":[0.99925965,0.00014136989,0.000035403333,0.00013521554,0.00031423505,0.00011413773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115768,0.001275152,0.0006394952,0.0023125657,0.00041526018,0.002824314,0.00071005843,0.0011334195,0.080311425],"category_scores_gemma":[0.0012790475,0.0007591882,0.00048755706,0.0027731643,0.00037703197,0.0028118198,0.0011777377,0.0019476422,0.10211167],"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.000017032022,0.00003913476,0.00006950917,0.00014078488,0.000011613755,0.000028933513,0.000016570653,0.00088788057,0.0017865758,0.011551127,0.7034041,0.28204668],"study_design_scores_gemma":[0.000003627796,0.000026958245,0.00029617234,0.00011777629,0.000006498517,0.00013741358,0.000008919907,0.0018785917,0.0012014185,0.0070790127,0.9892369,0.0000066403027],"about_ca_topic_score_codex":0.0012379015,"about_ca_topic_score_gemma":0.0029252768,"teacher_disagreement_score":0.080311425,"about_ca_system_score_codex":0.0008013769,"about_ca_system_score_gemma":0.0010149325,"threshold_uncertainty_score":0.26866847},"labels":[],"label_agreement":null},{"id":"W4404903165","doi":"10.1007/978-3-031-78023-3_8","title":"Secure Computation with Parallel Calls to 2-Ary Functions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Parallel computing; Programming language","score_opus":0.012501993343634651,"score_gpt":0.23959426685975815,"score_spread":0.2270922735161235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404903165","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.112821676,0.0014991985,0.7227427,0.0010231468,0.0007231517,0.00021515893,0.00034451587,0.00576242,0.15486811],"genre_scores_gemma":[0.72875917,0.0011095776,0.18022655,0.00041493014,0.0005119059,0.00033427557,0.00051813375,0.0014405298,0.086685054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987674,0.00022852722,0.00006717541,0.0001595091,0.00048668854,0.00029068402],"domain_scores_gemma":[0.99910057,0.0003134141,0.00004553089,0.00043447726,0.0000666309,0.000039444454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070514076,0.0012752254,0.00093455246,0.00081015454,0.0012850246,0.002794179,0.00088073086,0.0010978956,0.010968746],"category_scores_gemma":[0.0017172006,0.00072401075,0.0011059522,0.0013639156,0.0017847746,0.004762847,0.0032273708,0.002232983,0.004283595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095097255,0.0001361041,0.00044028062,0.00024923228,0.0000582413,0.00023734309,0.00044640893,0.022179144,0.02377041,0.7744382,0.015321647,0.16177195],"study_design_scores_gemma":[0.00014318537,0.000151924,0.00040041306,0.000061970335,0.000052121584,0.0003833429,0.00006900498,0.088954486,0.037652057,0.8265845,0.045481812,0.00006507671],"about_ca_topic_score_codex":0.00044196626,"about_ca_topic_score_gemma":0.0006258484,"teacher_disagreement_score":0.010968746,"about_ca_system_score_codex":0.0012209638,"about_ca_system_score_gemma":0.000825792,"threshold_uncertainty_score":0.03669411},"labels":[],"label_agreement":null},{"id":"W4404909429","doi":"10.1007/978-3-031-78447-7_12","title":"CLIP-Based Point Cloud Classification via Point Cloud to Image Translation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Concordia University; University of Manitoba","funders":"","keywords":"Computer science; Cloud computing; Point cloud; Translation (biology); Point (geometry); Artificial intelligence; Image (mathematics); Computer vision; Operating system; Geometry; Mathematics","score_opus":0.018889982206358825,"score_gpt":0.23952574394388085,"score_spread":0.22063576173752203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404909429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014480876,0.00036462315,0.97472626,0.00009507927,0.00017745046,0.0001735835,0.00058562064,0.006471112,0.002925431],"genre_scores_gemma":[0.17690685,0.001362935,0.80239177,0.00025747396,0.00028259068,0.0002836782,0.005979303,0.0012268831,0.011308427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.000032134172,0.000020372925,0.00015091187,0.00050927995,0.00011636324],"domain_scores_gemma":[0.9993761,0.000077723176,0.000035316778,0.00017720181,0.0002901082,0.0000436757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036451692,0.0011905205,0.0018254208,0.0022544446,0.0006013239,0.001678579,0.0021895752,0.0009082668,0.008364903],"category_scores_gemma":[0.00089821615,0.0005540182,0.0014125636,0.004224098,0.0004743476,0.0011662024,0.0018658121,0.001237381,0.008858622],"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.00025670225,0.00010968087,0.0006274369,0.00012528469,0.000067918074,0.00010081166,0.00003978353,0.011729955,0.07353252,0.0014714588,0.011830142,0.90010834],"study_design_scores_gemma":[0.00002599164,0.00013404657,0.0036879282,0.000027022263,0.00008071428,0.0005561945,0.00009001503,0.9063933,0.07594884,0.0033311332,0.00967998,0.000044866632],"about_ca_topic_score_codex":0.0061926204,"about_ca_topic_score_gemma":0.0060001393,"teacher_disagreement_score":0.008364903,"about_ca_system_score_codex":0.0005738096,"about_ca_system_score_gemma":0.0010225134,"threshold_uncertainty_score":0.027983427},"labels":[],"label_agreement":null},{"id":"W4404909983","doi":"10.1007/978-3-031-78447-7_17","title":"MarUCOD: Unknown but Concerned Object Detection in Maritime Environments","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Nexen (Canada)","funders":"","keywords":"Computer science; Object (grammar); Computer vision; Artificial intelligence","score_opus":0.01298015442975818,"score_gpt":0.24083993394818096,"score_spread":0.2278597795184228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404909983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013361428,0.0026748467,0.9529511,0.00028581917,0.0008817836,0.00012079377,0.0009357919,0.021046715,0.0077416603],"genre_scores_gemma":[0.10937426,0.00094070856,0.86175364,0.00040302324,0.00030968984,0.00015377895,0.0029006053,0.0016534074,0.022510953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935883,0.00007950003,0.000017842078,0.00023077047,0.00022816588,0.00008484957],"domain_scores_gemma":[0.9995763,0.00011089048,0.000024851748,0.00011681648,0.00012207474,0.000049081984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067625294,0.0017938516,0.0017043581,0.00072321465,0.00057272176,0.0015490996,0.0030896273,0.0018122033,0.0056138765],"category_scores_gemma":[0.0013227137,0.00071062904,0.0008294872,0.0007325002,0.0005604556,0.0014809868,0.0026206393,0.0014532163,0.0040437966],"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.000753038,0.00012598716,0.0010992846,0.00037072174,0.00013434433,0.00039035943,0.00007015652,0.027244044,0.03367895,0.00939598,0.074954376,0.8517828],"study_design_scores_gemma":[0.00006024467,0.00025675885,0.0018397847,0.00007291475,0.00005915831,0.0010184954,0.0000669351,0.8576102,0.051993523,0.017759986,0.069189444,0.0000725924],"about_ca_topic_score_codex":0.0028885948,"about_ca_topic_score_gemma":0.005177377,"teacher_disagreement_score":0.0056138765,"about_ca_system_score_codex":0.00043210844,"about_ca_system_score_gemma":0.0008091963,"threshold_uncertainty_score":0.018780231},"labels":[],"label_agreement":null},{"id":"W4404926735","doi":"10.1007/978-3-031-78456-9_9","title":"Visibility-Aware Pixelwise View Selection for Multi-View Stereo Matching","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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 Guelph","funders":"","keywords":"Computer science; Visibility; Computer vision; Artificial intelligence; Matching (statistics); Selection (genetic algorithm); Computer graphics (images); Mathematics; Optics","score_opus":0.035130995180397015,"score_gpt":0.3266706399228931,"score_spread":0.29153964474249605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404926735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010738798,0.0002309973,0.98678595,0.00002543282,0.000039205945,0.000028090446,0.00010928954,0.0007972505,0.0012450217],"genre_scores_gemma":[0.17904869,0.000329023,0.81654847,0.0000829646,0.000060425933,0.000057041667,0.0007631873,0.0003302413,0.002780037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.000073985575,0.000029284292,0.00012662806,0.00034010262,0.0000895175],"domain_scores_gemma":[0.9995388,0.000109237175,0.000041725223,0.00012953088,0.00014868799,0.000032082058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036719325,0.0007260069,0.0010126792,0.0011091749,0.00026941262,0.0008593799,0.0011969352,0.0006659038,0.0045799734],"category_scores_gemma":[0.0010518498,0.0005702649,0.00081524794,0.0011170837,0.00023611847,0.0009583315,0.0016609186,0.0008414669,0.0016764682],"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.00040902614,0.00016240281,0.0006706394,0.00016148773,0.00010186866,0.000088011206,0.000066008,0.019278161,0.23752402,0.0054451153,0.005131901,0.73096126],"study_design_scores_gemma":[0.00004216376,0.00015495057,0.0015850081,0.000025832509,0.000059326525,0.00050557323,0.000050565443,0.8524027,0.13189939,0.0070797214,0.006157941,0.000036885893],"about_ca_topic_score_codex":0.0016102132,"about_ca_topic_score_gemma":0.0034447957,"teacher_disagreement_score":0.0045799734,"about_ca_system_score_codex":0.0002998395,"about_ca_system_score_gemma":0.00067375536,"threshold_uncertainty_score":0.015321493},"labels":[],"label_agreement":null},{"id":"W4404926798","doi":"10.1007/978-3-031-78456-9_11","title":"An Empirical Evaluation of the Impact of Solar Correction in NeRFs for Satellite Imagery","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Satellite Image Processing and Photogrammetry","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Satellite; Remote sensing; Geology; Astronomy; Physics","score_opus":0.03047868556314203,"score_gpt":0.3285849794382271,"score_spread":0.2981062938750851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404926798","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.9883129,0.0004978758,0.0038049219,0.00021866387,0.00002432724,0.000063333624,0.000942343,0.000109128654,0.0060265274],"genre_scores_gemma":[0.994886,0.000110172456,0.0029843543,0.000030480092,0.000014883071,0.000019165544,0.0008481316,0.000030078252,0.001076872],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99407554,0.0036032924,0.00020359438,0.00063349336,0.001284832,0.0001992483],"domain_scores_gemma":[0.79907286,0.18068676,0.0054417555,0.0060286066,0.007875813,0.0008942066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008475721,0.00049510703,0.00027682693,0.000884049,0.0004861275,0.0011340269,0.0014515851,0.00092776364,0.0058491235],"category_scores_gemma":[0.075588286,0.00023087866,0.00060806813,0.0017318446,0.0009324588,0.0021995427,0.0008021554,0.0008282796,0.0008557596],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046905684,0.0020277349,0.69897676,0.00046813738,0.00061225134,0.0004904157,0.0008923612,0.14477211,0.0040187305,0.0020618148,0.0032267103,0.13776247],"study_design_scores_gemma":[0.00018933062,0.0030562505,0.8109106,0.000101497586,0.0004877319,0.00040941857,0.002454654,0.1718735,0.0052228025,0.001178158,0.004057072,0.0000589884],"about_ca_topic_score_codex":0.025256207,"about_ca_topic_score_gemma":0.026227107,"teacher_disagreement_score":0.025256207,"about_ca_system_score_codex":0.0013882007,"about_ca_system_score_gemma":0.0007823846,"threshold_uncertainty_score":0.050218403},"labels":[],"label_agreement":null},{"id":"W4404931954","doi":"10.1007/978-3-031-78395-1_6","title":"Improving Out-of-Distribution Data Handling and Corruption Resistance via Modern Hopfield Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","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 Windsor","funders":"","keywords":"Computer science; Hopfield network; Language change; Resistance (ecology); Artificial intelligence; Artificial neural network; Computer security","score_opus":0.015113780493734658,"score_gpt":0.22558132666835767,"score_spread":0.21046754617462302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404931954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06547256,0.00059746846,0.9252358,0.00030036728,0.00011266363,0.000035954108,0.0000483838,0.0014595408,0.0067371638],"genre_scores_gemma":[0.8906909,0.00046079312,0.1026295,0.000117662814,0.000088105466,0.000031247226,0.0000866546,0.00015878552,0.0057363017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.000087907065,0.00003445952,0.00010391485,0.00018211518,0.000093937546],"domain_scores_gemma":[0.9980888,0.0007959941,0.00016775554,0.0004644171,0.00040070817,0.00008229257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083109335,0.0006218816,0.0006417087,0.0007119536,0.00056264503,0.0010507957,0.0012731726,0.000771652,0.0033405917],"category_scores_gemma":[0.0053979275,0.0002332577,0.00035960393,0.00064557197,0.000743027,0.002392926,0.001352226,0.001058461,0.00054906425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038429006,0.00018823544,0.00093841046,0.00016439997,0.000077208286,0.00012724045,0.00018331887,0.5137902,0.035478234,0.053819742,0.0044530816,0.39039558],"study_design_scores_gemma":[0.000008379849,0.000043682023,0.00010380472,0.000009204534,0.000017653812,0.000029710614,0.000014340762,0.9759871,0.005681974,0.017003603,0.0010929279,0.00000770549],"about_ca_topic_score_codex":0.0031306767,"about_ca_topic_score_gemma":0.0027641356,"teacher_disagreement_score":0.0033405917,"about_ca_system_score_codex":0.0009076288,"about_ca_system_score_gemma":0.0006740469,"threshold_uncertainty_score":0.011175454},"labels":[],"label_agreement":null},{"id":"W4404932874","doi":"10.1007/978-981-96-0567-5_15","title":"Vector Representation Learning of Skills for Collaborative Team Recommendation: A Comparative Study","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Windsor","funders":"","keywords":"Computer science; Representation (politics); Artificial intelligence; Human–computer interaction; Knowledge management","score_opus":0.04193913212345869,"score_gpt":0.3319939661844991,"score_spread":0.29005483406104043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404932874","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.728847,0.002689155,0.25386772,0.00078380137,0.00015745014,0.00031694662,0.00043691858,0.0015193278,0.011381687],"genre_scores_gemma":[0.95069665,0.0006521276,0.04424835,0.000056202356,0.00004492871,0.000107885426,0.0006408257,0.000081137034,0.00347187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981469,0.0009768298,0.00008928491,0.0003240599,0.00033404006,0.00012901466],"domain_scores_gemma":[0.96898234,0.026825385,0.00059238484,0.0016286878,0.0015080278,0.0004632195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039865165,0.000524899,0.00079331925,0.0012778109,0.00039040507,0.001754373,0.0013664647,0.0011700679,0.003475313],"category_scores_gemma":[0.022262385,0.00020365987,0.0007119848,0.0017839117,0.0003504386,0.0040231314,0.000849113,0.0014396714,0.00091733615],"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.0015542333,0.0023529492,0.013779833,0.00033460316,0.00023230816,0.000028050468,0.000660585,0.04457355,0.0020298415,0.0033176648,0.0035340784,0.9276023],"study_design_scores_gemma":[0.00017583572,0.002067985,0.016445093,0.00008434695,0.00028758717,0.000085837964,0.0008942927,0.963835,0.0034848629,0.009272456,0.0033103747,0.00005629488],"about_ca_topic_score_codex":0.008025565,"about_ca_topic_score_gemma":0.0047337287,"teacher_disagreement_score":0.008025565,"about_ca_system_score_codex":0.0011728235,"about_ca_system_score_gemma":0.0010411588,"threshold_uncertainty_score":0.021082997},"labels":[],"label_agreement":null},{"id":"W4404943058","doi":"10.1007/978-3-031-78305-0_15","title":"Diffusion Models as a Representation Learner for Deepfake Image Detection","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Representation (politics); Diffusion; Image (mathematics); Artificial intelligence; Computer vision; Thermodynamics","score_opus":0.02050881456786294,"score_gpt":0.260682528575783,"score_spread":0.24017371400792006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404943058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060322466,0.00048615783,0.99163014,0.00021266815,0.000048193695,0.000016241014,0.000055276585,0.0006638497,0.00085519196],"genre_scores_gemma":[0.43898007,0.0013843665,0.52983093,0.00039710643,0.00019631664,0.00012961973,0.0005668526,0.0006980081,0.027816752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971646,0.00007869517,0.000011498605,0.000076430755,0.00007076176,0.000046218145],"domain_scores_gemma":[0.9991685,0.00050096586,0.00005486563,0.00010239198,0.00012930113,0.000043920347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009820781,0.000829773,0.0010493996,0.00066123914,0.00034211858,0.0011417179,0.0014268284,0.0016357197,0.0032426233],"category_scores_gemma":[0.0026321583,0.000708836,0.0007573016,0.0006281584,0.0005917673,0.0018826356,0.0019038419,0.0027042842,0.0014452904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023281905,0.000118067706,0.0004972752,0.00015630217,0.00010102363,0.00008717964,0.00008417054,0.4892346,0.019449662,0.05850347,0.006640274,0.42489517],"study_design_scores_gemma":[0.0000022450208,0.000009288516,0.000023402199,0.0000037828675,0.0000042073752,0.0000130703675,0.0000021533933,0.99003464,0.002181579,0.007190835,0.0005315097,0.0000032606779],"about_ca_topic_score_codex":0.0027926525,"about_ca_topic_score_gemma":0.00362646,"teacher_disagreement_score":0.0032426233,"about_ca_system_score_codex":0.00091830647,"about_ca_system_score_gemma":0.0005691859,"threshold_uncertainty_score":0.010847628},"labels":[],"label_agreement":null},{"id":"W4404956745","doi":"10.1007/978-3-031-78119-3_19","title":"Offline Handwritten Signature Verification Using a Stream-Based Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Signature (topology); Artificial intelligence","score_opus":0.02415434632497349,"score_gpt":0.26115626794966335,"score_spread":0.23700192162468986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404956745","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.030741079,0.0006479218,0.9593028,0.00007527915,0.00023784097,0.00022090097,0.00039987126,0.004953131,0.0034211562],"genre_scores_gemma":[0.23335218,0.0011593772,0.7414791,0.00013939293,0.000297426,0.00017828493,0.0018360841,0.00046439233,0.021093793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993362,0.000054761076,0.000051421983,0.00012981398,0.00035471426,0.000072947354],"domain_scores_gemma":[0.9991468,0.00016169366,0.00007299414,0.00017295065,0.00040538714,0.00004011144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042962926,0.00114312,0.001213262,0.0018238567,0.00046637486,0.0013269098,0.00082520244,0.0006866202,0.0062673385],"category_scores_gemma":[0.00087780115,0.00037000777,0.000669711,0.0013367884,0.00025370246,0.001455738,0.000825833,0.0007113547,0.00669522],"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.0008819076,0.00016844427,0.0011103511,0.000120617966,0.000049378545,0.00016805275,0.00003073302,0.0048334757,0.18404935,0.0009923413,0.0028824455,0.8047129],"study_design_scores_gemma":[0.00006860283,0.00066871505,0.0038215066,0.000045597506,0.00015351549,0.0015648426,0.0001066813,0.5805752,0.39466566,0.0027950127,0.015467866,0.000066767854],"about_ca_topic_score_codex":0.00088073674,"about_ca_topic_score_gemma":0.0013946786,"teacher_disagreement_score":0.0062673385,"about_ca_system_score_codex":0.000316573,"about_ca_system_score_gemma":0.0009986545,"threshold_uncertainty_score":0.020966351},"labels":[],"label_agreement":null},{"id":"W4404956754","doi":"10.1007/978-3-031-78119-3_18","title":"Primary Key Free Watermarking for Numerical Tabular Datasets in Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Steganography and Watermarking Techniques","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":"Huawei Technologies (Canada); University of Toronto; McMaster University","funders":"","keywords":"Computer science; Key (lock); Digital watermarking; Artificial intelligence; Machine learning; Data mining; Theoretical computer science; Algorithm; Image (mathematics); Computer security","score_opus":0.012546091527884506,"score_gpt":0.24624700194362165,"score_spread":0.23370091041573715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404956754","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.020098377,0.0022090967,0.967819,0.00058518123,0.0002932759,0.000113533846,0.0009196764,0.0021579063,0.005804059],"genre_scores_gemma":[0.3889969,0.0026733433,0.5891251,0.00031437128,0.0004281553,0.00030454717,0.0034330308,0.000570855,0.014153806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855703,0.00042191872,0.00015574071,0.00024148248,0.0004991784,0.0001247362],"domain_scores_gemma":[0.99437463,0.0020646974,0.00032503414,0.002676144,0.00048319824,0.00007631553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173918,0.0004126842,0.0007263113,0.00085443875,0.00051017234,0.0016329747,0.0009316164,0.0009030883,0.0068552704],"category_scores_gemma":[0.009804973,0.00029816988,0.0006283434,0.0018944343,0.0008747919,0.0044961553,0.0022274326,0.0014613521,0.0029400855],"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.0006925629,0.00013272546,0.00094380387,0.0006765516,0.000066017536,0.00013273103,0.00021075062,0.027498994,0.023663873,0.10504709,0.022767354,0.81816757],"study_design_scores_gemma":[0.00009645952,0.00040095372,0.0018635726,0.00035519616,0.000069331436,0.0009242314,0.00018552851,0.5615023,0.09470368,0.2909428,0.04887782,0.000078050805],"about_ca_topic_score_codex":0.00023138837,"about_ca_topic_score_gemma":0.00036243402,"teacher_disagreement_score":0.0068552704,"about_ca_system_score_codex":0.0006012577,"about_ca_system_score_gemma":0.00074445235,"threshold_uncertainty_score":0.022933185},"labels":[],"label_agreement":null},{"id":"W4404965856","doi":"10.1007/978-3-031-78312-8_6","title":"An Edge-Assisted Mural Image Inpainting Approach Leveraging Aggregated Contextual Transformations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Inpainting; Mural; Computer science; Computer vision; Artificial intelligence; Enhanced Data Rates for GSM Evolution; Image (mathematics); Computer graphics (images); Art history; Art; Painting","score_opus":0.020243813079816837,"score_gpt":0.24279359178788376,"score_spread":0.22254977870806691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404965856","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.006907123,0.00021619677,0.9900525,0.00004537439,0.00006310235,0.000029891331,0.000039615858,0.0004604371,0.002185673],"genre_scores_gemma":[0.27980024,0.00059043884,0.7058051,0.00024463964,0.00019637767,0.00007911459,0.00036200834,0.00035390214,0.012568117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997366,0.000043056723,0.000008150491,0.000060459,0.000117177115,0.00003457475],"domain_scores_gemma":[0.99971324,0.00008883529,0.00002376076,0.000085582345,0.00006253933,0.000026079868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031920604,0.00089166267,0.0008266778,0.00044782466,0.00025005772,0.00067869475,0.0010970132,0.0008016767,0.003940047],"category_scores_gemma":[0.0007702939,0.0003533495,0.0006124647,0.00045005084,0.00043015752,0.0007843056,0.0017249869,0.0013516556,0.0012960334],"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.0004079863,0.00021469608,0.00034687502,0.00022809207,0.00009968226,0.00031582033,0.00014936377,0.22702973,0.20720501,0.018997682,0.005293896,0.53971124],"study_design_scores_gemma":[0.000009448235,0.000076159056,0.00013471112,0.0000076205883,0.000023173941,0.00015260286,0.000014022637,0.97580296,0.01717604,0.0032236814,0.0033691614,0.000010513783],"about_ca_topic_score_codex":0.0005492692,"about_ca_topic_score_gemma":0.0015648163,"teacher_disagreement_score":0.003940047,"about_ca_system_score_codex":0.00017086984,"about_ca_system_score_gemma":0.00025884958,"threshold_uncertainty_score":0.013180792},"labels":[],"label_agreement":null},{"id":"W4404967629","doi":"10.1007/978-3-031-78093-6_15","title":"Integrating Conversational Pathways with a Chatbot Builder Platform","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chatbot; Computer science; Programming language; World Wide Web; Human–computer interaction; Software engineering","score_opus":0.02068188108603989,"score_gpt":0.24362437072312484,"score_spread":0.22294248963708496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404967629","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.021969935,0.00010353785,0.8895348,0.00028794355,0.00025296657,0.00058096094,0.00029824747,0.06307383,0.023897778],"genre_scores_gemma":[0.3384608,0.00022848744,0.5516414,0.00037952565,0.0001178543,0.0012866817,0.0019954587,0.012770094,0.09311976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991124,0.00027630897,0.000056456895,0.00017240652,0.00028152205,0.000100834564],"domain_scores_gemma":[0.99837,0.00075392827,0.000049241193,0.00031257173,0.00019160849,0.00032267137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014188044,0.00086771266,0.00053417095,0.00073741423,0.00094671076,0.0027447517,0.0022669684,0.0013025866,0.023604337],"category_scores_gemma":[0.0036653662,0.0007670749,0.0005631319,0.0003114197,0.00058217574,0.0028595238,0.0045709256,0.0018720423,0.0095828],"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.0019868396,0.0021993895,0.0032032847,0.0009657251,0.0001759295,0.0021381031,0.0091583,0.01438869,0.17250068,0.07724641,0.054970082,0.66106653],"study_design_scores_gemma":[0.000307485,0.00085791654,0.0020859994,0.00036023694,0.00021549515,0.0015079323,0.0024558331,0.3439076,0.13626495,0.061856326,0.44982392,0.00035625332],"about_ca_topic_score_codex":0.0014470917,"about_ca_topic_score_gemma":0.001913088,"teacher_disagreement_score":0.023604337,"about_ca_system_score_codex":0.00041893165,"about_ca_system_score_gemma":0.00097019185,"threshold_uncertainty_score":0.07896435},"labels":[],"label_agreement":null},{"id":"W4404968319","doi":"10.1007/978-3-031-78093-6_5","title":"Mining Historical Multi-behavior Sequential Patterns for e-Commerce Recommendation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Windsor","funders":"","keywords":"Computer science; E-commerce; Recommender system; World Wide Web; Data mining; Information retrieval","score_opus":0.05755073016334569,"score_gpt":0.3100129681990633,"score_spread":0.25246223803571766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404968319","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.6475495,0.008405517,0.30867973,0.0011738953,0.0005386494,0.0004473405,0.020409724,0.0033642226,0.009431371],"genre_scores_gemma":[0.85490525,0.0020169567,0.11507838,0.00016522189,0.00027628615,0.000193229,0.018280255,0.00012535314,0.008959093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.0000484236,0.00006407919,0.0001514688,0.00017687635,0.00005608281],"domain_scores_gemma":[0.99901474,0.0003663813,0.00016331398,0.00012823247,0.0002377968,0.0000895633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035490398,0.0007426918,0.0007215896,0.00541977,0.00052119617,0.00084000686,0.0008662521,0.0007043479,0.002886972],"category_scores_gemma":[0.0021156147,0.00030989913,0.00093079614,0.0059148027,0.00018699585,0.0012991948,0.00038986653,0.0006645287,0.0020552913],"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.0007724976,0.0009878031,0.20048708,0.00062192103,0.00070075126,0.00139314,0.00021762779,0.021202663,0.014375384,0.0037526602,0.023216242,0.73227227],"study_design_scores_gemma":[0.000070002,0.0005524333,0.11848032,0.0001940634,0.00061662984,0.0030677237,0.00049070653,0.8276992,0.009749735,0.018890956,0.020107526,0.000080706704],"about_ca_topic_score_codex":0.006553068,"about_ca_topic_score_gemma":0.015793905,"teacher_disagreement_score":0.006553068,"about_ca_system_score_codex":0.0003744478,"about_ca_system_score_gemma":0.0005370503,"threshold_uncertainty_score":0.013029814},"labels":[],"label_agreement":null},{"id":"W4404968349","doi":"10.1007/978-3-031-78093-6_7","title":"Integrative Mining Pipeline for Improved Reflections of Course Feedback","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Science and Education Research","field":"Neuroscience","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 Guelph","funders":"","keywords":"Course (navigation); Computer science; Pipeline (software); Data science; Operations research; Programming language; Engineering","score_opus":0.07516065100437658,"score_gpt":0.393714964099101,"score_spread":0.31855431309472443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404968349","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.026316958,0.0003465964,0.7254485,0.0020796757,0.0007843118,0.0020960227,0.031876143,0.18375373,0.02729803],"genre_scores_gemma":[0.07624594,0.0002266167,0.8323632,0.0002371195,0.00028761898,0.0015342408,0.045452654,0.00966501,0.033987563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960931,0.0008485624,0.00042737508,0.0009097024,0.0015009646,0.00022030267],"domain_scores_gemma":[0.98066336,0.0068777567,0.000996983,0.00288562,0.0075574704,0.0010188258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052112835,0.0018074302,0.0011747803,0.00787234,0.0013042879,0.0040774564,0.0021378675,0.0009071079,0.0689892],"category_scores_gemma":[0.023839895,0.00077875954,0.0015472037,0.0043623904,0.00036089803,0.0035149823,0.0038942732,0.0015471515,0.0392601],"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.0007623088,0.0003640233,0.005412749,0.00060039794,0.000084022715,0.00024811726,0.0017042093,0.0013185899,0.017075444,0.0043323967,0.14468828,0.82340944],"study_design_scores_gemma":[0.00044360352,0.0010908426,0.025782783,0.00096392573,0.00053513394,0.00076445856,0.0075600254,0.21068382,0.12969947,0.03879062,0.5833309,0.00035440052],"about_ca_topic_score_codex":0.0029865424,"about_ca_topic_score_gemma":0.005070625,"teacher_disagreement_score":0.0689892,"about_ca_system_score_codex":0.0011204482,"about_ca_system_score_gemma":0.0035094833,"threshold_uncertainty_score":0.23079187},"labels":[],"label_agreement":null},{"id":"W4404970287","doi":"10.1007/978-3-031-78495-8_28","title":"Improving Sampling Methods for Fine-Tuning SentenceBERT in Text Streams","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; STREAMS; Sampling (signal processing); Operating system; Computer vision","score_opus":0.03485092582465372,"score_gpt":0.31806034022631485,"score_spread":0.28320941440166114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404970287","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.030366996,0.0013897987,0.960995,0.00022735697,0.00029050573,0.00014518839,0.00035695022,0.0056251027,0.00060298294],"genre_scores_gemma":[0.35891291,0.00077241496,0.6275964,0.0007845166,0.0011360567,0.00049151987,0.0037280072,0.0012942903,0.0052839383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982949,0.00046628746,0.00016884028,0.0005272891,0.00037854566,0.00016412606],"domain_scores_gemma":[0.9888498,0.008711596,0.00032299402,0.00058447017,0.0012249075,0.00030619858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035860226,0.0018719095,0.002646737,0.0018898544,0.0007790334,0.0016031616,0.0026361735,0.002410472,0.003777629],"category_scores_gemma":[0.013380392,0.000944135,0.0011076444,0.0015799497,0.00065488066,0.002688452,0.0018796624,0.002769041,0.0029464862],"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.0012443037,0.0005600547,0.003485949,0.0002962052,0.00021445873,0.000161696,0.00022674569,0.11804448,0.02895518,0.0023246363,0.011098626,0.8333876],"study_design_scores_gemma":[0.000040782747,0.000058314054,0.0003326143,0.000007952072,0.000023487557,0.0000311005,0.000020228239,0.9945891,0.002685988,0.0017785571,0.00042250156,0.000009375426],"about_ca_topic_score_codex":0.0069270628,"about_ca_topic_score_gemma":0.011133483,"teacher_disagreement_score":0.0069270628,"about_ca_system_score_codex":0.0008962678,"about_ca_system_score_gemma":0.0012028734,"threshold_uncertainty_score":0.018964946},"labels":[],"label_agreement":null},{"id":"W4404971593","doi":"10.1007/978-3-031-78498-9_3","title":"ConCSE: Unified Contrastive Learning and Augmentation for Code-Switched Embeddings","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Code (set theory); Programming language; Artificial intelligence; Natural language processing","score_opus":0.020165552351568583,"score_gpt":0.2800862608764734,"score_spread":0.25992070852490484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404971593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075563584,0.00050570664,0.97829974,0.00020887076,0.00026518505,0.000109504595,0.0004888813,0.008750153,0.003815629],"genre_scores_gemma":[0.1828413,0.0005514224,0.79033065,0.00055556,0.0002935835,0.00046200468,0.004350928,0.002529961,0.01808466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878186,0.0002979304,0.0000524233,0.00042253,0.00032271398,0.00012260645],"domain_scores_gemma":[0.9981698,0.00070104166,0.00006666615,0.0006188376,0.0003444879,0.000099250086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014457963,0.0020379557,0.0015503361,0.001243769,0.0007856042,0.001996115,0.0034911812,0.0021622716,0.011411284],"category_scores_gemma":[0.005938935,0.00076795917,0.0014733487,0.0013121507,0.0012793976,0.0049240314,0.0051819123,0.0042237407,0.005734984],"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.0005054309,0.0003120588,0.000624015,0.0003243914,0.000102285565,0.00013851805,0.00015066596,0.06135852,0.016370302,0.051807743,0.034023024,0.834283],"study_design_scores_gemma":[0.000045395773,0.00012261653,0.00015907075,0.000038273476,0.000025034376,0.00009003592,0.00004124913,0.9233314,0.010396709,0.055571757,0.010149861,0.0000285372],"about_ca_topic_score_codex":0.0033448203,"about_ca_topic_score_gemma":0.00814426,"teacher_disagreement_score":0.011411284,"about_ca_system_score_codex":0.00088553195,"about_ca_system_score_gemma":0.0016187417,"threshold_uncertainty_score":0.03817451},"labels":[],"label_agreement":null},{"id":"W4404984766","doi":"10.1007/978-3-031-78119-3_8","title":"MuLAD: Multimodal Aggression Detection from Social Media Memes Exploiting Visual and Textual Features","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","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":"Athabasca University","funders":"","keywords":"Computer science; Social media; Artificial intelligence; Aggression; Natural language processing; Information retrieval; World Wide Web; Psychology","score_opus":0.012080476133708684,"score_gpt":0.24719598628816164,"score_spread":0.23511551015445295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404984766","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.2237388,0.0058665364,0.4914299,0.0008218931,0.002363478,0.00210428,0.060208254,0.18480845,0.028658397],"genre_scores_gemma":[0.4136287,0.0012600229,0.47942284,0.0006842079,0.0006381778,0.0021250611,0.048830096,0.0019224912,0.05148837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995591,0.00006987922,0.000019341367,0.00012071225,0.00016500228,0.00006597224],"domain_scores_gemma":[0.9995652,0.0001605437,0.000037672904,0.000071335475,0.00010759006,0.000057700294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005064865,0.0016698836,0.0013038714,0.0026847343,0.0005509145,0.0011392497,0.0011227609,0.0009725356,0.009191201],"category_scores_gemma":[0.0010571233,0.00036111363,0.00074406655,0.0009355369,0.0002366964,0.0010469162,0.0021270378,0.00052380917,0.007869746],"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.0011963551,0.00058258395,0.007402346,0.00064785744,0.00030308744,0.00047376924,0.0002681091,0.0026899336,0.0711859,0.0009793893,0.10500647,0.8092641],"study_design_scores_gemma":[0.0003056044,0.0016010548,0.05532478,0.00025054422,0.00048969197,0.0029856625,0.0013904814,0.69446915,0.13847242,0.008345809,0.095994584,0.00037030454],"about_ca_topic_score_codex":0.0026080627,"about_ca_topic_score_gemma":0.0059134536,"teacher_disagreement_score":0.009191201,"about_ca_system_score_codex":0.0002991026,"about_ca_system_score_gemma":0.00031149603,"threshold_uncertainty_score":0.030747652},"labels":[],"label_agreement":null},{"id":"W4405002901","doi":"10.1007/978-3-031-72630-9_26","title":"Handling the Non-smooth Challenge in Tensor SVD: A Multi-objective Tensor Recovery Framework","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","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; University of British Columbia","funders":"","keywords":"Computer science; Tensor (intrinsic definition); Tensor decomposition; Singular value decomposition; Lanczos tensor; Algorithm; Algebra over a field; Tensor field; Tensor density; Mathematics; Exact solutions in general relativity; Pure mathematics; Mathematical analysis","score_opus":0.03840319060337078,"score_gpt":0.31044943515594087,"score_spread":0.2720462445525701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405002901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009888872,0.00018711969,0.9980994,0.00011159583,0.000030592222,0.000011385217,0.00003144138,0.00012788926,0.00041178288],"genre_scores_gemma":[0.047364786,0.0010337983,0.94475937,0.00016217823,0.00020973335,0.00008507363,0.00030729885,0.00045195213,0.0056258505],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991124,0.00031602214,0.00004909581,0.00015404141,0.0002936971,0.00007472628],"domain_scores_gemma":[0.99832195,0.0007975001,0.00016173792,0.00027017403,0.00034507315,0.0001035323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023939405,0.0017910497,0.0016347108,0.0007183624,0.0005827014,0.00193366,0.001931744,0.0019877562,0.0033493503],"category_scores_gemma":[0.0047560143,0.0007201473,0.0010872813,0.0013377985,0.0012264461,0.0028978002,0.0027489224,0.004081682,0.0017697278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021797628,0.00019434268,0.00047461365,0.00068709947,0.00020456187,0.00023654061,0.00021448905,0.38723764,0.029386887,0.1474083,0.020629223,0.41310826],"study_design_scores_gemma":[0.0000064547653,0.000041082254,0.00006261351,0.000016821448,0.000015881364,0.00006195998,0.00001564226,0.9623561,0.0022534458,0.032621402,0.0025333457,0.000015318543],"about_ca_topic_score_codex":0.0024680381,"about_ca_topic_score_gemma":0.0036758904,"teacher_disagreement_score":0.0033493503,"about_ca_system_score_codex":0.0004252483,"about_ca_system_score_gemma":0.0012299822,"threshold_uncertainty_score":0.012660563},"labels":[],"label_agreement":null},{"id":"W4405013581","doi":"10.1007/978-3-031-78122-3_7","title":"CAB-KWS : Contrastive Augmentation: An Unsupervised Learning Approach for Keyword Spotting in Speech Technology","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Keyword spotting; Computer science; Spotting; Speech recognition; Artificial intelligence; Natural language processing","score_opus":0.024741399971856606,"score_gpt":0.26446691578312764,"score_spread":0.23972551581127105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405013581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057129483,0.00032348017,0.97769576,0.00007722225,0.00013001023,0.00008368242,0.0005737674,0.012278755,0.0031243856],"genre_scores_gemma":[0.07313259,0.00038959007,0.90891653,0.00014499974,0.00013230332,0.00021121836,0.0025986065,0.0018044158,0.012669755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932647,0.00013657048,0.00003122764,0.0002106952,0.00023842562,0.00005673592],"domain_scores_gemma":[0.99914145,0.00036081637,0.000041995932,0.00019939907,0.0002097249,0.00004650428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007810277,0.0011765374,0.0009679138,0.0010321017,0.0005148803,0.0010112879,0.0021698517,0.0011118869,0.010324171],"category_scores_gemma":[0.0017572432,0.0005955748,0.00080118905,0.0013098808,0.0006856188,0.0017937827,0.0016449232,0.0018224629,0.006563363],"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.00040107412,0.00017644234,0.00028595806,0.00024585763,0.000055442742,0.00009915374,0.00008627765,0.015650617,0.08031749,0.005422348,0.016206501,0.88105285],"study_design_scores_gemma":[0.000045511988,0.00015635254,0.0008889582,0.000029375165,0.000045483917,0.00029247376,0.000052037773,0.86197746,0.09926052,0.010936319,0.026267033,0.00004846736],"about_ca_topic_score_codex":0.0030104208,"about_ca_topic_score_gemma":0.0065952833,"teacher_disagreement_score":0.010324171,"about_ca_system_score_codex":0.00041409303,"about_ca_system_score_gemma":0.00085238717,"threshold_uncertainty_score":0.03453785},"labels":[],"label_agreement":null},{"id":"W4405014026","doi":"10.1007/978-3-031-78122-3_24","title":"Multifaceted Anchor Nodes Attack on Graph Neural Networks: A Budget-Efficient Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"McMaster University","funders":"","keywords":"Computer science; Artificial neural network; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.02507208501773168,"score_gpt":0.26559911818943643,"score_spread":0.24052703317170476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405014026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019992989,0.0008083671,0.9713543,0.0012555053,0.00015601043,0.0001634347,0.00023956403,0.00066144235,0.00536835],"genre_scores_gemma":[0.6554143,0.0013362768,0.32340062,0.0005462584,0.0004397069,0.00055454334,0.00083893887,0.0006017554,0.016867641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977859,0.00094049156,0.00007939413,0.0003390558,0.00051996415,0.00033524728],"domain_scores_gemma":[0.9921903,0.0055917944,0.00039023708,0.00095708674,0.000584472,0.00028620442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035813048,0.0020105813,0.0032307457,0.001772594,0.00094451284,0.0019551525,0.0041493657,0.0032060426,0.0075490735],"category_scores_gemma":[0.017415406,0.00094941293,0.0010987865,0.002245562,0.001883478,0.0064594736,0.004464434,0.004202098,0.0010364985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041192994,0.00017554067,0.00041704843,0.00019863801,0.00009916412,0.00009672721,0.00008261864,0.7846579,0.0016564922,0.10699841,0.012674537,0.09253092],"study_design_scores_gemma":[0.000010583916,0.000012662976,0.000031427426,0.000007647973,0.000009484656,0.000009406449,0.000007487998,0.96801466,0.00013203484,0.031498544,0.0002621135,0.000003839186],"about_ca_topic_score_codex":0.0037533983,"about_ca_topic_score_gemma":0.004849672,"teacher_disagreement_score":0.0075490735,"about_ca_system_score_codex":0.0023249038,"about_ca_system_score_gemma":0.0020345293,"threshold_uncertainty_score":0.02525419},"labels":[],"label_agreement":null},{"id":"W4405093949","doi":"10.1007/978-981-96-0808-9_28","title":"How Do Infrastructure-as-Code Practitioners Update their Provider Dependencies? An Empirical Study on the AWS Provider","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Code (set theory); Empirical research; Computer security; Programming language","score_opus":0.022607986073992826,"score_gpt":0.28461910097199666,"score_spread":0.2620111148980038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405093949","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.9961527,0.000056987676,0.00046435598,0.0005499858,0.000005895502,0.000019963103,0.00003745428,0.0000141405235,0.0026983637],"genre_scores_gemma":[0.997678,0.000094925555,0.00044903252,0.00014409398,0.0000058321675,0.000014482821,0.000055034292,0.0000189517,0.0015397033],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9945182,0.0027445112,0.00027251808,0.00051525317,0.001353944,0.0005956044],"domain_scores_gemma":[0.79807115,0.13707379,0.033748865,0.0065727774,0.015509747,0.009023618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009921662,0.00015755251,0.00021724717,0.0013241073,0.0016662007,0.002359718,0.0010486022,0.0013695753,0.0038338127],"category_scores_gemma":[0.10111151,0.0004491223,0.00013491235,0.0016005978,0.001677843,0.0055765132,0.0017231625,0.002690524,0.0007020266],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004254148,0.0020412267,0.8183341,0.00011674299,0.000032961703,0.00066097855,0.102369465,0.0006712757,0.0018821688,0.0051191864,0.0044861576,0.06386017],"study_design_scores_gemma":[0.00008780691,0.0012090838,0.70807964,0.00026493237,0.00008647618,0.0006226003,0.26088998,0.006954975,0.0014763528,0.0029964866,0.017252283,0.000079356665],"about_ca_topic_score_codex":0.018765021,"about_ca_topic_score_gemma":0.027826592,"teacher_disagreement_score":0.018765021,"about_ca_system_score_codex":0.0023037263,"about_ca_system_score_gemma":0.004129669,"threshold_uncertainty_score":0.05247134},"labels":[],"label_agreement":null},{"id":"W4405104912","doi":"10.1007/978-3-031-72890-7_9","title":"SAFT: Towards Out-of-Distribution Generalization in Fine-Tuning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Université de Montréal; Cisco Systems (Canada)","funders":"","keywords":"Computer science; Generalization; Distribution (mathematics); Algorithm; Artificial intelligence; Mathematics; Mathematical analysis","score_opus":0.029700347791026236,"score_gpt":0.29175987757137384,"score_spread":0.2620595297803476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405104912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033685104,0.00020674014,0.99328965,0.00012730976,0.00006526395,0.00001756011,0.000039548813,0.0010572876,0.0018281485],"genre_scores_gemma":[0.31902623,0.0007053774,0.6568051,0.0011483381,0.0004022313,0.0002600437,0.00048423064,0.0025733442,0.018595124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875677,0.00046736444,0.000058269234,0.00028392024,0.00033917668,0.00009452079],"domain_scores_gemma":[0.99662054,0.0020558971,0.00015524979,0.0007881424,0.00025287233,0.00012736724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033285632,0.0012726069,0.0018133759,0.0007257229,0.00060336944,0.0011987266,0.0021332074,0.002339931,0.0062050633],"category_scores_gemma":[0.010006869,0.000788595,0.0014019262,0.0007237045,0.0017130426,0.002326631,0.0037933595,0.0033457505,0.0016024772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031342413,0.0002014274,0.0010810504,0.0003407707,0.00024430375,0.00022776682,0.00025689355,0.44264033,0.015677948,0.20774475,0.014119232,0.31715214],"study_design_scores_gemma":[0.000014167097,0.000035070327,0.00010208417,0.000013995037,0.000012521727,0.0000452387,0.000008515735,0.90328574,0.001306083,0.09282057,0.0023458197,0.000010243685],"about_ca_topic_score_codex":0.0017342154,"about_ca_topic_score_gemma":0.002574584,"teacher_disagreement_score":0.0062050633,"about_ca_system_score_codex":0.0006505111,"about_ca_system_score_gemma":0.0008654209,"threshold_uncertainty_score":0.020757973},"labels":[],"label_agreement":null},{"id":"W4405138838","doi":"10.1007/978-3-031-78761-4_4","title":"HyperBrain: Anomaly Detection for Temporal Hypergraph Brain Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Vector Institute; University of British Columbia","funders":"","keywords":"Computer science; Anomaly detection; Hypergraph; Anomaly (physics); Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.025665238600651303,"score_gpt":0.2478800667710824,"score_spread":0.2222148281704311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405138838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008419336,0.000386278,0.9584195,0.00027744763,0.00011331161,0.000081425285,0.0013686877,0.030182153,0.0007517971],"genre_scores_gemma":[0.11145715,0.0005320341,0.87358177,0.00014146509,0.00018352745,0.0003124522,0.0047550146,0.0036292009,0.0054074395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946433,0.00010445067,0.000029034072,0.00015301682,0.00020453901,0.00004460537],"domain_scores_gemma":[0.9988869,0.0006486309,0.000079292164,0.00017109982,0.00015043937,0.000063741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209467,0.001437678,0.0010084237,0.002302637,0.00041537613,0.0016643553,0.0022589164,0.0013266747,0.008383818],"category_scores_gemma":[0.0047002346,0.0007907825,0.001088243,0.0014635532,0.00046161245,0.0018382425,0.0020079853,0.0016804249,0.0027499893],"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.00052274694,0.00013633653,0.0037110564,0.00033085904,0.0003358444,0.0003891502,0.0001565287,0.06393378,0.016415372,0.013599697,0.06483324,0.8356355],"study_design_scores_gemma":[0.000039615283,0.000053079093,0.0011062861,0.000025300567,0.000038685415,0.00040264043,0.000031769905,0.9584711,0.007912392,0.024191488,0.007700546,0.0000271341],"about_ca_topic_score_codex":0.0027568226,"about_ca_topic_score_gemma":0.0051166676,"teacher_disagreement_score":0.008383818,"about_ca_system_score_codex":0.0005247114,"about_ca_system_score_gemma":0.0007111263,"threshold_uncertainty_score":0.028046668},"labels":[],"label_agreement":null},{"id":"W4405138843","doi":"10.1007/978-3-031-78761-4_6","title":"A Lightweight 3D Conditional Diffusion Model for Self-explainable Brain Age Prediction in Adults and Children","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Computer science; Diffusion; Artificial intelligence","score_opus":0.008093123642214114,"score_gpt":0.2421212081632218,"score_spread":0.23402808452100768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405138843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034767058,0.00056818774,0.9606367,0.00033141533,0.00008937105,0.00003798505,0.0008921679,0.0015326937,0.0011443989],"genre_scores_gemma":[0.71349144,0.0011293843,0.27110142,0.0003310566,0.00016898075,0.00034014136,0.002773508,0.0004951766,0.010168778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998878,0.000024024803,0.000006442484,0.000041177605,0.000021505382,0.000019047588],"domain_scores_gemma":[0.999398,0.00036587368,0.00004821397,0.000059192487,0.00008449968,0.00004422059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064492755,0.000519757,0.0008456583,0.00057411054,0.00036525715,0.0006699089,0.0016979317,0.0015054833,0.0030186023],"category_scores_gemma":[0.0019999307,0.0006420779,0.0010987201,0.0006301227,0.00033418494,0.0008348472,0.00092700555,0.001357565,0.0011928475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018815558,0.000085652384,0.0028649385,0.000083628365,0.00011838497,0.00014498219,0.000106153406,0.85880613,0.0042145895,0.015539508,0.0043858057,0.11346206],"study_design_scores_gemma":[0.0000024379085,0.0000039794445,0.00016880636,0.0000027651745,0.0000045476945,0.000012023715,0.0000016849224,0.9976623,0.00011906111,0.0018307418,0.00018729316,0.000004403991],"about_ca_topic_score_codex":0.028753968,"about_ca_topic_score_gemma":0.023716893,"teacher_disagreement_score":0.028753968,"about_ca_system_score_codex":0.00064567605,"about_ca_system_score_gemma":0.0009341678,"threshold_uncertainty_score":0.057173193},"labels":[],"label_agreement":null},{"id":"W4405140008","doi":"10.1007/978-981-96-0917-8_17","title":"Vision Language Models are blind","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":28,"is_retracted":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":"Computer science; Artificial intelligence; Natural language processing; Computer vision; Speech recognition","score_opus":0.017041941641969042,"score_gpt":0.2930850625544102,"score_spread":0.27604312091244115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405140008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012343852,0.009024541,0.8123169,0.014235164,0.0021716792,0.000034125576,0.0010108853,0.0060891407,0.14277376],"genre_scores_gemma":[0.5426603,0.011753228,0.14112149,0.0069263247,0.0023309328,0.00011902958,0.0025645364,0.0028116496,0.28971252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915147,0.00019176524,0.000038404803,0.00025366782,0.00027382973,0.00009089545],"domain_scores_gemma":[0.99764097,0.0011775715,0.00013221383,0.0005835134,0.0003866042,0.00007913913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010535341,0.00089283165,0.0009846973,0.0006185666,0.0006196969,0.003626584,0.001090565,0.0021545957,0.011768618],"category_scores_gemma":[0.007967066,0.00090472214,0.0007072523,0.0006039462,0.0022127167,0.007022109,0.0017877708,0.0041784407,0.0088717695],"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.00018816575,0.00006083706,0.0004346289,0.00030642375,0.000091968686,0.00018973011,0.00030036876,0.019500002,0.0073454683,0.554504,0.1023503,0.31472814],"study_design_scores_gemma":[0.0000148881845,0.000020324442,0.000237909,0.00005420249,0.000029058661,0.00026073083,0.00007634924,0.07755405,0.005437205,0.8718761,0.0444014,0.000037651396],"about_ca_topic_score_codex":0.003286597,"about_ca_topic_score_gemma":0.0019255274,"teacher_disagreement_score":0.011768618,"about_ca_system_score_codex":0.0008019052,"about_ca_system_score_gemma":0.0009963608,"threshold_uncertainty_score":0.03936994},"labels":[],"label_agreement":null},{"id":"W4405141630","doi":"10.1007/978-3-031-78761-4_1","title":"Parkinson’s Disease Detection from Resting State EEG Using Multi-head Graph Structure Learning with Gradient Weighted Graph Attention Explanations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Concordia University","funders":"","keywords":"Computer science; Graph; Electroencephalography; Artificial intelligence; Graph theory; Parkinson's disease; Pattern recognition (psychology); Theoretical computer science; Disease; Mathematics; Neuroscience; Psychology; Combinatorics; Medicine","score_opus":0.02892215055685613,"score_gpt":0.26359165151365765,"score_spread":0.23466950095680153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405141630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023495832,0.0011749499,0.9695266,0.00043338715,0.00018307188,0.000044390013,0.00029082698,0.0017068149,0.0031441578],"genre_scores_gemma":[0.5237704,0.001479944,0.4606949,0.00030467528,0.00021646639,0.00008039179,0.0010882772,0.00033632843,0.012028602],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9999275,0.000013723789,0.0000033750443,0.000030096307,0.000015789841,0.000009608501],"domain_scores_gemma":[0.9998679,0.00005714149,0.000008864636,0.000016064356,0.00004089385,0.000009193639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017734087,0.0004620804,0.0003432514,0.00050088606,0.00015755686,0.00035835107,0.00062805694,0.00057223643,0.0025339709],"category_scores_gemma":[0.0007221479,0.0001972183,0.0005810424,0.0004922283,0.00016999734,0.00051435933,0.0003833601,0.00057870283,0.000664637],"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.00016070603,0.0000984571,0.000980386,0.00012025562,0.00012180448,0.00016885849,0.000055489385,0.09482898,0.030472532,0.008281816,0.013554945,0.85115594],"study_design_scores_gemma":[0.000007756798,0.00004577251,0.001428866,0.000008951123,0.00002900994,0.00009092278,0.0000125144625,0.97767025,0.007289322,0.011504766,0.0018993142,0.000012645458],"about_ca_topic_score_codex":0.0050141932,"about_ca_topic_score_gemma":0.007327744,"teacher_disagreement_score":0.0050141932,"about_ca_system_score_codex":0.00025547878,"about_ca_system_score_gemma":0.00024963898,"threshold_uncertainty_score":0.009970009},"labels":[],"label_agreement":null},{"id":"W4405197471","doi":"10.1007/978-981-96-0972-7_11","title":"Foundation Model-Powered 3D Few-Shot Class Incremental Learning via Training-Free Adaptor","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"York University","funders":"","keywords":"Computer science; Class (philosophy); Shot (pellet); Foundation (evidence); Artificial intelligence","score_opus":0.04243619727541545,"score_gpt":0.26480451142870404,"score_spread":0.2223683141532886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405197471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005212858,0.00027126813,0.9853527,0.00007688811,0.00008733161,0.00007185518,0.00023082572,0.0057109715,0.0029853657],"genre_scores_gemma":[0.3055571,0.00048100154,0.6736122,0.0005117064,0.00015520309,0.0003628056,0.0029496853,0.0016405657,0.014729729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999366,0.000054831275,0.000022610913,0.00024054288,0.00022330415,0.00009271022],"domain_scores_gemma":[0.9990827,0.00022636875,0.000035677578,0.00042088988,0.00016303174,0.000071274255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058914087,0.0012536609,0.0018553936,0.0007815057,0.00052305474,0.0012944882,0.005577354,0.0018343515,0.015024878],"category_scores_gemma":[0.0019176871,0.00085250934,0.0012869586,0.0009916291,0.00087408826,0.0022533198,0.0042272015,0.0024284164,0.0063689006],"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.00031446546,0.00018338655,0.00056100014,0.00024485038,0.00011122521,0.00012247675,0.000096974436,0.11554789,0.020846905,0.015622439,0.018560436,0.827788],"study_design_scores_gemma":[0.000012590278,0.000043219876,0.00014162564,0.000013693545,0.000017221084,0.00008665398,0.000012157474,0.98232025,0.005544876,0.008954675,0.002839985,0.000013107084],"about_ca_topic_score_codex":0.005764249,"about_ca_topic_score_gemma":0.010127486,"teacher_disagreement_score":0.015024878,"about_ca_system_score_codex":0.0006588572,"about_ca_system_score_gemma":0.0012729834,"threshold_uncertainty_score":0.050263226},"labels":[],"label_agreement":null},{"id":"W4405208872","doi":"10.1007/978-3-031-76824-8_15","title":"Piloting Continuous Neurophysiological Monitoring for Adapted Training of Public Safety Officers","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Public Safety Canada; Université Laval; Thales (Canada)","funders":"","keywords":"Neurophysiology; Computer science; Training (meteorology); Safety monitoring; Human–computer interaction; Artificial intelligence; Psychology; Neuroscience; Bioinformatics","score_opus":0.08872955635216305,"score_gpt":0.34507413908452156,"score_spread":0.2563445827323585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405208872","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.919062,0.0017619745,0.06745922,0.00032437724,0.00018624665,0.0002271028,0.00024626468,0.0006108954,0.01012185],"genre_scores_gemma":[0.9791749,0.00059328444,0.016393391,0.0000637273,0.000042478012,0.000068865695,0.00011590201,0.000040171915,0.003507287],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99993134,0.000013167427,0.000003187119,0.000015396074,0.000023128163,0.00001376202],"domain_scores_gemma":[0.99983203,0.0000797998,0.000014775042,0.000017117116,0.000033292352,0.000023037068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024342586,0.00029547611,0.00015232165,0.00019939234,0.00011321073,0.00020349816,0.0002951014,0.00028117627,0.0027517094],"category_scores_gemma":[0.0008340489,0.0000956837,0.00009000017,0.00015916304,0.00012297499,0.0001656684,0.0002525402,0.00028228157,0.00049798045],"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.0012196138,0.00040851033,0.00725322,0.00018440899,0.000015603217,0.00032041428,0.00052758964,0.0017428476,0.2033127,0.00014274736,0.0024491434,0.7824232],"study_design_scores_gemma":[0.00040924983,0.014774115,0.69889325,0.0006459462,0.00021727738,0.0046487106,0.0014268131,0.059391867,0.17907104,0.0025711283,0.037837252,0.0001134039],"about_ca_topic_score_codex":0.0014865092,"about_ca_topic_score_gemma":0.0030375202,"teacher_disagreement_score":0.0027517094,"about_ca_system_score_codex":0.00009674983,"about_ca_system_score_gemma":0.00032209884,"threshold_uncertainty_score":0.009205401},"labels":[],"label_agreement":null},{"id":"W4405209064","doi":"10.1007/978-3-031-76824-8_20","title":"Field Trials of an AI-AR-Based System for Remote Bridge Inspection by Drone","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Maintenance and Monitoring","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":"Université du Québec en Outaouais; National Research Council Canada","funders":"","keywords":"Drone; Computer science; Bridge (graph theory); Field (mathematics); Computer graphics (images); Artificial intelligence; Computer vision; Mathematics","score_opus":0.01608069511207337,"score_gpt":0.2625043256074863,"score_spread":0.24642363049541294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405209064","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.97685516,0.00009320042,0.018655445,0.00008453935,0.0000749458,0.0003318019,0.00028376514,0.00094970636,0.00267136],"genre_scores_gemma":[0.98911625,0.000046642395,0.0068049226,0.000040298164,0.000009210361,0.00009709816,0.0002956669,0.000033791846,0.003556177],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99966204,0.000089744055,0.000018481005,0.00007553576,0.00009251058,0.00006170401],"domain_scores_gemma":[0.9988426,0.00036426543,0.00004154137,0.000115281044,0.00045131188,0.00018493342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087843573,0.00050097844,0.0004895899,0.0004832625,0.0005490737,0.0003478004,0.0009852556,0.0009778906,0.0036896716],"category_scores_gemma":[0.0011835609,0.00021288086,0.00023365635,0.00023452145,0.00042975688,0.0006195554,0.00044885994,0.00058643636,0.00086278486],"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.010583899,0.0045196055,0.01180301,0.00082795485,0.0002060977,0.0010087999,0.0022119586,0.047375415,0.74007916,0.0008000655,0.006317738,0.17426628],"study_design_scores_gemma":[0.0033310328,0.084755935,0.115508795,0.00012264644,0.00035778253,0.0010180288,0.0031382295,0.42814004,0.3465063,0.0009488886,0.015929772,0.000242512],"about_ca_topic_score_codex":0.0043435427,"about_ca_topic_score_gemma":0.0051839505,"teacher_disagreement_score":0.0043435427,"about_ca_system_score_codex":0.0003008612,"about_ca_system_score_gemma":0.00040455803,"threshold_uncertainty_score":0.012343168},"labels":[],"label_agreement":null},{"id":"W4405209164","doi":"10.1007/978-3-031-78189-6_14","title":"Alleviating Catastrophic Forgetting in Facial Expression Recognition with Emotion-Centered Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Forgetting; Facial expression; Facial expression recognition; Artificial intelligence; Speech recognition; Expression (computer science); Facial recognition system; Emotion recognition; Pattern recognition (psychology); Cognitive psychology; Psychology; Programming language","score_opus":0.03571808751926522,"score_gpt":0.24465650354762858,"score_spread":0.20893841602836336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405209164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05184837,0.0010741857,0.94321024,0.00019176104,0.00020642369,0.000051968134,0.0001483988,0.0023038213,0.0009648316],"genre_scores_gemma":[0.7512845,0.0011858138,0.2381349,0.0005755278,0.00018252998,0.00013432706,0.0010133212,0.00043410706,0.007054938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.00011049954,0.000037632846,0.00017152591,0.00017843972,0.00010214325],"domain_scores_gemma":[0.9981674,0.0010175981,0.00010924524,0.00032533924,0.00030874147,0.000071639995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011543428,0.0012401774,0.001579491,0.00036500426,0.0003334542,0.00070029654,0.0016541714,0.0010131598,0.0022660897],"category_scores_gemma":[0.003810307,0.00054007745,0.0008643772,0.0004626768,0.0004153811,0.0014982817,0.0014846991,0.002218524,0.0010820837],"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.000654781,0.00033883302,0.0016532793,0.00019956879,0.00020751794,0.00031612362,0.00015044502,0.11136519,0.058296,0.0021799325,0.008045918,0.8165924],"study_design_scores_gemma":[0.000009855628,0.00010773544,0.00072979217,0.000009714423,0.0000496287,0.00016112273,0.000024771283,0.97986174,0.01600292,0.0023748986,0.0006536271,0.000014202679],"about_ca_topic_score_codex":0.0036493526,"about_ca_topic_score_gemma":0.006033637,"teacher_disagreement_score":0.0036493526,"about_ca_system_score_codex":0.00043369827,"about_ca_system_score_gemma":0.000708938,"threshold_uncertainty_score":0.0075808167},"labels":[],"label_agreement":null},{"id":"W4405252251","doi":"10.1007/978-3-031-80311-6_8","title":"Isogeny Interpolation and the Computation of Isogenies from Higher Dimensional Representations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computation; Computer science; Interpolation (computer graphics); Algebra over a field; Mathematics; Algorithm; Artificial intelligence; Pure mathematics; Elliptic curve","score_opus":0.015308444134003426,"score_gpt":0.26135148503467587,"score_spread":0.24604304090067244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405252251","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04802218,0.0020745501,0.92305046,0.00037071647,0.00041203387,0.000058711317,0.0002499896,0.0011401046,0.024621237],"genre_scores_gemma":[0.3788011,0.00270922,0.5911852,0.00025261028,0.00047224702,0.00012734343,0.0010138504,0.0013764126,0.024062127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993111,0.00018120775,0.00003948951,0.00010777648,0.00029373058,0.000066756125],"domain_scores_gemma":[0.99881303,0.0005003606,0.00007373717,0.00038951606,0.00017646689,0.000046946734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011535112,0.0007011099,0.001235432,0.0027619451,0.0007801731,0.0025959662,0.0012294832,0.00081815384,0.009281648],"category_scores_gemma":[0.0059243483,0.000410185,0.0009952281,0.003144169,0.0020715138,0.0039205714,0.0029575357,0.002423648,0.0026266912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017182449,0.000042297856,0.00045506496,0.00019341808,0.000028482655,0.00014003819,0.00027330365,0.014142113,0.0036452182,0.72030866,0.005477504,0.255122],"study_design_scores_gemma":[0.000021347783,0.00005596068,0.00034964085,0.000045563615,0.000013536647,0.00018228403,0.00010201568,0.07334931,0.0042936956,0.90271324,0.01884676,0.00002658919],"about_ca_topic_score_codex":0.0005720082,"about_ca_topic_score_gemma":0.00074392435,"teacher_disagreement_score":0.009281648,"about_ca_system_score_codex":0.0006331297,"about_ca_system_score_gemma":0.00040314166,"threshold_uncertainty_score":0.031050146},"labels":[],"label_agreement":null},{"id":"W4405269950","doi":"10.1007/978-981-96-0891-1_11","title":"SQIsign2D–West","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Capital Commission","funders":"Agence Nationale de la Recherche","keywords":"Computer science","score_opus":0.014104254749029582,"score_gpt":0.23489427583538686,"score_spread":0.22079002108635729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405269950","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.0022963316,0.003438814,0.12164214,0.0021332877,0.0029891883,0.0001132699,0.005227847,0.020085549,0.8420735],"genre_scores_gemma":[0.011436197,0.002020502,0.035256352,0.0008158126,0.00041758968,0.00010300369,0.0049888985,0.009209676,0.9357519],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996189,0.000035921326,0.000015555486,0.00009520188,0.00018638505,0.000047959944],"domain_scores_gemma":[0.999666,0.000049358656,0.000013011338,0.000098286546,0.00010835003,0.00006502722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533163,0.0010724636,0.0005942457,0.0013993072,0.0006635566,0.0023555413,0.0011628573,0.0008728015,0.22588144],"category_scores_gemma":[0.0010578496,0.00050466607,0.00048768902,0.0013711054,0.0005944383,0.0022676338,0.001844078,0.0019109416,0.15884049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011904968,0.00003148798,0.00012761672,0.0002109726,0.000008241286,0.00006441656,0.00005513173,0.000983573,0.0031124311,0.07035686,0.51557744,0.40935284],"study_design_scores_gemma":[0.000010950033,0.000018531891,0.00010325225,0.000042030446,0.000003428925,0.00011782852,0.00000849895,0.001168214,0.0022088708,0.014715818,0.9815918,0.00001075945],"about_ca_topic_score_codex":0.0011704006,"about_ca_topic_score_gemma":0.0018757847,"teacher_disagreement_score":0.22588144,"about_ca_system_score_codex":0.00078259484,"about_ca_system_score_gemma":0.00079780834,"threshold_uncertainty_score":0.75564873},"labels":[],"label_agreement":null},{"id":"W4405333584","doi":"10.1007/978-981-96-1242-0_18","title":"Correlation Between Macro Economic Variables and Financial Sector Australian Share Market Index","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Nexen (Canada)","funders":"","keywords":"Index (typography); Macro; Computer science; Financial sector; Correlation; Financial market; Finance; Economics; Mathematics; World Wide Web","score_opus":0.023364464163675446,"score_gpt":0.21456378779764698,"score_spread":0.19119932363397155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405333584","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.98351353,0.00032740034,0.00057393406,0.00052134536,0.00003405232,0.00001241213,0.002626429,0.000052129093,0.01233881],"genre_scores_gemma":[0.98938227,0.00018593954,0.00011949475,0.00003384325,0.000023049575,0.000008714832,0.001064138,0.00000763978,0.009174974],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997087,0.000072247254,0.000025503277,0.00005595916,0.00009673755,0.00004080499],"domain_scores_gemma":[0.9965887,0.0013625226,0.0009077006,0.00023390936,0.00063891336,0.00026826258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045294213,0.00013415919,0.00020760421,0.0009851548,0.00021261835,0.00068231754,0.00026296792,0.00028126608,0.00954536],"category_scores_gemma":[0.003968242,0.00018139163,0.00027284282,0.0019202104,0.00021952849,0.00043959692,0.0004394354,0.00055311463,0.0021203363],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059790007,0.000047444886,0.9882464,0.000013341183,0.00006713274,0.00010355467,0.00014151788,0.00073452614,0.00042761565,0.0007263991,0.002239605,0.007192703],"study_design_scores_gemma":[7.763017e-7,0.000020655205,0.9974808,0.0000041660583,0.000016267499,0.000033909648,0.0000688824,0.0012403842,0.00011599317,0.00021336525,0.00080172485,0.000003081562],"about_ca_topic_score_codex":0.019870246,"about_ca_topic_score_gemma":0.023772784,"teacher_disagreement_score":0.019870246,"about_ca_system_score_codex":0.0004284867,"about_ca_system_score_gemma":0.00059317565,"threshold_uncertainty_score":0.039509177},"labels":[],"label_agreement":null},{"id":"W4405335840","doi":"10.1007/978-3-031-72597-5_19","title":"Vertical Closure Constraint for Self-replicating Machines","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","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":"Carleton University","funders":"","keywords":"Computer science; Closure (psychology); Constraint (computer-aided design); Algorithm; Parallel computing; Theoretical computer science; Mathematical optimization; Geometry; Mathematics","score_opus":0.014767274544503321,"score_gpt":0.24622579731810462,"score_spread":0.2314585227736013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405335840","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038137823,0.0013053253,0.886306,0.0006636652,0.0006013966,0.000102473794,0.00045356073,0.000394088,0.07203557],"genre_scores_gemma":[0.70781136,0.0011588712,0.24477836,0.00027505506,0.00043958996,0.00055928144,0.0012216528,0.0006497121,0.043106105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995011,0.00010260685,0.00003942055,0.00009095058,0.00018428537,0.00008152493],"domain_scores_gemma":[0.99861205,0.00071034546,0.00012879394,0.00028419684,0.000162252,0.000102359365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008000027,0.00042881383,0.0006918072,0.00040528813,0.0006481978,0.0012118067,0.001481793,0.0008515977,0.008933073],"category_scores_gemma":[0.0038387873,0.00034150382,0.0005924953,0.0005852177,0.0011094254,0.0025021846,0.0015865541,0.0016590701,0.00092808646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109821034,0.0000342842,0.00014509849,0.0002566266,0.000011729044,0.000150663,0.00009876586,0.043019798,0.008911017,0.90173656,0.0054427558,0.040082753],"study_design_scores_gemma":[0.00004521536,0.000049563077,0.00015409573,0.00005871448,0.000008031547,0.000111724396,0.00003716102,0.253534,0.00495927,0.7224224,0.018600054,0.000019684225],"about_ca_topic_score_codex":0.00082976196,"about_ca_topic_score_gemma":0.0007837352,"teacher_disagreement_score":0.008933073,"about_ca_system_score_codex":0.00067425444,"about_ca_system_score_gemma":0.00075610814,"threshold_uncertainty_score":0.0298841},"labels":[],"label_agreement":null},{"id":"W4405386894","doi":"10.1007/978-3-031-80020-7_10","title":"From Traits to Threats: Learning Risk Indicators of Malicious Insider Using Psychometric Data","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber 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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Insider threat; Computer security; Insider; Artificial intelligence","score_opus":0.034927588162416506,"score_gpt":0.29203533997427633,"score_spread":0.25710775181185985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405386894","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.8874381,0.00047297304,0.10628901,0.0004475381,0.00008696875,0.00014704146,0.0014942519,0.0005709366,0.0030532589],"genre_scores_gemma":[0.9710306,0.00022785804,0.02611942,0.000044964756,0.000025708552,0.00012601781,0.0015664389,0.00007116443,0.000787851],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974642,0.0014070905,0.0001745799,0.0003626986,0.0004845392,0.00010695431],"domain_scores_gemma":[0.94607747,0.044977903,0.0030248442,0.0028124515,0.002283038,0.0008242713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006936703,0.0012710745,0.00072550477,0.002696819,0.00037165996,0.002838674,0.0010353008,0.0010980881,0.0014969107],"category_scores_gemma":[0.05079732,0.00045056333,0.0012085871,0.002196672,0.00073919527,0.0032932989,0.0015374112,0.003319833,0.0011747607],"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.00031659048,0.0006540925,0.7734272,0.00011394442,0.00049093866,0.000093103874,0.001101804,0.0125322305,0.0012841078,0.001888059,0.003419735,0.20467821],"study_design_scores_gemma":[0.000049206792,0.00097353157,0.58977646,0.00030938868,0.00034645514,0.0003054913,0.0028659126,0.36561888,0.0033894875,0.034110073,0.0020823649,0.00017269363],"about_ca_topic_score_codex":0.0021828536,"about_ca_topic_score_gemma":0.0027011274,"teacher_disagreement_score":0.006936703,"about_ca_system_score_codex":0.0004482199,"about_ca_system_score_gemma":0.0005591063,"threshold_uncertainty_score":0.03668523},"labels":[],"label_agreement":null},{"id":"W4405386920","doi":"10.1007/978-3-031-80020-7_6","title":"Countering Subscription Concealed Identifier (SUCI)-Catchers in Cellular Communications","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Identifier; Computer security; Computer network","score_opus":0.03035338891331228,"score_gpt":0.2948227499999236,"score_spread":0.2644693610866113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405386920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15090689,0.0036959625,0.81526625,0.0019050821,0.0011509474,0.0003185683,0.00016911839,0.0042850757,0.02230213],"genre_scores_gemma":[0.9442557,0.000807099,0.04374987,0.00037276963,0.00026186556,0.000067153815,0.00008997887,0.00011086287,0.010284734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977804,0.00048121586,0.00014308498,0.00029701524,0.0008054339,0.00049296406],"domain_scores_gemma":[0.99219716,0.0033922617,0.0008068201,0.0022382042,0.0010751166,0.00029047375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029666414,0.00068099843,0.0010631977,0.0012639981,0.0013654064,0.0030628094,0.0016708131,0.0018181769,0.0023828482],"category_scores_gemma":[0.010583453,0.00043888172,0.00041189248,0.001189902,0.0018189003,0.003743656,0.0040946524,0.0022679425,0.0010380746],"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.0021177526,0.0002998779,0.008320733,0.00043583027,0.00011354094,0.0014380151,0.0014273361,0.04466789,0.0543714,0.33855644,0.018479869,0.5297713],"study_design_scores_gemma":[0.00012181802,0.00079243287,0.0013633937,0.0001729642,0.00020673209,0.002315402,0.0005748618,0.78024906,0.0785748,0.10076733,0.03473181,0.00012945625],"about_ca_topic_score_codex":0.0010912634,"about_ca_topic_score_gemma":0.00085696887,"teacher_disagreement_score":0.0030628094,"about_ca_system_score_codex":0.0013820403,"about_ca_system_score_gemma":0.0017450949,"threshold_uncertainty_score":0.015689313},"labels":[],"label_agreement":null},{"id":"W4405419828","doi":"10.1007/978-3-031-76821-7_23","title":"Legal, Technical and User Perspectives on the Right to Modify","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recycling and Waste Management Techniques","field":"Environmental 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":"National Research Council Canada; Research and Productivity Council","funders":"","keywords":"Computer science; Human–computer interaction","score_opus":0.010276496433200227,"score_gpt":0.24157748625142847,"score_spread":0.23130098981822825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405419828","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.0072517805,0.003286101,0.020916224,0.057968233,0.0004613974,0.00002734199,0.00008014574,0.000081852835,0.9099269],"genre_scores_gemma":[0.7732862,0.006244279,0.019460462,0.021279316,0.0015302509,0.00020216021,0.00017296216,0.00053505023,0.17728935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9738998,0.01356631,0.0010706238,0.0015844891,0.007437149,0.002441662],"domain_scores_gemma":[0.9520653,0.03890143,0.000994915,0.0038585437,0.003196317,0.0009834914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02527895,0.00071303867,0.0007014417,0.0022960345,0.0078668455,0.024505623,0.002988153,0.019502154,0.018953985],"category_scores_gemma":[0.03156345,0.0012491376,0.0008997302,0.0028074218,0.036820978,0.029086413,0.008378825,0.015979787,0.0025489125],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008422067,0.000008365999,0.00004638242,0.000015892207,0.0000012621463,0.000097881275,0.0047807707,0.000087540786,0.00016472436,0.98846847,0.0030452732,0.0032750247],"study_design_scores_gemma":[0.000012116796,0.00002170909,0.00033594642,0.00035614672,0.000014301931,0.0004899496,0.008432835,0.000799982,0.0007028391,0.7464933,0.2422968,0.000043958957],"about_ca_topic_score_codex":0.01030173,"about_ca_topic_score_gemma":0.009475678,"teacher_disagreement_score":0.02527895,"about_ca_system_score_codex":0.004880403,"about_ca_system_score_gemma":0.005017042,"threshold_uncertainty_score":0.13368952},"labels":[],"label_agreement":null},{"id":"W4405427707","doi":"10.1007/978-3-031-91826-1_9","title":"Radical 2-Isogenies and Cryptographic Hash Functions in Dimensions 1, 2 and 3","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"National Capital Commission","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Hash function; Cryptographic hash function; Security of cryptographic hash functions; Cryptography; Computer science; Cryptographic primitive; Mathematics; Cryptographic protocol; Computer security; Double hashing","score_opus":0.01022513890753574,"score_gpt":0.22563503041852248,"score_spread":0.21540989151098675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405427707","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24545786,0.018158128,0.20844702,0.00469208,0.006331361,0.00017862767,0.0004433907,0.0007824393,0.51550907],"genre_scores_gemma":[0.7900544,0.006110131,0.050477155,0.001101857,0.0019080943,0.00017713977,0.00024821865,0.00023382339,0.1496891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999705,0.000065112734,0.000015522815,0.000045838402,0.00009900273,0.000069466994],"domain_scores_gemma":[0.99973303,0.00010283836,0.00003865832,0.00006561462,0.000032044107,0.000027861915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045311678,0.00072712306,0.0004864262,0.0012299628,0.0011116003,0.002313326,0.00047719863,0.0009181533,0.008920767],"category_scores_gemma":[0.0009114254,0.00032278805,0.00063332845,0.0010457375,0.003016664,0.0033067318,0.0014790588,0.0026778078,0.0019967507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028382288,0.000010522018,0.000044915974,0.000027733699,0.00000241823,0.000040329367,0.00015599589,0.0003849771,0.0007642772,0.98186123,0.0025845808,0.014094561],"study_design_scores_gemma":[0.000011897619,0.000045712877,0.00014181655,0.000013223795,0.0000032702044,0.00020761466,0.00006483641,0.0011918027,0.000779594,0.9769852,0.020538496,0.000016412969],"about_ca_topic_score_codex":0.00017052707,"about_ca_topic_score_gemma":0.00018826248,"teacher_disagreement_score":0.008920767,"about_ca_system_score_codex":0.00073871855,"about_ca_system_score_gemma":0.00042490143,"threshold_uncertainty_score":0.029842913},"labels":[],"label_agreement":null},{"id":"W4405473951","doi":"10.1007/978-3-031-78269-5_11","title":"On the Design of Gamified Learning Analytics for Immersive Virtual Reality Games","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"D2L (Canada)","funders":"","keywords":"Computer science; Virtual reality; Human–computer interaction; Analytics; Multimedia; Learning analytics; Data science","score_opus":0.053075565498305444,"score_gpt":0.2942502363918171,"score_spread":0.24117467089351163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405473951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02700965,0.0010818607,0.93124485,0.0005533406,0.00008245431,0.00022205412,0.000045090233,0.00040733514,0.03935345],"genre_scores_gemma":[0.5042171,0.0016962745,0.4697071,0.00016816243,0.000031339478,0.00040260208,0.0001260334,0.0002856311,0.02336571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990969,0.0003775857,0.000044835524,0.000106347,0.00026242633,0.000112085014],"domain_scores_gemma":[0.9990006,0.0006914029,0.00004490587,0.00006163403,0.0001385798,0.0000628058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578817,0.0011767755,0.0005567521,0.0005685943,0.0006229224,0.003206942,0.0018155618,0.0010102051,0.0073882034],"category_scores_gemma":[0.003870674,0.0008543766,0.00054559245,0.00035431253,0.0010589286,0.002396644,0.0022198323,0.0012532031,0.0007221193],"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.0003828028,0.00029165795,0.0012491662,0.0007261114,0.00008925298,0.00045778375,0.0034135687,0.18727683,0.014701623,0.5154554,0.0060173078,0.2699385],"study_design_scores_gemma":[0.00008061486,0.0003159738,0.0008801114,0.0004487748,0.00010571207,0.00033082647,0.0014465591,0.6824101,0.012224866,0.23457257,0.067115955,0.00006788399],"about_ca_topic_score_codex":0.0023938138,"about_ca_topic_score_gemma":0.0031091177,"teacher_disagreement_score":0.0073882034,"about_ca_system_score_codex":0.0006501089,"about_ca_system_score_gemma":0.0007041217,"threshold_uncertainty_score":0.02471602},"labels":[],"label_agreement":null},{"id":"W4405514575","doi":"10.1007/978-3-031-87756-8_7","title":"Exploring Chemotherapy-Induced Cardiotoxicity Combining A 3D Computational Model and Preclinical Cardiac Imaging Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chemotherapy-induced cardiotoxicity and mitigation","field":"Medicine","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":"Sunnybrook Hospital; Health Sciences Centre; Sunnybrook Health Science Centre","funders":"","keywords":"Cardiotoxicity; Medicine; Chemotherapy; Pharmacology; Internal medicine","score_opus":0.10619144954821803,"score_gpt":0.325052599053258,"score_spread":0.21886114950504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405514575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35524988,0.002880534,0.61113477,0.001929336,0.00022481328,0.00020143291,0.002608393,0.0015438744,0.02422689],"genre_scores_gemma":[0.88429135,0.0020119494,0.10490152,0.00048676063,0.00009018277,0.000171766,0.0013897393,0.0003913336,0.006265447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991167,0.000021424707,0.000005040696,0.00001672914,0.000035306126,0.000009843403],"domain_scores_gemma":[0.9995535,0.0003384699,0.000034297278,0.000019684474,0.00003769554,0.000016322894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024850504,0.0007345935,0.00059680105,0.00038482237,0.0002084557,0.0012722871,0.00087297667,0.001384848,0.0021384729],"category_scores_gemma":[0.0009312242,0.0005901156,0.0010071986,0.00039294182,0.0003785475,0.0004986131,0.00053832156,0.0006058583,0.00033726904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029904868,0.000039423452,0.0006363727,0.00007436095,0.000025030695,0.00010466034,0.000025000136,0.98700446,0.004863917,0.0009738484,0.0005170046,0.0057060537],"study_design_scores_gemma":[0.0000042172665,0.000018040828,0.00020372533,0.000005585117,0.000010257682,0.000042692966,0.000009388396,0.99755824,0.0009544272,0.0008320999,0.0003541588,0.0000071491163],"about_ca_topic_score_codex":0.0069697965,"about_ca_topic_score_gemma":0.006090772,"teacher_disagreement_score":0.0069697965,"about_ca_system_score_codex":0.00044768615,"about_ca_system_score_gemma":0.0007998983,"threshold_uncertainty_score":0.013858497},"labels":[],"label_agreement":null},{"id":"W4405801301","doi":"10.1007/978-3-031-74580-5_11","title":"The Exact Spanning Ratio of the Parallelogram Delaunay Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Ottawa; Carleton University","funders":"","keywords":"Parallelogram; Delaunay triangulation; Computer science; Algorithm; Artificial intelligence; Robot","score_opus":0.014804406126563101,"score_gpt":0.246834619603715,"score_spread":0.2320302134771519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405801301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26852491,0.005699748,0.5522935,0.0011784775,0.00041287948,0.000092049115,0.001405897,0.0010966684,0.16929583],"genre_scores_gemma":[0.81798595,0.002873659,0.16317596,0.00016370071,0.0002521903,0.00010313807,0.0007545408,0.000657954,0.014032845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994161,0.00013511244,0.000019766905,0.00013883392,0.00024518816,0.000044934703],"domain_scores_gemma":[0.99881786,0.0007403586,0.00009254024,0.00014633442,0.00014379955,0.000059043257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005479716,0.0005366077,0.0006304723,0.0017260277,0.00045961273,0.0012723404,0.0012966291,0.00075237174,0.008657648],"category_scores_gemma":[0.005809832,0.0004381153,0.00030714893,0.0013489538,0.00095189194,0.0029002083,0.0011013555,0.00094457535,0.0012799968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023425552,0.000059361,0.0013096062,0.00047997676,0.000044162516,0.00019128007,0.0002792347,0.15604304,0.010333681,0.5891271,0.012972054,0.22892626],"study_design_scores_gemma":[0.000018960263,0.00007361192,0.0016917998,0.0000773695,0.00003853104,0.00064061873,0.00021818791,0.44151515,0.005554119,0.5341381,0.015994968,0.000038658396],"about_ca_topic_score_codex":0.0010411564,"about_ca_topic_score_gemma":0.0010074025,"teacher_disagreement_score":0.008657648,"about_ca_system_score_codex":0.00063733093,"about_ca_system_score_gemma":0.00034448042,"threshold_uncertainty_score":0.028962672},"labels":[],"label_agreement":null},{"id":"W4405801658","doi":"10.1007/978-3-031-74580-5_7","title":"Bike Assisted Evacuation on a Line of Robots with S/R Communication Faults","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Robot; Line (geometry); Human–computer interaction; Simulation; Artificial intelligence","score_opus":0.03905140899428842,"score_gpt":0.2925748422041652,"score_spread":0.25352343320987675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405801658","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.6447249,0.00052458263,0.31816182,0.00097045844,0.00041813936,0.00011964812,0.00046454216,0.0018378256,0.032778136],"genre_scores_gemma":[0.96731824,0.00011008994,0.016399521,0.000041825137,0.000024423785,0.000031010357,0.00017372216,0.00004301816,0.015858117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998542,0.000030113852,0.0000070891033,0.000032632084,0.000023891022,0.000052119376],"domain_scores_gemma":[0.9997209,0.00010531076,0.000033717108,0.000036566016,0.00004773225,0.000055767254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016054658,0.00074101135,0.0010908549,0.00045790023,0.0012213856,0.00072535436,0.0010508777,0.0014479961,0.004727759],"category_scores_gemma":[0.0005930473,0.00027311116,0.0005102759,0.00050855626,0.0005843702,0.0008989431,0.0011641968,0.0006449816,0.00069310726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015124878,0.000108471206,0.0014013521,0.00011461912,0.000046863308,0.0027214645,0.0001741135,0.9409648,0.01266655,0.00466853,0.003937561,0.031683203],"study_design_scores_gemma":[0.000026805961,0.00018356918,0.00044829503,0.000007588143,0.00001360816,0.00017134206,0.00012262924,0.9933501,0.0019869981,0.0024236217,0.0012511116,0.000014302239],"about_ca_topic_score_codex":0.0060424996,"about_ca_topic_score_gemma":0.004523705,"teacher_disagreement_score":0.0060424996,"about_ca_system_score_codex":0.0004388767,"about_ca_system_score_gemma":0.00044074634,"threshold_uncertainty_score":0.015815914},"labels":[],"label_agreement":null},{"id":"W4405823739","doi":"10.1007/978-3-031-76163-8_18","title":"Towards SAMBA: Segment Anything Model for Brain Tumor Segmentation in Sub-Saharan African Populations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Montreal Neurological Institute and Hospital; McGill University; University of British Columbia; Artificial Intelligence in Medicine (Canada); Lawson Health Research Institute","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence","score_opus":0.061829578117137365,"score_gpt":0.30017476982079766,"score_spread":0.2383451917036603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405823739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035702698,0.001021555,0.9494226,0.0009834875,0.00017203906,0.00017491585,0.0023573556,0.007982494,0.0021829854],"genre_scores_gemma":[0.23683684,0.0010410628,0.737035,0.0007938488,0.00020142466,0.00056548027,0.008808245,0.0015397638,0.013178327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997688,0.00007220042,0.000010883536,0.00008077817,0.000035441677,0.00003201388],"domain_scores_gemma":[0.9996599,0.0001715588,0.000018204704,0.000038102207,0.00008320525,0.00002898967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011734187,0.0011407422,0.0010927957,0.0007309152,0.000573586,0.001541567,0.0021531393,0.0014563322,0.0033844556],"category_scores_gemma":[0.001964438,0.00063647475,0.0014804798,0.0006613072,0.00029361935,0.0010322202,0.0013025717,0.0015432922,0.0020960146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000581998,0.0002152237,0.008234446,0.00025425805,0.00055279233,0.00032622638,0.00028938102,0.531805,0.013743199,0.011975697,0.03578955,0.39623228],"study_design_scores_gemma":[0.000013416119,0.000029221566,0.00077786256,0.00001692013,0.0000337454,0.000046535042,0.00005314286,0.9869055,0.0013446541,0.0067304694,0.0040380964,0.000010482168],"about_ca_topic_score_codex":0.019734066,"about_ca_topic_score_gemma":0.026204417,"teacher_disagreement_score":0.019734066,"about_ca_system_score_codex":0.00090014003,"about_ca_system_score_gemma":0.0014043768,"threshold_uncertainty_score":0.039238393},"labels":[],"label_agreement":null},{"id":"W4405823740","doi":"10.1007/978-3-031-76163-8_22","title":"Bridging the Gap: Generalising State-of-the-Art U-Net Models to Sub-Saharan African Populations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Montreal Neurological Institute and Hospital; McGill University; University of British Columbia; Artificial Intelligence in Medicine (Canada); Lawson Health Research Institute","funders":"","keywords":"Bridging (networking); Computer science; Net (polyhedron); State (computer science); Theoretical computer science; Algorithm; Computer security; Mathematics; Geometry","score_opus":0.06320657338009963,"score_gpt":0.30776184923233124,"score_spread":0.2445552758522316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405823740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03342249,0.0029672424,0.91179216,0.0055003753,0.0005205994,0.00011021988,0.001123828,0.00049031316,0.044072904],"genre_scores_gemma":[0.633228,0.0046519865,0.3299892,0.0020823155,0.000512786,0.00040223706,0.0014224243,0.000650068,0.02706107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914026,0.0005850569,0.000028574374,0.00009826691,0.000067014254,0.000080765036],"domain_scores_gemma":[0.996102,0.0031596918,0.00012752187,0.0002331859,0.0002596474,0.00011789786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033964026,0.00083627406,0.0010536214,0.0009448788,0.0008409763,0.0025847466,0.002895532,0.0013578876,0.011195416],"category_scores_gemma":[0.013029165,0.00049761625,0.0010752534,0.0014980913,0.0012031782,0.005546139,0.0029690005,0.002267608,0.0011147301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015107897,0.000104134946,0.0041236226,0.00017696628,0.00016035333,0.00022633316,0.0010128933,0.4225351,0.00017811747,0.41616046,0.012270749,0.14290023],"study_design_scores_gemma":[0.000014560851,0.000018669294,0.00029996305,0.00010021485,0.00003571342,0.000041940984,0.00027816943,0.6561655,0.00010367208,0.33465362,0.008276068,0.00001195513],"about_ca_topic_score_codex":0.02500321,"about_ca_topic_score_gemma":0.029087046,"teacher_disagreement_score":0.02500321,"about_ca_system_score_codex":0.001549115,"about_ca_system_score_gemma":0.001960021,"threshold_uncertainty_score":0.04971534},"labels":[],"label_agreement":null},{"id":"W4405852731","doi":"10.1007/978-3-031-76163-8_27","title":"Exploring Compound Loss Functions for Brain Tumor Segmentation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Computer vision","score_opus":0.042337335104010575,"score_gpt":0.3037801112908157,"score_spread":0.26144277618680517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405852731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057931423,0.0010009685,0.9366334,0.00033364643,0.000036646532,0.000033248278,0.00037176465,0.0014324394,0.0022263555],"genre_scores_gemma":[0.530852,0.001417147,0.44872245,0.00026574457,0.00011398531,0.00010998731,0.0027255097,0.0011259982,0.014667139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979955,0.000057939873,0.000011063704,0.000047272282,0.00005187217,0.00003227513],"domain_scores_gemma":[0.99907756,0.0006262226,0.000059057937,0.00007747532,0.00011853356,0.000041134666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015010444,0.0011145864,0.0010592459,0.0008882945,0.0002695372,0.001310016,0.0011372572,0.0013843232,0.0037238204],"category_scores_gemma":[0.002637844,0.00046645998,0.00092469563,0.00075187185,0.00047909032,0.001755358,0.0010184603,0.0011754754,0.0011730364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056014216,0.00013077431,0.0018145579,0.00020975145,0.0001358294,0.00014860732,0.00007993188,0.58744156,0.018189283,0.014996383,0.00884473,0.36744845],"study_design_scores_gemma":[0.000005558497,0.00003775782,0.00021574854,0.000007910546,0.000010565501,0.000040432507,0.000011567195,0.98966146,0.0019309884,0.007555171,0.0005188727,0.0000039837655],"about_ca_topic_score_codex":0.0020874934,"about_ca_topic_score_gemma":0.0024047925,"teacher_disagreement_score":0.0037238204,"about_ca_system_score_codex":0.0006503667,"about_ca_system_score_gemma":0.0007554042,"threshold_uncertainty_score":0.01245743},"labels":[],"label_agreement":null},{"id":"W4405873221","doi":"10.1007/978-3-031-72062-8","title":"Towards Autonomous Robotic Systems","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Roma Tor Vergata; Universidad Autónoma de Occidente; Ben-Gurion University of the Negev; UK Atomic Energy Authority; Coventry University; Indian Institute of Science; University College London; Trent University; Technische Universität Chemnitz; Pennsylvania State University; Université de Montpellier; Nottingham Trent University; University of Pennsylvania; University of Essex; Queen Mary University of London","keywords":"Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.018836821396150907,"score_gpt":0.2563644305937264,"score_spread":0.23752760919757548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405873221","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006484879,0.011476802,0.74285054,0.0015903674,0.0018574724,0.0000615105,0.00022160883,0.002403983,0.23305273],"genre_scores_gemma":[0.13751024,0.019683657,0.40606728,0.00092848577,0.0009749857,0.00026636443,0.001287102,0.00095651357,0.43232542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998486,0.000018283066,0.0000052787864,0.000030879717,0.000086633794,0.000010324634],"domain_scores_gemma":[0.9999156,0.00002395032,0.0000040113077,0.000026037776,0.000020778733,0.000009602213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016519314,0.0005887945,0.00042701856,0.00040070695,0.00040378032,0.0010884088,0.0005855832,0.0006040524,0.015461818],"category_scores_gemma":[0.00041150313,0.00038385383,0.00037848973,0.00045772456,0.00056644954,0.0012498689,0.0015690154,0.0012648411,0.008465332],"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.00004503611,0.000039272505,0.00015218122,0.00036378036,0.000032093845,0.000091228016,0.00018373078,0.020128818,0.02114279,0.34925687,0.059822164,0.548742],"study_design_scores_gemma":[0.000012505094,0.00007208638,0.00028842955,0.000106970365,0.000018994686,0.0002286404,0.00005627837,0.051002298,0.006597884,0.29979575,0.641803,0.000017052564],"about_ca_topic_score_codex":0.0004657997,"about_ca_topic_score_gemma":0.0006135043,"teacher_disagreement_score":0.015461818,"about_ca_system_score_codex":0.0003384379,"about_ca_system_score_gemma":0.00032765677,"threshold_uncertainty_score":0.05172497},"labels":[],"label_agreement":null},{"id":"W4405873280","doi":"10.1007/978-3-031-72059-8","title":"Towards Autonomous Robotic Systems","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Roma Tor Vergata; Universidad Autónoma de Occidente; Ben-Gurion University of the Negev; UK Atomic Energy Authority; Coventry University; Indian Institute of Science; University College London; Trent University; Technische Universität Chemnitz; Pennsylvania State University; Université de Montpellier; Nottingham Trent University; University of Pennsylvania; University of Essex; Queen Mary University of London","keywords":"Computer science; Artificial intelligence; Human–computer interaction; Computer vision","score_opus":0.018836821396150907,"score_gpt":0.2563644305937264,"score_spread":0.23752760919757548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405873280","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006484879,0.011476802,0.74285054,0.0015903674,0.0018574724,0.0000615105,0.00022160883,0.002403983,0.23305273],"genre_scores_gemma":[0.13751024,0.019683657,0.40606728,0.00092848577,0.0009749857,0.00026636443,0.001287102,0.00095651357,0.43232542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998486,0.000018283066,0.0000052787864,0.000030879717,0.000086633794,0.000010324634],"domain_scores_gemma":[0.9999156,0.00002395032,0.0000040113077,0.000026037776,0.000020778733,0.000009602213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016519314,0.0005887945,0.00042701856,0.00040070695,0.00040378032,0.0010884088,0.0005855832,0.0006040524,0.015461818],"category_scores_gemma":[0.00041150313,0.00038385383,0.00037848973,0.00045772456,0.00056644954,0.0012498689,0.0015690154,0.0012648411,0.008465332],"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.00004503611,0.000039272505,0.00015218122,0.00036378036,0.000032093845,0.000091228016,0.00018373078,0.020128818,0.02114279,0.34925687,0.059822164,0.548742],"study_design_scores_gemma":[0.000012505094,0.00007208638,0.00028842955,0.000106970365,0.000018994686,0.0002286404,0.00005627837,0.051002298,0.006597884,0.29979575,0.641803,0.000017052564],"about_ca_topic_score_codex":0.0004657997,"about_ca_topic_score_gemma":0.0006135043,"teacher_disagreement_score":0.015461818,"about_ca_system_score_codex":0.0003384379,"about_ca_system_score_gemma":0.00032765677,"threshold_uncertainty_score":0.05172497},"labels":[],"label_agreement":null},{"id":"W4405882647","doi":"10.1007/978-981-96-2061-6_31","title":"MM-CARP: Multimodal Model with Cross-Modal Retrieval-Augmented and Visual Region Perception","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Modal; Perception; Artificial intelligence; Computer vision; Pattern recognition (psychology)","score_opus":0.014400977277997834,"score_gpt":0.2924754395763145,"score_spread":0.27807446229831667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405882647","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.005575013,0.0008008875,0.98553944,0.00013418283,0.00015753167,0.000056827208,0.0005213852,0.0042631826,0.0029514874],"genre_scores_gemma":[0.31789932,0.0015276949,0.65276366,0.00043822863,0.00031477248,0.0003750948,0.0031644371,0.0014122267,0.02210454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996984,0.000058677044,0.000012666755,0.00010976103,0.000079039506,0.0000414863],"domain_scores_gemma":[0.99976796,0.000053962645,0.000015172414,0.00007040171,0.00007274027,0.000019823145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957096,0.0011094238,0.0011735237,0.00053310307,0.00031052405,0.0012503904,0.0024294055,0.0014226625,0.008116187],"category_scores_gemma":[0.0011452849,0.0005023245,0.0013439704,0.00088997866,0.00041980535,0.001718411,0.0015792241,0.0013059884,0.0041248696],"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.0007053876,0.00024644946,0.0004884584,0.00041010932,0.00028883788,0.0002745983,0.0000955751,0.303174,0.049760938,0.018576708,0.027914256,0.5980647],"study_design_scores_gemma":[0.000012763873,0.000047759124,0.00020091895,0.000012946959,0.000030020072,0.0000753038,0.000010527127,0.98654777,0.0048363847,0.00467096,0.00353499,0.000019675388],"about_ca_topic_score_codex":0.007208166,"about_ca_topic_score_gemma":0.0062258905,"teacher_disagreement_score":0.008116187,"about_ca_system_score_codex":0.0004615225,"about_ca_system_score_gemma":0.0006718036,"threshold_uncertainty_score":0.027151346},"labels":[],"label_agreement":null},{"id":"W4405882677","doi":"10.1007/978-981-96-2061-6_30","title":"MLP-AMDC: A MLP Architecture for Adaptive-Mask-Based Dual-Camera Snapshot Hyperspectral Imaging","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Remote-Sensing Image Classification","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":"Ministry of Education and Child Care","funders":"","keywords":"Computer science; Hyperspectral imaging; Snapshot (computer storage); Computer vision; Artificial intelligence; Architecture; Dual (grammatical number); Computer graphics (images)","score_opus":0.018012777113394187,"score_gpt":0.23717348832073015,"score_spread":0.21916071120733596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405882677","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.007933604,0.0008496162,0.98235774,0.0001779848,0.000202833,0.00004647654,0.0003997109,0.0042355284,0.00379658],"genre_scores_gemma":[0.15442258,0.0009086258,0.82277846,0.00033590297,0.0001711974,0.00015345713,0.0012200002,0.00045708666,0.019552795],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997342,0.0000318939,0.000012845074,0.00007687878,0.00011225367,0.000031878662],"domain_scores_gemma":[0.99969065,0.00006283485,0.000015512616,0.000057664514,0.00014643854,0.000026881424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044135682,0.0008457848,0.0005685531,0.00046665405,0.00039669825,0.0008422177,0.0023201052,0.0012552405,0.007280815],"category_scores_gemma":[0.00095051486,0.0005084329,0.0005068482,0.0006597863,0.00035052045,0.0010153634,0.0010776628,0.0015986062,0.003726232],"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.00028586076,0.00011269868,0.00044006514,0.00020108424,0.00013314924,0.00011545237,0.000047503992,0.07347959,0.066076934,0.004838566,0.020468347,0.83380073],"study_design_scores_gemma":[0.000009109683,0.000044126326,0.00039588285,0.0000205956,0.000027980059,0.0000798135,0.000006880318,0.96954197,0.020393236,0.0017767104,0.0076819314,0.000021685082],"about_ca_topic_score_codex":0.006258388,"about_ca_topic_score_gemma":0.011272528,"teacher_disagreement_score":0.007280815,"about_ca_system_score_codex":0.00072286744,"about_ca_system_score_gemma":0.00071669085,"threshold_uncertainty_score":0.024356782},"labels":[],"label_agreement":null},{"id":"W4405897668","doi":"10.1007/978-3-031-76827-9_7","title":"Realizing the Promise of AI Governance Involving Humans-in-the-Loop","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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":"National Research Council Canada; Women's and Gender Studies et Recherches Féministes","funders":"","keywords":"Computer science; Loop (graph theory); Corporate governance; Artificial intelligence; Operations research; Management; Engineering; Mathematics","score_opus":0.04140403173186847,"score_gpt":0.33713642763010865,"score_spread":0.2957323958982402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405897668","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.016541429,0.002064196,0.29860374,0.097318605,0.0010461668,0.000093915616,0.00008742685,0.00041842123,0.583826],"genre_scores_gemma":[0.9040568,0.0013702086,0.04036102,0.0055922745,0.0006999899,0.00021555185,0.00007299375,0.00016179614,0.04746944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957652,0.0025893943,0.00007762787,0.00042253954,0.00073028094,0.00041492464],"domain_scores_gemma":[0.9916272,0.0046597277,0.0003711875,0.0019203722,0.00061602093,0.00080547045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008631932,0.0004673109,0.00045797334,0.00043684652,0.002356431,0.008502154,0.0017753721,0.005354487,0.010215841],"category_scores_gemma":[0.011394863,0.00035800174,0.0004970254,0.0005049117,0.014359171,0.017965622,0.005523408,0.0062774145,0.0019397018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005968359,0.000011563788,0.000060225364,0.000015113224,0.000003433484,0.000016955137,0.0002333083,0.00084211834,0.00012522645,0.99228126,0.0019748784,0.0044299923],"study_design_scores_gemma":[0.000004635638,0.000006180217,0.000036268633,0.000021550473,0.0000017528793,0.000010415366,0.00016098293,0.001520116,0.00012212542,0.97726065,0.020852096,0.0000032516623],"about_ca_topic_score_codex":0.0013954631,"about_ca_topic_score_gemma":0.0014673169,"teacher_disagreement_score":0.010215841,"about_ca_system_score_codex":0.0018114428,"about_ca_system_score_gemma":0.0039229486,"threshold_uncertainty_score":0.04565054},"labels":[],"label_agreement":null},{"id":"W4406011402","doi":"10.1007/978-3-031-75623-8","title":"Learning and Intelligent Optimization","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; University of Ioannina; SBA Research; Università degli Studi di Ferrara; Syddansk Universitet; Consejo Superior de Investigaciones Científicas; Università di Bologna; Università Politecnica delle Marche; Universität Bielefeld; University of Haifa; Università degli Studi di Cagliari; Centre National de la Recherche Scientifique; Universite Angers; Sapienza Università di Roma; Università degli Studi di Trento; Khalifa University of Science, Technology and Research; Università degli Studi di Milano-Bicocca; Beijing University of Technology; University of Toronto; University of Crete; Università degli Studi di Camerino; KU Leuven; Technische Universiteit Eindhoven; Indian Council of Agricultural Research; University of Warwick; Université de Lorraine; Universitat de Lleida; Universidade de Aveiro; Indian Institute of Information Technology, Allahabad; Singapore Management University; Wilfrid Laurier University; University of Patras; Institut national de recherche en informatique et en automatique (INRIA); Université de Lille; University of Pittsburgh; Università degli Studi di Udine; Università della Calabria; University of Washington; Università degli Studi di Napoli Federico II","keywords":"Computer science; Artificial intelligence","score_opus":0.010010768580344631,"score_gpt":0.2506112010465052,"score_spread":0.24060043246616056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406011402","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004289663,0.042273317,0.639558,0.0036159293,0.0015055981,0.00004844585,0.00034575062,0.00110374,0.30725947],"genre_scores_gemma":[0.13073613,0.034404267,0.22494842,0.0014002583,0.0024622595,0.0002490791,0.000915546,0.0012329087,0.6036511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980754,0.000042228698,0.0000075779208,0.00003949918,0.00009131059,0.000011874121],"domain_scores_gemma":[0.9997987,0.000110897716,0.00001070008,0.000041463954,0.000027115504,0.000011029592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003048925,0.0009128085,0.001198315,0.0005827028,0.0003164366,0.0013484258,0.00052051875,0.00065382704,0.018857507],"category_scores_gemma":[0.0009985979,0.00037757834,0.0004953763,0.0011052266,0.0009757329,0.0015395111,0.0009436799,0.0016182577,0.007442093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002740707,0.000050434704,0.00017475132,0.0003382221,0.00005741583,0.000035823574,0.00008317133,0.033896923,0.0013954284,0.41793856,0.11390233,0.4320996],"study_design_scores_gemma":[0.000010964984,0.000033011846,0.00042436487,0.00011877144,0.000023249957,0.00010292583,0.000027117307,0.07551809,0.0012419265,0.7152566,0.20722587,0.000017073484],"about_ca_topic_score_codex":0.0005995907,"about_ca_topic_score_gemma":0.0008968222,"teacher_disagreement_score":0.018857507,"about_ca_system_score_codex":0.00052640936,"about_ca_system_score_gemma":0.00035122977,"threshold_uncertainty_score":0.06308466},"labels":[],"label_agreement":null},{"id":"W4406011513","doi":"10.1007/978-3-031-75623-8_12","title":"An Imitation-Based Learning Approach Using DAgger for the Casual Employee Call Timing Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision 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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Casual; Dagger; Computer science; Imitation; Artificial intelligence; Psychology","score_opus":0.14996482727276603,"score_gpt":0.387215227889825,"score_spread":0.23725040061705896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406011513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021790832,0.00049625157,0.97419477,0.00044105505,0.00009211937,0.00006272303,0.00009643593,0.0006987208,0.0021270656],"genre_scores_gemma":[0.6461624,0.00048670737,0.34143972,0.0003994895,0.00017466824,0.00035355552,0.00047460102,0.00034858388,0.010160311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.0003662878,0.000042601256,0.00020869424,0.00009703804,0.00013404948],"domain_scores_gemma":[0.9926352,0.0064140973,0.00019466605,0.00023824023,0.00029055713,0.00022728533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002771909,0.0010132998,0.0031245616,0.0012284752,0.0008318396,0.0011610438,0.0035731753,0.0025261801,0.006089799],"category_scores_gemma":[0.008387375,0.0009463621,0.0012944229,0.0017181516,0.0012366376,0.002386738,0.0021995667,0.003058068,0.0005798919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009097178,0.00010239085,0.0004195701,0.00006524765,0.000045598274,0.000042109135,0.000038354556,0.93466353,0.0002589245,0.01008645,0.0011764913,0.05301037],"study_design_scores_gemma":[0.000006528989,0.000008221866,0.000023256805,0.0000020243192,0.0000030611673,0.0000030412637,0.0000027237024,0.9942509,0.000037063182,0.0055849906,0.00007564538,0.000002593105],"about_ca_topic_score_codex":0.0133080315,"about_ca_topic_score_gemma":0.012416117,"teacher_disagreement_score":0.0133080315,"about_ca_system_score_codex":0.0015597051,"about_ca_system_score_gemma":0.0025028368,"threshold_uncertainty_score":0.026461124},"labels":[],"label_agreement":null},{"id":"W4406470265","doi":"10.1007/978-3-031-77786-8_13","title":"MDSN: Multi-stage Context-Aware Nuclei Detection-Segmentation Network","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Nuclear Physics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Stage (stratigraphy); Context (archaeology); Segmentation; Artificial intelligence; Geology","score_opus":0.01779394992209062,"score_gpt":0.26615025062279846,"score_spread":0.24835630070070783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406470265","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.03526698,0.0033478262,0.9238543,0.0004242189,0.000497853,0.000459702,0.005845228,0.023007687,0.0072961953],"genre_scores_gemma":[0.26394454,0.0013887301,0.7004201,0.0007273605,0.00024338224,0.00055018865,0.011688047,0.0007802718,0.020257393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999681,0.000027581216,0.0000148060535,0.00013799962,0.00008635969,0.00005232044],"domain_scores_gemma":[0.9997571,0.00006132245,0.000021324413,0.000058423906,0.00007242516,0.00002929706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044985223,0.0011205646,0.0012244781,0.0015731645,0.00082116516,0.00081389537,0.0022298808,0.0010183748,0.005157763],"category_scores_gemma":[0.0008575035,0.0006517119,0.0008233124,0.001461934,0.00034362482,0.0010624698,0.0018334071,0.0007562966,0.002546041],"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.00078924454,0.00026088895,0.0029948633,0.00031815853,0.00017061384,0.00023237563,0.00012119501,0.053515475,0.03472326,0.004942731,0.03910273,0.86282843],"study_design_scores_gemma":[0.000042574542,0.00012694455,0.0022315788,0.000042711024,0.0000946898,0.0002346498,0.00006662164,0.94709235,0.024909807,0.009291637,0.015815917,0.00005054878],"about_ca_topic_score_codex":0.014087198,"about_ca_topic_score_gemma":0.030430483,"teacher_disagreement_score":0.014087198,"about_ca_system_score_codex":0.00095119426,"about_ca_system_score_gemma":0.0013633027,"threshold_uncertainty_score":0.028010428},"labels":[],"label_agreement":null},{"id":"W4406472074","doi":"10.1007/978-3-031-77786-8_14","title":"Structured Model Pruning for Efficient Inference in Computational Pathology","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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 Calgary","funders":"","keywords":"Computer science; Pruning; Inference; Artificial intelligence; Natural language processing","score_opus":0.019139342656572925,"score_gpt":0.27559528598759614,"score_spread":0.25645594333102323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406472074","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.002140213,0.00036683894,0.9939964,0.00017717869,0.00004726804,0.000055953307,0.0003058706,0.0015494591,0.0013608485],"genre_scores_gemma":[0.065650046,0.00048765691,0.9261904,0.00028691173,0.00015755581,0.00017134895,0.0023479578,0.00071735936,0.0039908425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980015,0.00069675077,0.00012595915,0.00036510732,0.0006649964,0.00014559634],"domain_scores_gemma":[0.9920747,0.0053728055,0.0002126282,0.0016518768,0.00055784907,0.00013007621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00293242,0.0011703522,0.0020907312,0.0019599397,0.0010626743,0.002154852,0.0042699613,0.0017723739,0.008935894],"category_scores_gemma":[0.013549416,0.0016549518,0.0026203976,0.0019721931,0.0012851274,0.0036766657,0.0033536225,0.003664245,0.0033901506],"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.00035191307,0.00022743459,0.0015162154,0.0005959323,0.00024811956,0.00039953354,0.00029449194,0.17609428,0.0061991927,0.16900022,0.034454774,0.6106178],"study_design_scores_gemma":[0.00003211781,0.000029883553,0.00020134372,0.000059897455,0.000055045675,0.000121639576,0.000033542503,0.7449599,0.0028172715,0.24520653,0.006468839,0.0000140285165],"about_ca_topic_score_codex":0.003206122,"about_ca_topic_score_gemma":0.0076200888,"teacher_disagreement_score":0.008935894,"about_ca_system_score_codex":0.0009853077,"about_ca_system_score_gemma":0.0018563219,"threshold_uncertainty_score":0.029893577},"labels":[],"label_agreement":null},{"id":"W4406482287","doi":"10.1007/978-3-031-77610-6_20","title":"Federated Impression for Learning with Distributed Heterogeneous Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Vector Institute; University of British Columbia","funders":"","keywords":"Computer science; Impression; Distributed computing; Artificial intelligence; World Wide Web","score_opus":0.0317995412035293,"score_gpt":0.2790954871856955,"score_spread":0.2472959459821662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406482287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011019496,0.00022525943,0.9825516,0.00028204004,0.000082266095,0.00006840017,0.00014626562,0.0027471362,0.0028775544],"genre_scores_gemma":[0.37611115,0.00027917497,0.60444075,0.00021472147,0.000093276634,0.00023268687,0.000729595,0.0004017446,0.017496916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816847,0.00047433432,0.00014383908,0.000392127,0.00060524937,0.00021589713],"domain_scores_gemma":[0.99581665,0.0011079605,0.00012595601,0.0022513599,0.00046577354,0.00023229819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029321078,0.00046846428,0.0011291314,0.001043472,0.0015087633,0.00324224,0.002956109,0.0016589857,0.007913886],"category_scores_gemma":[0.008381286,0.0004323808,0.0009973305,0.0013966736,0.0015613723,0.007621185,0.006932089,0.0024036395,0.0016741458],"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.0010849118,0.00046102022,0.0015197651,0.00015926917,0.00010837778,0.0003013217,0.00046286918,0.10422161,0.0044772467,0.28660542,0.012982243,0.5876159],"study_design_scores_gemma":[0.000036390407,0.00009304267,0.00020779912,0.000034060402,0.00002432818,0.00012426976,0.00008822918,0.6906662,0.0048195897,0.29484248,0.009043844,0.000019736312],"about_ca_topic_score_codex":0.002128742,"about_ca_topic_score_gemma":0.0029756634,"teacher_disagreement_score":0.007913886,"about_ca_system_score_codex":0.00164385,"about_ca_system_score_gemma":0.00172417,"threshold_uncertainty_score":0.026474595},"labels":[],"label_agreement":null},{"id":"W4406482306","doi":"10.1007/978-3-031-77610-6_3","title":"Segmentation Style Discovery: Application to Skin Lesion Images","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Computer science; Style (visual arts); Segmentation; Artificial intelligence; Computer vision; Skin lesion; Pattern recognition (psychology); Visual arts; Dermatology; Medicine; Art","score_opus":0.009770671149005724,"score_gpt":0.2633745012469739,"score_spread":0.2536038300979682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406482306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061523385,0.0011855391,0.9013686,0.0002829151,0.00020049425,0.00031745876,0.0017442441,0.028374486,0.0050029177],"genre_scores_gemma":[0.14246465,0.0010027796,0.8415908,0.00015774649,0.00013546267,0.000091416114,0.0018911671,0.002141157,0.010524791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997385,0.000028432009,0.000015210055,0.00008614091,0.00010064058,0.000031067593],"domain_scores_gemma":[0.99937916,0.0002138694,0.00005095758,0.000107675034,0.00018118034,0.00006709974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007038004,0.00081305625,0.000841644,0.002248246,0.00038054315,0.0015389799,0.0009623725,0.0010189862,0.0071716513],"category_scores_gemma":[0.0014150201,0.0004983375,0.00086319115,0.0020903333,0.00021197245,0.000496061,0.0007073187,0.0005949753,0.0036098883],"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.0002967326,0.00009195548,0.0030681703,0.00024026907,0.00007609794,0.0002384825,0.00012888548,0.005663401,0.09123869,0.0006377645,0.011109919,0.88720965],"study_design_scores_gemma":[0.000090541005,0.00020428498,0.01612209,0.000061233906,0.00015189599,0.0022545094,0.000257652,0.83143616,0.12125353,0.0068482,0.021240171,0.000079679354],"about_ca_topic_score_codex":0.0020784421,"about_ca_topic_score_gemma":0.0048481994,"teacher_disagreement_score":0.0071716513,"about_ca_system_score_codex":0.00031239388,"about_ca_system_score_gemma":0.00034034837,"threshold_uncertainty_score":0.023991585},"labels":[],"label_agreement":null},{"id":"W4406482324","doi":"10.1007/978-3-031-77610-6_5","title":"Lesion Elevation Prediction from Skin Images Improves Diagnosis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Skin lesion; Elevation (ballistics); Pattern recognition (psychology); Computer vision; Lesion; Pathology; Medicine; Geometry; Mathematics","score_opus":0.011785590202450937,"score_gpt":0.2436983639910412,"score_spread":0.23191277378859027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406482324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35763198,0.014050461,0.57011974,0.0016537007,0.0012729202,0.00026264548,0.0048460425,0.01654185,0.033620596],"genre_scores_gemma":[0.7832644,0.00552981,0.18599689,0.0004922846,0.0006357581,0.00004672176,0.003996964,0.00067346136,0.019363778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999063,0.0000128107395,0.00000448146,0.000029418163,0.00003278186,0.000014110614],"domain_scores_gemma":[0.9997272,0.0001390709,0.000024375378,0.000025306821,0.00006426646,0.000019809107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018181397,0.00068029854,0.00040960847,0.00065573223,0.00010569179,0.0007283874,0.00037428932,0.00051848084,0.007080427],"category_scores_gemma":[0.0009431905,0.00020492305,0.00037711914,0.0002976175,0.00008182337,0.00048154345,0.0003984656,0.00042336463,0.0047130114],"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.00056295225,0.00012566554,0.010734038,0.00013304559,0.000041324067,0.00034606789,0.000015441647,0.008239162,0.05865115,0.0002550467,0.014486129,0.9064101],"study_design_scores_gemma":[0.00007433402,0.00063487736,0.047044292,0.00016762377,0.00037794706,0.004638629,0.000101082784,0.78445625,0.13756453,0.0052837143,0.019594872,0.000061861654],"about_ca_topic_score_codex":0.0012727554,"about_ca_topic_score_gemma":0.0016162375,"teacher_disagreement_score":0.007080427,"about_ca_system_score_codex":0.000119686316,"about_ca_system_score_gemma":0.00013337015,"threshold_uncertainty_score":0.023686409},"labels":[],"label_agreement":null},{"id":"W4406486231","doi":"10.1007/978-3-031-88711-6_10","title":"Evaluating LLM Abilities to Understand Tabular Electronic Health Records: A Comprehensive Study of Patient Data Extraction and Retrieval","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","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":"Fonds de Recherche du Québec - Santé; Grand Équipement National De Calcul Intensif","keywords":"Computer science; Task (project management); Context (archaeology); Data extraction; Information retrieval; Health records; Selection (genetic algorithm); Serialization; Data mining; Machine learning; Feature selection; Data science; Artificial intelligence; MEDLINE; Health care; Engineering","score_opus":0.07135074493848703,"score_gpt":0.38137189432816526,"score_spread":0.31002114938967823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406486231","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.98813117,0.0010628264,0.006374262,0.00032880547,0.000010965295,0.0001741028,0.00084821845,0.0002653968,0.002804306],"genre_scores_gemma":[0.98579144,0.00058384787,0.010401843,0.00013462531,0.000011411166,0.00010348378,0.0015787219,0.000049648603,0.0013449347],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9961434,0.0019113879,0.00064380985,0.00035335394,0.00079186447,0.00015617046],"domain_scores_gemma":[0.88669723,0.10261306,0.004075921,0.0021341653,0.003755749,0.00072390365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008516475,0.00047600266,0.00042488013,0.0019798083,0.00036874795,0.0014930897,0.00067823794,0.0006257211,0.0018662706],"category_scores_gemma":[0.059626956,0.00019843133,0.0005567048,0.001358238,0.000496762,0.0033431628,0.0015969435,0.0004931279,0.00081454124],"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.0021814168,0.0010664308,0.4622095,0.0011564809,0.00041016622,0.00039706708,0.015179377,0.002087375,0.010002374,0.0006402647,0.0050895764,0.49958003],"study_design_scores_gemma":[0.00019135406,0.0042093117,0.8966311,0.00064712326,0.00073971,0.0018164484,0.016704412,0.045631208,0.020203212,0.0023513923,0.010737026,0.00013773491],"about_ca_topic_score_codex":0.002750353,"about_ca_topic_score_gemma":0.0033257895,"teacher_disagreement_score":0.008516475,"about_ca_system_score_codex":0.00065786304,"about_ca_system_score_gemma":0.00082297076,"threshold_uncertainty_score":0.04503995},"labels":[],"label_agreement":null},{"id":"W4406651655","doi":"10.1007/978-3-031-75409-8_7","title":"Improved Outerplanarity Bounds for Planar Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Planar; Planar graph; Theoretical computer science; Graph; Computer graphics (images)","score_opus":0.018720267353283707,"score_gpt":0.2899366867150379,"score_spread":0.2712164193617542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406651655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094774365,0.018434104,0.48350194,0.009339508,0.002490507,0.00034860987,0.0038041938,0.0061769304,0.38112974],"genre_scores_gemma":[0.5581472,0.019169997,0.27730653,0.0036842732,0.0050169877,0.00096450164,0.007516387,0.0072101215,0.12098402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951786,0.00079985,0.0001565701,0.000958394,0.0018527341,0.0010539088],"domain_scores_gemma":[0.9781035,0.015082173,0.0007430271,0.0035288637,0.0016060487,0.0009363841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003347145,0.005018423,0.0030047728,0.0056587923,0.0026663812,0.006432959,0.008439867,0.0024816191,0.036203038],"category_scores_gemma":[0.020907756,0.0020695885,0.0029428196,0.0069715264,0.00409657,0.018735977,0.010919407,0.014400481,0.009545847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002290601,0.0007195474,0.002154493,0.0021873445,0.0002545698,0.00040204593,0.0012709048,0.083520405,0.02195762,0.5109736,0.10012785,0.27414104],"study_design_scores_gemma":[0.0001635328,0.00026236172,0.002111505,0.00035292798,0.0004005524,0.00029918874,0.0003243044,0.11916657,0.012296753,0.81696147,0.04753982,0.00012098964],"about_ca_topic_score_codex":0.0035977727,"about_ca_topic_score_gemma":0.005708351,"teacher_disagreement_score":0.036203038,"about_ca_system_score_codex":0.004761351,"about_ca_system_score_gemma":0.0014858433,"threshold_uncertainty_score":0.121111214},"labels":[],"label_agreement":null},{"id":"W4406657221","doi":"10.1007/978-3-031-77389-1_9","title":"Investigating the Impact of a Foundational Medical Image Model for CT Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; BC Cancer Agency","funders":"","keywords":"Computer science; Artificial intelligence; Medical imaging; Natural language processing; Computer vision","score_opus":0.030429612255669886,"score_gpt":0.34808939530828115,"score_spread":0.3176597830526113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406657221","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.68220127,0.0020506221,0.30081928,0.0024626295,0.0002965218,0.00015119727,0.0008542903,0.0013057995,0.009858464],"genre_scores_gemma":[0.9534016,0.00034933508,0.04302644,0.00013932525,0.000055413733,0.00002209084,0.00074098783,0.00017562948,0.0020891386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992286,0.0003446873,0.000033256147,0.00014141742,0.00017901728,0.000072976385],"domain_scores_gemma":[0.98860335,0.009359265,0.00032510774,0.00064273033,0.00090513175,0.0001644086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002839912,0.0007484362,0.0005821682,0.00046647506,0.00037449133,0.001788489,0.0011590536,0.0011962724,0.002914971],"category_scores_gemma":[0.016441096,0.00033604255,0.00062514644,0.00055457896,0.0005168237,0.0019571567,0.00077444286,0.0014358712,0.0005645431],"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.002585955,0.00056161435,0.013065181,0.00026380387,0.00022621857,0.00012271373,0.00009533231,0.72118086,0.011123024,0.006579844,0.0041486206,0.24004681],"study_design_scores_gemma":[0.00001034002,0.000079342724,0.0007747442,0.000008554913,0.000027765354,0.000024787723,0.000019686013,0.99632335,0.0016531564,0.00087042805,0.00020410417,0.0000038049077],"about_ca_topic_score_codex":0.015234495,"about_ca_topic_score_gemma":0.0099163,"teacher_disagreement_score":0.015234495,"about_ca_system_score_codex":0.001111286,"about_ca_system_score_gemma":0.0011053107,"threshold_uncertainty_score":0.030291677},"labels":[],"label_agreement":null},{"id":"W4406657658","doi":"10.1007/978-3-031-77392-1_5","title":"Contrastive Loss Based on Contextual Similarity for Image Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Similarity (geometry); Artificial intelligence; Pattern recognition (psychology); Image (mathematics); Natural language processing; Information retrieval","score_opus":0.023876731561613688,"score_gpt":0.2825821431947735,"score_spread":0.2587054116331598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406657658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026124116,0.0018016195,0.969092,0.00015767821,0.00014803911,0.000057034005,0.000092914444,0.00047884008,0.0020476892],"genre_scores_gemma":[0.49423692,0.0021905748,0.49037075,0.00034141258,0.00060298777,0.00017149499,0.00081670145,0.00030777385,0.010961389],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948716,0.00010388838,0.000022860937,0.000095674885,0.00023107936,0.000059321646],"domain_scores_gemma":[0.99949515,0.00017901382,0.00003894133,0.00011333487,0.00014568426,0.000027843465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009992875,0.0006441919,0.0012030717,0.000762783,0.00027214762,0.0008370402,0.001138329,0.0007971522,0.002747148],"category_scores_gemma":[0.0016813843,0.00017737673,0.0005683188,0.0010202413,0.00046170113,0.0013121576,0.0009880465,0.0011476546,0.0009638848],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074252253,0.00036532176,0.0007923826,0.00023965709,0.00012288982,0.0000993613,0.00004135258,0.06052341,0.09036939,0.021393836,0.008506462,0.81680346],"study_design_scores_gemma":[0.000020666426,0.00023124574,0.0012782618,0.00001896024,0.0000691905,0.0002491843,0.000015339365,0.9640457,0.0233328,0.007144603,0.003577134,0.000016919903],"about_ca_topic_score_codex":0.0011651004,"about_ca_topic_score_gemma":0.0016699042,"teacher_disagreement_score":0.002747148,"about_ca_system_score_codex":0.00053309085,"about_ca_system_score_gemma":0.0005166824,"threshold_uncertainty_score":0.009190142},"labels":[],"label_agreement":null},{"id":"W4406658067","doi":"10.1007/978-3-031-77392-1_7","title":"Anisotropic Point Synthesis by Example","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Satellite Image Processing and Photogrammetry","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":"Carleton University; McGill University","funders":"","keywords":"Computer science; Point (geometry); Anisotropy; Algorithm; Geometry; Optics; Physics; Mathematics","score_opus":0.010836912326999284,"score_gpt":0.2152328471747096,"score_spread":0.20439593484771032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406658067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011526797,0.000374377,0.9265775,0.000152017,0.00012915218,0.000041166804,0.00010777821,0.0008648317,0.060226403],"genre_scores_gemma":[0.20901605,0.0008983536,0.73621947,0.00008861009,0.00008952225,0.00007203839,0.00034011982,0.00051890843,0.052757017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985504,0.000017968961,0.0000066087973,0.000031022897,0.00007701553,0.000012409507],"domain_scores_gemma":[0.99991477,0.000023580356,0.000004929723,0.000026903095,0.000024782474,0.0000050476347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120420336,0.000495944,0.00045368428,0.0003975097,0.00021217244,0.00073396513,0.000420383,0.00049364596,0.008540934],"category_scores_gemma":[0.0003301414,0.00026974853,0.00042913872,0.0004733864,0.00033242675,0.0005038828,0.0007531633,0.0006035011,0.002898561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028435094,0.000049568873,0.00033328083,0.0003844638,0.000052848125,0.00047114925,0.00017560329,0.07681932,0.18834478,0.27018055,0.01489049,0.44801357],"study_design_scores_gemma":[0.00006600761,0.00013833644,0.00053489243,0.000050610273,0.00006087114,0.0021051436,0.000085570784,0.59096104,0.12814692,0.11660062,0.16120285,0.000047141802],"about_ca_topic_score_codex":0.00042127518,"about_ca_topic_score_gemma":0.00051520235,"teacher_disagreement_score":0.008540934,"about_ca_system_score_codex":0.0001770805,"about_ca_system_score_gemma":0.00013107016,"threshold_uncertainty_score":0.028572261},"labels":[],"label_agreement":null},{"id":"W4406689703","doi":"10.1007/978-3-031-77392-1_15","title":"LORTSAR: Low-Rank Transformer for Skeleton-Based Action Recognition","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Skeleton (computer programming); Transformer; Artificial intelligence; Action (physics); Pattern recognition (psychology); Electrical engineering; Programming language; Voltage; Engineering","score_opus":0.02782756959252805,"score_gpt":0.2685498589105278,"score_spread":0.24072228931799974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406689703","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.001912276,0.00031850682,0.97436845,0.0000732009,0.0001186035,0.00006549833,0.0014045864,0.019701006,0.002037841],"genre_scores_gemma":[0.053436726,0.0007332363,0.9101613,0.00029836773,0.00018120439,0.00024285965,0.010088232,0.002941883,0.021916257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999102,0.00009465875,0.000049021517,0.00021516296,0.00042958028,0.00010953748],"domain_scores_gemma":[0.99946827,0.00013123534,0.000041149025,0.00015323138,0.00015766123,0.000048598497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007226893,0.0018842877,0.0014433827,0.0014704269,0.00041120316,0.0015768709,0.0019135444,0.0011287562,0.034640525],"category_scores_gemma":[0.0017779836,0.00064784975,0.0012444212,0.0018594699,0.00046948437,0.0016357703,0.0017168501,0.0020467755,0.027843287],"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.00037425157,0.00012069547,0.00024150622,0.00019845516,0.00005693188,0.000085217536,0.000036269023,0.0077635823,0.036352064,0.0056301863,0.05800747,0.89113337],"study_design_scores_gemma":[0.000114730945,0.0004135953,0.001471322,0.00008518091,0.000086363536,0.0008770111,0.00010414074,0.77935964,0.10587401,0.031145703,0.08036575,0.00010263038],"about_ca_topic_score_codex":0.0037082743,"about_ca_topic_score_gemma":0.008638578,"teacher_disagreement_score":0.034640525,"about_ca_system_score_codex":0.00045121103,"about_ca_system_score_gemma":0.0010548327,"threshold_uncertainty_score":0.115884066},"labels":[],"label_agreement":null},{"id":"W4406689884","doi":"10.1007/978-3-031-77392-1_20","title":"MEM: Mask Enhancement Model for Video Object Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Segmentation; Object (grammar); Computer graphics (images)","score_opus":0.02441984328686166,"score_gpt":0.29272523134912837,"score_spread":0.2683053880622667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406689884","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.011380974,0.00094216753,0.9794701,0.00011765863,0.00013014708,0.000067155815,0.0005624056,0.0055746064,0.0017548439],"genre_scores_gemma":[0.30836892,0.0011759083,0.66953784,0.0003362352,0.00024045167,0.00024935842,0.0020714824,0.0011803282,0.016839454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988186,0.000016163469,0.000005134573,0.000047887446,0.000031581418,0.000017301261],"domain_scores_gemma":[0.9998776,0.00003714894,0.000009649215,0.000024378161,0.000040989864,0.000010176819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045399062,0.0010314053,0.00081658975,0.00063022634,0.00024171606,0.0006082707,0.0015060474,0.00092307676,0.0045088828],"category_scores_gemma":[0.0006820919,0.00042816618,0.0008332224,0.00057072844,0.00021549649,0.0008549706,0.0006027334,0.0006434433,0.0016948864],"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.0008630435,0.00012593312,0.0007051356,0.000253608,0.00017557769,0.00018376605,0.000055921937,0.11707837,0.074554324,0.0060474165,0.01907551,0.78088146],"study_design_scores_gemma":[0.000013637418,0.00006467761,0.00036363504,0.000010059372,0.000036846006,0.000079536694,0.0000059077825,0.97580236,0.017422386,0.002698303,0.0034925363,0.000010032144],"about_ca_topic_score_codex":0.0056764903,"about_ca_topic_score_gemma":0.0065716854,"teacher_disagreement_score":0.0056764903,"about_ca_system_score_codex":0.00055818376,"about_ca_system_score_gemma":0.00044939722,"threshold_uncertainty_score":0.01508373},"labels":[],"label_agreement":null},{"id":"W4406714353","doi":"10.1007/978-3-031-82700-6","title":"Verification, Model Checking, and Abstract Interpretation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; University of California, Davis; Indian Institute of Technology Delhi; Universidade Federal de Minas Gerais; Indian Institute of Technology Bombay; Ludwig-Maximilians-Universität München; Uppsala Universitet; Chinese Academy of Sciences; Vysoké Učení Technické v Brně; Sorbonne Université; University of Twente; Aalborg Universitet; Technische Universiteit Delft; Tata Institute of Fundamental Research; Institute of Science and Technology Austria; Indian Institute of Science; Florida International University; York University; University of Southern California","keywords":"Computer science; Programming language; Interpretation (philosophy); Model checking; Abstract interpretation","score_opus":0.019858046014594254,"score_gpt":0.29246290401498254,"score_spread":0.2726048580003883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406714353","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.004798422,0.0068038255,0.92506176,0.001875833,0.00053767406,0.00011348281,0.00035451952,0.0026956897,0.057758763],"genre_scores_gemma":[0.32628953,0.01453417,0.586654,0.0010044216,0.0012585018,0.0007320725,0.0018228402,0.00237,0.065334454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963929,0.0010970522,0.00021307441,0.00050899154,0.0015435782,0.00024442127],"domain_scores_gemma":[0.9966515,0.0020584525,0.00015828534,0.0008658004,0.00022801611,0.000038014645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284073,0.0020004,0.002191859,0.0018119575,0.0011815142,0.0047096284,0.0022169033,0.0013973576,0.01031505],"category_scores_gemma":[0.008346246,0.0015036982,0.002836306,0.0029745656,0.005500944,0.007320841,0.0024565975,0.004843175,0.0025525133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008199141,0.00005356472,0.00015681554,0.00040306742,0.000044031138,0.00007725642,0.00016283407,0.018601328,0.0022100317,0.86693424,0.012668779,0.09860611],"study_design_scores_gemma":[0.000021902197,0.000012610787,0.00005618942,0.000062767154,0.00002671912,0.00004894968,0.000017088449,0.01805073,0.0015792669,0.9670379,0.013072021,0.0000138030855],"about_ca_topic_score_codex":0.0028240923,"about_ca_topic_score_gemma":0.0022514905,"teacher_disagreement_score":0.01031505,"about_ca_system_score_codex":0.0024031422,"about_ca_system_score_gemma":0.0019355807,"threshold_uncertainty_score":0.034507334},"labels":[],"label_agreement":null},{"id":"W4406714354","doi":"10.1007/978-3-031-82700-6_10","title":"Automatic Inference of Relational Object Invariants","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 Waterloo","funders":"","keywords":"Computer science; Inference; Object (grammar); Relational database; Artificial intelligence; Programming language; Theoretical computer science; Information retrieval","score_opus":0.026043314378741442,"score_gpt":0.2578739610847451,"score_spread":0.23183064670600365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406714354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022207463,0.00042560667,0.9412393,0.00035347603,0.00022018739,0.00010958581,0.00065168354,0.018807318,0.0159853],"genre_scores_gemma":[0.40367278,0.0004727295,0.57484734,0.0004064808,0.00031298943,0.00011917167,0.003434934,0.0032378144,0.013495725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996808,0.00060841284,0.00019989967,0.00074785185,0.0012232873,0.0004125183],"domain_scores_gemma":[0.9916769,0.0053247213,0.00028886573,0.0017917404,0.00079121185,0.00012647235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026786905,0.00082879,0.0014095481,0.0023384998,0.0011937858,0.0041441354,0.004606322,0.0012629679,0.01354883],"category_scores_gemma":[0.009967968,0.0015506558,0.0025654826,0.001733476,0.002320844,0.0075811865,0.0044536577,0.0024793302,0.0036861307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062176416,0.00035495555,0.003078643,0.00076597533,0.00020239981,0.00051302445,0.0006909723,0.016599013,0.021443384,0.357363,0.02419475,0.57417214],"study_design_scores_gemma":[0.00012345001,0.00008499382,0.0016215588,0.00015387796,0.00021786036,0.00032281515,0.0002125617,0.29071543,0.04934164,0.63524336,0.021869084,0.000093279385],"about_ca_topic_score_codex":0.0031252792,"about_ca_topic_score_gemma":0.0060442234,"teacher_disagreement_score":0.01354883,"about_ca_system_score_codex":0.0014553816,"about_ca_system_score_gemma":0.0012641582,"threshold_uncertainty_score":0.04532534},"labels":[],"label_agreement":null},{"id":"W4406716180","doi":"10.1007/978-3-031-82703-7","title":"Verification, Model Checking, and Abstract Interpretation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; Indian Institute of Technology Delhi; Universidade Federal de Minas Gerais; Indian Institute of Technology Bombay; Ludwig-Maximilians-Universität München; University of Twente; Uppsala Universitet; Chinese Academy of Sciences; Aalborg Universitet; Technische Universiteit Delft; Tata Institute of Fundamental Research; Indian Institute of Science; Florida International University; York University; University of Southern California","keywords":"Computer science; Interpretation (philosophy); Model checking; Abstract interpretation; Programming language","score_opus":0.019858046014594254,"score_gpt":0.29246290401498254,"score_spread":0.2726048580003883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406716180","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004798422,0.0068038255,0.92506176,0.001875833,0.00053767406,0.00011348281,0.00035451952,0.0026956897,0.057758763],"genre_scores_gemma":[0.32628953,0.01453417,0.586654,0.0010044216,0.0012585018,0.0007320725,0.0018228402,0.00237,0.065334454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963929,0.0010970522,0.00021307441,0.00050899154,0.0015435782,0.00024442127],"domain_scores_gemma":[0.9966515,0.0020584525,0.00015828534,0.0008658004,0.00022801611,0.000038014645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284073,0.0020004,0.002191859,0.0018119575,0.0011815142,0.0047096284,0.0022169033,0.0013973576,0.01031505],"category_scores_gemma":[0.008346246,0.0015036982,0.002836306,0.0029745656,0.005500944,0.007320841,0.0024565975,0.004843175,0.0025525133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008199141,0.00005356472,0.00015681554,0.00040306742,0.000044031138,0.00007725642,0.00016283407,0.018601328,0.0022100317,0.86693424,0.012668779,0.09860611],"study_design_scores_gemma":[0.000021902197,0.000012610787,0.00005618942,0.000062767154,0.00002671912,0.00004894968,0.000017088449,0.01805073,0.0015792669,0.9670379,0.013072021,0.0000138030855],"about_ca_topic_score_codex":0.0028240923,"about_ca_topic_score_gemma":0.0022514905,"teacher_disagreement_score":0.01031505,"about_ca_system_score_codex":0.0024031422,"about_ca_system_score_gemma":0.0019355807,"threshold_uncertainty_score":0.034507334},"labels":[],"label_agreement":null},{"id":"W4406716471","doi":"10.1007/978-3-031-82703-7_4","title":"Synthesis of Parametric Locally Symmetric Protocols from Abstract Temporal Specifications","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parametric statistics; Theoretical computer science; Distributed computing; Mathematics; Statistics","score_opus":0.057291667460120536,"score_gpt":0.30813902253182357,"score_spread":0.250847355071703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406716471","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024685465,0.000119592674,0.96480376,0.000090931775,0.000051391842,0.000118411495,0.0001065767,0.001813044,0.008210687],"genre_scores_gemma":[0.5575163,0.00035997288,0.43252143,0.00006830485,0.000032234388,0.00041243338,0.0004833084,0.000810844,0.0077952086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.00019754237,0.000079615835,0.00012043814,0.00028620334,0.00009998794],"domain_scores_gemma":[0.998279,0.0009862698,0.00014688798,0.00039678198,0.00014191055,0.000049302955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011098847,0.00062056957,0.0006242087,0.00040412112,0.0004176503,0.0011739664,0.0010877625,0.00068563735,0.005061139],"category_scores_gemma":[0.0031892145,0.0007895476,0.000946469,0.0004282634,0.0011111647,0.0014044491,0.0013688803,0.001303929,0.0010452853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003787475,0.00011554286,0.00028554784,0.0006327786,0.000056018267,0.0004390733,0.00047896968,0.14508815,0.09164255,0.6195853,0.002053772,0.13924353],"study_design_scores_gemma":[0.0001976367,0.000263141,0.0001737159,0.00013278726,0.00011617465,0.00028301292,0.0001302532,0.4988754,0.19736864,0.27959156,0.022816572,0.00005115471],"about_ca_topic_score_codex":0.00032503926,"about_ca_topic_score_gemma":0.0005666504,"teacher_disagreement_score":0.005061139,"about_ca_system_score_codex":0.0006499336,"about_ca_system_score_gemma":0.00107609,"threshold_uncertainty_score":0.016931236},"labels":[],"label_agreement":null},{"id":"W4406753029","doi":"10.1007/978-3-031-78548-1_16","title":"MLCDG: Multi-Level Contrastive Graph Clustering in Dynamic Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Cluster analysis; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.016865652234112988,"score_gpt":0.2713157332208774,"score_spread":0.25445008098676436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406753029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055084266,0.00045051926,0.9858197,0.0002459572,0.000095894335,0.00010053905,0.0006444258,0.0040053963,0.003129082],"genre_scores_gemma":[0.09209509,0.00058091513,0.8925786,0.00029437945,0.00013883358,0.00026930537,0.0028411853,0.0018922098,0.009309546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993748,0.00013981244,0.000022908604,0.00020797453,0.00020997222,0.00004462716],"domain_scores_gemma":[0.9985434,0.0006307031,0.00009259037,0.00043423867,0.00020053856,0.00009855319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624199,0.0010889648,0.0011607009,0.0021885692,0.0009636736,0.0019381791,0.0028219807,0.001360299,0.007299878],"category_scores_gemma":[0.003455988,0.0008516832,0.0011012171,0.0026927372,0.0009961032,0.0026293858,0.0024298043,0.0024767958,0.0032095755],"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.00021649405,0.00018367374,0.0011747039,0.0007521192,0.00012701795,0.00025806183,0.0004615281,0.16744068,0.018622475,0.15909086,0.05454237,0.59713],"study_design_scores_gemma":[0.000032761698,0.000042762087,0.00061217253,0.000064669955,0.00003343059,0.00021591525,0.00008323505,0.82315654,0.0064655375,0.14134586,0.027917454,0.000029637275],"about_ca_topic_score_codex":0.003752826,"about_ca_topic_score_gemma":0.0062863887,"teacher_disagreement_score":0.007299878,"about_ca_system_score_codex":0.0013255426,"about_ca_system_score_gemma":0.0008305118,"threshold_uncertainty_score":0.0244205},"labels":[],"label_agreement":null},{"id":"W4406753387","doi":"10.1007/978-3-031-78548-1_25","title":"PRAGyan - Connecting the Dots in Tweets","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Calgary","funders":"","keywords":"Computer science; World Wide Web; Artificial intelligence; Information retrieval; Natural language processing","score_opus":0.021017006780768368,"score_gpt":0.2578272913690574,"score_spread":0.23681028458828904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406753387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04899133,0.0014683274,0.7825522,0.010846957,0.0029655935,0.0005026995,0.004742803,0.0120423725,0.13588767],"genre_scores_gemma":[0.37762946,0.0013359432,0.48298594,0.0020591759,0.0005731919,0.00062902557,0.0058189365,0.0034347952,0.1255335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988826,0.00043808378,0.00004282902,0.00032205964,0.00021162741,0.000102808124],"domain_scores_gemma":[0.99679023,0.0016084752,0.00014380728,0.00086906797,0.0004288991,0.00015957364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015570289,0.0006967072,0.00066407473,0.0011939041,0.0025460483,0.0033314514,0.00106071,0.0012198066,0.031364825],"category_scores_gemma":[0.00972217,0.000677578,0.00090599194,0.002243488,0.0010599016,0.008757541,0.005186356,0.002714655,0.015324583],"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.00054477283,0.00014856986,0.0040524467,0.00056743925,0.00012454043,0.00034936707,0.0037131475,0.011987098,0.008331484,0.46378222,0.10786403,0.3985349],"study_design_scores_gemma":[0.00006372649,0.0001597618,0.0020332558,0.00025446125,0.00012105359,0.00033768394,0.0023906531,0.13931152,0.012238212,0.489259,0.35374647,0.000084177555],"about_ca_topic_score_codex":0.002402981,"about_ca_topic_score_gemma":0.0038474218,"teacher_disagreement_score":0.031364825,"about_ca_system_score_codex":0.0007858498,"about_ca_system_score_gemma":0.0011119748,"threshold_uncertainty_score":0.10492581},"labels":[],"label_agreement":null},{"id":"W44067585","doi":"10.1007/11564751_105","title":"From Linear Relaxations to Global Constraint Propagation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constraint (computer-aided design); Computer science; Integer (computer science); Variable (mathematics); Domain (mathematical analysis); Binary number; Linear programming; Local consistency; Binary constraint; Mathematical optimization; Integer programming; Algorithm; Constraint satisfaction; Mathematics; Artificial intelligence; Arithmetic; Geometry; Mathematical analysis; Programming language","score_opus":0.013908387299258218,"score_gpt":0.2522268032851565,"score_spread":0.23831841598589829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44067585","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.001390566,0.0018581549,0.96885675,0.00064256485,0.00017441664,0.000048167873,0.00017470247,0.0005564967,0.026298152],"genre_scores_gemma":[0.075298816,0.006410341,0.87993085,0.0010038133,0.00049040833,0.00040079016,0.001170303,0.0014218572,0.033872757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987406,0.0005300025,0.00006454893,0.0002201574,0.00035094595,0.00009369806],"domain_scores_gemma":[0.9971469,0.002117254,0.00012092639,0.00034269024,0.00022459884,0.000047758007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018550439,0.0018529545,0.0012741503,0.0015057321,0.0008831148,0.0024318958,0.0030190933,0.0014769039,0.021028398],"category_scores_gemma":[0.007401115,0.0019113855,0.0015831385,0.004018308,0.0023920084,0.0063740774,0.0037623902,0.0061198277,0.0030317411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074595024,0.00007013705,0.00008965618,0.0007174817,0.00007312104,0.00007795677,0.00028936626,0.13164955,0.00082012627,0.57181454,0.030826006,0.26349744],"study_design_scores_gemma":[0.000024338655,0.00001819956,0.00003907125,0.00014199584,0.000028158043,0.000034468158,0.000057019966,0.15578412,0.0007370137,0.82063514,0.022484558,0.00001598601],"about_ca_topic_score_codex":0.0036327643,"about_ca_topic_score_gemma":0.004871322,"teacher_disagreement_score":0.021028398,"about_ca_system_score_codex":0.0012448652,"about_ca_system_score_gemma":0.0010018527,"threshold_uncertainty_score":0.07034701},"labels":[],"label_agreement":null},{"id":"W4406767015","doi":"10.1007/978-3-031-77389-1_11","title":"HydroVision: LiDAR-Guided Hydrometric Prediction with Vision Transformers and Hybrid Graph Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hydrological Forecasting Using AI","field":"Environmental 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":"Concordia University","funders":"","keywords":"Computer science; Transformer; Lidar; Artificial intelligence; Graph; Machine learning; Remote sensing; Electrical engineering; Theoretical computer science; Geology; Engineering; Voltage","score_opus":0.00896373670907442,"score_gpt":0.22041959936987796,"score_spread":0.21145586266080355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406767015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050390135,0.0004484264,0.9820888,0.00011993825,0.000115051924,0.000038810715,0.00034352415,0.006921739,0.004884645],"genre_scores_gemma":[0.19983491,0.0009526515,0.7658616,0.00029651241,0.00016446791,0.00012031124,0.0023956874,0.001732581,0.028641345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998431,0.000013108358,0.0000048425404,0.000054400967,0.00007054041,0.000013941803],"domain_scores_gemma":[0.9998869,0.000028415192,0.00000689318,0.000030287678,0.00003565117,0.000011832524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020924349,0.0005914546,0.00048704445,0.0005845805,0.0001819607,0.0007837875,0.0015014433,0.0006782393,0.0061092135],"category_scores_gemma":[0.00043933064,0.0004517462,0.00041812332,0.0009121504,0.0004227786,0.001308314,0.0010028133,0.0008620108,0.0031316932],"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.00010001319,0.000088036795,0.00036158858,0.00008173246,0.000042302476,0.00005193334,0.00003201715,0.08453242,0.013524425,0.010570483,0.024755754,0.86585927],"study_design_scores_gemma":[0.000014261032,0.00003053233,0.00044319694,0.000010730486,0.000009823867,0.00006761166,0.000010340836,0.96140206,0.009807202,0.01523715,0.012949501,0.000017608245],"about_ca_topic_score_codex":0.0052739414,"about_ca_topic_score_gemma":0.00820625,"teacher_disagreement_score":0.0061092135,"about_ca_system_score_codex":0.00041804323,"about_ca_system_score_gemma":0.00047134393,"threshold_uncertainty_score":0.02043736},"labels":[],"label_agreement":null},{"id":"W4406781026","doi":"10.1007/978-3-031-78538-2_12","title":"Gradient Descent Clustering with Regularization to Recover Communities in Transformed Attributed Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Regularization (linguistics); Cluster analysis; Gradient descent; Stochastic gradient descent; Artificial intelligence; Algorithm; Data mining; Artificial neural network","score_opus":0.013263593558565528,"score_gpt":0.23502388904775284,"score_spread":0.22176029548918733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406781026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011024672,0.00020714516,0.9871564,0.00021155874,0.000044217035,0.00005330338,0.00015330547,0.00066952175,0.00047988398],"genre_scores_gemma":[0.26493576,0.00040585035,0.72064847,0.00032061053,0.00021236998,0.00031629714,0.0017866879,0.0009630814,0.01041083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841666,0.0006561599,0.000065715474,0.00042372427,0.00032233272,0.00011543812],"domain_scores_gemma":[0.9937828,0.0036958398,0.00035613016,0.0008959641,0.0010039893,0.0002652302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003358597,0.0013950758,0.0020163178,0.00224423,0.0012127236,0.0016161028,0.0040970896,0.0029198576,0.0020091534],"category_scores_gemma":[0.012127525,0.0012095084,0.0020283686,0.0024351429,0.0017694035,0.00259024,0.0031978032,0.0040061604,0.0012642159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022391556,0.00019832542,0.0011949586,0.00018695754,0.00022115793,0.00010451773,0.00027484435,0.8158806,0.00408759,0.027273305,0.009066626,0.1412872],"study_design_scores_gemma":[0.000004079672,0.0000047799563,0.000050431667,0.0000037171599,0.0000046559962,0.000007107689,0.000009152304,0.9913521,0.00022582039,0.008129449,0.00020536782,0.000003332508],"about_ca_topic_score_codex":0.015372341,"about_ca_topic_score_gemma":0.018659689,"teacher_disagreement_score":0.015372341,"about_ca_system_score_codex":0.0018284356,"about_ca_system_score_gemma":0.0016388483,"threshold_uncertainty_score":0.030565739},"labels":[],"label_agreement":null},{"id":"W4406781069","doi":"10.1007/978-3-031-78538-2_6","title":"Multicriteria Recommendation System by Leveraging Predefined, Implicit, and Undefined Criteria","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vector Institute","funders":"","keywords":"Computer science; Operations research; Information retrieval; Mathematics","score_opus":0.01760023136798616,"score_gpt":0.26258496054434977,"score_spread":0.2449847291763636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406781069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05288811,0.0022103896,0.9366301,0.00039509308,0.0002994764,0.00019961229,0.00035230958,0.002630363,0.0043946104],"genre_scores_gemma":[0.41610608,0.0007737357,0.5721036,0.0003297674,0.0003317578,0.0001786989,0.0009496119,0.00020773707,0.009019067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964567,0.0008193646,0.00040083696,0.0010209456,0.0010656049,0.00023655337],"domain_scores_gemma":[0.99470204,0.0017663691,0.0003301669,0.0014054286,0.00158138,0.0002146342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031224354,0.0009737752,0.002743649,0.0024410659,0.0010725172,0.0022682513,0.0029076391,0.0015394709,0.0021370375],"category_scores_gemma":[0.0066064834,0.00057498727,0.0012771842,0.0027513364,0.00053543266,0.002965099,0.0014976406,0.0014852321,0.0023222861],"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.0009881023,0.00073439017,0.009539688,0.00034675747,0.0008661673,0.00033018042,0.0002749636,0.05098955,0.019916572,0.0102410205,0.018760052,0.88701254],"study_design_scores_gemma":[0.000078801924,0.00023778337,0.0019739799,0.000035933623,0.00023017716,0.0005675319,0.00007407904,0.97921354,0.006941269,0.006415937,0.0041098995,0.00012107029],"about_ca_topic_score_codex":0.007048664,"about_ca_topic_score_gemma":0.017551705,"teacher_disagreement_score":0.007048664,"about_ca_system_score_codex":0.0008507375,"about_ca_system_score_gemma":0.0017659881,"threshold_uncertainty_score":0.016513228},"labels":[],"label_agreement":null},{"id":"W4406781072","doi":"10.1007/978-3-031-78538-2_25","title":"Culture Fingerprint: Identification of Culturally Similar Urban Areas Using Google Places Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Culinary Culture and Tourism","field":"Agricultural and Biological Sciences","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 Toronto","funders":"","keywords":"Computer science; Fingerprint (computing); Identification (biology); World Wide Web; Artificial intelligence; Information retrieval","score_opus":0.034833053545907225,"score_gpt":0.2566297114298802,"score_spread":0.22179665788397301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406781072","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.74352473,0.0011506169,0.032812823,0.00028695172,0.00026757887,0.00071933557,0.19298528,0.013361463,0.014891204],"genre_scores_gemma":[0.7683608,0.000654994,0.08657784,0.00009722599,0.000113787675,0.000399978,0.13618825,0.000506524,0.0071006576],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99974734,0.000017412078,0.00001889948,0.00006466054,0.000091309535,0.000060351747],"domain_scores_gemma":[0.9997551,0.000030773877,0.00004837386,0.000040097944,0.00006816943,0.00005751033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017476184,0.0007790508,0.000437505,0.0054637915,0.0003694531,0.0008087777,0.0005098116,0.000377188,0.0030692501],"category_scores_gemma":[0.00057486724,0.00017520448,0.0006708714,0.0038060902,0.0001703509,0.00083636685,0.0012106425,0.00024715628,0.004235956],"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.0012413966,0.0005100093,0.27263558,0.0011956466,0.00066446105,0.0011536304,0.0016598327,0.005701169,0.052367933,0.0014526248,0.085968874,0.5754489],"study_design_scores_gemma":[0.00012600915,0.00036811703,0.79557705,0.00022461677,0.0004144606,0.001901391,0.009370952,0.09265769,0.03755713,0.0028359054,0.058732867,0.00023382415],"about_ca_topic_score_codex":0.021477636,"about_ca_topic_score_gemma":0.047328692,"teacher_disagreement_score":0.021477636,"about_ca_system_score_codex":0.00030389536,"about_ca_system_score_gemma":0.0004570416,"threshold_uncertainty_score":0.042705238},"labels":[],"label_agreement":null},{"id":"W4406784319","doi":"10.1007/978-981-96-0771-6_11","title":"Design of Multi-Mode Morphing Wings Based on Multi-Stable Beam-Type Metastructures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Aeroelasticity and Vibration Control","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 Toronto","funders":"","keywords":"Morphing; Computer science; Mode (computer interface); Beam (structure); Type (biology); Computer vision; Optics; Human–computer interaction; Physics; Geology","score_opus":0.023739425408842343,"score_gpt":0.24554200697907633,"score_spread":0.22180258157023397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406784319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20545356,0.0003373894,0.78592324,0.00005630737,0.000059242047,0.00006695574,0.00005613376,0.00040135763,0.00764586],"genre_scores_gemma":[0.8813391,0.00012382565,0.11577281,0.000023199567,0.0000103108205,0.00006946797,0.000056374607,0.00003575577,0.0025692503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999504,0.0000054092943,0.0000032763564,0.000014219689,0.00001727198,0.000009491841],"domain_scores_gemma":[0.99992466,0.000012408501,0.00002300719,0.00001095834,0.000019099733,0.000009873851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009682182,0.00030066678,0.00027118385,0.00021805757,0.00019777419,0.00026970764,0.00064489775,0.0004148455,0.0013033393],"category_scores_gemma":[0.00012520672,0.00018125626,0.00030702096,0.00013329704,0.00015016594,0.00025823087,0.00030264028,0.00019732589,0.0002648962],"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.00019040961,0.00007764208,0.0013963898,0.00019450946,0.000053757918,0.00021054364,0.00007883033,0.14423852,0.7408675,0.0116933845,0.0006167954,0.10038168],"study_design_scores_gemma":[0.00002600564,0.0005213454,0.0021839943,0.000018508981,0.000031623866,0.0002808572,0.00003110972,0.9423927,0.049930036,0.0013464249,0.0032155004,0.000021766939],"about_ca_topic_score_codex":0.00021086779,"about_ca_topic_score_gemma":0.0004454984,"teacher_disagreement_score":0.0013033393,"about_ca_system_score_codex":0.00014394025,"about_ca_system_score_gemma":0.00015744676,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4406800158","doi":"10.1007/978-3-031-78554-2_14","title":"A Real-Time Sentiment Feedback System: Binary Categorization and Context Understanding Based on Product Reviews","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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 Manitoba","funders":"","keywords":"Computer science; Categorization; Context (archaeology); Product (mathematics); Binary number; Sentiment analysis; Artificial intelligence; Information retrieval; Mathematics; Arithmetic","score_opus":0.024243133494449783,"score_gpt":0.26564189855210996,"score_spread":0.24139876505766017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406800158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3166757,0.0036642798,0.5195868,0.0009774573,0.0013834592,0.0021117686,0.011916222,0.13284703,0.0108372895],"genre_scores_gemma":[0.49225014,0.00069176074,0.47874108,0.00057163223,0.00073813327,0.0009831265,0.012550676,0.00108473,0.01238877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991322,0.00015323567,0.00007425145,0.00023139418,0.000357617,0.00005127429],"domain_scores_gemma":[0.99776435,0.0006966702,0.00022866116,0.00012698275,0.0010167289,0.00016664526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014170463,0.0012936082,0.0015809572,0.0028854336,0.0003862806,0.000997387,0.0010477982,0.0009819289,0.0055520176],"category_scores_gemma":[0.003146561,0.0004082458,0.0004812782,0.0013549337,0.00009576321,0.001343596,0.0007192032,0.0005494797,0.006233046],"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.0013731491,0.0007898349,0.0039587994,0.0006091058,0.00017255265,0.00018219996,0.00013166343,0.0013703457,0.120070845,0.00021641939,0.041168004,0.8299572],"study_design_scores_gemma":[0.00052671577,0.0017501473,0.035949074,0.00008557455,0.00050728716,0.00062968186,0.00027513143,0.81502014,0.12127537,0.0013425784,0.022406073,0.00023222608],"about_ca_topic_score_codex":0.0017838684,"about_ca_topic_score_gemma":0.0031154258,"teacher_disagreement_score":0.0055520176,"about_ca_system_score_codex":0.00039070458,"about_ca_system_score_gemma":0.0004313742,"threshold_uncertainty_score":0.018573344},"labels":[],"label_agreement":null},{"id":"W4406800169","doi":"10.1007/978-3-031-78554-2_17","title":"Medical Report Generation from Medical Images Using Vision Transformer and Bart Deep Learning Architectures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Transformer; Computer vision; Deep learning; Medical imaging; Electrical engineering; Engineering","score_opus":0.011354863637457269,"score_gpt":0.2946669953497657,"score_spread":0.28331213171230846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406800169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012063045,0.000472075,0.9690606,0.0005384652,0.00037327965,0.00025403636,0.0015870598,0.011918613,0.0037329767],"genre_scores_gemma":[0.24651164,0.0008691879,0.73273045,0.00038741936,0.00034237193,0.00031783583,0.0057679424,0.0012741927,0.011798975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965346,0.000044890156,0.00002581685,0.000079852754,0.00016111559,0.00003485732],"domain_scores_gemma":[0.99914443,0.000312236,0.000059648883,0.0001539942,0.00027918382,0.000050492203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008123492,0.0009099863,0.0006099746,0.0016392393,0.00019141925,0.0009886901,0.000967425,0.00078604673,0.008751392],"category_scores_gemma":[0.003040294,0.00039202292,0.0008901211,0.0008028161,0.00024145209,0.0007087249,0.0009471523,0.0009806228,0.004374963],"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.0005986842,0.00012033967,0.0009251059,0.00019997795,0.00004873545,0.00045817293,0.00005575953,0.033660475,0.03254642,0.0046877903,0.028570697,0.8981279],"study_design_scores_gemma":[0.00006283135,0.0001406106,0.00084988045,0.000041940653,0.00005197068,0.00069810025,0.000041332973,0.9038515,0.0697587,0.010624884,0.0138380155,0.000040245366],"about_ca_topic_score_codex":0.0021157528,"about_ca_topic_score_gemma":0.0025633543,"teacher_disagreement_score":0.008751392,"about_ca_system_score_codex":0.00054181484,"about_ca_system_score_gemma":0.0007774726,"threshold_uncertainty_score":0.029276311},"labels":[],"label_agreement":null},{"id":"W4406800886","doi":"10.1007/978-3-031-78554-2_18","title":"Hidden in Plain Sight: Using Contact Information to Identify Sex Trafficking in Online Advertisements","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sex work and related issues","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":"Simon Fraser University","funders":"","keywords":"Computer science; Sight; Advertising; World Wide Web; Computer security; Internet privacy; Astronomy","score_opus":0.02031764919576122,"score_gpt":0.3213969372144715,"score_spread":0.30107928801871026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406800886","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.7070308,0.002951925,0.048833434,0.002606538,0.00047617985,0.0003634508,0.0028125641,0.0012434972,0.23368168],"genre_scores_gemma":[0.87739015,0.001761458,0.05635997,0.00044239048,0.00013451984,0.0001571437,0.0014115943,0.00015273449,0.06219008],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997365,0.00008876384,0.000011040051,0.000031377618,0.00010322713,0.000029071296],"domain_scores_gemma":[0.9987515,0.0009629134,0.00009560994,0.000058941896,0.00009684052,0.000034187146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004490808,0.00026151523,0.00014226178,0.001099188,0.0004959069,0.0014488886,0.00046734652,0.0007155273,0.005681369],"category_scores_gemma":[0.003077669,0.00014640365,0.0001255575,0.00086859195,0.00030979575,0.001998891,0.0006625556,0.00042730037,0.0028028924],"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.0004688224,0.0004721951,0.0638074,0.0004096763,0.00004303223,0.00087288726,0.011833876,0.000994897,0.012531469,0.010938379,0.04298076,0.8546466],"study_design_scores_gemma":[0.00010403089,0.0010136458,0.34033948,0.0016156065,0.00051625475,0.007596553,0.07503806,0.14926949,0.054592367,0.07314917,0.2964946,0.00027073998],"about_ca_topic_score_codex":0.002855331,"about_ca_topic_score_gemma":0.008004324,"teacher_disagreement_score":0.005681369,"about_ca_system_score_codex":0.00024484016,"about_ca_system_score_gemma":0.00036844806,"threshold_uncertainty_score":0.019006073},"labels":[],"label_agreement":null},{"id":"W4406844097","doi":"10.1007/978-3-031-78980-9_8","title":"ITERADE - ITERative Anomaly Detection Ensemble for Credit Card Fraud Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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 Ottawa","funders":"","keywords":"Computer science; Credit card fraud; Anomaly detection; Credit card; Anomaly (physics); Artificial intelligence; World Wide Web; Physics","score_opus":0.016502409019085135,"score_gpt":0.25954134134901335,"score_spread":0.2430389323299282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406844097","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.03631695,0.0007456398,0.95449644,0.00025019218,0.00026874797,0.0001032532,0.00023366042,0.0060180933,0.001567099],"genre_scores_gemma":[0.40486935,0.0004459369,0.5795675,0.0003806375,0.00024817072,0.00024022389,0.0019162659,0.00055894273,0.011772943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811304,0.00037669786,0.000120375866,0.00048289803,0.0005849609,0.0003219948],"domain_scores_gemma":[0.99814713,0.0005400645,0.00008019999,0.00037808847,0.0007460452,0.00010852776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028376698,0.0014930342,0.002671673,0.0017055057,0.0009231916,0.0014268346,0.0029337674,0.0015380745,0.0026624089],"category_scores_gemma":[0.003682305,0.00074673706,0.0018978086,0.0016351762,0.00052261894,0.001930961,0.0026575488,0.002559148,0.0015844858],"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.00033112668,0.00039014284,0.005557887,0.000061386956,0.00040458015,0.00011360194,0.00010160842,0.093079396,0.007737757,0.0025556795,0.0090954555,0.88057137],"study_design_scores_gemma":[0.000010643631,0.00008118337,0.00074799935,0.0000059479735,0.000054594508,0.00008380427,0.00002121051,0.99243873,0.0031358763,0.002094322,0.0013110706,0.000014682061],"about_ca_topic_score_codex":0.007984137,"about_ca_topic_score_gemma":0.011314986,"teacher_disagreement_score":0.007984137,"about_ca_system_score_codex":0.0008153485,"about_ca_system_score_gemma":0.0019352095,"threshold_uncertainty_score":0.01587534},"labels":[],"label_agreement":null},{"id":"W4406867050","doi":"10.1007/978-3-031-78380-7","title":"Embedded Computer Systems: Architectures, Modeling, and Simulation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, San Diego; University of Ioannina; National Technical University of Athens; Julius-Maximilians-Universität Würzburg; Universität Rostock; Trakya Üniversitesi; Shanghai Jiao Tong University; Queen's University; Universidad Politécnica de Madrid; Technische Universiteit Delft; Universiteit van Amsterdam; Technische Universität Dresden; Queen's University Belfast; Indian National Science Academy; Università degli Studi di Cagliari; University of Cyprus; Aristotle University of Thessaloniki; Universidad de Málaga","keywords":"Computer science; Programming language; Software engineering","score_opus":0.01786793600667845,"score_gpt":0.2736356777514286,"score_spread":0.25576774174475014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406867050","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062428736,0.10936586,0.673172,0.0020487015,0.0033664373,0.00020882461,0.0008914869,0.004428359,0.20027544],"genre_scores_gemma":[0.1129853,0.11002371,0.27323717,0.00096471614,0.0022396804,0.00051738566,0.0023625046,0.0018070264,0.49586248],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999706,0.000047644626,0.000013143071,0.00003354975,0.00018276632,0.000016921726],"domain_scores_gemma":[0.99955827,0.00019127698,0.000025265508,0.00008890033,0.000115061375,0.000021150647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028619,0.0012716916,0.0009949062,0.0007311511,0.00025050732,0.00159476,0.0011086942,0.00094633334,0.022062527],"category_scores_gemma":[0.0010936382,0.00077652454,0.00043471606,0.0016732942,0.0005473014,0.0017801413,0.00075462245,0.0014551994,0.01284143],"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.00007143126,0.00011531143,0.00048462578,0.0012576628,0.00007003817,0.00013299493,0.0001384582,0.15254973,0.0073268698,0.13427354,0.20426726,0.49931216],"study_design_scores_gemma":[0.00003371911,0.00012271882,0.0008521275,0.00041878174,0.00005864084,0.0006469496,0.00006802768,0.24952692,0.0041896235,0.11736488,0.62667537,0.000042310705],"about_ca_topic_score_codex":0.0013807538,"about_ca_topic_score_gemma":0.0020196913,"teacher_disagreement_score":0.022062527,"about_ca_system_score_codex":0.0005218347,"about_ca_system_score_gemma":0.0008061132,"threshold_uncertainty_score":0.073806524},"labels":[],"label_agreement":null},{"id":"W4406867540","doi":"10.1007/978-3-031-78377-7","title":"Embedded Computer Systems: Architectures, Modeling, and Simulation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Embedded Systems Design Techniques","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":"University of California, San Diego; University of Ioannina; National Technical University of Athens; Julius-Maximilians-Universität Würzburg; Universität Rostock; Trakya Üniversitesi; Shanghai Jiao Tong University; Queen's University; Universidad Politécnica de Madrid; Technische Universiteit Delft; Universiteit van Amsterdam; Technische Universität Dresden; Queen's University Belfast; Indian National Science Academy; Università degli Studi di Cagliari; University of Cyprus; Aristotle University of Thessaloniki; Universidad de Málaga","keywords":"Computer science; Software engineering; Computer architecture","score_opus":0.01786793600667845,"score_gpt":0.2736356777514286,"score_spread":0.25576774174475014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406867540","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062428736,0.10936586,0.673172,0.0020487015,0.0033664373,0.00020882461,0.0008914869,0.004428359,0.20027544],"genre_scores_gemma":[0.1129853,0.11002371,0.27323717,0.00096471614,0.0022396804,0.00051738566,0.0023625046,0.0018070264,0.49586248],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999706,0.000047644626,0.000013143071,0.00003354975,0.00018276632,0.000016921726],"domain_scores_gemma":[0.99955827,0.00019127698,0.000025265508,0.00008890033,0.000115061375,0.000021150647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028619,0.0012716916,0.0009949062,0.0007311511,0.00025050732,0.00159476,0.0011086942,0.00094633334,0.022062527],"category_scores_gemma":[0.0010936382,0.00077652454,0.00043471606,0.0016732942,0.0005473014,0.0017801413,0.00075462245,0.0014551994,0.01284143],"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.00007143126,0.00011531143,0.00048462578,0.0012576628,0.00007003817,0.00013299493,0.0001384582,0.15254973,0.0073268698,0.13427354,0.20426726,0.49931216],"study_design_scores_gemma":[0.00003371911,0.00012271882,0.0008521275,0.00041878174,0.00005864084,0.0006469496,0.00006802768,0.24952692,0.0041896235,0.11736488,0.62667537,0.000042310705],"about_ca_topic_score_codex":0.0013807538,"about_ca_topic_score_gemma":0.0020196913,"teacher_disagreement_score":0.022062527,"about_ca_system_score_codex":0.0005218347,"about_ca_system_score_gemma":0.0008061132,"threshold_uncertainty_score":0.073806524},"labels":[],"label_agreement":null},{"id":"W4406870107","doi":"10.1007/978-3-031-78952-6_44","title":"From Liberating to Questioning Tabular Data in Documents Using Knowledge Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Knowledge graph; Information retrieval; World Wide Web; Data science","score_opus":0.03582358553932706,"score_gpt":0.3071033740246556,"score_spread":0.2712797884853285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406870107","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.0046157283,0.0012991277,0.9634548,0.0040702163,0.0002697914,0.00008926028,0.0006307409,0.006080867,0.019489417],"genre_scores_gemma":[0.10649274,0.0038521986,0.8353827,0.0018571186,0.00030689244,0.00016942013,0.0034077934,0.004735805,0.043795377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979943,0.00069236016,0.00015238156,0.00045526322,0.00059802405,0.00010763837],"domain_scores_gemma":[0.99098223,0.0053887162,0.0002128452,0.0025576039,0.0006667364,0.00019179696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350294,0.00079300185,0.00084336486,0.0016453579,0.0010684915,0.00558669,0.0016596335,0.0013246496,0.01646033],"category_scores_gemma":[0.01488905,0.0008597174,0.001534376,0.0023797068,0.0027944234,0.015910752,0.0050159567,0.004308606,0.008395882],"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.000117357195,0.000058547266,0.0005915599,0.00068940653,0.000048663547,0.0001450642,0.0028974486,0.0057064868,0.0049793352,0.3555425,0.053770795,0.5754528],"study_design_scores_gemma":[0.000020128142,0.000033481785,0.0003006222,0.0004025364,0.00006782225,0.00028568806,0.0013017799,0.037960954,0.011133173,0.6465859,0.30185792,0.000050071885],"about_ca_topic_score_codex":0.0029444993,"about_ca_topic_score_gemma":0.0032256395,"teacher_disagreement_score":0.01646033,"about_ca_system_score_codex":0.0012072283,"about_ca_system_score_gemma":0.0013141425,"threshold_uncertainty_score":0.055065274},"labels":[],"label_agreement":null},{"id":"W4406887032","doi":"10.1007/978-3-031-79007-2_2","title":"Towards Exploring Cross-Regional and Cross-Platform Differences in Login Throttling","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Login; Computer science; Cross-platform; Bandwidth throttling; Operating system; Computer graphics (images); Engineering","score_opus":0.07895612646373804,"score_gpt":0.2994523595525498,"score_spread":0.22049623308881175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406887032","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.937498,0.0004214918,0.02768806,0.0005309129,0.00004030382,0.00004596848,0.00062547374,0.0003721032,0.032777686],"genre_scores_gemma":[0.99241555,0.00006238038,0.0049281786,0.000047738286,0.000007486227,0.000011497796,0.00026199679,0.00007322247,0.0021920097],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999183,0.000237168,0.000033091448,0.00023339399,0.00018566508,0.00012756765],"domain_scores_gemma":[0.99426913,0.0033235846,0.0007952585,0.0005620307,0.00082977803,0.00022007508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017854747,0.00022374104,0.0002566886,0.00092231727,0.00044491547,0.0037035472,0.0006981901,0.00054442056,0.0053940094],"category_scores_gemma":[0.0105784265,0.00025065377,0.00035102424,0.0016863493,0.00055909244,0.003716426,0.0012994275,0.0010786487,0.0012624022],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013493019,0.0005780331,0.6552889,0.00029824252,0.00037878807,0.00036560366,0.009111668,0.022443518,0.031291056,0.038607355,0.0050290194,0.23525856],"study_design_scores_gemma":[0.000025223326,0.00023584734,0.8461196,0.00009999871,0.00015662021,0.00017880466,0.014674298,0.09452892,0.008732334,0.023593552,0.01157047,0.00008435565],"about_ca_topic_score_codex":0.009007765,"about_ca_topic_score_gemma":0.013319689,"teacher_disagreement_score":0.009007765,"about_ca_system_score_codex":0.00072417577,"about_ca_system_score_gemma":0.00064784515,"threshold_uncertainty_score":0.01804477},"labels":[],"label_agreement":null},{"id":"W4406933803","doi":"10.1007/978-3-031-73647-6_22","title":"Correction to: Unsupervised Physics-Inspired Shear Wave Speed Estimation in Ultrasound Elastography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Elastography; Shear (geology); Ultrasound elastography; Artificial intelligence; Ultrasound; Acoustics; Physics; Geology","score_opus":0.013005878917613458,"score_gpt":0.24862815336721159,"score_spread":0.23562227444959813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406933803","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022684408,0.00042658564,0.99339265,0.00039243427,0.0006926692,0.000034619723,0.00014948355,0.0015839419,0.0010591756],"genre_scores_gemma":[0.06569965,0.001159058,0.90472615,0.0003686995,0.0006171122,0.00011555675,0.0009221237,0.0016481801,0.024743466],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995091,0.00008442917,0.000027912982,0.00012401729,0.00022506222,0.000029526722],"domain_scores_gemma":[0.99882203,0.00034396825,0.00011639996,0.00031944714,0.0003533128,0.00004476415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007286609,0.0011984931,0.00073843665,0.0006787019,0.00048135687,0.0013647005,0.0015742081,0.0017767393,0.009207351],"category_scores_gemma":[0.0045483024,0.0006128334,0.0007182772,0.00091813895,0.00066980417,0.0016609953,0.001778975,0.0023031773,0.0050046463],"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.00028484754,0.00007591636,0.0009349933,0.0005178313,0.00013369761,0.00014328361,0.000120324825,0.090364456,0.06053706,0.029131234,0.054729734,0.76302665],"study_design_scores_gemma":[0.00003394156,0.0000772014,0.0014318306,0.0000650532,0.00004144615,0.00059795065,0.0000366198,0.86594677,0.05142967,0.028183693,0.05208774,0.00006809441],"about_ca_topic_score_codex":0.0016908959,"about_ca_topic_score_gemma":0.0029577354,"teacher_disagreement_score":0.009207351,"about_ca_system_score_codex":0.00036509824,"about_ca_system_score_gemma":0.001278948,"threshold_uncertainty_score":0.030801594},"labels":[],"label_agreement":null},{"id":"W4406940792","doi":"10.1007/978-3-031-79029-4_29","title":"ERASMO: Leveraging Large Language Models for Enhanced Clustering Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Cluster analysis; Segmentation; Artificial intelligence; Natural language processing","score_opus":0.020869791789530218,"score_gpt":0.27262742402814083,"score_spread":0.2517576322386106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406940792","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.010625023,0.0009050617,0.925997,0.00024059496,0.00029219248,0.00015475794,0.0023802873,0.05673909,0.002666],"genre_scores_gemma":[0.09535728,0.0006004477,0.86712134,0.00055462925,0.0002696934,0.00035291785,0.013809349,0.009489469,0.012444949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854445,0.00033256348,0.00007664082,0.0005462338,0.00033256094,0.00016751919],"domain_scores_gemma":[0.9982622,0.0007589298,0.00007612941,0.00043091638,0.00036471648,0.00010702743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015149646,0.0023390495,0.0018871856,0.0030714339,0.001280557,0.0030859224,0.0032425865,0.0026418287,0.010257525],"category_scores_gemma":[0.0037091537,0.0013620425,0.0027784796,0.0031036483,0.0005895453,0.0034390597,0.0027898361,0.002857481,0.01669591],"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.0008859092,0.0003796588,0.0012678246,0.00036970997,0.00045018637,0.00034833833,0.00039622773,0.06449161,0.05448545,0.006560282,0.060951315,0.80941343],"study_design_scores_gemma":[0.00004923721,0.00008137764,0.0005101349,0.000026045502,0.00009481168,0.00021135029,0.00011593593,0.9520457,0.020842545,0.012403085,0.013556961,0.00006269186],"about_ca_topic_score_codex":0.011260774,"about_ca_topic_score_gemma":0.026773866,"teacher_disagreement_score":0.011260774,"about_ca_system_score_codex":0.00092351314,"about_ca_system_score_gemma":0.0015601781,"threshold_uncertainty_score":0.03431481},"labels":[],"label_agreement":null},{"id":"W4406940898","doi":"10.1007/978-3-031-79029-4_5","title":"A Novel Genetic Algorithm Approach for Discriminative Subspace Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Discriminative model; Subspace topology; Genetic algorithm; Algorithm; Optimization algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.037909874601596304,"score_gpt":0.30212238473931813,"score_spread":0.26421251013772185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406940898","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.0026240984,0.00012489644,0.9945628,0.00007595608,0.00006130747,0.000027881535,0.000024039351,0.0003025261,0.0021965124],"genre_scores_gemma":[0.06223112,0.00019566683,0.93081146,0.00019782475,0.00009855941,0.00016805266,0.00018065891,0.00018391067,0.00593279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995421,0.00012545843,0.000016043907,0.00009360618,0.00017494525,0.00004778925],"domain_scores_gemma":[0.9995091,0.00021237152,0.000031890704,0.000058170655,0.0001591404,0.000029194918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068189856,0.0010773117,0.0011932976,0.000983977,0.0006222937,0.00089624437,0.0019566016,0.0017707648,0.0039583463],"category_scores_gemma":[0.0016645176,0.0005121019,0.00082951493,0.0015346608,0.00081656256,0.0008315496,0.0013269426,0.0014966548,0.0014699076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104911,0.00014028225,0.0003935105,0.0000686353,0.00009101428,0.00007963354,0.00005658394,0.6351205,0.006239526,0.03508281,0.005308705,0.31735775],"study_design_scores_gemma":[0.000007977529,0.000016585376,0.00003882522,0.0000036065449,0.0000058533133,0.000018158478,0.0000045749625,0.9946332,0.00036387923,0.0039999853,0.0009031199,0.0000043925415],"about_ca_topic_score_codex":0.00551594,"about_ca_topic_score_gemma":0.0073701013,"teacher_disagreement_score":0.00551594,"about_ca_system_score_codex":0.0005948001,"about_ca_system_score_gemma":0.0011806458,"threshold_uncertainty_score":0.013242006},"labels":[],"label_agreement":null},{"id":"W4406972240","doi":"10.1007/978-981-96-0957-4","title":"Provable and Practical Security","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","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":"Hubei University; Singapore Management University; Indian Statistical Institute; Xi'an University of Posts and Telecommunications; Wuhan University; Shanghai Jiao Tong University; Technische Universität Wien; East China Normal University; University of Surrey; University of Electronic Science and Technology of China; Huazhong University of Science and Technology; Hubei University of Technology; Shandong University; Sichuan University; Sun Yat-sen University; RMIT University; Florida Atlantic University; University of North Texas; University of Wollongong; Chinese Academy of Sciences; Universidad del Atlántico; Southeast University; Monash University; Kanazawa University; Wuhan University of Technology; University of Waterloo; University of New South Wales Canberra; University of New South Wales","keywords":"Computer science; Computer security; Theoretical computer science","score_opus":0.0160057927748605,"score_gpt":0.3110876364255676,"score_spread":0.2950818436507071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406972240","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010859112,0.0074464846,0.22490339,0.023960233,0.0019563988,0.00015106845,0.00065942155,0.00081810076,0.72924566],"genre_scores_gemma":[0.7124638,0.0065875254,0.05931366,0.005467999,0.004261169,0.00057330704,0.0011208107,0.0008586665,0.20935309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973726,0.00090539706,0.000116970186,0.00051353825,0.00079370406,0.00029764656],"domain_scores_gemma":[0.99567956,0.002683053,0.000157528,0.0009559082,0.00036619738,0.00015779265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022933413,0.0013288662,0.0012198787,0.0011800437,0.002679465,0.0052257422,0.0018735398,0.0023638478,0.030533006],"category_scores_gemma":[0.0068308613,0.00092812965,0.0014406595,0.0011876532,0.010478387,0.014027211,0.0042441655,0.0110841235,0.0046722284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001034993,0.000010125912,0.000014275957,0.0000475848,0.0000043554905,0.0000103313405,0.00007456463,0.00042165877,0.00007803195,0.9901923,0.005210783,0.003925619],"study_design_scores_gemma":[0.000004403589,0.0000027382957,0.000008696329,0.000008362938,0.0000018333169,0.0000121052135,0.000013653757,0.000285166,0.000043764874,0.9920338,0.0075838948,0.0000016843723],"about_ca_topic_score_codex":0.0006023567,"about_ca_topic_score_gemma":0.0005242112,"teacher_disagreement_score":0.030533006,"about_ca_system_score_codex":0.0030642601,"about_ca_system_score_gemma":0.0013182774,"threshold_uncertainty_score":0.10214311},"labels":[],"label_agreement":null},{"id":"W4406972645","doi":"10.1007/978-3-031-78241-1_16","title":"Hospital Bed Management Modelling: A Conceptual Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Operations research; Software engineering; Engineering","score_opus":0.04593013191952429,"score_gpt":0.35933402777636214,"score_spread":0.31340389585683787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406972645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006126158,0.0009317666,0.94686925,0.003364333,0.00013773421,0.00018763982,0.0009206254,0.00064254535,0.040820066],"genre_scores_gemma":[0.2812404,0.0034990543,0.6864666,0.0007426944,0.0002485867,0.000649749,0.002454373,0.00032759758,0.024370981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911803,0.00033256065,0.00008687542,0.0001495898,0.00019093056,0.00012202493],"domain_scores_gemma":[0.9992675,0.0003448919,0.00008090986,0.00006531829,0.00015136464,0.000089962065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019261874,0.00085458014,0.00044841046,0.0015752916,0.0008503202,0.0054660877,0.0037133954,0.001956175,0.008617173],"category_scores_gemma":[0.002161641,0.0008584575,0.0013610338,0.0024770787,0.0015439101,0.004722944,0.0020084928,0.0016560529,0.0018070026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017181357,0.00006726125,0.0004490436,0.00013585865,0.000022497405,0.00014357553,0.00044057236,0.08126339,0.0004980548,0.89386123,0.0046748244,0.018426552],"study_design_scores_gemma":[0.000021375548,0.000040363157,0.0004164325,0.00025217328,0.00005088066,0.00024891016,0.00064397283,0.38636625,0.00067757117,0.5044852,0.1067536,0.000043281834],"about_ca_topic_score_codex":0.012441741,"about_ca_topic_score_gemma":0.009547632,"teacher_disagreement_score":0.012441741,"about_ca_system_score_codex":0.0024384058,"about_ca_system_score_gemma":0.002882302,"threshold_uncertainty_score":0.02882731},"labels":[],"label_agreement":null},{"id":"W4406984438","doi":"10.1007/978-3-031-80507-3_13","title":"Chronic Wound Assessment with Semi-supervised Hierarchical CNNs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diabetic Foot Ulcer Assessment and Management","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.012542081375574407,"score_gpt":0.2782209213232374,"score_spread":0.265678839947663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406984438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15252817,0.0052463524,0.81761444,0.00071084726,0.000680972,0.00053878623,0.0050194953,0.0061402856,0.011520763],"genre_scores_gemma":[0.76841027,0.0018173165,0.20859374,0.0006478593,0.0004132168,0.0002874091,0.006233332,0.00039830676,0.013198557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996904,0.000048798574,0.000018955512,0.000104199666,0.000064922795,0.00007273872],"domain_scores_gemma":[0.9996458,0.000099806624,0.000036930636,0.000061014056,0.0001289665,0.000027424085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062912423,0.0010843632,0.000721162,0.00085020025,0.00019515968,0.00079331326,0.00086316443,0.0008713698,0.002969756],"category_scores_gemma":[0.0012326327,0.0004217475,0.0009803833,0.0006095306,0.00015204027,0.0005594317,0.0008386144,0.0007041774,0.001667795],"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.0005999423,0.00026293003,0.007888278,0.00024392562,0.0002998094,0.00025022507,0.000042602303,0.038127962,0.017097965,0.0004612175,0.01700147,0.91772366],"study_design_scores_gemma":[0.000029005807,0.00023492097,0.011269009,0.00009697479,0.00016530062,0.00053404446,0.000046436235,0.9713327,0.011048602,0.0016384845,0.0035717825,0.000032684282],"about_ca_topic_score_codex":0.0062773013,"about_ca_topic_score_gemma":0.0127948355,"teacher_disagreement_score":0.0062773013,"about_ca_system_score_codex":0.00033133422,"about_ca_system_score_gemma":0.0004954115,"threshold_uncertainty_score":0.012481511},"labels":[],"label_agreement":null},{"id":"W4407002447","doi":"10.1007/978-3-031-79038-6_13","title":"Gender-Neutral English to Portuguese Machine Translator: Promoting Inclusive Language","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text Readability and Simplification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Portuguese; Computer science; Natural language processing; Linguistics; Artificial intelligence; Programming language; Philosophy","score_opus":0.012572199068466254,"score_gpt":0.26164184440604965,"score_spread":0.24906964533758338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407002447","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17688347,0.001835993,0.21924952,0.014982424,0.0040314766,0.0004532116,0.0014307213,0.0062219277,0.5749113],"genre_scores_gemma":[0.73442966,0.001368819,0.08852552,0.0030170765,0.0007001492,0.00034567143,0.0014683129,0.0060583763,0.16408639],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969831,0.0015376922,0.00012744238,0.0004066152,0.0007058118,0.00023927737],"domain_scores_gemma":[0.99431026,0.0025352356,0.00030569625,0.0009574063,0.0013951225,0.0004962744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036835435,0.00062056957,0.00039958488,0.0005986009,0.0017429764,0.0026583222,0.0009331968,0.0008815448,0.021457912],"category_scores_gemma":[0.011786998,0.00031930435,0.00024449095,0.00050631247,0.0012653911,0.0038030015,0.003692769,0.0016743587,0.011973536],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064196385,0.0004080907,0.0030283995,0.0011904608,0.000017560762,0.002721792,0.0584455,0.0007728814,0.06181962,0.09871517,0.11787452,0.65436405],"study_design_scores_gemma":[0.0000979764,0.0005043408,0.0061628837,0.0010255954,0.00008198947,0.0042931214,0.02585565,0.0063181696,0.060206447,0.044008058,0.8513273,0.000118610595],"about_ca_topic_score_codex":0.0009574732,"about_ca_topic_score_gemma":0.0022162274,"teacher_disagreement_score":0.021457912,"about_ca_system_score_codex":0.0006133047,"about_ca_system_score_gemma":0.0030883776,"threshold_uncertainty_score":0.07178384},"labels":[],"label_agreement":null},{"id":"W4407008409","doi":"10.1007/978-3-031-78459-0_29","title":"Predicting Characteristics of Salmon Return Migration Using Machine Learning Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fish Ecology and Management Studies","field":"Environmental 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":"Fisheries and Oceans Canada","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.016176558101337172,"score_gpt":0.21972466336573768,"score_spread":0.2035481052644005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407008409","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.9471888,0.00024521622,0.050122384,0.00014799272,0.00003500219,0.0000144744145,0.00042950764,0.00025509932,0.0015614325],"genre_scores_gemma":[0.9902028,0.00007534917,0.007143782,0.000013487388,0.000017519233,0.0000097874145,0.0005874611,0.000032121305,0.0019176997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999316,0.000014556167,0.000005359298,0.000023608543,0.000011171739,0.00001365787],"domain_scores_gemma":[0.998767,0.00086240715,0.0001534645,0.000062737716,0.00010760979,0.00004681639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496624,0.00036246443,0.0002869044,0.0007881288,0.00017554744,0.0005421953,0.00044267357,0.00046615326,0.0017753621],"category_scores_gemma":[0.0021579168,0.00024563447,0.00051489304,0.00064967346,0.00016113304,0.00066725025,0.00020891457,0.0005467484,0.000671022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032428195,0.0001939418,0.20210709,0.00004184533,0.00011926754,0.00017979738,0.000058760124,0.6799875,0.0055593485,0.00091176736,0.0018785137,0.10863782],"study_design_scores_gemma":[0.0000023644602,0.000026668431,0.020154396,0.0000033497956,0.000008109904,0.000028382792,0.00001606187,0.97865343,0.0004713212,0.0005345452,0.00009584411,0.000005475794],"about_ca_topic_score_codex":0.003916624,"about_ca_topic_score_gemma":0.00585148,"teacher_disagreement_score":0.003916624,"about_ca_system_score_codex":0.00034068225,"about_ca_system_score_gemma":0.00017833659,"threshold_uncertainty_score":0.007787645},"labels":[],"label_agreement":null},{"id":"W4407025461","doi":"10.1007/978-981-96-0954-3","title":"Provable and Practical Security","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cybersecurity and Cyber Warfare Studies","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hubei University; Singapore Management University; Indian Statistical Institute; Xi'an University of Posts and Telecommunications; Wuhan University; Shanghai Jiao Tong University; Technische Universität Wien; East China Normal University; University of Surrey; University of Electronic Science and Technology of China; Huazhong University of Science and Technology; Hubei University of Technology; Shandong University; Sichuan University; Sun Yat-sen University; RMIT University; Florida Atlantic University; University of North Texas; University of Wollongong; Chinese Academy of Sciences; Universidad del Atlántico; Southeast University; Monash University; Kanazawa University; Wuhan University of Technology; University of Waterloo; University of New South Wales Canberra; University of New South Wales","keywords":"Computer science; Computer security","score_opus":0.0160057927748605,"score_gpt":0.3110876364255676,"score_spread":0.2950818436507071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407025461","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010859112,0.0074464846,0.22490339,0.023960233,0.0019563988,0.00015106845,0.00065942155,0.00081810076,0.72924566],"genre_scores_gemma":[0.7124638,0.0065875254,0.05931366,0.005467999,0.004261169,0.00057330704,0.0011208107,0.0008586665,0.20935309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973726,0.00090539706,0.000116970186,0.00051353825,0.00079370406,0.00029764656],"domain_scores_gemma":[0.99567956,0.002683053,0.000157528,0.0009559082,0.00036619738,0.00015779265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022933413,0.0013288662,0.0012198787,0.0011800437,0.002679465,0.0052257422,0.0018735398,0.0023638478,0.030533006],"category_scores_gemma":[0.0068308613,0.00092812965,0.0014406595,0.0011876532,0.010478387,0.014027211,0.0042441655,0.0110841235,0.0046722284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001034993,0.000010125912,0.000014275957,0.0000475848,0.0000043554905,0.0000103313405,0.00007456463,0.00042165877,0.00007803195,0.9901923,0.005210783,0.003925619],"study_design_scores_gemma":[0.000004403589,0.0000027382957,0.000008696329,0.000008362938,0.0000018333169,0.0000121052135,0.000013653757,0.000285166,0.000043764874,0.9920338,0.0075838948,0.0000016843723],"about_ca_topic_score_codex":0.0006023567,"about_ca_topic_score_gemma":0.0005242112,"teacher_disagreement_score":0.030533006,"about_ca_system_score_codex":0.0030642601,"about_ca_system_score_gemma":0.0013182774,"threshold_uncertainty_score":0.10214311},"labels":[],"label_agreement":null},{"id":"W4407126070","doi":"10.1007/978-3-031-83438-7_16","title":"Algorithms and Hardness Results for the (3, 1)-Cover Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cover (algebra); Algorithm; Theoretical computer science; Mechanical engineering; Engineering","score_opus":0.02337062143164717,"score_gpt":0.25785019098540135,"score_spread":0.23447956955375418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407126070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12450547,0.011388521,0.5196059,0.02942491,0.0019055502,0.0009716744,0.0076333922,0.0033353723,0.3012292],"genre_scores_gemma":[0.42705414,0.011161851,0.42500377,0.007118861,0.0046715047,0.0021183807,0.01623493,0.0029565603,0.10367997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972119,0.0005659225,0.00014663444,0.0007533963,0.00083542266,0.00048673293],"domain_scores_gemma":[0.9893974,0.008456035,0.0004990138,0.0009640601,0.0003080313,0.00037533825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514806,0.0028944088,0.0026291357,0.002098014,0.0036348503,0.008793257,0.0063655213,0.005588608,0.02974703],"category_scores_gemma":[0.010299397,0.002053086,0.0047005913,0.005591555,0.00386196,0.018191617,0.0052196723,0.014827789,0.0053012613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012412725,0.0010097608,0.0016998154,0.0019243456,0.00023531224,0.0003152359,0.0007886541,0.049659006,0.004396631,0.6761216,0.1191728,0.14343569],"study_design_scores_gemma":[0.00019900381,0.00006214542,0.0007411878,0.00013282911,0.00010698473,0.00034299394,0.00015653422,0.052112103,0.001894975,0.92573816,0.018460933,0.000052201594],"about_ca_topic_score_codex":0.002659912,"about_ca_topic_score_gemma":0.0027562159,"teacher_disagreement_score":0.02974703,"about_ca_system_score_codex":0.004050758,"about_ca_system_score_gemma":0.002781701,"threshold_uncertainty_score":0.09951377},"labels":[],"label_agreement":null},{"id":"W4407127179","doi":"10.1007/978-3-031-83438-7","title":"Algorithms and Discrete Applied Mathematics","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Indian Statistical Institute; Univerza v Mariboru; Indian Institute of Technology Kharagpur; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Freie Universität Berlin; Indian Institute of Technology Delhi; Technische Universiteit Eindhoven; Indian Institute of Technology Bhilai; University of Ottawa; Indian Institute of Technology Gandhinagar; University of Lethbridge; Indian Institute of Technology Kanpur; Indian Institute of Science","keywords":"Computer science; Theoretical computer science; Algorithm; Computer graphics (images); Algebra over a field; Mathematics; Pure mathematics","score_opus":0.009227838638047612,"score_gpt":0.23569103056477958,"score_spread":0.22646319192673198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407127179","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030805715,0.047249753,0.08648414,0.0044823335,0.0045483494,0.000074089585,0.0005654203,0.00060114847,0.85291415],"genre_scores_gemma":[0.072669886,0.048134845,0.04548722,0.0017854943,0.006488853,0.000283653,0.0010794965,0.0007950392,0.82327545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957424,0.00008044413,0.00001835153,0.000075375705,0.00021351165,0.000038036425],"domain_scores_gemma":[0.9996176,0.0001818907,0.000018608667,0.000082268634,0.00006577011,0.000033906566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035048253,0.001372576,0.0016976141,0.0017283601,0.0012331471,0.0042980146,0.0010419522,0.00073920866,0.045519654],"category_scores_gemma":[0.0012064208,0.0005269804,0.0006132915,0.004397611,0.0020084851,0.0038904704,0.0012973783,0.0037183824,0.021583451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019384497,0.00003191236,0.000076807824,0.0003235038,0.000013838593,0.000020773257,0.00011348517,0.0010389091,0.0005139499,0.7469632,0.11142826,0.13945608],"study_design_scores_gemma":[0.0000133204685,0.000017453907,0.00023158522,0.00009731351,0.000010154109,0.00011492465,0.000047613164,0.0024145097,0.00025076012,0.60373,0.39306387,0.000008437341],"about_ca_topic_score_codex":0.00072676665,"about_ca_topic_score_gemma":0.0010010818,"teacher_disagreement_score":0.045519654,"about_ca_system_score_codex":0.0019264193,"about_ca_system_score_gemma":0.0010745242,"threshold_uncertainty_score":0.15227842},"labels":[],"label_agreement":null},{"id":"W4407147460","doi":"10.1007/978-3-031-81101-2_2","title":"Weakly Supervised Intracranial Hemorrhage Segmentation with YOLO and an Uncertainty Rectified Segment Anything Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intracerebral and Subarachnoid Hemorrhage Research","field":"Medicine","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":"NeuroRx Research (Canada); Concordia University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Computer vision","score_opus":0.01838541253934971,"score_gpt":0.28019015560294547,"score_spread":0.26180474306359575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407147460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01790212,0.0009468897,0.97809726,0.00031209568,0.00008993611,0.000060483748,0.00028828863,0.0011037776,0.0011992545],"genre_scores_gemma":[0.44921127,0.0010272361,0.5326384,0.0005803884,0.0003674109,0.0003411885,0.0024460887,0.0005785633,0.012809459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996388,0.00006178478,0.0000213333,0.000157585,0.00006104889,0.000059505855],"domain_scores_gemma":[0.99961925,0.00015756705,0.000047798818,0.000058477217,0.000089135145,0.000027760138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010739123,0.0008774838,0.0015956295,0.00070766895,0.00046040944,0.0013095072,0.0017710102,0.0018834305,0.0017406829],"category_scores_gemma":[0.0013815113,0.0007084848,0.0015890192,0.00073048903,0.00062275317,0.0009990176,0.0013757331,0.0013709513,0.0008803496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008160872,0.00016426068,0.0015947459,0.0002838905,0.00025455194,0.0002445985,0.00016900747,0.4958293,0.022104993,0.011131151,0.007869804,0.4595376],"study_design_scores_gemma":[0.000006246026,0.000032705993,0.00015059544,0.000008707748,0.00001938716,0.000024507457,0.0000071690165,0.996209,0.0012718831,0.0017056392,0.0005575487,0.000006556119],"about_ca_topic_score_codex":0.008576257,"about_ca_topic_score_gemma":0.009563973,"teacher_disagreement_score":0.008576257,"about_ca_system_score_codex":0.0007409811,"about_ca_system_score_gemma":0.0012127305,"threshold_uncertainty_score":0.01705265},"labels":[],"label_agreement":null},{"id":"W4407147495","doi":"10.1007/978-3-031-81101-2_12","title":"A Multi-modal Deep Learning Framework for Final Infarct Prediction in Acute Ischemic Stroke: Combining CTA, NCCT, and Clinical Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acute Ischemic Stroke Management","field":"Medicine","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Computer science; Modal; Artificial intelligence; Stroke (engine); Ischemic stroke; Cardiology; Medicine; Ischemia; Engineering","score_opus":0.042517697085299504,"score_gpt":0.34034020118782893,"score_spread":0.2978225041025294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407147495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022411887,0.004138338,0.96219903,0.001171579,0.00030773832,0.000079374855,0.0015121792,0.003916139,0.004263758],"genre_scores_gemma":[0.38748223,0.0043807793,0.58101696,0.0011866796,0.0005574832,0.00023637242,0.0051765842,0.00041777195,0.019545132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980074,0.00003828862,0.000012841286,0.0000553758,0.00005390064,0.000038895807],"domain_scores_gemma":[0.9997236,0.00010575712,0.00001723565,0.000029986868,0.000092763476,0.00003059785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208752,0.0009932441,0.0008250315,0.00069517747,0.00028697826,0.00089308,0.0014359321,0.0010376134,0.0034384292],"category_scores_gemma":[0.0009608818,0.0005084087,0.001121216,0.0006826779,0.00022417387,0.0007956761,0.0013487232,0.0016435981,0.0014289009],"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.00013746969,0.00019840372,0.0021561212,0.00008467558,0.00021196259,0.0001238739,0.00003965687,0.13567446,0.0051433207,0.0037061006,0.023013994,0.82951],"study_design_scores_gemma":[0.0000068326804,0.000041837964,0.00058856583,0.000022318025,0.00004054552,0.00007177239,0.00000716798,0.99135876,0.0014108972,0.004443099,0.0019948424,0.000013350235],"about_ca_topic_score_codex":0.011155943,"about_ca_topic_score_gemma":0.021341419,"teacher_disagreement_score":0.011155943,"about_ca_system_score_codex":0.0005435253,"about_ca_system_score_gemma":0.0010627902,"threshold_uncertainty_score":0.022181988},"labels":[],"label_agreement":null},{"id":"W4407147636","doi":"10.1007/978-3-031-81101-2_9","title":"Spatio-Temporal Deep Learning for Final Infarct Prediction Using Acute Stroke CT Perfusion Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Acute Ischemic Stroke Management","field":"Medicine","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":"Alberta Children's Hospital; Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Computer science; Acute stroke; Artificial intelligence; Deep learning; Stroke (engine); Perfusion scanning; Perfusion; Radiology; Internal medicine; Medicine; Engineering","score_opus":0.03720091759030153,"score_gpt":0.2964030202953699,"score_spread":0.2592021027050684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407147636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047112785,0.007791717,0.9311412,0.0010916212,0.0005720171,0.000075074015,0.0021941161,0.0031617938,0.0068597007],"genre_scores_gemma":[0.5209479,0.00980494,0.42149675,0.0005887805,0.00054801087,0.00017410859,0.0070174932,0.00050066604,0.038921487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991,0.000010837653,0.000006497245,0.000029832026,0.000023077302,0.000019605186],"domain_scores_gemma":[0.99981755,0.000086643406,0.000012850801,0.000021956956,0.000047185167,0.000013827743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046394384,0.00093088043,0.0005074145,0.0005037162,0.00016762908,0.000610622,0.0008504486,0.00072237465,0.0035830422],"category_scores_gemma":[0.0006572389,0.0003878858,0.0008922865,0.0006611254,0.00019304376,0.00063067337,0.0006225764,0.0011944239,0.0016698146],"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.00013337792,0.000114677794,0.001672362,0.00012069772,0.00009908913,0.00014276947,0.00003500168,0.118282616,0.0118323825,0.003297638,0.019239565,0.84502983],"study_design_scores_gemma":[0.0000052354007,0.00005152467,0.00079102913,0.000026276626,0.000032828466,0.00008750668,0.000009846596,0.98641413,0.004539277,0.0051047117,0.002926811,0.00001072253],"about_ca_topic_score_codex":0.006154039,"about_ca_topic_score_gemma":0.011947553,"teacher_disagreement_score":0.006154039,"about_ca_system_score_codex":0.0003746013,"about_ca_system_score_gemma":0.0005603165,"threshold_uncertainty_score":0.012236416},"labels":[],"label_agreement":null},{"id":"W4407147701","doi":"10.1007/978-3-031-81101-2_3","title":"Bayesian Uncertainty Estimation Improves nnU-Net Generalization to Unseen Sites for Stroke Lesion Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Generalization; Computer science; Segmentation; Bayesian probability; Artificial intelligence; Estimation; Pattern recognition (psychology); Machine learning; Mathematics; Management","score_opus":0.023513669516403952,"score_gpt":0.29481371833575276,"score_spread":0.2713000488193488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407147701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12784694,0.003196659,0.8499614,0.0010024676,0.00052394863,0.00015001756,0.0014329096,0.008928082,0.006957642],"genre_scores_gemma":[0.76627,0.0009682647,0.21401513,0.0007817793,0.0003197258,0.00011173844,0.0036567585,0.0012181833,0.01265856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00012721065,0.000042889584,0.00022626141,0.0001324617,0.000093295464],"domain_scores_gemma":[0.99776816,0.0011394309,0.00011374554,0.00033211455,0.00053089974,0.00011571618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024423723,0.0016063628,0.0017446497,0.0016078386,0.00080379174,0.0015644594,0.0023769485,0.0032779719,0.0043203826],"category_scores_gemma":[0.005256397,0.00090315286,0.0013750121,0.0011659069,0.00058800995,0.0021230115,0.0017892843,0.002245455,0.0020438442],"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.0006959365,0.0001992482,0.003153784,0.000114805225,0.00022231389,0.00015426295,0.000094948955,0.3656741,0.008380112,0.0023905875,0.011387857,0.607532],"study_design_scores_gemma":[0.0000055270866,0.000022710901,0.00037070466,0.000011211339,0.000017934388,0.000022934364,0.000010242807,0.99542207,0.0016572188,0.0021285047,0.00032410029,0.000006822321],"about_ca_topic_score_codex":0.023420572,"about_ca_topic_score_gemma":0.026328614,"teacher_disagreement_score":0.023420572,"about_ca_system_score_codex":0.0014659069,"about_ca_system_score_gemma":0.0010901719,"threshold_uncertainty_score":0.046568513},"labels":[],"label_agreement":null},{"id":"W4407153097","doi":"10.1007/978-3-031-78338-8_3","title":"A Tree-Based Definition of Business Process Conformance","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Business process; Tree (set theory); Process (computing); Software engineering; Programming language; Work in process; Mathematics","score_opus":0.020679168812557075,"score_gpt":0.22832609419219205,"score_spread":0.20764692537963497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407153097","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.002051099,0.00022520954,0.99251443,0.00022213515,0.000054841013,0.00008344268,0.00014279643,0.00032456752,0.004381513],"genre_scores_gemma":[0.109333895,0.00070237555,0.884016,0.0003635823,0.00015086625,0.00042266582,0.0009153971,0.0003332339,0.003762096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995902,0.0010992904,0.00062526704,0.0007529138,0.0013588686,0.0002616136],"domain_scores_gemma":[0.99587977,0.0017031627,0.0004246714,0.0007004907,0.0011462279,0.00014573502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035268422,0.00092621404,0.0007533622,0.0032583135,0.0012310229,0.0035301785,0.002240157,0.001990078,0.0035360006],"category_scores_gemma":[0.00818102,0.00085292134,0.0022557343,0.004008471,0.003097804,0.0071218433,0.0019931877,0.0041792523,0.0015180266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003097161,0.000035906804,0.0004436307,0.00012392188,0.000038331444,0.0002805583,0.00082759216,0.008834564,0.0032558201,0.94096345,0.0022030347,0.042962313],"study_design_scores_gemma":[0.000020846237,0.0000967477,0.0004113038,0.00020393722,0.000110498615,0.0006988991,0.00023844243,0.10938165,0.003601533,0.8225874,0.062598504,0.00005030548],"about_ca_topic_score_codex":0.004430744,"about_ca_topic_score_gemma":0.002335616,"teacher_disagreement_score":0.004430744,"about_ca_system_score_codex":0.0012120554,"about_ca_system_score_gemma":0.0013574441,"threshold_uncertainty_score":0.018651903},"labels":[],"label_agreement":null},{"id":"W4407154822","doi":"10.1007/978-3-031-83438-7_11","title":"Partial Domination in Some Geometric Intersection Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Intersection (aeronautics); Cartography","score_opus":0.012138250007856694,"score_gpt":0.24623611314331187,"score_spread":0.23409786313545516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407154822","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.5138943,0.0015591462,0.18003207,0.0018062918,0.00013169437,0.00014060621,0.000851623,0.0003596331,0.30122456],"genre_scores_gemma":[0.9069766,0.0011586872,0.03844552,0.00029456883,0.00015639569,0.00016395147,0.0008447869,0.00026259903,0.05169694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992663,0.00015107142,0.00003128841,0.0001425699,0.00027594017,0.0001327993],"domain_scores_gemma":[0.99767166,0.0014772927,0.00019647031,0.00020664251,0.0002555637,0.00019229374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062708854,0.00052404485,0.00093373714,0.0021717232,0.0028803933,0.0028283428,0.0016204865,0.0008696653,0.0087800175],"category_scores_gemma":[0.0032261468,0.00087814534,0.0009503007,0.0038745776,0.0024350109,0.0038118423,0.0019785874,0.0026773557,0.00057111506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039022296,0.000021928554,0.0004526754,0.000065455766,0.000016490712,0.00013416006,0.00047182027,0.0037988517,0.00088056724,0.97807795,0.002734766,0.013306158],"study_design_scores_gemma":[0.00001394896,0.000010265583,0.00045938033,0.000023035702,0.000024192259,0.00028850444,0.00023563152,0.012824155,0.0008414559,0.9783059,0.006964076,0.000009465696],"about_ca_topic_score_codex":0.002421666,"about_ca_topic_score_gemma":0.002852956,"teacher_disagreement_score":0.0087800175,"about_ca_system_score_codex":0.0018724593,"about_ca_system_score_gemma":0.00062163273,"threshold_uncertainty_score":0.029372156},"labels":[],"label_agreement":null},{"id":"W4407154831","doi":"10.1007/978-3-031-83438-7_18","title":"A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Lethbridge","funders":"","keywords":"Computer science; Binary tree; Algorithm; Binary number; Quadratic equation; Sink (geography); Tree (set theory); Optimal binary search tree; Theoretical computer science; K-ary tree; Tree structure; Mathematics; Combinatorics; Arithmetic; Cartography","score_opus":0.019511453772232845,"score_gpt":0.22682568990912885,"score_spread":0.207314236136896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407154831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016683988,0.0006159303,0.96784616,0.0009456296,0.00019185238,0.00030590224,0.0005237712,0.0016269395,0.011259872],"genre_scores_gemma":[0.11410317,0.00034872722,0.8697114,0.0004132381,0.00016275763,0.0005313813,0.0013503729,0.00061578344,0.012763219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987935,0.0003200845,0.000060099494,0.00030530067,0.00028673507,0.00023426392],"domain_scores_gemma":[0.9975478,0.0016482542,0.00012582194,0.00028948084,0.0002444811,0.00014410223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497029,0.0017319699,0.00252105,0.0011430151,0.0012817419,0.002272671,0.0038242186,0.0022835734,0.018578185],"category_scores_gemma":[0.0051430184,0.000957677,0.0010355603,0.0029295916,0.0010620058,0.0048145456,0.0034538272,0.0029886272,0.0035395978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000830968,0.000612843,0.0004786547,0.00059196923,0.00008811379,0.000102807586,0.00029352208,0.48693934,0.0044964436,0.05373193,0.040460337,0.4113731],"study_design_scores_gemma":[0.00019913673,0.000112285226,0.00015344833,0.000024418634,0.000020309253,0.00006025047,0.00009157368,0.94877666,0.000721998,0.0464029,0.00342288,0.000014062965],"about_ca_topic_score_codex":0.0058399304,"about_ca_topic_score_gemma":0.008366061,"teacher_disagreement_score":0.018578185,"about_ca_system_score_codex":0.0020335072,"about_ca_system_score_gemma":0.002553192,"threshold_uncertainty_score":0.06215018},"labels":[],"label_agreement":null},{"id":"W4407155693","doi":"10.1007/978-3-031-81101-2_11","title":"Final Stroke Infarct Segmentation Using Deep Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Computer science; Artificial neural network; Artificial intelligence; Segmentation; Deep neural networks; Stroke (engine); Pattern recognition (psychology); Engineering; Aerospace engineering","score_opus":0.04283514338935975,"score_gpt":0.28070843212295216,"score_spread":0.2378732887335924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407155693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030965151,0.0021235335,0.942002,0.00070927467,0.000497581,0.00020322009,0.0025771803,0.009382144,0.011539904],"genre_scores_gemma":[0.26288337,0.0025060896,0.6688505,0.0008752812,0.00034674327,0.0002336006,0.007954814,0.0030440018,0.05330551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981314,0.000009892844,0.00001254998,0.0000518753,0.00004317775,0.00006950095],"domain_scores_gemma":[0.99978405,0.000042664233,0.000018636385,0.000050635277,0.00007657206,0.000027564889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052348094,0.0017016749,0.0012352573,0.0017597316,0.00055608037,0.0023675156,0.00088895875,0.0016839379,0.008645011],"category_scores_gemma":[0.0007519704,0.0007396657,0.0014680009,0.00092120667,0.00033190296,0.0008779261,0.00094936,0.0012889986,0.0075894175],"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.0006060943,0.00013244309,0.0020138107,0.0002802486,0.00015344369,0.0004778259,0.00010547548,0.033160184,0.052291542,0.0044695563,0.037343454,0.8689659],"study_design_scores_gemma":[0.000056950084,0.00020867384,0.0053736256,0.0002857019,0.0003173281,0.0017669137,0.00015503123,0.76006454,0.14876518,0.03352025,0.049375024,0.00011082236],"about_ca_topic_score_codex":0.0064825793,"about_ca_topic_score_gemma":0.012186662,"teacher_disagreement_score":0.008645011,"about_ca_system_score_codex":0.0006363483,"about_ca_system_score_gemma":0.0016960842,"threshold_uncertainty_score":0.028920412},"labels":[],"label_agreement":null},{"id":"W4407189050","doi":"10.1007/978-3-031-82670-2_18","title":"Representing Hypergraphs by Point-Line Incidences","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Point (geometry); Line (geometry); Theoretical computer science; Mathematics; Geometry","score_opus":0.013225429642853382,"score_gpt":0.24809922291847442,"score_spread":0.23487379327562102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189050","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015718756,0.0002891585,0.9495155,0.00019470826,0.0001377612,0.00006683083,0.00068332057,0.0026271057,0.030766748],"genre_scores_gemma":[0.31908622,0.0016359179,0.6257321,0.00021694125,0.00018401498,0.00019444773,0.0025304991,0.0014093627,0.04901048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949574,0.00015495719,0.000040713123,0.000103200015,0.00014196296,0.00006345442],"domain_scores_gemma":[0.9989907,0.0004064345,0.000080164806,0.00025554627,0.00020278514,0.00006439654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052671396,0.0008004176,0.0005407888,0.002079939,0.00070587936,0.0034509106,0.0013962446,0.00082180003,0.019665066],"category_scores_gemma":[0.002423692,0.0006359078,0.00080137805,0.003765988,0.00084769627,0.0057495134,0.0018984175,0.0016984312,0.0055583976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009597826,0.00007037037,0.00040786504,0.00016596561,0.000026246857,0.00016619591,0.0004408815,0.034658406,0.0040065404,0.77540344,0.012085829,0.17247227],"study_design_scores_gemma":[0.000021604033,0.000027090087,0.000119723074,0.000074027594,0.00003538852,0.00017403183,0.00016580707,0.115974076,0.005541562,0.8218418,0.05599566,0.000029225605],"about_ca_topic_score_codex":0.0013039353,"about_ca_topic_score_gemma":0.0017223408,"teacher_disagreement_score":0.019665066,"about_ca_system_score_codex":0.00071968796,"about_ca_system_score_gemma":0.00032152268,"threshold_uncertainty_score":0.06578618},"labels":[],"label_agreement":null},{"id":"W4407189119","doi":"10.1007/978-3-031-82670-2_1","title":"Distributed Computing by Mobile Robots: Exploring the Computational Landscape (Extended Abstract)","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile robot; Distributed computing; Robot; Human–computer interaction; Theoretical computer science; Artificial intelligence","score_opus":0.022312432559130575,"score_gpt":0.2629811802111595,"score_spread":0.24066874765202895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189119","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025845192,0.1310558,0.6140293,0.008943475,0.002771565,0.00011587775,0.0002698233,0.0008357054,0.21613331],"genre_scores_gemma":[0.5019203,0.08827612,0.25028074,0.0018944908,0.0031010958,0.00040047793,0.00051027664,0.00066955213,0.15294702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998826,0.000027496426,0.0000032400173,0.00003969932,0.000033654385,0.000013434636],"domain_scores_gemma":[0.99982905,0.00010943565,0.000008720724,0.000018115104,0.00001611524,0.00001859841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019119853,0.0004949395,0.0006961716,0.0003921552,0.00046907752,0.0022355213,0.00084458326,0.0007579846,0.010593734],"category_scores_gemma":[0.00065453566,0.00028052292,0.00046262832,0.0015252031,0.0012498291,0.0020922439,0.0009589585,0.0012447954,0.0016846821],"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.000090940666,0.00009079959,0.0005178514,0.0011458392,0.00006980295,0.0002295274,0.0006346328,0.07590014,0.0056745284,0.5725688,0.063200794,0.27987638],"study_design_scores_gemma":[0.00003749997,0.00006586498,0.00066533516,0.00021987491,0.00002927821,0.00031475478,0.0002499551,0.09879071,0.001440134,0.71489364,0.18327048,0.000022395243],"about_ca_topic_score_codex":0.0010496441,"about_ca_topic_score_gemma":0.0011772341,"teacher_disagreement_score":0.010593734,"about_ca_system_score_codex":0.0005696019,"about_ca_system_score_gemma":0.00046806454,"threshold_uncertainty_score":0.03543961},"labels":[],"label_agreement":null},{"id":"W4407189123","doi":"10.1007/978-3-031-82670-2_22","title":"Forest Covers and Bounded Forest Covers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Lethbridge","funders":"","keywords":"Computer science; Bounded function; Forestry; Mathematics; Geography","score_opus":0.010735096830525388,"score_gpt":0.2349479379335112,"score_spread":0.2242128411029858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189123","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061404604,0.013302585,0.3096132,0.0010081462,0.0007153198,0.00010661299,0.0012295172,0.00069940754,0.6119206],"genre_scores_gemma":[0.57531536,0.015236162,0.12492246,0.0006738396,0.00096141157,0.00023017888,0.0029913988,0.0012325465,0.27843654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997404,0.000026859494,0.000009149584,0.00006032814,0.00011870363,0.00004455302],"domain_scores_gemma":[0.99962044,0.00018391441,0.000023080434,0.00007664413,0.000051061354,0.00004484734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015053539,0.00047465813,0.0004791577,0.001269356,0.0007642152,0.0019736306,0.0007140672,0.000615437,0.020963086],"category_scores_gemma":[0.0009859082,0.00046167188,0.0004975546,0.0017704455,0.0010120884,0.0030491278,0.0014492624,0.001515453,0.0031434724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042611107,0.000017574517,0.00018347734,0.0001917543,0.000010425703,0.00012665425,0.00018445104,0.0063729137,0.0033665402,0.86422616,0.018432295,0.1068452],"study_design_scores_gemma":[0.000007189439,0.000023196995,0.0007433828,0.00009497914,0.00002003971,0.0006475727,0.0001429936,0.011784806,0.0021130887,0.8412024,0.1432071,0.000013181739],"about_ca_topic_score_codex":0.0009790522,"about_ca_topic_score_gemma":0.0012442251,"teacher_disagreement_score":0.020963086,"about_ca_system_score_codex":0.00067700294,"about_ca_system_score_gemma":0.00022986191,"threshold_uncertainty_score":0.07012844},"labels":[],"label_agreement":null},{"id":"W4407189250","doi":"10.1007/978-3-031-82670-2_23","title":"Multi-agent Search-Type Problems on Polygons","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Type (biology)","score_opus":0.04104181170680093,"score_gpt":0.2888128697729929,"score_spread":0.24777105806619198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189250","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019469567,0.0016681635,0.9070778,0.0010031213,0.00032152986,0.0001310229,0.00029534125,0.00013647047,0.06989698],"genre_scores_gemma":[0.35674974,0.0034043374,0.5611049,0.0002699616,0.00035191048,0.00049202476,0.0006247014,0.00028149615,0.076720916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995415,0.00020412354,0.000022304694,0.00008036628,0.00010749992,0.00004424964],"domain_scores_gemma":[0.9992478,0.00053512654,0.00006983601,0.000048914757,0.000054579596,0.000043894768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079235,0.0010184986,0.0012844274,0.00068803865,0.00078021537,0.0023901716,0.0015257188,0.0018751642,0.0066917227],"category_scores_gemma":[0.003304237,0.0006888821,0.0012642286,0.0017057868,0.0015053557,0.0022545292,0.001863323,0.0020532648,0.0007118122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007501409,0.000046296183,0.00019412118,0.00029553619,0.000037232043,0.00016452571,0.00012980917,0.45856732,0.0011416352,0.49236006,0.006918291,0.040070225],"study_design_scores_gemma":[0.00004232245,0.000041725903,0.000108742126,0.000060674767,0.000014535221,0.000088216475,0.00008846357,0.6304861,0.0006773393,0.35210136,0.016278243,0.0000122892425],"about_ca_topic_score_codex":0.0020514892,"about_ca_topic_score_gemma":0.001696933,"teacher_disagreement_score":0.0066917227,"about_ca_system_score_codex":0.0010970043,"about_ca_system_score_gemma":0.00051855575,"threshold_uncertainty_score":0.022386074},"labels":[],"label_agreement":null},{"id":"W4407195113","doi":"10.1007/978-981-96-1151-5_28","title":"Feature Extraction Method Based on Contrastive Learning for Dysarthria Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Voice and Speech Disorders","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dysarthria; Feature extraction; Artificial intelligence; Feature (linguistics); Speech recognition; Pattern recognition (psychology); Natural language processing; Linguistics","score_opus":0.013707181389679949,"score_gpt":0.30690053603647677,"score_spread":0.2931933546467968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407195113","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.06165486,0.0020170978,0.93001974,0.00017344127,0.0003221881,0.00015778911,0.00060254295,0.0020853572,0.0029669912],"genre_scores_gemma":[0.3583275,0.0017831455,0.62683463,0.00021876722,0.0002624273,0.00023136579,0.0019433249,0.00018752339,0.010211341],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982005,0.000014031141,0.000015562207,0.000054995995,0.00006907252,0.000026152073],"domain_scores_gemma":[0.9997664,0.0000757788,0.000015100188,0.00001692701,0.00011261479,0.00001311862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032180388,0.0005543306,0.00061798503,0.0011038671,0.00025383188,0.0004841305,0.0005318682,0.00046354113,0.0031353796],"category_scores_gemma":[0.00045499287,0.00019370532,0.00061498134,0.00072989793,0.0001318188,0.0004901362,0.0003195035,0.0005023042,0.0013489813],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021877067,0.00011842234,0.0016212827,0.0001299089,0.000047715126,0.00013803695,0.000023810522,0.0017785871,0.19316094,0.0005763785,0.0030501008,0.79913604],"study_design_scores_gemma":[0.00010590727,0.0008021385,0.043661244,0.00007613047,0.0003943736,0.00284035,0.00010488054,0.5388697,0.39110413,0.0019779678,0.01990416,0.00015901051],"about_ca_topic_score_codex":0.001292634,"about_ca_topic_score_gemma":0.0021903662,"teacher_disagreement_score":0.0031353796,"about_ca_system_score_codex":0.00018147795,"about_ca_system_score_gemma":0.0004088152,"threshold_uncertainty_score":0.010488927},"labels":[],"label_agreement":null},{"id":"W4407249042","doi":"10.1007/978-3-031-81101-2_4","title":"Usefulness of Monoenergetic Non-contrast CT and X-Map Images for Deep Learning-Based Stroke Lesion Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Contrast (vision); Artificial intelligence; Segmentation; Computer vision; Deep learning; Image segmentation; Pattern recognition (psychology)","score_opus":0.00796047713799327,"score_gpt":0.22750968875135683,"score_spread":0.21954921161336355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407249042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12646239,0.013628401,0.8342404,0.0016877262,0.0003660523,0.00016345644,0.0017218231,0.004528867,0.01720084],"genre_scores_gemma":[0.5508498,0.0095655285,0.4178026,0.000450263,0.0003101248,0.00007971001,0.0020861113,0.0009939915,0.01786192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998567,0.000030250623,0.000011138488,0.000036803332,0.000044409808,0.000020681748],"domain_scores_gemma":[0.9993993,0.00033273138,0.000041570664,0.000059144037,0.00013017526,0.000037053982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007023605,0.0010746974,0.00038064306,0.0011293181,0.00017868586,0.0017282589,0.0005272487,0.0013096274,0.004355646],"category_scores_gemma":[0.0019544258,0.00038711578,0.0004942267,0.0006800535,0.00026115397,0.0011820642,0.0005618018,0.0005798701,0.001701913],"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.00055116875,0.00009429493,0.0018859204,0.00044045816,0.00009984532,0.00039556605,0.00006229021,0.033574905,0.0960052,0.0031851642,0.0059877117,0.85771745],"study_design_scores_gemma":[0.000031594158,0.00021751397,0.0058213393,0.00029124285,0.0002958963,0.0016795436,0.000090973605,0.8140852,0.15689379,0.008931703,0.011610335,0.000050901595],"about_ca_topic_score_codex":0.0017573452,"about_ca_topic_score_gemma":0.003123941,"teacher_disagreement_score":0.004355646,"about_ca_system_score_codex":0.0003478079,"about_ca_system_score_gemma":0.0004881253,"threshold_uncertainty_score":0.014571071},"labels":[],"label_agreement":null},{"id":"W4407253672","doi":"10.1007/978-981-97-8702-9_20","title":"Feature-Based Explainable Reinforcement Learning in Environments with Multiple Sources of Risk","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reinforcement learning; Feature (linguistics); Artificial intelligence; Reinforcement; Engineering","score_opus":0.00814257528352944,"score_gpt":0.2077444555139946,"score_spread":0.19960188023046516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407253672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030482637,0.00019489261,0.96656036,0.00020021881,0.000031322117,0.00001689423,0.00003269424,0.00027372513,0.0022073474],"genre_scores_gemma":[0.8976675,0.00019862341,0.097237945,0.000058401405,0.000041128784,0.000082071274,0.00006342497,0.0000772503,0.0045736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974793,0.00007854207,0.000011785418,0.00005461525,0.000064407745,0.000042750664],"domain_scores_gemma":[0.99828255,0.0012905196,0.0001557631,0.00009947262,0.000104603925,0.00006704119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064655,0.0006491038,0.0009000268,0.0002527141,0.00024858347,0.0006800992,0.0012468576,0.0011510645,0.0023488821],"category_scores_gemma":[0.003551481,0.000432662,0.0004580336,0.00033890238,0.00077596714,0.0011887397,0.0013424213,0.0016424373,0.00020510584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051398627,0.00002283697,0.00025321278,0.000034364937,0.000022737919,0.000056691824,0.00004530392,0.9501279,0.0009171403,0.022642847,0.00049274444,0.025332784],"study_design_scores_gemma":[0.0000045446845,0.00001240929,0.000049844457,0.0000022899255,0.000002570822,0.000007839118,0.0000017296758,0.9880591,0.000108069544,0.011655677,0.000093094095,0.0000028859963],"about_ca_topic_score_codex":0.0023537166,"about_ca_topic_score_gemma":0.002534623,"teacher_disagreement_score":0.0023537166,"about_ca_system_score_codex":0.0007735854,"about_ca_system_score_gemma":0.00048945803,"threshold_uncertainty_score":0.00785774},"labels":[],"label_agreement":null},{"id":"W4407253946","doi":"10.1007/978-981-97-8705-0_26","title":"Unlocking Raw Data: The Power of Micro-Inspection in Handwriting Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Concordia University","funders":"","keywords":"Handwriting; Computer science; Raw data; Power (physics); Artificial intelligence; Programming language","score_opus":0.019817745536066193,"score_gpt":0.27285573840470195,"score_spread":0.25303799286863576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407253946","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.023422085,0.0048299725,0.956436,0.00030809297,0.0003242047,0.00007432054,0.00044739243,0.006855707,0.0073022656],"genre_scores_gemma":[0.20676208,0.0041365144,0.7678418,0.0002862737,0.00028616807,0.00008916799,0.00069199,0.0014456778,0.018460263],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995535,0.000055398446,0.000032168868,0.000095388416,0.00023382546,0.000029717452],"domain_scores_gemma":[0.9973151,0.0016143033,0.00019413528,0.0004273195,0.0003926981,0.000056366513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004195679,0.00065914454,0.0006373218,0.0011167316,0.0002824296,0.0013493751,0.0009576337,0.00052799325,0.007275523],"category_scores_gemma":[0.002961788,0.00045921683,0.00023550514,0.0015957626,0.00068805047,0.001503749,0.0008322412,0.000877047,0.003163357],"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.00016671127,0.000027471979,0.00054932333,0.00027342665,0.000012962422,0.00009810605,0.00011571773,0.001800401,0.08787116,0.002168993,0.003006588,0.90390927],"study_design_scores_gemma":[0.000049152506,0.0005202942,0.012040178,0.00041430583,0.00012708183,0.0028045517,0.00045069636,0.34444636,0.5080597,0.029250344,0.10166269,0.00017462709],"about_ca_topic_score_codex":0.0009262758,"about_ca_topic_score_gemma":0.0014908577,"teacher_disagreement_score":0.007275523,"about_ca_system_score_codex":0.00019343474,"about_ca_system_score_gemma":0.0003912771,"threshold_uncertainty_score":0.02433902},"labels":[],"label_agreement":null},{"id":"W4407256157","doi":"10.1007/978-981-97-8705-0_24","title":"Single-View, Video-Based Diagnosis of Parkinson’s Disease via Margin of Stability Gait Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Margin (machine learning); Gait; Parkinson's disease; Gait analysis; Stability (learning theory); Physical medicine and rehabilitation; Artificial intelligence; Computer vision; Machine learning; Disease; Medicine; Pathology","score_opus":0.019267528505607753,"score_gpt":0.25703168728465753,"score_spread":0.23776415877904977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407256157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15523978,0.0056055477,0.82344145,0.00026179216,0.0002840917,0.0001703066,0.0018567962,0.0025068806,0.010633358],"genre_scores_gemma":[0.6561604,0.0035295393,0.3294581,0.00018185437,0.00021686614,0.000100942576,0.0013774221,0.00021464251,0.008760179],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998772,0.000011165177,0.00000843221,0.000029988616,0.000060806717,0.000012327214],"domain_scores_gemma":[0.9998561,0.00004302357,0.00001717466,0.000008838583,0.00006286012,0.000012022421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018034877,0.00043787027,0.00047166308,0.0011782028,0.00013888898,0.0006061805,0.00033456998,0.00048495398,0.0031233218],"category_scores_gemma":[0.0005801058,0.00017639663,0.00030981583,0.0005613672,0.00011842922,0.00041302288,0.00043944627,0.00018419158,0.0016709294],"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.0005178574,0.00005969299,0.0057386924,0.00024223942,0.00006790226,0.00036843415,0.000055300836,0.00387912,0.15080185,0.00069637893,0.004954489,0.83261806],"study_design_scores_gemma":[0.00009367389,0.0013023365,0.09683151,0.00030870034,0.00038216411,0.016914213,0.00039863618,0.72826517,0.13404042,0.0067034443,0.014616028,0.00014368226],"about_ca_topic_score_codex":0.00079827686,"about_ca_topic_score_gemma":0.0019488392,"teacher_disagreement_score":0.0031233218,"about_ca_system_score_codex":0.00010453671,"about_ca_system_score_gemma":0.00016886032,"threshold_uncertainty_score":0.010448515},"labels":[],"label_agreement":null},{"id":"W4407256588","doi":"10.1007/978-3-031-80871-5_5","title":"Multi-stage Segmentation of Diabetic Foot Ulcers Using Self-supervised Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diabetic Foot Ulcer Assessment and Management","field":"Medicine","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Diabetic foot; Segmentation; Artificial intelligence; Stage (stratigraphy); Image segmentation; Pattern recognition (psychology); Computer vision; Machine learning; Diabetes mellitus; Medicine","score_opus":0.02995330761027392,"score_gpt":0.3036574829926911,"score_spread":0.27370417538241715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407256588","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.13214205,0.0021355816,0.85860723,0.00026383,0.0001881165,0.00020915482,0.0007582873,0.0030887844,0.0026070368],"genre_scores_gemma":[0.50605464,0.0010066751,0.4806802,0.00022581505,0.00020004998,0.0001788961,0.0024736435,0.00045598712,0.008724111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976605,0.000029578003,0.000018844868,0.00007986716,0.000047592268,0.000058127927],"domain_scores_gemma":[0.9995677,0.00018542913,0.000041726784,0.000036747737,0.00012977449,0.00003861652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715957,0.00066495186,0.00093381817,0.0013399898,0.0003175975,0.00096028147,0.0010184486,0.0011175777,0.0016464001],"category_scores_gemma":[0.0006679352,0.0004655684,0.0012826908,0.00091390585,0.00019701531,0.00041105892,0.00051451847,0.0006940607,0.00078640034],"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.00053608516,0.00037254702,0.005207827,0.0002243653,0.00018472938,0.00023860592,0.0001216129,0.08347261,0.040310167,0.0005945151,0.0069935955,0.8617433],"study_design_scores_gemma":[0.000012012692,0.000093885785,0.0042052837,0.000024155477,0.000059858863,0.00019669444,0.000030322877,0.9831972,0.010086865,0.000741398,0.001335418,0.000016910573],"about_ca_topic_score_codex":0.0059881276,"about_ca_topic_score_gemma":0.0103992615,"teacher_disagreement_score":0.0059881276,"about_ca_system_score_codex":0.00039225112,"about_ca_system_score_gemma":0.0006211737,"threshold_uncertainty_score":0.011906505},"labels":[],"label_agreement":null},{"id":"W4407257800","doi":"10.1007/978-3-031-80871-5_10","title":"Diabetic Foot Ulcer Grand Challenge 2024: Overview and Baseline Methods","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diabetic Foot Ulcer Assessment and Management","field":"Medicine","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Baseline (sea); Computer science; Foot (prosody); Diabetic foot; Diabetic foot ulcer; Artificial intelligence; Medicine; Diabetes mellitus; Art; Geology","score_opus":0.03191396255275639,"score_gpt":0.3363230644054232,"score_spread":0.3044091018526668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407257800","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.014977151,0.17176685,0.5463239,0.029646553,0.01352799,0.00999179,0.07497563,0.007612311,0.13117793],"genre_scores_gemma":[0.045401655,0.059374038,0.6892676,0.010115447,0.005701833,0.013411482,0.080677345,0.0037517857,0.09229883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98934174,0.004828133,0.0007647172,0.0009878203,0.0036099316,0.00046759512],"domain_scores_gemma":[0.9873061,0.0035433932,0.0006199205,0.0011351291,0.0065969992,0.00079851976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03163245,0.0018217231,0.0017248761,0.0027869176,0.00095152244,0.004053614,0.003813548,0.0023365149,0.030806389],"category_scores_gemma":[0.034963697,0.0010269113,0.0017741092,0.0025946482,0.00056144316,0.0023535106,0.0032797346,0.0029459808,0.018176625],"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.0013363664,0.00049975474,0.0048890365,0.001533169,0.0002501293,0.00005016579,0.000104845545,0.0013455072,0.00089656183,0.006199976,0.2350377,0.7478568],"study_design_scores_gemma":[0.0009854955,0.0020060642,0.03708653,0.0052035945,0.00083304493,0.0011749004,0.00054718397,0.015443165,0.0044626463,0.037012048,0.8949521,0.0002932862],"about_ca_topic_score_codex":0.010658015,"about_ca_topic_score_gemma":0.013060277,"teacher_disagreement_score":0.03163245,"about_ca_system_score_codex":0.0022058622,"about_ca_system_score_gemma":0.00653241,"threshold_uncertainty_score":0.16729039},"labels":[],"label_agreement":null},{"id":"W4407262336","doi":"10.1007/978-3-031-82007-6_19","title":"SCIsegV2: A Universal Tool for Segmentation of Intramedullary Lesions in Spinal Cord Injury","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spinal Cord Injury Research","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Canadian Institutes of Health Research; National Institutes of Health; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Craig H. Neilsen Foundation; Canada First Research Excellence Fund; Institut pour la Recherche sur la Moelle épinière et l'Encéphale; Boettcher Foundation","keywords":"Intramedullary rod; Computer science; Segmentation; Spinal cord injury; Spinal cord; Artificial intelligence; Natural language processing; Medicine; Surgery","score_opus":0.03694786443915505,"score_gpt":0.3703723975697782,"score_spread":0.33342453313062315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407262336","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.0081367,0.005932791,0.706321,0.0006668448,0.0008109946,0.0003991811,0.031048696,0.22293687,0.023746898],"genre_scores_gemma":[0.048786808,0.0037449314,0.76470083,0.0012941118,0.00042692272,0.00081700814,0.07379211,0.060127024,0.04631025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995396,0.000046677782,0.000048218317,0.00011189977,0.00019546304,0.00005812668],"domain_scores_gemma":[0.9996132,0.0001821343,0.000022727816,0.00004608719,0.00009584394,0.00004006057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788552,0.0021656156,0.0010153349,0.0036437355,0.0005359777,0.001776861,0.0021064628,0.0022578987,0.048682034],"category_scores_gemma":[0.0015779353,0.0011021727,0.0015373944,0.0018730413,0.00032966209,0.0011667412,0.0019908063,0.00095689634,0.021751205],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029842896,0.000037833637,0.0008565354,0.001093647,0.00016035108,0.00046033587,0.00018483581,0.005755598,0.02169299,0.0032048083,0.35727683,0.6089778],"study_design_scores_gemma":[0.00019018489,0.0001760942,0.0053473925,0.00060808635,0.00022047931,0.005380328,0.00015007691,0.114467196,0.08449084,0.018047988,0.770666,0.00025522514],"about_ca_topic_score_codex":0.0030325064,"about_ca_topic_score_gemma":0.0062674843,"teacher_disagreement_score":0.048682034,"about_ca_system_score_codex":0.00043962034,"about_ca_system_score_gemma":0.0008820258,"threshold_uncertainty_score":0.16285765},"labels":[],"label_agreement":null},{"id":"W4407366263","doi":"10.1007/978-3-031-81396-2","title":"Approximation and Online Algorithms","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Birkbeck, University of London; Indian Institute of Technology Delhi; Syddansk Universitet; Indian Institute of Technology Bombay; Sorbonne Université; University of Twente; University of Waterloo; Eidgenössische Technische Hochschule Zürich; Nanjing University; Dalhousie University; Centre National de la Recherche Scientifique; University of Oxford; Université Grenoble Alpes; Aarhus Universitet","keywords":"Computer science; Algorithm","score_opus":0.017033240149665344,"score_gpt":0.27136077012937876,"score_spread":0.2543275299797134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407366263","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049635405,0.037707563,0.58335966,0.0053454004,0.0039947936,0.00012863387,0.0015244455,0.003451857,0.3595241],"genre_scores_gemma":[0.1315222,0.03309141,0.33806446,0.0026483252,0.005863965,0.00051553553,0.004849435,0.0034917644,0.4799529],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890757,0.0002111666,0.000037983045,0.00023367102,0.00048801047,0.0001215753],"domain_scores_gemma":[0.9985461,0.000655137,0.000054301494,0.00051562296,0.00015408733,0.000074774514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271206,0.0020833118,0.0024386924,0.0015144388,0.0008255745,0.003421465,0.00235916,0.0016600206,0.049977813],"category_scores_gemma":[0.004209759,0.00088624936,0.001175916,0.0050758235,0.0013026444,0.0048970752,0.002050926,0.0056921057,0.019932793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019376642,0.00021084932,0.00026598392,0.00045519444,0.000068518064,0.000057559442,0.00005381235,0.026845409,0.00095942384,0.2906332,0.24765468,0.43260157],"study_design_scores_gemma":[0.00006040135,0.000054193737,0.0005333032,0.00018164552,0.0000600353,0.00028795103,0.00004176488,0.1105247,0.0013814521,0.6651707,0.22167973,0.000024128312],"about_ca_topic_score_codex":0.0018739073,"about_ca_topic_score_gemma":0.001989011,"teacher_disagreement_score":0.049977813,"about_ca_system_score_codex":0.0021321054,"about_ca_system_score_gemma":0.0011596549,"threshold_uncertainty_score":0.1671924},"labels":[],"label_agreement":null},{"id":"W4407411804","doi":"10.1007/978-981-97-9536-9_1","title":"Educational Research Trends of the Use of Gaze Learning Data Through Topic Modeling and Scientometric Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diverse Approaches in Healthcare and Education Studies","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Fanshawe College","funders":"","keywords":"Computer science; Gaze; Data science; Artificial intelligence","score_opus":0.48788204733982193,"score_gpt":0.4626594733636055,"score_spread":0.02522257397621641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407411804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7939931,0.07551648,0.025890792,0.018054763,0.00054793246,0.00016620767,0.02089327,0.0016146137,0.06332284],"genre_scores_gemma":[0.94084984,0.024436563,0.014216082,0.00055748364,0.0007438543,0.00013711114,0.010330783,0.0002385291,0.008489709],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99592614,0.0011867278,0.00048791067,0.0006862252,0.0014795059,0.00023346467],"domain_scores_gemma":[0.9349047,0.040951073,0.006526686,0.0019361449,0.014177033,0.0015044424],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0074327267,0.0003723477,0.00038225655,0.020012576,0.0006078456,0.0044575306,0.000862263,0.0008432974,0.0037906184],"category_scores_gemma":[0.040158942,0.00021341657,0.0010529576,0.024464251,0.0006530452,0.005375583,0.0012197823,0.0011795267,0.001618535],"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.00018680785,0.00013035185,0.39249557,0.0013335401,0.00020468069,0.00012491194,0.0043533137,0.0015714207,0.002173049,0.0109417625,0.020655677,0.5658289],"study_design_scores_gemma":[0.000014068106,0.0002758259,0.8485733,0.0015946468,0.0002775593,0.00086214964,0.008372142,0.013758341,0.0056103365,0.007472912,0.11309122,0.00009756833],"about_ca_topic_score_codex":0.014225348,"about_ca_topic_score_gemma":0.014249313,"teacher_disagreement_score":0.9925673,"about_ca_system_score_codex":0.0021154194,"about_ca_system_score_gemma":0.0029039253,"threshold_uncertainty_score":0.03930849},"labels":[],"label_agreement":null},{"id":"W4407425120","doi":"10.1007/978-3-031-77789-9_15","title":"Vision Mamba for Classification of Breast Ultrasound Images","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Breast ultrasound; Medicine; Mammography; Internal medicine; Breast cancer","score_opus":0.012980205699294752,"score_gpt":0.267407593559223,"score_spread":0.25442738785992824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407425120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012078122,0.0021224387,0.9725351,0.00026026534,0.00027334708,0.00014522242,0.00058389397,0.007092914,0.0049087466],"genre_scores_gemma":[0.13855574,0.001996317,0.82475066,0.00039064488,0.00015979898,0.0003112855,0.0028829176,0.0004212516,0.030531399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997986,0.000028072292,0.000007978248,0.000058813464,0.00006816758,0.00003834599],"domain_scores_gemma":[0.99988747,0.00002594162,0.000007854281,0.000018357701,0.00005259868,0.00000781249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392197,0.0006121303,0.00055217044,0.00068295834,0.00029916078,0.0007030861,0.001218379,0.0008128091,0.009695978],"category_scores_gemma":[0.00051194645,0.00031281318,0.0007840288,0.0006839686,0.00016345753,0.0004211989,0.0005964462,0.0008620831,0.005734617],"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.0001498852,0.00007537514,0.00050132605,0.0002284056,0.000072505536,0.000034240897,0.000026885113,0.008964953,0.101382814,0.004316463,0.0133604165,0.8708868],"study_design_scores_gemma":[0.000024388346,0.00025551958,0.0029929026,0.0000684484,0.00009907981,0.000365362,0.000058929843,0.8023843,0.13506667,0.0064544347,0.052196227,0.000033620727],"about_ca_topic_score_codex":0.0033621471,"about_ca_topic_score_gemma":0.0054050977,"teacher_disagreement_score":0.009695978,"about_ca_system_score_codex":0.0004108086,"about_ca_system_score_gemma":0.0006219685,"threshold_uncertainty_score":0.03243625},"labels":[],"label_agreement":null},{"id":"W4407554117","doi":"10.1007/978-3-031-81375-7_19","title":"Optimizing B-Trees for Memory-Constrained Flash Embedded Devices","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Computer science; Flash memory; Flash file system; Flash (photography); Parallel computing; Embedded system; Computer hardware; Computer memory; Semiconductor memory; Visual arts","score_opus":0.01789434609431879,"score_gpt":0.2667276773376951,"score_spread":0.2488333312433763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407554117","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.21924427,0.0036720135,0.72245765,0.0008219682,0.00022984034,0.00014274269,0.0011810081,0.007085671,0.045164905],"genre_scores_gemma":[0.6375109,0.0008460325,0.34628087,0.0002318263,0.00005634475,0.00010073826,0.0011671664,0.0011400208,0.012666186],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979883,0.00003618221,0.000011159523,0.000029309993,0.00007565273,0.000048845308],"domain_scores_gemma":[0.99948716,0.00026807797,0.00003085445,0.00007237163,0.00011167801,0.000029853356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019265799,0.00049034157,0.0004665002,0.0003941324,0.00039563098,0.00066660414,0.0008602857,0.0005484526,0.008123533],"category_scores_gemma":[0.0013496097,0.00027200312,0.00030661907,0.001038123,0.00021692883,0.0012211238,0.00052320433,0.0005761173,0.0014446643],"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.0006693894,0.00023720688,0.0012182321,0.00046158937,0.0000667547,0.00017657231,0.00012008949,0.40195638,0.045299448,0.030813856,0.042734392,0.47624618],"study_design_scores_gemma":[0.00006742332,0.00013811351,0.00048178708,0.000033026645,0.000024249748,0.000110671994,0.00008512223,0.9522535,0.009155339,0.030971445,0.0066672317,0.000012013245],"about_ca_topic_score_codex":0.0026491536,"about_ca_topic_score_gemma":0.007429983,"teacher_disagreement_score":0.008123533,"about_ca_system_score_codex":0.00056379754,"about_ca_system_score_gemma":0.0006526989,"threshold_uncertainty_score":0.027175963},"labels":[],"label_agreement":null},{"id":"W4407578196","doi":"10.1007/978-981-96-1542-1_11","title":"ChainSafari: A General and Efficient Blockchain Verifiable Query Scheme with Real-Time Synchronization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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":"Queen's University","funders":"","keywords":"Computer science; Blockchain; Verifiable secret sharing; Scheme (mathematics); Synchronization (alternating current); Theoretical computer science; Computer network; Computer security; Programming language; Mathematics","score_opus":0.004675727126302658,"score_gpt":0.20558520608202255,"score_spread":0.2009094789557199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407578196","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.013495193,0.00091467134,0.9626501,0.00044375003,0.00027582212,0.0007956858,0.0013452115,0.00914848,0.010931122],"genre_scores_gemma":[0.45436576,0.0012479076,0.50298697,0.00061195047,0.00027341276,0.001056829,0.004123831,0.0011977195,0.03413569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782616,0.0003192166,0.00015209371,0.0003883969,0.0009662102,0.0003478675],"domain_scores_gemma":[0.9979139,0.0004640254,0.0001564452,0.0010523683,0.00028039998,0.00013285565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020865828,0.0008796125,0.0015763771,0.0011344856,0.0014825679,0.002667987,0.0031928015,0.0016835596,0.013199679],"category_scores_gemma":[0.0034957693,0.000809175,0.0008241883,0.0023366027,0.0016904661,0.005900761,0.0046767835,0.0028535286,0.0042090556],"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.0025247307,0.00040855963,0.0006367732,0.00083798304,0.00015580679,0.00026552216,0.00045167116,0.037700556,0.05886792,0.4850892,0.039921932,0.37313935],"study_design_scores_gemma":[0.00082513073,0.0005706361,0.00052295066,0.00016416704,0.00017888851,0.0005250678,0.00009644883,0.45339027,0.07967928,0.36874446,0.095096365,0.0002063122],"about_ca_topic_score_codex":0.0022424818,"about_ca_topic_score_gemma":0.001719148,"teacher_disagreement_score":0.013199679,"about_ca_system_score_codex":0.002093399,"about_ca_system_score_gemma":0.0038188908,"threshold_uncertainty_score":0.044157326},"labels":[],"label_agreement":null},{"id":"W4407578703","doi":"10.1007/978-981-96-1542-1_7","title":"DataJudge: Cross-Chain Data Consistency Verification Based on Extended Merkle Hash Tree","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Queen's University","funders":"","keywords":"Merkle tree; Computer science; Hash function; Consistency (knowledge bases); Data consistency; Hash chain; Hash tree; Theoretical computer science; Algorithm; Distributed computing; Programming language; Artificial intelligence","score_opus":0.04133398439985462,"score_gpt":0.30491059694539646,"score_spread":0.2635766125455418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407578703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052012324,0.001078655,0.9244586,0.00038462903,0.00042588316,0.0003993232,0.0005204887,0.01743726,0.0032828453],"genre_scores_gemma":[0.6712221,0.00027567983,0.31944972,0.0003199632,0.00014533293,0.00019229042,0.0014609145,0.0007801262,0.00615391],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955994,0.00060904,0.0004303489,0.00088241004,0.0019946387,0.00048422313],"domain_scores_gemma":[0.99271095,0.0013355855,0.0004353372,0.0039639324,0.0013618146,0.00019233026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028176957,0.00069798616,0.0016006861,0.0014870528,0.0013658571,0.002474069,0.0023057284,0.0012334654,0.0051327767],"category_scores_gemma":[0.0074925963,0.0006748102,0.0008252556,0.0014160622,0.0010585105,0.0074628117,0.0066620894,0.0016723282,0.0018883824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027020287,0.00039094593,0.006895797,0.00075263466,0.00032560655,0.0010010124,0.00078794116,0.023406751,0.0936498,0.047203325,0.023240624,0.7996436],"study_design_scores_gemma":[0.00038515514,0.0009659064,0.0031981987,0.00016754543,0.00025908067,0.002187087,0.00040126068,0.6621747,0.21709949,0.08447939,0.02841077,0.00027141505],"about_ca_topic_score_codex":0.001024899,"about_ca_topic_score_gemma":0.0011323208,"teacher_disagreement_score":0.0051327767,"about_ca_system_score_codex":0.0008457869,"about_ca_system_score_gemma":0.0021156368,"threshold_uncertainty_score":0.017170787},"labels":[],"label_agreement":null},{"id":"W4407601626","doi":"10.1007/978-3-031-78679-2_5","title":"Short Paper: Breaking X-VRF, A Post-quantum Verifiable Random Function","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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 Calgary","funders":"","keywords":"Computer science; Verifiable secret sharing; Function (biology); Quantum; Algorithm; Theoretical computer science; Quantum mechanics; Physics; Programming language","score_opus":0.007691092377264427,"score_gpt":0.2207841602312895,"score_spread":0.21309306785402507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407601626","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046255074,0.04017587,0.2727287,0.11819775,0.14366056,0.00029937248,0.002986147,0.0022398285,0.37345666],"genre_scores_gemma":[0.37775254,0.011541057,0.031356562,0.0139211025,0.03626637,0.00021231534,0.0017954643,0.0014385897,0.52571595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991321,0.00021304144,0.00003682622,0.00025435304,0.0002730713,0.00009063081],"domain_scores_gemma":[0.9980509,0.0012601266,0.00010003491,0.0002803406,0.00020571727,0.00010287664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013286093,0.00097336795,0.00072838005,0.0005107956,0.0015921656,0.0022183585,0.0012365557,0.002460116,0.027350519],"category_scores_gemma":[0.004795324,0.00035806798,0.0008273658,0.0010996929,0.0021128533,0.0041694087,0.0008958004,0.0032921173,0.008183624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031968125,0.00008158712,0.00039679406,0.00050994114,0.00008604662,0.00026658695,0.00019069843,0.0028776694,0.0034298215,0.60417885,0.30148974,0.08617259],"study_design_scores_gemma":[0.00012272446,0.00028181262,0.0009155223,0.0001895206,0.000089934874,0.0009072505,0.000080698104,0.007925097,0.008857174,0.6073484,0.37318584,0.00009613747],"about_ca_topic_score_codex":0.0005818426,"about_ca_topic_score_gemma":0.0004164794,"teacher_disagreement_score":0.027350519,"about_ca_system_score_codex":0.0014927179,"about_ca_system_score_gemma":0.00092654285,"threshold_uncertainty_score":0.09149659},"labels":[],"label_agreement":null},{"id":"W4407601633","doi":"10.1007/978-3-031-78679-2_15","title":"Short Paper: Onion Messages on Leash","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","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":"Computer science","score_opus":0.012257803028437627,"score_gpt":0.24236494670208472,"score_spread":0.2301071436736471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407601633","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03369314,0.00909291,0.06098528,0.05106831,0.10102202,0.0004971198,0.0047258614,0.0029824188,0.73593295],"genre_scores_gemma":[0.09525718,0.0020614045,0.005683221,0.0021375322,0.00854503,0.00006764089,0.0019767922,0.001172667,0.8830985],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937433,0.00015238054,0.000033034146,0.00010905632,0.00022547181,0.000105702326],"domain_scores_gemma":[0.9981482,0.0008571575,0.000071800445,0.00031974353,0.00047071427,0.0001324036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009236068,0.0008285721,0.00044663093,0.0007547706,0.0016705762,0.0022108876,0.0007535255,0.0014174761,0.12331131],"category_scores_gemma":[0.0045142733,0.0002867666,0.00033802164,0.0016354377,0.0005673549,0.00408123,0.0012810089,0.0012130961,0.022386644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006686627,0.00008721816,0.00051177875,0.00029930126,0.000022232605,0.00018128296,0.00035048736,0.0014943657,0.0031270941,0.07333553,0.7540996,0.16582246],"study_design_scores_gemma":[0.000040063744,0.00009503862,0.0008343614,0.00012408229,0.000022002985,0.00011934175,0.00018327072,0.00269793,0.0054545337,0.024235275,0.9661651,0.000029005105],"about_ca_topic_score_codex":0.0027727517,"about_ca_topic_score_gemma":0.0029800849,"teacher_disagreement_score":0.12331131,"about_ca_system_score_codex":0.0014435793,"about_ca_system_score_gemma":0.0008954766,"threshold_uncertainty_score":0.41251743},"labels":[],"label_agreement":null},{"id":"W4407605938","doi":"10.1007/978-3-031-78679-2_12","title":"Owl: An Augmented Password-Authenticated Key Exchange Scheme","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"Carleton University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Password; Scheme (mathematics); Key (lock); Computer security; S/KEY; Key exchange; Public-key cryptography; Encryption","score_opus":0.020826602232112298,"score_gpt":0.28759467596842514,"score_spread":0.26676807373631284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407605938","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.021299396,0.0003196859,0.93046653,0.0006553192,0.000537561,0.0003442509,0.0018029598,0.018497938,0.026076276],"genre_scores_gemma":[0.4717485,0.0008280631,0.41181898,0.0009164687,0.00028092726,0.00070280355,0.00558645,0.0022095921,0.105908185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989808,0.0002155737,0.000110908484,0.00012743352,0.00039794366,0.00016725757],"domain_scores_gemma":[0.9991062,0.0001673989,0.00005204792,0.00044979437,0.0001414554,0.00008302429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012577369,0.00045066237,0.000612378,0.00059294247,0.0008249041,0.0021797928,0.0013221508,0.0008782884,0.013882037],"category_scores_gemma":[0.0019330593,0.00039389127,0.00053273153,0.0008752651,0.00089786324,0.0059745503,0.0035305342,0.0015105178,0.0060891467],"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.0017450388,0.00038048055,0.00056186033,0.0005971938,0.000050602208,0.00052446633,0.0006473408,0.004156161,0.028729096,0.5533746,0.06517653,0.34405667],"study_design_scores_gemma":[0.0003295599,0.00036646886,0.0010512568,0.00015214858,0.000112251866,0.0015408138,0.00018201902,0.079332165,0.05111131,0.3969628,0.46870413,0.00015506588],"about_ca_topic_score_codex":0.00065147434,"about_ca_topic_score_gemma":0.00060650794,"teacher_disagreement_score":0.013882037,"about_ca_system_score_codex":0.00080626376,"about_ca_system_score_gemma":0.0011910128,"threshold_uncertainty_score":0.046440065},"labels":[],"label_agreement":null},{"id":"W4407605941","doi":"10.1007/978-3-031-78679-2_10","title":"Subset-Optimized BLS Multi-signature with Key Aggregation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Nicolet Chartrand Knoll (Canada)","funders":"Vlaamse regering; KU Leuven","keywords":"Computer science; Signature (topology); Key (lock); Computer security; Mathematics","score_opus":0.012269784931294757,"score_gpt":0.23535015857275624,"score_spread":0.22308037364146147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407605941","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.05584886,0.00060902117,0.9172482,0.00047444025,0.00039965674,0.0002908066,0.00091125513,0.008471685,0.015746128],"genre_scores_gemma":[0.62514853,0.00020324293,0.35342288,0.0002712009,0.0001658248,0.00019569538,0.0017168563,0.0005416473,0.018334173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735546,0.00043503984,0.00024445055,0.00040045445,0.0010897296,0.0004748254],"domain_scores_gemma":[0.9976344,0.00023347003,0.00017254219,0.0013991699,0.00044962586,0.00011068234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088039314,0.0008533709,0.0014767178,0.0010050179,0.0009392089,0.0019177739,0.0014792483,0.00071581994,0.007985879],"category_scores_gemma":[0.0020528545,0.00042659242,0.0007642647,0.0017755614,0.00062919135,0.0028846723,0.0036339662,0.0012677152,0.0043718633],"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.003208036,0.000370836,0.0009989281,0.00041667145,0.00015677996,0.00024890082,0.0002622826,0.05118967,0.11774198,0.08122046,0.022041272,0.72214425],"study_design_scores_gemma":[0.00036731205,0.0009182658,0.0012509255,0.000073323405,0.00015550213,0.0010298556,0.00035406128,0.67591876,0.1402445,0.14221446,0.037328888,0.000144133],"about_ca_topic_score_codex":0.000736238,"about_ca_topic_score_gemma":0.0014225303,"teacher_disagreement_score":0.007985879,"about_ca_system_score_codex":0.00108641,"about_ca_system_score_gemma":0.002030844,"threshold_uncertainty_score":0.026715457},"labels":[],"label_agreement":null},{"id":"W4407613698","doi":"10.1007/978-3-031-82697-9_9","title":"The Computational Complexity of Equilibria with Strategic Constraints","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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 Victoria","funders":"","keywords":"Computer science; Computational complexity theory; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.1128177789688143,"score_gpt":0.3531298064763141,"score_spread":0.2403120275074998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407613698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22835793,0.0033796094,0.56309915,0.021636767,0.00038576586,0.00033391654,0.0031843933,0.00063517364,0.17898725],"genre_scores_gemma":[0.9035254,0.0027498866,0.06792422,0.0008737492,0.0009957349,0.00057963835,0.0018556319,0.00034064037,0.021155024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942788,0.0026387123,0.0002932954,0.00079991296,0.0013399586,0.0006494077],"domain_scores_gemma":[0.8935334,0.09715066,0.0024446019,0.004361974,0.001431323,0.00107803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005047435,0.0011450922,0.0023694232,0.00221184,0.00199555,0.010825988,0.004227151,0.003689144,0.024235006],"category_scores_gemma":[0.05931822,0.0015180504,0.002482226,0.004015149,0.0061084344,0.02181099,0.004528965,0.0067627113,0.0017547039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020164753,0.00008965103,0.0007838396,0.00020446723,0.000057863355,0.00007928898,0.00023061111,0.06093944,0.0002669394,0.9137725,0.006193838,0.017179959],"study_design_scores_gemma":[0.000019036062,0.000006891789,0.00010727364,0.000017395541,0.000010585449,0.00002947233,0.000041259227,0.051618155,0.0000937779,0.94746083,0.0005858504,0.000009395205],"about_ca_topic_score_codex":0.0020699746,"about_ca_topic_score_gemma":0.0015721021,"teacher_disagreement_score":0.024235006,"about_ca_system_score_codex":0.0038087254,"about_ca_system_score_gemma":0.0026520907,"threshold_uncertainty_score":0.08107418},"labels":[],"label_agreement":null},{"id":"W4407687303","doi":"10.1007/978-3-031-81854-7_13","title":"RepViT-MedSAM: Efficient Segment Anything in the Medical Images","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer vision; Computer graphics (images); Artificial intelligence","score_opus":0.012691956725138674,"score_gpt":0.28407882433469306,"score_spread":0.2713868676095544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407687303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002408111,0.0010867262,0.8823664,0.00036766488,0.00019821117,0.00021398632,0.0029109982,0.10150883,0.008939021],"genre_scores_gemma":[0.019799944,0.0009724943,0.9356033,0.00052599306,0.0001763209,0.0002459102,0.006189028,0.011016815,0.02547013],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994295,0.00006130709,0.000032180957,0.00013725992,0.00028667177,0.000053081923],"domain_scores_gemma":[0.9993703,0.0002398391,0.00003798238,0.00018758536,0.00012207763,0.000042209304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074738386,0.0021199237,0.0013878894,0.0021892919,0.0006443725,0.0025691849,0.0033981123,0.0017897018,0.06432163],"category_scores_gemma":[0.00188315,0.0014156718,0.0015316388,0.002193593,0.00052519847,0.0019232223,0.002475491,0.0018880975,0.037733056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041315937,0.000077285855,0.0003414024,0.00044562097,0.00012511494,0.00018299991,0.000089740155,0.005310153,0.03582145,0.0076202382,0.16043605,0.7891368],"study_design_scores_gemma":[0.0002556242,0.00027451976,0.0025269876,0.00023409638,0.00017587485,0.0027949284,0.00016873909,0.46525696,0.18092333,0.046300236,0.30092633,0.00016239169],"about_ca_topic_score_codex":0.0025376037,"about_ca_topic_score_gemma":0.0052428837,"teacher_disagreement_score":0.06432163,"about_ca_system_score_codex":0.0006111318,"about_ca_system_score_gemma":0.0009694027,"threshold_uncertainty_score":0.2151773},"labels":[],"label_agreement":null},{"id":"W4407687448","doi":"10.1007/978-3-031-81854-7","title":"Medical Image Segmentation Foundation Models. CVPR 2024 Challenge: Segment Anything in Medical Images on Laptop","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"University of California, Los Angeles; Universitätsklinikum Heidelberg; Shenzhen University; Southeast University; University of Toronto; University of Minnesota; University of Pennsylvania; Cleveland Clinic; Children's Hospital of Philadelphia","keywords":"Laptop; Computer science; Foundation (evidence); Computer vision; Segmentation; Artificial intelligence; Image segmentation; Image (mathematics); Computer graphics (images); Medical imaging","score_opus":0.02747032318230122,"score_gpt":0.30266426940844643,"score_spread":0.27519394622614524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407687448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01242235,0.009324065,0.87557423,0.0067721517,0.0013503856,0.0004906228,0.024089588,0.052620865,0.017355697],"genre_scores_gemma":[0.082134835,0.0063553005,0.7488658,0.0024250895,0.0007379256,0.0006452446,0.09286106,0.00804817,0.057926685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896526,0.00018345081,0.00005173032,0.00035958918,0.00034774392,0.00009224778],"domain_scores_gemma":[0.9979729,0.00070355943,0.00008714224,0.00043952235,0.00064474996,0.00015217367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024489928,0.0019958206,0.0016557841,0.0012967051,0.0007267022,0.0027021205,0.0038705822,0.0034262596,0.017663201],"category_scores_gemma":[0.0053101922,0.0014530005,0.0024091594,0.0015449498,0.00048641188,0.0019739189,0.0018286121,0.0036569054,0.017162457],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027561252,0.0001406632,0.00046517933,0.0005011784,0.00015168068,0.00009720661,0.000046818015,0.037930403,0.007006844,0.0065223733,0.39764708,0.5492149],"study_design_scores_gemma":[0.000114986324,0.00019439387,0.0012583076,0.00017471463,0.00010118962,0.00053099316,0.000056453322,0.85385275,0.015789399,0.025713494,0.1021592,0.000054100743],"about_ca_topic_score_codex":0.018492155,"about_ca_topic_score_gemma":0.024527954,"teacher_disagreement_score":0.018492155,"about_ca_system_score_codex":0.0012531822,"about_ca_system_score_gemma":0.0022905173,"threshold_uncertainty_score":0.059089303},"labels":[],"label_agreement":null},{"id":"W4407733201","doi":"10.1007/978-981-96-1093-8_35","title":"Approximating Continuous Multi-agent Contracts with Lyapunov Function Methods","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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 New Brunswick","funders":"","keywords":"Computer science; Lyapunov function; Function (biology); Mathematical optimization; Applied mathematics; Mathematics; Nonlinear system; Physics","score_opus":0.0668356473082475,"score_gpt":0.3777041930335346,"score_spread":0.3108685457252871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407733201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050065843,0.00021961458,0.99245936,0.00011510993,0.0000412038,0.000016079417,0.0000103888415,0.00006463138,0.0020669943],"genre_scores_gemma":[0.74472654,0.00082975556,0.23866005,0.00012448126,0.0001205658,0.00027385264,0.00010576079,0.00018605318,0.014972901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.0003563986,0.000028688864,0.00006743513,0.00014222992,0.000058223268],"domain_scores_gemma":[0.9963595,0.0027604238,0.0002323734,0.0001549855,0.00037852427,0.000114155184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023743787,0.0013069386,0.0013680096,0.00069046253,0.00041662573,0.001624042,0.001352206,0.0018000562,0.0028092647],"category_scores_gemma":[0.007417085,0.0008248884,0.0007497297,0.00078303687,0.0012907726,0.0015738327,0.0017526279,0.0021346107,0.00048622926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039387305,0.000027161319,0.00013645597,0.00006151169,0.000019918907,0.000026531698,0.00004562698,0.9457414,0.00057557155,0.03720355,0.00056214945,0.015560736],"study_design_scores_gemma":[0.0000018812076,0.0000044917265,0.0000075960234,0.0000028155027,8.521876e-7,0.0000024588464,0.0000024430828,0.99579275,0.00003576913,0.0040481174,0.0000995934,0.000001275752],"about_ca_topic_score_codex":0.004288084,"about_ca_topic_score_gemma":0.0023125997,"teacher_disagreement_score":0.004288084,"about_ca_system_score_codex":0.0012758699,"about_ca_system_score_gemma":0.0010467446,"threshold_uncertainty_score":0.012557089},"labels":[],"label_agreement":null},{"id":"W4407733229","doi":"10.1007/978-981-96-1093-8","title":"Computing and Combinatorics","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Chicago; University of Illinois at Urbana-Champaign; Université Clermont-Auvergne; National Cheng Kung University; Indian Institute of Technology Madras; Nanjing University; Bangladesh University of Engineering and Technology; National Tsing Hua University; Università degli Studi di Palermo; Università degli Studi di Salerno; University of Tokyo; Université de Bordeaux; Aalborg Universitet; Universiteit Utrecht; Simon Fraser University; Nankai University; Dalian University of Technology; Centre National de la Recherche Scientifique; University of Engineering and Technology, Lahore; Universität Rostock; Universidade Federal Fluminense; Georgia State University; University of Texas at Dallas; Indiana State University; City University of Hong Kong; Hangzhou Dianzi University; University of Alberta","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.01104840843044858,"score_gpt":0.25204521961555904,"score_spread":0.24099681118511046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407733229","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020361647,0.059195902,0.02574235,0.0043308586,0.0020741276,0.00003351716,0.00033693376,0.0004275325,0.90582263],"genre_scores_gemma":[0.08349627,0.05803309,0.023317756,0.0024296122,0.0045392904,0.00019345127,0.0009645454,0.00093592564,0.8260899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970824,0.000055687044,0.000010673512,0.000067190485,0.00013393056,0.000024125979],"domain_scores_gemma":[0.9996921,0.00012838551,0.000014638996,0.00008192682,0.00005238298,0.000030507319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027165093,0.0010915113,0.00093880313,0.0019367767,0.001332355,0.0052541066,0.0006091743,0.00062272267,0.03881239],"category_scores_gemma":[0.0011413933,0.00048714218,0.00046207057,0.0033446725,0.0034604806,0.0045979996,0.0013874308,0.0027861162,0.014110397],"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.000011446981,0.00001570149,0.000092426606,0.00017985176,0.000011024392,0.000021058257,0.00016880661,0.0005149889,0.00029187909,0.81976557,0.09982293,0.07910432],"study_design_scores_gemma":[0.0000049039504,0.00000539235,0.00016916938,0.00007848955,0.0000053287345,0.000063003026,0.00005722312,0.00039788734,0.00012635798,0.60055745,0.3985297,0.000005065867],"about_ca_topic_score_codex":0.0019765275,"about_ca_topic_score_gemma":0.0030726357,"teacher_disagreement_score":0.03881239,"about_ca_system_score_codex":0.002641016,"about_ca_system_score_gemma":0.0011256632,"threshold_uncertainty_score":0.12984043},"labels":[],"label_agreement":null},{"id":"W4407768270","doi":"10.1007/978-981-96-2845-2","title":"WALCOM: Algorithms and Computation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Technology Guwahati; Università degli Studi di Perugia; Eötvös Loránd Tudományegyetem; University of Science and Technology of China; Università degli Studi di Salerno; Universitetet i Bergen; Shanghai Jiao Tong University; University of Engineering and Technology, Lahore; Chinese Academy of Sciences; Nanyang Technological University; University of Electronic Science and Technology of China; Ohio State University; Kyonggi University; National University of Singapore; Indian Statistical Institute; Brock University; King's College London; Rheinische Friedrich-Wilhelms-Universität Bonn; Ben-Gurion University of the Negev; Friedrich-Schiller-Universität Jena; Shanghai Educational Development Foundation; Bangladesh University of Engineering and Technology; Georgia State University","keywords":"Computer science; Computation; Algorithm","score_opus":0.014543127721006,"score_gpt":0.27648738607860135,"score_spread":0.2619442583575953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768270","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010630664,0.011067364,0.8390395,0.0021962882,0.0030792411,0.00009007881,0.0010166808,0.0110623045,0.13138543],"genre_scores_gemma":[0.04647598,0.014922454,0.5185107,0.0024741688,0.0032826508,0.00065172673,0.004885178,0.010826319,0.3979708],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908507,0.00017962273,0.00003846265,0.00015942659,0.00044813685,0.00008924482],"domain_scores_gemma":[0.9989127,0.0003769265,0.000038210383,0.0003792079,0.0002311636,0.00006187123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000658651,0.0019462077,0.0017233167,0.0018317892,0.00091742666,0.004602395,0.0024482382,0.0015857393,0.077804595],"category_scores_gemma":[0.0033145642,0.0010593195,0.0008902976,0.006177821,0.0011117322,0.0040773614,0.0028710836,0.003680271,0.060340725],"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.00006689377,0.000063930944,0.000119539676,0.00032738806,0.00004091779,0.000046835226,0.000036643647,0.012649463,0.0009020017,0.15798129,0.3892532,0.4385119],"study_design_scores_gemma":[0.00004525365,0.000027661315,0.00020162905,0.00017572561,0.000033086184,0.00018048637,0.000040144932,0.10259902,0.0023445038,0.38125798,0.5130622,0.000032235093],"about_ca_topic_score_codex":0.0012610172,"about_ca_topic_score_gemma":0.0018416098,"teacher_disagreement_score":0.077804595,"about_ca_system_score_codex":0.0010697076,"about_ca_system_score_gemma":0.0016759839,"threshold_uncertainty_score":0.26028228},"labels":[],"label_agreement":null},{"id":"W4407768278","doi":"10.1007/978-981-96-2845-2_19","title":"Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Guelph","funders":"","keywords":"Computer science; Gray (unit); Numerical digit; Arithmetic; Algorithm; Theoretical computer science; Mathematics","score_opus":0.013009798828538192,"score_gpt":0.23848302900245344,"score_spread":0.22547323017391524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768278","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11506484,0.0023121084,0.7788461,0.0019013934,0.0003027688,0.00014095857,0.00076274655,0.00218469,0.09848442],"genre_scores_gemma":[0.69616467,0.0017224989,0.25627747,0.00070473424,0.00022884597,0.00023002159,0.0005530454,0.0012148541,0.042903773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995635,0.00010479171,0.00002308949,0.00007240471,0.00015772633,0.00007844435],"domain_scores_gemma":[0.99877816,0.0007239838,0.00007511541,0.00023980995,0.000126489,0.00005640744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051324564,0.00049925345,0.00054623454,0.0007537811,0.00041953914,0.0013626446,0.0007238477,0.00093548157,0.0077436347],"category_scores_gemma":[0.0045139478,0.00027847558,0.00026145516,0.0011802579,0.0011367048,0.0018957324,0.0013811127,0.0012569005,0.0023988604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003536122,0.000047441874,0.00035244165,0.00023730422,0.000014085772,0.00016913157,0.00021005409,0.044881627,0.01679423,0.67256147,0.013007521,0.251371],"study_design_scores_gemma":[0.000034404795,0.00006518176,0.00023095215,0.000116199044,0.000012978595,0.000276941,0.000051402712,0.13191663,0.015594743,0.8393077,0.012361466,0.000031387768],"about_ca_topic_score_codex":0.0006021988,"about_ca_topic_score_gemma":0.0007833768,"teacher_disagreement_score":0.0077436347,"about_ca_system_score_codex":0.0007315863,"about_ca_system_score_gemma":0.0007540344,"threshold_uncertainty_score":0.025905013},"labels":[],"label_agreement":null},{"id":"W4407768346","doi":"10.1007/978-981-96-2845-2_3","title":"Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Saskatchewan; University of Manitoba; University of Waterloo","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.014160367945302359,"score_gpt":0.2663060143876933,"score_spread":0.25214564644239096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768346","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25453606,0.00027422907,0.7334718,0.00010321624,0.0000690588,0.00012347466,0.00046495328,0.0019045076,0.009052572],"genre_scores_gemma":[0.4478803,0.00017090325,0.54379886,0.000074579126,0.000028343185,0.00012944303,0.0017315602,0.0009434142,0.00524262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.000090455615,0.000026518986,0.000094620984,0.00015369375,0.000071653725],"domain_scores_gemma":[0.9984668,0.000855612,0.000104164275,0.00031375824,0.00015605117,0.00010357329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039399526,0.0009359185,0.0012796841,0.0010326697,0.0005635558,0.0014799669,0.001346472,0.0009456569,0.007086141],"category_scores_gemma":[0.003604721,0.000849599,0.0007931998,0.0013184287,0.00082632375,0.0016445701,0.0020652697,0.0011576285,0.0012342052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010376672,0.00023257574,0.0029898668,0.00043561653,0.00007927112,0.0003281643,0.00055670075,0.67528003,0.022710802,0.05275874,0.007609309,0.23598121],"study_design_scores_gemma":[0.000047418423,0.0000917454,0.0003088686,0.000022661481,0.000010489426,0.00005646349,0.000100759244,0.9653288,0.0029187817,0.029582964,0.0015202343,0.000010807533],"about_ca_topic_score_codex":0.0030008957,"about_ca_topic_score_gemma":0.005347472,"teacher_disagreement_score":0.007086141,"about_ca_system_score_codex":0.0005106815,"about_ca_system_score_gemma":0.00054706354,"threshold_uncertainty_score":0.023705482},"labels":[],"label_agreement":null},{"id":"W4407768365","doi":"10.1007/978-981-96-2845-2_15","title":"Approximation Algorithms for Non-sequential Star Packing Problems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta","funders":"","keywords":"Computer science; Star (game theory); Algorithm; Mathematics","score_opus":0.020326695338843383,"score_gpt":0.242552735534028,"score_spread":0.22222604019518463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768365","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012163393,0.0026289872,0.95862156,0.0006180377,0.00042620001,0.00014254445,0.00034406869,0.0012432896,0.023811797],"genre_scores_gemma":[0.11415554,0.002764549,0.85420775,0.000401141,0.0005376877,0.00045038934,0.0017289408,0.0008669688,0.02488701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841046,0.000395806,0.00008915684,0.00029135376,0.00056802295,0.00024509986],"domain_scores_gemma":[0.99627656,0.0022802763,0.00017221058,0.0008041357,0.0003235301,0.00014328604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018171524,0.0022075002,0.0021738282,0.0013270804,0.0010858492,0.002902868,0.004452339,0.0018276507,0.014937785],"category_scores_gemma":[0.0069699544,0.0012304907,0.0017431031,0.005137583,0.0010036324,0.005726816,0.0024218746,0.0041908915,0.0037283518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067341997,0.0006073365,0.0005979334,0.0007906689,0.00013437723,0.000081904735,0.00019278008,0.3339104,0.0030418057,0.12319848,0.044896223,0.49187464],"study_design_scores_gemma":[0.00010603299,0.00008393718,0.00020362713,0.00004585302,0.00003654268,0.000109886525,0.000053241944,0.84652096,0.0010892849,0.14209156,0.009647135,0.000011931749],"about_ca_topic_score_codex":0.0029611024,"about_ca_topic_score_gemma":0.0047207884,"teacher_disagreement_score":0.014937785,"about_ca_system_score_codex":0.0021668556,"about_ca_system_score_gemma":0.0019141446,"threshold_uncertainty_score":0.04997188},"labels":[],"label_agreement":null},{"id":"W4407890734","doi":"10.1007/978-981-96-1621-3_11","title":"A Common Declarative Language for UML State Machine Representation, Model Transformation, and Interoperability of Visualization Tools","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language; Unified Modeling Language; Interoperability; Model transformation; Abstract state machines; Visualization; Representation (politics); Transformation (genetics); Intermediate language; Natural language processing; Finite-state machine; Software engineering; Artificial intelligence; World Wide Web; Compiler; Software","score_opus":0.021348317859800063,"score_gpt":0.30304335833415547,"score_spread":0.2816950404743554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407890734","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.00048297035,0.000110088295,0.98864055,0.00019597307,0.00008698682,0.00017160582,0.00068850775,0.0069342363,0.002689099],"genre_scores_gemma":[0.012536857,0.00051403156,0.96282333,0.0004908087,0.00010244157,0.00085891795,0.005570533,0.0066437013,0.010459448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532276,0.0009252942,0.0011120524,0.0006146059,0.001712726,0.00031259254],"domain_scores_gemma":[0.9931184,0.0020758922,0.0004928979,0.0023590145,0.0016788681,0.00027493274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067827036,0.00162715,0.001526997,0.0024272315,0.0014372468,0.007399921,0.0049732905,0.002698004,0.011852105],"category_scores_gemma":[0.010591935,0.002401491,0.00277772,0.0027891104,0.001465094,0.0060453555,0.004316038,0.007166113,0.008585015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023196399,0.0004997871,0.00066880044,0.0013918609,0.00014823652,0.00057342224,0.0025447665,0.010756329,0.03850249,0.55616814,0.08674874,0.3017655],"study_design_scores_gemma":[0.00013837003,0.00020559465,0.0006018292,0.00087022554,0.00019423274,0.0014126347,0.0003507435,0.07285254,0.050701275,0.16593032,0.7065209,0.00022138115],"about_ca_topic_score_codex":0.0030746008,"about_ca_topic_score_gemma":0.0043902807,"teacher_disagreement_score":0.011852105,"about_ca_system_score_codex":0.0011659873,"about_ca_system_score_gemma":0.0050486517,"threshold_uncertainty_score":0.039649248},"labels":[],"label_agreement":null},{"id":"W4407891065","doi":"10.1007/978-981-96-1621-3_10","title":"A Framework for Standardized Partitioning Analysis in Integrated Modular Avionics Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","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":"Queen's University","funders":"","keywords":"Avionics; Integrated modular avionics; Computer science; Modular design; Software engineering; Programming language; Embedded system; Computer architecture; Systems engineering; Engineering; Software; Aerospace engineering","score_opus":0.017732115286621997,"score_gpt":0.2777757639394003,"score_spread":0.2600436486527783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407891065","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.0010185349,0.000112607435,0.99641454,0.000043266973,0.000021359632,0.00006395585,0.000053604675,0.00032481627,0.0019473],"genre_scores_gemma":[0.046908896,0.00041822137,0.9486731,0.000093077295,0.000079331134,0.00035629986,0.00045052572,0.00039796217,0.0026224668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982918,0.0005587434,0.00013851422,0.00022895295,0.00059041294,0.00019161102],"domain_scores_gemma":[0.9984798,0.00063332694,0.000120236036,0.00034523304,0.00036444372,0.000057008256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027461003,0.0017146326,0.0011059479,0.0019218654,0.0011633215,0.0028463344,0.0027659263,0.0010232141,0.005960639],"category_scores_gemma":[0.0047059665,0.0010651153,0.0024421134,0.0028619152,0.0016399146,0.0028646935,0.0023528736,0.0030874573,0.0017328704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447262,0.000100208934,0.00047308768,0.00022493684,0.000085754284,0.00022307635,0.00023534585,0.14578298,0.004388212,0.7184692,0.0052310056,0.1247414],"study_design_scores_gemma":[0.000023721619,0.000049613536,0.00025239302,0.000109527304,0.00006247329,0.00011521134,0.00008865521,0.47976953,0.002224114,0.49743643,0.019837396,0.000030873096],"about_ca_topic_score_codex":0.0050973897,"about_ca_topic_score_gemma":0.0055453503,"teacher_disagreement_score":0.005960639,"about_ca_system_score_codex":0.0013771803,"about_ca_system_score_gemma":0.0022464104,"threshold_uncertainty_score":0.019940317},"labels":[],"label_agreement":null},{"id":"W4407891227","doi":"10.1007/978-981-96-1621-3_16","title":"ASTD Patterns for Integrated Continuous Anomaly Detection in Data Logs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Anomaly detection; Anomaly (physics); Data mining","score_opus":0.021129983471791448,"score_gpt":0.2702787274616232,"score_spread":0.24914874398983172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407891227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007312123,0.00021708684,0.9735131,0.00013064565,0.00012362632,0.00009442362,0.0009968781,0.016421054,0.0011910094],"genre_scores_gemma":[0.12805659,0.0002561141,0.8638417,0.0001321111,0.0000744543,0.00022805014,0.0023370513,0.0008825619,0.0041913074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984529,0.00022964225,0.00022276676,0.0002724675,0.00074398203,0.000078148754],"domain_scores_gemma":[0.9964406,0.0013411219,0.00028010327,0.0010978269,0.00070196745,0.00013837662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013776073,0.00093810435,0.0008604258,0.0022546195,0.00038901062,0.0018577548,0.0018538091,0.00092431734,0.006275645],"category_scores_gemma":[0.0057416954,0.00053427916,0.0008064339,0.0023157662,0.00047402777,0.0021897983,0.0019558307,0.0013052642,0.0030014222],"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.00063824,0.0002314572,0.0057171187,0.0003266299,0.00009957594,0.00030775592,0.00020860003,0.01661978,0.022832159,0.015901854,0.018846873,0.9182698],"study_design_scores_gemma":[0.00008247831,0.0002536422,0.0025244805,0.000087327986,0.0000667582,0.0009948035,0.00013073639,0.88160527,0.03755216,0.04716257,0.029478343,0.00006144262],"about_ca_topic_score_codex":0.0014668397,"about_ca_topic_score_gemma":0.0019733075,"teacher_disagreement_score":0.006275645,"about_ca_system_score_codex":0.00047707584,"about_ca_system_score_gemma":0.0006553618,"threshold_uncertainty_score":0.020994127},"labels":[],"label_agreement":null},{"id":"W4407914115","doi":"10.1007/978-3-031-84356-3_16","title":"Eigenmaps - Modified PCA-Based Approach for Dimensionality Reduction of Multivariate Time Series of Geospatial Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dimensionality reduction; Geospatial analysis; Computer science; Multivariate statistics; Curse of dimensionality; Principal component analysis; Artificial intelligence; Time series; Series (stratigraphy); Pattern recognition (psychology); Data mining; Machine learning; Cartography; Geography","score_opus":0.036776874747852274,"score_gpt":0.28756765306749205,"score_spread":0.25079077831963975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407914115","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.0033035753,0.0005214243,0.993628,0.00008693753,0.00015005021,0.00003179401,0.00034634053,0.0009738375,0.0009580098],"genre_scores_gemma":[0.05588241,0.0013724357,0.9304916,0.00012537141,0.00017346474,0.00024239927,0.0024471516,0.0004510473,0.008814074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993685,0.00012940657,0.00004133342,0.00013783354,0.0002796134,0.000043342505],"domain_scores_gemma":[0.9996068,0.00010906909,0.000024512583,0.00006768025,0.00017461168,0.000017375181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048222995,0.00097492716,0.0007714241,0.0010692669,0.00039693716,0.0010226322,0.0008714848,0.00054879644,0.0040889825],"category_scores_gemma":[0.0014287872,0.00031416496,0.001645542,0.0025847356,0.00037944678,0.0009404737,0.00091499987,0.0012173296,0.0021269135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011875814,0.000108359585,0.00055351126,0.0003052701,0.00020658149,0.00014412336,0.00016840827,0.04328292,0.026727237,0.01998812,0.02295088,0.8854459],"study_design_scores_gemma":[0.000012018163,0.0001003673,0.0032890898,0.000040575385,0.00007021383,0.00037032034,0.00008349055,0.92268044,0.015437052,0.025436334,0.03239552,0.000084562416],"about_ca_topic_score_codex":0.0022804488,"about_ca_topic_score_gemma":0.003093835,"teacher_disagreement_score":0.0040889825,"about_ca_system_score_codex":0.00024703448,"about_ca_system_score_gemma":0.00064810447,"threshold_uncertainty_score":0.013678968},"labels":[],"label_agreement":null},{"id":"W4407914181","doi":"10.1007/978-3-031-84353-2_14","title":"Smooth Quadrature-Inspired Generalized Choquet Integral in an Application to Drone Engine Failures Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision 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":"Quadrature (astronomy); Computer science; Choquet integral; Drone; Applied mathematics; Artificial intelligence; Mathematics; Physics; Optics","score_opus":0.04687277275633937,"score_gpt":0.3622807494948453,"score_spread":0.3154079767385059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407914181","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.017139832,0.0011509783,0.97837836,0.000094013645,0.00015634319,0.000012568754,0.00001266349,0.00013335503,0.0029217906],"genre_scores_gemma":[0.6274192,0.0013797982,0.3643458,0.00012408629,0.00017258724,0.000028372706,0.000044487617,0.00007880998,0.006406953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987733,0.00003317165,0.0000054096113,0.000023027042,0.000050369268,0.000010695504],"domain_scores_gemma":[0.99983263,0.000081368475,0.000009755834,0.000010167631,0.00005639612,0.000009710575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464435,0.00035463748,0.0006732739,0.0003944859,0.00019189219,0.00064991246,0.0005349192,0.0007502528,0.0008199891],"category_scores_gemma":[0.00082872953,0.00016871982,0.0005623568,0.0005803082,0.00036550497,0.00037052963,0.0005762741,0.0006704406,0.00016976263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032942597,0.00016800722,0.0010230968,0.0004796434,0.00013257856,0.00040381364,0.00022993908,0.4519164,0.089867204,0.13030516,0.0030319458,0.3221128],"study_design_scores_gemma":[0.0000037933717,0.000034541634,0.00013659161,0.0000060532875,0.000011596786,0.000053013788,0.0000066479824,0.9918933,0.0014047952,0.005496179,0.0009460455,0.000007407609],"about_ca_topic_score_codex":0.00075953954,"about_ca_topic_score_gemma":0.0008092418,"teacher_disagreement_score":0.0008199891,"about_ca_system_score_codex":0.00022518155,"about_ca_system_score_gemma":0.00023145878,"threshold_uncertainty_score":0.002743125},"labels":[],"label_agreement":null},{"id":"W4407914197","doi":"10.1007/978-3-031-81596-6_8","title":"Memory Augmented Multi-agent Reinforcement Learning for Cooperative Environment","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Reinforcement learning; Human–computer interaction; Artificial intelligence","score_opus":0.022046313600716162,"score_gpt":0.25488716534788347,"score_spread":0.23284085174716732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407914197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030228226,0.00038817976,0.964469,0.000086171756,0.000069153844,0.000030120571,0.000019057721,0.0004608478,0.004249199],"genre_scores_gemma":[0.9248641,0.00016547846,0.06923698,0.000046153513,0.000031998796,0.000103667204,0.000040548526,0.000043258548,0.0054678195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981123,0.000053416396,0.0000096805015,0.00004254943,0.00004671928,0.000036392197],"domain_scores_gemma":[0.9995604,0.00023759993,0.000045889064,0.000051354124,0.000074611286,0.0000300982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050170074,0.00056989107,0.0007622641,0.00021369838,0.00032290502,0.0005599767,0.0012497107,0.0007451803,0.002534224],"category_scores_gemma":[0.0012236072,0.00026350172,0.0003397893,0.00023297252,0.00053852453,0.00070094725,0.0014417794,0.0010000422,0.00037322342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010738824,0.00007997322,0.00019588294,0.00006530375,0.000033119777,0.00007365694,0.00006591977,0.9069747,0.0034574852,0.0076329517,0.0010796076,0.080233924],"study_design_scores_gemma":[0.0000064677934,0.000029015071,0.00003506701,0.0000022379545,0.0000034061948,0.000008418073,0.0000031889301,0.99707806,0.00035868763,0.0022334848,0.0002395157,0.0000024440515],"about_ca_topic_score_codex":0.002894552,"about_ca_topic_score_gemma":0.0029304395,"teacher_disagreement_score":0.002894552,"about_ca_system_score_codex":0.00043387298,"about_ca_system_score_gemma":0.00043487397,"threshold_uncertainty_score":0.008477807},"labels":[],"label_agreement":null},{"id":"W4407914267","doi":"10.1007/978-3-031-84356-3_9","title":"On Handling AI Tasks in CPU with Low Latency and High Performance","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Latency (audio); Operating system; Embedded system; Parallel computing; Telecommunications","score_opus":0.007400626216228475,"score_gpt":0.22640624453509894,"score_spread":0.21900561831887047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407914267","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.06261823,0.008621576,0.88038856,0.0013618353,0.0014535757,0.00030971944,0.0004023056,0.0060544405,0.038789757],"genre_scores_gemma":[0.37291735,0.0042835614,0.56989837,0.0010308548,0.0009768517,0.00032808894,0.0011502114,0.0011966936,0.048218023],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994074,0.000094325456,0.000054329004,0.0000929072,0.0002000444,0.00015095781],"domain_scores_gemma":[0.99825436,0.00087347097,0.00006514114,0.00036161696,0.00034905353,0.000096455246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059758476,0.0009126159,0.0005819882,0.00071853976,0.0010268169,0.0017138803,0.0022752308,0.0005953727,0.008980165],"category_scores_gemma":[0.002849572,0.0003567342,0.00043715455,0.0017055545,0.0005531932,0.002658273,0.0016485174,0.0014689197,0.002664657],"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.0014210314,0.00027026207,0.0020768244,0.00072222215,0.00008715763,0.00041044914,0.00050545414,0.05500802,0.044472717,0.04136835,0.05403932,0.7996182],"study_design_scores_gemma":[0.000121613775,0.00048256546,0.0019240526,0.0001516195,0.00013037278,0.00061641005,0.00038324136,0.8176624,0.03378826,0.080504864,0.064163536,0.00007105301],"about_ca_topic_score_codex":0.0040399227,"about_ca_topic_score_gemma":0.0048369397,"teacher_disagreement_score":0.008980165,"about_ca_system_score_codex":0.0005890872,"about_ca_system_score_gemma":0.0012550803,"threshold_uncertainty_score":0.030041635},"labels":[],"label_agreement":null},{"id":"W4407934590","doi":"10.1007/978-3-031-81010-7_20","title":"Machine Learning and Optimization Algorithms for Feature Selection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Feature selection; Selection (genetic algorithm); Artificial intelligence; Machine learning; Feature (linguistics); Algorithm; Pattern recognition (psychology)","score_opus":0.01164240956668274,"score_gpt":0.24994856431448711,"score_spread":0.23830615474780437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407934590","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.0009097343,0.0035399878,0.9933096,0.00011777968,0.00013563005,0.000020560905,0.000099400495,0.0004907909,0.0013764942],"genre_scores_gemma":[0.04316908,0.0046437015,0.93711025,0.00016952518,0.0005072287,0.00029947882,0.0008741097,0.00052364747,0.012702942],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916315,0.00025744297,0.00005714305,0.0001899832,0.0002824305,0.00004984267],"domain_scores_gemma":[0.99875975,0.0008378808,0.00005215456,0.00015323027,0.00017885618,0.000018212595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010408042,0.0013979592,0.0023546114,0.0010607783,0.00045853885,0.0013015573,0.0020298692,0.0011299939,0.009206573],"category_scores_gemma":[0.004215182,0.00065072783,0.0012689262,0.0034021824,0.0006873024,0.0015601343,0.0010136126,0.0020882126,0.004844874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008344089,0.00006134319,0.0002429611,0.00028703455,0.00008279147,0.000058965776,0.000031360807,0.11426317,0.0024507495,0.022034938,0.020543743,0.8398595],"study_design_scores_gemma":[0.00002269535,0.00004061041,0.0004929779,0.00003909743,0.000027720687,0.00012898703,0.000015330528,0.9304368,0.0018122065,0.05435982,0.012595904,0.00002777274],"about_ca_topic_score_codex":0.0023326844,"about_ca_topic_score_gemma":0.0022608559,"teacher_disagreement_score":0.009206573,"about_ca_system_score_codex":0.00052445557,"about_ca_system_score_gemma":0.0005495774,"threshold_uncertainty_score":0.030799031},"labels":[],"label_agreement":null},{"id":"W4407934871","doi":"10.1007/978-3-031-81010-7_14","title":"Navigating Smart Order Routing in Fixed Income Trading with Linear Programming and Dijkstra’s Algorithm","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Wilfrid Laurier University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Order (exchange); Linear programming; Routing (electronic design automation); Algorithm; Routing algorithm; Theoretical computer science; Shortest path problem; Computer network; Finance; Routing protocol; Economics","score_opus":0.016239443112108343,"score_gpt":0.2284828618306988,"score_spread":0.21224341871859045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407934871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030148333,0.00042422215,0.9614493,0.0002455748,0.00007399507,0.000059299517,0.00018811894,0.00077020196,0.0066409465],"genre_scores_gemma":[0.30745515,0.00033824783,0.68109643,0.00011848277,0.000042089854,0.00014476209,0.0004667132,0.0003639443,0.0099742105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.00019928461,0.000036463978,0.00018814216,0.0001093239,0.000079424535],"domain_scores_gemma":[0.9986009,0.0010365342,0.00007617361,0.000116939686,0.000108336,0.0000611382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044079,0.0009610137,0.0021239624,0.0012751191,0.0011536349,0.0025506103,0.0022185303,0.0020343647,0.007218767],"category_scores_gemma":[0.0041173366,0.0015457474,0.0013383222,0.0025367977,0.0013635001,0.0030595993,0.0022878794,0.0016445912,0.0009929924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001124707,0.00007579567,0.00040756763,0.00007979824,0.000037207366,0.00007328497,0.00010586896,0.9028024,0.00067431625,0.04013355,0.002427997,0.053069755],"study_design_scores_gemma":[0.000008178301,0.0000063702337,0.000018735589,0.0000035385867,0.0000032936732,0.000006925825,0.000009254044,0.9850144,0.00009786619,0.014418411,0.00040900364,0.0000040012483],"about_ca_topic_score_codex":0.017949618,"about_ca_topic_score_gemma":0.017147906,"teacher_disagreement_score":0.017949618,"about_ca_system_score_codex":0.0013994505,"about_ca_system_score_gemma":0.0016209038,"threshold_uncertainty_score":0.035690248},"labels":[],"label_agreement":null},{"id":"W4408015791","doi":"10.1007/978-981-96-1483-7_30","title":"Discovering Causal Relationships in Noisy Web Data for Sentiment Classification Using Attention Mechanisms","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Université TÉLUQ","funders":"","keywords":"Computer science; Sentiment analysis; Noisy data; Artificial intelligence; Natural language processing; Information retrieval; Data mining; Data science","score_opus":0.09704578524984683,"score_gpt":0.3170682906530183,"score_spread":0.22002250540317145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408015791","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.12685357,0.0016434562,0.86509514,0.0014487649,0.00014598457,0.00018077303,0.0010044832,0.0012248501,0.002402991],"genre_scores_gemma":[0.85778993,0.0010507865,0.13692772,0.00022294572,0.0004091049,0.00020560515,0.0016770902,0.00010084876,0.0016159316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844617,0.00060822885,0.00013027184,0.00042190248,0.00026581535,0.00012765544],"domain_scores_gemma":[0.9844589,0.013018765,0.0009455298,0.0007816278,0.0006185535,0.00017659337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041435333,0.0008021023,0.0010549317,0.0031803227,0.0007596449,0.0021136065,0.0012718637,0.0011814467,0.0032363217],"category_scores_gemma":[0.020521846,0.0006162261,0.0013619219,0.002662305,0.00071709533,0.0045289174,0.0013654954,0.002457501,0.00066321896],"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.00094239006,0.0012636866,0.060874753,0.0007870885,0.0008696346,0.000989348,0.0007804273,0.11463988,0.020297036,0.082767524,0.012518851,0.7032695],"study_design_scores_gemma":[0.000024505984,0.000047416423,0.0041042874,0.000040667102,0.00013130881,0.00006967264,0.000072697934,0.92340803,0.00198319,0.06918897,0.0009117968,0.000017445822],"about_ca_topic_score_codex":0.0029754117,"about_ca_topic_score_gemma":0.0031117569,"teacher_disagreement_score":0.0041435333,"about_ca_system_score_codex":0.0011366453,"about_ca_system_score_gemma":0.0009802314,"threshold_uncertainty_score":0.02191335},"labels":[],"label_agreement":null},{"id":"W4408015808","doi":"10.1007/978-981-96-1483-7_36","title":"Urban Computing for Disease Prediction: Type 2 Diabetes Case","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Type (biology); Artificial intelligence","score_opus":0.0155445959244257,"score_gpt":0.27065328937758903,"score_spread":0.25510869345316334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408015808","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.5568118,0.016623601,0.15331939,0.046748627,0.0017710938,0.00021207579,0.0043105255,0.00097396557,0.21922888],"genre_scores_gemma":[0.9504224,0.0039623636,0.022989409,0.0005533865,0.00050649146,0.000041332027,0.0007484838,0.00008599789,0.020690182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998246,0.000066533714,0.000009123046,0.000019493185,0.000037902035,0.000042365195],"domain_scores_gemma":[0.9995216,0.00031419215,0.00002645126,0.000038005994,0.00004491023,0.00005478513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031912662,0.00039825353,0.00026286463,0.0005505363,0.0004456617,0.0009123511,0.00056195253,0.0006853689,0.0046420353],"category_scores_gemma":[0.0016560836,0.0001422706,0.0003184188,0.0011275536,0.00031139268,0.0005057913,0.0005519513,0.0007753921,0.0006720898],"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.000600136,0.0006402888,0.11400831,0.00022869208,0.000083735766,0.0304343,0.0005676817,0.072093844,0.0015191357,0.06736794,0.20425151,0.50820446],"study_design_scores_gemma":[0.00007994011,0.00027640598,0.043767307,0.00022146922,0.000116403724,0.02525947,0.0023242168,0.707865,0.0027275907,0.1226491,0.094641134,0.000072048926],"about_ca_topic_score_codex":0.0068083634,"about_ca_topic_score_gemma":0.009953019,"teacher_disagreement_score":0.0068083634,"about_ca_system_score_codex":0.00036899047,"about_ca_system_score_gemma":0.00031759357,"threshold_uncertainty_score":0.015529156},"labels":[],"label_agreement":null},{"id":"W4408016016","doi":"10.1007/978-981-96-1483-7_31","title":"Psychological Profiling in Cybersecurity: A Look at LLMs and Psycholinguistic Features","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; Université de Sherbrooke; Aboriginal Affairs Northern Dev Canada","funders":"","keywords":"Profiling (computer programming); Computer science; Computer security; Programming language","score_opus":0.03238321765130749,"score_gpt":0.36534935788156275,"score_spread":0.3329661402302553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408016016","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.113335855,0.063575745,0.084184386,0.032002162,0.0014420265,0.000060846603,0.00015208003,0.00032529372,0.7049216],"genre_scores_gemma":[0.9167227,0.011900898,0.011749624,0.0019669526,0.0010150223,0.000047499514,0.0000698149,0.00016115334,0.056366313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963176,0.00018063275,0.000018452922,0.00004129029,0.00008860223,0.000039168164],"domain_scores_gemma":[0.9985083,0.001108287,0.00012343764,0.000075961325,0.000108642955,0.00007531199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057093217,0.00025260763,0.00020116063,0.0011471114,0.00097091775,0.004441655,0.00039544847,0.00076413143,0.0033456376],"category_scores_gemma":[0.002643269,0.00016405838,0.00018499557,0.0016820119,0.0028241512,0.0051212357,0.0011812611,0.0017536393,0.00052237563],"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.000036187277,0.00007859859,0.0039462596,0.00026167982,0.000007860613,0.00026889498,0.017193427,0.0005205105,0.002999396,0.7447204,0.010739646,0.21922709],"study_design_scores_gemma":[0.0000051431166,0.000095349904,0.0256836,0.0006307082,0.000018112682,0.0015374048,0.01885062,0.004154322,0.0021143865,0.68307096,0.26379013,0.00004932189],"about_ca_topic_score_codex":0.0011162099,"about_ca_topic_score_gemma":0.0018345158,"teacher_disagreement_score":0.004441655,"about_ca_system_score_codex":0.0012823049,"about_ca_system_score_gemma":0.0006398265,"threshold_uncertainty_score":0.011192262},"labels":[],"label_agreement":null},{"id":"W4408040452","doi":"10.1007/978-3-031-81824-0_16","title":"Ursa Minor: The Implementation Framework for Polaris","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Minor (academic); Operating system; Humanities; Art","score_opus":0.01505837408913735,"score_gpt":0.29469637401079607,"score_spread":0.2796379999216587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408040452","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002950175,0.0005375989,0.70135754,0.0003525656,0.00050249463,0.0002508586,0.0025257345,0.24140978,0.050113227],"genre_scores_gemma":[0.11920144,0.0017906076,0.5569092,0.0017167813,0.00042501907,0.0014024968,0.018034197,0.15142614,0.14909413],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894696,0.00019007947,0.00008553225,0.00019997722,0.00037803798,0.00019946047],"domain_scores_gemma":[0.9991843,0.00016359986,0.00004642784,0.00032928723,0.00020650432,0.00006977651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172035,0.0015547563,0.0008597756,0.0010816993,0.0008631455,0.0031637314,0.002922081,0.0011771931,0.0772957],"category_scores_gemma":[0.0030651707,0.0013347008,0.001399949,0.0009605176,0.00083952997,0.0037421538,0.0030605756,0.0024187234,0.06300188],"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.0014245679,0.00020722764,0.0013608218,0.0009198031,0.00012698959,0.00031835854,0.00060857425,0.0044582095,0.020863215,0.1623206,0.39169177,0.4156999],"study_design_scores_gemma":[0.00029901692,0.00015373866,0.0005033743,0.0002551819,0.00008454518,0.0005571341,0.00016389573,0.03605318,0.052462045,0.066366926,0.8429811,0.000119815406],"about_ca_topic_score_codex":0.00231067,"about_ca_topic_score_gemma":0.0023077817,"teacher_disagreement_score":0.0772957,"about_ca_system_score_codex":0.0009187887,"about_ca_system_score_gemma":0.0015771346,"threshold_uncertainty_score":0.25857985},"labels":[],"label_agreement":null},{"id":"W4408040462","doi":"10.1007/978-3-031-81824-0_4","title":"Fast Decoding of Group Testing Results from Reed-Solomon d-Disjunct Matrices","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced biosensing and bioanalysis techniques","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 Ottawa","funders":"","keywords":"Disjunct; Computer science; Decoding methods; Group testing; Reed–Solomon error correction; Group (periodic table); Algorithm; Combinatorics; Mathematics; Chemistry; Demography; Block code; Concatenated error correction code; Organic chemistry","score_opus":0.014189354439701742,"score_gpt":0.261029865648008,"score_spread":0.24684051120830627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408040462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06616842,0.0010345117,0.9059733,0.0010969266,0.0003394224,0.00026833292,0.0008226985,0.004086245,0.020210175],"genre_scores_gemma":[0.42828605,0.0006813256,0.55188304,0.0007221298,0.00040702743,0.000489183,0.0018671375,0.0009699948,0.014694156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660254,0.0011586904,0.0001894817,0.0003985037,0.0012394958,0.0004112932],"domain_scores_gemma":[0.9879552,0.009417155,0.00042989565,0.0011037712,0.00092842407,0.00016562086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018670016,0.0019633744,0.0011872912,0.0013913348,0.0006408017,0.0020151734,0.0010999647,0.0012481071,0.008443036],"category_scores_gemma":[0.008981939,0.0005358528,0.00088271155,0.0015453502,0.0011066899,0.0022212067,0.002238413,0.001760769,0.0042228703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023653354,0.0002300219,0.0014246966,0.00090460305,0.00018210795,0.00084088335,0.00063547125,0.056651313,0.08173412,0.1332879,0.02340764,0.69833595],"study_design_scores_gemma":[0.00033866643,0.0007964801,0.00092984847,0.00024159398,0.00010591798,0.0010983577,0.00021023084,0.51333076,0.12641704,0.3416864,0.014741975,0.00010272289],"about_ca_topic_score_codex":0.00065163145,"about_ca_topic_score_gemma":0.0010272107,"teacher_disagreement_score":0.008443036,"about_ca_system_score_codex":0.0010953184,"about_ca_system_score_gemma":0.001265669,"threshold_uncertainty_score":0.028244734},"labels":[],"label_agreement":null},{"id":"W4408040716","doi":"10.1007/978-3-031-81824-0_11","title":"Counting Polynomials with Distinct Roots Using Subset Sum","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Combinatorics; Discrete mathematics; Mathematics","score_opus":0.017306418751654375,"score_gpt":0.24100902957512516,"score_spread":0.2237026108234708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408040716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062750325,0.0013849374,0.826431,0.0018837644,0.0007651375,0.00015027168,0.00061503187,0.0020639335,0.10395558],"genre_scores_gemma":[0.54767287,0.0019005883,0.37867773,0.0009671794,0.0016562869,0.00041581763,0.0010931541,0.001946488,0.065669924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981622,0.00042279373,0.00007937924,0.00039674828,0.0007201359,0.00021882163],"domain_scores_gemma":[0.9962586,0.002197826,0.00020934764,0.0007523349,0.0003951862,0.00018663856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038477,0.0013961059,0.0022989747,0.0030931188,0.0022147526,0.00415248,0.0026455994,0.0012123793,0.012232399],"category_scores_gemma":[0.0068380856,0.0010878926,0.0013903176,0.004979587,0.0022795289,0.008411179,0.00366045,0.004617999,0.0033359951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007587022,0.000046007084,0.0002681225,0.00015442759,0.000021047836,0.0000518576,0.00015097606,0.0030323889,0.0024027342,0.9128102,0.010009542,0.07097681],"study_design_scores_gemma":[0.000013530708,0.000015964537,0.00011579715,0.000025121468,0.000024295676,0.00013293845,0.000026846737,0.017941846,0.0018686736,0.97210073,0.0077132387,0.000021017555],"about_ca_topic_score_codex":0.0007000123,"about_ca_topic_score_gemma":0.0011877579,"teacher_disagreement_score":0.012232399,"about_ca_system_score_codex":0.0021201416,"about_ca_system_score_gemma":0.0008607703,"threshold_uncertainty_score":0.04092145},"labels":[],"label_agreement":null},{"id":"W4408063720","doi":"10.1007/978-981-96-1483-7_26","title":"Deepfake Detection in Cancer Medical Imaging Using CNN Architectures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Université TÉLUQ","funders":"","keywords":"Computer science; Artificial intelligence; Cancer detection; Medical imaging; Cancer; Machine learning; Medicine","score_opus":0.01664385121022629,"score_gpt":0.2952214120771828,"score_spread":0.2785775608669565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408063720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043188628,0.009041528,0.9319464,0.001143594,0.00041976414,0.00012286425,0.000941086,0.0039054537,0.00929064],"genre_scores_gemma":[0.5018816,0.007943816,0.44728845,0.0009333379,0.0002932228,0.00011460048,0.0020672882,0.00052467256,0.038952984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998591,0.000016413249,0.000006726548,0.000035326837,0.000048501355,0.000034004894],"domain_scores_gemma":[0.9998166,0.0000716849,0.000016490152,0.000024608713,0.000056795478,0.000013825435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045676174,0.00093580433,0.00060080376,0.00067859294,0.00021369797,0.0010161429,0.0010298544,0.0011626906,0.003834308],"category_scores_gemma":[0.00088563864,0.0005471386,0.0006445499,0.0005637782,0.00021578642,0.0008190743,0.0007967413,0.0008607317,0.0014093322],"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.00027918408,0.00008796319,0.0023994308,0.0004560201,0.00013844889,0.00035998036,0.000055518653,0.04623665,0.060279876,0.0056447485,0.015110883,0.8689514],"study_design_scores_gemma":[0.000012055299,0.000112366084,0.0021158983,0.00010453813,0.000101289756,0.0008485033,0.000029697481,0.91105044,0.06586867,0.0061635575,0.0135654025,0.000027633934],"about_ca_topic_score_codex":0.004549656,"about_ca_topic_score_gemma":0.00991823,"teacher_disagreement_score":0.004549656,"about_ca_system_score_codex":0.0006502914,"about_ca_system_score_gemma":0.00055264746,"threshold_uncertainty_score":0.012827039},"labels":[],"label_agreement":null},{"id":"W4408078471","doi":"10.1007/978-3-031-82021-2_7","title":"SPARC: Shared Perspective with Avatar Distortion for Remote Collaboration in VR","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Avatar; Computer science; Perspective (graphical); Distortion (music); Human–computer interaction; Computer graphics (images); Virtual reality; Artificial intelligence; Telecommunications","score_opus":0.01761621301722848,"score_gpt":0.2889430287734618,"score_spread":0.2713268157562333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408078471","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01755536,0.00053489796,0.9544974,0.000120232115,0.0001824476,0.00013100503,0.00022914477,0.0062910668,0.020458423],"genre_scores_gemma":[0.36800814,0.0007024421,0.60297227,0.00015863415,0.00010338737,0.00027809688,0.0008351126,0.0022633753,0.024678538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990928,0.00018283165,0.000024799985,0.00017610805,0.00042568697,0.000097760305],"domain_scores_gemma":[0.99941194,0.00021439676,0.000023350301,0.00018904502,0.00008485449,0.000076412645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054264197,0.0011794206,0.00079870486,0.00035303296,0.00052503456,0.0015051063,0.0019358674,0.0010538418,0.026024673],"category_scores_gemma":[0.0014672274,0.00056080084,0.0008414593,0.00035721489,0.0007508887,0.0019180733,0.004005799,0.0017447701,0.004243005],"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.0010280658,0.0003722634,0.0005204777,0.0006783164,0.00013139329,0.0005770316,0.0021994384,0.030660635,0.15832047,0.05587291,0.023227666,0.7264114],"study_design_scores_gemma":[0.0006299806,0.0015366693,0.0028817223,0.0003078739,0.00026641294,0.0041242447,0.0013959021,0.50656277,0.18526033,0.06007139,0.23660417,0.0003585043],"about_ca_topic_score_codex":0.0009964231,"about_ca_topic_score_gemma":0.0014432803,"teacher_disagreement_score":0.026024673,"about_ca_system_score_codex":0.00038827665,"about_ca_system_score_gemma":0.0004990943,"threshold_uncertainty_score":0.08706117},"labels":[],"label_agreement":null},{"id":"W4408095412","doi":"10.1007/978-3-031-82240-7_11","title":"Lightweight Unsupervised Federated Learning with Pretrained Vision Language Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Computer science; Unsupervised learning; Artificial intelligence; Language model; Natural language processing; Computer vision","score_opus":0.013321459561208466,"score_gpt":0.2507358033009085,"score_spread":0.23741434373970002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408095412","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.011914301,0.0003620438,0.9634052,0.00017620188,0.0001560196,0.00007818069,0.00065272534,0.02158486,0.001670537],"genre_scores_gemma":[0.33537847,0.00036617016,0.63778967,0.0006663331,0.00019240759,0.00034767226,0.007658228,0.001237609,0.016363462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.0001962105,0.000072443385,0.00049871847,0.00037589588,0.00022489317],"domain_scores_gemma":[0.9984744,0.00032366213,0.000064517386,0.0007705761,0.0002988231,0.00006790197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011485388,0.0012300401,0.0018116625,0.0010875465,0.000758344,0.0016879009,0.0030877918,0.0017039614,0.007963268],"category_scores_gemma":[0.0030721652,0.0006787013,0.001725985,0.0012245511,0.00058346026,0.0037837604,0.0032088005,0.0022722648,0.0084607825],"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.0006284706,0.00065036473,0.0014746352,0.000126537,0.00023690505,0.00019638622,0.00006329774,0.049122185,0.027417805,0.007881806,0.022936918,0.8892647],"study_design_scores_gemma":[0.00003476518,0.000071358554,0.00033202412,0.000013082203,0.000044548025,0.00018068952,0.000028483424,0.9629068,0.018242553,0.014941131,0.0031779904,0.000026666448],"about_ca_topic_score_codex":0.007223532,"about_ca_topic_score_gemma":0.011387421,"teacher_disagreement_score":0.007963268,"about_ca_system_score_codex":0.0009157241,"about_ca_system_score_gemma":0.0020405876,"threshold_uncertainty_score":0.02663982},"labels":[],"label_agreement":null},{"id":"W4408106460","doi":"10.1007/978-3-031-82481-4_26","title":"Augmented Human-AI Forecasting for Ship Refit Project Scheduling: A Predict-then-Optimize Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"Thales (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Artificial intelligence; Operations research; Engineering; Operations management","score_opus":0.03552596327367583,"score_gpt":0.2562589204819664,"score_spread":0.2207329572082906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408106460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05015559,0.0006966883,0.93813133,0.0004629087,0.00017975419,0.000061876905,0.0004501797,0.002178955,0.007682792],"genre_scores_gemma":[0.87123024,0.000266836,0.122054115,0.00013235329,0.00017279417,0.000086639295,0.00038599205,0.0001356837,0.0055353334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996377,0.00010193021,0.000018944864,0.00010174743,0.0000716517,0.00006805503],"domain_scores_gemma":[0.9994041,0.000339325,0.000059538368,0.000058891994,0.00010145643,0.00003669532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080609164,0.0011913254,0.0016684391,0.0009902249,0.000641627,0.0014398174,0.0015963757,0.0012133948,0.0042550457],"category_scores_gemma":[0.0013731531,0.000869785,0.00087585027,0.0014651931,0.00054557796,0.0010850137,0.00083643774,0.0011765183,0.00072613003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009258222,0.00007064184,0.00048101365,0.000026542179,0.000052655505,0.000031503507,0.000027007842,0.94076526,0.0005002636,0.0014566819,0.000966367,0.05552945],"study_design_scores_gemma":[0.0000028015802,0.000010074427,0.00010806257,0.0000014340847,0.000004886261,0.0000027996143,0.0000034673703,0.99885345,0.0000967353,0.00076961465,0.00014372545,0.0000028384159],"about_ca_topic_score_codex":0.031977817,"about_ca_topic_score_gemma":0.035535906,"teacher_disagreement_score":0.031977817,"about_ca_system_score_codex":0.0006882413,"about_ca_system_score_gemma":0.0014274986,"threshold_uncertainty_score":0.063583374},"labels":[],"label_agreement":null},{"id":"W4408107786","doi":"10.1007/978-3-031-82481-4_5","title":"Protein Sequence Generation Using Denoising Probabilistic Diffusion Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Probabilistic logic; Sequence (biology); Diffusion; Noise reduction; Artificial intelligence; Algorithm; Chemistry","score_opus":0.02435756534585107,"score_gpt":0.2743289694942021,"score_spread":0.24997140414835103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408107786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016906291,0.0001986983,0.97933835,0.00015147787,0.00007044107,0.00004365189,0.00006955563,0.0007920673,0.002429369],"genre_scores_gemma":[0.3113062,0.00043995364,0.67788994,0.00016113606,0.000051470903,0.00014064017,0.0005265787,0.0005197869,0.0089643365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998281,0.000028258139,0.000008569824,0.0000486861,0.000072291725,0.000014016943],"domain_scores_gemma":[0.99959034,0.00016941364,0.000030125604,0.000082166654,0.00009878691,0.000029183122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050249405,0.00037399415,0.00058301695,0.00049015466,0.00026816616,0.00044188515,0.0008274395,0.00096658384,0.0020912257],"category_scores_gemma":[0.0011318215,0.00039513517,0.0006418634,0.00048291255,0.00033457635,0.0009411371,0.00067379547,0.0007069973,0.00087675033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022277844,0.00008933895,0.00048037976,0.00016298398,0.000040250517,0.00024406321,0.00010236834,0.6788343,0.08760975,0.05862274,0.004381667,0.16920939],"study_design_scores_gemma":[0.000006061534,0.000010536878,0.000031955402,0.000002019052,0.00000261025,0.000034510733,0.0000017656041,0.9897601,0.0043085604,0.005126616,0.00071105856,0.000004097518],"about_ca_topic_score_codex":0.0009684109,"about_ca_topic_score_gemma":0.0008146538,"teacher_disagreement_score":0.0020912257,"about_ca_system_score_codex":0.00049373537,"about_ca_system_score_gemma":0.00039382163,"threshold_uncertainty_score":0.0069958568},"labels":[],"label_agreement":null},{"id":"W4408109928","doi":"10.1007/978-3-031-82475-3_23","title":"Two-Stage Synthetic Supervising and Multi-view Consistency Self-supervising Based Animal 3D Reconstruction by Single Image","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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 Alberta","funders":"","keywords":"Computer science; Single stage; Consistency (knowledge bases); Computer vision; Artificial intelligence; Stage (stratigraphy); Image (mathematics); Computer graphics (images)","score_opus":0.012778807003811026,"score_gpt":0.22000472402011634,"score_spread":0.2072259170163053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408109928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016229661,0.00013043336,0.9817856,0.000035066478,0.00002054079,0.00003253581,0.00006814737,0.0005098317,0.0011881678],"genre_scores_gemma":[0.17070405,0.00027659317,0.8223755,0.00006859549,0.000038717553,0.000057250963,0.0006374277,0.00039695046,0.005444973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999676,0.000028146478,0.000014046322,0.000092383765,0.00015392016,0.00003542051],"domain_scores_gemma":[0.9996824,0.000063609696,0.000028911334,0.00009825236,0.00010046156,0.00002630497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049937743,0.0006756596,0.0006939717,0.00062672526,0.00023445975,0.00065752864,0.0012635707,0.00077292183,0.0027356304],"category_scores_gemma":[0.00060604565,0.00057242543,0.00117599,0.0006667608,0.0004926144,0.00079433894,0.001036882,0.0007802288,0.0009140574],"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.00040863088,0.00010818805,0.0016147566,0.00027556176,0.00016252631,0.00022855133,0.00029254516,0.07525966,0.4054515,0.0092682,0.0023170991,0.5046128],"study_design_scores_gemma":[0.000012673102,0.00012728911,0.0023808149,0.000014498734,0.00007645563,0.0006689267,0.000047770394,0.9011942,0.087772116,0.0027430335,0.00491454,0.000047667276],"about_ca_topic_score_codex":0.001738055,"about_ca_topic_score_gemma":0.0026718697,"teacher_disagreement_score":0.0027356304,"about_ca_system_score_codex":0.00027619212,"about_ca_system_score_gemma":0.0005820248,"threshold_uncertainty_score":0.009151638},"labels":[],"label_agreement":null},{"id":"W4408109933","doi":"10.1007/978-3-031-82475-3_14","title":"Image Based Cattle Monitoring System","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT-based Smart Home Systems","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 Alberta","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence","score_opus":0.008109542725276501,"score_gpt":0.21125536925739266,"score_spread":0.20314582653211616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408109933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36808485,0.0043309755,0.44521347,0.0011198305,0.0014929188,0.0008823968,0.009225421,0.043815948,0.1258342],"genre_scores_gemma":[0.78098446,0.0014297033,0.10083396,0.0009797391,0.00037966119,0.00042278602,0.005461798,0.0003080366,0.10919985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.000015100025,0.0000072277353,0.00006581076,0.00008380263,0.000023786439],"domain_scores_gemma":[0.9998634,0.00001919446,0.000013332182,0.000013853628,0.000076243654,0.000013860712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016166046,0.0004886786,0.0006333113,0.0010703023,0.00029306643,0.0004785139,0.0008272566,0.00053881004,0.009749708],"category_scores_gemma":[0.00018312545,0.00018590872,0.00024691768,0.0006199595,0.00009093133,0.00036762987,0.0003655407,0.00023108679,0.0036818064],"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.001772613,0.00053162285,0.014318685,0.0005460925,0.00010707922,0.00074516254,0.00018481842,0.005109557,0.29566664,0.0008974786,0.05927869,0.62084156],"study_design_scores_gemma":[0.00037293456,0.0017277283,0.07992756,0.00016239857,0.00058556476,0.003009187,0.0004501604,0.4104447,0.37755275,0.0022784623,0.12323821,0.0002504199],"about_ca_topic_score_codex":0.0021366624,"about_ca_topic_score_gemma":0.0028817838,"teacher_disagreement_score":0.009749708,"about_ca_system_score_codex":0.00029918703,"about_ca_system_score_gemma":0.00019011817,"threshold_uncertainty_score":0.03261602},"labels":[],"label_agreement":null},{"id":"W4408109942","doi":"10.1007/978-3-031-82475-3_24","title":"Local Force Isotropy: A New Metric for Measuring Performance of Kinaesthetic Haptic Devices","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teleoperation and Haptic Systems","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":"Carleton University; CRC Robotics","funders":"","keywords":"Haptic technology; Computer science; Metric (unit); Isotropy; Simulation; Computer graphics (images); Physics; Optics; Engineering","score_opus":0.016748468263748078,"score_gpt":0.21806283813770336,"score_spread":0.2013143698739553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408109942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17287745,0.0020843039,0.79934835,0.00018165453,0.00020781638,0.00014804918,0.0007719924,0.0013111547,0.023069145],"genre_scores_gemma":[0.85758847,0.00090417516,0.1330502,0.000099991805,0.00017613896,0.00020324635,0.00084265287,0.0004121383,0.006723025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99822503,0.0002387762,0.00010994944,0.00022875147,0.0010767255,0.00012076344],"domain_scores_gemma":[0.99849415,0.00051172473,0.00027513568,0.00023319261,0.00036379418,0.00012203996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890687,0.001018236,0.0006577405,0.0026162136,0.00038356025,0.001738199,0.00084927434,0.0008041422,0.0035392717],"category_scores_gemma":[0.0030519527,0.0003001441,0.00041359654,0.0022742795,0.0013634169,0.002794467,0.001966739,0.00063981494,0.0010864085],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090088206,0.00021737257,0.011228246,0.000644809,0.00019772517,0.00030382504,0.0010609439,0.01474418,0.40785268,0.023819849,0.006149613,0.53287995],"study_design_scores_gemma":[0.00013733024,0.0042246403,0.20860069,0.00029218514,0.0004803707,0.0053835795,0.0027076264,0.35179067,0.31901026,0.06277006,0.043752167,0.0008504168],"about_ca_topic_score_codex":0.00064628274,"about_ca_topic_score_gemma":0.0006954389,"teacher_disagreement_score":0.0035392717,"about_ca_system_score_codex":0.00043226377,"about_ca_system_score_gemma":0.0003068703,"threshold_uncertainty_score":0.011840045},"labels":[],"label_agreement":null},{"id":"W4408109947","doi":"10.1007/978-3-031-82475-3_6","title":"Affine-Transformation-Invariant Image Classification by Differentiable Arithmetic Distribution Module","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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 Alberta","funders":"","keywords":"Affine transformation; Computer science; Invariant (physics); Differentiable function; Transformation (genetics); Arithmetic; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.0109624617456793,"score_gpt":0.2382316556398305,"score_spread":0.2272691938941512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408109947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045462906,0.0004543344,0.9472156,0.00009688996,0.00006157385,0.00002433488,0.000086164706,0.0007519632,0.0058461865],"genre_scores_gemma":[0.6824982,0.00088483305,0.2916002,0.00012306342,0.00020555852,0.0000545076,0.0006261473,0.00033784992,0.02366954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986744,0.00001582216,0.0000075102475,0.000042688553,0.000047535308,0.000018942712],"domain_scores_gemma":[0.99988055,0.000019547295,0.000020302783,0.000034733945,0.000033595763,0.000011229811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001806236,0.00029045754,0.00046298938,0.00077312224,0.00018747646,0.00058451033,0.00063457893,0.00026428472,0.0026485012],"category_scores_gemma":[0.00039618977,0.00013964792,0.00047815277,0.0008724773,0.00047064177,0.0010015335,0.0006859785,0.0005703325,0.0011389534],"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.0001183171,0.000074705466,0.0008809757,0.00012363782,0.000038977712,0.00011246803,0.000086143875,0.036116462,0.08661483,0.16928826,0.0062818145,0.7002634],"study_design_scores_gemma":[0.000011231038,0.0001242567,0.0016139623,0.000010401385,0.00003141159,0.00045077814,0.000028326063,0.87950945,0.034101296,0.073601305,0.010493373,0.000024235756],"about_ca_topic_score_codex":0.00060663105,"about_ca_topic_score_gemma":0.0005795258,"teacher_disagreement_score":0.0026485012,"about_ca_system_score_codex":0.00035513125,"about_ca_system_score_gemma":0.00028189292,"threshold_uncertainty_score":0.008860111},"labels":[],"label_agreement":null},{"id":"W4408109986","doi":"10.1007/978-3-031-82475-3_3","title":"Electrical Impedance Spectroscopy Sensorised Needle for Prostate Cancer Localisation During MRI-Ultrasound-Fused Targeted Biopsy","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spectroscopy Techniques in Biomedical and Chemical Research","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 Ottawa; Carleton University","funders":"","keywords":"Prostate cancer; Ultrasound; Biopsy; Prostate; Radiology; Medicine; Computer science; Cancer; Internal medicine","score_opus":0.007474122423049449,"score_gpt":0.2923787221523096,"score_spread":0.28490459972926013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408109986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105944686,0.022967724,0.85522574,0.00094915746,0.0006483203,0.00013002731,0.00060569175,0.001913907,0.011614829],"genre_scores_gemma":[0.7649744,0.009062247,0.19082089,0.00079583924,0.00027812866,0.00008427575,0.0004770423,0.00035404586,0.033153053],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997303,0.000039446364,0.000011576314,0.000062927895,0.00014088387,0.000014902946],"domain_scores_gemma":[0.9997681,0.000121633275,0.00003074799,0.000019742849,0.00004729086,0.000012516927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022949469,0.0003633844,0.00031140455,0.000260569,0.00010875464,0.0006100566,0.0006032587,0.0009996559,0.002852541],"category_scores_gemma":[0.00066116167,0.00028962357,0.00025689177,0.00029192588,0.00019090106,0.0007257046,0.000537798,0.0003279074,0.0017712336],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041611728,0.000030115623,0.00036924428,0.00038673411,0.000025747051,0.00020674481,0.00009943469,0.0029101565,0.87668437,0.0006144533,0.0014206795,0.116836205],"study_design_scores_gemma":[0.000043980002,0.0009234513,0.008411396,0.00020118977,0.00014800254,0.0048457403,0.00015952894,0.08241023,0.8670562,0.002006256,0.03369396,0.00010013168],"about_ca_topic_score_codex":0.00021203855,"about_ca_topic_score_gemma":0.00072813197,"teacher_disagreement_score":0.002852541,"about_ca_system_score_codex":0.00020508314,"about_ca_system_score_gemma":0.00018703811,"threshold_uncertainty_score":0.009542644},"labels":[],"label_agreement":null},{"id":"W4408109994","doi":"10.1007/978-3-031-82475-3_13","title":"Concept Factorization with Manifold and Orthogonal Constraint for Data Representation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","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":"Computer science; Representation (politics); Constraint (computer-aided design); Factorization; Manifold (fluid mechanics); Algebra over a field; Algorithm; Theoretical computer science; Mathematics; Pure mathematics; Geometry","score_opus":0.037979492656594824,"score_gpt":0.2929309165280201,"score_spread":0.2549514238714253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408109994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092662463,0.00071699836,0.9975318,0.00008806544,0.00005251075,0.000019365714,0.000066017245,0.00016034399,0.00043838657],"genre_scores_gemma":[0.051896285,0.0021016593,0.9417579,0.00013088247,0.00020916994,0.00020048398,0.00074408494,0.00012096837,0.002838546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876225,0.0003941251,0.00007320491,0.0002861287,0.00041401366,0.0000702912],"domain_scores_gemma":[0.99903274,0.0003898383,0.00006592253,0.00024828038,0.00023094301,0.000032283737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015253766,0.0008485812,0.0012853679,0.0010608687,0.00054042635,0.0013539393,0.001320833,0.00088004384,0.0035435085],"category_scores_gemma":[0.00420415,0.00041603518,0.0012502958,0.003185701,0.00085157173,0.0024525998,0.0017619233,0.002109983,0.0016486533],"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.00014140524,0.00008055814,0.00024878106,0.0004853457,0.0001064175,0.00012204876,0.00018612576,0.042718172,0.011765131,0.17279907,0.022373272,0.7489736],"study_design_scores_gemma":[0.000020499227,0.00009271206,0.00032792648,0.000059908747,0.00004345385,0.00035808046,0.00007114027,0.79285264,0.0051376647,0.18163268,0.019354187,0.000049095517],"about_ca_topic_score_codex":0.002807458,"about_ca_topic_score_gemma":0.0023847339,"teacher_disagreement_score":0.0035435085,"about_ca_system_score_codex":0.0005828989,"about_ca_system_score_gemma":0.0010926818,"threshold_uncertainty_score":0.011854172},"labels":[],"label_agreement":null},{"id":"W4408110000","doi":"10.1007/978-3-031-82475-3_9","title":"A Novel Framework for Assessing Products Case Study: Electric Drives for Terrestrial Vehicles","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electric Vehicles and Infrastructure","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 Alberta","funders":"","keywords":"Computer science","score_opus":0.018023383582353236,"score_gpt":0.2688211365610179,"score_spread":0.2507977529786647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408110000","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.016174644,0.00043215556,0.9407316,0.00092578767,0.000044588513,0.00051656266,0.0005223027,0.00033648204,0.0403159],"genre_scores_gemma":[0.27585196,0.00044142752,0.7145817,0.00016111777,0.000046088746,0.00044939577,0.00053530355,0.000086620035,0.007846287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99614954,0.0018420358,0.00023345581,0.00051676197,0.0010240057,0.00023424395],"domain_scores_gemma":[0.99546117,0.0023639277,0.0004120251,0.00037046228,0.0011877335,0.00020471164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00405336,0.0014888005,0.0006419699,0.0043334602,0.0012724246,0.0044904775,0.0028181525,0.002224863,0.007108557],"category_scores_gemma":[0.007971684,0.0004234387,0.00097215857,0.0032219174,0.0020830173,0.0039157793,0.0025436396,0.0015453243,0.0009399869],"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.00008537147,0.0004983752,0.009190999,0.00061020383,0.00013538272,0.0015384277,0.0022428832,0.13665074,0.0072079115,0.5994582,0.012187619,0.23019394],"study_design_scores_gemma":[0.000047910078,0.00026759075,0.005294761,0.0005261283,0.0001417747,0.0011288129,0.0040234174,0.551161,0.0046968586,0.37042376,0.06218846,0.00009949605],"about_ca_topic_score_codex":0.016329203,"about_ca_topic_score_gemma":0.022762593,"teacher_disagreement_score":0.016329203,"about_ca_system_score_codex":0.0024311142,"about_ca_system_score_gemma":0.003346396,"threshold_uncertainty_score":0.03246832},"labels":[],"label_agreement":null},{"id":"W4408110112","doi":"10.1007/978-3-031-82475-3_2","title":"Medical Image Denosing via Explainable AI Feature Preserving Loss","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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 Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Feature (linguistics); Image (mathematics); Pattern recognition (psychology); Computer vision; Linguistics","score_opus":0.009270335879796882,"score_gpt":0.28136037096117084,"score_spread":0.27209003508137397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408110112","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.008595135,0.00029117285,0.9884642,0.00018517305,0.000051075258,0.000022180275,0.000048759226,0.0004185769,0.0019238037],"genre_scores_gemma":[0.35457066,0.0010017928,0.6296935,0.00036463098,0.00021901575,0.000066934306,0.0003573307,0.0003350375,0.013391103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979216,0.000041475236,0.000010532815,0.000039119124,0.00009405235,0.000022722174],"domain_scores_gemma":[0.9996946,0.00010427824,0.000036261717,0.000095033116,0.000053705488,0.000016119915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052524806,0.00043354472,0.0003745774,0.0005243574,0.00014901883,0.00063452625,0.00055087253,0.0006563641,0.002207294],"category_scores_gemma":[0.0012870363,0.00020170299,0.0005058431,0.00037196226,0.00046510535,0.0007118895,0.00077100145,0.0011567688,0.00072160404],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004690555,0.000104998435,0.00061661674,0.00027495218,0.0001136219,0.00035719777,0.00013090941,0.12253795,0.17453994,0.07431684,0.0064080623,0.6201299],"study_design_scores_gemma":[0.000022271583,0.00013365218,0.0007822808,0.0000235683,0.00004030594,0.00078558264,0.000024252078,0.89932716,0.055873472,0.034916773,0.008049569,0.000021170112],"about_ca_topic_score_codex":0.00038097962,"about_ca_topic_score_gemma":0.00056286546,"teacher_disagreement_score":0.002207294,"about_ca_system_score_codex":0.00023964184,"about_ca_system_score_gemma":0.00024573214,"threshold_uncertainty_score":0.007384181},"labels":[],"label_agreement":null},{"id":"W4408110346","doi":"10.1007/978-3-031-82475-3_1","title":"Pattern Recognition in Apple Orchards During Dormancy and Bud Development","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological 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":"Dormancy; Computer science; Horticulture; Biology; Germination","score_opus":0.014100267626741048,"score_gpt":0.1976225772367814,"score_spread":0.18352230961004035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408110346","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.9870924,0.0016238594,0.0067150467,0.000060427836,0.000032718966,0.000024057908,0.00031593727,0.000094514726,0.004041211],"genre_scores_gemma":[0.98650336,0.00047365203,0.0042661014,0.00003178877,0.000010557508,0.000013272439,0.0004867406,0.000031378568,0.008183092],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994373,0.0000040364416,0.0000028411805,0.000025775014,0.0000109496605,0.000012606947],"domain_scores_gemma":[0.9998851,0.000037568057,0.000018210922,0.0000068903682,0.000023268414,0.000028985363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092642695,0.00011727465,0.00026816892,0.00029122288,0.0001587379,0.00048619628,0.00021817612,0.00026879506,0.0012283401],"category_scores_gemma":[0.00022353591,0.00013282796,0.00019012233,0.0002258675,0.00012216852,0.00027765508,0.00016710325,0.00019149939,0.00037644958],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008892484,0.00007636529,0.046349026,0.000120587945,0.000023614377,0.00038183486,0.00032405407,0.00082308025,0.84035736,0.0005424944,0.0006849324,0.10942729],"study_design_scores_gemma":[0.000010511251,0.00026587734,0.89376503,0.000018188108,0.000030254698,0.0005032083,0.0002730581,0.012081353,0.09078834,0.0004420136,0.0018040632,0.00001811649],"about_ca_topic_score_codex":0.0042263465,"about_ca_topic_score_gemma":0.0059378287,"teacher_disagreement_score":0.0042263465,"about_ca_system_score_codex":0.00030992838,"about_ca_system_score_gemma":0.00019544161,"threshold_uncertainty_score":0.00840354},"labels":[],"label_agreement":null},{"id":"W4408110400","doi":"10.1007/978-3-031-82475-3_16","title":"AF Mask R-CNN: Attention Fused Mask R-CNN Mechanism for Instance Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Computer science; Segmentation; Artificial intelligence; Mechanism (biology); Pattern recognition (psychology); Computer vision; Physics","score_opus":0.017521736767343567,"score_gpt":0.2669627276163726,"score_spread":0.24944099084902902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408110400","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.025012204,0.0025952198,0.9272598,0.00057520444,0.0007348934,0.00031121288,0.0021951564,0.027320843,0.013995382],"genre_scores_gemma":[0.3157567,0.0012440424,0.63971204,0.0011159567,0.000296889,0.00026905138,0.005847898,0.0016874003,0.03407006],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995927,0.00003681836,0.00001973276,0.00018567654,0.00008099301,0.00008400941],"domain_scores_gemma":[0.99968886,0.00005258693,0.000024576653,0.000114782335,0.00007812947,0.000041045067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005679633,0.0018459826,0.001230616,0.00095314434,0.000442938,0.0014498974,0.0039264923,0.0021530727,0.015815333],"category_scores_gemma":[0.0013570782,0.0007296122,0.0011702458,0.0010363996,0.00046348837,0.0021146084,0.0019832284,0.0017262775,0.006130917],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005742205,0.00022261623,0.00078932435,0.00033203047,0.00020350031,0.00027444251,0.000068028734,0.031842053,0.077802695,0.012421292,0.04750997,0.8279599],"study_design_scores_gemma":[0.000040488703,0.0001893303,0.00063588424,0.000050286082,0.00011363137,0.0002833659,0.000022709051,0.90651375,0.06380095,0.011798122,0.01651088,0.00004071635],"about_ca_topic_score_codex":0.010168636,"about_ca_topic_score_gemma":0.015830548,"teacher_disagreement_score":0.015815333,"about_ca_system_score_codex":0.00091707625,"about_ca_system_score_gemma":0.0012132574,"threshold_uncertainty_score":0.052907586},"labels":[],"label_agreement":null},{"id":"W4408110425","doi":"10.1007/978-3-031-82475-3_12","title":"Sliding Adaptive Dynamic Time Warping for Segment Matching in Surgical Simulation Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Surgical Simulation and Training","field":"Medicine","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":"Dynamic time warping; Computer science; Matching (statistics); Image warping; Artificial intelligence; Computer vision","score_opus":0.05134579653125677,"score_gpt":0.3378381739900536,"score_spread":0.28649237745879685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408110425","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.008696542,0.00050340313,0.98831755,0.000059778922,0.00009543839,0.0000310607,0.00016833455,0.0010852917,0.001042617],"genre_scores_gemma":[0.20087484,0.0017244151,0.7836065,0.000102061276,0.00014598315,0.00012326037,0.0016110177,0.00081992405,0.010992034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.000046894773,0.000022923337,0.000090268084,0.00011512632,0.000029572979],"domain_scores_gemma":[0.9995117,0.00027408524,0.000030449384,0.00009765162,0.0000696608,0.000016284894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470972,0.0005761289,0.00063305843,0.00076278835,0.00022743031,0.00072497845,0.00093225396,0.000776448,0.005906501],"category_scores_gemma":[0.0015596924,0.00042652836,0.0006337581,0.0014879098,0.0003113636,0.0007392048,0.0007839611,0.00091556844,0.0025426925],"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.00019905377,0.00004639091,0.00034009782,0.00014097712,0.00005738913,0.00015046503,0.000076105505,0.09157668,0.05190706,0.0035635866,0.005214443,0.84672767],"study_design_scores_gemma":[0.0000051634447,0.00007192184,0.0008173174,0.00001422069,0.000020170008,0.0002696142,0.000030250423,0.9641423,0.023987059,0.0043447595,0.006279422,0.000017740484],"about_ca_topic_score_codex":0.0016025886,"about_ca_topic_score_gemma":0.0017617112,"teacher_disagreement_score":0.005906501,"about_ca_system_score_codex":0.0002253755,"about_ca_system_score_gemma":0.00037074232,"threshold_uncertainty_score":0.019759178},"labels":[],"label_agreement":null},{"id":"W4408121163","doi":"10.1007/978-3-031-82039-7","title":"Coordination, Organizations, Institutions, Norms, and Ethics for Governance of Multi-Agent Systems XVII","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Ontario Tech University","funders":"Universitat Politècnica de Catalunya; Università degli Studi di Torino; Università degli Studi dell'Aquila; Universidade Federal de Santa Catarina; Universitat de Barcelona; University of Hertfordshire; University of Exeter; University of Bath; King's College London; Stockholms Universitet; Purdue University; Norges Teknisk-Naturvitenskapelige Universitet; Umeå Universitet; University of Ontario Institute of Technology; Universiteit Utrecht; University of Otago; University of Bristol","keywords":"Computer science; Corporate governance; Multi-agent system; Knowledge management; Management; Artificial intelligence","score_opus":0.08082725548064275,"score_gpt":0.3770670476507341,"score_spread":0.2962397921700914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408121163","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008478569,0.1436582,0.05146762,0.018214634,0.0030680555,0.00013315135,0.00024612993,0.00016410415,0.7745696],"genre_scores_gemma":[0.3083305,0.087061174,0.05210684,0.0025261205,0.0046552373,0.0004971608,0.00071557163,0.00023940387,0.54386795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972576,0.00009352476,0.000014393295,0.00003688565,0.00009745034,0.000031927684],"domain_scores_gemma":[0.9995485,0.000265582,0.000042482297,0.000034760844,0.000059510694,0.000049101967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005232223,0.0005466421,0.00045931642,0.0008567052,0.00085883675,0.004350601,0.00047291708,0.00092784764,0.008983009],"category_scores_gemma":[0.0012014941,0.00033093485,0.00029657737,0.0016205342,0.0022557771,0.0024904888,0.0008359016,0.0021619154,0.0014431161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067606093,0.000013497623,0.00016181561,0.00012905175,0.000004368476,0.000032722193,0.00056396285,0.0016120705,0.00025322204,0.92692435,0.041304342,0.02899393],"study_design_scores_gemma":[0.0000051448837,0.000015592743,0.00080492767,0.00028414602,0.0000055135465,0.00008240234,0.00035483958,0.0019058115,0.00010810478,0.7486024,0.24782278,0.000008303639],"about_ca_topic_score_codex":0.0023472435,"about_ca_topic_score_gemma":0.0026039989,"teacher_disagreement_score":0.008983009,"about_ca_system_score_codex":0.0022645246,"about_ca_system_score_gemma":0.0022013749,"threshold_uncertainty_score":0.030051172},"labels":[],"label_agreement":null},{"id":"W4408125252","doi":"10.1007/978-3-031-84260-3_11","title":"Resilience Analysis of Naval Vessels with i2SIM","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrastructure Resilience and Vulnerability Analysis","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 British Columbia","funders":"","keywords":"Computer science; Resilience (materials science); Operations research; Engineering","score_opus":0.005225860054972452,"score_gpt":0.2208184276137438,"score_spread":0.21559256755877135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408125252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40911025,0.00094972126,0.4779869,0.0012137585,0.0002881964,0.000102595965,0.0026535534,0.00461925,0.10307584],"genre_scores_gemma":[0.96359867,0.00022086731,0.029531943,0.000048521946,0.000043009146,0.000046476616,0.0005069685,0.0003797419,0.005623749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998222,0.000051587802,0.0000054983134,0.000022276516,0.000055636956,0.00004276799],"domain_scores_gemma":[0.9993,0.00040073463,0.000069594054,0.000079874706,0.000110913454,0.000038866947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046655265,0.00067150436,0.00046212977,0.0007228391,0.00043977625,0.00073872064,0.00091980165,0.000491455,0.00587341],"category_scores_gemma":[0.0018309244,0.00028011802,0.0006345692,0.00068150257,0.00043930262,0.00080136425,0.0008587194,0.0006804431,0.00039969577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004325137,0.000015165148,0.000678234,0.000034486424,0.000020180429,0.000039359267,0.000024658653,0.98081857,0.0005898724,0.008588682,0.0015841763,0.007563393],"study_design_scores_gemma":[0.000001865892,0.000008500689,0.00013339383,0.000004082516,0.000004492117,0.0000074537734,0.000009128469,0.99710244,0.00032458888,0.0019602752,0.00044103604,0.0000027423148],"about_ca_topic_score_codex":0.011800869,"about_ca_topic_score_gemma":0.007878156,"teacher_disagreement_score":0.011800869,"about_ca_system_score_codex":0.0007262203,"about_ca_system_score_gemma":0.0006551801,"threshold_uncertainty_score":0.023464322},"labels":[],"label_agreement":null},{"id":"W4408125282","doi":"10.1007/978-981-96-2417-1","title":"Science of Cyber Security","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Mälardalens högskola; Shanghai Maritime University; National Chi Nan University; Università degli Studi di Padova; Institut Polytechnique de Paris; University of the Aegean; Polytechnique Montréal; Universidade da Beira Interior; Nanyang Technological University; East China Normal University; Università degli Studi di Milano; Sun Yat-sen University; Iowa State University; University of Notre Dame; Michigan Technological University; Islamic Azad University; Edith Cowan University; Chinese Academy of Sciences; Aarhus Universitet","keywords":"Computer science; Computer security","score_opus":0.007658639710337495,"score_gpt":0.2419534714838218,"score_spread":0.23429483177348429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408125282","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008217391,0.038757928,0.008449593,0.012920006,0.0024507015,0.000026834392,0.00009903764,0.00008483144,0.9363892],"genre_scores_gemma":[0.09771128,0.056467693,0.010654511,0.0095723625,0.005758854,0.00015401324,0.00030247992,0.00019486186,0.81918395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997776,0.0000575799,0.0000053193644,0.00003426472,0.00010590544,0.000019239655],"domain_scores_gemma":[0.99970263,0.0001198744,0.000016953554,0.00005699241,0.00006246218,0.000041069514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037196104,0.00079851574,0.0004433112,0.0009285512,0.0009346041,0.0026955046,0.00054474367,0.0012568951,0.020161256],"category_scores_gemma":[0.0010295783,0.0003106475,0.0002690761,0.0007660237,0.0046532587,0.0030450977,0.0009878855,0.0031758812,0.006676422],"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.000003827904,0.0000117359605,0.00004754955,0.000050203224,0.0000035626672,0.000015194212,0.0001784715,0.0002884938,0.00013621205,0.878484,0.10468541,0.016095316],"study_design_scores_gemma":[0.0000039955517,0.000007542321,0.00014450602,0.00008331302,0.0000025488894,0.00005524728,0.00007464079,0.00031644938,0.000075446624,0.4987622,0.5004709,0.0000032419048],"about_ca_topic_score_codex":0.002337063,"about_ca_topic_score_gemma":0.0030505657,"teacher_disagreement_score":0.020161256,"about_ca_system_score_codex":0.0019421994,"about_ca_system_score_gemma":0.0018196953,"threshold_uncertainty_score":0.06744605},"labels":[],"label_agreement":null},{"id":"W4408128180","doi":"10.1007/978-981-96-1090-7_16","title":"Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Multiprocessing; Parallel computing; Multiprocessor scheduling; Scheduling (production processes); Approximation algorithm; Processor scheduling; Algorithm; Fair-share scheduling; Mathematical optimization; Rate-monotonic scheduling; Operating system; Mathematics; Schedule","score_opus":0.021457027694445092,"score_gpt":0.2667064251843828,"score_spread":0.2452493974899377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408128180","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.016222937,0.00075025257,0.9756891,0.00030848116,0.00028805836,0.00006251827,0.00008298589,0.0010071158,0.00558855],"genre_scores_gemma":[0.24903034,0.00046632843,0.7428568,0.00019558865,0.00024867934,0.00021028514,0.0003708841,0.00038123684,0.0062398524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984713,0.000443923,0.00006566387,0.00022852812,0.0004830232,0.0003074971],"domain_scores_gemma":[0.99611413,0.0021693863,0.00019946546,0.0008289475,0.00047856598,0.0002094275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023786577,0.0014701631,0.0015563485,0.001210988,0.0011318151,0.0020739874,0.0039118645,0.0014373747,0.0054498822],"category_scores_gemma":[0.0075569055,0.000781356,0.0010540832,0.0028120715,0.00085740053,0.002871411,0.0021944249,0.004027812,0.0009598059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085784454,0.0004159266,0.00069847336,0.00017363361,0.000084059066,0.0000708838,0.00014262961,0.65920746,0.0043302164,0.06126119,0.0111538265,0.26160395],"study_design_scores_gemma":[0.000024859173,0.00002648146,0.0000642123,0.000007165063,0.000010050222,0.000015713991,0.000009095566,0.98231953,0.0005393294,0.01609659,0.0008822707,0.000004623158],"about_ca_topic_score_codex":0.0053998884,"about_ca_topic_score_gemma":0.007881583,"teacher_disagreement_score":0.0054498822,"about_ca_system_score_codex":0.0029432143,"about_ca_system_score_gemma":0.0024403075,"threshold_uncertainty_score":0.021354616},"labels":[],"label_agreement":null},{"id":"W4408128235","doi":"10.1007/978-981-96-1090-7_2","title":"An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Algorithm; Approximation algorithm; Shortest path problem; Theoretical computer science; Graph","score_opus":0.01996489278085252,"score_gpt":0.27794704484643046,"score_spread":0.25798215206557795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408128235","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.023596346,0.00083755446,0.961495,0.00034941177,0.00021042074,0.00016503864,0.00056152104,0.003487997,0.009296737],"genre_scores_gemma":[0.08830837,0.00031202417,0.9038512,0.00011902104,0.000066768196,0.00021383453,0.0012050024,0.00038851562,0.0055351327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842405,0.00028735513,0.00012494005,0.00050704315,0.00045272586,0.0002038446],"domain_scores_gemma":[0.99840873,0.00071056903,0.00009267717,0.00046931155,0.00022813534,0.00009055034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010801685,0.0015779915,0.0021779663,0.0017993624,0.0012698959,0.0028683436,0.0043049315,0.0018270861,0.014420664],"category_scores_gemma":[0.00536738,0.00095698074,0.0016015933,0.004331887,0.0010916298,0.0050119013,0.002751359,0.002876869,0.00390689],"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.0012473873,0.00038892127,0.0007938182,0.00059458264,0.00011692784,0.00009686663,0.00028505299,0.22587115,0.008106372,0.06718172,0.020758819,0.67455834],"study_design_scores_gemma":[0.00015749966,0.00019561747,0.00042561704,0.00006723145,0.000054736087,0.00022171816,0.00016210732,0.90880054,0.0035294907,0.07656936,0.009777166,0.000038910985],"about_ca_topic_score_codex":0.0052830474,"about_ca_topic_score_gemma":0.0076567642,"teacher_disagreement_score":0.014420664,"about_ca_system_score_codex":0.0022437142,"about_ca_system_score_gemma":0.0027820584,"threshold_uncertainty_score":0.048241913},"labels":[],"label_agreement":null},{"id":"W4408128244","doi":"10.1007/978-981-96-1090-7_41","title":"Approximately Covering Vertices by Order-5 or Longer Paths","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Computer science; Order (exchange); Algorithm","score_opus":0.020373389558708023,"score_gpt":0.28294204550124963,"score_spread":0.2625686559425416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408128244","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.56849325,0.0018638653,0.3183661,0.0008952669,0.00035232003,0.00015195366,0.0022011332,0.0018005483,0.10587552],"genre_scores_gemma":[0.83737636,0.001003482,0.1227581,0.000482073,0.00012858768,0.00011722252,0.002262446,0.0005734627,0.035298187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994886,0.000084995285,0.000017431626,0.00014251133,0.00012253522,0.00014395102],"domain_scores_gemma":[0.9981534,0.0009354863,0.00015364103,0.000555633,0.000078594916,0.00012321821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027358157,0.000499929,0.0006722468,0.00053701835,0.0006048353,0.001385672,0.0011217261,0.0010263391,0.017939115],"category_scores_gemma":[0.002676947,0.0004580659,0.0008004797,0.0012136399,0.0005929128,0.0025850073,0.0013695993,0.0012809718,0.0022309942],"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.0016711802,0.00022358533,0.005281296,0.0010570004,0.00016942839,0.0007755684,0.00076371327,0.13658826,0.053483058,0.424638,0.030310685,0.34503832],"study_design_scores_gemma":[0.00013135502,0.00033259927,0.0041809957,0.00014690075,0.00013008853,0.0015404262,0.0006199055,0.19876322,0.023973277,0.725909,0.044229284,0.000042902084],"about_ca_topic_score_codex":0.0011454702,"about_ca_topic_score_gemma":0.0019085675,"teacher_disagreement_score":0.017939115,"about_ca_system_score_codex":0.0008807174,"about_ca_system_score_gemma":0.00041971132,"threshold_uncertainty_score":0.06001234},"labels":[],"label_agreement":null},{"id":"W4408156438","doi":"10.1007/978-3-031-82484-5_17","title":"Using Embeddings of Pre-trained Models for Cross-Database Dysarthria Detection: Supervised vs. Self-supervised Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Voice and Speech Disorders","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Dysarthria; Artificial intelligence; Machine learning; Speech recognition; Natural language processing; Pattern recognition (psychology); Audiology","score_opus":0.034210575215806206,"score_gpt":0.304312882271096,"score_spread":0.27010230705528976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408156438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16000631,0.0029748569,0.8075858,0.0007459503,0.0011098464,0.00035940562,0.0029761253,0.017339049,0.0069026807],"genre_scores_gemma":[0.7042758,0.0010471859,0.26294488,0.00058560015,0.0003321594,0.00031572927,0.013710692,0.0015007913,0.0152871935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879897,0.00026595796,0.000099902165,0.0004490278,0.00019553927,0.0001905931],"domain_scores_gemma":[0.99750096,0.00092767604,0.00017146916,0.00057941093,0.00071782526,0.00010256219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020894303,0.0025411497,0.001439252,0.001007059,0.00045670822,0.001734516,0.0016691834,0.0018739792,0.0032287946],"category_scores_gemma":[0.0049448404,0.00072255987,0.0014357946,0.0007385598,0.00043943874,0.0024055853,0.002041796,0.0025126177,0.0058938423],"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.0006572657,0.0006841884,0.00794087,0.00028411133,0.000482869,0.0002871025,0.00016283772,0.049931377,0.029806428,0.0013799353,0.021361664,0.88702124],"study_design_scores_gemma":[0.000044773617,0.0003965968,0.004502361,0.000117702955,0.0001778925,0.00046952988,0.00021146705,0.9601362,0.023765914,0.004901291,0.0052072117,0.00006911841],"about_ca_topic_score_codex":0.003908943,"about_ca_topic_score_gemma":0.0062225596,"teacher_disagreement_score":0.003908943,"about_ca_system_score_codex":0.00044007567,"about_ca_system_score_gemma":0.00081172166,"threshold_uncertainty_score":0.0110500455},"labels":[],"label_agreement":null},{"id":"W4408156536","doi":"10.1007/978-3-031-82481-4_10","title":"Robust Infidelity: When Faithfulness Measures on Masked Language Models Are Misleading","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Programming language; Speech recognition","score_opus":0.04817885230213251,"score_gpt":0.24880635822914315,"score_spread":0.20062750592701065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408156536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039871305,0.00086299854,0.9495091,0.0021844932,0.0002289968,0.00006406307,0.00026198334,0.0013976464,0.0056193755],"genre_scores_gemma":[0.8111328,0.0005886642,0.17901224,0.0016009741,0.00065547845,0.00014844218,0.00060925056,0.0012882751,0.0049639116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906268,0.004815026,0.00053874357,0.0016069653,0.0018887536,0.0005237017],"domain_scores_gemma":[0.8830209,0.093945585,0.004781796,0.013583301,0.0036247533,0.0010436622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015386992,0.0013495602,0.0017820328,0.002392458,0.001319242,0.0040091565,0.0026296885,0.0044623767,0.005611324],"category_scores_gemma":[0.16529614,0.0014077607,0.0009792924,0.00218396,0.0048956256,0.013147181,0.006737126,0.005253346,0.0012033512],"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.0014847642,0.00013608656,0.010201292,0.000622595,0.00032054906,0.0014762348,0.0019691915,0.105830714,0.009877083,0.59107935,0.015182998,0.26181906],"study_design_scores_gemma":[0.000027418797,0.00008704673,0.00081901375,0.00009893909,0.000049391074,0.0004275679,0.00016586775,0.306421,0.005112996,0.68450034,0.0022445258,0.000045875473],"about_ca_topic_score_codex":0.0014630856,"about_ca_topic_score_gemma":0.0009991731,"teacher_disagreement_score":0.015386992,"about_ca_system_score_codex":0.0014335697,"about_ca_system_score_gemma":0.0012374718,"threshold_uncertainty_score":0.08137518},"labels":[],"label_agreement":null},{"id":"W4408346318","doi":"10.1007/978-3-031-83072-3_1","title":"Work in Progress: Considering Human Factors in Collaborative Decision Making for Secure Architecture Design","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Computer science; Architecture; Work (physics); Software engineering; Human–computer interaction; Computer architecture; Engineering","score_opus":0.022137367788608073,"score_gpt":0.286064512068336,"score_spread":0.2639271442797279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408346318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17766455,0.00917165,0.6491378,0.010392108,0.00054548646,0.0002435865,0.000068814996,0.00024592417,0.15253009],"genre_scores_gemma":[0.83405757,0.003040947,0.14891098,0.0003277927,0.00018659163,0.00011460866,0.00006275917,0.000057206176,0.013241529],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99709284,0.001913727,0.00006498014,0.00023036361,0.0005018851,0.00019618955],"domain_scores_gemma":[0.99238247,0.005883269,0.0002354294,0.0003964261,0.0006717091,0.00043072025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051328936,0.0009059677,0.0004436249,0.00057928805,0.0012915332,0.0049767103,0.0013978998,0.0017141929,0.006830195],"category_scores_gemma":[0.008951388,0.0002998807,0.0006296272,0.00080750475,0.0021195798,0.0059467717,0.001494643,0.0018042515,0.0005900011],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031158386,0.0006811448,0.00615379,0.0006352199,0.0002763283,0.0005153574,0.008983014,0.1359838,0.005045467,0.36862418,0.010004536,0.4627856],"study_design_scores_gemma":[0.000073559924,0.0007264453,0.0041259048,0.00058232906,0.00023148346,0.0002268512,0.010066539,0.49543363,0.0075788065,0.43782115,0.043019924,0.00011337818],"about_ca_topic_score_codex":0.005247332,"about_ca_topic_score_gemma":0.005720333,"teacher_disagreement_score":0.006830195,"about_ca_system_score_codex":0.0014300265,"about_ca_system_score_gemma":0.0030707081,"threshold_uncertainty_score":0.027145684},"labels":[],"label_agreement":null},{"id":"W4408383483","doi":"10.1007/978-3-031-83490-5_12","title":"The Mis/Dis-Information Problem Is Hard to Solve","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.010727608629416446,"score_gpt":0.22482404684101642,"score_spread":0.2140964382116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408383483","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21791181,0.0066056037,0.44075283,0.12311066,0.003501643,0.0005506043,0.0075443685,0.0028786622,0.19714382],"genre_scores_gemma":[0.7828512,0.0052401656,0.111824155,0.0060337274,0.004275928,0.00038405976,0.0046350644,0.0010008918,0.083754666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997603,0.00049085333,0.00014992511,0.0007421308,0.0005256238,0.0004883935],"domain_scores_gemma":[0.96809757,0.025016736,0.0017418019,0.0021555878,0.0021058344,0.0008824812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466163,0.0013377098,0.0030719696,0.0015435566,0.0024113057,0.0051796366,0.0017718239,0.006123704,0.018677682],"category_scores_gemma":[0.024773292,0.0013002272,0.0016812948,0.0021423693,0.0027577956,0.01358817,0.0030312513,0.0073580686,0.0050922898],"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.00081653934,0.00079932465,0.004710698,0.0020452382,0.00031579882,0.0012589871,0.00047038094,0.038403884,0.0032721423,0.37395385,0.26687217,0.30708098],"study_design_scores_gemma":[0.00009632497,0.00009109373,0.0007862363,0.00011055346,0.000062820545,0.0011337474,0.00046135476,0.042391513,0.0021005578,0.9372849,0.015435427,0.00004544731],"about_ca_topic_score_codex":0.0009930544,"about_ca_topic_score_gemma":0.0009879448,"teacher_disagreement_score":0.018677682,"about_ca_system_score_codex":0.00097296276,"about_ca_system_score_gemma":0.0016635029,"threshold_uncertainty_score":0.062483072},"labels":[],"label_agreement":null},{"id":"W4408383663","doi":"10.1007/978-3-031-83490-5_9","title":"Falsifiability, Composability, and Comparability of Game-Based Security Models for Key Exchange Protocols","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Comparability; Computer science; Composability; Falsifiability; Key (lock); Key exchange; Cryptographic protocol; Computer security; Cryptography; Distributed computing; Public-key cryptography; Encryption; Mathematics","score_opus":0.03759053767997567,"score_gpt":0.3218871833254238,"score_spread":0.28429664564544815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408383663","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.046581455,0.0005357043,0.91975904,0.0017482559,0.00019110607,0.00018194925,0.0002588653,0.00045949363,0.030284164],"genre_scores_gemma":[0.86642516,0.0006088325,0.121551774,0.0003849197,0.00029983695,0.0005073692,0.00047549058,0.00024229998,0.009504289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895303,0.005275011,0.0007163199,0.0015247585,0.0020767273,0.0008767976],"domain_scores_gemma":[0.9796235,0.014693629,0.0011838028,0.0029098159,0.0010242981,0.0005649835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007979596,0.0014672554,0.0014361652,0.0015779306,0.0022017227,0.0068671657,0.0030368909,0.0027628634,0.0055295397],"category_scores_gemma":[0.022771891,0.0010384916,0.0032483602,0.0016059506,0.006884964,0.014281269,0.0037207592,0.008291531,0.00057481765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005932356,0.000040114995,0.0001251881,0.000035404737,0.000021115824,0.000034604443,0.00019578745,0.0090389205,0.00040784525,0.9857873,0.0004092469,0.0038452907],"study_design_scores_gemma":[0.000010602506,0.000019969577,0.00003736213,0.000011099046,0.00001177275,0.000020219815,0.00002615381,0.03909848,0.00027851647,0.95975554,0.00072221423,0.000008033825],"about_ca_topic_score_codex":0.001963253,"about_ca_topic_score_gemma":0.0013567965,"teacher_disagreement_score":0.007979596,"about_ca_system_score_codex":0.004705301,"about_ca_system_score_gemma":0.0023327544,"threshold_uncertainty_score":0.042200685},"labels":[],"label_agreement":null},{"id":"W4408383701","doi":"10.1007/978-3-031-83490-5_1","title":"Remembering Ed Dawson","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.016772942425802566,"score_gpt":0.27426843800903616,"score_spread":0.2574954955832336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408383701","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063491846,0.22991447,0.0037510584,0.120048374,0.2568524,0.000036208956,0.00044141882,0.0006318319,0.38768938],"genre_scores_gemma":[0.0017586428,0.017940706,0.00068571384,0.015178185,0.008734331,0.000010972806,0.000094922216,0.00018760643,0.95540893],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940777,0.00007888506,0.00001969546,0.000136911,0.00028184033,0.000074867305],"domain_scores_gemma":[0.9993351,0.00009297005,0.000019983743,0.00003945078,0.0003218677,0.0001905614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072595285,0.00136771,0.0009032889,0.0020424381,0.002360184,0.0048243916,0.0010817564,0.0020092134,0.09795808],"category_scores_gemma":[0.0019116448,0.00043661732,0.0005299743,0.0013042464,0.0010086198,0.0044537005,0.002557442,0.004056013,0.0724747],"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.000009772417,0.0000066472994,0.000022115464,0.00003926718,0.0000019966656,0.000021689491,0.00005974901,0.000024539471,0.00008395689,0.005559321,0.9618182,0.03235272],"study_design_scores_gemma":[7.9096174e-7,0.0000027942242,0.000016957809,0.000028424294,8.949421e-7,0.000023221966,0.000035338497,0.0000071307227,0.00003643485,0.0008408014,0.99900514,0.000002075905],"about_ca_topic_score_codex":0.004252628,"about_ca_topic_score_gemma":0.0140783,"teacher_disagreement_score":0.09795808,"about_ca_system_score_codex":0.0018001735,"about_ca_system_score_gemma":0.0015393713,"threshold_uncertainty_score":0.32770246},"labels":[],"label_agreement":null},{"id":"W4408397200","doi":"10.1007/978-3-031-85593-1_1","title":"An Efficient Edge-Based Privacy-Preserving Range Aggregation Scheme for Aging in Place System","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovation in Digital Healthcare Systems","field":"Health Professions","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":"National Research Council Canada; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Scheme (mathematics); Range (aeronautics); Enhanced Data Rates for GSM Evolution; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.04851719953432076,"score_gpt":0.38013501987598425,"score_spread":0.3316178203416635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408397200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07135156,0.0012184267,0.91813195,0.00045560003,0.00023831656,0.00027234937,0.0008973111,0.0018972378,0.005537228],"genre_scores_gemma":[0.8156435,0.00045908187,0.1763725,0.00020154953,0.00011830531,0.00013185521,0.0009673713,0.000054623775,0.006051147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985166,0.00030488148,0.00011534271,0.00027791617,0.00051611586,0.0002690626],"domain_scores_gemma":[0.998456,0.0003063628,0.000106137886,0.00074212666,0.00030595227,0.00008342521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094583264,0.00054030534,0.0013793337,0.0006807739,0.0012916968,0.0013930936,0.0019888852,0.000756141,0.0022469244],"category_scores_gemma":[0.0020369862,0.00023457153,0.00063087326,0.0019122215,0.00050639984,0.0032987501,0.0031191497,0.0009844707,0.0006641691],"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.0025417407,0.00057718426,0.0032973837,0.00051435264,0.0002414613,0.00061291247,0.001129592,0.12174316,0.07740458,0.106085725,0.026934672,0.6589173],"study_design_scores_gemma":[0.00012045934,0.0005733032,0.0015947218,0.0000330446,0.00014583675,0.000930146,0.0005158327,0.894753,0.033002157,0.049385943,0.018808039,0.00013746633],"about_ca_topic_score_codex":0.0017005346,"about_ca_topic_score_gemma":0.0014869424,"teacher_disagreement_score":0.0022469244,"about_ca_system_score_codex":0.0008143236,"about_ca_system_score_gemma":0.001222589,"threshold_uncertainty_score":0.007516682},"labels":[],"label_agreement":null},{"id":"W4408472202","doi":"10.1007/978-3-031-83472-1_12","title":"A Database Engineered System for Big Data Analytics on Tornado Climatology","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Physics and Python Applications","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 Manitoba","funders":"","keywords":"Tornado; Computer science; Analytics; Big data; Database; Data mining; Meteorology; Geography","score_opus":0.0539028726095123,"score_gpt":0.2890212588347085,"score_spread":0.23511838622519624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408472202","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020874968,0.00061689905,0.3650022,0.0005650924,0.00063299213,0.000742436,0.02783096,0.5730947,0.010639724],"genre_scores_gemma":[0.32289472,0.001198867,0.4441115,0.0030584608,0.00046228265,0.0017678391,0.13631918,0.05195421,0.038233016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998884,0.00010144591,0.00017063296,0.00039426863,0.00037884025,0.00007079291],"domain_scores_gemma":[0.9971955,0.0006689332,0.000118346376,0.0011829966,0.0005200938,0.0003140492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018537882,0.0013551706,0.0011259355,0.0017407442,0.0008401361,0.0040908023,0.0034151052,0.0008611743,0.018028159],"category_scores_gemma":[0.0056795483,0.0009412842,0.00092873204,0.002053721,0.0005138705,0.0038345247,0.0033674957,0.0014388601,0.0094238315],"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.0021917934,0.0008055657,0.023164077,0.0012747985,0.0010032781,0.0012135505,0.0013668591,0.023974186,0.042156357,0.020129267,0.4808673,0.40185294],"study_design_scores_gemma":[0.00070620875,0.00036347657,0.0151246,0.00024024243,0.00044643192,0.0008850741,0.00049184426,0.5164732,0.07518585,0.03555106,0.3541551,0.0003769677],"about_ca_topic_score_codex":0.0056983917,"about_ca_topic_score_gemma":0.0044599944,"teacher_disagreement_score":0.018028159,"about_ca_system_score_codex":0.00086695235,"about_ca_system_score_gemma":0.0012851163,"threshold_uncertainty_score":0.060310245},"labels":[],"label_agreement":null},{"id":"W4408472249","doi":"10.1007/978-3-031-83472-1_23","title":"UpLIF: An Updatable Self-tuning Learned Index Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Index (typography); Human–computer interaction; World Wide Web","score_opus":0.02094681599216188,"score_gpt":0.27332136194429923,"score_spread":0.2523745459521374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408472249","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.007852285,0.0007279993,0.85067904,0.00019428048,0.0002774219,0.00021300069,0.0035045256,0.13095488,0.005596564],"genre_scores_gemma":[0.13770898,0.0005356389,0.8111007,0.0005019319,0.00019709246,0.0004491015,0.016057676,0.011776631,0.02167228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911827,0.00006935991,0.00007009215,0.00023922451,0.00039288602,0.00011020516],"domain_scores_gemma":[0.9990669,0.00017680995,0.000043014217,0.00043740726,0.00020280601,0.00007305886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075613,0.0010152527,0.0012148521,0.001813861,0.00079587096,0.0023385433,0.00422721,0.0010854711,0.017062182],"category_scores_gemma":[0.0042108768,0.00063197274,0.00087351835,0.0018571492,0.000577878,0.004626344,0.003482911,0.0017969119,0.008339465],"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.00084346643,0.0003353382,0.000991333,0.00032246116,0.0001137284,0.00012718613,0.00012878577,0.01778813,0.012203616,0.017449839,0.10442379,0.84527236],"study_design_scores_gemma":[0.00030290673,0.00020580553,0.0007958534,0.000101895996,0.00010363801,0.00034396525,0.00009922736,0.76120335,0.038096387,0.06709059,0.13150308,0.00015328967],"about_ca_topic_score_codex":0.008450668,"about_ca_topic_score_gemma":0.013423728,"teacher_disagreement_score":0.017062182,"about_ca_system_score_codex":0.0010106527,"about_ca_system_score_gemma":0.0016539554,"threshold_uncertainty_score":0.05707872},"labels":[],"label_agreement":null},{"id":"W4408681149","doi":"10.1007/978-981-96-3774-4_2","title":"Influence Detection in Agetech on Social Platforms Using Machine Learning and Classifier Calibration","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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":"National Research Council Canada; University of Victoria","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Calibration; Statistics; Mathematics","score_opus":0.02111535879369293,"score_gpt":0.2566649840792496,"score_spread":0.23554962528555667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408681149","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.7909184,0.0009143302,0.16892014,0.00064400956,0.00037733265,0.0002763057,0.0027238892,0.009653739,0.025571793],"genre_scores_gemma":[0.92369366,0.00012799082,0.062453326,0.00009565421,0.00020875632,0.000094267016,0.0019524114,0.0002287522,0.011145085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.00024786554,0.000040092575,0.00024835914,0.0003737062,0.00016156907],"domain_scores_gemma":[0.99780303,0.00095103297,0.00016387664,0.00033150747,0.00059039635,0.00016008716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012251281,0.00080393767,0.00072723354,0.0027157397,0.0007550774,0.0013694083,0.0007213177,0.0010982046,0.0028020116],"category_scores_gemma":[0.004828443,0.000250873,0.0005854507,0.0011312825,0.00025788814,0.0018781689,0.0011037672,0.0010649378,0.0023115857],"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.0007882278,0.0008651999,0.14960213,0.00021800841,0.00024911377,0.0006091745,0.00065951346,0.075557865,0.018737694,0.007878197,0.030113973,0.7147209],"study_design_scores_gemma":[0.000015370626,0.00013278537,0.03009178,0.000015159496,0.000043597123,0.00015671685,0.00013447493,0.9467597,0.012644589,0.0041658534,0.0058110077,0.000028971184],"about_ca_topic_score_codex":0.0071511967,"about_ca_topic_score_gemma":0.012037016,"teacher_disagreement_score":0.0071511967,"about_ca_system_score_codex":0.0008763069,"about_ca_system_score_gemma":0.0004898938,"threshold_uncertainty_score":0.014219105},"labels":[],"label_agreement":null},{"id":"W4408693557","doi":"10.1007/978-3-662-70810-1_6","title":"Pattern Discovery and Validation Using Scientific Research Methods","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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 Calgary","funders":"","keywords":"Computer science; Information retrieval; Data science; Data mining","score_opus":0.10774420219712094,"score_gpt":0.40428881294540187,"score_spread":0.2965446107482809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408693557","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.0047794348,0.0006230073,0.98748624,0.00061100145,0.00009559658,0.0004994121,0.0006142335,0.0017711169,0.0035198939],"genre_scores_gemma":[0.044746067,0.0006729927,0.94734573,0.00018490091,0.000078099125,0.0006862136,0.0026376348,0.0004408329,0.0032075455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9480967,0.023637427,0.005681959,0.0062894844,0.015599042,0.00069535896],"domain_scores_gemma":[0.8095533,0.13076493,0.006185606,0.032620773,0.020058297,0.000817154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.049388383,0.0017168942,0.0024423283,0.012456039,0.0020769404,0.009283968,0.005518556,0.0025711628,0.008237765],"category_scores_gemma":[0.1351708,0.0012921541,0.0051311846,0.007929381,0.0032684898,0.009005458,0.0050417436,0.0026164216,0.0042283335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037186284,0.0004306442,0.011206824,0.0024477218,0.0010350113,0.00042828222,0.0011189112,0.01667561,0.0071610287,0.14184779,0.010005794,0.8072705],"study_design_scores_gemma":[0.00019173557,0.00022580533,0.0035771914,0.0013126562,0.00080347614,0.00093739585,0.00086683786,0.40445578,0.0329561,0.49453318,0.05999531,0.00014455346],"about_ca_topic_score_codex":0.0022754734,"about_ca_topic_score_gemma":0.0025563766,"teacher_disagreement_score":0.049388383,"about_ca_system_score_codex":0.0019269346,"about_ca_system_score_gemma":0.0074797235,"threshold_uncertainty_score":0.2611938},"labels":[],"label_agreement":null},{"id":"W4408694007","doi":"10.1007/978-3-662-70810-1_3","title":"Anti-patterns and Code Smells for Multi-language Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Computer science; Programming language; Code smell; Code (set theory); Software quality; Software development; Software","score_opus":0.025156689610194335,"score_gpt":0.2929987955546165,"score_spread":0.26784210594442215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408694007","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.2696167,0.0015381083,0.7014568,0.0019039367,0.00025476125,0.000055325876,0.00027937713,0.0051862947,0.019708697],"genre_scores_gemma":[0.8731691,0.0004839599,0.1120306,0.00026982898,0.000118963275,0.000054630054,0.00031408868,0.0011734033,0.012385357],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978915,0.0004018462,0.00020513395,0.0003510548,0.00095223583,0.00019824819],"domain_scores_gemma":[0.9863783,0.007855829,0.0019315586,0.0022855299,0.0012306819,0.00031811476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385625,0.00043403413,0.00056166743,0.0011398188,0.00061813195,0.0018212107,0.0008367016,0.0012224086,0.0030463329],"category_scores_gemma":[0.013202045,0.0006899899,0.000677941,0.0010268516,0.0013867697,0.004622424,0.0017189983,0.0019087818,0.00058119936],"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.0005332611,0.0002776455,0.02676435,0.0007832045,0.00011209935,0.00304655,0.0027830917,0.027763896,0.06366561,0.3540126,0.010483041,0.5097747],"study_design_scores_gemma":[0.000042181753,0.00027172235,0.007745124,0.00012899298,0.00006999863,0.00429896,0.00054497755,0.2987826,0.03658263,0.6327198,0.018725554,0.000087479595],"about_ca_topic_score_codex":0.0005301741,"about_ca_topic_score_gemma":0.00087715266,"teacher_disagreement_score":0.0030463329,"about_ca_system_score_codex":0.00048184028,"about_ca_system_score_gemma":0.0004661888,"threshold_uncertainty_score":0.010191023},"labels":[],"label_agreement":null},{"id":"W4408780269","doi":"10.1007/978-3-031-86599-2","title":"Post-Quantum Cryptography","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Indian Statistical Institute; University of Illinois at Chicago; Masarykova Univerzita; National Cheng Kung University; Universität Regensburg; University of Waterloo; Lunds Universitet; Universidad Nacional de Colombia; Technische Universiteit Eindhoven; KU Leuven; Université de Limoges; Universidad del Atlántico; Florida Atlantic University; Sapienza Università di Roma; Amazon Web Services; Indian Institute of Science; Université de Rouen; Kungliga Tekniska Högskolan; Radboud Universiteit; Virginia Polytechnic Institute and State University; Cisco Systems","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Theoretical computer science; Quantum; Computer security; Encryption; Public-key cryptography; Quantum information; Quantum mechanics; Physics","score_opus":0.006561304879401995,"score_gpt":0.23120128278223695,"score_spread":0.22463997790283496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408780269","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008520714,0.004647622,0.03288942,0.0022691325,0.0017478875,0.00004258029,0.00020740551,0.00032781615,0.94934726],"genre_scores_gemma":[0.09457218,0.0038397498,0.008316333,0.00067866873,0.0009148634,0.000055885215,0.00021778996,0.00028225247,0.89112234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997466,0.000039498693,0.0000065310505,0.000040663883,0.00013563073,0.00003104199],"domain_scores_gemma":[0.9996841,0.00007729793,0.000019735093,0.00015117365,0.000048019683,0.000019698351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030331186,0.00061134703,0.00043150273,0.0006104655,0.00087144086,0.001992248,0.00060781895,0.000729027,0.060057413],"category_scores_gemma":[0.00092242623,0.00028770865,0.00030944447,0.0006360767,0.0014718777,0.002978177,0.0013023138,0.0021677034,0.021814886],"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.000033076336,0.000022465572,0.00006471692,0.00008398331,0.000005615011,0.000033295346,0.00006096168,0.00044971035,0.0024876883,0.9195491,0.02531027,0.05189907],"study_design_scores_gemma":[0.000011175393,0.00005356853,0.00036177505,0.00009288883,0.000009422675,0.00033945002,0.00003898174,0.0018672138,0.0065310225,0.6044243,0.3862544,0.00001585317],"about_ca_topic_score_codex":0.00014612387,"about_ca_topic_score_gemma":0.00026658614,"teacher_disagreement_score":0.060057413,"about_ca_system_score_codex":0.0009497056,"about_ca_system_score_gemma":0.0005609374,"threshold_uncertainty_score":0.20091206},"labels":[],"label_agreement":null},{"id":"W4408785945","doi":"10.1007/978-981-96-3519-1_6","title":"Design Considerations for Applications of Social Robots in the Stuttering Clinic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stuttering Research and Treatment","field":"Psychology","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":"Stuttering; Computer science; Robot; Speech recognition; Artificial intelligence; Audiology; Medicine","score_opus":0.09670485699079466,"score_gpt":0.394295347497796,"score_spread":0.2975904905070013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408785945","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.048722364,0.0034051444,0.8191688,0.004137807,0.00071061717,0.0010001936,0.0001455443,0.0020886022,0.120620966],"genre_scores_gemma":[0.54740494,0.0016170905,0.3961262,0.00085445715,0.00023425638,0.0016971248,0.0001287239,0.0004322114,0.051504973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977329,0.0013808159,0.000087961474,0.00015071248,0.00050978665,0.00013779731],"domain_scores_gemma":[0.9973937,0.0015718124,0.00013096056,0.00019357301,0.00054767804,0.0001623187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023201527,0.0011663962,0.00056050584,0.0006831077,0.0011872324,0.0022487019,0.0024714507,0.002792752,0.023359612],"category_scores_gemma":[0.0055055707,0.00074754516,0.00049525005,0.00032800774,0.00069209735,0.0015710643,0.0012460712,0.0008293197,0.004511966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019310655,0.0007175624,0.0039577726,0.0024434922,0.00013552883,0.0020841758,0.0023291274,0.11856509,0.0954461,0.14436448,0.028105916,0.5999197],"study_design_scores_gemma":[0.00063440175,0.0070871273,0.008014096,0.0012322054,0.0005707801,0.007537438,0.0042716707,0.46480653,0.05423402,0.104253806,0.34707406,0.00028382408],"about_ca_topic_score_codex":0.0008368954,"about_ca_topic_score_gemma":0.0016716468,"teacher_disagreement_score":0.023359612,"about_ca_system_score_codex":0.00057988777,"about_ca_system_score_gemma":0.0006161398,"threshold_uncertainty_score":0.07814574},"labels":[],"label_agreement":null},{"id":"W4408786595","doi":"10.1007/978-981-96-3519-1_39","title":"Apples and Oranges: Validity and Reliability of the Three Main Anthropomorphism Measures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Reliability (semiconductor); Validity; Statistics; Mathematics; Psychometrics; Thermodynamics","score_opus":0.049301909894772664,"score_gpt":0.32603338670190596,"score_spread":0.2767314768071333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408786595","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.9710027,0.0013195894,0.00432899,0.00017497607,0.00019811209,0.0002336656,0.0003086652,0.000057812307,0.02237544],"genre_scores_gemma":[0.9941461,0.00037390515,0.0030573674,0.000064549495,0.00003319068,0.00018548185,0.00031712436,0.000046794987,0.0017754632],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9949633,0.0018893196,0.0005040134,0.0008051385,0.0016394065,0.00019888324],"domain_scores_gemma":[0.95192504,0.031900432,0.006300026,0.003395007,0.0054914495,0.0009881498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009431962,0.0007482126,0.00056534546,0.002665443,0.00060979236,0.0021437877,0.00096166815,0.0010580734,0.0030159],"category_scores_gemma":[0.0475593,0.0008154876,0.0011832071,0.0011206528,0.0020161106,0.002631564,0.0025992526,0.0010741773,0.0009265804],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013801852,0.00023806094,0.9095188,0.00015541824,0.00045587783,0.0000737375,0.0071618403,0.00076695974,0.002066657,0.002884291,0.001762572,0.073535666],"study_design_scores_gemma":[0.0000940876,0.00043194363,0.9875317,0.000110603876,0.00013525003,0.00027620408,0.002940891,0.0019785245,0.00095719175,0.0026779391,0.0028014784,0.00006429656],"about_ca_topic_score_codex":0.002434624,"about_ca_topic_score_gemma":0.0049737976,"teacher_disagreement_score":0.009431962,"about_ca_system_score_codex":0.0005446012,"about_ca_system_score_gemma":0.0005846795,"threshold_uncertainty_score":0.049881577},"labels":[],"label_agreement":null},{"id":"W4408788451","doi":"10.1007/978-3-031-86602-9","title":"Post-Quantum Cryptography","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Indian Statistical Institute; University of Illinois at Chicago; Masarykova Univerzita; National Cheng Kung University; Universität Regensburg; University of Waterloo; Lunds Universitet; Universidad Nacional de Colombia; Technische Universiteit Eindhoven; KU Leuven; Université de Limoges; Universidad del Atlántico; Florida Atlantic University; Sapienza Università di Roma; Amazon Web Services; Indian Institute of Science; Université de Rouen; Kungliga Tekniska Högskolan; Radboud Universiteit; Virginia Polytechnic Institute and State University; Cisco Systems","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Computer security; Theoretical computer science; Quantum; Public-key cryptography; Encryption; Quantum information; Quantum mechanics; Physics","score_opus":0.006561304879401995,"score_gpt":0.23120128278223695,"score_spread":0.22463997790283496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408788451","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008520714,0.004647622,0.03288942,0.0022691325,0.0017478875,0.00004258029,0.00020740551,0.00032781615,0.94934726],"genre_scores_gemma":[0.09457218,0.0038397498,0.008316333,0.00067866873,0.0009148634,0.000055885215,0.00021778996,0.00028225247,0.89112234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997466,0.000039498693,0.0000065310505,0.000040663883,0.00013563073,0.00003104199],"domain_scores_gemma":[0.9996841,0.00007729793,0.000019735093,0.00015117365,0.000048019683,0.000019698351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030331186,0.00061134703,0.00043150273,0.0006104655,0.00087144086,0.001992248,0.00060781895,0.000729027,0.060057413],"category_scores_gemma":[0.00092242623,0.00028770865,0.00030944447,0.0006360767,0.0014718777,0.002978177,0.0013023138,0.0021677034,0.021814886],"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.000033076336,0.000022465572,0.00006471692,0.00008398331,0.000005615011,0.000033295346,0.00006096168,0.00044971035,0.0024876883,0.9195491,0.02531027,0.05189907],"study_design_scores_gemma":[0.000011175393,0.00005356853,0.00036177505,0.00009288883,0.000009422675,0.00033945002,0.00003898174,0.0018672138,0.0065310225,0.6044243,0.3862544,0.00001585317],"about_ca_topic_score_codex":0.00014612387,"about_ca_topic_score_gemma":0.00026658614,"teacher_disagreement_score":0.060057413,"about_ca_system_score_codex":0.0009497056,"about_ca_system_score_gemma":0.0005609374,"threshold_uncertainty_score":0.20091206},"labels":[],"label_agreement":null},{"id":"W4408788915","doi":"10.1007/978-3-031-86602-9_2","title":"Commuting Ramanujan Graphs and the Random Self-reducibility of Isogeny Problems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph theory and applications","field":"Mathematics","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":"Isogeny; Ramanujan's sum; Computer science; Discrete mathematics; Combinatorics; Mathematics; Abelian group","score_opus":0.02030451864079396,"score_gpt":0.2691006963522291,"score_spread":0.24879617771143514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408788915","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.6413606,0.00397178,0.11640388,0.0057912595,0.0006981629,0.00013511775,0.00033242034,0.00032871898,0.23097809],"genre_scores_gemma":[0.9611263,0.0011726368,0.01346073,0.00045715313,0.00062820833,0.00013945467,0.00019659098,0.00012379815,0.022695025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983621,0.00066375255,0.00006564486,0.0002374745,0.0004643742,0.00020661007],"domain_scores_gemma":[0.9948783,0.0031925866,0.00036637674,0.0009018984,0.00029378757,0.0003670811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024270548,0.0005792627,0.0012544182,0.0021588514,0.0027972867,0.0037237832,0.0015095084,0.0015599524,0.0066420473],"category_scores_gemma":[0.00795108,0.00064425735,0.0012203569,0.0018464028,0.0056348853,0.0056064096,0.0023098674,0.0036288262,0.00060034124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000974247,0.000011599697,0.00005572981,0.000012805699,0.000003565951,0.000015494497,0.0000760081,0.0004791481,0.00011174459,0.9973476,0.0004506985,0.0014258262],"study_design_scores_gemma":[0.0000049953883,0.0000029153766,0.00004318819,0.0000032552887,0.0000016131609,0.000020946798,0.000019452227,0.0010847012,0.00007374462,0.9983273,0.00041519996,0.0000028150769],"about_ca_topic_score_codex":0.00054688024,"about_ca_topic_score_gemma":0.00046895928,"teacher_disagreement_score":0.0066420473,"about_ca_system_score_codex":0.0015018114,"about_ca_system_score_gemma":0.0009773946,"threshold_uncertainty_score":0.022219837},"labels":[],"label_agreement":null},{"id":"W4408804618","doi":"10.1007/978-981-96-3522-1_6","title":"What Makes an Educational Robot Game Fun? Framework Analysis of Children’s Design Ideas","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robot; Educational game; Human–computer interaction; Game design; Multimedia; Artificial intelligence; Mathematics education; Psychology","score_opus":0.019123653305461685,"score_gpt":0.2869678148286064,"score_spread":0.2678441615231447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408804618","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.49639124,0.0010385127,0.33084548,0.001892028,0.000027639817,0.000340133,0.0004436139,0.00046962936,0.16855173],"genre_scores_gemma":[0.91911197,0.0001910414,0.07454266,0.00004033463,0.0000029346797,0.00011324486,0.00015706051,0.000072528215,0.0057682414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99889475,0.0005715095,0.000032666067,0.00014501308,0.00022627221,0.00012988441],"domain_scores_gemma":[0.9962877,0.0028115734,0.00022834084,0.00015713704,0.00032152337,0.0001936952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016105406,0.00039186375,0.000201307,0.0014161963,0.00079703255,0.0038647954,0.00071990304,0.00063326873,0.0044813887],"category_scores_gemma":[0.0043576006,0.00035128437,0.00066680426,0.0008230241,0.0028155514,0.0027761764,0.0008914036,0.0011990926,0.00033735266],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013118135,0.00013576772,0.0221818,0.0002640829,0.00004939355,0.00044607205,0.05798675,0.0050204415,0.0069390303,0.83340234,0.0019747408,0.07146842],"study_design_scores_gemma":[0.00012050752,0.00053551496,0.078869104,0.0008535917,0.00025327643,0.0017247392,0.12637013,0.17653461,0.019328823,0.43979996,0.1554346,0.00017521722],"about_ca_topic_score_codex":0.009250367,"about_ca_topic_score_gemma":0.008835809,"teacher_disagreement_score":0.009250367,"about_ca_system_score_codex":0.0029488713,"about_ca_system_score_gemma":0.0017398627,"threshold_uncertainty_score":0.021395624},"labels":[],"label_agreement":null},{"id":"W4408836268","doi":"10.1007/978-981-96-3522-1_29","title":"Towards Robot-Assisted Learning for Refugee Children and Their Families - Interviews with Professionals","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Refugee; Computer science; Robot; Human–computer interaction; Artificial intelligence; History","score_opus":0.03197734358497629,"score_gpt":0.3448821921311944,"score_spread":0.31290484854621814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408836268","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.95998573,0.0033930219,0.0014949855,0.0048277043,0.00021151498,0.00033324823,0.00013587052,0.000043449483,0.029574446],"genre_scores_gemma":[0.97756016,0.0023356536,0.0012925585,0.0011130428,0.000020586433,0.000308575,0.00007043276,0.000034792276,0.017264253],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99616647,0.0022961718,0.00010556408,0.000243975,0.0002540018,0.00093384227],"domain_scores_gemma":[0.9950616,0.002471604,0.000364071,0.00010938089,0.00046242776,0.0015310022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007609282,0.0008230068,0.00072272273,0.0010917812,0.012665563,0.00641228,0.0017959363,0.0026237846,0.00676299],"category_scores_gemma":[0.0074091135,0.00071061787,0.00040586366,0.0009520208,0.0073000337,0.0047261547,0.0077858716,0.0048752627,0.0011701554],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023868262,0.0000772532,0.0021768168,0.00008914926,0.0000018145579,0.0010453224,0.9892368,0.000015333484,0.00032666654,0.00064186065,0.0009983368,0.0053667556],"study_design_scores_gemma":[0.000001938544,0.00001894511,0.0009871279,0.00006925004,0.0000012247576,0.00019725732,0.9929039,0.00000493824,0.000066895525,0.00006764593,0.005676007,0.0000048211973],"about_ca_topic_score_codex":0.011951026,"about_ca_topic_score_gemma":0.03553978,"teacher_disagreement_score":0.012665563,"about_ca_system_score_codex":0.005089452,"about_ca_system_score_gemma":0.00787386,"threshold_uncertainty_score":0.040242195},"labels":[],"label_agreement":null},{"id":"W4408836604","doi":"10.1007/978-981-96-3522-1_32","title":"Development of Robot-Assisted Speech-Language Therapy: Co-design with Speech-Language Pathologists","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autism Spectrum Disorder Research","field":"Neuroscience","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":"Brampton Civic Hospital; University of Waterloo","funders":"","keywords":"Computer science; Speech recognition; Robot; Natural language processing; Artificial intelligence; Human–computer interaction","score_opus":0.04389609385156013,"score_gpt":0.31265663118146303,"score_spread":0.2687605373299029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408836604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032947022,0.0004743093,0.9242249,0.0006248154,0.00024575018,0.0007514851,0.00015827018,0.0042791897,0.036294296],"genre_scores_gemma":[0.11038145,0.00046734477,0.8356739,0.00027573277,0.00002718793,0.0012349593,0.00047766615,0.0010112685,0.05045038],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9983198,0.00079672266,0.000075400174,0.00026667622,0.0004365349,0.00010474539],"domain_scores_gemma":[0.9983119,0.00073591975,0.00008794338,0.00016622963,0.00045779,0.00024018653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024672847,0.0007345057,0.00032044825,0.0004368692,0.0005350931,0.0015749563,0.0018949051,0.0008813026,0.012873185],"category_scores_gemma":[0.002936004,0.00049212045,0.00046981274,0.00021998023,0.00067775534,0.0013007945,0.0016743316,0.0007771293,0.0046924003],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030019617,0.0010051235,0.003061204,0.0006205303,0.00004963397,0.000658666,0.0046023615,0.010257115,0.050684527,0.013853973,0.020894945,0.8940117],"study_design_scores_gemma":[0.0003808116,0.004361713,0.010460198,0.00083357,0.00022644708,0.006649512,0.00637461,0.12588355,0.16246536,0.018827153,0.66325647,0.00028059183],"about_ca_topic_score_codex":0.00076858763,"about_ca_topic_score_gemma":0.001569286,"teacher_disagreement_score":0.012873185,"about_ca_system_score_codex":0.00073665485,"about_ca_system_score_gemma":0.00173062,"threshold_uncertainty_score":0.04306507},"labels":[],"label_agreement":null},{"id":"W4408836757","doi":"10.1007/978-981-96-3525-2_7","title":"Three Principles for Social Robots as Embodied Mediators","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Embodied cognition; Computer science; Robot; Human–computer interaction; Embodied agent; Cognitive science; Artificial intelligence; Psychology","score_opus":0.05740425841396998,"score_gpt":0.3615300668470845,"score_spread":0.30412580843311454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408836757","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.0074579753,0.0015115598,0.6376159,0.009319559,0.00052800326,0.00038374515,0.0001562623,0.0005282949,0.34249878],"genre_scores_gemma":[0.4415833,0.0013159788,0.45435366,0.0020311095,0.00050311186,0.0023472449,0.00021177366,0.00032226558,0.09733163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998064,0.0006681396,0.000118289936,0.0003190528,0.0005943351,0.0002362463],"domain_scores_gemma":[0.998245,0.0008050485,0.00012488262,0.00038559444,0.0002527317,0.00018674444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002814748,0.0010453047,0.0006084487,0.0011298788,0.0030436143,0.007097501,0.0035781562,0.0049597993,0.014346548],"category_scores_gemma":[0.004567915,0.0011526512,0.0012911919,0.000553035,0.014204934,0.010728814,0.0051854043,0.0049099936,0.0042650984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000482625,0.0000073608717,0.000020501246,0.000021421654,0.0000025025458,0.000017312665,0.0004933662,0.00022724482,0.0001461193,0.9961888,0.00067987695,0.002190729],"study_design_scores_gemma":[0.000020160742,0.00001378919,0.00005488108,0.000027775006,0.000005964462,0.000062788284,0.00021663166,0.001843524,0.000305696,0.98064524,0.016791433,0.000012075232],"about_ca_topic_score_codex":0.0013653316,"about_ca_topic_score_gemma":0.0011458592,"teacher_disagreement_score":0.014346548,"about_ca_system_score_codex":0.0013928502,"about_ca_system_score_gemma":0.0016859849,"threshold_uncertainty_score":0.047993958},"labels":[],"label_agreement":null},{"id":"W4408837372","doi":"10.1007/978-981-96-3519-1_17","title":"Enhancing Open Conversations Using Visual Percepts From a Socially Assistive Robot Preliminary Assessment","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"","keywords":"Computer science; Human–computer interaction; Robot; Artificial intelligence; Assistive technology; Computer vision","score_opus":0.0535359100956628,"score_gpt":0.41756716766797874,"score_spread":0.3640312575723159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408837372","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.7998163,0.00081028446,0.17569676,0.00037791757,0.00020103905,0.00039849602,0.00048105788,0.001819606,0.02039845],"genre_scores_gemma":[0.9461161,0.0002749884,0.04651917,0.000095142714,0.00004228694,0.00017414002,0.00026425684,0.0001369671,0.006376959],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99962914,0.00012823867,0.000012110163,0.000047201207,0.00013192787,0.000051356037],"domain_scores_gemma":[0.99882215,0.00065548613,0.00003794761,0.000072615476,0.0003150731,0.00009664604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006165965,0.0006113464,0.00031553104,0.00027509127,0.00029175894,0.0009639591,0.00055916863,0.00071259576,0.009178941],"category_scores_gemma":[0.0030195927,0.00016892586,0.00033348918,0.00015168493,0.00034818592,0.0012123152,0.00109004,0.00055099773,0.0011539464],"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.0032790354,0.0013466647,0.0038597092,0.00076717586,0.000064134234,0.00055927865,0.0035525765,0.009069487,0.6171679,0.0016364364,0.0030395435,0.3556581],"study_design_scores_gemma":[0.0006663446,0.017437007,0.10707469,0.00041978725,0.0005417679,0.002232404,0.011196806,0.2641586,0.5503036,0.0130458595,0.032482706,0.00044053065],"about_ca_topic_score_codex":0.0007747735,"about_ca_topic_score_gemma":0.0009655438,"teacher_disagreement_score":0.009178941,"about_ca_system_score_codex":0.00021041727,"about_ca_system_score_gemma":0.0002595556,"threshold_uncertainty_score":0.030706584},"labels":[],"label_agreement":null},{"id":"W4408928998","doi":"10.1007/978-3-031-82014-4_13","title":"Converse Techniques for Identification via Channels","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","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":"Innovation Cluster (Canada)","funders":"","keywords":"Converse; Computer science; Identification (biology); Algorithm; Theoretical computer science; Mathematics; Geometry","score_opus":0.014311821520713896,"score_gpt":0.25669563407910306,"score_spread":0.24238381255838917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408928998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004584516,0.0025082447,0.85736215,0.0013307219,0.0010514627,0.000062999556,0.00016057887,0.00033702858,0.1326023],"genre_scores_gemma":[0.36456388,0.011397013,0.39391106,0.002949641,0.002776346,0.00064864475,0.0006639687,0.0006846939,0.22240469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987563,0.0004688897,0.00005133787,0.00020979183,0.00038182279,0.00013190773],"domain_scores_gemma":[0.99853194,0.00091620634,0.000051972576,0.000290452,0.00016795668,0.000041464296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013134349,0.0015524449,0.001052567,0.0014937139,0.0017622237,0.002468637,0.0012884875,0.0018399969,0.011750768],"category_scores_gemma":[0.0033567667,0.0007811487,0.0015990456,0.0012795768,0.002834025,0.0047127632,0.00440331,0.0054194024,0.005034181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041252795,0.000027859105,0.00004376537,0.000114313094,0.000014396656,0.000117680895,0.00025017708,0.0018652907,0.0026862659,0.960951,0.007975882,0.025912168],"study_design_scores_gemma":[0.000011134708,0.00003880184,0.000099322584,0.00007372164,0.00003443165,0.00047000928,0.000113177535,0.017680198,0.004596685,0.94529307,0.031551253,0.000038208218],"about_ca_topic_score_codex":0.0003431493,"about_ca_topic_score_gemma":0.0003213051,"teacher_disagreement_score":0.011750768,"about_ca_system_score_codex":0.0008130183,"about_ca_system_score_gemma":0.0006889799,"threshold_uncertainty_score":0.039310217},"labels":[],"label_agreement":null},{"id":"W4408951718","doi":"10.1007/978-981-96-3512-2_25","title":"Split Reduplicant and Subjectivity on Tetrasyllabic Reduplicated Adjectives in Taiwan Southern Min","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Syntax, Semantics, Linguistic Variation","field":"Arts and Humanities","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":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Subjectivity; Computer science; Artificial intelligence; Natural language processing; Philosophy; Epistemology","score_opus":0.017772551446628527,"score_gpt":0.23325308597593938,"score_spread":0.21548053452931085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408951718","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.98957235,0.0001031237,0.00028640582,0.00006147852,0.0000047033104,0.0000036535987,0.000037263362,0.0000045919355,0.00992638],"genre_scores_gemma":[0.9982297,0.000024510115,0.000114147595,0.0000089143805,0.0000029563814,0.0000022107922,0.000033187527,0.000009085684,0.0015752811],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9997615,0.000078290446,0.000021881375,0.000066440625,0.00003389031,0.00003792781],"domain_scores_gemma":[0.99935156,0.00032225845,0.00009376172,0.000059921265,0.00013370017,0.000038810467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038052333,0.0001787871,0.00022034484,0.00075360306,0.0015464341,0.0008742519,0.00030009204,0.00023605837,0.0038574005],"category_scores_gemma":[0.0008928202,0.00015502538,0.00012334975,0.00136194,0.0015221388,0.0009895185,0.0008036646,0.0006165936,0.00025237314],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011651171,0.00014459077,0.16469854,0.00033589423,0.00008209703,0.006574455,0.50417095,0.0005775507,0.09608931,0.13814127,0.0022281527,0.085792035],"study_design_scores_gemma":[0.00007009288,0.00040621255,0.6147492,0.00018897864,0.00017230035,0.004075742,0.2734895,0.0029961893,0.017203653,0.033270806,0.053257395,0.00012000167],"about_ca_topic_score_codex":0.012224641,"about_ca_topic_score_gemma":0.021986196,"teacher_disagreement_score":0.012224641,"about_ca_system_score_codex":0.000790442,"about_ca_system_score_gemma":0.00062553387,"threshold_uncertainty_score":0.024306953},"labels":[],"label_agreement":null},{"id":"W4408979893","doi":"10.1007/978-981-96-2641-0_1","title":"BgSub: A Background Subtraction Model for Effective Moving Object Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Background subtraction; Computer science; Computer vision; Artificial intelligence; Object detection; Object (grammar); Subtraction; Computer graphics (images); Pattern recognition (psychology); Pixel; Arithmetic; Mathematics","score_opus":0.019831683148857925,"score_gpt":0.2939973331809169,"score_spread":0.274165650032059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408979893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002754236,0.00035466976,0.9887656,0.00006002361,0.00008624757,0.0000393884,0.00031978366,0.00673603,0.0008841295],"genre_scores_gemma":[0.083435625,0.0009469598,0.8946023,0.0003450191,0.00013148709,0.00017701487,0.0029517002,0.0027792063,0.014630605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965906,0.000047677935,0.000012073669,0.0000792531,0.0001625095,0.000039388822],"domain_scores_gemma":[0.9997485,0.000056928802,0.000014004083,0.00005785007,0.00010085719,0.00002174614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060958957,0.0018079559,0.0013270437,0.0010088884,0.00037750293,0.0012460931,0.0025351052,0.0012701015,0.0055965977],"category_scores_gemma":[0.0008049112,0.00077054393,0.0010162301,0.0011189997,0.00034110734,0.0012717242,0.0012814379,0.0015832847,0.0056788055],"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.0005751884,0.00017573834,0.0005355555,0.0001895159,0.00020296208,0.00011870136,0.000050192626,0.09954822,0.054497324,0.0058596404,0.022911986,0.815335],"study_design_scores_gemma":[0.00002112399,0.00004855226,0.00037348978,0.000009878253,0.000046582132,0.00008360279,0.0000076082783,0.9657228,0.021876425,0.0033551904,0.0084327115,0.000022169357],"about_ca_topic_score_codex":0.0092469985,"about_ca_topic_score_gemma":0.011945109,"teacher_disagreement_score":0.0092469985,"about_ca_system_score_codex":0.00060840085,"about_ca_system_score_gemma":0.0007903306,"threshold_uncertainty_score":0.018722534},"labels":[],"label_agreement":null},{"id":"W4409000099","doi":"10.1007/978-3-031-86585-5","title":"Computers and Games","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Digital Games and Media","field":"Social Sciences","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":"University of Alberta","keywords":"Computer science; Programming language","score_opus":0.011039275150368852,"score_gpt":0.26836715630015107,"score_spread":0.2573278811497822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409000099","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057219673,0.014769482,0.0044518914,0.0010546524,0.001101603,0.000033514672,0.000098366916,0.00019359686,0.9777248],"genre_scores_gemma":[0.005458936,0.006382743,0.0014701757,0.0002846765,0.0002190569,0.00003792658,0.000100232464,0.00009637901,0.98594993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997638,0.000038876347,0.000007224176,0.000039980416,0.00012565679,0.000024508465],"domain_scores_gemma":[0.9998635,0.00003683508,0.0000063021052,0.00002722776,0.000034774384,0.00003132599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020374823,0.0013963918,0.00065926486,0.0014837909,0.0009727033,0.004245343,0.0006676685,0.00097636675,0.13276157],"category_scores_gemma":[0.0007597082,0.0004000215,0.00028986,0.0016636074,0.0010430963,0.00277387,0.0017030436,0.0015553692,0.055774827],"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.000020604442,0.000050014798,0.00012917395,0.00020862815,0.000009161853,0.0000475852,0.00043000717,0.0005927586,0.00055362156,0.22776513,0.4346912,0.33550218],"study_design_scores_gemma":[0.000003252026,0.000012105648,0.0001900488,0.000095379895,0.0000032664732,0.00006700345,0.00011182797,0.00032994652,0.00010863222,0.03357442,0.9655007,0.0000034749582],"about_ca_topic_score_codex":0.002784884,"about_ca_topic_score_gemma":0.008264091,"teacher_disagreement_score":0.13276157,"about_ca_system_score_codex":0.0010121473,"about_ca_system_score_gemma":0.0009317571,"threshold_uncertainty_score":0.44413167},"labels":[],"label_agreement":null},{"id":"W4409053427","doi":"10.1007/978-3-031-86585-5_4","title":"Analysing KataGo: A Comparative Evaluation Against Perfect Play in the Game of Go","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Theoretical computer science","score_opus":0.060079771502954044,"score_gpt":0.3403553913993017,"score_spread":0.28027561989634764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409053427","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.64745164,0.004448902,0.082946636,0.0052633677,0.00100698,0.00065010984,0.0015134028,0.0009461479,0.2557728],"genre_scores_gemma":[0.9763155,0.00034116764,0.014685822,0.00039109858,0.00008413893,0.00023668699,0.0006779525,0.00035486245,0.0069128238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98830485,0.007584037,0.00050468737,0.00084203685,0.0022070636,0.0005573071],"domain_scores_gemma":[0.8750946,0.11342503,0.0023907274,0.0044379975,0.0034841667,0.0011675473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011390733,0.0012590477,0.0012597907,0.0022999605,0.0019901963,0.004014434,0.0026890836,0.0022867718,0.021538353],"category_scores_gemma":[0.08608143,0.0003610663,0.00094551634,0.0017565407,0.0062227077,0.010213729,0.0042854357,0.0028987676,0.0016002989],"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.021134209,0.0011947904,0.0115689095,0.0037251788,0.00057055167,0.00022261874,0.008575481,0.035025153,0.003202967,0.71256524,0.025451416,0.17676346],"study_design_scores_gemma":[0.0035798314,0.008876144,0.029911673,0.0017905226,0.0015843678,0.0006670806,0.02360728,0.20907134,0.008155243,0.6273921,0.085039414,0.00032509875],"about_ca_topic_score_codex":0.008177824,"about_ca_topic_score_gemma":0.011318577,"teacher_disagreement_score":0.021538353,"about_ca_system_score_codex":0.0036683416,"about_ca_system_score_gemma":0.001717074,"threshold_uncertainty_score":0.072052956},"labels":[],"label_agreement":null},{"id":"W4409053445","doi":"10.1007/978-3-031-86585-5_5","title":"Solving Linear NoGo with Combinatorial Game Theory","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Game theory; Theoretical computer science; Algorithm; Mathematical optimization; Mathematical economics; Mathematics","score_opus":0.015574870468661321,"score_gpt":0.25784878782039067,"score_spread":0.24227391735172935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409053445","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.031051476,0.00044189324,0.88133395,0.0008651964,0.00023453511,0.00025344398,0.0003562772,0.00087971106,0.08458352],"genre_scores_gemma":[0.37843454,0.0005485629,0.5688814,0.0005511912,0.00021389956,0.00058739504,0.0010914976,0.0006968999,0.04899466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991001,0.00034387142,0.00003776795,0.00015899506,0.000178358,0.00018084496],"domain_scores_gemma":[0.9985039,0.0012008905,0.000052981097,0.00010172637,0.00007361831,0.00006692515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964053,0.0013261524,0.0012530402,0.00063624425,0.0011390721,0.002178585,0.0032026325,0.0013087398,0.01843554],"category_scores_gemma":[0.0038621947,0.0007926988,0.0019265725,0.0010560635,0.0014936663,0.0031570916,0.0027115548,0.0039507323,0.0017889896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026289586,0.00041948186,0.0004444329,0.0008536839,0.00018289384,0.00018177192,0.00034341982,0.3012265,0.0019546172,0.53862673,0.023691144,0.13181253],"study_design_scores_gemma":[0.00007987595,0.00006030836,0.00008910747,0.00004504628,0.000043744916,0.000057424004,0.00012637903,0.3617802,0.00073779153,0.63063437,0.0063265106,0.000019319476],"about_ca_topic_score_codex":0.004235578,"about_ca_topic_score_gemma":0.009300847,"teacher_disagreement_score":0.01843554,"about_ca_system_score_codex":0.0013188261,"about_ca_system_score_gemma":0.0016348633,"threshold_uncertainty_score":0.061673045},"labels":[],"label_agreement":null},{"id":"W4409061687","doi":"10.1007/978-3-031-82362-6_9","title":"PhishCoder: Efficient Extraction of Contextual Information from Phishing Emails","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Phishing; Computer science; Information extraction; World Wide Web; Computer security; Information retrieval; Artificial intelligence; The Internet","score_opus":0.011722443104492199,"score_gpt":0.2361510860793195,"score_spread":0.2244286429748273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409061687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15598007,0.0071286564,0.5802022,0.0008526552,0.0009205436,0.0010121983,0.036820706,0.20328003,0.013802955],"genre_scores_gemma":[0.2806913,0.0025899725,0.61160445,0.00051470136,0.00065404526,0.0006336967,0.07234473,0.004176226,0.026790854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994616,0.000050698272,0.000035693218,0.00016090304,0.00020677291,0.00008441187],"domain_scores_gemma":[0.99922645,0.00024237784,0.00008087275,0.00018434528,0.00020252257,0.00006341131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035932774,0.0016335065,0.0014184491,0.0041820733,0.00070506183,0.0010897337,0.0009660743,0.0011761603,0.007649916],"category_scores_gemma":[0.0019497863,0.00060968165,0.0007523527,0.0030644275,0.0003223898,0.0014669878,0.0017410293,0.00072185067,0.012308801],"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.00047060667,0.00022684743,0.004622902,0.0006483913,0.00009334337,0.0005490088,0.00035637553,0.002033388,0.05938327,0.0016661288,0.097895935,0.8320538],"study_design_scores_gemma":[0.00023720994,0.0010988679,0.045457385,0.0003893628,0.00046155785,0.004278453,0.0009171723,0.42428598,0.2799144,0.019957524,0.22267616,0.0003259692],"about_ca_topic_score_codex":0.0031931342,"about_ca_topic_score_gemma":0.0057030325,"teacher_disagreement_score":0.007649916,"about_ca_system_score_codex":0.00033288915,"about_ca_system_score_gemma":0.0008176013,"threshold_uncertainty_score":0.025591552},"labels":[],"label_agreement":null},{"id":"W4409063685","doi":"10.1007/978-981-96-4603-6_21","title":"Optimizing Public Health: A Nationwide Vaccine Distribution Management System","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Viral Infections and Outbreaks Research","field":"Medicine","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":"Humber Polytechnic","funders":"","keywords":"Computer science","score_opus":0.03302585358613198,"score_gpt":0.3133874102243215,"score_spread":0.2803615566381895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409063685","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.15269284,0.00035128187,0.71588326,0.0024356605,0.00026913715,0.0007376992,0.004299184,0.07863409,0.044696927],"genre_scores_gemma":[0.64803225,0.00022672101,0.31779033,0.00066561176,0.00014316704,0.00043531365,0.004477432,0.00080294925,0.027426269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971396,0.0000723786,0.000020345351,0.0000893545,0.000059102655,0.00004476423],"domain_scores_gemma":[0.9993824,0.0002349571,0.000062566105,0.000105551466,0.00013077044,0.00008376327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072375074,0.0006229375,0.0004843786,0.00073997513,0.00059194106,0.0011606324,0.0010230532,0.0006731979,0.015033242],"category_scores_gemma":[0.0015671895,0.00037704472,0.00033782818,0.0008631056,0.00023200562,0.0013227112,0.0010851719,0.0004876702,0.0022469277],"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.00083451055,0.00082788966,0.012212451,0.00010475466,0.000105650484,0.00029724435,0.0001658662,0.26986846,0.011412925,0.0077393437,0.090196,0.60623485],"study_design_scores_gemma":[0.000115935596,0.00013449407,0.0027667647,0.000009855099,0.00004376551,0.00006186705,0.00008126674,0.97197646,0.0033938785,0.006403412,0.014991455,0.000020837097],"about_ca_topic_score_codex":0.009502785,"about_ca_topic_score_gemma":0.009469974,"teacher_disagreement_score":0.015033242,"about_ca_system_score_codex":0.000998255,"about_ca_system_score_gemma":0.0016471518,"threshold_uncertainty_score":0.05029124},"labels":[],"label_agreement":null},{"id":"W4409067494","doi":"10.1007/978-3-031-85697-6_9","title":"Parallel Maximal Common Subgraphs with Labels for Molecular Biology","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA and protein synthesis mechanisms","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.009941753901262897,"score_gpt":0.25138753036989087,"score_spread":0.24144577646862797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409067494","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.023607489,0.0014001948,0.92502636,0.0010885516,0.00034699848,0.00027298296,0.0017251548,0.0024621733,0.044070013],"genre_scores_gemma":[0.15441148,0.0014943455,0.7998676,0.00048804237,0.00036352858,0.0006943724,0.004143346,0.0014204346,0.037116934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995472,0.00010417401,0.000022012695,0.00015171719,0.00012786996,0.000046999703],"domain_scores_gemma":[0.99884194,0.0005378349,0.00005497301,0.00036905566,0.00012828354,0.000067985166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059415476,0.00091075257,0.00085218454,0.0013457605,0.0013322181,0.0013930711,0.0014686902,0.00068618386,0.012039047],"category_scores_gemma":[0.0018047427,0.00072150916,0.0011676108,0.0021581908,0.001113392,0.003953375,0.002093969,0.0016643252,0.0026564582],"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.00027029432,0.000108859276,0.00025381317,0.0004396881,0.000047849397,0.00012041388,0.000267171,0.020113947,0.013095158,0.7433131,0.028338645,0.19363107],"study_design_scores_gemma":[0.000019084115,0.000015156703,0.00011323221,0.000027194137,0.000020563026,0.000059839287,0.000032358206,0.036390122,0.0028759735,0.939726,0.020710811,0.000009665347],"about_ca_topic_score_codex":0.0010858078,"about_ca_topic_score_gemma":0.0022502826,"teacher_disagreement_score":0.012039047,"about_ca_system_score_codex":0.001401176,"about_ca_system_score_gemma":0.0007525327,"threshold_uncertainty_score":0.04027456},"labels":[],"label_agreement":null},{"id":"W4409075946","doi":"10.1007/978-3-031-82362-6_5","title":"Deep Learning for Network Anomaly Detection Under Data Contamination: Evaluating Robustness and Mitigating Performance Degradation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robustness (evolution); Anomaly detection; Contamination; Degradation (telecommunications); Artificial intelligence; Data mining; Real-time computing; Telecommunications","score_opus":0.034434955953586685,"score_gpt":0.289236039674537,"score_spread":0.2548010837209503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409075946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33533126,0.0016431593,0.6562257,0.00087380334,0.00026413225,0.00007362784,0.00039108857,0.003498725,0.0016985368],"genre_scores_gemma":[0.9156959,0.00036266964,0.08169429,0.00014170865,0.00007421424,0.000035101384,0.0005953374,0.00014698034,0.0012536803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794954,0.0006490693,0.00012558006,0.00038327885,0.0006226483,0.00026986242],"domain_scores_gemma":[0.98915267,0.0068502184,0.00077481504,0.0013192021,0.0016100126,0.00029311507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004743045,0.0012190429,0.0010637201,0.0007929954,0.00039495988,0.0011969712,0.0015941086,0.0015106486,0.0008225702],"category_scores_gemma":[0.020480577,0.0004017429,0.00052598957,0.00083993556,0.000884228,0.0021880714,0.0019322407,0.0019442027,0.00030334943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017058464,0.0004242245,0.014593643,0.00023076535,0.00032165262,0.00016470796,0.00010395692,0.5536233,0.017144758,0.002615851,0.0033786164,0.40569267],"study_design_scores_gemma":[0.00000675739,0.000097496704,0.0006106153,0.0000069090265,0.000018840921,0.000029141063,0.000010939223,0.9937588,0.004073567,0.0012552819,0.00012687113,0.0000048077004],"about_ca_topic_score_codex":0.0047539,"about_ca_topic_score_gemma":0.0037698955,"teacher_disagreement_score":0.0047539,"about_ca_system_score_codex":0.00093412877,"about_ca_system_score_gemma":0.0010927025,"threshold_uncertainty_score":0.0250839},"labels":[],"label_agreement":null},{"id":"W4409080406","doi":"10.1007/978-3-031-87897-8","title":"Design and Architecture for Signal and Image Processing","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"CCD and CMOS Imaging Sensors","field":"Engineering","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":"Brandenburgische Technische Universität Cottbus-Senftenberg; Sorbonne Université; Universidade do Porto; Universidad Politécnica de Madrid; Università degli Studi di Cagliari; Polytechnique Montréal; Indian National Science Academy","keywords":"Computer science; Architecture; Signal processing; Image processing; Image (mathematics); SIGNAL (programming language); Digital image processing; Computer architecture; Computer vision; Computer graphics (images); Artificial intelligence; Computer hardware; Digital signal processing; Programming language","score_opus":0.00782722738084828,"score_gpt":0.22161533766706684,"score_spread":0.21378811028621855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409080406","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.0064161816,0.0026249404,0.93682885,0.00058616017,0.0005659723,0.00020066903,0.0002513806,0.0049160826,0.04760974],"genre_scores_gemma":[0.1219691,0.0037203764,0.669241,0.0011428166,0.0005038481,0.00050272304,0.0012260773,0.00085314334,0.20084096],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970055,0.000033720025,0.000014131464,0.000048002068,0.00016048615,0.000043091564],"domain_scores_gemma":[0.9998036,0.000022420347,0.000011755922,0.000034365094,0.000116241434,0.0000116323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023594676,0.00081096514,0.00041224068,0.00056848215,0.00043216653,0.0012271024,0.0017292423,0.0009995659,0.017232163],"category_scores_gemma":[0.0003434555,0.00044780714,0.0003893469,0.00062357937,0.0002588091,0.0010391264,0.00050170295,0.0007935895,0.010707443],"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.00019539507,0.00011722447,0.00036658105,0.0007385235,0.00012173198,0.00021322005,0.00021503975,0.011668658,0.22045854,0.09365567,0.07978458,0.59246475],"study_design_scores_gemma":[0.0000855321,0.0008262454,0.000970321,0.00017684978,0.00018083985,0.0012354591,0.00009524103,0.13455223,0.16154951,0.029845426,0.67040366,0.00007877678],"about_ca_topic_score_codex":0.0013308707,"about_ca_topic_score_gemma":0.0025530572,"teacher_disagreement_score":0.017232163,"about_ca_system_score_codex":0.0006293314,"about_ca_system_score_gemma":0.0005956815,"threshold_uncertainty_score":0.057647288},"labels":[],"label_agreement":null},{"id":"W4409125220","doi":"10.1007/978-981-96-3294-7_10","title":"When Sexy Avatars Get Weird: How Brain Asymmetry and Oculomotor Dynamics Navigate the Uncanny","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Action Observation and Synchronization","field":"Psychology","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":"École de Technologie Supérieure; Université du Québec en Outaouais; Institut national de psychiatrie légale Philippe-Pinel","funders":"","keywords":"Uncanny; Uncanny valley; Computer science; Dynamics (music); Human–computer interaction; Cognitive science; Artificial intelligence; Psychology; Art; Aesthetics; Robot","score_opus":0.014025209814403267,"score_gpt":0.2670832431944544,"score_spread":0.2530580333800512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409125220","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.77741873,0.0056129135,0.06419811,0.0062428396,0.0013615766,0.000048985927,0.0004511483,0.00087446126,0.14379118],"genre_scores_gemma":[0.96802664,0.00074083084,0.009926312,0.00046399466,0.000083719875,0.000023674955,0.00012205927,0.00029188773,0.020320944],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998424,0.00004115556,0.000003832242,0.000046698777,0.000034200668,0.00003171257],"domain_scores_gemma":[0.999785,0.000085801876,0.00003209137,0.000019634263,0.000020711292,0.00005671542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024036039,0.00023944383,0.00020911625,0.00018735064,0.00045409813,0.001521757,0.00043608426,0.00070683996,0.008271579],"category_scores_gemma":[0.0018546617,0.00024860763,0.00018791153,0.00016475788,0.0008551849,0.0015786678,0.0010691402,0.0008263986,0.0012237751],"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.0012357614,0.00017579588,0.016376654,0.00036995354,0.00020037271,0.0030999738,0.011034844,0.0057508545,0.37716234,0.08560437,0.05377059,0.44521862],"study_design_scores_gemma":[0.0003320011,0.0009163283,0.21280143,0.0006470273,0.00035358508,0.0069606584,0.023480542,0.0738255,0.08310765,0.42463675,0.17256443,0.0003741287],"about_ca_topic_score_codex":0.00085924973,"about_ca_topic_score_gemma":0.001630756,"teacher_disagreement_score":0.008271579,"about_ca_system_score_codex":0.00020997657,"about_ca_system_score_gemma":0.00019544664,"threshold_uncertainty_score":0.027671158},"labels":[],"label_agreement":null},{"id":"W4409139886","doi":"10.1007/978-3-031-82349-7_10","title":"Dynamic k-Anonymity for Electronic Health Records: A Topological Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Privy Council Office","funders":"","keywords":"Computer science; Anonymity; Health records; Topology (electrical circuits); Theoretical computer science; Computer security; Health care; Mathematics; Combinatorics","score_opus":0.02138610076231759,"score_gpt":0.3042095264746743,"score_spread":0.28282342571235675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409139886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114723155,0.0010717841,0.96742034,0.0020170894,0.00020795304,0.000113400536,0.00056853663,0.00034077812,0.016787827],"genre_scores_gemma":[0.6073097,0.00371407,0.37101027,0.0005027387,0.0009985446,0.00036739357,0.0012895874,0.0002358924,0.014571701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953435,0.0019309113,0.0003832484,0.00083402445,0.0010303758,0.00047784793],"domain_scores_gemma":[0.9929705,0.0029526132,0.0010163459,0.0017803215,0.00092141127,0.00035883044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036251785,0.000831737,0.0012043633,0.0033633518,0.0034848813,0.008123253,0.0033130336,0.0022240905,0.003951119],"category_scores_gemma":[0.008110979,0.0007229928,0.001474607,0.005670403,0.0043142233,0.016971653,0.00648324,0.00269132,0.0013972564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058635684,0.000027083439,0.00024365916,0.0001246285,0.000020747819,0.00009637325,0.0002881361,0.013681624,0.0008604966,0.9628967,0.002914114,0.018787736],"study_design_scores_gemma":[0.000016921726,0.00006996143,0.00024674757,0.000073594405,0.000054300985,0.00047724182,0.00043503183,0.07974371,0.0013811584,0.8888194,0.02862776,0.00005416057],"about_ca_topic_score_codex":0.0007105759,"about_ca_topic_score_gemma":0.0006637479,"teacher_disagreement_score":0.008123253,"about_ca_system_score_codex":0.0027040679,"about_ca_system_score_gemma":0.001700682,"threshold_uncertainty_score":0.019619465},"labels":[],"label_agreement":null},{"id":"W4409160206","doi":"10.1007/978-3-031-88711-6_15","title":"Rank-Without-GPT: Building GPT-Independent Listwise Rerankers on Open-Source Large Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Regional Municipality of Waterloo; University of Waterloo","funders":"","keywords":"Computer science; Rank (graph theory); Open source; Artificial intelligence; Programming language; Natural language processing; Mathematics; Software","score_opus":0.01984332292328901,"score_gpt":0.2749590694641937,"score_spread":0.2551157465409047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409160206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017284706,0.00187355,0.76825076,0.0006615541,0.00090302044,0.0005364853,0.011000973,0.1930232,0.00646572],"genre_scores_gemma":[0.092910126,0.0006499689,0.8330901,0.0006597906,0.0006152025,0.00069531077,0.044139378,0.008994575,0.018245587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972535,0.0008283336,0.00018087155,0.00075971906,0.0006495951,0.00032803338],"domain_scores_gemma":[0.9934436,0.0032409343,0.00018009947,0.0018262551,0.0010670434,0.00024209508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032081737,0.004201436,0.0027269998,0.0036818467,0.0014250652,0.002679325,0.0038375824,0.0033715728,0.024321882],"category_scores_gemma":[0.01600742,0.0017502942,0.0028598513,0.0029280249,0.00083805487,0.0058367862,0.0028504138,0.004752222,0.033015657],"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.0005370517,0.0004188762,0.0012716524,0.00052285404,0.00039400003,0.0002680621,0.00015811752,0.051554706,0.006536636,0.0067645144,0.20094907,0.7306245],"study_design_scores_gemma":[0.00038962573,0.0002476125,0.0004992284,0.00005649378,0.00014177729,0.00017900534,0.00010362563,0.9404159,0.0072571216,0.032850746,0.017777465,0.00008129474],"about_ca_topic_score_codex":0.010463653,"about_ca_topic_score_gemma":0.039497875,"teacher_disagreement_score":0.024321882,"about_ca_system_score_codex":0.0011813994,"about_ca_system_score_gemma":0.0034541436,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4409166166","doi":"10.1007/978-3-031-88720-8_38","title":"Advancing Query Performance Prediction: Challenges and Adaptive Solutions","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Query optimization; Information retrieval; Artificial intelligence","score_opus":0.10141723586476338,"score_gpt":0.3252785790447352,"score_spread":0.22386134317997186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409166166","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.029083276,0.025558282,0.8948225,0.029091239,0.0009850104,0.00015627022,0.0011305078,0.005493079,0.013679877],"genre_scores_gemma":[0.581592,0.016698401,0.38409555,0.003357375,0.003893472,0.00019511186,0.002017637,0.000805511,0.007344905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954586,0.0012272961,0.00026373763,0.00092398433,0.0017565113,0.00036988413],"domain_scores_gemma":[0.975276,0.015165573,0.0011809816,0.003461832,0.0042850324,0.00063056545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009969394,0.0017184697,0.002808875,0.001656481,0.0007191251,0.006181658,0.00517833,0.0024180894,0.0031064395],"category_scores_gemma":[0.032983165,0.0007781947,0.0006656151,0.0038746842,0.0011018898,0.008483799,0.002636937,0.005816418,0.002407521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022894255,0.00045212844,0.009068567,0.000417579,0.00012664491,0.00006305149,0.0002476791,0.06428298,0.0039457707,0.029562997,0.049261615,0.84234196],"study_design_scores_gemma":[0.000031624,0.00011637521,0.002298284,0.000155037,0.0000592586,0.00010102824,0.00028726744,0.8597494,0.0027987699,0.12101665,0.013323577,0.000062857776],"about_ca_topic_score_codex":0.0067784614,"about_ca_topic_score_gemma":0.004713989,"teacher_disagreement_score":0.009969394,"about_ca_system_score_codex":0.0013144015,"about_ca_system_score_gemma":0.0018262637,"threshold_uncertainty_score":0.052723825},"labels":[],"label_agreement":null},{"id":"W4409166215","doi":"10.1007/978-3-031-88720-8_36","title":"Mitigating Gender Bias in Information Retrieval Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gender and Technology in Education","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Information retrieval; Artificial intelligence","score_opus":0.03982877031810694,"score_gpt":0.30069493475340137,"score_spread":0.2608661644352944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409166215","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.60607487,0.011998971,0.33298,0.006885939,0.001186934,0.0004097195,0.0011335646,0.001981998,0.03734801],"genre_scores_gemma":[0.92408043,0.0013365068,0.06285513,0.0009871804,0.0008366809,0.0001077396,0.00044821049,0.0003054222,0.009042741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98952496,0.006024187,0.00053191057,0.0008235387,0.0025323948,0.0005630584],"domain_scores_gemma":[0.9544141,0.033790078,0.0021332197,0.004077463,0.005143534,0.0004416283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012665582,0.0006816234,0.0010932111,0.0015171746,0.0013725366,0.002132482,0.00097118376,0.0011748804,0.0064286813],"category_scores_gemma":[0.06628407,0.00048780715,0.00042977367,0.0019610492,0.0010952537,0.004374014,0.0024656642,0.0011078126,0.002224647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025298707,0.00046448954,0.040506847,0.00077208993,0.00029772808,0.00028230756,0.002145804,0.014708548,0.04689946,0.035851464,0.016206529,0.83933485],"study_design_scores_gemma":[0.0005396692,0.0025345446,0.07226012,0.00046103244,0.00092517777,0.0015327636,0.004137497,0.53040713,0.1123082,0.21682331,0.05776117,0.00030944432],"about_ca_topic_score_codex":0.0029940144,"about_ca_topic_score_gemma":0.0043253717,"teacher_disagreement_score":0.012665582,"about_ca_system_score_codex":0.0012153046,"about_ca_system_score_gemma":0.0016992115,"threshold_uncertainty_score":0.066982806},"labels":[],"label_agreement":null},{"id":"W4409166237","doi":"10.1007/978-3-031-88720-8_51","title":"Eval4RAG: Workshop on Evaluation of Retrieval-Augmented Generation Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Artificial intelligence","score_opus":0.06232949037925545,"score_gpt":0.3027192913743151,"score_spread":0.24038980099505963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409166237","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109155826,0.02924948,0.6485755,0.004566624,0.006053441,0.002956212,0.030464083,0.0866713,0.082307585],"genre_scores_gemma":[0.35229042,0.003339604,0.5032074,0.0016151316,0.00078814616,0.0015325821,0.06075885,0.009415038,0.067052744],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97908473,0.012582921,0.0007430185,0.0017335401,0.0050899563,0.00076577876],"domain_scores_gemma":[0.9875311,0.0061650095,0.00024223913,0.0028522417,0.0028590912,0.0003502263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016924154,0.0032258877,0.0026706643,0.0026073807,0.0009810925,0.004576709,0.0068859295,0.0035506375,0.039248716],"category_scores_gemma":[0.025803449,0.00092759525,0.0016112614,0.0019568661,0.0012227125,0.0050130617,0.0040445244,0.002346106,0.009421802],"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.006632835,0.0012225249,0.0019938643,0.002016799,0.00075501,0.00028233332,0.00037598537,0.041911785,0.015564366,0.01309644,0.20183307,0.71431506],"study_design_scores_gemma":[0.0026510553,0.0033787016,0.0054055257,0.0007002144,0.0008854275,0.00059706083,0.0005707527,0.6429775,0.07915612,0.037372023,0.22603028,0.0002754279],"about_ca_topic_score_codex":0.012069837,"about_ca_topic_score_gemma":0.010051667,"teacher_disagreement_score":0.039248716,"about_ca_system_score_codex":0.0026602333,"about_ca_system_score_gemma":0.002192268,"threshold_uncertainty_score":0.13129997},"labels":[],"label_agreement":null},{"id":"W4409166767","doi":"10.1007/978-3-031-88720-8_59","title":"CLEF 2025 JOKER Lab: Humour in the Machine","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Humor Studies and Applications","field":"Psychology","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 Manitoba","funders":"","keywords":"Clef; Computer science; Artificial intelligence; Natural language processing; Information retrieval; Computer graphics (images); Engineering","score_opus":0.02348947909314993,"score_gpt":0.32174896270286335,"score_spread":0.29825948360971344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409166767","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020440535,0.023370208,0.018453568,0.01878164,0.013941069,0.00026884224,0.02235872,0.0104026105,0.8903793],"genre_scores_gemma":[0.015694093,0.004636626,0.01162424,0.0038380614,0.004661351,0.00014856417,0.018067818,0.0047325282,0.93659675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991535,0.00022400352,0.000027575867,0.0001235021,0.00039605715,0.00007537698],"domain_scores_gemma":[0.9987895,0.00050219125,0.00003475367,0.00010786044,0.00029773387,0.00026793504],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010151506,0.0015510168,0.0011831699,0.0021697104,0.0018649643,0.0048266836,0.0011478197,0.0026004247,0.42305523],"category_scores_gemma":[0.0031992807,0.00047931846,0.0005992602,0.0020569605,0.0006195838,0.002952408,0.0013651957,0.002057358,0.19293317],"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.000013576427,0.0000055743158,0.000016491189,0.000058313766,0.0000016350226,0.000018217648,0.000009198208,0.00007011259,0.00013427377,0.0023209401,0.9642424,0.03310935],"study_design_scores_gemma":[0.000015143007,0.000012279576,0.00046176033,0.00008945214,0.0000027866054,0.00016717361,0.000032438635,0.0007649522,0.00074119377,0.0053540315,0.9923441,0.000014793094],"about_ca_topic_score_codex":0.0055520753,"about_ca_topic_score_gemma":0.016157238,"teacher_disagreement_score":0.42305523,"about_ca_system_score_codex":0.0018212195,"about_ca_system_score_gemma":0.0010205786,"threshold_uncertainty_score":0.82294166},"labels":[],"label_agreement":null},{"id":"W4409166892","doi":"10.1007/978-3-031-88720-8_48","title":"The Second Search Futures Workshop at ECIR’25","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Nuvo Pharmaceuticals (Canada); University of Waterloo","funders":"","keywords":"Futures contract; Computer science; Financial economics; Economics","score_opus":0.01779428728388715,"score_gpt":0.2622388455176787,"score_spread":0.24444455823379152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409166892","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040097572,0.04487164,0.19934502,0.10596839,0.11843359,0.0011655717,0.022107806,0.021904368,0.44610602],"genre_scores_gemma":[0.069882795,0.0052016103,0.049537983,0.0068923477,0.0045662485,0.00056026055,0.020624794,0.004113439,0.8386204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964367,0.0010112429,0.00011692197,0.000568838,0.0012402054,0.0006260671],"domain_scores_gemma":[0.99423873,0.0014795588,0.000075251235,0.00078760594,0.0016861331,0.0017327174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008149593,0.0019390825,0.0020289854,0.0017638752,0.0030456956,0.011699675,0.0027493134,0.0040761866,0.099942386],"category_scores_gemma":[0.008036688,0.0007746425,0.001380707,0.0016895544,0.001300618,0.008534907,0.0038243511,0.0046102284,0.06742333],"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.0005268695,0.00018999637,0.00026577793,0.00021100572,0.00002952173,0.000118409895,0.00034961684,0.00073573267,0.0026882007,0.01173762,0.90386575,0.07928153],"study_design_scores_gemma":[0.00010614196,0.00015178244,0.00048190338,0.0001277716,0.00003357809,0.00012917815,0.00064367213,0.0047613555,0.0038679359,0.0140455505,0.975594,0.000056968653],"about_ca_topic_score_codex":0.015135261,"about_ca_topic_score_gemma":0.024805408,"teacher_disagreement_score":0.099942386,"about_ca_system_score_codex":0.003296885,"about_ca_system_score_gemma":0.005505931,"threshold_uncertainty_score":0.33434057},"labels":[],"label_agreement":null},{"id":"W4409167082","doi":"10.1007/978-3-031-88708-6_2","title":"Embedding Cultural Diversity in Prototype-Based Recommender Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Embedding; Recommender system; Diversity (politics); World Wide Web; Human–computer interaction; Information retrieval; Artificial intelligence; Anthropology","score_opus":0.036335108858232844,"score_gpt":0.282698486009345,"score_spread":0.24636337715111215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409167082","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.12660092,0.001599921,0.86392003,0.00057915057,0.00013839884,0.00015434413,0.00014685825,0.0006185092,0.0062418804],"genre_scores_gemma":[0.8037555,0.0005782951,0.19210418,0.000087454326,0.00007207222,0.00012683665,0.00024227348,0.00007461477,0.0029588086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971449,0.0015871623,0.00015060442,0.00041530348,0.0005898716,0.000112220885],"domain_scores_gemma":[0.9861953,0.0091511775,0.0004157082,0.0023538037,0.0016105997,0.00027331887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035424433,0.0004705664,0.0011409178,0.00097440346,0.00083972473,0.0024361345,0.0015647196,0.0014514724,0.0022722215],"category_scores_gemma":[0.023095325,0.00064894726,0.0007743583,0.0015494655,0.0009915073,0.006049007,0.0031390258,0.0015396872,0.0006754623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006582062,0.0007202284,0.008316416,0.0005435779,0.00037977486,0.00023989522,0.0021183928,0.20384148,0.010856736,0.072204255,0.0050714887,0.6950496],"study_design_scores_gemma":[0.00006899896,0.0003664404,0.0014593274,0.00006716645,0.000101389305,0.00019676829,0.0004053488,0.9159894,0.0042697224,0.073159665,0.0038563777,0.00005934195],"about_ca_topic_score_codex":0.0018892302,"about_ca_topic_score_gemma":0.0027134717,"teacher_disagreement_score":0.0035424433,"about_ca_system_score_codex":0.000538819,"about_ca_system_score_gemma":0.00050620845,"threshold_uncertainty_score":0.018734455},"labels":[],"label_agreement":null},{"id":"W4409167231","doi":"10.1007/978-3-031-88708-6_3","title":"Is Relevance Propagated from Retriever to Generator in RAG?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":7,"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":"Computer science; Relevance (law); Generator (circuit theory); Labrador Retriever; Medicine; Physics; Political science; Law; Pathology","score_opus":0.01878913682042273,"score_gpt":0.24553504560915881,"score_spread":0.22674590878873607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409167231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32735533,0.008237931,0.4775711,0.0164806,0.0031556939,0.0007404228,0.007971238,0.048225448,0.11026222],"genre_scores_gemma":[0.8929616,0.0016549054,0.05443299,0.0013902555,0.0016333868,0.000089570174,0.005498135,0.0054802108,0.03685905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943896,0.0014962793,0.0002847231,0.001344436,0.0017952543,0.0006896785],"domain_scores_gemma":[0.9840919,0.0071633263,0.0006877075,0.0043753847,0.0030224305,0.0006592897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050936067,0.0009815679,0.001472078,0.0031575179,0.0014345243,0.006322133,0.0024489346,0.0025292232,0.018174183],"category_scores_gemma":[0.0318363,0.0013203783,0.0009822232,0.0021341303,0.0016550259,0.015918907,0.0025640605,0.002532354,0.013588029],"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.0028263677,0.0005548948,0.024970077,0.0017158089,0.00046816794,0.0022155894,0.0046739993,0.0090874685,0.1229016,0.12842242,0.122360095,0.57980347],"study_design_scores_gemma":[0.00051458646,0.0010237942,0.040731344,0.00040182806,0.0013582426,0.00412679,0.0028179768,0.15561453,0.18632953,0.4040999,0.20237248,0.0006090508],"about_ca_topic_score_codex":0.0045475317,"about_ca_topic_score_gemma":0.003103384,"teacher_disagreement_score":0.018174183,"about_ca_system_score_codex":0.0018886682,"about_ca_system_score_gemma":0.001821515,"threshold_uncertainty_score":0.060798645},"labels":[],"label_agreement":null},{"id":"W4409167270","doi":"10.1007/978-3-031-88708-6_16","title":"Lost but Not Only in the Middle","year":2025,"lang":"fr","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Universiteit van Amsterdam; Canadian Institute of Steel Construction","keywords":"Computer science","score_opus":0.05394133038696452,"score_gpt":0.2599273289173427,"score_spread":0.2059859985303782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409167270","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027743888,0.040935047,0.021927534,0.0659425,0.031659342,0.00007333384,0.000767939,0.0012157781,0.83470416],"genre_scores_gemma":[0.011613828,0.006616006,0.0025100105,0.0065653715,0.003392333,0.000031673153,0.00024059784,0.0007996372,0.9682304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993204,0.00011591211,0.00002820788,0.0001867542,0.0002446695,0.000104058636],"domain_scores_gemma":[0.9988207,0.00028887033,0.000046718153,0.0002214193,0.0003624507,0.00025987855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009878573,0.0009121873,0.0011032646,0.0014169228,0.0037548072,0.013681819,0.0011418859,0.0022207047,0.13078322],"category_scores_gemma":[0.0037221648,0.0006564914,0.0008011925,0.0013887322,0.0033369975,0.022922518,0.004786941,0.00883525,0.09209767],"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.00009955866,0.000040082345,0.00016792685,0.00026995444,0.000019713152,0.00017361104,0.0031896152,0.00013024523,0.0014402672,0.2769248,0.56729317,0.15025114],"study_design_scores_gemma":[0.0000026322166,0.00001015067,0.00006593842,0.00010194428,0.0000049415107,0.00014634323,0.0004169746,0.00004649818,0.00014848643,0.02274017,0.97630864,0.000007182426],"about_ca_topic_score_codex":0.00196084,"about_ca_topic_score_gemma":0.003238388,"teacher_disagreement_score":0.13078322,"about_ca_system_score_codex":0.0019478776,"about_ca_system_score_gemma":0.0012791789,"threshold_uncertainty_score":0.4375134},"labels":[],"label_agreement":null},{"id":"W4409183155","doi":"10.1007/978-3-031-88714-7_13","title":"LiT and Lean: Distilling Listwise Rerankers Into Encoder-Decoder Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encoder; Lean manufacturing; Parallel computing; Manufacturing engineering; Operating system; Engineering","score_opus":0.019965150891148635,"score_gpt":0.24984915054222265,"score_spread":0.229883999651074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183155","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.005872371,0.0011131719,0.9582705,0.000370242,0.00030381823,0.00014484125,0.0014518001,0.03050596,0.0019673037],"genre_scores_gemma":[0.09707882,0.0008768843,0.8687194,0.00068459957,0.00042201075,0.00040025005,0.009393489,0.003910079,0.018514464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790597,0.0008488616,0.00013643502,0.00056727644,0.00038369716,0.00015784307],"domain_scores_gemma":[0.99211544,0.0057493667,0.0002115465,0.00084776105,0.0009065455,0.0001692945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033268633,0.003041838,0.0022134907,0.0026645039,0.0009440221,0.002724384,0.0038727317,0.0032045783,0.014908744],"category_scores_gemma":[0.012110638,0.0018208772,0.0018266427,0.0027691398,0.00083673635,0.005314312,0.0019101277,0.004303505,0.012566031],"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.00050430134,0.00022874677,0.00052614644,0.0003182872,0.00021482418,0.00019631315,0.00015347831,0.13473149,0.004320542,0.014278396,0.04622496,0.7983025],"study_design_scores_gemma":[0.0000739107,0.00009856625,0.00008448734,0.000047438683,0.00005829318,0.000053836084,0.000034715158,0.96029335,0.003968216,0.030701825,0.0045511113,0.000034256216],"about_ca_topic_score_codex":0.014581661,"about_ca_topic_score_gemma":0.040243413,"teacher_disagreement_score":0.014908744,"about_ca_system_score_codex":0.001591204,"about_ca_system_score_gemma":0.0029334258,"threshold_uncertainty_score":0.049874663},"labels":[],"label_agreement":null},{"id":"W4409183237","doi":"10.1007/978-3-031-88714-7_1","title":"exHarmony: Authorship and Citations for Benchmarking the Reviewer Assignment Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Toronto; Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Benchmarking; Information retrieval; Management","score_opus":0.03858181707379498,"score_gpt":0.27900060615413147,"score_spread":0.24041878908033648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27539364,0.013033265,0.56475157,0.0073900223,0.006143174,0.0009836036,0.047055874,0.028691767,0.056557126],"genre_scores_gemma":[0.59661084,0.0011795011,0.33721945,0.00045205475,0.0011944238,0.0007152364,0.041190643,0.0032247966,0.018213032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9721121,0.014855402,0.0019469087,0.0032502522,0.006897643,0.00093775016],"domain_scores_gemma":[0.86578846,0.09027277,0.0050049596,0.02272382,0.012563571,0.0036463898],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.022588722,0.0016467167,0.0026513897,0.011177999,0.002591868,0.0056369537,0.004162424,0.00430251,0.0133250095],"category_scores_gemma":[0.14873025,0.0005817303,0.0011812904,0.012701409,0.0016634332,0.0074380725,0.004812278,0.00243384,0.0049097906],"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.001911836,0.0012508519,0.033925407,0.0018650334,0.00074955367,0.0002963611,0.0009635931,0.09808451,0.0023397845,0.073654935,0.24642085,0.5385374],"study_design_scores_gemma":[0.00056564395,0.00059638225,0.01143652,0.00036091328,0.0002608475,0.00050637114,0.0007210148,0.7256965,0.006878468,0.2027539,0.050055567,0.00016794987],"about_ca_topic_score_codex":0.0022065046,"about_ca_topic_score_gemma":0.0032672319,"teacher_disagreement_score":0.97741127,"about_ca_system_score_codex":0.0018718222,"about_ca_system_score_gemma":0.0032962114,"threshold_uncertainty_score":0.11946195},"labels":[],"label_agreement":null},{"id":"W4409183264","doi":"10.1007/978-3-031-88714-7_14","title":"The Impact of Incidental Multilingual Text on Cross-Lingual Transfer in Monolingual Retrieval","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Transfer (computing); Information retrieval; Speech recognition","score_opus":0.019360761337072593,"score_gpt":0.31301041212996555,"score_spread":0.29364965079289296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183264","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.9327972,0.0026126022,0.017475458,0.0006377086,0.00033885456,0.000082100305,0.00051058055,0.0011171036,0.044428386],"genre_scores_gemma":[0.9913244,0.00064785517,0.0028980495,0.00011784802,0.00018836389,0.00003402569,0.00048312268,0.00038868084,0.003917678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964585,0.0018734712,0.00024982102,0.00052221434,0.00055998925,0.0003361112],"domain_scores_gemma":[0.941327,0.051533353,0.00080928113,0.002549009,0.0030042545,0.0007772081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040170737,0.00055101427,0.0008354532,0.0011642838,0.0010812032,0.0036381623,0.0007431474,0.00096062326,0.010018106],"category_scores_gemma":[0.053015567,0.0004632313,0.00041811293,0.0014721889,0.0012404498,0.008215994,0.0034834193,0.0015515012,0.004549302],"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.007888349,0.0013516144,0.026034415,0.0013965961,0.00037403303,0.0011506282,0.0047694575,0.014102612,0.14398739,0.008049108,0.01053792,0.78035784],"study_design_scores_gemma":[0.00069955655,0.004531024,0.27980536,0.0005264149,0.0030152558,0.005267534,0.0140793,0.28405827,0.31768402,0.06774653,0.021958608,0.0006281891],"about_ca_topic_score_codex":0.0028386454,"about_ca_topic_score_gemma":0.0025161183,"teacher_disagreement_score":0.010018106,"about_ca_system_score_codex":0.00076551875,"about_ca_system_score_gemma":0.001000973,"threshold_uncertainty_score":0.033513904},"labels":[],"label_agreement":null},{"id":"W4409183409","doi":"10.1007/978-3-031-88714-7_35","title":"Retrieval-Augmented Neural Team Formation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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 Toronto; University of Guelph","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Human–computer interaction","score_opus":0.014930001063955195,"score_gpt":0.2470052268019763,"score_spread":0.2320752257380211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183409","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.021001022,0.00043632975,0.9610148,0.00022179532,0.00020475364,0.00004801287,0.00005810594,0.00077019824,0.016244946],"genre_scores_gemma":[0.7621596,0.00040700345,0.19440605,0.00015145414,0.00015266152,0.00018038016,0.00028825342,0.00022280605,0.04203185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.00004807386,0.000008907564,0.000056926514,0.0000509678,0.000036221427],"domain_scores_gemma":[0.99966145,0.00013232262,0.000038167,0.00007241497,0.00006459495,0.000031047017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041207782,0.0005406693,0.0008505321,0.0003098037,0.00039171113,0.0006435951,0.0014173776,0.0011072867,0.0061231614],"category_scores_gemma":[0.0012414248,0.0004503922,0.00045137602,0.00042109916,0.0006677773,0.0010109498,0.0020735955,0.0010230313,0.0013899463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013912743,0.00007283221,0.00016354944,0.00010045258,0.000043295106,0.00008076203,0.00008252624,0.76713556,0.0077323476,0.031021586,0.0066051884,0.18682283],"study_design_scores_gemma":[0.000009392461,0.000038064984,0.00004499246,0.0000050132844,0.0000046388163,0.00002373893,0.000008892783,0.98722154,0.000973713,0.010756271,0.0009087401,0.000004956679],"about_ca_topic_score_codex":0.0020287896,"about_ca_topic_score_gemma":0.002081531,"teacher_disagreement_score":0.0061231614,"about_ca_system_score_codex":0.0004494482,"about_ca_system_score_gemma":0.00048291465,"threshold_uncertainty_score":0.02048397},"labels":[],"label_agreement":null},{"id":"W4409183414","doi":"10.1007/978-3-031-88714-7_39","title":"Patience in Proximity: A Simple Early Termination Strategy for HNSW Graph Traversal in Approximate k-Nearest Neighbor Search","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree traversal; Graph traversal; Computer science; Patience; Simple (philosophy); k-nearest neighbors algorithm; Graph; Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.026428606585710297,"score_gpt":0.3004862981981869,"score_spread":0.2740576916124766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183414","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.01546202,0.00014597338,0.9755264,0.00013876002,0.000066156514,0.0001656174,0.00015893961,0.002976684,0.005359513],"genre_scores_gemma":[0.1515924,0.000080624966,0.8399101,0.00012563962,0.000039498456,0.0002095333,0.0005780409,0.0008973901,0.0065667983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982083,0.00044655678,0.00016580928,0.00022479954,0.00074813364,0.00020647071],"domain_scores_gemma":[0.99631363,0.0015367379,0.00015752643,0.0012038419,0.00061071425,0.00017754162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016288782,0.0006451178,0.001115172,0.0012333209,0.0010651337,0.0016601407,0.0028514846,0.0012211167,0.008990755],"category_scores_gemma":[0.009353164,0.0005732081,0.00080572336,0.0020496089,0.001120269,0.0035765553,0.0036612134,0.0016451762,0.0023896554],"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.0013016952,0.00050573336,0.0027981289,0.00042216148,0.00009051843,0.00024937655,0.00075779966,0.07575399,0.026773427,0.10639024,0.01593425,0.76902276],"study_design_scores_gemma":[0.000114219634,0.00019554853,0.00048448998,0.00003654169,0.00004930511,0.00016234627,0.00021294698,0.9098781,0.013432532,0.0650449,0.010355291,0.00003384263],"about_ca_topic_score_codex":0.0044181393,"about_ca_topic_score_gemma":0.01143148,"teacher_disagreement_score":0.008990755,"about_ca_system_score_codex":0.0009066145,"about_ca_system_score_gemma":0.0019311917,"threshold_uncertainty_score":0.0300771},"labels":[],"label_agreement":null},{"id":"W4409183528","doi":"10.1007/978-981-96-4656-2_5","title":"Testing and Design of Uniform CNF Samplers: A Virtuous Cycle Enabled by Distribution Testing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distribution (mathematics); Mathematics","score_opus":0.0400573742236029,"score_gpt":0.2695620406360729,"score_spread":0.22950466641247003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183528","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.018764807,0.00013253433,0.97751087,0.000078216,0.00002949858,0.00009020171,0.000037363883,0.0014576943,0.0018988216],"genre_scores_gemma":[0.5665956,0.00014592712,0.42959157,0.00019608365,0.000038850176,0.0002286678,0.000173082,0.00050919486,0.0025209847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947429,0.0020670278,0.00026644496,0.0009959363,0.0014100616,0.0005176682],"domain_scores_gemma":[0.98951066,0.0055909688,0.000624811,0.0024475034,0.0014833799,0.00034268407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049344534,0.00092594186,0.0009506498,0.0011747602,0.0006543741,0.0016786947,0.003585152,0.0011550956,0.0034494284],"category_scores_gemma":[0.015721349,0.00075596443,0.00070834573,0.0007944495,0.0026780053,0.003434539,0.0022285383,0.0013816733,0.0007479399],"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.0010222181,0.00028636394,0.004615762,0.0005116831,0.000096608994,0.0003588936,0.0005589175,0.12189756,0.031850893,0.41413572,0.003974013,0.42069125],"study_design_scores_gemma":[0.0001375983,0.00037644795,0.00040753867,0.00011046797,0.00006429243,0.00030728843,0.000056471956,0.7588647,0.047538646,0.18425569,0.007836872,0.00004407908],"about_ca_topic_score_codex":0.0028680502,"about_ca_topic_score_gemma":0.0034777215,"teacher_disagreement_score":0.0049344534,"about_ca_system_score_codex":0.0017094413,"about_ca_system_score_gemma":0.0026123507,"threshold_uncertainty_score":0.026096225},"labels":[],"label_agreement":null},{"id":"W4409253307","doi":"10.1007/978-3-031-87719-3_4","title":"Reusable Formal Model Libraries for Specifying and Analyzing Security Objectives in Event-B","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Computer science; Event (particle physics); Formal methods; Software engineering; Programming language","score_opus":0.022661788239533055,"score_gpt":0.2662824902534406,"score_spread":0.24362070201390754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409253307","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.0012479409,0.00004949921,0.9850942,0.00005023155,0.000017557675,0.00015006315,0.00045683188,0.011383364,0.0015502471],"genre_scores_gemma":[0.064166546,0.00046424978,0.9136105,0.00022927935,0.00005379255,0.0009979446,0.004180474,0.008719631,0.0075776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976974,0.00057799835,0.00038070767,0.00028636795,0.00084213674,0.00021527315],"domain_scores_gemma":[0.9932533,0.003550667,0.0006366341,0.0017763608,0.000633053,0.00014992399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043765837,0.0027120318,0.0012154098,0.0031537334,0.0012124642,0.0049629495,0.0036068284,0.0018277881,0.012841992],"category_scores_gemma":[0.009768172,0.0027063438,0.0034968958,0.0020703136,0.0015325221,0.006281705,0.003046036,0.003466107,0.0047979485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043323913,0.00069612364,0.0026799543,0.001499061,0.00026521352,0.00069129915,0.0012803917,0.17056501,0.016966527,0.52213216,0.025867825,0.2569232],"study_design_scores_gemma":[0.00021581986,0.00013032962,0.00038651057,0.00048069505,0.0003169903,0.00042923796,0.0002695807,0.63937616,0.04617014,0.20611912,0.105950415,0.000155048],"about_ca_topic_score_codex":0.0053767157,"about_ca_topic_score_gemma":0.009721523,"teacher_disagreement_score":0.012841992,"about_ca_system_score_codex":0.0020105708,"about_ca_system_score_gemma":0.0034589402,"threshold_uncertainty_score":0.042960763},"labels":[],"label_agreement":null},{"id":"W4409254452","doi":"10.1007/978-3-031-87719-3_7","title":"A Tool Support Methodology for Creating Security Cases Using Argument Patterns","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"Carleton University","funders":"","keywords":"Computer science; Argument (complex analysis); Software engineering","score_opus":0.04154853577487025,"score_gpt":0.28582922638364616,"score_spread":0.2442806906087759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409254452","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.002033135,0.000030303501,0.9824706,0.0001473083,0.000026243657,0.00031880467,0.00028496745,0.012328065,0.0023606424],"genre_scores_gemma":[0.016760277,0.00005869109,0.9772456,0.000055604924,0.000010302782,0.0003306827,0.00087778387,0.001642378,0.0030186241],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953933,0.0011406738,0.0006574295,0.00068330043,0.0018969033,0.00022844347],"domain_scores_gemma":[0.98775613,0.007802609,0.0005585938,0.0024370085,0.0011369505,0.00030861795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053576417,0.0019790432,0.0009630105,0.0051274397,0.001439121,0.0067769215,0.0041851997,0.0027037258,0.018213099],"category_scores_gemma":[0.019831419,0.002584234,0.0025756105,0.0025686766,0.0016429971,0.007190553,0.004430195,0.0034354322,0.005886664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002447624,0.0009191287,0.0035232864,0.0012403358,0.00021363137,0.0018968188,0.003894548,0.010756063,0.026346684,0.17114718,0.029827146,0.74999046],"study_design_scores_gemma":[0.00041662098,0.0003561674,0.0018022768,0.0010917515,0.0003715506,0.0048988443,0.0013824421,0.32352075,0.09385805,0.22202164,0.34993708,0.00034283593],"about_ca_topic_score_codex":0.0013184582,"about_ca_topic_score_gemma":0.0024789907,"teacher_disagreement_score":0.018213099,"about_ca_system_score_codex":0.0008296497,"about_ca_system_score_gemma":0.0018135969,"threshold_uncertainty_score":0.06092888},"labels":[],"label_agreement":null},{"id":"W4409378014","doi":"10.1007/978-3-031-84525-3_18","title":"MedPromptX: Grounded Multimodal Prompting for Chest X-Ray Diagnosis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.0328547016601778,"score_gpt":0.3143221696737747,"score_spread":0.2814674680135969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409378014","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.007123876,0.0018156919,0.913017,0.00065921276,0.0005279464,0.00026157135,0.0030895944,0.035245493,0.03825966],"genre_scores_gemma":[0.13710067,0.0021328486,0.793099,0.0011446535,0.0002389011,0.0004309169,0.004425953,0.0025643879,0.05886276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978346,0.00004902053,0.000011886853,0.000049972554,0.0000882867,0.000017375118],"domain_scores_gemma":[0.9996008,0.00028185017,0.000012970598,0.0000318532,0.000046143614,0.000026416803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689234,0.0007548188,0.0003349335,0.00035925425,0.00020657526,0.0008015296,0.0011610797,0.0008180688,0.03997135],"category_scores_gemma":[0.0016669194,0.00028393345,0.00035218635,0.00025691505,0.0002829633,0.0008861844,0.0013191213,0.0009053641,0.0081476895],"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.0005129962,0.00010820963,0.00049919804,0.00055532897,0.000043303895,0.0005393977,0.00032545684,0.011908827,0.027957955,0.015640711,0.09993826,0.8419704],"study_design_scores_gemma":[0.00028158468,0.000503537,0.0026438022,0.00067750557,0.00013474056,0.0031571316,0.00041959714,0.352925,0.0736721,0.11085464,0.45457977,0.00015061242],"about_ca_topic_score_codex":0.0012000598,"about_ca_topic_score_gemma":0.0022041763,"teacher_disagreement_score":0.03997135,"about_ca_system_score_codex":0.00034388143,"about_ca_system_score_gemma":0.0003911311,"threshold_uncertainty_score":0.13371748},"labels":[],"label_agreement":null},{"id":"W4409407626","doi":"10.1007/978-3-031-88036-0_8","title":"GERA: A Corpus of Russian School Texts Annotated for Grammatical Error Correction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Error analysis; Linguistics; Mathematics; Philosophy","score_opus":0.011770450229882962,"score_gpt":0.2758623785684261,"score_spread":0.2640919283385431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409407626","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.254973,0.005541711,0.023770541,0.0012363618,0.0011480727,0.0006732851,0.6339568,0.016841406,0.06185888],"genre_scores_gemma":[0.21249434,0.0014310207,0.041862432,0.00022463176,0.00023576728,0.000512771,0.7206328,0.0037384292,0.01886793],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978448,0.0007577615,0.0002541882,0.0006086729,0.00041561082,0.00011896575],"domain_scores_gemma":[0.99514246,0.0023420283,0.00036746688,0.0008917859,0.0010903977,0.00016578754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001518273,0.0011581326,0.00085431826,0.0055306074,0.0017907064,0.0011482489,0.0009965346,0.0011710637,0.01622104],"category_scores_gemma":[0.0053988104,0.00065545796,0.0005040997,0.0042557972,0.0009178835,0.0014244885,0.001531601,0.0009750792,0.015496394],"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.0015566107,0.0006807077,0.015213613,0.008754805,0.00029749644,0.003258895,0.015355512,0.003891631,0.08316336,0.009983946,0.5781515,0.27969185],"study_design_scores_gemma":[0.00026330948,0.00023117887,0.08876015,0.00070022006,0.00026665427,0.0026557518,0.003907891,0.0051838285,0.026698412,0.0029124462,0.8682514,0.00016874097],"about_ca_topic_score_codex":0.005445157,"about_ca_topic_score_gemma":0.010840602,"teacher_disagreement_score":0.01622104,"about_ca_system_score_codex":0.0007442715,"about_ca_system_score_gemma":0.0017833564,"threshold_uncertainty_score":0.054264784},"labels":[],"label_agreement":null},{"id":"W4409506071","doi":"10.1007/978-3-031-85356-2_7","title":"Formal Security Analysis of Deep Neural Network Architecture","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Computer science; Architecture; Artificial neural network; Artificial intelligence","score_opus":0.007615077404231362,"score_gpt":0.24450752785780794,"score_spread":0.23689245045357657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409506071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025500996,0.0005472101,0.94301754,0.0028609675,0.00022991268,0.00009002059,0.00028143177,0.00048721652,0.026984774],"genre_scores_gemma":[0.869774,0.00095167564,0.110441975,0.0008825516,0.00052657287,0.00033575087,0.00047106284,0.00032863574,0.016287837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997598,0.000661621,0.0001356822,0.00033903655,0.0009222089,0.00034336507],"domain_scores_gemma":[0.99219006,0.0052141002,0.0003733759,0.0011057752,0.00097637676,0.00014023967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003213347,0.00077082444,0.00061418477,0.0011319817,0.00070610107,0.0028078584,0.0017456432,0.0016030715,0.007760419],"category_scores_gemma":[0.011190624,0.00069735124,0.0017381014,0.0006486736,0.0041695395,0.0053567397,0.0025554674,0.0050147143,0.0008611411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003003056,0.000022565348,0.00013384753,0.000055258042,0.000017961795,0.000049243747,0.00006263319,0.031380598,0.00093999476,0.9596675,0.0011746037,0.0064658397],"study_design_scores_gemma":[0.000010333676,0.000012674325,0.000057642945,0.000024477627,0.000012445384,0.00002910374,0.000015245932,0.11656533,0.0007791596,0.880891,0.0015938327,0.000008637091],"about_ca_topic_score_codex":0.0017325991,"about_ca_topic_score_gemma":0.0016119413,"teacher_disagreement_score":0.007760419,"about_ca_system_score_codex":0.003181697,"about_ca_system_score_gemma":0.0018187359,"threshold_uncertainty_score":0.02596116},"labels":[],"label_agreement":null},{"id":"W4409506451","doi":"10.1007/978-3-031-85356-2_5","title":"A High Parallelization Method for Automated Formal Verification of Deep Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial neural network; Deep neural networks; Formal methods; Parallel computing; Formal verification; Artificial intelligence; Programming language","score_opus":0.011528144961753521,"score_gpt":0.28066513109541125,"score_spread":0.2691369861336577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409506451","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.0017932083,0.00005615516,0.98947453,0.00013311964,0.00007095185,0.00010228288,0.00013896203,0.006744676,0.0014861252],"genre_scores_gemma":[0.15241995,0.00014584484,0.8354744,0.00039994673,0.00016226468,0.00066537276,0.0010570296,0.004109267,0.0055659837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475324,0.0012941754,0.00049018965,0.0011677938,0.0017003034,0.0005943025],"domain_scores_gemma":[0.9874199,0.0065027904,0.00041837044,0.0040706564,0.0014205859,0.00016772533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029752972,0.001971114,0.0013070742,0.0014372646,0.0011181607,0.002613004,0.0035990977,0.0012901587,0.025360065],"category_scores_gemma":[0.014943857,0.0015188667,0.004186009,0.00092167815,0.0025568826,0.0047526234,0.0059070773,0.004788211,0.0055891355],"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.00067883485,0.00032759976,0.0017749628,0.0010553731,0.00036025222,0.0006140153,0.00048770435,0.12676342,0.041431326,0.32599047,0.024525912,0.47599012],"study_design_scores_gemma":[0.00017743521,0.00012461955,0.00029746053,0.0001042681,0.00012568718,0.00020755379,0.000076900295,0.5665171,0.039413147,0.37557364,0.01730494,0.00007726507],"about_ca_topic_score_codex":0.0025207526,"about_ca_topic_score_gemma":0.0046880995,"teacher_disagreement_score":0.025360065,"about_ca_system_score_codex":0.001732688,"about_ca_system_score_gemma":0.0030796388,"threshold_uncertainty_score":0.08483791},"labels":[],"label_agreement":null},{"id":"W4409507033","doi":"10.1007/978-3-031-85356-2_1","title":"Formal Verification of Coupled Transmission Lines using Theorem Proving","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Power Systems and Technologies","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":"Concordia University","funders":"","keywords":"Computer science; Automated theorem proving; Formal verification; Theoretical computer science; Programming language; Calculus (dental); Algorithm","score_opus":0.01228641646226206,"score_gpt":0.2226579524317258,"score_spread":0.21037153596946373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409507033","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.0053558485,0.00006175868,0.9898948,0.00005439752,0.00003828541,0.00007053607,0.000053920536,0.0012720594,0.0031984113],"genre_scores_gemma":[0.40509346,0.00028665335,0.58905536,0.00013152759,0.000058379992,0.00028844064,0.0002709243,0.00066049024,0.0041548167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564004,0.0016858965,0.0002975154,0.00064485444,0.001395131,0.00033655763],"domain_scores_gemma":[0.9886818,0.00872769,0.00054604246,0.0011908701,0.00076203904,0.00009157021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030559944,0.0011206901,0.00088891713,0.0007322322,0.000835567,0.0024307498,0.003319628,0.0012295522,0.008864665],"category_scores_gemma":[0.011410881,0.0010326948,0.0019873967,0.00055854727,0.00302512,0.0037190327,0.002505808,0.0019201932,0.0013652198],"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.00034409916,0.00020964547,0.00078061584,0.0012187827,0.00018117798,0.00089920464,0.00063518266,0.3331009,0.035726465,0.52580494,0.0032584914,0.09784053],"study_design_scores_gemma":[0.00015599364,0.00010523859,0.00014381009,0.00015111912,0.000101791426,0.00023791795,0.00007006418,0.7470012,0.03844966,0.20180513,0.0117353005,0.00004279867],"about_ca_topic_score_codex":0.0022372738,"about_ca_topic_score_gemma":0.0017357134,"teacher_disagreement_score":0.008864665,"about_ca_system_score_codex":0.0009927853,"about_ca_system_score_gemma":0.0015278785,"threshold_uncertainty_score":0.029655278},"labels":[],"label_agreement":null},{"id":"W4409507036","doi":"10.1007/978-3-031-85356-2_10","title":"A Formal Approach for Verifying and Validating Security Objectives in Software Architecture","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Computer science; Formal methods; Software engineering; Software architecture; Formal verification; Programming language; Architecture; Software architecture description; Software; Reference architecture","score_opus":0.01241941353452653,"score_gpt":0.24165330502220964,"score_spread":0.2292338914876831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409507036","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.0011526786,0.00007201895,0.99663323,0.00017608276,0.00003104825,0.00008172764,0.000030001731,0.00048832066,0.0013349301],"genre_scores_gemma":[0.056951195,0.00024889052,0.93907785,0.00017846245,0.00007631604,0.00024122995,0.00013996806,0.0002138906,0.0028722174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917489,0.0027704032,0.000938664,0.0008740212,0.0031246606,0.0005432045],"domain_scores_gemma":[0.98683715,0.007858077,0.00073355186,0.002837841,0.001450142,0.0002832413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006903759,0.0016345816,0.0010168125,0.0022499315,0.0018768812,0.0058117053,0.004152133,0.0025262476,0.0036522904],"category_scores_gemma":[0.01675862,0.002378884,0.0032433805,0.001366235,0.007459263,0.009140456,0.004912806,0.0062529817,0.0011928384],"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.000057381247,0.00018358267,0.0005612548,0.000404907,0.000087708984,0.00039026912,0.00085276645,0.050922517,0.008287526,0.8508462,0.0029128974,0.08449299],"study_design_scores_gemma":[0.00006950936,0.00012448807,0.00020416362,0.00027075416,0.0001433233,0.00040745764,0.00023640081,0.26676533,0.012376399,0.6905605,0.028765252,0.00007640374],"about_ca_topic_score_codex":0.0066302223,"about_ca_topic_score_gemma":0.007972446,"teacher_disagreement_score":0.006903759,"about_ca_system_score_codex":0.0025479938,"about_ca_system_score_gemma":0.0054733115,"threshold_uncertainty_score":0.036510944},"labels":[],"label_agreement":null},{"id":"W4409586720","doi":"10.1007/978-3-031-84543-7_28","title":"Integrating AI, IoT, and Drones for Sustainable Apple Orchard Monitoring in Society 5.0","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Heritage College","funders":"","keywords":"Drone; Computer science; Orchard; Internet of Things; Artificial intelligence; Computer security; Horticulture; Botany","score_opus":0.011543167765826867,"score_gpt":0.2288789183336334,"score_spread":0.21733575056780655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409586720","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.058471516,0.03495736,0.6631397,0.003327725,0.0010874202,0.0002719375,0.0009356437,0.006624272,0.2311844],"genre_scores_gemma":[0.33315903,0.025421385,0.51311344,0.0013589733,0.00040675706,0.00014864285,0.0022678997,0.00032835492,0.12379555],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999008,0.000017296046,0.0000057863595,0.000025638607,0.000038478494,0.000011936029],"domain_scores_gemma":[0.9999255,0.000028006354,0.0000045676798,0.000011448483,0.000019825775,0.000010776251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020224202,0.00037702764,0.00018111597,0.0004612243,0.00014245835,0.0009723808,0.0005300842,0.00046452775,0.0034693172],"category_scores_gemma":[0.00019549027,0.00015839271,0.00028009506,0.00064279756,0.00019391783,0.0013318076,0.00069120945,0.0005394969,0.0015185045],"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.00006142083,0.00007416352,0.0033357737,0.00052202336,0.000046048826,0.00040145483,0.0004129365,0.009118729,0.024022028,0.047479477,0.028318215,0.8862079],"study_design_scores_gemma":[0.000010394008,0.00020827047,0.007625966,0.00042072072,0.00007463807,0.0011989975,0.0005540907,0.13012078,0.016272478,0.03857017,0.8048818,0.00006157697],"about_ca_topic_score_codex":0.0021739192,"about_ca_topic_score_gemma":0.0035760168,"teacher_disagreement_score":0.0034693172,"about_ca_system_score_codex":0.00033864935,"about_ca_system_score_gemma":0.00027608787,"threshold_uncertainty_score":0.011606038},"labels":[],"label_agreement":null},{"id":"W4409597230","doi":"10.1007/978-3-031-86054-6_8","title":"Negation, Disjunction, and Choice Questions","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Syntax, Semantics, Linguistic Variation","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Negation; Computer science; Programming language; Negation as failure; Natural language processing; Artificial intelligence; Semantics (computer science); Stable model semantics","score_opus":0.017621418293883088,"score_gpt":0.23797360710020088,"score_spread":0.2203521888063178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409597230","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14527138,0.03676855,0.20377503,0.031021617,0.0009347942,0.00009213295,0.0007638523,0.00024580525,0.58112687],"genre_scores_gemma":[0.9421254,0.005500391,0.02126324,0.0015800395,0.0009973014,0.00012308576,0.00059166475,0.00009948501,0.027719473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975114,0.0015103834,0.00014263362,0.00037422424,0.00032790957,0.00013347983],"domain_scores_gemma":[0.9926523,0.006533507,0.00021044166,0.00025120768,0.00024781362,0.0001047518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00397892,0.00056035677,0.0010177162,0.0012932097,0.002098261,0.005172953,0.0012934566,0.002794649,0.00902624],"category_scores_gemma":[0.009069117,0.00060158793,0.0008934788,0.0021685027,0.008866656,0.016789472,0.0024977683,0.0032386035,0.0007495657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003221355,0.000015223876,0.00013548257,0.000041778734,0.0000063188863,0.000056390396,0.0003715075,0.000309997,0.000120018645,0.99188226,0.0018023353,0.0052265124],"study_design_scores_gemma":[0.0000065654967,0.0000023040598,0.000047284062,0.00000868233,0.0000022710922,0.000026008382,0.000099302626,0.00045638712,0.00003390373,0.9969273,0.0023869001,0.0000030616748],"about_ca_topic_score_codex":0.0016381651,"about_ca_topic_score_gemma":0.0013665467,"teacher_disagreement_score":0.00902624,"about_ca_system_score_codex":0.0021589953,"about_ca_system_score_gemma":0.0006640545,"threshold_uncertainty_score":0.030195773},"labels":[],"label_agreement":null},{"id":"W4409602065","doi":"10.1007/978-3-031-85859-8_13","title":"Cross Language Soccer Framework: An Open Source Framework for the RoboCup 2D Soccer Simulation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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; Pleiades Robotics (Canada)","funders":"","keywords":"Computer science; Open source; Artificial intelligence; Human–computer interaction; Programming language","score_opus":0.037695864528258786,"score_gpt":0.36416690756772285,"score_spread":0.32647104303946406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409602065","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052530663,0.0004959065,0.7770982,0.00015128721,0.0002421855,0.00033641414,0.0038474388,0.18777616,0.024799393],"genre_scores_gemma":[0.14112237,0.0016165798,0.54770505,0.00093812594,0.00015866378,0.0018392882,0.030230273,0.19940424,0.0769854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995085,0.00005899456,0.000033169224,0.00006909105,0.0002631965,0.00006702694],"domain_scores_gemma":[0.99954283,0.0001298884,0.000028477454,0.000075543896,0.00015721413,0.00006612221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133305,0.0018324605,0.00091029325,0.0010995384,0.00056672527,0.001519726,0.0036416415,0.0013578488,0.053966254],"category_scores_gemma":[0.0016240459,0.0015821839,0.0015902058,0.00062345364,0.00047128645,0.0014006877,0.0026754797,0.0021967879,0.017954433],"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.0007939022,0.00062170124,0.0032667213,0.0018838479,0.0004899294,0.0008751646,0.0010053308,0.18042965,0.042427994,0.048592377,0.34555632,0.37405708],"study_design_scores_gemma":[0.00028224714,0.00020134279,0.0017448213,0.00029218974,0.00012770352,0.0007438364,0.000126786,0.44908437,0.029156903,0.02105844,0.49694368,0.00023779452],"about_ca_topic_score_codex":0.0050967513,"about_ca_topic_score_gemma":0.0074564177,"teacher_disagreement_score":0.053966254,"about_ca_system_score_codex":0.00065797433,"about_ca_system_score_gemma":0.0012638338,"threshold_uncertainty_score":0.18053508},"labels":[],"label_agreement":null},{"id":"W4409602093","doi":"10.1007/978-3-031-85859-8_26","title":"Event-Based Vision for Robot Soccer","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning 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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Event (particle physics); Machine vision; Robot vision; Robot; Computer graphics (images); Mobile robot","score_opus":0.017522709072272928,"score_gpt":0.2865013538051415,"score_spread":0.2689786447328686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409602093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037376732,0.0036211263,0.9803821,0.0001398928,0.0003281894,0.000030391124,0.00014101998,0.0016971343,0.009922402],"genre_scores_gemma":[0.41457686,0.010685408,0.5100313,0.00038925826,0.0005785819,0.00013063411,0.0012546311,0.00057472294,0.061778676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989736,0.000013171538,0.000004561918,0.000030155328,0.000039249106,0.000015562713],"domain_scores_gemma":[0.9999442,0.000021284513,0.0000042572683,0.00000925174,0.000015863594,0.000005126027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014254748,0.0005091359,0.0005385045,0.0003398518,0.0001632454,0.00075869355,0.00088060246,0.0006073794,0.008656311],"category_scores_gemma":[0.00022686894,0.0002961979,0.0004008099,0.00063853076,0.0002795844,0.0008153264,0.0005268669,0.0009016671,0.0020842399],"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.00020118646,0.0001361537,0.00011513395,0.00030755837,0.000048452977,0.0000994366,0.000033362594,0.11531721,0.034847856,0.03562846,0.022530656,0.7907346],"study_design_scores_gemma":[0.00001984955,0.00008876298,0.00061076635,0.000041625946,0.000020488804,0.00021269651,0.00002453033,0.90213025,0.01348794,0.049065076,0.03427106,0.000027022199],"about_ca_topic_score_codex":0.002004445,"about_ca_topic_score_gemma":0.0018829394,"teacher_disagreement_score":0.008656311,"about_ca_system_score_codex":0.00031136803,"about_ca_system_score_gemma":0.00023014394,"threshold_uncertainty_score":0.028958261},"labels":[],"label_agreement":null},{"id":"W4409637105","doi":"10.1007/978-3-031-90167-6_14","title":"Balancing Indeterminacy and Structure: Neural Text Generation for Artistic Inspiration","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Creativity in Education and Neuroscience","field":"Psychology","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":"Indeterminacy (philosophy); Computer science; Artificial intelligence; Cognitive science; Natural language processing; Epistemology; Philosophy; Psychology","score_opus":0.032155144705514414,"score_gpt":0.325891189731778,"score_spread":0.2937360450262636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409637105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10479913,0.0018444194,0.85698885,0.00079110824,0.00024411544,0.00006745307,0.00012106392,0.0017437852,0.033400077],"genre_scores_gemma":[0.83901966,0.00055696006,0.14911231,0.000098516284,0.00008936683,0.000060765295,0.00016674155,0.000276227,0.010619464],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998697,0.00003385747,0.000008789127,0.00004253333,0.0000330579,0.000012008135],"domain_scores_gemma":[0.99943584,0.00039894794,0.000033988847,0.000063679036,0.000045895777,0.000021682274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004188464,0.00032894817,0.00023692625,0.00028171696,0.0002848211,0.0013057006,0.0008730981,0.00054622383,0.0063449317],"category_scores_gemma":[0.0024995592,0.00023774088,0.00028707652,0.0003263076,0.00075110915,0.0018052765,0.0010403086,0.00077510515,0.00075202476],"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.0002647421,0.00007114484,0.00051238993,0.000253777,0.00003300878,0.00017030584,0.0004734932,0.04736196,0.05432693,0.093182825,0.0055086426,0.7978408],"study_design_scores_gemma":[0.000037878493,0.00007831821,0.0006082336,0.00005245094,0.00002755664,0.00015735561,0.00010479774,0.7311641,0.026328582,0.23382603,0.0075900652,0.000024574025],"about_ca_topic_score_codex":0.00026091703,"about_ca_topic_score_gemma":0.00043555498,"teacher_disagreement_score":0.0063449317,"about_ca_system_score_codex":0.00028767105,"about_ca_system_score_gemma":0.00020255832,"threshold_uncertainty_score":0.02122593},"labels":[],"label_agreement":null},{"id":"W4409637115","doi":"10.1007/978-3-031-90167-6_16","title":"Future Sight: Fine-Tuning Language Models for Dynamic Story Generation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sight; Programming language; Astronomy; Physics","score_opus":0.018607415969301735,"score_gpt":0.2512150235771715,"score_spread":0.23260760760786978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409637115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012926329,0.00052010105,0.9177709,0.00039207598,0.0003778632,0.00012523484,0.0013629085,0.061424393,0.0051002316],"genre_scores_gemma":[0.27580526,0.00040838163,0.69427896,0.00054089905,0.00020273292,0.00038045467,0.0061240685,0.007149581,0.015109675],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928004,0.00019856135,0.00004400491,0.00026855693,0.00014218634,0.00006670759],"domain_scores_gemma":[0.9982262,0.0010185343,0.000053746102,0.00034293806,0.00024790235,0.00011060309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012152513,0.0012688537,0.00088711036,0.0006178375,0.00046642774,0.0020300644,0.0030361156,0.0016991291,0.022982918],"category_scores_gemma":[0.0060158265,0.0008544661,0.0010860059,0.00047452038,0.00049473287,0.0047228676,0.0022253203,0.0024293037,0.009167928],"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.0010374135,0.00038355135,0.0011382138,0.00042275636,0.00016879005,0.00020327778,0.00045694868,0.10449736,0.029244246,0.021437846,0.07782082,0.7631888],"study_design_scores_gemma":[0.000073540315,0.000048498267,0.0001106147,0.00001506968,0.000030358067,0.000056265846,0.00006579838,0.9677559,0.0073930095,0.015323983,0.009107485,0.000019417048],"about_ca_topic_score_codex":0.004048639,"about_ca_topic_score_gemma":0.0070475964,"teacher_disagreement_score":0.022982918,"about_ca_system_score_codex":0.0008411955,"about_ca_system_score_gemma":0.0008112951,"threshold_uncertainty_score":0.07688552},"labels":[],"label_agreement":null},{"id":"W4409637139","doi":"10.1007/978-3-031-90167-6_12","title":"Towards Human-Quality Drum Accompaniment Using Deep Generative Models and Transformers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Balance, Gait, and Falls Prevention","field":"Health Professions","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":"Computer science; Transformer; Generative grammar; Drum; Artificial intelligence; Electrical engineering; Voltage; Mechanical engineering; Engineering","score_opus":0.07822942560892267,"score_gpt":0.4014520319203767,"score_spread":0.32322260631145405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409637139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041887546,0.00018869225,0.9925081,0.000048612925,0.000036702102,0.00001672128,0.00006461378,0.0015236171,0.001424112],"genre_scores_gemma":[0.3766704,0.0007494633,0.6043081,0.00020810336,0.00009979672,0.00011138111,0.00080061966,0.0010061115,0.016045917],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970764,0.00007831557,0.000012816406,0.000078148456,0.00008875604,0.000034166325],"domain_scores_gemma":[0.9994068,0.00036340012,0.000026020358,0.00009257812,0.00008024762,0.000030930485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007049734,0.00095041527,0.00082567637,0.0004118414,0.0002929296,0.0013040862,0.0011626845,0.001031742,0.0077408142],"category_scores_gemma":[0.0018638656,0.0006134458,0.001066663,0.0005828606,0.000626581,0.0015615595,0.0019072591,0.0016027626,0.0030644624],"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.00045857523,0.00009762476,0.00045724618,0.00025802906,0.000119732525,0.000237749,0.00028034285,0.3949219,0.04129771,0.043537922,0.0056666518,0.51266664],"study_design_scores_gemma":[0.000011372475,0.000037180744,0.000044833014,0.000012233717,0.000011207312,0.000040412506,0.000020205953,0.9836639,0.0048027025,0.009419966,0.0019279848,0.000008106237],"about_ca_topic_score_codex":0.003105462,"about_ca_topic_score_gemma":0.0052318485,"teacher_disagreement_score":0.0077408142,"about_ca_system_score_codex":0.00041798822,"about_ca_system_score_gemma":0.00049499754,"threshold_uncertainty_score":0.025895655},"labels":[],"label_agreement":null},{"id":"W4409694726","doi":"10.1007/978-3-031-90065-5","title":"Applications of Evolutionary Computation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Information and Communications Technology; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Sorbonne Université; Région Normandie; Universität Konstanz; University of South Africa; Universidad de Granada; Syddansk Universitet; Technische Universität Berlin; Universidade de Lisboa; Universidade de Coimbra; Universitat Oberta de Catalunya; Universitetet i Oslo; Hong Kong Baptist University; Università degli Studi di Milano-Bicocca; Universidad Complutense de Madrid; University of Waterloo; University of Twente; Universidad de Extremadura; Università degli Studi di Torino; Università degli Studi di Trento; Università degli Studi di Parma; Heriot-Watt University; Queensland University of Technology; Iran Telecommunication Research Center; Swansea University; Edinburgh Napier University; Technische Universität Darmstadt; Cardiff University; Pomona College; Université de Lille; Universidad de Málaga; Carl von Ossietzky Universität Oldenburg; Università Degli Studi di Modena e Reggio Emila; Universiteit Leiden; Institut \"Jožef Stefan\"; Yeditepe Üniversitesi; Massachusetts Institute of Technology; University of North Carolina Wilmington; Eötvös Loránd Tudományegyetem; Silesian University of Technology; Université du Luxembourg; Sveučilište u Zagrebu; Aberystwyth University","keywords":"Computer science; Evolutionary computation; Computation; Artificial intelligence; Algorithm","score_opus":0.008527978703050977,"score_gpt":0.2561397067334402,"score_spread":0.24761172803038925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409694726","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056872964,0.09953815,0.44748417,0.0027351496,0.0029640172,0.00007156117,0.00021254722,0.00089021144,0.44041684],"genre_scores_gemma":[0.26391914,0.09266819,0.3667829,0.001217681,0.0031080712,0.000231595,0.000660267,0.00069493416,0.2707173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996495,0.00008903334,0.000015324476,0.0000576815,0.00016778617,0.000020630621],"domain_scores_gemma":[0.9995578,0.00025849178,0.000016627326,0.00007980986,0.00006552752,0.000021698805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043022048,0.0008053431,0.00089388154,0.0012892828,0.00047936596,0.0018758096,0.00085530063,0.0011101015,0.019173779],"category_scores_gemma":[0.0016880431,0.00039115554,0.00072092906,0.0015404021,0.0010496875,0.0014074516,0.001417219,0.0014473529,0.0042925673],"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.00003661564,0.000039192182,0.00041974697,0.00049770356,0.000076421275,0.0001893363,0.00014232645,0.023951078,0.0030444786,0.5017631,0.035894178,0.4339458],"study_design_scores_gemma":[0.000016428537,0.000039558934,0.0006934495,0.00020269855,0.000027701579,0.0005823048,0.000060762843,0.06775698,0.0017398923,0.62561417,0.3032394,0.000026680136],"about_ca_topic_score_codex":0.0004965426,"about_ca_topic_score_gemma":0.00055739057,"teacher_disagreement_score":0.019173779,"about_ca_system_score_codex":0.00057409686,"about_ca_system_score_gemma":0.00035084056,"threshold_uncertainty_score":0.064142644},"labels":[],"label_agreement":null},{"id":"W4409739042","doi":"10.1007/978-3-031-90252-9_17","title":"Learning a CoNCISE Language for Small-Molecule Binding","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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 Guelph","funders":"","keywords":"Computer science; Natural language processing; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.02057067749407573,"score_gpt":0.2997330538789428,"score_spread":0.2791623763848671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409739042","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.0019967237,0.00022326923,0.991,0.000448614,0.00010421813,0.000066761015,0.00081127207,0.0026635847,0.002685552],"genre_scores_gemma":[0.049327858,0.00065696094,0.9330485,0.00045925853,0.00016069086,0.00041656097,0.0036277508,0.0008215317,0.011480927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998922,0.00034715133,0.00013085228,0.00019984542,0.000332348,0.00006786015],"domain_scores_gemma":[0.99691087,0.0020234375,0.00018764411,0.0003866132,0.00040438198,0.000087065935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001604455,0.0012145211,0.000774237,0.00086369505,0.0006135543,0.0016432672,0.0024395403,0.0010128205,0.016190555],"category_scores_gemma":[0.007804545,0.00072281953,0.0011699141,0.0010294047,0.0010393278,0.003487114,0.0021814445,0.0024883386,0.009051358],"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.00021654468,0.00014622802,0.00051593705,0.000880698,0.000059934762,0.00023117721,0.00042790963,0.082741745,0.011255236,0.29190162,0.0715699,0.54005307],"study_design_scores_gemma":[0.00004441458,0.00017262099,0.00013647764,0.00020640029,0.000058469403,0.0003004927,0.0001675762,0.4654254,0.015985202,0.4121955,0.10525426,0.000053080697],"about_ca_topic_score_codex":0.0010200115,"about_ca_topic_score_gemma":0.0021277384,"teacher_disagreement_score":0.016190555,"about_ca_system_score_codex":0.00066332554,"about_ca_system_score_gemma":0.0015005914,"threshold_uncertainty_score":0.0541628},"labels":[],"label_agreement":null},{"id":"W4409739192","doi":"10.1007/978-3-031-90252-9_27","title":"Learning Multi-cellular Representations of Single-Cell Transcriptomics Data Enables Characterization of Patient-Level Disease States","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Single-cell and spatial transcriptomics","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":"Roche (Canada)","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.028920452725228224,"score_gpt":0.24159974237941076,"score_spread":0.21267928965418254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409739192","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.12142058,0.0019522515,0.867136,0.00074264297,0.00013613343,0.000041988533,0.0043250886,0.0020478796,0.0021974458],"genre_scores_gemma":[0.76318616,0.002259255,0.22495806,0.00026795932,0.0001609154,0.00010552737,0.005813737,0.00018564326,0.0030627127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998406,0.000028668426,0.000008194896,0.00007573516,0.000025575257,0.000021082882],"domain_scores_gemma":[0.9996716,0.0001973079,0.000047085596,0.00004434898,0.000022650984,0.000017073906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035956656,0.0006045123,0.00064393046,0.0005443191,0.00013397854,0.0012238433,0.00046998478,0.00071871676,0.0010953795],"category_scores_gemma":[0.0009027094,0.00023278956,0.0009250071,0.0010461869,0.0003002961,0.00075083255,0.00053622836,0.00079085527,0.00062698126],"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.0004829557,0.00022154572,0.01157778,0.00032730534,0.00035148644,0.0004167569,0.00017010282,0.28486776,0.17378114,0.00891284,0.006860405,0.5120299],"study_design_scores_gemma":[0.000008143226,0.000074033815,0.00690026,0.000017684404,0.00006522754,0.00020782277,0.000056816665,0.95872164,0.01479421,0.016780969,0.0023470507,0.000026250409],"about_ca_topic_score_codex":0.0012958532,"about_ca_topic_score_gemma":0.0022002805,"teacher_disagreement_score":0.0012958532,"about_ca_system_score_codex":0.00039174774,"about_ca_system_score_gemma":0.000290575,"threshold_uncertainty_score":0.003664434},"labels":[],"label_agreement":null},{"id":"W4409739468","doi":"10.1007/978-3-031-90252-9_36","title":"Integration and Querying of Multimodal Single-Cell Data with PoE-VAE","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Single-cell and spatial transcriptomics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre; University of British Columbia","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.019039826567870507,"score_gpt":0.23528886096008556,"score_spread":0.21624903439221504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409739468","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.011184299,0.0005275223,0.8577044,0.0002839507,0.00019506473,0.00017784438,0.007402766,0.11626143,0.006262741],"genre_scores_gemma":[0.26244658,0.0010058855,0.67067397,0.00046185055,0.00013788513,0.0006803456,0.04165238,0.0124789765,0.010462235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910885,0.00013008656,0.0001109665,0.00022415849,0.0003382324,0.00008764588],"domain_scores_gemma":[0.99789655,0.0008596606,0.00007173854,0.0007982863,0.0002723975,0.0001012977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018147368,0.0010676947,0.0015089213,0.0022016326,0.0006373054,0.004612461,0.0025610072,0.0012387566,0.0131710265],"category_scores_gemma":[0.006561697,0.0006828763,0.0014776264,0.0024299014,0.0007651454,0.0038563854,0.0036715216,0.0009822939,0.005475459],"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.0027165615,0.0004570509,0.009486404,0.0019031115,0.0008519564,0.0018280745,0.0018163756,0.063105755,0.078995846,0.07298856,0.14644606,0.6194042],"study_design_scores_gemma":[0.00016318905,0.00013539147,0.0026909853,0.0001614174,0.00011761993,0.0009311343,0.0004592667,0.663575,0.090631194,0.08478865,0.15612267,0.00022352934],"about_ca_topic_score_codex":0.0022519275,"about_ca_topic_score_gemma":0.0024929151,"teacher_disagreement_score":0.0131710265,"about_ca_system_score_codex":0.00062608527,"about_ca_system_score_gemma":0.0005070062,"threshold_uncertainty_score":0.044061422},"labels":[],"label_agreement":null},{"id":"W4409784898","doi":"10.1007/978-981-96-5812-1_8","title":"MTScan: Material Transfer from Partial Scans to CAD Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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":"Carleton University","funders":"","keywords":"Computer science; CAD; Engineering drawing; Computer graphics (images); Engineering","score_opus":0.010681095272509118,"score_gpt":0.20203482321288643,"score_spread":0.1913537279403773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409784898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005222491,0.00030301782,0.9500063,0.00011340055,0.0001425697,0.00012784803,0.001242562,0.024170954,0.018670822],"genre_scores_gemma":[0.09996203,0.0008445319,0.84630746,0.00016944371,0.000090753965,0.00036214828,0.005583293,0.010725737,0.035954528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934274,0.00004058254,0.000020685118,0.000078528145,0.00048485902,0.000032599844],"domain_scores_gemma":[0.9994791,0.00019236379,0.000022649065,0.00017574472,0.00011494227,0.0000151331515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040691838,0.0014464615,0.00091743324,0.0015863903,0.0004600105,0.0017783551,0.0025316868,0.0008737435,0.0498925],"category_scores_gemma":[0.0016599772,0.0013117159,0.0011491533,0.0016923436,0.0006488428,0.0013662747,0.0026428767,0.0013090838,0.011947839],"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.00026316568,0.00009418085,0.00042454377,0.00045180775,0.00010460422,0.00030767242,0.00018388612,0.06261574,0.0465938,0.020757267,0.061095275,0.8071081],"study_design_scores_gemma":[0.00007312355,0.00013982285,0.0012436683,0.00010608814,0.000062467494,0.0010945507,0.00014031897,0.72710085,0.08145731,0.039230898,0.1492781,0.00007292006],"about_ca_topic_score_codex":0.0019785601,"about_ca_topic_score_gemma":0.00315646,"teacher_disagreement_score":0.0498925,"about_ca_system_score_codex":0.0004989771,"about_ca_system_score_gemma":0.0007485054,"threshold_uncertainty_score":0.16690701},"labels":[],"label_agreement":null},{"id":"W4409784910","doi":"10.1007/978-981-96-5815-2_6","title":"Training-Free Language-Guided Video Summarization via Multi-Grained Saliency Scoring","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Automatic summarization; Computer science; Natural language processing; Artificial intelligence; Speech recognition; Information retrieval","score_opus":0.025595787442517382,"score_gpt":0.2684903032608774,"score_spread":0.24289451581836002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409784910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02495233,0.0014322953,0.95201904,0.0002724851,0.00037800628,0.0003872528,0.0010260674,0.016060838,0.0034717508],"genre_scores_gemma":[0.27285582,0.0007783214,0.70273423,0.00037523085,0.00045527593,0.00042664522,0.0071267965,0.0019759685,0.013271815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911445,0.00016530333,0.00006367714,0.00032449813,0.0001941466,0.00013790342],"domain_scores_gemma":[0.9980483,0.00069273514,0.000123741,0.0002509727,0.000734804,0.0001494238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976949,0.002560005,0.0016679276,0.0016949049,0.0006144315,0.001208022,0.0019490153,0.0013543409,0.008459794],"category_scores_gemma":[0.0040492658,0.00052700954,0.0009833955,0.001230169,0.00039085603,0.0018051689,0.0019058326,0.0016836671,0.0060905926],"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.00060030655,0.00020802165,0.00060114637,0.00040726448,0.00013770939,0.00022814222,0.0001266407,0.015349602,0.12339782,0.0015511031,0.018619033,0.83877325],"study_design_scores_gemma":[0.00010474627,0.00054331357,0.0025039853,0.000061370665,0.00020540267,0.00035402473,0.0001924533,0.894341,0.08492011,0.0056644822,0.011042935,0.00006615847],"about_ca_topic_score_codex":0.004128571,"about_ca_topic_score_gemma":0.010804023,"teacher_disagreement_score":0.008459794,"about_ca_system_score_codex":0.00053997093,"about_ca_system_score_gemma":0.0009836602,"threshold_uncertainty_score":0.028300881},"labels":[],"label_agreement":null},{"id":"W4409797540","doi":"10.1007/978-3-031-86651-7_18","title":"A Novel Multimodal Deep Learning Fusion Framework for Predicting Neovascular Activity Evolution in Exudative Age-Related Macular Degeneration","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Macular degeneration; Computer science; Artificial intelligence; Deep learning; Ophthalmology; Medicine","score_opus":0.012576295798876697,"score_gpt":0.27644739153822456,"score_spread":0.26387109573934786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409797540","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.13429588,0.006183975,0.85167354,0.00061553234,0.00031742686,0.000093333336,0.0012571706,0.002484951,0.00307818],"genre_scores_gemma":[0.804332,0.0020677017,0.18125096,0.00045159284,0.00028908174,0.000120444805,0.0020169006,0.0001202326,0.009351013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981254,0.00002679077,0.0000104532655,0.000050047212,0.000052093903,0.00004806017],"domain_scores_gemma":[0.9998418,0.000045424225,0.000014507562,0.000013248825,0.00006579295,0.000019140343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065644697,0.00074756553,0.00091234554,0.00074026576,0.000285285,0.00059468165,0.00089563784,0.0009913901,0.001323265],"category_scores_gemma":[0.0006018099,0.00024326672,0.0008423714,0.00062586303,0.00019705814,0.0006048673,0.00084861997,0.0007542727,0.00048714774],"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.00040258325,0.0003254543,0.0050820876,0.0000819309,0.00024052049,0.00023733982,0.000055221724,0.16439885,0.021735288,0.0016919462,0.009586018,0.7961627],"study_design_scores_gemma":[0.0000049357827,0.00005624665,0.0010428296,0.000007787302,0.00003229385,0.00006256727,0.0000073960737,0.99553406,0.002062263,0.00069149927,0.00048914045,0.000008972631],"about_ca_topic_score_codex":0.00896407,"about_ca_topic_score_gemma":0.013561237,"teacher_disagreement_score":0.00896407,"about_ca_system_score_codex":0.00044169146,"about_ca_system_score_gemma":0.00064644293,"threshold_uncertainty_score":0.017823756},"labels":[],"label_agreement":null},{"id":"W4409799390","doi":"10.1007/978-3-031-87327-0_17","title":"A Robust Probabilistic Framework for Identifying and Evaluating Concept Drift in Abrupt and Gradual Scenarios","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Probabilistic logic; Concept drift; Data mining; Artificial intelligence","score_opus":0.06546793049107429,"score_gpt":0.33282053928813204,"score_spread":0.26735260879705774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409799390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002307597,0.00023054279,0.99673754,0.000057039735,0.000020240639,0.000037070793,0.00007978607,0.00032218275,0.00020802775],"genre_scores_gemma":[0.17606652,0.0006894543,0.81916016,0.00017155019,0.00025307672,0.0003315501,0.0007558704,0.0002108486,0.0023609274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622214,0.0010651306,0.00026880222,0.0008778194,0.0012958603,0.00027021454],"domain_scores_gemma":[0.9914312,0.0053482214,0.00089650234,0.00070797675,0.0013511928,0.00026499396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010140798,0.001807635,0.0027296736,0.003595471,0.0009027575,0.0034329188,0.004479981,0.00303044,0.0023413072],"category_scores_gemma":[0.02224315,0.0012495285,0.0023846636,0.0029562342,0.0017828912,0.0044795,0.003555922,0.0031151432,0.0008589608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026590773,0.00015162068,0.0018558512,0.00016994221,0.00030462147,0.00016278442,0.00010255285,0.74665314,0.0048045525,0.03863722,0.003105677,0.20378618],"study_design_scores_gemma":[0.0000071574964,0.00004062662,0.00020924493,0.000008218076,0.000023719658,0.00004291423,0.00000732698,0.98612285,0.0005380454,0.0126562,0.0003267476,0.000016990083],"about_ca_topic_score_codex":0.008098424,"about_ca_topic_score_gemma":0.006814057,"teacher_disagreement_score":0.010140798,"about_ca_system_score_codex":0.0015879294,"about_ca_system_score_gemma":0.0025695784,"threshold_uncertainty_score":0.053630292},"labels":[],"label_agreement":null},{"id":"W4409807054","doi":"10.1007/978-3-031-89350-6_5","title":"Detecting Information Disclosure Vulnerability in Software Architectures Using Alloy","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Vulnerability (computing); Software; Vulnerability assessment; Software engineering; Computer security; Programming language","score_opus":0.020673496044233318,"score_gpt":0.2676906002831827,"score_spread":0.24701710423894938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409807054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44071397,0.0012221975,0.52876467,0.00057335274,0.00016671678,0.0002095189,0.00055493455,0.01494687,0.012847785],"genre_scores_gemma":[0.8599991,0.00024432546,0.13626292,0.00010141346,0.0000198792,0.000042129002,0.0003936951,0.00028037737,0.0026560412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741876,0.000437865,0.00018098437,0.00028471422,0.001444648,0.00023301167],"domain_scores_gemma":[0.99520904,0.0021063266,0.0005548786,0.0011723691,0.00088785193,0.00006949705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134227,0.00059232366,0.0006421584,0.0022181165,0.0006331209,0.0016810314,0.0011809304,0.000993265,0.0017503252],"category_scores_gemma":[0.006741285,0.0005137885,0.0009591248,0.0012133314,0.0008125161,0.0024795623,0.0011147504,0.0007554067,0.0005981061],"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.001962111,0.0003769815,0.05223505,0.0010993563,0.00039506386,0.0021771626,0.001488934,0.12884459,0.1444694,0.13569523,0.011321301,0.5199348],"study_design_scores_gemma":[0.00005115953,0.00036443135,0.004699285,0.00011860591,0.000261674,0.0011953074,0.00040795072,0.7919469,0.100765906,0.0895179,0.0105990255,0.000071820694],"about_ca_topic_score_codex":0.0019098549,"about_ca_topic_score_gemma":0.0025054037,"teacher_disagreement_score":0.0022181165,"about_ca_system_score_codex":0.0008791571,"about_ca_system_score_gemma":0.0010806117,"threshold_uncertainty_score":0.0063787103},"labels":[],"label_agreement":null},{"id":"W4409807203","doi":"10.1007/978-3-031-89350-6_15","title":"Distributed and Verifiable Digital Badges","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Verifiable secret sharing; Computer graphics (images); Distributed computing; Computer security; Programming language","score_opus":0.009192098298250432,"score_gpt":0.21725654797287036,"score_spread":0.20806444967461993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409807203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04166287,0.0031224885,0.820429,0.00577262,0.001573733,0.0002851514,0.0006614578,0.0025338847,0.12395877],"genre_scores_gemma":[0.8639051,0.0019266403,0.06909523,0.0007545734,0.00073509023,0.0002615802,0.00043438314,0.0002687874,0.062618576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956157,0.0009949132,0.00020062983,0.00083938235,0.0018210373,0.00052838755],"domain_scores_gemma":[0.978019,0.010976077,0.001140226,0.007894794,0.0016381341,0.0003316477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033783861,0.00091398344,0.0010653335,0.0013294277,0.0014839274,0.0066753593,0.002101174,0.0033263923,0.014453237],"category_scores_gemma":[0.019521877,0.0007888479,0.0007431025,0.00115695,0.0048031975,0.011768377,0.004420065,0.0045250817,0.003611062],"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.00029575138,0.000079931684,0.00057138526,0.00014839874,0.000037443013,0.00020160088,0.00024800832,0.01448431,0.0031667456,0.894486,0.0098602455,0.07642005],"study_design_scores_gemma":[0.00006986184,0.00007734829,0.0003268613,0.00011065462,0.000042380176,0.0003973623,0.000099701334,0.07050215,0.006414225,0.89412975,0.027789088,0.000040594547],"about_ca_topic_score_codex":0.00052845775,"about_ca_topic_score_gemma":0.00046297922,"teacher_disagreement_score":0.014453237,"about_ca_system_score_codex":0.0018772404,"about_ca_system_score_gemma":0.0015048218,"threshold_uncertainty_score":0.04835087},"labels":[],"label_agreement":null},{"id":"W4409807632","doi":"10.1007/978-3-031-89350-6_10","title":"Classifying Insider Threat Scenarios Through Explainable Articial Intelligence","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Insider; Computer science; Insider threat; Artificial intelligence; Epistemology; Philosophy","score_opus":0.031862209866124355,"score_gpt":0.282651684809829,"score_spread":0.2507894749437046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409807632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19791603,0.0008401446,0.75084513,0.001671627,0.00015951987,0.00027697897,0.0011014725,0.0037926796,0.04339644],"genre_scores_gemma":[0.84843874,0.00052000606,0.14392126,0.00017082535,0.00008513312,0.00008026575,0.0015670607,0.00021834082,0.0049983747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877137,0.00032347476,0.00006999429,0.00023451578,0.00047139416,0.00012923063],"domain_scores_gemma":[0.9971079,0.0016209146,0.0005473392,0.00037930836,0.00027078204,0.00007374205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784812,0.0010073147,0.00039789866,0.0020458242,0.00043629445,0.0028053708,0.0010369414,0.0011782285,0.00401403],"category_scores_gemma":[0.008859096,0.00031685564,0.0009154415,0.0010434914,0.00096185185,0.0040302416,0.0018140621,0.0015386055,0.0013307831],"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.0004440403,0.00030486257,0.05722722,0.00050738157,0.00028668877,0.0019367555,0.0034071899,0.087072775,0.027123943,0.108515285,0.014796839,0.6983771],"study_design_scores_gemma":[0.000018251993,0.00019398217,0.021002121,0.00021158079,0.00017382545,0.0011768475,0.0017135389,0.81674427,0.010177752,0.12911972,0.019378735,0.00008936963],"about_ca_topic_score_codex":0.000990783,"about_ca_topic_score_gemma":0.0012211249,"teacher_disagreement_score":0.00401403,"about_ca_system_score_codex":0.00058953767,"about_ca_system_score_gemma":0.00045693183,"threshold_uncertainty_score":0.01342833},"labels":[],"label_agreement":null},{"id":"W4409846373","doi":"10.1007/978-3-031-91134-7_3","title":"Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Toronto","funders":"","keywords":"Computer science; Hash function; Zero-knowledge proof; Hash table; Theoretical computer science; Programming language; Algorithm; Cryptography","score_opus":0.011576468564169025,"score_gpt":0.25327885652960985,"score_spread":0.24170238796544083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409846373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0361205,0.0008217923,0.9263345,0.0009939885,0.00023363053,0.00014072997,0.00034367052,0.0024395955,0.032571625],"genre_scores_gemma":[0.8683442,0.00066638784,0.102433905,0.00034117966,0.00019879057,0.00020382427,0.0004575212,0.000393181,0.02696103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683505,0.0006870569,0.0001228608,0.00050503376,0.0011775716,0.00067233853],"domain_scores_gemma":[0.99548596,0.002403495,0.0002064076,0.0014804422,0.00029129683,0.00013238814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096851,0.0008334185,0.0015664711,0.00074120495,0.0011858704,0.0032972565,0.002234035,0.001987184,0.01216923],"category_scores_gemma":[0.0058339867,0.0008969397,0.0010646188,0.001146355,0.0033570984,0.008313644,0.007216412,0.003944682,0.0036915988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013810489,0.00017865053,0.0004543611,0.0003891614,0.0000972857,0.00033334893,0.00044446252,0.042491112,0.014833945,0.7965311,0.010072932,0.13279262],"study_design_scores_gemma":[0.000081378654,0.00009722609,0.00015150315,0.00006423348,0.000039084578,0.00029630502,0.00005665542,0.1594482,0.014024685,0.8204033,0.0052771154,0.000060279828],"about_ca_topic_score_codex":0.00042442736,"about_ca_topic_score_gemma":0.00038265815,"teacher_disagreement_score":0.01216923,"about_ca_system_score_codex":0.0012314944,"about_ca_system_score_gemma":0.0018102893,"threshold_uncertainty_score":0.04071015},"labels":[],"label_agreement":null},{"id":"W4409849366","doi":"10.1007/978-3-031-91098-2","title":"Advances in Cryptology – EUROCRYPT 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligence, Security, War Strategy","field":"Social Sciences","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":"Université de Montpellier; Universitat Rovira i Virgili; Universidade do Porto; Danmarks Tekniske Universitet; Università di Catania; KU Leuven; University of North Carolina at Chapel Hill; Tel Aviv University; Indian Institute of Science; Ruhr-Universität Bochum; Aalto-Yliopisto; York University; Universidade de Lisboa; Université du Luxembourg; Centre National de la Recherche Scientifique; Radboud Universiteit; George Mason University; Microsoft Research","keywords":"Computer science; Cryptography; Computer security","score_opus":0.015817133182670286,"score_gpt":0.3224332739606668,"score_spread":0.3066161407779965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409849366","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965561,0.071289904,0.04086312,0.02049643,0.027620926,0.0001348735,0.0010608824,0.0014228799,0.83314544],"genre_scores_gemma":[0.056099284,0.036268048,0.01555562,0.0029826614,0.010947591,0.00008854559,0.0016464517,0.00074488635,0.87566704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989801,0.00023630017,0.00004437561,0.00011126277,0.0005085004,0.00011934488],"domain_scores_gemma":[0.99909294,0.00022474829,0.00006225638,0.00023231661,0.00025575212,0.00013197624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016596825,0.0011826667,0.0006568769,0.0016852844,0.00071219343,0.0044942116,0.0007509041,0.0017123073,0.064307],"category_scores_gemma":[0.0026253087,0.0003939891,0.0003373763,0.0018857698,0.0010397354,0.005250275,0.0016276172,0.0032468166,0.038215622],"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.00011026186,0.000052397238,0.0000962288,0.00028043773,0.000018051413,0.000051254527,0.000029592076,0.0011981495,0.0009784817,0.18515618,0.48841423,0.32361472],"study_design_scores_gemma":[0.000022340795,0.000048018504,0.00027146828,0.00016207669,0.000008443111,0.00017422368,0.000013119556,0.0020447266,0.0011362062,0.03843616,0.9576736,0.000009631749],"about_ca_topic_score_codex":0.0009686301,"about_ca_topic_score_gemma":0.0009305727,"teacher_disagreement_score":0.064307,"about_ca_system_score_codex":0.0022715642,"about_ca_system_score_gemma":0.0015954002,"threshold_uncertainty_score":0.21512836},"labels":[],"label_agreement":null},{"id":"W4409849576","doi":"10.1007/978-3-031-91124-8","title":"Advances in Cryptology – EUROCRYPT 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Intelligence, Security, War Strategy","field":"Social Sciences","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":"Université de Montpellier; Universitat Rovira i Virgili; Universidade do Porto; Danmarks Tekniske Universitet; Università di Catania; KU Leuven; University of North Carolina at Chapel Hill; Tel Aviv University; Indian Institute of Science; Ruhr-Universität Bochum; Aalto-Yliopisto; York University; Universidade de Lisboa; Université du Luxembourg; Centre National de la Recherche Scientifique; Radboud Universiteit; George Mason University; Microsoft Research","keywords":"Computer science; Cryptography; Computer security","score_opus":0.015817133182670286,"score_gpt":0.3224332739606668,"score_spread":0.3066161407779965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409849576","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965561,0.071289904,0.04086312,0.02049643,0.027620926,0.0001348735,0.0010608824,0.0014228799,0.83314544],"genre_scores_gemma":[0.056099284,0.036268048,0.01555562,0.0029826614,0.010947591,0.00008854559,0.0016464517,0.00074488635,0.87566704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989801,0.00023630017,0.00004437561,0.00011126277,0.0005085004,0.00011934488],"domain_scores_gemma":[0.99909294,0.00022474829,0.00006225638,0.00023231661,0.00025575212,0.00013197624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016596825,0.0011826667,0.0006568769,0.0016852844,0.00071219343,0.0044942116,0.0007509041,0.0017123073,0.064307],"category_scores_gemma":[0.0026253087,0.0003939891,0.0003373763,0.0018857698,0.0010397354,0.005250275,0.0016276172,0.0032468166,0.038215622],"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.00011026186,0.000052397238,0.0000962288,0.00028043773,0.000018051413,0.000051254527,0.000029592076,0.0011981495,0.0009784817,0.18515618,0.48841423,0.32361472],"study_design_scores_gemma":[0.000022340795,0.000048018504,0.00027146828,0.00016207669,0.000008443111,0.00017422368,0.000013119556,0.0020447266,0.0011362062,0.03843616,0.9576736,0.000009631749],"about_ca_topic_score_codex":0.0009686301,"about_ca_topic_score_gemma":0.0009305727,"teacher_disagreement_score":0.064307,"about_ca_system_score_codex":0.0022715642,"about_ca_system_score_gemma":0.0015954002,"threshold_uncertainty_score":0.21512836},"labels":[],"label_agreement":null},{"id":"W4409851657","doi":"10.1007/978-3-031-91092-0_8","title":"Simultaneous-Message and Succinct Secure Computation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Toronto","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Distributed computing; Computer network; Programming language","score_opus":0.007545865467892893,"score_gpt":0.23756283075323828,"score_spread":0.23001696528534538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409851657","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.026761612,0.0013196699,0.8649031,0.0019788868,0.0005452479,0.00023886884,0.0007214401,0.0024320257,0.10109918],"genre_scores_gemma":[0.6220479,0.0019284078,0.2272586,0.0008373134,0.0006640278,0.00054921524,0.0014400649,0.0013653003,0.14390922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726653,0.0006026021,0.00016689858,0.00035053224,0.0012640427,0.00034938054],"domain_scores_gemma":[0.9961571,0.001615207,0.00015209467,0.0016519934,0.0003147288,0.00010889367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831503,0.0014062471,0.0010996824,0.0010294557,0.0013087909,0.0034832337,0.0019261754,0.0015416419,0.018294528],"category_scores_gemma":[0.0058616833,0.00095038355,0.0012353025,0.0022737256,0.0033337576,0.011440348,0.0049553984,0.004552132,0.005659669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020319226,0.000036867707,0.000089255125,0.00014748517,0.000013474763,0.00006575633,0.00015294128,0.0074949455,0.0022659393,0.94013476,0.0063295206,0.043065842],"study_design_scores_gemma":[0.000025307507,0.00002969203,0.0000529306,0.0000334633,0.000015575599,0.00010315604,0.000021930266,0.022966389,0.004492514,0.9602172,0.01202627,0.000015613597],"about_ca_topic_score_codex":0.00046691392,"about_ca_topic_score_gemma":0.0008700134,"teacher_disagreement_score":0.018294528,"about_ca_system_score_codex":0.0018270209,"about_ca_system_score_gemma":0.0017753933,"threshold_uncertainty_score":0.061201334},"labels":[],"label_agreement":null},{"id":"W4409865898","doi":"10.1007/978-3-031-87756-8_33","title":"Low-Rank Conjugate Gradient-Net for Accelerated Cardiac MR Imaging","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Computer science; Conjugate gradient method; Conjugate; Rank (graph theory); Net (polyhedron); Artificial intelligence; Computer vision; Algorithm; Mathematics; Geometry; Combinatorics; Mathematical analysis","score_opus":0.018634473269997957,"score_gpt":0.3036613003493153,"score_spread":0.28502682707931737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409865898","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.0016768953,0.0008782813,0.9918345,0.00016246323,0.00016467986,0.000031503496,0.00022846054,0.0018164244,0.0032068815],"genre_scores_gemma":[0.029528625,0.0014939447,0.9412839,0.000162338,0.00022823742,0.00009643558,0.0010489193,0.0007892411,0.025368271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982625,0.000035247096,0.0000097967395,0.000029117637,0.00008328166,0.000016328811],"domain_scores_gemma":[0.9996879,0.00010464874,0.000021266562,0.000055983193,0.00010686561,0.000023415672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039148904,0.0010656909,0.00062134425,0.00047730556,0.00022739911,0.0009990913,0.0009863484,0.0008755286,0.013375402],"category_scores_gemma":[0.0011168576,0.00037832456,0.000350318,0.0007207982,0.0002897832,0.0007661606,0.0007936058,0.0013133365,0.007995922],"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.00020602165,0.000081300845,0.00015518855,0.00029736714,0.000045812965,0.00010672415,0.000032603635,0.061196122,0.01914976,0.021875381,0.047025543,0.8498282],"study_design_scores_gemma":[0.00002179814,0.00007958272,0.00024494372,0.00003681705,0.000018656017,0.000260686,0.00001321311,0.93690217,0.01100756,0.022121515,0.029270198,0.000022772276],"about_ca_topic_score_codex":0.0021989765,"about_ca_topic_score_gemma":0.0052071786,"teacher_disagreement_score":0.013375402,"about_ca_system_score_codex":0.0003224291,"about_ca_system_score_gemma":0.0007136141,"threshold_uncertainty_score":0.044745147},"labels":[],"label_agreement":null},{"id":"W4409903071","doi":"10.1007/978-3-031-87330-0_7","title":"Deep and Shallow Machine Learning for Predicting Major Donors","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","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":"Acadia University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.012440492732927409,"score_gpt":0.23103478122336266,"score_spread":0.21859428849043525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409903071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23061246,0.026321162,0.6849066,0.0043779323,0.0012785327,0.00013058294,0.0061031226,0.0059395833,0.04033007],"genre_scores_gemma":[0.7340807,0.0063472115,0.18085901,0.00074376323,0.00062671053,0.0001196544,0.008203855,0.00034661507,0.06867249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997569,0.00005548523,0.000015745181,0.00005355304,0.00006137673,0.000056945457],"domain_scores_gemma":[0.99896145,0.00067278714,0.000045817065,0.000105677194,0.00015971989,0.000054548666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887466,0.0012272104,0.00060643395,0.00075539405,0.00032700924,0.00092090346,0.0009795709,0.0010534824,0.0045482893],"category_scores_gemma":[0.0020602283,0.00050616433,0.0006325907,0.00075259793,0.00029008562,0.0017774133,0.0010243162,0.0018584701,0.0018192806],"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.00030089085,0.0002084039,0.005207093,0.00013866564,0.00009449486,0.00008178043,0.00006743518,0.13291402,0.003885988,0.008531406,0.03621198,0.81235784],"study_design_scores_gemma":[0.000009356274,0.00006904048,0.0013774852,0.000036639576,0.000035649384,0.000026476382,0.000022697737,0.9779001,0.0021394729,0.015807034,0.0025625888,0.000013457752],"about_ca_topic_score_codex":0.008048363,"about_ca_topic_score_gemma":0.01755505,"teacher_disagreement_score":0.008048363,"about_ca_system_score_codex":0.0006874134,"about_ca_system_score_gemma":0.00083821826,"threshold_uncertainty_score":0.016003013},"labels":[],"label_agreement":null},{"id":"W4409967420","doi":"10.1007/978-3-031-90660-2_2","title":"Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; State diagram; State (computer science); Data structure; Theoretical computer science; Programming language; Algorithm","score_opus":0.04171524278728744,"score_gpt":0.3111681039484762,"score_spread":0.2694528611611888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409967420","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.0031987734,0.00059768395,0.98414177,0.00023543126,0.000116477146,0.000051312567,0.0008207185,0.002111984,0.008725749],"genre_scores_gemma":[0.13374114,0.0022776562,0.83827317,0.00028113046,0.0002594429,0.00061546825,0.0038766325,0.0012874719,0.01938782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927,0.00020907345,0.00010558772,0.0001308684,0.00024307708,0.00004142046],"domain_scores_gemma":[0.9978009,0.0012603877,0.00013954287,0.00047993832,0.00024420896,0.00007504964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011144679,0.0005573914,0.00052020827,0.0021342582,0.00075980596,0.0029076722,0.0015260748,0.00074337405,0.0064774062],"category_scores_gemma":[0.0039250003,0.00059846655,0.00063716905,0.0025663832,0.0016828536,0.0045181685,0.0017921482,0.0015292866,0.0022138096],"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.0000335578,0.000015424574,0.00020895166,0.00014525748,0.000007965889,0.000078907666,0.00024988642,0.007851265,0.002262016,0.9226545,0.0048104804,0.06168188],"study_design_scores_gemma":[0.000014539536,0.000019878858,0.00008937364,0.00013183526,0.000016224822,0.00011641212,0.000047478028,0.054528557,0.0060043465,0.7621081,0.17689838,0.00002494069],"about_ca_topic_score_codex":0.0013030351,"about_ca_topic_score_gemma":0.0015097952,"teacher_disagreement_score":0.0064774062,"about_ca_system_score_codex":0.0011245998,"about_ca_system_score_gemma":0.0010930388,"threshold_uncertainty_score":0.02166909},"labels":[],"label_agreement":null},{"id":"W4409967438","doi":"10.1007/978-3-031-90660-2","title":"Tools and Algorithms for the Construction and Analysis of Systems","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Research, Development and Innovation Office; National Science and Technology Council; Eidgenössische Technische Hochschule Zürich; Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Grantová Agentura České Republiky; National Natural Science Foundation of China; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; UK Research and Innovation; Deutsche Forschungsgemeinschaft; European Commission; Agence Nationale de la Recherche; National Science Foundation","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.01626412555162778,"score_gpt":0.2530340618299088,"score_spread":0.236769936278281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409967438","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000592787,0.00909941,0.96393627,0.0008502809,0.00048314594,0.00011539335,0.00029179,0.0018134698,0.022817455],"genre_scores_gemma":[0.027704244,0.013811866,0.9303946,0.0004835053,0.0006685386,0.0008104101,0.0017834235,0.0012304179,0.023112964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953752,0.0014320789,0.0004246093,0.00066077727,0.001902007,0.00020543498],"domain_scores_gemma":[0.99513525,0.0030314326,0.00018078108,0.0010785521,0.00047329944,0.000100599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031030625,0.0041785417,0.0023634522,0.0048315786,0.0014840673,0.007222373,0.0041095684,0.0023963647,0.018055664],"category_scores_gemma":[0.010611006,0.0023158544,0.0039026872,0.007037533,0.005407246,0.009694092,0.004733266,0.0074458523,0.010910274],"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.00002367847,0.000034781177,0.00024156994,0.0013051701,0.00011202817,0.00017287587,0.0004631263,0.016950786,0.00069405575,0.75786155,0.038527656,0.18361272],"study_design_scores_gemma":[0.0000217034,0.000017871807,0.00012273657,0.0002763399,0.000027354625,0.00019847343,0.00007188992,0.02971095,0.00047410824,0.8317163,0.13734119,0.000021138478],"about_ca_topic_score_codex":0.0021279259,"about_ca_topic_score_gemma":0.0016769288,"teacher_disagreement_score":0.018055664,"about_ca_system_score_codex":0.002689204,"about_ca_system_score_gemma":0.0022580686,"threshold_uncertainty_score":0.060402274},"labels":[],"label_agreement":null},{"id":"W4409970543","doi":"10.1007/978-3-031-90897-2","title":"Foundations of Software Science and Computation Structures","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Air Force Office of Scientific Research; European Social Fund; Fundação para a Ciência e a Tecnologia; Gruppo Nazionale per il Calcolo Scientifico; Agence Nationale de la Recherche; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Eesti Teadusagentuur; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; UK Research and Innovation; Institut de Valorisation des Données; Univerzita Palackého v Olomouci; European Commission; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Computer science; Computation; Software; Software engineering; Theoretical computer science; Computational science; Programming language","score_opus":0.01608597349602418,"score_gpt":0.2786261848248664,"score_spread":0.2625402113288422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409970543","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024538597,0.141762,0.09236664,0.018852768,0.005036328,0.00009264161,0.0007720804,0.0010203779,0.7376433],"genre_scores_gemma":[0.1051576,0.1666216,0.06535171,0.0044613536,0.006635451,0.0004485034,0.0020490808,0.0012567713,0.6480179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916077,0.00014859845,0.00004224173,0.00011638725,0.0004485368,0.00008340778],"domain_scores_gemma":[0.99865866,0.00066587963,0.000056472705,0.00023833674,0.00028094664,0.00009973716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007719484,0.0010297804,0.0008411759,0.0018424103,0.0014727792,0.0049157,0.0011184749,0.0013344613,0.025554677],"category_scores_gemma":[0.002613867,0.0007409952,0.0008628293,0.003366878,0.0039258264,0.0050556287,0.0018485483,0.0037750243,0.010717448],"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.000008371412,0.00000986209,0.00009528581,0.00033270294,0.000012531599,0.000060697042,0.00032148845,0.0012246153,0.00024974896,0.8126774,0.12015208,0.064855136],"study_design_scores_gemma":[0.0000045649203,0.0000058121004,0.00016816099,0.00018968353,0.000004556135,0.00011865717,0.000048442,0.00073267904,0.00008097552,0.46102932,0.53761077,0.0000063325565],"about_ca_topic_score_codex":0.004022646,"about_ca_topic_score_gemma":0.0035743383,"teacher_disagreement_score":0.025554677,"about_ca_system_score_codex":0.004468753,"about_ca_system_score_gemma":0.0030911064,"threshold_uncertainty_score":0.085488915},"labels":[],"label_agreement":null},{"id":"W4409970721","doi":"10.1007/978-3-031-91118-7_11","title":"Coverage Semantics for Dependent Pattern Matching","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Semantics (computer science); Pattern matching; Matching (statistics); Programming language; Mathematics; Statistics","score_opus":0.017444454451009322,"score_gpt":0.2505777732463224,"score_spread":0.2331333187953131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409970721","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.0865659,0.0006647182,0.8577016,0.0020258334,0.00011383935,0.000120693374,0.00045674437,0.001674894,0.05067577],"genre_scores_gemma":[0.88322765,0.0003103602,0.10420495,0.000561617,0.00014010604,0.00024348093,0.00060494477,0.000309418,0.010397529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666154,0.000773644,0.0002606957,0.00064491027,0.0013672027,0.00029207254],"domain_scores_gemma":[0.99630725,0.0018216191,0.00016033986,0.00062221586,0.0008176338,0.00027094368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019120122,0.00038753156,0.00048630152,0.0024088635,0.0012946837,0.0027029547,0.001317338,0.0013053126,0.0044997553],"category_scores_gemma":[0.0046158424,0.00052339863,0.0010669673,0.0018110279,0.003462517,0.0068470947,0.0042305104,0.0021669052,0.00060890266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002135936,0.000014125957,0.00023026478,0.00004164988,0.000006922026,0.0000605039,0.000499837,0.0011528776,0.0016593981,0.9877242,0.000719408,0.007869448],"study_design_scores_gemma":[0.000012120156,0.00002278056,0.00018859984,0.000026351621,0.000012486575,0.00012558978,0.00018099109,0.016002996,0.002452148,0.9697352,0.011226713,0.0000140580305],"about_ca_topic_score_codex":0.0015024808,"about_ca_topic_score_gemma":0.0008153512,"teacher_disagreement_score":0.0044997553,"about_ca_system_score_codex":0.0022219762,"about_ca_system_score_gemma":0.0006020786,"threshold_uncertainty_score":0.016121626},"labels":[],"label_agreement":null},{"id":"W4409970758","doi":"10.1007/978-3-031-90897-2_2","title":"A Behavioural Pseudometric for Continuous-Time Markov Processes","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; UK Research and Innovation","keywords":"Computer science; Markov chain; Markov process; Algorithm; Mathematics; Machine learning; Statistics","score_opus":0.05761260893515404,"score_gpt":0.3583308095965839,"score_spread":0.3007182006614299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409970758","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.09902014,0.0014323307,0.86009544,0.0017371693,0.0005894142,0.000092291295,0.00014936675,0.00019487285,0.03668896],"genre_scores_gemma":[0.85764694,0.0010253354,0.12688205,0.00045743323,0.00044221128,0.00021747882,0.00017510883,0.00012455822,0.013028909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973271,0.0009785831,0.00017042745,0.00030630955,0.0010812226,0.00013649743],"domain_scores_gemma":[0.99661237,0.00132927,0.00044171038,0.00025204587,0.00081672595,0.00054797286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023516896,0.00053941226,0.00042151965,0.0011148965,0.00061132543,0.0019515249,0.00076696853,0.0009232567,0.001970374],"category_scores_gemma":[0.0060027647,0.00024282017,0.0007033746,0.00074258714,0.0026807983,0.003263062,0.0024981354,0.002288537,0.00034553887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014192394,0.000014480845,0.00018583269,0.000034771485,0.0000062338863,0.00004113647,0.00015827845,0.0030622433,0.0014729872,0.98901933,0.00035030232,0.005640079],"study_design_scores_gemma":[0.000012531293,0.00017194243,0.00064624473,0.00004270714,0.000010982523,0.0003130864,0.00015739146,0.10683445,0.0018171994,0.8722151,0.017743362,0.000035007364],"about_ca_topic_score_codex":0.0005147343,"about_ca_topic_score_gemma":0.00029377083,"teacher_disagreement_score":0.0023516896,"about_ca_system_score_codex":0.0014005803,"about_ca_system_score_gemma":0.0007251059,"threshold_uncertainty_score":0.012437046},"labels":[],"label_agreement":null},{"id":"W4409974436","doi":"10.1007/978-3-031-90643-5","title":"Tools and Algorithms for the Construction and Analysis of Systems","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Office of Aerospace Research and Development; Air Force Office of Scientific Research; Science and Engineering Research Board; Israel Science Foundation; Bộ Giáo dục và Ðào tạo; Deutsche Forschungsgemeinschaft; Conseil Régional, Île-de-France; Austrian Science Fund; Amazon Web Services; Ministry of Education, India; European Commission; National Science Foundation","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.01626412555162778,"score_gpt":0.2530340618299088,"score_spread":0.236769936278281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409974436","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.000592787,0.00909941,0.96393627,0.0008502809,0.00048314594,0.00011539335,0.00029179,0.0018134698,0.022817455],"genre_scores_gemma":[0.027704244,0.013811866,0.9303946,0.0004835053,0.0006685386,0.0008104101,0.0017834235,0.0012304179,0.023112964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953752,0.0014320789,0.0004246093,0.00066077727,0.001902007,0.00020543498],"domain_scores_gemma":[0.99513525,0.0030314326,0.00018078108,0.0010785521,0.00047329944,0.000100599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031030625,0.0041785417,0.0023634522,0.0048315786,0.0014840673,0.007222373,0.0041095684,0.0023963647,0.018055664],"category_scores_gemma":[0.010611006,0.0023158544,0.0039026872,0.007037533,0.005407246,0.009694092,0.004733266,0.0074458523,0.010910274],"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.00002367847,0.000034781177,0.00024156994,0.0013051701,0.00011202817,0.00017287587,0.0004631263,0.016950786,0.00069405575,0.75786155,0.038527656,0.18361272],"study_design_scores_gemma":[0.0000217034,0.000017871807,0.00012273657,0.0002763399,0.000027354625,0.00019847343,0.00007188992,0.02971095,0.00047410824,0.8317163,0.13734119,0.000021138478],"about_ca_topic_score_codex":0.0021279259,"about_ca_topic_score_gemma":0.0016769288,"teacher_disagreement_score":0.018055664,"about_ca_system_score_codex":0.002689204,"about_ca_system_score_gemma":0.0022580686,"threshold_uncertainty_score":0.060402274},"labels":[],"label_agreement":null},{"id":"W4410019661","doi":"10.1007/978-981-96-4734-7_1","title":"Extended Policy-Based Sanitizable Signatures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.010024344992909546,"score_gpt":0.2488410271255935,"score_spread":0.23881668213268395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410019661","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026410265,0.0005509368,0.9188502,0.0010203162,0.0006186385,0.00025212183,0.00034579381,0.004410272,0.047541447],"genre_scores_gemma":[0.6476424,0.00079117634,0.28052363,0.0007037005,0.0004262455,0.00040292233,0.00085221254,0.0010179324,0.067639835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577314,0.0008669997,0.00036897455,0.00061168533,0.0018097557,0.0005694461],"domain_scores_gemma":[0.99193656,0.0022943683,0.00035910602,0.0041639456,0.0009826139,0.00026340043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029101255,0.0007745609,0.001079157,0.0008939242,0.0010043412,0.003423057,0.0020239237,0.0015961645,0.009026462],"category_scores_gemma":[0.0066485815,0.00067390146,0.0008120098,0.001248236,0.0028570993,0.0073733805,0.004159557,0.005018816,0.0049693133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007045922,0.00023177301,0.00026928197,0.00022696608,0.000036160818,0.00014240552,0.00039254985,0.02201203,0.011616822,0.79068416,0.00890058,0.16478266],"study_design_scores_gemma":[0.00013404165,0.00020074003,0.0001508362,0.00007813273,0.000043562297,0.0003427378,0.00006434444,0.11752769,0.024331309,0.80869055,0.04837128,0.00006481398],"about_ca_topic_score_codex":0.00028559635,"about_ca_topic_score_gemma":0.00025031966,"teacher_disagreement_score":0.009026462,"about_ca_system_score_codex":0.0015546209,"about_ca_system_score_gemma":0.0019700206,"threshold_uncertainty_score":0.030196548},"labels":[],"label_agreement":null},{"id":"W4410033711","doi":"10.1007/978-3-031-87499-4_20","title":"Privacy Guard: Empowering Users with Privacy Labels and Intuitive Apps","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":"Mount Royal University","funders":"","keywords":"Computer science; Guard (computer science); Internet privacy; Computer security; Privacy software; Privacy protection; Information privacy; World Wide Web","score_opus":0.01823125448949195,"score_gpt":0.28771710889299157,"score_spread":0.2694858544034996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410033711","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021768397,0.0034508116,0.72131497,0.010914884,0.0012255308,0.00021197466,0.00057939236,0.0106957,0.22983842],"genre_scores_gemma":[0.41915798,0.006251847,0.26782048,0.006149265,0.00073373044,0.0006119327,0.001158179,0.0039322204,0.29418427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829596,0.0006193812,0.00007498097,0.00021594838,0.00061088795,0.00018292849],"domain_scores_gemma":[0.9963315,0.002126408,0.00015478542,0.0008612745,0.00031545584,0.00021062304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023516538,0.0010313832,0.00042504826,0.0007505256,0.0013131078,0.006867953,0.001526683,0.002610618,0.017711269],"category_scores_gemma":[0.008082494,0.0006713741,0.0006541961,0.00060505123,0.0037622668,0.014936832,0.006441425,0.0050356835,0.0066495645],"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.00023592525,0.00012862092,0.000759985,0.00036359575,0.000017839824,0.00043935044,0.00904749,0.0010803429,0.00648544,0.69376004,0.07226082,0.21542057],"study_design_scores_gemma":[0.000037581773,0.00009106075,0.0005074603,0.0004390849,0.000050056697,0.0013310597,0.0020777064,0.012753533,0.014965531,0.38462463,0.5830246,0.000097733064],"about_ca_topic_score_codex":0.00057603,"about_ca_topic_score_gemma":0.00065323943,"teacher_disagreement_score":0.017711269,"about_ca_system_score_codex":0.00054694334,"about_ca_system_score_gemma":0.00093599164,"threshold_uncertainty_score":0.059250116},"labels":[],"label_agreement":null},{"id":"W4410033985","doi":"10.1007/978-3-031-87499-4_21","title":"Actively Secure Authenticated Data Acquisition Protocols: Advancing Substation Automation Security","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer security; Cryptographic protocol; Automation; Computer network; Cryptography","score_opus":0.015067144461051583,"score_gpt":0.2701627259649019,"score_spread":0.2550955815038503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410033985","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.009298097,0.009281668,0.92556024,0.00335048,0.0014774527,0.000092129594,0.000070987015,0.0010738389,0.049795125],"genre_scores_gemma":[0.5217126,0.030020379,0.35558775,0.0013424945,0.0030056043,0.00030827514,0.00031044133,0.00048365348,0.08722878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840266,0.0004853476,0.00009607936,0.00016844772,0.00073328585,0.000114197865],"domain_scores_gemma":[0.9960444,0.0018003259,0.00024904226,0.0011955922,0.0005857422,0.00012500439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022623397,0.00083067646,0.0004231042,0.00075473497,0.00051519915,0.004163598,0.0014463038,0.0015434575,0.004544213],"category_scores_gemma":[0.0049705724,0.00074198376,0.00040785395,0.0011328165,0.002279837,0.008563054,0.0029687607,0.0054354845,0.0026389782],"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.00008429594,0.00007349738,0.00018069384,0.00021625395,0.000020030428,0.000115362825,0.00049003743,0.006556057,0.010344446,0.7506238,0.011446562,0.21984908],"study_design_scores_gemma":[0.000038946473,0.00026104163,0.00017295181,0.00030826998,0.000044658187,0.00069688214,0.0002115236,0.09653607,0.018961346,0.6106416,0.27208245,0.000044269094],"about_ca_topic_score_codex":0.00022205741,"about_ca_topic_score_gemma":0.00018782214,"teacher_disagreement_score":0.004544213,"about_ca_system_score_codex":0.0006517022,"about_ca_system_score_gemma":0.0009782331,"threshold_uncertainty_score":0.015201867},"labels":[],"label_agreement":null},{"id":"W4410034007","doi":"10.1007/978-3-031-87499-4_4","title":"Exploring Smart Speaker Disclosure and Adoption Intentions: A Privacy Adoption Calculus Perspective","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Perspective (graphical); Differential privacy; Calculus (dental); Theoretical computer science; Computer security; Internet privacy; Algorithm; Artificial intelligence","score_opus":0.05973084397355313,"score_gpt":0.29895726394238625,"score_spread":0.23922641996883312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410034007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19176008,0.0016946347,0.6667113,0.018505376,0.00016594194,0.00017694168,0.00023720627,0.00020544122,0.12054309],"genre_scores_gemma":[0.9652173,0.00058125023,0.029141912,0.00043559363,0.000088030225,0.00010785534,0.00006710303,0.000042797892,0.0043180254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99311346,0.0041252533,0.00023058358,0.00071693637,0.0011395252,0.00067419984],"domain_scores_gemma":[0.9699902,0.024915496,0.0021685262,0.0014941406,0.0010283532,0.00040329754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077845016,0.0006914858,0.0005731726,0.0016188888,0.002080714,0.008111482,0.0020051855,0.0027693533,0.008489766],"category_scores_gemma":[0.03210504,0.00083802966,0.0014245014,0.0024129131,0.0064462726,0.015666487,0.0035138854,0.0053799297,0.00058695447],"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.000035500263,0.000115963994,0.0021836036,0.000033820972,0.00002292653,0.000090113856,0.0037119011,0.0018696615,0.00040456848,0.98100096,0.00037246896,0.010158414],"study_design_scores_gemma":[0.000016022104,0.000043784185,0.0014800964,0.000049988517,0.000059795395,0.0001243043,0.0029887308,0.026300281,0.0006189231,0.96466297,0.003622374,0.00003263096],"about_ca_topic_score_codex":0.003257332,"about_ca_topic_score_gemma":0.0023077398,"teacher_disagreement_score":0.008489766,"about_ca_system_score_codex":0.0027556117,"about_ca_system_score_gemma":0.002059495,"threshold_uncertainty_score":0.04116887},"labels":[],"label_agreement":null},{"id":"W4410035522","doi":"10.1007/978-3-031-87499-4_26","title":"RouterORAM: An O(1)-Latency and Client-Work ORAM","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Latency (audio); Operating system; Telecommunications","score_opus":0.013707615903691257,"score_gpt":0.24759211449352936,"score_spread":0.2338844985898381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410035522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013271811,0.0016182844,0.73612434,0.00069169916,0.0012588275,0.0008053833,0.0010747752,0.18487614,0.060278766],"genre_scores_gemma":[0.15500823,0.0010226836,0.6417562,0.0014320851,0.0006835114,0.0009472002,0.0032844094,0.022255503,0.17361024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682236,0.0005035567,0.00017971038,0.0005023873,0.0013537292,0.0006382969],"domain_scores_gemma":[0.9973036,0.00038242253,0.00012024086,0.0016083354,0.0003304832,0.0002548613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014443761,0.0028880304,0.002069994,0.0021511242,0.0017925416,0.0048492993,0.010285796,0.0024409413,0.09119383],"category_scores_gemma":[0.004314139,0.0020375184,0.00164903,0.002456414,0.0012601647,0.0073982226,0.008842092,0.0029841636,0.027029477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028543985,0.0007509308,0.001287239,0.0007596428,0.00021621054,0.00030900337,0.00031950526,0.006714826,0.027182233,0.07115112,0.1877044,0.70075047],"study_design_scores_gemma":[0.0010715073,0.001003969,0.0014606289,0.00038625416,0.00051336526,0.0010948116,0.00040925888,0.3813076,0.09723627,0.08295175,0.43214345,0.00042113697],"about_ca_topic_score_codex":0.0033027504,"about_ca_topic_score_gemma":0.0055800155,"teacher_disagreement_score":0.09119383,"about_ca_system_score_codex":0.0020850443,"about_ca_system_score_gemma":0.0020862294,"threshold_uncertainty_score":0.30507374},"labels":[],"label_agreement":null},{"id":"W4410035960","doi":"10.1007/978-3-031-87499-4_18","title":"Parametric Automata for Dynamic Access Control Policies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","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":"Université du Québec en Outaouais; Institut Universitaire de Gériatrie de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Automaton; Parametric statistics; Distributed computing; Theoretical computer science; Mathematics","score_opus":0.020111691967174633,"score_gpt":0.3337703464663409,"score_spread":0.3136586544991663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410035960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040123807,0.0005058034,0.9798171,0.00037692054,0.00015683912,0.00005208177,0.00025840427,0.00090489443,0.013915698],"genre_scores_gemma":[0.47444978,0.0017886852,0.4763332,0.000389976,0.00032398265,0.0008708796,0.0011673202,0.0007355494,0.043940715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986864,0.00037622114,0.00013546465,0.00026529498,0.0003904494,0.0001461106],"domain_scores_gemma":[0.99632555,0.002433622,0.0001307309,0.0007281834,0.00030164595,0.00008020326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010014566,0.0010187445,0.0011085047,0.00077386486,0.0009168491,0.0031919882,0.0019196703,0.0017826452,0.011758091],"category_scores_gemma":[0.0072305454,0.00089029793,0.0014738672,0.0012186419,0.0021274125,0.0053766975,0.0022455372,0.0045963153,0.0024663988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033694832,0.00002057774,0.00008595542,0.00008578361,0.000012165067,0.00007892596,0.00018988432,0.042226106,0.0010266077,0.9155556,0.0030047202,0.037679862],"study_design_scores_gemma":[0.000009748747,0.00001083175,0.00003549197,0.000025443123,0.000008892383,0.000060230905,0.000038705184,0.17158133,0.0006031889,0.819285,0.008324962,0.000016157679],"about_ca_topic_score_codex":0.0022158509,"about_ca_topic_score_gemma":0.0018174086,"teacher_disagreement_score":0.011758091,"about_ca_system_score_codex":0.0023318457,"about_ca_system_score_gemma":0.0011135293,"threshold_uncertainty_score":0.039334714},"labels":[],"label_agreement":null},{"id":"W4410036589","doi":"10.1007/978-3-031-87499-4_22","title":"Enhancing Autonomy of Context-Aware Self-healing in Fog Native Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Autonomy; Context (archaeology); Self-healing; Human–computer interaction","score_opus":0.015175086656802332,"score_gpt":0.24540886835713271,"score_spread":0.23023378170033038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410036589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3415676,0.0013054595,0.62626606,0.00023814653,0.00023694904,0.000078161946,0.00006597355,0.0016409662,0.028600654],"genre_scores_gemma":[0.9642651,0.00021363977,0.03214156,0.000040715848,0.000021209335,0.000020225316,0.000037918388,0.000044768087,0.0032148128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990356,0.000012656699,0.000003466021,0.000021803175,0.000027391005,0.000031158124],"domain_scores_gemma":[0.9998603,0.000037467733,0.00001132743,0.00003243864,0.000027591688,0.000030874304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012334752,0.00027485637,0.00025327684,0.00014531324,0.0004148182,0.0007320843,0.0006018589,0.00030027234,0.0012290312],"category_scores_gemma":[0.00034607048,0.00013351419,0.000191798,0.00013153981,0.00032332612,0.0008730748,0.0012448801,0.0005390584,0.00024330082],"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.00055467366,0.0006818261,0.0037496504,0.00037082355,0.00009991179,0.0007825309,0.002400686,0.12146319,0.35953948,0.048875686,0.0065767914,0.45490468],"study_design_scores_gemma":[0.00003806716,0.00035873646,0.0066465633,0.00006955269,0.000082258084,0.00089443754,0.0010566596,0.8329642,0.078137726,0.05490741,0.024781048,0.00006329789],"about_ca_topic_score_codex":0.0010058642,"about_ca_topic_score_gemma":0.0015713507,"teacher_disagreement_score":0.0012290312,"about_ca_system_score_codex":0.00015569586,"about_ca_system_score_gemma":0.0002755614,"threshold_uncertainty_score":0.004111469},"labels":[],"label_agreement":null},{"id":"W4410038344","doi":"10.1007/978-3-031-87499-4_16","title":"Does Gender Matter? Examining and Mitigating Gender Bias in Fake News Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","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":"Université de Montréal","funders":"","keywords":"Computer science; Gender bias; Fake news; Data science; Internet privacy; Psychology; Social psychology","score_opus":0.06449517570415131,"score_gpt":0.30253221217999543,"score_spread":0.23803703647584412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410038344","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.91927475,0.0072051133,0.019516494,0.008217421,0.0005310101,0.00012706197,0.0005795429,0.00008733682,0.044461228],"genre_scores_gemma":[0.9911177,0.0009541038,0.0041699065,0.0004933966,0.00025350114,0.00002026674,0.0000962569,0.000020457665,0.0028744119],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940812,0.0034960732,0.00022068895,0.00059046195,0.0012494609,0.00036207293],"domain_scores_gemma":[0.84551287,0.13101012,0.013915615,0.0035470387,0.005160355,0.0008540134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012769968,0.000483134,0.0005606621,0.0013199728,0.00091974693,0.002546535,0.00063933094,0.0014744378,0.0044550663],"category_scores_gemma":[0.11338416,0.0003517205,0.00038237244,0.0010993928,0.0013365174,0.004411625,0.0010495175,0.0013473532,0.0009008903],"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.0025220239,0.0007253377,0.5164652,0.00082344684,0.00048831553,0.000808583,0.0055986075,0.003999548,0.008653379,0.031411476,0.010317541,0.41818658],"study_design_scores_gemma":[0.00017851965,0.0020743401,0.75713724,0.001089541,0.0016176993,0.0021713993,0.013654864,0.07384315,0.027114749,0.094710514,0.02618337,0.00022472588],"about_ca_topic_score_codex":0.0038548198,"about_ca_topic_score_gemma":0.0051414277,"teacher_disagreement_score":0.012769968,"about_ca_system_score_codex":0.0008462415,"about_ca_system_score_gemma":0.0009580726,"threshold_uncertainty_score":0.067534864},"labels":[],"label_agreement":null},{"id":"W4410041376","doi":"10.1007/978-3-031-87499-4_14","title":"A Systematic Evaluation of Non-SDK Interface Restrictions in Android: Bridging the Gap Between Guidelines and Practice","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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 Saskatchewan","funders":"","keywords":"Bridging (networking); Computer science; Android (operating system); Android application; Human–computer interaction; Operating system; Computer security","score_opus":0.06034111958745908,"score_gpt":0.3679320431394235,"score_spread":0.30759092355196443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410041376","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.72142804,0.0906059,0.102443054,0.00620248,0.0007902519,0.027752444,0.0059458315,0.0017168081,0.043115217],"genre_scores_gemma":[0.81305605,0.022168845,0.14302948,0.0026455487,0.00013270297,0.010492866,0.0031661561,0.0005666275,0.0047416906],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.8948642,0.058216948,0.016102822,0.0044517727,0.02472199,0.0016422559],"domain_scores_gemma":[0.53356636,0.33647367,0.03276223,0.022957144,0.071931586,0.0023090148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07531177,0.0010771521,0.0013261625,0.0069144717,0.0017582095,0.0038354467,0.0023207422,0.0016663714,0.0026106478],"category_scores_gemma":[0.27818424,0.0008525984,0.0016473148,0.0027914962,0.0031727175,0.0049214456,0.0047228164,0.0021110093,0.0009906188],"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.0028975643,0.0015460352,0.046806034,0.058587417,0.001114623,0.00061874476,0.0421179,0.0010887482,0.009342781,0.01026274,0.014064178,0.8115532],"study_design_scores_gemma":[0.0022118825,0.0215377,0.19235069,0.24795827,0.011596301,0.004757928,0.07595468,0.008872187,0.07038254,0.019575506,0.3438062,0.0009960678],"about_ca_topic_score_codex":0.0037865941,"about_ca_topic_score_gemma":0.010682675,"teacher_disagreement_score":0.07531177,"about_ca_system_score_codex":0.003924035,"about_ca_system_score_gemma":0.01238056,"threshold_uncertainty_score":0.39829147},"labels":[],"label_agreement":null},{"id":"W4410041639","doi":"10.1007/978-3-031-87499-4_2","title":"Advanced Real-Time Detection of Cyber Threat Information from Tweets","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Université du Québec en Outaouais; Cégep de l'Outaouais","funders":"","keywords":"Computer science; Computer security","score_opus":0.005970477156394595,"score_gpt":0.23160876920807236,"score_spread":0.22563829205167776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410041639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24604397,0.003754032,0.7136026,0.00094459514,0.0012422077,0.000286574,0.0030017109,0.008759916,0.022364324],"genre_scores_gemma":[0.6526448,0.0018091092,0.3107008,0.00023474415,0.00074271293,0.00015858457,0.0042149182,0.0002416858,0.029252652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997404,0.00002873502,0.000010792685,0.00005130893,0.0001313685,0.000037300888],"domain_scores_gemma":[0.99949694,0.00023185866,0.000050117374,0.00005367367,0.00013787307,0.000029532192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027830838,0.0007285383,0.00044180852,0.0013017575,0.00025010257,0.0008418101,0.00051219005,0.0006179379,0.0027572014],"category_scores_gemma":[0.000893203,0.00021241127,0.0003181354,0.00066800293,0.00018096458,0.0008743968,0.0005235054,0.0005065775,0.002631307],"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.0006121791,0.00021002897,0.0036135486,0.00026561267,0.00005587187,0.00027615673,0.00013507235,0.009090414,0.2842632,0.0025051597,0.014585866,0.6843869],"study_design_scores_gemma":[0.00003608419,0.00052617147,0.011080776,0.000057228644,0.00009175592,0.0012830759,0.00021387606,0.67519546,0.2749794,0.0066380003,0.029829687,0.00006846656],"about_ca_topic_score_codex":0.00045197472,"about_ca_topic_score_gemma":0.001010257,"teacher_disagreement_score":0.0027572014,"about_ca_system_score_codex":0.0001775021,"about_ca_system_score_gemma":0.00020407213,"threshold_uncertainty_score":0.0092237},"labels":[],"label_agreement":null},{"id":"W4410041804","doi":"10.1007/978-3-031-87499-4_12","title":"Drone Anomaly Detection: Dataset and Unsupervised Machine Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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 Windsor; Research and Productivity Council; University of Victoria","funders":"","keywords":"Computer science; Anomaly detection; Drone; Artificial intelligence; Unsupervised learning; Machine learning","score_opus":0.011007468913122789,"score_gpt":0.23732606440724383,"score_spread":0.22631859549412103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410041804","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1210846,0.00141837,0.04299493,0.00073757814,0.0010986069,0.0012803602,0.7799471,0.039939053,0.011499403],"genre_scores_gemma":[0.051627792,0.00032455954,0.03814934,0.00010342104,0.00007834718,0.00056320045,0.90389913,0.0005290299,0.0047251834],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988269,0.00010039206,0.00011247903,0.00031383487,0.0005172718,0.00012903128],"domain_scores_gemma":[0.9983069,0.00020119708,0.00011109674,0.0006841776,0.00056792825,0.0001287305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086244754,0.0014687316,0.0008118319,0.0026429824,0.0006606348,0.0009751126,0.0021870534,0.0011051891,0.0039602835],"category_scores_gemma":[0.0025741924,0.00041348222,0.00093933556,0.002606829,0.00038498914,0.000883449,0.001164062,0.0015107478,0.007187143],"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.00061287417,0.001119773,0.0144186765,0.00085204776,0.00021395438,0.00019886334,0.0001237672,0.01701153,0.010287474,0.0014866667,0.72914386,0.22453056],"study_design_scores_gemma":[0.00061288296,0.0011230622,0.0903885,0.00036745964,0.00022338307,0.0018172357,0.00064594956,0.21990988,0.06699348,0.007840489,0.609691,0.00038665472],"about_ca_topic_score_codex":0.013635335,"about_ca_topic_score_gemma":0.026089083,"teacher_disagreement_score":0.013635335,"about_ca_system_score_codex":0.00077506487,"about_ca_system_score_gemma":0.0012659271,"threshold_uncertainty_score":0.027111948},"labels":[],"label_agreement":null},{"id":"W4410041812","doi":"10.1007/978-3-031-87499-4_11","title":"Evaluating Large Language Models on Cybersecurity Knowledge and Skills: A Comparative Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Computer security; Natural language processing; Software engineering; Artificial intelligence","score_opus":0.026115603272532324,"score_gpt":0.32918242111901747,"score_spread":0.30306681784648515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410041812","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.9675066,0.003106671,0.018492034,0.00097014563,0.00006941611,0.00018245315,0.0010226464,0.00022603279,0.008423966],"genre_scores_gemma":[0.99122405,0.00047127332,0.0051357537,0.00012980179,0.000041822543,0.00016704338,0.0016994292,0.00011181806,0.0010190811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97999495,0.015732536,0.0007887,0.0013710768,0.0016720945,0.00044058505],"domain_scores_gemma":[0.27973565,0.7059074,0.0037043958,0.0051298337,0.00442982,0.0010929782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03977222,0.0012644539,0.0015226122,0.00445433,0.0009350882,0.005898515,0.0036848057,0.0027109578,0.009731876],"category_scores_gemma":[0.19056396,0.0007648953,0.0025068175,0.003868544,0.0027964849,0.013434232,0.0034480158,0.003277802,0.0012608711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.040227614,0.008752159,0.23067752,0.00253653,0.007536792,0.00073782424,0.008754796,0.37141967,0.0037051288,0.05002374,0.009099823,0.26652837],"study_design_scores_gemma":[0.002012466,0.0066628437,0.122010134,0.00066711754,0.004602876,0.0003839053,0.0072042826,0.7655661,0.0027923915,0.08419646,0.0035225756,0.0003787743],"about_ca_topic_score_codex":0.010445958,"about_ca_topic_score_gemma":0.008083645,"teacher_disagreement_score":0.03977222,"about_ca_system_score_codex":0.004913223,"about_ca_system_score_gemma":0.0016629677,"threshold_uncertainty_score":0.21033818},"labels":[],"label_agreement":null},{"id":"W4410042325","doi":"10.1007/978-3-031-87499-4_3","title":"Mitigating Spillover Effects of Ransomware in Financial Markets: Lessons from the LockBit Attacks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cybercrime and Law Enforcement Studies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Ransomware; Computer science; Spillover effect; Computer security; Financial market; Financial system; Finance; Business; Malware; Macroeconomics; Economics","score_opus":0.010391710303243717,"score_gpt":0.24924097896725791,"score_spread":0.2388492686640142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410042325","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45297647,0.023796095,0.19593789,0.026135452,0.0008884957,0.00021840865,0.00021753744,0.00049982674,0.29932982],"genre_scores_gemma":[0.97025585,0.0051528714,0.0067322473,0.0007534221,0.00026765434,0.000029774501,0.000032665423,0.000032543132,0.01674301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994312,0.00021850574,0.000013821568,0.000055373923,0.00011488273,0.00016618095],"domain_scores_gemma":[0.9956937,0.0028706098,0.0005421978,0.0003104362,0.0003979372,0.00018508217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015979161,0.0010144887,0.00094877585,0.0005388223,0.00092977827,0.0025078703,0.0011566983,0.0030460388,0.009825745],"category_scores_gemma":[0.0059718546,0.00035165157,0.0005257108,0.0005231565,0.001849682,0.005129357,0.0023168263,0.0040963893,0.0008605747],"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.00031466899,0.0006189317,0.0074585364,0.00044234656,0.00018318789,0.0010858354,0.00078056136,0.116044246,0.003405537,0.57611203,0.026263205,0.26729092],"study_design_scores_gemma":[0.00013719028,0.00080660114,0.00723033,0.00037092206,0.0002109608,0.0008327897,0.002286862,0.24242131,0.0047480515,0.71290845,0.02792399,0.00012259062],"about_ca_topic_score_codex":0.0022450823,"about_ca_topic_score_gemma":0.0021644682,"teacher_disagreement_score":0.009825745,"about_ca_system_score_codex":0.000627662,"about_ca_system_score_gemma":0.00094303186,"threshold_uncertainty_score":0.032870352},"labels":[],"label_agreement":null},{"id":"W4410043269","doi":"10.1007/978-3-031-87499-4_7","title":"An Approach to Determine a System’s Behavioural Security Posture","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Computer science; Computer security; Human–computer interaction; Artificial intelligence","score_opus":0.015172606200020299,"score_gpt":0.2389106923577175,"score_spread":0.2237380861576972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410043269","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.030602533,0.00010546522,0.9489704,0.00018931832,0.000053758897,0.00019188966,0.00019546135,0.00069867616,0.018992469],"genre_scores_gemma":[0.48140833,0.0001506874,0.5047608,0.00013856762,0.000026259513,0.00029594632,0.00034592632,0.000091663365,0.012781748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903333,0.00016368656,0.00005038385,0.00025789137,0.0003925397,0.00010217126],"domain_scores_gemma":[0.998738,0.00046356895,0.00013475679,0.00015364806,0.00044601146,0.00006405224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009314252,0.0008367112,0.0004374891,0.00292385,0.00074117316,0.0017551933,0.0008563204,0.0010438563,0.005733187],"category_scores_gemma":[0.0031208894,0.00036715053,0.0008568758,0.0011425241,0.0011464636,0.0016602048,0.0012724675,0.0010628889,0.0018498792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036958992,0.0006555687,0.034258563,0.00042156255,0.00023280297,0.00040078734,0.0023098367,0.0565172,0.10584977,0.16720635,0.005551435,0.62622654],"study_design_scores_gemma":[0.00004807516,0.0007991194,0.032323014,0.00014663921,0.00015085028,0.00070744834,0.00200152,0.81405896,0.024375387,0.11186278,0.013387786,0.00013842457],"about_ca_topic_score_codex":0.0053359875,"about_ca_topic_score_gemma":0.007194895,"teacher_disagreement_score":0.005733187,"about_ca_system_score_codex":0.0012789394,"about_ca_system_score_gemma":0.0012842268,"threshold_uncertainty_score":0.019179463},"labels":[],"label_agreement":null},{"id":"W4410043434","doi":"10.1007/978-3-031-87499-4_13","title":"A Tool for Enabling Scalable Automation in Security Control Selection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Computer science; Selection (genetic algorithm); Scalability; Automation; Security controls; Control (management); Software engineering; Computer security; Database; Artificial intelligence; Engineering","score_opus":0.007553656461580168,"score_gpt":0.23331037803920887,"score_spread":0.22575672157762872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410043434","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.0017061371,0.00010024636,0.97412914,0.0001176634,0.00012524117,0.000060074122,0.00022661664,0.017743126,0.005791814],"genre_scores_gemma":[0.10751759,0.00030076,0.871088,0.0003626675,0.00014344153,0.00034366234,0.0011565656,0.003647681,0.01543957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984475,0.00026986527,0.00012632346,0.00027225146,0.00073611236,0.00014801406],"domain_scores_gemma":[0.9973896,0.0012466263,0.00015860512,0.00080301205,0.00028774125,0.000114407325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013826493,0.0011922495,0.00079739606,0.0013039787,0.00093993894,0.0027845758,0.0022897644,0.0013455278,0.024016058],"category_scores_gemma":[0.0056879506,0.0009957474,0.001131767,0.0013538754,0.0010747705,0.003694155,0.003581436,0.0026186586,0.006867699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000524835,0.00026007247,0.0010167476,0.00048107054,0.0001218232,0.0008182408,0.00051259145,0.044236254,0.0370144,0.20592813,0.0674365,0.6416493],"study_design_scores_gemma":[0.00013706203,0.00016967891,0.0004146714,0.00018796007,0.00010300403,0.0006836404,0.00010031039,0.5994117,0.05286771,0.19309029,0.15272704,0.00010696984],"about_ca_topic_score_codex":0.0011545385,"about_ca_topic_score_gemma":0.0018404549,"teacher_disagreement_score":0.024016058,"about_ca_system_score_codex":0.00046546746,"about_ca_system_score_gemma":0.0008914851,"threshold_uncertainty_score":0.0803417},"labels":[],"label_agreement":null},{"id":"W4410061237","doi":"10.1007/978-981-96-4448-3_9","title":"Computing Approximate Mixed Nash Equilibria for Symmetric Weighted Congestion Games","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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 Windsor","funders":"","keywords":"Computer science; Nash equilibrium; Mathematical economics; Mathematical optimization; Mathematics","score_opus":0.05310495471577022,"score_gpt":0.33757603979365974,"score_spread":0.28447108507788954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410061237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15485984,0.00026087963,0.8369485,0.0003179862,0.00005277178,0.00014489001,0.00032036152,0.00096370804,0.0061310194],"genre_scores_gemma":[0.71918595,0.00016415796,0.27373722,0.000093365146,0.000055724988,0.00020999847,0.0009194698,0.00027527762,0.005358754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864227,0.00048489546,0.00007852332,0.00030134356,0.00030264823,0.00019026338],"domain_scores_gemma":[0.9941176,0.0043699327,0.00031538407,0.00049552805,0.00043303653,0.00026849567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020541844,0.0015383177,0.0020892096,0.001628083,0.0009579335,0.003441298,0.003089799,0.0016934348,0.009169232],"category_scores_gemma":[0.015523347,0.0012186848,0.0011023569,0.0017225246,0.0014326192,0.005487304,0.0029864656,0.0017463871,0.00092505256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005502953,0.00017586112,0.0017932309,0.00016325242,0.000119855285,0.0000828923,0.00016401254,0.87543553,0.0011760946,0.061479274,0.0018745981,0.05698502],"study_design_scores_gemma":[0.000012309923,0.000017617383,0.000063978834,0.000005546824,0.0000067166516,0.000009185531,0.000031324722,0.954167,0.0002896247,0.045263465,0.00012922009,0.000003986192],"about_ca_topic_score_codex":0.005583975,"about_ca_topic_score_gemma":0.009285478,"teacher_disagreement_score":0.009169232,"about_ca_system_score_codex":0.0022785151,"about_ca_system_score_gemma":0.0016021987,"threshold_uncertainty_score":0.0306741},"labels":[],"label_agreement":null},{"id":"W4410061426","doi":"10.1007/978-981-96-4448-3_11","title":"Broadcasting and Three List Subtraction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Subtraction; Telecommunications; Computer network; Arithmetic; Mathematics","score_opus":0.023856134428355102,"score_gpt":0.2866058865756826,"score_spread":0.2627497521473275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410061426","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.044915818,0.0029298817,0.20930716,0.003613971,0.0019057315,0.00012642347,0.0007125492,0.00327281,0.73321563],"genre_scores_gemma":[0.4103079,0.0025644237,0.11838403,0.001301352,0.00061465864,0.00016894274,0.0014346861,0.001787236,0.46343678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00011676301,0.00003170313,0.00011433668,0.00020945749,0.0001421889],"domain_scores_gemma":[0.99899906,0.00040425186,0.000044103985,0.0003047395,0.00017414975,0.00007383345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045924945,0.00080335943,0.00081157126,0.0013410891,0.0026827175,0.0026263103,0.0014559319,0.0009884307,0.038731135],"category_scores_gemma":[0.0024395986,0.000480755,0.0007755059,0.0029331062,0.0016922631,0.0048819366,0.0020782424,0.0025426464,0.010062362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010546012,0.000042491658,0.00007441831,0.00008210776,0.0000074859167,0.00009103464,0.00023140691,0.0008143512,0.002508036,0.912229,0.016221292,0.06759289],"study_design_scores_gemma":[0.000029992916,0.00002414814,0.00011936418,0.000032509008,0.000023676577,0.0002257726,0.00013165896,0.0040141107,0.005500766,0.91071326,0.07915618,0.000028603943],"about_ca_topic_score_codex":0.0020691592,"about_ca_topic_score_gemma":0.0024784482,"teacher_disagreement_score":0.038731135,"about_ca_system_score_codex":0.0016813067,"about_ca_system_score_gemma":0.0011076723,"threshold_uncertainty_score":0.12956852},"labels":[],"label_agreement":null},{"id":"W4410077621","doi":"10.1007/978-981-96-4445-2_19","title":"Acyclically Edge Color Triangle-free Toroidal Graphs in $$\\varDelta + 2$$ Colors","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Toroid; Computer science; Enhanced Data Rates for GSM Evolution; Computer graphics (images); Combinatorics; Computer vision; Physics; Mathematics; Nuclear physics","score_opus":0.012943836781971658,"score_gpt":0.23486119765572597,"score_spread":0.2219173608737543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410077621","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.3246257,0.0007740342,0.3086747,0.0012122147,0.00074344175,0.00037557643,0.00488815,0.0038591821,0.3548471],"genre_scores_gemma":[0.7241807,0.0009202183,0.16270863,0.00070661976,0.00010150334,0.00030327178,0.004679096,0.0011790633,0.1052209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996778,0.000044714103,0.000013394135,0.000079189835,0.00007160539,0.00011331029],"domain_scores_gemma":[0.9993857,0.00016927304,0.000058988546,0.00015438671,0.00012615934,0.0001054845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020575887,0.0006675546,0.0005046805,0.0006741041,0.0013007375,0.0017695786,0.0010653087,0.0005289488,0.021972496],"category_scores_gemma":[0.0008949178,0.00049707625,0.0004672666,0.0014211148,0.00090663525,0.001698842,0.0010108381,0.0013914076,0.0033406848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048098247,0.00010980788,0.0006456434,0.0003634187,0.000030866053,0.00021750736,0.00045506837,0.015795825,0.021663383,0.8296961,0.04030827,0.09023311],"study_design_scores_gemma":[0.00011491483,0.00012573879,0.0013002588,0.0001075182,0.000071192575,0.0004934374,0.00052507455,0.035297703,0.022600112,0.8276738,0.111629196,0.00006109766],"about_ca_topic_score_codex":0.004355083,"about_ca_topic_score_gemma":0.009174354,"teacher_disagreement_score":0.021972496,"about_ca_system_score_codex":0.0010489728,"about_ca_system_score_gemma":0.00075995293,"threshold_uncertainty_score":0.07350534},"labels":[],"label_agreement":null},{"id":"W4410077660","doi":"10.1007/978-981-96-4445-2_18","title":"Semi-online Multiprocessor Scheduling with Known Largest Job Processing Time","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Alberta","funders":"","keywords":"Computer science; Multiprocessing; Multiprocessor scheduling; Parallel computing; Scheduling (production processes); Rate-monotonic scheduling; Fair-share scheduling; Operating system; Mathematical optimization; Schedule","score_opus":0.008099450646318984,"score_gpt":0.22349032818865575,"score_spread":0.21539087754233677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410077660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0462594,0.0011240644,0.9403827,0.00038685178,0.00042481523,0.00012646051,0.00038236452,0.0019733552,0.008940005],"genre_scores_gemma":[0.6420816,0.0005758156,0.34755522,0.00020679693,0.00050845195,0.00022358843,0.0005380781,0.0005878699,0.0077225897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988919,0.00034142486,0.000082765706,0.00022309605,0.00027805218,0.00018279994],"domain_scores_gemma":[0.9947602,0.0029450515,0.00033433555,0.0011824964,0.00045342065,0.00032449074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019404616,0.0010121786,0.0016953044,0.00057374267,0.00074400986,0.0014663796,0.0026355544,0.0010625513,0.0042103706],"category_scores_gemma":[0.005527288,0.0007906296,0.00065221894,0.0012419216,0.00061778154,0.0023051735,0.0017955893,0.0016050746,0.0012870689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026633968,0.00059475587,0.00079549337,0.0008997493,0.000141464,0.00031289153,0.00013822982,0.659138,0.022809904,0.0404791,0.016682012,0.2553449],"study_design_scores_gemma":[0.000044676846,0.00010423264,0.00019438357,0.000014326543,0.0000125448005,0.000053479143,0.000010802049,0.97298133,0.0020520682,0.023342405,0.0011799206,0.000009916374],"about_ca_topic_score_codex":0.00073326495,"about_ca_topic_score_gemma":0.0013328234,"teacher_disagreement_score":0.0042103706,"about_ca_system_score_codex":0.00070255966,"about_ca_system_score_gemma":0.0017258502,"threshold_uncertainty_score":0.014085114},"labels":[],"label_agreement":null},{"id":"W4410077677","doi":"10.1007/978-981-96-4445-2_4","title":"Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Saskatchewan","funders":"","keywords":"Computer science; Grid; Plane (geometry); Algorithm; Computer graphics (images); Geometry; Mathematics","score_opus":0.016711050329856036,"score_gpt":0.25371778819145013,"score_spread":0.2370067378615941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410077677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010214931,0.00033856995,0.974812,0.00013707254,0.0001354079,0.00009437339,0.0004020027,0.0054249205,0.0084407395],"genre_scores_gemma":[0.063462265,0.00034548168,0.92522436,0.000076506665,0.000050500643,0.00015242938,0.0014815131,0.0016834816,0.007523458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00013503173,0.000057015513,0.00014365763,0.00039694546,0.00013550362],"domain_scores_gemma":[0.99773455,0.00088905636,0.00011838652,0.00069975504,0.0004471663,0.000111040674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006446658,0.0016800482,0.0017489818,0.0018491907,0.00076664845,0.0027773373,0.0029353187,0.0013250925,0.040284045],"category_scores_gemma":[0.0048290114,0.0012898258,0.0019805122,0.0037484036,0.0006354189,0.0039161923,0.002870267,0.0025553557,0.008834982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004006178,0.00015725133,0.00077079656,0.0006667549,0.00012832986,0.00016040559,0.00038396165,0.14646481,0.008907812,0.12457264,0.042617377,0.6747693],"study_design_scores_gemma":[0.00020230669,0.00007131706,0.0004030911,0.00006702039,0.000056749544,0.00016803962,0.00018067658,0.82574993,0.005857903,0.13883556,0.02835793,0.00004947574],"about_ca_topic_score_codex":0.007067837,"about_ca_topic_score_gemma":0.013810113,"teacher_disagreement_score":0.040284045,"about_ca_system_score_codex":0.0013018951,"about_ca_system_score_gemma":0.0010658827,"threshold_uncertainty_score":0.13476354},"labels":[],"label_agreement":null},{"id":"W4410134390","doi":"10.1007/978-3-031-91826-1_8","title":"Dazzle: Improved Adaptive Threshold Signatures from DDH","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision","score_opus":0.012471583490385437,"score_gpt":0.23240417905388475,"score_spread":0.2199325955634993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410134390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023651063,0.0014633066,0.942289,0.0008260109,0.001154562,0.00024989143,0.0007633821,0.011926447,0.017676357],"genre_scores_gemma":[0.3991015,0.0009827686,0.5320165,0.0012071511,0.0007708346,0.00039389875,0.0023454344,0.0017132699,0.06146861],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832505,0.00021701277,0.000103685874,0.00027787822,0.00089314947,0.00018325301],"domain_scores_gemma":[0.9988626,0.00021525302,0.0000676033,0.00059178186,0.00018552714,0.00007716167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007841865,0.00079708075,0.0012832597,0.0009631013,0.00073092186,0.0017400956,0.0017548676,0.0010541084,0.011062693],"category_scores_gemma":[0.0024153085,0.00044243122,0.00051428186,0.0013442374,0.00086937944,0.002923543,0.0039308006,0.0024578609,0.0056134234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014426318,0.00023675285,0.0004450969,0.0004168323,0.000083372106,0.00019334191,0.00021506552,0.017138068,0.064594075,0.1506896,0.03792211,0.72662306],"study_design_scores_gemma":[0.0004960516,0.00084666134,0.0009373331,0.00013913757,0.00012130033,0.0016589025,0.00012406716,0.32001418,0.16024266,0.3253677,0.18982272,0.0002292322],"about_ca_topic_score_codex":0.00029923866,"about_ca_topic_score_gemma":0.00036070883,"teacher_disagreement_score":0.011062693,"about_ca_system_score_codex":0.00080902857,"about_ca_system_score_gemma":0.00096128753,"threshold_uncertainty_score":0.037008345},"labels":[],"label_agreement":null},{"id":"W4410134433","doi":"10.1007/978-3-031-91826-1_11","title":"Faster SCALLOP from Non-prime Conductor Suborders in Medium Sized Quadratic Fields","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Calgary","funders":"Agence Nationale de la Recherche","keywords":"Conductor; Prime (order theory); Scallop; Computer science; Quadratic equation; Geometry; Mathematics; Combinatorics; Fishery","score_opus":0.011822030881131144,"score_gpt":0.24469022439970387,"score_spread":0.2328681935185727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410134433","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.17933674,0.0021467025,0.66774607,0.0019681202,0.0012466508,0.00022521579,0.0011988729,0.017963508,0.12816814],"genre_scores_gemma":[0.66856813,0.0009077358,0.24778403,0.0009690473,0.0006154067,0.00026591858,0.0021024328,0.00564086,0.073146366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892247,0.00014036035,0.00005565139,0.00014313788,0.0005186179,0.00021981142],"domain_scores_gemma":[0.9975049,0.0010259616,0.0000939691,0.000917703,0.0003246787,0.00013294729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010977837,0.0010433412,0.0011211829,0.0011000669,0.0012282799,0.0020371007,0.0013238746,0.0005801368,0.029073354],"category_scores_gemma":[0.0046464615,0.0005009221,0.00094770116,0.0016582357,0.0014826631,0.005417881,0.0034247702,0.0020901572,0.0065929913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018949965,0.00026288527,0.0016253119,0.00090401253,0.00009779289,0.00042611366,0.0007751087,0.038334873,0.022988314,0.42979032,0.09293363,0.4099666],"study_design_scores_gemma":[0.00025273144,0.00026503915,0.0006485368,0.00016071713,0.000071517214,0.0002691503,0.00022277259,0.14588581,0.02835398,0.7818176,0.041983355,0.00006874707],"about_ca_topic_score_codex":0.0014341432,"about_ca_topic_score_gemma":0.0028382447,"teacher_disagreement_score":0.029073354,"about_ca_system_score_codex":0.0014390773,"about_ca_system_score_gemma":0.0011790954,"threshold_uncertainty_score":0.09726006},"labels":[],"label_agreement":null},{"id":"W4410183472","doi":"10.1007/978-3-031-91832-2_8","title":"Arctic: Lightweight and Stateless Threshold Schnorr Signatures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Ontario Drive & Gear (Canada); University of Waterloo","funders":"","keywords":"Stateless protocol; Computer science; Computer network","score_opus":0.009335041738585457,"score_gpt":0.23189141602712102,"score_spread":0.22255637428853556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410183472","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.022023372,0.0019533334,0.86534697,0.0011691828,0.00082543073,0.00017398244,0.0010290365,0.018959176,0.08851949],"genre_scores_gemma":[0.45533472,0.0024457362,0.34843144,0.0009801673,0.0006603592,0.00031795682,0.0025992382,0.0037759154,0.18545443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820244,0.00026611568,0.00009179248,0.00024307388,0.000949507,0.00024711588],"domain_scores_gemma":[0.99884427,0.00031163092,0.00007664278,0.0004703436,0.00022407649,0.00007290144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090539,0.000824602,0.0008926491,0.0011628052,0.001172364,0.0032482322,0.00151209,0.0010947911,0.014761456],"category_scores_gemma":[0.0032808587,0.0007311531,0.00060983683,0.0016008843,0.0014169033,0.006585865,0.0037691342,0.0022339914,0.011471879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011286379,0.00012322368,0.00025177925,0.00032358136,0.000046612895,0.00015411028,0.0004028401,0.012043595,0.022940645,0.57924896,0.048389032,0.33494696],"study_design_scores_gemma":[0.000102153404,0.00018768219,0.000272104,0.00012909166,0.00006869278,0.00047999693,0.0001507117,0.069291696,0.047641423,0.7070726,0.17447503,0.00012872381],"about_ca_topic_score_codex":0.0009204482,"about_ca_topic_score_gemma":0.0013230167,"teacher_disagreement_score":0.014761456,"about_ca_system_score_codex":0.0013063268,"about_ca_system_score_gemma":0.0017942608,"threshold_uncertainty_score":0.04938197},"labels":[],"label_agreement":null},{"id":"W4410206452","doi":"10.1007/978-3-031-77610-6_24","title":"Correction to: Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer graphics (images); Multimedia; Information retrieval","score_opus":0.008540598845464657,"score_gpt":0.30006140513790175,"score_spread":0.2915208062924371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410206452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054003554,0.02972103,0.14108346,0.038958766,0.2815645,0.00054297765,0.003940471,0.013839012,0.48494938],"genre_scores_gemma":[0.015377157,0.009029118,0.031397,0.0028379308,0.018572314,0.00016548096,0.0027140768,0.0026994455,0.91720736],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991806,0.000095786025,0.000055770397,0.00014408739,0.00043611202,0.000087733635],"domain_scores_gemma":[0.9979943,0.0002189516,0.000095952724,0.0003101616,0.001159699,0.00022089835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094791886,0.0014950288,0.0006835115,0.0019553495,0.00082649937,0.0021936535,0.001500112,0.0019361741,0.21981815],"category_scores_gemma":[0.0040062536,0.0005317995,0.00076383696,0.0011873121,0.00048651945,0.0015220462,0.0016285403,0.0023334313,0.11152348],"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.000072689705,0.00001879158,0.00007395427,0.00016512378,0.000011395419,0.000078843,0.00001413341,0.0004731045,0.0015099308,0.0034228882,0.8111251,0.18303405],"study_design_scores_gemma":[0.000016701639,0.00003255488,0.0007361839,0.00013364656,0.000011085655,0.0003937661,0.000018044282,0.0029866558,0.00324637,0.004311014,0.98808974,0.000024190123],"about_ca_topic_score_codex":0.0026232954,"about_ca_topic_score_gemma":0.0070647253,"teacher_disagreement_score":0.21981815,"about_ca_system_score_codex":0.00086224626,"about_ca_system_score_gemma":0.0019263743,"threshold_uncertainty_score":0.7353649},"labels":[],"label_agreement":null},{"id":"W4410216476","doi":"10.1007/978-3-031-88220-3_16","title":"UlcerGPT: A Multimodal Approach Leveraging Large Language and Vision Models for Diabetic Foot Ulcer Image Transcription","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diabetic Foot Ulcer Assessment and Management","field":"Medicine","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 Toronto; University Health Network","funders":"","keywords":"Computer science; Transcription (linguistics); Computer vision; Diabetic foot; Image (mathematics); Artificial intelligence; Diabetic foot ulcer; Foot (prosody); Natural language processing; Diabetes mellitus; Medicine; Linguistics","score_opus":0.013946162481594714,"score_gpt":0.28255866492229453,"score_spread":0.26861250244069984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410216476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023053601,0.0017016883,0.9020271,0.0005170883,0.0007629289,0.0006986952,0.008947163,0.055957805,0.0063339844],"genre_scores_gemma":[0.13776481,0.0013455255,0.8012185,0.00088339736,0.0005318597,0.0009537483,0.031441994,0.0036308805,0.022229265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992193,0.00014454398,0.000042679356,0.00028760676,0.00019583156,0.0001100493],"domain_scores_gemma":[0.9993331,0.0002616531,0.000031356765,0.0001262921,0.00018746697,0.000060090464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010530981,0.0023268468,0.0015476178,0.0021649182,0.00073059835,0.0017782858,0.001968656,0.0022083898,0.019371083],"category_scores_gemma":[0.0021161414,0.00070260384,0.002224732,0.0019382649,0.0003619282,0.00209766,0.0025942752,0.0019950839,0.015268826],"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.000707066,0.00034991556,0.0008809251,0.00025346386,0.00024527113,0.00041488817,0.00009078219,0.015260651,0.045992903,0.0011224283,0.046824776,0.8878569],"study_design_scores_gemma":[0.00012030778,0.00034785358,0.0025194562,0.00006080521,0.00022780099,0.000569481,0.00021204328,0.93133223,0.035253316,0.005943164,0.023307946,0.00010564945],"about_ca_topic_score_codex":0.011871488,"about_ca_topic_score_gemma":0.016835244,"teacher_disagreement_score":0.019371083,"about_ca_system_score_codex":0.00067935005,"about_ca_system_score_gemma":0.0009899084,"threshold_uncertainty_score":0.064802766},"labels":[],"label_agreement":null},{"id":"W4410216492","doi":"10.1007/978-3-031-87663-9_6","title":"A Comprehensive Approach to Handwriting Analysis for Alzheimer’s Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Handwriting; Artificial intelligence","score_opus":0.037011335309276985,"score_gpt":0.2821976279744096,"score_spread":0.24518629266513264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410216492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039288155,0.006056127,0.97044766,0.00029263587,0.00023201607,0.0002514776,0.0008664963,0.004891327,0.013033436],"genre_scores_gemma":[0.031262424,0.008925811,0.88873136,0.00045015258,0.00031257287,0.00025279378,0.0027834368,0.00065286126,0.066628635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938655,0.000043344407,0.00006142554,0.00014845977,0.00032306704,0.00003711569],"domain_scores_gemma":[0.99944526,0.0000791853,0.000031713425,0.00008903901,0.00030872656,0.00004615958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045688546,0.0014966726,0.0010492667,0.0028448582,0.0007170717,0.001746062,0.0012769592,0.0010019395,0.0063973954],"category_scores_gemma":[0.000796583,0.0005552047,0.0010859894,0.0020725727,0.00035444548,0.0013455836,0.001423189,0.0009739678,0.007627084],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032827284,0.00010229828,0.0006226011,0.00039901873,0.000087220506,0.00021827171,0.0001179397,0.0033921218,0.05018835,0.0035897014,0.018322809,0.9229269],"study_design_scores_gemma":[0.000036163,0.0005591984,0.023792995,0.0011172182,0.0005694914,0.007175851,0.00069133023,0.20825267,0.17369896,0.061392974,0.5224426,0.00027054825],"about_ca_topic_score_codex":0.0023179143,"about_ca_topic_score_gemma":0.0056864223,"teacher_disagreement_score":0.0063973954,"about_ca_system_score_codex":0.00037182402,"about_ca_system_score_gemma":0.0011434528,"threshold_uncertainty_score":0.021401405},"labels":[],"label_agreement":null},{"id":"W4410216540","doi":"10.1007/978-3-031-87663-9_34","title":"Optimizing Granularity for Enhanced Handwriting Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Granularity; Handwriting; Artificial intelligence; Programming language","score_opus":0.01610035009770196,"score_gpt":0.270233114205087,"score_spread":0.25413276410738506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410216540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046393313,0.00068376603,0.9386641,0.00008314776,0.000113080954,0.000055584725,0.00031782535,0.0100955535,0.0035936525],"genre_scores_gemma":[0.32837635,0.00032288232,0.6615674,0.000119528915,0.00007680333,0.00007871822,0.00080953824,0.001216454,0.007432429],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994795,0.00004958844,0.00004677135,0.0001381219,0.00020140246,0.00008462319],"domain_scores_gemma":[0.9989881,0.00036820208,0.00008177096,0.00031890057,0.00018671615,0.000056281402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872093,0.00093652995,0.00079833885,0.0008694893,0.00038832772,0.0012096075,0.00094955723,0.00055446534,0.008404779],"category_scores_gemma":[0.0018387651,0.00044731563,0.00044627962,0.0011172019,0.00024299805,0.0012154324,0.0014189017,0.0008248173,0.002515563],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006544923,0.00012397366,0.0008558193,0.00015973324,0.00003787396,0.00012128258,0.00006906059,0.025455596,0.20140438,0.003364334,0.0051309043,0.7626225],"study_design_scores_gemma":[0.00007143466,0.00026058021,0.0023184852,0.000035003508,0.000056993213,0.00028723016,0.000086439,0.7698295,0.20609148,0.010073509,0.010856676,0.000032712473],"about_ca_topic_score_codex":0.0018319337,"about_ca_topic_score_gemma":0.0037407225,"teacher_disagreement_score":0.008404779,"about_ca_system_score_codex":0.0004458138,"about_ca_system_score_gemma":0.00064070127,"threshold_uncertainty_score":0.028116822},"labels":[],"label_agreement":null},{"id":"W4410248697","doi":"10.1007/978-3-031-87663-9_25","title":"A Multi-model Approach for Personality Detection from Handwriting: Deep Features, Machine Learning, and Ensemble Techniques","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Handwriting; Artificial intelligence; Machine learning; Deep learning; Ensemble learning","score_opus":0.01895257687005201,"score_gpt":0.26394954817551,"score_spread":0.24499697130545797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410248697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051764578,0.0014321555,0.9426411,0.00029100807,0.0001771228,0.000048823742,0.00031800085,0.0018660404,0.0014611867],"genre_scores_gemma":[0.5138214,0.0010440726,0.47302616,0.0002270655,0.00023240023,0.00008921543,0.001031222,0.0002453042,0.010283238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958307,0.00008653763,0.000028215294,0.00013276034,0.00010278391,0.000066552035],"domain_scores_gemma":[0.9991285,0.0002849478,0.00008832324,0.00014433732,0.0002872668,0.00006654366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010239541,0.0010006555,0.0012444716,0.0012125474,0.0005111697,0.0009247036,0.00093727844,0.0008738909,0.0013150214],"category_scores_gemma":[0.0013829225,0.00046973038,0.0011854914,0.0012063099,0.00021316094,0.0012749376,0.0009906141,0.00160431,0.00093308085],"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.0001449318,0.00028273137,0.0036925778,0.000051376242,0.00026394633,0.000120171484,0.00007875208,0.07534028,0.016557174,0.0011561209,0.005257965,0.897054],"study_design_scores_gemma":[0.0000025187644,0.00004723001,0.0016350017,0.0000072458997,0.00003331347,0.00005949868,0.000014962596,0.9935528,0.0026706397,0.0014851949,0.000478586,0.000013065889],"about_ca_topic_score_codex":0.004174236,"about_ca_topic_score_gemma":0.007124811,"teacher_disagreement_score":0.004174236,"about_ca_system_score_codex":0.00037314088,"about_ca_system_score_gemma":0.00046688342,"threshold_uncertainty_score":0.008299887},"labels":[],"label_agreement":null},{"id":"W4410277212","doi":"10.1007/978-3-031-92747-8_12","title":"Virtual Exposure Bracketing for HDR Imaging Using Fuzzy Membership","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","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":"Saint Mary's University","funders":"","keywords":"Bracketing (phenomenology); Computer science; Fuzzy logic; Computer vision; Artificial intelligence; Computer graphics (images)","score_opus":0.02260006118908298,"score_gpt":0.27853214262346543,"score_spread":0.25593208143438245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410277212","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.013540777,0.000090031834,0.9843693,0.00002402224,0.000023804789,0.000021796808,0.000015852722,0.00030894257,0.0016055031],"genre_scores_gemma":[0.3272554,0.00016917846,0.6674578,0.00003542874,0.000028982464,0.000044506472,0.000069196765,0.00010827028,0.0048311274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997514,0.000036444373,0.000013691556,0.00006427107,0.000109349334,0.000024753697],"domain_scores_gemma":[0.9997563,0.00009374398,0.000019709996,0.00005322024,0.00006170555,0.000015357497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035383337,0.00032262685,0.00048786734,0.0003640387,0.0004074995,0.0006784639,0.0007739677,0.00045627807,0.006060933],"category_scores_gemma":[0.00079673145,0.00025976283,0.0004996812,0.00037287202,0.00033461754,0.0008002472,0.0007183867,0.0006676768,0.0007909792],"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.00036506026,0.00014324399,0.00043700598,0.00020538957,0.000028445862,0.00014493983,0.00032047654,0.06848683,0.21049422,0.02627683,0.0018448255,0.69125277],"study_design_scores_gemma":[0.000014447605,0.00021712254,0.00073700707,0.000027239124,0.000027747614,0.000280276,0.00008397061,0.905903,0.07673456,0.008676247,0.0072682183,0.000030200632],"about_ca_topic_score_codex":0.0011621509,"about_ca_topic_score_gemma":0.0012348313,"teacher_disagreement_score":0.006060933,"about_ca_system_score_codex":0.00033293167,"about_ca_system_score_gemma":0.0003321828,"threshold_uncertainty_score":0.020275831},"labels":[],"label_agreement":null},{"id":"W4410277248","doi":"10.1007/978-3-031-92747-8_2","title":"Triadic Patterns for Explainable Artificial Intelligence","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; McGill University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.04308642014187211,"score_gpt":0.29385569214015267,"score_spread":0.2507692719982806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410277248","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.005931501,0.010450359,0.83472145,0.003060385,0.0012805976,0.00013744127,0.0006326985,0.0009734931,0.14281212],"genre_scores_gemma":[0.2555016,0.012919786,0.61001486,0.0016288039,0.0018351956,0.0010647185,0.0023944036,0.0010979642,0.11354261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945277,0.00018603019,0.000060553935,0.00012219277,0.00013774633,0.000040710747],"domain_scores_gemma":[0.99908745,0.00043607425,0.00006190755,0.00028539842,0.00009269172,0.000036429825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084186107,0.00092955364,0.0007518259,0.001741612,0.0008199688,0.0022137328,0.0012367348,0.0011917606,0.030094434],"category_scores_gemma":[0.0025047972,0.0005557063,0.0011674623,0.0032668388,0.002190984,0.008106415,0.0018611018,0.0035972756,0.00602103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007409664,0.0000075450557,0.000035622397,0.00007763288,0.0000064163773,0.00003078434,0.00012666338,0.0004095019,0.00016317313,0.9734988,0.0047959182,0.020840542],"study_design_scores_gemma":[0.000003846598,0.000004758003,0.000034005585,0.000024140836,0.000004065786,0.00004834671,0.000028986939,0.0021562723,0.0001426062,0.9719838,0.025565747,0.000003512315],"about_ca_topic_score_codex":0.00058843015,"about_ca_topic_score_gemma":0.0006990044,"teacher_disagreement_score":0.030094434,"about_ca_system_score_codex":0.0009978209,"about_ca_system_score_gemma":0.0003366343,"threshold_uncertainty_score":0.10067594},"labels":[],"label_agreement":null},{"id":"W4410279748","doi":"10.1007/978-3-031-92741-6_7","title":"Three-Way Strategy Design for Conflict Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University; University of Regina","funders":"","keywords":"Computer science; Conflict analysis; Operations research; Management science; Conflict resolution; Political science; Mathematics; Law; Engineering","score_opus":0.048442277587148384,"score_gpt":0.2755098828574231,"score_spread":0.22706760527027472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410279748","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.003976241,0.000040426225,0.9928814,0.000028383978,0.00001157225,0.000108238724,0.000025630075,0.00015826842,0.0027696986],"genre_scores_gemma":[0.18532075,0.00006732816,0.81028545,0.000054490225,0.000007192493,0.000655961,0.00010859103,0.00009146009,0.003408817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960335,0.0022685206,0.0002512275,0.0004787007,0.0007057867,0.0002622992],"domain_scores_gemma":[0.99572194,0.002745897,0.00022435939,0.00047185813,0.0006836884,0.0001522659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037867595,0.0013416486,0.0009868038,0.0011839506,0.00081102777,0.0022795724,0.0019067408,0.0010939878,0.011247626],"category_scores_gemma":[0.006393002,0.0005710421,0.0012862405,0.0011324288,0.0011568873,0.0024259791,0.0021098154,0.0011955827,0.0013776309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009549554,0.00045779537,0.001315905,0.0006557828,0.00031784916,0.00018938507,0.0016338903,0.1390049,0.015048433,0.34444416,0.0032509628,0.49272594],"study_design_scores_gemma":[0.00019215276,0.0006209748,0.0003173095,0.00009681223,0.00018679547,0.00016203291,0.00051919185,0.7735753,0.012358713,0.20188256,0.0100258645,0.00006238549],"about_ca_topic_score_codex":0.00079406874,"about_ca_topic_score_gemma":0.0011043624,"teacher_disagreement_score":0.011247626,"about_ca_system_score_codex":0.0010735568,"about_ca_system_score_gemma":0.0015469593,"threshold_uncertainty_score":0.0376271},"labels":[],"label_agreement":null},{"id":"W4410279919","doi":"10.1007/978-3-031-92741-6_4","title":"A Decision-Theoretic Formulation of Three-Way Conflict Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision 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 Regina","funders":"","keywords":"Computer science; Operations research; Management science; Theoretical computer science; Mathematics; Engineering","score_opus":0.07849270183665025,"score_gpt":0.3763030176843653,"score_spread":0.29781031584771506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410279919","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.0027674423,0.00031585715,0.9743939,0.0008197021,0.00009349283,0.00007640536,0.00009359542,0.000036704823,0.021402866],"genre_scores_gemma":[0.3853258,0.0010144734,0.59796405,0.00057865115,0.00029168333,0.0006892773,0.00029888403,0.00008509616,0.013752076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550843,0.0025965807,0.00019642366,0.00037576325,0.0010338846,0.0002888791],"domain_scores_gemma":[0.9964051,0.0025275173,0.00030999773,0.00017939856,0.0004090862,0.0001688482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049532545,0.0014768239,0.0013340248,0.001780353,0.0012790858,0.00575628,0.0038988057,0.0022462648,0.010688069],"category_scores_gemma":[0.007104436,0.00083795545,0.0021493186,0.0034883718,0.003938635,0.0051008877,0.0027314902,0.0038988707,0.0010859708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001086684,0.000023448392,0.00006335831,0.00004388836,0.000022120921,0.000043211272,0.0000940318,0.037933663,0.0001633773,0.95435035,0.00086112146,0.0063904985],"study_design_scores_gemma":[0.0000081099415,0.0000138807,0.00003387279,0.000019331745,0.00001126753,0.00003964238,0.000052498443,0.12036684,0.00011222987,0.8767488,0.0025815873,0.00001188242],"about_ca_topic_score_codex":0.0019579746,"about_ca_topic_score_gemma":0.0016914472,"teacher_disagreement_score":0.010688069,"about_ca_system_score_codex":0.0028385455,"about_ca_system_score_gemma":0.0022327886,"threshold_uncertainty_score":0.035755157},"labels":[],"label_agreement":null},{"id":"W4410306275","doi":"10.1007/978-3-031-92744-7_7","title":"Rough Set Theory Applied to Feature Selection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Crandall University","funders":"","keywords":"Computer science; Rough set; Feature selection; Selection (genetic algorithm); Artificial intelligence; Set (abstract data type); Feature (linguistics); Set theory; Pattern recognition (psychology); Programming language","score_opus":0.012212543247337095,"score_gpt":0.23845380124112522,"score_spread":0.22624125799378814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410306275","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.0015152823,0.0064594173,0.98807657,0.00018508207,0.00023586658,0.00003455271,0.000069761474,0.00019411702,0.0032293682],"genre_scores_gemma":[0.1333536,0.0130763585,0.8441416,0.00015784119,0.0005984018,0.0002585764,0.00039202292,0.0001320868,0.007889566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854666,0.00053053215,0.000111522604,0.00014112979,0.0006152872,0.000054776498],"domain_scores_gemma":[0.9986771,0.0009767062,0.000049719085,0.000121231205,0.00015637936,0.000018766159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017106957,0.00086210534,0.00227666,0.0015298809,0.00041189362,0.0019440241,0.0014936863,0.00082475325,0.0033158688],"category_scores_gemma":[0.005337418,0.0005974945,0.0015551576,0.003042894,0.0009072648,0.0015888907,0.0009709737,0.0018805409,0.0011818261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010020148,0.000053034262,0.0003403247,0.00087338215,0.0002789867,0.00023827999,0.0002202721,0.18028466,0.0035815837,0.23771659,0.011158132,0.56515455],"study_design_scores_gemma":[0.000033750854,0.0001010294,0.00063413323,0.00015318958,0.00012814124,0.00029869034,0.00006126148,0.5152304,0.0028258746,0.452765,0.027699213,0.000069268506],"about_ca_topic_score_codex":0.0014858829,"about_ca_topic_score_gemma":0.00095655955,"teacher_disagreement_score":0.0033158688,"about_ca_system_score_codex":0.00074875186,"about_ca_system_score_gemma":0.0006396945,"threshold_uncertainty_score":0.011092663},"labels":[],"label_agreement":null},{"id":"W4410306278","doi":"10.1007/978-3-031-92744-7_19","title":"Finding Consistent Pairwise Comparisons with Genetic Algorithms","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Pairwise comparison; Algorithm; Genetic algorithm; Artificial intelligence; Machine learning","score_opus":0.12181166867934096,"score_gpt":0.3720249093119226,"score_spread":0.25021324063258166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410306278","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.0052771447,0.00029593022,0.9923821,0.00009686771,0.00004234643,0.00014076546,0.000058957045,0.0004140066,0.0012918474],"genre_scores_gemma":[0.043346714,0.00012046967,0.9548468,0.00008758247,0.00003693869,0.0002721737,0.00022590024,0.00017688246,0.0008864994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991915,0.0042010034,0.0004146524,0.0013777881,0.0018209905,0.00027057523],"domain_scores_gemma":[0.9800283,0.017090958,0.0006147783,0.0011025163,0.0010026944,0.00016076343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077818027,0.0026624973,0.004131207,0.005111352,0.0014587353,0.00209813,0.005637416,0.0036016619,0.0068052527],"category_scores_gemma":[0.03418208,0.0020042954,0.0032169216,0.0067082467,0.0025468124,0.0043770075,0.0030988366,0.003940171,0.0013582006],"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.0003639417,0.00033560707,0.0012045752,0.0005208419,0.0005056877,0.00021900017,0.00023875941,0.40603352,0.0026838337,0.031926446,0.005186276,0.55078155],"study_design_scores_gemma":[0.00010866035,0.00015096257,0.0002353418,0.00007637777,0.00011106437,0.00011260089,0.00007576432,0.89648104,0.0018593505,0.099365935,0.0013913221,0.00003159164],"about_ca_topic_score_codex":0.0026379093,"about_ca_topic_score_gemma":0.003000823,"teacher_disagreement_score":0.0077818027,"about_ca_system_score_codex":0.0013084904,"about_ca_system_score_gemma":0.0021437928,"threshold_uncertainty_score":0.041154623},"labels":[],"label_agreement":null},{"id":"W4410306440","doi":"10.1007/978-3-031-92744-7_28","title":"Concept-Oriented Attribute Reduction in Three-Way Concept Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University","funders":"","keywords":"Computer science; Reduction (mathematics); Formal concept analysis; Theoretical computer science; Algorithm; Mathematics","score_opus":0.01627322966049311,"score_gpt":0.24867921086366357,"score_spread":0.23240598120317046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410306440","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.006688438,0.0005838696,0.98946244,0.000121840065,0.00008639944,0.00006630048,0.00007077987,0.00019139309,0.002728578],"genre_scores_gemma":[0.1250587,0.00070373627,0.87038314,0.00009228933,0.000074049145,0.00019564632,0.00029975007,0.00009711546,0.003095542],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710053,0.0010358809,0.00023290045,0.00038853593,0.0010963226,0.0001459362],"domain_scores_gemma":[0.99862576,0.00077829504,0.000063624626,0.00025168923,0.00023721122,0.0000433977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832628,0.0005922709,0.001124669,0.0017347594,0.000730258,0.0029058508,0.0015237188,0.0005106433,0.0024500182],"category_scores_gemma":[0.0034541225,0.0004418489,0.0026999062,0.0030849352,0.0016646229,0.0026262477,0.002500254,0.002039878,0.000803374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016488426,0.0001833234,0.00072584365,0.0005857234,0.00023152103,0.00017141423,0.001026115,0.03370186,0.00978082,0.45298454,0.004433005,0.49601096],"study_design_scores_gemma":[0.00002242699,0.00010629205,0.0008494857,0.00008237318,0.00015945268,0.00037103568,0.00033127167,0.29496732,0.009607693,0.67789763,0.01553625,0.00006875289],"about_ca_topic_score_codex":0.00094727916,"about_ca_topic_score_gemma":0.00065587665,"teacher_disagreement_score":0.0029058508,"about_ca_system_score_codex":0.0007945593,"about_ca_system_score_gemma":0.00090469193,"threshold_uncertainty_score":0.014980495},"labels":[],"label_agreement":null},{"id":"W4410372278","doi":"10.1007/978-3-031-89704-7_7","title":"Private, Efficient and Scalable Kernel Learning for Medical Image Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Privy Council Office","funders":"","keywords":"Computer science; Kernel (algebra); Scalability; Artificial intelligence; Computer vision; Operating system; Discrete mathematics; Mathematics","score_opus":0.008931695269164623,"score_gpt":0.2643238253037175,"score_spread":0.2553921300345529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410372278","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.0052668117,0.00029640368,0.9910091,0.00019509964,0.000042251602,0.000025527423,0.00017117333,0.0022344918,0.00075905654],"genre_scores_gemma":[0.17960544,0.0005578263,0.80622363,0.00015945135,0.0001728423,0.00012122785,0.0012125787,0.0007472974,0.011199647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999081,0.00013810147,0.000056109773,0.0001558147,0.00046856242,0.00010039826],"domain_scores_gemma":[0.9982919,0.00032590688,0.00011143292,0.0008976224,0.00028987863,0.00008322152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217712,0.0007772238,0.0010635043,0.0007500788,0.0004163377,0.0014166038,0.0020653177,0.0012067914,0.006725543],"category_scores_gemma":[0.0034187164,0.0006337394,0.00078940165,0.0012268913,0.00064872246,0.0031776542,0.00343225,0.001908425,0.0048855515],"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.0005978593,0.00024779077,0.00074043364,0.00022321734,0.00012370145,0.0001645255,0.00009103065,0.060945194,0.070160806,0.03244038,0.025402602,0.80886245],"study_design_scores_gemma":[0.0000348127,0.00005664747,0.00047494462,0.000009309945,0.00002211037,0.0002860802,0.000025010071,0.93302524,0.021363076,0.03820864,0.006470372,0.000023674002],"about_ca_topic_score_codex":0.0011281128,"about_ca_topic_score_gemma":0.0022885608,"teacher_disagreement_score":0.006725543,"about_ca_system_score_codex":0.00058349007,"about_ca_system_score_gemma":0.0010353645,"threshold_uncertainty_score":0.022499204},"labels":[],"label_agreement":null},{"id":"W4410416269","doi":"10.1007/978-3-031-88930-1_2","title":"Some Uses of Modal Semirings","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Modal","score_opus":0.022905842909908856,"score_gpt":0.2804070665169648,"score_spread":0.2575012236070559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410416269","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.017566076,0.037781294,0.37762707,0.005444547,0.0012395402,0.000063910345,0.0002683813,0.00061753666,0.55939156],"genre_scores_gemma":[0.6350188,0.026362313,0.2151005,0.00201291,0.0021145893,0.00024469022,0.0004033013,0.0005847035,0.11815822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841595,0.0007398176,0.0001063609,0.00020901691,0.00040770706,0.00012106112],"domain_scores_gemma":[0.9975642,0.0017752696,0.000073615265,0.00033488395,0.00019032968,0.00006173576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025819195,0.00076312246,0.0006212087,0.0020359368,0.0018924114,0.0043215663,0.0011460154,0.0012452885,0.0092691295],"category_scores_gemma":[0.003809232,0.0009127885,0.0012703278,0.0023991184,0.0065526986,0.008913161,0.00219835,0.0030656632,0.0015114049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007911008,0.0000051654306,0.000021203,0.00002851614,0.0000030174663,0.000021330346,0.00023062802,0.00015601114,0.00017967787,0.99065125,0.0010644872,0.0076307915],"study_design_scores_gemma":[0.000005210444,0.000007348143,0.000040632403,0.000033238335,0.00000545352,0.000077298035,0.000063565494,0.0008895507,0.0003567732,0.96370965,0.03480344,0.000007819029],"about_ca_topic_score_codex":0.0009502187,"about_ca_topic_score_gemma":0.0011814187,"teacher_disagreement_score":0.0092691295,"about_ca_system_score_codex":0.002245503,"about_ca_system_score_gemma":0.00046488855,"threshold_uncertainty_score":0.031008303},"labels":[],"label_agreement":null},{"id":"W4410442391","doi":"10.1007/978-3-031-92369-2_26","title":"Inversion of Magnetic Data Using Learned Dictionaries and Scale Space","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geophysical and Geoelectrical Methods","field":"Earth and Planetary 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 British Columbia","funders":"","keywords":"Computer science; Inversion (geology); Scale (ratio); Space (punctuation); Artificial intelligence; Geology; Cartography; Seismology; Geography; Operating system","score_opus":0.030761810922624196,"score_gpt":0.25308801591065816,"score_spread":0.22232620498803396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410442391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010006589,0.0001754771,0.9864266,0.00012953203,0.00006820016,0.000017523169,0.00013580915,0.0012765798,0.0017636764],"genre_scores_gemma":[0.18288065,0.00045304425,0.80685633,0.00018861792,0.00015447225,0.0000617079,0.0012690924,0.00046717987,0.0076688514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998642,0.00002244888,0.000011354189,0.000034355122,0.00005193993,0.00001566222],"domain_scores_gemma":[0.9995049,0.00022156209,0.00003850848,0.00010877546,0.000109533285,0.000016779046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285956,0.0005924038,0.0005703676,0.0005579718,0.00021571008,0.00087717234,0.0007497379,0.0006323104,0.003656228],"category_scores_gemma":[0.0017698979,0.00044323597,0.0005537619,0.0010010379,0.00039743527,0.0011892483,0.00093889976,0.00096888887,0.002015863],"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.00015912979,0.0000774216,0.00074343494,0.00019579478,0.00010769806,0.00009062378,0.000098983146,0.18102683,0.039395794,0.008552964,0.0066937995,0.76285744],"study_design_scores_gemma":[0.000018486318,0.000025116828,0.00050005544,0.00001011458,0.000015776262,0.00007576919,0.000026063077,0.9813168,0.009289821,0.0056468723,0.0030620615,0.000013039887],"about_ca_topic_score_codex":0.0032212178,"about_ca_topic_score_gemma":0.0064812806,"teacher_disagreement_score":0.003656228,"about_ca_system_score_codex":0.0001919612,"about_ca_system_score_gemma":0.00064361625,"threshold_uncertainty_score":0.01223135},"labels":[],"label_agreement":null},{"id":"W4410455285","doi":"10.1007/978-3-031-92935-9_1","title":"Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Alberta","funders":"","keywords":"Bipartite graph; Regular polygon; Computer science; Combinatorics; Set (abstract data type); Mathematics; Graph; Geometry","score_opus":0.02357357690253381,"score_gpt":0.28097834642607944,"score_spread":0.25740476952354563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410455285","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12535836,0.0039034265,0.48569903,0.006846155,0.000897023,0.0002955826,0.002342781,0.00048840756,0.37416917],"genre_scores_gemma":[0.5884516,0.0047777006,0.23666337,0.0009452462,0.0012155533,0.0008277428,0.0040717954,0.0007590422,0.16228792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991571,0.00029989704,0.00003078299,0.00015544586,0.0002156679,0.00014117983],"domain_scores_gemma":[0.9978307,0.0015030475,0.00014821578,0.00017493074,0.00013910724,0.00020400088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010845264,0.0010514746,0.0014125442,0.0010020474,0.0023534365,0.0039445395,0.003028837,0.0021561834,0.022202436],"category_scores_gemma":[0.0054776147,0.0009089694,0.0013829225,0.002647816,0.0020007647,0.0056176465,0.002635563,0.0044881864,0.0019352031],"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.000091775444,0.000057690766,0.00010177447,0.00016546037,0.000020906627,0.000050988594,0.0001244255,0.023594545,0.000428054,0.92582196,0.023845697,0.025696717],"study_design_scores_gemma":[0.000032375672,0.000020432406,0.00016319592,0.00003432308,0.00001045765,0.000051731346,0.0001333503,0.050023217,0.00028964144,0.9401598,0.009066588,0.000014859464],"about_ca_topic_score_codex":0.003070555,"about_ca_topic_score_gemma":0.0037772397,"teacher_disagreement_score":0.022202436,"about_ca_system_score_codex":0.0021237158,"about_ca_system_score_gemma":0.0011043025,"threshold_uncertainty_score":0.07427454},"labels":[],"label_agreement":null},{"id":"W4410455374","doi":"10.1007/978-3-031-92935-9_21","title":"Perpetual Scheduling with Explorable Uncertainty","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.011677459072668078,"score_gpt":0.21595272031829424,"score_spread":0.20427526124562617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410455374","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.016960224,0.0024276325,0.951987,0.0006928048,0.00046708385,0.000040822793,0.00012383869,0.00051341957,0.02678719],"genre_scores_gemma":[0.66283834,0.0039197053,0.29297313,0.00044152333,0.0006162029,0.00022769805,0.00034888388,0.000561338,0.038073257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994842,0.00016589617,0.000022132594,0.00006591398,0.00019476822,0.00006702459],"domain_scores_gemma":[0.99893874,0.00064820447,0.000064014304,0.00020933148,0.000081009835,0.00005874283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265625,0.000682526,0.00076744775,0.00048125413,0.0006616353,0.001767957,0.0016594636,0.00073047134,0.004133487],"category_scores_gemma":[0.0033876125,0.00060206914,0.00049302424,0.0014372161,0.0010898032,0.0021351248,0.0015838742,0.002204512,0.00067176676],"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.00010822781,0.00003704919,0.00014952154,0.000119546065,0.000032975997,0.00009581825,0.00009352902,0.4563163,0.001611887,0.46778417,0.005353056,0.068298034],"study_design_scores_gemma":[0.000018815712,0.0000292614,0.0000667614,0.000023179882,0.000010776696,0.00004948244,0.00002116016,0.6032191,0.00087369705,0.38652343,0.009151259,0.000013154841],"about_ca_topic_score_codex":0.0010487735,"about_ca_topic_score_gemma":0.0014776046,"teacher_disagreement_score":0.004133487,"about_ca_system_score_codex":0.001215429,"about_ca_system_score_gemma":0.0014657779,"threshold_uncertainty_score":0.01382792},"labels":[],"label_agreement":null},{"id":"W4410464782","doi":"10.1007/978-3-031-92932-8_22","title":"On The Computational Complexity of Games with Uncertainty","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision 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 Victoria","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; Asymptotic computational complexity; Computational resource; Algorithm","score_opus":0.08015998613908407,"score_gpt":0.33895224641011024,"score_spread":0.2587922602710262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410464782","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07185144,0.011648029,0.6672044,0.020673703,0.0008086776,0.0001882592,0.0010497763,0.00028501483,0.2262907],"genre_scores_gemma":[0.8144123,0.0123570245,0.13225044,0.0019715505,0.0030622438,0.00066444714,0.001133173,0.00033125802,0.033817522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639195,0.0014841168,0.00018244523,0.00043682542,0.0011365882,0.00036807987],"domain_scores_gemma":[0.96142876,0.03511144,0.000756969,0.0014856535,0.00072126713,0.00049592654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035932355,0.0015338406,0.002323325,0.0018599143,0.0014691687,0.0068000564,0.0028587107,0.0022225736,0.010598583],"category_scores_gemma":[0.02320643,0.0010679141,0.0022337364,0.002947805,0.0060914615,0.014530307,0.0037654531,0.00851755,0.0008439735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030488836,0.000021390248,0.00013262084,0.00010084001,0.00002390621,0.000028128752,0.00008870629,0.018312957,0.00013439187,0.9713982,0.0026765978,0.0070516877],"study_design_scores_gemma":[0.000004798322,0.0000040007985,0.000059257673,0.00001494454,0.000004617389,0.000012591876,0.000013024349,0.020552304,0.00003410214,0.9784048,0.0008900463,0.000005540803],"about_ca_topic_score_codex":0.0022976594,"about_ca_topic_score_gemma":0.0015727085,"teacher_disagreement_score":0.010598583,"about_ca_system_score_codex":0.0044612414,"about_ca_system_score_gemma":0.0016838922,"threshold_uncertainty_score":0.035455763},"labels":[],"label_agreement":null},{"id":"W4410540100","doi":"10.1007/978-3-031-91672-4_14","title":"Source-Free Domain Adaptation for YOLO Object Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"École de Technologie Supérieure; Bell (Canada)","funders":"","keywords":"Computer science; Adaptation (eye); Domain adaptation; Domain (mathematical analysis); Object (grammar); Computer vision; Artificial intelligence; Mathematics; Psychology","score_opus":0.016516906295919693,"score_gpt":0.250469082906009,"score_spread":0.2339521766100893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410540100","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.009513146,0.0005331305,0.9843752,0.00010325718,0.00013326139,0.000033972367,0.00019409251,0.0019667854,0.0031471848],"genre_scores_gemma":[0.20508315,0.0011515957,0.76219356,0.00044823473,0.00018295407,0.00018515887,0.0024718936,0.0009448638,0.027338611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982077,0.000032525517,0.0000062451845,0.00004827048,0.00006110708,0.00003107845],"domain_scores_gemma":[0.999764,0.000077201265,0.00001415166,0.00005942325,0.0000718084,0.000013297261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038702224,0.00063187635,0.00060653745,0.00044142836,0.00024127257,0.0005195398,0.00077628146,0.00074060546,0.0060044043],"category_scores_gemma":[0.0009383421,0.00025855482,0.0005627713,0.00062731,0.0002720462,0.0006014893,0.0010299658,0.0010582957,0.004277211],"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.0004494462,0.00013114918,0.000554067,0.00016574492,0.000083001825,0.000086190696,0.000057793506,0.021468727,0.12171067,0.004233719,0.010876512,0.8401829],"study_design_scores_gemma":[0.000043353506,0.00013696139,0.004088325,0.00005958612,0.000074372416,0.00040739146,0.000061514766,0.8790468,0.08708507,0.00645329,0.022500707,0.00004264312],"about_ca_topic_score_codex":0.0010731652,"about_ca_topic_score_gemma":0.0026231657,"teacher_disagreement_score":0.0060044043,"about_ca_system_score_codex":0.0001791417,"about_ca_system_score_gemma":0.000366502,"threshold_uncertainty_score":0.020086706},"labels":[],"label_agreement":null},{"id":"W4410553862","doi":"10.1007/978-3-031-91736-3_18","title":"Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Robot; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.024793170628626637,"score_gpt":0.25921107446130714,"score_spread":0.23441790383268052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114371814,0.0003151431,0.86316246,0.00064160867,0.00013223452,0.00017091412,0.00016485662,0.0016586558,0.01938232],"genre_scores_gemma":[0.8631587,0.000334892,0.12329872,0.00016203403,0.00008359702,0.00026450938,0.00014409119,0.00029020672,0.012263343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988959,0.00023348474,0.00006250942,0.00029720383,0.00021701513,0.00029394194],"domain_scores_gemma":[0.99646413,0.0013236376,0.00037512486,0.001286131,0.00024134296,0.00030954607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514637,0.00053633057,0.001227778,0.0004604549,0.0011208721,0.001401868,0.0022122336,0.00091773306,0.0035257363],"category_scores_gemma":[0.0055605173,0.0007158902,0.0007132463,0.0009853505,0.0025894407,0.0038728293,0.0040276833,0.0015418482,0.0005260665],"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.00043174915,0.000102933605,0.0006912887,0.000216525,0.00005297704,0.00014829084,0.00034879672,0.20831648,0.007434194,0.7143194,0.004469329,0.06346802],"study_design_scores_gemma":[0.00005736398,0.00006836195,0.00019498741,0.000012082954,0.00001581785,0.00006511172,0.00005681432,0.37589705,0.0029307893,0.6189244,0.0017616376,0.000015504022],"about_ca_topic_score_codex":0.0017266744,"about_ca_topic_score_gemma":0.0020117671,"teacher_disagreement_score":0.0035257363,"about_ca_system_score_codex":0.0012162431,"about_ca_system_score_gemma":0.0023343575,"threshold_uncertainty_score":0.011794746},"labels":[],"label_agreement":null},{"id":"W4410553869","doi":"10.1007/978-3-031-91736-3_6","title":"Explicit Token-Based Communication for Mobile Entities","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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; University of Ottawa","funders":"","keywords":"Computer science; Security token; Programming language; Computer network","score_opus":0.014105255105528888,"score_gpt":0.25557916781329043,"score_spread":0.24147391270776153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022219,0.0011033993,0.94912523,0.00032912169,0.00056303316,0.00007968171,0.00010489478,0.0016334875,0.02484222],"genre_scores_gemma":[0.72660583,0.0012281308,0.18613622,0.00019550144,0.00025986056,0.00019168701,0.00035218397,0.00036831346,0.08466227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993525,0.00014404855,0.000044655113,0.00010345442,0.00020116517,0.00015409313],"domain_scores_gemma":[0.99864286,0.00043590393,0.00008363833,0.00058916013,0.0001778425,0.000070500355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085280434,0.00039339982,0.00049717556,0.0003268584,0.00091300945,0.0018413663,0.0016779151,0.0010505955,0.0077944556],"category_scores_gemma":[0.0027146628,0.0004199474,0.00029008367,0.00073988107,0.00089302135,0.0041894712,0.0023446109,0.0016671283,0.0024684363],"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.0007446581,0.000117199605,0.00046405182,0.00039824823,0.00003225169,0.00042729182,0.00056035205,0.04000537,0.034307968,0.6423584,0.0147153335,0.26586884],"study_design_scores_gemma":[0.00012499312,0.00039848895,0.00057294016,0.00014566148,0.00011941712,0.00088609493,0.00022980002,0.5152439,0.062054146,0.2794836,0.14063302,0.00010793573],"about_ca_topic_score_codex":0.0005732537,"about_ca_topic_score_gemma":0.0010313498,"teacher_disagreement_score":0.0077944556,"about_ca_system_score_codex":0.0006268307,"about_ca_system_score_gemma":0.0008089677,"threshold_uncertainty_score":0.026075125},"labels":[],"label_agreement":null},{"id":"W4410553879","doi":"10.1007/978-3-031-91736-3_15","title":"Multimodal Search on a Line","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diffusion and Search Dynamics","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":"Carleton University","funders":"","keywords":"Computer science; Line (geometry); Information retrieval; Artificial intelligence; Mathematics; Geometry","score_opus":0.015738511360609823,"score_gpt":0.2894601617356507,"score_spread":0.27372165037504087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033775806,0.0010304522,0.8762521,0.0013631044,0.00022478154,0.00010243465,0.00034257575,0.001945787,0.08496296],"genre_scores_gemma":[0.55825657,0.00070206827,0.30204913,0.00063308445,0.00024670735,0.00035326462,0.0007943835,0.0007191809,0.13624552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996599,0.00009938678,0.000016745356,0.000093991584,0.00006864803,0.00006133767],"domain_scores_gemma":[0.9993118,0.00037130382,0.000039232702,0.000111807385,0.00010292099,0.000063003085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005220487,0.0007715987,0.0009921824,0.0006141531,0.0008616097,0.0017352798,0.0010865652,0.0018057475,0.035143066],"category_scores_gemma":[0.0031668565,0.00038565532,0.0005814703,0.00093237875,0.0007723101,0.0029282086,0.00208801,0.0013703842,0.0044533513],"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.00053827016,0.00016978524,0.00067149795,0.00021623468,0.00009275337,0.0003068877,0.00034072518,0.27902937,0.005317912,0.27148712,0.049627006,0.39220244],"study_design_scores_gemma":[0.00003945854,0.00009812827,0.00014645758,0.000035110752,0.000018196119,0.00011478573,0.00007611985,0.8650852,0.0012379469,0.12100341,0.012127421,0.000017809356],"about_ca_topic_score_codex":0.0015517584,"about_ca_topic_score_gemma":0.0013799157,"teacher_disagreement_score":0.035143066,"about_ca_system_score_codex":0.0006287052,"about_ca_system_score_gemma":0.0004648968,"threshold_uncertainty_score":0.117565334},"labels":[],"label_agreement":null},{"id":"W4410553924","doi":"10.1007/978-3-031-91736-3_13","title":"Bankrupting DoS Attackers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer security","score_opus":0.013773661985252735,"score_gpt":0.24711264457388238,"score_spread":0.23333898258862965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553924","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.20958905,0.012357648,0.17284746,0.0054268385,0.0013113224,0.00022228847,0.00019596207,0.0036120745,0.59443736],"genre_scores_gemma":[0.7790012,0.005745736,0.010067342,0.0006708409,0.00051309494,0.000046578512,0.00015780044,0.00018058435,0.20361683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997253,0.00004577267,0.000014377867,0.000044123884,0.00010703587,0.00006333959],"domain_scores_gemma":[0.9988599,0.00033867802,0.0002273974,0.00032047293,0.00014327832,0.00011026022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053967146,0.0007421821,0.00041914516,0.0009803366,0.00067747507,0.0019244666,0.00057826506,0.0012878991,0.0109296655],"category_scores_gemma":[0.002709599,0.00032345622,0.00022447329,0.00045108353,0.0008125578,0.0023441815,0.0011299547,0.0014725626,0.0051593613],"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.00048466393,0.00023710901,0.004137811,0.00018934,0.000047579124,0.0012845391,0.0012184862,0.014725639,0.015681002,0.2018242,0.055987544,0.704182],"study_design_scores_gemma":[0.00011073645,0.0010712468,0.0090313,0.00082150224,0.00021957993,0.008775056,0.0012287307,0.14045766,0.03502085,0.3297399,0.47341964,0.0001038437],"about_ca_topic_score_codex":0.00045927634,"about_ca_topic_score_gemma":0.0006252349,"teacher_disagreement_score":0.0109296655,"about_ca_system_score_codex":0.0004321064,"about_ca_system_score_gemma":0.0003792034,"threshold_uncertainty_score":0.036563396},"labels":[],"label_agreement":null},{"id":"W4410553941","doi":"10.1007/978-3-031-91736-3_5","title":"Exploration of Convex Terrains by a Deterministic Automaton with Pebbles","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Automaton; Deterministic automaton; Regular polygon; Terrain; Büchi automaton; Algorithm; Theoretical computer science; Geometry; Mathematics; Cartography","score_opus":0.02013115548736642,"score_gpt":0.25897559071636617,"score_spread":0.23884443522899976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34928912,0.00026241998,0.6299937,0.00034774185,0.000092707676,0.000082549384,0.00027833862,0.0012924218,0.018361073],"genre_scores_gemma":[0.8910387,0.00014941739,0.102745526,0.000055531786,0.000016346037,0.0001157915,0.00019428949,0.00012536548,0.005559066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997818,0.000040221228,0.000015803282,0.00006777058,0.000047459627,0.00004690702],"domain_scores_gemma":[0.99925154,0.0004542816,0.00005356575,0.00009746693,0.00005934223,0.000083721796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020703668,0.00046878678,0.0009028453,0.0005203449,0.0009560571,0.0011119038,0.0014768844,0.0010810997,0.0052986215],"category_scores_gemma":[0.0013945164,0.00059426326,0.0009404343,0.0005891257,0.0015287226,0.0012981656,0.0021711923,0.0008244967,0.00052817876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001622611,0.000044397293,0.0010190194,0.00007127219,0.000030290852,0.00024887995,0.00016418802,0.9380454,0.006286265,0.03594923,0.0006321087,0.017346712],"study_design_scores_gemma":[0.000012251908,0.000028389719,0.00006941132,0.000006576926,0.0000049767737,0.00001800208,0.000019946072,0.9875309,0.0005459694,0.011377296,0.00037899087,0.0000072787443],"about_ca_topic_score_codex":0.0055737086,"about_ca_topic_score_gemma":0.0052422024,"teacher_disagreement_score":0.0055737086,"about_ca_system_score_codex":0.00073548453,"about_ca_system_score_gemma":0.0006760493,"threshold_uncertainty_score":0.017725646},"labels":[],"label_agreement":null},{"id":"W4410553953","doi":"10.1007/978-3-031-91736-3_16","title":"Multi-agent Disk Inspection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Engineering drawing; Engineering","score_opus":0.024340273850264316,"score_gpt":0.27294378866989777,"score_spread":0.24860351481963344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047680486,0.002089754,0.88488686,0.00069701095,0.00034142422,0.00020071618,0.00013744897,0.0031263703,0.06084],"genre_scores_gemma":[0.7647219,0.0008562113,0.15179916,0.00015498506,0.000066374436,0.00012715101,0.00017116225,0.00025241871,0.081850655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960786,0.00008048506,0.000017801647,0.00008970445,0.00013606739,0.000068086105],"domain_scores_gemma":[0.9991841,0.00028086215,0.00009594297,0.00020357007,0.00017106294,0.00006453037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049830024,0.0006996875,0.00092763506,0.0005260304,0.0005860807,0.0012544325,0.0015460529,0.0011656615,0.007524249],"category_scores_gemma":[0.0020493933,0.0004005874,0.0004431289,0.0005864216,0.00048319437,0.0009100995,0.0011996398,0.00077021134,0.0013293023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004641836,0.0003287023,0.0010586686,0.00043036236,0.000072781935,0.00041061547,0.00017724147,0.57634157,0.01588853,0.04301676,0.019512,0.34229854],"study_design_scores_gemma":[0.000020225038,0.00008142268,0.00037072963,0.000024985975,0.000016914839,0.00012660954,0.000046748282,0.9731871,0.0034326538,0.013058522,0.009622444,0.000011688387],"about_ca_topic_score_codex":0.0020510813,"about_ca_topic_score_gemma":0.001869049,"teacher_disagreement_score":0.007524249,"about_ca_system_score_codex":0.0006579819,"about_ca_system_score_gemma":0.0007262525,"threshold_uncertainty_score":0.025171101},"labels":[],"label_agreement":null},{"id":"W4410561822","doi":"10.1007/978-3-031-92898-7_2","title":"Analysis and Predictability of Centrality Measures in Competition Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Predictability; Computer science; Centrality; Competition (biology); Statistics; Mathematics","score_opus":0.03786166085489959,"score_gpt":0.3193094219697867,"score_spread":0.2814477611148871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561822","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.50631595,0.0023063277,0.47344792,0.002126439,0.000096784475,0.00004615522,0.0005792724,0.00036794413,0.014713085],"genre_scores_gemma":[0.9894169,0.0004862334,0.007940135,0.000048369544,0.00013057735,0.000034566834,0.00016311136,0.00006352444,0.0017166589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898344,0.0003661884,0.000033721168,0.00025760318,0.00021340481,0.00014559094],"domain_scores_gemma":[0.9517694,0.04212877,0.0030908163,0.0012074738,0.0010872858,0.00071623985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024212478,0.0005375686,0.000799333,0.0021685471,0.00073702,0.0023064052,0.0015674871,0.001023077,0.0025239764],"category_scores_gemma":[0.029919218,0.00071875035,0.00067769235,0.001977762,0.0024959464,0.0040314994,0.0011236079,0.001902514,0.00021580432],"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.00010094715,0.0000805373,0.0151844565,0.00017219954,0.0001093829,0.00017999296,0.00041665576,0.33572465,0.0033446804,0.6115858,0.0031861989,0.029914448],"study_design_scores_gemma":[0.00000676294,0.000027420958,0.0047946805,0.000024603933,0.000024213337,0.00009149015,0.00006671741,0.7001868,0.000461651,0.293735,0.00055700983,0.000023716178],"about_ca_topic_score_codex":0.002066462,"about_ca_topic_score_gemma":0.002228342,"teacher_disagreement_score":0.0025239764,"about_ca_system_score_codex":0.0018435778,"about_ca_system_score_gemma":0.0007641594,"threshold_uncertainty_score":0.013376117},"labels":[],"label_agreement":null},{"id":"W4410561843","doi":"10.1007/978-3-031-92898-7_6","title":"Improving Community Detection via Community Association Strength Scores","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University","funders":"","keywords":"Computer science; Association (psychology); Association rule learning; Artificial intelligence; Data mining; Psychology","score_opus":0.011277994865589069,"score_gpt":0.24798885926603614,"score_spread":0.23671086440044709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051306766,0.0012142474,0.93797,0.00043449734,0.00029895164,0.00019515272,0.0006885852,0.0041671726,0.0037247362],"genre_scores_gemma":[0.34476444,0.0005810714,0.64159137,0.0003061065,0.0005998126,0.00022435686,0.002724743,0.00054627075,0.0086618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973984,0.00060737616,0.00010767601,0.00059679686,0.0010775141,0.00021222542],"domain_scores_gemma":[0.9911,0.0048474683,0.0005265657,0.0010210965,0.0021133916,0.00039144757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750234,0.0019638892,0.0022595,0.006027711,0.0013679503,0.0019291304,0.00286606,0.0024876771,0.0037598424],"category_scores_gemma":[0.014004529,0.00090993516,0.001438499,0.0043095,0.00067522965,0.0032971215,0.0027582783,0.0022897185,0.003647666],"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.0004409286,0.00062285597,0.008914988,0.00027426044,0.0004740264,0.00012886547,0.000098459466,0.0571617,0.0234145,0.005247157,0.018835725,0.88438654],"study_design_scores_gemma":[0.00004192548,0.00009449665,0.0018339367,0.000023340475,0.00008902505,0.00018091117,0.000045084173,0.97885656,0.0064531555,0.010403617,0.0019511539,0.000026877686],"about_ca_topic_score_codex":0.004157586,"about_ca_topic_score_gemma":0.0077247554,"teacher_disagreement_score":0.006027711,"about_ca_system_score_codex":0.0005865353,"about_ca_system_score_gemma":0.0008363266,"threshold_uncertainty_score":0.014544785},"labels":[],"label_agreement":null},{"id":"W4410561914","doi":"10.1007/978-3-031-92898-7_12","title":"The Multilayer Artificial Benchmark for Community Detection (mABCD)","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Benchmark (surveying); Artificial intelligence; Cartography","score_opus":0.019365023228292092,"score_gpt":0.2779493938660811,"score_spread":0.258584370637789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38450408,0.013714843,0.48053372,0.005604995,0.0033230975,0.0009211985,0.034427762,0.021441907,0.055528395],"genre_scores_gemma":[0.58677596,0.0013601901,0.365185,0.0008868458,0.000604111,0.00052402605,0.02931979,0.0011271898,0.014216908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969708,0.0012598557,0.00014442726,0.00058340526,0.0007045172,0.0003369517],"domain_scores_gemma":[0.9918726,0.004029367,0.00038769247,0.0018549085,0.001295359,0.0005600908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037966208,0.0014389113,0.0013221998,0.002726883,0.0012948834,0.0022680839,0.0027292804,0.0027695035,0.005603422],"category_scores_gemma":[0.019129718,0.00044052457,0.001078527,0.002563276,0.0007206536,0.0025749833,0.0026971074,0.0019347656,0.0022369418],"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.0016858659,0.0011298083,0.008720147,0.001379385,0.0006271627,0.00022338536,0.00016404716,0.2933175,0.00632799,0.02109064,0.17164221,0.4936919],"study_design_scores_gemma":[0.00013572625,0.00032215728,0.0020098756,0.00006862874,0.000055792003,0.00016041983,0.000072229,0.954158,0.004587347,0.027144734,0.01125332,0.000031848922],"about_ca_topic_score_codex":0.007080064,"about_ca_topic_score_gemma":0.010067483,"teacher_disagreement_score":0.007080064,"about_ca_system_score_codex":0.0011647475,"about_ca_system_score_gemma":0.0014923356,"threshold_uncertainty_score":0.020078719},"labels":[],"label_agreement":null},{"id":"W4410561938","doi":"10.1007/978-3-031-92898-7_9","title":"The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities ($$\\mathbf {ABCD{+}o}^2$$)","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Computer science; Outlier; Artificial intelligence; Data mining; Cartography; Geography","score_opus":0.016780749018176867,"score_gpt":0.25093160733773456,"score_spread":0.2341508583195577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410561938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1384693,0.012114886,0.6849917,0.007665472,0.004467543,0.000609123,0.034727212,0.016416855,0.10053786],"genre_scores_gemma":[0.31146163,0.001550751,0.6040003,0.0012121606,0.0009415456,0.0005935218,0.0480267,0.0029559354,0.02925745],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997428,0.000981328,0.00010041794,0.0005956967,0.0006946073,0.00019980322],"domain_scores_gemma":[0.9915803,0.0046252045,0.00030646104,0.0015589818,0.0014118627,0.00051707635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032358172,0.0012723095,0.0010300154,0.0023897088,0.0016296111,0.0024997045,0.0033534532,0.0026086147,0.009831619],"category_scores_gemma":[0.018369302,0.00048787965,0.00096285396,0.0033533114,0.001200332,0.002506064,0.002331962,0.0019855013,0.004087053],"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.0008739967,0.00058364327,0.0026383759,0.0014876375,0.00025202704,0.00029791702,0.0002776352,0.17558633,0.0050073257,0.056051143,0.40646625,0.35047773],"study_design_scores_gemma":[0.00017134508,0.00023429724,0.001831014,0.00013531432,0.00004486699,0.00045921758,0.00014873054,0.81850857,0.0072060516,0.10919372,0.062019136,0.000047716407],"about_ca_topic_score_codex":0.004737502,"about_ca_topic_score_gemma":0.0073036077,"teacher_disagreement_score":0.009831619,"about_ca_system_score_codex":0.0010427858,"about_ca_system_score_gemma":0.0010494541,"threshold_uncertainty_score":0.03289002},"labels":[],"label_agreement":null},{"id":"W4410589933","doi":"10.1007/978-3-031-92805-5_21","title":"Hyperspectral Imaging and Computer Vision Based Remote Monitoring of $$SO_2$$ Emissions in Maritime Vessels","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Measurement and Detection Methods","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":"Université TÉLUQ","funders":"","keywords":"Hyperspectral imaging; Computer science; Remote sensing; Computer vision; Artificial intelligence; Geology","score_opus":0.015616633715540871,"score_gpt":0.27785206475809454,"score_spread":0.26223543104255365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410589933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34990388,0.049095746,0.38238764,0.0027935843,0.001297308,0.000113464324,0.0011136606,0.001297368,0.21199737],"genre_scores_gemma":[0.6339332,0.025480129,0.16014759,0.00066012185,0.00081209705,0.00007088666,0.0011252078,0.00024316716,0.17752776],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998894,0.000009883197,0.0000021098483,0.000027329348,0.00006128379,0.00001002564],"domain_scores_gemma":[0.9999565,0.0000216638,0.000004362538,0.0000032075225,0.000011405312,0.000002761189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016097089,0.0003398478,0.00018909237,0.0004786423,0.00014600561,0.00053368753,0.00041213637,0.00058191805,0.0043904204],"category_scores_gemma":[0.000121779245,0.00025390257,0.00033776555,0.0006217186,0.0003179377,0.0006899238,0.00029889823,0.0003628373,0.00067517493],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027115052,0.00017255031,0.005275567,0.0005135319,0.00007950029,0.00022506036,0.00020212612,0.025434284,0.28918695,0.012810631,0.012804966,0.6530237],"study_design_scores_gemma":[0.000027101287,0.00053895166,0.0969483,0.00016938064,0.00012298168,0.0015504003,0.0005022739,0.36259696,0.31664082,0.02374591,0.19700128,0.00015570555],"about_ca_topic_score_codex":0.0023142023,"about_ca_topic_score_gemma":0.0057017943,"teacher_disagreement_score":0.0043904204,"about_ca_system_score_codex":0.00023162589,"about_ca_system_score_gemma":0.0001655061,"threshold_uncertainty_score":0.014687419},"labels":[],"label_agreement":null},{"id":"W4410589973","doi":"10.1007/978-3-031-92805-5_24","title":"SplatPose+: Real-Time Image-Based Pose-Agnostic 3D Anomaly Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer vision; Anomaly detection; Artificial intelligence; Image (mathematics)","score_opus":0.007209697685370501,"score_gpt":0.23282249567697103,"score_spread":0.22561279799160053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410589973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005561472,0.00019999246,0.9187095,0.00007051375,0.00014319339,0.00010187006,0.0009807213,0.072526015,0.0017067097],"genre_scores_gemma":[0.06402591,0.00020590921,0.9226087,0.0001981662,0.000071235474,0.00020020331,0.0034205916,0.0038350113,0.0054342956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990669,0.000053716674,0.00003139011,0.000208431,0.0005755058,0.00006411881],"domain_scores_gemma":[0.99935144,0.00017057057,0.00006369855,0.00019558362,0.00016694044,0.000051729992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050258264,0.0020055682,0.0016413695,0.0013832472,0.0003569887,0.0013907724,0.0034842023,0.0010737814,0.012054075],"category_scores_gemma":[0.0014843472,0.001069836,0.0012206481,0.0011525118,0.00045676087,0.0012146542,0.002904707,0.0013982494,0.0076258057],"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.00052222837,0.00014714318,0.0012952448,0.00025592183,0.00017034287,0.00019875483,0.00009222847,0.020939138,0.07193612,0.0026166686,0.048603192,0.853223],"study_design_scores_gemma":[0.0000760521,0.00023676959,0.0016849717,0.000028199267,0.00006139195,0.00080689194,0.00004581582,0.88217795,0.0789172,0.006319325,0.029563308,0.00008224722],"about_ca_topic_score_codex":0.0019704239,"about_ca_topic_score_gemma":0.0035170226,"teacher_disagreement_score":0.012054075,"about_ca_system_score_codex":0.00035439935,"about_ca_system_score_gemma":0.000663938,"threshold_uncertainty_score":0.040324926},"labels":[],"label_agreement":null},{"id":"W4410698691","doi":"10.1007/978-3-031-92591-7_27","title":"Towards Motion from Video Diffusion Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Computer graphics (images); Diffusion; Motion (physics); Computer vision; Artificial intelligence","score_opus":0.017344576805100022,"score_gpt":0.26124951295962867,"score_spread":0.24390493615452866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410698691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027048101,0.0006810301,0.9948544,0.00021952463,0.000055102737,0.000012982616,0.00007510685,0.00022761778,0.001169527],"genre_scores_gemma":[0.2787736,0.0064039407,0.6777942,0.0005507102,0.00045903106,0.00025900724,0.0016169633,0.000735339,0.033407286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998173,0.0000612733,0.000010417766,0.000048712325,0.000047734895,0.000014544138],"domain_scores_gemma":[0.9991153,0.0005679154,0.00008051593,0.00007493652,0.00012358927,0.00003773961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075359695,0.0010524708,0.0012015079,0.0010177575,0.000283389,0.0009055281,0.0010190473,0.0014959238,0.0019699933],"category_scores_gemma":[0.004149208,0.0011330643,0.0010640312,0.001034969,0.00062255707,0.0016728091,0.0013088887,0.0022864116,0.0013537897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074847674,0.00004167816,0.00042822558,0.00021257495,0.00011386805,0.00012001988,0.00015223851,0.59972966,0.007320328,0.19850796,0.006504405,0.18679413],"study_design_scores_gemma":[0.000004574828,0.000010519189,0.00006679459,0.00001347275,0.000008582663,0.000025033121,0.000006822951,0.94815576,0.00051296485,0.048670307,0.0025174755,0.000007613004],"about_ca_topic_score_codex":0.0061969236,"about_ca_topic_score_gemma":0.0041796807,"teacher_disagreement_score":0.0061969236,"about_ca_system_score_codex":0.00079502695,"about_ca_system_score_gemma":0.00044621498,"threshold_uncertainty_score":0.012321711},"labels":[],"label_agreement":null},{"id":"W4410699031","doi":"10.1007/978-3-031-92591-7_26","title":"MCRE: Multimodal Conditional Representation and Editing for Text-Motion Generation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","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":"McGill University; University of Toronto","funders":"","keywords":"Computer science; Representation (politics); Motion (physics); Artificial intelligence; Natural language processing; Speech recognition","score_opus":0.0213966359573292,"score_gpt":0.2611782200805439,"score_spread":0.2397815841232147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410699031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018667381,0.000106725616,0.95840836,0.0000633036,0.00012581407,0.000102193786,0.0006515665,0.034450606,0.00422461],"genre_scores_gemma":[0.07929343,0.00023427483,0.8814791,0.00019165136,0.00013996089,0.00037768506,0.0043610767,0.01033852,0.023584364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.00008971532,0.000033143617,0.00016079556,0.00020672863,0.000054343884],"domain_scores_gemma":[0.9992229,0.00032612836,0.000035265522,0.00020542293,0.00016220685,0.000048056474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068794494,0.0015777255,0.0008885281,0.001012586,0.0005609449,0.0014017092,0.0024173707,0.001217648,0.06521898],"category_scores_gemma":[0.002610603,0.00066544604,0.00092627667,0.0007153497,0.0005855458,0.0016719048,0.002275011,0.0015962822,0.01452946],"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.0005069092,0.00014372772,0.00015196287,0.0003978747,0.00005001158,0.0003147711,0.0002925773,0.0161129,0.0713183,0.027704243,0.07644264,0.8065641],"study_design_scores_gemma":[0.00012237941,0.00015597355,0.00046139056,0.000097874385,0.00005263954,0.00059779536,0.00010792573,0.71289676,0.13317701,0.029655302,0.12256627,0.000108698776],"about_ca_topic_score_codex":0.0019675845,"about_ca_topic_score_gemma":0.0027296385,"teacher_disagreement_score":0.06521898,"about_ca_system_score_codex":0.00044282613,"about_ca_system_score_gemma":0.0004027372,"threshold_uncertainty_score":0.21817923},"labels":[],"label_agreement":null},{"id":"W4410706585","doi":"10.1007/978-3-031-90229-1_5","title":"Increasing Index Sizes for Information Set Decoding Algorithms","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","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":"Computer science; Decoding methods; Index (typography); Algorithm; Set (abstract data type); World Wide Web","score_opus":0.014154261852111117,"score_gpt":0.2513658610471208,"score_spread":0.23721159919500967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410706585","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.06114514,0.005028792,0.8154009,0.00808007,0.0012116545,0.0006903536,0.0021671967,0.0065006814,0.09977524],"genre_scores_gemma":[0.33196327,0.0038962585,0.6184923,0.0030812055,0.002136433,0.0019770102,0.0025264965,0.0037976229,0.032129396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98781407,0.0037871653,0.0007894515,0.0013246551,0.0051495745,0.0011350152],"domain_scores_gemma":[0.8906011,0.08686688,0.0021321734,0.014991294,0.0038017419,0.0016067834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007823102,0.0025087257,0.002952561,0.0036853203,0.0032578893,0.00607341,0.0056389184,0.0041063027,0.015439332],"category_scores_gemma":[0.06721806,0.0019297557,0.0020443539,0.0059088585,0.0045627467,0.014484732,0.006979847,0.008002722,0.0053456104],"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.00157988,0.00038138084,0.0010292276,0.00068218925,0.00008117458,0.00021016506,0.00056496746,0.07774151,0.012809774,0.58792114,0.043519605,0.27347884],"study_design_scores_gemma":[0.00014293387,0.000137857,0.00021866306,0.00018114825,0.000059577796,0.0002959005,0.000064495616,0.18284982,0.008491699,0.79881227,0.008688456,0.000057205154],"about_ca_topic_score_codex":0.0011134938,"about_ca_topic_score_gemma":0.0016814563,"teacher_disagreement_score":0.015439332,"about_ca_system_score_codex":0.006269632,"about_ca_system_score_gemma":0.0038298338,"threshold_uncertainty_score":0.05164969},"labels":[],"label_agreement":null},{"id":"W4410706628","doi":"10.1007/978-3-031-91813-1_18","title":"iIPPC-V2X: Multi-modality Fusion Perception System for Cooperative Vehicle Infrastructure System with Self-Supervised Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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":"Ministry of Education and Child Care","funders":"","keywords":"Computer science; Modality (human–computer interaction); Perception; Artificial intelligence; Fusion; Human–computer interaction; Psychology","score_opus":0.006891300238694164,"score_gpt":0.21002736387147847,"score_spread":0.2031360636327843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410706628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017169416,0.0005242314,0.95536596,0.00016607856,0.00026794127,0.0002134257,0.00095340854,0.017364662,0.007974915],"genre_scores_gemma":[0.45153233,0.0006302364,0.5199199,0.0006266112,0.0001612466,0.0006154198,0.004048601,0.00092023605,0.021545412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981385,0.000023348823,0.0000071996255,0.00005309818,0.000076069286,0.000026561334],"domain_scores_gemma":[0.9998847,0.000017272327,0.000005811828,0.000020041181,0.000058593465,0.000013421717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047712564,0.00060286553,0.00060380547,0.000380903,0.00034510577,0.00060538814,0.0011482184,0.0008027779,0.0069089276],"category_scores_gemma":[0.0004148752,0.0002403425,0.0003303747,0.00040886702,0.00023464915,0.0008072147,0.00082044594,0.00073324755,0.0021766734],"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.0007111766,0.00030226115,0.0015368705,0.00024349566,0.00015911131,0.00022574607,0.00023289424,0.048955686,0.15240434,0.0061152894,0.07313873,0.7159744],"study_design_scores_gemma":[0.00006203514,0.0002759449,0.002809871,0.000028054063,0.000054529683,0.00023502666,0.000056076584,0.8991404,0.062181495,0.003568683,0.031512335,0.00007559081],"about_ca_topic_score_codex":0.004765569,"about_ca_topic_score_gemma":0.004706036,"teacher_disagreement_score":0.0069089276,"about_ca_system_score_codex":0.00040012828,"about_ca_system_score_gemma":0.00061843306,"threshold_uncertainty_score":0.023112655},"labels":[],"label_agreement":null},{"id":"W4410706631","doi":"10.1007/978-3-031-91813-1_19","title":"Non-verbal Interaction and Interface with a Quadruped Robot Using Body and Hand Gestures: Design and User Experience Evaluation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gesture; Computer science; Human–computer interaction; Robot; User interface; Interface (matter); Interface design; Computer vision; Artificial intelligence; Programming language","score_opus":0.057564365746312275,"score_gpt":0.3837189025223518,"score_spread":0.3261545367760395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410706631","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.9654587,0.000187694,0.031603567,0.00002905879,0.000024352856,0.0003919547,0.00020618281,0.000438286,0.0016601568],"genre_scores_gemma":[0.9405775,0.00025528777,0.045791343,0.00006462379,0.00001957375,0.0006967977,0.0006163409,0.00026130464,0.011717196],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99902964,0.00049884926,0.000078957564,0.00009589795,0.00020773463,0.00008897847],"domain_scores_gemma":[0.99748,0.0015237125,0.00009078182,0.00014455532,0.00054653396,0.000214543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014865891,0.00072651077,0.0005325127,0.00050188805,0.00027724213,0.0005850041,0.00081588706,0.0005007703,0.00884631],"category_scores_gemma":[0.0027074057,0.00031949222,0.00051883433,0.0002539108,0.00036942793,0.00056932104,0.0007530887,0.00025568175,0.0011977284],"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.009054472,0.0052761533,0.011956368,0.0018844245,0.0002476102,0.001566753,0.009518698,0.0031895945,0.60118246,0.0005703821,0.0030950378,0.35245797],"study_design_scores_gemma":[0.0019870554,0.14037971,0.2592297,0.0003430306,0.0018864995,0.010252866,0.01363917,0.078381404,0.47100353,0.00080775464,0.021506831,0.0005823611],"about_ca_topic_score_codex":0.00078310625,"about_ca_topic_score_gemma":0.0009720243,"teacher_disagreement_score":0.00884631,"about_ca_system_score_codex":0.00015688268,"about_ca_system_score_gemma":0.00025780406,"threshold_uncertainty_score":0.029593885},"labels":[],"label_agreement":null},{"id":"W4410718950","doi":"10.1007/978-3-031-92823-9_9","title":"Integrating AI-Driven Personas and Procedural Visualization for Complete Communities Design and Urban Planning for Large-Scale Urban Development","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Persona Design and Applications","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":"Esri (Canada); University of Toronto; Ontario College of Art and Design","funders":"","keywords":"Computer science; Persona; Visualization; Scale (ratio); Urban planning; Human–computer interaction; Urban design; Artificial intelligence; Data science; Software engineering; Cartography; Civil engineering; Engineering; Geography","score_opus":0.041375855347737724,"score_gpt":0.2893609216047477,"score_spread":0.24798506625700997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410718950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048613646,0.000041499487,0.98506653,0.00011502411,0.000021934802,0.000051871833,0.00008341426,0.0027101666,0.0070482115],"genre_scores_gemma":[0.14535382,0.00012723292,0.8472067,0.00006405683,0.000010421011,0.000176438,0.0003296879,0.0006747161,0.0060569765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994734,0.00019803258,0.000030915056,0.00008727792,0.00017104996,0.000039346032],"domain_scores_gemma":[0.9992361,0.0003243625,0.000046186462,0.0001948551,0.0001298208,0.00006861644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079003576,0.00065815216,0.0003914519,0.000602365,0.00074014685,0.0021562325,0.0013605859,0.0007552051,0.0099177705],"category_scores_gemma":[0.002179768,0.000394881,0.0008146693,0.00064204267,0.00083486474,0.0016712467,0.0028033864,0.0010337604,0.0015198527],"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.00021458858,0.00030624634,0.0026051488,0.0006097403,0.0001359328,0.00031900537,0.0047936426,0.24596237,0.031659532,0.22771676,0.01823502,0.46744204],"study_design_scores_gemma":[0.000036171983,0.00009183909,0.0005238626,0.000094041025,0.000053545256,0.00018163533,0.0010699319,0.7776064,0.0115018375,0.108935244,0.09984028,0.000065236425],"about_ca_topic_score_codex":0.004700888,"about_ca_topic_score_gemma":0.009880756,"teacher_disagreement_score":0.0099177705,"about_ca_system_score_codex":0.00061064266,"about_ca_system_score_gemma":0.00095156376,"threshold_uncertainty_score":0.03317821},"labels":[],"label_agreement":null},{"id":"W4410719010","doi":"10.1007/978-3-031-92826-0_3","title":"Technological Influence on Digital Banking Adoption: A Framework and Empirical Study of the Influence of Social Robots and IVAs in a Small Island Context","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"FinTech, Crowdfunding, Digital Finance","field":"Business, Management and Accounting","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":"Ontario Tech University","funders":"","keywords":"Computer science; Context (archaeology); Empirical research; Robot; Human–computer interaction; Knowledge management; Artificial intelligence; Geology","score_opus":0.018322300537115012,"score_gpt":0.2450467120016589,"score_spread":0.2267244114645439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719010","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.97181296,0.00026773868,0.0006794321,0.0004166792,0.0000054245916,0.00001841708,0.00005758448,0.000006971188,0.026734771],"genre_scores_gemma":[0.9989536,0.00009574536,0.00014340549,0.000019055979,0.000004393597,0.0000065672816,0.000013241866,0.0000024784604,0.0007615725],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991091,0.0005477851,0.000024237954,0.000098472105,0.000071014925,0.00014940012],"domain_scores_gemma":[0.990229,0.0067734974,0.0015752525,0.00025176723,0.00045677283,0.00071370834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008884642,0.00019344065,0.00026179614,0.00096078345,0.0011467962,0.002436364,0.00041900293,0.0007695217,0.007039026],"category_scores_gemma":[0.004266342,0.0001801336,0.0002696673,0.001276685,0.0022732131,0.0015261837,0.0016062342,0.0011165554,0.0003997367],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005883534,0.0015700498,0.82788354,0.00029957495,0.00020544099,0.0014940357,0.03647125,0.0040353164,0.004158947,0.06660942,0.0016595547,0.055024493],"study_design_scores_gemma":[0.00005141923,0.0005842437,0.8957529,0.00019972322,0.00030094976,0.00031843942,0.0684662,0.013669493,0.001135356,0.009670468,0.009797033,0.00005374391],"about_ca_topic_score_codex":0.022931175,"about_ca_topic_score_gemma":0.03301983,"teacher_disagreement_score":0.022931175,"about_ca_system_score_codex":0.0014312072,"about_ca_system_score_gemma":0.0009318392,"threshold_uncertainty_score":0.045595407},"labels":[],"label_agreement":null},{"id":"W4410719240","doi":"10.1007/978-3-031-91575-8_7","title":"Enhancing Thermal MOT: A Novel Box Association Method Leveraging Thermal Identity and Motion Similarity","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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 Ottawa","funders":"","keywords":"Computer science; Similarity (geometry); Association (psychology); Identity (music); Motion (physics); Thermal; Artificial intelligence; Acoustics; Image (mathematics)","score_opus":0.022510191236795322,"score_gpt":0.289946035632893,"score_spread":0.2674358443960977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719240","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.013336946,0.00030233435,0.9831897,0.000043372846,0.00015803984,0.000048291906,0.000080121856,0.001331496,0.0015096506],"genre_scores_gemma":[0.19591102,0.00042139672,0.788301,0.0002354352,0.00020617007,0.00013708606,0.0005854203,0.0005740239,0.013628342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992447,0.00011056663,0.000031400523,0.00021310446,0.000325487,0.00007474295],"domain_scores_gemma":[0.9993042,0.00015046562,0.00006647568,0.0001850863,0.00022851661,0.00006525942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072651904,0.0008890116,0.00148221,0.0011277953,0.0008193057,0.0009894968,0.0019530533,0.0011126397,0.006987971],"category_scores_gemma":[0.0018155237,0.0005992085,0.0010236518,0.0015536227,0.0004931443,0.0019729403,0.0022935148,0.0012380582,0.0034826181],"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.00077345833,0.00031288684,0.0017107865,0.00018216655,0.00013297792,0.00009551787,0.00011956884,0.028446428,0.08111006,0.006950415,0.0062150517,0.8739506],"study_design_scores_gemma":[0.000038377602,0.0002369544,0.0022881855,0.000024169967,0.000099386656,0.0004268422,0.00007785927,0.94242185,0.038769983,0.0050371513,0.010517771,0.00006147421],"about_ca_topic_score_codex":0.0015447299,"about_ca_topic_score_gemma":0.0038522973,"teacher_disagreement_score":0.006987971,"about_ca_system_score_codex":0.00024355101,"about_ca_system_score_gemma":0.00074319594,"threshold_uncertainty_score":0.02337706},"labels":[],"label_agreement":null},{"id":"W4410719559","doi":"10.1007/978-3-031-92387-6_25","title":"Real-Time Neural Cloth Deformation Using a Compact Latent Space and a Latent Vector Predictor","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"École de Technologie Supérieure; Concordia University; Ubisoft (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Deformation (meteorology); Latent variable; Artificial neural network; Pattern recognition (psychology); Computer vision; Physics","score_opus":0.014003704653123283,"score_gpt":0.22151820796504837,"score_spread":0.20751450331192509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719559","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.026988238,0.00018904405,0.97084177,0.00013286698,0.00006715511,0.000016779575,0.00006708348,0.0008712678,0.0008257514],"genre_scores_gemma":[0.77704734,0.00033582913,0.21322739,0.0001265501,0.00008960235,0.0000746645,0.00040311884,0.00023071459,0.008464962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980587,0.000032162014,0.000008052268,0.00007246689,0.000051675295,0.000029735787],"domain_scores_gemma":[0.999592,0.00019289608,0.000042386815,0.00008073169,0.00005931248,0.000032601634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004271743,0.00049888407,0.0008087507,0.00023894166,0.0002345854,0.0005801951,0.000860523,0.00094393804,0.0034045228],"category_scores_gemma":[0.0011119446,0.00046471707,0.00055466837,0.00065541797,0.0005524969,0.0012038746,0.001086159,0.0012861394,0.00077239866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033726846,0.0001396912,0.0009354481,0.000085036794,0.000060338887,0.00007471828,0.00005866109,0.58430845,0.022688208,0.008395164,0.0020301752,0.3808868],"study_design_scores_gemma":[0.0000018785759,0.000009353048,0.000074782554,0.000001350115,0.0000016161752,0.000007262077,0.0000019879444,0.99856585,0.0006230988,0.0006338126,0.00007697649,0.0000020605062],"about_ca_topic_score_codex":0.0038449557,"about_ca_topic_score_gemma":0.00635558,"teacher_disagreement_score":0.0038449557,"about_ca_system_score_codex":0.0004272071,"about_ca_system_score_gemma":0.0004892192,"threshold_uncertainty_score":0.0113892555},"labels":[],"label_agreement":null},{"id":"W4410719582","doi":"10.1007/978-3-031-92387-6_29","title":"SkelFormer: Markerless 3D Pose and Shape Estimation Using Skeletal Transformers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","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":"Ubisoft (Canada); Queen's University","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Pose; Transformer; Computer graphics (images); Engineering; Electrical engineering","score_opus":0.01472359652978846,"score_gpt":0.2538348994507325,"score_spread":0.23911130292094404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719582","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.001307347,0.00009073393,0.9838262,0.00001708515,0.00002806001,0.00003602413,0.00044611064,0.012554943,0.0016934469],"genre_scores_gemma":[0.048971582,0.0003263858,0.9261368,0.00008657886,0.000040260726,0.00010460699,0.0036280088,0.0039524394,0.016753359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920624,0.00006127768,0.000032182605,0.00020792775,0.00043674462,0.000055591176],"domain_scores_gemma":[0.999456,0.00013468978,0.00003971252,0.0002258197,0.000117805896,0.000026044081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006747729,0.0015814428,0.0013579599,0.0012722064,0.00036336586,0.0013423471,0.0028392274,0.0010532832,0.03620183],"category_scores_gemma":[0.0017207044,0.0012202947,0.0009499644,0.0014580236,0.00052519544,0.0023032266,0.0028492052,0.001379628,0.025860958],"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.00021493042,0.000045936402,0.00026845583,0.00016835191,0.0000428439,0.00009786233,0.00007322877,0.010830902,0.03317418,0.008138859,0.021340264,0.92560416],"study_design_scores_gemma":[0.00008868526,0.00020511948,0.0015227807,0.0000955451,0.00006359367,0.00094209664,0.000100120196,0.7660679,0.11399683,0.029630013,0.08717595,0.00011127484],"about_ca_topic_score_codex":0.0025175654,"about_ca_topic_score_gemma":0.004725125,"teacher_disagreement_score":0.03620183,"about_ca_system_score_codex":0.00028426878,"about_ca_system_score_gemma":0.0006326797,"threshold_uncertainty_score":0.12110722},"labels":[],"label_agreement":null},{"id":"W4410719643","doi":"10.1007/978-3-031-91838-4_14","title":"QSD: Query-Selection Denoising Score for Image Editing in Latent Diffusion Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Selection (genetic algorithm); Image denoising; Noise reduction; Artificial intelligence; Image editing; Image (mathematics); Computer vision; Pattern recognition (psychology)","score_opus":0.01806262709527675,"score_gpt":0.24312162780143012,"score_spread":0.22505900070615337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004824609,0.00047431784,0.99038893,0.00017565335,0.00010119161,0.00007269309,0.0003303176,0.002760303,0.00087190745],"genre_scores_gemma":[0.17804603,0.0008796121,0.8013167,0.00037826522,0.00026116872,0.00023727716,0.0030836079,0.0014598543,0.014337428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.00022664828,0.000048402402,0.0002804961,0.00044485537,0.00010365804],"domain_scores_gemma":[0.9989203,0.0003684094,0.00004829596,0.00026942385,0.00030818328,0.00008535095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019146896,0.0010692817,0.0018334053,0.0009158528,0.00041150334,0.0013399891,0.0019625945,0.0014961382,0.008190799],"category_scores_gemma":[0.0042643473,0.00042432765,0.00090340764,0.001013069,0.00069267536,0.0018103471,0.0019128314,0.0018582261,0.0029669097],"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.0006049401,0.0002073608,0.0007768221,0.000314071,0.00015066353,0.00013975728,0.00008780401,0.11194603,0.036427543,0.026812619,0.03545312,0.7870793],"study_design_scores_gemma":[0.000031462157,0.0000737834,0.00027124595,0.000012222032,0.000022769938,0.00011269384,0.000015291445,0.97324187,0.012300746,0.009507284,0.00438851,0.000022074684],"about_ca_topic_score_codex":0.0040089986,"about_ca_topic_score_gemma":0.00587943,"teacher_disagreement_score":0.008190799,"about_ca_system_score_codex":0.00085534214,"about_ca_system_score_gemma":0.001211232,"threshold_uncertainty_score":0.02740097},"labels":[],"label_agreement":null},{"id":"W4410719651","doi":"10.1007/978-3-031-91838-4_4","title":"IPAdapter-Instruct: Resolving Ambiguity in Image-Based Conditioning Using Instruct Prompts","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Membrane Reactor Technologies (Canada)","funders":"","keywords":"Computer science; Ambiguity; Conditioning; Image (mathematics); Computer vision; Artificial intelligence; Computer graphics (images); Human–computer interaction; Multimedia; Programming language; Mathematics; Statistics","score_opus":0.022040909980660318,"score_gpt":0.27785654817346855,"score_spread":0.2558156381928082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019322082,0.00044602153,0.8748346,0.0003079012,0.00046490805,0.00024975959,0.0005884397,0.047967605,0.05581867],"genre_scores_gemma":[0.3064142,0.00077556795,0.5991657,0.00076184724,0.00020171548,0.0005475801,0.001435212,0.009223722,0.08147444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985254,0.00002631833,0.000007071886,0.00004222621,0.000050260824,0.000021596243],"domain_scores_gemma":[0.9995603,0.0002759329,0.000024208326,0.000053547516,0.00004452635,0.00004146439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033099862,0.0008542959,0.0004594252,0.00018865547,0.0002696444,0.00090970146,0.0014162766,0.00079505914,0.06620277],"category_scores_gemma":[0.001748991,0.00035214928,0.00027955987,0.00017615494,0.00054971024,0.0016321603,0.0012841473,0.0014548538,0.011646894],"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.0011299541,0.00033365755,0.00043550134,0.00046081617,0.000021354599,0.00038139423,0.0004442001,0.00652775,0.09919768,0.043764085,0.05611582,0.79118776],"study_design_scores_gemma":[0.0006316778,0.00094883156,0.0025254274,0.0003382542,0.00009612735,0.0016262035,0.0002463275,0.2750619,0.3471364,0.10836554,0.26288006,0.00014328158],"about_ca_topic_score_codex":0.0004138894,"about_ca_topic_score_gemma":0.0005188188,"teacher_disagreement_score":0.06620277,"about_ca_system_score_codex":0.00020781354,"about_ca_system_score_gemma":0.00034873871,"threshold_uncertainty_score":0.2214703},"labels":[],"label_agreement":null},{"id":"W4410719696","doi":"10.1007/978-3-031-91838-4_5","title":"Frequency-Aware Guidance for Blind Image Restoration via Diffusion Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Vector Institute","funders":"","keywords":"Computer science; Image restoration; Diffusion; Computer vision; Image (mathematics); Artificial intelligence; Image processing","score_opus":0.028741979877520873,"score_gpt":0.29255567520002534,"score_spread":0.2638136953225045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410719696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023832952,0.00026455082,0.9957568,0.00009908666,0.000034648805,0.0000072506314,0.000018085715,0.00019608386,0.0012402288],"genre_scores_gemma":[0.21329446,0.0018145058,0.763744,0.00020192906,0.0001417138,0.00006743108,0.000172753,0.00037436836,0.02018891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998254,0.000041678835,0.000007706332,0.000035632733,0.000071491704,0.000017995111],"domain_scores_gemma":[0.99962616,0.00019847996,0.000037653153,0.000044760345,0.000078370234,0.0000144618225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003424207,0.00067818176,0.0006804415,0.00036985098,0.00022837099,0.00072949607,0.000609804,0.0011877329,0.0021966216],"category_scores_gemma":[0.0016319402,0.0003756192,0.00060633826,0.0003746497,0.0005560939,0.0009790331,0.00083682,0.0014229456,0.00092834287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028522007,0.00010825422,0.00024223147,0.0003883486,0.00007600252,0.00011507744,0.00016666244,0.39018574,0.10997632,0.10974964,0.008453956,0.3802526],"study_design_scores_gemma":[0.0000066630564,0.000029833027,0.000052425898,0.000013983738,0.000011000651,0.000078715755,0.0000076095507,0.9740404,0.009301903,0.013336407,0.0031071955,0.000013870207],"about_ca_topic_score_codex":0.0018479439,"about_ca_topic_score_gemma":0.0025852176,"teacher_disagreement_score":0.0021966216,"about_ca_system_score_codex":0.00039172554,"about_ca_system_score_gemma":0.0005593557,"threshold_uncertainty_score":0.0073484182},"labels":[],"label_agreement":null},{"id":"W4410730166","doi":"10.1007/978-3-031-91585-7_24","title":"Embedding Geometries of Contrastive Language-Image Pre-training","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Glycemic Index Laboratories","funders":"","keywords":"Computer science; Embedding; Training (meteorology); Artificial intelligence; Natural language processing; Image (mathematics)","score_opus":0.010926765436282486,"score_gpt":0.28872016188290783,"score_spread":0.2777933964466254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410730166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052516248,0.0002074344,0.9226054,0.00030350988,0.00011627241,0.00005027899,0.00038389128,0.0011520237,0.02266506],"genre_scores_gemma":[0.6472198,0.00035483876,0.31346548,0.00017294104,0.00012521925,0.000102019454,0.00089538685,0.0009973705,0.03666689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972194,0.000080551064,0.000016214795,0.0000735866,0.00006776297,0.00003982501],"domain_scores_gemma":[0.99927324,0.00030399457,0.000047693815,0.00016881712,0.00014324249,0.00006312369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033694124,0.00048841967,0.0003301263,0.00035037947,0.00025323918,0.00088529824,0.00078340335,0.00056778576,0.010964018],"category_scores_gemma":[0.0017557223,0.0003183071,0.00033838968,0.00021034507,0.000764614,0.0011896946,0.001158377,0.0011799638,0.0028910777],"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.00044261038,0.000100696874,0.00052005704,0.0002518523,0.0000221557,0.00029837887,0.0003914387,0.07368283,0.058985475,0.54902875,0.01098046,0.3052952],"study_design_scores_gemma":[0.000035382167,0.00034350954,0.00078406936,0.000061441584,0.000024151033,0.000532476,0.00021372199,0.54793876,0.061096773,0.3663176,0.022600787,0.000051203908],"about_ca_topic_score_codex":0.0007209191,"about_ca_topic_score_gemma":0.0011711495,"teacher_disagreement_score":0.010964018,"about_ca_system_score_codex":0.00044268643,"about_ca_system_score_gemma":0.00026596745,"threshold_uncertainty_score":0.036678255},"labels":[],"label_agreement":null},{"id":"W4410730174","doi":"10.1007/978-3-031-91585-7_21","title":"A Bottom-Up Approach to Class-Agnostic Image Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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; Simon Fraser University","funders":"","keywords":"Computer science; Top-down and bottom-up design; Class (philosophy); Segmentation; Image segmentation; Artificial intelligence; Computer vision; Image (mathematics); Programming language","score_opus":0.016145739897171767,"score_gpt":0.2815749654816712,"score_spread":0.26542922558449944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410730174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011748383,0.00019749919,0.99170965,0.00008551042,0.000052894447,0.00006877459,0.000098671146,0.0041347384,0.0024774775],"genre_scores_gemma":[0.035038482,0.00035841868,0.9516976,0.0003810947,0.000115693445,0.00009999856,0.00072896417,0.0016211282,0.009958697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783367,0.00019485573,0.0001171062,0.0006193524,0.00095575064,0.00027927],"domain_scores_gemma":[0.99785954,0.00043664625,0.00009306271,0.0009881842,0.00052794354,0.00009470076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010226761,0.0017767273,0.0023438893,0.0029347802,0.001578138,0.0040126937,0.005492907,0.0025681243,0.011330611],"category_scores_gemma":[0.0024681976,0.0017817969,0.0027399699,0.0028059739,0.0014309114,0.0026155892,0.004923405,0.0038644352,0.008546133],"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.00023187736,0.00021480111,0.000493975,0.00029698128,0.00013795405,0.00022662955,0.00016074088,0.023048142,0.093520276,0.028103631,0.019348226,0.8342168],"study_design_scores_gemma":[0.000034682755,0.00014082556,0.0012653891,0.000092854556,0.0001716154,0.000991533,0.00014029608,0.7363139,0.10390132,0.10346242,0.053372677,0.000112551665],"about_ca_topic_score_codex":0.004113571,"about_ca_topic_score_gemma":0.0086394595,"teacher_disagreement_score":0.011330611,"about_ca_system_score_codex":0.0012206278,"about_ca_system_score_gemma":0.001643872,"threshold_uncertainty_score":0.03790462},"labels":[],"label_agreement":null},{"id":"W4410730191","doi":"10.1007/978-3-031-91585-7_7","title":"TF-OCM: Training-Free Optimal Community Matching for Domain Generalized Few-Shot Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Shot (pellet); Matching (statistics); Domain (mathematical analysis); Artificial intelligence; Training (meteorology); Pattern recognition (psychology); Machine learning; Statistics; Mathematics","score_opus":0.04717910218694317,"score_gpt":0.28689223002154285,"score_spread":0.2397131278345997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410730191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054824958,0.0006639773,0.9823161,0.00014048607,0.0001443005,0.00016301984,0.0005280327,0.0091625275,0.0013991242],"genre_scores_gemma":[0.09107719,0.00038299797,0.89296806,0.00042086368,0.0001902233,0.00040190358,0.005019203,0.0017073337,0.007832242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810326,0.00037125748,0.0000864673,0.00077124743,0.0004420251,0.00022566359],"domain_scores_gemma":[0.99737144,0.0010359741,0.00009970574,0.0009001999,0.00040351762,0.00018906304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124481,0.0021433798,0.0037822493,0.0026803582,0.0013393684,0.0016070832,0.0066725556,0.004517431,0.01178084],"category_scores_gemma":[0.008249316,0.0012046472,0.0019640538,0.0033303178,0.00122278,0.004397563,0.0044255746,0.0040093735,0.006750173],"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.00043220044,0.00031660986,0.00046128978,0.00033230495,0.00015339057,0.00012977258,0.00009771042,0.079664096,0.010099314,0.008647745,0.03559749,0.8640681],"study_design_scores_gemma":[0.000042131007,0.000055255343,0.0001375171,0.000019268333,0.00001944073,0.000089860114,0.000026962713,0.976994,0.0034600147,0.016495854,0.0026417174,0.00001798922],"about_ca_topic_score_codex":0.012844615,"about_ca_topic_score_gemma":0.01836996,"teacher_disagreement_score":0.012844615,"about_ca_system_score_codex":0.0014441533,"about_ca_system_score_gemma":0.002257684,"threshold_uncertainty_score":0.03941077},"labels":[],"label_agreement":null},{"id":"W4410730193","doi":"10.1007/978-3-031-91585-7_11","title":"Logit Disagreement: OoD Detection with Bayesian Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Logit; Artificial neural network; Bayesian probability; Artificial intelligence; Machine learning","score_opus":0.008365054723067977,"score_gpt":0.22318977658620748,"score_spread":0.2148247218631395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410730193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018450381,0.00056523253,0.9745592,0.0008287394,0.00015632095,0.000049893275,0.00022684515,0.0015407326,0.0036226858],"genre_scores_gemma":[0.6628072,0.00047297435,0.31636247,0.00045617993,0.00040157276,0.00014895535,0.0008184751,0.00058658514,0.017945526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707174,0.0011775077,0.00013899426,0.0005498751,0.00078224816,0.00027969189],"domain_scores_gemma":[0.9921306,0.005698513,0.00045238293,0.00054788316,0.00095948647,0.00021110172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609255,0.00092168426,0.0017376051,0.001813048,0.00079841644,0.0027255428,0.0032281626,0.0027196398,0.0062186276],"category_scores_gemma":[0.023235982,0.0007002031,0.00072192115,0.0020114388,0.0011364304,0.0041200574,0.0039356165,0.00292032,0.0013247846],"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.0006732577,0.00022305356,0.007275238,0.00018784982,0.00012324803,0.00019601887,0.00020147885,0.25708172,0.0021322318,0.05969381,0.015985275,0.6562268],"study_design_scores_gemma":[0.0000083782215,0.000010199392,0.00031958055,0.0000101998785,0.0000062993176,0.000026505742,0.0000138412815,0.97008014,0.0006525193,0.028124765,0.0007374376,0.000010016293],"about_ca_topic_score_codex":0.0054967687,"about_ca_topic_score_gemma":0.0047499156,"teacher_disagreement_score":0.0062186276,"about_ca_system_score_codex":0.0013077823,"about_ca_system_score_gemma":0.00095152063,"threshold_uncertainty_score":0.024376392},"labels":[],"label_agreement":null},{"id":"W4410730207","doi":"10.1007/978-3-031-91585-7_18","title":"The BRAVO Semantic Segmentation Challenge Results in UNCV2024","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"European Commission","keywords":"Computer science; Segmentation; Artificial intelligence; Natural language processing; Computer vision","score_opus":0.015062197627640904,"score_gpt":0.2642194236241006,"score_spread":0.2491572259964597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410730207","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19702806,0.025138369,0.12805559,0.025596302,0.020122431,0.0011537869,0.20823874,0.13264583,0.26202098],"genre_scores_gemma":[0.22909848,0.002330094,0.108323,0.005970917,0.0011772766,0.00047697392,0.5836099,0.01620323,0.05281015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99494416,0.00096787576,0.00025465921,0.0015442733,0.0015298626,0.00075908465],"domain_scores_gemma":[0.9957885,0.001130906,0.000095283576,0.0012267326,0.0014320677,0.00032648616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030235932,0.003218102,0.0027951712,0.0027677643,0.004078382,0.0051315837,0.0031632292,0.0058848225,0.01529002],"category_scores_gemma":[0.011223798,0.00071130117,0.0019258023,0.0029689993,0.0015726044,0.004173301,0.0040497715,0.0036046938,0.016709412],"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.0008676255,0.00023206676,0.001152396,0.000642347,0.00015144052,0.00038819696,0.00025533626,0.007212098,0.0041874326,0.008114566,0.8192558,0.15754065],"study_design_scores_gemma":[0.00035664023,0.00022250564,0.0051826136,0.00063061,0.0002907148,0.0014695522,0.0019516448,0.14617407,0.028213708,0.06359625,0.75173163,0.00018012544],"about_ca_topic_score_codex":0.068237916,"about_ca_topic_score_gemma":0.12592904,"teacher_disagreement_score":0.068237916,"about_ca_system_score_codex":0.0026828528,"about_ca_system_score_gemma":0.004181257,"threshold_uncertainty_score":0.13568145},"labels":[],"label_agreement":null},{"id":"W4410738508","doi":"10.1007/978-3-031-91767-7_24","title":"The Second Visual Object Tracking Segmentation VOTS2024 Challenge Results","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Ontario Tech University; University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Segmentation; Object (grammar); Image segmentation; Tracking (education); Video tracking; Computer graphics (images)","score_opus":0.026340471859668396,"score_gpt":0.3118841803097401,"score_spread":0.2855437084500717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410738508","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14689618,0.03357506,0.49579215,0.019701062,0.03010914,0.00323909,0.08257341,0.06559825,0.12251557],"genre_scores_gemma":[0.21853098,0.003773352,0.32037008,0.005974977,0.0038052376,0.0011012212,0.32456458,0.0072874995,0.11459201],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960395,0.0004623149,0.00017546458,0.0013078395,0.0014456032,0.0005691492],"domain_scores_gemma":[0.9958341,0.0008623712,0.00009980701,0.001042934,0.0015113624,0.0006494008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037488113,0.0031968683,0.0037479962,0.0016742273,0.002229344,0.0046164384,0.0031295042,0.0051844716,0.010546244],"category_scores_gemma":[0.007087826,0.00079561694,0.0019873676,0.0018353577,0.00095579383,0.0022397384,0.0034746574,0.0034677482,0.012968886],"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.0014404744,0.0006417023,0.0011885655,0.00092833623,0.00034191678,0.00047667083,0.00018640741,0.01005785,0.022022383,0.0037965926,0.51483893,0.44408023],"study_design_scores_gemma":[0.0011983288,0.0019942066,0.012977116,0.00041772064,0.00056259934,0.0022120753,0.0006831727,0.2868499,0.0948054,0.030100653,0.5679742,0.00022453595],"about_ca_topic_score_codex":0.026714459,"about_ca_topic_score_gemma":0.032992046,"teacher_disagreement_score":0.026714459,"about_ca_system_score_codex":0.0020833702,"about_ca_system_score_gemma":0.003212547,"threshold_uncertainty_score":0.05311787},"labels":[],"label_agreement":null},{"id":"W4410743037","doi":"10.1007/978-3-031-88217-3_11","title":"Dynamic Modality and View Selection for Emotion Recognition: An Experimental Study on Missing Modality Evaluation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"École de Technologie Supérieure","funders":"","keywords":"Modality (human–computer interaction); Computer science; Selection (genetic algorithm); Artificial intelligence; Natural language processing","score_opus":0.0869547995821235,"score_gpt":0.3944589882852563,"score_spread":0.3075041887031328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410743037","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.98338175,0.00048341366,0.013080549,0.000050183222,0.00009926711,0.00015993566,0.00019891962,0.00014674535,0.0023991978],"genre_scores_gemma":[0.98543733,0.00024464022,0.010669708,0.000092032235,0.000060066694,0.00020977677,0.000458562,0.00022069513,0.002607277],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983134,0.0006833016,0.0001646628,0.00040607085,0.00031104378,0.0001214643],"domain_scores_gemma":[0.9829402,0.013407998,0.0006543944,0.0015874472,0.0008808182,0.0005291829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675412,0.0008078161,0.0009718881,0.00026310308,0.00033297198,0.0012931142,0.0008494026,0.00078817195,0.0074585956],"category_scores_gemma":[0.021951267,0.0002801498,0.00047976073,0.0002106853,0.0005069666,0.0020411361,0.0010403815,0.0009395562,0.0010424431],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.052759055,0.008878798,0.01910419,0.0014073013,0.00042388705,0.00059029856,0.004925664,0.004276186,0.59285694,0.0019943146,0.00395635,0.30882707],"study_design_scores_gemma":[0.0045845276,0.08754564,0.24440376,0.0005520574,0.0033308438,0.0054101087,0.0075627286,0.25233766,0.36337262,0.014858905,0.015300512,0.0007406649],"about_ca_topic_score_codex":0.0007056567,"about_ca_topic_score_gemma":0.00044698082,"teacher_disagreement_score":0.0074585956,"about_ca_system_score_codex":0.00017571275,"about_ca_system_score_gemma":0.00025836285,"threshold_uncertainty_score":0.024951518},"labels":[],"label_agreement":null},{"id":"W4410757481","doi":"10.1007/978-3-031-91835-3_18","title":"SynthSet: Generative Diffusion Model for Semantic Segmentation in Precision Agriculture","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"Computer science; Generative grammar; Segmentation; Generative model; Artificial intelligence; Diffusion; Natural language processing","score_opus":0.017221435224367424,"score_gpt":0.23405980999817427,"score_spread":0.21683837477380685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410757481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008455919,0.00045812706,0.98265153,0.00025989008,0.000107498585,0.000045478413,0.0007315284,0.0050972793,0.0021927203],"genre_scores_gemma":[0.3533847,0.0009462307,0.618305,0.00042305124,0.00018313201,0.0003106737,0.0046188445,0.0037619115,0.01806652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996815,0.000075808435,0.000016627004,0.00011923497,0.00007151387,0.00003535608],"domain_scores_gemma":[0.99927324,0.00049627764,0.00002680877,0.00007502497,0.000094173316,0.000034471894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075101247,0.0010450906,0.001516057,0.0009436678,0.0007693992,0.0016707185,0.0022930074,0.0025689332,0.008342608],"category_scores_gemma":[0.0023845704,0.0011382055,0.0017826257,0.0014237461,0.0008731351,0.0021326574,0.0016281527,0.002388827,0.002550152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003679017,0.00007482004,0.00063487835,0.00023111432,0.00013161289,0.00017100853,0.00023036833,0.74563336,0.009035312,0.05506314,0.012384428,0.17604207],"study_design_scores_gemma":[0.00000935691,0.000007629745,0.000042835112,0.000006267779,0.00000808418,0.000019145375,0.0000070086357,0.98298866,0.0010896833,0.014326206,0.001488183,0.0000070237916],"about_ca_topic_score_codex":0.020109005,"about_ca_topic_score_gemma":0.025488345,"teacher_disagreement_score":0.020109005,"about_ca_system_score_codex":0.001670856,"about_ca_system_score_gemma":0.0013296126,"threshold_uncertainty_score":0.03998393},"labels":[],"label_agreement":null},{"id":"W4410757657","doi":"10.1007/978-3-031-91835-3_21","title":"Beyond Annotations: Efficient Wheat Head Segmentation Using L-Systems, Game Engines, and Student-Teacher Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","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 Saskatchewan; University of Calgary","funders":"","keywords":"Computer science; Head (geology); Segmentation; Game engine; Computer graphics (images); Artificial intelligence; Human–computer interaction; Computer vision; Multimedia","score_opus":0.02500755435280562,"score_gpt":0.2552152632859572,"score_spread":0.23020770893315157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410757657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035376903,0.00032765462,0.9259252,0.00023489069,0.0001128715,0.000106402396,0.0010743336,0.030395757,0.0064460356],"genre_scores_gemma":[0.44295126,0.0002856791,0.5309817,0.00028007582,0.00006593656,0.000117880845,0.0037529164,0.003737011,0.017827446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996433,0.000067157496,0.000015311645,0.00014427253,0.00006594823,0.00006412058],"domain_scores_gemma":[0.99938405,0.00030154036,0.000033193,0.00011516206,0.0001141441,0.000051813935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004728979,0.0012205156,0.0010078907,0.0006517622,0.0005909033,0.001801931,0.002256538,0.0015448374,0.00989656],"category_scores_gemma":[0.0015634998,0.0008435361,0.00093866815,0.00086213736,0.0004181632,0.002096281,0.0015807255,0.0010882092,0.0052479],"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.0012132049,0.00025730312,0.0019481891,0.00018751576,0.00010691512,0.0002389776,0.00027458035,0.15093598,0.028184446,0.00625021,0.025676765,0.78472584],"study_design_scores_gemma":[0.000029234885,0.000041044237,0.00037314883,0.000009792833,0.000017936833,0.000038911112,0.00006685291,0.98519105,0.006836184,0.004613086,0.0027664755,0.000016298533],"about_ca_topic_score_codex":0.020461157,"about_ca_topic_score_gemma":0.043814473,"teacher_disagreement_score":0.020461157,"about_ca_system_score_codex":0.0008627097,"about_ca_system_score_gemma":0.0010611023,"threshold_uncertainty_score":0.040684104},"labels":[],"label_agreement":null},{"id":"W4410757907","doi":"10.1007/978-3-031-91835-3_19","title":"Robust UDA for Crop and Weed Segmentation: Multi-scale Attention and Style-Adaptive Techniques","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Weed; Scale (ratio); Segmentation; Artificial intelligence; Agricultural engineering; Computer vision; Cartography; Agronomy; Geography","score_opus":0.027050069492414824,"score_gpt":0.2331809464175508,"score_spread":0.206130876925136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410757907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010437866,0.001501567,0.982463,0.000109586595,0.00017089448,0.000051782918,0.00018329459,0.0030641956,0.0020178284],"genre_scores_gemma":[0.1296548,0.0013398607,0.8553682,0.00038308292,0.00022054857,0.00011448993,0.0008456177,0.0013189485,0.01075441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994764,0.000073279334,0.000028886938,0.00017779245,0.0001519971,0.00009166628],"domain_scores_gemma":[0.99935967,0.00023369363,0.000047158162,0.00013086916,0.00018583007,0.00004275159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212282,0.0012228301,0.0017984152,0.0019822433,0.00055389147,0.0013317512,0.0016870213,0.0013738803,0.0044914046],"category_scores_gemma":[0.0014766825,0.0006792882,0.0017642429,0.0024847055,0.00043373465,0.0013359656,0.0013321476,0.0013301977,0.002764309],"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.00016016932,0.00008750304,0.00031361275,0.00010887551,0.00008296149,0.000041991985,0.000052980628,0.016092109,0.061379172,0.0011339021,0.0040434827,0.9165031],"study_design_scores_gemma":[0.000011749715,0.00007139559,0.0017476232,0.000018216688,0.000079660604,0.00014790434,0.0000390539,0.96133596,0.028892303,0.0024281375,0.005195896,0.000032142052],"about_ca_topic_score_codex":0.0060710562,"about_ca_topic_score_gemma":0.011798746,"teacher_disagreement_score":0.0060710562,"about_ca_system_score_codex":0.0005597544,"about_ca_system_score_gemma":0.00077437976,"threshold_uncertainty_score":0.015025318},"labels":[],"label_agreement":null},{"id":"W4410758295","doi":"10.1007/978-3-031-91835-3_2","title":"Soybean Pod and Seed Counting in Both Outdoor Fields and Indoor Laboratories Using Unions of Deep Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","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":"Ministry of Agriculture","funders":"","keywords":"Point of delivery; Computer science; Artificial neural network; Artificial intelligence; Agricultural engineering; Agronomy; Engineering","score_opus":0.010431685493108791,"score_gpt":0.21086809521298408,"score_spread":0.20043640971987528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410758295","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.70307654,0.00081311446,0.28074455,0.00034031886,0.00016198006,0.000042560205,0.0015440724,0.0039063934,0.0093704285],"genre_scores_gemma":[0.92707914,0.0001726846,0.06407254,0.00005654924,0.00004193903,0.000020290585,0.0017247103,0.00011309649,0.0067190374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981743,0.000019636229,0.0000063330053,0.0000839389,0.000036085083,0.00003654437],"domain_scores_gemma":[0.9996424,0.00014626357,0.00003999501,0.000041809177,0.00008846049,0.000041049338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036299246,0.0005886273,0.00052519445,0.0008440129,0.00024239733,0.0006346947,0.0010064807,0.00064988894,0.0018557681],"category_scores_gemma":[0.0006743534,0.0003931292,0.00061051146,0.0010605181,0.00018142087,0.00083062466,0.00058571936,0.0005572793,0.00063132076],"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.0011541196,0.0005351648,0.03044421,0.00013979939,0.0002125603,0.0002316459,0.000097599055,0.30668527,0.028742718,0.0020162996,0.0059482036,0.6237923],"study_design_scores_gemma":[0.0000048820652,0.000016374477,0.003069818,0.0000028952657,0.000009093089,0.000012255709,0.000014057687,0.99426794,0.0019233574,0.0005014522,0.00017177964,0.0000060628286],"about_ca_topic_score_codex":0.023570463,"about_ca_topic_score_gemma":0.055319797,"teacher_disagreement_score":0.023570463,"about_ca_system_score_codex":0.0007398859,"about_ca_system_score_gemma":0.00062040513,"threshold_uncertainty_score":0.046866536},"labels":[],"label_agreement":null},{"id":"W4410771955","doi":"10.1007/978-3-031-92460-6_5","title":"ES-PTAM: Event-Based Stereo Parallel Tracking and Mapping","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Event (particle physics); Computer vision; Tracking (education); Artificial intelligence; Computer graphics (images)","score_opus":0.015467680577793836,"score_gpt":0.2225123586277081,"score_spread":0.20704467804991428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410771955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014902311,0.00020693945,0.97952867,0.000046523626,0.00015048447,0.000042906195,0.0004767141,0.013781828,0.004275647],"genre_scores_gemma":[0.06717739,0.00057074317,0.9066961,0.00022343262,0.00014510503,0.00019393583,0.0028953955,0.0018984439,0.020199452],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949765,0.000036855887,0.000021552414,0.00012473372,0.00027961325,0.000039485545],"domain_scores_gemma":[0.99959666,0.00007199253,0.00002469234,0.00016099386,0.00012138913,0.000024285098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046461986,0.0009968741,0.001073203,0.0010190391,0.0004093881,0.0012047986,0.0027597083,0.0009437199,0.021959014],"category_scores_gemma":[0.00096793764,0.0006442242,0.0006518808,0.0018721839,0.00034469264,0.0016783639,0.001922437,0.0010244513,0.010219443],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025732038,0.00008963646,0.00032590737,0.00017666961,0.00007235414,0.00009732154,0.000052702846,0.031637177,0.025691096,0.010003634,0.04606112,0.88553494],"study_design_scores_gemma":[0.00006385927,0.00008456542,0.00095823855,0.00003310701,0.000034491404,0.000352964,0.000038460992,0.8817667,0.032087285,0.018206023,0.06632872,0.00004567356],"about_ca_topic_score_codex":0.0038017556,"about_ca_topic_score_gemma":0.0058645126,"teacher_disagreement_score":0.021959014,"about_ca_system_score_codex":0.00048814554,"about_ca_system_score_gemma":0.0007212679,"threshold_uncertainty_score":0.07346022},"labels":[],"label_agreement":null},{"id":"W4410772355","doi":"10.1007/978-3-031-92460-6_10","title":"MouseSIS: A Frames-and-Events Dataset for Space-Time Instance Segmentation of Mice","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Computer vision; Pattern recognition (psychology)","score_opus":0.007467782362032227,"score_gpt":0.268324727976947,"score_spread":0.2608569456149148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410772355","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014237935,0.0014589651,0.037689354,0.0003399638,0.00024717057,0.00033554022,0.875249,0.06744047,0.0030016296],"genre_scores_gemma":[0.013023685,0.0004791667,0.053796403,0.00013795301,0.000032795353,0.00042067055,0.9282244,0.0024743557,0.001410633],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936575,0.000057403402,0.00006734629,0.00023492383,0.00018998186,0.00008456355],"domain_scores_gemma":[0.9992949,0.00022198078,0.000071098606,0.00017916529,0.00012413436,0.00010871599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545824,0.0030189266,0.0014509679,0.003279432,0.0006200646,0.0013661634,0.0026823182,0.0019272603,0.010104462],"category_scores_gemma":[0.0022520935,0.0008226157,0.0020059024,0.0026835278,0.00033103838,0.00082107837,0.0011616604,0.0016176507,0.010394109],"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.0013051707,0.00043266246,0.0048849196,0.0022312002,0.00047901535,0.00049629365,0.0001990967,0.021791462,0.029962722,0.0034399803,0.80638134,0.12839614],"study_design_scores_gemma":[0.0010544555,0.0005053814,0.02829916,0.00059961865,0.00040538653,0.0020686702,0.00041669258,0.22907145,0.05765275,0.017887935,0.66164106,0.00039746377],"about_ca_topic_score_codex":0.017882708,"about_ca_topic_score_gemma":0.04933617,"teacher_disagreement_score":0.017882708,"about_ca_system_score_codex":0.0010799571,"about_ca_system_score_gemma":0.0015606722,"threshold_uncertainty_score":0.03555721},"labels":[],"label_agreement":null},{"id":"W4410775661","doi":"10.1007/978-3-031-91581-9_5","title":"Textualized and Feature-Based Models for Compound Multimodal Emotion Recognition in the Wild","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Concordia University; Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; École de Technologie Supérieure; Bell (Canada)","funders":"","keywords":"Computer science; Feature (linguistics); Speech recognition; Pattern recognition (psychology); Emotion recognition; Artificial intelligence; Linguistics","score_opus":0.044340530567949135,"score_gpt":0.3072098254490073,"score_spread":0.2628692948810582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410775661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043080434,0.0010889634,0.947218,0.00039580977,0.00029064913,0.00007744995,0.0015249702,0.0033098233,0.0030139561],"genre_scores_gemma":[0.6966822,0.0010875962,0.27580017,0.00027927916,0.0003119696,0.00038691843,0.005424739,0.00053683686,0.019490303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997639,0.000052591477,0.0000164307,0.000093426344,0.000036466594,0.00003713653],"domain_scores_gemma":[0.99947745,0.00026834596,0.000028595168,0.00007451273,0.000130965,0.000020155318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241882,0.0008845823,0.0007939879,0.00040214887,0.00025926376,0.0011690853,0.0014254207,0.0009651162,0.0077580293],"category_scores_gemma":[0.0017120375,0.00035169083,0.0010641554,0.00063708954,0.00025968807,0.0019071838,0.0006744437,0.001303503,0.0034008503],"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.0009630453,0.00039502967,0.001953504,0.00019637449,0.00019735546,0.000218438,0.0001356716,0.25246587,0.05370717,0.008048567,0.014089609,0.6676294],"study_design_scores_gemma":[0.000005196909,0.00003353939,0.0004056028,0.000005782568,0.00001529856,0.000022114526,0.000011832268,0.99395555,0.002143019,0.0028615405,0.00053050194,0.000010076682],"about_ca_topic_score_codex":0.0054143392,"about_ca_topic_score_gemma":0.0061043655,"teacher_disagreement_score":0.0077580293,"about_ca_system_score_codex":0.0005652318,"about_ca_system_score_gemma":0.00035261773,"threshold_uncertainty_score":0.025953174},"labels":[],"label_agreement":null},{"id":"W4410824262","doi":"10.1007/978-3-031-92710-2_20","title":"Caring in the Digital Age: Implications of a Telehealth Self-evaluation Tool for Informal Caregivers in Québec, Canada","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","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":true,"ca_institutions":"Concordia University; Université de Montréal","funders":"","keywords":"Telehealth; Computer science; Telemedicine; Political science; Health care","score_opus":0.014624723453590264,"score_gpt":0.2748882869873219,"score_spread":0.2602635635337316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410824262","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.9029019,0.0062201703,0.001803812,0.017007798,0.00043547826,0.00061557436,0.0008823772,0.00009942334,0.07003343],"genre_scores_gemma":[0.9639865,0.0038668346,0.0030917644,0.0011791823,0.000023069177,0.0002563633,0.00027323377,0.000040958206,0.027281981],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99883074,0.0004328592,0.00005705609,0.000049761984,0.00039267613,0.00023686787],"domain_scores_gemma":[0.99546427,0.0009383922,0.00012112988,0.00006161561,0.0025437684,0.00087075395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002898904,0.00019799721,0.000315051,0.0006670372,0.006006357,0.002544305,0.00090345845,0.0004667419,0.005487268],"category_scores_gemma":[0.0063661337,0.00015108832,0.00022660608,0.001472444,0.0008880333,0.0008548456,0.0011557224,0.00084280537,0.0003128099],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041678618,0.00068377244,0.1674344,0.00074289006,0.000024160789,0.0016869154,0.20057818,0.0007767737,0.0014022962,0.0057889344,0.07507987,0.545385],"study_design_scores_gemma":[0.00010966741,0.00043684462,0.50291646,0.0024846771,0.00005881903,0.00051617494,0.36627093,0.0022002158,0.0008212225,0.0009661691,0.12306034,0.00015850681],"about_ca_topic_score_codex":0.9859416,"about_ca_topic_score_gemma":0.9958489,"teacher_disagreement_score":0.03630021,"about_ca_system_score_codex":0.03630021,"about_ca_system_score_gemma":0.08470616,"threshold_uncertainty_score":0.26337773},"labels":[],"label_agreement":null},{"id":"W4410824296","doi":"10.1007/978-3-031-93727-9_9","title":"An EEG Study of Cognitive Load and Fatigue During Learning with a Computer Simulation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual and Cognitive Learning Processes","field":"Psychology","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":"HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cognitive load; Electroencephalography; Cognition; Artificial intelligence; Human–computer interaction; Psychology; Neuroscience","score_opus":0.027861636016889044,"score_gpt":0.3427363349190288,"score_spread":0.3148746989021397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410824296","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.9967307,0.00009043661,0.0019854126,0.000030573556,0.000013026194,0.000049003156,0.00015735795,0.000022136588,0.0009212696],"genre_scores_gemma":[0.9987814,0.00007259458,0.00052685855,0.00001509701,0.000015230196,0.000028850392,0.000089110385,0.00000862306,0.0004623493],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99990976,0.00002909492,0.0000042393194,0.000019402587,0.00002205355,0.000015403377],"domain_scores_gemma":[0.99959046,0.0002710059,0.000022422793,0.00003410776,0.000037552654,0.00004447863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013716787,0.0002422236,0.000218668,0.00026315852,0.00018295844,0.00022558813,0.00023575607,0.00028884894,0.0019802453],"category_scores_gemma":[0.0011496176,0.00012384063,0.00017711596,0.00029571907,0.0003271848,0.00017745538,0.00022161873,0.00035752374,0.00022888804],"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.020875078,0.0058884374,0.06586218,0.0005711508,0.00038673147,0.0025725365,0.0043164995,0.0029956487,0.7850064,0.0007289464,0.0016360888,0.10916029],"study_design_scores_gemma":[0.0007409341,0.022723312,0.85512173,0.00006102019,0.00025813523,0.0036900972,0.0021731332,0.01602719,0.09414909,0.0011708894,0.0038114693,0.00007310386],"about_ca_topic_score_codex":0.0012354555,"about_ca_topic_score_gemma":0.0010327421,"teacher_disagreement_score":0.0019802453,"about_ca_system_score_codex":0.000087253204,"about_ca_system_score_gemma":0.000094607385,"threshold_uncertainty_score":0.0066245794},"labels":[],"label_agreement":null},{"id":"W4410825887","doi":"10.1007/978-3-031-92712-6_14","title":"Upskilling the Old, a Quarter Century on: Media Literacies, AI and Older People in Public Policy Discourses","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Computer science; Media studies; Multimedia; Sociology; History","score_opus":0.014103174618632983,"score_gpt":0.3002824823486951,"score_spread":0.2861793077300621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410825887","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.060544293,0.090252295,0.0024875128,0.24553132,0.0056102206,0.000027425782,0.00015106249,0.000084563435,0.5953114],"genre_scores_gemma":[0.7422026,0.03757308,0.0011413783,0.036241718,0.005575537,0.000059701088,0.00010030503,0.00024559587,0.17686011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99854964,0.00076546293,0.000057192447,0.00013524063,0.00029719263,0.00019521342],"domain_scores_gemma":[0.99653035,0.0025889052,0.0001931719,0.00012744345,0.00027484607,0.0002852245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00395955,0.0004811131,0.00044852548,0.002419262,0.006050822,0.012805079,0.0006338702,0.003827546,0.010647351],"category_scores_gemma":[0.00668741,0.00031615735,0.00024450495,0.0026900494,0.014968916,0.02388994,0.0049745576,0.0072902646,0.0013863813],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003565925,0.000034078155,0.00060765573,0.00011988078,0.0000085984775,0.00016849996,0.20904593,0.000041228872,0.00019161408,0.68431926,0.05848187,0.046945676],"study_design_scores_gemma":[0.000008955568,0.000022252227,0.0015815758,0.00084815855,0.000012333344,0.00022113544,0.08573753,0.000120806115,0.0002609696,0.2240468,0.687116,0.000023398841],"about_ca_topic_score_codex":0.010264198,"about_ca_topic_score_gemma":0.017896421,"teacher_disagreement_score":0.9939492,"about_ca_system_score_codex":0.004231999,"about_ca_system_score_gemma":0.0023797182,"threshold_uncertainty_score":0.03561896},"labels":[],"label_agreement":null},{"id":"W4410842367","doi":"10.1007/978-3-031-92970-0_4","title":"A Roadmap for the Implementation of Adaptive Instructional Systems in the Canadian Armed Forces","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Tools and Methods","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":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Operations research; Management science; Simulation; Systems engineering; Engineering","score_opus":0.05311892028025486,"score_gpt":0.38124132132120975,"score_spread":0.3281224010409549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410842367","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049281128,0.026142538,0.0997165,0.27014178,0.0033287897,0.003769136,0.0027899817,0.0063018627,0.5385283],"genre_scores_gemma":[0.37531412,0.030379768,0.3789702,0.011344824,0.00033956865,0.0017402644,0.0035586422,0.0004599811,0.19789256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481577,0.0011040822,0.00020807941,0.00027155294,0.002047295,0.0015532547],"domain_scores_gemma":[0.9908544,0.0008496379,0.00018181233,0.00024649836,0.005153516,0.0027141613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008744483,0.0010391225,0.00042461228,0.0031846368,0.006061172,0.009215555,0.005197673,0.004322227,0.02323186],"category_scores_gemma":[0.00947315,0.0005355742,0.00059998716,0.0030689044,0.0035337298,0.002963939,0.0031143138,0.0032115255,0.0026894761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102495585,0.00047245232,0.0043643597,0.00104732,0.000028936272,0.00030811477,0.0031315945,0.009761277,0.0023173855,0.12906744,0.19381016,0.65558845],"study_design_scores_gemma":[0.0000669384,0.00027580024,0.012740566,0.0017926377,0.000047654576,0.00014384372,0.0064052413,0.007033527,0.0020168696,0.014326817,0.95505023,0.00009976609],"about_ca_topic_score_codex":0.9698808,"about_ca_topic_score_gemma":0.96831673,"teacher_disagreement_score":0.06574142,"about_ca_system_score_codex":0.06574142,"about_ca_system_score_gemma":0.34275126,"threshold_uncertainty_score":0.47698963},"labels":[],"label_agreement":null},{"id":"W4410842369","doi":"10.1007/978-3-031-92970-0_5","title":"Curriculum Modeling for Adaptive Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Athabasca University","funders":"","keywords":"Computer science; Artificial intelligence; Curriculum; Machine learning; Pedagogy","score_opus":0.023207933826758075,"score_gpt":0.2569786696278518,"score_spread":0.23377073580109375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410842369","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.005207361,0.00043441943,0.9820639,0.00033147447,0.00007031235,0.0000425308,0.00020738682,0.00085547846,0.010787125],"genre_scores_gemma":[0.53815526,0.0012092878,0.4258872,0.00019563995,0.000100662466,0.0003748105,0.0012126536,0.0004533491,0.03241108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953854,0.00018411572,0.000022579,0.00011745584,0.00008762389,0.00004980028],"domain_scores_gemma":[0.9992951,0.00041592482,0.00004615304,0.000101349266,0.00010635755,0.00003515538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868044,0.0005467784,0.00059636316,0.00060513546,0.0003455693,0.0011384077,0.0010541008,0.00067337696,0.01081146],"category_scores_gemma":[0.003924201,0.00039166134,0.00080981024,0.00074347615,0.00041013732,0.0018077812,0.0010233987,0.0012733368,0.0019524577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070600596,0.000111509515,0.000820246,0.0001313079,0.000055977274,0.000057307192,0.000173582,0.48828772,0.0009452911,0.2780653,0.008743072,0.2225381],"study_design_scores_gemma":[0.000006266102,0.000008990769,0.00010001411,0.000016054259,0.000008770246,0.000011080476,0.000019313178,0.9072982,0.000286438,0.08678914,0.005450986,0.0000047407225],"about_ca_topic_score_codex":0.0063983803,"about_ca_topic_score_gemma":0.005327044,"teacher_disagreement_score":0.01081146,"about_ca_system_score_codex":0.00092092674,"about_ca_system_score_gemma":0.00093327474,"threshold_uncertainty_score":0.03616792},"labels":[],"label_agreement":null},{"id":"W4410842378","doi":"10.1007/978-3-031-92970-0_9","title":"Adaptive Technologies for Aging Populations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Computer science","score_opus":0.051535528110777114,"score_gpt":0.30028213813308857,"score_spread":0.24874661002231147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410842378","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.011998773,0.031988245,0.87291694,0.001959852,0.0014199889,0.00006949259,0.00018361316,0.0014010424,0.078062095],"genre_scores_gemma":[0.24241546,0.043815672,0.38346124,0.0012297567,0.0017604274,0.0002974354,0.00050594745,0.0005392706,0.32597482],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999106,0.000017951084,0.000004936232,0.000022975511,0.00003650145,0.0000070901187],"domain_scores_gemma":[0.99980086,0.00010324195,0.0000096806325,0.000028393677,0.000047636062,0.000010180581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003513242,0.00040747365,0.00025476608,0.00039643914,0.0001375574,0.0006380666,0.00057589,0.000555949,0.013287172],"category_scores_gemma":[0.0010314378,0.0001294848,0.00020635301,0.0004967724,0.00024851333,0.00092639145,0.0005181585,0.00077217794,0.0030348052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030431589,0.000033813896,0.00027014496,0.00018522047,0.00001942474,0.00007666701,0.00013913737,0.005635746,0.008525676,0.04800856,0.026007283,0.91106796],"study_design_scores_gemma":[0.000036178386,0.00042737264,0.005771391,0.0003280472,0.00009455809,0.0014805967,0.00031974225,0.12625828,0.018648751,0.29594252,0.55063075,0.00006183784],"about_ca_topic_score_codex":0.0003644236,"about_ca_topic_score_gemma":0.0006169298,"teacher_disagreement_score":0.013287172,"about_ca_system_score_codex":0.00021803904,"about_ca_system_score_gemma":0.00019914153,"threshold_uncertainty_score":0.044449985},"labels":[],"label_agreement":null},{"id":"W4410842437","doi":"10.1007/978-3-031-92970-0_21","title":"Implementing Models of Programming Problem Solving","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Computer science; Programming language","score_opus":0.020288249872447744,"score_gpt":0.2665838640349967,"score_spread":0.24629561416254894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410842437","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.010019946,0.00017439606,0.94933426,0.00065654464,0.000085166845,0.000058223435,0.00009410017,0.0015525485,0.038024805],"genre_scores_gemma":[0.33291686,0.00053336396,0.6273519,0.0002670207,0.000059928294,0.0003566129,0.00064923725,0.0006810966,0.037183996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987668,0.0005423275,0.00006817989,0.00016784148,0.00035768058,0.00009724923],"domain_scores_gemma":[0.9976788,0.001298138,0.00009163136,0.0006556806,0.00019210522,0.000083788764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045594,0.0007550842,0.00048248164,0.00039084168,0.0005383206,0.0032986137,0.0021609908,0.001337247,0.015836054],"category_scores_gemma":[0.0054966025,0.0009383543,0.001010375,0.00067582674,0.0013867961,0.004959771,0.0019926622,0.0030907055,0.0022949588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005821325,0.000105057115,0.00040543335,0.00012650041,0.000020100279,0.00003618309,0.0003113963,0.04577719,0.0017750915,0.88074356,0.0036896828,0.066951506],"study_design_scores_gemma":[0.000034974033,0.00004886295,0.00010745344,0.00006121812,0.000024677243,0.000059672617,0.00010744545,0.27701128,0.0037662252,0.692455,0.026307246,0.000015964675],"about_ca_topic_score_codex":0.0012507318,"about_ca_topic_score_gemma":0.001693817,"teacher_disagreement_score":0.015836054,"about_ca_system_score_codex":0.0010113192,"about_ca_system_score_gemma":0.0010714175,"threshold_uncertainty_score":0.052976906},"labels":[],"label_agreement":null},{"id":"W4410846086","doi":"10.1007/978-3-031-93418-6_10","title":"Beyond Words: Exploring Emotional Contrasts Between Human and ChatGPT Responses in Medicine and Finance","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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; University of Saskatchewan","funders":"","keywords":"Computer science; Cognitive science; Artificial intelligence; Data science; Finance; Psychology","score_opus":0.16679676341753705,"score_gpt":0.3973771900728425,"score_spread":0.23058042665530545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410846086","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.96972084,0.0004113879,0.006626664,0.0004412035,0.000072233954,0.000036500027,0.00027071786,0.0000599065,0.022360547],"genre_scores_gemma":[0.99521554,0.000105574116,0.0018077377,0.00021982832,0.000028688944,0.000032403474,0.00014195673,0.000046801917,0.0024015177],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9995252,0.00029130935,0.000010524894,0.00004675904,0.00008513355,0.000041180894],"domain_scores_gemma":[0.9960299,0.0034172256,0.00021246464,0.0000809941,0.00015031197,0.00010912155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006608341,0.00018219142,0.00015771513,0.00037220577,0.00034704708,0.0020225567,0.00026018816,0.00058588356,0.004014501],"category_scores_gemma":[0.009794063,0.00011416505,0.00011754434,0.0003854579,0.0007102276,0.0015221433,0.0010721448,0.000772115,0.00047821976],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050441655,0.00031574626,0.14401445,0.001586477,0.00025939,0.0039151637,0.36624542,0.0041264263,0.19700988,0.03866699,0.011005084,0.22781084],"study_design_scores_gemma":[0.000097588636,0.00067724567,0.73880476,0.00040153554,0.00016085274,0.0031682786,0.15928367,0.018473014,0.014071084,0.031798422,0.032902233,0.00016121379],"about_ca_topic_score_codex":0.00062387064,"about_ca_topic_score_gemma":0.0010027722,"teacher_disagreement_score":0.004014501,"about_ca_system_score_codex":0.00036406144,"about_ca_system_score_gemma":0.00010487998,"threshold_uncertainty_score":0.013429821},"labels":[],"label_agreement":null},{"id":"W4410846279","doi":"10.1007/978-3-031-92970-0_14","title":"Human-in-the-Loop Integration of Causal Reasoning into Intelligent Tutoring Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Loop (graph theory); Artificial intelligence; Human-in-the-loop; Human–computer interaction; Cognitive science; Causal reasoning; Cognition; Psychology; Mathematics","score_opus":0.02579964170617863,"score_gpt":0.2799861745761967,"score_spread":0.254186532870018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410846279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014549944,0.00032181837,0.972828,0.00019953858,0.000074713455,0.000051942217,0.000032243017,0.0028941177,0.009047737],"genre_scores_gemma":[0.6767862,0.000535107,0.3154731,0.00011913927,0.00008397842,0.00008519577,0.00014040568,0.0002893325,0.006487552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957186,0.00016944605,0.000026714957,0.00009729254,0.000104482235,0.000030231306],"domain_scores_gemma":[0.9988979,0.00078141666,0.000046673398,0.00011965723,0.00010492706,0.0000493789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080458407,0.00046423933,0.00045851193,0.00028644525,0.00027947858,0.0016148438,0.0013342878,0.00069054373,0.007857034],"category_scores_gemma":[0.00325317,0.00032885157,0.00033451832,0.00024707004,0.0006388507,0.0018654658,0.00113119,0.0008862692,0.0012106646],"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.0006547267,0.0004772914,0.0011387403,0.00035563178,0.00017478259,0.00026377974,0.0009204899,0.17838128,0.043143854,0.088002294,0.005943473,0.6805436],"study_design_scores_gemma":[0.000040946015,0.00012789355,0.00047275034,0.000027004959,0.000059281334,0.00008117191,0.00005839394,0.87425107,0.0166698,0.097688064,0.010499745,0.00002381984],"about_ca_topic_score_codex":0.0013920566,"about_ca_topic_score_gemma":0.0015527656,"teacher_disagreement_score":0.007857034,"about_ca_system_score_codex":0.00038475374,"about_ca_system_score_gemma":0.00062929594,"threshold_uncertainty_score":0.026284337},"labels":[],"label_agreement":null},{"id":"W4410854979","doi":"10.1007/978-3-031-91760-8_16","title":"Experience 2.0: Mixed Realities and Beyond","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Human–computer interaction; Data science","score_opus":0.014249541712676759,"score_gpt":0.24929313067702547,"score_spread":0.2350435889643487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410854979","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097215086,0.01084494,0.074894615,0.013171784,0.00086795096,0.00014327784,0.0010942065,0.002593673,0.7991744],"genre_scores_gemma":[0.7296691,0.0066792946,0.043053724,0.0029980529,0.00041396514,0.0005694736,0.0016585576,0.0021511682,0.21280664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987858,0.0006532838,0.000039719587,0.00012945772,0.00023804927,0.00015375715],"domain_scores_gemma":[0.9986066,0.000601774,0.000057871348,0.00020835703,0.0001087873,0.00041660338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019386801,0.00040375587,0.0003037152,0.0007436143,0.0011278297,0.009933009,0.0010480444,0.0012210592,0.02519108],"category_scores_gemma":[0.0028716952,0.00033331785,0.00027543269,0.00080620503,0.0019881744,0.01102375,0.007392275,0.0015788835,0.004514228],"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.00032383134,0.00015836074,0.0025340426,0.00053098967,0.00001868744,0.0004450529,0.070613675,0.00049032964,0.0027709978,0.54473025,0.1044526,0.27293116],"study_design_scores_gemma":[0.00001745304,0.00010485794,0.0016721094,0.00038703394,0.000010370062,0.00078079023,0.026367018,0.0012973987,0.0007837931,0.11159287,0.8569349,0.00005145373],"about_ca_topic_score_codex":0.0007854455,"about_ca_topic_score_gemma":0.0015953379,"teacher_disagreement_score":0.02519108,"about_ca_system_score_codex":0.0007027485,"about_ca_system_score_gemma":0.00095204613,"threshold_uncertainty_score":0.084272504},"labels":[],"label_agreement":null},{"id":"W4410877227","doi":"10.1007/978-3-031-94575-5_7","title":"Predicting the Road Ahead: A Knowledge Graph Based Foundation Model for Scene Understanding in Autonomous Driving","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Foundation (evidence); Graph; Artificial intelligence; Theoretical computer science","score_opus":0.048865887956767474,"score_gpt":0.2792497001078019,"score_spread":0.23038381215103446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410877227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090017825,0.00051587704,0.90185547,0.00036426034,0.000044891247,0.00007440764,0.0021137143,0.0020575589,0.0029559827],"genre_scores_gemma":[0.85690457,0.0005279613,0.13634373,0.000093148,0.000039055707,0.00011750668,0.0032105413,0.0001666414,0.0025968573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983907,0.000022254595,0.000010329351,0.000064331725,0.00003745836,0.000026465517],"domain_scores_gemma":[0.99948287,0.00030627134,0.000046289162,0.00004458476,0.000086709864,0.000033125696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741079,0.0005622566,0.0007561377,0.0013378137,0.00046029186,0.0008734106,0.0016331241,0.0009922845,0.0026422685],"category_scores_gemma":[0.001351653,0.0005308019,0.0009777448,0.0012356591,0.0003836734,0.0019255751,0.0008469191,0.0010548211,0.00062129454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001463034,0.00013738389,0.0019657998,0.00008441695,0.000080491474,0.00009345067,0.00011001618,0.8737568,0.0020647212,0.010477833,0.0031885207,0.10789422],"study_design_scores_gemma":[0.0000026580958,0.0000075176476,0.00019064086,0.000003997915,0.000009166447,0.0000050153126,0.0000067726255,0.99419725,0.00015426146,0.0052352296,0.00018482038,0.0000028028269],"about_ca_topic_score_codex":0.04281283,"about_ca_topic_score_gemma":0.047857404,"teacher_disagreement_score":0.04281283,"about_ca_system_score_codex":0.000874349,"about_ca_system_score_gemma":0.0010972369,"threshold_uncertainty_score":0.085127234},"labels":[],"label_agreement":null},{"id":"W4410888293","doi":"10.1007/978-3-031-92977-9_7","title":"Improving Our Awareness of Data Generation, Use, and Ownership: People and Data Interactions in AI-Rich Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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","funders":"","keywords":"Computer science; Data science; Human–computer interaction; Artificial intelligence","score_opus":0.1278326964070693,"score_gpt":0.3851514258967472,"score_spread":0.25731872948967793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410888293","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.46662992,0.0044582,0.4037494,0.035207294,0.00028144734,0.00006960141,0.00024615167,0.0019231766,0.0874348],"genre_scores_gemma":[0.94287765,0.0011155831,0.04721088,0.00077164755,0.0000717473,0.000036054003,0.00015175626,0.0002534495,0.00751123],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976941,0.0013363351,0.00007349436,0.00028314465,0.00042841278,0.00018452041],"domain_scores_gemma":[0.97823024,0.018392257,0.0008096516,0.0011455318,0.0008090535,0.0006132005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037794202,0.0004015394,0.00023381771,0.00053913804,0.0013191213,0.0066300714,0.00096381357,0.0020249458,0.0034613241],"category_scores_gemma":[0.016712317,0.00051877374,0.00031004957,0.000724487,0.00326867,0.01596524,0.0046945475,0.0031518405,0.0005698655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033740114,0.0005042622,0.040084,0.00050063065,0.000086089436,0.0006854331,0.16051273,0.0067177927,0.018473934,0.14507008,0.028115379,0.5989123],"study_design_scores_gemma":[0.00004471959,0.00027604503,0.034054752,0.0004762244,0.00019420822,0.0014008771,0.10088667,0.08088821,0.025668867,0.48974505,0.26611495,0.00024936828],"about_ca_topic_score_codex":0.003433877,"about_ca_topic_score_gemma":0.003539971,"teacher_disagreement_score":0.0066300714,"about_ca_system_score_codex":0.000620695,"about_ca_system_score_gemma":0.0012173274,"threshold_uncertainty_score":0.019987762},"labels":[],"label_agreement":null},{"id":"W4410895334","doi":"10.1007/978-3-031-92967-0_12","title":"Metacognition in HCI: Designing Systems for Planning and Flexibility","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Computer science; Flexibility (engineering); Metacognition; Human–computer interaction; Artificial intelligence; Software engineering; Cognition; Psychology","score_opus":0.0936712286994969,"score_gpt":0.3967952351799609,"score_spread":0.303124006480464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410895334","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016039511,0.0009531417,0.94555813,0.00063238095,0.00007558665,0.00010217983,0.00005728632,0.0010443067,0.035537492],"genre_scores_gemma":[0.3441413,0.0013671201,0.6244915,0.00017510686,0.0000462593,0.0005865578,0.00024966223,0.00040124604,0.028541101],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995652,0.00015187207,0.000032960583,0.00011043061,0.00010115385,0.000038281138],"domain_scores_gemma":[0.9976133,0.00169093,0.0000934496,0.00037815684,0.00014203775,0.00008211715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010005817,0.0006992079,0.00029783178,0.00064376474,0.00045903737,0.0030627265,0.001517395,0.0008514411,0.0114311725],"category_scores_gemma":[0.0044400757,0.0006077949,0.00040271648,0.000705695,0.0020567842,0.0052998457,0.0018393786,0.0012780409,0.0014831059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010859222,0.00009620692,0.0021617243,0.00067245006,0.000055585693,0.00011933121,0.0051931823,0.034011494,0.007700497,0.40492114,0.007568642,0.5373912],"study_design_scores_gemma":[0.00007412888,0.00026542813,0.002526155,0.0006643176,0.000077036355,0.0003708785,0.0022853413,0.13914612,0.021620557,0.7017446,0.13114153,0.0000839553],"about_ca_topic_score_codex":0.001558418,"about_ca_topic_score_gemma":0.0018519722,"teacher_disagreement_score":0.0114311725,"about_ca_system_score_codex":0.0008210439,"about_ca_system_score_gemma":0.001416709,"threshold_uncertainty_score":0.038241148},"labels":[],"label_agreement":null},{"id":"W4410895339","doi":"10.1007/978-3-031-92967-0_5","title":"Integrating Adaptive Interventions into Learning Engineering Workflows","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workflow; Software engineering; Artificial intelligence; Database","score_opus":0.01856355975230746,"score_gpt":0.2540083225260504,"score_spread":0.23544476277374293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410895339","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.06512057,0.00032263345,0.8895356,0.0006287958,0.00015205341,0.0003439984,0.00010062065,0.014311332,0.02948432],"genre_scores_gemma":[0.6062713,0.0004443412,0.3791463,0.00021364816,0.00003967838,0.00028274267,0.00030809172,0.00044618262,0.012847738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989992,0.0003042627,0.00008215237,0.0002591416,0.00025829952,0.00009696204],"domain_scores_gemma":[0.9978644,0.0011049306,0.00016229266,0.000435151,0.00023445484,0.00019880889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397836,0.00055543176,0.00030992247,0.0006803789,0.00034371263,0.0017001373,0.0016111595,0.0007982008,0.006244667],"category_scores_gemma":[0.005230841,0.0003058171,0.00042256893,0.00041744608,0.0005058706,0.0017977761,0.0019979493,0.0011120389,0.0014328695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028789157,0.0012333326,0.0024857232,0.00034701757,0.000044351404,0.00022226815,0.002001438,0.025672924,0.017607728,0.021219658,0.0051661325,0.92371166],"study_design_scores_gemma":[0.0003284905,0.0012814177,0.011692319,0.00093111774,0.0002598004,0.000887394,0.0023046508,0.57978165,0.08111146,0.19015202,0.13106132,0.00020828599],"about_ca_topic_score_codex":0.0010778197,"about_ca_topic_score_gemma":0.0012386133,"teacher_disagreement_score":0.006244667,"about_ca_system_score_codex":0.0004905295,"about_ca_system_score_gemma":0.0012213716,"threshold_uncertainty_score":0.020890474},"labels":[],"label_agreement":null},{"id":"W4410895397","doi":"10.1007/978-3-031-92967-0_17","title":"Understanding the Complexity of Music Improvisation: Leveraging Cognitive Models to Inform Adaptive Instruction Design","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroscience and Music Perception","field":"Neuroscience","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":"National Research Council Canada","funders":"","keywords":"Improvisation; Computer science; Cognitive science; Cognition; Human–computer interaction; Visual arts; Art; Psychology","score_opus":0.31518540464519923,"score_gpt":0.3001098630591009,"score_spread":0.015075541586098307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410895397","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.09778189,0.0010112595,0.85316133,0.0031327987,0.00008815607,0.00010345919,0.00017373609,0.00080455234,0.043742884],"genre_scores_gemma":[0.7714051,0.0007980357,0.22300258,0.0001833124,0.000040189778,0.0001094031,0.0002231185,0.00015448335,0.0040838057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966943,0.00010801602,0.000015755008,0.0000885739,0.00008997551,0.000028327606],"domain_scores_gemma":[0.99618894,0.0029961457,0.0002810548,0.0002489585,0.00016923809,0.00011568396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064509816,0.00066796254,0.00035420092,0.0006287142,0.00044362407,0.004442844,0.0013515675,0.0010929127,0.0061391536],"category_scores_gemma":[0.0077377716,0.00047642982,0.00066514866,0.00039720233,0.0021501214,0.0067289276,0.0013089841,0.0023431324,0.000591471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002706377,0.000354519,0.0089259455,0.00074149115,0.00016459386,0.00023517571,0.0064917193,0.12844098,0.023738887,0.5027534,0.0047953525,0.32308733],"study_design_scores_gemma":[0.000016560736,0.00007428677,0.002865718,0.000118952674,0.000044080585,0.00010255731,0.0009791361,0.3857406,0.004382312,0.59861565,0.007017864,0.000042302992],"about_ca_topic_score_codex":0.0038037822,"about_ca_topic_score_gemma":0.0049405065,"teacher_disagreement_score":0.0061391536,"about_ca_system_score_codex":0.0012324272,"about_ca_system_score_gemma":0.0011528141,"threshold_uncertainty_score":0.020537555},"labels":[],"label_agreement":null},{"id":"W4410895488","doi":"10.1007/978-3-031-92967-0_16","title":"Public Safety Personnel Readiness Prediction: A Hybrid Model of Neurophysiological and Psychometric Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Occupational Health and Safety Research","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Public Safety Canada; Université Laval; Thales (Canada)","funders":"","keywords":"Computer science; Neurophysiology; Applied psychology; Artificial intelligence; Psychology; Psychiatry","score_opus":0.21342564495746047,"score_gpt":0.4150533843763521,"score_spread":0.20162773941889162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410895488","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.59175384,0.0010125055,0.39526144,0.002132204,0.00019602406,0.00019872095,0.0018468971,0.001658325,0.0059400434],"genre_scores_gemma":[0.969203,0.00027547026,0.025583504,0.00012452503,0.0000691087,0.00017199293,0.00073267805,0.000051819636,0.0037879336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960226,0.00014934663,0.000021759304,0.00012604547,0.000040743136,0.000059826198],"domain_scores_gemma":[0.9979705,0.0015690585,0.00010885515,0.0000721599,0.00019976993,0.00007963474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020923454,0.00079548993,0.0009544151,0.0010218049,0.0004168025,0.0021985206,0.001624892,0.0012750627,0.0033886142],"category_scores_gemma":[0.0049484367,0.0005237043,0.0011722121,0.0012046196,0.0004565898,0.0014268563,0.000860628,0.0012590584,0.0009906244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005923921,0.00095814676,0.052498456,0.00011781264,0.0006685517,0.00029426615,0.00032030113,0.78853995,0.0017016759,0.0057229465,0.0036912132,0.14489429],"study_design_scores_gemma":[0.000020034066,0.0000610914,0.0050190627,0.000015300533,0.00006837965,0.00004744617,0.000030047979,0.99088544,0.000101416765,0.0035917654,0.00014454452,0.000015485793],"about_ca_topic_score_codex":0.020703487,"about_ca_topic_score_gemma":0.016220348,"teacher_disagreement_score":0.020703487,"about_ca_system_score_codex":0.0008551201,"about_ca_system_score_gemma":0.0013066803,"threshold_uncertainty_score":0.041165948},"labels":[],"label_agreement":null},{"id":"W4410898050","doi":"10.1007/978-3-031-93835-1_11","title":"An Interactive Multi-modal Online Platform for Supporting Data-Informed Design Discourse on Developing Built Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"BIM and Construction Integration","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":"","keywords":"Computer science; Modal; Human–computer interaction; Multimedia","score_opus":0.05048053514571442,"score_gpt":0.32552666475675235,"score_spread":0.2750461296110379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410898050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350797,0.00023407298,0.7852887,0.0008600801,0.00018836369,0.00054358115,0.0061445646,0.07196308,0.101269655],"genre_scores_gemma":[0.21818255,0.00041426008,0.66358596,0.0005046502,0.00010823267,0.0021209822,0.0145815695,0.009720808,0.09078103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.0002636841,0.000039294155,0.00011188666,0.00021967579,0.00005641999],"domain_scores_gemma":[0.9968732,0.002279789,0.00006820455,0.0004109798,0.00014627716,0.00022159873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017348315,0.0010452465,0.00045502218,0.0013237182,0.0009312259,0.0038547723,0.0019332764,0.0014212676,0.06751102],"category_scores_gemma":[0.0035965506,0.00057831965,0.00048564374,0.0009821207,0.0007038051,0.0064265067,0.008853985,0.0010852163,0.012858098],"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.0014604395,0.0011284553,0.0018931549,0.0013897422,0.0000897564,0.0018874835,0.02954403,0.008826666,0.06583339,0.11241255,0.16894023,0.60659415],"study_design_scores_gemma":[0.00028679986,0.00022449647,0.0026459002,0.00048448762,0.000067961184,0.0007944175,0.004743537,0.074945904,0.022700854,0.10627913,0.7866198,0.00020668787],"about_ca_topic_score_codex":0.0010506616,"about_ca_topic_score_gemma":0.002907852,"teacher_disagreement_score":0.06751102,"about_ca_system_score_codex":0.00044415696,"about_ca_system_score_gemma":0.0006771865,"threshold_uncertainty_score":0.22584689},"labels":[],"label_agreement":null},{"id":"W4410898080","doi":"10.1007/978-3-031-93835-1_14","title":"D-GAM: A Gamification-Based Platform for Enhancing Public Participation in Built Environment Design","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia","score_opus":0.06550529565957296,"score_gpt":0.33315271083658315,"score_spread":0.2676474151770102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410898080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14102913,0.002680597,0.56466794,0.0021780788,0.00057383557,0.001006564,0.001093708,0.016397905,0.27037227],"genre_scores_gemma":[0.39122358,0.0025977646,0.44904682,0.0008560956,0.00006542064,0.0012802434,0.0020723136,0.0012514921,0.15160626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997906,0.00007214652,0.00000808781,0.000028690623,0.00006787493,0.00003260547],"domain_scores_gemma":[0.99977213,0.00012191609,0.000009084238,0.00002228802,0.000019876912,0.000054758013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043777176,0.0009547226,0.00030691858,0.0007087877,0.00036176122,0.001302372,0.0009664632,0.0010117958,0.015593459],"category_scores_gemma":[0.00097391946,0.0002146019,0.00042958956,0.00043854778,0.0003109216,0.0015273308,0.0029340854,0.0008811682,0.0029763523],"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.00056285126,0.001520959,0.002235728,0.0011033858,0.00005831438,0.00054568844,0.0032398163,0.010083772,0.02033603,0.05315678,0.07212352,0.8350332],"study_design_scores_gemma":[0.00044797757,0.0015369881,0.009322753,0.0011211724,0.00016396993,0.0017594214,0.002891219,0.099102125,0.030375773,0.120326445,0.73275906,0.0001929922],"about_ca_topic_score_codex":0.0006383431,"about_ca_topic_score_gemma":0.0015971807,"teacher_disagreement_score":0.015593459,"about_ca_system_score_codex":0.00029849866,"about_ca_system_score_gemma":0.00049001916,"threshold_uncertainty_score":0.05216533},"labels":[],"label_agreement":null},{"id":"W4410898105","doi":"10.1007/978-3-031-93835-1_7","title":"Evaluating the Utility of Multiple Workspaces and Easy Chart Creation for Visual Analytics","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Workspace; Visual analytics; Chart; Analytics; Human–computer interaction; Data science; Software engineering; Computer graphics (images); Visualization; Artificial intelligence","score_opus":0.059221896171688715,"score_gpt":0.37305253101562336,"score_spread":0.31383063484393464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410898105","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.81998724,0.003593214,0.14929192,0.00055703253,0.00037979963,0.0009932651,0.0019821993,0.0063961046,0.016819276],"genre_scores_gemma":[0.8303967,0.0006778937,0.1627655,0.00006204264,0.00007362605,0.00033446093,0.0016395348,0.0006299579,0.0034202416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99347335,0.0030638843,0.00048816032,0.0007281386,0.0019639009,0.00028252712],"domain_scores_gemma":[0.84482104,0.13304406,0.004010804,0.007235577,0.008180753,0.002707808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071363975,0.0012796487,0.0005365019,0.0030817136,0.0005669411,0.0036572097,0.0017821931,0.0012758425,0.007572502],"category_scores_gemma":[0.07862334,0.0004730882,0.00077478756,0.0022820008,0.0007405434,0.005084502,0.0026436811,0.0009392407,0.0013510815],"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.01969676,0.0036589736,0.028675465,0.0020574783,0.0005118421,0.00031205366,0.0018379219,0.04954436,0.017067214,0.005481569,0.010233446,0.8609229],"study_design_scores_gemma":[0.0030799583,0.018183721,0.074320845,0.0011063993,0.0018570867,0.00083965337,0.0057639396,0.7855501,0.07143548,0.019109147,0.018278837,0.00047475626],"about_ca_topic_score_codex":0.0035223523,"about_ca_topic_score_gemma":0.0037821915,"teacher_disagreement_score":0.007572502,"about_ca_system_score_codex":0.0007691628,"about_ca_system_score_gemma":0.000944467,"threshold_uncertainty_score":0.037741363},"labels":[],"label_agreement":null},{"id":"W4410905714","doi":"10.1007/978-3-031-93700-2_17","title":"How Visually Induced Motion Sickness is Affected by Stimulus Characteristics and Individual Factors in Younger and Older Adults","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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; Toronto Rehabilitation Institute","funders":"","keywords":"Motion sickness; Stimulus (psychology); Computer science; Physical medicine and rehabilitation; Artificial intelligence; Psychology; Cognitive psychology; Medicine; Psychiatry","score_opus":0.01621114576869099,"score_gpt":0.2512173543684879,"score_spread":0.23500620859979693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410905714","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.99887913,0.00042092692,0.00005280349,0.000014839535,0.000003566716,0.0000032786947,0.00009158311,0.0000015785843,0.00053231313],"genre_scores_gemma":[0.99920493,0.00017851405,0.000040307354,0.000012304589,0.000004721811,0.0000037915277,0.0000986452,0.0000014825989,0.0004552045],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9999194,0.000017163862,0.0000074272507,0.000019080117,0.000019310328,0.000017626711],"domain_scores_gemma":[0.9994653,0.0002187342,0.0001578532,0.000015510304,0.00005436128,0.00008833819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016822056,0.00013039562,0.00022266695,0.00022218424,0.000108157496,0.00036689898,0.00008676392,0.0002505914,0.0018778256],"category_scores_gemma":[0.0017281529,0.00009777608,0.00023250475,0.00017930745,0.00012936053,0.00025874987,0.0002222453,0.00019997075,0.00024038168],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003562375,0.0004152753,0.9158793,0.00017874094,0.00022388069,0.00041464687,0.0025124352,0.0003362037,0.03695462,0.00013941403,0.00051068584,0.038872417],"study_design_scores_gemma":[0.0000037316222,0.00024037372,0.999271,0.000003433315,0.000015586358,0.0000961743,0.00012623947,0.00005900659,0.00010609889,0.000026716978,0.000049549973,0.000002039179],"about_ca_topic_score_codex":0.0038924797,"about_ca_topic_score_gemma":0.0071907365,"teacher_disagreement_score":0.0038924797,"about_ca_system_score_codex":0.00015375257,"about_ca_system_score_gemma":0.00012647011,"threshold_uncertainty_score":0.007739663},"labels":[],"label_agreement":null},{"id":"W4410906071","doi":"10.1007/978-3-031-93505-3_17","title":"Conversational Agent-Based Mental Health Support for Students: Identifying Psychosocial Resources and Stressors with WUM","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Psychosocial; Stressor; Mental health; Human–computer interaction; Psychology; Psychiatry","score_opus":0.036874736952451685,"score_gpt":0.39447782945201937,"score_spread":0.3576030924995677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410906071","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.94090456,0.0022054268,0.0089560365,0.005084471,0.00051532016,0.00047370224,0.00022541222,0.0005653686,0.041069735],"genre_scores_gemma":[0.9478051,0.002022926,0.026165359,0.0011909896,0.00010294478,0.0006768026,0.00037808804,0.000062433624,0.021595323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996012,0.0002198729,0.000013922009,0.00003262302,0.000060562525,0.00007190352],"domain_scores_gemma":[0.9990715,0.0004407947,0.00006876667,0.00003574471,0.0000465051,0.00033683015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010466833,0.00029247388,0.00029458277,0.00027556927,0.0010245426,0.0018988026,0.00073938834,0.0007124063,0.006092149],"category_scores_gemma":[0.0032404002,0.0001542848,0.00029091205,0.00021843004,0.00025026908,0.0008876032,0.0017083253,0.0012312146,0.0014511634],"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.00063984486,0.01002115,0.051973354,0.00056985667,0.00009372268,0.0007921635,0.0520934,0.00036242764,0.0043142643,0.0025560304,0.030362906,0.8462208],"study_design_scores_gemma":[0.000800047,0.013202394,0.3854172,0.0023408232,0.00075871707,0.0039602765,0.25383502,0.017379303,0.011881789,0.017771354,0.29235968,0.0002934103],"about_ca_topic_score_codex":0.0009420863,"about_ca_topic_score_gemma":0.003995725,"teacher_disagreement_score":0.006092149,"about_ca_system_score_codex":0.00042637877,"about_ca_system_score_gemma":0.0013917026,"threshold_uncertainty_score":0.020380318},"labels":[],"label_agreement":null},{"id":"W4410914800","doi":"10.1007/978-3-031-93806-1_3","title":"GSTAM: Efficient Graph Distillation with Structural Attention-Matching","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distillation; Matching (statistics); Graph; Theoretical computer science; Mathematics; Chemistry; Statistics","score_opus":0.008323788612343046,"score_gpt":0.24171541496363189,"score_spread":0.23339162635128885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410914800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025323525,0.0010770193,0.91498905,0.0008866038,0.0006129631,0.00043503603,0.003302958,0.0386798,0.014693008],"genre_scores_gemma":[0.16462478,0.00045086967,0.7988718,0.0006301564,0.00022084916,0.00038053235,0.009404331,0.0031141208,0.022302529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908686,0.00013550374,0.00004954656,0.00032371457,0.00028978704,0.00011464399],"domain_scores_gemma":[0.99893767,0.0003426486,0.000053654283,0.00047872603,0.00012870453,0.000058543665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890292,0.0016595349,0.0017093722,0.001991666,0.00094264024,0.001661806,0.003957151,0.0015610869,0.023608794],"category_scores_gemma":[0.0029119859,0.0007879659,0.0017914975,0.0037088646,0.0008420315,0.0042703487,0.0038101785,0.0024351592,0.0079683475],"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.0004930233,0.00043651252,0.00044587773,0.0005432481,0.00012456311,0.00014734567,0.00012085927,0.040871296,0.013075346,0.04376508,0.07824455,0.8217323],"study_design_scores_gemma":[0.00022904383,0.00021839261,0.0003556134,0.00005874724,0.00010266416,0.00017621911,0.00010643158,0.78426725,0.017609388,0.1676604,0.029172568,0.000043243075],"about_ca_topic_score_codex":0.0056373305,"about_ca_topic_score_gemma":0.013475227,"teacher_disagreement_score":0.023608794,"about_ca_system_score_codex":0.0011094444,"about_ca_system_score_gemma":0.00212787,"threshold_uncertainty_score":0.07897931},"labels":[],"label_agreement":null},{"id":"W4410915038","doi":"10.1007/978-3-031-91979-4_22","title":"MCUBench: A Benchmark of Tiny Object Detectors on MCUs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","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":"Deep River Science Academy","funders":"","keywords":"Computer science; Benchmark (surveying); Detector; Object (grammar); Artificial intelligence; Computer vision; Computer graphics (images); Telecommunications; Cartography","score_opus":0.013762166117400245,"score_gpt":0.2538293027686813,"score_spread":0.24006713665128107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410915038","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.39085332,0.018288853,0.15197858,0.0030769962,0.0035551535,0.001440686,0.042142607,0.25906527,0.12959845],"genre_scores_gemma":[0.6238714,0.0023531523,0.26861385,0.0015773877,0.00031551032,0.0007511654,0.060236577,0.009149262,0.033131834],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982699,0.00021110689,0.000099489385,0.00038509854,0.00082177395,0.00021266848],"domain_scores_gemma":[0.9979144,0.00062853086,0.00011095239,0.00048292233,0.0006746693,0.00018859873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013089404,0.0021018754,0.0011402989,0.0020700002,0.0009837868,0.0014257494,0.004431526,0.0020889372,0.013181642],"category_scores_gemma":[0.006299912,0.00076752016,0.0007944949,0.002420147,0.00091124646,0.0025715309,0.0017805981,0.0012321057,0.0054754275],"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.0027339372,0.0005053717,0.005821041,0.0023703775,0.00069618825,0.0005859553,0.0002302016,0.104371026,0.025258198,0.017098056,0.48460782,0.35572177],"study_design_scores_gemma":[0.00055794977,0.0008202789,0.0059273234,0.00021354068,0.00021651202,0.000568183,0.00022329306,0.7548676,0.098419115,0.015977312,0.12201971,0.00018924159],"about_ca_topic_score_codex":0.020108536,"about_ca_topic_score_gemma":0.027502043,"teacher_disagreement_score":0.020108536,"about_ca_system_score_codex":0.0018320584,"about_ca_system_score_gemma":0.0020965012,"threshold_uncertainty_score":0.044097006},"labels":[],"label_agreement":null},{"id":"W4410915170","doi":"10.1007/978-3-031-93806-1_14","title":"FastTalker: Jointly Generating Speech and Conversational Gestures from Text","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Gesture; Speech recognition; Natural language processing; Artificial intelligence; Speech synthesis; Human–computer interaction","score_opus":0.013212706258999223,"score_gpt":0.22623203590357116,"score_spread":0.21301932964457193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410915170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014322221,0.0004789597,0.9066028,0.00010419827,0.00038411721,0.0003226573,0.0022566803,0.06864022,0.006888163],"genre_scores_gemma":[0.11947943,0.00045720537,0.83323354,0.00021023375,0.00017678674,0.00081164605,0.007460363,0.009809185,0.02836169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995745,0.00008333703,0.000019208946,0.00013895355,0.00014305902,0.00004095283],"domain_scores_gemma":[0.99944144,0.00035815776,0.000017791013,0.000058291327,0.00008091816,0.000043421594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007102438,0.0020399448,0.0015554166,0.0007456679,0.0005381392,0.0014817804,0.00230275,0.0015236246,0.0302456],"category_scores_gemma":[0.0016560544,0.0009927966,0.0010158583,0.00056228874,0.00048721582,0.0017066736,0.002170843,0.0009198902,0.010909488],"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.0010981896,0.00013685958,0.00049972604,0.0005964365,0.00014688492,0.00053062633,0.0004777081,0.015103377,0.13962413,0.0046934085,0.041975018,0.7951176],"study_design_scores_gemma":[0.0005267191,0.00058366515,0.0025802196,0.00013839736,0.0002194582,0.0012802562,0.00045861496,0.7082311,0.19030358,0.023586355,0.07188268,0.00020886736],"about_ca_topic_score_codex":0.0026564416,"about_ca_topic_score_gemma":0.0036513903,"teacher_disagreement_score":0.0302456,"about_ca_system_score_codex":0.0003713918,"about_ca_system_score_gemma":0.00048308267,"threshold_uncertainty_score":0.10118163},"labels":[],"label_agreement":null},{"id":"W4410915182","doi":"10.1007/978-3-031-91979-4_15","title":"LightAvatar: Efficient Head Avatar as Dynamic Neural Light Field","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Simon Fraser University","funders":"","keywords":"Avatar; Computer science; Computer vision; Computer graphics (images); Head (geology); Artificial intelligence; Field (mathematics); Human–computer interaction; Mathematics; Geology","score_opus":0.008157354830395048,"score_gpt":0.2739639688071734,"score_spread":0.26580661397677835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410915182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01821847,0.00066593784,0.92987686,0.00022969981,0.00035033972,0.00012392427,0.00042840786,0.010663805,0.039442535],"genre_scores_gemma":[0.37155703,0.0011357301,0.5192945,0.0004414381,0.000115901574,0.000284375,0.0011153647,0.0019650941,0.10409063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993026,0.000008619093,0.0000020085788,0.000015093059,0.000031098367,0.00001290521],"domain_scores_gemma":[0.9999304,0.000015258249,0.0000031200575,0.000012726332,0.000023905448,0.000014528522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012082175,0.00055390835,0.00034902873,0.0002995001,0.00022589765,0.00051411375,0.0009363935,0.00042994824,0.024987811],"category_scores_gemma":[0.00025989462,0.00024424656,0.00032396824,0.00020750803,0.00020853027,0.00073933444,0.0008636733,0.00062630844,0.004582528],"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.0007274612,0.00019019892,0.00026505633,0.00027888006,0.000049847466,0.0002593228,0.00013982867,0.017614862,0.22362404,0.026278561,0.050967265,0.67960477],"study_design_scores_gemma":[0.00013299058,0.00039884867,0.00069296325,0.00010124745,0.00006316013,0.0012702983,0.00010059529,0.5858078,0.21696074,0.02884585,0.16552751,0.00009814325],"about_ca_topic_score_codex":0.0009001203,"about_ca_topic_score_gemma":0.0014190179,"teacher_disagreement_score":0.024987811,"about_ca_system_score_codex":0.00028803057,"about_ca_system_score_gemma":0.00023706093,"threshold_uncertainty_score":0.08359259},"labels":[],"label_agreement":null},{"id":"W4410924518","doi":"10.1007/978-3-031-93567-1_8","title":"Artificial Human Lecturers: Initial Findings from Asia’s First AI Lecturers in Class to Promote Innovation in Education","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Computer science; Mathematics education; Artificial intelligence; Multimedia; Psychology","score_opus":0.021957230227447652,"score_gpt":0.3092739124697496,"score_spread":0.28731668224230195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410924518","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.9588791,0.00054167176,0.00020759838,0.0027883898,0.00013996623,0.000054626154,0.00011409209,0.000022148895,0.037252534],"genre_scores_gemma":[0.97260946,0.0004759663,0.00024603435,0.001307138,0.00007548828,0.000070656264,0.00014658103,0.000031102412,0.0250375],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956613,0.0015599465,0.00013205849,0.0004136014,0.0012519434,0.0009810698],"domain_scores_gemma":[0.9759134,0.008127172,0.0024281354,0.00097597844,0.004245856,0.008309454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077576474,0.0002575407,0.0003234507,0.0014364539,0.004457791,0.0055068475,0.0011811042,0.0015236621,0.010462637],"category_scores_gemma":[0.012560506,0.00034182757,0.00033019017,0.0013194097,0.0020174533,0.002281661,0.0036766797,0.0035037117,0.002183485],"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.0010164572,0.0055893,0.3098737,0.00042194373,0.00009062315,0.0015115833,0.49333215,0.00012306248,0.002867696,0.0056575527,0.034219403,0.14529651],"study_design_scores_gemma":[0.00006253422,0.0009208822,0.55662507,0.00024497783,0.000052925177,0.0003099531,0.37871912,0.00018301365,0.0018839127,0.0006923627,0.060247798,0.0000574864],"about_ca_topic_score_codex":0.015504274,"about_ca_topic_score_gemma":0.03515985,"teacher_disagreement_score":0.015504274,"about_ca_system_score_codex":0.0036769293,"about_ca_system_score_gemma":0.0039577656,"threshold_uncertainty_score":0.04102683},"labels":[],"label_agreement":null},{"id":"W4410924569","doi":"10.1007/978-3-031-93567-1_22","title":"Semi-Automatic Labeling of Online Course Discussion Posts","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","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":"Athabasca University","funders":"","keywords":"Computer science; Course (navigation); Online course; World Wide Web; Multimedia; Information retrieval; Human–computer interaction; Artificial intelligence; Mathematics education; Engineering","score_opus":0.012922806136232744,"score_gpt":0.32185825300108856,"score_spread":0.3089354468648558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410924569","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.23657599,0.0022428855,0.64275116,0.0013103227,0.0018482221,0.001164382,0.04341324,0.040301055,0.030392814],"genre_scores_gemma":[0.36196426,0.0005217268,0.5241524,0.00026315456,0.000572901,0.0009368496,0.07514448,0.0014804641,0.034963727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978567,0.0005134828,0.00013413573,0.00084839156,0.00045086493,0.00019646046],"domain_scores_gemma":[0.9920299,0.0039813123,0.0005419957,0.0008295725,0.0022318468,0.00038530704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012909004,0.0008140528,0.00063717936,0.004372158,0.0012601502,0.0019200186,0.0013015753,0.001099385,0.0058663725],"category_scores_gemma":[0.0045816647,0.00041844428,0.00068593014,0.0023345095,0.00037047613,0.0012980934,0.00162159,0.0012581294,0.009649748],"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.0009818544,0.00051282643,0.0115860915,0.0010024168,0.000114208124,0.00028894885,0.00083368167,0.0033822856,0.07149795,0.004318567,0.08422682,0.8212543],"study_design_scores_gemma":[0.00019251868,0.0004335952,0.052361123,0.00046171073,0.00028837344,0.0010149294,0.0021778836,0.57964414,0.15450664,0.021329746,0.18741338,0.00017601995],"about_ca_topic_score_codex":0.0039083357,"about_ca_topic_score_gemma":0.015996082,"teacher_disagreement_score":0.0058663725,"about_ca_system_score_codex":0.0006137924,"about_ca_system_score_gemma":0.002305191,"threshold_uncertainty_score":0.019625008},"labels":[],"label_agreement":null},{"id":"W4410924570","doi":"10.1007/978-3-031-93567-1_19","title":"Hybrid Deep Learning-Based Framework for Students’ Cognitive Analysis in Online Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Bow Valley College; Athabasca University","funders":"","keywords":"Computer science; Online learning; Artificial intelligence; Cognition; Deep learning; Machine learning; Multimedia; Psychology","score_opus":0.013057469430254749,"score_gpt":0.31308398768183293,"score_spread":0.30002651825157817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410924570","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.029630378,0.00046370417,0.9645197,0.00032232038,0.00004856953,0.000060877566,0.0004091695,0.0014084793,0.0031368001],"genre_scores_gemma":[0.6281567,0.00041911966,0.3626571,0.00014560993,0.000053505373,0.00024858225,0.0009414916,0.00012908163,0.0072487933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996704,0.00010678519,0.000017497061,0.0000858116,0.000062490086,0.0000570078],"domain_scores_gemma":[0.99945456,0.000258879,0.000024992889,0.00004509889,0.00015784081,0.000058589492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007668414,0.00057505356,0.0004684953,0.0010280972,0.00035123865,0.0012991299,0.0011536228,0.00081303687,0.0039167856],"category_scores_gemma":[0.0013597556,0.00020489511,0.00082939357,0.0007840978,0.00028851512,0.0018518866,0.0013596604,0.001245237,0.00079946785],"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.0003371372,0.0007371637,0.005936247,0.0001843479,0.00018276107,0.00017825434,0.00050030154,0.1954131,0.008663947,0.03487899,0.0073723863,0.7456154],"study_design_scores_gemma":[0.000003632411,0.000023758214,0.0007505937,0.000012592588,0.000013503254,0.000015295034,0.0000471202,0.9860844,0.0010257522,0.01107955,0.00093582185,0.000007984102],"about_ca_topic_score_codex":0.01442789,"about_ca_topic_score_gemma":0.01931593,"teacher_disagreement_score":0.01442789,"about_ca_system_score_codex":0.001099638,"about_ca_system_score_gemma":0.0014207264,"threshold_uncertainty_score":0.028687835},"labels":[],"label_agreement":null},{"id":"W4410924614","doi":"10.1007/978-3-031-93838-2_11","title":"Optical Character Recognition for Early Handwriting Legibility Assessment","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Writing and Handwriting Education","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":"Dalhousie University","funders":"","keywords":"Legibility; Handwriting; Computer science; Intelligent character recognition; Character (mathematics); Optical character recognition; Character recognition; Artificial intelligence; Speech recognition; Handwriting recognition; Sketch recognition; Document processing; Computer vision; Natural language processing; Pattern recognition (psychology); Feature extraction; Image (mathematics); Visual arts; Gesture recognition; Art","score_opus":0.04056801210491031,"score_gpt":0.34814249969866107,"score_spread":0.3075744875937508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410924614","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.20171784,0.0050820955,0.75323784,0.00024727007,0.00046640335,0.0005218662,0.0011625752,0.008390866,0.0291733],"genre_scores_gemma":[0.6044006,0.0024790969,0.33944878,0.00022524837,0.00013637441,0.00031652953,0.0010888359,0.00046501053,0.051439565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952495,0.00007206217,0.000029514691,0.00011880296,0.00020953924,0.000045082194],"domain_scores_gemma":[0.9983834,0.0005499745,0.0001252,0.0001335862,0.00073384953,0.00007395604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047952545,0.00075824105,0.00049609365,0.0011771242,0.0002663308,0.0009959025,0.0006715814,0.00086419977,0.009316502],"category_scores_gemma":[0.0016350369,0.0003293018,0.0002783986,0.00064841524,0.00019802629,0.0008147893,0.00051430444,0.00046367125,0.0043169586],"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.000354897,0.000121667734,0.002550314,0.0001999489,0.00001864046,0.00009751202,0.00006573517,0.0011145306,0.19076999,0.00027923955,0.002797947,0.8016296],"study_design_scores_gemma":[0.000067627,0.0016137405,0.056971926,0.00031514582,0.00023845148,0.0021362212,0.0003579468,0.23034069,0.67958874,0.0013675075,0.026846293,0.00015582948],"about_ca_topic_score_codex":0.0015858638,"about_ca_topic_score_gemma":0.0028637294,"teacher_disagreement_score":0.009316502,"about_ca_system_score_codex":0.00023327327,"about_ca_system_score_gemma":0.00034499608,"threshold_uncertainty_score":0.031166792},"labels":[],"label_agreement":null},{"id":"W4410924720","doi":"10.1007/978-3-031-93845-0_29","title":"A Survey of Passive Sensing for Workplace Wellbeing and Productivity","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Productivity; Human–computer interaction; Economic growth","score_opus":0.12152241263014556,"score_gpt":0.37190712488153477,"score_spread":0.2503847122513892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410924720","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14794916,0.71253324,0.07464928,0.0034671724,0.0009328422,0.00029390326,0.004751757,0.00064448937,0.054778267],"genre_scores_gemma":[0.42786208,0.506218,0.035423897,0.0017636133,0.0012418247,0.00030765502,0.006252203,0.00019958035,0.020731155],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99851125,0.00041972648,0.00014027167,0.00030458748,0.00055055297,0.000073732466],"domain_scores_gemma":[0.9881435,0.009115722,0.0005822964,0.00036080342,0.0016250988,0.00017257225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002767205,0.000739041,0.0006485701,0.0035818168,0.00028452175,0.0018433804,0.0008922869,0.00082062895,0.0037569606],"category_scores_gemma":[0.0067746933,0.00040494176,0.00063462515,0.0055281557,0.00046377606,0.0027645244,0.00072602276,0.0005587515,0.001269579],"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.0002897786,0.00020611519,0.024803942,0.0034209061,0.000098108416,0.00005622047,0.0002800585,0.0006072662,0.0053286655,0.0020241984,0.007789908,0.9550948],"study_design_scores_gemma":[0.00005217938,0.0035285703,0.46560702,0.008221674,0.00086289074,0.0041084364,0.0030059235,0.010590361,0.023548111,0.010067716,0.4701619,0.0002451365],"about_ca_topic_score_codex":0.0016086333,"about_ca_topic_score_gemma":0.0027170249,"teacher_disagreement_score":0.0037569606,"about_ca_system_score_codex":0.00046645483,"about_ca_system_score_gemma":0.00048818512,"threshold_uncertainty_score":0.01463455},"labels":[],"label_agreement":null},{"id":"W4410941362","doi":"10.1007/978-3-031-92578-8_8","title":"User-Centered Trustworthy AI Metrics in the Metaverse","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trustworthiness; Computer science; Metaverse; Human–computer interaction; World Wide Web; Artificial intelligence; Data science; Computer security; Virtual reality","score_opus":0.029542235487232324,"score_gpt":0.27834485297094075,"score_spread":0.2488026174837084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410941362","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.021310188,0.0018946973,0.95309407,0.0014555354,0.00015852277,0.00015225227,0.00033996688,0.0022838493,0.019310942],"genre_scores_gemma":[0.4351414,0.0006666262,0.5566221,0.00023230513,0.0001920201,0.00024029071,0.00065760774,0.0011164516,0.0051311394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9752794,0.012179753,0.0017655992,0.0018072347,0.008393212,0.00057490874],"domain_scores_gemma":[0.9531021,0.020727767,0.0034653987,0.012537199,0.008503817,0.0016637436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020366156,0.0010274143,0.0016623283,0.004999504,0.0013840694,0.011434493,0.0025571196,0.0021849775,0.005323742],"category_scores_gemma":[0.07687897,0.0008084895,0.0009457114,0.004593355,0.0026463445,0.016950091,0.0070746937,0.0031804328,0.0016786077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002894401,0.0001186293,0.0038328553,0.0002683112,0.00013022557,0.000096357326,0.0010189099,0.029347543,0.002093609,0.75022995,0.00682327,0.20575094],"study_design_scores_gemma":[0.000021493415,0.00014524357,0.0010727554,0.00020955702,0.000062625055,0.00014668192,0.00033519964,0.29414624,0.004157976,0.68190026,0.017738137,0.00006384208],"about_ca_topic_score_codex":0.0017766993,"about_ca_topic_score_gemma":0.0025495817,"teacher_disagreement_score":0.020366156,"about_ca_system_score_codex":0.0024218296,"about_ca_system_score_gemma":0.002948214,"threshold_uncertainty_score":0.10770786},"labels":[],"label_agreement":null},{"id":"W4410941391","doi":"10.1007/978-3-031-92578-8_9","title":"A Psychophysiological Study of the Relation Between Emotions and Learning with a Serious Game","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroscience, Education and Cognitive Function","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Relation (database); Human–computer interaction; Artificial intelligence; Cognitive science; Psychology; Data mining","score_opus":0.0277703543986949,"score_gpt":0.27547256556319766,"score_spread":0.24770221116450275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410941391","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.9890994,0.0002491832,0.0035033736,0.00012337191,0.000035061177,0.00006286461,0.00006215972,0.000023926113,0.006840746],"genre_scores_gemma":[0.9941093,0.0001495737,0.0019799776,0.00007442928,0.000009997065,0.000041963525,0.000033706165,0.000010520938,0.0035906008],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9999074,0.000029750805,0.000003781211,0.000020677904,0.000025864592,0.000012523137],"domain_scores_gemma":[0.9992761,0.0005879532,0.00003077398,0.000023988341,0.000020619631,0.000060586146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019098609,0.0002659157,0.00021611461,0.0001575893,0.00029256113,0.00053032854,0.0005135339,0.00040161368,0.0032963317],"category_scores_gemma":[0.0015129895,0.00017239492,0.00022945506,0.00014679001,0.00049965864,0.00036316743,0.0004398899,0.00080340117,0.00015147492],"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.008619122,0.0057326,0.013447179,0.00045544282,0.00017700973,0.0015580103,0.0042507704,0.002618207,0.8719546,0.0150947,0.0020689,0.07402349],"study_design_scores_gemma":[0.0016823233,0.03413608,0.62322515,0.00011928144,0.0002802359,0.005724606,0.0067047942,0.07525154,0.19789219,0.037898395,0.016920751,0.00016465061],"about_ca_topic_score_codex":0.0014839288,"about_ca_topic_score_gemma":0.0012878862,"teacher_disagreement_score":0.0032963317,"about_ca_system_score_codex":0.0002049807,"about_ca_system_score_gemma":0.00019828134,"threshold_uncertainty_score":0.011027396},"labels":[],"label_agreement":null},{"id":"W4410941430","doi":"10.1007/978-3-031-92578-8_17","title":"Deepfake in the Metaverse: An Outlook Survey","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Metaverse; Data science; Human–computer interaction; Virtual reality","score_opus":0.03979563220594806,"score_gpt":0.2955592332413696,"score_spread":0.25576360103542156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410941430","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026067257,0.48033825,0.10056324,0.011517811,0.0049241516,0.000113952265,0.0016332088,0.004463608,0.37037855],"genre_scores_gemma":[0.17134589,0.42992994,0.1205341,0.0044761775,0.0031269877,0.00017145855,0.0071843592,0.005260713,0.25797042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992761,0.00008637247,0.000028171038,0.00010911009,0.00034306126,0.00015721402],"domain_scores_gemma":[0.99848455,0.0005219255,0.00005996585,0.00029486627,0.00039140048,0.0002473699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026159897,0.00058427197,0.0006260378,0.0027032052,0.0014256191,0.0065435506,0.002295875,0.0017107527,0.036877114],"category_scores_gemma":[0.0042506983,0.0005462145,0.000653557,0.0040904116,0.0012763262,0.019237416,0.005540898,0.0020548708,0.007520042],"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.00013645893,0.000090076675,0.0008077098,0.0012723823,0.000023272834,0.00005524102,0.00038878183,0.0012225929,0.0013832881,0.13461061,0.06486415,0.79514545],"study_design_scores_gemma":[0.000010750853,0.000097257995,0.00040860818,0.0011092435,0.000023384408,0.0003062033,0.00039476476,0.0020344132,0.002452055,0.042433936,0.9507002,0.000029273808],"about_ca_topic_score_codex":0.002557774,"about_ca_topic_score_gemma":0.0053962865,"teacher_disagreement_score":0.036877114,"about_ca_system_score_codex":0.001499203,"about_ca_system_score_gemma":0.0026556612,"threshold_uncertainty_score":0.1233663},"labels":[],"label_agreement":null},{"id":"W4411068530","doi":"10.1007/978-3-031-93819-1_4","title":"A User Study on Task-Tool Matching for Simplifying Design Space Exploration in Generative Design","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Generative Design; Human–computer interaction; Task (project management); Matching (statistics); Generative grammar; Space (punctuation); Artificial intelligence; Systems engineering; Operating system; Engineering","score_opus":0.0678905848557448,"score_gpt":0.3091680262495469,"score_spread":0.24127744139380214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411068530","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.80804324,0.0004221091,0.16909845,0.00034372008,0.000049268645,0.0006683645,0.00093141577,0.0035525411,0.01689094],"genre_scores_gemma":[0.83940846,0.00020149727,0.1502077,0.00017495138,0.000009623409,0.00042417386,0.0009029784,0.0012427545,0.0074279383],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.997687,0.0016076876,0.00012756983,0.0001821674,0.00030405697,0.000091416],"domain_scores_gemma":[0.9234279,0.0711782,0.00040327644,0.0032910635,0.0014035779,0.00029612708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035956197,0.0010443118,0.00065208896,0.00081523194,0.00079042313,0.001631708,0.0013941242,0.0014543531,0.01090005],"category_scores_gemma":[0.030651154,0.00061212014,0.0005595653,0.0009649851,0.0005971663,0.002173467,0.0015442747,0.00077636325,0.0014246493],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005969691,0.0036986656,0.017726732,0.0035910835,0.00019343117,0.002554469,0.0776693,0.01636415,0.15707287,0.010845246,0.018653935,0.68566036],"study_design_scores_gemma":[0.0027288673,0.013567963,0.06395462,0.0018002018,0.0010430112,0.011391406,0.04643497,0.475928,0.21467826,0.020691613,0.146954,0.0008272028],"about_ca_topic_score_codex":0.0023761257,"about_ca_topic_score_gemma":0.0032941003,"teacher_disagreement_score":0.01090005,"about_ca_system_score_codex":0.00034665127,"about_ca_system_score_gemma":0.00032274253,"threshold_uncertainty_score":0.036464274},"labels":[],"label_agreement":null},{"id":"W4411069314","doi":"10.1007/978-3-031-93822-1_7","title":"Enhancing Clinician-Patient Communication: The Use of Large Interactive Displays in Clinical Consultations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Patient-Provider Communication in Healthcare","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia; Computer graphics (images)","score_opus":0.19522101213345336,"score_gpt":0.4636322613148972,"score_spread":0.2684112491814439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411069314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27651477,0.028839648,0.37826273,0.017880665,0.0017548916,0.000560892,0.0008975555,0.010004455,0.2852843],"genre_scores_gemma":[0.6921126,0.011358326,0.23054522,0.0024558941,0.0007857384,0.0005316993,0.00038337059,0.0008806569,0.060946487],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991385,0.0005880708,0.000023943441,0.000039527215,0.00016743845,0.000042484477],"domain_scores_gemma":[0.9920373,0.007347596,0.00014835484,0.00012493135,0.00015744423,0.00018446372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094894355,0.00039394177,0.00020065068,0.00031338033,0.00041841876,0.0015113768,0.00078813033,0.0012448248,0.02195716],"category_scores_gemma":[0.006101644,0.00019974323,0.000255283,0.00041182397,0.00032284344,0.0013745825,0.0014478624,0.00094756624,0.002459779],"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.001035667,0.00046764113,0.0019748283,0.001242925,0.000034601882,0.0009611832,0.0064525898,0.001969209,0.03144059,0.0070415046,0.056576926,0.8908023],"study_design_scores_gemma":[0.000983684,0.0052482462,0.052608393,0.0033462625,0.0005583786,0.018618146,0.013401976,0.05970616,0.07782055,0.028739719,0.738478,0.0004905196],"about_ca_topic_score_codex":0.0004928645,"about_ca_topic_score_gemma":0.0011337909,"teacher_disagreement_score":0.02195716,"about_ca_system_score_codex":0.00024275256,"about_ca_system_score_gemma":0.00048410575,"threshold_uncertainty_score":0.07345402},"labels":[],"label_agreement":null},{"id":"W4411100220","doi":"10.1007/978-3-031-91578-9_2","title":"RegionGrasp: A Novel Task for Contact Region Controllable Hand Grasp Generation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robot Manipulation and Learning","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"GRASP; Computer science; Task (project management); Artificial intelligence; Computer vision; Engineering; Programming language; Systems engineering","score_opus":0.029781372576604796,"score_gpt":0.23682904402089974,"score_spread":0.20704767144429495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411100220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009203419,0.00010582438,0.98158824,0.000045039356,0.000052843938,0.00011387327,0.00013873297,0.0055974857,0.0031545216],"genre_scores_gemma":[0.21787098,0.00015065592,0.76965296,0.000111002206,0.000053034404,0.0002357706,0.0006458858,0.0015451917,0.00973446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996872,0.00003384325,0.00001344089,0.00009046557,0.00014069883,0.00003428293],"domain_scores_gemma":[0.99975413,0.00007588005,0.00002288668,0.0000756285,0.000038751714,0.000032797598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032958318,0.0011239257,0.00089634,0.0003325662,0.00041898817,0.00057189044,0.001705228,0.0014068433,0.010708165],"category_scores_gemma":[0.0006193795,0.0005068881,0.00057014637,0.0003518115,0.00047714927,0.00095018797,0.0018885866,0.0008768339,0.0025033178],"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.0006626454,0.00014964359,0.00021040208,0.0004530282,0.00004882107,0.00054486364,0.00020144563,0.05136763,0.38683116,0.009304426,0.013858845,0.53636706],"study_design_scores_gemma":[0.00013033787,0.00043076352,0.0006360062,0.00003359759,0.000025518195,0.0007996888,0.000049296654,0.88210624,0.0903481,0.0071287043,0.018255727,0.000056143217],"about_ca_topic_score_codex":0.0009119914,"about_ca_topic_score_gemma":0.00143517,"teacher_disagreement_score":0.010708165,"about_ca_system_score_codex":0.00020064341,"about_ca_system_score_gemma":0.0005029716,"threshold_uncertainty_score":0.035822332},"labels":[],"label_agreement":null},{"id":"W4411100376","doi":"10.1007/978-3-031-91578-9_1","title":"Electron microscopy image showing a detailed view of a surface with a textured, uneven pattern. The image highlights the fine structural details and variations in the surface morphology, typical of high-resolution electron microscopy. The grayscale tones emphasize the contrast between different areas, revealing intricate features and potential material composition differences. AirLetters A simple black and white symbol depicting a hand with three horizontal lines extending from the palm, representing a gesture or motion. The design is minimalistic and stylized. : An Open Vide A blue and white road sign with a red border, featuring a symbol of a bridge. The bridge icon is depicted in light blue against a white background, enclosed within a circular red border. The sign indicates the presence of a bridge or overpass. Dataset of Characters Drawn in the Air","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition 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 Toronto","funders":"","keywords":"Surface (topology); Resolution (logic); Morphology (biology); Computer science; Image (mathematics); Mathematical morphology; Electron microscope; High resolution; Computer vision; Artificial intelligence; Microscopy; Image formation; Computer graphics (images); Optics; Image processing; Materials science; Physics; Geometry; Geology; Mathematics; Remote sensing","score_opus":0.015309186268521199,"score_gpt":0.2712221496279156,"score_spread":0.2559129633593944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411100376","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3483281,0.01873726,0.14367157,0.004067155,0.0023416572,0.00041003872,0.160356,0.025933262,0.29615498],"genre_scores_gemma":[0.52384245,0.0085786395,0.13595763,0.0013278262,0.0003245853,0.00025343057,0.09979772,0.0023902112,0.2275275],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999311,0.0000018931538,0.0000030128504,0.000021821812,0.000029718107,0.000012580438],"domain_scores_gemma":[0.9998528,0.000027928783,0.000011493913,0.000028523038,0.000058057678,0.000021305555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009636726,0.00041870907,0.00035539138,0.00095748494,0.00043014335,0.00045569887,0.00024027948,0.0007578795,0.047296852],"category_scores_gemma":[0.00016366932,0.00032111496,0.00021462176,0.0010018565,0.00014497155,0.00043703645,0.00026295864,0.00051975896,0.011459794],"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.0002911356,0.00011959227,0.004681439,0.0014417887,0.0000679826,0.0036182792,0.00023583019,0.0025593548,0.6503882,0.00336083,0.19790655,0.135329],"study_design_scores_gemma":[0.000045592915,0.00021442983,0.09969798,0.0004189285,0.00014658266,0.011627447,0.0007271785,0.020969288,0.19729598,0.0029844998,0.66574347,0.0001286739],"about_ca_topic_score_codex":0.0021435786,"about_ca_topic_score_gemma":0.004659511,"teacher_disagreement_score":0.9527031,"about_ca_system_score_codex":0.00020309632,"about_ca_system_score_gemma":0.00021486726,"threshold_uncertainty_score":0.15822375},"labels":[],"label_agreement":null},{"id":"W4411102147","doi":"10.1007/978-981-96-6389-7_2","title":"Multiscale Bernstein Copula with Bayesian Model Averaging","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Copula (linguistics); Computer science; Bayesian probability; Econometrics; Artificial intelligence; Mathematics","score_opus":0.01575313426954557,"score_gpt":0.2149166365568447,"score_spread":0.19916350228729912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411102147","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.007968895,0.00045797962,0.98584336,0.0003044405,0.00010492464,0.000021464039,0.0000825721,0.00019980114,0.005016531],"genre_scores_gemma":[0.62594104,0.0025622847,0.33984,0.0006807977,0.00097174733,0.00026032192,0.00056617666,0.0008594045,0.028318195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877363,0.00049266807,0.00005098512,0.00024440532,0.00033122735,0.00010713435],"domain_scores_gemma":[0.9973231,0.0013991762,0.0002925768,0.00040138583,0.00034382794,0.00023989097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028900441,0.0012303776,0.0018867682,0.0011113336,0.00048578423,0.001677796,0.0018937801,0.001732496,0.0051363744],"category_scores_gemma":[0.011068151,0.0011212272,0.0015634209,0.0011310078,0.0014282506,0.003088777,0.0028954602,0.0022347749,0.0011148285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042384992,0.000037514295,0.000375087,0.00007473726,0.00009422013,0.00016787346,0.0000821841,0.19938691,0.0023003262,0.7668596,0.0036400696,0.026939172],"study_design_scores_gemma":[0.000005479963,0.00001559165,0.00020355108,0.000007885745,0.000015776328,0.000077115,0.0000073795627,0.7635053,0.00021971935,0.23466916,0.001251062,0.000022100348],"about_ca_topic_score_codex":0.0032782028,"about_ca_topic_score_gemma":0.0029153565,"teacher_disagreement_score":0.0051363744,"about_ca_system_score_codex":0.0011892935,"about_ca_system_score_gemma":0.0010044675,"threshold_uncertainty_score":0.017182887},"labels":[],"label_agreement":null},{"id":"W4411115412","doi":"10.1007/978-3-031-93706-4_19","title":"Visualizing Temporal Interval Hierarchies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Queen's University","funders":"","keywords":"Computer science; Interval (graph theory); Interval temporal logic; Theoretical computer science; Temporal logic; Mathematics; Combinatorics","score_opus":0.015651968258441666,"score_gpt":0.26737659442184936,"score_spread":0.2517246261634077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411115412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057243966,0.0031494705,0.8450165,0.0007157038,0.00031124696,0.00013291133,0.00892127,0.025901148,0.058607828],"genre_scores_gemma":[0.3534337,0.00318644,0.5998538,0.00022500382,0.00014643525,0.00020958367,0.0100713335,0.0049763066,0.027897308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986434,0.000023569748,0.000009340486,0.000032527463,0.000050783172,0.000019521029],"domain_scores_gemma":[0.9994512,0.00026079986,0.000046858026,0.00007732239,0.00009866283,0.00006516018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034619356,0.0006884135,0.0003457791,0.0018047257,0.00041744686,0.0018189594,0.0006598435,0.00041626388,0.031447183],"category_scores_gemma":[0.0013019039,0.00044344732,0.0006045598,0.0020835507,0.00022762123,0.0019875984,0.0009224544,0.0008218329,0.00261594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009733565,0.00014631724,0.0032658686,0.0013599425,0.00011901475,0.0010470607,0.0029759463,0.04299237,0.07324357,0.1726131,0.109898776,0.5913646],"study_design_scores_gemma":[0.00011376429,0.0001596831,0.006632092,0.0005664966,0.00016203217,0.001404415,0.0019709342,0.41254207,0.029873537,0.20647068,0.33998388,0.00012043643],"about_ca_topic_score_codex":0.0036786767,"about_ca_topic_score_gemma":0.0052309427,"teacher_disagreement_score":0.031447183,"about_ca_system_score_codex":0.00042267624,"about_ca_system_score_gemma":0.00032596992,"threshold_uncertainty_score":0.105201244},"labels":[],"label_agreement":null},{"id":"W4411116683","doi":"10.1007/978-3-031-93064-5_14","title":"Democratizing Built Environment Design Through Location-Based Augmented Reality with Data Sharing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Augmented reality; Human–computer interaction; Computer graphics (images)","score_opus":0.07711688288825294,"score_gpt":0.29519612342621665,"score_spread":0.2180792405379637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411116683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010456421,0.00024753757,0.97048587,0.0002187284,0.000073274685,0.00004691879,0.000056255318,0.0009503363,0.017464705],"genre_scores_gemma":[0.38137606,0.0006397351,0.60236996,0.00012614291,0.000042252665,0.0001468893,0.00023071296,0.00050422247,0.014564092],"study_design_codex":"design_other","study_design_gemma":"design_other","domain_scores_codex":[0.9983253,0.00043790575,0.00006163838,0.00024241874,0.0007931454,0.00013958105],"domain_scores_gemma":[0.9990939,0.00021784077,0.00005833083,0.0004761607,0.000114113354,0.000039652463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093343295,0.0011593805,0.00078168634,0.00072667276,0.00071820157,0.0035781988,0.0017687357,0.0010386067,0.0060528065],"category_scores_gemma":[0.0018667732,0.00083118404,0.0009047411,0.00093356724,0.0015775709,0.0034623076,0.0065625245,0.0015721943,0.0017574698],"study_design_candidate":"design_other","study_design_consensus":"design_other","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016223715,0.00025233853,0.0009808503,0.00041932566,0.00012757746,0.0003319535,0.0021729574,0.2964597,0.065679155,0.1922201,0.008625355,0.4325683],"study_design_scores_gemma":[0.000053156426,0.00025427574,0.0012306414,0.00015545914,0.00010961695,0.00063322193,0.0019251157,0.66292566,0.040927958,0.13991845,0.15170231,0.000164243],"about_ca_topic_score_codex":0.0019030028,"about_ca_topic_score_gemma":0.0040600626,"teacher_disagreement_score":0.0060528065,"about_ca_system_score_codex":0.000517707,"about_ca_system_score_gemma":0.0008188109,"threshold_uncertainty_score":0.020248592},"labels":[],"label_agreement":null},{"id":"W4411116825","doi":"10.1007/978-3-031-93061-4_16","title":"Empathy and Communication: Developing a Mobile Game to Enhance Social Support for Young Adult Cancer Patients","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Family Support in Illness","field":"Social Sciences","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":"York University","funders":"","keywords":"Computer science; Empathy; Human–computer interaction; Cancer; Multimedia; Psychology; Medicine; Social psychology","score_opus":0.016367790450868086,"score_gpt":0.32016566369402405,"score_spread":0.303797873243156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411116825","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.848883,0.0011282281,0.10312813,0.002287015,0.0006941107,0.0012611694,0.00036682948,0.0025413933,0.03971011],"genre_scores_gemma":[0.761135,0.0010614378,0.19455634,0.0015579859,0.0001343864,0.0019871432,0.00046491245,0.00025696805,0.03884579],"study_design_codex":"design_other","study_design_gemma":"design_other","domain_scores_codex":[0.99983335,0.00006617537,0.000006144723,0.000024739864,0.00003092958,0.000038638464],"domain_scores_gemma":[0.99964607,0.00021224067,0.000014597058,0.0000066978355,0.000022855937,0.00009759547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043725624,0.0009536548,0.00021703973,0.00021934038,0.00030198944,0.00073656155,0.00085017027,0.00070709735,0.0055495542],"category_scores_gemma":[0.0010759291,0.00014101426,0.00037172937,0.00007002772,0.00021431808,0.0005516694,0.0012579969,0.0006807804,0.0008719163],"study_design_candidate":"design_other","study_design_consensus":"design_other","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023553637,0.011349405,0.008904016,0.0021110864,0.00022231684,0.0019660683,0.0151715465,0.005423516,0.10756056,0.005134074,0.062353663,0.7774484],"study_design_scores_gemma":[0.004999654,0.040444322,0.109294735,0.0029336058,0.0018965204,0.01699868,0.036187254,0.17749266,0.11016501,0.025031526,0.47357318,0.0009828833],"about_ca_topic_score_codex":0.00036354954,"about_ca_topic_score_gemma":0.0011487735,"teacher_disagreement_score":0.0055495542,"about_ca_system_score_codex":0.00016568674,"about_ca_system_score_gemma":0.00028340606,"threshold_uncertainty_score":0.018565118},"labels":[],"label_agreement":null},{"id":"W4411144328","doi":"10.1007/978-3-031-94959-3_11","title":"Bridging Research and Practice in Persuasive Mobile Stress Management Apps: A 21-Year Comparative Analysis and Novel Design Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","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":"Dalhousie University","funders":"","keywords":"Bridging (networking); Computer science; Mobile apps; Persuasive technology; World Wide Web; Computer security; Psychology; Persuasion","score_opus":0.09923513748740848,"score_gpt":0.4546361321279181,"score_spread":0.3554009946405096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144328","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.9126792,0.021696359,0.021387408,0.008472298,0.0006480232,0.0049377773,0.00068251137,0.00013800705,0.029358456],"genre_scores_gemma":[0.94910663,0.0053200684,0.032857787,0.0013187969,0.000100370555,0.005830381,0.000438197,0.000046981444,0.0049807862],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.91797966,0.0596923,0.005061825,0.0029972352,0.009980161,0.004288756],"domain_scores_gemma":[0.8108061,0.1385004,0.012420022,0.0067296685,0.027279794,0.0042639505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.12878175,0.0007303273,0.0011017392,0.0069040116,0.0050877454,0.011481053,0.0028924483,0.00224519,0.0055408054],"category_scores_gemma":[0.14123864,0.00091709156,0.0016862473,0.0059001064,0.004806937,0.013972749,0.0131752845,0.002050521,0.0005895807],"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.0016327058,0.0034799844,0.088313825,0.0057579647,0.00064193923,0.0003170552,0.2618559,0.0002641215,0.0023480712,0.03676339,0.005877256,0.5927478],"study_design_scores_gemma":[0.0004975164,0.010431908,0.33903337,0.014267205,0.0017166886,0.00064896076,0.5506848,0.001331924,0.0052207145,0.014837594,0.06102977,0.0002996672],"about_ca_topic_score_codex":0.0061949217,"about_ca_topic_score_gemma":0.012283632,"teacher_disagreement_score":0.12878175,"about_ca_system_score_codex":0.0106636435,"about_ca_system_score_gemma":0.024086248,"threshold_uncertainty_score":0.68107116},"labels":[],"label_agreement":null},{"id":"W4411144344","doi":"10.1007/978-3-031-94959-3_6","title":"Insights into the Design of Ethical and Trustworthy Persuasive Technologies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Trustworthiness; Computer science; Persuasive technology; Engineering ethics; Data science; Human–computer interaction; Computer security; Persuasion; Psychology; Social psychology; Engineering","score_opus":0.0196549499106622,"score_gpt":0.27186321203802327,"score_spread":0.2522082621273611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05271924,0.0039027,0.4513544,0.043063555,0.00047431327,0.00040154296,0.00009000253,0.00031739078,0.44767678],"genre_scores_gemma":[0.8896922,0.0011378814,0.092300996,0.0011376974,0.00012632874,0.00039849128,0.000054634267,0.00017911206,0.014972676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96177053,0.030054143,0.0010355045,0.0010046399,0.0050432035,0.0010918733],"domain_scores_gemma":[0.90294003,0.08542002,0.002951575,0.0037965518,0.003702119,0.0011897132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025421653,0.0009776526,0.0005311891,0.0021570318,0.003982894,0.01786108,0.0024858424,0.0065923226,0.01047288],"category_scores_gemma":[0.07272692,0.0012161429,0.0006292474,0.001144197,0.018908419,0.01588807,0.0043537025,0.00538735,0.0014722014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022356488,0.000034592143,0.00027086423,0.00011136374,0.000008714459,0.00013028299,0.013194235,0.00095189794,0.00023902932,0.97312057,0.0012062117,0.01070987],"study_design_scores_gemma":[0.000028867384,0.000033201166,0.00020426506,0.00023604652,0.000015204456,0.00022227173,0.0073361746,0.00520397,0.00067383726,0.94815606,0.037873674,0.000016295116],"about_ca_topic_score_codex":0.0016045963,"about_ca_topic_score_gemma":0.001726995,"teacher_disagreement_score":0.025421653,"about_ca_system_score_codex":0.0041447575,"about_ca_system_score_gemma":0.0054259063,"threshold_uncertainty_score":0.13444412},"labels":[],"label_agreement":null},{"id":"W4411144372","doi":"10.1007/978-3-031-94959-3_19","title":"PetBuddy: An Examination of Augmented Reality Mobile Health Game for Promoting Physical Activity","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Augmented reality; Human–computer interaction; Multimedia","score_opus":0.0293562419839548,"score_gpt":0.3279125471127836,"score_spread":0.2985563051288288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144372","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.5547709,0.02494033,0.086121336,0.004204689,0.000956825,0.002284781,0.002118292,0.0035625806,0.32104024],"genre_scores_gemma":[0.5844438,0.019944502,0.1863733,0.0022908307,0.00013167603,0.00091057614,0.0017102099,0.00088066893,0.20331447],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99960905,0.00011204551,0.000016740338,0.000049228966,0.00018182237,0.000031116884],"domain_scores_gemma":[0.99954754,0.00026285838,0.000021025411,0.000020582691,0.00011556138,0.000032394582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077514676,0.00060965086,0.00031399642,0.0007798103,0.00043802723,0.0015406545,0.00068964704,0.0005700163,0.0051436257],"category_scores_gemma":[0.0015626686,0.0002347877,0.0002653732,0.000375447,0.00034183185,0.0012063328,0.00083069113,0.00064944965,0.00083738036],"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.0017568566,0.0011952522,0.0060374993,0.0021753723,0.00006673795,0.00061665056,0.0046371818,0.0019280654,0.038780447,0.020969404,0.03208994,0.88974655],"study_design_scores_gemma":[0.00028134158,0.00868859,0.06825703,0.003051365,0.00042528822,0.0053720493,0.007860401,0.026523793,0.049876772,0.006142555,0.8232961,0.00022469966],"about_ca_topic_score_codex":0.0053122253,"about_ca_topic_score_gemma":0.012807925,"teacher_disagreement_score":0.0053122253,"about_ca_system_score_codex":0.0005326432,"about_ca_system_score_gemma":0.0008827342,"threshold_uncertainty_score":0.017207086},"labels":[],"label_agreement":null},{"id":"W4411144373","doi":"10.1007/978-3-031-94959-3_20","title":"The Motivational Appeal of Persuasive Strategies in a Healthy Eating Behaviour Change Game","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; MacEwan University","funders":"","keywords":"Computer science; Appeal; Persuasive technology; Human–computer interaction; Psychology; Social psychology; Persuasion; Political science","score_opus":0.07266202129141236,"score_gpt":0.38464972560567723,"score_spread":0.31198770431426487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144373","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.6141846,0.0018129998,0.12070671,0.0033224563,0.0007223878,0.0007863084,0.00014359943,0.00092707167,0.2573939],"genre_scores_gemma":[0.896584,0.00068373827,0.06159848,0.0005656317,0.000101011276,0.0005502732,0.00008010579,0.00008905623,0.039747782],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99987507,0.00005164034,0.0000041342246,0.000014282219,0.00004194648,0.00001285105],"domain_scores_gemma":[0.99920624,0.00072171044,0.000013123166,0.000007895793,0.00001637868,0.000034587796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289538,0.00048108556,0.00017463107,0.0002065276,0.00020017353,0.0008578153,0.0004651193,0.00074734434,0.009633293],"category_scores_gemma":[0.0020619566,0.00015111871,0.00019757668,0.00009823804,0.00023473219,0.0007086735,0.00049227994,0.0009462247,0.00066688785],"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.0028994856,0.0070790187,0.0029975923,0.0010534598,0.00009822771,0.0007411595,0.0038133,0.011413909,0.06641226,0.11286911,0.01819414,0.77242833],"study_design_scores_gemma":[0.0035632595,0.012805292,0.04725599,0.0011611969,0.00066597597,0.0018586159,0.0038604557,0.47402167,0.044564333,0.27318877,0.13677543,0.0002791349],"about_ca_topic_score_codex":0.00030777976,"about_ca_topic_score_gemma":0.00060475175,"teacher_disagreement_score":0.009633293,"about_ca_system_score_codex":0.00014591473,"about_ca_system_score_gemma":0.00019715287,"threshold_uncertainty_score":0.032226622},"labels":[],"label_agreement":null},{"id":"W4411144425","doi":"10.1007/978-3-031-94959-3_10","title":"LifeLink: The Design and Evaluation of an mHealth App for Caregivers Supporting Individuals with Suicidality","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Suicide and Self-Harm Studies","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"mHealth; Computer science; Mobile apps; World Wide Web; Psychiatry; Psychology; Psychological intervention","score_opus":0.07477251132426893,"score_gpt":0.3732524941304359,"score_spread":0.29847998280616694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144425","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.88216263,0.0019672832,0.07264699,0.0011814904,0.0006169341,0.020222954,0.0028299456,0.0058228252,0.012548895],"genre_scores_gemma":[0.6324714,0.0024784494,0.30422014,0.002321437,0.00011170464,0.024463017,0.0038953722,0.0016263674,0.028412163],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99853086,0.0007190899,0.00014120455,0.00012744537,0.0003720206,0.000109401284],"domain_scores_gemma":[0.9976579,0.0016077633,0.00008221941,0.000075399425,0.0003618613,0.00021490054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031510245,0.0011015361,0.0004384648,0.0005702054,0.0005712128,0.0017523984,0.0016220154,0.0013316377,0.006997958],"category_scores_gemma":[0.006838403,0.00043240184,0.0005023025,0.00019015225,0.0006652092,0.0014860363,0.001495515,0.00078350335,0.0013614849],"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.0119327195,0.016066777,0.009846414,0.011185309,0.0006871942,0.0019114232,0.017415414,0.0050452137,0.07922196,0.002525274,0.039529733,0.8046326],"study_design_scores_gemma":[0.025829775,0.16851863,0.080822006,0.0065682535,0.0063801594,0.005951365,0.03297552,0.08967091,0.22846483,0.0101921605,0.34290445,0.0017219343],"about_ca_topic_score_codex":0.0016082948,"about_ca_topic_score_gemma":0.0028633836,"teacher_disagreement_score":0.006997958,"about_ca_system_score_codex":0.0004906871,"about_ca_system_score_gemma":0.0018749108,"threshold_uncertainty_score":0.023410559},"labels":[],"label_agreement":null},{"id":"W4411144445","doi":"10.1007/978-3-031-94959-3_15","title":"Health Risk Management Using Persuasive Technology: A Scoping Review","year":2025,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Persuasive technology; Persuasion","score_opus":0.10122038321346442,"score_gpt":0.499662388114811,"score_spread":0.39844200490134657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144445","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016024255,0.9993337,0.00009473742,0.00009495532,0.0000611111,0.000079156234,0.000034226585,0.000004055913,0.00013785975],"genre_scores_gemma":[0.0015193096,0.9977028,0.00033847737,0.00020041445,0.000042639826,0.00009524149,0.000036195677,0.0000024140313,0.00006258212],"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667966,0.00087814045,0.0012568308,0.00030680804,0.00074050366,0.00013815136],"domain_scores_gemma":[0.9865372,0.0106078405,0.0016552021,0.00016143902,0.0008875883,0.00015076659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072134677,0.0017164423,0.0076851347,0.008541047,0.0006107416,0.004061559,0.002163559,0.003458894,0.0044199075],"category_scores_gemma":[0.017877592,0.0012166359,0.005597195,0.0069934367,0.0008999488,0.0025864646,0.0019311329,0.002156096,0.000628438],"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.00019496499,0.00008772036,0.00034258494,0.76457095,0.004034931,0.00009677587,0.00019574075,0.00016311294,0.00026562135,0.0004590852,0.002695358,0.22689311],"study_design_scores_gemma":[0.00022335781,0.0002280731,0.0016003689,0.92456657,0.029816117,0.00036040854,0.00026978602,0.00015625653,0.00027761032,0.0005919646,0.041866146,0.000043265583],"about_ca_topic_score_codex":0.0051731025,"about_ca_topic_score_gemma":0.012857627,"teacher_disagreement_score":0.008541047,"about_ca_system_score_codex":0.0019400388,"about_ca_system_score_gemma":0.007438822,"threshold_uncertainty_score":0.03814894},"labels":[],"label_agreement":null},{"id":"W4411144460","doi":"10.1007/978-3-031-94959-3_8","title":"The Heuristic Evaluation of Manipulative Interfaces","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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 Saskatchewan","funders":"","keywords":"Computer science; Heuristic; Human–computer interaction; Artificial intelligence","score_opus":0.07111697974933485,"score_gpt":0.3138544253923076,"score_spread":0.24273744564297278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144460","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.47215712,0.012046255,0.25597888,0.0015601636,0.00041177988,0.0012088587,0.0003279805,0.00085995736,0.25544903],"genre_scores_gemma":[0.91309994,0.0009848884,0.078797884,0.000116309515,0.000050958708,0.00030877235,0.00018753216,0.00011056497,0.0063432874],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.985741,0.0094845565,0.00039548503,0.00042068883,0.0036779174,0.0002802496],"domain_scores_gemma":[0.936552,0.05616445,0.0016293342,0.0027076735,0.0025577326,0.00038885413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006992794,0.0009608727,0.0007372181,0.0022761533,0.000647108,0.004347343,0.0018762132,0.0013258404,0.010628581],"category_scores_gemma":[0.102949455,0.0004536899,0.00052418426,0.0015200293,0.0025759006,0.0033888717,0.0016629994,0.00086815056,0.0007464454],"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.0026615306,0.00059351133,0.0047008027,0.00216203,0.00022086989,0.00025743354,0.0047296765,0.022030208,0.007986533,0.2334382,0.007407838,0.71381134],"study_design_scores_gemma":[0.0007943666,0.0038277498,0.023344105,0.0018318506,0.00045824226,0.0010433495,0.008383402,0.49628323,0.020810777,0.40916005,0.033808812,0.00025407743],"about_ca_topic_score_codex":0.0015755263,"about_ca_topic_score_gemma":0.0017868232,"teacher_disagreement_score":0.010628581,"about_ca_system_score_codex":0.0016272996,"about_ca_system_score_gemma":0.0013395988,"threshold_uncertainty_score":0.03698182},"labels":[],"label_agreement":null},{"id":"W4411144491","doi":"10.1007/978-3-031-94959-3_14","title":"MyHealthCore: Towards a Community-Engaged HIV Prevention Persuasive mHealth App for Black Communities in Canada","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Health and mHealth Applications","field":"Health Professions","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"mHealth; Human immunodeficiency virus (HIV); Computer science; World Wide Web; Internet privacy; Medicine; Nursing; Family medicine; Psychological intervention","score_opus":0.0783369860649362,"score_gpt":0.39099984500803375,"score_spread":0.31266285894309753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144491","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24215771,0.012675442,0.024085391,0.054934423,0.0031343058,0.0017636787,0.004342629,0.0059918626,0.6509145],"genre_scores_gemma":[0.23524177,0.008485768,0.049400482,0.010179291,0.00013633573,0.0004970537,0.001450248,0.0009881827,0.6936208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996301,0.00002731898,0.000004967968,0.000030690313,0.00019231526,0.00011452793],"domain_scores_gemma":[0.99947375,0.00004283238,0.000010528568,0.0000062577164,0.00021545682,0.00025132514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316903,0.00043842156,0.0002287144,0.0005533625,0.0051594814,0.002794285,0.0010098158,0.0010572976,0.02406295],"category_scores_gemma":[0.0008938356,0.00021741295,0.00025234185,0.00058444013,0.00070047844,0.00086735934,0.0015220672,0.0014338304,0.0032779083],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019861429,0.0005362814,0.0057206377,0.00039245794,0.000017620358,0.0005095863,0.017749293,0.00022198788,0.006441547,0.0056736106,0.3970865,0.5654519],"study_design_scores_gemma":[0.000058165664,0.00022334975,0.01841542,0.000600214,0.0000409432,0.00029960353,0.021249259,0.0008754985,0.0022440008,0.0015204862,0.9543824,0.00009059724],"about_ca_topic_score_codex":0.9087407,"about_ca_topic_score_gemma":0.98013675,"teacher_disagreement_score":0.0912593,"about_ca_system_score_codex":0.007921421,"about_ca_system_score_gemma":0.0518056,"threshold_uncertainty_score":0.18359345},"labels":[],"label_agreement":null},{"id":"W4411174390","doi":"10.1007/978-3-031-90200-0_14","title":"Towards Using Partitioned GPU Virtual Functions for Mixture of Experts","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Computer graphics (images); Computational science; Parallel computing","score_opus":0.02732884269420938,"score_gpt":0.2680875058637235,"score_spread":0.2407586631695141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411174390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071483795,0.00011681139,0.9880884,0.00007090931,0.000067916786,0.000026381038,0.000032875723,0.0015132563,0.0029350352],"genre_scores_gemma":[0.108728185,0.00014702172,0.88187104,0.00017411158,0.00007795928,0.00009483008,0.00024102975,0.0007603685,0.007905311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989536,0.00032996113,0.000049856506,0.00019675033,0.00030178527,0.00016802935],"domain_scores_gemma":[0.99833494,0.0004860725,0.000052521566,0.00055675843,0.00036318036,0.00020654002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013508603,0.0011478967,0.0012001747,0.0007806044,0.00081778516,0.0022474087,0.00328303,0.0014934522,0.009255037],"category_scores_gemma":[0.004697875,0.0007858254,0.0012325065,0.00086985005,0.00077125273,0.0024241162,0.0046910215,0.0022074936,0.0043480755],"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.0011939354,0.00039462105,0.0015635692,0.00022404837,0.00022523083,0.00026929198,0.0004984219,0.26176792,0.046640173,0.110856876,0.018829666,0.5575363],"study_design_scores_gemma":[0.00004710172,0.00006593796,0.00014580505,0.000020389065,0.00002556718,0.0001178665,0.000058149777,0.9464908,0.009218808,0.031544477,0.01224617,0.000018890209],"about_ca_topic_score_codex":0.0031123606,"about_ca_topic_score_gemma":0.004257527,"teacher_disagreement_score":0.009255037,"about_ca_system_score_codex":0.00087806676,"about_ca_system_score_gemma":0.0011863998,"threshold_uncertainty_score":0.030961156},"labels":[],"label_agreement":null},{"id":"W4411187106","doi":"10.1007/978-3-031-93112-3_4","title":"A Constant-Factor Approximation for Pairwise Fair k-Center Clustering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Computer science; Constant (computer programming); Pairwise comparison; Cluster analysis; Center (category theory); Factor (programming language); Algorithm; Artificial intelligence; Programming language","score_opus":0.016899236704937204,"score_gpt":0.26283147579698907,"score_spread":0.24593223909205186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411187106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008755501,0.000676481,0.9818138,0.0005306268,0.0002477389,0.00023447062,0.00035920544,0.0010366049,0.0063456064],"genre_scores_gemma":[0.25385612,0.0007900236,0.7256039,0.0005685571,0.00049079483,0.00064453343,0.0010921973,0.0007631797,0.016190633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952685,0.0013429769,0.00015358433,0.0010724161,0.00149428,0.0006682422],"domain_scores_gemma":[0.98529714,0.008346614,0.00043049813,0.0032369944,0.0019342565,0.00075449975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058966675,0.0024937403,0.004252432,0.002296524,0.0033078825,0.0039389753,0.011395476,0.0037154818,0.019001657],"category_scores_gemma":[0.032987192,0.0011888716,0.002215091,0.0056524584,0.0032374167,0.0075048674,0.005928663,0.0049423757,0.0041742544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010103264,0.00039192048,0.00083010073,0.00034835906,0.00012590016,0.00009013706,0.0003035029,0.6553835,0.0023031093,0.16669674,0.030726785,0.14178951],"study_design_scores_gemma":[0.000034665074,0.000036863847,0.000086260916,0.000019267523,0.000020374873,0.000039290568,0.00004558494,0.92004776,0.00042838225,0.07757507,0.0016484073,0.000018127594],"about_ca_topic_score_codex":0.016989706,"about_ca_topic_score_gemma":0.020431364,"teacher_disagreement_score":0.019001657,"about_ca_system_score_codex":0.006922236,"about_ca_system_score_gemma":0.006351816,"threshold_uncertainty_score":0.06356692},"labels":[],"label_agreement":null},{"id":"W4411187141","doi":"10.1007/978-3-031-93112-3_12","title":"The Differentiable Feasibility Pump","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hydraulic and Pneumatic Systems","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":"Polytechnique Montréal","funders":"","keywords":"Differentiable function; Computer science; Mathematics; Mathematical analysis","score_opus":0.014264817830330808,"score_gpt":0.2262220496185397,"score_spread":0.21195723178820888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411187141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008108827,0.0038250075,0.53443193,0.0032183495,0.0008433727,0.00006819749,0.0003940443,0.00066899904,0.4484413],"genre_scores_gemma":[0.34304106,0.008408166,0.17322901,0.0010342672,0.0010241518,0.0002618766,0.0007712058,0.0011550289,0.47107527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996489,0.00007409082,0.000017017988,0.000083580984,0.00014266079,0.000033730634],"domain_scores_gemma":[0.9997056,0.0001124889,0.000023432507,0.000070248636,0.000059478574,0.000028683207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533042,0.0006229612,0.00078299537,0.00074691104,0.0007624566,0.0023341887,0.0008381356,0.00118937,0.03703305],"category_scores_gemma":[0.0022128345,0.00057315454,0.0006902082,0.00076172024,0.0016550212,0.00422276,0.0024852243,0.0036868106,0.007834033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023277817,0.000011312097,0.00003233975,0.00003767636,0.0000040005143,0.000036228997,0.000024836123,0.0017300263,0.0007763277,0.94395286,0.0081051,0.045265913],"study_design_scores_gemma":[0.000013049011,0.000027930271,0.0001262786,0.000041045245,0.0000082434035,0.00017432346,0.000029953546,0.023263056,0.0014598939,0.87941974,0.09542001,0.000016559188],"about_ca_topic_score_codex":0.00043220236,"about_ca_topic_score_gemma":0.00025771558,"teacher_disagreement_score":0.03703305,"about_ca_system_score_codex":0.0008615239,"about_ca_system_score_gemma":0.00087158,"threshold_uncertainty_score":0.1238879},"labels":[],"label_agreement":null},{"id":"W4411188042","doi":"10.1007/978-3-031-93112-3_28","title":"Unsplittable Multicommodity Flows in Outerplanar Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorics; Outerplanar graph; Discrete mathematics; Mathematics; Pathwidth; Graph; Line graph","score_opus":0.01757865680214116,"score_gpt":0.259238448870317,"score_spread":0.24165979206817584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411188042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21751478,0.0030304107,0.5750222,0.0014109537,0.00046494222,0.00019679908,0.0011044199,0.00083781,0.20041764],"genre_scores_gemma":[0.6221718,0.007267441,0.2004169,0.00035676747,0.00039122882,0.00025379882,0.0019071901,0.0007916742,0.16644323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997954,0.000039839786,0.0000098655155,0.00004458378,0.00005543136,0.000054884556],"domain_scores_gemma":[0.9994143,0.00033604464,0.000063349726,0.00007417672,0.00006614656,0.000045984954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003077463,0.0009161823,0.0005015781,0.000756709,0.0008567713,0.0014552535,0.0012616725,0.0006583033,0.008867423],"category_scores_gemma":[0.0017399681,0.0005748905,0.00054813037,0.0022877075,0.0006953126,0.003299854,0.0010821384,0.0018136892,0.0011718799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026066726,0.00014105697,0.0004158122,0.00064215326,0.000026688951,0.00034309368,0.0005990226,0.14709815,0.010412073,0.6424973,0.019363357,0.1782006],"study_design_scores_gemma":[0.000020410705,0.00005964424,0.00043259418,0.00009336921,0.000022239125,0.00016446957,0.0001438557,0.14581573,0.0036792618,0.8151097,0.03444168,0.000016937327],"about_ca_topic_score_codex":0.0020905829,"about_ca_topic_score_gemma":0.0027065163,"teacher_disagreement_score":0.008867423,"about_ca_system_score_codex":0.0010241235,"about_ca_system_score_gemma":0.0005335133,"threshold_uncertainty_score":0.029664457},"labels":[],"label_agreement":null},{"id":"W4411192014","doi":"10.1007/978-3-031-92833-8_15","title":"Integrating Gamification, Recommender System, and Chatbot in Cybersecurity Training: A User-Centered Approach for Enhanced Engagement and Motivation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Nexen (Canada)","funders":"","keywords":"Chatbot; Computer science; Recommender system; World Wide Web; Human–computer interaction; Multimedia","score_opus":0.06973708704381212,"score_gpt":0.31729063709631555,"score_spread":0.24755355005250343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411192014","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.19725426,0.008325503,0.6659171,0.0025962694,0.0007941838,0.0006692106,0.00016985174,0.008647582,0.11562603],"genre_scores_gemma":[0.5065392,0.003474179,0.41899985,0.00055188214,0.00014330694,0.00051771826,0.00028423674,0.00040813975,0.0690815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999589,0.00017813344,0.000015095867,0.000068591275,0.00009982513,0.000049260147],"domain_scores_gemma":[0.9994313,0.00033165634,0.000023023642,0.000048323156,0.00007186224,0.00009389243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011075594,0.0007741835,0.0005057421,0.0006728454,0.00043539848,0.002247813,0.0010748206,0.001136786,0.0076220003],"category_scores_gemma":[0.0011897264,0.00024725078,0.0005343828,0.0005097847,0.0003114889,0.0018396369,0.0016644092,0.001295248,0.0020285319],"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.0002863781,0.0016632365,0.002478052,0.0008520794,0.000100245365,0.0001919268,0.0024227588,0.0030170807,0.017556699,0.018408772,0.010925388,0.9420973],"study_design_scores_gemma":[0.0004119952,0.007139801,0.045243412,0.0038048082,0.0013504359,0.004570771,0.008478035,0.30637047,0.07185816,0.08833143,0.461948,0.0004926768],"about_ca_topic_score_codex":0.0005967956,"about_ca_topic_score_gemma":0.0020787616,"teacher_disagreement_score":0.0076220003,"about_ca_system_score_codex":0.00024450518,"about_ca_system_score_gemma":0.0005940036,"threshold_uncertainty_score":0.025498152},"labels":[],"label_agreement":null},{"id":"W4411203984","doi":"10.1007/978-3-031-92840-6_4","title":"Older Adults and Smart Home Devices: A Legal Critique of Terms of Service and Privacy Policy Agreements of Voice-Activated Smart Home Devices","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","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":"Carleton University; University of Waterloo","funders":"","keywords":"Computer science; Home automation; Internet privacy; Privacy policy; Computer security; Service (business); Telecommunications; Information privacy; Business","score_opus":0.01457995074747102,"score_gpt":0.2863272990023318,"score_spread":0.27174734825486074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411203984","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.030196363,0.0204626,0.042634383,0.33577737,0.002020482,0.00010720991,0.00021194086,0.00013238052,0.5684572],"genre_scores_gemma":[0.7767974,0.009209533,0.013605494,0.099616535,0.0042003356,0.00045827654,0.00012285402,0.00021837903,0.09577121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.98838323,0.005799858,0.0007098091,0.0011728549,0.0028918772,0.001042412],"domain_scores_gemma":[0.9781116,0.017950036,0.0011241304,0.0010476899,0.001275415,0.0004910888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014862496,0.00055941654,0.0008376074,0.001671249,0.0066813543,0.012191445,0.0029933695,0.024302924,0.004492819],"category_scores_gemma":[0.020259611,0.0007471353,0.001060935,0.0020447245,0.03224378,0.016947374,0.006779736,0.021667935,0.0009000595],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026180187,0.0000034480945,0.000028008828,0.0000072638736,7.1736923e-7,0.000026795782,0.0025683835,0.000034054658,0.000017722623,0.9928526,0.003002786,0.0014557226],"study_design_scores_gemma":[0.000015555695,0.000016394732,0.00036571076,0.00038352172,0.000011753651,0.00016353388,0.0041428246,0.0005726137,0.00020888675,0.8343627,0.1597292,0.000027399507],"about_ca_topic_score_codex":0.018035086,"about_ca_topic_score_gemma":0.01624111,"teacher_disagreement_score":0.024302924,"about_ca_system_score_codex":0.006071278,"about_ca_system_score_gemma":0.007866607,"threshold_uncertainty_score":0.0786013},"labels":[],"label_agreement":null},{"id":"W4411206505","doi":"10.1007/978-3-031-92840-6_5","title":"Exploring User Perspectives on Data Collection, Data Sharing Preferences, and Privacy Concerns with Remote Healthcare Technology","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Data collection; Data sharing; Health care; Information privacy; Internet privacy; World Wide Web; Computer security; Data science","score_opus":0.18869407412695718,"score_gpt":0.35439589837523927,"score_spread":0.1657018242482821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411206505","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.82395333,0.0020290308,0.044713646,0.012199207,0.00007065283,0.000072274604,0.00019107308,0.00009806246,0.11667271],"genre_scores_gemma":[0.991865,0.00039956314,0.004341105,0.0005065444,0.000019541743,0.000021059937,0.000058368918,0.000025291549,0.0027635575],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9914274,0.0066687465,0.00020034754,0.00027832194,0.0010470983,0.00037804808],"domain_scores_gemma":[0.97042525,0.026328195,0.0010467116,0.000648833,0.0009886131,0.0005623869],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.012486659,0.00024453943,0.00018686023,0.0006925358,0.0020263272,0.0071418523,0.0006518137,0.0014532607,0.003054552],"category_scores_gemma":[0.020166527,0.00029419435,0.00041313612,0.0011259436,0.002503855,0.00701162,0.0023536908,0.0021512213,0.00031434564],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058049895,0.00022154463,0.049035892,0.0003632973,0.00006892413,0.0015521445,0.69350207,0.0013258925,0.009192527,0.15223354,0.005393314,0.08653045],"study_design_scores_gemma":[0.00004084499,0.00040872835,0.044639945,0.00062312366,0.00015471662,0.0038904415,0.7304332,0.0121304095,0.008613351,0.09001271,0.10887873,0.00017379918],"about_ca_topic_score_codex":0.0019428245,"about_ca_topic_score_gemma":0.0023505285,"teacher_disagreement_score":0.99934816,"about_ca_system_score_codex":0.0013374907,"about_ca_system_score_gemma":0.0008377211,"threshold_uncertainty_score":0.06603652},"labels":[],"label_agreement":null},{"id":"W4411236750","doi":"10.1007/978-3-031-95452-8_2","title":"End-User Customization of Trigger-Action Rules Through Fine-Tuned LLMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spreadsheets and End-User Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Personalization; Action (physics); Human–computer interaction; World Wide Web","score_opus":0.024738601276509602,"score_gpt":0.2687539113064626,"score_spread":0.244015310029953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411236750","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027713412,0.00033710818,0.7370097,0.0002359425,0.00022119093,0.000335175,0.0008437154,0.2208263,0.012477508],"genre_scores_gemma":[0.5769693,0.00036518823,0.36276415,0.0011958575,0.00011544277,0.0004934517,0.0019263964,0.029622141,0.026548171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983601,0.00031245095,0.0002135014,0.00050018687,0.00042746178,0.00018623132],"domain_scores_gemma":[0.9945952,0.0029701735,0.00027288118,0.0014470968,0.00042655825,0.00028803063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019515305,0.0014907768,0.0009688137,0.0010613898,0.00045239629,0.0025955415,0.003959911,0.0013297215,0.02490432],"category_scores_gemma":[0.010187318,0.0010511095,0.00087487436,0.00043988213,0.0007596282,0.0024703813,0.0027702884,0.0022196716,0.009317298],"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.0033410755,0.0009965518,0.006670903,0.0008679145,0.00030584508,0.0018521982,0.0016671652,0.039380707,0.17302522,0.018313406,0.037028812,0.7165502],"study_design_scores_gemma":[0.00038093686,0.00023763573,0.0027218568,0.00023037773,0.00023255115,0.0008787883,0.000322722,0.60204303,0.24695173,0.026084302,0.11965429,0.00026183782],"about_ca_topic_score_codex":0.0020366013,"about_ca_topic_score_gemma":0.0036861014,"teacher_disagreement_score":0.02490432,"about_ca_system_score_codex":0.0008565958,"about_ca_system_score_gemma":0.00080065447,"threshold_uncertainty_score":0.08331323},"labels":[],"label_agreement":null},{"id":"W4411237691","doi":"10.1007/978-3-031-95452-8_19","title":"Assessing Computational Thinking Skills Through Artefacts: The Case of ModeLLer","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MODELLER; Computer science; Computational thinking; Engineering drawing; Programming language; Software engineering; Computer graphics (images); Artificial intelligence; Engineering","score_opus":0.02329082200805426,"score_gpt":0.29910170030740074,"score_spread":0.2758108782993465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411237691","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.9720392,0.00017605617,0.0119324485,0.0018762122,0.00003180378,0.000055238048,0.000041352378,0.00016809942,0.013679623],"genre_scores_gemma":[0.97883934,0.00017346937,0.014789851,0.00018471127,0.000005015296,0.000030829633,0.000044475102,0.00008172082,0.005850582],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99762076,0.0016048972,0.00007462475,0.00016657141,0.00038682722,0.00014627534],"domain_scores_gemma":[0.9756973,0.019685857,0.00068174495,0.0019316861,0.0012448125,0.0007587599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055837184,0.00045237126,0.00030128832,0.0010842388,0.0012898798,0.0039697876,0.0010934502,0.0024505812,0.003953687],"category_scores_gemma":[0.034661524,0.00033755804,0.00034810777,0.00047783268,0.0023455177,0.0042198277,0.0016320213,0.0019747156,0.00084226346],"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.0019422519,0.0030675444,0.13249995,0.00046725443,0.00012670907,0.02854323,0.40285525,0.010710885,0.02196911,0.049867038,0.014581623,0.33336914],"study_design_scores_gemma":[0.0004942705,0.0062455493,0.10927919,0.0013312192,0.00046147392,0.052728057,0.36660677,0.12959419,0.07355725,0.1416661,0.11707124,0.0009647808],"about_ca_topic_score_codex":0.0045090476,"about_ca_topic_score_gemma":0.00792742,"teacher_disagreement_score":0.0055837184,"about_ca_system_score_codex":0.0013352768,"about_ca_system_score_gemma":0.0015606639,"threshold_uncertainty_score":0.02952987},"labels":[],"label_agreement":null},{"id":"W4411300576","doi":"10.1007/978-3-031-95497-9_2","title":"Temporal and Spatial Fault Detection for Connected Cyber-Physical Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cyber-physical system; Fault (geology); Fault detection and isolation; Real-time computing; Artificial intelligence; Operating system; Seismology; Geology","score_opus":0.01582217726198094,"score_gpt":0.25824702030820834,"score_spread":0.2424248430462274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047814384,0.0008908673,0.9447133,0.00015997692,0.00012931306,0.000024605588,0.00008727674,0.0008208088,0.005359514],"genre_scores_gemma":[0.84775734,0.00080419116,0.14409958,0.000060360973,0.00007784644,0.000031185577,0.00014616616,0.0000745719,0.0069488403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997185,0.00003797091,0.000016422624,0.00006216675,0.00013412072,0.00003078317],"domain_scores_gemma":[0.99899656,0.00058503554,0.000100263285,0.00011388753,0.00016974403,0.00003456392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002833658,0.00053788535,0.00040132474,0.0009712777,0.00023774405,0.0006148984,0.00069464237,0.00043683342,0.0029721486],"category_scores_gemma":[0.0022234693,0.00020634121,0.0003887502,0.000663439,0.0005467015,0.0010630672,0.0006159645,0.00047901334,0.0002614998],"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.0006880462,0.00009901792,0.002661488,0.00041243463,0.00008014747,0.00038438366,0.00018958148,0.2959975,0.035796482,0.077199124,0.0034992958,0.58299255],"study_design_scores_gemma":[0.000010556807,0.00013337705,0.0010698568,0.000027791155,0.000029687055,0.00029429563,0.000036441008,0.9436175,0.009412365,0.043225825,0.0021309985,0.000011219832],"about_ca_topic_score_codex":0.0014269745,"about_ca_topic_score_gemma":0.0021001636,"teacher_disagreement_score":0.0029721486,"about_ca_system_score_codex":0.00037270342,"about_ca_system_score_gemma":0.0003743644,"threshold_uncertainty_score":0.00994283},"labels":[],"label_agreement":null},{"id":"W4411300989","doi":"10.1007/978-981-96-8170-9_24","title":"Informed Augmentation Selection Improves Tabular Contrastive Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence; Natural language processing; Machine learning","score_opus":0.010179958488680817,"score_gpt":0.2496584897264657,"score_spread":0.2394785312377849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300989","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.06082721,0.0027415599,0.9086886,0.00047680413,0.0006639208,0.00014143821,0.0009449347,0.012871312,0.012644298],"genre_scores_gemma":[0.54494643,0.0007881746,0.4209381,0.0011924605,0.00043898658,0.0002108224,0.004331745,0.0019523012,0.02520093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929416,0.0002503576,0.000025955813,0.00024363835,0.000111871756,0.00007394272],"domain_scores_gemma":[0.9983525,0.00097377336,0.000044240733,0.00036275428,0.00019687475,0.000069793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068862,0.0012755364,0.0012871792,0.0007991624,0.0005727453,0.0012969762,0.0021259584,0.0018528274,0.015046437],"category_scores_gemma":[0.00400625,0.0004574326,0.0008301831,0.0008879213,0.0006686855,0.0027024713,0.0020727897,0.002419416,0.004504938],"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.0010771464,0.00037504444,0.00059687294,0.00024115063,0.000104998944,0.0001313728,0.000075755095,0.08177976,0.024092332,0.00821818,0.028537782,0.8547696],"study_design_scores_gemma":[0.000056503657,0.0001401273,0.00024230931,0.000026163092,0.000037047026,0.00007582268,0.000022056738,0.9776328,0.008001551,0.010839663,0.002908824,0.000017065968],"about_ca_topic_score_codex":0.0023542852,"about_ca_topic_score_gemma":0.0049585006,"teacher_disagreement_score":0.015046437,"about_ca_system_score_codex":0.00052690954,"about_ca_system_score_gemma":0.00069162034,"threshold_uncertainty_score":0.050335407},"labels":[],"label_agreement":null},{"id":"W4411300991","doi":"10.1007/978-981-96-8170-9_8","title":"Streaming Isolation Forest","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Isolation (microbiology); Biology","score_opus":0.011020265665701745,"score_gpt":0.24530088975787878,"score_spread":0.23428062409217704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300991","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.02012886,0.0019265838,0.8697562,0.00065580267,0.0008806944,0.00045611695,0.008051953,0.02272286,0.0754209],"genre_scores_gemma":[0.16149399,0.0014890948,0.71174335,0.00053155853,0.0007384935,0.00033109915,0.032700114,0.0034361803,0.08753607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978095,0.000016844453,0.0000101508485,0.00008880599,0.00007094194,0.00003235324],"domain_scores_gemma":[0.9995622,0.000099618934,0.000019026682,0.00016643511,0.000106055035,0.00004667078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030852715,0.0008495282,0.0005711137,0.0008699707,0.00059266645,0.0008954309,0.0010008829,0.00050794176,0.036926985],"category_scores_gemma":[0.0012321972,0.0003428305,0.00052426517,0.001236137,0.00022853567,0.0016210102,0.00090184965,0.0010825488,0.02013858],"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.0004891887,0.0001779965,0.00075991615,0.0002766791,0.00004780962,0.00014554903,0.000034729106,0.016844835,0.01641092,0.012515763,0.12046035,0.8318363],"study_design_scores_gemma":[0.00014889635,0.00022748695,0.0022984988,0.00011670535,0.00010311044,0.0012598507,0.000091205504,0.6181405,0.029419892,0.121427685,0.22671588,0.0000502489],"about_ca_topic_score_codex":0.0015549888,"about_ca_topic_score_gemma":0.004699126,"teacher_disagreement_score":0.036926985,"about_ca_system_score_codex":0.0002263301,"about_ca_system_score_gemma":0.00066289224,"threshold_uncertainty_score":0.12353307},"labels":[],"label_agreement":null},{"id":"W4411301048","doi":"10.1007/978-981-96-8170-9_15","title":"Sampling Frequent and Diverse Patterns Through Compression","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Sampling (signal processing); Data compression; Artificial intelligence; Computer vision","score_opus":0.02990545936019222,"score_gpt":0.2783769681445482,"score_spread":0.24847150878435598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411301048","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.041067038,0.0010966772,0.9512404,0.00032865003,0.00018171167,0.00018919187,0.0006461817,0.0016232944,0.0036268502],"genre_scores_gemma":[0.2938071,0.0018904312,0.6861131,0.0003907919,0.00058015995,0.00034975095,0.0039012292,0.00042732302,0.012540058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872273,0.00020652413,0.000084062056,0.00025640722,0.00063002843,0.00010017311],"domain_scores_gemma":[0.995167,0.0027177497,0.00020690284,0.0012257408,0.00055301515,0.00012948723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010163191,0.0007679035,0.0012722289,0.0038978744,0.0005627791,0.0014475494,0.0013614006,0.00089595915,0.0039143343],"category_scores_gemma":[0.008701367,0.00050042383,0.0007383209,0.005218356,0.00084892486,0.0018406984,0.0018629124,0.0010833018,0.002136567],"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.0003836499,0.00013826907,0.0027371598,0.00023127352,0.000081708786,0.0004836157,0.0002872706,0.032635197,0.022256372,0.021024095,0.009766726,0.9099746],"study_design_scores_gemma":[0.00006326074,0.00019674537,0.0025576367,0.00007643097,0.00007986618,0.0019115172,0.00028239941,0.8572904,0.020107822,0.10466545,0.01272306,0.000045392728],"about_ca_topic_score_codex":0.0008594663,"about_ca_topic_score_gemma":0.0013218977,"teacher_disagreement_score":0.0039143343,"about_ca_system_score_codex":0.0003685329,"about_ca_system_score_gemma":0.00054774916,"threshold_uncertainty_score":0.013094723},"labels":[],"label_agreement":null},{"id":"W4411376452","doi":"10.1007/978-981-96-8173-0_10","title":"Vertical Federated Learning Across Second-Hop Parties","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"McMaster University","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network","score_opus":0.02533890044148907,"score_gpt":0.2800148304281985,"score_spread":0.25467592998670946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411376452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0717297,0.00039089745,0.9072718,0.0011157232,0.0002107286,0.00022693789,0.0003376803,0.001763472,0.016953135],"genre_scores_gemma":[0.85010076,0.00021851271,0.120296724,0.00019967547,0.00009783973,0.0001286988,0.00046921454,0.00012817627,0.028360492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538064,0.0012823988,0.00022062367,0.00081331714,0.0011766511,0.0011264491],"domain_scores_gemma":[0.9892343,0.0028869475,0.00038796032,0.0059349183,0.0010354961,0.00052032276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049361484,0.0005809059,0.0013812516,0.0008967889,0.0021191712,0.0050594895,0.0033002666,0.0025193393,0.012702372],"category_scores_gemma":[0.01031803,0.0005437997,0.0010255049,0.0019071627,0.001918336,0.0093791215,0.008257064,0.0031486182,0.0024355808],"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.0020169285,0.00078202615,0.0021773411,0.00019323066,0.0001476752,0.0003143525,0.00050412514,0.08702286,0.0058610085,0.47465935,0.011541007,0.41478008],"study_design_scores_gemma":[0.00009184392,0.00021770586,0.00047898738,0.00007555018,0.000041730254,0.0002460054,0.0002525526,0.5471067,0.009270681,0.4321239,0.010061146,0.000033155095],"about_ca_topic_score_codex":0.0016245123,"about_ca_topic_score_gemma":0.0015027197,"teacher_disagreement_score":0.012702372,"about_ca_system_score_codex":0.0020730253,"about_ca_system_score_gemma":0.0033789065,"threshold_uncertainty_score":0.0424937},"labels":[],"label_agreement":null},{"id":"W4411377271","doi":"10.1007/978-981-96-8173-0_33","title":"Human-Centered Explainable Psychiatric Disorder Diagnosis System Using Wearable ECG Monitors","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"ECG Monitoring and Analysis","field":"Medicine","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":"National Research Council Canada; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Wearable computer; Human–computer interaction; Artificial intelligence; Embedded system","score_opus":0.02215838434827858,"score_gpt":0.28722927628580436,"score_spread":0.26507089193752575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411377271","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.1953201,0.0025497775,0.7684162,0.00087821134,0.0005230948,0.0005371901,0.005236521,0.01863877,0.007900017],"genre_scores_gemma":[0.82184154,0.0015567902,0.16167313,0.0008414845,0.00040739172,0.00038445694,0.0036122918,0.00022908948,0.009453813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999045,0.000011659775,0.0000074523987,0.000036086025,0.000030841617,0.000009300531],"domain_scores_gemma":[0.9998734,0.00005415224,0.00001450293,0.000010452645,0.00003165448,0.000015752497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111908485,0.0005476278,0.00042186957,0.00035764306,0.0001390964,0.00032408902,0.0003828897,0.00051984,0.004200257],"category_scores_gemma":[0.00041903468,0.00011269987,0.00033122464,0.00016847275,0.000060347073,0.00023648347,0.0003811004,0.00032291395,0.0010861978],"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.0015507017,0.00047756042,0.0153934285,0.00047089584,0.00026447655,0.0033990615,0.00024499441,0.008672341,0.1520408,0.0007637895,0.023802748,0.7929192],"study_design_scores_gemma":[0.00049273873,0.0015739034,0.14563736,0.00021407912,0.00079112535,0.011294747,0.00037021984,0.67171824,0.13674575,0.005322025,0.025623975,0.00021592158],"about_ca_topic_score_codex":0.0007830697,"about_ca_topic_score_gemma":0.001819607,"teacher_disagreement_score":0.004200257,"about_ca_system_score_codex":0.00011298566,"about_ca_system_score_gemma":0.00017593538,"threshold_uncertainty_score":0.014051259},"labels":[],"label_agreement":null},{"id":"W4411379396","doi":"10.1007/978-981-96-8186-0_21","title":"Analogy-Augmented Generation with Procedural Memory for Procedure Generation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Interface Biologics (Canada); Thales (Canada); Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Analogy; Programming language; Theoretical computer science; Parallel computing","score_opus":0.021241273289699405,"score_gpt":0.2612090169738959,"score_spread":0.23996774368419652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411379396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005518022,0.00013238736,0.97065026,0.000070065355,0.000091405105,0.000059665683,0.00006779383,0.004704656,0.018705746],"genre_scores_gemma":[0.21770926,0.00013213656,0.76155794,0.00012297058,0.00005314766,0.00014979618,0.0003297322,0.0013017516,0.018643254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993625,0.00019653133,0.000036627476,0.00012504843,0.00021678628,0.00006248258],"domain_scores_gemma":[0.9990175,0.0004416044,0.00003094764,0.0003969523,0.000092038696,0.000020906937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053212326,0.0006151027,0.00061570125,0.00052022986,0.0006029946,0.0011271831,0.0022233613,0.0011288121,0.022038471],"category_scores_gemma":[0.002645329,0.00053152384,0.0009819382,0.00066851656,0.00095430383,0.0020542764,0.0018213167,0.0018282144,0.0042127566],"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.00028817946,0.00014207834,0.00025901114,0.00026582793,0.000033737102,0.00033788738,0.00042394517,0.04228471,0.024265727,0.4391528,0.011562143,0.480984],"study_design_scores_gemma":[0.000095817006,0.00013785546,0.00026365826,0.00006054241,0.0000777546,0.00060279673,0.00007193533,0.5212413,0.041429646,0.37604633,0.059905067,0.00006729248],"about_ca_topic_score_codex":0.00090583606,"about_ca_topic_score_gemma":0.0012530402,"teacher_disagreement_score":0.022038471,"about_ca_system_score_codex":0.00045113193,"about_ca_system_score_gemma":0.00061491807,"threshold_uncertainty_score":0.073726},"labels":[],"label_agreement":null},{"id":"W4411379405","doi":"10.1007/978-981-96-8186-0_17","title":"Improving Clinical Note Generation from Complex Doctor-Patient Conversation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Tellabs (Canada); Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Université du Québec à Montréal","funders":"","keywords":"Conversation; Computer science; Programming language; Artificial intelligence; Natural language processing; Linguistics; Philosophy","score_opus":0.036736752718166545,"score_gpt":0.30887766094679525,"score_spread":0.2721409082286287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411379405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10008024,0.0012727516,0.8120532,0.001888459,0.0012574008,0.0014288863,0.012170265,0.060889363,0.008959476],"genre_scores_gemma":[0.31151548,0.0005271045,0.6469239,0.0007070264,0.0004680041,0.0006297038,0.025452994,0.0024207528,0.011355014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983966,0.0006104673,0.00011917147,0.00036325026,0.0004210591,0.000089486966],"domain_scores_gemma":[0.9860789,0.01134453,0.00025756622,0.00060759846,0.0014248347,0.0002865937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020203297,0.0014874834,0.0010024494,0.0017085538,0.0006752885,0.0018252392,0.0015563768,0.0017437447,0.018340416],"category_scores_gemma":[0.013415979,0.0005531304,0.0008465044,0.0010591127,0.00024473818,0.0014619116,0.002066404,0.0014498092,0.011220268],"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.0025565063,0.0004618354,0.0055075358,0.0006081105,0.00016856007,0.0016386141,0.0009205459,0.014284833,0.035987873,0.0023394516,0.065804295,0.86972183],"study_design_scores_gemma":[0.00047380026,0.0006115791,0.004108312,0.00015991466,0.00027081263,0.0017027057,0.0011181606,0.8740894,0.069075525,0.011595555,0.036663312,0.00013105676],"about_ca_topic_score_codex":0.002941674,"about_ca_topic_score_gemma":0.0031826787,"teacher_disagreement_score":0.018340416,"about_ca_system_score_codex":0.0005501033,"about_ca_system_score_gemma":0.0011322098,"threshold_uncertainty_score":0.061354756},"labels":[],"label_agreement":null},{"id":"W4411436151","doi":"10.1007/978-3-031-87496-3_2","title":"An Innovative DSSE Framework: Ensuring Data Privacy and Query Verification in Untrusted Cloud Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Mount Royal University","funders":"","keywords":"Computer science; Cloud computing; Privacy protection; Computer security; Database; Operating system","score_opus":0.02566004787841346,"score_gpt":0.27727122616510785,"score_spread":0.2516111782866944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436151","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.0025241808,0.00034187763,0.9906121,0.00083161204,0.00014548379,0.00017840012,0.00013920687,0.0023268794,0.0029003255],"genre_scores_gemma":[0.20463973,0.00073687104,0.77910614,0.001045413,0.00034049462,0.00030621453,0.00062022544,0.0006481127,0.012556776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9852829,0.0031304932,0.0009327019,0.0018005625,0.0074493894,0.001404003],"domain_scores_gemma":[0.98791003,0.0028222676,0.0005065636,0.0066872207,0.001640016,0.00043387956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009537884,0.0009784395,0.0018786427,0.0015288965,0.0016987401,0.007147968,0.0056909667,0.003158705,0.005112439],"category_scores_gemma":[0.014574974,0.0011314093,0.0017461617,0.0020273179,0.0044489815,0.011509376,0.010757858,0.006100568,0.0024678726],"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.00060526637,0.00036023452,0.0010886205,0.0004262351,0.00014231697,0.0004983623,0.000574305,0.027570277,0.017128253,0.68539345,0.024673697,0.24153893],"study_design_scores_gemma":[0.000120635435,0.00015890868,0.0003215074,0.00013152287,0.000085595646,0.00093095156,0.00026573936,0.5195374,0.030239126,0.3785186,0.06957768,0.00011234073],"about_ca_topic_score_codex":0.0020183416,"about_ca_topic_score_gemma":0.0023000983,"teacher_disagreement_score":0.009537884,"about_ca_system_score_codex":0.0019039984,"about_ca_system_score_gemma":0.0045013917,"threshold_uncertainty_score":0.0504418},"labels":[],"label_agreement":null},{"id":"W4411436186","doi":"10.1007/978-3-031-87496-3_7","title":"A Privacy-Preserving Behavioral Authentication System","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","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":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Authentication (law); Computer security","score_opus":0.022838995180345486,"score_gpt":0.2718338200713337,"score_spread":0.24899482489098823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436186","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.027266687,0.00016826608,0.941311,0.00070085365,0.00024343992,0.0002013238,0.0004972425,0.014900116,0.014711069],"genre_scores_gemma":[0.6706938,0.00042255226,0.2793205,0.0008365582,0.00020799754,0.00043892246,0.0014160863,0.0007553739,0.04590829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.0002401681,0.00006824968,0.00018844737,0.00030698345,0.00016185935],"domain_scores_gemma":[0.9985765,0.0002483967,0.00007731899,0.0007648071,0.00022607266,0.00010679497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883854,0.0005025791,0.00064018456,0.00059997855,0.0011924516,0.0018402078,0.0015117876,0.0010507611,0.0065403683],"category_scores_gemma":[0.0018053941,0.0003500578,0.0006089087,0.0007848525,0.0009921693,0.0026790649,0.0030120153,0.0020665487,0.004608365],"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.0017406519,0.0006627051,0.0013173119,0.00023399187,0.000095420204,0.00032795742,0.00055955886,0.014618571,0.097383484,0.42691743,0.03665828,0.41948465],"study_design_scores_gemma":[0.00035828675,0.0007776896,0.0016623385,0.000074107375,0.00022194706,0.0012501966,0.00017871456,0.4661813,0.12627846,0.305145,0.09768215,0.00018985623],"about_ca_topic_score_codex":0.00068815274,"about_ca_topic_score_gemma":0.00058769924,"teacher_disagreement_score":0.0065403683,"about_ca_system_score_codex":0.0005766425,"about_ca_system_score_gemma":0.0013749289,"threshold_uncertainty_score":0.021879673},"labels":[],"label_agreement":null},{"id":"W4411436200","doi":"10.1007/978-3-031-87496-3_3","title":"Privacy-Preserving Machine Learning Inference for Intrusion Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; École de Technologie Supérieure","funders":"","keywords":"Computer science; Intrusion detection system; Inference; Artificial intelligence; Machine learning","score_opus":0.014970420952845717,"score_gpt":0.25146169423507597,"score_spread":0.23649127328223024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436200","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.0038231157,0.0004384687,0.99278545,0.00032382866,0.00006668487,0.000029987568,0.0001023575,0.0008787286,0.0015513905],"genre_scores_gemma":[0.46772513,0.0012358648,0.5174786,0.00065951643,0.0005670669,0.00014292455,0.001225589,0.00047625753,0.010489198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996385,0.0012460804,0.00021550315,0.0008082767,0.0010553243,0.00028983084],"domain_scores_gemma":[0.9912883,0.00459748,0.00030853233,0.003289524,0.00042046397,0.000095687385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036034712,0.00087877817,0.0015788091,0.00094141107,0.0008955342,0.0022464339,0.0029639248,0.0013589762,0.003171793],"category_scores_gemma":[0.011455992,0.0008990005,0.0019446607,0.0014606911,0.002121313,0.0045717848,0.00324732,0.0051327622,0.0012458949],"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.0005818951,0.0003084494,0.0013658329,0.0003441553,0.00028339052,0.00025057397,0.00021043935,0.22108169,0.009040599,0.28566387,0.012491589,0.4683775],"study_design_scores_gemma":[0.000016487134,0.000058780213,0.00014426521,0.0000187379,0.000036493882,0.00015117669,0.000015203963,0.68865776,0.0066258707,0.30142477,0.002837886,0.0000126444165],"about_ca_topic_score_codex":0.00073745137,"about_ca_topic_score_gemma":0.00095482584,"teacher_disagreement_score":0.0036034712,"about_ca_system_score_codex":0.0011675145,"about_ca_system_score_gemma":0.0012431021,"threshold_uncertainty_score":0.019057214},"labels":[],"label_agreement":null},{"id":"W4411436213","doi":"10.1007/978-3-031-87496-3_4","title":"Priv-IoT: Privacy-Preserving Machine Learning in IoT Utilizing TEE and Lightweight Ciphers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Internet of Things; Computer security; Embedded system","score_opus":0.017404348949499257,"score_gpt":0.26694412639215387,"score_spread":0.2495397774426546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436213","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.00740719,0.00075063884,0.9776644,0.00050309213,0.00021997068,0.0000677059,0.00015156606,0.0020733988,0.011161997],"genre_scores_gemma":[0.50989395,0.0028648044,0.43740782,0.00083452894,0.00047523188,0.00028130444,0.00090132,0.0010484431,0.04629256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933064,0.00014496129,0.00004433787,0.000120071054,0.00027028972,0.000089791],"domain_scores_gemma":[0.99926776,0.00024903016,0.000048968664,0.00034346434,0.00006230927,0.00002848548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009485101,0.0005081793,0.00068796234,0.00045444284,0.0005037988,0.0020444423,0.00087083736,0.0008950215,0.00570962],"category_scores_gemma":[0.0015818035,0.00038883172,0.000644675,0.00076635816,0.001295114,0.004598399,0.002502581,0.0027458628,0.0030697903],"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.000409064,0.0002050211,0.00057530217,0.00033100974,0.000066736764,0.00023103983,0.00015727962,0.050407663,0.021065557,0.57640755,0.023339484,0.3268043],"study_design_scores_gemma":[0.000043951415,0.00018527254,0.00028990884,0.00007220687,0.000025560832,0.00068087893,0.000054056574,0.4750293,0.035288047,0.4387702,0.049516298,0.000044314933],"about_ca_topic_score_codex":0.00015739605,"about_ca_topic_score_gemma":0.00021196598,"teacher_disagreement_score":0.00570962,"about_ca_system_score_codex":0.00049377535,"about_ca_system_score_gemma":0.00074379187,"threshold_uncertainty_score":0.019100547},"labels":[],"label_agreement":null},{"id":"W4411436346","doi":"10.1007/978-3-031-87496-3_12","title":"Is Expert-Labeled Data Worth the Cost? Exploring Active and Semi-supervised Learning Across Imbalance Scenarios in Financial Crime Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Supervised learning; Finance; Labeled data; Data science; Artificial neural network; Economics","score_opus":0.058980587540579874,"score_gpt":0.3038318852418694,"score_spread":0.2448512977012895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436346","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.18997736,0.004491979,0.78830343,0.0071122586,0.0003072787,0.00014281804,0.0007978812,0.000998924,0.007868042],"genre_scores_gemma":[0.8593157,0.0008118587,0.13369417,0.0006740161,0.00054324657,0.0000984026,0.0011970697,0.00022303556,0.0034425652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963313,0.002189713,0.000138857,0.00066321524,0.00044500484,0.0002319435],"domain_scores_gemma":[0.9566887,0.038118478,0.0011535526,0.0018891064,0.0016748674,0.0004752373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01223055,0.001142183,0.001955477,0.001428526,0.0006972794,0.0036224045,0.003035316,0.0026701868,0.002180885],"category_scores_gemma":[0.030221857,0.0006888486,0.0010174665,0.0016052657,0.0018601366,0.009792075,0.002332822,0.0033725614,0.00068699],"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.0010414412,0.000966544,0.021739466,0.00054348994,0.000370129,0.00021708841,0.0008997186,0.22322012,0.0021025096,0.03919952,0.02043777,0.6892622],"study_design_scores_gemma":[0.00002061501,0.00008746807,0.0016193467,0.000055311393,0.000034991546,0.00006439492,0.00022106776,0.9235344,0.00067767577,0.07243591,0.0012311382,0.000017729504],"about_ca_topic_score_codex":0.0023145226,"about_ca_topic_score_gemma":0.0044048275,"teacher_disagreement_score":0.01223055,"about_ca_system_score_codex":0.0009269936,"about_ca_system_score_gemma":0.0008998377,"threshold_uncertainty_score":0.06468207},"labels":[],"label_agreement":null},{"id":"W4411436444","doi":"10.1007/978-3-031-87496-3_13","title":"ExploitabilityBirthMark: An Early Predictor of the Likelihood of Exploitation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Sheridan College","funders":"","keywords":"Exploit; Computer science; Vulnerability (computing); Workload; Computer security; ENCODE; Data science; Risk analysis (engineering); Machine learning","score_opus":0.016284124536406652,"score_gpt":0.2614974433642664,"score_spread":0.24521331882785974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436444","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.82168126,0.0029766343,0.15573613,0.0010935471,0.00027942788,0.00013526884,0.006958666,0.0045520402,0.0065869917],"genre_scores_gemma":[0.9751914,0.00037674568,0.018899739,0.0000624896,0.00012144034,0.00004406889,0.0030829662,0.00007534113,0.0021459383],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992818,0.00011038425,0.000055859942,0.00017563229,0.00028461483,0.00009167807],"domain_scores_gemma":[0.9853941,0.009660017,0.0021181118,0.0007375971,0.0014662311,0.0006239027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015725931,0.0008157079,0.000621301,0.004089427,0.00030441443,0.0012917023,0.00092791667,0.0011638541,0.0031652763],"category_scores_gemma":[0.012624164,0.00025879528,0.00044218896,0.001595489,0.00035797205,0.0019715729,0.00091422553,0.0013004062,0.0019300799],"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.0007865552,0.00050965464,0.71465105,0.00015910009,0.00015844945,0.0004433682,0.00011867994,0.06170893,0.003374639,0.0014201915,0.011828288,0.20484115],"study_design_scores_gemma":[0.000014752608,0.0003058894,0.08951882,0.000067183544,0.00006911208,0.00057683745,0.00009776379,0.89660084,0.0060752784,0.003647998,0.0029576595,0.00006777908],"about_ca_topic_score_codex":0.0028166454,"about_ca_topic_score_gemma":0.0035366677,"teacher_disagreement_score":0.004089427,"about_ca_system_score_codex":0.00036115805,"about_ca_system_score_gemma":0.0005437603,"threshold_uncertainty_score":0.010588884},"labels":[],"label_agreement":null},{"id":"W4411449866","doi":"10.1007/978-3-031-93930-3_6","title":"A Logic of Actual Cause for Nondeterministic Domains","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Windsor; University of Regina","funders":"","keywords":"Computer science; Nondeterministic algorithm; Programming language; Theoretical computer science","score_opus":0.025048746715879602,"score_gpt":0.2759649340806172,"score_spread":0.2509161873647376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411449866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007901048,0.0014983127,0.8299733,0.004991895,0.00054393423,0.000092747934,0.00042476004,0.0008770603,0.15369697],"genre_scores_gemma":[0.60308504,0.0023094798,0.31458935,0.0024667012,0.0011498228,0.00040577402,0.0008862618,0.0006390662,0.07446862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806017,0.00063395046,0.00016348409,0.00041833325,0.00051136495,0.00021266092],"domain_scores_gemma":[0.9959638,0.002801686,0.00014448626,0.0005816797,0.00037177047,0.00013653227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003225063,0.0008472448,0.00081544445,0.002040837,0.0026038836,0.0053232396,0.0022698273,0.0023195215,0.01347855],"category_scores_gemma":[0.006567005,0.0012869488,0.0023684471,0.0014613277,0.0083894925,0.0130558275,0.004490147,0.0067672413,0.0020544308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063559673,0.0000035762716,0.000029287794,0.000018512,0.000003345988,0.000027489363,0.00012405851,0.00036388557,0.00010065783,0.9954476,0.00085404515,0.0030212374],"study_design_scores_gemma":[0.0000055880882,0.0000033201889,0.000017645916,0.000010370195,0.0000072059074,0.000038898637,0.000028408494,0.0016439256,0.00018901925,0.99075633,0.0072937245,0.0000056148947],"about_ca_topic_score_codex":0.0016050196,"about_ca_topic_score_gemma":0.002089122,"teacher_disagreement_score":0.01347855,"about_ca_system_score_codex":0.00271161,"about_ca_system_score_gemma":0.0018794423,"threshold_uncertainty_score":0.045090258},"labels":[],"label_agreement":null},{"id":"W4411493008","doi":"10.1007/978-3-031-94559-5_9","title":"In Silico Assessment of Arrhythmia Inducibility Dependence on Stimulus Location Using Calibrated MR-Based Infarcted Heart Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Princess Margaret Cancer Centre; Health Sciences Centre; Sunnybrook Health Science Centre; University of Toronto; Ontario Institute for Cancer Research","funders":"Agence Nationale de la Recherche","keywords":"Computer science; In silico; Stimulus (psychology); Artificial intelligence; Chemistry","score_opus":0.040603063432016015,"score_gpt":0.35652332233095946,"score_spread":0.31592025889894343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411493008","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.7849645,0.00057860464,0.20759723,0.00017001944,0.000071907736,0.000084111714,0.0008363591,0.0008095192,0.00488784],"genre_scores_gemma":[0.9868548,0.00018084822,0.011933258,0.000023719977,0.0000051120423,0.000024025936,0.00019130111,0.000025441923,0.00076165656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999928,0.000020907759,0.000005512525,0.000015322825,0.000022557382,0.00000772479],"domain_scores_gemma":[0.9996455,0.0002416611,0.000030495657,0.000027461396,0.000043273474,0.000011660601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022606636,0.00029793318,0.00025715033,0.00017811482,0.00007928761,0.00037165833,0.00043954595,0.00052178797,0.0011076925],"category_scores_gemma":[0.0007903215,0.000159305,0.00027695153,0.00012198402,0.00016645396,0.00019297143,0.0001737695,0.00022402941,0.00025265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042098406,0.00017671895,0.0026915092,0.00025893346,0.00005964541,0.00026236448,0.00011686226,0.85195655,0.12228443,0.00081347645,0.0006111786,0.020347267],"study_design_scores_gemma":[0.000015607882,0.00024273239,0.001935104,0.000012757128,0.000027247512,0.00009582704,0.000019047606,0.9759833,0.021080235,0.000264538,0.00030917863,0.000014372706],"about_ca_topic_score_codex":0.0010609335,"about_ca_topic_score_gemma":0.0011154982,"teacher_disagreement_score":0.0011076925,"about_ca_system_score_codex":0.0001708441,"about_ca_system_score_gemma":0.00015989105,"threshold_uncertainty_score":0.0037056208},"labels":[],"label_agreement":null},{"id":"W4411495524","doi":"10.1007/978-3-031-94562-5_1","title":"Nuclear Patterning of Developing Cells in Murine Ventricular Heart Walls","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA Research and Splicing","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":"McGill University","funders":"","keywords":"Computer science","score_opus":0.009589688818453021,"score_gpt":0.24828616718182459,"score_spread":0.23869647836337157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411495524","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.8650685,0.0057018637,0.04147996,0.00020029562,0.00009522216,0.00007053038,0.0009981275,0.0004429194,0.085942656],"genre_scores_gemma":[0.8927538,0.0020340653,0.021386063,0.00009377165,0.00003317632,0.00006866332,0.0010029002,0.0004994149,0.08212813],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986875,0.000018271754,0.000009307919,0.0000308252,0.000055725413,0.000017053677],"domain_scores_gemma":[0.9996669,0.00013255398,0.00005532648,0.00004184786,0.000034664783,0.00006869265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014132952,0.0002597455,0.000267028,0.00040510352,0.00022696046,0.0007137144,0.00042118967,0.0003621308,0.0016459455],"category_scores_gemma":[0.00016076198,0.00042988922,0.00018622044,0.00020728634,0.00042776845,0.0003993981,0.0004492319,0.0008438669,0.0012918698],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069175025,0.0000088617435,0.0003254881,0.000041071162,0.0000033521512,0.0001839385,0.00011938827,0.00039485414,0.9872486,0.0063581816,0.00013114537,0.0051159826],"study_design_scores_gemma":[0.000023617478,0.00017725868,0.014015138,0.000089890236,0.000018486904,0.00081406214,0.0001969912,0.0018288505,0.9635938,0.002105959,0.017124452,0.000011476284],"about_ca_topic_score_codex":0.0004979085,"about_ca_topic_score_gemma":0.0010143766,"teacher_disagreement_score":0.0016459455,"about_ca_system_score_codex":0.00031463947,"about_ca_system_score_gemma":0.00017956889,"threshold_uncertainty_score":0.005506277},"labels":[],"label_agreement":null},{"id":"W4411505258","doi":"10.1007/978-3-031-95911-0_12","title":"FAST-AID Brain: Fast and Accurate Segmentation Tool Using Artificial Intelligence Developed for Brain","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research; National Institutes of Health; Genentech; IXICO; H. Lundbeck A/S; Servier; Eisai; National Research Foundation; Northern California Institute for Research and Education; Velux Fonden; BioClinica; Biogen; Pfizer; Novartis Pharmaceuticals Corporation; University of Southern California; Danmarks Grundforskningsfond; U.S. Department of Defense; Eli Lilly and Company; Bristol-Myers Squibb; European Commission; Alzheimer's Disease Neuroimaging Initiative; Meso Scale Diagnostics; Innovationsfonden; Alzheimer's Association","keywords":"Computer science; Artificial intelligence; Segmentation; Computer vision","score_opus":0.05292207733568615,"score_gpt":0.32345717370596744,"score_spread":0.2705350963702813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411505258","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.0054605044,0.00082181575,0.942688,0.00015513595,0.00023686154,0.00008581036,0.0008993518,0.040941026,0.008711538],"genre_scores_gemma":[0.049819663,0.0007131187,0.92006,0.0003135047,0.00008206791,0.00016777896,0.0017952842,0.006011763,0.021036904],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998436,0.000010641364,0.0000089421455,0.000038044498,0.00007956257,0.000019137091],"domain_scores_gemma":[0.9997638,0.000097367556,0.00001714676,0.000029103605,0.000076756216,0.000015879014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003032361,0.0009052356,0.00060108467,0.0011007877,0.00033752318,0.0013473129,0.0015114392,0.0011071349,0.029039435],"category_scores_gemma":[0.0007733521,0.0006520778,0.00063367776,0.00078069547,0.0002756912,0.0012493511,0.0008938743,0.00086563453,0.008755539],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038520826,0.000052666193,0.0005936958,0.0006034723,0.00011334779,0.00048084153,0.00020092266,0.013089671,0.10470356,0.012729265,0.09283409,0.7742132],"study_design_scores_gemma":[0.00011367253,0.00025915867,0.0028175304,0.00020146855,0.00020449975,0.003871907,0.00016659075,0.45559546,0.24731784,0.028245147,0.26100007,0.00020657654],"about_ca_topic_score_codex":0.0011575674,"about_ca_topic_score_gemma":0.0019851462,"teacher_disagreement_score":0.029039435,"about_ca_system_score_codex":0.00030243432,"about_ca_system_score_gemma":0.0005829403,"threshold_uncertainty_score":0.09714663},"labels":[],"label_agreement":null},{"id":"W4411506906","doi":"10.1007/978-3-031-95761-1_13","title":"Quantum-Safe Public Key Blinding from MPC-in-the-Head Signature Schemes","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","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":"Université de Montréal; National Research Council Canada","funders":"","keywords":"Blinding; Computer science; Signature (topology); Key (lock); Head (geology); Public-key cryptography; Quantum; Scheme (mathematics); Theoretical computer science; Computer security; Mathematics; Medicine; Quantum mechanics; Physics; Surgery","score_opus":0.02033876263979523,"score_gpt":0.25705294278295904,"score_spread":0.2367141801431638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411506906","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.025920253,0.0010180579,0.8819117,0.002081506,0.0005462839,0.00014231437,0.00034974175,0.0014968659,0.086533315],"genre_scores_gemma":[0.8135849,0.0013228612,0.11331329,0.0009677207,0.0005583395,0.00027156112,0.00047864162,0.0006973492,0.068805344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803907,0.0004516777,0.000088173096,0.00023628074,0.0008509186,0.00033396896],"domain_scores_gemma":[0.99778914,0.0007806806,0.00014352342,0.0009663992,0.00022100887,0.0000992075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013089197,0.0009007857,0.0010852519,0.00063391187,0.0013534448,0.0027372455,0.001437422,0.0023738965,0.009005382],"category_scores_gemma":[0.0059021013,0.00069491414,0.00087411574,0.0009357063,0.003176674,0.0059708585,0.00548547,0.005195065,0.00402719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012620297,0.000027939617,0.00007263771,0.00010853987,0.000012060974,0.0000682691,0.00019019877,0.00902512,0.0035726782,0.95490694,0.0042071254,0.027682353],"study_design_scores_gemma":[0.000013415067,0.000015261166,0.000045735167,0.00002462493,0.0000067615756,0.000055222306,0.000016279284,0.020859666,0.004395344,0.9691301,0.005416397,0.000021192192],"about_ca_topic_score_codex":0.0003785379,"about_ca_topic_score_gemma":0.00036670192,"teacher_disagreement_score":0.009005382,"about_ca_system_score_codex":0.0013840576,"about_ca_system_score_gemma":0.0017926686,"threshold_uncertainty_score":0.030125976},"labels":[],"label_agreement":null},{"id":"W4411507034","doi":"10.1007/978-3-031-95841-0_73","title":"Pseudo-CT Generation from Uncorrected PET Images Using Multiview Ensemble Conditional Diffusion Model for Attenuation Correction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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":"Q & T Research; Centre Hospitalier Universitaire de Sherbrooke; Université de Sherbrooke","funders":"","keywords":"Computer science; Attenuation; Correction for attenuation; Artificial intelligence; Diffusion; Computer vision; Algorithm; Optics; Physics","score_opus":0.04316891565657111,"score_gpt":0.3225338587328053,"score_spread":0.2793649430762342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411507034","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.0039549368,0.0002447235,0.9926122,0.000105285995,0.00008187725,0.00003774046,0.00036652765,0.001506474,0.0010902802],"genre_scores_gemma":[0.09680765,0.000730243,0.893106,0.00017532082,0.00006335872,0.0001214662,0.002060575,0.0016662928,0.0052691693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998797,0.000021186665,0.000006632999,0.00002635828,0.00005382368,0.000012139751],"domain_scores_gemma":[0.999585,0.00015908662,0.000033109623,0.000076888995,0.00011943502,0.000026488482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038762024,0.000716174,0.00051155157,0.00054436736,0.00020380867,0.0009416267,0.00093615655,0.0010287229,0.0050533507],"category_scores_gemma":[0.0013078768,0.0006801556,0.0010670654,0.00073037174,0.00024640476,0.00066337513,0.000696763,0.0012861345,0.0023218743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038359236,0.00007557712,0.00069528393,0.0004108134,0.00014826945,0.0004684724,0.00011295364,0.4570505,0.10449779,0.015152292,0.016259141,0.40474534],"study_design_scores_gemma":[0.000011540936,0.000027948505,0.0002401321,0.000015443524,0.00002456571,0.00032323628,0.0000076220285,0.9683497,0.021756746,0.0039302194,0.005286765,0.000026161088],"about_ca_topic_score_codex":0.0025633299,"about_ca_topic_score_gemma":0.0040197033,"teacher_disagreement_score":0.0050533507,"about_ca_system_score_codex":0.00038362516,"about_ca_system_score_gemma":0.00083673873,"threshold_uncertainty_score":0.016905129},"labels":[],"label_agreement":null},{"id":"W4411507092","doi":"10.1007/978-3-031-95841-0_78","title":"Using Word Embeddings to Extract Semantic Relations from Biomedical Texts: Towards Literature-Based Discovery","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"Dalhousie University; University of Ottawa","funders":"","keywords":"Computer science; Natural language processing; Word (group theory); Artificial intelligence; Information retrieval; Linguistics; Philosophy","score_opus":0.018760445088935696,"score_gpt":0.2938758378165231,"score_spread":0.2751153927275874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411507092","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.061255544,0.016800404,0.87520254,0.004037248,0.0014270265,0.0006908162,0.021215657,0.005973441,0.013397379],"genre_scores_gemma":[0.12488781,0.008951388,0.8271745,0.0005941773,0.00043052708,0.0005142328,0.032517456,0.0005002339,0.0044297203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980573,0.00045554823,0.00043967148,0.0004692542,0.00050247746,0.000075852484],"domain_scores_gemma":[0.99542326,0.0025979474,0.00052912196,0.00041473153,0.00088953396,0.00014543305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017166964,0.0013124745,0.0010486735,0.012066142,0.0008080255,0.0036325557,0.0010293723,0.0012489561,0.0028470194],"category_scores_gemma":[0.009175564,0.00055705354,0.0017326361,0.012337071,0.00081110926,0.00640981,0.0030345672,0.0014666065,0.0041080797],"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.00023850662,0.00040382237,0.0044819247,0.003123183,0.00038556618,0.0006996028,0.0015894735,0.0033925232,0.018439416,0.028290829,0.023565024,0.9153902],"study_design_scores_gemma":[0.0001827395,0.0004972119,0.012221025,0.0030584158,0.0015447449,0.003403122,0.005334867,0.22165889,0.036223218,0.39110765,0.32447377,0.00029443606],"about_ca_topic_score_codex":0.0013401812,"about_ca_topic_score_gemma":0.0026011458,"teacher_disagreement_score":0.012066142,"about_ca_system_score_codex":0.000629245,"about_ca_system_score_gemma":0.0020678914,"threshold_uncertainty_score":0.009524226},"labels":[],"label_agreement":null},{"id":"W4411509101","doi":"10.1007/978-981-96-8197-6_18","title":"The Use of Large Language Models to Cluster Genomic Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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 Windsor","funders":"","keywords":"Computer science; Cluster (spacecraft); Natural language processing; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.024406329382784992,"score_gpt":0.2802765917107655,"score_spread":0.25587026232798055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411509101","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.004076847,0.00040149735,0.99045676,0.00037386714,0.00010001191,0.00003796122,0.00048615897,0.0031810512,0.0008859652],"genre_scores_gemma":[0.11839544,0.00076820876,0.8681142,0.00046866955,0.00025132627,0.00032259544,0.004901321,0.0017516494,0.0050265947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810326,0.00096871075,0.00012661611,0.00037023902,0.00033518637,0.0000959869],"domain_scores_gemma":[0.9857019,0.011336409,0.00032660592,0.0015378855,0.0008975434,0.0001996342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041040513,0.0011354262,0.0010656259,0.0025749896,0.001236094,0.0028476447,0.0020909898,0.0010119351,0.0026418036],"category_scores_gemma":[0.014963861,0.0009919769,0.002694369,0.0033548416,0.0012747834,0.0038609384,0.002087433,0.0029220297,0.002225818],"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.00037160947,0.00029034496,0.0039056232,0.0003435587,0.0004996036,0.0005011951,0.000758507,0.2357528,0.005728524,0.08230804,0.03278212,0.636758],"study_design_scores_gemma":[0.000013942747,0.000017842742,0.0002674578,0.000017292077,0.000033132957,0.00005844019,0.00005148424,0.889345,0.0013665848,0.104753815,0.0040507987,0.000024134111],"about_ca_topic_score_codex":0.009305673,"about_ca_topic_score_gemma":0.013368282,"teacher_disagreement_score":0.009305673,"about_ca_system_score_codex":0.0013725961,"about_ca_system_score_gemma":0.0015919366,"threshold_uncertainty_score":0.021704555},"labels":[],"label_agreement":null},{"id":"W4411521341","doi":"10.1007/978-3-031-95838-0_26","title":"A Graph Neural Network Approach for Data-Driven Donor-Recipient Matching in Kidney Transplantation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Renal Transplantation Outcomes and Treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Transplantation; Artificial neural network; Matching (statistics); Graph; Kidney transplantation; Graph theory; Artificial intelligence; Theoretical computer science; Medicine; Surgery; Mathematics; Pathology; Combinatorics","score_opus":0.033207211725900534,"score_gpt":0.2942034520836419,"score_spread":0.2609962403577414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411521341","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.019105459,0.000976533,0.975348,0.0007489817,0.00018611332,0.00008185579,0.00046913433,0.0011561523,0.0019277835],"genre_scores_gemma":[0.6083741,0.00080926064,0.37491566,0.00057122594,0.00032788122,0.00022042979,0.0017116044,0.0003469796,0.012722764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961567,0.00011871486,0.00002162018,0.000121474244,0.00006812476,0.00005443706],"domain_scores_gemma":[0.9987192,0.0009409835,0.000052982818,0.00006668669,0.0001663447,0.00005380245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011829219,0.0007543223,0.0011666751,0.0009706634,0.00049848837,0.0009355244,0.002913915,0.0019631202,0.0034548696],"category_scores_gemma":[0.0030579083,0.0006680536,0.0008092595,0.0011603163,0.0004589293,0.0012314316,0.001400603,0.001728941,0.00069962547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108369306,0.00011221245,0.0009932892,0.000061582956,0.00008249249,0.00009352813,0.000029101158,0.80075806,0.00086888915,0.0057611917,0.005187083,0.18594417],"study_design_scores_gemma":[0.0000016303733,0.000004220386,0.000052894397,0.0000019244324,0.0000033749916,0.0000045311995,0.0000023182422,0.99726355,0.0000960199,0.002463419,0.00010450861,0.0000016466902],"about_ca_topic_score_codex":0.019234192,"about_ca_topic_score_gemma":0.023777852,"teacher_disagreement_score":0.019234192,"about_ca_system_score_codex":0.0011083996,"about_ca_system_score_gemma":0.0009849769,"threshold_uncertainty_score":0.038244426},"labels":[],"label_agreement":null},{"id":"W4411521362","doi":"10.1007/978-3-031-95838-0_29","title":"CUE-X: A Framework for the Automatic Evaluation of Clinical Usefulness of Explanations for the Multimorbidity Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Ottawa Hospital","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.14785089107381483,"score_gpt":0.4269790255840672,"score_spread":0.27912813451025237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411521362","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.015343045,0.0018760677,0.9108531,0.00081180607,0.00020575346,0.0009062602,0.009143643,0.05708089,0.0037794278],"genre_scores_gemma":[0.12762028,0.0004081674,0.8597222,0.00026502422,0.0001084402,0.0006948415,0.007597932,0.0011327079,0.0024502976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969091,0.0011214348,0.00029617967,0.0006067194,0.00088913954,0.00017745436],"domain_scores_gemma":[0.99018645,0.006974296,0.00063095754,0.00068946177,0.0011476096,0.00037134622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050890176,0.0018308965,0.0012127004,0.004823737,0.0007558859,0.0027160433,0.0026931637,0.0023873001,0.01678823],"category_scores_gemma":[0.021243673,0.00063176616,0.0014880678,0.0017496146,0.0007186835,0.0025726624,0.0031591766,0.0016212219,0.0034310566],"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.0019409326,0.0003831605,0.010355126,0.0014588912,0.00042575767,0.00046826553,0.0005923692,0.016335597,0.007564767,0.024187015,0.06996406,0.8663241],"study_design_scores_gemma":[0.00054487056,0.00051412213,0.010167902,0.0005591275,0.00035132782,0.0008725784,0.00054734753,0.80857134,0.0271329,0.09339666,0.05713906,0.00020283365],"about_ca_topic_score_codex":0.007225036,"about_ca_topic_score_gemma":0.011465251,"teacher_disagreement_score":0.01678823,"about_ca_system_score_codex":0.001010891,"about_ca_system_score_gemma":0.0023068904,"threshold_uncertainty_score":0.05616218},"labels":[],"label_agreement":null},{"id":"W4411521363","doi":"10.1007/978-3-031-95838-0_30","title":"Elucidating Mechanics of T-cell Signaling: Modelling Surface Receptor Pathways Using Artificial Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cell Adhesion Molecules Research","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Neural cell; Artificial intelligence; Neuroscience; Cell; Chemistry; Biology","score_opus":0.056291339699230364,"score_gpt":0.2849281925915328,"score_spread":0.22863685289230243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411521363","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.16347143,0.004112843,0.78292197,0.0014166415,0.00035124313,0.000057522615,0.00038968268,0.0004478514,0.046830922],"genre_scores_gemma":[0.87421566,0.0037092804,0.095812425,0.00019922524,0.00013895595,0.00012979569,0.00019475984,0.0001322396,0.025467692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999614,0.000008285601,0.0000021883002,0.000009081141,0.000012026152,0.0000070967426],"domain_scores_gemma":[0.99985814,0.000100106394,0.0000138813675,0.0000062414288,0.00001363503,0.000008097517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014695596,0.0004485456,0.00045804842,0.00020981427,0.00026497754,0.0007135519,0.0009292955,0.0011252124,0.0024561887],"category_scores_gemma":[0.0005348537,0.00042348553,0.00047097166,0.00037835556,0.00046414512,0.0008537853,0.00033902648,0.00073844014,0.00039282723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011047474,0.000009267645,0.00010092687,0.000028142082,0.000007788459,0.000025935073,0.000012095324,0.9859071,0.002047306,0.007396721,0.00024659414,0.0042069736],"study_design_scores_gemma":[0.0000011153782,0.0000017685849,0.000031536416,0.0000012979546,0.0000012348113,0.0000044656076,0.000001826533,0.9969862,0.0001903962,0.0025718221,0.00020662561,0.0000016268527],"about_ca_topic_score_codex":0.0036884416,"about_ca_topic_score_gemma":0.0037591492,"teacher_disagreement_score":0.0036884416,"about_ca_system_score_codex":0.00044331863,"about_ca_system_score_gemma":0.00048489714,"threshold_uncertainty_score":0.008216739},"labels":[],"label_agreement":null},{"id":"W4411521391","doi":"10.1007/978-3-031-95838-0_32","title":"A Reinforcement Learning Framework for Optimizing Kidney Allocation for Transplant Based on Survival and Ethical Criteria","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Organ Donation and Transplantation","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Reinforcement learning; Kidney transplant; Artificial intelligence; Kidney transplantation; Transplantation; Medicine; Internal medicine","score_opus":0.023792479063935324,"score_gpt":0.30970280898287644,"score_spread":0.2859103299189411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411521391","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.019912535,0.0005058668,0.97220784,0.0006231277,0.00010954994,0.000098605145,0.00011905514,0.00039080778,0.00603263],"genre_scores_gemma":[0.77533984,0.000414842,0.21015467,0.00042194748,0.0001712354,0.00037429956,0.00022989564,0.00013070095,0.012762527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934775,0.00027694684,0.000022395852,0.00012906939,0.0000997331,0.00012413143],"domain_scores_gemma":[0.9985884,0.0009687805,0.00009820888,0.000034270633,0.00020177885,0.00010857222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019494838,0.0009673577,0.0017927507,0.0004848186,0.00046408476,0.0011849435,0.002172357,0.0018520436,0.0057579856],"category_scores_gemma":[0.0027142316,0.0005421173,0.0006283086,0.0005236252,0.0010015587,0.00086505484,0.0012719817,0.0017352096,0.00051476056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057383935,0.000054764805,0.00030187506,0.000030724404,0.000028383685,0.000040787232,0.000024679983,0.96750635,0.00025593452,0.008654353,0.0012297805,0.021814855],"study_design_scores_gemma":[0.000011300894,0.000013721762,0.0000415135,0.0000037155883,0.0000046263513,0.000004966154,0.0000029042114,0.996567,0.000041269195,0.0031672807,0.0001387404,0.0000029062396],"about_ca_topic_score_codex":0.012460134,"about_ca_topic_score_gemma":0.011037801,"teacher_disagreement_score":0.012460134,"about_ca_system_score_codex":0.0016630208,"about_ca_system_score_gemma":0.0020682772,"threshold_uncertainty_score":0.024775207},"labels":[],"label_agreement":null},{"id":"W4411522960","doi":"10.1007/978-981-96-8728-2_10","title":"CAG: A Constraint-Driven Adversarial Traffic Generation Scheme Based on Feature Correlations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Scheme (mathematics); Adversarial system; Feature (linguistics); Artificial intelligence; Algorithm; Theoretical computer science; Mathematics","score_opus":0.015600356446619357,"score_gpt":0.25229138256706257,"score_spread":0.2366910261204432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411522960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041962354,0.00006790909,0.9926392,0.000103743725,0.000076677985,0.00007682848,0.00008428974,0.0011490615,0.0016061348],"genre_scores_gemma":[0.47328362,0.00018879825,0.51637673,0.0003472889,0.00012179715,0.00033146693,0.0006276128,0.00047278494,0.008249858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999416,0.00015377818,0.000020469779,0.00010869785,0.00023348269,0.000067509354],"domain_scores_gemma":[0.9991198,0.00032346757,0.000070154325,0.00022864142,0.0001821031,0.00007585723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010338249,0.00092165265,0.0010583154,0.00053813896,0.00050706277,0.00074974005,0.0020171576,0.0013696267,0.0041682767],"category_scores_gemma":[0.002388534,0.000399808,0.0006249299,0.0007106419,0.00085889775,0.001112309,0.00220073,0.002271585,0.001140651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025144403,0.000086061285,0.00021070174,0.00006028709,0.000050463008,0.00009658383,0.000032766366,0.80836016,0.012765296,0.043975223,0.010436373,0.12367457],"study_design_scores_gemma":[0.000007423023,0.00002243563,0.000016859094,0.0000022118031,0.0000024804967,0.000017744826,0.0000010815972,0.9937364,0.0009987722,0.004609366,0.00058045634,0.000004764555],"about_ca_topic_score_codex":0.0019729421,"about_ca_topic_score_gemma":0.0018695643,"teacher_disagreement_score":0.0041682767,"about_ca_system_score_codex":0.0006895984,"about_ca_system_score_gemma":0.0012354336,"threshold_uncertainty_score":0.013944268},"labels":[],"label_agreement":null},{"id":"W4411534915","doi":"10.1007/978-3-031-96590-6_19","title":"Diffusion-Based Adversarial Purification for Intrusion Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Adversarial system; Intrusion detection system; Diffusion; Intrusion; Artificial intelligence; Computer security; Geology; Geochemistry","score_opus":0.010590973510448758,"score_gpt":0.24923831141652497,"score_spread":0.2386473379060762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411534915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018861213,0.00033307707,0.99604225,0.00009971911,0.000047592042,0.000018954455,0.000023380418,0.0004047427,0.0011441874],"genre_scores_gemma":[0.49607164,0.0020471169,0.47475246,0.00043066384,0.00024364995,0.00020154938,0.0003850744,0.0005058053,0.025362087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999132,0.00023084176,0.0000378937,0.00018120879,0.00033683062,0.000081302765],"domain_scores_gemma":[0.9980369,0.0011861438,0.000106329455,0.00035291185,0.00026776383,0.000049811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011809045,0.0011709783,0.0013545087,0.00072229485,0.00044866872,0.0009026892,0.0013834481,0.001170292,0.0030649956],"category_scores_gemma":[0.004071145,0.00059497164,0.0008323062,0.00085541763,0.00117425,0.0019337954,0.002620572,0.0028354093,0.0011706065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015714014,0.00009120943,0.00039152987,0.00020080653,0.00010964836,0.00009134471,0.000094803014,0.5957819,0.019739652,0.083195366,0.00759662,0.29254997],"study_design_scores_gemma":[0.0000026626867,0.000016949789,0.000056591565,0.0000061900228,0.0000062916283,0.000044189797,0.0000031494687,0.9796236,0.0030570612,0.016108176,0.001067245,0.0000079835245],"about_ca_topic_score_codex":0.0010428498,"about_ca_topic_score_gemma":0.0010462243,"teacher_disagreement_score":0.0030649956,"about_ca_system_score_codex":0.0008475318,"about_ca_system_score_gemma":0.0006113957,"threshold_uncertainty_score":0.010253429},"labels":[],"label_agreement":null},{"id":"W4411534996","doi":"10.1007/978-3-031-96590-6_4","title":"Operating Under Constraints: Identifying Requirements for Enhanced Cyber Resilience Management","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Polytechnique Montréal","funders":"","keywords":"Resilience (materials science); Computer science; Computer security","score_opus":0.03145355182758525,"score_gpt":0.31399095957602985,"score_spread":0.2825374077484446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411534996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18865964,0.0002911009,0.7626227,0.001288575,0.0001388654,0.0005172317,0.0007412193,0.0011705942,0.04457013],"genre_scores_gemma":[0.92044204,0.0001487401,0.07571772,0.000086718064,0.00003945688,0.00017776956,0.00035994197,0.00019620013,0.0028313238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9981857,0.00030461364,0.00010394731,0.00028262092,0.00066870183,0.00045427485],"domain_scores_gemma":[0.99087065,0.0046611372,0.0016068337,0.0011156087,0.0012434619,0.0005022895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016838097,0.0009670463,0.00075113203,0.0008843561,0.0006170307,0.0027919288,0.0018765265,0.0010868991,0.0069065983],"category_scores_gemma":[0.013491394,0.0004452492,0.0005727406,0.00085325015,0.0014585659,0.0054411325,0.002125849,0.0014944394,0.0006754781],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050307607,0.00026289898,0.0065890057,0.00063756737,0.00007206929,0.0010018855,0.000574512,0.64245,0.02517624,0.21840152,0.0059377756,0.09839352],"study_design_scores_gemma":[0.000017775586,0.00013456284,0.002379837,0.000078067125,0.000030084038,0.0002765063,0.0005414766,0.89440334,0.008129379,0.09002529,0.0039451234,0.000038432965],"about_ca_topic_score_codex":0.002591561,"about_ca_topic_score_gemma":0.002899319,"teacher_disagreement_score":0.0069065983,"about_ca_system_score_codex":0.0009145409,"about_ca_system_score_gemma":0.0018059983,"threshold_uncertainty_score":0.023104846},"labels":[],"label_agreement":null},{"id":"W4411555752","doi":"10.1007/978-981-96-6588-4_8","title":"Adaptive Constrained ICABMGGMM: Application to ECG Blind Source Separation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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":"Algoma University; Concordia University","funders":"","keywords":"Blind signal separation; Computer science; Source separation; Speech recognition; Artificial intelligence; Algorithm; Telecommunications","score_opus":0.016340657321123945,"score_gpt":0.28553435390618115,"score_spread":0.2691936965850572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411555752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023994618,0.00042141796,0.99199134,0.000099310804,0.000110406334,0.000033624798,0.00013079082,0.0018030372,0.0030106355],"genre_scores_gemma":[0.032849293,0.00077684666,0.95234334,0.00012428645,0.00014877722,0.00008124518,0.0002022558,0.00041990448,0.013053984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998839,0.000026026672,0.0000053275658,0.000022228527,0.000054273325,0.000008227435],"domain_scores_gemma":[0.9997718,0.000120422854,0.000010045843,0.000028501749,0.00005902507,0.000010348365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003086107,0.00066780724,0.00041655404,0.0004317037,0.00018946253,0.0005852347,0.00068273937,0.0010456747,0.009466807],"category_scores_gemma":[0.0009281222,0.00023533992,0.00036143343,0.0010142346,0.00021749796,0.00034150336,0.0008207376,0.0006842851,0.003793414],"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.00021919157,0.0000791493,0.00026771676,0.0002367333,0.000042673015,0.00024596706,0.000082146995,0.043449316,0.09315175,0.0100005735,0.017308949,0.8349158],"study_design_scores_gemma":[0.000042220774,0.000101189406,0.001048416,0.000041693405,0.000028818464,0.00074253243,0.000027657099,0.9006499,0.04872147,0.008295866,0.040258076,0.00004219948],"about_ca_topic_score_codex":0.0014868142,"about_ca_topic_score_gemma":0.0023608115,"teacher_disagreement_score":0.009466807,"about_ca_system_score_codex":0.00016416573,"about_ca_system_score_gemma":0.00034083612,"threshold_uncertainty_score":0.031669617},"labels":[],"label_agreement":null},{"id":"W4411565097","doi":"10.1007/978-981-96-6579-2_24","title":"Data Augmentation with Variational Autoencoder for Imbalanced Dataset","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Autoencoder; Computer science; Artificial intelligence; Machine learning; Pattern recognition (psychology); Data mining; Artificial neural network","score_opus":0.03483581431491785,"score_gpt":0.30480724813344284,"score_spread":0.269971433818525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411565097","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.0075847837,0.0005660453,0.9898582,0.00020925979,0.000119223645,0.000037510843,0.00016813085,0.0007336338,0.0007232649],"genre_scores_gemma":[0.2813106,0.0008888785,0.70522326,0.00041668146,0.000271265,0.00029650735,0.0024517865,0.00048092796,0.008660113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993455,0.00016720299,0.00004119352,0.00019506089,0.00017748475,0.000073553],"domain_scores_gemma":[0.99868435,0.0006276077,0.00007797575,0.00029995618,0.0002631985,0.000046876532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133979,0.0009672237,0.0012696214,0.00061669055,0.00045183432,0.0009505248,0.0015891311,0.0012167669,0.0024516177],"category_scores_gemma":[0.0041296477,0.0006241439,0.0011213522,0.0010259149,0.00059515063,0.0017289525,0.0021619,0.0024759832,0.0010545392],"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.00026195237,0.00018056357,0.0016890552,0.0002106004,0.00013964465,0.00010499786,0.0001449479,0.3508139,0.014693575,0.016103331,0.013747531,0.60190994],"study_design_scores_gemma":[0.0000032343735,0.000013558882,0.000109719906,0.0000061535634,0.000007728345,0.000017286296,0.000006192483,0.9946516,0.0013058216,0.003044603,0.00083092926,0.0000032549137],"about_ca_topic_score_codex":0.0047950055,"about_ca_topic_score_gemma":0.006986367,"teacher_disagreement_score":0.0047950055,"about_ca_system_score_codex":0.00070844806,"about_ca_system_score_gemma":0.0010315473,"threshold_uncertainty_score":0.011285722},"labels":[],"label_agreement":null},{"id":"W4411708075","doi":"10.1007/978-3-031-96962-1_14","title":"Dynamic Parking Space Allocation for Real-Time Urban Management","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Parking Systems Research","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Space (punctuation); Parking space; Real-time computing; Transport engineering; Operating system","score_opus":0.009985462758576515,"score_gpt":0.25018281382012825,"score_spread":0.24019735106155174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411708075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05366447,0.0016509896,0.9203601,0.0002600366,0.00022807495,0.000064857944,0.00021374288,0.0016239757,0.021933753],"genre_scores_gemma":[0.93468183,0.00047352843,0.052795634,0.00004937626,0.000065138884,0.00004192887,0.00014976008,0.00008744888,0.011655305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998746,0.000026026653,0.0000046193877,0.000029978299,0.000029432553,0.000035282064],"domain_scores_gemma":[0.99992704,0.000022632066,0.000006999743,0.000011086347,0.00001953324,0.00001260467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017997668,0.00042269015,0.0005817855,0.0002867822,0.0002641074,0.0006327034,0.00094305293,0.00032902564,0.008369512],"category_scores_gemma":[0.00028248673,0.00017037363,0.00026396313,0.00058693934,0.0002125843,0.00069714925,0.0005536437,0.0003788979,0.000990615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031162685,0.0001315202,0.0005147093,0.0001454515,0.00004422925,0.000085021,0.00007229973,0.59242886,0.015956406,0.015637562,0.011047036,0.36362523],"study_design_scores_gemma":[0.00001230673,0.000082994535,0.0004137516,0.000006760944,0.000012925737,0.000081767066,0.000042020853,0.98536855,0.0019214218,0.0064339475,0.005612966,0.000010589536],"about_ca_topic_score_codex":0.0014725015,"about_ca_topic_score_gemma":0.0024453087,"teacher_disagreement_score":0.008369512,"about_ca_system_score_codex":0.00040460512,"about_ca_system_score_gemma":0.00041542112,"threshold_uncertainty_score":0.027998805},"labels":[],"label_agreement":null},{"id":"W4411745362","doi":"10.1007/978-3-031-95976-9_10","title":"Acquiring and Selecting Implied Constraints with an Application to the BinSeq and Partition Global Constraints","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Partition (number theory); Operations research; Mathematics; Combinatorics","score_opus":0.009250595105475018,"score_gpt":0.24457206056063055,"score_spread":0.23532146545515553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042245374,0.000089606976,0.9915176,0.00016896045,0.000036958052,0.00012310718,0.000315663,0.00083078374,0.0026927406],"genre_scores_gemma":[0.020289507,0.000097881115,0.9766975,0.00006748372,0.000028364859,0.00008056497,0.0005712274,0.00035382286,0.001813592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763894,0.0006097818,0.00017692671,0.00043599136,0.00096787326,0.00017044629],"domain_scores_gemma":[0.9947777,0.0034512242,0.00014881288,0.00069747365,0.00079138385,0.00013346193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033812677,0.0011963972,0.0017469408,0.002944663,0.0013476966,0.0029062375,0.0032711863,0.0013720453,0.022065455],"category_scores_gemma":[0.015404231,0.001348237,0.002177069,0.004811001,0.0016955207,0.005570601,0.0045672,0.004271602,0.0027239074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003041977,0.00020367734,0.0015429902,0.00053700636,0.00007931305,0.0004252835,0.0006053522,0.056843244,0.007720538,0.23284104,0.01733746,0.68156004],"study_design_scores_gemma":[0.00008256078,0.00008679551,0.0008100195,0.00013908773,0.00008754811,0.00030898658,0.00039175362,0.5805997,0.010982414,0.37666774,0.029757427,0.000085974316],"about_ca_topic_score_codex":0.0057588755,"about_ca_topic_score_gemma":0.009991987,"teacher_disagreement_score":0.022065455,"about_ca_system_score_codex":0.00096444925,"about_ca_system_score_gemma":0.0019579495,"threshold_uncertainty_score":0.0738163},"labels":[],"label_agreement":null},{"id":"W4411745406","doi":"10.1007/978-3-031-95976-9_9","title":"Reinforcement Learning-Based Heuristics to Guide Domain-Independent Dynamic Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"The King's University; Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Reinforcement learning; Heuristics; Domain (mathematical analysis); Artificial intelligence; Dynamic programming; Machine learning; Algorithm; Operating system; Mathematics","score_opus":0.009434525304242686,"score_gpt":0.2577204471215944,"score_spread":0.24828592181735173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006435506,0.00018384584,0.9874263,0.000096991906,0.000045808436,0.00006026386,0.000036630954,0.0006092026,0.005105451],"genre_scores_gemma":[0.4046748,0.00033496864,0.5883189,0.00017919684,0.00005659522,0.0003260112,0.00019970376,0.00041209316,0.0054977806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996778,0.00011225826,0.000017877992,0.000071337316,0.00007107798,0.000049738916],"domain_scores_gemma":[0.998398,0.0011593453,0.000081208804,0.00011492277,0.00016636655,0.00008020118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092952093,0.0011045339,0.0011020703,0.0006993745,0.00047276204,0.0010118026,0.0015780553,0.0010211855,0.0057824776],"category_scores_gemma":[0.004490439,0.00068579585,0.00061524607,0.00065478176,0.00093184673,0.0011853069,0.0014797935,0.0021178608,0.000957662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008268053,0.00008783085,0.0002681454,0.00009151831,0.000028814684,0.00005081471,0.00008832467,0.83776754,0.0014803833,0.042748023,0.0036055886,0.11370035],"study_design_scores_gemma":[0.000016259275,0.000014985576,0.000027700378,0.000012515676,0.0000042852334,0.0000070865335,0.000006724551,0.9847809,0.00035912756,0.01402602,0.00073975965,0.0000046141545],"about_ca_topic_score_codex":0.0038003654,"about_ca_topic_score_gemma":0.0065243286,"teacher_disagreement_score":0.0057824776,"about_ca_system_score_codex":0.0009921427,"about_ca_system_score_gemma":0.0014069331,"threshold_uncertainty_score":0.01934433},"labels":[],"label_agreement":null},{"id":"W4411745413","doi":"10.1007/978-3-031-95976-9_16","title":"Shaping Reward Signals in Reinforcement Learning Using Constraint Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Constraint (computer-aided design); Artificial intelligence; Constraint programming; Reinforcement; Constraint satisfaction; Mathematical optimization; Psychology; Mathematics; Stochastic programming","score_opus":0.03778212600561777,"score_gpt":0.28212690686802855,"score_spread":0.2443447808624108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036160958,0.00044487006,0.98597103,0.00015228939,0.00003962328,0.000030515039,0.000025220219,0.00016151048,0.0095588],"genre_scores_gemma":[0.41142344,0.0014179512,0.5685252,0.0002580405,0.00010541745,0.00038966836,0.00012476227,0.0003480548,0.017407535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.00021653461,0.000023753191,0.00009041669,0.0001558925,0.00004816166],"domain_scores_gemma":[0.9982498,0.0014192975,0.000078677884,0.00008096571,0.00012597823,0.000045189696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291021,0.0008422514,0.00084931,0.0002900237,0.00034811642,0.0012423812,0.0015083216,0.0010667909,0.0055932445],"category_scores_gemma":[0.00378371,0.00060507143,0.00053706364,0.0009044748,0.0014920074,0.0013478255,0.0011122131,0.0027369459,0.000651271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000721411,0.000051238017,0.0001194995,0.00017006524,0.000032885062,0.000047577334,0.00006411762,0.7418224,0.002078838,0.15364577,0.002582769,0.0993127],"study_design_scores_gemma":[0.000010752304,0.000016544129,0.000029312376,0.00001733542,0.000005440295,0.000010774569,0.0000057668262,0.94321597,0.0007287978,0.05421097,0.0017399932,0.000008443227],"about_ca_topic_score_codex":0.0034899802,"about_ca_topic_score_gemma":0.003306476,"teacher_disagreement_score":0.0055932445,"about_ca_system_score_codex":0.0011021243,"about_ca_system_score_gemma":0.00090957107,"threshold_uncertainty_score":0.018711269},"labels":[],"label_agreement":null},{"id":"W4411745417","doi":"10.1007/978-3-031-95976-9","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Uppsala Universitet; Université de Montréal; Université de Fribourg; Technische Universiteit Delft; Centre National de la Recherche Scientifique; University of Toronto","keywords":"Computer science; Constraint programming; Constraint satisfaction; Constraint (computer-aided design); Artificial intelligence; Programming language; Operations research; Mathematical optimization; Stochastic programming; Engineering","score_opus":0.054452086918164944,"score_gpt":0.33744593228945874,"score_spread":0.2829938453712938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745417","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021010689,0.06913478,0.74440163,0.008676426,0.0013401182,0.00015639697,0.00045072773,0.00055456115,0.1731842],"genre_scores_gemma":[0.061657693,0.08990356,0.8104833,0.0017180286,0.0026832963,0.00034800684,0.0010854966,0.00041542348,0.031705216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967348,0.0009793651,0.0002492772,0.00029083344,0.0016293265,0.00011628862],"domain_scores_gemma":[0.99226964,0.005637317,0.00028640014,0.0007012018,0.0008829451,0.0002224946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031769972,0.0015195735,0.0022418364,0.0046548494,0.00074917474,0.0065068156,0.0021381471,0.001123899,0.013932986],"category_scores_gemma":[0.0069809104,0.00088887307,0.001212876,0.013927451,0.0030120558,0.0073483093,0.0025621902,0.0044265348,0.002533654],"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.00002700952,0.00008316036,0.00030393264,0.0009794487,0.00011458042,0.00009014851,0.00008553129,0.009194437,0.0005259532,0.62856674,0.026009997,0.33401895],"study_design_scores_gemma":[0.000012024002,0.000028556906,0.0003868091,0.00043415936,0.00004496044,0.00015777054,0.00010271271,0.03162401,0.00054522895,0.8495587,0.11707364,0.000031379663],"about_ca_topic_score_codex":0.004947577,"about_ca_topic_score_gemma":0.008473854,"teacher_disagreement_score":0.013932986,"about_ca_system_score_codex":0.0020680763,"about_ca_system_score_gemma":0.0043206965,"threshold_uncertainty_score":0.046610415},"labels":[],"label_agreement":null},{"id":"W4411745429","doi":"10.1007/978-3-031-95976-9_7","title":"A Column Generation Heuristic for Multi-depot Electric Bus Scheduling","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electric Vehicles and Infrastructure","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":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Computer science; Column generation; Scheduling (production processes); Depot; Heuristic; Mathematical optimization; Operations research; Artificial intelligence; Mathematics","score_opus":0.015499451263766931,"score_gpt":0.2327512885478724,"score_spread":0.21725183728410546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078866586,0.0014932835,0.89153767,0.0005747551,0.0005608857,0.00054117583,0.0009588972,0.002743319,0.022723438],"genre_scores_gemma":[0.48696443,0.0005924055,0.49782446,0.00035907349,0.00015392675,0.00041282427,0.0010603712,0.00041282902,0.0122196665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966323,0.00011466287,0.000010575693,0.00004679253,0.00007880026,0.00008597136],"domain_scores_gemma":[0.9994992,0.00027322682,0.000040420477,0.000038964856,0.00009286709,0.000055405475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051764905,0.0011027298,0.0013703738,0.0008986117,0.00068628165,0.0009156731,0.0014882847,0.0009744805,0.008256719],"category_scores_gemma":[0.00084672903,0.0007650513,0.00069412217,0.0016902585,0.00045963112,0.00070803496,0.0007335638,0.0008965378,0.0008745847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018784808,0.00018519186,0.00017901373,0.00013763538,0.000039972172,0.00010517935,0.00003240004,0.89616,0.003202747,0.003016005,0.0072831917,0.08947075],"study_design_scores_gemma":[0.000047790578,0.00007140428,0.00012286232,0.000008835177,0.000014398217,0.00001729047,0.000011132087,0.99640816,0.0006957979,0.0015492473,0.001043194,0.0000098325245],"about_ca_topic_score_codex":0.010947339,"about_ca_topic_score_gemma":0.012535332,"teacher_disagreement_score":0.010947339,"about_ca_system_score_codex":0.0011177879,"about_ca_system_score_gemma":0.001455756,"threshold_uncertainty_score":0.027621508},"labels":[],"label_agreement":null},{"id":"W4411745897","doi":"10.1007/978-3-031-95973-8_15","title":"Bounded-Error Policy Optimization for Mixed Discrete-Continuous MDPs via Constraint Generation in Nonlinear Programming","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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 Toronto","funders":"","keywords":"Computer science; Bounded function; Nonlinear programming; Constraint (computer-aided design); Mathematical optimization; Nonlinear system; Constraint satisfaction; Mathematics; Artificial intelligence","score_opus":0.04396380494695325,"score_gpt":0.3500265044534952,"score_spread":0.30606269950654197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005131536,0.0004677357,0.987743,0.0002798555,0.000056796645,0.000053111424,0.000048563605,0.00011831794,0.00610116],"genre_scores_gemma":[0.583303,0.00094515254,0.40027583,0.00034713847,0.0001841613,0.0006760642,0.00022670068,0.00029927428,0.013742744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900097,0.00045992265,0.000044026958,0.00014618493,0.00024747354,0.000101368234],"domain_scores_gemma":[0.9931636,0.0060619195,0.00025220748,0.00016645368,0.00024565,0.00011026307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024782196,0.0015224346,0.002029311,0.0006590415,0.00053696765,0.002034396,0.0016977878,0.002375163,0.0048089284],"category_scores_gemma":[0.009153248,0.0012620155,0.0010857919,0.001110168,0.0017142467,0.0020279363,0.0031291158,0.0034010152,0.00055441307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032565444,0.000025955638,0.00006988055,0.00008216636,0.000020087171,0.000032948345,0.000030920477,0.9631394,0.00023372531,0.024700215,0.0006647261,0.010967447],"study_design_scores_gemma":[0.0000040171685,0.000006263145,0.000008968546,0.0000064121355,0.0000016758511,0.0000033825852,0.000002162954,0.9936452,0.000055556084,0.006135223,0.00012924719,0.000001922278],"about_ca_topic_score_codex":0.0050749737,"about_ca_topic_score_gemma":0.0039908164,"teacher_disagreement_score":0.0050749737,"about_ca_system_score_codex":0.0017666714,"about_ca_system_score_gemma":0.001618109,"threshold_uncertainty_score":0.016087472},"labels":[],"label_agreement":null},{"id":"W4411745903","doi":"10.1007/978-3-031-95973-8","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Uppsala Universitet; Université de Montréal; Université de Fribourg; Technische Universiteit Delft; Centre National de la Recherche Scientifique; University of Toronto","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Artificial intelligence; Constraint satisfaction; Operations research; Mathematical optimization; Stochastic programming","score_opus":0.054452086918164944,"score_gpt":0.33744593228945874,"score_spread":0.2829938453712938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745903","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021010689,0.06913478,0.74440163,0.008676426,0.0013401182,0.00015639697,0.00045072773,0.00055456115,0.1731842],"genre_scores_gemma":[0.061657693,0.08990356,0.8104833,0.0017180286,0.0026832963,0.00034800684,0.0010854966,0.00041542348,0.031705216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967348,0.0009793651,0.0002492772,0.00029083344,0.0016293265,0.00011628862],"domain_scores_gemma":[0.99226964,0.005637317,0.00028640014,0.0007012018,0.0008829451,0.0002224946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031769972,0.0015195735,0.0022418364,0.0046548494,0.00074917474,0.0065068156,0.0021381471,0.001123899,0.013932986],"category_scores_gemma":[0.0069809104,0.00088887307,0.001212876,0.013927451,0.0030120558,0.0073483093,0.0025621902,0.0044265348,0.002533654],"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.00002700952,0.00008316036,0.00030393264,0.0009794487,0.00011458042,0.00009014851,0.00008553129,0.009194437,0.0005259532,0.62856674,0.026009997,0.33401895],"study_design_scores_gemma":[0.000012024002,0.000028556906,0.0003868091,0.00043415936,0.00004496044,0.00015777054,0.00010271271,0.03162401,0.00054522895,0.8495587,0.11707364,0.000031379663],"about_ca_topic_score_codex":0.004947577,"about_ca_topic_score_gemma":0.008473854,"teacher_disagreement_score":0.013932986,"about_ca_system_score_codex":0.0020680763,"about_ca_system_score_gemma":0.0043206965,"threshold_uncertainty_score":0.046610415},"labels":[],"label_agreement":null},{"id":"W4411772012","doi":"10.1007/978-3-031-97548-6_8","title":"Words Avoiding Half-Flips","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.013169856159038025,"score_gpt":0.23666817123818085,"score_spread":0.22349831507914283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772012","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.17136402,0.0015660275,0.27655056,0.0014840297,0.0019025792,0.00023518791,0.0010021261,0.001781769,0.5441137],"genre_scores_gemma":[0.6246322,0.0014000203,0.060183417,0.00090971316,0.0004664621,0.00037314015,0.0012524254,0.0015564271,0.3092263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995328,0.000083354214,0.00003989939,0.00010173394,0.000108660184,0.00013347038],"domain_scores_gemma":[0.99900633,0.00033775013,0.000062664716,0.00024327033,0.00025742344,0.00009250722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034579955,0.000706201,0.00079846586,0.0009568125,0.0018772259,0.0023969188,0.0008053696,0.0013028509,0.02928344],"category_scores_gemma":[0.002174816,0.00057837943,0.0007254895,0.00086345355,0.00179621,0.004464718,0.0022265553,0.0017158892,0.010501694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104281266,0.000019543668,0.00009109306,0.00010860923,0.000008170355,0.00021714898,0.00038619412,0.00065126707,0.0039453343,0.94114566,0.0081213685,0.045201454],"study_design_scores_gemma":[0.000012835205,0.000025524076,0.00006585788,0.000038811966,0.00001022859,0.00023592733,0.00018970731,0.0014853402,0.003065275,0.9645925,0.030264905,0.000012988212],"about_ca_topic_score_codex":0.0002182479,"about_ca_topic_score_gemma":0.00029941017,"teacher_disagreement_score":0.02928344,"about_ca_system_score_codex":0.00043889662,"about_ca_system_score_gemma":0.0004782357,"threshold_uncertainty_score":0.09796286},"labels":[],"label_agreement":null},{"id":"W4411772245","doi":"10.1007/978-3-031-97548-6_4","title":"Maximal 2-Dimensional Binary Words of Bounded Degree","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Montreal Police Service; Université du Québec à Montréal","funders":"","keywords":"Degree (music); Computer science; Bounded function; Binary number; Algorithm; Arithmetic; Mathematics; Mathematical analysis; Physics","score_opus":0.017779266767959392,"score_gpt":0.2397637187666649,"score_spread":0.22198445199870553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772245","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.53111714,0.003503364,0.12726483,0.002120605,0.00069664605,0.00011763147,0.002449095,0.00082613423,0.3319045],"genre_scores_gemma":[0.8911091,0.0010005176,0.022057353,0.00036598547,0.0002568224,0.00014707842,0.0012985284,0.0002289357,0.0835356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967015,0.000061801155,0.000024885912,0.00006874675,0.00006917508,0.00010526566],"domain_scores_gemma":[0.99942374,0.00030940463,0.000051416486,0.000053016352,0.000068381465,0.00009405025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020858277,0.00066946883,0.0006755862,0.0009089724,0.0012031811,0.0022914982,0.0006256859,0.00082000165,0.012260582],"category_scores_gemma":[0.0010356412,0.0005911782,0.000435691,0.0009433859,0.0011279178,0.0029607252,0.0021028975,0.0012037473,0.0026006745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019255916,0.000028851511,0.0002247675,0.00017991177,0.000009621011,0.00024863693,0.0005922597,0.0013038005,0.01018334,0.96911687,0.005279745,0.012639496],"study_design_scores_gemma":[0.000032166015,0.000035832047,0.00061671674,0.000051692416,0.000013700222,0.00045573237,0.00028085348,0.0037718883,0.007496132,0.9633013,0.023915391,0.000028486915],"about_ca_topic_score_codex":0.0003167366,"about_ca_topic_score_gemma":0.00047605028,"teacher_disagreement_score":0.012260582,"about_ca_system_score_codex":0.00059674156,"about_ca_system_score_gemma":0.00028788863,"threshold_uncertainty_score":0.041015744},"labels":[],"label_agreement":null},{"id":"W4411772246","doi":"10.1007/978-3-031-97548-6_2","title":"A Characterization of Algebraic Multivariate Power Series with Sparse Support","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Series (stratigraphy); Multivariate statistics; Characterization (materials science); Algebraic number; Power series; Algebra over a field; Algorithm; Mathematics; Machine learning; Pure mathematics","score_opus":0.017779472226854897,"score_gpt":0.2647086730652366,"score_spread":0.2469292008383817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772246","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.45844233,0.0013297669,0.29848957,0.0031803616,0.000496678,0.0000845209,0.00072776433,0.00048797828,0.236761],"genre_scores_gemma":[0.94838184,0.0007143893,0.016274443,0.0002936581,0.0010802774,0.000047396272,0.00043033785,0.00013099266,0.03264667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965274,0.000058274083,0.00001476045,0.00006851765,0.00015504168,0.00005069975],"domain_scores_gemma":[0.99801195,0.0010433326,0.00026796863,0.00015955059,0.0002647265,0.000252513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039758097,0.00062402023,0.0005780066,0.0020065755,0.0006542874,0.0020774305,0.00075955625,0.0005678128,0.008644746],"category_scores_gemma":[0.0043143723,0.00032364685,0.00043016102,0.0020258566,0.0016203922,0.0035737404,0.00165412,0.0024121488,0.0010551171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048056554,0.000028678314,0.00041624103,0.0000471857,0.000008466121,0.00014949306,0.00017322738,0.0013069723,0.0030792367,0.9724186,0.0026995502,0.019624196],"study_design_scores_gemma":[0.000013356754,0.0000383695,0.00064083876,0.000017387893,0.0000100201505,0.00058579666,0.0000956015,0.015958883,0.0010018353,0.9732082,0.008413318,0.000016323374],"about_ca_topic_score_codex":0.00026573704,"about_ca_topic_score_gemma":0.00024900498,"teacher_disagreement_score":0.008644746,"about_ca_system_score_codex":0.00063314714,"about_ca_system_score_gemma":0.00026085012,"threshold_uncertainty_score":0.028919578},"labels":[],"label_agreement":null},{"id":"W4411772259","doi":"10.1007/978-3-031-97548-6_18","title":"Purely Automatic Sequences with the Uniform Distribution Property","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Winnipeg","funders":"","keywords":"Computer science; Property (philosophy); Distribution (mathematics); Theoretical computer science; Mathematics; Mathematical analysis","score_opus":0.009956550483565524,"score_gpt":0.21527595654168058,"score_spread":0.20531940605811505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11498738,0.0014213421,0.6192109,0.00080534915,0.0008553437,0.00006860434,0.00044421435,0.0007408527,0.261466],"genre_scores_gemma":[0.81962734,0.0010877154,0.078973204,0.00050514576,0.0011607305,0.00020777177,0.0005814935,0.000381875,0.09747473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933547,0.00013811963,0.000044111894,0.00015828248,0.0002546869,0.00006936943],"domain_scores_gemma":[0.99778265,0.0013791214,0.00014271488,0.00030041562,0.00026556174,0.00012944642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051736145,0.00044554428,0.00042376172,0.0009456443,0.0008141607,0.0015107782,0.0005924242,0.0007485831,0.00855099],"category_scores_gemma":[0.003522553,0.00039563008,0.00040556237,0.0009741644,0.0015286308,0.0032714629,0.0012369362,0.0011908408,0.0017437398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022240725,0.000009570544,0.00006560996,0.000032554515,0.0000023733849,0.000055594315,0.000063834574,0.0005730363,0.0017867534,0.9819436,0.0011562267,0.014288528],"study_design_scores_gemma":[0.0000115251105,0.000024250681,0.00015956284,0.000012634739,0.000004030637,0.0002835921,0.000022339562,0.0060188165,0.0019118658,0.9821791,0.0093620885,0.000010300172],"about_ca_topic_score_codex":0.00022356851,"about_ca_topic_score_gemma":0.00022283877,"teacher_disagreement_score":0.00855099,"about_ca_system_score_codex":0.0004355639,"about_ca_system_score_gemma":0.00046810068,"threshold_uncertainty_score":0.028605938},"labels":[],"label_agreement":null},{"id":"W4411772264","doi":"10.1007/978-3-031-97548-6_3","title":"Avoiding Abelian and Additive Powers in Rich Words","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Victoria","funders":"","keywords":"Computer science; Abelian group; Algebra over a field; Artificial intelligence; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.008010118868852199,"score_gpt":0.22909934543379187,"score_spread":0.22108922656493968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411772264","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.40888205,0.0020887086,0.17709818,0.00152429,0.0005892594,0.00008393523,0.0002620097,0.0005466483,0.40892497],"genre_scores_gemma":[0.9158963,0.0006160179,0.013323733,0.00020293666,0.00028655143,0.00007410365,0.00013351384,0.00020651655,0.069260344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993055,0.00020469713,0.000052227766,0.000106539555,0.00016599691,0.00016516141],"domain_scores_gemma":[0.99841094,0.00090448564,0.00012915615,0.00023581287,0.00015970544,0.00015991347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398991,0.00066489837,0.0007754165,0.0014760443,0.001886566,0.003257835,0.00073795684,0.0009069844,0.008251341],"category_scores_gemma":[0.0022856023,0.0007239863,0.00082620606,0.0011753181,0.0037554475,0.007398047,0.0031332239,0.002134052,0.0015326228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020124276,0.000006796249,0.000048980706,0.00001858708,0.0000026552354,0.000058296864,0.00032418343,0.00015782738,0.00050041045,0.99643743,0.0003258153,0.0020988693],"study_design_scores_gemma":[0.00000588164,0.000007751085,0.000050581566,0.0000062284566,0.000005261509,0.00010809088,0.00013061808,0.00037451394,0.00041853468,0.9957724,0.0031151315,0.000004918064],"about_ca_topic_score_codex":0.00036192735,"about_ca_topic_score_gemma":0.0005574315,"teacher_disagreement_score":0.008251341,"about_ca_system_score_codex":0.0007365802,"about_ca_system_score_gemma":0.00030223312,"threshold_uncertainty_score":0.027603507},"labels":[],"label_agreement":null},{"id":"W4411806180","doi":"10.1007/978-3-031-97100-6_15","title":"Small Balanced Vertex Separators in NFA to Regular Expression Conversion","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Computer science; Vertex (graph theory); Expression (computer science); Parallel computing; Algorithm; Arithmetic; Theoretical computer science; Programming language; Mathematics; Graph","score_opus":0.010585043622686908,"score_gpt":0.2266176578072556,"score_spread":0.21603261418456868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411806180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0926041,0.00071332994,0.824858,0.00049952423,0.000288847,0.00015885016,0.00037443262,0.004059367,0.07644354],"genre_scores_gemma":[0.6909435,0.0005859664,0.24854003,0.0003272704,0.00012398539,0.00035200204,0.0007883303,0.0021991003,0.056139857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992125,0.00019196469,0.000058962916,0.00022075644,0.00020685431,0.000108909895],"domain_scores_gemma":[0.9984536,0.00081581983,0.000054132364,0.00045879342,0.00015260268,0.000065048225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435494,0.0005306355,0.00081583153,0.0007883782,0.0010244426,0.0021982694,0.0013625713,0.00085381296,0.011985309],"category_scores_gemma":[0.0028644728,0.0005626831,0.00085722574,0.0011163077,0.001452905,0.0038112812,0.0023269684,0.0019353974,0.003057097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032833178,0.00011681925,0.00030310205,0.00023785056,0.000029137655,0.0002949722,0.00062117196,0.0126303965,0.016609116,0.8117496,0.0044344384,0.15264516],"study_design_scores_gemma":[0.000036772577,0.000036657417,0.00010992763,0.000063180574,0.000032678956,0.00019587677,0.00009278427,0.04071236,0.014699868,0.92145944,0.022538599,0.000021927879],"about_ca_topic_score_codex":0.0006819132,"about_ca_topic_score_gemma":0.0011686038,"teacher_disagreement_score":0.011985309,"about_ca_system_score_codex":0.0010482246,"about_ca_system_score_gemma":0.0005577022,"threshold_uncertainty_score":0.040094852},"labels":[],"label_agreement":null},{"id":"W4411811241","doi":"10.1007/978-3-031-97141-9_10","title":"Context is the Key for LLM-Based Text Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Ontario Tech University","funders":"","keywords":"Computer science; Key (lock); Context (archaeology); Segmentation; Artificial intelligence; Information retrieval; Data science; Natural language processing; Computer security; History","score_opus":0.015158586573179362,"score_gpt":0.27685971944323856,"score_spread":0.2617011328700592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017022196,0.007859404,0.9147504,0.0022243508,0.0015376421,0.00024234595,0.0019628443,0.029483424,0.02491747],"genre_scores_gemma":[0.2665697,0.0033580086,0.69608665,0.0014228666,0.0015145171,0.00024769932,0.004178575,0.004587254,0.022034785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992083,0.00013855139,0.00008001963,0.00027617847,0.00021693295,0.00008005612],"domain_scores_gemma":[0.998287,0.00068844616,0.00014538706,0.00034776374,0.00039125865,0.00013998924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060181186,0.0010247314,0.0009541666,0.0019864966,0.0011302389,0.0034310713,0.0012754392,0.001355982,0.016651215],"category_scores_gemma":[0.0037824898,0.00060693064,0.0006649997,0.0018317638,0.00086044427,0.0050760405,0.0024659717,0.0019549727,0.022265544],"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.0003073411,0.000048172893,0.00053530035,0.0005698242,0.000022243301,0.00021841314,0.00024603144,0.0013894654,0.11064109,0.010348995,0.025257744,0.8504154],"study_design_scores_gemma":[0.00008503216,0.00045418544,0.004367973,0.00068743783,0.000211381,0.001963812,0.0010722013,0.16853032,0.3410188,0.15578344,0.3256077,0.00021777087],"about_ca_topic_score_codex":0.0010095639,"about_ca_topic_score_gemma":0.0022400399,"teacher_disagreement_score":0.016651215,"about_ca_system_score_codex":0.0005001621,"about_ca_system_score_gemma":0.00084481825,"threshold_uncertainty_score":0.05570388},"labels":[],"label_agreement":null},{"id":"W4411811242","doi":"10.1007/978-981-96-8889-0_37","title":"LLM-Based MaSE, A Software Development Framework for Developing Multi-agent Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Public Health Ontario; University of Calgary","funders":"","keywords":"Computer science; Software engineering; Software development; Software; Programming language","score_opus":0.04228735081332768,"score_gpt":0.282321220120623,"score_spread":0.2400338693072953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811242","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.000662706,0.00026902778,0.98211503,0.00013651304,0.0000601828,0.00009599178,0.0001774074,0.008363248,0.008119922],"genre_scores_gemma":[0.012411191,0.0005480184,0.96602213,0.00015786044,0.000026760967,0.00038167977,0.0011122529,0.0026536752,0.01668638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992624,0.00022296692,0.00006452952,0.000096889686,0.00029485603,0.000058344787],"domain_scores_gemma":[0.9991685,0.00043102595,0.000047509056,0.00014918334,0.00015084732,0.000052945117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013632299,0.00089271006,0.0006297433,0.00087918306,0.0007174579,0.0019235829,0.0019675863,0.0012423588,0.01666618],"category_scores_gemma":[0.0030727657,0.0011819099,0.0011022488,0.0008192409,0.0005492171,0.0025252167,0.0018985883,0.0029287378,0.0069291852],"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.00012400739,0.00018870409,0.0004607844,0.001530559,0.000087583896,0.00043769443,0.00089632336,0.031540435,0.02140411,0.25390676,0.06857982,0.62084323],"study_design_scores_gemma":[0.00009594727,0.00009086643,0.00037128275,0.00047424613,0.00006904242,0.00088757457,0.00008605326,0.1961195,0.022025822,0.0956653,0.68402255,0.0000919037],"about_ca_topic_score_codex":0.0015792113,"about_ca_topic_score_gemma":0.0034447631,"teacher_disagreement_score":0.01666618,"about_ca_system_score_codex":0.0007756326,"about_ca_system_score_gemma":0.0012769792,"threshold_uncertainty_score":0.055753887},"labels":[],"label_agreement":null},{"id":"W4411811243","doi":"10.1007/978-981-96-8889-0_17","title":"Automated Issue Hierarchy Generation for Improved Automated Negotiation Outcomes","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Hierarchy; Negotiation; Artificial intelligence","score_opus":0.020631120517147335,"score_gpt":0.28236106940879235,"score_spread":0.261729948891645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019802906,0.00016866936,0.9602064,0.0002695462,0.00021952043,0.00029924727,0.00024145406,0.007821839,0.010970501],"genre_scores_gemma":[0.34960106,0.00010252355,0.6388189,0.00013121318,0.00009941084,0.0002648703,0.00083962985,0.0009913648,0.009151037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842864,0.0005305666,0.00009324392,0.00016125417,0.00063291413,0.00015331071],"domain_scores_gemma":[0.99721766,0.0013815231,0.0001433474,0.0005769116,0.00056689704,0.0001136224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616574,0.00069894036,0.0007402506,0.0010790285,0.0008115736,0.0016967398,0.0015104479,0.00080995966,0.020158803],"category_scores_gemma":[0.009249127,0.00046800432,0.00059145293,0.000893848,0.00038714104,0.0019643996,0.0020849223,0.0017597401,0.004461557],"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.00069306605,0.0005472869,0.00068959745,0.00024386804,0.00004548056,0.00028782373,0.0004327802,0.0568051,0.027084801,0.05507913,0.029523108,0.8285681],"study_design_scores_gemma":[0.00015595897,0.00008304646,0.00027904296,0.000030584986,0.000030679523,0.000114036855,0.00009311652,0.92302245,0.02183218,0.0421695,0.012159773,0.000029578641],"about_ca_topic_score_codex":0.0010058365,"about_ca_topic_score_gemma":0.0017533529,"teacher_disagreement_score":0.020158803,"about_ca_system_score_codex":0.0005249217,"about_ca_system_score_gemma":0.0010752534,"threshold_uncertainty_score":0.06743789},"labels":[],"label_agreement":null},{"id":"W4411811345","doi":"10.1007/978-981-96-8889-0_33","title":"DistResampleR-Lite: Light Distributed Resampler for Imbalanced Regression Problems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Regression; Artificial intelligence; Statistics; Mathematics","score_opus":0.022373347818347072,"score_gpt":0.2778266701672654,"score_spread":0.2554533223489184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811345","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.0016827243,0.0005780439,0.93095064,0.00022149378,0.00038433896,0.00012443555,0.0012129447,0.06264462,0.0022006626],"genre_scores_gemma":[0.024720177,0.00033049396,0.9435253,0.0007032528,0.0002660529,0.00053126336,0.0040261317,0.012005071,0.013892214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798125,0.00047457337,0.00013862534,0.00052847946,0.0007466927,0.00013043365],"domain_scores_gemma":[0.9975171,0.0011870153,0.000103605125,0.00073522585,0.0003356995,0.00012143364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025969592,0.0022957756,0.00181951,0.0018116488,0.00070300803,0.001653824,0.003589913,0.0021011252,0.03334408],"category_scores_gemma":[0.009943241,0.0014833439,0.0014815934,0.0016634507,0.000767684,0.0027153264,0.0027989128,0.004180564,0.025140744],"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.000609972,0.00026181169,0.00064486114,0.0003818871,0.00017206214,0.00015587777,0.00012836594,0.017515978,0.011437466,0.010770028,0.20396903,0.7539527],"study_design_scores_gemma":[0.00053947116,0.00022324,0.0009268223,0.00010908711,0.00008359358,0.0004175679,0.000060112085,0.80909115,0.028242527,0.044522908,0.11566112,0.00012225569],"about_ca_topic_score_codex":0.0015837107,"about_ca_topic_score_gemma":0.0042989166,"teacher_disagreement_score":0.03334408,"about_ca_system_score_codex":0.00060604594,"about_ca_system_score_gemma":0.0011124362,"threshold_uncertainty_score":0.11154711},"labels":[],"label_agreement":null},{"id":"W4411811423","doi":"10.1007/978-981-96-8889-0_41","title":"Lost in the Noise: Evading and Detecting Backdoors in Conditional Diffusion Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Noise (video); Diffusion; Algorithm; Statistical physics; Artificial intelligence; Physics","score_opus":0.017424258572234542,"score_gpt":0.24761574983001455,"score_spread":0.23019149125778002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09016797,0.0005209288,0.90662795,0.0004897964,0.000051801162,0.000027791491,0.0000948946,0.0008713464,0.001147493],"genre_scores_gemma":[0.888257,0.0004029455,0.10696654,0.00018136413,0.00008139203,0.000038880265,0.00026881523,0.00024331242,0.0035596583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990447,0.00030595058,0.00004012953,0.0001859654,0.00025762,0.00016565633],"domain_scores_gemma":[0.9884509,0.009229168,0.000631337,0.0009618339,0.00037785564,0.00034887294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024325878,0.000983195,0.0013118758,0.0008642042,0.00048935146,0.0014148861,0.0016782696,0.0020017684,0.0011167444],"category_scores_gemma":[0.016903358,0.00079616904,0.0007723575,0.00065688975,0.0021540278,0.0035458093,0.0032988614,0.003090666,0.00029531025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082567876,0.00023142734,0.004670521,0.00026588383,0.00014492088,0.0004196045,0.0004967928,0.65502,0.012944247,0.13100941,0.0042105983,0.18976097],"study_design_scores_gemma":[0.0000067346964,0.00001910226,0.0001434355,0.000007089554,0.0000063076004,0.000033083397,0.00001530396,0.97058713,0.001387927,0.027635816,0.00014894523,0.000009112991],"about_ca_topic_score_codex":0.0031262957,"about_ca_topic_score_gemma":0.0023497595,"teacher_disagreement_score":0.0031262957,"about_ca_system_score_codex":0.0007332832,"about_ca_system_score_gemma":0.00081420026,"threshold_uncertainty_score":0.012864888},"labels":[],"label_agreement":null},{"id":"W4411811653","doi":"10.1007/978-981-96-8889-0_36","title":"Towards Predicting Complex Carpooling Trajectories with Context-Augmented BERT-LLM in Chaotic Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","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":"Université Laval; Université du Québec à Montréal","funders":"","keywords":"Computer science; Chaotic; Context (archaeology); Artificial intelligence; Geography","score_opus":0.014394527585051723,"score_gpt":0.21905596261982868,"score_spread":0.20466143503477696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3701145,0.0010829751,0.62112063,0.00027681954,0.00022083915,0.00008447882,0.0008857515,0.003100854,0.003113139],"genre_scores_gemma":[0.923624,0.00020213277,0.07335833,0.00005811877,0.00006169618,0.000043186617,0.00088046776,0.000096459145,0.0016756909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998666,0.000019413412,0.000005587427,0.000044467502,0.000025302264,0.000038637903],"domain_scores_gemma":[0.99965835,0.00014947199,0.000038458085,0.000040520707,0.000055213106,0.00005794567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026104393,0.0011028296,0.0009172462,0.00094873516,0.00042253706,0.0009282243,0.0011386848,0.0013043929,0.0014676326],"category_scores_gemma":[0.0011580543,0.0005879595,0.00075942336,0.0009355909,0.00043313514,0.00086492876,0.001221823,0.0014237548,0.0008107217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031593995,0.00015500892,0.0060144113,0.00007745167,0.00007781957,0.00019805344,0.000083817766,0.9130322,0.005256156,0.0009454166,0.0015140885,0.0723296],"study_design_scores_gemma":[0.0000017948579,0.000008659907,0.00036052935,0.0000028465872,0.0000022220593,0.0000067540873,0.000009010771,0.99905103,0.00018998906,0.0002822499,0.00008203638,0.0000029042428],"about_ca_topic_score_codex":0.016276117,"about_ca_topic_score_gemma":0.01769544,"teacher_disagreement_score":0.016276117,"about_ca_system_score_codex":0.00038112872,"about_ca_system_score_gemma":0.0006685179,"threshold_uncertainty_score":0.03236276},"labels":[],"label_agreement":null},{"id":"W4411811655","doi":"10.1007/978-981-96-8889-0_32","title":"A-REACT: Adaptive Resampling and Active Classification for Thresholded Anomalies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Resampling; Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.03696965483662371,"score_gpt":0.28180242874856454,"score_spread":0.24483277391194083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411811655","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.0025989702,0.00013535233,0.99270695,0.000051722538,0.00014071986,0.000042909312,0.00009580733,0.003614595,0.00061289355],"genre_scores_gemma":[0.09154115,0.00023508312,0.90077883,0.00017079712,0.00022947586,0.00016743882,0.0006632171,0.00086395495,0.0053500542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860233,0.0002594008,0.00007503889,0.0003471076,0.0006280357,0.00008813977],"domain_scores_gemma":[0.998185,0.00083715154,0.00011357893,0.00044568037,0.0003479,0.000070615766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019047435,0.0012452726,0.001319646,0.0014141015,0.0005874918,0.001690433,0.0032300625,0.001546951,0.0049682525],"category_scores_gemma":[0.0047884155,0.00062200375,0.0013147258,0.0012269422,0.0007246811,0.0018560287,0.0016765792,0.002218617,0.0021711187],"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.00047987606,0.0002495726,0.0010511236,0.00016360659,0.00015833524,0.00015702532,0.00012531693,0.07060956,0.034040783,0.02100598,0.015752971,0.8562059],"study_design_scores_gemma":[0.000020964895,0.00005489255,0.00027287283,0.000008850932,0.000021775546,0.000093841634,0.000012768238,0.97371656,0.010844788,0.010607226,0.004326566,0.000018845378],"about_ca_topic_score_codex":0.0024121741,"about_ca_topic_score_gemma":0.003134128,"teacher_disagreement_score":0.0049682525,"about_ca_system_score_codex":0.0006158433,"about_ca_system_score_gemma":0.00061614305,"threshold_uncertainty_score":0.016620457},"labels":[],"label_agreement":null},{"id":"W4411859426","doi":"10.1007/978-981-96-6599-0_22","title":"Optimizing Learnable Frequency-Domain Filterbanks for Depression Detection via Speech Representation Disentanglement","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech Recognition and Synthesis","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":"Computer science; Representation (politics); Speech recognition; Frequency domain; Domain (mathematical analysis); Algorithm; Artificial intelligence; Mathematics; Computer vision","score_opus":0.021331876213969064,"score_gpt":0.26678365580849234,"score_spread":0.24545177959452327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411859426","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024907025,0.0005540748,0.9712812,0.00024199621,0.000066976245,0.000046327656,0.00027595647,0.0014169079,0.0012095664],"genre_scores_gemma":[0.46981457,0.0007173243,0.5177398,0.00029734534,0.00013935458,0.00028707946,0.0017166943,0.00028453642,0.009003323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997429,0.00006019576,0.000017246506,0.000082516504,0.00004694798,0.000050104707],"domain_scores_gemma":[0.99934,0.0004850753,0.000035452198,0.000034481036,0.00008013496,0.000024694478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007304863,0.0010688097,0.0008621661,0.00043205635,0.00021439676,0.0008899269,0.00071995653,0.0012707441,0.0039463965],"category_scores_gemma":[0.0020609589,0.00054213125,0.00074459537,0.00040504427,0.0003270769,0.0009385904,0.0008509106,0.0011472338,0.0018591796],"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.0005988422,0.00021793273,0.0010377226,0.00015559894,0.00015804941,0.00014282281,0.00007631351,0.24718846,0.047267865,0.0044776914,0.0052554104,0.6934233],"study_design_scores_gemma":[0.000030717398,0.00006486911,0.00060042203,0.000011459922,0.00003347073,0.000045205466,0.000018736706,0.99094415,0.0052436455,0.0022567366,0.00074088044,0.000009653691],"about_ca_topic_score_codex":0.0045500407,"about_ca_topic_score_gemma":0.0081703365,"teacher_disagreement_score":0.0045500407,"about_ca_system_score_codex":0.0004406504,"about_ca_system_score_gemma":0.0010501891,"threshold_uncertainty_score":0.013202012},"labels":[],"label_agreement":null},{"id":"W4411951744","doi":"10.1007/978-3-031-97573-8","title":"Computational Science – ICCS 2025 Workshops","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Oak Ridge National Laboratory; Universitat Politècnica de València; Agenzia Nazionale per le Nuove Tecnologie, l'Energia e lo Sviluppo Economico Sostenibile; University of California, San Diego; Al-Furat Al-Awsat Technical University; Pázmány Péter Katolikus Egyetem; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Háskólinn í Reykjavík; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; University of Gondar; Silesian University of Technology; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universidad de Cantabria; University of Chinese Academy of Sciences; Durham University; Universidade de São Paulo; RWTH Aachen University; Universiti Teknologi Malaysia; Curtin University of Technology; Università degli Studi di Firenze; Ministry of Education, India; Euskal Herriko Unibertsitatea; Universität Hamburg; Sungkyunkwan University; Politechnika Gdańska; Chinese Academy of Sciences; Universiteit van Amsterdam; Politechnika Warszawska; Uniwersytet Szczeciński; Nanyang Technological University; Monash University; University of Westminster; Universidade Federal de Minas Gerais; Universiti Malaysia Sabah; Bournemouth University; Universidad de Málaga; National University of Singapore; National Research Foundation; Universiti Teknikal Malaysia Melaka; Purdue University; Università degli studi di Bergamo; University College London; Imperial College London; ITMO University; Universidade Nova de Lisboa; Université de Genève; Vrije Universiteit Amsterdam; King Abdullah University of Science and Technology; Middlesex University; Uniwersytet Warszawski; Agency for Science, Technology and Research; Universitat Autònoma de Barcelona; Butler University; Bureau de Recherches Géologiques et Minières; Basque Center for Applied Mathematics; King's College London; University of Illinois at Urbana-Champaign; Colorado State University; University of Illinois at Chicago; Universidad de Sevilla; RTI International; Wilfrid Laurier University; Nvidia; Science and Technology Facilities Council; University of Glasgow; Yangtze University; University of South Carolina","keywords":"Computer science","score_opus":0.06019824920372492,"score_gpt":0.3637499761309459,"score_spread":0.303551726927221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411951744","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010693882,0.014290203,0.13744317,0.012050965,0.042521253,0.00057573523,0.0071039083,0.01106306,0.7642577],"genre_scores_gemma":[0.014030836,0.0054737856,0.031511366,0.001402521,0.0034720474,0.00020422475,0.011168727,0.0022504942,0.93048596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877554,0.0002588702,0.000041042385,0.00019782751,0.00054323423,0.00018338974],"domain_scores_gemma":[0.9980135,0.00026621428,0.00004414733,0.0003519056,0.0006869873,0.0006372986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024849735,0.001581156,0.0009874329,0.0015806209,0.0009690574,0.0035294273,0.002018568,0.0016251805,0.20361322],"category_scores_gemma":[0.0021302265,0.0006092672,0.0011438695,0.0017670299,0.0003908743,0.002331515,0.0025691434,0.0022820104,0.15357941],"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.0001189696,0.00011295462,0.00008578199,0.00018449915,0.000021632875,0.000039773164,0.00002011086,0.0011825329,0.0018994343,0.0065672714,0.86302656,0.12674055],"study_design_scores_gemma":[0.000031034284,0.000091749636,0.00051088305,0.00013749812,0.000016750095,0.00012475452,0.00005377284,0.006080612,0.002008255,0.00956024,0.9813673,0.000017081224],"about_ca_topic_score_codex":0.0026843054,"about_ca_topic_score_gemma":0.007775223,"teacher_disagreement_score":0.20361322,"about_ca_system_score_codex":0.0011985353,"about_ca_system_score_gemma":0.0023710253,"threshold_uncertainty_score":0.6811541},"labels":[],"label_agreement":null},{"id":"W4411951764","doi":"10.1007/978-3-031-97573-8_19","title":"The Role of Sustainability Competences for IT Systems Engineers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sustainability in Higher Education","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Sustainability; Green computing; Engineering management; Knowledge management; Engineering; Operating system","score_opus":0.00906044709172293,"score_gpt":0.293803468316177,"score_spread":0.28474302122445405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411951764","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.06240333,0.0060625644,0.015354709,0.025177518,0.00034391094,0.000037490176,0.000021452905,0.000077572404,0.89052135],"genre_scores_gemma":[0.9164351,0.0035786978,0.007229478,0.0015429102,0.00010085265,0.000048831334,0.000032031945,0.000045179822,0.07098697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877316,0.0005720069,0.000035281064,0.00009729233,0.0002610396,0.00026130036],"domain_scores_gemma":[0.99581736,0.002000238,0.00024594564,0.00017671299,0.0005537414,0.0012059292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031796165,0.00031649813,0.00018037285,0.0007159478,0.0016040747,0.006107502,0.0005430608,0.0012314023,0.0077513694],"category_scores_gemma":[0.004364124,0.00022337121,0.00019314411,0.00051138195,0.0047600134,0.0049752844,0.0042277914,0.0025227175,0.0010406689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016750828,0.00009682148,0.001283422,0.00015819356,0.000004316137,0.00018196287,0.008358323,0.0006496816,0.0010799264,0.8853004,0.010456117,0.09241421],"study_design_scores_gemma":[0.000018763749,0.00009491959,0.0045545613,0.0013645608,0.000009616837,0.00033971123,0.017291084,0.0023100858,0.0024787954,0.625428,0.34608117,0.000028754994],"about_ca_topic_score_codex":0.0017122771,"about_ca_topic_score_gemma":0.0033326058,"teacher_disagreement_score":0.0077513694,"about_ca_system_score_codex":0.0029515913,"about_ca_system_score_gemma":0.006509707,"threshold_uncertainty_score":0.025930941},"labels":[],"label_agreement":null},{"id":"W4411970243","doi":"10.1007/978-3-031-97567-7","title":"Computational Science – ICCS 2025 Workshops","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Oak Ridge National Laboratory; Universitat Politècnica de València; Agenzia Nazionale per le Nuove Tecnologie, l'Energia e lo Sviluppo Economico Sostenibile; University of California, San Diego; Al-Furat Al-Awsat Technical University; Pázmány Péter Katolikus Egyetem; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Háskólinn í Reykjavík; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; University of Gondar; Silesian University of Technology; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universidad de Cantabria; University of Chinese Academy of Sciences; Durham University; Universidade de São Paulo; RWTH Aachen University; Universiti Teknologi Malaysia; Curtin University of Technology; Università degli Studi di Firenze; Ministry of Education, India; Euskal Herriko Unibertsitatea; Universität Hamburg; Sungkyunkwan University; Politechnika Gdańska; Chinese Academy of Sciences; Universiteit van Amsterdam; Politechnika Warszawska; Uniwersytet Szczeciński; Nanyang Technological University; Monash University; University of Westminster; Universidade Federal de Minas Gerais; Universiti Malaysia Sabah; Bournemouth University; Universidad de Málaga; National University of Singapore; National Research Foundation; Universiti Teknikal Malaysia Melaka; Purdue University; Università degli studi di Bergamo; University College London; Imperial College London; ITMO University; Universidade Nova de Lisboa; Université de Genève; Vrije Universiteit Amsterdam; King Abdullah University of Science and Technology; Middlesex University; Uniwersytet Warszawski; Agency for Science, Technology and Research; Universitat Autònoma de Barcelona; Butler University; Bureau de Recherches Géologiques et Minières; Basque Center for Applied Mathematics; King's College London; University of Illinois at Urbana-Champaign; Colorado State University; University of Illinois at Chicago; Universidad de Sevilla; RTI International; Wilfrid Laurier University; Nvidia; Science and Technology Facilities Council; University of Glasgow; Yangtze University; University of South Carolina","keywords":"Computer science","score_opus":0.06019824920372492,"score_gpt":0.3637499761309459,"score_spread":0.303551726927221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411970243","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010693882,0.014290203,0.13744317,0.012050965,0.042521253,0.00057573523,0.0071039083,0.01106306,0.7642577],"genre_scores_gemma":[0.014030836,0.0054737856,0.031511366,0.001402521,0.0034720474,0.00020422475,0.011168727,0.0022504942,0.93048596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877554,0.0002588702,0.000041042385,0.00019782751,0.00054323423,0.00018338974],"domain_scores_gemma":[0.9980135,0.00026621428,0.00004414733,0.0003519056,0.0006869873,0.0006372986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024849735,0.001581156,0.0009874329,0.0015806209,0.0009690574,0.0035294273,0.002018568,0.0016251805,0.20361322],"category_scores_gemma":[0.0021302265,0.0006092672,0.0011438695,0.0017670299,0.0003908743,0.002331515,0.0025691434,0.0022820104,0.15357941],"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.0001189696,0.00011295462,0.00008578199,0.00018449915,0.000021632875,0.000039773164,0.00002011086,0.0011825329,0.0018994343,0.0065672714,0.86302656,0.12674055],"study_design_scores_gemma":[0.000031034284,0.000091749636,0.00051088305,0.00013749812,0.000016750095,0.00012475452,0.00005377284,0.006080612,0.002008255,0.00956024,0.9813673,0.000017081224],"about_ca_topic_score_codex":0.0026843054,"about_ca_topic_score_gemma":0.007775223,"teacher_disagreement_score":0.20361322,"about_ca_system_score_codex":0.0011985353,"about_ca_system_score_gemma":0.0023710253,"threshold_uncertainty_score":0.6811541},"labels":[],"label_agreement":null},{"id":"W4412041733","doi":"10.1007/978-3-031-97570-7_18","title":"AggTruth: Contextual Hallucination Detection Using Aggregated Attention Scores in LLMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing","score_opus":0.038232566716946095,"score_gpt":0.2701886435554073,"score_spread":0.2319560768384612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412041733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18251227,0.0017753058,0.7239264,0.00036291158,0.00046909956,0.0003269718,0.0062032016,0.07460244,0.00982139],"genre_scores_gemma":[0.5700906,0.000523505,0.40882593,0.00017274692,0.00027491964,0.0002529977,0.005818831,0.0017183119,0.01232216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998196,0.000034382698,0.000011483681,0.00004311067,0.000067317524,0.000024189216],"domain_scores_gemma":[0.99975425,0.000111561254,0.000019533216,0.00003828995,0.000046040223,0.000030343877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003871333,0.0007342177,0.00052497676,0.0008549152,0.00020513085,0.00081057963,0.00066744676,0.00045644204,0.010422901],"category_scores_gemma":[0.0013598398,0.00020223334,0.00029253855,0.000562397,0.00015247408,0.0005160231,0.0010552835,0.00035700653,0.0031435112],"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.0007892276,0.00008276064,0.004615133,0.00015501441,0.00008901965,0.00031184283,0.0000861846,0.0052390136,0.03356452,0.0012555383,0.022607401,0.93120444],"study_design_scores_gemma":[0.0002057701,0.00067183183,0.04495927,0.00008857526,0.00016016241,0.0017321577,0.00028516632,0.74386054,0.167719,0.012516306,0.027638387,0.00016286856],"about_ca_topic_score_codex":0.0016286899,"about_ca_topic_score_gemma":0.0037384133,"teacher_disagreement_score":0.010422901,"about_ca_system_score_codex":0.00016374426,"about_ca_system_score_gemma":0.00019998943,"threshold_uncertainty_score":0.03486812},"labels":[],"label_agreement":null},{"id":"W4412041748","doi":"10.1007/978-3-031-97570-7","title":"Computational Science – ICCS 2025 Workshops","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Oak Ridge National Laboratory; Universitat Politècnica de València; Agenzia Nazionale per le Nuove Tecnologie, l'Energia e lo Sviluppo Economico Sostenibile; University of California, San Diego; Al-Furat Al-Awsat Technical University; Pázmány Péter Katolikus Egyetem; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; University of Gondar; Universidad de Cantabria; University of Chinese Academy of Sciences; Durham University; Universidade de São Paulo; RWTH Aachen University; Universiti Teknologi Malaysia; Curtin University of Technology; Università degli Studi di Firenze; King Abdullah University of Science and Technology; Ministry of Education, India; Euskal Herriko Unibertsitatea; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universität Hamburg; Sungkyunkwan University; Politechnika Gdańska; Chinese Academy of Sciences; Silesian University of Technology; Universiteit van Amsterdam; Politechnika Warszawska; University of Westminster; Monash University; Uniwersytet Szczeciński; Nanyang Technological University; Universidade Federal de Minas Gerais; Universiti Malaysia Sabah; Bournemouth University; Universidad de Málaga; National University of Singapore; National Research Foundation; Universiti Teknikal Malaysia Melaka; Università degli studi di Bergamo; University College London; Imperial College London; Uniwersytet Warszawski; Agency for Science, Technology and Research; Universitat Autònoma de Barcelona; Butler University; Bureau de Recherches Géologiques et Minières; Basque Center for Applied Mathematics; King's College London; University of Illinois at Urbana-Champaign; Colorado State University; University of Illinois at Chicago; Universidad de Sevilla; RTI International; Vrije Universiteit Amsterdam; Université de Genève; Wilfrid Laurier University; Nvidia; ITMO University; Universidade Nova de Lisboa; Science and Technology Facilities Council; University of Glasgow; Yangtze University; University of South Carolina","keywords":"Computer science","score_opus":0.06019824920372492,"score_gpt":0.3637499761309459,"score_spread":0.303551726927221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412041748","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010693882,0.014290203,0.13744317,0.012050965,0.042521253,0.00057573523,0.0071039083,0.01106306,0.7642577],"genre_scores_gemma":[0.014030836,0.0054737856,0.031511366,0.001402521,0.0034720474,0.00020422475,0.011168727,0.0022504942,0.93048596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877554,0.0002588702,0.000041042385,0.00019782751,0.00054323423,0.00018338974],"domain_scores_gemma":[0.9980135,0.00026621428,0.00004414733,0.0003519056,0.0006869873,0.0006372986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024849735,0.001581156,0.0009874329,0.0015806209,0.0009690574,0.0035294273,0.002018568,0.0016251805,0.20361322],"category_scores_gemma":[0.0021302265,0.0006092672,0.0011438695,0.0017670299,0.0003908743,0.002331515,0.0025691434,0.0022820104,0.15357941],"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.0001189696,0.00011295462,0.00008578199,0.00018449915,0.000021632875,0.000039773164,0.00002011086,0.0011825329,0.0018994343,0.0065672714,0.86302656,0.12674055],"study_design_scores_gemma":[0.000031034284,0.000091749636,0.00051088305,0.00013749812,0.000016750095,0.00012475452,0.00005377284,0.006080612,0.002008255,0.00956024,0.9813673,0.000017081224],"about_ca_topic_score_codex":0.0026843054,"about_ca_topic_score_gemma":0.007775223,"teacher_disagreement_score":0.20361322,"about_ca_system_score_codex":0.0011985353,"about_ca_system_score_gemma":0.0023710253,"threshold_uncertainty_score":0.6811541},"labels":[],"label_agreement":null},{"id":"W4412056070","doi":"10.1007/978-3-031-97554-7","title":"Computational Science – ICCS 2025 Workshops","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Oak Ridge National Laboratory; Universitat Politècnica de València; University of Illinois at Urbana-Champaign; Agenzia Nazionale per le Nuove Tecnologie, l'Energia e lo Sviluppo Economico Sostenibile; University of California, San Diego; Al-Furat Al-Awsat Technical University; Pázmány Péter Katolikus Egyetem; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Universidade Nova de Lisboa; ITMO University; Szkola Glówna Gospodarstwa Wiejskiego w Warszawie; Butler University; Bureau de Recherches Géologiques et Minières; Universitat Autònoma de Barcelona; University of Gondar; Durham University; University of Chinese Academy of Sciences; Universidade de São Paulo; RWTH Aachen University; Universiti Teknologi Malaysia; Curtin University of Technology; Università degli Studi di Firenze; King Abdullah University of Science and Technology; Ministry of Education, India; Euskal Herriko Unibertsitatea; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Silesian University of Technology; Universiteit van Amsterdam; Monash University; University of Westminster; Universidade Federal de Minas Gerais; Universiti Malaysia Sabah; Universidad de Málaga; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universität Hamburg; Sungkyunkwan University; National University of Singapore; National Research Foundation; Universiti Teknikal Malaysia Melaka; University College London; Università degli studi di Bergamo; Université de Genève; Vrije Universiteit Amsterdam; Imperial College London; Uniwersytet Warszawski; Agency for Science, Technology and Research; University of Illinois at Chicago; Universidad de Sevilla; Basque Center for Applied Mathematics; King's College London; Politechnika Gdańska; Chinese Academy of Sciences; Science and Technology Facilities Council; University of Glasgow; Nvidia; Wilfrid Laurier University; University of South Carolina; RTI International","keywords":"Computer science; Data science","score_opus":0.06019824920372492,"score_gpt":0.3637499761309459,"score_spread":0.303551726927221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412056070","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010693882,0.014290203,0.13744317,0.012050965,0.042521253,0.00057573523,0.0071039083,0.01106306,0.7642577],"genre_scores_gemma":[0.014030836,0.0054737856,0.031511366,0.001402521,0.0034720474,0.00020422475,0.011168727,0.0022504942,0.93048596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877554,0.0002588702,0.000041042385,0.00019782751,0.00054323423,0.00018338974],"domain_scores_gemma":[0.9980135,0.00026621428,0.00004414733,0.0003519056,0.0006869873,0.0006372986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024849735,0.001581156,0.0009874329,0.0015806209,0.0009690574,0.0035294273,0.002018568,0.0016251805,0.20361322],"category_scores_gemma":[0.0021302265,0.0006092672,0.0011438695,0.0017670299,0.0003908743,0.002331515,0.0025691434,0.0022820104,0.15357941],"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.0001189696,0.00011295462,0.00008578199,0.00018449915,0.000021632875,0.000039773164,0.00002011086,0.0011825329,0.0018994343,0.0065672714,0.86302656,0.12674055],"study_design_scores_gemma":[0.000031034284,0.000091749636,0.00051088305,0.00013749812,0.000016750095,0.00012475452,0.00005377284,0.006080612,0.002008255,0.00956024,0.9813673,0.000017081224],"about_ca_topic_score_codex":0.0026843054,"about_ca_topic_score_gemma":0.007775223,"teacher_disagreement_score":0.20361322,"about_ca_system_score_codex":0.0011985353,"about_ca_system_score_gemma":0.0023710253,"threshold_uncertainty_score":0.6811541},"labels":[],"label_agreement":null},{"id":"W4412153124","doi":"10.1007/978-3-031-97623-0_7","title":"More Than You Signed Up For: Exposing Gaps in the Validation of Android’s App Signing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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 Saskatchewan","funders":"","keywords":"Computer science; Android (operating system); Android application; World Wide Web; Operating system; Computer security","score_opus":0.016192131537712776,"score_gpt":0.2749808703657145,"score_spread":0.25878873882800174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412153124","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17418282,0.00868438,0.49115258,0.017667782,0.005917101,0.00036107114,0.0013406122,0.04184803,0.25884566],"genre_scores_gemma":[0.8146275,0.002551634,0.0815402,0.0032751353,0.0005433784,0.0001202054,0.0011359516,0.0066591483,0.08954691],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964618,0.00090100575,0.0001582356,0.00033846253,0.0017548559,0.00038571516],"domain_scores_gemma":[0.98837775,0.0063286815,0.0005631877,0.0028190957,0.0016361501,0.0002752388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026712094,0.0007234597,0.0004804417,0.0010884674,0.0012316264,0.003526269,0.0010380929,0.0026983644,0.008542849],"category_scores_gemma":[0.021026114,0.0007781205,0.0005077866,0.0004943357,0.002071765,0.00841396,0.004400422,0.0040963367,0.0060606087],"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.00068314583,0.0001631861,0.0054324525,0.0006076407,0.000045686764,0.0016826186,0.008961091,0.0024039487,0.029637856,0.14410163,0.12765707,0.6786236],"study_design_scores_gemma":[0.000059275117,0.0004946233,0.006044978,0.0024153867,0.00015169104,0.0069499053,0.004006015,0.045921087,0.13844253,0.14161053,0.6535997,0.00030432604],"about_ca_topic_score_codex":0.0013938474,"about_ca_topic_score_gemma":0.0020114216,"teacher_disagreement_score":0.008542849,"about_ca_system_score_codex":0.0006481734,"about_ca_system_score_gemma":0.0013759906,"threshold_uncertainty_score":0.028578639},"labels":[],"label_agreement":null},{"id":"W4412153876","doi":"10.1007/978-3-031-97623-0_3","title":"Hiding in Plain Sight: On the Robustness of AI-Generated Code Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Robustness (evolution); Sight; Code (set theory); Artificial intelligence; Computer vision; Programming language; Optics","score_opus":0.01563596583748072,"score_gpt":0.2303640308463903,"score_spread":0.21472806500890956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412153876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13816123,0.0025051478,0.8380523,0.00130356,0.00029681565,0.00008550279,0.0003157988,0.002352794,0.016926894],"genre_scores_gemma":[0.9195574,0.0007050467,0.07315389,0.00025451535,0.00031237898,0.000039374852,0.00027508466,0.0003404686,0.0053617223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564147,0.0013486715,0.00013691439,0.0007106525,0.0016172624,0.0005449676],"domain_scores_gemma":[0.9507819,0.038341198,0.002309653,0.0056237318,0.00251435,0.00042915376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033220523,0.0011523404,0.001102378,0.0017632053,0.0007610335,0.002462993,0.0025092212,0.0022937888,0.0031994905],"category_scores_gemma":[0.038379803,0.00063184986,0.0007490373,0.0012380754,0.0036188473,0.0047290535,0.003077837,0.002484606,0.0009908057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022743738,0.00021888122,0.0037148106,0.0004450819,0.00026507216,0.0005020165,0.00069560896,0.4163831,0.043996304,0.14508714,0.0090755755,0.37734208],"study_design_scores_gemma":[0.000015244437,0.000092854396,0.0006425739,0.000029530109,0.00003539881,0.00019222236,0.000055371125,0.9270073,0.014450822,0.056568813,0.000873174,0.000036640442],"about_ca_topic_score_codex":0.0026939795,"about_ca_topic_score_gemma":0.0012354262,"teacher_disagreement_score":0.0033220523,"about_ca_system_score_codex":0.0013092852,"about_ca_system_score_gemma":0.00076545274,"threshold_uncertainty_score":0.017568886},"labels":[],"label_agreement":null},{"id":"W4412176745","doi":"10.1007/978-3-031-97623-0_9","title":"Red Light for Security: Uncovering Auto Feature Check and Access Control Gaps in AAOS","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Feature (linguistics); Access control; Artificial intelligence; Computer security","score_opus":0.00841651904773657,"score_gpt":0.26511282644856704,"score_spread":0.2566963074008305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412176745","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.8316858,0.0034588343,0.116968915,0.0018762846,0.00044745684,0.000104426435,0.0023132649,0.0084744,0.034670744],"genre_scores_gemma":[0.9423489,0.0005632495,0.04860787,0.00031297965,0.00007321165,0.00003237829,0.0010488735,0.0004815331,0.006530871],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959093,0.000043033124,0.000011878876,0.00009489078,0.00018121321,0.000077968194],"domain_scores_gemma":[0.9975351,0.0013112006,0.00035687175,0.0003979389,0.00028334913,0.00011550703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004621789,0.00034094742,0.000323075,0.0012868195,0.00064870424,0.0013749753,0.0006489946,0.0007978726,0.0023108413],"category_scores_gemma":[0.0037784418,0.00025907945,0.00027685045,0.00087010866,0.00066715264,0.002246854,0.0009415689,0.0013192766,0.00088195904],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083622575,0.00053140137,0.09174525,0.00041870942,0.00007083689,0.001641809,0.0037837727,0.011076671,0.050416812,0.0384732,0.040890533,0.7601147],"study_design_scores_gemma":[0.00006342639,0.00052327826,0.07458573,0.00049791235,0.00020177175,0.003804083,0.005991276,0.53081745,0.11189033,0.18068664,0.090748705,0.00018942992],"about_ca_topic_score_codex":0.0021913615,"about_ca_topic_score_gemma":0.0042509604,"teacher_disagreement_score":0.0023108413,"about_ca_system_score_codex":0.00038853957,"about_ca_system_score_gemma":0.0007384022,"threshold_uncertainty_score":0.0077305436},"labels":[],"label_agreement":null},{"id":"W4412190179","doi":"10.1007/978-981-96-8892-0_5","title":"Transformer-Based UWB Positioning: Learning to Correct Ranging Errors for Autonomous Agents","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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 Calgary","funders":"","keywords":"Ranging; Computer science; Transformer; Artificial intelligence; Computer vision; Real-time computing; Electrical engineering; Telecommunications; Voltage; Engineering","score_opus":0.010708793780304489,"score_gpt":0.23581020882253592,"score_spread":0.22510141504223144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412190179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009448364,0.00017648305,0.9881826,0.000040764546,0.000056600828,0.000009147463,0.000016387186,0.0006916233,0.0013780957],"genre_scores_gemma":[0.59942114,0.0005074963,0.39225125,0.000102628444,0.00006869296,0.000038875016,0.00012433044,0.00016829015,0.007317229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980193,0.000034023094,0.000010145352,0.000051670308,0.00007859892,0.000023728038],"domain_scores_gemma":[0.9996686,0.00013673858,0.00003250615,0.000057625035,0.00008849927,0.000015925607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038389972,0.00043989636,0.0005211721,0.0002593733,0.00017706378,0.0005002946,0.001094712,0.00061608927,0.0017761835],"category_scores_gemma":[0.0016354278,0.00024420975,0.0002849982,0.00050375576,0.00039979233,0.0007142768,0.00072016515,0.00086139544,0.00078143086],"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.00022266536,0.000060956976,0.00064481254,0.00009159527,0.00004220917,0.0000704018,0.0001242856,0.21933503,0.029389491,0.010149939,0.0028277237,0.737041],"study_design_scores_gemma":[0.000017159104,0.00009441784,0.00026342587,0.000008389343,0.00002256126,0.00012139966,0.000024033314,0.97782564,0.012465325,0.0070897546,0.0020584888,0.000009471477],"about_ca_topic_score_codex":0.0015599917,"about_ca_topic_score_gemma":0.0016624121,"teacher_disagreement_score":0.0017761835,"about_ca_system_score_codex":0.00024197246,"about_ca_system_score_gemma":0.000443033,"threshold_uncertainty_score":0.0059419274},"labels":[],"label_agreement":null},{"id":"W4412190188","doi":"10.1007/978-981-96-8892-0_36","title":"Using Meta-Learning to Predict Work-in-Progress: An Approach for Small Datasets","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Work (physics); Data science","score_opus":0.073403482552982,"score_gpt":0.31593376757793945,"score_spread":0.24253028502495744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412190188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40641522,0.005136424,0.53966665,0.0014074459,0.00041305696,0.00058309786,0.03356639,0.006038811,0.006772855],"genre_scores_gemma":[0.7213864,0.00059649517,0.25308433,0.00013005239,0.00021042694,0.0006473656,0.020458162,0.00030079755,0.003186032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977538,0.0007692885,0.00018527737,0.00075891917,0.00037013425,0.00016254866],"domain_scores_gemma":[0.98604923,0.009366527,0.00084975344,0.002654406,0.0007615837,0.0003185295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051751127,0.0014776574,0.002053376,0.0051239184,0.00067935226,0.002817224,0.0030345528,0.0016312918,0.0018081709],"category_scores_gemma":[0.016357873,0.000509542,0.0019775077,0.006791833,0.0004853281,0.0035588208,0.001990847,0.0018744923,0.0016526639],"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.0018288083,0.0016908915,0.26085818,0.0006621481,0.0022452055,0.00022447313,0.00046936743,0.113654785,0.0030283548,0.0049925465,0.021876534,0.5884687],"study_design_scores_gemma":[0.00007042346,0.0002748338,0.036503825,0.00011357195,0.00038251272,0.00016125165,0.00027637978,0.9362913,0.0027777036,0.017445914,0.0056285635,0.0000736869],"about_ca_topic_score_codex":0.0036278216,"about_ca_topic_score_gemma":0.006732013,"teacher_disagreement_score":0.0051751127,"about_ca_system_score_codex":0.00086540444,"about_ca_system_score_gemma":0.0009594963,"threshold_uncertainty_score":0.027368963},"labels":[],"label_agreement":null},{"id":"W4412190212","doi":"10.1007/978-981-96-8892-0_19","title":"MediTHIM: Temporal Hierarchical Imputation Methods for Medical Time Series","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Time series; Imputation (statistics); Series (stratigraphy); Data mining; Artificial intelligence; Machine learning; Missing data","score_opus":0.015643725448008856,"score_gpt":0.3531396622867204,"score_spread":0.33749593683871154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412190212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008492683,0.00034499587,0.99124676,0.00023763602,0.00021999044,0.000043953172,0.0013813706,0.0051481156,0.0005280171],"genre_scores_gemma":[0.030370977,0.000556851,0.9532051,0.00035516045,0.0005070529,0.00039192196,0.0068772575,0.0020148146,0.0057208585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987134,0.00055411225,0.00010136379,0.00023055215,0.00032145093,0.00007925163],"domain_scores_gemma":[0.99663097,0.0019116998,0.00018465631,0.0008391036,0.00031350343,0.00012010729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046709604,0.00094523357,0.0013804927,0.0011178198,0.0007294456,0.0016484617,0.0036132208,0.0017685243,0.022154478],"category_scores_gemma":[0.015587115,0.0011271782,0.0025076808,0.0018036256,0.0005268842,0.0018725395,0.002556715,0.0038130737,0.009409233],"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.00068989233,0.0001851071,0.002394216,0.00043179214,0.0008009709,0.00027374047,0.00017720308,0.12011515,0.0024808226,0.05258567,0.11012869,0.70973676],"study_design_scores_gemma":[0.00013419305,0.00006630745,0.0006608717,0.00007444228,0.00008365693,0.00015680843,0.00002502385,0.89427584,0.0017955097,0.07405168,0.028628785,0.000046736175],"about_ca_topic_score_codex":0.0028036346,"about_ca_topic_score_gemma":0.005708194,"teacher_disagreement_score":0.022154478,"about_ca_system_score_codex":0.00046345452,"about_ca_system_score_gemma":0.0015498343,"threshold_uncertainty_score":0.074114144},"labels":[],"label_agreement":null},{"id":"W4412373995","doi":"10.1007/978-3-031-98208-8_8","title":"Portability of Optimizations from SC to TSO","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Software portability; Computer science; Programming language; Operating system; Software engineering","score_opus":0.013828346141456971,"score_gpt":0.2622796473828148,"score_spread":0.2484513012413578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412373995","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.06717879,0.00056085543,0.7693249,0.00074296235,0.00071811024,0.00024801373,0.0011795706,0.03513927,0.124907576],"genre_scores_gemma":[0.6166043,0.0005192311,0.32961047,0.00063790055,0.00043726392,0.00028018243,0.0030154614,0.015175385,0.033719715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873275,0.00023199047,0.00011416363,0.00022646217,0.00046219918,0.00023240766],"domain_scores_gemma":[0.99692863,0.0007811035,0.000095355375,0.0017976932,0.00033615707,0.00006104204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076090085,0.0008497232,0.0006008682,0.0007844828,0.0005483109,0.0016875876,0.0013582672,0.00051347836,0.026622618],"category_scores_gemma":[0.004839665,0.00047893912,0.0015675506,0.0011844762,0.0010717696,0.0024984195,0.0019903327,0.0018352659,0.004814747],"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.0010496287,0.000368389,0.0022637672,0.00053663476,0.00017144298,0.00034086304,0.00027254742,0.07972938,0.02727166,0.21044567,0.038008075,0.6395418],"study_design_scores_gemma":[0.00022973634,0.0003029271,0.001663252,0.00013278393,0.00021005992,0.00031747032,0.0001404503,0.39870837,0.07993301,0.432531,0.08575803,0.000072922],"about_ca_topic_score_codex":0.0024404214,"about_ca_topic_score_gemma":0.003926384,"teacher_disagreement_score":0.026622618,"about_ca_system_score_codex":0.0005835015,"about_ca_system_score_gemma":0.0012408107,"threshold_uncertainty_score":0.08906156},"labels":[],"label_agreement":null},{"id":"W4412380831","doi":"10.1007/978-3-031-98694-9_10","title":"A Feature-Driven Acquisition Strategy Using Scale-Invariant Descriptors for Deep Active Learning in Preclinical CT Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Invariant (physics); Pattern recognition (psychology); Scale (ratio); Computer vision; Cartography; Mathematics","score_opus":0.02608660762390048,"score_gpt":0.312552778947027,"score_spread":0.2864661713231265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412380831","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.0059108115,0.000236202,0.9924482,0.00009490256,0.000027461923,0.000046326997,0.000060194383,0.00053002464,0.0006458272],"genre_scores_gemma":[0.2087651,0.00059978245,0.7842329,0.00023149278,0.000079557205,0.0001726936,0.0004873252,0.00036844533,0.005062634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997962,0.00003191964,0.000016664093,0.00004427835,0.000081241924,0.000029612343],"domain_scores_gemma":[0.99951947,0.00019729708,0.000042752024,0.00006829767,0.00013803222,0.000034182056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086483074,0.0005860544,0.00082925137,0.00075184996,0.000257986,0.0012227516,0.0016800177,0.0010116522,0.0027300708],"category_scores_gemma":[0.0014053448,0.0005859081,0.0006823553,0.0009278418,0.0004228639,0.0010722558,0.0013673968,0.0013812904,0.0011254477],"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.00018906445,0.0001787469,0.0007028205,0.00014233193,0.00006290448,0.00007157343,0.000075258235,0.07364973,0.06990907,0.0110188015,0.0046158493,0.8393839],"study_design_scores_gemma":[0.000011143314,0.00007027139,0.00031555715,0.0000121647145,0.000020952559,0.00011874802,0.000011796733,0.972623,0.021784207,0.0031154621,0.0019024315,0.000014309648],"about_ca_topic_score_codex":0.0020414372,"about_ca_topic_score_gemma":0.0037769775,"teacher_disagreement_score":0.0027300708,"about_ca_system_score_codex":0.00045045943,"about_ca_system_score_gemma":0.0010018861,"threshold_uncertainty_score":0.009132981},"labels":[],"label_agreement":null},{"id":"W4412397933","doi":"10.1007/978-3-031-98197-5_8","title":"Design Thinking Process Employed in Real-Life Design Studio Context","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Design Education and Practice","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":"George Brown College","funders":"","keywords":"Computer science; Studio; Context (archaeology); Process (computing); Design process; Process design; Software engineering; Human–computer interaction; Engineering drawing; Programming language; Work in process; Engineering; Telecommunications","score_opus":0.04664880375549571,"score_gpt":0.2952973826516435,"score_spread":0.2486485788961478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412397933","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.7826392,0.000459706,0.101153634,0.0007885484,0.00006492781,0.00026648236,0.00009607786,0.00038402603,0.114147276],"genre_scores_gemma":[0.9630558,0.00018298849,0.02322288,0.000068560505,0.000006065808,0.00006905646,0.00006448302,0.0000680186,0.013262129],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.996671,0.0021131388,0.00012684142,0.00039334735,0.000505594,0.00019011757],"domain_scores_gemma":[0.9928444,0.005326579,0.00034191765,0.00041092854,0.000687488,0.0003886555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026603003,0.00038781852,0.00018780299,0.0012464367,0.0012735595,0.0044924985,0.0007288255,0.0008228041,0.004204194],"category_scores_gemma":[0.006766238,0.00029438006,0.00030113096,0.0008889447,0.002090609,0.0018433989,0.0011749717,0.0011569097,0.0007333282],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006482751,0.000648313,0.01702477,0.0007612457,0.000047583304,0.0031405236,0.5499815,0.0056264224,0.047426105,0.1839234,0.003600161,0.18717177],"study_design_scores_gemma":[0.00024831385,0.0012686617,0.052161667,0.0013565865,0.00027872378,0.007600314,0.41973186,0.062460642,0.056066737,0.15086573,0.24762072,0.00034003024],"about_ca_topic_score_codex":0.0009493061,"about_ca_topic_score_gemma":0.001742681,"teacher_disagreement_score":0.0044924985,"about_ca_system_score_codex":0.0018962809,"about_ca_system_score_gemma":0.002117908,"threshold_uncertainty_score":0.0140692},"labels":[],"label_agreement":null},{"id":"W4412477677","doi":"10.1007/978-981-96-9914-8_31","title":"Overnight Stock Movement Prediction Based on Dynamic Graph Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stock Market Forecasting Methods","field":"Decision 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":"Concordia University","funders":"","keywords":"Computer science; Artificial neural network; Graph; Artificial intelligence; Theoretical computer science","score_opus":0.03654899072424543,"score_gpt":0.327596011409045,"score_spread":0.29104702068479954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412477677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39200526,0.0035607845,0.58927107,0.0007517465,0.0004494913,0.00006856784,0.0011826638,0.001678684,0.011031693],"genre_scores_gemma":[0.9703006,0.0005154852,0.024894817,0.00005522819,0.00008945461,0.000020888698,0.0006236826,0.000037711092,0.003462058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999213,0.000015102772,0.0000038416338,0.000028353988,0.000017522763,0.00001384253],"domain_scores_gemma":[0.99967825,0.00020040302,0.00002792644,0.0000206191,0.000059840786,0.000013038502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020080246,0.00044216707,0.0005224227,0.0007305483,0.00016229662,0.00047207213,0.0005586362,0.00047050542,0.0015183707],"category_scores_gemma":[0.0010077159,0.00023006539,0.00038718976,0.00074774184,0.00018584581,0.00066411175,0.0002368569,0.0005475051,0.00029653046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015315431,0.00006863936,0.0022950023,0.000033275657,0.00006603571,0.000053297666,0.000011386842,0.8576396,0.0018157172,0.0026120269,0.002744043,0.13250785],"study_design_scores_gemma":[0.0000010458012,0.0000036677573,0.00020589565,8.924081e-7,0.0000030605215,0.0000021545475,6.8985673e-7,0.99913067,0.00007208748,0.0005371229,0.00004149561,0.000001081926],"about_ca_topic_score_codex":0.014174698,"about_ca_topic_score_gemma":0.013651295,"teacher_disagreement_score":0.014174698,"about_ca_system_score_codex":0.00046994444,"about_ca_system_score_gemma":0.0002508374,"threshold_uncertainty_score":0.028184414},"labels":[],"label_agreement":null},{"id":"W4412477681","doi":"10.1007/978-981-96-9914-8_32","title":"Fraud Detection Based on Dynamic Graph Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Graph; Artificial neural network; Artificial intelligence; Theoretical computer science","score_opus":0.009428327176739066,"score_gpt":0.24062829625491056,"score_spread":0.2311999690781715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412477681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22244458,0.0034176235,0.7585708,0.0019634988,0.0005114352,0.0002549791,0.0010684496,0.0021880476,0.009580607],"genre_scores_gemma":[0.9222667,0.00074271264,0.07177573,0.00020312022,0.00017992742,0.00006725128,0.0008424211,0.00006492756,0.003857113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938357,0.00017066914,0.00002931087,0.00014031498,0.00017921657,0.00009696707],"domain_scores_gemma":[0.99817526,0.0010034785,0.0002146129,0.00017512638,0.0003468068,0.00008465829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010255825,0.00079647714,0.0012017791,0.0035083778,0.0005971655,0.0014596184,0.0014741198,0.0011247997,0.0014957258],"category_scores_gemma":[0.004060396,0.00033116905,0.0006596231,0.0024468561,0.00051950564,0.0019352785,0.0009091161,0.0010379624,0.00043785313],"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.0007305357,0.0005377971,0.013886302,0.00014705141,0.00029708174,0.00038715889,0.000072691735,0.33069378,0.004380488,0.018447371,0.014411687,0.616008],"study_design_scores_gemma":[0.0000042331653,0.000015000691,0.0005020028,0.0000057939246,0.000012975479,0.00004393439,0.000007717688,0.9930396,0.00040344772,0.0056446246,0.00031656298,0.000004167941],"about_ca_topic_score_codex":0.0057330863,"about_ca_topic_score_gemma":0.005241541,"teacher_disagreement_score":0.0057330863,"about_ca_system_score_codex":0.0011630007,"about_ca_system_score_gemma":0.00062988495,"threshold_uncertainty_score":0.011399388},"labels":[],"label_agreement":null},{"id":"W4412496569","doi":"10.1007/978-3-031-98462-4_52","title":"From Recall to Reasoning: Automated Question Generation for Deeper Math Learning Through Large Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Recall; Automated reasoning; Artificial intelligence; Natural language processing; Cognitive science; Programming language; Mathematics education; Cognitive psychology; Mathematics; Psychology","score_opus":0.022786288251855216,"score_gpt":0.2863770605732907,"score_spread":0.2635907723214355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020135159,0.00039071494,0.9453595,0.0010412261,0.00015410293,0.00024739202,0.0017196451,0.026037512,0.004914817],"genre_scores_gemma":[0.2700806,0.00028907627,0.71047896,0.00049576315,0.00015133437,0.0002747301,0.007877134,0.0018347944,0.008517652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981647,0.000656132,0.000121364465,0.00056411733,0.00036782055,0.00012583974],"domain_scores_gemma":[0.9929529,0.0051564164,0.00018321077,0.0009193656,0.00061786006,0.00017018267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019400774,0.0014926048,0.0010919154,0.0015836986,0.0006796796,0.0028135318,0.002966801,0.0016747477,0.02101435],"category_scores_gemma":[0.010602954,0.001062021,0.002334566,0.00090897724,0.0009642573,0.0070047905,0.0038207793,0.0037587245,0.008161385],"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.0004942051,0.00042855428,0.0018405059,0.0004330286,0.00011802598,0.00024928522,0.00074130803,0.026496558,0.015683828,0.033864606,0.039843507,0.8798066],"study_design_scores_gemma":[0.00008948696,0.00009725193,0.0004266819,0.00007081176,0.00008837561,0.00012824922,0.00027713744,0.84106135,0.019648822,0.12489049,0.013183684,0.00003769552],"about_ca_topic_score_codex":0.0024070344,"about_ca_topic_score_gemma":0.0039029168,"teacher_disagreement_score":0.02101435,"about_ca_system_score_codex":0.0011604871,"about_ca_system_score_gemma":0.0014811694,"threshold_uncertainty_score":0.07030004},"labels":[],"label_agreement":null},{"id":"W4412496603","doi":"10.1007/978-3-031-98462-4_17","title":"An Emergent Bottom-Up Categorization of Students’ LLMs Usage in an Undergraduate Research Course","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Categorization; Course (navigation); Computer science; Mathematics education; Data science; Artificial intelligence; Psychology; Engineering","score_opus":0.05014343166486811,"score_gpt":0.36362174489695853,"score_spread":0.3134783132320904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496603","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.9879159,0.00016491907,0.0020757122,0.00041377818,0.00002635257,0.00001873527,0.00043082805,0.00013056639,0.00882308],"genre_scores_gemma":[0.9943025,0.00007507908,0.0015114049,0.00011326098,0.000018389655,0.000019333125,0.00061567273,0.000069531554,0.003274911],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9987923,0.00030037222,0.00008114904,0.0002022937,0.00043092386,0.00019291203],"domain_scores_gemma":[0.992849,0.0037518477,0.0008754038,0.00036814145,0.0012137017,0.0009418369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012888919,0.00017431233,0.00025178192,0.0023342196,0.00080861466,0.00302403,0.0005378095,0.00055320584,0.003862391],"category_scores_gemma":[0.009033733,0.00016291774,0.0002484453,0.0018752125,0.00046408185,0.0019647158,0.002150597,0.00077448564,0.0015510899],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005875066,0.0003142379,0.62545824,0.00023547547,0.000060728296,0.00047112274,0.094054826,0.00035700065,0.032561038,0.0064465962,0.010010451,0.22944275],"study_design_scores_gemma":[0.000009464886,0.00021454149,0.9134909,0.000120490884,0.0000252605,0.00040370843,0.05578402,0.0033482683,0.0029711607,0.003721498,0.019853406,0.00005736335],"about_ca_topic_score_codex":0.0023651978,"about_ca_topic_score_gemma":0.004915534,"teacher_disagreement_score":0.003862391,"about_ca_system_score_codex":0.000604818,"about_ca_system_score_gemma":0.0005502077,"threshold_uncertainty_score":0.012920976},"labels":[],"label_agreement":null},{"id":"W4412496612","doi":"10.1007/978-3-031-98462-4_6","title":"What Makes Teamwork Work? A Multimodal Case Study on Emotions and Diagnostic Expertise in an Intelligent Tutoring System","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Teamwork; Intelligent tutoring system; Human–computer interaction; Artificial intelligence; Work (physics); Multimedia; Software engineering; Management","score_opus":0.02935498311710609,"score_gpt":0.2819878810316689,"score_spread":0.2526328979145628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496612","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.9871862,0.00027561787,0.0028038747,0.0013271086,0.000030210236,0.000060724753,0.000024841567,0.000022873255,0.008268418],"genre_scores_gemma":[0.9965346,0.00015407286,0.0013950615,0.00008657867,0.000011845039,0.000027815584,0.000011791435,0.000012478445,0.0017656601],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99789965,0.0014450344,0.00006448247,0.00013555973,0.00018269953,0.00027253502],"domain_scores_gemma":[0.9938292,0.004578706,0.00037833359,0.00018227054,0.0002148307,0.0008167125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022713125,0.00045853993,0.00034233212,0.00068082777,0.0045361747,0.0026480488,0.0010680981,0.002999431,0.0020161548],"category_scores_gemma":[0.009172114,0.0003168502,0.00041312978,0.00058972347,0.0024713804,0.0020676758,0.0019869334,0.001640554,0.0003050562],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076996634,0.0029882267,0.04071783,0.000398977,0.00007795943,0.07448504,0.7770396,0.0025109623,0.007350375,0.011219195,0.0057406737,0.07670118],"study_design_scores_gemma":[0.00016818522,0.0016615964,0.03883114,0.00048120783,0.000119297234,0.050267555,0.8478075,0.0124824615,0.0064933915,0.011125756,0.030409805,0.00015204793],"about_ca_topic_score_codex":0.0021700314,"about_ca_topic_score_gemma":0.0037156048,"teacher_disagreement_score":0.0045361747,"about_ca_system_score_codex":0.0012170352,"about_ca_system_score_gemma":0.0006844717,"threshold_uncertainty_score":0.012012005},"labels":[],"label_agreement":null},{"id":"W4412496625","doi":"10.1007/978-3-031-98462-4_53","title":"Enhanced Interpretable Knowledge Tracing for Students’ Performance Prediction with Human-understandable Feature Space","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Tracing; Feature (linguistics); Space (punctuation); Artificial intelligence; Feature vector; Data mining; Machine learning; Programming language; Operating system","score_opus":0.017164586431228743,"score_gpt":0.27548367421182546,"score_spread":0.2583190877805967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12412573,0.00037423533,0.8646111,0.000121567646,0.000060032,0.000044800872,0.000728158,0.007821836,0.002112511],"genre_scores_gemma":[0.81578654,0.0001506681,0.18071766,0.000029906847,0.000025187237,0.000051031726,0.00079856854,0.00018938139,0.002251053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963236,0.00007358198,0.000022803937,0.00012938015,0.00010538603,0.000036512596],"domain_scores_gemma":[0.9979132,0.0012941303,0.00015703506,0.0003354215,0.00023374539,0.00006646715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004917727,0.0006123859,0.0004790478,0.0010124862,0.00017312764,0.0009808915,0.0007517991,0.00073311303,0.0033483861],"category_scores_gemma":[0.0042504175,0.00019246702,0.00041723644,0.0007738221,0.0002180902,0.0017295815,0.0009988244,0.0007796201,0.0010391279],"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.0004740201,0.00027374618,0.0043688565,0.00008235137,0.000050274557,0.00016904915,0.0002094965,0.046361256,0.025599808,0.0019554729,0.0025161707,0.9179394],"study_design_scores_gemma":[0.000010341675,0.00008619366,0.0026278622,0.00001539586,0.000017406424,0.000066483764,0.000027411012,0.9818978,0.011825459,0.002516055,0.00089402497,0.000015466365],"about_ca_topic_score_codex":0.0033813994,"about_ca_topic_score_gemma":0.0030917826,"teacher_disagreement_score":0.0033813994,"about_ca_system_score_codex":0.00028070246,"about_ca_system_score_gemma":0.00044056194,"threshold_uncertainty_score":0.011201441},"labels":[],"label_agreement":null},{"id":"W4412496668","doi":"10.1007/978-3-031-98462-4_48","title":"Beyond Programming Assistance Towards the Integration of Generative AI into Computer Science Education: A Scoping Review","year":2025,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; École de Technologie Supérieure; Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Generative grammar; Human–computer interaction; Artificial intelligence; Software engineering; Data science","score_opus":0.03692753963088899,"score_gpt":0.3766500605386815,"score_spread":0.33972252090779254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496668","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009427226,0.9989428,0.00020492867,0.00019131643,0.00006461503,0.000013998217,0.00000792039,0.0000033025221,0.00047680116],"genre_scores_gemma":[0.0011020466,0.998041,0.00042691638,0.00021322806,0.000050784387,0.00002680683,0.000019964411,0.0000030183494,0.000116236304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817765,0.0005239311,0.0003712922,0.00024898845,0.0005951083,0.00008310938],"domain_scores_gemma":[0.979111,0.017179096,0.001015741,0.00033301435,0.0020987766,0.00026249985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006261076,0.0010816101,0.0025523931,0.0061868713,0.0004981124,0.003128304,0.0019203693,0.0021309217,0.003775105],"category_scores_gemma":[0.015813574,0.00068878295,0.0014815257,0.0056703924,0.0013282861,0.0037180786,0.0019515789,0.0023662183,0.001223122],"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.000068549154,0.00009001547,0.0002879152,0.13431257,0.0003816922,0.000084749656,0.00025951033,0.00033740886,0.0005425931,0.0049160137,0.0050035645,0.85371536],"study_design_scores_gemma":[0.00006921545,0.0002450872,0.0017449802,0.39831507,0.002626134,0.00060596265,0.0005310585,0.0003428739,0.0012444395,0.0072347294,0.58699393,0.000046579535],"about_ca_topic_score_codex":0.0035553086,"about_ca_topic_score_gemma":0.0059951814,"teacher_disagreement_score":0.006261076,"about_ca_system_score_codex":0.0014862445,"about_ca_system_score_gemma":0.007791101,"threshold_uncertainty_score":0.03311217},"labels":[],"label_agreement":null},{"id":"W4412496678","doi":"10.1007/978-3-031-98462-4_33","title":"Modeling Intrinsic Load: Can Item Difficulty Be a Reasonable Proxy?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Visual and Cognitive Learning Processes","field":"Psychology","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":"Computer science; Proxy (statistics); Machine learning","score_opus":0.02826331486639794,"score_gpt":0.304518845690122,"score_spread":0.27625553082372406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40131688,0.0013200992,0.57906395,0.0013687905,0.00019924682,0.00040572303,0.0028534941,0.0019644338,0.011507322],"genre_scores_gemma":[0.9415013,0.00021331199,0.05254591,0.00025272815,0.00009272652,0.0004508317,0.0019758628,0.00045763372,0.0025097206],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9879248,0.0076502548,0.00058216363,0.0021606993,0.0011894319,0.00049256376],"domain_scores_gemma":[0.84881234,0.119536884,0.0077135903,0.017458899,0.0045738267,0.001904432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019565126,0.0027290832,0.002159436,0.0024370167,0.0008545353,0.0064236275,0.0042661354,0.003393318,0.0079154875],"category_scores_gemma":[0.16649635,0.0009932072,0.0019765727,0.0038455476,0.0022283208,0.009697132,0.0028302479,0.0029108718,0.003874274],"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.0013301875,0.0013895072,0.7748298,0.00069976633,0.001955871,0.00038604066,0.0015058465,0.04857517,0.0031868345,0.026466932,0.008668334,0.1310057],"study_design_scores_gemma":[0.00017674071,0.0011732666,0.38996276,0.0005872215,0.0008795207,0.0009040244,0.0010577365,0.4509432,0.004019835,0.14419578,0.0058090296,0.0002908821],"about_ca_topic_score_codex":0.0027897684,"about_ca_topic_score_gemma":0.002259788,"teacher_disagreement_score":0.019565126,"about_ca_system_score_codex":0.0008891103,"about_ca_system_score_gemma":0.0009985351,"threshold_uncertainty_score":0.10347146},"labels":[],"label_agreement":null},{"id":"W4412514728","doi":"10.1007/978-981-96-9875-2_24","title":"AGTCN: An Adaptive Gating Approach in Spatiotemporal Convolutional Networks for Accurate Air Quality Prediction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Air Quality Monitoring and Forecasting","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gating; Convolutional neural network; Artificial intelligence; Machine learning","score_opus":0.05146765911704951,"score_gpt":0.2895836680341801,"score_spread":0.2381160089171306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412514728","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.023003373,0.0008172722,0.966859,0.00028499577,0.00034579402,0.000048620885,0.0008015472,0.0051233945,0.002715937],"genre_scores_gemma":[0.5154805,0.0010416283,0.46410713,0.0004767744,0.0002516866,0.00017506129,0.0033503806,0.0008769433,0.014239861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986434,0.000019890047,0.000007164208,0.00004634217,0.000038030776,0.000024190345],"domain_scores_gemma":[0.99973804,0.00010324236,0.00001710844,0.00004282124,0.00008191761,0.000016856296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051012536,0.0008808774,0.0005157755,0.00037858574,0.00025096393,0.0005615229,0.0017786284,0.00090197,0.0024791874],"category_scores_gemma":[0.0011843183,0.00041266042,0.00050769607,0.00067541597,0.00029977493,0.0009396086,0.0009262084,0.0014152324,0.0007308811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018812012,0.00012174848,0.000987026,0.00007436241,0.000106644766,0.00009487515,0.00003469381,0.5979002,0.010352717,0.009632816,0.016174864,0.36433202],"study_design_scores_gemma":[0.0000022076156,0.000005317541,0.00006096431,0.0000018623418,0.0000038391754,0.000004421891,9.91707e-7,0.9974667,0.00083537,0.0011381696,0.00047815352,0.0000019874255],"about_ca_topic_score_codex":0.026142959,"about_ca_topic_score_gemma":0.03522796,"teacher_disagreement_score":0.026142959,"about_ca_system_score_codex":0.0007037974,"about_ca_system_score_gemma":0.0009870201,"threshold_uncertainty_score":0.05198157},"labels":[],"label_agreement":null},{"id":"W4412514770","doi":"10.1007/978-3-031-98679-6_12","title":"Robust Probabilistic Bisimilarity for Labelled Markov Chains","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Clarendon Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Probabilistic logic; Theoretical computer science; Markov process; Examples of Markov chains; Algorithm; Artificial intelligence; Markov model; Markov property; Machine learning; Mathematics; Statistics","score_opus":0.0426541683168992,"score_gpt":0.2839261103288533,"score_spread":0.2412719420119541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412514770","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.009542654,0.00015048444,0.98664814,0.00009731706,0.000044792127,0.00006445885,0.00008525666,0.00095398974,0.0024128426],"genre_scores_gemma":[0.42137593,0.00038008468,0.5719288,0.00018753535,0.000080809936,0.00027045322,0.0006921189,0.00055214984,0.0045320736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955407,0.0015580865,0.00028407978,0.0008319397,0.0015753151,0.00020985298],"domain_scores_gemma":[0.992015,0.0046984176,0.0006402666,0.0016895472,0.0007792568,0.00017758904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715622,0.00075295195,0.000745105,0.0012684846,0.0005949629,0.0018093626,0.0017902863,0.0011636707,0.005542072],"category_scores_gemma":[0.011327513,0.00044786927,0.000993387,0.0013083384,0.0018527992,0.002468051,0.002515722,0.0022512646,0.0016201455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002905608,0.000119203265,0.0005515368,0.00036093415,0.000080000296,0.0002456661,0.00027673913,0.34885576,0.03707734,0.47608185,0.0027703342,0.13329001],"study_design_scores_gemma":[0.00001995213,0.00005444067,0.0001060639,0.000035366586,0.000013722409,0.00009069037,0.00001991113,0.6523313,0.013003661,0.32959002,0.0047075422,0.000027339138],"about_ca_topic_score_codex":0.00070887886,"about_ca_topic_score_gemma":0.00047927667,"teacher_disagreement_score":0.005542072,"about_ca_system_score_codex":0.0012578561,"about_ca_system_score_gemma":0.0010245045,"threshold_uncertainty_score":0.018540084},"labels":[],"label_agreement":null},{"id":"W4412514797","doi":"10.1007/978-3-031-98679-6_11","title":"Assessing the Quality of Binomial Samplers: A Statistical Distance Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Computer science; Binomial (polynomial); Quality (philosophy); Negative binomial distribution; Statistics; Mathematics; Poisson distribution","score_opus":0.04402618707810627,"score_gpt":0.3454310784813723,"score_spread":0.301404891403266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412514797","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.009874979,0.0004181722,0.9860963,0.0003012425,0.000042990578,0.00005135146,0.00006696113,0.0004338074,0.0027141473],"genre_scores_gemma":[0.3542378,0.0006082536,0.64016545,0.00041963952,0.00017355024,0.00031021258,0.00032424444,0.0006368652,0.003123918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9796071,0.008574597,0.00089963933,0.0023384874,0.007810666,0.0007693816],"domain_scores_gemma":[0.9165124,0.06334268,0.005480511,0.007851489,0.0053103566,0.0015025461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0200271,0.0011852534,0.0017565599,0.0034025493,0.0010937424,0.005860233,0.0042542964,0.002378668,0.00395104],"category_scores_gemma":[0.09427395,0.00096697634,0.00100486,0.0026171594,0.0054906206,0.0074236495,0.0061397273,0.004003509,0.0010563673],"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.0003720996,0.00015086033,0.008731151,0.0003176189,0.000118582255,0.00016172916,0.00037671564,0.26463905,0.004937087,0.58333606,0.004452354,0.13240674],"study_design_scores_gemma":[0.000023597597,0.0001325554,0.0007559081,0.0000899886,0.000022546681,0.00018228768,0.00006950405,0.75878173,0.0035510354,0.23309703,0.0032502396,0.00004364028],"about_ca_topic_score_codex":0.0014522051,"about_ca_topic_score_gemma":0.0012758025,"teacher_disagreement_score":0.0200271,"about_ca_system_score_codex":0.003097159,"about_ca_system_score_gemma":0.002548801,"threshold_uncertainty_score":0.10591471},"labels":[],"label_agreement":null},{"id":"W4412532871","doi":"10.1007/978-3-031-98668-0_5","title":"Fifteen Years of Viper","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"VIPeR; Computer science","score_opus":0.0160027181418469,"score_gpt":0.24185697257447591,"score_spread":0.22585425443262902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412532871","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013119419,0.095950775,0.1057464,0.048438374,0.014835997,0.00014727584,0.0012535757,0.0058077574,0.7147004],"genre_scores_gemma":[0.07450373,0.052445758,0.04834339,0.009760352,0.0052274023,0.00012274593,0.0015594818,0.0035789374,0.80445814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985663,0.00034130397,0.00007424982,0.0003188231,0.00053194806,0.00016727556],"domain_scores_gemma":[0.9976978,0.0007865699,0.000080062426,0.00041317346,0.00061163906,0.0004108015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004030071,0.00068360136,0.00044846133,0.0016999665,0.0014196329,0.00424197,0.0013210657,0.0012425162,0.045323584],"category_scores_gemma":[0.0042503304,0.00048338392,0.0005452961,0.0015705447,0.002420815,0.0076623783,0.0037412627,0.0040349932,0.017035292],"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.000109524495,0.000051285097,0.00028109888,0.000394866,0.000020526259,0.00017685926,0.0017614643,0.001625462,0.0012815872,0.39837068,0.3329575,0.26296908],"study_design_scores_gemma":[0.0000034537995,0.00002376771,0.000093324874,0.00013154291,0.0000031876202,0.000115390736,0.000088772584,0.00024282746,0.00045968892,0.013935116,0.98489547,0.0000074357586],"about_ca_topic_score_codex":0.001283718,"about_ca_topic_score_gemma":0.0014322605,"teacher_disagreement_score":0.045323584,"about_ca_system_score_codex":0.0020267689,"about_ca_system_score_gemma":0.0014285647,"threshold_uncertainty_score":0.15162247},"labels":[],"label_agreement":null},{"id":"W4412532934","doi":"10.1007/978-3-031-98668-0_15","title":"Btor2-Select: Machine Learning Based Algorithm Selection for Hardware Model Checking","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence; Machine learning; Algorithm","score_opus":0.026053147191581867,"score_gpt":0.2833365784270469,"score_spread":0.25728343123546504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412532934","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.018483777,0.00049289566,0.91030234,0.00043226918,0.00013797042,0.0001600674,0.00059462216,0.06708301,0.0023130288],"genre_scores_gemma":[0.3976838,0.00024964128,0.59067196,0.0006268716,0.000091645714,0.00035367245,0.0026109142,0.004877083,0.0028343962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99248576,0.0031296285,0.0005460973,0.0011775115,0.0021106524,0.0005503286],"domain_scores_gemma":[0.98967373,0.0060716304,0.0007465494,0.0021477558,0.0011938624,0.0001664967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004420124,0.002148067,0.0011445066,0.0018422323,0.00063484535,0.0017653493,0.0037040454,0.0011741085,0.007174558],"category_scores_gemma":[0.013679529,0.0008596601,0.002289894,0.0010468758,0.0014357987,0.0028478818,0.0021012332,0.0025190532,0.0019033725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009623548,0.0004114076,0.00821826,0.0011897574,0.0003948628,0.00027770543,0.00017612497,0.48177093,0.024741333,0.036494832,0.040941138,0.40442127],"study_design_scores_gemma":[0.00005478787,0.00007653899,0.00017293921,0.00003559095,0.00002226715,0.000038175505,0.000012874414,0.9734784,0.013646933,0.009548406,0.002892328,0.000020831572],"about_ca_topic_score_codex":0.004893159,"about_ca_topic_score_gemma":0.0088787535,"teacher_disagreement_score":0.007174558,"about_ca_system_score_codex":0.0016709038,"about_ca_system_score_gemma":0.0040996214,"threshold_uncertainty_score":0.02400124},"labels":[],"label_agreement":null},{"id":"W4412543519","doi":"10.1007/978-3-031-98682-6_6","title":"Panini: An Efficient and Flexible Knowledge Compiler","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jilin Province","keywords":"Computer science; Compiler; Programming language; Software engineering","score_opus":0.031140392111636408,"score_gpt":0.30685456873615186,"score_spread":0.2757141766245155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412543519","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.056577254,0.0007796687,0.7665702,0.00096997153,0.00021630217,0.0007012409,0.0043362314,0.15368812,0.01616098],"genre_scores_gemma":[0.24204299,0.00034662607,0.73569417,0.00054214534,0.00007582754,0.00054002705,0.00826399,0.006096298,0.0063978555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.0005665868,0.00017728853,0.00052072475,0.00070661306,0.00023743314],"domain_scores_gemma":[0.99518424,0.002674178,0.0002784286,0.0010434474,0.0006620475,0.00015756575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018731037,0.0014268353,0.0007286782,0.0014587556,0.0006485077,0.0020899395,0.0026396522,0.00087167084,0.009867651],"category_scores_gemma":[0.008776644,0.0010119877,0.0012388286,0.0016663498,0.0009443248,0.00413032,0.0026529005,0.0018595966,0.0027040746],"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.0015080972,0.0009304498,0.0049433494,0.0012002434,0.00013065017,0.0004520464,0.00050419226,0.14637277,0.019242777,0.073686145,0.108205535,0.64282376],"study_design_scores_gemma":[0.00035642827,0.0002902511,0.001038711,0.00009037825,0.000088182904,0.0002593551,0.00019524811,0.8540219,0.0374255,0.035749067,0.07040121,0.00008367402],"about_ca_topic_score_codex":0.006290498,"about_ca_topic_score_gemma":0.0077216127,"teacher_disagreement_score":0.009867651,"about_ca_system_score_codex":0.00163632,"about_ca_system_score_gemma":0.0050212857,"threshold_uncertainty_score":0.033010542},"labels":[],"label_agreement":null},{"id":"W4412543571","doi":"10.1007/978-3-031-98682-6_5","title":"Engineering an Efficient Probabilistic Exact Model Counter","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; National Supercomputing Centre Singapore; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Computer science; Probabilistic logic; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.020603537807788255,"score_gpt":0.26610933682305205,"score_spread":0.2455057990152638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412543571","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.028937953,0.0003317248,0.95501137,0.0010403962,0.00020414006,0.00025883384,0.00037185973,0.007722481,0.0061211917],"genre_scores_gemma":[0.38099837,0.00015656654,0.60995144,0.00077764934,0.00009617998,0.00037506764,0.000767175,0.0008791013,0.005998378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922916,0.002011716,0.0004011222,0.0017220187,0.0028038637,0.00076969236],"domain_scores_gemma":[0.9851968,0.008153597,0.0008532889,0.0035922907,0.0018172952,0.00038669407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045921523,0.0012708997,0.0016228033,0.0019833662,0.0012460011,0.0032127667,0.0048870775,0.0018553344,0.011991962],"category_scores_gemma":[0.022887615,0.00096752506,0.001603757,0.0015333396,0.002412735,0.006686248,0.0049598366,0.003210471,0.0022562924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009812623,0.0004288809,0.0032847838,0.00054132886,0.00018338018,0.00035047418,0.00026521992,0.35877725,0.018265322,0.2698248,0.016657019,0.3304403],"study_design_scores_gemma":[0.00004298557,0.00006301049,0.000086025066,0.00002845886,0.000032067783,0.00007107726,0.000024070216,0.92803794,0.0073496564,0.061097078,0.0031464442,0.00002119179],"about_ca_topic_score_codex":0.0043856795,"about_ca_topic_score_gemma":0.006418331,"teacher_disagreement_score":0.011991962,"about_ca_system_score_codex":0.0030621793,"about_ca_system_score_gemma":0.0068131597,"threshold_uncertainty_score":0.040117085},"labels":[],"label_agreement":null},{"id":"W4412544362","doi":"10.1007/978-3-031-98685-7_20","title":"PyEuclid: A Versatile Formal Plane Geometry System in Python","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Python (programming language); Computer science; Programming language; Geometry; Computer graphics (images); Engineering drawing; Mathematics; Engineering","score_opus":0.01039662739688456,"score_gpt":0.23695567759531294,"score_spread":0.22655905019842837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412544362","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018479349,0.00016347792,0.8784868,0.00030756881,0.00011119397,0.00015219662,0.0035756715,0.1038127,0.011542502],"genre_scores_gemma":[0.08318337,0.0008812164,0.8384328,0.00093783083,0.00011706612,0.0011870054,0.015968537,0.036053594,0.023238542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989172,0.00016371625,0.00010236497,0.00018892442,0.00051533664,0.00011239097],"domain_scores_gemma":[0.9990563,0.00034894602,0.000065843415,0.0002636584,0.0001878918,0.000077328696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014462213,0.0011243391,0.00083195337,0.0012223999,0.00072240666,0.0031421413,0.0046705483,0.00095667527,0.03895347],"category_scores_gemma":[0.0040359823,0.0011082011,0.0017596488,0.00088978495,0.0017680917,0.004607516,0.004542063,0.0031547842,0.017126912],"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.00038727198,0.0001965028,0.0018245624,0.0016614376,0.00011630809,0.0006672534,0.0005973992,0.04685236,0.015669111,0.468297,0.20185877,0.26187193],"study_design_scores_gemma":[0.0001969004,0.00006217137,0.0005904249,0.0002627692,0.000045120298,0.0007833244,0.000110130204,0.19970715,0.019238146,0.26503164,0.51382333,0.00014890032],"about_ca_topic_score_codex":0.0028080307,"about_ca_topic_score_gemma":0.0035019123,"teacher_disagreement_score":0.03895347,"about_ca_system_score_codex":0.001389063,"about_ca_system_score_gemma":0.0030671034,"threshold_uncertainty_score":0.13031226},"labels":[],"label_agreement":null},{"id":"W4412571061","doi":"10.1007/978-981-96-7238-7_10","title":"Exploring the Systematic Use of LLMs for Microservices Generation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Microservices; Software engineering; Operating system","score_opus":0.07879804021568146,"score_gpt":0.2598617933823462,"score_spread":0.18106375316666476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412571061","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.42978975,0.0011983401,0.5233766,0.0014346541,0.000028182447,0.00035843634,0.00040835986,0.0060750437,0.037330717],"genre_scores_gemma":[0.76916283,0.00025660085,0.22528303,0.000089134795,0.000007063758,0.00008666785,0.00028740673,0.0004982839,0.004328992],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99527705,0.0026222442,0.00026338594,0.00044500752,0.0011397506,0.00025264415],"domain_scores_gemma":[0.9674877,0.021497022,0.0021770014,0.006374548,0.0021687998,0.00029479715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046121697,0.000291169,0.00021932472,0.0013094448,0.0007392949,0.0028317259,0.001385369,0.0006654178,0.0036801049],"category_scores_gemma":[0.03223221,0.00052615075,0.00045103734,0.0013001882,0.0010918186,0.0041474723,0.0021363178,0.0007648614,0.00088935555],"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.00035292903,0.0002749057,0.034760367,0.00061233004,0.00006861333,0.000481489,0.009756419,0.010507114,0.025071962,0.06633322,0.002485181,0.8492955],"study_design_scores_gemma":[0.00017103704,0.0009893773,0.03634402,0.0014043071,0.0004216937,0.0022423563,0.016631205,0.5035953,0.13774028,0.16406514,0.1361766,0.00021877702],"about_ca_topic_score_codex":0.0040361797,"about_ca_topic_score_gemma":0.009678992,"teacher_disagreement_score":0.0046121697,"about_ca_system_score_codex":0.001279355,"about_ca_system_score_gemma":0.0027702819,"threshold_uncertainty_score":0.02439171},"labels":[],"label_agreement":null},{"id":"W4412620232","doi":"10.1007/978-981-96-9881-3_8","title":"GraphMMC: Class-Balanced Pseudo-Labels Generation for Graph Node Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Northern British Columbia","funders":"","keywords":"Computer science; Class (philosophy); Graph; Node (physics); Theoretical computer science; Artificial intelligence","score_opus":0.028297756309716926,"score_gpt":0.2743163402482338,"score_spread":0.2460185839385169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412620232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093399715,0.0003962311,0.8579567,0.00048074182,0.0005113913,0.00085868704,0.009705538,0.11475517,0.0059956745],"genre_scores_gemma":[0.049422305,0.00013980703,0.91031647,0.00044057713,0.00010349684,0.0009007157,0.023070715,0.0075392444,0.008066648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868125,0.00022566017,0.00006016878,0.0005262757,0.00038029763,0.00012637737],"domain_scores_gemma":[0.9974546,0.0008800637,0.00009161871,0.0008833051,0.00055668084,0.0001336614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011496828,0.002409054,0.001421682,0.0031498966,0.0014574461,0.0021148147,0.004888564,0.0028978402,0.032893747],"category_scores_gemma":[0.0063620694,0.0011816128,0.0020592285,0.002503261,0.0007236459,0.002973374,0.0025618332,0.0034924005,0.015275948],"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.000531098,0.00034286993,0.0009595267,0.00044713638,0.000100896104,0.0001639024,0.00014716602,0.0217385,0.011891974,0.011516335,0.19734506,0.7548156],"study_design_scores_gemma":[0.00016414502,0.0000816066,0.00053601636,0.00008361335,0.00004121113,0.00015800163,0.0000814358,0.90530807,0.018282125,0.042760592,0.032454383,0.000048814043],"about_ca_topic_score_codex":0.008723738,"about_ca_topic_score_gemma":0.020201692,"teacher_disagreement_score":0.032893747,"about_ca_system_score_codex":0.0018753794,"about_ca_system_score_gemma":0.0021095523,"threshold_uncertainty_score":0.110040545},"labels":[],"label_agreement":null},{"id":"W4412620250","doi":"10.1007/978-981-96-7423-7_7","title":"Guided Response Generation for Conversational Recommender Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Recommender system; Human–computer interaction; Artificial intelligence; Multimedia; Speech recognition; Information retrieval","score_opus":0.05895280063748062,"score_gpt":0.28790658831688254,"score_spread":0.22895378767940192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412620250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010200463,0.0008913537,0.98069084,0.00038499228,0.0001946423,0.00021866863,0.00024525114,0.003360362,0.0038133815],"genre_scores_gemma":[0.36513928,0.00065349205,0.60824484,0.00046305996,0.00040983365,0.00071149477,0.0012856129,0.00068171293,0.022410695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996716,0.002024283,0.0001284347,0.00043952596,0.00045447593,0.00023729399],"domain_scores_gemma":[0.9907873,0.0070875622,0.00016656454,0.0010042561,0.0007317547,0.00022256831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037220677,0.0010754941,0.0018538198,0.0008683524,0.0012946867,0.0017635913,0.0029489934,0.002333076,0.012185634],"category_scores_gemma":[0.0127797695,0.0007530331,0.0009776414,0.0009752617,0.0006145712,0.0022394538,0.0023233404,0.002610725,0.0055494197],"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.0013586507,0.0007434213,0.0011326419,0.00058874674,0.00021672233,0.00023833208,0.0010799575,0.13978274,0.011951431,0.03430566,0.037942197,0.77065957],"study_design_scores_gemma":[0.000058611324,0.00011103154,0.00014818847,0.000028419316,0.000038220714,0.000084857034,0.00008945268,0.96307427,0.002819278,0.028092096,0.005422345,0.000033187196],"about_ca_topic_score_codex":0.003484959,"about_ca_topic_score_gemma":0.0056049153,"teacher_disagreement_score":0.012185634,"about_ca_system_score_codex":0.0007366268,"about_ca_system_score_gemma":0.00091823906,"threshold_uncertainty_score":0.040764987},"labels":[],"label_agreement":null},{"id":"W4412620322","doi":"10.1007/978-981-96-7423-7_9","title":"NLP Combined with Bi-LSTM Classifier Based Intent Detection Algorithm for Smart House Control Using WhatsApp Message","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Natural language processing","score_opus":0.01943103631634458,"score_gpt":0.24352514535941552,"score_spread":0.22409410904307095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412620322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08876973,0.0009876981,0.8818501,0.00037035678,0.00058187114,0.00018027247,0.0015259082,0.015770372,0.0099637415],"genre_scores_gemma":[0.5985316,0.00058827485,0.37172648,0.0004168912,0.00018039094,0.0002671108,0.0038875737,0.00037642947,0.024025219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986625,0.000014527009,0.000010499747,0.00004100027,0.000045569606,0.00002222093],"domain_scores_gemma":[0.9998903,0.00002848575,0.0000077980285,0.000012888571,0.00005512489,0.000005429306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016228997,0.0005799792,0.00044663585,0.00041470057,0.00026999915,0.00034415905,0.0004863365,0.00046305294,0.0043118596],"category_scores_gemma":[0.00034763882,0.00016245099,0.00039857827,0.00039777963,0.00009504341,0.00069507083,0.00036025196,0.0006126019,0.0018858408],"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.00034576745,0.00020843487,0.0008139212,0.0001956545,0.00003314194,0.00027465742,0.00011000382,0.013430145,0.08422264,0.0011300846,0.012114948,0.8871207],"study_design_scores_gemma":[0.000028173556,0.0001832459,0.002466958,0.000026914897,0.000057204466,0.00014519686,0.00009394419,0.932222,0.05641963,0.0018830661,0.006447393,0.000026333646],"about_ca_topic_score_codex":0.005189186,"about_ca_topic_score_gemma":0.0064875283,"teacher_disagreement_score":0.005189186,"about_ca_system_score_codex":0.00020504698,"about_ca_system_score_gemma":0.00041597194,"threshold_uncertainty_score":0.014424622},"labels":[],"label_agreement":null},{"id":"W4412642667","doi":"10.1007/978-981-95-0030-7_32","title":"An Adaptive Multi-view Feature Fusion Framework Based on Multiple Graphs for Predicting Drug-Drug Interactions","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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 Saskatchewan","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Data mining; Machine learning","score_opus":0.026386116908306535,"score_gpt":0.320966676322847,"score_spread":0.2945805594145404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412642667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022543255,0.000839506,0.97355396,0.00013622075,0.000061056984,0.000044036326,0.00032259157,0.0018607057,0.00063866365],"genre_scores_gemma":[0.4651958,0.000861868,0.5286752,0.00029600676,0.00015109045,0.00015651614,0.0018867452,0.00023642113,0.0025403535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960595,0.000082519284,0.0000190105,0.00010520712,0.00013320941,0.000054009917],"domain_scores_gemma":[0.99962497,0.00016165646,0.000038441693,0.00004390388,0.00010154934,0.000029422847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530393,0.001021489,0.0016815363,0.0017864022,0.00041493014,0.0007876723,0.0016410914,0.0011005764,0.0013483916],"category_scores_gemma":[0.00093572587,0.00041282407,0.0017859344,0.0018866712,0.0003562905,0.0011008857,0.0010712587,0.0010767006,0.000535401],"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.0004344508,0.0003086056,0.0018819437,0.000121552206,0.00040932233,0.0002026996,0.000054284006,0.34792867,0.026844392,0.0049458616,0.0061092237,0.610759],"study_design_scores_gemma":[0.000006020507,0.000039810413,0.00036302887,0.000003055252,0.00003293972,0.000027250022,0.000006838869,0.9955857,0.0013016114,0.002292201,0.0003318596,0.000009681499],"about_ca_topic_score_codex":0.010526841,"about_ca_topic_score_gemma":0.0109251505,"teacher_disagreement_score":0.010526841,"about_ca_system_score_codex":0.0005275921,"about_ca_system_score_gemma":0.0006913491,"threshold_uncertainty_score":0.020931125},"labels":[],"label_agreement":null},{"id":"W4412643522","doi":"10.1007/978-981-95-0006-2_16","title":"Decoupled Graph Neural Networks with Hybrid Data Augmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Victoria","funders":"","keywords":"Computer science; Artificial neural network; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.01723756207831407,"score_gpt":0.25706174011811594,"score_spread":0.23982417803980188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412643522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119344555,0.0006031084,0.97809213,0.00025306438,0.00022094298,0.00007168564,0.0005024569,0.0035652507,0.0047569717],"genre_scores_gemma":[0.34808904,0.0005644309,0.6275401,0.000499941,0.00019507113,0.00033241138,0.0028299312,0.0009574634,0.018991629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.000102807186,0.000015244868,0.00012937222,0.000106720014,0.000045179953],"domain_scores_gemma":[0.9991455,0.00033596353,0.00003923501,0.00026921052,0.0001704808,0.00003970836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060760666,0.0013174741,0.0010733692,0.00075398915,0.00035901373,0.0010271412,0.0025167083,0.0015063868,0.0066402764],"category_scores_gemma":[0.0022296144,0.0008059849,0.00095587166,0.0013148842,0.0005875167,0.0022319101,0.002250728,0.002186215,0.0034335062],"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.0003575833,0.00025096437,0.0004845312,0.00022063486,0.00016036954,0.00010940624,0.000046400284,0.4638413,0.012387935,0.012889106,0.014018591,0.49523318],"study_design_scores_gemma":[0.000008527862,0.000020187865,0.00007541795,0.000006101148,0.000012069103,0.000014894814,0.0000045459337,0.99137974,0.0017522302,0.005717689,0.0010028242,0.000005824883],"about_ca_topic_score_codex":0.0036454434,"about_ca_topic_score_gemma":0.00925031,"teacher_disagreement_score":0.0066402764,"about_ca_system_score_codex":0.00044610436,"about_ca_system_score_gemma":0.00070583425,"threshold_uncertainty_score":0.022213995},"labels":[],"label_agreement":null},{"id":"W4412684160","doi":"10.1007/978-3-031-98281-1_11","title":"Language Models for Educational Question Generation: Practical Challenges, Personalization Opportunities, and Parameter Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Athabasca University","funders":"","keywords":"Computer science; Personalization; Data science; Artificial intelligence; World Wide Web","score_opus":0.09678711961009394,"score_gpt":0.3131462608422016,"score_spread":0.21635914123210764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412684160","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.008754825,0.0008930292,0.98227376,0.0016070617,0.000099611825,0.00011508522,0.0004951871,0.0034963973,0.0022650356],"genre_scores_gemma":[0.26430365,0.0012499398,0.7214191,0.00081123196,0.00033485328,0.0005433871,0.0022887553,0.0013972787,0.0076518566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738425,0.0016262837,0.00014583385,0.0004390072,0.00027405174,0.00013050501],"domain_scores_gemma":[0.9870569,0.009734035,0.00022361457,0.001690695,0.000988788,0.00030607657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005601637,0.0008496313,0.0013379883,0.00083477603,0.0005713489,0.0036607457,0.0025077583,0.0017795052,0.009852931],"category_scores_gemma":[0.022383556,0.0008226152,0.0014773457,0.0011206297,0.0006141877,0.0063416255,0.002093154,0.00389888,0.005653994],"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.000502314,0.0004430661,0.0019392386,0.0004472153,0.00018451962,0.00011187679,0.0007919449,0.15438037,0.008177112,0.051632877,0.029110534,0.7522789],"study_design_scores_gemma":[0.000037203397,0.00004509905,0.00022333537,0.000043843924,0.000043878143,0.00006045732,0.00013922334,0.911026,0.0025133367,0.07692734,0.0089148795,0.000025449828],"about_ca_topic_score_codex":0.0041658804,"about_ca_topic_score_gemma":0.007026898,"teacher_disagreement_score":0.009852931,"about_ca_system_score_codex":0.001425782,"about_ca_system_score_gemma":0.0014747594,"threshold_uncertainty_score":0.03296131},"labels":[],"label_agreement":null},{"id":"W4412684184","doi":"10.1007/978-3-031-98281-1_22","title":"A Unified Ontological Approach for Modeling Domain Theory and Procedures: Applications, Issues and Prospects","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Domain (mathematical analysis); Management science; Domain model; Theoretical computer science; Software engineering; Domain knowledge; Mathematics","score_opus":0.020779092994650687,"score_gpt":0.2699696856403024,"score_spread":0.2491905926456517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412684184","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.0014091418,0.0025538076,0.97538346,0.0033268642,0.00025403718,0.00006067183,0.0001680812,0.00029172876,0.016552191],"genre_scores_gemma":[0.05135508,0.0048339036,0.9310004,0.0010270937,0.0005556063,0.0004668523,0.00071927643,0.00026932242,0.00977243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956899,0.001658494,0.0006397681,0.00051096344,0.0012100614,0.0002907833],"domain_scores_gemma":[0.9961953,0.0015013728,0.00025127287,0.0010467346,0.0007354472,0.00026979376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008019899,0.0013593743,0.0018927194,0.0055814018,0.0030574633,0.01350844,0.0055177477,0.0037417144,0.005646035],"category_scores_gemma":[0.006379389,0.00135204,0.003684487,0.008318048,0.008366544,0.03172944,0.004875033,0.0062653143,0.002608955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033090034,0.0000104734745,0.00003984861,0.00003755603,0.0000070540045,0.00001685299,0.00019371265,0.0005020615,0.000111768,0.98920083,0.00096631894,0.008910216],"study_design_scores_gemma":[0.0000059361523,0.000008315072,0.00006975309,0.000118847216,0.000023404724,0.00009012219,0.000213543,0.009116656,0.00022212433,0.9518357,0.038278766,0.000016884644],"about_ca_topic_score_codex":0.0064918296,"about_ca_topic_score_gemma":0.006312112,"teacher_disagreement_score":0.01350844,"about_ca_system_score_codex":0.004725715,"about_ca_system_score_gemma":0.005673256,"threshold_uncertainty_score":0.04241377},"labels":[],"label_agreement":null},{"id":"W4412684241","doi":"10.1007/978-3-031-98281-1_14","title":"Leveraging LLMs for Bayesian and Deep Knowledge Tracing in the Logic-Muse Intelligent Tutoring System","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université Laval","funders":"","keywords":"Computer science; Tracing; Artificial intelligence; Bayesian network; Bayesian probability; Programming language","score_opus":0.028393519595295184,"score_gpt":0.2643871727330686,"score_spread":0.23599365313777343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412684241","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.031954754,0.00047699196,0.95072716,0.0004863775,0.000087238775,0.000084908505,0.0003009065,0.012257355,0.0036243936],"genre_scores_gemma":[0.5764947,0.000226029,0.4156072,0.00042230633,0.0000777315,0.000106538064,0.00055096415,0.0005356572,0.0059787976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991265,0.00024679184,0.00008213777,0.00022752752,0.0002497057,0.000067284986],"domain_scores_gemma":[0.9973979,0.0014817305,0.00014139558,0.0004184769,0.00042489634,0.00013562707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014570069,0.0005625043,0.00075816084,0.0010013827,0.0005089983,0.0018570096,0.0017496153,0.0013128776,0.005358074],"category_scores_gemma":[0.008925381,0.0004959043,0.00041633056,0.00066803035,0.0005268837,0.003999524,0.0028377832,0.0017322229,0.0017491424],"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.0005437924,0.00033856765,0.0019737424,0.0001212725,0.00007750352,0.00012605393,0.00029131156,0.06850362,0.012919989,0.011636366,0.0056097554,0.8978581],"study_design_scores_gemma":[0.000021135784,0.000057810874,0.00022212019,0.000015999502,0.000022268936,0.000038275095,0.000029664896,0.9661754,0.0092474995,0.021772508,0.002378614,0.000018805385],"about_ca_topic_score_codex":0.005614294,"about_ca_topic_score_gemma":0.012072532,"teacher_disagreement_score":0.005614294,"about_ca_system_score_codex":0.0008800795,"about_ca_system_score_gemma":0.001717436,"threshold_uncertainty_score":0.017924547},"labels":[],"label_agreement":null},{"id":"W4412684294","doi":"10.1007/978-3-031-98281-1_5","title":"Enhancing Pilot Training and Decision-Making Using Ontologies: A Cognitive Assistance Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cognition; Training (meteorology); Artificial intelligence; Machine learning; Human–computer interaction; Operations research; Psychology","score_opus":0.050065377206738926,"score_gpt":0.2947707406145629,"score_spread":0.24470536340782395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412684294","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068492495,0.00015682215,0.90721905,0.00060451677,0.000049086717,0.00024588764,0.0000916731,0.0016529729,0.021487458],"genre_scores_gemma":[0.6048373,0.00022990344,0.38964272,0.00012942692,0.000018344686,0.00015625315,0.00018309879,0.000080027865,0.004722892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990816,0.00037735622,0.000058868165,0.00014105278,0.00025242902,0.00008872913],"domain_scores_gemma":[0.995535,0.0028378558,0.00022330513,0.000627556,0.0006091624,0.0001670852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018170642,0.0006342325,0.00040984922,0.0007893577,0.00055059616,0.0018441,0.0013467529,0.0009499961,0.0038667454],"category_scores_gemma":[0.0070602614,0.00030656822,0.0004405544,0.000804527,0.0006617312,0.003330704,0.001878066,0.0009906844,0.0006951665],"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.00057815353,0.0024868208,0.0047448073,0.0005038822,0.00012629865,0.00041274875,0.004598829,0.04605953,0.04094622,0.039765954,0.004496777,0.8552799],"study_design_scores_gemma":[0.00017839506,0.0006569619,0.007005773,0.00037530094,0.0003932681,0.0006326322,0.0040779016,0.71456677,0.090876766,0.124140464,0.056937445,0.00015830615],"about_ca_topic_score_codex":0.0026621418,"about_ca_topic_score_gemma":0.0027539886,"teacher_disagreement_score":0.0038667454,"about_ca_system_score_codex":0.0004909084,"about_ca_system_score_gemma":0.0016180143,"threshold_uncertainty_score":0.012935519},"labels":[],"label_agreement":null},{"id":"W4412755235","doi":"10.1007/978-3-031-97274-4_2","title":"Binary Right-Distinguishability Operation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Prince Edward Island","funders":"","keywords":"Computer science; Binary number; Arithmetic; Mathematics","score_opus":0.01011225097890231,"score_gpt":0.2407523893566184,"score_spread":0.2306401383777161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412755235","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.016948579,0.002004674,0.1633766,0.0022961905,0.0035098975,0.000058959205,0.000574124,0.00094896834,0.810282],"genre_scores_gemma":[0.41949397,0.002440031,0.052107472,0.0015483496,0.0018896717,0.00013765063,0.0009340847,0.00095715467,0.5204916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934596,0.000094872215,0.000043925633,0.00018932337,0.00021457956,0.00011130299],"domain_scores_gemma":[0.9993523,0.00025266144,0.000028809047,0.00016433156,0.00013150624,0.00007036149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057548756,0.00048821676,0.00045652717,0.0008936815,0.0012230625,0.0024298457,0.00056836865,0.0006861074,0.03350931],"category_scores_gemma":[0.0010438497,0.000250376,0.00042962437,0.0006755927,0.0026121817,0.0054722712,0.001981719,0.0028566576,0.009976489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004172688,0.000018962484,0.000032129537,0.000052827458,0.0000025053776,0.000041380918,0.00011753079,0.000082859646,0.004873879,0.9570947,0.0062563973,0.03138506],"study_design_scores_gemma":[0.00001771376,0.00003835675,0.0002712785,0.000042466367,0.0000116814035,0.0004827696,0.000095508876,0.00080391916,0.01816308,0.74248314,0.23756218,0.000027884593],"about_ca_topic_score_codex":0.00025571176,"about_ca_topic_score_gemma":0.00027396475,"teacher_disagreement_score":0.03350931,"about_ca_system_score_codex":0.00067843904,"about_ca_system_score_gemma":0.00054228964,"threshold_uncertainty_score":0.11209983},"labels":[],"label_agreement":null},{"id":"W4412804847","doi":"10.1007/978-981-95-0215-8_1","title":"Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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 New Brunswick","funders":"","keywords":"Computer science; Type (biology); Algorithm; Theoretical computer science","score_opus":0.04077532598352449,"score_gpt":0.32849171074782885,"score_spread":0.28771638476430433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412804847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023805369,0.0018636809,0.95142925,0.0016356244,0.00052797695,0.00036416147,0.0006846965,0.0020644637,0.017624708],"genre_scores_gemma":[0.15630817,0.0012295928,0.82176965,0.00073691644,0.00070622575,0.0007268095,0.0020338167,0.0011109727,0.015377894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99295455,0.0025196353,0.000356485,0.0010690598,0.001928068,0.0011721303],"domain_scores_gemma":[0.97763664,0.015283905,0.0008575166,0.0041590305,0.001348407,0.00071453827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00756026,0.0030183224,0.004263189,0.0026636461,0.0019012964,0.006635142,0.009526205,0.004396179,0.020323604],"category_scores_gemma":[0.032741126,0.0023418365,0.003429019,0.008419082,0.0023591588,0.012805447,0.0043859147,0.009871351,0.0040351734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014363839,0.0013607336,0.0012802747,0.00065398985,0.00019722592,0.00012226168,0.00036525304,0.3916707,0.0018148869,0.18836635,0.04696478,0.36576715],"study_design_scores_gemma":[0.00023940452,0.000076178905,0.00018010811,0.0000580619,0.00006252326,0.000084335064,0.00007438506,0.8503683,0.00056229066,0.14506786,0.003204126,0.000022395488],"about_ca_topic_score_codex":0.0069839526,"about_ca_topic_score_gemma":0.008882204,"teacher_disagreement_score":0.020323604,"about_ca_system_score_codex":0.0064812466,"about_ca_system_score_gemma":0.0062811994,"threshold_uncertainty_score":0.06798923},"labels":[],"label_agreement":null},{"id":"W4412806992","doi":"10.1007/978-981-95-0695-8_21","title":"Joint Sparse Precision Matrix Estimation for Cancer Diagnosis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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 Saskatchewan","funders":"","keywords":"Computer science; Joint (building); Matrix (chemical analysis); Estimation; Artificial intelligence; Cancer; Sparse matrix; Pattern recognition (psychology); Algorithm; Medicine","score_opus":0.02353686358563184,"score_gpt":0.30558390447726896,"score_spread":0.2820470408916371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412806992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019335076,0.000654798,0.9960751,0.00021202795,0.000041892486,0.000017498913,0.00015886567,0.0004618066,0.0004443981],"genre_scores_gemma":[0.15204547,0.0017139992,0.8346757,0.0003429048,0.000341536,0.00018704272,0.00164445,0.00021528856,0.008833542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994092,0.00020391132,0.000031796168,0.00012921762,0.00017899297,0.00004688055],"domain_scores_gemma":[0.9981217,0.0012565964,0.00010216879,0.00020550047,0.00027836527,0.00003572882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136621,0.00081248005,0.0012584319,0.0008298039,0.00035245655,0.00083039515,0.0011541102,0.0011884181,0.0032748887],"category_scores_gemma":[0.0061495723,0.0006344205,0.00084699615,0.0011947214,0.00048563126,0.0010253335,0.00130183,0.0014342853,0.0017041748],"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.00021935895,0.000069418194,0.00070327736,0.00022070823,0.00011563704,0.000062112,0.00006594672,0.22745028,0.008379078,0.014835113,0.014054022,0.733825],"study_design_scores_gemma":[0.000011237634,0.000034609795,0.00028883622,0.00001607831,0.00002355582,0.00006311553,0.00001158739,0.9782119,0.0022749992,0.016956633,0.0020968781,0.000010664221],"about_ca_topic_score_codex":0.0041295104,"about_ca_topic_score_gemma":0.0048917243,"teacher_disagreement_score":0.0041295104,"about_ca_system_score_codex":0.00042664382,"about_ca_system_score_gemma":0.0009123481,"threshold_uncertainty_score":0.010955572},"labels":[],"label_agreement":null},{"id":"W4412807080","doi":"10.1007/978-981-95-0695-8_33","title":"Automated Prediction of Protein Pair Distances Based on Deep Learning: A Novel Approach to Protein Structure Prediction in SCOP","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning in Bioinformatics","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":"Thompson Rivers University","funders":"","keywords":"Computer science; Protein structure prediction; Artificial intelligence; Deep learning; Machine learning; Pattern recognition (psychology); Protein structure; Chemistry","score_opus":0.006670504615950539,"score_gpt":0.22438481692959705,"score_spread":0.21771431231364652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412807080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11340772,0.0013966959,0.8676899,0.00042894177,0.00014564782,0.00013983337,0.0019384774,0.009117286,0.005735522],"genre_scores_gemma":[0.42499825,0.0010563589,0.55943143,0.0002511567,0.000106493404,0.00018120234,0.0056525245,0.0006988235,0.007623751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964845,0.000039309598,0.00002195653,0.00008463984,0.00015711413,0.000048594142],"domain_scores_gemma":[0.99939203,0.00019570687,0.000064950844,0.00014123796,0.00015948943,0.00004652162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004946122,0.0010765437,0.0011894964,0.0012185635,0.0005432172,0.0011294048,0.0018981375,0.000951459,0.003230517],"category_scores_gemma":[0.0011834262,0.0005811407,0.00086523703,0.0016330851,0.00039692048,0.0017827343,0.0013137207,0.0018611914,0.0015625114],"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.00025587354,0.0004009781,0.0049384953,0.00022236531,0.00014195906,0.00016803465,0.00007241597,0.22681177,0.021952616,0.009889823,0.019991625,0.71515405],"study_design_scores_gemma":[0.0000075170306,0.000019046993,0.00046706098,0.000009000955,0.000009830599,0.000029535862,0.000008787671,0.99024,0.003121161,0.005065272,0.0010159757,0.000006770372],"about_ca_topic_score_codex":0.0070937546,"about_ca_topic_score_gemma":0.013173753,"teacher_disagreement_score":0.0070937546,"about_ca_system_score_codex":0.0008783842,"about_ca_system_score_gemma":0.0013054768,"threshold_uncertainty_score":0.014104962},"labels":[],"label_agreement":null},{"id":"W4412807140","doi":"10.1007/978-981-95-0695-8_16","title":"Simulating Viral Evolution and Immune Escape Reinfection Dynamics Using Agent-Based Modelling","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","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 Saskatchewan","funders":"","keywords":"Computer science; Dynamics (music); Immune escape; Immune system; Biology; Physics; Immunology","score_opus":0.10454781101216887,"score_gpt":0.3523804804642408,"score_spread":0.24783266945207194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412807140","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.5997277,0.0010823925,0.3684946,0.0010861523,0.00024061491,0.0001267059,0.0006772719,0.0005584792,0.0280061],"genre_scores_gemma":[0.9583628,0.00042416045,0.032944426,0.00009896711,0.000041316183,0.000089663794,0.00022430606,0.000069115085,0.007745157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997775,0.000091319176,0.000011617583,0.000040545947,0.00003614912,0.000042987787],"domain_scores_gemma":[0.99825495,0.0013963082,0.000119491175,0.000055532746,0.000083983265,0.00008974483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053712993,0.00063428807,0.0010951572,0.00057461933,0.0005426596,0.0014920138,0.0015671842,0.0023872172,0.0034398213],"category_scores_gemma":[0.0030550081,0.0007772645,0.0010549985,0.000641087,0.0007539324,0.0014221403,0.0008390961,0.0011178667,0.00043591802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012141496,0.000015324567,0.00039334962,0.000009694688,0.000011730405,0.000021640346,0.000013479176,0.9962729,0.00025807705,0.0020177697,0.00007802261,0.0008959082],"study_design_scores_gemma":[0.000004109894,0.000004681022,0.000068492416,0.0000012753342,0.0000031926304,0.0000040348814,0.000003660592,0.998713,0.00005070327,0.001058013,0.000086364154,0.0000024365972],"about_ca_topic_score_codex":0.021865347,"about_ca_topic_score_gemma":0.0112111475,"teacher_disagreement_score":0.021865347,"about_ca_system_score_codex":0.0011488391,"about_ca_system_score_gemma":0.00082108425,"threshold_uncertainty_score":0.043476164},"labels":[],"label_agreement":null},{"id":"W4412808065","doi":"10.1007/978-3-031-99536-1_14","title":"Insensitive Games: Game Semantics for Modal Insensitivity","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Modal; Semantics (computer science); Combinatorial game theory; Theoretical computer science; Programming language; Game theory; Sequential game; Mathematical economics; Mathematics","score_opus":0.016979666242938698,"score_gpt":0.25112352639241425,"score_spread":0.23414386014947555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412808065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012067518,0.00057331746,0.91056544,0.0013150014,0.00027106793,0.00013425863,0.00026413187,0.00073064346,0.0740786],"genre_scores_gemma":[0.72895396,0.0011301596,0.20958708,0.0011064749,0.0004154961,0.000586792,0.00051632064,0.0005867565,0.05711708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845636,0.0005575828,0.000105715764,0.0002544983,0.00039582365,0.00022999152],"domain_scores_gemma":[0.99892455,0.00060227304,0.00006501364,0.00016257574,0.00013396998,0.000111567366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015215665,0.0014498457,0.0008113358,0.0013064382,0.0014500266,0.0041856454,0.0026262165,0.0017706024,0.009048848],"category_scores_gemma":[0.0037447854,0.0008100866,0.001509369,0.001055275,0.0044473726,0.008614746,0.0032814045,0.0054745967,0.0014455492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016030957,0.000013617447,0.000019955814,0.000020566575,0.000005148405,0.000026553822,0.00015436542,0.0015376934,0.00036165412,0.99375594,0.0009450502,0.0031433282],"study_design_scores_gemma":[0.000008558044,0.000007296067,0.000024888865,0.000009681244,0.0000081589815,0.000027488628,0.000045611163,0.011364864,0.00038216703,0.9828655,0.0052465294,0.000009203024],"about_ca_topic_score_codex":0.002612261,"about_ca_topic_score_gemma":0.0018754211,"teacher_disagreement_score":0.009048848,"about_ca_system_score_codex":0.0022521396,"about_ca_system_score_gemma":0.0008275183,"threshold_uncertainty_score":0.030271411},"labels":[],"label_agreement":null},{"id":"W4412810290","doi":"10.1007/978-981-95-0698-9_29","title":"Contrastive Learning-Based Method for Single-Cell Multi-omics Data Clustering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Single-cell and spatial transcriptomics","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 Calgary","funders":"","keywords":"Computer science; Cluster analysis; Artificial intelligence; Data mining; Pattern recognition (psychology)","score_opus":0.037311488451359176,"score_gpt":0.2850430191991152,"score_spread":0.247731530747756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412810290","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.0019676418,0.00022813467,0.9964567,0.00006584279,0.000044010416,0.000032569435,0.00009753575,0.0007247464,0.00038279843],"genre_scores_gemma":[0.03213188,0.00027020267,0.9630075,0.00015032504,0.00007519675,0.0001596522,0.0007224308,0.00028135616,0.0032014141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908125,0.00019508429,0.00005812718,0.00030621633,0.00027012697,0.000089151166],"domain_scores_gemma":[0.99862707,0.0005745854,0.00007184667,0.00018504275,0.0004825106,0.00005887141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022060794,0.0011127987,0.0014555986,0.0015688818,0.00078952394,0.001345492,0.0033455645,0.0016468429,0.003684424],"category_scores_gemma":[0.0027594182,0.00057943247,0.0016644472,0.0021877498,0.00074336206,0.0011260922,0.0018329568,0.0022393835,0.0026954173],"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.00026432416,0.00017077917,0.00088092167,0.00022080097,0.00019287257,0.00009657595,0.00011555785,0.08909755,0.043266658,0.010708841,0.009616619,0.84536844],"study_design_scores_gemma":[0.000007899658,0.000029316856,0.00041933666,0.000010327364,0.000024718624,0.00006738714,0.000015432684,0.9820701,0.00929256,0.0047171935,0.0033290917,0.00001676209],"about_ca_topic_score_codex":0.005514617,"about_ca_topic_score_gemma":0.0074310065,"teacher_disagreement_score":0.005514617,"about_ca_system_score_codex":0.0011735723,"about_ca_system_score_gemma":0.0015818411,"threshold_uncertainty_score":0.0123256445},"labels":[],"label_agreement":null},{"id":"W4412852478","doi":"10.1007/978-3-031-96628-6_3","title":"PathTTT: Test-Time Training with Meta-auxiliary Learning for Pathology Image Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Contextual image classification; Test (biology); Pattern recognition (psychology); Image (mathematics); Training (meteorology); Machine learning; Natural language processing","score_opus":0.0358980018059981,"score_gpt":0.2631283829052097,"score_spread":0.22723038109921156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412852478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02097637,0.0011062473,0.88972986,0.00037393344,0.00046881972,0.00029397546,0.0021319347,0.08038824,0.004530688],"genre_scores_gemma":[0.24731904,0.0003555189,0.7199452,0.0006407676,0.00020527426,0.0006778403,0.010160791,0.003831886,0.016863566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892384,0.00021714893,0.000055114688,0.00043614383,0.00020912924,0.00015865652],"domain_scores_gemma":[0.9982338,0.00077514275,0.000057535195,0.000563239,0.00026909928,0.00010127126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016231595,0.002067183,0.001430553,0.0010629107,0.0006835414,0.001397828,0.004580267,0.0028311359,0.014909514],"category_scores_gemma":[0.004166272,0.0011725326,0.0018061151,0.0012986857,0.00079793955,0.002745629,0.0032125758,0.0035252117,0.008880878],"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.00072720816,0.00029194306,0.0015142529,0.00018057898,0.00020661825,0.00014348695,0.00007287087,0.052557472,0.009943735,0.002048319,0.04074518,0.89156836],"study_design_scores_gemma":[0.00010815647,0.00024675825,0.0005541317,0.000032808475,0.000073787895,0.00013687562,0.00003676345,0.97221214,0.011059507,0.008051246,0.0074631674,0.00002466106],"about_ca_topic_score_codex":0.005373886,"about_ca_topic_score_gemma":0.008874371,"teacher_disagreement_score":0.014909514,"about_ca_system_score_codex":0.00085143576,"about_ca_system_score_gemma":0.0019871092,"threshold_uncertainty_score":0.049877286},"labels":[],"label_agreement":null},{"id":"W4412856611","doi":"10.1007/978-3-031-97769-5_14","title":"The Development of a No-Code VR Authoring Platform for Post-Secondary Educators","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","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":"General Motors (Canada); Ontario Tech University","funders":"","keywords":"Computer science; Code (set theory); Human–computer interaction; Multimedia; Programming language; Development (topology); Software engineering; Computer graphics (images)","score_opus":0.02528528689197598,"score_gpt":0.2875525140970356,"score_spread":0.2622672272050596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412856611","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.08437356,0.00026400632,0.7454571,0.00092480826,0.00067668775,0.0019349784,0.0008777956,0.10995554,0.055535503],"genre_scores_gemma":[0.12454345,0.00036911934,0.7595158,0.00034298512,0.00010928371,0.0009766582,0.002691903,0.015567487,0.09588322],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990007,0.00015740182,0.00008077309,0.00015061875,0.0005065149,0.000103983795],"domain_scores_gemma":[0.9963458,0.0011671673,0.00014568423,0.00067459146,0.0010235684,0.00064308697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019942238,0.0006501795,0.00036710454,0.0008576952,0.00061328715,0.002798001,0.0025231997,0.0012728603,0.019380782],"category_scores_gemma":[0.006973933,0.0006553505,0.0005492658,0.00039269804,0.0003860189,0.0027968518,0.002892909,0.0018553353,0.0075694392],"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.00039117972,0.0013330543,0.0022897718,0.0003650784,0.000033075947,0.0009067016,0.0037542996,0.0037822674,0.085983954,0.010935168,0.052910056,0.83731544],"study_design_scores_gemma":[0.00056121155,0.0018067646,0.00932402,0.00068094337,0.00014264464,0.0024507279,0.0017818706,0.13296875,0.13569206,0.008903175,0.70531446,0.00037330276],"about_ca_topic_score_codex":0.0014084553,"about_ca_topic_score_gemma":0.0024839386,"teacher_disagreement_score":0.019380782,"about_ca_system_score_codex":0.00042111138,"about_ca_system_score_gemma":0.0017788834,"threshold_uncertainty_score":0.06483519},"labels":[],"label_agreement":null},{"id":"W4412863170","doi":"10.1007/978-981-95-0218-9_11","title":"Vertex-Critical $$(P_5,W_4)$$-Free Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Prince Edward Island; Acadia University","funders":"","keywords":"Computer science; Vertex (graph theory); Combinatorics; Graph; Theoretical computer science; Mathematics","score_opus":0.017836022691292343,"score_gpt":0.2949606395636925,"score_spread":0.27712461687240014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412863170","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.38099042,0.0010654323,0.11395874,0.0023880468,0.00064908975,0.0002206662,0.0018182823,0.001172178,0.49773714],"genre_scores_gemma":[0.7876825,0.0008140458,0.037064854,0.00062655134,0.00015377541,0.00013171586,0.0018599669,0.00061252597,0.17105402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986863,0.000017585455,0.000004591488,0.00003264694,0.000029593708,0.000046884346],"domain_scores_gemma":[0.9996259,0.000120028664,0.000040942243,0.000048933827,0.00006775097,0.0000963539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015941774,0.0005645044,0.00033052752,0.0010479271,0.0016937468,0.0013612553,0.0008500949,0.0005335339,0.020142091],"category_scores_gemma":[0.00076398795,0.00046425086,0.00032599262,0.00090501184,0.0008599574,0.0018085127,0.00094229,0.0012479489,0.0028636586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015867388,0.000055384975,0.0005150864,0.00019010656,0.000018185483,0.00035778023,0.00027975717,0.0021335802,0.012300334,0.92123234,0.028962966,0.033795834],"study_design_scores_gemma":[0.000031278498,0.0000330658,0.0007303861,0.000048801954,0.000032264,0.00038041687,0.00021233708,0.004702849,0.011394204,0.92271155,0.05970431,0.000018528805],"about_ca_topic_score_codex":0.0013319004,"about_ca_topic_score_gemma":0.0028818564,"teacher_disagreement_score":0.020142091,"about_ca_system_score_codex":0.00066809397,"about_ca_system_score_gemma":0.00051778177,"threshold_uncertainty_score":0.06738198},"labels":[],"label_agreement":null},{"id":"W4412874007","doi":"10.1007/978-3-031-98459-4_20","title":"Beyond Static Measures: Temporal Analysis of Lexical Alignment in Human-Human Learning With a Teachable Robot","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue 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":"McGill University","funders":"","keywords":"Computer science; Robot; Artificial intelligence; Human–computer interaction; Human–robot interaction; Natural language processing; Computer vision","score_opus":0.018535130373837708,"score_gpt":0.26561175185105806,"score_spread":0.24707662147722037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412874007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3879113,0.002662335,0.5936314,0.0004437153,0.00014510364,0.000065761844,0.0008597381,0.0015442623,0.01273636],"genre_scores_gemma":[0.9303061,0.00035906344,0.064809605,0.000050016475,0.00004996227,0.000044190852,0.00056373974,0.00035045264,0.0034668306],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993717,0.00021189326,0.000037338938,0.00017103241,0.00014754773,0.00006055982],"domain_scores_gemma":[0.99691296,0.0020244666,0.0002899504,0.0002441336,0.0003734056,0.00015510649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012180656,0.00032268808,0.0004524683,0.001902035,0.00055645395,0.0020043345,0.0007298225,0.0004691312,0.0042103105],"category_scores_gemma":[0.0067088758,0.00025082016,0.00031679642,0.0026913353,0.00060983596,0.0028442228,0.0009740471,0.00071691733,0.0010708139],"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.0012619676,0.0003412535,0.022305237,0.0003305893,0.00018345399,0.0004255284,0.0016329002,0.031270813,0.06806362,0.04055144,0.0049158786,0.8287173],"study_design_scores_gemma":[0.00003437565,0.00033685233,0.06947474,0.0000798059,0.00010506657,0.0004057896,0.0023090267,0.78559196,0.02074023,0.1128607,0.007959649,0.00010178187],"about_ca_topic_score_codex":0.0033486534,"about_ca_topic_score_gemma":0.0040886793,"teacher_disagreement_score":0.0042103105,"about_ca_system_score_codex":0.00049646286,"about_ca_system_score_gemma":0.0005947522,"threshold_uncertainty_score":0.014084935},"labels":[],"label_agreement":null},{"id":"W4412874171","doi":"10.1007/978-3-031-98459-4_5","title":"Math Education With Large Language Models: Peril or Promise?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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 Toronto","funders":"","keywords":"Computer science; Mathematics education; Programming language; Theoretical computer science; Mathematics","score_opus":0.018829410463367082,"score_gpt":0.272015009528283,"score_spread":0.25318559906491594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412874171","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029766513,0.012763341,0.6087668,0.16974455,0.002570679,0.00010373816,0.0018102422,0.010355677,0.1641185],"genre_scores_gemma":[0.54620194,0.012958896,0.30185387,0.015939152,0.0041449587,0.000412054,0.003712729,0.0020635168,0.11271276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987161,0.0006725754,0.000037270132,0.00016136753,0.0003171023,0.00009562351],"domain_scores_gemma":[0.97766966,0.017699646,0.00035569485,0.0026535783,0.0008836952,0.00073774264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036714205,0.00075080787,0.0010164125,0.0005012092,0.0005745819,0.00496892,0.002283922,0.0019555283,0.039888773],"category_scores_gemma":[0.023418093,0.00067151076,0.0012150429,0.00064715644,0.0023168956,0.01974539,0.0027387075,0.0058076507,0.009124141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023783786,0.0004391271,0.0013880112,0.00042637708,0.00008249837,0.00007477868,0.00043710505,0.013594478,0.00063730066,0.5919669,0.12488723,0.26582825],"study_design_scores_gemma":[0.00005207324,0.000036833204,0.00020336737,0.0001019915,0.000020296735,0.000040327017,0.00013360672,0.035485417,0.00055759895,0.9019212,0.061430242,0.000016967066],"about_ca_topic_score_codex":0.0033343944,"about_ca_topic_score_gemma":0.0049096975,"teacher_disagreement_score":0.039888773,"about_ca_system_score_codex":0.0013765417,"about_ca_system_score_gemma":0.0022799063,"threshold_uncertainty_score":0.13344121},"labels":[],"label_agreement":null},{"id":"W4412898049","doi":"10.1007/978-3-031-99984-0_30","title":"Exploiting Instantiations from Paramodulation Proofs in Isabelle/HOL","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"HOL; Mathematical proof; Computer science; Programming language; Automated theorem proving; Mathematics","score_opus":0.026545052309748098,"score_gpt":0.25271693896535063,"score_spread":0.22617188665560253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412898049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014796233,0.0030330282,0.8611687,0.0015697858,0.00073782715,0.00017649384,0.00037066013,0.011518852,0.106628336],"genre_scores_gemma":[0.2650634,0.004777668,0.6570943,0.0009723246,0.0006108889,0.0002585786,0.0012485919,0.008142867,0.061831348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980287,0.00063762016,0.000080624886,0.00020397852,0.00089784886,0.00015109903],"domain_scores_gemma":[0.995749,0.003100407,0.00015488034,0.0006114494,0.00028866687,0.00009558559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026320557,0.00076962146,0.0006024641,0.0018355411,0.0010729812,0.0036078463,0.001788707,0.00070813985,0.015432115],"category_scores_gemma":[0.0062605417,0.00106456,0.0011994867,0.0012017929,0.002160953,0.0049132253,0.0027536168,0.003413102,0.0045463666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008545872,0.00006628737,0.00041088273,0.00059329165,0.00005133275,0.00074887025,0.0010868973,0.006618542,0.0064550466,0.77548677,0.025967976,0.18242866],"study_design_scores_gemma":[0.00008808998,0.00007942474,0.00043925925,0.0005326826,0.00010547286,0.0012996088,0.0002501286,0.045354128,0.039131194,0.55949646,0.35313743,0.00008615819],"about_ca_topic_score_codex":0.00061152794,"about_ca_topic_score_gemma":0.0012192584,"teacher_disagreement_score":0.015432115,"about_ca_system_score_codex":0.0015720429,"about_ca_system_score_gemma":0.0012121149,"threshold_uncertainty_score":0.05162561},"labels":[],"label_agreement":null},{"id":"W4412906363","doi":"10.1007/978-3-031-98284-2_13","title":"Neuromorphic Knowledge Representation: SNN-Based Relational Inference and Explainability in Knowledge Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Mount Saint Vincent University; Athabasca University","funders":"","keywords":"Neuromorphic engineering; Computer science; Inference; Knowledge representation and reasoning; Representation (politics); Knowledge graph; Artificial intelligence; Artificial neural network","score_opus":0.05698086356223504,"score_gpt":0.30898778781963887,"score_spread":0.25200692425740384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412906363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032271102,0.0006306332,0.95085216,0.0010069539,0.00010806898,0.000036494734,0.00035653365,0.0007461298,0.013991897],"genre_scores_gemma":[0.66483563,0.00092058704,0.32310832,0.0003273883,0.00011168471,0.00008742749,0.0011080962,0.00021378891,0.009287018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963796,0.00010662736,0.00003155264,0.00012168532,0.000077632634,0.000024567667],"domain_scores_gemma":[0.99837554,0.00097209925,0.00010789536,0.00033789565,0.00015448783,0.000052045823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066295103,0.00029270037,0.00042503956,0.00081669836,0.00036117938,0.0015509607,0.0013547151,0.00071867055,0.0061458955],"category_scores_gemma":[0.0047689537,0.00033248536,0.0010384802,0.0010971262,0.0010761156,0.003960253,0.0012504982,0.0013011997,0.000625358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081636106,0.00006135196,0.0010665512,0.00020280053,0.000087125656,0.00015500825,0.00038032627,0.06600275,0.0038976339,0.6964512,0.004334359,0.22727929],"study_design_scores_gemma":[0.000004008619,0.000008790819,0.00027723223,0.000024168656,0.00001698131,0.000053899777,0.000032669148,0.28007907,0.0010241162,0.71622294,0.0022483906,0.000007714401],"about_ca_topic_score_codex":0.0024116198,"about_ca_topic_score_gemma":0.0026056378,"teacher_disagreement_score":0.0061458955,"about_ca_system_score_codex":0.00088718766,"about_ca_system_score_gemma":0.0004219619,"threshold_uncertainty_score":0.020560086},"labels":[],"label_agreement":null},{"id":"W4412906444","doi":"10.1007/978-3-031-98284-2_15","title":"Heat of the Moment: Exploring the Influence of Stress and Workload on Facial Temperature Dynamics","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrared Thermography in Medicine","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université de Montréal","funders":"","keywords":"Workload; Computer science; Moment (physics); Dynamics (music); Heat stress; Simulation; Operating system; Physics; Acoustics; Classical mechanics; Atmospheric sciences","score_opus":0.010379228178183653,"score_gpt":0.23438502773114103,"score_spread":0.22400579955295738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412906444","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.9728976,0.0008047259,0.020415198,0.00011038848,0.00003247431,0.000021143713,0.00015743564,0.00004927311,0.0055117183],"genre_scores_gemma":[0.99343586,0.00043263682,0.004301989,0.000018762013,0.000021445372,0.00002022113,0.00008509957,0.00003201482,0.0016519835],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999966,0.000010018878,7.4207816e-7,0.000008185495,0.00000831542,0.000006711785],"domain_scores_gemma":[0.9998592,0.000116988034,0.000008541256,0.0000041223366,0.0000044250555,0.0000066934394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010938846,0.00020185154,0.0002129899,0.00011963359,0.00011156762,0.00046677174,0.00020903173,0.0001857767,0.00286348],"category_scores_gemma":[0.0006501752,0.00013826371,0.00026667077,0.00019455308,0.00023122563,0.00038157884,0.00022712217,0.000192299,0.00017951429],"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.0030469822,0.0003497751,0.054233704,0.000680244,0.0002463293,0.0009169052,0.0037284407,0.09770394,0.46412313,0.009680317,0.0034318308,0.3618584],"study_design_scores_gemma":[0.00006140006,0.0009159857,0.42922363,0.00008748014,0.00016406471,0.0006424992,0.0020343643,0.5279904,0.023258077,0.011894316,0.003632332,0.00009543452],"about_ca_topic_score_codex":0.001879715,"about_ca_topic_score_gemma":0.0024280502,"teacher_disagreement_score":0.00286348,"about_ca_system_score_codex":0.000113387374,"about_ca_system_score_gemma":0.00013114505,"threshold_uncertainty_score":0.009579241},"labels":[],"label_agreement":null},{"id":"W4412914661","doi":"10.1007/978-981-96-9884-4_40","title":"Multi-scale Multi-order Attributed Graph Clustering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Ministry of Agriculture","funders":"","keywords":"Computer science; Cluster analysis; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.019500437558452387,"score_gpt":0.27446470747772833,"score_spread":0.25496426991927595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412914661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018424168,0.00083798287,0.9762156,0.0002825678,0.000115351664,0.000082035476,0.00064368156,0.0009057075,0.002492914],"genre_scores_gemma":[0.4015253,0.0014672255,0.5738798,0.00020022203,0.00028178346,0.00019396565,0.0040528146,0.0007488711,0.017650122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837226,0.0004274201,0.00009830718,0.00053794816,0.00044119442,0.00012292559],"domain_scores_gemma":[0.9949333,0.0021418699,0.00037548813,0.0014652107,0.0008166033,0.00026755861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013139002,0.00088243815,0.0019060757,0.002916216,0.001472843,0.0020834873,0.0038298646,0.0014796434,0.0032016584],"category_scores_gemma":[0.0067959637,0.0009940933,0.001752773,0.0047683157,0.0009989205,0.003138077,0.0025101702,0.0017756798,0.0012955854],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025132592,0.00017554547,0.00315355,0.00053902686,0.00032539442,0.00032453288,0.00040410963,0.6786452,0.0055300514,0.055152506,0.014791922,0.24070692],"study_design_scores_gemma":[0.0000051720804,0.000012585108,0.00058037194,0.000013290877,0.000028579494,0.0000639341,0.000044972447,0.96538734,0.0007057544,0.03085549,0.0022883993,0.000014131128],"about_ca_topic_score_codex":0.006288835,"about_ca_topic_score_gemma":0.012002594,"teacher_disagreement_score":0.006288835,"about_ca_system_score_codex":0.0016089429,"about_ca_system_score_gemma":0.001018927,"threshold_uncertainty_score":0.012504458},"labels":[],"label_agreement":null},{"id":"W4412924371","doi":"10.1007/978-981-96-9921-6_12","title":"A Fault Diagnosis Method Based on Convolutional-Deconvolutional Denoising and Time-Frequency Dual-Path Feature Fusion","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Fault Diagnosis Techniques","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":"Institute of Particle Physics","funders":"","keywords":"Computer science; Dual (grammatical number); Noise reduction; Artificial intelligence; Feature (linguistics); Path (computing); Pattern recognition (psychology); Fusion; Fault (geology); Convolutional neural network; Algorithm","score_opus":0.007774184911722569,"score_gpt":0.26287148987438885,"score_spread":0.2550973049626663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412924371","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.00423562,0.00022999015,0.99428374,0.000057042907,0.0000726176,0.00001936483,0.000033398792,0.0004859222,0.0005821901],"genre_scores_gemma":[0.17955722,0.00055156014,0.8136111,0.00011461362,0.00010724886,0.00004790897,0.0002506091,0.000084232466,0.0056754337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997825,0.000016524253,0.000013673765,0.000064601416,0.00009903515,0.00002365997],"domain_scores_gemma":[0.99978274,0.000047775004,0.00002137833,0.00003140874,0.00010294297,0.000013800163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040035316,0.0007432392,0.0008738176,0.0007018563,0.00036182438,0.0005645507,0.00082585856,0.001134423,0.0017281971],"category_scores_gemma":[0.0006012248,0.00032325275,0.00081774656,0.0004976744,0.00035206453,0.00089699915,0.0006297757,0.0009055557,0.0007793836],"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.00027355368,0.00010962196,0.00067702285,0.00018731468,0.00011398729,0.00014133552,0.000051932486,0.06790614,0.13297482,0.007091733,0.0032813188,0.78719115],"study_design_scores_gemma":[0.000009944804,0.000065075015,0.0006371999,0.000009107634,0.000046412417,0.00023290305,0.000006713831,0.9613147,0.033335786,0.0018690199,0.0024510352,0.000022023401],"about_ca_topic_score_codex":0.002591285,"about_ca_topic_score_gemma":0.0035490387,"teacher_disagreement_score":0.002591285,"about_ca_system_score_codex":0.0004605273,"about_ca_system_score_gemma":0.0008123422,"threshold_uncertainty_score":0.005781412},"labels":[],"label_agreement":null},{"id":"W4412966143","doi":"10.1007/978-3-031-98465-5_57","title":"Chatting with Code: Exploring LLMs as Learning Partners in Programming Education","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Rights Management and Security","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":"Computer science; Code (set theory); Programming language; Multimedia; Artificial intelligence","score_opus":0.02761502498370268,"score_gpt":0.27214657401946146,"score_spread":0.24453154903575877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412966143","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.45004475,0.0019197217,0.111378685,0.012689959,0.00028547383,0.00018605596,0.00007123047,0.0009815177,0.42244267],"genre_scores_gemma":[0.9349656,0.00045734795,0.016844174,0.0005289045,0.00003770058,0.00012341308,0.00005254794,0.00014892679,0.046841457],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.998097,0.0013576271,0.000022391854,0.00012809194,0.00019696953,0.0001979848],"domain_scores_gemma":[0.99506843,0.003439169,0.00022631876,0.00018588797,0.00019463382,0.00088547316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017913687,0.00036286257,0.00019129172,0.00071452704,0.0026616899,0.0076752207,0.0019304114,0.001955225,0.012007333],"category_scores_gemma":[0.0064154034,0.00022876021,0.00023184421,0.0006327861,0.0033486485,0.007980018,0.006355483,0.002227936,0.0017135711],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028256656,0.00076612,0.006994778,0.00039293332,0.000014226549,0.0014388855,0.40111822,0.0011119333,0.0069216313,0.28495547,0.012292507,0.28371078],"study_design_scores_gemma":[0.00009776047,0.0005150058,0.004239749,0.0008492067,0.00004390508,0.0018996057,0.51295894,0.016310804,0.005336854,0.18527825,0.272398,0.00007201315],"about_ca_topic_score_codex":0.0014501993,"about_ca_topic_score_gemma":0.0034923176,"teacher_disagreement_score":0.012007333,"about_ca_system_score_codex":0.0016217413,"about_ca_system_score_gemma":0.002266414,"threshold_uncertainty_score":0.040168524},"labels":[],"label_agreement":null},{"id":"W4413003186","doi":"10.1007/978-3-031-96625-5_21","title":"ToothForge: Automatic Dental Shape Generation Using Synchronized Spectral Embeddings","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.01494470450855207,"score_gpt":0.2402665004527502,"score_spread":0.22532179594419813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413003186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007222129,0.00027513033,0.9565222,0.00007727417,0.00019036577,0.0001514787,0.0010289692,0.03179181,0.002740641],"genre_scores_gemma":[0.052555345,0.00026932286,0.9303752,0.0001011312,0.000050721188,0.00018711861,0.0039808406,0.004412745,0.008067529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963045,0.000029541885,0.00001541487,0.00011314673,0.0001711547,0.000040335206],"domain_scores_gemma":[0.99973375,0.00007750935,0.000016439672,0.00007966087,0.00006854608,0.000024040879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047729,0.0014842227,0.001075738,0.0015866584,0.0004313294,0.0012713439,0.0019859152,0.0013868125,0.029901842],"category_scores_gemma":[0.0010602019,0.0011130298,0.0014270371,0.0011648146,0.00037900696,0.0013884241,0.002553905,0.0010358479,0.014305845],"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.00031745317,0.000082701874,0.00043195373,0.0002034112,0.000068561676,0.00015005139,0.00010970312,0.010311451,0.0444451,0.003400954,0.030078188,0.91040045],"study_design_scores_gemma":[0.00016761407,0.00022424708,0.0021384251,0.0000817694,0.00009119618,0.0011941455,0.00022207016,0.81569254,0.09784718,0.016234262,0.06597617,0.00013037163],"about_ca_topic_score_codex":0.0012524895,"about_ca_topic_score_gemma":0.003478796,"teacher_disagreement_score":0.029901842,"about_ca_system_score_codex":0.00032167445,"about_ca_system_score_gemma":0.00059032824,"threshold_uncertainty_score":0.100031614},"labels":[],"label_agreement":null},{"id":"W4413003197","doi":"10.1007/978-3-031-96625-5_10","title":"MAD-AD: Masked Diffusion for Unsupervised Brain Anomaly Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"","keywords":"Computer science; Anomaly detection; Diffusion; Artificial intelligence; Pattern recognition (psychology); Physics","score_opus":0.011782059464458334,"score_gpt":0.2467004645494136,"score_spread":0.23491840508495526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413003197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051258546,0.00027658965,0.98356795,0.00012191511,0.00012928188,0.000041469364,0.0004860651,0.009441719,0.0008091001],"genre_scores_gemma":[0.082589544,0.0003630021,0.906636,0.00011164644,0.00011184423,0.0001029879,0.0015737804,0.0012581565,0.007253004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997559,0.000035395016,0.000012285711,0.00007701121,0.0000934649,0.000025925074],"domain_scores_gemma":[0.9995485,0.00016974148,0.000034393503,0.00010280016,0.000113458475,0.000031080654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060206425,0.0010114826,0.0008930418,0.0008580442,0.0004322067,0.0008854087,0.0013883078,0.0010220532,0.0048745135],"category_scores_gemma":[0.0017274504,0.00044567042,0.0007525076,0.0007889674,0.00038522834,0.00082356465,0.0010621176,0.001263572,0.002206535],"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.00038957706,0.00010505874,0.0009869398,0.00021600898,0.00016757881,0.00017582219,0.00008204925,0.055280346,0.04710105,0.011004813,0.032763846,0.851727],"study_design_scores_gemma":[0.00002066548,0.00004487154,0.0005294256,0.000010865036,0.000022123595,0.00017936004,0.000013536656,0.9564302,0.022073433,0.012423422,0.008228278,0.00002385406],"about_ca_topic_score_codex":0.003178772,"about_ca_topic_score_gemma":0.0055386196,"teacher_disagreement_score":0.0048745135,"about_ca_system_score_codex":0.0004092285,"about_ca_system_score_gemma":0.0007294832,"threshold_uncertainty_score":0.016306937},"labels":[],"label_agreement":null},{"id":"W4413025253","doi":"10.1007/978-3-032-00891-6_28","title":"Enhancing Ultra-Low-Bit Quantization of Large Language Models Through Saliency-Aware Partial Retraining","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Retraining; Quantization (signal processing); Bit (key); Artificial intelligence; Speech recognition; Computer vision; Computer network","score_opus":0.02045388212035081,"score_gpt":0.2747283330984558,"score_spread":0.25427445097810497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413025253","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.040352635,0.0022657162,0.9460774,0.00075821526,0.00038216356,0.00007545922,0.0005043741,0.006314085,0.0032699015],"genre_scores_gemma":[0.5857134,0.0011297582,0.39934537,0.0010517242,0.0002804849,0.00013198976,0.0014829319,0.00068150193,0.0101828175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996043,0.000085941545,0.0000252306,0.00009064831,0.00014402371,0.000049781003],"domain_scores_gemma":[0.99896145,0.00055221544,0.000055563407,0.00016437213,0.00020958275,0.000056781064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062067545,0.0010579742,0.0008362975,0.00045115987,0.00036355958,0.00081889366,0.0011353915,0.00082155335,0.0055093006],"category_scores_gemma":[0.0034905758,0.0003350181,0.0004119924,0.0006101517,0.0003931438,0.0018981753,0.001258148,0.0015181133,0.0022987658],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054365495,0.00025107694,0.0006342722,0.000254359,0.00007527662,0.00022458835,0.00017394345,0.067050144,0.09183444,0.00594007,0.011309206,0.82170886],"study_design_scores_gemma":[0.000023386614,0.000115176954,0.00035165536,0.00002014501,0.000026801226,0.000100698926,0.000031882653,0.97298265,0.018088335,0.0058856127,0.0023545583,0.000019023573],"about_ca_topic_score_codex":0.0058100577,"about_ca_topic_score_gemma":0.014151216,"teacher_disagreement_score":0.0058100577,"about_ca_system_score_codex":0.0004497984,"about_ca_system_score_gemma":0.0009116894,"threshold_uncertainty_score":0.018430412},"labels":[],"label_agreement":null},{"id":"W4413028888","doi":"10.1007/978-3-032-00800-8_20","title":"Which Consciousness Can Be Artificialized? Local Percept-Perceiver Phenomenon for the Existence of Machine Consciousness","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"Percept; Consciousness; Phenomenon; Computer science; Cognitive science; Artificial intelligence; Cognitive psychology; Psychology; Epistemology; Perception; Philosophy; Neuroscience","score_opus":0.02752114638250134,"score_gpt":0.26490488347339036,"score_spread":0.23738373709088903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413028888","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.066034645,0.020914055,0.3394135,0.03444018,0.0028670924,0.00007971364,0.0002609234,0.0011391402,0.5348507],"genre_scores_gemma":[0.91736233,0.0045051007,0.039313495,0.0028470096,0.0012885357,0.00011346247,0.00011644607,0.00024827427,0.034205325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981755,0.000051739607,0.000008262082,0.000058620608,0.000043675453,0.00002026013],"domain_scores_gemma":[0.999585,0.00024596433,0.000022323882,0.00008424816,0.000034022978,0.000028484632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058542384,0.00026436057,0.00050571124,0.0003779801,0.0007080123,0.0022164742,0.00073248136,0.0013474411,0.0076479977],"category_scores_gemma":[0.0015106961,0.00018207003,0.0005707113,0.0003160983,0.0052304342,0.0061807,0.0012629541,0.0031192445,0.0012210662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014108447,0.0000048810944,0.00004624178,0.000054821638,0.00000526876,0.000048306207,0.00017741608,0.0001635631,0.0014555854,0.9906425,0.00156623,0.0058211233],"study_design_scores_gemma":[0.0000041585954,0.000015214587,0.00012175704,0.000019208768,0.000006409732,0.00011704236,0.00006479097,0.001704113,0.0006904008,0.99007237,0.0071770507,0.000007403063],"about_ca_topic_score_codex":0.00017589479,"about_ca_topic_score_gemma":0.00016833191,"teacher_disagreement_score":0.0076479977,"about_ca_system_score_codex":0.0005567152,"about_ca_system_score_gemma":0.00027241214,"threshold_uncertainty_score":0.025585055},"labels":[],"label_agreement":null},{"id":"W4413028897","doi":"10.1007/978-3-032-00800-8_30","title":"Value Under Ignorance in Universal Artificial Intelligence","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ignorance; Computer science; Value (mathematics); Artificial intelligence; Machine learning; Philosophy; Epistemology","score_opus":0.025253699761867872,"score_gpt":0.26169167897867796,"score_spread":0.2364379792168101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413028897","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.07309751,0.02785041,0.29071575,0.030732667,0.0013061053,0.00006414071,0.0002350086,0.00018820458,0.57581025],"genre_scores_gemma":[0.96191436,0.004661278,0.015398195,0.0010442849,0.0013613394,0.00008094523,0.0000770974,0.000068708265,0.015393701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847084,0.0007391778,0.00007207067,0.00019674267,0.0003743981,0.00014691762],"domain_scores_gemma":[0.9963426,0.0027807257,0.00013850373,0.0004437087,0.00019138303,0.00010309602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027391359,0.00045265857,0.0008541649,0.0011979607,0.0013874051,0.0044437046,0.0009328271,0.0016163612,0.0028702002],"category_scores_gemma":[0.0068080444,0.0005522854,0.0005854872,0.001566612,0.01595832,0.0128926365,0.0022826707,0.0046511656,0.00032975135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004007882,0.0000020782213,0.00002586498,0.00001357482,0.0000029561572,0.000008949565,0.00009966509,0.00026238954,0.000025113155,0.9968888,0.00036366386,0.0023030418],"study_design_scores_gemma":[8.7787714e-7,8.575248e-7,0.00001153955,0.0000041630774,0.0000011785054,0.0000048515276,0.000009836472,0.00019230437,0.000013982138,0.99894553,0.0008141907,7.40372e-7],"about_ca_topic_score_codex":0.000896642,"about_ca_topic_score_gemma":0.0005969634,"teacher_disagreement_score":0.0044437046,"about_ca_system_score_codex":0.0029315378,"about_ca_system_score_gemma":0.0008017176,"threshold_uncertainty_score":0.021269858},"labels":[],"label_agreement":null},{"id":"W4413069729","doi":"10.1007/978-3-031-98414-3_29","title":"Personalizing Explanations of AI-Driven Hints to Users’ Characteristics: An Empirical Evaluation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Empirical research; Human–computer interaction; Information retrieval; Epistemology","score_opus":0.06512646958833557,"score_gpt":0.3558005587983916,"score_spread":0.29067408921005605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413069729","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.97030926,0.00079149887,0.023349991,0.00033727536,0.00003840288,0.0005413529,0.00053043506,0.0019644096,0.002137364],"genre_scores_gemma":[0.97714764,0.00025167855,0.020226436,0.00010652086,0.000030298053,0.00024129136,0.0008297306,0.00017248048,0.0009939854],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9891194,0.0072728773,0.0006550532,0.0010995697,0.0016195986,0.00023353346],"domain_scores_gemma":[0.52841765,0.4283023,0.012987609,0.02120434,0.0065188697,0.002569181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015169482,0.0009456506,0.00059640926,0.00159731,0.0005742465,0.0025316975,0.0019127841,0.0024437483,0.0037742248],"category_scores_gemma":[0.21889432,0.00062987057,0.0007227148,0.0011859693,0.0009317358,0.004130232,0.0019940834,0.0023521674,0.0010357779],"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.022991743,0.008592276,0.31585768,0.0039062505,0.001555487,0.0006312358,0.035549503,0.03369966,0.01439688,0.005822489,0.0059515797,0.5510452],"study_design_scores_gemma":[0.005324514,0.023079894,0.38323906,0.0016569573,0.0052491385,0.00196125,0.017258171,0.4595445,0.043751914,0.031870365,0.026401732,0.0006625247],"about_ca_topic_score_codex":0.002187627,"about_ca_topic_score_gemma":0.001549931,"teacher_disagreement_score":0.015169482,"about_ca_system_score_codex":0.0007948531,"about_ca_system_score_gemma":0.0012860873,"threshold_uncertainty_score":0.08022487},"labels":[],"label_agreement":null},{"id":"W4413070981","doi":"10.1007/978-3-031-98414-3_19","title":"Prompts Eliciting Active and Constructive Engagement Improve Learning Across ChatGPT and Traditional Resource Contexts","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Online Learning and Analytics","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":"Constructive; Computer science; Resource (disambiguation); Artificial intelligence; Knowledge management; Human–computer interaction; Programming language","score_opus":0.014602599420157444,"score_gpt":0.2665489314719274,"score_spread":0.2519463320517699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413070981","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.9188339,0.00071868004,0.056651294,0.0005447153,0.00045800235,0.0010935209,0.00054487324,0.0029762194,0.018178875],"genre_scores_gemma":[0.94009143,0.0003249654,0.0487652,0.00030633688,0.000069942376,0.0011362702,0.00045819907,0.00035900308,0.008488664],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984754,0.00061988016,0.00009061011,0.00031195284,0.00034748553,0.00015478127],"domain_scores_gemma":[0.99274135,0.005502956,0.0003974672,0.00049557124,0.00038399425,0.00047859023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015019908,0.0005050116,0.0005922754,0.00038060805,0.000498077,0.0015096191,0.0007309752,0.000825659,0.012031324],"category_scores_gemma":[0.014290919,0.00028683824,0.00022037489,0.0003536799,0.00037732106,0.0013395068,0.0026430516,0.0010770715,0.002327448],"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.008114022,0.0054566013,0.008718959,0.0033038408,0.000078633144,0.00040845491,0.01196479,0.0027260338,0.2813894,0.0026556437,0.008358845,0.6668249],"study_design_scores_gemma":[0.0057445266,0.038834117,0.23441193,0.0038668148,0.0014509673,0.0015462592,0.031342525,0.06488518,0.48105195,0.04606868,0.090296395,0.00050067867],"about_ca_topic_score_codex":0.0005326094,"about_ca_topic_score_gemma":0.0015447984,"teacher_disagreement_score":0.012031324,"about_ca_system_score_codex":0.0003114871,"about_ca_system_score_gemma":0.0008014426,"threshold_uncertainty_score":0.04024875},"labels":[],"label_agreement":null},{"id":"W4413071331","doi":"10.1007/978-3-031-98740-3_30","title":"Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Transportation and Mobility Innovations","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":"","keywords":"Computer science; Mile; Last mile (transportation); Set (abstract data type); Programming language; Geography","score_opus":0.012285131425248657,"score_gpt":0.2248702768440449,"score_spread":0.21258514541879625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413071331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18200512,0.0018983256,0.7871224,0.0005281771,0.00035510183,0.000247664,0.0012143977,0.002327456,0.024301346],"genre_scores_gemma":[0.7890555,0.0006337572,0.19587743,0.00012393662,0.00013860891,0.00012451001,0.0011448844,0.00028849594,0.012612768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.000127128,0.00003261858,0.00017278365,0.00015248598,0.00025381037],"domain_scores_gemma":[0.99944705,0.00022011045,0.000038447095,0.00014125463,0.00008957146,0.00006353786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045003428,0.00103778,0.002576571,0.0007853777,0.0013164135,0.0018402936,0.0019002,0.0011784503,0.009712314],"category_scores_gemma":[0.0013494529,0.0007654692,0.0011351602,0.0017935358,0.0005631673,0.002462213,0.0017214426,0.00095268,0.00093423284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065732445,0.00021837604,0.00089946593,0.0002791047,0.00007520025,0.0002398817,0.00015091049,0.8147202,0.0035789218,0.021327842,0.016087733,0.1417651],"study_design_scores_gemma":[0.0000117477775,0.00006009223,0.00022013023,0.000008252566,0.000014866367,0.00006186804,0.000049579045,0.98680437,0.0004924189,0.011180267,0.001085684,0.000010737109],"about_ca_topic_score_codex":0.012621627,"about_ca_topic_score_gemma":0.008018442,"teacher_disagreement_score":0.012621627,"about_ca_system_score_codex":0.0013477292,"about_ca_system_score_gemma":0.0013693548,"threshold_uncertainty_score":0.03249091},"labels":[],"label_agreement":null},{"id":"W4413071359","doi":"10.1007/978-3-031-98740-3_17","title":"A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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 Saskatchewan","funders":"","keywords":"Longest common subsequence problem; Computer science; Longest increasing subsequence; Subsequence; Algorithm; Space (punctuation); Theoretical computer science; Mathematics","score_opus":0.01818424227148864,"score_gpt":0.2780371640264606,"score_spread":0.259852921754972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413071359","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.015799038,0.00057292264,0.9756588,0.000124291,0.00020201526,0.0002786649,0.00044041916,0.00428855,0.0026352622],"genre_scores_gemma":[0.036839478,0.00017392662,0.95703685,0.000049836177,0.00005133319,0.00022454583,0.0014587174,0.00022465637,0.003940585],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987166,0.00013692166,0.00014296608,0.00037178828,0.0005053136,0.00012651354],"domain_scores_gemma":[0.9985683,0.00046278792,0.00009091529,0.00034055975,0.0004652277,0.00007221158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755321,0.0014384257,0.0014544637,0.0028691387,0.0012862687,0.0016490434,0.0020803132,0.0011543246,0.009587023],"category_scores_gemma":[0.0031201402,0.00058808277,0.001273124,0.0043731895,0.0006375572,0.0025159325,0.0021168564,0.0013696372,0.0048707905],"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.00037458856,0.00018976274,0.00060262205,0.00027824027,0.000068785404,0.00018492318,0.00021163326,0.013521181,0.042152833,0.018308172,0.011147005,0.91296023],"study_design_scores_gemma":[0.00041806436,0.0008699398,0.0018768052,0.00012324157,0.00017302962,0.0020539588,0.00059191335,0.75557476,0.09385884,0.0822195,0.062103543,0.00013643291],"about_ca_topic_score_codex":0.0024647487,"about_ca_topic_score_gemma":0.0033432867,"teacher_disagreement_score":0.009587023,"about_ca_system_score_codex":0.00084602786,"about_ca_system_score_gemma":0.0024426233,"threshold_uncertainty_score":0.03207177},"labels":[],"label_agreement":null},{"id":"W4413071362","doi":"10.1007/978-3-031-98740-3_13","title":"Average Sensitivity of Breadth-First Search Algorithms on Grids","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Sensitivity (control systems); Algorithm","score_opus":0.017671396370410798,"score_gpt":0.25275957411346617,"score_spread":0.23508817774305538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413071362","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.20091793,0.009105959,0.7442921,0.0038021568,0.00052748696,0.0001613829,0.0011425195,0.0029712073,0.037079316],"genre_scores_gemma":[0.9080805,0.0019395145,0.08144022,0.00047265735,0.00035255964,0.00017291897,0.0004365633,0.00082155236,0.0062834793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969535,0.0012698916,0.000103925886,0.00041204962,0.00079695095,0.0004637464],"domain_scores_gemma":[0.9366258,0.057683475,0.0011473276,0.00229565,0.0015956358,0.0006520492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043391916,0.0011451249,0.002364921,0.0024184403,0.0011482057,0.0021074312,0.0025807384,0.0020197567,0.0052783187],"category_scores_gemma":[0.05307784,0.0011159749,0.0010115587,0.0029949467,0.0021039366,0.0042521516,0.0024047215,0.0026062576,0.0005785683],"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.00033900305,0.00005200342,0.0008415834,0.00025939077,0.000080927144,0.000048934995,0.00008750452,0.9177256,0.0026014599,0.04527584,0.0046463488,0.028041346],"study_design_scores_gemma":[0.00001265842,0.00002649118,0.00028942453,0.000019258063,0.000019985344,0.00003974363,0.000017604,0.9539624,0.00094506907,0.044197805,0.00045999707,0.000009651957],"about_ca_topic_score_codex":0.0062401886,"about_ca_topic_score_gemma":0.0030159529,"teacher_disagreement_score":0.0062401886,"about_ca_system_score_codex":0.0038332825,"about_ca_system_score_gemma":0.0020553519,"threshold_uncertainty_score":0.02781254},"labels":[],"label_agreement":null},{"id":"W4413071390","doi":"10.1007/978-3-031-98740-3_10","title":"Covering Vertices by $$4^+$$-Paths: A Simpler Local Search Coupled with a More Delicate Amortization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Alberta","funders":"","keywords":"Computer science; Amortization; Algorithm","score_opus":0.014650625266111888,"score_gpt":0.281982273973631,"score_spread":0.26733164870751913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413071390","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.041142676,0.00048105957,0.9091428,0.001421322,0.00036385754,0.00033294086,0.0007432799,0.0036656922,0.04270647],"genre_scores_gemma":[0.12573633,0.0002305182,0.8472419,0.0005322185,0.0001920624,0.0002988798,0.00078631775,0.0020307833,0.022950994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986413,0.00035296447,0.000076148805,0.00040641247,0.0002994525,0.00022374591],"domain_scores_gemma":[0.99732554,0.0012997369,0.00009128332,0.0010067904,0.00012769678,0.00014896486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183327,0.0013368445,0.002265569,0.0011319849,0.0013488195,0.002748653,0.0040794318,0.0025109784,0.051947232],"category_scores_gemma":[0.004941316,0.00096012774,0.0023155326,0.002158419,0.0013771876,0.0069902814,0.0046631284,0.0030238763,0.0066943252],"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.0010794275,0.0007122346,0.0006873626,0.00105189,0.00024540327,0.00030209913,0.000433569,0.17720006,0.023250086,0.23427036,0.066982396,0.49378505],"study_design_scores_gemma":[0.00023720105,0.00020472865,0.00032498836,0.000071675764,0.00014975827,0.0003736739,0.00020326316,0.7084607,0.005739924,0.26484215,0.019330373,0.00006158447],"about_ca_topic_score_codex":0.0029561063,"about_ca_topic_score_gemma":0.006969611,"teacher_disagreement_score":0.051947232,"about_ca_system_score_codex":0.0013931049,"about_ca_system_score_gemma":0.0016976447,"threshold_uncertainty_score":0.1737808},"labels":[],"label_agreement":null},{"id":"W4413072469","doi":"10.1007/978-3-031-98420-4_31","title":"Unveiling the Interplay Between Affect and Cognitive Load During Simulation-Based Training","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Affect (linguistics); Computer science; Training (meteorology); Cognition; Human–computer interaction; Simulation; Artificial intelligence; Psychology; Communication; Neuroscience","score_opus":0.024604154214344667,"score_gpt":0.2919521021894237,"score_spread":0.26734794797507905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413072469","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.9896109,0.00012694826,0.005789729,0.00010064975,0.0000215892,0.000018496075,0.000047267393,0.000032967037,0.0042514857],"genre_scores_gemma":[0.9986148,0.00004164576,0.0009895599,0.000010885704,0.0000075928538,0.000013487507,0.000017607174,0.000012165162,0.00029229518],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997354,0.00012717901,0.0000093746,0.00003064266,0.000066593544,0.00003073784],"domain_scores_gemma":[0.9982607,0.0015047302,0.0000785877,0.000043594344,0.000042272633,0.00007022059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047064896,0.00023204014,0.00020062638,0.00016522921,0.00015562092,0.0011509834,0.00022593017,0.00028284758,0.0018655672],"category_scores_gemma":[0.0044935755,0.00017487117,0.0000877716,0.00015242714,0.00031636903,0.00035332437,0.0004954006,0.00036612886,0.00013539885],"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.00898793,0.0013305752,0.06935267,0.0007208961,0.0002982276,0.00043270845,0.013621789,0.040113486,0.60619897,0.005949072,0.00175176,0.25124195],"study_design_scores_gemma":[0.00030464225,0.002794468,0.7838066,0.0001468372,0.00030585704,0.00037363017,0.004204125,0.15993989,0.03413402,0.010032929,0.003834981,0.00012205805],"about_ca_topic_score_codex":0.0008178809,"about_ca_topic_score_gemma":0.0011015276,"teacher_disagreement_score":0.0018655672,"about_ca_system_score_codex":0.00015942214,"about_ca_system_score_gemma":0.0001831059,"threshold_uncertainty_score":0.006240964},"labels":[],"label_agreement":null},{"id":"W4413072631","doi":"10.1007/978-3-031-98420-4_23","title":"Can LLMs Generate Accurate Bayesian Networks to Enhance Knowledge Tracing ?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université du Québec à Montréal; Université Laval","funders":"","keywords":"Computer science; Tracing; Bayesian network; Bayesian probability; Artificial intelligence; Machine learning; Data science; Programming language","score_opus":0.015496239061201665,"score_gpt":0.2714654988250654,"score_spread":0.2559692597638637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413072631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01148024,0.00019608895,0.9817525,0.00079917087,0.000071364964,0.000030000632,0.00020006385,0.0034030045,0.002067605],"genre_scores_gemma":[0.3904942,0.00026918264,0.60345346,0.00042604527,0.00010927639,0.00008285045,0.0006137817,0.0005885304,0.003962797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00037900006,0.000049199512,0.00018328574,0.0002545294,0.00006109649],"domain_scores_gemma":[0.98646,0.00899381,0.00059254793,0.001801612,0.0018678729,0.0002842073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027376164,0.0006241178,0.0007970534,0.0012488348,0.00035873678,0.0018430048,0.0019665621,0.0018058359,0.009916679],"category_scores_gemma":[0.043084335,0.00065558666,0.00036693588,0.00097270514,0.00050828536,0.0055729393,0.0016894693,0.0018479616,0.00353832],"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.00055795716,0.0001664689,0.003592873,0.00017682843,0.00008310275,0.00008830041,0.0002839528,0.18636218,0.0063640755,0.031161366,0.013267167,0.7578957],"study_design_scores_gemma":[0.000023724118,0.000024596005,0.00025462767,0.000020512118,0.000011555191,0.000034897614,0.00003730545,0.96195483,0.0042100465,0.031108106,0.0023103352,0.000009464047],"about_ca_topic_score_codex":0.0039215344,"about_ca_topic_score_gemma":0.0060479804,"teacher_disagreement_score":0.009916679,"about_ca_system_score_codex":0.00095082104,"about_ca_system_score_gemma":0.0009981528,"threshold_uncertainty_score":0.033174634},"labels":[],"label_agreement":null},{"id":"W4413081244","doi":"10.1007/978-3-031-98417-4_5","title":"Thinking Like a Scientist: Can Interactive Simulations Foster Critical AI Literacy?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Teaching and Learning Programming","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":"Google (Canada)","funders":"","keywords":"Computer science; Cognitive science; Literacy; Human–computer interaction; Psychology; Pedagogy","score_opus":0.013845018489105273,"score_gpt":0.30857447731430615,"score_spread":0.29472945882520085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413081244","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.2739528,0.0020499197,0.043520223,0.040537313,0.00075057277,0.00013808378,0.00007581123,0.00054953416,0.63842577],"genre_scores_gemma":[0.9636541,0.0012335293,0.011051893,0.0015995553,0.00010166979,0.00013026256,0.00007325522,0.0000958247,0.022059921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99869895,0.00095153245,0.000020144844,0.00008377243,0.00014771413,0.00009788714],"domain_scores_gemma":[0.98035365,0.016494652,0.00055833213,0.0006975399,0.00052775716,0.0013680698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022018075,0.00028246894,0.00018542171,0.00035966618,0.0010346363,0.0045852326,0.0011009265,0.0015847809,0.022739131],"category_scores_gemma":[0.022416046,0.00020852787,0.0002061078,0.000264693,0.0031463485,0.0053870785,0.0029883618,0.0026551345,0.0026427798],"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.00062715757,0.0020595626,0.008464028,0.00069609756,0.000060003316,0.000590058,0.040961716,0.00489413,0.005198563,0.6221332,0.053141244,0.26117435],"study_design_scores_gemma":[0.00023510882,0.0004201148,0.0030092264,0.00077009416,0.000051405477,0.00040500573,0.018726746,0.015880307,0.0060432474,0.75533724,0.19907342,0.00004803944],"about_ca_topic_score_codex":0.0004449151,"about_ca_topic_score_gemma":0.0008721224,"teacher_disagreement_score":0.022739131,"about_ca_system_score_codex":0.0009005248,"about_ca_system_score_gemma":0.0018179587,"threshold_uncertainty_score":0.07607001},"labels":[],"label_agreement":null},{"id":"W4413167885","doi":"10.1007/978-3-031-97766-4_6","title":"Reduction in End-of-life Care Anxiety in Family Caregivers of Individuals in Palliative Care: Results of a Pilot Exploratory Study Using a Canadian Virtual Reality Technology","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cancer survivorship and care","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; Bishop's University; Institut Universitaire de Gériatrie de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Réseau québécois de recherche sur le vieillissement; AGE-WELL","keywords":"Palliative care; Virtual reality; Exploratory research; End-of-life care; Anxiety; Computer science; Nursing; Gerontology; Psychology; Medicine; Psychiatry; Human–computer interaction; Sociology","score_opus":0.04382891357553057,"score_gpt":0.3010781558142639,"score_spread":0.2572492422387333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413167885","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.999619,0.000028306302,0.000053280266,0.0000120450095,0.0000014968364,0.00010696326,0.000013124605,0.0000012298382,0.00016443814],"genre_scores_gemma":[0.99883825,0.000103735816,0.000577436,0.000028377324,0.000003354306,0.00013178063,0.000028278771,0.000001165378,0.0002876929],"study_design_codex":"observational","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.99953043,0.00019887456,0.000015879064,0.000040537707,0.00011183248,0.000102475875],"domain_scores_gemma":[0.99890935,0.0003284474,0.00009638423,0.000039960498,0.00032561246,0.00030033552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012008632,0.00040108434,0.00032254012,0.00045806635,0.001439352,0.0003665562,0.00043328028,0.0002537806,0.0010595213],"category_scores_gemma":[0.0031009095,0.00017982813,0.00031107222,0.00022779274,0.00046356278,0.00016979774,0.00039424532,0.0004061785,0.00010230277],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0069853454,0.039711315,0.42190534,0.0016559607,0.0002507577,0.0061277887,0.28849596,0.0006930809,0.056653704,0.00023348235,0.0024050467,0.17488219],"study_design_scores_gemma":[0.00068434177,0.041078776,0.80588937,0.00016540883,0.00021380237,0.0016706967,0.13706867,0.00072830985,0.007569427,0.00007651808,0.0047608335,0.000093819],"about_ca_topic_score_codex":0.030865708,"about_ca_topic_score_gemma":0.07154489,"teacher_disagreement_score":0.9691343,"about_ca_system_score_codex":0.00085315993,"about_ca_system_score_gemma":0.0014683134,"threshold_uncertainty_score":0.0613721},"labels":[],"label_agreement":null},{"id":"W4413232290","doi":"10.1007/978-3-032-00281-5_8","title":"The Two-Squirrel Problem and Its Relatives","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Squirrel monkey; Theoretical computer science; Biology; Ecology","score_opus":0.018986700502872562,"score_gpt":0.29215149539107527,"score_spread":0.2731647948882027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413232290","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22339706,0.0066322996,0.33348975,0.02413038,0.0025471048,0.00022216469,0.0011092789,0.00084975763,0.4076222],"genre_scores_gemma":[0.7814498,0.003718245,0.09674412,0.0030791033,0.0025360135,0.00022970907,0.0015559199,0.0005946047,0.110092476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892765,0.00033480805,0.000050860537,0.00030462502,0.00020538397,0.0001766818],"domain_scores_gemma":[0.995158,0.0031635568,0.00042127652,0.0006352722,0.00028085688,0.00034108787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016189042,0.0008757597,0.0018006833,0.0011410573,0.003858441,0.0030138874,0.002644095,0.004567037,0.031925328],"category_scores_gemma":[0.0090823285,0.00073011016,0.0015238828,0.002429722,0.003590771,0.009360095,0.0029850078,0.004661223,0.0032686251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020203122,0.00012849162,0.00020690788,0.00023532065,0.000023197445,0.00018343996,0.00019572333,0.00329243,0.0004968593,0.9485048,0.020601116,0.025929704],"study_design_scores_gemma":[0.000040926778,0.000024466177,0.00007646216,0.000019743109,0.0000076131573,0.00012340501,0.000079349375,0.0050998754,0.00018700415,0.9882088,0.006122591,0.000009714355],"about_ca_topic_score_codex":0.0010230084,"about_ca_topic_score_gemma":0.00087361236,"teacher_disagreement_score":0.031925328,"about_ca_system_score_codex":0.0009811565,"about_ca_system_score_gemma":0.0008867807,"threshold_uncertainty_score":0.106800854},"labels":[],"label_agreement":null},{"id":"W4413232535","doi":"10.1007/978-3-032-00281-5_9","title":"A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Simon Fraser University","funders":"","keywords":"Computer science; Center (category theory); Algorithm; Cactus","score_opus":0.010870916836559892,"score_gpt":0.23094171266794614,"score_spread":0.22007079583138625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413232535","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08828671,0.0012830849,0.8081335,0.0027891768,0.0006665143,0.0009598903,0.0026462455,0.0185485,0.07668643],"genre_scores_gemma":[0.14285378,0.00036872004,0.827355,0.00053091405,0.0002530337,0.0005519593,0.0043984344,0.001971529,0.021716649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869776,0.00018533984,0.000055735953,0.00042795966,0.00033129758,0.00030182884],"domain_scores_gemma":[0.9976259,0.0010754595,0.00013463701,0.0006104139,0.0003067007,0.00024695593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008921946,0.0021417537,0.0022902817,0.0020663263,0.002152871,0.003193105,0.0053176302,0.002492939,0.037246414],"category_scores_gemma":[0.00434962,0.0010019329,0.0016711918,0.004608975,0.0011395286,0.0066069877,0.0037212083,0.0032879112,0.008262087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012551277,0.00092933374,0.0010047492,0.0009567007,0.00012411989,0.0001690302,0.00031306426,0.08140088,0.0115440795,0.089788646,0.13404249,0.67847174],"study_design_scores_gemma":[0.00073179987,0.00023701631,0.00086324714,0.000079810015,0.00011161892,0.00030316398,0.00033063034,0.74316394,0.0069211354,0.2240092,0.023182204,0.00006616906],"about_ca_topic_score_codex":0.010248727,"about_ca_topic_score_gemma":0.0145194745,"teacher_disagreement_score":0.037246414,"about_ca_system_score_codex":0.0035842718,"about_ca_system_score_gemma":0.0034530032,"threshold_uncertainty_score":0.12460166},"labels":[],"label_agreement":null},{"id":"W4413238534","doi":"10.1007/978-3-032-00624-0","title":"Availability, Reliability and Security","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","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":"Royal Holloway, University of London; Universitat Politècnica de València; SBA Research; Università degli Studi del Molise; Universität Stuttgart; Universitatea Politehnica Timisoara; Trakya Üniversitesi; Ruhr-Universität Bochum; North-West University; Università degli Studi di Cagliari; Technische Universität Braunschweig; Tartu Ülikool; Vysoké Učení Technické v Brně; Universiteit Gent; Cochin University of Science and Technology; Sapienza Università di Roma; Rheinische Friedrich-Wilhelms-Universität Bonn; Newcastle University; Technische Universität Darmstadt; Università degli Studi di Trento; Università della Calabria; Université de Toulouse; Università degli Studi di Padova; Università degli Studi di Verona; Universidad Carlos III de Madrid; Oak Ridge National Laboratory; KU Leuven; Tel Aviv University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Aalborg Universitet; Universidade de Lisboa; Universität Hamburg; Norges Teknisk-Naturvitenskapelige Universitet; Sungkyunkwan University; Deakin University; University of Macedonia; Universität Regensburg; Institut Polytechnique de Paris; Université Grenoble Alpes; Universitetet i Stavanger; Politechnika Warszawska; Högskolan i Halmstad; Louisiana State University; Kuwait University; Szegedi Tudományegyetem; Hunan University; Universidade de Coimbra; Universität Passau; Universidade da Beira Interior; Università degli Studi di Salerno; Edinburgh Napier University; Michigan Technological University; Universitat Rovira i Virgili; Polytechnique Montréal; Università degli Studi di Milano; DePaul University","keywords":"Computer science; Reliability (semiconductor); Computer security; Reliability engineering","score_opus":0.011896334982947832,"score_gpt":0.27546631425388046,"score_spread":0.2635699792709326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413238534","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005784338,0.1990103,0.06957806,0.0066355267,0.004263011,0.000049721264,0.00028709834,0.00048507744,0.71390676],"genre_scores_gemma":[0.0979958,0.081168175,0.019083763,0.0015430702,0.0058039306,0.00017408314,0.00028407873,0.0002690863,0.793678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977964,0.00003857413,0.000007739844,0.000043552925,0.00011494449,0.000015544256],"domain_scores_gemma":[0.9996935,0.00016514017,0.000022155138,0.00004469281,0.000056230336,0.000018283665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027399714,0.001286798,0.0007578452,0.0012507394,0.00065144576,0.0021630782,0.0006164984,0.0011408177,0.030777795],"category_scores_gemma":[0.0012215599,0.00047456648,0.00030488757,0.0016988427,0.0015996973,0.0035121846,0.0007440375,0.0022366343,0.009611544],"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.000035986563,0.000040577324,0.0001465477,0.00037497035,0.000015297483,0.000101538986,0.00029628712,0.0023942427,0.0018875212,0.71321464,0.1086346,0.17285784],"study_design_scores_gemma":[0.000009103119,0.00006670285,0.0005404866,0.00017360905,0.000017570917,0.00039506922,0.00014406838,0.003030651,0.0004578816,0.630427,0.36472347,0.000014342771],"about_ca_topic_score_codex":0.0008064197,"about_ca_topic_score_gemma":0.0011199863,"teacher_disagreement_score":0.030777795,"about_ca_system_score_codex":0.0007280802,"about_ca_system_score_gemma":0.0005014419,"threshold_uncertainty_score":0.10296196},"labels":[],"label_agreement":null},{"id":"W4413239005","doi":"10.1007/978-3-032-00624-0_5","title":"On the Feasibility of Fingerprinting Collaborative Robot Network Traffic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robot; Computer network; Artificial intelligence; Human–computer interaction","score_opus":0.019914894058718643,"score_gpt":0.27644209589501595,"score_spread":0.2565272018362973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413239005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17170243,0.000977676,0.80436134,0.00064081856,0.00018449256,0.00008550287,0.00015303944,0.0011267914,0.020767944],"genre_scores_gemma":[0.8614952,0.00037692825,0.13302065,0.0000852887,0.000120965626,0.000049814545,0.00016328452,0.000095341704,0.0045925397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984962,0.00046225367,0.00004136569,0.00025943658,0.0005722018,0.00016854706],"domain_scores_gemma":[0.9854916,0.011382636,0.00041322634,0.0013785054,0.0011618434,0.0001722104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015819789,0.0006100176,0.00087324076,0.0012966532,0.00069047767,0.0013960699,0.0015170751,0.0016984742,0.0037974976],"category_scores_gemma":[0.016000804,0.00050486455,0.00038815435,0.001237539,0.0010928869,0.0031525507,0.0015148548,0.00085914246,0.000831489],"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.0020689007,0.0002659294,0.010881337,0.00025033628,0.00009584142,0.00048409027,0.00027510346,0.3083884,0.064643286,0.04844579,0.004962902,0.55923814],"study_design_scores_gemma":[0.00002361578,0.00020370886,0.002389288,0.000021030026,0.000026499267,0.00031080437,0.00012179484,0.9649544,0.01731133,0.013026441,0.0015812461,0.00002990007],"about_ca_topic_score_codex":0.0024818894,"about_ca_topic_score_gemma":0.001996516,"teacher_disagreement_score":0.0037974976,"about_ca_system_score_codex":0.0005658355,"about_ca_system_score_gemma":0.0004493281,"threshold_uncertainty_score":0.012703896},"labels":[],"label_agreement":null},{"id":"W4413239006","doi":"10.1007/978-3-032-00624-0_21","title":"BTDT: Membership Inference Attacks Against Large Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Windsor","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Natural language processing; Programming language; Theoretical computer science","score_opus":0.03363683970892201,"score_gpt":0.29057667504732276,"score_spread":0.25693983533840076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413239006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020413086,0.00051033165,0.9495538,0.003391335,0.0004422259,0.0001472828,0.0009445644,0.013021459,0.011575965],"genre_scores_gemma":[0.75055754,0.00069706934,0.21404773,0.0025984882,0.0006889141,0.0004852421,0.002728723,0.0024857703,0.025710426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933421,0.0023575902,0.00034608552,0.00067790534,0.0026527327,0.00062355277],"domain_scores_gemma":[0.981781,0.009642797,0.00053021393,0.0068965936,0.00077802956,0.0003713363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041855476,0.00087967707,0.0013589419,0.0010401178,0.0017697857,0.0026961504,0.0025730515,0.0030347838,0.007680383],"category_scores_gemma":[0.018967746,0.0008931226,0.0015584424,0.0017168215,0.0024558464,0.01021021,0.008283835,0.007060478,0.0036063655],"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.0020066712,0.00035711768,0.0013787625,0.00035475512,0.00022893728,0.0005864909,0.0008447817,0.09089334,0.016192889,0.43759027,0.12029828,0.32926777],"study_design_scores_gemma":[0.00012614303,0.00009137627,0.00018260229,0.0000379736,0.000060696,0.00033940014,0.000077748125,0.5017127,0.014321129,0.46089095,0.022117143,0.000042145253],"about_ca_topic_score_codex":0.0013678089,"about_ca_topic_score_gemma":0.0012863575,"teacher_disagreement_score":0.007680383,"about_ca_system_score_codex":0.0017834353,"about_ca_system_score_gemma":0.0017239322,"threshold_uncertainty_score":0.025693476},"labels":[],"label_agreement":null},{"id":"W4413239009","doi":"10.1007/978-3-032-00624-0_10","title":"TSA-WF: Exploring the Effectiveness of Time Series Analysis for Website Fingerprinting","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Series (stratigraphy); Time series; World Wide Web; Machine learning","score_opus":0.014539047736021757,"score_gpt":0.23365938545661874,"score_spread":0.21912033772059697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413239009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29761368,0.0024267025,0.6840239,0.0006583895,0.00019800493,0.00008122712,0.0012395637,0.004732551,0.009025881],"genre_scores_gemma":[0.8501898,0.00064515794,0.14496362,0.000057341793,0.00011962549,0.000046953093,0.0010294642,0.00038656243,0.0025614663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991235,0.0004542258,0.00003631452,0.00012700145,0.00020756305,0.000051291157],"domain_scores_gemma":[0.9889135,0.009979344,0.00026559684,0.00043422045,0.00029830344,0.00010906727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021382996,0.00068266486,0.00059950846,0.0019158025,0.0002874205,0.0013819969,0.0006894305,0.0007476727,0.0035509332],"category_scores_gemma":[0.015033475,0.0001623299,0.00056755124,0.0020999948,0.00030369524,0.00214825,0.00063804904,0.0007510279,0.0007595432],"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.0009586349,0.00035411833,0.024129612,0.00044429157,0.00035721733,0.0002728491,0.00031439814,0.15393811,0.014469965,0.024048088,0.0067191455,0.7739936],"study_design_scores_gemma":[0.000013737853,0.000089585395,0.0036321103,0.000017906093,0.00003281496,0.000089254434,0.000100268604,0.9828257,0.002837968,0.009283215,0.0010640927,0.0000134091515],"about_ca_topic_score_codex":0.0035211975,"about_ca_topic_score_gemma":0.002144854,"teacher_disagreement_score":0.0035509332,"about_ca_system_score_codex":0.0002926641,"about_ca_system_score_gemma":0.00036538776,"threshold_uncertainty_score":0.0118790865},"labels":[],"label_agreement":null},{"id":"W4413240279","doi":"10.1007/978-3-031-97772-5_3","title":"Digital Twin-Driven Radar for Human Monitoring Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Non-Invasive Vital Sign Monitoring","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":"Computer science; Radar; Real-time computing; Telecommunications","score_opus":0.01381812191151857,"score_gpt":0.23705023377996276,"score_spread":0.2232321118684442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413240279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029248777,0.00019224863,0.9935982,0.00003970333,0.00004466746,0.0000096853455,0.000015778922,0.000102557635,0.0030723307],"genre_scores_gemma":[0.48320267,0.0010534736,0.49100974,0.00018578242,0.00013254731,0.00012835392,0.00021758373,0.00018875,0.023880964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998154,0.0000528855,0.000005583423,0.000038933344,0.0000730496,0.000014184695],"domain_scores_gemma":[0.9998323,0.00008740406,0.000011093206,0.000021936936,0.00004141014,0.0000059335703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029428804,0.0005046935,0.0005060543,0.00015072484,0.00013269467,0.0004947968,0.00056633755,0.0005110209,0.004227027],"category_scores_gemma":[0.0008818385,0.00023843416,0.00032163365,0.0003124895,0.00022419244,0.0005395419,0.0006542943,0.00066143734,0.0008732196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019980964,0.00008727019,0.00031125528,0.0002141149,0.00005532849,0.00004347192,0.00005529832,0.58292156,0.039508633,0.023360997,0.004371275,0.34887102],"study_design_scores_gemma":[0.0000033696242,0.00003207225,0.000077650504,0.000005010331,0.0000051212733,0.000022656408,0.0000031302015,0.993891,0.0023307807,0.0018679769,0.0017571261,0.000004087352],"about_ca_topic_score_codex":0.00048076766,"about_ca_topic_score_gemma":0.0006904191,"teacher_disagreement_score":0.004227027,"about_ca_system_score_codex":0.00020904427,"about_ca_system_score_gemma":0.0002974144,"threshold_uncertainty_score":0.014140785},"labels":[],"label_agreement":null},{"id":"W4413240493","doi":"10.1007/978-3-032-00627-1","title":"Availability, Reliability and Security","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software Reliability and Analysis Research","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":"Royal Holloway, University of London; Universitat Politècnica de València; Universität Rostock; Università degli Studi del Molise; Universität Stuttgart; Universitat Rovira i Virgili; Universitatea Politehnica Timisoara; Trakya Üniversitesi; Università della Calabria; Università degli Studi di Salerno; Università degli Studi di Verona; Ruhr-Universität Bochum; SBA Research; United Arab Emirates University; North-West University; Deakin University; Umeå Universitet; Tartu Ülikool; Vysoké Učení Technické v Brně; Universiteit Gent; Cochin University of Science and Technology; Sapienza Università di Roma; Rheinische Friedrich-Wilhelms-Universität Bonn; Newcastle University; Technische Universität Darmstadt; Università degli Studi di Trento; Universidade de Coimbra; Linköpings Universitet; Kuwait University; Szegedi Tudományegyetem; Hunan University; Université de Toulouse; Università degli Studi di Padova; Aalborg Universitet; Universidade de Lisboa; Universität Hamburg; Norges Teknisk-Naturvitenskapelige Universitet; Sungkyunkwan University; University of Macedonia; Universität Regensburg; Chalmers Tekniska Högskola; Università degli Studi Mediterranea di Reggio Calabria; Institut Polytechnique de Paris; Universidad Carlos III de Madrid; Institut Mines-Télécom; Université Grenoble Alpes; Universitetet i Stavanger; Politechnika Warszawska; Technische Universität Braunschweig; Università degli Studi di Cagliari; Politecnico di Torino; Università degli Studi di Milano; University of South Alabama; Polytechnique Montréal; Universidad de Málaga; Edinburgh Napier University; Michigan Technological University; Högskolan i Halmstad; Louisiana State University; Oak Ridge National Laboratory; KU Leuven; DePaul University; Universität Passau; Universidade da Beira Interior","keywords":"Computer science; Reliability (semiconductor); Computer security; Reliability engineering","score_opus":0.011896334982947832,"score_gpt":0.27546631425388046,"score_spread":0.2635699792709326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413240493","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005784338,0.1990103,0.06957806,0.0066355267,0.004263011,0.000049721264,0.00028709834,0.00048507744,0.71390676],"genre_scores_gemma":[0.0979958,0.081168175,0.019083763,0.0015430702,0.0058039306,0.00017408314,0.00028407873,0.0002690863,0.793678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977964,0.00003857413,0.000007739844,0.000043552925,0.00011494449,0.000015544256],"domain_scores_gemma":[0.9996935,0.00016514017,0.000022155138,0.00004469281,0.000056230336,0.000018283665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027399714,0.001286798,0.0007578452,0.0012507394,0.00065144576,0.0021630782,0.0006164984,0.0011408177,0.030777795],"category_scores_gemma":[0.0012215599,0.00047456648,0.00030488757,0.0016988427,0.0015996973,0.0035121846,0.0007440375,0.0022366343,0.009611544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035986563,0.000040577324,0.0001465477,0.00037497035,0.000015297483,0.000101538986,0.00029628712,0.0023942427,0.0018875212,0.71321464,0.1086346,0.17285784],"study_design_scores_gemma":[0.000009103119,0.00006670285,0.0005404866,0.00017360905,0.000017570917,0.00039506922,0.00014406838,0.003030651,0.0004578816,0.630427,0.36472347,0.000014342771],"about_ca_topic_score_codex":0.0008064197,"about_ca_topic_score_gemma":0.0011199863,"teacher_disagreement_score":0.030777795,"about_ca_system_score_codex":0.0007280802,"about_ca_system_score_gemma":0.0005014419,"threshold_uncertainty_score":0.10296196},"labels":[],"label_agreement":null},{"id":"W4413240885","doi":"10.1007/978-3-032-00627-1_1","title":"QRisk: Think Before You Scan QR Codes","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"QR Code Applications and Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Parallel computing","score_opus":0.011506101721126224,"score_gpt":0.24085921126535828,"score_spread":0.22935310954423205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413240885","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010379773,0.0061042677,0.14863133,0.0060740476,0.013877397,0.00078394887,0.0030358408,0.01619954,0.80425566],"genre_scores_gemma":[0.0016764702,0.0015189894,0.022560675,0.0010859114,0.00051213946,0.0001088352,0.0005859265,0.0026694317,0.96928173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988385,0.00020297965,0.000061647836,0.000105421306,0.0007347346,0.00005669129],"domain_scores_gemma":[0.9946979,0.0016034222,0.00019523586,0.0005852938,0.0026156171,0.00030256173],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009964638,0.0014873509,0.001011456,0.001952389,0.0009857612,0.004506946,0.001096507,0.0015766181,0.4910474],"category_scores_gemma":[0.009279627,0.0007153282,0.0005125722,0.0019060285,0.0009783813,0.0030627295,0.0021252332,0.0027566992,0.52069134],"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.00003442726,0.000016530515,0.000031797288,0.00028581094,0.0000034355155,0.000046943176,0.00016848651,0.00010069352,0.0013857499,0.012944227,0.794835,0.19014691],"study_design_scores_gemma":[0.000006612209,0.000019726238,0.000039998067,0.00013305343,0.0000021986689,0.00013119752,0.00008465468,0.00012298954,0.00053184177,0.00286737,0.9960521,0.000008351883],"about_ca_topic_score_codex":0.0008788322,"about_ca_topic_score_gemma":0.0015786054,"teacher_disagreement_score":0.4910474,"about_ca_system_score_codex":0.0005466038,"about_ca_system_score_gemma":0.0012435385,"threshold_uncertainty_score":0.72595906},"labels":[],"label_agreement":null},{"id":"W4413244843","doi":"10.1007/978-3-032-00630-1_7","title":"Towards Robust Artificial Intelligence: Self-supervised Learning Approach for Out-of-Distribution Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.032686812850764455,"score_gpt":0.26924124676590155,"score_spread":0.23655443391513709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413244843","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.002607126,0.00019818086,0.9957087,0.000078461286,0.00002811435,0.0000139716585,0.000029813567,0.0007424567,0.0005932748],"genre_scores_gemma":[0.15723659,0.0004349395,0.8360171,0.00028290125,0.00022875698,0.00009565841,0.0004343041,0.00044510287,0.004824568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833965,0.00043885817,0.00008797519,0.00043699157,0.0005880726,0.00010852044],"domain_scores_gemma":[0.9975764,0.0009397463,0.00024962283,0.00058144756,0.0005803971,0.00007236242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022411942,0.0008822994,0.0016044924,0.0013200206,0.00042690826,0.0017612928,0.003210941,0.0016914867,0.0015528869],"category_scores_gemma":[0.004658319,0.0005624292,0.001348612,0.0013897662,0.0010081395,0.00160979,0.001887325,0.0020064397,0.0012828746],"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.00010076373,0.00021031752,0.0016057675,0.00019799224,0.00024693322,0.00010806505,0.00012338768,0.17840922,0.016962817,0.026330246,0.010701416,0.765003],"study_design_scores_gemma":[0.000002667414,0.000023015376,0.0002502143,0.0000055009227,0.000011623174,0.000052299623,0.0000071619493,0.9816436,0.0037388834,0.0127987405,0.0014579297,0.0000083252335],"about_ca_topic_score_codex":0.0010752252,"about_ca_topic_score_gemma":0.0014352027,"teacher_disagreement_score":0.003210941,"about_ca_system_score_codex":0.0005326848,"about_ca_system_score_gemma":0.0005854136,"threshold_uncertainty_score":0.011852682},"labels":[],"label_agreement":null},{"id":"W4413250102","doi":"10.1007/978-3-032-00633-2_13","title":"Designing a Framework to Tackle the Multifaceted Intricacies of Insider Threats","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Computer science; Insider; Insider threat; Computer security; Management science; Political science; Law; Engineering","score_opus":0.018835372849717976,"score_gpt":0.26481159425658085,"score_spread":0.24597622140686287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413250102","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.0044085467,0.00030606118,0.97957486,0.0010896157,0.000078431985,0.00022486674,0.00006463118,0.0009768885,0.013276137],"genre_scores_gemma":[0.09897859,0.00066618307,0.89054114,0.00024153336,0.00008329397,0.00028692675,0.00030359247,0.0002787229,0.008619976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980642,0.0006378895,0.000116156785,0.0003652342,0.0005022553,0.00031428266],"domain_scores_gemma":[0.9982938,0.00060207135,0.0001751455,0.0004451629,0.00027555123,0.00020826336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003620899,0.0012841919,0.0007192183,0.0020767278,0.002089473,0.0059447563,0.0032470373,0.002944589,0.0063397954],"category_scores_gemma":[0.0051901755,0.0008949076,0.001963265,0.001290045,0.0032753227,0.008956677,0.0055509144,0.0033129754,0.0022728841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029341223,0.00010084906,0.0017413187,0.00017655898,0.000055363118,0.00047775445,0.0013502808,0.035106383,0.0030409873,0.8640348,0.0062500066,0.08763639],"study_design_scores_gemma":[0.000025848769,0.00007735998,0.00046222686,0.00023281714,0.0000773805,0.00067245594,0.001250876,0.28295752,0.0035256187,0.63231224,0.07835298,0.00005265329],"about_ca_topic_score_codex":0.005385809,"about_ca_topic_score_gemma":0.007248362,"teacher_disagreement_score":0.0063397954,"about_ca_system_score_codex":0.0014686288,"about_ca_system_score_gemma":0.0036819219,"threshold_uncertainty_score":0.021208704},"labels":[],"label_agreement":null},{"id":"W4413250249","doi":"10.1007/978-3-032-00633-2_6","title":"Enhancing Cyber Situation Awareness: Visualizing Advanced Persistent Threats as Complex Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information and Cyber Security","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Human–computer interaction; Computer security; Situation awareness; Visualization; Data science; Artificial intelligence","score_opus":0.02572000434674665,"score_gpt":0.2890843615934219,"score_spread":0.26336435724667523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413250249","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.14236686,0.0029043155,0.8033498,0.0015462651,0.0003312252,0.00017474627,0.0016117838,0.009902912,0.037812218],"genre_scores_gemma":[0.637437,0.0029964263,0.3417667,0.00034267092,0.0001526372,0.00013047797,0.0011193597,0.0014335021,0.0146212885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991953,0.000019629808,0.0000029246025,0.000014871009,0.000026831021,0.000016132415],"domain_scores_gemma":[0.9996736,0.00016810573,0.00003639916,0.000029660401,0.000039684284,0.000052572184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021407913,0.0008235682,0.000261081,0.00075543264,0.0002916772,0.0026704913,0.0005301342,0.00082676247,0.008213344],"category_scores_gemma":[0.001031479,0.0003669915,0.00041033755,0.0008061727,0.00036078278,0.0017588858,0.0012609948,0.0010998835,0.0009898235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081662385,0.00035084857,0.007455255,0.0015384913,0.00020719819,0.0023156162,0.008237202,0.22084859,0.10935494,0.07295306,0.07256825,0.5033539],"study_design_scores_gemma":[0.00007669011,0.00021993961,0.010393291,0.0003619775,0.00015722003,0.0019020495,0.0028975343,0.7516959,0.025401467,0.10893186,0.09781051,0.0001515591],"about_ca_topic_score_codex":0.0017701894,"about_ca_topic_score_gemma":0.0025918165,"teacher_disagreement_score":0.008213344,"about_ca_system_score_codex":0.00026624245,"about_ca_system_score_gemma":0.00033513087,"threshold_uncertainty_score":0.02747637},"labels":[],"label_agreement":null},{"id":"W4413290211","doi":"10.1007/978-3-032-01475-7_9","title":"Left Quotients of Deterministic Context-Free Languages","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Saskatchewan","funders":"","keywords":"Computer science; Quotient; Context-free language; Programming language; Context (archaeology); Theoretical computer science; Natural language processing; Mathematics; Combinatorics; Rule-based machine translation; History","score_opus":0.009272351827042124,"score_gpt":0.24334797840927214,"score_spread":0.23407562658223002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413290211","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45321807,0.0034185934,0.3487379,0.0012806248,0.0005593955,0.0001371023,0.0007152615,0.0018750364,0.19005802],"genre_scores_gemma":[0.93890846,0.00038983044,0.02086362,0.00018415043,0.00017555927,0.00010651854,0.00032243333,0.00044172566,0.0386077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.00025267364,0.00008224465,0.00021486284,0.00035252442,0.00020785794],"domain_scores_gemma":[0.9981041,0.0010254227,0.00012656105,0.00022218406,0.00028179525,0.0002398756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619689,0.000453964,0.00071156764,0.0008961397,0.0010829701,0.0029871757,0.0007642567,0.00051573495,0.009614101],"category_scores_gemma":[0.0028087504,0.000492775,0.00066460785,0.00043061908,0.002347862,0.0041010412,0.0021893303,0.0015056625,0.00148504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086419255,0.000019497691,0.00016838778,0.000042920725,0.000004870259,0.00011183504,0.0005283679,0.0006900564,0.0034587837,0.9872121,0.00061052496,0.007066275],"study_design_scores_gemma":[0.000022977623,0.00003293757,0.0001768581,0.000017375894,0.000009269132,0.00014501365,0.00015505674,0.0059396913,0.0041427705,0.98162353,0.0077184783,0.000016177897],"about_ca_topic_score_codex":0.00076231605,"about_ca_topic_score_gemma":0.0007133561,"teacher_disagreement_score":0.009614101,"about_ca_system_score_codex":0.0012708433,"about_ca_system_score_gemma":0.00055699464,"threshold_uncertainty_score":0.032162428},"labels":[],"label_agreement":null},{"id":"W4413298776","doi":"10.1007/978-981-95-0100-7_14","title":"Simulation of Ball Levitation with SPH","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fluid Dynamics Simulations and Interactions","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Levitation; Ball (mathematics); Magnetic levitation; Computer graphics (images); Simulation; Mechanical engineering; Geometry; Engineering; Mathematics","score_opus":0.008731091481716866,"score_gpt":0.23452517610495593,"score_spread":0.22579408462323908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413298776","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.49971715,0.0005979088,0.30949965,0.0018416167,0.0007619652,0.00037968263,0.0020909838,0.0065507027,0.17856026],"genre_scores_gemma":[0.95284045,0.00011653508,0.033185646,0.0001281094,0.0000509811,0.00010669208,0.00053912494,0.0004124333,0.012620074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973255,0.000054600143,0.000010429597,0.000027585796,0.00011185926,0.00006282586],"domain_scores_gemma":[0.999468,0.00028182374,0.000033600354,0.0000563698,0.000080722064,0.000079375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028823604,0.00063189084,0.0011847465,0.00042646413,0.0008775335,0.001052709,0.0016661207,0.001875457,0.011348274],"category_scores_gemma":[0.0014546813,0.0005913005,0.00068435975,0.00049388077,0.00094681134,0.0007591137,0.0014013061,0.0010419174,0.0011270762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001413721,0.00006480886,0.0006464371,0.000073900694,0.000025604659,0.00016876255,0.000094858704,0.9794008,0.0027438516,0.008074036,0.0023394402,0.0062261648],"study_design_scores_gemma":[0.00002075831,0.0000125057795,0.00008956534,0.000002627794,0.0000013253423,0.000010686676,0.000010701432,0.9982034,0.0005191647,0.0006147966,0.00051030563,0.0000041751596],"about_ca_topic_score_codex":0.01329519,"about_ca_topic_score_gemma":0.005092529,"teacher_disagreement_score":0.01329519,"about_ca_system_score_codex":0.00086086825,"about_ca_system_score_gemma":0.001087934,"threshold_uncertainty_score":0.037963748},"labels":[],"label_agreement":null},{"id":"W4413300691","doi":"10.1007/978-3-032-01436-8_18","title":"Eukaryotic Ancestry in a Finite World","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic diversity and population structure","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.01807912190160624,"score_gpt":0.24820856424003684,"score_spread":0.2301294423384306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413300691","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.24203598,0.005755986,0.33351958,0.0029784811,0.00022983116,0.000030975083,0.0003953476,0.00041818363,0.41463563],"genre_scores_gemma":[0.93982595,0.0016397153,0.03433059,0.00015939126,0.000116190764,0.00004244789,0.00017045219,0.000064109256,0.023651272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998677,0.000038218695,0.0000083710775,0.00004025235,0.00002971778,0.000015836868],"domain_scores_gemma":[0.9994491,0.0003614974,0.000028779788,0.00009754181,0.000027647126,0.000035391004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003284471,0.00014220116,0.00032904008,0.000711823,0.00092456874,0.0016132663,0.00046653775,0.00053953263,0.0043126587],"category_scores_gemma":[0.0012910289,0.00019818381,0.00030639727,0.0007990264,0.0027726316,0.00283406,0.001060466,0.00086378393,0.0005576796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035263195,0.0000013866143,0.0001625806,0.000012260863,0.000003268508,0.000045491597,0.00014693847,0.0018871152,0.00019968238,0.9909244,0.00027715592,0.0063362564],"study_design_scores_gemma":[0.0000020298266,0.000003005384,0.00018667422,0.00000634361,0.0000034760978,0.00007461072,0.000038646154,0.0022329404,0.00009197568,0.9917345,0.005623117,0.0000027003805],"about_ca_topic_score_codex":0.000649424,"about_ca_topic_score_gemma":0.0006971084,"teacher_disagreement_score":0.0043126587,"about_ca_system_score_codex":0.0005957232,"about_ca_system_score_gemma":0.00023405257,"threshold_uncertainty_score":0.014427304},"labels":[],"label_agreement":null},{"id":"W4413302136","doi":"10.1007/978-3-032-01475-7_5","title":"Relativized Codes, Finite Decodability, and Bounded Languages","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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 Saskatchewan","funders":"","keywords":"Computer science; Bounded function; Programming language; Theoretical computer science; Algorithm; Mathematics","score_opus":0.010051892593447598,"score_gpt":0.25190771235810155,"score_spread":0.24185581976465395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413302136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18343556,0.023633378,0.437872,0.009190352,0.0016008229,0.00009968194,0.00073337543,0.0009553933,0.3424794],"genre_scores_gemma":[0.91182536,0.00520638,0.03158336,0.0009298124,0.0010682992,0.00018879335,0.0005129754,0.00026111238,0.048423927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781847,0.0006570088,0.000118528435,0.00041675504,0.0006972178,0.00029212644],"domain_scores_gemma":[0.9935248,0.004111974,0.00033558425,0.0014038628,0.00045851347,0.00016537288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014873459,0.0006466977,0.0011398081,0.001325617,0.0019177619,0.0039256285,0.0015394966,0.002131228,0.005475285],"category_scores_gemma":[0.007531685,0.00058204896,0.00095252745,0.0019131884,0.008943088,0.009336015,0.002916646,0.0057940357,0.001013966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103466855,0.0000051676407,0.000029866324,0.000019318526,0.0000023101202,0.00001307855,0.00011061248,0.000655631,0.00017994152,0.9956298,0.0007207126,0.002623126],"study_design_scores_gemma":[0.0000025031422,0.000004568569,0.000020886462,0.000008745453,0.0000021496726,0.000019024234,0.000021937934,0.0010062562,0.00016185903,0.99715436,0.0015916086,0.0000061253954],"about_ca_topic_score_codex":0.0017376819,"about_ca_topic_score_gemma":0.0010541179,"teacher_disagreement_score":0.005475285,"about_ca_system_score_codex":0.0024545745,"about_ca_system_score_gemma":0.0011974741,"threshold_uncertainty_score":0.018316627},"labels":[],"label_agreement":null},{"id":"W4413302318","doi":"10.1007/978-3-032-01475-7_12","title":"Improved Upper Bounds for Determinizing NIDPDAs with Limited Nondeterminism","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","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":"Queen's University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.014362662823750346,"score_gpt":0.24837662059048546,"score_spread":0.23401395776673511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413302318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029523714,0.00719696,0.86509275,0.0047575217,0.0014632203,0.0007435971,0.002246298,0.008763921,0.080212034],"genre_scores_gemma":[0.52763444,0.0062776976,0.42061043,0.002787577,0.0034243735,0.0018897159,0.00354555,0.003984149,0.02984609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96783227,0.0051038587,0.0019343457,0.005881313,0.01198759,0.0072606695],"domain_scores_gemma":[0.8738468,0.09200004,0.0028184925,0.020099662,0.007109922,0.0041250167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01636243,0.004832388,0.0060932375,0.008228685,0.0058076615,0.014973837,0.014564704,0.0046590576,0.026602626],"category_scores_gemma":[0.066939086,0.004214649,0.008205858,0.00719469,0.007863269,0.029779669,0.021941826,0.022530833,0.007671169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023874629,0.00093374815,0.0028453916,0.0020514573,0.00041824885,0.00038028497,0.0009380551,0.16976656,0.010216157,0.59736556,0.028338237,0.18435888],"study_design_scores_gemma":[0.00012673085,0.00016886306,0.0005249132,0.0003201498,0.00048068038,0.00022003027,0.00016785572,0.37977442,0.008940918,0.59801686,0.011111344,0.00014722852],"about_ca_topic_score_codex":0.005006064,"about_ca_topic_score_gemma":0.0102967,"teacher_disagreement_score":0.026602626,"about_ca_system_score_codex":0.012846883,"about_ca_system_score_gemma":0.011816333,"threshold_uncertainty_score":0.093211114},"labels":[],"label_agreement":null},{"id":"W4413306728","doi":"10.1007/978-3-032-00656-1_3","title":"GNN’s Uncertainty Quantification Using Self-distillation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fault Detection and Control Systems","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":"Vector Institute; Toronto Metropolitan University","funders":"","keywords":"Computer science; Distillation; Artificial intelligence; Chromatography; Chemistry","score_opus":0.014018653918300514,"score_gpt":0.23840713046637327,"score_spread":0.22438847654807276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306728","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.004460865,0.0007473529,0.95581716,0.0007270155,0.00075247104,0.000032840548,0.00017609948,0.0005094519,0.03677662],"genre_scores_gemma":[0.38899475,0.001268077,0.5550229,0.0012883533,0.0006902619,0.00015802837,0.00060679216,0.0010991789,0.050871648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985424,0.00040072788,0.00007887865,0.00024320954,0.00064879947,0.000086002095],"domain_scores_gemma":[0.9991252,0.00035414592,0.000040403615,0.00023841124,0.00020542754,0.000036401263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017302643,0.0012345096,0.00089567574,0.0011090027,0.00079311436,0.0017899827,0.0014379354,0.0013316155,0.005536506],"category_scores_gemma":[0.0040302146,0.0004976222,0.001125438,0.0010119616,0.0031042488,0.00406039,0.004368094,0.003388147,0.0016070787],"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.000048624268,0.000015002596,0.00007840523,0.000099774705,0.000032758962,0.000041879182,0.00005552515,0.032420456,0.0024482242,0.90385836,0.004353959,0.056546994],"study_design_scores_gemma":[0.00000612782,0.000020984835,0.00006710186,0.00003644964,0.0000130347025,0.00005688065,0.000009201239,0.1806316,0.0053246515,0.79898435,0.014815895,0.00003372668],"about_ca_topic_score_codex":0.0018436831,"about_ca_topic_score_gemma":0.0019014712,"teacher_disagreement_score":0.005536506,"about_ca_system_score_codex":0.0014188442,"about_ca_system_score_gemma":0.00094639644,"threshold_uncertainty_score":0.018521428},"labels":[],"label_agreement":null},{"id":"W4413306839","doi":"10.1007/978-3-032-00656-1_12","title":"Unmasking the Algorithm: Bridging Innovation and Ethics in AI-Enabled Psychological Care","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Mental Health Interventions","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bridging (networking); Computer science; Algorithm; Computer security","score_opus":0.053509806330210255,"score_gpt":0.4022330254550142,"score_spread":0.348723219124804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012477051,0.007900842,0.5814879,0.08218253,0.001813468,0.00018278515,0.00007110168,0.00042262019,0.31346172],"genre_scores_gemma":[0.5873505,0.0065061958,0.32751897,0.009601633,0.0012593749,0.00048371404,0.00013978501,0.0004915208,0.066648304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948886,0.0033260756,0.00017686484,0.00031829445,0.0010338451,0.00025640836],"domain_scores_gemma":[0.9784782,0.018374681,0.0004726976,0.001404859,0.0008127909,0.00045690764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008790548,0.00046685297,0.00042260034,0.0009131625,0.0018476932,0.0073149977,0.0016991607,0.0030305337,0.0077476874],"category_scores_gemma":[0.020966448,0.000307908,0.0005323067,0.00079567154,0.020111198,0.010002751,0.0037353772,0.0072642523,0.0015315162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014965203,0.000025312627,0.00019219909,0.000085074425,0.000007786402,0.000031634965,0.0013452523,0.0009918645,0.00022281773,0.9498183,0.00478132,0.04248348],"study_design_scores_gemma":[0.000008246904,0.000012110226,0.000087866094,0.00011190855,0.0000039924316,0.00004677744,0.00039510214,0.0038188412,0.00037628098,0.96442986,0.0306996,0.000009468864],"about_ca_topic_score_codex":0.0012057642,"about_ca_topic_score_gemma":0.0012447359,"teacher_disagreement_score":0.008790548,"about_ca_system_score_codex":0.0025716189,"about_ca_system_score_gemma":0.004440537,"threshold_uncertainty_score":0.046489418},"labels":[],"label_agreement":null},{"id":"W4413344704","doi":"10.1007/978-3-032-02215-8_22","title":"Explaining Recovery Trajectories of Older Adults Post Lower-Limb Fracture Using Modality-Wise Multiview Clustering and Large Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hip and Femur Fractures","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Rehabilitation Institute; University Health Network","funders":"","keywords":"Modality (human–computer interaction); Computer science; Cluster analysis; Artificial intelligence; Computer vision","score_opus":0.014319861398287363,"score_gpt":0.2752888283813079,"score_spread":0.2609689669830206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413344704","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.75299984,0.0023747282,0.22826838,0.0018732173,0.00011813439,0.000094778465,0.01158255,0.0010677007,0.0016206305],"genre_scores_gemma":[0.95697725,0.0005721119,0.030912504,0.00011622415,0.000049062073,0.00007347495,0.008385723,0.000104280465,0.0028093006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997998,0.00004860252,0.00001270396,0.00007832339,0.000018244395,0.000042320655],"domain_scores_gemma":[0.99903035,0.0006910441,0.00008259069,0.000059699774,0.00009047426,0.000045883105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009900838,0.000606497,0.00052216806,0.00081913976,0.00029288823,0.00082922715,0.00093011046,0.00079242775,0.0023854226],"category_scores_gemma":[0.0037256693,0.00033612072,0.0014856665,0.00081554166,0.00020048526,0.0009195743,0.0007009943,0.001386977,0.001058852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011751483,0.0005919708,0.24205491,0.00028036992,0.0007836418,0.00073416025,0.0015334579,0.36723146,0.0045198677,0.006118075,0.01760076,0.35737616],"study_design_scores_gemma":[0.000013660638,0.00009665559,0.041577052,0.00004809489,0.00009176949,0.00014670835,0.00042536837,0.9423685,0.00062169565,0.013425522,0.0011483177,0.000036680725],"about_ca_topic_score_codex":0.046318967,"about_ca_topic_score_gemma":0.051484317,"teacher_disagreement_score":0.046318967,"about_ca_system_score_codex":0.0006992265,"about_ca_system_score_gemma":0.00060908025,"threshold_uncertainty_score":0.09209877},"labels":[],"label_agreement":null},{"id":"W4413344713","doi":"10.1007/978-3-032-02215-8_7","title":"An Enhanced FP-Growth Algorithm with Hybrid Adaptive Support Threshold for Association Rule Mining","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Association rule learning; Computer science; Algorithm; Association (psychology); Data mining","score_opus":0.012265090170242443,"score_gpt":0.2501160330562981,"score_spread":0.23785094288605566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413344713","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.016364364,0.00091487134,0.977836,0.00023749075,0.0002455561,0.00010881387,0.00038662538,0.002525778,0.0013804676],"genre_scores_gemma":[0.10868954,0.00039492024,0.8862979,0.00018399698,0.00018514322,0.0001816232,0.0010666954,0.00018581042,0.002814417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817455,0.00034660482,0.00016574613,0.00034813484,0.0008167294,0.00014821075],"domain_scores_gemma":[0.99612063,0.0017274827,0.00011985464,0.0004949805,0.0014043618,0.00013266307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021704424,0.0009015765,0.0020733303,0.00224709,0.0007932535,0.0017192888,0.0034936005,0.0013868568,0.0030468714],"category_scores_gemma":[0.0063530686,0.00052445836,0.0010948406,0.0035736694,0.00044842524,0.0018873152,0.0015436397,0.0015148773,0.0025383085],"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.00046997517,0.00032315232,0.0024995399,0.00019383305,0.0001563855,0.00039836188,0.000078309364,0.058757532,0.012434726,0.0042304075,0.00914118,0.9113167],"study_design_scores_gemma":[0.000042697255,0.000096036594,0.00056529813,0.000017482223,0.00005149334,0.00039302403,0.00002367579,0.9867851,0.0045386893,0.003785828,0.0036786248,0.000022018841],"about_ca_topic_score_codex":0.0050408873,"about_ca_topic_score_gemma":0.004438746,"teacher_disagreement_score":0.0050408873,"about_ca_system_score_codex":0.00044150982,"about_ca_system_score_gemma":0.0016900066,"threshold_uncertainty_score":0.011478543},"labels":[],"label_agreement":null},{"id":"W4413358246","doi":"10.1007/978-3-032-02049-9_3","title":"A Hybrid Data Model to Support Transportation Analytics of Emergency Service Vehicles","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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 Manitoba","funders":"","keywords":"Computer science; Analytics; Service (business); Data analysis; Data science; Operations research; Data mining; Engineering","score_opus":0.03259070706759271,"score_gpt":0.2649005199666026,"score_spread":0.23230981289900987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413358246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04404433,0.00028994516,0.94779915,0.00041767614,0.00016026606,0.00009982618,0.0026941851,0.0031006127,0.0013940361],"genre_scores_gemma":[0.54659116,0.000453224,0.4376834,0.0002226707,0.00011618383,0.00033771704,0.008737992,0.00037570935,0.005481955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966836,0.00006153246,0.000037588365,0.000085984764,0.00012000503,0.00002658215],"domain_scores_gemma":[0.99914265,0.00037122503,0.00004224253,0.00013319124,0.0002717026,0.0000389647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008641104,0.0006039546,0.0005860941,0.00083670643,0.00028704313,0.0013648662,0.0012894579,0.00064826576,0.001963439],"category_scores_gemma":[0.002254478,0.00035231785,0.0008783981,0.0009863583,0.00020844003,0.0018834916,0.0008287872,0.00088884094,0.000903523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037820474,0.00042058027,0.0067084916,0.00011272659,0.00020641714,0.00017787384,0.0000856192,0.78149605,0.008656268,0.0126277255,0.010349423,0.1787807],"study_design_scores_gemma":[0.000004307921,0.000012322506,0.00017712683,0.0000026127839,0.000009526546,0.000010884939,0.000005106424,0.9969812,0.0004975722,0.001528223,0.0007670375,0.000004031301],"about_ca_topic_score_codex":0.010594463,"about_ca_topic_score_gemma":0.012695269,"teacher_disagreement_score":0.010594463,"about_ca_system_score_codex":0.0006621368,"about_ca_system_score_gemma":0.00083093013,"threshold_uncertainty_score":0.021065593},"labels":[],"label_agreement":null},{"id":"W4413373092","doi":"10.1007/978-3-032-02018-5_35","title":"Uncovering Unsafe Feature Interactions in Vehicle Control Using Generative AI and Digital Twins","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Critical Systems Labs","funders":"","keywords":"Computer science; Generative grammar; Feature (linguistics); Control (management); Human–computer interaction; Artificial intelligence","score_opus":0.017737517385578803,"score_gpt":0.27524651233036507,"score_spread":0.25750899494478624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413373092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32037416,0.00045308113,0.66552943,0.0003244157,0.00004220843,0.000061202765,0.0001853063,0.0018609617,0.011169141],"genre_scores_gemma":[0.8803515,0.00012228402,0.11642249,0.00005045645,0.000008612067,0.000024858318,0.00016128889,0.00017924534,0.0026792325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947387,0.00011615889,0.000018790624,0.00012785291,0.00019534826,0.000067939414],"domain_scores_gemma":[0.9974558,0.0017168049,0.00018383986,0.0004364296,0.00015396577,0.000053146206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000483178,0.000376544,0.0003720561,0.0012123672,0.0005774799,0.0010495766,0.001025805,0.00069710606,0.002131661],"category_scores_gemma":[0.003599881,0.00044882423,0.00050968677,0.0008964425,0.0014100879,0.0016232653,0.0013927434,0.0012416709,0.00029102276],"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.0003395356,0.00028341205,0.025667189,0.00037289888,0.00013574534,0.0013102054,0.0034847034,0.16231284,0.065206304,0.2156757,0.002491902,0.52271956],"study_design_scores_gemma":[0.000014962491,0.00009180771,0.0060064024,0.000049480328,0.000044906803,0.00041141518,0.0007713259,0.8518306,0.019913625,0.11536326,0.005465106,0.000037146343],"about_ca_topic_score_codex":0.003566323,"about_ca_topic_score_gemma":0.0051577343,"teacher_disagreement_score":0.003566323,"about_ca_system_score_codex":0.000525792,"about_ca_system_score_gemma":0.00054624444,"threshold_uncertainty_score":0.0071311593},"labels":[],"label_agreement":null},{"id":"W4413373101","doi":"10.1007/978-3-032-02018-5_18","title":"Ensuring Information Security in Inclusive Digital Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Accessibility for Disabilities","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":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Information security; Computer security; World Wide Web","score_opus":0.008293918989643939,"score_gpt":0.258113990623336,"score_spread":0.24982007163369208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413373101","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019757355,0.013204571,0.15272957,0.020192467,0.001044333,0.00017598153,0.000116515206,0.00059386523,0.79218525],"genre_scores_gemma":[0.55609256,0.027197517,0.08496869,0.0033726366,0.0007038519,0.00023941153,0.00029109232,0.00040490477,0.3267294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775887,0.0007306107,0.00010251086,0.00013843607,0.0009630362,0.00030647079],"domain_scores_gemma":[0.99606496,0.0022914603,0.00022984759,0.00069254765,0.0005028239,0.00021835373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002250713,0.00053843064,0.00034481604,0.0011105071,0.0016741075,0.0077842474,0.001316742,0.0026980797,0.014902402],"category_scores_gemma":[0.0062406734,0.00040712382,0.0003347978,0.0011633065,0.0031805388,0.009841109,0.0053157336,0.003132369,0.004749647],"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.000025359735,0.000053525022,0.0006412796,0.00027546473,0.000010543501,0.00027556787,0.0033638615,0.0025606968,0.0015928749,0.7191173,0.040417008,0.23166652],"study_design_scores_gemma":[0.0000067510273,0.000048924245,0.00087950635,0.0011123494,0.00001525965,0.00083564327,0.003885061,0.004182704,0.0040269983,0.56470335,0.42027417,0.000029274383],"about_ca_topic_score_codex":0.0015635057,"about_ca_topic_score_gemma":0.0016277232,"teacher_disagreement_score":0.014902402,"about_ca_system_score_codex":0.0016772905,"about_ca_system_score_gemma":0.0026284868,"threshold_uncertainty_score":0.049853563},"labels":[],"label_agreement":null},{"id":"W4413373109","doi":"10.1007/978-3-032-02018-5_16","title":"Certus: A Domain Specific Language for Confidence Assessment in Assurance Cases","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"Critical Systems Labs; University of Victoria","funders":"","keywords":"Computer science; Domain (mathematical analysis); Domain-specific language; Natural language processing; Artificial intelligence; Software engineering; Mathematics","score_opus":0.011549129852961564,"score_gpt":0.2458385963605707,"score_spread":0.23428946650760915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413373109","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.00096800807,0.00010192358,0.9625502,0.0003094953,0.00012161845,0.00018291772,0.0019567348,0.024758665,0.009050418],"genre_scores_gemma":[0.05164194,0.0003800333,0.91142887,0.0008003217,0.00022174716,0.00094348745,0.008554229,0.011382716,0.014646666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965215,0.001126198,0.000697796,0.00045586968,0.0010112514,0.00018734412],"domain_scores_gemma":[0.9916266,0.0058489563,0.00049077295,0.00078140927,0.0010982665,0.00015387933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004007799,0.0016415516,0.00079101836,0.0018345357,0.0006394354,0.0035413594,0.0024387585,0.002163099,0.040884126],"category_scores_gemma":[0.013589326,0.0013169177,0.0014948738,0.0010977434,0.001652144,0.0047931513,0.0024198177,0.0038684355,0.013618524],"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.00021912651,0.00013994795,0.0010734051,0.0015006559,0.000072282855,0.0009802543,0.0014216463,0.01587529,0.006849059,0.512317,0.18323681,0.2763146],"study_design_scores_gemma":[0.000116606105,0.00009477831,0.00051850174,0.0007956572,0.000059107868,0.0022323623,0.0002614724,0.13780183,0.016766487,0.27284905,0.5683921,0.00011212179],"about_ca_topic_score_codex":0.0011413748,"about_ca_topic_score_gemma":0.0013986037,"teacher_disagreement_score":0.040884126,"about_ca_system_score_codex":0.0008700088,"about_ca_system_score_gemma":0.0013992324,"threshold_uncertainty_score":0.13677108},"labels":[],"label_agreement":null},{"id":"W4413374215","doi":"10.1007/978-3-031-99872-0_19","title":"SProBench: Stream Processing Benchmark for High Performance Computing Infrastructure","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Stream processing; Distributed computing; Parallel computing; Cartography","score_opus":0.009209012185325566,"score_gpt":0.2398295776841203,"score_spread":0.23062056549879473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413374215","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19776183,0.0049131922,0.17676601,0.0029268456,0.0034028066,0.001423986,0.13450105,0.3634075,0.11489682],"genre_scores_gemma":[0.3735774,0.0017769231,0.2742167,0.0010694186,0.00031252543,0.0011102227,0.28763044,0.020142063,0.040164266],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979157,0.00026827774,0.00017596634,0.00025664826,0.0011131294,0.0002703401],"domain_scores_gemma":[0.9974837,0.00052557146,0.000106903375,0.000440251,0.0011892366,0.00025439393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015357499,0.0017931218,0.0006394184,0.0016477564,0.00078311446,0.0013228196,0.0037470881,0.00086848857,0.011188556],"category_scores_gemma":[0.005411595,0.00063298,0.0006290526,0.0034164349,0.00049475883,0.0020954132,0.0009519604,0.001909686,0.0037038603],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017035118,0.0004984931,0.0024448084,0.0010873682,0.00018363363,0.00016418636,0.00015334708,0.050166745,0.015989862,0.011930208,0.80156916,0.114108674],"study_design_scores_gemma":[0.0013292871,0.0008612113,0.008469539,0.00016823004,0.00019693385,0.00029116345,0.00026346228,0.61477315,0.102626815,0.023497544,0.24735476,0.00016790195],"about_ca_topic_score_codex":0.01616269,"about_ca_topic_score_gemma":0.017769335,"teacher_disagreement_score":0.01616269,"about_ca_system_score_codex":0.0015341436,"about_ca_system_score_gemma":0.0030556023,"threshold_uncertainty_score":0.03742951},"labels":[],"label_agreement":null},{"id":"W4413374224","doi":"10.1007/978-3-031-99872-0_2","title":"Cache Management for Mixture-of-Experts LLMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Canadian Institute for International Peace and Security","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Cache; Parallel computing","score_opus":0.019212463666271575,"score_gpt":0.2709219489793063,"score_spread":0.2517094853130348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413374224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12917174,0.0031896357,0.8276345,0.0013603176,0.00053545897,0.00023324328,0.0010029831,0.021092916,0.015779179],"genre_scores_gemma":[0.8249893,0.00051807234,0.15408926,0.00042399202,0.00025937546,0.00017318697,0.0011463577,0.00089877576,0.017501615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876225,0.00027765016,0.000109327644,0.00019187051,0.0003191424,0.000339912],"domain_scores_gemma":[0.99506855,0.001732713,0.00019954894,0.0016270014,0.0009783758,0.00039387896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017666279,0.0007103064,0.0014833029,0.0011094877,0.0014154771,0.0023215064,0.0030836498,0.0013686807,0.01331764],"category_scores_gemma":[0.009305343,0.0004886229,0.0006883059,0.0013523033,0.00055463717,0.0034392232,0.0029341704,0.0013659032,0.0026172814],"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.003130644,0.00069921033,0.005778182,0.0005740736,0.0002732326,0.0010170287,0.0007710302,0.26001024,0.0155529,0.051590048,0.0819409,0.5786625],"study_design_scores_gemma":[0.00008643557,0.0001702367,0.00036992543,0.00005111706,0.000068416404,0.0002598388,0.0001577924,0.956741,0.005286621,0.025970627,0.010804013,0.000034021665],"about_ca_topic_score_codex":0.0048819575,"about_ca_topic_score_gemma":0.01072808,"teacher_disagreement_score":0.01331764,"about_ca_system_score_codex":0.0015418291,"about_ca_system_score_gemma":0.0022396382,"threshold_uncertainty_score":0.04455197},"labels":[],"label_agreement":null},{"id":"W4413413852","doi":"10.1007/978-3-032-01241-8_14","title":"Balancing the Risks and Benefits of Using Large Language Models to Support Assurance Case Development","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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 Toronto; Critical Systems Labs; University of Victoria","funders":"","keywords":"Computer science; Software engineering; Risk analysis (engineering); Operations research; Engineering","score_opus":0.02598692833681027,"score_gpt":0.24242178802577727,"score_spread":0.216434859688967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413413852","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10292435,0.0008498019,0.8524291,0.005942372,0.00014331807,0.00065379095,0.0002924058,0.0042050853,0.03255973],"genre_scores_gemma":[0.5164481,0.00048625277,0.47659782,0.0005512299,0.000057437832,0.00043993967,0.00044456977,0.0008129611,0.0041617732],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.977944,0.012263386,0.0010155337,0.00079727225,0.00730043,0.0006793249],"domain_scores_gemma":[0.77373403,0.19163007,0.0047662817,0.022398006,0.006105121,0.0013664244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02213932,0.00077699387,0.0005334327,0.002079285,0.00091718015,0.0062976256,0.002718285,0.0019574799,0.0036813584],"category_scores_gemma":[0.13015585,0.0011624248,0.0007838398,0.0012483418,0.0018148904,0.010909473,0.0061469935,0.00355968,0.0016458365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001046158,0.00077395065,0.011628325,0.0006433068,0.00017616489,0.000886086,0.0049462295,0.09778705,0.02341943,0.18614182,0.008123025,0.6644284],"study_design_scores_gemma":[0.00023926025,0.0008388359,0.0047490625,0.001166884,0.00035258677,0.0014624067,0.002558089,0.6492295,0.025954964,0.2597266,0.05352346,0.00019818505],"about_ca_topic_score_codex":0.0018889541,"about_ca_topic_score_gemma":0.003573221,"teacher_disagreement_score":0.02213932,"about_ca_system_score_codex":0.0016976051,"about_ca_system_score_gemma":0.0028933424,"threshold_uncertainty_score":0.11708534},"labels":[],"label_agreement":null},{"id":"W4413413869","doi":"10.1007/978-3-032-01241-8_2","title":"Principled Safety Assurance Arguments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","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":"McMaster University","funders":"","keywords":"Computer science; Safety assurance; Programming language; Software engineering; Artificial intelligence; Risk analysis (engineering)","score_opus":0.007333396276792827,"score_gpt":0.20818758010734406,"score_spread":0.20085418383055123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413413869","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033060506,0.0021453733,0.09425284,0.01993789,0.0014968237,0.000044287837,0.00010690315,0.00016391886,0.87854594],"genre_scores_gemma":[0.6511759,0.003566288,0.049592543,0.02330052,0.003487581,0.0006181779,0.00030340144,0.00042402223,0.26753154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961532,0.0011889945,0.00010579064,0.0005155013,0.0017064465,0.00033004466],"domain_scores_gemma":[0.9956043,0.0027689096,0.00016772587,0.00084399094,0.00050652266,0.000108561544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041389395,0.00077536923,0.00071580795,0.001158541,0.0020707913,0.0038579628,0.0015175135,0.005117185,0.020293329],"category_scores_gemma":[0.00996938,0.00071021065,0.0010663886,0.0006012382,0.00960073,0.006394677,0.0034249346,0.010602314,0.0053796414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004298296,0.0000043776163,0.00000722138,0.0000136444105,0.0000018180181,0.0000073416577,0.000041450967,0.0001247723,0.00005585002,0.9941847,0.0031287223,0.002425745],"study_design_scores_gemma":[0.000004204042,0.0000031623865,0.000014617778,0.000021780072,0.0000023420944,0.00001621179,0.000012055763,0.00022090792,0.00012697947,0.9817954,0.017780177,0.000002159662],"about_ca_topic_score_codex":0.0003023357,"about_ca_topic_score_gemma":0.00030998894,"teacher_disagreement_score":0.020293329,"about_ca_system_score_codex":0.0022929397,"about_ca_system_score_gemma":0.0012713519,"threshold_uncertainty_score":0.06788796},"labels":[],"label_agreement":null},{"id":"W4413433805","doi":"10.1007/978-3-032-02602-6_17","title":"Self-verifying Predicates in Büchi Arithmetic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arithmetic; Programming language; Theoretical computer science; Mathematics","score_opus":0.008840546809535327,"score_gpt":0.2269995450683038,"score_spread":0.21815899825876847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413433805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09044567,0.003046903,0.51743984,0.0019258258,0.00078733684,0.00011030326,0.0005834164,0.0015896468,0.3840711],"genre_scores_gemma":[0.81336033,0.0019220113,0.09088637,0.00037942306,0.0005287356,0.0001494739,0.00066592405,0.00053907145,0.09156877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.00009855211,0.00003335274,0.000075603464,0.0001367967,0.00005903612],"domain_scores_gemma":[0.99905604,0.00064316974,0.000042153075,0.00015057898,0.00007924828,0.00002882653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076658675,0.0003828895,0.0005150806,0.000725983,0.0010604585,0.0020140354,0.00067167485,0.0005904146,0.007706003],"category_scores_gemma":[0.0015556797,0.00057188096,0.0006170336,0.0013454662,0.0024528601,0.0070208185,0.0012485791,0.0022151552,0.0015358676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017784334,0.000007285671,0.00003370827,0.00003256352,0.0000018961201,0.00001820545,0.00013932225,0.0005443613,0.00058983226,0.9867264,0.0013780493,0.01051063],"study_design_scores_gemma":[0.0000056415865,0.000009693602,0.000050599298,0.000011104521,0.000004229111,0.000045472163,0.000035023884,0.0019130025,0.0013402015,0.9873653,0.009214831,0.000005093435],"about_ca_topic_score_codex":0.0003114945,"about_ca_topic_score_gemma":0.00036945366,"teacher_disagreement_score":0.007706003,"about_ca_system_score_codex":0.0008403306,"about_ca_system_score_gemma":0.0005150518,"threshold_uncertainty_score":0.025779188},"labels":[],"label_agreement":null},{"id":"W4413436630","doi":"10.1007/978-3-032-01241-8_1","title":"SmartGSN: An Online Tool to Semi-automatically Manage Assurance Cases","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Software engineering; Artificial intelligence; World Wide Web; Information retrieval","score_opus":0.012772308395796388,"score_gpt":0.22623628504361262,"score_spread":0.21346397664781624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413436630","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.0063215746,0.00015265273,0.69464386,0.00019291078,0.00015486292,0.0005230463,0.0044354587,0.27724892,0.016326783],"genre_scores_gemma":[0.10552021,0.0003333344,0.83299494,0.00037212588,0.0000874109,0.0010184378,0.017193943,0.018621385,0.023858216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857485,0.0003240446,0.00015294235,0.0002256486,0.00064542005,0.0000771045],"domain_scores_gemma":[0.99498653,0.0033094727,0.00028827533,0.0008624149,0.00033954604,0.0002138235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022046315,0.0015170815,0.00076418964,0.0030425668,0.00043766806,0.0024168233,0.0021458974,0.00093148375,0.05749737],"category_scores_gemma":[0.009438733,0.0010524953,0.0010563979,0.0009090789,0.00065497396,0.0035289258,0.0037645,0.001193788,0.017509533],"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.00080262264,0.0003424972,0.0038224855,0.0010676517,0.000116624185,0.0006601117,0.00086478627,0.016217433,0.008969073,0.029265976,0.18888022,0.7489905],"study_design_scores_gemma":[0.00047086764,0.0001487921,0.00222564,0.0006082492,0.00009060881,0.00096892077,0.00037477637,0.5404694,0.033002574,0.09713726,0.32435793,0.00014497957],"about_ca_topic_score_codex":0.0015779178,"about_ca_topic_score_gemma":0.0034287646,"teacher_disagreement_score":0.05749737,"about_ca_system_score_codex":0.0008320204,"about_ca_system_score_gemma":0.0012102874,"threshold_uncertainty_score":0.19234788},"labels":[],"label_agreement":null},{"id":"W4413437607","doi":"10.1007/978-3-031-99857-7_3","title":"ARM SVE Unleashed: Performance and Insights Across HPC Applications on Nvidia Grace","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Supercomputer; Computational science; Computer architecture; Operating system","score_opus":0.012286322679524458,"score_gpt":0.2610294713338044,"score_spread":0.24874314865427993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413437607","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.30488226,0.013733354,0.16529222,0.006994648,0.0035763958,0.00018450925,0.012319059,0.14734688,0.34567064],"genre_scores_gemma":[0.71022844,0.0032730112,0.09877612,0.0010679533,0.0004941494,0.00015843158,0.018027393,0.02387682,0.1440978],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993818,0.00008080829,0.000014802129,0.000069850095,0.00035244285,0.000100417936],"domain_scores_gemma":[0.9993617,0.00019661403,0.000022087628,0.00011852872,0.00021633916,0.00008482959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008143822,0.0006623201,0.0005190072,0.00050425564,0.00045190897,0.001487824,0.0010893906,0.0004580216,0.015494675],"category_scores_gemma":[0.0022458578,0.00051280286,0.0003414078,0.001165107,0.00032428835,0.0015875946,0.0009629866,0.0016585381,0.0039957287],"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.0011774972,0.00021451099,0.0029505533,0.0003300535,0.0000682107,0.0002362172,0.0005036394,0.036629573,0.018886121,0.017796868,0.5007632,0.42044362],"study_design_scores_gemma":[0.00019609326,0.0005126052,0.014207569,0.00017196393,0.00008270393,0.00036149993,0.0003615451,0.46953052,0.04189613,0.027734721,0.4447887,0.00015597865],"about_ca_topic_score_codex":0.0077728685,"about_ca_topic_score_gemma":0.010855199,"teacher_disagreement_score":0.015494675,"about_ca_system_score_codex":0.00064356753,"about_ca_system_score_gemma":0.0009783934,"threshold_uncertainty_score":0.05183482},"labels":[],"label_agreement":null},{"id":"W4413449397","doi":"10.1007/978-3-032-02515-9_20","title":"Online Usability and Service Standards in the Federal Context: A Comparative Analysis of Australia and Canada","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Usability; Computer science; Context (archaeology); Service (business); World Wide Web; Human–computer interaction; Geography; Archaeology","score_opus":0.03393889859569645,"score_gpt":0.3303425877590502,"score_spread":0.29640368916335375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413449397","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.9738462,0.0024497597,0.0001505059,0.0015166623,0.000016655584,0.000023863893,0.00013348385,0.0000092854825,0.021853698],"genre_scores_gemma":[0.994926,0.001089672,0.00013929495,0.0001070856,0.0000035508253,0.000010458775,0.00006833846,0.0000090992635,0.0036464615],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.995542,0.0007371936,0.00015031185,0.00024955606,0.00217787,0.0011430708],"domain_scores_gemma":[0.9861524,0.0035014004,0.0010764761,0.00023983081,0.0071015186,0.0019283917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027701275,0.00017933978,0.0005831045,0.0054506627,0.010302285,0.005660244,0.0011357627,0.0006675609,0.003230041],"category_scores_gemma":[0.012483608,0.00030872517,0.00037251072,0.014324765,0.0045106984,0.0018479755,0.0023725135,0.0011426079,0.0001534674],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061911787,0.00047299187,0.50644577,0.00046168573,0.00015770884,0.0010359738,0.25889775,0.0011316454,0.0013737747,0.06442656,0.010528666,0.15444838],"study_design_scores_gemma":[0.0000095057185,0.00006375697,0.8736506,0.00022390868,0.000056491255,0.00009292407,0.10992646,0.00064485666,0.00024264344,0.00077704707,0.014266434,0.00004540334],"about_ca_topic_score_codex":0.99367636,"about_ca_topic_score_gemma":0.9969694,"teacher_disagreement_score":0.086133145,"about_ca_system_score_codex":0.086133145,"about_ca_system_score_gemma":0.09716018,"threshold_uncertainty_score":0.62494266},"labels":[],"label_agreement":null},{"id":"W4413454543","doi":"10.1007/978-3-032-01901-1","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Tsinghua University; Bar-Ilan University; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Carnegie Mellon University; Indian Institute of Science; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Centre National de la Recherche Scientifique; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"Computer science; Cryptography; Computer security","score_opus":0.008850113236270708,"score_gpt":0.26633586662450637,"score_spread":0.25748575338823565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413454543","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018990755,0.059187543,0.032586563,0.006876008,0.014063062,0.00011530921,0.0009241014,0.0013093341,0.883039],"genre_scores_gemma":[0.020031787,0.03425353,0.015660483,0.0019399563,0.0056643807,0.000089673704,0.0014956099,0.0008153566,0.92004925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943465,0.00006789633,0.000020829179,0.000072920884,0.00034682435,0.000056857167],"domain_scores_gemma":[0.99949276,0.00013104208,0.000037944093,0.00010054562,0.00015381932,0.000083950945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552937,0.0013945284,0.0006683223,0.0020366984,0.00076898764,0.0037419917,0.0006787682,0.00120974,0.082231],"category_scores_gemma":[0.0014009738,0.00047564707,0.00034011243,0.0025705392,0.00092149986,0.004491375,0.0013150307,0.0037443584,0.06501557],"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.00007709783,0.00005356161,0.00008536695,0.00033237707,0.000015058723,0.000053353808,0.000032033648,0.0008009856,0.0017294558,0.09933102,0.5652295,0.33226016],"study_design_scores_gemma":[0.000016312455,0.00003709893,0.00021274692,0.00016238319,0.0000063338475,0.00021916871,0.000012135852,0.0016241207,0.0011699084,0.02703649,0.9694912,0.0000120665745],"about_ca_topic_score_codex":0.0006143601,"about_ca_topic_score_gemma":0.0008727791,"teacher_disagreement_score":0.082231,"about_ca_system_score_codex":0.0014336352,"about_ca_system_score_gemma":0.0011772582,"threshold_uncertainty_score":0.2750901},"labels":[],"label_agreement":null},{"id":"W4413456702","doi":"10.1007/978-3-032-01881-6","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Tsinghua University; Bar-Ilan University; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Carnegie Mellon University; Indian Institute of Science; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Centre National de la Recherche Scientifique; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"Computer science; Cryptography; Computer security; Theoretical computer science","score_opus":0.008850113236270708,"score_gpt":0.26633586662450637,"score_spread":0.25748575338823565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413456702","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018990755,0.059187543,0.032586563,0.006876008,0.014063062,0.00011530921,0.0009241014,0.0013093341,0.883039],"genre_scores_gemma":[0.020031787,0.03425353,0.015660483,0.0019399563,0.0056643807,0.000089673704,0.0014956099,0.0008153566,0.92004925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943465,0.00006789633,0.000020829179,0.000072920884,0.00034682435,0.000056857167],"domain_scores_gemma":[0.99949276,0.00013104208,0.000037944093,0.00010054562,0.00015381932,0.000083950945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552937,0.0013945284,0.0006683223,0.0020366984,0.00076898764,0.0037419917,0.0006787682,0.00120974,0.082231],"category_scores_gemma":[0.0014009738,0.00047564707,0.00034011243,0.0025705392,0.00092149986,0.004491375,0.0013150307,0.0037443584,0.06501557],"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.00007709783,0.00005356161,0.00008536695,0.00033237707,0.000015058723,0.000053353808,0.000032033648,0.0008009856,0.0017294558,0.09933102,0.5652295,0.33226016],"study_design_scores_gemma":[0.000016312455,0.00003709893,0.00021274692,0.00016238319,0.0000063338475,0.00021916871,0.000012135852,0.0016241207,0.0011699084,0.02703649,0.9694912,0.0000120665745],"about_ca_topic_score_codex":0.0006143601,"about_ca_topic_score_gemma":0.0008727791,"teacher_disagreement_score":0.082231,"about_ca_system_score_codex":0.0014336352,"about_ca_system_score_gemma":0.0011772582,"threshold_uncertainty_score":0.2750901},"labels":[],"label_agreement":null},{"id":"W4413459658","doi":"10.1007/978-3-032-01881-6_18","title":"Hybrid Obfuscated Key Exchange and KEMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Computer security","score_opus":0.012132077991706092,"score_gpt":0.22859877018379746,"score_spread":0.21646669219209136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413459658","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.057329215,0.0020117348,0.8928698,0.0008503258,0.00060113857,0.00020522795,0.0004123987,0.003242641,0.04247753],"genre_scores_gemma":[0.75517094,0.0011837597,0.20291047,0.0002921156,0.00024067188,0.00018307728,0.00052424043,0.0005194667,0.03897528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979938,0.00042608334,0.00017142648,0.0003254962,0.00067759963,0.00040548507],"domain_scores_gemma":[0.9959908,0.0012715973,0.00018885733,0.002212232,0.00025364864,0.0000828646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016895458,0.0008124576,0.001100046,0.0010159372,0.0010641646,0.0021469207,0.0018721493,0.0015924817,0.012781166],"category_scores_gemma":[0.0044306787,0.00062112336,0.0009725745,0.0015637997,0.0019819434,0.006900521,0.00558696,0.002438169,0.0051194504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000983086,0.0001353222,0.00038279453,0.00046225384,0.00008385392,0.00045306626,0.00043909755,0.023284124,0.01680854,0.76034886,0.007129028,0.18949],"study_design_scores_gemma":[0.000105427454,0.00019398032,0.0002550796,0.00020125166,0.00010640563,0.0014643242,0.00013972251,0.10366149,0.049752485,0.8143278,0.029697336,0.00009480073],"about_ca_topic_score_codex":0.00013587947,"about_ca_topic_score_gemma":0.00016981296,"teacher_disagreement_score":0.012781166,"about_ca_system_score_codex":0.00072992616,"about_ca_system_score_gemma":0.0007581761,"threshold_uncertainty_score":0.042757273},"labels":[],"label_agreement":null},{"id":"W4413460024","doi":"10.1007/978-3-032-01881-6_16","title":"A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Computer science; Encryption; Witness; Computer security; Theoretical computer science; Programming language","score_opus":0.013119819387331134,"score_gpt":0.2583726171571709,"score_spread":0.24525279776983977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413460024","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.0062840893,0.0007626531,0.9664502,0.0008730549,0.00024726917,0.00014042133,0.00021593277,0.0011532533,0.023873042],"genre_scores_gemma":[0.4118525,0.0030605542,0.5347489,0.0011365304,0.00089943054,0.0008164439,0.0011511475,0.0010110312,0.04532348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973773,0.0006470006,0.0002107486,0.00046224214,0.0009855896,0.0003172056],"domain_scores_gemma":[0.997147,0.0013606108,0.0001534611,0.00089335645,0.00033503934,0.00011051291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024714977,0.0012317355,0.0013941329,0.0015873505,0.0018155678,0.0055395076,0.0031234242,0.0022629662,0.01136277],"category_scores_gemma":[0.006866961,0.0010327273,0.0020855763,0.0023369375,0.0039917757,0.012686869,0.006539132,0.006891838,0.0034555837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018170154,0.000014348055,0.000030362839,0.000040959843,0.00000630568,0.00004644666,0.000066512985,0.0018066723,0.00046775094,0.9859898,0.0014235881,0.010089064],"study_design_scores_gemma":[0.000011146915,0.000013793263,0.000021527838,0.000023260767,0.00000964319,0.000061530685,0.000023130033,0.017058197,0.0007810408,0.9758823,0.006100226,0.000014235357],"about_ca_topic_score_codex":0.0009240166,"about_ca_topic_score_gemma":0.00088375836,"teacher_disagreement_score":0.01136277,"about_ca_system_score_codex":0.0023826372,"about_ca_system_score_gemma":0.0015938332,"threshold_uncertainty_score":0.038012207},"labels":[],"label_agreement":null},{"id":"W4413460085","doi":"10.1007/978-3-032-01881-6_17","title":"Verifiable Decapsulation: Recognizing Faulty Implementations of Post-quantum KEMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Verifiable secret sharing; Computer science; Implementation; Programming language","score_opus":0.020224230014072368,"score_gpt":0.27755377546448856,"score_spread":0.2573295454504162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413460085","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.2406176,0.00037402695,0.7449436,0.0010431465,0.00029373614,0.00012851978,0.00036321004,0.0025095576,0.009726621],"genre_scores_gemma":[0.91905564,0.00016967846,0.0756662,0.00017652453,0.00007165301,0.00007049869,0.0003836617,0.00021705643,0.0041889925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967505,0.0006287151,0.00027120902,0.00062178005,0.0011226592,0.00060532027],"domain_scores_gemma":[0.98261744,0.008419167,0.0012680469,0.005678585,0.0017054334,0.00031143523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027680392,0.00071520824,0.0009716354,0.00073469576,0.0008992866,0.003494155,0.0024370956,0.0022733372,0.0038406628],"category_scores_gemma":[0.017371284,0.0007807803,0.0007927967,0.0007403106,0.0033392867,0.0077234255,0.004469776,0.0035953647,0.001269891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014503022,0.00019955743,0.005723537,0.0003742505,0.00013175093,0.000834201,0.0013036354,0.07926855,0.030726867,0.7166688,0.0064367787,0.15688184],"study_design_scores_gemma":[0.000059820843,0.00012996317,0.00045247652,0.00006806029,0.000040855204,0.0003235476,0.00026113237,0.26276374,0.037918903,0.6947578,0.0031659321,0.00005778229],"about_ca_topic_score_codex":0.00052992936,"about_ca_topic_score_gemma":0.00054665544,"teacher_disagreement_score":0.0038406628,"about_ca_system_score_codex":0.0010427186,"about_ca_system_score_gemma":0.0014773732,"threshold_uncertainty_score":0.01463896},"labels":[],"label_agreement":null},{"id":"W4413461343","doi":"10.1007/978-3-032-01884-7","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Tsinghua University; Bar-Ilan University; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Carnegie Mellon University; Indian Institute of Science; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Centre National de la Recherche Scientifique; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"Computer science; Cryptography; Computer security; Theoretical computer science; Programming language","score_opus":0.008850113236270708,"score_gpt":0.26633586662450637,"score_spread":0.25748575338823565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413461343","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018990755,0.059187543,0.032586563,0.006876008,0.014063062,0.00011530921,0.0009241014,0.0013093341,0.883039],"genre_scores_gemma":[0.020031787,0.03425353,0.015660483,0.0019399563,0.0056643807,0.000089673704,0.0014956099,0.0008153566,0.92004925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943465,0.00006789633,0.000020829179,0.000072920884,0.00034682435,0.000056857167],"domain_scores_gemma":[0.99949276,0.00013104208,0.000037944093,0.00010054562,0.00015381932,0.000083950945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552937,0.0013945284,0.0006683223,0.0020366984,0.00076898764,0.0037419917,0.0006787682,0.00120974,0.082231],"category_scores_gemma":[0.0014009738,0.00047564707,0.00034011243,0.0025705392,0.00092149986,0.004491375,0.0013150307,0.0037443584,0.06501557],"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.00007709783,0.00005356161,0.00008536695,0.00033237707,0.000015058723,0.000053353808,0.000032033648,0.0008009856,0.0017294558,0.09933102,0.5652295,0.33226016],"study_design_scores_gemma":[0.000016312455,0.00003709893,0.00021274692,0.00016238319,0.0000063338475,0.00021916871,0.000012135852,0.0016241207,0.0011699084,0.02703649,0.9694912,0.0000120665745],"about_ca_topic_score_codex":0.0006143601,"about_ca_topic_score_gemma":0.0008727791,"teacher_disagreement_score":0.082231,"about_ca_system_score_codex":0.0014336352,"about_ca_system_score_gemma":0.0011772582,"threshold_uncertainty_score":0.2750901},"labels":[],"label_agreement":null},{"id":"W4413473602","doi":"10.1007/978-3-032-02088-8_12","title":"A Model-Based Approach for Simple Construction and Efficient Evaluation of Dataframes","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Simple (philosophy)","score_opus":0.13159853737323232,"score_gpt":0.3751087621263499,"score_spread":0.2435102247531176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413473602","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.00061280525,0.000021635517,0.9976277,0.000024653174,0.000014286068,0.000048927523,0.00007568379,0.0010761146,0.0004983157],"genre_scores_gemma":[0.03213088,0.00005653019,0.9659752,0.000029616127,0.000014715958,0.00020833504,0.00032778847,0.0004665236,0.0007903179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740535,0.0007235571,0.00024947055,0.00037035573,0.0010693832,0.00018190577],"domain_scores_gemma":[0.995856,0.0017194836,0.00018329154,0.001072177,0.001039885,0.000129246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00274835,0.0015199402,0.0013934267,0.0023166444,0.0013678877,0.003886621,0.0026393372,0.0015358764,0.010427446],"category_scores_gemma":[0.012517106,0.0013180106,0.0022259282,0.0026230335,0.0008691724,0.0034533807,0.0027687936,0.002462242,0.0026005236],"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.00028227692,0.0002112519,0.0013324112,0.00041032958,0.00016399789,0.0002415706,0.00032266718,0.2864904,0.01900441,0.25163826,0.011964452,0.42793798],"study_design_scores_gemma":[0.00002776696,0.00004933548,0.00013408331,0.00003749618,0.000050403236,0.00007482508,0.00005083374,0.91609806,0.0076949974,0.06599992,0.009752119,0.000030220479],"about_ca_topic_score_codex":0.009058868,"about_ca_topic_score_gemma":0.010233923,"teacher_disagreement_score":0.010427446,"about_ca_system_score_codex":0.0020660462,"about_ca_system_score_gemma":0.003528443,"threshold_uncertainty_score":0.03488326},"labels":[],"label_agreement":null},{"id":"W4413477307","doi":"10.1007/978-3-032-02406-0_5","title":"Exploring Public Trust Through LLM-Driven Opinion Mining","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","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":"Calgary Laboratory Services; University of Calgary","funders":"","keywords":"Computer science; Public opinion; Data science; Computer security; World Wide Web; Information retrieval; Political science; Law","score_opus":0.10448317101686176,"score_gpt":0.28815018649621166,"score_spread":0.18366701547934988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2890033,0.00071400683,0.6908849,0.0024271414,0.00025718278,0.00024792436,0.0030370837,0.00233329,0.01109514],"genre_scores_gemma":[0.911752,0.00011662328,0.08269198,0.00020859978,0.00016948694,0.0000966876,0.002523332,0.00007631453,0.0023649368],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989177,0.00042783353,0.0000614709,0.00015857205,0.00029596325,0.00013851757],"domain_scores_gemma":[0.99367553,0.004206052,0.0005648904,0.00037393207,0.0010362118,0.00014327318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016910052,0.0004597393,0.000616042,0.0013805671,0.00045007444,0.0016260165,0.0010117231,0.0008168432,0.0028152487],"category_scores_gemma":[0.012559447,0.00024168793,0.000642084,0.0011350623,0.00027875663,0.0022865138,0.00104616,0.0012752643,0.0019312229],"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.0011202692,0.00094247947,0.062336747,0.0005251009,0.0004085167,0.0005382161,0.0010466429,0.07276718,0.020662969,0.029239176,0.043972,0.7664407],"study_design_scores_gemma":[0.000014909192,0.000045748737,0.002937623,0.000019411733,0.00002670374,0.000037780108,0.00017605654,0.9801192,0.0023189904,0.012394913,0.0018977404,0.000010980963],"about_ca_topic_score_codex":0.0034782605,"about_ca_topic_score_gemma":0.004901669,"teacher_disagreement_score":0.0034782605,"about_ca_system_score_codex":0.0008374442,"about_ca_system_score_gemma":0.00050624926,"threshold_uncertainty_score":0.009417951},"labels":[],"label_agreement":null},{"id":"W4413726998","doi":"10.1007/978-3-031-99854-6_10","title":"Leveraging Expert Usage to Speed up LLM Inference with Expert Parallelism","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"International Laboratory for Brain, Music and Sound Research","funders":"","keywords":"Computer science; Parallelism (grammar); Inference; Speedup; Parallel computing; Data parallelism; Expert system; Artificial intelligence","score_opus":0.03508971236646834,"score_gpt":0.2791464190751583,"score_spread":0.24405670670868995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413726998","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.026786976,0.00042090917,0.9483948,0.0005822548,0.00020402364,0.00012327191,0.00046141387,0.014498832,0.008527627],"genre_scores_gemma":[0.3489401,0.00022510775,0.6365342,0.0006468982,0.0002571726,0.00013057892,0.0014424019,0.0017122022,0.0101113375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802434,0.00061197556,0.00012678638,0.000558696,0.00048584203,0.00019233623],"domain_scores_gemma":[0.9931492,0.0038986637,0.00019089613,0.0018585112,0.00067449233,0.00022833269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021015322,0.0010072979,0.0010775862,0.0011764388,0.000676445,0.0018773396,0.002556289,0.0015378096,0.0187921],"category_scores_gemma":[0.014119913,0.0008386057,0.0010823034,0.0011862823,0.00066902203,0.004909842,0.0029376668,0.0026422485,0.0062983776],"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.0008463789,0.00041045708,0.004161647,0.0002618783,0.00015913349,0.00022511792,0.00032057374,0.06554599,0.018544523,0.016295109,0.027294843,0.86593443],"study_design_scores_gemma":[0.00007890717,0.000059348047,0.00065193453,0.000024249957,0.000048429873,0.00007272813,0.000060664202,0.94815683,0.00768377,0.0362121,0.0069323457,0.000018652265],"about_ca_topic_score_codex":0.005319994,"about_ca_topic_score_gemma":0.015646145,"teacher_disagreement_score":0.0187921,"about_ca_system_score_codex":0.0007853871,"about_ca_system_score_gemma":0.0016890148,"threshold_uncertainty_score":0.06286579},"labels":[],"label_agreement":null},{"id":"W4413799531","doi":"10.1007/978-3-031-97763-3_11","title":"Examining the Impact of Pilot Expertise and Task Difficulty on Visual Attention and Flight Performance in a High Visual-Fidelity Flight Simulator","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Flight simulator; Fidelity; Task (project management); Visual attention; Flight training; High fidelity; Simulation; Human–computer interaction; Systems engineering; Perception; Psychology; Engineering","score_opus":0.02693425167878102,"score_gpt":0.34709383782316205,"score_spread":0.32015958614438106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413799531","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.9995357,0.000037416008,0.00016884455,0.000009653195,0.0000020814057,0.000005926851,0.000018074004,0.0000027335902,0.00021954525],"genre_scores_gemma":[0.99926955,0.00003391038,0.00021427812,0.000012097035,0.000003927385,0.000009931676,0.00004973297,0.000003857635,0.000402762],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997925,0.00007229839,0.000010507748,0.000046997702,0.00004093915,0.000036798618],"domain_scores_gemma":[0.996183,0.003109069,0.0002201245,0.00006589869,0.0001271896,0.00029470498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043437947,0.00031869032,0.00019839103,0.00021274167,0.00013866919,0.0003341932,0.0003366043,0.0003829921,0.0019839052],"category_scores_gemma":[0.0033007623,0.0002181759,0.00022217495,0.00012471555,0.00020406571,0.00024927888,0.0003624489,0.00046123026,0.0001588245],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.018148035,0.01015887,0.4758317,0.0003413858,0.00086806196,0.0015990532,0.0027844834,0.011089402,0.39746988,0.00027893033,0.0010562228,0.08037399],"study_design_scores_gemma":[0.00007471973,0.005110047,0.983859,0.000009500046,0.0000890209,0.00019297402,0.0003824136,0.005593445,0.00442631,0.000109767214,0.00013566483,0.000017053098],"about_ca_topic_score_codex":0.0049619437,"about_ca_topic_score_gemma":0.0068164617,"teacher_disagreement_score":0.0049619437,"about_ca_system_score_codex":0.00020262979,"about_ca_system_score_gemma":0.00025876568,"threshold_uncertainty_score":0.009866118},"labels":[],"label_agreement":null},{"id":"W4413836745","doi":"10.1007/978-3-032-02138-0_24","title":"Software Architecture for a Robust, Multithreaded, Realtime, Control System Used on an Adaptive Racecar","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-time simulation and control systems","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":"General Motors (Canada)","funders":"","keywords":"Computer science; Architecture; Software; Control software; Software architecture; Embedded system; Operating system","score_opus":0.015111880083767404,"score_gpt":0.2283754852442437,"score_spread":0.2132636051604763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413836745","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.04625187,0.00023572876,0.9188192,0.00021392458,0.00014984146,0.00022214577,0.0001816299,0.019894084,0.014031611],"genre_scores_gemma":[0.60148424,0.0002989383,0.3535529,0.0002718873,0.000070256065,0.000462639,0.0007603432,0.0021706524,0.040928204],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980146,0.000029217554,0.000016734954,0.000046435784,0.00007661569,0.000029548488],"domain_scores_gemma":[0.9997911,0.000049617433,0.00001644924,0.000045741905,0.000073327996,0.000023796309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003155873,0.00049843633,0.00041048683,0.00043740866,0.00057258777,0.00093935785,0.0016987126,0.0008838645,0.011356048],"category_scores_gemma":[0.0005603392,0.00045114654,0.00041117886,0.00019973904,0.00038317178,0.00054354995,0.00068007194,0.0007655443,0.0021646854],"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.0010086433,0.0003319351,0.004039821,0.00056980876,0.00020591574,0.0012488641,0.0013290768,0.2055034,0.38906518,0.07278043,0.022642495,0.3012744],"study_design_scores_gemma":[0.00015598713,0.00071853783,0.0019810472,0.00006194707,0.0001421096,0.00051457476,0.00009767376,0.80119765,0.11368668,0.008587222,0.07278347,0.00007310154],"about_ca_topic_score_codex":0.0023918778,"about_ca_topic_score_gemma":0.0020891996,"teacher_disagreement_score":0.011356048,"about_ca_system_score_codex":0.0004380358,"about_ca_system_score_gemma":0.00067311,"threshold_uncertainty_score":0.037989795},"labels":[],"label_agreement":null},{"id":"W4413839921","doi":"10.1007/978-3-032-02867-9","title":"Business Process Management","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Davis; Technische Universität Dortmund; Universidade de Santiago de Compostela; Università degli Studi di Camerino; Universiteit Hasselt; Univerza v Ljubljani; Danmarks Tekniske Universitet; RWTH Aachen University; Universidade de Lisboa; Universität Mannheim; University of New South Wales; KU Leuven; Universidade do Estado do Rio de Janeiro; Universidad de la República Uruguay; Università Politecnica delle Marche; Instituto Superior Técnico; Technische Universität München; Tartu Ülikool; Universidade de São Paulo; Universität Regensburg; Humboldt-Universität zu Berlin; Universiteit Gent; Universität des Saarlandes; National Research University Higher School of Economics; Universidad de Costa Rica; University of Haifa; Instituto Tecnológico y de Estudios Superiores de Monterrey; University of South Australia; Universität Potsdam; Universität St. Gallen; Ministry of Education, India; Universität Paderborn; Technische Universität Wien; Sapienza Università di Roma; Universität Wien; Universiteit Utrecht; Universidade Federal do Rio Grande do Sul; Università della Calabria; Università degli Studi di Padova; Universität Ulm; Technische Universiteit Eindhoven; Bar-Ilan University; Indian Council of Agricultural Research; Pohang University of Science and Technology; Memorial University of Newfoundland; Libera Università di Bolzano; Rijksuniversiteit Groningen; University of Ottawa; Pontificia Universidad Católica de Chile; Università degli Studi di Trento; Universität Trier; Universität Duisburg-Essen; Queensland University of Technology; Universidad de Sevilla","keywords":"Computer science; Business process; Business process management; Process (computing); Process management; Software engineering; Programming language; Work in process; Operations management; Business","score_opus":0.011089062549975012,"score_gpt":0.23405742374168415,"score_spread":0.22296836119170912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413839921","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018459271,0.008083747,0.25411594,0.0031706516,0.0011584552,0.0002842792,0.001144348,0.0050284206,0.7251683],"genre_scores_gemma":[0.03647045,0.00906132,0.110643275,0.0011061362,0.00060339214,0.00033148297,0.004282976,0.0011407428,0.83636016],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882203,0.00014669064,0.000051969288,0.0001677645,0.0007421856,0.0000694308],"domain_scores_gemma":[0.99931204,0.00014984704,0.000034881454,0.00020389966,0.00024607076,0.00005316616],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013052573,0.0009224996,0.0005577538,0.0016793301,0.0007628385,0.0046511367,0.0010748182,0.001023098,0.062386792],"category_scores_gemma":[0.002347947,0.0005371118,0.000522681,0.0028997257,0.00047640438,0.0033373844,0.0015010757,0.0013438687,0.055547874],"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.000025032858,0.00006228691,0.00012612854,0.00015279844,0.000013512293,0.000044259446,0.0001686409,0.0012257455,0.0018164865,0.12061021,0.15385653,0.7218983],"study_design_scores_gemma":[0.000008713205,0.00002544637,0.00032923376,0.00012907313,0.000012058455,0.00012394576,0.00007756069,0.0048617455,0.0016259621,0.065612674,0.92718214,0.000011391504],"about_ca_topic_score_codex":0.00160035,"about_ca_topic_score_gemma":0.0013931327,"teacher_disagreement_score":0.9376132,"about_ca_system_score_codex":0.0009999055,"about_ca_system_score_gemma":0.0013949722,"threshold_uncertainty_score":0.20870465},"labels":[],"label_agreement":null},{"id":"W4413855449","doi":"10.1007/978-3-032-02813-6_9","title":"ODExAI: A Comprehensive Object Detection Explainable AI Evaluation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Explainable Artificial Intelligence (XAI)","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":"Computer science; Artificial intelligence; Object (grammar); Computer vision","score_opus":0.03221410776637678,"score_gpt":0.29514409120506346,"score_spread":0.2629299834386867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413855449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1695547,0.010335459,0.5393029,0.0028973878,0.0015814103,0.0041394266,0.03972312,0.08725026,0.14521532],"genre_scores_gemma":[0.25307468,0.001972132,0.6186849,0.000886586,0.00015793156,0.0021786771,0.07287673,0.005638279,0.04453012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942959,0.0016616111,0.00028754826,0.0005868012,0.0029295662,0.00023853302],"domain_scores_gemma":[0.9924777,0.0038318962,0.00024713544,0.0014644504,0.0016174364,0.0003613195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045075794,0.0021729222,0.0010026853,0.0026143703,0.0007746488,0.0023885304,0.0043908875,0.0016817205,0.01657111],"category_scores_gemma":[0.01452284,0.0005996347,0.0013748889,0.0011143247,0.00097174733,0.0035712286,0.0042343433,0.0023571318,0.0043495437],"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.0025203165,0.0015599257,0.004426935,0.0032964959,0.0008219701,0.00025892575,0.0005518726,0.06498772,0.018014649,0.030654334,0.17576633,0.6971406],"study_design_scores_gemma":[0.0012861502,0.0018518548,0.007957041,0.0008292629,0.00069189136,0.0004446711,0.0005203171,0.6562805,0.056676302,0.04095658,0.23229216,0.00021325382],"about_ca_topic_score_codex":0.006846578,"about_ca_topic_score_gemma":0.009023933,"teacher_disagreement_score":0.01657111,"about_ca_system_score_codex":0.0021596095,"about_ca_system_score_gemma":0.002255203,"threshold_uncertainty_score":0.055435896},"labels":[],"label_agreement":null},{"id":"W4413856269","doi":"10.1007/978-3-031-94928-9_12","title":"Fast Calculation of Cherry Distance on Level-1 Orchard Networks: Optimization, Heuristic and Implementation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Plant Physiology and Cultivation Studies","field":"Agricultural and Biological Sciences","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 Manitoba","funders":"","keywords":"Computer science; Heuristic; Orchard; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.021692493343164,"score_gpt":0.2495776727440468,"score_spread":0.2278851794008828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413856269","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.045372866,0.00019354722,0.9430231,0.00012674146,0.000051901963,0.00013037155,0.00023667925,0.0038726022,0.0069923033],"genre_scores_gemma":[0.1998012,0.0001164633,0.79372025,0.000055565528,0.00002317823,0.0001640364,0.00044952036,0.0006208877,0.0050488627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997458,0.00005057871,0.000011539998,0.00004604269,0.00009239198,0.00005368975],"domain_scores_gemma":[0.9990183,0.00056628033,0.00004502429,0.00011501337,0.0002031256,0.000052183736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005162696,0.0007090657,0.0009421217,0.0007724731,0.00073897373,0.0010235012,0.0017783738,0.0008326767,0.009625162],"category_scores_gemma":[0.0019345032,0.00047487058,0.0006777469,0.00077188807,0.00033376494,0.0013867961,0.0011053433,0.00094277,0.0016953199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020978936,0.00012419798,0.0017021818,0.0002968905,0.00007725179,0.00017022864,0.00021033679,0.6028363,0.016132634,0.024913907,0.007748739,0.34557754],"study_design_scores_gemma":[0.00002037979,0.000026547119,0.00021714259,0.0000062659715,0.000008495486,0.00003786144,0.000031014682,0.9908415,0.003100262,0.0043469956,0.0013550643,0.000008343031],"about_ca_topic_score_codex":0.011097899,"about_ca_topic_score_gemma":0.022463914,"teacher_disagreement_score":0.011097899,"about_ca_system_score_codex":0.0013164274,"about_ca_system_score_gemma":0.0012676971,"threshold_uncertainty_score":0.032199383},"labels":[],"label_agreement":null},{"id":"W4413856271","doi":"10.1007/978-3-031-94928-9_20","title":"Analyzing Sequence Similarity Distributions in Salmonidae: A Branching Process Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Thompson Rivers University","funders":"","keywords":"Computer science; Sequence (biology); Branching (polymer chemistry); Similarity (geometry); Artificial intelligence; Biology","score_opus":0.016692275367393296,"score_gpt":0.26645092324578623,"score_spread":0.24975864787839294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413856271","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.3782498,0.0007171084,0.6186701,0.00008752479,0.000009660354,0.000038945716,0.0003762437,0.00057236804,0.0012782639],"genre_scores_gemma":[0.82451063,0.00048889755,0.17206196,0.000045836943,0.000036913407,0.000064935666,0.0012199428,0.00021312226,0.0013577205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.00023722445,0.000054435426,0.00025388048,0.00020109068,0.000090880414],"domain_scores_gemma":[0.99266255,0.0061084144,0.00041397632,0.0003410899,0.00025624438,0.00021785017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023190624,0.0004545,0.0007283283,0.004029241,0.0006794672,0.0010312855,0.0013671819,0.0009753262,0.0016011854],"category_scores_gemma":[0.00561151,0.0005225455,0.0013309865,0.0037402003,0.00082213327,0.0014456875,0.0011619373,0.000995164,0.0004600754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063074805,0.00033147982,0.16334647,0.00036577068,0.0005607237,0.00073728734,0.0012048932,0.23879054,0.091221556,0.033396278,0.0013596648,0.46805462],"study_design_scores_gemma":[0.00001213496,0.000101449274,0.034502484,0.000022703696,0.00007962093,0.00046736098,0.00023910018,0.9169001,0.0047790995,0.04219529,0.0006695053,0.000031119285],"about_ca_topic_score_codex":0.0022896293,"about_ca_topic_score_gemma":0.0022384366,"teacher_disagreement_score":0.004029241,"about_ca_system_score_codex":0.0005797645,"about_ca_system_score_gemma":0.0003556825,"threshold_uncertainty_score":0.01226455},"labels":[],"label_agreement":null},{"id":"W4413856282","doi":"10.1007/978-3-031-94928-9_17","title":"Adapting the Cov2clusters Tool for Clustering MPOXV Whole Genome Sequences","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Poxvirus research and outbreaks","field":"Immunology and Microbiology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Science Centre for Human and Animal Health; BC Centre for Disease Control; University of British Columbia","funders":"","keywords":"Computer science; Cluster analysis; Artificial intelligence","score_opus":0.023203947923397156,"score_gpt":0.26969735249718263,"score_spread":0.24649340457378546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413856282","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011767509,0.0011070344,0.5984304,0.00038377725,0.0011764305,0.0003446597,0.03108235,0.34871602,0.00699181],"genre_scores_gemma":[0.02989659,0.00076564687,0.79637206,0.00043357408,0.00020229719,0.00060920557,0.08739773,0.07252996,0.011793102],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857736,0.00017985312,0.00012776723,0.00048405863,0.000505523,0.00012541076],"domain_scores_gemma":[0.9985191,0.00051919447,0.00006917403,0.00033268475,0.0004352472,0.00012452321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019500323,0.003338244,0.0020566706,0.005017485,0.001916687,0.004014945,0.0040294416,0.0018591948,0.028130177],"category_scores_gemma":[0.005723632,0.0023351149,0.0033754958,0.0053842915,0.00047195808,0.0028899685,0.0036119642,0.0023927698,0.024519196],"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.0011420515,0.00028339837,0.0042851344,0.001933035,0.00089757756,0.00062298134,0.0011484912,0.013975977,0.04137353,0.0060011754,0.40483645,0.52350026],"study_design_scores_gemma":[0.0007556379,0.0003195901,0.008959955,0.00053009175,0.00039494,0.0015685278,0.0009778541,0.25970104,0.055329304,0.046306204,0.62462616,0.00053073314],"about_ca_topic_score_codex":0.0074242433,"about_ca_topic_score_gemma":0.016512536,"teacher_disagreement_score":0.028130177,"about_ca_system_score_codex":0.0010436509,"about_ca_system_score_gemma":0.001479232,"threshold_uncertainty_score":0.09410483},"labels":[],"label_agreement":null},{"id":"W4413856293","doi":"10.1007/978-3-031-94928-9_16","title":"Residual Immunity and Seasonality of an Epidemic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Seasonality; Computer science; Residual; Immunity; Epidemic model; Immunology; Algorithm; Biology; Medicine; Machine learning; Immune system; Environmental health","score_opus":0.15287006068935025,"score_gpt":0.40149549344334756,"score_spread":0.24862543275399732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413856293","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.7164306,0.0045806267,0.22658753,0.003879008,0.00039171492,0.00003786046,0.00033478736,0.0002276403,0.04753015],"genre_scores_gemma":[0.9833382,0.0009512047,0.0043759756,0.00012650754,0.000189438,0.000012366888,0.000093160255,0.00002850879,0.010884799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.00009488896,0.000014299419,0.000059144993,0.00003813876,0.000050145656],"domain_scores_gemma":[0.99627244,0.002729221,0.0003266302,0.00031749273,0.00020509274,0.00014917614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013771948,0.00016764762,0.0003965113,0.0004741496,0.00022151542,0.00091345934,0.0007267957,0.0006219871,0.003703401],"category_scores_gemma":[0.011018242,0.00023593329,0.0003925659,0.00038795493,0.0010906367,0.001788369,0.00051943306,0.0010016246,0.00025754486],"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.00013023462,0.000044732817,0.007214005,0.0001135529,0.00005026938,0.0002496041,0.00071472273,0.030539993,0.0030406888,0.9266612,0.0033587455,0.027882194],"study_design_scores_gemma":[0.000017344599,0.00007564655,0.007647565,0.000026477106,0.000035822297,0.00029681803,0.00022512044,0.13531381,0.00032909794,0.8522743,0.0037409351,0.000017048083],"about_ca_topic_score_codex":0.00134912,"about_ca_topic_score_gemma":0.00085480657,"teacher_disagreement_score":0.003703401,"about_ca_system_score_codex":0.00040612664,"about_ca_system_score_gemma":0.00025684404,"threshold_uncertainty_score":0.012389183},"labels":[],"label_agreement":null},{"id":"W4413857326","doi":"10.1007/978-3-032-03639-1_23","title":"Linear Contracts for Supermodular Functions Based on Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.02713997365759921,"score_gpt":0.28945822891113243,"score_spread":0.26231825525353325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413857326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09756152,0.001292739,0.76053023,0.002129767,0.00038941923,0.00017111095,0.00059146236,0.0005860405,0.13674773],"genre_scores_gemma":[0.6867721,0.0028118966,0.19160451,0.0009868211,0.000810738,0.0005622249,0.0008999507,0.00086498144,0.11468682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897146,0.00032099878,0.000040536062,0.00016027539,0.00036209563,0.00014462229],"domain_scores_gemma":[0.9976386,0.0014121812,0.00017837195,0.00040289346,0.00019811442,0.00016987532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011663401,0.0006764309,0.0007367328,0.0010517967,0.00095913163,0.0019916499,0.001426328,0.0010621141,0.018285511],"category_scores_gemma":[0.0045774435,0.0004724593,0.00082989404,0.0019517795,0.0020960753,0.0055340943,0.0021880516,0.0034420583,0.0024268702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028814826,0.00001903318,0.000043669548,0.00004522711,0.0000036023564,0.000019334862,0.000070435366,0.0035804093,0.00067626307,0.9715495,0.0031022376,0.020861447],"study_design_scores_gemma":[0.00000912997,0.000018715127,0.000063716776,0.000015463698,0.000003894629,0.000048509886,0.000027095024,0.021115635,0.00035739728,0.97238165,0.005950441,0.000008492443],"about_ca_topic_score_codex":0.00071132457,"about_ca_topic_score_gemma":0.0007989613,"teacher_disagreement_score":0.018285511,"about_ca_system_score_codex":0.0016503109,"about_ca_system_score_gemma":0.0006608296,"threshold_uncertainty_score":0.061171114},"labels":[],"label_agreement":null},{"id":"W4413857336","doi":"10.1007/978-3-032-03639-1_21","title":"Near-Linear MIR Algorithms for Stochastically-Ordered Priors","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Prior probability; Algorithm; Artificial intelligence; Bayesian probability","score_opus":0.02605732205500774,"score_gpt":0.29284712628223464,"score_spread":0.2667898042272269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413857336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015507807,0.0002479,0.99483055,0.0001573218,0.000053843527,0.000031078107,0.00006435837,0.0007836148,0.002280532],"genre_scores_gemma":[0.058972944,0.00038117578,0.9276478,0.0004459442,0.00019945846,0.00038035144,0.0006691834,0.0009638776,0.0103393365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969137,0.0014805775,0.00014509486,0.00046804093,0.0007184311,0.00027414665],"domain_scores_gemma":[0.98919684,0.008125696,0.00036558748,0.0011183297,0.0008700013,0.00032352612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048153754,0.0018259212,0.0026016792,0.0016866407,0.0013823181,0.003063398,0.0039958064,0.003316575,0.017912412],"category_scores_gemma":[0.020607833,0.0020905223,0.0020985473,0.0022293567,0.0021888085,0.0057322467,0.0066925692,0.005488262,0.0071033165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007305891,0.00029223604,0.00068200886,0.00046558533,0.00017776915,0.00016294513,0.0002814446,0.37162971,0.0035049987,0.2783772,0.020885035,0.32281044],"study_design_scores_gemma":[0.000041492665,0.000045591994,0.00006314116,0.000033782268,0.000017133234,0.00005144999,0.000029180379,0.90165395,0.0009025145,0.094154015,0.0029874707,0.000020276],"about_ca_topic_score_codex":0.0022828488,"about_ca_topic_score_gemma":0.004022639,"teacher_disagreement_score":0.017912412,"about_ca_system_score_codex":0.0016698168,"about_ca_system_score_gemma":0.002523728,"threshold_uncertainty_score":0.059922993},"labels":[],"label_agreement":null},{"id":"W4413857345","doi":"10.1007/978-3-032-03639-1_20","title":"Deterministic Refund Mechanisms","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision 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 Toronto","funders":"","keywords":"Computer science","score_opus":0.05641785448609328,"score_gpt":0.3507280867260604,"score_spread":0.2943102322399671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413857345","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.018228069,0.004746937,0.4124023,0.0042343964,0.0010234611,0.00018861503,0.0006429,0.0010010459,0.5575323],"genre_scores_gemma":[0.4834273,0.005218214,0.113918625,0.0015872562,0.00078510906,0.00048922247,0.0010734905,0.0005827168,0.39291808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984931,0.00043362295,0.00008310227,0.00027762933,0.000527588,0.00018505269],"domain_scores_gemma":[0.99793774,0.0007566642,0.0001681578,0.0007998418,0.00025360164,0.00008389799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017592945,0.0007989796,0.00086347904,0.00095945067,0.0013315197,0.0033007276,0.0022075663,0.0020400633,0.038339864],"category_scores_gemma":[0.005943545,0.0005699828,0.0007988418,0.0016472192,0.0018444284,0.0060473066,0.0023423221,0.0027894964,0.007596316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000314332,0.000027480764,0.000030387524,0.000060116137,0.00000764921,0.000013847904,0.000029792871,0.0015181118,0.00023137164,0.9588777,0.0077787386,0.031393394],"study_design_scores_gemma":[0.00001848088,0.000015039887,0.000045212983,0.00003410665,0.0000071775075,0.000064487205,0.00001395907,0.004522838,0.00043044888,0.9645788,0.030260278,0.00000921198],"about_ca_topic_score_codex":0.00027876886,"about_ca_topic_score_gemma":0.00028692654,"teacher_disagreement_score":0.038339864,"about_ca_system_score_codex":0.0013933397,"about_ca_system_score_gemma":0.0010802391,"threshold_uncertainty_score":0.1282596},"labels":[],"label_agreement":null},{"id":"W4413863275","doi":"10.1007/978-3-031-94533-5_21","title":"Model-Based Testing of Non-deterministic Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.03303807198923141,"score_gpt":0.27285629151377133,"score_spread":0.2398182195245399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413863275","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.03140515,0.0013052776,0.9571585,0.00029297202,0.00010034358,0.00003890537,0.000072283874,0.0014827932,0.008143709],"genre_scores_gemma":[0.7730543,0.0008097548,0.21572381,0.0001261048,0.00006365863,0.00010619819,0.00025856082,0.0003705451,0.009487022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985267,0.00051388,0.00005327496,0.0001542933,0.00065842445,0.00009338934],"domain_scores_gemma":[0.9963966,0.0026854873,0.00013951377,0.00051809405,0.00020766445,0.000052646694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000921884,0.00073905656,0.000708392,0.00058415584,0.00024158125,0.00087442144,0.0015010936,0.0009173043,0.0026298922],"category_scores_gemma":[0.0049958783,0.00063226523,0.000725051,0.00047995374,0.00090831565,0.001627962,0.0008144877,0.0014037711,0.00039595604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003560167,0.00018671983,0.0013354748,0.00038809603,0.000102901824,0.00033112237,0.00020183431,0.5237859,0.026237763,0.20757076,0.005595799,0.23390757],"study_design_scores_gemma":[0.000026372401,0.00008249243,0.00032188196,0.0000393458,0.000021388003,0.00015161312,0.000010748534,0.8708586,0.00862147,0.11639278,0.003461044,0.000012240632],"about_ca_topic_score_codex":0.0013570014,"about_ca_topic_score_gemma":0.0020720856,"teacher_disagreement_score":0.0026298922,"about_ca_system_score_codex":0.0008391128,"about_ca_system_score_gemma":0.00059979275,"threshold_uncertainty_score":0.008797884},"labels":[],"label_agreement":null},{"id":"W4413874168","doi":"10.1007/978-3-031-94928-9_4","title":"Whole-Genome Duplication Detection with Phylogenomics Reconciliation: A Scalable Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological 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":"Université de Sherbrooke","funders":"","keywords":"Phylogenomics; Computer science; Gene duplication; Scalability; Genome; Computational biology; Artificial intelligence; Biology; Phylogenetic tree; Genetics; Gene; Database","score_opus":0.014801857436043914,"score_gpt":0.19395037133120174,"score_spread":0.17914851389515782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413874168","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.02158354,0.0015157555,0.9088986,0.00070880225,0.00032635403,0.0004233021,0.005703083,0.057986375,0.0028541395],"genre_scores_gemma":[0.07013623,0.00048901007,0.9135507,0.00024004596,0.00016883996,0.00038524796,0.010595957,0.0021977234,0.0022362617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977203,0.00043201982,0.0001516052,0.0009220651,0.0006012032,0.0001727566],"domain_scores_gemma":[0.9958164,0.0016288842,0.00024946278,0.0015885055,0.00053261017,0.00018411729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030400183,0.003427284,0.0045151347,0.004368635,0.0016339523,0.004307829,0.006281672,0.0024869235,0.008395716],"category_scores_gemma":[0.00809035,0.0019127405,0.0032597587,0.0068648537,0.00085834303,0.0041337893,0.0057920995,0.0025921147,0.006145042],"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.0014270929,0.00057466526,0.0049614017,0.0010708766,0.001686936,0.0007006347,0.00042725663,0.05845358,0.051471345,0.0069161532,0.051070817,0.8212393],"study_design_scores_gemma":[0.0004842898,0.00020017233,0.004041948,0.00007360292,0.0005915929,0.00062826386,0.00039612077,0.912782,0.01928383,0.046609692,0.0147596635,0.0001488105],"about_ca_topic_score_codex":0.005169825,"about_ca_topic_score_gemma":0.00901655,"teacher_disagreement_score":0.008395716,"about_ca_system_score_codex":0.00088849966,"about_ca_system_score_gemma":0.0024752035,"threshold_uncertainty_score":0.028086424},"labels":[],"label_agreement":null},{"id":"W4413874188","doi":"10.1007/978-3-031-94928-9_3","title":"Tree Decomposition for Reconstructing Ancestral RNA Sequences of Multiple Families","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université du Québec à Montréal; University of Manitoba","funders":"","keywords":"Computer science; Decomposition; Tree (set theory); Theoretical computer science; Combinatorics; Mathematics; Biology; Ecology","score_opus":0.016906996632498065,"score_gpt":0.26280662089922363,"score_spread":0.24589962426672557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413874188","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.016601996,0.0002426791,0.9781374,0.000052188316,0.000045360586,0.000071640636,0.0008242379,0.002891714,0.0011327481],"genre_scores_gemma":[0.04467194,0.00024709056,0.94904643,0.000034869205,0.000027560855,0.0001581838,0.0036415062,0.0008424598,0.0013299919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999637,0.00008117586,0.000030684147,0.000095303454,0.00010747708,0.000048402104],"domain_scores_gemma":[0.99853075,0.00093626394,0.000066688546,0.00018550531,0.00020006762,0.00008070784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010897534,0.000984991,0.0011794425,0.0024648893,0.0008697614,0.0015580775,0.0013032461,0.001197591,0.0068578906],"category_scores_gemma":[0.003543332,0.0009176899,0.0019535823,0.002605458,0.0006027013,0.0015135623,0.001168099,0.0018730466,0.0031048318],"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.00074053707,0.00017457266,0.0021636318,0.00070382515,0.00023254757,0.00059474295,0.00068211154,0.1486978,0.049020153,0.04319361,0.0167497,0.7370467],"study_design_scores_gemma":[0.000069293754,0.000070503476,0.00061470334,0.00005652,0.00009692971,0.00023185245,0.00015306372,0.9158736,0.0065400335,0.06856117,0.007701267,0.00003120557],"about_ca_topic_score_codex":0.0028538434,"about_ca_topic_score_gemma":0.0036798602,"teacher_disagreement_score":0.0068578906,"about_ca_system_score_codex":0.00062923995,"about_ca_system_score_gemma":0.00086556154,"threshold_uncertainty_score":0.022941947},"labels":[],"label_agreement":null},{"id":"W4413874197","doi":"10.1007/978-3-031-94928-9_5","title":"A Sankoff-Rousseau-Like Algorithm for Minimizing Lateral Gene Transfers and Losses on Single Origin Characters","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological Sciences","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Algorithm","score_opus":0.022322708246852115,"score_gpt":0.2281032559486047,"score_spread":0.20578054770175258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413874197","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.006757297,0.00012725362,0.98833513,0.00011897153,0.00007070813,0.00017028986,0.00009578686,0.0019708339,0.0023537143],"genre_scores_gemma":[0.017637992,0.00004089791,0.97834694,0.00009342174,0.00002438463,0.00022443304,0.00020114538,0.00035098614,0.003079844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991379,0.00023519684,0.00006011093,0.00027906938,0.00017971122,0.000107973414],"domain_scores_gemma":[0.9986578,0.00075663853,0.00006152639,0.00015091033,0.00031994152,0.000053179516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002747668,0.0018737955,0.0019728877,0.0024298562,0.0013522711,0.0014545427,0.003972491,0.003758728,0.012604814],"category_scores_gemma":[0.004373979,0.001003403,0.0019762113,0.0022177314,0.001212946,0.0015014467,0.0016636328,0.0020820918,0.003412641],"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.00025039923,0.0002601526,0.001040809,0.00020092684,0.0001485965,0.0000932151,0.00020390909,0.29453117,0.00862642,0.021820702,0.011904476,0.6609192],"study_design_scores_gemma":[0.000106371284,0.00008849948,0.00026343548,0.00003159271,0.00004726328,0.000073882686,0.000052797546,0.9783463,0.0032648132,0.012811275,0.0048898975,0.000023898152],"about_ca_topic_score_codex":0.009093506,"about_ca_topic_score_gemma":0.015971826,"teacher_disagreement_score":0.012604814,"about_ca_system_score_codex":0.0016862658,"about_ca_system_score_gemma":0.002519458,"threshold_uncertainty_score":0.042167246},"labels":[],"label_agreement":null},{"id":"W4413874206","doi":"10.1007/978-3-031-94928-9_10","title":"Ancestral Pangenomes and Their Phylogenetic Reconstruction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 Ottawa","funders":"","keywords":"Computer science; Phylogenetic tree; Artificial intelligence; Biology; Genetics","score_opus":0.01120834384207413,"score_gpt":0.2195679945628719,"score_spread":0.20835965072079776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413874206","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.37408662,0.04104092,0.4587198,0.002168633,0.0004705914,0.00016465403,0.006015593,0.0018803077,0.115452886],"genre_scores_gemma":[0.7494084,0.02927125,0.18330824,0.000593563,0.00026221908,0.00019332333,0.011321271,0.0006336029,0.02500824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983966,0.000039708713,0.000010688198,0.00006194472,0.00002522836,0.000022708738],"domain_scores_gemma":[0.9996536,0.00013917993,0.000034307155,0.00009303605,0.000047421105,0.000032431653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005069374,0.00032501662,0.00045747377,0.0016389692,0.00075348816,0.0017149657,0.0006480042,0.0006613381,0.0065763383],"category_scores_gemma":[0.0014836384,0.00048734096,0.00038592063,0.0029129789,0.00075395755,0.0025748254,0.0009946651,0.0015935441,0.0013033784],"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.0012584443,0.00008063711,0.0063021365,0.0010665077,0.00013745918,0.00089660723,0.001673009,0.016756075,0.07640777,0.46799865,0.0045498465,0.4228729],"study_design_scores_gemma":[0.000059088736,0.00025262483,0.029182747,0.00046169444,0.0002043105,0.0027466058,0.0011576175,0.040144116,0.02188115,0.6604928,0.24332982,0.00008743032],"about_ca_topic_score_codex":0.0005240546,"about_ca_topic_score_gemma":0.0006249546,"teacher_disagreement_score":0.0065763383,"about_ca_system_score_codex":0.00055572065,"about_ca_system_score_gemma":0.00022529514,"threshold_uncertainty_score":0.022000015},"labels":[],"label_agreement":null},{"id":"W4413888947","doi":"10.1007/978-3-032-03870-8_20","title":"Improving Text Readability to Support Student Comprehension and Learning: An LLM-Powered Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text Readability and Simplification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Readability; Computer science; Comprehension; Multimedia; Human–computer interaction; Artificial intelligence; Natural language processing; Programming language","score_opus":0.020871257842508196,"score_gpt":0.2735095957058067,"score_spread":0.2526383378632985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413888947","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.11270746,0.0021269796,0.7702523,0.0039267335,0.00036366703,0.00077077234,0.0008080137,0.018371249,0.09067284],"genre_scores_gemma":[0.5000405,0.0011781724,0.42739493,0.0008111307,0.0003012097,0.0006958212,0.0011515416,0.0015580951,0.06686859],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987294,0.00035636895,0.00006505552,0.00018413711,0.00059653906,0.00006855425],"domain_scores_gemma":[0.99515355,0.0023391282,0.00044243992,0.00086568383,0.0010045049,0.00019466493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013313263,0.000786025,0.00072394044,0.001709775,0.00040814994,0.0019950515,0.0017534607,0.0009406709,0.014467284],"category_scores_gemma":[0.008136329,0.0002912476,0.00058339216,0.0014238593,0.00043113643,0.0021650542,0.0021811477,0.0012113572,0.0049919426],"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.00016277835,0.00048723468,0.0015026925,0.00065217895,0.00002407968,0.000098831806,0.0006395543,0.0021131937,0.06668314,0.0065600993,0.010794461,0.9102818],"study_design_scores_gemma":[0.0003357973,0.00326878,0.03325946,0.0011725564,0.00054829085,0.001497273,0.0019044526,0.17068557,0.42865354,0.08545104,0.27299082,0.00023249509],"about_ca_topic_score_codex":0.00041891765,"about_ca_topic_score_gemma":0.00063544256,"teacher_disagreement_score":0.014467284,"about_ca_system_score_codex":0.00058049016,"about_ca_system_score_gemma":0.00092195306,"threshold_uncertainty_score":0.04839784},"labels":[],"label_agreement":null},{"id":"W4413901755","doi":"10.1007/978-3-032-03873-9_7","title":"Generating AI Images for the OER Conversion Tool “ConvOERter”","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing and 3D Reconstruction","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":"Computer science; Artificial intelligence; Computer vision; Computer graphics (images)","score_opus":0.010122538317208859,"score_gpt":0.24067385621057863,"score_spread":0.23055131789336977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413901755","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017136784,0.0002030042,0.8364251,0.00021731452,0.0003623083,0.0002453799,0.0020751914,0.050940163,0.092394784],"genre_scores_gemma":[0.12047196,0.00029328014,0.8063498,0.00022229084,0.0000693408,0.00023110778,0.0050268383,0.012773889,0.05456145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998498,0.000011374096,0.0000065425415,0.000034212495,0.00007528341,0.000022711829],"domain_scores_gemma":[0.999759,0.00007956782,0.000009044588,0.000055852677,0.00008098687,0.000015510454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021909772,0.0010461176,0.00032004982,0.0011665729,0.0004038117,0.0010790162,0.0010496901,0.00068759324,0.07535632],"category_scores_gemma":[0.0007796643,0.00049430865,0.0006354592,0.0006219658,0.000296362,0.0008828044,0.0008375743,0.0007901908,0.018223647],"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.00038782498,0.00014134872,0.0009452838,0.00063397054,0.00005614405,0.000720982,0.00036021965,0.010268413,0.14821135,0.024669401,0.10547247,0.70813257],"study_design_scores_gemma":[0.00013744066,0.00018875307,0.0029529298,0.00015536876,0.000077176745,0.0022330447,0.000370162,0.20080507,0.3481661,0.01959778,0.42518505,0.00013116068],"about_ca_topic_score_codex":0.0011939427,"about_ca_topic_score_gemma":0.0017023903,"teacher_disagreement_score":0.07535632,"about_ca_system_score_codex":0.00027815797,"about_ca_system_score_gemma":0.0002697583,"threshold_uncertainty_score":0.252092},"labels":[],"label_agreement":null},{"id":"W4413907680","doi":"10.1007/978-3-032-04587-4","title":"Logics in Artificial Intelligence","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Leibniz-Gemeinschaft; Instituto Superior Técnico; École Normale Supérieure de Lyon; Technische Universität Dortmund; Helsingin Yliopisto; Universidade da Madeira; Libera Università di Bolzano; Universität Leipzig; University of Cape Town; Technische Universität Wien; Universität Paderborn; Università degli Studi di Torino; Aix-Marseille Université; Universidade Nova de Lisboa; Birkbeck, University of London; Universidade de Lisboa; Universidad Nacional del Sur; Centre National de la Recherche Scientifique; Universite Angers; Università degli Studi di Udine; Università della Calabria; Université de Toulouse; University of Waterloo; Institut Universitaire de France; Linköpings Universitet; Universitetet i Bergen; Akademie Věd České Republiky; Universidad Politécnica de Madrid; Universitat Politècnica de València; Université de Montpellier; University of Cyprus; Consejo Nacional de Investigaciones Científicas y Técnicas; Technische Universität Dresden; Universiteit van Amsterdam; Università degli Studi di Milano-Bicocca; University of New South Wales; Universiteit Maastricht; KU Leuven; Universiteit Utrecht; British Columbia Institute of Technology; Università degli Studi di Milano; Université du Luxembourg; Universidad de Málaga; Commonwealth Scientific and Industrial Research Organisation; École Normale Supérieure; Universität Zürich; University of Chester; University College London; Imperial College London; Cardiff University","keywords":"Computer science; Artificial intelligence","score_opus":0.026813373060967604,"score_gpt":0.2721947778758663,"score_spread":0.24538140481489873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413907680","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017551236,0.19458586,0.07245425,0.012408341,0.0029793084,0.00006020773,0.0005212916,0.00066674495,0.71456885],"genre_scores_gemma":[0.16034748,0.16191375,0.08197945,0.009228179,0.008456402,0.00041839856,0.0028282588,0.0009618409,0.5738663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995697,0.0001613338,0.000020878155,0.000069338465,0.00014802182,0.000030742267],"domain_scores_gemma":[0.99944013,0.0003487274,0.00002635765,0.00008128039,0.00006236432,0.00004125994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072507275,0.0010336979,0.0009427259,0.001669557,0.0010400866,0.0052354108,0.00090668886,0.0010596769,0.022239469],"category_scores_gemma":[0.0013624844,0.00053152133,0.0004964127,0.002331188,0.0035324018,0.0051824995,0.0014295882,0.003144849,0.007610917],"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.000023319912,0.000027641046,0.00009563315,0.00018122957,0.000015755328,0.000030877574,0.00027892864,0.0005915604,0.00014092909,0.8247366,0.0927722,0.08110543],"study_design_scores_gemma":[0.000009405638,0.000007590073,0.00011855198,0.00017375815,0.00000619911,0.00006447331,0.00008953845,0.0007218069,0.00009195492,0.72674394,0.27196762,0.0000051937714],"about_ca_topic_score_codex":0.0015621672,"about_ca_topic_score_gemma":0.0018294888,"teacher_disagreement_score":0.022239469,"about_ca_system_score_codex":0.001850883,"about_ca_system_score_gemma":0.0009845805,"threshold_uncertainty_score":0.07439846},"labels":[],"label_agreement":null},{"id":"W4413922133","doi":"10.1007/978-3-032-04354-2_2","title":"Selective Search as a First-Stage Retriever","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Stage (stratigraphy); Labrador Retriever; Biology; Medicine","score_opus":0.019575976103963104,"score_gpt":0.2767807282185583,"score_spread":0.2572047521145952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413922133","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.24158838,0.0035896704,0.5797326,0.0014603892,0.0003066454,0.0007550354,0.00093392294,0.011853337,0.15977992],"genre_scores_gemma":[0.6913748,0.0014907938,0.16999893,0.00037417762,0.00021741139,0.00024764086,0.0007752911,0.00095335435,0.1345676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992774,0.0001633091,0.00003617741,0.00015109328,0.00026900374,0.00010296849],"domain_scores_gemma":[0.99685067,0.001690948,0.00012478314,0.00079973927,0.00037685665,0.00015702503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011561392,0.00053923414,0.0011089509,0.0015512953,0.00090469234,0.0023215825,0.0021496026,0.0016549629,0.023625365],"category_scores_gemma":[0.0049391356,0.0006646478,0.00090784376,0.0014019442,0.0007691299,0.0043730405,0.001091684,0.0010518093,0.011646729],"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.002613632,0.0011289405,0.0045989067,0.0010932167,0.00020880153,0.0009883244,0.00085888454,0.023062898,0.16697292,0.24164952,0.043473404,0.5133506],"study_design_scores_gemma":[0.00045919692,0.002106869,0.005906986,0.00011034408,0.00059718493,0.003956153,0.00036903936,0.6670241,0.11906931,0.136344,0.06381422,0.00024265294],"about_ca_topic_score_codex":0.0014859275,"about_ca_topic_score_gemma":0.0019914166,"teacher_disagreement_score":0.023625365,"about_ca_system_score_codex":0.00059499405,"about_ca_system_score_gemma":0.0010296877,"threshold_uncertainty_score":0.079034746},"labels":[],"label_agreement":null},{"id":"W4413927738","doi":"10.1007/978-3-031-97778-7_14","title":"Usability Evaluation of “Paint!” VR Game Designed for Frail Older Adults","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto East General Hospital; University Health Network; University of Toronto; York University","funders":"","keywords":"Usability; Computer science; Human–computer interaction; Multimedia","score_opus":0.035048519924042135,"score_gpt":0.3103476563258193,"score_spread":0.27529913640177717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413927738","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.9946331,0.00039205124,0.0029505854,0.00004067346,0.00005932216,0.0002779744,0.00023150312,0.0001297581,0.0012851998],"genre_scores_gemma":[0.97591114,0.00067990116,0.01616288,0.0001443975,0.00003656359,0.0007702177,0.00090332836,0.00010207941,0.0052896417],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99936324,0.00023430123,0.00008609003,0.000097865224,0.00015509377,0.000063334715],"domain_scores_gemma":[0.9982059,0.0009239742,0.00008287025,0.00007383965,0.0005675703,0.00014583793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009752468,0.00083968433,0.0006502058,0.00059078645,0.00029808914,0.00066160347,0.00073415646,0.00044842545,0.0030381486],"category_scores_gemma":[0.0046848785,0.00025166958,0.0007763185,0.00020293219,0.0001851177,0.00043857118,0.00050422276,0.00029570665,0.0004589291],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.029298257,0.02667448,0.079805315,0.01591725,0.0016784671,0.0035398568,0.028568774,0.0058466215,0.25648198,0.0011210033,0.022556884,0.5285112],"study_design_scores_gemma":[0.0035855318,0.1253725,0.6752949,0.0023827015,0.004583051,0.0065173204,0.018920552,0.03810602,0.07642419,0.00074352906,0.04734324,0.00072658306],"about_ca_topic_score_codex":0.0025594074,"about_ca_topic_score_gemma":0.0038234447,"teacher_disagreement_score":0.0030381486,"about_ca_system_score_codex":0.00017630516,"about_ca_system_score_gemma":0.00028993186,"threshold_uncertainty_score":0.010163605},"labels":[],"label_agreement":null},{"id":"W4413942424","doi":"10.1007/978-3-032-04354-2_18","title":"Overview of the CLEF 2025 JOKER Lab: Humour in Machine","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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 Manitoba","funders":"","keywords":"Clef; Computer science; Artificial intelligence; Information retrieval; World Wide Web; Management","score_opus":0.01832890902460905,"score_gpt":0.28679542091333915,"score_spread":0.2684665118887301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413942424","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003940809,0.15675037,0.16422911,0.023812652,0.0077710925,0.0010097658,0.019070104,0.034228977,0.5891871],"genre_scores_gemma":[0.043671396,0.08440758,0.24085742,0.011859316,0.012076104,0.0015980585,0.07712512,0.013708529,0.5146965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788564,0.00067627645,0.0000927944,0.00029667062,0.0008809008,0.00016769739],"domain_scores_gemma":[0.997332,0.0007788074,0.00008073867,0.0003489286,0.00089458795,0.0005649892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026184383,0.0013603236,0.0012083896,0.00579311,0.0014961703,0.004791034,0.0017000507,0.0017631878,0.108186886],"category_scores_gemma":[0.004314905,0.0007591987,0.00078069844,0.0055865305,0.0007617057,0.00500959,0.0031224503,0.0024609342,0.086956024],"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.000042087693,0.000052774496,0.0001254696,0.00044951637,0.000011051296,0.00003622931,0.000056825953,0.00051805325,0.0010199347,0.01141241,0.66427034,0.3220053],"study_design_scores_gemma":[0.000013767199,0.000024850322,0.00050471135,0.00017408276,0.000005590254,0.00016500996,0.000030085243,0.0011642704,0.0011003717,0.0064754616,0.99031633,0.000025432792],"about_ca_topic_score_codex":0.0039989618,"about_ca_topic_score_gemma":0.008502805,"teacher_disagreement_score":0.108186886,"about_ca_system_score_codex":0.002410443,"about_ca_system_score_gemma":0.0022527205,"threshold_uncertainty_score":0.3619212},"labels":[],"label_agreement":null},{"id":"W4414042672","doi":"10.1007/978-3-032-05607-8_19","title":"Hybrid Ontology Matching for Company Name Alignment: Combining Text Matching, String Similarity, SBERT, and Siamese Networks in Italian and German Job Market Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Global Health Research","funders":"","keywords":"Matching (statistics); Discriminative model; Normalization (sociology); Ontology; Robustness (evolution); String searching algorithm; Ontology alignment; Cosine similarity; String (physics); String metric","score_opus":0.023144626615993393,"score_gpt":0.2758699511476817,"score_spread":0.25272532453168833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414042672","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.5197698,0.0037454963,0.39447215,0.0013460646,0.00034229035,0.00037840512,0.04673211,0.015669916,0.017543802],"genre_scores_gemma":[0.5972571,0.0011523496,0.28957102,0.00018662048,0.00020930241,0.0002396709,0.103611566,0.0009699408,0.00680242],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983789,0.0005008044,0.00019476205,0.00041840164,0.00034103822,0.00016624601],"domain_scores_gemma":[0.9980332,0.0010845093,0.00014956853,0.00035651337,0.0002979943,0.00007817717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020085769,0.00053837214,0.00069657643,0.007668624,0.00091417367,0.0018500763,0.0010016174,0.00083312555,0.0029552884],"category_scores_gemma":[0.005265151,0.00021416998,0.0011040458,0.008391941,0.0003559729,0.0033975954,0.0015208777,0.000615718,0.0024819355],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071102194,0.0007060703,0.05785137,0.00060088217,0.0004925603,0.00042033193,0.0006738128,0.026701419,0.01509054,0.0133286165,0.05845299,0.82497036],"study_design_scores_gemma":[0.000115218725,0.00016452855,0.057681803,0.00016213076,0.00040236927,0.00066497736,0.0016559637,0.8273269,0.017272081,0.0419971,0.052443452,0.00011346564],"about_ca_topic_score_codex":0.020728357,"about_ca_topic_score_gemma":0.042473402,"teacher_disagreement_score":0.020728357,"about_ca_system_score_codex":0.0008575946,"about_ca_system_score_gemma":0.0014560409,"threshold_uncertainty_score":0.04121542},"labels":[],"label_agreement":null},{"id":"W4414043701","doi":"10.1007/978-3-032-04403-7_3","title":"ServLessSense: Serverless Smell Detection Tool","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Chemical Sensor Technologies","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 Saskatchewan","funders":"","keywords":"Code refactoring; Code smell; JavaScript; Abstraction; Precision and recall; Code (set theory); Perspective (graphical)","score_opus":0.0077000382079786085,"score_gpt":0.20927161563500868,"score_spread":0.20157157742703008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414043701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00872901,0.0014679879,0.5122058,0.00024500908,0.00043123838,0.0002078568,0.007484693,0.4368249,0.032403562],"genre_scores_gemma":[0.21042003,0.003310486,0.37602806,0.00223079,0.00040352516,0.00070144364,0.030837066,0.080175705,0.29589286],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994098,0.000028341188,0.000027017006,0.00010577333,0.0003853398,0.00004375259],"domain_scores_gemma":[0.99947685,0.00020141443,0.00004927543,0.00011521132,0.00011657729,0.000040661987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038607116,0.00219858,0.0009266736,0.0013514645,0.00025367705,0.0014216223,0.0017810448,0.0010190387,0.039263967],"category_scores_gemma":[0.0012001604,0.0009353773,0.00068165263,0.0007944116,0.00029183656,0.0016258933,0.0011192983,0.0010381943,0.027809458],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088455185,0.00027630993,0.0018789754,0.0010451558,0.00011954086,0.00067096745,0.00030620032,0.0036311594,0.17061985,0.0070973765,0.3316005,0.48186946],"study_design_scores_gemma":[0.00021979242,0.0003924714,0.0035682449,0.00025049358,0.00018562468,0.003125324,0.00014300692,0.10691855,0.3854449,0.010519417,0.48895642,0.00027582663],"about_ca_topic_score_codex":0.00064079044,"about_ca_topic_score_gemma":0.0010024193,"teacher_disagreement_score":0.039263967,"about_ca_system_score_codex":0.00026507987,"about_ca_system_score_gemma":0.00029952894,"threshold_uncertainty_score":0.13135105},"labels":[],"label_agreement":null},{"id":"W4414073095","doi":"10.1007/978-3-032-05005-2_11","title":"Improving Visual Comparison Across Multiple Views with Shadow Marks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Autodesk (Canada); University of Saskatchewan","funders":"","keywords":"Shadow (psychology); Frame (networking); Overlay; Grid; Reference frame; Spatial analysis; Frame of reference","score_opus":0.023054856342315844,"score_gpt":0.3164895371532244,"score_spread":0.29343468081090857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414073095","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.014255289,0.00070330355,0.9659647,0.00025627544,0.00035609244,0.0001715977,0.00036938398,0.01326295,0.0046604667],"genre_scores_gemma":[0.09880702,0.00079838047,0.8851624,0.0002510933,0.00016722512,0.00018864506,0.0009963054,0.006733105,0.006895745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983145,0.00030233574,0.00012604576,0.00027755744,0.0007854867,0.00019416236],"domain_scores_gemma":[0.9917175,0.0031259179,0.0004387337,0.0020695939,0.0021629028,0.0004854265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020255493,0.0019466013,0.0014167656,0.0027975223,0.00079108553,0.0039610565,0.0022227205,0.0017163467,0.039094087],"category_scores_gemma":[0.012475457,0.0010716445,0.0013072386,0.0026243,0.0006741937,0.004535208,0.0053253686,0.0025172255,0.006768488],"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.0012570403,0.0002186305,0.00093406485,0.0009925693,0.0001736903,0.00024638083,0.00048134802,0.009540914,0.14375333,0.009241521,0.02191118,0.81124926],"study_design_scores_gemma":[0.0004011167,0.00083849777,0.004842054,0.0005747326,0.00048801117,0.0019301642,0.001044644,0.46230227,0.3889723,0.036032572,0.10229035,0.0002832691],"about_ca_topic_score_codex":0.002152226,"about_ca_topic_score_gemma":0.0025493333,"teacher_disagreement_score":0.039094087,"about_ca_system_score_codex":0.0006788028,"about_ca_system_score_gemma":0.0009840933,"threshold_uncertainty_score":0.13078278},"labels":[],"label_agreement":null},{"id":"W4414073194","doi":"10.1007/978-3-032-05005-2_33","title":"Experiences of Online Threats: A Diary Study with Young British People","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phishing; Communication source; Quarter (Canadian coin); Action (physics); The Internet","score_opus":0.010803077958110844,"score_gpt":0.24138759827479886,"score_spread":0.23058452031668802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414073194","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.99474216,0.00089107355,0.00018462793,0.00043783698,0.000055452067,0.000047112757,0.00020806956,0.000010402465,0.0034230931],"genre_scores_gemma":[0.99445397,0.0013035069,0.00021369866,0.0005434851,0.000029412038,0.00009611397,0.00019963158,0.00002617518,0.0031338914],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9979836,0.0009088376,0.00013165946,0.00020530476,0.00031198718,0.00045866802],"domain_scores_gemma":[0.989711,0.0040141493,0.0018025228,0.00034078868,0.0012185157,0.0029130236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002739537,0.0007333418,0.0011381314,0.002519535,0.0072999815,0.0058912556,0.000877195,0.0022427463,0.0026577953],"category_scores_gemma":[0.009770718,0.00086306076,0.000291038,0.0027417396,0.0030784719,0.005810895,0.0057392106,0.003510983,0.0014574877],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059102666,0.00012418797,0.02638286,0.00008172908,0.000008176474,0.0007417346,0.96744275,0.000007661845,0.0005438236,0.00019436894,0.0006967613,0.0037168488],"study_design_scores_gemma":[0.000004127436,0.00012859932,0.03783806,0.000100396814,0.000010154331,0.00051032315,0.9553156,0.000030909694,0.00011702158,0.00007820015,0.005837883,0.000028701254],"about_ca_topic_score_codex":0.02292278,"about_ca_topic_score_gemma":0.057264324,"teacher_disagreement_score":0.02292278,"about_ca_system_score_codex":0.0016556067,"about_ca_system_score_gemma":0.0015361118,"threshold_uncertainty_score":0.04557872},"labels":[],"label_agreement":null},{"id":"W4414073383","doi":"10.1007/978-3-032-05005-2_6","title":"Watch+AD: Disambiguing Around-the-Smartwatch Interaction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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":"National Research Council Canada; University of British Columbia, Okanagan Campus; University of British Columbia; University of Waterloo","funders":"","keywords":"Touchscreen; Smartwatch; Reachability; Leverage (statistics); Set (abstract data type); Mobile interaction; Isolation (microbiology); Text entry","score_opus":0.015514562252217203,"score_gpt":0.2672110569040184,"score_spread":0.2516964946518012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414073383","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.03269098,0.0018219947,0.79515994,0.00022442709,0.0013913602,0.00027055587,0.0016279523,0.09901144,0.06780134],"genre_scores_gemma":[0.2896669,0.0014390836,0.5787524,0.000819552,0.00033788843,0.0003754439,0.0068957238,0.015938383,0.10577453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995695,0.00007234199,0.00002293882,0.00013195271,0.00014793471,0.000055229153],"domain_scores_gemma":[0.99973816,0.00010275732,0.0000102149725,0.000069489906,0.00004898004,0.000030348338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198796,0.0016430278,0.0011005958,0.0007653918,0.00071544753,0.0019392126,0.0014590687,0.0011762421,0.03852779],"category_scores_gemma":[0.0011016474,0.0005228631,0.00055350066,0.00063763076,0.00043961615,0.002279094,0.0037384948,0.00068673113,0.0185901],"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.0015920429,0.00020493053,0.0010521486,0.00041494123,0.000054731507,0.00062308443,0.0008242134,0.0019498202,0.079411164,0.011345989,0.09680639,0.80572057],"study_design_scores_gemma":[0.00025861763,0.0006152099,0.0040686093,0.00031553314,0.00019587041,0.0024857353,0.0013721875,0.20741533,0.20196961,0.03829723,0.5427338,0.00027224194],"about_ca_topic_score_codex":0.0014810086,"about_ca_topic_score_gemma":0.0033568942,"teacher_disagreement_score":0.03852779,"about_ca_system_score_codex":0.0002339863,"about_ca_system_score_gemma":0.00033309072,"threshold_uncertainty_score":0.12888831},"labels":[],"label_agreement":null},{"id":"W4414100573","doi":"10.1007/978-3-032-05036-6","title":"Electronic Voting","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fonds De La Recherche Scientifique - FNRS; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Eesti Teadusagentuur; Brock University; Agence Nationale de la Recherche; Université de Lorraine","keywords":"Electronic voting; Voting; Cover (algebra); Usability; The Internet; Point (geometry)","score_opus":0.007433424085278672,"score_gpt":0.23396668280352545,"score_spread":0.22653325871824678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414100573","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033231906,0.0027528172,0.032239646,0.00578797,0.0055785314,0.00050527934,0.002237777,0.0013469959,0.94622785],"genre_scores_gemma":[0.07867024,0.0037064448,0.018450955,0.0037055928,0.001615336,0.00048245036,0.0060687535,0.000890505,0.88640976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9874659,0.0036174136,0.00087029807,0.0016204903,0.005290148,0.0011357605],"domain_scores_gemma":[0.98780125,0.002996557,0.00046291345,0.0031397927,0.0046526026,0.0009468174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008430239,0.0006327146,0.0008552774,0.0027442689,0.0030290126,0.00809504,0.0020242012,0.0023725564,0.19641578],"category_scores_gemma":[0.026134675,0.0004271232,0.0007227475,0.0032249035,0.0015111982,0.0053852396,0.005018428,0.0019900533,0.1024694],"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.000116898926,0.000059331618,0.0012712879,0.00033589618,0.000024742512,0.000091881375,0.00036563282,0.0005755635,0.00057064457,0.21782501,0.44023585,0.3385273],"study_design_scores_gemma":[0.000010241785,0.00002453727,0.00040258872,0.000101085585,0.0000041453304,0.000071428534,0.00013924198,0.00025373683,0.00037833277,0.01338539,0.9852197,0.000009505694],"about_ca_topic_score_codex":0.0015411049,"about_ca_topic_score_gemma":0.0022032578,"teacher_disagreement_score":0.19641578,"about_ca_system_score_codex":0.0020081564,"about_ca_system_score_gemma":0.0028224827,"threshold_uncertainty_score":0.65707624},"labels":[],"label_agreement":null},{"id":"W4414101765","doi":"10.1007/978-3-032-05036-6_3","title":"Revisiting Silent Coercion","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Credential; Adversary; Mathematical proof; Voting; Coercion (linguistics); Adversarial system; Cryptography; Protocol (science)","score_opus":0.013496904202560906,"score_gpt":0.24862193775053684,"score_spread":0.23512503354797593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414101765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059447825,0.0028745283,0.721781,0.01042662,0.001922237,0.00035709984,0.00019657759,0.0012270549,0.20176707],"genre_scores_gemma":[0.9037889,0.0012911006,0.05808206,0.002753266,0.00074215874,0.0003270197,0.00011841236,0.00048147966,0.032415684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858387,0.0062959776,0.0006549197,0.0019914904,0.004086974,0.0011318513],"domain_scores_gemma":[0.9818255,0.008435221,0.0008367115,0.006781262,0.001632267,0.00048899034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008466468,0.0006815422,0.0009095953,0.0007940245,0.0025761742,0.005396274,0.0030123245,0.0029700454,0.008113626],"category_scores_gemma":[0.021704506,0.0006087933,0.0011706533,0.0006567107,0.014409981,0.013159294,0.007955328,0.009201437,0.002464656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039254668,0.000017358658,0.00014130786,0.00007341148,0.000008678761,0.0001089816,0.00063594355,0.00094995263,0.0013446436,0.98504585,0.0013436727,0.01029091],"study_design_scores_gemma":[0.000053464795,0.000092924056,0.00016800637,0.00025086003,0.000034497283,0.0003861835,0.00029829625,0.018812306,0.011176941,0.8880841,0.08057655,0.00006579964],"about_ca_topic_score_codex":0.00099844,"about_ca_topic_score_gemma":0.00041669465,"teacher_disagreement_score":0.008466468,"about_ca_system_score_codex":0.0018334534,"about_ca_system_score_gemma":0.002037052,"threshold_uncertainty_score":0.044775486},"labels":[],"label_agreement":null},{"id":"W4414101809","doi":"10.1007/978-3-032-05036-6_9","title":"Credential Attacks in Ontario’s Online Elections","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Brock University; Western University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Brock University","keywords":"Exploit; Credential; Context (archaeology); Vulnerability (computing); Voting; Login; Authentication (law)","score_opus":0.015580803520908175,"score_gpt":0.25339340456865167,"score_spread":0.2378126010477435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414101809","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.86548585,0.0004548683,0.0042233677,0.0020728358,0.00009385696,0.00013798261,0.0005459385,0.00031068365,0.1266746],"genre_scores_gemma":[0.99042106,0.00018605597,0.0006709536,0.00010663753,0.000014757952,0.000011394842,0.00016297992,0.000017231856,0.008408973],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99742943,0.00032098658,0.000054878154,0.00012199983,0.0013304612,0.0007422458],"domain_scores_gemma":[0.9976865,0.0005048069,0.00040025456,0.0004490263,0.00058818125,0.00037131133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075562345,0.00019508916,0.0001945835,0.000959661,0.0038102889,0.0018983344,0.00073655316,0.0007573203,0.002753157],"category_scores_gemma":[0.003887099,0.00017206484,0.00017274047,0.002033732,0.0020760016,0.0009713429,0.0012859103,0.00060089707,0.0005317869],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010920033,0.00047806647,0.36883387,0.00028187022,0.000083780586,0.0069712107,0.036078215,0.02954065,0.019573005,0.13488023,0.094459936,0.3077272],"study_design_scores_gemma":[0.00008930641,0.0002961773,0.37639683,0.0001546055,0.00006712417,0.0024787157,0.026610438,0.067081526,0.010853416,0.011828144,0.5039163,0.00022737915],"about_ca_topic_score_codex":0.7147578,"about_ca_topic_score_gemma":0.8149111,"teacher_disagreement_score":0.2852422,"about_ca_system_score_codex":0.011542547,"about_ca_system_score_gemma":0.0069839726,"threshold_uncertainty_score":0.5738441},"labels":[],"label_agreement":null},{"id":"W4414118927","doi":"10.1007/978-3-032-05008-3_67","title":"Evaluating Social Dynamics and Uncanny Valley Perceptions in Human-Robot Interaction: Insights from the ROSaS Questionnaire","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Ontario Tech University","funders":"","keywords":"Uncanny valley; Formative assessment; Perception; Session (web analytics); Uncanny; Social dynamics; Empirical research; Dynamics (music)","score_opus":0.05654357958814235,"score_gpt":0.40106882240566,"score_spread":0.3445252428175176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414118927","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.9967733,0.000021803451,0.00053930643,0.000068138936,0.0000053597164,0.000041881653,0.00008093968,0.00001399631,0.0024552674],"genre_scores_gemma":[0.99846977,0.00002534499,0.00054056366,0.000038169303,0.0000033225836,0.000064069616,0.00011286295,0.000010746206,0.00073507364],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982445,0.0008256722,0.00010796127,0.00014347081,0.0005127581,0.00016563464],"domain_scores_gemma":[0.98536646,0.007651292,0.0036195677,0.0005339176,0.0014242656,0.001404477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029352617,0.00021355214,0.00023149695,0.00055943866,0.0007512598,0.0010928994,0.00052037265,0.00059881946,0.0025684703],"category_scores_gemma":[0.016060434,0.00019917781,0.0003207022,0.00025973286,0.00074278034,0.00082440354,0.0011564933,0.0008214715,0.0005282578],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045209032,0.0008200609,0.8488486,0.00020469863,0.00017671268,0.00032530454,0.10072522,0.0009569611,0.005981866,0.00069909455,0.002117111,0.038692243],"study_design_scores_gemma":[0.000013546888,0.0003021567,0.9493233,0.000021803904,0.000016713042,0.00008925705,0.04638403,0.0009411591,0.00038496824,0.0002480557,0.0022365984,0.00003845655],"about_ca_topic_score_codex":0.004114149,"about_ca_topic_score_gemma":0.007812588,"teacher_disagreement_score":0.004114149,"about_ca_system_score_codex":0.00056125934,"about_ca_system_score_gemma":0.00058871036,"threshold_uncertainty_score":0.0155233145},"labels":[],"label_agreement":null},{"id":"W4414128997","doi":"10.1007/978-3-032-04558-4_8","title":"Learning to Optimize Entropy in the Soft Actor-Critic","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Benchmarking; Regularization (linguistics); Entropy (arrow of time); Artificial neural network; Simulated annealing; Source code","score_opus":0.013576386183217663,"score_gpt":0.2525143598403673,"score_spread":0.23893797365714964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414128997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148471445,0.00044157752,0.97940296,0.00033657646,0.00008882636,0.000026440128,0.00003474548,0.00025994654,0.0045616534],"genre_scores_gemma":[0.84419245,0.00042816743,0.14170468,0.00030534537,0.00021152008,0.0002006947,0.00011121097,0.00035005217,0.012495929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00022149562,0.000025723693,0.00009586924,0.00010838582,0.000072836854],"domain_scores_gemma":[0.99762696,0.0018748597,0.00011983252,0.00010371342,0.00018022991,0.00009437678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018733516,0.0012410418,0.0016210775,0.00055975764,0.00042308826,0.0013244565,0.0014370087,0.001582034,0.0026543164],"category_scores_gemma":[0.005687859,0.0008120659,0.00048716122,0.0005292607,0.0018446363,0.0016058458,0.0021410997,0.002314308,0.0005754026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000659952,0.000023351799,0.00019284866,0.000069164686,0.000039301318,0.000029301507,0.000031224834,0.94884586,0.00084209826,0.03061875,0.0009394504,0.018302754],"study_design_scores_gemma":[0.0000055381934,0.000008680281,0.00002147872,0.0000056701438,0.0000033485449,0.0000043306745,0.0000014667545,0.99047416,0.00015877135,0.009223349,0.00009053061,0.0000027113024],"about_ca_topic_score_codex":0.0023021959,"about_ca_topic_score_gemma":0.0034686085,"teacher_disagreement_score":0.0026543164,"about_ca_system_score_codex":0.001380659,"about_ca_system_score_gemma":0.0010615304,"threshold_uncertainty_score":0.010017395},"labels":[],"label_agreement":null},{"id":"W4414129225","doi":"10.1007/978-3-032-04558-4_12","title":"Efficient Learning in Spiking Neural Networks - Introducing Feedback Alignment to the Reinforced Liquid State Machine","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Memory and Neural Computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"MNIST database; Neuromorphic engineering; Feed forward; Reservoir computing; Spiking neural network; Key (lock); State (computer science); Artificial neural network","score_opus":0.00723575068993434,"score_gpt":0.21914052133414658,"score_spread":0.21190477064421223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414129225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009410555,0.00041893907,0.986034,0.00021011307,0.00008641052,0.000019164583,0.000033889934,0.00046160535,0.0033253105],"genre_scores_gemma":[0.5349163,0.00084299076,0.4539761,0.00017597698,0.00017413244,0.0001632385,0.00013396563,0.0004692366,0.009148082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980086,0.00005299692,0.000014486589,0.00004236811,0.00006706521,0.000022170474],"domain_scores_gemma":[0.99941194,0.00034433682,0.00005271816,0.000075001604,0.00008756843,0.000028454075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005728624,0.00039156686,0.00065927336,0.00026548406,0.00027867133,0.00082471437,0.0013311513,0.00090896635,0.0026979938],"category_scores_gemma":[0.0024201549,0.00037548708,0.00036632983,0.0006631435,0.0006760155,0.0013717003,0.0013357615,0.0012777329,0.00059234793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087612876,0.000070768285,0.00028837836,0.0001296583,0.000041524283,0.00005164563,0.000057882244,0.6607147,0.017595412,0.12184811,0.0024070719,0.19670723],"study_design_scores_gemma":[0.0000027797507,0.000008588888,0.000024181232,0.0000040873174,0.0000018039826,0.000007723989,0.0000018901627,0.9810387,0.0012843341,0.017156312,0.00046623463,0.000003242304],"about_ca_topic_score_codex":0.001619258,"about_ca_topic_score_gemma":0.002187013,"teacher_disagreement_score":0.0026979938,"about_ca_system_score_codex":0.0006997538,"about_ca_system_score_gemma":0.0005204716,"threshold_uncertainty_score":0.009025753},"labels":[],"label_agreement":null},{"id":"W4414129234","doi":"10.1007/978-3-032-04558-4_32","title":"Correcting the Modified Stochastic Synaptic Model of Synaptic Dynamics Refinement of Vesicle and Neurotransmitters Functions","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Synaptic plasticity; Computational model; Neural facilitation; Synaptic vesicle; Dynamics (music); Field (mathematics); Stochastic modelling; Facilitation; Spiking neural network","score_opus":0.024884449932452403,"score_gpt":0.2335333480183599,"score_spread":0.2086488980859075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414129234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044466298,0.0005259812,0.94839513,0.00043088102,0.00032012633,0.000028445878,0.00012721075,0.00030840558,0.005397518],"genre_scores_gemma":[0.8339365,0.00081618637,0.13754258,0.00027529153,0.00024533743,0.0001023175,0.00027358797,0.00037070992,0.026437558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971,0.00007359204,0.00001650721,0.000069536145,0.00009842144,0.000031824828],"domain_scores_gemma":[0.99924374,0.00031660215,0.00010583304,0.00011567067,0.0001765839,0.000041699222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008384571,0.0005433428,0.00079911744,0.0004432569,0.00028385737,0.0005699788,0.0015353053,0.0012471415,0.002007951],"category_scores_gemma":[0.0032558166,0.00042410727,0.0010614576,0.00043725772,0.0007022798,0.0011385661,0.00093107554,0.0009831323,0.0003438383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007078285,0.000016961107,0.00040908132,0.00008417528,0.00005795686,0.00011301923,0.00004265161,0.8518946,0.010398449,0.116896495,0.0014967863,0.018519027],"study_design_scores_gemma":[0.00000265587,0.0000064740366,0.000089372086,0.0000017736373,0.000005931337,0.000021030943,0.0000011922433,0.9902624,0.0004593311,0.008869283,0.00027529328,0.000005188261],"about_ca_topic_score_codex":0.0056487503,"about_ca_topic_score_gemma":0.004064627,"teacher_disagreement_score":0.0056487503,"about_ca_system_score_codex":0.00089292316,"about_ca_system_score_gemma":0.0009317443,"threshold_uncertainty_score":0.01123178},"labels":[],"label_agreement":null},{"id":"W4414192480","doi":"10.1007/978-3-032-04630-7_1","title":"Evaluating Compliance with Visualization Guidelines in Diagrams for Scientific Publications Using Large Vision Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Visualization; Set (abstract data type); Misinformation; Data visualization; Field (mathematics); Creative visualization; Data set; Quality (philosophy)","score_opus":0.14537905230043033,"score_gpt":0.43875689070741575,"score_spread":0.2933778384069854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414192480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reporting","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"reporting","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5906126,0.0012295558,0.34253147,0.0032400691,0.00045664486,0.0018841606,0.014537673,0.029131383,0.016376395],"genre_scores_gemma":[0.73410004,0.00033691042,0.24508435,0.00022069935,0.000057904184,0.0006549079,0.015784243,0.0015794716,0.0021815216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.971349,0.0139120715,0.0040428177,0.0021689055,0.007956318,0.000570821],"domain_scores_gemma":[0.62092286,0.29769516,0.023117729,0.017229073,0.038813725,0.002221502],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.022319322,0.000840267,0.0006302095,0.0071597034,0.0010207735,0.006440415,0.0014637413,0.0025178443,0.0045600864],"category_scores_gemma":[0.2758821,0.00067650824,0.00116746,0.00474923,0.00080630835,0.007659638,0.0025689076,0.0014248522,0.0013732074],"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.0038387375,0.002009858,0.23955439,0.004836112,0.0010633795,0.0010630374,0.010595875,0.093540415,0.014613706,0.037571114,0.066705614,0.5246077],"study_design_scores_gemma":[0.00059114315,0.0011865385,0.042330217,0.0016375809,0.00088997814,0.00067835295,0.0051993798,0.8303255,0.021592174,0.04660416,0.048736792,0.00022823074],"about_ca_topic_score_codex":0.0064274175,"about_ca_topic_score_gemma":0.011593597,"teacher_disagreement_score":0.9776807,"about_ca_system_score_codex":0.0014138186,"about_ca_system_score_gemma":0.0034221984,"threshold_uncertainty_score":0.118037224},"labels":[],"label_agreement":null},{"id":"W4414193594","doi":"10.1007/978-3-032-04999-5_34","title":"Rewind and Recover: A Comparative Study of Resumption Aids for 3D Model Tasks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision 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":"Dalhousie University","funders":"","keywords":"Automatic summarization; Task (project management); Task analysis; Baseline (sea); 3d model","score_opus":0.2545413296443642,"score_gpt":0.431101692986673,"score_spread":0.1765603633423088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414193594","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.9836827,0.0011066819,0.008050246,0.00004801333,0.00003757771,0.0003432191,0.0004184761,0.00039151983,0.0059216083],"genre_scores_gemma":[0.9744561,0.0009168411,0.014058426,0.00006216458,0.000015365098,0.000316018,0.00094364764,0.00027069586,0.00896075],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990771,0.00036484786,0.00007567176,0.00010040647,0.00030809853,0.000073874355],"domain_scores_gemma":[0.980185,0.017387502,0.00069815654,0.0009221935,0.0005714851,0.00023568075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015507614,0.000676331,0.0006528912,0.0015109911,0.00042270045,0.0012668322,0.0016619018,0.000783276,0.0071229395],"category_scores_gemma":[0.019519836,0.0003763339,0.00042062954,0.0007383223,0.00044695742,0.002388377,0.00093595946,0.0005082643,0.0012776684],"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.02550339,0.006206648,0.022967469,0.0035941268,0.00025186548,0.00086058094,0.017910996,0.0141305225,0.08624796,0.0036417334,0.0043380163,0.8143468],"study_design_scores_gemma":[0.0038352243,0.07453734,0.52093834,0.0017590615,0.0019815955,0.0038524368,0.034989044,0.16297291,0.12031163,0.009616133,0.064317204,0.0008890361],"about_ca_topic_score_codex":0.004889223,"about_ca_topic_score_gemma":0.0039437395,"teacher_disagreement_score":0.0071229395,"about_ca_system_score_codex":0.00039334566,"about_ca_system_score_gemma":0.0005923705,"threshold_uncertainty_score":0.023828566},"labels":[],"label_agreement":null},{"id":"W4414193951","doi":"10.1007/978-3-032-05188-2_10","title":"Test Generation for Deep Reinforcement Learning Using LRP-Guided Mutation of Classified Configurations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Reinforcement learning; Classifier (UML); Relevance (law); Key (lock); Binary number; Binary classification","score_opus":0.057442439023788226,"score_gpt":0.3055683181089162,"score_spread":0.24812587908512798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414193951","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.13002586,0.00030105736,0.85610664,0.00037822698,0.000109306755,0.00019888848,0.00022975757,0.006545053,0.0061052465],"genre_scores_gemma":[0.8254335,0.000041776584,0.1708784,0.00017747236,0.000017905655,0.00018712167,0.00026204664,0.00033533233,0.0026664266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.00022303792,0.000037376318,0.00017678954,0.00016463173,0.0001358127],"domain_scores_gemma":[0.9971155,0.0019190486,0.00017024267,0.00027022534,0.0004002987,0.00012466616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011901293,0.0009425522,0.00090402673,0.0007284037,0.0003150306,0.00058549613,0.0020452256,0.0012958278,0.0063883695],"category_scores_gemma":[0.0050015063,0.00046916254,0.0005522712,0.00031345861,0.0009100756,0.00084884034,0.0012376108,0.0014843112,0.0007564638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047823056,0.00034612807,0.0024367787,0.00015864013,0.00005647336,0.00024953505,0.0001146058,0.6515449,0.01206855,0.006770854,0.004202129,0.32157308],"study_design_scores_gemma":[0.000017456778,0.000033755754,0.000100453944,0.0000074270806,0.0000046091213,0.000018089238,0.000004898422,0.99631554,0.0015107194,0.001844572,0.00013887534,0.00000364792],"about_ca_topic_score_codex":0.00512822,"about_ca_topic_score_gemma":0.005216289,"teacher_disagreement_score":0.0063883695,"about_ca_system_score_codex":0.0012850949,"about_ca_system_score_gemma":0.0013380698,"threshold_uncertainty_score":0.021371186},"labels":[],"label_agreement":null},{"id":"W4414218952","doi":"10.1007/978-3-032-04200-2","title":"Software Engineering and Advanced Applications","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Université de Sfax; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Universidade Federal do Estado do Rio de Janeiro; Masarykova Univerzita; Politechnika Lódzka; Libera Università di Bolzano; Universität zu Köln; Silesian University of Technology; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universidade do Porto; Politechnika Rzeszowska im. Ignacego Łukasiewicza; Uniwersytet Warszawski; Blekinge Tekniska Högskola; Gran Sasso Science Institute; Wojskowa Akademia Techniczna; Università degli Studi dell'Insubria; Universidade Federal de Pernambuco; Siemens; Jyväskylän Yliopisto; Atilim Üniversitesi; Universidade Federal de Sergipe; Westfälische Wilhelms-Universität Münster; Technische Universität Wien; Oxford Brookes University; Politechnika Gdańska; Florida Gulf Coast University; Nanzan University; Vrije Universiteit Brussel; University of New South Wales; Hacettepe Üniversitesi; KU Leuven; Queen's University; Technische Universität Dresden; Oulun Yliopisto; International Islamic University Malaysia; Deutsches Zentrum für Luft- und Raumfahrt; University of Twente; Stockholms Universitet; Chalmers Tekniska Högskola; Göteborgs Universitet; Universität Ulm; National University of Singapore; Università degli Studi dell'Aquila; Radboud Universiteit; National Institute of Informatics; Rijksuniversiteit Groningen; University of Macedonia; University of Western Macedonia; Universidad Autónoma de Madrid; Uniwersytet Szczeciński; Mälardalens högskola; University of Galway; Universitatea Babeș-Bolyai; Queen's University Belfast; Universidad de Castilla-La Mancha; Politechnika Bialostocka; Scuola Superiore Sant'Anna; Háskóli Íslands; Politechnika Wrocławska; Universität Innsbruck; Aristotle University of Thessaloniki; Technische Universiteit Delft; Birmingham City University; Carl von Ossietzky Universität Oldenburg; Norges Teknisk-Naturvitenskapelige Universitet; Technische Universiteit Eindhoven; Universität Stuttgart; University of Canterbury; Politechnika Warszawska; Univerzita Karlova v Praze; Università degli Studi di Salerno; Karlstads universitet; Malmö Högskola; Universität Duisburg-Essen; Università degli Studi di Napoli Federico II","keywords":"Software; Work (physics); Software system","score_opus":0.004720742404718659,"score_gpt":0.22185601713145953,"score_spread":0.21713527472674088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414218952","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019440214,0.10599734,0.0711092,0.003023211,0.008697627,0.00014170626,0.0005173098,0.0015748129,0.8069947],"genre_scores_gemma":[0.005521864,0.029192751,0.0112963,0.0006700771,0.0017266426,0.00009787411,0.00040807723,0.00051539077,0.95057106],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937695,0.000065425564,0.000025312627,0.00009060047,0.00041002902,0.000031725904],"domain_scores_gemma":[0.9993262,0.00024242586,0.00003647692,0.00012278516,0.00020150973,0.000070510665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050030224,0.00219598,0.0016559425,0.002725681,0.0007011096,0.0028865286,0.000826003,0.0011033271,0.09618727],"category_scores_gemma":[0.0016843195,0.00073954515,0.0006223192,0.0042861947,0.00079341076,0.0029821612,0.0016133278,0.0030600925,0.08482654],"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.000027677159,0.00007625106,0.00011187656,0.00045289658,0.00002075693,0.00006141693,0.0001466486,0.0017097078,0.0021872304,0.07027165,0.3855616,0.5393724],"study_design_scores_gemma":[0.000008529272,0.00005214742,0.00041774035,0.00028948628,0.000013566428,0.0002101906,0.000032336513,0.0019548198,0.00048259745,0.039274007,0.9572547,0.000009835012],"about_ca_topic_score_codex":0.0006731405,"about_ca_topic_score_gemma":0.0015764454,"teacher_disagreement_score":0.09618727,"about_ca_system_score_codex":0.00076657435,"about_ca_system_score_gemma":0.0010345057,"threshold_uncertainty_score":0.32177848},"labels":[],"label_agreement":null},{"id":"W4414218998","doi":"10.1007/978-3-032-04207-1_12","title":"From Diverse Origins to a DEI Crisis: The Pushback Against Equity, Diversity, and Inclusion in Software Engineering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Backlash; Inclusion (mineral); Software; Resilience (materials science); Exploratory research; Reflexivity; Adaptation (eye)","score_opus":0.02058067475124085,"score_gpt":0.26558425689997656,"score_spread":0.24500358214873572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414218998","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.09106553,0.022290738,0.0074438737,0.270697,0.0015089143,0.000026617703,0.00007559998,0.00008759186,0.60680413],"genre_scores_gemma":[0.9385439,0.0062726894,0.00155006,0.015150636,0.0009971694,0.000042114127,0.000045374276,0.00017484577,0.03722303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9971597,0.0012068053,0.00008015543,0.00030486405,0.0007249621,0.0005235586],"domain_scores_gemma":[0.99454206,0.0028404542,0.0003924253,0.00053936156,0.000497707,0.0011879565],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0055264574,0.00039165234,0.0006372829,0.0014343441,0.006681154,0.014325775,0.0010187101,0.0037213287,0.0077429498],"category_scores_gemma":[0.008879661,0.00031346577,0.00023412422,0.0022372038,0.030125251,0.022508834,0.0153937545,0.013042139,0.0008847181],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013660623,0.000014555435,0.0003068133,0.000020407662,0.00000193631,0.000036668967,0.008893818,0.00003836452,0.000055021716,0.9611868,0.008168821,0.021263143],"study_design_scores_gemma":[0.000009777507,0.000017920687,0.0009004885,0.00026687913,0.0000029551277,0.00013261526,0.014515621,0.00020329752,0.00018700892,0.8373031,0.14644735,0.0000128880565],"about_ca_topic_score_codex":0.002590606,"about_ca_topic_score_gemma":0.004508566,"teacher_disagreement_score":0.99331886,"about_ca_system_score_codex":0.005039393,"about_ca_system_score_gemma":0.004501086,"threshold_uncertainty_score":0.036563516},"labels":[],"label_agreement":null},{"id":"W4414219421","doi":"10.1007/978-3-032-04207-1_7","title":"Exploring Software Fairness Debt in Gray Literature","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ethics and Social Impacts of AI","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 Calgary","funders":"","keywords":"Technical debt; Gray (unit); Software; Debt; Empirical research; Software development; Software quality","score_opus":0.06491936860126508,"score_gpt":0.3226780983711155,"score_spread":0.2577587297698504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414219421","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41811487,0.013869903,0.04343067,0.050953917,0.00034779697,0.000055941204,0.0002919887,0.000098740544,0.4728362],"genre_scores_gemma":[0.9907987,0.0009995135,0.001869883,0.0009566526,0.00010684864,0.000021254931,0.000036615835,0.00003802749,0.005172486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99792993,0.0010873453,0.00006178348,0.00024893048,0.00038019716,0.00029186028],"domain_scores_gemma":[0.97909194,0.015639883,0.0012214179,0.0011926426,0.0018046998,0.0010494619],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005732619,0.0002654638,0.0005693378,0.005404198,0.004652373,0.005839894,0.0010778358,0.0016324106,0.008315212],"category_scores_gemma":[0.02811012,0.0002587336,0.00031368225,0.008170549,0.011417887,0.011466597,0.004901913,0.0025633457,0.0003369186],"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.0000099401905,0.000011946273,0.0012369441,0.000017674281,0.0000034997329,0.00003632723,0.0023325882,0.00025059097,0.000018720693,0.98819834,0.0013201981,0.0065633426],"study_design_scores_gemma":[0.0000040613536,0.0000041613353,0.0011280447,0.00010904956,0.0000065443587,0.00002484872,0.0037669165,0.00085195905,0.00005292427,0.9848483,0.009199298,0.0000039706188],"about_ca_topic_score_codex":0.010315814,"about_ca_topic_score_gemma":0.013407645,"teacher_disagreement_score":0.9942674,"about_ca_system_score_codex":0.0060534724,"about_ca_system_score_gemma":0.0038563032,"threshold_uncertainty_score":0.043921232},"labels":[],"label_agreement":null},{"id":"W4414219651","doi":"10.1007/978-3-032-04207-1","title":"Software Engineering and Advanced Applications","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Université de Sfax; Zachodniopomorski Uniwersytet Technologiczny w Szczecinie; Universidade Federal do Estado do Rio de Janeiro; Masarykova Univerzita; Politechnika Lódzka; Libera Università di Bolzano; Universität zu Köln; Silesian University of Technology; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universidade do Porto; Politechnika Rzeszowska im. Ignacego Łukasiewicza; Uniwersytet Warszawski; Blekinge Tekniska Högskola; Gran Sasso Science Institute; Wojskowa Akademia Techniczna; Università degli Studi dell'Insubria; Universidade Federal de Pernambuco; Siemens; Jyväskylän Yliopisto; Atilim Üniversitesi; Universidade Federal de Sergipe; Westfälische Wilhelms-Universität Münster; Technische Universität Wien; Oxford Brookes University; Politechnika Gdańska; Florida Gulf Coast University; Nanzan University; Vrije Universiteit Brussel; University of New South Wales; Hacettepe Üniversitesi; KU Leuven; Queen's University; Technische Universität Dresden; Oulun Yliopisto; International Islamic University Malaysia; Deutsches Zentrum für Luft- und Raumfahrt; University of Twente; Stockholms Universitet; Chalmers Tekniska Högskola; Göteborgs Universitet; Universität Ulm; National University of Singapore; Università degli Studi dell'Aquila; Radboud Universiteit; National Institute of Informatics; Rijksuniversiteit Groningen; University of Macedonia; University of Western Macedonia; Universidad Autónoma de Madrid; Uniwersytet Szczeciński; Mälardalens högskola; University of Galway; Universitatea Babeș-Bolyai; Queen's University Belfast; Universidad de Castilla-La Mancha; Politechnika Bialostocka; Scuola Superiore Sant'Anna; Háskóli Íslands; Politechnika Wrocławska; Universität Innsbruck; Aristotle University of Thessaloniki; Technische Universiteit Delft; Birmingham City University; Carl von Ossietzky Universität Oldenburg; Norges Teknisk-Naturvitenskapelige Universitet; Technische Universiteit Eindhoven; Universität Stuttgart; University of Canterbury; Politechnika Warszawska; Univerzita Karlova v Praze; Università degli Studi di Salerno; Karlstads universitet; Malmö Högskola; Universität Duisburg-Essen; Università degli Studi di Napoli Federico II","keywords":"Software; Work (physics); Software system","score_opus":0.004720742404718659,"score_gpt":0.22185601713145953,"score_spread":0.21713527472674088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414219651","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019440214,0.10599734,0.0711092,0.003023211,0.008697627,0.00014170626,0.0005173098,0.0015748129,0.8069947],"genre_scores_gemma":[0.005521864,0.029192751,0.0112963,0.0006700771,0.0017266426,0.00009787411,0.00040807723,0.00051539077,0.95057106],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937695,0.000065425564,0.000025312627,0.00009060047,0.00041002902,0.000031725904],"domain_scores_gemma":[0.9993262,0.00024242586,0.00003647692,0.00012278516,0.00020150973,0.000070510665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050030224,0.00219598,0.0016559425,0.002725681,0.0007011096,0.0028865286,0.000826003,0.0011033271,0.09618727],"category_scores_gemma":[0.0016843195,0.00073954515,0.0006223192,0.0042861947,0.00079341076,0.0029821612,0.0016133278,0.0030600925,0.08482654],"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.000027677159,0.00007625106,0.00011187656,0.00045289658,0.00002075693,0.00006141693,0.0001466486,0.0017097078,0.0021872304,0.07027165,0.3855616,0.5393724],"study_design_scores_gemma":[0.000008529272,0.00005214742,0.00041774035,0.00028948628,0.000013566428,0.0002101906,0.000032336513,0.0019548198,0.00048259745,0.039274007,0.9572547,0.000009835012],"about_ca_topic_score_codex":0.0006731405,"about_ca_topic_score_gemma":0.0015764454,"teacher_disagreement_score":0.09618727,"about_ca_system_score_codex":0.00076657435,"about_ca_system_score_gemma":0.0010345057,"threshold_uncertainty_score":0.32177848},"labels":[],"label_agreement":null},{"id":"W4414253714","doi":"10.1007/978-3-032-04624-6_33","title":"DocAnnot - Accelerating the Creation of Key Information Extraction Datasets with GenAI-Powered Auto-annotation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","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":"Glycemic Index Laboratories","funders":"","keywords":"Key (lock); Benchmark (surveying); Task (project management); Annotation; Process (computing); Minimum bounding box; Matching (statistics); Automation","score_opus":0.012205942969146325,"score_gpt":0.2750500807634131,"score_spread":0.26284413779426674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414253714","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011059771,0.0014773582,0.28986126,0.00090937666,0.0017254526,0.00071864174,0.12405581,0.55343515,0.016757134],"genre_scores_gemma":[0.028561838,0.00061087514,0.5706949,0.0008767544,0.00020840239,0.00094148976,0.34720778,0.031455845,0.019442081],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99716055,0.00041036028,0.00025893838,0.0009891117,0.0009930744,0.00018799743],"domain_scores_gemma":[0.99542636,0.0013044567,0.0001763371,0.001851067,0.0010681761,0.0001736516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027774137,0.002887716,0.0017316988,0.004260186,0.0022491864,0.0037341267,0.0028689287,0.001367486,0.03505001],"category_scores_gemma":[0.006971816,0.001639685,0.0026823347,0.005648568,0.0008710842,0.0042778123,0.0047566597,0.002590234,0.047864333],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009430797,0.0002245981,0.0019140725,0.0013485702,0.00032648272,0.00027749586,0.0004998769,0.0013821848,0.022767652,0.0063009174,0.66792065,0.2960945],"study_design_scores_gemma":[0.0004544061,0.00027227352,0.0046005463,0.00031025862,0.00026183142,0.0007205664,0.0005494071,0.062520154,0.114643246,0.026417844,0.7889892,0.00026034986],"about_ca_topic_score_codex":0.007138337,"about_ca_topic_score_gemma":0.016204758,"teacher_disagreement_score":0.03505001,"about_ca_system_score_codex":0.0014244058,"about_ca_system_score_gemma":0.0028825814,"threshold_uncertainty_score":0.11725396},"labels":[],"label_agreement":null},{"id":"W4414253768","doi":"10.1007/978-3-032-04624-6_19","title":"Verification of Dynamic Holographic Behavior in Identity Documents","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Minnow Environmental (Canada)","funders":"","keywords":"Identity (music); Benchmark (surveying); Cover (algebra); Code (set theory); Verifiable secret sharing; Protocol (science); Static analysis; Identity theft","score_opus":0.011947451828774401,"score_gpt":0.2837292190124842,"score_spread":0.27178176718370983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414253768","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.5934512,0.00047283148,0.37183845,0.00042980764,0.00023174744,0.000119082455,0.0010540441,0.0021285273,0.030274356],"genre_scores_gemma":[0.9672856,0.00012590611,0.027414273,0.000039147402,0.00002914781,0.000020951038,0.000470031,0.00008878595,0.004526139],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914956,0.00013111143,0.000049350096,0.00019224719,0.00032398629,0.00015380378],"domain_scores_gemma":[0.99736255,0.0009800468,0.00027078303,0.0009468357,0.0003494048,0.00009036035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047892227,0.0002396631,0.00040699364,0.00067589694,0.000727888,0.0017026155,0.0007390097,0.00067839184,0.004803147],"category_scores_gemma":[0.0033979379,0.00026210735,0.0002635246,0.0005627877,0.0011299385,0.0019656022,0.0011772049,0.00065498997,0.0013973468],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002345411,0.00031125522,0.0109633645,0.00032244346,0.00005831788,0.0014944768,0.0014299578,0.013775924,0.29515254,0.30301717,0.007240266,0.36388892],"study_design_scores_gemma":[0.00013298397,0.0005097685,0.013525797,0.00012783078,0.000054063246,0.0022394292,0.0014207065,0.26280558,0.59553355,0.10311055,0.0204221,0.00011772562],"about_ca_topic_score_codex":0.0010064576,"about_ca_topic_score_gemma":0.0008542719,"teacher_disagreement_score":0.004803147,"about_ca_system_score_codex":0.0004957958,"about_ca_system_score_gemma":0.0007364068,"threshold_uncertainty_score":0.01606816},"labels":[],"label_agreement":null},{"id":"W4414343118","doi":"10.1007/978-3-032-05162-2","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Erasmus Universitair Medisch Centrum Rotterdam; University of North Carolina at Greensboro; University of Colorado Denver; University of Texas MD Anderson Cancer Center; University of California, Los Angeles; Helmholtz Artificial Intelligence Cooperation Unit; Stony Brook University; ShanghaiTech University; Johns Hopkins University; Harbin Institute of Technology; Universität Innsbruck; University of Science and Technology of China; Shenzhen University; Universidade do Minho; Julius-Maximilians-Universität Würzburg; National University of Singapore; Zayed University; Rheinische Friedrich-Wilhelms-Universität Bonn; Peking University; Monash University; Universitat Rovira i Virgili; Indian Institute of Technology Delhi; Uniwersytet Warszawski; Hokkaido University; Institute of Computing Technology, Chinese Academy of Sciences; Nanjing University of Science and Technology; Korea University Anam Hospital; Cleveland Clinic; Shanghai Jiao Tong University; Siemens Healthineers; Università degli Studi di Messina; Zhejiang University; Kungliga Tekniska Högskolan; Tongji University; Hebrew University of Jerusalem; Huazhong University of Science and Technology; Eidgenössische Technische Hochschule Zürich; McMaster University; Technische Universiteit Eindhoven; RIKEN; Concordia University; Chalmers Tekniska Högskola; National Institutes of Health; Anhui University; Indian Institute of Technology Jodhpur; Technische Universität München; Kyung Hee University; University of Exeter; Chinese Academy of Sciences; Shandong University; Nanyang Technological University; University of Electronic Science and Technology of China; Université de Lausanne; Boston College; University of Westminster; University of Leeds; University of Oxford; Medizinische Universität Innsbruck; Imperial College London; King's College London; Northwestern University; Rensselaer Polytechnic Institute; University of North Carolina at Chapel Hill; Politecnico di Torino; University of Twente; Beihang University; Intuitive Surgical; University of Cape Town; Massachusetts General Hospital; University College London; University of Notre Dame; Polytechnique Montréal; Heriot-Watt University; Norges Teknisk-Naturvitenskapelige Universitet; Karolinska Institutet; Yale University; Weill Cornell Medical College; University of Pennsylvania; Xiamen University; Univerza v Ljubljani; Universitätsspital Basel; Vanderbilt University; Fudan University; Tencent; Université de Sfax; University of Bern; Daegu Gyeongbuk Institute of Science and Technology; Korea University; Northwestern Polytechnical University; Children's National Hospital; Harvard University; Deutsches Krebsforschungszentrum; Beijing Institute of Technology; Agency for Science, Technology and Research; East China Normal University; Gachon University; Université de Strasbourg; Universidad de Zaragoza; Robarts Research Institute; Eberhard Karls Universität Tübingen; Memorial Sloan-Kettering Cancer Center; Universidade de Coimbra; University of Texas at Arlington; Yonsei University; Rowan University; Nanjing University; Oulun Yliopisto; Pohang University of Science and Technology; Nile University; South China University of Technology","keywords":"Intervention (counseling); Image (mathematics); Image processing; Computer Applications; Medical imaging","score_opus":0.008348370353227082,"score_gpt":0.30890641167883337,"score_spread":0.30055804132560626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414343118","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036052174,0.13157155,0.25225204,0.0063305167,0.03434243,0.00032971584,0.002488537,0.0047437777,0.5643362],"genre_scores_gemma":[0.019343864,0.050322037,0.09863964,0.0010604421,0.009680836,0.00022734635,0.0032957925,0.0020503267,0.8153798],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927944,0.00006435989,0.000038117138,0.00014564031,0.0004305134,0.00004198439],"domain_scores_gemma":[0.9991697,0.00016133353,0.000038091002,0.000118319615,0.00037101744,0.000141532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009944683,0.0016814499,0.0010045647,0.0027781916,0.00045352668,0.00223658,0.0011828955,0.0011143682,0.05928337],"category_scores_gemma":[0.0016459407,0.000621008,0.0006321827,0.0025840816,0.0006690367,0.0019799683,0.0017963945,0.0025456545,0.036791325],"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.000046526515,0.000027476966,0.00008455047,0.00030829568,0.00002778673,0.000032373155,0.000018287972,0.0024046574,0.0024184228,0.01901029,0.45100772,0.52461356],"study_design_scores_gemma":[0.000007813466,0.000058605925,0.0011277368,0.00017957886,0.000019221465,0.00047247976,0.000012797933,0.014768409,0.0029479184,0.014041405,0.9663305,0.00003350669],"about_ca_topic_score_codex":0.0023541467,"about_ca_topic_score_gemma":0.0033501608,"teacher_disagreement_score":0.05928337,"about_ca_system_score_codex":0.0008718491,"about_ca_system_score_gemma":0.0010858224,"threshold_uncertainty_score":0.19832265},"labels":[],"label_agreement":null},{"id":"W4414350018","doi":"10.1007/978-3-032-04971-1_10","title":"ConStyX: Content Style Augmentation for Generalizable Medical Image Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Image segmentation; Segmentation; Image (mathematics); Image processing; Pattern recognition (psychology); Scale-space segmentation","score_opus":0.02058843324833159,"score_gpt":0.31118274765494897,"score_spread":0.29059431440661737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414350018","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.0096162055,0.0006315508,0.95807457,0.00017989337,0.00023785794,0.00016993363,0.0012974279,0.026575757,0.0032167446],"genre_scores_gemma":[0.067078575,0.00076426583,0.9104035,0.00043753986,0.00020515981,0.000192442,0.0042804447,0.005322484,0.011315565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968386,0.000034770528,0.000015491016,0.00009977653,0.00012538458,0.0000407183],"domain_scores_gemma":[0.9995639,0.00011712013,0.000030158211,0.00015549002,0.000091894624,0.00004143023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056453026,0.0013639651,0.00090908376,0.0012329855,0.0002803876,0.0012099671,0.0017356871,0.0012041568,0.014954886],"category_scores_gemma":[0.001367428,0.0005999854,0.0011830318,0.0012222304,0.00045619,0.0010234349,0.0017472593,0.0014997363,0.0050402465],"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.0005157112,0.000093076625,0.00035037688,0.00026869096,0.00009028086,0.00014135258,0.000060547573,0.0166091,0.108214274,0.0039132037,0.03083557,0.8389078],"study_design_scores_gemma":[0.00011506342,0.00028401634,0.001725276,0.00006804305,0.000090950816,0.0008515721,0.000048903024,0.81155914,0.12180368,0.013958739,0.049429256,0.00006539731],"about_ca_topic_score_codex":0.0026445452,"about_ca_topic_score_gemma":0.0049857483,"teacher_disagreement_score":0.014954886,"about_ca_system_score_codex":0.00051408855,"about_ca_system_score_gemma":0.00065709517,"threshold_uncertainty_score":0.0500291},"labels":[],"label_agreement":null},{"id":"W4414370937","doi":"10.1007/978-3-032-05182-0_3","title":"Attention-Based Multimodal Deep Learning Model for Post-stroke Motor Impairment Prediction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stroke Rehabilitation and Recovery","field":"Medicine","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":"Jewish Rehabilitation Hospital; McGill University","funders":"","keywords":"Diffusion MRI; Neuroimaging; Deep learning; Pooling; Fractional anisotropy; Residual; Pattern recognition (psychology); White matter","score_opus":0.00959985440567102,"score_gpt":0.2552717795148176,"score_spread":0.2456719251091466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414370937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13705418,0.008465545,0.8363817,0.0012273722,0.000722369,0.00011099101,0.0029887331,0.0037686394,0.009280451],"genre_scores_gemma":[0.9206809,0.0019463468,0.0541473,0.00048304527,0.00024656323,0.00014819641,0.0024634253,0.000108678716,0.019775521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989367,0.000013403303,0.0000054130383,0.000037763177,0.000017914661,0.000031937674],"domain_scores_gemma":[0.9998517,0.00006014057,0.00000988029,0.000010052971,0.000057488414,0.000010793639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036243474,0.0008044159,0.0006836421,0.0004467685,0.00018209139,0.00038509595,0.00088255206,0.00071997335,0.0033544607],"category_scores_gemma":[0.00065382366,0.00023453264,0.0007674975,0.00044377247,0.00012613313,0.0005240816,0.0006877119,0.0011494795,0.0010240088],"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.00031399936,0.00028395682,0.0032359175,0.00010012391,0.00016133118,0.00016293646,0.000048105256,0.20884766,0.008246559,0.0014615478,0.013650644,0.76348734],"study_design_scores_gemma":[0.0000042149604,0.00005222126,0.0012811617,0.00001485052,0.00003726818,0.000037011534,0.000006920348,0.99523914,0.0013726893,0.001418614,0.00052777084,0.000008179927],"about_ca_topic_score_codex":0.012656831,"about_ca_topic_score_gemma":0.016342787,"teacher_disagreement_score":0.012656831,"about_ca_system_score_codex":0.00050085835,"about_ca_system_score_gemma":0.000565881,"threshold_uncertainty_score":0.025166333},"labels":[],"label_agreement":null},{"id":"W4414373131","doi":"10.1007/978-3-032-04947-6_29","title":"Instrument-Splatting: Controllable Photorealistic Reconstruction of Surgical Instruments Using Gaussian Splatting","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anatomy and Medical Technology","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 British Columbia","funders":"","keywords":"Monocular; Gaussian; Point cloud; Fidelity; Kinematics; 3D reconstruction; High fidelity; Mixture model","score_opus":0.012066903949689156,"score_gpt":0.23344876868718797,"score_spread":0.22138186473749882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414373131","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.18930939,0.0040458837,0.7687033,0.00023575472,0.000333194,0.0001583936,0.00029319394,0.0037321635,0.03318876],"genre_scores_gemma":[0.5708911,0.002449223,0.3844471,0.00021102259,0.0001000441,0.000067829445,0.0003472177,0.0006139582,0.040872566],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980575,0.000010743705,0.000009951438,0.00004472098,0.00010496494,0.000023913206],"domain_scores_gemma":[0.99988854,0.000028169223,0.000022204902,0.00003426375,0.000013194342,0.0000136200315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002608372,0.000501646,0.000265937,0.0004472937,0.00019587368,0.0005205748,0.0006713869,0.00047675578,0.0040310114],"category_scores_gemma":[0.00020052733,0.00040805052,0.00045116936,0.0004330278,0.0006268379,0.0007218441,0.00069352944,0.0008081695,0.000998684],"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.0001281653,0.00007970459,0.00040249026,0.00022064743,0.00001709389,0.00021408594,0.00021135378,0.0026466204,0.79957056,0.00846778,0.0023026683,0.18573889],"study_design_scores_gemma":[0.000059500053,0.0013538552,0.0129389595,0.00008713314,0.000083723484,0.0091957385,0.00016240236,0.059263993,0.8232516,0.005145371,0.08830601,0.00015173815],"about_ca_topic_score_codex":0.00035411466,"about_ca_topic_score_gemma":0.00078844395,"teacher_disagreement_score":0.0040310114,"about_ca_system_score_codex":0.0002502817,"about_ca_system_score_gemma":0.00027524892,"threshold_uncertainty_score":0.013485074},"labels":[],"label_agreement":null},{"id":"W4414373498","doi":"10.1007/978-3-032-04927-8_12","title":"CENet: Context Enhancement Network for Medical Image Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Segmentation; Context (archaeology); Feature (linguistics); Image segmentation; Key (lock); Boundary (topology); Code (set theory); Image (mathematics); Block (permutation group theory)","score_opus":0.013679759800947152,"score_gpt":0.2848460046431503,"score_spread":0.27116624484220314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414373498","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.015477487,0.0024150694,0.9621017,0.00025545587,0.00027880273,0.0001951868,0.0015096762,0.013356897,0.00440963],"genre_scores_gemma":[0.13929452,0.0018082294,0.83602434,0.0004782538,0.00021128822,0.0002753041,0.0033053653,0.0012061576,0.017396608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988127,0.000014499821,0.000005477044,0.000040173287,0.000041190884,0.000017338514],"domain_scores_gemma":[0.99991,0.000027456379,0.000008312227,0.000015177813,0.0000296451,0.000009318571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955367,0.0010385801,0.0006438485,0.00077622273,0.00031491346,0.0006507995,0.0009811284,0.0009186867,0.0075772624],"category_scores_gemma":[0.0006256773,0.00043131463,0.00057914783,0.000736545,0.00020250135,0.00056438684,0.00095297367,0.0008609031,0.0019795322],"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.0005484747,0.00009895728,0.0006097038,0.00023914583,0.00011164405,0.0002855916,0.000035494064,0.035567865,0.04232047,0.004430722,0.032638513,0.8831133],"study_design_scores_gemma":[0.00007655306,0.00018069694,0.0015771794,0.00007751271,0.000102754566,0.0006181801,0.00003179869,0.9056739,0.05450233,0.007823548,0.029303372,0.000032218286],"about_ca_topic_score_codex":0.004499407,"about_ca_topic_score_gemma":0.009919288,"teacher_disagreement_score":0.0075772624,"about_ca_system_score_codex":0.00043682358,"about_ca_system_score_gemma":0.0006276174,"threshold_uncertainty_score":0.025348485},"labels":[],"label_agreement":null},{"id":"W4414376541","doi":"10.1007/978-3-032-05073-1_19","title":"MBSA Model-Exchange and Its Challenges","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"Safran Electronics (Canada)","funders":"","keywords":"Context (archaeology); Documentation; Process (computing); Fault tree analysis; Representation (politics); Point (geometry); Architecture; Masking (illustration)","score_opus":0.02575704565511683,"score_gpt":0.245007133091704,"score_spread":0.21925008743658717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414376541","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.0101995375,0.0039658938,0.9061165,0.035242885,0.001248812,0.00015003211,0.00056256383,0.002550457,0.039963305],"genre_scores_gemma":[0.23726213,0.00646408,0.70409185,0.004409936,0.0016435189,0.0007170846,0.0014704699,0.0031930953,0.04074784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900248,0.0039727553,0.0005921054,0.001024352,0.003943358,0.00044254225],"domain_scores_gemma":[0.9724347,0.012775659,0.0007783052,0.009541827,0.003525201,0.0009442509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018829897,0.00089765026,0.0020551973,0.0013277245,0.002246247,0.011025784,0.0071508144,0.0043741986,0.01336088],"category_scores_gemma":[0.04390034,0.0014539418,0.002093676,0.0030161794,0.0042957496,0.028877104,0.008642151,0.009969303,0.005717695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044644356,0.00005355662,0.00015355917,0.000090116926,0.000021263164,0.00003990202,0.0002636931,0.0057201725,0.000159367,0.94260526,0.0074485177,0.04339997],"study_design_scores_gemma":[0.0000152047,0.000018081928,0.00004718597,0.00008229333,0.000012814856,0.00006172197,0.00013572899,0.044588648,0.00041772198,0.9129585,0.0416442,0.000017904944],"about_ca_topic_score_codex":0.00530275,"about_ca_topic_score_gemma":0.0031424207,"teacher_disagreement_score":0.018829897,"about_ca_system_score_codex":0.0041318643,"about_ca_system_score_gemma":0.0063394927,"threshold_uncertainty_score":0.09958321},"labels":[],"label_agreement":null},{"id":"W4414379464","doi":"10.1007/978-3-032-05114-1_3","title":"A Novel Framework for Integrating 3D Ultrasound Into Percutaneous Liver Tumour Ablation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hepatocellular Carcinoma Treatment and Prognosis","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"3D ultrasound; Image registration; Percutaneous; Ablation; Landmark; Visualization; 3d model; Ultrasound","score_opus":0.034109872202985954,"score_gpt":0.2650481763485288,"score_spread":0.23093830414554284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414379464","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.0007219182,0.0001768558,0.99461395,0.000064029715,0.00004197001,0.000038790164,0.00007685574,0.0016624122,0.0026031262],"genre_scores_gemma":[0.026804546,0.00061677,0.9630396,0.00010752767,0.00004935141,0.00014960737,0.00037043344,0.0005450711,0.008317118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995975,0.000058964262,0.000021649703,0.000077042925,0.00020398317,0.000040875617],"domain_scores_gemma":[0.9998425,0.000044911667,0.000011401794,0.000032849304,0.00004387698,0.000024388282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046390362,0.0009929205,0.00073324365,0.00089691026,0.0005368771,0.002336754,0.0022660915,0.00135584,0.009413594],"category_scores_gemma":[0.00069005066,0.0007187743,0.0014519218,0.00074406544,0.0006278041,0.0010959442,0.002932557,0.0010914109,0.0034302445],"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.00014131893,0.0001869854,0.0011062054,0.00049017445,0.00017812177,0.0009171832,0.0005029213,0.22452511,0.06472443,0.14684491,0.02342248,0.53696007],"study_design_scores_gemma":[0.000017259807,0.00006286278,0.0004039252,0.00008171003,0.00005333315,0.00058320636,0.00006766251,0.88051516,0.011033406,0.033258736,0.0738612,0.00006144887],"about_ca_topic_score_codex":0.0053248783,"about_ca_topic_score_gemma":0.00832284,"teacher_disagreement_score":0.009413594,"about_ca_system_score_codex":0.0005162388,"about_ca_system_score_gemma":0.0008479478,"threshold_uncertainty_score":0.031491637},"labels":[],"label_agreement":null},{"id":"W4414380779","doi":"10.1007/978-3-032-04927-8_60","title":"Time-Contrastive Pretraining for In-Context Image and Video Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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 Alberta","funders":"","keywords":"Segmentation; Context (archaeology); Pipeline (software); Object (grammar); Image segmentation; Margin (machine learning); Image (mathematics); Pattern recognition (psychology)","score_opus":0.012591938616988648,"score_gpt":0.27951668124131246,"score_spread":0.2669247426243238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414380779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02511263,0.0012278779,0.9626735,0.000143012,0.00021832925,0.000103830236,0.00038789335,0.004293576,0.005839385],"genre_scores_gemma":[0.18379138,0.0012788143,0.79112095,0.00033916743,0.00019013145,0.00018900623,0.0016924809,0.0012210278,0.020177132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996717,0.000035535162,0.000016698843,0.00010671254,0.00009175898,0.00007766769],"domain_scores_gemma":[0.9994086,0.00023253389,0.000041444146,0.0001138728,0.00015606021,0.00004740722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964529,0.0012069121,0.00082176476,0.0009511018,0.0005641491,0.0008789653,0.001314605,0.0012678546,0.011617285],"category_scores_gemma":[0.0011295,0.00056808133,0.0006459502,0.0012534377,0.00043463608,0.0010540436,0.0011123699,0.0015980585,0.0047430946],"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.0003586687,0.00015987305,0.00041491806,0.0001676395,0.000047428734,0.00014145499,0.00006283807,0.0147800455,0.16940774,0.0030766241,0.006894509,0.80448824],"study_design_scores_gemma":[0.000023481807,0.00029920894,0.003091012,0.000078037985,0.00012846365,0.00058536336,0.00008969595,0.7324095,0.2361794,0.0060089445,0.021063508,0.000043501917],"about_ca_topic_score_codex":0.0074945823,"about_ca_topic_score_gemma":0.01943167,"teacher_disagreement_score":0.011617285,"about_ca_system_score_codex":0.0005816904,"about_ca_system_score_gemma":0.0012422055,"threshold_uncertainty_score":0.03886366},"labels":[],"label_agreement":null},{"id":"W4414380820","doi":"10.1007/978-3-032-04927-8_56","title":"Small Lesions-aware Bidirectional Multimodal Multiscale Fusion Network for Lung Disease Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"COVID-19 diagnosis using AI","field":"Medicine","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Feature (linguistics); Field (mathematics); Convolutional neural network; Pyramid (geometry); Deep learning; Curse of dimensionality; Medical classification; Pattern recognition (psychology)","score_opus":0.042279195152228555,"score_gpt":0.31281590625353684,"score_spread":0.2705367111013083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414380820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06943663,0.0023521371,0.9216871,0.00037968933,0.00014595666,0.00007014326,0.00083837716,0.0016542558,0.0034357302],"genre_scores_gemma":[0.8143111,0.0014000209,0.17583512,0.00022995114,0.00021560503,0.00012936973,0.001819144,0.00013638676,0.0059233485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.000034961202,0.000009307472,0.000063603635,0.00005740435,0.00003591379],"domain_scores_gemma":[0.99983764,0.000054138472,0.000016433229,0.000023410961,0.000053519634,0.000014812893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058204064,0.0006964473,0.00081720634,0.0008772672,0.0002860765,0.00057767757,0.00083706045,0.0006797205,0.0016217452],"category_scores_gemma":[0.0007173575,0.00024917716,0.0008691458,0.0008881176,0.00019564315,0.00069768296,0.0011339416,0.0006431175,0.0006945974],"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.00034743268,0.00021251041,0.004697647,0.000121586854,0.00025370353,0.00020798847,0.000097465876,0.11222577,0.030697992,0.003546547,0.008728748,0.83886266],"study_design_scores_gemma":[0.000004779178,0.000050590592,0.0016415281,0.000011721349,0.00007245579,0.00008980805,0.0000235673,0.9900551,0.0040632044,0.0030199087,0.00095634494,0.000010996393],"about_ca_topic_score_codex":0.004015523,"about_ca_topic_score_gemma":0.007145028,"teacher_disagreement_score":0.004015523,"about_ca_system_score_codex":0.00037227944,"about_ca_system_score_gemma":0.00044079218,"threshold_uncertainty_score":0.00798434},"labels":[],"label_agreement":null},{"id":"W4414380834","doi":"10.1007/978-3-032-04927-8_59","title":"tHPM-LDM: Integrating Individual Historical Record with Population Memory in Latent Diffusion-Based Glaucoma Forecasting","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Glaucoma and retinal disorders","field":"Medicine","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":"Consistency (knowledge bases); Glaucoma; Population; Missing data; Historical record; Medical record","score_opus":0.01877192422213309,"score_gpt":0.23584138465668336,"score_spread":0.21706946043455028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414380834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029168319,0.0029684005,0.9614519,0.0007642726,0.00042292057,0.00005851002,0.0010660671,0.0026359244,0.0014637287],"genre_scores_gemma":[0.52051955,0.0025932014,0.4631894,0.00032383204,0.0008113366,0.00024364483,0.0034357808,0.0003808661,0.008502475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971026,0.000090673304,0.000028049957,0.000089329464,0.0000500388,0.00003163329],"domain_scores_gemma":[0.998909,0.0007651515,0.00006479296,0.00009247475,0.00012462829,0.000043915894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019702183,0.00067963655,0.0011047896,0.0009961578,0.00040233543,0.0010553639,0.0016170408,0.0012716873,0.00311706],"category_scores_gemma":[0.004433338,0.0005186786,0.0011396507,0.001334814,0.00032534217,0.0018040248,0.0012758025,0.0018201146,0.001339577],"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.00026397957,0.00013243582,0.005122602,0.00018080609,0.00034882326,0.00012318068,0.00016244073,0.43709958,0.0016001927,0.010089528,0.010230989,0.53464544],"study_design_scores_gemma":[0.0000054491084,0.000009705715,0.00032149864,0.000009720239,0.000015069997,0.000010039032,0.0000061913947,0.995552,0.00017180722,0.0033482418,0.00054354273,0.000006642378],"about_ca_topic_score_codex":0.012694714,"about_ca_topic_score_gemma":0.011578602,"teacher_disagreement_score":0.012694714,"about_ca_system_score_codex":0.0005430572,"about_ca_system_score_gemma":0.00070242636,"threshold_uncertainty_score":0.025241673},"labels":[],"label_agreement":null},{"id":"W4414394486","doi":"10.1007/978-3-032-05997-0_13","title":"Contrast-Invariant Self-supervised Segmentation for Quantitative Placental MRI","year":2025,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Fetal and Pediatric Neurological Disorders","field":"Medicine","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":"Children’s Health Research Institute; Western University","funders":"","keywords":"Segmentation; Pattern recognition (psychology); Representation (politics); Consistency (knowledge bases); Matching (statistics); Domain (mathematical analysis); Image segmentation; Echo (communications protocol)","score_opus":0.014828905933444204,"score_gpt":0.28728719349475157,"score_spread":0.27245828756130736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414394486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024508506,0.0006576985,0.9705127,0.00014789363,0.000045177978,0.00008370195,0.00027735796,0.0027038937,0.0010631274],"genre_scores_gemma":[0.2925111,0.0007372219,0.6991514,0.00016676565,0.000127776,0.00019414442,0.0016283147,0.0013932987,0.004089936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937695,0.0001380299,0.00004091445,0.00017601674,0.0001822551,0.00008585099],"domain_scores_gemma":[0.9988636,0.0003888443,0.00017032186,0.00021783792,0.0003017909,0.000057785852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012354095,0.0007874048,0.0009516363,0.0017727831,0.00044599827,0.0012732593,0.0014493797,0.0011725465,0.0016857032],"category_scores_gemma":[0.002641424,0.0007022912,0.0009417407,0.0012333873,0.0005762203,0.0007487872,0.0010828561,0.00093675393,0.001265505],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052662694,0.00021079776,0.002476221,0.0004856297,0.00020874184,0.00019536012,0.00019227374,0.06968294,0.19273551,0.0043738796,0.0065072803,0.7224047],"study_design_scores_gemma":[0.00002050038,0.00009760356,0.0027842186,0.000038579863,0.000055728466,0.0005520592,0.000060181035,0.9256763,0.061890632,0.0046562767,0.004141408,0.000026535383],"about_ca_topic_score_codex":0.002794135,"about_ca_topic_score_gemma":0.0046355515,"teacher_disagreement_score":0.002794135,"about_ca_system_score_codex":0.00057901925,"about_ca_system_score_gemma":0.0014271126,"threshold_uncertainty_score":0.006533563},"labels":[],"label_agreement":null},{"id":"W4414406742","doi":"10.1007/978-3-032-05409-8_19","title":"What Makes a User Click on a News Item?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Media Studies and Communication","field":"Social Sciences","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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Universiteit van Amsterdam; Canadian Institute of Steel Construction","keywords":"Modalities; Image (mathematics); Click-through rate; Contrast (vision); Digital media; Web page; Digital image; Digital library","score_opus":0.031928383973295116,"score_gpt":0.310159382615578,"score_spread":0.2782309986422829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414406742","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.602244,0.008978801,0.01235547,0.014512716,0.0026071365,0.00013746103,0.006365703,0.0015271873,0.35127145],"genre_scores_gemma":[0.89260715,0.0049312874,0.0035723504,0.0010753247,0.0015638699,0.000039749055,0.0024954015,0.00035730915,0.09335755],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99969304,0.00007301949,0.000015721835,0.000053409265,0.00010564743,0.000059138067],"domain_scores_gemma":[0.99818087,0.0010961836,0.00013731414,0.00006137684,0.00024367393,0.00028056515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042179375,0.0003984981,0.00025102543,0.0010035546,0.0005015951,0.0021539745,0.00034026467,0.0010796655,0.022765765],"category_scores_gemma":[0.0039587677,0.00022916014,0.00032362185,0.00085282704,0.0003384684,0.003088156,0.00028052853,0.00053590717,0.007882186],"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.0016223803,0.00069326774,0.27332684,0.0011441711,0.00032497698,0.004134938,0.0060796174,0.0008535808,0.02854291,0.015599015,0.24913839,0.41854],"study_design_scores_gemma":[0.000103315295,0.0006764185,0.6092245,0.0005643797,0.00061977474,0.0117479665,0.01989286,0.023877919,0.025860073,0.021253157,0.28580084,0.00037878737],"about_ca_topic_score_codex":0.0046364604,"about_ca_topic_score_gemma":0.007041963,"teacher_disagreement_score":0.022765765,"about_ca_system_score_codex":0.00030883172,"about_ca_system_score_gemma":0.00017282416,"threshold_uncertainty_score":0.07615906},"labels":[],"label_agreement":null},{"id":"W4414417426","doi":"10.1007/978-3-032-06004-4_11","title":"AURA: A Multi-modal Medical Agent for Understanding, Reasoning and Annotation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Interpretability; Toolbox; Modular design; Segmentation; Set (abstract data type); Medical imaging; Relevance (law); Suite; Annotation","score_opus":0.045509895080306666,"score_gpt":0.29349823960367644,"score_spread":0.24798834452336976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414417426","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.006191688,0.000851273,0.9383856,0.001394703,0.0003608744,0.00021086427,0.0014991926,0.024896856,0.02620895],"genre_scores_gemma":[0.098363064,0.0009553921,0.8623803,0.0009924653,0.00029905915,0.00039056424,0.0024541952,0.0020841856,0.03208066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.00013182456,0.000024988805,0.000074533455,0.00012313722,0.00002165036],"domain_scores_gemma":[0.99937797,0.00036064666,0.00003649196,0.00007780497,0.000069448906,0.00007760319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009865284,0.0007058097,0.00052079593,0.0006973689,0.0005235865,0.0019951959,0.0013645529,0.0015573788,0.018662157],"category_scores_gemma":[0.0020273996,0.00044874699,0.0006698495,0.0003903124,0.00059609156,0.0019859816,0.0022353309,0.0012391969,0.006161366],"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.0011853143,0.00030223263,0.0016466632,0.0011355178,0.0002102059,0.0015911397,0.00119748,0.021102872,0.047205325,0.10235514,0.21836501,0.6037032],"study_design_scores_gemma":[0.00018806485,0.00022886223,0.0012932937,0.00021747344,0.00018302021,0.0030135175,0.0003483209,0.332291,0.032202303,0.14465682,0.48523158,0.00014568743],"about_ca_topic_score_codex":0.00078435795,"about_ca_topic_score_gemma":0.0016217737,"teacher_disagreement_score":0.018662157,"about_ca_system_score_codex":0.00038249552,"about_ca_system_score_gemma":0.00065789936,"threshold_uncertainty_score":0.062431157},"labels":[],"label_agreement":null},{"id":"W4414437473","doi":"10.1007/978-3-032-05134-9_14","title":"Arithmetic Circuit Compilation Using Symbolic Probabilistic Inference and Indicator-Determined Buckets","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Benchmark (surveying); Inference; Probabilistic logic; Bayesian network; Key (lock); Reduction (mathematics); Construct (python library); Variable elimination","score_opus":0.026544622731242473,"score_gpt":0.269126548051733,"score_spread":0.24258192532049055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414437473","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.01588903,0.00020535593,0.9620252,0.0002063676,0.00014182394,0.00007226898,0.00023458825,0.007957613,0.013267586],"genre_scores_gemma":[0.39357936,0.00032011568,0.5939523,0.00022943423,0.0001170345,0.00019316238,0.0008292936,0.002210523,0.0085688485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985257,0.0002594309,0.00010665072,0.00034026217,0.0005685619,0.00019953995],"domain_scores_gemma":[0.9969337,0.0016434775,0.00014916614,0.0007809585,0.0004347474,0.00005801114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080797233,0.0008725247,0.0009388434,0.0015154608,0.0009603369,0.0026031618,0.00276168,0.0006927024,0.0146289915],"category_scores_gemma":[0.006178263,0.0008838232,0.0016169155,0.0018838142,0.0016205929,0.00380257,0.0024269337,0.0020679613,0.002422764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004146328,0.00013942645,0.0009960375,0.00062117033,0.00010520046,0.00019280912,0.00030360452,0.112957895,0.016861463,0.39037234,0.010689057,0.46634638],"study_design_scores_gemma":[0.00008090302,0.00008957659,0.00034125528,0.00014967732,0.00013950901,0.00018820941,0.000083395564,0.46841216,0.032694425,0.4845272,0.013213799,0.00007994111],"about_ca_topic_score_codex":0.0020797579,"about_ca_topic_score_gemma":0.004484117,"teacher_disagreement_score":0.0146289915,"about_ca_system_score_codex":0.0017153927,"about_ca_system_score_gemma":0.002123844,"threshold_uncertainty_score":0.04893881},"labels":[],"label_agreement":null},{"id":"W4414442425","doi":"10.1007/978-3-032-05825-6_3","title":"What Can We Learn from Inter-Annotator Variability in Skin Lesion Segmentation?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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":"Simon Fraser University","funders":"","keywords":"Segmentation; Skin lesion; Leverage (statistics); Pattern recognition (psychology); Feature (linguistics); Lesion; Image segmentation; Association (psychology)","score_opus":0.014808289981324736,"score_gpt":0.2680472393843398,"score_spread":0.25323894940301506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414442425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14591762,0.04800998,0.75588715,0.02070554,0.0033087987,0.00019572403,0.00659586,0.0065873917,0.0127919465],"genre_scores_gemma":[0.6919327,0.014637048,0.25926274,0.0040843883,0.0031832615,0.0003385397,0.012933519,0.0030941183,0.010533701],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98986524,0.004693537,0.000518052,0.002934402,0.0016016877,0.0003871921],"domain_scores_gemma":[0.92755026,0.05778985,0.0026730401,0.0058252118,0.0056169764,0.0005446141],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02446238,0.0017270023,0.002472194,0.0026659563,0.0009555161,0.005126773,0.0027252533,0.003588653,0.0022258826],"category_scores_gemma":[0.087136075,0.0011030886,0.0022489608,0.0031699347,0.0019150393,0.013682173,0.0023562764,0.0053840904,0.0035171357],"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.00060724054,0.00020187383,0.04112004,0.0012428188,0.0015944304,0.00021490894,0.001189947,0.027764862,0.0077323704,0.003961995,0.034139257,0.8802302],"study_design_scores_gemma":[0.000077086595,0.00046547502,0.06934741,0.0012882659,0.0015011838,0.0010847925,0.002209476,0.6623813,0.019499464,0.2007053,0.041076336,0.0003639089],"about_ca_topic_score_codex":0.004107278,"about_ca_topic_score_gemma":0.0080093,"teacher_disagreement_score":0.9755376,"about_ca_system_score_codex":0.0011998026,"about_ca_system_score_gemma":0.0011803454,"threshold_uncertainty_score":0.12937099},"labels":[],"label_agreement":null},{"id":"W4414449407","doi":"10.1007/978-3-032-05825-6_1","title":"LesionGen: A Concept-Guided Diffusion Model for Dermatology Image Synthesis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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 Toronto; University of British Columbia; University of Victoria","funders":"","keywords":"Probabilistic logic; Image (mathematics); Skin lesion; Annotation; Deep learning; Code (set theory); Pattern recognition (psychology)","score_opus":0.022337215498309568,"score_gpt":0.2696632690694883,"score_spread":0.2473260535711787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414449407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040785177,0.00020834705,0.99382764,0.00008207999,0.0000443355,0.000024464758,0.00007412524,0.00057770184,0.0010827397],"genre_scores_gemma":[0.35338104,0.0009489969,0.62601143,0.00027730817,0.0001132027,0.00018415366,0.00043413698,0.00055455527,0.018095255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999131,0.000019399546,0.0000036102251,0.000023292956,0.000029783963,0.000010830072],"domain_scores_gemma":[0.9998591,0.00006628862,0.00001163025,0.000015031168,0.000035444573,0.000012509379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033518168,0.00046009818,0.00049484655,0.00030973402,0.00017013436,0.00058478507,0.0009099928,0.0009270369,0.0029143223],"category_scores_gemma":[0.0006222038,0.0002892811,0.00061062374,0.00030914694,0.00026634047,0.00053299236,0.0006080742,0.00080001,0.0009362404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020045938,0.00007617067,0.00030229054,0.00014602629,0.000062504216,0.00009367544,0.00006521638,0.72049034,0.05025608,0.023057505,0.0042040898,0.20104557],"study_design_scores_gemma":[0.000003724078,0.000010460684,0.000030234947,0.0000021618978,0.0000038604444,0.000015977128,0.0000014488932,0.99569416,0.0019505955,0.00145248,0.0008310489,0.0000038260396],"about_ca_topic_score_codex":0.004076955,"about_ca_topic_score_gemma":0.0038137096,"teacher_disagreement_score":0.004076955,"about_ca_system_score_codex":0.0005755523,"about_ca_system_score_gemma":0.0005211165,"threshold_uncertainty_score":0.009749353},"labels":[],"label_agreement":null},{"id":"W4414453679","doi":"10.1007/978-3-032-05228-5_6","title":"Prefix-Free Parsing for Merging Big BWTs","year":2025,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Dalhousie University","funders":"","keywords":"Parsing; Footprint; Memory footprint; Big data; Word (group theory)","score_opus":0.01648811670444234,"score_gpt":0.27417186861625253,"score_spread":0.2576837519118102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414453679","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.023398284,0.00076163583,0.94162166,0.00038070846,0.00035432162,0.00019603714,0.0022398608,0.0214681,0.009579351],"genre_scores_gemma":[0.20542094,0.0004965876,0.7630963,0.0003984758,0.00018089799,0.00029600598,0.009658618,0.009053258,0.011398974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971507,0.0005138124,0.0004157281,0.00065457314,0.0009031192,0.0003620031],"domain_scores_gemma":[0.99081504,0.0036964477,0.00030695577,0.0038055945,0.0011851249,0.00019072864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021386398,0.0014053074,0.0015938529,0.002878946,0.0017696341,0.0034387999,0.0030970767,0.002252637,0.021279525],"category_scores_gemma":[0.011127263,0.0017166573,0.0016976236,0.005992792,0.0018557125,0.008481305,0.0056044664,0.0026900736,0.0075888103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014214457,0.0002788119,0.002257753,0.0011852066,0.0002464829,0.001325304,0.0013529042,0.02905958,0.045631137,0.15292038,0.048314974,0.716006],"study_design_scores_gemma":[0.0001863789,0.0002878432,0.0012294558,0.0003297848,0.0003209439,0.0009017316,0.0008483661,0.24935701,0.111507416,0.53216815,0.10262924,0.00023372962],"about_ca_topic_score_codex":0.0024856983,"about_ca_topic_score_gemma":0.004601342,"teacher_disagreement_score":0.021279525,"about_ca_system_score_codex":0.0010077069,"about_ca_system_score_gemma":0.0022441575,"threshold_uncertainty_score":0.07118708},"labels":[],"label_agreement":null},{"id":"W4414453687","doi":"10.1007/978-3-032-05228-5_2","title":"KeBaB: k-mer Based Breaking for Finding Long MEMs","year":2025,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"Dalhousie University","funders":"","keywords":"Substring; Microelectromechanical systems; Bloom filter; Filter (signal processing); Sequence (biology); Matching (statistics)","score_opus":0.016424890271891354,"score_gpt":0.2892989182554494,"score_spread":0.27287402798355803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414453687","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.034297787,0.00089631847,0.9152046,0.0004646883,0.0007447758,0.00024313756,0.001980647,0.037028268,0.009139851],"genre_scores_gemma":[0.20811726,0.00031755405,0.7607987,0.0005129448,0.00015032783,0.00037417255,0.004885551,0.0043550213,0.020488562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998792,0.00011351194,0.00007649769,0.00022215449,0.000628418,0.0001674711],"domain_scores_gemma":[0.9980563,0.00044101043,0.00018535262,0.0008240133,0.00037544844,0.00011791014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076281274,0.0017773279,0.0017226426,0.002055792,0.0018834531,0.0018478552,0.0025992116,0.0022295935,0.032637764],"category_scores_gemma":[0.003999049,0.0009209057,0.0010752968,0.0020601528,0.0007516354,0.0026587965,0.0033464215,0.0022997383,0.014322092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017164518,0.00026258934,0.002996396,0.0007578695,0.00026010218,0.00037638316,0.0003338648,0.012554401,0.13067235,0.020082014,0.07681213,0.75317544],"study_design_scores_gemma":[0.0004116114,0.0010559997,0.0041116513,0.0002442965,0.0002131235,0.001316433,0.0008387444,0.5435933,0.21564767,0.12121551,0.111025594,0.00032599884],"about_ca_topic_score_codex":0.0009566429,"about_ca_topic_score_gemma":0.0025295937,"teacher_disagreement_score":0.032637764,"about_ca_system_score_codex":0.0005921817,"about_ca_system_score_gemma":0.0007173028,"threshold_uncertainty_score":0.109184206},"labels":[],"label_agreement":null},{"id":"W4414454332","doi":"10.1007/978-3-032-05228-5_15","title":"Efficient Computation of Closed Substrings","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"","keywords":"Substring; Suffix array; Suffix; Compressed suffix array; Fibonacci number; String (physics); Prefix; Simple (philosophy); Computation","score_opus":0.01179840861047333,"score_gpt":0.24627157148211692,"score_spread":0.2344731628716436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414454332","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.08503591,0.0022676382,0.8648038,0.00052852463,0.00060923555,0.0002726297,0.0024735346,0.009548411,0.03446035],"genre_scores_gemma":[0.20998481,0.00099132,0.7473895,0.00023003436,0.00027934054,0.00023382361,0.006959662,0.001641348,0.0322902],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989767,0.0000837157,0.00009230286,0.0002269653,0.0005020136,0.00011830657],"domain_scores_gemma":[0.99758375,0.0010487225,0.00011676222,0.00063651375,0.000516955,0.0000972166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047782724,0.0010987154,0.0015921298,0.002411481,0.0011207733,0.002766046,0.0022934864,0.0009495323,0.01914638],"category_scores_gemma":[0.0043172413,0.000606499,0.0011350088,0.0040898775,0.0009758241,0.004636689,0.0031718444,0.0012120953,0.00692582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049407134,0.00012584751,0.00091656967,0.0006763835,0.000063649364,0.00035150218,0.0004232001,0.0092900265,0.030508634,0.10161014,0.025814332,0.8297257],"study_design_scores_gemma":[0.00017082234,0.00040042636,0.001647487,0.0002833751,0.00017154441,0.0014139047,0.0007096567,0.2739376,0.08865682,0.5331113,0.09940189,0.00009516032],"about_ca_topic_score_codex":0.0009017448,"about_ca_topic_score_gemma":0.0019154222,"teacher_disagreement_score":0.01914638,"about_ca_system_score_codex":0.0009052563,"about_ca_system_score_gemma":0.0009574444,"threshold_uncertainty_score":0.06405103},"labels":[],"label_agreement":null},{"id":"W4414471550","doi":"10.1007/978-3-032-05291-9_15","title":"Learning with Hypothesis Formation and Curiosity: An Actors Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Psychological and Educational Research Studies","field":"Psychology","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 Saskatchewan","funders":"","keywords":"Connectionism; Context (archaeology); Statement (logic); sort; Sentence; Multitude; Instinct; Process (computing)","score_opus":0.0605902831072922,"score_gpt":0.3299134650368387,"score_spread":0.2693231819295465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414471550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019587401,0.0006068707,0.86487037,0.005317808,0.00016283979,0.00016947166,0.000102953294,0.000407759,0.108774476],"genre_scores_gemma":[0.4793413,0.00088332116,0.47913706,0.00071987667,0.00026787646,0.00065160845,0.00037229323,0.00061497703,0.03801172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330467,0.005018273,0.00019779177,0.00065392937,0.000614611,0.00021076019],"domain_scores_gemma":[0.96291244,0.03288124,0.00080138526,0.0021980796,0.0005502378,0.00065660215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083310455,0.0011811137,0.0007778121,0.0016645676,0.0014309918,0.0057333717,0.0030486393,0.002164563,0.026042592],"category_scores_gemma":[0.0231461,0.001014816,0.0020549186,0.0011786681,0.006716016,0.011534944,0.0062054666,0.0034821767,0.0026085058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057816553,0.00011710694,0.0006574766,0.00014106785,0.0000511376,0.0001513281,0.0023045961,0.0051726825,0.0005692993,0.94533426,0.001942293,0.043500997],"study_design_scores_gemma":[0.000018934637,0.000028024977,0.00011564709,0.000046823025,0.000019968586,0.000059055823,0.00039328594,0.015267391,0.0008530775,0.9746314,0.008556952,0.000009497582],"about_ca_topic_score_codex":0.00041597072,"about_ca_topic_score_gemma":0.00048087325,"teacher_disagreement_score":0.026042592,"about_ca_system_score_codex":0.002049448,"about_ca_system_score_gemma":0.0018274566,"threshold_uncertainty_score":0.08712113},"labels":[],"label_agreement":null},{"id":"W4414478100","doi":"10.1007/978-3-032-05472-2_27","title":"Pixel Perfect MegaMed: A Megapixel-Scale Vision-Language Foundation Model for Generating High Resolution Medical Images","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Pixel; Encoder; Generative grammar; Context (archaeology); Key (lock); Terminology; Transformer; Image (mathematics)","score_opus":0.011207072310807793,"score_gpt":0.2765376953058719,"score_spread":0.2653306229950641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414478100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021526206,0.00010476998,0.9894274,0.0000891349,0.00003591665,0.000049944818,0.00042676902,0.0061522294,0.0015611501],"genre_scores_gemma":[0.09693663,0.00028804113,0.89130557,0.00024960973,0.00004883373,0.00022266946,0.0019796607,0.0020350572,0.0069339015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997223,0.00004083556,0.000014430933,0.00006350246,0.00013141338,0.000027434293],"domain_scores_gemma":[0.9995394,0.00016476282,0.000033682772,0.00010018878,0.00012915855,0.000032768392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007289488,0.0007233108,0.00060464913,0.0007579911,0.00034478004,0.0012053634,0.0029659152,0.0011940525,0.009513774],"category_scores_gemma":[0.0019245149,0.00071718177,0.0014178563,0.0006412306,0.00044179987,0.0014374699,0.001133408,0.0014166847,0.003357815],"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.0004564972,0.00015589039,0.00093723653,0.00035253543,0.00015060701,0.00029509646,0.00013597452,0.36020765,0.02941503,0.057325304,0.03813253,0.5124357],"study_design_scores_gemma":[0.000011424079,0.000017257578,0.00009635323,0.000010606818,0.00000938587,0.000058296846,0.000005148912,0.9811375,0.005545832,0.008309131,0.004790301,0.000008838323],"about_ca_topic_score_codex":0.0059285676,"about_ca_topic_score_gemma":0.010463026,"teacher_disagreement_score":0.009513774,"about_ca_system_score_codex":0.000866101,"about_ca_system_score_gemma":0.0010899542,"threshold_uncertainty_score":0.031826735},"labels":[],"label_agreement":null},{"id":"W4414481135","doi":"10.1007/978-3-032-06326-7_7","title":"Resource Allocation in Multi-Fog/Cloud Systems Using a Hybrid Genetic Algorithm-Reinforcement Learning Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Reinforcement learning; Resource allocation; Benchmark (surveying); Cloud computing; Convergence (economics); Node (physics)","score_opus":0.02637634547610194,"score_gpt":0.2477536519479041,"score_spread":0.22137730647180218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414481135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048994694,0.0005403779,0.9434859,0.00027399336,0.000095687865,0.00007996538,0.000021587284,0.00024372566,0.0062639643],"genre_scores_gemma":[0.9321937,0.00017351162,0.06484844,0.00010776058,0.00004033545,0.000080590275,0.000020585108,0.000030609186,0.0025045054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996965,0.000092108465,0.000011666602,0.00005218312,0.00007020834,0.00007736718],"domain_scores_gemma":[0.9995054,0.0002927233,0.000053720833,0.000017419474,0.000093539464,0.000037188205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007879666,0.00057230185,0.0010963264,0.00039287703,0.00052387704,0.0010356643,0.0012739367,0.0010982235,0.0014097448],"category_scores_gemma":[0.0010301503,0.0003953584,0.0006028331,0.0004751314,0.00064741616,0.00058355066,0.0007059954,0.0008019915,0.00013065663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023221615,0.000027790358,0.00014266293,0.000013567791,0.000018570421,0.000029524537,0.000011894911,0.9878177,0.00059183734,0.0012913663,0.00020467097,0.009827277],"study_design_scores_gemma":[0.000002902982,0.0000073922265,0.000024515846,0.0000011681075,0.000002395994,0.0000032100065,0.0000021698957,0.99953866,0.00005772551,0.00032241165,0.000036340592,0.0000011090999],"about_ca_topic_score_codex":0.015159278,"about_ca_topic_score_gemma":0.010732332,"teacher_disagreement_score":0.015159278,"about_ca_system_score_codex":0.001059804,"about_ca_system_score_gemma":0.0012916625,"threshold_uncertainty_score":0.030142069},"labels":[],"label_agreement":null},{"id":"W4414486758","doi":"10.1007/978-3-032-05559-0_29","title":"Bridging the Gap: A Community Driven and AI-Enabled Approach to Early Breast Cancer Detection in Black African Women","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","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; Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Breast cancer; Breast ultrasound; Breast cancer screening; Black women; Incidence (geometry); Black african; Breast imaging; Mammography","score_opus":0.014956808640933447,"score_gpt":0.23656427058192275,"score_spread":0.2216074619409893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414486758","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.625642,0.007507144,0.06974363,0.15635325,0.0014914718,0.0014073043,0.00051637396,0.00048989156,0.13684888],"genre_scores_gemma":[0.91708386,0.002853331,0.05053829,0.006424012,0.0002835175,0.000602735,0.00020864538,0.00004921301,0.021956328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989667,0.0006024642,0.000021481186,0.000087678796,0.00016272468,0.00015910153],"domain_scores_gemma":[0.99821776,0.00092472916,0.00014296475,0.000051310188,0.00022548811,0.00043774798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028837796,0.00027656683,0.00021540755,0.0011886412,0.0032986798,0.0019508564,0.0015437242,0.0011651508,0.005204085],"category_scores_gemma":[0.0067315823,0.00018921123,0.0003068928,0.0008003825,0.0008506653,0.0021030637,0.0034544426,0.0015196841,0.0006076594],"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.0002578916,0.002645786,0.05351468,0.0005648923,0.00007057596,0.0011068359,0.036992352,0.0013107075,0.0028830683,0.03405172,0.038999125,0.8276023],"study_design_scores_gemma":[0.00032362688,0.0027058495,0.14379886,0.0033155668,0.00038800976,0.003612783,0.27871808,0.04239215,0.008476073,0.19205229,0.32399702,0.00021967488],"about_ca_topic_score_codex":0.014497611,"about_ca_topic_score_gemma":0.035542067,"teacher_disagreement_score":0.014497611,"about_ca_system_score_codex":0.0014555438,"about_ca_system_score_gemma":0.007087151,"threshold_uncertainty_score":0.028826416},"labels":[],"label_agreement":null},{"id":"W4414486781","doi":"10.1007/978-3-032-05559-0_10","title":"Breast Cancer Detection from Multi-view Screening Mammograms with Visual Prompt Tuning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Robustness (evolution); Breast cancer; Mammography; Scalability; Feature (linguistics); Medical imaging; Data set; Pattern recognition (psychology)","score_opus":0.01574486416068844,"score_gpt":0.2615335562261875,"score_spread":0.24578869206549908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414486781","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.06374296,0.001957893,0.91505986,0.00025831265,0.00017695082,0.00014061651,0.0008872367,0.011202322,0.006573825],"genre_scores_gemma":[0.45477527,0.0009638904,0.5342535,0.0003032964,0.00011227747,0.00012541977,0.0011492466,0.00077235507,0.007544783],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998067,0.000028288487,0.000011825167,0.000050545867,0.000074003925,0.000028716215],"domain_scores_gemma":[0.99955124,0.00021425699,0.000028775265,0.00006560319,0.00010850314,0.00003167212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037970007,0.00047318632,0.000542078,0.00075681385,0.00014363314,0.00061464915,0.0005043148,0.00066986197,0.006220034],"category_scores_gemma":[0.001758946,0.00032424758,0.0003812999,0.0005166341,0.00010042611,0.00043519662,0.00081616396,0.00031867938,0.0016961261],"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.00066437543,0.000093214156,0.0011682982,0.00016531943,0.000046155226,0.00011093837,0.000032193588,0.011041691,0.17906873,0.00037990249,0.0043477,0.8028816],"study_design_scores_gemma":[0.00013122112,0.00048730202,0.023124805,0.00008595283,0.00015621402,0.0016385928,0.00011962892,0.82230043,0.13601592,0.003751903,0.012117526,0.0000705335],"about_ca_topic_score_codex":0.001316119,"about_ca_topic_score_gemma":0.0025093297,"teacher_disagreement_score":0.006220034,"about_ca_system_score_codex":0.0002083502,"about_ca_system_score_gemma":0.00026720882,"threshold_uncertainty_score":0.0208081},"labels":[],"label_agreement":null},{"id":"W4414530319","doi":"10.1007/978-3-032-06329-8_19","title":"HiProtoNet: Hyperbolic Hierarchy-Aware Part Prototypes for Aortic Stenosis Severity Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Hyperboloid; Feature (linguistics); Stenosis; Motion (physics); Interpretability; Aortic valve; Artificial neural network; Range (aeronautics)","score_opus":0.027983767205661564,"score_gpt":0.3270460892352397,"score_spread":0.29906232202957816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414530319","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.024714122,0.0021720808,0.9127961,0.00029760812,0.00056820665,0.00047081822,0.0055474755,0.049178388,0.0042552897],"genre_scores_gemma":[0.16125643,0.00096034835,0.81515735,0.0003552688,0.00016098453,0.00046949065,0.011093752,0.0022742222,0.00827221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991553,0.000099681,0.000055719967,0.00028426546,0.000312056,0.00009290511],"domain_scores_gemma":[0.99919564,0.0003085606,0.000045881767,0.00018561892,0.00019017376,0.00007410166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011023611,0.0013345547,0.0014827691,0.0016566268,0.0004977709,0.0018275663,0.003239247,0.0014638612,0.011196515],"category_scores_gemma":[0.0029907166,0.0007669323,0.0015728237,0.0014110215,0.00038339812,0.0015379925,0.0019847504,0.0014415907,0.005556961],"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.00066448504,0.00012367354,0.0017364041,0.00031387032,0.00015396911,0.00017615547,0.00014790666,0.017000796,0.011419133,0.0023589928,0.04227508,0.92362946],"study_design_scores_gemma":[0.00017885368,0.00040071466,0.003491471,0.00019349708,0.00016672316,0.0008074805,0.00016257548,0.92204744,0.02341101,0.013802143,0.035239644,0.00009843939],"about_ca_topic_score_codex":0.006126615,"about_ca_topic_score_gemma":0.008113665,"teacher_disagreement_score":0.011196515,"about_ca_system_score_codex":0.00060422864,"about_ca_system_score_gemma":0.0009516974,"threshold_uncertainty_score":0.037456095},"labels":[],"label_agreement":null},{"id":"W4414531819","doi":"10.1007/978-3-032-06167-6_13","title":"Examining the Impact of Traffic on Shot Attempts in Ice Hockey","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Performance and Training","field":"Medicine","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":"Shot (pellet); Ice hockey; Front (military); League; Poison control; Traffic speed","score_opus":0.04644302757105155,"score_gpt":0.31062487449270226,"score_spread":0.2641818469216507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414531819","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.9938328,0.00018655219,0.00010623131,0.0000662334,0.00003040375,0.00001644043,0.0003645021,0.000007912239,0.0053889034],"genre_scores_gemma":[0.99295545,0.00030114842,0.00018649116,0.000030273723,0.000022252343,0.000032745436,0.00069036585,0.000015022238,0.0057662684],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99960774,0.00011920572,0.00001893055,0.0000473796,0.000118181306,0.00008858904],"domain_scores_gemma":[0.99677235,0.0021020751,0.00029804668,0.00006656088,0.00033071308,0.0004303065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263822,0.0003917291,0.00028670207,0.00060325325,0.00057810306,0.0009784218,0.00071733765,0.0005314383,0.0086244065],"category_scores_gemma":[0.005372303,0.00025309605,0.00039611536,0.0005583088,0.00028029195,0.00042307092,0.00062491203,0.0007097823,0.0015730844],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048065106,0.0034766158,0.905336,0.00023631864,0.00062420534,0.0006722748,0.0019512362,0.0050867824,0.005007351,0.0007741064,0.003726268,0.06830234],"study_design_scores_gemma":[0.0000129709115,0.0010262994,0.9941784,0.000050157654,0.00009424007,0.00007537308,0.002224803,0.0010686192,0.0003631415,0.00020505632,0.0006886376,0.000012268006],"about_ca_topic_score_codex":0.020921621,"about_ca_topic_score_gemma":0.04176647,"teacher_disagreement_score":0.020921621,"about_ca_system_score_codex":0.0007137937,"about_ca_system_score_gemma":0.00072407426,"threshold_uncertainty_score":0.04159969},"labels":[],"label_agreement":null},{"id":"W4414532211","doi":"10.1007/978-3-032-06167-6_15","title":"A Bayesian Dual-Skill Framework for Roster-Based Cycling Race Outcome Prediction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Cycling; Ranking (information retrieval); Race (biology); Bayesian probability; Metric (unit); Outcome (game theory); Bayesian inference","score_opus":0.027849585760044714,"score_gpt":0.2573566145685285,"score_spread":0.22950702880848378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414532211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019266618,0.0005968224,0.97556067,0.00068745215,0.000076809,0.000055628025,0.00053215073,0.00042463897,0.0027991864],"genre_scores_gemma":[0.75560355,0.0016518531,0.2120953,0.0005738389,0.0005813478,0.00041160994,0.0030453345,0.00026907062,0.025768066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990676,0.00031161233,0.00004612331,0.00026452224,0.00013132668,0.00017877402],"domain_scores_gemma":[0.9964044,0.0025533696,0.00023021511,0.00020017271,0.0004146564,0.00019717724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043174257,0.0009290702,0.0031632052,0.0012783215,0.00079223706,0.0021370933,0.0047315834,0.0027900233,0.008086655],"category_scores_gemma":[0.00965774,0.0013990646,0.0014760828,0.0017617859,0.0012882641,0.0026024773,0.002443975,0.0027093596,0.001581037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020993628,0.00016032672,0.0025884083,0.00008145242,0.00014042157,0.00010757853,0.000106008294,0.82683384,0.00057412026,0.09491112,0.004935183,0.06935161],"study_design_scores_gemma":[0.00000803284,0.000009073097,0.00019269164,0.000008842944,0.00001081802,0.0000071749196,0.000004583321,0.98075956,0.00004311941,0.01866031,0.00028825708,0.00000747637],"about_ca_topic_score_codex":0.02747631,"about_ca_topic_score_gemma":0.027025534,"teacher_disagreement_score":0.02747631,"about_ca_system_score_codex":0.0015138643,"about_ca_system_score_gemma":0.002487186,"threshold_uncertainty_score":0.054632783},"labels":[],"label_agreement":null},{"id":"W4414544356","doi":"10.1007/978-3-032-06096-9_15","title":"P2NIA: Privacy-Preserving Non-iterative Auditing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Audit; Scheme (mathematics); Legislation; Work (physics); Compliance (psychology); Subject (documents)","score_opus":0.02002143444592197,"score_gpt":0.26715557253529154,"score_spread":0.24713413808936957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414544356","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.0045400714,0.00032198438,0.9850793,0.000266135,0.00012507886,0.00016796471,0.00022847576,0.0033903585,0.005880583],"genre_scores_gemma":[0.39386672,0.00075988745,0.58646584,0.00047560842,0.00020554093,0.00055347214,0.0010288167,0.00115503,0.01548905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888849,0.0033258747,0.00073607016,0.0015924223,0.0041019493,0.0013588357],"domain_scores_gemma":[0.9807984,0.0052515203,0.0007989994,0.011414732,0.0013979534,0.00033837618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006277578,0.0012900118,0.001750396,0.0012769446,0.001834066,0.004745927,0.0043086857,0.0017618991,0.0049375333],"category_scores_gemma":[0.017862251,0.001348499,0.0018428944,0.0024347282,0.0032212255,0.009445516,0.009951417,0.0061100237,0.0024705927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010482037,0.00023557214,0.0010283267,0.0006140495,0.00015073555,0.00026901925,0.0005544843,0.051293027,0.00902011,0.5778106,0.020106105,0.33786973],"study_design_scores_gemma":[0.00009856447,0.00011593461,0.00029008026,0.000102731276,0.000061415936,0.000558598,0.00009123446,0.2976814,0.019709127,0.66236335,0.018855838,0.00007175452],"about_ca_topic_score_codex":0.000936886,"about_ca_topic_score_gemma":0.0008311242,"teacher_disagreement_score":0.006277578,"about_ca_system_score_codex":0.0013913136,"about_ca_system_score_gemma":0.004414791,"threshold_uncertainty_score":0.03319937},"labels":[],"label_agreement":null},{"id":"W4414563523","doi":"10.1007/978-3-032-06329-8_23","title":"TREAT-Net: Tabular-Referenced Echocardiography Analysis for Acute Coronary Syndrome Treatment Prediction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","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":"Vancouver General Hospital; Vancouver Coastal Health; University of British Columbia","funders":"","keywords":"Acute coronary syndrome; Coronary angiography; Gold standard (test); Intervention (counseling); Angiography; Diagnostic accuracy","score_opus":0.01340442523442847,"score_gpt":0.26910727569668724,"score_spread":0.25570285046225877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414563523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036950868,0.016007718,0.5642562,0.005850941,0.004464583,0.00054171967,0.16141392,0.09207096,0.118443064],"genre_scores_gemma":[0.19686414,0.00982576,0.60333896,0.0026580945,0.003114116,0.0005500886,0.11206675,0.004886544,0.06669549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997284,0.0000541839,0.000021961217,0.00006063554,0.00011708624,0.000017850956],"domain_scores_gemma":[0.9992028,0.0004967967,0.0000619069,0.00006415225,0.0001143379,0.000060014823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000622216,0.0007558207,0.0004339108,0.0010734925,0.00013992384,0.0013332271,0.0007840254,0.0003900167,0.0355716],"category_scores_gemma":[0.0030016478,0.00019729353,0.0003804441,0.00078185694,0.00011444975,0.00082600804,0.0006718782,0.00053365773,0.021019364],"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.00040036778,0.00008996509,0.0062155197,0.00024617746,0.00006824929,0.00015157327,0.000029556468,0.004178213,0.0025146285,0.0036300495,0.26932833,0.7131474],"study_design_scores_gemma":[0.0003367691,0.0005730414,0.029012028,0.0010068134,0.00032405922,0.0035207088,0.00019009878,0.29581165,0.02060629,0.07301935,0.5754149,0.00018430015],"about_ca_topic_score_codex":0.0009767351,"about_ca_topic_score_gemma":0.0015088057,"teacher_disagreement_score":0.0355716,"about_ca_system_score_codex":0.00020453948,"about_ca_system_score_gemma":0.00044858234,"threshold_uncertainty_score":0.118998885},"labels":[],"label_agreement":null},{"id":"W4414566828","doi":"10.1007/978-3-032-06329-8_1","title":"DualTrack: Sensorless 3D Ultrasound needs Local and Global Context","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","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":"Queen's University","funders":"","keywords":"Encoder; Context (archaeology); Feature (linguistics); Trajectory; Benchmark (surveying); Deep learning; Speckle pattern; Pattern recognition (psychology); Scalability; Scale (ratio)","score_opus":0.008333452803215643,"score_gpt":0.24513079774515845,"score_spread":0.2367973449419428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414566828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029163023,0.0013455555,0.97464675,0.00027025098,0.00035610178,0.000026996411,0.00020681809,0.0018426853,0.01838854],"genre_scores_gemma":[0.1450112,0.004703898,0.7648131,0.00070802175,0.000535013,0.00013303384,0.0009936697,0.0019243467,0.08117765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.000022240716,0.000010111542,0.00007387803,0.00014931348,0.000019957108],"domain_scores_gemma":[0.9997578,0.000084465,0.000011824443,0.00007094774,0.000053477812,0.000021445201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026476037,0.0008813597,0.0007612855,0.0002970211,0.00029384674,0.0019946005,0.0013019695,0.001183888,0.010997948],"category_scores_gemma":[0.00091442367,0.00070854696,0.00047278206,0.00044157822,0.0008561217,0.0025050938,0.002325384,0.0012581025,0.005518423],"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.00030608347,0.00007099128,0.00045649125,0.00057261577,0.00003807271,0.00046015205,0.00032890085,0.025008148,0.12368685,0.13776791,0.026636375,0.68466747],"study_design_scores_gemma":[0.000058349306,0.00032691986,0.0014797231,0.00021335413,0.000075521995,0.0025302758,0.00021694381,0.34636983,0.07770932,0.19107993,0.37979636,0.00014334811],"about_ca_topic_score_codex":0.0005578041,"about_ca_topic_score_gemma":0.0010191969,"teacher_disagreement_score":0.010997948,"about_ca_system_score_codex":0.0001915962,"about_ca_system_score_gemma":0.00029938534,"threshold_uncertainty_score":0.0367918},"labels":[],"label_agreement":null},{"id":"W4414596238","doi":"10.1007/978-3-032-04614-7_24","title":"MATATA: Weakly Supervised End-to-End MAthematical Tool-Augmented Reasoning for Tabular Applications","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Merck Canada Inc. (Canada); University of Toronto","funders":"","keywords":"Planner; Commonsense reasoning; Automated reasoning; Outcome (game theory); Model-based reasoning; Language model; Non-monotonic logic; Reasoning system","score_opus":0.01252736102412455,"score_gpt":0.2740569173297306,"score_spread":0.26152955630560604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414596238","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.011206419,0.00022958044,0.93540823,0.00017572251,0.00009133647,0.00031977362,0.0010133849,0.04810531,0.0034502044],"genre_scores_gemma":[0.13187306,0.000117588315,0.85239106,0.0003081365,0.00003215373,0.00058122433,0.005990885,0.0018471782,0.006858762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987128,0.00037824898,0.000084544736,0.00045494063,0.00027865288,0.00009074444],"domain_scores_gemma":[0.9974343,0.0011720684,0.00014462385,0.0007041762,0.00042281995,0.00012199963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017693444,0.0018874004,0.0007917054,0.0007522018,0.0006648429,0.0017542336,0.0041157007,0.0016349163,0.009270102],"category_scores_gemma":[0.006666967,0.00088654883,0.0017558335,0.00054982206,0.00093859126,0.0028179581,0.003404966,0.0036145481,0.0055982727],"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.0007026993,0.00069438736,0.0027016224,0.0008081693,0.0002569715,0.00033134007,0.0007611491,0.26593047,0.021183893,0.013453281,0.053271774,0.6399042],"study_design_scores_gemma":[0.000044672925,0.00007619693,0.00019152308,0.000026983993,0.000020272853,0.000042357435,0.00005949654,0.9699424,0.008401887,0.012677316,0.00850048,0.000016357288],"about_ca_topic_score_codex":0.0056064995,"about_ca_topic_score_gemma":0.013387539,"teacher_disagreement_score":0.009270102,"about_ca_system_score_codex":0.0011147461,"about_ca_system_score_gemma":0.0025816222,"threshold_uncertainty_score":0.031011581},"labels":[],"label_agreement":null},{"id":"W4414601609","doi":"10.1007/978-3-032-05981-9_14","title":"Improving Discriminator Guidance in Diffusion Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Statistical Methods and Inference","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Discriminator; Divergence (linguistics); Diffusion; Training set; Measure (data warehouse); Noise (video)","score_opus":0.05510711883172569,"score_gpt":0.329495891471721,"score_spread":0.2743887726399953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414601609","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.012177368,0.0012708848,0.97897524,0.0008311524,0.00016991161,0.00003002071,0.00013124017,0.0016383345,0.004775705],"genre_scores_gemma":[0.3732791,0.0018600974,0.5920998,0.0010208223,0.0004598241,0.0001584441,0.00077576714,0.002169274,0.028176824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852186,0.0007081798,0.000057148165,0.00025436014,0.00031418455,0.00014430295],"domain_scores_gemma":[0.9878634,0.009654153,0.0003972317,0.0009998515,0.00069190195,0.00039357884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031190903,0.0016549093,0.0024727208,0.0012288298,0.000974132,0.0020130763,0.0026186511,0.004019644,0.006555741],"category_scores_gemma":[0.02360169,0.0013260015,0.00091590616,0.0013672613,0.0017505392,0.0040861424,0.0037442073,0.005738868,0.002311513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004439908,0.00017158236,0.0012489255,0.00034926794,0.00011791475,0.00017548473,0.0003409316,0.5037603,0.0064442693,0.18470328,0.020853903,0.2813902],"study_design_scores_gemma":[0.000022819951,0.000026942427,0.00007403196,0.000027265007,0.00001321191,0.000041638294,0.0000111112295,0.9314489,0.001084536,0.06526675,0.0019675056,0.000015233014],"about_ca_topic_score_codex":0.00499033,"about_ca_topic_score_gemma":0.0059479782,"teacher_disagreement_score":0.006555741,"about_ca_system_score_codex":0.0014027142,"about_ca_system_score_gemma":0.0015691844,"threshold_uncertainty_score":0.021931112},"labels":[],"label_agreement":null},{"id":"W4414601692","doi":"10.1007/978-3-032-06078-5_8","title":"MalGPT: A Generative Explainable Model for Malware Binaries","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Defence Research and Development Canada; McGill University","funders":"","keywords":"Malware; Generative grammar; Binary number; Architecture; Natural language; Feature (linguistics); Generative model; Transformer","score_opus":0.01956710397601886,"score_gpt":0.2669521346750807,"score_spread":0.24738503069906187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414601692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064418204,0.00013940744,0.981833,0.0004873572,0.00006420425,0.00008015167,0.0011216919,0.0043196296,0.005512696],"genre_scores_gemma":[0.39718944,0.00080209534,0.56647784,0.0006375197,0.00015371977,0.0008318671,0.004119362,0.0043690843,0.025419006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995813,0.00012616116,0.00001917836,0.00010184953,0.00012778693,0.000043792035],"domain_scores_gemma":[0.9986111,0.00094885175,0.000058076672,0.00023861196,0.00010195,0.000041453666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597077,0.0011803511,0.0005371845,0.0010464157,0.00059604127,0.0017240717,0.0024532322,0.0021168767,0.012689318],"category_scores_gemma":[0.0045057633,0.00093229173,0.0023055298,0.0006042626,0.0011967899,0.00309055,0.0020165395,0.0030340364,0.0023601006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009033587,0.000076091026,0.0011590791,0.00021820155,0.00008165292,0.00041276088,0.0005209806,0.5610784,0.0037266253,0.37037504,0.010049451,0.052211367],"study_design_scores_gemma":[0.000013453346,0.000011545312,0.00008325112,0.00001721154,0.000018890221,0.0000701652,0.000013497335,0.84078705,0.001094364,0.1494894,0.008389335,0.000011821548],"about_ca_topic_score_codex":0.0044405647,"about_ca_topic_score_gemma":0.005408008,"teacher_disagreement_score":0.012689318,"about_ca_system_score_codex":0.0010778732,"about_ca_system_score_gemma":0.00094096136,"threshold_uncertainty_score":0.04245001},"labels":[],"label_agreement":null},{"id":"W4414623906","doi":"10.1007/978-3-032-06109-6_11","title":"AdvKT: An Adversarial Multi-step Training Framework for Knowledge Tracing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Huawei Technologies (Canada)","funders":"","keywords":"Discriminator; Tracing; Inference; Adversarial system; Process (computing); Generator (circuit theory); Training (meteorology)","score_opus":0.05706642522385141,"score_gpt":0.31198457307630745,"score_spread":0.25491814785245603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414623906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012597876,0.00017267272,0.99540967,0.00009046924,0.000045046003,0.00002853912,0.000089349865,0.001987976,0.0009164962],"genre_scores_gemma":[0.18519281,0.00043624436,0.7946178,0.00042492093,0.00010275802,0.00026929294,0.0009971791,0.00092714175,0.017031921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993181,0.00021792272,0.000036639052,0.00015197767,0.00020068898,0.00007458794],"domain_scores_gemma":[0.9985286,0.0008397053,0.000053226107,0.00026420457,0.0002389299,0.00007538639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394988,0.0009949853,0.0010626824,0.00073456345,0.00049432256,0.0011387283,0.003539672,0.002356151,0.008636949],"category_scores_gemma":[0.0046790345,0.0006844368,0.000874911,0.0007189127,0.00083109766,0.0019252506,0.0033727153,0.0035915782,0.002854663],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023909922,0.0001208142,0.0003707103,0.00014042598,0.000089706766,0.00008829991,0.00006478008,0.5373752,0.0030640753,0.025663303,0.012535117,0.4202485],"study_design_scores_gemma":[0.0000069798143,0.000013585222,0.000023681732,0.0000075966664,0.0000043627606,0.000014162899,0.0000029427608,0.99136657,0.0008859815,0.006490017,0.001180393,0.0000037393227],"about_ca_topic_score_codex":0.0063297343,"about_ca_topic_score_gemma":0.0084697995,"teacher_disagreement_score":0.008636949,"about_ca_system_score_codex":0.0007773986,"about_ca_system_score_gemma":0.0014253388,"threshold_uncertainty_score":0.02889347},"labels":[],"label_agreement":null},{"id":"W4414639031","doi":"10.1007/978-3-032-01377-4_5","title":"LC/NC Pipeline for Training and Operationalising Segmentation Models in a Data Scarce Domain: De-arraying Tissue MicroArrays","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Pipeline (software); Segmentation; Leverage (statistics); Testbed; Digital subscriber line; Artificial neural network; Domain (mathematical analysis); Subject-matter expert; Architecture","score_opus":0.07074390772321303,"score_gpt":0.3556935927046025,"score_spread":0.28494968498138945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414639031","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.0070661874,0.00006554804,0.9506928,0.00034661588,0.00005507489,0.00011562377,0.0012136992,0.037844785,0.002599785],"genre_scores_gemma":[0.10214184,0.00016428945,0.87984633,0.0006511756,0.000025281684,0.00055999757,0.0064166943,0.005551418,0.0046430165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992798,0.00014188954,0.00005777207,0.00025416803,0.00020766027,0.000058737223],"domain_scores_gemma":[0.997592,0.0011191955,0.00013545204,0.00059477735,0.00047258657,0.000086029446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017186113,0.0011582302,0.00049392646,0.00060836837,0.00048550277,0.001394943,0.0021332328,0.001025354,0.008261711],"category_scores_gemma":[0.0064065373,0.0006874812,0.0011966411,0.0004330897,0.00093447143,0.0014169309,0.0021455542,0.002324686,0.004275122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052967353,0.0002577724,0.0048929527,0.00078008877,0.00015215253,0.0006702728,0.0007905008,0.51653576,0.06578039,0.051815696,0.058616433,0.29917833],"study_design_scores_gemma":[0.000021406975,0.000031123687,0.00032459878,0.000031628228,0.000010506765,0.00009510442,0.00005344611,0.93980664,0.029192997,0.008224936,0.022186125,0.000021479122],"about_ca_topic_score_codex":0.0074894475,"about_ca_topic_score_gemma":0.01171005,"teacher_disagreement_score":0.008261711,"about_ca_system_score_codex":0.0014995608,"about_ca_system_score_gemma":0.0024480182,"threshold_uncertainty_score":0.027638197},"labels":[],"label_agreement":null},{"id":"W4414639538","doi":"10.1007/978-3-662-72116-2_2","title":"Data Assetization Journey: Concepts, Principles, and Illustrations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Big Data Technologies and Applications","field":"Decision 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":"Université TÉLUQ","funders":"","keywords":"Asset (computer security); Obligation; Line (geometry); Transformation (genetics); Corporate governance; Data governance; Data verification; Word (group theory)","score_opus":0.26451014898457226,"score_gpt":0.39850359266860413,"score_spread":0.13399344368403188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414639538","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.0060390523,0.02680886,0.6167691,0.02392577,0.0019841904,0.0002464072,0.0013444661,0.0019123621,0.32096982],"genre_scores_gemma":[0.09749437,0.0493454,0.6102153,0.0036588355,0.0012354107,0.0005670518,0.0022921336,0.0012826317,0.23390885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945515,0.00012067242,0.000040300838,0.00008711666,0.00024340166,0.000053386168],"domain_scores_gemma":[0.9991629,0.00032363736,0.000032142565,0.00016409498,0.00018597553,0.00013127673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012567969,0.00083136215,0.00051245495,0.0019848968,0.0015236319,0.008887599,0.0019892373,0.0017575207,0.015818756],"category_scores_gemma":[0.0029067295,0.0006647013,0.0007834511,0.004732163,0.0029428042,0.013893563,0.0037497075,0.004112024,0.0070285583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016056341,0.000032815777,0.0001682038,0.00015440164,0.0000046462887,0.00009662705,0.0006049853,0.0007715313,0.00048265912,0.8593223,0.04499032,0.093355544],"study_design_scores_gemma":[0.0000034465206,0.000016938502,0.000117543554,0.00022172148,0.000004537622,0.0004551169,0.00050938805,0.0035402605,0.000872729,0.41455632,0.57968736,0.0000146655975],"about_ca_topic_score_codex":0.0017293715,"about_ca_topic_score_gemma":0.0015692613,"teacher_disagreement_score":0.015818756,"about_ca_system_score_codex":0.0019663163,"about_ca_system_score_gemma":0.0021953364,"threshold_uncertainty_score":0.05291897},"labels":[],"label_agreement":null},{"id":"W4414639574","doi":"10.1007/978-3-031-97781-7_7","title":"Perspective-Aware AI in Extended Reality","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Glycemic Index Laboratories","funders":"","keywords":"Identity (music); Embedding; Virtual reality; Augmented reality; Cognition; Multimodal interaction; User interface","score_opus":0.024324202375918914,"score_gpt":0.30926152639432053,"score_spread":0.2849373240184016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414639574","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.010318778,0.0023925868,0.901152,0.0006037128,0.00019702196,0.00002985631,0.00009329052,0.00087426224,0.08433849],"genre_scores_gemma":[0.54005045,0.004070314,0.4081337,0.00032968566,0.0001553955,0.00009351919,0.00038857936,0.00031316912,0.046465147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.00008963198,0.000014745077,0.00007793209,0.000107651045,0.000037936104],"domain_scores_gemma":[0.9996069,0.00020673811,0.000020477792,0.00008273361,0.000049920192,0.00003326734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003640727,0.0005139276,0.00038807036,0.0002690412,0.0003770097,0.0018826276,0.0010812094,0.0006300735,0.0071112206],"category_scores_gemma":[0.0010491837,0.00034916555,0.0006293221,0.0004160604,0.0011444237,0.0027028185,0.0018768733,0.0016281169,0.0012609223],"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.0000889676,0.00004393141,0.00031734494,0.00035664064,0.000058538328,0.0003190758,0.0012104124,0.05761394,0.0130272955,0.73461914,0.0083160605,0.18402857],"study_design_scores_gemma":[0.000022902002,0.000095810465,0.0005342386,0.00013680609,0.00005500652,0.0004839764,0.000582476,0.27157402,0.008627615,0.6067314,0.11110018,0.000055529057],"about_ca_topic_score_codex":0.0014855256,"about_ca_topic_score_gemma":0.00158266,"teacher_disagreement_score":0.0071112206,"about_ca_system_score_codex":0.00043293083,"about_ca_system_score_gemma":0.00029889878,"threshold_uncertainty_score":0.023789406},"labels":[],"label_agreement":null},{"id":"W4414646315","doi":"10.1007/978-3-032-06706-7_14","title":"Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Competitive analysis; Bipartite graph; Vertex (graph theory); Hopcroft–Karp algorithm; Degree (music); Cardinality (data modeling); Online algorithm; Graph","score_opus":0.028306919491313427,"score_gpt":0.2735100315596817,"score_spread":0.24520311206836826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414646315","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.07075316,0.0003847892,0.9101089,0.0008199654,0.00023689937,0.00035931804,0.00051112665,0.0036608488,0.013164893],"genre_scores_gemma":[0.3178569,0.00016968035,0.67089707,0.00024910804,0.00011017392,0.00036496896,0.0008684275,0.00039894498,0.009084714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882907,0.00021014015,0.00007276017,0.00032302362,0.00020925043,0.00035586077],"domain_scores_gemma":[0.99646497,0.0020546485,0.00025157805,0.0006953338,0.0002645855,0.00026883418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016046704,0.0010465767,0.00213194,0.0011716131,0.0017998487,0.002712531,0.0043954425,0.0027803446,0.015929727],"category_scores_gemma":[0.0063931774,0.0007659606,0.001314113,0.002164188,0.0009957283,0.004887638,0.003027288,0.002031511,0.0022631914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024865824,0.0013801403,0.0014285452,0.00065785844,0.00014497808,0.00023388033,0.00048149028,0.29457366,0.009851028,0.107743524,0.023016404,0.55800194],"study_design_scores_gemma":[0.0002513591,0.00016239799,0.00019630099,0.00003525718,0.000040183982,0.0001003452,0.00011939836,0.9071576,0.0024844501,0.086363494,0.0030678762,0.000021257558],"about_ca_topic_score_codex":0.0034060131,"about_ca_topic_score_gemma":0.0040153074,"teacher_disagreement_score":0.015929727,"about_ca_system_score_codex":0.0021518858,"about_ca_system_score_gemma":0.0032564974,"threshold_uncertainty_score":0.053290248},"labels":[],"label_agreement":null},{"id":"W4414654051","doi":"10.1007/978-3-032-06103-4_19","title":"Population-Graph Post-hoc Correction of Survival Predictions for Improved Risk Stratification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Risk stratification; Stratification (seeds); Risk assessment; Binary number; Survival analysis","score_opus":0.009984153178298719,"score_gpt":0.25642268444838023,"score_spread":0.24643853127008153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414654051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054137018,0.00054300175,0.92658085,0.00063222786,0.0010660897,0.00026203055,0.0030026368,0.010946616,0.0028295075],"genre_scores_gemma":[0.50757694,0.00021896945,0.46415102,0.00043477645,0.00054853334,0.00042728093,0.009954581,0.0023749683,0.014312966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981527,0.00087543594,0.000091284644,0.00046800965,0.00024556433,0.00016698924],"domain_scores_gemma":[0.9891775,0.0071956846,0.00027816131,0.0017650776,0.0013480969,0.00023555204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005156819,0.0010509369,0.0013689342,0.0013938978,0.0009610668,0.001264434,0.0021732883,0.001131593,0.016027944],"category_scores_gemma":[0.018208424,0.0004323227,0.0017080846,0.0015937551,0.00055667595,0.00078714185,0.001176027,0.002382678,0.005080613],"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.0013208413,0.0003508456,0.021122111,0.00024605112,0.0011951769,0.00038625454,0.00016614345,0.083528034,0.006305,0.0054510324,0.04640391,0.83352464],"study_design_scores_gemma":[0.0001882945,0.00035225227,0.013355684,0.00004913867,0.00047084872,0.0003200904,0.000114176226,0.9481046,0.008921788,0.018379861,0.009678493,0.00006482464],"about_ca_topic_score_codex":0.0096708825,"about_ca_topic_score_gemma":0.01834765,"teacher_disagreement_score":0.016027944,"about_ca_system_score_codex":0.0006013279,"about_ca_system_score_gemma":0.0019171851,"threshold_uncertainty_score":0.05361885},"labels":[],"label_agreement":null},{"id":"W4414656121","doi":"10.1007/978-3-032-06103-4_1","title":"Robustness Evaluation of Multi-visit Magnetic Resonance Image Reconstruction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Robustness (evolution); Iterative reconstruction; Image quality; Process (computing); Image (mathematics); Magnetic resonance imaging","score_opus":0.02862971287867642,"score_gpt":0.3241029848530109,"score_spread":0.2954732719743345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414656121","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.11509975,0.0025303115,0.87791556,0.0004699017,0.00018324587,0.000074235424,0.00045948857,0.0016037597,0.0016637663],"genre_scores_gemma":[0.75631326,0.0009181688,0.23749371,0.00016766679,0.00017114272,0.00005473432,0.0015885239,0.00050189084,0.002790931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984793,0.0005754268,0.00009253693,0.00030093314,0.0004135393,0.00013830262],"domain_scores_gemma":[0.99392855,0.0039493293,0.00044209635,0.00066094234,0.0008358529,0.00018329672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002945451,0.0010730267,0.0011166959,0.0010807172,0.00030488233,0.0015752022,0.0010066226,0.0020171383,0.0020490882],"category_scores_gemma":[0.011875538,0.00041486847,0.0011554853,0.0005979773,0.00056276866,0.000869046,0.0015968455,0.00079241756,0.0006168202],"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.0048618405,0.00023741032,0.004791735,0.0006868856,0.00079415063,0.00039655666,0.00011312388,0.42981598,0.06646872,0.0031637445,0.003438069,0.48523176],"study_design_scores_gemma":[0.000018980454,0.0002445918,0.002546261,0.000023718398,0.00009180235,0.0003434464,0.000023896422,0.98057884,0.014584944,0.0010280189,0.0004934192,0.000022154325],"about_ca_topic_score_codex":0.0017365606,"about_ca_topic_score_gemma":0.0016724047,"teacher_disagreement_score":0.002945451,"about_ca_system_score_codex":0.00046129024,"about_ca_system_score_gemma":0.00065797276,"threshold_uncertainty_score":0.015577257},"labels":[],"label_agreement":null},{"id":"W4414656727","doi":"10.1007/978-3-032-06103-4_6","title":"Evaluating Deep Learning Based Domain Generalization for Motion Mitigation in Multi-center Brain MRI","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Preprocessor; Motion (physics); Generalization; Deep learning; Noise (video); Pattern recognition (psychology); Domain (mathematical analysis); Functional magnetic resonance imaging; Domain adaptation","score_opus":0.0365740765052622,"score_gpt":0.36451745695875243,"score_spread":0.32794338045349025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414656727","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.5648701,0.008297028,0.41565368,0.00088119606,0.00048535122,0.0002394462,0.0014084555,0.003994199,0.004170476],"genre_scores_gemma":[0.8914401,0.0013986992,0.10044196,0.00025928047,0.00011937172,0.00007187198,0.0023278187,0.0002598424,0.003681116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00016721214,0.000032431013,0.00013848316,0.00009414272,0.000071131406],"domain_scores_gemma":[0.9972223,0.0018842319,0.00016006954,0.0002409806,0.0003489255,0.00014342589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025756327,0.0013804927,0.0008961436,0.000700822,0.00027088512,0.00061804266,0.0009394443,0.0016661959,0.0014741956],"category_scores_gemma":[0.0055149803,0.0003190743,0.00074449886,0.0005421278,0.00045904765,0.0009341425,0.0010717374,0.0011213832,0.00045645644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025954277,0.00050146354,0.0040234807,0.00035063596,0.00047617528,0.00013257349,0.00005151172,0.62370706,0.014669053,0.00084381504,0.0042084004,0.34844038],"study_design_scores_gemma":[0.000029736711,0.0002981803,0.0010522882,0.000020434216,0.00005089931,0.000050553615,0.000022229116,0.99285406,0.0047394717,0.00062622124,0.00024685927,0.000009153435],"about_ca_topic_score_codex":0.007835819,"about_ca_topic_score_gemma":0.007894564,"teacher_disagreement_score":0.007835819,"about_ca_system_score_codex":0.00066126685,"about_ca_system_score_gemma":0.0009240373,"threshold_uncertainty_score":0.015580416},"labels":[],"label_agreement":null},{"id":"W4414666383","doi":"10.1007/978-3-032-06524-7_14","title":"Environmental Data Imputation via Temporal VAE with Learned Missing Value Representations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","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":"Marriott International (Canada)","funders":"","keywords":"Missing data; Imputation (statistics); Environmental data; Temporal database; Autoencoder; Time series; Process (computing)","score_opus":0.02448659154465675,"score_gpt":0.2625055085858921,"score_spread":0.23801891704123537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414666383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034841478,0.0002460881,0.9947594,0.00019005682,0.00008614212,0.00001622912,0.00022091996,0.00047979914,0.0005172504],"genre_scores_gemma":[0.28945062,0.00057153485,0.6969989,0.0004519887,0.00041133873,0.00024366539,0.003355362,0.00031611577,0.008200455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988502,0.00043597943,0.000072729104,0.00037363492,0.00014853867,0.00011886573],"domain_scores_gemma":[0.9945056,0.0037114634,0.00026561855,0.0007684315,0.0006457025,0.00010325768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004052038,0.0008132701,0.0017628964,0.00095000427,0.0006360024,0.0016594653,0.0033740394,0.0024857575,0.004660787],"category_scores_gemma":[0.013567727,0.001074813,0.002349574,0.0023270329,0.0008798774,0.0029208728,0.0019343097,0.0035179865,0.0018914542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023149648,0.00013613829,0.0021127,0.00011184001,0.0002670326,0.0001629816,0.0001046933,0.69166654,0.0008860268,0.024742419,0.007714824,0.27186322],"study_design_scores_gemma":[0.000006579813,0.000010177077,0.000136563,0.000010588845,0.000010077464,0.000027020153,0.0000073580372,0.9859153,0.00023945232,0.013012969,0.00061643525,0.0000073981014],"about_ca_topic_score_codex":0.0052459612,"about_ca_topic_score_gemma":0.006155488,"teacher_disagreement_score":0.0052459612,"about_ca_system_score_codex":0.0006002262,"about_ca_system_score_gemma":0.001416636,"threshold_uncertainty_score":0.02142948},"labels":[],"label_agreement":null},{"id":"W4414681735","doi":"10.1007/978-3-032-02725-2_10","title":"Advancing Imminent Fracture Risk Prediction: Integrating Machine Learning with Enhanced Feature Engineering","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Guelph","funders":"","keywords":"Lift (data mining); Feature engineering; Upsampling; Risk assessment; Ensemble learning; Deep learning; Missing data","score_opus":0.003651834518784236,"score_gpt":0.20123297478912347,"score_spread":0.19758114027033924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414681735","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.032285098,0.0020233374,0.958091,0.00063284737,0.00018513744,0.00003395216,0.00033520002,0.0018659056,0.0045474456],"genre_scores_gemma":[0.58622485,0.0018315366,0.40511626,0.00023244662,0.00054220157,0.00006118469,0.0010443965,0.0002956257,0.0046515116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.000057042707,0.000016234288,0.000078836885,0.00012112089,0.00002803878],"domain_scores_gemma":[0.9987098,0.0007498113,0.000113255424,0.000121962286,0.0002625584,0.00004265165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009030333,0.0007568146,0.001117172,0.0010139897,0.00023518044,0.0013721623,0.001268179,0.0008240945,0.002554997],"category_scores_gemma":[0.004145149,0.00031002946,0.0008126194,0.0008755753,0.00021999532,0.0016727581,0.00101371,0.0011470469,0.0012146848],"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.000099232246,0.00018018093,0.005625877,0.00012484386,0.00009559649,0.00008216668,0.00003681544,0.1977627,0.0050024916,0.0041923197,0.007800447,0.77899736],"study_design_scores_gemma":[0.000005008205,0.00004155305,0.0010003814,0.000013172822,0.000020725596,0.000046895715,0.000009839893,0.9875794,0.0014092759,0.008471585,0.0013924489,0.000009683645],"about_ca_topic_score_codex":0.0027342387,"about_ca_topic_score_gemma":0.0030831369,"teacher_disagreement_score":0.0027342387,"about_ca_system_score_codex":0.00028303938,"about_ca_system_score_gemma":0.000470461,"threshold_uncertainty_score":0.008547246},"labels":[],"label_agreement":null},{"id":"W4414703422","doi":"10.1007/978-3-032-05792-1_18","title":"Symbolic Reduction for Formal Synthesis of Global Lyapunov Functions","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Control and Stability of Dynamical Systems","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":"Lyapunov function; Lyapunov optimization; Polynomial; Lyapunov equation; Lyapunov redesign; Modulo; Leverage (statistics); Lyapunov exponent","score_opus":0.006476536862986377,"score_gpt":0.2066077897150024,"score_spread":0.20013125285201602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414703422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003623968,0.0003196012,0.9806337,0.000101097896,0.00008330619,0.000038718485,0.00008357285,0.00074579084,0.0143702645],"genre_scores_gemma":[0.37727278,0.001002793,0.6007298,0.00018670596,0.00016065923,0.0003805073,0.00068502483,0.00096220203,0.018619513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951804,0.00014561925,0.000031477062,0.0000577426,0.00019940668,0.00004772584],"domain_scores_gemma":[0.9996265,0.00020102717,0.00002196118,0.000081123384,0.000060762493,0.000008616475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052272633,0.0007815296,0.0007027682,0.00072722696,0.00047440297,0.0013823945,0.00087304355,0.0005197226,0.008082839],"category_scores_gemma":[0.0012748896,0.00039779782,0.0009205837,0.00055019977,0.0012455382,0.001008725,0.0010064581,0.0015528293,0.002010654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006146188,0.000048752347,0.000076423305,0.00031614726,0.000031575495,0.00010223993,0.00024915524,0.0841278,0.015667852,0.7591549,0.00361717,0.13654643],"study_design_scores_gemma":[0.000046686273,0.00006513585,0.0000694,0.00009895273,0.000033066364,0.00009352659,0.000075892625,0.29322767,0.016475942,0.65802807,0.03176117,0.000024630388],"about_ca_topic_score_codex":0.00057287083,"about_ca_topic_score_gemma":0.0009911762,"teacher_disagreement_score":0.008082839,"about_ca_system_score_codex":0.00078233954,"about_ca_system_score_gemma":0.00061983394,"threshold_uncertainty_score":0.027039766},"labels":[],"label_agreement":null},{"id":"W4414721029","doi":"10.1007/978-3-032-02725-2_7","title":"Sparse Least Square SVM in Primal via Nesterov Accelerated Alternating Directions Method of Multipliers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","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 Guelph","funders":"","keywords":"Support vector machine; Quadratic programming; Regularization (linguistics); Least squares support vector machine; Lasso (programming language); Least-squares function approximation; Context (archaeology); Lagrange multiplier","score_opus":0.02856076614534515,"score_gpt":0.30910972617141297,"score_spread":0.28054896002606783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414721029","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.002105984,0.00019666899,0.9951885,0.0001021801,0.00010821928,0.00001859956,0.000030256215,0.00024468472,0.0020050053],"genre_scores_gemma":[0.070543066,0.00038401198,0.91659886,0.00013798659,0.00019154782,0.00016205078,0.00021313183,0.0003116862,0.011457675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00010985847,0.000012060249,0.00005007709,0.00010861286,0.000020566595],"domain_scores_gemma":[0.9996018,0.00018375216,0.000027217671,0.000038724127,0.00012138235,0.000027114767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006600995,0.00071618974,0.00082942395,0.0003263045,0.00026964236,0.00092366495,0.00081262825,0.0011863755,0.0060430523],"category_scores_gemma":[0.0021326176,0.00045135603,0.00046196638,0.00043012985,0.000442393,0.0011387976,0.0011367183,0.0021812567,0.0028720635],"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.0002789005,0.00015754212,0.0003685363,0.00051037053,0.00007350639,0.00014659564,0.00015451384,0.31782052,0.01226989,0.114388935,0.028497549,0.5253331],"study_design_scores_gemma":[0.000010386965,0.000031291493,0.00003731992,0.000012203138,0.0000044854023,0.000034476267,0.0000065355575,0.98645186,0.0008378037,0.0093889,0.0031794636,0.000005232621],"about_ca_topic_score_codex":0.0008641741,"about_ca_topic_score_gemma":0.0014947519,"teacher_disagreement_score":0.0060430523,"about_ca_system_score_codex":0.00026257758,"about_ca_system_score_gemma":0.0006680867,"threshold_uncertainty_score":0.020215988},"labels":[],"label_agreement":null},{"id":"W4414730989","doi":"10.1007/978-3-032-02728-3_18","title":"SEF-Net: A Hybrid Deep Learning Architecture for Multi-step Forecasting in Sustainable Energy Markets","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Load and Power Forecasting","field":"Engineering","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 Manitoba","funders":"","keywords":"Deep learning; Convolutional neural network; Energy (signal processing); Architecture; Artificial neural network; Time series; Transformer; Demand forecasting; Sustainable energy","score_opus":0.0120697148881671,"score_gpt":0.21484109084034114,"score_spread":0.20277137595217404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414730989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033448275,0.002098334,0.9456518,0.00078961573,0.00046227782,0.000044237386,0.001310676,0.0062047467,0.009989911],"genre_scores_gemma":[0.5537288,0.0017920522,0.40246093,0.000585526,0.00026409954,0.00014911973,0.0033274156,0.0006342918,0.037057657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999083,0.000015078743,0.0000060010448,0.000025307736,0.000027406917,0.000017943032],"domain_scores_gemma":[0.9998117,0.00007823563,0.000010651421,0.00002407336,0.000058952213,0.000016370952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305763,0.00071873865,0.000529377,0.00042877666,0.00025598885,0.0007933873,0.001349264,0.0010859143,0.0063649546],"category_scores_gemma":[0.0009353439,0.00041108104,0.00046674217,0.00053614913,0.00024140328,0.0016131948,0.0007085402,0.0016416627,0.0017858571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018330089,0.000133235,0.0009896809,0.000074060954,0.00010283444,0.000073939926,0.000027575446,0.5641208,0.0029003532,0.01107242,0.022584502,0.39773726],"study_design_scores_gemma":[0.0000037267614,0.000008876896,0.0000646171,0.0000046091345,0.000004507649,0.0000054807906,0.0000015174676,0.9949151,0.0006033048,0.0032218634,0.0011633314,0.0000030446602],"about_ca_topic_score_codex":0.010205537,"about_ca_topic_score_gemma":0.016356139,"teacher_disagreement_score":0.010205537,"about_ca_system_score_codex":0.00060914987,"about_ca_system_score_gemma":0.0007682197,"threshold_uncertainty_score":0.021292865},"labels":[],"label_agreement":null},{"id":"W4414772389","doi":"10.1007/978-3-032-01570-9_6","title":"On Gottschalk’s Surjunctivity Conjecture for Non-uniform Cellular Automata","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Conjecture; Cellular automaton; Alphabet; Group (periodic table); Invertible matrix; Class (philosophy); Automata theory","score_opus":0.012309646755847278,"score_gpt":0.24145194286283944,"score_spread":0.22914229610699216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414772389","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.30498344,0.005229974,0.20381752,0.007886199,0.0013211011,0.00012640796,0.00068822014,0.000611331,0.47533596],"genre_scores_gemma":[0.92415863,0.0017649281,0.015504795,0.0013450036,0.00045586645,0.00016605337,0.0005528023,0.00029286568,0.05575901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857473,0.00028497167,0.00008375035,0.00047830617,0.0002948603,0.00028335216],"domain_scores_gemma":[0.9963431,0.0023536172,0.00012715717,0.00062524044,0.00041195346,0.00013891667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014032585,0.0007179843,0.0013341493,0.0012893492,0.0035486124,0.004911888,0.0016762281,0.0022048852,0.008870751],"category_scores_gemma":[0.005892923,0.0010448064,0.002120437,0.0017511578,0.0061519016,0.01080574,0.0037496646,0.005380925,0.0013357456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028142063,0.000008916146,0.00012086616,0.000040973337,0.000007211905,0.000062137115,0.00021808445,0.0013208841,0.00024869543,0.99453485,0.0010762031,0.0023331346],"study_design_scores_gemma":[0.000008008251,0.0000052319483,0.000085462496,0.000013153379,0.0000072762714,0.000035493773,0.000055872573,0.001980609,0.0002950145,0.99504626,0.0024605712,0.0000070849774],"about_ca_topic_score_codex":0.0038800086,"about_ca_topic_score_gemma":0.0029176956,"teacher_disagreement_score":0.008870751,"about_ca_system_score_codex":0.0025115926,"about_ca_system_score_gemma":0.00095437566,"threshold_uncertainty_score":0.029675603},"labels":[],"label_agreement":null},{"id":"W4414772453","doi":"10.1007/978-3-032-01570-9_7","title":"Ternary Cellular Automata Induced by Semigroups of Order 3 are Solvable","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Commutative property; Cellular automaton; Order (exchange); Set (abstract data type); Function (biology); Automaton; State (computer science); Semigroup; Binary number; Ternary operation","score_opus":0.011213787947624647,"score_gpt":0.22940814145490554,"score_spread":0.2181943535072809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414772453","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.5056438,0.0007360697,0.2814867,0.0010303161,0.0006316461,0.00031108074,0.0018082886,0.0019572338,0.20639494],"genre_scores_gemma":[0.91589266,0.0004300526,0.025899839,0.00026116517,0.00018252117,0.0003959209,0.0011352528,0.00030606682,0.055496424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999398,0.000091941874,0.00005473032,0.000117477866,0.00016289807,0.00017502514],"domain_scores_gemma":[0.99820983,0.0009302221,0.0002755228,0.00015961722,0.00027507226,0.00014968262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034892693,0.0007339127,0.001071001,0.0009106224,0.0017629747,0.0038402337,0.0006704668,0.0012144077,0.01509636],"category_scores_gemma":[0.0020957792,0.0005216646,0.0015719628,0.00095736556,0.0015973145,0.0021954544,0.0014021551,0.0017864022,0.0024875351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012510818,0.00006841471,0.00022729216,0.0001238176,0.00001825582,0.00023968267,0.00068919675,0.0035166,0.00817547,0.9724472,0.002813159,0.011555641],"study_design_scores_gemma":[0.00008231466,0.00004859753,0.00022864334,0.000023008053,0.000017589698,0.00021968542,0.00029667196,0.018563664,0.008832515,0.9639047,0.0077510206,0.000031586456],"about_ca_topic_score_codex":0.0015874926,"about_ca_topic_score_gemma":0.00171886,"teacher_disagreement_score":0.01509636,"about_ca_system_score_codex":0.0012528122,"about_ca_system_score_gemma":0.0014433998,"threshold_uncertainty_score":0.05050236},"labels":[],"label_agreement":null},{"id":"W4414808937","doi":"10.1007/978-3-032-06774-6_15","title":"End-to-End Learning of Multi-organ Implicit Surfaces from 3D Medical Imaging Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","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":"McGill University; McGill University Health Centre","funders":"","keywords":"Interpolation (computer graphics); Encoder; Domain (mathematical analysis); Object (grammar); Representation (politics); Surface (topology); Medical imaging; Surface reconstruction","score_opus":0.01645627599137976,"score_gpt":0.25594883819504405,"score_spread":0.2394925622036643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414808937","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.017604833,0.00035521254,0.97154284,0.00019607946,0.00008404866,0.00010572107,0.00043580568,0.008734342,0.0009410423],"genre_scores_gemma":[0.21804303,0.00083907583,0.7642472,0.00036865755,0.00011530269,0.00025508838,0.0044598486,0.0012779916,0.010393795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993704,0.000079194026,0.000026471433,0.00020635495,0.00021310302,0.00010448209],"domain_scores_gemma":[0.9991648,0.00025545896,0.00005532454,0.0002304842,0.00021760748,0.000076417935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010888672,0.0017160085,0.0020741147,0.00095567363,0.0004961707,0.0020400826,0.0027938294,0.0028378882,0.0040799337],"category_scores_gemma":[0.001957532,0.0010098312,0.0020401224,0.0010507976,0.00067257136,0.0013307235,0.0030952562,0.002756044,0.0058570225],"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.0003910091,0.00023451095,0.0011347691,0.00016357613,0.00014231108,0.00018921097,0.00011163735,0.09448693,0.03444633,0.0016336995,0.010570403,0.8564956],"study_design_scores_gemma":[0.000012100363,0.00011874636,0.000425749,0.000018587281,0.000021005842,0.0002025729,0.000039670264,0.9828324,0.011086073,0.0033383342,0.0018893301,0.00001535452],"about_ca_topic_score_codex":0.003523489,"about_ca_topic_score_gemma":0.006702206,"teacher_disagreement_score":0.0040799337,"about_ca_system_score_codex":0.0005941582,"about_ca_system_score_gemma":0.0011973549,"threshold_uncertainty_score":0.013648748},"labels":[],"label_agreement":null},{"id":"W4414808959","doi":"10.1007/978-3-032-06774-6_18","title":"A Scalable Toolkit for Modeling 3D Surface-Based Brain Geometry","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of British Columbia","funders":"","keywords":"Scalability; Range (aeronautics); Multivariate statistics; Surface (topology); Computational model; Computational geometry","score_opus":0.03811250957988472,"score_gpt":0.2663353054680694,"score_spread":0.22822279588818467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414808959","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.0016989744,0.00021727053,0.9721807,0.0000895548,0.00006451006,0.00010207105,0.0018875503,0.021528352,0.0022310426],"genre_scores_gemma":[0.05527899,0.0009299267,0.91906965,0.00021190541,0.000051321716,0.00069578516,0.006811816,0.009733325,0.007217297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996345,0.000034103152,0.000027097247,0.000055580647,0.00021890856,0.000029819796],"domain_scores_gemma":[0.99945134,0.0002138881,0.00003338012,0.00011026871,0.00013955764,0.000051582927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044584187,0.0017378861,0.0013980618,0.0012696232,0.00075658853,0.00299574,0.0050392393,0.0016800419,0.0213082],"category_scores_gemma":[0.0019226879,0.0015493827,0.0025922994,0.0017340273,0.00058690604,0.0014873574,0.002893832,0.0024743786,0.008866803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016986216,0.00012895571,0.0013597731,0.0011421439,0.0004782288,0.00062103145,0.0005169954,0.49400768,0.015749898,0.043577377,0.107375085,0.3348729],"study_design_scores_gemma":[0.000033106837,0.000015111963,0.00018667059,0.000040289848,0.000029747562,0.00019909962,0.00004255545,0.95092404,0.002651661,0.016727308,0.029117009,0.000033338285],"about_ca_topic_score_codex":0.014451078,"about_ca_topic_score_gemma":0.033744927,"teacher_disagreement_score":0.0213082,"about_ca_system_score_codex":0.00074562035,"about_ca_system_score_gemma":0.0015021453,"threshold_uncertainty_score":0.0712831},"labels":[],"label_agreement":null},{"id":"W4414808965","doi":"10.1007/978-3-032-06774-6_6","title":"Anatomically-Focused Patches for Lightweight and Explainable Knee OA Grading","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Total Knee Arthroplasty Outcomes","field":"Medicine","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":"Polytechnique Montréal","funders":"","keywords":"Landmark; Grading (engineering); Osteoarthritis; Visualization; Pattern recognition (psychology); Salient; Limiting; Set (abstract data type)","score_opus":0.01302220795140088,"score_gpt":0.2470645598509038,"score_spread":0.23404235189950293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414808965","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.010437127,0.0013287079,0.91995543,0.00054971577,0.00062872685,0.00020244412,0.00059468107,0.018945344,0.047357794],"genre_scores_gemma":[0.10339014,0.0016277074,0.7599826,0.00043815878,0.00034884908,0.00023327763,0.0018045795,0.0055543343,0.12662032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999734,0.00003928538,0.000015793154,0.000045715395,0.00014226777,0.000022853219],"domain_scores_gemma":[0.99899524,0.0005259303,0.000051371313,0.00020920303,0.0001499795,0.000068361005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039370486,0.00066501973,0.00027003058,0.00046473902,0.00014962668,0.0008637926,0.0011312928,0.00064087193,0.061779745],"category_scores_gemma":[0.0028419364,0.00032868923,0.00047557178,0.00033214418,0.00024348786,0.0010586648,0.0013631325,0.0010346037,0.017335556],"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.00010421925,0.00008691035,0.00038339006,0.0003208658,0.0000125860015,0.0002346535,0.00022706685,0.0042865905,0.022764388,0.011926932,0.05931157,0.90034074],"study_design_scores_gemma":[0.00012802967,0.00043682184,0.0063330857,0.00069383945,0.00011703038,0.004039397,0.00037606264,0.19140367,0.05878106,0.08537705,0.6521822,0.00013173786],"about_ca_topic_score_codex":0.00037722703,"about_ca_topic_score_gemma":0.0010291502,"teacher_disagreement_score":0.061779745,"about_ca_system_score_codex":0.00021503182,"about_ca_system_score_gemma":0.00023949634,"threshold_uncertainty_score":0.2066738},"labels":[],"label_agreement":null},{"id":"W4414808970","doi":"10.1007/978-3-032-06774-6_26","title":"SimCortex: Collision-Free Simultaneous Cortical Surfaces Reconstruction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"École de Technologie Supérieure","funders":"","keywords":"Surface (topology); Surface reconstruction; Diffeomorphism; Iterative reconstruction; Topology (electrical circuits); Current (fluid)","score_opus":0.01012007755659945,"score_gpt":0.26294697710162873,"score_spread":0.2528268995450293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414808970","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.0027900194,0.00037569506,0.982754,0.000087486485,0.00009777953,0.000052586616,0.00050216535,0.008495557,0.004844823],"genre_scores_gemma":[0.05582805,0.00053243304,0.9325988,0.0001425666,0.000053340045,0.00013618519,0.0011948561,0.0023110618,0.0072026164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953735,0.000036260477,0.000014061516,0.00006351337,0.0003123707,0.000036364294],"domain_scores_gemma":[0.99958056,0.00016506892,0.000018040426,0.00012790583,0.000080332095,0.000028176986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045159212,0.0010363295,0.0008257153,0.00087269803,0.0002844241,0.0015118489,0.002765341,0.0010815262,0.023086108],"category_scores_gemma":[0.0013327898,0.0009329751,0.0007470168,0.0011804461,0.00039499658,0.0011749062,0.002671368,0.0011618121,0.0059636035],"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.00041856003,0.000054836517,0.00048659364,0.00038228446,0.00017273525,0.00052583223,0.00016660843,0.044920214,0.044063162,0.023725223,0.059622157,0.8254618],"study_design_scores_gemma":[0.00007792,0.000055027376,0.00050385064,0.000049182163,0.000031507516,0.0012403599,0.000064856715,0.8924088,0.04201875,0.025695512,0.03780416,0.00005005257],"about_ca_topic_score_codex":0.002389967,"about_ca_topic_score_gemma":0.0055491487,"teacher_disagreement_score":0.023086108,"about_ca_system_score_codex":0.00044022631,"about_ca_system_score_gemma":0.0010125127,"threshold_uncertainty_score":0.07723069},"labels":[],"label_agreement":null},{"id":"W4414808996","doi":"10.1007/978-3-032-06774-6_19","title":"Parametric Shape Models for Vessels Learned from Segmentations via Differentiable Voxelization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Polygon mesh; Differentiable function; Parametric statistics; Smoothness; Parametric equation; Parametric surface; Volume mesh; Shape analysis (program analysis)","score_opus":0.03993354353934164,"score_gpt":0.2707108864244123,"score_spread":0.23077734288507068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414808996","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.0064465622,0.00016205471,0.99141943,0.000110485475,0.00001984208,0.000019932699,0.00014644487,0.0009864941,0.00068873615],"genre_scores_gemma":[0.44723848,0.0012104433,0.5372289,0.00027050602,0.00012871431,0.00023403742,0.0019067796,0.0021554225,0.009626752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996774,0.000053851552,0.000014763757,0.000112046124,0.00009877499,0.00004307939],"domain_scores_gemma":[0.99929154,0.00030043922,0.00010299666,0.00014068352,0.00012542077,0.00003885498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007093219,0.00087169243,0.0011881827,0.0009328404,0.0003266098,0.0018978094,0.0023289765,0.0021685245,0.002629082],"category_scores_gemma":[0.0031116356,0.0014570423,0.0015979884,0.0012404703,0.0010750096,0.0018229869,0.0012895721,0.002903732,0.0018409018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006493361,0.000025687359,0.0003044055,0.00005860101,0.000028981007,0.000047753634,0.000069841066,0.89178467,0.0058211465,0.014371222,0.0019050072,0.085517846],"study_design_scores_gemma":[0.0000018773954,0.0000058723663,0.00004705132,0.000005823539,0.0000028270936,0.000019054412,0.000003733472,0.9930434,0.00072900264,0.0056024254,0.0005338558,0.000005089642],"about_ca_topic_score_codex":0.007571083,"about_ca_topic_score_gemma":0.00884845,"teacher_disagreement_score":0.007571083,"about_ca_system_score_codex":0.0013976536,"about_ca_system_score_gemma":0.0011431838,"threshold_uncertainty_score":0.0150539875},"labels":[],"label_agreement":null},{"id":"W4414809591","doi":"10.1007/978-3-032-05461-6_24","title":"Adaptive Isolation Forest","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Anomaly detection; Benchmark (surveying); Stability (learning theory); Novelty detection; Change detection; Anomaly (physics); Isolation (microbiology); Data stream","score_opus":0.01397789772431564,"score_gpt":0.24452927588441054,"score_spread":0.23055137816009488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414809591","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.012024611,0.0009768908,0.9506104,0.00016811887,0.0003331501,0.00012300284,0.0008733466,0.005860772,0.029029693],"genre_scores_gemma":[0.18146136,0.0009907585,0.755225,0.00040222556,0.00037180455,0.00018690212,0.0067658746,0.0015305503,0.05306551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.00002874485,0.000009930932,0.00012368507,0.00010584996,0.000044338103],"domain_scores_gemma":[0.99958247,0.000109440385,0.000020724005,0.0001438671,0.000109075074,0.000034438588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003466736,0.0008060759,0.00064186007,0.0009896363,0.0005581665,0.00085073593,0.0013732597,0.0006374181,0.018159261],"category_scores_gemma":[0.00093423243,0.00034000594,0.0005663583,0.0011940241,0.00029837748,0.0012394955,0.0010011389,0.0010939279,0.010811424],"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.00030793753,0.0001738846,0.0007450355,0.00015561754,0.000054489636,0.00010072406,0.000027023763,0.033600885,0.023533743,0.0095031075,0.034399904,0.8973977],"study_design_scores_gemma":[0.000061813735,0.00013948538,0.0017197647,0.000056884197,0.00008387768,0.00076425815,0.000049462495,0.8521516,0.024618426,0.04633908,0.07397648,0.00003890814],"about_ca_topic_score_codex":0.0013204507,"about_ca_topic_score_gemma":0.00352342,"teacher_disagreement_score":0.018159261,"about_ca_system_score_codex":0.00019094876,"about_ca_system_score_gemma":0.00050915504,"threshold_uncertainty_score":0.060748816},"labels":[],"label_agreement":null},{"id":"W4414809605","doi":"10.1007/978-3-032-05461-6","title":"Discovery Science","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"RIKEN; University at Buffalo; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Universidade Tecnológica Federal do Paraná; Università della Calabria; Région Normandie; Université de Caen Normandie; Centre de Coopération Internationale en Recherche Agronomique pour le Développement; Università di Pisa; Universidade do Porto; Universidade do Minho; Institut National de la Recherche Agronomique; University of Regina; Télécom Paris; Universität Osnabrück; Universita degli Studi di Bari Aldo Moro; Institut Polytechnique de Paris; Kungliga Tekniska Högskolan; Institut \"Jožef Stefan\"; Univerza v Ljubljani; Scuola Normale Superiore; Institut national de recherche en informatique et en automatique (INRIA); Université de Montpellier; Università degli Studi di Napoli Federico II; Teesside University; Chalmers Tekniska Högskola; Universidade de Aveiro","keywords":"Forgetting; Adaptation (eye); Process (computing); Scientific discovery; Architecture; Artificial life","score_opus":0.09793587777009741,"score_gpt":0.403697808950719,"score_spread":0.30576193118062156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414809605","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001379623,0.017256387,0.29826888,0.01029827,0.0029736208,0.00015044498,0.0026897597,0.0042881435,0.6626948],"genre_scores_gemma":[0.037562426,0.019223426,0.12128102,0.0040742783,0.0032253747,0.00041341232,0.005628003,0.0019368017,0.80665535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875975,0.00021859417,0.000046839723,0.00028774166,0.0006296152,0.000057582474],"domain_scores_gemma":[0.9977881,0.00091988663,0.00006390789,0.0007981035,0.00031938712,0.000110728215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015660452,0.0009034054,0.0012048308,0.0023723026,0.0009800078,0.0046566683,0.0016317726,0.0015800737,0.07676396],"category_scores_gemma":[0.004231501,0.0007395314,0.0007667249,0.0021886306,0.0018006903,0.00423528,0.0022697258,0.0027857386,0.056541786],"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.000018921739,0.000026155238,0.0001664366,0.0003165015,0.000028262899,0.00005175662,0.0000884229,0.0007575495,0.0007472286,0.5452698,0.25090343,0.20162556],"study_design_scores_gemma":[0.0000061758114,0.000009943779,0.00011408632,0.00007525078,0.000010235563,0.00012322668,0.000028644381,0.0019080627,0.0008128096,0.4146739,0.58222944,0.000008250147],"about_ca_topic_score_codex":0.0007795867,"about_ca_topic_score_gemma":0.0011086736,"teacher_disagreement_score":0.07676396,"about_ca_system_score_codex":0.0014469781,"about_ca_system_score_gemma":0.001489972,"threshold_uncertainty_score":0.256801},"labels":[],"label_agreement":null},{"id":"W4414809633","doi":"10.1007/978-3-032-05461-6_17","title":"Meta Subspace Analysis: Understanding Model (Mis)behavior in the Metafeature Space","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Subspace topology; Random forest; Naive Bayes classifier; Feature vector; Entropy (arrow of time); Feature (linguistics); Bayes' theorem; Perspective (graphical); Space (punctuation); Bayesian probability","score_opus":0.07203944131268429,"score_gpt":0.29621931323937095,"score_spread":0.22417987192668665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414809633","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.017972112,0.00027024988,0.98007315,0.00020625159,0.00002778126,0.000012632164,0.000106548665,0.0004856599,0.0008456076],"genre_scores_gemma":[0.5150041,0.0005435339,0.48036587,0.0001488137,0.00008434164,0.00008992612,0.0005499811,0.0004695441,0.002743952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.000183728,0.000029584968,0.00011086563,0.00019421263,0.000049346927],"domain_scores_gemma":[0.99767274,0.00128088,0.00025373508,0.00042687266,0.00029748748,0.00006837137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012289843,0.00075780984,0.0007391875,0.000997703,0.00037490894,0.0017091467,0.000857236,0.0007215047,0.0020296548],"category_scores_gemma":[0.005918398,0.00037993887,0.00080068456,0.0012023911,0.00062704517,0.0031803588,0.0013565156,0.0017866233,0.00055194704],"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.00022378167,0.00015296238,0.0095949685,0.00025204854,0.0002524988,0.00017464138,0.00073014403,0.25283247,0.022672769,0.10302166,0.0073515587,0.60274047],"study_design_scores_gemma":[0.0000029109426,0.000040958643,0.0011070173,0.000012524628,0.00001402859,0.00006352153,0.00007344772,0.93286514,0.002365031,0.062521264,0.0009183531,0.00001568874],"about_ca_topic_score_codex":0.0021331345,"about_ca_topic_score_gemma":0.0022301641,"teacher_disagreement_score":0.0021331345,"about_ca_system_score_codex":0.00044971888,"about_ca_system_score_gemma":0.0005989413,"threshold_uncertainty_score":0.006789863},"labels":[],"label_agreement":null},{"id":"W4414829530","doi":"10.1007/978-3-031-97778-7_31","title":"From Gamification to Virtual Reality: The Evolution of the Gamified Education Networking Learning Management System Through Design-Based Research in Simulation-Based Education","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; St. Michael's Hospital; Ontario Tech University","funders":"","keywords":"Usability; Learning Management; Experiential learning; Key (lock); Virtual learning environment; Management system; Technology acceptance model; Virtual reality","score_opus":0.0899220302250466,"score_gpt":0.3799366253581745,"score_spread":0.2900145951331279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414829530","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.15079264,0.024731299,0.33669075,0.017824663,0.0011150246,0.00033847467,0.000090585905,0.00081545016,0.46760118],"genre_scores_gemma":[0.7485487,0.01436785,0.16924928,0.0013172062,0.00013817768,0.00023029097,0.00010379711,0.0003003751,0.06574434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869627,0.0008135482,0.00003409006,0.00010428503,0.00028496445,0.00006683834],"domain_scores_gemma":[0.997584,0.0019108653,0.000061632796,0.00014567676,0.00017813832,0.00011975961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023914624,0.0005360071,0.00025973163,0.0009128251,0.0005225211,0.006034792,0.0012859385,0.0011534321,0.004973958],"category_scores_gemma":[0.0049727075,0.00029836412,0.00029433798,0.0008269331,0.0033435521,0.0050513037,0.0021265086,0.0019640874,0.0004999797],"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.00009175204,0.00020204583,0.001282001,0.00040042293,0.000024594205,0.00015082382,0.00906483,0.005874438,0.0018961696,0.5621135,0.005204712,0.41369468],"study_design_scores_gemma":[0.00006374541,0.0004970592,0.003011103,0.0018798648,0.000064468535,0.000984258,0.011434854,0.047070228,0.00945337,0.5353251,0.39012554,0.0000904489],"about_ca_topic_score_codex":0.0016009277,"about_ca_topic_score_gemma":0.0017557282,"teacher_disagreement_score":0.006034792,"about_ca_system_score_codex":0.0013916529,"about_ca_system_score_gemma":0.0017403516,"threshold_uncertainty_score":0.01663953},"labels":[],"label_agreement":null},{"id":"W4414829531","doi":"10.1007/978-3-031-97778-7_19","title":"Getting Serious About Serious VR Games for People with Dementia: A Scoping Review of Applications Designed to Date","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto East General Hospital; York University; University Health Network","funders":"","keywords":"Virtual reality; Dementia; Serious game; Virtual machine; Sense of presence","score_opus":0.015483380953335957,"score_gpt":0.2937794261527166,"score_spread":0.27829604519938067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414829531","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010338408,0.9977574,0.00014805063,0.00025054996,0.000099361234,0.00006421934,0.000056336357,0.0000056141853,0.0005845888],"genre_scores_gemma":[0.0061752237,0.9918869,0.0009846884,0.00044627304,0.000050075563,0.00012774591,0.00010146013,0.000008122505,0.00021954444],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946156,0.0017367696,0.0018272514,0.0004706168,0.0011501843,0.00019954752],"domain_scores_gemma":[0.9698827,0.02459825,0.0024357373,0.0002657781,0.002526837,0.00029060856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010407415,0.0010861746,0.0030046117,0.007358097,0.0007254307,0.0042080544,0.0014965992,0.0020209036,0.0031487497],"category_scores_gemma":[0.037680533,0.00078015483,0.0027446996,0.006023556,0.0011507433,0.0034471883,0.0026280181,0.0019042994,0.00047225016],"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.00033480444,0.00012905529,0.0008867789,0.33533573,0.0011873317,0.00009317568,0.0018109614,0.00014367531,0.0005971543,0.0010190093,0.0044904705,0.65397185],"study_design_scores_gemma":[0.00014450836,0.0006117128,0.0068395645,0.8764442,0.006253126,0.0006572327,0.0027746304,0.0000983396,0.00063369924,0.0011582006,0.10432154,0.000063237676],"about_ca_topic_score_codex":0.008306539,"about_ca_topic_score_gemma":0.024863077,"teacher_disagreement_score":0.010407415,"about_ca_system_score_codex":0.0018174725,"about_ca_system_score_gemma":0.006765222,"threshold_uncertainty_score":0.05504036},"labels":[],"label_agreement":null},{"id":"W4414912948","doi":"10.1007/978-3-032-07106-4_9","title":"Abstracting Concolic Execution for Soft Contract Verification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Concolic testing; Symbolic execution; Rendering (computer graphics); Benchmark (surveying); Static analysis; Symbolic data analysis; Code coverage; Program analysis","score_opus":0.025613513048347004,"score_gpt":0.2855329825402949,"score_spread":0.2599194694919479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414912948","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.004589986,0.000118817705,0.98630446,0.00010066872,0.000070022594,0.00010173461,0.00005136661,0.001852209,0.0068107354],"genre_scores_gemma":[0.29795405,0.000550342,0.6697184,0.00038433148,0.00015688156,0.00043887156,0.0006993765,0.0026065367,0.02749116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967642,0.0008642705,0.00022375918,0.00044226873,0.0013595723,0.0003459518],"domain_scores_gemma":[0.9955422,0.0022013832,0.00018348893,0.0015067651,0.00046590416,0.00010017859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024498703,0.001202075,0.0008732699,0.0010728411,0.0011512148,0.0022449915,0.0018682452,0.0011565445,0.010983358],"category_scores_gemma":[0.007923648,0.0011101849,0.0014986371,0.0009965517,0.003458899,0.0038870086,0.004495637,0.0041336776,0.0034444847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031332497,0.00010671188,0.00035686683,0.00034858653,0.000047748905,0.00022956992,0.0005224579,0.049801815,0.009108022,0.7508178,0.0056122825,0.18273482],"study_design_scores_gemma":[0.000042045333,0.000055404387,0.00010319529,0.000108428845,0.00004460171,0.000109331486,0.000042633103,0.24197072,0.016214637,0.71864283,0.02262896,0.000037152644],"about_ca_topic_score_codex":0.0022203298,"about_ca_topic_score_gemma":0.0033385172,"teacher_disagreement_score":0.010983358,"about_ca_system_score_codex":0.0013594183,"about_ca_system_score_gemma":0.001982649,"threshold_uncertainty_score":0.036742985},"labels":[],"label_agreement":null},{"id":"W4414994693","doi":"10.1007/978-3-032-01399-6_5","title":"Evaluating Prompt Engineering Techniques for Accuracy and Confidence Elicitation in Medical LLMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quality and Safety in Healthcare","field":"Health Professions","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":"Ontario Tech University","funders":"","keywords":"Correctness; Low Confidence; Confidence interval; Calibration; Brier score; Overconfidence effect","score_opus":0.1194715902993269,"score_gpt":0.49546192946995715,"score_spread":0.37599033917063024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414994693","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.4983908,0.001683428,0.48460308,0.00056371535,0.0001924496,0.00096524984,0.0010566594,0.007676676,0.004868002],"genre_scores_gemma":[0.748679,0.00037664827,0.24768141,0.00018713587,0.0000619625,0.0003773362,0.00076429645,0.00028156055,0.0015906543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98663527,0.008160632,0.0013306687,0.00091956917,0.0025966796,0.0003570746],"domain_scores_gemma":[0.66764104,0.30871466,0.00640006,0.004829321,0.011399936,0.0010149704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013094483,0.0008927585,0.00067467644,0.0013884571,0.0003803339,0.0018627519,0.0011300014,0.0014968872,0.0041254726],"category_scores_gemma":[0.13451487,0.00035951208,0.00039960092,0.00094846543,0.00039841715,0.002092217,0.001928027,0.0010475278,0.0013887832],"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.0079819495,0.0009950948,0.023247633,0.0019752565,0.00017643254,0.00019149306,0.0036309122,0.014931841,0.04591949,0.0024486019,0.0038574599,0.8946439],"study_design_scores_gemma":[0.0011225371,0.0076836324,0.059541315,0.0010369383,0.0008178326,0.0011724674,0.005220452,0.70420414,0.19021994,0.014346348,0.01435524,0.00027916723],"about_ca_topic_score_codex":0.0011554791,"about_ca_topic_score_gemma":0.0015853635,"teacher_disagreement_score":0.013094483,"about_ca_system_score_codex":0.00069646456,"about_ca_system_score_gemma":0.0010885467,"threshold_uncertainty_score":0.06925106},"labels":[],"label_agreement":null},{"id":"W4414995024","doi":"10.1007/978-3-032-07945-9_9","title":"Self-supervised Pretraining and Multi-label Decoding for Intracranial Hemorrhage Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intracerebral and Subarachnoid Hemorrhage Research","field":"Medicine","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":"Polytechnique Montréal; Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Segmentation; Autoencoder; Decoding methods; Feature (linguistics); Pattern recognition (psychology); Annotation; Feature learning; Dice; Deep learning","score_opus":0.031060232238721393,"score_gpt":0.30983688087276073,"score_spread":0.27877664863403934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414995024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022508757,0.002184575,0.95907366,0.0003390115,0.00039378298,0.00014838336,0.0010567355,0.010097158,0.004197893],"genre_scores_gemma":[0.16920355,0.0014394941,0.7984164,0.00051484746,0.00029534122,0.00029901817,0.0062260297,0.0014146814,0.022190697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994216,0.00008523919,0.000037447076,0.00023328769,0.000110943554,0.00011158424],"domain_scores_gemma":[0.9989573,0.00043272914,0.00005536899,0.0001801542,0.00032986133,0.000044546872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010845735,0.0016109139,0.0014120572,0.0012195574,0.0007422055,0.001377118,0.0021536702,0.0021158948,0.005022701],"category_scores_gemma":[0.0016258113,0.00083670596,0.0015653311,0.001546248,0.00049326563,0.001071689,0.0012405608,0.0023660476,0.00518235],"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.00020672125,0.00015246376,0.00070884556,0.00018471194,0.000099853336,0.00009273845,0.00008358541,0.026086474,0.03524599,0.001308271,0.014224128,0.9216063],"study_design_scores_gemma":[0.000018192693,0.00012297924,0.0020412654,0.000061858904,0.000106581,0.00026250334,0.0000781849,0.9370932,0.047178064,0.0049804985,0.008014755,0.000041914183],"about_ca_topic_score_codex":0.0106143905,"about_ca_topic_score_gemma":0.02670368,"teacher_disagreement_score":0.0106143905,"about_ca_system_score_codex":0.00070723245,"about_ca_system_score_gemma":0.001534701,"threshold_uncertainty_score":0.02110523},"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":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4415000665","doi":"10.1007/978-3-032-02042-0_33","title":"Co-creation and Deep Listening Between Humans and Machines in a Telematic Workshop Environment","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Salient; Active listening; Point (geometry); Virtual machine; Virtual reality; Telematics","score_opus":0.015879469759688458,"score_gpt":0.28283867323497697,"score_spread":0.2669592034752885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415000665","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.6027719,0.00036477242,0.19559933,0.0018320425,0.000297014,0.000102128164,0.00007514718,0.0011157071,0.19784199],"genre_scores_gemma":[0.9424501,0.000065949025,0.018896705,0.00011212637,0.000037997954,0.000049521637,0.000054535092,0.00014473677,0.038188394],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9991509,0.00046712992,0.000016137796,0.00012393514,0.00010470131,0.00013729824],"domain_scores_gemma":[0.9986532,0.00075448415,0.000054933847,0.00014935846,0.000059803886,0.0003283247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086516736,0.00037802817,0.00019440676,0.00022815357,0.0017215392,0.0031595163,0.0012235512,0.0012024792,0.011300044],"category_scores_gemma":[0.0015969512,0.00027624718,0.00024260496,0.00021708816,0.0016535178,0.0033732587,0.0046682437,0.0012880862,0.0016037311],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021850057,0.0012044518,0.010675933,0.0004916961,0.000083661595,0.0038536428,0.24795139,0.010978243,0.14357014,0.15625238,0.03212195,0.39063156],"study_design_scores_gemma":[0.00026980904,0.0022949947,0.022624912,0.0004414661,0.00015845713,0.0054112542,0.24051034,0.09640226,0.06139691,0.17308727,0.39705026,0.00035211217],"about_ca_topic_score_codex":0.0003369602,"about_ca_topic_score_gemma":0.00080764014,"teacher_disagreement_score":0.011300044,"about_ca_system_score_codex":0.00027086702,"about_ca_system_score_gemma":0.0004896268,"threshold_uncertainty_score":0.037802458},"labels":[],"label_agreement":null},{"id":"W4415057661","doi":"10.1007/978-3-032-08009-7_2","title":"Overcoming Data Scarcity: Brain Tumor Segmentation in Pediatric and African Populations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Segmentation; Baseline (sea); Brain tumor; Domain (mathematical analysis); Training set; Code (set theory); Deep learning","score_opus":0.062481546137058704,"score_gpt":0.29947971512604404,"score_spread":0.23699816898898535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415057661","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5893772,0.050089564,0.26010454,0.0366231,0.0012728282,0.00034360643,0.008616424,0.0013060967,0.05226659],"genre_scores_gemma":[0.77080303,0.023808563,0.18156567,0.0019631418,0.0009262964,0.0002739915,0.0054524103,0.0006473474,0.0145595055],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996238,0.00014088377,0.000023144676,0.00008506476,0.000082922146,0.000044159104],"domain_scores_gemma":[0.99802715,0.0014156018,0.00014288702,0.000077074044,0.00023772175,0.00009961023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021865843,0.00034004223,0.00045695645,0.0013080917,0.00047466147,0.0012756337,0.0010098635,0.0005483167,0.0035368188],"category_scores_gemma":[0.009019819,0.0002767338,0.00033192037,0.001998406,0.00050253666,0.0018682542,0.0010615067,0.0007019613,0.0006651242],"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.00014543458,0.000056153185,0.07582228,0.00050804473,0.000087734086,0.0013831526,0.0028976353,0.0032997585,0.0031255016,0.0077585937,0.047130384,0.8577853],"study_design_scores_gemma":[0.000053919997,0.00042375908,0.39223826,0.0021091215,0.0004374342,0.021663435,0.028023254,0.075875424,0.018825404,0.1815889,0.27859482,0.00016625231],"about_ca_topic_score_codex":0.006951793,"about_ca_topic_score_gemma":0.015526459,"teacher_disagreement_score":0.006951793,"about_ca_system_score_codex":0.0004661839,"about_ca_system_score_gemma":0.0011603384,"threshold_uncertainty_score":0.013822615},"labels":[],"label_agreement":null},{"id":"W4415077465","doi":"10.1007/978-3-032-07502-4_10","title":"Imagining Alternatives: Towards High-Resolution 3D Counterfactual Medical Image Generation via Language Guidance","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Counterfactual thinking; Medical imaging; Fidelity; Image (mathematics); Natural language; Natural language generation; Limiting; Visualization","score_opus":0.011620716915066718,"score_gpt":0.2573483645142772,"score_spread":0.24572764759921045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415077465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005343485,0.00015047312,0.99043614,0.000461582,0.00004650126,0.00004784523,0.000057280773,0.00041305376,0.0030436348],"genre_scores_gemma":[0.30574593,0.00031687116,0.68765193,0.00066001073,0.00009172324,0.0002048744,0.00025005304,0.0003795022,0.004699124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922705,0.00040566528,0.00002089099,0.00010624822,0.00019734171,0.000042780666],"domain_scores_gemma":[0.99737984,0.0021089534,0.00012404792,0.00021800256,0.0001086465,0.00006047625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022158057,0.000653053,0.0006142708,0.0004485118,0.00032393177,0.0021749062,0.0016884322,0.002039045,0.006293336],"category_scores_gemma":[0.007091461,0.00077793404,0.0009166495,0.00033894565,0.0020725587,0.001918275,0.003440827,0.0021513146,0.0011201805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005871001,0.00009031808,0.0004891344,0.00044000417,0.00012415918,0.0007456673,0.0010210846,0.47552827,0.029864833,0.31690735,0.007950008,0.16625218],"study_design_scores_gemma":[0.000024850806,0.000026436193,0.00004715198,0.000026330266,0.0000073893916,0.0001224175,0.000037613238,0.89146227,0.0033522989,0.1023839,0.002496328,0.000013127841],"about_ca_topic_score_codex":0.00060846435,"about_ca_topic_score_gemma":0.0006205548,"teacher_disagreement_score":0.006293336,"about_ca_system_score_codex":0.000570435,"about_ca_system_score_gemma":0.0004415763,"threshold_uncertainty_score":0.021053255},"labels":[],"label_agreement":null},{"id":"W4415077466","doi":"10.1007/978-3-032-07502-4_3","title":"Mind the Evaluation Gap: Large Language Models for Structured Data Extraction from Radiology Reports","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Benchmarking; Structured prediction; Process (computing); Information extraction; Topic model; Data extraction","score_opus":0.06755437887015867,"score_gpt":0.3353343658884651,"score_spread":0.2677799870183064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415077466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008430503,0.0017014637,0.9766815,0.0021647399,0.0002132735,0.00011717973,0.002006171,0.006746438,0.0019387777],"genre_scores_gemma":[0.18896917,0.002401227,0.7840906,0.0010211201,0.0007160557,0.00044965677,0.013140433,0.0032959962,0.0059157982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960169,0.0022165664,0.00034905158,0.0005274883,0.0007847813,0.00010513895],"domain_scores_gemma":[0.97770894,0.01838822,0.0004974609,0.0018859846,0.001260912,0.00025855575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008505474,0.0010577383,0.0011756787,0.001592117,0.000575359,0.004001783,0.0022015844,0.0013627768,0.0031397466],"category_scores_gemma":[0.026004793,0.00091711077,0.0016470851,0.0019555301,0.0008224835,0.007286891,0.0022361288,0.0034946052,0.0029205852],"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.00060374296,0.0003057907,0.0030650424,0.00094309024,0.00032629992,0.00030638734,0.0012686745,0.04684379,0.009448832,0.054641165,0.08360247,0.7986448],"study_design_scores_gemma":[0.00006560109,0.00011314699,0.0009877797,0.00019650762,0.00015857739,0.00022892251,0.00034300657,0.81515163,0.009472625,0.13898349,0.03423402,0.00006468699],"about_ca_topic_score_codex":0.0025493442,"about_ca_topic_score_gemma":0.0044457684,"teacher_disagreement_score":0.008505474,"about_ca_system_score_codex":0.0009493568,"about_ca_system_score_gemma":0.00205849,"threshold_uncertainty_score":0.044981778},"labels":[],"label_agreement":null},{"id":"W4415077484","doi":"10.1007/978-3-032-07502-4_11","title":"Pixels Under Pressure: Exploring Fine-Tuning Paradigms for Foundation Models in High-Resolution Medical Imaging","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Fidelity; Classifier (UML); Medical imaging; Pixel; Key (lock); Benchmark (surveying); Downstream (manufacturing); Set (abstract data type)","score_opus":0.044787075907380194,"score_gpt":0.29737202920274663,"score_spread":0.25258495329536645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415077484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013666466,0.00036329686,0.9813644,0.00024313423,0.000031166714,0.000019726214,0.000037355854,0.00094203145,0.0033324359],"genre_scores_gemma":[0.3967747,0.00068273634,0.5967952,0.00022509649,0.00006715542,0.00009904986,0.00019185265,0.0007972657,0.0043668603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00012573664,0.000024679803,0.000114337,0.00016920538,0.000056624838],"domain_scores_gemma":[0.99845004,0.00087282027,0.00010518371,0.0003231669,0.00015250074,0.00009624634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223443,0.0007018988,0.000802011,0.00036004971,0.0005103078,0.00176843,0.0028243233,0.0012757089,0.003940532],"category_scores_gemma":[0.0044729365,0.0005700448,0.00074026856,0.00060105487,0.0011430951,0.0041289926,0.0022854882,0.0021218078,0.0007862823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032053873,0.00016355008,0.00097560184,0.00028091198,0.00007630442,0.00015324261,0.0004927761,0.45437843,0.030913284,0.19055545,0.0052549704,0.31643498],"study_design_scores_gemma":[0.000011388614,0.000029637591,0.0000775365,0.000013818757,0.000011893999,0.000031014788,0.00004930974,0.9265341,0.0034286384,0.067468815,0.0023362094,0.000007608834],"about_ca_topic_score_codex":0.0019728325,"about_ca_topic_score_gemma":0.0032297294,"teacher_disagreement_score":0.003940532,"about_ca_system_score_codex":0.0007097029,"about_ca_system_score_gemma":0.00073253125,"threshold_uncertainty_score":0.013182342},"labels":[],"label_agreement":null},{"id":"W4415077526","doi":"10.1007/978-3-032-07502-4_2","title":"SCOPE: Label Extraction of Stroke Diagnosis from Unstructured Medical Reports Using Retrieval-Augmented Generation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Foothills Medical Centre; University of Calgary","funders":"","keywords":"Parsing; Scope (computer science); Information extraction; Data extraction; Medical imaging; Code (set theory); Language model; Deep learning","score_opus":0.03351766075588018,"score_gpt":0.29133835355716337,"score_spread":0.25782069280128317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415077526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049174476,0.0035331182,0.876469,0.0011258919,0.0009802668,0.0012156798,0.0150626935,0.043182578,0.009256165],"genre_scores_gemma":[0.16298814,0.0015673438,0.77509767,0.00052210427,0.00073650444,0.0006426946,0.041273694,0.0019265922,0.015245155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.00016785754,0.00007526136,0.00028550645,0.00024547448,0.000086203516],"domain_scores_gemma":[0.9986873,0.0005331497,0.000091630434,0.00025269398,0.0003705753,0.00006459493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898686,0.001469571,0.0008748339,0.003800253,0.000644464,0.001701009,0.0011857632,0.001625719,0.007045868],"category_scores_gemma":[0.0024498631,0.00045390447,0.0016168708,0.0018323498,0.00046706464,0.001448363,0.0016495027,0.0008922954,0.006947071],"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.0005217559,0.00024287909,0.002753386,0.00071741437,0.00015425103,0.0006210679,0.00029419723,0.0042870874,0.057105098,0.0018244132,0.06513822,0.8663402],"study_design_scores_gemma":[0.000427157,0.0009446195,0.027551252,0.0004939755,0.0009665475,0.004188569,0.000789074,0.64138764,0.16583501,0.02409816,0.13304621,0.0002718393],"about_ca_topic_score_codex":0.0035735029,"about_ca_topic_score_gemma":0.005721258,"teacher_disagreement_score":0.007045868,"about_ca_system_score_codex":0.0004850527,"about_ca_system_score_gemma":0.0013386409,"threshold_uncertainty_score":0.023570776},"labels":[],"label_agreement":null},{"id":"W4415080637","doi":"10.1007/978-3-032-07901-5_12","title":"Privacy-Preserving Trajectory Data Publication Via Differentially-Private Representation Learning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université Laval","funders":"","keywords":"Encoder; Exploit; Inference; Scalability; Feature learning; Adversary; Differential privacy; Representation (politics); Trajectory","score_opus":0.042183005684458756,"score_gpt":0.29082571991980105,"score_spread":0.2486427142353423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415080637","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.0075815725,0.0003820022,0.98830134,0.0007161142,0.00012324745,0.000037609436,0.00038706657,0.0010196527,0.0014513293],"genre_scores_gemma":[0.66254216,0.0016980302,0.31470358,0.0007467793,0.0007532438,0.00025272192,0.0032197011,0.000534272,0.015549462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99379843,0.0018115713,0.00041762652,0.0012931139,0.0019791417,0.0007001549],"domain_scores_gemma":[0.9805772,0.007572999,0.0009903638,0.00938286,0.0010991723,0.00037750983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004431861,0.00088266475,0.0027375056,0.0014287974,0.0013430344,0.0042364346,0.0044261897,0.0027919477,0.0037342492],"category_scores_gemma":[0.024378479,0.0008978255,0.0016912371,0.0056530074,0.0022905674,0.009196256,0.008410492,0.005696387,0.0027094563],"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.0010547085,0.0003109508,0.0017593678,0.00029499922,0.00017512748,0.00043686797,0.00038532217,0.25086778,0.0072298534,0.30816248,0.017843891,0.41147867],"study_design_scores_gemma":[0.000051062652,0.00009353478,0.00018676465,0.000028111699,0.00003222309,0.00032156447,0.000050183102,0.78766525,0.0074922186,0.20008014,0.0039637405,0.000035205034],"about_ca_topic_score_codex":0.0011347877,"about_ca_topic_score_gemma":0.00078477926,"teacher_disagreement_score":0.004431861,"about_ca_system_score_codex":0.0019908869,"about_ca_system_score_gemma":0.0030136653,"threshold_uncertainty_score":0.023438215},"labels":[],"label_agreement":null},{"id":"W4415092743","doi":"10.1007/978-3-032-07884-1_5","title":"Towards Context-Aware Log Anomaly Detection Using Fine-Tuned Large Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Parsing; Anomaly detection; Sequence (biology); Anomaly (physics); Similarity (geometry); Ground truth; Language model; Task (project management)","score_opus":0.01786568579175497,"score_gpt":0.24962403063641492,"score_spread":0.23175834484465996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415092743","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.020144762,0.0005856101,0.9605829,0.00025201097,0.00012247598,0.0000674342,0.00047823958,0.017200297,0.00056630425],"genre_scores_gemma":[0.3649315,0.00041351144,0.62765753,0.00041800374,0.00018982663,0.0001908595,0.0019594056,0.0014015218,0.002837864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986015,0.00037506575,0.00010511583,0.00043031777,0.0003423432,0.00014567439],"domain_scores_gemma":[0.9965197,0.0019326226,0.0002432988,0.0006294798,0.0005322011,0.00014268303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014786941,0.0013234162,0.0017242113,0.0014142024,0.00063644623,0.0018309017,0.0024233933,0.001179443,0.0015220011],"category_scores_gemma":[0.005477607,0.00081115257,0.001520035,0.001336283,0.00049804786,0.0032115255,0.0020460812,0.0029499903,0.0019301901],"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.0006504962,0.0007948439,0.006452681,0.0002834448,0.0003576346,0.00033894603,0.00024825954,0.18469886,0.045962982,0.0074920044,0.014321668,0.7383982],"study_design_scores_gemma":[0.000011207187,0.00002711838,0.00023334974,0.0000066508187,0.0000208023,0.000043054188,0.000022082817,0.9898892,0.003499974,0.005412118,0.0008221007,0.000012350252],"about_ca_topic_score_codex":0.007241877,"about_ca_topic_score_gemma":0.014806775,"teacher_disagreement_score":0.007241877,"about_ca_system_score_codex":0.0007664578,"about_ca_system_score_gemma":0.0015176053,"threshold_uncertainty_score":0.014399469},"labels":[],"label_agreement":null},{"id":"W4415092886","doi":"10.1007/978-3-032-07884-1_21","title":"SecureT2I: No More Unauthorized Manipulation on AI Generated Images from Prompts","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","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":"Image editing; Vagueness; Set (abstract data type); Generalization; Block (permutation group theory); Quality (philosophy)","score_opus":0.014580527221166463,"score_gpt":0.2490164141492142,"score_spread":0.23443588692804773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415092886","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.025646983,0.00034576064,0.8828505,0.0018173442,0.00061431405,0.00028634866,0.000707028,0.016297512,0.0714342],"genre_scores_gemma":[0.6688594,0.0003912792,0.24141888,0.0011305584,0.00033818404,0.00044175374,0.0013674607,0.0030415498,0.08301092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980338,0.00033191763,0.00006895254,0.00038851018,0.0008470787,0.0003296784],"domain_scores_gemma":[0.9965829,0.00094048394,0.00016676381,0.0019165745,0.00026647156,0.00012681182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013034082,0.0010074587,0.00075280305,0.00042965938,0.00080686674,0.0021370987,0.0014612183,0.0019670865,0.027481252],"category_scores_gemma":[0.007145109,0.00059046585,0.0007073841,0.00037364973,0.0024228874,0.0039672507,0.0052006003,0.003323919,0.009680016],"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.00163205,0.00026694674,0.00063318544,0.0003298368,0.00005909831,0.00047270284,0.00065460394,0.030554546,0.05416391,0.4573677,0.06423233,0.38963315],"study_design_scores_gemma":[0.00020773485,0.00024531782,0.0004515766,0.000108294895,0.000032820564,0.0006957068,0.00018907782,0.31751767,0.087808415,0.5400716,0.052603804,0.00006804763],"about_ca_topic_score_codex":0.0005343795,"about_ca_topic_score_gemma":0.0006107704,"teacher_disagreement_score":0.027481252,"about_ca_system_score_codex":0.0008307616,"about_ca_system_score_gemma":0.0011015434,"threshold_uncertainty_score":0.091933966},"labels":[],"label_agreement":null},{"id":"W4415160489","doi":"10.1007/978-3-032-08465-1_9","title":"Interpretable ML for Stress Detection from Vital Signs Using SHAP","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Athabasca University","funders":"","keywords":"Wearable computer; Interpretability; Vital signs; Heart rate variability; Wearable technology; Respiratory rate; Heart rate","score_opus":0.03463708633804246,"score_gpt":0.30895360175557207,"score_spread":0.2743165154175296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415160489","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.004529639,0.00020101704,0.97829914,0.00009400119,0.00008866729,0.00003638253,0.00045683427,0.015496116,0.00079822144],"genre_scores_gemma":[0.2492272,0.0003604654,0.73648715,0.00033085642,0.0003176968,0.00028871532,0.0035413294,0.0013433291,0.008103231],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946994,0.00015429535,0.00004927232,0.00015238333,0.00012443158,0.0000497457],"domain_scores_gemma":[0.99883026,0.00067827106,0.000055746328,0.00020656033,0.00020142623,0.000027757997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008524452,0.0011915512,0.00077984005,0.00077157887,0.0002722745,0.0012843651,0.0010125147,0.00095351675,0.009561851],"category_scores_gemma":[0.0033573858,0.00040932334,0.00067230634,0.00049236696,0.00029960604,0.0009012046,0.0012378867,0.0012233916,0.0072014956],"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.00062547193,0.00016696351,0.00107663,0.00013885219,0.00010814634,0.00017604396,0.000077555844,0.035218854,0.03767565,0.004390797,0.007844383,0.9125007],"study_design_scores_gemma":[0.000042030646,0.00011344758,0.00089470966,0.00003660553,0.00004628551,0.00013866709,0.000036192414,0.9391791,0.042120304,0.01119307,0.006178103,0.000021415259],"about_ca_topic_score_codex":0.0009883676,"about_ca_topic_score_gemma":0.0014014697,"teacher_disagreement_score":0.009561851,"about_ca_system_score_codex":0.00023455074,"about_ca_system_score_gemma":0.00039786,"threshold_uncertainty_score":0.031987548},"labels":[],"label_agreement":null},{"id":"W4415189903","doi":"10.1007/978-981-95-3453-1_9","title":"Federated Spatio-Temporal Attention for Time Series Anomaly Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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; Université de Montréal","funders":"","keywords":"Anomaly detection; Leverage (statistics); Discriminative model; Graph; Time series; Anomaly (physics); Architecture","score_opus":0.009936095344302365,"score_gpt":0.23787684504739806,"score_spread":0.2279407497030957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415189903","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.03299278,0.0018574538,0.9575585,0.0002548905,0.00036903663,0.000056756235,0.00043256508,0.0040457663,0.0024323028],"genre_scores_gemma":[0.6646766,0.0013778178,0.32104635,0.00039430198,0.00059508387,0.00011764219,0.0016626043,0.0003043607,0.009825283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948394,0.000068979934,0.000032571912,0.00017214922,0.00014906544,0.000093282324],"domain_scores_gemma":[0.9991825,0.00032949238,0.000055011424,0.0001657152,0.00021199461,0.000055234843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091088674,0.0008997027,0.0012204144,0.0014391121,0.00044903305,0.0009905777,0.0015048627,0.00097635,0.004201182],"category_scores_gemma":[0.0021052354,0.00025781462,0.0008337366,0.0017402273,0.00031264682,0.0014056588,0.0015597801,0.0011655088,0.0012010931],"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.00035491714,0.00023148327,0.0014632915,0.00009802507,0.00011758084,0.00016832273,0.000066448134,0.032539546,0.024700394,0.0041208016,0.007296512,0.9288426],"study_design_scores_gemma":[0.000008898369,0.00007703632,0.0010814478,0.000011746306,0.000051223473,0.000151046,0.000025852214,0.97937965,0.008602626,0.007972085,0.0026266605,0.000011685401],"about_ca_topic_score_codex":0.007147989,"about_ca_topic_score_gemma":0.007967243,"teacher_disagreement_score":0.007147989,"about_ca_system_score_codex":0.00064892374,"about_ca_system_score_gemma":0.0007442853,"threshold_uncertainty_score":0.014212787},"labels":[],"label_agreement":null},{"id":"W4415273246","doi":"10.1007/978-981-95-3462-3_5","title":"Analysis of Metadata and Cough Signal Complexities in Tuberculosis Screening","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Centre Hospitalier de l’Université de Montréal; Université TÉLUQ","funders":"","keywords":"Metadata; Preprocessor; Hurst exponent; Linear discriminant analysis; Time series; Data pre-processing; SIGNAL (programming language); Novelty","score_opus":0.0229232635157959,"score_gpt":0.2808472809139578,"score_spread":0.2579240173981619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415273246","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.8569029,0.0050011496,0.12228377,0.0012330788,0.00018478885,0.0001569101,0.0061856275,0.001350977,0.0067007877],"genre_scores_gemma":[0.96022344,0.00084400707,0.03295989,0.00006007204,0.00017820126,0.000049589722,0.0035922644,0.000099058496,0.0019934243],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99871457,0.00030783052,0.00016417658,0.00022094902,0.00044875272,0.00014380924],"domain_scores_gemma":[0.97933793,0.016438551,0.0016205973,0.00072467886,0.0014437768,0.0004344654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017786067,0.00045049054,0.0005356779,0.0036968798,0.000556284,0.0022993346,0.0005699462,0.00076935306,0.0024669562],"category_scores_gemma":[0.01688742,0.0002868976,0.00062041817,0.0028983308,0.00050237286,0.0025737786,0.0010345668,0.0008151578,0.0009987359],"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.0031333652,0.0004409435,0.35532355,0.00084034924,0.000278844,0.0018044843,0.0010690598,0.044390015,0.048028655,0.011964717,0.0071426206,0.5255834],"study_design_scores_gemma":[0.000044133336,0.000619531,0.28294307,0.00023813336,0.00046499254,0.0034438963,0.0022380664,0.6409763,0.032561734,0.027834361,0.008472852,0.00016297604],"about_ca_topic_score_codex":0.003596238,"about_ca_topic_score_gemma":0.004356856,"teacher_disagreement_score":0.0036968798,"about_ca_system_score_codex":0.0008826753,"about_ca_system_score_gemma":0.00090437225,"threshold_uncertainty_score":0.009406269},"labels":[],"label_agreement":null},{"id":"W4415310313","doi":"10.1007/978-3-032-07894-0_23","title":"Formal Security Analysis of ss2DNS","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Security analysis; Cryptography; Cryptographic protocol; Computer security model; Protocol (science); Process (computing); Key (lock); Scheme (mathematics)","score_opus":0.011512096512819819,"score_gpt":0.2783396073416125,"score_spread":0.2668275108287927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415310313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036865704,0.0007701611,0.89209193,0.0016350166,0.00024327166,0.00024197336,0.00050741783,0.0012812377,0.06636336],"genre_scores_gemma":[0.80967337,0.0010610103,0.1540995,0.0005828071,0.00037506953,0.00035485276,0.0009652432,0.0007136546,0.03217445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955851,0.0012910351,0.0002938009,0.00043662844,0.0017069427,0.0006864876],"domain_scores_gemma":[0.9952739,0.0024081043,0.00025913262,0.0010856024,0.0008585316,0.00011481966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032362093,0.0008500605,0.0005524513,0.0017992945,0.0014600473,0.004697917,0.0015402049,0.0010271956,0.011118897],"category_scores_gemma":[0.0068087894,0.0007318363,0.0014791864,0.0012946874,0.0032050172,0.0067039966,0.0030556165,0.0025228541,0.0018775263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004788061,0.000037085607,0.00024353075,0.00007797031,0.000010344565,0.00007477359,0.00022870964,0.009771582,0.0012428635,0.972057,0.001916107,0.014292214],"study_design_scores_gemma":[0.000025933065,0.000026984335,0.00019684286,0.00009426734,0.000026922256,0.00013094503,0.00015227587,0.09174764,0.004234959,0.8744044,0.028933447,0.000025394247],"about_ca_topic_score_codex":0.0033391598,"about_ca_topic_score_gemma":0.00255221,"teacher_disagreement_score":0.011118897,"about_ca_system_score_codex":0.0040043704,"about_ca_system_score_gemma":0.0020458836,"threshold_uncertainty_score":0.037196398},"labels":[],"label_agreement":null},{"id":"W4415337808","doi":"10.1007/978-3-032-06007-5_6","title":"Bilingual Knowledge Management System for Information Retrieval from Military Policies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Government of Canada; Department of National Defence","funders":"","keywords":"Pipeline (software); Metadata; Process (computing); Generative grammar; Work (physics); Cross-language information retrieval; Information system","score_opus":0.015224760679873793,"score_gpt":0.25673882760088373,"score_spread":0.24151406692100993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415337808","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.054394394,0.0010515375,0.8227299,0.00068777933,0.00017393053,0.00055995205,0.009302483,0.081258886,0.029841222],"genre_scores_gemma":[0.2532654,0.0007320752,0.681712,0.0005254029,0.000103749975,0.0005889833,0.041820224,0.0024451732,0.018807076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948406,0.000102334205,0.000092777525,0.00013914997,0.00013699628,0.000044570064],"domain_scores_gemma":[0.9990557,0.00031360096,0.000064061,0.0002371319,0.00025189895,0.000077592515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442163,0.00045702283,0.00095856667,0.0036023653,0.0010425354,0.0017315082,0.0010201602,0.0008313285,0.0172394],"category_scores_gemma":[0.0027535576,0.00034030556,0.00053317065,0.002800955,0.00027921385,0.0037891727,0.0017908837,0.00074710394,0.0078005767],"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.0011208976,0.0008380149,0.0031380157,0.0006334694,0.00011474231,0.00064424693,0.00075190165,0.0038509038,0.04073939,0.028326524,0.08103723,0.8388046],"study_design_scores_gemma":[0.00052736455,0.00045031158,0.0067480006,0.0003048975,0.00065162545,0.0020921004,0.0012977293,0.4305984,0.124978624,0.06732946,0.364796,0.00022544488],"about_ca_topic_score_codex":0.004724926,"about_ca_topic_score_gemma":0.004676637,"teacher_disagreement_score":0.0172394,"about_ca_system_score_codex":0.0009832821,"about_ca_system_score_gemma":0.002546477,"threshold_uncertainty_score":0.057671487},"labels":[],"label_agreement":null},{"id":"W4415359598","doi":"10.1007/978-3-032-07894-0_21","title":"CapMan: Detecting and Mitigating Linux Capability Abuses at Runtime to Secure Privileged Containers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Ericsson (Canada); University of British Columbia, Okanagan Campus; University of British Columbia; Concordia University","funders":"","keywords":"Executable; Linux kernel; Lagging; Set (abstract data type); Kernel (algebra); Feature (linguistics)","score_opus":0.008634152211272415,"score_gpt":0.24712028667580457,"score_spread":0.23848613446453215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415359598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13506941,0.003797238,0.6615381,0.0013744287,0.0009446891,0.000481038,0.0009137469,0.1381187,0.057762492],"genre_scores_gemma":[0.6334219,0.0010837468,0.31927142,0.0008696863,0.00019720937,0.00019086408,0.0017446798,0.0043282956,0.03889222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873096,0.00016779114,0.000038430615,0.00021327396,0.0006692005,0.00018023657],"domain_scores_gemma":[0.99808925,0.0005803306,0.00021108458,0.00065549195,0.00037246724,0.00009144056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088734616,0.001361293,0.00050907815,0.0011265868,0.00069942017,0.0019480009,0.0016456743,0.0009467202,0.004637695],"category_scores_gemma":[0.0042422055,0.00063315587,0.00050216843,0.00046378202,0.0010982925,0.0033790779,0.002082492,0.0016158405,0.0021640891],"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.0007019769,0.00038854082,0.0075868983,0.0005481669,0.00012308797,0.0006444049,0.0007276524,0.027188642,0.06304539,0.024689596,0.10819188,0.7661638],"study_design_scores_gemma":[0.00006692815,0.00069217995,0.0061654137,0.00025297966,0.000201735,0.0018857404,0.0004105316,0.61237824,0.21917681,0.031769197,0.1268052,0.0001950965],"about_ca_topic_score_codex":0.002487811,"about_ca_topic_score_gemma":0.0036724042,"teacher_disagreement_score":0.004637695,"about_ca_system_score_codex":0.00068078336,"about_ca_system_score_gemma":0.0015559907,"threshold_uncertainty_score":0.015514612},"labels":[],"label_agreement":null},{"id":"W4415455780","doi":"10.1007/978-3-032-09037-9","title":"Advances in Soft Computing","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; Universidad Autónoma del Estado de Morelos; Universidade Federal de Santa Catarina; Banco Bilbao Vizcaya Argentaria; Universidad Panamericana; Universidad Veracruzana; Universidad Autónoma de Coahuila; Centre National de la Recherche Scientifique; Universidad Autónoma del Estado de México; University of Toronto; Universidad Michoacana de San Nicolás de Hidalgo; Universidad Autónoma Metropolitana; Instituto Politécnico Nacional; Instituto Tecnológico y de Estudios Superiores de Monterrey; Université du Luxembourg","keywords":"Automatic summarization; Automation; Simple (philosophy); Range (aeronautics); Geopolitics; Financial market","score_opus":0.006098052586930704,"score_gpt":0.23358194314501787,"score_spread":0.22748389055808718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415455780","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048823287,0.1581309,0.22936186,0.011151781,0.018851,0.00008587168,0.0005327546,0.0012968843,0.5757066],"genre_scores_gemma":[0.059744924,0.11046751,0.07974361,0.002804145,0.009439854,0.00015583962,0.0007086923,0.0008488191,0.7360866],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944454,0.00008318574,0.000024871684,0.00006343041,0.00034340948,0.0000405132],"domain_scores_gemma":[0.99894947,0.0005034192,0.000047300742,0.00016468615,0.00022742517,0.00010776276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007541264,0.0009958897,0.0010741609,0.0015629043,0.0005628161,0.0027642378,0.0006742307,0.00074989186,0.03744394],"category_scores_gemma":[0.0020701075,0.0004945629,0.0004612353,0.0031429406,0.0009963129,0.00266877,0.0019546426,0.002686517,0.01740835],"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.000037118443,0.000062058396,0.00014196505,0.00052124646,0.000030620045,0.000047797395,0.00007303513,0.0056601577,0.0017419495,0.19334213,0.21772853,0.5806134],"study_design_scores_gemma":[0.000008682289,0.000043902815,0.00045279704,0.0003207785,0.000016928463,0.00017217126,0.000059759663,0.02380523,0.0016623195,0.22877114,0.7446665,0.000019802916],"about_ca_topic_score_codex":0.00054011244,"about_ca_topic_score_gemma":0.0011023475,"teacher_disagreement_score":0.03744394,"about_ca_system_score_codex":0.0008016828,"about_ca_system_score_gemma":0.0009791809,"threshold_uncertainty_score":0.12526244},"labels":[],"label_agreement":null},{"id":"W4415506783","doi":"10.1007/978-981-95-2095-4_23","title":"Optimal Electrode Configuration for Wrist sEMG-Based Gesture Recognition: A Systematic Evaluation of Number and Placement","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Muscle activation and electromyography studies","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":"Gesture; Linear discriminant analysis; Generalizability theory; Wearable computer; Support vector machine; Random forest; Gesture recognition; Autoregressive model","score_opus":0.020497577904993472,"score_gpt":0.25556000494617404,"score_spread":0.23506242704118058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415506783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19565123,0.008629605,0.786413,0.0001596378,0.0001693747,0.00033360464,0.0009471125,0.0028471642,0.004849202],"genre_scores_gemma":[0.56250304,0.0026594666,0.4323585,0.00006688353,0.00003786831,0.00013604363,0.000532351,0.0005046564,0.0012011597],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987293,0.0005053403,0.00016183601,0.00029102352,0.0002676135,0.00004491911],"domain_scores_gemma":[0.99562365,0.0028283142,0.00027602323,0.00044970625,0.0007560307,0.00006626402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014568925,0.0013534757,0.0009797147,0.0009614748,0.00024024444,0.0010680204,0.0011778628,0.00085718656,0.003576557],"category_scores_gemma":[0.0067441403,0.0004715761,0.00045619564,0.0008397596,0.00032761053,0.0012054794,0.0004538569,0.00031221999,0.001523314],"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.002618694,0.00021476348,0.0058324207,0.0020901246,0.00019660594,0.00039345547,0.00019865406,0.015883459,0.2985976,0.0008761669,0.0015586568,0.6715394],"study_design_scores_gemma":[0.00039801642,0.0070999716,0.035660286,0.00077264523,0.0019574217,0.0057296054,0.0010185285,0.27927566,0.65300816,0.004644886,0.0101304455,0.00030444813],"about_ca_topic_score_codex":0.00047629248,"about_ca_topic_score_gemma":0.0012970775,"teacher_disagreement_score":0.003576557,"about_ca_system_score_codex":0.00020130299,"about_ca_system_score_gemma":0.00051578705,"threshold_uncertainty_score":0.011964738},"labels":[],"label_agreement":null},{"id":"W4415507076","doi":"10.1007/978-3-032-08887-1_5","title":"When Does Naïve Evaluation Work for Datalog?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Datalog; Tuple; Set (abstract data type); Database query; Deductive database; Query language; Logic program; Boolean conjunctive query","score_opus":0.026913599170352364,"score_gpt":0.28186297101788155,"score_spread":0.2549493718475292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415507076","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.08365024,0.033480834,0.72639716,0.060511343,0.0073418934,0.0006683774,0.0028356004,0.022968702,0.06214581],"genre_scores_gemma":[0.66481036,0.0047642747,0.290236,0.009333283,0.004041487,0.00040990105,0.00284412,0.0059803436,0.017580215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9673953,0.015351476,0.0018269742,0.0040016677,0.009593951,0.0018306857],"domain_scores_gemma":[0.8658713,0.09695006,0.0020974055,0.016042033,0.016611192,0.0024279929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033662006,0.001526146,0.003794836,0.0031689089,0.0020079871,0.0075608976,0.003948586,0.004100416,0.00930799],"category_scores_gemma":[0.17259811,0.0012121426,0.0013905573,0.0027780607,0.0034693335,0.028786475,0.0034509301,0.0042396784,0.006711021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014427787,0.00047998718,0.015882166,0.0012162527,0.00034307028,0.00020019873,0.00057253055,0.009064906,0.0029875988,0.04558919,0.14258517,0.7796362],"study_design_scores_gemma":[0.0003705568,0.00070246536,0.007919311,0.0012305006,0.0002802626,0.00094850047,0.0018944059,0.30310285,0.010411599,0.60753936,0.06535462,0.00024567518],"about_ca_topic_score_codex":0.006502325,"about_ca_topic_score_gemma":0.009298484,"teacher_disagreement_score":0.033662006,"about_ca_system_score_codex":0.0023818328,"about_ca_system_score_gemma":0.0035325647,"threshold_uncertainty_score":0.17802382},"labels":[],"label_agreement":null},{"id":"W4415526236","doi":"10.1007/978-3-032-01823-6_1","title":"TIRE: Advancing Threat Intelligence Relation Extraction with a Novel Data-Centric Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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 Windsor","funders":"","keywords":"Relationship extraction; Pipeline (software); Relation (database); Adaptability; Representation (politics); Information extraction; Sentence; Key (lock)","score_opus":0.022579650970391676,"score_gpt":0.29608530086546436,"score_spread":0.2735056498950727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415526236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00412111,0.0017428456,0.95385075,0.00084702787,0.00020558557,0.00045778885,0.0058402964,0.02892679,0.004007857],"genre_scores_gemma":[0.036633078,0.000950062,0.9397313,0.0006948568,0.0001938839,0.0003084276,0.016576907,0.0008778801,0.00403367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963721,0.00039573055,0.00030819117,0.0010289525,0.0017121396,0.00018279898],"domain_scores_gemma":[0.99620456,0.0013718107,0.00031664802,0.0011850969,0.00077814446,0.00014383452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024185576,0.002224209,0.0019695538,0.008625931,0.0013834495,0.005321271,0.0033191799,0.0017154712,0.0054760533],"category_scores_gemma":[0.00844716,0.00093817234,0.0031159858,0.0059156124,0.0010644936,0.008072198,0.0055597024,0.0032382589,0.00619668],"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.00022572697,0.00050211477,0.0057890606,0.0013428602,0.00040174773,0.00046705434,0.00045764455,0.011237086,0.017257456,0.055041056,0.08477378,0.8225044],"study_design_scores_gemma":[0.00008872294,0.0002990066,0.004405801,0.00054225966,0.0005399328,0.0017741848,0.00055317127,0.54963917,0.03633888,0.18570513,0.21995525,0.00015842222],"about_ca_topic_score_codex":0.0043049194,"about_ca_topic_score_gemma":0.010098015,"teacher_disagreement_score":0.008625931,"about_ca_system_score_codex":0.0010802447,"about_ca_system_score_gemma":0.002613157,"threshold_uncertainty_score":0.01831925},"labels":[],"label_agreement":null},{"id":"W4415526238","doi":"10.1007/978-3-032-01823-6_5","title":"United We Log, Divided We Identify: A Decentralized Approach for Automated Log Analysis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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 Guelph","funders":"","keywords":"Single point of failure; Workload; Point (geometry); Safeguarding; Server; Information sensitivity; Parsing; Single point","score_opus":0.022631323117831458,"score_gpt":0.2855020527653433,"score_spread":0.26287072964751185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415526238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066770343,0.00009386356,0.9876788,0.0003760882,0.00004232409,0.00012016947,0.00018414645,0.0017546135,0.0030730248],"genre_scores_gemma":[0.31960523,0.00020594631,0.6694151,0.00026480408,0.00020417183,0.0003456891,0.0005559522,0.0007066472,0.008696418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537224,0.0017441482,0.00021876028,0.00083384174,0.0015617037,0.00026930872],"domain_scores_gemma":[0.9881557,0.005601631,0.0007800499,0.0038357105,0.0012902557,0.00033670597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00338498,0.0008047102,0.0012195853,0.0024872548,0.0018985972,0.00413176,0.0021823975,0.0011526928,0.0045414055],"category_scores_gemma":[0.015236504,0.0008742998,0.000952262,0.0019163286,0.0022587047,0.0063484376,0.004627627,0.002473223,0.0018427443],"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.0005584509,0.0004676697,0.007021324,0.0002961528,0.00013896958,0.00045163464,0.0014774026,0.059607293,0.009942976,0.37335673,0.021930557,0.52475077],"study_design_scores_gemma":[0.000051758696,0.00007158371,0.0009610761,0.0000527726,0.00006757531,0.00027085823,0.00032565044,0.6008211,0.0052455813,0.3798434,0.012231695,0.00005694945],"about_ca_topic_score_codex":0.0027262333,"about_ca_topic_score_gemma":0.004991798,"teacher_disagreement_score":0.0045414055,"about_ca_system_score_codex":0.0011174801,"about_ca_system_score_gemma":0.0030751666,"threshold_uncertainty_score":0.017901659},"labels":[],"label_agreement":null},{"id":"W4415549799","doi":"10.1007/978-3-032-08707-2_14","title":"Solution-Aware Vs Global ReLU Selection: Partial MILP Strikes Back for DNN Verification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","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":"Canada Research Chairs; University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Binary number; Set (abstract data type); Lipschitz continuity; Binary decision diagram; Upper and lower bounds; Branching (polymer chemistry); Branch and bound; Deep neural networks","score_opus":0.017369423961441664,"score_gpt":0.27471014161536356,"score_spread":0.2573407176539219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415549799","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.020390399,0.0005518978,0.96177596,0.0013286936,0.0003559855,0.00011410091,0.0001441536,0.00219267,0.013146249],"genre_scores_gemma":[0.64457965,0.0002448797,0.34548575,0.0010024817,0.000167255,0.00017355448,0.0003500281,0.00087820506,0.0071181157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979672,0.00086420565,0.000078257406,0.00033548573,0.0004951465,0.00025961787],"domain_scores_gemma":[0.99569654,0.002556933,0.0001628835,0.0010114654,0.00041064058,0.00016149975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035760202,0.0016870525,0.0014057384,0.0005218606,0.0008611181,0.001846076,0.0020601922,0.0021070503,0.011147146],"category_scores_gemma":[0.01155345,0.0007481224,0.001092484,0.00042093938,0.001836532,0.0033013362,0.003578954,0.0037475864,0.0014720192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050107134,0.00013490231,0.0006132321,0.0002741228,0.00011748437,0.00018672172,0.000100140416,0.692955,0.0053226347,0.10132263,0.011667465,0.1868046],"study_design_scores_gemma":[0.000021118349,0.000051971725,0.00004010464,0.000028408549,0.000012691018,0.000023238936,0.000024564857,0.94514924,0.0015752371,0.05217534,0.0008916525,0.000006439762],"about_ca_topic_score_codex":0.0018318327,"about_ca_topic_score_gemma":0.0044777635,"teacher_disagreement_score":0.011147146,"about_ca_system_score_codex":0.001099111,"about_ca_system_score_gemma":0.002807761,"threshold_uncertainty_score":0.03729093},"labels":[],"label_agreement":null},{"id":"W4415603522","doi":"10.1007/978-3-032-08557-3_6","title":"Towards Fast-Slow Thinking in Conversational Emotion Recognition via Causal Prompting with Peak-End Rule","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Novelis (Canada)","funders":"","keywords":"Utterance; Conversation; Context (archaeology); Causal model; Neglect; Language understanding; Causal reasoning","score_opus":0.024960206346841568,"score_gpt":0.2733685431517538,"score_spread":0.24840833680491223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415603522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015371734,0.00026847734,0.97413063,0.00016331111,0.00016141032,0.00013257423,0.00012241869,0.0061919326,0.003457522],"genre_scores_gemma":[0.32409412,0.00021190566,0.66955453,0.00034326376,0.00013759475,0.0002621119,0.00038112947,0.0006541213,0.0043612113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987489,0.000492179,0.000070046735,0.00036589874,0.00020910577,0.000113872644],"domain_scores_gemma":[0.99603444,0.0028080575,0.00010704533,0.00044398004,0.00045178662,0.00015458484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021716603,0.0007335435,0.000975865,0.0004963372,0.00045833868,0.0018661054,0.0014952581,0.0010307448,0.008447232],"category_scores_gemma":[0.0065553994,0.0003893829,0.00045934753,0.00047211017,0.00071685517,0.0024301636,0.0012854402,0.002190512,0.0036086964],"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.0012228303,0.00034550193,0.0008958788,0.00015689305,0.00004494885,0.00008838407,0.00031983448,0.006451798,0.05313925,0.013764079,0.0053791734,0.91819143],"study_design_scores_gemma":[0.00011264731,0.00024303778,0.0013117258,0.000052152125,0.00006934534,0.00015358577,0.00018020516,0.86755216,0.06279272,0.061946433,0.0055345614,0.000051470997],"about_ca_topic_score_codex":0.0017911369,"about_ca_topic_score_gemma":0.001809433,"teacher_disagreement_score":0.008447232,"about_ca_system_score_codex":0.00035111947,"about_ca_system_score_gemma":0.0008135639,"threshold_uncertainty_score":0.0282588},"labels":[],"label_agreement":null},{"id":"W4415637994","doi":"10.1007/978-3-032-09530-5_18","title":"COTTAS: Columnar Triple Table Storage for Efficient and Compressed RDF Management","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"RDF; SPARQL; SQL; Table (database); Python (programming language); RDF/XML; RDF Schema; Data structure","score_opus":0.013655828376266237,"score_gpt":0.24013582095584002,"score_spread":0.22647999257957377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415637994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016855447,0.0023350262,0.7078369,0.001661838,0.002080963,0.0005531581,0.058552686,0.17570305,0.034420945],"genre_scores_gemma":[0.2109022,0.002757838,0.5498857,0.0020711685,0.00066706847,0.001119402,0.13008815,0.032902587,0.069605924],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987275,0.00014258978,0.0001600528,0.00020471399,0.0006210907,0.00014409954],"domain_scores_gemma":[0.9962907,0.00070765143,0.00016196394,0.0018725995,0.00077701476,0.00019009614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013041805,0.0011787916,0.0010301351,0.0025563184,0.0012113872,0.0049901763,0.003331841,0.0010923934,0.046967853],"category_scores_gemma":[0.006246629,0.0010647912,0.0010274652,0.006139733,0.0009916311,0.0069293296,0.0037615234,0.0018951533,0.015935797],"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.001386135,0.00017325704,0.0010704888,0.000818632,0.00014468357,0.0003686694,0.0005449189,0.0061180843,0.021794772,0.09213163,0.49261662,0.38283205],"study_design_scores_gemma":[0.0004867337,0.00017473685,0.0010452365,0.00052516506,0.00019614163,0.00065458246,0.00081787974,0.13730982,0.10306353,0.19111164,0.5642849,0.0003295059],"about_ca_topic_score_codex":0.01027503,"about_ca_topic_score_gemma":0.015613492,"teacher_disagreement_score":0.046967853,"about_ca_system_score_codex":0.0018039596,"about_ca_system_score_gemma":0.003175231,"threshold_uncertainty_score":0.15712315},"labels":[],"label_agreement":null},{"id":"W4415655710","doi":"10.1007/978-3-032-08970-0_8","title":"Simulating Inter-observer Variability Across Clinical Experience Levels for Brain Tumour Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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":"Hotchkiss Brain Institute; Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Annotation; Segmentation; Trustworthiness; Deep learning; Image segmentation; Observer (physics)","score_opus":0.23510157204858098,"score_gpt":0.502204069754961,"score_spread":0.26710249770638006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415655710","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.84541345,0.0002518115,0.1518517,0.00013803737,0.00007884193,0.00008192198,0.00043789606,0.0005913012,0.0011551993],"genre_scores_gemma":[0.97925764,0.00004552815,0.019031174,0.000036329024,0.000012323395,0.000054739023,0.00043719844,0.0000931931,0.001031867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990313,0.00043483925,0.000047294154,0.00023195539,0.00014800644,0.00010656214],"domain_scores_gemma":[0.98189986,0.01584485,0.0004401677,0.00069222547,0.00092314027,0.00019972232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024237703,0.00045187457,0.0004556324,0.00043737068,0.00018359226,0.0007631857,0.00076029013,0.0011199116,0.0011847138],"category_scores_gemma":[0.013842244,0.00037272563,0.00084607507,0.00039479966,0.00041248067,0.00045031516,0.00065468386,0.000693356,0.000308361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028633852,0.0005455577,0.027367719,0.00019404081,0.00037226587,0.00030250775,0.0012118835,0.8309252,0.024781728,0.001263483,0.001980879,0.10819138],"study_design_scores_gemma":[0.000027882304,0.0002479146,0.011436598,0.000010129321,0.000053056086,0.00009064996,0.00007696687,0.9827574,0.0044054645,0.0006859586,0.00018232562,0.00002554426],"about_ca_topic_score_codex":0.0074108667,"about_ca_topic_score_gemma":0.006298972,"teacher_disagreement_score":0.0074108667,"about_ca_system_score_codex":0.00065511605,"about_ca_system_score_gemma":0.0005011131,"threshold_uncertainty_score":0.01473546},"labels":[],"label_agreement":null},{"id":"W4415686200","doi":"10.1007/978-3-032-09527-5_19","title":"Graph Querying or Similarity Search? Both!","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Graph; Similarity (geometry); Graph database; Semantic similarity; Knowledge graph; sort; Similitude; Clique-width","score_opus":0.02179112356671124,"score_gpt":0.2617235394994741,"score_spread":0.23993241593276285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415686200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007808077,0.12882906,0.38067618,0.16283494,0.016983585,0.0001423821,0.0022491722,0.0056583267,0.29481825],"genre_scores_gemma":[0.16025037,0.09956154,0.2995181,0.047354553,0.020860538,0.00034161392,0.0042730565,0.004626696,0.36321366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979438,0.0006219581,0.00011033974,0.00046540544,0.0007006831,0.00015771078],"domain_scores_gemma":[0.9958157,0.002003333,0.00016456691,0.0011566847,0.0006176921,0.00024207492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022617283,0.0009308307,0.0016959372,0.0022177505,0.0011609758,0.0062249694,0.0021680077,0.004528593,0.045936856],"category_scores_gemma":[0.015268403,0.000713092,0.00097007304,0.005240318,0.0035501332,0.036192916,0.0039495802,0.0038755417,0.023506705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012891533,0.000086405744,0.00040620772,0.00060496264,0.000042323616,0.000075596865,0.00020097103,0.00074768456,0.0009988288,0.3861862,0.3085931,0.30192882],"study_design_scores_gemma":[0.00002241391,0.000044985954,0.0002821437,0.00028693138,0.00003082603,0.00049331295,0.00037223773,0.005397298,0.00093515165,0.6347172,0.35737282,0.000044595447],"about_ca_topic_score_codex":0.0022774118,"about_ca_topic_score_gemma":0.0023684495,"teacher_disagreement_score":0.045936856,"about_ca_system_score_codex":0.0011133936,"about_ca_system_score_gemma":0.0010069165,"threshold_uncertainty_score":0.15367407},"labels":[],"label_agreement":null},{"id":"W4415688386","doi":"10.1007/978-3-032-08124-7_29","title":"Efficient Dynamic Group Signatures with Forward Security","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Revocation; Group signature; Traceability; Forward secrecy; Scheme (mathematics); Signature (topology); Key (lock)","score_opus":0.004572619815887189,"score_gpt":0.21835797903848256,"score_spread":0.21378535922259537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415688386","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.021918496,0.0011077299,0.9143485,0.0012482092,0.00051404705,0.00020557737,0.00046202398,0.0026521524,0.057543263],"genre_scores_gemma":[0.46483055,0.0014879759,0.41956657,0.00061246805,0.0005110939,0.00036789163,0.001552712,0.00088419084,0.110186554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817634,0.00026824957,0.00008331551,0.00021430614,0.0009549316,0.0003028745],"domain_scores_gemma":[0.9986891,0.0003429268,0.00005886822,0.00069369376,0.00016889133,0.000046558118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008369835,0.0010475727,0.0011226941,0.0009922062,0.001104788,0.002339153,0.0014148733,0.0013035598,0.014211659],"category_scores_gemma":[0.0019955349,0.0006316903,0.0007095896,0.0016577021,0.0013294695,0.0061014933,0.0047966144,0.0024717213,0.0075515066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006251044,0.00022104548,0.00018472644,0.00025838855,0.0000398994,0.00015636258,0.00018972562,0.020775167,0.0268501,0.5301211,0.023235397,0.39734307],"study_design_scores_gemma":[0.00014147417,0.00017430636,0.00012621708,0.000071891576,0.000044817476,0.0005308376,0.000095893054,0.08043097,0.0500468,0.7890477,0.07923744,0.000051663472],"about_ca_topic_score_codex":0.00022510964,"about_ca_topic_score_gemma":0.00032517005,"teacher_disagreement_score":0.014211659,"about_ca_system_score_codex":0.0012212982,"about_ca_system_score_gemma":0.0013062714,"threshold_uncertainty_score":0.04754275},"labels":[],"label_agreement":null},{"id":"W4415688413","doi":"10.1007/978-3-032-08124-7_30","title":"Zero Trust Continuous Authentication Models and Automated Policy Formulation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Access Control and Trust","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 Calgary","funders":"","keywords":"Usability; Access control; Authentication (law); Privilege (computing); Encoding (memory); Session (web analytics); Insider; Zero-knowledge proof","score_opus":0.016974803536352626,"score_gpt":0.29773711682254733,"score_spread":0.2807623132861947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415688413","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.0045926296,0.00021703607,0.98584634,0.00078064646,0.000083040715,0.00003954262,0.00008062165,0.00017855334,0.008181647],"genre_scores_gemma":[0.68108284,0.0007232495,0.29090756,0.00036758234,0.00034433778,0.00036792975,0.00029766205,0.00017298233,0.02573587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657565,0.0016572993,0.00016286585,0.00047773094,0.0008194953,0.0003068776],"domain_scores_gemma":[0.98924786,0.007839218,0.00055844017,0.0012319906,0.0008522824,0.00027024763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003874285,0.00096962595,0.00125166,0.0007847721,0.0009010848,0.004525213,0.00285508,0.0024849407,0.007870777],"category_scores_gemma":[0.0137328105,0.0010616002,0.0014234675,0.0012076849,0.003935078,0.00736805,0.0028137995,0.006087355,0.0012347326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042175852,0.000031370302,0.00006851408,0.00004512432,0.000014315768,0.000040997,0.00010138401,0.08035937,0.00028934053,0.90595883,0.0019773282,0.011071297],"study_design_scores_gemma":[0.000011638822,0.000011552941,0.000020986174,0.000011751381,0.0000070529095,0.000012188358,0.000023025977,0.40554565,0.00019906524,0.59284997,0.0012964372,0.000010662086],"about_ca_topic_score_codex":0.0035799348,"about_ca_topic_score_gemma":0.0028499055,"teacher_disagreement_score":0.007870777,"about_ca_system_score_codex":0.0030890412,"about_ca_system_score_gemma":0.0020920865,"threshold_uncertainty_score":0.026330352},"labels":[],"label_agreement":null},{"id":"W4415720697","doi":"10.1007/978-3-032-06744-9_10","title":"FedMod: Vertical Federated Learning Using Multi-server Secret Sharing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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 Windsor","funders":"","keywords":"Scalability; Homomorphic encryption; Secret sharing; Federated learning; Server; Overhead (engineering); Secure multi-party computation; Cryptography","score_opus":0.04876404769250915,"score_gpt":0.2930846977695932,"score_spread":0.2443206500770841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415720697","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.01378941,0.00021644983,0.968153,0.00019913157,0.00014783375,0.00013613176,0.00027118303,0.012048863,0.0050380146],"genre_scores_gemma":[0.47926456,0.0002880031,0.49767372,0.00031317124,0.00009900631,0.0002477645,0.0013927585,0.0007808369,0.01994014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998569,0.00026500112,0.000084312276,0.00027925332,0.0005205415,0.00028186015],"domain_scores_gemma":[0.99847966,0.0002874372,0.000065931665,0.00090820034,0.00015632786,0.000102451166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017141552,0.0006181838,0.0010044723,0.0007092174,0.0010652925,0.0023177478,0.002443631,0.0012773138,0.0076281778],"category_scores_gemma":[0.0026693041,0.0004292811,0.00082474377,0.0011289776,0.0009602495,0.0048501506,0.0050558276,0.0019326849,0.0022885893],"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.0014945249,0.00080192386,0.0013204018,0.0001965418,0.00016836655,0.00024873854,0.00020693093,0.08084902,0.014543114,0.11656913,0.02891906,0.7546822],"study_design_scores_gemma":[0.0001179459,0.00019505667,0.000481446,0.00004499955,0.00003573465,0.00040569413,0.0000747861,0.8061536,0.028994914,0.13858384,0.024854215,0.00005771096],"about_ca_topic_score_codex":0.0016960704,"about_ca_topic_score_gemma":0.0015075317,"teacher_disagreement_score":0.0076281778,"about_ca_system_score_codex":0.0011416086,"about_ca_system_score_gemma":0.0020612148,"threshold_uncertainty_score":0.025518775},"labels":[],"label_agreement":null},{"id":"W4415723813","doi":"10.1007/978-3-032-03705-3_20","title":"Dimensionality-Based Evaluation of Fuzzy Models Developed for High-Dimensional Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Curse of dimensionality; Fuzzy logic; Dimensionality reduction; Fuzzy clustering; Feature (linguistics); Partition (number theory); Histogram; Generalization","score_opus":0.07446368167323342,"score_gpt":0.30933855442871083,"score_spread":0.23487487275547742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415723813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028033696,0.00070130837,0.96944124,0.00009423137,0.00005668262,0.00005335347,0.00010498804,0.00021722517,0.0012973414],"genre_scores_gemma":[0.58816385,0.00095725904,0.4084369,0.00006820366,0.00009591282,0.00018068372,0.0005010582,0.000115669995,0.0014804914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998214,0.00076825474,0.00015001651,0.00013527359,0.0006655422,0.000066933484],"domain_scores_gemma":[0.9964133,0.0018561459,0.00026133834,0.0003933392,0.0009912198,0.00008471567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038212186,0.0007235152,0.0013530357,0.0014644057,0.00044022547,0.0019350447,0.00070485927,0.00081821694,0.0009901744],"category_scores_gemma":[0.010207657,0.00030433058,0.0011218217,0.0010826282,0.00050302455,0.0017968195,0.0010457898,0.0008029814,0.00021581727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025530942,0.00010230533,0.0031090442,0.0003335886,0.00026896835,0.00014871375,0.00022407809,0.72802764,0.011647508,0.04411223,0.0019580286,0.2098127],"study_design_scores_gemma":[0.0000023306459,0.00004648529,0.00041544414,0.0000129677,0.000016570762,0.000037914146,0.00001547353,0.99156624,0.0015723013,0.005956675,0.00034765957,0.0000099883655],"about_ca_topic_score_codex":0.0016084098,"about_ca_topic_score_gemma":0.0014676228,"teacher_disagreement_score":0.0038212186,"about_ca_system_score_codex":0.0011539601,"about_ca_system_score_gemma":0.00070212357,"threshold_uncertainty_score":0.020208776},"labels":[],"label_agreement":null},{"id":"W4415725492","doi":"10.1007/978-3-032-03711-4_17","title":"Application of Adaptive PSO Algorithm in Design of FIR Filters","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Finite impulse response; Particle swarm optimization; Adaptive filter; Inertia; Impulse (physics); Infinite impulse response; Range (aeronautics); Digital filter","score_opus":0.014606809223963528,"score_gpt":0.23759059045504066,"score_spread":0.22298378123107712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415725492","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.0033820302,0.0006922096,0.9915072,0.000037257683,0.000066967776,0.000014950356,0.0000067054016,0.00013682875,0.004155847],"genre_scores_gemma":[0.2069092,0.0017664712,0.7822364,0.00007518016,0.00010090312,0.00010411783,0.00007208195,0.00008444925,0.00865113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989617,0.00003319209,0.0000059959953,0.0000218264,0.00003489346,0.000007919546],"domain_scores_gemma":[0.9998628,0.00007206206,0.000008186196,0.000011002134,0.0000409539,0.00000489595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024689836,0.00041151742,0.00044982458,0.00027968892,0.00020656364,0.00045074956,0.00038522942,0.0006105906,0.002338155],"category_scores_gemma":[0.00062936737,0.00022738587,0.00046662518,0.00045963787,0.00021851064,0.00028928,0.0002550937,0.0004732643,0.00055643957],"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.00009148954,0.0000747742,0.00060891494,0.00032539343,0.00009029457,0.00015783691,0.00011690368,0.4722428,0.029087348,0.016220529,0.0029045248,0.4780792],"study_design_scores_gemma":[0.000007174701,0.000053091575,0.0002249093,0.00001893831,0.000014010296,0.000063392734,0.000009999023,0.99121195,0.0031080504,0.0017131848,0.003569421,0.000005930522],"about_ca_topic_score_codex":0.001241228,"about_ca_topic_score_gemma":0.0012478491,"teacher_disagreement_score":0.002338155,"about_ca_system_score_codex":0.00014286004,"about_ca_system_score_gemma":0.00025589904,"threshold_uncertainty_score":0.007821858},"labels":[],"label_agreement":null},{"id":"W4415749662","doi":"10.1007/978-3-032-09645-6_4","title":"Computation of Stirling Numbers for Complex Arguments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Stirling number; Stirling numbers of the first kind; Stirling numbers of the second kind; Computation; Stirling engine; Numerical integration; Algebra over a field; Numerical analysis","score_opus":0.06454148847039791,"score_gpt":0.33975947774895954,"score_spread":0.2752179892785616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0793236,0.0029108762,0.6867697,0.0005826968,0.0008270008,0.000083426195,0.0004809704,0.0015183133,0.22750337],"genre_scores_gemma":[0.5047957,0.0020177753,0.39427835,0.00021273879,0.00034087565,0.0001251721,0.0009977177,0.0013052005,0.09592648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996043,0.000067489425,0.000026686592,0.00007180897,0.00017727862,0.000052485833],"domain_scores_gemma":[0.9990613,0.0005705433,0.00005070978,0.00013512745,0.00012965582,0.00005258781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652824,0.0011180451,0.00094411336,0.002789998,0.0010177594,0.004176836,0.0013242629,0.0008026475,0.020404885],"category_scores_gemma":[0.004845444,0.0006003905,0.0010741927,0.0019129317,0.0016926506,0.0047364184,0.0013954452,0.0017774994,0.004994691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005927987,0.0000142418285,0.00021563531,0.00016555013,0.000012607301,0.0000775488,0.00013266118,0.0038824684,0.003186379,0.942228,0.003575204,0.04645044],"study_design_scores_gemma":[0.000012557183,0.000020370544,0.00025131664,0.00009431028,0.000017071823,0.00020873663,0.00007164211,0.033009324,0.0061981427,0.937131,0.022947373,0.000038297483],"about_ca_topic_score_codex":0.00042032334,"about_ca_topic_score_gemma":0.0010607206,"teacher_disagreement_score":0.020404885,"about_ca_system_score_codex":0.0013921765,"about_ca_system_score_gemma":0.00069908256,"threshold_uncertainty_score":0.06826109},"labels":[],"label_agreement":null},{"id":"W4415749759","doi":"10.1007/978-3-032-09645-6_20","title":"Parallel Computation of the Power Series Solutions to Linear Ordinary Differential Equations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Western University","funders":"","keywords":"Ordinary differential equation; Power series; Speedup; Computation; Series (stratigraphy); Linear algebra; Code (set theory); Polynomial; Differential equation","score_opus":0.01831064232261277,"score_gpt":0.24993763101889016,"score_spread":0.2316269886962774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20470476,0.0007421681,0.72115296,0.00054957275,0.00042564026,0.00008592755,0.00040897762,0.0034399994,0.06849001],"genre_scores_gemma":[0.7576545,0.0004651174,0.21423885,0.00012993999,0.00017829423,0.00010046204,0.0006501779,0.0006524677,0.025930218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976176,0.000048158392,0.000015862577,0.000040412975,0.00009415809,0.000039672348],"domain_scores_gemma":[0.9994777,0.00026345282,0.000027867047,0.00011116797,0.000092475435,0.000027360908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042176843,0.0006938725,0.0008491498,0.00064651686,0.00060138124,0.0013198296,0.00091223296,0.0004436913,0.012236549],"category_scores_gemma":[0.0019334292,0.00034135525,0.00060519285,0.001118735,0.00062752585,0.001653167,0.00095907046,0.000654569,0.0018026198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091412617,0.00021580128,0.002002496,0.0005091551,0.00014332357,0.00054238003,0.00040297958,0.2314912,0.020728005,0.35444406,0.018692937,0.3699136],"study_design_scores_gemma":[0.00007833929,0.000043471966,0.00032772563,0.000018047667,0.000033150733,0.0001078336,0.000070142094,0.75793695,0.009615963,0.22534955,0.0064049712,0.000013825477],"about_ca_topic_score_codex":0.0013552138,"about_ca_topic_score_gemma":0.0027581614,"teacher_disagreement_score":0.012236549,"about_ca_system_score_codex":0.0006864085,"about_ca_system_score_gemma":0.0005844666,"threshold_uncertainty_score":0.040935278},"labels":[],"label_agreement":null},{"id":"W4415749762","doi":"10.1007/978-3-032-09645-6_16","title":"Software Portability for Computer Algebra","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 Waterloo","funders":"","keywords":"Software portability; Axiom; Software; Software system; Software development; Meaning (existential); Software construction","score_opus":0.01912915398348664,"score_gpt":0.25147213563109483,"score_spread":0.2323429816476082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749762","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011675916,0.0051860996,0.7698536,0.0026443861,0.00088346034,0.000079596626,0.00039236603,0.0022797075,0.20700483],"genre_scores_gemma":[0.5329382,0.008068693,0.3252519,0.0011820743,0.002517743,0.000379047,0.0015721756,0.0021924844,0.12589766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991536,0.00023673417,0.000071332215,0.00018010782,0.0002827013,0.000075548334],"domain_scores_gemma":[0.99844164,0.0007516386,0.00006143609,0.0005589269,0.00013485883,0.00005150036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011347586,0.0008055818,0.00087947847,0.00109973,0.0010725684,0.0032617052,0.0014221151,0.0008074525,0.024104133],"category_scores_gemma":[0.0033064163,0.00076835445,0.001551833,0.0017359838,0.0030577644,0.008615947,0.0023724018,0.0055367844,0.0047329264],"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.0000118987,0.000014609463,0.000051562267,0.000063553576,0.0000074347904,0.000025752151,0.00010151214,0.0009633059,0.0003702719,0.9651208,0.004471798,0.028797487],"study_design_scores_gemma":[0.000003079223,0.00000380221,0.000030269215,0.000013336012,0.0000032505216,0.000030586234,0.000010281829,0.0022255906,0.00025513204,0.9854028,0.012018414,0.000003553939],"about_ca_topic_score_codex":0.00068172376,"about_ca_topic_score_gemma":0.00057943386,"teacher_disagreement_score":0.024104133,"about_ca_system_score_codex":0.0012686248,"about_ca_system_score_gemma":0.000557929,"threshold_uncertainty_score":0.08063638},"labels":[],"label_agreement":null},{"id":"W4415749767","doi":"10.1007/978-3-032-09645-6_1","title":"A Failure Probability Analysis of a Modular Algorithm to Compute the Monic GCD of Multivariate Polynomials over Algebraic Number Fields $${\\mathbb {Q}(\\alpha _1,\\ldots ,\\alpha _n)}$$","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Algebraic number; Finite field; Modulo; Modular design; Modular arithmetic; Interpolation (computer graphics); Field (mathematics)","score_opus":0.009529869293530412,"score_gpt":0.252465466909394,"score_spread":0.24293559761586356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749767","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.10567674,0.0017015102,0.8758538,0.0022217203,0.00023159823,0.00023940977,0.0004391154,0.0016103077,0.0120258415],"genre_scores_gemma":[0.8537996,0.0013371652,0.12872078,0.0005274218,0.0009624298,0.0004802425,0.0008419107,0.0006361534,0.012694367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99388427,0.0019060766,0.00027271447,0.0010803553,0.0020262005,0.0008302561],"domain_scores_gemma":[0.9227876,0.06113306,0.0036897277,0.0064739147,0.0042537395,0.00166193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010588113,0.002065423,0.002380351,0.0034807571,0.0016578434,0.0038359019,0.004406244,0.0024337694,0.00801583],"category_scores_gemma":[0.066015445,0.0010330383,0.0019402936,0.0027749976,0.004138916,0.006087205,0.0040538544,0.0034835797,0.0017485913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016725573,0.00031621108,0.015269757,0.0005676963,0.00029491354,0.00034716047,0.000533548,0.40336755,0.008330411,0.42845452,0.014991696,0.12585397],"study_design_scores_gemma":[0.000050313804,0.00013158709,0.0010567221,0.000052307398,0.00008137395,0.00023116443,0.000052375384,0.93130904,0.0020900415,0.06399869,0.00090984826,0.000036553865],"about_ca_topic_score_codex":0.0019393602,"about_ca_topic_score_gemma":0.0014396954,"teacher_disagreement_score":0.010588113,"about_ca_system_score_codex":0.0037348613,"about_ca_system_score_gemma":0.0036470403,"threshold_uncertainty_score":0.05599594},"labels":[],"label_agreement":null},{"id":"W4415749773","doi":"10.1007/978-3-032-09645-6_13","title":"A New Black Box GCD Algorithm Using Hensel Lifting","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Greatest common divisor; Black box; Function (biology); Factorization; Representation (politics); Interpolation (computer graphics); Efficient algorithm; Bivariate analysis","score_opus":0.016292755323527166,"score_gpt":0.2491867639732643,"score_spread":0.23289400864973714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749773","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.05283721,0.0007103812,0.9189134,0.0003673713,0.0008874563,0.00020284351,0.000273468,0.0048737186,0.020934194],"genre_scores_gemma":[0.15584697,0.00037892326,0.82578987,0.00024173364,0.00030764245,0.0001634716,0.0007905034,0.00063240546,0.015848484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926263,0.00009020888,0.000058527978,0.00020990822,0.00026033045,0.0001185216],"domain_scores_gemma":[0.99945575,0.000106915504,0.000040262446,0.0001970395,0.00012656866,0.00007351342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051704346,0.00093034,0.0014474171,0.001512049,0.0012591388,0.0018114556,0.0012677382,0.000812796,0.015090647],"category_scores_gemma":[0.0014410788,0.0004977569,0.0007953282,0.0024284858,0.00073976186,0.0031909312,0.0028983888,0.0014113904,0.0053686937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078508916,0.0002589164,0.0008049466,0.00030215897,0.00006978177,0.0003772811,0.0002205852,0.007281028,0.043611452,0.091769,0.0214881,0.83303165],"study_design_scores_gemma":[0.0010937599,0.0012785372,0.0019629025,0.00020399252,0.00027378113,0.0034151408,0.00043304937,0.33488882,0.1127709,0.36265495,0.18070284,0.00032139663],"about_ca_topic_score_codex":0.0005196475,"about_ca_topic_score_gemma":0.00067877857,"teacher_disagreement_score":0.015090647,"about_ca_system_score_codex":0.00049036916,"about_ca_system_score_gemma":0.0011709777,"threshold_uncertainty_score":0.050483227},"labels":[],"label_agreement":null},{"id":"W4415749919","doi":"10.1007/978-3-032-03708-4_24","title":"Invariant Aircraft Recognition with Fourier and Dual-Tree Complex Wavelet Features","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced SAR Imaging Techniques","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":"Concordia University","funders":"","keywords":"Fourier transform; Rotation (mathematics); Invariant (physics); Scaling; Translation (biology); Wavelet; Pattern recognition (psychology); Scale invariance; Noise (video)","score_opus":0.014236521032395106,"score_gpt":0.22885581578554598,"score_spread":0.21461929475315086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042009827,0.0006677374,0.95025223,0.000109297645,0.00014693417,0.000020131007,0.00017162069,0.0006963762,0.005925868],"genre_scores_gemma":[0.4022751,0.0013823481,0.57795715,0.00013173015,0.00021101562,0.000044746277,0.0011438843,0.00034558657,0.016508507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982697,0.000014667832,0.0000096624735,0.000032412045,0.00009034448,0.000026040034],"domain_scores_gemma":[0.9997298,0.000058535858,0.000032435735,0.0000746023,0.000086493565,0.00001813168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019594467,0.0003355524,0.00042356423,0.00082746707,0.00011863832,0.0008660244,0.00041726205,0.00045555335,0.002108033],"category_scores_gemma":[0.00079369545,0.00021777935,0.00045941235,0.00089695386,0.00027930838,0.0010314712,0.00045672583,0.0005784128,0.0015460625],"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.00022335968,0.000084755295,0.00073478103,0.000086183805,0.000024691462,0.00012083457,0.000042030682,0.014598394,0.16393842,0.016840236,0.0041065114,0.7991998],"study_design_scores_gemma":[0.000022160986,0.00020939113,0.0052013826,0.000033502707,0.000059286078,0.001152942,0.00005957843,0.8654669,0.095812164,0.017185595,0.014747802,0.000049355527],"about_ca_topic_score_codex":0.00043346846,"about_ca_topic_score_gemma":0.00057493435,"teacher_disagreement_score":0.002108033,"about_ca_system_score_codex":0.00017217152,"about_ca_system_score_gemma":0.00017911897,"threshold_uncertainty_score":0.007052064},"labels":[],"label_agreement":null},{"id":"W4415777035","doi":"10.1007/978-3-032-10156-3_8","title":"Temporal Analysis of User Engagement, Technology Trends and Emotional Dynamics on Stack Overflow","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision 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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Dynamics (music); Reputation; Confusion; Admiration; Stack (abstract data type); Phenomenon","score_opus":0.08902650501122816,"score_gpt":0.3740679730782206,"score_spread":0.28504146806699243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415777035","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.99745613,0.00006119445,0.00060036744,0.00002961313,0.0000041731723,0.000009757572,0.00033758883,0.000025030724,0.0014762067],"genre_scores_gemma":[0.99865377,0.00004057441,0.00036444084,0.000005984731,0.000006225456,0.000011229699,0.00039368524,0.000007999982,0.0005161294],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99980193,0.000037677088,0.000013649889,0.000032570435,0.00007135326,0.000042729254],"domain_scores_gemma":[0.9977639,0.0014005778,0.00033906772,0.00007127201,0.0002603983,0.00016482126],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.00038262186,0.00014662942,0.00018607065,0.0013108336,0.00043456382,0.0008499913,0.00022102975,0.00029828248,0.0027147918],"category_scores_gemma":[0.003328092,0.00011410976,0.00018476254,0.0015172526,0.00022106728,0.0009894477,0.0005856418,0.00037166578,0.00042164864],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015403278,0.0004172611,0.84422135,0.00027881717,0.00013400077,0.0009364678,0.00943312,0.004805129,0.03051048,0.0030861471,0.0026804782,0.10195649],"study_design_scores_gemma":[0.000005201418,0.0001914464,0.9704902,0.000031299176,0.00004226221,0.00016102166,0.004223683,0.020194089,0.002283408,0.0007885045,0.0015636185,0.000025388117],"about_ca_topic_score_codex":0.004336811,"about_ca_topic_score_gemma":0.0063381377,"teacher_disagreement_score":0.9986892,"about_ca_system_score_codex":0.00033246257,"about_ca_system_score_gemma":0.00020081968,"threshold_uncertainty_score":0.0090818405},"labels":[],"label_agreement":null},{"id":"W4415947615","doi":"10.1007/978-3-032-10489-2_36","title":"Evaluating AI Agents for Cyber Defense: A Comparison of Deep Reinforcement Learning and LLM Approaches","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Adaptability; Curiosity; Robustness (evolution); Transparency (behavior); Autonomous agent; Intelligent agent; Deep learning","score_opus":0.06335727882812493,"score_gpt":0.3479322205925678,"score_spread":0.28457494176444287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415947615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3612482,0.006593235,0.5933836,0.003151843,0.00041755635,0.0004535753,0.00040445526,0.0027975268,0.03154999],"genre_scores_gemma":[0.93572426,0.00044183343,0.060728878,0.00019831791,0.000060349936,0.00008236987,0.00018404645,0.00010372437,0.0024762792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979031,0.0011888,0.00008372116,0.00020551837,0.000446333,0.00017247364],"domain_scores_gemma":[0.98555875,0.01132251,0.00073754374,0.0008523017,0.0010723699,0.00045644035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005873733,0.0011095549,0.0012501201,0.0009755791,0.0003527097,0.0014394466,0.0019897032,0.0019932333,0.0030108087],"category_scores_gemma":[0.0141279055,0.00036220814,0.0003765092,0.00056346477,0.0009798589,0.0023219471,0.0017632524,0.0017874364,0.00041997188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005834443,0.00026476945,0.0027319458,0.00019708501,0.00010997631,0.00002669472,0.000042226653,0.880007,0.0007058492,0.0075872266,0.001804969,0.10593877],"study_design_scores_gemma":[0.000013259979,0.00006287621,0.00014922171,0.000008598885,0.000006375953,0.000003794572,0.0000068111513,0.99719393,0.00021035028,0.002178631,0.00016350225,0.0000025595682],"about_ca_topic_score_codex":0.005133568,"about_ca_topic_score_gemma":0.0053277663,"teacher_disagreement_score":0.005873733,"about_ca_system_score_codex":0.0023262813,"about_ca_system_score_gemma":0.0017425831,"threshold_uncertainty_score":0.031063676},"labels":[],"label_agreement":null},{"id":"W4416067597","doi":"10.1007/978-981-95-4395-3_10","title":"DExNet: Combining Observations of Domain Adapted Critics for Leaf Disease Classification with Limited Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","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":"Queen's University","funders":"","keywords":"Classifier (UML); Pipeline (software); Pattern recognition (psychology); Domain (mathematical analysis); Training set; Feature (linguistics); Plant disease; Domain knowledge; Deep learning","score_opus":0.07801280855151006,"score_gpt":0.2562596986108147,"score_spread":0.17824689005930466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416067597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04461134,0.0024017005,0.93625844,0.00077036064,0.00087159703,0.00015681589,0.0015630234,0.009122341,0.0042444817],"genre_scores_gemma":[0.6505507,0.0007734094,0.32634425,0.0007750315,0.0005782926,0.00033575334,0.0057666437,0.0009936637,0.013882158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940276,0.00018994235,0.000040318253,0.00019172569,0.000112305104,0.000062954154],"domain_scores_gemma":[0.9976501,0.0015681315,0.000089947425,0.00024252317,0.00034379342,0.00010555578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030564286,0.0019060593,0.0016790233,0.0011786697,0.00044234475,0.0016049929,0.0022748648,0.0021680365,0.0036065266],"category_scores_gemma":[0.0051496415,0.00079666544,0.0009786166,0.0009230905,0.0006167138,0.0017693352,0.0019916517,0.0032390377,0.0016740017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061277836,0.00034348012,0.003081988,0.00016240851,0.00035266203,0.00015997145,0.00008327624,0.5761055,0.0028574753,0.0036928947,0.019372568,0.39317495],"study_design_scores_gemma":[0.000013318503,0.000019812345,0.00017083976,0.000008989467,0.000011489833,0.000008759137,0.0000075040425,0.9960532,0.00054288603,0.002570798,0.0005867484,0.0000056156127],"about_ca_topic_score_codex":0.008720919,"about_ca_topic_score_gemma":0.012291932,"teacher_disagreement_score":0.008720919,"about_ca_system_score_codex":0.0008202224,"about_ca_system_score_gemma":0.0010062869,"threshold_uncertainty_score":0.017340302},"labels":[],"label_agreement":null},{"id":"W4416099633","doi":"10.1007/978-3-032-10444-1_10","title":"A Rodin Plugin for Generating Proof Obligations for Invariant Preservation for ASTDs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Plug-in; Correctness; JSON; Invariant (physics); Process calculus; Guard (computer science); Liveness; State (computer science)","score_opus":0.05342179538499845,"score_gpt":0.31368442778404376,"score_spread":0.2602626323990453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416099633","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040196897,0.00011707591,0.8095673,0.00013859237,0.00014444569,0.00029362706,0.0012265116,0.17398784,0.010505006],"genre_scores_gemma":[0.11497741,0.00046868116,0.76382816,0.00042259798,0.000094804265,0.00066060666,0.005801888,0.078482404,0.035263557],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988901,0.00026633256,0.00008735985,0.00021257992,0.0004474537,0.00009608209],"domain_scores_gemma":[0.99719596,0.0016558103,0.0001115764,0.0006421722,0.00029438268,0.00010007435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017317686,0.0014798859,0.000697111,0.0012842458,0.000597067,0.001984928,0.0018065235,0.0010156329,0.045668647],"category_scores_gemma":[0.0057141073,0.0013331186,0.0013438124,0.00068408565,0.00087503024,0.0028206406,0.0029875266,0.0020762654,0.014707585],"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.0009862653,0.0006565502,0.0022029139,0.0012835972,0.0001664318,0.0008354717,0.00090024533,0.016640468,0.036229495,0.082960024,0.16415292,0.69298565],"study_design_scores_gemma":[0.0005324675,0.00024924963,0.0012153633,0.00042608453,0.00017387778,0.0012809462,0.00026992196,0.33096027,0.16322714,0.08683698,0.41463974,0.00018787381],"about_ca_topic_score_codex":0.0010286612,"about_ca_topic_score_gemma":0.0019782532,"teacher_disagreement_score":0.045668647,"about_ca_system_score_codex":0.00079002103,"about_ca_system_score_gemma":0.0010096894,"threshold_uncertainty_score":0.15277678},"labels":[],"label_agreement":null},{"id":"W4416126051","doi":"10.1007/978-981-95-3061-8_1","title":"Global Discovery: A Global Graph-RAG Approach for Query-Focused Multimodal Summarization Across Multiple PDF Papers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Automatic summarization; Focus (optics); Field (mathematics); Process (computing); Natural language generation; Comprehension","score_opus":0.014361331817713006,"score_gpt":0.2554453064310938,"score_spread":0.2410839746133808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416126051","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.007244493,0.002004285,0.9629364,0.0005199484,0.00029749022,0.00033993085,0.0033855117,0.018726673,0.0045452304],"genre_scores_gemma":[0.11544611,0.0017443205,0.84188753,0.00048046123,0.0006124423,0.0004629564,0.015002828,0.003194207,0.021169107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980178,0.0004752479,0.00011565023,0.00065025256,0.00058793515,0.0001531163],"domain_scores_gemma":[0.9971603,0.0010794419,0.0001999015,0.0007715928,0.0006450829,0.00014364009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023341952,0.0021746256,0.0024700335,0.007687197,0.0016277381,0.0035393508,0.0034727857,0.0021031168,0.014499994],"category_scores_gemma":[0.006235518,0.0010090013,0.0018363484,0.008481462,0.0008385354,0.0049330415,0.0040714424,0.0019192055,0.007122892],"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.0007286742,0.00028344107,0.0010918856,0.0007940728,0.00038911833,0.00035720857,0.00053104066,0.027799616,0.021928359,0.014173256,0.076421775,0.8555015],"study_design_scores_gemma":[0.000139042,0.0004453134,0.0022167913,0.00013192622,0.0005515936,0.0004938953,0.0008787217,0.8230491,0.021855077,0.07120478,0.07886135,0.00017230742],"about_ca_topic_score_codex":0.0058209444,"about_ca_topic_score_gemma":0.0117723,"teacher_disagreement_score":0.014499994,"about_ca_system_score_codex":0.0008539517,"about_ca_system_score_gemma":0.0017218024,"threshold_uncertainty_score":0.048507333},"labels":[],"label_agreement":null},{"id":"W4416148424","doi":"10.1007/978-3-032-11108-1_38","title":"Who Wants to Live Forever? AI-Centricity as Ex-centricity of Death","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Roads University","funders":"","keywords":"Phenomenon; Key (lock)","score_opus":0.02738649803556991,"score_gpt":0.312985367851723,"score_spread":0.28559886981615307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416148424","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075244464,0.008052151,0.020210082,0.079059616,0.001968467,0.000033867967,0.00007039196,0.000076640514,0.8152843],"genre_scores_gemma":[0.95267606,0.0015646749,0.001030931,0.004004179,0.00041602226,0.000026986509,0.000036869445,0.000054382876,0.040190004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861586,0.0007659212,0.000038555987,0.00016563023,0.00017851994,0.00023540577],"domain_scores_gemma":[0.99769896,0.0012730641,0.00020696037,0.0002522834,0.00029868504,0.00027012653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002576054,0.00023090707,0.00024798195,0.0004950513,0.0045142607,0.0070239473,0.00058331544,0.0017790425,0.0039548213],"category_scores_gemma":[0.0040702964,0.00012555139,0.00020050342,0.00044996437,0.023368213,0.010532396,0.0038745552,0.004110917,0.00074267667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026466352,0.000009286072,0.00035745974,0.000034415487,0.0000031872023,0.00010213799,0.025347928,0.00007899766,0.00017445337,0.96216613,0.004901906,0.006797618],"study_design_scores_gemma":[0.00001669873,0.000047758356,0.0006993286,0.00018531247,0.000010065357,0.000409055,0.031706553,0.00035529825,0.00073522964,0.65479714,0.31101894,0.000018651606],"about_ca_topic_score_codex":0.00096599606,"about_ca_topic_score_gemma":0.0012831106,"teacher_disagreement_score":0.0070239473,"about_ca_system_score_codex":0.00260715,"about_ca_system_score_gemma":0.0012907647,"threshold_uncertainty_score":0.018916309},"labels":[],"label_agreement":null},{"id":"W4416148430","doi":"10.1007/978-3-032-11108-1_26","title":"Linguistic Diversity and Digitalization: An Ambivalent Relationship","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multilingual Education and Policy","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Universität Wien; Vienna Science and Technology Fund","keywords":"Linguistic diversity; Linguistic landscape; Operationalization; Linguistic description; Linguistic competence; Deep linguistic processing; Diversity (politics); Rule-based machine translation","score_opus":0.07533277741623648,"score_gpt":0.3870198900747244,"score_spread":0.3116871126584879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416148430","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8293973,0.0030130788,0.0013965598,0.013586433,0.00005508666,0.000014647074,0.000072672105,0.000019343877,0.1524449],"genre_scores_gemma":[0.99799263,0.0005426319,0.000111655216,0.00036456165,0.00002536757,0.000004435168,0.000010880811,0.000004136319,0.00094374147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782914,0.0010325658,0.00008331426,0.00024640936,0.00049519667,0.00031336292],"domain_scores_gemma":[0.99216074,0.004295606,0.0015332489,0.00038190524,0.00070731627,0.00092130585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021552397,0.00014422218,0.00022097962,0.0026466362,0.003905849,0.0063793766,0.0006979117,0.00055859203,0.004786516],"category_scores_gemma":[0.0048827496,0.000121370256,0.00015900102,0.0034211217,0.014718051,0.006620798,0.007072902,0.0017022444,0.00018815213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001455984,0.0002042236,0.15222995,0.00042850868,0.00010643804,0.0012959836,0.35000956,0.0007053466,0.002158734,0.37832412,0.0033709367,0.11102063],"study_design_scores_gemma":[0.000035991136,0.0001392352,0.26322186,0.0007999747,0.00006978302,0.001448239,0.512999,0.0006388848,0.00097427965,0.124217615,0.095348045,0.000107204236],"about_ca_topic_score_codex":0.014609675,"about_ca_topic_score_gemma":0.013029741,"teacher_disagreement_score":0.014609675,"about_ca_system_score_codex":0.0033411996,"about_ca_system_score_gemma":0.0013615835,"threshold_uncertainty_score":0.029049277},"labels":[],"label_agreement":null},{"id":"W4416148454","doi":"10.1007/978-3-032-11108-1_20","title":"Parliaments in the Digital Age – Building Blocks for a Theoretical Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Media and Politics","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library of Parliament","funders":"","keywords":"Parliament; Democracy; State (computer science); Transformation (genetics); Democratic theory","score_opus":0.01950327822853061,"score_gpt":0.3205940755359884,"score_spread":0.3010907973074578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416148454","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021456627,0.023150804,0.07228551,0.08382086,0.0011549852,0.00010014059,0.00017963939,0.00012063616,0.79773074],"genre_scores_gemma":[0.87540823,0.015430916,0.037750185,0.007838888,0.0023715904,0.00039854166,0.00028241196,0.00016421071,0.060354922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468166,0.0036512532,0.00015454488,0.00041404922,0.0006466972,0.00045185638],"domain_scores_gemma":[0.99517316,0.0031154149,0.00034467893,0.00045171593,0.00039678658,0.00051827973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050561014,0.00040361137,0.0006798649,0.0027473776,0.0056834198,0.01204956,0.0020493008,0.0046062567,0.011403944],"category_scores_gemma":[0.0055078035,0.0004952517,0.00073680474,0.00308258,0.02728378,0.018807625,0.004911685,0.0051860386,0.0025959106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011930628,0.0000031974332,0.000021365751,0.0000076375,3.2593323e-7,0.000006714183,0.00022308978,0.00006602961,0.0000055160876,0.99869424,0.00036776307,0.00060301204],"study_design_scores_gemma":[0.0000058347264,0.0000045479787,0.00009082799,0.00007337776,0.0000013965001,0.00002135305,0.0007582875,0.0005900763,0.000028102122,0.9559613,0.042461034,0.0000039036236],"about_ca_topic_score_codex":0.0029408084,"about_ca_topic_score_gemma":0.0028667948,"teacher_disagreement_score":0.01204956,"about_ca_system_score_codex":0.006051849,"about_ca_system_score_gemma":0.003528126,"threshold_uncertainty_score":0.04390949},"labels":[],"label_agreement":null},{"id":"W4416154792","doi":"10.1007/978-981-95-4434-9_25","title":"Synthetic Lateral Movement Data Generation for Azure Cloud: A Hopper-Based Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Windsor; National Research Council Canada","funders":"","keywords":"Cloud computing; Login; Adaptation (eye); Face (sociological concept); Synthetic data; Pace; Resource (disambiguation)","score_opus":0.03533184779200841,"score_gpt":0.2548172425099486,"score_spread":0.21948539471794018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416154792","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.075800784,0.00019903897,0.91378206,0.00021472105,0.00012268893,0.00015190699,0.0010305361,0.004918479,0.0037798637],"genre_scores_gemma":[0.5987593,0.00014691071,0.3939996,0.00007712865,0.00007044955,0.00010752923,0.0028137646,0.0004572124,0.0035680905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.000030908526,0.000007721075,0.00004947932,0.000088073364,0.000032628162],"domain_scores_gemma":[0.99967885,0.0001099095,0.000021478732,0.000058412592,0.00011079055,0.00002057817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026982775,0.00067380315,0.00068828627,0.0010331805,0.00039337395,0.00058129994,0.0010337299,0.0007078545,0.0027630357],"category_scores_gemma":[0.00075724424,0.000300372,0.0006200824,0.0010194338,0.00023757684,0.0005513298,0.0005533725,0.00056505855,0.00091940037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004996167,0.00018812426,0.0025160538,0.00010952679,0.00007128988,0.00024927457,0.000084083935,0.61757135,0.028865993,0.0041905567,0.0068107243,0.33884335],"study_design_scores_gemma":[0.000004226786,0.000010219106,0.00017325915,0.0000012900538,0.000002928496,0.000016277641,0.000009697833,0.9972959,0.0017617162,0.00041140235,0.0003097587,0.0000033720803],"about_ca_topic_score_codex":0.006892954,"about_ca_topic_score_gemma":0.007573864,"teacher_disagreement_score":0.006892954,"about_ca_system_score_codex":0.00041280876,"about_ca_system_score_gemma":0.0005054154,"threshold_uncertainty_score":0.013705671},"labels":[],"label_agreement":null},{"id":"W4416159454","doi":"10.1007/978-3-032-07904-6_15","title":"Cine-CLIP: Reducing Cine-MRI Dimensionality with Temporal Variability for Left Ventricular Ejection Fraction Estimation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Ejection fraction; Cardiac magnetic resonance; Fraction (chemistry); Dimensionality reduction; Modality (human–computer interaction); Magnetic resonance imaging; Curse of dimensionality; Biobank; Mean absolute error","score_opus":0.010618741327921358,"score_gpt":0.2740225302509263,"score_spread":0.263403788923005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416159454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004339903,0.0008252368,0.98418623,0.00011206534,0.00019670557,0.00006040504,0.0010930359,0.008335132,0.0008513758],"genre_scores_gemma":[0.036135066,0.0010393611,0.94918245,0.00021402394,0.00031244356,0.00021422694,0.0048416303,0.0017201564,0.0063405856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.000066246095,0.00002014201,0.00010896874,0.00018088211,0.000041976633],"domain_scores_gemma":[0.9992793,0.00038534333,0.0000345774,0.00011096363,0.00015053265,0.00003925995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084651203,0.0012538461,0.0011988961,0.00078395556,0.00034281792,0.0010281658,0.0013020663,0.0010068215,0.008429167],"category_scores_gemma":[0.0022008605,0.0005867341,0.0010425136,0.0010390502,0.000240829,0.0008936099,0.0012245884,0.0012675582,0.004433338],"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.00031313265,0.0001321586,0.00064250466,0.0001657762,0.00018113793,0.00014505084,0.00007837407,0.0217459,0.023116602,0.002525182,0.04717834,0.90377575],"study_design_scores_gemma":[0.000053751497,0.00011615651,0.0023510267,0.000031202457,0.00008990194,0.00033572843,0.000043853124,0.956818,0.015938487,0.006706774,0.017453603,0.0000615119],"about_ca_topic_score_codex":0.0033318459,"about_ca_topic_score_gemma":0.007261293,"teacher_disagreement_score":0.008429167,"about_ca_system_score_codex":0.0002115793,"about_ca_system_score_gemma":0.00061300694,"threshold_uncertainty_score":0.028198361},"labels":[],"label_agreement":null},{"id":"W4416234564","doi":"10.1007/978-3-032-10459-5_6","title":"SAMSformer: A Multi-scale Prediction Model Based on Parallel Transformer","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Traffic Prediction and Management Techniques","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 Toronto","funders":"","keywords":"Benchmark (surveying); Time series; Transformer; Time sequence; Series (stratigraphy); Sequence (biology); Function (biology)","score_opus":0.011275442800572572,"score_gpt":0.22148405281540054,"score_spread":0.21020861001482796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234564","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.014039401,0.00020535347,0.9778932,0.00009713003,0.00013436147,0.00004722445,0.0003081683,0.005361054,0.0019141085],"genre_scores_gemma":[0.60933447,0.0004947076,0.37837094,0.00013969207,0.000102954844,0.00017039357,0.0012389931,0.00061498047,0.009532915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998123,0.000026801703,0.000010104043,0.0000677072,0.00006200862,0.00002106641],"domain_scores_gemma":[0.99980265,0.000050923394,0.000016810474,0.000039723298,0.000074079246,0.000015765314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592945,0.0007567216,0.0010743886,0.0004717474,0.0003776685,0.0007486794,0.0016524855,0.00060029916,0.0036134731],"category_scores_gemma":[0.0009112274,0.00042046217,0.00066941493,0.00064372574,0.0002712539,0.0015429718,0.00071515917,0.00092589326,0.0013193482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026240555,0.00012189742,0.0011958551,0.000063249325,0.000090189176,0.0000657926,0.000026827616,0.73949,0.00706795,0.004417077,0.0074740015,0.23972487],"study_design_scores_gemma":[0.0000044924845,0.000008259807,0.00007374366,9.611302e-7,0.000005663434,0.0000055931628,0.0000010465903,0.99823344,0.0006111083,0.000630658,0.00042162437,0.0000035012738],"about_ca_topic_score_codex":0.015314606,"about_ca_topic_score_gemma":0.012343364,"teacher_disagreement_score":0.015314606,"about_ca_system_score_codex":0.0006220467,"about_ca_system_score_gemma":0.0007825438,"threshold_uncertainty_score":0.03045094},"labels":[],"label_agreement":null},{"id":"W4416234591","doi":"10.1007/978-3-032-10459-5_29","title":"Cultivator: Multi-granularity Tree Construction in Heterogeneous Edge-Cloud Training","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","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":"Consistency (knowledge bases); Software deployment; Adaptation (eye); Training set; Data deduplication; Quality of service; Data consistency; Service (business); Tree (set theory)","score_opus":0.02710705925033286,"score_gpt":0.25527182713714064,"score_spread":0.22816476788680778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234591","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.020896822,0.00014534773,0.9666776,0.00027298977,0.00010366337,0.00012685134,0.0003695583,0.0045701033,0.006837018],"genre_scores_gemma":[0.23559566,0.00014126768,0.75335515,0.00011250679,0.000042204167,0.00013143594,0.0009803737,0.0006240231,0.009017451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996569,0.00007531612,0.000017413195,0.00008471736,0.00009660071,0.00006902872],"domain_scores_gemma":[0.9994753,0.00015201214,0.000026466236,0.00016327463,0.00009010872,0.00009290411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612851,0.00032820136,0.00050197507,0.00064160564,0.0009273655,0.0010022087,0.0013771049,0.0007724929,0.009485699],"category_scores_gemma":[0.0017748703,0.000293965,0.00050261186,0.0010375022,0.0003791492,0.0016978831,0.0022187035,0.0010167932,0.0020664593],"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.00039638905,0.00029998441,0.0023334122,0.00019690504,0.000035576348,0.00017650504,0.00058369583,0.084757335,0.018830828,0.041396156,0.030311683,0.8206816],"study_design_scores_gemma":[0.00004032772,0.000101084785,0.0013140291,0.000053116823,0.000023628896,0.00015878787,0.0003525214,0.91845685,0.012134704,0.04260444,0.024735563,0.000024912071],"about_ca_topic_score_codex":0.002871688,"about_ca_topic_score_gemma":0.0053349296,"teacher_disagreement_score":0.009485699,"about_ca_system_score_codex":0.0005498931,"about_ca_system_score_gemma":0.0010246822,"threshold_uncertainty_score":0.031732798},"labels":[],"label_agreement":null},{"id":"W4416234726","doi":"10.1007/978-3-032-10466-3_31","title":"LLM-Guided Soft Actor-Critic for Resource Allocation in Mobile Edge Computing Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mobile edge computing; Reinforcement learning; Probabilistic logic; Server; Resource allocation; Edge computing; Resource management (computing); Mobile device; Enhanced Data Rates for GSM Evolution","score_opus":0.018786229879503735,"score_gpt":0.26903528216769845,"score_spread":0.2502490522881947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234726","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.008948335,0.00074230053,0.98236924,0.0007169811,0.0002458349,0.000045924047,0.00006935468,0.0004909302,0.0063712057],"genre_scores_gemma":[0.8722589,0.0005104717,0.1085964,0.0009288059,0.00033872045,0.00028160802,0.0001826023,0.00040481155,0.016497735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991486,0.00036340952,0.000033268014,0.00017775634,0.00011506842,0.00016195183],"domain_scores_gemma":[0.9956281,0.00355669,0.00015818616,0.00010779029,0.00039008746,0.00015902957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560984,0.0015477785,0.0025970084,0.0006590352,0.0006223444,0.001995741,0.0021218623,0.0032768974,0.005925011],"category_scores_gemma":[0.0067652767,0.00095892104,0.000691756,0.00070265436,0.0019485793,0.001325872,0.0022934526,0.003281498,0.0009702848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086555454,0.00002868338,0.00016092612,0.00007770206,0.000030640498,0.00005368449,0.000040736133,0.9739455,0.00039433522,0.010972895,0.00185102,0.01235734],"study_design_scores_gemma":[0.0000039230863,0.0000052324353,0.000008795122,0.0000049781615,0.000002257527,0.0000026850196,0.0000020864602,0.997776,0.00003832601,0.0020763795,0.00007766492,0.0000016368491],"about_ca_topic_score_codex":0.008507607,"about_ca_topic_score_gemma":0.007338441,"teacher_disagreement_score":0.008507607,"about_ca_system_score_codex":0.0019929989,"about_ca_system_score_gemma":0.0017418674,"threshold_uncertainty_score":0.019821107},"labels":[],"label_agreement":null},{"id":"W4416234825","doi":"10.1007/978-981-95-4381-6_6","title":"Interpretable Modeling of Multi-scale Temporal Patterns in Depressive Speech","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","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":"Interpretability; Spectrogram; Extractor; Feature (linguistics); Perception; Pattern recognition (psychology); Deep learning","score_opus":0.0385135335054383,"score_gpt":0.34492220389960215,"score_spread":0.30640867039416386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234825","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.17799398,0.00082974596,0.81439537,0.00056572084,0.00015124242,0.000057623118,0.0014252566,0.0008654822,0.0037155407],"genre_scores_gemma":[0.93157816,0.00046143093,0.06288518,0.000052638625,0.00006577977,0.000087609515,0.000985483,0.0001319305,0.0037518488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982005,0.000058687714,0.000012358608,0.000061057464,0.000023628252,0.00002418932],"domain_scores_gemma":[0.99871564,0.0010583205,0.00006362374,0.00005676958,0.000072972805,0.00003276153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061042095,0.00047343914,0.00036324796,0.00055982725,0.00023559427,0.001138501,0.00062968925,0.00064162246,0.0025625715],"category_scores_gemma":[0.0030694338,0.00033494658,0.0007955942,0.0004984981,0.0002704784,0.0007467527,0.00055084523,0.000793221,0.00063562364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047536538,0.00019837976,0.008729015,0.00016813198,0.00017207515,0.00051327364,0.0006072418,0.7337863,0.024600437,0.02060074,0.0026958457,0.20745322],"study_design_scores_gemma":[0.0000022698212,0.000010617391,0.0010285779,0.0000056372573,0.000006684112,0.000025354948,0.000021544749,0.9954026,0.00038998178,0.0029635844,0.00013916737,0.000003969632],"about_ca_topic_score_codex":0.0066457824,"about_ca_topic_score_gemma":0.0073093935,"teacher_disagreement_score":0.0066457824,"about_ca_system_score_codex":0.00041274147,"about_ca_system_score_gemma":0.00038904155,"threshold_uncertainty_score":0.013214171},"labels":[],"label_agreement":null},{"id":"W4416234866","doi":"10.1007/978-981-95-4381-6_5","title":"Excitatory-Inhibitory Dynamics in Adaptive Decision-Making","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural dynamics and brain function","field":"Neuroscience","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Feed forward; Scalability; Adaptation (eye); Mechanism (biology); Recurrent neural network; Dynamics (music); Artificial neural network; Computational model","score_opus":0.016172667525588113,"score_gpt":0.2539020614145667,"score_spread":0.23772939388897862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234866","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.22744864,0.0125988005,0.5316737,0.0045314627,0.0012999381,0.00003466949,0.00019226903,0.00023513842,0.22198533],"genre_scores_gemma":[0.9497774,0.002404079,0.017357193,0.00014842053,0.00018110307,0.000026818634,0.000038694703,0.000042742337,0.03002342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999125,0.000027120634,0.0000054306224,0.00001789222,0.000025180922,0.000011832218],"domain_scores_gemma":[0.99960023,0.000294796,0.000026400165,0.000015001745,0.00003814683,0.000025396004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030408925,0.00034855094,0.00026639938,0.00014361383,0.00019415891,0.0010942223,0.0005384522,0.0004819163,0.0038162414],"category_scores_gemma":[0.0015978621,0.00019216958,0.00020934107,0.00029692,0.0006476954,0.000995939,0.000395404,0.00089367165,0.00045058588],"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.00008784769,0.000062113184,0.0007827801,0.0001294645,0.000063405765,0.00015590046,0.00026007235,0.23325925,0.004922894,0.6856558,0.0043530446,0.070267506],"study_design_scores_gemma":[0.0000123996115,0.000033555094,0.0006202849,0.000027344067,0.0000159424,0.000058881586,0.00006021644,0.36208928,0.00092944916,0.6331657,0.0029702815,0.000016604512],"about_ca_topic_score_codex":0.00096710346,"about_ca_topic_score_gemma":0.0009285671,"teacher_disagreement_score":0.0038162414,"about_ca_system_score_codex":0.00043278164,"about_ca_system_score_gemma":0.00027303435,"threshold_uncertainty_score":0.0127666},"labels":[],"label_agreement":null},{"id":"W4416234899","doi":"10.1007/978-3-032-10466-3_23","title":"NNia-8: An 8-Core RISC-V Neural Network Inference Accelerator with Efficient Processing Elements and Memory Utilization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Memory bandwidth; Artificial neural network; Computation; Edge device; Multi-core processor; Computational complexity theory; Bandwidth (computing); Memory management; Inference","score_opus":0.037425019230046326,"score_gpt":0.3000084682819254,"score_spread":0.2625834490518791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234899","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.10139236,0.0044420366,0.63960826,0.0011854488,0.0016992046,0.00049994886,0.006228121,0.09384363,0.15110107],"genre_scores_gemma":[0.29967284,0.0012014032,0.53343534,0.0012725594,0.0002055485,0.0005142647,0.01160237,0.0026917495,0.14940394],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984074,0.000014711715,0.000011064814,0.00003832435,0.000067723595,0.000027474698],"domain_scores_gemma":[0.9998196,0.000031993164,0.000012863543,0.000027342612,0.00008673469,0.000021443726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002224047,0.0006787592,0.00042746085,0.00044695337,0.00028809923,0.0007174077,0.0021536087,0.0005022517,0.036524195],"category_scores_gemma":[0.00052353035,0.0004615566,0.00037655208,0.00069908163,0.00015243847,0.0007192704,0.00047646931,0.0009610751,0.010365529],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012790889,0.0002968369,0.0021049792,0.000618073,0.00021223577,0.00026749916,0.00012112717,0.036241535,0.082025535,0.016873037,0.2847032,0.57525676],"study_design_scores_gemma":[0.00044531576,0.00097341026,0.0028162773,0.000116429095,0.00020751652,0.00059466134,0.00006254679,0.6005713,0.11090242,0.010227348,0.27296036,0.00012239307],"about_ca_topic_score_codex":0.002850228,"about_ca_topic_score_gemma":0.005148779,"teacher_disagreement_score":0.036524195,"about_ca_system_score_codex":0.000544753,"about_ca_system_score_gemma":0.0009510049,"threshold_uncertainty_score":0.12218565},"labels":[],"label_agreement":null},{"id":"W4416234927","doi":"10.1007/978-3-032-10466-3_34","title":"Federated Learning via TEE-Based Dual-Branch Architecture and Interaction-Aware Pruning","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","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":"Queen's University","funders":"","keywords":"Pruning; Federated learning; Feature (linguistics); Architecture; Cryptography; Scheme (mathematics); Artificial neural network; Cryptographic primitive","score_opus":0.013708168853213725,"score_gpt":0.2532038482222261,"score_spread":0.23949567936901237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416234927","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.027695846,0.00038421393,0.9610664,0.00017769777,0.000069254296,0.000056444424,0.0001236657,0.0035953184,0.0068311044],"genre_scores_gemma":[0.5033867,0.00021117306,0.48417896,0.0001853627,0.000049650524,0.00012488534,0.00059597084,0.00031359424,0.010953796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999236,0.0001163716,0.00006273223,0.00020066177,0.00022825558,0.00015598802],"domain_scores_gemma":[0.9988918,0.00028688667,0.00005721586,0.000373316,0.0003133857,0.00007745899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667643,0.0005346498,0.0012323034,0.0009815253,0.00074822473,0.0018114392,0.0023111424,0.0011156109,0.0075137843],"category_scores_gemma":[0.0022428338,0.0003579277,0.0007688023,0.0010455601,0.0006792519,0.0026184928,0.002299376,0.0015294659,0.0017643168],"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.0006070539,0.00041903916,0.00204945,0.00015495183,0.0001206483,0.00021187059,0.00017813582,0.16819201,0.019630723,0.05306462,0.007624415,0.74774706],"study_design_scores_gemma":[0.000026516593,0.00008943685,0.00030302358,0.00002652719,0.000035033598,0.00014314886,0.000035940953,0.9501929,0.00908682,0.036585897,0.003456713,0.000018046998],"about_ca_topic_score_codex":0.0026279446,"about_ca_topic_score_gemma":0.0061279107,"teacher_disagreement_score":0.0075137843,"about_ca_system_score_codex":0.000884038,"about_ca_system_score_gemma":0.0018385383,"threshold_uncertainty_score":0.025136113},"labels":[],"label_agreement":null},{"id":"W4416236655","doi":"10.1007/978-981-95-3349-7_15","title":"Continual Learning for Multilingual Neural Machine Translation via Meta-Contrastive Memory Replay","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Forgetting; Machine translation; Focus (optics); Adaptation (eye); Stability (learning theory); Translation (biology); State (computer science)","score_opus":0.029903435201550373,"score_gpt":0.2801117572392014,"score_spread":0.25020832203765103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416236655","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.021143526,0.0012643414,0.96832556,0.00028809803,0.00025356177,0.000063201274,0.0002455443,0.0049615386,0.003454691],"genre_scores_gemma":[0.5075642,0.0007292412,0.47667634,0.0003186393,0.0003009408,0.0003254936,0.0016034519,0.001052651,0.011429078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.0002390816,0.000050904095,0.00024947527,0.000099414945,0.00007087109],"domain_scores_gemma":[0.9979773,0.0012308942,0.00008033522,0.00041691182,0.00023559539,0.000059069123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015907071,0.0011917776,0.0012402235,0.00083745294,0.0007373731,0.0013017023,0.0022345644,0.001716783,0.008844178],"category_scores_gemma":[0.004515032,0.0007248448,0.00092792674,0.0011991553,0.00094728597,0.003908462,0.0028074193,0.0025795053,0.003895924],"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.0007471696,0.00031588975,0.0003891076,0.00040748276,0.00020005052,0.00033852537,0.00030157994,0.13030544,0.02154533,0.0279106,0.011435446,0.8061034],"study_design_scores_gemma":[0.000026648308,0.00012161425,0.00010283597,0.000023962957,0.000028237715,0.00008737661,0.00005443653,0.95867854,0.00823395,0.03032216,0.0022969607,0.00002320141],"about_ca_topic_score_codex":0.0021818255,"about_ca_topic_score_gemma":0.0034366467,"teacher_disagreement_score":0.008844178,"about_ca_system_score_codex":0.0005415458,"about_ca_system_score_gemma":0.00072815,"threshold_uncertainty_score":0.029586673},"labels":[],"label_agreement":null},{"id":"W4416237843","doi":"10.1007/978-3-032-08452-1_17","title":"Predicting T Cell Receptor Specificity with Graph Attention Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"vaccines and immunoinformatics approaches","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":"Algoma University","funders":"","keywords":"T-cell receptor; Graph; Acquired immune system; Repertoire; Concatenation (mathematics); Cluster analysis; Feature (linguistics); Profiling (computer programming)","score_opus":0.007687134990631801,"score_gpt":0.19810566514750313,"score_spread":0.19041853015687132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416237843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3355953,0.003090413,0.6435559,0.0012844813,0.00015646483,0.00012869402,0.002270388,0.003991952,0.009926426],"genre_scores_gemma":[0.92925245,0.00068458513,0.06294868,0.0003026582,0.00017974437,0.000058214984,0.0019570931,0.0001413527,0.00447513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987185,0.00003467652,0.000004641645,0.000047844558,0.000018972301,0.000021987444],"domain_scores_gemma":[0.999121,0.0007240082,0.000047226327,0.000035866782,0.00004551298,0.000026386853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028642121,0.0008380621,0.00063859654,0.0011633016,0.00019526205,0.0005779804,0.0006330422,0.00080891955,0.0025773665],"category_scores_gemma":[0.001464688,0.00036398112,0.0007006624,0.0007222074,0.00025493835,0.00078614935,0.00039437614,0.0007663987,0.0006087834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044500516,0.00014571098,0.0058069094,0.00014681432,0.0001847443,0.00018379254,0.00003088786,0.71252394,0.011357577,0.0049059065,0.008456803,0.25581187],"study_design_scores_gemma":[0.0000049319688,0.000017669627,0.00033922706,0.000002683018,0.000014420993,0.000017879905,0.000003428966,0.99299157,0.00075594406,0.0056788963,0.00017055358,0.0000027237365],"about_ca_topic_score_codex":0.0059494167,"about_ca_topic_score_gemma":0.0069596325,"teacher_disagreement_score":0.0059494167,"about_ca_system_score_codex":0.00058070547,"about_ca_system_score_gemma":0.00025306805,"threshold_uncertainty_score":0.011829555},"labels":[],"label_agreement":null},{"id":"W4416237890","doi":"10.1007/978-3-032-08452-1_4","title":"Vision Language Models for Dynamic Human Activity Recognition in Healthcare Settings","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Flexibility (engineering); Benchmark (surveying); Key (lock); Activity recognition; Health care; Generative grammar; Deep learning; Code (set theory)","score_opus":0.016681572316009224,"score_gpt":0.32324759820422455,"score_spread":0.30656602588821535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416237890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029501904,0.0038353996,0.955116,0.0010781504,0.00032868338,0.00007510873,0.0014392888,0.0039173453,0.0047080596],"genre_scores_gemma":[0.7802224,0.003441401,0.18565342,0.00085363776,0.0003105578,0.00032205187,0.0036561969,0.00047894835,0.025061373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999729,0.000062855,0.000015008714,0.00008702709,0.00005193137,0.000054119842],"domain_scores_gemma":[0.9995253,0.00028065598,0.000034572095,0.000037100384,0.00009913382,0.000023210672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006443089,0.00072270515,0.0008947264,0.0006091215,0.00021992171,0.0010653965,0.0013301115,0.0009881624,0.004088821],"category_scores_gemma":[0.0019320365,0.00043653016,0.0010731596,0.0007186462,0.0002572435,0.0011300026,0.0005099353,0.0016584339,0.0028076463],"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.0004156053,0.00034739333,0.0019558857,0.00022183654,0.00020228866,0.00023699398,0.00014224222,0.335745,0.012549586,0.019463738,0.020308424,0.608411],"study_design_scores_gemma":[0.0000062033514,0.000025324944,0.0003280479,0.000011666656,0.000018443345,0.000045970428,0.0000125549905,0.99154305,0.0009894458,0.005986682,0.0010226369,0.000009941509],"about_ca_topic_score_codex":0.016014414,"about_ca_topic_score_gemma":0.017073005,"teacher_disagreement_score":0.016014414,"about_ca_system_score_codex":0.00088767806,"about_ca_system_score_gemma":0.00075438013,"threshold_uncertainty_score":0.03184241},"labels":[],"label_agreement":null},{"id":"W4416237900","doi":"10.1007/978-3-032-08452-1_16","title":"Machine Learning Models for Assessing Depression in Syrian Adolescent Refugees in Jordan","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mental Health via Writing","field":"Psychology","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":"Lakehead University; Confederation College","funders":"","keywords":"Psychosocial; Naive Bayes classifier; Psychological intervention; Mental health; Depression (economics); Logistic regression; Support vector machine; Feature selection","score_opus":0.04400848048397259,"score_gpt":0.3632054714573512,"score_spread":0.3191969909733786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416237900","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.9460282,0.004431359,0.038394835,0.0026102718,0.00022710767,0.000115799165,0.0012354904,0.00023664656,0.0067202565],"genre_scores_gemma":[0.9684513,0.0014688175,0.020025983,0.00017163677,0.000060816838,0.00014111806,0.001355079,0.00002034453,0.008304904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998807,0.000056417386,0.000008539825,0.000018498362,0.00001714157,0.00001869337],"domain_scores_gemma":[0.9996269,0.00023733129,0.000021558571,0.00001014822,0.00008303667,0.000021055352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007417695,0.00039845725,0.0003819333,0.00036347244,0.0002601031,0.00084633625,0.0006501259,0.00034249303,0.0013547557],"category_scores_gemma":[0.0013036565,0.00012423401,0.00047156907,0.00035007577,0.00010198933,0.00030261112,0.00031462687,0.00075126125,0.00041273318],"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.0006179644,0.00086228695,0.2586518,0.00015985806,0.00033099172,0.00035894665,0.0007831843,0.1344421,0.001677186,0.002376588,0.018642329,0.58109677],"study_design_scores_gemma":[0.000035581787,0.00039781252,0.088404074,0.00017380029,0.0001387094,0.00019364264,0.0017785713,0.8999435,0.0012859701,0.0030407896,0.0045762886,0.000031329957],"about_ca_topic_score_codex":0.018182356,"about_ca_topic_score_gemma":0.026735023,"teacher_disagreement_score":0.018182356,"about_ca_system_score_codex":0.00065890024,"about_ca_system_score_gemma":0.00080807746,"threshold_uncertainty_score":0.036153078},"labels":[],"label_agreement":null},{"id":"W4416237913","doi":"10.1007/978-3-032-08452-1_14","title":"Explainable AI for Clinical Decision-Making: Unlocking the Potential of MSI Thresholds in Bladder Cancer","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bladder and Urothelial Cancer Treatments","field":"Medicine","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":"Lakehead University","funders":"","keywords":"Interpretability; Random forest; Logistic regression; Bladder cancer; Categorical variable; Hyperparameter optimization; Naive Bayes classifier; Decision tree; Personalized medicine","score_opus":0.031426794872800576,"score_gpt":0.37139232294974683,"score_spread":0.33996552807694624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416237913","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.01712416,0.010867831,0.8917803,0.042651873,0.0011789502,0.0000964189,0.00061763707,0.001387464,0.034295343],"genre_scores_gemma":[0.59519243,0.006488894,0.38219863,0.0035368353,0.0013750278,0.00017796532,0.00056899665,0.0003952334,0.010065917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980096,0.0012021043,0.00010615531,0.00022514739,0.00035792278,0.000099163764],"domain_scores_gemma":[0.967287,0.0297589,0.0007483297,0.0011133228,0.00069278583,0.0003996422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037826102,0.00074519234,0.00053049286,0.0006955827,0.0004559318,0.002787302,0.0017166759,0.0012981094,0.008218126],"category_scores_gemma":[0.027559053,0.000405619,0.00071865413,0.00064037374,0.002184886,0.0042689173,0.001900476,0.0042993184,0.00094290834],"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.00031809031,0.00007747905,0.0022522698,0.0006917834,0.00015479099,0.00024364537,0.0011675665,0.0672148,0.0016767387,0.56356204,0.025969094,0.3366716],"study_design_scores_gemma":[0.00002309574,0.00004103525,0.00034866328,0.0001737909,0.000038357553,0.00010787403,0.00008977235,0.12999861,0.0006082075,0.8548601,0.013687689,0.000022749971],"about_ca_topic_score_codex":0.0021143307,"about_ca_topic_score_gemma":0.0024067266,"teacher_disagreement_score":0.008218126,"about_ca_system_score_codex":0.0016162428,"about_ca_system_score_gemma":0.0018098966,"threshold_uncertainty_score":0.027492404},"labels":[],"label_agreement":null},{"id":"W4416242390","doi":"10.1007/978-3-032-10762-6_7","title":"Trade-Off Between Interpretability and Accuracy: How Can XAI Build Trust in Track Geometry Predictive Maintenance?","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Railway Engineering and Dynamics","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":"Concordia University","funders":"","keywords":"Interpretability; Support vector machine; Leverage (statistics); Track (disk drive); Artificial neural network; Bridging (networking); Precision and recall; Convolutional neural network","score_opus":0.005900145420449526,"score_gpt":0.20521918689996652,"score_spread":0.19931904147951698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416242390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093833774,0.0015102421,0.8797056,0.0053149527,0.0002174814,0.000050597366,0.00022833647,0.0034563045,0.015682654],"genre_scores_gemma":[0.8783294,0.0003572614,0.117616944,0.00019933103,0.00014676191,0.000033891683,0.00016663977,0.00045050614,0.0026991807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958967,0.0014791815,0.0003104536,0.0006124559,0.001335601,0.00036557426],"domain_scores_gemma":[0.95125294,0.031095367,0.003903289,0.008522845,0.0045537413,0.00067179475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0110365,0.00071479595,0.001229033,0.001086289,0.00061561854,0.0056258673,0.0023540156,0.0019930985,0.004530111],"category_scores_gemma":[0.067558676,0.0009285251,0.0006182719,0.0011301446,0.0031058386,0.015271005,0.0024684137,0.0038235318,0.0016265335],"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.0013224351,0.00023630256,0.021441685,0.00046719646,0.0002158336,0.00034084244,0.002438965,0.15764794,0.010344351,0.23037474,0.009934071,0.5652356],"study_design_scores_gemma":[0.00003825727,0.00019857085,0.0032744345,0.00011826987,0.000072059505,0.00016663938,0.0004243632,0.7670616,0.008023352,0.21640025,0.0041584787,0.00006376762],"about_ca_topic_score_codex":0.0023018024,"about_ca_topic_score_gemma":0.001959882,"teacher_disagreement_score":0.0110365,"about_ca_system_score_codex":0.0014910153,"about_ca_system_score_gemma":0.0009131391,"threshold_uncertainty_score":0.058367312},"labels":[],"label_agreement":null},{"id":"W4416259611","doi":"10.1007/978-3-032-10990-3_3","title":"A Shapley Value-Based Gated Feature Fusion of Multi-branch Deep Learning Framework for Breast Cancer Screening of Thermal Images","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Infrared Thermography in Medicine","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Discriminative model; Deep learning; Pattern recognition (psychology); Feature learning; Feature (linguistics); Breast cancer screening; Breast cancer; Fusion","score_opus":0.013123208068917654,"score_gpt":0.28355040410411925,"score_spread":0.2704271960352016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416259611","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.016323963,0.0006051612,0.9806671,0.0001273556,0.00005568011,0.000029657425,0.00007450822,0.00033048587,0.0017860584],"genre_scores_gemma":[0.6946992,0.00065974036,0.29648545,0.00034612295,0.00013056278,0.00012323498,0.00047584894,0.00010988294,0.006969929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.000103835715,0.0000209645,0.00007448016,0.000100114914,0.00005301731],"domain_scores_gemma":[0.999613,0.00015444495,0.000026414453,0.0000437981,0.00012075146,0.000041687115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010717782,0.00067447714,0.0013902017,0.00046322355,0.00027420514,0.00084552134,0.0018668257,0.0011590668,0.0033740748],"category_scores_gemma":[0.00119819,0.0003390811,0.0008492154,0.0006973775,0.00051569386,0.0014965158,0.0015737369,0.0013824827,0.0004885808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002499845,0.00022619536,0.00075566,0.00011986222,0.00016630068,0.00009644795,0.00006968411,0.5245946,0.010183855,0.03390233,0.006858344,0.42277667],"study_design_scores_gemma":[0.000003497845,0.000028809323,0.00005321183,0.0000037395928,0.000008123858,0.000009857355,0.0000025817676,0.99456996,0.00050299126,0.0046103247,0.00020288002,0.000004121292],"about_ca_topic_score_codex":0.003292269,"about_ca_topic_score_gemma":0.004433361,"teacher_disagreement_score":0.0033740748,"about_ca_system_score_codex":0.0007155543,"about_ca_system_score_gemma":0.00094817666,"threshold_uncertainty_score":0.011287391},"labels":[],"label_agreement":null},{"id":"W4416260673","doi":"10.1007/978-3-032-09336-3_5","title":"Predicting Microsatellite Instability from Whole Slide Images Using Texture Features","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"North Island College","funders":"","keywords":"Texture (cosmology); Microsatellite instability; Pattern recognition (psychology); Tile; Identification (biology); Microsatellite; Contrast (vision)","score_opus":0.010532180485038933,"score_gpt":0.2771961267223021,"score_spread":0.26666394623726314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416260673","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77403486,0.004025912,0.20920657,0.00023911396,0.00013754673,0.000118977754,0.004038259,0.0031129543,0.0050858986],"genre_scores_gemma":[0.8768957,0.002324903,0.106487006,0.00008135374,0.00011755742,0.000086774875,0.0042165658,0.00018714741,0.009602901],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99993753,0.000004831414,0.0000039819447,0.00001774662,0.000025406172,0.00001053905],"domain_scores_gemma":[0.9997428,0.00012526504,0.000046748173,0.00001732826,0.000052452426,0.000015443753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015524622,0.0003795696,0.0003818774,0.001320803,0.00008109884,0.00048003747,0.00024762543,0.00030462694,0.001994988],"category_scores_gemma":[0.00059738173,0.00015393065,0.0003556798,0.0008374877,0.00008679213,0.00028705708,0.00021717657,0.00021059874,0.0012335924],"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.0005297679,0.000060155355,0.03682613,0.00020619022,0.000083196515,0.0004954409,0.00005271268,0.008751259,0.29299486,0.00013003137,0.0040441244,0.65582615],"study_design_scores_gemma":[0.000050998362,0.0006970441,0.24820434,0.00007359153,0.00041716307,0.0033768706,0.0003235888,0.56539655,0.1718116,0.001677682,0.007891865,0.00007865721],"about_ca_topic_score_codex":0.0011492529,"about_ca_topic_score_gemma":0.0025649203,"teacher_disagreement_score":0.001994988,"about_ca_system_score_codex":0.00011355866,"about_ca_system_score_gemma":0.000084839514,"threshold_uncertainty_score":0.006673932},"labels":[],"label_agreement":null},{"id":"W4416288595","doi":"10.1007/978-3-032-11127-2_6","title":"Block Transactional Memory: A Complexity Study","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Kelowna General Hospital","funders":"","keywords":"Transactional memory; Block (permutation group theory); Database transaction; Software transactional memory; Transaction processing; Transactional leadership; Bottleneck; Set (abstract data type); Distributed transaction","score_opus":0.02535705820596806,"score_gpt":0.2626385736589403,"score_spread":0.2372815154529722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416288595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18581542,0.007854547,0.70991945,0.0035235644,0.00030529668,0.00025439874,0.00080414413,0.0005056974,0.09101751],"genre_scores_gemma":[0.8632535,0.0044384254,0.10258796,0.00045040122,0.00079834106,0.00034214658,0.0008748225,0.00036702174,0.026887346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.0002646332,0.000073778596,0.00015992812,0.0006793332,0.0001444465],"domain_scores_gemma":[0.9889665,0.008669174,0.0005937891,0.00095936895,0.00057851645,0.0002325336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009475644,0.0007361861,0.000860979,0.0011559383,0.0009543479,0.0039090337,0.0020808983,0.0012351313,0.009370858],"category_scores_gemma":[0.00935921,0.00072972616,0.0009798459,0.003297206,0.0015858655,0.009972378,0.0017195031,0.0027416744,0.0010242098],"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.00022647674,0.00010757299,0.0011606166,0.00032414508,0.00004067441,0.00032362062,0.00028719992,0.048557755,0.0038541984,0.89258933,0.0068432847,0.04568514],"study_design_scores_gemma":[0.000028446544,0.000064826054,0.00055935193,0.00003064994,0.000051084822,0.00047541579,0.00011605796,0.2997338,0.0019717026,0.69071645,0.006228149,0.000024134994],"about_ca_topic_score_codex":0.0011012607,"about_ca_topic_score_gemma":0.0011198444,"teacher_disagreement_score":0.009370858,"about_ca_system_score_codex":0.0015960451,"about_ca_system_score_gemma":0.0010312457,"threshold_uncertainty_score":0.031348646},"labels":[],"label_agreement":null},{"id":"W4416288730","doi":"10.1007/978-3-032-11127-2_18","title":"On the Computational Power of Mobile Robots Under Sequential Schedulers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Robot; Mobile robot; Computational complexity theory; Scheduling (production processes); Sequence (biology); Permutation (music); Base (topology)","score_opus":0.022083914878658746,"score_gpt":0.27467391144287007,"score_spread":0.2525899965642113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416288730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35448745,0.0050316383,0.56271076,0.0050677033,0.00066736067,0.00014929834,0.0004922105,0.0008245034,0.07056911],"genre_scores_gemma":[0.9575483,0.0012517609,0.030635944,0.00025364963,0.0003113562,0.00010753361,0.00011983697,0.00021946483,0.009552028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987663,0.00041723307,0.00004530199,0.00016562262,0.00029336842,0.00031223512],"domain_scores_gemma":[0.98843914,0.0097853225,0.00035853006,0.0006743294,0.0004003405,0.00034233532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020899673,0.0010006707,0.0015439307,0.0007683768,0.0008714799,0.002085598,0.0021154496,0.00086860155,0.0104880715],"category_scores_gemma":[0.015212169,0.0006308029,0.00053355016,0.0016388999,0.002260713,0.0036999441,0.0021555359,0.0012975347,0.0005401485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011624129,0.00010539978,0.0008635881,0.00026239222,0.00006011928,0.00013879746,0.00016893866,0.78547305,0.004181563,0.15966149,0.0049246824,0.042997576],"study_design_scores_gemma":[0.000041159437,0.00006886463,0.0003083798,0.000017342833,0.000016466938,0.000031078078,0.00005236088,0.9012283,0.00061886327,0.096786015,0.0008211835,0.000009995718],"about_ca_topic_score_codex":0.002623918,"about_ca_topic_score_gemma":0.0026243974,"teacher_disagreement_score":0.0104880715,"about_ca_system_score_codex":0.0014301909,"about_ca_system_score_gemma":0.0015579426,"threshold_uncertainty_score":0.035086095},"labels":[],"label_agreement":null},{"id":"W4416303424","doi":"10.1007/978-3-032-12092-2_4","title":"Software Testing Education and Industry Needs - Report from the ENACTEST EU Project","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","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":"Nexen (Canada)","funders":"","keywords":"Quality (philosophy); Software; Thematic analysis; Software testing; Knowledge transfer; Software peer review; Software development; Test strategy","score_opus":0.02624930194515031,"score_gpt":0.2786303153137283,"score_spread":0.252381013368578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416303424","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75258654,0.023597512,0.00857712,0.02871801,0.0005307653,0.00030318793,0.01603228,0.0014908661,0.16816385],"genre_scores_gemma":[0.8836899,0.008282696,0.006553192,0.0023640872,0.00018266123,0.000341742,0.024329904,0.00038818066,0.07386765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955083,0.0009616886,0.00023355531,0.0002420512,0.0022899152,0.00076440984],"domain_scores_gemma":[0.983052,0.005749516,0.0015710689,0.00040416417,0.0063358354,0.0028874176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006625425,0.00042750957,0.00032257917,0.002764326,0.00039420245,0.0015529061,0.0008608178,0.0014470326,0.010114359],"category_scores_gemma":[0.008641971,0.00020721719,0.00033596277,0.002793035,0.000391512,0.0017298994,0.0017822736,0.00076982024,0.0019876938],"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.0015320822,0.0029345076,0.22322433,0.0010074184,0.000073356285,0.0012102997,0.002381512,0.0043541878,0.0023153725,0.008818766,0.13656579,0.6155825],"study_design_scores_gemma":[0.00012928955,0.001177549,0.7620836,0.0009752742,0.00011416414,0.0012776799,0.0057768985,0.004892325,0.005698248,0.002086578,0.21574499,0.000043390497],"about_ca_topic_score_codex":0.015888294,"about_ca_topic_score_gemma":0.016560305,"teacher_disagreement_score":0.015888294,"about_ca_system_score_codex":0.0020394002,"about_ca_system_score_gemma":0.004134887,"threshold_uncertainty_score":0.035039008},"labels":[],"label_agreement":null},{"id":"W4416309400","doi":"10.1007/978-3-032-09120-8_11","title":"Linear Search for Capturing an Oblivious Mobile Target in the Sender/Receiver Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Communication source; Mobile robot; Competitive analysis; Motion (physics); Search and rescue; Search algorithm","score_opus":0.0357485961633655,"score_gpt":0.2959106557265032,"score_spread":0.2601620595631377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416309400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015383197,0.0003294285,0.9708865,0.00069857197,0.000050837898,0.00004579071,0.00010819798,0.00029658532,0.012200874],"genre_scores_gemma":[0.76734793,0.0008682879,0.18224098,0.0005506178,0.00022177701,0.00039379715,0.00023761568,0.0003565609,0.047782406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909914,0.00041451762,0.000023646684,0.00012847956,0.0001545168,0.00017967324],"domain_scores_gemma":[0.9982229,0.0012609256,0.00013874554,0.00017165612,0.00012135047,0.00008435808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013036168,0.0009508845,0.0014576557,0.00053360435,0.00069374294,0.0019293976,0.001983472,0.0024090698,0.008426091],"category_scores_gemma":[0.0046319026,0.000814054,0.0007824755,0.0009792177,0.0018100732,0.003983282,0.00255494,0.0029081255,0.0021294563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019323194,0.000051901392,0.00020690213,0.00013692296,0.000034563167,0.00010570016,0.00014624382,0.44770014,0.0018550329,0.532236,0.0035108111,0.013822519],"study_design_scores_gemma":[0.000018240366,0.000028217786,0.00003313482,0.000011595763,0.000008772981,0.000028512262,0.000024882263,0.8703869,0.0003636454,0.12840109,0.0006824239,0.0000126064],"about_ca_topic_score_codex":0.0025172266,"about_ca_topic_score_gemma":0.0022550453,"teacher_disagreement_score":0.008426091,"about_ca_system_score_codex":0.0017532554,"about_ca_system_score_gemma":0.0014654079,"threshold_uncertainty_score":0.02818811},"labels":[],"label_agreement":null},{"id":"W4416309681","doi":"10.1007/978-3-032-08455-2_1","title":"DeepGBSImpute: A Reference-Free Transformer-Based Genotype Imputation Framework for Sparse Genotyping-By-Sequencing Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","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":"Université Laval","funders":"","keywords":"Imputation (statistics); Interpretability; Missing data; Inference; Linkage disequilibrium; Genotype; Genetic data","score_opus":0.039484611786069435,"score_gpt":0.3003631484869683,"score_spread":0.2608785367008989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416309681","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.0013475019,0.00041094134,0.9660348,0.00017394313,0.00012493611,0.000057058314,0.0035542054,0.02771162,0.0005849891],"genre_scores_gemma":[0.0313976,0.0007322642,0.9374968,0.00061828207,0.0001379034,0.0003965454,0.017903153,0.0049325204,0.006385007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864274,0.00045355174,0.00007671103,0.0003400952,0.0003664126,0.00012057284],"domain_scores_gemma":[0.99825794,0.00083503977,0.00007624838,0.0005133548,0.00022805673,0.0000893284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003949248,0.0017574757,0.0022627239,0.0013682839,0.00068768073,0.002217358,0.006405554,0.0018393786,0.017933687],"category_scores_gemma":[0.010546632,0.0018842553,0.0028361736,0.0024951475,0.0007385887,0.0021895845,0.0040122154,0.004148262,0.013327863],"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.00093197083,0.00021217152,0.0027402062,0.0005617824,0.0011407861,0.00036168395,0.00019047702,0.124366865,0.0066515706,0.025217952,0.14376388,0.69386065],"study_design_scores_gemma":[0.00019659226,0.00008861377,0.0006774572,0.000070393966,0.00014243057,0.00032127975,0.000030068115,0.89259243,0.006297555,0.06749002,0.032004353,0.00008873741],"about_ca_topic_score_codex":0.0093749175,"about_ca_topic_score_gemma":0.020795662,"teacher_disagreement_score":0.017933687,"about_ca_system_score_codex":0.00082158233,"about_ca_system_score_gemma":0.0025311245,"threshold_uncertainty_score":0.05999422},"labels":[],"label_agreement":null},{"id":"W4416309873","doi":"10.1007/978-3-032-08455-2_23","title":"Regulating Toxic Amyloid-Beta Oligomers in Alzheimer’s Disease: A Control Theory Approach","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Alzheimer's disease research and treatments","field":"Medicine","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":"Wilfrid Laurier University","funders":"","keywords":"Optimal control; Control (management); Probability density function; Function (biology); Key (lock); Dimer","score_opus":0.023604752335243315,"score_gpt":0.29114098931629234,"score_spread":0.267536236981049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416309873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03621623,0.013880434,0.7846244,0.008257718,0.0018910113,0.00010257818,0.0001946811,0.00045157218,0.15438133],"genre_scores_gemma":[0.82458806,0.013087818,0.07141693,0.0026097198,0.0009829846,0.0002383236,0.00013147506,0.00014921094,0.08679547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982053,0.000040029958,0.000008284846,0.000040856747,0.00006717036,0.000023002118],"domain_scores_gemma":[0.9997657,0.00014525486,0.000023762368,0.000018824096,0.000032138407,0.000014332778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663342,0.0007333066,0.000540919,0.0004257687,0.00025016337,0.0014930676,0.00096464355,0.0009173309,0.004721156],"category_scores_gemma":[0.0006384404,0.00022059669,0.0007123547,0.0003328409,0.0011081194,0.0012353854,0.00045665464,0.00096829596,0.0004372148],"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.00013579958,0.00028887368,0.000308041,0.0002913282,0.000094761985,0.00013254782,0.00012586085,0.1028927,0.016867356,0.78270155,0.009107168,0.08705404],"study_design_scores_gemma":[0.0000457317,0.0002554061,0.00046423372,0.00005850217,0.00006433656,0.00008985174,0.00006248458,0.20759392,0.006082074,0.77081096,0.014431966,0.00004046279],"about_ca_topic_score_codex":0.0012492398,"about_ca_topic_score_gemma":0.0009771832,"teacher_disagreement_score":0.004721156,"about_ca_system_score_codex":0.0010321072,"about_ca_system_score_gemma":0.00049859646,"threshold_uncertainty_score":0.01579386},"labels":[],"label_agreement":null},{"id":"W4416336295","doi":"10.1007/978-3-032-12089-2_38","title":"Exploring the Performance of ML Model Size for Classification in Relation to Energy Consumption","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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":"Carleton University","funders":"","keywords":"Commit; Relation (database); Energy consumption; Construct (python library); Variable (mathematics); Reduction (mathematics); Energy (signal processing); Software; Language model; Fraction (chemistry)","score_opus":0.07788542627065352,"score_gpt":0.280680891953476,"score_spread":0.20279546568282247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416336295","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.8636035,0.0074539008,0.10884426,0.004292219,0.00037028294,0.00010620891,0.001994267,0.0048012612,0.008534],"genre_scores_gemma":[0.9675784,0.0005068984,0.027148958,0.0002253812,0.00013970275,0.000045021246,0.0020578399,0.0005328729,0.0017648346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941743,0.003292766,0.00038529938,0.0009078379,0.0009230845,0.00031668934],"domain_scores_gemma":[0.7747359,0.2107541,0.0023348278,0.006821851,0.0045408797,0.0008124804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013929232,0.0016209177,0.001546019,0.0017174492,0.00069794565,0.003958544,0.0018867744,0.0026020228,0.0024551842],"category_scores_gemma":[0.095433965,0.0005931106,0.00094037026,0.0018276949,0.0009596239,0.005349996,0.0014713304,0.0027363305,0.0014018895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007650115,0.001402251,0.09433757,0.00058453454,0.000963707,0.00028314957,0.0005554283,0.49523562,0.014296424,0.0036718135,0.0094547365,0.3715647],"study_design_scores_gemma":[0.00006728706,0.00056921603,0.007323765,0.0000495042,0.00014862843,0.00012337828,0.00026952662,0.98002076,0.007586045,0.003136495,0.0006613414,0.0000440979],"about_ca_topic_score_codex":0.006381586,"about_ca_topic_score_gemma":0.004740588,"teacher_disagreement_score":0.013929232,"about_ca_system_score_codex":0.0010661422,"about_ca_system_score_gemma":0.0011229594,"threshold_uncertainty_score":0.07366568},"labels":[],"label_agreement":null},{"id":"W4416454823","doi":"10.1007/978-3-032-10351-2_5","title":"Anomaly Detection in Anterior Eye Segment Using Self-supervised Siamese Autoencoders","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Retinal Imaging and Analysis","field":"Medicine","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":"CRB Innovations (Canada); Centre Intégré de Santé et de Services Sociaux des Laurentides; Polytechnique Montréal","funders":"","keywords":"Anomaly detection; Anomaly (physics); Pattern recognition (psychology); Fundus (uterus); Generalization; Representation (politics)","score_opus":0.012205618210471203,"score_gpt":0.27319136928834703,"score_spread":0.2609857510778758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416454823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04545721,0.0008497917,0.9502239,0.00017717859,0.000110560664,0.00003771073,0.00021980234,0.0016117626,0.0013120618],"genre_scores_gemma":[0.529613,0.0010555326,0.45704037,0.00015796145,0.00017805872,0.00007777852,0.0011704708,0.00027646712,0.010430428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975306,0.000028316388,0.000015248474,0.0000962441,0.000067894194,0.000039232364],"domain_scores_gemma":[0.99951494,0.00015764109,0.000045836852,0.000064694716,0.00019456647,0.000022254259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050024857,0.00055917475,0.0007173803,0.0005738244,0.00027691617,0.0006852317,0.00074555917,0.000739666,0.0013536285],"category_scores_gemma":[0.0010105256,0.0003304024,0.00088203093,0.0005976813,0.00027464182,0.00061340316,0.00058822514,0.0009929239,0.00075364794],"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.00021287204,0.00010300163,0.0041528386,0.00009548996,0.00015091029,0.00015689195,0.00007790564,0.08569367,0.04879279,0.0024401303,0.0057687527,0.85235476],"study_design_scores_gemma":[0.00000349979,0.000022061295,0.0016989462,0.0000059756753,0.000019939445,0.00010714623,0.000008481435,0.98898286,0.0074859224,0.0010438474,0.00061402,0.0000073439282],"about_ca_topic_score_codex":0.005493944,"about_ca_topic_score_gemma":0.009654383,"teacher_disagreement_score":0.005493944,"about_ca_system_score_codex":0.00036237584,"about_ca_system_score_gemma":0.0006415463,"threshold_uncertainty_score":0.010923922},"labels":[],"label_agreement":null},{"id":"W4416464763","doi":"10.1007/978-981-95-4367-0_40","title":"An Ensemble Method with Plans-Managed Policy for Proximal Policy Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","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":"Reinforcement learning; Ensemble learning; Policy learning; Optimization algorithm; Optimization problem; Ensemble forecasting","score_opus":0.015078387336756854,"score_gpt":0.29315041143452736,"score_spread":0.2780720240977705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416464763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028811458,0.00016789905,0.9954117,0.000047881356,0.00007442344,0.00002408432,0.000020635369,0.00020419416,0.0011681055],"genre_scores_gemma":[0.23991583,0.00043702207,0.74966097,0.00023735974,0.00027383873,0.00052776746,0.0003095061,0.00041233256,0.008225389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994281,0.0001958932,0.000032272037,0.000110280555,0.00016163386,0.00007175073],"domain_scores_gemma":[0.9987531,0.000746737,0.000056843433,0.00012387469,0.00022858758,0.000090978596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014688855,0.000995671,0.0020210238,0.0007355511,0.00077613874,0.000877935,0.0022423195,0.002430715,0.006176454],"category_scores_gemma":[0.0031036735,0.0009666299,0.0011467471,0.001044899,0.0007961744,0.0013133122,0.0024752377,0.0024614118,0.0011514473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008097655,0.00007162326,0.00022076626,0.00006891194,0.00007553115,0.000045684737,0.000039952454,0.87471837,0.0014046663,0.014417759,0.0022255688,0.10663022],"study_design_scores_gemma":[0.0000030027793,0.000010764581,0.0000131631805,0.000003131453,0.0000032427097,0.000004078759,0.0000013084436,0.9983646,0.00009353363,0.0013000276,0.00020095769,0.000002224768],"about_ca_topic_score_codex":0.0059562447,"about_ca_topic_score_gemma":0.0056363554,"teacher_disagreement_score":0.006176454,"about_ca_system_score_codex":0.0007215803,"about_ca_system_score_gemma":0.001510466,"threshold_uncertainty_score":0.020662248},"labels":[],"label_agreement":null},{"id":"W4416466355","doi":"10.1007/978-3-032-26891-4_12","title":"On the Comparison of LGT networks and Tree-based Networks","year":2025,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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":"Université de Sherbrooke; University of Manitoba; Université du Québec à Montréal","funders":"","keywords":"Metric (unit); Scalability; Tree (set theory); Metric space; Ideal (ethics); Transfer (computing); Base (topology); Space (punctuation)","score_opus":0.009181782960529603,"score_gpt":0.2516803484614213,"score_spread":0.2424985655008917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416466355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47416902,0.0065107928,0.47555637,0.0042541884,0.00020451509,0.00020213319,0.0038554773,0.00094371365,0.034303837],"genre_scores_gemma":[0.9028097,0.003447562,0.085188165,0.0003380311,0.00023168395,0.00012580602,0.0043344838,0.0002510477,0.0032735222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850684,0.0007361484,0.000072285,0.00023911595,0.00033025484,0.000115309456],"domain_scores_gemma":[0.9598009,0.033828095,0.0017115643,0.0016731935,0.0022302577,0.0007560819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037543378,0.0005379128,0.00082236325,0.0046216254,0.0011314319,0.0029592123,0.0014671435,0.001240988,0.005691129],"category_scores_gemma":[0.036769517,0.00030462432,0.00074063655,0.004646426,0.0013387365,0.0063387146,0.0017772068,0.0010725351,0.0005397273],"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.00087586686,0.00021626013,0.025429152,0.0007595851,0.00029248974,0.00028168436,0.0010271298,0.3389536,0.0046080244,0.42039254,0.010625912,0.1965377],"study_design_scores_gemma":[0.00003866971,0.0001386133,0.0068806135,0.00014407332,0.00012266703,0.00030185946,0.00037257196,0.6535957,0.001183757,0.3313993,0.0057969894,0.0000251406],"about_ca_topic_score_codex":0.0042916667,"about_ca_topic_score_gemma":0.004275197,"teacher_disagreement_score":0.005691129,"about_ca_system_score_codex":0.0018489381,"about_ca_system_score_gemma":0.0007961554,"threshold_uncertainty_score":0.019855022},"labels":[],"label_agreement":null},{"id":"W4416554282","doi":"10.1007/978-3-032-01887-8_5","title":"Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Glycemic Index Laboratories","funders":"","keywords":"Random oracle; Digital signature; Hash function; Schnorr signature; Cryptographic hash function; Cryptography; Merkle signature scheme; Pseudorandom number generator; Signature (topology); Block cipher","score_opus":0.01398291984168661,"score_gpt":0.2617194819523254,"score_spread":0.2477365621106388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416554282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010789864,0.00077012024,0.93954664,0.0018121297,0.0012317599,0.00023775616,0.0012922282,0.016626835,0.0276927],"genre_scores_gemma":[0.20739192,0.00070404174,0.69013846,0.0022272468,0.0009910648,0.00045358654,0.0030183573,0.018275356,0.076799996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909121,0.0019406497,0.0006648852,0.001845986,0.0031495725,0.0014867039],"domain_scores_gemma":[0.98919594,0.0028348812,0.00044086622,0.005307374,0.0018697706,0.00035111213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038174377,0.0022384566,0.0023003882,0.0035545758,0.0027871311,0.005357751,0.0045181406,0.002652015,0.048807103],"category_scores_gemma":[0.020728057,0.0018443237,0.0035179283,0.004932056,0.003387643,0.0154423835,0.007174381,0.008430721,0.02287589],"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.0012412238,0.00026640462,0.0012094019,0.0005581569,0.00013948084,0.00025756826,0.00068214437,0.01805078,0.017575344,0.4162033,0.11039414,0.43342212],"study_design_scores_gemma":[0.0001432153,0.00020899778,0.00088807795,0.000175457,0.00022553353,0.000454791,0.00031946573,0.11225706,0.03910183,0.7389282,0.10703933,0.00025802097],"about_ca_topic_score_codex":0.0036438412,"about_ca_topic_score_gemma":0.004900713,"teacher_disagreement_score":0.048807103,"about_ca_system_score_codex":0.0033243673,"about_ca_system_score_gemma":0.0035248369,"threshold_uncertainty_score":0.16327608},"labels":[],"label_agreement":null},{"id":"W4416557590","doi":"10.1007/978-3-032-07612-0_11","title":"Automatically Parallelizing Batch Inference on Deep Neural Networks Using Fiats and Fortran 2023 “Do Concurrent”","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Scalability; Inference; Leverage (statistics); Fortran; Artificial neural network; Compiler; Computation; Context (archaeology); Range (aeronautics)","score_opus":0.02276136667519307,"score_gpt":0.28838624080774095,"score_spread":0.2656248741325479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416557590","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.032344986,0.00034471077,0.876223,0.0004340382,0.0005851162,0.00014309587,0.001037302,0.07669485,0.012192811],"genre_scores_gemma":[0.1352088,0.000120348304,0.84352106,0.00033634336,0.00014545476,0.00018815366,0.003276691,0.005531083,0.011672003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936944,0.000096932046,0.00004364347,0.00023112047,0.00015569346,0.00010326238],"domain_scores_gemma":[0.9981748,0.0007719488,0.00006470047,0.0005045449,0.00039947854,0.000084534324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711321,0.001820969,0.0007777857,0.000718233,0.00087144744,0.0015369122,0.0030578936,0.0008652169,0.026331756],"category_scores_gemma":[0.0042039505,0.001317956,0.0014178413,0.0008746106,0.0008749782,0.0025782688,0.00161757,0.0025815978,0.008568828],"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.0010629098,0.00024744595,0.002297239,0.0003654636,0.00026356263,0.00026607627,0.0001901271,0.14050172,0.026235698,0.025071437,0.08467725,0.71882105],"study_design_scores_gemma":[0.00011506364,0.000052527816,0.0003752367,0.000019263514,0.000042520354,0.000040616254,0.000034296743,0.9501633,0.018258428,0.021555549,0.009320609,0.000022508124],"about_ca_topic_score_codex":0.017276643,"about_ca_topic_score_gemma":0.038444348,"teacher_disagreement_score":0.026331756,"about_ca_system_score_codex":0.001332562,"about_ca_system_score_gemma":0.0024343925,"threshold_uncertainty_score":0.08808851},"labels":[],"label_agreement":null},{"id":"W4416557610","doi":"10.1007/978-3-032-07612-0_50","title":"QRUCH Workshop Summary","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiation Effects in Electronics","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":"HEC Montréal","funders":"","keywords":"Key (lock)","score_opus":0.006207911024437899,"score_gpt":0.21866570600662982,"score_spread":0.21245779498219192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416557610","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016796315,0.012540601,0.005440364,0.008126038,0.0543149,0.00085244846,0.012278139,0.003742752,0.90102535],"genre_scores_gemma":[0.0019361927,0.0030202984,0.0010832694,0.0010123962,0.0024846643,0.00015607932,0.006153877,0.0005668236,0.98358625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993837,0.000053697386,0.000031056745,0.00010410036,0.00030220213,0.00012512598],"domain_scores_gemma":[0.9989668,0.00004601054,0.000029267703,0.00008029724,0.00041245454,0.00046520747],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011357561,0.0010343913,0.0006683624,0.0018333907,0.0008589223,0.004707635,0.0014744075,0.0013569031,0.61224985],"category_scores_gemma":[0.001212634,0.00033877042,0.00082558906,0.0011989772,0.0001834444,0.0015056088,0.003288169,0.0013993571,0.57209104],"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.000077881836,0.000039237635,0.00005620167,0.00021882678,0.0000036039442,0.000051585113,0.0000149901625,0.000106725594,0.00056706916,0.0010591651,0.9017117,0.09609304],"study_design_scores_gemma":[0.000012703875,0.000025402649,0.00023702261,0.0000830618,0.0000027386761,0.000028901602,0.000023017374,0.00004206847,0.00017512105,0.0004203252,0.9989448,0.000005002689],"about_ca_topic_score_codex":0.001960022,"about_ca_topic_score_gemma":0.0042839283,"teacher_disagreement_score":0.61224985,"about_ca_system_score_codex":0.0007121748,"about_ca_system_score_gemma":0.0018690136,"threshold_uncertainty_score":0.55307853},"labels":[],"label_agreement":null},{"id":"W4416557614","doi":"10.1007/978-3-032-07612-0_15","title":"What A Waste","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Computing and Resource Management","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":"Queen's University","funders":"","keywords":"Reuse; Offset (computer science); Metric (unit); Energy consumption; Waste heat; Efficient energy use; Resource (disambiguation); Waste-to-energy","score_opus":0.01159661073733109,"score_gpt":0.23117412298674578,"score_spread":0.21957751224941469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416557614","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034291577,0.033760857,0.003648447,0.38830104,0.026297785,0.000037974023,0.00038893078,0.0002430858,0.54389274],"genre_scores_gemma":[0.0667354,0.029983161,0.0028778226,0.1817366,0.009120404,0.00012429971,0.0006445473,0.0009956093,0.7077821],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963658,0.001040865,0.00012716613,0.00039309225,0.0013776221,0.00069540384],"domain_scores_gemma":[0.99662256,0.00081081374,0.00017247652,0.0007003129,0.0010030993,0.0006906806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004467256,0.00094319857,0.0009565513,0.002238869,0.006413297,0.014307123,0.0017062236,0.0045419014,0.06496246],"category_scores_gemma":[0.009778048,0.00047010847,0.00086194923,0.0027256215,0.013436704,0.023608811,0.006265299,0.00910197,0.022796338],"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.000044240624,0.00005183897,0.00030176117,0.00016329296,0.00001903499,0.00011540345,0.0027425482,0.00010778513,0.00018022953,0.41302964,0.5094329,0.0738113],"study_design_scores_gemma":[0.0000045276865,0.000009737783,0.0001143225,0.00036442382,0.0000051653888,0.0000720616,0.0025559473,0.000027419504,0.00009101911,0.12327869,0.87346613,0.000010561718],"about_ca_topic_score_codex":0.008441526,"about_ca_topic_score_gemma":0.012565604,"teacher_disagreement_score":0.06496246,"about_ca_system_score_codex":0.005544945,"about_ca_system_score_gemma":0.008157271,"threshold_uncertainty_score":0.2173211},"labels":[],"label_agreement":null},{"id":"W4416557768","doi":"10.1007/978-3-032-07638-0_24","title":"Rasa4JaCa - A Communication Interface Between Multi-agent Systems and Opensource Chatbot Technologies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI in Service Interactions","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Chatbot; Interface (matter); Natural language user interface; Natural language; Field (mathematics); User interface; Development (topology); Natural (archaeology)","score_opus":0.033576965159879395,"score_gpt":0.2966201576403761,"score_spread":0.2630431924804967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416557768","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.007779881,0.00033469324,0.88084835,0.00029172562,0.00044018726,0.0002997674,0.00036440676,0.068209685,0.04143127],"genre_scores_gemma":[0.19292177,0.0006061503,0.63386047,0.00071460626,0.0003392582,0.0016254185,0.0032890704,0.020243477,0.14639986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870443,0.00042995802,0.000098178534,0.00017334358,0.00045764475,0.00013641741],"domain_scores_gemma":[0.9984296,0.0007601875,0.00006893898,0.00030376573,0.0002150877,0.00022239603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021433788,0.00096553366,0.0009306774,0.001005811,0.0010748329,0.0031374237,0.0030553467,0.0018584038,0.042426944],"category_scores_gemma":[0.0041846796,0.00084200146,0.0010778846,0.00060947513,0.00072931044,0.0032723837,0.0047410154,0.0024591696,0.014432238],"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.0022801778,0.0009229393,0.0013065941,0.001472939,0.00036849928,0.0016626435,0.0042662546,0.013446273,0.092577614,0.24970987,0.14571702,0.48626912],"study_design_scores_gemma":[0.00037954547,0.00045125085,0.0012666583,0.0002864495,0.00017464695,0.0012452451,0.00044894582,0.19873212,0.047291227,0.081208006,0.6683009,0.00021511728],"about_ca_topic_score_codex":0.00068121235,"about_ca_topic_score_gemma":0.0008419477,"teacher_disagreement_score":0.042426944,"about_ca_system_score_codex":0.0004996184,"about_ca_system_score_gemma":0.00082615565,"threshold_uncertainty_score":0.14193225},"labels":[],"label_agreement":null},{"id":"W4416564574","doi":"10.1007/978-3-032-08187-2_3","title":"A Symbolic Computing Perspective on Software Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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 Waterloo","funders":"","keywords":"Compiler; Software system; Abstraction; Software development; Software; Interpreter; Symbolic trajectory evaluation; Symbolic execution; Programming complexity","score_opus":0.017285864905821947,"score_gpt":0.2573015010673413,"score_spread":0.24001563616151933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416564574","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.007664903,0.018082991,0.6097259,0.011710216,0.0008820201,0.000034560402,0.000287006,0.00047331382,0.35113913],"genre_scores_gemma":[0.65233123,0.027829131,0.22038047,0.0025678528,0.0031914823,0.00032275444,0.0005268271,0.00049977266,0.09235045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911755,0.00038109126,0.000040379466,0.00010129579,0.00027155044,0.000088087494],"domain_scores_gemma":[0.9986082,0.0009663332,0.00006586129,0.00017286812,0.00012355234,0.00006326905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868017,0.0012115678,0.0009674845,0.0028165192,0.001708779,0.0053540478,0.0017868188,0.0015905397,0.009672509],"category_scores_gemma":[0.0020469686,0.0006594044,0.00097593287,0.0037277055,0.012451037,0.009464191,0.0020178775,0.0051757535,0.001837347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.388994e-7,9.0268696e-7,0.0000055736673,0.0000102050335,6.626526e-7,0.0000056074855,0.000044582514,0.00034355815,0.000030532192,0.9979619,0.0004234444,0.0011722669],"study_design_scores_gemma":[0.0000015182462,0.0000022884208,0.0000084203275,0.000014514348,0.0000011979259,0.000011514009,0.000031146552,0.0012597117,0.000051687468,0.9892157,0.009400621,0.0000017490513],"about_ca_topic_score_codex":0.0026526155,"about_ca_topic_score_gemma":0.0023454733,"teacher_disagreement_score":0.009672509,"about_ca_system_score_codex":0.0035757297,"about_ca_system_score_gemma":0.001247391,"threshold_uncertainty_score":0.032357812},"labels":[],"label_agreement":null},{"id":"W4416564610","doi":"10.1007/978-3-032-08187-2_4","title":"GPU Implementations for Midsize Integer Addition and Multiplication","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"CUDA; Multiplication (music); Fast Fourier transform; Integer (computer science); Computation; Implementation; Domain (mathematical analysis); SIMD","score_opus":0.018900148783402314,"score_gpt":0.29475572556548485,"score_spread":0.27585557678208256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416564610","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.02744682,0.0015622616,0.8738121,0.00034287715,0.0007566854,0.00014625308,0.0011078622,0.014306162,0.08051903],"genre_scores_gemma":[0.12451194,0.00080956565,0.81014085,0.00022940997,0.00012197381,0.00023610471,0.0023195231,0.0020696004,0.059560936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996946,0.000034851706,0.000021898466,0.000026633601,0.00017329137,0.000048761187],"domain_scores_gemma":[0.9996076,0.000085908476,0.000017833332,0.000090202164,0.00016166073,0.000036667006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022363738,0.0010517967,0.00059148396,0.00090040936,0.0005197114,0.001403443,0.0017076423,0.00069497846,0.041479427],"category_scores_gemma":[0.0015283055,0.00044944565,0.0005111536,0.002173672,0.00022310301,0.0010896262,0.0011500152,0.0010471835,0.013180897],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066878705,0.00018612645,0.000788012,0.00038271063,0.000092672875,0.00031645116,0.00020965931,0.034362387,0.028374583,0.06726956,0.09441331,0.77293575],"study_design_scores_gemma":[0.00024782403,0.00020101573,0.00089274027,0.00012516264,0.000051798208,0.0005946693,0.00014704185,0.72608805,0.040037524,0.050231498,0.18131955,0.00006307928],"about_ca_topic_score_codex":0.0030776323,"about_ca_topic_score_gemma":0.009132862,"teacher_disagreement_score":0.041479427,"about_ca_system_score_codex":0.000604444,"about_ca_system_score_gemma":0.00092762045,"threshold_uncertainty_score":0.13876253},"labels":[],"label_agreement":null},{"id":"W4416676327","doi":"10.1007/978-981-95-4960-3_23","title":"Causal Temporal Transformer: An Integrated Framework for Temporal Causal Discovery and Multi-target Prediction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Queen's University; Royal Military College of Canada; University of Ottawa","funders":"","keywords":"Interpretability; Causal model; Causality (physics); Causal inference; Causal analysis; Mechanism (biology); Temporal database; Causal structure","score_opus":0.0255903492040286,"score_gpt":0.27821705394297463,"score_spread":0.25262670473894605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416676327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045724964,0.00016430451,0.99793833,0.00010600712,0.000028121467,0.000020362722,0.0001351032,0.0004513899,0.00069904106],"genre_scores_gemma":[0.085525095,0.0012263027,0.90699106,0.00023621369,0.00023075985,0.00022285827,0.0008960062,0.00045192044,0.004219863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978192,0.00082560926,0.0001470092,0.0004476702,0.00062400993,0.00013649811],"domain_scores_gemma":[0.99373287,0.0045809154,0.00032487363,0.00065018056,0.00048253144,0.00022869685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005703487,0.0013806334,0.002006351,0.0024118437,0.0008735795,0.0037237422,0.004515231,0.0020297763,0.011168806],"category_scores_gemma":[0.015121891,0.0012711606,0.002709116,0.0038473636,0.001686428,0.005855848,0.004258615,0.003725087,0.0020107527],"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.0003287151,0.00013436981,0.0010893182,0.0003316965,0.00031277005,0.00038095252,0.00025856408,0.17032981,0.0018864769,0.6073239,0.009806446,0.20781703],"study_design_scores_gemma":[0.000023413144,0.000021345619,0.00010393955,0.000025626347,0.00006342455,0.00009409859,0.000019550438,0.6703698,0.00071497745,0.32369435,0.004843938,0.00002548239],"about_ca_topic_score_codex":0.008761416,"about_ca_topic_score_gemma":0.009844728,"teacher_disagreement_score":0.011168806,"about_ca_system_score_codex":0.0014764323,"about_ca_system_score_gemma":0.0034985093,"threshold_uncertainty_score":0.03736341},"labels":[],"label_agreement":null},{"id":"W4416684075","doi":"10.1007/978-981-95-4972-6","title":"AI 2025: Advances in Artificial Intelligence","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Internet of Things and AI","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":"Beijing Institute of Technology; University of South Australia; Victoria University; RMIT University; Monash University; Griffith University; Deakin University; University of Western Sydney; Harbin Institute of Technology; University of New South Wales; University of Technology Sydney; Victoria University of Wellington; Macquarie University; Singapore Management University; Zhejiang Normal University; York University; La Trobe University; University of Minnesota; Commonwealth Scientific and Industrial Research Organisation; Auckland University of Technology, New Zealand; University of Otago","keywords":"","score_opus":0.013227663653576405,"score_gpt":0.28171787993378167,"score_spread":0.26849021628020525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416684075","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068986544,0.21990561,0.039386336,0.0061840373,0.028115582,0.00013268279,0.0014590967,0.0018942555,0.70223254],"genre_scores_gemma":[0.00876391,0.13391492,0.0335515,0.0037884288,0.009994059,0.0001889273,0.0042146556,0.0011516549,0.8044319],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876523,0.0001611626,0.000073956806,0.00014181648,0.0007669308,0.00009099793],"domain_scores_gemma":[0.9985998,0.0005692929,0.00006360811,0.00013924074,0.00038939802,0.00023870803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013491773,0.002110439,0.001718401,0.0037130322,0.0007131396,0.006485777,0.0019627812,0.0018501248,0.09975561],"category_scores_gemma":[0.002645378,0.00066371314,0.0009047307,0.005241603,0.0010810874,0.0060229134,0.0018468307,0.0039696163,0.0694783],"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.000031403437,0.000034941775,0.000043604094,0.0006860823,0.000021328518,0.000025674823,0.0000355162,0.0005884802,0.0005121303,0.050406404,0.717428,0.2301864],"study_design_scores_gemma":[0.000007268514,0.000021488442,0.00013901324,0.00028552598,0.000009751069,0.00008647183,0.000017290835,0.0009392835,0.00019534174,0.016961602,0.98132825,0.000008694495],"about_ca_topic_score_codex":0.0018311258,"about_ca_topic_score_gemma":0.0028049827,"teacher_disagreement_score":0.09975561,"about_ca_system_score_codex":0.00180187,"about_ca_system_score_gemma":0.0024067801,"threshold_uncertainty_score":0.3337158},"labels":[],"label_agreement":null},{"id":"W4416684846","doi":"10.1007/978-3-032-12086-1_2","title":"A Modular Orthogonal Integration of Operational and Prescriptive Timing Requirements Using TASTD","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Modular design; Process (computing); Formal specification; Unified Modeling Language; Scheme (mathematics); System requirements specification; Formal methods; Software requirements specification","score_opus":0.06379155558351089,"score_gpt":0.3194676322387537,"score_spread":0.2556760766552428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416684846","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.004809256,0.000039204828,0.98948026,0.000047534213,0.000037048645,0.00009606535,0.00004567273,0.0020577812,0.003387205],"genre_scores_gemma":[0.17394282,0.0001225033,0.81955695,0.00010785226,0.000045713798,0.00018984995,0.00027002423,0.00082819676,0.0049360595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739265,0.0004086646,0.00023349228,0.00038073424,0.0013426766,0.00024171047],"domain_scores_gemma":[0.99660945,0.00096598786,0.00028524577,0.0011908534,0.00081352517,0.0001349364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311137,0.0007728073,0.0006709654,0.00095327373,0.00037642338,0.0017195916,0.001368263,0.0006267877,0.0056345677],"category_scores_gemma":[0.0044885273,0.00074330147,0.0013638014,0.00058555696,0.0010282726,0.0016576761,0.0022204511,0.001443334,0.0021429483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047798455,0.00025003386,0.001651357,0.0006195782,0.00014402959,0.0007610955,0.00062728254,0.077215806,0.2123976,0.23743619,0.0052879415,0.46313107],"study_design_scores_gemma":[0.00016702028,0.0006587367,0.00077009114,0.00023044224,0.00031836532,0.0012163146,0.00016546847,0.6000501,0.20587161,0.10351661,0.08692485,0.00011039924],"about_ca_topic_score_codex":0.0010476295,"about_ca_topic_score_gemma":0.00135268,"teacher_disagreement_score":0.0056345677,"about_ca_system_score_codex":0.00053110224,"about_ca_system_score_gemma":0.0018989344,"threshold_uncertainty_score":0.018849552},"labels":[],"label_agreement":null},{"id":"W4416830129","doi":"10.1007/978-3-032-12405-0_23","title":"Searching Playtrace Data to Identify and Evaluate Dramatic Arcs in Game Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Narrative; Testbed; Process (computing); Game design; Iterative and incremental development; Arc (geometry); Plot (graphics); Video game; Experiential learning","score_opus":0.08777442122237646,"score_gpt":0.37309092684116757,"score_spread":0.2853165056187911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416830129","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.8002763,0.0012874053,0.12771516,0.00031742128,0.00012882201,0.00064871134,0.042288415,0.0137740895,0.01356375],"genre_scores_gemma":[0.90506494,0.00024405494,0.062953465,0.000027849164,0.0000134124775,0.00018096677,0.029142981,0.00025277556,0.0021196492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927956,0.00012182116,0.00007169088,0.00015048042,0.00030925233,0.000067154375],"domain_scores_gemma":[0.99623173,0.0023043428,0.00028537054,0.00037729385,0.0006336478,0.00016757663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078806945,0.00061917887,0.00048296846,0.006523587,0.0005215165,0.0015208117,0.0009091062,0.0005923626,0.0035241884],"category_scores_gemma":[0.006434718,0.00023793112,0.00051634805,0.0029373849,0.00038024088,0.001700865,0.0009880668,0.0007420378,0.0013225973],"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.0021814478,0.001254257,0.22745581,0.0014093595,0.0005127884,0.00045565979,0.0017905006,0.08904874,0.024127817,0.008499899,0.024956586,0.6183072],"study_design_scores_gemma":[0.000097403594,0.0005149973,0.12918293,0.00018901097,0.00017073586,0.00028444512,0.002421337,0.8132403,0.025727054,0.008945438,0.019128509,0.00009776319],"about_ca_topic_score_codex":0.025073702,"about_ca_topic_score_gemma":0.04190024,"teacher_disagreement_score":0.025073702,"about_ca_system_score_codex":0.0010602868,"about_ca_system_score_gemma":0.00087033433,"threshold_uncertainty_score":0.04985553},"labels":[],"label_agreement":null},{"id":"W4416830619","doi":"10.1007/978-3-032-12408-1_8","title":"Combining Experiential and Spatial Data for Immersive AR Narrative Creation: A Phased Methodology","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","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":"Greenfield Research (Canada); Dalhousie University","funders":"","keywords":"Narrative; Locative case; Storytelling; Experiential learning; Context (archaeology); Augmented reality; Situated; Cognitive dissonance","score_opus":0.07518176386148227,"score_gpt":0.3586176309282973,"score_spread":0.283435867066815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416830619","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.0054635443,0.000075000935,0.9891783,0.000069514586,0.000019223846,0.00016792788,0.000073206545,0.00020501055,0.0047482904],"genre_scores_gemma":[0.11015526,0.00017842463,0.8859835,0.000030653537,0.000014518587,0.00041547546,0.00017057771,0.00014808224,0.0029034973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986058,0.000633124,0.000072199146,0.0002110889,0.00041213917,0.000065774315],"domain_scores_gemma":[0.9960824,0.0027678572,0.00015131911,0.00052189187,0.00039261504,0.000083913255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026073596,0.0008205946,0.00039901925,0.0012249383,0.0005914924,0.0038583349,0.0016159996,0.00076557783,0.011213367],"category_scores_gemma":[0.0060414025,0.0010116387,0.00069328625,0.00135652,0.0019516941,0.0045648804,0.0041970634,0.00092364213,0.0013058933],"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.00032932134,0.0003982361,0.001475806,0.0013885298,0.00009242076,0.00025219715,0.012097111,0.02254254,0.08033733,0.28907582,0.0023358483,0.5896749],"study_design_scores_gemma":[0.00026591745,0.0013542745,0.0035304213,0.0009605543,0.0002631615,0.0019992085,0.013876206,0.3907055,0.19518761,0.2747382,0.11684125,0.00027777877],"about_ca_topic_score_codex":0.00035352708,"about_ca_topic_score_gemma":0.0006508249,"teacher_disagreement_score":0.011213367,"about_ca_system_score_codex":0.0003694151,"about_ca_system_score_gemma":0.0009188591,"threshold_uncertainty_score":0.03751242},"labels":[],"label_agreement":null},{"id":"W4416830635","doi":"10.1007/978-3-032-12408-1_20","title":"Developing a Ludonarrative Engine for a Historical Site Using Locative AR and Music: Psychogeography for Battle of the Boyne","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Augmented Reality Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"HORIZON EUROPE Framework Programme; European Commission","keywords":"Battle; Narrative; Storytelling; Locative case; Situated; Digital storytelling","score_opus":0.03521301646724908,"score_gpt":0.2802642946272504,"score_spread":0.2450512781600013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416830635","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.5652921,0.00076902844,0.3062078,0.002274112,0.00036108698,0.00091598794,0.00033967986,0.003345586,0.120494656],"genre_scores_gemma":[0.8105612,0.0004038073,0.14906314,0.00030575087,0.00004185866,0.00035606808,0.00021256079,0.0007123325,0.038343336],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892884,0.0006531817,0.00003332235,0.0001061182,0.0001685696,0.00010985187],"domain_scores_gemma":[0.99839896,0.0009662473,0.000074598756,0.00020032759,0.00012298694,0.00023690259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020612688,0.00078571757,0.00026156436,0.0012494725,0.0021650728,0.005394961,0.0013860011,0.0010399612,0.008364625],"category_scores_gemma":[0.002740839,0.00033390435,0.0005516239,0.00044061654,0.003946441,0.0031540482,0.004740817,0.0011233301,0.0013634325],"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.00040313628,0.00078387745,0.00880437,0.0014490522,0.000072615934,0.0066802073,0.6059818,0.006976174,0.07635914,0.10038999,0.017185764,0.17491381],"study_design_scores_gemma":[0.00013253298,0.0007869607,0.007889351,0.00097276404,0.000116812356,0.0044193864,0.28148484,0.020258127,0.02944255,0.017465545,0.6367311,0.00029998852],"about_ca_topic_score_codex":0.0015981712,"about_ca_topic_score_gemma":0.0045396793,"teacher_disagreement_score":0.008364625,"about_ca_system_score_codex":0.0009790224,"about_ca_system_score_gemma":0.0006945073,"threshold_uncertainty_score":0.027982414},"labels":[],"label_agreement":null},{"id":"W4416830641","doi":"10.1007/978-3-032-12408-1_17","title":"Hacking Twine as a System: Implications of Extending State-Based Tracking Elements and Application Packaging for HTML-Based IDNs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hacker; Tracking (education); History of computing; Tracking system","score_opus":0.020069018424960738,"score_gpt":0.2895862105223878,"score_spread":0.2695171920974271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416830641","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.06295443,0.00048048244,0.7756108,0.0025906642,0.00052955165,0.00020592238,0.00010246696,0.005226557,0.1522991],"genre_scores_gemma":[0.5325141,0.00077106786,0.3703166,0.0010725227,0.00012645812,0.00019174279,0.00025020164,0.0021450054,0.09261236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782926,0.00067325303,0.00017025425,0.00030711739,0.0007934289,0.0002267764],"domain_scores_gemma":[0.9893623,0.0038010438,0.0003270478,0.005428881,0.0008576243,0.00022309528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038596308,0.00045454162,0.0004646759,0.0007225898,0.0013398909,0.006009284,0.001953299,0.002416491,0.008329872],"category_scores_gemma":[0.0115187485,0.00084066263,0.0007160505,0.00087007094,0.003210706,0.016717577,0.003910882,0.0040840236,0.0024250862],"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.00014601242,0.00017617297,0.0016753143,0.0001340224,0.000015508655,0.0005552825,0.002207618,0.009447148,0.008851736,0.8249373,0.005380602,0.14647333],"study_design_scores_gemma":[0.000027462627,0.00022206141,0.0012520767,0.00034291524,0.00009160819,0.0016578084,0.0011266685,0.14145984,0.06088407,0.61499566,0.17783625,0.00010350489],"about_ca_topic_score_codex":0.0010608424,"about_ca_topic_score_gemma":0.00139827,"teacher_disagreement_score":0.008329872,"about_ca_system_score_codex":0.001086997,"about_ca_system_score_gemma":0.001048263,"threshold_uncertainty_score":0.027866185},"labels":[],"label_agreement":null},{"id":"W4416866370","doi":"10.1007/978-3-032-12287-2_12","title":"Linear Prover IOPs in Log Star Rounds","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Gas meter prover; Oracle; Cryptography; Boolean function; Mathematical proof; Iterated function; Time complexity; Random oracle; Boolean circuit","score_opus":0.012729413396243373,"score_gpt":0.24546707933597225,"score_spread":0.2327376659397289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416866370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03218312,0.0012521456,0.6565745,0.005492511,0.0009995474,0.00033342864,0.001491668,0.010981871,0.2906912],"genre_scores_gemma":[0.57949674,0.001423946,0.16347536,0.0021208683,0.00093325815,0.0005496318,0.002076654,0.004107323,0.24581616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653864,0.0009686497,0.00016958175,0.00045197285,0.001129483,0.0007416858],"domain_scores_gemma":[0.9940402,0.0031730747,0.00017093634,0.0019146183,0.000444217,0.0002568213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024678563,0.0011899547,0.0016058573,0.0011876668,0.0022281331,0.0040197093,0.0018276419,0.0011587914,0.041271932],"category_scores_gemma":[0.0075250543,0.0012319661,0.0014232228,0.0020972206,0.0023051975,0.008500172,0.004852496,0.0056699696,0.015899861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007254775,0.00017063475,0.00040510742,0.00034783906,0.00003606935,0.00012231673,0.00038745068,0.006139768,0.0022250523,0.852897,0.04446043,0.092082895],"study_design_scores_gemma":[0.00009614778,0.000092143644,0.00016459796,0.00006101031,0.000032115116,0.00015427581,0.00008877726,0.025978707,0.0051242765,0.9370028,0.031179149,0.000026039257],"about_ca_topic_score_codex":0.0005972306,"about_ca_topic_score_gemma":0.0009561687,"teacher_disagreement_score":0.041271932,"about_ca_system_score_codex":0.0019560338,"about_ca_system_score_gemma":0.0024712957,"threshold_uncertainty_score":0.13806832},"labels":[],"label_agreement":null},{"id":"W4416884788","doi":"10.1007/978-3-032-12293-3_7","title":"Obfuscating Pseudorandom Functions is Post-quantum Complete","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ethereum Foundation; Fondazione Cariplo; Cisco Systems; National Science Foundation","keywords":"Homomorphic encryption; Class (philosophy); Obfuscation; Pseudorandom number generator; Pseudorandom function family; Encryption; Cryptography; Computation","score_opus":0.016334465133424545,"score_gpt":0.24105000517364336,"score_spread":0.22471554004021882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416884788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0808557,0.001443442,0.7154289,0.00561896,0.00070662494,0.00028610736,0.0008842217,0.0015839183,0.19319218],"genre_scores_gemma":[0.80480444,0.0024985275,0.09276088,0.0014760256,0.0010195528,0.00042975915,0.00093166326,0.0008735247,0.09520557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971794,0.000460789,0.00012376836,0.00039127693,0.0014139934,0.00043080954],"domain_scores_gemma":[0.994686,0.002907447,0.00025860735,0.0015526937,0.00043975996,0.00015541048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951226,0.0013509941,0.0016469494,0.0012224527,0.0015091434,0.0033680305,0.001296789,0.001825061,0.010053005],"category_scores_gemma":[0.00497128,0.00094076054,0.0017261083,0.0013541295,0.004947324,0.0076596774,0.0040202113,0.0054930816,0.0032885722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006293336,0.000038888546,0.00009446677,0.000102235324,0.000020501657,0.000046953744,0.000106870044,0.0041627726,0.0018326507,0.9719149,0.0028967296,0.01872014],"study_design_scores_gemma":[0.000014344375,0.00003543353,0.0001374042,0.000030951807,0.000014679627,0.00009644885,0.00002048595,0.010292588,0.0039038418,0.979297,0.006139526,0.00001723633],"about_ca_topic_score_codex":0.00037667935,"about_ca_topic_score_gemma":0.00045589352,"teacher_disagreement_score":0.010053005,"about_ca_system_score_codex":0.0014607796,"about_ca_system_score_gemma":0.001998265,"threshold_uncertainty_score":0.03363067},"labels":[],"label_agreement":null},{"id":"W4416906474","doi":"10.1007/978-3-032-11976-6_31","title":"Enhancing Algorithms with LLMs: A Case Study","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Alberta","funders":"","keywords":"Focus (optics); Domain (mathematical analysis); Range (aeronautics); Domain-specific language; Key (lock); Domain knowledge","score_opus":0.011068887952618607,"score_gpt":0.2676347582028158,"score_spread":0.25656587025019717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416906474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46760935,0.0012259297,0.4739423,0.0020790026,0.00009683674,0.00045286657,0.0002753234,0.0020877467,0.052230693],"genre_scores_gemma":[0.71597254,0.00032068978,0.27216363,0.00016495619,0.00003225282,0.00009499396,0.0001333571,0.00022130548,0.010896228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814403,0.0009869965,0.00007488696,0.00015870693,0.00049253996,0.00014299141],"domain_scores_gemma":[0.9871868,0.009545178,0.00035436056,0.0014661177,0.0011848487,0.00026278896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003195103,0.000490591,0.00037128685,0.00071009016,0.00061517156,0.0015692979,0.001545345,0.0020376851,0.005039952],"category_scores_gemma":[0.014346628,0.0001741027,0.0004114951,0.0011454179,0.0009409968,0.0019447161,0.0009911045,0.0009838585,0.0010305915],"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.0013377261,0.0021703066,0.009026385,0.0010908045,0.00010233365,0.0029404715,0.0019277903,0.21541691,0.017586943,0.06433153,0.012565233,0.6715035],"study_design_scores_gemma":[0.00021211275,0.0013609352,0.0028511032,0.00013284847,0.00012043397,0.00251504,0.0012388921,0.8511129,0.04787931,0.039458554,0.05306874,0.000049206134],"about_ca_topic_score_codex":0.002164013,"about_ca_topic_score_gemma":0.0033048638,"teacher_disagreement_score":0.005039952,"about_ca_system_score_codex":0.000862706,"about_ca_system_score_gemma":0.0005667034,"threshold_uncertainty_score":0.01689756},"labels":[],"label_agreement":null},{"id":"W4417090287","doi":"10.1007/978-981-95-5122-4_15","title":"Pseudorandom Correlation Generators for Multiparty Beaver Triples over $$\\mathbb {F}_2$$","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Brown University; National Science Foundation","keywords":"Pseudorandom number generator; Overhead (engineering); Multiplicative function; Cryptography; Random seed; Generator (circuit theory); Random number generation; Protocol (science)","score_opus":0.011224961592334541,"score_gpt":0.2398397259208412,"score_spread":0.22861476432850666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417090287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083911434,0.00067945896,0.7719959,0.0017541108,0.0008344896,0.00042754743,0.00075392623,0.002901806,0.13674136],"genre_scores_gemma":[0.8173263,0.0005632939,0.09220979,0.00068533083,0.0004594173,0.0006218483,0.00063658284,0.0010210607,0.08647649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983907,0.00037312234,0.00006224318,0.00022623978,0.0006136518,0.0003340576],"domain_scores_gemma":[0.99864835,0.00053085596,0.00013247337,0.00041459186,0.00015686237,0.000116871546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144753,0.00079806196,0.00087608106,0.0009850318,0.0014252511,0.0025066028,0.0009278012,0.0013059742,0.016183129],"category_scores_gemma":[0.0033949437,0.00047564073,0.0007058208,0.0012520005,0.0015178656,0.0031180216,0.0027885775,0.0026243525,0.004980041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000894472,0.00003647511,0.00008511166,0.000034118788,0.00000972147,0.00009150047,0.00007253097,0.0021242828,0.0030048694,0.9753059,0.003675586,0.0154705085],"study_design_scores_gemma":[0.00004076201,0.000060153074,0.00016239037,0.000059502072,0.000015072714,0.0002427183,0.000032674605,0.027034516,0.01371269,0.9421607,0.0164335,0.000045255565],"about_ca_topic_score_codex":0.00020613906,"about_ca_topic_score_gemma":0.00035512395,"teacher_disagreement_score":0.016183129,"about_ca_system_score_codex":0.00096044305,"about_ca_system_score_gemma":0.0008506431,"threshold_uncertainty_score":0.054138005},"labels":[],"label_agreement":null},{"id":"W4417090922","doi":"10.1007/978-981-95-5125-5_11","title":"Signatures From Pseudorandom States via $$\\bot $$-PRFs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Commission","keywords":"Pseudorandomness; Pseudorandom function family; Pseudorandom number generator; Correctness; Digital signature; Construct (python library); Cryptography; Pseudorandom generator theorem; Pseudorandom generator; Discrete logarithm","score_opus":0.007799615261388213,"score_gpt":0.22809440012909377,"score_spread":0.22029478486770554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417090922","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.018625934,0.00035424926,0.92883015,0.0011490626,0.00047642045,0.00031808438,0.0004794853,0.0086901495,0.041076496],"genre_scores_gemma":[0.6807118,0.00075639103,0.2397618,0.0011583179,0.0004777562,0.00081099174,0.0010105696,0.002173233,0.07313917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958988,0.0010380204,0.0002341524,0.00064403855,0.0016727071,0.0005123942],"domain_scores_gemma":[0.9952766,0.001868093,0.00024781204,0.0021170762,0.00037606643,0.00011431387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954568,0.0010872817,0.0011814107,0.001168024,0.0011441475,0.0030261583,0.0017614547,0.0018188623,0.018784182],"category_scores_gemma":[0.008209623,0.00072044006,0.0011158511,0.0013542959,0.0027185266,0.0069295033,0.0045778127,0.0033367772,0.008638447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003496831,0.000084589585,0.00016226887,0.00015276013,0.000022985381,0.000093878014,0.00016018043,0.009535016,0.0047323448,0.8453186,0.0107661765,0.12862155],"study_design_scores_gemma":[0.00008727533,0.00011329673,0.00011394819,0.000069492104,0.000029989655,0.00031739025,0.000043228367,0.07949063,0.01939391,0.8693087,0.030972028,0.00006012389],"about_ca_topic_score_codex":0.00034029502,"about_ca_topic_score_gemma":0.00039907862,"teacher_disagreement_score":0.018784182,"about_ca_system_score_codex":0.0013878504,"about_ca_system_score_gemma":0.001385664,"threshold_uncertainty_score":0.06283939},"labels":[],"label_agreement":null},{"id":"W44195261","doi":"10.1007/978-3-319-11851-2_1","title":"Integrating Trust and Economic Theories with Knowledge Science for Dependable Service Automation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Quality and Management","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Computer science; Service (business); Knowledge management; Automation; Computational trust; Domain (mathematical analysis); Domain knowledge; Service design; Service provider; Computer security; Reputation; Business; Engineering; Marketing","score_opus":0.04662471210549109,"score_gpt":0.3351982024288138,"score_spread":0.28857349032332275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44195261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018594451,0.0110137435,0.7721194,0.024993572,0.00078902306,0.00006873857,0.00015277059,0.0001336545,0.17213467],"genre_scores_gemma":[0.8500307,0.011959519,0.1103577,0.0012466919,0.0011825091,0.00015235522,0.00016944161,0.00008756362,0.024813512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985428,0.00056560873,0.000116618496,0.00011801984,0.0005411466,0.00011582777],"domain_scores_gemma":[0.9933814,0.004964486,0.00035679096,0.00061344163,0.00052423525,0.00015967319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030126225,0.0006399015,0.0008172301,0.00184175,0.0009389843,0.0049355538,0.0016095901,0.002593941,0.0054056128],"category_scores_gemma":[0.0087299915,0.0004560185,0.001063283,0.002278191,0.006772615,0.011687616,0.0024170235,0.003995943,0.0007472218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030435094,0.000009741097,0.00006447058,0.00003662897,0.000009006026,0.000024433382,0.00007698118,0.0034542766,0.000041967458,0.9877769,0.00076594163,0.0077366335],"study_design_scores_gemma":[0.0000014679658,0.0000035166145,0.000036033078,0.000024934665,0.0000033007225,0.000012922469,0.000034712077,0.008209276,0.0000624307,0.98821986,0.0033868838,0.0000046170126],"about_ca_topic_score_codex":0.0036671632,"about_ca_topic_score_gemma":0.002708583,"teacher_disagreement_score":0.0054056128,"about_ca_system_score_codex":0.004254474,"about_ca_system_score_gemma":0.0018673072,"threshold_uncertainty_score":0.03086853},"labels":[],"label_agreement":null},{"id":"W44570478","doi":"10.1007/978-3-642-24031-7_26","title":"Raydiance: A Tangible Interface for Teaching Computer Vision","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","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 Victoria","funders":"","keywords":"Computer science; Security token; Construct (python library); Human–computer interaction; Interface (matter); Graph; Task (project management); Metaphor; User interface; Brain–computer interface; Artificial intelligence; Theoretical computer science; Programming language; Computer network","score_opus":0.0174783733785895,"score_gpt":0.28533762615467,"score_spread":0.2678592527760805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44570478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009312252,0.0046761376,0.89176875,0.00026347168,0.0003626414,0.00020552569,0.00054048095,0.019261854,0.07360897],"genre_scores_gemma":[0.071609765,0.0071555763,0.61993784,0.0004700672,0.00010604069,0.00032068853,0.0016741519,0.004472263,0.2942535],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980694,0.000022659064,0.0000077631275,0.00003743116,0.00010313945,0.000022202517],"domain_scores_gemma":[0.9998468,0.00006974838,0.000006802692,0.000021157277,0.00003054325,0.000024897978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027206822,0.0010018889,0.0003653794,0.0005667182,0.00022570236,0.00089931366,0.0011668963,0.00074084586,0.07755657],"category_scores_gemma":[0.0006103602,0.00043441614,0.0004961393,0.0005226927,0.00026896014,0.0012186981,0.00095705094,0.0012265864,0.012884744],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021663964,0.00014055676,0.00012500747,0.00069879065,0.000027549864,0.00017056814,0.00047941334,0.0021116477,0.13198677,0.014969166,0.050995942,0.798078],"study_design_scores_gemma":[0.00017161784,0.00074810756,0.0022911704,0.00033141306,0.0000666186,0.0025348612,0.00020546236,0.024704674,0.12491845,0.009251327,0.83463615,0.00014018612],"about_ca_topic_score_codex":0.0008583414,"about_ca_topic_score_gemma":0.0014976235,"teacher_disagreement_score":0.07755657,"about_ca_system_score_codex":0.0003010899,"about_ca_system_score_gemma":0.00043093858,"threshold_uncertainty_score":0.25945258},"labels":[],"label_agreement":null},{"id":"W44589754","doi":"10.1007/978-3-642-20807-2_2","title":"Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Matching (statistics); Birkhoff polytope; Mathematics; Operator (biology); Discrete mathematics; Statistics","score_opus":0.09363086593594758,"score_gpt":0.297366810238937,"score_spread":0.20373594430298944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44589754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.184426,0.006022659,0.67401177,0.00887432,0.000576733,0.00038429984,0.0017466241,0.0004960344,0.123461574],"genre_scores_gemma":[0.68272096,0.0047001382,0.24634902,0.0013122318,0.0013842446,0.0009824118,0.0030608543,0.0010926691,0.058397435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973117,0.0008004927,0.0000880828,0.00042508822,0.00089090713,0.00048362496],"domain_scores_gemma":[0.9894114,0.007928897,0.00058620307,0.0007949373,0.00066547253,0.0006130848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038081412,0.0018637868,0.0028322414,0.002787578,0.0021750345,0.0047881906,0.0047811177,0.0027499686,0.018667273],"category_scores_gemma":[0.017377537,0.0015870648,0.0035822643,0.004148686,0.0032631147,0.011113636,0.0036673779,0.008824036,0.0014237073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002122748,0.00024670683,0.0006396526,0.00028847106,0.00008583894,0.00006132129,0.00036802006,0.10682817,0.0011879175,0.85247016,0.012992054,0.024619458],"study_design_scores_gemma":[0.000058728863,0.000049044305,0.00060481037,0.000057502224,0.000046292545,0.00004224667,0.00013440005,0.2821923,0.0005501166,0.7124727,0.0037571366,0.000034776658],"about_ca_topic_score_codex":0.0052046357,"about_ca_topic_score_gemma":0.0060515646,"teacher_disagreement_score":0.018667273,"about_ca_system_score_codex":0.0053303214,"about_ca_system_score_gemma":0.0025322638,"threshold_uncertainty_score":0.062448263},"labels":[],"label_agreement":null},{"id":"W44696785","doi":"10.1007/978-3-642-39229-0_4","title":"Context as a System, Product as a Component, and the Relationship as Experience","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"Affordance; Computer science; Human–computer interaction; Component (thermodynamics); Context (archaeology); Product design; User experience design; Focus (optics); Industrial design; Product (mathematics); User interface; Interaction design; Multimedia; Engineering","score_opus":0.02753252508343012,"score_gpt":0.27359319131884813,"score_spread":0.246060666235418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44696785","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16653948,0.063853614,0.14586933,0.009156729,0.00046651738,0.00008096093,0.0001496852,0.00021435773,0.61366934],"genre_scores_gemma":[0.9488987,0.010412944,0.013903044,0.00025747187,0.00011432679,0.00006617093,0.000054543267,0.00006294234,0.026229778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929357,0.00037301285,0.000029298504,0.00010226232,0.00014383772,0.00005808168],"domain_scores_gemma":[0.99864393,0.0009792652,0.00012016501,0.00009444766,0.00006902898,0.000093202856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730385,0.00039750917,0.00031139742,0.00094627246,0.0009912986,0.00695423,0.0006248153,0.001052181,0.0071110586],"category_scores_gemma":[0.002364173,0.00035176644,0.00033253102,0.0018060653,0.004731323,0.008689682,0.0018251202,0.001475669,0.00065053534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045203127,0.000039400747,0.0019424186,0.0001839186,0.000017585062,0.00022060279,0.009446976,0.000924059,0.0011835136,0.93906087,0.0011951725,0.045740258],"study_design_scores_gemma":[0.000021249503,0.00018611879,0.008284377,0.00038591493,0.000084951585,0.0009245993,0.010207874,0.00497919,0.0011340275,0.8513684,0.12236992,0.0000534185],"about_ca_topic_score_codex":0.0023367573,"about_ca_topic_score_gemma":0.0026128364,"teacher_disagreement_score":0.0071110586,"about_ca_system_score_codex":0.0010580679,"about_ca_system_score_gemma":0.00092289347,"threshold_uncertainty_score":0.023788929},"labels":[],"label_agreement":null},{"id":"W44815768","doi":"10.1007/978-3-642-35289-8_32","title":"A Practical Guide to Training Restricted Boltzmann Machines","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":2825,"is_retracted":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":"Boltzmann machine; Computer science; Set (abstract data type); Artificial intelligence; Generative grammar; Training set; Machine learning; Divergence (linguistics); Artificial neural network","score_opus":0.03733683725891546,"score_gpt":0.29671673500368906,"score_spread":0.2593798977447736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44815768","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.00028509033,0.0017450838,0.9766506,0.00035773925,0.00022426623,0.000054638767,0.0008534369,0.0033211024,0.016508153],"genre_scores_gemma":[0.008183428,0.002508205,0.932865,0.00058011705,0.00022585719,0.0005607014,0.0020077096,0.0023887842,0.05068011],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953353,0.00011080446,0.00004318441,0.00008380997,0.00019436293,0.00003439968],"domain_scores_gemma":[0.9988212,0.0007339102,0.000025759293,0.00019375802,0.00019671902,0.000028695022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063210825,0.0014506164,0.0009137404,0.0009324903,0.00045689917,0.0016246585,0.0021376263,0.0019081704,0.09129911],"category_scores_gemma":[0.0058054323,0.0013126283,0.0008387299,0.0016251093,0.0006641716,0.0019114199,0.0015581339,0.0036886167,0.048799884],"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.000053464817,0.000076926,0.00019815659,0.0006515492,0.00004920475,0.0001664731,0.00010079286,0.05869308,0.00458409,0.16786957,0.1776134,0.5899433],"study_design_scores_gemma":[0.000061880346,0.0000408737,0.00024058369,0.00032997094,0.000026570026,0.0004026153,0.000048708953,0.2478699,0.0049021957,0.40091285,0.3451011,0.00006284751],"about_ca_topic_score_codex":0.00219469,"about_ca_topic_score_gemma":0.0072970595,"teacher_disagreement_score":0.09129911,"about_ca_system_score_codex":0.0007184062,"about_ca_system_score_gemma":0.0009189467,"threshold_uncertainty_score":0.305426},"labels":[],"label_agreement":null},{"id":"W44846162","doi":"10.1007/978-3-642-23623-5_39","title":"Quantifying Stranded Implant Displacement Following Prostate Brachytherapy","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced X-ray and CT Imaging","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":"BC Cancer Agency; Queen's University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Cancer Care Ontario","keywords":"Prostate brachytherapy; Brachytherapy; Quality assurance; Displacement (psychology); Implant; Prostate; Computer science; Medicine; Prostate cancer; Nuclear medicine; Algorithm; Radiology; Radiation therapy; Surgery; Cancer","score_opus":0.022623367563251052,"score_gpt":0.2631819662395156,"score_spread":0.24055859867626456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44846162","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.9710786,0.0035069918,0.023001438,0.0000887348,0.00009835282,0.00004879114,0.00027163804,0.00028914862,0.0016163138],"genre_scores_gemma":[0.99438334,0.00041231368,0.003655601,0.000035871883,0.000020683368,0.000013197333,0.00013067605,0.000056083027,0.001292347],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99979,0.000038295664,0.000013499158,0.00003421998,0.0000949792,0.000029008987],"domain_scores_gemma":[0.999003,0.0005207582,0.00021130744,0.000073233314,0.00012169503,0.00007003957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038591254,0.00038647215,0.00052217505,0.00070632517,0.00027029586,0.0009791884,0.00054036453,0.0007887017,0.0015386671],"category_scores_gemma":[0.002336076,0.00042261163,0.00028018295,0.0005088506,0.0003422339,0.0004118371,0.00053282623,0.0004411707,0.00046348813],"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.007866718,0.00025837068,0.11683067,0.00059072586,0.00022576105,0.0013832244,0.0008975771,0.048940647,0.69502217,0.00037118164,0.00070445886,0.12690851],"study_design_scores_gemma":[0.00011256608,0.00599517,0.3739177,0.0001284546,0.0007537696,0.0045266994,0.0012852597,0.19695373,0.4114264,0.0008839681,0.0038199294,0.00019638443],"about_ca_topic_score_codex":0.0022469831,"about_ca_topic_score_gemma":0.0037882365,"teacher_disagreement_score":0.0022469831,"about_ca_system_score_codex":0.00053758913,"about_ca_system_score_gemma":0.0005060249,"threshold_uncertainty_score":0.005147338},"labels":[],"label_agreement":null},{"id":"W4500300","doi":"10.1007/978-3-540-45224-9_18","title":"Two Expert Diagnosis Systems for SMEs: From Database-Only Technologies to the Unavoidable Addition of AI Techniques","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Expert system; Data science; Knowledge management; Software engineering; Artificial intelligence","score_opus":0.0232848189160649,"score_gpt":0.2703984939580699,"score_spread":0.24711367504200502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4500300","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.055492196,0.0074997805,0.88080525,0.011919935,0.00068752223,0.00017669715,0.00034925714,0.003415902,0.03965338],"genre_scores_gemma":[0.35912457,0.0036561566,0.6143606,0.0018313616,0.0002740225,0.00013054126,0.0004660484,0.00023924693,0.019917408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992487,0.00015835388,0.000073326395,0.00013652077,0.0003223784,0.00006064044],"domain_scores_gemma":[0.99736816,0.0013017134,0.0001306759,0.0005151579,0.0004577425,0.00022658278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014117796,0.0004903196,0.00056591287,0.0010023688,0.0004920158,0.002648267,0.0011938858,0.001977536,0.00536735],"category_scores_gemma":[0.004144303,0.0004456972,0.00044224545,0.0008332037,0.0008687112,0.0049724947,0.001855731,0.0018268365,0.0015310374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046994214,0.0002813004,0.002356444,0.0005753504,0.000058883914,0.0006034223,0.0011273416,0.005513299,0.019684182,0.07831537,0.0144260125,0.87658846],"study_design_scores_gemma":[0.0004749657,0.0015421761,0.011684404,0.0009666987,0.00044641393,0.005987761,0.0019189699,0.17370802,0.076991834,0.3215273,0.40450615,0.0002452598],"about_ca_topic_score_codex":0.0007530474,"about_ca_topic_score_gemma":0.001106322,"teacher_disagreement_score":0.00536735,"about_ca_system_score_codex":0.0006035799,"about_ca_system_score_gemma":0.0009210795,"threshold_uncertainty_score":0.017955542},"labels":[],"label_agreement":null},{"id":"W45142999","doi":"10.1007/978-3-319-06028-6_68","title":"Bringing Information Retrieval into Crowdsourcing: A Case Study","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Crowdsourcing; Computer science; Information retrieval; Quality (philosophy); Human–computer information retrieval; Work (physics); Control (management); Crowdsourcing software development; Data science; World Wide Web; Artificial intelligence; Search engine; Engineering","score_opus":0.017829253758947988,"score_gpt":0.2650220393064809,"score_spread":0.2471927855475329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45142999","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.93701917,0.000668597,0.010054391,0.0036901396,0.00013617302,0.0012734715,0.0005354037,0.000209898,0.046412755],"genre_scores_gemma":[0.96837014,0.0005605294,0.014677059,0.0006836019,0.000107733365,0.00049972,0.00031124966,0.00011890271,0.014671055],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9915782,0.0046637496,0.00033485587,0.0006331062,0.0017092515,0.0010808136],"domain_scores_gemma":[0.9697893,0.022778206,0.0013534616,0.002477777,0.0016213435,0.0019798968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074381456,0.00079040695,0.00068174425,0.0024982365,0.00979582,0.0046382938,0.0032667303,0.0063313,0.006062942],"category_scores_gemma":[0.023515398,0.00045335075,0.0009614679,0.0046252967,0.0027434651,0.0032268662,0.004190026,0.0022678464,0.0018300645],"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.0033622736,0.020794796,0.05944372,0.0036971627,0.00035587625,0.07743872,0.3578109,0.013359548,0.0157783,0.03851096,0.04671934,0.36272827],"study_design_scores_gemma":[0.0013581581,0.0054789935,0.057609297,0.0012884315,0.00042658037,0.030125676,0.49685454,0.051887732,0.021621376,0.037029397,0.29576385,0.00055594434],"about_ca_topic_score_codex":0.01722803,"about_ca_topic_score_gemma":0.028553938,"teacher_disagreement_score":0.01722803,"about_ca_system_score_codex":0.0027117492,"about_ca_system_score_gemma":0.00310889,"threshold_uncertainty_score":0.0393371},"labels":[],"label_agreement":null},{"id":"W45195700","doi":"10.1007/978-3-642-23626-6_19","title":"Simultaneous Segmentation and Grading of Hippocampus for Patient Classification with Alzheimer’s Disease","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","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":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Computer science; Grading (engineering); Segmentation; Artificial intelligence; Hippocampus; Pattern recognition (psychology); Natural language processing; Neuroscience; Psychology","score_opus":0.0355462614072893,"score_gpt":0.30646745596319763,"score_spread":0.27092119455590835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45195700","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.7941341,0.0076785786,0.18953718,0.0006475166,0.00024576255,0.0002932009,0.0016970702,0.0016467208,0.004119956],"genre_scores_gemma":[0.9095734,0.0013935515,0.08699638,0.00007432277,0.00009886326,0.000062824714,0.00061350013,0.00010436337,0.0010827634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995222,0.00011929377,0.00006943482,0.00009057354,0.00012580866,0.00007270118],"domain_scores_gemma":[0.99866843,0.00041167677,0.00013653457,0.00020592859,0.00042753143,0.0001498651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017608519,0.0005508644,0.00083069864,0.003303708,0.0004447196,0.0011822843,0.0007858561,0.0010987055,0.0014707434],"category_scores_gemma":[0.0031903258,0.0004730032,0.0005440214,0.00095273496,0.00032079426,0.00080361246,0.0008051535,0.00050284574,0.00060452207],"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.004614585,0.00021839413,0.111454815,0.0009850701,0.0005959482,0.0009889234,0.0005577145,0.0047399946,0.2290439,0.0006878978,0.004067593,0.64204526],"study_design_scores_gemma":[0.00047497233,0.0016653299,0.39717162,0.00036099582,0.002695719,0.01917528,0.0016157292,0.28502685,0.27384806,0.0069708107,0.01072387,0.00027076417],"about_ca_topic_score_codex":0.004438765,"about_ca_topic_score_gemma":0.010374348,"teacher_disagreement_score":0.004438765,"about_ca_system_score_codex":0.00027196683,"about_ca_system_score_gemma":0.0010798532,"threshold_uncertainty_score":0.009312391},"labels":[],"label_agreement":null},{"id":"W45240301","doi":"10.1007/978-3-642-40164-0_26","title":"Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Combinatorics; Boolean function; Mathematics; Function (biology); Value (mathematics); Discrete mathematics; Quadratic equation; Algorithm; Time complexity; Statistics","score_opus":0.021298087085973545,"score_gpt":0.24681642194658063,"score_spread":0.22551833486060707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45240301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19831677,0.004659643,0.6973446,0.0031198983,0.00017471002,0.00037260627,0.00092494517,0.0010399899,0.09404692],"genre_scores_gemma":[0.84264266,0.002087139,0.12314574,0.0007017887,0.0005559953,0.00056815543,0.0019639316,0.0008452688,0.02748923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543494,0.0015149565,0.00016299842,0.0005546125,0.0015227892,0.00080960116],"domain_scores_gemma":[0.97980726,0.015694177,0.00082883344,0.0014832543,0.0015111816,0.0006752969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034563572,0.0013447187,0.0015160404,0.0030849867,0.0016812444,0.0045625325,0.0046559894,0.0019686786,0.013556371],"category_scores_gemma":[0.020175103,0.001110916,0.0020503514,0.0038636262,0.0026246158,0.0059257415,0.0029568947,0.0043780073,0.0009828714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006180549,0.0004833834,0.003584354,0.00045252332,0.00015583346,0.00010192495,0.00057207496,0.16963218,0.0057875603,0.67870647,0.018631224,0.12127445],"study_design_scores_gemma":[0.000049902403,0.00005806999,0.0011172002,0.000070472655,0.000033480275,0.00007530828,0.000076014476,0.55857146,0.0012988145,0.43531486,0.0033084855,0.000025937534],"about_ca_topic_score_codex":0.0033125803,"about_ca_topic_score_gemma":0.0039575025,"teacher_disagreement_score":0.013556371,"about_ca_system_score_codex":0.0065272013,"about_ca_system_score_gemma":0.0022813547,"threshold_uncertainty_score":0.047358394},"labels":[],"label_agreement":null},{"id":"W45393323","doi":"10.1007/978-3-642-21254-3_14","title":"Automatic Learning of Subclasses of Pattern Languages","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Learnability; Class (philosophy); Alphabet; Variable (mathematics); Regular language; Abstract family of languages; Programming language; Artificial intelligence; Automaton; Constant (computer programming); Theoretical computer science; Natural language processing; Mathematics; Second-generation programming language; Linguistics; Fifth-generation programming language","score_opus":0.012181278538922546,"score_gpt":0.2497563777844709,"score_spread":0.23757509924554837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45393323","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.1464914,0.0009965501,0.8277185,0.00091127073,0.0001532952,0.00023096101,0.0021567217,0.01264574,0.008695629],"genre_scores_gemma":[0.44843894,0.0005782355,0.530317,0.0003755226,0.00012816198,0.00023517829,0.009924973,0.0015268911,0.008475148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911076,0.00015579752,0.00009663609,0.00033597235,0.00021601998,0.00008479608],"domain_scores_gemma":[0.99463886,0.0027168023,0.00031577947,0.0013556588,0.00074344885,0.00022949355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010626394,0.0005900009,0.00097192335,0.0016500156,0.00063033507,0.0016620125,0.0019823387,0.00088753604,0.0048871445],"category_scores_gemma":[0.0064225714,0.0008295287,0.0017010407,0.0011787445,0.0006722048,0.004707825,0.0020249805,0.0022357746,0.0016670868],"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.0004529143,0.0002496145,0.0099877855,0.0005431551,0.0001246497,0.00030502374,0.00030866428,0.013250102,0.024725799,0.038682897,0.020369695,0.8909997],"study_design_scores_gemma":[0.00009934983,0.00013392014,0.004063695,0.00017598971,0.00010066464,0.00088929024,0.00032111086,0.75663024,0.02478707,0.19557151,0.017188337,0.00003890228],"about_ca_topic_score_codex":0.0012442275,"about_ca_topic_score_gemma":0.0032986766,"teacher_disagreement_score":0.0048871445,"about_ca_system_score_codex":0.00060171087,"about_ca_system_score_gemma":0.0009617763,"threshold_uncertainty_score":0.016349077},"labels":[],"label_agreement":null},{"id":"W45650314","doi":"10.1007/978-3-319-09108-2_8","title":"Specification and Verification of Graph-Based Model Transformation Properties","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"McGill University; Queen's University","funders":"","keywords":"Gas meter prover; Transformation (genetics); Computer science; Automated theorem proving; Graph rewriting; Algorithm; Model checking; Path (computing); Theoretical computer science; Programming language; Graph; Mathematics; Mathematical proof","score_opus":0.02305134914606884,"score_gpt":0.21438215913248834,"score_spread":0.1913308099864195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45650314","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.014179967,0.00006204128,0.97685856,0.00016336537,0.00005346788,0.00024759964,0.00026710422,0.003205264,0.0049624625],"genre_scores_gemma":[0.49681282,0.00034410687,0.4934902,0.00022418948,0.000048867394,0.0006570959,0.001645017,0.0015333872,0.005244281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969152,0.00083761016,0.0002099096,0.00040632123,0.0013530093,0.00027791059],"domain_scores_gemma":[0.99421614,0.0034129324,0.00038510837,0.0011848008,0.00073100114,0.00007003474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018915442,0.00094231876,0.00070561504,0.001051,0.0005254488,0.002119372,0.0018357324,0.00130262,0.0058874507],"category_scores_gemma":[0.00873667,0.00084563775,0.0018779937,0.0008205461,0.0019444311,0.0028888944,0.0016753259,0.002229887,0.001508889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053324713,0.00039591073,0.0017760247,0.0010589454,0.00018826277,0.0011969706,0.00057283044,0.2724782,0.078768805,0.47537553,0.0072806943,0.16037461],"study_design_scores_gemma":[0.0001761585,0.00017375323,0.00053810456,0.00013089803,0.00013814372,0.0003202059,0.00009844452,0.68627715,0.1111547,0.18730973,0.013632684,0.000049994753],"about_ca_topic_score_codex":0.002917328,"about_ca_topic_score_gemma":0.0032811065,"teacher_disagreement_score":0.0058874507,"about_ca_system_score_codex":0.0011216021,"about_ca_system_score_gemma":0.0028259929,"threshold_uncertainty_score":0.01969546},"labels":[],"label_agreement":null},{"id":"W46202281","doi":"10.1007/978-3-642-22006-7_2","title":"An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Approximation algorithm; Disjoint sets; Combinatorics; Vertex (graph theory); Steiner tree problem; Vertex connectivity; Graph; Mathematics; Computer science; Algorithm; Discrete mathematics","score_opus":0.03058419392283176,"score_gpt":0.26004901500276495,"score_spread":0.22946482107993318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46202281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1094942,0.0014460004,0.8590748,0.0016173524,0.00046535436,0.00065769895,0.0015823292,0.0055124895,0.020149864],"genre_scores_gemma":[0.2250105,0.00051183463,0.763646,0.00035020936,0.00021741097,0.0005532059,0.0027959696,0.00045409845,0.006460651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.00018457137,0.00007597272,0.00028792754,0.0004215081,0.00020255856],"domain_scores_gemma":[0.9976539,0.0010581578,0.00013528488,0.0006311652,0.00036134676,0.00016018479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008304145,0.0019312026,0.00257626,0.0019072209,0.0012872546,0.002324644,0.004845005,0.002176379,0.014671195],"category_scores_gemma":[0.0049253376,0.0008834107,0.0016689316,0.0041842125,0.00076591497,0.0047783144,0.002605757,0.0024169383,0.0024735513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017350204,0.0009633271,0.0022957649,0.0009446118,0.00017933852,0.00030338045,0.0004758149,0.23796353,0.015576372,0.042384632,0.038087543,0.6590906],"study_design_scores_gemma":[0.00033215902,0.0002039532,0.0008250272,0.00004610874,0.00011712258,0.00038108378,0.00015587204,0.9547425,0.0042467546,0.032463774,0.0064492393,0.000036404334],"about_ca_topic_score_codex":0.004533912,"about_ca_topic_score_gemma":0.0071555595,"teacher_disagreement_score":0.014671195,"about_ca_system_score_codex":0.002389302,"about_ca_system_score_gemma":0.0021495824,"threshold_uncertainty_score":0.049080074},"labels":[],"label_agreement":null},{"id":"W46222836","doi":"10.1007/978-3-642-32663-9_5","title":"Experiments in Artimetrics: Avatar Face Recognition","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Avatar; Biometrics; Facial recognition system; Computer science; Human–computer interaction; Face (sociological concept); Metaverse; Field (mathematics); Domain (mathematical analysis); Face Recognition Grand Challenge; Software; Virtual reality; Artificial intelligence; Face detection; Pattern recognition (psychology)","score_opus":0.04005223706069894,"score_gpt":0.26745134898343925,"score_spread":0.22739911192274032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46222836","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.71922064,0.0026618014,0.19996835,0.0010791307,0.0036089916,0.0019619022,0.0092617385,0.017537713,0.044699825],"genre_scores_gemma":[0.72682506,0.0010007086,0.19971961,0.0008808932,0.00027338913,0.00087570836,0.01822968,0.001960051,0.050234914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956215,0.001305074,0.0003136199,0.0009694708,0.0013282404,0.00046217995],"domain_scores_gemma":[0.99686384,0.0011282418,0.00007707552,0.0010258796,0.0006661866,0.00023880742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023632408,0.0018606607,0.0015235135,0.0008480424,0.0009894369,0.001131386,0.0022311353,0.002424128,0.015464431],"category_scores_gemma":[0.007215063,0.0005167971,0.00074156595,0.0008408689,0.00061148655,0.002158034,0.0015881964,0.0012685565,0.008284599],"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.006080492,0.005649582,0.0035364449,0.0014104256,0.00040193103,0.0010271521,0.00059146044,0.018663757,0.23861912,0.0037446409,0.06578847,0.6544865],"study_design_scores_gemma":[0.001396514,0.009585166,0.020173136,0.00020060342,0.0004091908,0.0071439217,0.001056931,0.34136784,0.5487469,0.009717316,0.059897296,0.00030524758],"about_ca_topic_score_codex":0.0039396468,"about_ca_topic_score_gemma":0.002664618,"teacher_disagreement_score":0.015464431,"about_ca_system_score_codex":0.00038265597,"about_ca_system_score_gemma":0.00048349638,"threshold_uncertainty_score":0.051733673},"labels":[],"label_agreement":null},{"id":"W47114132","doi":"10.1007/978-3-642-21596-4_28","title":"A Fair P2P Scalable Video Streaming Scheme Using Improved Priority Index Assignment and Multi-hierarchical Topology","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Upload; Scalable Video Coding; Computer network; Network packet; Video quality; Bitstream; Bandwidth (computing); Real-time computing; Scheme (mathematics); Distributed computing; Algorithm; Decoding methods","score_opus":0.03237540103190596,"score_gpt":0.2672874910064713,"score_spread":0.23491208997456536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47114132","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.058817226,0.00061587454,0.93268603,0.00035225958,0.00040134657,0.00026403286,0.00024088936,0.0015147789,0.0051075737],"genre_scores_gemma":[0.74051386,0.00026372788,0.25390705,0.0001565452,0.00021186663,0.00014215821,0.00022184872,0.00010045327,0.0044825166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945444,0.000100514255,0.000031840398,0.00010565113,0.00021919374,0.00008831794],"domain_scores_gemma":[0.99905735,0.00029081444,0.00004124225,0.00019082302,0.00032054883,0.00009937017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009460105,0.0005505261,0.0011650787,0.0007485906,0.0014030741,0.0011640593,0.0021280574,0.0006597812,0.002475491],"category_scores_gemma":[0.002113872,0.00028268204,0.00036309494,0.0011999323,0.0005526322,0.0015193932,0.0010516118,0.0008689343,0.0003450987],"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.0015566304,0.00068603066,0.0009312175,0.00032963356,0.00015227028,0.0006861167,0.00039849395,0.26374078,0.124029055,0.11775178,0.022622723,0.46711525],"study_design_scores_gemma":[0.000076011456,0.000121200756,0.00023572247,0.0000059782674,0.000031518837,0.0001779106,0.000032524193,0.9741561,0.006084545,0.016830413,0.0022135398,0.00003449586],"about_ca_topic_score_codex":0.004333962,"about_ca_topic_score_gemma":0.0065338057,"teacher_disagreement_score":0.004333962,"about_ca_system_score_codex":0.0012030905,"about_ca_system_score_gemma":0.0013401678,"threshold_uncertainty_score":0.008729041},"labels":[],"label_agreement":null},{"id":"W47286948","doi":"10.1007/978-3-642-22218-4_28","title":"COPE: Childhood Obesity Prevention [Knowledge] Enterprise","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","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":"McGill University","funders":"","keywords":"Ontology; Childhood obesity; Obesity; Computer science; Overweight; Domain (mathematical analysis); Work (physics); Domain knowledge; Knowledge management; Discipline; Medicine; Engineering; Social science; Sociology","score_opus":0.015521637088377034,"score_gpt":0.25944627789415314,"score_spread":0.2439246408057761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47286948","genre_codex":"dataset","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.008408888,0.009414924,0.18305364,0.009813894,0.0010899005,0.00040805255,0.33948734,0.13548261,0.31284076],"genre_scores_gemma":[0.057817902,0.016654715,0.225409,0.0054802084,0.0008430408,0.0006660564,0.57406276,0.013739099,0.10532731],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975044,0.000039190007,0.000024636623,0.00005846939,0.00010299286,0.000024236495],"domain_scores_gemma":[0.9991806,0.0003767961,0.000058327827,0.0001691568,0.00010413491,0.00011099172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051861827,0.00095644745,0.00070011104,0.0023607542,0.00042341163,0.002695115,0.0016154835,0.0013964436,0.053131457],"category_scores_gemma":[0.0026278158,0.00043138143,0.0008473474,0.0036860732,0.00022614289,0.0030546826,0.00231182,0.0011226337,0.029687831],"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.00013815088,0.00006665673,0.0013165048,0.0009807539,0.000081841376,0.0004113089,0.00019997009,0.003341594,0.0014869724,0.015918532,0.6654166,0.3106411],"study_design_scores_gemma":[0.000049750965,0.000016586571,0.0019333005,0.0003312127,0.000070326845,0.00048666686,0.0001097484,0.007367488,0.0018660456,0.027636733,0.96008605,0.00004607039],"about_ca_topic_score_codex":0.003853604,"about_ca_topic_score_gemma":0.0053442037,"teacher_disagreement_score":0.053131457,"about_ca_system_score_codex":0.0005402966,"about_ca_system_score_gemma":0.0011262128,"threshold_uncertainty_score":0.17774242},"labels":[],"label_agreement":null},{"id":"W47365510","doi":"10.1007/978-3-642-38868-2_12","title":"Fiber Connectivity Integrated Brain Activation Detection","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Inference; Univariate; Probabilistic logic; Tractography; Segmentation; Functional magnetic resonance imaging; Diffusion MRI; Pattern recognition (psychology); Noise (video); Task (project management); Machine learning; Magnetic resonance imaging; Neuroscience; Multivariate statistics; Image (mathematics); Medicine; Psychology","score_opus":0.021494477466131787,"score_gpt":0.25032178374486247,"score_spread":0.22882730627873069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47365510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22621676,0.0011069458,0.76082766,0.00030645067,0.00014413866,0.0002782519,0.0016638149,0.0014199016,0.0080360435],"genre_scores_gemma":[0.62170583,0.0010292594,0.36346912,0.00017204686,0.00020023482,0.00022121108,0.0019674613,0.0006479662,0.010586731],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997677,0.000033694,0.000008752115,0.0000817125,0.00006210665,0.000046124474],"domain_scores_gemma":[0.9997297,0.00007954243,0.0000316273,0.00003267629,0.00009886403,0.000027616832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052116835,0.00086789334,0.0004645404,0.0017094966,0.00050832174,0.0010601064,0.00054856756,0.0007053387,0.0066146688],"category_scores_gemma":[0.0014989211,0.00047834424,0.0005141032,0.0013995757,0.00030060663,0.001388407,0.0006561161,0.0004959199,0.0011880174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006682994,0.000212908,0.008913199,0.0002992065,0.00029559896,0.0003055953,0.00021984855,0.0073457328,0.46819764,0.0057658907,0.0042523346,0.5035238],"study_design_scores_gemma":[0.00011670525,0.0011550818,0.17301865,0.00013329124,0.0010389542,0.0043402347,0.00029916287,0.44310606,0.34097543,0.01873103,0.016898831,0.00018665618],"about_ca_topic_score_codex":0.0026917923,"about_ca_topic_score_gemma":0.0071165417,"teacher_disagreement_score":0.0066146688,"about_ca_system_score_codex":0.00032102063,"about_ca_system_score_gemma":0.00048722647,"threshold_uncertainty_score":0.022128224},"labels":[],"label_agreement":null},{"id":"W47466530","doi":"10.1007/978-3-642-21478-3_12","title":"The Impact of Attention on the Internal Clock in Prospective Timing: Is It Direct or Indirect?","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neuroscience and Music Perception","field":"Neuroscience","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é Laval","funders":"","keywords":"Computer science; Interval (graph theory); Cognitive psychology; Psychology; Mathematics","score_opus":0.07804017428500971,"score_gpt":0.3163015245567198,"score_spread":0.23826135027171008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47466530","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.68661577,0.021624291,0.03791524,0.0046040257,0.002024932,0.000100520214,0.0012016712,0.0002685741,0.24564503],"genre_scores_gemma":[0.97715765,0.006156596,0.005702194,0.00052561413,0.0009965213,0.00007526529,0.00032783765,0.00023769135,0.008820671],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949586,0.00010632252,0.000025874988,0.00014018494,0.00014737326,0.00008434773],"domain_scores_gemma":[0.9934776,0.00460873,0.0007408836,0.00048262242,0.000332914,0.00035726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008373636,0.00048785107,0.00052018766,0.00042051187,0.00039490208,0.00301282,0.0008408349,0.0007771501,0.012510836],"category_scores_gemma":[0.0104337465,0.0005500501,0.0004933884,0.0007620503,0.001166504,0.0028047909,0.0011837397,0.001731852,0.0010959958],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004841356,0.0009780311,0.049166758,0.0016590502,0.0006179714,0.0008309863,0.0031678071,0.008622399,0.1515823,0.15053914,0.009905049,0.6180891],"study_design_scores_gemma":[0.00078155147,0.0014879353,0.5832093,0.00088426226,0.0012919746,0.0010939533,0.0012467016,0.018693723,0.027750554,0.3382058,0.025056524,0.00029769077],"about_ca_topic_score_codex":0.0012594591,"about_ca_topic_score_gemma":0.0015548348,"teacher_disagreement_score":0.012510836,"about_ca_system_score_codex":0.00047050472,"about_ca_system_score_gemma":0.0005880654,"threshold_uncertainty_score":0.04185289},"labels":[],"label_agreement":null},{"id":"W47514981","doi":"10.1007/978-3-642-39094-4_38","title":"Unsupervised Visual Changepoint Detection Using Maximum Mean Discrepancy","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Computer science; Scale-invariant feature transform; Leverage (statistics); Estimator; Covariance; Kullback–Leibler divergence; Similarity (geometry); Metric (unit); Divergence (linguistics); Feature vector; Kernel (algebra); Feature extraction; Mathematics; Statistics; Image (mathematics)","score_opus":0.026181723771157798,"score_gpt":0.2840025646682833,"score_spread":0.2578208408971255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47514981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009865515,0.00032848,0.9871106,0.00006779479,0.00004811719,0.00006497509,0.000093527815,0.0015606623,0.00086031883],"genre_scores_gemma":[0.16667308,0.00037124509,0.82795316,0.000100902595,0.00009869369,0.00013700798,0.0008493424,0.00052163063,0.003294956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988809,0.00013158996,0.000052855325,0.00036833025,0.0004545559,0.00011181664],"domain_scores_gemma":[0.998865,0.0003613728,0.00011159999,0.0002754805,0.00033615856,0.000050409577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009712466,0.0011224085,0.001800866,0.0028173754,0.00045208956,0.0014743226,0.0021514928,0.001474193,0.0024311163],"category_scores_gemma":[0.0024303764,0.00079893315,0.00124777,0.0021900076,0.0007781486,0.0014045641,0.0020416463,0.0014918873,0.002426855],"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.00038925305,0.00014178312,0.0012429368,0.00022314317,0.00012960298,0.0001256239,0.00008971653,0.019290814,0.09112997,0.0028215554,0.0046312995,0.8797842],"study_design_scores_gemma":[0.000042776115,0.00014225797,0.002834202,0.000035249548,0.00006693694,0.000584287,0.000058027188,0.90839905,0.07189696,0.008487777,0.0074106157,0.000041845702],"about_ca_topic_score_codex":0.0010892204,"about_ca_topic_score_gemma":0.0020572764,"teacher_disagreement_score":0.0028173754,"about_ca_system_score_codex":0.00040560222,"about_ca_system_score_gemma":0.0007192817,"threshold_uncertainty_score":0.008132935},"labels":[],"label_agreement":null},{"id":"W47648955","doi":"10.1007/978-3-319-06483-3_33","title":"The Use of NLP Techniques in Static Code Analysis to Detect Weaknesses and Vulnerabilities","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Code (set theory); Natural language processing; Artificial intelligence; Strengths and weaknesses; Programming language","score_opus":0.021469361672427387,"score_gpt":0.26988023511212433,"score_spread":0.24841087343969695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47648955","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.007833746,0.0009373356,0.96931666,0.00062235654,0.00015538813,0.00014424794,0.0005075623,0.006144255,0.014338479],"genre_scores_gemma":[0.09527039,0.001533849,0.8901234,0.00040149628,0.00017031685,0.00020023267,0.0012548567,0.0011766441,0.009868739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982174,0.00039296213,0.00013264091,0.00036797154,0.0008128736,0.00007610813],"domain_scores_gemma":[0.9907195,0.0071362583,0.00046805074,0.0007723066,0.0008486514,0.00005520308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017345886,0.0008583733,0.000662526,0.0038690215,0.0010242815,0.0020033934,0.0011232572,0.0011700077,0.004479964],"category_scores_gemma":[0.00945928,0.000617048,0.0012260806,0.002218843,0.001565434,0.00312725,0.0014275163,0.0018641532,0.0034838298],"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.00008589872,0.00013435149,0.0019316517,0.0007692437,0.000059159687,0.0007187875,0.00081928296,0.0121409055,0.03488765,0.035312705,0.01206521,0.9010752],"study_design_scores_gemma":[0.00003707694,0.00013844174,0.004426913,0.0005005158,0.00021428417,0.003450241,0.00070188876,0.47856653,0.104698405,0.30382377,0.1032929,0.00014897741],"about_ca_topic_score_codex":0.0015854503,"about_ca_topic_score_gemma":0.0021388524,"teacher_disagreement_score":0.004479964,"about_ca_system_score_codex":0.0007011857,"about_ca_system_score_gemma":0.00088888715,"threshold_uncertainty_score":0.014986992},"labels":[],"label_agreement":null},{"id":"W47693460","doi":"10.1007/978-3-319-06483-3_35","title":"Inferring Road Maps from Sparsely-Sampled GPS Traces","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automated Road and Building Extraction","field":"Engineering","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 Calgary","funders":"","keywords":"Global Positioning System; Computer science; Computer vision; Cartography; Artificial intelligence; Geography; Telecommunications","score_opus":0.02088373694561018,"score_gpt":0.22109645162226432,"score_spread":0.20021271467665414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47693460","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.04042735,0.00069932296,0.9527038,0.000111060624,0.00006656489,0.0000468674,0.0017642785,0.0026179557,0.0015627913],"genre_scores_gemma":[0.5267299,0.0014947157,0.4545927,0.00006896029,0.0001663163,0.00010288771,0.01139106,0.00037611043,0.005077324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996431,0.000047015645,0.000014781056,0.00014074495,0.00011180617,0.000042576445],"domain_scores_gemma":[0.99931717,0.000333551,0.000052582418,0.00013718756,0.00013673914,0.00002280884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003079309,0.0014468934,0.0010840575,0.0022958664,0.00027717557,0.0011603672,0.0016226472,0.0012293432,0.0015474926],"category_scores_gemma":[0.0026444837,0.0011555501,0.0010463842,0.0029110862,0.00040717723,0.0016581323,0.0012609516,0.0010907203,0.00229112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016642941,0.00011501126,0.005588791,0.0004137317,0.00017966775,0.00040019755,0.00019208007,0.505623,0.014373705,0.0045213653,0.0060419906,0.46238402],"study_design_scores_gemma":[0.000008409944,0.000018817836,0.0018037983,0.000026672029,0.000032001884,0.00013834884,0.000055274053,0.984512,0.0030155568,0.008378967,0.0019969246,0.00001317693],"about_ca_topic_score_codex":0.008154308,"about_ca_topic_score_gemma":0.014862552,"teacher_disagreement_score":0.008154308,"about_ca_system_score_codex":0.00032280714,"about_ca_system_score_gemma":0.00058924925,"threshold_uncertainty_score":0.016213655},"labels":[],"label_agreement":null},{"id":"W4776547","doi":"10.1007/978-3-642-21043-3_46","title":"Extending AdaBoost to Iteratively Vary Its Base Classifiers","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; AdaBoost; Artificial intelligence; Base (topology); Pattern recognition (psychology); Machine learning; Support vector machine; Mathematics","score_opus":0.04063029010037732,"score_gpt":0.271457159147261,"score_spread":0.23082686904688365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4776547","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.005990301,0.00018527475,0.9910994,0.000053899315,0.00014406937,0.00003330231,0.00001728558,0.0012853837,0.0011911113],"genre_scores_gemma":[0.13493662,0.00015540958,0.85993296,0.00020696304,0.00011519151,0.00009625703,0.00014139696,0.00064537354,0.0037697726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989077,0.0002579524,0.00006709386,0.00027058608,0.00041681444,0.00007993782],"domain_scores_gemma":[0.9986284,0.00037167195,0.000068325346,0.00027886007,0.00060180837,0.000051059593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002373175,0.0010164323,0.0014654917,0.0008970761,0.0006751096,0.001220003,0.0021126664,0.0014474737,0.0016840269],"category_scores_gemma":[0.0035564273,0.0007285491,0.0010852773,0.0009612459,0.000582888,0.0014241115,0.0013614648,0.0023174745,0.0015210551],"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.00020422366,0.0002550988,0.0008969781,0.00008248818,0.00016651521,0.0000413579,0.00007229184,0.16783395,0.01620168,0.00512844,0.004968513,0.80414844],"study_design_scores_gemma":[0.000012773877,0.000043401717,0.00015742186,0.0000088494635,0.00003302685,0.000044154072,0.000006933283,0.98712987,0.005625096,0.0035338188,0.0033901357,0.000014565274],"about_ca_topic_score_codex":0.0045587462,"about_ca_topic_score_gemma":0.00550206,"teacher_disagreement_score":0.0045587462,"about_ca_system_score_codex":0.00063625944,"about_ca_system_score_gemma":0.0010532726,"threshold_uncertainty_score":0.012550712},"labels":[],"label_agreement":null},{"id":"W48199391","doi":"10.1007/978-3-642-39649-6_29","title":"Bivariate Spatial Clustering Analysis of Point Patterns: A Graph-Based Approach","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spatial and Panel Data Analysis","field":"Economics, Econometrics and Finance","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":"Wilfrid Laurier University","funders":"","keywords":"Cluster analysis; Delaunay triangulation; Bivariate analysis; Computer science; Data mining; Spatial analysis; Point (geometry); Point process; Binary data; Binary number; Mathematics; Statistics; Artificial intelligence; Algorithm; Machine learning","score_opus":0.03101909928088896,"score_gpt":0.21172863137536507,"score_spread":0.1807095320944761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48199391","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.013035921,0.000625089,0.98384315,0.00014075116,0.00002312933,0.000048543403,0.0004913841,0.00030848078,0.0014834519],"genre_scores_gemma":[0.4034261,0.0021284642,0.58553183,0.00015077568,0.00018520768,0.00021613073,0.0034782626,0.0003844648,0.004498734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.00060208654,0.00005766797,0.00027419074,0.00022436795,0.00008613391],"domain_scores_gemma":[0.99605834,0.002376722,0.00040999937,0.00047496395,0.0005431656,0.00013690173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014081071,0.0008416349,0.0017384588,0.0066787275,0.0007887964,0.0018993185,0.00202707,0.0012324948,0.0029050135],"category_scores_gemma":[0.0068003456,0.0006268761,0.0022584402,0.008166678,0.00085845013,0.0017183315,0.0014137573,0.0011492874,0.00094876275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019690835,0.00021332047,0.014693411,0.0006399074,0.00083742774,0.0003756702,0.00049379107,0.43895116,0.006409732,0.218568,0.011784755,0.30683595],"study_design_scores_gemma":[0.000009880682,0.000031537504,0.0042672423,0.00004293774,0.00012450138,0.00014816283,0.00013526953,0.894009,0.0005305454,0.09774302,0.0029257645,0.0000321764],"about_ca_topic_score_codex":0.007620561,"about_ca_topic_score_gemma":0.0063455296,"teacher_disagreement_score":0.007620561,"about_ca_system_score_codex":0.00091058,"about_ca_system_score_gemma":0.0008042296,"threshold_uncertainty_score":0.015152454},"labels":[],"label_agreement":null},{"id":"W48336578","doi":"10.1007/978-3-642-35139-6_32","title":"Multiple Representations of Web Content for Effective Knowledge Utilization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Computer science; Web content; World Wide Web; Presentation (obstetrics); Web modeling; Web development; Web intelligence; Information retrieval; Web navigation; Web standards; Web service; The Internet","score_opus":0.06905793914907432,"score_gpt":0.3039438931078072,"score_spread":0.23488595395873285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48336578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14349942,0.0029345024,0.83337075,0.00092254556,0.0001306119,0.00025054094,0.0013760972,0.0022113556,0.015304204],"genre_scores_gemma":[0.7075651,0.0013706901,0.28613892,0.000060233455,0.00006300942,0.00019454912,0.0011579136,0.00014288817,0.003306608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993801,0.0001989985,0.000054875367,0.00010410327,0.00019909265,0.000062730265],"domain_scores_gemma":[0.9985771,0.00071791816,0.0001356567,0.00022427605,0.00027086932,0.000074209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075652037,0.000505404,0.0005597179,0.0034837835,0.0003811191,0.0032250693,0.0008573323,0.0008099646,0.0041738837],"category_scores_gemma":[0.0052495305,0.00029996788,0.0006200871,0.003952127,0.0004439832,0.0053698323,0.0013235599,0.0007427205,0.0008149457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042157285,0.00038494807,0.0026803843,0.00057248503,0.00018811876,0.0002665575,0.0010480612,0.04261445,0.016302112,0.054051187,0.0070769642,0.8743933],"study_design_scores_gemma":[0.000045128272,0.00017812595,0.004042927,0.00024238901,0.00031971588,0.00029174413,0.0010579738,0.84928477,0.014626079,0.11523691,0.014603201,0.000071099115],"about_ca_topic_score_codex":0.0023994662,"about_ca_topic_score_gemma":0.0032113164,"teacher_disagreement_score":0.0041738837,"about_ca_system_score_codex":0.00088732626,"about_ca_system_score_gemma":0.0008711282,"threshold_uncertainty_score":0.013962984},"labels":[],"label_agreement":null},{"id":"W48421012","doi":"10.1007/978-3-642-39091-3_34","title":"On the Tree Structure Used by Lazy Propagation for Inference in Bayesian Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Tree (set theory); Bayesian network; Tree structure; Inference; Scheme (mathematics); Search tree; Bayesian probability; Set (abstract data type); Tree decomposition; Theoretical computer science; Algorithm; Artificial intelligence; Bayesian inference; Machine learning; Data mining; Mathematics; Binary tree; Search algorithm; Combinatorics","score_opus":0.0198325621114296,"score_gpt":0.2445191983080175,"score_spread":0.2246866361965879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48421012","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.0010730823,0.0005293328,0.99569315,0.00038897726,0.00006425428,0.000028557593,0.000063110245,0.00033578754,0.0018237642],"genre_scores_gemma":[0.068538785,0.0021647804,0.921779,0.0006652725,0.000432559,0.0003339804,0.000446942,0.00085685536,0.004781923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411005,0.0030188602,0.0005055059,0.00068279746,0.0014225421,0.00026016025],"domain_scores_gemma":[0.96846986,0.025167624,0.0006571289,0.0034559062,0.0018621077,0.00038733875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011114066,0.0014822743,0.0022305716,0.0030986937,0.0023734753,0.0045843665,0.004266457,0.0032468012,0.0070724664],"category_scores_gemma":[0.049291313,0.0019364661,0.002855479,0.0063609835,0.005462149,0.015257552,0.004750114,0.010479712,0.0024915827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009648379,0.000060028236,0.00044288146,0.0002474273,0.00007139981,0.00012315586,0.0005416499,0.058461294,0.0007633999,0.8243352,0.007151812,0.10770526],"study_design_scores_gemma":[0.000016929756,0.000014643439,0.000056457124,0.000059694165,0.0000343652,0.000033109638,0.000018727918,0.15428849,0.00031296333,0.8420115,0.0031342513,0.000018882169],"about_ca_topic_score_codex":0.007538909,"about_ca_topic_score_gemma":0.00822807,"teacher_disagreement_score":0.011114066,"about_ca_system_score_codex":0.003001548,"about_ca_system_score_gemma":0.0025907452,"threshold_uncertainty_score":0.05877745},"labels":[],"label_agreement":null},{"id":"W48467249","doi":"10.1007/978-3-642-41527-2_14","title":"Gossip Protocols for Renaming and Sorting","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"Gossip; Computer science; Sorting; Node (physics); Protocol (science); Computer network; Theoretical computer science; Binary logarithm; Sorting network; Logarithm; Communication complexity; Combinatorics; Discrete mathematics; Sorting algorithm; Mathematics; Algorithm","score_opus":0.027720896227428602,"score_gpt":0.28024312672515317,"score_spread":0.25252223049772454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48467249","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.015023698,0.009237364,0.9032697,0.0010774774,0.0011464558,0.00032619128,0.0004457046,0.003077301,0.06639613],"genre_scores_gemma":[0.3185449,0.013323967,0.55122,0.00061371806,0.00095993787,0.0011661861,0.001839422,0.0013815394,0.110950254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.00021139933,0.00009515483,0.00014093032,0.00046819163,0.00013577146],"domain_scores_gemma":[0.99863404,0.0006217241,0.00006802003,0.00042465338,0.00018877524,0.000062765146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110815,0.0011250161,0.0012167605,0.0010338017,0.0016976706,0.002646493,0.0020363398,0.0012442874,0.008150568],"category_scores_gemma":[0.0032030663,0.0006984923,0.0006488034,0.0021874604,0.0015215208,0.0045229434,0.002135084,0.002676634,0.002294189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022914058,0.00008107659,0.00010517787,0.0004197997,0.000051818297,0.000112548885,0.0003949715,0.018349353,0.006043986,0.7931956,0.022452641,0.15856402],"study_design_scores_gemma":[0.00012657962,0.000103324375,0.00014258751,0.000118834025,0.00006592987,0.0002696618,0.0001669978,0.10198091,0.012656659,0.7690803,0.11522126,0.00006702038],"about_ca_topic_score_codex":0.0009832826,"about_ca_topic_score_gemma":0.0014480699,"teacher_disagreement_score":0.008150568,"about_ca_system_score_codex":0.0013441074,"about_ca_system_score_gemma":0.0010174196,"threshold_uncertainty_score":0.027266383},"labels":[],"label_agreement":null},{"id":"W48707152","doi":"10.1007/978-3-642-29247-7_16","title":"Discovering Sensor Services with Social Network Analysis and Expanded SQWRL Querying","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Social network analysis; World Wide Web; Data science; Social media","score_opus":0.007936577258746516,"score_gpt":0.2206330505670451,"score_spread":0.21269647330829858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48707152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026509512,0.0003722571,0.9588058,0.0004788326,0.00005165201,0.00037487297,0.0018780193,0.008209691,0.003319281],"genre_scores_gemma":[0.2707165,0.0003116236,0.7198292,0.00021933802,0.00006902514,0.000299319,0.0052195443,0.0006401081,0.002695328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961016,0.0007528234,0.00048063466,0.0007222675,0.0017233583,0.00021924402],"domain_scores_gemma":[0.99737144,0.001022185,0.00018605718,0.0008321416,0.00050002476,0.00008805498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029161146,0.00095034693,0.0019414102,0.004013828,0.0009600889,0.0038098295,0.0029864614,0.0011383102,0.004139771],"category_scores_gemma":[0.010470667,0.00076083187,0.002534834,0.0039631114,0.00093044323,0.006083496,0.004392261,0.00097366574,0.0015423027],"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.0008111019,0.00073198025,0.013094723,0.0013952361,0.00055826316,0.0010210734,0.0017129721,0.1266378,0.03656286,0.09007845,0.018658344,0.7087372],"study_design_scores_gemma":[0.000033147287,0.00003573169,0.000699819,0.00003117456,0.00006446706,0.00018814621,0.0002465616,0.9440228,0.0071798554,0.041109886,0.006360639,0.000027741326],"about_ca_topic_score_codex":0.0064449506,"about_ca_topic_score_gemma":0.008913068,"teacher_disagreement_score":0.0064449506,"about_ca_system_score_codex":0.0014363753,"about_ca_system_score_gemma":0.0012951468,"threshold_uncertainty_score":0.015422046},"labels":[],"label_agreement":null},{"id":"W48869925","doi":"10.1007/978-3-642-31623-4_20","title":"State Complexity and Limited Nondeterminism","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Computer science; State (computer science); Theoretical computer science; Programming language","score_opus":0.029295499903910758,"score_gpt":0.24702390674879915,"score_spread":0.2177284068448884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48869925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17482361,0.008499645,0.52082485,0.008173081,0.00052249007,0.00013327747,0.00077385275,0.00049666956,0.28575248],"genre_scores_gemma":[0.9356129,0.0024006832,0.031794455,0.00030567808,0.0005019971,0.00019800237,0.0003390556,0.0001283207,0.028718783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985233,0.00034767992,0.00011878422,0.00030692303,0.0005758095,0.00012756675],"domain_scores_gemma":[0.9913209,0.0066562253,0.00029525062,0.0011700051,0.0004093207,0.0001482839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084597,0.00046529667,0.000900826,0.0008519304,0.0010710306,0.002900964,0.0012618154,0.0010307889,0.007868141],"category_scores_gemma":[0.0072092693,0.0006581967,0.0011578233,0.0011009654,0.004244202,0.01104945,0.0022893255,0.0039181327,0.00072759576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001567332,0.000010547808,0.00010378157,0.00006442488,0.000005968413,0.00003685847,0.0001321377,0.0027490961,0.0003692963,0.9882747,0.0006453938,0.0075920583],"study_design_scores_gemma":[0.0000030980852,0.000003983935,0.00006472183,0.000006814355,0.0000042080032,0.00003299067,0.000012238474,0.004190481,0.00027778742,0.99357444,0.0018247069,0.000004331637],"about_ca_topic_score_codex":0.00052027847,"about_ca_topic_score_gemma":0.00045442831,"teacher_disagreement_score":0.007868141,"about_ca_system_score_codex":0.0016610958,"about_ca_system_score_gemma":0.00070409995,"threshold_uncertainty_score":0.02632153},"labels":[],"label_agreement":null},{"id":"W48913870","doi":"10.1007/978-3-642-30353-1_25","title":"A Genetic and Social Computational Model for the Emergence of Skill-Based Agent Specialization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Insect and Arachnid Ecology and Behavior","field":"Biochemistry, Genetics and Molecular Biology","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 Windsor","funders":"","keywords":"Computer science; Task (project management); Metric (unit); Quality (philosophy); Genetic algorithm; Artificial intelligence; Work (physics); Agent-based model; Machine learning","score_opus":0.020258093163901467,"score_gpt":0.26635604670638424,"score_spread":0.24609795354248276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48913870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26811138,0.00035150457,0.6796611,0.0038022152,0.00012699724,0.000087192166,0.00028965325,0.00043094173,0.047139086],"genre_scores_gemma":[0.9159201,0.00018554056,0.074511394,0.00017820526,0.000048282804,0.00014511602,0.00009311601,0.00006498996,0.0088532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998246,0.00006048935,0.000008270686,0.000037193764,0.000033797747,0.000035634093],"domain_scores_gemma":[0.99900156,0.0006555652,0.000090215675,0.0000837681,0.00007102339,0.00009781273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651949,0.0003569781,0.0005168863,0.0005000393,0.00057279714,0.0010681913,0.0017559053,0.0015383654,0.005205201],"category_scores_gemma":[0.0030007288,0.00034760917,0.00074719545,0.00045889718,0.0013945657,0.0014129134,0.0008851206,0.0012662056,0.0004122356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043550055,0.00008174604,0.00127174,0.00003714533,0.000051444156,0.00027697955,0.00021972408,0.5105288,0.0026734732,0.47042188,0.0017830821,0.012610415],"study_design_scores_gemma":[0.000013796362,0.000010150907,0.000256064,0.00000253011,0.000007264779,0.00005018002,0.000016213015,0.86941457,0.00012492946,0.12971483,0.00038243967,0.0000069872162],"about_ca_topic_score_codex":0.0039818482,"about_ca_topic_score_gemma":0.0040173866,"teacher_disagreement_score":0.005205201,"about_ca_system_score_codex":0.0010321401,"about_ca_system_score_gemma":0.00092939415,"threshold_uncertainty_score":0.017413199},"labels":[],"label_agreement":null},{"id":"W490820","doi":"10.1007/978-3-642-34014-7_6","title":"Gender Differences in the Perception of Affective Movements","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Humor Studies and Applications","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Perception; Psychology; Cognitive psychology; Neuroscience","score_opus":0.05103572518981426,"score_gpt":0.3218714503792749,"score_spread":0.27083572518946064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W490820","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.9542102,0.0031266268,0.0021314498,0.00026646475,0.00017217617,0.000023700053,0.00040740983,0.000024649376,0.039637227],"genre_scores_gemma":[0.99358964,0.0006684196,0.00043900055,0.0000852889,0.000049187227,0.000010614369,0.000118327924,0.00002826393,0.005011313],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99988115,0.00002578279,0.000005060087,0.000030990406,0.000035700166,0.000021308335],"domain_scores_gemma":[0.99944407,0.000341467,0.00008358123,0.000024773028,0.00004575709,0.00006026696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028167854,0.00017514701,0.00015988585,0.00025888905,0.00014964721,0.0008030544,0.0001452969,0.00031159015,0.010481028],"category_scores_gemma":[0.0023824251,0.0001299401,0.00015326806,0.00021384005,0.00028877627,0.00032876318,0.00028342387,0.00029657737,0.0005677108],"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.006014539,0.00036329642,0.09603192,0.0006836144,0.000241207,0.00094993814,0.013755009,0.0006891702,0.60441124,0.012097467,0.0049996255,0.25976288],"study_design_scores_gemma":[0.000040598792,0.00030877526,0.9836194,0.00008774744,0.00004029088,0.0005411934,0.0024216897,0.00048340874,0.0052278694,0.0034513667,0.0037516307,0.000026019305],"about_ca_topic_score_codex":0.00082589756,"about_ca_topic_score_gemma":0.0010762602,"teacher_disagreement_score":0.010481028,"about_ca_system_score_codex":0.00015887071,"about_ca_system_score_gemma":0.000085466556,"threshold_uncertainty_score":0.03506255},"labels":[],"label_agreement":null},{"id":"W49316834","doi":"10.1007/978-3-642-33179-4_33","title":"Context-Preserving Volumetric Data Set Exploration Using a 3D Painting Metaphor","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Metaphor; Context (archaeology); Painting; Set (abstract data type); Data set; Artificial intelligence; Computer graphics (images); Information retrieval; Computer vision; Natural language processing; Art history; Art; Programming language; Linguistics; Archaeology","score_opus":0.12790888893665212,"score_gpt":0.333838591926662,"score_spread":0.20592970299000987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49316834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044777237,0.00074614456,0.94483674,0.00024029905,0.00007646121,0.00006783922,0.00018176509,0.0016592435,0.0074142977],"genre_scores_gemma":[0.4716959,0.0010232637,0.52126044,0.00013270415,0.000056840796,0.000113157155,0.00024712447,0.0005206294,0.0049499404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997806,0.00004274888,0.000010702142,0.000038779173,0.00009585021,0.000031315747],"domain_scores_gemma":[0.9996569,0.00016847029,0.000021222444,0.00008269389,0.0000341728,0.000036566533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002956655,0.0006855008,0.0007381025,0.0007113144,0.00038321048,0.0014184726,0.001050522,0.00051087816,0.0052350387],"category_scores_gemma":[0.0012703199,0.0004107493,0.000914937,0.0009929792,0.00059233775,0.001376815,0.0026801531,0.0009831786,0.00043006096],"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.0009364817,0.00016388879,0.00089742907,0.0010644695,0.00013217337,0.0011450675,0.0018368972,0.10526201,0.3063502,0.10896537,0.010285502,0.46296054],"study_design_scores_gemma":[0.0001366604,0.00036354738,0.0012445532,0.00017281572,0.00009063419,0.0030181103,0.000528535,0.75438166,0.10930883,0.08656852,0.044048704,0.00013747804],"about_ca_topic_score_codex":0.00052944745,"about_ca_topic_score_gemma":0.0008522438,"teacher_disagreement_score":0.0052350387,"about_ca_system_score_codex":0.00021103393,"about_ca_system_score_gemma":0.00024592315,"threshold_uncertainty_score":0.017512977},"labels":[],"label_agreement":null},{"id":"W49335612","doi":"10.1007/978-3-642-40769-7_7","title":"R/quest: A Question Answering System","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Windsor","funders":"","keywords":"Computer science; Question answering; Cosine similarity; Information retrieval; Ranking (information retrieval); Similarity (geometry); Rank (graph theory); Mean reciprocal rank; Search engine; Domain (mathematical analysis); Recall; Open domain; Precision and recall; Artificial intelligence; Mathematics; Pattern recognition (psychology)","score_opus":0.016187404134827568,"score_gpt":0.23397914192795982,"score_spread":0.21779173779313227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49335612","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.00839606,0.0012122128,0.66759336,0.0012334861,0.00033721313,0.00049539976,0.019874593,0.2522498,0.048607927],"genre_scores_gemma":[0.06829916,0.0010444211,0.78834534,0.0016053225,0.00031992048,0.000761607,0.05514387,0.018821398,0.06565889],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992887,0.00017311184,0.00007670086,0.00023280797,0.00018886711,0.000039864128],"domain_scores_gemma":[0.9988763,0.00066810113,0.000040037754,0.00017672732,0.000162024,0.00007682129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015714661,0.0012197347,0.0011912113,0.002027584,0.0006893037,0.0023793243,0.0018359342,0.0013526651,0.04122919],"category_scores_gemma":[0.0038367237,0.00097609556,0.0012151101,0.0013460041,0.00062697974,0.0050520035,0.0026817801,0.0013818284,0.04219304],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060778874,0.0001684876,0.0010855577,0.0010869103,0.00006978314,0.00029082244,0.0006762057,0.0025135542,0.020095252,0.056236554,0.4760019,0.44116718],"study_design_scores_gemma":[0.0003666291,0.00019432273,0.0010631431,0.00023085593,0.00012797424,0.0009093277,0.00036248082,0.121578,0.026698003,0.11985185,0.72848105,0.00013639167],"about_ca_topic_score_codex":0.0014652293,"about_ca_topic_score_gemma":0.0018965761,"teacher_disagreement_score":0.04122919,"about_ca_system_score_codex":0.0005900594,"about_ca_system_score_gemma":0.00075716304,"threshold_uncertainty_score":0.13792539},"labels":[],"label_agreement":null},{"id":"W49447563","doi":"10.1007/978-3-642-32241-9_1","title":"A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Regret; Minimax; Computer science; Tree (set theory); Algorithm; Time complexity; Mathematical optimization; Mathematics; Combinatorics; Machine learning","score_opus":0.02601981252845387,"score_gpt":0.24226162470238868,"score_spread":0.21624181217393482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49447563","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.02921458,0.0010364351,0.95015955,0.0011073309,0.00034483586,0.00041799876,0.0016720924,0.0068173073,0.00922994],"genre_scores_gemma":[0.10820569,0.00026434977,0.8797273,0.00036952496,0.00019234147,0.00051680626,0.0027956283,0.0008380221,0.007090286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981456,0.00032523443,0.00011895056,0.0005597497,0.0004613943,0.0003890435],"domain_scores_gemma":[0.99728835,0.0015752356,0.00016527176,0.00041592133,0.000359053,0.00019627107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020733273,0.0021855826,0.0033327753,0.0016880793,0.0016593751,0.0038223534,0.0041703694,0.0028242709,0.019812027],"category_scores_gemma":[0.007224879,0.0011409867,0.0024098493,0.0032842082,0.0011287798,0.004549285,0.0027549812,0.003769317,0.004683018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011931867,0.00061198854,0.0017352205,0.00058719306,0.0002208601,0.00012976787,0.0002834202,0.44685042,0.005966167,0.032750234,0.044155303,0.46551627],"study_design_scores_gemma":[0.0001875388,0.00013070885,0.00046753229,0.00003908374,0.00004784189,0.00007524232,0.000099889716,0.93306583,0.0017512769,0.0604717,0.0036359818,0.000027290416],"about_ca_topic_score_codex":0.007562475,"about_ca_topic_score_gemma":0.015564552,"teacher_disagreement_score":0.019812027,"about_ca_system_score_codex":0.003795932,"about_ca_system_score_gemma":0.004139773,"threshold_uncertainty_score":0.0662778},"labels":[],"label_agreement":null},{"id":"W49738050","doi":"10.1007/978-3-319-08783-2_9","title":"On the Smoothed Heights of Trie and Patricia Index Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Trie; Combinatorics; String (physics); Bernoulli's principle; Tree (set theory); Binary tree; Set (abstract data type); Mathematics; Computer science; Discrete mathematics; Algorithm; Data structure; Physics; Mathematical physics","score_opus":0.012151331383586907,"score_gpt":0.22109468771910346,"score_spread":0.20894335633551656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49738050","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.26520628,0.0050547877,0.6458998,0.0020453283,0.0008566819,0.0001167703,0.0011637936,0.0030001712,0.0766564],"genre_scores_gemma":[0.7873022,0.0021813512,0.17968068,0.0005059744,0.00080902386,0.00011139647,0.0014602287,0.0010728594,0.026876338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940395,0.000106593456,0.000031674153,0.00010356477,0.00023820704,0.000116031304],"domain_scores_gemma":[0.9971631,0.0013324148,0.00023642957,0.0006880903,0.00033984773,0.0002400438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084135664,0.00044488537,0.00095361855,0.0023739259,0.0011052355,0.0022377688,0.0015366363,0.00093907875,0.009506713],"category_scores_gemma":[0.009655345,0.0006242087,0.0005323031,0.0026690594,0.0016643624,0.0038780167,0.0020693147,0.0026976678,0.0022647209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026010897,0.00007130126,0.0013917234,0.00014119643,0.000035111327,0.00015351421,0.0006550848,0.025329374,0.0054887594,0.8007533,0.015217191,0.15050338],"study_design_scores_gemma":[0.000040425253,0.00007355905,0.0013141067,0.000049088543,0.000030018731,0.0003277034,0.0002412893,0.12179767,0.0020891689,0.8553288,0.018663878,0.000044370903],"about_ca_topic_score_codex":0.0016523933,"about_ca_topic_score_gemma":0.002636458,"teacher_disagreement_score":0.009506713,"about_ca_system_score_codex":0.00083928474,"about_ca_system_score_gemma":0.00052865973,"threshold_uncertainty_score":0.03180307},"labels":[],"label_agreement":null},{"id":"W49762223","doi":"10.1007/978-3-319-03161-3_77","title":"Ouch! How Embodied Damage Indicators in First-Person Shooting Games Impact Gaming Experience","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gambling Behavior and Treatments","field":"Psychology","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 Manitoba","funders":"","keywords":"Computer science; Embodied cognition; Exploratory research; Flash (photography); Human–computer interaction; Simulation; First person; Artificial intelligence; Visual arts; Psychology; Art; Sociology","score_opus":0.05903034276041011,"score_gpt":0.3443845195369221,"score_spread":0.285354176776512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49762223","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.84208506,0.002235261,0.057884824,0.0017843376,0.0005918711,0.00012361754,0.0024209896,0.0038619456,0.08901207],"genre_scores_gemma":[0.9643701,0.0005668489,0.013424213,0.00021152126,0.000024148801,0.0000387552,0.0007015736,0.0004036929,0.02025921],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998454,0.0000333225,0.000004734431,0.00003325009,0.00005826086,0.000024981638],"domain_scores_gemma":[0.9996387,0.00021145602,0.00003864166,0.0000227066,0.000049901977,0.000038549493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032666585,0.00045234003,0.00026263265,0.00022091619,0.00023760245,0.0016395147,0.00041822498,0.0005219777,0.01784904],"category_scores_gemma":[0.0031466044,0.00020662669,0.0003133397,0.00015115734,0.00038024233,0.0016016398,0.0011565568,0.0007168142,0.0021973848],"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.0025188818,0.0005897237,0.08548969,0.0012502174,0.00033103034,0.0006545069,0.0067183697,0.022986375,0.07222537,0.021563115,0.042610522,0.74306214],"study_design_scores_gemma":[0.00012231058,0.0020591312,0.6045432,0.00122952,0.00060177204,0.0015041281,0.008097755,0.19958425,0.041974574,0.07097875,0.06887262,0.00043192695],"about_ca_topic_score_codex":0.0031164198,"about_ca_topic_score_gemma":0.0054826196,"teacher_disagreement_score":0.01784904,"about_ca_system_score_codex":0.00027283112,"about_ca_system_score_gemma":0.0001509688,"threshold_uncertainty_score":0.05971092},"labels":[],"label_agreement":null},{"id":"W49830884","doi":"10.1007/978-3-642-36054-1_7","title":"People-Centered Software Development: An Overview of Agile Methodologies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Agile software development; Computer science; Agile Unified Process; Agile usability engineering; Software engineering; Focus (optics); Test-driven development; Software development; Quality assurance; Lean software development; Systems engineering; Software; Software development process; Engineering; Programming language; Operations management","score_opus":0.14082622124068347,"score_gpt":0.33964033243070785,"score_spread":0.19881411119002437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49830884","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004551576,0.35762572,0.56622654,0.004102828,0.00077191304,0.00023424109,0.00011063446,0.0010289343,0.065347604],"genre_scores_gemma":[0.058833763,0.38393933,0.52118415,0.0019463119,0.0007001613,0.00042926476,0.00031443383,0.00034298404,0.032309603],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981188,0.000551728,0.00014090959,0.00017015137,0.0008855255,0.0001329065],"domain_scores_gemma":[0.99861,0.0008038658,0.00010012628,0.000106923086,0.00027795168,0.00010107059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019150375,0.0007503844,0.00068444625,0.0024232191,0.00054288254,0.002619847,0.0011598129,0.0014164338,0.0025572293],"category_scores_gemma":[0.0016720863,0.0007288491,0.0006032104,0.0048773084,0.0010798497,0.002615936,0.0015992237,0.0022017676,0.0016085268],"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.000020016185,0.00013294579,0.00046337675,0.0021219717,0.000036590714,0.00012638028,0.0010770878,0.0020166808,0.0023881292,0.07060091,0.0156433,0.9053726],"study_design_scores_gemma":[0.000025540126,0.00017359486,0.0012017647,0.0030824144,0.00003487966,0.0012486952,0.0005625294,0.005290607,0.0033776914,0.103414126,0.88153505,0.00005314711],"about_ca_topic_score_codex":0.0009468983,"about_ca_topic_score_gemma":0.0014160568,"teacher_disagreement_score":0.002619847,"about_ca_system_score_codex":0.00089008466,"about_ca_system_score_gemma":0.001742486,"threshold_uncertainty_score":0.010127783},"labels":[],"label_agreement":null},{"id":"W50392334","doi":"10.1007/978-3-319-11656-3_10","title":"Dynamic Weighted Fusion of Adaptive Classifier Ensembles Based on Changing Data Streams","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Classifier (UML); Computer science; Artificial intelligence; Histogram; Pattern recognition (psychology); Fusion; Sensor fusion; Data mining; Concept drift; Machine learning; Data stream mining","score_opus":0.02906176273631778,"score_gpt":0.2645710276208664,"score_spread":0.2355092648845486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50392334","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.0548087,0.00064887217,0.94189084,0.00016797229,0.00027592405,0.00007482328,0.00007831592,0.0005266708,0.0015278745],"genre_scores_gemma":[0.74472225,0.0005754051,0.24981987,0.0001509715,0.0003442831,0.00015842996,0.00040977378,0.00014670525,0.003672255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860543,0.00025073494,0.000101863705,0.0003936855,0.0005005341,0.0001477158],"domain_scores_gemma":[0.99662185,0.0010978815,0.0002160244,0.0003834125,0.001515317,0.00016560798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030977393,0.0010150854,0.0020433003,0.001125013,0.00064011593,0.0017009921,0.0017723005,0.0011445741,0.0012506341],"category_scores_gemma":[0.0071096853,0.0005657665,0.0010157151,0.0015536834,0.00045194433,0.002496305,0.0019673589,0.0016562531,0.00058696565],"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.0007438025,0.00036620392,0.0038774817,0.00014515652,0.00035453934,0.00017589702,0.00029720186,0.31396142,0.028763909,0.006162566,0.004243608,0.64090824],"study_design_scores_gemma":[0.0000060250622,0.000059842125,0.00050604285,0.0000071969844,0.000043294396,0.000033157507,0.000018701396,0.9942042,0.002326662,0.0022657292,0.0005185077,0.000010560557],"about_ca_topic_score_codex":0.0015628106,"about_ca_topic_score_gemma":0.0021302234,"teacher_disagreement_score":0.0030977393,"about_ca_system_score_codex":0.0006065637,"about_ca_system_score_gemma":0.00074684597,"threshold_uncertainty_score":0.016382635},"labels":[],"label_agreement":null},{"id":"W50490165","doi":"10.1007/978-3-642-21669-5_6","title":"A Classification Scheme for Characterizing Visual Mining","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"Concordia University","funders":"","keywords":"Computer science; Scheme (mathematics); Coding (social sciences); Visualization; Process (computing); Representation (politics); Data mining; Data visualization; Classification scheme; Artificial intelligence; Information retrieval; Machine learning","score_opus":0.06090087405889728,"score_gpt":0.31257347746646036,"score_spread":0.2516726034075631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50490165","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.018200727,0.0007922485,0.96505606,0.000548254,0.00020501531,0.0006893235,0.0024234203,0.0034060879,0.008678917],"genre_scores_gemma":[0.1036606,0.0005341672,0.8837787,0.00016745007,0.00013011644,0.00054304034,0.0038457892,0.00025211155,0.0070881024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795604,0.00023807504,0.000339704,0.00044100694,0.00080252154,0.00022264231],"domain_scores_gemma":[0.99226826,0.0016873913,0.0006716221,0.0018770728,0.003010458,0.0004852793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026393146,0.0011101437,0.0009182561,0.008314214,0.0019027911,0.003991012,0.0024729806,0.0014107408,0.0058942726],"category_scores_gemma":[0.0096046245,0.00046518026,0.0012709978,0.0060716085,0.0014905113,0.0053355573,0.0020411597,0.0022403575,0.0035457048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043293214,0.00032438233,0.008400087,0.00065133395,0.00005694914,0.0001308636,0.00043398046,0.00516428,0.028356053,0.13361347,0.02775176,0.7946839],"study_design_scores_gemma":[0.00012165665,0.000689746,0.010272382,0.00067704404,0.00026562015,0.001812671,0.0009564848,0.47547433,0.04808905,0.3501083,0.111308746,0.00022399501],"about_ca_topic_score_codex":0.0027757739,"about_ca_topic_score_gemma":0.0031136153,"teacher_disagreement_score":0.008314214,"about_ca_system_score_codex":0.001481925,"about_ca_system_score_gemma":0.0017917115,"threshold_uncertainty_score":0.01971829},"labels":[],"label_agreement":null},{"id":"W51026761","doi":"10.1007/978-3-642-45278-9_18","title":"Tight Bound on the Diameter of the Knödel Graph","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Combinatorics; Graph; Upper and lower bounds; Constructive; Physics; Mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.01807556455322648,"score_gpt":0.21454776107792875,"score_spread":0.19647219652470227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51026761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14040291,0.022174522,0.5832965,0.021425892,0.002543074,0.00032902468,0.0067520137,0.0049089445,0.21816722],"genre_scores_gemma":[0.7469061,0.015864333,0.16441283,0.004626314,0.004257782,0.00091023365,0.005760479,0.0033265115,0.053935397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965372,0.0006944365,0.00010717722,0.0009762734,0.00092247664,0.0007625213],"domain_scores_gemma":[0.97032446,0.021712305,0.0010373249,0.0030697014,0.0015762751,0.002280023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003099514,0.0035178664,0.0043299063,0.0030540673,0.0029981064,0.0069317454,0.0069096014,0.0031988642,0.0185394],"category_scores_gemma":[0.024442213,0.0024501313,0.0019240798,0.0036626766,0.0032800497,0.011678262,0.006683373,0.008632895,0.005180187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019519725,0.00045823434,0.003166618,0.0018335371,0.00028706848,0.0005315566,0.0010569334,0.13977227,0.026527517,0.64223206,0.096712254,0.08547001],"study_design_scores_gemma":[0.00012950963,0.0001984808,0.0015424876,0.00028519062,0.00019721003,0.0005502304,0.00025204674,0.20043457,0.0052091866,0.76438326,0.026721003,0.00009690993],"about_ca_topic_score_codex":0.0030431137,"about_ca_topic_score_gemma":0.0049358117,"teacher_disagreement_score":0.0185394,"about_ca_system_score_codex":0.005160088,"about_ca_system_score_gemma":0.0021592837,"threshold_uncertainty_score":0.06202048},"labels":[],"label_agreement":null},{"id":"W51122577","doi":"10.1007/3-540-45348-2_19","title":"Unconstrained vs. Constrained 3D Scene Manipulation","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Object (grammar); Computer graphics; Process (computing); Interface (matter); Graphics; Computer vision; Human–computer interaction; Computer graphics (images); Artificial intelligence; Input device; Computer hardware; Programming language","score_opus":0.019089549358594967,"score_gpt":0.25338518410808475,"score_spread":0.23429563474948978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51122577","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.15109016,0.0055593513,0.62664354,0.00034615863,0.00031866916,0.00028511675,0.0009611465,0.0026599194,0.21213602],"genre_scores_gemma":[0.8109476,0.0026203233,0.15584382,0.0001766936,0.00008480715,0.00017880353,0.0007896046,0.0013053879,0.02805303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992273,0.0001309191,0.000036422665,0.00014338692,0.00032696972,0.0001349454],"domain_scores_gemma":[0.9988231,0.000596901,0.00008132122,0.00034155097,0.00009727585,0.000059835114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040940804,0.0007008634,0.0007672003,0.00045437049,0.0004230693,0.0021724135,0.0010298863,0.0007089785,0.031478032],"category_scores_gemma":[0.0023986276,0.0005239357,0.00048212166,0.0006421338,0.0009703665,0.0026353209,0.0024138705,0.0005253209,0.0023210912],"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.003536359,0.0002584417,0.001367978,0.0017604841,0.00015615538,0.00023960706,0.00063823874,0.03704021,0.21685882,0.13731168,0.0074847513,0.59334725],"study_design_scores_gemma":[0.00046254843,0.0013118982,0.024984216,0.000785406,0.0005111088,0.0030824186,0.0013522933,0.49734035,0.23935984,0.1258603,0.104544,0.00040568627],"about_ca_topic_score_codex":0.0012580138,"about_ca_topic_score_gemma":0.0030943176,"teacher_disagreement_score":0.031478032,"about_ca_system_score_codex":0.00023228627,"about_ca_system_score_gemma":0.00030733846,"threshold_uncertainty_score":0.10530448},"labels":[],"label_agreement":null},{"id":"W5119791","doi":"10.1007/978-3-319-10885-8_3","title":"A Systematic Approach for Composing General Middleware Completions to Performance Models","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","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":"Carleton University","funders":"","keywords":"Computer science; Middleware (distributed applications); Programming language; Software engineering; Theoretical computer science; Distributed computing","score_opus":0.028512904725346056,"score_gpt":0.24190254234599357,"score_spread":0.2133896376206475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5119791","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.0009778029,0.000028515327,0.99659747,0.000035715206,0.000022095941,0.00006755319,0.000026481644,0.0012471345,0.0009972267],"genre_scores_gemma":[0.0397657,0.00013440661,0.9549756,0.00007871221,0.00006353135,0.00022287792,0.00024650746,0.0015010202,0.0030116984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951623,0.00103392,0.00061030296,0.0007515683,0.0021526779,0.00028923788],"domain_scores_gemma":[0.9929022,0.0024205882,0.0002997104,0.0026832437,0.001446592,0.00024759554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054252553,0.0018923366,0.001539512,0.0015966196,0.0016044847,0.0029626302,0.0035935037,0.0012872227,0.0055205696],"category_scores_gemma":[0.015346408,0.0022386473,0.0046054847,0.0013518346,0.00290261,0.005147859,0.007144802,0.0068334695,0.002404678],"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.00007690359,0.00014701788,0.00079441426,0.0005410276,0.00013674004,0.00039432506,0.0017986222,0.10262681,0.009266764,0.7374471,0.0054691276,0.14130124],"study_design_scores_gemma":[0.000025268057,0.000059330723,0.00016475274,0.000117508906,0.000112811336,0.00015942148,0.00015700707,0.38788393,0.009867194,0.5712903,0.030089961,0.00007237387],"about_ca_topic_score_codex":0.0031429362,"about_ca_topic_score_gemma":0.0046341084,"teacher_disagreement_score":0.0055205696,"about_ca_system_score_codex":0.0016050373,"about_ca_system_score_gemma":0.002644207,"threshold_uncertainty_score":0.028691828},"labels":[],"label_agreement":null},{"id":"W51487941","doi":"10.1007/978-3-642-21043-3_43","title":"COSINE: A Vertical Group Difference Approach to Contrast Set Mining","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Regina","funders":"","keywords":"Contrast (vision); Computer science; Group (periodic table); Set (abstract data type); Trigonometric functions; Algorithm; Artificial intelligence; Mathematics; Geometry; Programming language","score_opus":0.03398937478566339,"score_gpt":0.24866948160778735,"score_spread":0.21468010682212396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51487941","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.011036637,0.00058379857,0.9811763,0.0001407404,0.00022074758,0.00024351873,0.0012379659,0.0038263411,0.0015338995],"genre_scores_gemma":[0.06982351,0.0002725262,0.9231027,0.00010884483,0.00017085331,0.00032394906,0.0032956419,0.0006420811,0.0022598938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635446,0.00088253664,0.00033853741,0.0006460056,0.0015700106,0.00020850282],"domain_scores_gemma":[0.99630415,0.0016715699,0.000190919,0.00079179666,0.00088820053,0.00015344708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032781542,0.0010030675,0.0022122767,0.004957317,0.0011450273,0.0025595569,0.003635232,0.0012699323,0.005531494],"category_scores_gemma":[0.011805647,0.00061879714,0.0016847638,0.0069739367,0.00077492004,0.002658412,0.00270441,0.0017865296,0.0022085265],"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.000876994,0.0003931492,0.003357347,0.00042646646,0.0004378754,0.00013226658,0.00024776626,0.016087826,0.012484864,0.02078519,0.020045256,0.92472506],"study_design_scores_gemma":[0.00023377349,0.000542145,0.004814716,0.000092159506,0.0002627822,0.00064604887,0.0003881394,0.84380686,0.022942077,0.085675135,0.04045195,0.00014422077],"about_ca_topic_score_codex":0.002897726,"about_ca_topic_score_gemma":0.003472654,"teacher_disagreement_score":0.005531494,"about_ca_system_score_codex":0.0006916295,"about_ca_system_score_gemma":0.0014878602,"threshold_uncertainty_score":0.01850468},"labels":[],"label_agreement":null},{"id":"W51549515","doi":"10.1007/978-3-642-21538-4_28","title":"Argo Vehicle Simulation of Motion Driven 3D LIDAR Detection and Environment Awareness","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotics and Sensor-Based Localization","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 Waterloo","funders":"","keywords":"Occupancy grid mapping; Computer science; Lidar; Grid; Unmanned ground vehicle; MATLAB; Occupancy; Terrain; Computer vision; Artificial intelligence; Object detection; 3D modeling; Real-time computing; Computer graphics (images); Remote sensing; Pattern recognition (psychology); Mobile robot; Geography; Cartography; Robot; Engineering","score_opus":0.013603569773907486,"score_gpt":0.19976673649339083,"score_spread":0.18616316671948335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51549515","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.54125017,0.0003289173,0.36927682,0.0009763657,0.00046317783,0.0002991441,0.0047000614,0.010144767,0.072560616],"genre_scores_gemma":[0.95198053,0.00010132058,0.039544012,0.00006680195,0.000017272157,0.00012511898,0.00089743274,0.00034025792,0.0069272146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984026,0.00003097691,0.0000070819497,0.000025265696,0.00006524263,0.000031241307],"domain_scores_gemma":[0.99967253,0.00016602558,0.000023653125,0.00003841838,0.000063984386,0.00003549976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002339591,0.00054449006,0.00065686344,0.00036005175,0.00044748027,0.00093465665,0.0015214287,0.0012793934,0.009779396],"category_scores_gemma":[0.00092851394,0.00053416943,0.0005665349,0.0003780518,0.00048732938,0.00059332204,0.00082602113,0.0006563941,0.00092579104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000793441,0.00003962798,0.00047571017,0.000035517787,0.000015632022,0.00007649879,0.000045597997,0.99136555,0.0011658203,0.0024505416,0.00072143384,0.003528768],"study_design_scores_gemma":[0.000013315656,0.000009675003,0.0000677426,0.000002142191,0.0000020299701,0.000007808195,0.0000082344595,0.9987317,0.00039121983,0.0003681179,0.00039455757,0.000003491851],"about_ca_topic_score_codex":0.020563753,"about_ca_topic_score_gemma":0.013772606,"teacher_disagreement_score":0.020563753,"about_ca_system_score_codex":0.0006472684,"about_ca_system_score_gemma":0.0009068608,"threshold_uncertainty_score":0.04088813},"labels":[],"label_agreement":null},{"id":"W51696653","doi":"10.1007/978-3-642-30191-9_14","title":"Non-identifiable Pedigrees and a Bayesian Solution","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pedigree chart; Identifiability; Inference; Computer science; Family tree; Tree (set theory); Bayesian probability; Bayesian inference; Theoretical computer science; Bayesian network; Graph; Bayes' theorem; Combinatorics; Machine learning; Algorithm; Artificial intelligence; Mathematics; Genetics; Biology; Gene","score_opus":0.010841581128807593,"score_gpt":0.24378642373015896,"score_spread":0.23294484260135137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51696653","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.0038255851,0.00040507995,0.9918727,0.0009802766,0.00004227923,0.000042864955,0.00022775949,0.0000868559,0.0025165747],"genre_scores_gemma":[0.12252407,0.0019932848,0.851501,0.00052625424,0.00043037176,0.0005739223,0.0011946862,0.00019506445,0.021061342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978588,0.0013882305,0.000084706306,0.00032496027,0.00024624495,0.00009704746],"domain_scores_gemma":[0.9831597,0.015086396,0.00049297314,0.00055052066,0.0005241512,0.00018622924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053246287,0.0012585291,0.0025577426,0.0016023994,0.0011180626,0.002214816,0.0030961125,0.003942655,0.008298596],"category_scores_gemma":[0.033266548,0.0026239145,0.0017054025,0.0029803484,0.0017034326,0.0043562665,0.002935397,0.0042365994,0.0013060401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009304547,0.00009270571,0.0007771954,0.0002067559,0.00012314325,0.00022771764,0.0002576242,0.40034905,0.00017345393,0.53452224,0.007485721,0.055691294],"study_design_scores_gemma":[0.000047646907,0.0000099986955,0.00014984154,0.00003850411,0.000027422891,0.00008389155,0.000025199313,0.3856788,0.000053137446,0.61201215,0.0018572438,0.000016153897],"about_ca_topic_score_codex":0.0067510554,"about_ca_topic_score_gemma":0.005640539,"teacher_disagreement_score":0.008298596,"about_ca_system_score_codex":0.0012715238,"about_ca_system_score_gemma":0.002357225,"threshold_uncertainty_score":0.028159678},"labels":[],"label_agreement":null},{"id":"W51983418","doi":"10.1007/978-3-540-45226-3_12","title":"Design, Integration and Evaluation of an Artificial Intelligence-Based Control System for the Improvement of the Monitoring and Quality Control Process in the Manufacturing of Metal Casting Components","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Manufacturing Process and Optimization","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 Windsor","funders":"","keywords":"Computer science; Statistical process control; Process (computing); Process control; Reliability (semiconductor); Quality (philosophy); Artificial neural network; Control system; Control (management); Manufacturing engineering; Artificial intelligence; Engineering","score_opus":0.06262433633107505,"score_gpt":0.2867025991011754,"score_spread":0.22407826277010034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51983418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21564232,0.00044143375,0.77132094,0.00024171741,0.00020569614,0.0010926831,0.00011090972,0.0046180403,0.006326335],"genre_scores_gemma":[0.7896427,0.00014037365,0.20566602,0.00012728121,0.000033882,0.00049320573,0.00015908861,0.00010064721,0.003636794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992372,0.00011616937,0.000060421018,0.00017823487,0.00033729395,0.0000707335],"domain_scores_gemma":[0.9990792,0.0001829638,0.00009945426,0.00009792618,0.0004887376,0.00005158625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346488,0.0006297481,0.00069392315,0.0004783426,0.0005229324,0.0011229209,0.0016406775,0.00097083213,0.0018418254],"category_scores_gemma":[0.0016562184,0.0004049288,0.00033113023,0.0003005533,0.00041781215,0.0006882223,0.00041526236,0.00050386117,0.00039101928],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024164903,0.0017334892,0.003903041,0.00059116737,0.00022838858,0.00035859653,0.00044422035,0.16159427,0.43622166,0.004576069,0.002478058,0.3854546],"study_design_scores_gemma":[0.00032295554,0.003010024,0.0047512334,0.000026137965,0.00029065984,0.00017847038,0.000040543775,0.7687375,0.21681942,0.0006530981,0.0051201135,0.00004981237],"about_ca_topic_score_codex":0.0029420601,"about_ca_topic_score_gemma":0.0019614112,"teacher_disagreement_score":0.0029420601,"about_ca_system_score_codex":0.0006180439,"about_ca_system_score_gemma":0.0010647415,"threshold_uncertainty_score":0.007120967},"labels":[],"label_agreement":null},{"id":"W52186638","doi":"10.1007/978-3-642-23638-9_11","title":"Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","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":"Saint Mary's University","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Computer science; Regular language; Set (abstract data type); Property (philosophy); Kleene algebra; Discrete mathematics; Polynomial; DNA computing; Time complexity; Algorithm; Theoretical computer science; Mathematics; Programming language; Automaton","score_opus":0.02026896284138437,"score_gpt":0.24696026080827513,"score_spread":0.22669129796689075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52186638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41243705,0.00083474425,0.5550763,0.0010591461,0.00017193581,0.00020287372,0.0029804313,0.0040905946,0.023146939],"genre_scores_gemma":[0.7013596,0.0004485707,0.28364545,0.00020044456,0.000089862115,0.00013608596,0.004659858,0.0011937089,0.008266383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986345,0.00012902058,0.00012014073,0.00048073917,0.00039846826,0.00023713232],"domain_scores_gemma":[0.9960193,0.0028202662,0.00024352127,0.00041794195,0.00029897664,0.00019999196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086301763,0.0009393373,0.0012070115,0.0012271333,0.0010330244,0.004631017,0.0017452212,0.0011416749,0.009025148],"category_scores_gemma":[0.0065120757,0.0011243605,0.0022124157,0.0020198182,0.002194472,0.010405741,0.002803392,0.0026442746,0.001467124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011491649,0.00044103566,0.0036457467,0.001927085,0.00022305288,0.000758456,0.003478247,0.052829508,0.04174568,0.7089381,0.011064499,0.17379943],"study_design_scores_gemma":[0.00006136534,0.00009408163,0.00051570183,0.000116313546,0.00009065085,0.0002817835,0.00091719994,0.043492433,0.018589592,0.9269551,0.008818526,0.000067381734],"about_ca_topic_score_codex":0.0012965809,"about_ca_topic_score_gemma":0.0029542502,"teacher_disagreement_score":0.009025148,"about_ca_system_score_codex":0.0011049802,"about_ca_system_score_gemma":0.0009173501,"threshold_uncertainty_score":0.030192137},"labels":[],"label_agreement":null},{"id":"W52208544","doi":"10.1007/978-3-642-16612-9_10","title":"Runtime Verification for the Web","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Web application; Programming language; Runtime verification; Temporal logic; Extension (predicate logic); Model checking; World Wide Web; Operating system; Formal verification","score_opus":0.032916549767431386,"score_gpt":0.2811555954730172,"score_spread":0.24823904570558583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52208544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018419264,0.0009773204,0.93102014,0.00076938915,0.00034394136,0.00013586186,0.00032656777,0.031083954,0.016923591],"genre_scores_gemma":[0.5811074,0.0009813497,0.38619852,0.0004114728,0.00024654498,0.00018725092,0.0013047106,0.006138764,0.023423951],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600995,0.0010748097,0.00025962145,0.0005723949,0.0016469047,0.0004361945],"domain_scores_gemma":[0.99395305,0.00251771,0.00024781833,0.0024715797,0.0006978691,0.00011203035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028902064,0.000977838,0.0010128808,0.0010582423,0.0011854763,0.0030121773,0.0020150738,0.0013600037,0.011276255],"category_scores_gemma":[0.0088356715,0.0010825626,0.002001036,0.0007399248,0.0020693345,0.0052011777,0.003248956,0.0031374102,0.0032191088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007912275,0.0002714797,0.0021074272,0.0010462698,0.00017332562,0.0010775615,0.00066058803,0.062237404,0.040866885,0.42392826,0.028762534,0.43807712],"study_design_scores_gemma":[0.00014907731,0.00010644884,0.0008935741,0.00027620813,0.00015735313,0.0006384281,0.00013492991,0.44166175,0.09420211,0.40847763,0.0532052,0.00009730239],"about_ca_topic_score_codex":0.0035159877,"about_ca_topic_score_gemma":0.0036589303,"teacher_disagreement_score":0.011276255,"about_ca_system_score_codex":0.0014587174,"about_ca_system_score_gemma":0.001891935,"threshold_uncertainty_score":0.037722826},"labels":[],"label_agreement":null},{"id":"W52376542","doi":"10.1007/978-3-642-19641-6_4","title":"The Personal Equation of Complex Individual Cognition during Visual Interface Interaction","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cognition; Human–computer interaction; Interface (matter); Cognitive science; User interface; Psychology; Programming language","score_opus":0.06616030832857735,"score_gpt":0.3167468442517306,"score_spread":0.2505865359231533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52376542","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46430862,0.0007778093,0.32231253,0.0026377784,0.0001893481,0.00013389012,0.00015356786,0.00027198214,0.20921443],"genre_scores_gemma":[0.9746943,0.00014237424,0.018116355,0.00006567782,0.000027011198,0.0000526839,0.000048260612,0.00008044268,0.0067729778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914,0.0002870001,0.000041388732,0.00022201815,0.0002428534,0.00006680061],"domain_scores_gemma":[0.99677783,0.0022691314,0.00021030221,0.00036968687,0.0002832734,0.00008973279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012641696,0.0002977855,0.00026637933,0.00036265573,0.00048205067,0.0027343065,0.00080870796,0.0008942262,0.011475573],"category_scores_gemma":[0.011885373,0.00040215405,0.00048104703,0.00042609454,0.0023527257,0.0054014563,0.0013630235,0.0016190513,0.00047649455],"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.00026517097,0.000109981345,0.0060823085,0.0001831821,0.00005624807,0.00023338183,0.026244637,0.009593741,0.007798511,0.86594164,0.002036201,0.081455044],"study_design_scores_gemma":[0.000082809354,0.00019537362,0.028248342,0.00009267117,0.00007764411,0.00062781584,0.006815742,0.1008863,0.003417421,0.84854513,0.010932322,0.0000783941],"about_ca_topic_score_codex":0.0023921975,"about_ca_topic_score_gemma":0.0012052038,"teacher_disagreement_score":0.011475573,"about_ca_system_score_codex":0.0008459392,"about_ca_system_score_gemma":0.00073749566,"threshold_uncertainty_score":0.038389564},"labels":[],"label_agreement":null},{"id":"W52626029","doi":"10.1007/978-3-319-06483-3_2","title":"Rhetorical Figuration as a Metric in Text Summarization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automatic summarization; Rhetorical question; Computer science; Metric (unit); Natural language processing; Artificial intelligence; Linguistics; Philosophy; Engineering","score_opus":0.013562769440007325,"score_gpt":0.2671132741178015,"score_spread":0.25355050467779416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52626029","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.33926213,0.013947947,0.59932095,0.0023236708,0.0009933999,0.0005672294,0.0054383576,0.006315425,0.031830836],"genre_scores_gemma":[0.8095704,0.0011211148,0.18036808,0.00010816223,0.00043147212,0.00032852322,0.004144663,0.0005304298,0.003397185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943311,0.0028642125,0.00057524216,0.00066482363,0.0013967573,0.00016775151],"domain_scores_gemma":[0.9726653,0.019067533,0.0025408126,0.0014770987,0.003713314,0.0005359166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004007407,0.00066155934,0.00084415526,0.0061742095,0.0009516911,0.0037476593,0.0009634693,0.0010885913,0.004250799],"category_scores_gemma":[0.032285165,0.00033386264,0.0004606801,0.0052727736,0.0010331603,0.005654501,0.0016645732,0.0012011697,0.0017012578],"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.0017347224,0.00021578603,0.012295318,0.0019950408,0.00030127724,0.00024990164,0.003767494,0.017192945,0.04306119,0.048150305,0.016418094,0.854618],"study_design_scores_gemma":[0.00028746136,0.0040902887,0.0682221,0.0010051737,0.000995215,0.0010897865,0.005889558,0.5709309,0.07946839,0.18866433,0.078904524,0.00045225656],"about_ca_topic_score_codex":0.0005388008,"about_ca_topic_score_gemma":0.00082337833,"teacher_disagreement_score":0.0061742095,"about_ca_system_score_codex":0.0008879658,"about_ca_system_score_gemma":0.0005709164,"threshold_uncertainty_score":0.021193504},"labels":[],"label_agreement":null},{"id":"W52731893","doi":"10.1007/11424758_77","title":"A Novel Topology-Based Matching Algorithm for Fingerprint Recognition in the Presence of Elastic Distortions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minutiae; Computer science; Delaunay triangulation; Matching (statistics); Fingerprint (computing); Blossom algorithm; Algorithm; Artificial intelligence; Fingerprint recognition; Transformation (genetics); Set (abstract data type); Pattern recognition (psychology); Scheme (mathematics); Mathematics","score_opus":0.03428365610204902,"score_gpt":0.27262104970909634,"score_spread":0.2383373936070473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52731893","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.010821155,0.00020941008,0.9872486,0.000047785717,0.00007020785,0.000036982856,0.000036167792,0.0008095749,0.00072005665],"genre_scores_gemma":[0.11872686,0.00034434884,0.877133,0.00006594064,0.0000823185,0.00009747719,0.00020289174,0.00012557005,0.0032215922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.0000952049,0.000040276824,0.0001500577,0.0005076817,0.000050994222],"domain_scores_gemma":[0.9991278,0.00024215407,0.00009039322,0.0001746374,0.00031961533,0.000045450222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005757616,0.00060985517,0.0011803207,0.0013860005,0.00052634085,0.0010211748,0.0017260113,0.0013850426,0.002543526],"category_scores_gemma":[0.0021180634,0.00044083796,0.00055218756,0.0017279924,0.00040581648,0.0020451224,0.0011720569,0.0008345235,0.0015131263],"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.00026787398,0.00011481717,0.00065364136,0.00010461902,0.00007789038,0.00015278814,0.000071129965,0.030871335,0.12123537,0.0048719826,0.002382735,0.8391958],"study_design_scores_gemma":[0.00004317396,0.00022645433,0.0014180865,0.000013823331,0.000057580084,0.001298078,0.00003707944,0.9304373,0.056548323,0.0037784132,0.006083209,0.00005844836],"about_ca_topic_score_codex":0.0010045962,"about_ca_topic_score_gemma":0.0012313883,"teacher_disagreement_score":0.002543526,"about_ca_system_score_codex":0.00031919568,"about_ca_system_score_gemma":0.0005570451,"threshold_uncertainty_score":0.00850898},"labels":[],"label_agreement":null},{"id":"W52798415","doi":"10.1007/978-3-642-41524-1_12","title":"Solving Modular Model Expansion: Case Studies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Modulo; Integer programming; Task (project management); Scheduling (production processes); Linear programming; Set (abstract data type); Satisfiability; Theoretical computer science; Mathematical optimization; Algorithm; Programming language; Mathematics; Engineering; Systems engineering","score_opus":0.03585422246829713,"score_gpt":0.26820216789040535,"score_spread":0.23234794542210824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52798415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24199444,0.0013393234,0.69691944,0.0023356122,0.00009223827,0.0007447316,0.00025014568,0.0013089995,0.05501514],"genre_scores_gemma":[0.4986687,0.00060726615,0.49415362,0.00022278074,0.00006914091,0.0002682412,0.00047941355,0.00033314092,0.005197656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962387,0.002361882,0.00014427895,0.00032403317,0.00067138736,0.0002596744],"domain_scores_gemma":[0.96864754,0.027420618,0.0005321467,0.0024047208,0.00073053944,0.0002644373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051284833,0.0013895757,0.000916123,0.0008763244,0.0012804546,0.0018362978,0.0030351474,0.0031003128,0.01005031],"category_scores_gemma":[0.03681996,0.00067675323,0.0016614777,0.0016165044,0.002451705,0.007913473,0.0042638695,0.004136311,0.00090853556],"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.0014196533,0.0025185049,0.003396535,0.0017176004,0.00019782965,0.0017694548,0.0038655486,0.18229637,0.006321933,0.36489078,0.017090192,0.41451558],"study_design_scores_gemma":[0.00045301154,0.0003612274,0.000600101,0.00019542346,0.00016590404,0.00087021815,0.001204842,0.6445699,0.010281186,0.32855594,0.012700421,0.00004188228],"about_ca_topic_score_codex":0.0020577514,"about_ca_topic_score_gemma":0.0043658693,"teacher_disagreement_score":0.01005031,"about_ca_system_score_codex":0.001098392,"about_ca_system_score_gemma":0.0010139622,"threshold_uncertainty_score":0.03362161},"labels":[],"label_agreement":null},{"id":"W53081550","doi":"10.1007/978-3-642-23626-6_69","title":"Adaptive Multi-cluster Fuzzy C-Means Segmentation of Breast Parenchymal Tissue in Digital Mammography","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Digital Radiography and Breast Imaging","field":"Medicine","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Cancer Institute; University of Toronto; U.S. Department of Defense","keywords":"Computer science; Breast cancer; Artificial intelligence; Digital mammography; Segmentation; Pattern recognition (psychology); Mammography; Breast density; Jaccard index; Ground truth; Cluster analysis; Fuzzy logic; Cancer; Medicine","score_opus":0.018260379945897066,"score_gpt":0.2526967971718959,"score_spread":0.23443641722599884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53081550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15940046,0.0008628915,0.837441,0.0001467463,0.00006746832,0.000118106196,0.00010591405,0.0005157914,0.0013416194],"genre_scores_gemma":[0.44874206,0.00035866947,0.54899675,0.000059680267,0.00003635477,0.000059066817,0.00013836064,0.0001164658,0.0014925859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.00012423957,0.00004862476,0.000131508,0.0002803418,0.000080115016],"domain_scores_gemma":[0.9989039,0.00042899876,0.00007674009,0.0000784584,0.00047303524,0.000038950748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012081474,0.00046531463,0.00066585554,0.0021645813,0.00063340005,0.0011132583,0.0012221972,0.0012068133,0.00076999963],"category_scores_gemma":[0.0025544418,0.00046905922,0.0006716477,0.0015050505,0.00051594124,0.00056815334,0.0005786579,0.0004619208,0.00024571596],"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.0012914177,0.00018676065,0.004836731,0.000576604,0.00016860981,0.00025405284,0.0005275878,0.18447006,0.17639437,0.0030311802,0.002504742,0.6257579],"study_design_scores_gemma":[0.000018563285,0.000070290276,0.004964085,0.000031107767,0.000057962967,0.00019774363,0.00008794398,0.9519785,0.040130462,0.0012774322,0.001145523,0.0000403876],"about_ca_topic_score_codex":0.0143208,"about_ca_topic_score_gemma":0.016279027,"teacher_disagreement_score":0.0143208,"about_ca_system_score_codex":0.00090766465,"about_ca_system_score_gemma":0.0011727801,"threshold_uncertainty_score":0.028474867},"labels":[],"label_agreement":null},{"id":"W53236038","doi":"10.1007/978-3-319-07983-7_21","title":"Complex Question Answering: Homogeneous or Heterogeneous, Which Ensemble Is Better?","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Homogeneous; Support vector machine; Hidden Markov model; Ensemble learning; Conditional random field; Artificial intelligence; Maximum-entropy Markov model; Question answering; Machine learning; Base (topology); Entropy (arrow of time); Principle of maximum entropy; Ensemble forecasting; Markov chain; Task (project management); Markov model; Variable-order Markov model; Mathematics","score_opus":0.030604614856074654,"score_gpt":0.26162371290475506,"score_spread":0.2310190980486804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53236038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14413258,0.018597648,0.79048735,0.011582833,0.0008098147,0.00030226677,0.002473606,0.0032979792,0.028315984],"genre_scores_gemma":[0.6559421,0.004975745,0.31591743,0.0025137982,0.0036023501,0.00025253158,0.0070835417,0.0010154827,0.008697074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960085,0.0013151135,0.0002375728,0.0015069642,0.0006992523,0.00023260144],"domain_scores_gemma":[0.9865536,0.007931422,0.00058538886,0.0025756902,0.001526388,0.0008274609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077853054,0.001137403,0.0020190976,0.0018605943,0.000803634,0.0042579356,0.0018919557,0.0018025065,0.007725801],"category_scores_gemma":[0.018174171,0.00054649706,0.0015715499,0.0021472843,0.001089579,0.010814836,0.003088043,0.0027279102,0.0036470229],"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.0008310488,0.00050974754,0.016935539,0.001072249,0.0011494253,0.00011035025,0.0011017785,0.012146455,0.01481227,0.025696794,0.039855998,0.88577825],"study_design_scores_gemma":[0.0001940008,0.0006876354,0.03250322,0.0005044957,0.0017639041,0.0013529741,0.0016265127,0.4201134,0.02205429,0.45052502,0.068469465,0.00020498481],"about_ca_topic_score_codex":0.00069171813,"about_ca_topic_score_gemma":0.0010680885,"teacher_disagreement_score":0.0077853054,"about_ca_system_score_codex":0.0005992728,"about_ca_system_score_gemma":0.0005877707,"threshold_uncertainty_score":0.0411731},"labels":[],"label_agreement":null},{"id":"W53369794","doi":"10.1007/978-3-642-39995-4_3","title":"Service Subscription and Consumption for Personal Web Applications","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Web service; World Wide Web; Web modeling; WS-Policy; Web standards; Web development; WS-Addressing; Interoperation; Multimedia; Web application security; Interoperability","score_opus":0.01832909718512008,"score_gpt":0.24005288724304905,"score_spread":0.22172379005792897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53369794","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095280826,0.0049984255,0.64894927,0.001752981,0.00045514264,0.00027726794,0.0004463717,0.006535059,0.24130471],"genre_scores_gemma":[0.7228154,0.0031977105,0.08347156,0.00023727858,0.00041643728,0.00015354493,0.00078659964,0.0015569446,0.18736449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935704,0.000113443886,0.00003029892,0.00008607735,0.00032692487,0.000086248176],"domain_scores_gemma":[0.99928266,0.0003056399,0.00002562029,0.00024744228,0.00009191943,0.000046700283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009023203,0.0004339137,0.00063499936,0.0006025795,0.0006161565,0.0019037268,0.0010111969,0.00087288144,0.019980174],"category_scores_gemma":[0.0026597208,0.0003879294,0.00047783292,0.0012217113,0.000740789,0.003025038,0.0009340246,0.0010767622,0.003911829],"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.000538119,0.00029697866,0.0011747761,0.00024727918,0.000026536572,0.00034653995,0.0005840702,0.021593997,0.015973076,0.4860117,0.023024851,0.45018202],"study_design_scores_gemma":[0.00006581671,0.00013348408,0.0025606442,0.00008065439,0.00006814937,0.00092089875,0.00033270812,0.45923164,0.020744825,0.38285783,0.13294327,0.000060025228],"about_ca_topic_score_codex":0.0022585487,"about_ca_topic_score_gemma":0.0023123492,"teacher_disagreement_score":0.019980174,"about_ca_system_score_codex":0.001422296,"about_ca_system_score_gemma":0.0007239332,"threshold_uncertainty_score":0.06684029},"labels":[],"label_agreement":null},{"id":"W53417064","doi":"10.1007/3-540-46084-5_46","title":"Associative Arithmetic with Boltzmann Machines: The Role of Number Representations","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Numerosity adaptation effect; Mental arithmetic; Learnability; Boltzmann machine; Computer science; Associative property; Numerical cognition; Arithmetic; Cognition; Mathematics; Artificial intelligence; Psychology; Artificial neural network; Pure mathematics","score_opus":0.018555486348201304,"score_gpt":0.27959644343732687,"score_spread":0.26104095708912556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53417064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03792362,0.01624309,0.76788694,0.004040695,0.0012920225,0.00004839783,0.00013717303,0.00050918834,0.17191881],"genre_scores_gemma":[0.69955003,0.011267721,0.25204358,0.00065277173,0.0021219365,0.0001949085,0.0002065984,0.00026346886,0.033699036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946934,0.00024834435,0.000025212716,0.000092958595,0.00012723394,0.000036912676],"domain_scores_gemma":[0.99895537,0.0006453766,0.00006886959,0.00018971198,0.000083823834,0.000056818957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010092753,0.00063563726,0.00077341223,0.00059025,0.0006570895,0.0037225133,0.0021605983,0.0014094837,0.007660388],"category_scores_gemma":[0.0048922817,0.0006400369,0.0007126389,0.0010913559,0.00400457,0.010214911,0.0017495247,0.002635163,0.0015257623],"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.0000072037737,0.0000054268094,0.000049683054,0.000027251392,0.0000054095194,0.000012203487,0.000057017773,0.0032625606,0.00019138027,0.98559433,0.0009837858,0.009803787],"study_design_scores_gemma":[0.0000014512357,0.0000020317693,0.000025806405,0.00000482458,0.0000013638821,0.000016978343,0.0000071058093,0.008318049,0.00008003427,0.98990065,0.0016385273,0.0000031802244],"about_ca_topic_score_codex":0.00042566174,"about_ca_topic_score_gemma":0.000490529,"teacher_disagreement_score":0.007660388,"about_ca_system_score_codex":0.00063005753,"about_ca_system_score_gemma":0.000570509,"threshold_uncertainty_score":0.02562654},"labels":[],"label_agreement":null},{"id":"W53786381","doi":"10.1007/978-3-319-08789-4_11","title":"ChainTracker, a Model-Transformation Trace Analysis Tool for Code-Generation Environments","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Code generation; Traceability; Computer science; TRACE (psycholinguistics); Model transformation; Code (set theory); Software engineering; Transformation (genetics); Synchronizing; Systems engineering; Programming language; Engineering; Artificial intelligence; Consistency (knowledge bases); Key (lock); Computer security","score_opus":0.017233467710893915,"score_gpt":0.23616642246593367,"score_spread":0.21893295475503977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53786381","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.002461804,0.00015738618,0.942682,0.00008794935,0.00006418448,0.000092541195,0.00055151415,0.050791375,0.0031111736],"genre_scores_gemma":[0.05398841,0.00063555007,0.8992699,0.00018582336,0.000043567452,0.0003137989,0.0043606777,0.02463898,0.01656331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864703,0.00019910606,0.00009286281,0.00024507052,0.00071866787,0.000097303884],"domain_scores_gemma":[0.997382,0.0013510013,0.00015984922,0.0006142895,0.0004227974,0.00007012507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014425383,0.0016760901,0.00077754894,0.0018865463,0.00080779835,0.0020801073,0.0027013319,0.0012471974,0.020129682],"category_scores_gemma":[0.0064797853,0.0013277435,0.0013439953,0.0015777444,0.0006381986,0.003323322,0.0021654356,0.0027783555,0.0058083176],"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.0003338756,0.00034607903,0.002008794,0.0009560525,0.00013732191,0.00034795378,0.00075396,0.036975574,0.026311187,0.041911155,0.06138119,0.8285368],"study_design_scores_gemma":[0.00023853572,0.0002596984,0.0012440156,0.00045916828,0.00020101841,0.00067642855,0.0002300772,0.5937846,0.12329418,0.090225905,0.18920325,0.00018324539],"about_ca_topic_score_codex":0.003446184,"about_ca_topic_score_gemma":0.0053379973,"teacher_disagreement_score":0.020129682,"about_ca_system_score_codex":0.000698096,"about_ca_system_score_gemma":0.0028150626,"threshold_uncertainty_score":0.06734049},"labels":[],"label_agreement":null},{"id":"W53841409","doi":"10.1007/978-3-642-33415-3_86","title":"Tractometer: Online Evaluation System for Tractography","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Tractography; Computer science; Deconvolution; Wavelet; Artificial intelligence; Noise reduction; Pattern recognition (psychology); Data mining; Algorithm; Diffusion MRI","score_opus":0.10058233065189592,"score_gpt":0.4048299809011763,"score_spread":0.30424765024928035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W53841409","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023084175,0.00048336855,0.28792492,0.00019737777,0.00030169621,0.00081077404,0.025926381,0.6574898,0.00378157],"genre_scores_gemma":[0.29805544,0.0010909146,0.5012201,0.00075541105,0.0003678729,0.0039625787,0.09177876,0.08146339,0.021305528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998738,0.0002783311,0.00022607774,0.00027048957,0.00038902185,0.00009811836],"domain_scores_gemma":[0.9939323,0.002704884,0.0004170678,0.0007913741,0.0016324272,0.0005219257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028233859,0.002522397,0.0015427154,0.0039247433,0.00047686166,0.001984997,0.0015903611,0.0013623397,0.042725418],"category_scores_gemma":[0.010937622,0.0006413113,0.00071892096,0.0016551347,0.0003427926,0.002203066,0.0020404777,0.0009194937,0.015577036],"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.0061686737,0.00060530286,0.013928781,0.0016656372,0.0005912771,0.0006921601,0.00051387725,0.009762,0.05190735,0.0034663058,0.31432942,0.59636915],"study_design_scores_gemma":[0.001606146,0.0016830114,0.04231519,0.0004647597,0.00052749226,0.0022623239,0.00037548586,0.6041236,0.18535066,0.012763378,0.14772427,0.00080371695],"about_ca_topic_score_codex":0.0035891437,"about_ca_topic_score_gemma":0.00437188,"teacher_disagreement_score":0.042725418,"about_ca_system_score_codex":0.00054582837,"about_ca_system_score_gemma":0.0011982357,"threshold_uncertainty_score":0.14293075},"labels":[],"label_agreement":null},{"id":"W54064588","doi":"10.1007/978-3-642-23944-1_14","title":"Validation of Direct Registration of Whole-Mount Prostate Digital Histopathology to ex vivo MR Images","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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":"Western University; Lawson Health Research Institute; Robarts Clinical Trials","funders":"","keywords":"Fiducial marker; Ex vivo; Image registration; Computer science; Histopathology; Magnetic resonance imaging; Artificial intelligence; Prostate cancer; Prostate; Slicing; Computer vision; Medicine; Nuclear medicine; Radiology; In vivo; Pathology; Cancer; Image (mathematics)","score_opus":0.018556048971588968,"score_gpt":0.26062443807596924,"score_spread":0.24206838910438028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54064588","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.777498,0.002186916,0.21214318,0.0001357177,0.00029050786,0.00026334263,0.0010939938,0.0028605058,0.0035279037],"genre_scores_gemma":[0.916549,0.00075862923,0.075914204,0.00008899387,0.000029057543,0.00009085753,0.0019406105,0.00065049814,0.0039780787],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998519,0.00033476428,0.000090126276,0.00042233302,0.0005382032,0.00009563828],"domain_scores_gemma":[0.9960419,0.0012756217,0.00042736574,0.001271776,0.0008948019,0.00008861082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027705953,0.0006578085,0.00046768412,0.00088247354,0.00033012536,0.0014552639,0.0011308964,0.0011276375,0.002972868],"category_scores_gemma":[0.0057365745,0.00060822954,0.0005310797,0.00053972856,0.0008436249,0.00061828364,0.0011481565,0.00050315907,0.0017261034],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011798635,0.00022144846,0.008895369,0.00043525582,0.00019433386,0.00016886643,0.00029625904,0.009529941,0.9243346,0.0003703552,0.0006982997,0.05367539],"study_design_scores_gemma":[0.00007633915,0.0013993577,0.058286726,0.00007754398,0.00033434975,0.003737397,0.00032583083,0.08071908,0.85025185,0.00033211376,0.004381361,0.00007795766],"about_ca_topic_score_codex":0.0014349226,"about_ca_topic_score_gemma":0.002139461,"teacher_disagreement_score":0.002972868,"about_ca_system_score_codex":0.00031023315,"about_ca_system_score_gemma":0.00051616697,"threshold_uncertainty_score":0.014652431},"labels":[],"label_agreement":null},{"id":"W54141496","doi":"10.1007/978-3-540-30139-4_4","title":"An Autonomy-Oriented System Design for Enhancement of Learner’s Motivation in E-learning","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Autonomy; Human–computer interaction; E learning; Knowledge management; Mathematics education; Psychology; World Wide Web; The Internet","score_opus":0.05209459233050324,"score_gpt":0.34448115606306023,"score_spread":0.292386563732557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54141496","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.122526206,0.00013687566,0.869625,0.0001436909,0.000085414686,0.00028888116,0.000028916325,0.0014802674,0.0056847795],"genre_scores_gemma":[0.84855956,0.000060734095,0.14675158,0.00006695018,0.000028020117,0.0002943278,0.000034318822,0.000080159145,0.0041243844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962974,0.00013404743,0.000026078485,0.00008848865,0.000086133194,0.000035460213],"domain_scores_gemma":[0.9995359,0.0001979411,0.00003529104,0.000049425376,0.00013816172,0.000043289372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007963755,0.00026255753,0.00025172118,0.00017746654,0.00028897842,0.0006137313,0.0007481969,0.00045137215,0.002787945],"category_scores_gemma":[0.0009499803,0.00016423274,0.00023870802,0.000096224365,0.00024596183,0.0006337829,0.000596927,0.00041234307,0.00038740097],"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.0015741321,0.0013573894,0.0037555413,0.0006344658,0.00014627546,0.0002095289,0.0015250656,0.044257876,0.36594683,0.029710308,0.0032683474,0.54761416],"study_design_scores_gemma":[0.00069357443,0.0037564586,0.008007713,0.00006913502,0.00036786153,0.0004361113,0.00027044077,0.7395599,0.20624924,0.01666156,0.023844874,0.00008324766],"about_ca_topic_score_codex":0.00026211236,"about_ca_topic_score_gemma":0.0003273842,"teacher_disagreement_score":0.002787945,"about_ca_system_score_codex":0.0001937151,"about_ca_system_score_gemma":0.00032938374,"threshold_uncertainty_score":0.009326637},"labels":[],"label_agreement":null},{"id":"W54192826","doi":"10.1007/978-3-642-32584-7_17","title":"A Fast Algorithm for Frequent Itemset Mining Using Patricia* Structures","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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":"Trie; Tree traversal; Prefix; Computer science; Tree (set theory); Interval tree; Data structure; Data mining; Algorithm; Tree structure; Theoretical computer science; Segment tree; Fractal tree index; Node (physics); Search tree; Binary tree; Mathematics; Search algorithm; Combinatorics; Programming language","score_opus":0.033145127694572694,"score_gpt":0.28004621794085094,"score_spread":0.24690109024627824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54192826","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.01610289,0.00068303576,0.9669142,0.00031435816,0.00014280826,0.00037787753,0.0017036775,0.011994376,0.001766756],"genre_scores_gemma":[0.024905639,0.00015081654,0.9696473,0.000083020605,0.000040140403,0.0003068008,0.0032187917,0.00018955569,0.0014579814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988619,0.00018677466,0.00015485995,0.00028150322,0.00040879147,0.000106149644],"domain_scores_gemma":[0.9974717,0.0010074258,0.00014457067,0.0005932113,0.00070504163,0.000078072175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674979,0.0011732063,0.0017233964,0.003736973,0.0017304578,0.0019073935,0.0029762096,0.0013344302,0.00616701],"category_scores_gemma":[0.00635723,0.0013584818,0.0017577668,0.005448355,0.00041769847,0.0031929824,0.0021533843,0.0015713905,0.0058330633],"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.00040597658,0.0002310667,0.0022628047,0.00028594656,0.0001361115,0.00022436798,0.00016577593,0.009404694,0.007690521,0.00778107,0.025388215,0.9460234],"study_design_scores_gemma":[0.00040675834,0.00065161876,0.002810563,0.00013799699,0.00021039699,0.0024141534,0.00026752404,0.8771155,0.023118418,0.049011927,0.04373371,0.00012138836],"about_ca_topic_score_codex":0.002171345,"about_ca_topic_score_gemma":0.0033750918,"teacher_disagreement_score":0.00616701,"about_ca_system_score_codex":0.0005994141,"about_ca_system_score_gemma":0.0020897007,"threshold_uncertainty_score":0.020630777},"labels":[],"label_agreement":null},{"id":"W54448200","doi":"10.1007/978-3-642-21538-4_31","title":"Towards Unified Performance Metrics for Multi-robot Human Interaction Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human-Automation Interaction and Safety","field":"Psychology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robot; Human–computer interaction; Human–robot interaction; Artificial intelligence","score_opus":0.12337204652693895,"score_gpt":0.37877133658688855,"score_spread":0.2553992900599496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54448200","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.00450741,0.0012376537,0.99081355,0.000091754875,0.00008592326,0.0001174864,0.00014076148,0.00077645114,0.0022289294],"genre_scores_gemma":[0.2754884,0.0018203106,0.7145814,0.00015246971,0.000292585,0.0008486108,0.0016716922,0.00077412056,0.004370548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98828775,0.0034104506,0.0014950068,0.0011580004,0.004950341,0.00069837633],"domain_scores_gemma":[0.9865637,0.004280027,0.0012958935,0.0016624223,0.0057559707,0.00044198392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008514008,0.003490113,0.0025798795,0.0042043733,0.0006791157,0.004413894,0.0033464374,0.0017939508,0.0027062537],"category_scores_gemma":[0.023294572,0.0007410732,0.001229492,0.0027102681,0.0012440366,0.0056576496,0.0040203584,0.0027695363,0.0019098222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033806427,0.00031438592,0.003108212,0.0011829787,0.0002586327,0.00009632498,0.0003887424,0.33208397,0.022914927,0.1228712,0.009543055,0.5068995],"study_design_scores_gemma":[0.000018572497,0.0005136089,0.001987253,0.00016510744,0.00007388915,0.00012483982,0.00015081107,0.921264,0.007269378,0.060811784,0.0075474605,0.00007327807],"about_ca_topic_score_codex":0.001699481,"about_ca_topic_score_gemma":0.001443035,"teacher_disagreement_score":0.008514008,"about_ca_system_score_codex":0.0022018736,"about_ca_system_score_gemma":0.0014002855,"threshold_uncertainty_score":0.0450269},"labels":[],"label_agreement":null},{"id":"W54669815","doi":"10.1007/978-3-642-37410-4_9","title":"Block LBP Displacement Based Local Matching Approach for Human Face Recognition","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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 Northern British Columbia","funders":"","keywords":"Local binary patterns; Voting; Majority rule; Computer science; Matching (statistics); Displacement (psychology); Block (permutation group theory); Artificial intelligence; Face (sociological concept); Rigidity (electromagnetism); Facial recognition system; Pattern recognition (psychology); Computer vision; Histogram; Politics; Mathematics; Statistics; Psychology; Political science; Image (mathematics)","score_opus":0.030437263568795617,"score_gpt":0.28353700259425224,"score_spread":0.2530997390254566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54669815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036077023,0.001107886,0.95727396,0.00010201366,0.0001359393,0.000121519246,0.00024316217,0.0014120591,0.0035264078],"genre_scores_gemma":[0.3994345,0.0014739535,0.5770382,0.0002176709,0.00010409603,0.00021286836,0.0010663765,0.0001791828,0.020273183],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998041,0.000022017553,0.000007384782,0.000034468372,0.00010695002,0.0000251599],"domain_scores_gemma":[0.9999044,0.000014789545,0.0000059613044,0.000023313556,0.000045122626,0.0000063524776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020649728,0.00025407667,0.0005146433,0.00058548746,0.00024174139,0.00032156374,0.0007926611,0.0004186474,0.005229975],"category_scores_gemma":[0.00030875517,0.00017992589,0.0003831221,0.0005935195,0.00015764295,0.00038392883,0.00042509747,0.00035609386,0.0020968614],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027978927,0.00013027401,0.00042630432,0.00013992192,0.00003685174,0.00006852798,0.000041607353,0.008637889,0.25607204,0.002468802,0.004828798,0.7268691],"study_design_scores_gemma":[0.00004550375,0.00046051008,0.006635492,0.000028997492,0.00010372129,0.00080012786,0.00009997693,0.79255295,0.18061373,0.003372457,0.015243944,0.000042576554],"about_ca_topic_score_codex":0.00288573,"about_ca_topic_score_gemma":0.0036292733,"teacher_disagreement_score":0.005229975,"about_ca_system_score_codex":0.0002736862,"about_ca_system_score_gemma":0.0004874764,"threshold_uncertainty_score":0.01749605},"labels":[],"label_agreement":null},{"id":"W54721420","doi":"10.1007/978-3-642-33314-9_17","title":"Relation Algebras, Matrices, and Multi-valued Decision Diagrams","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Brock University","funders":"","keywords":"Relation (database); Algebra over a field; Representation (politics); Matrix (chemical analysis); Matrix representation; Relation algebra; Matrix algebra; Computer science; Logical matrix; Theoretical computer science; Pure mathematics; Mathematics; Algebra representation; Data mining; Cellular algebra; Group (periodic table)","score_opus":0.030991108865879934,"score_gpt":0.289139860361894,"score_spread":0.2581487514960141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54721420","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.012922946,0.016367635,0.9024012,0.0019891276,0.00046631208,0.000101276484,0.0005543149,0.00044770376,0.06474945],"genre_scores_gemma":[0.4511088,0.012663182,0.5008286,0.00072795805,0.0009987712,0.0004117464,0.0012290409,0.00021787253,0.031813968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757993,0.0009728268,0.0002340958,0.00042456048,0.0006295921,0.00015892976],"domain_scores_gemma":[0.99757224,0.0014970069,0.00025850706,0.0003159002,0.0002446322,0.00011165822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023514268,0.00094530336,0.0008788506,0.0015368148,0.0012593354,0.0048461244,0.0014378766,0.0011867338,0.0075230813],"category_scores_gemma":[0.0047445986,0.00073587155,0.0013151116,0.0024496978,0.0032680393,0.007179906,0.001495006,0.0029891643,0.00149286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013901173,0.000010842984,0.000049888713,0.000067793146,0.000007283454,0.000023278619,0.000087113156,0.0013670473,0.0002773683,0.98633957,0.0011007609,0.010655142],"study_design_scores_gemma":[0.0000034183122,0.0000049621776,0.000022876118,0.00002083085,0.0000042579413,0.000029278792,0.000017828448,0.0023408306,0.00018067968,0.9912941,0.006075542,0.000005421184],"about_ca_topic_score_codex":0.0012109119,"about_ca_topic_score_gemma":0.0015463769,"teacher_disagreement_score":0.0075230813,"about_ca_system_score_codex":0.0018288603,"about_ca_system_score_gemma":0.0010420767,"threshold_uncertainty_score":0.025167227},"labels":[],"label_agreement":null},{"id":"W54772941","doi":"10.1007/978-3-642-38457-8_6","title":"Identifying Explicit Discourse Connectives in Text","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Treebank; Computer science; Parsing; Natural language processing; Artificial intelligence; Syntax; Coherence (philosophical gambling strategy); Head (geology); Linguistics; Mathematics","score_opus":0.023970655486770534,"score_gpt":0.2931898755067489,"score_spread":0.2692192200199784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54772941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2745983,0.005198806,0.6462583,0.005611491,0.0010898765,0.00070636126,0.011817166,0.00533897,0.04938071],"genre_scores_gemma":[0.6840438,0.0019426398,0.2862128,0.00038706142,0.0005400263,0.00044711682,0.0145614585,0.0007762213,0.011088861],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580765,0.0017863194,0.0004686678,0.0009055074,0.0008322405,0.00019956389],"domain_scores_gemma":[0.9740968,0.021776583,0.0010249089,0.000641735,0.0021550264,0.00030504874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030768102,0.001267641,0.0006691253,0.0061820936,0.0018228021,0.004425102,0.0012322278,0.0013145474,0.011387554],"category_scores_gemma":[0.019845942,0.00074375956,0.0006213801,0.0041015455,0.0015775679,0.011413856,0.0045522857,0.0018437491,0.0036054286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001308113,0.00033252462,0.013765291,0.004380372,0.00019174826,0.0041437442,0.031742357,0.0041794055,0.062282566,0.25346017,0.034726676,0.58948714],"study_design_scores_gemma":[0.00021405265,0.00030132764,0.009087578,0.0030343635,0.00075011497,0.0030595555,0.029057888,0.16690248,0.10239558,0.43910897,0.24585956,0.00022850308],"about_ca_topic_score_codex":0.0011358833,"about_ca_topic_score_gemma":0.0014694765,"teacher_disagreement_score":0.011387554,"about_ca_system_score_codex":0.0010791976,"about_ca_system_score_gemma":0.0014524795,"threshold_uncertainty_score":0.038095176},"labels":[],"label_agreement":null},{"id":"W54874128","doi":"10.1007/978-3-642-35476-2_9","title":"Tree Exploration by a Swarm of Mobile Agents","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"","keywords":"Swarm behaviour; Overhead (engineering); Tree (set theory); Node (physics); Computer science; Range (aeronautics); Mathematical optimization; K-ary tree; Algorithm; Path (computing); Tree structure; Topology (electrical circuits); Mathematics; Combinatorics; Artificial intelligence; Computer network; Binary tree; Engineering","score_opus":0.034696201713548855,"score_gpt":0.2732626250365877,"score_spread":0.23856642332303885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54874128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31002462,0.0010562968,0.67457867,0.00068504707,0.00017826962,0.00008358133,0.00008524244,0.00043550762,0.012872802],"genre_scores_gemma":[0.87161964,0.0004146455,0.118336,0.000109850014,0.000073144554,0.000103657716,0.000104959254,0.00007466115,0.009163422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998635,0.00003944741,0.0000068316717,0.000030810457,0.00003340389,0.000026080803],"domain_scores_gemma":[0.9994178,0.00033849687,0.000050720133,0.00004918998,0.0000601319,0.000083674895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748569,0.00037323232,0.00083891896,0.0005000031,0.0006945139,0.00094274036,0.0009376201,0.0013952139,0.0023530067],"category_scores_gemma":[0.0015413131,0.00038471707,0.00061690656,0.00066745724,0.0006269938,0.001269761,0.0011226882,0.0006046993,0.00035543254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043060828,0.0001196444,0.0019923842,0.0001888036,0.00015546966,0.00051985774,0.0005332713,0.86619765,0.01991051,0.035214074,0.0030708706,0.07166693],"study_design_scores_gemma":[0.000029947014,0.000078218254,0.00015120463,0.000009046461,0.000015296662,0.00006194599,0.000042616084,0.98910356,0.0006863028,0.008745555,0.0010689521,0.000007340511],"about_ca_topic_score_codex":0.0012198357,"about_ca_topic_score_gemma":0.0011393472,"teacher_disagreement_score":0.0023530067,"about_ca_system_score_codex":0.0003017405,"about_ca_system_score_gemma":0.00034047654,"threshold_uncertainty_score":0.007871628},"labels":[],"label_agreement":null},{"id":"W54985407","doi":"10.1007/978-3-642-41914-0_4","title":"Fully Automated Brain Tumor Segmentation Using Two MRI Modalities","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Segmentation; Computer science; Thresholding; Histogram; Artificial intelligence; Sørensen–Dice coefficient; Magnetic resonance imaging; Volume (thermodynamics); Image segmentation; Computer vision; Pattern recognition (psychology); Image (mathematics); Radiology; Medicine","score_opus":0.02160179779354516,"score_gpt":0.29901388069525586,"score_spread":0.2774120829017107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54985407","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.020864489,0.0029329709,0.96627676,0.0003004813,0.00015067004,0.00009585659,0.000770316,0.003447778,0.005160813],"genre_scores_gemma":[0.15757722,0.0024495856,0.8248385,0.0003573908,0.00029694932,0.00015679214,0.0019058561,0.0012989722,0.011118653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996635,0.000033860364,0.000024472069,0.000090132045,0.00014143823,0.000046606827],"domain_scores_gemma":[0.9995396,0.00015595599,0.00004559488,0.00011870684,0.000119675075,0.000020483854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005270806,0.0011440471,0.00093611283,0.0015271781,0.00030921504,0.0017165003,0.0010424247,0.0020775434,0.0042120903],"category_scores_gemma":[0.0011337363,0.0009654638,0.0010513169,0.0011886135,0.00036454157,0.001545036,0.0012015542,0.00072400627,0.0029991872],"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.00040687932,0.00008960778,0.0011467758,0.00066605146,0.00021392146,0.0006899256,0.00013630628,0.017523373,0.2919046,0.0035636176,0.009349148,0.67430973],"study_design_scores_gemma":[0.00007096695,0.00033191624,0.010823976,0.00034146977,0.0005090909,0.01541747,0.0001782653,0.5090674,0.37782812,0.024373366,0.06082731,0.00023066824],"about_ca_topic_score_codex":0.0011246782,"about_ca_topic_score_gemma":0.002860382,"teacher_disagreement_score":0.0042120903,"about_ca_system_score_codex":0.00023650736,"about_ca_system_score_gemma":0.0007203532,"threshold_uncertainty_score":0.014090836},"labels":[],"label_agreement":null},{"id":"W5534414","doi":"10.1007/978-3-642-21527-8_46","title":"An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Computer science; Heuristic; Snow removal; Set (abstract data type); Routing (electronic design automation); Arc routing; Snow; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.022629902807734154,"score_gpt":0.25866538093853747,"score_spread":0.2360354781308033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5534414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07022777,0.0006050552,0.92084855,0.00024152415,0.00016422504,0.00033475333,0.00016453637,0.00049698714,0.0069165435],"genre_scores_gemma":[0.50574017,0.00027657722,0.48684585,0.00013452182,0.00008109048,0.0004809085,0.00034485434,0.00020245014,0.0058935205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961483,0.00013237704,0.000019084875,0.00008532708,0.000082484294,0.00006588852],"domain_scores_gemma":[0.9990539,0.00062317954,0.00008857129,0.000058175443,0.00008601086,0.000090152374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010047978,0.0010393952,0.0019777825,0.001113663,0.0007894205,0.00089545606,0.0029613557,0.0019591723,0.005246822],"category_scores_gemma":[0.0021877373,0.00086803763,0.0010093879,0.0012712423,0.00073655136,0.0015786489,0.0012933576,0.0009535127,0.00039455024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012656396,0.00008716593,0.00020763546,0.00005779338,0.00002797025,0.000054316977,0.000034544813,0.96901816,0.0008075631,0.0037611625,0.0011524517,0.02466466],"study_design_scores_gemma":[0.000023889013,0.000031420477,0.00003423053,0.0000040244568,0.0000061548026,0.000006637106,0.000009163907,0.99844474,0.00009788294,0.001112547,0.00022604843,0.0000031777558],"about_ca_topic_score_codex":0.008445863,"about_ca_topic_score_gemma":0.008817961,"teacher_disagreement_score":0.008445863,"about_ca_system_score_codex":0.0010700199,"about_ca_system_score_gemma":0.0013501066,"threshold_uncertainty_score":0.017552376},"labels":[],"label_agreement":null},{"id":"W55356184","doi":"10.1007/978-3-642-45008-2_9","title":"Computational Modelling of the Interruptional Activities between Transposable Elements","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chromosomal and Genetic Variations","field":"Agricultural and Biological Sciences","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 Saskatchewan","funders":"","keywords":"Computer science; Transposable element; Parsing; Context (archaeology); Genome; Context-free grammar; Grammar; Tree (set theory); Formal grammar; Rewriting; Theoretical computer science; Artificial intelligence; Programming language; Rule-based machine translation; Biology; Genetics","score_opus":0.03821007600379099,"score_gpt":0.22731903440565107,"score_spread":0.1891089584018601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55356184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14482,0.0011462154,0.8242024,0.0006647313,0.00019310923,0.000056806457,0.0006848544,0.00066349754,0.027568275],"genre_scores_gemma":[0.8686963,0.0009759988,0.111631446,0.00010717006,0.00010125033,0.00019983487,0.0007973622,0.00026950848,0.017221192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.00005794925,0.00001257493,0.000047458692,0.00005654562,0.000041390656],"domain_scores_gemma":[0.99826616,0.0014118444,0.00008803124,0.00008029934,0.000084512,0.0000692079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000488629,0.0005777635,0.0009246864,0.00041286068,0.00043391992,0.0014586715,0.0025189428,0.0017300682,0.006092109],"category_scores_gemma":[0.0028486538,0.0006964198,0.0011461333,0.0006742994,0.00089130254,0.0013352063,0.00082817354,0.0013303359,0.00073076587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033549997,0.000019680507,0.0002682719,0.000036089245,0.000013569949,0.000071927985,0.00004034644,0.9735246,0.00068492565,0.021461835,0.00028750676,0.0035578166],"study_design_scores_gemma":[0.0000040972786,0.0000043991727,0.000034408717,0.000002102852,0.0000031461875,0.000011318582,0.0000062959252,0.9907845,0.00016750138,0.008713831,0.0002658936,0.0000025114614],"about_ca_topic_score_codex":0.007343476,"about_ca_topic_score_gemma":0.005353136,"teacher_disagreement_score":0.007343476,"about_ca_system_score_codex":0.000607266,"about_ca_system_score_gemma":0.000843252,"threshold_uncertainty_score":0.02038008},"labels":[],"label_agreement":null},{"id":"W55865379","doi":"10.1007/978-3-642-24425-4_16","title":"Partitions, Coverings, Reducts and Rule Learning in Rough Set Theory","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Rough set; Decision table; Computer science; Equivalence (formal languages); Table (database); Reduct; Equivalence relation; Data mining; Set (abstract data type); Artificial intelligence; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.022638141536223698,"score_gpt":0.23249563047276692,"score_spread":0.2098574889365432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55865379","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.048487816,0.095168404,0.8193266,0.0029599196,0.001319608,0.00009174927,0.00022257352,0.00016499094,0.03225834],"genre_scores_gemma":[0.56272507,0.034571175,0.385995,0.0005810063,0.0026357265,0.00033027038,0.00055631786,0.000096772616,0.012508662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775344,0.0009531602,0.00020670635,0.00028286135,0.00071000407,0.00009391922],"domain_scores_gemma":[0.9977487,0.001684997,0.00012566749,0.00024127112,0.00015329779,0.000046011843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025497153,0.00076277566,0.0015913245,0.0017834379,0.0009835267,0.0035824245,0.0010693275,0.0010438965,0.0012654286],"category_scores_gemma":[0.006726977,0.0009335548,0.0015412149,0.003525299,0.0047019054,0.006383359,0.0014689147,0.00326542,0.00027178435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003418316,0.000027154398,0.0003149943,0.00040652356,0.00007275604,0.00010082216,0.00070278667,0.01939167,0.00051818753,0.918231,0.0030895332,0.057110287],"study_design_scores_gemma":[0.000003990581,0.000012984916,0.00015999764,0.000029380495,0.000016315977,0.000056058605,0.000051604566,0.009976121,0.00008489983,0.98653525,0.003063862,0.00000958438],"about_ca_topic_score_codex":0.001205201,"about_ca_topic_score_gemma":0.0011566845,"teacher_disagreement_score":0.0035824245,"about_ca_system_score_codex":0.0012263376,"about_ca_system_score_gemma":0.0006039963,"threshold_uncertainty_score":0.013484359},"labels":[],"label_agreement":null},{"id":"W56224721","doi":"10.1007/978-3-642-39094-4_30","title":"SRAD with Weighted Diffusion Function","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Anisotropic diffusion; Speckle pattern; Diffusion; Computer science; Function (biology); Enhanced Data Rates for GSM Evolution; Computer vision; Artificial intelligence; Speckle noise; Image (mathematics); Physics","score_opus":0.013618251575697321,"score_gpt":0.2313651829120202,"score_spread":0.2177469313363229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56224721","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.0024551314,0.00080676156,0.98704123,0.00014856434,0.00020826266,0.000018225126,0.00006996846,0.00060947286,0.0086423345],"genre_scores_gemma":[0.07577642,0.0019479747,0.87488544,0.0002169355,0.00031610305,0.00007205592,0.00045935498,0.0008116584,0.04551409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.000058903475,0.00001670943,0.00005829367,0.00010103848,0.000016543938],"domain_scores_gemma":[0.9996929,0.00007080991,0.000026595533,0.00008733998,0.00010304894,0.000019285344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006193798,0.0007200982,0.00083071325,0.00093666016,0.00028943946,0.0010731259,0.0007821356,0.00086087117,0.008741789],"category_scores_gemma":[0.001177423,0.00030329477,0.00063077704,0.00083318393,0.00055004796,0.0013858771,0.0011092948,0.0013165742,0.0055555543],"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.00012796976,0.000048990154,0.0001839367,0.00041347925,0.000051712792,0.00014958956,0.00010255482,0.037995495,0.03078885,0.3936398,0.018897392,0.5176002],"study_design_scores_gemma":[0.00003091209,0.00010624872,0.0002471758,0.00007123535,0.00004602424,0.00089718914,0.000044916906,0.66673034,0.028079119,0.19559044,0.108106345,0.000050061906],"about_ca_topic_score_codex":0.00052224053,"about_ca_topic_score_gemma":0.0006325726,"teacher_disagreement_score":0.008741789,"about_ca_system_score_codex":0.000297193,"about_ca_system_score_gemma":0.00039692392,"threshold_uncertainty_score":0.029244244},"labels":[],"label_agreement":null},{"id":"W56465581","doi":"10.1007/978-3-662-43826-8_15","title":"Early DDoS Detection Based on Data Mining Techniques","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Denial-of-service attack; Computer science; Application layer DDoS attack; Computer security; Trinoo; The Internet; Data mining; Network administrator; Computer network; World Wide Web","score_opus":0.02266914965405874,"score_gpt":0.2464891091567531,"score_spread":0.22381995950269434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56465581","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.10224334,0.005832863,0.87598914,0.0008594331,0.0003660017,0.00085563265,0.0029012614,0.0041927285,0.006759629],"genre_scores_gemma":[0.35976115,0.004269711,0.62684256,0.00028483247,0.000192989,0.0005748602,0.0038440102,0.00013303124,0.004096834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982457,0.00020902036,0.00033918323,0.00041867726,0.00068302784,0.00010434033],"domain_scores_gemma":[0.99571556,0.0020649978,0.000561167,0.000320962,0.0012475599,0.000089761204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017512894,0.001308769,0.0014995142,0.0057685324,0.00061681285,0.0018250984,0.001641998,0.0011471173,0.0011065229],"category_scores_gemma":[0.004972946,0.00042454817,0.0013294423,0.0038821802,0.00031910808,0.0020098898,0.0006573848,0.0011134774,0.0012996725],"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.00049868174,0.00076822145,0.027385825,0.0011879975,0.00028578448,0.00088275474,0.0003471023,0.024069443,0.026593193,0.0038055154,0.0065095657,0.90766585],"study_design_scores_gemma":[0.00009628271,0.0007488404,0.026606701,0.0005961335,0.00037474654,0.0042397156,0.0007277601,0.8019025,0.1054585,0.01806557,0.040990986,0.00019230436],"about_ca_topic_score_codex":0.0011090561,"about_ca_topic_score_gemma":0.0010223644,"teacher_disagreement_score":0.0057685324,"about_ca_system_score_codex":0.00044285212,"about_ca_system_score_gemma":0.000808995,"threshold_uncertainty_score":0.009261787},"labels":[],"label_agreement":null},{"id":"W56552273","doi":"10.1007/978-3-540-39451-8_8","title":"Optimality Theory through Default Logic","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Western University","funders":"","keywords":"Default logic; Computer science; Artificial intelligence; Autoepistemic logic; Multimodal logic; Description logic","score_opus":0.021874402639700145,"score_gpt":0.2745501081635801,"score_spread":0.25267570552387997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56552273","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.026289782,0.004644459,0.6897546,0.015197318,0.0006773214,0.000066563705,0.000588623,0.0005732544,0.262208],"genre_scores_gemma":[0.8067766,0.0030228882,0.15016669,0.0019823422,0.0014438512,0.000176876,0.00090915733,0.00047086936,0.03505074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972696,0.0010128972,0.00017377002,0.00061842013,0.0006526753,0.00027263266],"domain_scores_gemma":[0.99664706,0.0020401536,0.00018033214,0.00052353326,0.00045969087,0.00014924473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003615867,0.00079537666,0.0014888658,0.0021670815,0.001947591,0.005339233,0.0020289836,0.0020975033,0.014383815],"category_scores_gemma":[0.0076907217,0.000979186,0.0015962023,0.0015276137,0.0066092634,0.015700584,0.0033321164,0.005412886,0.0016331372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008384866,0.0000049984164,0.000032503005,0.000012464566,0.000004854556,0.000009337514,0.000031879903,0.0004184183,0.000033858203,0.9965413,0.00076017994,0.0021418028],"study_design_scores_gemma":[0.0000034757177,0.0000010242816,0.000013744789,0.0000042418224,0.0000024114747,0.0000053009335,0.0000051094657,0.0009685403,0.000023750565,0.99805284,0.0009177913,0.0000016424548],"about_ca_topic_score_codex":0.0025770406,"about_ca_topic_score_gemma":0.0029036314,"teacher_disagreement_score":0.014383815,"about_ca_system_score_codex":0.0040199403,"about_ca_system_score_gemma":0.0016424224,"threshold_uncertainty_score":0.04811865},"labels":[],"label_agreement":null},{"id":"W56705335","doi":"10.1007/3-540-47922-8_34","title":"Supporting the Needs of Mobile Home Care Workers: A Case Study for Saskatoon District Health System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Schedule; Presentation (obstetrics); Context (archaeology); Plan (archaeology); Mobile device; Architecture; Health care; Information system; Knowledge management; World Wide Web; Medicine","score_opus":0.03192134223443572,"score_gpt":0.29212924607417323,"score_spread":0.2602079038397375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56705335","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.9959687,0.00009704431,0.00021865353,0.0006312804,0.0000091468055,0.0001218177,0.00007562858,0.0000056873155,0.0028720708],"genre_scores_gemma":[0.9950281,0.00039221704,0.0010144712,0.00040758378,0.0000061725996,0.00008982197,0.00004945241,0.000006840895,0.0030053388],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99861205,0.00064290076,0.00003967577,0.000059627386,0.00010276498,0.0005430852],"domain_scores_gemma":[0.99815434,0.00090146693,0.00013695633,0.00005227393,0.00022014676,0.0005348257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013215559,0.0006558567,0.00040769204,0.0010092787,0.009626134,0.0019628438,0.0018046999,0.0029293462,0.0031582862],"category_scores_gemma":[0.0024694884,0.0005659018,0.00037445044,0.0018855365,0.0017683426,0.0010852318,0.0026507652,0.0017273758,0.00032963598],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000604798,0.0051549245,0.17226417,0.000864358,0.00012574132,0.1476508,0.60857916,0.0026678846,0.0079770135,0.003721837,0.0063362345,0.044053115],"study_design_scores_gemma":[0.00005870085,0.00083471125,0.032424,0.00011523008,0.000047118905,0.0037337595,0.9561224,0.00092784397,0.00076437596,0.00023988177,0.0047005913,0.00003133332],"about_ca_topic_score_codex":0.25411516,"about_ca_topic_score_gemma":0.6528909,"teacher_disagreement_score":0.74588484,"about_ca_system_score_codex":0.0071311863,"about_ca_system_score_gemma":0.0079317065,"threshold_uncertainty_score":0.5052721},"labels":[],"label_agreement":null},{"id":"W56996347","doi":"10.1007/978-3-540-70500-0_5","title":"Comparing the Pre- and Post-specified Peer Models for Key Agreement","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Executable; Identifier; Key (lock); Protocol (science); Computer security; Theoretical computer science; Computer security model; Peer-to-peer; Class (philosophy); Distributed computing; Computer network; Programming language; Artificial intelligence","score_opus":0.04407501408298738,"score_gpt":0.2826082142022965,"score_spread":0.23853320011930912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56996347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1320693,0.0014677822,0.83209085,0.0022246696,0.00038198734,0.00042586183,0.0003574028,0.00083956716,0.030142596],"genre_scores_gemma":[0.91590196,0.0010203635,0.07194949,0.0002208019,0.00021065127,0.00034295113,0.00034061034,0.00032472805,0.009688397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895203,0.0050498694,0.00045970752,0.0005996511,0.003316751,0.0010536643],"domain_scores_gemma":[0.94175124,0.041930486,0.0014062722,0.010065526,0.004074309,0.0007721876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012584942,0.0005521931,0.0011905772,0.0008491388,0.0014352526,0.0044292565,0.0039094756,0.0025648358,0.009090481],"category_scores_gemma":[0.04294424,0.00058353035,0.001263877,0.0010334674,0.0024370074,0.015072961,0.002617361,0.0032630712,0.0017192422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002077605,0.00030675816,0.0010412112,0.00025805552,0.0000829714,0.0000926541,0.0008573129,0.14610587,0.0027602443,0.78927016,0.00490363,0.052243542],"study_design_scores_gemma":[0.00016621155,0.00035664462,0.0003419357,0.000057594716,0.00008656964,0.000084921725,0.0003206664,0.6386681,0.0022562207,0.35386738,0.0037311504,0.000062699626],"about_ca_topic_score_codex":0.0023901851,"about_ca_topic_score_gemma":0.0027642287,"teacher_disagreement_score":0.012584942,"about_ca_system_score_codex":0.0033353912,"about_ca_system_score_gemma":0.0038569407,"threshold_uncertainty_score":0.066556334},"labels":[],"label_agreement":null},{"id":"W5713621","doi":"10.1007/bfb0035863","title":"Darwin: Computer algebra and enumerative combinatorics","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"","keywords":"Enumerative combinatorics; Darwin (ADL); Extremal combinatorics; Combinatorics; Algebra over a field; Mathematics; Algebraic combinatorics; Computer science; Pure mathematics","score_opus":0.008530677949465895,"score_gpt":0.21402830139210896,"score_spread":0.20549762344264305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5713621","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.026095686,0.038604658,0.47181997,0.01095343,0.0027424307,0.000080876176,0.0006933653,0.0016014194,0.44740808],"genre_scores_gemma":[0.4648328,0.034495194,0.1559511,0.0020441809,0.005894319,0.00031609304,0.0011710728,0.0010806186,0.3342146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997743,0.00006006432,0.000013378334,0.00004331105,0.00009190301,0.000017171553],"domain_scores_gemma":[0.99962246,0.00021735407,0.000021479958,0.00006309525,0.00005030838,0.000025370015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003541359,0.00051680085,0.0005702505,0.001062227,0.0007573813,0.0024183115,0.00074548495,0.0007669076,0.009520516],"category_scores_gemma":[0.0012756548,0.00034968936,0.00047139404,0.0020284797,0.0020405604,0.006087337,0.0011192573,0.0018555288,0.0021169027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005593798,0.000006564694,0.0001068149,0.0000799999,0.000005918853,0.000030176434,0.000126683,0.0008676871,0.00030098646,0.9477087,0.011181544,0.039579343],"study_design_scores_gemma":[0.0000019810977,0.0000029777204,0.00009205398,0.00002039394,0.0000034005434,0.000089799614,0.000021463336,0.001628777,0.00024240738,0.9407609,0.057130594,0.00000516694],"about_ca_topic_score_codex":0.0005135542,"about_ca_topic_score_gemma":0.00061547686,"teacher_disagreement_score":0.009520516,"about_ca_system_score_codex":0.0011364601,"about_ca_system_score_gemma":0.0005041516,"threshold_uncertainty_score":0.031849265},"labels":[],"label_agreement":null},{"id":"W57230347","doi":"10.1007/978-3-642-23765-2_24","title":"“Oh Snap” – Helping Users Align Digital Objects on Touch Interfaces","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Networks of Centres of Excellence of Canada; Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Snap; Computer science; Translation (biology); Gesture; Rotation (mathematics); Text entry; Jump; Human–computer interaction; Computer vision; Computer graphics (images); Physics","score_opus":0.02177839847595542,"score_gpt":0.24603009355131175,"score_spread":0.22425169507535633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57230347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09704412,0.0026755084,0.7275624,0.0009350878,0.00082753773,0.00049760175,0.00047123403,0.03621349,0.13377295],"genre_scores_gemma":[0.31492472,0.00287287,0.4885869,0.0010811572,0.0002451434,0.00079049944,0.00158928,0.003037142,0.18687229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.000054569544,0.0000132500845,0.00006069053,0.00011468223,0.000039361836],"domain_scores_gemma":[0.99968576,0.00012377724,0.00001511019,0.000057100795,0.00007116442,0.00004712557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038815767,0.0013776991,0.00043671974,0.0004814,0.00055752817,0.0010612726,0.0016534352,0.0012313061,0.025384981],"category_scores_gemma":[0.0013147533,0.00040591302,0.00041056355,0.00037870053,0.00062119326,0.0024181043,0.0027966457,0.0007763522,0.0072875763],"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.000322431,0.0002000404,0.00089009927,0.00072659185,0.00003670763,0.0004552577,0.0041893157,0.0009641464,0.109043464,0.005837472,0.04734768,0.82998675],"study_design_scores_gemma":[0.00018718437,0.0017732413,0.014705403,0.0007476188,0.00025059577,0.006157948,0.008646148,0.04086578,0.18414909,0.032170095,0.7100276,0.00031931387],"about_ca_topic_score_codex":0.0007344371,"about_ca_topic_score_gemma":0.0016384629,"teacher_disagreement_score":0.025384981,"about_ca_system_score_codex":0.00012950013,"about_ca_system_score_gemma":0.00032538586,"threshold_uncertainty_score":0.08492124},"labels":[],"label_agreement":null},{"id":"W574622532","doi":"10.1007/978-3-319-13692-9_7","title":"Metastatic Liver Tumor Segmentation Using Texture-Based Omni-Directional Deformable Surface Models","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":33,"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":"Artificial intelligence; Computer science; Voxel; Segmentation; Pattern recognition (psychology); Image segmentation; Support vector machine; Computer vision","score_opus":0.024964991671873275,"score_gpt":0.2812976091360035,"score_spread":0.2563326174641302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W574622532","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.023755787,0.00061229826,0.9720266,0.00016975477,0.000043304088,0.000049314567,0.00026459762,0.00097015523,0.0021083113],"genre_scores_gemma":[0.41826403,0.0022812902,0.56963235,0.0002159424,0.0000830584,0.00011661028,0.0015521992,0.00088705024,0.0069675064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998424,0.000012782147,0.000009281498,0.000031827916,0.00008539511,0.000018271048],"domain_scores_gemma":[0.9998559,0.000046147554,0.000020047122,0.000025842277,0.000041631083,0.00001048062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028911428,0.00051917345,0.00062269054,0.00083107036,0.00012869602,0.0010848633,0.00075582607,0.00074540614,0.00093513366],"category_scores_gemma":[0.00061543845,0.00050173374,0.0010835273,0.000918608,0.00024508097,0.0005395056,0.00057884987,0.00054627174,0.00071606075],"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.00019859758,0.000072753865,0.0019816074,0.0002553989,0.00010856382,0.00032528004,0.00011798176,0.3898411,0.08673141,0.0044397055,0.0045729377,0.5113547],"study_design_scores_gemma":[0.0000049611895,0.00001876495,0.000653844,0.0000132098685,0.000018951918,0.00027136382,0.000013070046,0.9878732,0.0077827675,0.0014903179,0.0018458925,0.000013636866],"about_ca_topic_score_codex":0.002344022,"about_ca_topic_score_gemma":0.0042876275,"teacher_disagreement_score":0.002344022,"about_ca_system_score_codex":0.00032016487,"about_ca_system_score_gemma":0.00046412452,"threshold_uncertainty_score":0.0046607256},"labels":[],"label_agreement":null},{"id":"W5766521","doi":"10.1007/978-3-642-23771-3_31","title":"e-Rural: A Framework to Generate Hyperdocuments for Milk Producers with Different Levels of Literacy to Promote Better Quality Milking","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Learning and Knowledge Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Literacy; Computer science; Quality (philosophy); Production (economics); Population; Milking; Agricultural science; Pedagogy; Sociology; Geography; Economics; Biology","score_opus":0.03575364879928548,"score_gpt":0.2957988712983656,"score_spread":0.2600452224990801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5766521","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.014585902,0.00026193648,0.843744,0.00042815963,0.00009691928,0.0008048753,0.0047433353,0.12578489,0.009550057],"genre_scores_gemma":[0.07578578,0.0004124642,0.8786454,0.00030094435,0.00005558876,0.001133943,0.016677916,0.008781548,0.01820646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999411,0.00020826986,0.00006352084,0.00012762024,0.00014908498,0.00004064632],"domain_scores_gemma":[0.99767655,0.0014053099,0.00012937415,0.0002642043,0.00033633743,0.0001881665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001801016,0.001368383,0.00056138803,0.002075169,0.0006008576,0.001969581,0.0019278866,0.001609958,0.02115668],"category_scores_gemma":[0.0057037757,0.0005912897,0.0009595896,0.0009835974,0.0004778281,0.0031673019,0.0028175456,0.0010904382,0.006252042],"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.001802602,0.0015732255,0.0053454074,0.0022025427,0.00019683088,0.0011128112,0.0036032794,0.019580428,0.04568471,0.02891964,0.12896661,0.76101196],"study_design_scores_gemma":[0.0009419245,0.0009478638,0.0056479424,0.0005341704,0.00028355324,0.0016607107,0.0016368546,0.3483875,0.091526285,0.053257406,0.49481136,0.00036450752],"about_ca_topic_score_codex":0.0019160523,"about_ca_topic_score_gemma":0.0036991655,"teacher_disagreement_score":0.02115668,"about_ca_system_score_codex":0.0005279809,"about_ca_system_score_gemma":0.0006621286,"threshold_uncertainty_score":0.070776105},"labels":[],"label_agreement":null},{"id":"W577877354","doi":"10.1007/978-3-319-10404-1_48","title":"TRIC: Trust Region for Invariant Compactness and Its Application to Abdominal Aorta Segmentation","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"St Joseph's Health Care; Simon Fraser University; McGill University; CARE Canada","funders":"","keywords":"Compact space; Segmentation; Computer science; Invariant (physics); Image segmentation; Graph; Constraint (computer-aided design); Term (time); Algorithm; Artificial intelligence; Mathematical optimization; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.018258798988364026,"score_gpt":0.30158890660950494,"score_spread":0.2833301076211409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W577877354","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.0048343833,0.0001880649,0.9936579,0.000055669447,0.000028333881,0.000031517735,0.000082187136,0.00069783727,0.00042413044],"genre_scores_gemma":[0.1912508,0.0006445271,0.80291116,0.0000870681,0.0001625037,0.00018067945,0.0005544893,0.0012480872,0.0029607022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983713,0.00052598794,0.00013604663,0.00025249118,0.00061544735,0.000098737044],"domain_scores_gemma":[0.99365133,0.0030727647,0.0006817671,0.0009394211,0.0013978871,0.00025685356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027930203,0.00091515767,0.0013917144,0.0020921633,0.0003923693,0.0018975893,0.001641168,0.0014413409,0.0033159794],"category_scores_gemma":[0.014782184,0.00068158767,0.0011657926,0.0020984595,0.0011540629,0.0019718374,0.0021051443,0.0015605526,0.0013828955],"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.001196488,0.00018005293,0.00206678,0.00082989276,0.00023894118,0.0004222156,0.00032317918,0.20308645,0.052555535,0.06069257,0.009534346,0.66887355],"study_design_scores_gemma":[0.000017235163,0.00016975024,0.0005495831,0.000019911378,0.000034353907,0.0002416833,0.000028869497,0.9760552,0.0124540515,0.007227969,0.0031749227,0.00002653166],"about_ca_topic_score_codex":0.0020684612,"about_ca_topic_score_gemma":0.0013028578,"teacher_disagreement_score":0.0033159794,"about_ca_system_score_codex":0.0007539191,"about_ca_system_score_gemma":0.0010635807,"threshold_uncertainty_score":0.014771044},"labels":[],"label_agreement":null},{"id":"W578099889","doi":"10.1007/978-3-319-27261-0_8","title":"Genus, Treewidth, and Local Crossing Number","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; 1-planar graph; Partial k-tree; Planar graph; Clique-sum; Vertex (graph theory); Crossing number (knot theory); Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Chordal graph; Line graph; Cartography","score_opus":0.03260231898459536,"score_gpt":0.3087347453853231,"score_spread":0.2761324264007277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W578099889","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.6129617,0.025422545,0.25304782,0.0020052737,0.00029853015,0.000046986817,0.00056342175,0.001100777,0.10455303],"genre_scores_gemma":[0.945169,0.010177272,0.035652205,0.00020531997,0.00035346864,0.000053318934,0.00042557286,0.00039152923,0.0075724497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948716,0.000059685677,0.00001924199,0.00019388628,0.00015214014,0.00008788869],"domain_scores_gemma":[0.9969709,0.0017937816,0.0004763267,0.000363733,0.00015528912,0.0002398671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051072356,0.000881528,0.00054986664,0.0015709387,0.00065425376,0.0021284653,0.0012595346,0.00085137377,0.0037955842],"category_scores_gemma":[0.0050725522,0.0005549788,0.0006656068,0.002058529,0.0016059498,0.006157058,0.0017756822,0.0018859843,0.0007099048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033863346,0.00013884857,0.014926134,0.0009002525,0.00018554476,0.0009879271,0.0010829695,0.122781344,0.051194206,0.5923314,0.009018754,0.20611398],"study_design_scores_gemma":[0.00002120846,0.00021896565,0.014816855,0.00025536644,0.00023686083,0.0025793458,0.00046560387,0.16090022,0.018436972,0.77886915,0.023102725,0.00009666963],"about_ca_topic_score_codex":0.000782426,"about_ca_topic_score_gemma":0.0009783263,"teacher_disagreement_score":0.0037955842,"about_ca_system_score_codex":0.0009868578,"about_ca_system_score_gemma":0.00023560169,"threshold_uncertainty_score":0.012697518},"labels":[],"label_agreement":null},{"id":"W57814663","doi":"10.1007/3-540-36618-0_24","title":"Combining Naive Bayes and n-Gram Language Models for Text Classification","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":170,"is_retracted":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":"Naive Bayes classifier; Computer science; Artificial intelligence; Machine learning; Bayes error rate; Bayesian programming; Bayes' theorem; n-gram; Smoothing; Conditional independence; Inference; Bayes classifier; Bayes factor; Language model; Bayesian probability; Support vector machine","score_opus":0.03324207233675179,"score_gpt":0.26568466222777093,"score_spread":0.23244258989101912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57814663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01138954,0.00264891,0.97767305,0.00064806367,0.0005076487,0.0002083241,0.0006260628,0.004469686,0.0018286179],"genre_scores_gemma":[0.19662988,0.0027266976,0.7854684,0.00085179886,0.0016013584,0.0005247526,0.0040879794,0.0006410909,0.007468045],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99320847,0.0031070928,0.0005814174,0.0011405464,0.0016585446,0.0003039197],"domain_scores_gemma":[0.98703057,0.009381073,0.0003173358,0.0008626188,0.0021602719,0.00024810672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079470305,0.0022606526,0.003344682,0.0049699214,0.0018727677,0.0032679213,0.0026519015,0.0024028965,0.0036318863],"category_scores_gemma":[0.018329363,0.0010915634,0.0024659622,0.0043020155,0.0007997833,0.007657116,0.0016420323,0.003156049,0.006397765],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065618946,0.00050292193,0.0026445203,0.00046331406,0.00040703025,0.00014906185,0.00019159408,0.028592508,0.006200324,0.0053376346,0.02014458,0.93471026],"study_design_scores_gemma":[0.0000660967,0.000111620175,0.0007435347,0.000085208594,0.00025867074,0.0001948767,0.00009106134,0.9457187,0.0041423845,0.044580825,0.0039360244,0.00007100831],"about_ca_topic_score_codex":0.010003686,"about_ca_topic_score_gemma":0.017693343,"teacher_disagreement_score":0.010003686,"about_ca_system_score_codex":0.0011092161,"about_ca_system_score_gemma":0.0023305514,"threshold_uncertainty_score":0.042028427},"labels":[],"label_agreement":null},{"id":"W578993928","doi":"10.1007/978-3-319-16501-1_11","title":"Tapped Delay Lines for GP Streaming Data Classification with Label Budgets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Stream Mining Techniques","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":"Dalhousie University","funders":"","keywords":"Computer science; Data stream; Classifier (UML); Curse of dimensionality; Stream processing; Concept drift; Data mining; Machine learning; Oversampling; Genetic programming; Artificial intelligence; Data stream mining; Distributed computing; Bandwidth (computing)","score_opus":0.10055888483387902,"score_gpt":0.3245050846267615,"score_spread":0.22394619979288244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W578993928","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.012684757,0.0002543693,0.9824159,0.00020046633,0.00007590868,0.00006168896,0.00018204581,0.0029840113,0.0011409],"genre_scores_gemma":[0.43317398,0.0003013515,0.55578953,0.0002658765,0.00014932608,0.00022530487,0.0007633608,0.00050313806,0.008828107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994469,0.00014104461,0.00003790745,0.0001387822,0.00015964352,0.00007574194],"domain_scores_gemma":[0.9977155,0.0013588797,0.00011325149,0.00032165452,0.0004129403,0.00007786437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289978,0.0006708685,0.00073282834,0.00057738,0.00045152276,0.0013783795,0.0017263901,0.0012736425,0.00743368],"category_scores_gemma":[0.007745262,0.00037856353,0.00045937576,0.0009591358,0.0004963382,0.0018736788,0.0009867422,0.0021177703,0.0019396233],"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.00078626646,0.00016949902,0.0010552212,0.00016199335,0.000049329898,0.00019068975,0.0001452405,0.28427696,0.012915021,0.025444642,0.01220985,0.6625953],"study_design_scores_gemma":[0.000016312835,0.00003518911,0.00008499769,0.000010355095,0.000007789891,0.000024739515,0.0000131651595,0.9863331,0.00288296,0.008713676,0.001871938,0.000005741792],"about_ca_topic_score_codex":0.006341824,"about_ca_topic_score_gemma":0.006710128,"teacher_disagreement_score":0.00743368,"about_ca_system_score_codex":0.0013410125,"about_ca_system_score_gemma":0.0013018796,"threshold_uncertainty_score":0.02486813},"labels":[],"label_agreement":null},{"id":"W58115671","doi":"10.1007/978-3-642-29066-4_16","title":"Measuring Gene Expression Noise in Early Drosophila Embryos: The Highly Dynamic Compartmentalized Micro-environment of the Blastoderm Is One of the Main Sources of Noise","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"British Columbia Institute of Technology","funders":"","keywords":"Blastoderm; Noise (video); Multicellular organism; Gene expression; Biology; Computer science; Gene; Embryo; Cell biology; Genetics; Artificial intelligence; Embryogenesis","score_opus":0.010752752912701754,"score_gpt":0.19849437548690016,"score_spread":0.1877416225741984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58115671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11723634,0.010949968,0.8586312,0.00033948765,0.0001669912,0.000038571794,0.0010815773,0.0015506516,0.010005177],"genre_scores_gemma":[0.57786465,0.0139271375,0.37824693,0.00033755918,0.00016076135,0.00012551215,0.001700898,0.00083432527,0.026802246],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997739,0.000016093541,0.0000064357323,0.00007179308,0.00012044172,0.000011295235],"domain_scores_gemma":[0.99985874,0.000092680326,0.000013281537,0.000010363745,0.000017632114,0.0000073000638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000198291,0.0005732936,0.0005159439,0.00038721415,0.00014203652,0.00058595225,0.00069288496,0.0004733652,0.0013185957],"category_scores_gemma":[0.0003280456,0.00034745177,0.0002845779,0.00049518136,0.00035790805,0.00047484273,0.00031014535,0.00064604473,0.00085979106],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060988194,0.000018227509,0.0016215942,0.0002862465,0.000032448093,0.00011106685,0.00009429862,0.006114891,0.89884764,0.0038578291,0.001080749,0.08787401],"study_design_scores_gemma":[0.000008113436,0.00010302777,0.014391481,0.00005483465,0.00006292246,0.00060758856,0.00007751413,0.055209734,0.90425354,0.011559943,0.013605628,0.00006563224],"about_ca_topic_score_codex":0.0005127386,"about_ca_topic_score_gemma":0.00094106887,"teacher_disagreement_score":0.0013185957,"about_ca_system_score_codex":0.00033609683,"about_ca_system_score_gemma":0.000121292855,"threshold_uncertainty_score":0.004411161},"labels":[],"label_agreement":null},{"id":"W58177476","doi":"10.1007/978-3-642-25264-8_6","title":"Exploring Early Availability Requirements Using Use Case Maps","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Upgrade; Task (project management); Functional requirement; Distributed computing; Feature (linguistics); Software engineering; Real-time computing; Systems engineering; Operating system","score_opus":0.3218060826878532,"score_gpt":0.3201250480623266,"score_spread":0.0016810346255266007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58177476","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.38464436,0.0005779939,0.5594436,0.001130736,0.000062774496,0.00050131144,0.0015656074,0.00455422,0.047519345],"genre_scores_gemma":[0.8216572,0.00026032093,0.17034167,0.00007637912,0.000014899534,0.00017715155,0.0012574884,0.0009700025,0.005244984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948466,0.0013473569,0.0002195876,0.000289046,0.0028592562,0.00043821568],"domain_scores_gemma":[0.96604687,0.026462253,0.0015990823,0.0022089453,0.003267871,0.00041499137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032245326,0.0010989101,0.0004576997,0.003083698,0.0008887707,0.0036280232,0.0017408048,0.0013545533,0.007110456],"category_scores_gemma":[0.02680224,0.00093373936,0.0010417948,0.0018083295,0.00069066754,0.006143065,0.001844395,0.0018606713,0.0010856481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010320919,0.0009546651,0.058130052,0.002161952,0.00026496986,0.01039092,0.018927377,0.18124223,0.068772696,0.12463507,0.014231537,0.5192564],"study_design_scores_gemma":[0.00004957318,0.00037535047,0.018253075,0.00065506686,0.0002450179,0.0026894058,0.010723975,0.79403496,0.040930722,0.06791937,0.06395229,0.0001711643],"about_ca_topic_score_codex":0.007912519,"about_ca_topic_score_gemma":0.013418246,"teacher_disagreement_score":0.007912519,"about_ca_system_score_codex":0.0012918925,"about_ca_system_score_gemma":0.0015156254,"threshold_uncertainty_score":0.023786843},"labels":[],"label_agreement":null},{"id":"W58194215","doi":"10.1007/978-3-642-31638-8_5","title":"Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"Carleton University","funders":"","keywords":"Planar; Orientation (vector space); Plane (geometry); Range (aeronautics); Point (geometry); Computer science; Domain (mathematical analysis); Line (geometry); Algorithm; Line segment; Physics; Geometry; Mathematics; Computer vision; Mathematical analysis; Computer graphics (images); Aerospace engineering","score_opus":0.012382884283127482,"score_gpt":0.20514382459084382,"score_spread":0.19276094030771634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58194215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2209683,0.0013455827,0.75786656,0.00013270041,0.000097206976,0.00003500646,0.0002525482,0.000804655,0.01849749],"genre_scores_gemma":[0.9294966,0.00072907313,0.057892688,0.000048055128,0.0000425509,0.000040747353,0.00036035452,0.00007142741,0.011318521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996191,0.00007094609,0.000013570832,0.00008352248,0.00011144187,0.00010136588],"domain_scores_gemma":[0.9993869,0.00018520013,0.00009055905,0.0001993794,0.0001008261,0.000037154867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026038298,0.00062162266,0.0005571237,0.00033528268,0.00019376165,0.0004873698,0.0012268838,0.0005965335,0.0012825552],"category_scores_gemma":[0.00110414,0.00033692937,0.00040585207,0.00056405907,0.00037091857,0.0006370488,0.0010438409,0.00033109647,0.00074315805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018834291,0.00008669063,0.0023614867,0.00031590255,0.00009905046,0.0011127578,0.00022609397,0.4357176,0.24925046,0.013563119,0.0032676682,0.29211575],"study_design_scores_gemma":[0.00006783397,0.0009828255,0.004327754,0.000050179937,0.000098723736,0.002285991,0.00014628557,0.8688528,0.10086216,0.009398333,0.012861167,0.00006592494],"about_ca_topic_score_codex":0.0005383534,"about_ca_topic_score_gemma":0.00047622802,"teacher_disagreement_score":0.0012825552,"about_ca_system_score_codex":0.0002542046,"about_ca_system_score_gemma":0.00021354847,"threshold_uncertainty_score":0.004290521},"labels":[],"label_agreement":null},{"id":"W58214528","doi":"10.1007/978-3-642-21043-3_2","title":"Grounding Formulas with Complex Terms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Solver; Extension (predicate logic); Relational calculus; Theoretical computer science; Domain (mathematical analysis); Field (mathematics); Ground; Sentence; Variety (cybernetics); Algebra over a field; Relational database; Relational model; Artificial intelligence; Programming language; Mathematics; Database; Pure mathematics","score_opus":0.034303486990457224,"score_gpt":0.24145064354896023,"score_spread":0.20714715655850302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58214528","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.032973688,0.005962004,0.72341365,0.0031514505,0.0007452422,0.00015167498,0.0008111862,0.0013665793,0.23142456],"genre_scores_gemma":[0.55776393,0.007409688,0.35411444,0.0009772019,0.0008808096,0.00032583586,0.0023659205,0.0007487791,0.07541343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912375,0.00020350733,0.0001069426,0.00015863591,0.000319625,0.000087426124],"domain_scores_gemma":[0.9989041,0.00060776895,0.00006594624,0.00024070473,0.00014030545,0.000041152714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010994143,0.000999198,0.00091951556,0.0014606328,0.0012074796,0.004322373,0.0016566134,0.001143388,0.010897232],"category_scores_gemma":[0.0032392778,0.00081395434,0.0009450907,0.002673745,0.0027637188,0.009117854,0.0026522104,0.0037071065,0.0023595325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142351255,0.000012478179,0.000071169794,0.00008226415,0.000009164761,0.000060267525,0.00018264331,0.0007628959,0.00054779125,0.96667963,0.0030563003,0.02852116],"study_design_scores_gemma":[0.00000828204,0.000006001707,0.000037687518,0.000044402215,0.000008429624,0.000039658175,0.000032755943,0.0018813207,0.0006413388,0.9784923,0.018802073,0.0000057916236],"about_ca_topic_score_codex":0.0010549497,"about_ca_topic_score_gemma":0.0014745438,"teacher_disagreement_score":0.010897232,"about_ca_system_score_codex":0.0012167367,"about_ca_system_score_gemma":0.00072676624,"threshold_uncertainty_score":0.036454856},"labels":[],"label_agreement":null},{"id":"W58252060","doi":"10.1007/978-3-642-24873-3_8","title":"Efficiently Eliciting Preferences from a Group of Users","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Group (periodic table); Human–computer interaction","score_opus":0.027811000839785306,"score_gpt":0.2309118307609883,"score_spread":0.203100829921203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58252060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3239814,0.00024821516,0.6662787,0.0006643798,0.00003869006,0.0005184222,0.0007672818,0.0009837906,0.0065191435],"genre_scores_gemma":[0.750466,0.00015963771,0.24377525,0.00019872881,0.00005751185,0.00062533544,0.0015480014,0.00009199706,0.0030775098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930976,0.00433587,0.00028285693,0.0005668456,0.0012682524,0.00044855993],"domain_scores_gemma":[0.98577255,0.010994096,0.000481805,0.0013594702,0.0010158189,0.00037626387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005334406,0.0010181254,0.0016023185,0.00077576307,0.0005011129,0.0017079031,0.0011085607,0.0012882653,0.0034572869],"category_scores_gemma":[0.016564414,0.00045577274,0.0010353773,0.001342365,0.0003656379,0.0024863132,0.0021488236,0.0012468154,0.0016080047],"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.008938744,0.001970122,0.0263455,0.00094799284,0.00057183247,0.0005088365,0.0021430147,0.086834304,0.091126464,0.016598014,0.011439464,0.75257576],"study_design_scores_gemma":[0.00056542654,0.0020804005,0.009100384,0.00007247557,0.00023782597,0.00047369613,0.0026481606,0.87924755,0.03946944,0.059999492,0.0059833964,0.00012176725],"about_ca_topic_score_codex":0.0011866762,"about_ca_topic_score_gemma":0.0020624588,"teacher_disagreement_score":0.005334406,"about_ca_system_score_codex":0.00048166834,"about_ca_system_score_gemma":0.0011237843,"threshold_uncertainty_score":0.028211355},"labels":[],"label_agreement":null},{"id":"W58552428","doi":"10.1007/978-3-319-09165-5_6","title":"MoHex 2.0: A Pattern-Based MCTS Hex Player","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Olympiad; Softmax function; Computer science; Monte Carlo tree search; Tree (set theory); Artificial intelligence; Monte Carlo method; Artificial neural network; Mathematics education; Mathematics","score_opus":0.02656068726825602,"score_gpt":0.2635465497842492,"score_spread":0.23698586251599316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58552428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04694761,0.00039341958,0.7403037,0.000442461,0.0006550053,0.0013614701,0.0038225257,0.06093867,0.14513506],"genre_scores_gemma":[0.31343073,0.00027886507,0.5143008,0.0004173369,0.000048887978,0.001377403,0.0048493533,0.004947223,0.16034935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995679,0.0000436603,0.000033331846,0.00007958099,0.00019201722,0.0000834452],"domain_scores_gemma":[0.9997336,0.00005539723,0.0000153458,0.0000703509,0.00006436237,0.00006087161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035917806,0.0008670928,0.0007339001,0.0005035602,0.00054051547,0.0011685938,0.0034096811,0.0010429487,0.08045039],"category_scores_gemma":[0.0011377009,0.00046784058,0.00049746333,0.00042587446,0.0003941987,0.0012538221,0.0034704662,0.0008441335,0.019412123],"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.0045372522,0.0010447011,0.0027938809,0.0011415295,0.0001570384,0.001046098,0.0007523537,0.034954283,0.06432866,0.078845546,0.12099506,0.6894036],"study_design_scores_gemma":[0.0009707414,0.0011914911,0.0018261544,0.00024615048,0.00012537056,0.0012827708,0.0004040636,0.5976104,0.05753488,0.043904837,0.29473123,0.000171865],"about_ca_topic_score_codex":0.0022804304,"about_ca_topic_score_gemma":0.0041115787,"teacher_disagreement_score":0.08045039,"about_ca_system_score_codex":0.00045545588,"about_ca_system_score_gemma":0.0008417335,"threshold_uncertainty_score":0.26913333},"labels":[],"label_agreement":null},{"id":"W58686263","doi":"10.1007/978-3-642-21869-9_69","title":"A Common Model of Didactic and Collaborative Learning for Theory-Aware Authoring Support","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Computer science; Collaborative learning; Human–computer interaction; Artificial intelligence; Knowledge management","score_opus":0.030537933941640862,"score_gpt":0.2849784761696749,"score_spread":0.2544405422280341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58686263","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.004088057,0.00013095206,0.9619102,0.001794555,0.000105266794,0.0003154294,0.000113533686,0.00074635335,0.03079567],"genre_scores_gemma":[0.17951317,0.00023349875,0.79921496,0.0004382016,0.00008940134,0.0012443989,0.000439279,0.00031236914,0.018514711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99000823,0.00389369,0.00097289635,0.0015527895,0.0031217295,0.00045061347],"domain_scores_gemma":[0.9791235,0.0066322517,0.0007061665,0.009100537,0.0030572985,0.0013803078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074629528,0.0011010739,0.00086325617,0.0023805345,0.002529934,0.010309731,0.005324846,0.003784057,0.0109183565],"category_scores_gemma":[0.022703106,0.0010480793,0.0017962697,0.001846227,0.005733347,0.013136655,0.00920409,0.0042652786,0.0038798943],"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.000034458637,0.00014862901,0.00031087422,0.00013693587,0.000021992679,0.00008290829,0.0030648992,0.003088147,0.0013537196,0.9421947,0.0026446204,0.046918258],"study_design_scores_gemma":[0.00006578647,0.00008587811,0.00021871494,0.00020528171,0.000047282698,0.00023633866,0.0006682128,0.062494196,0.003248614,0.8586888,0.07399308,0.00004785292],"about_ca_topic_score_codex":0.0021559831,"about_ca_topic_score_gemma":0.0020264788,"teacher_disagreement_score":0.0109183565,"about_ca_system_score_codex":0.003371198,"about_ca_system_score_gemma":0.00527485,"threshold_uncertainty_score":0.03946829},"labels":[],"label_agreement":null},{"id":"W58699125","doi":"10.1007/978-3-642-23038-7_27","title":"Clustering with Overlap for Genetic Interaction Networks via Local Search Optimization","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bioinformatics and Genomic Networks","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 Toronto","funders":"","keywords":"Cluster analysis; Computer science; Disjoint sets; Modular design; Biological network; Genetic algorithm; Artificial intelligence; Data mining; Computational biology; Machine learning; Biology; Mathematics","score_opus":0.011341771759603657,"score_gpt":0.22675336618018374,"score_spread":0.21541159442058008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58699125","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.007583175,0.00018177771,0.9898413,0.000097921824,0.000020878644,0.000069700625,0.000070155045,0.0006250749,0.0015099711],"genre_scores_gemma":[0.2279568,0.00023917948,0.76322097,0.00016069593,0.00007819679,0.0009880896,0.0006469756,0.0007967127,0.0059123663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894077,0.00048104048,0.00004535573,0.00021836415,0.00022071239,0.00009377361],"domain_scores_gemma":[0.99671507,0.0024671552,0.00016861071,0.00025011736,0.00027254008,0.00012648487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023930136,0.0016381002,0.0029482923,0.0022715782,0.0012933649,0.001201458,0.003924456,0.0023800079,0.0054126265],"category_scores_gemma":[0.0063797277,0.0012696263,0.0019941402,0.002243456,0.0017148905,0.0021937527,0.003513334,0.0018262186,0.0012624622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001197527,0.00008660386,0.00030206912,0.0001173318,0.000088279136,0.00005034351,0.00009083974,0.9175746,0.0008754921,0.025070848,0.0022244046,0.053399388],"study_design_scores_gemma":[0.00000862069,0.000009579747,0.000026821468,0.0000038557237,0.000006222903,0.000007227848,0.000007458964,0.99074495,0.00014478932,0.00882864,0.00020887554,0.000002973965],"about_ca_topic_score_codex":0.006039525,"about_ca_topic_score_gemma":0.0063009067,"teacher_disagreement_score":0.006039525,"about_ca_system_score_codex":0.0018736601,"about_ca_system_score_gemma":0.001474699,"threshold_uncertainty_score":0.018107057},"labels":[],"label_agreement":null},{"id":"W58761036","doi":"10.1007/978-3-642-55032-4_29","title":"An Infinite Mixture Model of Generalized Inverted Dirichlet Distributions for High-Dimensional Positive Data Modeling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","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":"Concordia University","funders":"","keywords":"Dirichlet distribution; Gibbs sampling; Computer science; Cluster analysis; Hierarchical Dirichlet process; Artificial intelligence; Mixture model; Pattern recognition (psychology); Latent Dirichlet allocation; Dirichlet process; Bayesian information criterion; Covariance; Feature (linguistics); Model selection; Algorithm; Data mining; Bayesian probability; Machine learning; Mathematics; Topic model; Statistics","score_opus":0.04482043867279158,"score_gpt":0.29381239697545397,"score_spread":0.2489919583026624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58761036","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.001662861,0.00037318387,0.9967481,0.00019901952,0.000040437473,0.00002440824,0.00008926886,0.00012796836,0.0007348304],"genre_scores_gemma":[0.17823173,0.0020774023,0.80136853,0.00074690225,0.0006561107,0.00097632705,0.0017145362,0.00060475897,0.013623666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920346,0.00463199,0.00042586398,0.0013080932,0.0011993027,0.00040021425],"domain_scores_gemma":[0.97794354,0.017784689,0.00074474816,0.0017575262,0.0013941654,0.00037537573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011020148,0.0016581757,0.0038450598,0.0024081178,0.0014411296,0.0053067934,0.007704909,0.004050379,0.006106944],"category_scores_gemma":[0.03977422,0.0022439428,0.0045675794,0.004706835,0.0037754136,0.0083004255,0.0047422596,0.006450027,0.0023463392],"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.00016069828,0.00008637992,0.000976664,0.00029491953,0.00017704093,0.00021367721,0.00074321515,0.21808298,0.0009776164,0.70484716,0.004534874,0.068904795],"study_design_scores_gemma":[0.000013700457,0.000015637688,0.00010872931,0.00003916585,0.000035132824,0.00009417315,0.000031245458,0.72067547,0.00019218193,0.27678102,0.0019794772,0.000033937496],"about_ca_topic_score_codex":0.0054055564,"about_ca_topic_score_gemma":0.0066895266,"teacher_disagreement_score":0.011020148,"about_ca_system_score_codex":0.002249621,"about_ca_system_score_gemma":0.0019125912,"threshold_uncertainty_score":0.058280826},"labels":[],"label_agreement":null},{"id":"W588227996","doi":"10.1007/978-3-319-07887-8_26","title":"Towards a Quantitative Measure of Radiographic Masking by Dense Tissue in Mammography","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Radiography and Breast Imaging","field":"Medicine","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; Sunnybrook Hospital; Sunnybrook Health Science Centre","funders":"","keywords":"Mammography; Masking (illustration); Breast density; Breast tissue; Computer science; Correlation; Artificial intelligence; Metric (unit); Measure (data warehouse); Pattern recognition (psychology); Observer (physics); Medicine; Mathematics; Breast cancer; Data mining; Physics","score_opus":0.014002148758309648,"score_gpt":0.2582218860362117,"score_spread":0.24421973727790205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W588227996","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.025125135,0.0032472396,0.9693526,0.00010158203,0.00006502948,0.00003848059,0.00014784595,0.0003901769,0.0015318819],"genre_scores_gemma":[0.2627991,0.0033111046,0.729622,0.00017201825,0.00026995057,0.000105329906,0.00048411847,0.00030957736,0.0029268174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790716,0.00067125907,0.00012871873,0.0003234403,0.00088220194,0.00008719818],"domain_scores_gemma":[0.9941351,0.003841961,0.0005929775,0.00057171425,0.00072577293,0.0001324849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003171644,0.0010864048,0.0010383936,0.002451319,0.0002574459,0.0021481202,0.0016241402,0.0014433827,0.0015711203],"category_scores_gemma":[0.010136381,0.0010271099,0.0006084774,0.001577637,0.0014296861,0.0020914506,0.002064969,0.0010443601,0.00082770793],"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.00063749007,0.00015611746,0.009610738,0.0015391279,0.00024362945,0.00028362707,0.00037953787,0.037514593,0.5086789,0.031608168,0.0016708174,0.40767723],"study_design_scores_gemma":[0.000049904935,0.0011158035,0.047781095,0.00037654795,0.000494402,0.004988252,0.00048971735,0.5373534,0.3081247,0.083909996,0.015046676,0.00026947446],"about_ca_topic_score_codex":0.00035121536,"about_ca_topic_score_gemma":0.00039859134,"teacher_disagreement_score":0.003171644,"about_ca_system_score_codex":0.0005062823,"about_ca_system_score_gemma":0.00029735712,"threshold_uncertainty_score":0.016773403},"labels":[],"label_agreement":null},{"id":"W58823560","doi":"10.1007/11818502_12","title":"Exception-Aware Requirements Elicitation with Use Cases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Requirements elicitation; Use Case Diagram; Table (database); Interrupt; Unified Modeling Language; Process (computing); Software engineering; Exception handling; System requirements specification; Requirements analysis; Software; Risk analysis (engineering); Class diagram; Programming language; Database","score_opus":0.062192061277508724,"score_gpt":0.29721514946107036,"score_spread":0.23502308818356163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58823560","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.032493092,0.00013681214,0.95492256,0.0003776611,0.000021980373,0.0008448722,0.00028612599,0.002178257,0.008738601],"genre_scores_gemma":[0.2520828,0.00031420702,0.74074167,0.0001644186,0.000023197545,0.0008179256,0.0016001337,0.0004962564,0.0037594666],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9820207,0.008345968,0.0011912977,0.0013066058,0.0064788847,0.00065656425],"domain_scores_gemma":[0.9520757,0.035615776,0.0020104211,0.0058457097,0.0040671737,0.00038516187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080153635,0.001844207,0.0011155099,0.0027437913,0.0010150161,0.0028736605,0.0027296671,0.0016308974,0.003624562],"category_scores_gemma":[0.043914232,0.0014779248,0.0016742742,0.0017698717,0.0011016725,0.0036525526,0.004061474,0.002016126,0.001509696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005740705,0.0008587074,0.0054283887,0.0020754738,0.0002482307,0.0038330685,0.011072381,0.066698946,0.06844929,0.037973702,0.00978499,0.7930028],"study_design_scores_gemma":[0.00021770866,0.00043818977,0.0046534184,0.0012762179,0.00040821813,0.004104165,0.0054333587,0.7389717,0.10886439,0.07413881,0.061255787,0.00023809497],"about_ca_topic_score_codex":0.0015083855,"about_ca_topic_score_gemma":0.0035973352,"teacher_disagreement_score":0.0080153635,"about_ca_system_score_codex":0.00086537394,"about_ca_system_score_gemma":0.0018259594,"threshold_uncertainty_score":0.04238981},"labels":[],"label_agreement":null},{"id":"W589723224","doi":"10.1007/978-3-319-94667-2","title":"Combinatorial Algorithms","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.012342987073364953,"score_gpt":0.23949912091486134,"score_spread":0.22715613384149638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W589723224","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.0024666227,0.017156258,0.1906844,0.0033831862,0.0032661115,0.0001581141,0.0023149666,0.0023405699,0.7782298],"genre_scores_gemma":[0.06428277,0.029754343,0.21342498,0.0024321869,0.004722027,0.00063901447,0.009043153,0.00377204,0.6719296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991085,0.00013469394,0.000033071003,0.00021935163,0.00043612422,0.00006813235],"domain_scores_gemma":[0.9991555,0.0002690669,0.000027955579,0.00032302534,0.00015739919,0.0000670505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005804379,0.0019568745,0.0016093157,0.002252053,0.0011614636,0.0042355615,0.002441247,0.0012564097,0.08906781],"category_scores_gemma":[0.0022682662,0.0009082283,0.0013788424,0.0045481985,0.0011247826,0.0034463431,0.0020813844,0.0046889316,0.056437463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040377436,0.00011699666,0.00014672136,0.0004567801,0.000047354537,0.000042955126,0.000051462943,0.0052665747,0.00094730884,0.2977424,0.32455182,0.3705893],"study_design_scores_gemma":[0.000025129688,0.000021657052,0.00030461958,0.0001803901,0.000032641845,0.00021510075,0.000033223365,0.010913279,0.0009990196,0.46990484,0.5173518,0.000018278524],"about_ca_topic_score_codex":0.0008207948,"about_ca_topic_score_gemma":0.0013302262,"teacher_disagreement_score":0.08906781,"about_ca_system_score_codex":0.0021776054,"about_ca_system_score_gemma":0.0013584152,"threshold_uncertainty_score":0.29796153},"labels":[],"label_agreement":null},{"id":"W589855758","doi":"10.1007/978-3-662-47221-7_6","title":"A Cellular Automaton for Blocking Queen Games","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Blocking (statistics); Cellular automaton; Computer science; Automaton; Chaotic; Combinatorial game theory; Value (mathematics); Type (biology); Combinatorics; Mathematics; Mathematical economics; Sequential game; Game theory; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.02142304767723925,"score_gpt":0.2766106330834699,"score_spread":0.25518758540623065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W589855758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21744864,0.0004568606,0.709886,0.0013247473,0.00031066049,0.00020335575,0.0011382034,0.0007604486,0.068471074],"genre_scores_gemma":[0.8724956,0.00042597932,0.09188421,0.00026615584,0.000057888392,0.00038815517,0.0005583715,0.0001644446,0.033759158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994999,0.00012328316,0.000033201788,0.000101103076,0.000108835506,0.00013364048],"domain_scores_gemma":[0.99882454,0.00055958,0.00007333819,0.00015999543,0.00020951826,0.00017299465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039465952,0.00054414244,0.0011825592,0.0005209059,0.0017386747,0.002478913,0.0017840381,0.0015033573,0.009107447],"category_scores_gemma":[0.0019615858,0.00051583844,0.0011292509,0.000659773,0.0016758961,0.0011663751,0.0018904301,0.001466059,0.0011648302],"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.00014846052,0.000042152355,0.00044925732,0.000076797616,0.000026677784,0.00018021617,0.00031700704,0.100994274,0.0046611223,0.88346344,0.0024482477,0.007192417],"study_design_scores_gemma":[0.000071659095,0.000037761547,0.00012361867,0.000020512121,0.000024536548,0.000058317026,0.00009515804,0.57371426,0.0010463063,0.42039868,0.004380291,0.000028920193],"about_ca_topic_score_codex":0.013722907,"about_ca_topic_score_gemma":0.012263752,"teacher_disagreement_score":0.013722907,"about_ca_system_score_codex":0.0021954745,"about_ca_system_score_gemma":0.0026241615,"threshold_uncertainty_score":0.03046745},"labels":[],"label_agreement":null},{"id":"W59016446","doi":"10.1007/978-3-319-14678-2_2","title":"Deformable Image Registration and Intensity Correction of Cardiac Perfusion MRI","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ontario Institute of Technology","keywords":"Hessian matrix; Jacobian matrix and determinant; Regularization (linguistics); Image registration; Artificial intelligence; Intensity (physics); Computer science; Transformation (genetics); Magnetic resonance imaging; Dynamic contrast-enhanced MRI; Computer vision; Algorithm; Mathematics; Image (mathematics); Medicine; Radiology; Physics; Optics","score_opus":0.010630671864321158,"score_gpt":0.26416997022867106,"score_spread":0.2535392983643499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59016446","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.0022876482,0.0030497364,0.98812324,0.00018764839,0.0002237778,0.00004867979,0.0000924352,0.001190489,0.0047963583],"genre_scores_gemma":[0.06139324,0.008380358,0.8853255,0.00019886791,0.0003873043,0.00010817067,0.0006932533,0.0014273383,0.042085893],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946815,0.00007441772,0.000032283147,0.00012999937,0.00026172792,0.000033365854],"domain_scores_gemma":[0.99955255,0.00017871807,0.00004161782,0.00012568248,0.00008461259,0.000016865515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070658466,0.00077420194,0.00086865167,0.0011049918,0.00022435455,0.0011408612,0.0017498878,0.0011342841,0.006281518],"category_scores_gemma":[0.0019545113,0.0008306678,0.0010235684,0.0016944751,0.000696381,0.0010553579,0.0010292861,0.0016650328,0.004444711],"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.00006505745,0.000036266807,0.00016710263,0.00035686351,0.00006229133,0.00016243012,0.000106699656,0.026904522,0.068678744,0.025574971,0.009500762,0.8683843],"study_design_scores_gemma":[0.000025119978,0.00019624499,0.00270134,0.0001485681,0.00012138305,0.003632148,0.0000841188,0.6143205,0.17301904,0.056090858,0.14952159,0.00013908754],"about_ca_topic_score_codex":0.0011734655,"about_ca_topic_score_gemma":0.0017275417,"teacher_disagreement_score":0.006281518,"about_ca_system_score_codex":0.00044394025,"about_ca_system_score_gemma":0.00051543984,"threshold_uncertainty_score":0.021013796},"labels":[],"label_agreement":null},{"id":"W59043292","doi":"10.1007/978-3-642-31612-8_4","title":"Off the Trail: Re-examining the CDCL Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"DPLL algorithm; Backtracking; Computer science; Extension (predicate logic); Local search (optimization); Search algorithm; Boolean satisfiability problem; Algorithm; Theoretical computer science; Programming language","score_opus":0.04865092424620726,"score_gpt":0.2868546918142298,"score_spread":0.23820376756802253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59043292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031561308,0.002857725,0.749921,0.016226942,0.00447636,0.00023533539,0.00062761665,0.0046817274,0.18941198],"genre_scores_gemma":[0.45025223,0.0029601764,0.4441973,0.0054518846,0.0012242631,0.00016009902,0.0009050441,0.00518157,0.08966749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961701,0.0012672298,0.00015682598,0.0006144518,0.0013749112,0.00041637814],"domain_scores_gemma":[0.9894176,0.0047508483,0.00020831023,0.0033769985,0.0019481707,0.00029807893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026774602,0.000774303,0.0011317789,0.0021285303,0.0033856363,0.0049793557,0.0029887324,0.0025056587,0.03113894],"category_scores_gemma":[0.022767022,0.00063322496,0.0010865239,0.0033811165,0.0037409216,0.010394145,0.0045877774,0.0046947054,0.008947282],"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.00036778784,0.00009357195,0.0006847859,0.00027397132,0.000026990134,0.00017336308,0.00060547463,0.009423686,0.0016654135,0.6866613,0.048173036,0.25185066],"study_design_scores_gemma":[0.00012992465,0.000045532917,0.00014457392,0.00016739103,0.000049041162,0.0002561558,0.00048905483,0.044430606,0.004243259,0.84236485,0.107627556,0.00005201024],"about_ca_topic_score_codex":0.0068390374,"about_ca_topic_score_gemma":0.009947862,"teacher_disagreement_score":0.03113894,"about_ca_system_score_codex":0.0025239345,"about_ca_system_score_gemma":0.004924767,"threshold_uncertainty_score":0.104170084},"labels":[],"label_agreement":null},{"id":"W59149218","doi":"10.1007/978-3-642-33564-8_71","title":"Multibiometric System Using Distance Regularized Level Set Method and Particle Swarm Optimization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Biometrics; Computer science; Particle swarm optimization; Level set (data structures); Fitness function; Pattern recognition (psychology); Artificial intelligence; Iris recognition; Feature (linguistics); Segmentation; Fingerprint (computing); IRIS (biosensor); Set (abstract data type); Computer vision; Algorithm; Genetic algorithm; Machine learning","score_opus":0.06781017050512292,"score_gpt":0.2988291711658156,"score_spread":0.23101900066069267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59149218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003009089,0.00015528308,0.9954216,0.00006876485,0.000049519025,0.00002523708,0.000013324904,0.00021605499,0.0010411493],"genre_scores_gemma":[0.17501684,0.00037169873,0.81960803,0.00012519644,0.00007308789,0.00023987368,0.00014888457,0.00011074233,0.004305627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994961,0.00010767787,0.000030898103,0.000114581846,0.00022836225,0.000022302534],"domain_scores_gemma":[0.9997098,0.000096534255,0.000044411412,0.000045177134,0.00008899142,0.000014958129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068890967,0.000590704,0.0011902358,0.0005291765,0.000567634,0.0012642195,0.0012890287,0.0013928177,0.001776531],"category_scores_gemma":[0.0013441747,0.00045775383,0.001008175,0.0009924789,0.00043992215,0.001376528,0.0012907463,0.0010337249,0.0007516798],"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.0002400327,0.00014760891,0.001025522,0.00036854908,0.00017848624,0.00020208732,0.00026133942,0.439696,0.053763267,0.028986197,0.0036668398,0.47146404],"study_design_scores_gemma":[0.0000067620467,0.000026204953,0.0001501675,0.00000547283,0.000010464138,0.000041905678,0.00000770913,0.9945517,0.002413934,0.0018554567,0.00091716234,0.000013197353],"about_ca_topic_score_codex":0.0016520891,"about_ca_topic_score_gemma":0.0011417032,"teacher_disagreement_score":0.001776531,"about_ca_system_score_codex":0.0005620948,"about_ca_system_score_gemma":0.00082124455,"threshold_uncertainty_score":0.00594306},"labels":[],"label_agreement":null},{"id":"W59336092","doi":"10.1007/978-3-642-30353-1_39","title":"Exploiting Semantic Roles for Asynchronous Question Answering in an Educational Setting","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Athabasca University","funders":"","keywords":"Asynchronous communication; Question answering; Computer science; Asynchronous learning; Information retrieval; Natural language processing; Psychology; Mathematics education; Teaching method","score_opus":0.021563959195854278,"score_gpt":0.2759686408468404,"score_spread":0.2544046816509861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59336092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042691864,0.00028607823,0.9472536,0.0008510021,0.00011815219,0.00012356893,0.00033072452,0.002813909,0.0055311085],"genre_scores_gemma":[0.6333496,0.0002120008,0.3613541,0.00017519089,0.00012511412,0.00012910893,0.0010577803,0.00031069692,0.0032864197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638546,0.0020825197,0.00023050181,0.00062441814,0.00041519853,0.0002617753],"domain_scores_gemma":[0.98921824,0.007945416,0.00039364686,0.0012298936,0.00071942265,0.0004934032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045080227,0.00080966984,0.00067393866,0.001079101,0.0010299492,0.003015666,0.0020752896,0.0017334396,0.0057395287],"category_scores_gemma":[0.014254042,0.00074590347,0.001186115,0.0009226627,0.0010091653,0.008909556,0.0034675489,0.0022443305,0.0016954367],"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.0024975701,0.0013853136,0.008590438,0.0010146606,0.00016545638,0.00123273,0.008992563,0.036408763,0.06635445,0.32685903,0.01798562,0.5285133],"study_design_scores_gemma":[0.0001869225,0.00019101829,0.0012986029,0.00006847583,0.00015222395,0.0003284912,0.0013952451,0.61449754,0.021268671,0.33547455,0.025061741,0.000076457865],"about_ca_topic_score_codex":0.0017739454,"about_ca_topic_score_gemma":0.0025745647,"teacher_disagreement_score":0.0057395287,"about_ca_system_score_codex":0.0007342807,"about_ca_system_score_gemma":0.0008603455,"threshold_uncertainty_score":0.023840964},"labels":[],"label_agreement":null},{"id":"W593364932","doi":"10.1007/978-3-319-16483-0_61","title":"A Computational Domain-Based Feature Grouping Approach for Prediction of Stability of SCF Ligases","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Ubiquitin and proteasome pathways","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 Windsor","funders":"","keywords":"Feature selection; Computer science; Support vector machine; Feature (linguistics); Stability (learning theory); Artificial intelligence; Pattern recognition (psychology); k-nearest neighbors algorithm; Filter (signal processing); Domain (mathematical analysis); Feature vector; Ubiquitin ligase; Data mining; Machine learning; Ubiquitin; Mathematics; Gene; Biology; Genetics","score_opus":0.03186645037656747,"score_gpt":0.2540057980956514,"score_spread":0.22213934771908392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W593364932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24861996,0.001462486,0.73788977,0.00025312506,0.00009239247,0.00020748892,0.0020095524,0.00771113,0.0017541624],"genre_scores_gemma":[0.59571725,0.0004006795,0.3949948,0.0001400557,0.00008753403,0.00025592596,0.005713673,0.00019636453,0.0024937144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997135,0.000049970673,0.000027072318,0.000091194364,0.000071814895,0.000046451234],"domain_scores_gemma":[0.9994666,0.00029592405,0.000032328415,0.000055784236,0.000109304114,0.00004013499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071703794,0.000894414,0.0015694593,0.001799764,0.00056986365,0.0007709122,0.0015082188,0.0009833435,0.0023032136],"category_scores_gemma":[0.0010146208,0.00033853424,0.0015997041,0.0015942361,0.00026846773,0.000732533,0.0008266675,0.0007516014,0.0007717645],"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.0011752755,0.00062911323,0.005483368,0.00018738261,0.00033812283,0.0002749939,0.00007118301,0.21687886,0.02797495,0.0022569464,0.009372151,0.7353576],"study_design_scores_gemma":[0.000027979593,0.0000633148,0.0010635671,0.0000043936234,0.000032387852,0.000039306266,0.000016372653,0.99541616,0.0017136212,0.0012882205,0.0003252682,0.000009388002],"about_ca_topic_score_codex":0.0068556927,"about_ca_topic_score_gemma":0.006773151,"teacher_disagreement_score":0.0068556927,"about_ca_system_score_codex":0.00049455866,"about_ca_system_score_gemma":0.0007359493,"threshold_uncertainty_score":0.013631582},"labels":[],"label_agreement":null},{"id":"W59337188","doi":"10.1007/978-3-642-30615-0_24","title":"Partial Fourier Codebooks Associated with Multiplied Golay Complementary Sequences for Compressed Sensing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","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":"Lakehead University","funders":"","keywords":"Codebook; Binary Golay code; Binary number; Complementary sequences; Ternary Golay code; Algorithm; Integer (computer science); Sequence (biology); Bounded function; Mathematics; Matrix (chemical analysis); Fast Fourier transform; Binary code; Combinatorics; Discrete mathematics; Computer science; Arithmetic; Mathematical analysis; Hamming code; Block code; Decoding methods; Materials science","score_opus":0.03059745839473943,"score_gpt":0.24381262231764275,"score_spread":0.21321516392290332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59337188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01260586,0.0013926679,0.97046185,0.00020802711,0.00029138778,0.000076055396,0.00029583427,0.00022350172,0.014444765],"genre_scores_gemma":[0.27296337,0.003396939,0.6967801,0.00032167198,0.0005222957,0.000374693,0.0013677677,0.00031220703,0.023960954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.0001285403,0.000024867586,0.000049705464,0.000266591,0.00003600166],"domain_scores_gemma":[0.9988537,0.0005547794,0.000072064606,0.00019723373,0.00027171546,0.0000505475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062838744,0.00059064256,0.0006282027,0.00087226735,0.00036991673,0.0011409036,0.0007596014,0.0008547141,0.007061444],"category_scores_gemma":[0.0038532142,0.00031277144,0.00034745247,0.0017618749,0.0007529548,0.0011721418,0.0009182815,0.0010772799,0.0016519647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021162824,0.000037813203,0.00023126359,0.00019992563,0.000028284292,0.00016180267,0.00012328013,0.042637736,0.025151178,0.739077,0.007800302,0.18433991],"study_design_scores_gemma":[0.000055792716,0.00014872084,0.00047140065,0.0001228949,0.000025887939,0.0010172126,0.00008388028,0.64099556,0.015888391,0.31186023,0.029243113,0.00008683211],"about_ca_topic_score_codex":0.00055040856,"about_ca_topic_score_gemma":0.00083714176,"teacher_disagreement_score":0.007061444,"about_ca_system_score_codex":0.00044426898,"about_ca_system_score_gemma":0.00062024023,"threshold_uncertainty_score":0.02362293},"labels":[],"label_agreement":null},{"id":"W59443590","doi":"10.1007/978-3-319-07887-8_33","title":"Contrast-Enhanced Digital Mammography Lesion Morphology and a Phantom for Performance Evaluation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Radiography and Breast Imaging","field":"Medicine","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":"Sunnybrook Hospital; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Imaging phantom; Mammography; Digital mammography; Computer science; Lesion; Artificial intelligence; Contrast (vision); Breast imaging; Breast MRI; Pattern recognition (psychology); Radiology; Medicine; Medical physics; Breast cancer; Pathology","score_opus":0.017864489460936262,"score_gpt":0.2678821799734879,"score_spread":0.2500176905125516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59443590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20487347,0.030189244,0.70704204,0.001153598,0.0005341108,0.0006445925,0.0022422276,0.0044454704,0.048875354],"genre_scores_gemma":[0.5534628,0.012815792,0.39449954,0.00050213764,0.0002119443,0.00021307213,0.0026024624,0.0012819208,0.03441031],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996904,0.00008616586,0.00002222749,0.000034687888,0.00015151726,0.000014968684],"domain_scores_gemma":[0.99879277,0.0007234963,0.00006858312,0.00012634498,0.00025180314,0.000036983147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914458,0.000711089,0.0003379074,0.0012111466,0.00013842875,0.0010443849,0.0007340169,0.0008075967,0.005279055],"category_scores_gemma":[0.0030606699,0.0004129821,0.00032038472,0.0010316239,0.0002386575,0.0005658789,0.0003861591,0.0003297482,0.0018995301],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017967771,0.00036713865,0.0043506026,0.0010074634,0.00008115285,0.0012206075,0.00021994364,0.015102864,0.49530557,0.0063347816,0.0073256404,0.46688735],"study_design_scores_gemma":[0.00014567346,0.003063799,0.05344419,0.00062969327,0.0005205074,0.035894107,0.00035422578,0.22890376,0.6090258,0.0070010703,0.060777895,0.00023939103],"about_ca_topic_score_codex":0.00035089676,"about_ca_topic_score_gemma":0.00050532265,"teacher_disagreement_score":0.005279055,"about_ca_system_score_codex":0.00029051874,"about_ca_system_score_gemma":0.00027811766,"threshold_uncertainty_score":0.0176602},"labels":[],"label_agreement":null},{"id":"W59453251","doi":"10.1007/978-3-540-79980-1_19","title":"Constant Complements, Reversibility and Universal View Updates","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Mount Allison University","funders":"","keywords":"Complement (music); Sketch; Constant (computer programming); Computer science; Theoretical computer science; Physical constant; Algebraic number; Algorithm; Mathematics; Programming language","score_opus":0.020424082124550092,"score_gpt":0.24687557727130363,"score_spread":0.22645149514675353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59453251","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11159731,0.009647357,0.62162995,0.004013873,0.0014042023,0.00017195893,0.0010024075,0.001969869,0.24856307],"genre_scores_gemma":[0.8107563,0.0045819,0.1199329,0.0009767609,0.0010354826,0.00017080056,0.0009657344,0.00089471426,0.06068535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732804,0.00061442034,0.00022721611,0.0007208762,0.0007169952,0.00039237115],"domain_scores_gemma":[0.99356574,0.003344624,0.00034637807,0.0019399723,0.0005846184,0.00021871214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026035209,0.00086623227,0.0012858197,0.0015863299,0.0021213212,0.00661356,0.0017328869,0.0016530534,0.009946997],"category_scores_gemma":[0.012057687,0.0012920838,0.0013069871,0.0026488502,0.0067212414,0.025326224,0.00428401,0.005547454,0.0011826695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060003928,0.00001653741,0.00008410172,0.00005570082,0.0000089975565,0.00006594669,0.0002525234,0.0005472509,0.00048009257,0.9797332,0.0019409577,0.01675468],"study_design_scores_gemma":[0.00001914989,0.000012571709,0.00006138176,0.000018424102,0.000020032101,0.00015280826,0.00007879823,0.0015340876,0.0010754465,0.9875864,0.009425501,0.000015452393],"about_ca_topic_score_codex":0.0019931744,"about_ca_topic_score_gemma":0.00143976,"teacher_disagreement_score":0.009946997,"about_ca_system_score_codex":0.0014898855,"about_ca_system_score_gemma":0.00122774,"threshold_uncertainty_score":0.03327602},"labels":[],"label_agreement":null},{"id":"W5946680","doi":"10.1007/978-3-642-24500-8_8","title":"Gemini: A Pervasive Accumulated Context Exergame","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","field":"Computer Science","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pace; Software deployment; Commercialization; Computer science; Context (archaeology); Scalability; Human–computer interaction; Term (time); Multimedia; Software engineering; Operating system","score_opus":0.03866445318236013,"score_gpt":0.27374357181619724,"score_spread":0.23507911863383713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5946680","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18444794,0.002342288,0.6060148,0.0006808342,0.00071681733,0.0015147666,0.0045544608,0.02933482,0.17039335],"genre_scores_gemma":[0.39935395,0.0018710709,0.29925588,0.00070849305,0.000113563496,0.0014083094,0.006858733,0.0025442839,0.28788584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999101,0.000010831661,0.000003893044,0.000024863344,0.000031792817,0.000018365909],"domain_scores_gemma":[0.9999598,0.000006869912,0.0000022987808,0.0000055177397,0.000006997036,0.00001844351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001357022,0.0011253234,0.00039700093,0.00032724842,0.0003184671,0.0005951639,0.0011446903,0.00063525635,0.031536292],"category_scores_gemma":[0.0002275147,0.00029697208,0.00037912081,0.00016384968,0.00017504116,0.00092887593,0.0026464073,0.0006305024,0.0075602815],"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.0039332826,0.0025092773,0.0019179931,0.001867585,0.00026575712,0.00096035516,0.00094593706,0.008743504,0.18707997,0.017757503,0.07637314,0.6976457],"study_design_scores_gemma":[0.0012022045,0.006122487,0.031379536,0.00064668356,0.00063712045,0.0051458934,0.0012465604,0.07221851,0.075385734,0.023772806,0.78189164,0.00035085282],"about_ca_topic_score_codex":0.00056209986,"about_ca_topic_score_gemma":0.001928835,"teacher_disagreement_score":0.031536292,"about_ca_system_score_codex":0.000118045544,"about_ca_system_score_gemma":0.00024964823,"threshold_uncertainty_score":0.10549939},"labels":[],"label_agreement":null},{"id":"W59536351","doi":"10.1007/978-3-642-31482-7_34","title":"Pragmatic Constraints on Gesture Use: The Effect of Downward and Non Entailing Contexts on Gesture Processing","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hearing Impairment and Communication","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gesture; Computer science; Maxim; Interpretation (philosophy); Extension (predicate logic); Gesture recognition; Natural language processing; Human–computer interaction; Cognitive science; Linguistics; Artificial intelligence; Epistemology; Programming language; Psychology; Philosophy","score_opus":0.02293905487973817,"score_gpt":0.2970659772553069,"score_spread":0.27412692237556874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59536351","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.94582444,0.0021326088,0.011853579,0.0006810821,0.000118494085,0.00020341328,0.0005611457,0.00021386803,0.038411386],"genre_scores_gemma":[0.9822289,0.0009842133,0.012023774,0.00050470687,0.00015447573,0.0003745166,0.00046267136,0.0006313455,0.0026355104],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9984597,0.00054040493,0.000090891175,0.00037935452,0.00039503397,0.0001345473],"domain_scores_gemma":[0.97548705,0.021484211,0.0013130084,0.0010189371,0.00026632453,0.00043050473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740958,0.00078388985,0.0007226208,0.0003653174,0.00065829675,0.0033141782,0.0011200322,0.0010783687,0.01748169],"category_scores_gemma":[0.022222439,0.0010712445,0.00055178296,0.0004050286,0.0021826562,0.0027250436,0.0024659787,0.0019447283,0.0012391065],"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.005806543,0.00089792855,0.014151427,0.0021234641,0.00019043162,0.0010352756,0.005934326,0.003021491,0.83061904,0.015073577,0.0024707394,0.11867569],"study_design_scores_gemma":[0.0016094443,0.004794792,0.6843731,0.0005614703,0.001189617,0.0034870482,0.0037322955,0.028951505,0.12559849,0.13172428,0.013409989,0.0005679736],"about_ca_topic_score_codex":0.0009198907,"about_ca_topic_score_gemma":0.001178969,"teacher_disagreement_score":0.01748169,"about_ca_system_score_codex":0.00040991863,"about_ca_system_score_gemma":0.00037838877,"threshold_uncertainty_score":0.05848205},"labels":[],"label_agreement":null},{"id":"W596160964","doi":"10.1007/978-3-642-39112-5_151","title":"Authoring Problem-Solving ITS with ASTUS: An Interactive Event","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Tracing; TUTOR; Task (project management); SQL; Constraint (computer-aided design); Domain (mathematical analysis); Event (particle physics); Programming language; Software engineering; Human–computer interaction; Artificial intelligence","score_opus":0.020081140370926995,"score_gpt":0.25486717752079974,"score_spread":0.23478603714987273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W596160964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033946324,0.00017205905,0.81614697,0.0005415661,0.0006727467,0.00035360295,0.0030815206,0.07114248,0.07394274],"genre_scores_gemma":[0.3423267,0.00032266494,0.55654776,0.00023814409,0.00026836048,0.0006887981,0.009128308,0.016675321,0.07380397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909735,0.0003944691,0.000052873133,0.000116778436,0.00026022585,0.00007826418],"domain_scores_gemma":[0.9959169,0.0027744356,0.000097098135,0.0005767583,0.00028175514,0.00035301715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013006056,0.0012013928,0.0006162805,0.00064925535,0.00072087994,0.002460685,0.0017595039,0.0010934309,0.05500069],"category_scores_gemma":[0.006696942,0.0005529167,0.00093251915,0.00055657193,0.00071601983,0.002685807,0.0037554905,0.0021634067,0.0107627055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00286845,0.0011365559,0.0032374393,0.001644729,0.00013283276,0.0015321834,0.007586327,0.04412495,0.038597472,0.124319606,0.28087267,0.49394682],"study_design_scores_gemma":[0.00052526663,0.00038444484,0.0010951861,0.00021825527,0.00007143424,0.00072126486,0.00076869316,0.22871508,0.041208096,0.07235693,0.6538381,0.00009731757],"about_ca_topic_score_codex":0.00043950323,"about_ca_topic_score_gemma":0.0012518734,"teacher_disagreement_score":0.05500069,"about_ca_system_score_codex":0.00045642685,"about_ca_system_score_gemma":0.00059788505,"threshold_uncertainty_score":0.18399566},"labels":[],"label_agreement":null},{"id":"W59683266","doi":"10.1007/978-3-642-37899-7_5","title":"Semantic Web and Ontology Engineering for the Colorectal Cancer Follow-Up Clinical Practice Guidelines","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical practice guidelines implementation","field":"Medicine","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":"Laurentian University","funders":"","keywords":"Ontology; Computer science; Semantic Web; Ontology engineering; Colorectal cancer; World Wide Web; Upper ontology; Knowledge management; Cancer; Medicine; Internal medicine","score_opus":0.16815817696877078,"score_gpt":0.47050522545114215,"score_spread":0.30234704848237137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59683266","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.0049607693,0.003254618,0.94653535,0.005570677,0.0004396901,0.00023906257,0.00080340554,0.0012731188,0.03692331],"genre_scores_gemma":[0.05184488,0.0040023513,0.9258393,0.0008296023,0.0001296347,0.0002292523,0.0022048387,0.00036309686,0.014557002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979905,0.0006398127,0.00031721417,0.000161021,0.0007833319,0.00010823241],"domain_scores_gemma":[0.9984602,0.00082861295,0.000091476984,0.00021706408,0.00032156322,0.00008104458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030160504,0.00052763906,0.00047986314,0.0021812164,0.0009223603,0.003923053,0.001405804,0.0013157292,0.004818713],"category_scores_gemma":[0.004760122,0.0006030015,0.0015079611,0.0030088068,0.0009667322,0.0044664075,0.002351238,0.002781872,0.0016089765],"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.000038002672,0.00015728269,0.00079203956,0.00064277323,0.00010548277,0.0005938918,0.0012348797,0.010502401,0.0029629893,0.58371806,0.025155203,0.37409702],"study_design_scores_gemma":[0.000023192566,0.00003431734,0.0010171612,0.0011221623,0.00012669252,0.001041084,0.000832151,0.082847245,0.0049279127,0.43781507,0.47014904,0.00006393763],"about_ca_topic_score_codex":0.01022297,"about_ca_topic_score_gemma":0.014222894,"teacher_disagreement_score":0.01022297,"about_ca_system_score_codex":0.0021561945,"about_ca_system_score_gemma":0.003630154,"threshold_uncertainty_score":0.020326912},"labels":[],"label_agreement":null},{"id":"W59764719","doi":"10.1007/978-3-642-21538-4_24","title":"Developing a Secure Distributed OSGi Cloud Computing Infrastructure for Sharing Health Records","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Lakehead University","funders":"","keywords":"Cloud computing; Computer science; Cloud computing security; Scalability; Computer security; Single sign-on; World Wide Web; Database; Authentication (law); Operating system","score_opus":0.03589130477048965,"score_gpt":0.2851488729149171,"score_spread":0.24925756814442743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59764719","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.07852016,0.00024183083,0.8962321,0.00063522,0.00016892402,0.00096734264,0.000135186,0.013371206,0.009728074],"genre_scores_gemma":[0.37843165,0.0002755634,0.60988075,0.00020965056,0.000045009674,0.00022325137,0.0006925687,0.00068591227,0.009555589],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999408,0.00008522795,0.000040945888,0.000078796365,0.00025747242,0.00012957101],"domain_scores_gemma":[0.99925596,0.00009702924,0.000054788805,0.0002945545,0.00017475427,0.00012291079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010957156,0.00032943932,0.00028083226,0.0005129432,0.00068093353,0.0014437663,0.0017533596,0.0006848139,0.0026227443],"category_scores_gemma":[0.0017146318,0.0004342522,0.0005032293,0.0007106403,0.0005000729,0.0014140354,0.0022386836,0.0011487331,0.0012407599],"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.00082475785,0.0010060072,0.010469118,0.00042741033,0.00021193436,0.0020881493,0.0016504346,0.069248006,0.20595655,0.086989544,0.03882468,0.58230346],"study_design_scores_gemma":[0.00023569111,0.00058735005,0.0066190944,0.0000939308,0.00013574041,0.0013875581,0.000587684,0.7442042,0.13092595,0.019004097,0.09610531,0.00011341234],"about_ca_topic_score_codex":0.0030304915,"about_ca_topic_score_gemma":0.003924827,"teacher_disagreement_score":0.0030304915,"about_ca_system_score_codex":0.00082627457,"about_ca_system_score_gemma":0.002156718,"threshold_uncertainty_score":0.0087739825},"labels":[],"label_agreement":null},{"id":"W600165676","doi":"10.1007/978-3-319-18038-0_16","title":"Reliable Early Classification on Multivariate Time Series with Numerical and Categorical Attributes","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Categorical variable; Multivariate statistics; Univariate; Computer science; Classifier (UML); Series (stratigraphy); Time series; Data mining; Multivariate analysis; Artificial intelligence; Machine learning","score_opus":0.028808606617653134,"score_gpt":0.23475800829469595,"score_spread":0.20594940167704281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W600165676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048172306,0.0012512981,0.9468704,0.0005737822,0.00017935276,0.00003157705,0.00027290714,0.00083217013,0.0018161548],"genre_scores_gemma":[0.6975119,0.0015687722,0.28625992,0.00021440293,0.000916518,0.00012453408,0.00172473,0.00022282753,0.011456398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816006,0.00056142214,0.00014818512,0.00031881526,0.0006085047,0.00020309146],"domain_scores_gemma":[0.98210734,0.011490157,0.0010770308,0.002150409,0.0027964972,0.00037861255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004299872,0.00090981723,0.0014764696,0.0020180189,0.0005196802,0.0019379726,0.0017367128,0.0014552827,0.00211315],"category_scores_gemma":[0.017561985,0.00044842844,0.0009085092,0.0018995589,0.0008472786,0.0032779316,0.0015802048,0.0027022464,0.0015259774],"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.00093646115,0.00022277464,0.009629739,0.0003181148,0.000098333134,0.00024286908,0.0002636925,0.10810809,0.013320648,0.043847457,0.0116723785,0.8113395],"study_design_scores_gemma":[0.00000954213,0.00007604555,0.0022931085,0.000031300457,0.000020861735,0.00008438044,0.000042606993,0.94617236,0.0041741757,0.045490295,0.0015837788,0.000021502537],"about_ca_topic_score_codex":0.0011427619,"about_ca_topic_score_gemma":0.0012522228,"teacher_disagreement_score":0.004299872,"about_ca_system_score_codex":0.00067976705,"about_ca_system_score_gemma":0.0006495382,"threshold_uncertainty_score":0.022740185},"labels":[],"label_agreement":null},{"id":"W600309345","doi":"10.1007/978-3-319-19069-3_12","title":"Handling Regulatory Goal Model Families as Software Product Lines","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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 Ottawa","funders":"","keywords":"Feature model; Software product line; Consistency (knowledge bases); Computer science; Scalability; Feature (linguistics); Product (mathematics); Process (computing); Software engineering; Variable (mathematics); Software; Scale (ratio); Risk analysis (engineering); Process management; Software development; Engineering; Programming language; Artificial intelligence; Database; Business","score_opus":0.048941662762736635,"score_gpt":0.2910306614201211,"score_spread":0.24208899865738442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W600309345","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.019461738,0.00013732022,0.9579608,0.00033787522,0.000046062534,0.00011052936,0.00012266099,0.0014028733,0.020420061],"genre_scores_gemma":[0.3428477,0.0004930899,0.6194394,0.00029138356,0.00006779427,0.00038721162,0.0008715486,0.0018822219,0.033719584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977042,0.0008429266,0.00013581084,0.00035122447,0.00078280555,0.00018302347],"domain_scores_gemma":[0.99622416,0.0020647023,0.0003710276,0.0007058441,0.00049421674,0.00014003397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026802004,0.000905431,0.00041184083,0.0012145026,0.0009386042,0.0034494807,0.001557605,0.0013743535,0.009191075],"category_scores_gemma":[0.008315189,0.0009513688,0.0012584943,0.001188797,0.00170075,0.0057831598,0.0023414956,0.0031230694,0.0022761587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005866529,0.00007773816,0.00039791214,0.00011899981,0.000025768692,0.00040969686,0.0008813875,0.025128955,0.0036358854,0.9030868,0.004740828,0.061437406],"study_design_scores_gemma":[0.000034887496,0.000054421227,0.00011900256,0.000095852505,0.00004531687,0.00023788902,0.00029717176,0.13177213,0.0056488435,0.81856614,0.043102212,0.000026060816],"about_ca_topic_score_codex":0.0015318124,"about_ca_topic_score_gemma":0.0015459366,"teacher_disagreement_score":0.009191075,"about_ca_system_score_codex":0.0010160654,"about_ca_system_score_gemma":0.0010579948,"threshold_uncertainty_score":0.030747175},"labels":[],"label_agreement":null},{"id":"W60275682","doi":"10.1007/978-3-642-39094-4_26","title":"Hyperspectral Images as Function-Valued Mappings, Their Self-similarity and a Class of Fractal Transforms","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hyperspectral imaging; Affine transformation; Fractal; Grayscale; Similarity (geometry); Computer science; Pattern recognition (psychology); Artificial intelligence; Self-similarity; Scale (ratio); Set (abstract data type); Fractal analysis; Mathematics; Fractal compression; Image (mathematics); Algorithm; Image processing; Fractal dimension; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.013857577138755225,"score_gpt":0.2404812954747537,"score_spread":0.22662371833599848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60275682","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.1579311,0.027591644,0.73613816,0.0015752284,0.0007467681,0.00006194424,0.0003210952,0.0003198632,0.0753142],"genre_scores_gemma":[0.7273823,0.017738234,0.19778977,0.0005318204,0.0018419501,0.00010464198,0.00047862218,0.000255803,0.05387687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.00004431446,0.000013056699,0.000052242787,0.00007756601,0.000013959984],"domain_scores_gemma":[0.9996369,0.00016183346,0.00006249448,0.000047568738,0.00006817424,0.000023047294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044187042,0.00047771723,0.00043820095,0.0014368547,0.00033060124,0.001841509,0.0003818927,0.0008773843,0.0013340522],"category_scores_gemma":[0.0012516404,0.0002816267,0.00048463055,0.0011625421,0.0013715926,0.0023399063,0.00053077255,0.0013327212,0.00037658797],"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.000023923709,0.000017857028,0.0001946408,0.00012845172,0.00001547565,0.000102841965,0.00027918152,0.005506485,0.010249878,0.9334473,0.0021564516,0.04787765],"study_design_scores_gemma":[0.0000067389824,0.00003884435,0.0010382998,0.00002957705,0.000012367811,0.0007703658,0.000094541545,0.054215357,0.0027362376,0.9273968,0.013639007,0.000021967538],"about_ca_topic_score_codex":0.00020122986,"about_ca_topic_score_gemma":0.00016644411,"teacher_disagreement_score":0.001841509,"about_ca_system_score_codex":0.00033694188,"about_ca_system_score_gemma":0.00017231784,"threshold_uncertainty_score":0.004462838},"labels":[],"label_agreement":null},{"id":"W60601491","doi":"10.1007/978-3-540-72665-4_36","title":"Learning Network Topology from Simple Sensor Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"McGill University","funders":"","keywords":"Heuristics; Timestamp; Simple (philosophy); Set (abstract data type); Computer science; Wireless sensor network; Topology (electrical circuits); Greedy algorithm; Algorithm; Network topology; Data set; Sliding window protocol; Theoretical computer science; Window (computing); Data mining; Mathematics; Real-time computing; Artificial intelligence","score_opus":0.02662397086948446,"score_gpt":0.2547348788803867,"score_spread":0.22811090801090225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60601491","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.027028508,0.00018983861,0.9702003,0.000106999,0.000033751963,0.00003845849,0.00031365966,0.0010379283,0.0010506113],"genre_scores_gemma":[0.56064874,0.00095109234,0.4307743,0.0000842376,0.00013499518,0.00018392132,0.0022938384,0.00030609252,0.0046227365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998185,0.000035852347,0.000013056284,0.00006604237,0.000053872816,0.000012637531],"domain_scores_gemma":[0.99797326,0.0012820456,0.00015010624,0.00034479605,0.00019368088,0.000056092693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046871908,0.0007958122,0.00080437213,0.0010477753,0.00022566688,0.0007299042,0.0012866216,0.0006190266,0.0019204033],"category_scores_gemma":[0.0046958867,0.0006698731,0.0005366379,0.001133723,0.00045578709,0.0024422307,0.00097631227,0.0010343485,0.0007084342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008616377,0.000039957835,0.0019638895,0.0001357602,0.000049059534,0.000078578654,0.00006875211,0.76925623,0.0029938957,0.0053015463,0.0019658739,0.21806027],"study_design_scores_gemma":[0.0000034787236,0.000015041628,0.0002630859,0.000008088799,0.0000057473,0.00003468241,0.000011224243,0.98750335,0.000761926,0.010960837,0.00042867535,0.0000039431848],"about_ca_topic_score_codex":0.0015896661,"about_ca_topic_score_gemma":0.0036270753,"teacher_disagreement_score":0.0019204033,"about_ca_system_score_codex":0.00039766944,"about_ca_system_score_gemma":0.0002796745,"threshold_uncertainty_score":0.0064243674},"labels":[],"label_agreement":null},{"id":"W60686164","doi":"10.1007/978-3-642-25566-3_40","title":"Sequential Model-Based Optimization for General Algorithm Configuration","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2377,"is_retracted":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":"Solver; Computer science; Algorithm; Categorical variable; Mathematical optimization; Satisfiability; Integer programming; State (computer science); Optimization problem; Search algorithm; State space; Mathematics; Machine learning","score_opus":0.026164776281192334,"score_gpt":0.26749758618354724,"score_spread":0.2413328099023549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60686164","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.0028432456,0.00013416489,0.9934348,0.00005289417,0.000035354133,0.000055271663,0.000037255573,0.00043139665,0.0029755428],"genre_scores_gemma":[0.4251452,0.00036758278,0.5631585,0.00015413295,0.0000967744,0.0007861002,0.00040676165,0.0007836013,0.009101368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989687,0.00045174678,0.000039851664,0.00016313164,0.00027588665,0.00010059849],"domain_scores_gemma":[0.99839395,0.0010247183,0.00009995732,0.00021559937,0.0002075213,0.000058109854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016653412,0.001775204,0.0021757933,0.0007076579,0.0006251879,0.0011343344,0.0021628302,0.0014750262,0.009855783],"category_scores_gemma":[0.0049166447,0.0013055787,0.001339748,0.0012269474,0.00085519755,0.001942891,0.0019183343,0.0017440942,0.0012819617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005862716,0.000025490059,0.00006596276,0.000060202106,0.000019879677,0.00001620018,0.000012594809,0.97034204,0.00038615297,0.0064986045,0.0010193058,0.021494962],"study_design_scores_gemma":[0.0000064043747,0.000013011742,0.000017163842,0.00000251529,0.0000032553405,0.000004587291,0.0000014348634,0.9956923,0.000091713635,0.0039519,0.00021367581,0.000001937667],"about_ca_topic_score_codex":0.004568542,"about_ca_topic_score_gemma":0.0055337213,"teacher_disagreement_score":0.009855783,"about_ca_system_score_codex":0.00112615,"about_ca_system_score_gemma":0.0017168238,"threshold_uncertainty_score":0.032970846},"labels":[],"label_agreement":null},{"id":"W610025348","doi":"10.1007/978-3-319-13075-0_43","title":"Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Equivalence class (music); Equivalence (formal languages); Space (punctuation); Data structure; Combinatorics; Representation (politics); Discrete mathematics; Set (abstract data type); Quotient space (topology); Mathematics; Equivalence relation; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.03940161434373402,"score_gpt":0.2984906770929197,"score_spread":0.2590890627491857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W610025348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06123121,0.0017823518,0.9181419,0.0016398121,0.000115485105,0.00015439148,0.00088841846,0.0019545308,0.014091915],"genre_scores_gemma":[0.58852565,0.002101754,0.39581293,0.000538976,0.0003702177,0.0005364392,0.0021001603,0.0010936734,0.008920171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956618,0.0021122831,0.00022101308,0.00048161036,0.0012080969,0.00031530394],"domain_scores_gemma":[0.9796417,0.012396308,0.00044290247,0.0054310667,0.0016073796,0.00048065378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032357264,0.00086767465,0.0016211115,0.0015985842,0.0009844501,0.004988263,0.0026856689,0.0019904408,0.016211083],"category_scores_gemma":[0.022630487,0.0005524992,0.0008521253,0.0031268052,0.0017836415,0.011675687,0.0046507176,0.0030923162,0.0029838954],"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.0017469807,0.00040597876,0.0010313052,0.0006054274,0.000055324374,0.00011139663,0.00063033856,0.045130398,0.020248182,0.359142,0.011593792,0.55929893],"study_design_scores_gemma":[0.0001385992,0.00032559,0.00088284095,0.00018071108,0.00007853562,0.0003651582,0.00042814185,0.4491174,0.015410083,0.52091974,0.012093304,0.000059922044],"about_ca_topic_score_codex":0.0008462963,"about_ca_topic_score_gemma":0.0012770924,"teacher_disagreement_score":0.016211083,"about_ca_system_score_codex":0.0013531897,"about_ca_system_score_gemma":0.0011823192,"threshold_uncertainty_score":0.054231524},"labels":[],"label_agreement":null},{"id":"W61028124","doi":"10.1007/978-3-642-31623-4_22","title":"State Complexity of Projection and Quotient on Unranked Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Quotient; Concatenation (mathematics); Tree (set theory); State (computer science); String (physics); Combinatorics; Computer science; Finite-state machine; Discrete mathematics; Automaton; Tree automaton; Mathematics; Theoretical computer science; Algorithm","score_opus":0.030803970627065858,"score_gpt":0.24875383992393624,"score_spread":0.21794986929687038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61028124","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.796293,0.000834548,0.16509321,0.0018039254,0.000092861344,0.00009035054,0.0012158835,0.0005196485,0.03405653],"genre_scores_gemma":[0.979983,0.00031400897,0.012778716,0.00006317001,0.00011190794,0.00007553679,0.00071751996,0.00013030965,0.0058258297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978339,0.00040272684,0.00014755945,0.00039255575,0.0007716889,0.00045160728],"domain_scores_gemma":[0.98909014,0.007920191,0.0005873584,0.0010424644,0.00073267147,0.00062721386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012957804,0.0005249342,0.0015163443,0.0012868936,0.0013512727,0.0062571936,0.0018217214,0.001469126,0.010278303],"category_scores_gemma":[0.009664638,0.0006651823,0.0015513381,0.0019484774,0.0028874113,0.014281216,0.002622462,0.0030700779,0.0005830553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026916023,0.00009930704,0.0014534188,0.00013189361,0.000028196142,0.0001387626,0.0006123742,0.029646216,0.0022049204,0.94830155,0.0017287928,0.015385517],"study_design_scores_gemma":[0.000021456271,0.000023887036,0.00046765982,0.0000101257865,0.000014614822,0.000054511045,0.00007457915,0.07898066,0.001079378,0.9187857,0.00046903596,0.000018366494],"about_ca_topic_score_codex":0.0027637188,"about_ca_topic_score_gemma":0.002425746,"teacher_disagreement_score":0.010278303,"about_ca_system_score_codex":0.0026374739,"about_ca_system_score_gemma":0.0016117954,"threshold_uncertainty_score":0.03438437},"labels":[],"label_agreement":null},{"id":"W6116489","doi":"10.1007/978-3-642-33486-3_31","title":"Efficient Bi-objective Team Formation in Social Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scalability; Mathematical optimization; Approximation algorithm; Heuristic; Graph; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.012026271862673434,"score_gpt":0.22966458781899918,"score_spread":0.21763831595632574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6116489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03020014,0.0002984202,0.96384674,0.00031937167,0.00007287425,0.00014193091,0.00009501386,0.00019724239,0.004828185],"genre_scores_gemma":[0.75516796,0.00046333636,0.22916014,0.00018522066,0.0001852028,0.00074281613,0.00039276783,0.00020765778,0.013494965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788994,0.0009607816,0.00008737664,0.00038726238,0.00034301923,0.00033150346],"domain_scores_gemma":[0.99099463,0.0068875235,0.0005244996,0.0005188925,0.00050780614,0.00056671054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003224962,0.0017856176,0.003108305,0.0011520814,0.0015095026,0.0018628618,0.0038176551,0.002867659,0.004373582],"category_scores_gemma":[0.010387932,0.0015545476,0.0012635299,0.0015417815,0.0016008202,0.0031496363,0.0051609525,0.0020449844,0.0010769839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172619,0.000079651225,0.00041498925,0.00010403628,0.00005714658,0.00005898681,0.000119704026,0.95595074,0.00066700374,0.018921608,0.0016437862,0.021850657],"study_design_scores_gemma":[0.000013822608,0.000026243839,0.00004023646,0.000006144524,0.000005737248,0.000009841092,0.000021903907,0.9887439,0.0001312123,0.0108123105,0.00018510713,0.0000035447194],"about_ca_topic_score_codex":0.0034673973,"about_ca_topic_score_gemma":0.00338964,"teacher_disagreement_score":0.004373582,"about_ca_system_score_codex":0.0013548642,"about_ca_system_score_gemma":0.0014689869,"threshold_uncertainty_score":0.017055452},"labels":[],"label_agreement":null},{"id":"W612744589","doi":"10.1007/b93926","title":"Mobile Agents for Telecommunication Applications","year":2003,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":77,"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; Telecommunications; Mobile telephony; Computer network; Mobile radio","score_opus":0.0177303766442928,"score_gpt":0.26957275537800235,"score_spread":0.25184237873370957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W612744589","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057819146,0.1136029,0.40650487,0.002007454,0.0065596355,0.000402195,0.0005970569,0.0048270333,0.45971692],"genre_scores_gemma":[0.033705212,0.04765922,0.1754343,0.0010123388,0.0016402812,0.0004485939,0.0013115306,0.00094574713,0.73784274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998411,0.000028256727,0.000008160639,0.000021971844,0.00008518767,0.000015363648],"domain_scores_gemma":[0.99982786,0.00005965315,0.000015162981,0.00002487695,0.00005261872,0.000019897065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018100704,0.0014371017,0.00079581485,0.00078886177,0.00048676276,0.0017883121,0.0010112036,0.0013404296,0.028998362],"category_scores_gemma":[0.00046008328,0.00040046754,0.00032077316,0.001150346,0.00026354266,0.0018875404,0.0009806042,0.0013972915,0.021593185],"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.0001153645,0.000146249,0.00012046774,0.00077336584,0.000044064367,0.00026726784,0.00025539348,0.002922252,0.0122347325,0.103018574,0.2054572,0.67464507],"study_design_scores_gemma":[0.00002980308,0.00007214152,0.0001561397,0.00020403277,0.00003027541,0.0003934643,0.00005392021,0.0057135806,0.002087943,0.023595968,0.9676481,0.000014738182],"about_ca_topic_score_codex":0.00040299373,"about_ca_topic_score_gemma":0.00075275253,"teacher_disagreement_score":0.028998362,"about_ca_system_score_codex":0.0002517591,"about_ca_system_score_gemma":0.00029458784,"threshold_uncertainty_score":0.09700924},"labels":[],"label_agreement":null},{"id":"W615032608","doi":"10.1007/978-3-319-07467-2_46","title":"Configuring the Webpage Content through Conditional Constraints and Preferences","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Computer science; Web page; Personalization; Constraint (computer-aided design); Set (abstract data type); Content (measure theory); Preference; Web content; Information retrieval; Expressive power; World Wide Web; Theoretical computer science; Programming language; Mathematics","score_opus":0.03434033797897846,"score_gpt":0.24128639823508158,"score_spread":0.20694606025610313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W615032608","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.09560289,0.0005126572,0.8700168,0.0003312577,0.00010589389,0.00030176173,0.00080216944,0.005536389,0.02679023],"genre_scores_gemma":[0.7336656,0.00046541332,0.25020236,0.00021660085,0.00006836355,0.00031367232,0.0009571397,0.0018757625,0.01223506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982792,0.00052816054,0.00012443324,0.00035497564,0.0005284926,0.00018474435],"domain_scores_gemma":[0.9957563,0.002051907,0.00022443393,0.0010935382,0.0005664265,0.000307247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018268331,0.00093629974,0.0006577154,0.0010340962,0.00051460654,0.0032159765,0.0017604111,0.0006842894,0.0073230597],"category_scores_gemma":[0.00839008,0.0006332552,0.0005807329,0.0015582866,0.00065422786,0.00468236,0.0015649877,0.001517895,0.002260984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010164623,0.000982417,0.007857942,0.0008105961,0.00020329418,0.00076420035,0.0008221371,0.1865038,0.11728416,0.09124523,0.02128011,0.5712296],"study_design_scores_gemma":[0.000059547627,0.00012727504,0.002494352,0.00009257796,0.00012142933,0.00029539267,0.0003298266,0.84022176,0.051776294,0.078418076,0.02595399,0.00010944142],"about_ca_topic_score_codex":0.0017263885,"about_ca_topic_score_gemma":0.0036853154,"teacher_disagreement_score":0.0073230597,"about_ca_system_score_codex":0.00061884226,"about_ca_system_score_gemma":0.00083303184,"threshold_uncertainty_score":0.024498045},"labels":[],"label_agreement":null},{"id":"W61614352","doi":"10.1007/978-3-642-23456-9_94","title":"A Flash-Based Game for Employee Doing On-the-Job Training","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Athabasca University","funders":"","keywords":"Computer science; Training (meteorology); Flash (photography); Human–computer interaction; Multimedia; Visual arts","score_opus":0.07724157593713205,"score_gpt":0.32074474231983563,"score_spread":0.24350316638270358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61614352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22833903,0.002113771,0.40514064,0.0017465348,0.001244279,0.0013780167,0.0018497988,0.014420931,0.34376702],"genre_scores_gemma":[0.43922055,0.001694879,0.22739093,0.0012742269,0.00012507621,0.0016160152,0.002024594,0.0008380911,0.32581565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992,0.000015941769,0.000003003124,0.0000151217755,0.00002558485,0.00002025471],"domain_scores_gemma":[0.9998708,0.00005119986,0.0000036763174,0.0000072998455,0.000015724569,0.000051283572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019744503,0.0010589381,0.00032772392,0.00032291425,0.00035597358,0.00077993853,0.0011237379,0.00087216054,0.032504126],"category_scores_gemma":[0.0004010142,0.00017266572,0.00031933174,0.00014721515,0.00018222198,0.0008074794,0.0013139097,0.000573586,0.0045587295],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020883502,0.0038741059,0.0024544762,0.0010139364,0.000097382275,0.0011177115,0.0021254339,0.009621351,0.046757437,0.02470211,0.1647155,0.7414321],"study_design_scores_gemma":[0.0013044133,0.005207311,0.024413718,0.0011685472,0.0003310773,0.004289729,0.0042501786,0.1417576,0.038675882,0.06635732,0.71192515,0.00031909795],"about_ca_topic_score_codex":0.0007527952,"about_ca_topic_score_gemma":0.0018324702,"teacher_disagreement_score":0.032504126,"about_ca_system_score_codex":0.00025042827,"about_ca_system_score_gemma":0.00033397216,"threshold_uncertainty_score":0.10873711},"labels":[],"label_agreement":null},{"id":"W61744817","doi":"10.1007/978-3-642-33293-7_24","title":"Enumerating Neighbour and Closest Strings","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; String (physics); Alphabet; Combinatorics; Mathematics; Enumeration; Constant (computer programming); Running time; String searching algorithm; Upper and lower bounds; Commentz-Walter algorithm; Discrete mathematics; Algorithm; Pattern matching; Computer science; Mathematical analysis","score_opus":0.014964112829556363,"score_gpt":0.23735948376744867,"score_spread":0.2223953709378923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61744817","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.03712713,0.0023284499,0.9063199,0.0007342237,0.0006542455,0.00015332561,0.0013255979,0.002037568,0.049319666],"genre_scores_gemma":[0.13912313,0.0020168836,0.80889183,0.00037786053,0.00036141012,0.0002536856,0.005223375,0.001161952,0.04258988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974221,0.00044641364,0.0002476514,0.0005221768,0.0011921877,0.00016941542],"domain_scores_gemma":[0.9942339,0.0031569109,0.00021561208,0.0015739511,0.00066831574,0.0001512349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145847,0.00074476347,0.0018544226,0.003649883,0.0014766017,0.002906355,0.0031932858,0.0018403358,0.014839795],"category_scores_gemma":[0.015699847,0.0007651592,0.0013263362,0.0057576774,0.001696462,0.007629975,0.004546707,0.002318524,0.006457827],"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.00029245942,0.00010977477,0.0011034493,0.00075072446,0.000056478064,0.00019296653,0.0006450007,0.023474107,0.005052766,0.3668787,0.022343373,0.57910013],"study_design_scores_gemma":[0.000028859971,0.000067751025,0.0003606769,0.0001989178,0.00005230647,0.00082203624,0.00022795296,0.08451544,0.0058096643,0.8707556,0.03711236,0.000048396712],"about_ca_topic_score_codex":0.0008306974,"about_ca_topic_score_gemma":0.0013560742,"teacher_disagreement_score":0.014839795,"about_ca_system_score_codex":0.0010272763,"about_ca_system_score_gemma":0.0009746133,"threshold_uncertainty_score":0.049644053},"labels":[],"label_agreement":null},{"id":"W61801867","doi":"10.1007/978-3-642-38568-1_6","title":"Augmentation of Paramedian 3D Ultrasound Images of the Spine","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anesthesia and Pain Management","field":"Medicine","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 British Columbia","funders":"","keywords":"Ultrasound; 3D ultrasound; Medicine; Sagittal plane; Epidural space; Computer science; Biomedical engineering; Radiology; Computer vision; Surgery","score_opus":0.012233023574925823,"score_gpt":0.2470199287917714,"score_spread":0.2347869052168456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61801867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090771616,0.024426488,0.7326043,0.0042193714,0.0040790285,0.00042539873,0.0014456793,0.0055188388,0.13650928],"genre_scores_gemma":[0.43144563,0.023976546,0.46790785,0.0019752383,0.001925323,0.00034242496,0.0010100356,0.0013874886,0.070029445],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977154,0.00005127902,0.000017149117,0.000021978405,0.000119135904,0.000018854606],"domain_scores_gemma":[0.99927276,0.00042601992,0.000032597814,0.00013711005,0.00010339487,0.00002807348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004720895,0.0005229855,0.00029042462,0.00072175224,0.00017158856,0.0013900641,0.0006480078,0.00075302017,0.012405439],"category_scores_gemma":[0.0019992285,0.00044429547,0.00057725154,0.00045623045,0.00035702134,0.0008324161,0.00091330963,0.00096509914,0.0028166051],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003768791,0.00007065718,0.0010823341,0.0010438656,0.000036873847,0.002150976,0.00043569563,0.010595061,0.15162793,0.0085058035,0.018307708,0.8057663],"study_design_scores_gemma":[0.00014634042,0.0014262486,0.015819382,0.0018061034,0.00031091674,0.082051165,0.0006927874,0.14928412,0.20389919,0.020126194,0.5241075,0.00033005758],"about_ca_topic_score_codex":0.00044067035,"about_ca_topic_score_gemma":0.000693579,"teacher_disagreement_score":0.012405439,"about_ca_system_score_codex":0.00015381622,"about_ca_system_score_gemma":0.00033145648,"threshold_uncertainty_score":0.04150027},"labels":[],"label_agreement":null},{"id":"W6182124","doi":"10.1007/978-3-642-30353-1_19","title":"Predicting Good Propagation Methods for Constraint Satisfaction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Saskatchewan","funders":"","keywords":"Constraint satisfaction problem; Oracle; Local consistency; Solver; Computer science; Constraint satisfaction; Limit (mathematics); A priori and a posteriori; Constraint (computer-aided design); Simple (philosophy); Mathematical optimization; Problem solver; Variety (cybernetics); Artificial intelligence; Machine learning; Mathematics","score_opus":0.024232005713215918,"score_gpt":0.2973156277035197,"score_spread":0.2730836219903038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6182124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05031398,0.0070461542,0.92332196,0.0020436156,0.0005585575,0.00032638712,0.0024755674,0.004136601,0.009777198],"genre_scores_gemma":[0.24560697,0.0023946688,0.7359131,0.0005730517,0.0005454772,0.0003508217,0.0051762173,0.0012932185,0.008146448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969674,0.0009937591,0.00014230158,0.00066184433,0.0009886264,0.00024617492],"domain_scores_gemma":[0.9709815,0.022954712,0.00080645515,0.0019121214,0.0028750561,0.00047027934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618113,0.0021611566,0.0013872009,0.0041682585,0.0010783806,0.0020764344,0.003134177,0.0031988532,0.006846524],"category_scores_gemma":[0.02551448,0.00100768,0.001827414,0.0038309984,0.0012747919,0.0039308416,0.0013332207,0.0042588757,0.0024509658],"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.00036203492,0.00043380144,0.008611652,0.0006502608,0.00028854446,0.00010947704,0.00012359013,0.39024258,0.0033888186,0.02382476,0.067574754,0.5043897],"study_design_scores_gemma":[0.000022529593,0.00003436198,0.00054798706,0.00004923286,0.000030031137,0.000039037575,0.000021490367,0.9757447,0.0013289825,0.020382643,0.0017840164,0.0000149312245],"about_ca_topic_score_codex":0.0072476696,"about_ca_topic_score_gemma":0.015018952,"teacher_disagreement_score":0.0072476696,"about_ca_system_score_codex":0.0014244642,"about_ca_system_score_gemma":0.001788386,"threshold_uncertainty_score":0.024423182},"labels":[],"label_agreement":null},{"id":"W6184827","doi":"10.1007/978-3-642-13059-5_40","title":"Winner Determination Based on Preference Elicitation Methods","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Computer science; Reverse auction; Purchasing; Flexibility (engineering); Preference; Product (mathematics); Procurement; Common value auction; Operations research; Artificial intelligence; Microeconomics; Marketing; Mathematics","score_opus":0.11267958137954108,"score_gpt":0.4111009457995728,"score_spread":0.2984213644200317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6184827","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058543645,0.00011985381,0.98886824,0.000087244,0.00003317351,0.00020018076,0.00008166798,0.00014206278,0.004613157],"genre_scores_gemma":[0.16065651,0.00030492296,0.8313101,0.000082460145,0.00006845764,0.0006679817,0.00035217605,0.00011924579,0.0064381277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881855,0.0076957643,0.0005788744,0.0007009726,0.0024511563,0.000387649],"domain_scores_gemma":[0.96720785,0.026779499,0.0007343761,0.0019359331,0.0029677444,0.0003746507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010296748,0.0014083138,0.002458794,0.0025547515,0.0011544686,0.0032549053,0.0024827938,0.0011039381,0.012007339],"category_scores_gemma":[0.030521095,0.00079377677,0.0016266806,0.0035111096,0.0008137751,0.0036377094,0.0024881482,0.0021599159,0.0025476036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009965727,0.0004285008,0.0016147239,0.00085288164,0.00039605022,0.00013268551,0.00063413463,0.06703834,0.0068275547,0.15708874,0.009020154,0.75496966],"study_design_scores_gemma":[0.0002067958,0.00020890328,0.0010100327,0.00010439482,0.00012353773,0.00019464924,0.00023081973,0.7594358,0.006863043,0.22547409,0.0060483078,0.0000996606],"about_ca_topic_score_codex":0.0011845293,"about_ca_topic_score_gemma":0.001987585,"teacher_disagreement_score":0.012007339,"about_ca_system_score_codex":0.0009821946,"about_ca_system_score_gemma":0.002162,"threshold_uncertainty_score":0.054455042},"labels":[],"label_agreement":null},{"id":"W61966385","doi":"10.1007/978-3-319-06483-3_28","title":"Robust Features for Detecting Evasive Spammers in Twitter","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","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 Regina; University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.03050156499851135,"score_gpt":0.2469289544693016,"score_spread":0.21642738947079027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61966385","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.62820035,0.0041374457,0.34799638,0.00071767764,0.0005664331,0.00030749774,0.0029915618,0.006578448,0.008504219],"genre_scores_gemma":[0.9288676,0.00052650174,0.061657283,0.00010764831,0.00042044267,0.00012017159,0.0024114698,0.00017088559,0.0057179276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933136,0.00008984468,0.00004207969,0.00010141859,0.00030749702,0.00012786067],"domain_scores_gemma":[0.9988116,0.00042217565,0.00021900931,0.00016245028,0.00031917007,0.00006561975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178113,0.00086924154,0.0007610911,0.0026502083,0.00044094873,0.0008597272,0.00058452896,0.0010939024,0.0019463911],"category_scores_gemma":[0.0025812702,0.00027128105,0.00050562766,0.0011951785,0.0003033688,0.0012952412,0.00084126124,0.0007171828,0.0021134375],"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.0015888853,0.0005601905,0.026469475,0.00034396414,0.0001596377,0.00042776525,0.0001930272,0.02125615,0.1493908,0.0019813052,0.019519482,0.7781094],"study_design_scores_gemma":[0.00007256741,0.0009205013,0.061384577,0.00006779921,0.00023940888,0.0010504287,0.00038477083,0.8035072,0.11490727,0.005323253,0.01202902,0.00011325485],"about_ca_topic_score_codex":0.0009163552,"about_ca_topic_score_gemma":0.0013657653,"teacher_disagreement_score":0.0026502083,"about_ca_system_score_codex":0.00029117122,"about_ca_system_score_gemma":0.0002708908,"threshold_uncertainty_score":0.0065113306},"labels":[],"label_agreement":null},{"id":"W620315120","doi":"10.1007/978-3-319-18117-2_22","title":"Content-Based Recommender System Enriched with Wordnet Synsets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Ottawa","funders":"","keywords":"WordNet; Recommender system; Computer science; Collaborative filtering; Content (measure theory); Information retrieval; Artificial intelligence; Mathematics","score_opus":0.056048351636253095,"score_gpt":0.2547589196552996,"score_spread":0.19871056801904652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W620315120","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.2352368,0.013607679,0.63375294,0.0020049135,0.0027751215,0.0017355937,0.038003944,0.03518899,0.03769408],"genre_scores_gemma":[0.39534828,0.0030105992,0.5308673,0.00068008335,0.00073646696,0.00060393196,0.044939343,0.000688265,0.023125714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989498,0.00019137179,0.00012933277,0.00031892516,0.00035326384,0.000057211324],"domain_scores_gemma":[0.99806017,0.0006876376,0.00007607604,0.00023878479,0.0008414328,0.00009590133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097282283,0.0015148008,0.0013393245,0.00646026,0.0008777743,0.0014154629,0.001117187,0.0013221526,0.008407708],"category_scores_gemma":[0.0047300006,0.00053514534,0.0010097697,0.0042197737,0.00016908396,0.0030229837,0.001097342,0.00081819703,0.008495114],"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.001923194,0.0010821404,0.0154539915,0.0018494612,0.001190975,0.0011034163,0.0005199767,0.008940464,0.061334796,0.005274912,0.095951125,0.80537546],"study_design_scores_gemma":[0.0005746785,0.0012301395,0.025124038,0.00048998324,0.0024979746,0.002360554,0.0008760507,0.791103,0.046822004,0.015279091,0.113216914,0.00042558223],"about_ca_topic_score_codex":0.007763665,"about_ca_topic_score_gemma":0.02111348,"teacher_disagreement_score":0.008407708,"about_ca_system_score_codex":0.00057909044,"about_ca_system_score_gemma":0.0010373199,"threshold_uncertainty_score":0.028126597},"labels":[],"label_agreement":null},{"id":"W62212937","doi":"10.1007/978-3-642-30353-1_16","title":"Clustering Based One-Class Classification for Compliance Verification of the Comprehensive Nuclear-Test-Ban Treaty","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","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 Ottawa","funders":"","keywords":"Cluster analysis; Computer science; Class (philosophy); Artificial intelligence; Data mining; Credence; Machine learning","score_opus":0.06428016657807852,"score_gpt":0.27747068347663945,"score_spread":0.21319051689856094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62212937","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.06453844,0.0007118477,0.92159355,0.00058677245,0.00023343734,0.00025093777,0.00065992546,0.0021445565,0.009280473],"genre_scores_gemma":[0.7130928,0.00030646153,0.2741501,0.0002300693,0.00020130714,0.00021869822,0.002351611,0.00034177856,0.0091072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996705,0.00074180716,0.00017178684,0.0006851349,0.001281545,0.00041466067],"domain_scores_gemma":[0.9959365,0.0015275996,0.00029303756,0.00086899387,0.0012584509,0.00011534403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984785,0.0010366712,0.0018223563,0.0022911832,0.0017914737,0.001898861,0.0035144112,0.0019328044,0.0037064955],"category_scores_gemma":[0.0064605754,0.00028662497,0.001441078,0.0017184821,0.0010712056,0.0022520572,0.0013611296,0.0022473969,0.0013614467],"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.0008049046,0.0005744289,0.010471658,0.0002816671,0.00027877218,0.0003927851,0.0004451895,0.1691675,0.01297196,0.08147204,0.026752643,0.6963864],"study_design_scores_gemma":[0.000012479419,0.000058621903,0.002145591,0.000021635049,0.000029012888,0.00009105786,0.00009311985,0.9616785,0.0038297907,0.029585734,0.002429743,0.000024740988],"about_ca_topic_score_codex":0.011637513,"about_ca_topic_score_gemma":0.013840257,"teacher_disagreement_score":0.011637513,"about_ca_system_score_codex":0.0016963087,"about_ca_system_score_gemma":0.0021122028,"threshold_uncertainty_score":0.023139536},"labels":[],"label_agreement":null},{"id":"W622478646","doi":"10.1007/978-3-319-20801-5_5","title":"Improved Non-Local Means Algorithm Based on Dimensionality Reduction","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Signal Denoising Methods","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":"Western University","funders":"","keywords":"Dimensionality reduction; Computer science; Curse of dimensionality; Pattern recognition (psychology); Noise reduction; Feature (linguistics); Algorithm; Similarity (geometry); Feature vector; Artificial intelligence; Image (mathematics); Measure (data warehouse); Process (computing); Data mining","score_opus":0.026110037088524413,"score_gpt":0.2811865605759194,"score_spread":0.25507652348739496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W622478646","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.0071779834,0.0005512229,0.9898347,0.00008800094,0.00017066635,0.000028749017,0.000048292743,0.0005372901,0.0015631301],"genre_scores_gemma":[0.0560519,0.0004380431,0.93368053,0.00009491727,0.0001421004,0.00015743036,0.00036027492,0.0001895497,0.008885169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931204,0.000112286885,0.000040076466,0.00014795826,0.00034542952,0.00004221832],"domain_scores_gemma":[0.9995369,0.000108795226,0.000026495316,0.00008217088,0.0002280847,0.000017691933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004846079,0.0006757105,0.0014063416,0.00068251626,0.0006739037,0.0008306931,0.0015403294,0.0009585018,0.0027967934],"category_scores_gemma":[0.0010736081,0.0003932307,0.0012897613,0.0010177211,0.00037216445,0.001228367,0.00089887757,0.0012349407,0.0015330856],"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.00026809223,0.00014405986,0.00071270164,0.00025235736,0.00021433331,0.00008206951,0.00018822752,0.060265932,0.044822585,0.013136647,0.010312184,0.86960083],"study_design_scores_gemma":[0.00003582822,0.00010649754,0.0012579588,0.000016467195,0.000072691386,0.00025721075,0.00003882387,0.96596277,0.01733853,0.005300464,0.009556133,0.000056661374],"about_ca_topic_score_codex":0.0024520247,"about_ca_topic_score_gemma":0.0043977634,"teacher_disagreement_score":0.0027967934,"about_ca_system_score_codex":0.00040892628,"about_ca_system_score_gemma":0.0011487888,"threshold_uncertainty_score":0.009356201},"labels":[],"label_agreement":null},{"id":"W625474612","doi":"10.1007/978-3-662-44468-9_26","title":"Distributed Formation Control of Heterogeneous Robots with Limited Information","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","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 Manitoba","funders":"","keywords":"Robot; Computer science; Merge (version control); Distributed computing; Scalability; Perfect information; Population; Perception; Artificial intelligence; Human–computer interaction; Information retrieval","score_opus":0.009152987039263177,"score_gpt":0.20223845465622428,"score_spread":0.1930854676169611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W625474612","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.048960548,0.00066328037,0.94283175,0.00018563392,0.00010982546,0.000031521115,0.000020207843,0.00019084504,0.0070063723],"genre_scores_gemma":[0.9629972,0.0002909722,0.031077594,0.00003433979,0.00004244562,0.00008673146,0.000037560723,0.00002833737,0.005404861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998148,0.000041569743,0.000007107209,0.000044856657,0.00006420874,0.000027401426],"domain_scores_gemma":[0.9997433,0.00010856477,0.000049736864,0.00003677204,0.000039918563,0.000021788956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031982135,0.00052319735,0.00064800726,0.00025796928,0.00036522528,0.0006110633,0.001086997,0.0004463447,0.00075430505],"category_scores_gemma":[0.00094538485,0.00030807185,0.0003719949,0.00032482273,0.0007012068,0.00065678894,0.0014297467,0.0005250741,0.00013999418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009815839,0.000027542106,0.00017011793,0.00005713931,0.00002448758,0.000077314195,0.00008004847,0.9385744,0.0071677775,0.011803092,0.0006547953,0.04126508],"study_design_scores_gemma":[0.000014610167,0.0000445385,0.000084719606,0.0000035478743,0.000004838938,0.00001637499,0.0000102662025,0.99218583,0.00087451085,0.0062443125,0.00051242876,0.000003931557],"about_ca_topic_score_codex":0.0015531087,"about_ca_topic_score_gemma":0.0013335726,"teacher_disagreement_score":0.0015531087,"about_ca_system_score_codex":0.00039782893,"about_ca_system_score_gemma":0.00037847477,"threshold_uncertainty_score":0.0030881763},"labels":[],"label_agreement":null},{"id":"W6261272","doi":"10.1007/978-3-642-21043-3_9","title":"Using Semantic Information to Answer Complex Questions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Computer science; Semantic similarity; Artificial intelligence; Natural language processing; Word (group theory); Graph; String (physics); Benchmark (surveying); Question answering; Subsequence; Information retrieval; Theoretical computer science; Mathematics","score_opus":0.05982960648080021,"score_gpt":0.2787075651891551,"score_spread":0.2188779587083549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6261272","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.0102731,0.0026498286,0.9442523,0.0024310513,0.00048771861,0.00019343723,0.0013966425,0.0033250374,0.034990855],"genre_scores_gemma":[0.14179689,0.0034445752,0.8239886,0.0007400149,0.0005119616,0.00035965786,0.0059506255,0.00070231385,0.022505356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884534,0.0004037522,0.0000877482,0.00024340911,0.00036229877,0.000057349167],"domain_scores_gemma":[0.9968721,0.002452043,0.0001043104,0.00025272398,0.00025013747,0.00006865947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015368039,0.0010115544,0.0006329414,0.0019537923,0.00066181825,0.0025445614,0.001217186,0.0012502148,0.012716193],"category_scores_gemma":[0.00760578,0.0004812566,0.0013603625,0.0015095292,0.0011249289,0.007633135,0.0017496479,0.0020066681,0.004893075],"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.00019952875,0.00015649531,0.0009284069,0.001361237,0.000115056915,0.0001748874,0.0023230324,0.006530785,0.014884982,0.27902782,0.048156414,0.64614135],"study_design_scores_gemma":[0.000063531275,0.000078042394,0.0008146836,0.00032884034,0.0001524994,0.00026111116,0.0007361012,0.079814136,0.010888181,0.7053376,0.20146878,0.000056613873],"about_ca_topic_score_codex":0.0010091845,"about_ca_topic_score_gemma":0.0015603438,"teacher_disagreement_score":0.012716193,"about_ca_system_score_codex":0.00062388374,"about_ca_system_score_gemma":0.0007269443,"threshold_uncertainty_score":0.042539954},"labels":[],"label_agreement":null},{"id":"W62729806","doi":"10.1007/978-3-642-38457-8_17","title":"Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Soundness; Computer science; Hyperbolic tree; Probabilistic logic; Spanning tree; Tree (set theory); Theoretical computer science; Constraint (computer-aided design); Multi-agent system; Distributed computing; Artificial intelligence; Mathematics; Programming language; Discrete mathematics","score_opus":0.015507017129936787,"score_gpt":0.22268750221011288,"score_spread":0.20718048508017609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62729806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05951766,0.00020528177,0.93362206,0.00029936078,0.000057145557,0.00012880677,0.00020227945,0.0005394108,0.0054281033],"genre_scores_gemma":[0.5610709,0.00035389094,0.43304878,0.00009978207,0.000034834324,0.00018629411,0.00062192447,0.00009584525,0.0044878046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948835,0.00013440351,0.000031123927,0.00011818297,0.00015861618,0.00006932225],"domain_scores_gemma":[0.99938035,0.00011893131,0.000062381165,0.00022571457,0.00013248969,0.0000800599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004493482,0.00024319944,0.0006260575,0.0005335082,0.0010341918,0.001168827,0.0011546253,0.00073876785,0.0016107698],"category_scores_gemma":[0.001288296,0.0003093524,0.0005229107,0.001281039,0.0005082597,0.001580365,0.0018519511,0.000737604,0.00044584463],"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.00038371576,0.00030007013,0.0038216533,0.00041246586,0.0001265691,0.0009837114,0.0009739302,0.28856528,0.05060642,0.32992098,0.014608145,0.30929708],"study_design_scores_gemma":[0.000035002497,0.00011651187,0.00063156243,0.000028641452,0.00005007946,0.00052866887,0.0002775322,0.85747844,0.009945732,0.117905155,0.012978765,0.000024009396],"about_ca_topic_score_codex":0.000631146,"about_ca_topic_score_gemma":0.0008170654,"teacher_disagreement_score":0.0016107698,"about_ca_system_score_codex":0.000451036,"about_ca_system_score_gemma":0.0010296048,"threshold_uncertainty_score":0.0053884983},"labels":[],"label_agreement":null},{"id":"W62856139","doi":"10.1007/978-3-642-40164-0_22","title":"Approximation Algorithms for the Antenna Orientation Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc 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":"Carleton University","funders":"","keywords":"Beamwidth; Omnidirectional antenna; Computer science; Orientation (vector space); Antenna (radio); Algorithm; Fan-beam antenna; Coaxial antenna; Mathematics; Telecommunications; Geometry","score_opus":0.018963664152656955,"score_gpt":0.24769109992354968,"score_spread":0.22872743577089272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62856139","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.0043338705,0.0014201821,0.9809894,0.0005135636,0.00020576098,0.00007513877,0.00023013148,0.00061780564,0.011614149],"genre_scores_gemma":[0.14032601,0.0034019605,0.83463347,0.00045584928,0.0006791004,0.0005676529,0.0017825908,0.0007619768,0.017391462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849784,0.00047861063,0.000065045024,0.00027484534,0.00042656733,0.00025708097],"domain_scores_gemma":[0.9967591,0.002146372,0.00017478022,0.0005308081,0.00026680937,0.00012216902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015670991,0.0030359684,0.0024876087,0.001458277,0.0009368664,0.002842096,0.0042962944,0.0025437206,0.013421649],"category_scores_gemma":[0.008228468,0.0011370318,0.0019604575,0.004045193,0.0013437811,0.0046041585,0.0031608215,0.0055176094,0.004329919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037818195,0.00035397615,0.0007559547,0.000480287,0.00010885088,0.00009780146,0.00019776533,0.47474504,0.0016468307,0.15180188,0.04001326,0.32942012],"study_design_scores_gemma":[0.00011932697,0.000057627738,0.0001736459,0.00006791515,0.000037955157,0.00013512623,0.00007913733,0.802774,0.00055772945,0.1880922,0.007886547,0.000018678218],"about_ca_topic_score_codex":0.004310024,"about_ca_topic_score_gemma":0.004375786,"teacher_disagreement_score":0.013421649,"about_ca_system_score_codex":0.002229042,"about_ca_system_score_gemma":0.0016839395,"threshold_uncertainty_score":0.04489988},"labels":[],"label_agreement":null},{"id":"W62921065","doi":"10.1007/978-3-642-23318-0_28","title":"Do Subtopic Judgments Reflect Diversity?","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Novelty; Computer science; Diversity (politics); Information retrieval; Cosine similarity; Similarity (geometry); Process (computing); Artificial intelligence; Psychology; Pattern recognition (psychology); Political science","score_opus":0.05068834402321816,"score_gpt":0.2707773691573368,"score_spread":0.22008902513411865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62921065","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.95180666,0.00078407454,0.014598383,0.00051330193,0.000083043684,0.000036252055,0.00059422734,0.00013237493,0.03145176],"genre_scores_gemma":[0.9957533,0.00018343473,0.0019563274,0.00012115454,0.000061364946,0.00001671087,0.00031608713,0.000079462516,0.0015122035],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989779,0.00020973776,0.00005221831,0.00028554053,0.00032904028,0.00014566246],"domain_scores_gemma":[0.97974455,0.012169957,0.0030187995,0.0019640622,0.0018001946,0.001302544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017407112,0.000289781,0.00050661515,0.0015572535,0.00032885568,0.0026668466,0.0006222708,0.0008395871,0.007878574],"category_scores_gemma":[0.04081114,0.00041578282,0.0003548815,0.001529053,0.0008707046,0.0068950956,0.0011835085,0.0010341307,0.0013147403],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036868404,0.00063381146,0.48660225,0.0006455656,0.0006720193,0.0003349722,0.0056233024,0.004817109,0.08302709,0.023069756,0.00793116,0.38295627],"study_design_scores_gemma":[0.00012771391,0.0006235371,0.862222,0.00011391863,0.0002379309,0.0004980451,0.0025292407,0.01748807,0.011432894,0.10086685,0.0037444425,0.00011529762],"about_ca_topic_score_codex":0.0017338531,"about_ca_topic_score_gemma":0.0020154708,"teacher_disagreement_score":0.007878574,"about_ca_system_score_codex":0.0003861972,"about_ca_system_score_gemma":0.0002818502,"threshold_uncertainty_score":0.026356459},"labels":[],"label_agreement":null},{"id":"W62987670","doi":"10.1007/978-3-642-41218-9_5","title":"Some New Progress in Analyzing and Mining Uncertain and Probabilistic Data for Big Data Analytics","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Big data; Probabilistic logic; Computer science; Data science; Analytics; Probabilistic database; Data analysis; Uncertain data; Data mining; Artificial intelligence","score_opus":0.10132424590722992,"score_gpt":0.29906607045976674,"score_spread":0.1977418245525368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62987670","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.004872307,0.36630142,0.5773334,0.015907904,0.0042159003,0.00008510555,0.00086014735,0.001020793,0.029403057],"genre_scores_gemma":[0.061397854,0.35158357,0.54147214,0.0038597086,0.013908805,0.00013067864,0.0019467745,0.0006292313,0.025071243],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793434,0.00030955995,0.00018687031,0.0004390833,0.0010572531,0.0000729089],"domain_scores_gemma":[0.9899601,0.007084218,0.00020597423,0.0011044985,0.0014551765,0.00019000932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005407677,0.001212783,0.0012322624,0.0031958323,0.0007881367,0.005471545,0.0025683346,0.0014441224,0.004879345],"category_scores_gemma":[0.010978205,0.0009933771,0.0016039205,0.008498264,0.003251108,0.015910879,0.002279249,0.005502454,0.0021137865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009105279,0.00012969268,0.0016290775,0.0024683168,0.00014340853,0.00022510132,0.0005419722,0.011198029,0.0019527231,0.28645658,0.058675326,0.63648874],"study_design_scores_gemma":[0.000012868457,0.00007536507,0.0010242539,0.0005709301,0.00008300877,0.00061452214,0.0002543099,0.056238465,0.0034538158,0.5406922,0.39689207,0.00008827974],"about_ca_topic_score_codex":0.0015299654,"about_ca_topic_score_gemma":0.0014583193,"teacher_disagreement_score":0.005471545,"about_ca_system_score_codex":0.0012025486,"about_ca_system_score_gemma":0.0011018703,"threshold_uncertainty_score":0.028598845},"labels":[],"label_agreement":null},{"id":"W631719039","doi":"10.1007/978-3-319-10470-6_84","title":"Automatic Labelling of Tumourous Frames in Free-Hand Laparoscopic Ultrasound Video","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Renal cell carcinoma treatment","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Ultrasound; Nephrectomy; Computer science; Regularization (linguistics); Artificial intelligence; Frame (networking); Graph; Medicine; Radiology; Computer vision; Kidney; Internal medicine","score_opus":0.012001958850633047,"score_gpt":0.2535082967184224,"score_spread":0.24150633786778936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W631719039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26246434,0.0028887247,0.7244684,0.00016248914,0.00018539789,0.00025798831,0.0007189127,0.002250044,0.0066037327],"genre_scores_gemma":[0.63174546,0.0020275414,0.35512322,0.000107810665,0.00011515085,0.000085379,0.0011571945,0.000514305,0.009123976],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965954,0.00004718923,0.000014017682,0.000063379775,0.0001281108,0.00008768415],"domain_scores_gemma":[0.99952984,0.00016085603,0.000047526966,0.0000645274,0.00014780024,0.00004951944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043196676,0.00046510066,0.0003447485,0.0017857509,0.00027980172,0.0009824361,0.00066880975,0.0010502302,0.002515387],"category_scores_gemma":[0.0015455701,0.0003108721,0.0004027986,0.00083165773,0.0002710303,0.0004956333,0.00059044384,0.0004988415,0.0013010262],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010113424,0.000055629058,0.0023695847,0.00046552173,0.000044095184,0.00050070306,0.00027781766,0.0057537626,0.43679228,0.00095739245,0.0022865464,0.54948527],"study_design_scores_gemma":[0.000094661664,0.0005310793,0.04402437,0.00034865536,0.00022005363,0.005795869,0.0004729717,0.43066275,0.49568793,0.002570016,0.019466365,0.00012539844],"about_ca_topic_score_codex":0.0046923934,"about_ca_topic_score_gemma":0.005771413,"teacher_disagreement_score":0.0046923934,"about_ca_system_score_codex":0.00033762614,"about_ca_system_score_gemma":0.0006650286,"threshold_uncertainty_score":0.009330213},"labels":[],"label_agreement":null},{"id":"W632630573","doi":"10.1007/3-540-45502-7","title":"Evolutionary Robotics. From Intelligent Robotics to Artificial Life","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"Northern Ontario Academic Medicine Association","funders":"","keywords":"Robotics; Artificial intelligence; Evolutionary robotics; Artificial life; Computer science; Robot","score_opus":0.023236802379278543,"score_gpt":0.2379956259906604,"score_spread":0.21475882361138185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W632630573","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022391845,0.38734016,0.17438523,0.004109894,0.004213545,0.00012065222,0.0005165858,0.0016500698,0.42542458],"genre_scores_gemma":[0.055344712,0.23442906,0.15228751,0.0030502349,0.0029141011,0.0003633697,0.0013103717,0.001190281,0.5491104],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998029,0.000019304987,0.0000113996575,0.000029053383,0.0001252862,0.000012020027],"domain_scores_gemma":[0.9997489,0.00011575475,0.000023846782,0.00002596827,0.000057710728,0.000027822845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002250429,0.0012736164,0.0013523832,0.0014559327,0.00045198205,0.0019798526,0.0012626973,0.0011108335,0.01986355],"category_scores_gemma":[0.000805228,0.00046420732,0.00036260788,0.0024835013,0.0014000749,0.0032904372,0.00090246473,0.0016707409,0.009619196],"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.00003423498,0.0000638266,0.00016220633,0.0014988049,0.000042150128,0.000151429,0.00039523683,0.005017225,0.0024351785,0.2630734,0.17977133,0.5473549],"study_design_scores_gemma":[0.000018596213,0.000036462607,0.00040964177,0.00043183815,0.000022576822,0.0006966232,0.00011111525,0.0039979964,0.0007938353,0.21190456,0.7815506,0.000026220287],"about_ca_topic_score_codex":0.0007891599,"about_ca_topic_score_gemma":0.0015475722,"teacher_disagreement_score":0.01986355,"about_ca_system_score_codex":0.0005016656,"about_ca_system_score_gemma":0.0005339928,"threshold_uncertainty_score":0.06645018},"labels":[],"label_agreement":null},{"id":"W63277956","doi":"10.1007/978-3-642-30353-1_33","title":"A Three-Level Cognitive Architecture for the Simulation of Human Behaviour","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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":"Université du Québec à Montréal","funders":"","keywords":"Cognitive architecture; Computer science; Architecture; Cognition; Human–computer interaction; Cognitive science; Stroop effect; Task (project management); Cognitive model; Artificial intelligence; Psychology; Systems engineering","score_opus":0.06882153734754258,"score_gpt":0.3029974186831052,"score_spread":0.2341758813355626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63277956","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.03016426,0.00017171087,0.9530956,0.0005382663,0.000045743804,0.00009492801,0.0001775318,0.0015677072,0.0141442185],"genre_scores_gemma":[0.47907522,0.00030059612,0.5143649,0.00012995118,0.000022722244,0.0003169289,0.00025255946,0.00015689581,0.0053802123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970526,0.0001101816,0.00002187086,0.000059863523,0.00006746381,0.0000352736],"domain_scores_gemma":[0.9994332,0.00028044256,0.000030195246,0.00010932287,0.000077306104,0.00006948706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068722,0.00051512744,0.00048441207,0.00047924859,0.0009731389,0.0029875804,0.002134501,0.0015465638,0.007460431],"category_scores_gemma":[0.0022283832,0.00047619647,0.0013843094,0.00046987052,0.0016843468,0.002569626,0.0015310184,0.001501075,0.0010257902],"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.00015588255,0.00012616701,0.0017609204,0.00021109784,0.00012225633,0.00024750005,0.002211409,0.40766066,0.008786551,0.53121674,0.0024541677,0.045046706],"study_design_scores_gemma":[0.000025530679,0.00004255087,0.00036337023,0.000028107248,0.00003776934,0.000055915745,0.00009908311,0.75142336,0.0012512034,0.24124914,0.00540078,0.000023116554],"about_ca_topic_score_codex":0.010860771,"about_ca_topic_score_gemma":0.0076052574,"teacher_disagreement_score":0.010860771,"about_ca_system_score_codex":0.0011655665,"about_ca_system_score_gemma":0.001496426,"threshold_uncertainty_score":0.024957657},"labels":[],"label_agreement":null},{"id":"W63667411","doi":"10.1007/978-3-642-25489-5_33","title":"Autonomous Control for Human-Robot Interaction on Complex Rough Terrain","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","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 Calgary","funders":"","keywords":"Computer science; Terrain; Mobile robot; Mechanism (biology); Mobile manipulator; Robot; Inertial measurement unit; Artificial intelligence; Encoder; Simulation; Control engineering; Human–computer interaction; Real-time computing; Engineering","score_opus":0.03413955338104233,"score_gpt":0.2592546458068665,"score_spread":0.2251150924258242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63667411","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022880137,0.0009681451,0.963465,0.00010444845,0.00011680137,0.000030516916,0.000033036235,0.00056511763,0.011836746],"genre_scores_gemma":[0.9002724,0.0008566532,0.07905115,0.00006827455,0.00009906811,0.0001337794,0.000113904534,0.000107316744,0.019297404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998994,0.000012533935,0.0000033717708,0.000019626641,0.00004960961,0.000015505546],"domain_scores_gemma":[0.9999187,0.00003344609,0.00001104199,0.000012741983,0.00001677575,0.0000072063713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011176089,0.00041750856,0.0004755564,0.00015571546,0.0003278336,0.00058808445,0.0007003172,0.0004174986,0.0023140889],"category_scores_gemma":[0.00025284494,0.00019327765,0.0002511073,0.00016418922,0.0005257234,0.00038779204,0.00061674375,0.00044993046,0.0004648323],"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.00013546133,0.00008146168,0.0003251182,0.00027421204,0.000053423566,0.0002607843,0.0004041337,0.57865673,0.10212032,0.048519388,0.006148872,0.26302004],"study_design_scores_gemma":[0.000014668069,0.00009481329,0.0005062101,0.000011787631,0.000009266567,0.00007450729,0.000044250835,0.97036755,0.003796465,0.01804752,0.007021151,0.000011901321],"about_ca_topic_score_codex":0.0014763394,"about_ca_topic_score_gemma":0.0023702222,"teacher_disagreement_score":0.0023140889,"about_ca_system_score_codex":0.00017700941,"about_ca_system_score_gemma":0.00019396294,"threshold_uncertainty_score":0.0077413917},"labels":[],"label_agreement":null},{"id":"W63761467","doi":"10.1007/978-3-540-89646-3_38","title":"Browsing a Large Collection of Community Photos Based on Similarity on GPU","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Panning (audio); Zoom; Speedup; Computer graphics (images); Similarity (geometry); Scale-invariant feature transform; Process (computing); Feature (linguistics); Information retrieval; Computer vision; Feature extraction; Image (mathematics); Parallel computing","score_opus":0.0315935085327025,"score_gpt":0.286557725831252,"score_spread":0.2549642172985495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63761467","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.75402147,0.004960504,0.16879721,0.0009606151,0.00041864652,0.0008116952,0.02053728,0.020224983,0.029267557],"genre_scores_gemma":[0.7022563,0.0013827006,0.26726666,0.000208001,0.0001522061,0.00016983316,0.016187448,0.0012060415,0.011170726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978966,0.000013581745,0.000009153237,0.00006640988,0.000086551634,0.000034635465],"domain_scores_gemma":[0.9995989,0.00008049377,0.00001802619,0.00007450473,0.00013360403,0.000094508876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016089094,0.00060024654,0.0010442437,0.004480155,0.0012752673,0.0012061519,0.00060697953,0.0005650058,0.007323895],"category_scores_gemma":[0.0007863857,0.00037496912,0.00056218967,0.007648747,0.00018835011,0.0015176104,0.0007842036,0.00042132143,0.0018651498],"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.0017833628,0.00053457275,0.019909589,0.0008139896,0.00032201482,0.0011696165,0.0011581545,0.009261211,0.14308746,0.0024078004,0.09832209,0.72123027],"study_design_scores_gemma":[0.0003575441,0.00080118934,0.09489041,0.000168288,0.000419431,0.0034795657,0.0045791403,0.6978655,0.07696543,0.029489798,0.090778194,0.00020560739],"about_ca_topic_score_codex":0.015447343,"about_ca_topic_score_gemma":0.045670133,"teacher_disagreement_score":0.015447343,"about_ca_system_score_codex":0.00047393562,"about_ca_system_score_gemma":0.0005406152,"threshold_uncertainty_score":0.03071487},"labels":[],"label_agreement":null},{"id":"W63786410","doi":"10.1007/978-3-642-38697-8_8","title":"On Multi-enabledness in Time Petri Nets","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Petri Nets in System Modeling","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","funders":"","keywords":"Petri net; Computer science; Bisimulation; Semantics (computer science); Focus (optics); Theoretical computer science; State space; Stochastic Petri net; State (computer science); Time complexity; Algorithm; Programming language; Discrete mathematics; Mathematics; Physics","score_opus":0.024311495326035854,"score_gpt":0.24802660883276578,"score_spread":0.22371511350672993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63786410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017958703,0.008259319,0.93111223,0.00081068254,0.0006589329,0.00006585619,0.00011785421,0.0002120939,0.040804237],"genre_scores_gemma":[0.60125667,0.015832368,0.35078818,0.0009650759,0.0018141491,0.00043196118,0.0005371692,0.0003920431,0.027982375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980532,0.00051502325,0.00019021609,0.0004080348,0.0006250504,0.00020844441],"domain_scores_gemma":[0.99310803,0.0054375646,0.0003065421,0.00042037782,0.00048396448,0.00024353348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031253046,0.0015041893,0.00114376,0.0022241783,0.0010877603,0.0021924097,0.0020307233,0.001240152,0.003936998],"category_scores_gemma":[0.007020087,0.0011064326,0.0022084948,0.0030758802,0.0040644337,0.006967783,0.002816715,0.0058387737,0.0005814221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045448025,0.000023556684,0.00023233476,0.0001942917,0.000027533228,0.0002676624,0.00031914515,0.027861116,0.001261258,0.94875896,0.00073610287,0.020272586],"study_design_scores_gemma":[0.000008441612,0.000015586094,0.00011355809,0.00006478655,0.000019132485,0.00008544171,0.000034272365,0.032214385,0.00046456046,0.9635456,0.003420825,0.000013396161],"about_ca_topic_score_codex":0.0022851306,"about_ca_topic_score_gemma":0.0020855465,"teacher_disagreement_score":0.003936998,"about_ca_system_score_codex":0.002218126,"about_ca_system_score_gemma":0.0009295369,"threshold_uncertainty_score":0.016528428},"labels":[],"label_agreement":null},{"id":"W63944300","doi":"10.1007/978-3-662-45391-9_17","title":"How Do Developers React to RESTful API Evolution?","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Personal Information Management and User Behavior","field":"Decision Sciences","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; World Wide Web; Web service; Java; Application programming interface; Web API; SOAP; Representational state transfer; Code (set theory); Web 2.0; Software engineering; Programming language","score_opus":0.12051146632325195,"score_gpt":0.36085857457961157,"score_spread":0.24034710825635963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63944300","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.78104895,0.00089587533,0.1627978,0.006850009,0.0003238716,0.00021933483,0.0005731776,0.019891793,0.02739928],"genre_scores_gemma":[0.9697427,0.00024172604,0.020609114,0.0009714258,0.000054244385,0.000061003146,0.0005773468,0.0015570829,0.006185476],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9948473,0.0018243752,0.00029388155,0.000775436,0.0016536854,0.0006053849],"domain_scores_gemma":[0.9687246,0.015404204,0.0039980966,0.0067281,0.0041415337,0.001003552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061016637,0.00065175066,0.00037852908,0.0011150707,0.0005229892,0.0029433991,0.0015012866,0.0021666235,0.0028606837],"category_scores_gemma":[0.0641506,0.0008475367,0.000580003,0.0006520331,0.00084276724,0.005369949,0.0017782139,0.002009706,0.0014239956],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009353659,0.00078606844,0.20709834,0.000606935,0.00047057788,0.0021463586,0.008875351,0.02558743,0.097422235,0.021946257,0.03637192,0.59775317],"study_design_scores_gemma":[0.00019088699,0.0006969955,0.17927861,0.0004322979,0.00065893744,0.0021492818,0.008475149,0.5517779,0.10239805,0.093933254,0.059673417,0.00033510497],"about_ca_topic_score_codex":0.002624918,"about_ca_topic_score_gemma":0.0030284957,"teacher_disagreement_score":0.0061016637,"about_ca_system_score_codex":0.00063758093,"about_ca_system_score_gemma":0.00093662407,"threshold_uncertainty_score":0.03226906},"labels":[],"label_agreement":null},{"id":"W64020492","doi":"10.1007/978-3-642-40763-5_16","title":"Improving 2D-3D Registration Optimization Using Learned Prostate Motion Data","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Prostate Cancer Diagnosis and Treatment","field":"Medicine","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":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research; Canada Research Chairs; Cancer Care Ontario","keywords":"Initialization; Robustness (evolution); Principal component analysis; Artificial intelligence; Computer science; Prostate biopsy; Computer vision; Motion compensation; Image registration; Data set; Workflow; Prostate; Pattern recognition (psychology); Medicine","score_opus":0.042534760756485955,"score_gpt":0.30227374387153355,"score_spread":0.2597389831150476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64020492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019913109,0.0005161569,0.97400314,0.00017942986,0.00009299374,0.00007454861,0.00021422192,0.0041051977,0.0009012025],"genre_scores_gemma":[0.26474443,0.00044883546,0.7271614,0.00034335387,0.000088337794,0.00016970039,0.0012830069,0.0017614691,0.0039994502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890816,0.00021866254,0.0000763142,0.00029562585,0.000406213,0.00009505993],"domain_scores_gemma":[0.99902976,0.0004094035,0.00010597974,0.00022699057,0.00018326785,0.000044557495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012392328,0.0019479906,0.0021791623,0.0018582685,0.00062618434,0.0014962294,0.0016696857,0.0020496382,0.0037216733],"category_scores_gemma":[0.0033512085,0.0016376614,0.00260554,0.0024148203,0.00061826775,0.0014810975,0.0023691086,0.0019248431,0.0022006324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004446944,0.00029387488,0.0017517831,0.0003247347,0.0003550427,0.00012927047,0.00013177058,0.5142516,0.035883214,0.002501628,0.005592964,0.43833935],"study_design_scores_gemma":[0.000021115022,0.00006327971,0.0005365068,0.000009709553,0.000034300956,0.00009304815,0.000014032476,0.99045765,0.00633865,0.0012052958,0.00120626,0.00002016676],"about_ca_topic_score_codex":0.009048571,"about_ca_topic_score_gemma":0.013165914,"teacher_disagreement_score":0.009048571,"about_ca_system_score_codex":0.0006811578,"about_ca_system_score_gemma":0.0017712666,"threshold_uncertainty_score":0.01799184},"labels":[],"label_agreement":null},{"id":"W64109705","doi":"10.1007/978-3-642-31374-5_27","title":"Writing on Clouds","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Handwritten Text Recognition Techniques","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":"Western University","funders":"","keywords":"Handwriting; Computer science; Handwriting recognition; Intelligent character recognition; Sample (material); Character (mathematics); Cloud computing; Function (biology); Software; Word (group theory); Symbol (formal); Artificial intelligence; Speech recognition; Natural language processing; Character recognition; Feature extraction; Operating system; Programming language","score_opus":0.022684363430050994,"score_gpt":0.26215221121005716,"score_spread":0.23946784778000618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64109705","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011065649,0.0052179354,0.037345573,0.025122516,0.052733094,0.0001675576,0.004722226,0.008009682,0.86557484],"genre_scores_gemma":[0.005425988,0.0026073027,0.009743201,0.0024805232,0.003460673,0.0000535664,0.0021606537,0.004612431,0.9694556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944097,0.00005061626,0.000031018626,0.00011886527,0.00028360524,0.000074973104],"domain_scores_gemma":[0.99889,0.00019056775,0.000045739223,0.00022714134,0.000455957,0.00019069482],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043286974,0.0009375022,0.00057076354,0.0016360086,0.002315373,0.004723446,0.0009636327,0.0007475776,0.35658786],"category_scores_gemma":[0.003579488,0.00042261786,0.0006792766,0.002253516,0.00079407176,0.0046554524,0.0023897782,0.0027104008,0.22694239],"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.000010350363,0.0000060088973,0.000041464868,0.000036236594,0.000002726623,0.000024968374,0.00006913155,0.00013067057,0.00025950934,0.018857058,0.9030767,0.0774852],"study_design_scores_gemma":[0.0000018957373,0.0000016044172,0.000033525128,0.000023299506,0.0000011587913,0.000019150066,0.00003982043,0.000079120655,0.00013583829,0.004361698,0.9952997,0.000003001156],"about_ca_topic_score_codex":0.010812041,"about_ca_topic_score_gemma":0.018781003,"teacher_disagreement_score":0.35658786,"about_ca_system_score_codex":0.001456882,"about_ca_system_score_gemma":0.0023993775,"threshold_uncertainty_score":0.91774935},"labels":[],"label_agreement":null},{"id":"W64399094","doi":"10.1007/978-3-642-39238-2_33","title":"Fashioning Embodied Interfaces: Open Wearables Crafting","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fashion and Cultural Textiles","field":"Arts and Humanities","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":"Concordia University","funders":"","keywords":"Vanguard; Wearable computer; Computer science; Embodied cognition; Convergence (economics); Human–computer interaction; Wearable technology; Open source; Multimedia; Artificial intelligence; Embedded system; History","score_opus":0.05088985578160035,"score_gpt":0.2576758476828643,"score_spread":0.20678599190126393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64399094","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03592433,0.00701133,0.8502698,0.0004967027,0.001013427,0.00011206542,0.00025985244,0.003935698,0.10097679],"genre_scores_gemma":[0.38131654,0.009255657,0.41920885,0.0006492449,0.0004073023,0.00025877848,0.00070206204,0.0017544857,0.18644701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994649,0.00007462935,0.000028717352,0.00010825151,0.00025744314,0.000065958164],"domain_scores_gemma":[0.99961746,0.00013118247,0.000016740334,0.00013482168,0.00006770744,0.000032091408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051613624,0.00082389545,0.0005729992,0.00065376004,0.00042951157,0.0030443075,0.0016648663,0.0013771455,0.023451582],"category_scores_gemma":[0.0012055696,0.00053394976,0.0006410974,0.0007168473,0.0010460224,0.00402184,0.0036656146,0.0010168271,0.005111321],"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.00025195358,0.00012170475,0.0003263181,0.00081442756,0.00004840092,0.00045374484,0.002427458,0.0017762135,0.12744725,0.049943123,0.0157249,0.80066454],"study_design_scores_gemma":[0.00008613815,0.0008057524,0.003410915,0.0010571309,0.00021009117,0.0039207046,0.0027972432,0.03629627,0.15867145,0.10483387,0.6877122,0.00019833354],"about_ca_topic_score_codex":0.00030521417,"about_ca_topic_score_gemma":0.0006202479,"teacher_disagreement_score":0.023451582,"about_ca_system_score_codex":0.00020763787,"about_ca_system_score_gemma":0.00016528579,"threshold_uncertainty_score":0.07845342},"labels":[],"label_agreement":null},{"id":"W6467814","doi":"10.1007/978-3-540-72792-7_13","title":"On Integer Programming and the Branch-Width of the Constraint Matrix","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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 Waterloo","funders":"","keywords":"Integer (computer science); Matroid; Combinatorics; Integer programming; Mathematics; Constant (computer programming); Constraint (computer-aided design); Matrix (chemical analysis); Integer matrix; Discrete mathematics; Algorithm; Computer science; Physics; Geometry; Symmetric matrix; Eigenvalues and eigenvectors; Chemistry","score_opus":0.012509983866953976,"score_gpt":0.2492199954398392,"score_spread":0.2367100115728852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6467814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007102468,0.0069298553,0.92217183,0.0023338865,0.00046597578,0.000058504484,0.0002715466,0.0002946978,0.060371295],"genre_scores_gemma":[0.2074086,0.019704081,0.738547,0.0013892159,0.0022116906,0.0004276934,0.0008792948,0.0009300857,0.02850232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982786,0.0007156812,0.00009870453,0.00021941034,0.00052092836,0.00016671812],"domain_scores_gemma":[0.99388075,0.0049503455,0.00028938265,0.00041373083,0.00033227378,0.00013361083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003372964,0.0026521084,0.0015988232,0.002040171,0.00093394844,0.003959311,0.00256858,0.0017013897,0.013981292],"category_scores_gemma":[0.013848643,0.0015663062,0.0012187673,0.0069562285,0.0036493228,0.009646822,0.0023155017,0.009646933,0.002533872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075470714,0.00005923719,0.00016165993,0.00020066189,0.000024406043,0.000043760156,0.000116600735,0.044775184,0.0010688942,0.8581349,0.008379344,0.08695983],"study_design_scores_gemma":[0.000009554827,0.000013280804,0.00006684057,0.00006103032,0.000009145896,0.000029110952,0.000023329263,0.0601874,0.00033248335,0.93454313,0.00471274,0.000011974956],"about_ca_topic_score_codex":0.0018673677,"about_ca_topic_score_gemma":0.0019823792,"teacher_disagreement_score":0.013981292,"about_ca_system_score_codex":0.001838751,"about_ca_system_score_gemma":0.0011677059,"threshold_uncertainty_score":0.046772063},"labels":[],"label_agreement":null},{"id":"W65078775","doi":"10.1007/978-3-642-30615-0_12","title":"Wavelength Isolation Sequence Pairs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Golomb coding; Sequence (biology); Pseudorandom binary sequence; Complementary sequences; Binary number; Wavelength; Ideal (ethics); Mathematics; Physics; Algorithm; Combinatorics; Computer science; Optics; Arithmetic; Biology; Artificial intelligence; Philosophy; Genetics","score_opus":0.01933906216391789,"score_gpt":0.22186172760577888,"score_spread":0.20252266544186098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65078775","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049365554,0.0017152943,0.4550095,0.00045207998,0.0015108451,0.00041139667,0.0007440513,0.0031507656,0.4876406],"genre_scores_gemma":[0.45775306,0.0019181018,0.23070963,0.00068286125,0.00044984955,0.00044133805,0.0018483043,0.0009251817,0.3052717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997038,0.00004241708,0.000014677191,0.00007823764,0.000114073635,0.000046809342],"domain_scores_gemma":[0.9996698,0.000059313137,0.000031403273,0.00010611967,0.00009988186,0.000033408884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027707385,0.00088208006,0.0004056173,0.0007782588,0.00089773186,0.0009805051,0.0007724373,0.0006729817,0.037097707],"category_scores_gemma":[0.00056943257,0.0003216456,0.0002586754,0.000739573,0.00033852586,0.0013283025,0.0012167217,0.00087563164,0.016685938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006239486,0.00017260562,0.000608636,0.00052721426,0.000043709308,0.00060419337,0.00022411275,0.0084328465,0.15124278,0.30693886,0.03395023,0.49663094],"study_design_scores_gemma":[0.000090460555,0.00076886377,0.0010427145,0.00022272838,0.00008275715,0.0032182317,0.00019552081,0.031205382,0.2951659,0.20109826,0.4668281,0.00008114858],"about_ca_topic_score_codex":0.00012366551,"about_ca_topic_score_gemma":0.00023901569,"teacher_disagreement_score":0.037097707,"about_ca_system_score_codex":0.00036058694,"about_ca_system_score_gemma":0.00044817588,"threshold_uncertainty_score":0.12410426},"labels":[],"label_agreement":null},{"id":"W65121486","doi":"10.1007/978-3-642-23863-5_1","title":"Autonomous and Adaptive Identification of Topics in Unstructured Text","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Novelty; Identification (biology); Flexibility (engineering); Artificial intelligence; Process (computing); Natural language processing; Information retrieval; Programming language","score_opus":0.016527156940934352,"score_gpt":0.2503990093970874,"score_spread":0.23387185245615308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65121486","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.1636414,0.0011567755,0.8231285,0.00033789902,0.00019683084,0.0002061847,0.000696039,0.0048195194,0.0058168992],"genre_scores_gemma":[0.6155721,0.0006758151,0.3696276,0.00014350007,0.0002878411,0.00016578399,0.0017177635,0.0005171743,0.011292399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944896,0.00011322117,0.000029019508,0.00022856281,0.00012593964,0.0000542117],"domain_scores_gemma":[0.99825364,0.0010916683,0.00012496543,0.00017959515,0.0002492531,0.000100872865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084683317,0.00047552193,0.00056976994,0.0012958674,0.0004105226,0.0012656153,0.000868702,0.0007253765,0.0019348918],"category_scores_gemma":[0.003271205,0.00028331557,0.00037325386,0.0009960984,0.00050805334,0.0019094187,0.0015229979,0.0006538274,0.0019321892],"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.0006215168,0.00017619804,0.0061475914,0.00028656088,0.000060876155,0.00017723044,0.0009313399,0.01101668,0.17601635,0.003190545,0.0067791073,0.7945961],"study_design_scores_gemma":[0.00004502261,0.00023484796,0.014553595,0.000041538486,0.00009612723,0.00038382638,0.00088671193,0.88218725,0.0749473,0.014512675,0.012069314,0.000041892636],"about_ca_topic_score_codex":0.0010853921,"about_ca_topic_score_gemma":0.0019603886,"teacher_disagreement_score":0.0019348918,"about_ca_system_score_codex":0.0002702675,"about_ca_system_score_gemma":0.0004226841,"threshold_uncertainty_score":0.006472826},"labels":[],"label_agreement":null},{"id":"W65240111","doi":"10.1007/978-3-642-24908-2_15","title":"Principles of the SymposiumPlanner Instantiations of Rule Responder","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"National Research Council Canada; University of New Brunswick","funders":"","keywords":"Computer science; Programming language","score_opus":0.03763636939587321,"score_gpt":0.24370309311306249,"score_spread":0.20606672371718926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65240111","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.0031390751,0.00013079098,0.92680615,0.000822404,0.00022209778,0.0003111307,0.00024922946,0.0017245874,0.06659445],"genre_scores_gemma":[0.0986084,0.00022426175,0.8719029,0.00053455814,0.0002728957,0.00066549366,0.0006574532,0.0010150302,0.026119033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9884963,0.0048723905,0.0011024211,0.0021364256,0.0023192496,0.0010732516],"domain_scores_gemma":[0.99079084,0.0034910473,0.0002953005,0.0037877073,0.0012170575,0.00041814812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011252649,0.0011022268,0.0012837779,0.0019433303,0.003311184,0.008031683,0.0059643555,0.0035707413,0.031729836],"category_scores_gemma":[0.022198133,0.0028717783,0.0028339294,0.0014414239,0.0063263224,0.012438502,0.0050179563,0.0062486716,0.009503615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038208713,0.00002997469,0.00011529704,0.000034434586,0.0000110361725,0.000044575903,0.00035924016,0.0012444188,0.00026841543,0.98070896,0.0029831035,0.014162499],"study_design_scores_gemma":[0.00005056623,0.00003699691,0.00010910354,0.00006138596,0.000047820657,0.0001642537,0.00017047282,0.023301478,0.0018203651,0.9331437,0.04105487,0.000038946386],"about_ca_topic_score_codex":0.0026072816,"about_ca_topic_score_gemma":0.0040454464,"teacher_disagreement_score":0.031729836,"about_ca_system_score_codex":0.0014692931,"about_ca_system_score_gemma":0.0032228413,"threshold_uncertainty_score":0.10614693},"labels":[],"label_agreement":null},{"id":"W65414435","doi":"10.1007/978-3-642-32009-5_11","title":"Functional Encryption with Bounded Collusions via Multi-party Computation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":290,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Encryption; Bounded function; Functional encryption; Theoretical computer science; Distributed computing; Secure multi-party computation; Computer security; Algorithm; Mathematics; Ciphertext","score_opus":0.02381885422453816,"score_gpt":0.2427579886217169,"score_spread":0.21893913439717874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65414435","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.028217787,0.0005039634,0.9531846,0.00070853834,0.00013299572,0.00011522879,0.00007764677,0.0004997903,0.016559536],"genre_scores_gemma":[0.88884085,0.0004852158,0.09830495,0.00023256344,0.00015480234,0.00023785113,0.000104645456,0.00014286011,0.011496214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956351,0.0015118589,0.00025679905,0.00046346494,0.001496437,0.0006363446],"domain_scores_gemma":[0.9946089,0.0027074714,0.00028474894,0.0019569062,0.00030099816,0.00014091148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304237,0.0010882703,0.0014320933,0.00083507877,0.001304867,0.0028413301,0.0016800129,0.0018948601,0.0050895945],"category_scores_gemma":[0.007018306,0.0006641608,0.0015040918,0.0011661641,0.0030606322,0.0071629616,0.0063898186,0.0041358788,0.0015644826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002598924,0.00005266044,0.00014611866,0.00014413112,0.000040509574,0.0002203275,0.00017708624,0.025450896,0.00608233,0.9344099,0.0018669241,0.031149236],"study_design_scores_gemma":[0.00004913423,0.00008558764,0.0000922656,0.000038514365,0.000025979947,0.00031111873,0.000027869759,0.21362181,0.008340146,0.77447027,0.0029014738,0.00003586238],"about_ca_topic_score_codex":0.00016204288,"about_ca_topic_score_gemma":0.000151858,"teacher_disagreement_score":0.0050895945,"about_ca_system_score_codex":0.0012745715,"about_ca_system_score_gemma":0.00078660005,"threshold_uncertainty_score":0.017026365},"labels":[],"label_agreement":null},{"id":"W65498622","doi":"10.1007/978-3-642-31069-0_15","title":"Experience on Building an Architecture Level Adaptable System","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"Computer science; Concurrency; Distributed computing; Architecture; Concurrency control; Cloud computing; Computer architecture; Operating system; Database","score_opus":0.07678396334381013,"score_gpt":0.30116551051572665,"score_spread":0.22438154717191652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65498622","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.45102137,0.0019444136,0.4163205,0.0014288812,0.00019417191,0.00022102342,0.00023073421,0.005224006,0.12341486],"genre_scores_gemma":[0.6285737,0.0020550047,0.30615133,0.00043087936,0.000050495073,0.00009275065,0.0007204752,0.001361546,0.060563706],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994578,0.00015396054,0.000026058364,0.00006739811,0.00023006045,0.00006474699],"domain_scores_gemma":[0.9993938,0.00018310173,0.00001780736,0.00018363055,0.00011409765,0.00010755663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833918,0.0004665342,0.00034533138,0.00028676493,0.00065642945,0.0014756065,0.0009231859,0.0008227344,0.006719125],"category_scores_gemma":[0.0017314786,0.0003297727,0.00040310842,0.0005430259,0.00062310114,0.0022327239,0.0010807754,0.0012464194,0.0019069794],"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.0003818046,0.0008771616,0.005574805,0.00059352576,0.00009980087,0.0019487295,0.013741157,0.041718785,0.12566435,0.035649274,0.013622936,0.7601276],"study_design_scores_gemma":[0.00022374775,0.0037620724,0.014093383,0.00039892748,0.00030038427,0.005344077,0.0055329166,0.12177951,0.19706042,0.026140185,0.6251499,0.00021440549],"about_ca_topic_score_codex":0.0028952637,"about_ca_topic_score_gemma":0.0031105427,"teacher_disagreement_score":0.006719125,"about_ca_system_score_codex":0.00047802625,"about_ca_system_score_gemma":0.00061836385,"threshold_uncertainty_score":0.022477686},"labels":[],"label_agreement":null},{"id":"W65674046","doi":"10.1007/3-540-45554-x_56","title":"A Study of Conditional Independence Change in Learning Probabilistic Network","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Bayesian network; Probabilistic logic; Independence (probability theory); Conditional independence; Markov chain; Artificial intelligence; Frame (networking); Markov property; Domain (mathematical analysis); Property (philosophy); Machine learning; Markov blanket; Set (abstract data type); Theoretical computer science; Markov model; Mathematics; Statistics","score_opus":0.04868885450858719,"score_gpt":0.28270297685668777,"score_spread":0.2340141223481006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65674046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048167884,0.0016664745,0.93922204,0.0020398092,0.00010575435,0.00006474185,0.00017988769,0.0002530005,0.008300445],"genre_scores_gemma":[0.77762514,0.003574122,0.19643354,0.0010752011,0.0013771998,0.00047397809,0.0009446491,0.00062284706,0.017873248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964122,0.0019319203,0.00012662842,0.00070718996,0.0006355483,0.00018643179],"domain_scores_gemma":[0.86373097,0.12571013,0.0033911678,0.003121083,0.0024246916,0.0016219623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0099581005,0.00095950137,0.002440728,0.0021432606,0.00134809,0.0028745513,0.0060701473,0.0029097716,0.00726974],"category_scores_gemma":[0.081286244,0.0018165325,0.0024783234,0.0037247865,0.0051287264,0.011280828,0.003400416,0.006581246,0.00042977429],"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.00013479764,0.000117393545,0.0022230258,0.00023954998,0.00014355539,0.00017653036,0.000503611,0.16238141,0.00077580445,0.8061612,0.0028467146,0.0242964],"study_design_scores_gemma":[0.000014211699,0.000033878863,0.0005699842,0.00001905926,0.00003611873,0.000078512276,0.000034465647,0.53001153,0.00018711817,0.468224,0.0007722031,0.000018905765],"about_ca_topic_score_codex":0.0046424298,"about_ca_topic_score_gemma":0.0026805662,"teacher_disagreement_score":0.0099581005,"about_ca_system_score_codex":0.0029454217,"about_ca_system_score_gemma":0.0011533254,"threshold_uncertainty_score":0.0526641},"labels":[],"label_agreement":null},{"id":"W65765032","doi":"10.1007/978-3-319-02753-1_31","title":"Health Condition Alarm System","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Healthcare Technology and Patient Monitoring","field":"Medicine","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":"Athabasca University","funders":"","keywords":"ALARM; Computer science; Chart; Computer security; Statistics; Engineering","score_opus":0.028731635751001888,"score_gpt":0.3056003527959285,"score_spread":0.2768687170449266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65765032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045180004,0.00960568,0.5086319,0.0032875712,0.0034611644,0.0010828327,0.01573922,0.1422195,0.2707921],"genre_scores_gemma":[0.4855095,0.0040900116,0.13583924,0.004165968,0.0010779806,0.0005149513,0.018458785,0.001597444,0.34874615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997576,0.000018956136,0.000015640759,0.00007173469,0.000114968156,0.000021158578],"domain_scores_gemma":[0.99981457,0.000057202178,0.000013556087,0.000028443123,0.00007068506,0.000015553962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029300217,0.00061790546,0.00042909518,0.00075920526,0.00030023826,0.0008112562,0.00067320146,0.0005531549,0.029960942],"category_scores_gemma":[0.0006708356,0.0002161142,0.00023637908,0.0003616695,0.000095828975,0.00062348484,0.00048949424,0.0005661195,0.013922397],"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.000577892,0.00019469105,0.002863803,0.0003901348,0.00006578563,0.00048476277,0.00014825643,0.003431718,0.03496827,0.0054200715,0.2812318,0.67022276],"study_design_scores_gemma":[0.00019631884,0.00062295643,0.017668555,0.0002383623,0.00027665662,0.0023135797,0.0001559875,0.15499166,0.10619358,0.009164786,0.70801556,0.00016203512],"about_ca_topic_score_codex":0.00137512,"about_ca_topic_score_gemma":0.0014728059,"teacher_disagreement_score":0.029960942,"about_ca_system_score_codex":0.00025881897,"about_ca_system_score_gemma":0.00030549016,"threshold_uncertainty_score":0.10022932},"labels":[],"label_agreement":null},{"id":"W65774215","doi":"10.1007/11864219_53","title":"Panel on the Contributions of the DISC Community to Distributed Computing: A Historical Perspective","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Computability; Impossibility; Distributed algorithm; Theoretical computer science; Focus (optics); Perspective (graphical); Distributed computing; Protocol (science); Artificial intelligence","score_opus":0.031184766924651726,"score_gpt":0.2586733442069658,"score_spread":0.2274885772823141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65774215","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002688601,0.20894748,0.005422811,0.4680515,0.07025974,0.00006828043,0.00047639385,0.00010693011,0.24397823],"genre_scores_gemma":[0.068226136,0.28237292,0.0038462824,0.11596131,0.07732423,0.00015003943,0.00049884885,0.0003724549,0.4512479],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992318,0.00015948257,0.00003412002,0.00013938508,0.00032165373,0.00011363885],"domain_scores_gemma":[0.99554586,0.0018388594,0.00015121972,0.00021586199,0.0016829132,0.00056539074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033459968,0.0005689356,0.0006270542,0.002217796,0.0038723515,0.00896699,0.0015801243,0.0053786184,0.01962129],"category_scores_gemma":[0.005246817,0.00028742212,0.0004189538,0.005872341,0.0029667856,0.008650718,0.003079087,0.0069930363,0.005047473],"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.000068607675,0.000036095968,0.00021536187,0.00038672047,0.000004664165,0.00009183244,0.00085909694,0.00027500634,0.00029225257,0.1311442,0.8057577,0.060868528],"study_design_scores_gemma":[0.000003632273,0.0000052685155,0.000074457545,0.00020730816,0.0000018922033,0.000034658915,0.00024670392,0.000046513713,0.00008165685,0.005218921,0.9940744,0.0000045720867],"about_ca_topic_score_codex":0.0037283993,"about_ca_topic_score_gemma":0.005141903,"teacher_disagreement_score":0.01962129,"about_ca_system_score_codex":0.0032232255,"about_ca_system_score_gemma":0.0025033308,"threshold_uncertainty_score":0.065639734},"labels":[],"label_agreement":null},{"id":"W6581905","doi":"10.1007/978-3-319-06483-3_16","title":"Active Learning Strategies for Semi-Supervised DBSCAN","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Supervised learning; Pattern recognition (psychology); Artificial neural network","score_opus":0.01346121511558944,"score_gpt":0.2538646676027252,"score_spread":0.24040345248713574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6581905","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.00184302,0.00025315682,0.9959716,0.000059736718,0.000033238346,0.000022995397,0.000044395947,0.00047744936,0.0012943642],"genre_scores_gemma":[0.16366489,0.0005770649,0.8238305,0.00020074377,0.00017734506,0.00029345747,0.00068110024,0.0007095846,0.009865357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997865,0.0006681616,0.00018269614,0.00037548642,0.0007694965,0.00013917543],"domain_scores_gemma":[0.9947246,0.0031512538,0.00017956631,0.0007335649,0.0010525337,0.00015850479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028107867,0.0013197316,0.0020684071,0.0016422842,0.0010279993,0.003049664,0.0059520286,0.0022712583,0.007109032],"category_scores_gemma":[0.00975376,0.0011647769,0.0011826921,0.0022525117,0.001785745,0.003985182,0.0035570678,0.0033000596,0.0023156924],"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.00033672774,0.00019515758,0.000468885,0.00023343442,0.00012989275,0.000099158075,0.0002629266,0.3088056,0.0034815262,0.14015466,0.009078722,0.53675336],"study_design_scores_gemma":[0.000012033641,0.000022569124,0.000035096808,0.000013177555,0.000009073927,0.00004087146,0.000021727772,0.9441051,0.0012728708,0.052673616,0.0017827353,0.000011079843],"about_ca_topic_score_codex":0.0043257107,"about_ca_topic_score_gemma":0.0060135834,"teacher_disagreement_score":0.007109032,"about_ca_system_score_codex":0.0009208017,"about_ca_system_score_gemma":0.0014129921,"threshold_uncertainty_score":0.023782134},"labels":[],"label_agreement":null},{"id":"W65827093","doi":"10.1007/978-3-642-55195-6_29","title":"OpenACC Parallelisation for Diffusion Problems, Applied to Temperature Distribution on a Honeycomb Around the Bee Brood: A Worked Example Using BiCGSTAB","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Solver; Computer science; Computational science; Workstation; Parallel computing; Biconjugate gradient stabilized method; Simple (philosophy); Programmer; Compiler; Convergence (economics); Iterative method; Algorithm; Programming language; Operating system","score_opus":0.02557352308922419,"score_gpt":0.24723571241962372,"score_spread":0.22166218933039952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65827093","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.13611823,0.001487736,0.7947543,0.0012593392,0.00060118025,0.00015441616,0.0002958341,0.008062722,0.057266146],"genre_scores_gemma":[0.51118445,0.00045237274,0.46156192,0.00020472387,0.00009046294,0.00020413433,0.00037687286,0.0015162845,0.024408784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997825,0.000054104734,0.000010297048,0.000031102343,0.00008899731,0.000032976677],"domain_scores_gemma":[0.99933344,0.00032066126,0.000020248834,0.000090743786,0.00018695641,0.00004800669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046105857,0.0008099422,0.0010317552,0.00030456044,0.0011878326,0.0011513808,0.0015093985,0.0015375678,0.0077426084],"category_scores_gemma":[0.0014815002,0.00037486458,0.0006275145,0.00087733613,0.0007035134,0.0007730809,0.0010632718,0.0013933218,0.0017806396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061530265,0.00029693995,0.0013529888,0.0007546527,0.00008528422,0.0008287097,0.0008368657,0.6809946,0.03605295,0.047724396,0.019038996,0.21141835],"study_design_scores_gemma":[0.000093750954,0.00005463164,0.00021926264,0.000017199825,0.000011118255,0.00010990365,0.00006602648,0.97752213,0.0049145464,0.009932396,0.0070419144,0.000017062248],"about_ca_topic_score_codex":0.0066686976,"about_ca_topic_score_gemma":0.008519947,"teacher_disagreement_score":0.0077426084,"about_ca_system_score_codex":0.0006263634,"about_ca_system_score_gemma":0.0008170288,"threshold_uncertainty_score":0.025901616},"labels":[],"label_agreement":null},{"id":"W66126747","doi":"10.1007/978-3-662-44303-3_4","title":"Semantic Crossover Based on the Partial Derivative Error","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Centre for Addiction and Mental Health","funders":"","keywords":"Crossover; Symbolic regression; Genetic programming; Computer science; Operator (biology); Genetic algorithm; Semantics (computer science); Artificial intelligence; Theoretical computer science; Algorithm; Machine learning; Programming language","score_opus":0.01993822553721742,"score_gpt":0.2539230823723656,"score_spread":0.2339848568351482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66126747","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.04340729,0.0006153545,0.9361336,0.00024909194,0.00038563414,0.00010503471,0.00007979259,0.0006704369,0.018353792],"genre_scores_gemma":[0.67873,0.00037256524,0.30619842,0.0002240596,0.00014586859,0.0001557524,0.0002118901,0.0003959406,0.013565525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995111,0.00011002813,0.00003144309,0.000087880406,0.00020058747,0.000059007038],"domain_scores_gemma":[0.99924195,0.00036916966,0.000038472284,0.0001714838,0.00013844865,0.00004051233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097571855,0.0004003921,0.0010809009,0.000875766,0.0006261915,0.0010843435,0.0011681792,0.0009437051,0.0074254866],"category_scores_gemma":[0.0022119903,0.00018855064,0.00064917706,0.0011783723,0.0009977453,0.0014650968,0.0012486143,0.0013195436,0.0005201515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039390646,0.00020617414,0.0005064015,0.00023937896,0.00007398457,0.0002036281,0.00019304012,0.09322766,0.027776115,0.53133506,0.0039617554,0.34188282],"study_design_scores_gemma":[0.00018490461,0.00027759848,0.00090096175,0.000064010615,0.00012096943,0.00049007154,0.00006126464,0.7437227,0.014622147,0.23040764,0.009091439,0.00005627484],"about_ca_topic_score_codex":0.00040642178,"about_ca_topic_score_gemma":0.00063050294,"teacher_disagreement_score":0.0074254866,"about_ca_system_score_codex":0.00060139043,"about_ca_system_score_gemma":0.0005463241,"threshold_uncertainty_score":0.024840713},"labels":[],"label_agreement":null},{"id":"W66148744","doi":"10.1007/978-3-642-23623-5_38","title":"Effects of Ultrasound Section-Thickness on Brachytherapy Needle Tip Localization Error","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Soft Robotics and Applications","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Cancer Care Ontario","keywords":"Beamwidth; Anechoic chamber; Ultrasound; Transducer; 3D ultrasound; Calibration; Computer science; Brachytherapy; Acoustics; Optics; Biomedical engineering; Radiology; Medicine; Physics","score_opus":0.011781243438050043,"score_gpt":0.22739056700391647,"score_spread":0.21560932356586643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66148744","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.9864652,0.0012904889,0.010381541,0.0000881051,0.000096579395,0.000019617066,0.00022606696,0.00024529462,0.0011871253],"genre_scores_gemma":[0.9964651,0.00025393357,0.0021789137,0.00002947416,0.000013350656,0.0000063041552,0.0000793096,0.00015060384,0.0008229284],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933726,0.00020181158,0.00007574678,0.000111603775,0.00015282938,0.0001206461],"domain_scores_gemma":[0.9779424,0.018277481,0.0012566329,0.0008460023,0.0013379264,0.00033969316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015484403,0.0005602094,0.00048664465,0.0004630357,0.00031483782,0.00062607665,0.00038359922,0.0007065032,0.003836569],"category_scores_gemma":[0.011380835,0.0006095152,0.00043389096,0.0005643941,0.0004567872,0.00059572095,0.00071212294,0.0005160593,0.000446675],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.023989828,0.0004720864,0.021028334,0.00060143013,0.0002962097,0.0010306773,0.0006214215,0.114796296,0.77179974,0.0002960631,0.00043510244,0.064632826],"study_design_scores_gemma":[0.00018416384,0.005355976,0.115496926,0.00011526261,0.0009632155,0.001712918,0.0005234932,0.08816359,0.78593,0.0003491083,0.0010512235,0.00015406583],"about_ca_topic_score_codex":0.0015748475,"about_ca_topic_score_gemma":0.0014004488,"teacher_disagreement_score":0.003836569,"about_ca_system_score_codex":0.00043010933,"about_ca_system_score_gemma":0.00049778493,"threshold_uncertainty_score":0.012834609},"labels":[],"label_agreement":null},{"id":"W66244344","doi":"10.1007/978-3-642-21070-9_7","title":"Relation Algebraic Approaches to Fuzzy Relations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","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":"Computer science; Relation (database); Algebraic number; Algebra over a field; Fuzzy logic; Algebraic operation; Theoretical computer science; Artificial intelligence; Mathematics; Data mining; Pure mathematics","score_opus":0.17804678003356225,"score_gpt":0.3006621468857034,"score_spread":0.12261536685214117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66244344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005585174,0.023184856,0.81777704,0.002701204,0.0010793301,0.00006426081,0.0002724756,0.00028268824,0.14905302],"genre_scores_gemma":[0.35997325,0.03756498,0.5057073,0.0009967419,0.0040258025,0.00036336394,0.0008841043,0.00027791533,0.09020659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989128,0.00032663028,0.00009102995,0.00015070134,0.0004634178,0.000055458582],"domain_scores_gemma":[0.99895144,0.000599103,0.00005852103,0.00016107893,0.00018917501,0.00004068245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012979647,0.0008531319,0.0010623964,0.0027116267,0.0013890511,0.0039468687,0.0014356723,0.00087113574,0.0122148385],"category_scores_gemma":[0.002983843,0.0006829362,0.0011280263,0.004420984,0.004110109,0.00707609,0.0015002448,0.0035486224,0.0025224246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001874436,0.000003261554,0.000011999611,0.000040954823,0.00000303512,0.000011393021,0.00009097817,0.0003460032,0.000078654666,0.98951703,0.0011686236,0.008726121],"study_design_scores_gemma":[0.0000023400826,0.0000047239105,0.000030984076,0.000023877925,0.0000053078675,0.00004429063,0.000038520462,0.001967874,0.00009253957,0.9744039,0.02338053,0.000005104974],"about_ca_topic_score_codex":0.0011770496,"about_ca_topic_score_gemma":0.0012855754,"teacher_disagreement_score":0.0122148385,"about_ca_system_score_codex":0.0018213895,"about_ca_system_score_gemma":0.0006993642,"threshold_uncertainty_score":0.04086268},"labels":[],"label_agreement":null},{"id":"W66604613","doi":"10.1007/978-3-642-35632-2_14","title":"BabelTrace: A Collection of Transducers for Trace Validation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université du Québec à Chicoutimi","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Set (abstract data type); Variety (cybernetics); Process (computing); Formal specification; Software; Formal methods; Software engineering; Programming language; Artificial intelligence","score_opus":0.03085186621804042,"score_gpt":0.2848132706717848,"score_spread":0.2539614044537444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66604613","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.0006309747,0.00019650483,0.97833043,0.00007120335,0.00007933413,0.00015731154,0.0005298021,0.018030334,0.0019740972],"genre_scores_gemma":[0.054818984,0.0011795254,0.9103626,0.00040307594,0.00017014591,0.0011370467,0.0055479053,0.015172048,0.011208666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99314225,0.0017897659,0.0007334912,0.0013254731,0.0025887568,0.0004202576],"domain_scores_gemma":[0.99019086,0.0040208804,0.0004983918,0.0036886449,0.001406486,0.00019473434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005334082,0.0026674771,0.0018891797,0.0030372345,0.0013628587,0.0030529173,0.004954474,0.0025133947,0.0142431855],"category_scores_gemma":[0.015035431,0.0025700992,0.0027263619,0.0027786924,0.0023105808,0.0060121357,0.0051025604,0.0045859334,0.009742436],"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.0006694554,0.0003587115,0.0017470769,0.0025262067,0.00027415348,0.0005497505,0.00096705725,0.042649638,0.03424316,0.24615192,0.06997936,0.5998835],"study_design_scores_gemma":[0.00023072673,0.00032871458,0.0005007994,0.00066750834,0.00034259347,0.0010364506,0.00017318416,0.20178445,0.107796796,0.42938596,0.2575178,0.00023505834],"about_ca_topic_score_codex":0.0018572146,"about_ca_topic_score_gemma":0.0023137927,"teacher_disagreement_score":0.0142431855,"about_ca_system_score_codex":0.0009810565,"about_ca_system_score_gemma":0.0032139474,"threshold_uncertainty_score":0.04764819},"labels":[],"label_agreement":null},{"id":"W66661735","doi":"10.1007/978-3-642-24500-8_33","title":"Measuring the Impact of Knowledge Gained from Playing FPS and RPG Games on Gameplay Performance","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Educational Games and Gamification","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"Relation (database); Game mechanics; Computer science; Game design; Psychology; Multimedia; Human–computer interaction","score_opus":0.05368471413552289,"score_gpt":0.30752112457769837,"score_spread":0.2538364104421755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66661735","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.9968027,0.00011061633,0.0006661648,0.000015587751,0.000008015458,0.000057028283,0.00014053227,0.00003102547,0.002168401],"genre_scores_gemma":[0.99604416,0.00014954986,0.0012749326,0.000016091148,0.000006995981,0.000074023024,0.00031546262,0.000010441453,0.002108429],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986613,0.00022812538,0.00008809842,0.00027885384,0.0005490243,0.00019460786],"domain_scores_gemma":[0.9917787,0.0055046603,0.00088357145,0.00032450573,0.00052003,0.0009886889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010985327,0.0007976776,0.00060735515,0.00064073637,0.00019782908,0.00092705456,0.00074446516,0.00082193664,0.003304223],"category_scores_gemma":[0.011144067,0.00030713898,0.0006801446,0.0003327232,0.0003595136,0.00081082614,0.00085179805,0.00090083375,0.0008880914],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02216946,0.031931065,0.50984585,0.001183063,0.0019113192,0.00041064597,0.0032210418,0.013685766,0.0804277,0.0005332867,0.0013056601,0.33337507],"study_design_scores_gemma":[0.0001971436,0.018037982,0.95519084,0.00008007921,0.0005448245,0.00024557926,0.00045798917,0.0069312695,0.017296508,0.00036183032,0.0005907701,0.00006528717],"about_ca_topic_score_codex":0.0023983526,"about_ca_topic_score_gemma":0.003251808,"teacher_disagreement_score":0.003304223,"about_ca_system_score_codex":0.0003615418,"about_ca_system_score_gemma":0.00042289088,"threshold_uncertainty_score":0.011053681},"labels":[],"label_agreement":null},{"id":"W66743352","doi":"10.1007/978-3-540-73580-9_41","title":"Using Infeasibility to Improve Abstraction-Based Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Abstraction; Heuristic; Computer science; State (computer science); Mathematical optimization; Value (mathematics); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.04143490981174151,"score_gpt":0.3026837768493827,"score_spread":0.26124886703764116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66743352","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.041185986,0.0006653261,0.9450039,0.00036876753,0.0002664165,0.00019182892,0.00013250131,0.001484735,0.010700547],"genre_scores_gemma":[0.34676212,0.00044484602,0.6466155,0.0003459547,0.00013288858,0.00022638269,0.00053667865,0.0006802601,0.0042553865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628556,0.00153979,0.00020851464,0.00035977576,0.0011423845,0.0004638624],"domain_scores_gemma":[0.9819546,0.012660821,0.00068955723,0.0029898463,0.0013567309,0.00034844247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037953244,0.0020696593,0.0022188006,0.0025418473,0.0013134467,0.0020767823,0.0033800576,0.001734648,0.0086790705],"category_scores_gemma":[0.02355806,0.0015207125,0.0022311574,0.002518375,0.0016921278,0.0046938257,0.003789358,0.004976857,0.0009913117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004199877,0.00033455895,0.0014725467,0.0003775611,0.00019632421,0.00021927732,0.00043538655,0.73050755,0.0041644145,0.07014764,0.0060010324,0.18572374],"study_design_scores_gemma":[0.00006185477,0.00009038221,0.0001841156,0.00004569052,0.00007568876,0.00005583127,0.000042805485,0.9324478,0.0013385813,0.063806586,0.001826586,0.000024090445],"about_ca_topic_score_codex":0.0044877836,"about_ca_topic_score_gemma":0.007519529,"teacher_disagreement_score":0.0086790705,"about_ca_system_score_codex":0.0017384846,"about_ca_system_score_gemma":0.002389394,"threshold_uncertainty_score":0.029034376},"labels":[],"label_agreement":null},{"id":"W66763315","doi":"10.1007/978-3-642-30217-6_2","title":"Active Learning for Hierarchical Text Classification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Text and Document Classification Technologies","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":"Western University","funders":"","keywords":"Computer science; Oracle; Text categorization; Categorization; Machine learning; Active learning (machine learning); Artificial intelligence; Multi-label classification; Hierarchical database model; Relation (database); Data mining; Information retrieval","score_opus":0.034292010814983995,"score_gpt":0.2791535654519344,"score_spread":0.24486155463695042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66763315","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.0017202733,0.001110641,0.9937023,0.00013450174,0.00010023261,0.00004956038,0.0002358165,0.002145008,0.0008016892],"genre_scores_gemma":[0.084268674,0.0010790505,0.89681745,0.00022258678,0.00040423163,0.0004624135,0.002471022,0.0006188957,0.013655752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981572,0.0006342778,0.00015849213,0.00044730195,0.00050668046,0.0000960246],"domain_scores_gemma":[0.9944259,0.0039182403,0.00016982637,0.000851966,0.0005406308,0.0000933553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027344483,0.0012277471,0.001554114,0.0019192063,0.00080102234,0.0017890986,0.0038603365,0.0017761252,0.008097391],"category_scores_gemma":[0.0070738057,0.00085336354,0.0012615613,0.0021709318,0.0008883182,0.004047474,0.0021510157,0.0030752323,0.0044427556],"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.00015714053,0.00015686202,0.00029413594,0.0002522182,0.00008025937,0.000049469476,0.00011664067,0.030730026,0.0049506812,0.021372233,0.017466487,0.92437387],"study_design_scores_gemma":[0.000024018374,0.000048511785,0.0002584118,0.00003434402,0.0000319609,0.00006613345,0.000027441147,0.8990626,0.0061600404,0.0846018,0.00966309,0.000021638782],"about_ca_topic_score_codex":0.0022565704,"about_ca_topic_score_gemma":0.0033484385,"teacher_disagreement_score":0.008097391,"about_ca_system_score_codex":0.00075526634,"about_ca_system_score_gemma":0.0006562681,"threshold_uncertainty_score":0.027088463},"labels":[],"label_agreement":null},{"id":"W66990465","doi":"10.1007/978-3-642-21538-4_9","title":"Autonomous Manipulation Combining Task Space Control with Recursive Field Estimation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent 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 Waterloo","funders":"","keywords":"Computer science; Scalar (mathematics); Radial basis function; Field (mathematics); Scalar field; Control theory (sociology); Task (project management); Tracking (education); Artificial intelligence; Computer vision; Algorithm; Control (management); Artificial neural network; Mathematics","score_opus":0.015442113953158152,"score_gpt":0.22468885795134622,"score_spread":0.20924674399818807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66990465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052209306,0.00010340109,0.99203086,0.0000369132,0.000031174397,0.000020362166,0.00000883465,0.00048760173,0.002059878],"genre_scores_gemma":[0.59226424,0.00027451073,0.39701724,0.00009676799,0.00006990987,0.0001716796,0.00008690513,0.0001436978,0.009875028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977046,0.00003335758,0.000009718606,0.000059143436,0.00009974456,0.000027475833],"domain_scores_gemma":[0.9996785,0.00013313361,0.00004905069,0.00006573404,0.000054283966,0.000019199844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003395838,0.000663414,0.0007188315,0.0003276855,0.00033383243,0.0007005816,0.00086005207,0.000608382,0.0018938115],"category_scores_gemma":[0.00071464,0.0004215747,0.00041093805,0.00036310253,0.00057229697,0.0008853273,0.0011975038,0.0007515076,0.0005493736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024739225,0.00014563286,0.00035282958,0.00019147151,0.00009359589,0.00008978104,0.00018222503,0.43831137,0.15719059,0.024311367,0.002619224,0.37626454],"study_design_scores_gemma":[0.000020361213,0.00010956948,0.0002352313,0.00001051722,0.00001439122,0.000047175025,0.000009134052,0.9813592,0.00922138,0.0064298264,0.0025236334,0.000019590003],"about_ca_topic_score_codex":0.0018939413,"about_ca_topic_score_gemma":0.0023534165,"teacher_disagreement_score":0.0018939413,"about_ca_system_score_codex":0.0002596618,"about_ca_system_score_gemma":0.00049710687,"threshold_uncertainty_score":0.0063354373},"labels":[],"label_agreement":null},{"id":"W67075882","doi":"10.1007/978-3-540-78913-0_9","title":"The Lattice of Contact Relations on a Boolean Algebra","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Brock University","funders":"","keywords":"Boolean algebra; Two-element Boolean algebra; Free Boolean algebra; Boolean algebras canonically defined; Complete Boolean algebra; Algebra over a field; Set (abstract data type); Stone's representation theorem for Boolean algebras; Relation algebra; Computer science; Lattice (music); Mathematics; Theoretical computer science; Pure mathematics; Algorithm; Algebra representation; Programming language; Physics","score_opus":0.01419696534302546,"score_gpt":0.23048882174081906,"score_spread":0.2162918563977936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67075882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14128952,0.0037620584,0.55376846,0.0033254996,0.0006781402,0.00017912447,0.00203435,0.00093645,0.29402643],"genre_scores_gemma":[0.80754375,0.002945739,0.12967795,0.00071993837,0.0012650191,0.00045364088,0.0020716358,0.00038619922,0.05493613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774617,0.0006339707,0.00018029562,0.00033630343,0.0008738368,0.00022941033],"domain_scores_gemma":[0.9976528,0.0011337422,0.00023005599,0.00027431906,0.00034225846,0.00036690023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001628,0.00069319736,0.0012958834,0.002779283,0.0030528668,0.007765388,0.0016650677,0.001348341,0.012433676],"category_scores_gemma":[0.003124762,0.0009100951,0.0009916504,0.0044360915,0.004650567,0.0104726385,0.0018945156,0.0029546055,0.0020810142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018810388,0.000011269675,0.000041819283,0.000023781053,0.0000035668331,0.000027430937,0.0001046118,0.00044159376,0.00030702402,0.9942985,0.00068637665,0.004035291],"study_design_scores_gemma":[0.000009542196,0.0000064608716,0.000039328857,0.0000076074107,0.0000025696313,0.000045949804,0.000054274446,0.001853986,0.00018587323,0.9935596,0.0042278212,0.000006909552],"about_ca_topic_score_codex":0.0017200902,"about_ca_topic_score_gemma":0.0014178886,"teacher_disagreement_score":0.012433676,"about_ca_system_score_codex":0.0019862046,"about_ca_system_score_gemma":0.0012023351,"threshold_uncertainty_score":0.041594803},"labels":[],"label_agreement":null},{"id":"W67604841","doi":"10.1007/978-3-319-12337-0_26","title":"Appraisal of Emotions from Resources","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Graphics; Character (mathematics); Video game; Simple (philosophy); Resource (disambiguation); Mechanism (biology); Artificial intelligence; Multimedia; Human–computer interaction; Computer graphics (images)","score_opus":0.026034522807125905,"score_gpt":0.2795352534334653,"score_spread":0.2535007306263394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67604841","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.2672207,0.0040415484,0.03164125,0.0019429241,0.00036340096,0.00014207647,0.00032282056,0.0002521526,0.69407314],"genre_scores_gemma":[0.9622059,0.0010362786,0.00783549,0.00025175925,0.00007711481,0.0000865264,0.00030816198,0.000110553345,0.028088346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964774,0.000091544214,0.000012010508,0.000055510187,0.00014697987,0.000046291192],"domain_scores_gemma":[0.99951994,0.00021286779,0.00007010256,0.00004926454,0.000074350006,0.0000734681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039077463,0.00045350354,0.00019197876,0.00027936645,0.00028300076,0.0020291477,0.0003956793,0.00043618216,0.008288223],"category_scores_gemma":[0.0025476727,0.00017198201,0.00023889428,0.00038569333,0.00051302114,0.0017491566,0.0010998008,0.0010669713,0.0010706246],"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.0012963578,0.0003095009,0.013866757,0.0011963645,0.000272906,0.00091763056,0.016400842,0.0068593156,0.13276634,0.22338226,0.03927136,0.56346035],"study_design_scores_gemma":[0.00019836375,0.0010250625,0.30604723,0.0011955475,0.0004054261,0.0015240737,0.016702717,0.04004071,0.033383913,0.43363363,0.16556832,0.00027505538],"about_ca_topic_score_codex":0.0004651887,"about_ca_topic_score_gemma":0.00058353203,"teacher_disagreement_score":0.008288223,"about_ca_system_score_codex":0.00065779313,"about_ca_system_score_gemma":0.00024752627,"threshold_uncertainty_score":0.027726889},"labels":[],"label_agreement":null},{"id":"W67670335","doi":"10.1007/978-3-642-36505-8_7","title":"Maximal Clique Enumeration in Finding Near Neighbourhoods","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Winnipeg","funders":"","keywords":"Clique; Enumeration; Set (abstract data type); Conjecture; Computer science; Theoretical computer science; Pattern recognition (psychology); Mathematics; Artificial intelligence; Combinatorics","score_opus":0.019805871240996354,"score_gpt":0.24499195370038573,"score_spread":0.22518608245938937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67670335","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.1097047,0.0023596033,0.85880387,0.001008408,0.00013432906,0.00031361528,0.0012886216,0.0007374688,0.025649415],"genre_scores_gemma":[0.3710459,0.0012334248,0.60722506,0.00022995438,0.0001928366,0.00044131436,0.002958996,0.0003734572,0.016298994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00059045135,0.00007005864,0.00042389423,0.00038317993,0.00012809863],"domain_scores_gemma":[0.99469465,0.004042255,0.0002232041,0.0005279063,0.0002844608,0.00022761183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449921,0.00070634164,0.0019894806,0.0029551813,0.002048048,0.0025413733,0.0031510557,0.0018601278,0.0068743336],"category_scores_gemma":[0.0099763,0.0010820512,0.00162532,0.004369479,0.00178531,0.0052659204,0.003931454,0.0023447212,0.0010129956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072674005,0.000371669,0.0046683475,0.0015055533,0.0002595808,0.00037756984,0.0014192606,0.16197117,0.0055320696,0.5008244,0.022274295,0.3000693],"study_design_scores_gemma":[0.000053622014,0.00005613941,0.0007667152,0.00012956069,0.000076672615,0.00026877056,0.0003682106,0.3904759,0.0018787894,0.59806687,0.007825565,0.000033203407],"about_ca_topic_score_codex":0.002345007,"about_ca_topic_score_gemma":0.0038329202,"teacher_disagreement_score":0.0068743336,"about_ca_system_score_codex":0.001068004,"about_ca_system_score_gemma":0.0007350519,"threshold_uncertainty_score":0.022996902},"labels":[],"label_agreement":null},{"id":"W68106085","doi":"10.1007/978-3-319-09704-6_14","title":"Computation Width and Deviation Number","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Computation; Algorithm; Computer science; Measure (data warehouse); Tree (set theory); Mathematics; Discrete mathematics; Combinatorics; Data mining","score_opus":0.010084060871777527,"score_gpt":0.23601668796522018,"score_spread":0.22593262709344267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68106085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17008436,0.006298674,0.5614804,0.0077551077,0.0011698517,0.00013546608,0.00083947676,0.0013520794,0.25088465],"genre_scores_gemma":[0.86014026,0.0022834064,0.08755168,0.00061384006,0.0007270792,0.0002779711,0.0007758142,0.00085402007,0.046775926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00036627482,0.00017238222,0.0007387892,0.00074650545,0.00024427543],"domain_scores_gemma":[0.9952252,0.002801939,0.00021804319,0.0010117346,0.00042212338,0.0003209799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012833672,0.00066439377,0.0011540948,0.001220562,0.0012434645,0.004350139,0.0017450608,0.0012304421,0.009681023],"category_scores_gemma":[0.008150927,0.0007283513,0.0010049102,0.002099946,0.0038361514,0.010273658,0.0035652304,0.005287199,0.002277789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086979424,0.000015800933,0.0001967138,0.00007130843,0.0000075506828,0.000025793268,0.0001224149,0.0025324675,0.0016204623,0.9669476,0.002669149,0.025703687],"study_design_scores_gemma":[0.00000844772,0.000009397125,0.0000810482,0.000017009506,0.000006876212,0.0000587177,0.000026466065,0.0060786707,0.0014765768,0.9875309,0.004696558,0.000009335635],"about_ca_topic_score_codex":0.00026312214,"about_ca_topic_score_gemma":0.00023849693,"teacher_disagreement_score":0.009681023,"about_ca_system_score_codex":0.0015582029,"about_ca_system_score_gemma":0.0008056174,"threshold_uncertainty_score":0.032386243},"labels":[],"label_agreement":null},{"id":"W68432310","doi":"10.1007/978-3-642-21593-3_40","title":"Multi-camera Relay Tracker Utilizing Color-Based Particle Filtering","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","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":"Simon Fraser University","funders":"","keywords":"Computer vision; Computer science; Artificial intelligence; Zoom; Particle filter; Object (grammar); Camera auto-calibration; Video tracking; Tracking (education); Relay; Tracking system; Smart camera; Computer graphics (images); Camera resectioning; Kalman filter; Engineering","score_opus":0.06835402357566918,"score_gpt":0.2965861012071847,"score_spread":0.22823207763151554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68432310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004676393,0.00022261118,0.992093,0.0000274472,0.00010402002,0.000022730106,0.00002600027,0.0012470528,0.001580676],"genre_scores_gemma":[0.23693852,0.0006411007,0.7530087,0.00007048635,0.00011890835,0.000087210676,0.0002117154,0.00019909376,0.008724172],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947506,0.000059042337,0.000020267025,0.00019475436,0.00021741282,0.00003349233],"domain_scores_gemma":[0.9995314,0.00009114602,0.000055121443,0.00009940244,0.00019156338,0.00003126557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066244457,0.00094551186,0.0014533215,0.0009943225,0.00045424228,0.0013178318,0.0013731008,0.0012708349,0.0019670676],"category_scores_gemma":[0.0010486066,0.0005199465,0.0007693245,0.0011414672,0.00029342293,0.001324958,0.00095527637,0.0009467901,0.0023110074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006395197,0.00020515152,0.0019072013,0.00024656882,0.00017740726,0.00031109262,0.00022679486,0.08664831,0.17715819,0.009840745,0.0072213374,0.7154176],"study_design_scores_gemma":[0.000032603864,0.00013603095,0.0010501413,0.000012534716,0.00007164698,0.00030205614,0.000020824487,0.94917667,0.042217053,0.0013106144,0.0056347735,0.000034948367],"about_ca_topic_score_codex":0.002035733,"about_ca_topic_score_gemma":0.0021058857,"teacher_disagreement_score":0.002035733,"about_ca_system_score_codex":0.0005112521,"about_ca_system_score_gemma":0.00062159484,"threshold_uncertainty_score":0.0065805316},"labels":[],"label_agreement":null},{"id":"W6854689","doi":"10.1007/3-540-45065-3_15","title":"Novel Mixtures Based on the Dirichlet Distribution: Application to Data and Image Classification","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Dirichlet distribution; Multinomial distribution; Mixture model; Pattern recognition (psychology); Flexibility (engineering); Computer science; Generalized Dirichlet distribution; Gaussian; Artificial intelligence; Latent Dirichlet allocation; Distribution (mathematics); Mathematics; Mixture distribution; Algorithm; Data mining; Statistics; Probability density function; Dirichlet series; Topic model; Mathematical analysis","score_opus":0.05029383037741484,"score_gpt":0.30807569770767884,"score_spread":0.257781867330264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6854689","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.0010319231,0.00035033023,0.9978492,0.00011403077,0.00004650592,0.000016122967,0.00003340881,0.00021328757,0.00034523453],"genre_scores_gemma":[0.050214764,0.0012632144,0.9436363,0.00023235117,0.00037891275,0.00023482968,0.00038361116,0.00046804722,0.003188019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966388,0.0014939724,0.0002012557,0.0006044697,0.00089238264,0.00016910408],"domain_scores_gemma":[0.9922218,0.005950818,0.00030003872,0.00059133413,0.00071379956,0.0002222171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005736251,0.0013535222,0.0027986357,0.0029210686,0.0014997778,0.0037768518,0.004055455,0.0033241177,0.003958762],"category_scores_gemma":[0.018077295,0.001615535,0.0031086388,0.0056152977,0.0021110184,0.005178548,0.0040280563,0.0051422305,0.0021260262],"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.0003891082,0.0001793338,0.0012608909,0.00057446,0.00025563154,0.00019094953,0.0007337131,0.22831176,0.006163506,0.24844238,0.014254113,0.4992441],"study_design_scores_gemma":[0.000018249613,0.00001850491,0.00014813949,0.000027539754,0.000032520984,0.00012922261,0.0000343907,0.863432,0.0011846402,0.13167523,0.0032697301,0.000029794819],"about_ca_topic_score_codex":0.0031405063,"about_ca_topic_score_gemma":0.004075888,"teacher_disagreement_score":0.005736251,"about_ca_system_score_codex":0.0015883878,"about_ca_system_score_gemma":0.0012746637,"threshold_uncertainty_score":0.030336559},"labels":[],"label_agreement":null},{"id":"W68651292","doi":"10.1007/978-3-540-92698-6_21","title":"Toward Quality-Centered Design of Groupware Architectures","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Usability and User Interface Design","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":"Queen's University","funders":"","keywords":"Collaborative software; Computer science; Software engineering; Computer-supported cooperative work; Software architecture; Software quality; Concurrent engineering; Quality (philosophy); Software development; Software; Systems engineering; Human–computer interaction; Work (physics); Knowledge management; Engineering","score_opus":0.09421498651508603,"score_gpt":0.2939068842782089,"score_spread":0.19969189776312285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68651292","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.0058472105,0.00016778224,0.98964745,0.00018187042,0.000020450709,0.00008667715,0.000012295579,0.00037487637,0.0036614544],"genre_scores_gemma":[0.108019896,0.00036111491,0.8877719,0.00010234789,0.00002198389,0.00017465923,0.00009959616,0.00028227,0.0031662872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958508,0.0015593346,0.00023113405,0.00030152636,0.0017892255,0.00026794637],"domain_scores_gemma":[0.99592006,0.00097609375,0.0002856327,0.0010087704,0.0016167533,0.00019269125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054314677,0.0009711494,0.00053794123,0.00097118004,0.0007413106,0.0040168106,0.0026470504,0.0012555467,0.0037382764],"category_scores_gemma":[0.007656427,0.00111108,0.0008188878,0.00057815784,0.0012666616,0.0033945488,0.0021538895,0.0021434838,0.0008902073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001462799,0.00026534035,0.0022750515,0.0006393205,0.0001452814,0.00019257373,0.00476451,0.11980073,0.033897948,0.4816666,0.0062556104,0.3499508],"study_design_scores_gemma":[0.00011055058,0.0003822758,0.0012247043,0.00047431182,0.00021423228,0.00032956718,0.0015934114,0.5296047,0.038102653,0.3373485,0.09055005,0.000065018336],"about_ca_topic_score_codex":0.0020329142,"about_ca_topic_score_gemma":0.0033810218,"teacher_disagreement_score":0.0054314677,"about_ca_system_score_codex":0.0011808971,"about_ca_system_score_gemma":0.0020124048,"threshold_uncertainty_score":0.02872473},"labels":[],"label_agreement":null},{"id":"W68801812","doi":"10.1007/978-3-642-23629-7_35","title":"Connectivity-Informed fMRI Activation Detection","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Functional connectivity; Resting state fMRI; Univariate; Computer science; Brain activity and meditation; Oracle; Generative model; Stimulus (psychology); Task (project management); Neuroscience; Psychology; Artificial intelligence; Machine learning; Cognitive psychology; Generative grammar; Multivariate statistics; Electroencephalography","score_opus":0.046106142394982216,"score_gpt":0.2640572874384486,"score_spread":0.21795114504346635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68801812","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.032670457,0.0006951361,0.96187633,0.0003601627,0.00007218617,0.000070313734,0.0003927045,0.0009054973,0.0029572698],"genre_scores_gemma":[0.42227802,0.0010354739,0.568251,0.00034010716,0.00020045206,0.0001864949,0.0010781086,0.00042001033,0.006210308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.000084459374,0.000010208661,0.000048809223,0.000067226836,0.000028431285],"domain_scores_gemma":[0.999577,0.00023893044,0.00003881663,0.00005270932,0.00007289712,0.000019649075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066592405,0.00082595577,0.0005459368,0.0008136736,0.00036241347,0.0008326295,0.00072475534,0.0011908652,0.0037116196],"category_scores_gemma":[0.0034160533,0.0006137283,0.00056436885,0.00081301556,0.00028740926,0.0011258363,0.00073686766,0.0008977524,0.0011294585],"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.00066336524,0.00019347246,0.0018067417,0.0003566841,0.0002221634,0.00039128977,0.00010779214,0.049381327,0.37101293,0.009309973,0.006167761,0.5603865],"study_design_scores_gemma":[0.00006633553,0.00019663494,0.008475851,0.00004314523,0.00019226427,0.0013225558,0.000039791885,0.84652424,0.115745105,0.02131164,0.006001137,0.000081385275],"about_ca_topic_score_codex":0.0012000992,"about_ca_topic_score_gemma":0.0043396926,"teacher_disagreement_score":0.0037116196,"about_ca_system_score_codex":0.00019979122,"about_ca_system_score_gemma":0.00056643307,"threshold_uncertainty_score":0.012416601},"labels":[],"label_agreement":null},{"id":"W69190861","doi":"10.1007/978-3-642-36315-3_9","title":"Reversible and Quantum Circuit Optimization: A Functional Approach","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quantum; Electronic circuit; Quantum circuit; Influence diagram; Function (biology); Quantum computer; Algorithm; Theoretical computer science; Quantum network; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.01949762001306499,"score_gpt":0.2073915555210317,"score_spread":0.1878939355079667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69190861","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.010901459,0.004625283,0.71636504,0.00489298,0.00087064784,0.00008783065,0.00021460136,0.00024199646,0.26180017],"genre_scores_gemma":[0.6023753,0.010545567,0.22141278,0.0020165106,0.0022287886,0.00045609794,0.00034220103,0.00071398536,0.1599087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995975,0.00013915884,0.00001533283,0.00005634227,0.00014836302,0.000043274533],"domain_scores_gemma":[0.999632,0.00020012523,0.000018862116,0.000084472405,0.000046340596,0.000018170997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077193003,0.00081006455,0.00079853815,0.0009893785,0.00080010423,0.0013750172,0.0022108795,0.0017460155,0.012241275],"category_scores_gemma":[0.0013232405,0.0005034289,0.0010719749,0.0012136087,0.0033224167,0.0031971447,0.0011166709,0.002257696,0.0012873465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028217196,0.0000070003866,0.0000064620976,0.000027776245,0.0000035471057,0.000005738461,0.000010280339,0.0032382489,0.00021741312,0.9911548,0.0008631316,0.004462753],"study_design_scores_gemma":[0.00000322433,0.000009007517,0.000023600649,0.000010155277,0.0000042294273,0.00001906264,0.0000072580433,0.018516116,0.00032586217,0.9759705,0.0051041716,0.000006888634],"about_ca_topic_score_codex":0.0007566952,"about_ca_topic_score_gemma":0.0009987797,"teacher_disagreement_score":0.012241275,"about_ca_system_score_codex":0.0011789791,"about_ca_system_score_gemma":0.00072930625,"threshold_uncertainty_score":0.040951133},"labels":[],"label_agreement":null},{"id":"W69236537","doi":"10.1007/978-3-642-25566-3_47","title":"HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; State (computer science); Range (aeronautics); Algorithm; Software engineering; Engineering","score_opus":0.02214497837932569,"score_gpt":0.24690902476520954,"score_spread":0.22476404638588385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69236537","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.000343138,0.00017247802,0.9952246,0.000096029886,0.000024359686,0.000070024515,0.00013861549,0.0026257683,0.0013049457],"genre_scores_gemma":[0.025853315,0.00056087814,0.96878135,0.00019170364,0.00009563154,0.0004967964,0.00066447636,0.001242316,0.0021135288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993676,0.002314077,0.0004214735,0.0006394497,0.0025115386,0.00043752167],"domain_scores_gemma":[0.9918643,0.00472066,0.0003718464,0.0017873887,0.0010691778,0.0001866184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051912,0.0030926792,0.001946218,0.0022221496,0.001592484,0.00509058,0.007642463,0.0020043051,0.015322333],"category_scores_gemma":[0.01270535,0.0021154096,0.0033802104,0.0022520497,0.0035943063,0.0062050517,0.0042377906,0.0063333525,0.0057164025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023544359,0.000120430595,0.00045389324,0.0012728985,0.00019009548,0.00016837036,0.00020981317,0.21205296,0.004239402,0.55974257,0.024791388,0.19652282],"study_design_scores_gemma":[0.00008744535,0.000055642995,0.00009873125,0.00015950203,0.00005720844,0.00008060093,0.00004636346,0.5711131,0.0067193415,0.38711923,0.034414344,0.000048452446],"about_ca_topic_score_codex":0.0050211023,"about_ca_topic_score_gemma":0.0061799614,"teacher_disagreement_score":0.015322333,"about_ca_system_score_codex":0.0023636592,"about_ca_system_score_gemma":0.004314133,"threshold_uncertainty_score":0.051258266},"labels":[],"label_agreement":null},{"id":"W69341431","doi":"10.1007/978-3-642-41905-8_2","title":"DT-RANSAC: A Delaunay Triangulation Based Scheme for Improved RANSAC Feature Matching","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"RANSAC; Delaunay triangulation; Robustness (evolution); Outlier; Computer science; Artificial intelligence; Computer vision; Matching (statistics); Pattern recognition (psychology); Invariant (physics); Mathematics; Image (mathematics); Algorithm; Statistics","score_opus":0.015773258475983865,"score_gpt":0.26821864570966003,"score_spread":0.25244538723367616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69341431","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.0010376743,0.00019877357,0.9958696,0.000035730263,0.000084095744,0.00004500385,0.00010027902,0.0018786466,0.0007501801],"genre_scores_gemma":[0.017588286,0.0003165894,0.97492015,0.00008205359,0.00006295499,0.00009003698,0.0007597766,0.0006497179,0.0055304714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743134,0.00037077972,0.00012592463,0.00036562537,0.0015688421,0.00013749777],"domain_scores_gemma":[0.9984971,0.00023376911,0.00011316481,0.0004517088,0.0006564353,0.000047719444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012495029,0.0016316009,0.0018530797,0.00203782,0.0008140652,0.0014693794,0.0031190414,0.002175517,0.0120953135],"category_scores_gemma":[0.0034302366,0.0010921505,0.001355563,0.0033749742,0.00062055065,0.0023908073,0.0023436418,0.002157878,0.01013942],"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.00015925735,0.000070707305,0.00029648756,0.00021022733,0.00008984861,0.00011634029,0.00011877436,0.042690232,0.038711518,0.007392913,0.021973373,0.88817024],"study_design_scores_gemma":[0.000028396016,0.00009596114,0.00050059805,0.000039556122,0.00003645763,0.00040524706,0.00004128599,0.9156346,0.038949877,0.004274089,0.039916273,0.000077627185],"about_ca_topic_score_codex":0.0059443535,"about_ca_topic_score_gemma":0.007318953,"teacher_disagreement_score":0.0120953135,"about_ca_system_score_codex":0.0006300966,"about_ca_system_score_gemma":0.0012295997,"threshold_uncertainty_score":0.040462792},"labels":[],"label_agreement":null},{"id":"W69956373","doi":"10.1007/978-3-642-38236-9_18","title":"On the Sublinear Processor Gap for Parallel Architectures","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sublinear function; Computer science; Parallel computing; Lemma (botany); Parallel algorithm; Parallelism (grammar); Architecture; Analysis of parallel algorithms; Algorithm; Discrete mathematics; Mathematics","score_opus":0.02870829396250173,"score_gpt":0.26674835929370133,"score_spread":0.2380400653311996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69956373","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.046562225,0.06365268,0.5759267,0.02383544,0.0073557333,0.00009658016,0.0006025316,0.0031538107,0.2788143],"genre_scores_gemma":[0.6319149,0.024804324,0.21449722,0.007809248,0.0051177973,0.00055527134,0.00089442875,0.0040443586,0.11036241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989862,0.000289118,0.00004604194,0.00013026177,0.0003435926,0.00020474885],"domain_scores_gemma":[0.9969085,0.0020136824,0.00010251134,0.00050582824,0.0003132754,0.00015615573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016492655,0.0012613288,0.0014500963,0.0011048275,0.0009889388,0.0021397308,0.0017902256,0.0015209791,0.018736525],"category_scores_gemma":[0.009109099,0.0007074141,0.0007495018,0.0012973469,0.002496349,0.008689711,0.0033978845,0.0072856345,0.004664906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020431327,0.000045703157,0.00020899651,0.000318254,0.000016147249,0.000077824916,0.00012797384,0.01339971,0.0016555414,0.885506,0.040042296,0.05839734],"study_design_scores_gemma":[0.000022325734,0.000020560214,0.00009969049,0.00006179826,0.000009993698,0.00006570233,0.00003276745,0.05707791,0.00093420455,0.9213238,0.020341674,0.000009678412],"about_ca_topic_score_codex":0.0011541354,"about_ca_topic_score_gemma":0.001243622,"teacher_disagreement_score":0.018736525,"about_ca_system_score_codex":0.0014401808,"about_ca_system_score_gemma":0.0010120205,"threshold_uncertainty_score":0.06267989},"labels":[],"label_agreement":null},{"id":"W70046263","doi":"10.1007/978-3-540-30125-7_17","title":"A New Numerical Scheme for Anisotropic Diffusion","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","funders":"","keywords":"Smoothing; Computer science; Diffusion; Anisotropic diffusion; Algorithm; Scheme (mathematics); Diffusion process; Process (computing); Mathematical optimization; Artificial intelligence; Mathematics; Mathematical analysis; Computer vision; Physics; Innovation diffusion","score_opus":0.015733562597264217,"score_gpt":0.25052251748230886,"score_spread":0.23478895488504464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70046263","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.0036044572,0.00018087373,0.9911253,0.00013104142,0.000295684,0.000048924634,0.000047895875,0.0003140832,0.0042518685],"genre_scores_gemma":[0.047410868,0.0002959457,0.9426719,0.00011211704,0.00010293523,0.00016178717,0.000116373114,0.00032780514,0.008800201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966645,0.00005953384,0.000023883733,0.000038568436,0.00018954219,0.00002198473],"domain_scores_gemma":[0.99957484,0.00010176548,0.000034386478,0.00009541719,0.00014722488,0.00004623324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059833995,0.00057736266,0.0006975796,0.00066958275,0.00060573296,0.0009809447,0.0014717241,0.0012892466,0.0038829232],"category_scores_gemma":[0.0018204291,0.00037763108,0.0006530686,0.0006510681,0.00084302906,0.0012257543,0.0017912502,0.0015990462,0.0012239249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020388575,0.00015081748,0.0004744952,0.00031162644,0.000076681004,0.00017246012,0.00031996222,0.21533644,0.069722116,0.46893215,0.011248718,0.23305073],"study_design_scores_gemma":[0.000052404444,0.000030195826,0.00008438059,0.000018309525,0.000014097552,0.00009215467,0.000010634776,0.9458159,0.0042217043,0.028892998,0.020742133,0.000025098863],"about_ca_topic_score_codex":0.0021352263,"about_ca_topic_score_gemma":0.0028555861,"teacher_disagreement_score":0.0038829232,"about_ca_system_score_codex":0.00059678365,"about_ca_system_score_gemma":0.00074712996,"threshold_uncertainty_score":0.01298964},"labels":[],"label_agreement":null},{"id":"W70090750","doi":"10.1007/978-3-319-01790-7_22","title":"Kinds of Full Physical Containment","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Geological Survey of Canada; Natural Resources Canada","funders":"","keywords":"Containment (computer programming); Ontology; Situated; Relation (database); Taxonomy (biology); Computer science; Physical space; Space (punctuation); Artificial intelligence; Epistemology; Geography; Data mining; Cartography; Ecology; Philosophy; Biology","score_opus":0.01566630197405356,"score_gpt":0.24283130832020877,"score_spread":0.22716500634615522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70090750","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.0215188,0.0046203528,0.24420328,0.0030153145,0.0010687022,0.0000712429,0.00088608335,0.0010224476,0.72359383],"genre_scores_gemma":[0.7985784,0.0038928948,0.10133147,0.0015932589,0.0010464014,0.0002795178,0.002138092,0.0011497454,0.08999036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808407,0.00044884978,0.00015685809,0.0005048082,0.0005871639,0.00021829738],"domain_scores_gemma":[0.9979442,0.0007337232,0.00008539734,0.0008416191,0.00031001263,0.000085044696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011733046,0.0006651718,0.00078654767,0.0021711055,0.0026911881,0.004769352,0.001485467,0.0019148745,0.01634541],"category_scores_gemma":[0.0046810093,0.0011154148,0.001076109,0.0022459326,0.0082862,0.017525906,0.0049322764,0.003360361,0.0026031048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048168595,0.0000022818142,0.00002061008,0.000021521066,0.0000019050603,0.00002095024,0.00017470501,0.00006289164,0.00010849481,0.9940685,0.0016505048,0.0038627249],"study_design_scores_gemma":[0.0000035247062,0.000002683714,0.000051081533,0.000027069033,0.000005466236,0.00013628212,0.00010027725,0.00035599546,0.000255736,0.96845275,0.030602828,0.0000063733496],"about_ca_topic_score_codex":0.0008834431,"about_ca_topic_score_gemma":0.00081842,"teacher_disagreement_score":0.01634541,"about_ca_system_score_codex":0.0013367878,"about_ca_system_score_gemma":0.0005667968,"threshold_uncertainty_score":0.054680824},"labels":[],"label_agreement":null},{"id":"W70108313","doi":"10.1007/978-3-642-16584-9_9","title":"On the Robust Control of Systems Preceded by Differential Equation-Based Hysteresis Nonlinearities","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Piezoelectric Actuators and Control","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":"Concordia University","funders":"","keywords":"Hysteresis; Control theory (sociology); Nonlinear system; Computer science; Inverse; Controller (irrigation); Stability (learning theory); Differential (mechanical device); Differential equation; Robust control; Control (management); Mathematics; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.009224610694591738,"score_gpt":0.18212453903663633,"score_spread":0.1728999283420446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70108313","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.016416322,0.0015135169,0.9730006,0.00017715168,0.00020015954,0.000051584764,0.000045437773,0.00034487044,0.008250302],"genre_scores_gemma":[0.94400585,0.0017581903,0.045572426,0.0001416072,0.00021324806,0.00019179727,0.0001218216,0.00014103817,0.007854022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.0000989407,0.000028927865,0.000100684505,0.0001354238,0.000054273587],"domain_scores_gemma":[0.9990128,0.00066932803,0.00009652889,0.0000880199,0.00011662923,0.000016595106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010250913,0.00085454714,0.0012918008,0.000386255,0.0003202473,0.0011481111,0.0011162668,0.00093688205,0.002922131],"category_scores_gemma":[0.0025297573,0.0003814153,0.0007907844,0.00040987428,0.001142542,0.00087594707,0.0011681792,0.0010361217,0.00036830723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027307685,0.000053810498,0.00015635237,0.00041154685,0.00013613582,0.00016451115,0.00019215407,0.8428412,0.015769007,0.05741254,0.0015549267,0.08103466],"study_design_scores_gemma":[0.000014445006,0.00010608558,0.000115142946,0.000020428854,0.000015564916,0.000021606595,0.000007880623,0.9865311,0.0015916602,0.010504772,0.0010589485,0.0000124339795],"about_ca_topic_score_codex":0.0029016605,"about_ca_topic_score_gemma":0.0018376994,"teacher_disagreement_score":0.002922131,"about_ca_system_score_codex":0.0004447116,"about_ca_system_score_gemma":0.00044982092,"threshold_uncertainty_score":0.00977546},"labels":[],"label_agreement":null},{"id":"W70663488","doi":"10.1007/978-3-319-07425-2_11","title":"A Distributed Time-Domain Approach to Mitigating the Impact of Periodic Interference","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Harvesting in Wireless Networks","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":"MacEwan University","funders":"","keywords":"Computer science; Network packet; Cognitive radio; Latency (audio); Interference (communication); Wireless sensor network; Computer network; Wireless; Scheduling (production processes); Time domain; Wireless network; Real-time computing; Low latency (capital markets); Distributed computing; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.009845968556999088,"score_gpt":0.21563299741016545,"score_spread":0.20578702885316635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70663488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028167125,0.00025732524,0.9932087,0.00006226992,0.00009684019,0.000012240072,0.000008600287,0.00011121997,0.0034260221],"genre_scores_gemma":[0.360157,0.0015203127,0.6144287,0.00041628967,0.00036356176,0.0001128173,0.00009430087,0.0001237968,0.022783346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998313,0.000034507862,0.0000063466305,0.00003874373,0.000074297524,0.00001478384],"domain_scores_gemma":[0.9997211,0.00013126354,0.000021530152,0.000039988092,0.00007427311,0.000011778461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027861237,0.00062976667,0.0005030092,0.00025589808,0.00030785752,0.0006271901,0.0010213943,0.00075708155,0.0033161764],"category_scores_gemma":[0.000757608,0.0001912421,0.0004129536,0.00038360013,0.00041390324,0.0006639577,0.00066855864,0.00072992546,0.00078876776],"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.00029414965,0.00026156622,0.0003099908,0.00029326315,0.00011879275,0.00023990413,0.0001414174,0.35620266,0.18754317,0.06310655,0.005260976,0.38622758],"study_design_scores_gemma":[0.000017495851,0.000104031424,0.0000974227,0.000014756102,0.000023663468,0.00018614871,0.000024485114,0.9694661,0.011549731,0.013733517,0.004768869,0.000013819704],"about_ca_topic_score_codex":0.00029497876,"about_ca_topic_score_gemma":0.0006096631,"teacher_disagreement_score":0.0033161764,"about_ca_system_score_codex":0.0002125219,"about_ca_system_score_gemma":0.00029170304,"threshold_uncertainty_score":0.011093676},"labels":[],"label_agreement":null},{"id":"W7076050457","doi":"10.1007/978-3-032-01907-3","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","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":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Tsinghua University; Bar-Ilan University; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Carnegie Mellon University; Indian Institute of Science; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Centre National de la Recherche Scientifique; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"","score_opus":0.004636664754943248,"score_gpt":0.2508031874447178,"score_spread":0.24616652268977454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076050457","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028287063,0.047731448,0.028403515,0.01875978,0.022922553,0.000103070306,0.0012026024,0.0010674422,0.8769809],"genre_scores_gemma":[0.052639138,0.03734364,0.015560896,0.00413886,0.014950119,0.000100001635,0.0019238916,0.0009080348,0.87243545],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991912,0.00015383438,0.000033720655,0.000104472834,0.00041453447,0.000102189064],"domain_scores_gemma":[0.9990471,0.00029423664,0.000063179505,0.00021204574,0.00023718618,0.00014620186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010863101,0.0013480303,0.00060978805,0.0018088415,0.0009867108,0.004567813,0.00077793474,0.0012701948,0.06948031],"category_scores_gemma":[0.0026888843,0.0004998423,0.00038894961,0.002626295,0.001200241,0.00716482,0.0016730751,0.0038834712,0.044961385],"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.00010286363,0.000048982296,0.000078771016,0.00031233646,0.000014941178,0.000049309816,0.000028306822,0.0011512728,0.00076314807,0.19285008,0.5450184,0.2595816],"study_design_scores_gemma":[0.000023887607,0.000036053494,0.00020339078,0.00018031285,0.00000805517,0.00020362019,0.00001533054,0.0021110433,0.0008330866,0.074466735,0.921906,0.000012520048],"about_ca_topic_score_codex":0.0007427694,"about_ca_topic_score_gemma":0.00087542227,"teacher_disagreement_score":0.06948031,"about_ca_system_score_codex":0.0024902853,"about_ca_system_score_gemma":0.0015075188,"threshold_uncertainty_score":0.23243475},"labels":[],"label_agreement":null},{"id":"W7076053579","doi":"10.1007/978-3-032-01855-7_7","title":"Sample Efficient Search to Decision for kLIN","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reduction (mathematics); Cryptography; Polynomial; Constant (computer programming); Noise (video); Time complexity; Sample (material)","score_opus":0.011352747698533136,"score_gpt":0.2756917872469586,"score_spread":0.26433903954842547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076053579","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027641984,0.0011273293,0.94847596,0.0021506113,0.00024031373,0.0002912467,0.00134674,0.0025608384,0.016164917],"genre_scores_gemma":[0.5019608,0.0005745469,0.4570175,0.0013331964,0.00051058095,0.0008204066,0.0042699142,0.0010784087,0.032434627],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744934,0.0011443006,0.00011947766,0.0005219869,0.000399664,0.0003651873],"domain_scores_gemma":[0.9918573,0.0065638707,0.00019047933,0.000812444,0.00036588652,0.00021005786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027465338,0.0012487058,0.0026469307,0.001520166,0.0008040626,0.002800297,0.0022949816,0.0023430297,0.026339196],"category_scores_gemma":[0.0162705,0.00089644926,0.0013876838,0.0017978059,0.0017778516,0.004471283,0.0033920894,0.0033344387,0.0035460587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021299599,0.00056255615,0.0011355378,0.00061790686,0.00016613609,0.00019892138,0.00021769786,0.21511275,0.0018306884,0.26732433,0.071306154,0.43939736],"study_design_scores_gemma":[0.00016836621,0.00011741835,0.00014520402,0.000044859757,0.000025946745,0.000055488996,0.000050805334,0.7387313,0.0010029129,0.25637186,0.0032716116,0.000014266811],"about_ca_topic_score_codex":0.0022178697,"about_ca_topic_score_gemma":0.0028608714,"teacher_disagreement_score":0.026339196,"about_ca_system_score_codex":0.002037597,"about_ca_system_score_gemma":0.0031820207,"threshold_uncertainty_score":0.08811343},"labels":[],"label_agreement":null},{"id":"W7076053884","doi":"10.1007/978-3-032-01907-3_17","title":"Rate-1 Statistical Non-interactive Zero-Knowledge","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Water Quality and Resources Studies","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Soundness; Constant (computer programming); Time complexity; Argument (complex analysis); Statistical model; Computational complexity theory; Statistical hypothesis testing","score_opus":0.022620672355763156,"score_gpt":0.2633588761988614,"score_spread":0.24073820384309824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076053884","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040753633,0.00053786207,0.96564883,0.00054031133,0.0003182794,0.00006477502,0.00038372734,0.0020356171,0.02639532],"genre_scores_gemma":[0.49995095,0.0017855205,0.39322186,0.0011628558,0.0013606206,0.00069770776,0.0018604681,0.0028432957,0.097116776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951997,0.0013699147,0.0001890438,0.0006831822,0.0017426148,0.000815592],"domain_scores_gemma":[0.98565316,0.008587449,0.00040973144,0.003570982,0.0014162433,0.0003624789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038482863,0.0015891311,0.0021850355,0.0013485138,0.0013542939,0.0037030056,0.0040700915,0.0020960385,0.029773595],"category_scores_gemma":[0.020609306,0.0008328783,0.0016139054,0.0019965083,0.0026753168,0.0049576373,0.006571813,0.0041179177,0.01006069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041100656,0.00010074493,0.00026606594,0.0002848074,0.0000748787,0.00012745084,0.00014745722,0.053899605,0.0029637436,0.7955966,0.021221612,0.12490605],"study_design_scores_gemma":[0.00004646536,0.00008408826,0.00010197915,0.00006372904,0.000038746773,0.00021166613,0.000032049928,0.33638528,0.0044468604,0.6444585,0.014075909,0.00005471753],"about_ca_topic_score_codex":0.0013780515,"about_ca_topic_score_gemma":0.0011565143,"teacher_disagreement_score":0.029773595,"about_ca_system_score_codex":0.001647722,"about_ca_system_score_gemma":0.0027584734,"threshold_uncertainty_score":0.09960258},"labels":[],"label_agreement":null},{"id":"W7076054113","doi":"10.1007/978-3-032-01887-8_16","title":"On the Adaptive Security of FROST","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Engineering and Material Science Research","field":"Materials Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adversary; Protocol (science); Upper and lower bounds; Frost (temperature); Standardization; Cryptographic protocol; Language change","score_opus":0.016355762859118328,"score_gpt":0.2572061825610527,"score_spread":0.24085041970193438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076054113","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09140115,0.003699291,0.7696869,0.004838108,0.0009985896,0.00009968801,0.00016075373,0.0010091387,0.12810639],"genre_scores_gemma":[0.88584644,0.0024169087,0.0640175,0.0008034342,0.00063802407,0.000057617828,0.00016226173,0.00027762263,0.045780227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994122,0.00013782024,0.000021709715,0.00009805041,0.00022049417,0.000109724584],"domain_scores_gemma":[0.998889,0.0005672899,0.000072565585,0.00031148473,0.000108383894,0.000051310424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070125423,0.0005016398,0.000615239,0.0006922263,0.00088547077,0.0015239163,0.00097346306,0.0010053344,0.0076906676],"category_scores_gemma":[0.004691658,0.00027399661,0.00043230725,0.00067126856,0.002684156,0.004672189,0.0025446669,0.0023313477,0.0011435508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019934599,0.000025869362,0.00036140502,0.00004884769,0.00001984466,0.00008257931,0.0001582125,0.033185836,0.00450928,0.88433033,0.008775266,0.06830332],"study_design_scores_gemma":[0.000027809001,0.00006889059,0.00031024768,0.000038387185,0.000012138269,0.00017017088,0.00008387195,0.1829742,0.002617524,0.7951887,0.018481832,0.000026189495],"about_ca_topic_score_codex":0.0015029688,"about_ca_topic_score_gemma":0.0012491393,"teacher_disagreement_score":0.0076906676,"about_ca_system_score_codex":0.00080308126,"about_ca_system_score_gemma":0.0004411934,"threshold_uncertainty_score":0.025727868},"labels":[],"label_agreement":null},{"id":"W7076054160","doi":"10.1007/978-3-032-01887-8","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Tsinghua University; Bar-Ilan University; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Carnegie Mellon University; Indian Institute of Science; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Centre National de la Recherche Scientifique; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"","score_opus":0.00905826103545584,"score_gpt":0.25001810004117336,"score_spread":0.24095983900571752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076054160","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011069366,0.050098553,0.16635233,0.05205923,0.045896582,0.000516021,0.0071498035,0.008502615,0.6583556],"genre_scores_gemma":[0.20526479,0.04115364,0.089370996,0.013803731,0.027958507,0.0008232985,0.013290828,0.0042996616,0.60403454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775416,0.00052159524,0.0001562882,0.00033000717,0.00091299386,0.00032494325],"domain_scores_gemma":[0.9969818,0.0010164059,0.00018187745,0.0009132163,0.00056782225,0.00033881812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172268,0.0017155715,0.0014261982,0.002317557,0.0016838233,0.0068609766,0.0013139859,0.001777673,0.077608235],"category_scores_gemma":[0.006570882,0.00066417095,0.00063427055,0.0038661119,0.0017001341,0.0096624065,0.0025855347,0.0049352422,0.063727],"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.00045296384,0.00009911696,0.0001676693,0.00042319132,0.00003930954,0.000074059804,0.00003252734,0.0027222342,0.0009997188,0.12928486,0.61586934,0.24983504],"study_design_scores_gemma":[0.00021050281,0.000108671025,0.00029229003,0.00031918267,0.000038767546,0.00035937974,0.000035498375,0.011311461,0.0023456237,0.19431737,0.79062134,0.000039949366],"about_ca_topic_score_codex":0.0010427749,"about_ca_topic_score_gemma":0.0009474273,"teacher_disagreement_score":0.077608235,"about_ca_system_score_codex":0.0027809807,"about_ca_system_score_gemma":0.002880529,"threshold_uncertainty_score":0.25962538},"labels":[],"label_agreement":null},{"id":"W7077044286","doi":"10.1007/978-3-032-01855-7","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Tsinghua University; Bar-Ilan University; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; York University; Carnegie Mellon University; Indian Institute of Science; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Centre National de la Recherche Scientifique; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"","score_opus":0.00905826103545584,"score_gpt":0.25001810004117336,"score_spread":0.24095983900571752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077044286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011069366,0.050098553,0.16635233,0.05205923,0.045896582,0.000516021,0.0071498035,0.008502615,0.6583556],"genre_scores_gemma":[0.20526479,0.04115364,0.089370996,0.013803731,0.027958507,0.0008232985,0.013290828,0.0042996616,0.60403454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775416,0.00052159524,0.0001562882,0.00033000717,0.00091299386,0.00032494325],"domain_scores_gemma":[0.9969818,0.0010164059,0.00018187745,0.0009132163,0.00056782225,0.00033881812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172268,0.0017155715,0.0014261982,0.002317557,0.0016838233,0.0068609766,0.0013139859,0.001777673,0.077608235],"category_scores_gemma":[0.006570882,0.00066417095,0.00063427055,0.0038661119,0.0017001341,0.0096624065,0.0025855347,0.0049352422,0.063727],"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.00045296384,0.00009911696,0.0001676693,0.00042319132,0.00003930954,0.000074059804,0.00003252734,0.0027222342,0.0009997188,0.12928486,0.61586934,0.24983504],"study_design_scores_gemma":[0.00021050281,0.000108671025,0.00029229003,0.00031918267,0.000038767546,0.00035937974,0.000035498375,0.011311461,0.0023456237,0.19431737,0.79062134,0.000039949366],"about_ca_topic_score_codex":0.0010427749,"about_ca_topic_score_gemma":0.0009474273,"teacher_disagreement_score":0.077608235,"about_ca_system_score_codex":0.0027809807,"about_ca_system_score_gemma":0.002880529,"threshold_uncertainty_score":0.25962538},"labels":[],"label_agreement":null},{"id":"W7077065612","doi":"10.1007/978-3-032-01723-9_1","title":"Enhancing Urban Image Segmentation with Color Range Mask Layer: A Deep Learning Approach Using Airborne Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université Laval","funders":"","keywords":"Deep learning; Segmentation; Intersection (aeronautics); Image segmentation; Image processing; Range (aeronautics); Layer (electronics)","score_opus":0.022651112617895385,"score_gpt":0.24583368525651378,"score_spread":0.2231825726386184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077065612","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.068264574,0.00056047004,0.9213887,0.00020731517,0.00011018325,0.000052986277,0.0006621195,0.004609578,0.004144116],"genre_scores_gemma":[0.4110143,0.0006708867,0.5744666,0.0002496542,0.00008956885,0.00005120366,0.0024434705,0.0006151335,0.010399164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998846,0.000009891146,0.0000040899113,0.000034989254,0.000035072608,0.000031379874],"domain_scores_gemma":[0.9998447,0.000038881128,0.000014791652,0.000029811306,0.00005974314,0.000012087963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025078165,0.0009057196,0.00056140515,0.0008593631,0.00020398751,0.00078104896,0.0008020787,0.0006674754,0.0024484699],"category_scores_gemma":[0.0003977722,0.0004080081,0.00079825893,0.00087621796,0.00023349689,0.0007049459,0.0005952655,0.00079879846,0.0012123568],"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.00019008282,0.000198029,0.0014556064,0.00012973876,0.00010414209,0.00009332006,0.00007105451,0.18704845,0.08690418,0.0024797374,0.0066690007,0.7146567],"study_design_scores_gemma":[0.0000041040435,0.000023492983,0.00065665704,0.000006362866,0.000020948884,0.000027254753,0.000013576882,0.9820911,0.01477334,0.0010552714,0.0013195856,0.000008245365],"about_ca_topic_score_codex":0.013099444,"about_ca_topic_score_gemma":0.02154671,"teacher_disagreement_score":0.013099444,"about_ca_system_score_codex":0.00045113664,"about_ca_system_score_gemma":0.0007104466,"threshold_uncertainty_score":0.026046395},"labels":[],"label_agreement":null},{"id":"W7077144520","doi":"10.1007/978-3-032-01878-6","title":"Advances in Cryptology – CRYPTO 2025","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Massachusetts Amherst; Instituto Superior Técnico; University of California, Los Angeles; University of Illinois at Urbana-Champaign; Stony Brook University; Instituto de Telecomunicações; Indian Institute of Technology Bombay; Ben-Gurion University of the Negev; Centre National de la Recherche Scientifique; Tsinghua University; Bar-Ilan University; University of California, Irvine; Universidade de Lisboa; Georgetown University; Nanyang Technological University; Xiamen University; York University; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Carnegie Mellon University; Indian Institute of Science; Université de Versailles Saint-Quentin-en-Yvelines; Universiteit van Amsterdam; University of Connecticut; Tel Aviv University; Indian Institute of Technology Delhi; Academia Sinica; University of Bern; Georgia Institute of Technology; Aarhus Universitet; Università degli Studi di Salerno; Radboud Universiteit; University of Pennsylvania; Technische Universiteit Eindhoven; Brown University; Microsoft Research; Purdue University; Ethereum Foundation; Hebrew University of Jerusalem; University of California, San Diego; Yale University","keywords":"Scalability; Protocol (science); Payload (computing); Adversary; Task (project management); Throughput; Resilience (materials science); Cryptographic protocol","score_opus":0.00905826103545584,"score_gpt":0.25001810004117336,"score_spread":0.24095983900571752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077144520","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011069366,0.050098553,0.16635233,0.05205923,0.045896582,0.000516021,0.0071498035,0.008502615,0.6583556],"genre_scores_gemma":[0.20526479,0.04115364,0.089370996,0.013803731,0.027958507,0.0008232985,0.013290828,0.0042996616,0.60403454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775416,0.00052159524,0.0001562882,0.00033000717,0.00091299386,0.00032494325],"domain_scores_gemma":[0.9969818,0.0010164059,0.00018187745,0.0009132163,0.00056782225,0.00033881812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172268,0.0017155715,0.0014261982,0.002317557,0.0016838233,0.0068609766,0.0013139859,0.001777673,0.077608235],"category_scores_gemma":[0.006570882,0.00066417095,0.00063427055,0.0038661119,0.0017001341,0.0096624065,0.0025855347,0.0049352422,0.063727],"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.00045296384,0.00009911696,0.0001676693,0.00042319132,0.00003930954,0.000074059804,0.00003252734,0.0027222342,0.0009997188,0.12928486,0.61586934,0.24983504],"study_design_scores_gemma":[0.00021050281,0.000108671025,0.00029229003,0.00031918267,0.000038767546,0.00035937974,0.000035498375,0.011311461,0.0023456237,0.19431737,0.79062134,0.000039949366],"about_ca_topic_score_codex":0.0010427749,"about_ca_topic_score_gemma":0.0009474273,"teacher_disagreement_score":0.077608235,"about_ca_system_score_codex":0.0027809807,"about_ca_system_score_gemma":0.002880529,"threshold_uncertainty_score":0.25962538},"labels":[],"label_agreement":null},{"id":"W7082400818","doi":"10.1007/978-3-032-04947-6_43","title":"OsteoOpt: A Bayesian Optimization Framework for Enhancing Bone Union Likelihood in Mandibular Reconstruction Surgery","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bayesian optimization; Bayesian probability; Sensitivity (control systems); Surgical planning; Key (lock); Code (set theory); Bayes' theorem","score_opus":0.009158904564544807,"score_gpt":0.21983114117189856,"score_spread":0.21067223660735376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082400818","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.000850804,0.00015994877,0.99785465,0.00006192606,0.000021205913,0.000015248459,0.000053314656,0.0004248822,0.000558065],"genre_scores_gemma":[0.049811743,0.00045319233,0.94351727,0.00017621371,0.00010883039,0.000149742,0.00031082408,0.0008262558,0.0046460764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902725,0.00034343245,0.000043782748,0.000119299075,0.00040382534,0.00006240898],"domain_scores_gemma":[0.99925786,0.00039845775,0.00006303718,0.000055566805,0.00017467413,0.000050401424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002309485,0.0011021355,0.0015133432,0.0007200025,0.00048286194,0.0014319126,0.0024047443,0.0018204161,0.0063910545],"category_scores_gemma":[0.0033208318,0.0012735637,0.0011344791,0.00081420754,0.00089598354,0.0014327364,0.0026140793,0.001958271,0.0014075026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025216886,0.00007654299,0.00046176478,0.00018358206,0.00012088905,0.00007591408,0.00007388975,0.64831233,0.0060008103,0.027572157,0.010399353,0.3064706],"study_design_scores_gemma":[0.00001259237,0.000020143496,0.00009177763,0.000012056691,0.000009710559,0.000025005042,0.0000042539127,0.991931,0.0009890385,0.0050985585,0.001796153,0.000009527409],"about_ca_topic_score_codex":0.0068205367,"about_ca_topic_score_gemma":0.012167058,"teacher_disagreement_score":0.0068205367,"about_ca_system_score_codex":0.0008052721,"about_ca_system_score_gemma":0.0017730151,"threshold_uncertainty_score":0.021380186},"labels":[],"label_agreement":null},{"id":"W7082643178","doi":"10.1007/978-3-032-05185-1_64","title":"Variational Visible Layers: A Practical Framework for Uncertainty Estimation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"Hôpital Notre-Dame; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Task (project management); Bayesian probability; Uncertainty quantification; Overhead (engineering); Segmentation; Variational method; Bayesian network; Measurement uncertainty","score_opus":0.022837695237830385,"score_gpt":0.29491746523486373,"score_spread":0.2720797699970333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082643178","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.00043264264,0.00009429088,0.9989209,0.00005019977,0.000015418816,0.0000051622933,0.000029723637,0.00008365914,0.00036795603],"genre_scores_gemma":[0.10442145,0.00077752414,0.88559395,0.00015773931,0.00015615902,0.00011414308,0.000410919,0.00051577593,0.00785232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991171,0.00038796387,0.000038272257,0.00014378504,0.00024789912,0.00006503275],"domain_scores_gemma":[0.9984156,0.0010673739,0.000081022794,0.0001844219,0.00018895384,0.000062497114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002205324,0.0012967107,0.0011687541,0.0006684526,0.00043630134,0.0022269324,0.002832298,0.0020220021,0.0045632776],"category_scores_gemma":[0.0067983754,0.0014537782,0.0012724106,0.0010951572,0.0014968794,0.0029703404,0.0032625953,0.0037176441,0.0010626687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014540402,0.00003912444,0.0003095153,0.00016130024,0.000117600255,0.000075851865,0.0000847295,0.6064812,0.0046749944,0.25029072,0.0053536007,0.13226606],"study_design_scores_gemma":[0.0000048246243,0.000007689461,0.000028935243,0.000006463755,0.0000070739334,0.000009946879,0.0000034978455,0.95825636,0.0005168127,0.039957345,0.0011947285,0.000006375],"about_ca_topic_score_codex":0.0057914183,"about_ca_topic_score_gemma":0.006365392,"teacher_disagreement_score":0.0057914183,"about_ca_system_score_codex":0.0008888723,"about_ca_system_score_gemma":0.0013371705,"threshold_uncertainty_score":0.015265644},"labels":[],"label_agreement":null},{"id":"W7082644103","doi":"10.1007/978-3-032-05185-1_46","title":"PRECISE-AS: Personalized Reinforcement Learning for Efficient Point-of-Care Echocardiography in Aortic Stenosis Diagnosis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Echo (communications protocol); Stenosis; Reinforcement learning; Set (abstract data type); Feature (linguistics); Code (set theory)","score_opus":0.011252020044265757,"score_gpt":0.23883039863942676,"score_spread":0.227578378595161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082644103","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.009266968,0.00048696576,0.9847723,0.0002006536,0.00015140726,0.0000547427,0.000114737806,0.0027716006,0.0021806573],"genre_scores_gemma":[0.6181072,0.00040449467,0.37320748,0.00035167215,0.00015927917,0.0002564058,0.00031342535,0.0003547881,0.0068451734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995459,0.00013969894,0.000026355863,0.000113996786,0.00010775699,0.000066324006],"domain_scores_gemma":[0.99945897,0.00032916828,0.000032830034,0.00005077033,0.00008670266,0.000041477546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009240105,0.0007920223,0.000991427,0.00025380842,0.00025108454,0.00064319285,0.0014005209,0.0011332835,0.00511971],"category_scores_gemma":[0.0022347854,0.00036375597,0.0004085275,0.00023984368,0.0004192914,0.0006480097,0.0013501034,0.001257516,0.0010218342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044719584,0.00017899105,0.0007406559,0.00011713057,0.000057533372,0.00014065443,0.000076361204,0.6300201,0.0039810874,0.0068053254,0.010944045,0.34649095],"study_design_scores_gemma":[0.000020267875,0.00003995104,0.00010385097,0.0000063132916,0.0000054785537,0.000029906969,0.0000054702055,0.9958501,0.0005950213,0.0025310938,0.00080775964,0.0000048576653],"about_ca_topic_score_codex":0.0041354015,"about_ca_topic_score_gemma":0.004739872,"teacher_disagreement_score":0.00511971,"about_ca_system_score_codex":0.00048194296,"about_ca_system_score_gemma":0.0008848335,"threshold_uncertainty_score":0.017127156},"labels":[],"label_agreement":null},{"id":"W7083195330","doi":"10.1007/978-3-032-04700-7","title":"Fundamentals of Computation Theory","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Prenatal Screening and Diagnostics","field":"Medicine","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":"Sorbonne Université; Masarykova Univerzita; Eötvös Loránd Tudományegyetem; Universität Stuttgart; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Università degli Studi di Salerno; Centre National de la Recherche Scientifique; Turun Yliopisto; Latvijas Universitate; Umeå Universitet; Universitetet i Bergen; Università degli Studi di Palermo; Uniwersytet Warszawski; Technische Universität München; Dalhousie University; Universidade Federal do Rio de Janeiro; Université de Bordeaux; Uniwersytet Wrocławski; King's College London","keywords":"Computation; Algebra over a field; Calculus (dental); Model of computation; Set theory","score_opus":0.014776583994904087,"score_gpt":0.28850714029926466,"score_spread":0.27373055630436055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083195330","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028398377,0.03215062,0.4567843,0.0069806688,0.0030039407,0.00008624966,0.0012089653,0.0013334178,0.49561203],"genre_scores_gemma":[0.18782702,0.043694176,0.28539264,0.0035445634,0.007896641,0.0007091655,0.0025694305,0.0015752307,0.46679118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995148,0.00009312236,0.000029237048,0.00011208731,0.00020823072,0.00004248743],"domain_scores_gemma":[0.99936265,0.00037100964,0.000020432217,0.00012282535,0.00008958107,0.00003349099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000517884,0.0013750821,0.0014278629,0.0016071989,0.0011299412,0.0037712476,0.0012972758,0.00096715044,0.03268962],"category_scores_gemma":[0.0019000191,0.00077334436,0.001203381,0.0029241005,0.0029152746,0.004250222,0.0013299418,0.0041981214,0.013238679],"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.000007766441,0.000011923323,0.00006279659,0.00013143709,0.0000115631055,0.000022640974,0.00012780279,0.0011231689,0.0002654634,0.9120904,0.038353406,0.04779163],"study_design_scores_gemma":[0.0000036855504,0.0000042800457,0.00010420239,0.000045906825,0.0000067235624,0.000039685612,0.000020670192,0.0019164591,0.00011413167,0.9200567,0.07768143,0.0000060440975],"about_ca_topic_score_codex":0.0014125576,"about_ca_topic_score_gemma":0.0015954913,"teacher_disagreement_score":0.03268962,"about_ca_system_score_codex":0.0017057761,"about_ca_system_score_gemma":0.0011201634,"threshold_uncertainty_score":0.109357715},"labels":[],"label_agreement":null},{"id":"W7083624843","doi":"10.1007/978-3-032-06593-3_20","title":"Empirical Bayesian Methods and BNNs for Medical OOD Detection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geotechnical and construction materials studies","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 Ottawa","funders":"","keywords":"Prior probability; Bayes' theorem; Bayesian probability; Bayesian inference; Inference; Artificial neural network; Uncertainty quantification; Empirical probability; Entropy (arrow of time); Predictive inference","score_opus":0.013762730931225318,"score_gpt":0.2931832349019598,"score_spread":0.2794205039707345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083624843","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.0012325577,0.0008431236,0.9966857,0.00014960908,0.000036879017,0.000017619157,0.00009270341,0.00024883644,0.0006930162],"genre_scores_gemma":[0.092562065,0.0026646396,0.89519507,0.00030586624,0.00035659163,0.00019964605,0.00088437164,0.000284545,0.007547267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874544,0.00050157006,0.000088681605,0.00021696878,0.0003786425,0.00006868133],"domain_scores_gemma":[0.99564135,0.0032148382,0.00017674209,0.00029866572,0.0005899488,0.00007843967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031007947,0.0008073262,0.0013044873,0.0014680387,0.0004021648,0.0016722573,0.0019900685,0.0018853571,0.0047263587],"category_scores_gemma":[0.010724523,0.00083513086,0.0008563587,0.0017267673,0.0008524452,0.002142923,0.0015980075,0.0025726783,0.0016896897],"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.0001708177,0.00008104486,0.0009391542,0.00019067942,0.00008796345,0.00005713246,0.00007015112,0.2933444,0.0034035798,0.04790207,0.0061992304,0.6475538],"study_design_scores_gemma":[0.000007917007,0.000012096092,0.00023879937,0.00003072367,0.000011501702,0.00003749588,0.000009444985,0.9637554,0.00063211814,0.03322194,0.002031834,0.000010778523],"about_ca_topic_score_codex":0.007218886,"about_ca_topic_score_gemma":0.008348744,"teacher_disagreement_score":0.007218886,"about_ca_system_score_codex":0.00092020223,"about_ca_system_score_gemma":0.0010419292,"threshold_uncertainty_score":0.016398787},"labels":[],"label_agreement":null},{"id":"W7083626162","doi":"10.1007/978-3-032-06343-4_12","title":"Demonstrating OpenMP® Offload Performance with the STREAmS-2 Application and the AMD Next-Gen Fortran Compiler","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Concrete and Cement Materials Research","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Fortran; Compiler; Graphics; Software; Interface (matter); Optimizing compiler","score_opus":0.010504406075792805,"score_gpt":0.21825181429778337,"score_spread":0.20774740822199056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083626162","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.7264963,0.00067905686,0.074182615,0.001063833,0.0006560883,0.0001548607,0.001952324,0.06279989,0.13201489],"genre_scores_gemma":[0.911208,0.00023573771,0.05468568,0.00028784113,0.000064015614,0.00009240094,0.0018899724,0.007741895,0.023794506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992974,0.00008989511,0.000027976777,0.00006608996,0.00037406269,0.0001445357],"domain_scores_gemma":[0.9984132,0.00090898696,0.000046087825,0.00016070774,0.00036271804,0.00010825223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006182295,0.0008398387,0.000423517,0.00052112044,0.00066727505,0.0009466422,0.001499136,0.00071547856,0.015991129],"category_scores_gemma":[0.0024227211,0.0004845155,0.00030205798,0.00083555863,0.00040804548,0.00094732514,0.000840782,0.0015425428,0.0029123377],"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.0068961815,0.0020277319,0.010025334,0.0009839787,0.00014656948,0.0025894032,0.0015531501,0.139473,0.21764089,0.03577855,0.22657388,0.35631138],"study_design_scores_gemma":[0.00075402536,0.00063788303,0.007466525,0.000090014226,0.00004874616,0.00035122817,0.0003383793,0.7079119,0.23270085,0.0066381893,0.042964194,0.000098078664],"about_ca_topic_score_codex":0.007862002,"about_ca_topic_score_gemma":0.006583113,"teacher_disagreement_score":0.015991129,"about_ca_system_score_codex":0.00047728297,"about_ca_system_score_gemma":0.0008764865,"threshold_uncertainty_score":0.053495646},"labels":[],"label_agreement":null},{"id":"W7083628928","doi":"10.1007/978-3-032-06593-3_6","title":"Numerical Uncertainty in Linear Registration: An Experimental Study","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Geochemistry and Geologic Mapping","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":"Centre for Addiction and Mental Health; McGill University Health Centre; Montreal Neurological Institute and Hospital","funders":"","keywords":"Preprocessor; Similarity (geometry); Image registration; Numerical analysis; Numerical stability; Stability (learning theory); Software; Linear relationship","score_opus":0.022925492117918257,"score_gpt":0.2810234212596508,"score_spread":0.2580979291417325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083628928","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.65194494,0.0015663367,0.33178812,0.00030359856,0.00022108086,0.00027802784,0.00041112333,0.0012835632,0.012203213],"genre_scores_gemma":[0.93182343,0.00037053475,0.063549615,0.000045665587,0.00002731111,0.000093106995,0.0003245569,0.000404859,0.0033608766],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966627,0.0011195599,0.0001933452,0.0005637879,0.0012791391,0.00018154147],"domain_scores_gemma":[0.97773325,0.016158868,0.0009821812,0.003063133,0.0018879804,0.00017465051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003271054,0.000567194,0.0007298493,0.0007876494,0.00089052913,0.0019000255,0.0015589345,0.0010382205,0.007483084],"category_scores_gemma":[0.027561514,0.00051517854,0.00038408002,0.0017663353,0.0020447555,0.0024054754,0.0018345419,0.00090766686,0.0010636146],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060217488,0.0018420899,0.0051833326,0.0013798131,0.00017160304,0.0004241604,0.0016625336,0.15828077,0.5796757,0.023045087,0.0024216762,0.21989161],"study_design_scores_gemma":[0.0001531926,0.0027072032,0.004650328,0.000094860545,0.00012232135,0.00060819834,0.0005644634,0.5713362,0.4107553,0.005806051,0.0030799354,0.00012193258],"about_ca_topic_score_codex":0.0023658345,"about_ca_topic_score_gemma":0.0009841607,"teacher_disagreement_score":0.007483084,"about_ca_system_score_codex":0.0008274836,"about_ca_system_score_gemma":0.00080730044,"threshold_uncertainty_score":0.025033474},"labels":[],"label_agreement":null},{"id":"W7083633661","doi":"10.1007/978-3-032-06593-3_15","title":"Pseudo-D: Informing Multi-view Uncertainty Estimation with Calibrated Neural Training Dynamics","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Musicology and Musical Analysis","field":"Arts and Humanities","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":"Vancouver General Hospital; University of British Columbia","funders":"","keywords":"Ambiguity; Artificial neural network; Pipeline (software); Training (meteorology); Training set; Dynamics (music); Calibration; Estimation","score_opus":0.03218425433651847,"score_gpt":0.24340968480941236,"score_spread":0.21122543047289388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083633661","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.0014836317,0.00020755017,0.99704844,0.00007826571,0.00004791739,0.000009385021,0.00005132394,0.0002453977,0.0008281049],"genre_scores_gemma":[0.27391174,0.00080457516,0.7156573,0.00036448808,0.00022659924,0.00015448246,0.00062019815,0.000403797,0.007856797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994784,0.00016579557,0.000032149583,0.00013725525,0.00015141304,0.00003493154],"domain_scores_gemma":[0.9984425,0.0010296968,0.00007119068,0.00025383712,0.00015765736,0.000045152017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010255015,0.00094767136,0.00087668316,0.00043031955,0.00030334105,0.001169033,0.0013641976,0.0018684567,0.004376426],"category_scores_gemma":[0.005321483,0.00086834666,0.0007979996,0.0006862901,0.00096972,0.0021044202,0.00317673,0.0018998997,0.0010484208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021282122,0.000038284245,0.00024689976,0.00017887878,0.0000824078,0.00009457585,0.000079130274,0.66030765,0.005616498,0.03494598,0.005722003,0.2924748],"study_design_scores_gemma":[0.0000038958415,0.000012599906,0.00004626804,0.000008605485,0.0000032523544,0.000017582917,0.0000028264494,0.9895975,0.00085657986,0.008636707,0.0008084938,0.0000057359284],"about_ca_topic_score_codex":0.0033097034,"about_ca_topic_score_gemma":0.0027729245,"teacher_disagreement_score":0.004376426,"about_ca_system_score_codex":0.00053397525,"about_ca_system_score_gemma":0.000646365,"threshold_uncertainty_score":0.01464057},"labels":[],"label_agreement":null},{"id":"W7084396784","doi":"10.1007/978-3-032-06106-5_14","title":"Learning from Stochastic Teacher Representations Using Student-Guided Knowledge Distillation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fire effects on ecosystems","field":"Environmental 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":"Queen's University; École de Technologie Supérieure; Concordia University","funders":"","keywords":"Distillation; Leverage (statistics); Weighting; Representation (politics); Ensemble learning; Ensemble forecasting; Deep learning","score_opus":0.021013136302639627,"score_gpt":0.2893486973947198,"score_spread":0.2683355610920802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084396784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10228113,0.0001976794,0.8858444,0.0005582045,0.0000729457,0.00007712365,0.0003141561,0.0027377584,0.00791654],"genre_scores_gemma":[0.7879588,0.00015447091,0.20459603,0.000119933655,0.00003116985,0.00014677801,0.0007367828,0.00012626992,0.0061297147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972326,0.000096543576,0.00001495495,0.00008251599,0.000052998872,0.00002970071],"domain_scores_gemma":[0.99822503,0.001246181,0.00008011161,0.00020853578,0.0001793863,0.00006083032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055177213,0.0006600671,0.0005458364,0.00031515735,0.000248214,0.0010583022,0.001253273,0.0008931163,0.0065320483],"category_scores_gemma":[0.0043195663,0.0003882959,0.00059481943,0.00045016815,0.00040613092,0.0028498692,0.0020496186,0.0019608047,0.00090963993],"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.0005750374,0.00045033902,0.0023089892,0.00022829494,0.00008923871,0.00016157812,0.00061910995,0.31411082,0.008473895,0.03431973,0.006955608,0.63170725],"study_design_scores_gemma":[0.000036416088,0.000080305224,0.00019716696,0.000018663752,0.000016200816,0.000024297868,0.00007248804,0.9725927,0.0036682617,0.022065511,0.001218703,0.000009327886],"about_ca_topic_score_codex":0.002384499,"about_ca_topic_score_gemma":0.004605397,"teacher_disagreement_score":0.0065320483,"about_ca_system_score_codex":0.000570363,"about_ca_system_score_gemma":0.0007784802,"threshold_uncertainty_score":0.021851838},"labels":[],"label_agreement":null},{"id":"W7084400714","doi":"10.1007/978-3-032-06106-5_1","title":"Counterfactual Multi-player Bandits for Explainable Recommendation Diversification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Global Maternal and Child Health","field":"Medicine","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":"Counterfactual thinking; Diversification (marketing strategy); Diversity (politics); Dilemma; Recommender system; Range (aeronautics)","score_opus":0.031407897342526386,"score_gpt":0.29996160288471224,"score_spread":0.2685537055421858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084400714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022620011,0.0012949831,0.96420884,0.0018880108,0.00019118242,0.00016008584,0.0004861467,0.00045341716,0.008697448],"genre_scores_gemma":[0.7096126,0.0023290107,0.24165577,0.0010637003,0.000786061,0.001348369,0.0011872383,0.0005535126,0.04146383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99122894,0.006092842,0.00029965158,0.0010388726,0.00069298147,0.00064659346],"domain_scores_gemma":[0.8846448,0.105614394,0.0023795362,0.005267845,0.0012160401,0.00087741297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019847333,0.0029632275,0.005527453,0.0019303049,0.001769256,0.0053075105,0.006021327,0.0076990156,0.019989846],"category_scores_gemma":[0.081629105,0.002555144,0.0034180798,0.0025763088,0.0055773063,0.009492216,0.0058784345,0.008531648,0.0022526262],"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.00054513646,0.00018015085,0.0010370516,0.00027427528,0.0002790976,0.0002441482,0.00028317876,0.31667134,0.00040087505,0.65230834,0.005222516,0.022553902],"study_design_scores_gemma":[0.00007485399,0.00003364224,0.00012939655,0.00005220117,0.000038688613,0.00004087131,0.000032026303,0.685062,0.00013018875,0.3135047,0.00087083963,0.000030548905],"about_ca_topic_score_codex":0.005308533,"about_ca_topic_score_gemma":0.0044378396,"teacher_disagreement_score":0.019989846,"about_ca_system_score_codex":0.003247581,"about_ca_system_score_gemma":0.0020628653,"threshold_uncertainty_score":0.10496396},"labels":[],"label_agreement":null},{"id":"W7084500058","doi":"10.1007/978-3-662-72243-5_25","title":"RAID: Root Cause Anomaly Identification and Diagnosis","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Testbed; Cloud computing; RAID; Anomaly detection; Inference; Identification (biology); Root cause analysis; Server; Network packet","score_opus":0.011140175048440717,"score_gpt":0.23895493378340898,"score_spread":0.22781475873496826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084500058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041747396,0.02782964,0.76947665,0.00372135,0.0049048094,0.00033114522,0.0065121124,0.035577998,0.14747167],"genre_scores_gemma":[0.027706405,0.023127364,0.62752306,0.0024695331,0.0044845887,0.0003614225,0.012983124,0.003969017,0.29737544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.000024972585,0.000016226866,0.000071948794,0.00014325303,0.000017535089],"domain_scores_gemma":[0.9997148,0.00013087309,0.0000164869,0.000036351263,0.00006509356,0.000036468555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033796686,0.0010475841,0.00065868016,0.0014061916,0.00021680228,0.0011320534,0.0011853882,0.00081965514,0.032041572],"category_scores_gemma":[0.00094388006,0.00035117503,0.0005345782,0.0008133166,0.00035848672,0.00085717393,0.0010242781,0.0010420618,0.031933546],"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.000037728678,0.000015266314,0.00024057343,0.0002728791,0.000011960016,0.00038905963,0.000022193384,0.00095482334,0.0034644709,0.006353687,0.20857519,0.7796622],"study_design_scores_gemma":[0.000026978409,0.00007988371,0.0013033907,0.00025314072,0.000048119997,0.011250544,0.00004347039,0.008947896,0.009927676,0.02862171,0.93943805,0.000059133148],"about_ca_topic_score_codex":0.00042864954,"about_ca_topic_score_gemma":0.0007348025,"teacher_disagreement_score":0.032041572,"about_ca_system_score_codex":0.00022216649,"about_ca_system_score_gemma":0.00039182635,"threshold_uncertainty_score":0.107189775},"labels":[],"label_agreement":null},{"id":"W70870466","doi":"10.1007/978-3-319-11659-4_9","title":"Transcript Secure Signatures Based on Modular Lattices","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"NTRU; Modular design; Computer science; Lattice problem; Enumeration; Lattice reduction; Theoretical computer science; Lattice (music); Digital signature; Concrete security; Lattice-based cryptography; Algorithm; Cryptography; Discrete mathematics; Mathematics; Programming language; Physics; Quantum; Quantum mechanics; Computer network; Cryptosystem","score_opus":0.011705950085405665,"score_gpt":0.22569229699476273,"score_spread":0.21398634690935706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70870466","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.0402694,0.0006685856,0.9134776,0.001187749,0.0005505314,0.0002882904,0.0005391969,0.0037462127,0.039272454],"genre_scores_gemma":[0.7069029,0.0009979144,0.24675739,0.0005465645,0.0006505466,0.0005589713,0.0011779326,0.00085770705,0.041550007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995656,0.0010840636,0.00024606273,0.0006254752,0.0017848113,0.00060365367],"domain_scores_gemma":[0.99610656,0.001750384,0.00028827746,0.0012255625,0.00043074926,0.00019831055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041845,0.001025589,0.0015760453,0.0012883156,0.0014824197,0.0039856094,0.001953706,0.0014232689,0.010410447],"category_scores_gemma":[0.005740819,0.00069789944,0.0012671062,0.001662815,0.003370381,0.006498125,0.0051016067,0.004249998,0.0057700286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044793315,0.00007142102,0.00013286175,0.00014661811,0.00002126088,0.00012949322,0.0002216525,0.014690259,0.006894224,0.9142366,0.0052573155,0.057750408],"study_design_scores_gemma":[0.00010059022,0.00013127197,0.00006796681,0.00005668608,0.000022908138,0.00023010404,0.00005479813,0.07190856,0.01321745,0.9007414,0.013403553,0.00006462816],"about_ca_topic_score_codex":0.00027528097,"about_ca_topic_score_gemma":0.00030368712,"teacher_disagreement_score":0.010410447,"about_ca_system_score_codex":0.0017694767,"about_ca_system_score_gemma":0.001814285,"threshold_uncertainty_score":0.034826458},"labels":[],"label_agreement":null},{"id":"W7087312099","doi":"10.1007/978-3-032-07845-2_18","title":"Test-Time Adaptation of Medical Vision-Language Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimodal Machine Learning Applications","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":"École de Technologie Supérieure","funders":"","keywords":"Adaptation (eye); Benchmark (surveying); Domain adaptation; Downstream (manufacturing); Mutual information; Code (set theory); Class (philosophy); Transfer of learning","score_opus":0.011620095933489439,"score_gpt":0.2857211316042886,"score_spread":0.27410103567079913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7087312099","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.21593983,0.0032661327,0.75410944,0.00070933247,0.0006192462,0.00021767126,0.0020467609,0.014152447,0.008939088],"genre_scores_gemma":[0.8687127,0.00062648434,0.11107719,0.0005335509,0.00015923595,0.00015697908,0.0049022613,0.0010718778,0.012759619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992353,0.00026864966,0.00003625923,0.00021243245,0.00015085307,0.00009664233],"domain_scores_gemma":[0.9981957,0.0010661029,0.00006391907,0.00030083992,0.00029942795,0.00007411913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016875812,0.0008579297,0.0006419582,0.00050806714,0.00016316712,0.0007845411,0.0012442316,0.0012593961,0.0040987944],"category_scores_gemma":[0.00611656,0.00036246274,0.00069248595,0.0005647821,0.0002725202,0.0008006781,0.0010347451,0.0011033204,0.003112717],"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.0012535928,0.0003325573,0.0028552967,0.00014991248,0.00025686398,0.0002416429,0.00006451038,0.17823401,0.049815297,0.00085975626,0.009233705,0.7567029],"study_design_scores_gemma":[0.000023681283,0.000100690726,0.0027837523,0.000009450537,0.000057072684,0.00019504054,0.000017888497,0.9761329,0.01849138,0.00081651396,0.0013515676,0.000020120098],"about_ca_topic_score_codex":0.006047654,"about_ca_topic_score_gemma":0.006076661,"teacher_disagreement_score":0.006047654,"about_ca_system_score_codex":0.00048263255,"about_ca_system_score_gemma":0.0005166474,"threshold_uncertainty_score":0.01371187},"labels":[],"label_agreement":null},{"id":"W7087360018","doi":"10.1007/978-3-032-07845-2_10","title":"DR.SIMON: Domain-Wise Rewrite for Segment-Informed Medical Oversight Network","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Bridging (networking); Scalability; Context (archaeology); Rotation formalisms in three dimensions; Terminology; Pace; Simple (philosophy); Medical terminology","score_opus":0.023792610248392108,"score_gpt":0.22647418920678508,"score_spread":0.20268157895839298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7087360018","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004159038,0.00077331945,0.762505,0.017747417,0.0032089874,0.00025809996,0.0023515616,0.01956895,0.18942767],"genre_scores_gemma":[0.17872463,0.0010980142,0.51912075,0.008661815,0.002394106,0.00030575908,0.003909883,0.011105381,0.2746797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698645,0.000932979,0.00019618207,0.00054010825,0.0010821662,0.00026207187],"domain_scores_gemma":[0.9952179,0.0019850784,0.00014574529,0.0011906648,0.0011924523,0.00026819878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035720156,0.0005991514,0.00035684695,0.0010944981,0.0012924155,0.002945342,0.001415405,0.0020069696,0.07213827],"category_scores_gemma":[0.018385204,0.0004383359,0.0004501971,0.0009164574,0.0009848165,0.003700795,0.0021126855,0.002957208,0.042430587],"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.00016239034,0.000037892103,0.00056798256,0.00012537837,0.00002839089,0.0005503616,0.0004541386,0.005066435,0.003986846,0.20377584,0.49884728,0.28639704],"study_design_scores_gemma":[0.000049135684,0.000037990012,0.0003284194,0.000116193245,0.000026918306,0.0008507803,0.00022460811,0.033260755,0.010785253,0.15022697,0.8040379,0.00005509841],"about_ca_topic_score_codex":0.0037339034,"about_ca_topic_score_gemma":0.0056108264,"teacher_disagreement_score":0.07213827,"about_ca_system_score_codex":0.0012556082,"about_ca_system_score_gemma":0.0020454817,"threshold_uncertainty_score":0.24132657},"labels":[],"label_agreement":null},{"id":"W7089099831","doi":"10.1007/978-3-032-07959-6_7","title":"Effect of Increased Temporal Resolution on Speech Recognition for French Quebec Using Features from Speech Self-supervised Learning Models","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Organizational and Employee Performance","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":"Computer Research Institute of Montréal","funders":"","keywords":"Word error rate; Test set; Training set; Set (abstract data type); Feature (linguistics); Word (group theory); Temporal resolution; Resolution (logic); Low resolution","score_opus":0.01964947128287382,"score_gpt":0.24044544664164422,"score_spread":0.2207959753587704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7089099831","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.9790822,0.0010403055,0.011965692,0.00035326896,0.00012765375,0.00004529425,0.001498274,0.0015348508,0.0043524513],"genre_scores_gemma":[0.98020524,0.00032102712,0.009510237,0.0001514735,0.000035850833,0.000026706286,0.0026085472,0.00012417688,0.0070166634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995546,0.00013839269,0.000025153526,0.00011060175,0.00007954336,0.00009167783],"domain_scores_gemma":[0.9968569,0.0019387611,0.000069899776,0.00009993106,0.0009237702,0.00011064841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081096624,0.0005332339,0.00032314123,0.00042930912,0.00062438636,0.001026884,0.00038641543,0.0008539838,0.003579083],"category_scores_gemma":[0.0036010616,0.00017534553,0.0003801537,0.0004894555,0.00029076813,0.000536269,0.00030785752,0.00064297253,0.000848552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00995738,0.00062243483,0.03702368,0.00047016292,0.0005476107,0.0010513674,0.00064882264,0.13181083,0.25742444,0.0006215593,0.014262058,0.54555964],"study_design_scores_gemma":[0.00020019237,0.0012225098,0.2097295,0.00008184363,0.0005980768,0.00033754722,0.0011377909,0.64040464,0.13934319,0.00024963505,0.0065503446,0.00014476938],"about_ca_topic_score_codex":0.6693093,"about_ca_topic_score_gemma":0.6868436,"teacher_disagreement_score":0.33069068,"about_ca_system_score_codex":0.0017030864,"about_ca_system_score_gemma":0.0015821619,"threshold_uncertainty_score":0.66527635},"labels":[],"label_agreement":null},{"id":"W7093366356","doi":"10.1007/978-3-032-08887-1_2","title":"Specifying an Obligation Taxonomy in the Non-Markovian Situation Calculus","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Correctness; Situation calculus; Formalism (music); Event calculus; Action (physics); Obligation; Calculus (dental); Rotation formalisms in three dimensions","score_opus":0.026055996173328252,"score_gpt":0.25225613478204045,"score_spread":0.2262001386087122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093366356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01194678,0.00011346593,0.97240645,0.00045711553,0.00008802906,0.00019654389,0.00036790757,0.0012275557,0.013196234],"genre_scores_gemma":[0.17732851,0.00026321114,0.81337714,0.00019759398,0.00006042418,0.0002601863,0.0006806848,0.00041765752,0.007414691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637103,0.0011829347,0.0004988772,0.00050333684,0.0010253959,0.0004184609],"domain_scores_gemma":[0.996236,0.0023215113,0.0002150468,0.0005120234,0.00048627984,0.00022905985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053590396,0.00078315515,0.0007858257,0.0014625605,0.0027713317,0.0061185,0.0024810666,0.0017576346,0.008113265],"category_scores_gemma":[0.007681139,0.0016877387,0.0023600974,0.0014134909,0.0025449635,0.012467412,0.004548501,0.003378911,0.001725212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002984886,0.000043485532,0.00040050576,0.00007704773,0.000015425365,0.0002896464,0.000859348,0.0055192783,0.0014649897,0.9754676,0.0014422889,0.014390431],"study_design_scores_gemma":[0.000028883116,0.000020412344,0.00018481749,0.0001151532,0.00003987604,0.00026877737,0.0004194063,0.09442071,0.0036710943,0.8594346,0.041344818,0.000051401166],"about_ca_topic_score_codex":0.0060529504,"about_ca_topic_score_gemma":0.014087138,"teacher_disagreement_score":0.008113265,"about_ca_system_score_codex":0.0024213907,"about_ca_system_score_gemma":0.0038217178,"threshold_uncertainty_score":0.028341651},"labels":[],"label_agreement":null},{"id":"W70998339","doi":"10.1007/978-3-642-31295-3_9","title":"Max and Min Values of the Structural Similarity Function S(x,a) on the L 2 Sphere S R (a), a ∈ ℝ N","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","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":"Similarity (geometry); Function (biology); RADIUS; Lagrange multiplier; Computer science; Combinatorics; Mathematics; Algorithm; Mathematical optimization; Image (mathematics); Artificial intelligence","score_opus":0.016521054682169793,"score_gpt":0.212262273264803,"score_spread":0.1957412185826332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70998339","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.1655052,0.0015101524,0.8004264,0.0010046012,0.0001886581,0.000086124,0.0013486779,0.00083669706,0.02909359],"genre_scores_gemma":[0.6718714,0.0014063471,0.30705902,0.00016498953,0.00026903418,0.00024233232,0.0011350898,0.00052151,0.017330194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952614,0.00012566969,0.00003401828,0.00012405832,0.00015228528,0.00003778535],"domain_scores_gemma":[0.9989385,0.0005117835,0.000114258066,0.00014443904,0.00018085969,0.00011023619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011311565,0.000712684,0.0008247037,0.0009582923,0.00035390642,0.0016966664,0.00073097897,0.00076708733,0.004242983],"category_scores_gemma":[0.005149305,0.00026862035,0.000385729,0.0006067074,0.0013639228,0.0021239503,0.0011077669,0.00084697315,0.0010405796],"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.0013351255,0.00013959134,0.003912876,0.00081194786,0.000073416435,0.00023343401,0.00041152834,0.0884153,0.09275665,0.382546,0.012132575,0.4172314],"study_design_scores_gemma":[0.000033841698,0.0005004859,0.0097413035,0.00012481793,0.000033947268,0.0012011635,0.00032411638,0.5097125,0.056939457,0.4041142,0.01716152,0.00011267847],"about_ca_topic_score_codex":0.0002389421,"about_ca_topic_score_gemma":0.00044717305,"teacher_disagreement_score":0.004242983,"about_ca_system_score_codex":0.0005657328,"about_ca_system_score_gemma":0.0005348496,"threshold_uncertainty_score":0.0141941905},"labels":[],"label_agreement":null},{"id":"W7102732586","doi":"10.1007/978-3-032-03708-4_27","title":"Invariant Pattern Recognition with Selectively Denoising and Ridgelet-Fourier Features","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Pattern recognition (psychology); Invariant (physics); Noise reduction; Noise (video); Pattern matching; Noisy data; k-nearest neighbors algorithm","score_opus":0.009224690341339417,"score_gpt":0.2193678222598771,"score_spread":0.2101431319185377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7102732586","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.007267417,0.00034506663,0.98978174,0.00004412525,0.00005376927,0.000015938975,0.000043472064,0.0004761783,0.001972359],"genre_scores_gemma":[0.11027234,0.0010144877,0.87606126,0.000090336696,0.00012018484,0.00005452426,0.00043674643,0.0002842225,0.011665819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997185,0.000030000674,0.000017588212,0.000055353506,0.0001544259,0.000024072768],"domain_scores_gemma":[0.99969995,0.00007921099,0.000027414691,0.00009838349,0.00008184265,0.0000132264695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004068325,0.00049013714,0.0006191918,0.0006992359,0.00013069276,0.00075012847,0.0005639787,0.0005291624,0.0025040992],"category_scores_gemma":[0.0009883101,0.00031566253,0.00064147083,0.0010238644,0.00036301702,0.0009702426,0.0005584916,0.0006732226,0.002410466],"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.00016277337,0.00010058319,0.0004031424,0.00016138703,0.000054534627,0.0001050975,0.00004434327,0.01886564,0.22177602,0.019872582,0.0039280886,0.73452574],"study_design_scores_gemma":[0.000018285322,0.00020353327,0.0017440674,0.00002953296,0.000072070885,0.00090278214,0.000026111631,0.7993499,0.1647306,0.019180307,0.013709377,0.00003346625],"about_ca_topic_score_codex":0.0003565015,"about_ca_topic_score_gemma":0.000601971,"teacher_disagreement_score":0.0025040992,"about_ca_system_score_codex":0.00019300806,"about_ca_system_score_gemma":0.00024743922,"threshold_uncertainty_score":0.008377075},"labels":[],"label_agreement":null},{"id":"W7104015788","doi":"10.1007/978-3-032-00492-5_15","title":"Toward a Secure Tokenized Green Credit Management System: Case Study of WREGIS","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Renewable energy; Database transaction; Security token; Renewable energy credit; Energy management; Efficient energy use; Green computing; Certificate","score_opus":0.016179832043638754,"score_gpt":0.2451139759731288,"score_spread":0.22893414392949005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104015788","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.9335873,0.00015914919,0.022687856,0.0011089038,0.000053778025,0.00027746795,0.00016629822,0.00037838615,0.04158084],"genre_scores_gemma":[0.96518266,0.00011130741,0.010040356,0.00007703204,0.000008616766,0.000039479164,0.00010807573,0.000057411118,0.024375131],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991805,0.00024002121,0.000033524313,0.00009660846,0.00024228696,0.000207142],"domain_scores_gemma":[0.9989685,0.00036448127,0.000088990004,0.00018989838,0.00014962419,0.00023864771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286958,0.0002592603,0.0002445371,0.00047783653,0.0021077574,0.0024572578,0.0011965797,0.0016573747,0.004804269],"category_scores_gemma":[0.0019280858,0.00015853536,0.000249397,0.00074422825,0.0012402004,0.0021027145,0.0015666501,0.0011828729,0.0008386728],"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.002337001,0.0046845,0.06545726,0.00074561447,0.00016765475,0.050101973,0.023511248,0.1381892,0.061470646,0.22526944,0.027813004,0.40025234],"study_design_scores_gemma":[0.00039803414,0.0029961516,0.032334056,0.00030744058,0.00016643261,0.009754019,0.04150357,0.47888097,0.09412375,0.053046223,0.28625926,0.00023012405],"about_ca_topic_score_codex":0.0071875686,"about_ca_topic_score_gemma":0.010257811,"teacher_disagreement_score":0.0071875686,"about_ca_system_score_codex":0.001377621,"about_ca_system_score_gemma":0.0015064477,"threshold_uncertainty_score":0.016071916},"labels":[],"label_agreement":null},{"id":"W7104038948","doi":"10.1007/978-3-032-00492-5_5","title":"Early Observations of Based Rollups: A Case Study of Taiko","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blockchain Technology Applications and Security","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; Inuit Tapiriit Kanatami","funders":"","keywords":"Layer (electronics); Work (physics); Key (lock); Application layer; Competitive advantage","score_opus":0.02245644346220234,"score_gpt":0.25510119797848785,"score_spread":0.23264475451628552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104038948","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.98102003,0.00013848313,0.0018836433,0.0007566307,0.00003469687,0.000047214973,0.00013009273,0.000065579385,0.015923563],"genre_scores_gemma":[0.98814386,0.00015317912,0.0007161619,0.000105669955,0.000010482478,0.000018098766,0.00011824219,0.000057039633,0.010677358],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9992317,0.0002108883,0.000040119667,0.000116752715,0.00017077816,0.00022965507],"domain_scores_gemma":[0.996329,0.0019649682,0.00045381792,0.00041693356,0.0003669743,0.00046830717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012196358,0.00045299588,0.0003523773,0.0014487333,0.007925675,0.0019823734,0.0012175484,0.0023737575,0.008314461],"category_scores_gemma":[0.006960766,0.0004565498,0.00030499775,0.0015477843,0.0020889223,0.0031007905,0.001859677,0.0027976471,0.0014431408],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023153368,0.0024449956,0.20247856,0.0005238755,0.00012525446,0.131426,0.44715413,0.007142718,0.021245457,0.046747603,0.016413992,0.12198218],"study_design_scores_gemma":[0.000079181336,0.0013269474,0.1805303,0.0008749342,0.00016730173,0.020245982,0.59374374,0.014823638,0.023472425,0.019044913,0.14540258,0.0002880281],"about_ca_topic_score_codex":0.0113504995,"about_ca_topic_score_gemma":0.030458463,"teacher_disagreement_score":0.0113504995,"about_ca_system_score_codex":0.0014503843,"about_ca_system_score_gemma":0.0015059285,"threshold_uncertainty_score":0.027814627},"labels":[],"label_agreement":null},{"id":"W71081281","doi":"10.1007/978-3-642-35289-8_27","title":"Training Deep and Recurrent Networks with Hessian-Free Optimization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":206,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Implementation; Hessian matrix; Heuristic; Artificial intelligence; Training (meteorology); Artificial neural network; Machine learning; Deep neural networks; Computer engineering; Software engineering","score_opus":0.021763824428854932,"score_gpt":0.23382435180356947,"score_spread":0.21206052737471454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71081281","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.03393659,0.0010195201,0.9553301,0.00041602884,0.00025226446,0.00005098038,0.00016913928,0.0023169375,0.0065085245],"genre_scores_gemma":[0.44334987,0.00054642634,0.5321154,0.00039330465,0.00018017777,0.00023727959,0.0009945125,0.00091593136,0.021267157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997415,0.000060265527,0.000018661362,0.000075786236,0.00006372469,0.00003996771],"domain_scores_gemma":[0.9990972,0.00055949506,0.000047133908,0.00011721246,0.00013533699,0.00004360829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093347434,0.0012320852,0.0009649581,0.0003336345,0.000331362,0.0007889798,0.0017223352,0.0018940603,0.0067661707],"category_scores_gemma":[0.0033961234,0.0010685424,0.00074085966,0.0004627231,0.00060828635,0.001851403,0.0013516981,0.0025876937,0.0016053636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016356213,0.00010729286,0.00044051404,0.00013468118,0.000109829474,0.00008951702,0.000071154296,0.7320424,0.0060460595,0.016288925,0.0074041355,0.23710203],"study_design_scores_gemma":[0.0000063987877,0.00001384097,0.000028788161,0.0000044898725,0.0000052180576,0.0000058987757,0.0000028984591,0.9960939,0.00052171666,0.0030322876,0.00028187485,0.0000026087241],"about_ca_topic_score_codex":0.0048916107,"about_ca_topic_score_gemma":0.011717126,"teacher_disagreement_score":0.0067661707,"about_ca_system_score_codex":0.0006716084,"about_ca_system_score_gemma":0.00075651536,"threshold_uncertainty_score":0.022635102},"labels":[],"label_agreement":null},{"id":"W7116888619","doi":"10.1007/978-981-95-2398-6_18","title":"Toward Safe Child-Robot Interactions: Exploring Children’s and Parents’ Privacy Perceptions of Humanoid Social Robots","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"SAFER; Humanoid robot; Transparency (behavior); Perception; Robot; Information privacy; Control (management)","score_opus":0.06948949240591248,"score_gpt":0.3463319372182199,"score_spread":0.27684244481230746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116888619","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.99298203,0.00013729862,0.0010639529,0.00015397507,0.0000042429388,0.0000140242355,0.0000253097,0.000010521443,0.005608636],"genre_scores_gemma":[0.9977145,0.000117830656,0.0008434383,0.0000617025,0.0000014060421,0.000028557091,0.000031788666,0.00000844051,0.0011921881],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9988881,0.0006113732,0.00003251721,0.00013141507,0.00020818095,0.00012852605],"domain_scores_gemma":[0.9927408,0.004403433,0.0017358102,0.0002281065,0.00046217142,0.0004296903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021554858,0.00025543224,0.00015148314,0.0004248437,0.0014201489,0.003038082,0.0004970287,0.0007067416,0.0033109162],"category_scores_gemma":[0.011094257,0.0003488165,0.00027324245,0.00030828634,0.0018631916,0.0023899898,0.001981604,0.0013427333,0.00034824468],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027850835,0.0002032989,0.17263491,0.00016347558,0.000040321476,0.0005129849,0.7981873,0.00028374343,0.004862382,0.0025200744,0.00096655654,0.019346347],"study_design_scores_gemma":[0.000016969176,0.0002951945,0.30714658,0.00013441587,0.0000454503,0.0007365266,0.6771385,0.0009076802,0.0021869272,0.0015918416,0.0097262,0.000073674615],"about_ca_topic_score_codex":0.007696004,"about_ca_topic_score_gemma":0.0111328745,"teacher_disagreement_score":0.007696004,"about_ca_system_score_codex":0.0010427858,"about_ca_system_score_gemma":0.00076468755,"threshold_uncertainty_score":0.01530242},"labels":[],"label_agreement":null},{"id":"W7116939433","doi":"10.1007/978-981-95-2398-6_15","title":"Designing Interactive Robots for Active Ageing: Co-design Insights on Large Projection Interfaces with Older Adults","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Social Robot Interaction and HRI","field":"Psychology","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":"Wilfrid Laurier University","funders":"","keywords":"Robot; Visibility; Task (project management); Projection (relational algebra); Focus (optics); Cognition; Thematic analysis; Human–robot interaction; Focus group","score_opus":0.033294513986887965,"score_gpt":0.3425190586735828,"score_spread":0.3092245446866948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116939433","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.6319614,0.002470403,0.29737988,0.0013225448,0.00013157909,0.00029675907,0.000096547206,0.00068443123,0.06565632],"genre_scores_gemma":[0.8885018,0.0008872024,0.08856761,0.00016144787,0.000026185251,0.00024299146,0.00010462261,0.00018010313,0.021327997],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99882334,0.00064701645,0.000046294586,0.000144483,0.0002453701,0.0000934161],"domain_scores_gemma":[0.9974833,0.0018332251,0.0001275956,0.000114827446,0.0002554689,0.00018561617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002319559,0.000680773,0.00033445837,0.00045565589,0.0010498426,0.0031095403,0.0009659031,0.001057292,0.0053383466],"category_scores_gemma":[0.005763934,0.00035084275,0.00031849864,0.00033556696,0.0013276335,0.002823237,0.0029385707,0.0007551361,0.0011617949],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006801112,0.0007246277,0.018895037,0.0015460397,0.00006709758,0.0031113243,0.33764178,0.0035174948,0.050148197,0.03526642,0.012766934,0.5356348],"study_design_scores_gemma":[0.00022466031,0.0039323345,0.08759938,0.0017779068,0.00041588265,0.0149167655,0.36026785,0.060981244,0.043593362,0.08746632,0.3384004,0.00042380526],"about_ca_topic_score_codex":0.00078847364,"about_ca_topic_score_gemma":0.0017963904,"teacher_disagreement_score":0.0053383466,"about_ca_system_score_codex":0.00040398745,"about_ca_system_score_gemma":0.00061402086,"threshold_uncertainty_score":0.017858505},"labels":[],"label_agreement":null},{"id":"W7123824","doi":"10.1007/978-3-642-33481-8_14","title":"Random Mappings with Restricted Preimages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fixed Point Theorems Analysis","field":"Mathematics","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":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.019687090130243765,"score_gpt":0.24939711719243002,"score_spread":0.22971002706218624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123824","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.058431875,0.013025272,0.3792533,0.0036401125,0.0015263259,0.000091001944,0.00034948246,0.00044205145,0.54324055],"genre_scores_gemma":[0.57012624,0.014486272,0.0719529,0.00091511465,0.002223204,0.00026587947,0.00049837475,0.0005671689,0.33896488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996118,0.00010001723,0.000022250979,0.00008835383,0.000143416,0.000034149372],"domain_scores_gemma":[0.99948347,0.000289081,0.0000437559,0.00009892305,0.000051255545,0.000033536464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050321687,0.00075376034,0.0007511578,0.0012950617,0.00059282157,0.0020445795,0.00060226687,0.00080025976,0.009717337],"category_scores_gemma":[0.002006841,0.00041581912,0.0006471645,0.0010651579,0.002079645,0.0034073356,0.0015131278,0.0024295372,0.0020084067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076126507,0.00000434187,0.00002277934,0.000033956723,0.0000045769634,0.000029056582,0.000033391083,0.00052822795,0.00040551,0.98830706,0.0015766155,0.009046893],"study_design_scores_gemma":[0.0000047917733,0.000011089023,0.00009799706,0.00001749263,0.000005668041,0.0002447165,0.000022319708,0.0026748092,0.00056676037,0.9807664,0.015579315,0.00000861481],"about_ca_topic_score_codex":0.00014768151,"about_ca_topic_score_gemma":0.00012792363,"teacher_disagreement_score":0.009717337,"about_ca_system_score_codex":0.00065927237,"about_ca_system_score_gemma":0.00028430833,"threshold_uncertainty_score":0.032507777},"labels":[],"label_agreement":null},{"id":"W7199133","doi":"10.1007/978-3-642-21535-3_33","title":"An Intelligent Agent for Determining Home Occupancy Using Power Monitors and Light Sensors","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Occupancy; Thermostat; Computer science; Home automation; Real-time computing; Power consumption; Home security; Range (aeronautics); Embedded system; Power (physics); Telecommunications; Computer security; Electrical engineering; Architectural engineering; Engineering","score_opus":0.0554724926486958,"score_gpt":0.29022424665028246,"score_spread":0.23475175400158665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7199133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04113911,0.00040257,0.9360691,0.00025164813,0.00023083854,0.0002434716,0.00021772765,0.008806714,0.012638884],"genre_scores_gemma":[0.4222507,0.00032422465,0.55472916,0.00025717684,0.00008788534,0.00033809018,0.0003591764,0.00020186706,0.021451736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983263,0.000022734495,0.000010855206,0.000045157314,0.00007124054,0.000017375178],"domain_scores_gemma":[0.99979335,0.000066587745,0.000024703324,0.000025090478,0.00006216743,0.000028149781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027797345,0.00064100145,0.0007452406,0.00034362564,0.0004507143,0.0007350816,0.0012566474,0.0007558816,0.002367734],"category_scores_gemma":[0.00069035986,0.00035758902,0.00038818654,0.00023628514,0.00022493865,0.00081355846,0.0006799459,0.00060059107,0.00088458863],"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.0010466597,0.0013657287,0.007797276,0.0004864206,0.0002686562,0.0010881894,0.00068650884,0.14179221,0.08170307,0.021360163,0.0261794,0.7162257],"study_design_scores_gemma":[0.000099840916,0.00021285343,0.0019579534,0.000034207813,0.00016998485,0.0003556824,0.00007972532,0.9425798,0.025024453,0.0045580785,0.0248751,0.000052302497],"about_ca_topic_score_codex":0.0022503585,"about_ca_topic_score_gemma":0.004634056,"teacher_disagreement_score":0.002367734,"about_ca_system_score_codex":0.00026908098,"about_ca_system_score_gemma":0.00049780036,"threshold_uncertainty_score":0.007920861},"labels":[],"label_agreement":null},{"id":"W72163051","doi":"10.1007/978-3-642-25011-8_23","title":"The Rand and Block Distances of Pairs of Set Partitions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Combinatorial Mathematics","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":"University of Victoria","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Block (permutation group theory); Integer (computer science); Discrete mathematics; Computer science","score_opus":0.0402739525317651,"score_gpt":0.28356729479301546,"score_spread":0.24329334226125035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72163051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34967545,0.011762195,0.45934847,0.0019335445,0.0008718655,0.0001366782,0.0023600464,0.00056128955,0.1733505],"genre_scores_gemma":[0.7807295,0.0037588202,0.17312318,0.00022620082,0.000610797,0.00027493574,0.001844259,0.0004917253,0.038940594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806243,0.0006520907,0.00011047752,0.00038115203,0.00068492437,0.000108776556],"domain_scores_gemma":[0.99381185,0.0040300344,0.0005082324,0.00074783794,0.00054359535,0.00035847028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014787876,0.0005430094,0.0011102225,0.0026145508,0.0010846561,0.00252956,0.0013923661,0.0009482065,0.0069941017],"category_scores_gemma":[0.0151851475,0.00057522487,0.0005182568,0.0025034572,0.002319783,0.006153181,0.0019432228,0.0022054098,0.001256116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022859621,0.000017120683,0.000995049,0.00017905682,0.000024989755,0.000040244144,0.00034378498,0.009914486,0.0014368999,0.9264381,0.0048504714,0.055531267],"study_design_scores_gemma":[0.000020603524,0.000057391502,0.001502366,0.00006132596,0.00002040437,0.0002459213,0.00017854151,0.024015235,0.0010249526,0.958873,0.013972536,0.000027790962],"about_ca_topic_score_codex":0.00075590826,"about_ca_topic_score_gemma":0.0007964312,"teacher_disagreement_score":0.0069941017,"about_ca_system_score_codex":0.0012410034,"about_ca_system_score_gemma":0.0005267034,"threshold_uncertainty_score":0.023397565},"labels":[],"label_agreement":null},{"id":"W72192500","doi":"10.1007/978-3-642-32589-2_52","title":"The Lower Reaches of Circuit Uniformity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Class (philosophy); Characterization (materials science); Boolean function; Current (fluid); Algorithm; Topology (electrical circuits); Electrical engineering; Artificial intelligence; Materials science; Nanotechnology; Engineering","score_opus":0.0175659527369735,"score_gpt":0.23880385968375029,"score_spread":0.22123790694677678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72192500","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.059835937,0.010261881,0.15844421,0.01503095,0.0012382566,0.000054542055,0.0008258496,0.0009398551,0.75336856],"genre_scores_gemma":[0.8409521,0.0050203875,0.02974831,0.00643698,0.004111427,0.00033964362,0.00072611135,0.0014290839,0.111236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785966,0.00054233614,0.00008814271,0.00061594264,0.0005750702,0.0003189516],"domain_scores_gemma":[0.9911975,0.0064875865,0.00026493153,0.0012633005,0.00049414975,0.0002924386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015952177,0.0008098042,0.0016880375,0.0020344171,0.0024197118,0.005036596,0.0019705738,0.002284586,0.029146727],"category_scores_gemma":[0.015982974,0.0009068055,0.001094871,0.0023266675,0.007071686,0.012147152,0.004293923,0.009021167,0.004189461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002374308,0.000005133655,0.000051932107,0.00003034111,0.0000040183577,0.000010440586,0.00005705846,0.0003661069,0.000116716714,0.9886953,0.0031679878,0.0074711526],"study_design_scores_gemma":[0.0000054043676,0.000004444299,0.000058808517,0.000012038236,0.000004116558,0.000018056528,0.000011243278,0.00063053326,0.0001740139,0.99470454,0.0043721017,0.0000047027092],"about_ca_topic_score_codex":0.0011747042,"about_ca_topic_score_gemma":0.0008073647,"teacher_disagreement_score":0.029146727,"about_ca_system_score_codex":0.0026271434,"about_ca_system_score_gemma":0.0008211922,"threshold_uncertainty_score":0.09750551},"labels":[],"label_agreement":null},{"id":"W72587145","doi":"10.1007/978-3-642-24425-4_59","title":"Analysis of Data-Driven Parameters in Game-Theoretic Rough Sets","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"","keywords":"Rough set; Computer science; Set (abstract data type); Probabilistic logic; Process (computing); Data set; Data mining; Algorithm; Artificial intelligence","score_opus":0.04719406485077381,"score_gpt":0.27319120350301185,"score_spread":0.22599713865223803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72587145","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.068649195,0.000567858,0.9250556,0.0006214768,0.00004415573,0.00010100044,0.000152418,0.00012985173,0.0046784002],"genre_scores_gemma":[0.9081453,0.00051529525,0.08745166,0.000079067024,0.00005870386,0.00014734411,0.00017616189,0.00010320096,0.0033232924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951616,0.0023137333,0.00022444922,0.000593686,0.0011879881,0.0005185943],"domain_scores_gemma":[0.9644489,0.02879492,0.0018752425,0.0019952327,0.0018123141,0.0010733213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009715681,0.0012463998,0.0025206555,0.0018731919,0.0010953669,0.005847058,0.004108587,0.0018792596,0.0033682433],"category_scores_gemma":[0.047043424,0.001480496,0.0023646667,0.0019088571,0.004436846,0.009266231,0.0031780845,0.004677292,0.00027930492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008049108,0.000048518614,0.00085186085,0.000090952366,0.00007072295,0.00008372414,0.00035628007,0.33389977,0.0007817525,0.6552011,0.00047477765,0.008060152],"study_design_scores_gemma":[0.000009943203,0.00003158232,0.00028033738,0.000024797167,0.000022667464,0.000027639164,0.00007417852,0.6869303,0.00029303346,0.31192195,0.00035381538,0.000029756971],"about_ca_topic_score_codex":0.004031463,"about_ca_topic_score_gemma":0.0022262204,"teacher_disagreement_score":0.009715681,"about_ca_system_score_codex":0.005094687,"about_ca_system_score_gemma":0.0022423195,"threshold_uncertainty_score":0.051382005},"labels":[],"label_agreement":null},{"id":"W72644278","doi":"10.1007/978-3-642-21640-4_33","title":"ONTECTAS: Bridging the Gap between Collaborative Tagging Systems and Structured Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bridging (networking); Ontology; Construct (python library); Semantic Web; Block (permutation group theory); Information retrieval; Set (abstract data type); Data mining; Programming language","score_opus":0.03863034186774695,"score_gpt":0.2814982791313524,"score_spread":0.24286793726360545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72644278","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.0071708946,0.0012707774,0.96960056,0.0010042066,0.0005985513,0.00013146158,0.001098094,0.010764567,0.008360961],"genre_scores_gemma":[0.069975436,0.0018722541,0.8854583,0.0007031784,0.00040595827,0.00025113413,0.009539971,0.003806812,0.027986972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949751,0.0020320178,0.00044085164,0.0010060503,0.0013262474,0.0002197398],"domain_scores_gemma":[0.98564917,0.006711713,0.00048721462,0.0056900787,0.00093175174,0.0005299265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057650907,0.0009657683,0.0011933441,0.0025054358,0.0021200327,0.0068294993,0.0033374876,0.0024893687,0.010753307],"category_scores_gemma":[0.013179706,0.0008813668,0.0014386429,0.005253857,0.0020094898,0.017757496,0.009118279,0.0030057372,0.0059503447],"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.0006542351,0.00029209015,0.0017596855,0.00078703713,0.00017352705,0.00043053547,0.0028292711,0.0040516616,0.012280332,0.18219061,0.05611012,0.7384409],"study_design_scores_gemma":[0.00009708228,0.00026951538,0.0016758908,0.00034658544,0.00019177567,0.0010281099,0.0013534952,0.092967995,0.02859631,0.4040123,0.46926594,0.00019505923],"about_ca_topic_score_codex":0.0029716515,"about_ca_topic_score_gemma":0.0047415122,"teacher_disagreement_score":0.010753307,"about_ca_system_score_codex":0.0009084793,"about_ca_system_score_gemma":0.0023835134,"threshold_uncertainty_score":0.03597337},"labels":[],"label_agreement":null},{"id":"W72671121","doi":"10.1007/978-3-642-31680-7_7","title":"Secure Distributed Framework for Achieving ε-Differential Privacy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Differential privacy; Computer science; Data publishing; Generalization; Adversary; Protocol (science); Private information retrieval; Set (abstract data type); Secure multi-party computation; Information sensitivity; Information privacy; Task (project management); Computation; Data mining; Theoretical computer science; Computer security; Publishing; Algorithm; Mathematics","score_opus":0.03043651656471999,"score_gpt":0.27968209709717123,"score_spread":0.24924558053245124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72671121","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.005138952,0.00012251703,0.99051803,0.00021222109,0.000059373368,0.000048769944,0.000040126743,0.0005223278,0.0033377209],"genre_scores_gemma":[0.524598,0.0003781062,0.45586526,0.00040739196,0.00021478749,0.0003928163,0.00023197346,0.00021096,0.017700708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973189,0.0004808979,0.00014251965,0.00047075443,0.0011949952,0.000391913],"domain_scores_gemma":[0.99796945,0.00065512524,0.00010230608,0.00086702465,0.00027866013,0.00012746837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006412,0.0007382811,0.0010597561,0.0006378,0.0015242608,0.0027081345,0.0027744372,0.0014355171,0.0040865927],"category_scores_gemma":[0.003135359,0.0004954516,0.00086271256,0.00091484206,0.0019878433,0.0041662403,0.0054189838,0.003758151,0.0013477157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022083531,0.00010316453,0.0001309457,0.00007635017,0.000026312284,0.00012036025,0.00016276512,0.02081336,0.010334063,0.92339593,0.0028529374,0.041763052],"study_design_scores_gemma":[0.00011724616,0.00011401512,0.000097495424,0.000021879068,0.00004263612,0.00023565955,0.00005108363,0.31105965,0.014250861,0.6598023,0.014171043,0.00003608807],"about_ca_topic_score_codex":0.00049504923,"about_ca_topic_score_gemma":0.00059052097,"teacher_disagreement_score":0.0040865927,"about_ca_system_score_codex":0.0015748942,"about_ca_system_score_gemma":0.0013362424,"threshold_uncertainty_score":0.013670981},"labels":[],"label_agreement":null},{"id":"W72841774","doi":"10.1007/978-3-642-05151-7_12","title":"Verification of CERT Secure Coding Rules: Case Studies","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Software verification; Secure coding; Model checking; Software security assurance; Software; Coding (social sciences); Formal verification; Software engineering; Programming language; Software system; Software construction; Embedded system; Computer security; Information security; Security service","score_opus":0.05165673657441901,"score_gpt":0.32219035599001583,"score_spread":0.27053361941559684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72841774","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.7547269,0.0005933092,0.20906878,0.001417607,0.00007236261,0.0008460361,0.00048088437,0.0015695668,0.031224634],"genre_scores_gemma":[0.92001957,0.00024885547,0.075759,0.00008302785,0.0000115272915,0.00016344283,0.0002381154,0.00021468221,0.0032617722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9886417,0.0045877052,0.0006164034,0.00073687336,0.004528097,0.0008891725],"domain_scores_gemma":[0.90930367,0.07317016,0.0021515465,0.010332709,0.004495823,0.000546099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009513563,0.00073922484,0.00064420816,0.001372059,0.0015706164,0.0023339463,0.002143337,0.0038814628,0.004107274],"category_scores_gemma":[0.06355486,0.0006018503,0.0012133776,0.0012957773,0.0039385976,0.0035686519,0.0024017307,0.0021991576,0.0008135654],"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.0047866977,0.003963257,0.02168553,0.0018433555,0.0002664436,0.019270949,0.009401889,0.33608717,0.038025286,0.23480044,0.009513641,0.3203554],"study_design_scores_gemma":[0.0011068019,0.0020139115,0.003257738,0.00035990524,0.00026050696,0.008595034,0.002979876,0.6180474,0.15385109,0.19319916,0.016175002,0.00015356744],"about_ca_topic_score_codex":0.0026427624,"about_ca_topic_score_gemma":0.0031299312,"teacher_disagreement_score":0.009513563,"about_ca_system_score_codex":0.0015509386,"about_ca_system_score_gemma":0.0016527623,"threshold_uncertainty_score":0.050313115},"labels":[],"label_agreement":null},{"id":"W73112891","doi":"10.1007/978-3-642-15567-3_16","title":"Learning to Detect Roads in High-Resolution Aerial Images","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":624,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Initialization; Artificial intelligence; Context (archaeology); Task (project management); Feature engineering; Artificial neural network; Feature (linguistics); Deep learning; Object detection; Machine learning; Computer vision; Pattern recognition (psychology)","score_opus":0.006167981939215608,"score_gpt":0.2146971444104521,"score_spread":0.20852916247123648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73112891","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.111295514,0.0008866823,0.8784538,0.00035557477,0.00008581844,0.00011636177,0.00070113374,0.0031300983,0.0049751154],"genre_scores_gemma":[0.5547719,0.0012204095,0.42755175,0.00030201726,0.00016370513,0.00016260802,0.0037656422,0.00016224617,0.011899761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998203,0.00001647297,0.000010789883,0.00007976364,0.0000448863,0.00002773735],"domain_scores_gemma":[0.9995604,0.00019959437,0.000046551344,0.00007173696,0.00010241466,0.000019248835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032665653,0.0008769922,0.00058243936,0.00064774073,0.00019403212,0.0005769858,0.0010961781,0.0009717071,0.002817764],"category_scores_gemma":[0.0009665521,0.00042202705,0.00080865785,0.00074910943,0.00034059995,0.0010048227,0.00062130817,0.0008589133,0.0019364523],"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.00006444812,0.00015072609,0.0028059417,0.00016306921,0.000086456545,0.00007632258,0.000053294763,0.06550387,0.025879722,0.0010578728,0.0047707926,0.89938754],"study_design_scores_gemma":[0.00001911728,0.00017189905,0.004105415,0.00002648957,0.000074316784,0.0001920524,0.000083636965,0.9649997,0.021189597,0.0062389127,0.0028838068,0.000015082467],"about_ca_topic_score_codex":0.002939788,"about_ca_topic_score_gemma":0.0066392757,"teacher_disagreement_score":0.002939788,"about_ca_system_score_codex":0.00027464394,"about_ca_system_score_gemma":0.0003927748,"threshold_uncertainty_score":0.009426296},"labels":[],"label_agreement":null},{"id":"W7316702","doi":"10.1007/978-3-540-71945-8_12","title":"Indices, Meaning and Topic Maps: Some Observations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Search engine indexing; Index (typography); Perspective (graphical); Context (archaeology); Meaning (existential); Epistemology; Focus (optics); Computer science; Information retrieval; History; Artificial intelligence; Philosophy; World Wide Web","score_opus":0.051419664038733534,"score_gpt":0.26604507582667425,"score_spread":0.2146254117879407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7316702","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.10312801,0.043129496,0.6498092,0.03710147,0.0010028457,0.00023249837,0.0029324964,0.0015032693,0.16116066],"genre_scores_gemma":[0.73151606,0.030284846,0.20175526,0.0041768188,0.004308893,0.00060407707,0.0027171534,0.0011805979,0.023456264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979231,0.0005957986,0.00018333146,0.0005952514,0.00059056026,0.00011201228],"domain_scores_gemma":[0.97261953,0.022859616,0.0006207415,0.0019756346,0.0015560891,0.0003683465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005143828,0.00085577025,0.0014308017,0.003245365,0.0022298745,0.0071743475,0.001965838,0.0020585398,0.013302736],"category_scores_gemma":[0.030353269,0.0010906024,0.0011110441,0.0054090777,0.0060060946,0.025430907,0.00300434,0.004190418,0.0019607823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017446245,0.00008248728,0.0027085734,0.00044971998,0.000048835616,0.00021592602,0.004187149,0.0017558403,0.0011253593,0.9327819,0.01208514,0.044384617],"study_design_scores_gemma":[0.000030206864,0.000019367266,0.0029117432,0.0000815684,0.000034974702,0.00033644403,0.0008684431,0.0053269793,0.00081994565,0.96584296,0.023687169,0.00004021197],"about_ca_topic_score_codex":0.004707349,"about_ca_topic_score_gemma":0.004603083,"teacher_disagreement_score":0.013302736,"about_ca_system_score_codex":0.0015013838,"about_ca_system_score_gemma":0.0009397577,"threshold_uncertainty_score":0.04450214},"labels":[],"label_agreement":null},{"id":"W7320307","doi":"10.1007/3-540-45657-0_41","title":"ΧChek: A Multi-valued Model-Checker","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":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":"Negation; Model checking; Computer science; Computation tree logic; CTL*; Algorithm; Theoretical computer science; Discrete mathematics; Programming language; Mathematics","score_opus":0.0641780889293681,"score_gpt":0.3000164506333427,"score_spread":0.2358383617039746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7320307","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.006371021,0.0001265807,0.9567115,0.00027199485,0.000268357,0.00010182429,0.000549183,0.031514727,0.004084824],"genre_scores_gemma":[0.3047711,0.0003997994,0.6680575,0.0010222744,0.000112768925,0.00034419604,0.0022026466,0.0086518,0.014437824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685574,0.00089435215,0.00028850746,0.0005922347,0.0010474615,0.00032176432],"domain_scores_gemma":[0.9953929,0.0022761528,0.00023301411,0.0014184406,0.00055191346,0.00012760026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032044475,0.0013987329,0.0011445971,0.0013958858,0.00072696886,0.0031923358,0.0036922076,0.0018429533,0.011308485],"category_scores_gemma":[0.008934779,0.0014916572,0.0019068633,0.0008240835,0.0014024476,0.0065701725,0.0038902652,0.0033110974,0.003062242],"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.0016300012,0.00056242145,0.0034872124,0.0019263973,0.0005574909,0.0009349296,0.0004425486,0.13328648,0.05851223,0.3459147,0.056891263,0.39585435],"study_design_scores_gemma":[0.0003486682,0.00015810753,0.0004470028,0.0002159375,0.00027398186,0.00044192022,0.000072420946,0.6307723,0.10131561,0.21543957,0.05037092,0.00014366381],"about_ca_topic_score_codex":0.0011888954,"about_ca_topic_score_gemma":0.0019569872,"teacher_disagreement_score":0.011308485,"about_ca_system_score_codex":0.00089708297,"about_ca_system_score_gemma":0.0020745094,"threshold_uncertainty_score":0.03783065},"labels":[],"label_agreement":null},{"id":"W73503437","doi":"10.1007/978-3-642-23623-5_30","title":"Towards Real-Time 3D US to CT Bone Image Registration Using Phase and Curvature Feature Based GMM Matching","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Matching (statistics); Artificial intelligence; Curvature; Feature (linguistics); Image registration; Computer vision; Image matching; Image (mathematics); Pattern recognition (psychology); Mathematics; Geometry","score_opus":0.0236530072180999,"score_gpt":0.3108853164957595,"score_spread":0.28723230927765964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73503437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006003193,0.000107699394,0.9907165,0.00006175856,0.00003218809,0.00003695761,0.00004643186,0.00261355,0.00038169316],"genre_scores_gemma":[0.09258148,0.00020063423,0.9040975,0.000093778246,0.000032985947,0.0000675931,0.00021098737,0.0006998576,0.002015216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986951,0.00028274787,0.000070330985,0.0002500253,0.00059114594,0.00011067625],"domain_scores_gemma":[0.99877614,0.00028381907,0.00013135023,0.00027757272,0.0004590642,0.00007198319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014254996,0.00086699694,0.001332336,0.0017015274,0.000520008,0.001851713,0.0019896557,0.0015683591,0.0031695084],"category_scores_gemma":[0.0033563138,0.000937199,0.0011759856,0.0016422379,0.0005950352,0.0013439532,0.0023370942,0.0011280725,0.004729464],"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.000543563,0.00012812138,0.0013958536,0.00014427511,0.0001055024,0.00014212438,0.00020387636,0.013116188,0.24628043,0.0038344704,0.004368849,0.72973675],"study_design_scores_gemma":[0.0000608066,0.00026136375,0.0050779204,0.000039781804,0.0001277218,0.0014839977,0.00020884725,0.7234012,0.2495376,0.006006971,0.013693913,0.00009981583],"about_ca_topic_score_codex":0.0032276283,"about_ca_topic_score_gemma":0.0050214333,"teacher_disagreement_score":0.0032276283,"about_ca_system_score_codex":0.000468206,"about_ca_system_score_gemma":0.001321196,"threshold_uncertainty_score":0.01060307},"labels":[],"label_agreement":null},{"id":"W73684659","doi":"10.1007/978-3-642-23626-6_14","title":"Assessment of Regional Myocardial Function via Statistical Features in MR Images","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","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":"London Health Sciences Centre; St Joseph's Health Care; CARE Canada; Robarts Clinical Trials; Western University","funders":"","keywords":"Computer science; Function (biology); Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.016407376632463406,"score_gpt":0.2955506769423736,"score_spread":0.2791433003099102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73684659","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.6982867,0.0014830093,0.29763848,0.0002140289,0.0000339873,0.00005317383,0.00063197414,0.0006073288,0.0010514627],"genre_scores_gemma":[0.96974653,0.00059491757,0.028895063,0.000024562043,0.000074564785,0.000026677766,0.00030795383,0.000054199096,0.00027560952],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997967,0.000054365923,0.000021802218,0.000041701176,0.000058418253,0.000027103972],"domain_scores_gemma":[0.99895465,0.0005510291,0.00021546654,0.0000756775,0.000140574,0.00006266028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095428474,0.0005050311,0.00052292715,0.002138135,0.00014718133,0.0009284743,0.0002569114,0.000453114,0.0004683812],"category_scores_gemma":[0.0024674875,0.00021828202,0.00047071447,0.00088594545,0.00029444715,0.00084976497,0.0003610823,0.00040914016,0.00026138913],"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.0022039623,0.00036070545,0.119433165,0.0003423386,0.00038693767,0.00072857004,0.00020336914,0.048895072,0.3130853,0.0013867697,0.0012992339,0.51167464],"study_design_scores_gemma":[0.000046794044,0.0011197802,0.31891727,0.00006197956,0.00049658254,0.0027335964,0.00027901353,0.5781045,0.09292802,0.0038167974,0.0013818239,0.00011396036],"about_ca_topic_score_codex":0.0005621202,"about_ca_topic_score_gemma":0.00067720586,"teacher_disagreement_score":0.002138135,"about_ca_system_score_codex":0.0001287504,"about_ca_system_score_gemma":0.00020973304,"threshold_uncertainty_score":0.005046785},"labels":[],"label_agreement":null},{"id":"W73753830","doi":"10.1007/978-3-642-23623-5_41","title":"Layered Surface Fluid Simulation for Surgical Training","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Computer Graphics and Visualization Techniques","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":"National Research Council Canada","funders":"","keywords":"Computer science; Fluid simulation; Surgical simulation; Context (archaeology); Cauterization; Representation (politics); Simulation; Virtual reality; Surgery; Artificial intelligence; Mechanics; Medicine","score_opus":0.07027272265638797,"score_gpt":0.32755512878333276,"score_spread":0.2572824061269448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73753830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12317023,0.00063568976,0.85279506,0.0007258406,0.00029065722,0.00019321364,0.0005357503,0.0017575071,0.019896071],"genre_scores_gemma":[0.8931542,0.00046477685,0.09719451,0.00012230259,0.00005001175,0.00020048645,0.00028564196,0.00033901274,0.008189014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998293,0.00006595446,0.00000783835,0.000012728578,0.00006109717,0.000022971913],"domain_scores_gemma":[0.999416,0.00034645,0.000034406392,0.000037997706,0.000105951374,0.00005924788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025696185,0.00072608714,0.00073516776,0.00052502006,0.00040853274,0.0009801316,0.0010901381,0.0016533361,0.006089369],"category_scores_gemma":[0.0019574482,0.0005747637,0.0007803061,0.00050805433,0.0004728783,0.0006806747,0.001241717,0.0009254898,0.0007405515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004456021,0.00002663973,0.00024692257,0.000023536239,0.000011080875,0.00003871266,0.000030190307,0.9905161,0.0013841846,0.0021800278,0.00029963636,0.0051984005],"study_design_scores_gemma":[0.000008955747,0.000009523765,0.00003172715,0.0000029129396,0.000002045426,0.000005240727,0.0000042194683,0.99896073,0.00027436164,0.0005046788,0.00019250455,0.000003024227],"about_ca_topic_score_codex":0.010483728,"about_ca_topic_score_gemma":0.004539964,"teacher_disagreement_score":0.010483728,"about_ca_system_score_codex":0.0005574825,"about_ca_system_score_gemma":0.0011081605,"threshold_uncertainty_score":0.020845413},"labels":[],"label_agreement":null},{"id":"W73986762","doi":"10.1007/978-3-642-32469-7_5","title":"Microcontroller Assembly Synthesis from Timed Automaton Task Specifications","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Automaton; Timed automaton; Task (project management); Programming language; Microcontroller; Embedded system; Theoretical computer science","score_opus":0.034346529038926245,"score_gpt":0.26220471976385173,"score_spread":0.2278581907249255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73986762","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.017406598,0.00023546106,0.9665599,0.000043525146,0.000068319554,0.00011842808,0.00019703229,0.0025147866,0.012856068],"genre_scores_gemma":[0.5033214,0.00070269353,0.46983853,0.00006320588,0.00003403045,0.00047057358,0.0011590805,0.0013094484,0.023101015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996809,0.000049007605,0.000026675176,0.000044257875,0.000165398,0.000033826807],"domain_scores_gemma":[0.9995534,0.0002488418,0.00004052666,0.00005788502,0.00008930932,0.0000099722565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002843395,0.0008443241,0.00045421242,0.00056022627,0.00025252116,0.0006799942,0.00073757156,0.00052607775,0.0057682944],"category_scores_gemma":[0.0009734092,0.0005675674,0.0006752522,0.0004569934,0.00032229576,0.0005865054,0.00038642134,0.0005844168,0.0014596796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033026017,0.00010197944,0.0004830475,0.0015045184,0.00007121303,0.0012139257,0.00054666575,0.34919444,0.2156475,0.14141086,0.004959528,0.28453606],"study_design_scores_gemma":[0.00008611427,0.0004899758,0.00032312277,0.00022005741,0.000117104115,0.0006210726,0.00010645219,0.6494968,0.2614652,0.042251185,0.04477905,0.000044003336],"about_ca_topic_score_codex":0.0007023802,"about_ca_topic_score_gemma":0.0012326604,"teacher_disagreement_score":0.0057682944,"about_ca_system_score_codex":0.0002877344,"about_ca_system_score_gemma":0.000620516,"threshold_uncertainty_score":0.019296885},"labels":[],"label_agreement":null},{"id":"W74033047","doi":"10.1007/978-3-642-38577-3_45","title":"Simulation-Based Fault Propagation Analysis – Application on Hydrogen Production Plant","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control 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":"Ontario Tech University","funders":"","keywords":"Computer science; Robustness (evolution); Hydrogen production; Artificial neural network; Process (computing); Greenhouse gas; Reliability engineering; Reliability (semiconductor); Process engineering; Hydrogen; Machine learning; Engineering","score_opus":0.01274939668857361,"score_gpt":0.22424158411417666,"score_spread":0.21149218742560305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74033047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27118966,0.00086430536,0.7150855,0.00027408678,0.00010060286,0.00009725114,0.0002031662,0.0029375732,0.009247876],"genre_scores_gemma":[0.96781355,0.00021149009,0.030476602,0.000015679323,0.00001123742,0.000030306706,0.00007380656,0.00004624783,0.0013211364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991083,0.000032654607,0.00000628775,0.000012534173,0.000027514463,0.0000101709875],"domain_scores_gemma":[0.99947613,0.0003136148,0.000040178573,0.00003500716,0.00012003299,0.0000151138665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035971,0.00055140385,0.0005898915,0.0005201143,0.00037517634,0.00042465562,0.0004974996,0.00083477405,0.0021128182],"category_scores_gemma":[0.00077737565,0.00028812696,0.0005341766,0.0004721885,0.00022292654,0.0004026449,0.00025657262,0.00042915405,0.00017371666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008629264,0.00003695059,0.0005170202,0.000057920213,0.000019671605,0.000064450345,0.000032581396,0.97508144,0.0026285062,0.00093544665,0.0002626485,0.020277148],"study_design_scores_gemma":[0.0000025579432,0.000010267313,0.000086317865,0.0000019920938,0.0000035165212,0.0000064305636,0.0000031264658,0.99917394,0.00043815828,0.00019203767,0.000080271624,0.0000014477939],"about_ca_topic_score_codex":0.009801437,"about_ca_topic_score_gemma":0.0041593136,"teacher_disagreement_score":0.009801437,"about_ca_system_score_codex":0.00042481435,"about_ca_system_score_gemma":0.000402843,"threshold_uncertainty_score":0.019488811},"labels":[],"label_agreement":null},{"id":"W7457788","doi":"10.1007/978-3-642-38227-7_23","title":"Mechanisms to Locate Non-cooperative Transmitters in Wireless Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"École de Technologie Supérieure","funders":"","keywords":"Transmitter; Computer science; Set (abstract data type); Wireless; Wireless sensor network; Measure (data warehouse); Residual; Wireless network; Algorithm; Computer network; Telecommunications; Data mining","score_opus":0.008336327617876024,"score_gpt":0.19648036459975332,"score_spread":0.1881440369818773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7457788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014200256,0.0035714114,0.9679538,0.0004161392,0.00037284303,0.00012801283,0.000042274423,0.0008408143,0.012474507],"genre_scores_gemma":[0.64878553,0.006208846,0.2984863,0.00050504936,0.0005418234,0.00072547625,0.0001751363,0.00017849043,0.044393323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00018670446,0.00006117464,0.000110034685,0.00023419369,0.0000954848],"domain_scores_gemma":[0.9975643,0.0011789514,0.00026119125,0.0006159495,0.00030798928,0.00007163359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016661262,0.0009336571,0.0007923945,0.0010401694,0.0006946139,0.0017476735,0.003644697,0.0017216369,0.0036772685],"category_scores_gemma":[0.0045103896,0.000662199,0.0005069898,0.0010993012,0.001125268,0.0029673525,0.0026195939,0.001265484,0.0013544972],"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.00028090985,0.00017181512,0.0006576762,0.0010027132,0.00014062232,0.00041928157,0.00054871646,0.11356589,0.030935869,0.4479075,0.009452924,0.3949161],"study_design_scores_gemma":[0.00026271914,0.00073731196,0.0009944348,0.00034936517,0.00030779897,0.002592047,0.00039024526,0.5034946,0.0368248,0.38040423,0.073474854,0.00016754109],"about_ca_topic_score_codex":0.00024657304,"about_ca_topic_score_gemma":0.00037291792,"teacher_disagreement_score":0.0036772685,"about_ca_system_score_codex":0.00042496502,"about_ca_system_score_gemma":0.0003833188,"threshold_uncertainty_score":0.012301743},"labels":[],"label_agreement":null},{"id":"W74688787","doi":"10.1007/3-540-44503-x_18","title":"A Semi-monad for Semi-structured Data (ICDT Version)","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"Bell (Canada); Glycemic Index Laboratories","funders":"","keywords":"Computer science; XML; Monad (category theory); XML Schema Editor; Streaming XML; XML validation; Programming language; Construct (python library); XML Encryption; XML Schema (W3C); Information retrieval; Efficient XML Interchange; XML database; Algebra over a field; Database; World Wide Web; Mathematics; Discrete mathematics; Functor; Pure mathematics","score_opus":0.03064829008049793,"score_gpt":0.27062425106218585,"score_spread":0.2399759609816879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74688787","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.0016060675,0.0005694036,0.98164314,0.00034588334,0.00064146944,0.00009044008,0.0015348789,0.008849553,0.0047191377],"genre_scores_gemma":[0.06628778,0.0009809369,0.88421595,0.0008499273,0.00089995743,0.0005077854,0.008324349,0.005546873,0.032386396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733317,0.00044872132,0.0005049058,0.00052258576,0.0009117896,0.0002788593],"domain_scores_gemma":[0.9970413,0.00067708106,0.00013839931,0.0013751815,0.00058392895,0.0001840899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034825453,0.00093516347,0.0011589421,0.0018180825,0.0012435687,0.0052480195,0.0019011843,0.0012501666,0.020939777],"category_scores_gemma":[0.0056002615,0.0015881025,0.0026077565,0.0034466397,0.0017505792,0.008081585,0.0036146427,0.004289442,0.009132547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050203403,0.00013951203,0.000681231,0.000643746,0.000083698156,0.00029108766,0.00069742516,0.0049747205,0.0075488216,0.57282615,0.10076087,0.31085062],"study_design_scores_gemma":[0.00013577654,0.00016406071,0.00072230544,0.00026597054,0.00015143686,0.001063977,0.00015055445,0.049712937,0.015604108,0.47423112,0.4576504,0.00014723778],"about_ca_topic_score_codex":0.0029080634,"about_ca_topic_score_gemma":0.002846072,"teacher_disagreement_score":0.020939777,"about_ca_system_score_codex":0.0015106285,"about_ca_system_score_gemma":0.0021628179,"threshold_uncertainty_score":0.07005048},"labels":[],"label_agreement":null},{"id":"W74690725","doi":"10.1007/978-3-642-25011-8_22","title":"Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Stereographic projection; Simple (philosophy); Projection (relational algebra); Diagram; Regular polygon; Point (geometry); Computer science; Geometry; Mathematics; Combinatorics; Algorithm; Statistics","score_opus":0.02557290778734683,"score_gpt":0.24529499863670667,"score_spread":0.21972209084935984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74690725","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.19744536,0.00038420028,0.6108722,0.00031356374,0.00039089192,0.00029061644,0.0011216392,0.001301841,0.18787967],"genre_scores_gemma":[0.69208723,0.0007748588,0.21087247,0.00020784633,0.000107577915,0.00029481482,0.002681235,0.0015412802,0.09143273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995975,0.00006158716,0.000018154782,0.000072156596,0.00018003238,0.00007065307],"domain_scores_gemma":[0.99960417,0.00015738339,0.000033040425,0.00005934636,0.00009732704,0.000048786358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032995795,0.0008496447,0.0007914433,0.0011994587,0.0007519965,0.0018572331,0.0009685073,0.000915084,0.017132811],"category_scores_gemma":[0.0014294907,0.00069467345,0.0008432347,0.00078086066,0.00088883884,0.0017856456,0.0016459917,0.00161678,0.005298594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011456257,0.00008874196,0.00038613536,0.00029170103,0.000028465769,0.00042500577,0.0006542845,0.011835106,0.018085508,0.8656516,0.0077194967,0.09471939],"study_design_scores_gemma":[0.000078073135,0.000078808254,0.00037334126,0.000112261696,0.000044049983,0.00045052753,0.0003462486,0.028271606,0.01817615,0.89965826,0.05236621,0.000044324148],"about_ca_topic_score_codex":0.00031531844,"about_ca_topic_score_gemma":0.00077141233,"teacher_disagreement_score":0.017132811,"about_ca_system_score_codex":0.0005443383,"about_ca_system_score_gemma":0.00033018703,"threshold_uncertainty_score":0.057314992},"labels":[],"label_agreement":null},{"id":"W746964905","doi":"10.1007/978-3-319-11740-9_50","title":"Analysis of User-Weighted π Rough k-Means","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","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":"Saint Mary's University","funders":"","keywords":"Rough set; Computer science; Extension (predicate logic); Laplace transform; Algorithm; Artificial intelligence; Mathematics; Mathematical analysis","score_opus":0.01519544192498215,"score_gpt":0.2351575810839781,"score_spread":0.21996213915899596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W746964905","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.056215305,0.00061739783,0.9409132,0.0000982047,0.000047134996,0.000044037337,0.00006724196,0.00023095224,0.0017665151],"genre_scores_gemma":[0.7355608,0.0004715197,0.25933906,0.000054573255,0.0000802481,0.000102778264,0.00035452703,0.00016034069,0.0038762542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605227,0.0011573767,0.0001977085,0.00064382027,0.0015933627,0.00035545148],"domain_scores_gemma":[0.9905032,0.0052306065,0.00047755518,0.0009583791,0.0026296906,0.00020069348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036531342,0.0007191737,0.0014008417,0.0017245075,0.0010828617,0.00255232,0.002873222,0.0012624201,0.0029994694],"category_scores_gemma":[0.01713457,0.00058217713,0.0015452397,0.0020800794,0.0008716626,0.0034069647,0.0017505826,0.0011580929,0.0004924703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009190174,0.0001851654,0.005542237,0.00040081493,0.00038034716,0.00016704276,0.0006009355,0.62664235,0.008741263,0.15063202,0.0031250303,0.20266373],"study_design_scores_gemma":[0.0000044699013,0.000051421986,0.00067887706,0.000008846837,0.000032191918,0.00004736949,0.000044720528,0.9850503,0.0010805012,0.01241498,0.00056725676,0.000019143878],"about_ca_topic_score_codex":0.004843543,"about_ca_topic_score_gemma":0.0030075526,"teacher_disagreement_score":0.004843543,"about_ca_system_score_codex":0.0017186465,"about_ca_system_score_gemma":0.0015577497,"threshold_uncertainty_score":0.019319892},"labels":[],"label_agreement":null},{"id":"W75042331","doi":"10.1007/978-3-642-22922-0_39","title":"Efficient Spatio-temporal Sensor Data Loading for a Sensor Web Browser","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sensor web; Computer science; Mashup; Wireless sensor network; Cache; Web server; Web API; Computer network; Web service; Web navigation; Distributed computing; The Internet; World Wide Web; Key distribution in wireless sensor networks; Operating system","score_opus":0.049109525857391284,"score_gpt":0.26437931111356133,"score_spread":0.21526978525617005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75042331","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.028941732,0.00043683514,0.8209722,0.00024556863,0.0001580224,0.00027470247,0.0014725368,0.1386357,0.008862677],"genre_scores_gemma":[0.33883363,0.00068073825,0.6159133,0.0003633718,0.000096952564,0.0004920109,0.005581614,0.012254286,0.025784288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951744,0.00004280057,0.000046723995,0.00009576524,0.0002421247,0.000055128614],"domain_scores_gemma":[0.9985259,0.00039117935,0.000049632967,0.000542882,0.0003443999,0.00014610188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005319476,0.0013376838,0.0009684067,0.0010104938,0.00068898813,0.002065075,0.0018107212,0.00070152496,0.014320976],"category_scores_gemma":[0.0023652515,0.00089274574,0.0007219603,0.001231003,0.0004036939,0.002035463,0.0021052444,0.0009289255,0.0060895886],"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.001376113,0.00043846059,0.005952271,0.0005725649,0.00021261633,0.00094791746,0.00088336784,0.016059227,0.16273683,0.011749405,0.08492053,0.7141507],"study_design_scores_gemma":[0.00021951714,0.00013164768,0.0053145294,0.00009818714,0.00015281625,0.00091740873,0.00042936802,0.6822125,0.219578,0.0155852465,0.075214,0.00014688056],"about_ca_topic_score_codex":0.004045967,"about_ca_topic_score_gemma":0.006973913,"teacher_disagreement_score":0.014320976,"about_ca_system_score_codex":0.0007225977,"about_ca_system_score_gemma":0.0010126551,"threshold_uncertainty_score":0.047908425},"labels":[],"label_agreement":null},{"id":"W75044610","doi":"10.1007/978-3-642-35170-9_13","title":"Opportunistic Multipath Forwarding in Content-Based Publish/Subscribe Overlays","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; PlanetLab; Computer network; Overlay network; Overlay; Distributed computing; Bandwidth (computing); Publication; Overhead (engineering); Testbed; Baseline (sea); The Internet; Operating system","score_opus":0.05884706481855442,"score_gpt":0.2548629123556807,"score_spread":0.19601584753712628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75044610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21471237,0.0032794795,0.7670344,0.000926468,0.00033269744,0.00024186347,0.00036721004,0.0025401788,0.01056529],"genre_scores_gemma":[0.90721375,0.0011735117,0.085462615,0.00005765863,0.00015682811,0.000093847135,0.00019304025,0.00012094998,0.0055278484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0003783516,0.00007846595,0.00019502729,0.00046069172,0.00023615842],"domain_scores_gemma":[0.99368495,0.0042700837,0.00036342622,0.00078787055,0.0006530844,0.00024056429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023305304,0.00056922034,0.0016147031,0.0014441313,0.002041144,0.002361153,0.0019203502,0.001344991,0.0016020866],"category_scores_gemma":[0.008066408,0.00085618004,0.00044262208,0.0023599626,0.0009784326,0.002551422,0.0019047391,0.0008564175,0.00038821538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010607813,0.0003118004,0.0038805094,0.0004519534,0.0001780634,0.0009957385,0.00089599326,0.6154929,0.022768285,0.14211534,0.009566695,0.20228189],"study_design_scores_gemma":[0.000047920945,0.000077167024,0.00034717494,0.000018305645,0.00005378471,0.00022531247,0.00013939016,0.94499975,0.0044240206,0.045437556,0.004200633,0.00002885661],"about_ca_topic_score_codex":0.0038270333,"about_ca_topic_score_gemma":0.0047063124,"teacher_disagreement_score":0.0038270333,"about_ca_system_score_codex":0.0015175367,"about_ca_system_score_gemma":0.0011619206,"threshold_uncertainty_score":0.012325168},"labels":[],"label_agreement":null},{"id":"W75069381","doi":"10.1007/978-3-642-23968-7_19","title":"Towards a General Abstraction through Sequences of Conceptual Operations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Abstraction; Flexibility (engineering); Field (mathematics); Computer graphics; Range (aeronautics); Set (abstract data type); Artificial intelligence; Abstraction layer; Theoretical computer science; Human–computer interaction; Programming language; Software","score_opus":0.04468082058164675,"score_gpt":0.30260199106522007,"score_spread":0.2579211704835733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75069381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041549187,0.00017823407,0.98763835,0.00023334284,0.00007017122,0.000049985,0.000091258014,0.000614244,0.006969543],"genre_scores_gemma":[0.08910671,0.0006945149,0.8965618,0.00023207384,0.0000892661,0.00019628777,0.00061870366,0.0005076665,0.011992997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985299,0.00039872303,0.00015639793,0.00038025304,0.00039679336,0.0001379508],"domain_scores_gemma":[0.9986118,0.00041530284,0.00008926467,0.00056496,0.00022596167,0.0000927038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001860882,0.0012954923,0.00089123205,0.0015589494,0.0011876442,0.003774094,0.0020763543,0.0014186787,0.009410616],"category_scores_gemma":[0.0036274476,0.0012609937,0.002725519,0.0018567806,0.0043140734,0.014829021,0.0051433453,0.005090404,0.0036042244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022635835,0.0000107290625,0.00009145518,0.00010763502,0.000014830284,0.000056873825,0.00066993455,0.0012961106,0.0012605995,0.9648619,0.0013214755,0.03028584],"study_design_scores_gemma":[0.0000106455545,0.000024336076,0.00008260622,0.000065764514,0.0000301021,0.0001133962,0.00021340243,0.012841792,0.0015322253,0.9544695,0.030599674,0.000016519052],"about_ca_topic_score_codex":0.0016987482,"about_ca_topic_score_gemma":0.0015773141,"teacher_disagreement_score":0.009410616,"about_ca_system_score_codex":0.0008655223,"about_ca_system_score_gemma":0.0011930645,"threshold_uncertainty_score":0.031481683},"labels":[],"label_agreement":null},{"id":"W751569568","doi":"10.1007/978-3-319-17470-9_9","title":"Gambling, Computational Information and Encryption Security","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","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","funders":"","keywords":"Computer science; Encryption; Computer security; Information security; Theoretical computer science","score_opus":0.022451381781292745,"score_gpt":0.2622463664780487,"score_spread":0.23979498469675598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W751569568","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.01467354,0.07767169,0.081911735,0.011063422,0.0025672985,0.000078170444,0.00022230622,0.0003208101,0.8114911],"genre_scores_gemma":[0.4063906,0.049900148,0.037193622,0.004403158,0.0026659542,0.000262792,0.0003254682,0.00029147416,0.4985668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998043,0.000042654603,0.000009149375,0.00003073802,0.000086286615,0.00002680844],"domain_scores_gemma":[0.9998466,0.00008345461,0.000014324234,0.000023447392,0.000020825464,0.000011328733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025783526,0.000679026,0.00046000432,0.00097306893,0.0007937322,0.0022893308,0.0005486523,0.0013415471,0.011614707],"category_scores_gemma":[0.0011435661,0.00025312405,0.00028994985,0.0011548696,0.003602946,0.003446353,0.0009033306,0.0023337875,0.0024071387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130474555,0.000014244776,0.00003573522,0.000072139774,0.0000028816964,0.000026467362,0.00006942565,0.0006473938,0.00051401916,0.96094835,0.013957321,0.023699012],"study_design_scores_gemma":[0.000009057535,0.000018078163,0.00011583091,0.00006781985,0.0000038315607,0.00014178237,0.000048095146,0.0022609248,0.00044495572,0.89815205,0.09872895,0.000008681686],"about_ca_topic_score_codex":0.0009864114,"about_ca_topic_score_gemma":0.0011965557,"teacher_disagreement_score":0.011614707,"about_ca_system_score_codex":0.0011696495,"about_ca_system_score_gemma":0.00065767934,"threshold_uncertainty_score":0.038855076},"labels":[],"label_agreement":null},{"id":"W75293394","doi":"10.1007/978-3-642-28509-7_20","title":"Selective Propagation of Social Data in Decentralized Online Social Network","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Scalability; Computer science; Convergence (economics); Distributed computing; Order (exchange); Filter (signal processing); Social network (sociolinguistics); Architecture; Construct (python library); Decentralised system; Control (management); Social media; World Wide Web; Computer network; Artificial intelligence; Database; Business","score_opus":0.0335435268894795,"score_gpt":0.28806701288321307,"score_spread":0.2545234859937336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75293394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23407675,0.00074247114,0.75643927,0.001297077,0.000117624855,0.00019687037,0.00038432278,0.0008909899,0.005854584],"genre_scores_gemma":[0.95406306,0.00061080727,0.037784893,0.00011725766,0.00020238638,0.00015847523,0.00033742018,0.0001246927,0.0066010607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975727,0.0009636571,0.000106414176,0.00039009456,0.0007619201,0.00020518932],"domain_scores_gemma":[0.9702726,0.02312968,0.001989568,0.0023383808,0.0016520385,0.00061771664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003548388,0.00051814265,0.0011028243,0.0024118377,0.001473997,0.0018845855,0.0018060714,0.0016738934,0.0013395943],"category_scores_gemma":[0.023285514,0.0009094445,0.0007692028,0.0019798467,0.0015328533,0.0033454688,0.002683847,0.0013538825,0.0004936325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063029863,0.00030355615,0.014695216,0.0005292566,0.00026728562,0.0012508009,0.001765174,0.6346727,0.019163659,0.19490135,0.009845641,0.12197509],"study_design_scores_gemma":[0.000024034553,0.000046161855,0.0011079528,0.000011543304,0.000030373943,0.00015383206,0.00008733862,0.9572261,0.001991764,0.03820941,0.0010945002,0.000016973756],"about_ca_topic_score_codex":0.0029336573,"about_ca_topic_score_gemma":0.003539571,"teacher_disagreement_score":0.003548388,"about_ca_system_score_codex":0.0011904745,"about_ca_system_score_gemma":0.0008437977,"threshold_uncertainty_score":0.018765867},"labels":[],"label_agreement":null},{"id":"W754108293","doi":"10.1007/978-3-319-18251-3_6","title":"A Web-Based Steam Assisted Gravity Drainage (SAGD) Data Visualization and Analytical System","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Environmental Monitoring and Data Management","field":"Earth and Planetary Sciences","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 Calgary","funders":"","keywords":"Computer science; Visualization; Data mining; Data visualization; Database; Table (database); Steam-assisted gravity drainage; Cluster analysis; Histogram; Artificial intelligence; Cartography; Image (mathematics)","score_opus":0.04398663034305,"score_gpt":0.26634325127503755,"score_spread":0.22235662093198755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W754108293","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.031698156,0.000404206,0.49079692,0.00042577554,0.0002242103,0.00046317262,0.01201531,0.44852754,0.015444703],"genre_scores_gemma":[0.44003248,0.00091046083,0.47645387,0.0014476356,0.00026331833,0.0009874993,0.03043114,0.013001291,0.036472287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968517,0.000031245014,0.000027005795,0.00006555687,0.0001665804,0.00002433777],"domain_scores_gemma":[0.99945587,0.00013070338,0.000029998455,0.0001110815,0.00017872873,0.0000935964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050857617,0.00085578527,0.0010356456,0.0016634967,0.00047609274,0.001483358,0.0013132647,0.00069120683,0.019571533],"category_scores_gemma":[0.0010404672,0.00045448766,0.0005206498,0.0011752655,0.00022251648,0.0011870255,0.0016317493,0.0006565621,0.005845866],"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.0015814563,0.0008210311,0.01096039,0.00068239536,0.00029999134,0.00066463446,0.0005311977,0.02341285,0.069639154,0.0041886163,0.18888314,0.69833523],"study_design_scores_gemma":[0.000490833,0.00031704284,0.014105996,0.00015463182,0.00026430291,0.00085608143,0.00023142385,0.7072241,0.08469559,0.010950785,0.18039474,0.0003144802],"about_ca_topic_score_codex":0.004089971,"about_ca_topic_score_gemma":0.003450138,"teacher_disagreement_score":0.019571533,"about_ca_system_score_codex":0.00040922794,"about_ca_system_score_gemma":0.00075007416,"threshold_uncertainty_score":0.06547332},"labels":[],"label_agreement":null},{"id":"W75458656","doi":"10.1007/978-3-319-14974-5_4","title":"Three Paths to Point Placement","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Vertex (graph theory); Computer science; Graph; Combinatorics; Uniqueness; Point (geometry); Algorithm; Upper and lower bounds; Line segment; Mathematics; Theoretical computer science; Artificial intelligence; Geometry","score_opus":0.03093253618498641,"score_gpt":0.26538787984099416,"score_spread":0.23445534365600773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75458656","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.0042517795,0.0014873627,0.92705745,0.0007909161,0.0005472797,0.00008714854,0.00021593118,0.0012046397,0.0643575],"genre_scores_gemma":[0.11680002,0.0038614974,0.7393589,0.0006272592,0.00039329653,0.00041222898,0.0010386639,0.0014709395,0.13603725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.000132336,0.000029463483,0.00013830695,0.00025769323,0.00006389374],"domain_scores_gemma":[0.9993678,0.00021941878,0.00002872201,0.00018641751,0.00013206329,0.00006555901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080974,0.0013914164,0.0010941556,0.0012703205,0.0013193815,0.0024655282,0.0020859602,0.0019367213,0.02926149],"category_scores_gemma":[0.0026128227,0.00082086667,0.0011739022,0.0020117136,0.0029003005,0.0029455784,0.0046553663,0.0049133184,0.009645556],"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.000101781305,0.00004878893,0.0001087395,0.00019966866,0.000019038558,0.00008174482,0.0002923864,0.026997054,0.0014357887,0.7111875,0.022906005,0.23662151],"study_design_scores_gemma":[0.000028247272,0.00004424535,0.00006568496,0.00009216037,0.000012701264,0.00011739677,0.00009023176,0.05327704,0.001273126,0.8478141,0.097166084,0.000019007814],"about_ca_topic_score_codex":0.0018639766,"about_ca_topic_score_gemma":0.0017642085,"teacher_disagreement_score":0.02926149,"about_ca_system_score_codex":0.0014648617,"about_ca_system_score_gemma":0.00090273476,"threshold_uncertainty_score":0.09788948},"labels":[],"label_agreement":null},{"id":"W75489045","doi":"10.1007/978-3-642-00672-2","title":"Advances in Data and Web Management","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"Simon Fraser University","funders":"","keywords":"Computer science; China; Data management; World Wide Web; Joint (building); Library science; Data science; Database; History; Engineering","score_opus":0.014896951155173201,"score_gpt":0.2655749467259828,"score_spread":0.2506779955708096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75489045","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004191814,0.53329426,0.22245519,0.023100449,0.013735836,0.0001379917,0.0013300909,0.0028979746,0.1988564],"genre_scores_gemma":[0.0426363,0.5303198,0.16439298,0.0051640416,0.016173145,0.0002097076,0.002241991,0.0010630272,0.2377991],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988242,0.00013792752,0.00008176768,0.00013705934,0.0007610833,0.000057886442],"domain_scores_gemma":[0.9964083,0.0019865714,0.00014554185,0.0005901386,0.0007084453,0.00016106498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017673193,0.00096776383,0.0012563427,0.0037741812,0.000590404,0.0046131266,0.0013505054,0.001076228,0.017410347],"category_scores_gemma":[0.006035779,0.00053270586,0.0005705813,0.010042944,0.001273155,0.009479904,0.0018022216,0.0025971036,0.0097062625],"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.000023249648,0.00007813921,0.00038039926,0.00092679186,0.000030550593,0.00005971131,0.00012463755,0.0010498352,0.0008589,0.13168244,0.19431321,0.6704721],"study_design_scores_gemma":[0.0000056813524,0.000015459786,0.00041781273,0.0002386913,0.000022417189,0.00022124381,0.00006674638,0.004450727,0.0006960614,0.12258593,0.8712647,0.000014491745],"about_ca_topic_score_codex":0.0010638362,"about_ca_topic_score_gemma":0.001234592,"teacher_disagreement_score":0.017410347,"about_ca_system_score_codex":0.0011650537,"about_ca_system_score_gemma":0.0014181236,"threshold_uncertainty_score":0.058243394},"labels":[],"label_agreement":null},{"id":"W75520331","doi":"10.1007/978-3-642-23181-0_6","title":"Localization of Industrial Wireless Sensor Networks: An Artificial Neural Network Approach","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Wireless sensor network; Computer science; Factory (object-oriented programming); Artificial neural network; Noise (video); Wireless; Wireless network; Key distribution in wireless sensor networks; Network topology; Node (physics); Sensitivity (control systems); Real-time computing; Artificial intelligence; Computer network; Telecommunications; Electronic engineering; Engineering","score_opus":0.03175446056078629,"score_gpt":0.21590154701825104,"score_spread":0.18414708645746475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75520331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059875096,0.004606545,0.98364717,0.00033614362,0.00014411303,0.000012828998,0.0000421666,0.00021834049,0.005005188],"genre_scores_gemma":[0.6801318,0.018255906,0.27696377,0.000336957,0.00085276144,0.00013137102,0.0002635178,0.00017046797,0.022893503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981636,0.000058584767,0.00001250696,0.00004612065,0.000047150384,0.00001926765],"domain_scores_gemma":[0.99976736,0.0001282696,0.000030343524,0.000015698895,0.00005273726,0.000005595927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038482182,0.0006620418,0.00065926893,0.00061749393,0.00023602461,0.0008511677,0.0012116203,0.0012037795,0.0012459015],"category_scores_gemma":[0.0011402908,0.00041472667,0.0004967544,0.001388202,0.0005558724,0.0012322635,0.0005266934,0.0008196028,0.00032015998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023995703,0.000017321789,0.00031739054,0.00012596698,0.000037525628,0.00006260833,0.00003355928,0.9030815,0.0017287051,0.014282943,0.0012993332,0.07898925],"study_design_scores_gemma":[0.0000012514378,0.000006567034,0.000099326346,0.000008498795,0.0000074198388,0.000017116523,0.0000062484705,0.99292845,0.00029988468,0.0058525335,0.000768242,0.0000044668536],"about_ca_topic_score_codex":0.004925361,"about_ca_topic_score_gemma":0.00497706,"teacher_disagreement_score":0.004925361,"about_ca_system_score_codex":0.00061769114,"about_ca_system_score_gemma":0.00028553454,"threshold_uncertainty_score":0.009793401},"labels":[],"label_agreement":null},{"id":"W756839746","doi":"10.1007/978-3-319-21407-8_15","title":"GPS Data Interpolation: Bezier Vs. Biarcs for Tracing Vehicle Trajectory","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Global Positioning System; Bézier curve; Interpolation (computer graphics); Trajectory; Tracing; Ray tracing (physics); Real-time computing; Computer graphics (images); Geodesy; Computer vision; Telecommunications; Geography; Mathematics; Motion (physics); Operating system; Geometry","score_opus":0.03824621766090867,"score_gpt":0.2584862657457419,"score_spread":0.22024004808483325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W756839746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012332305,0.0008583569,0.9817457,0.00013994929,0.00012429283,0.000031732914,0.00021835092,0.0017752728,0.002773987],"genre_scores_gemma":[0.2435201,0.002079841,0.7457072,0.00007258192,0.000099671735,0.00006462949,0.0006997114,0.00091750664,0.0068388013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.0000865625,0.000029246887,0.00012730817,0.00019283057,0.000040831947],"domain_scores_gemma":[0.9993912,0.00021202757,0.000049214716,0.00013974901,0.00018034299,0.000027429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063502294,0.0006176685,0.00076011405,0.0012615841,0.00035514243,0.0009832821,0.0010083334,0.000666392,0.0044247154],"category_scores_gemma":[0.0028726552,0.0005001201,0.00053949404,0.002761395,0.00046386823,0.0013149838,0.00090839533,0.0012420665,0.0020637608],"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.00076913607,0.00006539926,0.0027037286,0.00037695956,0.000055562792,0.0000979625,0.00035688112,0.11947591,0.013575509,0.029036634,0.006884918,0.8266013],"study_design_scores_gemma":[0.000028253962,0.000102507474,0.0013508572,0.00007661276,0.000036448106,0.0002441885,0.00010851425,0.9576479,0.009638498,0.012235076,0.01849218,0.000038943977],"about_ca_topic_score_codex":0.0104529755,"about_ca_topic_score_gemma":0.0074361395,"teacher_disagreement_score":0.0104529755,"about_ca_system_score_codex":0.00041393455,"about_ca_system_score_gemma":0.0007556969,"threshold_uncertainty_score":0.020784259},"labels":[],"label_agreement":null},{"id":"W757277879","doi":"10.1007/978-3-319-17533-1_9","title":"On the Effectiveness of Different Botnet Detection Approaches","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":28,"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":"National Institute for Materials Science","keywords":"Botnet; Computer science; Payload (computing); Malware; Upgrade; Data mining; Network packet; Network topology; Network security; Computer security; Computer network; The Internet; World Wide Web","score_opus":0.03477596642063015,"score_gpt":0.22891122672465408,"score_spread":0.19413526030402395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W757277879","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7573471,0.043150283,0.14640859,0.0041666343,0.0015565715,0.00034851884,0.0016414453,0.0030685368,0.042312413],"genre_scores_gemma":[0.95459884,0.0029053816,0.037289068,0.00031652916,0.00038457525,0.00005528435,0.0010286146,0.00032298983,0.0030987572],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98868865,0.0049532205,0.00066706596,0.0014726688,0.0033920566,0.000826324],"domain_scores_gemma":[0.78225064,0.20098202,0.0027085622,0.006108885,0.006929698,0.0010201414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013532537,0.0020689052,0.0018275689,0.005153009,0.0012476672,0.0027398812,0.0027980558,0.004247722,0.0041416036],"category_scores_gemma":[0.06034325,0.0005490114,0.0011189465,0.0025097881,0.0020566492,0.0062118242,0.0016840661,0.0016805297,0.0009328515],"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.011926564,0.0018071922,0.027272439,0.0019284816,0.0013549993,0.00026138168,0.0004427319,0.27223885,0.018200926,0.013644337,0.012605093,0.63831705],"study_design_scores_gemma":[0.0003547021,0.002297869,0.013709444,0.0002467643,0.0008561312,0.00046445683,0.00036904117,0.9440254,0.020579036,0.014845059,0.0021095772,0.00014252983],"about_ca_topic_score_codex":0.004657384,"about_ca_topic_score_gemma":0.003705997,"teacher_disagreement_score":0.013532537,"about_ca_system_score_codex":0.0022836549,"about_ca_system_score_gemma":0.00075920846,"threshold_uncertainty_score":0.071567714},"labels":[],"label_agreement":null},{"id":"W75824681","doi":"10.1007/978-3-642-33564-8_70","title":"Facial Expression Recognition Using Game Theory and Particle Swarm Optimization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Particle swarm optimization; Facial expression; Computer science; Novelty; Artificial intelligence; Pattern recognition (psychology); Scheme (mathematics); Facial expression recognition; Feature (linguistics); Expression (computer science); Wrinkle; Boundary (topology); Face (sociological concept); Computer vision; Texture (cosmology); Facial recognition system; Image (mathematics); Mathematics; Machine learning","score_opus":0.030323322999702258,"score_gpt":0.2552443857635676,"score_spread":0.22492106276386536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75824681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008571424,0.00013096978,0.988203,0.00008297411,0.000038633603,0.00004006653,0.000017545854,0.00014994582,0.0027654925],"genre_scores_gemma":[0.5529397,0.00029596247,0.4382128,0.000091624184,0.00004967284,0.000219681,0.000096835916,0.00010842998,0.007985201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996872,0.0001025782,0.000013735403,0.00006092855,0.000097020216,0.000038593596],"domain_scores_gemma":[0.9996586,0.00020889542,0.0000226099,0.000024433797,0.00006974003,0.000015708689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083183806,0.00075458933,0.0012947663,0.00048041996,0.00039021458,0.0011773233,0.0010185713,0.00087087095,0.0017573226],"category_scores_gemma":[0.0016008316,0.00050275517,0.0008821398,0.00048660015,0.0005380125,0.0008516946,0.00077967544,0.0008423381,0.000361844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007955894,0.00006930127,0.00060525106,0.00006250289,0.000071545466,0.000052127976,0.000067252164,0.85059327,0.0054551875,0.016360395,0.0014530494,0.12513052],"study_design_scores_gemma":[0.000002222455,0.000005858506,0.000049636237,0.0000015000842,0.0000025471072,0.000005227656,0.0000035856617,0.9981565,0.00023989186,0.0014373279,0.0000934421,0.000002174959],"about_ca_topic_score_codex":0.006334298,"about_ca_topic_score_gemma":0.004794639,"teacher_disagreement_score":0.006334298,"about_ca_system_score_codex":0.00074057904,"about_ca_system_score_gemma":0.00052244985,"threshold_uncertainty_score":0.012594879},"labels":[],"label_agreement":null},{"id":"W76241432","doi":"10.1007/978-3-642-39310-5_21","title":"Comparisons between Measures of Nondeterminism on Finite Automata","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Tree (set theory); Nondeterministic finite automaton; Computation; Automaton; Exponential function; Computer science; Function (biology); Finite-state machine; Deterministic finite automaton; Discrete mathematics; Tree automaton; Mathematics; Algorithm; Combinatorics; Automata theory; Theoretical computer science","score_opus":0.04331961617756693,"score_gpt":0.26054602926907344,"score_spread":0.2172264130915065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76241432","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.57722455,0.008799171,0.3457097,0.0030853227,0.00058188953,0.00011824893,0.0012042426,0.00045873836,0.06281815],"genre_scores_gemma":[0.9658233,0.0010288416,0.029228123,0.000125963,0.0003850942,0.00013256015,0.0004800871,0.000118178235,0.0026778472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98905677,0.004660816,0.0008664984,0.0017607627,0.0030398755,0.0006152838],"domain_scores_gemma":[0.8776561,0.10333478,0.0049485,0.006957123,0.004799097,0.0023042848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009776081,0.00082625565,0.0015317576,0.0050149453,0.0013737475,0.006861016,0.002183428,0.0020864636,0.0064650206],"category_scores_gemma":[0.06219976,0.0009640882,0.0011350791,0.0042499756,0.005111529,0.020116415,0.0030435058,0.0026568829,0.00039645348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002071216,0.000028898983,0.0016650785,0.0001200714,0.000044443797,0.00004580088,0.00048409245,0.0040071793,0.0008615918,0.97660214,0.0005716452,0.015362069],"study_design_scores_gemma":[0.000013772401,0.00007085663,0.0014046415,0.000049418653,0.000022335698,0.00009038214,0.00018319945,0.011447297,0.00070583256,0.9843853,0.0016045948,0.000022349548],"about_ca_topic_score_codex":0.0002869482,"about_ca_topic_score_gemma":0.00030111117,"teacher_disagreement_score":0.009776081,"about_ca_system_score_codex":0.0029968082,"about_ca_system_score_gemma":0.00077146816,"threshold_uncertainty_score":0.051701486},"labels":[],"label_agreement":null},{"id":"W7649915","doi":"10.1007/978-3-642-41083-3_21","title":"3D Surface Reconstruction of Organs Using Patient-Specific Shape Priors in Robot-Assisted Laparoscopic Surgery","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anatomy and Medical Technology","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Imaging phantom; Computer vision; Artificial intelligence; Context (archaeology); Modality (human–computer interaction); Computer science; Surface reconstruction; Iterative reconstruction; Medicine; Surface (topology); Radiology; Mathematics","score_opus":0.01759936157162326,"score_gpt":0.21333687872384544,"score_spread":0.19573751715222218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7649915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068814647,0.00078996894,0.99045205,0.00013350554,0.000040804778,0.000017631195,0.00011018079,0.00055411755,0.0010202776],"genre_scores_gemma":[0.2171137,0.003641954,0.77157223,0.00016913141,0.00008278091,0.00008259655,0.0009535265,0.00077087217,0.005613221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979013,0.00004630763,0.000012746543,0.00003649371,0.00009885558,0.00001556226],"domain_scores_gemma":[0.99969625,0.00015695242,0.000025478867,0.00006106522,0.00004774596,0.000012511159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050057366,0.00056244957,0.00064606074,0.00035716195,0.000112883885,0.001007717,0.00086618564,0.0010510138,0.0017127026],"category_scores_gemma":[0.0010574199,0.0010732275,0.0010311415,0.0006195251,0.00039685846,0.0008587353,0.0008928363,0.001221453,0.0009848718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015621551,0.00005752144,0.0006097948,0.00031794194,0.000076240816,0.00016949435,0.00014370758,0.58534366,0.041697655,0.011588055,0.006006192,0.35383347],"study_design_scores_gemma":[0.0000064528476,0.000028655302,0.0005122716,0.000025970205,0.000014755003,0.00029014482,0.00001643735,0.97951025,0.009699,0.006561855,0.0033101293,0.000023956198],"about_ca_topic_score_codex":0.00090608816,"about_ca_topic_score_gemma":0.0014471449,"teacher_disagreement_score":0.0017127026,"about_ca_system_score_codex":0.00023246108,"about_ca_system_score_gemma":0.00039331638,"threshold_uncertainty_score":0.005729556},"labels":[],"label_agreement":null},{"id":"W76527192","doi":"10.1007/978-3-642-33786-4_5","title":"Similarity Constrained Latent Support Vector Machine: An Application to Weakly Supervised Action Classification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Operationalization; Similarity (geometry); Support vector machine; Machine learning; Class (philosophy); Dual (grammatical number); Action (physics); Action recognition; Pattern recognition (psychology); Image (mathematics)","score_opus":0.04473991686502846,"score_gpt":0.28412129629351607,"score_spread":0.2393813794284876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76527192","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.0062448196,0.00024322535,0.991703,0.0000824834,0.000024176088,0.000027861506,0.000106422995,0.0011492401,0.00041888846],"genre_scores_gemma":[0.24803942,0.00050241884,0.74531555,0.00010258853,0.0001182273,0.00024559442,0.0010211313,0.00031284348,0.004342176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991002,0.0002425204,0.00007098131,0.00019947643,0.00032021882,0.000066552115],"domain_scores_gemma":[0.9978143,0.0012082668,0.00014642795,0.00033815933,0.00039517944,0.00009773283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097447,0.00072776846,0.0019043322,0.0010271854,0.00040955556,0.0011677297,0.0017938322,0.0012570507,0.0035886064],"category_scores_gemma":[0.005475438,0.0005218103,0.00084174634,0.0023427545,0.0007045332,0.0014915734,0.0021372105,0.0017576589,0.0017124629],"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.00026036543,0.00018498716,0.0011550153,0.00016526727,0.00006936893,0.00009390387,0.0001122872,0.062133808,0.009616045,0.011820705,0.0063783852,0.9080098],"study_design_scores_gemma":[0.000007754797,0.000025379222,0.00028421232,0.0000061823566,0.00000759844,0.000037577345,0.000015805277,0.9838128,0.0018278279,0.01308848,0.00087718,0.000009169822],"about_ca_topic_score_codex":0.0025626328,"about_ca_topic_score_gemma":0.003134806,"teacher_disagreement_score":0.0035886064,"about_ca_system_score_codex":0.00044469902,"about_ca_system_score_gemma":0.0008416489,"threshold_uncertainty_score":0.012005091},"labels":[],"label_agreement":null},{"id":"W76653589","doi":"10.1007/978-3-642-23822-2_1","title":"Secure Localization Using Dynamic Verifiers","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Indoor and Outdoor Localization Technologies","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":"University of Calgary","funders":"","keywords":"Collusion; Computer science; Protocol (science); Node (physics); Adversary; Position (finance); Computer security; Set (abstract data type); Security analysis; Computer network; Theoretical computer science","score_opus":0.012790920832332506,"score_gpt":0.2162632176952496,"score_spread":0.20347229686291707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76653589","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.011488669,0.000998317,0.97005534,0.0005295536,0.00023234866,0.000058140315,0.00010926549,0.0015941495,0.014934118],"genre_scores_gemma":[0.76801103,0.0031448544,0.18137448,0.0003346652,0.00038152107,0.00026089803,0.00048808058,0.00046064772,0.045543864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747366,0.0004022,0.0001330319,0.00047279286,0.0011175184,0.00040072444],"domain_scores_gemma":[0.99492764,0.0019798726,0.00033954537,0.0022895534,0.00038717434,0.00007626191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001975,0.001306689,0.00096807734,0.0012312586,0.0010436529,0.0028130785,0.0019044336,0.0020668595,0.008154425],"category_scores_gemma":[0.0050832387,0.0011345721,0.000733633,0.0011403353,0.002485409,0.007648577,0.0048939553,0.0038469522,0.0036959753],"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.00048233962,0.00007812456,0.00044812428,0.00034090652,0.000062568644,0.00034073065,0.0003373808,0.05990193,0.031132508,0.6284003,0.0061532124,0.27232194],"study_design_scores_gemma":[0.00016868443,0.00036721028,0.00035191927,0.00026814445,0.00013237246,0.001278103,0.00015099261,0.36815402,0.124401666,0.44459775,0.05999847,0.0001306197],"about_ca_topic_score_codex":0.00039366938,"about_ca_topic_score_gemma":0.00035337376,"teacher_disagreement_score":0.008154425,"about_ca_system_score_codex":0.0013090008,"about_ca_system_score_gemma":0.0009954604,"threshold_uncertainty_score":0.027279258},"labels":[],"label_agreement":null},{"id":"W76673372","doi":"10.1007/978-3-540-40052-3_7","title":"Knowledge Management Support for Distributed Agile Software Processes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":44,"is_retracted":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":"Agile software development; Computer science; Documentation; Lean software development; Knowledge management; Agile Unified Process; Software engineering; Software development; Agile usability engineering; Software; Software development process; Process management; Engineering","score_opus":0.02016312868111349,"score_gpt":0.27112435369498056,"score_spread":0.2509612250138671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76673372","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.20065835,0.00069347693,0.66228133,0.0024363454,0.000094604766,0.0001997263,0.00011596248,0.0031669082,0.13035324],"genre_scores_gemma":[0.86243385,0.0003807726,0.118725635,0.00009761485,0.000045228793,0.000086649474,0.00023786841,0.00012122037,0.017871086],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919707,0.00022459085,0.000047712838,0.000088751665,0.00033151667,0.00011038373],"domain_scores_gemma":[0.996599,0.0018147822,0.0002514145,0.0007924318,0.00036237002,0.0001800801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012110117,0.00029590633,0.00021633935,0.0005392372,0.00067643565,0.0026612657,0.0013949117,0.0008489928,0.0050445264],"category_scores_gemma":[0.0051792706,0.00023270701,0.0002497918,0.000622533,0.00038553917,0.0031245544,0.0019260278,0.0009591802,0.000991907],"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.00035092217,0.00068200205,0.0017517334,0.0003450338,0.000045814486,0.0009942353,0.008092173,0.015987871,0.023076426,0.10761741,0.010492544,0.8305639],"study_design_scores_gemma":[0.00042046412,0.0006223309,0.0056757685,0.000637863,0.00020516836,0.00176489,0.005447558,0.34000176,0.055380832,0.366005,0.22371632,0.000122053774],"about_ca_topic_score_codex":0.0008527771,"about_ca_topic_score_gemma":0.0012697375,"teacher_disagreement_score":0.0050445264,"about_ca_system_score_codex":0.00040782828,"about_ca_system_score_gemma":0.0010104352,"threshold_uncertainty_score":0.016875625},"labels":[],"label_agreement":null},{"id":"W7692735","doi":"10.1007/978-3-319-08786-3_16","title":"Te,Te,Hi,Hi: Eye Gaze Sequence Analysis for Informing User-Adaptive Information Visualizations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; Human–computer interaction; Gaze; Task (project management); Information visualization; Eye tracking; Sequence (biology); User interface; Data visualization; Perception; Artificial intelligence; Information retrieval; Programming language","score_opus":0.030542549745933834,"score_gpt":0.30622899857993097,"score_spread":0.2756864488339971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7692735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014681489,0.0035424863,0.95483375,0.0006695065,0.0005472238,0.000113958755,0.0015813597,0.016507039,0.0075232475],"genre_scores_gemma":[0.17644753,0.003647416,0.78650874,0.00023711124,0.00025406393,0.00027252844,0.0030752544,0.0032294383,0.026327856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978894,0.00004966808,0.000011124273,0.000047648762,0.000084626314,0.000018034501],"domain_scores_gemma":[0.999318,0.00035079505,0.000037751408,0.00007603845,0.00017699391,0.000040388488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061377394,0.0008696661,0.0004247781,0.0013957708,0.00024980944,0.0012411346,0.0006814198,0.0007183077,0.012914162],"category_scores_gemma":[0.003049271,0.00035981036,0.0003432905,0.0015282438,0.00024220282,0.0019593001,0.0011618364,0.00090384367,0.0049592676],"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.00019541432,0.000042187097,0.0010849588,0.00041312832,0.000050099945,0.00009464176,0.00040148877,0.0029637923,0.039075058,0.005955278,0.060990125,0.88873386],"study_design_scores_gemma":[0.000082527826,0.0002943775,0.01735079,0.000434217,0.00025298542,0.0012869623,0.0007956802,0.53365296,0.18169434,0.056714207,0.20719555,0.000245474],"about_ca_topic_score_codex":0.0012863887,"about_ca_topic_score_gemma":0.0018268889,"teacher_disagreement_score":0.012914162,"about_ca_system_score_codex":0.00019589256,"about_ca_system_score_gemma":0.00031624598,"threshold_uncertainty_score":0.04320216},"labels":[],"label_agreement":null},{"id":"W771238818","doi":"10.1007/978-3-319-16631-5_24","title":"Towards Efficient Feedback Control in Streaming Computer Vision Pipelines","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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 Ontario Institute of Technology","funders":"","keywords":"Computer science; Pipeline transport; Multimedia; Control (management); Human–computer interaction; Feedback control; Computer graphics (images); Computer vision; Artificial intelligence; Control engineering","score_opus":0.018378467116258023,"score_gpt":0.28725059205504605,"score_spread":0.26887212493878804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W771238818","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.011677373,0.0005548334,0.9845243,0.00015707673,0.0000630307,0.000031638556,0.00004029819,0.0010921936,0.0018592948],"genre_scores_gemma":[0.6211787,0.0010347636,0.36530682,0.00017331798,0.00013386949,0.000120724115,0.00019196648,0.00026878185,0.01159111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997547,0.000031103256,0.000012349012,0.000047846803,0.00011641314,0.00003749226],"domain_scores_gemma":[0.99953496,0.00023082193,0.000037444894,0.000057927467,0.00010994663,0.000028924635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053353165,0.00067838986,0.00066714885,0.00029766883,0.000393025,0.0008942334,0.0011761922,0.00076029013,0.0045513324],"category_scores_gemma":[0.0016783056,0.0004090405,0.00026525787,0.00041906128,0.0005024581,0.0011468645,0.0011697364,0.0012737863,0.00071944896],"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.00042042314,0.00015917701,0.00034480906,0.00040420785,0.000049945556,0.00012469794,0.0002601676,0.3145636,0.14171611,0.058715105,0.008681563,0.4745602],"study_design_scores_gemma":[0.000014928276,0.00005538472,0.00008595178,0.000012160817,0.0000061857722,0.000026753632,0.000012212233,0.97435445,0.011940931,0.011198435,0.0022838563,0.000008750742],"about_ca_topic_score_codex":0.0035644004,"about_ca_topic_score_gemma":0.0038151355,"teacher_disagreement_score":0.0045513324,"about_ca_system_score_codex":0.0007230438,"about_ca_system_score_gemma":0.0007001907,"threshold_uncertainty_score":0.0152257085},"labels":[],"label_agreement":null},{"id":"W77161","doi":"10.1007/978-3-540-24651-0_30","title":"Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":154,"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 à Montréal; Université du Québec en Outaouais; Université de Montréal","funders":"","keywords":"Computer science; Formal concept analysis; Knowledge extraction; Association rule learning; Data mining; Raw data; Closure (psychology); Field (mathematics); Process (computing); Data science; Set (abstract data type); Variety (cybernetics); Business process discovery; Focus (optics); Artificial intelligence; Work in process; Algorithm; Engineering; Mathematics","score_opus":0.06503788874598672,"score_gpt":0.2898044529152008,"score_spread":0.2247665641692141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77161","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.0029995267,0.117041714,0.8361719,0.033145808,0.0014061005,0.000115752664,0.0004231158,0.00038405875,0.008311967],"genre_scores_gemma":[0.08750093,0.08317536,0.8131683,0.004320166,0.0057025943,0.00050762173,0.0011231329,0.0002369443,0.0042649955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882953,0.0057242992,0.00087186636,0.00089579617,0.003971775,0.00024104612],"domain_scores_gemma":[0.9555661,0.03700875,0.0010292514,0.0033522604,0.002411797,0.00063195743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020519137,0.0015729759,0.004450794,0.0046497975,0.0014051461,0.013373294,0.0050934497,0.0032151851,0.0046759844],"category_scores_gemma":[0.03187035,0.0011063367,0.0020565435,0.006948897,0.01520864,0.028384982,0.0046677846,0.008135322,0.0020112589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028158487,0.000076609394,0.00026213343,0.0010808927,0.00010108496,0.000054654432,0.0005175966,0.002191408,0.0002301946,0.8761568,0.014345951,0.1049546],"study_design_scores_gemma":[0.000007382745,0.000007968245,0.000039071223,0.0001315239,0.000007718428,0.00003446985,0.00012321757,0.004154282,0.00006550741,0.9820128,0.013403596,0.000012420771],"about_ca_topic_score_codex":0.0016573344,"about_ca_topic_score_gemma":0.0011984531,"teacher_disagreement_score":0.020519137,"about_ca_system_score_codex":0.003174677,"about_ca_system_score_gemma":0.0043087984,"threshold_uncertainty_score":0.10851687},"labels":[],"label_agreement":null},{"id":"W772046056","doi":"10.1007/978-3-662-48350-3_41","title":"Approximate Deadline-Scheduling with Precedence Constraints","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Job shop scheduling; Annals; Set (abstract data type); Mathematics; Programming language; Operating system","score_opus":0.020394805961642278,"score_gpt":0.23459742814829926,"score_spread":0.21420262218665698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W772046056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061272057,0.0033636459,0.9813362,0.00024001187,0.00044451986,0.000036080477,0.00013680683,0.00044521777,0.00787032],"genre_scores_gemma":[0.30582547,0.006011079,0.66849077,0.00020729276,0.000641706,0.00016981071,0.0008238631,0.00052037486,0.017309623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.00015298525,0.000035132416,0.00008605214,0.00026366505,0.000057491983],"domain_scores_gemma":[0.99925655,0.0003743113,0.000050920626,0.00015866048,0.00012215618,0.00003749542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007855065,0.0009737654,0.0011453894,0.0005635303,0.00039812617,0.0009545338,0.0014706946,0.0005480319,0.0042062085],"category_scores_gemma":[0.0037229324,0.0005719439,0.0005206984,0.0018034539,0.00037401004,0.0014529368,0.0008847559,0.0014533665,0.0010772655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029798778,0.00006424847,0.00017753364,0.00038688848,0.00004622699,0.00006349686,0.00005507178,0.5756885,0.0038323046,0.073251076,0.011227133,0.33490947],"study_design_scores_gemma":[0.000031033996,0.000053987947,0.00013120365,0.000031349784,0.000017711718,0.00009787904,0.000018545814,0.90626645,0.0021773665,0.07658129,0.014581147,0.000011993803],"about_ca_topic_score_codex":0.0016779181,"about_ca_topic_score_gemma":0.0015240461,"teacher_disagreement_score":0.0042062085,"about_ca_system_score_codex":0.0010880998,"about_ca_system_score_gemma":0.0010100218,"threshold_uncertainty_score":0.0140711665},"labels":[],"label_agreement":null},{"id":"W77603087","doi":"10.1007/978-3-642-24908-2_10","title":"Towards RIF-OWL Combination: An Effective Reasoning Technique in Integrating OWL and Negation-Free Rules","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Semantic reasoner; Computer science; Negation; Description logic; Focus (optics); Semantics (computer science); Knowledge base; Non-monotonic logic; Programming language; Artificial intelligence; Circumscription; Web Ontology Language; Theoretical computer science; Horn clause; Logic programming; Semantic Web","score_opus":0.014074822083270284,"score_gpt":0.24921493504529707,"score_spread":0.23514011296202678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77603087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014669282,0.00025234433,0.99466765,0.00011525004,0.000068139496,0.00006609183,0.000068773865,0.0013534741,0.0019414118],"genre_scores_gemma":[0.016143627,0.00019498008,0.9807153,0.00016387588,0.000052746866,0.00007437755,0.0003778391,0.00036777044,0.00190958],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928468,0.002276031,0.00059586595,0.0010872984,0.0029438122,0.00025039222],"domain_scores_gemma":[0.99444336,0.002942675,0.00022130182,0.0012065023,0.0010308647,0.00015523836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072771832,0.0014069357,0.0016185266,0.0031083745,0.001284176,0.0042548436,0.0045532817,0.0017239306,0.0067841974],"category_scores_gemma":[0.010201825,0.0015014574,0.0028081883,0.0026036694,0.0012653255,0.008926499,0.0047276462,0.0049802465,0.0037600533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003306541,0.0003835975,0.000853421,0.0010554175,0.00046272148,0.00083641097,0.0010017625,0.013417724,0.024535956,0.09653187,0.018691573,0.841899],"study_design_scores_gemma":[0.00017363527,0.00019110192,0.00063702645,0.00041394585,0.00075319747,0.002091466,0.00047040152,0.49458787,0.08603976,0.27940688,0.13503644,0.0001983117],"about_ca_topic_score_codex":0.0015565271,"about_ca_topic_score_gemma":0.002835307,"teacher_disagreement_score":0.0072771832,"about_ca_system_score_codex":0.00061831047,"about_ca_system_score_gemma":0.0014577924,"threshold_uncertainty_score":0.038485825},"labels":[],"label_agreement":null},{"id":"W77757448","doi":"10.1007/11779148_17","title":"Characterizing DNA Bond Shapes Using Trajectories","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Acadia University","funders":"","keywords":"Decidability; Set (abstract data type); Computer science; DNA computing; Extension (predicate logic); Bond; Rotation (mathematics); Algorithm; Theoretical computer science; Artificial intelligence; Programming language; Computation","score_opus":0.019624642936291087,"score_gpt":0.24656503449636066,"score_spread":0.22694039156006957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77757448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31084105,0.00044413176,0.680183,0.00015251809,0.000037122452,0.000120706056,0.0014126484,0.0023101089,0.004498689],"genre_scores_gemma":[0.83247775,0.0005507756,0.16238493,0.000030768468,0.000020821091,0.00012274181,0.0013924734,0.00036877557,0.0026509739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997873,0.000038093905,0.000012676836,0.00007363607,0.00006997794,0.000018431747],"domain_scores_gemma":[0.9983687,0.0008661725,0.00025802155,0.00023671496,0.00015779748,0.00011258408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038212724,0.00081924605,0.00057447917,0.001969164,0.0004895866,0.00096788973,0.00103511,0.0009958668,0.0028549428],"category_scores_gemma":[0.0032841724,0.00055518904,0.0005285426,0.0020330448,0.0007486031,0.0021311399,0.0008425962,0.000782895,0.00074967754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005402753,0.00017367824,0.018905485,0.00034548936,0.0001170409,0.0003547614,0.00035372152,0.64324737,0.09675708,0.04486601,0.0023354732,0.19200365],"study_design_scores_gemma":[0.0000064965975,0.000032109205,0.00094953924,0.000008173457,0.000007668855,0.0000713966,0.00003528397,0.973697,0.008958305,0.0155441025,0.0006725255,0.000017421033],"about_ca_topic_score_codex":0.0019158716,"about_ca_topic_score_gemma":0.0021640717,"teacher_disagreement_score":0.0028549428,"about_ca_system_score_codex":0.0005602463,"about_ca_system_score_gemma":0.0003769989,"threshold_uncertainty_score":0.00955075},"labels":[],"label_agreement":null},{"id":"W77809133","doi":"10.1007/978-3-642-32355-3_11","title":"On the Safety of Electronic Medical Records","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Electronic Health Records Systems","field":"Health Professions","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 Victoria","funders":"","keywords":"Computer science","score_opus":0.039000235607901806,"score_gpt":0.3696386480870721,"score_spread":0.33063841247917025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77809133","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063586696,0.10423204,0.050478198,0.07965558,0.006528115,0.000097332464,0.00028097365,0.00021603152,0.752153],"genre_scores_gemma":[0.17655432,0.26273075,0.03497766,0.02502801,0.012245097,0.00014569411,0.0008109419,0.00029457023,0.487213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941316,0.0019764735,0.00026040047,0.00025148346,0.0030519422,0.00032804447],"domain_scores_gemma":[0.98558724,0.009587493,0.00065143756,0.0010045785,0.0029393132,0.00022992925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041384483,0.0006268955,0.00044392693,0.0024564106,0.0012366322,0.0037427598,0.001501023,0.0034322338,0.017830474],"category_scores_gemma":[0.016169166,0.00030899962,0.0005008994,0.0019104168,0.0032264767,0.0066327443,0.0029881871,0.003734437,0.0052940696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050624494,0.00007143775,0.000661922,0.00042739543,0.000022296466,0.00023744145,0.0009902042,0.0014452777,0.00067528046,0.44207475,0.12736396,0.42597944],"study_design_scores_gemma":[0.000010884459,0.00009542678,0.0011457545,0.0023538137,0.000021977106,0.0004386602,0.00082853925,0.001375653,0.0013477736,0.30194053,0.6904087,0.000032228832],"about_ca_topic_score_codex":0.0028322227,"about_ca_topic_score_gemma":0.0025537251,"teacher_disagreement_score":0.017830474,"about_ca_system_score_codex":0.0015965962,"about_ca_system_score_gemma":0.0025056931,"threshold_uncertainty_score":0.05964881},"labels":[],"label_agreement":null},{"id":"W77811481","doi":"10.1007/3-540-40011-7_7","title":"Heaven or Hell? A “Real-Time” UML?","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","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":"JDA Software (Canada)","funders":"","keywords":"Computer science; Heaven; Unified Modeling Language; Programming language; Computer graphics (images); Real-time computing; Art; Literature; Software","score_opus":0.013914093103288165,"score_gpt":0.23794500765242702,"score_spread":0.22403091454913884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77811481","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.006939453,0.0040216222,0.80359435,0.07225874,0.0044474825,0.000057648682,0.00016240853,0.0041234246,0.10439486],"genre_scores_gemma":[0.29929066,0.0057630525,0.55838734,0.017791733,0.0023110155,0.00023804535,0.00052068586,0.0035747827,0.112122744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670166,0.0019105457,0.00016789377,0.00033657157,0.00068884774,0.00019449253],"domain_scores_gemma":[0.99560404,0.0018786517,0.000194394,0.0014431231,0.0005757689,0.00030402816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053694528,0.0007052033,0.00049395143,0.0006012429,0.001022566,0.0067944448,0.0016745372,0.0025099218,0.010959897],"category_scores_gemma":[0.013644765,0.0007598378,0.00078385096,0.00057193247,0.0057800054,0.025451684,0.002741243,0.004646938,0.004307334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027413604,0.000015734307,0.00010022622,0.000054646145,0.0000061068463,0.00003772697,0.001213637,0.0005581945,0.0007325093,0.9292124,0.021315128,0.046726234],"study_design_scores_gemma":[0.000019542917,0.00003062663,0.00007307298,0.00018624622,0.00001534067,0.00016534208,0.0006469896,0.005328078,0.0012982789,0.5813522,0.41085356,0.000030719064],"about_ca_topic_score_codex":0.0019844756,"about_ca_topic_score_gemma":0.0017738964,"teacher_disagreement_score":0.010959897,"about_ca_system_score_codex":0.0015046978,"about_ca_system_score_gemma":0.0012927941,"threshold_uncertainty_score":0.036664486},"labels":[],"label_agreement":null},{"id":"W779556307","doi":"10.1007/978-3-319-19225-3_18","title":"Quasi-Distances and Weighted Finite Automata","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science","score_opus":0.01961018906781621,"score_gpt":0.24542673802829337,"score_spread":0.22581654896047715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W779556307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097156204,0.018699238,0.7290912,0.0029644934,0.0020944644,0.00007057959,0.0005069856,0.0004333154,0.14898352],"genre_scores_gemma":[0.72574604,0.0105057815,0.16434807,0.00085639814,0.0019481636,0.00032597283,0.00075638015,0.00043185495,0.095081426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991748,0.00022388485,0.00007161757,0.00020122781,0.00026304994,0.0000655106],"domain_scores_gemma":[0.9988306,0.0006735946,0.000089438145,0.00015529967,0.00017558363,0.000075425014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068185345,0.0006691489,0.00075569795,0.0013031928,0.0010927311,0.0022168958,0.0011288379,0.0008713491,0.007332473],"category_scores_gemma":[0.0025145486,0.0005082638,0.0007010357,0.001974008,0.0023071482,0.006217715,0.0015433413,0.0023536494,0.0010672442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009552556,0.0000051833076,0.00004424072,0.00004225285,0.0000046069385,0.000016071775,0.00007830074,0.00090162887,0.00047220985,0.9873706,0.000813916,0.010241329],"study_design_scores_gemma":[0.0000020282298,0.0000060106327,0.000041664603,0.000010180996,0.000003116771,0.000030048923,0.000026105938,0.0017531076,0.0001673233,0.9923408,0.005615206,0.0000044637086],"about_ca_topic_score_codex":0.0007007175,"about_ca_topic_score_gemma":0.00075507525,"teacher_disagreement_score":0.007332473,"about_ca_system_score_codex":0.0014267531,"about_ca_system_score_gemma":0.00046376302,"threshold_uncertainty_score":0.024529576},"labels":[],"label_agreement":null},{"id":"W77968930","doi":"10.1007/978-3-642-39470-6_4","title":"PhonAge: Adapted SmartPhone for Aging Population","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition Systems","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":"Bishop's University; Université de Sherbrooke","funders":"","keywords":"Computer science; Human–computer interaction","score_opus":0.029017486609838574,"score_gpt":0.2550801597685381,"score_spread":0.22606267315869952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77968930","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.41128987,0.020111656,0.24389507,0.0036036414,0.004498947,0.0021642644,0.06740051,0.14828669,0.09874932],"genre_scores_gemma":[0.7689235,0.0074584703,0.10213994,0.004004025,0.0010695095,0.0016315525,0.020358233,0.002971336,0.091443375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998895,0.000019778003,0.000009383935,0.000032029962,0.000031417818,0.000017842838],"domain_scores_gemma":[0.999811,0.00004028344,0.0000125778115,0.000023212437,0.000079207864,0.00003359663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017497309,0.00081013987,0.00057087775,0.0004666312,0.00012235822,0.0004165066,0.00049612176,0.000629981,0.020660331],"category_scores_gemma":[0.00079337176,0.00014359891,0.0002816858,0.00031500356,0.00006565738,0.0004946023,0.0007543866,0.0003271767,0.007462434],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017073283,0.00030528335,0.017097421,0.0010450999,0.00012650083,0.0009161414,0.00044836468,0.0008956669,0.03557872,0.000495425,0.17652921,0.76485485],"study_design_scores_gemma":[0.0012537789,0.004019718,0.28791407,0.0009566297,0.0017584661,0.01370269,0.0017664736,0.05158655,0.063846596,0.0050871186,0.5675425,0.0005654227],"about_ca_topic_score_codex":0.0011004857,"about_ca_topic_score_gemma":0.0024661876,"teacher_disagreement_score":0.020660331,"about_ca_system_score_codex":0.00008464371,"about_ca_system_score_gemma":0.00016202989,"threshold_uncertainty_score":0.0691157},"labels":[],"label_agreement":null},{"id":"W78020569","doi":"10.1007/978-3-642-35428-1_10","title":"Towards Improving the Accuracy of Sensorless Freehand 3D Ultrasound by Learning","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Flow Measurement and Analysis","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Decorrelation; Speckle pattern; Computer science; Computer vision; Artificial intelligence; Position (finance); Motion (physics); Orientation (vector space); Plane (geometry); Mathematics","score_opus":0.013066942215537159,"score_gpt":0.20961189827050858,"score_spread":0.1965449560549714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78020569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076284213,0.00059302367,0.9873197,0.00011029166,0.000060578408,0.00002048617,0.000066110864,0.0023715585,0.0018297815],"genre_scores_gemma":[0.17664024,0.0011371794,0.813025,0.00034438132,0.00011103579,0.000050184397,0.00045988878,0.00067778665,0.0075543406],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99786323,0.00027575405,0.00008372229,0.00035980996,0.0013025433,0.00011494208],"domain_scores_gemma":[0.9944676,0.0029676745,0.00028608897,0.0009838085,0.001196129,0.00009866813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017730151,0.0012595664,0.0010687114,0.0007804218,0.0002816925,0.0015662719,0.0024724773,0.0020320641,0.0060592415],"category_scores_gemma":[0.0075584683,0.00092088286,0.00065980956,0.00076485594,0.0008064344,0.002539643,0.0021153751,0.0018908125,0.0035590052],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026451034,0.000103967635,0.00094774045,0.0002876344,0.00006924172,0.000036766603,0.00016449185,0.047655933,0.15268703,0.0040533296,0.0034675405,0.7902619],"study_design_scores_gemma":[0.000028992712,0.00023857183,0.0019749189,0.000078426325,0.00006372174,0.0003049111,0.000043379503,0.81085193,0.17072174,0.0047206553,0.010900949,0.000071808856],"about_ca_topic_score_codex":0.0026736723,"about_ca_topic_score_gemma":0.0035638534,"teacher_disagreement_score":0.0060592415,"about_ca_system_score_codex":0.0005442226,"about_ca_system_score_gemma":0.0008035019,"threshold_uncertainty_score":0.020270169},"labels":[],"label_agreement":null},{"id":"W780278042","doi":"10.1007/978-3-319-10593-2_53","title":"Automatic Single-View Calibration and Rectification from Parallel Planar Curves","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Image rectification; Vanishing point; Rectification; Parallel; Tangent; Projection (relational algebra); Camera resectioning; Planar; Image (mathematics); Artificial intelligence; Point (geometry); Plane (geometry); Generalization; Computer vision; Mathematics; Calibration; Computer science; Geometry; Algorithm; Computer graphics (images); Mathematical analysis; Physics","score_opus":0.023588371130557458,"score_gpt":0.256407321429955,"score_spread":0.23281895029939753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W780278042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012061041,0.0005068869,0.98064375,0.00010374169,0.00009046156,0.00004985277,0.00016986439,0.0031418204,0.0032325506],"genre_scores_gemma":[0.16997106,0.0010271282,0.8199582,0.00009673222,0.000070604496,0.00008135755,0.00083342637,0.0012241908,0.0067372886],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985499,0.000115067916,0.0000469882,0.00047760212,0.000677961,0.0001324565],"domain_scores_gemma":[0.9989649,0.00014381744,0.00008602634,0.0004868772,0.0002736807,0.000044779692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876633,0.0015498807,0.0017592475,0.0018091344,0.00063510437,0.002097599,0.0022212362,0.0021263822,0.007402026],"category_scores_gemma":[0.0027037556,0.0014003497,0.001319264,0.0028293205,0.0006366085,0.0029177803,0.0031640353,0.002568827,0.005235264],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002069584,0.000049353985,0.0006330584,0.000310125,0.00008010942,0.00016466287,0.00022588887,0.014284728,0.1407924,0.0064592585,0.008358205,0.8284352],"study_design_scores_gemma":[0.00008904093,0.00026757317,0.006401975,0.00016537092,0.000175975,0.0037494584,0.00039827623,0.55608124,0.34432456,0.025234872,0.062910326,0.00020136496],"about_ca_topic_score_codex":0.0015279832,"about_ca_topic_score_gemma":0.0019716695,"teacher_disagreement_score":0.007402026,"about_ca_system_score_codex":0.00046393127,"about_ca_system_score_gemma":0.0009907425,"threshold_uncertainty_score":0.024762273},"labels":[],"label_agreement":null},{"id":"W78107666","doi":"10.1007/978-3-642-01680-6_2","title":"Decision Processes for Trustworthy Software","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering 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 Calgary","funders":"","keywords":"Transparency (behavior); Computer science; Trustworthiness; Software; Decision support system; Key (lock); Management science; Empirical research; Software engineering; Knowledge management; Process management; Data mining; Engineering; Computer security","score_opus":0.018302708062149838,"score_gpt":0.2726176058727606,"score_spread":0.2543148978106108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78107666","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.0054414338,0.0009641626,0.97787946,0.00084349373,0.00011289561,0.000102719125,0.000040225925,0.00016206302,0.014453567],"genre_scores_gemma":[0.3313727,0.0020472615,0.64536935,0.00030637253,0.00030615125,0.00055897265,0.00021436145,0.0001993124,0.019625567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99292314,0.00279968,0.00057622895,0.00081331044,0.0024463888,0.00044123447],"domain_scores_gemma":[0.9889818,0.008201616,0.0005721044,0.0012314867,0.0007826872,0.00023021191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065661683,0.0012483716,0.0011892477,0.0011649445,0.0012216845,0.0043153805,0.001829258,0.0022237326,0.009119672],"category_scores_gemma":[0.020697562,0.00095059595,0.0016851905,0.0015117811,0.0037303467,0.005561854,0.0030301085,0.0047106766,0.001723069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046850804,0.000035115678,0.00013478247,0.0001647639,0.00003345665,0.000062891755,0.00037993403,0.020283528,0.0006165297,0.92030513,0.0014804689,0.05645661],"study_design_scores_gemma":[0.000015727868,0.000024692494,0.000046351885,0.000051101375,0.0000129471055,0.00002674972,0.000046159377,0.068908155,0.0005150802,0.9262377,0.0041037463,0.0000115744415],"about_ca_topic_score_codex":0.0015010507,"about_ca_topic_score_gemma":0.0011624375,"teacher_disagreement_score":0.009119672,"about_ca_system_score_codex":0.0022161207,"about_ca_system_score_gemma":0.0024554536,"threshold_uncertainty_score":0.034725606},"labels":[],"label_agreement":null},{"id":"W78294240","doi":"10.1007/978-3-642-24500-8_59","title":"RTFX: On-Set Previs with UnrealEngine3","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Human Motion and Animation","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer graphics (images); Animation; Rendering (computer graphics); Game engine; Motion capture; EPIC; Computer animation; Software; Computer vision; Artificial intelligence; Motion (physics); Multimedia; Operating system","score_opus":0.020817475454497372,"score_gpt":0.21350910473566156,"score_spread":0.19269162928116418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78294240","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008724924,0.0006025453,0.4356811,0.00025925072,0.0007728464,0.00036991722,0.0064644874,0.45753348,0.089591466],"genre_scores_gemma":[0.2382405,0.00087144645,0.43701926,0.00094546424,0.00020703695,0.0008471046,0.027477182,0.15105163,0.14334045],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932444,0.000065083346,0.000037477163,0.00011146609,0.0003334453,0.00012807651],"domain_scores_gemma":[0.9995671,0.0001490146,0.000018992549,0.000110929235,0.00008681125,0.000067104804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085644115,0.002194334,0.001277104,0.0009960961,0.0005884579,0.0019405725,0.0041133445,0.0015220447,0.17832406],"category_scores_gemma":[0.0018793858,0.0012525426,0.0014898933,0.00061505346,0.0006490168,0.0016106992,0.0024623454,0.0018338653,0.039371595],"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.0031907142,0.00039212895,0.0009175949,0.0010645805,0.0002576989,0.00054736686,0.00047987126,0.034723822,0.0296265,0.037630077,0.44055519,0.45061454],"study_design_scores_gemma":[0.0018529271,0.0004927873,0.0008418645,0.0003358883,0.00015592575,0.00073962414,0.00016120017,0.42464724,0.083712906,0.038662832,0.44810408,0.00029266847],"about_ca_topic_score_codex":0.0058141076,"about_ca_topic_score_gemma":0.0069673904,"teacher_disagreement_score":0.17832406,"about_ca_system_score_codex":0.0008566223,"about_ca_system_score_gemma":0.0008513827,"threshold_uncertainty_score":0.59655344},"labels":[],"label_agreement":null},{"id":"W78374920","doi":"10.1007/978-3-319-11203-9_7","title":"Verifiable Delegation of Computations with Storage-Verification Trade-off","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Verifiable secret sharing; Delegation; Computation; Parallel computing; Operating system; Theoretical computer science; Programming language","score_opus":0.011283028827802483,"score_gpt":0.22348491436792617,"score_spread":0.21220188554012367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78374920","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.036841836,0.00079703704,0.93825704,0.001928735,0.00041104396,0.00022511111,0.00023350597,0.0033634913,0.017942196],"genre_scores_gemma":[0.8632342,0.00042596858,0.11488318,0.000465218,0.00040307362,0.0003760456,0.0002876119,0.0008462854,0.019078499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98509383,0.0041914424,0.0009208605,0.0022998934,0.0049232636,0.00257074],"domain_scores_gemma":[0.9450188,0.022064047,0.001506464,0.028623031,0.0019638478,0.0008238234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009723722,0.0014710026,0.0025041467,0.00083382835,0.0022568237,0.0062272535,0.0047708754,0.004106533,0.011378266],"category_scores_gemma":[0.036727015,0.0016230288,0.002138825,0.0015165637,0.0058062496,0.015778726,0.011816918,0.008012979,0.0033710438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018498636,0.0002928005,0.0007333957,0.0004439349,0.00012864076,0.00036496023,0.00055931567,0.052204423,0.015281712,0.794909,0.008730546,0.12450149],"study_design_scores_gemma":[0.00015255422,0.000107086846,0.00019680288,0.00007906963,0.000075336604,0.00021029347,0.0000484774,0.19321205,0.025227293,0.77512425,0.0055085695,0.0000581192],"about_ca_topic_score_codex":0.0006169101,"about_ca_topic_score_gemma":0.0006964198,"teacher_disagreement_score":0.011378266,"about_ca_system_score_codex":0.0033002603,"about_ca_system_score_gemma":0.003768243,"threshold_uncertainty_score":0.051424563},"labels":[],"label_agreement":null},{"id":"W78545424","doi":"10.1007/978-3-642-24500-8_46","title":"Designing a Wearable Vibrotactile Feedforward Wrist Display for Novice Gameplay","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Virtual Reality Applications and Impacts","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Haptic technology; Human–computer interaction; Wearable computer; Feed forward; Computer science; Video game; Multimedia; Simulation; Engineering","score_opus":0.028875319430891704,"score_gpt":0.26805017826900723,"score_spread":0.23917485883811554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78545424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11062163,0.0006132259,0.8758707,0.00017342204,0.00026327473,0.00026047463,0.00026715104,0.0034697212,0.0084602665],"genre_scores_gemma":[0.61836886,0.00058792747,0.34264642,0.0003705847,0.000096994765,0.00032664728,0.00035527052,0.0005710389,0.036676142],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997478,0.000035161876,0.000014663733,0.00006879236,0.00009192872,0.000041694722],"domain_scores_gemma":[0.9997136,0.00010611825,0.000015728983,0.000025402422,0.00008862209,0.000050513932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034922812,0.00079449534,0.00055245287,0.0003697544,0.00034195784,0.0008698787,0.0016866167,0.00091211864,0.013663408],"category_scores_gemma":[0.00067185547,0.00045960024,0.00045481967,0.00020882038,0.00019787227,0.00075793767,0.0010584465,0.0005519389,0.0021011773],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071089715,0.00028307768,0.0016507868,0.0006365808,0.0000871372,0.00087547564,0.00058208394,0.0018675547,0.79251015,0.0018241241,0.0055416683,0.19343054],"study_design_scores_gemma":[0.00055116,0.0077004377,0.026032215,0.00048607332,0.0006426818,0.012074338,0.0009906443,0.15448949,0.6912665,0.0022941874,0.103132464,0.00033984915],"about_ca_topic_score_codex":0.0004918522,"about_ca_topic_score_gemma":0.0008399228,"teacher_disagreement_score":0.013663408,"about_ca_system_score_codex":0.00015723133,"about_ca_system_score_gemma":0.00020616422,"threshold_uncertainty_score":0.045708656},"labels":[],"label_agreement":null},{"id":"W785500667","doi":"10.1007/978-3-319-18681-8_11","title":"Formal Enforcement of Security Policies on Parallel Systems with Risk Integration","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enforcement; Process calculus; Security policy; Android (operating system); Computer security; Communicating sequential processes; Computer security model; Programming language; Process (computing); Syntax; Security controls; Theoretical computer science; Control (management); Semantics (computer science); Operating system; Artificial intelligence; Operational semantics; Political science","score_opus":0.017794291400092904,"score_gpt":0.26099335478545055,"score_spread":0.24319906338535766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W785500667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013136657,0.00012708658,0.9796592,0.00035296276,0.00005652032,0.00009357782,0.00005078179,0.0011085317,0.005414625],"genre_scores_gemma":[0.55964327,0.00037104962,0.4310065,0.00020656749,0.00016779298,0.00028064576,0.00018659362,0.00047737133,0.007660158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944628,0.0017767412,0.00055572536,0.0005998698,0.0019661183,0.00063864153],"domain_scores_gemma":[0.9879167,0.006628198,0.0009576197,0.0029940633,0.0012699958,0.0002334941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005857736,0.0009378274,0.0008381975,0.0009226891,0.0010383738,0.004188665,0.0021833105,0.0013946693,0.003236597],"category_scores_gemma":[0.015412768,0.0011255549,0.0018615483,0.00083202316,0.0038622275,0.004597192,0.003486723,0.004435961,0.0005952408],"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.00013714813,0.00011255234,0.0006579812,0.00020439924,0.000065713335,0.00023762294,0.00047116564,0.1665906,0.0053638737,0.7738363,0.0016574239,0.050665226],"study_design_scores_gemma":[0.000059954305,0.000043692333,0.00012983901,0.000073083844,0.000059449285,0.000080419995,0.00005419825,0.47085592,0.005984023,0.5163311,0.0062989183,0.000029346009],"about_ca_topic_score_codex":0.002685536,"about_ca_topic_score_gemma":0.0029494308,"teacher_disagreement_score":0.005857736,"about_ca_system_score_codex":0.0019328238,"about_ca_system_score_gemma":0.002765182,"threshold_uncertainty_score":0.030979037},"labels":[],"label_agreement":null},{"id":"W78606972","doi":"10.1007/978-3-642-40627-0_23","title":"Solving Weighted CSPs by Successive Relaxations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tuple; Solver; Relaxation (psychology); Mathematical optimization; Mathematics; Set (abstract data type); Algorithm; Integer programming; Maximum satisfiability problem; Discrete mathematics; Computer science; Combinatorics","score_opus":0.008754078167863891,"score_gpt":0.22103550097618344,"score_spread":0.21228142280831955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78606972","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.0052123796,0.00022913823,0.98467064,0.00013859829,0.000083151004,0.000092705755,0.000076369026,0.00025257925,0.00924444],"genre_scores_gemma":[0.07514118,0.00054436387,0.91340345,0.00015297385,0.00013256015,0.00045950993,0.00041846378,0.0004673666,0.009280121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865484,0.0004299711,0.000079380865,0.000241758,0.0004325709,0.00016134378],"domain_scores_gemma":[0.9976131,0.0017997476,0.00011580306,0.00017376174,0.00022953138,0.00006809048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017628153,0.0021354712,0.001438119,0.0010648805,0.0006592253,0.0014683456,0.002686015,0.0012408798,0.0113082295],"category_scores_gemma":[0.0050854166,0.0017740568,0.0025474944,0.002331289,0.0013476055,0.0026100657,0.0029980494,0.0045696218,0.001777629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001417115,0.0001853166,0.0001721092,0.0007030934,0.00016278074,0.00015174397,0.00024775727,0.67242426,0.0068665966,0.14249378,0.00895167,0.16749926],"study_design_scores_gemma":[0.000048694706,0.00005588559,0.000048384878,0.00004058639,0.000034521418,0.00006154425,0.000049584898,0.91084564,0.0017531373,0.08235626,0.0046906658,0.000015065779],"about_ca_topic_score_codex":0.0029484425,"about_ca_topic_score_gemma":0.0042678514,"teacher_disagreement_score":0.0113082295,"about_ca_system_score_codex":0.0008240521,"about_ca_system_score_gemma":0.001347171,"threshold_uncertainty_score":0.037829757},"labels":[],"label_agreement":null},{"id":"W78658037","doi":"10.1007/978-3-642-30541-2_2","title":"On a DAG Partitioning Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Directed acyclic graph; Bounded function; Combinatorics; Graph; Feedback arc set; Pathwidth; Graph partition; Computer science; Directed graph; Mathematics; Strongly connected component; Discrete mathematics; Time complexity; Line graph; Voltage graph","score_opus":0.026816232369333087,"score_gpt":0.28554245065602657,"score_spread":0.2587262182866935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78658037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10108485,0.003129713,0.7484433,0.013416704,0.0011634771,0.0006628326,0.0024209432,0.001408585,0.12826961],"genre_scores_gemma":[0.3075062,0.0040313783,0.59729517,0.0018725217,0.001297554,0.00067339075,0.0077489843,0.0012527474,0.07832208],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890125,0.00031042274,0.00005810324,0.0003193211,0.0002409321,0.00017003372],"domain_scores_gemma":[0.9971533,0.0018001006,0.0001291105,0.0005021899,0.0002193403,0.00019595702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010982063,0.0015544394,0.0016091756,0.0011630822,0.0018048933,0.0029739197,0.0026274044,0.002450227,0.019853944],"category_scores_gemma":[0.0073208,0.0009404791,0.001574625,0.0033056163,0.0012130666,0.0074160947,0.0038245872,0.0034102744,0.002560347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006421444,0.0005845158,0.0010486068,0.0011312994,0.00014603393,0.00040416853,0.00046388048,0.11186304,0.004704532,0.37500498,0.107459486,0.39654732],"study_design_scores_gemma":[0.0001354801,0.00008828352,0.00047384933,0.00011160188,0.00008442385,0.00032271835,0.00026024447,0.16477594,0.0014598804,0.80332345,0.028938897,0.000025166368],"about_ca_topic_score_codex":0.0023915353,"about_ca_topic_score_gemma":0.002830708,"teacher_disagreement_score":0.019853944,"about_ca_system_score_codex":0.0013595141,"about_ca_system_score_gemma":0.0012179374,"threshold_uncertainty_score":0.06641805},"labels":[],"label_agreement":null},{"id":"W787537876","doi":"10.1007/978-3-319-19264-2_3","title":"Classification of Hand Movements from Non-invasive Brain Signals Using Lattice Neural Networks with Dendritic Processing","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Instituto Tecnológico y de Estudios Superiores de Monterrey; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Electroencephalography; Decoding methods; Brain–computer interface; Pattern recognition (psychology); Artificial intelligence; Wilcoxon signed-rank test; Neural decoding; Artificial neural network; Speech recognition; Motor imagery; Neuroscience; Psychology; Algorithm","score_opus":0.057564786151275533,"score_gpt":0.29138076897301746,"score_spread":0.23381598282174193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W787537876","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.08600374,0.00063875626,0.9092262,0.00018797336,0.00014373571,0.00011076455,0.0004982492,0.0010492904,0.0021413488],"genre_scores_gemma":[0.5859324,0.00064787705,0.40776634,0.00007842674,0.00009897178,0.00013975293,0.000777073,0.00013608439,0.004423062],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986565,0.000020309122,0.000012151302,0.000042094758,0.000038469763,0.000021271702],"domain_scores_gemma":[0.9994518,0.00026757375,0.0000538084,0.00004822204,0.00014069575,0.000037832513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046264922,0.00058608735,0.00055963866,0.0007494529,0.0002924627,0.0009578833,0.00061577815,0.0006371093,0.0018686035],"category_scores_gemma":[0.0011346163,0.0002589152,0.0008003848,0.0009093869,0.0003252609,0.0007168767,0.00052334205,0.0009227629,0.0008002704],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040029798,0.00017105484,0.004532606,0.00027945728,0.00006828925,0.00013685497,0.00008875224,0.10351028,0.079178795,0.0037040545,0.0027588615,0.8051707],"study_design_scores_gemma":[0.000008581156,0.000053183958,0.0015730718,0.00001660869,0.000015029478,0.000067635905,0.000023829678,0.98713857,0.008390008,0.0022838616,0.00041711898,0.000012402354],"about_ca_topic_score_codex":0.002040177,"about_ca_topic_score_gemma":0.0038783725,"teacher_disagreement_score":0.002040177,"about_ca_system_score_codex":0.0003914758,"about_ca_system_score_gemma":0.0005227024,"threshold_uncertainty_score":0.0062510967},"labels":[],"label_agreement":null},{"id":"W78768605","doi":"10.1007/978-3-319-06200-6_10","title":"On the Quantum Formalization of Coherent Light in HOL","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Quantum; Computer science; Physics; Quantum mechanics; Programming language","score_opus":0.012302102496804091,"score_gpt":0.2225311374375934,"score_spread":0.21022903494078932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78768605","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060592793,0.007868052,0.42307758,0.010798843,0.0020418894,0.00008978145,0.00038753403,0.0005444443,0.49459907],"genre_scores_gemma":[0.8526364,0.0046393783,0.06830259,0.0024744836,0.0021076412,0.00016144956,0.00029301754,0.00046074815,0.06892425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994456,0.0002017792,0.000028783861,0.00006404917,0.00018456111,0.00007515292],"domain_scores_gemma":[0.99935144,0.00030730356,0.00004269917,0.00014497025,0.000104210245,0.000049387472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011422846,0.0005039131,0.00054008723,0.0011423494,0.001482762,0.002826114,0.00094474823,0.0009721984,0.006558605],"category_scores_gemma":[0.0015100195,0.00036413016,0.00070983847,0.000792291,0.0067358753,0.0064336695,0.0018743906,0.0034676064,0.00085917354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021537528,0.000002549404,0.000006112827,0.0000062097597,5.581704e-7,0.0000044065337,0.0000515392,0.0000983255,0.000086618915,0.99849546,0.00034763457,0.0008984846],"study_design_scores_gemma":[0.0000027790932,0.0000034514082,0.00002069155,0.0000074594723,7.776418e-7,0.000012871836,0.000018989138,0.00054609653,0.000079789665,0.9955721,0.0037316151,0.0000033622764],"about_ca_topic_score_codex":0.00093775586,"about_ca_topic_score_gemma":0.001112893,"teacher_disagreement_score":0.006558605,"about_ca_system_score_codex":0.0015566117,"about_ca_system_score_gemma":0.0007022273,"threshold_uncertainty_score":0.021940708},"labels":[],"label_agreement":null},{"id":"W79246384","doi":"10.1007/3-540-44469-6_70","title":"Extending Datalog with Declarative Updates","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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 Regina","funders":"","keywords":"Datalog; Deductive database; Computer science; Programming language; Logic programming; Semantics (computer science); Declarative programming; Simple (philosophy); Set (abstract data type); Extension (predicate logic); Stable model semantics; Answer set programming; Theoretical computer science; Operational semantics; Database; Programming paradigm; Inductive programming","score_opus":0.016560458609192162,"score_gpt":0.2406037956524794,"score_spread":0.22404333704328724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79246384","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.01105467,0.0005115807,0.97128445,0.0005245663,0.00024035343,0.00008600081,0.00029936325,0.006412877,0.009586241],"genre_scores_gemma":[0.2826999,0.0017787515,0.6968067,0.00096273044,0.00043188632,0.00020988284,0.0013666635,0.0023111769,0.013432214],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978934,0.0005959429,0.0003370399,0.00027448306,0.00073508313,0.00016417698],"domain_scores_gemma":[0.99272925,0.00368586,0.00022873729,0.0026299437,0.0005902164,0.00013603631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003957388,0.0008412452,0.00077633257,0.0010520592,0.0006789422,0.0029572125,0.00260857,0.00084029906,0.0040478525],"category_scores_gemma":[0.011965912,0.0013746507,0.0014669528,0.0012708277,0.001843369,0.010392222,0.0051485305,0.0025202802,0.0014513237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029534523,0.0003108023,0.0023928361,0.00085663336,0.00010615285,0.00081431173,0.0014039631,0.029973267,0.0075935726,0.4427628,0.01590861,0.49758166],"study_design_scores_gemma":[0.000096298856,0.00013397803,0.0003059963,0.00019677274,0.0001782899,0.0006960662,0.00021764229,0.12501857,0.018340731,0.74041945,0.11431614,0.00008005536],"about_ca_topic_score_codex":0.0013005444,"about_ca_topic_score_gemma":0.0020097988,"teacher_disagreement_score":0.0040478525,"about_ca_system_score_codex":0.0005297869,"about_ca_system_score_gemma":0.00085232104,"threshold_uncertainty_score":0.02092892},"labels":[],"label_agreement":null},{"id":"W792477341","doi":"10.1007/978-3-319-12691-3_45","title":"A Fast Greedy Algorithm for the Critical Node Detection Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Greedy algorithm; Cardinality (data modeling); Algorithm; Vertex (graph theory); Pairwise comparison; Computational complexity theory; Node (physics); Benchmark (surveying); Graph; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.020383153145591346,"score_gpt":0.25655851560882564,"score_spread":0.23617536246323428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W792477341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060416874,0.0005581385,0.9874823,0.00041371371,0.0002481183,0.00030030933,0.00023971674,0.0014701351,0.0032458086],"genre_scores_gemma":[0.069080025,0.00046741197,0.92239857,0.00036768673,0.00025117878,0.00065692246,0.00093729456,0.00040877797,0.0054320707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834216,0.00037242164,0.00009131748,0.0004336573,0.00050279585,0.00025759157],"domain_scores_gemma":[0.9952944,0.0029404194,0.0002102736,0.0005763785,0.00069832127,0.0002802008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019084703,0.0025197517,0.002853949,0.0022809077,0.0017207102,0.0021865177,0.004858056,0.002793816,0.008722234],"category_scores_gemma":[0.008852274,0.0012082078,0.001488702,0.0030813036,0.0013416467,0.0034019093,0.0040150825,0.0032553603,0.0034875332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010343072,0.00045730357,0.00090981275,0.00065438775,0.00017815708,0.00023937717,0.0002365782,0.23483674,0.009172726,0.054305702,0.0528612,0.6451137],"study_design_scores_gemma":[0.00035378485,0.00013662639,0.00021400567,0.000043812328,0.000073842864,0.00020898423,0.00007506104,0.89616233,0.0023476952,0.09423129,0.006111068,0.00004140444],"about_ca_topic_score_codex":0.0055037173,"about_ca_topic_score_gemma":0.006229452,"teacher_disagreement_score":0.008722234,"about_ca_system_score_codex":0.0018303276,"about_ca_system_score_gemma":0.0043524066,"threshold_uncertainty_score":0.029178798},"labels":[],"label_agreement":null},{"id":"W793576242","doi":"10.1007/978-3-319-18008-3_16","title":"Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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 Toronto","funders":"","keywords":"Knapsack problem; Solver; Ellipsoid; Mathematical optimization; Computer science; Quadratic programming; Extension (predicate logic); Quadratic growth; Optimization problem; Second-order cone programming; Constraint (computer-aided design); Regular polygon; Convex optimization; Mathematics; Algorithm","score_opus":0.027240050841982565,"score_gpt":0.251362261037277,"score_spread":0.22412221019529444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W793576242","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.0024852827,0.00020871105,0.992589,0.00007232298,0.000071766604,0.00003807125,0.000034526984,0.00027972553,0.004220559],"genre_scores_gemma":[0.09651283,0.00037265482,0.8978636,0.00021869589,0.0000812183,0.00019935916,0.00024417866,0.00030258708,0.004204876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923027,0.00015655316,0.000040551047,0.00010590754,0.0004039741,0.00006279687],"domain_scores_gemma":[0.99878436,0.00075266324,0.000058100602,0.000116256124,0.00024141447,0.000047178546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010850515,0.0014323668,0.0015956812,0.0012264048,0.0004576951,0.0012471356,0.002110239,0.0014997585,0.0059896684],"category_scores_gemma":[0.0038311766,0.00096476957,0.00090154255,0.0030262102,0.0007733149,0.0021914062,0.0020330448,0.002435788,0.0013370361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007335687,0.00015738189,0.00013883354,0.00019380561,0.00004300608,0.000036680794,0.00004666966,0.8065811,0.0025531452,0.01959176,0.004734363,0.1658498],"study_design_scores_gemma":[0.000008991666,0.000011269324,0.000015609632,0.0000070097526,0.0000030191354,0.0000071211925,0.0000033001545,0.9958514,0.00023860675,0.0033642836,0.0004851579,0.0000042520837],"about_ca_topic_score_codex":0.007262207,"about_ca_topic_score_gemma":0.008207702,"teacher_disagreement_score":0.007262207,"about_ca_system_score_codex":0.0005978474,"about_ca_system_score_gemma":0.0013233495,"threshold_uncertainty_score":0.020037472},"labels":[],"label_agreement":null},{"id":"W79536630","doi":"10.1007/978-3-642-21946-7_22","title":"Classification of Clinical Gene-Sample-Time Microarray Expression Data via Tensor Decomposition Methods","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Tensor decomposition and applications","field":"Mathematics","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 Windsor","funders":"","keywords":"Discriminative model; Computer science; Curse of dimensionality; Microarray analysis techniques; Tensor (intrinsic definition); Gene chip analysis; Data mining; Sample (material); Pattern recognition (psychology); Artificial intelligence; Expression (computer science); Microarray; Computational biology; Gene; Gene expression; Mathematics; Biology; Genetics","score_opus":0.18378938951214358,"score_gpt":0.4423257245730031,"score_spread":0.25853633506085955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79536630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035872653,0.0024699653,0.9556792,0.0008062927,0.00025171705,0.00011791542,0.002439189,0.0012963718,0.0010666582],"genre_scores_gemma":[0.31939763,0.0037377551,0.6564265,0.00041308734,0.0007068507,0.0005067644,0.0132453265,0.00046945352,0.005096591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813014,0.00055078854,0.0001762329,0.00047105356,0.00048911216,0.0001826431],"domain_scores_gemma":[0.99736315,0.0012840062,0.0003514228,0.00041645698,0.0004677389,0.00011724158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034315556,0.0013111244,0.0014875613,0.0021460452,0.000353429,0.0018201882,0.0011224722,0.00080269756,0.001366101],"category_scores_gemma":[0.0057568583,0.00040462668,0.002205007,0.0028127946,0.00057930907,0.0011489114,0.0009984871,0.0017856744,0.0014494557],"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.00049506046,0.00035420278,0.015709471,0.00053430593,0.0004661099,0.00025743354,0.0002942564,0.04494605,0.043894522,0.00879508,0.01892322,0.8653302],"study_design_scores_gemma":[0.00003844335,0.00029590412,0.016990874,0.000099353565,0.00025173792,0.0007776372,0.00019689312,0.9043323,0.013986802,0.049371153,0.013551988,0.000107013206],"about_ca_topic_score_codex":0.0016269013,"about_ca_topic_score_gemma":0.002064629,"teacher_disagreement_score":0.0034315556,"about_ca_system_score_codex":0.0005455904,"about_ca_system_score_gemma":0.0008887588,"threshold_uncertainty_score":0.018148005},"labels":[],"label_agreement":null},{"id":"W796257133","doi":"10.1007/978-3-319-16483-0_36","title":"Dose Calculation in a Mouse Lung Tumor and in Secondary Organs During Radiotherapy Treatment: A Monte Carlo Study","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Monte Carlo method; Nuclear medicine; Beam (structure); Radiation; Radiation therapy; Absorbed dose; Spinal cord; Photon; Irradiation; Linear energy transfer; Physics; Beam energy; Materials science; Medicine; Optics; Nuclear physics; Radiology; Mathematics","score_opus":0.010859495911096778,"score_gpt":0.27164214970120915,"score_spread":0.26078265379011234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W796257133","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.66300845,0.011181551,0.2829388,0.0005330446,0.000117434036,0.0002993273,0.0012112956,0.0017457476,0.038964376],"genre_scores_gemma":[0.9679127,0.0011997375,0.018018885,0.00010533468,0.000018199968,0.000068789,0.0003420695,0.0008122608,0.011522033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953604,0.00012965818,0.000027768023,0.00007373701,0.00019267219,0.000040171937],"domain_scores_gemma":[0.99872214,0.0008550901,0.00015042433,0.00009812616,0.00012806551,0.00004614836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872719,0.0006032558,0.00088054454,0.0008513035,0.00044349738,0.0012921755,0.0014847605,0.0014883619,0.0023333526],"category_scores_gemma":[0.0018975394,0.00079776044,0.0011755286,0.001583912,0.00053507293,0.0005204245,0.0006090126,0.0006480838,0.00057497085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020517227,0.00025449315,0.011883846,0.00061934587,0.00025038086,0.00070990983,0.0006955807,0.8201782,0.12284603,0.005634873,0.0014077728,0.033467922],"study_design_scores_gemma":[0.00014337903,0.0011341344,0.031591542,0.00012342482,0.0005018327,0.0027958888,0.0002794076,0.79214895,0.16061945,0.002654591,0.007821446,0.00018590297],"about_ca_topic_score_codex":0.0062618232,"about_ca_topic_score_gemma":0.0030865078,"teacher_disagreement_score":0.0062618232,"about_ca_system_score_codex":0.0014628947,"about_ca_system_score_gemma":0.00071916,"threshold_uncertainty_score":0.012450755},"labels":[],"label_agreement":null},{"id":"W79646937","doi":"10.1007/978-3-540-24629-9_11","title":"Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed hash table; Scalability; Hash table; Distributed computing; Hash function; Peer-to-peer; Publication; Computer network; Pastry; Database; Computer security","score_opus":0.02582257333802171,"score_gpt":0.22736494624039938,"score_spread":0.20154237290237767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79646937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03158254,0.0005072067,0.947181,0.00021856067,0.00016737806,0.00032074325,0.00022180993,0.016813489,0.0029873704],"genre_scores_gemma":[0.28687415,0.0006788042,0.700705,0.00018060915,0.00020526467,0.00047791647,0.0013735302,0.0011813625,0.008323394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975376,0.0004965991,0.0003049069,0.00038100244,0.001017005,0.00026296702],"domain_scores_gemma":[0.99368405,0.002575862,0.0003322438,0.002197635,0.0007815854,0.00042866738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003794225,0.0010898011,0.0025568143,0.0018893984,0.002192173,0.005052437,0.0042110546,0.0020469557,0.0062631234],"category_scores_gemma":[0.007497427,0.0022159363,0.001173839,0.0030490335,0.0017790038,0.0072058537,0.0059432858,0.0017750055,0.0038267607],"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.0021794362,0.00096337515,0.005930678,0.0014863173,0.00057965494,0.0010579283,0.0014233498,0.2220135,0.07511497,0.15052482,0.027561378,0.5111646],"study_design_scores_gemma":[0.00039867783,0.00030059917,0.0005466289,0.00006169003,0.00026834136,0.0002671469,0.0002494687,0.8074309,0.055245068,0.11453418,0.020583188,0.00011406217],"about_ca_topic_score_codex":0.0017887802,"about_ca_topic_score_gemma":0.0019821697,"teacher_disagreement_score":0.0062631234,"about_ca_system_score_codex":0.0010755468,"about_ca_system_score_gemma":0.0014253027,"threshold_uncertainty_score":0.020952284},"labels":[],"label_agreement":null},{"id":"W79658127","doi":"10.1007/978-3-642-28920-0_8","title":"SCADA Protocol Vulnerabilities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Modbus; IEC 61850; Computer science; SCADA; Industrial control system; Communications protocol; Process (computing); Protocol (science); Leverage (statistics); Computer network; Computer security; Embedded system; Control (management); Automation; Engineering; Operating system","score_opus":0.02959246066746436,"score_gpt":0.28162131223090847,"score_spread":0.2520288515634441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79658127","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.05690704,0.00741462,0.22773278,0.004118438,0.0007235867,0.00020779739,0.000658493,0.0054245563,0.6968126],"genre_scores_gemma":[0.73321307,0.010178091,0.03601117,0.0007232385,0.00040217678,0.00019083428,0.00081550184,0.00064218155,0.21782376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994766,0.00006939167,0.000027816915,0.00006981856,0.00029477273,0.00006167269],"domain_scores_gemma":[0.9989598,0.0003180481,0.000107743836,0.00041876343,0.00016456399,0.000031033982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004307404,0.0007229242,0.00028382518,0.0012429713,0.000627708,0.001698424,0.0004902418,0.0011012056,0.012713655],"category_scores_gemma":[0.002292365,0.00033111128,0.00036679738,0.00094156084,0.00098224,0.0027577353,0.0015286497,0.0014927194,0.0038638243],"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.00006595976,0.000054423523,0.00081897253,0.00030360563,0.000028047869,0.00088349055,0.0006761919,0.00522283,0.010222734,0.6309966,0.050520584,0.30020657],"study_design_scores_gemma":[0.000021438804,0.00011013089,0.0012406533,0.0005064185,0.00007600064,0.0062284074,0.000267919,0.016123194,0.024538796,0.4285317,0.5223075,0.00004767174],"about_ca_topic_score_codex":0.00030152485,"about_ca_topic_score_gemma":0.00038401852,"teacher_disagreement_score":0.012713655,"about_ca_system_score_codex":0.00061193085,"about_ca_system_score_gemma":0.0005784276,"threshold_uncertainty_score":0.04253137},"labels":[],"label_agreement":null},{"id":"W7984016","doi":"10.1007/11825890_9","title":"Online Music Search by Tapping","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Music and Audio Processing","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":"Simon Fraser University","funders":"","keywords":"Tapping; Computer science; Finger tapping; Acoustics","score_opus":0.026185603317795594,"score_gpt":0.2541785654409486,"score_spread":0.22799296212315298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7984016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32409608,0.0046437616,0.5204409,0.0013482488,0.001148225,0.0006043852,0.0043323003,0.025160551,0.11822559],"genre_scores_gemma":[0.7756143,0.0008163399,0.16977221,0.00025338592,0.00040007583,0.00014952008,0.0030733938,0.00053543766,0.0493852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928916,0.00009955478,0.00003744608,0.00015384828,0.00025429067,0.0001656357],"domain_scores_gemma":[0.9987429,0.00053662906,0.000051328072,0.00036468092,0.00018278816,0.00012179535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041227846,0.00088679086,0.001930633,0.0018360522,0.00091149396,0.0016781291,0.0019206731,0.0013882318,0.030766945],"category_scores_gemma":[0.003016085,0.00048167058,0.0006284269,0.0033718164,0.00043382272,0.0044183866,0.0020490687,0.0007614992,0.010288539],"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.0025313,0.0008017492,0.0023685056,0.00038257978,0.00010856706,0.00035453137,0.00018181163,0.014406371,0.040501498,0.014404645,0.052271817,0.8716866],"study_design_scores_gemma":[0.00042895286,0.0008375414,0.0027325868,0.000070346854,0.0001696832,0.0015179222,0.00042427113,0.86135405,0.042386875,0.053170808,0.03677851,0.00012848881],"about_ca_topic_score_codex":0.003215712,"about_ca_topic_score_gemma":0.0046403194,"teacher_disagreement_score":0.030766945,"about_ca_system_score_codex":0.00043026413,"about_ca_system_score_gemma":0.00077400863,"threshold_uncertainty_score":0.10292566},"labels":[],"label_agreement":null},{"id":"W80063147","doi":"10.1007/11494683_34","title":"Using Domain Knowledge in the Random Subspace Method: Application to the Classification of Biomedical Spectra","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"National Research Council Canada; National Research Council Institute for Biodiagnostics","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Domain (mathematical analysis); Computer science; Pattern recognition (psychology); Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.02801293553469018,"score_gpt":0.3269198519213485,"score_spread":0.2989069163866583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80063147","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.006280813,0.0006692784,0.9915005,0.00014961616,0.000028302931,0.000023427641,0.00007818827,0.00059347565,0.0006762583],"genre_scores_gemma":[0.10357286,0.001399974,0.89181954,0.000119615725,0.00013386799,0.000115547766,0.00042977906,0.00019718044,0.002211642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906224,0.00046949025,0.000049422546,0.00013882962,0.00023693453,0.0000431694],"domain_scores_gemma":[0.99797195,0.0014264944,0.000079725585,0.00019051846,0.00027907782,0.000052261938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023485257,0.000726501,0.0011781411,0.0011923357,0.000502962,0.0012028397,0.0009607002,0.0010210979,0.0022210502],"category_scores_gemma":[0.0043755304,0.0003108721,0.0010329207,0.002300549,0.00073096476,0.0012355372,0.0013271897,0.0014127459,0.0010788814],"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.00011926853,0.000120468256,0.00059872464,0.00020458305,0.000098727825,0.00008444953,0.00016140062,0.1014591,0.009434508,0.013529442,0.005825876,0.86836356],"study_design_scores_gemma":[0.00001629316,0.00004778347,0.0005422087,0.000021209227,0.000029413593,0.000118794356,0.000053400847,0.96472824,0.0040504336,0.027623486,0.0027361722,0.000032609743],"about_ca_topic_score_codex":0.0024947452,"about_ca_topic_score_gemma":0.0023468235,"teacher_disagreement_score":0.0024947452,"about_ca_system_score_codex":0.00027707094,"about_ca_system_score_gemma":0.00062322704,"threshold_uncertainty_score":0.012420356},"labels":[],"label_agreement":null},{"id":"W801472226","doi":"10.1007/978-3-319-19225-3_4","title":"Nondeterministic Tree Width of Regular Languages","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","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":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Computer science; Nondeterministic algorithm; Programming language; Tree (set theory); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01794984032262465,"score_gpt":0.2570241980910572,"score_spread":0.23907435776843255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W801472226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29448342,0.002582841,0.6234864,0.0015009892,0.00031614065,0.000086429354,0.0009500323,0.0014140896,0.07517959],"genre_scores_gemma":[0.89240605,0.0010680093,0.08593372,0.00020625339,0.00024926572,0.00016830282,0.00073234073,0.00083964,0.018396419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987698,0.0002730475,0.00011211064,0.0003170592,0.00036215133,0.0001657482],"domain_scores_gemma":[0.9954124,0.0031175283,0.00026160022,0.0006483002,0.0003398887,0.00022026068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095406,0.0004090721,0.00068468304,0.0009008573,0.00081125455,0.002819068,0.0016467402,0.00075488526,0.0053574336],"category_scores_gemma":[0.0073275184,0.0008043227,0.0007148117,0.001276144,0.0015774297,0.00699344,0.0018588478,0.0029515952,0.00092376355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017085744,0.00003444127,0.00041102982,0.00014043254,0.00001086773,0.00006115959,0.0004626796,0.006078828,0.006253584,0.95057696,0.001629434,0.03416963],"study_design_scores_gemma":[0.000018361698,0.000020241194,0.00019991123,0.000030932173,0.000013665622,0.00007267901,0.00006289928,0.018116739,0.0031721783,0.974378,0.003900062,0.000014340419],"about_ca_topic_score_codex":0.0004447853,"about_ca_topic_score_gemma":0.00053800666,"teacher_disagreement_score":0.0053574336,"about_ca_system_score_codex":0.0010982957,"about_ca_system_score_gemma":0.0007555949,"threshold_uncertainty_score":0.017922461},"labels":[],"label_agreement":null},{"id":"W80338197","doi":"10.1007/978-3-642-21596-4_24","title":"Individual Feature–Appearance for Facial Action Recognition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Université de Montréal","funders":"","keywords":"Computer science; Facial expression; Gabor wavelet; Artificial intelligence; Pattern recognition (psychology); Face hallucination; Feature (linguistics); Expression (computer science); Facial recognition system; Computer vision; Face (sociological concept); Facial expression recognition; Active appearance model; Wavelet; Face detection; Image (mathematics); Wavelet transform; Discrete wavelet transform","score_opus":0.0604620392069759,"score_gpt":0.27226861098626487,"score_spread":0.21180657177928897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80338197","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.011103264,0.001743667,0.9674849,0.00012179428,0.00030253959,0.000059873444,0.0006680217,0.004984677,0.013531344],"genre_scores_gemma":[0.25375214,0.0033384576,0.65934026,0.00023996958,0.00025179758,0.00016441985,0.0034512426,0.0008937455,0.078567974],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998349,0.000015989406,0.000007712295,0.000044727145,0.00007841111,0.00001818377],"domain_scores_gemma":[0.9999027,0.000014996099,0.00000766343,0.000032071894,0.0000359534,0.000006548968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019732345,0.00041249485,0.0003950346,0.0003824636,0.00011659436,0.00040354,0.0007102662,0.00047184498,0.013014627],"category_scores_gemma":[0.000342086,0.00015748416,0.00036464725,0.00065702345,0.00021145004,0.0006930646,0.00041130706,0.00044212004,0.009675862],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064657186,0.000034211986,0.00019951022,0.000081667495,0.0000147481505,0.000042501153,0.000015888263,0.0031849083,0.077152796,0.0032547214,0.0100227045,0.9059317],"study_design_scores_gemma":[0.000019371964,0.0004054637,0.010600617,0.000099581244,0.000084500614,0.0020484421,0.0000786136,0.5598632,0.22994278,0.023235207,0.17353344,0.00008879352],"about_ca_topic_score_codex":0.00096774223,"about_ca_topic_score_gemma":0.0014711412,"teacher_disagreement_score":0.013014627,"about_ca_system_score_codex":0.00017833897,"about_ca_system_score_gemma":0.00017666478,"threshold_uncertainty_score":0.043538213},"labels":[],"label_agreement":null},{"id":"W803553430","doi":"10.1007/978-3-319-17130-2_9","title":"Distributed Deliberation on Direct Help in Agent Teamwork","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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 Northern British Columbia","funders":"","keywords":"Deliberation; Computer science; Protocol (science); Bidding; Teamwork; Operations research; Knowledge management; Management science; Management; Engineering; Political science","score_opus":0.0346795078984081,"score_gpt":0.26315599406007395,"score_spread":0.22847648616166585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W803553430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046191346,0.0014365164,0.8381013,0.0011298936,0.0003627276,0.00009196019,0.00004509637,0.0002149879,0.112426184],"genre_scores_gemma":[0.88554806,0.0006035961,0.078111574,0.00011114888,0.00015947479,0.0002435014,0.00006741161,0.00010690694,0.035048284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836594,0.0009341684,0.00006260364,0.00022040373,0.00026500458,0.0001518824],"domain_scores_gemma":[0.9961229,0.002948542,0.0001095597,0.0004609681,0.00019970018,0.0001582509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017290028,0.0005760089,0.0008076209,0.0005045468,0.0012341075,0.0019921125,0.0017336939,0.0013885286,0.008482737],"category_scores_gemma":[0.0072924662,0.00054147147,0.0007368736,0.0007559518,0.0027843306,0.003410109,0.0040004626,0.0018510179,0.00092982466],"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.0001714612,0.000043684242,0.00016161976,0.00011700391,0.000024771745,0.00014630915,0.00093604013,0.05444824,0.0008612711,0.9045658,0.0024297612,0.03609398],"study_design_scores_gemma":[0.000051347,0.000034438697,0.00010714777,0.000026945796,0.000013606975,0.000045344605,0.00014549766,0.14472492,0.00047158662,0.84960043,0.00476626,0.000012511817],"about_ca_topic_score_codex":0.0011074992,"about_ca_topic_score_gemma":0.00083200337,"teacher_disagreement_score":0.008482737,"about_ca_system_score_codex":0.00096560776,"about_ca_system_score_gemma":0.0006583262,"threshold_uncertainty_score":0.028377533},"labels":[],"label_agreement":null},{"id":"W80418340","doi":"10.1007/11871637_38","title":"Measuring to Fit: Virtual Tailoring Through Cluster Analysis and Classification","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Textile materials and evaluations","field":"Materials 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":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Body shape; Waist; Clothing; Circumference; Cluster (spacecraft); Perspective (graphical); Anthropometry; Population; Computer science; Psychology; Artificial intelligence; Geography; Mathematics; Medicine; Demography; Body mass index; Sociology","score_opus":0.06898938743687666,"score_gpt":0.28490531728994045,"score_spread":0.2159159298530638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80418340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124596156,0.0001816288,0.86216813,0.00040648074,0.00013851127,0.0004304185,0.0011104138,0.0050852005,0.0058830646],"genre_scores_gemma":[0.45875573,0.000092081755,0.53537714,0.00008365873,0.000044927634,0.0004017532,0.0016446735,0.000986597,0.0026133372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950512,0.0020392998,0.00026384502,0.0009043748,0.001480832,0.00026044357],"domain_scores_gemma":[0.9836056,0.008437916,0.00090214366,0.0036301306,0.0030559523,0.00036819148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051950356,0.0010865016,0.0010089807,0.003232652,0.0012403169,0.0034443373,0.0022103733,0.000816106,0.004112348],"category_scores_gemma":[0.02841687,0.00046319704,0.0012901347,0.003920512,0.00093594746,0.0028375564,0.0025505838,0.0011889617,0.001848851],"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.00048205178,0.0005157436,0.030239992,0.00022998157,0.0002997701,0.000054837332,0.0015000888,0.03900503,0.0070764944,0.010650729,0.014548265,0.89539695],"study_design_scores_gemma":[0.000074079835,0.00033794064,0.033586577,0.00008840107,0.00016209329,0.00017325231,0.0020104656,0.8739202,0.019454127,0.05822121,0.0118168555,0.00015479518],"about_ca_topic_score_codex":0.00472939,"about_ca_topic_score_gemma":0.005901888,"teacher_disagreement_score":0.0051950356,"about_ca_system_score_codex":0.00088866655,"about_ca_system_score_gemma":0.0010763285,"threshold_uncertainty_score":0.027474284},"labels":[],"label_agreement":null},{"id":"W806182678","doi":"10.1007/978-3-319-17533-1_3","title":"Differential Fault Analysis of Streebog","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Hash function; Computer science; GOST (hash function); Cryptographic hash function; Block cipher; MDC-2; Byte; Theoretical computer science; Algorithm; Cryptography; Double hashing; Computer security; Computer hardware","score_opus":0.030337706526008857,"score_gpt":0.29329365021803216,"score_spread":0.2629559436920233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W806182678","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14637196,0.0025734133,0.8123002,0.0013439603,0.00042268334,0.00008308188,0.00027555283,0.0016748402,0.034954228],"genre_scores_gemma":[0.92641705,0.00058985985,0.05763707,0.00029023772,0.00016004025,0.00003907969,0.0002635366,0.00025766832,0.014345493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988961,0.00021667416,0.000047054273,0.00016825092,0.00051835953,0.00015357291],"domain_scores_gemma":[0.9978713,0.0009878774,0.00015777166,0.0004644162,0.0004491964,0.000069474474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006846827,0.00062029494,0.00074626616,0.0018697866,0.00064563507,0.0012780731,0.0010650251,0.00091192964,0.0047368077],"category_scores_gemma":[0.0057052854,0.0003227545,0.00055003696,0.0011917544,0.0017422694,0.0028523405,0.0014742209,0.0016502308,0.00081988674],"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.00035555166,0.000058619917,0.0020160247,0.00019344638,0.00004548193,0.00030866996,0.00031675713,0.054194715,0.0077174855,0.8031244,0.0060480223,0.12562083],"study_design_scores_gemma":[0.000012659721,0.00004894865,0.0004107819,0.00004255629,0.000019107369,0.00021487409,0.00003738245,0.13266082,0.005800132,0.85603666,0.0046914225,0.000024591247],"about_ca_topic_score_codex":0.0008320053,"about_ca_topic_score_gemma":0.0008383532,"teacher_disagreement_score":0.0047368077,"about_ca_system_score_codex":0.0014801191,"about_ca_system_score_gemma":0.0007430582,"threshold_uncertainty_score":0.015846193},"labels":[],"label_agreement":null},{"id":"W806588681","doi":"10.1007/978-3-319-19066-2_4","title":"Novel AI Strategies for Multi-Player Games at Intermediate Board States","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","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":"Computer science; Heuristic; Variety (cybernetics); State (computer science); Sequential game; Field (mathematics); Process (computing); Theoretical computer science; Game theory; Artificial intelligence; Mathematical economics; Algorithm; Mathematics; Programming language","score_opus":0.0723738106742477,"score_gpt":0.3273671183907746,"score_spread":0.2549933077165269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W806588681","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.034415215,0.00038392705,0.8740091,0.0005159405,0.00018360652,0.00014258071,0.000064200736,0.00039563433,0.089889914],"genre_scores_gemma":[0.69861645,0.00042917908,0.25736648,0.00022414663,0.00008678159,0.0003325251,0.00016358306,0.0001851434,0.04259578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995598,0.00013186036,0.000026300791,0.000087361084,0.00010687088,0.00008776216],"domain_scores_gemma":[0.99919933,0.0004782978,0.000049337967,0.000062951185,0.00008315169,0.00012694157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004638435,0.0008233151,0.0005626394,0.00046816448,0.0008981811,0.00201705,0.0019414314,0.0012263795,0.010876955],"category_scores_gemma":[0.0024728877,0.0003483081,0.00073712325,0.0003991054,0.0010056645,0.0019932569,0.0019281398,0.0022127114,0.0014853071],"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.00010876279,0.0001253099,0.00029641582,0.00015468204,0.00004202082,0.0001915645,0.00042825605,0.050338387,0.0088191265,0.8756657,0.004443031,0.059386767],"study_design_scores_gemma":[0.000039841467,0.00008681378,0.00014989823,0.00004109633,0.000023458406,0.00011766769,0.00015108341,0.58185506,0.0017830342,0.40932852,0.006401626,0.000021897504],"about_ca_topic_score_codex":0.0010464705,"about_ca_topic_score_gemma":0.0020204065,"teacher_disagreement_score":0.010876955,"about_ca_system_score_codex":0.000841752,"about_ca_system_score_gemma":0.0007218775,"threshold_uncertainty_score":0.036387026},"labels":[],"label_agreement":null},{"id":"W80835161","doi":"10.1007/978-3-319-13039-2_7","title":"Linear Cryptanalysis of the PP-1 and PP-2 Block Ciphers","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","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":"Mount Allison University","funders":"","keywords":"Linear cryptanalysis; Impossible differential cryptanalysis; Block cipher; Differential cryptanalysis; Higher-order differential cryptanalysis; Boomerang attack; Cryptanalysis; Computer science; Algorithm; Theoretical computer science; Arithmetic; Cryptography; Mathematics","score_opus":0.014035366588223365,"score_gpt":0.2524765620033397,"score_spread":0.23844119541511632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80835161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1251632,0.009582676,0.5194262,0.003642257,0.0017790974,0.0002586253,0.0004866482,0.0012318911,0.33842948],"genre_scores_gemma":[0.7564388,0.0049479236,0.098420404,0.0007197528,0.00083837076,0.000198843,0.0004486709,0.00037662842,0.13761067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911433,0.00021055227,0.00004508482,0.00010348264,0.00038076402,0.00014572879],"domain_scores_gemma":[0.9993388,0.00030171685,0.000048310296,0.00020078578,0.000085375796,0.000024873654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075492234,0.0009122025,0.00047288666,0.000774565,0.000537397,0.0020945808,0.0006928695,0.0010102142,0.010319836],"category_scores_gemma":[0.002229327,0.00049295963,0.0007985994,0.0008994104,0.0017058841,0.002623841,0.0014445755,0.002326912,0.0037813706],"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.000377447,0.000076398625,0.0003587997,0.0002313011,0.000048557104,0.0002846625,0.00023978131,0.013985814,0.017451094,0.8069274,0.011622672,0.14839615],"study_design_scores_gemma":[0.00010254361,0.00031775283,0.0009796222,0.00017914239,0.000066400615,0.0016933093,0.00008638299,0.0895526,0.07846885,0.7648893,0.06358169,0.00008243257],"about_ca_topic_score_codex":0.00020799847,"about_ca_topic_score_gemma":0.0002050677,"teacher_disagreement_score":0.010319836,"about_ca_system_score_codex":0.00070021884,"about_ca_system_score_gemma":0.00061662414,"threshold_uncertainty_score":0.03452325},"labels":[],"label_agreement":null},{"id":"W81013672","doi":"10.1007/978-3-319-08434-3_10","title":"Formalization of Complex Vectors in Higher-Order Logic","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","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":"Concordia University","funders":"","keywords":"Computer science; Vector space; Automated theorem proving; Extension (predicate logic); Reflection (computer programming); HOL; Complex system; Theoretical computer science; Algorithm; Mathematics; Programming language; Artificial intelligence; Pure mathematics","score_opus":0.040706074788734094,"score_gpt":0.256915074579938,"score_spread":0.21620899979120392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81013672","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.016610084,0.0021035033,0.91968524,0.0011117455,0.000531923,0.00007759059,0.0004083283,0.00061906996,0.058852628],"genre_scores_gemma":[0.5309565,0.0040353416,0.41143453,0.0007812623,0.00090364687,0.00025004635,0.0013078809,0.00080889947,0.04952191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988117,0.00029666343,0.000113025926,0.00017679445,0.00047420748,0.00012763985],"domain_scores_gemma":[0.9990362,0.00037755776,0.00008849239,0.00017208916,0.0002508304,0.00007489744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016308693,0.0010987128,0.00074464077,0.0019353816,0.001023744,0.005609212,0.001663442,0.0009107271,0.0093736155],"category_scores_gemma":[0.0022816034,0.0006852735,0.0013025954,0.0020832424,0.003913866,0.0076725297,0.0018188761,0.004416191,0.0017933028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050320755,0.0000067015526,0.000030204752,0.000024302555,0.0000032464807,0.000014088896,0.00007621994,0.00041177284,0.00030896263,0.9938834,0.0005892234,0.0046468466],"study_design_scores_gemma":[0.000007707996,0.000009417089,0.00006574316,0.000029967143,0.000007711003,0.000056264165,0.000048124144,0.004815472,0.00086297514,0.97841644,0.015669337,0.000010802626],"about_ca_topic_score_codex":0.0016428635,"about_ca_topic_score_gemma":0.0015843479,"teacher_disagreement_score":0.0093736155,"about_ca_system_score_codex":0.0021345548,"about_ca_system_score_gemma":0.0010442765,"threshold_uncertainty_score":0.031357825},"labels":[],"label_agreement":null},{"id":"W81184795","doi":"10.1007/978-3-642-22351-8_5","title":"Using Medians to Generate Consensus Rankings for Biological Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":30,"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":"Ranking (information retrieval); Computer science; Heuristic; Set (abstract data type); Permutation (music); Information retrieval; Data mining; Theoretical computer science; Artificial intelligence","score_opus":0.17465872594774828,"score_gpt":0.31319250443270624,"score_spread":0.13853377848495796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81184795","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.022934157,0.00049452484,0.96909976,0.0002823447,0.00021560493,0.00020992145,0.0010823339,0.0041190735,0.001562184],"genre_scores_gemma":[0.18646942,0.00022831078,0.8027865,0.00018535706,0.00020514693,0.0004926851,0.0065021794,0.00091609015,0.0022142644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992733,0.0025849068,0.00058247463,0.0013367073,0.0022939255,0.00046890514],"domain_scores_gemma":[0.980372,0.011467296,0.00084929477,0.0023571292,0.0043380754,0.00061619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01292947,0.0017435523,0.0028608306,0.0075416504,0.0022291427,0.0032955785,0.0034081002,0.0020359743,0.005333326],"category_scores_gemma":[0.035763714,0.0011854114,0.002742277,0.004759607,0.0010794932,0.0034431084,0.0035334157,0.0026847275,0.0025832609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008586707,0.00033301534,0.007226454,0.000650281,0.00089795626,0.0002167307,0.00061030604,0.18176201,0.008575353,0.025429808,0.028786248,0.7446532],"study_design_scores_gemma":[0.0001441811,0.00020777706,0.001449954,0.00006339357,0.00010027044,0.00010564583,0.0002902991,0.8773212,0.0057152673,0.10957907,0.0049526775,0.00007028179],"about_ca_topic_score_codex":0.0036648752,"about_ca_topic_score_gemma":0.00660557,"teacher_disagreement_score":0.01292947,"about_ca_system_score_codex":0.0019371131,"about_ca_system_score_gemma":0.0025058447,"threshold_uncertainty_score":0.06837839},"labels":[],"label_agreement":null},{"id":"W81251885","doi":"10.1007/978-3-319-10404-1_7","title":"A Probabilistic Approach to Quantification of Melanin and Hemoglobin Content in Dermoscopy Images","year":2014,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Melanin; Pattern recognition (psychology); Content (measure theory); Mathematics; Chemistry","score_opus":0.027623896056373057,"score_gpt":0.2397442734450706,"score_spread":0.21212037738869755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81251885","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.00385463,0.00020631275,0.99538356,0.00006074539,0.0000075304306,0.000024637206,0.000033752687,0.00012766893,0.00030127628],"genre_scores_gemma":[0.2570184,0.0013561085,0.7360842,0.000121524434,0.00013139912,0.00018585905,0.00023465721,0.00018623627,0.0046816026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929464,0.00014737491,0.00003835514,0.00016900728,0.0002924364,0.000058113044],"domain_scores_gemma":[0.9988758,0.0005999576,0.00012698534,0.00009544372,0.00025654578,0.000045313005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013535087,0.00066432985,0.00087653025,0.0024368798,0.0006446108,0.0016471604,0.0017556973,0.001406389,0.001467481],"category_scores_gemma":[0.002644192,0.0012312111,0.0016328077,0.0012939854,0.00094510696,0.0012930034,0.0013664953,0.0010665283,0.00045155032],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018935517,0.00017002202,0.0033694792,0.0004084065,0.00024815215,0.00033297343,0.00022580737,0.5697149,0.08615229,0.040241715,0.0014228086,0.2975241],"study_design_scores_gemma":[0.000004933228,0.000027663735,0.0012250869,0.00001330895,0.00003579933,0.00021997529,0.000012110646,0.9836348,0.0050509735,0.008930304,0.00081706495,0.000027922586],"about_ca_topic_score_codex":0.0061692256,"about_ca_topic_score_gemma":0.008334435,"teacher_disagreement_score":0.0061692256,"about_ca_system_score_codex":0.0011847476,"about_ca_system_score_gemma":0.0009842104,"threshold_uncertainty_score":0.012266636},"labels":[],"label_agreement":null},{"id":"W813765498","doi":"10.1007/978-3-319-19773-9_8","title":"Comparing Representations for Learner Models in Interactive Simulations","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 British Columbia","funders":"","keywords":"Computer science; Human–computer interaction; Artificial intelligence; Machine learning; Data science","score_opus":0.10017774870049385,"score_gpt":0.33049181685703577,"score_spread":0.23031406815654193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813765498","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.56585264,0.00062303134,0.42050776,0.0006517502,0.0001320088,0.00022818736,0.00077735604,0.0022548174,0.008972423],"genre_scores_gemma":[0.95945466,0.00016951544,0.038193695,0.000038993494,0.00001054677,0.00013752755,0.0008037307,0.00022079356,0.0009706411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669075,0.002039462,0.0001976902,0.00026437754,0.0006234029,0.0001842113],"domain_scores_gemma":[0.93249166,0.06027472,0.001104627,0.003258192,0.0022404932,0.00063034036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048070853,0.000567525,0.000624664,0.0013494708,0.0003929068,0.0036612414,0.0016305293,0.0019404422,0.005006912],"category_scores_gemma":[0.07201278,0.00051034644,0.0008379104,0.0009940611,0.0008053976,0.005550888,0.0019422522,0.00174218,0.00069679256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043564993,0.0007310895,0.014048506,0.00041855013,0.00025354302,0.00012399675,0.002235689,0.6779356,0.0031449092,0.04826563,0.0033210858,0.24516486],"study_design_scores_gemma":[0.000054636424,0.00016771413,0.0010198136,0.00005065216,0.00005173257,0.000023513967,0.00030920657,0.978408,0.0015204013,0.01773243,0.0006401614,0.000021631155],"about_ca_topic_score_codex":0.0050673685,"about_ca_topic_score_gemma":0.0040664226,"teacher_disagreement_score":0.0050673685,"about_ca_system_score_codex":0.0022149738,"about_ca_system_score_gemma":0.0010102108,"threshold_uncertainty_score":0.025422573},"labels":[],"label_agreement":null},{"id":"W81740225","doi":"10.1007/978-3-319-10359-4_18","title":"Securing Business Data on Android Smartphones","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"École de Technologie Supérieure","funders":"","keywords":"Android (operating system); Computer science; Computer security; Android application; Business model; Operating system; Business","score_opus":0.022194178074764485,"score_gpt":0.25987444732395654,"score_spread":0.23768026924919206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81740225","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39756963,0.024873206,0.31259692,0.007364471,0.0031257076,0.0006904685,0.002286133,0.018079748,0.23341371],"genre_scores_gemma":[0.85462016,0.0068298476,0.042409163,0.0009242426,0.00046896862,0.000093536735,0.0010398275,0.00077499205,0.09283924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995443,0.000047474652,0.000026776124,0.000055175966,0.00026835065,0.000057869038],"domain_scores_gemma":[0.9986518,0.00048442054,0.00012249943,0.00043642402,0.00025124804,0.000053697837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025525843,0.0007282885,0.0003552743,0.0009516898,0.0004070974,0.0015120282,0.0005072066,0.0007120676,0.004890279],"category_scores_gemma":[0.002393436,0.00032550193,0.00027218342,0.00047250616,0.00043131993,0.0020021629,0.0010831666,0.00075808534,0.0042024753],"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.0002586224,0.00007593499,0.006748863,0.00052566634,0.000047554626,0.0013138051,0.00091584027,0.0016656406,0.05350447,0.018518789,0.044484597,0.8719402],"study_design_scores_gemma":[0.000047595302,0.0005774119,0.024315929,0.0013798496,0.00021742164,0.010126561,0.0016681325,0.095950216,0.3358747,0.048467424,0.48120907,0.00016571353],"about_ca_topic_score_codex":0.00059997226,"about_ca_topic_score_gemma":0.00086288684,"teacher_disagreement_score":0.004890279,"about_ca_system_score_codex":0.0002728712,"about_ca_system_score_gemma":0.0003033616,"threshold_uncertainty_score":0.016359687},"labels":[],"label_agreement":null},{"id":"W8197146","doi":"10.1007/11527770_62","title":"Evidence Accumulation to Identify Discriminatory Signatures in Biomedical Spectra","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Manitoba; National Research Council Canada; National Research Council Institute for Biodiagnostics","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Computer science; Classifier (UML); Benchmark (surveying); Feature extraction; Cluster analysis; Support vector machine; Randomness; Biomarker discovery; Spectral clustering; Machine learning; Data mining; Mathematics; Biology; Statistics; Geography","score_opus":0.04513501498585732,"score_gpt":0.3446344263413786,"score_spread":0.2994994113555213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8197146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09431189,0.0013949025,0.89968675,0.0004034914,0.00006261429,0.00013609642,0.00047712962,0.0014249119,0.0021022123],"genre_scores_gemma":[0.5220349,0.00077059935,0.47158182,0.0001675283,0.00013868624,0.00016079894,0.0013799091,0.00022015814,0.003545619],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989795,0.00024512567,0.00012289062,0.00023973388,0.00033298897,0.000079685604],"domain_scores_gemma":[0.9910095,0.006777585,0.00050128717,0.000640752,0.00084484386,0.00022615866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037816167,0.00081905397,0.0012212006,0.0042225695,0.0005015516,0.001993586,0.0011748833,0.0011787736,0.002603012],"category_scores_gemma":[0.009434221,0.00048007755,0.0011184951,0.0022084236,0.0009976969,0.0023073778,0.0019952813,0.0016728912,0.0008905101],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011286327,0.00041668248,0.0113324225,0.0004721091,0.0002789451,0.00044090158,0.0002174317,0.043326348,0.05999099,0.023081347,0.0025536085,0.85676056],"study_design_scores_gemma":[0.000091758586,0.00033162997,0.005099049,0.00008937965,0.00023351825,0.00057849154,0.000110080706,0.8741167,0.04665411,0.069526434,0.0031205255,0.000048359972],"about_ca_topic_score_codex":0.0005549222,"about_ca_topic_score_gemma":0.00070760085,"teacher_disagreement_score":0.0042225695,"about_ca_system_score_codex":0.0004957072,"about_ca_system_score_gemma":0.0008465233,"threshold_uncertainty_score":0.019999325},"labels":[],"label_agreement":null},{"id":"W820336768","doi":"10.1007/978-3-319-20306-5_14","title":"Gender, Age, and Responsiveness to Cialdini’s Persuasion Strategies","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Behavioral Health and Interventions","field":"Psychology","cited_by":74,"is_retracted":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":"Persuasion; Reciprocity (cultural anthropology); Consistency (knowledge bases); Scarcity; Psychology; Proxy (statistics); Social psychology; Scale (ratio); Developmental psychology; Demography; Computer science; Geography; Sociology; Economics; Artificial intelligence","score_opus":0.15341426263490404,"score_gpt":0.41930650281287674,"score_spread":0.2658922401779727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W820336768","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.91942143,0.0024933647,0.0012433513,0.0010533665,0.00024369523,0.00012663557,0.00026081552,0.000074515534,0.075082876],"genre_scores_gemma":[0.98414177,0.0007811126,0.000643633,0.0001927111,0.00011324008,0.00008558447,0.00017812583,0.00004164214,0.01382228],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99935037,0.00021493259,0.0000381133,0.00008918104,0.00022462918,0.000082691164],"domain_scores_gemma":[0.9823616,0.014309533,0.0011794444,0.0007213041,0.0006240563,0.0008039365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026653176,0.00039121593,0.0002722574,0.0007785874,0.00033060374,0.0014319685,0.0004764205,0.0006970363,0.012874953],"category_scores_gemma":[0.029657237,0.0002664075,0.0003024127,0.00035458896,0.00030641595,0.0008381571,0.00045770686,0.0012308201,0.0023266156],"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.0054950337,0.0030679235,0.4317286,0.00037941954,0.00035566356,0.0008942158,0.01862363,0.0022868565,0.03164125,0.010975816,0.018040475,0.4765112],"study_design_scores_gemma":[0.00022865915,0.00229743,0.9590546,0.00020248149,0.00031502554,0.0014747556,0.004292543,0.003921841,0.005856631,0.00605548,0.01620477,0.00009577309],"about_ca_topic_score_codex":0.0011651835,"about_ca_topic_score_gemma":0.0013097129,"teacher_disagreement_score":0.012874953,"about_ca_system_score_codex":0.0003384397,"about_ca_system_score_gemma":0.00036633626,"threshold_uncertainty_score":0.04307103},"labels":[],"label_agreement":null},{"id":"W82086503","doi":"10.1007/978-3-642-23626-6_80","title":"Probabilistic Multi-shape Segmentation of Knee Extensor and Flexor Muscles","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","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 British Columbia; Simon Fraser University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Ground truth; Probabilistic logic; Pattern recognition (psychology); Image segmentation; Sørensen–Dice coefficient; Task (project management); Computer vision","score_opus":0.02527531373800877,"score_gpt":0.24607372904424582,"score_spread":0.22079841530623706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82086503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18290593,0.0016074314,0.8111032,0.00031669321,0.000054011016,0.00010804517,0.00039656408,0.0012578453,0.0022502628],"genre_scores_gemma":[0.69459784,0.00095472357,0.2977032,0.0001807549,0.000072669616,0.00009402038,0.00094598526,0.00055698573,0.004893803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.00007981484,0.000028321667,0.00010608301,0.0001525115,0.00007322105],"domain_scores_gemma":[0.99927825,0.00024582483,0.00009922167,0.00011712396,0.00019417769,0.00006536772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010715374,0.0006667271,0.00079763925,0.0019416303,0.00052569405,0.001477829,0.0011559817,0.0022326442,0.0014554614],"category_scores_gemma":[0.0017993768,0.0009030492,0.0016340992,0.0012803479,0.00057558686,0.0006846811,0.0010838459,0.00070365384,0.0009448233],"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.0014498588,0.00017385559,0.012666658,0.00054548134,0.00028425743,0.0009416003,0.00043528088,0.2116279,0.3200178,0.003935375,0.0024325924,0.4454893],"study_design_scores_gemma":[0.0000391983,0.00014400769,0.015471171,0.00007188209,0.000111943526,0.0015983017,0.00012346762,0.9195317,0.05618359,0.0041974583,0.002467481,0.00005981474],"about_ca_topic_score_codex":0.0036806695,"about_ca_topic_score_gemma":0.005912496,"teacher_disagreement_score":0.0036806695,"about_ca_system_score_codex":0.0004934027,"about_ca_system_score_gemma":0.0009966348,"threshold_uncertainty_score":0.0073184967},"labels":[],"label_agreement":null},{"id":"W821118243","doi":"10.1007/978-3-319-16808-1_22","title":"Accelerating Cost Volume Filtering Using Salient Subvolumes and Robust Occlusion Handling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Ontario Tech University","funders":"","keywords":"Computer science; Volume (thermodynamics); Computer vision; Artificial intelligence; Pixel; Computation; Benchmark (surveying); Subpixel rendering; Filter (signal processing); Salient; Algorithm","score_opus":0.062277625797912656,"score_gpt":0.2936828128529635,"score_spread":0.23140518705505084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W821118243","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.005531653,0.00022030469,0.99252456,0.00006389942,0.000058256366,0.000022913495,0.000035949386,0.0005332569,0.0010091813],"genre_scores_gemma":[0.08663102,0.00039168863,0.90847546,0.000092041744,0.00013577174,0.00005237353,0.00030089574,0.0004867123,0.003434082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.000052167903,0.00002386631,0.00006959638,0.00037254038,0.00006441728],"domain_scores_gemma":[0.99910945,0.00037273898,0.00008280695,0.0001569523,0.00023088347,0.00004712702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006104652,0.0011006434,0.0012562189,0.0013687771,0.000409603,0.0018157985,0.0012006452,0.0011324061,0.0038941826],"category_scores_gemma":[0.0030749473,0.000722312,0.0010478736,0.0011675229,0.0004609026,0.0018098087,0.0015915206,0.0012950068,0.0012189368],"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.00039586396,0.00014114568,0.0006932119,0.00029150746,0.00010484075,0.00017796499,0.00016518889,0.1274326,0.10097918,0.040507805,0.009808344,0.7193023],"study_design_scores_gemma":[0.00001403586,0.000045205932,0.00023672802,0.000011252819,0.000021461483,0.00017678966,0.000018080656,0.96522886,0.018536646,0.010954771,0.0047392137,0.000016921262],"about_ca_topic_score_codex":0.0029372664,"about_ca_topic_score_gemma":0.0040755575,"teacher_disagreement_score":0.0038941826,"about_ca_system_score_codex":0.0005347495,"about_ca_system_score_gemma":0.00074779097,"threshold_uncertainty_score":0.01302731},"labels":[],"label_agreement":null},{"id":"W822479191","doi":"10.1007/978-3-319-16468-7_13","title":"On the Complexity of Searching the Linear Ordering Problem Neighborhoods","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Polytechnique Montréal","funders":"","keywords":"Initialization; Computer science; Time complexity; Process (computing); Data structure; Insert (composites); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0601283905995073,"score_gpt":0.26519927920275993,"score_spread":0.20507088860325262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W822479191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16748185,0.010625176,0.5977253,0.01364638,0.0008333157,0.0003847413,0.0031412737,0.001403864,0.20475814],"genre_scores_gemma":[0.5487139,0.0078036017,0.3878677,0.0013859853,0.0013075905,0.00073018007,0.0035345252,0.0016106239,0.047045946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745005,0.0008790816,0.00011944243,0.00038297853,0.00086778746,0.00030062377],"domain_scores_gemma":[0.98328775,0.014245457,0.0005169107,0.0011622795,0.0004683419,0.0003191928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018481974,0.0013827388,0.002558973,0.0014538013,0.0015349159,0.0049801827,0.003513755,0.0023587157,0.022545755],"category_scores_gemma":[0.021934755,0.0012313214,0.0018014129,0.0039216704,0.0022360564,0.010323343,0.0040216967,0.0051221005,0.0022846817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009148956,0.00039849375,0.002113496,0.0010940086,0.0001851503,0.0002800579,0.0005948629,0.23625253,0.0029007383,0.49980274,0.058857966,0.19660515],"study_design_scores_gemma":[0.00010673139,0.000062491,0.0005964142,0.000097436816,0.000057656227,0.00015725556,0.00015325278,0.40670893,0.0007457554,0.5845873,0.006699836,0.00002684262],"about_ca_topic_score_codex":0.005080649,"about_ca_topic_score_gemma":0.0060476367,"teacher_disagreement_score":0.022545755,"about_ca_system_score_codex":0.0026828146,"about_ca_system_score_gemma":0.0016935541,"threshold_uncertainty_score":0.07542306},"labels":[],"label_agreement":null},{"id":"W824022273","doi":"10.1007/978-3-319-17127-2_7","title":"Latent Semantic Analysis for Privacy Preserving Peer Feedback","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","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":"Université de Montréal","funders":"","keywords":"Computer science; Latent semantic analysis; Computer security; Information retrieval","score_opus":0.05986781689637157,"score_gpt":0.2942449012234851,"score_spread":0.23437708432711354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W824022273","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.0029304218,0.00024317694,0.99538815,0.00019875803,0.00004054472,0.000037677324,0.000114742856,0.00037432497,0.0006721769],"genre_scores_gemma":[0.5525259,0.0013910441,0.43024203,0.00033798054,0.00054976105,0.0005444706,0.0015529115,0.0005115467,0.012344289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928054,0.0029212064,0.0003675058,0.0008667531,0.0025402268,0.0004989573],"domain_scores_gemma":[0.98838323,0.0071988152,0.0005757441,0.0023616278,0.0012910734,0.00018951208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053010173,0.0009813084,0.0020488414,0.0015048067,0.0011736802,0.0025835533,0.0023929565,0.0018166734,0.0042373296],"category_scores_gemma":[0.022162542,0.0007054718,0.0018715995,0.002128344,0.0020953673,0.006020291,0.0036751672,0.0034083044,0.0014048176],"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.0004322214,0.0002121553,0.0007035283,0.000361182,0.00015369234,0.000113765156,0.0003608694,0.21021096,0.004922319,0.5358983,0.008746793,0.23788424],"study_design_scores_gemma":[0.000016309992,0.000027525695,0.000086248096,0.000015241489,0.000017441222,0.000029280642,0.000029659464,0.78582764,0.0013927538,0.2111742,0.0013672601,0.000016519221],"about_ca_topic_score_codex":0.0021275997,"about_ca_topic_score_gemma":0.001993497,"teacher_disagreement_score":0.0053010173,"about_ca_system_score_codex":0.00195147,"about_ca_system_score_gemma":0.0026926412,"threshold_uncertainty_score":0.028034747},"labels":[],"label_agreement":null},{"id":"W82466273","doi":"10.1007/978-3-642-40763-5_45","title":"Statistical Shape Model to 3D Ultrasound Registration for Spine Interventions Using Enhanced Local Phase Features","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Imaging and Analysis","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Artificial intelligence; Computer vision; Statistical model; Orientation (vector space); Expectation–maximization algorithm; Image registration; Pattern recognition (psychology); Mixture model; Phase congruency; Filter (signal processing); Ultrasound; Feature extraction; Image (mathematics); Mathematics; Statistics; Radiology; Medicine","score_opus":0.026631244505469307,"score_gpt":0.3299059728026305,"score_spread":0.3032747282971612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82466273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010552336,0.0001571481,0.9881799,0.000108946355,0.000027961387,0.000030893138,0.000050746046,0.00061196333,0.00028002975],"genre_scores_gemma":[0.52765805,0.00082510395,0.4653992,0.00024440902,0.000096215015,0.00025473797,0.00057835307,0.0008593316,0.004084681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955624,0.000119765435,0.000028996232,0.00008133823,0.00018226536,0.00003137274],"domain_scores_gemma":[0.9992975,0.0003197608,0.00008919215,0.00012270204,0.00014950612,0.000021242206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080353057,0.00057253864,0.00081730133,0.0009113238,0.0002596779,0.0008812711,0.0010299133,0.0010626222,0.0015414761],"category_scores_gemma":[0.0033365234,0.0007537183,0.0013436077,0.0011048486,0.0003785899,0.0010885036,0.0010403056,0.0011002729,0.0010874812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035129316,0.00017100314,0.0012339443,0.00014282478,0.00011063285,0.00010744984,0.000095895346,0.53170186,0.03542355,0.0066788206,0.0023992455,0.4215835],"study_design_scores_gemma":[0.000005548338,0.000041573625,0.0002677567,0.0000041473177,0.000011414607,0.000041711588,0.0000071511763,0.9941413,0.0035366307,0.0014636575,0.00047111942,0.000008093003],"about_ca_topic_score_codex":0.0026985328,"about_ca_topic_score_gemma":0.0038687976,"teacher_disagreement_score":0.0026985328,"about_ca_system_score_codex":0.00047293017,"about_ca_system_score_gemma":0.0010106214,"threshold_uncertainty_score":0.0053656697},"labels":[],"label_agreement":null},{"id":"W82727502","doi":"10.1007/978-3-642-23397-5_2","title":"Parallel Scanning with Bitstream Addition: An XML Case Study","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bitstream; Parsing; Python (programming language); Compiler; SIMD; Programming language; Parallel computing; Byte; XML; Implementation; Decoding methods; Operating system; Algorithm","score_opus":0.02903943252509657,"score_gpt":0.2652701246432353,"score_spread":0.2362306921181387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82727502","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.8428855,0.0007149107,0.10265029,0.0018173476,0.00010284297,0.00044484253,0.00095336826,0.002295274,0.04813552],"genre_scores_gemma":[0.8888267,0.00045454936,0.0858583,0.00025585914,0.00004563521,0.00011044212,0.00061272434,0.00037512984,0.023460643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841464,0.0004646653,0.00010128874,0.00018991731,0.00064763834,0.00018191816],"domain_scores_gemma":[0.9916277,0.005704216,0.00044110196,0.0011441292,0.00087233144,0.00021069331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014386723,0.00060199137,0.00037614346,0.0007987197,0.0009899805,0.0017485189,0.0019988338,0.003002464,0.008350414],"category_scores_gemma":[0.0080286935,0.0004056219,0.0005802656,0.0018467052,0.0011506567,0.0026870088,0.0010228285,0.00089326344,0.0013159165],"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.0036029376,0.0049016704,0.05682801,0.0019250682,0.00031013534,0.087764576,0.009522152,0.14286004,0.063496254,0.0866003,0.034593247,0.50759566],"study_design_scores_gemma":[0.0005586586,0.0024568755,0.01406582,0.00026318966,0.00045241028,0.06498126,0.009593433,0.5498535,0.20995899,0.048931617,0.09861018,0.00027405677],"about_ca_topic_score_codex":0.0033321797,"about_ca_topic_score_gemma":0.0040836614,"teacher_disagreement_score":0.008350414,"about_ca_system_score_codex":0.000639079,"about_ca_system_score_gemma":0.00064419035,"threshold_uncertainty_score":0.02793485},"labels":[],"label_agreement":null},{"id":"W827294596","doi":"10.1007/978-3-642-41924-9_46","title":"Lightweight Conceptual Modeling for Crowdsourcing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Memorial University of Newfoundland","funders":"","keywords":"Crowdsourcing; Computer science; Conceptual model; Data science; World Wide Web; Database","score_opus":0.022935527909122965,"score_gpt":0.235097107297533,"score_spread":0.21216157938841004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W827294596","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.0011175541,0.00011611646,0.99558675,0.00023092957,0.000037737424,0.00010839958,0.00022397174,0.0007991387,0.0017793644],"genre_scores_gemma":[0.113377176,0.0005118622,0.8753057,0.0002521225,0.00009489978,0.00066480436,0.0018755828,0.0007258954,0.007191939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99500424,0.001633242,0.00045269183,0.0007651687,0.0017965748,0.00034804567],"domain_scores_gemma":[0.9940508,0.0024855984,0.00026866485,0.0019557988,0.0009790851,0.00026014174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047352,0.001504208,0.0012851505,0.0019285638,0.0020769273,0.0059853266,0.0053846925,0.0023861704,0.011162],"category_scores_gemma":[0.01670024,0.0016880808,0.0038565597,0.0025343553,0.0017184983,0.008195181,0.007984289,0.003928915,0.0039266394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001200703,0.00015764442,0.00087678805,0.00047857923,0.0001377829,0.00031870342,0.0010948166,0.11953337,0.003117073,0.7294047,0.013160956,0.13159958],"study_design_scores_gemma":[0.000015663085,0.00001598178,0.000091084665,0.00009080011,0.000039968912,0.000088735054,0.00015302608,0.566932,0.0013429001,0.40109417,0.030107735,0.000027935866],"about_ca_topic_score_codex":0.008885432,"about_ca_topic_score_gemma":0.012271339,"teacher_disagreement_score":0.011162,"about_ca_system_score_codex":0.002615232,"about_ca_system_score_gemma":0.0027884871,"threshold_uncertainty_score":0.03734064},"labels":[],"label_agreement":null},{"id":"W82860031","doi":"10.1007/978-3-319-11656-3_20","title":"Comparative Study of Feature Selection for White Blood Cell Differential Counts in Low Resolution Images","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Imaging for Blood Diseases","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":"Concordia University","funders":"","keywords":"Pattern recognition (psychology); Feature selection; Artificial intelligence; Histogram; Support vector machine; Computer science; Feature (linguistics); Feature extraction; Wavelet; Mathematics; Image (mathematics)","score_opus":0.012326802315780558,"score_gpt":0.24949073902827976,"score_spread":0.2371639367124992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82860031","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.90892,0.0032680135,0.083835356,0.00013388277,0.000109564746,0.000059859634,0.0006853314,0.0010289608,0.0019590391],"genre_scores_gemma":[0.9535179,0.00063522847,0.04237992,0.0000313627,0.000052877156,0.000036715344,0.0015554368,0.00010137867,0.0016891854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962556,0.00008672596,0.000030497553,0.00007380573,0.00012438273,0.000058923644],"domain_scores_gemma":[0.9980032,0.001307015,0.00009016188,0.00008472728,0.00045184093,0.00006309074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010432608,0.0004049761,0.0006337781,0.0012473161,0.00023048694,0.0008126047,0.0003564527,0.00028212793,0.0017389123],"category_scores_gemma":[0.002413858,0.00008518567,0.0005238888,0.0011907156,0.00014972057,0.00043520096,0.00024044309,0.00021020613,0.00040281494],"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.004425928,0.00036545,0.02760372,0.000518586,0.00027326003,0.00031115417,0.00018123706,0.011874612,0.14853077,0.00054510916,0.0037686191,0.80160147],"study_design_scores_gemma":[0.00012574942,0.0021053017,0.28433794,0.00006411825,0.00086118054,0.0011971453,0.00060888665,0.5261454,0.17845929,0.001081736,0.004920005,0.00009326374],"about_ca_topic_score_codex":0.0017453424,"about_ca_topic_score_gemma":0.001442177,"teacher_disagreement_score":0.0017453424,"about_ca_system_score_codex":0.00030046733,"about_ca_system_score_gemma":0.0002656851,"threshold_uncertainty_score":0.0058172345},"labels":[],"label_agreement":null},{"id":"W82889130","doi":"10.1007/11424918_35","title":"Adjectives: A Uniform Semantic Approach","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Natural language processing; Linguistics; Philosophy","score_opus":0.013424798239769206,"score_gpt":0.2516046370746645,"score_spread":0.2381798388348953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82889130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067894985,0.0037567704,0.82277495,0.0023487085,0.0011602403,0.00029555344,0.0010946185,0.0021648007,0.15961485],"genre_scores_gemma":[0.23434237,0.0067013255,0.6452173,0.0022783093,0.0028550576,0.00086961105,0.0033916065,0.0023669475,0.10197753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981659,0.0005185762,0.0002657577,0.0004974895,0.0004244533,0.00012789643],"domain_scores_gemma":[0.99915504,0.00022252939,0.00004369282,0.0002584315,0.0002534228,0.00006686522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013895313,0.0015423826,0.00144367,0.004454165,0.0026451326,0.0061617927,0.0023650099,0.0021094698,0.013496905],"category_scores_gemma":[0.0021476878,0.0012096725,0.0022992406,0.004110989,0.0046196147,0.017257094,0.0050012567,0.00400142,0.008447756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021414151,0.000022682438,0.00007125393,0.00011888647,0.00001213263,0.000095862895,0.00042754033,0.00015096921,0.0011867901,0.9576807,0.0056541804,0.03455753],"study_design_scores_gemma":[0.000021233727,0.000025868629,0.00022153163,0.000117026335,0.00006322472,0.00056308036,0.00044809788,0.0036948356,0.0011115884,0.8344097,0.1592886,0.00003524208],"about_ca_topic_score_codex":0.0010047125,"about_ca_topic_score_gemma":0.0012453301,"teacher_disagreement_score":0.013496905,"about_ca_system_score_codex":0.0008893997,"about_ca_system_score_gemma":0.0009803659,"threshold_uncertainty_score":0.04515165},"labels":[],"label_agreement":null},{"id":"W82889883","doi":"10.1007/978-3-642-22922-0_2","title":"SSCP: Mining Statistically Significant Co-location Patterns","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Alberta","funders":"","keywords":"Computer science; Pruning; Data mining; Computation; Feature (linguistics); Pattern recognition (psychology); Dependency (UML); Artificial intelligence; Algorithm","score_opus":0.02911516233681273,"score_gpt":0.26625622506671986,"score_spread":0.23714106272990715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82889883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16020365,0.003380706,0.7317611,0.0009818539,0.0004552722,0.0007827806,0.06660558,0.025935872,0.009893128],"genre_scores_gemma":[0.3416227,0.0013652772,0.5482928,0.00028941862,0.00034957062,0.0009360679,0.09633783,0.0008577411,0.009948614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991228,0.000092243485,0.00008230214,0.0002427897,0.0003873934,0.00007245344],"domain_scores_gemma":[0.99829084,0.00082494895,0.00018476129,0.000343471,0.00027135212,0.000084634186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007451391,0.0014000855,0.0011151333,0.0053292196,0.000828136,0.0013858778,0.0018073149,0.0009865321,0.006548875],"category_scores_gemma":[0.0050105434,0.00049303577,0.0015264235,0.0075715748,0.0004455568,0.0011403956,0.0014312855,0.00082742295,0.0055390536],"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.0005622094,0.0003597457,0.047770526,0.0013835924,0.00062708766,0.0012343473,0.0002796313,0.01957622,0.015160435,0.006412167,0.09522164,0.8114124],"study_design_scores_gemma":[0.0003326818,0.0006484315,0.049729984,0.00030358316,0.0007408798,0.006038075,0.0010501329,0.75608575,0.028595423,0.07451357,0.08182751,0.00013401713],"about_ca_topic_score_codex":0.0028847149,"about_ca_topic_score_gemma":0.005373193,"teacher_disagreement_score":0.006548875,"about_ca_system_score_codex":0.00032677612,"about_ca_system_score_gemma":0.0013509619,"threshold_uncertainty_score":0.021908164},"labels":[],"label_agreement":null},{"id":"W832283216","doi":"10.1007/978-3-319-17127-2_13","title":"TabsGuard: A Hybrid Approach to Detect and Prevent Tabnabbing Attacks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer security","score_opus":0.027074711711949754,"score_gpt":0.2496779658193328,"score_spread":0.22260325410738305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W832283216","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.054184422,0.0027312061,0.7892219,0.00047760212,0.0008266395,0.00057099276,0.0026680944,0.13179237,0.017526781],"genre_scores_gemma":[0.3591076,0.0009199909,0.5897049,0.0009595731,0.00034509526,0.00027035997,0.006234021,0.002947013,0.03951157],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902594,0.00013502825,0.000047189464,0.0002119982,0.00045143842,0.0001283893],"domain_scores_gemma":[0.9990742,0.00021540622,0.00009599886,0.00027135535,0.00026674513,0.000076217344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072011334,0.0013119746,0.0012705306,0.0023428346,0.0007749729,0.0017787513,0.0024127662,0.0020708425,0.0067005586],"category_scores_gemma":[0.0018446941,0.00059507263,0.0010447367,0.00091414887,0.00052072894,0.0021658074,0.002053295,0.001061178,0.005370612],"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.0011801224,0.000628774,0.0072437148,0.00059870374,0.00037555085,0.00041353522,0.00032566747,0.021303598,0.043230176,0.0057941647,0.08749842,0.8314075],"study_design_scores_gemma":[0.00025300833,0.00091342966,0.006211984,0.00016543962,0.00045498845,0.0018495019,0.0002626348,0.7675227,0.10204731,0.021514963,0.09856501,0.00023910661],"about_ca_topic_score_codex":0.0030801743,"about_ca_topic_score_gemma":0.004848342,"teacher_disagreement_score":0.0067005586,"about_ca_system_score_codex":0.0005093832,"about_ca_system_score_gemma":0.00092624535,"threshold_uncertainty_score":0.022415578},"labels":[],"label_agreement":null},{"id":"W83253136","doi":"10.1007/978-3-642-30353-1_28","title":"Mining Administrative Data to Predict Falls in the Elderly Population","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Balance, Gait, and Falls Prevention","field":"Health Professions","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":"McGill University","funders":"","keywords":"Falling (accident); Computer science; Elderly people; Population; Gerontology; Medicine; Environmental health","score_opus":0.10232443311754223,"score_gpt":0.39367980650076445,"score_spread":0.2913553733832222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83253136","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.66211486,0.01216499,0.28557685,0.004408804,0.00051680085,0.00031680783,0.023391893,0.0012952078,0.010213758],"genre_scores_gemma":[0.8097083,0.0071971584,0.15038852,0.0003771338,0.0004309575,0.0002652013,0.026572859,0.000071797964,0.0049880585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996669,0.000079188976,0.00005839229,0.000054574382,0.00011282641,0.000028096718],"domain_scores_gemma":[0.9991327,0.0006550387,0.00006956262,0.000050520703,0.000070684764,0.000021578884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010531839,0.00041611888,0.0005391439,0.0015186375,0.00015075976,0.0007579651,0.0006310507,0.0003716052,0.0006492829],"category_scores_gemma":[0.003170114,0.00026489748,0.00097486406,0.0017885163,0.000111088535,0.00060732936,0.000436803,0.00063141435,0.0004528871],"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.00020027798,0.0006327413,0.2208803,0.0004027205,0.0006924285,0.00053368974,0.00025544295,0.04802754,0.0021150094,0.0034370823,0.024291972,0.69853085],"study_design_scores_gemma":[0.00006794006,0.00036380388,0.23324412,0.0003998699,0.0003897626,0.0009802978,0.00076246815,0.69590974,0.0054514697,0.04031855,0.022026125,0.000085842286],"about_ca_topic_score_codex":0.003691848,"about_ca_topic_score_gemma":0.009257546,"teacher_disagreement_score":0.003691848,"about_ca_system_score_codex":0.00021046224,"about_ca_system_score_gemma":0.00048689102,"threshold_uncertainty_score":0.0073407292},"labels":[],"label_agreement":null},{"id":"W832575060","doi":"10.1007/978-3-319-18681-8_22","title":"Impossible Differential Properties of Reduced Round Streebog","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Block cipher mode of operation; CBC-MAC; Hash function; Construct (python library); Differential cryptanalysis; Differential (mechanical device); Cryptography; MDC-2; Block (permutation group theory); Triple DES; Key (lock); Theoretical computer science; Algorithm; Function (biology); Arithmetic; Cryptographic hash function; Computer security; Mathematics; Computer network","score_opus":0.04942437700887748,"score_gpt":0.2799178023411172,"score_spread":0.2304934253322397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W832575060","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.52825993,0.0019399949,0.17437117,0.0027860124,0.0004708059,0.0001081185,0.0005567595,0.000642284,0.29086494],"genre_scores_gemma":[0.97041625,0.00047486354,0.0100572305,0.00027094432,0.00016588354,0.000054854605,0.00022088093,0.00015135403,0.01818773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874604,0.00027042752,0.00006474978,0.00023003719,0.000435051,0.00025365947],"domain_scores_gemma":[0.9980008,0.0011277891,0.0001562757,0.00038746058,0.00016847711,0.00015913606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090656616,0.0007152566,0.00070542103,0.0014109671,0.0015347712,0.0029556833,0.001057437,0.0010646858,0.008014993],"category_scores_gemma":[0.0040010475,0.00058942253,0.00075459655,0.0009858495,0.0039824536,0.0054079206,0.0026825226,0.0033604538,0.0010852179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006565245,0.000012633155,0.00009351692,0.00003088467,0.000005578207,0.00005581334,0.0001475516,0.0008815878,0.00091440685,0.99297947,0.00078455446,0.0040283203],"study_design_scores_gemma":[0.000012801282,0.00001772786,0.00009035179,0.000010398281,0.0000063658053,0.00008174873,0.00003332696,0.002212571,0.00095908955,0.99385756,0.0027066711,0.000011392343],"about_ca_topic_score_codex":0.00045432805,"about_ca_topic_score_gemma":0.00041034867,"teacher_disagreement_score":0.008014993,"about_ca_system_score_codex":0.0012763293,"about_ca_system_score_gemma":0.000601573,"threshold_uncertainty_score":0.026812851},"labels":[],"label_agreement":null},{"id":"W836593775","doi":"10.1007/978-3-319-17524-9_22","title":"Integrating SMT with Theorem Proving for Analog/Mixed-Signal Circuit Verification","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Automated theorem proving; Mixed-signal integrated circuit; SIGNAL (programming language); Algorithm; Theoretical computer science; Programming language; Electrical engineering; Integrated circuit; Operating system","score_opus":0.03683352476245495,"score_gpt":0.24831962086084378,"score_spread":0.2114860960983888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W836593775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013758076,0.0001880134,0.9919334,0.00014520402,0.00005192867,0.00005918643,0.000030152132,0.001124266,0.005092144],"genre_scores_gemma":[0.11772322,0.00058125454,0.8757875,0.000316948,0.00020010755,0.00020217964,0.00019684198,0.0006097511,0.004382302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544394,0.00180051,0.00031113863,0.00050568953,0.0016668454,0.000271798],"domain_scores_gemma":[0.9911111,0.0060188635,0.00031987563,0.0018392006,0.0006269201,0.00008405828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003992303,0.0015240054,0.0011319957,0.0015049027,0.0006611307,0.0027017172,0.0034192803,0.0012160364,0.009639249],"category_scores_gemma":[0.011002716,0.0011130908,0.002954298,0.0011669602,0.0026106008,0.004737257,0.004136413,0.0029838574,0.0038978336],"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.00019899366,0.00023590213,0.0005830632,0.0012620894,0.000180355,0.00040391114,0.00026091497,0.081620745,0.02303775,0.3985148,0.005653318,0.48804817],"study_design_scores_gemma":[0.00004347351,0.00011467919,0.00015128807,0.00016740346,0.00007220623,0.00028213166,0.000046203706,0.39510617,0.023404934,0.5652738,0.015308861,0.000028855005],"about_ca_topic_score_codex":0.000812458,"about_ca_topic_score_gemma":0.0010641468,"teacher_disagreement_score":0.009639249,"about_ca_system_score_codex":0.0011558606,"about_ca_system_score_gemma":0.0013815732,"threshold_uncertainty_score":0.03224653},"labels":[],"label_agreement":null},{"id":"W83954701","doi":"10.1007/978-3-642-22321-1_5","title":"State Complexity Research and Approximation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","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":"Western University","funders":"","keywords":"Computer science; State (computer science); Theoretical computer science; Algorithm","score_opus":0.07805654158210738,"score_gpt":0.3165436740408817,"score_spread":0.2384871324587743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83954701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018004876,0.031928156,0.7021076,0.020656733,0.0014426886,0.00013439919,0.00097121135,0.0009718896,0.22378244],"genre_scores_gemma":[0.63303643,0.040585972,0.20056377,0.0037622286,0.005810051,0.0007120185,0.0029313373,0.0012103136,0.11138778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970131,0.0006870203,0.000149444,0.00059644296,0.0012322532,0.00032180225],"domain_scores_gemma":[0.98915696,0.007441408,0.00035848637,0.0021892462,0.00066111056,0.0001927315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002454606,0.0017761084,0.0024775336,0.0025262486,0.0019673074,0.006622108,0.0033196846,0.0025867512,0.019180981],"category_scores_gemma":[0.014371397,0.0013202834,0.0026676685,0.0069815256,0.005653337,0.02123016,0.003447275,0.012532215,0.0032577873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031555377,0.000031226045,0.00012474514,0.00016114642,0.00001659735,0.000012406173,0.00007884613,0.0066751856,0.00012432162,0.95855653,0.008053877,0.026133498],"study_design_scores_gemma":[0.000006098073,0.000006464978,0.00006269356,0.000031171985,0.000011726419,0.000020115822,0.000014785039,0.012784488,0.00017790614,0.97913796,0.0077407886,0.000005834375],"about_ca_topic_score_codex":0.0026275096,"about_ca_topic_score_gemma":0.0017700621,"teacher_disagreement_score":0.019180981,"about_ca_system_score_codex":0.006207481,"about_ca_system_score_gemma":0.0022665013,"threshold_uncertainty_score":0.064166784},"labels":[],"label_agreement":null},{"id":"W841199482","doi":"10.1007/978-3-319-18120-2_17","title":"Accelerating Search of Protein Sequence Databases using CUDA-Enabled GPU","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"CUDA; Computer science; Speedup; Parallel computing; SIMD; Instruction set; Central processing unit; Smith–Waterman algorithm; Operating system; Sequence alignment","score_opus":0.11020185102283564,"score_gpt":0.3174082309069959,"score_spread":0.20720637988416024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W841199482","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.1499946,0.004287453,0.77898294,0.0007073218,0.00061883946,0.00019480617,0.0014254057,0.0320872,0.03170139],"genre_scores_gemma":[0.29141572,0.0010614925,0.69149595,0.00027398788,0.00006160693,0.00019542937,0.0024265754,0.0009064628,0.012162803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964094,0.00004586756,0.000026709824,0.00008257838,0.00013082124,0.000073063755],"domain_scores_gemma":[0.9995012,0.00012862655,0.000024659157,0.000117746415,0.00018158392,0.00004615442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041518398,0.00097588263,0.0006712986,0.00084748183,0.00063639134,0.0013458675,0.0019108324,0.00055897253,0.006394392],"category_scores_gemma":[0.0014713696,0.00041143547,0.00067544007,0.0020978395,0.0003300747,0.0011131861,0.0010777843,0.00094666024,0.0024645668],"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.0009439115,0.0002578571,0.0036245373,0.0008439159,0.0002995789,0.00042335864,0.00036508802,0.05798554,0.07513984,0.02197005,0.09240825,0.7457381],"study_design_scores_gemma":[0.0001724754,0.0001387377,0.001795163,0.000061451094,0.0001062428,0.00027609526,0.00014828998,0.9046168,0.037759874,0.017165469,0.037720326,0.000039143702],"about_ca_topic_score_codex":0.011388306,"about_ca_topic_score_gemma":0.014534316,"teacher_disagreement_score":0.011388306,"about_ca_system_score_codex":0.0009519781,"about_ca_system_score_gemma":0.0012266091,"threshold_uncertainty_score":0.022644043},"labels":[],"label_agreement":null},{"id":"W84305015","doi":"10.1007/978-3-642-02026-1_34","title":"Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Optical Network Technologies","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 Alberta","funders":"","keywords":"Multicast; Steiner tree problem; Computer science; Tree (set theory); Routing (electronic design automation); K-ary tree; Node (physics); Approximation algorithm; Algorithm; Theoretical computer science; Binary tree; Combinatorics; Tree structure; Mathematics; Distributed computing; Computer network","score_opus":0.02020964313951863,"score_gpt":0.23136992739376802,"score_spread":0.2111602842542494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84305015","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.004048913,0.01420264,0.95724547,0.011633044,0.00092445005,0.00006469674,0.00013041361,0.000234236,0.011516181],"genre_scores_gemma":[0.104111314,0.018926859,0.86284983,0.0033085449,0.001961248,0.0002754722,0.00030336657,0.00042758317,0.007835788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981001,0.00074613385,0.00010090777,0.00028329634,0.0006615816,0.00010804215],"domain_scores_gemma":[0.99621177,0.0026795454,0.00012427138,0.0004482531,0.00043156662,0.00010469222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040000426,0.0012205923,0.0014262878,0.00084374513,0.00095407246,0.0027513392,0.0026416352,0.0025846052,0.0023628306],"category_scores_gemma":[0.0109876525,0.0011360098,0.0011202968,0.0027571006,0.0034825057,0.009844695,0.0016318277,0.0063566724,0.00082728965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019958353,0.0000912219,0.0002851674,0.00059080706,0.00009075782,0.00006262806,0.00026263137,0.13472104,0.0023234612,0.63140106,0.04154701,0.18842472],"study_design_scores_gemma":[0.00008822037,0.00008708478,0.00015898775,0.00023749024,0.00003463792,0.00016741188,0.000107359825,0.20641139,0.0020768042,0.7337235,0.05686647,0.000040633593],"about_ca_topic_score_codex":0.001860474,"about_ca_topic_score_gemma":0.0014565546,"teacher_disagreement_score":0.0040000426,"about_ca_system_score_codex":0.0027374132,"about_ca_system_score_gemma":0.0012402011,"threshold_uncertainty_score":0.021154463},"labels":[],"label_agreement":null},{"id":"W84307880","doi":"10.1007/3-540-45784-4_8","title":"Efficient Methods for Inferring Tandem Duplication History","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Gene duplication; Tandem exon duplication; Computer science; Set (abstract data type); Gene family; Gene; Algorithm; Computational biology; Genetics; Biology; Genome","score_opus":0.02861577296186992,"score_gpt":0.2843911664469049,"score_spread":0.255775393485035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84307880","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.012585371,0.0007634149,0.9819186,0.00008314619,0.00005938819,0.00008540595,0.0005331223,0.0031893048,0.00078230136],"genre_scores_gemma":[0.06408378,0.00046156143,0.9294009,0.00006473744,0.00011912115,0.0002327899,0.0023743277,0.00044657546,0.0028162098],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983662,0.00039567598,0.00014060565,0.0004712647,0.00049539894,0.00013089538],"domain_scores_gemma":[0.9929293,0.0049529225,0.00034451263,0.0011216558,0.00051248766,0.00013900972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002508301,0.0017308787,0.0024059366,0.0036167211,0.001208423,0.0020446468,0.005238834,0.0017959806,0.006803586],"category_scores_gemma":[0.010113843,0.0016825742,0.0018542425,0.004228968,0.0011047939,0.0037262782,0.0025619369,0.001811135,0.00280239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041581667,0.0001524555,0.0029056491,0.00033084725,0.00021315987,0.00015854723,0.0002068611,0.13028558,0.010730008,0.017001232,0.006822792,0.830777],"study_design_scores_gemma":[0.00015758132,0.00008523028,0.0014919222,0.000037015543,0.00013434433,0.00023291186,0.00009614067,0.88371694,0.007841579,0.10147753,0.004675631,0.00005314752],"about_ca_topic_score_codex":0.0039627426,"about_ca_topic_score_gemma":0.008314084,"teacher_disagreement_score":0.006803586,"about_ca_system_score_codex":0.00095158996,"about_ca_system_score_gemma":0.0015153626,"threshold_uncertainty_score":0.022760212},"labels":[],"label_agreement":null},{"id":"W844332498","doi":"10.1007/978-3-662-46675-9_9","title":"A Generalized Formal Framework for Partial Modeling","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Formalism (music); Semantics (computer science); Granularity; Modeling language; Formal semantics (linguistics); Theoretical computer science; Formal methods; Formal specification; Programming language; Focus (optics); Software; Software engineering","score_opus":0.044298676290199054,"score_gpt":0.28559682628789823,"score_spread":0.24129814999769916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W844332498","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.00078251155,0.00038599138,0.9905974,0.000350074,0.00006544339,0.000043376018,0.000090900314,0.0004359048,0.0072483635],"genre_scores_gemma":[0.09558379,0.0013913461,0.8905886,0.00040826772,0.00029214026,0.00048971525,0.00058980024,0.00050655473,0.010149822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787045,0.0008846793,0.00021827502,0.0003352589,0.0005494073,0.00014183001],"domain_scores_gemma":[0.9985261,0.000543296,0.0000747954,0.0005301281,0.0002590898,0.00006655024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030533848,0.0015905525,0.0010453371,0.0014830204,0.0014009578,0.0037146062,0.002680509,0.0013050695,0.007035461],"category_scores_gemma":[0.0035696984,0.0011016001,0.0028800634,0.002107331,0.004134661,0.0073442687,0.003308219,0.004279519,0.002202698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049377395,0.000006247283,0.000026684105,0.000055018285,0.0000066360576,0.000038019734,0.00015257752,0.0024379294,0.00030299276,0.9845108,0.0010156276,0.011442567],"study_design_scores_gemma":[0.000009195298,0.000011914248,0.000026738124,0.000053774937,0.000020253796,0.00008096946,0.000051316656,0.01733478,0.00044349732,0.9428711,0.039084427,0.000012074503],"about_ca_topic_score_codex":0.0029162215,"about_ca_topic_score_gemma":0.0029691164,"teacher_disagreement_score":0.007035461,"about_ca_system_score_codex":0.0019164353,"about_ca_system_score_gemma":0.0017466381,"threshold_uncertainty_score":0.023535967},"labels":[],"label_agreement":null},{"id":"W84587889","doi":"10.1007/978-3-642-24372-1_8","title":"Formalization of Finite-State Discrete-Time Markov Chains in HOL","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"HOL; Computer science; Markov chain; Automated theorem proving; Markov process; Theoretical computer science; Examples of Markov chains; Probabilistic logic; Binary number; Markov model; Scalability; Variable-order Markov model; Markov property; Algorithm; Mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.022025617073300575,"score_gpt":0.2588579265956386,"score_spread":0.23683230952233802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84587889","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.009474533,0.00023974714,0.97452974,0.00036688574,0.000100968275,0.0000813667,0.00021466402,0.00068383967,0.014308178],"genre_scores_gemma":[0.7067444,0.0008526345,0.27544197,0.00029877882,0.00026707677,0.00033232223,0.00072213204,0.0005199819,0.014820789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911183,0.00023775166,0.000077981895,0.00013289732,0.00030762365,0.00013188903],"domain_scores_gemma":[0.9975165,0.0015795423,0.00016822616,0.00037572312,0.00025910916,0.00010086666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013682813,0.0005556894,0.00052791473,0.00077744114,0.0007968776,0.002285482,0.001449745,0.00068131427,0.007304102],"category_scores_gemma":[0.0033251261,0.00051319523,0.0014944394,0.0006392191,0.0024561465,0.003212147,0.0015788196,0.0029256428,0.0008628527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003324185,0.000042141382,0.00015316877,0.000090912086,0.00001198583,0.00012833015,0.00024422907,0.022618862,0.0013967267,0.964067,0.00069975137,0.010513662],"study_design_scores_gemma":[0.00003399875,0.000023859953,0.0001278637,0.00006127115,0.000022188466,0.00008038969,0.0000671263,0.1508971,0.0032854548,0.8364112,0.008972106,0.000017441389],"about_ca_topic_score_codex":0.0017969598,"about_ca_topic_score_gemma":0.002310371,"teacher_disagreement_score":0.007304102,"about_ca_system_score_codex":0.0016249786,"about_ca_system_score_gemma":0.0015995274,"threshold_uncertainty_score":0.024434686},"labels":[],"label_agreement":null},{"id":"W84607597","doi":"10.1007/978-3-540-39924-7_68","title":"A Parallel Software for the Reconstruction of Dynamic MRI Sequences","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical methods in inverse problems","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Workstation; MATLAB; Software; Computational science; Parallel computing; Iterative reconstruction; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.05352110893603283,"score_gpt":0.3221871882727427,"score_spread":0.26866607933670983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84607597","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001325599,0.0001770691,0.97057724,0.00007599817,0.00006876923,0.00007411747,0.0002190124,0.025577739,0.001904355],"genre_scores_gemma":[0.03303651,0.0006076493,0.94533813,0.00025142048,0.00007959647,0.0004578251,0.0010312345,0.009253042,0.00994457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.00007838617,0.00006560086,0.00011700564,0.00027668453,0.000043713353],"domain_scores_gemma":[0.99891806,0.00046892292,0.000066894325,0.00022104334,0.00026301673,0.00006206718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010790038,0.0012776995,0.0009072583,0.0010807177,0.0006094124,0.0016027823,0.0024782429,0.0012765779,0.02416698],"category_scores_gemma":[0.0027965007,0.0014114529,0.0012529722,0.0011797566,0.00060702465,0.0013915893,0.0015069634,0.001976801,0.0069568185],"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.0010368559,0.00016822729,0.0010083623,0.00082201057,0.00034824046,0.0006541551,0.00046263813,0.04107702,0.06765161,0.037149627,0.07789554,0.7717258],"study_design_scores_gemma":[0.0006134941,0.00024169737,0.0011298646,0.00018926301,0.00032692295,0.002164653,0.00006785681,0.66455954,0.124177545,0.040908366,0.16543522,0.00018558816],"about_ca_topic_score_codex":0.0015879023,"about_ca_topic_score_gemma":0.0020138754,"teacher_disagreement_score":0.02416698,"about_ca_system_score_codex":0.0005591809,"about_ca_system_score_gemma":0.0012475769,"threshold_uncertainty_score":0.08084655},"labels":[],"label_agreement":null},{"id":"W847943846","doi":"10.1007/978-3-319-21413-9_7","title":"A Systematic Mapping on Agile UCD Across the Major Agile and HCI Conferences","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Agile software development; Agile Unified Process; Agile usability engineering; Computer science; Field (mathematics); Theme (computing); Lean software development; Knowledge management; Software engineering; World Wide Web; Software development; Software; Software development process","score_opus":0.03615618499591547,"score_gpt":0.2820582123624267,"score_spread":0.2459020273665112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847943846","genre_codex":"empirical","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69998085,0.030771235,0.11270294,0.00658125,0.0010373433,0.007716637,0.02016908,0.0014573075,0.11958336],"genre_scores_gemma":[0.8312687,0.009617839,0.123922974,0.0013651127,0.00010363968,0.0054741614,0.0109152645,0.0005703565,0.01676196],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.98565316,0.006240701,0.0020001833,0.0014468436,0.003682326,0.000976871],"domain_scores_gemma":[0.9269469,0.026258644,0.009230793,0.0070317998,0.027885783,0.0026461424],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.013972578,0.00038352315,0.00068576646,0.02589895,0.0033875678,0.006470935,0.0013787012,0.00074031117,0.0057565337],"category_scores_gemma":[0.06015242,0.0006080226,0.0006747909,0.028207691,0.0014180554,0.0061104726,0.008688614,0.0014279085,0.0016006868],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025960882,0.00029126497,0.09501148,0.007353871,0.00014158433,0.00061376864,0.10620663,0.0009481897,0.0053859157,0.02044226,0.023541506,0.739804],"study_design_scores_gemma":[0.000056009667,0.0004997255,0.37341422,0.023520114,0.00019774001,0.0010539804,0.24807686,0.0032002723,0.007895982,0.015023167,0.326865,0.00019688928],"about_ca_topic_score_codex":0.013154514,"about_ca_topic_score_gemma":0.026336743,"teacher_disagreement_score":0.97410107,"about_ca_system_score_codex":0.005346658,"about_ca_system_score_gemma":0.014058781,"threshold_uncertainty_score":0.07389498},"labels":[],"label_agreement":null},{"id":"W84819170","doi":"10.1007/978-3-642-36620-8_2","title":"Groupwise Spectral Log-Demons Framework for Atlas Construction","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Atlas (anatomy); Computer science; Construct (python library); Invariant (physics); Isometry (Riemannian geometry); Artificial intelligence; Algorithm; Computer vision; Mathematics; Pure mathematics; Geology","score_opus":0.018014205433776,"score_gpt":0.27638672564833633,"score_spread":0.2583725202145603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84819170","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.0010138783,0.00006424083,0.9973339,0.00005189092,0.000017495664,0.000015564112,0.00008168446,0.00039652112,0.0010248522],"genre_scores_gemma":[0.07186362,0.00040707918,0.91746306,0.00014759299,0.00014006672,0.0001585329,0.0009872051,0.0009684459,0.007864397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994555,0.0002074335,0.000024989027,0.000103098966,0.00016961824,0.00003931183],"domain_scores_gemma":[0.99912125,0.00027570705,0.000057026005,0.0002865899,0.00019867886,0.000060761904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589355,0.0008614796,0.0008497123,0.001793092,0.00052075076,0.0013978886,0.0019939495,0.0010616841,0.007992356],"category_scores_gemma":[0.0024610043,0.00055871607,0.0010110894,0.0011907167,0.0010048882,0.0013120028,0.0022760516,0.0021644754,0.0043798513],"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.00013497341,0.00007683647,0.00041632343,0.0002775511,0.000076255754,0.00022406176,0.00022130145,0.060977615,0.01307388,0.5520176,0.01624491,0.35625866],"study_design_scores_gemma":[0.000014128271,0.00006665088,0.00025607902,0.000034713823,0.000028111037,0.00033772082,0.00007016063,0.47396687,0.006507467,0.4956467,0.023045082,0.000026322863],"about_ca_topic_score_codex":0.0012798693,"about_ca_topic_score_gemma":0.002396967,"teacher_disagreement_score":0.007992356,"about_ca_system_score_codex":0.00055815186,"about_ca_system_score_gemma":0.0007103359,"threshold_uncertainty_score":0.026737094},"labels":[],"label_agreement":null},{"id":"W84835382","doi":"10.1007/978-3-642-38348-9_33","title":"How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":89,"is_retracted":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":"Permutation (music); Generalization; Computer science; Function (biology); Task (project management); Topology (electrical circuits); Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Combinatorics","score_opus":0.03125573763231845,"score_gpt":0.2744590740325687,"score_spread":0.24320333640025024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84835382","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.009965734,0.0003955002,0.9700834,0.00083704595,0.000108761415,0.00007880014,0.00014682936,0.0014433432,0.016940486],"genre_scores_gemma":[0.47738037,0.00086600066,0.48967817,0.0004843853,0.0002269017,0.00026917557,0.00035819993,0.0011648813,0.029572044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984125,0.00030731448,0.00007926184,0.0002307453,0.0007159437,0.00025425493],"domain_scores_gemma":[0.99875665,0.00042049037,0.000042230604,0.0006060191,0.0001280134,0.000046604888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067213,0.00080279016,0.0010171516,0.0005858687,0.0010124366,0.0025933625,0.0016311279,0.001183017,0.009548507],"category_scores_gemma":[0.0037215247,0.0007479281,0.0013194751,0.0008845975,0.002122754,0.0061719976,0.00291909,0.0049548387,0.001960938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008434301,0.000038553964,0.00009248192,0.00009523251,0.0000217243,0.000041849133,0.00010241853,0.023008587,0.0032934397,0.9205762,0.0034653596,0.04917988],"study_design_scores_gemma":[0.00002958148,0.000029377652,0.00007987404,0.000029756366,0.00003135803,0.00005262587,0.000020155701,0.11336018,0.0064130607,0.86651707,0.013413174,0.000023794833],"about_ca_topic_score_codex":0.001206838,"about_ca_topic_score_gemma":0.0013081097,"teacher_disagreement_score":0.009548507,"about_ca_system_score_codex":0.0013933677,"about_ca_system_score_gemma":0.0011361467,"threshold_uncertainty_score":0.031942964},"labels":[],"label_agreement":null},{"id":"W84891240","doi":"10.1007/978-3-642-38457-8_24","title":"Revisiting the Epistemics of Protocol Correctness","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Authentication Protocols Security","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Protocol (science); Correctness; Cryptographic protocol; Epistemic modal logic; Domain (mathematical analysis); Theoretical computer science; Cryptography; Computer security; Description logic; Algorithm; Mathematics","score_opus":0.020571530542246416,"score_gpt":0.2892764854898188,"score_spread":0.2687049549475724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84891240","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.018491022,0.004083408,0.7925061,0.02870428,0.001717908,0.00010002796,0.00020894689,0.0007247179,0.15346354],"genre_scores_gemma":[0.8282286,0.0045124837,0.13332692,0.0037272878,0.0030662348,0.000325446,0.00039175924,0.000985622,0.025435632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9744848,0.014263105,0.0017466815,0.002512227,0.0054650395,0.0015282149],"domain_scores_gemma":[0.90215886,0.07049628,0.002269984,0.016239353,0.007875247,0.00096021837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02616009,0.001275919,0.0016596897,0.002659736,0.0047867983,0.011865593,0.004213797,0.0057782135,0.007731366],"category_scores_gemma":[0.08669642,0.0021962223,0.0024508003,0.0021508366,0.030573595,0.043435533,0.0102138305,0.01686375,0.0023192435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011839214,0.000006171967,0.000052166964,0.000033498098,0.00000444956,0.000025435982,0.0003488419,0.0004322575,0.000059396196,0.99597603,0.0005216612,0.002528298],"study_design_scores_gemma":[0.0000064215656,0.0000051196107,0.000020224099,0.00003174944,0.0000066259004,0.000021251386,0.00006666933,0.0012302983,0.000145523,0.9948996,0.00355962,0.0000070298042],"about_ca_topic_score_codex":0.003213231,"about_ca_topic_score_gemma":0.0020311659,"teacher_disagreement_score":0.02616009,"about_ca_system_score_codex":0.0053361575,"about_ca_system_score_gemma":0.0045683943,"threshold_uncertainty_score":0.13834941},"labels":[],"label_agreement":null},{"id":"W8514837","doi":"10.1007/978-3-642-33347-7_18","title":"Improved Query Suggestion by Query Search","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Information Retrieval and Search Behavior","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 Alberta; University of Regina","funders":"","keywords":"Computer science; Alias; Web query classification; Query expansion; Web search query; Query optimization; Information retrieval; Query language; Sargable; RDF query language; Set (abstract data type); Online aggregation; Query by Example; Search engine; Data mining; Programming language","score_opus":0.018707718689656122,"score_gpt":0.25942122603901474,"score_spread":0.24071350734935862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8514837","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.039938368,0.0062321215,0.9216472,0.0009872372,0.0006021402,0.0003922822,0.00075493107,0.019848686,0.00959708],"genre_scores_gemma":[0.32425514,0.0017358938,0.6404615,0.000551415,0.0007755916,0.0002857359,0.0021823836,0.0015636558,0.028188683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736977,0.0008999538,0.00012839888,0.00033279814,0.0010543694,0.00021463183],"domain_scores_gemma":[0.9957877,0.0021117532,0.00012648269,0.0009318612,0.0009164661,0.00012578358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016431975,0.0013317082,0.0028931538,0.0024616648,0.0009865081,0.0015385301,0.0021627995,0.001591138,0.020544894],"category_scores_gemma":[0.007752257,0.00078106974,0.0010901889,0.0035364612,0.0005839173,0.0031355915,0.0014842531,0.0012451825,0.009287123],"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.0022932694,0.0006026066,0.0012397079,0.00083309464,0.0002001249,0.00024372705,0.0002757394,0.019220585,0.11537836,0.009670692,0.059515204,0.79052687],"study_design_scores_gemma":[0.00035725287,0.0005279438,0.0018850382,0.000045253193,0.00044407914,0.0010400708,0.00012217266,0.8954949,0.063103564,0.011465808,0.02538841,0.00012557427],"about_ca_topic_score_codex":0.005301148,"about_ca_topic_score_gemma":0.0060487315,"teacher_disagreement_score":0.020544894,"about_ca_system_score_codex":0.0006075386,"about_ca_system_score_gemma":0.0012270637,"threshold_uncertainty_score":0.06872952},"labels":[],"label_agreement":null},{"id":"W85244971","doi":"10.1007/978-3-642-24124-6_10","title":"Idealized Fault-Tolerant Components in Requirements Engineering","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","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":"McGill University","funders":"","keywords":"Computer science; Fault tolerance; Key (lock); Process (computing); Component (thermodynamics); Distributed computing; Software engineering; Reliability engineering; Programming language; Computer security; Engineering","score_opus":0.07425637220789683,"score_gpt":0.2848208230006238,"score_spread":0.21056445079272695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85244971","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.008512077,0.000818616,0.97623014,0.00037635115,0.00008629326,0.00006031104,0.000023784729,0.00032356504,0.013568912],"genre_scores_gemma":[0.41472837,0.0012294591,0.57247216,0.00023800138,0.00009959801,0.00019638233,0.0001266833,0.00015768819,0.010751657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759537,0.00080451166,0.00015613224,0.00023507283,0.0010683386,0.00014057162],"domain_scores_gemma":[0.9983876,0.0008139967,0.000107045256,0.00039417305,0.0002538261,0.00004338491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019321855,0.00055002753,0.00045134523,0.0007701361,0.0004211058,0.0017248465,0.0014691526,0.00083748926,0.0022206318],"category_scores_gemma":[0.0041463734,0.0006644375,0.0005105313,0.00067010877,0.002106982,0.0029493342,0.0013383541,0.0020425958,0.0007505181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009227391,0.00003815108,0.00017914739,0.00021819571,0.000023443958,0.00012476304,0.0003844578,0.051673457,0.0050737564,0.857045,0.0016475518,0.08349995],"study_design_scores_gemma":[0.000033856995,0.00008047577,0.00012747616,0.00011073325,0.000033122888,0.00028985992,0.00011812082,0.22796366,0.008384412,0.7356784,0.027148498,0.000031326643],"about_ca_topic_score_codex":0.00057549606,"about_ca_topic_score_gemma":0.00069503207,"teacher_disagreement_score":0.0022206318,"about_ca_system_score_codex":0.0010394645,"about_ca_system_score_gemma":0.0008169961,"threshold_uncertainty_score":0.010218501},"labels":[],"label_agreement":null},{"id":"W852997015","doi":"10.1007/978-3-319-18356-5_7","title":"Budget-Driven Big Data Classification","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Class (philosophy); Big data; Process (computing); Machine learning; Artificial intelligence; Set (abstract data type); Data set; Training set; Support vector machine; Data mining; Scale (ratio); Programming language","score_opus":0.37212191456823307,"score_gpt":0.4431382603684922,"score_spread":0.07101634580025912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W852997015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009921189,0.0017850103,0.97671854,0.0028486827,0.00044445173,0.00019322432,0.00093917723,0.00155625,0.00559351],"genre_scores_gemma":[0.4540505,0.0023103252,0.5043833,0.0020871393,0.0019396031,0.0009378276,0.005254318,0.0012061639,0.027830843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752694,0.001096094,0.00011647486,0.0004194229,0.000565982,0.00027507526],"domain_scores_gemma":[0.9874292,0.008667936,0.00044655058,0.0017727533,0.0011831933,0.00050030183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006857839,0.0013525455,0.0028767434,0.0012157509,0.0007058453,0.002423135,0.004060371,0.0020523611,0.010843235],"category_scores_gemma":[0.023243073,0.0012307772,0.0011392409,0.0023599875,0.0011883633,0.005015355,0.0034581758,0.0037857345,0.0028576017],"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.00081212644,0.0002926114,0.0028274695,0.000492219,0.00021570937,0.00011084378,0.00011660727,0.4140805,0.001669181,0.08635533,0.07493841,0.41808903],"study_design_scores_gemma":[0.000024360092,0.000024320747,0.00017300906,0.000026307105,0.000013706316,0.000025574798,0.000014668147,0.9186262,0.00038454466,0.07840863,0.0022699954,0.000008623798],"about_ca_topic_score_codex":0.002243075,"about_ca_topic_score_gemma":0.004007462,"teacher_disagreement_score":0.010843235,"about_ca_system_score_codex":0.0016503078,"about_ca_system_score_gemma":0.00239351,"threshold_uncertainty_score":0.036274254},"labels":[],"label_agreement":null},{"id":"W85328409","doi":"10.1007/978-3-642-21043-3_27","title":"A Supervised Method of Feature Weighting for Measuring Semantic Relatedness","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","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 Ottawa","funders":"","keywords":"Computer science; Weighting; Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Natural language processing; Semantic feature; Data mining; Information retrieval","score_opus":0.04767106691424186,"score_gpt":0.26416612205382933,"score_spread":0.21649505513958747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85328409","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.0077596707,0.00024616616,0.99043006,0.000027311185,0.000044316053,0.000054940927,0.00014808057,0.00086642057,0.00042298937],"genre_scores_gemma":[0.12256108,0.0002444036,0.8724567,0.000058098518,0.00015762902,0.00029153112,0.0014300592,0.00031248725,0.0024879882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972395,0.00076878234,0.00018221563,0.0007504051,0.0009176504,0.00014141764],"domain_scores_gemma":[0.9966864,0.0012333957,0.00020047088,0.0007770062,0.0009962866,0.00010645406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023122446,0.0009532488,0.0016318175,0.0032639508,0.0009477395,0.001449667,0.002203372,0.0014302378,0.0018897618],"category_scores_gemma":[0.0065600593,0.00041438683,0.0011653024,0.0037570447,0.0006334984,0.002499494,0.0015323719,0.0014231434,0.001480537],"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.00021692645,0.00031105982,0.0018146667,0.0001637058,0.00019342125,0.000055219447,0.00016160842,0.010990326,0.036572773,0.008979432,0.008164459,0.9323764],"study_design_scores_gemma":[0.000064434986,0.0002090341,0.005223374,0.00003393617,0.0001911306,0.0005249151,0.000109053944,0.924287,0.026599223,0.034497924,0.008154287,0.000105680156],"about_ca_topic_score_codex":0.002173341,"about_ca_topic_score_gemma":0.0037773259,"teacher_disagreement_score":0.0032639508,"about_ca_system_score_codex":0.0005510684,"about_ca_system_score_gemma":0.0011271519,"threshold_uncertainty_score":0.012228429},"labels":[],"label_agreement":null},{"id":"W853507063","doi":"10.1007/978-3-662-44199-2_67","title":"A Package for Parametric Matrix Computations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"","keywords":"Symbolic computation; Maple; Algebra over a field; Computer science; Parametric statistics; Computation; Polynomial; Canonical form; Matrix (chemical analysis); Linear algebra; Multivariate statistics; Algorithm; Applied mathematics; Mathematics; Pure mathematics","score_opus":0.017030682757007233,"score_gpt":0.2641130273252443,"score_spread":0.24708234456823705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W853507063","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.000813738,0.0002854667,0.878079,0.00014157903,0.00021868442,0.00013123099,0.0057862196,0.085497394,0.029046742],"genre_scores_gemma":[0.029715324,0.0011779807,0.7822809,0.00049554557,0.00038207544,0.0012926975,0.026318857,0.0750308,0.083305806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986602,0.00019687702,0.00011156465,0.00022294265,0.0006528771,0.00015559127],"domain_scores_gemma":[0.9980854,0.00067668856,0.00007011966,0.00062728,0.00046809367,0.00007254821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095616677,0.0027742868,0.0019383101,0.002568508,0.0010729884,0.002793254,0.0034881947,0.0011371364,0.20779896],"category_scores_gemma":[0.0043631503,0.0020493125,0.0029820818,0.0031408183,0.0006918108,0.0041265134,0.0034514416,0.0036349932,0.16497304],"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.00017902664,0.00014009692,0.00032660732,0.00081389403,0.00009045277,0.00020565516,0.00021117179,0.0048856377,0.005821772,0.115786776,0.42707518,0.44446376],"study_design_scores_gemma":[0.00020669395,0.00008066979,0.000444333,0.000256159,0.00008760882,0.0007476837,0.00008332726,0.04050896,0.017564971,0.28042856,0.6594635,0.00012758636],"about_ca_topic_score_codex":0.0007381432,"about_ca_topic_score_gemma":0.0014502455,"teacher_disagreement_score":0.20779896,"about_ca_system_score_codex":0.0007007725,"about_ca_system_score_gemma":0.000993671,"threshold_uncertainty_score":0.69515675},"labels":[],"label_agreement":null},{"id":"W85445607","doi":"10.1007/978-3-642-24500-8_37","title":"An End-to-End Framework for Multi-view Video Content: Creating Multiple-Perspective Hypervideo to View on Mobile Platforms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Perspective (graphical); Hypermedia; Multimedia; XML; End user; End-to-end principle; Mobile device; Scheme (mathematics); World Wide Web; Human–computer interaction; Computer network; Artificial intelligence","score_opus":0.10954764493434883,"score_gpt":0.3655484340165993,"score_spread":0.2560007890822505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85445607","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.001700745,0.000088980305,0.98918474,0.000055019194,0.000047272137,0.00016844386,0.000085047424,0.005422815,0.0032469037],"genre_scores_gemma":[0.06599466,0.00041622831,0.9113639,0.00014712726,0.00006449158,0.0004014129,0.0008312492,0.0022925548,0.018488398],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991516,0.00010757569,0.00005076527,0.00014838991,0.00041049402,0.0001312885],"domain_scores_gemma":[0.9992409,0.00015982294,0.00003080102,0.0001895018,0.0002259249,0.0001529997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849987,0.0013945883,0.00088885834,0.0008199688,0.0009274093,0.0038279877,0.0035302928,0.0024546038,0.012028071],"category_scores_gemma":[0.0020270718,0.001092613,0.0012713736,0.000419895,0.0008859953,0.0036366174,0.005423051,0.0026936554,0.006035891],"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.0006344135,0.0006554283,0.000978965,0.00087076594,0.00018807691,0.0027126493,0.004240079,0.021278206,0.23465888,0.15497786,0.04030196,0.53850275],"study_design_scores_gemma":[0.000101181984,0.00027618714,0.00073809386,0.00033883983,0.00015335948,0.0022079458,0.0009804383,0.42656028,0.19564597,0.07119685,0.30152413,0.00027679125],"about_ca_topic_score_codex":0.0021103483,"about_ca_topic_score_gemma":0.0034279665,"teacher_disagreement_score":0.012028071,"about_ca_system_score_codex":0.0005764848,"about_ca_system_score_gemma":0.0006782881,"threshold_uncertainty_score":0.040237904},"labels":[],"label_agreement":null},{"id":"W85461845","doi":"10.1007/978-3-642-54903-8_33","title":"How Document Properties Affect Document Relatedness Measures","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Trigram; Computer science; Document classification; Quality (philosophy); Information retrieval; Vector space model; Natural language processing; Word (group theory); Property (philosophy); Affect (linguistics); Artificial intelligence; Space (punctuation); Weighting; Linguistics","score_opus":0.016428412065574563,"score_gpt":0.24364657990157457,"score_spread":0.22721816783600002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85461845","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.78535104,0.0114463,0.16967924,0.0011174863,0.00058000913,0.00024954948,0.004707719,0.0041127494,0.022755899],"genre_scores_gemma":[0.9405009,0.0013877945,0.048714496,0.00013689896,0.00022769117,0.00008075106,0.004424816,0.0008825583,0.003644101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957159,0.0017710705,0.000352887,0.00082466495,0.001135909,0.0001994732],"domain_scores_gemma":[0.9482888,0.041211743,0.002182024,0.0029059432,0.0047510657,0.0006604442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005212633,0.00056042837,0.0006433406,0.0036387327,0.000861801,0.004201354,0.00056564086,0.0009375276,0.0035628746],"category_scores_gemma":[0.055002984,0.00034774505,0.0006274694,0.004182603,0.0005477081,0.0065123443,0.0008275325,0.0011488184,0.00237315],"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.0028765178,0.000595161,0.1124243,0.0020205562,0.00081264845,0.00037826155,0.0020831593,0.018893896,0.13666575,0.015723718,0.025959346,0.68156666],"study_design_scores_gemma":[0.00025800092,0.0020590727,0.28371495,0.00063116144,0.003069496,0.0031253507,0.0029038799,0.33413672,0.22450313,0.08665848,0.058465097,0.0004747233],"about_ca_topic_score_codex":0.0013361363,"about_ca_topic_score_gemma":0.002096633,"teacher_disagreement_score":0.005212633,"about_ca_system_score_codex":0.0007319654,"about_ca_system_score_gemma":0.00043666683,"threshold_uncertainty_score":0.027567387},"labels":[],"label_agreement":null},{"id":"W85472367","doi":"10.1007/978-3-642-23687-7_40","title":"Content Makes the Difference in Compression Standard Quality Assessment","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","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":"Université de Sherbrooke","funders":"","keywords":"JPEG 2000; Computer science; JPEG; Image compression; Artificial intelligence; Image quality; Compression (physics); Computer vision; Data compression; Image processing; Image (mathematics)","score_opus":0.08622401803913511,"score_gpt":0.33505408543867204,"score_spread":0.24883006739953695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85472367","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.5005867,0.013525741,0.3182161,0.007695047,0.003200903,0.00045663898,0.0017122396,0.0034241523,0.15118259],"genre_scores_gemma":[0.9185028,0.0029966203,0.056531522,0.0010975972,0.0010718233,0.00007032176,0.0010386893,0.0017394281,0.016951183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609727,0.00084976124,0.00024665231,0.00042380678,0.0021863014,0.00019621602],"domain_scores_gemma":[0.9736042,0.014697029,0.0011199485,0.0026007292,0.007421836,0.00055614446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004528922,0.00068575627,0.0006263607,0.0021088447,0.00044557595,0.005198282,0.0007970295,0.001828184,0.008107581],"category_scores_gemma":[0.03851609,0.00041592674,0.0004571039,0.001644279,0.0013844623,0.0060675987,0.0012082596,0.0011782348,0.0040140375],"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.0033782183,0.00024094366,0.04138791,0.0008811882,0.0003383764,0.00051593117,0.0010551603,0.005988801,0.14605977,0.030988066,0.010591073,0.75857455],"study_design_scores_gemma":[0.00034751694,0.002571605,0.22092308,0.0014485787,0.002337378,0.0050564003,0.0025882013,0.12871595,0.43590707,0.13022652,0.06936405,0.0005135546],"about_ca_topic_score_codex":0.0008809692,"about_ca_topic_score_gemma":0.0011846777,"teacher_disagreement_score":0.008107581,"about_ca_system_score_codex":0.00077496923,"about_ca_system_score_gemma":0.00047628747,"threshold_uncertainty_score":0.027122557},"labels":[],"label_agreement":null},{"id":"W85532711","doi":"10.1007/978-3-642-30779-9_31","title":"A Smart Home 3D Modeling Approach for Spatiotemporal Analysis","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Context-Aware Activity Recognition 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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Adaptation (eye); Apartment; Home automation; Object (grammar); Sample (material); Database; Real-time computing; Artificial intelligence; Telecommunications","score_opus":0.04891736990703175,"score_gpt":0.26156920749347895,"score_spread":0.2126518375864472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85532711","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.0010420221,0.00006387188,0.99623245,0.00003347405,0.00001945409,0.00002296832,0.00022366775,0.0013507466,0.0010113349],"genre_scores_gemma":[0.07227453,0.00064489746,0.91956675,0.00010310666,0.000041363688,0.00017625993,0.0015297044,0.00058270234,0.0050806883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997794,0.000027037,0.000015940774,0.000054152675,0.000106653024,0.000016800564],"domain_scores_gemma":[0.99986005,0.00003240508,0.000010712213,0.000034870372,0.000050141847,0.000011799674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022813703,0.001084261,0.0010927634,0.0011812582,0.00049910124,0.0016733117,0.0014944737,0.0009533451,0.005456751],"category_scores_gemma":[0.0005918375,0.0008955742,0.0019065557,0.0015510921,0.00030900372,0.0008854066,0.0013678089,0.0008379678,0.002825915],"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.00012251898,0.00015808523,0.0020204394,0.00026909652,0.00024849956,0.0006272926,0.0006429945,0.39806908,0.030091416,0.037706178,0.02406566,0.50597876],"study_design_scores_gemma":[0.0000054968355,0.000012118999,0.00029198322,0.000014525431,0.000026687556,0.0001762476,0.000051883402,0.9787567,0.0031212966,0.0072342497,0.010285815,0.000022925751],"about_ca_topic_score_codex":0.010633703,"about_ca_topic_score_gemma":0.017730102,"teacher_disagreement_score":0.010633703,"about_ca_system_score_codex":0.0004228411,"about_ca_system_score_gemma":0.0006981991,"threshold_uncertainty_score":0.021143615},"labels":[],"label_agreement":null},{"id":"W85643276","doi":"10.1007/978-3-642-37658-0_21","title":"Language and Architecture Independent Software Thread-Level Speculation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","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":"McGill University","funders":"","keywords":"Computer science; Speculation; Compiler; Thread (computing); Programming language; Software; Architecture; Operating system; Parallel computing; Software engineering; Computer architecture","score_opus":0.017785509648132396,"score_gpt":0.24815490624143507,"score_spread":0.2303693965933027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85643276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086061165,0.0024287992,0.85666853,0.00083050353,0.0006800996,0.000096891956,0.00019990678,0.008525769,0.04450828],"genre_scores_gemma":[0.73440105,0.001111262,0.22940852,0.00048549336,0.00037448283,0.00021464744,0.0004889518,0.0023239034,0.031191709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991254,0.00015302155,0.00006241726,0.00012286684,0.00037287775,0.00016331291],"domain_scores_gemma":[0.99787474,0.0005002919,0.00014551452,0.0010505281,0.00035331264,0.000075683114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008828452,0.0005998462,0.0006087001,0.0007001271,0.00065891753,0.0016446694,0.0015244612,0.00069378136,0.0054567643],"category_scores_gemma":[0.0036477246,0.00073218264,0.00091640407,0.0010612685,0.0012476203,0.0030001611,0.0022757452,0.0023915772,0.0014774561],"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.0005244882,0.00013643746,0.0024879796,0.00039504195,0.00010406663,0.00035597698,0.0007239573,0.037320998,0.045400713,0.66800684,0.015573016,0.2289706],"study_design_scores_gemma":[0.00007540039,0.00019050857,0.0011195465,0.00009282387,0.0001559815,0.0005001722,0.00011691591,0.35004118,0.04561485,0.56269675,0.03931226,0.000083726256],"about_ca_topic_score_codex":0.0007427138,"about_ca_topic_score_gemma":0.001449364,"teacher_disagreement_score":0.0054567643,"about_ca_system_score_codex":0.00067934353,"about_ca_system_score_gemma":0.0014057449,"threshold_uncertainty_score":0.018254757},"labels":[],"label_agreement":null},{"id":"W85801641","doi":"10.1007/978-3-540-39671-0_12","title":"Managing the Performance Impact of Administrative Utilities","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"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":"Business; Computer science","score_opus":0.03179946764888352,"score_gpt":0.2950213072813216,"score_spread":0.26322183963243806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85801641","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.6936221,0.0015927978,0.19039714,0.0033481172,0.0002866958,0.00018006496,0.00031168698,0.005836278,0.10442515],"genre_scores_gemma":[0.98423713,0.00024156216,0.01034191,0.000065784334,0.00008464335,0.000023472396,0.00010999911,0.00032431178,0.004571214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972715,0.0008075337,0.000081795035,0.00020547959,0.0009308405,0.00070283026],"domain_scores_gemma":[0.9877679,0.006744993,0.0008270785,0.0021269927,0.0018329225,0.00070014235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027612494,0.0007821416,0.00056380965,0.0009921693,0.0013609099,0.0047216597,0.0025149144,0.0008534367,0.0064598834],"category_scores_gemma":[0.019903347,0.00048221226,0.00029782866,0.0019247284,0.0009834105,0.0054664663,0.0018772234,0.0019710436,0.0014018273],"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.0019156231,0.0009189121,0.01713709,0.00022050546,0.000099473335,0.000703069,0.0010045253,0.35320452,0.035821263,0.12307884,0.020117939,0.44577822],"study_design_scores_gemma":[0.00010757758,0.00044020405,0.008657252,0.000038625534,0.00014005603,0.00025808197,0.0008980698,0.85720265,0.03323627,0.07945786,0.019498177,0.000065210035],"about_ca_topic_score_codex":0.0023679773,"about_ca_topic_score_gemma":0.0025399064,"teacher_disagreement_score":0.0064598834,"about_ca_system_score_codex":0.0015629445,"about_ca_system_score_gemma":0.0016425358,"threshold_uncertainty_score":0.021610498},"labels":[],"label_agreement":null},{"id":"W85822258","doi":"10.1007/978-3-319-06483-3_10","title":"Analyzing User Trajectories from Mobile Device Data with Hierarchical Dirichlet Processes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Trajectory; Latent Dirichlet allocation; Hierarchical Dirichlet process; Variety (cybernetics); Cluster analysis; Hierarchical clustering; Domain (mathematical analysis); Artificial intelligence; Dirichlet distribution; Human–computer interaction; Data mining; Machine learning; Topic model","score_opus":0.022440963865522252,"score_gpt":0.25676246133965075,"score_spread":0.2343214974741285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85822258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070758685,0.0015272518,0.92446476,0.0005621706,0.00015323183,0.00010046803,0.001078184,0.00075642555,0.00059890136],"genre_scores_gemma":[0.748701,0.0022434082,0.23522276,0.00023274758,0.00073358795,0.00045944995,0.0062723323,0.00029117457,0.0058436333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961443,0.0017301824,0.00022580975,0.0009988138,0.00046151906,0.00043942092],"domain_scores_gemma":[0.985827,0.012032568,0.00044647107,0.0010493803,0.00042152213,0.00022303815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006042577,0.0014225128,0.0025731202,0.0030104348,0.0009927924,0.0021265573,0.002966767,0.0023423021,0.0014316501],"category_scores_gemma":[0.016404249,0.0018308416,0.0039717415,0.0044518844,0.0015848208,0.0034591407,0.0029139568,0.0039725057,0.0013835292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081836677,0.00040252123,0.022748172,0.0004153733,0.0007489215,0.00031873616,0.0012904016,0.73372245,0.0032903403,0.028551068,0.0049883886,0.20270522],"study_design_scores_gemma":[0.000008999579,0.000030046214,0.0015089266,0.00001989592,0.00003530814,0.0000403089,0.000093850605,0.9801676,0.00040516944,0.01713309,0.00053630414,0.000020378464],"about_ca_topic_score_codex":0.017329434,"about_ca_topic_score_gemma":0.020606153,"teacher_disagreement_score":0.017329434,"about_ca_system_score_codex":0.0014072473,"about_ca_system_score_gemma":0.0014633351,"threshold_uncertainty_score":0.034457088},"labels":[],"label_agreement":null},{"id":"W85843916","doi":"10.1007/978-3-642-28717-6_4","title":"Enfragmo: A System for Modelling and Solving Search Problems with Logic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Propositional calculus; Specification language; Programming language; Extension (predicate logic); Solver; Problem solver; Boolean satisfiability problem; Theoretical computer science; Software engineering","score_opus":0.036109215693184635,"score_gpt":0.2413221561729942,"score_spread":0.2052129404798096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85843916","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.005660109,0.00042640988,0.8625774,0.00032209832,0.00009452151,0.00026840117,0.0040725414,0.1165624,0.010016081],"genre_scores_gemma":[0.08566088,0.000836158,0.88327986,0.00051818806,0.000063079235,0.0007722186,0.008625499,0.008738913,0.011505214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993261,0.00019058022,0.00007668663,0.00016687014,0.00017382126,0.000065903034],"domain_scores_gemma":[0.9991327,0.00051308726,0.000050858318,0.00017270312,0.0000861435,0.00004451265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281859,0.0014218565,0.00079018966,0.0015110048,0.0007618092,0.0025859638,0.0036043802,0.0016541957,0.024168488],"category_scores_gemma":[0.0041234377,0.0010876035,0.002158233,0.0008239449,0.00082888006,0.004871757,0.002620738,0.0020928106,0.0056482763],"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.0018696635,0.00041427248,0.0038367743,0.0030836228,0.00035664614,0.00071049924,0.0012085538,0.121303834,0.019092487,0.2571978,0.12583585,0.46509],"study_design_scores_gemma":[0.00033114752,0.000120100915,0.0006327144,0.0002567048,0.00018873185,0.00051826943,0.000104826024,0.6213712,0.017229965,0.12430027,0.23482342,0.00012265927],"about_ca_topic_score_codex":0.005609582,"about_ca_topic_score_gemma":0.008561601,"teacher_disagreement_score":0.024168488,"about_ca_system_score_codex":0.001240718,"about_ca_system_score_gemma":0.0016652225,"threshold_uncertainty_score":0.080851674},"labels":[],"label_agreement":null},{"id":"W86163538","doi":"10.1007/978-3-642-39666-3_8","title":"An Ontology-Based Reasoning Approach for Electric Power Utilities","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Hydro-Québec","funders":"","keywords":"Computer science; Ontology; Expressive power; Electric power; Power (physics); Artificial intelligence; Theoretical computer science; Epistemology","score_opus":0.021259104125215166,"score_gpt":0.2525050600601676,"score_spread":0.23124595593495242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86163538","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.0033688415,0.0004370038,0.9780398,0.00050713733,0.00011378073,0.00013016207,0.00040094668,0.00096082315,0.016041601],"genre_scores_gemma":[0.07672076,0.00095515634,0.9102805,0.00023863575,0.00006643058,0.00015669217,0.0013422014,0.00019920841,0.010040394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989605,0.00022360982,0.00012632342,0.00017729036,0.0004399686,0.0000722281],"domain_scores_gemma":[0.99952567,0.00022147966,0.00003142256,0.000077141136,0.000115531846,0.000028697248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012835041,0.00079190044,0.00069429656,0.0022034675,0.0013894585,0.0040381793,0.0026500206,0.0013304562,0.006701933],"category_scores_gemma":[0.002240058,0.0007034269,0.002482114,0.002508387,0.00093349075,0.006396353,0.0023670322,0.002058959,0.0014100388],"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.00006765746,0.00025902782,0.00053537614,0.00043838966,0.00015164462,0.0011637309,0.0014533553,0.044973493,0.0050830473,0.7138159,0.014246327,0.21781197],"study_design_scores_gemma":[0.000039730894,0.000029064886,0.00036145438,0.00022615421,0.00020734176,0.0005965642,0.0006738271,0.30347022,0.0048752204,0.5293446,0.1601155,0.00006022896],"about_ca_topic_score_codex":0.011837978,"about_ca_topic_score_gemma":0.019687293,"teacher_disagreement_score":0.011837978,"about_ca_system_score_codex":0.0012123269,"about_ca_system_score_gemma":0.0017795482,"threshold_uncertainty_score":0.023538172},"labels":[],"label_agreement":null},{"id":"W86715028","doi":"10.1007/978-3-642-33415-3_39","title":"Intrinsic Melanin and Hemoglobin Colour Components for Skin Lesion Malignancy Detection","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","cited_by":28,"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":"Artificial intelligence; Computer science; RGB color model; Thresholding; Computer vision; Segmentation; Context (archaeology); Pattern recognition (psychology); Image (mathematics)","score_opus":0.01985092632132566,"score_gpt":0.26476546047683824,"score_spread":0.2449145341555126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86715028","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.8222399,0.0053979442,0.16592197,0.00030310696,0.000115025905,0.000100213205,0.00045140155,0.00077166985,0.004698731],"genre_scores_gemma":[0.93541217,0.0018944739,0.059929557,0.000054723434,0.000081882106,0.00003571335,0.00022721637,0.000050453607,0.0023138835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998652,0.00003775191,0.000007790577,0.00001935866,0.0000489921,0.000020988029],"domain_scores_gemma":[0.99946886,0.0002498654,0.00004434413,0.000030218045,0.00015238172,0.000054334054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042490588,0.00029882556,0.00029425017,0.0014229104,0.00013566314,0.0005269822,0.0002352872,0.0003988133,0.0015524671],"category_scores_gemma":[0.0012154111,0.00015678056,0.00026178817,0.00046985957,0.00014542816,0.00038507007,0.00030401678,0.0003570101,0.0005449301],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022892,0.0002082525,0.069192424,0.00031776103,0.00012043974,0.0005412173,0.000099091536,0.0051126275,0.32560638,0.00077418674,0.0018586586,0.5938798],"study_design_scores_gemma":[0.00009163625,0.0008794635,0.19513519,0.000100574514,0.0005301717,0.005098641,0.00030226915,0.46899694,0.3212131,0.0018102239,0.005748698,0.00009307931],"about_ca_topic_score_codex":0.0007952103,"about_ca_topic_score_gemma":0.0013502712,"teacher_disagreement_score":0.0015524671,"about_ca_system_score_codex":0.00017135346,"about_ca_system_score_gemma":0.00017763619,"threshold_uncertainty_score":0.0051935315},"labels":[],"label_agreement":null},{"id":"W86880533","doi":"10.1007/978-3-642-37192-9_44","title":"CodeMonkey; a GUI Driven Platform for Swift Synthesis of Evolutionary Algorithms in Java","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","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":"Concordia University","funders":"","keywords":"Computer science; Java; Swift; Eclipse; Programming language; Plug-in; Evolutionary algorithm; Architecture; Software engineering; Code (set theory); Simple (philosophy); Operating system; Software; Source code; Artificial intelligence; Set (abstract data type)","score_opus":0.01862146126745619,"score_gpt":0.245575392731098,"score_spread":0.2269539314636418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86880533","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004359382,0.00017797323,0.8683615,0.000087329936,0.00012547348,0.00013543983,0.001001864,0.11813789,0.0076132584],"genre_scores_gemma":[0.1145522,0.0005571173,0.75614816,0.00051706855,0.00007344749,0.0009946902,0.0054744426,0.100328386,0.02135441],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999401,0.00010805892,0.00005413961,0.00012010115,0.00023890797,0.00007796356],"domain_scores_gemma":[0.9986927,0.00085933664,0.00006960604,0.0001609936,0.00015331134,0.00006402972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010800981,0.0012961173,0.0007663282,0.0009183178,0.000379999,0.0013828975,0.0024580972,0.0009972868,0.034853574],"category_scores_gemma":[0.0036548597,0.0010367177,0.0011332381,0.0005988757,0.0005266086,0.0012511482,0.0012057206,0.0016773369,0.008812596],"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.0013517402,0.00048713447,0.0028826594,0.002249915,0.00037283025,0.0009763259,0.00066922064,0.06656691,0.10668725,0.048342198,0.16463733,0.6047765],"study_design_scores_gemma":[0.0009773833,0.00028174126,0.0021444152,0.00031000498,0.00017262538,0.0009842842,0.000112733316,0.5984357,0.12502867,0.04542853,0.22589426,0.00022963647],"about_ca_topic_score_codex":0.001381226,"about_ca_topic_score_gemma":0.0022802078,"teacher_disagreement_score":0.034853574,"about_ca_system_score_codex":0.0004473097,"about_ca_system_score_gemma":0.0009320723,"threshold_uncertainty_score":0.11659682},"labels":[],"label_agreement":null},{"id":"W8691679","doi":"10.1007/978-3-642-33065-0_5","title":"Maintaining Consistency in Software Transactional Memory through Dynamic Versioning Tuning","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"Lakehead University","funders":"","keywords":"Transactional memory; Computer science; Cache coherence; Software transactional memory; Software versioning; Commit; Consistency (knowledge bases); Cache; Consistency model; Thread (computing); Operating system; Distributed computing; Parallel computing; Software; CPU cache; Database transaction; Programming language; Database; Cache algorithms; Data consistency","score_opus":0.016142643435037764,"score_gpt":0.24364800180672097,"score_spread":0.2275053583716832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8691679","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.16615672,0.0022436082,0.8156861,0.00036449914,0.00024257525,0.00007159468,0.000079039244,0.007085566,0.008070284],"genre_scores_gemma":[0.8638522,0.000401913,0.13133055,0.00010394259,0.00009050234,0.000060148985,0.00012530171,0.0007779701,0.0032574553],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980565,0.00040058707,0.00019064713,0.00030698,0.000839253,0.00020609623],"domain_scores_gemma":[0.99252397,0.0023776232,0.0004107959,0.003802362,0.00074266974,0.00014262713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020201297,0.00042368946,0.00075463107,0.00074040756,0.000665195,0.0023468863,0.0030163687,0.00077166304,0.0018862409],"category_scores_gemma":[0.010596514,0.0007179336,0.0003672617,0.0014123403,0.0009294483,0.0038447124,0.001552892,0.0019360919,0.0005352872],"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.0006863125,0.00033629767,0.0037722164,0.00029396085,0.00010643247,0.0002248232,0.00065070385,0.12211775,0.11681814,0.05904733,0.004941554,0.6910045],"study_design_scores_gemma":[0.00010834007,0.00022694428,0.0011045756,0.000051226467,0.00011411997,0.0003577765,0.00011672692,0.82851875,0.089668274,0.071140535,0.008514617,0.00007801039],"about_ca_topic_score_codex":0.0005258805,"about_ca_topic_score_gemma":0.0006123334,"teacher_disagreement_score":0.0030163687,"about_ca_system_score_codex":0.0005684144,"about_ca_system_score_gemma":0.0006732165,"threshold_uncertainty_score":0.010683596},"labels":[],"label_agreement":null},{"id":"W86969342","doi":"10.1007/978-3-642-39094-4_17","title":"Sign Language Recognition Using Hilbert Curve Features","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Hand Gesture Recognition 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":"Wilfrid Laurier University","funders":"","keywords":"Hilbert curve; Computer science; Gesture; Gesture recognition; Hilbert space; Artificial intelligence; Support vector machine; Feature vector; Invariant (physics); Pixel; Pattern recognition (psychology); Reproducing kernel Hilbert space; Classifier (UML); Representation (politics); Computer vision; Translation (biology); Sign language; Algorithm; Mathematics; Mathematical analysis","score_opus":0.028768233048463827,"score_gpt":0.2599323129668825,"score_spread":0.2311640799184187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86969342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027268622,0.0005439318,0.96451527,0.000100943515,0.000091503956,0.00003717136,0.0001396696,0.0022949642,0.005007894],"genre_scores_gemma":[0.48031226,0.0013722627,0.48874044,0.00012392347,0.00012965931,0.000105499676,0.0012076425,0.00045107305,0.027557265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.00004095609,0.000018569406,0.000055753688,0.00015417697,0.000039216957],"domain_scores_gemma":[0.99959475,0.0001115341,0.000026939691,0.00007953859,0.00015975029,0.000027431472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037205254,0.00047243026,0.0007234915,0.0010815602,0.00019709254,0.00094555237,0.0006022531,0.0005246381,0.004928091],"category_scores_gemma":[0.0009549237,0.00020858496,0.00045148618,0.0011411645,0.0004090729,0.0015602948,0.000831363,0.00054380856,0.0038761809],"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.00009490415,0.000042900847,0.0007173849,0.0000721354,0.000026692262,0.00008511357,0.00004256285,0.008777434,0.08906051,0.0065794853,0.003914031,0.890587],"study_design_scores_gemma":[0.000022747436,0.00028803223,0.0033111733,0.000051912863,0.00004672312,0.0009589768,0.00009692424,0.77954245,0.17980652,0.013156653,0.022628522,0.00008934906],"about_ca_topic_score_codex":0.0008349033,"about_ca_topic_score_gemma":0.0010202889,"teacher_disagreement_score":0.004928091,"about_ca_system_score_codex":0.0002669954,"about_ca_system_score_gemma":0.00045258133,"threshold_uncertainty_score":0.016486049},"labels":[],"label_agreement":null},{"id":"W86994275","doi":"10.1007/978-3-642-33503-7_23","title":"Motion Recovery of Parallel Manipulators Using Task-Decomposition Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","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":"Task (project management); Computer science; Obstacle avoidance; Decomposition; Fault tolerance; Singularity; Manipulator (device); Fault (geology); Motion (physics); Artificial intelligence; Control theory (sociology); Distributed computing; Mathematics; Robot; Engineering","score_opus":0.02047301436872613,"score_gpt":0.22459770791238204,"score_spread":0.20412469354365592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86994275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013599727,0.000103792976,0.9848258,0.000027688488,0.00001861296,0.000022683653,0.000023179053,0.00017332046,0.0012053465],"genre_scores_gemma":[0.39875904,0.00026133296,0.59465903,0.000043937733,0.000028538305,0.00017545283,0.00030019577,0.00012177568,0.0056507844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998184,0.000033947876,0.000010686932,0.000044913962,0.00006330135,0.000028720056],"domain_scores_gemma":[0.9998085,0.000054122185,0.000031193038,0.00004449287,0.000048115468,0.000013573869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034992665,0.0009858565,0.000876177,0.00040645082,0.00042728754,0.00034093892,0.00068131916,0.00064261106,0.0022331232],"category_scores_gemma":[0.00069792266,0.00043612666,0.000678227,0.0004980469,0.00034254856,0.00063148356,0.0011181026,0.0007492829,0.00055994495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038194403,0.00010571727,0.00036737754,0.0002886347,0.00007978459,0.00021493062,0.0001294323,0.6507137,0.057251018,0.011717123,0.001959241,0.276791],"study_design_scores_gemma":[0.000010034121,0.000064688444,0.00013915722,0.000007926342,0.000009413321,0.000054471733,0.000016035121,0.99220145,0.0028505474,0.00388279,0.00075677846,0.0000066599296],"about_ca_topic_score_codex":0.0017015104,"about_ca_topic_score_gemma":0.00126653,"teacher_disagreement_score":0.0022331232,"about_ca_system_score_codex":0.0001803749,"about_ca_system_score_gemma":0.00048291555,"threshold_uncertainty_score":0.007470548},"labels":[],"label_agreement":null},{"id":"W87086807","doi":"10.1007/978-3-642-23041-7_23","title":"Mobile Agent Code Updating and Authentication Protocol for Code-Centric RFID System","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RFID technology advancements","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 British Columbia","funders":"","keywords":"Computer science; Authentication (law); Code (set theory); Mobile agent; Authentication protocol; Protocol (science); Tracing; Identification (biology); Computer security; Embedded system; Computer network; Operating system; Programming language","score_opus":0.020146226374991336,"score_gpt":0.2628901510342149,"score_spread":0.2427439246592236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87086807","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.0499907,0.001818734,0.9157842,0.00053050334,0.0008205986,0.00064102974,0.00023038048,0.008067219,0.02211668],"genre_scores_gemma":[0.74744666,0.0012586209,0.2026332,0.0003745964,0.00036330993,0.0007656633,0.0007800851,0.00031917857,0.046058685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909174,0.00017349071,0.000093175666,0.000148173,0.00035120748,0.00014219224],"domain_scores_gemma":[0.9985489,0.0001910565,0.00015744503,0.00040608607,0.00061118667,0.00008532443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007790011,0.00049462775,0.0005934821,0.00076019054,0.00093825004,0.0014746176,0.0012823952,0.0011452122,0.002625592],"category_scores_gemma":[0.0019211054,0.00031859128,0.00029697976,0.0006611566,0.0004664884,0.0019676706,0.0015105632,0.0015266794,0.0018182071],"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.0018712321,0.0004518953,0.0020350965,0.0007140966,0.0001258014,0.0015747745,0.0013259508,0.019695522,0.20043805,0.14794454,0.045426466,0.57839656],"study_design_scores_gemma":[0.00027238956,0.0011398474,0.0018858357,0.00016433938,0.0002902219,0.0046940506,0.00030654302,0.44821504,0.32584774,0.030561794,0.18635835,0.00026380562],"about_ca_topic_score_codex":0.0007364763,"about_ca_topic_score_gemma":0.0006498549,"teacher_disagreement_score":0.002625592,"about_ca_system_score_codex":0.00051397365,"about_ca_system_score_gemma":0.0011297879,"threshold_uncertainty_score":0.00878346},"labels":[],"label_agreement":null},{"id":"W87402359","doi":"10.1007/978-3-642-41533-3_19","title":"Model Checking of UML-RT Models Using Lazy Composition","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","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":"Queen's University","funders":"","keywords":"Unified Modeling Language; Composition (language); Computer science; Programming language; Model checking; Linguistics; Philosophy; Software","score_opus":0.06041695663218916,"score_gpt":0.2775955526916666,"score_spread":0.21717859605947742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87402359","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.025866136,0.00009536228,0.96825063,0.00007213338,0.000036036796,0.00008082408,0.00005046736,0.004046241,0.0015020982],"genre_scores_gemma":[0.5199313,0.00022010581,0.47244886,0.00009537797,0.00005088702,0.0001845617,0.00034970068,0.0019994597,0.0047197803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943625,0.0019456029,0.00033546798,0.00062531314,0.002194619,0.00053655816],"domain_scores_gemma":[0.9936227,0.0033833156,0.0006513145,0.0015962048,0.00062048243,0.0001259809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004126188,0.0013147503,0.0014761301,0.0015889035,0.0011735159,0.0021745886,0.0026713184,0.001367542,0.0038883623],"category_scores_gemma":[0.010635002,0.0018755132,0.003787251,0.0009280368,0.001998889,0.004700754,0.0033852807,0.003048274,0.0009310241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007587797,0.00023938615,0.002894151,0.00059673795,0.00036378918,0.0006976214,0.0009811859,0.63867676,0.043660596,0.17961195,0.001880048,0.12963906],"study_design_scores_gemma":[0.00008095887,0.000076811666,0.00020992586,0.00007391748,0.00012859044,0.000103630955,0.000056233235,0.86771923,0.03030748,0.09874464,0.0024612092,0.00003726515],"about_ca_topic_score_codex":0.004274298,"about_ca_topic_score_gemma":0.007408836,"teacher_disagreement_score":0.004274298,"about_ca_system_score_codex":0.0012304239,"about_ca_system_score_gemma":0.002256943,"threshold_uncertainty_score":0.021821618},"labels":[],"label_agreement":null},{"id":"W87420547","doi":"10.1007/978-3-642-33212-8_13","title":"Facial Expression Recognition Using Game Theory","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face recognition and analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Biometrics; Facial expression; Facial expression recognition; Artificial intelligence; Facial recognition system; Pattern recognition (psychology); Set (abstract data type); Scheme (mathematics); Curse of dimensionality; Expression (computer science); Dimensionality reduction; Mathematics","score_opus":0.03666170192911429,"score_gpt":0.26138750582569253,"score_spread":0.22472580389657826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87420547","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.011292677,0.00027414184,0.97146654,0.00013545403,0.000074118354,0.000089149566,0.00008102582,0.0005444186,0.016042333],"genre_scores_gemma":[0.4831987,0.0006161698,0.48116112,0.00011581641,0.000040208797,0.0002777163,0.00030485142,0.00022031585,0.034065034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999694,0.00009196121,0.000012201978,0.00006228196,0.00009806955,0.000041564803],"domain_scores_gemma":[0.9998516,0.000071044386,0.0000076150213,0.000020174442,0.000038712158,0.000010846885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046568754,0.00057866256,0.0006405532,0.00039168875,0.00029475612,0.0010647217,0.0009293406,0.00043478445,0.0061470843],"category_scores_gemma":[0.0009729419,0.0003067018,0.00059406954,0.0003220175,0.00039528246,0.0008294102,0.0006845679,0.000629779,0.001412041],"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.00022350874,0.0001852336,0.0011285043,0.00017161558,0.00012584723,0.000123242,0.0002273819,0.15851374,0.04851127,0.12567854,0.009712487,0.65539855],"study_design_scores_gemma":[0.000014866901,0.000075255295,0.00072511425,0.000023001465,0.000023680808,0.00011262842,0.000064598345,0.94557273,0.00882283,0.038449775,0.0060914345,0.000024167453],"about_ca_topic_score_codex":0.0028588683,"about_ca_topic_score_gemma":0.0031324658,"teacher_disagreement_score":0.0061470843,"about_ca_system_score_codex":0.0006067158,"about_ca_system_score_gemma":0.00041933358,"threshold_uncertainty_score":0.02056408},"labels":[],"label_agreement":null},{"id":"W88088745","doi":"10.1007/978-3-662-43936-4_6","title":"Secure and Privacy-Preserving Querying of Personal Health Records in the Cloud","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","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":"Concordia University","funders":"","keywords":"Paillier cryptosystem; Homomorphic encryption; Computer science; Encryption; Cloud computing; Outsourcing; Protocol (science); Computer security; Cryptosystem; Internet privacy; Hybrid cryptosystem; Medicine; Business","score_opus":0.019499260651934292,"score_gpt":0.25794056563181145,"score_spread":0.23844130497987714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88088745","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.09379592,0.0033241885,0.88377374,0.0043062135,0.00034119704,0.0003604594,0.0018925815,0.0029529424,0.009252792],"genre_scores_gemma":[0.888538,0.0019626757,0.100806676,0.0006453868,0.0003169001,0.000115682895,0.0017349994,0.00014826098,0.005731467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944759,0.0010541374,0.0005508842,0.0006669317,0.0024022516,0.0008499556],"domain_scores_gemma":[0.9924544,0.002026947,0.0005516151,0.004167027,0.00055754173,0.00024237929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038058807,0.00044159064,0.001469217,0.0008133662,0.0012343692,0.0046024956,0.002577798,0.00144783,0.002046431],"category_scores_gemma":[0.008178359,0.0005385702,0.0010317316,0.0026684783,0.0014800057,0.005936402,0.0053380835,0.0016902447,0.001292309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004258272,0.00069453346,0.014163791,0.0008153161,0.0004421294,0.0022311653,0.002806866,0.07645229,0.06570739,0.31202132,0.040931042,0.47947595],"study_design_scores_gemma":[0.0002527225,0.00034915024,0.0044161147,0.00016209198,0.0002073801,0.0038744095,0.0014982704,0.60617846,0.0687765,0.27889925,0.03527679,0.00010886825],"about_ca_topic_score_codex":0.0022582158,"about_ca_topic_score_gemma":0.0017631046,"teacher_disagreement_score":0.0046024956,"about_ca_system_score_codex":0.001109697,"about_ca_system_score_gemma":0.0026536183,"threshold_uncertainty_score":0.020127654},"labels":[],"label_agreement":null},{"id":"W88103190","doi":"10.1007/978-3-642-30618-1_7","title":"Non-iterative Multi-modal Partial View to Full View Image Registration Using Local Phase-Based Image Projections","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Image registration; Artificial intelligence; Computer vision; Imaging phantom; Image (mathematics); Nuclear medicine; Medicine","score_opus":0.04260968072371878,"score_gpt":0.349371015160372,"score_spread":0.3067613344366532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88103190","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.002775307,0.00017640604,0.9957367,0.00003192968,0.0000215823,0.000029251016,0.00002745139,0.00039728286,0.00080414],"genre_scores_gemma":[0.048277304,0.00040961182,0.9473907,0.000057719175,0.000026039503,0.000098982004,0.00022247918,0.00044672162,0.0030704236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992354,0.00016269568,0.000054586315,0.00014825481,0.00035087447,0.000048172667],"domain_scores_gemma":[0.9991054,0.00030475185,0.00009517014,0.00028138718,0.00017455773,0.000038667553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009387299,0.0008514471,0.0011615985,0.00075836066,0.00041024716,0.0018398227,0.0014665436,0.0010953549,0.0040130843],"category_scores_gemma":[0.0025121325,0.0010324194,0.0015192623,0.0012186407,0.0006400946,0.002008143,0.0027654343,0.0015789557,0.0020535004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047936864,0.00014003554,0.0006993375,0.00069578015,0.00034442317,0.0003216871,0.0004015559,0.04940406,0.19305015,0.021385405,0.005469646,0.7276085],"study_design_scores_gemma":[0.00005970236,0.00035269622,0.0018869146,0.00008612674,0.00022321135,0.004389246,0.0001536657,0.78820515,0.16552632,0.020575946,0.018408144,0.00013289173],"about_ca_topic_score_codex":0.0008967847,"about_ca_topic_score_gemma":0.002035928,"teacher_disagreement_score":0.0040130843,"about_ca_system_score_codex":0.00031994152,"about_ca_system_score_gemma":0.0010202156,"threshold_uncertainty_score":0.013425112},"labels":[],"label_agreement":null},{"id":"W88124885","doi":"10.1007/978-3-662-46018-4_10","title":"Minimum Latency Aggregation Scheduling in Wireless Sensor Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","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":"Concordia University","funders":"","keywords":"Computer science; Wireless sensor network; Latency (audio); Scheduling (production processes); Sink (geography); Computer network; Data transmission; Distributed computing; Real-time computing; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.019891345494657407,"score_gpt":0.2398170988170839,"score_spread":0.2199257533224265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88124885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029595664,0.013015885,0.94084626,0.0007267841,0.0012745262,0.000061855906,0.00011762651,0.0007324407,0.013628906],"genre_scores_gemma":[0.73077786,0.011090096,0.23458838,0.00025421506,0.001355623,0.00019051417,0.00033892418,0.0004225307,0.020981757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996253,0.00010537213,0.000024214654,0.000062341256,0.00013603641,0.000046663667],"domain_scores_gemma":[0.9995146,0.00026290637,0.000040771432,0.00006563971,0.00008852851,0.000027540567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006580637,0.0007202956,0.0006672556,0.00034404194,0.00038403826,0.00083334267,0.0011295156,0.00037230196,0.0014657353],"category_scores_gemma":[0.0015067138,0.00029701486,0.00021548703,0.0011844599,0.0003096413,0.0009895316,0.00047854532,0.0008768273,0.0003591428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044001595,0.00014107114,0.00029729525,0.0005384077,0.000055760705,0.00009336335,0.00013972766,0.48961917,0.01652735,0.11480692,0.018709118,0.35863182],"study_design_scores_gemma":[0.000023069158,0.00008564336,0.00024374336,0.000033773853,0.000017815792,0.00006147307,0.000034347253,0.9262412,0.0037358662,0.057948466,0.01156282,0.0000118235],"about_ca_topic_score_codex":0.0009990366,"about_ca_topic_score_gemma":0.0012624003,"teacher_disagreement_score":0.0014657353,"about_ca_system_score_codex":0.00093130936,"about_ca_system_score_gemma":0.0006926661,"threshold_uncertainty_score":0.00675714},"labels":[],"label_agreement":null},{"id":"W882615793","doi":"10.1007/978-3-319-11520-7_58","title":"Bifurcations of Local Structure Maps as Predictors of Phase Transitions in Asynchronous Cellular Automata","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cellular Automata and Applications","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":"Brock University","funders":"","keywords":"Cellular automaton; Asynchronous communication; Computer science; Percolation (cognitive psychology); Directed percolation; Phase transition; Theoretical computer science; Class (philosophy); Automaton; Asynchronous cellular automaton; Order (exchange); Stochastic cellular automaton; Statistical physics; Algorithm; Discrete mathematics; Automata theory; Mathematics; Artificial intelligence; Mobile automaton; Critical exponent; Physics; Telecommunications; Condensed matter physics","score_opus":0.007651816787456101,"score_gpt":0.23224287062564936,"score_spread":0.22459105383819325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W882615793","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.77804166,0.0015624326,0.21012749,0.0004057025,0.000083176696,0.000047452577,0.00025106745,0.00054661225,0.008934351],"genre_scores_gemma":[0.994865,0.00020410166,0.0036778036,0.000012702611,0.000022485949,0.00001800175,0.00006826795,0.000035775498,0.0010956713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.000057774392,0.000009140052,0.00004145948,0.000032423923,0.000026227812],"domain_scores_gemma":[0.9960174,0.0029495568,0.00051140547,0.00012659346,0.00022513123,0.00016998724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070782006,0.0003784324,0.000586913,0.0015774199,0.00036260183,0.0012465446,0.00065537024,0.00074158504,0.0022064154],"category_scores_gemma":[0.006806255,0.00042041665,0.00045358785,0.00054148876,0.0009072341,0.00095688726,0.00079598435,0.0008286001,0.00029830777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043062333,0.00012045237,0.016186073,0.00027006335,0.00013045962,0.00048143498,0.0008374427,0.6493336,0.022378797,0.2469547,0.0028202168,0.060056165],"study_design_scores_gemma":[0.000009573798,0.000023577646,0.0022124322,0.000022131919,0.000013600248,0.00005498376,0.000034044115,0.9509136,0.0010996327,0.045418344,0.00017922025,0.000018758305],"about_ca_topic_score_codex":0.0006714836,"about_ca_topic_score_gemma":0.0006895101,"teacher_disagreement_score":0.0022064154,"about_ca_system_score_codex":0.00070893025,"about_ca_system_score_gemma":0.00022687609,"threshold_uncertainty_score":0.007381201},"labels":[],"label_agreement":null},{"id":"W8836454","doi":"10.1007/978-3-642-28332-1_24","title":"Polynomial-Time Algorithms for Learning Typed Pattern Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Time complexity; Algorithm; Polynomial; Theoretical computer science; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01286230419875984,"score_gpt":0.26352007957974477,"score_spread":0.25065777538098494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8836454","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.01420423,0.00069853413,0.9701431,0.0009828203,0.00014354516,0.00022120004,0.0011334367,0.006699571,0.0057734447],"genre_scores_gemma":[0.12239738,0.00066970865,0.86014163,0.00037295415,0.00018923375,0.0004966563,0.0047576535,0.0011654735,0.009809353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710304,0.00046155014,0.00029581806,0.0010721593,0.00072845287,0.00033901347],"domain_scores_gemma":[0.98735946,0.008347243,0.0005177573,0.0026289923,0.00082581415,0.00032067444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019476839,0.001956595,0.0019677035,0.001658962,0.001443661,0.004289008,0.00661985,0.0027062756,0.022536159],"category_scores_gemma":[0.014604124,0.0014808415,0.0033814893,0.0044300873,0.0016039198,0.012591403,0.003853527,0.005702024,0.0063904854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007459475,0.0006667787,0.0018138387,0.0010298955,0.00015881222,0.00010816572,0.0002963341,0.07158102,0.0046671564,0.10732809,0.03511453,0.7764895],"study_design_scores_gemma":[0.00030634433,0.000110683926,0.00031302104,0.00007447768,0.00010900337,0.00019003656,0.00017973159,0.47872338,0.004503984,0.5075698,0.007884049,0.000035532343],"about_ca_topic_score_codex":0.0036347208,"about_ca_topic_score_gemma":0.00849223,"teacher_disagreement_score":0.022536159,"about_ca_system_score_codex":0.0028060046,"about_ca_system_score_gemma":0.0035589968,"threshold_uncertainty_score":0.075390935},"labels":[],"label_agreement":null},{"id":"W88413441","doi":"10.1007/978-3-642-34859-4_6","title":"The Emergence of New Genes in EcoSim and Its Effect on Fitness","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Biology","score_opus":0.024167637508714063,"score_gpt":0.26538811532745504,"score_spread":0.24122047781874098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88413441","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.9567128,0.0014255901,0.025106547,0.0008818072,0.000102557104,0.000007919691,0.000075213204,0.00016939442,0.015518188],"genre_scores_gemma":[0.99268615,0.00030662498,0.0051677353,0.00006398062,0.000021655833,0.00000940417,0.000022699447,0.00007028036,0.0016514737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998344,0.00006607435,0.000006675571,0.000036373087,0.000031876934,0.000024635568],"domain_scores_gemma":[0.9975528,0.0018274152,0.00015270292,0.00015035068,0.00013613307,0.00018061209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005744168,0.00032275546,0.00048629043,0.0003969432,0.0005411769,0.0012954688,0.0005337844,0.00069779763,0.004507128],"category_scores_gemma":[0.0067713894,0.00019770725,0.00038663173,0.0004320831,0.0011957306,0.0015021698,0.0009820146,0.0012466706,0.00024777587],"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.0008966818,0.00026301816,0.024490314,0.0005756636,0.00023040207,0.0013693782,0.0023079207,0.27140027,0.08229925,0.44402507,0.004677725,0.16746424],"study_design_scores_gemma":[0.00012519644,0.00041726694,0.034251112,0.00009440504,0.00017113116,0.0012193728,0.0011488716,0.46789172,0.011522951,0.4768228,0.0062011355,0.00013407915],"about_ca_topic_score_codex":0.00061239116,"about_ca_topic_score_gemma":0.000873843,"teacher_disagreement_score":0.004507128,"about_ca_system_score_codex":0.00037408687,"about_ca_system_score_gemma":0.00020336083,"threshold_uncertainty_score":0.015077829},"labels":[],"label_agreement":null},{"id":"W88458750","doi":"10.1007/978-3-642-30353-1_24","title":"Learning Observation Models for Dialogue POMDPs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Speech and dialogue systems","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":"Université Laval","funders":"","keywords":"Partially observable Markov decision process; Computer science; Artificial intelligence; Quality (philosophy); Machine learning; Markov model; Epistemology; Markov chain","score_opus":0.043564802280104356,"score_gpt":0.24765216075679833,"score_spread":0.20408735847669396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88458750","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.009427076,0.0002564669,0.9885703,0.00017788273,0.000027061955,0.000048072667,0.00024164446,0.00070718577,0.00054427935],"genre_scores_gemma":[0.58656645,0.0008700117,0.40320182,0.00023362046,0.00017341804,0.0006840297,0.0033981577,0.00042421205,0.0044482676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855214,0.0004988048,0.00010848455,0.0004829133,0.00021766825,0.00013998982],"domain_scores_gemma":[0.9860096,0.012265553,0.00043158725,0.000618291,0.0004207774,0.00025412993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028577703,0.0014112802,0.0021008772,0.0009607761,0.0007371503,0.0018542478,0.0028665836,0.0016811019,0.0058566118],"category_scores_gemma":[0.015694644,0.0018601913,0.0020512745,0.0010938264,0.0013292056,0.0037885555,0.0035183593,0.0051562614,0.0011058041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040316783,0.00015314849,0.0023953575,0.0002845169,0.0001607306,0.000108368135,0.00036809535,0.7910952,0.0008178727,0.041532464,0.0028901985,0.15979086],"study_design_scores_gemma":[0.000022616498,0.000016003902,0.00009535614,0.000015550007,0.0000126724,0.0000076254605,0.00001553665,0.9661941,0.0001464826,0.033182718,0.00028425167,0.0000071856607],"about_ca_topic_score_codex":0.010610701,"about_ca_topic_score_gemma":0.015769403,"teacher_disagreement_score":0.010610701,"about_ca_system_score_codex":0.0019157823,"about_ca_system_score_gemma":0.0017399647,"threshold_uncertainty_score":0.021097898},"labels":[],"label_agreement":null},{"id":"W88470417","doi":"10.1007/978-3-642-21596-4_29","title":"A Novel Image Encryption Framework Based on Markov Map and Singular Value Decomposition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Singular value decomposition; Encryption; Decomposition; Markov chain; Image (mathematics); Theoretical computer science; Artificial intelligence; Computer security; Machine learning","score_opus":0.011942995194015264,"score_gpt":0.24480208065350817,"score_spread":0.2328590854594929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88470417","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.007338192,0.00029254658,0.9894371,0.00006140332,0.00005284571,0.00002991965,0.00003444161,0.00034184326,0.0024116358],"genre_scores_gemma":[0.2644408,0.00087548315,0.7255351,0.000101997764,0.000113917995,0.00008794685,0.00018752209,0.00010821269,0.008548956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999818,0.000029111232,0.000009366046,0.000026781083,0.000089488145,0.000027127979],"domain_scores_gemma":[0.9999075,0.000019644442,0.0000094646875,0.000019825306,0.00003099368,0.000012576086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002005233,0.00037986247,0.0006769597,0.00042781432,0.0003235219,0.0006345952,0.0005599556,0.00047145222,0.0015975208],"category_scores_gemma":[0.00026773184,0.00016974707,0.000603456,0.00037453847,0.00029481627,0.00080329477,0.0006689222,0.0006890958,0.00068724144],"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.0003616386,0.00021460846,0.00033308446,0.00026713422,0.000098037955,0.00045905163,0.000113463415,0.08881506,0.2537929,0.3402076,0.0066498113,0.30868763],"study_design_scores_gemma":[0.00001963442,0.00010631055,0.0001731814,0.000011141382,0.000024394267,0.00046830383,0.000015269297,0.9349943,0.027907055,0.029311066,0.0069413125,0.000028042547],"about_ca_topic_score_codex":0.0005544054,"about_ca_topic_score_gemma":0.00087552186,"teacher_disagreement_score":0.0015975208,"about_ca_system_score_codex":0.00026817867,"about_ca_system_score_gemma":0.000462866,"threshold_uncertainty_score":0.0053442717},"labels":[],"label_agreement":null},{"id":"W88488725","doi":"10.1007/11428848_50","title":"A Model of Virus Spreading Using Cell-DEVS","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"DEVS; Formalism (music); Computer science; Population; Modeling and simulation; Distributed computing; Theoretical computer science; Simulation; Medicine","score_opus":0.14781605596822492,"score_gpt":0.3821332924414061,"score_spread":0.23431723647318117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88488725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17847821,0.0025172725,0.72560716,0.006049344,0.0010583483,0.0002910405,0.0034115457,0.0012055049,0.081381656],"genre_scores_gemma":[0.8697238,0.0016802633,0.040478688,0.00064239826,0.00035423538,0.0004425878,0.00095059857,0.00028224254,0.085445225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928975,0.00024120239,0.000032583823,0.00013310176,0.00013515502,0.00016806458],"domain_scores_gemma":[0.99764425,0.0013495722,0.00020982763,0.00015077327,0.00037730671,0.00026824258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013085352,0.0011047896,0.0023998271,0.0013688593,0.0013560299,0.0028947694,0.005233102,0.005289715,0.0135000935],"category_scores_gemma":[0.0049821064,0.001123466,0.0018651844,0.001709062,0.0021919247,0.0025700121,0.0018307143,0.0024001044,0.0022649912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005924001,0.000040432828,0.00043653944,0.000047485795,0.0000293573,0.00014972074,0.00006586684,0.91211224,0.00069222314,0.08269528,0.0013513628,0.0023202407],"study_design_scores_gemma":[0.000026558604,0.000013532478,0.00006507227,0.000005311852,0.000011157137,0.000032604177,0.000010290254,0.989052,0.00009936655,0.0100458115,0.00062799914,0.000010386057],"about_ca_topic_score_codex":0.029551962,"about_ca_topic_score_gemma":0.009075191,"teacher_disagreement_score":0.029551962,"about_ca_system_score_codex":0.0026800118,"about_ca_system_score_gemma":0.0016640027,"threshold_uncertainty_score":0.05875987},"labels":[],"label_agreement":null},{"id":"W88531261","doi":"10.1007/978-3-642-32527-4_19","title":"Ice Skating Humanoid Robot","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Locomotion and Control","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Traverse; Humanoid robot; Computer science; Robot; Gait; Falling (accident); Simulation; Inverted pendulum; Artificial intelligence; Geology; Geodesy; Physical medicine and rehabilitation; Physics; Psychology","score_opus":0.012901408705357047,"score_gpt":0.2135487805399891,"score_spread":0.20064737183463205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88531261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05398996,0.0053401287,0.65913916,0.0006247788,0.0009966355,0.00021727756,0.00068892876,0.0048832754,0.27411982],"genre_scores_gemma":[0.36648446,0.0069228043,0.21961974,0.00037214148,0.00024158608,0.00029472227,0.0022300186,0.0005003818,0.40333414],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99996614,0.000003042605,0.0000013966734,0.000008938722,0.000013001226,0.000007470634],"domain_scores_gemma":[0.9999654,0.0000052474034,0.0000025468075,0.000007078076,0.000010990825,0.000008732901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008502336,0.00062993355,0.00037737357,0.00031909315,0.00052928645,0.0002691469,0.000506955,0.0005311752,0.014847898],"category_scores_gemma":[0.000097909215,0.00021873871,0.00029432843,0.00021289282,0.00036192164,0.00053453946,0.00082429755,0.0004571054,0.0068825977],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003389901,0.000094711635,0.00068410684,0.000661343,0.000046878908,0.0005442682,0.0005892465,0.031374156,0.102900125,0.01486165,0.04884808,0.7990565],"study_design_scores_gemma":[0.0000781801,0.0011005225,0.004551125,0.00049837364,0.00010523473,0.0022172946,0.0008120732,0.1276777,0.034725744,0.022759952,0.8053815,0.00009238728],"about_ca_topic_score_codex":0.0015020224,"about_ca_topic_score_gemma":0.0022640624,"teacher_disagreement_score":0.014847898,"about_ca_system_score_codex":0.00016574409,"about_ca_system_score_gemma":0.00033796218,"threshold_uncertainty_score":0.049671173},"labels":[],"label_agreement":null},{"id":"W88640039","doi":"10.1007/978-3-319-15075-8_3","title":"Formalization of Zsyntax to Reason About Molecular Pathways in HOL4","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Drug Discovery Methods","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":"Concordia University","funders":"","keywords":"Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.031244819797111523,"score_gpt":0.29284213796376446,"score_spread":0.26159731816665294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88640039","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.004633738,0.00026329214,0.9814735,0.00030250568,0.00012937175,0.00008144137,0.00066906185,0.0055439393,0.0069031967],"genre_scores_gemma":[0.17376767,0.00063109957,0.8051979,0.00063985976,0.0002141235,0.00046036916,0.003215759,0.0039361883,0.011936998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987533,0.0002563647,0.00016145036,0.00026933078,0.00040239084,0.00015714929],"domain_scores_gemma":[0.9988709,0.0005952994,0.00006358673,0.0002696447,0.0001574584,0.000043159816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019579579,0.0013470345,0.0009190294,0.001720739,0.001196917,0.0036095353,0.0031744838,0.00090246217,0.014284806],"category_scores_gemma":[0.0030296217,0.001106875,0.0037331244,0.0014620849,0.0034264,0.0060123545,0.0045404336,0.0034256687,0.0029167274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018893811,0.000054378845,0.0006178775,0.00048315641,0.00009633417,0.00024741172,0.000575264,0.017321596,0.0034544407,0.9038487,0.007936191,0.06517574],"study_design_scores_gemma":[0.000079107864,0.000034365396,0.00017829494,0.00010212696,0.00011336174,0.00012249229,0.00009855325,0.059346113,0.007374986,0.88180804,0.050696265,0.000046346035],"about_ca_topic_score_codex":0.004178524,"about_ca_topic_score_gemma":0.0056607053,"teacher_disagreement_score":0.014284806,"about_ca_system_score_codex":0.001776609,"about_ca_system_score_gemma":0.0014975964,"threshold_uncertainty_score":0.047787488},"labels":[],"label_agreement":null},{"id":"W8865236","doi":"10.1007/978-3-540-76386-4_36","title":"Information Fusion for Multi-camera and Multi-body Structure and Motion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"York University","funders":"","keywords":"Computer vision; Artificial intelligence; Structure from motion; Motion (physics); Computer science; Motion estimation; Motion field; Fusion; Motion analysis; Sensor fusion","score_opus":0.024635621628644536,"score_gpt":0.2954153025716119,"score_spread":0.2707796809429674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8865236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020924134,0.0008874317,0.9958372,0.00007080828,0.00008927953,0.000015061468,0.000053792224,0.00030106163,0.0006529513],"genre_scores_gemma":[0.17166647,0.0024453658,0.8184759,0.00019147074,0.00021800453,0.000121652956,0.0006229418,0.00018234251,0.0060757427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.00012351,0.00004683438,0.00016236275,0.0003468264,0.000060001283],"domain_scores_gemma":[0.9994438,0.00018847572,0.000057790534,0.00014403439,0.00014575891,0.000020155947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785682,0.0010600187,0.0014846602,0.0013036515,0.0004816596,0.0008448026,0.0010732838,0.0016290784,0.0030047486],"category_scores_gemma":[0.0021231319,0.00074462726,0.0016586588,0.0017434218,0.000593653,0.0025638333,0.0020089669,0.0012035535,0.0012598784],"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.00020632696,0.00008321398,0.00039157376,0.00039883828,0.0002545272,0.00013170087,0.00013341825,0.14818047,0.041635256,0.01963492,0.0049195336,0.7840302],"study_design_scores_gemma":[0.000011890391,0.00007790056,0.001078097,0.000038886094,0.000088768276,0.00017734813,0.00003010265,0.9494103,0.021014482,0.022094961,0.00593146,0.000045722325],"about_ca_topic_score_codex":0.002606994,"about_ca_topic_score_gemma":0.0027492389,"teacher_disagreement_score":0.0030047486,"about_ca_system_score_codex":0.0005585129,"about_ca_system_score_gemma":0.00048609226,"threshold_uncertainty_score":0.010051906},"labels":[],"label_agreement":null},{"id":"W88806592","doi":"10.1007/978-3-642-28499-1_5","title":"Leveraging Domain Knowledge to Learn Normative Behavior: A Bayesian Approach","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Normative; Computer science; Reinforcement learning; Norm (philosophy); Domain knowledge; Artificial intelligence; Set (abstract data type); Domain (mathematical analysis); Adaptation (eye); Process (computing); Normative model of decision-making; Bayesian probability; Machine learning; Knowledge management; Psychology; Epistemology; Mathematics","score_opus":0.02530434686639648,"score_gpt":0.26163652532155574,"score_spread":0.23633217845515925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88806592","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.008152233,0.00021946536,0.98823684,0.00047777456,0.00002158362,0.00003812681,0.00007113808,0.00017094343,0.0026118376],"genre_scores_gemma":[0.59573275,0.001035236,0.39698386,0.00044219234,0.0002064226,0.0004325044,0.0004242798,0.00019202044,0.004550749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769515,0.0010184954,0.0001348314,0.0005129218,0.0004966326,0.0001419285],"domain_scores_gemma":[0.9871842,0.010025947,0.0007695771,0.00096898293,0.00077589776,0.00027544625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050423155,0.001378257,0.0020608264,0.0017876083,0.0005678391,0.0023019088,0.0031640504,0.0021622097,0.0033424355],"category_scores_gemma":[0.020728063,0.0012877298,0.0014793518,0.0012811738,0.0024072325,0.005554229,0.0023268182,0.004565438,0.0006022935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016829619,0.00035695094,0.002831228,0.00029769226,0.00037830762,0.00012241471,0.00033927482,0.572278,0.0019946327,0.23720986,0.0031881148,0.18083528],"study_design_scores_gemma":[0.000012915407,0.000029529623,0.00026240153,0.000034943972,0.00002643393,0.00002312534,0.000017453325,0.7740043,0.00038246126,0.22471778,0.0004685504,0.000020146595],"about_ca_topic_score_codex":0.0030014892,"about_ca_topic_score_gemma":0.0049427557,"teacher_disagreement_score":0.0050423155,"about_ca_system_score_codex":0.0013476921,"about_ca_system_score_gemma":0.0015774792,"threshold_uncertainty_score":0.026666641},"labels":[],"label_agreement":null},{"id":"W88814462","doi":"10.1007/978-3-662-43722-3_11","title":"Modelling Techniques for Simulating Large QCA Circuits","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum dot cellular automaton; Quantum cellular automaton; Computer science; Electronic circuit; Quantum dot; CMOS; Nanotechnology; Dangling bond; USable; Cellular automaton; Silicon; Silicon on insulator; Nanoelectronics; Quantum computer; Coulomb blockade; Digital electronics; Quantum; Materials science; Electrical engineering; Transistor; Optoelectronics; Physics; Engineering; Voltage","score_opus":0.0285095164435084,"score_gpt":0.26151320676072004,"score_spread":0.23300369031721163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88814462","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.005900716,0.00018527292,0.9864465,0.00013865349,0.000045747314,0.00005669992,0.00012635745,0.00055978535,0.00654023],"genre_scores_gemma":[0.41068602,0.0010994177,0.5717317,0.00022023369,0.00007737092,0.00071600196,0.0006630517,0.000964913,0.013841412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969184,0.000072171526,0.000019600348,0.000039546016,0.00014446474,0.00003244756],"domain_scores_gemma":[0.9990865,0.0005522857,0.000058700327,0.00016231393,0.00010787668,0.000032273405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005275747,0.0008846797,0.0010083325,0.0005409484,0.0007350224,0.0010712811,0.0023612687,0.001664681,0.005736379],"category_scores_gemma":[0.002375112,0.0007488892,0.0011678181,0.0007973254,0.00087820645,0.0018349664,0.0010864426,0.0019255741,0.0014850738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004102117,0.00005000984,0.00019616634,0.00019295732,0.00003518189,0.00008868544,0.00014559379,0.7690532,0.013716642,0.19394086,0.0013478142,0.021191813],"study_design_scores_gemma":[0.0000068721074,0.000006752789,0.000024077503,0.000008279452,0.0000063637635,0.000021931683,0.000007450132,0.9569086,0.0012829344,0.04021917,0.0015009291,0.000006645561],"about_ca_topic_score_codex":0.0036453616,"about_ca_topic_score_gemma":0.0045493455,"teacher_disagreement_score":0.005736379,"about_ca_system_score_codex":0.0011713187,"about_ca_system_score_gemma":0.00086487975,"threshold_uncertainty_score":0.019190133},"labels":[],"label_agreement":null},{"id":"W89424658","doi":"10.1007/978-3-319-14612-6_21","title":"Variational Time-Implicit Multiphase Level-Sets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","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":"Western University","funders":"","keywords":"Computer science; Disjoint sets; Mathematical optimization; Set (abstract data type); Relaxation (psychology); Algorithm; Massively parallel; Theoretical computer science; Parallel computing; Mathematics; Discrete mathematics","score_opus":0.045376724614682964,"score_gpt":0.3118243571172782,"score_spread":0.26644763250259523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89424658","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.0053925663,0.00049621076,0.98380774,0.0002658457,0.00021688138,0.000039890307,0.00011331031,0.00018031769,0.009487333],"genre_scores_gemma":[0.27459806,0.0010297358,0.69145435,0.00034273858,0.00024445626,0.00032204282,0.0005766937,0.0012648434,0.030167138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.00011324902,0.000018406838,0.000039906543,0.0001413542,0.000032422784],"domain_scores_gemma":[0.9992865,0.0003473661,0.00005362114,0.00011091322,0.00013362098,0.00006804552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085475313,0.00085422065,0.0012130921,0.0008720697,0.0005066982,0.0021010141,0.0030375752,0.002462994,0.0067084376],"category_scores_gemma":[0.003215162,0.0012459228,0.0010483878,0.0008938297,0.0014956909,0.0017468411,0.0033656529,0.0033926968,0.0020397098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009091043,0.000059312566,0.00024384755,0.00020172399,0.000067217894,0.00006858327,0.00010833463,0.58436143,0.0030130574,0.361347,0.0039920486,0.046446566],"study_design_scores_gemma":[0.0000088803845,0.0000063626876,0.000020030626,0.000012007108,0.0000036955248,0.000015063089,0.0000051266297,0.9684522,0.00035640527,0.029180283,0.0019334584,0.000006617808],"about_ca_topic_score_codex":0.0026345816,"about_ca_topic_score_gemma":0.0034232081,"teacher_disagreement_score":0.0067084376,"about_ca_system_score_codex":0.0010107028,"about_ca_system_score_gemma":0.00095774734,"threshold_uncertainty_score":0.022441983},"labels":[],"label_agreement":null},{"id":"W89538947","doi":"10.1007/978-3-642-30353-1_21","title":"Multiagent Decision by Partial Evaluation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Guelph","funders":"","keywords":"Computer science; Focus (optics); Class (philosophy); Decision tree; Artificial intelligence; Decision support system; Decision rule; Machine learning","score_opus":0.09665183280427712,"score_gpt":0.3879280380961714,"score_spread":0.29127620529189424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89538947","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.017449928,0.0019282802,0.9016599,0.0014556061,0.00020447942,0.00010756683,0.000095580996,0.00013056428,0.076968096],"genre_scores_gemma":[0.6425349,0.0017380061,0.29937476,0.00031197796,0.00035989404,0.0005004779,0.00022463346,0.00015414314,0.054801196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975068,0.0014524789,0.00009274688,0.00017956934,0.0006339513,0.00013449338],"domain_scores_gemma":[0.99733186,0.0020130512,0.000086154454,0.00023274729,0.0002361678,0.00010002568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038773743,0.00088246755,0.001021762,0.0006267118,0.0005507531,0.002233118,0.0009880894,0.0008458872,0.006668973],"category_scores_gemma":[0.0060208705,0.00043776006,0.0007965151,0.0009148111,0.0016705707,0.0027498717,0.0017900169,0.0016867948,0.0007714248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009820667,0.000047022262,0.0001959704,0.00014552815,0.00006233728,0.00005279695,0.00012032292,0.06920558,0.0007292726,0.8307958,0.0047162496,0.093830846],"study_design_scores_gemma":[0.000022933711,0.000049867904,0.000103569626,0.000038786085,0.000017384202,0.000039795414,0.000019738032,0.23320821,0.0006053724,0.76124096,0.004640918,0.000012451636],"about_ca_topic_score_codex":0.000630463,"about_ca_topic_score_gemma":0.0008225702,"teacher_disagreement_score":0.006668973,"about_ca_system_score_codex":0.0014665185,"about_ca_system_score_gemma":0.00086053286,"threshold_uncertainty_score":0.022309959},"labels":[],"label_agreement":null},{"id":"W90050483","doi":"10.1007/978-3-642-30950-2_66","title":"Using the MetaHistoReasoning Tool Training Module to Facilitate the Acquisition of Domain-Specific Metacognitive Strategies","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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":"Metacognition; Ambiguity; Computer science; Domain (mathematical analysis); Artificial intelligence; Human–computer interaction; Cognition; Psychology; Programming language","score_opus":0.1610969687192851,"score_gpt":0.36146820945438224,"score_spread":0.20037124073509713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90050483","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.43239442,0.002432971,0.42558733,0.0016792833,0.0008677289,0.0010489967,0.0009597539,0.02186226,0.11316734],"genre_scores_gemma":[0.45207754,0.001981607,0.45191145,0.0010721092,0.00015534465,0.0008331789,0.0011192781,0.0009927283,0.08985683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999231,0.000009298551,0.000005601882,0.000025592422,0.000026105898,0.000010310033],"domain_scores_gemma":[0.99953544,0.00026396906,0.00004654938,0.00006490208,0.00003970499,0.00004939468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002330032,0.00044639557,0.00023837462,0.0003621306,0.000105056955,0.00045439933,0.0007983381,0.0003938858,0.015183186],"category_scores_gemma":[0.0011270688,0.00018885813,0.00025291028,0.00021197225,0.00010680208,0.00074837275,0.0005269902,0.00097407814,0.0040159672],"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.00025937374,0.0019938112,0.0013594822,0.00032223822,0.000019549328,0.00022741803,0.0005608241,0.00068904925,0.07371803,0.0015326589,0.010420096,0.90889746],"study_design_scores_gemma":[0.0011895937,0.009351846,0.10516198,0.0017309691,0.00045309935,0.0094315475,0.00083762535,0.043214533,0.4367595,0.030764127,0.3608614,0.00024391632],"about_ca_topic_score_codex":0.00022228429,"about_ca_topic_score_gemma":0.00053653814,"teacher_disagreement_score":0.015183186,"about_ca_system_score_codex":0.00010273654,"about_ca_system_score_gemma":0.00030778357,"threshold_uncertainty_score":0.050792813},"labels":[],"label_agreement":null},{"id":"W90148240","doi":"10.1007/978-3-642-32597-7_37","title":"Alternative Query Optimization for Workload Management","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","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":"IBM (Canada); York University","funders":"","keywords":"Computer science; Workload; Query plan; Query optimization; Sargable; Query expansion; Throughput; Web query classification; Database; Query language; Resource (disambiguation); Web search query; Online aggregation; Distributed computing; Information retrieval; Search engine; Operating system; Computer network","score_opus":0.018893835191774972,"score_gpt":0.25643931941265463,"score_spread":0.23754548422087965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90148240","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.024449786,0.0017104705,0.96218437,0.000553061,0.00035343936,0.00019125629,0.0003065006,0.0029711945,0.0072800345],"genre_scores_gemma":[0.44877294,0.0008677448,0.53517985,0.0003599864,0.00073570904,0.00033233443,0.0011627056,0.00086188246,0.011726818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436116,0.0012568067,0.00032974922,0.000686397,0.002647666,0.00071815],"domain_scores_gemma":[0.9958664,0.0012905332,0.00018895284,0.0014239199,0.0010196833,0.00021048536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027224596,0.0016358958,0.0020117192,0.0014052866,0.0010684207,0.0031361964,0.004127738,0.00097512885,0.008837509],"category_scores_gemma":[0.006885,0.000572882,0.0011945998,0.0032712468,0.00085187115,0.0033176942,0.0019254871,0.0019892883,0.0016524453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024185209,0.000806384,0.0015587099,0.000551213,0.00025353098,0.00020879686,0.00040301916,0.1506213,0.039139934,0.09349472,0.034469258,0.6760747],"study_design_scores_gemma":[0.000100387115,0.00022747609,0.0004850942,0.000018389444,0.00008458773,0.0001364252,0.000079439786,0.9420602,0.007002762,0.042703085,0.0070640286,0.000038237085],"about_ca_topic_score_codex":0.0022860167,"about_ca_topic_score_gemma":0.003039148,"teacher_disagreement_score":0.008837509,"about_ca_system_score_codex":0.0015136999,"about_ca_system_score_gemma":0.0017626549,"threshold_uncertainty_score":0.02956444},"labels":[],"label_agreement":null},{"id":"W90277439","doi":"10.1007/978-3-319-08786-3_35","title":"IntelWiki: Recommending Resources to Help Users Contribute to Wikipedia","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wikis in Education and Collaboration","field":"Social Sciences","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 Manitoba","funders":"","keywords":"Computer science; Context (archaeology); World Wide Web; Key (lock); Quality (philosophy); Information retrieval; Multimedia; Human–computer interaction; Computer security","score_opus":0.020360427675801842,"score_gpt":0.3059302154411356,"score_spread":0.28556978776533376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90277439","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.16764589,0.01235841,0.5460459,0.0030058867,0.0018825901,0.0012206084,0.03723494,0.12015631,0.110449515],"genre_scores_gemma":[0.1822734,0.004715516,0.6524863,0.0005903346,0.00025197637,0.00051601784,0.051313877,0.003405057,0.10444753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976534,0.00004052999,0.000015428583,0.000058710866,0.000099147794,0.000020906191],"domain_scores_gemma":[0.9994642,0.0001844382,0.000037577967,0.000094488656,0.00014338989,0.00007606342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042728506,0.0008871766,0.00045135448,0.002472849,0.0007120439,0.000926594,0.0008383544,0.0006904783,0.0072231283],"category_scores_gemma":[0.0025524683,0.00041222145,0.00043105584,0.002010281,0.00019127422,0.0019785028,0.001087934,0.00071854796,0.004880461],"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.00020571685,0.00038138716,0.004944041,0.00077141495,0.00012529835,0.00020486441,0.0005337854,0.00360892,0.008625768,0.0044141444,0.33413228,0.64205223],"study_design_scores_gemma":[0.0001551023,0.0004536909,0.017332036,0.00046806247,0.0003855904,0.0012249311,0.0008192545,0.15305613,0.03494642,0.023506943,0.7674476,0.00020426832],"about_ca_topic_score_codex":0.008510828,"about_ca_topic_score_gemma":0.032732226,"teacher_disagreement_score":0.008510828,"about_ca_system_score_codex":0.00030842685,"about_ca_system_score_gemma":0.00092232384,"threshold_uncertainty_score":0.024163783},"labels":[],"label_agreement":null},{"id":"W90402225","doi":"10.1007/978-3-642-30353-1_2","title":"Macro Learning in Planning as Parameter Configuration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","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 Toronto","funders":"","keywords":"Macro; Computer science; Domain (mathematical analysis); Set (abstract data type); Task (project management); Planner; Scheme (mathematics); Artificial intelligence; Theoretical computer science; Mathematical optimization; Machine learning; Algorithm; Programming language; Mathematics","score_opus":0.02225879861836087,"score_gpt":0.2604515108487879,"score_spread":0.23819271223042707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90402225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011390025,0.0006490992,0.96659863,0.0003491427,0.000062660365,0.000024427458,0.000057901598,0.00045165297,0.020416467],"genre_scores_gemma":[0.6075558,0.0015753469,0.3637893,0.00018672459,0.00015884756,0.00023889319,0.00024607085,0.00034043152,0.025908608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.00016825601,0.00002069015,0.00007871154,0.00011274725,0.000035550212],"domain_scores_gemma":[0.9986339,0.0009771592,0.0000503885,0.00019983429,0.000079540456,0.00005914193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008320509,0.0005429364,0.0006507452,0.00043342524,0.0003440706,0.0011711607,0.0012520411,0.00068999385,0.0093020955],"category_scores_gemma":[0.0039384365,0.0005188749,0.00040528757,0.00097607134,0.0014694639,0.0030280307,0.0013950778,0.0017077699,0.00097224384],"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.00011920522,0.00005453893,0.000564134,0.00013750514,0.000028406246,0.00005922273,0.00016252823,0.3031334,0.0014144987,0.46090624,0.0038895635,0.22953072],"study_design_scores_gemma":[0.000012056735,0.00003296711,0.00018279249,0.00002635262,0.000008409559,0.000023920376,0.000028449445,0.5506257,0.0012532455,0.4439789,0.0038161278,0.000011083652],"about_ca_topic_score_codex":0.0028218399,"about_ca_topic_score_gemma":0.0032140694,"teacher_disagreement_score":0.0093020955,"about_ca_system_score_codex":0.0009002154,"about_ca_system_score_gemma":0.0006633331,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W90999908","doi":"10.1007/978-3-642-31298-4_34","title":"Function-Valued Mappings, Total Variation and Compressed Sensing for diffusion MRI","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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 Waterloo","funders":"","keywords":"Computer science; Diffusion MRI; Hilbert space; Minification; Compressed sensing; Formalism (music); Algorithm; Unit sphere; Diffusion; Magnetic resonance imaging; Artificial intelligence; Mathematics; Pure mathematics; Physics","score_opus":0.03782224024557197,"score_gpt":0.29631795854297743,"score_spread":0.2584957182974055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90999908","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.004121319,0.047204826,0.9300583,0.0016127345,0.0010351073,0.00002897266,0.00022208698,0.00018795951,0.015528625],"genre_scores_gemma":[0.15744296,0.094702,0.68793917,0.0011914412,0.0055620647,0.00016884117,0.0007119473,0.00033773502,0.051943816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972695,0.00008642645,0.00002404014,0.00005910297,0.000091937494,0.000011494439],"domain_scores_gemma":[0.99954,0.00032924645,0.000031179545,0.00003556506,0.000048928032,0.0000149947045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007676987,0.0010599439,0.0008725783,0.00094613904,0.00022189593,0.0016176854,0.0006928242,0.0015279279,0.0028922793],"category_scores_gemma":[0.00202288,0.00035944014,0.00057995296,0.001651997,0.0015907405,0.0018773815,0.0008017947,0.0021272525,0.0009145688],"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.00005398062,0.000042341275,0.00013150541,0.0007689748,0.000048467726,0.00019040906,0.00020116383,0.033948563,0.011697812,0.7220914,0.017404173,0.21342123],"study_design_scores_gemma":[0.000010458015,0.000080058875,0.00036970022,0.00009221033,0.0000252983,0.0005878753,0.000050305538,0.16074227,0.0026265136,0.7973431,0.03802244,0.000049838898],"about_ca_topic_score_codex":0.0005971834,"about_ca_topic_score_gemma":0.0005963592,"teacher_disagreement_score":0.0028922793,"about_ca_system_score_codex":0.00031102297,"about_ca_system_score_gemma":0.00032072852,"threshold_uncertainty_score":0.009675682},"labels":[],"label_agreement":null},{"id":"W91041530","doi":"10.1007/978-3-642-15582-6_25","title":"Introducing HOL Zero","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; HOL; Zero (linguistics); Programming language; Philosophy","score_opus":0.016226992293278186,"score_gpt":0.23807713817456475,"score_spread":0.22185014588128657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91041530","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004708842,0.010856598,0.09066577,0.0076321224,0.0054162424,0.000036361715,0.0003881621,0.0012509704,0.87904495],"genre_scores_gemma":[0.18175505,0.013214482,0.04432175,0.005351613,0.0029986708,0.00012987742,0.000977303,0.0017314331,0.7495198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999645,0.00007063197,0.000016492795,0.00009626425,0.00011695985,0.000054767763],"domain_scores_gemma":[0.9997532,0.00008115347,0.000013011927,0.000059412632,0.000059057642,0.000034163615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047726775,0.00062045455,0.0004798243,0.001312265,0.0015739871,0.0034115824,0.0007316798,0.0006640605,0.038385656],"category_scores_gemma":[0.0010519801,0.00037641212,0.00049615774,0.0010089764,0.0031050325,0.005650968,0.0019929127,0.0031840722,0.010069784],"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.000010260916,0.000008397852,0.000050403218,0.000052370382,0.0000027144933,0.000022895252,0.00032025998,0.00007500738,0.00029092285,0.9482366,0.022765424,0.02816471],"study_design_scores_gemma":[0.0000050247268,0.000010379066,0.000084362124,0.000059643622,0.0000034030468,0.00008626228,0.00011914291,0.00015275771,0.0003074731,0.6544328,0.34473178,0.000007089367],"about_ca_topic_score_codex":0.0008062372,"about_ca_topic_score_gemma":0.0013243417,"teacher_disagreement_score":0.038385656,"about_ca_system_score_codex":0.0012298768,"about_ca_system_score_gemma":0.0006567965,"threshold_uncertainty_score":0.12841284},"labels":[],"label_agreement":null},{"id":"W9125056","doi":"10.1007/978-3-642-24500-8_62","title":"The Cursor as an Artistic Expression in Jeddah","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Digital Games and Media","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":"Simon Fraser University","funders":"","keywords":"Cursor (databases); Computer science; Computer graphics (images); Expression (computer science); Computer vision; Artificial intelligence","score_opus":0.024804944699057065,"score_gpt":0.2864388946055905,"score_spread":0.26163394990653344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9125056","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060135365,0.011281959,0.0055247108,0.0045448043,0.00552573,0.000052138992,0.00008279699,0.0002847715,0.91256773],"genre_scores_gemma":[0.6190873,0.0040490855,0.006335989,0.0013161864,0.0007626687,0.000037288177,0.00006162632,0.00042353995,0.3679264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99959785,0.00014872174,0.000014822622,0.000045297526,0.00012715302,0.00006617316],"domain_scores_gemma":[0.99983287,0.00005813459,0.000012776761,0.000015626103,0.000034669014,0.00004587838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004891812,0.0005680583,0.00034709487,0.00074617437,0.0036864306,0.0034829457,0.00038972904,0.00066024857,0.010615298],"category_scores_gemma":[0.00079454074,0.00015790865,0.00020369307,0.00041938096,0.003538431,0.0014538483,0.002584244,0.0013120108,0.0015937976],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027263697,0.00008664645,0.00082906603,0.0005834605,0.000023371584,0.0014208058,0.1033054,0.00037590903,0.0071349083,0.60801816,0.13202591,0.14592372],"study_design_scores_gemma":[0.000026382682,0.00007707918,0.0013894108,0.00027283118,0.000013728582,0.0013251973,0.021904483,0.00034901727,0.0012921778,0.01876113,0.9545563,0.000032272004],"about_ca_topic_score_codex":0.0015794828,"about_ca_topic_score_gemma":0.005646043,"teacher_disagreement_score":0.010615298,"about_ca_system_score_codex":0.0009433891,"about_ca_system_score_gemma":0.00062701834,"threshold_uncertainty_score":0.035511672},"labels":[],"label_agreement":null},{"id":"W91636976","doi":"10.1007/978-3-642-30284-8_50","title":"Evaluating Scientific Hypotheses Using the SPARQL Inferencing Notation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Carleton University","funders":"","keywords":"SPARQL; Notation; Computer science; Domain (mathematical analysis); TRACE (psycholinguistics); Flexibility (engineering); Task (project management); Data science; RDF; Information retrieval; Semantic Web; Mathematics","score_opus":0.10815389168132306,"score_gpt":0.3470901800926138,"score_spread":0.23893628841129072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91636976","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.013336168,0.0004741633,0.9607543,0.0010928665,0.00016327585,0.00035420092,0.003915699,0.013462547,0.0064468062],"genre_scores_gemma":[0.12488615,0.00073316705,0.8574164,0.00058776577,0.00014987712,0.00031674188,0.011038728,0.0012995276,0.00357168],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926099,0.0024801083,0.0009897198,0.0008497122,0.0028157057,0.0002548281],"domain_scores_gemma":[0.9842594,0.011629051,0.00065912027,0.0017359147,0.0014663651,0.000250134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009920328,0.0013268327,0.001342535,0.003818566,0.0010665221,0.006571533,0.00348314,0.0016669505,0.01434638],"category_scores_gemma":[0.026525669,0.0009931296,0.00330589,0.0027685778,0.0013579781,0.007778368,0.0044280565,0.0021020523,0.0032387467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007647148,0.00064533,0.0059229117,0.0021212946,0.00058250467,0.0018641695,0.00101481,0.07234555,0.01911372,0.24563143,0.03739904,0.61259454],"study_design_scores_gemma":[0.00020420746,0.00019817,0.0010159336,0.00039705486,0.00042808434,0.0007784647,0.0004960228,0.42092046,0.04628733,0.4785673,0.050581966,0.00012504972],"about_ca_topic_score_codex":0.002591936,"about_ca_topic_score_gemma":0.004332396,"teacher_disagreement_score":0.01434638,"about_ca_system_score_codex":0.0009603309,"about_ca_system_score_gemma":0.002007413,"threshold_uncertainty_score":0.052464366},"labels":[],"label_agreement":null},{"id":"W91672966","doi":"10.1007/978-3-642-22878-0_24","title":"A Conceptual Model for G2G Relationships","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"E-Government and Public Services","field":"Social Sciences","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":"Université Laval","funders":"","keywords":"Computer science; Conceptual model; Artificial intelligence; Database","score_opus":0.09568838549589452,"score_gpt":0.29218210912632653,"score_spread":0.196493723630432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91672966","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.010549473,0.00078373734,0.84777516,0.011070988,0.0002884635,0.00070854486,0.0014729776,0.0010859792,0.1262647],"genre_scores_gemma":[0.4053417,0.0021501163,0.55161744,0.0024562734,0.00030190154,0.0016937209,0.0029687665,0.00047239196,0.032997694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970095,0.0011916723,0.00027044897,0.00063762366,0.0005244284,0.00036633125],"domain_scores_gemma":[0.9962721,0.0017214215,0.00029597658,0.00046981606,0.0008262981,0.0004144193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792542,0.0014448707,0.00067142467,0.0044596787,0.0039805626,0.011271009,0.004509724,0.005917464,0.025872845],"category_scores_gemma":[0.007699592,0.0009976802,0.0018129202,0.007201144,0.006420999,0.02540443,0.0046340204,0.0045626345,0.0063414597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069575826,0.000016290516,0.00020455002,0.000051382423,0.0000052477635,0.00011561938,0.00061278197,0.0013723093,0.00012398342,0.9898435,0.0026324678,0.005014928],"study_design_scores_gemma":[0.000034587578,0.000035678975,0.00020740024,0.00019898843,0.000046210964,0.000598531,0.0020304283,0.032695685,0.00046494702,0.84968734,0.11396656,0.00003364893],"about_ca_topic_score_codex":0.017600589,"about_ca_topic_score_gemma":0.0087442435,"teacher_disagreement_score":0.025872845,"about_ca_system_score_codex":0.004262315,"about_ca_system_score_gemma":0.004202723,"threshold_uncertainty_score":0.086553335},"labels":[],"label_agreement":null},{"id":"W91699463","doi":"10.1007/978-3-642-30217-6_50","title":"Expectation-Maximization Collaborative Filtering with Explicit and Implicit Feedback","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Recommender Systems and Techniques","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 Calgary","funders":"","keywords":"Computer science; Collaborative filtering; Maximization; Factor (programming language); Recommender system; Factorization; Matrix decomposition; Matrix (chemical analysis); Algorithm; Machine learning; Mathematical optimization; Mathematics","score_opus":0.013288740360026618,"score_gpt":0.23480614481541,"score_spread":0.2215174044553834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91699463","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.0022407384,0.00038632783,0.995948,0.00011167721,0.00006116273,0.000030760068,0.000034965124,0.00017228928,0.0010140088],"genre_scores_gemma":[0.2373801,0.001207403,0.74673855,0.00032916645,0.0005035768,0.00030030086,0.00049740914,0.00014337164,0.012900127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99357235,0.0028544748,0.00046536713,0.0011546867,0.0015779339,0.00037519736],"domain_scores_gemma":[0.9803618,0.0148736965,0.00047971203,0.0024034812,0.0016534282,0.00022782224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069487686,0.001749071,0.0042418973,0.0012007218,0.0011578525,0.0024397643,0.004690405,0.00465115,0.0037981148],"category_scores_gemma":[0.025111467,0.0015341078,0.0018453661,0.0027663102,0.0015289852,0.005058863,0.002538695,0.0027113084,0.0024909426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084097363,0.00046786014,0.0012717484,0.00093452254,0.00064179196,0.00029180903,0.00042805192,0.4952487,0.005108348,0.08654407,0.009986933,0.39823514],"study_design_scores_gemma":[0.000062734216,0.000101351696,0.0001666926,0.000025172892,0.00008239261,0.00014203553,0.000014532068,0.9716338,0.0014296876,0.024608338,0.0016904616,0.00004280575],"about_ca_topic_score_codex":0.0040397192,"about_ca_topic_score_gemma":0.0044202474,"teacher_disagreement_score":0.0069487686,"about_ca_system_score_codex":0.00089810236,"about_ca_system_score_gemma":0.0013116528,"threshold_uncertainty_score":0.036749065},"labels":[],"label_agreement":null},{"id":"W91740730","doi":"10.1007/978-3-642-31298-4_38","title":"Adaptive Windowing for Optimal Visualization of Medical Images Based on a Structural Fidelity Measure","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tone mapping; Computer science; High dynamic range; Visualization; Fidelity; Computer vision; Measure (data warehouse); Artificial intelligence; High fidelity; High-dynamic-range imaging; Range (aeronautics); Dynamic range; Data mining; Engineering","score_opus":0.025413650508689822,"score_gpt":0.3017766647534292,"score_spread":0.27636301424473936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91740730","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.0126795145,0.00038767926,0.98634005,0.000049485774,0.000018345272,0.000019708124,0.000030256853,0.00016373869,0.00031125854],"genre_scores_gemma":[0.13261375,0.0011551469,0.8645928,0.000035402667,0.00005302172,0.00008077872,0.00010586969,0.00025009896,0.001113174],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998154,0.000056972753,0.000016823198,0.000030684005,0.00006352449,0.00001660736],"domain_scores_gemma":[0.99909544,0.00058293244,0.00007584193,0.000093194234,0.00011066952,0.000041881533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055011903,0.00058706745,0.00059050665,0.0005904281,0.00015614442,0.000892562,0.00068513054,0.0005354043,0.0021297894],"category_scores_gemma":[0.00257022,0.0004017119,0.0005715646,0.0006008401,0.0003222736,0.0011525155,0.0008499719,0.0011165518,0.00028047452],"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.00055700063,0.00012015068,0.00061203283,0.00054093986,0.0000878618,0.00019622379,0.00027338386,0.09174868,0.43661612,0.046791527,0.0025299443,0.41992602],"study_design_scores_gemma":[0.000022678012,0.00013818935,0.0007095044,0.00003933051,0.00004426111,0.00034345797,0.000023371616,0.9307789,0.056992702,0.007992898,0.0028849365,0.000029695873],"about_ca_topic_score_codex":0.0005862014,"about_ca_topic_score_gemma":0.0005588194,"teacher_disagreement_score":0.0021297894,"about_ca_system_score_codex":0.00025497895,"about_ca_system_score_gemma":0.0003488157,"threshold_uncertainty_score":0.007124841},"labels":[],"label_agreement":null},{"id":"W92219756","doi":"10.1007/978-3-642-38613-8_29","title":"Characterizing Fault-Tolerant Systems by Means of Simulation Relations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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":"McMaster University","funders":"","keywords":"Computer science; Fault tolerance; Bisimulation; Distributed computing; Characterization (materials science); Theoretical computer science; Simple (philosophy); Fault (geology); Software fault tolerance; Algorithm","score_opus":0.01502695898041974,"score_gpt":0.2369565728334026,"score_spread":0.22192961385298285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92219756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023424622,0.00024091484,0.9715109,0.00012669255,0.000023027258,0.000068539826,0.000086919375,0.0007619281,0.00375635],"genre_scores_gemma":[0.73661566,0.0008093314,0.25844327,0.00011487313,0.00010371788,0.0002656277,0.00064089725,0.00033645867,0.0026702513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771595,0.0008596399,0.00018980305,0.00035357694,0.00069007766,0.00019089968],"domain_scores_gemma":[0.9938829,0.0041596787,0.0004752151,0.0010293309,0.00035390307,0.000098937555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018012663,0.0014233727,0.0010356525,0.0015914781,0.00077706977,0.0021928751,0.0017575442,0.0011743444,0.0024815258],"category_scores_gemma":[0.007726986,0.0007554153,0.001312172,0.0014242708,0.0019369427,0.0048667267,0.0018279639,0.0020248138,0.00062665687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021728904,0.00012194137,0.0017521618,0.00025027807,0.00009098803,0.00019532307,0.0006950372,0.41352344,0.016620342,0.5076588,0.0010948291,0.057779588],"study_design_scores_gemma":[0.000018611256,0.00006192834,0.00022106124,0.000029523924,0.000042375646,0.000094696836,0.00006225159,0.59642935,0.0071925162,0.3921124,0.0037137237,0.000021524818],"about_ca_topic_score_codex":0.00090877886,"about_ca_topic_score_gemma":0.00086410914,"teacher_disagreement_score":0.0024815258,"about_ca_system_score_codex":0.0011679583,"about_ca_system_score_gemma":0.00074737135,"threshold_uncertainty_score":0.009526134},"labels":[],"label_agreement":null},{"id":"W925244956","doi":"10.1007/978-3-319-17470-9_13","title":"Limited View Adversary Codes: Bounds, Constructions and Applications","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Code word; Computer science; Adversary; Adversary model; Decoding methods; Upper and lower bounds; Code (set theory); Theoretical computer science; Adversarial system; List decoding; Construct (python library); Block code; Discrete mathematics; Mathematics; Algorithm; Concatenated error correction code; Computer network; Computer security","score_opus":0.02068158502302986,"score_gpt":0.25278353363241934,"score_spread":0.23210194860938949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W925244956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014119013,0.011193455,0.8913961,0.0026245923,0.00043309986,0.00014190881,0.00071912043,0.00078393973,0.078588784],"genre_scores_gemma":[0.555158,0.028794108,0.34051728,0.0020542236,0.002008102,0.0014248637,0.0020084889,0.0011895751,0.06684534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961294,0.001002688,0.00012770343,0.0005526499,0.0016369907,0.0005506793],"domain_scores_gemma":[0.9824975,0.012384134,0.0007593465,0.0025734704,0.0012726792,0.0005129257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031906564,0.0024774228,0.0021881869,0.0029343576,0.0020568203,0.0063603153,0.0038215707,0.002611912,0.00996166],"category_scores_gemma":[0.015712976,0.0014523164,0.0016418908,0.0052407533,0.0046656583,0.0097417785,0.007217823,0.009622194,0.004979207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014595043,0.000077722885,0.0002814621,0.00025208236,0.00003146695,0.00009320299,0.00026781004,0.027894514,0.0021781828,0.8972414,0.01206825,0.059467897],"study_design_scores_gemma":[0.000025498268,0.00006492039,0.0001360178,0.00021099222,0.000037256123,0.0003525676,0.00007287302,0.073305346,0.0031426179,0.9085263,0.014069669,0.000055900975],"about_ca_topic_score_codex":0.0016400651,"about_ca_topic_score_gemma":0.0013451198,"teacher_disagreement_score":0.00996166,"about_ca_system_score_codex":0.0046953917,"about_ca_system_score_gemma":0.0026717326,"threshold_uncertainty_score":0.03406757},"labels":[],"label_agreement":null},{"id":"W93135273","doi":"10.1007/978-3-642-23623-5_9","title":"3D Ocular Ultrasound Using Gaze Tracking on the Contralateral Eye: A Feasibility Study","year":2011,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"British Columbia Innovation Council","keywords":"Computer science; Gaze; Eye tracking; Computer vision; Artificial intelligence; Tracking (education); Optometry; Computer graphics (images); Medicine; Psychology","score_opus":0.06033861956752868,"score_gpt":0.29579288438610923,"score_spread":0.23545426481858056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93135273","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.9566605,0.0004241834,0.036228117,0.00054805767,0.0001460679,0.002981685,0.00035715633,0.00013282584,0.0025213982],"genre_scores_gemma":[0.97938615,0.00037376545,0.017667819,0.00031270072,0.00014724916,0.0011432321,0.00023545636,0.000028899505,0.0007047606],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.996293,0.0024094484,0.00027979986,0.00035878088,0.00035277108,0.0003061481],"domain_scores_gemma":[0.993342,0.004100467,0.00021508241,0.00060246384,0.0012509756,0.00048906216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004949059,0.0012540024,0.00070326205,0.00092327385,0.00075092877,0.00063760526,0.0014256557,0.0026497648,0.0036764368],"category_scores_gemma":[0.010337925,0.0006343237,0.0008364577,0.00036668006,0.0019506216,0.002178155,0.0013340756,0.0011397299,0.0010798974],"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.0455063,0.060294766,0.14175038,0.0031909368,0.0007292211,0.061072312,0.014044888,0.004928558,0.48150042,0.002592273,0.0028762862,0.1815137],"study_design_scores_gemma":[0.0158923,0.49462235,0.18931782,0.000525275,0.0017967396,0.069601774,0.019365162,0.044472862,0.14678642,0.0032243812,0.013634243,0.00076067063],"about_ca_topic_score_codex":0.0034938015,"about_ca_topic_score_gemma":0.0024984765,"teacher_disagreement_score":0.004949059,"about_ca_system_score_codex":0.0004593403,"about_ca_system_score_gemma":0.0019223337,"threshold_uncertainty_score":0.026173472},"labels":[],"label_agreement":null},{"id":"W93275864","doi":"10.1007/978-3-540-39592-8_55","title":"Towards the Theory of Relaxed Unification","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type 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":"Dalhousie University","funders":"","keywords":"Unification; Computer science; Imperfect; Unified field theory; Algorithm; Theoretical physics; Physics; Programming language","score_opus":0.029266099162117434,"score_gpt":0.24218649650195065,"score_spread":0.2129203973398332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93275864","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.0111785885,0.0059043104,0.8874565,0.0051833536,0.0010421165,0.000067806934,0.00036117926,0.0008829386,0.087923184],"genre_scores_gemma":[0.36340567,0.007992537,0.5706532,0.0041753775,0.002913691,0.00054401334,0.0014523988,0.0010948507,0.047768213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633247,0.0015697208,0.00020951577,0.00065807934,0.0009202856,0.00031005644],"domain_scores_gemma":[0.9957949,0.0020057114,0.00023786302,0.0012379806,0.0005502624,0.00017333693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006331372,0.0011642688,0.002005782,0.0029859545,0.0022231478,0.0055071614,0.004435601,0.0027768984,0.008585786],"category_scores_gemma":[0.007897516,0.002058927,0.002688369,0.0036163602,0.010770358,0.018814512,0.00682326,0.012519363,0.0027793532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069856496,0.0000040006553,0.000024428793,0.000021306198,0.0000041297644,0.000009441386,0.0000930967,0.0004926915,0.00007107106,0.994412,0.0008526283,0.0040081833],"study_design_scores_gemma":[0.000004832827,0.0000027522942,0.000014140081,0.000015048966,0.0000035417286,0.000011450551,0.000020237816,0.0019253908,0.00006796625,0.99367166,0.0042583575,0.0000046184746],"about_ca_topic_score_codex":0.002567857,"about_ca_topic_score_gemma":0.0020419338,"teacher_disagreement_score":0.008585786,"about_ca_system_score_codex":0.0031555253,"about_ca_system_score_gemma":0.0021252027,"threshold_uncertainty_score":0.033483863},"labels":[],"label_agreement":null},{"id":"W93303570","doi":"10.1007/978-3-642-37207-0_10","title":"On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodology","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Evolvability; Computer science; Representation (politics); Genetic programming; Rank (graph theory); Formicoidea; Ant colony; Pheromone; Ant colony optimization algorithms; Theoretical computer science; Artificial intelligence; Mathematics; Biology; Ecology; Evolutionary biology; Aculeata; Combinatorics","score_opus":0.03587807863154491,"score_gpt":0.2736483658721608,"score_spread":0.23777028724061589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93303570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030736208,0.00056462066,0.95502996,0.00018757621,0.000045473953,0.00003277869,0.0000070429924,0.00006325703,0.013332947],"genre_scores_gemma":[0.60673237,0.0010177306,0.3835493,0.00009790971,0.00005258372,0.00013063154,0.0000281206,0.00010458388,0.008286699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995241,0.00023992131,0.000016477845,0.00004779632,0.00014563889,0.000026166781],"domain_scores_gemma":[0.99893826,0.0007550238,0.000062061445,0.00009702329,0.00011928993,0.000028389912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658486,0.0003991402,0.00033701013,0.0004234165,0.00043106917,0.0008519629,0.00095037185,0.0006011431,0.0014863025],"category_scores_gemma":[0.0041616256,0.00030797964,0.0006222652,0.00047591372,0.0015822162,0.0008760205,0.0014035185,0.0011688699,0.0001782922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070079455,0.000032355514,0.00078828796,0.0001424372,0.000044500248,0.00014746137,0.00037680654,0.47081226,0.004864393,0.44217393,0.0005172063,0.08003026],"study_design_scores_gemma":[0.000013806813,0.000069542664,0.00017469391,0.000034831788,0.000018704914,0.000106273976,0.000027925127,0.8915383,0.00089505484,0.1048424,0.002271264,0.0000071310296],"about_ca_topic_score_codex":0.001083978,"about_ca_topic_score_gemma":0.0008369692,"teacher_disagreement_score":0.0014863025,"about_ca_system_score_codex":0.00043621194,"about_ca_system_score_gemma":0.0004847902,"threshold_uncertainty_score":0.0061656833},"labels":[],"label_agreement":null},{"id":"W93368330","doi":"10.1007/978-3-642-15684-7_1","title":"Distributed XML Query Processing","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Streaming XML; XML database; Efficient XML Interchange; XML; Scalability; Variety (cybernetics); XML Signature; Database; XML Schema Editor; XML Encryption; XML validation; XML framework; Information retrieval; World Wide Web","score_opus":0.013018505649926492,"score_gpt":0.24554325006313757,"score_spread":0.23252474441321108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93368330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006352706,0.0013409029,0.9231259,0.0005430931,0.00031522656,0.00019419119,0.0006669602,0.015874641,0.051586244],"genre_scores_gemma":[0.1435339,0.0023449257,0.66875625,0.0005779827,0.0004128947,0.00035335854,0.00778039,0.0031019582,0.17313837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891365,0.0001512294,0.000083245,0.0002469403,0.00052889803,0.00007595521],"domain_scores_gemma":[0.9993272,0.00015099694,0.000016797001,0.0003336584,0.00014369615,0.000027777976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334753,0.00095932494,0.001024,0.0010333138,0.00094921666,0.0023371375,0.002367725,0.0007597317,0.023572287],"category_scores_gemma":[0.0014378635,0.00071080716,0.0006955754,0.0020282017,0.00059830653,0.002838122,0.0016955417,0.0013178901,0.011024571],"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.00038210483,0.00023302922,0.000473305,0.00032358646,0.0000699161,0.00018388775,0.00034663023,0.009088912,0.028840147,0.10461252,0.090648934,0.7647971],"study_design_scores_gemma":[0.00017461492,0.00018721337,0.001321602,0.00011829873,0.0001363103,0.0011756489,0.000252173,0.26172686,0.08250714,0.18959361,0.4627255,0.00008108353],"about_ca_topic_score_codex":0.0018417045,"about_ca_topic_score_gemma":0.0018741558,"teacher_disagreement_score":0.023572287,"about_ca_system_score_codex":0.000789551,"about_ca_system_score_gemma":0.0007653597,"threshold_uncertainty_score":0.07885718},"labels":[],"label_agreement":null},{"id":"W935408413","doi":"10.1007/978-3-662-47672-7_10","title":"Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Algorithm; Approximation algorithm; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.04549324423460633,"score_gpt":0.25598786074259633,"score_spread":0.21049461650799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W935408413","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.0062108124,0.0019868223,0.9838271,0.0006979039,0.0002578304,0.000107568194,0.00058057054,0.0012840171,0.005047364],"genre_scores_gemma":[0.08155049,0.0014755469,0.90300506,0.0003680314,0.00030310822,0.00039121,0.0022007294,0.00073840126,0.009967401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751914,0.00060370227,0.00016269869,0.0005995025,0.0008148072,0.0003002306],"domain_scores_gemma":[0.9960985,0.0017830834,0.00023161659,0.0009656169,0.0007129321,0.00020817769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028764177,0.002774829,0.0034935742,0.002181237,0.0020221437,0.004300476,0.007133468,0.0034533923,0.012830741],"category_scores_gemma":[0.013580879,0.001523275,0.0022037285,0.0072544655,0.0015330651,0.007365836,0.0042527104,0.0049769017,0.00493572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087408244,0.0003676476,0.00078081165,0.00069783494,0.00019330325,0.00006595514,0.00033636493,0.49268556,0.0020442377,0.11088618,0.045881204,0.3451869],"study_design_scores_gemma":[0.00008318249,0.000049083992,0.00018156065,0.000053359232,0.00003675604,0.00008494673,0.00011844623,0.8382772,0.00087768363,0.15394355,0.006268157,0.00002602335],"about_ca_topic_score_codex":0.009068453,"about_ca_topic_score_gemma":0.013518248,"teacher_disagreement_score":0.012830741,"about_ca_system_score_codex":0.004698071,"about_ca_system_score_gemma":0.003354287,"threshold_uncertainty_score":0.042923093},"labels":[],"label_agreement":null},{"id":"W93757527","doi":"10.1007/3-540-45103-x_51","title":"Tracking the Pose of Objects through Subspace","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Vision and Imaging","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":"Computer science; Computer vision; Artificial intelligence; Object (grammar); Kalman filter; Video tracking; Tracking (education); Block (permutation group theory); Subspace topology; A priori and a posteriori; Sequence (biology); Pose; Piecewise; Mathematics","score_opus":0.022822614553201122,"score_gpt":0.27862471035380654,"score_spread":0.2558020958006054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93757527","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.008302436,0.00040514197,0.98772556,0.000042724907,0.00004684508,0.000016676628,0.00008188983,0.0013876662,0.0019910908],"genre_scores_gemma":[0.15944545,0.0023953093,0.82382727,0.0001061864,0.00007560273,0.000049988324,0.0009262806,0.00037570848,0.012798207],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996362,0.000029391233,0.00001256752,0.00014551471,0.00014384273,0.000032580076],"domain_scores_gemma":[0.99972063,0.000061827915,0.000033079144,0.0000912453,0.00007380395,0.000019411094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003737582,0.00069211714,0.0010573912,0.001115621,0.0003042218,0.0011001759,0.000872267,0.00067448744,0.0026280968],"category_scores_gemma":[0.00094807235,0.00058178685,0.000611778,0.002043845,0.000535204,0.0016890342,0.0010447794,0.00083832804,0.0029062792],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008352596,0.000061638246,0.0010717467,0.00008381857,0.00005969451,0.000037281592,0.00012050759,0.031467766,0.06092406,0.005330565,0.0036046072,0.89715475],"study_design_scores_gemma":[0.00001986014,0.00020473135,0.0051910896,0.000046821857,0.000073565505,0.0007787466,0.00014391646,0.8636072,0.08139303,0.029035691,0.019445634,0.0000597703],"about_ca_topic_score_codex":0.003311768,"about_ca_topic_score_gemma":0.004797489,"teacher_disagreement_score":0.003311768,"about_ca_system_score_codex":0.00027774562,"about_ca_system_score_gemma":0.00048873544,"threshold_uncertainty_score":0.008791804},"labels":[],"label_agreement":null},{"id":"W939959114","doi":"10.1007/978-3-319-08245-5_12","title":"Indexing Rich Internet Applications Using Components-Based Crawling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Web Data Mining and Analysis","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":"IBM (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crawling; Computer science; Ajax; JavaScript; Search engine indexing; Component (thermodynamics); The Internet; Client-side; Server-side; Web crawler; Rich Internet application; Server; Data mining; Artificial intelligence; Database; Web application; Operating system; World Wide Web","score_opus":0.03151291672662897,"score_gpt":0.26692319427048083,"score_spread":0.23541027754385185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W939959114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28056768,0.009085044,0.59690154,0.0006819517,0.00050394045,0.001725913,0.0144498,0.07826338,0.017820682],"genre_scores_gemma":[0.3885654,0.0034068194,0.5531982,0.00020463979,0.00028009608,0.00057271845,0.039183456,0.0035792377,0.011009438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795437,0.00018890979,0.0002402863,0.000336309,0.0011124361,0.0001676725],"domain_scores_gemma":[0.99645185,0.0008564209,0.00025606313,0.00108659,0.0011714813,0.00017759776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006130572,0.0016967949,0.0018580165,0.018731192,0.0013075006,0.0034231253,0.0016937121,0.0011167369,0.0014851241],"category_scores_gemma":[0.0043654838,0.0010337264,0.0014830953,0.018400015,0.0005515753,0.0039308323,0.0019224031,0.00087927026,0.0022672703],"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.00036177362,0.00045076793,0.018797414,0.0010802918,0.00040278613,0.0005095011,0.00054455607,0.011348171,0.051781595,0.0059517347,0.04579649,0.8629748],"study_design_scores_gemma":[0.00010865649,0.0003633154,0.033650544,0.00022926954,0.00086158834,0.0019836745,0.00067763386,0.78675956,0.075446695,0.029437903,0.07026454,0.00021673729],"about_ca_topic_score_codex":0.009617379,"about_ca_topic_score_gemma":0.023614291,"teacher_disagreement_score":0.018731192,"about_ca_system_score_codex":0.0007000787,"about_ca_system_score_gemma":0.0013925027,"threshold_uncertainty_score":0.019122839},"labels":[],"label_agreement":null},{"id":"W94012236","doi":"10.1007/978-3-642-24826-9_8","title":"Libraries in a Digital Frontier: Preserving Chinese Canadian Cultural Heritage","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Asian American and Pacific Histories","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Frontier; Computer science; Cultural heritage; Digital library; Computer graphics (images); History; Archaeology; Art","score_opus":0.012899546624354307,"score_gpt":0.23027495390180377,"score_spread":0.21737540727744947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94012236","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19858038,0.011275472,0.0021816588,0.020197863,0.00046265463,0.00008790001,0.0003273003,0.00028650518,0.7666002],"genre_scores_gemma":[0.7771174,0.0066051716,0.0027148798,0.0017637947,0.00007709667,0.000023239862,0.00016424575,0.00009721982,0.21143703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991283,0.00006122173,0.000015517498,0.00006326736,0.00028294904,0.00044874303],"domain_scores_gemma":[0.99909353,0.000069677146,0.000043170912,0.000068215144,0.000340443,0.00038505864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078135193,0.00044977549,0.00027558242,0.0032848294,0.02863828,0.011063664,0.0013567016,0.0010657309,0.011444393],"category_scores_gemma":[0.0012362801,0.0001860497,0.00027741824,0.008834264,0.009465891,0.004518091,0.004739499,0.0016063282,0.0010076285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017616872,0.000077328,0.0100406455,0.00045708902,0.000026377204,0.0016393013,0.16075745,0.0008505143,0.0022535431,0.44705644,0.07832591,0.29833925],"study_design_scores_gemma":[0.000018665249,0.00003234565,0.018226407,0.00029852637,0.00005486414,0.0004490107,0.11385626,0.00031271574,0.0010514974,0.01188088,0.85375315,0.000065681816],"about_ca_topic_score_codex":0.9575185,"about_ca_topic_score_gemma":0.9836295,"teacher_disagreement_score":0.049313016,"about_ca_system_score_codex":0.049313016,"about_ca_system_score_gemma":0.15279074,"threshold_uncertainty_score":0.35779268},"labels":[],"label_agreement":null},{"id":"W9417692","doi":"10.1007/978-3-319-06483-3_22","title":"Combining Textual Pre-game Reports and Statistical Data for Predicting Success in the National Hockey League","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bigram; Trigram; Computer science; League; Classifier (UML); Artificial intelligence; Machine learning; Natural language processing; Data mining","score_opus":0.03321151851607614,"score_gpt":0.3239491014298272,"score_spread":0.29073758291375107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9417692","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.9690587,0.0006994016,0.013041651,0.0003596412,0.000131401,0.000093882816,0.010637841,0.0006247747,0.0053527546],"genre_scores_gemma":[0.9671844,0.00032065832,0.010824272,0.000049708946,0.00015814476,0.00011554371,0.018088501,0.000048649264,0.0032101278],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991347,0.00030628993,0.000082230705,0.00013520248,0.0002603925,0.00008124665],"domain_scores_gemma":[0.98725605,0.009670879,0.001065535,0.0003612985,0.0011886823,0.00045757208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013616048,0.00077244034,0.00033468133,0.0036359762,0.0002792051,0.0015275293,0.0007243114,0.0007724583,0.0025527547],"category_scores_gemma":[0.009572527,0.00028946152,0.00038502255,0.0025202048,0.00021601822,0.0012225675,0.0006029299,0.0007856715,0.00273533],"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.00087379396,0.0012719412,0.74048865,0.00026903278,0.00026045166,0.00026748996,0.00039598165,0.008978041,0.0040780585,0.00037606468,0.011660372,0.23108022],"study_design_scores_gemma":[0.000059417765,0.0012648078,0.72097796,0.0001975482,0.0003344048,0.00032348227,0.0019565437,0.26016682,0.0067984895,0.0020297635,0.00576845,0.00012237327],"about_ca_topic_score_codex":0.0074396953,"about_ca_topic_score_gemma":0.018882435,"teacher_disagreement_score":0.0074396953,"about_ca_system_score_codex":0.00031037309,"about_ca_system_score_gemma":0.00044746575,"threshold_uncertainty_score":0.0147928},"labels":[],"label_agreement":null},{"id":"W942920504","doi":"10.1007/978-3-319-19992-4_61","title":"Coupled Stable Overlapping Replicator Dynamics for Multimodal Brain Subnetwork Identification","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced NMR Techniques and Applications","field":"Chemistry","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Center for Advancing Translational Sciences","keywords":"Subnetwork; Computer science; Identification (biology); Replicator equation; Artificial intelligence; Computer network; Biology","score_opus":0.019035227656447266,"score_gpt":0.30100027388238104,"score_spread":0.28196504622593377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W942920504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052556403,0.00020190734,0.9451285,0.00013644702,0.000029273402,0.000054259144,0.000044491684,0.0001472971,0.0017014614],"genre_scores_gemma":[0.8739178,0.00018422313,0.120939486,0.000068059344,0.000027605693,0.00028351112,0.0001060376,0.00007297302,0.004400312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997707,0.00009650802,0.000011102365,0.000057862388,0.000042650117,0.000021230711],"domain_scores_gemma":[0.9980356,0.0014856828,0.00015295147,0.00012859935,0.00012689219,0.00007011818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010533264,0.00081410474,0.0010842506,0.00056039396,0.00048905326,0.0007545484,0.0013252477,0.001606918,0.0023766477],"category_scores_gemma":[0.0052086785,0.000625451,0.0007803124,0.0004568136,0.00094510074,0.0010814433,0.0015733015,0.0012386946,0.00030786367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009853692,0.000038190206,0.000563145,0.00008831233,0.0000780435,0.0001121576,0.00015989605,0.9449934,0.0050282087,0.023622084,0.0003341724,0.024883974],"study_design_scores_gemma":[0.0000016344269,0.000003842037,0.00002313402,0.0000013135268,0.0000018125702,0.0000038304142,0.0000026160944,0.99799216,0.00010736901,0.0018334327,0.000027067128,0.0000019411632],"about_ca_topic_score_codex":0.002988052,"about_ca_topic_score_gemma":0.003910884,"teacher_disagreement_score":0.002988052,"about_ca_system_score_codex":0.00059082,"about_ca_system_score_gemma":0.0006024566,"threshold_uncertainty_score":0.007950664},"labels":[],"label_agreement":null},{"id":"W943098930","doi":"10.1007/978-3-319-06686-8_25","title":"A Parameterized Algorithm for Packing Overlapping Subgraphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parameterized complexity; Algorithm; Parallel computing; Theoretical computer science","score_opus":0.026081472131606883,"score_gpt":0.2877207777364756,"score_spread":0.2616393056048687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W943098930","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.02496349,0.00041815627,0.94809854,0.00040674183,0.0001634138,0.0005007817,0.0011730167,0.005493147,0.018782623],"genre_scores_gemma":[0.04806192,0.0003526257,0.93627685,0.00013257419,0.00007377176,0.0005407515,0.0037065248,0.001169963,0.0096849855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983419,0.00022651306,0.00014010993,0.0004977163,0.000541648,0.00025218754],"domain_scores_gemma":[0.99700135,0.001080854,0.00017254322,0.0012246396,0.00033569525,0.00018494687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007489663,0.0026266787,0.0024828187,0.0017248293,0.001790536,0.0033707302,0.005351242,0.0021932966,0.029683966],"category_scores_gemma":[0.0051669683,0.001843891,0.0024007005,0.0073226397,0.0010910793,0.0075951223,0.004935563,0.0033280982,0.007599336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043252844,0.0005746962,0.0006856087,0.0006616224,0.00008957131,0.00017972228,0.00033821334,0.05874698,0.014255041,0.050808784,0.042260397,0.8309669],"study_design_scores_gemma":[0.00043170215,0.0003249033,0.0010658667,0.0001679205,0.00018432522,0.0009150355,0.0004960209,0.63924086,0.015157877,0.2922416,0.04967676,0.00009715443],"about_ca_topic_score_codex":0.0033948065,"about_ca_topic_score_gemma":0.004827822,"teacher_disagreement_score":0.029683966,"about_ca_system_score_codex":0.0022938226,"about_ca_system_score_gemma":0.0025042242,"threshold_uncertainty_score":0.09930277},"labels":[],"label_agreement":null},{"id":"W94350540","doi":"10.1007/978-3-642-39056-2_26","title":"Similarity Measures to Compare Episodes in Modeled Traces","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Analysis and Summarization","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":"Université Laval","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Similarity (geometry); Context (archaeology); Task (project management); Measure (data warehouse); Data mining; Similarity measure; Noise (video); Algorithm; Artificial intelligence; Image (mathematics)","score_opus":0.02787805811406547,"score_gpt":0.24896137103988428,"score_spread":0.22108331292581881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94350540","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.04216154,0.0008210725,0.9520164,0.00010723648,0.000121091,0.00024680918,0.0011766705,0.0013533661,0.001995797],"genre_scores_gemma":[0.6260934,0.0007439514,0.36281443,0.000101957354,0.0002751258,0.0005287531,0.006223381,0.0004640455,0.0027550324],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759775,0.00056175824,0.00035140425,0.00052841095,0.00082962494,0.0001310917],"domain_scores_gemma":[0.99173623,0.0047296504,0.00094641413,0.0010716093,0.0012415276,0.00027465328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002209117,0.0008163681,0.0011366273,0.0065612714,0.00057876133,0.0018859261,0.0014129707,0.0012002611,0.0027489578],"category_scores_gemma":[0.014876411,0.00027707464,0.00097111205,0.005127087,0.00056308304,0.003674624,0.0016253918,0.0010444735,0.0009182991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091177213,0.0007180762,0.020783072,0.0007289657,0.0007833865,0.0003245008,0.0007940099,0.131558,0.018481558,0.04490389,0.0118738115,0.76813895],"study_design_scores_gemma":[0.000052147556,0.00042208415,0.0074087046,0.000101763704,0.00019034877,0.0004494292,0.00043613775,0.9313009,0.007475177,0.045993403,0.0061047017,0.000065358174],"about_ca_topic_score_codex":0.002047891,"about_ca_topic_score_gemma":0.0021383557,"teacher_disagreement_score":0.0065612714,"about_ca_system_score_codex":0.0008272242,"about_ca_system_score_gemma":0.00074147334,"threshold_uncertainty_score":0.011683047},"labels":[],"label_agreement":null},{"id":"W94365490","doi":"10.1007/978-3-642-33415-3_6","title":"Remote Ultrasound Palpation for Robotic Interventions Using Absolute Elastography","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Ultrasound Imaging and Elastography","field":"Medicine","cited_by":28,"is_retracted":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":"Imaging phantom; Elastography; Computer science; Transducer; Palpation; Ultrasound; Biomedical engineering; Haptic technology; Computer vision; Robotics; Acoustics; Stiffness; Artificial intelligence; Robot; Medicine; Surgery; Radiology; Materials science; Physics","score_opus":0.03262503335892836,"score_gpt":0.318175687542007,"score_spread":0.2855506541830786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94365490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33902073,0.011519087,0.62560344,0.0013435455,0.000605861,0.00032787584,0.00019269809,0.003603951,0.017782817],"genre_scores_gemma":[0.83337057,0.0021819817,0.1579629,0.0008647263,0.00042598706,0.00021828257,0.00011320042,0.00050226203,0.0043600383],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990926,0.00028141472,0.000077325014,0.00018068604,0.00027557532,0.00009237908],"domain_scores_gemma":[0.9982784,0.001169217,0.00017727628,0.00022797313,0.000073154166,0.00007389291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018538646,0.0010094167,0.0008325037,0.0007526571,0.00040336963,0.0010283515,0.00086868095,0.0009717886,0.0072659547],"category_scores_gemma":[0.0046224813,0.0005966759,0.0007705534,0.00029187664,0.0011513914,0.00280494,0.0012677086,0.0013126051,0.0012164337],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029162196,0.00041766104,0.0037727493,0.0016865307,0.00014722497,0.0018457231,0.0007206536,0.002040927,0.6022226,0.0012727075,0.0022788672,0.3806781],"study_design_scores_gemma":[0.000944114,0.016366124,0.07884196,0.0007683737,0.0012556306,0.074793234,0.0007439149,0.04869364,0.7302047,0.0053802384,0.04136068,0.0006472636],"about_ca_topic_score_codex":0.00018439032,"about_ca_topic_score_gemma":0.00037968738,"teacher_disagreement_score":0.0072659547,"about_ca_system_score_codex":0.00017367805,"about_ca_system_score_gemma":0.0003539557,"threshold_uncertainty_score":0.024307013},"labels":[],"label_agreement":null},{"id":"W944302435","doi":"10.1007/978-3-319-06826-8_17","title":"Parallel OWL Reasoning: Merge Classification","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","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":"Concordia University","funders":"","keywords":"Merge (version control); Computer science; Artificial intelligence; Information retrieval","score_opus":0.029379036458399694,"score_gpt":0.25996907751577714,"score_spread":0.23059004105737743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W944302435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00707229,0.00048169968,0.9614271,0.00055903883,0.00025509592,0.00023431299,0.00096339424,0.010750075,0.018257005],"genre_scores_gemma":[0.067850836,0.0004308473,0.91178954,0.0004610923,0.00011199777,0.00016613494,0.004900316,0.0017381371,0.012551018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996772,0.0005519513,0.0002847522,0.0007544157,0.0013706017,0.00026626044],"domain_scores_gemma":[0.99687505,0.0009583931,0.00010374888,0.0013816715,0.000578101,0.000102954844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382539,0.00142722,0.0013017954,0.0026182625,0.0015740463,0.005106905,0.005225085,0.0016750857,0.023489779],"category_scores_gemma":[0.0074828365,0.0015162202,0.0030713156,0.003354056,0.001416359,0.011783105,0.0061676963,0.0031092982,0.007906413],"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.00048050267,0.00053363125,0.0012302574,0.0004396022,0.00021003955,0.00029941564,0.00045497224,0.013818616,0.006498939,0.100642465,0.05364019,0.82175136],"study_design_scores_gemma":[0.00017197608,0.00005625013,0.0006861615,0.00016158276,0.0002803978,0.00042723748,0.00037097483,0.30660605,0.029559124,0.5674151,0.094191074,0.00007408932],"about_ca_topic_score_codex":0.008194697,"about_ca_topic_score_gemma":0.012316078,"teacher_disagreement_score":0.023489779,"about_ca_system_score_codex":0.0017986044,"about_ca_system_score_gemma":0.0027753145,"threshold_uncertainty_score":0.078581095},"labels":[],"label_agreement":null},{"id":"W945742075","doi":"10.1007/978-3-319-19992-4_41","title":"Moving Frames for Heart Fiber Reconstruction","year":2015,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Elasticity and Material Modeling","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Frame (networking); Orientation (vector space); Computer vision; Face (sociological concept); Inpainting; Iterative reconstruction; Diffusion MRI; Prior probability; Fiber; Pattern recognition (psychology); Magnetic resonance imaging; Mathematics; Image (mathematics)","score_opus":0.017911676296251455,"score_gpt":0.23437047461018012,"score_spread":0.21645879831392867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W945742075","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.004815663,0.0005356394,0.9934416,0.00008690141,0.00005358994,0.000020147254,0.00010109477,0.00038547907,0.00055984245],"genre_scores_gemma":[0.10561536,0.0019321289,0.8861925,0.00009362288,0.00019856176,0.00008906421,0.00073320203,0.00044702907,0.0046985387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970585,0.00008325337,0.0000145334625,0.00007084095,0.000089892244,0.00003568577],"domain_scores_gemma":[0.99941146,0.0002471631,0.000048025,0.00012384717,0.00012153147,0.000048041715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000857287,0.00084418815,0.0009821618,0.0014188247,0.00036805117,0.0010439,0.0012410472,0.0015062591,0.006366378],"category_scores_gemma":[0.0024180077,0.00084083405,0.0007725739,0.0010778712,0.0005029006,0.0011496055,0.0010428136,0.0017450226,0.0018996819],"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.0005996114,0.000094341696,0.0005992787,0.00027507692,0.000119885226,0.00020812027,0.0001538306,0.1174499,0.048558313,0.055477817,0.011156824,0.76530707],"study_design_scores_gemma":[0.000015767544,0.00003968616,0.0002814663,0.00002324195,0.000020649653,0.000084873594,0.00002267062,0.9780732,0.0065239575,0.010960466,0.0039390135,0.000015036257],"about_ca_topic_score_codex":0.0045539862,"about_ca_topic_score_gemma":0.0040235044,"teacher_disagreement_score":0.006366378,"about_ca_system_score_codex":0.00041394916,"about_ca_system_score_gemma":0.0005835042,"threshold_uncertainty_score":0.021297634},"labels":[],"label_agreement":null},{"id":"W94661608","doi":"10.1007/978-3-031-66456-4","title":"Engineering of Complex Computer Systems","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Singapore Management University; Peking University; Waseda University; Université Paris-Saclay; Danmarks Tekniske Universitet; Hanyang University; Tsinghua University; Huazhong University of Science and Technology; National Institute of Informatics; Concordia University; Chinese Academy of Sciences; Nanyang Technological University; National University of Singapore; University of New South Wales; Université de Lorraine; Western Michigan University","keywords":"Computer science; Systems engineering; Engineering","score_opus":0.01684933436613022,"score_gpt":0.23524279611734805,"score_spread":0.21839346175121782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94661608","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013631762,0.037350476,0.49173576,0.007917381,0.0027775913,0.00007648162,0.00027793733,0.000466246,0.44576636],"genre_scores_gemma":[0.49251735,0.049059443,0.14310107,0.0012574218,0.0046252054,0.00033025816,0.000524575,0.00038341977,0.30820128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997751,0.000053800704,0.000008110601,0.000027303799,0.00012184322,0.000013932667],"domain_scores_gemma":[0.99957687,0.00022523123,0.00002643981,0.00007462106,0.00007085722,0.000025917047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030773104,0.0005836658,0.00054832944,0.0007950402,0.0003648324,0.0016097778,0.0004052982,0.00048621994,0.010639397],"category_scores_gemma":[0.0013353614,0.00030816437,0.0002821516,0.00058546045,0.001438436,0.0013871025,0.00085033354,0.001378503,0.0019297583],"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.0000049727087,0.000011764717,0.0000847399,0.00010799294,0.000008215007,0.000032869088,0.000066290326,0.0072711986,0.00081718445,0.9470855,0.013506755,0.031002488],"study_design_scores_gemma":[0.000005094588,0.00001163874,0.0001931065,0.00003517697,0.0000033690674,0.00008666809,0.000024640482,0.016639145,0.00040061702,0.88207996,0.10051474,0.00000585246],"about_ca_topic_score_codex":0.00047115618,"about_ca_topic_score_gemma":0.00040879202,"teacher_disagreement_score":0.010639397,"about_ca_system_score_codex":0.00069571304,"about_ca_system_score_gemma":0.00041738697,"threshold_uncertainty_score":0.035592318},"labels":[],"label_agreement":null},{"id":"W94770133","doi":"10.1007/978-3-319-08599-9_88","title":"The iPad as a Mobile Learning Tool for Post-secondary Students with Disabilities","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Learning in Education","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":"Athabasca University","funders":"","keywords":"Computer science; Set (abstract data type); Multimedia; Mobile device; Mathematics education; World Wide Web; Psychology","score_opus":0.008651062145067279,"score_gpt":0.2668535603537346,"score_spread":0.2582024982086673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94770133","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.4862922,0.028372027,0.065256834,0.00509563,0.0027909942,0.0008111778,0.0024364165,0.005619971,0.4033247],"genre_scores_gemma":[0.47771677,0.021222785,0.07762555,0.0019703598,0.00043752816,0.00088653166,0.0011664014,0.0005759641,0.41839808],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998472,0.000027279244,0.000008147087,0.000026094684,0.000056765974,0.000034591572],"domain_scores_gemma":[0.9998429,0.00007062386,0.000008166764,0.0000096452,0.00002301369,0.000045543347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022550985,0.00069311843,0.00042575368,0.00065364916,0.00046342672,0.0011837025,0.0008596985,0.00086311874,0.024254601],"category_scores_gemma":[0.00074759615,0.00013885112,0.00040255813,0.00034665674,0.0002380884,0.0010839269,0.0018420069,0.000716272,0.009721128],"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.00026282144,0.0005072472,0.0019843206,0.00049674907,0.000008491216,0.001144822,0.0018391376,0.000062670195,0.01086811,0.0008090481,0.03271921,0.9492973],"study_design_scores_gemma":[0.00019781697,0.006535978,0.06460671,0.0023281644,0.00016506693,0.031651963,0.014229743,0.0023676495,0.02554092,0.0037603208,0.84846115,0.0001545928],"about_ca_topic_score_codex":0.00039333326,"about_ca_topic_score_gemma":0.0010138091,"teacher_disagreement_score":0.024254601,"about_ca_system_score_codex":0.00012566242,"about_ca_system_score_gemma":0.00039577318,"threshold_uncertainty_score":0.08113968},"labels":[],"label_agreement":null},{"id":"W948154642","doi":"10.1007/978-3-319-16631-5_17","title":"An Abstraction for Correspondence Search Using Task-Based Controls","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Abstraction; Set (abstract data type); Task (project management); Simple (philosophy); Process (computing); Matching (statistics); Abstraction layer; Feature (linguistics); Artificial intelligence; Feature matching; Theoretical computer science; Image (mathematics); Programming language; Software","score_opus":0.0654038300869933,"score_gpt":0.360539775056912,"score_spread":0.2951359449699187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W948154642","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.0036217815,0.00010907693,0.99052167,0.000049508624,0.000051869603,0.000060545895,0.00008895656,0.002006938,0.0034897393],"genre_scores_gemma":[0.2992484,0.00039957825,0.6829147,0.00013698057,0.00013352685,0.0003651819,0.0007006255,0.00088827894,0.015212797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987192,0.00021591513,0.00013364515,0.0003106146,0.0004311988,0.0001893653],"domain_scores_gemma":[0.99884856,0.00030601418,0.00005674368,0.00057045283,0.00013294964,0.00008511722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662676,0.0008257456,0.0010409802,0.0010454123,0.0008131295,0.002301635,0.0027132148,0.0012906657,0.012277958],"category_scores_gemma":[0.0029448366,0.0006427088,0.001562417,0.0012880954,0.0013332373,0.0035405818,0.0042672716,0.001923343,0.0032328316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074088504,0.00026322022,0.0008807916,0.00040927832,0.00010108322,0.00051210925,0.00088252156,0.056540795,0.038048394,0.5068495,0.010669548,0.38410196],"study_design_scores_gemma":[0.0000800357,0.00022878678,0.00044177473,0.00005293741,0.00008937069,0.00028249147,0.00012260962,0.6069907,0.01568889,0.34993184,0.026030956,0.000059555918],"about_ca_topic_score_codex":0.002851448,"about_ca_topic_score_gemma":0.002569163,"teacher_disagreement_score":0.012277958,"about_ca_system_score_codex":0.000513646,"about_ca_system_score_gemma":0.0008910333,"threshold_uncertainty_score":0.04107386},"labels":[],"label_agreement":null},{"id":"W948392062","doi":"10.1007/978-3-642-34638-5_13","title":"Ethical and Secure Data Sharing across Borders","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"Carleton University; Polytechnique Montréal","funders":"","keywords":"Data sharing; Computer science; Computer security; Ethical issues; Internet privacy; Law; Engineering ethics; Political science; Engineering","score_opus":0.06744910278126726,"score_gpt":0.3664652032437455,"score_spread":0.29901610046247823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W948392062","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028030733,0.0071430765,0.43368524,0.071553186,0.0013486873,0.00024429098,0.00015070409,0.00017757552,0.45766646],"genre_scores_gemma":[0.8751934,0.0043462543,0.06281617,0.0051740394,0.0009665409,0.0004988663,0.00014944239,0.00013836776,0.050716978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98029983,0.011607026,0.0009325657,0.0014289697,0.0045536505,0.0011779694],"domain_scores_gemma":[0.97872055,0.010278199,0.0011741268,0.0075953105,0.0015487821,0.00068304554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015130663,0.00048477118,0.00074741343,0.001046306,0.0035730968,0.00954917,0.0017211157,0.0057143243,0.005106902],"category_scores_gemma":[0.030030822,0.00057969766,0.0008072001,0.0014736953,0.017224325,0.013413456,0.0076273866,0.007652563,0.001031086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004415657,0.000006524922,0.000060488816,0.000016364744,0.000004274478,0.0000213094,0.00057948526,0.00036819183,0.0000781651,0.99277335,0.0012418947,0.004845645],"study_design_scores_gemma":[0.0000042426905,0.000005117384,0.0000580392,0.00005386692,0.0000037166292,0.000075198965,0.0003607921,0.00081575144,0.00024368487,0.9773194,0.021054389,0.000005752795],"about_ca_topic_score_codex":0.0009356006,"about_ca_topic_score_gemma":0.0008124402,"teacher_disagreement_score":0.015130663,"about_ca_system_score_codex":0.0027403098,"about_ca_system_score_gemma":0.0047706445,"threshold_uncertainty_score":0.08001959},"labels":[],"label_agreement":null},{"id":"W948627612","doi":"10.1007/978-3-642-40381-1_19","title":"PossDB: An Uncertainty Database Management System","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision 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":"Concordia University","funders":"","keywords":"Computer science; Probabilistic logic; The Internet; Probabilistic database; Database; Data management; Uncertain data; Information system; Data science; Data mining; World Wide Web; Database design; Database theory; Artificial intelligence","score_opus":0.07371408252984964,"score_gpt":0.32930924121039223,"score_spread":0.2555951586805426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W948627612","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.010560402,0.0022664347,0.7897023,0.0009581599,0.0003526094,0.00031033505,0.016205182,0.16247238,0.017172165],"genre_scores_gemma":[0.2202677,0.004471412,0.6617925,0.0018768066,0.0006985809,0.00076344266,0.064018756,0.01472689,0.03138394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860966,0.00014320826,0.00018027658,0.00017608704,0.0008317465,0.00005906558],"domain_scores_gemma":[0.9979412,0.0006292108,0.00014566307,0.00069046457,0.0004410262,0.00015249732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002110758,0.0009559355,0.0010723119,0.0024244436,0.0006899961,0.003701004,0.0029760627,0.0008632285,0.015582191],"category_scores_gemma":[0.0072227526,0.0008291612,0.0007109637,0.002822099,0.00047261672,0.005569402,0.0027668155,0.0013040283,0.0073584835],"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.0010476217,0.00022237591,0.0035834592,0.0011244123,0.00035586779,0.00046442688,0.00039055254,0.02432844,0.011821669,0.065362975,0.28414705,0.60715115],"study_design_scores_gemma":[0.0002723515,0.00018019626,0.0020513027,0.00018233566,0.00028319235,0.0010706506,0.00016364659,0.3616947,0.026426593,0.12443089,0.48302287,0.00022134862],"about_ca_topic_score_codex":0.0022537766,"about_ca_topic_score_gemma":0.0015902921,"teacher_disagreement_score":0.015582191,"about_ca_system_score_codex":0.0005895624,"about_ca_system_score_gemma":0.0015734858,"threshold_uncertainty_score":0.05212766},"labels":[],"label_agreement":null},{"id":"W94982151","doi":"10.1007/978-3-642-35261-4_35","title":"Robust Nonparametric Data Approximation of Point Sets via Data Reduction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba","funders":"","keywords":"Cardinality (data modeling); Subsequence; Combinatorics; Simple (philosophy); Polygonal chain; Sequence (biology); Mathematics; Monotonic function; Algorithm; Nonparametric statistics; Piecewise; Piecewise linear function; Data point; Plane (geometry); Discrete mathematics; Computer science; Geometry; Regular polygon; Bounded function; Mathematical analysis","score_opus":0.07646406454023247,"score_gpt":0.2827545805741936,"score_spread":0.20629051603396115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94982151","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.0015161487,0.00007199573,0.9980617,0.000030296176,0.0000099708295,0.000010037921,0.000022235934,0.0001010439,0.00017660054],"genre_scores_gemma":[0.105828084,0.00037762255,0.8908023,0.00007275052,0.0000824936,0.00021923732,0.00044504102,0.00024234033,0.0019300531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971848,0.0009368094,0.00015287574,0.00040457334,0.0012130274,0.000107910135],"domain_scores_gemma":[0.99546635,0.0025520853,0.00026306373,0.0010946427,0.00055530533,0.00006853461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024170498,0.00093543925,0.0024152407,0.0015883173,0.00043323403,0.0018201431,0.0022985023,0.0014437077,0.001352664],"category_scores_gemma":[0.010563579,0.001203854,0.0022046294,0.0019960525,0.001703016,0.0015709462,0.0042110067,0.0032794103,0.00091729866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023849097,0.000095794836,0.0006900242,0.00031202496,0.00013624284,0.00010636478,0.00019381728,0.5503114,0.014454486,0.07879036,0.0031419522,0.35152906],"study_design_scores_gemma":[0.000005619042,0.000020806136,0.000116343734,0.000010189764,0.000009929513,0.00004983694,0.000010677691,0.9748039,0.0021438128,0.02151966,0.0012983211,0.000010798693],"about_ca_topic_score_codex":0.0016266211,"about_ca_topic_score_gemma":0.0011991977,"teacher_disagreement_score":0.0024170498,"about_ca_system_score_codex":0.0007431754,"about_ca_system_score_gemma":0.00085237785,"threshold_uncertainty_score":0.012782693},"labels":[],"label_agreement":null},{"id":"W950586868","doi":"10.1007/978-3-319-18356-5_5","title":"Policies, Conversations, and Conversation Composition","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Media, Communication, and Education","field":"Social Sciences","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 Calgary","funders":"","keywords":"Conversation; Composition (language); Computer science; Linguistics; Sociology; Psychology; Communication; Philosophy","score_opus":0.04594146452351649,"score_gpt":0.3182361265590203,"score_spread":0.2722946620355038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W950586868","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1942,0.011476987,0.3166298,0.013683102,0.00050399185,0.00024269728,0.0007220621,0.00077928364,0.46176207],"genre_scores_gemma":[0.95570403,0.0021438356,0.026221486,0.00027952582,0.00021333942,0.00021683855,0.00037604466,0.00018471986,0.014660199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995789,0.0025568071,0.0002098569,0.0005766711,0.0004889781,0.0003787423],"domain_scores_gemma":[0.9883886,0.008686014,0.0009516463,0.00084598036,0.00051890704,0.00060881785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004959562,0.0006003933,0.0004478878,0.0014437085,0.0026779938,0.0086597195,0.0010843234,0.0017926806,0.009635554],"category_scores_gemma":[0.025995387,0.0007441793,0.0005169104,0.0015486187,0.004710335,0.012322907,0.0033078024,0.0022809163,0.0014962294],"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.0001869962,0.000060769602,0.0021549133,0.00010999126,0.00002451077,0.000087523746,0.0076710205,0.0027836524,0.0009371798,0.94204074,0.0027164374,0.04122635],"study_design_scores_gemma":[0.000025663843,0.000019652696,0.0012766501,0.00010545883,0.000027901388,0.00008581096,0.0032524741,0.010430703,0.00078516226,0.96701694,0.016947947,0.000025782156],"about_ca_topic_score_codex":0.0032911596,"about_ca_topic_score_gemma":0.0018099776,"teacher_disagreement_score":0.009635554,"about_ca_system_score_codex":0.001895902,"about_ca_system_score_gemma":0.0019891805,"threshold_uncertainty_score":0.032234192},"labels":[],"label_agreement":null},{"id":"W95146287","doi":"10.1007/978-3-642-33418-4_47","title":"Hierarchical Conditional Random Fields for Detection of Gad-Enhancing Lesions in Multiple Sclerosis","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","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":"Montreal Neurological Institute and Hospital; NeuroRx Research (Canada); McGill University","funders":"","keywords":"Conditional random field; Voxel; Pattern recognition (psychology); Multiple sclerosis; Lesion; Artificial intelligence; Computer science; Probabilistic logic; Feature (linguistics); Medicine; Pathology","score_opus":0.03657310260315619,"score_gpt":0.291024444011149,"score_spread":0.25445134140799286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95146287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11597512,0.0012278627,0.8792661,0.00032676884,0.000044826866,0.00011864312,0.00054327043,0.0016418454,0.0008556349],"genre_scores_gemma":[0.7237657,0.0005892722,0.2723385,0.0001544662,0.000084297964,0.00013409866,0.001072528,0.00019471537,0.0016663951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997156,0.00011560749,0.000012520736,0.00004250399,0.00006639096,0.00004733702],"domain_scores_gemma":[0.9983114,0.0012631769,0.00011845441,0.0000828602,0.00016361305,0.000060574428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017787811,0.00043061146,0.00055547094,0.0018016968,0.0003660317,0.00046270393,0.00080750434,0.00085020193,0.0012244129],"category_scores_gemma":[0.0031443303,0.00038046227,0.0007704951,0.00049752305,0.0003258559,0.0004338874,0.00055055105,0.0006459952,0.0003049312],"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.0014264274,0.0004007103,0.011187629,0.00035564366,0.00022019142,0.00033632643,0.00015903686,0.45082802,0.056646507,0.009774652,0.006797542,0.46186736],"study_design_scores_gemma":[0.000021449649,0.000049203965,0.0039962814,0.000014605283,0.00003777344,0.000105406434,0.000013833265,0.9871895,0.0048865685,0.0032854164,0.00038185058,0.000018054096],"about_ca_topic_score_codex":0.009624103,"about_ca_topic_score_gemma":0.0123906275,"teacher_disagreement_score":0.009624103,"about_ca_system_score_codex":0.00063265645,"about_ca_system_score_gemma":0.0010441148,"threshold_uncertainty_score":0.01913613},"labels":[],"label_agreement":null},{"id":"W95309022","doi":"10.1007/978-3-642-40760-4_70","title":"Lateral Ventricle Segmentation of 3D Pre-term Neonates US Using Convex Optimization","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Neonatal and fetal brain pathology","field":"Medicine","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canadian Institutes of Health Research","keywords":"Segmentation; Computer science; Ventricle; Dilation (metric space); Regular polygon; Convex optimization; Intraventricular hemorrhage; Gestational age; Algorithm; Artificial intelligence; Mathematical optimization; Medicine; Cardiology; Mathematics","score_opus":0.011440752499720503,"score_gpt":0.26521829904160754,"score_spread":0.25377754654188706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95309022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16975832,0.0009621366,0.82458305,0.00042706935,0.000030594616,0.00010915814,0.00040699312,0.0011044255,0.0026182022],"genre_scores_gemma":[0.51795614,0.00110979,0.47692558,0.00013727997,0.00005450942,0.00019333867,0.0007909702,0.00067249616,0.002159927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997601,0.00006473194,0.000020989348,0.000041016992,0.000077628276,0.00003559162],"domain_scores_gemma":[0.99964666,0.00018035813,0.000043088174,0.00003500676,0.000070312184,0.00002453468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007187349,0.0006448046,0.00066506123,0.0011504972,0.000329089,0.0014588556,0.0005683453,0.0010517546,0.001223359],"category_scores_gemma":[0.0017806633,0.00060953933,0.0008334936,0.0005921588,0.00036194065,0.00060673605,0.000827415,0.00052570686,0.0005119955],"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.0010361656,0.000116141986,0.014278458,0.000498814,0.00018786672,0.003124575,0.0007872677,0.29002252,0.23257701,0.007742142,0.0043715597,0.44525748],"study_design_scores_gemma":[0.000016118207,0.000075296484,0.0056010773,0.00006205296,0.000047534704,0.0013540118,0.0001674588,0.9423127,0.04514588,0.0030276726,0.0021572073,0.000032999385],"about_ca_topic_score_codex":0.0030682727,"about_ca_topic_score_gemma":0.0036253333,"teacher_disagreement_score":0.0030682727,"about_ca_system_score_codex":0.0005112011,"about_ca_system_score_gemma":0.0012278149,"threshold_uncertainty_score":0.0061008334},"labels":[],"label_agreement":null},{"id":"W95321849","doi":"10.1007/978-3-642-30353-1_43","title":"Populating a Knowledge Base from a Dictionary","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; USable; Knowledge base; Encyclopedia; Artificial intelligence; Natural language processing; Task (project management); Question answering; Knowledge-based systems; Natural language; Information retrieval; World Wide Web","score_opus":0.020120521833711682,"score_gpt":0.2706545788491563,"score_spread":0.2505340570154446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95321849","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.04628026,0.0013326169,0.90672207,0.0011615196,0.000402592,0.000741881,0.008384967,0.01410822,0.020865813],"genre_scores_gemma":[0.10819171,0.0018092103,0.85573894,0.00041584502,0.000113009446,0.0003213323,0.019977998,0.001454339,0.011977582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993585,0.00010582652,0.000074813506,0.0001685151,0.00023555454,0.000056884077],"domain_scores_gemma":[0.9977168,0.0013563582,0.000058657035,0.00040775235,0.0003653387,0.0000950928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074067817,0.0008787672,0.0014246446,0.004444095,0.0011329887,0.0033604265,0.0023341107,0.0012841179,0.014038579],"category_scores_gemma":[0.0066835,0.0008900067,0.0018644246,0.0043800985,0.0006988705,0.0057626255,0.0053924876,0.0015731697,0.007746225],"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.0004892472,0.0002425414,0.0017103322,0.0017063755,0.00022943722,0.0025238711,0.0012921492,0.012491203,0.028944306,0.037830368,0.038866162,0.873674],"study_design_scores_gemma":[0.00026467713,0.00046346642,0.0026970305,0.0014637709,0.0013225456,0.0041789063,0.0033502276,0.31005242,0.08099115,0.18810847,0.4068397,0.00026763623],"about_ca_topic_score_codex":0.003320663,"about_ca_topic_score_gemma":0.0050553144,"teacher_disagreement_score":0.014038579,"about_ca_system_score_codex":0.00060473674,"about_ca_system_score_gemma":0.0016515495,"threshold_uncertainty_score":0.04696375},"labels":[],"label_agreement":null},{"id":"W954237795","doi":"10.1007/978-3-642-28320-8_36","title":"An Integrated Approach to Multi-criteria-Based Health Care Facility Location Planning","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Calgary","funders":"","keywords":"Computer science; Health care; Health informatics; Order (exchange); Informatics; Facility location problem; Health facility; Operations research; Systems engineering; Health services; Medicine; Engineering; Business; Environmental health","score_opus":0.055634092293402077,"score_gpt":0.2922224098279566,"score_spread":0.23658831753455453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W954237795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028197805,0.0002604381,0.9923712,0.00011995798,0.000035623325,0.00008182062,0.00011727988,0.00010818404,0.0040857457],"genre_scores_gemma":[0.18037222,0.000609936,0.81411654,0.000096602394,0.00008254996,0.000404659,0.00045539558,0.000099209894,0.0037629753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970592,0.0009615045,0.0002310414,0.00039564184,0.0011046119,0.0002480952],"domain_scores_gemma":[0.99819714,0.0010399194,0.00011072767,0.000109444336,0.00044430507,0.00009845271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025801838,0.0014280486,0.0022032536,0.0028273088,0.0008969517,0.0037740273,0.003413431,0.0017009501,0.0065726726],"category_scores_gemma":[0.005070618,0.0011995832,0.0026316163,0.005098778,0.0008336345,0.0022909695,0.0034428746,0.0018244054,0.00066669885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005406172,0.00016926615,0.0009228711,0.00022710269,0.0003498737,0.000206073,0.00019712462,0.8379731,0.0011450591,0.047350645,0.0023196465,0.10908525],"study_design_scores_gemma":[0.000014173775,0.000050823972,0.00036223006,0.000037249767,0.00006212793,0.00004782513,0.00006861763,0.9674498,0.0002553094,0.029143317,0.0024889407,0.00001955826],"about_ca_topic_score_codex":0.016178308,"about_ca_topic_score_gemma":0.016641637,"teacher_disagreement_score":0.016178308,"about_ca_system_score_codex":0.002311422,"about_ca_system_score_gemma":0.0025347846,"threshold_uncertainty_score":0.03216827},"labels":[],"label_agreement":null},{"id":"W954629016","doi":"10.1007/978-3-662-43652-3_32","title":"Staged Evaluation of Partial Instances in a Relational Model Finder","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Axiom; Computer science; Generator (circuit theory); Property (philosophy); Scalability; Spurious relationship; Scope (computer science); Theoretical computer science; Algorithm; Programming language; Mathematics; Database; Machine learning; Power (physics)","score_opus":0.0837871617167047,"score_gpt":0.3233108398344413,"score_spread":0.23952367811773662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W954629016","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.053094555,0.000137323,0.92964655,0.00038626243,0.00007944334,0.00034101438,0.00046154228,0.008142666,0.007710579],"genre_scores_gemma":[0.3535027,0.00012427289,0.63160634,0.00016501962,0.000036583995,0.00019409752,0.0011255835,0.0024390437,0.010806302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452704,0.0015199479,0.00032611517,0.00076249026,0.002381628,0.0004827826],"domain_scores_gemma":[0.9911897,0.005116532,0.0002595764,0.002284378,0.0009678127,0.0001819075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048978743,0.00085349614,0.0011931652,0.0010461102,0.0007762401,0.0027848447,0.0027501907,0.001356234,0.016129421],"category_scores_gemma":[0.016672598,0.00094483956,0.0023520445,0.0007090107,0.0017494522,0.0062958626,0.0047943774,0.0016318603,0.0022544735],"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.0017853186,0.0005230762,0.0036443651,0.0011538651,0.00036288626,0.0012939682,0.001762958,0.12442533,0.07259626,0.3787912,0.012670561,0.4009902],"study_design_scores_gemma":[0.00012860638,0.0003045392,0.00066541246,0.00016621331,0.00023755306,0.00031777186,0.0003875714,0.6877427,0.07978642,0.21286152,0.017300816,0.00010086232],"about_ca_topic_score_codex":0.00222186,"about_ca_topic_score_gemma":0.004879331,"teacher_disagreement_score":0.016129421,"about_ca_system_score_codex":0.0014496497,"about_ca_system_score_gemma":0.0017909971,"threshold_uncertainty_score":0.053958356},"labels":[],"label_agreement":null},{"id":"W95632006","doi":"10.1007/978-3-642-40131-2_8","title":"Discovering Co-location Patterns in Datasets with Extended Spatial Objects","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Data mining; Computer science; Grid; A priori and a posteriori; Database transaction; Spatial analysis; Geography; Pattern recognition (psychology); Artificial intelligence; Database; Remote sensing","score_opus":0.012426441170611957,"score_gpt":0.23879380284367144,"score_spread":0.2263673616730595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95632006","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.44263363,0.009109242,0.45391858,0.0020458617,0.00038365705,0.0003867008,0.08090188,0.004637702,0.0059827454],"genre_scores_gemma":[0.5205763,0.0028354013,0.37373295,0.00026409698,0.00030165655,0.00030249576,0.098997615,0.0002322848,0.002757217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983633,0.00020189484,0.00019746205,0.0006554613,0.00044862527,0.00013325548],"domain_scores_gemma":[0.9963337,0.0017393094,0.00045867282,0.00096174364,0.00034629574,0.00016015049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010931898,0.0009229141,0.0011241469,0.006086115,0.0008547548,0.002347516,0.0018575311,0.001233241,0.0014942737],"category_scores_gemma":[0.0066696703,0.00055259187,0.0018887259,0.014153624,0.000565256,0.0042114425,0.0024706975,0.001223162,0.0016499347],"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.0010568562,0.000681164,0.28125718,0.002416658,0.0016510679,0.0024593966,0.0018886417,0.033341564,0.02299286,0.011026013,0.043592,0.59763664],"study_design_scores_gemma":[0.00013949405,0.0004551321,0.19713764,0.0006668415,0.0011573146,0.00705376,0.0061890497,0.57079804,0.019141559,0.10461268,0.09244088,0.00020763079],"about_ca_topic_score_codex":0.005459834,"about_ca_topic_score_gemma":0.015622832,"teacher_disagreement_score":0.006086115,"about_ca_system_score_codex":0.00064438843,"about_ca_system_score_gemma":0.0010213698,"threshold_uncertainty_score":0.010856152},"labels":[],"label_agreement":null},{"id":"W956637857","doi":"10.1007/978-3-319-11215-2_15","title":"The Road to Direction","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Urban Design and Spatial Analysis","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer vision; Computer graphics (images)","score_opus":0.008653977104638095,"score_gpt":0.1952553287953886,"score_spread":0.1866013516907505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W956637857","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079625816,0.00681242,0.006275174,0.011402762,0.0023313586,0.000011881523,0.00009144179,0.00008986732,0.97218883],"genre_scores_gemma":[0.10697823,0.012158588,0.005795569,0.0041366247,0.0013520767,0.00007488959,0.00027746,0.00040080294,0.8688258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994789,0.00016831793,0.0000142384615,0.00011114997,0.00014141723,0.000085989705],"domain_scores_gemma":[0.99965584,0.000082328996,0.000017841083,0.00006706521,0.00010538288,0.00007158812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061138894,0.00049738865,0.00037342665,0.00081052247,0.003068909,0.0064592375,0.0008058221,0.0018391038,0.05036522],"category_scores_gemma":[0.0017913321,0.00035933734,0.0003399359,0.0008446364,0.0061081015,0.0059647034,0.0027187646,0.0037784078,0.018881671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006046846,0.0000034047616,0.00006827465,0.000021002403,0.0000013852599,0.000015705851,0.0005929545,0.00009183223,0.000040174964,0.91303235,0.06388263,0.022244236],"study_design_scores_gemma":[0.0000025608388,0.0000036945564,0.000054415625,0.000062928724,0.0000012741432,0.000031786123,0.0004065003,0.000053774584,0.000030756324,0.19134556,0.8080025,0.000004318155],"about_ca_topic_score_codex":0.0077286856,"about_ca_topic_score_gemma":0.012972383,"teacher_disagreement_score":0.05036522,"about_ca_system_score_codex":0.002038141,"about_ca_system_score_gemma":0.0024687897,"threshold_uncertainty_score":0.16848844},"labels":[],"label_agreement":null},{"id":"W957708793","doi":"10.1007/978-3-319-20804-6_58","title":"Laughter as the Best Medicine: Exploring Humour-Mediated Health Applications","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Humor Studies and Applications","field":"Psychology","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 Ottawa; Wilfrid Laurier University","funders":"","keywords":"Laughter; Comics; Aqueous humour; Psychology; Domain (mathematical analysis); Aesthetics; Psychotherapist; Medicine; Social psychology; Literature; Art; Psychiatry","score_opus":0.11509398912777033,"score_gpt":0.37129433282835855,"score_spread":0.2562003437005882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W957708793","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.120481275,0.059088748,0.16017796,0.01654837,0.0010279369,0.00024505408,0.00019374357,0.0004938977,0.64174306],"genre_scores_gemma":[0.85132945,0.020782275,0.05080522,0.0031697063,0.0006185911,0.00018795549,0.00013783928,0.00016672318,0.07280229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.00036084233,0.0000076513525,0.00004669969,0.00009768444,0.00004367427],"domain_scores_gemma":[0.9976604,0.002007634,0.00007063535,0.00007710718,0.000094531,0.00008964512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009814766,0.0006087254,0.00028206498,0.0005878631,0.00089597364,0.0057405517,0.0011407264,0.0014753775,0.0075947023],"category_scores_gemma":[0.0035938825,0.00019106624,0.00035668985,0.00071825087,0.0029711232,0.003104966,0.0022219964,0.0013412794,0.00080296304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001747106,0.00021183475,0.0030799047,0.0017244964,0.00007738834,0.0008640789,0.08442201,0.0021466266,0.007964289,0.5219576,0.024329398,0.35304776],"study_design_scores_gemma":[0.00007100731,0.00039472044,0.010229827,0.0028447611,0.00014479454,0.0029939217,0.062585406,0.01878871,0.0073945285,0.47324988,0.4211749,0.0001274542],"about_ca_topic_score_codex":0.0008495787,"about_ca_topic_score_gemma":0.0015183967,"teacher_disagreement_score":0.0075947023,"about_ca_system_score_codex":0.00070500904,"about_ca_system_score_gemma":0.00085380726,"threshold_uncertainty_score":0.025406837},"labels":[],"label_agreement":null},{"id":"W957774261","doi":"10.1007/978-3-319-20678-3_42","title":"Mediating Asymmetries in Family Communication: Supporting the eInclusion of Older Adults","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Technology Use by Older Adults","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Appropriation; Social media; Mediation; Psychology; Grounded theory; Social psychology; Social isolation; Developmental psychology; Computer science; Sociology; World Wide Web; Qualitative research; Psychotherapist","score_opus":0.021307061807461763,"score_gpt":0.2985370500982446,"score_spread":0.2772299882907828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W957774261","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.9487898,0.0013782622,0.0028667254,0.0022511499,0.00006831047,0.00003042612,0.00011712536,0.000026344373,0.04447193],"genre_scores_gemma":[0.99680495,0.00037539742,0.0010864267,0.00014184162,0.000015090604,0.000022295408,0.000032299722,0.000007309828,0.0015143362],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99898416,0.00052986084,0.000037965205,0.00013841335,0.00014076248,0.00016876974],"domain_scores_gemma":[0.9929141,0.0047928267,0.00090220704,0.0005346455,0.000349565,0.00050673605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032441204,0.00051923806,0.0004239551,0.0006837776,0.0022742697,0.0041485066,0.0010453655,0.0013037422,0.008862517],"category_scores_gemma":[0.013506966,0.0003241502,0.0002529479,0.0005242127,0.002567786,0.0048778774,0.0031899938,0.0014324336,0.0004486516],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016428959,0.0010551318,0.15200007,0.0006888764,0.0001353764,0.003193943,0.38598216,0.0009823146,0.013902143,0.16330019,0.006351376,0.27076557],"study_design_scores_gemma":[0.0006311486,0.00096304266,0.41689038,0.0014379617,0.0004920155,0.0023454374,0.28401276,0.0061719576,0.01030638,0.22948837,0.047047358,0.00021318835],"about_ca_topic_score_codex":0.0068954676,"about_ca_topic_score_gemma":0.0052272794,"teacher_disagreement_score":0.008862517,"about_ca_system_score_codex":0.0013331344,"about_ca_system_score_gemma":0.0025618733,"threshold_uncertainty_score":0.029648125},"labels":[],"label_agreement":null},{"id":"W95807225","doi":"10.1007/978-3-319-10160-6_28","title":"Mining Interesting “Following” Patterns from Social Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Friendship; Interdependence; Social network (sociolinguistics); Social network analysis; World Wide Web; Social group; Space (punctuation); Data science; Data mining; Social media; Sociology","score_opus":0.017154467422948474,"score_gpt":0.2604619033120014,"score_spread":0.24330743588905296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95807225","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.73701775,0.0043968554,0.22964606,0.0015050136,0.00022813142,0.0003414695,0.01577589,0.0013438317,0.0097448835],"genre_scores_gemma":[0.86125404,0.0016530554,0.107622,0.00022960856,0.0003379269,0.0002073409,0.022437122,0.00012235972,0.0061366586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.00009856788,0.000066932735,0.00025218102,0.00017383596,0.00006549601],"domain_scores_gemma":[0.997538,0.0013927041,0.00042309484,0.00028598763,0.0002233308,0.00013689134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035779018,0.00072273205,0.00062427425,0.003968534,0.0006614014,0.0009028182,0.001265815,0.0012012189,0.0019306605],"category_scores_gemma":[0.003877545,0.0004216547,0.0011566657,0.0037735861,0.00038879132,0.0023630555,0.0008427331,0.00076427014,0.0011193772],"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.0011489799,0.0010332011,0.23135579,0.0017996146,0.0012633892,0.0032308942,0.00097364804,0.047201935,0.024073118,0.021464758,0.03356472,0.63288987],"study_design_scores_gemma":[0.000110424546,0.0004757794,0.09058814,0.00028526122,0.0007362325,0.004113244,0.0014029552,0.7451669,0.014104295,0.110814035,0.032125372,0.00007741388],"about_ca_topic_score_codex":0.002075496,"about_ca_topic_score_gemma":0.0064570075,"teacher_disagreement_score":0.003968534,"about_ca_system_score_codex":0.0003320188,"about_ca_system_score_gemma":0.00039953235,"threshold_uncertainty_score":0.0064586997},"labels":[],"label_agreement":null},{"id":"W95819301","doi":"10.1007/3-540-44983-3_20","title":"Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders (Extended Abstract)","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Prime (order theory); Cryptosystem; Factorization; Quadratic equation; Embedding; Discrete mathematics; Class (philosophy); Group (periodic table); Logarithm; Cyclic group; Mathematics; Computer science; Algebra over a field; Theoretical computer science; Pure mathematics; Combinatorics; Algorithm; Public-key cryptography; Cryptography; Encryption; Artificial intelligence","score_opus":0.026177758402865958,"score_gpt":0.28772726128539006,"score_spread":0.2615495028825241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95819301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03939935,0.003804537,0.82662046,0.0026521909,0.0007632993,0.00019093532,0.00013138645,0.0015091089,0.124928765],"genre_scores_gemma":[0.46271193,0.0051623425,0.4107602,0.0006570484,0.0008902913,0.0002510509,0.00047493135,0.00071634026,0.11837585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993405,0.00011960457,0.000025079447,0.000085737396,0.00033862455,0.000090454545],"domain_scores_gemma":[0.99921024,0.0004372327,0.000036055055,0.00017083412,0.000100675985,0.0000449269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856143,0.00090074877,0.0005178159,0.00047386653,0.00072875636,0.0025015764,0.0011184749,0.00088807195,0.011967219],"category_scores_gemma":[0.0014844269,0.00068139675,0.00046931658,0.0006579916,0.002130049,0.0052303276,0.0020943445,0.003499464,0.0039443295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000190045,0.00010235327,0.00012484918,0.00034414837,0.000017179887,0.000132447,0.00034056103,0.007875194,0.018126445,0.8821579,0.008550106,0.08203885],"study_design_scores_gemma":[0.00013225086,0.00015655204,0.00018338552,0.00011690258,0.000022283328,0.00036329977,0.00008918986,0.065481156,0.027731169,0.8291945,0.07648791,0.000041410065],"about_ca_topic_score_codex":0.00023487928,"about_ca_topic_score_gemma":0.00038675003,"teacher_disagreement_score":0.011967219,"about_ca_system_score_codex":0.0011486225,"about_ca_system_score_gemma":0.00054544845,"threshold_uncertainty_score":0.040034294},"labels":[],"label_agreement":null},{"id":"W95892887","doi":"10.1007/978-3-642-32946-3_2","title":"The MVP Web-Based Authentication Framework","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Authentication (law); Key (lock); World Wide Web; Generic Bootstrapping Architecture; Multi-factor authentication; Computer security; Authentication protocol","score_opus":0.017665498137444998,"score_gpt":0.25334475796921707,"score_spread":0.23567925983177207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95892887","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.0060673505,0.0006887819,0.90999424,0.0003177576,0.00021922837,0.00023126816,0.00062337983,0.052374013,0.029483924],"genre_scores_gemma":[0.36644432,0.00201241,0.5291705,0.0008319729,0.0003409136,0.0007243094,0.0054035718,0.0058615627,0.0892105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889106,0.00016542924,0.00007954402,0.00014632185,0.0005618386,0.0001558796],"domain_scores_gemma":[0.9993506,0.000095689276,0.000036478606,0.00031225756,0.00013346336,0.00007161344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170248,0.0007031862,0.0007097299,0.0011246675,0.00079010415,0.00281964,0.0024499763,0.0015882644,0.012844954],"category_scores_gemma":[0.0021024083,0.00064190745,0.0006786489,0.000720493,0.00058231945,0.0033876125,0.0041803992,0.0020465741,0.010457286],"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.0008045429,0.0002762286,0.000975164,0.0006772922,0.00009116513,0.0007471125,0.00042545746,0.011018739,0.03053507,0.24721259,0.09532285,0.6119138],"study_design_scores_gemma":[0.00014948512,0.00020823404,0.0014325283,0.0003756966,0.00014073396,0.002464451,0.00017610157,0.22624949,0.061630506,0.19513436,0.5118617,0.00017678256],"about_ca_topic_score_codex":0.0014709648,"about_ca_topic_score_gemma":0.001154092,"teacher_disagreement_score":0.012844954,"about_ca_system_score_codex":0.0005816552,"about_ca_system_score_gemma":0.0010274672,"threshold_uncertainty_score":0.042970657},"labels":[],"label_agreement":null},{"id":"W95913851","doi":"10.1007/978-3-642-40811-3_25","title":"Efficient Convex Optimization Approach to 3D Non-rigid MR-TRUS Registration","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research; Canada Research Chairs","keywords":"Fiducial marker; Artificial intelligence; Image registration; Prostate biopsy; Iterative closest point; Computer science; Computer vision; Similarity (geometry); Medicine; Pattern recognition (psychology); Prostate; Point cloud; Image (mathematics)","score_opus":0.01217857219525953,"score_gpt":0.25951894885892285,"score_spread":0.24734037666366332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95913851","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.0006406991,0.000057918343,0.9985715,0.000050092083,0.000008272129,0.000015135525,0.000026959562,0.00023225075,0.00039708908],"genre_scores_gemma":[0.05802672,0.00032024438,0.9359432,0.00010854623,0.000063583175,0.00020261011,0.0003311602,0.0007339092,0.0042700367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872416,0.00035570769,0.000073583935,0.00017352878,0.0005811386,0.00009193949],"domain_scores_gemma":[0.9986603,0.00069517014,0.00009008678,0.00018621182,0.00031255028,0.00005569598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014710873,0.0012324038,0.0020085673,0.0014715175,0.00066090806,0.0020922597,0.0026915297,0.0016581536,0.0060439403],"category_scores_gemma":[0.003885222,0.0013643099,0.0016824147,0.0017334116,0.0008391057,0.0014071019,0.0030559057,0.0022592505,0.0029310447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016383371,0.00012942539,0.00029888382,0.00022034634,0.00012065074,0.00019403851,0.00013029565,0.63083714,0.013594242,0.032005277,0.0066311955,0.31567472],"study_design_scores_gemma":[0.00000461387,0.000013918658,0.000064474836,0.0000044959484,0.000006873951,0.000047218415,0.00000851544,0.9928751,0.0013846265,0.004330634,0.0012524553,0.0000071506283],"about_ca_topic_score_codex":0.0062521994,"about_ca_topic_score_gemma":0.009653166,"teacher_disagreement_score":0.0062521994,"about_ca_system_score_codex":0.00090815476,"about_ca_system_score_gemma":0.0019562563,"threshold_uncertainty_score":0.020218968},"labels":[],"label_agreement":null},{"id":"W959753905","doi":"10.1007/978-3-319-20895-4_9","title":"The Value of Expert vs User Generated Information in Online Health Communities","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Misinformation and Its Impacts","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":"Simon Fraser University","funders":"","keywords":"Affect (linguistics); Knowledge management; Computer science; Tacit knowledge; Value (mathematics); Set (abstract data type); Perspective (graphical); Knowledge sharing; Value of information; Health information; Health care; Psychology; Artificial intelligence","score_opus":0.05888509603564901,"score_gpt":0.33725701852033485,"score_spread":0.27837192248468584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W959753905","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.6189664,0.013045164,0.020466702,0.027196975,0.00036658114,0.00020723097,0.0005657486,0.00019590562,0.31898934],"genre_scores_gemma":[0.9918704,0.0009823946,0.0035080195,0.00034195982,0.00019211593,0.000026644293,0.000060319217,0.000024155877,0.0029939993],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9879182,0.008811661,0.00020081886,0.0004118465,0.0022159875,0.00044159807],"domain_scores_gemma":[0.7928342,0.1879794,0.004122838,0.004786575,0.0070455326,0.0032314209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015650552,0.0003479218,0.00046910977,0.0037073179,0.00237207,0.0101180775,0.0013737057,0.0036357585,0.010190059],"category_scores_gemma":[0.09821714,0.0003435552,0.00046050164,0.003298797,0.0032624926,0.017430108,0.0036966812,0.001882772,0.00078068505],"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.0020746416,0.0012733609,0.0521985,0.0011217706,0.00031112504,0.0006662227,0.018703189,0.008980578,0.0018313712,0.33243656,0.018119149,0.5622835],"study_design_scores_gemma":[0.0002706158,0.0011175515,0.036940068,0.0017642294,0.0007039522,0.0009874385,0.04057744,0.08526279,0.005064752,0.78833395,0.038805973,0.0001712597],"about_ca_topic_score_codex":0.00286179,"about_ca_topic_score_gemma":0.0039466624,"teacher_disagreement_score":0.015650552,"about_ca_system_score_codex":0.0026053155,"about_ca_system_score_gemma":0.001538829,"threshold_uncertainty_score":0.08276904},"labels":[],"label_agreement":null},{"id":"W96010459","doi":"10.1007/978-3-319-10431-7_23","title":"A Tool for Verifying Dynamic Properties in B","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Property (philosophy); Computer science; Reservation; Programming language; Computer network","score_opus":0.03354115495685481,"score_gpt":0.2786419527166393,"score_spread":0.24510079775978447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96010459","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.005110545,0.00016801941,0.97789395,0.00008118831,0.000074562144,0.000097627984,0.00029582318,0.010273431,0.0060048797],"genre_scores_gemma":[0.15333135,0.00038971726,0.828077,0.00023045565,0.00005732147,0.00037180237,0.0009896657,0.0032597035,0.013292964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844724,0.00026602944,0.00015664333,0.0003689123,0.0005947527,0.00016650095],"domain_scores_gemma":[0.99714124,0.0016894016,0.00017567088,0.0006144236,0.00027330045,0.00010594467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374182,0.0015414174,0.0010121535,0.001941852,0.0013531296,0.0023992006,0.0018306545,0.0015156412,0.009297012],"category_scores_gemma":[0.004817412,0.0013276656,0.0012724961,0.0013571635,0.0018219105,0.0042232233,0.0036420552,0.0019186492,0.005715278],"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.0008281764,0.00023986574,0.0019451996,0.0012514472,0.00010883961,0.0015137654,0.0010680489,0.023117315,0.10450403,0.3627881,0.023977023,0.4786581],"study_design_scores_gemma":[0.00022859045,0.0004031611,0.0010320387,0.000489919,0.00015036888,0.0021435386,0.00030863698,0.1884933,0.21327297,0.39244226,0.20083635,0.00019890667],"about_ca_topic_score_codex":0.0017139325,"about_ca_topic_score_gemma":0.0010525294,"teacher_disagreement_score":0.009297012,"about_ca_system_score_codex":0.000531516,"about_ca_system_score_gemma":0.0012041997,"threshold_uncertainty_score":0.031101584},"labels":[],"label_agreement":null},{"id":"W960842831","doi":"10.1007/978-3-319-10160-6_11","title":"BLIMP: A Compact Tree Structure for Uncertain Frequent Pattern Mining","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","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 Manitoba","funders":"","keywords":"Compact space; Tree (set theory); Computer science; Tree structure; Data structure; Data mining; Upper and lower bounds; Algorithm; Mathematics; Binary tree; Combinatorics","score_opus":0.026099494289884506,"score_gpt":0.2715890096923017,"score_spread":0.2454895154024172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W960842831","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.0073944204,0.0009561953,0.9656154,0.00034215624,0.0001375381,0.00022682147,0.008577473,0.015193795,0.0015562274],"genre_scores_gemma":[0.053946793,0.0007072275,0.9241646,0.00022688363,0.0001324178,0.00039074285,0.017403878,0.00091643614,0.0021110652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893326,0.00016800607,0.00015273162,0.00017113061,0.000514542,0.00006029697],"domain_scores_gemma":[0.996651,0.0015190257,0.00030528678,0.0006800734,0.0006685817,0.0001760587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014799084,0.00085543055,0.0012145778,0.0030042,0.0008391016,0.0022311034,0.0021296416,0.0012728615,0.007842291],"category_scores_gemma":[0.010899818,0.00077766454,0.0011213901,0.004704691,0.00039156163,0.0038298757,0.0020658693,0.0017913372,0.0050362735],"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.0011212236,0.00027340685,0.0026823096,0.0011431142,0.00017264632,0.000640022,0.00038294095,0.024053622,0.013039936,0.022010528,0.07348588,0.8609943],"study_design_scores_gemma":[0.00030447583,0.0004111951,0.0016930244,0.00031346473,0.00017042155,0.0013886447,0.00022615159,0.7470873,0.012950802,0.14990497,0.08544158,0.00010798594],"about_ca_topic_score_codex":0.0012766686,"about_ca_topic_score_gemma":0.0019252223,"teacher_disagreement_score":0.007842291,"about_ca_system_score_codex":0.0004196737,"about_ca_system_score_gemma":0.0011189944,"threshold_uncertainty_score":0.026235104},"labels":[],"label_agreement":null},{"id":"W961680596","doi":"10.1007/978-3-319-07046-9_10","title":"The PrePack Optimization Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Clothing; Metaheuristic; Operations research; Warehouse; Artificial intelligence; Business; Marketing; Engineering","score_opus":0.009076665143270924,"score_gpt":0.2052352669110514,"score_spread":0.19615860176778047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W961680596","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.012358208,0.011210469,0.621114,0.0027434104,0.0017330846,0.00017382197,0.0013192358,0.000569899,0.3487779],"genre_scores_gemma":[0.18430565,0.020723658,0.3413438,0.0018364539,0.0019021687,0.0005721492,0.0048407884,0.0016093584,0.44286603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.00015017313,0.000038374663,0.00021393038,0.0002506704,0.000088843124],"domain_scores_gemma":[0.9994543,0.00023804056,0.00004163485,0.00014292808,0.00007954615,0.00004348369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006723342,0.0016117762,0.001395166,0.0007824457,0.0010071357,0.003391683,0.0017685159,0.002114351,0.036509532],"category_scores_gemma":[0.0022558705,0.0009564533,0.0011501231,0.0020455925,0.0012706182,0.004325524,0.002003481,0.0045214575,0.007370583],"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.000128677,0.00016713291,0.00015480281,0.00048242442,0.00004966308,0.000116394964,0.00007482606,0.055682402,0.0019396904,0.6322489,0.07960008,0.22935502],"study_design_scores_gemma":[0.00002990716,0.00008139453,0.00031693914,0.00018994136,0.00003326263,0.00028177205,0.000084072024,0.10364592,0.0028223759,0.7381306,0.15434392,0.000039857336],"about_ca_topic_score_codex":0.001110761,"about_ca_topic_score_gemma":0.000942206,"teacher_disagreement_score":0.036509532,"about_ca_system_score_codex":0.00089584355,"about_ca_system_score_gemma":0.000881736,"threshold_uncertainty_score":0.12213659},"labels":[],"label_agreement":null},{"id":"W96192410","doi":"10.1007/978-3-540-71663-1_17","title":"A Note on Definability and Approximations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Interpretation (philosophy); Rough set; Approximations of π; Set (abstract data type); Mathematics; Set theory; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.02894631236430334,"score_gpt":0.2669762603665573,"score_spread":0.23802994800225397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96192410","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.007143443,0.1451307,0.5290095,0.032070123,0.012891967,0.000108637025,0.0006675603,0.00034978412,0.2726283],"genre_scores_gemma":[0.29266167,0.12233429,0.44950005,0.01073484,0.028109193,0.000588321,0.0013833122,0.0006462305,0.09404212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739337,0.00083125016,0.00024095207,0.0004837047,0.00092384784,0.00012682445],"domain_scores_gemma":[0.9949824,0.003964169,0.00010066503,0.000485856,0.0003832888,0.00008370684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004095679,0.0012169426,0.0023548421,0.0030672974,0.0025108089,0.0052758055,0.0021777714,0.0018846358,0.0060881977],"category_scores_gemma":[0.008378401,0.0011653329,0.0035133676,0.0046612895,0.010654662,0.015930833,0.0035569482,0.012056352,0.001281499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009443063,0.0000058853143,0.000027881862,0.00007640887,0.0000080705895,0.000020688924,0.00013238101,0.00039212013,0.00008818678,0.9862598,0.0047748284,0.008204359],"study_design_scores_gemma":[0.0000035517953,0.000006518226,0.0000400978,0.000033275668,0.0000088740835,0.00003064157,0.000026555193,0.0007455104,0.000081927385,0.9732126,0.02580399,0.0000064735295],"about_ca_topic_score_codex":0.0034469177,"about_ca_topic_score_gemma":0.0027889207,"teacher_disagreement_score":0.0060881977,"about_ca_system_score_codex":0.0046625705,"about_ca_system_score_gemma":0.0012296711,"threshold_uncertainty_score":0.03382951},"labels":[],"label_agreement":null},{"id":"W963447477","doi":"10.1007/978-3-540-30126-4_16","title":"Segmentation of the Comet Assay Images","year":2004,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Carcinogens and Genotoxicity Assessment","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Comet assay; Comet; Comet tail; Agarose; DNA damage; Population; DNA; Nucleus; Gel electrophoresis; Lysis; Fluorescence microscope; Chemistry; Biophysics; Fluorescence; Biology; Molecular biology; Cell biology; Physics; Biochemistry; Optics; Solar wind; Plasma","score_opus":0.00736500070794654,"score_gpt":0.2607096941710072,"score_spread":0.25334469346306066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W963447477","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.32004565,0.0043059792,0.63776964,0.0011358411,0.00041117633,0.001240291,0.006091272,0.009814575,0.019185467],"genre_scores_gemma":[0.33232257,0.0033103547,0.63927877,0.00043166374,0.00017110952,0.00047024392,0.007129744,0.0019065961,0.014978963],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998356,0.000011690236,0.000010879665,0.000038006478,0.00005808398,0.000045731595],"domain_scores_gemma":[0.99960154,0.00007429965,0.000046242327,0.000055441065,0.00018107676,0.000041427087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026371836,0.00056809327,0.00043670347,0.0020716763,0.00027080634,0.0013130446,0.0003490149,0.0009203982,0.005069398],"category_scores_gemma":[0.00061915023,0.00035283683,0.00052751135,0.0009914474,0.00026389395,0.00033355533,0.00031051104,0.00085885107,0.0025748562],"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.00044396226,0.000080706544,0.0011359067,0.00053751003,0.000039550945,0.00033541716,0.00018597972,0.0024041815,0.81976104,0.0011460048,0.0030830186,0.17084679],"study_design_scores_gemma":[0.000054792526,0.0003833417,0.041379318,0.00015277472,0.00014875444,0.0023282738,0.00036704366,0.053153064,0.8580911,0.002234616,0.041619904,0.00008692796],"about_ca_topic_score_codex":0.002266594,"about_ca_topic_score_gemma":0.002422937,"teacher_disagreement_score":0.005069398,"about_ca_system_score_codex":0.00041745423,"about_ca_system_score_gemma":0.0006094963,"threshold_uncertainty_score":0.016958833},"labels":[],"label_agreement":null},{"id":"W964171983","doi":"10.1007/978-3-642-45318-2_14","title":"Incorporating Highly Explorative Methods to Improve the Performance of Variable Neighborhood Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms 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":"University of Windsor","funders":"","keywords":"Variable neighborhood search; Computer science; Differential evolution; Metaheuristic; Mathematical optimization; Evolutionary algorithm; Population; Job shop scheduling; Scheduling (production processes); Artificial intelligence; Mathematics","score_opus":0.03228913992110071,"score_gpt":0.3096697860617132,"score_spread":0.2773806461406125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964171983","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.07005991,0.0019303294,0.91762084,0.00015923008,0.00020045429,0.000066184504,0.000042018986,0.00075163844,0.009169441],"genre_scores_gemma":[0.54288864,0.00058291305,0.4507988,0.0001410666,0.00009866724,0.0001473935,0.000104483355,0.00026204562,0.004976033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995072,0.00022778881,0.000023034065,0.000056683657,0.00014385257,0.0000415082],"domain_scores_gemma":[0.99817705,0.0011971578,0.00010402487,0.00024514235,0.00022788694,0.000048747752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001277301,0.0007544646,0.0008818406,0.0005704394,0.00040218185,0.00079019764,0.0012031399,0.00081403414,0.002133185],"category_scores_gemma":[0.0046022222,0.00027570516,0.00042142364,0.0006901037,0.00046636173,0.0013650196,0.0012695713,0.0009768552,0.00044124937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033597925,0.00027148167,0.0012118658,0.00020140392,0.000119001954,0.00009636263,0.00016371245,0.66557634,0.013277908,0.03245696,0.0037520784,0.28253698],"study_design_scores_gemma":[0.000019158102,0.00007687381,0.00010541189,0.000011207812,0.000013876754,0.000030205534,0.000008955269,0.99261135,0.001858498,0.0042915307,0.00096589426,0.0000070234355],"about_ca_topic_score_codex":0.0008851038,"about_ca_topic_score_gemma":0.0016131834,"teacher_disagreement_score":0.002133185,"about_ca_system_score_codex":0.00027490905,"about_ca_system_score_gemma":0.0004907542,"threshold_uncertainty_score":0.0071362257},"labels":[],"label_agreement":null},{"id":"W96424918","doi":"10.1007/978-3-642-41707-8_8","title":"Predicting the Size of Test Suites from Use Cases: An Empirical Exploration","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Engineering Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Regression testing; Univariate; Metric (unit); Logistic regression; Software metric; Software quality; Software; Test case; Software regression; Data mining; Reliability engineering; Regression analysis; Multivariate statistics; Machine learning; Software development; Software construction; Programming language","score_opus":0.0534479459431185,"score_gpt":0.29391778863124235,"score_spread":0.24046984268812385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96424918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97944176,0.00082820316,0.01677813,0.00018361062,0.000012974841,0.000089556044,0.0013060553,0.00033321136,0.0010265614],"genre_scores_gemma":[0.9837384,0.00022648723,0.013059139,0.000030410103,0.000015479009,0.00006843148,0.0024130752,0.000074523065,0.0003739237],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99337786,0.0030609248,0.0005297509,0.00097415055,0.0018257269,0.00023166343],"domain_scores_gemma":[0.53106517,0.4438956,0.009767502,0.009022395,0.0050017284,0.0012475275],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008555839,0.0012713664,0.00075062754,0.0034897546,0.00033589217,0.0016828632,0.0019473453,0.0013442964,0.0014420755],"category_scores_gemma":[0.14278497,0.00064209657,0.0010555132,0.0027064919,0.000734868,0.0037364904,0.00090982026,0.0018874876,0.00060114026],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017437021,0.002277411,0.5673098,0.00077170704,0.0005443766,0.000580295,0.0010211472,0.1728894,0.0047522504,0.002008941,0.003421423,0.24267967],"study_design_scores_gemma":[0.00010350417,0.0011334659,0.14363176,0.00012723438,0.000221571,0.0007032077,0.00052112585,0.84083813,0.004934434,0.0065507987,0.0011711542,0.0000636747],"about_ca_topic_score_codex":0.0027356956,"about_ca_topic_score_gemma":0.0044042678,"teacher_disagreement_score":0.9914442,"about_ca_system_score_codex":0.0008577736,"about_ca_system_score_gemma":0.0009601013,"threshold_uncertainty_score":0.04524815},"labels":[],"label_agreement":null},{"id":"W964625527","doi":"10.1007/978-3-642-36065-7_1","title":"Mobility and Computations: Some Open Research Directions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search 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":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Distributed computing; Focus (optics); Class (philosophy); Mobile robot; Robotics; Mobile computing; Software; Distributed algorithm; Task (project management); Artificial intelligence; Robot; Computer network; Systems engineering; Operating system","score_opus":0.08173406732485497,"score_gpt":0.35493234680769836,"score_spread":0.27319827948284336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964625527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033599846,0.17019038,0.516708,0.09258862,0.0067985235,0.00010410726,0.00076155755,0.00046548058,0.1787834],"genre_scores_gemma":[0.49057955,0.18997642,0.19236052,0.008388809,0.024939213,0.00039414936,0.0013030259,0.00088402716,0.09117426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855214,0.00051279645,0.0000831446,0.00034350523,0.00030760764,0.00020091457],"domain_scores_gemma":[0.9922208,0.0054391325,0.0002661407,0.0010480523,0.0006379259,0.00038798357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024082381,0.0012706352,0.0021345112,0.0020980223,0.002542182,0.00810992,0.003098561,0.0034636178,0.01852822],"category_scores_gemma":[0.011841873,0.00096776336,0.0018011609,0.0060792044,0.0070092594,0.02750426,0.004638087,0.0052299704,0.0028830692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023454688,0.000036815185,0.00021534781,0.00018640746,0.00001490976,0.000029932933,0.00015791043,0.0026435365,0.00007446872,0.9546749,0.012165761,0.02977664],"study_design_scores_gemma":[0.0000038299404,0.000003776335,0.00006291558,0.00007191121,0.00000505543,0.000030957013,0.0001134173,0.004628507,0.000037850696,0.9841011,0.010933741,0.000006914034],"about_ca_topic_score_codex":0.0027445506,"about_ca_topic_score_gemma":0.0019193352,"teacher_disagreement_score":0.01852822,"about_ca_system_score_codex":0.0024471902,"about_ca_system_score_gemma":0.0016229546,"threshold_uncertainty_score":0.06198311},"labels":[],"label_agreement":null},{"id":"W96556717","doi":"10.1007/978-3-642-35527-1_59","title":"Modeling Outlier Score Distributions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Outlier; Anomaly detection; Computer science; Artificial intelligence; Probabilistic logic; Local outlier factor; Pattern recognition (psychology); Data mining; Object (grammar); Probability density function; Statistics; Mathematics","score_opus":0.027089130155039498,"score_gpt":0.2570276324457522,"score_spread":0.22993850229071272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96556717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022139775,0.00028046398,0.9756159,0.00016396712,0.00003638281,0.000028639426,0.00017470162,0.00079103064,0.00076918403],"genre_scores_gemma":[0.6952247,0.0010011945,0.28803334,0.00014751685,0.00023424391,0.00023032809,0.0030243201,0.0006331459,0.011471229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771726,0.000658438,0.00010660117,0.0006784281,0.00061631604,0.00022296677],"domain_scores_gemma":[0.99098444,0.0056345486,0.0008207838,0.0012513734,0.0010640823,0.00024479986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035867607,0.0011524425,0.0016048293,0.0020949694,0.00048506702,0.00250964,0.003127828,0.0016591105,0.0023848962],"category_scores_gemma":[0.02008406,0.00092235726,0.0014930796,0.0029020812,0.0012256112,0.002932062,0.002097591,0.0024218077,0.0010478252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021388079,0.00013091163,0.012561812,0.00009637108,0.00021195279,0.0001851178,0.00017410153,0.6924232,0.0018548812,0.07813066,0.0042138845,0.2098032],"study_design_scores_gemma":[0.0000031582854,0.00001219933,0.00042549384,0.000005912362,0.000009669064,0.000041904037,0.00000901347,0.9724779,0.00032073818,0.026308877,0.0003788548,0.000006383137],"about_ca_topic_score_codex":0.004862752,"about_ca_topic_score_gemma":0.0058070566,"teacher_disagreement_score":0.004862752,"about_ca_system_score_codex":0.0013259541,"about_ca_system_score_gemma":0.0008643035,"threshold_uncertainty_score":0.01896882},"labels":[],"label_agreement":null},{"id":"W965931222","doi":"10.1007/978-3-642-21538-4_11","title":"Thermal Dynamic Modeling and Control of Injection Moulding Process","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Injection Molding Process and Properties","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 Waterloo","funders":"","keywords":"Injection moulding; Computer science; PID controller; Controller (irrigation); Process (computing); Finite element method; Control theory (sociology); Control engineering; Identification (biology); Thermal; System dynamics; Artificial neural network; Radial basis function; Temperature control; Mechanical engineering; Control (management); Engineering; Artificial intelligence","score_opus":0.013530930999018746,"score_gpt":0.2136766185243147,"score_spread":0.20014568752529593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W965931222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090159684,0.001525448,0.8723427,0.0002270507,0.00012491488,0.000084003805,0.00012488558,0.0009810046,0.034430247],"genre_scores_gemma":[0.97488767,0.0005269471,0.013498762,0.000025252208,0.000019297075,0.000060365648,0.000075113014,0.000060791193,0.010845806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988925,0.000017745357,0.0000036039162,0.000023874754,0.00005320702,0.0000123767195],"domain_scores_gemma":[0.9999509,0.000017742848,0.000009799092,0.00000622965,0.000012851583,0.0000024528726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014052165,0.00041606135,0.00053995213,0.0001886141,0.00027016396,0.00052557053,0.00068099523,0.0004069845,0.0021270602],"category_scores_gemma":[0.00018145045,0.00029777642,0.00045880093,0.0001859612,0.00024961255,0.0004253794,0.00027641578,0.00032176462,0.00030136187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063719075,0.000030040002,0.00016414015,0.00006620695,0.00001252576,0.00003953228,0.000031280066,0.94661707,0.027864698,0.0045396746,0.00033189348,0.020239277],"study_design_scores_gemma":[0.000002862808,0.000015240954,0.00014321394,0.0000018650157,0.0000032324524,0.0000064761443,0.0000019909812,0.99610776,0.002808007,0.00038661313,0.0005203324,0.0000023858192],"about_ca_topic_score_codex":0.003429539,"about_ca_topic_score_gemma":0.0025595776,"teacher_disagreement_score":0.003429539,"about_ca_system_score_codex":0.00042055015,"about_ca_system_score_gemma":0.0002953466,"threshold_uncertainty_score":0.0071157217},"labels":[],"label_agreement":null},{"id":"W96748368","doi":"10.1007/978-3-642-29700-7_32","title":"An Improved Approximation Algorithm for the Bandpass Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Alberta","funders":"","keywords":"Band-pass filter; Approximation algorithm; Matching (statistics); Computer science; Algorithm; Travelling salesman problem; Reduction (mathematics); Mathematical optimization; Mathematics; Physics; Geometry; Optics","score_opus":0.01338201916636893,"score_gpt":0.225876189957608,"score_spread":0.21249417079123906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96748368","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.008417262,0.00034319863,0.97996867,0.000258931,0.0002134624,0.00008876374,0.00014591729,0.0012010982,0.009362739],"genre_scores_gemma":[0.06652498,0.00041798485,0.9221101,0.000221718,0.00019089931,0.00027966104,0.00058968784,0.0005381288,0.009126791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990312,0.00020519597,0.000049746912,0.00017669439,0.00038379765,0.0001533032],"domain_scores_gemma":[0.99858356,0.00068384636,0.00006718636,0.0003486632,0.00023745764,0.00007932192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011665979,0.001698555,0.0021475817,0.0013662272,0.0009502704,0.0022067,0.0033699214,0.0021276057,0.012369329],"category_scores_gemma":[0.004628993,0.000720405,0.0016568336,0.0028332178,0.00094901776,0.0033397533,0.0027093685,0.0036193565,0.0041495785],"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.0005288034,0.00047417817,0.0006414857,0.0003373128,0.00008726458,0.00014645237,0.00017789126,0.17440239,0.008317805,0.14767286,0.031510916,0.6357026],"study_design_scores_gemma":[0.00017388126,0.00010894294,0.00024795995,0.000037447568,0.000050670467,0.00015782955,0.0000487268,0.9014513,0.0022692638,0.08388555,0.0115416385,0.00002680704],"about_ca_topic_score_codex":0.0030272375,"about_ca_topic_score_gemma":0.0034119212,"teacher_disagreement_score":0.012369329,"about_ca_system_score_codex":0.001465223,"about_ca_system_score_gemma":0.0016959767,"threshold_uncertainty_score":0.04137957},"labels":[],"label_agreement":null},{"id":"W96892337","doi":"10.1007/978-3-319-08123-6_6","title":"Simulating Cancer Growth Using Cellular Automata to Detect Combination Drug Targets","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mathematical Biology Tumor Growth","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":"Western University","funders":"","keywords":"Computer science; Cellular automaton; Automaton; Cancer drugs; Cancer; Theoretical computer science; Artificial intelligence; Medicine; Internal medicine","score_opus":0.03031017850997549,"score_gpt":0.2935488784024831,"score_spread":0.26323869989250764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96892337","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.6067627,0.001031916,0.37099016,0.0009411208,0.00039930706,0.00008732541,0.0005239727,0.0013192153,0.017944317],"genre_scores_gemma":[0.9653517,0.0002422992,0.0308489,0.00007543618,0.000024933119,0.000050454742,0.000113406095,0.00004326807,0.003249553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998466,0.000036942598,0.00001028649,0.00004193985,0.00003752561,0.000026703347],"domain_scores_gemma":[0.99831736,0.0013318476,0.00009317451,0.00008227485,0.00011374022,0.00006156757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027664014,0.0007503429,0.0007673743,0.00044186832,0.00038387944,0.00092740485,0.0011591507,0.0014428687,0.00210799],"category_scores_gemma":[0.0020944122,0.00052557606,0.0010157189,0.00043011917,0.00061657804,0.0006046575,0.00066121836,0.0008443844,0.00022139611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028959152,0.000014620101,0.00052037445,0.000016581604,0.0000151311915,0.000036491027,0.000016405935,0.99366945,0.0012395064,0.0016336258,0.00013000642,0.0026788649],"study_design_scores_gemma":[0.000004087711,0.000007176942,0.00004067015,0.0000011225726,0.0000046186933,0.000007199118,0.0000027946146,0.99860746,0.00043452543,0.0008153244,0.00007228352,0.0000026580478],"about_ca_topic_score_codex":0.0133401975,"about_ca_topic_score_gemma":0.009045557,"teacher_disagreement_score":0.0133401975,"about_ca_system_score_codex":0.0010124327,"about_ca_system_score_gemma":0.0006885132,"threshold_uncertainty_score":0.02652514},"labels":[],"label_agreement":null},{"id":"W969702759","doi":"10.1007/978-3-319-17040-4_3","title":"Privacy-Preserving Public Auditing in Cloud Computing with Data Deduplication","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cloud Data Security Solutions","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":"Toronto Metropolitan University","funders":"","keywords":"Data deduplication; Computer science; Cloud computing; Data integrity; Audit; Cloud storage; Computer security; Scheme (mathematics); Information privacy; Database; Authentication (law); Key (lock); Operating system; Accounting","score_opus":0.07694424103809425,"score_gpt":0.29781577471776294,"score_spread":0.2208715336796687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W969702759","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.052609053,0.00329536,0.92345864,0.0022220674,0.00052988005,0.00030942296,0.00043821582,0.0013555947,0.015781647],"genre_scores_gemma":[0.87512654,0.0017282722,0.11296055,0.00027275825,0.00028729282,0.00013042877,0.00029372834,0.00019104201,0.009009255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99376315,0.0017631743,0.00051751087,0.00081320823,0.0021410296,0.0010020477],"domain_scores_gemma":[0.9871525,0.0037330727,0.0006423054,0.007265829,0.0009783934,0.0002279355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052182567,0.00065550825,0.0014614424,0.00089689234,0.0019858852,0.004893384,0.0025457903,0.0013481483,0.0022486118],"category_scores_gemma":[0.012614907,0.0008133849,0.0012518669,0.0025112068,0.0022339937,0.008813525,0.0052212724,0.003972113,0.0007206619],"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.00083472324,0.00039279312,0.0022547147,0.0005019868,0.00014928293,0.0006371103,0.0006530542,0.08737388,0.008204196,0.55199265,0.014679898,0.3323257],"study_design_scores_gemma":[0.00006982045,0.00009445807,0.00059525995,0.00014409001,0.00007809563,0.0010612161,0.00022919328,0.4684901,0.018626714,0.4959358,0.014608627,0.00006663591],"about_ca_topic_score_codex":0.0010232788,"about_ca_topic_score_gemma":0.00076002936,"teacher_disagreement_score":0.0052182567,"about_ca_system_score_codex":0.0018068091,"about_ca_system_score_gemma":0.0038873984,"threshold_uncertainty_score":0.02759707},"labels":[],"label_agreement":null},{"id":"W96971630","doi":"10.1007/978-3-642-37210-0_15","title":"Feedback Dynamic between Emotional Reinforcement and Healthy Eating: An Application of the Reciprocal Markov Model","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Eating Disorders and Behaviors","field":"Psychology","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; Dalhousie University","funders":"","keywords":"Mood; Affect (linguistics); Emotional eating; Negative mood; Eating behavior; Reciprocal; Obesity; Psychology; Developmental psychology; Social psychology; Clinical psychology; Medicine; Endocrinology; Communication","score_opus":0.021815731474977354,"score_gpt":0.30080391677985685,"score_spread":0.2789881853048795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96971630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10760334,0.0008667077,0.8677976,0.0017655849,0.00023965593,0.00009529317,0.00036525514,0.00044884713,0.020817721],"genre_scores_gemma":[0.93996155,0.00079398206,0.04268879,0.00021750503,0.0001579527,0.00020673993,0.00018896587,0.000140333,0.01564418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991178,0.00047451523,0.000026922138,0.00016886847,0.000090184374,0.000121795405],"domain_scores_gemma":[0.9927395,0.006356922,0.00035217524,0.0001595329,0.00020503759,0.00018674707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028862928,0.0010600247,0.0021826841,0.0006884811,0.000784015,0.0014660597,0.0027446446,0.0021199104,0.013084854],"category_scores_gemma":[0.011282009,0.00093073765,0.0019159064,0.0008483087,0.0016442194,0.0023166034,0.0018024405,0.0028324865,0.000669718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000228277,0.00013388443,0.0010645059,0.000113687056,0.00011422631,0.0002119199,0.00024113062,0.7269744,0.00060554536,0.25694478,0.0016536716,0.01171392],"study_design_scores_gemma":[0.000021180009,0.00002118831,0.00013517762,0.0000059650893,0.000023220995,0.00002389775,0.0000154495,0.9640665,0.000038873604,0.035462078,0.00017399245,0.000012470359],"about_ca_topic_score_codex":0.016432106,"about_ca_topic_score_gemma":0.010424313,"teacher_disagreement_score":0.016432106,"about_ca_system_score_codex":0.0018511579,"about_ca_system_score_gemma":0.0015131745,"threshold_uncertainty_score":0.043773234},"labels":[],"label_agreement":null},{"id":"W96994324","doi":"10.1007/978-3-642-33558-7_70","title":"Constraint Programming for Path Planning with Uncertainty","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Probabilistic logic; Path (computing); Mathematical optimization; Heuristic; Computer science; Constraint programming; Constraint (computer-aided design); Motion planning; Graph; Search algorithm; Object (grammar); Incremental heuristic search; Algorithm; Theoretical computer science; Mathematics; Beam search; Artificial intelligence; Stochastic programming","score_opus":0.020669773812666062,"score_gpt":0.25280064258980256,"score_spread":0.2321308687771365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96994324","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.00069400534,0.006971756,0.9642482,0.00057579327,0.00021423482,0.00006976844,0.0003429482,0.0002475384,0.026635792],"genre_scores_gemma":[0.04360302,0.01394394,0.91622293,0.0003635696,0.0005749748,0.0006777353,0.0012729419,0.00049010664,0.022850715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986198,0.0004266915,0.00008416577,0.00019850851,0.000593637,0.000077150195],"domain_scores_gemma":[0.998939,0.00071403704,0.00004696645,0.00010018295,0.0001682591,0.00003165347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180653,0.0021542453,0.0018439404,0.0010752098,0.00079436816,0.002520308,0.0030906172,0.001571636,0.014620238],"category_scores_gemma":[0.0036555473,0.0011933157,0.0016615869,0.0045444807,0.0014710166,0.0026297097,0.001903591,0.004473669,0.003086747],"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.00004014823,0.00005844185,0.000093620234,0.0010684759,0.00010109611,0.00012889368,0.00015192543,0.2345168,0.0011914948,0.4816447,0.032302413,0.24870202],"study_design_scores_gemma":[0.000023061333,0.000018232235,0.00007737198,0.00029336722,0.000033041902,0.0000831198,0.00004339666,0.31659594,0.0007133373,0.6190929,0.06298905,0.00003722605],"about_ca_topic_score_codex":0.009257967,"about_ca_topic_score_gemma":0.008503842,"teacher_disagreement_score":0.014620238,"about_ca_system_score_codex":0.0022569331,"about_ca_system_score_gemma":0.0018381481,"threshold_uncertainty_score":0.048909605},"labels":[],"label_agreement":null},{"id":"W970665919","doi":"10.1007/978-3-319-13647-9_15","title":"How Predictive Is Tense for Language Profiency? A Cautionary Tale","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Second Language Acquisition and Learning","field":"Psychology","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":"Concordia University","funders":"","keywords":"Computer science; Linguistics; Feature (linguistics); Natural language processing; Contrast (vision); Artificial intelligence","score_opus":0.013754415494240828,"score_gpt":0.2805677527042854,"score_spread":0.2668133372100446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W970665919","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.008699246,0.026266634,0.049929015,0.85465175,0.016228238,0.00004369548,0.00060908037,0.00042485516,0.04314747],"genre_scores_gemma":[0.47610956,0.035231996,0.048601773,0.2514273,0.09519641,0.00031923276,0.00086727313,0.00122492,0.09102157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99794894,0.00073512545,0.00014951924,0.00063860585,0.00044849038,0.00007929238],"domain_scores_gemma":[0.9476229,0.043934572,0.0011446591,0.002642738,0.0036983206,0.0009566978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008899932,0.0013884922,0.0018492427,0.0024755758,0.0022155684,0.006216115,0.004066984,0.0042437064,0.007799938],"category_scores_gemma":[0.057934426,0.0006039727,0.00091959524,0.0016860379,0.010488764,0.01886804,0.0035856464,0.017776877,0.0036285936],"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.0004095201,0.00009496603,0.0062243016,0.00061747944,0.00034704612,0.0012611245,0.0025062903,0.002195538,0.001703672,0.4707558,0.2915161,0.22236826],"study_design_scores_gemma":[0.00002044377,0.000042140353,0.0015735936,0.00033822012,0.00005444538,0.00042507597,0.0006899125,0.0032491481,0.00044778906,0.9438692,0.049221385,0.00006851401],"about_ca_topic_score_codex":0.0030759752,"about_ca_topic_score_gemma":0.0023496812,"teacher_disagreement_score":0.008899932,"about_ca_system_score_codex":0.0009801339,"about_ca_system_score_gemma":0.0011936454,"threshold_uncertainty_score":0.04706788},"labels":[],"label_agreement":null},{"id":"W970708678","doi":"10.1007/978-3-319-18356-5_8","title":"Inferring User Profiles in Online Social Networks Using a Partial Social Graph","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Université du Québec à Montréal; Université de Moncton","funders":"","keywords":"Computer science; Social graph; Exploit; Graph; Inference; Constraint (computer-aided design); Social network (sociolinguistics); Theoretical computer science; Artificial intelligence; Machine learning; Data mining; Social media; World Wide Web; Mathematics","score_opus":0.04183036242574024,"score_gpt":0.3078637330164062,"score_spread":0.26603337059066595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W970708678","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.5137582,0.0010665653,0.47495714,0.0007200731,0.000039418028,0.00017515848,0.005586056,0.00093367713,0.0027636767],"genre_scores_gemma":[0.9001725,0.000663603,0.09288762,0.000069619724,0.000084104526,0.00009566844,0.004227761,0.000049297625,0.0017497881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993012,0.00022544414,0.000041316172,0.00023152647,0.00014194888,0.000058432415],"domain_scores_gemma":[0.99678564,0.0022523045,0.00029161983,0.00031422084,0.0002040087,0.00015220689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006306923,0.0006872762,0.0007290377,0.003006949,0.00061246235,0.0012022634,0.00094450294,0.0011232547,0.00086465105],"category_scores_gemma":[0.004803685,0.00071082986,0.0010063152,0.002873151,0.00039322494,0.0033862668,0.0009853255,0.0009120175,0.0007625973],"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.00088173844,0.0011880747,0.2609491,0.00071842514,0.00091218913,0.0013346474,0.0013143879,0.3009473,0.018649014,0.024077646,0.009930769,0.37909672],"study_design_scores_gemma":[0.0000060314364,0.000037937392,0.011147731,0.00001912448,0.000060013626,0.00020676848,0.00013958845,0.9709872,0.0011466752,0.015232833,0.0010030556,0.000013106487],"about_ca_topic_score_codex":0.009168699,"about_ca_topic_score_gemma":0.022734294,"teacher_disagreement_score":0.009168699,"about_ca_system_score_codex":0.0005815837,"about_ca_system_score_gemma":0.0005498216,"threshold_uncertainty_score":0.018230617},"labels":[],"label_agreement":null},{"id":"W973397369","doi":"10.1007/978-3-319-19315-1_13","title":"A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","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 Manitoba","funders":"","keywords":"Computer science; Computer graphics (images); Algorithm; Computer vision; Artificial intelligence","score_opus":0.027697843386117978,"score_gpt":0.2585706656298561,"score_spread":0.23087282224373812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W973397369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00910162,0.00009643527,0.98715043,0.000033145647,0.000057142228,0.000075656186,0.00012074107,0.001484587,0.001880222],"genre_scores_gemma":[0.058812436,0.0000873877,0.9374279,0.00003363619,0.000018798164,0.00008904925,0.00047371548,0.00031796185,0.002739202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.000061725485,0.000046620215,0.00015686575,0.00032660158,0.00010582946],"domain_scores_gemma":[0.99937505,0.00020534529,0.000042590287,0.00017596487,0.00014010076,0.00006103663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907175,0.0014321009,0.001970239,0.0013996182,0.00061546423,0.0015057857,0.0023510142,0.0016375975,0.012320214],"category_scores_gemma":[0.001934972,0.0010888698,0.0019037874,0.0012519223,0.000694561,0.001695252,0.0033388345,0.0022319865,0.0028056111],"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.00041483535,0.00017819385,0.00079833675,0.00021142767,0.00008428446,0.00013673597,0.00025091472,0.20493303,0.016426107,0.02152387,0.009209926,0.7458323],"study_design_scores_gemma":[0.000029451698,0.00006478098,0.00013958412,0.00001915578,0.0000121237335,0.000083854,0.000052065345,0.98521346,0.0037289085,0.007118661,0.0035224722,0.000015442825],"about_ca_topic_score_codex":0.0066711586,"about_ca_topic_score_gemma":0.008862878,"teacher_disagreement_score":0.012320214,"about_ca_system_score_codex":0.00065824186,"about_ca_system_score_gemma":0.0011568432,"threshold_uncertainty_score":0.04121524},"labels":[],"label_agreement":null},{"id":"W974356745","doi":"10.1007/978-3-642-38326-7_5","title":"Merging Disease-Specific Clinical Guidelines to Handle Comorbidities in a Clinical Decision Support Setting","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Clinical practice guidelines implementation","field":"Medicine","cited_by":33,"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":"Decision support system; Clinical decision support system; Merge (version control); Computer science; Workflow; Comorbidity; Disease; Intensive care medicine; Clinical Practice; Medicine; Multimorbidity; Chronic disease; Artificial intelligence; Physical therapy; Information retrieval; Pathology","score_opus":0.27197955672518037,"score_gpt":0.490369406096631,"score_spread":0.21838984937145062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W974356745","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.021891262,0.0020545064,0.93466413,0.0082885455,0.0006980966,0.0010607147,0.0026513683,0.0071985866,0.021492789],"genre_scores_gemma":[0.042905368,0.0008228468,0.94994986,0.001073007,0.00015079611,0.00019485215,0.002667899,0.0003942773,0.0018410751],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98870486,0.0043023475,0.0023035486,0.0012005656,0.0031432344,0.00034549623],"domain_scores_gemma":[0.96132195,0.026206063,0.0019059047,0.003402779,0.005908817,0.001254538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012981221,0.0014053595,0.0013480328,0.0040640496,0.0009970255,0.0066828667,0.0026568878,0.0023564391,0.008227775],"category_scores_gemma":[0.061155263,0.0013219084,0.0019443524,0.0056605334,0.0005651402,0.0069937836,0.0044770385,0.0034078087,0.002698778],"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.0001553335,0.00048474068,0.0120167015,0.00089641585,0.0003563658,0.0011384527,0.0021622607,0.02157031,0.0032640104,0.024926592,0.046768147,0.8862607],"study_design_scores_gemma":[0.00034021115,0.00046633335,0.013962978,0.0025804008,0.0013958962,0.003868313,0.003165406,0.34998888,0.020278648,0.23118195,0.37233117,0.00043983365],"about_ca_topic_score_codex":0.0046669655,"about_ca_topic_score_gemma":0.009040928,"teacher_disagreement_score":0.012981221,"about_ca_system_score_codex":0.001197043,"about_ca_system_score_gemma":0.005142784,"threshold_uncertainty_score":0.06865209},"labels":[],"label_agreement":null},{"id":"W975601493","doi":"10.1007/978-3-319-21145-9_13","title":"Using Graph Transformations for Formalizing Prescriptions and Monitoring Adherence","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Medical prescription; Computer science; Semantics (computer science); Intervention (counseling); Graph; Medicine; Theoretical computer science; Nursing; Programming language","score_opus":0.07818860292628553,"score_gpt":0.30112107428024415,"score_spread":0.2229324713539586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W975601493","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.004154151,0.000036790658,0.9921022,0.00014436457,0.000042934324,0.000088903296,0.00007206807,0.0013779216,0.0019807403],"genre_scores_gemma":[0.23004004,0.00019951408,0.7635713,0.00024021324,0.00006568436,0.00025429105,0.0003131727,0.0011101807,0.0042055654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99389344,0.0021529612,0.0005826046,0.0011178688,0.0017930602,0.00046008048],"domain_scores_gemma":[0.9900017,0.005837902,0.0007444013,0.0022192963,0.0010386189,0.00015799704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003327997,0.0012591621,0.0007933956,0.0016920302,0.0009943225,0.0026819562,0.0019972145,0.0016818263,0.0044111395],"category_scores_gemma":[0.014802156,0.0010924225,0.0025410592,0.0014228718,0.0038783853,0.0046452666,0.003145477,0.0042542033,0.00092043896],"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.00014846184,0.00013653853,0.0011817985,0.00032242856,0.000084347645,0.00055702537,0.0011915952,0.07028743,0.011091626,0.78855175,0.002695851,0.12375116],"study_design_scores_gemma":[0.00006299878,0.000077637465,0.0003056552,0.00014417016,0.00016029841,0.00027039307,0.00021683845,0.31487224,0.025521372,0.6387211,0.019571437,0.000075828226],"about_ca_topic_score_codex":0.004758507,"about_ca_topic_score_gemma":0.0061999816,"teacher_disagreement_score":0.004758507,"about_ca_system_score_codex":0.001433681,"about_ca_system_score_gemma":0.002581938,"threshold_uncertainty_score":0.017600358},"labels":[],"label_agreement":null},{"id":"W97666251","doi":"10.1007/978-3-319-08404-6_11","title":"B-slack Trees: Space Efficient B-Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","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 Toronto","funders":"","keywords":"Amortized analysis; Computer science; Node (physics); Combinatorics; Binary logarithm; B-tree; Degree (music); Weight-balanced tree; Space (punctuation); Discrete mathematics; Time complexity; Mathematics; Algorithm; Data structure; Binary search tree; Operating system; Binary tree; Physics","score_opus":0.011820448216732242,"score_gpt":0.2314975536933154,"score_spread":0.21967710547658315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97666251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014541998,0.0032098503,0.93851715,0.00053545175,0.0003791118,0.00014633844,0.0023270568,0.009286039,0.03105702],"genre_scores_gemma":[0.16121972,0.0032073297,0.7807489,0.00060269795,0.00024246665,0.00034700707,0.0067293136,0.0036806245,0.04322203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.000050249786,0.000034188906,0.000058601123,0.00018598053,0.00007132603],"domain_scores_gemma":[0.9992329,0.00022255415,0.00006456431,0.00019359273,0.00018887188,0.00009751848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035668814,0.00076374883,0.0005783761,0.0011155222,0.00059302134,0.0012872588,0.0014774385,0.00072299415,0.022533905],"category_scores_gemma":[0.0017649427,0.0005962029,0.00045185344,0.0029913012,0.00037571267,0.0023813068,0.0013984146,0.0014200412,0.008918525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046298612,0.00015380718,0.00029777738,0.00068462646,0.000030864194,0.00011557513,0.00013333175,0.021541173,0.02516281,0.13732779,0.11181916,0.7022701],"study_design_scores_gemma":[0.00022357122,0.0003513581,0.00058608985,0.0002549959,0.000054749304,0.00071061694,0.00013891108,0.17769335,0.031015586,0.48643902,0.30245858,0.000073117764],"about_ca_topic_score_codex":0.00073015015,"about_ca_topic_score_gemma":0.0011620229,"teacher_disagreement_score":0.022533905,"about_ca_system_score_codex":0.00047591256,"about_ca_system_score_gemma":0.00071209884,"threshold_uncertainty_score":0.075383365},"labels":[],"label_agreement":null},{"id":"W976989290","doi":"10.1007/978-3-319-17040-4_11","title":"Automating MAC Spoofer Evidence Gathering and Encoding for Investigations","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Malware Detection Techniques","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":"Concordia University","funders":"","keywords":"Encoding (memory); Computer science; Artificial intelligence","score_opus":0.0646687517224108,"score_gpt":0.3092745562996843,"score_spread":0.24460580457727352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W976989290","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.039306976,0.0009430046,0.9211167,0.00060894684,0.0003399393,0.00059482217,0.0018201454,0.026801553,0.008467946],"genre_scores_gemma":[0.2827488,0.00068737695,0.7016309,0.00028306624,0.00016780953,0.00033208134,0.0033390645,0.0013087621,0.009502199],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985474,0.00023176897,0.00014332614,0.0002373451,0.0006603422,0.00017992833],"domain_scores_gemma":[0.9913326,0.0034533583,0.0006641279,0.0022546467,0.0020939924,0.00020128129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010355129,0.001246213,0.00094531866,0.003567689,0.0009228279,0.0027900578,0.0011796695,0.001202137,0.011133446],"category_scores_gemma":[0.011404842,0.00078956084,0.0008433303,0.0016567553,0.0005750188,0.0034762628,0.0026762076,0.0014402495,0.007852586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007249031,0.00022064734,0.003376064,0.00048370395,0.00006191339,0.00053630426,0.00040243595,0.0058724205,0.09893178,0.009623088,0.017454995,0.8623117],"study_design_scores_gemma":[0.00007413131,0.0004924771,0.005687242,0.00037973316,0.00021543149,0.0026041395,0.0006626922,0.33126146,0.5461797,0.051490847,0.06078866,0.00016342012],"about_ca_topic_score_codex":0.0011182186,"about_ca_topic_score_gemma":0.0015501959,"teacher_disagreement_score":0.011133446,"about_ca_system_score_codex":0.00067325914,"about_ca_system_score_gemma":0.0017944596,"threshold_uncertainty_score":0.037245035},"labels":[],"label_agreement":null},{"id":"W978130869","doi":"10.1007/978-3-319-20804-6_5","title":"Makers with a Cause: Fabrication, Reflection and Community Collaboration","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Innovative Human-Technology Interaction","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":"York University","funders":"","keywords":"Reflection (computer programming); Computer science; Rapid prototyping; Decision maker; Order (exchange); Core (optical fiber); Engineering management; Knowledge management; Management science; Engineering; Mechanical engineering; Telecommunications","score_opus":0.04234634050250337,"score_gpt":0.3084393529035834,"score_spread":0.26609301240108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W978130869","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.24813376,0.004561297,0.12447009,0.027689567,0.001575707,0.0005231086,0.00006779423,0.00052097655,0.5924578],"genre_scores_gemma":[0.9447486,0.00053394015,0.016654655,0.00040813227,0.00008543528,0.00016114651,0.000038861017,0.00024280355,0.037126295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9868204,0.008648022,0.00026451654,0.001240873,0.0018996368,0.001126471],"domain_scores_gemma":[0.985685,0.008677526,0.0010718063,0.002608059,0.0009228835,0.0010347335],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.012043692,0.0008517969,0.00073642185,0.0023529576,0.012983762,0.014129871,0.0033479198,0.0048361984,0.011715193],"category_scores_gemma":[0.028253334,0.0010063498,0.0010073119,0.0017615929,0.032897007,0.012938766,0.013522859,0.0053915256,0.001565446],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076248696,0.00011757442,0.0018198245,0.00017415824,0.000025854484,0.00084536197,0.27952754,0.00065699493,0.0014669239,0.66287994,0.005519283,0.04689027],"study_design_scores_gemma":[0.00008568617,0.00016323055,0.0020245102,0.00040080448,0.000070097005,0.0008943029,0.23288919,0.0019929274,0.0031951722,0.5650682,0.19313103,0.00008486609],"about_ca_topic_score_codex":0.0014839804,"about_ca_topic_score_gemma":0.0025283874,"teacher_disagreement_score":0.98701626,"about_ca_system_score_codex":0.0029023313,"about_ca_system_score_gemma":0.005337942,"threshold_uncertainty_score":0.06369394},"labels":[],"label_agreement":null},{"id":"W978775847","doi":"10.1007/978-3-319-06028-6_56","title":"An Information Retrieval-Based Approach to Determining Contextual Opinion Polarity of Words","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polarity (international relations); Set (abstract data type); Computer science; Context (archaeology); Natural language processing; Task (project management); Artificial intelligence; Sentiment analysis; Information retrieval; Geography; Engineering; Chemistry","score_opus":0.023531342775331424,"score_gpt":0.2690822061012785,"score_spread":0.24555086332594706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W978775847","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.08956828,0.0030272894,0.87502855,0.00096871454,0.0007655325,0.00096932723,0.0024528669,0.0026412723,0.024578137],"genre_scores_gemma":[0.3788116,0.0012139232,0.6078845,0.00031136314,0.00067228073,0.00053866924,0.0030192672,0.00015437217,0.0073940908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988439,0.00024046034,0.00010369644,0.00022342343,0.0004896281,0.00009890114],"domain_scores_gemma":[0.99816555,0.0006278167,0.00015091868,0.000099808065,0.00089885446,0.000057119112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655327,0.00078975986,0.00097501406,0.0046408856,0.0009277182,0.0021804308,0.00095060864,0.00071503787,0.004082432],"category_scores_gemma":[0.004478909,0.00028730952,0.00093683833,0.0040157307,0.00043646252,0.0020722789,0.0008306867,0.0009076742,0.002604493],"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.0005446251,0.0004046476,0.0048005185,0.00060035445,0.00019165328,0.00027181994,0.000574714,0.0032046873,0.08324061,0.010716764,0.01845842,0.87699103],"study_design_scores_gemma":[0.00021174323,0.0012115458,0.033856615,0.0002899021,0.0011276007,0.0015073739,0.00197871,0.76627433,0.092484914,0.05042747,0.05031472,0.00031507193],"about_ca_topic_score_codex":0.0031727583,"about_ca_topic_score_gemma":0.0056446884,"teacher_disagreement_score":0.0046408856,"about_ca_system_score_codex":0.0007531407,"about_ca_system_score_gemma":0.0010232974,"threshold_uncertainty_score":0.013657153},"labels":[],"label_agreement":null},{"id":"W980892519","doi":"10.1007/978-3-319-06483-3_4","title":"Learning to Measure Influence in a Scientific Social Network","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Saskatchewan","funders":"","keywords":"Measure (data warehouse); Psychology; Data science; Computer science; Cognitive science; Data mining","score_opus":0.012707477365928806,"score_gpt":0.25005519385941927,"score_spread":0.23734771649349046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W980892519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08210825,0.0004335299,0.91358304,0.00065237324,0.000056734738,0.00006536595,0.00024412002,0.00048751492,0.0023690888],"genre_scores_gemma":[0.8165001,0.00043720123,0.17886207,0.00019022178,0.00037487302,0.00025658312,0.00077877135,0.00008255095,0.0025176643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872416,0.0005601171,0.000068794834,0.00032971645,0.00024687182,0.00007023149],"domain_scores_gemma":[0.9806302,0.016873093,0.00065719296,0.0009059383,0.0006496108,0.00028387975],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002345028,0.00075237494,0.0009408403,0.00202956,0.00049069175,0.0011084223,0.0012845332,0.0011820951,0.0013889208],"category_scores_gemma":[0.020144232,0.0003644768,0.00074873795,0.0015430194,0.0010253502,0.0032578337,0.0016233295,0.0015954206,0.0004466005],"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.00028434844,0.00049131404,0.023859603,0.00038244954,0.00043053587,0.00011428341,0.0005491783,0.35655242,0.004433052,0.06378527,0.0068701715,0.54224735],"study_design_scores_gemma":[0.000011600824,0.000051433468,0.0008948194,0.000011776433,0.000026145528,0.000026713224,0.000031684824,0.9356845,0.00078766595,0.06193248,0.0005325568,0.00000860404],"about_ca_topic_score_codex":0.0017302377,"about_ca_topic_score_gemma":0.0029149947,"teacher_disagreement_score":0.99797046,"about_ca_system_score_codex":0.0008068883,"about_ca_system_score_gemma":0.0004938834,"threshold_uncertainty_score":0.012401819},"labels":[],"label_agreement":null},{"id":"W98236213","doi":"10.1007/978-3-540-39592-8_77","title":"Comparing Hierarchical Markov Networks and Multiply Sectioned Bayesian Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Representation (politics); Bayesian network; Computer science; ENCODE; Theoretical computer science; Markov chain; Modular design; Bayesian probability; Markov process; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.01839982779473839,"score_gpt":0.2334108953634072,"score_spread":0.2150110675686688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98236213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15862598,0.0014730531,0.832178,0.0007628141,0.000089568915,0.00015304354,0.0007330638,0.0003353616,0.0056490977],"genre_scores_gemma":[0.6747459,0.0009365265,0.31881446,0.0002004842,0.00017120854,0.0002889021,0.0018901321,0.00022605088,0.0027262415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994028,0.0043006428,0.00015666822,0.00079484686,0.0005260433,0.00019393326],"domain_scores_gemma":[0.8410185,0.14730099,0.0037017216,0.004181065,0.0028415085,0.0009562647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0147658065,0.0009685105,0.0015561315,0.00369236,0.0011157155,0.0031742258,0.0028868567,0.0024816405,0.006776587],"category_scores_gemma":[0.11263621,0.0011805681,0.0012238433,0.0028060887,0.0021679301,0.009093029,0.0023618697,0.0023099026,0.00047870068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085153774,0.00013055859,0.008684997,0.00026635095,0.00042209367,0.0001762567,0.0005382541,0.5474147,0.0006597205,0.3612334,0.0031993878,0.07642271],"study_design_scores_gemma":[0.000040975647,0.00005900234,0.0013577256,0.000029930432,0.00007764659,0.00004914344,0.00008570074,0.5888998,0.00025765487,0.40832937,0.00078857655,0.000024460747],"about_ca_topic_score_codex":0.0046159104,"about_ca_topic_score_gemma":0.006366288,"teacher_disagreement_score":0.0147658065,"about_ca_system_score_codex":0.0026029153,"about_ca_system_score_gemma":0.0014248189,"threshold_uncertainty_score":0.07809001},"labels":[],"label_agreement":null},{"id":"W982883763","doi":"10.1007/978-3-319-08171-7_30","title":"Conformational Transitions and Principal Geodesic Analysis on the Positive Semidefinite Matrix Manifold","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geodesic; Manifold (fluid mechanics); Matrix (chemical analysis); Rank (graph theory); Distance matrix; Stiefel manifold; Mathematics; Combinatorics; Topology (electrical circuits); Pure mathematics; Geometry; Chemistry","score_opus":0.0066218179983113055,"score_gpt":0.2261018876334011,"score_spread":0.21948006963508981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W982883763","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.18689911,0.0031231167,0.7345309,0.0022288556,0.00041318205,0.00007889215,0.0004311794,0.0004618038,0.07183301],"genre_scores_gemma":[0.84818715,0.0025110575,0.09389789,0.00040288034,0.00068467157,0.0001665294,0.000589707,0.00055204344,0.05300815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973017,0.00008468938,0.000009095186,0.00007224205,0.00007511842,0.00002876538],"domain_scores_gemma":[0.9994572,0.00024075212,0.00007666941,0.000052504194,0.000094413415,0.000078640034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004754503,0.00070773374,0.00057664776,0.00092721,0.0006005341,0.0014319257,0.00079663127,0.000864616,0.0050857714],"category_scores_gemma":[0.0014910352,0.00039157431,0.00078548293,0.00058905716,0.0017587929,0.0019334088,0.0010157615,0.0020682348,0.0007895198],"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.000023794739,0.00002420241,0.00010796456,0.000046531975,0.000012051033,0.000044347926,0.00014237345,0.018049164,0.0026739142,0.9654386,0.0033001339,0.01013701],"study_design_scores_gemma":[0.000005530021,0.000021305832,0.00019902381,0.000007784372,0.0000028209427,0.000055575263,0.000031383108,0.11355862,0.00035639506,0.8834275,0.0023176167,0.000016503469],"about_ca_topic_score_codex":0.0010330338,"about_ca_topic_score_gemma":0.0006862211,"teacher_disagreement_score":0.0050857714,"about_ca_system_score_codex":0.000820469,"about_ca_system_score_gemma":0.0004044894,"threshold_uncertainty_score":0.01701361},"labels":[],"label_agreement":null},{"id":"W982949649","doi":"10.1007/978-3-319-11656-3_7","title":"Hidden Markov Models Based on Generalized Dirichlet Mixtures for Proportional Data Modeling","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hidden Markov model; Dirichlet distribution; Hierarchical Dirichlet process; Latent Dirichlet allocation; Computer science; Extension (predicate logic); Generalized Dirichlet distribution; Gaussian; Algorithm; Applied mathematics; Mixture model; Pattern recognition (psychology); Artificial intelligence; Mathematics; Topic model; Dirichlet series; Mathematical analysis","score_opus":0.056716862866662915,"score_gpt":0.297604837853413,"score_spread":0.2408879749867501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W982949649","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.00057950034,0.0004550826,0.997898,0.00012341504,0.00006435899,0.000022778835,0.00006148702,0.00014130468,0.0006541521],"genre_scores_gemma":[0.08283146,0.002773715,0.8992844,0.00048765342,0.00063485093,0.0008418008,0.0012370999,0.0006814933,0.0112273935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912213,0.0053692535,0.00044177394,0.0012662994,0.001346809,0.00035442805],"domain_scores_gemma":[0.9784742,0.018163888,0.0005394515,0.0015630925,0.0010162276,0.00024313429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009669344,0.0021596826,0.0040119067,0.0020225719,0.0013174019,0.004439743,0.0070815263,0.004114698,0.009880927],"category_scores_gemma":[0.04120371,0.002654757,0.0043875887,0.004038172,0.00259393,0.008122549,0.00435037,0.008370081,0.0040524555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016559837,0.00008614414,0.00046317902,0.00032194887,0.0001968051,0.00013831697,0.00044358792,0.22217605,0.00090073736,0.68557346,0.0053428845,0.08419136],"study_design_scores_gemma":[0.000016386874,0.000013104836,0.00007537538,0.000038242593,0.000037107657,0.00006580015,0.000018396202,0.6856799,0.00025110922,0.31106734,0.0027024567,0.0000347111],"about_ca_topic_score_codex":0.0055055213,"about_ca_topic_score_gemma":0.0059628687,"teacher_disagreement_score":0.009880927,"about_ca_system_score_codex":0.0023911623,"about_ca_system_score_gemma":0.0021985446,"threshold_uncertainty_score":0.05113703},"labels":[],"label_agreement":null},{"id":"W986155606","doi":"10.1007/978-3-319-11743-0_7","title":"Associativity between Weak and Strict Sequencing","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Business Process Modeling and Analysis","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 Ottawa","funders":"","keywords":"Computer science; Workflow; Associative property; Sequence (biology); Notation; Sequence diagram; Theoretical computer science; Semantics (computer science); Programming language; Mathematics; Database; Arithmetic","score_opus":0.026048890719318388,"score_gpt":0.22987640942258464,"score_spread":0.20382751870326626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W986155606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09134251,0.0011395438,0.84417796,0.0011768169,0.0005166301,0.000058607635,0.00035468888,0.00052053836,0.060712688],"genre_scores_gemma":[0.7569461,0.0014622101,0.1974995,0.0010112541,0.0010490253,0.00036843185,0.00076256157,0.00052331423,0.040377747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496126,0.0016335578,0.0007366744,0.0009706864,0.0012032153,0.0004945954],"domain_scores_gemma":[0.9797753,0.010747003,0.0013855951,0.0035625433,0.0034660944,0.0010634542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005082052,0.00066654413,0.00089620764,0.0021134657,0.0020478717,0.003726935,0.0012020333,0.0011991599,0.0067044734],"category_scores_gemma":[0.018089715,0.0009630664,0.0012387802,0.002552505,0.0049721366,0.011296379,0.004563713,0.0033381695,0.0013455381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003378301,0.000009924139,0.0003804667,0.0000406076,0.000008476367,0.000050051196,0.00031686798,0.000626705,0.0006677529,0.9880611,0.0006223055,0.009181922],"study_design_scores_gemma":[0.000005538866,0.000013803254,0.00015471352,0.000019904113,0.000014141993,0.00010548996,0.00008107015,0.0033331816,0.00065047224,0.9907438,0.004864476,0.000013391439],"about_ca_topic_score_codex":0.0010159865,"about_ca_topic_score_gemma":0.0008180337,"teacher_disagreement_score":0.0067044734,"about_ca_system_score_codex":0.001071052,"about_ca_system_score_gemma":0.0013730968,"threshold_uncertainty_score":0.026876807},"labels":[],"label_agreement":null},{"id":"W98672765","doi":"10.1007/978-3-642-29863-9_30","title":"Design of Software Agent-Populated Electronic Negotiation System and Evaluation of Human – to - Agent Negotiations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Multi-Agent Systems and Negotiation","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":"Concordia University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Negotiation; Computer science; Software agent; Common value auction; Software; Process (computing); Set (abstract data type); Knowledge management; Work (physics); Software engineering; Human–computer interaction; Artificial intelligence; Engineering; Operating system","score_opus":0.05295460616486278,"score_gpt":0.2887660391275513,"score_spread":0.2358114329626885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98672765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17927034,0.00028010443,0.8019734,0.00020561373,0.000116070325,0.0017220458,0.00016672416,0.0032821188,0.012983639],"genre_scores_gemma":[0.771815,0.000119833,0.22188422,0.000068402485,0.000017746712,0.0009720243,0.0002587492,0.00016316553,0.004700889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836105,0.0007759505,0.00010229998,0.00021133726,0.0004250747,0.00012419694],"domain_scores_gemma":[0.9985563,0.00044754698,0.00007217953,0.00021184923,0.0005819188,0.00013019603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927883,0.00050004787,0.00070841017,0.0007229714,0.0009035045,0.0018008832,0.0025165381,0.001148843,0.0056151035],"category_scores_gemma":[0.0030007216,0.0004193544,0.00035843372,0.0005564385,0.0005383498,0.0013745781,0.00095009024,0.0005827061,0.0010872394],"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.0038556333,0.002251336,0.00827011,0.0013321638,0.00019693296,0.0010245574,0.0014761664,0.33387288,0.24112964,0.054723583,0.006284816,0.3455822],"study_design_scores_gemma":[0.00020491004,0.0008725932,0.0019003885,0.00003136377,0.00009103484,0.00027598758,0.00022901919,0.8903533,0.09290837,0.0042917314,0.008787144,0.000054106982],"about_ca_topic_score_codex":0.0010653005,"about_ca_topic_score_gemma":0.0006470011,"teacher_disagreement_score":0.0056151035,"about_ca_system_score_codex":0.0008544396,"about_ca_system_score_gemma":0.0014046791,"threshold_uncertainty_score":0.018784404},"labels":[],"label_agreement":null},{"id":"W986923873","doi":"10.1007/978-3-319-21668-3_5","title":"Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"University of Toronto","funders":"","keywords":"Satisfiability; Set (abstract data type); Combinatorics; Intersection (aeronautics); Duality (order theory); Discrete mathematics; Computer science; Computation; Algorithm; Mathematics","score_opus":0.06497413392949586,"score_gpt":0.333500299153706,"score_spread":0.26852616522421013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W986923873","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.036808208,0.00020046555,0.94272,0.00052350474,0.000303343,0.00032042796,0.00041423854,0.007259367,0.011450497],"genre_scores_gemma":[0.23747265,0.00015147166,0.74896157,0.00037400814,0.0000957076,0.00022047236,0.0017752261,0.0023099664,0.008638928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976413,0.00038971903,0.00016504558,0.00039637578,0.001127912,0.00027960865],"domain_scores_gemma":[0.9927192,0.003933344,0.00025320682,0.0017543081,0.0012148788,0.00012499004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016428839,0.0015035878,0.0011826415,0.0022121652,0.0013295239,0.002343498,0.0027787585,0.0010861782,0.016941497],"category_scores_gemma":[0.011798274,0.0010064845,0.002582632,0.0017740839,0.0013698407,0.00472528,0.003468867,0.0038322192,0.0022017611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006958877,0.00039063097,0.0020898245,0.0009292445,0.00016752607,0.0003012741,0.00055697566,0.12651838,0.029045224,0.2284362,0.020503728,0.5903651],"study_design_scores_gemma":[0.00012569425,0.0001511071,0.00049939135,0.00016910028,0.00016075099,0.00019800168,0.00023948823,0.4845383,0.055940066,0.439269,0.018625539,0.00008357263],"about_ca_topic_score_codex":0.003924786,"about_ca_topic_score_gemma":0.010342156,"teacher_disagreement_score":0.016941497,"about_ca_system_score_codex":0.0023971503,"about_ca_system_score_gemma":0.002830961,"threshold_uncertainty_score":0.056674898},"labels":[],"label_agreement":null},{"id":"W98693656","doi":"10.1007/978-3-319-10581-9_15","title":"Deep Learning of Image Features from Unlabeled Data for Multiple Sclerosis Lesion Segmentation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":57,"is_retracted":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":"Artificial intelligence; Computer science; Pattern recognition (psychology); Segmentation; Classifier (UML); Semi-supervised learning; Supervised learning; Image segmentation; Deep learning; Labeled data; Training set; Machine learning; Artificial neural network","score_opus":0.03448078388453218,"score_gpt":0.2677185207841131,"score_spread":0.23323773689958094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98693656","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.08729039,0.0036194434,0.9020673,0.00065313623,0.000110176596,0.00006771704,0.00093941845,0.002696552,0.0025558386],"genre_scores_gemma":[0.69150376,0.0022696776,0.29317424,0.00024542987,0.00016052125,0.00013434596,0.003539575,0.0002830441,0.008689448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983823,0.000028024026,0.0000091936645,0.0000485915,0.00003984537,0.00003614683],"domain_scores_gemma":[0.9996605,0.00013159461,0.000044031152,0.000054336335,0.000090889815,0.000018674855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004874478,0.0006572589,0.0006876299,0.00068236986,0.00022243716,0.0006392992,0.00096586905,0.00088892225,0.0014052411],"category_scores_gemma":[0.0010904829,0.00038043305,0.00084861263,0.00076758966,0.0003087228,0.0007532387,0.000836423,0.0011352866,0.0006621914],"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.00020168732,0.00013336986,0.0018661257,0.00019221219,0.00009898171,0.00008837819,0.000063132444,0.14343433,0.03145001,0.0033480453,0.008347805,0.81077594],"study_design_scores_gemma":[0.000004894497,0.000047701516,0.0009025198,0.000024458393,0.00002037082,0.00006051883,0.000014112555,0.9826841,0.010521326,0.0043280027,0.0013842267,0.000007890076],"about_ca_topic_score_codex":0.004830581,"about_ca_topic_score_gemma":0.00998241,"teacher_disagreement_score":0.004830581,"about_ca_system_score_codex":0.00058785325,"about_ca_system_score_gemma":0.0006124542,"threshold_uncertainty_score":0.009604931},"labels":[],"label_agreement":null},{"id":"W987036772","doi":"10.1007/978-3-642-33275-3_1","title":"Optimal “Anti-Bayesian” Parametric Pattern Classification Using Order Statistics Criteria","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mahalanobis distance; Computer science; Bayesian probability; Classifier (UML); Artificial intelligence; Pattern recognition (psychology); Parametric statistics; Algorithm; Order statistic; Exponential family; Naive Bayes classifier; Mathematics; Machine learning; Statistics; Support vector machine","score_opus":0.03089943873873907,"score_gpt":0.29715494972542816,"score_spread":0.2662555109866891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W987036772","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.009028897,0.00015864563,0.9890286,0.00025514347,0.000028435106,0.000025666988,0.000047140704,0.00019543938,0.001232003],"genre_scores_gemma":[0.37238726,0.0005628195,0.6197534,0.0003676269,0.00031170316,0.0002593687,0.0006790498,0.00035442828,0.0053243428],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963653,0.0015090569,0.00029074337,0.00049166,0.0010715448,0.00027154072],"domain_scores_gemma":[0.9885589,0.007912657,0.0005130417,0.0012806504,0.0014865292,0.0002481899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048208465,0.00089257734,0.0022960398,0.001839889,0.0007468057,0.002720662,0.0025479223,0.002041485,0.0032879112],"category_scores_gemma":[0.02107482,0.0008616516,0.0015721485,0.0018837149,0.00182864,0.0042925347,0.0025711358,0.0022949674,0.0009794707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064479763,0.00021466655,0.0019552947,0.00037657694,0.00016747891,0.0001475317,0.0001865148,0.29894695,0.0062761814,0.22989963,0.0075620157,0.45362237],"study_design_scores_gemma":[0.000013510009,0.000041992887,0.00026142114,0.000013672663,0.0000145106505,0.000052766758,0.000012327015,0.90768343,0.0011081704,0.09021162,0.0005715719,0.000015017887],"about_ca_topic_score_codex":0.0015634432,"about_ca_topic_score_gemma":0.0016496675,"teacher_disagreement_score":0.0048208465,"about_ca_system_score_codex":0.0011871628,"about_ca_system_score_gemma":0.0020156712,"threshold_uncertainty_score":0.02549541},"labels":[],"label_agreement":null},{"id":"W987718657","doi":"10.1007/978-3-642-38067-9_29","title":"A Novel Pattern Rejection Criterion Based on Multiple Classifiers","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Face and Expression Recognition","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":"Concordia University","funders":"","keywords":"Computer science; MNIST database; Pattern recognition (psychology); Classifier (UML); Artificial intelligence; Machine learning; Weighted voting; Heuristic; Support vector machine; Data mining; Artificial neural network; Voting","score_opus":0.02598161920033348,"score_gpt":0.24050233432079937,"score_spread":0.2145207151204659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W987718657","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.0038136896,0.0002903723,0.99453473,0.00006116483,0.00010100449,0.00004743892,0.000025507607,0.00036411185,0.00076204684],"genre_scores_gemma":[0.13262583,0.00046974435,0.85788727,0.00035388098,0.0004997623,0.00025829498,0.00057092716,0.00047398108,0.0068602436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931265,0.0013150532,0.00047243503,0.0009347821,0.0037920608,0.0003591513],"domain_scores_gemma":[0.9919561,0.0026624764,0.00045157198,0.00080799026,0.003838186,0.0002836498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003815293,0.0015233562,0.003670358,0.0022818802,0.0010217158,0.0026622075,0.0042801914,0.003036039,0.0043302393],"category_scores_gemma":[0.009530999,0.00075934303,0.0017452992,0.002173761,0.0009653947,0.0031671727,0.0027114258,0.002267993,0.0032493595],"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.0009778099,0.000321118,0.0015066157,0.00034063353,0.00028202086,0.00022181633,0.00008204497,0.04506192,0.06259709,0.01317395,0.007480246,0.8679548],"study_design_scores_gemma":[0.00004428732,0.00019721517,0.00092659413,0.000027059388,0.00009714768,0.0003758686,0.000020899668,0.97186434,0.016264118,0.005680632,0.004458326,0.000043451026],"about_ca_topic_score_codex":0.0015284364,"about_ca_topic_score_gemma":0.0018683332,"teacher_disagreement_score":0.0043302393,"about_ca_system_score_codex":0.000664892,"about_ca_system_score_gemma":0.0014712961,"threshold_uncertainty_score":0.020177424},"labels":[],"label_agreement":null},{"id":"W98956218","doi":"10.1007/978-3-319-04534-4_9","title":"Learning Bayes Nets for Relational Data with Link Uncertainty","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","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":"Simon Fraser University","funders":"","keywords":"Computer science; Statistical relational learning; Relational database; Bayes' theorem; Bayesian network; Graphical model; Link (geometry); Class (philosophy); Probabilistic logic; Data mining; Table (database); Artificial intelligence; Machine learning; Node (physics); Theoretical computer science; Bayesian probability","score_opus":0.04204477506473377,"score_gpt":0.2685311825210492,"score_spread":0.2264864074563154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98956218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025765852,0.0011542345,0.9944523,0.0002799285,0.000045034274,0.000023558689,0.0002878399,0.00022036492,0.00096018804],"genre_scores_gemma":[0.14107473,0.0043898663,0.8447982,0.00032400512,0.0005987319,0.00028301173,0.0029691183,0.00021642941,0.005345769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966718,0.0014182342,0.0002858813,0.0006380557,0.0008608459,0.0001251817],"domain_scores_gemma":[0.9810682,0.016443068,0.00069756986,0.0010086234,0.00059306243,0.00018935953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006602736,0.001280621,0.001918264,0.0022789845,0.00080485706,0.0039014197,0.002627792,0.002195043,0.004232753],"category_scores_gemma":[0.029325545,0.0018554607,0.0017331607,0.0029945667,0.0014993515,0.008531978,0.0027188666,0.004446545,0.0011930491],"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.00023973598,0.00011955477,0.0032754228,0.0006184243,0.00025397126,0.0002463725,0.0003814168,0.2661012,0.0007734714,0.33530384,0.010115389,0.38257113],"study_design_scores_gemma":[0.000014966107,0.000014175126,0.00023102156,0.0000964074,0.00003555035,0.00007957522,0.000028820814,0.50258505,0.0002926619,0.49354547,0.0030550214,0.000021191474],"about_ca_topic_score_codex":0.0033598887,"about_ca_topic_score_gemma":0.005287851,"teacher_disagreement_score":0.006602736,"about_ca_system_score_codex":0.0015120282,"about_ca_system_score_gemma":0.0013654552,"threshold_uncertainty_score":0.034919024},"labels":[],"label_agreement":null},{"id":"W992239523","doi":"10.1007/978-3-642-39640-3_4","title":"An Incremental Linear Programming Based Tool for Analyzing Gene Expression Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Windsor","funders":"","keywords":"Computer science; Gene expression programming; Genetic programming; Expression (computer science); Linear programming; Data mining; Artificial intelligence; Programming language; Algorithm","score_opus":0.032223727695651336,"score_gpt":0.2999996369015029,"score_spread":0.26777590920585154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W992239523","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.0015385625,0.00004792404,0.97469574,0.000047579077,0.000019618494,0.000060821556,0.00073892943,0.022175122,0.00067561085],"genre_scores_gemma":[0.01572485,0.00005490954,0.97881067,0.00007788872,0.000020276831,0.0002975195,0.0020075806,0.0013437292,0.0016626017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992955,0.00013596768,0.00006475081,0.00016934042,0.00028472865,0.000049690174],"domain_scores_gemma":[0.9978387,0.0016905011,0.000080144026,0.0001484341,0.00019143037,0.000050793027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011865777,0.0012476536,0.0008426934,0.0016331153,0.00051763526,0.0014203158,0.0019206593,0.0005597536,0.01241465],"category_scores_gemma":[0.0034006354,0.00088719826,0.0015726598,0.002063519,0.00035967663,0.0012365133,0.0013032536,0.0020500722,0.0033943309],"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.00033902537,0.00032335808,0.0019841124,0.00048763305,0.00018252683,0.00044463648,0.00017551107,0.05761849,0.018662464,0.011612922,0.040960386,0.8672089],"study_design_scores_gemma":[0.00009879201,0.000093795934,0.0009814617,0.00003348961,0.00008234685,0.00028332917,0.00004897219,0.9366295,0.014812344,0.028466089,0.01843082,0.000039101942],"about_ca_topic_score_codex":0.003351908,"about_ca_topic_score_gemma":0.0075905523,"teacher_disagreement_score":0.01241465,"about_ca_system_score_codex":0.00048628528,"about_ca_system_score_gemma":0.0010912487,"threshold_uncertainty_score":0.041531205},"labels":[],"label_agreement":null},{"id":"W99263416","doi":"10.1007/3-540-44967-1_72","title":"Generation of Fuzzy Membership Function Using Information Theory Measures and Genetic Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":44,"is_retracted":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":"Fuzzy logic; Membership function; Computer science; Algorithm; Function (biology); Artificial intelligence; Mathematics; Fuzzy set","score_opus":0.03468484714571556,"score_gpt":0.22281989722460935,"score_spread":0.18813505007889378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99263416","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.021944541,0.000113183356,0.97512597,0.000052581923,0.000041765015,0.00008721469,0.000030905776,0.00038480267,0.0022189307],"genre_scores_gemma":[0.30975556,0.0000950722,0.6879397,0.000042410786,0.00002159613,0.0001963265,0.00015019935,0.000133364,0.0016657041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996655,0.000068229136,0.000023721092,0.000078501755,0.00012780915,0.00003627536],"domain_scores_gemma":[0.99916244,0.00035795607,0.000043729662,0.00010749123,0.00029871007,0.0000297092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011585999,0.0006558951,0.0011335107,0.0014564479,0.0006993845,0.0009862869,0.0012520953,0.0011925078,0.002326869],"category_scores_gemma":[0.003447596,0.00045451085,0.0011016012,0.0009264541,0.0005101587,0.0010623995,0.00081613514,0.00088499754,0.00045408795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016142872,0.00017132975,0.0008016552,0.00016357945,0.00008995424,0.00015562515,0.00026738676,0.5830793,0.017044833,0.028488444,0.0023872333,0.36718914],"study_design_scores_gemma":[0.000013500939,0.000024808096,0.00011815422,0.000012612301,0.000015832107,0.000028062641,0.000013271461,0.99067503,0.002887326,0.0056979316,0.0005041383,0.000009298522],"about_ca_topic_score_codex":0.002214779,"about_ca_topic_score_gemma":0.0016441983,"teacher_disagreement_score":0.002326869,"about_ca_system_score_codex":0.000802597,"about_ca_system_score_gemma":0.00072888244,"threshold_uncertainty_score":0.007784188},"labels":[],"label_agreement":null},{"id":"W99298009","doi":"10.1007/978-3-642-40763-5_25","title":"Fast Globally Optimal Segmentation of 3D Prostate MRI with Axial Symmetry Prior","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":13,"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":"Canadian Institutes of Health Research; Canada Research Chairs","keywords":"Computation; Algorithm; Regular polygon; Convex optimization; Relaxation (psychology); Mathematical optimization; Segmentation; Computer science; Image segmentation; Mathematics; Artificial intelligence; Geometry","score_opus":0.006455328716453375,"score_gpt":0.2531929846017903,"score_spread":0.24673765588533692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99298009","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.01026726,0.00034904934,0.98692685,0.00012374713,0.000021403468,0.000034972654,0.00015365049,0.0013128563,0.0008101713],"genre_scores_gemma":[0.1273444,0.00041419946,0.8684437,0.00010242403,0.00005463047,0.000100250414,0.0006788366,0.0007060514,0.0021554935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993849,0.00013061409,0.00004332334,0.000111930254,0.00025536248,0.00007392531],"domain_scores_gemma":[0.9992545,0.00029939588,0.00009469704,0.000165315,0.00014001362,0.000046086996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080228277,0.001113724,0.0015852939,0.0012913807,0.00044408566,0.0012551688,0.0010683221,0.001427207,0.0025426005],"category_scores_gemma":[0.0022901194,0.0012100835,0.001349045,0.001342365,0.0005378592,0.0009881817,0.0021137323,0.0011667318,0.0013359777],"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.00086608576,0.000101708945,0.0011826715,0.00049806887,0.00017399147,0.0003225083,0.0002491348,0.24814941,0.1283871,0.012064874,0.00786482,0.6001396],"study_design_scores_gemma":[0.00002814923,0.0000615055,0.0007623951,0.000022023352,0.00002842005,0.00030692015,0.0000301451,0.9699662,0.01887638,0.0074952096,0.0023970809,0.000025578302],"about_ca_topic_score_codex":0.0046672462,"about_ca_topic_score_gemma":0.008567844,"teacher_disagreement_score":0.0046672462,"about_ca_system_score_codex":0.0005952306,"about_ca_system_score_gemma":0.002227407,"threshold_uncertainty_score":0.009280145},"labels":[],"label_agreement":null},{"id":"W993171468","doi":"10.1007/978-3-642-21619-0_71","title":"A Comparison of Children’s and Adults’ Retrieval Performances and Affective Reactions When Using a Conventional Interface and an Information Visualization Interface","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Visualization and Analytics","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":"McGill University","funders":"","keywords":"Visualization; Interface (matter); Information visualization; Computer science; Subject (documents); Human–computer interaction; User interface; Information retrieval; Psychology; World Wide Web; Artificial intelligence","score_opus":0.026679086115622218,"score_gpt":0.32432169139138023,"score_spread":0.29764260527575803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W993171468","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.9980268,0.00008621786,0.00031134498,0.000011931066,0.000009647571,0.00001667073,0.00008388804,0.000017153934,0.0014363574],"genre_scores_gemma":[0.9963463,0.00013221362,0.00085017964,0.000023660781,0.000009785404,0.000045544235,0.00028845106,0.000016866241,0.0022869306],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996283,0.000072408715,0.00003894329,0.000087832384,0.00010379985,0.000068670095],"domain_scores_gemma":[0.99765754,0.0013344473,0.00028575907,0.00010555657,0.0003699941,0.0002466185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064481323,0.00027770246,0.00024656364,0.00035372158,0.00018007452,0.00054924487,0.00021308819,0.00041728336,0.004357303],"category_scores_gemma":[0.0042088716,0.0001490872,0.00028587176,0.00022215418,0.00028899935,0.0005199314,0.0004790659,0.0003600387,0.0007232185],"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.011027842,0.0025098969,0.25027174,0.0012182462,0.0002285409,0.0020988989,0.06780948,0.00047563313,0.49436855,0.0006754619,0.004109784,0.16520593],"study_design_scores_gemma":[0.0001803487,0.007798662,0.9185005,0.00008777724,0.00024567993,0.0022524828,0.018571114,0.0010378915,0.045602188,0.0001910092,0.0054396414,0.000092720795],"about_ca_topic_score_codex":0.0010657756,"about_ca_topic_score_gemma":0.0008230276,"teacher_disagreement_score":0.004357303,"about_ca_system_score_codex":0.00012629357,"about_ca_system_score_gemma":0.00011170049,"threshold_uncertainty_score":0.0145766735},"labels":[],"label_agreement":null},{"id":"W99430847","doi":"10.1007/978-3-319-12418-6_10","title":"A Multi-Objective Evolutionary Algorithm for Improving Multiple Sequence Alignments","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"McGill University","funders":"","keywords":"Computer science; Scalability; Sequence (biology); Evolutionary algorithm; Algorithm; Multiple sequence alignment; Sequence alignment; Data mining; Artificial intelligence; Database; Biology","score_opus":0.016952875170629926,"score_gpt":0.24718207170204728,"score_spread":0.23022919653141735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99430847","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.008818264,0.00039542918,0.98851657,0.000073441384,0.00010479169,0.00009428406,0.000047747533,0.0011141436,0.0008353161],"genre_scores_gemma":[0.02645754,0.00011079884,0.9712927,0.00008726144,0.000040020142,0.00018425213,0.00018452224,0.0002748283,0.0013681204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770606,0.00077889377,0.0001786835,0.0005534082,0.0006212987,0.00016169103],"domain_scores_gemma":[0.9972197,0.0016827992,0.00016781452,0.0002561483,0.0005608426,0.00011268414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042331973,0.0025840963,0.0032114307,0.0024877728,0.0013872114,0.0014402288,0.004213567,0.0040875534,0.0048507764],"category_scores_gemma":[0.0067625507,0.0016702397,0.002283117,0.0032083185,0.0010018889,0.0021885503,0.0023186365,0.0037070273,0.0016392353],"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.00022763395,0.00030345938,0.0006287328,0.00024009301,0.00025823683,0.00014954292,0.00016785828,0.45804018,0.009080615,0.0048593967,0.0033351644,0.5227091],"study_design_scores_gemma":[0.000038144724,0.00007771711,0.00015005401,0.000015650352,0.000031376007,0.000041181513,0.000016444312,0.99538606,0.0013558482,0.0020700574,0.0008059293,0.0000116266065],"about_ca_topic_score_codex":0.0043071886,"about_ca_topic_score_gemma":0.005428552,"teacher_disagreement_score":0.0048507764,"about_ca_system_score_codex":0.0010472224,"about_ca_system_score_gemma":0.0016009148,"threshold_uncertainty_score":0.022387564},"labels":[],"label_agreement":null},{"id":"W995150301","doi":"10.1007/978-3-319-06483-3_11","title":"Use of Ontology and Cluster Ensembles for Geospatial Clustering Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management 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":"Husky Energy (Canada); University of Calgary; Petro-Canada","funders":"","keywords":"Cluster analysis; Geospatial analysis; Computer science; Ontology; Data mining; Consensus clustering; Correlation clustering; Clustering high-dimensional data; Fuzzy clustering; Information retrieval; CURE data clustering algorithm; Artificial intelligence; Geography; Remote sensing","score_opus":0.02788286127351197,"score_gpt":0.25147343388740095,"score_spread":0.22359057261388898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W995150301","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.005959773,0.00019448792,0.99066144,0.00012337812,0.00004389489,0.00002995176,0.0002419968,0.00064527005,0.0020998488],"genre_scores_gemma":[0.08314718,0.0003503944,0.913324,0.00005994581,0.000034990433,0.00010418525,0.0010839035,0.00037852288,0.001516922],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974848,0.0007732964,0.00022157026,0.00036639493,0.0010628599,0.00009113062],"domain_scores_gemma":[0.99681014,0.0014488299,0.00022423347,0.00073597895,0.0006682505,0.000112463975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034893868,0.00057436695,0.00073644053,0.0029832416,0.0013955309,0.0032017773,0.0013378692,0.0006690287,0.0016910189],"category_scores_gemma":[0.0103310235,0.00048871705,0.001823295,0.0043392167,0.000914557,0.0033558735,0.0025648873,0.0015821778,0.00069151644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012112889,0.00019040772,0.008092645,0.00041302235,0.0006423412,0.00032037296,0.0017278219,0.1143607,0.011458978,0.3052403,0.009204861,0.5482274],"study_design_scores_gemma":[0.000012616835,0.00002879832,0.002916524,0.00012215562,0.00015044984,0.00043467124,0.00054387876,0.6710124,0.007502797,0.28358993,0.033618525,0.000067251516],"about_ca_topic_score_codex":0.0069370093,"about_ca_topic_score_gemma":0.012698724,"teacher_disagreement_score":0.0069370093,"about_ca_system_score_codex":0.0013320919,"about_ca_system_score_gemma":0.0015108428,"threshold_uncertainty_score":0.018453896},"labels":[],"label_agreement":null},{"id":"W99745189","doi":"10.1007/978-3-642-31919-8_82","title":"Image Quality Assessment Based on Distortion-Aware Decision Fusion","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Robustness (evolution); Distortion (music); Artificial intelligence; Pattern recognition (psychology); Support vector machine; k-nearest neighbors algorithm; Data mining; Fusion; Machine learning","score_opus":0.038641734135403456,"score_gpt":0.34426668715411357,"score_spread":0.3056249530187101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99745189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032446105,0.001044705,0.9642913,0.00012631588,0.00009089119,0.000059074973,0.000059664722,0.0002876421,0.0015943178],"genre_scores_gemma":[0.60415643,0.0011240973,0.39260408,0.000121596466,0.00013748297,0.000050481172,0.00022560425,0.00007989662,0.0015003214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985575,0.00024485792,0.000096421245,0.00026161518,0.0007433429,0.000096215124],"domain_scores_gemma":[0.9984871,0.0004841931,0.00013880146,0.00014242869,0.000684404,0.00006304842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016554152,0.000850035,0.0012447241,0.0010803337,0.0003083763,0.0013368814,0.0007992846,0.00077175384,0.0011968509],"category_scores_gemma":[0.0039015715,0.00034485466,0.00080997584,0.0008545161,0.00047860737,0.0015119863,0.0010600616,0.0008088609,0.00039247776],"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.0017270952,0.00020229095,0.0030208945,0.00046679314,0.00029741196,0.00021864982,0.0001394318,0.060506634,0.23372239,0.0048455764,0.001662577,0.6931903],"study_design_scores_gemma":[0.000042072817,0.00035118157,0.0049732127,0.000037360755,0.00022796751,0.0005522407,0.000036311536,0.90279114,0.086066425,0.0035751718,0.0012775946,0.000069410824],"about_ca_topic_score_codex":0.0007909743,"about_ca_topic_score_gemma":0.001006905,"teacher_disagreement_score":0.0016554152,"about_ca_system_score_codex":0.00048363305,"about_ca_system_score_gemma":0.00045841865,"threshold_uncertainty_score":0.00875479},"labels":[],"label_agreement":null},{"id":"W99925727","doi":"10.1007/978-3-642-30743-0_12","title":"Considerations on Belief Revision in an Action Theory","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","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":"Computer science; Belief revision; Action (physics); Cognitive science; Artificial intelligence; Psychology","score_opus":0.04010382273079914,"score_gpt":0.28847243365819664,"score_spread":0.24836861092739748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99925727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022741787,0.0064694565,0.5174105,0.04581775,0.001671363,0.00020021717,0.00033914825,0.0002586028,0.40509123],"genre_scores_gemma":[0.82060087,0.0027152933,0.13708496,0.004552246,0.0035337028,0.0007535468,0.00029372732,0.0002215605,0.030244105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901962,0.005563703,0.0006874929,0.0009841544,0.0017826189,0.00078579545],"domain_scores_gemma":[0.97772837,0.01764492,0.00055020535,0.0019147983,0.0014857599,0.0006760055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012634475,0.0012072329,0.0016521999,0.002307146,0.0038156756,0.008373157,0.0045481534,0.008461115,0.0137156295],"category_scores_gemma":[0.022990113,0.0012630335,0.0027955156,0.0018177233,0.013186009,0.01660202,0.0034398085,0.01068769,0.0012445641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010455294,0.000005511928,0.000015727543,0.000016400665,0.0000054942157,0.00001521988,0.00007259689,0.0005318178,0.000027837157,0.99765563,0.00043812694,0.001205165],"study_design_scores_gemma":[0.000007852648,0.0000064145624,0.000019332416,0.000011585071,0.0000041090566,0.000014995113,0.000020252624,0.0014301446,0.00003313307,0.9973923,0.001055039,0.0000047737585],"about_ca_topic_score_codex":0.0031883218,"about_ca_topic_score_gemma":0.0028808822,"teacher_disagreement_score":0.0137156295,"about_ca_system_score_codex":0.0052593704,"about_ca_system_score_gemma":0.0019525943,"threshold_uncertainty_score":0.0668183},"labels":[],"label_agreement":null}]}